#[non_exhaustive]pub enum StdDescr<S = XpubDerivable>where
S: DeriveSet,{
Show 15 variants
Raw(Raw<<S as DeriveSet>::Legacy>),
Sh(Sh<<S as DeriveSet>::Legacy>),
Pkh(Pkh<<S as DeriveSet>::Legacy>),
ShMulti(ShMulti<<S as DeriveSet>::Legacy>),
ShSortedMulti(ShSortedMulti<<S as DeriveSet>::Legacy>),
Wpkh(Wpkh<<S as DeriveSet>::Compr>),
Wsh(Wsh<<S as DeriveSet>::Compr>),
WshMulti(WshMulti<<S as DeriveSet>::Compr>),
WshSortedMulti(WshSortedMulti<<S as DeriveSet>::Compr>),
ShWpkh(ShWpkh<<S as DeriveSet>::Compr>),
ShWsh(ShWsh<<S as DeriveSet>::Compr>),
TrKey(TrKey<<S as DeriveSet>::XOnly>),
TrMulti(TrMulti<<S as DeriveSet>::XOnly>),
TrSortedMulti(TrSortedMulti<<S as DeriveSet>::XOnly>),
TrTree(TrScript<<S as DeriveSet>::XOnly>),
}Variants (Non-exhaustive)§
This enum is marked as 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.
Raw(Raw<<S as DeriveSet>::Legacy>)
Sh(Sh<<S as DeriveSet>::Legacy>)
Pkh(Pkh<<S as DeriveSet>::Legacy>)
ShMulti(ShMulti<<S as DeriveSet>::Legacy>)
ShSortedMulti(ShSortedMulti<<S as DeriveSet>::Legacy>)
Wpkh(Wpkh<<S as DeriveSet>::Compr>)
Wsh(Wsh<<S as DeriveSet>::Compr>)
WshMulti(WshMulti<<S as DeriveSet>::Compr>)
WshSortedMulti(WshSortedMulti<<S as DeriveSet>::Compr>)
ShWpkh(ShWpkh<<S as DeriveSet>::Compr>)
ShWsh(ShWsh<<S as DeriveSet>::Compr>)
TrKey(TrKey<<S as DeriveSet>::XOnly>)
TrMulti(TrMulti<<S as DeriveSet>::XOnly>)
TrSortedMulti(TrSortedMulti<<S as DeriveSet>::XOnly>)
TrTree(TrScript<<S as DeriveSet>::XOnly>)
Trait Implementations§
Source§impl<S> Derive<DerivedScript> for StdDescr<S>where
S: DeriveSet,
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>
Source§impl<K> Descriptor<K> for StdDescr<K>where
K: DeriveSet<Legacy = K, Compr = K, XOnly = K> + DeriveLegacy + DeriveCompr + DeriveXOnly,
StdDescr<K>: Derive<DerivedScript>,
impl<K> Descriptor<K> for StdDescr<K>where
K: DeriveSet<Legacy = K, Compr = K, XOnly = K> + DeriveLegacy + DeriveCompr + DeriveXOnly,
StdDescr<K>: Derive<DerivedScript>,
fn class(&self) -> SpkClass
fn keys<'a>(&'a self) -> impl Iterator<Item = &'a K>where
K: 'a,
fn vars<'a>(&'a self) -> impl Iterator<Item = &'a ()>where
(): 'a,
fn xpubs(&self) -> impl Iterator<Item = &XpubAccount>
fn legacy_keyset(&self, terminal: Terminal) -> IndexMap<LegacyPk, KeyOrigin>
fn xonly_keyset(&self, terminal: Terminal) -> IndexMap<XOnlyPk, TapDerivation>
fn legacy_witness( &self, keysigs: IndexMap<&KeyOrigin, LegacyKeySig>, redeem_script: Option<RedeemScript>, witness_script: Option<WitnessScript>, ) -> Option<(SigScript, Option<Witness>)>
fn taproot_witness( &self, cb: Option<&ControlBlock>, keysigs: IndexMap<&KeyOrigin, TaprootKeySig>, ) -> Option<Witness>
fn id(&self) -> DescrId
fn is_taproot(&self) -> bool
fn is_segwit(&self) -> bool
impl<S> Eq for StdDescr<S>
impl<S> StructuralPartialEq for StdDescr<S>
Auto Trait Implementations§
impl<S> Freeze for StdDescr<S>where
Raw<<S as DeriveSet>::Legacy>: Freeze,
Sh<<S as DeriveSet>::Legacy>: Freeze,
Pkh<<S as DeriveSet>::Legacy>: Freeze,
ShMulti<<S as DeriveSet>::Legacy>: Freeze,
ShSortedMulti<<S as DeriveSet>::Legacy>: Freeze,
Wpkh<<S as DeriveSet>::Compr>: Freeze,
Wsh<<S as DeriveSet>::Compr>: Freeze,
WshMulti<<S as DeriveSet>::Compr>: Freeze,
WshSortedMulti<<S as DeriveSet>::Compr>: Freeze,
ShWpkh<<S as DeriveSet>::Compr>: Freeze,
ShWsh<<S as DeriveSet>::Compr>: Freeze,
TrKey<<S as DeriveSet>::XOnly>: Freeze,
TrMulti<<S as DeriveSet>::XOnly>: Freeze,
TrSortedMulti<<S as DeriveSet>::XOnly>: Freeze,
TrScript<<S as DeriveSet>::XOnly>: Freeze,
impl<S> RefUnwindSafe for StdDescr<S>where
Raw<<S as DeriveSet>::Legacy>: RefUnwindSafe,
Sh<<S as DeriveSet>::Legacy>: RefUnwindSafe,
Pkh<<S as DeriveSet>::Legacy>: RefUnwindSafe,
ShMulti<<S as DeriveSet>::Legacy>: RefUnwindSafe,
ShSortedMulti<<S as DeriveSet>::Legacy>: RefUnwindSafe,
Wpkh<<S as DeriveSet>::Compr>: RefUnwindSafe,
Wsh<<S as DeriveSet>::Compr>: RefUnwindSafe,
WshMulti<<S as DeriveSet>::Compr>: RefUnwindSafe,
WshSortedMulti<<S as DeriveSet>::Compr>: RefUnwindSafe,
ShWpkh<<S as DeriveSet>::Compr>: RefUnwindSafe,
ShWsh<<S as DeriveSet>::Compr>: RefUnwindSafe,
TrKey<<S as DeriveSet>::XOnly>: RefUnwindSafe,
TrMulti<<S as DeriveSet>::XOnly>: RefUnwindSafe,
TrSortedMulti<<S as DeriveSet>::XOnly>: RefUnwindSafe,
TrScript<<S as DeriveSet>::XOnly>: RefUnwindSafe,
impl<S> Send for StdDescr<S>where
Raw<<S as DeriveSet>::Legacy>: Send,
Sh<<S as DeriveSet>::Legacy>: Send,
Pkh<<S as DeriveSet>::Legacy>: Send,
ShMulti<<S as DeriveSet>::Legacy>: Send,
ShSortedMulti<<S as DeriveSet>::Legacy>: Send,
Wpkh<<S as DeriveSet>::Compr>: Send,
Wsh<<S as DeriveSet>::Compr>: Send,
WshMulti<<S as DeriveSet>::Compr>: Send,
WshSortedMulti<<S as DeriveSet>::Compr>: Send,
ShWpkh<<S as DeriveSet>::Compr>: Send,
ShWsh<<S as DeriveSet>::Compr>: Send,
TrKey<<S as DeriveSet>::XOnly>: Send,
TrMulti<<S as DeriveSet>::XOnly>: Send,
TrSortedMulti<<S as DeriveSet>::XOnly>: Send,
TrScript<<S as DeriveSet>::XOnly>: Send,
impl<S> Sync for StdDescr<S>where
Raw<<S as DeriveSet>::Legacy>: Sync,
Sh<<S as DeriveSet>::Legacy>: Sync,
Pkh<<S as DeriveSet>::Legacy>: Sync,
ShMulti<<S as DeriveSet>::Legacy>: Sync,
ShSortedMulti<<S as DeriveSet>::Legacy>: Sync,
Wpkh<<S as DeriveSet>::Compr>: Sync,
Wsh<<S as DeriveSet>::Compr>: Sync,
WshMulti<<S as DeriveSet>::Compr>: Sync,
WshSortedMulti<<S as DeriveSet>::Compr>: Sync,
ShWpkh<<S as DeriveSet>::Compr>: Sync,
ShWsh<<S as DeriveSet>::Compr>: Sync,
TrKey<<S as DeriveSet>::XOnly>: Sync,
TrMulti<<S as DeriveSet>::XOnly>: Sync,
TrSortedMulti<<S as DeriveSet>::XOnly>: Sync,
TrScript<<S as DeriveSet>::XOnly>: Sync,
impl<S> Unpin for StdDescr<S>where
Raw<<S as DeriveSet>::Legacy>: Unpin,
Sh<<S as DeriveSet>::Legacy>: Unpin,
Pkh<<S as DeriveSet>::Legacy>: Unpin,
ShMulti<<S as DeriveSet>::Legacy>: Unpin,
ShSortedMulti<<S as DeriveSet>::Legacy>: Unpin,
Wpkh<<S as DeriveSet>::Compr>: Unpin,
Wsh<<S as DeriveSet>::Compr>: Unpin,
WshMulti<<S as DeriveSet>::Compr>: Unpin,
WshSortedMulti<<S as DeriveSet>::Compr>: Unpin,
ShWpkh<<S as DeriveSet>::Compr>: Unpin,
ShWsh<<S as DeriveSet>::Compr>: Unpin,
TrKey<<S as DeriveSet>::XOnly>: Unpin,
TrMulti<<S as DeriveSet>::XOnly>: Unpin,
TrSortedMulti<<S as DeriveSet>::XOnly>: Unpin,
TrScript<<S as DeriveSet>::XOnly>: Unpin,
impl<S> UnsafeUnpin for StdDescr<S>where
Raw<<S as DeriveSet>::Legacy>: UnsafeUnpin,
Sh<<S as DeriveSet>::Legacy>: UnsafeUnpin,
Pkh<<S as DeriveSet>::Legacy>: UnsafeUnpin,
ShMulti<<S as DeriveSet>::Legacy>: UnsafeUnpin,
ShSortedMulti<<S as DeriveSet>::Legacy>: UnsafeUnpin,
Wpkh<<S as DeriveSet>::Compr>: UnsafeUnpin,
Wsh<<S as DeriveSet>::Compr>: UnsafeUnpin,
WshMulti<<S as DeriveSet>::Compr>: UnsafeUnpin,
WshSortedMulti<<S as DeriveSet>::Compr>: UnsafeUnpin,
ShWpkh<<S as DeriveSet>::Compr>: UnsafeUnpin,
ShWsh<<S as DeriveSet>::Compr>: UnsafeUnpin,
TrKey<<S as DeriveSet>::XOnly>: UnsafeUnpin,
TrMulti<<S as DeriveSet>::XOnly>: UnsafeUnpin,
TrSortedMulti<<S as DeriveSet>::XOnly>: UnsafeUnpin,
TrScript<<S as DeriveSet>::XOnly>: UnsafeUnpin,
impl<S> UnwindSafe for StdDescr<S>where
Raw<<S as DeriveSet>::Legacy>: UnwindSafe,
Sh<<S as DeriveSet>::Legacy>: UnwindSafe,
Pkh<<S as DeriveSet>::Legacy>: UnwindSafe,
ShMulti<<S as DeriveSet>::Legacy>: UnwindSafe,
ShSortedMulti<<S as DeriveSet>::Legacy>: UnwindSafe,
Wpkh<<S as DeriveSet>::Compr>: UnwindSafe,
Wsh<<S as DeriveSet>::Compr>: UnwindSafe,
WshMulti<<S as DeriveSet>::Compr>: UnwindSafe,
WshSortedMulti<<S as DeriveSet>::Compr>: UnwindSafe,
ShWpkh<<S as DeriveSet>::Compr>: UnwindSafe,
ShWsh<<S as DeriveSet>::Compr>: UnwindSafe,
TrKey<<S as DeriveSet>::XOnly>: UnwindSafe,
TrMulti<<S as DeriveSet>::XOnly>: UnwindSafe,
TrSortedMulti<<S as DeriveSet>::XOnly>: UnwindSafe,
TrScript<<S as DeriveSet>::XOnly>: UnwindSafe,
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<T> DeriveScripts for Twhere
T: Derive<DerivedScript>,
impl<T> DeriveScripts for Twhere
T: Derive<DerivedScript>,
Source§fn derive_address(
&self,
network: AddressNetwork,
keychain: impl Into<Keychain>,
index: impl Into<NormalIndex>,
) -> impl Iterator<Item = Address>
fn derive_address( &self, network: AddressNetwork, keychain: impl Into<Keychain>, index: impl Into<NormalIndex>, ) -> impl Iterator<Item = Address>
Derives addresses for a given index. Read more
Source§fn derive_address_range(
&self,
network: AddressNetwork,
keychain: impl Into<Keychain>,
from: impl Into<NormalIndex>,
to: impl Into<NormalIndex>,
) -> impl Iterator<Item = Address>
fn derive_address_range( &self, network: AddressNetwork, keychain: impl Into<Keychain>, from: impl Into<NormalIndex>, to: impl Into<NormalIndex>, ) -> impl Iterator<Item = Address>
Derives addresses for a range of indexes. Read more
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Compare self to
key and return true if they are equal.