Struct miden_objects::batches::BatchNoteTree

pub struct BatchNoteTree(/* private fields */);

Wrapper over SimpleSmt<BATCH_OUTPUT_NOTES_TREE_DEPTH> for batch note tree.

Each note is stored as two adjacent leaves: odd leaf for id, even leaf for metadata hash.

Implementations

impl BatchNoteTree

pub fn with_contiguous_leaves<'a>( entries: impl IntoIterator<Item = (NoteId, &'a NoteMetadata)>, ) -> Result<Self, MerkleError>

Wrapper around SimpleSmt::with_contiguous_leaves which populates notes at contiguous indices starting at index 0.

Errors

Returns an error if the number of entries exceeds the maximum tree capacity, that is 2^{depth}.

pub fn root(&self) -> RpoDigest

Returns the root of the tree

Trait Implementations

impl Clone for BatchNoteTree

fn clone(&self) -> BatchNoteTree

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for BatchNoteTree

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

Formats the value using the given formatter.

impl PartialEq for BatchNoteTree

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

impl StructuralPartialEq for BatchNoteTree