Struct MemoryBackedTree 

pub struct MemoryBackedTree<H, T>
where
    H: Digest,
    T: HashableLeaf,
{ /* private fields */ }

An in-memory append-only Merkle tree implementation, supporting inclusion and consistency proofs. This stores leaf values, not just leaf hashes.

Implementations

impl<H, T> MemoryBackedTree<H, T>

where H: Digest, T: HashableLeaf,

pub fn prove_consistency(&self, num_additions: usize) -> ConsistencyProof<H>

Produces a proof that this MemoryBackedTree is the result of appending num_additions items to a prefix of this tree.

Panics

Panics if num_additions >= self.len().

impl<H, T> MemoryBackedTree<H, T>

where H: Digest, T: HashableLeaf,

pub fn prove_inclusion(&self, idx: usize) -> InclusionProof<H>

Returns a proof of inclusion of the item at the given index.

Panics

Panics if idx >= self.len().

impl<H, T> MemoryBackedTree<H, T>

where H: Digest, T: HashableLeaf,

pub fn new() -> Self

pub fn push(&mut self, new_val: T)

Appends the given item to the end of the list.

Panics

Panics if self.len() > ⌊usize::MAX / 2⌋ - 1. Also panics if this tree is malformed, e.g., deserialized from disk without passing a MemoryBackedTree::self_check.

pub fn self_check(&self) -> Result<(), SelfCheckError>

Checks that this tree is well-formed. This can take a while if the tree is large. Run this if you’ve deserialized this tree and don’t trust the source. If a tree is malformed, other methods will panic or behave oddly.

pub fn root(&self) -> RootHash<H>

Returns the root hash of this tree. The value and type uniquely describe this tree.

Panics

Panics if this tree is malformed, e.g., deserialized from disk without passing a MemoryBackedTree::self_check.

pub fn get(&self, idx: usize) -> Option<&T>

Tries to get the item at the given index

pub fn items(&self) -> &[T]

Returns all the items

pub fn len(&self) -> u64

Returns the number of items

pub fn is_empty(&self) -> bool

Returns true if this tree has no items

Trait Implementations

impl<H, T> Clone for MemoryBackedTree<H, T>

where H: Digest + Clone, T: HashableLeaf + Clone,

fn clone(&self) -> MemoryBackedTree<H, T>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<H, T> Debug for MemoryBackedTree<H, T>

where H: Digest + Debug, T: HashableLeaf + Debug,

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

Formats the value using the given formatter.

impl<H, T> Default for MemoryBackedTree<H, T>

where H: Digest, T: HashableLeaf,

fn default() -> Self

Returns the “default value” for a type.