Struct bitstring_trees::map::RadixMap [−][src]
pub struct RadixMap<S: BitString, V> { /* fields omitted */ }
Expand description
RadixMap
is a binary tree with path-shortening; leafs mark
prefixes mapping to a value, inner nodes have no semantic meaning.
If a prefix maps to a value set, all strings prefixed by it are also considered to map to that value.
If an inner node would have only a single child, the paths to and from it could be shortened - therefor all inner nodes have two children.
Implementations
Add a new prefix => value mapping.
As values can’t be compared for equality it cannot merge neighbour prefixes that map to the same value.
Add a new prefix => value mapping. (Partially) overwrites old mappings.
Read-only access to the tree.
An empty map doesn’t have any nodes (i.e. None
).
Iterate over all values in the map
Trait Implementations
Auto Trait Implementations
impl<S, V> RefUnwindSafe for RadixMap<S, V> where
S: RefUnwindSafe,
V: RefUnwindSafe,
impl<S, V> UnwindSafe for RadixMap<S, V> where
S: UnwindSafe,
V: UnwindSafe,
Blanket Implementations
Mutably borrows from an owned value. Read more