Struct TapNodeHash

pub struct TapNodeHash(/* private fields */);

Trait Implementations

impl AsRef<[u8]> for TapNodeHash

fn as_ref(&self) -> &[u8]

Converts this type into a shared reference of the (usually inferred) input type.

impl AsRef<Array<u8, 32>> for TapNodeHash

fn as_ref(&self) -> &Array<u8, 32>

Converts this type into a shared reference of the (usually inferred) input type.

impl Borrow<[u8]> for TapNodeHash

fn borrow(&self) -> &[u8]

Immutably borrows from an owned value.

impl Borrow<Array<u8, 32>> for TapNodeHash

fn borrow(&self) -> &Array<u8, 32>

Immutably borrows from an owned value.

impl Clone for TapNodeHash

fn clone(&self) -> TapNodeHash

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for TapNodeHash

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for TapNodeHash

fn deserialize<__D>( __deserializer: __D, ) -> Result<TapNodeHash, <__D as Deserializer<'de>>::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Display for TapNodeHash

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

Formats the value using the given formatter.

impl From<[u8; 32]> for TapNodeHash

fn from(v: [u8; 32]) -> TapNodeHash

Converts to this type from the input type.

impl From<Array<u8, 32>> for TapNodeHash

fn from(v: Array<u8, 32>) -> TapNodeHash

Converts to this type from the input type.

impl From<TapBranchHash> for TapNodeHash

fn from(v: TapBranchHash) -> TapNodeHash

Converts to this type from the input type.

impl From<TapLeafHash> for TapNodeHash

fn from(v: TapLeafHash) -> TapNodeHash

Converts to this type from the input type.

impl From<TapNodeHash> for Array<u8, 32>

fn from(wrapped: TapNodeHash) -> Array<u8, 32>

Converts to this type from the input type.

impl FromHex for TapNodeHash

fn from_byte_iter<I>(iter: I) -> Result<TapNodeHash, Error>

where I: Iterator<Item = Result<u8, Error>> + ExactSizeIterator + DoubleEndedIterator,

Produce an object from a byte iterator

fn from_hex(s: &str) -> Result<Self, Error>

Produce an object from a hex string

impl FromStr for TapNodeHash

type Err = <<TapNodeHash as Wrapper>::Inner as FromStr>::Err

The associated error which can be returned from parsing.

fn from_str(s: &str) -> Result<TapNodeHash, <TapNodeHash as FromStr>::Err>

Parses a string s to return a value of this type.

impl Hash for TapNodeHash

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 Index<Range<usize>> for TapNodeHash

type Output = <Array<u8, 32> as Index<Range<usize>>>::Output

The returned type after indexing.

fn index( &self, index: Range<usize>, ) -> &<TapNodeHash as Index<Range<usize>>>::Output

Performs the indexing (container[index]) operation.

impl Index<RangeFrom<usize>> for TapNodeHash

type Output = <Array<u8, 32> as Index<RangeFrom<usize>>>::Output

The returned type after indexing.

fn index( &self, index: RangeFrom<usize>, ) -> &<TapNodeHash as Index<RangeFrom<usize>>>::Output

Performs the indexing (container[index]) operation.

impl Index<RangeFull> for TapNodeHash

type Output = <Array<u8, 32> as Index<RangeFull>>::Output

The returned type after indexing.

fn index(&self, index: RangeFull) -> &<TapNodeHash as Index<RangeFull>>::Output

Performs the indexing (container[index]) operation.

impl Index<RangeInclusive<usize>> for TapNodeHash

type Output = <Array<u8, 32> as Index<RangeInclusive<usize>>>::Output

The returned type after indexing.

fn index( &self, index: RangeInclusive<usize>, ) -> &<TapNodeHash as Index<RangeInclusive<usize>>>::Output

Performs the indexing (container[index]) operation.

impl Index<RangeTo<usize>> for TapNodeHash

type Output = <Array<u8, 32> as Index<RangeTo<usize>>>::Output

The returned type after indexing.

fn index( &self, index: RangeTo<usize>, ) -> &<TapNodeHash as Index<RangeTo<usize>>>::Output

Performs the indexing (container[index]) operation.

impl Index<RangeToInclusive<usize>> for TapNodeHash

type Output = <Array<u8, 32> as Index<RangeInclusive<usize>>>::Output

The returned type after indexing.

fn index( &self, index: RangeToInclusive<usize>, ) -> &<TapNodeHash as Index<RangeToInclusive<usize>>>::Output

Performs the indexing (container[index]) operation.

impl Index<usize> for TapNodeHash

type Output = <Array<u8, 32> as Index<usize>>::Output

The returned type after indexing.

fn index(&self, index: usize) -> &<TapNodeHash as Index<usize>>::Output

Performs the indexing (container[index]) operation.

impl IntoTapHash for TapNodeHash

fn into_tap_hash(self) -> TapNodeHash

impl LowerHex for TapNodeHash

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

Formats the value using the given formatter.

impl Ord for TapNodeHash

fn cmp(&self, other: &TapNodeHash) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

where Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized,

Restrict a value to a certain interval.

impl PartialEq for TapNodeHash

fn eq(&self, other: &TapNodeHash) -> 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 PartialOrd for TapNodeHash

fn partial_cmp(&self, other: &TapNodeHash) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

fn lt(&self, other: &Rhs) -> bool

Tests less than (for self and other) and is used by the < operator.

fn le(&self, other: &Rhs) -> bool

Tests less than or equal to (for self and other) and is used by the <= operator.

fn gt(&self, other: &Rhs) -> bool

Tests greater than (for self and other) and is used by the > operator.

fn ge(&self, other: &Rhs) -> bool

Tests greater than or equal to (for self and other) and is used by the >= operator.

impl Serialize for TapNodeHash

fn serialize<__S>( &self, __serializer: __S, ) -> Result<<__S as Serializer>::Ok, <__S as Serializer>::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl StrictDecode for TapNodeHash

fn strict_decode( reader: &mut impl TypedRead, ) -> Result<TapNodeHash, DecodeError>

fn strict_read(reader: impl ReadRaw) -> Result<Self, DecodeError>

impl StrictDumb for TapNodeHash

fn strict_dumb() -> TapNodeHash

impl StrictEncode for TapNodeHash

fn strict_encode<W>(&self, writer: W) -> Result<W, Error>

where W: TypedWrite,

fn strict_write(&self, writer: impl WriteRaw) -> Result<(), Error>

impl StrictTuple for TapNodeHash

const FIELD_COUNT: u8 = 1u8

fn strict_check_fields()

fn strict_type_info() -> TypeInfo<Self>

impl StrictType for TapNodeHash

const STRICT_LIB_NAME: &'static str = LIB_NAME_BITCOIN

fn strict_name() -> Option<TypeName>

impl UpperHex for TapNodeHash

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

Formats the value using the given formatter.

impl Wrapper for TapNodeHash

type Inner = Array<u8, 32>

Inner type wrapped by the current newtype

fn from_inner(inner: <TapNodeHash as Wrapper>::Inner) -> TapNodeHash

Instantiates wrapper type with the inner data

fn as_inner(&self) -> &<TapNodeHash as Wrapper>::Inner

Returns reference to the inner representation for the wrapper type

fn into_inner(self) -> <TapNodeHash as Wrapper>::Inner

Unwraps the wrapper returning the inner type

fn to_inner(&self) -> Self::Inner

where Self::Inner: Clone,

Clones inner data of the wrapped type and return them

fn copy(&self) -> Self

where Self: Sized, Self::Inner: Copy,

Copies the wrapped type

impl Copy for TapNodeHash

impl Eq for TapNodeHash

impl StrictProduct for TapNodeHash

impl StructuralPartialEq for TapNodeHash