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 <opensource@janestreet.com>
LicenseApache-2.0
Published
Homepagehttps://github.com/janestreet/splay_tree
Issue Trackerhttps://github.com/janestreet/splay_tree/issues
Maintaineropensource@janestreet.com
Dependencies
Conflicts
Source [http] https://ocaml.janestreet.com/ocaml-core/v0.11/files/splay_tree-v0.11.0.tar.gz
md5=d6af8d78e638947266b8be21091d03fe
StatisticsInstalled 6 times last month.
Edithttps://github.com/ocaml/opam-repository/tree/master/packages/splay_tree/splay_tree.v0.11.0/opam
Required by