Left Leaning Red Black Tree

This package implements LLRB, Left Leaning Red Black, tree a popular data structured, with following features:

• [x] Self-balancing data structure.
• [x] Optimized for in-memory index.
• [x] Each entry in LLRB instance correspond to a {Key, Value} pair.
• [x] Parametrised over Key type and Value type.
• [x] CRUD operations, via set(), get(), delete() API.
• [x] Read optimized.
• [x] Full table scan, to iterate over all entries.
• [x] Range scan, to iterate between a low and high.
• [x] Reverse iteration.

Note that this implementation of LLRB do not provide durability gaurantee and not thread safe.

Refer to this Wikipedia link for more information on LLRB algorithm.

Licensing

Default license for llrb-index is [AGPL-3.0 license]. For re-licensing this source, you can either contact the author(s) directly or post your request here [#1][#1].

Compatibility policy

llrb-index shall officially support the latest version of rust stable compiler and nightly builds.

Useful links