Struct MerkleizedBatch 

pub struct MerkleizedBatch<'a, H: Hasher, P: Readable<H::Digest>, Item> { /* private fields */ }

A speculative batch whose root digest has been computed, in contrast to UnmerkleizedBatch.

Implementations

impl<'a, H: Hasher, P: Readable<H::Digest>, Item> MerkleizedBatch<'a, H, P, Item>

pub fn root(&self) -> H::Digest

Return the root digest of the authenticated journal after this batch is applied.

impl<'a, H: Hasher, P: Readable<H::Digest>, Item: Send + Sync + Encode> MerkleizedBatch<'a, H, P, Item>

pub fn new_batch(&self) -> UnmerkleizedBatch<'_, H, Self, Item>

Create a new speculative batch of operations with this batch as its parent.

impl<'a, H: Hasher, P, Item: Send + Sync> MerkleizedBatch<'a, H, P, Item>

where P: Readable<H::Digest> + BatchChainInfo<H::Digest> + BatchChain<Item>,

pub fn finalize(self) -> Changeset<H::Digest, Item>

Consume this batch, collecting the changes from its ancestors and itself into a Changeset which can be applied to the journal.

Trait Implementations

impl<'a, H: Hasher, P: Readable<H::Digest> + BatchChain<Item>, Item: Send + Sync> BatchChain<Item> for MerkleizedBatch<'a, H, P, Item>

fn collect(&self, into: &mut Vec<Arc<Vec<Item>>>)

Collect the items from the deepest ancestor batch up to and including the current batch in append order.

impl<'a, H: Hasher, P: Readable<H::Digest> + BatchChainInfo<H::Digest>, Item: Send + Sync> BatchChainInfo<<H as Hasher>::Digest> for MerkleizedBatch<'a, H, P, Item>

fn base_size(&self) -> Position

Number of nodes in the original MMR that the batch chain was forked from. This is constant through the entire chain.

fn collect_overwrites(&self, into: &mut BTreeMap<Position, H::Digest>)

Collect all overwrites that target nodes in the original MMR (i.e. positions < base_size()), walking from the deepest ancestor to the current batch. Later batches overwrite earlier ones.

impl<'a, H: Hasher, P: Readable<H::Digest>, Item: Send + Sync> Readable<<H as Hasher>::Digest> for MerkleizedBatch<'a, H, P, Item>

fn size(&self) -> Position

Total number of nodes (retained + pruned).

fn get_node(&self, pos: Position) -> Option<H::Digest>

Digest of the node at pos, or None if pruned / out of bounds.

fn root(&self) -> H::Digest

Root digest of the MMR.

fn pruned_to_pos(&self) -> Position

Items before this position have been pruned.

fn leaves(&self) -> Location

Total number of leaves.

fn peak_iterator(&self) -> PeakIterator

Iterator over (peak_position, height) in decreasing height order.

fn bounds(&self) -> Range<Position>

[start, end) range of retained node positions.

fn proof(&self, loc: Location) -> Result<Proof<D>, Error>

Inclusion proof for the element at loc.

fn range_proof(&self, range: Range<Location>) -> Result<Proof<D>, Error>

Inclusion proof for all elements in range.