Lib.rs

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

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

#1200 in Data structures

Download history 137/week @ 2024-07-21 213/week @ 2024-07-28 152/week @ 2024-08-04 212/week @ 2024-08-11 94/week @ 2024-08-18 204/week @ 2024-08-25 141/week @ 2024-09-01 131/week @ 2024-09-08 99/week @ 2024-09-15 117/week @ 2024-09-22 172/week @ 2024-09-29 42/week @ 2024-10-06 95/week @ 2024-10-13 87/week @ 2024-10-20 110/week @ 2024-10-27 94/week @ 2024-11-03

392 downloads per month
Used in 34 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

~165KB