Struct sp_runtime::Permill
source · pub struct Permill(/* private fields */);
Expand description
Re-export top-level arithmetic stuff. A fixed point representation of a number in the range [0, 1].
Parts per Million
Implementations§
source§impl Permill
impl Permill
sourcepub const fn from_parts(parts: u32) -> Permill
pub const fn from_parts(parts: u32) -> Permill
From an explicitly defined number of parts per maximum of the type.
sourcepub const fn from_percent(x: u32) -> Permill
pub const fn from_percent(x: u32) -> Permill
Converts a percent into Self
. Equal to x / 100
.
This can be created at compile time.
sourcepub const fn one() -> Permill
pub const fn one() -> Permill
See PerThing::one
sourcepub fn is_one(&self) -> bool
pub fn is_one(&self) -> bool
See PerThing::is_one
.
sourcepub const fn zero() -> Permill
pub const fn zero() -> Permill
See PerThing::zero
.
sourcepub fn is_zero(&self) -> bool
pub fn is_zero(&self) -> bool
See PerThing::is_zero
.
sourcepub const fn deconstruct(self) -> u32
pub const fn deconstruct(self) -> u32
sourcepub fn square(self) -> Permill
pub fn square(self) -> Permill
See PerThing::square
.
sourcepub fn from_float(x: f64) -> Permill
pub fn from_float(x: f64) -> Permill
See PerThing::from_float
.
sourcepub fn from_rational_approximation<N>(p: N, q: N) -> Permill
👎Deprecated: Use PerThing::from_rational
instead
pub fn from_rational_approximation<N>(p: N, q: N) -> Permill
PerThing::from_rational
insteadsourcepub fn from_rational<N>(p: N, q: N) -> Permill
pub fn from_rational<N>(p: N, q: N) -> Permill
sourcepub fn int_mul(self, b: u32) -> Permill
pub fn int_mul(self, b: u32) -> Permill
Integer multiplication with another value, saturating at 1.
sourcepub fn mul_floor<N>(self, b: N) -> N
pub fn mul_floor<N>(self, b: N) -> N
See PerThing::mul_floor
.
sourcepub fn mul_ceil<N>(self, b: N) -> N
pub fn mul_ceil<N>(self, b: N) -> N
See PerThing::mul_ceil
.
sourcepub fn saturating_reciprocal_mul<N>(self, b: N) -> N
pub fn saturating_reciprocal_mul<N>(self, b: N) -> N
sourcepub fn saturating_reciprocal_mul_floor<N>(self, b: N) -> N
pub fn saturating_reciprocal_mul_floor<N>(self, b: N) -> N
sourcepub fn saturating_reciprocal_mul_ceil<N>(self, b: N) -> N
pub fn saturating_reciprocal_mul_ceil<N>(self, b: N) -> N
sourcepub fn saturating_div(self, rhs: Permill, r: Rounding) -> Permill
pub fn saturating_div(self, rhs: Permill, r: Rounding) -> Permill
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),
);
Trait Implementations§
source§impl CheckedAdd for Permill
impl CheckedAdd for Permill
source§impl CheckedMul for Permill
impl CheckedMul for Permill
Note
CheckedMul will never fail for PerThings.
source§impl CheckedSub for Permill
impl CheckedSub for Permill
source§impl CompactAs for Permill
impl CompactAs for Permill
Implementation makes any compact encoding of PerThing::Inner
valid,
when decoding it will saturate up to PerThing::ACCURACY
.
source§impl Decode for Permill
impl Decode for Permill
source§fn decode<I>(input: &mut I) -> Result<Permill, Error>where
I: Input,
fn decode<I>(input: &mut I) -> Result<Permill, Error>where
I: Input,
source§fn decode_into<I>(
input: &mut I,
dst: &mut MaybeUninit<Self>
) -> Result<DecodeFinished, Error>where
I: Input,
fn decode_into<I>(
input: &mut I,
dst: &mut MaybeUninit<Self>
) -> Result<DecodeFinished, Error>where
I: Input,
source§impl<'de> Deserialize<'de> for Permill
impl<'de> Deserialize<'de> for Permill
source§fn deserialize<__D>(
__deserializer: __D
) -> Result<Permill, <__D as Deserializer<'de>>::Error>where
__D: Deserializer<'de>,
fn deserialize<__D>(
__deserializer: __D
) -> Result<Permill, <__D as Deserializer<'de>>::Error>where
__D: Deserializer<'de>,
source§impl Encode for Permill
impl Encode for Permill
source§fn size_hint(&self) -> usize
fn size_hint(&self) -> usize
source§fn encode_to<__CodecOutputEdqy>(
&self,
__codec_dest_edqy: &mut __CodecOutputEdqy
)
fn encode_to<__CodecOutputEdqy>( &self, __codec_dest_edqy: &mut __CodecOutputEdqy )
source§fn using_encoded<__CodecOutputReturn, __CodecUsingEncodedCallback>(
&self,
f: __CodecUsingEncodedCallback
) -> __CodecOutputReturn
fn using_encoded<__CodecOutputReturn, __CodecUsingEncodedCallback>( &self, f: __CodecUsingEncodedCallback ) -> __CodecOutputReturn
source§fn encoded_size(&self) -> usize
fn encoded_size(&self) -> usize
source§impl MaxEncodedLen for Permill
impl MaxEncodedLen for Permill
source§fn max_encoded_len() -> usize
fn max_encoded_len() -> usize
source§impl<N> Mul<N> for Permill
impl<N> Mul<N> for Permill
Non-overflow multiplication.
This is tailored to be used with a balance type.
source§impl Ord for Permill
impl Ord for Permill
source§impl PartialEq for Permill
impl PartialEq for Permill
source§impl PartialOrd for Permill
impl PartialOrd for Permill
1.0.0 · source§fn le(&self, other: &Rhs) -> bool
fn le(&self, other: &Rhs) -> bool
self
and other
) and is used by the <=
operator. Read moresource§impl PerThing for Permill
impl PerThing for Permill
source§fn deconstruct(self) -> <Permill as PerThing>::Inner
fn deconstruct(self) -> <Permill as PerThing>::Inner
Consume self and return the number of parts per thing.
source§fn from_parts(parts: <Permill as PerThing>::Inner) -> Permill
fn from_parts(parts: <Permill as PerThing>::Inner) -> Permill
Build this type from a number of parts per thing.
source§fn from_float(x: f64) -> Permill
fn from_float(x: f64) -> Permill
NOTE: saturate to 0 or 1 if x is beyond [0, 1]
§type Upper = u64
type Upper = u64
Self::Inner
, used to avoid overflow in some computations.
It must be able to compute ACCURACY^2
.source§const ACCURACY: <Permill as PerThing>::Inner = {transmute(0x000f4240): <sp_arithmetic::Permill as sp_arithmetic::PerThing>::Inner}
const ACCURACY: <Permill as PerThing>::Inner = {transmute(0x000f4240): <sp_arithmetic::Permill as sp_arithmetic::PerThing>::Inner}
source§fn from_rational_with_rounding<N>(
p: N,
q: N,
r: Rounding
) -> Result<Permill, ()>
fn from_rational_with_rounding<N>( p: N, q: N, r: Rounding ) -> Result<Permill, ()>
p/q
into a per-thing fraction. Read moresource§fn less_epsilon(self) -> Self
fn less_epsilon(self) -> Self
self
or self
if it is already zero.source§fn try_less_epsilon(self) -> Result<Self, Self>
fn try_less_epsilon(self) -> Result<Self, Self>
self
or an error with the same value if self
is already
zero.source§fn plus_epsilon(self) -> Self
fn plus_epsilon(self) -> Self
self
or self
if it is already one.source§fn try_plus_epsilon(self) -> Result<Self, Self>
fn try_plus_epsilon(self) -> Result<Self, Self>
self
or an error with the same value if self
is already
one.source§fn from_percent(x: Self::Inner) -> Self
fn from_percent(x: Self::Inner) -> Self
Self::from_parts(x * Self::ACCURACY / 100)
but more accurate and can cope with potential type overflows.source§fn left_from_one(self) -> Self
fn left_from_one(self) -> Self
self
is saturating-subtracted from Self::one()
.source§fn mul_floor<N>(self, b: N) -> N
fn mul_floor<N>(self, b: N) -> N
Mul
rounds to the
nearest whole number. Read moresource§fn mul_ceil<N>(self, b: N) -> N
fn mul_ceil<N>(self, b: N) -> N
Mul
rounds to the nearest whole number. Read moresource§fn saturating_reciprocal_mul<N>(self, b: N) -> N
fn saturating_reciprocal_mul<N>(self, b: N) -> N
self
. The result is rounded to the
nearest whole number and saturates at the numeric bounds instead of overflowing. Read moresource§fn saturating_reciprocal_mul_floor<N>(self, b: N) -> N
fn saturating_reciprocal_mul_floor<N>(self, b: N) -> N
self
. The result is rounded down to the
nearest whole number and saturates at the numeric bounds instead of overflowing. Read moresource§fn saturating_reciprocal_mul_ceil<N>(self, b: N) -> N
fn saturating_reciprocal_mul_ceil<N>(self, b: N) -> N
self
. The result is rounded up to the
nearest whole number and saturates at the numeric bounds instead of overflowing. Read moresource§fn from_rational<N>(p: N, q: N) -> Self
fn from_rational<N>(p: N, q: N) -> Self
p/q
into a per-thing fraction. This will never overflow. Read moresource§fn from_rational_approximation<N>(p: N, q: N) -> Self
fn from_rational_approximation<N>(p: N, q: N) -> Self
Self::from_rational
.source§impl Saturating for Permill
impl Saturating for Permill
source§fn saturating_add(self, rhs: Permill) -> Permill
fn saturating_add(self, rhs: Permill) -> Permill
Saturating addition. Compute self + rhs
, saturating at the numeric bounds instead of
overflowing. This operation is lossless if it does not saturate.
source§fn saturating_sub(self, rhs: Permill) -> Permill
fn saturating_sub(self, rhs: Permill) -> Permill
Saturating subtraction. Compute self - rhs
, saturating at the numeric bounds instead of
overflowing. This operation is lossless if it does not saturate.
source§fn saturating_mul(self, rhs: Permill) -> Permill
fn saturating_mul(self, rhs: Permill) -> Permill
Saturating multiply. Compute self * rhs
, saturating at the numeric bounds instead of
overflowing. This operation is lossy.
source§fn saturating_pow(self, exp: usize) -> Permill
fn saturating_pow(self, exp: usize) -> Permill
Saturating exponentiation. Computes self.pow(exp)
, saturating at the numeric
bounds instead of overflowing. This operation is lossy.
source§fn saturating_less_one(self) -> Selfwhere
Self: One,
fn saturating_less_one(self) -> Selfwhere
Self: One,
source§fn saturating_plus_one(self) -> Selfwhere
Self: One,
fn saturating_plus_one(self) -> Selfwhere
Self: One,
source§fn saturating_inc(&mut self)where
Self: One,
fn saturating_inc(&mut self)where
Self: One,
source§fn saturating_dec(&mut self)where
Self: One,
fn saturating_dec(&mut self)where
Self: One,
source§fn saturating_accrue(&mut self, amount: Self)where
Self: One,
fn saturating_accrue(&mut self, amount: Self)where
Self: One,
amount
, saturating.source§fn saturating_reduce(&mut self, amount: Self)where
Self: One,
fn saturating_reduce(&mut self, amount: Self)where
Self: One,
amount
, saturating at zero.source§impl SaturatingAdd for Permill
impl SaturatingAdd for Permill
source§fn saturating_add(&self, v: &Permill) -> Permill
fn saturating_add(&self, v: &Permill) -> Permill
self + other
, saturating at the relevant high or low boundary of
the type.source§impl SaturatingSub for Permill
impl SaturatingSub for Permill
source§fn saturating_sub(&self, v: &Permill) -> Permill
fn saturating_sub(&self, v: &Permill) -> Permill
self - other
, saturating at the relevant high or low boundary of
the type.source§impl Serialize for Permill
impl Serialize for Permill
source§fn serialize<__S>(
&self,
__serializer: __S
) -> Result<<__S as Serializer>::Ok, <__S as Serializer>::Error>where
__S: Serializer,
fn serialize<__S>(
&self,
__serializer: __S
) -> Result<<__S as Serializer>::Ok, <__S as Serializer>::Error>where
__S: Serializer,
impl Copy for Permill
impl EncodeLike for Permill
impl Eq for Permill
impl StructuralEq for Permill
impl StructuralPartialEq for Permill
Auto Trait Implementations§
impl RefUnwindSafe for Permill
impl Send for Permill
impl Sync for Permill
impl Unpin for Permill
impl UnwindSafe for Permill
Blanket Implementations§
source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
source§impl<T> CheckedConversion for T
impl<T> CheckedConversion for T
source§impl<T> DecodeLimit for Twhere
T: Decode,
impl<T> DecodeLimit for Twhere
T: Decode,
source§impl<T> EnsureAdd for Twhere
T: EnsureAddAssign,
impl<T> EnsureAdd for Twhere
T: EnsureAddAssign,
source§fn ensure_add(self, v: Self) -> Result<Self, ArithmeticError>
fn ensure_add(self, v: Self) -> Result<Self, ArithmeticError>
source§impl<T> EnsureAddAssign for T
impl<T> EnsureAddAssign for T
source§fn ensure_add_assign(&mut self, v: Self) -> Result<(), ArithmeticError>
fn ensure_add_assign(&mut self, v: Self) -> Result<(), ArithmeticError>
source§impl<T, S> EnsureFrom<S> for T
impl<T, S> EnsureFrom<S> for T
source§fn ensure_from(other: T) -> Result<Self, ArithmeticError>
fn ensure_from(other: T) -> Result<Self, ArithmeticError>
ArithmeticError
if fails. Read moresource§impl<T, S> EnsureInto<S> for T
impl<T, S> EnsureInto<S> for T
source§fn ensure_into(self) -> Result<T, ArithmeticError>
fn ensure_into(self) -> Result<T, ArithmeticError>
ArithmeticError
if fails. Read moresource§impl<T> EnsureMul for Twhere
T: EnsureMulAssign,
impl<T> EnsureMul for Twhere
T: EnsureMulAssign,
source§fn ensure_mul(self, v: Self) -> Result<Self, ArithmeticError>
fn ensure_mul(self, v: Self) -> Result<Self, ArithmeticError>
source§impl<T> EnsureMulAssign for T
impl<T> EnsureMulAssign for T
source§fn ensure_mul_assign(&mut self, v: Self) -> Result<(), ArithmeticError>
fn ensure_mul_assign(&mut self, v: Self) -> Result<(), ArithmeticError>
source§impl<T> EnsureSub for Twhere
T: EnsureSubAssign,
impl<T> EnsureSub for Twhere
T: EnsureSubAssign,
source§fn ensure_sub(self, v: Self) -> Result<Self, ArithmeticError>
fn ensure_sub(self, v: Self) -> Result<Self, ArithmeticError>
source§impl<T> EnsureSubAssign for T
impl<T> EnsureSubAssign for T
source§fn ensure_sub_assign(&mut self, v: Self) -> Result<(), ArithmeticError>
fn ensure_sub_assign(&mut self, v: Self) -> Result<(), ArithmeticError>
source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
source§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
key
and return true
if they are equal.§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
source§impl<T> HasCompact for T
impl<T> HasCompact for T
§impl<T> Instrument for T
impl<T> Instrument for T
§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
§fn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
source§impl<T, Outer> IsWrappedBy<Outer> for T
impl<T, Outer> IsWrappedBy<Outer> for T
source§impl<T> LowerBounded for Twhere
T: Bounded,
impl<T> LowerBounded for Twhere
T: Bounded,
source§impl<T> SaturatedConversion for T
impl<T> SaturatedConversion for T
source§fn saturated_from<T>(t: T) -> Selfwhere
Self: UniqueSaturatedFrom<T>,
fn saturated_from<T>(t: T) -> Selfwhere
Self: UniqueSaturatedFrom<T>,
source§fn saturated_into<T>(self) -> Twhere
Self: UniqueSaturatedInto<T>,
fn saturated_into<T>(self) -> Twhere
Self: UniqueSaturatedInto<T>,
T
. Read moresource§impl<T> ThresholdOrd<T> for T
impl<T> ThresholdOrd<T> for T
source§impl<S, T> UncheckedInto<T> for Swhere
T: UncheckedFrom<S>,
impl<S, T> UncheckedInto<T> for Swhere
T: UncheckedFrom<S>,
source§fn unchecked_into(self) -> T
fn unchecked_into(self) -> T
unchecked_from
.source§impl<T, S> UniqueSaturatedFrom<T> for S
impl<T, S> UniqueSaturatedFrom<T> for S
source§fn unique_saturated_from(t: T) -> S
fn unique_saturated_from(t: T) -> S
T
into an equivalent instance of Self
.source§impl<T, S> UniqueSaturatedInto<T> for S
impl<T, S> UniqueSaturatedInto<T> for S
source§fn unique_saturated_into(self) -> T
fn unique_saturated_into(self) -> T
T
.