Crate rb_tree

Modules

rbmap

rbqueue

rbtree

Macros

new_c_queue

Allows the creation of a queue using C-like comparison values. That is to say, cmp should return a value less than, equal to, or greater than 0 when l should be placed before, is equal to, or be placed after r respectively.

new_map

Returns an RBMap containing the (key, value) pairs separated by commas.

new_queue

Returns an RBQueue that prioritises on given closure and contains the comma-separated elements following it.

new_set

Returns an RBTree containing the items given separated by commas.

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.