A collection for tree data structures. It provides APIs that allows users to create memory efficient binary search trees, red-black trees and avl trees.
Name reservation – Project will feature a collection of dependency-free pure rust implementations of tree varaints, such as AVL Tree, TTree and B+ Tree.
A persistent B+ tree using freqfs
An ordered map and set based on a binary search tree.
A contiguous AVL Tree.
A space-efficient representation of sparsely populated bit-matrices.
Vector-buffered tree collection with pre-/post-order, depth-first, mutable/immutable iterator
A very simple, intuitive API for storing data in a tree-like structure.
Some basic (persistent) collections
a code port of BTreeMap but with comparator functions
A fast B-tree implementation ported from tlx library
Trie-like data-structure for storing sequences of values.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.