Struct miniscript::descriptor::SortedMultiVec
source · pub struct SortedMultiVec<Pk: MiniscriptKey, Ctx: ScriptContext> { /* private fields */ }
Expand description
Contents of a “sortedmulti” descriptor
Implementations§
source§impl<Pk: MiniscriptKey, Ctx: ScriptContext> SortedMultiVec<Pk, Ctx>
impl<Pk: MiniscriptKey, Ctx: ScriptContext> SortedMultiVec<Pk, Ctx>
sourcepub fn new(k: usize, pks: Vec<Pk>) -> Result<Self, Error>
pub fn new(k: usize, pks: Vec<Pk>) -> Result<Self, Error>
Create a new instance of SortedMultiVec
given a list of keys and the threshold
Internally checks all the applicable size limits and pubkey types limitations according to the current Ctx
.
sourcepub fn from_tree(tree: &Tree<'_>) -> Result<Self, Error>where
Pk: FromStr,
<Pk as FromStr>::Err: Display,
pub fn from_tree(tree: &Tree<'_>) -> Result<Self, Error>where Pk: FromStr, <Pk as FromStr>::Err: Display,
Parse an expression tree into a SortedMultiVec
sourcepub fn translate_pk<T, Q, FuncError>(
&self,
t: &mut T
) -> Result<SortedMultiVec<Q, Ctx>, TranslateErr<FuncError>>where
T: Translator<Pk, Q, FuncError>,
Q: MiniscriptKey,
pub fn translate_pk<T, Q, FuncError>( &self, t: &mut T ) -> Result<SortedMultiVec<Q, Ctx>, TranslateErr<FuncError>>where T: Translator<Pk, Q, FuncError>, Q: MiniscriptKey,
This will panic if fpk returns an uncompressed key when converting to a Segwit descriptor. To prevent this panic, ensure fpk returns an error in this case instead.
source§impl<Pk: MiniscriptKey, Ctx: ScriptContext> SortedMultiVec<Pk, Ctx>
impl<Pk: MiniscriptKey, Ctx: ScriptContext> SortedMultiVec<Pk, Ctx>
sourcepub fn sanity_check(&self) -> Result<(), Error>
pub fn sanity_check(&self) -> Result<(), Error>
utility function to sanity a sorted multi vec
source§impl<Pk: MiniscriptKey, Ctx: ScriptContext> SortedMultiVec<Pk, Ctx>
impl<Pk: MiniscriptKey, Ctx: ScriptContext> SortedMultiVec<Pk, Ctx>
sourcepub fn sorted_node(&self) -> Terminal<Pk, Ctx>where
Pk: ToPublicKey,
pub fn sorted_node(&self) -> Terminal<Pk, Ctx>where Pk: ToPublicKey,
Create Terminal::Multi containing sorted pubkeys
sourcepub fn encode(&self) -> ScriptBufwhere
Pk: ToPublicKey,
pub fn encode(&self) -> ScriptBufwhere Pk: ToPublicKey,
Encode as a Bitcoin script
sourcepub fn satisfy<S>(&self, satisfier: S) -> Result<Vec<Vec<u8>>, Error>where
Pk: ToPublicKey,
S: Satisfier<Pk>,
pub fn satisfy<S>(&self, satisfier: S) -> Result<Vec<Vec<u8>>, Error>where Pk: ToPublicKey, S: Satisfier<Pk>,
Attempt to produce a satisfying witness for the witness script represented by the parse tree
sourcepub fn build_template<P>(&self, provider: &P) -> Satisfaction<Placeholder<Pk>>where
Pk: ToPublicKey,
P: AssetProvider<Pk>,
pub fn build_template<P>(&self, provider: &P) -> Satisfaction<Placeholder<Pk>>where Pk: ToPublicKey, P: AssetProvider<Pk>,
Attempt to produce a witness template given the assets available
sourcepub fn script_size(&self) -> usize
pub fn script_size(&self) -> usize
Size, in bytes of the script-pubkey. If this Miniscript is used outside of segwit (e.g. in a bare or P2SH descriptor), this quantity should be multiplied by 4 to compute the weight.
In general, it is not recommended to use this function directly, but
to instead call the corresponding function on a Descriptor
, which
will handle the segwit/non-segwit technicalities for you.
sourcepub fn max_satisfaction_witness_elements(&self) -> usize
pub fn max_satisfaction_witness_elements(&self) -> usize
Maximum number of witness elements used to satisfy the Miniscript
fragment, including the witness script itself. Used to estimate
the weight of the VarInt
that specifies this number in a serialized
transaction.
This function may panic on malformed Miniscript
objects which do
not correspond to semantically sane Scripts. (Such scripts should be
rejected at parse time. Any exceptions are bugs.)
sourcepub fn max_satisfaction_size(&self) -> usize
pub fn max_satisfaction_size(&self) -> usize
Maximum size, in bytes, of a satisfying witness.
In general, it is not recommended to use this function directly, but
to instead call the corresponding function on a Descriptor
, which
will handle the segwit/non-segwit technicalities for you.
All signatures are assumed to be 73 bytes in size, including the length prefix (segwit) or push opcode (pre-segwit) and sighash postfix.
Trait Implementations§
source§impl<Pk: Clone + MiniscriptKey, Ctx: Clone + ScriptContext> Clone for SortedMultiVec<Pk, Ctx>
impl<Pk: Clone + MiniscriptKey, Ctx: Clone + ScriptContext> Clone for SortedMultiVec<Pk, Ctx>
source§fn clone(&self) -> SortedMultiVec<Pk, Ctx>
fn clone(&self) -> SortedMultiVec<Pk, Ctx>
1.0.0 · source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
source
. Read moresource§impl<Pk: MiniscriptKey, Ctx: ScriptContext> Debug for SortedMultiVec<Pk, Ctx>
impl<Pk: MiniscriptKey, Ctx: ScriptContext> Debug for SortedMultiVec<Pk, Ctx>
source§impl<Pk: MiniscriptKey, Ctx: ScriptContext> Display for SortedMultiVec<Pk, Ctx>
impl<Pk: MiniscriptKey, Ctx: ScriptContext> Display for SortedMultiVec<Pk, Ctx>
source§impl<Pk: MiniscriptKey, Ctx: ScriptContext> ForEachKey<Pk> for SortedMultiVec<Pk, Ctx>
impl<Pk: MiniscriptKey, Ctx: ScriptContext> ForEachKey<Pk> for SortedMultiVec<Pk, Ctx>
source§impl<Pk: Hash + MiniscriptKey, Ctx: Hash + ScriptContext> Hash for SortedMultiVec<Pk, Ctx>
impl<Pk: Hash + MiniscriptKey, Ctx: Hash + ScriptContext> Hash for SortedMultiVec<Pk, Ctx>
source§impl<Pk: MiniscriptKey, Ctx: ScriptContext> Liftable<Pk> for SortedMultiVec<Pk, Ctx>
impl<Pk: MiniscriptKey, Ctx: ScriptContext> Liftable<Pk> for SortedMultiVec<Pk, Ctx>
source§impl<Pk: Ord + MiniscriptKey, Ctx: Ord + ScriptContext> Ord for SortedMultiVec<Pk, Ctx>
impl<Pk: Ord + MiniscriptKey, Ctx: Ord + ScriptContext> Ord for SortedMultiVec<Pk, Ctx>
source§fn cmp(&self, other: &SortedMultiVec<Pk, Ctx>) -> Ordering
fn cmp(&self, other: &SortedMultiVec<Pk, Ctx>) -> Ordering
1.21.0 · source§fn max(self, other: Self) -> Selfwhere
Self: Sized,
fn max(self, other: Self) -> Selfwhere Self: Sized,
source§impl<Pk: PartialEq + MiniscriptKey, Ctx: PartialEq + ScriptContext> PartialEq<SortedMultiVec<Pk, Ctx>> for SortedMultiVec<Pk, Ctx>
impl<Pk: PartialEq + MiniscriptKey, Ctx: PartialEq + ScriptContext> PartialEq<SortedMultiVec<Pk, Ctx>> for SortedMultiVec<Pk, Ctx>
source§fn eq(&self, other: &SortedMultiVec<Pk, Ctx>) -> bool
fn eq(&self, other: &SortedMultiVec<Pk, Ctx>) -> bool
self
and other
values to be equal, and is used
by ==
.source§impl<Pk: PartialOrd + MiniscriptKey, Ctx: PartialOrd + ScriptContext> PartialOrd<SortedMultiVec<Pk, Ctx>> for SortedMultiVec<Pk, Ctx>
impl<Pk: PartialOrd + MiniscriptKey, Ctx: PartialOrd + ScriptContext> PartialOrd<SortedMultiVec<Pk, Ctx>> for SortedMultiVec<Pk, Ctx>
source§fn partial_cmp(&self, other: &SortedMultiVec<Pk, Ctx>) -> Option<Ordering>
fn partial_cmp(&self, other: &SortedMultiVec<Pk, Ctx>) -> Option<Ordering>
1.0.0 · source§fn le(&self, other: &Rhs) -> bool
fn le(&self, other: &Rhs) -> bool
self
and other
) and is used by the <=
operator. Read more