Struct compt::dfs_order::CompleteTreeContainer
source · #[repr(transparent)]pub struct CompleteTreeContainer<T, D> { /* private fields */ }
Expand description
Container for a dfs order tree. Internally uses a Vec. Derefs to a CompleteTree.
Implementations§
source§impl<T> CompleteTreeContainer<T, PreOrder>
impl<T> CompleteTreeContainer<T, PreOrder>
pub fn from_preorder(
vec: Vec<T>
) -> Result<CompleteTreeContainer<T, PreOrder>, NotCompleteTreeSizeErr>
source§impl<T> CompleteTreeContainer<T, InOrder>
impl<T> CompleteTreeContainer<T, InOrder>
pub fn from_inorder(
vec: Vec<T>
) -> Result<CompleteTreeContainer<T, InOrder>, NotCompleteTreeSizeErr>
source§impl<T> CompleteTreeContainer<T, PostOrder>
impl<T> CompleteTreeContainer<T, PostOrder>
pub fn from_postorder(
vec: Vec<T>
) -> Result<CompleteTreeContainer<T, PostOrder>, NotCompleteTreeSizeErr>
source§impl<T, D> CompleteTreeContainer<T, D>
impl<T, D> CompleteTreeContainer<T, D>
sourcepub fn into_nodes(self) -> Vec<T>
pub fn into_nodes(self) -> Vec<T>
Returns the underlying elements as they are, in BFS order.
Methods from Deref<Target = CompleteTree<T, D>>§
Trait Implementations§
source§impl<T, D> Deref for CompleteTreeContainer<T, D>
impl<T, D> Deref for CompleteTreeContainer<T, D>
§type Target = CompleteTree<T, D>
type Target = CompleteTree<T, D>
The resulting type after dereferencing.
source§fn deref(&self) -> &CompleteTree<T, D>
fn deref(&self) -> &CompleteTree<T, D>
Dereferences the value.
source§impl<T, D> DerefMut for CompleteTreeContainer<T, D>
impl<T, D> DerefMut for CompleteTreeContainer<T, D>
source§fn deref_mut(&mut self) -> &mut CompleteTree<T, D>
fn deref_mut(&mut self) -> &mut CompleteTree<T, D>
Mutably dereferences the value.