splay_tree

A splay tree implementation
Description

Splay trees are binary search trees that move recently accessed nodes closer to the root for easier access. They have amortized O(log n)-time access for a large enough sequence of primitive operations.

A splay trees may outperform other trees such as red-black trees when recently accessed items are more likely to be accessed in the near future.

Notably, this splay tree implementation is parameterized by a reduction operation which lets you specify an extra accumulator value, which can then be searched by efficiently.

Install
Published
21 Mar 2022
Sources
splay_tree-v0.15.0.tar.gz
sha256=0fa105bb09ea3eae1ec7d81e1326608a502c1bc3af0670afb564a9897efcd2e2
Dependencies
dune
>= "2.0.0"
ppx_jane
>= "v0.15" & < "v0.16"
core
>= "v0.15" & < "v0.16"
ocaml
>= "4.08.0"
Reverse Dependencies