Struct Traverse

pub struct Traverse<'a, T, S> { /* private fields */ }

Implements the traverse algorithms for an immutable reference of a Node.

Implementations

impl<'a, T> Traverse<'a, T, Asynchronous>

pub fn into_sync(self) -> Traverse<'a, T, Synchronous>

Converts the asynchronous traverse into a synchronous one.

impl<'a, T: Sync + Send + 'a> Traverse<'a, T, Asynchronous>

pub async fn for_each<F>(self, f: F)

where F: Fn(&Node<T>) + Sync + Send,

Calls the given closure for each node in the tree rooted by self.

pub async fn map<F, R>(self, f: F) -> TraverseOwned<R, Asynchronous>

where F: Fn(&Node<T>) -> R + Sync + Send, R: Sized + Sync + Send,

Builds a new tree by calling the given closure along the tree rooted by self following the pre-order traversal.

pub async fn reduce<F, R>(self, f: F) -> R

where F: Fn(&Node<T>, Vec<R>) -> R + Sync + Send, R: Sized + Sync + Send,

Calls the given closure along the tree rooted by self, reducing it into a single value.

pub async fn cascade<F, R>(self, base: R, f: F)

where F: Fn(&Node<T>, &R) -> R + Sync + Send, R: Sized + Sync + Send,

Calls the given closure along the tree rooted by self, providing the parent’s data to its children.

impl<'a, T> Traverse<'a, T, Synchronous>

where T: Sync + Send,

pub fn into_async(self) -> Traverse<'a, T, Asynchronous>

impl<'a, T> Traverse<'a, T, Synchronous>

pub fn for_each<F>(self, f: F) -> Self

where F: FnMut(&Node<T>),

Traverses the tree rooted by self in post-order, calling the given closure along the way.

pub fn map<F, R>(self, f: F) -> TraverseOwned<R, Synchronous>

where F: FnMut(&Node<T>) -> R,

Traverses the tree rooted by self in pre-order, building a new tree by calling the given closure along the way.

pub fn reduce<F, R>(self, f: F) -> R

where F: FnMut(&Node<T>, Vec<R>) -> R, R: Sized,

Traverses the tree rooted by self in post-order, calling the given closure along the way and providing its results from children to parent.

pub fn cascade<F, R>(self, base: R, f: F) -> Self

where F: FnMut(&Node<T>, &R) -> R, R: Sized,

Traverses the tree rooted by self in pre-order, calling the given closure along the way and providing its result from parent to children.

impl<'a, T, S> Traverse<'a, T, S>

pub fn node(&self) -> &Node<T>

pub fn pre(self) -> InPre<'a, T, S>

Returns the pre-order traversal entity for the tree.

pub fn post(self) -> InPost<'a, T, S>

Returns the post-order traversal entity for the tree.

Trait Implementations

impl<'a, T, S> From<&'a Node<T>> for Traverse<'a, T, S>

fn from(node: &'a Node<T>) -> Self

Converts to this type from the input type.

impl<'a, T> From<Traverse<'a, T, Asynchronous>> for Traverse<'a, T, Synchronous>

fn from(value: Traverse<'a, T, Asynchronous>) -> Self

Converts to this type from the input type.

impl<'a, T> From<Traverse<'a, T, Synchronous>> for Traverse<'a, T, Asynchronous>

where T: Sync + Send,

fn from(value: Traverse<'a, T, Synchronous>) -> Self

Converts to this type from the input type.