Struct gtest_runtime::Perbill
pub struct Perbill(u32);
Expand description
A fixed point representation of a number in the range [0, 1].
Parts per Billion
Tuple Fields§
§0: u32
Implementations§
§impl Perbill
impl Perbill
pub const fn from_parts(parts: u32) -> Perbill
pub const fn from_parts(parts: u32) -> Perbill
From an explicitly defined number of parts per maximum of the type.
pub const fn from_percent(x: u32) -> Perbill
pub const fn from_percent(x: u32) -> Perbill
Converts a percent into Self
. Equal to x / 100
.
This can be created at compile time.
pub const fn deconstruct(self) -> u32
pub const fn deconstruct(self) -> u32
See [PerThing::deconstruct
].
pub fn from_float(x: f64) -> Perbill
pub fn from_float(x: f64) -> Perbill
See [PerThing::from_float
].
pub fn from_rational_approximation<N>(p: N, q: N) -> Perbill
👎Deprecated: Use PerThing::from_rational
instead
pub fn from_rational_approximation<N>(p: N, q: N) -> Perbill
PerThing::from_rational
insteadSee [PerThing::from_rational
].
pub fn from_rational<N>(p: N, q: N) -> Perbill
pub fn from_rational<N>(p: N, q: N) -> Perbill
See [PerThing::from_rational
].
pub fn mul_floor<N>(self, b: N) -> N
pub fn mul_floor<N>(self, b: N) -> N
See [PerThing::mul_floor
].
pub fn mul_ceil<N>(self, b: N) -> N
pub fn mul_ceil<N>(self, b: N) -> N
See [PerThing::mul_ceil
].
pub fn saturating_reciprocal_mul<N>(self, b: N) -> N
pub fn saturating_reciprocal_mul<N>(self, b: N) -> N
See [PerThing::saturating_reciprocal_mul
].
pub fn saturating_reciprocal_mul_floor<N>(self, b: N) -> N
pub fn saturating_reciprocal_mul_floor<N>(self, b: N) -> N
See [PerThing::saturating_reciprocal_mul_floor
].
pub fn saturating_reciprocal_mul_ceil<N>(self, b: N) -> N
pub fn saturating_reciprocal_mul_ceil<N>(self, b: N) -> N
See [PerThing::saturating_reciprocal_mul_ceil
].
pub fn saturating_div(self, rhs: Perbill, r: Rounding) -> Perbill
pub fn saturating_div(self, rhs: Perbill, r: Rounding) -> Perbill
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 Perbill
impl Perbill
pub const fn from_perthousand(x: u32) -> Perbill
pub const fn from_perthousand(x: u32) -> Perbill
Converts a percent into Self
. Equal to x / 1000
.
This can be created at compile time.
Trait Implementations§
§impl CheckedAdd for Perbill
impl CheckedAdd for Perbill
§fn checked_add(&self, rhs: &Perbill) -> Option<Perbill>
fn checked_add(&self, rhs: &Perbill) -> Option<Perbill>
None
is
returned.§impl CheckedMul for Perbill
impl CheckedMul for Perbill
§Note
CheckedMul will never fail for PerThings.
§fn checked_mul(&self, rhs: &Perbill) -> Option<Perbill>
fn checked_mul(&self, rhs: &Perbill) -> Option<Perbill>
None
is returned.§impl CheckedSub for Perbill
impl CheckedSub for Perbill
§fn checked_sub(&self, v: &Perbill) -> Option<Perbill>
fn checked_sub(&self, v: &Perbill) -> Option<Perbill>
None
is returned.§impl CompactAs for Perbill
impl CompactAs for Perbill
Implementation makes any compact encoding of PerThing::Inner
valid,
when decoding it will saturate up to PerThing::ACCURACY
.
§impl Decode for Perbill
impl Decode for Perbill
§fn decode<I>(input: &mut I) -> Result<Perbill, Error>where
I: Input,
fn decode<I>(input: &mut I) -> Result<Perbill, Error>where
I: Input,
§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,
§fn skip<I>(input: &mut I) -> Result<(), Error>where
I: Input,
fn skip<I>(input: &mut I) -> Result<(), Error>where
I: Input,
§fn encoded_fixed_size() -> Option<usize>
fn encoded_fixed_size() -> Option<usize>
§impl<'de> Deserialize<'de> for Perbill
impl<'de> Deserialize<'de> for Perbill
§fn deserialize<__D>(
__deserializer: __D
) -> Result<Perbill, <__D as Deserializer<'de>>::Error>where
__D: Deserializer<'de>,
fn deserialize<__D>(
__deserializer: __D
) -> Result<Perbill, <__D as Deserializer<'de>>::Error>where
__D: Deserializer<'de>,
§impl Encode for Perbill
impl Encode for Perbill
§fn encode_to<__CodecOutputEdqy>(
&self,
__codec_dest_edqy: &mut __CodecOutputEdqy
)where
__CodecOutputEdqy: Output + ?Sized,
fn encode_to<__CodecOutputEdqy>(
&self,
__codec_dest_edqy: &mut __CodecOutputEdqy
)where
__CodecOutputEdqy: Output + ?Sized,
§fn using_encoded<__CodecOutputReturn, __CodecUsingEncodedCallback>(
&self,
f: __CodecUsingEncodedCallback
) -> __CodecOutputReturn
fn using_encoded<__CodecOutputReturn, __CodecUsingEncodedCallback>( &self, f: __CodecUsingEncodedCallback ) -> __CodecOutputReturn
§fn encoded_size(&self) -> usize
fn encoded_size(&self) -> usize
§impl MaxEncodedLen for Perbill
impl MaxEncodedLen for Perbill
§fn max_encoded_len() -> usize
fn max_encoded_len() -> usize
§impl<N> Mul<N> for Perbill
impl<N> Mul<N> for Perbill
Non-overflow multiplication.
This is tailored to be used with a balance type.
§impl Ord for Perbill
impl Ord for Perbill
§impl PartialOrd for Perbill
impl PartialOrd for Perbill
§fn partial_cmp(&self, other: &Perbill) -> Option<Ordering>
fn partial_cmp(&self, other: &Perbill) -> 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 more§impl PerThing for Perbill
impl PerThing for Perbill
§fn deconstruct(self) -> <Perbill as PerThing>::Inner
fn deconstruct(self) -> <Perbill as PerThing>::Inner
Consume self and return the number of parts per thing.
§fn from_parts(parts: <Perbill as PerThing>::Inner) -> Perbill
fn from_parts(parts: <Perbill as PerThing>::Inner) -> Perbill
Build this type from a number of parts per thing.
§fn from_float(x: f64) -> Perbill
fn from_float(x: f64) -> Perbill
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
.§const ACCURACY: <Perbill as PerThing>::Inner = {transmute(0x3b9aca00): <sp_runtime::Perbill as sp_runtime::PerThing>::Inner}
const ACCURACY: <Perbill as PerThing>::Inner = {transmute(0x3b9aca00): <sp_runtime::Perbill as sp_runtime::PerThing>::Inner}
§fn from_rational_with_rounding<N>(
p: N,
q: N,
r: Rounding
) -> Result<Perbill, ()>
fn from_rational_with_rounding<N>( p: N, q: N, r: Rounding ) -> Result<Perbill, ()>
p/q
into a per-thing fraction. Read more§fn less_epsilon(self) -> Self
fn less_epsilon(self) -> Self
self
or self
if it is already zero.§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.§fn plus_epsilon(self) -> Self
fn plus_epsilon(self) -> Self
self
or self
if it is already one.§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.§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.§fn left_from_one(self) -> Self
fn left_from_one(self) -> Self
self
is saturating-subtracted from Self::one()
.§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 more§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 more§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 more§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 more§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 more§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 more§fn from_rational_approximation<N>(p: N, q: N) -> Self
fn from_rational_approximation<N>(p: N, q: N) -> Self
Self::from_rational
.§impl Saturating for Perbill
impl Saturating for Perbill
§fn saturating_add(self, rhs: Perbill) -> Perbill
fn saturating_add(self, rhs: Perbill) -> Perbill
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: Perbill) -> Perbill
fn saturating_sub(self, rhs: Perbill) -> Perbill
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: Perbill) -> Perbill
fn saturating_mul(self, rhs: Perbill) -> Perbill
Saturating multiply. Compute self * rhs
, saturating at the numeric bounds instead of
overflowing. This operation is lossy.
§fn saturating_pow(self, exp: usize) -> Perbill
fn saturating_pow(self, exp: usize) -> Perbill
Saturating exponentiation. Computes self.pow(exp)
, saturating at the numeric
bounds instead of overflowing. This operation is lossy.
§fn saturating_less_one(self) -> Selfwhere
Self: One,
fn saturating_less_one(self) -> Selfwhere
Self: One,
§fn saturating_plus_one(self) -> Selfwhere
Self: One,
fn saturating_plus_one(self) -> Selfwhere
Self: One,
§fn saturating_inc(&mut self)where
Self: One,
fn saturating_inc(&mut self)where
Self: One,
§fn saturating_dec(&mut self)where
Self: One,
fn saturating_dec(&mut self)where
Self: One,
§fn saturating_accrue(&mut self, amount: Self)where
Self: One,
fn saturating_accrue(&mut self, amount: Self)where
Self: One,
amount
, saturating.§fn saturating_reduce(&mut self, amount: Self)where
Self: One,
fn saturating_reduce(&mut self, amount: Self)where
Self: One,
amount
, saturating at zero.§impl SaturatingAdd for Perbill
impl SaturatingAdd for Perbill
§fn saturating_add(&self, v: &Perbill) -> Perbill
fn saturating_add(&self, v: &Perbill) -> Perbill
self + other
, saturating at the relevant high or low boundary of
the type.§impl SaturatingSub for Perbill
impl SaturatingSub for Perbill
§fn saturating_sub(&self, v: &Perbill) -> Perbill
fn saturating_sub(&self, v: &Perbill) -> Perbill
self - other
, saturating at the relevant high or low boundary of
the type.§impl Serialize for Perbill
impl Serialize for Perbill
§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 Perbill
impl EncodeLike for Perbill
impl Eq for Perbill
impl StructuralPartialEq for Perbill
Auto Trait Implementations§
impl Freeze for Perbill
impl RefUnwindSafe for Perbill
impl Send for Perbill
impl Sync for Perbill
impl Unpin for Perbill
impl UnwindSafe for Perbill
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
§impl<T> CheckedConversion for T
impl<T> CheckedConversion for T
§fn checked_from<T>(t: T) -> Option<Self>where
Self: TryFrom<T>,
fn checked_from<T>(t: T) -> Option<Self>where
Self: TryFrom<T>,
§fn checked_into<T>(self) -> Option<T>where
Self: TryInto<T>,
fn checked_into<T>(self) -> Option<T>where
Self: TryInto<T>,
§impl<T> Clear for T
impl<T> Clear for T
§impl<T> DecodeAll for Twhere
T: Decode,
impl<T> DecodeAll for Twhere
T: Decode,
§fn decode_all(input: &mut &[u8]) -> Result<T, Error>
fn decode_all(input: &mut &[u8]) -> Result<T, Error>
Self
and consume all of the given input data. Read more§impl<T> DecodeLimit for Twhere
T: Decode,
impl<T> DecodeLimit for Twhere
T: Decode,
§impl<T> DefensiveMax<T> for Twhere
T: PartialOrd,
impl<T> DefensiveMax<T> for Twhere
T: PartialOrd,
§fn defensive_max(self, other: T) -> T
fn defensive_max(self, other: T) -> T
§fn defensive_strict_max(self, other: T) -> T
fn defensive_strict_max(self, other: T) -> T
§impl<T> DefensiveMin<T> for Twhere
T: PartialOrd,
impl<T> DefensiveMin<T> for Twhere
T: PartialOrd,
§fn defensive_min(self, other: T) -> T
fn defensive_min(self, other: T) -> T
§fn defensive_strict_min(self, other: T) -> T
fn defensive_strict_min(self, other: T) -> T
§impl<T> DefensiveSaturating for T
impl<T> DefensiveSaturating for T
§fn defensive_saturating_add(self, other: T) -> T
fn defensive_saturating_add(self, other: T) -> T
self
plus other
defensively.§fn defensive_saturating_sub(self, other: T) -> T
fn defensive_saturating_sub(self, other: T) -> T
self
minus other
defensively.§fn defensive_saturating_mul(self, other: T) -> T
fn defensive_saturating_mul(self, other: T) -> T
self
and other
defensively.§fn defensive_saturating_accrue(&mut self, other: T)
fn defensive_saturating_accrue(&mut self, other: T)
self
by other
defensively.§fn defensive_saturating_reduce(&mut self, other: T)
fn defensive_saturating_reduce(&mut self, other: T)
self
by other
defensively.§fn defensive_saturating_inc(&mut self)
fn defensive_saturating_inc(&mut self)
self
by one defensively.§fn defensive_saturating_dec(&mut self)
fn defensive_saturating_dec(&mut self)
self
by one defensively.§impl<T> EnsureAdd for Twhere
T: EnsureAddAssign,
impl<T> EnsureAdd for Twhere
T: EnsureAddAssign,
§fn ensure_add(self, v: Self) -> Result<Self, ArithmeticError>
fn ensure_add(self, v: Self) -> Result<Self, ArithmeticError>
§impl<T> EnsureAddAssign for T
impl<T> EnsureAddAssign for T
§fn ensure_add_assign(&mut self, v: Self) -> Result<(), ArithmeticError>
fn ensure_add_assign(&mut self, v: Self) -> Result<(), ArithmeticError>
§impl<T, S> EnsureFrom<S> for T
impl<T, S> EnsureFrom<S> for T
§fn ensure_from(other: T) -> Result<Self, ArithmeticError>
fn ensure_from(other: T) -> Result<Self, ArithmeticError>
ArithmeticError
] if fails. Read more§impl<T, S> EnsureInto<S> for T
impl<T, S> EnsureInto<S> for T
§fn ensure_into(self) -> Result<T, ArithmeticError>
fn ensure_into(self) -> Result<T, ArithmeticError>
ArithmeticError
] if fails. Read more§impl<T> EnsureMul for Twhere
T: EnsureMulAssign,
impl<T> EnsureMul for Twhere
T: EnsureMulAssign,
§fn ensure_mul(self, v: Self) -> Result<Self, ArithmeticError>
fn ensure_mul(self, v: Self) -> Result<Self, ArithmeticError>
§impl<T> EnsureMulAssign for T
impl<T> EnsureMulAssign for T
§fn ensure_mul_assign(&mut self, v: Self) -> Result<(), ArithmeticError>
fn ensure_mul_assign(&mut self, v: Self) -> Result<(), ArithmeticError>
§impl<T> EnsureSub for Twhere
T: EnsureSubAssign,
impl<T> EnsureSub for Twhere
T: EnsureSubAssign,
§fn ensure_sub(self, v: Self) -> Result<Self, ArithmeticError>
fn ensure_sub(self, v: Self) -> Result<Self, ArithmeticError>
§impl<T> EnsureSubAssign for T
impl<T> EnsureSubAssign for T
§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
§impl<T> HasCompact for T
impl<T> HasCompact for T
§impl<T> Hashable for Twhere
T: Codec,
impl<T> Hashable for Twhere
T: Codec,
§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> IntoEither for T
impl<T> IntoEither for T
source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
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 moresource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
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> IsType<T> for T
impl<T> IsType<T> for T
§impl<T, Outer> IsWrappedBy<Outer> for T
impl<T, Outer> IsWrappedBy<Outer> for T
§impl<T> KeyedVec for Twhere
T: Codec,
impl<T> KeyedVec for Twhere
T: Codec,
source§impl<T> LowerBounded for Twhere
T: Bounded,
impl<T> LowerBounded for Twhere
T: Bounded,
§impl<T> Pointable for T
impl<T> Pointable for T
§impl<T> SaturatedConversion for T
impl<T> SaturatedConversion for T
§fn saturated_from<T>(t: T) -> Selfwhere
Self: UniqueSaturatedFrom<T>,
fn saturated_from<T>(t: T) -> Selfwhere
Self: UniqueSaturatedFrom<T>,
§fn saturated_into<T>(self) -> Twhere
Self: UniqueSaturatedInto<T>,
fn saturated_into<T>(self) -> Twhere
Self: UniqueSaturatedInto<T>,
T
. Read more§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
self
from the equivalent element of its
superset. Read more§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
self
is actually part of its subset T
(and can be converted to it).§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
self.to_subset
but without any property checks. Always succeeds.§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
self
to the equivalent element of its superset.§impl<T> ThresholdOrd<T> for T
impl<T> ThresholdOrd<T> for T
§impl<T, U> TryIntoKey<U> for Twhere
U: TryFromKey<T>,
impl<T, U> TryIntoKey<U> for Twhere
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 Swhere
T: UncheckedFrom<S>,
impl<S, T> UncheckedInto<T> for Swhere
T: UncheckedFrom<S>,
§fn unchecked_into(self) -> T
fn unchecked_into(self) -> T
unchecked_from
.§impl<T, S> UniqueSaturatedFrom<T> for S
impl<T, S> UniqueSaturatedFrom<T> for S
§fn unique_saturated_from(t: T) -> S
fn unique_saturated_from(t: T) -> S
T
into an equivalent instance of Self
.§impl<T, S> UniqueSaturatedInto<T> for S
impl<T, S> UniqueSaturatedInto<T> for S
§fn unique_saturated_into(self) -> T
fn unique_saturated_into(self) -> T
T
.