splay_tree
Author | Jane Street Group, LLC <opensource@janestreet.com> | |||||||||||||||||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
License | Apache-2.0 | |||||||||||||||||||||||||
Homepage | https://github.com/janestreet/splay_tree | |||||||||||||||||||||||||
Issue Tracker | https://github.com/janestreet/splay_tree/issues | |||||||||||||||||||||||||
Maintainer | opensource@janestreet.com | |||||||||||||||||||||||||
Dependencies |
| |||||||||||||||||||||||||
Available | ocaml-version >= "4.04.1" | |||||||||||||||||||||||||
Published | Mar 20, 2018 | |||||||||||||||||||||||||
Source [http] | https://ocaml.janestreet.com/ocaml-core/v0.11/files/splay_tree-v0.11.0.tar.gz d6af8d78e638947266b8be21091d03fe | |||||||||||||||||||||||||
Statistics | Installed 3 times last month. | |||||||||||||||||||||||||
Edit | https://github.com/ocaml/opam-repository/tree/master/packages/splay_tree/splay_tree.v0.11.0/opam |
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.
Necessary for | ||
---|---|---|
incr_dom_widgets | ||
>= v0.11.0 |