Struct TrSortedMulti

pub struct TrSortedMulti<K>
where
    K: DeriveXOnly,
{
    pub internal_key: K,
    pub threshold: u16,
    pub script_keys: Confined<Vec<K>, 1, 999>,
}

Fields

internal_key: K

threshold: u16

script_keys: Confined<Vec<K>, 1, 999>

Trait Implementations

impl<K> Clone for TrSortedMulti<K>

where K: Clone + DeriveXOnly,

fn clone(&self) -> TrSortedMulti<K>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<K> Debug for TrSortedMulti<K>

where K: Debug + DeriveXOnly,

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

Formats the value using the given formatter.

impl<K> Derive<DerivedScript> for TrSortedMulti<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> Descriptor<K> for TrSortedMulti<K>

where K: DeriveXOnly,

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: HashMap<&KeyOrigin, LegacyKeySig>, _redeem_script: Option<RedeemScript>, _witness_script: Option<WitnessScript>, ) -> Option<(SigScript, Option<Witness>)>

fn taproot_witness( &self, cb: Option<&ControlBlock>, keysigs: HashMap<&KeyOrigin, TaprootKeySig>, ) -> Option<Witness>

fn is_taproot(&self) -> bool

impl<K> Display for TrSortedMulti<K>

where K: DeriveXOnly + Display,

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

Formats the value using the given formatter.

impl<S> From<TrSortedMulti<<S as DeriveSet>::XOnly>> for StdDescr<S>

where S: DeriveSet,

fn from(v: TrSortedMulti<<S as DeriveSet>::XOnly>) -> StdDescr<S>

Converts to this type from the input type.

impl<K> Hash for TrSortedMulti<K>

where K: Hash + DeriveXOnly,

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<K> PartialEq for TrSortedMulti<K>

where K: PartialEq + DeriveXOnly,

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

where K: Eq + DeriveXOnly,

impl<K> StructuralPartialEq for TrSortedMulti<K>

where K: DeriveXOnly,