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
22 Mar 2018
Authors
Maintainers
Sources
splay_tree-v0.11.0.tar.gz
md5=d6af8d78e638947266b8be21091d03fe
Dependencies
ocaml-migrate-parsetree >= "1.0" & < "2.0.0"
jbuilder >= "1.0+beta18.1"
ppx_jane >= "v0.11" & < "v0.12"
core_kernel >= "v0.11" & < "v0.12"
ocaml >= "4.04.1"
Reverse Dependencies
incr_dom_widgets = "v0.11.0"
Conflicts
jbuilder = "1.0+beta19"