Struct PrePost

pub struct PrePost<'a, T, R, F, S> { /* private fields */ }

Implements both traversals at once.

Implementations

impl<'a, T, R, F> PrePost<'a, T, R, F, Synchronous>

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

pub fn reduce<U, P>(self, base: R, post: P) -> U

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

Traverses the tree calling both associated closures when corresponding. Returns the latest result given by the post closure, which value correspond to the root of the tree.

pub fn map<U, P>(self, base: R, post: P) -> Node<U>

where F: FnMut(&Node<T>, &R) -> R, P: FnMut(&Node<T>, &R, &mut Vec<Node<U>>) -> U,

Traverses the tree in both orders, building a new tree by calling the post closure along the way. Returns the latest result given by the post closure, which value correspond to the root of the tree.