Skip to main content

Leaves

Trait Leaves 

Source
pub trait Leaves {
    // Required method
    fn visit(&self, v: &mut Visit<'_>);
}
Expand description

Anything whose array leaves can be visited in a fixed order with their paths: owned trees and borrowed views (&T, (&A, &B), [T]). Object-safe.

Required Methods§

Source

fn visit(&self, v: &mut Visit<'_>)

Reports every leaf (and child tree, enum variant, mode flag and static field) to v, in order.

Dyn Compatibility§

This trait is dyn compatible.

In older versions of Rust, dyn compatibility was called "object safety".

Implementations on Foreign Types§

Source§

impl Leaves for ()

Source§

fn visit(&self, _: &mut Visit<'_>)

Source§

impl<A: Leaves, B: Leaves, C: Leaves, D: Leaves, E: Leaves, F: Leaves, G: Leaves, H: Leaves> Leaves for (A, B, C, D, E, F, G, H)

Source§

fn visit(&self, v: &mut Visit<'_>)

Source§

impl<A: Leaves, B: Leaves, C: Leaves, D: Leaves, E: Leaves, F: Leaves, G: Leaves> Leaves for (A, B, C, D, E, F, G)

Source§

fn visit(&self, v: &mut Visit<'_>)

Source§

impl<A: Leaves, B: Leaves, C: Leaves, D: Leaves, E: Leaves, F: Leaves> Leaves for (A, B, C, D, E, F)

Source§

fn visit(&self, v: &mut Visit<'_>)

Source§

impl<A: Leaves, B: Leaves, C: Leaves, D: Leaves, E: Leaves> Leaves for (A, B, C, D, E)

Source§

fn visit(&self, v: &mut Visit<'_>)

Source§

impl<A: Leaves, B: Leaves, C: Leaves, D: Leaves> Leaves for (A, B, C, D)

Source§

fn visit(&self, v: &mut Visit<'_>)

Source§

impl<A: Leaves, B: Leaves, C: Leaves> Leaves for (A, B, C)

Source§

fn visit(&self, v: &mut Visit<'_>)

Source§

impl<A: Leaves, B: Leaves> Leaves for (A, B)

Source§

fn visit(&self, v: &mut Visit<'_>)

Source§

impl<A: Leaves> Leaves for (A,)

Source§

fn visit(&self, v: &mut Visit<'_>)

Source§

impl<T: ?Sized> Leaves for PhantomData<T>

Source§

fn visit(&self, _: &mut Visit<'_>)

Source§

impl<T: Leaves + ?Sized> Leaves for &T

Source§

fn visit(&self, v: &mut Visit<'_>)

Source§

impl<T: Leaves + ?Sized> Leaves for &mut T

Source§

fn visit(&self, v: &mut Visit<'_>)

Source§

impl<T: Leaves, S: 'static> Leaves for HashMap<String, T, S>

Source§

fn visit(&self, v: &mut Visit<'_>)

Source§

impl<T: Leaves, const N: usize> Leaves for [T; N]

Source§

fn visit(&self, v: &mut Visit<'_>)

Source§

impl<T: Leaves> Leaves for BTreeMap<String, T>

Source§

fn visit(&self, v: &mut Visit<'_>)

Source§

impl<T: Leaves> Leaves for Box<T>

Source§

fn visit(&self, v: &mut Visit<'_>)

Source§

impl<T: Leaves> Leaves for Option<T>

Source§

fn visit(&self, v: &mut Visit<'_>)

Source§

impl<T: Leaves> Leaves for Vec<T>

Source§

fn visit(&self, v: &mut Visit<'_>)

Source§

impl<T: Leaves> Leaves for [T]

Source§

fn visit(&self, v: &mut Visit<'_>)

Implementors§