Skip to content
This repository has been archived by the owner on Mar 13, 2021. It is now read-only.

Latest commit

 

History

History
47 lines (35 loc) · 1.94 KB

README.md

File metadata and controls

47 lines (35 loc) · 1.94 KB
Raw

IMPORTANT: This project is archived and moved into ppom which implements an ephemeral ordered-map, like this one, among other things.

Left Leaning Red Black Tree

Rustdoc Build Status License: AGPL v3

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

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

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

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.

Compatibility policy

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

Useful links

  • Refer to this Wikipedia link for more information on LLRB algorithm.
  • Discussion on the design choice over get() and range() API.