Struct polkadot_sdk_frame::traits::tokens::fungible::Imbalance
pub struct Imbalance<B, OnDrop, OppositeOnDrop>{ /* private fields */ }
Expand description
An imbalance in the system, representing a divergence of recorded token supply from the sum of
the balances of all accounts. This is must_use
in order to ensure it gets handled (placing
into an account, settling from an account or altering the supply).
Importantly, it has a special Drop
impl, and cannot be created outside of this module.
Trait Implementations§
§impl<B, OnDrop, OppositeOnDrop> Imbalance<B> for Imbalance<B, OnDrop, OppositeOnDrop>
impl<B, OnDrop, OppositeOnDrop> Imbalance<B> for Imbalance<B, OnDrop, OppositeOnDrop>
§type Opposite = Imbalance<B, OppositeOnDrop, OnDrop>
type Opposite = Imbalance<B, OppositeOnDrop, OnDrop>
The oppositely imbalanced type. They come in pairs.
§fn zero() -> Imbalance<B, OnDrop, OppositeOnDrop>
fn zero() -> Imbalance<B, OnDrop, OppositeOnDrop>
The zero imbalance. Can be destroyed with
drop_zero
.§fn drop_zero(self) -> Result<(), Imbalance<B, OnDrop, OppositeOnDrop>>
fn drop_zero(self) -> Result<(), Imbalance<B, OnDrop, OppositeOnDrop>>
Drop an instance cleanly. Only works if its
self.value()
is zero.§fn split(
self,
amount: B,
) -> (Imbalance<B, OnDrop, OppositeOnDrop>, Imbalance<B, OnDrop, OppositeOnDrop>)
fn split( self, amount: B, ) -> (Imbalance<B, OnDrop, OppositeOnDrop>, Imbalance<B, OnDrop, OppositeOnDrop>)
Consume
self
and return two independent instances; the first
is guaranteed to be at most amount
and the second will be the remainder.§fn extract(&mut self, amount: B) -> Imbalance<B, OnDrop, OppositeOnDrop>
fn extract(&mut self, amount: B) -> Imbalance<B, OnDrop, OppositeOnDrop>
Mutate
self
by extracting a new instance with at most amount
value, reducing self
accordingly.§fn merge(
self,
other: Imbalance<B, OnDrop, OppositeOnDrop>,
) -> Imbalance<B, OnDrop, OppositeOnDrop>
fn merge( self, other: Imbalance<B, OnDrop, OppositeOnDrop>, ) -> Imbalance<B, OnDrop, OppositeOnDrop>
Consume
self
and an other
to return a new instance that combines
both.§fn subsume(&mut self, other: Imbalance<B, OnDrop, OppositeOnDrop>)
fn subsume(&mut self, other: Imbalance<B, OnDrop, OppositeOnDrop>)
Consume an
other
to mutate self
into a new instance that combines
both.§fn offset(
self,
other: Imbalance<B, OppositeOnDrop, OnDrop>,
) -> SameOrOther<Imbalance<B, OnDrop, OppositeOnDrop>, Imbalance<B, OppositeOnDrop, OnDrop>>
fn offset( self, other: Imbalance<B, OppositeOnDrop, OnDrop>, ) -> SameOrOther<Imbalance<B, OnDrop, OppositeOnDrop>, Imbalance<B, OppositeOnDrop, OnDrop>>
Consume self and along with an opposite counterpart to return
a combined result. Read more
§fn ration(self, first: u32, second: u32) -> (Self, Self)
fn ration(self, first: u32, second: u32) -> (Self, Self)
Consume
self
and return two independent instances; the amounts returned will be in
approximately the same ratio as first
:second
. Read more§fn split_merge(self, amount: Balance, others: (Self, Self)) -> (Self, Self)
fn split_merge(self, amount: Balance, others: (Self, Self)) -> (Self, Self)
Consume self and add its two components, defined by the first component’s balance,
element-wise to two pre-existing Imbalances. Read more
§fn ration_merge(
self,
first: u32,
second: u32,
others: (Self, Self),
) -> (Self, Self)
fn ration_merge( self, first: u32, second: u32, others: (Self, Self), ) -> (Self, Self)
Consume self and add its two components, defined by the ratio
first
:second
,
element-wise to two pre-existing Imbalances. Read more§fn split_merge_into(self, amount: Balance, others: &mut (Self, Self))
fn split_merge_into(self, amount: Balance, others: &mut (Self, Self))
Consume self and add its two components, defined by the first component’s balance,
element-wise into two pre-existing Imbalance refs. Read more
§fn ration_merge_into(self, first: u32, second: u32, others: &mut (Self, Self))
fn ration_merge_into(self, first: u32, second: u32, others: &mut (Self, Self))
Consume self and add its two components, defined by the ratio
first
:second
,
element-wise to two pre-existing Imbalances. Read more§fn merge_into(self, other: &mut Self)
fn merge_into(self, other: &mut Self)
Consume self to mutate
other
so that it combines both. Just like subsume
, only with
reversed arguments.§fn maybe_merge(self, other: Option<Self>) -> Self
fn maybe_merge(self, other: Option<Self>) -> Self
Consume
self
and maybe an other
to return a new instance that combines
both.§fn maybe_subsume(&mut self, other: Option<Self>)
fn maybe_subsume(&mut self, other: Option<Self>)
Maybe consume an
other
to mutate self
into a new instance that combines
both.§impl<A, F> OnUnbalanced<Imbalance<<F as Inspect<<A as TypedGet>::Type>>::Balance, <F as Balanced<<A as TypedGet>::Type>>::OnDropCredit, <F as Balanced<<A as TypedGet>::Type>>::OnDropDebt>> for ResolveTo<A, F>
impl<A, F> OnUnbalanced<Imbalance<<F as Inspect<<A as TypedGet>::Type>>::Balance, <F as Balanced<<A as TypedGet>::Type>>::OnDropCredit, <F as Balanced<<A as TypedGet>::Type>>::OnDropDebt>> for ResolveTo<A, F>
§fn on_nonzero_unbalanced(
credit: Imbalance<<F as Inspect<<A as TypedGet>::Type>>::Balance, <F as Balanced<<A as TypedGet>::Type>>::OnDropCredit, <F as Balanced<<A as TypedGet>::Type>>::OnDropDebt>,
)
fn on_nonzero_unbalanced( credit: Imbalance<<F as Inspect<<A as TypedGet>::Type>>::Balance, <F as Balanced<<A as TypedGet>::Type>>::OnDropCredit, <F as Balanced<<A as TypedGet>::Type>>::OnDropDebt>, )
Actually handle a non-zero imbalance. You probably want to implement this rather than
on_unbalanced
.§fn on_unbalanceds(amounts: impl Iterator<Item = Imbalance>)where
Imbalance: TryMerge,
fn on_unbalanceds(amounts: impl Iterator<Item = Imbalance>)where
Imbalance: TryMerge,
Handler for some imbalances. The different imbalances might have different origins or
meanings, dependent on the context. Will default to simply calling on_unbalanced for all
of them. Infallible.
§fn on_unbalanced(amount: Imbalance)
fn on_unbalanced(amount: Imbalance)
Handler for some imbalance. Infallible.
§impl<B, OnDrop, OppositeOnDrop> PartialEq for Imbalance<B, OnDrop, OppositeOnDrop>
impl<B, OnDrop, OppositeOnDrop> PartialEq for Imbalance<B, OnDrop, OppositeOnDrop>
§impl<B, OnDrop, OppositeOnDrop> TryMerge for Imbalance<B, OnDrop, OppositeOnDrop>
impl<B, OnDrop, OppositeOnDrop> TryMerge for Imbalance<B, OnDrop, OppositeOnDrop>
§fn try_merge(
self,
other: Imbalance<B, OnDrop, OppositeOnDrop>,
) -> Result<Imbalance<B, OnDrop, OppositeOnDrop>, (Imbalance<B, OnDrop, OppositeOnDrop>, Imbalance<B, OnDrop, OppositeOnDrop>)>
fn try_merge( self, other: Imbalance<B, OnDrop, OppositeOnDrop>, ) -> Result<Imbalance<B, OnDrop, OppositeOnDrop>, (Imbalance<B, OnDrop, OppositeOnDrop>, Imbalance<B, OnDrop, OppositeOnDrop>)>
Consume
self
and an other
to return a new instance that combines both. Errors with
Err(self, other) if the imbalances cannot be merged (e.g. imbalances of different assets).impl<B, OnDrop, OppositeOnDrop> Eq for Imbalance<B, OnDrop, OppositeOnDrop>
Auto Trait Implementations§
impl<B, OnDrop, OppositeOnDrop> Freeze for Imbalance<B, OnDrop, OppositeOnDrop>where
B: Freeze,
impl<B, OnDrop, OppositeOnDrop> RefUnwindSafe for Imbalance<B, OnDrop, OppositeOnDrop>
impl<B, OnDrop, OppositeOnDrop> Send for Imbalance<B, OnDrop, OppositeOnDrop>
impl<B, OnDrop, OppositeOnDrop> Sync for Imbalance<B, OnDrop, OppositeOnDrop>
impl<B, OnDrop, OppositeOnDrop> Unpin for Imbalance<B, OnDrop, OppositeOnDrop>
impl<B, OnDrop, OppositeOnDrop> UnwindSafe for Imbalance<B, OnDrop, OppositeOnDrop>
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
Mutably borrows from an owned value. Read more
§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<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
Checks if this value is equivalent to the given key. Read more
§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
Compare self to
key
and return true
if they are equal.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
Compare self to
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
Checks if this value is equivalent to the given key. Read more
§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,
Causes
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,
Causes
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,
Causes
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,
Causes
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,
Causes
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,
Causes
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,
Causes
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,
Causes
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,
Formats each item in a sequence. Read more
§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> ⓘ
Converts
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> ⓘ
Converts
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<Src, Dest> IntoTuple<Dest> for Srcwhere
Dest: FromTuple<Src>,
impl<Src, Dest> IntoTuple<Dest> for Srcwhere
Dest: FromTuple<Src>,
fn into_tuple(self) -> Dest
§impl<T, Outer> IsWrappedBy<Outer> for T
impl<T, Outer> IsWrappedBy<Outer> for T
§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,
Pipes by value. This is generally the method you want to use. Read more
§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,
Borrows
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,
Mutably borrows
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) -> R
fn pipe_borrow<'a, B, R>(&'a self, func: impl FnOnce(&'a B) -> R) -> R
§fn pipe_borrow_mut<'a, B, R>(
&'a mut self,
func: impl FnOnce(&'a mut B) -> R,
) -> R
fn pipe_borrow_mut<'a, B, R>( &'a mut self, func: impl FnOnce(&'a mut B) -> R, ) -> R
§fn pipe_as_ref<'a, U, R>(&'a self, func: impl FnOnce(&'a U) -> R) -> R
fn pipe_as_ref<'a, U, R>(&'a self, func: impl FnOnce(&'a U) -> R) -> R
Borrows
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) -> R
fn pipe_as_mut<'a, U, R>(&'a mut self, func: impl FnOnce(&'a mut U) -> R) -> R
Mutably borrows
self
, then passes self.as_mut()
into the pipe
function.§fn pipe_deref<'a, T, R>(&'a self, func: impl FnOnce(&'a T) -> R) -> R
fn pipe_deref<'a, T, R>(&'a self, func: impl FnOnce(&'a T) -> R) -> R
Borrows
self
, then passes self.deref()
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>,
Consume self to return an equivalent value of
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>
The inverse inclusion map: attempts to construct
self
from the equivalent element of its
superset. Read more§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
Checks if
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
Use with care! Same as
self.to_subset
but without any property checks. Always succeeds.§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self
to the equivalent element of its superset.§impl<T> Tap for T
impl<T> Tap for T
§fn tap_borrow<B>(self, func: impl FnOnce(&B)) -> Self
fn tap_borrow<B>(self, func: impl FnOnce(&B)) -> Self
Immutable access to the
Borrow<B>
of a value. Read more§fn tap_borrow_mut<B>(self, func: impl FnOnce(&mut B)) -> Self
fn tap_borrow_mut<B>(self, func: impl FnOnce(&mut B)) -> Self
Mutable access to the
BorrowMut<B>
of a value. Read more§fn tap_ref<R>(self, func: impl FnOnce(&R)) -> Self
fn tap_ref<R>(self, func: impl FnOnce(&R)) -> Self
Immutable access to the
AsRef<R>
view of a value. Read more§fn tap_ref_mut<R>(self, func: impl FnOnce(&mut R)) -> Self
fn tap_ref_mut<R>(self, func: impl FnOnce(&mut R)) -> Self
Mutable access to the
AsMut<R>
view of a value. Read more§fn tap_deref<T>(self, func: impl FnOnce(&T)) -> Self
fn tap_deref<T>(self, func: impl FnOnce(&T)) -> Self
Immutable access to the
Deref::Target
of a value. Read more§fn tap_deref_mut<T>(self, func: impl FnOnce(&mut T)) -> Self
fn tap_deref_mut<T>(self, func: impl FnOnce(&mut T)) -> Self
Mutable access to the
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
Calls
.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
Calls
.tap_mut()
only in debug builds, and is erased in release
builds.§fn tap_borrow_dbg<B>(self, func: impl FnOnce(&B)) -> Self
fn tap_borrow_dbg<B>(self, func: impl FnOnce(&B)) -> Self
Calls
.tap_borrow()
only in debug builds, and is erased in release
builds.§fn tap_borrow_mut_dbg<B>(self, func: impl FnOnce(&mut B)) -> Self
fn tap_borrow_mut_dbg<B>(self, func: impl FnOnce(&mut B)) -> Self
Calls
.tap_borrow_mut()
only in debug builds, and is erased in release
builds.§fn tap_ref_dbg<R>(self, func: impl FnOnce(&R)) -> Self
fn tap_ref_dbg<R>(self, func: impl FnOnce(&R)) -> Self
Calls
.tap_ref()
only in debug builds, and is erased in release
builds.§fn tap_ref_mut_dbg<R>(self, func: impl FnOnce(&mut R)) -> Self
fn tap_ref_mut_dbg<R>(self, func: impl FnOnce(&mut R)) -> Self
Calls
.tap_ref_mut()
only in debug builds, and is erased in release
builds.§fn tap_deref_dbg<T>(self, func: impl FnOnce(&T)) -> Self
fn tap_deref_dbg<T>(self, func: impl FnOnce(&T)) -> Self
Calls
.tap_deref()
only in debug builds, and is erased in release
builds.§impl<T> TryConv for T
impl<T> TryConv 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
The counterpart to
unchecked_from
.§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
Consume self to return an equivalent value of
T
.