Struct diem_types::proof::accumulator::mock::MockTransactionAccumulator

pub struct MockTransactionAccumulator { /* private fields */ }

An immutable transaction accumulator (not a summary, since it stores all leaf nodes and caches internal nodes) that allows for easily computing root hashes, consistency proofs, etc… at any versions in the range 0..=self.version().

This implementation intentionally eschews the existing storage implementation and Position APIs to be as different as possible so we can better guarantee correctness across implementations. Here, we mostly use “naive” recursive algorithms (with internal caches).

Note: intended for test-only code; panics whenever something goes wrong.

Implementations

impl MockTransactionAccumulator

pub fn from_leaves(leaves: Vec<HashValue>) -> Self

Create a full transaction accumulator from a list of leaf node hashes.

pub fn with_version(version: Version) -> Self

Create an accumulator with some mock leaf hash values at the given version.

pub fn version(&self) -> Version

pub fn get_root_hash(&self, version: Version) -> HashValue

Get the accumulator root hash at a specific version. Note that this method has the side effect of seeding the parent<->child caches.

pub fn get_accumulator_summary( &self, version: Version ) -> TransactionAccumulatorSummary

pub fn get_consistency_proof( &self, start_version: Option<Version>, end_version: Version ) -> AccumulatorConsistencyProof

Trait Implementations

impl Clone for MockTransactionAccumulator

fn clone(&self) -> MockTransactionAccumulator

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for MockTransactionAccumulator

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

Formats the value using the given formatter.