Struct TreeDef 

pub struct TreeDef { /* private fields */ }

The structure of a tree: its root type, the ordered (path, kind, trainable) of every leaf, the active enum variants, the mode flags and a hash of the static fields. Equal structures have equal TreeDefs (see the module documentation).

Implementations

impl TreeDef

pub fn of<T: Leaves + ?Sized + 'static>(tree: &T) -> Self

The structure of tree.

pub fn type_name(&self) -> &'static str

The name of the root type.

pub fn leaves(&self) -> impl Iterator<Item = (&str, LeafKind, bool)>

The leaves: path, kind and whether trainable, in order.

pub fn len(&self) -> usize

The number of leaves.

pub fn is_empty(&self) -> bool

Whether the tree has no leaves.

pub fn difference(&self, other: &TreeDef) -> Option<String>

The first difference from other, described for error messages (None if equal).

Trait Implementations

impl Clone for TreeDef

fn clone(&self) -> Self

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for TreeDef

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

Formats the value using the given formatter.

impl Eq for TreeDef

impl Hash for TreeDef

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl PartialEq for TreeDef

fn eq(&self, other: &Self) -> bool

Equality operator ==.

fn ne(&self, other: &Rhs) -> bool

Inequality operator !=.

impl StructuralPartialEq for TreeDef