Trait Leaves 

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

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

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

impl Leaves for ()

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

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)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

impl<T: Leaves> Leaves for [T]

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

Implementors

impl Leaves for Array

impl Leaves for Param

impl Leaves for Quantized

A tree of buffers (never trainable, as quantized layers’ tensors) with MLX’s names weight, scales and biases, and quant as a static field: eval(&q), the transforms and save_safetensors take quantized weights directly.