splay_treeversion

A splay tree implementation

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.

AuthorJane Street Group, LLC
LicenseMIT
Published
Homepagehttps://github.com/janestreet/splay_tree
Issue Trackerhttps://github.com/janestreet/splay_tree/issues
MaintainerJane Street developers
Dependencies
Source [http] https://ocaml.janestreet.com/ocaml-core/v0.12/files/splay_tree-v0.12.0.tar.gz
sha256=b9f117b45197efa436cb59660150dde41e9c1c7cfaae793ce9ec99e138d6f2e9
md5=364587a772dc8c2fd81ef9d326eb2592
Edithttps://github.com/ocaml/opam-repository/tree/master/packages/splay_tree/splay_tree.v0.12.0/opam
Required by