Struct compt::dfs_order::CompleteTreeContainer

#[repr(transparent)]
pub struct CompleteTreeContainer<T, D> { /* private fields */ }

Container for a dfs order tree. Internally uses a Vec. Derefs to a CompleteTree.

Implementations

impl<T> CompleteTreeContainer<T, PreOrder>

pub fn from_preorder(
    vec: Vec<T>
) -> Result<CompleteTreeContainer<T, PreOrder>, NotCompleteTreeSizeErr>

impl<T> CompleteTreeContainer<T, InOrder>

pub fn from_inorder(
    vec: Vec<T>
) -> Result<CompleteTreeContainer<T, InOrder>, NotCompleteTreeSizeErr>

impl<T> CompleteTreeContainer<T, PostOrder>

pub fn from_postorder(
    vec: Vec<T>
) -> Result<CompleteTreeContainer<T, PostOrder>, NotCompleteTreeSizeErr>

impl<T, D> CompleteTreeContainer<T, D>

pub fn into_nodes(self) -> Vec<T>

Returns the underlying elements as they are, in BFS order.

Methods from Deref<Target = CompleteTree<T, D>>

pub fn get_height(&self) -> usize

pub fn get_nodes(&self) -> &[T]

pub fn get_nodes_mut(&mut self) -> &mut [T]

pub fn vistr(&self) -> Vistr<'_, T, D>

pub fn vistr_mut(&mut self) -> VistrMut<'_, T, D>

Trait Implementations

impl<T, D> Deref for CompleteTreeContainer<T, D>

type Target = CompleteTree<T, D>

The resulting type after dereferencing.

fn deref(&self) -> &CompleteTree<T, D>

Dereferences the value.

impl<T, D> DerefMut for CompleteTreeContainer<T, D>

fn deref_mut(&mut self) -> &mut CompleteTree<T, D>

Mutably dereferences the value.