[−][src]Crate rb_tree
Modules
rbmap | |
rbqueue | |
rbtree |
Macros
rbqueue_c_new | Allows the creation of a queue using C-like
comparison values. That is to say, |
Structs
RBMap | A map implemented using a red black tree to store key-value pairs. |
RBQueue | A priority queue implemented using a red black tree. The ordering supplied must satisfy the assymetry and transitivity rules as outlined by the dorumentation of std::cmp::PartialOrd. |
RBTree | A red black tree that can be used to store elements sorted by their PartialOrd provided ordering. |