Struct MerkleTree

#[repr(C)]
pub struct MerkleTree<const N: usize> {
    pub root: Hash,
    pub filled_subtrees: [Hash; N],
    pub zero_values: [Hash; N],
    pub next_index: u64,
}

Fields

root: Hash

filled_subtrees: [Hash; N]

zero_values: [Hash; N]

next_index: u64

Implementations

impl<const N: usize> MerkleTree<N>

pub fn new(seeds: &[&[u8]]) -> Self

pub fn from_zeros(zeros: [Hash; N]) -> Self

pub const fn get_depth(&self) -> u8

pub const fn get_size() -> usize

pub fn get_root(&self) -> Hash

pub fn get_empty_leaf(&self) -> Leaf

pub fn init(&mut self, seeds: &[&[u8]])

pub fn get_leaf_count(&self) -> u64

Returns the number of leaves currently in the Merkle tree.

pub fn get_capacity(&self) -> u64

Returns the maximum capacity of the Merkle tree.

pub fn try_add(&mut self, data: &[&[u8]]) -> ProgramResult

Adds a data to the tree, creating a new leaf.

pub fn try_add_leaf(&mut self, leaf: Leaf) -> ProgramResult

Adds a leaf to the tree.

pub fn try_remove<P>(&mut self, proof: &[P], data: &[&[u8]]) -> ProgramResult

where P: Into<Hash> + Copy,

Removes a leaf from the tree using the provided proof.

pub fn try_remove_leaf<P>(&mut self, proof: &[P], leaf: Leaf) -> ProgramResult

where P: Into<Hash> + Copy,

Removes a leaf from the tree using the provided proof.

pub fn try_replace<P>( &mut self, proof: &[P], original_data: &[&[u8]], new_data: &[&[u8]], ) -> ProgramResult

where P: Into<Hash> + Copy,

Replaces a leaf in the tree with new data using the provided proof.

pub fn try_replace_leaf<P>( &mut self, proof: &[P], original_leaf: Leaf, new_leaf: Leaf, ) -> ProgramResult

where P: Into<Hash> + Copy,

Replaces a leaf in the tree with a new leaf using the provided proof.

pub fn contains<P>(&self, proof: &[P], data: &[&[u8]]) -> bool

where P: Into<Hash> + Copy,

Checks if the proof contains the specified data.

pub fn contains_leaf<P>(&self, proof: &[P], leaf: Leaf) -> bool

where P: Into<Hash> + Copy,

Checks if the proof contains the specified leaf.

pub fn get_proof(&self, leaves: &[Leaf], leaf_index: usize) -> Vec<Hash>

Returns a Merkle proof for a specific leaf in the tree.

pub fn get_layer_nodes(&self, leaves: &[Leaf], layer_number: usize) -> Vec<Hash>

Hashes up to layer_number and returns only the non-empty nodes on that layer.

Trait Implementations

impl<const N: usize> Clone for MerkleTree<N>

fn clone(&self) -> MerkleTree<N>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<const N: usize> Debug for MerkleTree<N>

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

Formats the value using the given formatter.

impl<const N: usize> PartialEq for MerkleTree<N>

fn eq(&self, other: &MerkleTree<N>) -> 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<const N: usize> Zeroable for MerkleTree<N>

fn zeroed() -> Self

Calls zeroed.

impl<const N: usize> Copy for MerkleTree<N>

impl<const N: usize> Pod for MerkleTree<N>

impl<const N: usize> StructuralPartialEq for MerkleTree<N>