Lib.rs

› Data structures
#tree #heap #map #splaytrees

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

#306 in Data structures

Download history 351/week @ 2022-12-07 225/week @ 2022-12-14 258/week @ 2022-12-21 237/week @ 2022-12-28 190/week @ 2023-01-04 231/week @ 2023-01-11 229/week @ 2023-01-18 352/week @ 2023-01-25 371/week @ 2023-02-01 237/week @ 2023-02-08 374/week @ 2023-02-15 460/week @ 2023-02-22 229/week @ 2023-03-01 188/week @ 2023-03-08 200/week @ 2023-03-15 144/week @ 2023-03-22

780 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

~215KB