Struct rtable::tree::Tree

pub struct Tree<P: Prefixable, D> { /* fields omitted */ }

Tree struct.

Methods

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

Tree impl.

pub fn new() -> Tree<P, D>

Constructor.

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

Return top node.

pub fn count(&self) -> usize

Return count with data.

Important traits for NodeIterator<P, D>

impl<P: Prefixable, D> Iterator for NodeIterator<P, D> type Item = Rc<Node<P, D>>;

pub fn get_node(&mut self, prefix: &P) -> NodeIterator<P, D>

Get node with given prefix, create one if it doesn't exist.

pub fn insert(&mut self, prefix: &P, data: D) -> Option<D>

Insert data with given prefix, and return:

• Some(data) if data already exist with the prefix.
• None if successfully inserted the data.

pub fn update(&mut self, prefix: &P, data: D) -> Option<D>

Update data with given prefix, and return:

• old data if data exists and successfully replace.
• None if data does not exist, and replace does not occur.

pub fn upsert(&mut self, prefix: &P, data: D) -> Option<D>

Insert if data does not exist, or Update, and return:

• old data if data exists and successfully replace.
• None if data does not exist.

pub fn delete(&mut self, prefix: &P) -> Option<D>

Delete data with the prefix if data exist, and return:

• old data if data exists and successfully delete.
• None if data does not exist.

Important traits for NodeIterator<P, D>

impl<P: Prefixable, D> Iterator for NodeIterator<P, D> type Item = Rc<Node<P, D>>;

pub fn lookup_exact(&self, prefix: &P) -> NodeIterator<P, D>

Perform exact match lookup.

Important traits for NodeIterator<P, D>

impl<P: Prefixable, D> Iterator for NodeIterator<P, D> type Item = Rc<Node<P, D>>;

pub fn lookup(&self, prefix: &P) -> NodeIterator<P, D>

Perform longest match lookup.

Important traits for NodeIterator<P, D>

impl<P: Prefixable, D> Iterator for NodeIterator<P, D> type Item = Rc<Node<P, D>>;

pub fn erase(&mut self, it: NodeIterator<P, D>) -> NodeIterator<P, D>

Erase a node from tree, and return iterator for next node.

Important traits for NodeIterator<P, D>

impl<P: Prefixable, D> Iterator for NodeIterator<P, D> type Item = Rc<Node<P, D>>;

pub fn node_iter(&self) -> NodeIterator<P, D>

Return node iterator.

Trait Implementations

impl<'_, P: Prefixable, D> IntoIterator for &'_ Tree<P, D>

Tree IntoIterator.

type Item = Rc<Node<P, D>>

The type of the elements being iterated over.

type IntoIter = DataIterator<P, D>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.