Struct Tree

pub struct Tree<T> { /* private fields */ }

An n-ary index-based tree.

Implementations

impl<T> Tree<T>

pub fn new() -> Tree<T>

Creates an empty tree.

pub fn len(&self) -> usize

The number of nodes in the tree.

pub fn is_empty(&self) -> bool

Returns true iff the tree is empty.

pub fn root(&self) -> Option<&Node<T>>

Returns this tree’s root, or None if it is empty.

pub fn get(&self, idx: usize) -> Option<&Node<T>>

Gets a node by it’s index.

pub fn node_iter<'a>(&'a self, start: &'a Node<T>) -> NodeIter<'_, T>

Iterates a subtree starting from a given node. Order is not guaranteed.

pub fn node_iter_with_skip<'a>( &'a self, start: &'a Node<T>, skip: Vec<usize>, ) -> NodeIter<'_, T>

Iterates a subtree, skipping indices contained in skip.

pub fn iter(&self) -> NodeIter<'_, T>

Returns a node iterator starting from the tree’s root. Order is not guaranteed.

pub fn insert(&mut self, item: T, parent_idx: Option<usize>) -> usize

Inserts a new value in this tree as a child of the parent_idx node.

Trait Implementations

impl<T: Debug> Debug for Tree<T>

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

Formats the value using the given formatter.

impl<T> Default for Tree<T>

fn default() -> Self

Returns the “default value” for a type.

impl<Idx: SliceIndex<[Node<T>]>, T> Index<Idx> for Tree<T>

type Output = <Idx as SliceIndex<[Node<T>]>>::Output

The returned type after indexing.

fn index(&self, index: Idx) -> &Self::Output

Performs the indexing (container[index]) operation.

impl<Idx: SliceIndex<[Node<T>]>, T> IndexMut<Idx> for Tree<T>

fn index_mut(&mut self, index: Idx) -> &mut Self::Output

Performs the mutable indexing (container[index]) operation.

impl<'a, T> IntoIterator for &'a Tree<T>

type Item = &'a Node<T>

The type of the elements being iterated over.

type IntoIter = NodeIter<'a, T>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.