Struct bpstd::TapLeafHash 
source · pub struct TapLeafHash(/* private fields */);Implementations§
source§impl TapLeafHash
 
impl TapLeafHash
pub fn with_leaf_script(leaf_script: &LeafScript) -> TapLeafHash
pub fn with_tap_script(tap_script: &TapScript) -> TapLeafHash
Trait Implementations§
source§impl Borrow<[u8]> for TapLeafHash
 
impl Borrow<[u8]> for TapLeafHash
source§impl Clone for TapLeafHash
 
impl Clone for TapLeafHash
source§fn clone(&self) -> TapLeafHash
 
fn clone(&self) -> TapLeafHash
Returns a copy of the value. Read more
1.0.0 · source§fn clone_from(&mut self, source: &Self)
 
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from 
source. Read moresource§impl Debug for TapLeafHash
 
impl Debug for TapLeafHash
source§impl Decode for TapLeafHash
 
impl Decode for TapLeafHash
fn decode(reader: &mut impl Read) -> Result<TapLeafHash, DecodeError>
fn deserialize(bytes: impl AsRef<[u8]>) -> Result<Self, PsbtError>
source§impl Display for TapLeafHash
 
impl Display for TapLeafHash
source§impl Encode for TapLeafHash
 
impl Encode for TapLeafHash
source§impl From<TapLeafHash> for TapNodeHash
 
impl From<TapLeafHash> for TapNodeHash
source§fn from(v: TapLeafHash) -> TapNodeHash
 
fn from(v: TapLeafHash) -> TapNodeHash
Converts to this type from the input type.
source§impl FromHex for TapLeafHash
 
impl FromHex for TapLeafHash
source§fn from_byte_iter<I>(iter: I) -> Result<TapLeafHash, Error>
 
fn from_byte_iter<I>(iter: I) -> Result<TapLeafHash, Error>
Produce an object from a byte iterator
source§impl FromStr for TapLeafHash
 
impl FromStr for TapLeafHash
source§impl Hash for TapLeafHash
 
impl Hash for TapLeafHash
source§impl Index<RangeFull> for TapLeafHash
 
impl Index<RangeFull> for TapLeafHash
source§impl Index<RangeInclusive<usize>> for TapLeafHash
 
impl Index<RangeInclusive<usize>> for TapLeafHash
§type Output = <Array<u8, 32> as Index<RangeInclusive<usize>>>::Output
 
type Output = <Array<u8, 32> as Index<RangeInclusive<usize>>>::Output
The returned type after indexing.
source§fn index(
    &self,
    index: RangeInclusive<usize>
) -> &<TapLeafHash as Index<RangeInclusive<usize>>>::Output
 
fn index( &self, index: RangeInclusive<usize> ) -> &<TapLeafHash as Index<RangeInclusive<usize>>>::Output
Performs the indexing (
container[index]) operation. Read moresource§impl Index<RangeToInclusive<usize>> for TapLeafHash
 
impl Index<RangeToInclusive<usize>> for TapLeafHash
§type Output = <Array<u8, 32> as Index<RangeInclusive<usize>>>::Output
 
type Output = <Array<u8, 32> as Index<RangeInclusive<usize>>>::Output
The returned type after indexing.
source§fn index(
    &self,
    index: RangeToInclusive<usize>
) -> &<TapLeafHash as Index<RangeToInclusive<usize>>>::Output
 
fn index( &self, index: RangeToInclusive<usize> ) -> &<TapLeafHash as Index<RangeToInclusive<usize>>>::Output
Performs the indexing (
container[index]) operation. Read moresource§impl Index<usize> for TapLeafHash
 
impl Index<usize> for TapLeafHash
source§impl IntoTapHash for TapLeafHash
 
impl IntoTapHash for TapLeafHash
fn into_tap_hash(self) -> TapNodeHash
source§impl LowerHex for TapLeafHash
 
impl LowerHex for TapLeafHash
source§impl Ord for TapLeafHash
 
impl Ord for TapLeafHash
source§fn cmp(&self, other: &TapLeafHash) -> Ordering
 
fn cmp(&self, other: &TapLeafHash) -> Ordering
1.21.0 · source§fn max(self, other: Self) -> Selfwhere
    Self: Sized,
 
fn max(self, other: Self) -> Selfwhere
    Self: Sized,
Compares and returns the maximum of two values. Read more
source§impl PartialEq for TapLeafHash
 
impl PartialEq for TapLeafHash
source§fn eq(&self, other: &TapLeafHash) -> bool
 
fn eq(&self, other: &TapLeafHash) -> bool
This method tests for 
self and other values to be equal, and is used
by ==.source§impl PartialOrd for TapLeafHash
 
impl PartialOrd for TapLeafHash
source§fn partial_cmp(&self, other: &TapLeafHash) -> Option<Ordering>
 
fn partial_cmp(&self, other: &TapLeafHash) -> Option<Ordering>
1.0.0 · source§fn le(&self, other: &Rhs) -> bool
 
fn le(&self, other: &Rhs) -> bool
This method tests less than or equal to (for 
self and other) and is used by the <=
operator. Read moresource§impl StrictDecode for TapLeafHash
 
impl StrictDecode for TapLeafHash
fn strict_decode( reader: &mut impl TypedRead ) -> Result<TapLeafHash, DecodeError>
fn strict_read(reader: impl ReadRaw) -> Result<Self, DecodeError>
source§impl StrictDumb for TapLeafHash
 
impl StrictDumb for TapLeafHash
fn strict_dumb() -> TapLeafHash
source§impl StrictEncode for TapLeafHash
 
impl StrictEncode for TapLeafHash
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 TapLeafHash
 
impl StrictTuple for TapLeafHash
const FIELD_COUNT: u8 = 1u8
fn strict_check_fields()
fn strict_type_info() -> TypeInfo<Self>
source§impl StrictType for TapLeafHash
 
impl StrictType for TapLeafHash
const STRICT_LIB_NAME: &'static str = LIB_NAME_BITCOIN
fn strict_name() -> Option<TypeName>
source§impl UpperHex for TapLeafHash
 
impl UpperHex for TapLeafHash
source§impl Wrapper for TapLeafHash
 
impl Wrapper for TapLeafHash
source§fn from_inner(inner: <TapLeafHash as Wrapper>::Inner) -> TapLeafHash
 
fn from_inner(inner: <TapLeafHash as Wrapper>::Inner) -> TapLeafHash
Instantiates wrapper type with the inner data
source§fn as_inner(&self) -> &<TapLeafHash as Wrapper>::Inner
 
fn as_inner(&self) -> &<TapLeafHash as Wrapper>::Inner
Returns reference to the inner representation for the wrapper type
source§fn into_inner(self) -> <TapLeafHash as Wrapper>::Inner
 
fn into_inner(self) -> <TapLeafHash as Wrapper>::Inner
Unwraps the wrapper returning the inner type
impl Copy for TapLeafHash
impl Eq for TapLeafHash
impl StrictProduct for TapLeafHash
impl StructuralPartialEq for TapLeafHash
Auto Trait Implementations§
impl Freeze for TapLeafHash
impl RefUnwindSafe for TapLeafHash
impl Send for TapLeafHash
impl Sync for TapLeafHash
impl Unpin for TapLeafHash
impl UnwindSafe for TapLeafHash
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
Mutably borrows from an owned value. Read more
source§impl<Id, const LEN: usize, const REVERSE_STR: bool> ByteArray<LEN> for Id
 
impl<Id, const LEN: usize, const REVERSE_STR: bool> ByteArray<LEN> for Id
source§fn from_byte_array(val: impl Into<[u8; LEN]>) -> Id
 
fn from_byte_array(val: impl Into<[u8; LEN]>) -> Id
Constructs a wrapper type around a byte array.
source§fn from_slice(slice: impl AsRef<[u8]>) -> Result<Id, FromSliceError>
 
fn from_slice(slice: impl AsRef<[u8]>) -> Result<Id, FromSliceError>
Constructs a byte array from the slice. Errors if the slice length
doesn’t match 
LEN constant generic.source§fn from_slice_unsafe(slice: impl AsRef<[u8]>) -> Id
 
fn from_slice_unsafe(slice: impl AsRef<[u8]>) -> Id
Constructs a byte array from the slice. Expects the slice length
doesn’t match 
LEN constant generic. Read moresource§fn to_byte_array(&self) -> [u8; LEN]
 
fn to_byte_array(&self) -> [u8; LEN]
Returns a byte array representation stored in the wrapped type.
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
Compare self to 
key and return true if they are equal.