Struct bitstring_trees::map::InnerNode

pub struct InnerNode<S: BitString, V> { /* fields omitted */ }

Inner node with two direct children.

Methods

impl<S: BitString, V> InnerNode<S, V>

fn key(&self) -> &S

The longest shared prefix of the two contained child nodes.

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

The left branch; all prefixes in this sub tree have a false bit after self.key().

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

The left branch; all prefixes in this sub tree have a true bit after self.key().

Trait Implementations

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

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

Returns a copy of the value.

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

Performs copy-assignment from source.

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

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

Formats the value using the given formatter.