|0.3.1||Dec 3, 2022|
|0.2.10||Apr 14, 2018|
|0.2.9||Oct 30, 2017|
|0.2.6||Nov 28, 2016|
#306 in Data structures
780 downloads per month
Used in 33 crates (2 directly)
splay_tree provides data structures such as map, set and heap which are based on an in-place top-down splay tree.
A splay tree is a self-adjusting binary search tree with the additional property that recently accessed elements are quick to access again. It performs basic operations such as insertion, look-up and removal in O(log n) amortized time. - Splay tree (Wikipedia)
The documentation includes some examples.
Add following lines to your
[dependencies] splay_tree = "0.2"
This library is released under the MIT License.
See the LICENSE file for full license information.