Struct WalkTree
struct WalkTree<S, B>(_)
ParallelIterator for arbitrary tree-shaped patterns.
Returned by the [walk_tree()] function.
Implementations
impl<S, B> Freeze for WalkTree<S, B>
impl<S, B> RefUnwindSafe for WalkTree<S, B>
impl<S, B> Send for WalkTree<S, B>
impl<S, B> Sync for WalkTree<S, B>
impl<S, B> Unpin for WalkTree<S, B>
impl<S, B> UnsafeUnpin for WalkTree<S, B>
impl<S, B> UnwindSafe for WalkTree<S, B>
impl<S, B, I> ParallelIterator for WalkTree<S, B>
fn drive_unindexed<C>(self: Self, consumer: C) -> <C as >::Result where C: UnindexedConsumer<<Self as >::Item>
impl<S: $crate::fmt::Debug, B: $crate::fmt::Debug> Debug for WalkTree<S, B>
fn fmt(self: &Self, f: &mut Formatter<'_>) -> Result
impl<T> Any for WalkTree<S, B>
fn type_id(self: &Self) -> TypeId
impl<T> Borrow for WalkTree<S, B>
fn borrow(self: &Self) -> &T
impl<T> BorrowMut for WalkTree<S, B>
fn borrow_mut(self: &mut Self) -> &mut T
impl<T> From for WalkTree<S, B>
fn from(t: T) -> TReturns the argument unchanged.
impl<T> IntoParallelIterator for WalkTree<S, B>
fn into_par_iter(self: Self) -> T
impl<T> Pointable for WalkTree<S, B>
unsafe fn init(init: <T as Pointable>::Init) -> usizeunsafe fn deref<'a>(ptr: usize) -> &'a Tunsafe fn deref_mut<'a>(ptr: usize) -> &'a mut Tunsafe fn drop(ptr: usize)
impl<T, U> Into for WalkTree<S, B>
fn into(self: Self) -> UCalls
U::from(self).That is, this conversion is whatever the implementation of
[From]<T> for Uchooses to do.
impl<T, U> TryFrom for WalkTree<S, B>
fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>
impl<T, U> TryInto for WalkTree<S, B>
fn try_into(self: Self) -> Result<U, <U as TryFrom<T>>::Error>