splay_tree
| Crates.io | splay_tree |
| lib.rs | splay_tree |
| version | 0.3.1 |
| created_at | 2016-08-12 13:44:58.150873+00 |
| updated_at | 2022-12-03 08:25:24.895491+00 |
| description | Splay Tree based Data Structures (map, set, heap) |
| homepage | https://github.com/sile/splay_tree |
| repository | https://github.com/sile/splay_tree |
| max_upload_size | |
| id | 5960 |
| size | 119,635 |
Takeru Ohta (sile)
documentation
README
splay_tree
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
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.