Struct EraId

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

Era ID newtype.

Implementations

impl EraId

pub const MAX: EraId

Maximum possible value an EraId can hold.

pub const fn new(value: u64) -> EraId

Creates new EraId instance.

pub fn iter(&self, num_eras: u64) -> impl Iterator<Item = EraId>

Returns an iterator over era IDs of num_eras future eras starting from current.

pub fn iter_inclusive(&self, num_eras: u64) -> impl Iterator<Item = EraId>

Returns an iterator over era IDs of num_eras future eras starting from current, plus the provided one.

pub fn iter_range_inclusive( start: EraId, end: EraId, ) -> impl DoubleEndedIterator<Item = EraId>

Returns an iterator over a range of era IDs, starting from start and ending at end, inclusive.

pub fn increment(&mut self)

Increments the era.

For u64::MAX, this returns u64::MAX again: We want to make sure this doesn’t panic, and that era number will never be reached in practice.

pub fn successor(self) -> EraId

Returns a successor to current era.

For u64::MAX, this returns u64::MAX again: We want to make sure this doesn’t panic, and that era number will never be reached in practice.

pub fn predecessor(self) -> Option<EraId>

Returns the predecessor to current era, or None if genesis.

pub fn checked_add(&self, x: u64) -> Option<EraId>

Returns the current era plus x, or None if that would overflow

pub fn checked_sub(&self, x: u64) -> Option<EraId>

Returns the current era minus x, or None if that would be less than 0.

pub fn saturating_sub(&self, x: u64) -> EraId

Returns the current era minus x, or 0 if that would be less than 0.

pub fn saturating_add(self, rhs: u64) -> EraId

Returns the current era plus x, or EraId::MAX if overflow would occur.

pub fn saturating_mul(&self, x: u64) -> EraId

Returns the current era times x, or EraId::MAX if overflow would occur.

pub fn is_genesis(&self) -> bool

Returns whether this is era 0.

pub fn to_le_bytes(self) -> [u8; 8]

Returns little endian bytes.

pub fn value(self) -> u64

Returns a raw value held by this EraId instance.

You should prefer From trait implementations over this method where possible.

pub fn random(rng: &mut TestRng) -> Self

Available on crate feature testing only.

Returns a random EraId.

Trait Implementations

impl Add<u64> for EraId

type Output = EraId

The resulting type after applying the + operator.

fn add(self, x: u64) -> EraId

Performs the + operation.

impl AddAssign<u64> for EraId

fn add_assign(&mut self, x: u64)

Performs the += operation.

impl Arbitrary for EraId

type Parameters = <u64 as Arbitrary>::Parameters

The type of parameters that arbitrary_with accepts for configuration of the generated Strategy. Parameters must implement Default.

type Strategy = Map<<u64 as Arbitrary>::Strategy, fn(u64) -> EraId>

The type of Strategy used to generate values of type Self.

fn arbitrary_with(_top: Self::Parameters) -> Self::Strategy

Generates a Strategy for producing arbitrary values of type the implementing type (Self). The strategy is passed the arguments given in args.

fn arbitrary() -> Self::Strategy

Generates a Strategy for producing arbitrary values of type the implementing type (Self).

impl CLTyped for EraId

fn cl_type() -> CLType

The CLType of Self.

impl Clone for EraId

fn clone(&self) -> EraId

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl DataSize for EraId

const IS_DYNAMIC: bool = false

If true, the type has a heap size that can vary at runtime, depending on the actual value.

const STATIC_HEAP_SIZE: usize = 0usize

The amount of space a value of the type always occupies. If IS_DYNAMIC is false, this is the total amount of heap memory occupied by the value. Otherwise this is a lower bound.

fn estimate_heap_size(&self) -> usize

Estimates the size of heap memory taken up by this value.

impl Debug for EraId

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

Formats the value using the given formatter.

impl Default for EraId

fn default() -> EraId

Returns the “default value” for a type.

impl<'de> Deserialize<'de> for EraId

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Display for EraId

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

Formats the value using the given formatter.

impl From<EraId> for u64

fn from(era_id: EraId) -> Self

Converts to this type from the input type.

impl From<u64> for EraId

fn from(era_id: u64) -> Self

Converts to this type from the input type.

impl FromBytes for EraId

fn from_bytes(bytes: &[u8]) -> Result<(Self, &[u8]), Error>

Deserializes the slice into Self.

fn from_vec(bytes: Vec<u8>) -> Result<(Self, Vec<u8>), Error>

Deserializes the Vec<u8> into Self.

impl FromStr for EraId

type Err = ParseIntError

The associated error which can be returned from parsing.

fn from_str(s: &str) -> Result<Self, Self::Err>

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

impl Hash for EraId

fn hash<__H: Hasher>(&self, state: &mut __H)

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 JsonSchema for EraId

fn schema_name() -> String

The name of the generated JSON Schema.

fn schema_id() -> Cow<'static, str>

Returns a string that uniquely identifies the schema produced by this type.

fn json_schema(generator: &mut SchemaGenerator) -> Schema

Generates a JSON Schema for this type.

fn is_referenceable() -> bool

Whether JSON Schemas generated for this type should be re-used where possible using the $ref keyword.

impl Ord for EraId

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

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

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

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

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl Sub<u64> for EraId

type Output = EraId

The resulting type after applying the - operator.

fn sub(self, x: u64) -> EraId

Performs the - operation.

impl ToBytes for EraId

fn to_bytes(&self) -> Result<Vec<u8>, Error>

Serializes &self to a Vec<u8>.

fn serialized_length(&self) -> usize

Returns the length of the Vec<u8> which would be returned from a successful call to to_bytes() or into_bytes(). The data is not actually serialized, so this call is relatively cheap.

fn write_bytes(&self, writer: &mut Vec<u8>) -> Result<(), Error>

Writes &self into a mutable writer.

fn into_bytes(self) -> Result<Vec<u8>, Error>

where Self: Sized,

Consumes self and serializes to a Vec<u8>.

impl Copy for EraId

impl Eq for EraId

impl StructuralPartialEq for EraId