A top-down splay tree based data structures (map, set, heap).
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.
The documentation includes some examples.
Add following lines to your Cargo.toml:
toml
[dependencies]
eetf = "0.1"
This library is released under the MIT License.
See the LICENSE file for full license information.