Struct MerkleizedBatch 

pub struct MerkleizedBatch<F: Family, D: Digest, Item: Send + Sync> { /* private fields */ }

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

Implementations

impl<F: Family, D: Digest, Item: Send + Sync> MerkleizedBatch<F, D, Item>

pub fn root(&self) -> D

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

pub fn new_batch<H: Hasher<Digest = D>>( self: &Arc<Self>, ) -> UnmerkleizedBatch<F, H, Item>

where Item: Encode,

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

All uncommitted ancestors in the chain must be kept alive until the child (or any descendant) is merkleized. Dropping an uncommitted ancestor causes data loss detected at apply_batch time.

Trait Implementations

impl<F: Clone + Family, D: Clone + Digest, Item: Clone + Send + Sync> Clone for MerkleizedBatch<F, D, Item>

fn clone(&self) -> MerkleizedBatch<F, D, Item>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<F: Debug + Family, D: Debug + Digest, Item: Debug + Send + Sync> Debug for MerkleizedBatch<F, D, Item>

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

Formats the value using the given formatter.

impl<F: Family, D: Digest, Item: Send + Sync> Readable for MerkleizedBatch<F, D, Item>

type Family = F

The Merkle family implemented by this structure.

type Digest = D

The digest type used by this structure.

type Error = Error<F>

The error type returned by proof construction.

fn size(&self) -> Position<F>

Total number of nodes (retained + pruned).

fn get_node(&self, pos: Position<F>) -> Option<D>

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

fn root(&self) -> D

Root digest of the structure.

fn pruning_boundary(&self) -> Location<F>

Leaf location up to which pruning has been performed, or 0 if never pruned.

fn proof( &self, hasher: &impl Hasher<F, Digest = D>, loc: Location<F>, ) -> Result<Proof<F, D>, Error<F>>

Inclusion proof for the element at loc.

fn range_proof( &self, hasher: &impl Hasher<F, Digest = D>, range: Range<Location<F>>, ) -> Result<Proof<F, D>, Error<F>>

Inclusion proof for all elements in range.

fn leaves(&self) -> Location<Self::Family>

Total number of leaves.

fn bounds(&self) -> Range<Location<Self::Family>>

[start, end) range of retained leaf locations.