Type Alias light_concurrent_merkle_tree::ConcurrentMerkleTree32

pub type ConcurrentMerkleTree32<H> = ConcurrentMerkleTree<H, 32>;

Aliased Type

struct ConcurrentMerkleTree32<H> {
    pub height: usize,
    pub canopy_depth: usize,
    pub next_index: *mut usize,
    pub sequence_number: *mut usize,
    pub rightmost_leaf: *mut [u8; 32],
    pub filled_subtrees: BoundedVec<[u8; 32]>,
    pub changelog: CyclicBoundedVec<ChangelogEntry<32>>,
    pub roots: CyclicBoundedVec<[u8; 32]>,
    pub canopy: BoundedVec<[u8; 32]>,
    pub _hasher: PhantomData<H>,
}

Fields

height: usize

canopy_depth: usize

next_index: *mut usize

sequence_number: *mut usize

rightmost_leaf: *mut [u8; 32]

filled_subtrees: BoundedVec<[u8; 32]>

Hashes of subtrees.

changelog: CyclicBoundedVec<ChangelogEntry<32>>

History of Merkle proofs.

roots: CyclicBoundedVec<[u8; 32]>

History of roots.

canopy: BoundedVec<[u8; 32]>

Cached upper nodes.

_hasher: PhantomData<H>