Struct bdk_chain::bitcoin::taproot::TapTree

pub struct TapTree(/* private fields */);
Expand description

Taproot Tree representing a complete binary tree without any hidden nodes.

This is in contrast to NodeInfo, which allows hidden nodes. The implementations for Eq, PartialEq and Hash compare the merkle root of the tree

Implementations§

§

impl TapTree

pub fn node_info(&self) -> &NodeInfo

Gets the reference to inner NodeInfo of this tree root.

pub fn into_node_info(self) -> NodeInfo

Gets the inner NodeInfo of this tree root.

pub fn script_leaves(&self) -> ScriptLeaves<'_>

Returns [TapTreeIter<'_>] iterator for a taproot script tree, operating in DFS order over tree ScriptLeafs.

pub fn root_hash(&self) -> TapNodeHash

Returns the root TapNodeHash of this tree.

Trait Implementations§

§

impl Clone for TapTree

§

fn clone(&self) -> TapTree

Returns a copy of the value. Read more
1.0.0 · source§

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

Performs copy-assignment from source. Read more
§

impl Debug for TapTree

§

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

Formats the value using the given formatter. Read more
§

impl<'de> Deserialize<'de> for TapTree

§

fn deserialize<__D>( __deserializer: __D ) -> Result<TapTree, <__D as Deserializer<'de>>::Error>
where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer. Read more
§

impl From<TapTree> for NodeInfo

§

fn from(tree: TapTree) -> NodeInfo

Converts to this type from the input type.
§

impl Hash for TapTree

§

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

Feeds this value into the given Hasher. Read more
1.3.0 · source§

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

Feeds a slice of this type into the given Hasher. Read more
§

impl PartialEq for TapTree

§

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

This method tests for self and other values to be equal, and is used by ==.
1.0.0 · source§

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

This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.
§

impl Serialize for TapTree

§

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

Serialize this value into the given Serde serializer. Read more
§

impl TryFrom<NodeInfo> for TapTree

§

fn try_from( node_info: NodeInfo ) -> Result<TapTree, <TapTree as TryFrom<NodeInfo>>::Error>

Constructs TapTree from a NodeInfo if it is complete binary tree.

§Returns

A TapTree iff the NodeInfo has no hidden nodes, otherwise return HiddenNodesError error with the content of incomplete NodeInfo instance.

§

type Error = HiddenNodesError

The type returned in the event of a conversion error.
§

impl TryFrom<TaprootBuilder> for TapTree

§

fn try_from( builder: TaprootBuilder ) -> Result<TapTree, <TapTree as TryFrom<TaprootBuilder>>::Error>

Constructs TapTree from a TaprootBuilder if it is complete binary tree.

§Returns

A TapTree iff the builder is complete, otherwise return IncompleteBuilderError error with the content of incomplete builder instance.

§

type Error = IncompleteBuilderError

The type returned in the event of a conversion error.
§

impl Eq for TapTree

§

impl StructuralPartialEq for TapTree

Auto Trait Implementations§

Blanket Implementations§

source§

impl<T> Any for T
where T: 'static + ?Sized,

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
§

impl<Q, K> Equivalent<K> for Q
where Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,

§

fn equivalent(&self, key: &K) -> bool

Checks if this value is equivalent to the given key. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

source§

impl<T, U> Into<U> for T
where U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

source§

impl<T> ToOwned for T
where T: Clone,

§

type Owned = T

The resulting type after obtaining ownership.
source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
§

impl<V, T> VZip<V> for T
where V: MultiLane<T>,

§

fn vzip(self) -> V

source§

impl<T> DeserializeOwned for T
where T: for<'de> Deserialize<'de>,