Enum DerivedScript

#[non_exhaustive]
pub enum DerivedScript {
    Bare(ScriptPubkey),
    Bip13(RedeemScript),
    Segwit(WitnessScript),
    Nested(WitnessScript),
    TaprootKeyOnly(InternalPk),
    TaprootScript(InternalPk, TapTree),
}

Variants (Non-exhaustive)

Non-exhaustive enums could have additional variants added in future. Therefore, when matching against variants of non-exhaustive enums, an extra wildcard arm must be added to account for any future variants.

Bare(ScriptPubkey)

Bip13(RedeemScript)

Segwit(WitnessScript)

Nested(WitnessScript)

TaprootKeyOnly(InternalPk)

TaprootScript(InternalPk, TapTree)

Implementations

impl DerivedScript

pub fn to_script_pubkey(&self) -> ScriptPubkey

pub fn to_redeem_script(&self) -> Option<RedeemScript>

pub fn as_witness_script(&self) -> Option<&WitnessScript>

pub fn to_witness_script(&self) -> Option<WitnessScript>

pub fn to_internal_pk(&self) -> Option<InternalPk>

pub fn as_tap_tree(&self) -> Option<&TapTree>

pub fn to_tap_tree(&self) -> Option<TapTree>

pub fn to_leaf_scripts(&self) -> IndexMap<ControlBlock, LeafScript>

pub fn to_tap_root(&self) -> Option<TapNodeHash>

Trait Implementations

impl Clone for DerivedScript

fn clone(&self) -> DerivedScript

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for DerivedScript

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

Formats the value using the given formatter.

impl<S> Derive<DerivedScript> for StdDescr<S>

where S: DeriveSet,

fn default_keychain(&self) -> Keychain

fn keychains(&self) -> BTreeSet<Keychain>

fn derive( &self, keychain: impl Into<Keychain>, index: impl Into<NormalIndex>, ) -> impl Iterator<Item = DerivedScript>

fn derive_range( &self, keychain: impl Into<Keychain>, from: impl Into<NormalIndex>, to: impl Into<NormalIndex>, ) -> impl Iterator<Item = D>

impl<K> Derive<DerivedScript> for Tr<K>

where K: DeriveXOnly,

fn default_keychain(&self) -> Keychain

fn keychains(&self) -> BTreeSet<Keychain>

fn derive( &self, keychain: impl Into<Keychain>, index: impl Into<NormalIndex>, ) -> impl Iterator<Item = DerivedScript>

fn derive_range( &self, keychain: impl Into<Keychain>, from: impl Into<NormalIndex>, to: impl Into<NormalIndex>, ) -> impl Iterator<Item = D>

impl<K> Derive<DerivedScript> for TrKey<K>

where K: DeriveXOnly,

fn default_keychain(&self) -> Keychain

fn keychains(&self) -> BTreeSet<Keychain>

fn derive( &self, keychain: impl Into<Keychain>, index: impl Into<NormalIndex>, ) -> impl Iterator<Item = DerivedScript>

fn derive_range( &self, keychain: impl Into<Keychain>, from: impl Into<NormalIndex>, to: impl Into<NormalIndex>, ) -> impl Iterator<Item = D>

impl<K> Derive<DerivedScript> for Wpkh<K>

where K: DeriveCompr,

fn default_keychain(&self) -> Keychain

fn keychains(&self) -> BTreeSet<Keychain>

fn derive( &self, keychain: impl Into<Keychain>, index: impl Into<NormalIndex>, ) -> impl Iterator<Item = DerivedScript>

fn derive_range( &self, keychain: impl Into<Keychain>, from: impl Into<NormalIndex>, to: impl Into<NormalIndex>, ) -> impl Iterator<Item = D>

impl Hash for DerivedScript

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 PartialEq for DerivedScript

fn eq(&self, other: &DerivedScript) -> 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 Eq for DerivedScript

impl StructuralPartialEq for DerivedScript