Struct TreeEntry 

#[repr(C, align(4))]
pub struct TreeEntry {
    pub n_nodes: u32,
    pub offset: u32,
}

Tree table entry: metadata for one tree in the ensemble. 8 bytes.

The n_nodes field gives the number of PackedNodes in this tree. The offset field is the byte offset from the start of the node data region to this tree’s first node.

Fields

n_nodes: u32

Number of nodes in this tree.

offset: u32

Byte offset from nodes_base to this tree’s first PackedNode.

Trait Implementations

impl Clone for TreeEntry

fn clone(&self) -> TreeEntry

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for TreeEntry

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

Formats the value using the given formatter.

impl Hash for TreeEntry

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 TreeEntry

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

Tests for self and other values to be equal, and is used by ==.

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

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Copy for TreeEntry

impl Eq for TreeEntry

impl StructuralPartialEq for TreeEntry