#binary-search-tree #heap #map #set #time #splay

no-std splay_tree

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

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

#1874 in Data structures

Download history 81/week @ 2024-11-15 117/week @ 2024-11-22 143/week @ 2024-11-29 165/week @ 2024-12-06 173/week @ 2024-12-13 94/week @ 2024-12-20 81/week @ 2024-12-27 173/week @ 2025-01-03 252/week @ 2025-01-10 267/week @ 2025-01-17 194/week @ 2025-01-24 235/week @ 2025-01-31 339/week @ 2025-02-07 238/week @ 2025-02-14 219/week @ 2025-02-21 170/week @ 2025-02-28

996 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

~155KB