pub struct PositiveImbalance<T: Config<I>, I: 'static = ()>(T::Balance);Expand description
Opaque, move-only struct with private fields that serves as a token denoting that funds have been created without any equal and opposite accounting.
Tuple Fields§
§0: T::BalanceImplementations§
Trait Implementations§
source§impl<T, I> Debug for PositiveImbalance<T, I>
 
impl<T, I> Debug for PositiveImbalance<T, I>
source§impl<T: Config<I>, I: 'static> Default for PositiveImbalance<T, I>
 
impl<T: Config<I>, I: 'static> Default for PositiveImbalance<T, I>
source§impl<T: Config<I>, I: 'static> Drop for PositiveImbalance<T, I>
 
impl<T: Config<I>, I: 'static> Drop for PositiveImbalance<T, I>
source§impl<T: Config<I>, I: 'static> Imbalance<<T as Config<I>>::Balance> for PositiveImbalance<T, I>
 
impl<T: Config<I>, I: 'static> Imbalance<<T as Config<I>>::Balance> for PositiveImbalance<T, I>
§type Opposite = NegativeImbalance<T, I>
 
type Opposite = NegativeImbalance<T, I>
The oppositely imbalanced type. They come in pairs.
source§fn drop_zero(self) -> Result<(), Self>
 
fn drop_zero(self) -> Result<(), Self>
Drop an instance cleanly. Only works if its 
self.value() is zero.source§fn split(self, amount: T::Balance) -> (Self, Self)
 
fn split(self, amount: T::Balance) -> (Self, Self)
Consume 
self and return two independent instances; the first
is guaranteed to be at most amount and the second will be the remainder.source§fn extract(&mut self, amount: T::Balance) -> Self
 
fn extract(&mut self, amount: T::Balance) -> Self
Mutate 
self by extracting a new instance with at most amount value, reducing self
accordingly.source§fn merge(self, other: Self) -> Self
 
fn merge(self, other: Self) -> Self
Consume 
self and an other to return a new instance that combines
both.source§fn subsume(&mut self, other: Self)
 
fn subsume(&mut self, other: Self)
Consume an 
other to mutate self into a new instance that combines
both.source§fn offset(self, other: Self::Opposite) -> SameOrOther<Self, Self::Opposite>
 
fn offset(self, other: Self::Opposite) -> SameOrOther<Self, Self::Opposite>
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.source§impl<T: PartialEq + Config<I>, I: PartialEq + 'static> PartialEq for PositiveImbalance<T, I>
 
impl<T: PartialEq + Config<I>, I: PartialEq + 'static> PartialEq for PositiveImbalance<T, I>
source§fn eq(&self, other: &PositiveImbalance<T, I>) -> bool
 
fn eq(&self, other: &PositiveImbalance<T, I>) -> bool
This method tests for 
self and other values to be equal, and is used
by ==.source§impl<T: Config<I>, I: 'static> TryDrop for PositiveImbalance<T, I>
 
impl<T: Config<I>, I: 'static> TryDrop for PositiveImbalance<T, I>
impl<T: Eq + Config<I>, I: Eq + 'static> Eq for PositiveImbalance<T, I>
impl<T: Config<I>, I: 'static> StructuralPartialEq for PositiveImbalance<T, I>
Auto Trait Implementations§
impl<T, I> Freeze for PositiveImbalance<T, I>
impl<T, I> RefUnwindSafe for PositiveImbalance<T, I>
impl<T, I> Send for PositiveImbalance<T, I>
impl<T, I> Sync for PositiveImbalance<T, I>
impl<T, I> Unpin for PositiveImbalance<T, I>
impl<T, I> UnwindSafe for PositiveImbalance<T, I>
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> Clear for T
 
impl<T> Clear for T
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> 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<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> 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, 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.