Struct Forest

pub struct Forest { /* private fields */ }

Implementation of a merkle forest

Implementations

impl Forest

pub fn leaves(&self) -> usize

Returns the number of leaves currently stored in forest

pub fn len(&self) -> usize

Returns total number of nodes in forest

pub fn is_empty(&self) -> bool

Returns true if the forest is empty, false otherwise

pub fn insert<T: AsRef<[u8]>>(&mut self, value: T)

Inserts a new value in forest

pub fn extend<T: AsRef<[u8]>>(&mut self, values: &[T])

Batch inserts new values in forest

pub fn prove<T: AsRef<[u8]>>(&self, value: T) -> Option<Proof>

Generates inclusion proof of given leaf value

pub fn verify(&self, proof: &Proof) -> bool

Verifies inclusion proof

Trait Implementations

impl Debug for Forest

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

Formats the value using the given formatter.

impl Default for Forest

fn default() -> Forest

Returns the “default value” for a type.

impl PartialEq for Forest

fn eq(&self, other: &Forest) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Eq for Forest

impl StructuralPartialEq for Forest