Module bitstring_trees::map

map of bit strings prefixes to values

Structs

InnerNode	Inner node with two direct children.
Iter	Iterate over tree
IterFull	Iterate over tree
Leaf	Leaf nodes represent prefixes part of the set
RadixMap	RadixMap is a binary tree with path-shortening; leafs mark prefixes mapping to a value, inner nodes have no semantic meaning.

Enums

Node	Nodes of a RadixMap can be either an InnerNode (with two children) or a leaf node.