Struct sp_runtime::Permill

source · [−]

pub struct Permill(_);

Expand description

Re-export top-level arithmetic stuff. A fixed point representation of a number in the range [0, 1].

Parts per Million

Implementations

impl Permill

Re-export top-level arithmetic stuff.

pub const fn from_perthousand(x: u32) -> Permill

Converts a percent into Self. Equal to x / 1000.

This can be created at compile time.

impl Permill

Re-export top-level arithmetic stuff.

pub const fn from_parts(parts: u32) -> Permill

From an explicitly defined number of parts per maximum of the type.

pub const fn from_percent(x: u32) -> Permill

Converts a percent into Self. Equal to x / 100.

This can be created at compile time.

pub const fn one() -> Permill

See PerThing::one

pub fn is_one(&self) -> bool

See PerThing::is_one.

pub const fn zero() -> Permill

See PerThing::zero.

pub fn is_zero(&self) -> bool

See PerThing::is_zero.

pub const fn deconstruct(self) -> u32

See PerThing::deconstruct.

pub fn square(self) -> Permill

See PerThing::square.

pub fn from_fraction(x: f64) -> Permill

See PerThing::from_fraction.

pub fn from_rational_approximation<N>(p: N, q: N) -> Permill where
N: Clone + Ord + TryInto<u32> + TryInto<u64> + Div<N, Output = N> + Rem<N, Output = N> + Add<N, Output = N> + Unsigned,
u32: Into<N>,

See PerThing::from_rational_approximation.

pub fn mul_floor<N>(self, b: N) -> N where
N: Clone + UniqueSaturatedInto<u32> + Rem<N, Output = N> + Div<N, Output = N> + Mul<N, Output = N> + Add<N, Output = N> + Unsigned,
u32: Into<N>,

See PerThing::mul_floor.

pub fn mul_ceil<N>(self, b: N) -> N where
N: Clone + UniqueSaturatedInto<u32> + Rem<N, Output = N> + Div<N, Output = N> + Mul<N, Output = N> + Add<N, Output = N> + Unsigned,
u32: Into<N>,

See PerThing::mul_ceil.

pub fn saturating_reciprocal_mul<N>(self, b: N) -> N where
N: Clone + UniqueSaturatedInto<u32> + Rem<N, Output = N> + Div<N, Output = N> + Mul<N, Output = N> + Add<N, Output = N> + Saturating + Unsigned,
u32: Into<N>,

See PerThing::saturating_reciprocal_mul.

pub fn saturating_reciprocal_mul_floor<N>(self, b: N) -> N where
N: Clone + UniqueSaturatedInto<u32> + Rem<N, Output = N> + Div<N, Output = N> + Mul<N, Output = N> + Add<N, Output = N> + Saturating + Unsigned,
u32: Into<N>,

See PerThing::saturating_reciprocal_mul_floor.

pub fn saturating_reciprocal_mul_ceil<N>(self, b: N) -> N where
N: Clone + UniqueSaturatedInto<u32> + Rem<N, Output = N> + Div<N, Output = N> + Mul<N, Output = N> + Add<N, Output = N> + Saturating + Unsigned,
u32: Into<N>,

See PerThing::saturating_reciprocal_mul_ceil.

Trait Implementations

impl Bounded for Permill

pub fn min_value() -> Permill

returns the smallest finite number this type can represent

pub fn max_value() -> Permill

returns the largest finite number this type can represent

impl Clone for Permill

pub fn clone(&self) -> Permill

Returns a copy of the value. Read more

1.0.0 · source

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source. Read more

impl CompactAs for Permill

Implementation makes any compact encoding of PerThing::Inner valid, when decoding it will saturate up to PerThing::ACCURACY.

type As = u32

A compact-encodable type that should be used as the encoding.

pub fn encode_as(&self) -> &<Permill as CompactAs>::As

Returns the compact-encodable type.

pub fn decode_from(x: <Permill as CompactAs>::As) -> Result<Permill, Error>

Decode Self from the compact-decoded type.

impl Debug for Permill

pub fn fmt(&self, fmt: &mut Formatter<'_>) -> Result<(), Error>

Formats the value using the given formatter. Read more

impl Decode for Permill

pub fn decode<I>(input: &mut I) -> Result<Permill, Error> where
I: Input,

Attempt to deserialise the value from input.

fn skip<I>(input: &mut I) -> Result<(), Error> where
I: Input,

Attempt to skip the encoded value from input. Read more

fn encoded_fixed_size() -> Option<usize>

Returns the fixed encoded size of the type. Read more

impl Default for Permill

pub fn default() -> Permill

Returns the “default value” for a type. Read more

impl<'de> Deserialize<'de> for Permill

pub fn deserialize<D>(
deserializer: D
) -> Result<Permill, <D as Deserializer<'de>>::Error> where
__D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer. Read more

impl Div<Permill> for Permill

type Output = Permill

The resulting type after applying the / operator.

pub fn div(self, rhs: Permill) -> <Permill as Div<Permill>>::Output

Performs the / operation. Read more

impl Encode for Permill

pub fn encode_to<CodecOutputEdqy>(
    &self,
    codec_dest_edqy: &mut CodecOutputEdqy
) where
    CodecOutputEdqy: Output + ?Sized,

Convert self to a slice and append it to the destination.

pub fn encode(&self) -> Vec<u8, Global>ⓘNotable traits for Vec<u8, A>`impl<A> Write for Vec<u8, A> where A: Allocator,`

Convert self to an owned vector.

pub fn using_encoded<R, F>(&self, f: F) -> R where
F: FnOnce(&[u8 ]) -> R,

Convert self to a slice and then invoke the given closure with it.

fn size_hint(&self) -> usize

If possible give a hint of expected size of the encoding. Read more

fn encoded_size(&self) -> usize

Calculates the encoded size. Read more

impl From<Compact<Permill>> for Permill

pub fn from(x: Compact<Permill>) -> Permill

Performs the conversion.

impl<N> Mul<N> for Permill where
N: Div<N, Output = N> + Mul<N, Output = N> + Add<N, Output = N> + Unsigned<Output = N> + Clone + UniqueSaturatedInto<u32> + Rem<N>,
u32: Into<N>,

Non-overflow multiplication.

This is tailored to be used with a balance type.

type Output = N

The resulting type after applying the * operator.

pub fn mul(self, b: N) -> <Permill as Mul<N>>::Output

Performs the * operation. Read more

impl Ord for Permill

pub fn cmp(&self, other: &Permill) -> Ordering

This method returns an Ordering between self and other. Read more

1.21.0 · source

fn max(self, other: Self) -> Self

Compares and returns the maximum of two values. Read more

1.21.0 · source

fn min(self, other: Self) -> Self

Compares and returns the minimum of two values. Read more

1.50.0 · source

fn clamp(self, min: Self, max: Self) -> Self

Restrict a value to a certain interval. Read more

impl PartialEq<Permill> for Permill

pub fn eq(&self, other: &Permill) -> bool

This method tests for self and other values to be equal, and is used by ==. Read more

pub fn ne(&self, other: &Permill) -> bool

This method tests for !=.

impl PartialOrd<Permill> for Permill

pub fn partial_cmp(&self, other: &Permill) -> Option<Ordering>

This method returns an ordering between self and other values if one exists. Read more

1.0.0 · source

fn lt(&self, other: &Rhs) -> bool

This method tests less than (for self and other) and is used by the < operator. Read more

1.0.0 · source

fn le(&self, other: &Rhs) -> bool

This method tests less than or equal to (for self and other) and is used by the <= operator. Read more

1.0.0 · source

fn gt(&self, other: &Rhs) -> bool

This method tests greater than (for self and other) and is used by the > operator. Read more

1.0.0 · source

fn ge(&self, other: &Rhs) -> bool

This method tests greater than or equal to (for self and other) and is used by the >= operator. Read more

impl PerThing for Permill

pub fn deconstruct(self) -> <Permill as PerThing>::Inner

Consume self and return the number of parts per thing.

pub fn from_parts(parts: <Permill as PerThing>::Inner) -> Permill

Build this type from a number of parts per thing.

pub fn from_fraction(x: f64) -> Permill

NOTE: saturate to 0 or 1 if x is beyond [0, 1]

type Inner = u32

The data type used to build this per-thingy.

type Upper = u64

A data type larger than Self::Inner, used to avoid overflow in some computations. It must be able to compute ACCURACY^2. Read more

pub const ACCURACY: <Permill as PerThing>::Inner

The accuracy of this type.

pub fn from_rational_approximation<N>(p: N, q: N) -> Permill where
N: Clone + Ord + TryInto<<Permill as PerThing>::Inner> + TryInto<<Permill as PerThing>::Upper> + Div<N, Output = N> + Rem<N, Output = N> + Add<N, Output = N> + Unsigned + Zero + One,
<Permill as PerThing>::Inner: Into<N>,

Approximate the fraction p/q into a per-thing fraction. This will never overflow. Read more

fn zero() -> Self

Equivalent to Self::from_parts(0).

fn is_zero(&self) -> bool

Return true if this is nothing.

fn one() -> Self

Equivalent to Self::from_parts(Self::ACCURACY).

fn is_one(&self) -> bool

Return true if this is one.

fn from_percent(x: Self::Inner) -> Self

Build this type from a percent. Equivalent to Self::from_parts(x * Self::ACCURACY / 100) but more accurate and can cope with potential type overflows. Read more

fn square(self) -> Self

Return the product of multiplication of this value by itself.

fn mul_floor<N>(self, b: N) -> N where
N: Clone + UniqueSaturatedInto<Self::Inner> + Rem<N, Output = N> + Div<N, Output = N> + Mul<N, Output = N> + Add<N, Output = N> + Unsigned,
Self::Inner: Into<N>,

Multiplication that always rounds down to a whole number. The standard Mul rounds to the nearest whole number. Read more

fn mul_ceil<N>(self, b: N) -> N where
N: Clone + UniqueSaturatedInto<Self::Inner> + Rem<N, Output = N> + Div<N, Output = N> + Mul<N, Output = N> + Add<N, Output = N> + Unsigned,
Self::Inner: Into<N>,

Multiplication that always rounds the result up to a whole number. The standard Mul rounds to the nearest whole number. Read more

fn saturating_reciprocal_mul<N>(self, b: N) -> N where
N: Clone + UniqueSaturatedInto<Self::Inner> + Rem<N, Output = N> + Div<N, Output = N> + Mul<N, Output = N> + Add<N, Output = N> + Saturating + Unsigned,
Self::Inner: Into<N>,

Saturating multiplication by the reciprocal of 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) -> N where
N: Clone + UniqueSaturatedInto<Self::Inner> + Rem<N, Output = N> + Div<N, Output = N> + Mul<N, Output = N> + Add<N, Output = N> + Saturating + Unsigned,
Self::Inner: Into<N>,

Saturating multiplication by the reciprocal of 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) -> N where
N: Clone + UniqueSaturatedInto<Self::Inner> + Rem<N, Output = N> + Div<N, Output = N> + Mul<N, Output = N> + Add<N, Output = N> + Saturating + Unsigned,
Self::Inner: Into<N>,

Saturating multiplication by the reciprocal of self. The result is rounded up to the nearest whole number and saturates at the numeric bounds instead of overflowing. Read more

impl Saturating for Permill

pub 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.

pub 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.

pub fn saturating_mul(self, rhs: Permill) -> Permill

Saturating multiply. Compute self * rhs, saturating at the numeric bounds instead of overflowing. This operation is lossy.

pub 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.

impl Serialize for Permill

pub fn serialize<S>(
    &self,
    serializer: S
) -> Result<<S as Serializer>::Ok, <S as Serializer>::Error> where
    S: Serializer,

Serialize this value into the given Serde serializer. Read more

impl Copy for Permill

impl EncodeLike<Permill> 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

impl<T> Any for T where
T: 'static + ?Sized,

pub fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more

impl<T> Borrow<T> for T where
T: ?Sized,

const: unstable · source

pub fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more

impl<T> BorrowMut<T> for T where
T: ?Sized,

const: unstable · source

pub fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more

impl<T> CheckedConversion for T

fn checked_from<T>(t: T) -> Option<Self> where
Self: TryFrom<T>,

Convert from a value of T into an equivalent instance of Option<Self>. Read more

fn checked_into<T>(self) -> Option<T> where
Self: TryInto<T>,

Consume self to return Some equivalent value of Option<T>. Read more

impl<T> Clear for T where
T: Default + Eq + PartialEq<T>,

fn is_clear(&self) -> bool

True iff no bits are set.

fn clear() -> Self

Return the value of Self that is clear.

impl<T> DecodeAll for T where
T: Decode,

pub fn decode_all(input: &[u8 ]) -> Result<T, Error>

Decode Self and consume all of the given input data. Read more

impl<T> DecodeLimit for T where
T: Decode,

pub fn decode_all_with_depth_limit(limit: u32, input: &[u8 ]) -> Result<T, Error>

Decode Self and consume all of the given input data. Read more

pub fn decode_with_depth_limit(limit: u32, input: &[u8 ]) -> Result<T, Error>

Decode Self with the given maximum recursion depth. Read more

impl<T> DynClone for T where
T: Clone,

pub fn __clone_box(&self, Private) -> *mut ()

impl<T> From<T> for T

const: unstable · source

pub fn from(t: T) -> T

Returns the argument unchanged.

impl<T> HasCompact for T where
    T: 'static,
    Compact<T>: for<'a> EncodeAsRef<'a, T>,
    Compact<T>: Decode,
    Compact<T>: From<T>,
    Compact<T>: Into<T>,

type Type = Compact<T>

The compact type; this can be

impl<T> Instrument for T

fn instrument(self, span: Span) -> Instrumented<Self>

Instruments this type with the provided Span, returning an Instrumented wrapper. Read more

fn in_current_span(self) -> Instrumented<Self>

Instruments this type with the current Span, returning an Instrumented wrapper. Read more

impl<T, U> Into<U> for T where
U: From<T>,

const: unstable · source

pub fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

impl<T, Outer> IsWrappedBy<Outer> for T where
Outer: AsRef<T> + AsMut<T> + From<T>,
T: From<Outer>,

pub fn from_ref(outer: &Outer) -> &T

Get a reference to the inner from the outer.

pub fn from_mut(outer: &mut Outer) -> &mut T

Get a mutable reference to the inner from the outer.

impl<T> KeyedVec for T where
T: Codec,

pub fn to_keyed_vec(&self, prepend_key: &[u8 ]) -> Vec<u8, Global>ⓘNotable traits for Vec<u8, A>`impl<A> Write for Vec<u8, A> where A: Allocator,`

Return an encoding of Self prepended by given slice.

impl<T> Same<T> for T

type Output = T

Should always be Self

impl<T> SaturatedConversion for T

fn saturated_from<T>(t: T) -> Self where
Self: UniqueSaturatedFrom<T>,

Convert from a value of T into an equivalent instance of Self. Read more

fn saturated_into<T>(self) -> T where
Self: UniqueSaturatedInto<T>,

Consume self to return an equivalent value of T. Read more

impl<T> ToOwned for T where
T: Clone,

type Owned = T

The resulting type after obtaining ownership.

pub fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more

pub fn clone_into(&self, target: &mut T)

🔬 This is a nightly-only experimental API. (toowned_clone_into)

Uses borrowed data to replace owned data, usually by cloning. Read more

impl<T, U> TryFrom<U> for T where
U: Into<T>,

type Error = Infallible

The type returned in the event of a conversion error.

const: unstable · source

pub fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.

impl<T, U> TryInto<U> for T where
U: TryFrom<T>,

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.

const: unstable · source

pub fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.

impl<S, T> UncheckedInto<T> for S where
T: UncheckedFrom<S>,

pub fn unchecked_into(self) -> T

The counterpart to unchecked_from.

impl<T, S> UniqueSaturatedFrom<T> for S where
S: TryFrom<T> + Bounded,

pub fn unique_saturated_from(t: T) -> S

Convert from a value of T into an equivalent instance of Self.

impl<T, S> UniqueSaturatedInto<T> for S where
T: Bounded,
S: TryInto<T>,

pub fn unique_saturated_into(self) -> T

Consume self to return an equivalent value of T.

impl<V, T> VZip<V> for T where
V: MultiLane<T>,

pub fn vzip(self) -> V

impl<S> Codec for S where
S: Decode + Encode,

impl<T> DeserializeOwned for T where
T: for<'de> Deserialize<'de>,

impl<'_, '_, T> EncodeLike<&'_ &'_ T> for T where
T: Encode,

impl<'_, T> EncodeLike<&'_ T> for T where
T: Encode,

impl<'_, T> EncodeLike<&'_ mut T> for T where
T: Encode,

impl<T> EncodeLike<Arc<T>> for T where
T: Encode,

impl<T> EncodeLike<Box<T, Global>> for T where
T: Encode,

impl<'a, T> EncodeLike<Cow<'a, T>> for T where
T: ToOwned + Encode,

impl<T> EncodeLike<Rc<T>> for T where
T: Encode,

impl<S> FullCodec for S where
S: Decode + FullEncode,

impl<S> FullEncode for S where
S: Encode + EncodeLike<S>,

impl<T> MaybeDebug for T where
T: Debug,

impl<T> MaybeDebug for T where
T: Debug,

impl<T> MaybeRefUnwindSafe for T where
T: RefUnwindSafe,

impl<T> MaybeSerialize for T where
T: Serialize,

impl<T> MaybeSerializeDeserialize for T where
T: DeserializeOwned + Serialize,

impl<T> Member for T where
T: 'static + Send + Sync + Debug + Eq + PartialEq<T> + Clone,