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
30 Dec 2017
Sources
splay_tree-v0.10.0.tar.gz
md5=003fb5f4b0fbb71d86f200b9df90abba
Dependencies
ocaml-migrate-parsetree
>= "0.4" & < "2.0.0"
jbuilder
>= "1.0+beta12"
ppx_jane
>= "v0.10" & < "v0.11"
ppx_driver
>= "v0.10" & < "v0.11"
core_kernel
>= "v0.10" & < "v0.11"
ocaml
>= "4.04.1"
Reverse Dependencies
incr_dom_widgets
< "v0.11.0"