Struct tree_layout::TreeLayout

pub struct TreeLayout<D> { /* private fields */ }

Implementations

impl<D> TreeLayout<D>

pub fn new<F, N, T>(user_tree: &T, root: N, data: F) -> Selfwhere F: Fn(&T, N) -> D, N: Clone, T: NodeInfo<N>,

pub fn root(&self) -> Option<usize>

pub fn breadth_first(&self, node: usize) -> Vec<usize>

pub fn post_order(&self, node: usize) -> Vec<usize>

pub fn left_siblings(&self, node: usize) -> Vec<usize>

pub fn siblings_between(&self, left: usize, right: usize) -> Vec<usize>

pub fn previous_sibling(&self, node: usize) -> Option<usize>

pub fn find_parent(&self, node: &TreeNode<D>) -> Option<&TreeNode<D>>

Trait Implementations

impl<D: Clone> Clone for TreeLayout<D>

fn clone(&self) -> TreeLayout<D>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<D: Debug> Debug for TreeLayout<D>

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

Formats the value using the given formatter.

impl<D> Default for TreeLayout<D>

fn default() -> Self

Returns the “default value” for a type.

impl<D> Index<usize> for TreeLayout<D>

type Output = TreeNode<D>

The returned type after indexing.

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

Performs the indexing (container[index]) operation.

impl<D> IndexMut<usize> for TreeLayout<D>

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

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

impl<D> IntoIterator for TreeLayout<D>

type Item = TreeNode<D>

The type of the elements being iterated over.

type IntoIter = IntoIter<TreeNode<D>>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<D: PartialEq> PartialEq for TreeLayout<D>

fn eq(&self, other: &TreeLayout<D>) -> bool

This method tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<D: Eq> Eq for TreeLayout<D>

impl<D> StructuralEq for TreeLayout<D>

impl<D> StructuralPartialEq for TreeLayout<D>