Struct g1_runtime::HandleFees
source · pub struct HandleFees;Trait Implementations§
source§impl OnUnbalanced<Imbalance<<Pallet<Runtime> as Inspect<<<MultiSignature as Verify>::Signer as IdentifyAccount>::AccountId>>::Balance, <Pallet<Runtime> as Balanced<<<MultiSignature as Verify>::Signer as IdentifyAccount>::AccountId>>::OnDropCredit, <Pallet<Runtime> as Balanced<<<MultiSignature as Verify>::Signer as IdentifyAccount>::AccountId>>::OnDropDebt>> for HandleFees
impl OnUnbalanced<Imbalance<<Pallet<Runtime> as Inspect<<<MultiSignature as Verify>::Signer as IdentifyAccount>::AccountId>>::Balance, <Pallet<Runtime> as Balanced<<<MultiSignature as Verify>::Signer as IdentifyAccount>::AccountId>>::OnDropCredit, <Pallet<Runtime> as Balanced<<<MultiSignature as Verify>::Signer as IdentifyAccount>::AccountId>>::OnDropDebt>> for HandleFees
source§fn on_nonzero_unbalanced(amount: Credit<AccountId, Balances>)
fn on_nonzero_unbalanced(amount: Credit<AccountId, Balances>)
Actually handle a non-zero imbalance. You probably want to implement this rather than
on_unbalanced.§fn on_unbalanceds<B>(amounts: impl Iterator<Item = Imbalance>)where
Imbalance: Imbalance<B>,
fn on_unbalanceds<B>(amounts: impl Iterator<Item = Imbalance>)where
Imbalance: Imbalance<B>,
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.
Auto Trait Implementations§
impl Freeze for HandleFees
impl RefUnwindSafe for HandleFees
impl Send for HandleFees
impl Sync for HandleFees
impl Unpin for HandleFees
impl UnwindSafe for HandleFees
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> 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.