Struct CompactMerkleizedBatch 

pub struct CompactMerkleizedBatch<F: Family, D: Digest, K: Key, V: ValueEncoding, S: Strategy>
where
    Operation<F, K, V>: EncodeShared,
{ /* private fields */ }

A speculative batch whose root digest has been computed.

Implementations

impl<F: Family, D: Digest, K: Key, V: ValueEncoding, S: Strategy> MerkleizedBatch<F, D, K, V, S>

where Operation<F, K, V>: EncodeShared,

pub const fn root(&self) -> D

Return the root digest after this batch is applied.

pub const fn bounds(&self) -> &Bounds<F, D>

Return the Bounds of the batch.

pub fn operations(&self) -> (Location<F>, Arc<Vec<Operation<F, K, V>>>)

Return the operations this batch appends to the log and the location of the first.

pub fn proof<E, C, H>( &self, db: &Db<F, E, K, V, H, C, S>, ) -> Result<Proof<F, D>, Error<F>>

where E: Context, H: Hasher<Digest = D>, C: Clone + Send + Sync + 'static, Operation<F, K, V>: Read<Cfg = C>,

Inclusion proof for the operations returned by Self::operations, anchored at this batch’s tip. The pair verifies against Self::root via crate::qmdb::verify_proof. Together with Self::pinned_nodes they verify via crate::qmdb::verify_proof_and_pinned_nodes.

Nodes of unapplied ancestors are read through the chain, so those ancestors must still be alive. Nodes below the chain are read from db’s Merkle store, which retains them at least until this batch’s changes are applied (applying it or a descendant prunes the store to its frontier).

Errors

Returns crate::merkle::Error::ElementPruned if a required node has been pruned or belongs to a dropped unapplied ancestor, and crate::merkle::Error::Empty if the batch has no operations (a Db::to_batch snapshot).

pub fn pinned_nodes<E, C, H>( &self, db: &Db<F, E, K, V, H, C, S>, ) -> Result<Vec<D>, Error<F>>

where E: Context, H: Hasher<Digest = D>, C: Clone + Send + Sync + 'static, Operation<F, K, V>: Read<Cfg = C>,

The Merkle frontier at the first operation returned by Self::operations (Family::nodes_to_pin), which lets a consumer holding only this batch’s base rebuild compact state and replay the operations. The operations, Self::proof, and pinned nodes verify against Self::root via crate::qmdb::verify_proof_and_pinned_nodes.

Nodes of unapplied ancestors are read through the chain, so those ancestors must still be alive. Nodes below the chain are read from db’s Merkle store, which retains them at least until this batch’s changes are applied (applying it or a descendant prunes the store to its frontier).

Errors

Returns crate::merkle::Error::ElementPruned if a required node has been pruned or belongs to a dropped unapplied ancestor.

pub fn new_batch<H>(self: &Arc<Self>) -> UnmerkleizedBatch<F, H, K, V, S>

where H: Hasher<Digest = D>,

Create a new speculative batch with this one as its parent.

Trait Implementations

impl<F: Clone + Family, D: Clone + Digest, K: Clone + Key, V: Clone + ValueEncoding, S: Clone + Strategy> Clone for MerkleizedBatch<F, D, K, V, S>

where Operation<F, K, V>: EncodeShared, V::Value: Clone,

fn clone(&self) -> MerkleizedBatch<F, D, K, V, S>

Returns a duplicate of the value.

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

Performs copy-assignment from source.