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
31 May 2020
Sources
splay_tree-v0.14.0.tar.gz
md5=d00a8015f285764bc719125dc110856c
Dependencies
dune
>= "2.0.0"
ppx_jane
>= "v0.14" & < "v0.15"
core_kernel
>= "v0.14" & < "v0.15"
ocaml
>= "4.08.0"
Reverse Dependencies