Struct compt::dfs_order::VistrMut

#[repr(transparent)]
pub struct VistrMut<'a, T: 'a, D> { /* fields omitted */ }

Tree visitor that returns a mutable reference to each element in the tree.

Methods

impl<'a, T: 'a, D> VistrMut<'a, T, D>

pub fn create_wrap_mut(&mut self) -> VistrMut<T, D>

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

pub fn into_slice(self) -> &'a mut [T]

Methods from Deref<Target = Vistr<'a, T, D>>

pub fn create_wrap(&self) -> Vistr<T, D>

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

Trait Implementations

impl<'a, T: 'a> FixedDepthVisitor for VistrMut<'a, T, PreOrder>

impl<'a, T: 'a> FixedDepthVisitor for VistrMut<'a, T, InOrder>

impl<'a, T: 'a> FixedDepthVisitor for VistrMut<'a, T, PostOrder>

impl<'a, T: 'a> Visitor for VistrMut<'a, T, PreOrder>

type Item = &'a mut T

The common item produced for both leafs and non leafs.

fn next(self) -> (Self::Item, Option<[Self; 2]>)

Consume this visitor, and produce the element it was pointing to along with it's children visitors.

fn level_remaining_hint(&self) -> (usize, Option<usize>)

Return the levels remaining including the one that will be produced by consuming this iterator. So if you first made this object from the root for a tree of size 5, it should return 5. Think of is as height-depth. This is used to make good allocations when doing dfs and bfs. Defaults to (0,None)

fn dfs_preorder(self, func: impl FnMut(Self::Item))

Calls the closure in dfs preorder (root,left,right). Takes advantage of the callstack to do dfs.

fn with_depth(self, start_depth: Depth) -> LevelIter<Self>

Iterator Adapter to also produce the depth each iteration.

fn zip<F: Visitor>(self, f: F) -> Zip<Self, F>

Combine two tree visitors.

fn map<B, F: Fn(Self::Item) -> B>(self, func: F) -> Map<Self, F>

Map iterator adapter

fn take(self, num: usize) -> Take<Self>

Only produce children up to num.

fn flip(self) -> Flip<Self>

Flips left and right children.

Important traits for DfsPreOrderIter<C>

impl<C: Visitor> Iterator for DfsPreOrderIter<C> type Item = C::Item;

fn dfs_preorder_iter(self) -> DfsPreOrderIter<Self>

Provides a dfs preorder iterator. Unlike the callback version, This one relies on dynamic allocation for its stack.

Important traits for DfsInOrderIter<C>

impl<C: Visitor> Iterator for DfsInOrderIter<C> type Item = C::Item;

fn dfs_inorder_iter(self) -> DfsInOrderIter<Self>

fn dfs_inorder(self, func: impl FnMut(Self::Item))

Calls the closure in dfs preorder (left,right,root). Takes advantage of the callstack to do dfs.

fn dfs_postorder(self, func: impl FnMut(Self::Item))

Calls the closure in dfs preorder (left,right,root). Takes advantage of the callstack to do dfs.

impl<'a, T: 'a> Visitor for VistrMut<'a, T, InOrder>

type Item = &'a mut T

The common item produced for both leafs and non leafs.

fn next(self) -> (Self::Item, Option<[Self; 2]>)

Consume this visitor, and produce the element it was pointing to along with it's children visitors.

fn level_remaining_hint(&self) -> (usize, Option<usize>)

Return the levels remaining including the one that will be produced by consuming this iterator. So if you first made this object from the root for a tree of size 5, it should return 5. Think of is as height-depth. This is used to make good allocations when doing dfs and bfs. Defaults to (0,None)

fn dfs_inorder(self, func: impl FnMut(Self::Item))

Calls the closure in dfs preorder (root,left,right). Takes advantage of the callstack to do dfs.

fn with_depth(self, start_depth: Depth) -> LevelIter<Self>

Iterator Adapter to also produce the depth each iteration.

fn zip<F: Visitor>(self, f: F) -> Zip<Self, F>

Combine two tree visitors.

fn map<B, F: Fn(Self::Item) -> B>(self, func: F) -> Map<Self, F>

Map iterator adapter

fn take(self, num: usize) -> Take<Self>

Only produce children up to num.

fn flip(self) -> Flip<Self>

Flips left and right children.

Important traits for DfsPreOrderIter<C>

impl<C: Visitor> Iterator for DfsPreOrderIter<C> type Item = C::Item;

fn dfs_preorder_iter(self) -> DfsPreOrderIter<Self>

Provides a dfs preorder iterator. Unlike the callback version, This one relies on dynamic allocation for its stack.

Important traits for DfsInOrderIter<C>

impl<C: Visitor> Iterator for DfsInOrderIter<C> type Item = C::Item;

fn dfs_inorder_iter(self) -> DfsInOrderIter<Self>

fn dfs_preorder(self, func: impl FnMut(Self::Item))

Calls the closure in dfs preorder (root,left,right). Takes advantage of the callstack to do dfs.

fn dfs_postorder(self, func: impl FnMut(Self::Item))

Calls the closure in dfs preorder (left,right,root). Takes advantage of the callstack to do dfs.

impl<'a, T: 'a> Visitor for VistrMut<'a, T, PostOrder>

type Item = &'a mut T

The common item produced for both leafs and non leafs.

fn next(self) -> (Self::Item, Option<[Self; 2]>)

Consume this visitor, and produce the element it was pointing to along with it's children visitors.

fn level_remaining_hint(&self) -> (usize, Option<usize>)

Return the levels remaining including the one that will be produced by consuming this iterator. So if you first made this object from the root for a tree of size 5, it should return 5. Think of is as height-depth. This is used to make good allocations when doing dfs and bfs. Defaults to (0,None)

fn dfs_postorder(self, func: impl FnMut(Self::Item))

Calls the closure in dfs preorder (root,left,right). Takes advantage of the callstack to do dfs.

fn with_depth(self, start_depth: Depth) -> LevelIter<Self>

Iterator Adapter to also produce the depth each iteration.

fn zip<F: Visitor>(self, f: F) -> Zip<Self, F>

Combine two tree visitors.

fn map<B, F: Fn(Self::Item) -> B>(self, func: F) -> Map<Self, F>

Map iterator adapter

fn take(self, num: usize) -> Take<Self>

Only produce children up to num.

fn flip(self) -> Flip<Self>

Flips left and right children.

Important traits for DfsPreOrderIter<C>

impl<C: Visitor> Iterator for DfsPreOrderIter<C> type Item = C::Item;

fn dfs_preorder_iter(self) -> DfsPreOrderIter<Self>

Provides a dfs preorder iterator. Unlike the callback version, This one relies on dynamic allocation for its stack.

Important traits for DfsInOrderIter<C>

impl<C: Visitor> Iterator for DfsInOrderIter<C> type Item = C::Item;

fn dfs_inorder_iter(self) -> DfsInOrderIter<Self>

fn dfs_preorder(self, func: impl FnMut(Self::Item))

Calls the closure in dfs preorder (root,left,right). Takes advantage of the callstack to do dfs.

fn dfs_inorder(self, func: impl FnMut(Self::Item))

Calls the closure in dfs preorder (left,right,root). Takes advantage of the callstack to do dfs.

impl<'a, T, D> Deref for VistrMut<'a, T, D>

type Target = Vistr<'a, T, D>

The resulting type after dereferencing.

fn deref(&self) -> &Vistr<'a, T, D>

Dereferences the value.