Struct miden_crypto::merkle::InnerNodeInfo

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

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

Fields

value: RpoDigest

left: RpoDigest

right: RpoDigest

Trait Implementations

impl Clone for InnerNodeInfo

fn clone(&self) -> InnerNodeInfo

Returns a copy 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

Formats the value using the given formatter.

impl<T: KvMap<RpoDigest, StoreNode>> Extend<InnerNodeInfo> for MerkleStore<T>

fn extend<I: IntoIterator<Item = InnerNodeInfo>>(&mut self, iter: I)

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<T: KvMap<RpoDigest, StoreNode>> FromIterator<InnerNodeInfo> for MerkleStore<T>

fn from_iter<I: IntoIterator<Item = InnerNodeInfo>>(iter: I) -> Self

Creates a value from an iterator.

impl PartialEq for InnerNodeInfo

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

This method tests for self and other values to be equal, and is used by ==.

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

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

impl Eq for InnerNodeInfo

impl StructuralEq for InnerNodeInfo

impl StructuralPartialEq for InnerNodeInfo