Lib.rs

› Data structures
#binary-search-tree #set #heap #map #splay #structures #access

no-std splay_tree

Splay Tree based Data Structures (map, set, heap)

by Takeru Ohta

15 releases

0.3.1 Dec 3, 2022
0.2.10 Apr 14, 2018
0.2.9 Oct 30, 2017
0.2.6 Nov 28, 2016

#489 in Data structures

Download history 168/week @ 2023-12-17 130/week @ 2023-12-24 64/week @ 2023-12-31 157/week @ 2024-01-07 206/week @ 2024-01-14 250/week @ 2024-01-21 173/week @ 2024-01-28 252/week @ 2024-02-04 241/week @ 2024-02-11 435/week @ 2024-02-18 252/week @ 2024-02-25 208/week @ 2024-03-03 182/week @ 2024-03-10 197/week @ 2024-03-17 226/week @ 2024-03-24 471/week @ 2024-03-31

1,090 downloads per month
Used in 33 crates (2 directly)

MIT license

96KB
2K SLoC

splay_tree

Documentation Build Status Code Coverage License: MIT

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)

Documentation

See RustDoc Documentation.

The documentation includes some examples.

Installation

Add following lines to your Cargo.toml:

[dependencies]
splay_tree = "0.2"

Reference

License

This library is released under the MIT License.

See the LICENSE file for full license information.

Dependencies

~180KB