Struct FutureLeafVer

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

Inner type representing future (non-tapscript) leaf versions. See LeafVer::Future.

NB: NO PUBLIC CONSTRUCTOR! The only way to construct this is by converting u8 to LeafVer and then extracting it.

Implementations

impl FutureLeafVer

pub fn to_consensus(self) -> u8

Returns the consensus representation of this FutureLeafVer.

Trait Implementations

impl Clone for FutureLeafVer

fn clone(&self) -> FutureLeafVer

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for FutureLeafVer

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for FutureLeafVer

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

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Hash for FutureLeafVer

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 LowerHex for FutureLeafVer

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

Formats the value using the given formatter.

impl Ord for FutureLeafVer

fn cmp(&self, other: &FutureLeafVer) -> 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 FutureLeafVer

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

fn partial_cmp(&self, other: &FutureLeafVer) -> 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 FutureLeafVer

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 FutureLeafVer

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

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

impl StrictDumb for FutureLeafVer

fn strict_dumb() -> FutureLeafVer

impl StrictEncode for FutureLeafVer

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 FutureLeafVer

const FIELD_COUNT: u8 = 1u8

fn strict_check_fields()

fn strict_type_info() -> TypeInfo<Self>

impl StrictType for FutureLeafVer

const STRICT_LIB_NAME: &'static str = LIB_NAME_BITCOIN

fn strict_name() -> Option<TypeName>

impl UpperHex for FutureLeafVer

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

Formats the value using the given formatter.

impl Copy for FutureLeafVer

impl Eq for FutureLeafVer

impl StrictProduct for FutureLeafVer

impl StructuralPartialEq for FutureLeafVer