Struct ShSortedMulti

pub struct ShSortedMulti<K = XpubDerivable>
where
    K: DeriveLegacy,
{
    pub threshold: u4,
    pub keys: Confined<Vec<K>, 1, 16>,
}

Representation of BIP-383 sortedmulti as it is used inside sh.

Nota bene

The structure does not support 16-of-16 multisig (only 15-of-16 is possible). The cost of the support will increase code multifold, so we just ignore this rare case.

Fields

threshold: u4

keys: Confined<Vec<K>, 1, 16>

Implementations

impl<K> ShSortedMulti<K>

where K: DeriveLegacy,

pub fn key_count(&self) -> u8

pub fn threshold(&self) -> u8

Trait Implementations

impl<K> Clone for ShSortedMulti<K>

where K: Clone + DeriveLegacy,

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

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<K> Debug for ShSortedMulti<K>

where K: Debug + DeriveLegacy,

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

Formats the value using the given formatter.

impl<K> Derive<DerivedScript> for ShSortedMulti<K>

where K: DeriveLegacy,

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 ShSortedMulti<K>

where K: DeriveLegacy, ShSortedMulti<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: 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<S> Display for ShSortedMulti<S>

where S: DeriveLegacy,

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

Formats the value using the given formatter.

impl<S> From<ShSortedMulti<<S as DeriveSet>::Legacy>> for StdDescr<S>

where S: DeriveSet,

fn from(v: ShSortedMulti<<S as DeriveSet>::Legacy>) -> StdDescr<S>

Converts to this type from the input type.

impl<K> Hash for ShSortedMulti<K>

where K: Hash + DeriveLegacy,

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 ShSortedMulti<K>

where K: PartialEq + DeriveLegacy,

fn eq(&self, other: &ShSortedMulti<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 ShSortedMulti<K>

where K: Eq + DeriveLegacy,

impl<K> StructuralPartialEq for ShSortedMulti<K>

where K: DeriveLegacy,