referrerpolicy=no-referrer-when-downgrade
pub struct Perquintill(/* private fields */);
Expand description

A fixed point representation of a number in the range [0, 1].

Parts per Quintillion

Implementations§

§

impl Perquintill

pub const fn from_parts(parts: u64) -> Perquintill

From an explicitly defined number of parts per maximum of the type.

pub const fn from_percent(x: u64) -> Perquintill

Converts a percent into Self. Equal to x / 100.

This can be created at compile time.

pub const fn one() -> Perquintill

pub fn is_one(&self) -> bool

pub const fn zero() -> Perquintill

pub fn is_zero(&self) -> bool

pub const fn deconstruct(self) -> u64

pub fn square(self) -> Perquintill

pub fn from_float(x: f64) -> Perquintill

pub fn from_rational_approximation<N>(p: N, q: N) -> Perquintill
where N: RationalArg + TryInto<u64> + TryInto<u128>, u64: Into<N>,

👎Deprecated: Use PerThing::from_rational instead

pub fn from_rational<N>(p: N, q: N) -> Perquintill
where N: RationalArg + TryInto<u64> + TryInto<u128>, u64: Into<N>,

pub fn int_mul(self, b: u64) -> Perquintill

Integer multiplication with another value, saturating at 1.

pub fn int_div(self, b: Perquintill) -> u64

Integer division with another value, rounding down.

pub fn mul_floor<N>(self, b: N) -> N

pub fn mul_ceil<N>(self, b: N) -> N

pub fn saturating_reciprocal_mul<N>(self, b: N) -> N

pub fn saturating_reciprocal_mul_floor<N>(self, b: N) -> N

pub fn saturating_reciprocal_mul_ceil<N>(self, b: N) -> N

pub fn saturating_div(self, rhs: Perquintill, r: Rounding) -> Perquintill

Saturating division. Compute self / rhs, saturating at one if rhs < self.

The rounding method must be specified. e.g.:

let pc = |x| Percent::from_percent(x);
assert_eq!(
	pc(2).saturating_div(pc(3), Down),
	pc(66),
);
assert_eq!(
	pc(1).saturating_div(pc(3), NearestPrefUp),
	pc(33),
);
assert_eq!(
	pc(2).saturating_div(pc(3), NearestPrefDown),
	pc(67),
);
assert_eq!(
	pc(1).saturating_div(pc(3), Up),
	pc(34),
);
§

impl Perquintill

pub const fn from_perthousand(x: u64) -> Perquintill

Converts a percent into Self. Equal to x / 1000.

This can be created at compile time.

Trait Implementations§

§

impl Add for Perquintill

§

type Output = Perquintill

The resulting type after applying the + operator.
§

fn add(self, rhs: Perquintill) -> <Perquintill as Add>::Output

Performs the + operation. Read more
§

impl Bounded for Perquintill

§

fn min_value() -> Perquintill

Returns the smallest finite number this type can represent
§

fn max_value() -> Perquintill

Returns the largest finite number this type can represent
§

impl CheckedAdd for Perquintill

§

fn checked_add(&self, rhs: &Perquintill) -> Option<Perquintill>

Adds two numbers, checking for overflow. If overflow happens, None is returned.
§

impl CheckedMul for Perquintill

§Note

CheckedMul will never fail for PerThings.

§

fn checked_mul(&self, rhs: &Perquintill) -> Option<Perquintill>

Multiplies two numbers, checking for underflow or overflow. If underflow or overflow happens, None is returned.
§

impl CheckedSub for Perquintill

§

fn checked_sub(&self, v: &Perquintill) -> Option<Perquintill>

Subtracts two numbers, checking for underflow. If underflow happens, None is returned.
§

impl Clone for Perquintill

§

fn clone(&self) -> Perquintill

Returns a copy of the value. Read more
1.0.0 · source§

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

Performs copy-assignment from source. Read more
§

impl CompactAs for Perquintill

Implementation makes any compact encoding of PerThing::Inner valid, when decoding it will saturate up to PerThing::ACCURACY.

§

type As = u64

A compact-encodable type that should be used as the encoding.
§

fn encode_as(&self) -> &<Perquintill as CompactAs>::As

Returns the compact-encodable type.
§

fn decode_from(x: <Perquintill as CompactAs>::As) -> Result<Perquintill, Error>

Decode Self from the compact-decoded type.
§

impl Debug for Perquintill

§

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

Formats the value using the given formatter. Read more
§

impl Decode for Perquintill

§

fn decode<I>(input: &mut I) -> Result<Perquintill, Error>
where I: Input,

Attempt to deserialise the value from input.
§

fn decode_into<I>( input: &mut I, dst: &mut MaybeUninit<Self>, ) -> Result<DecodeFinished, Error>
where I: Input,

Attempt to deserialize the value from input into a pre-allocated piece of memory. Read more
§

fn skip<I>(input: &mut I) -> Result<(), Error>
where I: Input,

Attempt to skip the encoded value from input. Read more
§

fn encoded_fixed_size() -> Option<usize>

Returns the fixed encoded size of the type. Read more
§

impl Default for Perquintill

§

fn default() -> Perquintill

Returns the “default value” for a type. Read more
§

impl<'de> Deserialize<'de> for Perquintill

§

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

Deserialize this value from the given Serde deserializer. Read more
§

impl<N> Div<N> for Perquintill
where u64: TryFrom<N>,

§

type Output = Perquintill

The resulting type after applying the / operator.
§

fn div(self, b: N) -> <Perquintill as Div<N>>::Output

Performs the / operation. Read more
§

impl Div for Perquintill

§

type Output = Perquintill

The resulting type after applying the / operator.
§

fn div(self, rhs: Perquintill) -> <Perquintill as Div>::Output

Performs the / operation. Read more
§

impl Encode for Perquintill

§

fn size_hint(&self) -> usize

If possible give a hint of expected size of the encoding. Read more
§

fn encode_to<__CodecOutputEdqy>( &self, __codec_dest_edqy: &mut __CodecOutputEdqy, )
where __CodecOutputEdqy: Output + ?Sized,

Convert self to a slice and append it to the destination.
§

fn encode(&self) -> Vec<u8>

Convert self to an owned vector.
§

fn using_encoded<__CodecOutputReturn, __CodecUsingEncodedCallback>( &self, f: __CodecUsingEncodedCallback, ) -> __CodecOutputReturn
where __CodecUsingEncodedCallback: FnOnce(&[u8]) -> __CodecOutputReturn,

Convert self to a slice and then invoke the given closure with it.
§

fn encoded_size(&self) -> usize

Calculates the encoded size. Read more
§

impl From<Compact<Perquintill>> for Perquintill

§

fn from(x: Compact<Perquintill>) -> Perquintill

Converts to this type from the input type.
§

impl MaxEncodedLen for Perquintill

§

fn max_encoded_len() -> usize

Upper bound, in bytes, of the maximum encoded size of this item.
§

impl<N> Mul<N> for Perquintill
where N: Div<Output = N> + Clone + Mul<Output = N> + UniqueSaturatedInto<u64> + Add<Output = N> + Rem<Output = N> + Unsigned, u64: Into<N>,

Non-overflow multiplication.

This is tailored to be used with a balance type.

§

type Output = N

The resulting type after applying the * operator.
§

fn mul(self, b: N) -> <Perquintill as Mul<N>>::Output

Performs the * operation. Read more
§

impl Mul<Weight> for Perquintill

§

type Output = Weight

The resulting type after applying the * operator.
§

fn mul(self, b: Weight) -> Weight

Performs the * operation. Read more
§

impl Mul for Perquintill

§

type Output = Perquintill

The resulting type after applying the * operator.
§

fn mul(self, rhs: Perquintill) -> <Perquintill as Mul>::Output

Performs the * operation. Read more
§

impl One for Perquintill

§

fn one() -> Perquintill

Returns the multiplicative identity element of Self, 1. Read more
source§

fn set_one(&mut self)

Sets self to the multiplicative identity element of Self, 1.
source§

fn is_one(&self) -> bool
where Self: PartialEq,

Returns true if self is equal to the multiplicative identity. Read more
§

impl Ord for Perquintill

§

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

This method returns an Ordering between self and other. Read more
1.21.0 · source§

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

Compares and returns the maximum of two values. Read more
1.21.0 · source§

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

Compares and returns the minimum of two values. Read more
1.50.0 · source§

fn clamp(self, min: Self, max: Self) -> Self
where Self: Sized + PartialOrd,

Restrict a value to a certain interval. Read more
§

impl PartialEq for Perquintill

§

fn eq(&self, other: &Perquintill) -> bool

This method tests for self and other values to be equal, and is used by ==.
1.0.0 · source§

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

This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.
§

impl PartialOrd for Perquintill

§

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

This method returns an ordering between self and other values if one exists. Read more
1.0.0 · source§

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

This method tests less than (for self and other) and is used by the < operator. Read more
1.0.0 · source§

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 more
1.0.0 · source§

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

This method tests greater than (for self and other) and is used by the > operator. Read more
1.0.0 · source§

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

This method tests greater than or equal to (for self and other) and is used by the >= operator. Read more
§

impl PerThing for Perquintill

§

fn deconstruct(self) -> <Perquintill as PerThing>::Inner

Consume self and return the number of parts per thing.

§

fn from_parts(parts: <Perquintill as PerThing>::Inner) -> Perquintill

Build this type from a number of parts per thing.

§

fn from_float(x: f64) -> Perquintill

NOTE: saturate to 0 or 1 if x is beyond [0, 1]

§

type Inner = u64

The data type used to build this per-thingy.
§

type Upper = u128

A data type larger than Self::Inner, used to avoid overflow in some computations. It must be able to compute ACCURACY^2.
§

const ACCURACY: <Perquintill as PerThing>::Inner = {transmute(0x0de0b6b3a7640000): <sp_runtime::Perquintill as sp_runtime::PerThing>::Inner}

The accuracy of this type.
§

fn from_rational_with_rounding<N>( p: N, q: N, r: Rounding, ) -> Result<Perquintill, ()>
where N: Clone + Ord + TryInto<<Perquintill as PerThing>::Inner> + TryInto<<Perquintill as PerThing>::Upper> + Div<Output = N> + Rem<Output = N> + Add<Output = N> + AddAssign + Unsigned + Zero + One + MultiplyRational, <Perquintill as PerThing>::Inner: Into<N>,

Approximate the fraction p/q into a per-thing fraction. Read more
§

fn zero() -> Self

Equivalent to Self::from_parts(0).
§

fn is_zero(&self) -> bool

Return true if this is nothing.
§

fn one() -> Self

Equivalent to Self::from_parts(Self::ACCURACY).
§

fn is_one(&self) -> bool

Return true if this is one.
§

fn less_epsilon(self) -> Self

Return the next lower value to self or self if it is already zero.
§

fn try_less_epsilon(self) -> Result<Self, Self>

Return the next lower value to self or an error with the same value if self is already zero.
§

fn plus_epsilon(self) -> Self

Return the next higher value to self or self if it is already one.
§

fn try_plus_epsilon(self) -> Result<Self, Self>

Return the next higher value to self or an error with the same value if self is already one.
§

fn from_percent(x: Self::Inner) -> Self

Build this type from a percent. Equivalent to Self::from_parts(x * Self::ACCURACY / 100) but more accurate and can cope with potential type overflows.
§

fn square(self) -> Self

Return the product of multiplication of this value by itself.
§

fn left_from_one(self) -> Self

Return the part left when self is saturating-subtracted from Self::one().
§

fn mul_floor<N>(self, b: N) -> N
where N: MultiplyArg + UniqueSaturatedInto<Self::Inner>, Self::Inner: Into<N>,

Multiplication that always rounds down to a whole number. The standard Mul rounds to the nearest whole number. Read more
§

fn mul_ceil<N>(self, b: N) -> N
where N: MultiplyArg + UniqueSaturatedInto<Self::Inner>, Self::Inner: Into<N>,

Multiplication that always rounds the result up to a whole number. The standard Mul rounds to the nearest whole number. Read more
§

fn saturating_reciprocal_mul<N>(self, b: N) -> N
where N: ReciprocalArg + UniqueSaturatedInto<Self::Inner>, Self::Inner: Into<N>,

Saturating multiplication by the reciprocal of self. The result is rounded to the nearest whole number and saturates at the numeric bounds instead of overflowing. Read more
§

fn saturating_reciprocal_mul_floor<N>(self, b: N) -> N
where N: ReciprocalArg + UniqueSaturatedInto<Self::Inner>, Self::Inner: Into<N>,

Saturating multiplication by the reciprocal of self. The result is rounded down to the nearest whole number and saturates at the numeric bounds instead of overflowing. Read more
§

fn saturating_reciprocal_mul_ceil<N>(self, b: N) -> N
where N: ReciprocalArg + UniqueSaturatedInto<Self::Inner>, Self::Inner: Into<N>,

Saturating multiplication by the reciprocal of self. The result is rounded up to the nearest whole number and saturates at the numeric bounds instead of overflowing. Read more
§

fn from_fraction(x: f64) -> Self

👎Deprecated: Use from_float instead
Same as Self::from_float.
§

fn from_rational<N>(p: N, q: N) -> Self
where N: RationalArg + TryInto<Self::Inner> + TryInto<Self::Upper>, Self::Inner: Into<N>,

Approximate the fraction p/q into a per-thing fraction. This will never overflow. Read more
§

fn from_rational_approximation<N>(p: N, q: N) -> Self
where N: RationalArg + TryInto<Self::Inner> + TryInto<Self::Upper>, Self::Inner: Into<N>,

👎Deprecated: Use from_rational instead
Same as Self::from_rational.
§

impl Pow<usize> for Perquintill

§

type Output = Perquintill

The result after applying the operator.
§

fn pow(self, exp: usize) -> <Perquintill as Pow<usize>>::Output

Returns self to the power rhs. Read more
§

impl Saturating for Perquintill

§

fn saturating_add(self, rhs: Perquintill) -> Perquintill

Saturating addition. Compute self + rhs, saturating at the numeric bounds instead of overflowing. This operation is lossless if it does not saturate.

§

fn saturating_sub(self, rhs: Perquintill) -> Perquintill

Saturating subtraction. Compute self - rhs, saturating at the numeric bounds instead of overflowing. This operation is lossless if it does not saturate.

§

fn saturating_mul(self, rhs: Perquintill) -> Perquintill

Saturating multiply. Compute self * rhs, saturating at the numeric bounds instead of overflowing. This operation is lossy.

§

fn saturating_pow(self, exp: usize) -> Perquintill

Saturating exponentiation. Computes self.pow(exp), saturating at the numeric bounds instead of overflowing. This operation is lossy.

§

fn saturating_less_one(self) -> Self
where Self: One,

Decrement self by one, saturating at zero.
§

fn saturating_plus_one(self) -> Self
where Self: One,

Increment self by one, saturating at the numeric bounds instead of overflowing.
§

fn saturating_inc(&mut self)
where Self: One,

Increment self by one, saturating.
§

fn saturating_dec(&mut self)
where Self: One,

Decrement self by one, saturating at zero.
§

fn saturating_accrue(&mut self, amount: Self)
where Self: One,

Increment self by some amount, saturating.
§

fn saturating_reduce(&mut self, amount: Self)
where Self: One,

Decrement self by some amount, saturating at zero.
§

impl SaturatingAdd for Perquintill

§

fn saturating_add(&self, v: &Perquintill) -> Perquintill

Saturating addition. Computes self + other, saturating at the relevant high or low boundary of the type.
§

impl SaturatingSub for Perquintill

§

fn saturating_sub(&self, v: &Perquintill) -> Perquintill

Saturating subtraction. Computes self - other, saturating at the relevant high or low boundary of the type.
§

impl Serialize for Perquintill

§

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. Read more
§

impl Sub for Perquintill

§

type Output = Perquintill

The resulting type after applying the - operator.
§

fn sub(self, rhs: Perquintill) -> <Perquintill as Sub>::Output

Performs the - operation. Read more
§

impl TypeInfo for Perquintill

§

type Identity = Perquintill

The type identifying for which type info is provided. Read more
§

fn type_info() -> Type

Returns the static type identifier for Self.
§

impl Zero for Perquintill

§

fn zero() -> Perquintill

Returns the additive identity element of Self, 0. Read more
§

fn is_zero(&self) -> bool

Returns true if self is equal to the additive identity.
source§

fn set_zero(&mut self)

Sets self to the additive identity element of Self, 0.
§

impl Copy for Perquintill

§

impl EncodeLike for Perquintill

§

impl Eq for Perquintill

§

impl StructuralPartialEq for Perquintill

Auto Trait Implementations§

Blanket Implementations§

source§

impl<T> Any for T
where T: 'static + ?Sized,

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
§

impl<T> CheckedConversion for T

§

fn checked_from<T>(t: T) -> Option<Self>
where Self: TryFrom<T>,

Convert from a value of T into an equivalent instance of Option<Self>. Read more
§

fn checked_into<T>(self) -> Option<T>
where Self: TryInto<T>,

Consume self to return Some equivalent value of Option<T>. Read more
§

impl<T> Clear for T
where T: Default + Eq + PartialEq,

§

fn is_clear(&self) -> bool

True iff no bits are set.
§

fn clear() -> T

Return the value of Self that is clear.
source§

impl<T> CloneToUninit for T
where T: Copy,

source§

unsafe fn clone_to_uninit(&self, dst: *mut T)

🔬This is a nightly-only experimental API. (clone_to_uninit)
Performs copy-assignment from self to dst. Read more
source§

impl<T> CloneToUninit for T
where T: Clone,

source§

default unsafe fn clone_to_uninit(&self, dst: *mut T)

🔬This is a nightly-only experimental API. (clone_to_uninit)
Performs copy-assignment from self to dst. Read more
§

impl<Q, K> Comparable<K> for Q
where Q: Ord + ?Sized, K: Borrow<Q> + ?Sized,

§

fn compare(&self, key: &K) -> Ordering

Compare self to key and return their ordering.
§

impl<T> Conv for T

§

fn conv<T>(self) -> T
where Self: Into<T>,

Converts self into T using Into<T>. Read more
§

impl<T> DecodeAll for T
where T: Decode,

§

fn decode_all(input: &mut &[u8]) -> Result<T, Error>

Decode Self and consume all of the given input data. Read more
§

impl<T> DecodeLimit for T
where T: Decode,

§

fn decode_all_with_depth_limit( limit: u32, input: &mut &[u8], ) -> Result<T, Error>

Decode Self and consume all of the given input data. Read more
§

fn decode_with_depth_limit<I>(limit: u32, input: &mut I) -> Result<T, Error>
where I: Input,

Decode Self with the given maximum recursion depth and advance input by the number of bytes consumed. Read more
§

impl<T> DefensiveMax<T> for T
where T: PartialOrd,

§

fn defensive_max(self, other: T) -> T

Returns the maximum and defensively asserts that other is not larger than self. Read more
§

fn defensive_strict_max(self, other: T) -> T

Returns the maximum and defensively asserts that other is smaller than self. Read more
§

impl<T> DefensiveMin<T> for T
where T: PartialOrd,

§

fn defensive_min(self, other: T) -> T

Returns the minimum and defensively checks that self is not larger than other. Read more
§

fn defensive_strict_min(self, other: T) -> T

Returns the minimum and defensively checks that self is smaller than other. Read more
§

impl<T> DefensiveSaturating for T

§

fn defensive_saturating_add(self, other: T) -> T

Return self plus other defensively.
§

fn defensive_saturating_sub(self, other: T) -> T

Return self minus other defensively.
§

fn defensive_saturating_mul(self, other: T) -> T

Return the product of self and other defensively.
§

fn defensive_saturating_accrue(&mut self, other: T)

Increase self by other defensively.
§

fn defensive_saturating_reduce(&mut self, other: T)

Reduce self by other defensively.
§

fn defensive_saturating_inc(&mut self)

Increment self by one defensively.
§

fn defensive_saturating_dec(&mut self)

Decrement self by one defensively.
source§

impl<T> DynClone for T
where T: Clone,

source§

fn __clone_box(&self, _: Private) -> *mut ()

§

impl<T> EnsureAdd for T
where T: EnsureAddAssign,

§

fn ensure_add(self, v: Self) -> Result<Self, ArithmeticError>

Adds two numbers, checking for overflow. Read more
§

impl<T> EnsureAddAssign for T
where T: CheckedAdd + PartialOrd + Zero,

§

fn ensure_add_assign(&mut self, v: Self) -> Result<(), ArithmeticError>

Adds two numbers overwriting the left hand one, checking for overflow. Read more
§

impl<T, S> EnsureFrom<S> for T
where T: TryFrom<S> + PartialOrd + Zero, S: PartialOrd + Zero,

§

fn ensure_from(other: T) -> Result<Self, ArithmeticError>

Performs the conversion returning an ArithmeticError if fails. Read more
§

impl<T, S> EnsureInto<S> for T
where T: TryInto<S> + PartialOrd + Zero, S: PartialOrd + Zero,

§

fn ensure_into(self) -> Result<T, ArithmeticError>

Performs the conversion returning an ArithmeticError if fails. Read more
§

impl<T> EnsureMul for T
where T: EnsureMulAssign,

§

fn ensure_mul(self, v: Self) -> Result<Self, ArithmeticError>

Multiplies two numbers, checking for overflow. Read more
§

impl<T> EnsureMulAssign for T
where T: CheckedMul + PartialOrd + Zero,

§

fn ensure_mul_assign(&mut self, v: Self) -> Result<(), ArithmeticError>

Multiplies two numbers overwriting the left hand one, checking for overflow. Read more
§

impl<T> EnsureSub for T
where T: EnsureSubAssign,

§

fn ensure_sub(self, v: Self) -> Result<Self, ArithmeticError>

Subtracts two numbers, checking for overflow. Read more
§

impl<T> EnsureSubAssign for T
where T: CheckedSub + PartialOrd + Zero,

§

fn ensure_sub_assign(&mut self, v: Self) -> Result<(), ArithmeticError>

Subtracts two numbers overwriting the left hand one, checking for overflow. Read more
§

impl<Q, K> Equivalent<K> for Q
where Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,

§

fn equivalent(&self, key: &K) -> bool

Checks if this value is equivalent to the given key. Read more
§

impl<Q, K> Equivalent<K> for Q
where Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,

§

fn equivalent(&self, key: &K) -> bool

Compare self to key and return true if they are equal.
source§

impl<Q, K> Equivalent<K> for Q
where Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,

source§

fn equivalent(&self, key: &K) -> bool

Compare self to key and return true if they are equal.
§

impl<Q, K> Equivalent<K> for Q
where Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,

§

fn equivalent(&self, key: &K) -> bool

Checks if this value is equivalent to the given key. Read more
§

impl<T> FmtForward for T

§

fn fmt_binary(self) -> FmtBinary<Self>
where Self: Binary,

Causes self to use its Binary implementation when Debug-formatted.
§

fn fmt_display(self) -> FmtDisplay<Self>
where Self: Display,

Causes self to use its Display implementation when Debug-formatted.
§

fn fmt_lower_exp(self) -> FmtLowerExp<Self>
where Self: LowerExp,

Causes self to use its LowerExp implementation when Debug-formatted.
§

fn fmt_lower_hex(self) -> FmtLowerHex<Self>
where Self: LowerHex,

Causes self to use its LowerHex implementation when Debug-formatted.
§

fn fmt_octal(self) -> FmtOctal<Self>
where Self: Octal,

Causes self to use its Octal implementation when Debug-formatted.
§

fn fmt_pointer(self) -> FmtPointer<Self>
where Self: Pointer,

Causes self to use its Pointer implementation when Debug-formatted.
§

fn fmt_upper_exp(self) -> FmtUpperExp<Self>
where Self: UpperExp,

Causes self to use its UpperExp implementation when Debug-formatted.
§

fn fmt_upper_hex(self) -> FmtUpperHex<Self>
where Self: UpperHex,

Causes self to use its UpperHex implementation when Debug-formatted.
§

fn fmt_list(self) -> FmtList<Self>
where &'a Self: for<'a> IntoIterator,

Formats each item in a sequence. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

§

impl<T> HasCompact for T
where T: 'static, Compact<T>: for<'a> EncodeAsRef<'a, T> + Decode + From<T> + Into<T>,

§

type Type = Compact<T>

The compact type; this can be
§

impl<T> Hashable for T
where T: Codec,

§

fn blake2_128(&self) -> [u8; 16]

§

fn blake2_256(&self) -> [u8; 32]

§

fn blake2_128_concat(&self) -> Vec<u8>

§

fn twox_128(&self) -> [u8; 16]

§

fn twox_256(&self) -> [u8; 32]

§

fn twox_64_concat(&self) -> Vec<u8>

§

fn identity(&self) -> Vec<u8>

§

impl<T> Instrument for T

§

fn instrument(self, span: Span) -> Instrumented<Self>

Instruments this type with the provided [Span], returning an Instrumented wrapper. Read more
§

fn in_current_span(self) -> Instrumented<Self>

Instruments this type with the current Span, returning an Instrumented wrapper. Read more
source§

impl<T, U> Into<U> for T
where U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

source§

impl<T> IntoEither for T

source§

fn into_either(self, into_left: bool) -> Either<Self, Self>

Converts self into a Left variant of Either<Self, Self> if into_left is true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more
source§

fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
where F: FnOnce(&Self) -> bool,

Converts self into a Left variant of Either<Self, Self> if into_left(&self) returns true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more
§

impl<T, U> IntoKey<U> for T
where U: FromKey<T>,

§

fn into_key(self) -> U

§

impl<Src, Dest> IntoTuple<Dest> for Src
where Dest: FromTuple<Src>,

§

fn into_tuple(self) -> Dest

§

impl<T> IsType<T> for T

§

fn from_ref(t: &T) -> &T

Cast reference.
§

fn into_ref(&self) -> &T

Cast reference.
§

fn from_mut(t: &mut T) -> &mut T

Cast mutable reference.
§

fn into_mut(&mut self) -> &mut T

Cast mutable reference.
§

impl<T, Outer> IsWrappedBy<Outer> for T
where Outer: AsRef<T> + AsMut<T> + From<T>, T: From<Outer>,

§

fn from_ref(outer: &Outer) -> &T

Get a reference to the inner from the outer.

§

fn from_mut(outer: &mut Outer) -> &mut T

Get a mutable reference to the inner from the outer.

§

impl<T> KeyedVec for T
where T: Codec,

§

fn to_keyed_vec(&self, prepend_key: &[u8]) -> Vec<u8>

Return an encoding of Self prepended by given slice.
source§

impl<T> LowerBounded for T
where T: Bounded,

source§

fn min_value() -> T

Returns the smallest finite number this type can represent
§

impl<T> Pipe for T
where T: ?Sized,

§

fn pipe<R>(self, func: impl FnOnce(Self) -> R) -> R
where Self: Sized,

Pipes by value. This is generally the method you want to use. Read more
§

fn pipe_ref<'a, R>(&'a self, func: impl FnOnce(&'a Self) -> R) -> R
where R: 'a,

Borrows self and passes that borrow into the pipe function. Read more
§

fn pipe_ref_mut<'a, R>(&'a mut self, func: impl FnOnce(&'a mut Self) -> R) -> R
where R: 'a,

Mutably borrows self and passes that borrow into the pipe function. Read more
§

fn pipe_borrow<'a, B, R>(&'a self, func: impl FnOnce(&'a B) -> R) -> R
where Self: Borrow<B>, B: 'a + ?Sized, R: 'a,

Borrows self, then passes self.borrow() into the pipe function. Read more
§

fn pipe_borrow_mut<'a, B, R>( &'a mut self, func: impl FnOnce(&'a mut B) -> R, ) -> R
where Self: BorrowMut<B>, B: 'a + ?Sized, R: 'a,

Mutably borrows self, then passes self.borrow_mut() into the pipe function. Read more
§

fn pipe_as_ref<'a, U, R>(&'a self, func: impl FnOnce(&'a U) -> R) -> R
where Self: AsRef<U>, U: 'a + ?Sized, R: 'a,

Borrows self, then passes self.as_ref() into the pipe function.
§

fn pipe_as_mut<'a, U, R>(&'a mut self, func: impl FnOnce(&'a mut U) -> R) -> R
where Self: AsMut<U>, U: 'a + ?Sized, R: 'a,

Mutably borrows self, then passes self.as_mut() into the pipe function.
§

fn pipe_deref<'a, T, R>(&'a self, func: impl FnOnce(&'a T) -> R) -> R
where Self: Deref<Target = T>, T: 'a + ?Sized, R: 'a,

Borrows self, then passes self.deref() into the pipe function.
§

fn pipe_deref_mut<'a, T, R>( &'a mut self, func: impl FnOnce(&'a mut T) -> R, ) -> R
where Self: DerefMut<Target = T> + Deref, T: 'a + ?Sized, R: 'a,

Mutably borrows self, then passes self.deref_mut() into the pipe function.
§

impl<T> Pointable for T

§

const ALIGN: usize = _

The alignment of pointer.
§

type Init = T

The type for initializers.
§

unsafe fn init(init: <T as Pointable>::Init) -> usize

Initializes a with the given initializer. Read more
§

unsafe fn deref<'a>(ptr: usize) -> &'a T

Dereferences the given pointer. Read more
§

unsafe fn deref_mut<'a>(ptr: usize) -> &'a mut T

Mutably dereferences the given pointer. Read more
§

unsafe fn drop(ptr: usize)

Drops the object pointed to by the given pointer. Read more
source§

impl<T> Same for T

§

type Output = T

Should always be Self
§

impl<T> SaturatedConversion for T

§

fn saturated_from<T>(t: T) -> Self
where Self: UniqueSaturatedFrom<T>,

Convert from a value of T into an equivalent instance of Self. Read more
§

fn saturated_into<T>(self) -> T
where Self: UniqueSaturatedInto<T>,

Consume self to return an equivalent value of T. Read more
§

impl<SS, SP> SupersetOf<SS> for SP
where SS: SubsetOf<SP>,

§

fn to_subset(&self) -> Option<SS>

The inverse inclusion map: attempts to construct self from the equivalent element of its superset. Read more
§

fn is_in_subset(&self) -> bool

Checks if self is actually part of its subset T (and can be converted to it).
§

fn to_subset_unchecked(&self) -> SS

Use with care! Same as self.to_subset but without any property checks. Always succeeds.
§

fn from_subset(element: &SS) -> SP

The inclusion map: converts self to the equivalent element of its superset.
§

impl<T> Tap for T

§

fn tap(self, func: impl FnOnce(&Self)) -> Self

Immutable access to a value. Read more
§

fn tap_mut(self, func: impl FnOnce(&mut Self)) -> Self

Mutable access to a value. Read more
§

fn tap_borrow<B>(self, func: impl FnOnce(&B)) -> Self
where Self: Borrow<B>, B: ?Sized,

Immutable access to the Borrow<B> of a value. Read more
§

fn tap_borrow_mut<B>(self, func: impl FnOnce(&mut B)) -> Self
where Self: BorrowMut<B>, B: ?Sized,

Mutable access to the BorrowMut<B> of a value. Read more
§

fn tap_ref<R>(self, func: impl FnOnce(&R)) -> Self
where Self: AsRef<R>, R: ?Sized,

Immutable access to the AsRef<R> view of a value. Read more
§

fn tap_ref_mut<R>(self, func: impl FnOnce(&mut R)) -> Self
where Self: AsMut<R>, R: ?Sized,

Mutable access to the AsMut<R> view of a value. Read more
§

fn tap_deref<T>(self, func: impl FnOnce(&T)) -> Self
where Self: Deref<Target = T>, T: ?Sized,

Immutable access to the Deref::Target of a value. Read more
§

fn tap_deref_mut<T>(self, func: impl FnOnce(&mut T)) -> Self
where Self: DerefMut<Target = T> + Deref, T: ?Sized,

Mutable access to the Deref::Target of a value. Read more
§

fn tap_dbg(self, func: impl FnOnce(&Self)) -> Self

Calls .tap() only in debug builds, and is erased in release builds.
§

fn tap_mut_dbg(self, func: impl FnOnce(&mut Self)) -> Self

Calls .tap_mut() only in debug builds, and is erased in release builds.
§

fn tap_borrow_dbg<B>(self, func: impl FnOnce(&B)) -> Self
where Self: Borrow<B>, B: ?Sized,

Calls .tap_borrow() only in debug builds, and is erased in release builds.
§

fn tap_borrow_mut_dbg<B>(self, func: impl FnOnce(&mut B)) -> Self
where Self: BorrowMut<B>, B: ?Sized,

Calls .tap_borrow_mut() only in debug builds, and is erased in release builds.
§

fn tap_ref_dbg<R>(self, func: impl FnOnce(&R)) -> Self
where Self: AsRef<R>, R: ?Sized,

Calls .tap_ref() only in debug builds, and is erased in release builds.
§

fn tap_ref_mut_dbg<R>(self, func: impl FnOnce(&mut R)) -> Self
where Self: AsMut<R>, R: ?Sized,

Calls .tap_ref_mut() only in debug builds, and is erased in release builds.
§

fn tap_deref_dbg<T>(self, func: impl FnOnce(&T)) -> Self
where Self: Deref<Target = T>, T: ?Sized,

Calls .tap_deref() only in debug builds, and is erased in release builds.
§

fn tap_deref_mut_dbg<T>(self, func: impl FnOnce(&mut T)) -> Self
where Self: DerefMut<Target = T> + Deref, T: ?Sized,

Calls .tap_deref_mut() only in debug builds, and is erased in release builds.
§

impl<T> ThresholdOrd<T> for T
where T: Ord + PartialOrd + Copy + Clone + Zero + Saturating,

§

fn tcmp(&self, other: &T, threshold: T) -> Ordering

Compare if self is threshold greater or less than other.
source§

impl<T> ToOwned for T
where T: Clone,

§

type Owned = T

The resulting type after obtaining ownership.
source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
§

impl<T> TryConv for T

§

fn try_conv<T>(self) -> Result<T, Self::Error>
where Self: TryInto<T>,

Attempts to convert self into T using TryInto<T>. Read more
source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
§

impl<T, U> TryIntoKey<U> for T
where U: TryFromKey<T>,

§

type Error = <U as TryFromKey<T>>::Error

§

fn try_into_key(self) -> Result<U, <U as TryFromKey<T>>::Error>

§

impl<S, T> UncheckedInto<T> for S
where T: UncheckedFrom<S>,

§

fn unchecked_into(self) -> T

The counterpart to unchecked_from.
§

impl<T, S> UniqueSaturatedFrom<T> for S
where S: TryFrom<T> + Bounded,

§

fn unique_saturated_from(t: T) -> S

Convert from a value of T into an equivalent instance of Self.
§

impl<T, S> UniqueSaturatedInto<T> for S
where T: Bounded, S: TryInto<T>,

§

fn unique_saturated_into(self) -> T

Consume self to return an equivalent value of T.
source§

impl<T> UpperBounded for T
where T: Bounded,

source§

fn max_value() -> T

Returns the largest finite number this type can represent
§

impl<V, T> VZip<V> for T
where V: MultiLane<T>,

§

fn vzip(self) -> V

§

impl<T> WithSubscriber for T

§

fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self>
where S: Into<Dispatch>,

Attaches the provided Subscriber to this type, returning a [WithDispatch] wrapper. Read more
§

fn with_current_subscriber(self) -> WithDispatch<Self>

Attaches the current default Subscriber to this type, returning a [WithDispatch] wrapper. Read more
§

impl<T> AssetId for T
where T: FullCodec + Clone + Eq + PartialEq + Debug + TypeInfo + MaxEncodedLen,

§

impl<S> Codec for S
where S: Decode + Encode,

source§

impl<T> DeserializeOwned for T
where T: for<'de> Deserialize<'de>,

§

impl<T> EncodeLike<&&T> for T
where T: Encode,

§

impl<T> EncodeLike<&T> for T
where T: Encode,

§

impl<T> EncodeLike<&mut T> for T
where T: Encode,

§

impl<T> EncodeLike<Arc<T>> for T
where T: Encode,

§

impl<T> EncodeLike<Box<T>> for T
where T: Encode,

§

impl<'a, T> EncodeLike<Cow<'a, T>> for T
where T: ToOwned + Encode,

§

impl<T> EncodeLike<Rc<T>> for T
where T: Encode,

§

impl<S> FullCodec for S
where S: Decode + FullEncode,

§

impl<S> FullEncode for S
where S: Encode + EncodeLike,

§

impl<T> JsonSchemaMaybe for T

§

impl<T> MaybeDebug for T
where T: Debug,

§

impl<T> MaybeRefUnwindSafe for T
where T: RefUnwindSafe,

§

impl<T> MaybeRefUnwindSafe for T
where T: RefUnwindSafe,

§

impl<T> MaybeSerialize for T
where T: Serialize,

§

impl<T> MaybeSerializeDeserialize for T

§

impl<T> Member for T
where T: Send + Sync + Debug + Eq + PartialEq + Clone + 'static,

§

impl<T> Parameter for T
where T: Codec + EncodeLike + Clone + Eq + Debug + TypeInfo,

source§

impl<T> Scalar for T
where T: 'static + Clone + PartialEq + Debug,

§

impl<T> StaticTypeInfo for T
where T: TypeInfo + 'static,