Struct frame::arithmetic::per_things::PerU16
pub struct PerU16(_);Expand description
A fixed point representation of a number in the range [0, 1].
Parts per 65535
Implementations§
§impl PerU16
impl PerU16
pub 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.
pub 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.
pub const fn one() -> PerU16
pub const fn one() -> PerU16
See PerThing::one
pub fn is_one(&self) -> bool
pub fn is_one(&self) -> bool
See PerThing::is_one.
pub const fn zero() -> PerU16
pub const fn zero() -> PerU16
See PerThing::zero.
pub fn is_zero(&self) -> bool
pub fn is_zero(&self) -> bool
See PerThing::is_zero.
pub const fn deconstruct(self) -> u16
pub const fn deconstruct(self) -> u16
pub fn square(self) -> PerU16
pub fn square(self) -> PerU16
See PerThing::square.
pub fn from_float(x: f64) -> PerU16
pub fn from_float(x: f64) -> PerU16
See PerThing::from_float.
pub 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 insteadpub 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>,
pub 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.
pub 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.
pub 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>,
pub 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>,
pub 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>,
pub 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),
);§impl PerU16
impl PerU16
pub const fn from_perthousand(x: u16) -> PerU16
pub const fn from_perthousand(x: u16) -> PerU16
Converts a percent into Self. Equal to x / 1000.
This can be created at compile time.
Trait Implementations§
§impl CheckedAdd for PerU16
impl CheckedAdd for PerU16
§fn checked_add(&self, rhs: &PerU16) -> Option<PerU16>
fn checked_add(&self, rhs: &PerU16) -> Option<PerU16>
None is
returned.§impl CheckedMul for PerU16
impl CheckedMul for PerU16
Note
CheckedMul will never fail for PerThings.
§fn checked_mul(&self, rhs: &PerU16) -> Option<PerU16>
fn checked_mul(&self, rhs: &PerU16) -> Option<PerU16>
None is returned.§impl CheckedSub for PerU16
impl CheckedSub for PerU16
§fn checked_sub(&self, v: &PerU16) -> Option<PerU16>
fn checked_sub(&self, v: &PerU16) -> Option<PerU16>
None is returned.§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.
§impl Decode for PerU16
impl Decode for PerU16
§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>
§impl<'de> Deserialize<'de> for PerU16
impl<'de> Deserialize<'de> for PerU16
§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>,
§impl Encode for PerU16
impl Encode for PerU16
§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<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
§impl MaxEncodedLen for PerU16
impl MaxEncodedLen for PerU16
§fn max_encoded_len() -> usize
fn max_encoded_len() -> usize
§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.
§impl Ord for PerU16
impl Ord for PerU16
§impl PartialOrd<PerU16> for PerU16
impl PartialOrd<PerU16> for PerU16
§fn partial_cmp(&self, other: &PerU16) -> Option<Ordering>
fn partial_cmp(&self, other: &PerU16) -> 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 PerU16
impl PerThing for PerU16
§fn deconstruct(self) -> <PerU16 as PerThing>::Inner
fn deconstruct(self) -> <PerU16 as PerThing>::Inner
Consume self and return the number of parts per thing.
§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.
§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.§const ACCURACY: <PerU16 as PerThing>::Inner = {transmute(0xffff): <sp_runtime::PerU16 as sp_runtime::PerThing>::Inner}
const ACCURACY: <PerU16 as PerThing>::Inner = {transmute(0xffff): <sp_runtime::PerU16 as sp_runtime::PerThing>::Inner}
§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 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) -> 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 more§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.§impl Saturating for PerU16
impl Saturating for PerU16
§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.
§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.
§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.
§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.
§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 PerU16
impl SaturatingAdd for PerU16
§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.§impl SaturatingSub for PerU16
impl SaturatingSub for PerU16
§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.§impl Serialize for PerU16
impl Serialize for PerU16
§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> 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> Conv for T
impl<T> Conv 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<T>,
impl<T> DefensiveMax<T> for Twhere T: PartialOrd<T>,
§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<T>,
impl<T> DefensiveMin<T> for Twhere T: PartialOrd<T>,
§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 Twhere
T: Saturating + CheckedAdd + CheckedMul + CheckedSub + One,
impl<T> DefensiveSaturating for Twhere T: Saturating + CheckedAdd + CheckedMul + CheckedSub + One,
§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 Twhere
T: CheckedAdd + PartialOrd<T> + Zero,
impl<T> EnsureAddAssign for Twhere T: CheckedAdd + PartialOrd<T> + Zero,
§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 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,
§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 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,
§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 Twhere
T: CheckedMul + PartialOrd<T> + Zero,
impl<T> EnsureMulAssign for Twhere T: CheckedMul + PartialOrd<T> + Zero,
§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 Twhere
T: CheckedSub + PartialOrd<T> + Zero,
impl<T> EnsureSubAssign for Twhere T: CheckedSub + PartialOrd<T> + Zero,
§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> FmtForward for T
impl<T> FmtForward for T
§fn fmt_binary(self) -> FmtBinary<Self>where
Self: Binary,
fn fmt_binary(self) -> FmtBinary<Self>where Self: Binary,
self to use its Binary implementation when Debug-formatted.§fn fmt_display(self) -> FmtDisplay<Self>where
Self: Display,
fn fmt_display(self) -> FmtDisplay<Self>where Self: Display,
self to use its Display implementation when
Debug-formatted.§fn fmt_lower_exp(self) -> FmtLowerExp<Self>where
Self: LowerExp,
fn fmt_lower_exp(self) -> FmtLowerExp<Self>where Self: LowerExp,
self to use its LowerExp implementation when
Debug-formatted.§fn fmt_lower_hex(self) -> FmtLowerHex<Self>where
Self: LowerHex,
fn fmt_lower_hex(self) -> FmtLowerHex<Self>where Self: LowerHex,
self to use its LowerHex implementation when
Debug-formatted.§fn fmt_octal(self) -> FmtOctal<Self>where
Self: Octal,
fn fmt_octal(self) -> FmtOctal<Self>where Self: Octal,
self to use its Octal implementation when Debug-formatted.§fn fmt_pointer(self) -> FmtPointer<Self>where
Self: Pointer,
fn fmt_pointer(self) -> FmtPointer<Self>where Self: Pointer,
self to use its Pointer implementation when
Debug-formatted.§fn fmt_upper_exp(self) -> FmtUpperExp<Self>where
Self: UpperExp,
fn fmt_upper_exp(self) -> FmtUpperExp<Self>where Self: UpperExp,
self to use its UpperExp implementation when
Debug-formatted.§fn fmt_upper_hex(self) -> FmtUpperHex<Self>where
Self: UpperHex,
fn fmt_upper_hex(self) -> FmtUpperHex<Self>where Self: UpperHex,
self to use its UpperHex implementation when
Debug-formatted.§fn fmt_list(self) -> FmtList<Self>where
&'a Self: for<'a> IntoIterator,
fn fmt_list(self) -> FmtList<Self>where &'a Self: for<'a> IntoIterator,
§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>,
§impl<T> Hashable for Twhere
T: Codec,
impl<T> Hashable for Twhere T: Codec,
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>
§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> Pipe for Twhere
T: ?Sized,
impl<T> Pipe for Twhere T: ?Sized,
§fn pipe<R>(self, func: impl FnOnce(Self) -> R) -> Rwhere
Self: Sized,
fn pipe<R>(self, func: impl FnOnce(Self) -> R) -> Rwhere Self: Sized,
§fn pipe_ref<'a, R>(&'a self, func: impl FnOnce(&'a Self) -> R) -> Rwhere
R: 'a,
fn pipe_ref<'a, R>(&'a self, func: impl FnOnce(&'a Self) -> R) -> Rwhere R: 'a,
self and passes that borrow into the pipe function. Read more§fn pipe_ref_mut<'a, R>(&'a mut self, func: impl FnOnce(&'a mut Self) -> R) -> Rwhere
R: 'a,
fn pipe_ref_mut<'a, R>(&'a mut self, func: impl FnOnce(&'a mut Self) -> R) -> Rwhere R: 'a,
self and passes that borrow into the pipe function. Read more§fn pipe_borrow<'a, B, R>(&'a self, func: impl FnOnce(&'a B) -> R) -> Rwhere
Self: Borrow<B>,
B: 'a + ?Sized,
R: 'a,
fn pipe_borrow<'a, B, R>(&'a self, func: impl FnOnce(&'a B) -> R) -> Rwhere Self: Borrow<B>, B: 'a + ?Sized, R: 'a,
§fn pipe_borrow_mut<'a, B, R>(
&'a mut self,
func: impl FnOnce(&'a mut B) -> R
) -> Rwhere
Self: BorrowMut<B>,
B: 'a + ?Sized,
R: 'a,
fn pipe_borrow_mut<'a, B, R>( &'a mut self, func: impl FnOnce(&'a mut B) -> R ) -> Rwhere Self: BorrowMut<B>, B: 'a + ?Sized, R: 'a,
§fn pipe_as_ref<'a, U, R>(&'a self, func: impl FnOnce(&'a U) -> R) -> Rwhere
Self: AsRef<U>,
U: 'a + ?Sized,
R: 'a,
fn pipe_as_ref<'a, U, R>(&'a self, func: impl FnOnce(&'a U) -> R) -> Rwhere Self: AsRef<U>, U: 'a + ?Sized, R: 'a,
self, then passes self.as_ref() into the pipe function.§fn pipe_as_mut<'a, U, R>(&'a mut self, func: impl FnOnce(&'a mut U) -> R) -> Rwhere
Self: AsMut<U>,
U: 'a + ?Sized,
R: 'a,
fn pipe_as_mut<'a, U, R>(&'a mut self, func: impl FnOnce(&'a mut U) -> R) -> Rwhere Self: AsMut<U>, U: 'a + ?Sized, R: 'a,
self, then passes self.as_mut() into the pipe
function.§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<T> Tap for T
impl<T> Tap for T
§fn tap_borrow<B>(self, func: impl FnOnce(&B)) -> Selfwhere
Self: Borrow<B>,
B: ?Sized,
fn tap_borrow<B>(self, func: impl FnOnce(&B)) -> Selfwhere Self: Borrow<B>, B: ?Sized,
Borrow<B> of a value. Read more§fn tap_borrow_mut<B>(self, func: impl FnOnce(&mut B)) -> Selfwhere
Self: BorrowMut<B>,
B: ?Sized,
fn tap_borrow_mut<B>(self, func: impl FnOnce(&mut B)) -> Selfwhere Self: BorrowMut<B>, B: ?Sized,
BorrowMut<B> of a value. Read more§fn tap_ref<R>(self, func: impl FnOnce(&R)) -> Selfwhere
Self: AsRef<R>,
R: ?Sized,
fn tap_ref<R>(self, func: impl FnOnce(&R)) -> Selfwhere Self: AsRef<R>, R: ?Sized,
AsRef<R> view of a value. Read more§fn tap_ref_mut<R>(self, func: impl FnOnce(&mut R)) -> Selfwhere
Self: AsMut<R>,
R: ?Sized,
fn tap_ref_mut<R>(self, func: impl FnOnce(&mut R)) -> Selfwhere Self: AsMut<R>, R: ?Sized,
AsMut<R> view of a value. Read more§fn tap_deref<T>(self, func: impl FnOnce(&T)) -> Selfwhere
Self: Deref<Target = T>,
T: ?Sized,
fn tap_deref<T>(self, func: impl FnOnce(&T)) -> Selfwhere Self: Deref<Target = T>, T: ?Sized,
Deref::Target of a value. Read more§fn tap_deref_mut<T>(self, func: impl FnOnce(&mut T)) -> Selfwhere
Self: DerefMut<Target = T> + Deref,
T: ?Sized,
fn tap_deref_mut<T>(self, func: impl FnOnce(&mut T)) -> Selfwhere Self: DerefMut<Target = T> + Deref, T: ?Sized,
Deref::Target of a value. Read more§fn tap_dbg(self, func: impl FnOnce(&Self)) -> Self
fn tap_dbg(self, func: impl FnOnce(&Self)) -> Self
.tap() only in debug builds, and is erased in release builds.§fn tap_mut_dbg(self, func: impl FnOnce(&mut Self)) -> Self
fn tap_mut_dbg(self, func: impl FnOnce(&mut Self)) -> Self
.tap_mut() only in debug builds, and is erased in release
builds.§fn tap_borrow_dbg<B>(self, func: impl FnOnce(&B)) -> Selfwhere
Self: Borrow<B>,
B: ?Sized,
fn tap_borrow_dbg<B>(self, func: impl FnOnce(&B)) -> Selfwhere Self: Borrow<B>, B: ?Sized,
.tap_borrow() only in debug builds, and is erased in release
builds.§fn tap_borrow_mut_dbg<B>(self, func: impl FnOnce(&mut B)) -> Selfwhere
Self: BorrowMut<B>,
B: ?Sized,
fn tap_borrow_mut_dbg<B>(self, func: impl FnOnce(&mut B)) -> Selfwhere Self: BorrowMut<B>, B: ?Sized,
.tap_borrow_mut() only in debug builds, and is erased in release
builds.§fn tap_ref_dbg<R>(self, func: impl FnOnce(&R)) -> Selfwhere
Self: AsRef<R>,
R: ?Sized,
fn tap_ref_dbg<R>(self, func: impl FnOnce(&R)) -> Selfwhere Self: AsRef<R>, R: ?Sized,
.tap_ref() only in debug builds, and is erased in release
builds.§fn tap_ref_mut_dbg<R>(self, func: impl FnOnce(&mut R)) -> Selfwhere
Self: AsMut<R>,
R: ?Sized,
fn tap_ref_mut_dbg<R>(self, func: impl FnOnce(&mut R)) -> Selfwhere Self: AsMut<R>, R: ?Sized,
.tap_ref_mut() only in debug builds, and is erased in release
builds.§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,
§impl<T> TryConv for T
impl<T> TryConv for T
§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 Swhere
S: TryFrom<T> + Bounded,
impl<T, S> UniqueSaturatedFrom<T> for Swhere S: TryFrom<T> + Bounded,
§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 Swhere
T: Bounded,
S: TryInto<T>,
impl<T, S> UniqueSaturatedInto<T> for Swhere T: Bounded, S: TryInto<T>,
§fn unique_saturated_into(self) -> T
fn unique_saturated_into(self) -> T
T.