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
LicenseApache-2.0
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.10/files/splay_tree-v0.10.0.tar.gz
sha256=9ea952912c52a269757baa0bf08b060b34edd15c7061c1de60764213ddccae1e
md5=003fb5f4b0fbb71d86f200b9df90abba
Edithttps://github.com/ocaml/opam-repository/tree/master/packages/splay_tree/splay_tree.v0.10.0/opam
Required by