Struct sp_arithmetic::per_things::Perquintill
source · pub struct Perquintill(/* private fields */);
Expand description
A fixed point representation of a number in the range [0, 1].
Parts per Quintillion
Implementations§
source§impl Perquintill
impl Perquintill
sourcepub const fn from_parts(parts: u64) -> Self
pub const fn from_parts(parts: u64) -> Self
From an explicitly defined number of parts per maximum of the type.
sourcepub const fn from_percent(x: u64) -> Self
pub const fn from_percent(x: u64) -> Self
Converts a percent into Self
. Equal to x / 100
.
This can be created at compile time.
sourcepub const fn one() -> Self
pub const fn one() -> Self
See PerThing::one
sourcepub fn is_one(&self) -> bool
pub fn is_one(&self) -> bool
See PerThing::is_one
.
sourcepub const fn zero() -> Self
pub const fn zero() -> Self
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) -> Self
pub fn square(self) -> Self
See PerThing::square
.
sourcepub fn from_float(x: f64) -> Self
pub fn from_float(x: f64) -> Self
See PerThing::from_float
.
sourcepub fn from_rational_approximation<N>(p: N, q: N) -> Selfwhere
N: RationalArg + TryInto<u64> + TryInto<u128>,
u64: Into<N>,
👎Deprecated: Use PerThing::from_rational
instead
pub fn from_rational_approximation<N>(p: N, q: N) -> Selfwhere N: RationalArg + TryInto<u64> + TryInto<u128>, u64: Into<N>,
PerThing::from_rational
insteadsourcepub fn from_rational<N>(p: N, q: N) -> Selfwhere
N: RationalArg + TryInto<u64> + TryInto<u128>,
u64: Into<N>,
pub fn from_rational<N>(p: N, q: N) -> Selfwhere N: RationalArg + TryInto<u64> + TryInto<u128>, u64: Into<N>,
sourcepub fn int_mul(self, b: u64) -> Self
pub fn int_mul(self, b: u64) -> Self
Integer multiplication with another value, saturating at 1.
sourcepub fn mul_floor<N>(self, b: N) -> Nwhere
N: MultiplyArg + UniqueSaturatedInto<u64>,
u64: Into<N>,
pub fn mul_floor<N>(self, b: N) -> Nwhere N: MultiplyArg + UniqueSaturatedInto<u64>, u64: Into<N>,
See PerThing::mul_floor
.
sourcepub fn mul_ceil<N>(self, b: N) -> Nwhere
N: MultiplyArg + UniqueSaturatedInto<u64>,
u64: Into<N>,
pub fn mul_ceil<N>(self, b: N) -> Nwhere N: MultiplyArg + UniqueSaturatedInto<u64>, u64: Into<N>,
See PerThing::mul_ceil
.
sourcepub fn saturating_reciprocal_mul<N>(self, b: N) -> Nwhere
N: ReciprocalArg + UniqueSaturatedInto<u64>,
u64: Into<N>,
pub fn saturating_reciprocal_mul<N>(self, b: N) -> Nwhere N: ReciprocalArg + UniqueSaturatedInto<u64>, u64: Into<N>,
sourcepub fn saturating_reciprocal_mul_floor<N>(self, b: N) -> Nwhere
N: ReciprocalArg + UniqueSaturatedInto<u64>,
u64: Into<N>,
pub fn saturating_reciprocal_mul_floor<N>(self, b: N) -> Nwhere N: ReciprocalArg + UniqueSaturatedInto<u64>, u64: Into<N>,
sourcepub fn saturating_reciprocal_mul_ceil<N>(self, b: N) -> Nwhere
N: ReciprocalArg + UniqueSaturatedInto<u64>,
u64: Into<N>,
pub fn saturating_reciprocal_mul_ceil<N>(self, b: N) -> Nwhere N: ReciprocalArg + UniqueSaturatedInto<u64>, u64: Into<N>,
sourcepub fn saturating_div(self, rhs: Self, r: Rounding) -> Self
pub fn saturating_div(self, rhs: Self, r: Rounding) -> Self
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),
);
source§impl Perquintill
impl Perquintill
sourcepub const fn from_perthousand(x: u64) -> Self
pub const fn from_perthousand(x: u64) -> Self
Converts a percent into Self
. Equal to x / 1000
.
This can be created at compile time.
Trait Implementations§
source§impl Add for Perquintill
impl Add for Perquintill
source§impl Bounded for Perquintill
impl Bounded for Perquintill
source§impl CheckedAdd for Perquintill
impl CheckedAdd for Perquintill
source§fn checked_add(&self, rhs: &Self) -> Option<Self>
fn checked_add(&self, rhs: &Self) -> Option<Self>
None
is
returned.source§impl CheckedMul for Perquintill
impl CheckedMul for Perquintill
Note
CheckedMul will never fail for PerThings.
source§fn checked_mul(&self, rhs: &Self) -> Option<Self>
fn checked_mul(&self, rhs: &Self) -> Option<Self>
None
is returned.source§impl CheckedSub for Perquintill
impl CheckedSub for Perquintill
source§fn checked_sub(&self, v: &Self) -> Option<Self>
fn checked_sub(&self, v: &Self) -> Option<Self>
None
is returned.source§impl Clone for Perquintill
impl Clone for Perquintill
source§fn clone(&self) -> Perquintill
fn clone(&self) -> Perquintill
1.0.0 · source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
source
. Read moresource§impl 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
.
source§impl Debug for Perquintill
impl Debug for Perquintill
source§impl Decode for Perquintill
impl Decode for Perquintill
source§fn decode<I: Input>(input: &mut I) -> Result<Self, Error>
fn decode<I: Input>(input: &mut I) -> Result<Self, Error>
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 Default for Perquintill
impl Default for Perquintill
source§impl<'de> Deserialize<'de> for Perquintill
impl<'de> Deserialize<'de> for Perquintill
source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where __D: Deserializer<'de>,
source§impl Div for Perquintill
impl Div for Perquintill
source§impl Encode for Perquintill
impl Encode for Perquintill
source§fn size_hint(&self) -> usize
fn size_hint(&self) -> usize
source§fn encode_to<__CodecOutputEdqy: Output + ?Sized>(
&self,
__codec_dest_edqy: &mut __CodecOutputEdqy
)
fn encode_to<__CodecOutputEdqy: Output + ?Sized>( &self, __codec_dest_edqy: &mut __CodecOutputEdqy )
source§fn using_encoded<R, F: FnOnce(&[u8]) -> R>(&self, f: F) -> R
fn using_encoded<R, F: FnOnce(&[u8]) -> R>(&self, f: F) -> R
source§fn encoded_size(&self) -> usize
fn encoded_size(&self) -> usize
source§impl From<Compact<Perquintill>> for Perquintill
impl From<Compact<Perquintill>> for Perquintill
source§fn from(x: Compact<Perquintill>) -> Perquintill
fn from(x: Compact<Perquintill>) -> Perquintill
source§impl MaxEncodedLen for Perquintill
impl MaxEncodedLen for Perquintill
source§fn max_encoded_len() -> usize
fn max_encoded_len() -> usize
source§impl<N> Mul<N> for Perquintillwhere
N: Clone + UniqueSaturatedInto<u64> + Rem<N, Output = N> + Div<N, Output = N> + Mul<N, Output = N> + Add<N, Output = N> + Unsigned,
u64: Into<N>,
impl<N> Mul<N> for Perquintillwhere N: Clone + UniqueSaturatedInto<u64> + Rem<N, Output = N> + Div<N, Output = N> + Mul<N, Output = N> + Add<N, Output = N> + Unsigned, u64: Into<N>,
Non-overflow multiplication.
This is tailored to be used with a balance type.
source§impl Mul for Perquintill
impl Mul for Perquintill
source§impl One for Perquintill
impl One for Perquintill
source§impl Ord for Perquintill
impl Ord for Perquintill
source§fn cmp(&self, other: &Perquintill) -> Ordering
fn cmp(&self, other: &Perquintill) -> Ordering
1.21.0 · source§fn max(self, other: Self) -> Selfwhere
Self: Sized,
fn max(self, other: Self) -> Selfwhere Self: Sized,
source§impl PartialEq for Perquintill
impl PartialEq for Perquintill
source§fn eq(&self, other: &Perquintill) -> bool
fn eq(&self, other: &Perquintill) -> bool
self
and other
values to be equal, and is used
by ==
.source§impl PartialOrd for Perquintill
impl PartialOrd for Perquintill
source§fn partial_cmp(&self, other: &Perquintill) -> Option<Ordering>
fn partial_cmp(&self, other: &Perquintill) -> Option<Ordering>
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 Perquintill
impl PerThing for Perquintill
source§fn deconstruct(self) -> Self::Inner
fn deconstruct(self) -> Self::Inner
Consume self and return the number of parts per thing.
source§fn from_parts(parts: Self::Inner) -> Self
fn from_parts(parts: Self::Inner) -> Self
Build this type from a number of parts per thing.
source§fn from_float(x: f64) -> Self
fn from_float(x: f64) -> Self
NOTE: saturate to 0 or 1 if x is beyond [0, 1]
§type Upper = u128
type Upper = u128
Self::Inner
, used to avoid overflow in some computations.
It must be able to compute ACCURACY^2
.source§const ACCURACY: Self::Inner = {transmute(0x0de0b6b3a7640000): <per_things::Perquintill as per_things::PerThing>::Inner}
const ACCURACY: Self::Inner = {transmute(0x0de0b6b3a7640000): <per_things::Perquintill as per_things::PerThing>::Inner}
source§fn from_rational_with_rounding<N>(p: N, q: N, r: Rounding) -> Result<Self, ()>where
N: Clone + Ord + TryInto<Self::Inner> + TryInto<Self::Upper> + Div<N, Output = N> + Rem<N, Output = N> + Add<N, Output = N> + AddAssign<N> + Unsigned + Zero + One + MultiplyRational,
Self::Inner: Into<N>,
fn from_rational_with_rounding<N>(p: N, q: N, r: Rounding) -> Result<Self, ()>where N: Clone + Ord + TryInto<Self::Inner> + TryInto<Self::Upper> + Div<N, Output = N> + Rem<N, Output = N> + Add<N, Output = N> + AddAssign<N> + Unsigned + Zero + One + MultiplyRational, Self::Inner: Into<N>,
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) -> Nwhere
N: MultiplyArg + UniqueSaturatedInto<Self::Inner>,
Self::Inner: Into<N>,
fn mul_floor<N>(self, b: N) -> Nwhere N: MultiplyArg + UniqueSaturatedInto<Self::Inner>, Self::Inner: Into<N>,
Mul
rounds to the
nearest whole number. Read moresource§fn mul_ceil<N>(self, b: N) -> Nwhere
N: MultiplyArg + UniqueSaturatedInto<Self::Inner>,
Self::Inner: Into<N>,
fn mul_ceil<N>(self, b: N) -> Nwhere N: MultiplyArg + UniqueSaturatedInto<Self::Inner>, Self::Inner: Into<N>,
Mul
rounds to the nearest whole number. Read moresource§fn saturating_reciprocal_mul<N>(self, b: N) -> Nwhere
N: ReciprocalArg + UniqueSaturatedInto<Self::Inner>,
Self::Inner: Into<N>,
fn saturating_reciprocal_mul<N>(self, b: N) -> Nwhere N: ReciprocalArg + UniqueSaturatedInto<Self::Inner>, Self::Inner: Into<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) -> Nwhere
N: ReciprocalArg + UniqueSaturatedInto<Self::Inner>,
Self::Inner: Into<N>,
fn saturating_reciprocal_mul_floor<N>(self, b: N) -> Nwhere N: ReciprocalArg + UniqueSaturatedInto<Self::Inner>, Self::Inner: Into<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) -> Nwhere
N: ReciprocalArg + UniqueSaturatedInto<Self::Inner>,
Self::Inner: Into<N>,
fn saturating_reciprocal_mul_ceil<N>(self, b: N) -> Nwhere N: ReciprocalArg + UniqueSaturatedInto<Self::Inner>, Self::Inner: Into<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) -> Selfwhere
N: RationalArg + TryInto<Self::Inner> + TryInto<Self::Upper>,
Self::Inner: Into<N>,
fn from_rational<N>(p: N, q: N) -> Selfwhere N: RationalArg + TryInto<Self::Inner> + TryInto<Self::Upper>, Self::Inner: Into<N>,
p/q
into a per-thing fraction. This will never overflow. Read moresource§fn from_rational_approximation<N>(p: N, q: N) -> Selfwhere
N: RationalArg + TryInto<Self::Inner> + TryInto<Self::Upper>,
Self::Inner: Into<N>,
fn from_rational_approximation<N>(p: N, q: N) -> Selfwhere N: RationalArg + TryInto<Self::Inner> + TryInto<Self::Upper>, Self::Inner: Into<N>,
Self::from_rational
.source§impl Pow<usize> for Perquintill
impl Pow<usize> for Perquintill
source§impl Saturating for Perquintill
impl Saturating for Perquintill
source§fn saturating_add(self, rhs: Self) -> Self
fn saturating_add(self, rhs: Self) -> Self
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: Self) -> Self
fn saturating_sub(self, rhs: Self) -> Self
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: Self) -> Self
fn saturating_mul(self, rhs: Self) -> Self
Saturating multiply. Compute self * rhs
, saturating at the numeric bounds instead of
overflowing. This operation is lossy.
source§fn saturating_pow(self, exp: usize) -> Self
fn saturating_pow(self, exp: usize) -> Self
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 Perquintill
impl SaturatingAdd for Perquintill
source§fn saturating_add(&self, v: &Self) -> Self
fn saturating_add(&self, v: &Self) -> Self
self + other
, saturating at the relevant high or low boundary of
the type.source§impl SaturatingSub for Perquintill
impl SaturatingSub for Perquintill
source§fn saturating_sub(&self, v: &Self) -> Self
fn saturating_sub(&self, v: &Self) -> Self
self - other
, saturating at the relevant high or low boundary of
the type.source§impl Serialize for Perquintill
impl Serialize for Perquintill
source§impl Sub for Perquintill
impl Sub for Perquintill
source§impl TypeInfo for Perquintill
impl TypeInfo for Perquintill
source§impl Zero for Perquintill
impl Zero for Perquintill
impl Copy for Perquintill
impl EncodeLike 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§
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> 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 Twhere
T: CheckedAdd + PartialOrd + Zero,
impl<T> EnsureAddAssign for Twhere T: CheckedAdd + PartialOrd + Zero,
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 Twhere
T: TryFrom<S> + PartialOrd + Zero,
S: PartialOrd + Zero,
impl<T, S> EnsureFrom<S> for Twhere T: TryFrom<S> + PartialOrd + Zero, S: PartialOrd + Zero,
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 Twhere
T: TryInto<S> + PartialOrd + Zero,
S: PartialOrd + Zero,
impl<T, S> EnsureInto<S> for Twhere T: TryInto<S> + PartialOrd + Zero, S: PartialOrd + Zero,
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 Twhere
T: CheckedMul + PartialOrd + Zero,
impl<T> EnsureMulAssign for Twhere T: CheckedMul + PartialOrd + Zero,
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 Twhere
T: CheckedSub + PartialOrd + Zero,
impl<T> EnsureSubAssign for Twhere T: CheckedSub + PartialOrd + Zero,
source§fn ensure_sub_assign(&mut self, v: Self) -> Result<(), ArithmeticError>
fn ensure_sub_assign(&mut self, v: Self) -> Result<(), ArithmeticError>
source§impl<T> HasCompact for Twhere
T: 'static,
Compact<T>: for<'a> EncodeAsRef<'a, T> + Decode + From<T> + Into<T>,
impl<T> HasCompact for Twhere T: 'static, Compact<T>: for<'a> EncodeAsRef<'a, T> + Decode + From<T> + Into<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 Twhere
T: Ord + PartialOrd + Copy + Clone + Zero + Saturating,
impl<T> ThresholdOrd<T> for Twhere T: Ord + PartialOrd + Copy + Clone + Zero + Saturating,
source§impl<T, S> UniqueSaturatedFrom<T> for Swhere
S: TryFrom<T> + Bounded,
impl<T, S> UniqueSaturatedFrom<T> for Swhere S: TryFrom<T> + Bounded,
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 Swhere
T: Bounded,
S: TryInto<T>,
impl<T, S> UniqueSaturatedInto<T> for Swhere T: Bounded, S: TryInto<T>,
source§fn unique_saturated_into(self) -> T
fn unique_saturated_into(self) -> T
T
.