Struct Node

pub struct Node<P: Prefixable, D> { /* private fields */ }

Node struct.

Implementations

impl<P: Prefixable, D> Node<P, D>

Node impl.

pub fn new(prefix: &P) -> Node<P, D>

Return new node.

pub fn from_common(prefix1: &P, prefix2: &P) -> Node<P, D>

Return new node with common prefix.

pub fn prefix(&self) -> &P

Return reference to prefix.

pub fn child(&self, bit: Child) -> Option<Rc<Node<P, D>>>

Return one of child node - left(0) or right(1)

pub fn child_with(&self, bit: u8) -> Option<Rc<Node<P, D>>>

Return one of child node - left(0) or right(1)

pub fn has_child_with(&self, bit: u8) -> bool

Return true if child at left or right.

pub fn parent(&self) -> Option<Rc<Node<P, D>>>

Return parent node.

pub fn set_parent(&self, parent: Rc<Node<P, D>>)

Set parent.

pub fn unset_parent(&self)

Unset parent.

pub fn set_data(&self, data: D) -> Option<D>

Set data.

pub fn unset_data(&self) -> Option<D>

Unset data.

pub fn data(&self) -> RefMut<'_, Option<D>>

Return reference to data.

pub fn has_data(&self) -> bool

Return true if node has data.

pub fn is_locked(&self) -> bool

Return true if node has child or data.

pub fn next(&self) -> Option<Rc<Node<P, D>>>

Return next Node. TODO: refactoring

pub fn next_with_data(&self) -> Option<Rc<Node<P, D>>>

Return next Node with data.