Struct OfferTree 

pub struct OfferTree { /* private fields */ }

A perfect binary Merkle tree over offer leaves. height = log2(leaves.len()).

Implementations

impl OfferTree

pub fn build(leaves: Vec<Word>) -> Result<Self, TreeError>

Build a perfect binary tree over leaves. Errors unless the count is a nonzero power of two of at most 2^MAX_TREE_HEIGHT - HashLib.offerTreeTypeHash reverts TreeTooHigh above height 20, so a taller tree could never ratify.

pub fn from_entries<I, E>( entries: I, ) -> Result<OfferTreeDescriptor, OfferTreeError>

where I: IntoIterator<Item = E>, E: Into<OfferTreeEntry>,

Assign canonical group ids, append protocol-zero padding, and build the Merkle tree.

Standalone offers each receive their own content-addressed group. Explicit OfferGroup entries retain their shared group id.

pub fn height(&self) -> usize

pub fn root(&self) -> Word

pub fn proof(&self, index: usize) -> Result<Vec<Word>, TreeError>

Merkle proof for the leaf at index, sibling per level (matches HashLib.isLeaf order).

Trait Implementations

impl Clone for OfferTree

fn clone(&self) -> OfferTree

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for OfferTree

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

Formats the value using the given formatter.

impl Eq for OfferTree

impl PartialEq for OfferTree

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

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for OfferTree