Struct sp_runtime::PerU16
source · pub struct PerU16(_);
Expand description
Re-export top-level arithmetic stuff. A fixed point representation of a number in the range [0, 1].
Parts per 65535
Implementations§
source§impl PerU16
impl PerU16
sourcepub const fn from_parts(parts: u16) -> PerU16
pub const fn from_parts(parts: u16) -> PerU16
From an explicitly defined number of parts per maximum of the type.
sourcepub const fn from_percent(x: u16) -> PerU16
pub const fn from_percent(x: u16) -> PerU16
Converts a percent into Self
. Equal to x / 100
.
This can be created at compile time.
sourcepub const fn one() -> PerU16
pub const fn one() -> PerU16
See PerThing::one
sourcepub fn is_one(&self) -> bool
pub fn is_one(&self) -> bool
See PerThing::is_one
.
sourcepub const fn zero() -> PerU16
pub const fn zero() -> PerU16
See PerThing::zero
.
sourcepub fn is_zero(&self) -> bool
pub fn is_zero(&self) -> bool
See PerThing::is_zero
.
sourcepub const fn deconstruct(self) -> u16
pub const fn deconstruct(self) -> u16
sourcepub fn square(self) -> PerU16
pub fn square(self) -> PerU16
See PerThing::square
.
sourcepub fn from_float(x: f64) -> PerU16
pub fn from_float(x: f64) -> PerU16
See PerThing::from_float
.
sourcepub fn from_rational_approximation<N>(p: N, q: N) -> PerU16where
N: RationalArg + TryInto<u16> + TryInto<u32>,
u16: Into<N>,
👎Deprecated: Use PerThing::from_rational
instead
pub fn from_rational_approximation<N>(p: N, q: N) -> PerU16where N: RationalArg + TryInto<u16> + TryInto<u32>, u16: Into<N>,
PerThing::from_rational
insteadsourcepub fn from_rational<N>(p: N, q: N) -> PerU16where
N: RationalArg + TryInto<u16> + TryInto<u32>,
u16: Into<N>,
pub fn from_rational<N>(p: N, q: N) -> PerU16where N: RationalArg + TryInto<u16> + TryInto<u32>, u16: Into<N>,
sourcepub fn int_mul(self, b: u16) -> PerU16
pub fn int_mul(self, b: u16) -> PerU16
Integer multiplication with another value, saturating at 1.
sourcepub fn mul_floor<N>(self, b: N) -> Nwhere
N: MultiplyArg + UniqueSaturatedInto<u16>,
u16: Into<N>,
pub fn mul_floor<N>(self, b: N) -> Nwhere N: MultiplyArg + UniqueSaturatedInto<u16>, u16: Into<N>,
See PerThing::mul_floor
.
sourcepub fn mul_ceil<N>(self, b: N) -> Nwhere
N: MultiplyArg + UniqueSaturatedInto<u16>,
u16: Into<N>,
pub fn mul_ceil<N>(self, b: N) -> Nwhere N: MultiplyArg + UniqueSaturatedInto<u16>, u16: Into<N>,
See PerThing::mul_ceil
.
sourcepub fn saturating_reciprocal_mul<N>(self, b: N) -> Nwhere
N: ReciprocalArg + UniqueSaturatedInto<u16>,
u16: Into<N>,
pub fn saturating_reciprocal_mul<N>(self, b: N) -> Nwhere N: ReciprocalArg + UniqueSaturatedInto<u16>, u16: Into<N>,
sourcepub fn saturating_reciprocal_mul_floor<N>(self, b: N) -> Nwhere
N: ReciprocalArg + UniqueSaturatedInto<u16>,
u16: Into<N>,
pub fn saturating_reciprocal_mul_floor<N>(self, b: N) -> Nwhere N: ReciprocalArg + UniqueSaturatedInto<u16>, u16: Into<N>,
sourcepub fn saturating_reciprocal_mul_ceil<N>(self, b: N) -> Nwhere
N: ReciprocalArg + UniqueSaturatedInto<u16>,
u16: Into<N>,
pub fn saturating_reciprocal_mul_ceil<N>(self, b: N) -> Nwhere N: ReciprocalArg + UniqueSaturatedInto<u16>, u16: Into<N>,
sourcepub fn saturating_div(self, rhs: PerU16, r: Rounding) -> PerU16
pub fn saturating_div(self, rhs: PerU16, r: Rounding) -> PerU16
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 PerU16
impl CheckedAdd for PerU16
source§impl CheckedMul for PerU16
impl CheckedMul for PerU16
Note
CheckedMul will never fail for PerThings.
source§impl CheckedSub for PerU16
impl CheckedSub for PerU16
source§impl CompactAs for PerU16
impl CompactAs for PerU16
Implementation makes any compact encoding of PerThing::Inner
valid,
when decoding it will saturate up to PerThing::ACCURACY
.
source§impl Decode for PerU16
impl Decode for PerU16
source§fn decode<I>(input: &mut I) -> Result<PerU16, Error>where
I: Input,
fn decode<I>(input: &mut I) -> Result<PerU16, 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>
source§impl<'de> Deserialize<'de> for PerU16
impl<'de> Deserialize<'de> for PerU16
source§fn deserialize<__D>(
__deserializer: __D
) -> Result<PerU16, <__D as Deserializer<'de>>::Error>where
__D: Deserializer<'de>,
fn deserialize<__D>( __deserializer: __D ) -> Result<PerU16, <__D as Deserializer<'de>>::Error>where __D: Deserializer<'de>,
source§impl Encode for PerU16
impl Encode for PerU16
source§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,
source§fn using_encoded<R, F>(&self, f: F) -> Rwhere
F: FnOnce(&[u8]) -> R,
fn using_encoded<R, F>(&self, f: F) -> Rwhere F: FnOnce(&[u8]) -> R,
§fn encoded_size(&self) -> usize
fn encoded_size(&self) -> usize
source§impl MaxEncodedLen for PerU16
impl MaxEncodedLen for PerU16
source§fn max_encoded_len() -> usize
fn max_encoded_len() -> usize
source§impl<N> Mul<N> for PerU16where
N: Div<N, Output = N> + Clone + Mul<N, Output = N> + UniqueSaturatedInto<u16> + Add<N, Output = N> + Rem<N, Output = N> + Unsigned,
u16: Into<N>,
impl<N> Mul<N> for PerU16where N: Div<N, Output = N> + Clone + Mul<N, Output = N> + UniqueSaturatedInto<u16> + Add<N, Output = N> + Rem<N, Output = N> + Unsigned, u16: Into<N>,
Non-overflow multiplication.
This is tailored to be used with a balance type.
source§impl Ord for PerU16
impl Ord for PerU16
source§impl PartialEq<PerU16> for PerU16
impl PartialEq<PerU16> for PerU16
source§impl PartialOrd<PerU16> for PerU16
impl PartialOrd<PerU16> for PerU16
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 PerU16
impl PerThing for PerU16
source§fn deconstruct(self) -> <PerU16 as PerThing>::Inner
fn deconstruct(self) -> <PerU16 as PerThing>::Inner
Consume self and return the number of parts per thing.
source§fn from_parts(parts: <PerU16 as PerThing>::Inner) -> PerU16
fn from_parts(parts: <PerU16 as PerThing>::Inner) -> PerU16
Build this type from a number of parts per thing.
source§fn from_float(x: f64) -> PerU16
fn from_float(x: f64) -> PerU16
NOTE: saturate to 0 or 1 if x is beyond [0, 1]
§type Upper = u32
type Upper = u32
Self::Inner
, used to avoid overflow in some computations.
It must be able to compute ACCURACY^2
.source§const ACCURACY: <PerU16 as PerThing>::Inner = {transmute(0xffff): <sp_arithmetic::PerU16 as sp_arithmetic::PerThing>::Inner}
const ACCURACY: <PerU16 as PerThing>::Inner = {transmute(0xffff): <sp_arithmetic::PerU16 as sp_arithmetic::PerThing>::Inner}
source§fn from_rational_with_rounding<N>(p: N, q: N, r: Rounding) -> Result<PerU16, ()>where
N: Clone + Ord + TryInto<<PerU16 as PerThing>::Inner> + TryInto<<PerU16 as PerThing>::Upper> + Div<N, Output = N> + Rem<N, Output = N> + Add<N, Output = N> + AddAssign<N> + Unsigned + Zero + One + MultiplyRational,
<PerU16 as PerThing>::Inner: Into<N>,
fn from_rational_with_rounding<N>(p: N, q: N, r: Rounding) -> Result<PerU16, ()>where N: Clone + Ord + TryInto<<PerU16 as PerThing>::Inner> + TryInto<<PerU16 as PerThing>::Upper> + Div<N, Output = N> + Rem<N, Output = N> + Add<N, Output = N> + AddAssign<N> + Unsigned + Zero + One + MultiplyRational, <PerU16 as PerThing>::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 Saturating for PerU16
impl Saturating for PerU16
source§fn saturating_add(self, rhs: PerU16) -> PerU16
fn saturating_add(self, rhs: PerU16) -> PerU16
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: PerU16) -> PerU16
fn saturating_sub(self, rhs: PerU16) -> PerU16
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: PerU16) -> PerU16
fn saturating_mul(self, rhs: PerU16) -> PerU16
Saturating multiply. Compute self * rhs
, saturating at the numeric bounds instead of
overflowing. This operation is lossy.
source§fn saturating_pow(self, exp: usize) -> PerU16
fn saturating_pow(self, exp: usize) -> PerU16
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 PerU16
impl SaturatingAdd for PerU16
source§fn saturating_add(&self, v: &PerU16) -> PerU16
fn saturating_add(&self, v: &PerU16) -> PerU16
self + other
, saturating at the relevant high or low boundary of
the type.source§impl SaturatingSub for PerU16
impl SaturatingSub for PerU16
source§fn saturating_sub(&self, v: &PerU16) -> PerU16
fn saturating_sub(&self, v: &PerU16) -> PerU16
self - other
, saturating at the relevant high or low boundary of
the type.source§impl Serialize for PerU16
impl Serialize for PerU16
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 PerU16
impl EncodeLike<PerU16> for PerU16
impl Eq for PerU16
impl StructuralEq for PerU16
impl StructuralPartialEq for PerU16
Auto Trait Implementations§
impl RefUnwindSafe for PerU16
impl Send for PerU16
impl Sync for PerU16
impl Unpin for PerU16
impl UnwindSafe for PerU16
Blanket Implementations§
source§impl<T> CheckedConversion for T
impl<T> CheckedConversion 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,
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<T> + Zero,
impl<T> EnsureAddAssign for Twhere T: CheckedAdd + PartialOrd<T> + 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<T> + Zero,
S: PartialOrd<S> + Zero,
impl<T, S> EnsureFrom<S> for Twhere T: TryFrom<S> + PartialOrd<T> + Zero, S: PartialOrd<S> + 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<T> + Zero,
S: PartialOrd<S> + Zero,
impl<T, S> EnsureInto<S> for Twhere T: TryInto<S> + PartialOrd<T> + Zero, S: PartialOrd<S> + 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<T> + Zero,
impl<T> EnsureMulAssign for Twhere T: CheckedMul + PartialOrd<T> + 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<T> + Zero,
impl<T> EnsureSubAssign for Twhere T: CheckedSub + PartialOrd<T> + Zero,
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 Qwhere
Q: Eq + ?Sized,
K: Borrow<Q> + ?Sized,
impl<Q, K> Equivalent<K> for Qwhere Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,
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 Qwhere
Q: Eq + ?Sized,
K: Borrow<Q> + ?Sized,
impl<Q, K> Equivalent<K> for Qwhere Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
§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> Instrument for T
impl<T> Instrument for T
source§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
source§fn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
source§impl<T, Outer> IsWrappedBy<Outer> for Twhere
Outer: AsRef<T> + AsMut<T> + From<T>,
T: From<Outer>,
impl<T, Outer> IsWrappedBy<Outer> for Twhere Outer: AsRef<T> + AsMut<T> + From<T>, T: From<Outer>,
§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
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<T> + Copy + Clone + Zero + Saturating,
impl<T> ThresholdOrd<T> for Twhere T: Ord + PartialOrd<T> + Copy + Clone + Zero + Saturating,
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 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
.