pub struct TapScript(/* private fields */);
Implementations§
Source§impl TapScript
impl TapScript
pub fn new() -> TapScript
pub fn with_capacity(capacity: usize) -> TapScript
Sourcepub fn from_unsafe(script_bytes: Vec<u8>) -> TapScript
pub fn from_unsafe(script_bytes: Vec<u8>) -> TapScript
Constructs script object assuming the script length is less than 4GB. Panics otherwise.
pub fn tap_leaf_hash(&self) -> TapLeafHash
Sourcepub fn push_opcode(&mut self, op_code: TapCode)
pub fn push_opcode(&mut self, op_code: TapCode)
Adds a single opcode to the script.
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>
Available on crate feature std
only.
pub fn remove(&mut self, elem: &T) -> Result<bool, Error>
std
only.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>
Available on crate feature std
only.
pub fn take(&mut self, elem: &T) -> Result<Option<T>, Error>
std
only.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.
Sourcepub fn remove(&mut self, key: &K) -> Result<Option<V>, Error>
Available on crate feature std
only.
pub fn remove(&mut self, key: &K) -> Result<Option<V>, Error>
std
only.Removes an element from the map. Errors if the index exceeds the number of elements in the map, of if the new collection length will be less than the confinement requirement. Returns the removed value otherwise.
Trait Implementations§
Source§impl AsRef<ScriptBytes> for TapScript
impl AsRef<ScriptBytes> for TapScript
Source§fn as_ref(&self) -> &ScriptBytes
fn as_ref(&self) -> &ScriptBytes
Source§impl Borrow<ScriptBytes> for TapScript
impl Borrow<ScriptBytes> for TapScript
Source§fn borrow(&self) -> &ScriptBytes
fn borrow(&self) -> &ScriptBytes
Source§impl CommitVerify<TapretCommitment, TapretFirst> for TapScript
impl CommitVerify<TapretCommitment, TapretFirst> for TapScript
Source§fn commit(commitment: &TapretCommitment) -> TapScript
fn commit(commitment: &TapretCommitment) -> TapScript
Tapret script consists of 29 OP_RESERVED
pushes, followed by
OP_RETURN
, OP_PUSHBYTES_33
and serialized commitment data (MPC
commitment + nonce as a single slice).
Source§impl ConsensusDecode for TapScript
impl ConsensusDecode for TapScript
fn consensus_decode( reader: &mut impl Read, ) -> Result<TapScript, ConsensusDecodeError>
fn consensus_deserialize( bytes: impl AsRef<[u8]>, ) -> Result<Self, ConsensusDecodeError>
Source§impl ConsensusEncode for TapScript
impl ConsensusEncode for TapScript
Source§impl<'de> Deserialize<'de> for TapScript
impl<'de> Deserialize<'de> for TapScript
Source§fn deserialize<__D>(
__deserializer: __D,
) -> Result<TapScript, <__D as Deserializer<'de>>::Error>where
__D: Deserializer<'de>,
fn deserialize<__D>(
__deserializer: __D,
) -> Result<TapScript, <__D as Deserializer<'de>>::Error>where
__D: Deserializer<'de>,
Source§impl From<ScriptBytes> for TapScript
impl From<ScriptBytes> for TapScript
Source§fn from(v: ScriptBytes) -> TapScript
fn from(v: ScriptBytes) -> TapScript
Source§impl From<TapScript> for LeafScript
impl From<TapScript> for LeafScript
Source§fn from(tap_script: TapScript) -> LeafScript
fn from(tap_script: TapScript) -> LeafScript
Source§impl From<TapScript> for ScriptBytes
impl From<TapScript> for ScriptBytes
Source§fn from(wrapped: TapScript) -> ScriptBytes
fn from(wrapped: TapScript) -> ScriptBytes
Source§impl Ord for TapScript
impl Ord for TapScript
Source§impl PartialOrd for TapScript
impl PartialOrd for TapScript
Source§impl Serialize for TapScript
impl Serialize for TapScript
Source§fn serialize<__S>(
&self,
__serializer: __S,
) -> Result<<__S as Serializer>::Ok, <__S as Serializer>::Error>where
__S: Serializer,
fn serialize<__S>(
&self,
__serializer: __S,
) -> Result<<__S as Serializer>::Ok, <__S as Serializer>::Error>where
__S: Serializer,
Source§impl StrictDecode for TapScript
impl StrictDecode for TapScript
fn strict_decode(reader: &mut impl TypedRead) -> Result<TapScript, DecodeError>
fn strict_read(reader: impl ReadRaw) -> Result<Self, DecodeError>
Source§impl StrictEncode for TapScript
impl StrictEncode for TapScript
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 TapScript
impl StrictTuple for TapScript
const FIELD_COUNT: u8 = 1u8
fn strict_check_fields()
fn strict_type_info() -> TypeInfo<Self>
Source§impl StrictType for TapScript
impl StrictType for TapScript
const STRICT_LIB_NAME: &'static str = LIB_NAME_BITCOIN
fn strict_name() -> Option<TypeName>
Source§impl Wrapper for TapScript
impl Wrapper for TapScript
Source§type Inner = ScriptBytes
type Inner = ScriptBytes
Source§fn from_inner(inner: <TapScript as Wrapper>::Inner) -> TapScript
fn from_inner(inner: <TapScript as Wrapper>::Inner) -> TapScript
Source§fn as_inner(&self) -> &<TapScript as Wrapper>::Inner
fn as_inner(&self) -> &<TapScript as Wrapper>::Inner
Source§fn into_inner(self) -> <TapScript as Wrapper>::Inner
fn into_inner(self) -> <TapScript as Wrapper>::Inner
Source§impl WrapperMut for TapScript
impl WrapperMut for TapScript
impl Eq for TapScript
impl StrictProduct for TapScript
impl StructuralPartialEq for TapScript
Auto Trait Implementations§
impl Freeze for TapScript
impl RefUnwindSafe for TapScript
impl Send for TapScript
impl Sync for TapScript
impl Unpin for TapScript
impl UnwindSafe for TapScript
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
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.