Struct InnerNodeInfo 

pub struct InnerNodeInfo {
    pub value: Word,
    pub left: Word,
    pub right: Word,
}

Representation of a node with two children used for iterating over containers.

Fields

value: Word

left: Word

right: Word

Trait Implementations

impl Clone for InnerNodeInfo

fn clone(&self) -> InnerNodeInfo

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for InnerNodeInfo

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

Formats the value using the given formatter.

impl Extend<InnerNodeInfo> for MerkleStore

fn extend<I>(&mut self, iter: I)

where I: IntoIterator<Item = InnerNodeInfo>,

Extends a collection with the contents of an iterator.

fn extend_one(&mut self, item: A)

🔬This is a nightly-only experimental API. (extend_one)

Extends a collection with exactly one element.

fn extend_reserve(&mut self, additional: usize)

🔬This is a nightly-only experimental API. (extend_one)

Reserves capacity in a collection for the given number of additional elements.

impl FromIterator<InnerNodeInfo> for MerkleStore

fn from_iter<I>(iter: I) -> MerkleStore

where I: IntoIterator<Item = InnerNodeInfo>,

Creates a value from an iterator.

impl PartialEq for InnerNodeInfo

fn eq(&self, other: &InnerNodeInfo) -> 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 Eq for InnerNodeInfo

impl StructuralPartialEq for InnerNodeInfo