Struct NoteFrontier 

pub struct NoteFrontier {
    pub position: u64,
    pub frontier: [Option<[u8; 32]>; 32],
}

incremental merkle tree frontier stores the rightmost path for efficient appends depth 32 for orchard note commitment tree

Fields

position: u64

position of next leaf to insert

frontier: [Option<[u8; 32]>; 32]

frontier hashes at each level (32 levels for orchard) frontier[i] is Some if there’s an odd node at level i

Implementations

impl NoteFrontier

pub fn empty() -> Self

pub fn root(&self) -> [u8; 32]

compute merkle root from frontier

pub fn append(&mut self, leaf: [u8; 32]) -> u64

append a leaf to the tree, returning new position

pub fn position(&self) -> u64

get current position (number of leaves)

Trait Implementations

impl Clone for NoteFrontier

fn clone(&self) -> NoteFrontier

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for NoteFrontier

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for NoteFrontier

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Serialize for NoteFrontier

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.