Enum TapTree 

pub enum TapTree<Pk>
where
    Pk: MiniscriptKey,
{
    Tree {
        left: Arc<TapTree<Pk>>,
        right: Arc<TapTree<Pk>>,
        height: usize,
    },
    Leaf(Arc<Miniscript<Pk, Tap>>),
}

A Taproot Tree representation.

Variants

Tree

A taproot tree structure

Fields

left: Arc<TapTree<Pk>>

Left tree branch.

right: Arc<TapTree<Pk>>

Right tree branch.

height: usize

Tree height, defined as 1 + max(left_height, right_height).

Leaf(Arc<Miniscript<Pk, Tap>>)

A taproot leaf denoting a spending condition

Implementations

impl<Pk> TapTree<Pk>

where Pk: MiniscriptKey,

pub fn combine(left: TapTree<Pk>, right: TapTree<Pk>) -> TapTree<Pk>

Creates a TapTree by combining left and right tree nodes.

pub fn height(&self) -> usize

Returns the height of this tree.

pub fn iter(&self) -> TapTreeIter<'_, Pk>

Iterates over all miniscripts in DFS walk order compatible with the PSBT requirements (BIP 371).

Trait Implementations

impl<Pk> Clone for TapTree<Pk>

where Pk: Clone + MiniscriptKey,

fn clone(&self) -> TapTree<Pk>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<Pk> Debug for TapTree<Pk>

where Pk: MiniscriptKey,

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

Formats the value using the given formatter.

impl<Pk> Display for TapTree<Pk>

where Pk: MiniscriptKey,

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

Formats the value using the given formatter.

impl<Pk> Hash for TapTree<Pk>

where Pk: Hash + MiniscriptKey,

fn hash<__H>(&self, state: &mut __H)

where __H: Hasher,

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl<Pk> Liftable<Pk> for TapTree<Pk>

where Pk: MiniscriptKey,

fn lift(&self) -> Result<Policy<Pk>, Error>

Converts this object into an abstract policy.

impl<Pk> Ord for TapTree<Pk>

where Pk: Ord + MiniscriptKey,

fn cmp(&self, other: &TapTree<Pk>) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

where Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized,

Restrict a value to a certain interval.

impl<Pk> PartialEq for TapTree<Pk>

where Pk: PartialEq + MiniscriptKey,

fn eq(&self, other: &TapTree<Pk>) -> 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<Pk> PartialOrd for TapTree<Pk>

where Pk: PartialOrd + MiniscriptKey,

fn partial_cmp(&self, other: &TapTree<Pk>) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

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

Tests less than (for self and other) and is used by the < operator.

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

Tests less than or equal to (for self and other) and is used by the <= operator.

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

Tests greater than (for self and other) and is used by the > operator.

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

Tests greater than or equal to (for self and other) and is used by the >= operator.

impl<Pk> Eq for TapTree<Pk>

where Pk: Eq + MiniscriptKey,

impl<Pk> StructuralPartialEq for TapTree<Pk>

where Pk: MiniscriptKey,