Struct sp_runtime::Perquintill
source · [−]pub struct Perquintill(_);
Expand description
Re-export top-level arithmetic stuff. A fixed point representation of a number in the range [0, 1].
Parts per Quintillion
Implementations
sourceimpl Perquintill
impl Perquintill
Re-export top-level arithmetic stuff.
sourcepub const fn from_perthousand(x: u64) -> 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.
sourceimpl Perquintill
impl Perquintill
Re-export top-level arithmetic stuff.
sourcepub const fn from_parts(parts: u64) -> Perquintill
pub const fn from_parts(parts: u64) -> Perquintill
From an explicitly defined number of parts per maximum of the type.
sourcepub const fn from_percent(x: u64) -> Perquintill
pub const fn from_percent(x: u64) -> Perquintill
Converts a percent into Self
. Equal to x / 100
.
This can be created at compile time.
sourcepub const fn one() -> Perquintill
pub const fn one() -> Perquintill
See PerThing::one
sourcepub fn is_one(&self) -> bool
pub fn is_one(&self) -> bool
See PerThing::is_one
.
sourcepub const fn zero() -> Perquintill
pub const fn zero() -> Perquintill
See PerThing::zero
.
sourcepub fn is_zero(&self) -> bool
pub fn is_zero(&self) -> bool
See PerThing::is_zero
.
sourcepub const fn deconstruct(self) -> u64
pub const fn deconstruct(self) -> u64
sourcepub fn square(self) -> Perquintill
pub fn square(self) -> Perquintill
See PerThing::square
.
sourcepub fn from_fraction(x: f64) -> Perquintill
pub fn from_fraction(x: f64) -> Perquintill
sourcepub fn from_rational_approximation<N>(p: N, q: N) -> Perquintill where
N: Clone + Ord + TryInto<u64> + TryInto<u128> + Div<N, Output = N> + Rem<N, Output = N> + Add<N, Output = N> + Unsigned,
u64: Into<N>,
pub fn from_rational_approximation<N>(p: N, q: N) -> Perquintill where
N: Clone + Ord + TryInto<u64> + TryInto<u128> + Div<N, Output = N> + Rem<N, Output = N> + Add<N, Output = N> + Unsigned,
u64: Into<N>,
sourcepub fn mul_floor<N>(self, b: N) -> N where
N: Clone + UniqueSaturatedInto<u64> + Rem<N, Output = N> + Div<N, Output = N> + Mul<N, Output = N> + Add<N, Output = N> + Unsigned,
u64: Into<N>,
pub fn mul_floor<N>(self, b: N) -> N where
N: Clone + UniqueSaturatedInto<u64> + Rem<N, Output = N> + Div<N, Output = N> + Mul<N, Output = N> + Add<N, Output = N> + Unsigned,
u64: Into<N>,
See PerThing::mul_floor
.
sourcepub fn mul_ceil<N>(self, b: N) -> N where
N: Clone + UniqueSaturatedInto<u64> + Rem<N, Output = N> + Div<N, Output = N> + Mul<N, Output = N> + Add<N, Output = N> + Unsigned,
u64: Into<N>,
pub fn mul_ceil<N>(self, b: N) -> N where
N: Clone + UniqueSaturatedInto<u64> + Rem<N, Output = N> + Div<N, Output = N> + Mul<N, Output = N> + Add<N, Output = N> + Unsigned,
u64: Into<N>,
See PerThing::mul_ceil
.
sourcepub fn saturating_reciprocal_mul<N>(self, b: N) -> N where
N: Clone + UniqueSaturatedInto<u64> + Rem<N, Output = N> + Div<N, Output = N> + Mul<N, Output = N> + Add<N, Output = N> + Saturating + Unsigned,
u64: Into<N>,
pub fn saturating_reciprocal_mul<N>(self, b: N) -> N where
N: Clone + UniqueSaturatedInto<u64> + Rem<N, Output = N> + Div<N, Output = N> + Mul<N, Output = N> + Add<N, Output = N> + Saturating + Unsigned,
u64: Into<N>,
sourcepub fn saturating_reciprocal_mul_floor<N>(self, b: N) -> N where
N: Clone + UniqueSaturatedInto<u64> + Rem<N, Output = N> + Div<N, Output = N> + Mul<N, Output = N> + Add<N, Output = N> + Saturating + Unsigned,
u64: Into<N>,
pub fn saturating_reciprocal_mul_floor<N>(self, b: N) -> N where
N: Clone + UniqueSaturatedInto<u64> + Rem<N, Output = N> + Div<N, Output = N> + Mul<N, Output = N> + Add<N, Output = N> + Saturating + Unsigned,
u64: Into<N>,
sourcepub fn saturating_reciprocal_mul_ceil<N>(self, b: N) -> N where
N: Clone + UniqueSaturatedInto<u64> + Rem<N, Output = N> + Div<N, Output = N> + Mul<N, Output = N> + Add<N, Output = N> + Saturating + Unsigned,
u64: Into<N>,
pub fn saturating_reciprocal_mul_ceil<N>(self, b: N) -> N where
N: Clone + UniqueSaturatedInto<u64> + Rem<N, Output = N> + Div<N, Output = N> + Mul<N, Output = N> + Add<N, Output = N> + Saturating + Unsigned,
u64: Into<N>,
Trait Implementations
sourceimpl Bounded for Perquintill
impl Bounded for Perquintill
sourcepub fn min_value() -> Perquintill
pub fn min_value() -> Perquintill
returns the smallest finite number this type can represent
sourcepub fn max_value() -> Perquintill
pub fn max_value() -> Perquintill
returns the largest finite number this type can represent
sourceimpl Clone for Perquintill
impl Clone for Perquintill
sourcepub fn clone(&self) -> Perquintill
pub fn clone(&self) -> Perquintill
Returns a copy of the value. Read more
1.0.0 · sourcefn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from source
. Read more
sourceimpl CompactAs for Perquintill
impl CompactAs for Perquintill
Implementation makes any compact encoding of PerThing::Inner
valid,
when decoding it will saturate up to PerThing::ACCURACY
.
sourcepub fn encode_as(&self) -> &<Perquintill as CompactAs>::As
pub fn encode_as(&self) -> &<Perquintill as CompactAs>::As
Returns the compact-encodable type.
sourcepub fn decode_from(
x: <Perquintill as CompactAs>::As
) -> Result<Perquintill, Error>
pub fn decode_from(
x: <Perquintill as CompactAs>::As
) -> Result<Perquintill, Error>
Decode Self
from the compact-decoded type.
sourceimpl Debug for Perquintill
impl Debug for Perquintill
sourceimpl Decode for Perquintill
impl Decode for Perquintill
sourcepub fn decode<I>(input: &mut I) -> Result<Perquintill, Error> where
I: Input,
pub fn decode<I>(input: &mut I) -> Result<Perquintill, Error> where
I: Input,
Attempt to deserialise the value from input.
sourcefn skip<I>(input: &mut I) -> Result<(), Error> where
I: Input,
fn skip<I>(input: &mut I) -> Result<(), Error> where
I: Input,
Attempt to skip the encoded value from input. Read more
sourcefn encoded_fixed_size() -> Option<usize>
fn encoded_fixed_size() -> Option<usize>
Returns the fixed encoded size of the type. Read more
sourceimpl Default for Perquintill
impl Default for Perquintill
sourcepub fn default() -> Perquintill
pub fn default() -> Perquintill
Returns the “default value” for a type. Read more
sourceimpl<'de> Deserialize<'de> for Perquintill
impl<'de> Deserialize<'de> for Perquintill
sourcepub fn deserialize<__D>(
__deserializer: __D
) -> Result<Perquintill, <__D as Deserializer<'de>>::Error> where
__D: Deserializer<'de>,
pub 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
sourceimpl Div<Perquintill> for Perquintill
impl Div<Perquintill> for Perquintill
type Output = Perquintill
type Output = Perquintill
The resulting type after applying the /
operator.
sourcepub fn div(self, rhs: Perquintill) -> <Perquintill as Div<Perquintill>>::Output
pub fn div(self, rhs: Perquintill) -> <Perquintill as Div<Perquintill>>::Output
Performs the /
operation. Read more
sourceimpl Encode for Perquintill
impl Encode for Perquintill
sourcepub fn encode_to<__CodecOutputEdqy>(
&self,
__codec_dest_edqy: &mut __CodecOutputEdqy
) where
__CodecOutputEdqy: Output + ?Sized,
pub 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.
sourcepub fn encode(&self) -> Vec<u8, Global>ⓘNotable traits for Vec<u8, A>impl<A> Write for Vec<u8, A> where
A: Allocator,
pub fn encode(&self) -> Vec<u8, Global>ⓘNotable traits for Vec<u8, A>impl<A> Write for Vec<u8, A> where
A: Allocator,
A: Allocator,
Convert self to an owned vector.
sourcepub fn using_encoded<R, F>(&self, f: F) -> R where
F: FnOnce(&[u8]) -> R,
pub fn using_encoded<R, F>(&self, f: F) -> R where
F: FnOnce(&[u8]) -> R,
Convert self to a slice and then invoke the given closure with it.
sourcefn size_hint(&self) -> usize
fn size_hint(&self) -> usize
If possible give a hint of expected size of the encoding. Read more
sourcefn encoded_size(&self) -> usize
fn encoded_size(&self) -> usize
Calculates the encoded size. Read more
sourceimpl From<Compact<Perquintill>> for Perquintill
impl From<Compact<Perquintill>> for Perquintill
sourcepub fn from(x: Compact<Perquintill>) -> Perquintill
pub fn from(x: Compact<Perquintill>) -> Perquintill
Performs the conversion.
sourceimpl<N> Mul<N> for Perquintill where
N: Div<N, Output = N> + Mul<N, Output = N> + Add<N, Output = N> + Unsigned<Output = N> + Clone + UniqueSaturatedInto<u64> + Rem<N>,
u64: Into<N>,
impl<N> Mul<N> for Perquintill where
N: Div<N, Output = N> + Mul<N, Output = N> + Add<N, Output = N> + Unsigned<Output = N> + Clone + UniqueSaturatedInto<u64> + Rem<N>,
u64: Into<N>,
Non-overflow multiplication.
This is tailored to be used with a balance type.
sourceimpl Ord for Perquintill
impl Ord for Perquintill
sourceimpl PartialEq<Perquintill> for Perquintill
impl PartialEq<Perquintill> for Perquintill
sourcepub fn eq(&self, other: &Perquintill) -> bool
pub fn eq(&self, other: &Perquintill) -> bool
This method tests for self
and other
values to be equal, and is used
by ==
. Read more
sourcepub fn ne(&self, other: &Perquintill) -> bool
pub fn ne(&self, other: &Perquintill) -> bool
This method tests for !=
.
sourceimpl PartialOrd<Perquintill> for Perquintill
impl PartialOrd<Perquintill> for Perquintill
sourcepub fn partial_cmp(&self, other: &Perquintill) -> Option<Ordering>
pub 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 · sourcefn lt(&self, other: &Rhs) -> bool
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 · sourcefn 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 more
sourceimpl PerThing for Perquintill
impl PerThing for Perquintill
sourcepub fn deconstruct(self) -> <Perquintill as PerThing>::Inner
pub fn deconstruct(self) -> <Perquintill as PerThing>::Inner
Consume self and return the number of parts per thing.
sourcepub fn from_parts(parts: <Perquintill as PerThing>::Inner) -> Perquintill
pub fn from_parts(parts: <Perquintill as PerThing>::Inner) -> Perquintill
Build this type from a number of parts per thing.
sourcepub fn from_fraction(x: f64) -> Perquintill
pub fn from_fraction(x: f64) -> Perquintill
NOTE: saturate to 0 or 1 if x is beyond [0, 1]
type Upper = u128
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
. Read more
sourcepub const ACCURACY: <Perquintill as PerThing>::Inner
pub const ACCURACY: <Perquintill as PerThing>::Inner
The accuracy of this type.
sourcepub fn from_rational_approximation<N>(p: N, q: N) -> Perquintill where
N: Clone + Ord + TryInto<<Perquintill as PerThing>::Inner> + TryInto<<Perquintill as PerThing>::Upper> + Div<N, Output = N> + Rem<N, Output = N> + Add<N, Output = N> + Unsigned + Zero + One,
<Perquintill as PerThing>::Inner: Into<N>,
pub fn from_rational_approximation<N>(p: N, q: N) -> Perquintill where
N: Clone + Ord + TryInto<<Perquintill as PerThing>::Inner> + TryInto<<Perquintill as PerThing>::Upper> + Div<N, Output = N> + Rem<N, Output = N> + Add<N, Output = N> + Unsigned + Zero + One,
<Perquintill as PerThing>::Inner: Into<N>,
Approximate the fraction p/q
into a per-thing fraction. This will never overflow. Read more
sourcefn from_percent(x: Self::Inner) -> Self
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. Read more
sourcefn mul_floor<N>(self, b: N) -> N where
N: Clone + UniqueSaturatedInto<Self::Inner> + Rem<N, Output = N> + Div<N, Output = N> + Mul<N, Output = N> + Add<N, Output = N> + Unsigned,
Self::Inner: Into<N>,
fn mul_floor<N>(self, b: N) -> N where
N: Clone + UniqueSaturatedInto<Self::Inner> + Rem<N, Output = N> + Div<N, Output = N> + Mul<N, Output = N> + Add<N, Output = N> + Unsigned,
Self::Inner: Into<N>,
Multiplication that always rounds down to a whole number. The standard Mul
rounds to the
nearest whole number. Read more
sourcefn mul_ceil<N>(self, b: N) -> N where
N: Clone + UniqueSaturatedInto<Self::Inner> + Rem<N, Output = N> + Div<N, Output = N> + Mul<N, Output = N> + Add<N, Output = N> + Unsigned,
Self::Inner: Into<N>,
fn mul_ceil<N>(self, b: N) -> N where
N: Clone + UniqueSaturatedInto<Self::Inner> + Rem<N, Output = N> + Div<N, Output = N> + Mul<N, Output = N> + Add<N, Output = N> + Unsigned,
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
sourcefn saturating_reciprocal_mul<N>(self, b: N) -> N where
N: Clone + UniqueSaturatedInto<Self::Inner> + Rem<N, Output = N> + Div<N, Output = N> + Mul<N, Output = N> + Add<N, Output = N> + Saturating + Unsigned,
Self::Inner: Into<N>,
fn saturating_reciprocal_mul<N>(self, b: N) -> N where
N: Clone + UniqueSaturatedInto<Self::Inner> + Rem<N, Output = N> + Div<N, Output = N> + Mul<N, Output = N> + Add<N, Output = N> + Saturating + Unsigned,
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
sourcefn saturating_reciprocal_mul_floor<N>(self, b: N) -> N where
N: Clone + UniqueSaturatedInto<Self::Inner> + Rem<N, Output = N> + Div<N, Output = N> + Mul<N, Output = N> + Add<N, Output = N> + Saturating + Unsigned,
Self::Inner: Into<N>,
fn saturating_reciprocal_mul_floor<N>(self, b: N) -> N where
N: Clone + UniqueSaturatedInto<Self::Inner> + Rem<N, Output = N> + Div<N, Output = N> + Mul<N, Output = N> + Add<N, Output = N> + Saturating + Unsigned,
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
sourcefn saturating_reciprocal_mul_ceil<N>(self, b: N) -> N where
N: Clone + UniqueSaturatedInto<Self::Inner> + Rem<N, Output = N> + Div<N, Output = N> + Mul<N, Output = N> + Add<N, Output = N> + Saturating + Unsigned,
Self::Inner: Into<N>,
fn saturating_reciprocal_mul_ceil<N>(self, b: N) -> N where
N: Clone + UniqueSaturatedInto<Self::Inner> + Rem<N, Output = N> + Div<N, Output = N> + Mul<N, Output = N> + Add<N, Output = N> + Saturating + Unsigned,
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
sourceimpl Saturating for Perquintill
impl Saturating for Perquintill
sourcepub fn saturating_add(self, rhs: Perquintill) -> Perquintill
pub 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.
sourcepub fn saturating_sub(self, rhs: Perquintill) -> Perquintill
pub 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.
sourcepub fn saturating_mul(self, rhs: Perquintill) -> Perquintill
pub fn saturating_mul(self, rhs: Perquintill) -> Perquintill
Saturating multiply. Compute self * rhs
, saturating at the numeric bounds instead of
overflowing. This operation is lossy.
sourcepub fn saturating_pow(self, exp: usize) -> Perquintill
pub 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.
sourceimpl Serialize for Perquintill
impl Serialize for Perquintill
sourcepub fn serialize<__S>(
&self,
__serializer: __S
) -> Result<<__S as Serializer>::Ok, <__S as Serializer>::Error> where
__S: Serializer,
pub 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 Copy for Perquintill
impl EncodeLike<Perquintill> for Perquintill
impl Eq for Perquintill
impl StructuralEq for Perquintill
impl StructuralPartialEq for Perquintill
Auto Trait Implementations
impl RefUnwindSafe for Perquintill
impl Send for Perquintill
impl Sync for Perquintill
impl Unpin for Perquintill
impl UnwindSafe for Perquintill
Blanket Implementations
sourceimpl<T> BorrowMut<T> for T where
T: ?Sized,
impl<T> BorrowMut<T> for T where
T: ?Sized,
const: unstable · sourcepub fn borrow_mut(&mut self) -> &mut T
pub fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
sourceimpl<T> CheckedConversion for T
impl<T> CheckedConversion for T
sourcefn checked_from<T>(t: T) -> Option<Self> where
Self: TryFrom<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
sourcefn checked_into<T>(self) -> Option<T> where
Self: TryInto<T>,
fn checked_into<T>(self) -> Option<T> where
Self: TryInto<T>,
Consume self to return Some
equivalent value of Option<T>
. Read more
sourceimpl<T> DecodeLimit for T where
T: Decode,
impl<T> DecodeLimit for T where
T: Decode,
sourceimpl<T> HasCompact for T where
T: 'static,
Compact<T>: for<'a> EncodeAsRef<'a, T>,
Compact<T>: Decode,
Compact<T>: From<T>,
Compact<T>: Into<T>,
impl<T> HasCompact for T where
T: 'static,
Compact<T>: for<'a> EncodeAsRef<'a, T>,
Compact<T>: Decode,
Compact<T>: From<T>,
Compact<T>: Into<T>,
sourceimpl<T> Instrument for T
impl<T> Instrument for T
sourcefn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
Instruments this type with the provided Span
, returning an
Instrumented
wrapper. Read more
sourcefn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
sourceimpl<T, Outer> IsWrappedBy<Outer> for T where
Outer: AsRef<T> + AsMut<T> + From<T>,
T: From<Outer>,
impl<T, Outer> IsWrappedBy<Outer> for T where
Outer: AsRef<T> + AsMut<T> + From<T>,
T: From<Outer>,
sourceimpl<T> SaturatedConversion for T
impl<T> SaturatedConversion for T
sourcefn saturated_from<T>(t: T) -> Self where
Self: UniqueSaturatedFrom<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
sourcefn saturated_into<T>(self) -> T where
Self: UniqueSaturatedInto<T>,
fn saturated_into<T>(self) -> T where
Self: UniqueSaturatedInto<T>,
Consume self to return an equivalent value of T
. Read more
sourceimpl<T> ToOwned for T where
T: Clone,
impl<T> ToOwned for T where
T: Clone,
type Owned = T
type Owned = T
The resulting type after obtaining ownership.
sourcepub fn to_owned(&self) -> T
pub fn to_owned(&self) -> T
Creates owned data from borrowed data, usually by cloning. Read more
sourcepub fn clone_into(&self, target: &mut T)
pub fn clone_into(&self, target: &mut T)
toowned_clone_into
)Uses borrowed data to replace owned data, usually by cloning. Read more
sourceimpl<S, T> UncheckedInto<T> for S where
T: UncheckedFrom<S>,
impl<S, T> UncheckedInto<T> for S where
T: UncheckedFrom<S>,
sourcepub fn unchecked_into(self) -> T
pub fn unchecked_into(self) -> T
The counterpart to unchecked_from
.
sourceimpl<T, S> UniqueSaturatedFrom<T> for S where
S: TryFrom<T> + Bounded,
impl<T, S> UniqueSaturatedFrom<T> for S where
S: TryFrom<T> + Bounded,
sourcepub fn unique_saturated_from(t: T) -> S
pub fn unique_saturated_from(t: T) -> S
Convert from a value of T
into an equivalent instance of Self
.
sourceimpl<T, S> UniqueSaturatedInto<T> for S where
T: Bounded,
S: TryInto<T>,
impl<T, S> UniqueSaturatedInto<T> for S where
T: Bounded,
S: TryInto<T>,
sourcepub fn unique_saturated_into(self) -> T
pub fn unique_saturated_into(self) -> T
Consume self to return an equivalent value of T
.