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.
Author | Jane Street Group, LLC |
---|---|
License | MIT |
Published | |
Homepage | https://github.com/janestreet/splay_tree |
Issue Tracker | https://github.com/janestreet/splay_tree/issues |
Maintainer | Jane Street developers |
Dependencies | |
Source [http] | https://ocaml.janestreet.com/ocaml-core/v0.16/files/splay_tree-v0.16.0.tar.gz sha256=83a664ad9ce3f325588c418fb6f9bf0c1a846948aeb7bc35d0d11ec726371148 |
Edit | https://github.com/ocaml/opam-repository/tree/master/packages/splay_tree/splay_tree.v0.16.0/opam |
Required by
- incr_dom_interactive=v0.16.0
- incr_dom_partial_render=v0.16.0
- incr_dom_sexp_form=v0.16.0