pub struct RedeemScript(/* private fields */);
Implementations§
Source§impl RedeemScript
impl RedeemScript
pub fn new() -> RedeemScript
pub fn with_capacity(capacity: usize) -> RedeemScript
Sourcepub fn from_unsafe(script_bytes: Vec<u8>) -> RedeemScript
pub fn from_unsafe(script_bytes: Vec<u8>) -> RedeemScript
Constructs script object assuming the script length is less than 4GB. Panics otherwise.
pub fn p2sh_wpkh(hash: impl Into<[u8; 20]>) -> RedeemScript
pub fn p2sh_wsh(hash: impl Into<[u8; 32]>) -> RedeemScript
pub fn is_p2sh_wpkh(&self) -> bool
pub fn is_p2sh_wsh(&self) -> bool
Sourcepub fn push_opcode(&mut self, op_code: OpCode)
pub fn push_opcode(&mut self, op_code: OpCode)
Adds a single opcode to the script.
pub fn to_script_pubkey(&self) -> ScriptPubkey
pub fn as_script_bytes(&self) -> &ScriptBytes
Methods from Deref<Target = ScriptBytes>§
Sourcepub fn push_slice(&mut self, data: &[u8])
pub fn push_slice(&mut self, data: &[u8])
Adds instructions to push some arbitrary data onto the stack.
§Panics
The method panics if data
length is greater or equal to
0x100000000.
pub fn len_var_int(&self) -> VarInt
Methods from Deref<Target = Confined<Vec<u8>, 0, bc::::coding::VarIntBytes::{constant#1}>>§
Sourcepub fn iter_mut(&'c mut self) -> <&'c mut C as IntoIterator>::IntoIter
pub fn iter_mut(&'c mut self) -> <&'c mut C as IntoIterator>::IntoIter
Returns an iterator that allows modifying each value.
The iterator yields all items from start to end.
Sourcepub fn values_mut(
&mut self,
) -> impl Iterator<Item = &mut <C as KeyedCollection>::Value>
pub fn values_mut( &mut self, ) -> impl Iterator<Item = &mut <C as KeyedCollection>::Value>
Returns an iterator that allows modifying each value for each key.
Sourcepub fn keyed_values_mut(
&mut self,
) -> impl Iterator<Item = (&<C as KeyedCollection>::Key, &mut <C as KeyedCollection>::Value)>
pub fn keyed_values_mut( &mut self, ) -> impl Iterator<Item = (&<C as KeyedCollection>::Key, &mut <C as KeyedCollection>::Value)>
Returns an iterator that allows modifying each value for each key.
Sourcepub fn as_inner(&self) -> &C
👎Deprecated since 4.7.0: use as_unconfined method
pub fn as_inner(&self) -> &C
Returns inner collection type
Sourcepub fn as_unconfined(&self) -> &C
pub fn as_unconfined(&self) -> &C
Returns reference to the inner collection type.
Sourcepub fn to_inner(&self) -> Cwhere
C: Clone,
👎Deprecated since 4.7.0: use to_unconfined method
pub fn to_inner(&self) -> Cwhere
C: Clone,
Clones inner collection type and returns it
Sourcepub fn to_unconfined(&self) -> Cwhere
C: Clone,
pub fn to_unconfined(&self) -> Cwhere
C: Clone,
Clones inner collection and returns an unconfined version of it.
Sourcepub fn push(&mut self, elem: <C as Collection>::Item) -> Result<(), Error>
pub fn push(&mut self, elem: <C as Collection>::Item) -> Result<(), Error>
Attempts to add a single element to the confined collection. Fails if the number of elements in the collection already maximal.
Sourcepub fn extend<T>(&mut self, iter: T) -> Result<(), Error>
pub fn extend<T>(&mut self, iter: T) -> Result<(), Error>
Attempts to add all elements from an iterator to the confined collection. Fails if the number of elements in the collection already maximal.
Sourcepub fn len_u8(&self) -> u8
pub fn len_u8(&self) -> u8
Returns number of elements in the confined collection as u8
. The
confinement guarantees that the collection length can’t exceed
u8::MAX
.
Sourcepub fn len_u16(&self) -> u16
pub fn len_u16(&self) -> u16
Returns number of elements in the confined collection as u16
. The
confinement guarantees that the collection length can’t exceed
u16::MAX
.
Sourcepub fn len_u24(&self) -> u24
pub fn len_u24(&self) -> u24
Returns number of elements in the confined collection as u24
. The
confinement guarantees that the collection length can’t exceed
u24::MAX
.
Sourcepub fn len_u32(&self) -> u32
pub fn len_u32(&self) -> u32
Returns number of elements in the confined collection as u32
. The
confinement guarantees that the collection length can’t exceed
u32::MAX
.
Sourcepub fn get_mut(
&mut self,
key: &<C as KeyedCollection>::Key,
) -> Option<&mut <C as KeyedCollection>::Value>
pub fn get_mut( &mut self, key: &<C as KeyedCollection>::Key, ) -> Option<&mut <C as KeyedCollection>::Value>
Gets mutable reference to an element of the collection.
Sourcepub fn insert(
&mut self,
key: <C as KeyedCollection>::Key,
value: <C as KeyedCollection>::Value,
) -> Result<Option<<C as KeyedCollection>::Value>, Error>
pub fn insert( &mut self, key: <C as KeyedCollection>::Key, value: <C as KeyedCollection>::Value, ) -> Result<Option<<C as KeyedCollection>::Value>, Error>
Inserts a new value into the confined collection under a given key. Fails if the collection already contains maximum number of elements allowed by the confinement.
Sourcepub fn entry(
&mut self,
key: <C as KeyedCollection>::Key,
) -> Result<<C as KeyedCollection>::Entry<'_>, Error>
pub fn entry( &mut self, key: <C as KeyedCollection>::Key, ) -> Result<<C as KeyedCollection>::Entry<'_>, Error>
Gets the given key’s corresponding entry in the map for in-place manipulation. Errors if the collection entry is vacant and the collection has already reached maximal size of its confinement.
Sourcepub fn pop(&mut self) -> Option<char>
pub fn pop(&mut self) -> Option<char>
Removes the last character from a string and returns it, or None
if
it is empty.
Sourcepub fn remove(&mut self, index: usize) -> Result<char, Error>
pub fn remove(&mut self, index: usize) -> Result<char, Error>
Removes a single character from the confined string, unless the string doesn’t shorten more than the confinement requirement. Errors otherwise.
Sourcepub fn pop(&mut self) -> Option<AsciiChar>
pub fn pop(&mut self) -> Option<AsciiChar>
Removes the last character from a string and returns it, or None
if
it is empty.
Sourcepub fn remove(&mut self, index: usize) -> Result<AsciiChar, Error>
pub fn remove(&mut self, index: usize) -> Result<AsciiChar, Error>
Removes a single character from the confined string, unless the string doesn’t shorten more than the confinement requirement. Errors otherwise.
Sourcepub fn get_mut<I>(
&mut self,
index: I,
) -> Option<&mut <I as SliceIndex<[T]>>::Output>where
I: SliceIndex<[T]>,
pub fn get_mut<I>(
&mut self,
index: I,
) -> Option<&mut <I as SliceIndex<[T]>>::Output>where
I: SliceIndex<[T]>,
Gets the mutable element of a vector
Sourcepub fn pop(&mut self) -> Option<T>
pub fn pop(&mut self) -> Option<T>
Removes the last element from a vector and returns it, or None
if it
is empty.
Sourcepub fn remove(&mut self, index: usize) -> Result<T, Error>
pub fn remove(&mut self, index: usize) -> Result<T, Error>
Removes an element from the vector at a given index. Errors if the index exceeds the number of elements in the vector, of if the new vector length will be less than the confinement requirement. Returns the removed element otherwise.
Sourcepub fn iter(&self) -> Iter<'_, T>
pub fn iter(&self) -> Iter<'_, T>
Returns an iterator over the slice.
The iterator yields all items from start to end.
Sourcepub fn pop_front(&mut self) -> Option<T>
pub fn pop_front(&mut self) -> Option<T>
Removes the first element and returns it, or None
if the deque is
empty.
Sourcepub fn pop_back(&mut self) -> Option<T>
pub fn pop_back(&mut self) -> Option<T>
Removes the last element and returns it, or None
if the deque is
empty.
Sourcepub fn push_front(&mut self, elem: T) -> Result<(), Error>
pub fn push_front(&mut self, elem: T) -> Result<(), Error>
Prepends an element to the deque. Errors if the new collection length will not fit the confinement requirements.
pub fn push_from(&mut self, elem: T) -> Result<(), Error>
push_front
Sourcepub fn push_back(&mut self, elem: T) -> Result<(), Error>
pub fn push_back(&mut self, elem: T) -> Result<(), Error>
Appends an element to the deque. Errors if the new collection length will not fit the confinement requirements.
Sourcepub fn remove(&mut self, index: usize) -> Result<T, Error>
pub fn remove(&mut self, index: usize) -> Result<T, Error>
Removes an element from the deque at a given index. Errors if the index exceeds the number of elements in the deque, of if the new deque length will be less than the confinement requirement. Returns the removed element otherwise.
Sourcepub fn drain<R>(&mut self, range: R) -> Drain<'_, T>where
R: RangeBounds<usize>,
pub fn drain<R>(&mut self, range: R) -> Drain<'_, T>where
R: RangeBounds<usize>,
Removes the specified range from the deque in bulk, returning all removed elements as an iterator. If the iterator is dropped before being fully consumed, it drops the remaining removed elements.
The returned iterator keeps a mutable borrow on the queue to optimize its implementation.
§Panics
Panics if the starting point is greater than the end point or if the end point is greater than the length of the deque.
§Leaking
If the returned iterator goes out of scope without being dropped (due to
[mem::forget
], for example), the deque may have lost and leaked
elements arbitrarily, including elements outside the range.
Sourcepub fn truncate(&mut self, len: usize)
pub fn truncate(&mut self, len: usize)
Shortens the deque, keeping the first len
elements and dropping
the rest.
If len
is greater or equal to the deque’s current length, this has
no effect.
Sourcepub fn remove(&mut self, elem: &T) -> Result<bool, Error>
pub fn remove(&mut self, elem: &T) -> Result<bool, Error>
Removes an element from the set. Errors if the index exceeds the number of elements in the set, of if the new collection length will be less than the confinement requirement. Returns if the element was present in the set.
Sourcepub fn take(&mut self, elem: &T) -> Result<Option<T>, Error>
pub fn take(&mut self, elem: &T) -> Result<Option<T>, Error>
Removes an element from the set. Errors if the index exceeds the number of elements in the set, of if the new collection length will be less than the confinement requirement. Returns the removed element otherwise.
Sourcepub fn remove(&mut self, elem: &T) -> Result<bool, Error>
pub fn remove(&mut self, elem: &T) -> Result<bool, Error>
Removes an element from the set. Errors if the index exceeds the number of elements in the set, of if the new collection length will be less than the confinement requirement. Returns if the element was present in the set.
Sourcepub fn take(&mut self, elem: &T) -> Result<Option<T>, Error>
pub fn take(&mut self, elem: &T) -> Result<Option<T>, Error>
Removes an element from the set. Errors if the index exceeds the number of elements in the set, of if the new collection length will be less than the confinement requirement. Returns the removed element otherwise.
Trait Implementations§
Source§impl AsMut<<RedeemScript as Wrapper>::Inner> for RedeemScript
impl AsMut<<RedeemScript as Wrapper>::Inner> for RedeemScript
Source§impl AsMut<[u8]> for RedeemScript
impl AsMut<[u8]> for RedeemScript
Source§impl AsRef<[u8]> for RedeemScript
impl AsRef<[u8]> for RedeemScript
Source§impl AsRef<ScriptBytes> for RedeemScript
impl AsRef<ScriptBytes> for RedeemScript
Source§fn as_ref(&self) -> &ScriptBytes
fn as_ref(&self) -> &ScriptBytes
Source§impl Borrow<ScriptBytes> for RedeemScript
impl Borrow<ScriptBytes> for RedeemScript
Source§fn borrow(&self) -> &ScriptBytes
fn borrow(&self) -> &ScriptBytes
Source§impl BorrowMut<<RedeemScript as Wrapper>::Inner> for RedeemScript
impl BorrowMut<<RedeemScript as Wrapper>::Inner> for RedeemScript
Source§fn borrow_mut(&mut self) -> &mut <RedeemScript as Wrapper>::Inner
fn borrow_mut(&mut self) -> &mut <RedeemScript as Wrapper>::Inner
Source§impl Clone for RedeemScript
impl Clone for RedeemScript
Source§fn clone(&self) -> RedeemScript
fn clone(&self) -> RedeemScript
1.0.0 · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
source
. Read moreSource§impl ConsensusDecode for RedeemScript
impl ConsensusDecode for RedeemScript
fn consensus_decode( reader: &mut impl Read, ) -> Result<RedeemScript, ConsensusDecodeError>
fn consensus_deserialize( bytes: impl AsRef<[u8]>, ) -> Result<Self, ConsensusDecodeError>
Source§impl ConsensusEncode for RedeemScript
impl ConsensusEncode for RedeemScript
Source§impl Debug for RedeemScript
impl Debug for RedeemScript
Source§impl Default for RedeemScript
impl Default for RedeemScript
Source§fn default() -> RedeemScript
fn default() -> RedeemScript
Source§impl Deref for RedeemScript
impl Deref for RedeemScript
Source§type Target = ScriptBytes
type Target = ScriptBytes
Source§impl DerefMut for RedeemScript
impl DerefMut for RedeemScript
Source§impl From<&RedeemScript> for ScriptHash
impl From<&RedeemScript> for ScriptHash
Source§fn from(redeem_script: &RedeemScript) -> ScriptHash
fn from(redeem_script: &RedeemScript) -> ScriptHash
Source§impl From<RedeemScript> for ScriptBytes
impl From<RedeemScript> for ScriptBytes
Source§fn from(wrapped: RedeemScript) -> ScriptBytes
fn from(wrapped: RedeemScript) -> ScriptBytes
Source§impl From<ScriptBytes> for RedeemScript
impl From<ScriptBytes> for RedeemScript
Source§fn from(v: ScriptBytes) -> RedeemScript
fn from(v: ScriptBytes) -> RedeemScript
Source§impl FromHex for RedeemScript
impl FromHex for RedeemScript
Source§fn from_byte_iter<I>(iter: I) -> Result<RedeemScript, Error>
fn from_byte_iter<I>(iter: I) -> Result<RedeemScript, Error>
Source§impl Hash for RedeemScript
impl Hash for RedeemScript
Source§impl LowerHex for RedeemScript
impl LowerHex for RedeemScript
Source§impl Ord for RedeemScript
impl Ord for RedeemScript
Source§fn cmp(&self, other: &RedeemScript) -> Ordering
fn cmp(&self, other: &RedeemScript) -> Ordering
1.21.0 · Source§fn max(self, other: Self) -> Selfwhere
Self: Sized,
fn max(self, other: Self) -> Selfwhere
Self: Sized,
Source§impl PartialEq for RedeemScript
impl PartialEq for RedeemScript
Source§impl PartialOrd for RedeemScript
impl PartialOrd for RedeemScript
Source§impl StrictDecode for RedeemScript
impl StrictDecode for RedeemScript
fn strict_decode( reader: &mut impl TypedRead, ) -> Result<RedeemScript, DecodeError>
fn strict_read(reader: impl ReadRaw) -> Result<Self, DecodeError>
Source§impl StrictEncode for RedeemScript
impl StrictEncode for RedeemScript
fn strict_encode<W>(&self, writer: W) -> Result<W, Error>where
W: TypedWrite,
fn strict_write(&self, writer: impl WriteRaw) -> Result<(), Error>
Source§impl StrictTuple for RedeemScript
impl StrictTuple for RedeemScript
const FIELD_COUNT: u8 = 1u8
fn strict_check_fields()
fn strict_type_info() -> TypeInfo<Self>
Source§impl StrictType for RedeemScript
impl StrictType for RedeemScript
const STRICT_LIB_NAME: &'static str = LIB_NAME_BITCOIN
fn strict_name() -> Option<TypeName>
Source§impl UpperHex for RedeemScript
impl UpperHex for RedeemScript
Source§impl Wrapper for RedeemScript
impl Wrapper for RedeemScript
Source§type Inner = ScriptBytes
type Inner = ScriptBytes
Source§fn from_inner(inner: <RedeemScript as Wrapper>::Inner) -> RedeemScript
fn from_inner(inner: <RedeemScript as Wrapper>::Inner) -> RedeemScript
Source§fn as_inner(&self) -> &<RedeemScript as Wrapper>::Inner
fn as_inner(&self) -> &<RedeemScript as Wrapper>::Inner
Source§fn into_inner(self) -> <RedeemScript as Wrapper>::Inner
fn into_inner(self) -> <RedeemScript as Wrapper>::Inner
Source§impl WrapperMut for RedeemScript
impl WrapperMut for RedeemScript
Source§fn as_inner_mut(&mut self) -> &mut <RedeemScript as Wrapper>::Inner
fn as_inner_mut(&mut self) -> &mut <RedeemScript as Wrapper>::Inner
impl Eq for RedeemScript
impl StrictProduct for RedeemScript
impl StructuralPartialEq for RedeemScript
Auto Trait Implementations§
impl Freeze for RedeemScript
impl RefUnwindSafe for RedeemScript
impl Send for RedeemScript
impl Sync for RedeemScript
impl Unpin for RedeemScript
impl UnwindSafe for RedeemScript
Blanket Implementations§
Source§impl<T> Base32Len for T
impl<T> Base32Len for T
Source§fn base32_len(&self) -> usize
fn base32_len(&self) -> usize
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
Source§impl<T> CheckBase32<Vec<u5>> for T
impl<T> CheckBase32<Vec<u5>> for T
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<Q, K> Comparable<K> for Q
impl<Q, K> Comparable<K> for Q
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
key
and return true
if they are equal.