Struct MerkleRootCalculator

pub struct MerkleRootCalculator { /* private fields */ }

Implementations

impl MerkleRootCalculator

pub fn new() -> Self

pub fn new_with_stack(stack: Vec<Node>) -> Self

pub fn clear(&mut self)

pub fn push(&mut self, data: &[u8])

Push a new leaf node. Panics if the tree would be too large to compute the root for. In practice this never occurs, as you’d run out of memory first.

pub fn root(self) -> Bytes32

pub fn root_from_iterator<I: Iterator<Item = T>, T: AsRef<[u8]>>( self, iterator: I, ) -> Bytes32

pub fn stack(&self) -> &Vec<Node>

Trait Implementations

impl Clone for MerkleRootCalculator

fn clone(&self) -> MerkleRootCalculator

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for MerkleRootCalculator

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

Formats the value using the given formatter.

impl Default for MerkleRootCalculator

fn default() -> MerkleRootCalculator

Returns the “default value” for a type.

impl PartialEq for MerkleRootCalculator

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