Struct CompactableHeaplessTree 

pub struct CompactableHeaplessTree<const ARITY: usize, const HEIGHT: usize, H, const MAX_INPUT_LEN: usize, PB = Proof<ARITY, HEIGHT, H, MAX_INPUT_LEN>>
where
    [(); { _ }]: Sized,
    Assert<{ _ }>: IsTrue,
    H: HashT,
    PB: ProofBuilder<ARITY, H>,
{ /* private fields */ }

Tree that can be compacted after leaf removal and reduced to a smaller tree

Implementations

impl<const ARITY: usize, const HEIGHT: usize, H, const MAX_INPUT_LEN: usize, PB> CompactableHeaplessTree<ARITY, HEIGHT, H, MAX_INPUT_LEN, PB>

where [(); { _ }]: Sized, Assert<{ _ }>: IsTrue, H: HashT, PB: ProofBuilder<ARITY, H>,

pub fn try_from<T: AsRef<[u8]> + Deref<Target = [u8]>>( input: &[T], ) -> Result<Self, Error>

creates a tree from an input if possible

pub fn from<T: AsRef<[u8]> + Deref<Target = [u8]>>(input: &[T]) -> Self

creates a tree from an input if possible

pub fn try_from_leaves(prefixed: &[Prefixed<ARITY, H>]) -> Result<Self, Error>

creates a tree from hashed leaves (of another tree)

pub fn compact(&mut self)

where [(); { _ }]: Sized, H: HashT, PB: ProofBuilder<ARITY, H>,

move all existing leaves leftwards

pub fn try_reduce( self, ) -> Result<CompactableHeaplessTree<ARITY, { _ }, H, MAX_INPUT_LEN, PB>, Self>

where [(); { _ }]: Sized, H: HashT, PB: ProofBuilder<ARITY, H>,

tries to compact this tree to a size of a tree with height-1 and create an instance of the new tree Note: takes ownership, but as it implements Copy trait may need explicit dropping to prevent being any longer available

Trait Implementations

impl<const ARITY: usize, const HEIGHT: usize, H, const MAX_INPUT_LEN: usize, PB> CanRemove for CompactableHeaplessTree<ARITY, HEIGHT, H, MAX_INPUT_LEN, PB>

where [(); { _ }]: Sized, Assert<{ _ }>: IsTrue, H: HashT, PB: ProofBuilder<ARITY, H>,

fn remove(&mut self, index: usize)

removes a leaf at index

fn num_of_leaves(&self) -> usize

number of leaves currently stored in the trsee

impl<const ARITY: usize, const HEIGHT: usize, H, const MAX_INPUT_LEN: usize, PB> Clone for CompactableHeaplessTree<ARITY, HEIGHT, H, MAX_INPUT_LEN, PB>

where [(); { _ }]: Sized, Assert<{ _ }>: IsTrue, H: HashT, PB: ProofBuilder<ARITY, H>,

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<const ARITY: usize, const HEIGHT: usize, H, const MAX_INPUT_LEN: usize, PB> Debug for CompactableHeaplessTree<ARITY, HEIGHT, H, MAX_INPUT_LEN, PB>

where [(); { _ }]: Sized, Assert<{ _ }>: IsTrue, H: HashT, PB: ProofBuilder<ARITY, H>,

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

Formats the value using the given formatter.

impl<const ARITY: usize, const HEIGHT: usize, H, const MAX_INPUT_LEN: usize, PB> Default for CompactableHeaplessTree<ARITY, HEIGHT, H, MAX_INPUT_LEN, PB>

where [(); { _ }]: Sized, Assert<{ _ }>: IsTrue, H: HashT, PB: ProofBuilder<ARITY, H>,

fn default() -> Self

Returns the “default value” for a type.

impl<const ARITY: usize, const HEIGHT: usize, H, const MAX_INPUT_LEN: usize, PB> StaticTreeTrait<ARITY, H, PB> for CompactableHeaplessTree<ARITY, HEIGHT, H, MAX_INPUT_LEN, PB>

where [(); { _ }]: Sized, Assert<{ _ }>: IsTrue, H: HashT, PB: ProofBuilder<ARITY, H>,

fn generate_proof(&self, index: usize) -> PB

generate a proof for a leaf at index

fn replace(&mut self, index: usize, input: &[u8])

replace a leaf at index with a new value

fn replace_leaf(&mut self, index: usize, leaf: H::Output)

replace a hashed leaf at index with a new hashed value

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

return a root

fn leaves(&self) -> &[Prefixed<ARITY, H>]

return a slice of leaves

fn base_layer_size(&self) -> usize

a size (not necessarily a number of currently present leaves) of the leaf layer

fn arity(&self) -> usize

returns tree’s arity (determined at compile time)

fn height(&self) -> usize

returns tree’s height (determined at compile time)