Enum bitstring_trees::map::Node

pub enum Node<S: BitString, V> {
    InnerNode(InnerNode<S, V>),
    Leaf(Leaf<S, V>),
}

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

Variants

InnerNode(InnerNode<S, V>)

Inner node

Leaf(Leaf<S, V>)

Leaf node

Methods

impl<S: BitString + Clone, V> Node<S, V>

fn key(&self) -> &S

The longest shared prefix of all nodes in this sub tree.

Trait Implementations

impl<S: Clone + BitString, V: Clone> Clone for Node<S, V>

fn clone(&self) -> Node<S, V>

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<S: BitString + Debug, V: Debug> Debug for Node<S, V>

fn fmt(&self, f: &mut Formatter) -> Result

Formats the value using the given formatter.