Struct `ReverseTraverse`

struct ReverseTraverse<'a, T: 'a> { ... }

An iterator of the start and end edges of a given node and its descendants, in reverse tree order.

Implementations

`impl<'a, T> Freeze for ReverseTraverse<'a, T>`

`impl<'a, T> Iterator for ReverseTraverse<'a, T>`

fn next(self: &mut Self) -> Option<NodeEdge<&'a Node<'a, T>>>

`impl<'a, T> RefUnwindSafe for ReverseTraverse<'a, T>`

`impl<'a, T> Send for ReverseTraverse<'a, T>`

`impl<'a, T> Sync for ReverseTraverse<'a, T>`

`impl<'a, T> Unpin for ReverseTraverse<'a, T>`

`impl<'a, T> UnwindSafe for ReverseTraverse<'a, T>`

`impl<'a, T: $crate::fmt::Debug + 'a> Debug for ReverseTraverse<'a, T>`

fn fmt(self: &Self, f: &mut $crate::fmt::Formatter<'_>) -> $crate::fmt::Result

`impl<I> IntoIterator for ReverseTraverse<'a, T>`

fn into_iter(self: Self) -> I

`impl<T> Any for ReverseTraverse<'a, T>`

fn type_id(self: &Self) -> TypeId

`impl<T> Borrow for ReverseTraverse<'a, T>`

fn borrow(self: &Self) -> &T

`impl<T> BorrowMut for ReverseTraverse<'a, T>`

fn borrow_mut(self: &mut Self) -> &mut T

`impl<T> From for ReverseTraverse<'a, T>`

fn from(t: T) -> T: Returns the argument unchanged.

`impl<T, U> Into for ReverseTraverse<'a, T>`

fn into(self: Self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of [From]<T> for U chooses to do.

`impl<T, U> TryFrom for ReverseTraverse<'a, T>`

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

`impl<T, U> TryInto for ReverseTraverse<'a, T>`

fn try_into(self: Self) -> Result<U, <U as TryFrom<T>>::Error>