splay_tree
A splay tree implementation
Description
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.
Install
copied = false, 2000)"
:class="{ 'border-gray-700': !copied, 'text-gray-100': !copied, 'focus:ring-orange-500': !copied, 'focus:border-orange-500': !copied, 'border-green-600': copied, 'text-green-600': copied, 'focus:ring-green-500': copied, 'focus:border-green-500': copied }">
- Published
- 01 Mar 2019
- Authors
- Maintainers
Sources
Dependencies
dune
>= "1.5.1"
ppx_jane
>= "v0.12" & < "v0.13"
core_kernel
>= "v0.12" & < "v0.13"
ocaml
>= "4.07.0"
Reverse Dependencies
incr_dom_partial_render
< "v0.13.0"
incr_dom_widgets
= "v0.12.0"