Struct pallet_staking::Pallet
source · pub struct Pallet<T>(/* private fields */);
Expand description
The Pallet
struct, the main type that implements traits and standalone
functions within the pallet.
Implementations§
source§impl<T: Config> Pallet<T>
impl<T: Config> Pallet<T>
sourcepub fn ledger(
account: StakingAccount<T::AccountId>,
) -> Result<StakingLedger<T>, Error<T>>
pub fn ledger( account: StakingAccount<T::AccountId>, ) -> Result<StakingLedger<T>, Error<T>>
Fetches the ledger associated with a controller or stash account, if any.
pub fn payee( account: StakingAccount<T::AccountId>, ) -> Option<RewardDestination<T::AccountId>>
sourcepub fn bonded(stash: &T::AccountId) -> Option<T::AccountId>
pub fn bonded(stash: &T::AccountId) -> Option<T::AccountId>
Fetches the controller bonded to a stash account, if any.
sourcepub fn slashable_balance_of(stash: &T::AccountId) -> BalanceOf<T>
pub fn slashable_balance_of(stash: &T::AccountId) -> BalanceOf<T>
The total balance that can be slashed from a stash account as of right now.
sourcepub fn slashable_balance_of_vote_weight(
stash: &T::AccountId,
issuance: BalanceOf<T>,
) -> VoteWeight
pub fn slashable_balance_of_vote_weight( stash: &T::AccountId, issuance: BalanceOf<T>, ) -> VoteWeight
Internal impl of Self::slashable_balance_of
that returns [VoteWeight
].
sourcepub fn weight_of_fn() -> Box<dyn Fn(&T::AccountId) -> VoteWeight>
pub fn weight_of_fn() -> Box<dyn Fn(&T::AccountId) -> VoteWeight>
Returns a closure around slashable_balance_of_vote_weight
that can be passed around.
This prevents call sites from repeatedly requesting total_issuance
from backend. But it is
important to be only used while the total issuance is not changing.
sourcepub fn weight_of(who: &T::AccountId) -> VoteWeight
pub fn weight_of(who: &T::AccountId) -> VoteWeight
Same as weight_of_fn
, but made for one time use.
sourcepub fn trigger_new_era(
start_session_index: SessionIndex,
exposures: BoundedVec<(T::AccountId, Exposure<T::AccountId, BalanceOf<T>>), MaxWinnersOf<T>>,
) -> BoundedVec<T::AccountId, MaxWinnersOf<T>>
pub fn trigger_new_era( start_session_index: SessionIndex, exposures: BoundedVec<(T::AccountId, Exposure<T::AccountId, BalanceOf<T>>), MaxWinnersOf<T>>, ) -> BoundedVec<T::AccountId, MaxWinnersOf<T>>
Plan a new era.
- Bump the current era storage (which holds the latest planned era).
- Store start session index for the new planned era.
- Clean old era information.
- Store staking information for the new planned era
Returns the new validator set.
sourcepub fn store_stakers_info(
exposures: BoundedVec<(T::AccountId, Exposure<T::AccountId, BalanceOf<T>>), MaxWinnersOf<T>>,
new_planned_era: EraIndex,
) -> BoundedVec<T::AccountId, MaxWinnersOf<T>>
pub fn store_stakers_info( exposures: BoundedVec<(T::AccountId, Exposure<T::AccountId, BalanceOf<T>>), MaxWinnersOf<T>>, new_planned_era: EraIndex, ) -> BoundedVec<T::AccountId, MaxWinnersOf<T>>
Process the output of the election.
Store staking information for the new planned era
sourcepub fn reward_by_ids(
validators_points: impl IntoIterator<Item = (T::AccountId, u32)>,
)
pub fn reward_by_ids( validators_points: impl IntoIterator<Item = (T::AccountId, u32)>, )
Add reward points to validators using their stash account ID.
Validators are keyed by stash account ID and must be in the current elected set.
For each element in the iterator the given number of points in u32 is added to the validator, thus duplicates are handled.
At the end of the era each the total payout will be distributed among validator relatively to their points.
COMPLEXITY: Complexity is number_of_validator_to_reward x current_elected_len
.
pub fn add_era_stakers( current_era: EraIndex, stash: T::AccountId, exposure: Exposure<T::AccountId, BalanceOf<T>>, )
pub fn set_slash_reward_fraction(fraction: Perbill)
sourcepub fn get_npos_voters(bounds: DataProviderBounds) -> Vec<VoterOf<Self>>
pub fn get_npos_voters(bounds: DataProviderBounds) -> Vec<VoterOf<Self>>
Get all of the voters that are eligible for the npos election.
maybe_max_len
can imposes a cap on the number of voters returned;
Sets MinimumActiveStake
to the minimum active nominator stake in the returned set of
nominators.
This function is self-weighing as [DispatchClass::Mandatory
].
sourcepub fn get_npos_targets(bounds: DataProviderBounds) -> Vec<T::AccountId>
pub fn get_npos_targets(bounds: DataProviderBounds) -> Vec<T::AccountId>
Get the targets for an upcoming npos election.
This function is self-weighing as [DispatchClass::Mandatory
].
sourcepub fn do_add_nominator(who: &T::AccountId, nominations: Nominations<T>)
pub fn do_add_nominator(who: &T::AccountId, nominations: Nominations<T>)
This function will add a nominator to the Nominators
storage map,
and VoterList
.
If the nominator already exists, their nominations will be updated.
NOTE: you must ALWAYS use this function to add nominator or update their targets. Any access
to Nominators
or VoterList
outside of this function is almost certainly
wrong.
sourcepub fn do_remove_nominator(who: &T::AccountId) -> bool
pub fn do_remove_nominator(who: &T::AccountId) -> bool
This function will remove a nominator from the Nominators
storage map,
and VoterList
.
Returns true if who
was removed from Nominators
, otherwise false.
NOTE: you must ALWAYS use this function to remove a nominator from the system. Any access to
Nominators
or VoterList
outside of this function is almost certainly
wrong.
sourcepub fn do_add_validator(who: &T::AccountId, prefs: ValidatorPrefs)
pub fn do_add_validator(who: &T::AccountId, prefs: ValidatorPrefs)
This function will add a validator to the Validators
storage map.
If the validator already exists, their preferences will be updated.
NOTE: you must ALWAYS use this function to add a validator to the system. Any access to
Validators
or VoterList
outside of this function is almost certainly
wrong.
sourcepub fn do_remove_validator(who: &T::AccountId) -> bool
pub fn do_remove_validator(who: &T::AccountId) -> bool
This function will remove a validator from the Validators
storage map.
Returns true if who
was removed from Validators
, otherwise false.
NOTE: you must ALWAYS use this function to remove a validator from the system. Any access to
Validators
or VoterList
outside of this function is almost certainly
wrong.
sourcepub fn eras_stakers(
era: EraIndex,
account: &T::AccountId,
) -> Exposure<T::AccountId, BalanceOf<T>>
pub fn eras_stakers( era: EraIndex, account: &T::AccountId, ) -> Exposure<T::AccountId, BalanceOf<T>>
Returns full exposure of a validator for a given era.
History note: This used to be a getter for old storage item ErasStakers
deprecated in v14.
Since this function is used in the codebase at various places, we kept it as a custom getter
that takes care of getting the full exposure of the validator in a backward compatible way.
source§impl<T: Config> Pallet<T>
impl<T: Config> Pallet<T>
sourcepub fn api_nominations_quota(balance: BalanceOf<T>) -> u32
pub fn api_nominations_quota(balance: BalanceOf<T>) -> u32
Returns the current nominations quota for nominators.
Used by the runtime API.
pub fn api_eras_stakers( era: EraIndex, account: T::AccountId, ) -> Exposure<T::AccountId, BalanceOf<T>>
pub fn api_eras_stakers_page_count(era: EraIndex, account: T::AccountId) -> Page
pub fn api_pending_rewards(era: EraIndex, account: T::AccountId) -> bool
source§impl<T: Config> Pallet<T>
impl<T: Config> Pallet<T>
sourcepub fn validator_count() -> u32
pub fn validator_count() -> u32
Get the ideal number of active validators.
sourcepub fn minimum_validator_count() -> u32
pub fn minimum_validator_count() -> u32
Get the minimum number of staking participants before emergency conditions are imposed.
sourcepub fn invulnerables() -> Vec<T::AccountId>
pub fn invulnerables() -> Vec<T::AccountId>
Get the validators that may never be slashed or forcibly kicked out.
sourcepub fn validators<EncodeLikeAccountId>(
account_id: EncodeLikeAccountId,
) -> ValidatorPrefswhere
EncodeLikeAccountId: EncodeLike<T::AccountId>,
pub fn validators<EncodeLikeAccountId>(
account_id: EncodeLikeAccountId,
) -> ValidatorPrefswhere
EncodeLikeAccountId: EncodeLike<T::AccountId>,
Get the preferences of a given validator.
sourcepub fn nominators<EncodeLikeAccountId>(
account_id: EncodeLikeAccountId,
) -> Option<Nominations<T>>where
EncodeLikeAccountId: EncodeLike<T::AccountId>,
pub fn nominators<EncodeLikeAccountId>(
account_id: EncodeLikeAccountId,
) -> Option<Nominations<T>>where
EncodeLikeAccountId: EncodeLike<T::AccountId>,
Get the nomination preferences of a given nominator.
sourcepub fn current_era() -> Option<EraIndex>
pub fn current_era() -> Option<EraIndex>
Get the current era index.
sourcepub fn active_era() -> Option<ActiveEraInfo>
pub fn active_era() -> Option<ActiveEraInfo>
Get the active era information.
sourcepub fn eras_start_session_index<EncodeLikeEraIndex>(
era_index: EncodeLikeEraIndex,
) -> Option<SessionIndex>where
EncodeLikeEraIndex: EncodeLike<EraIndex>,
pub fn eras_start_session_index<EncodeLikeEraIndex>(
era_index: EncodeLikeEraIndex,
) -> Option<SessionIndex>where
EncodeLikeEraIndex: EncodeLike<EraIndex>,
Get the session index at which the era starts for the last Config::HistoryDepth
eras.
sourcepub fn eras_stakers_clipped<EncodeLikeEraIndex, EncodeLikeAccountId>(
era_index: EncodeLikeEraIndex,
account_id: EncodeLikeAccountId,
) -> Exposure<T::AccountId, BalanceOf<T>>where
EncodeLikeEraIndex: EncodeLike<EraIndex>,
EncodeLikeAccountId: EncodeLike<T::AccountId>,
pub fn eras_stakers_clipped<EncodeLikeEraIndex, EncodeLikeAccountId>(
era_index: EncodeLikeEraIndex,
account_id: EncodeLikeAccountId,
) -> Exposure<T::AccountId, BalanceOf<T>>where
EncodeLikeEraIndex: EncodeLike<EraIndex>,
EncodeLikeAccountId: EncodeLike<T::AccountId>,
Get the clipped exposure of a given validator at an era.
sourcepub fn claimed_rewards<EncodeLikeEraIndex, EncodeLikeAccountId>(
era_index: EncodeLikeEraIndex,
account_id: EncodeLikeAccountId,
) -> Vec<Page>where
EncodeLikeEraIndex: EncodeLike<EraIndex>,
EncodeLikeAccountId: EncodeLike<T::AccountId>,
pub fn claimed_rewards<EncodeLikeEraIndex, EncodeLikeAccountId>(
era_index: EncodeLikeEraIndex,
account_id: EncodeLikeAccountId,
) -> Vec<Page>where
EncodeLikeEraIndex: EncodeLike<EraIndex>,
EncodeLikeAccountId: EncodeLike<T::AccountId>,
Get the paged history of claimed rewards by era for given validator.
sourcepub fn eras_validator_prefs<EncodeLikeEraIndex, EncodeLikeAccountId>(
era_index: EncodeLikeEraIndex,
account_id: EncodeLikeAccountId,
) -> ValidatorPrefswhere
EncodeLikeEraIndex: EncodeLike<EraIndex>,
EncodeLikeAccountId: EncodeLike<T::AccountId>,
pub fn eras_validator_prefs<EncodeLikeEraIndex, EncodeLikeAccountId>(
era_index: EncodeLikeEraIndex,
account_id: EncodeLikeAccountId,
) -> ValidatorPrefswhere
EncodeLikeEraIndex: EncodeLike<EraIndex>,
EncodeLikeAccountId: EncodeLike<T::AccountId>,
Get the preferences of given validator at given era.
sourcepub fn eras_validator_reward<EncodeLikeEraIndex>(
era_index: EncodeLikeEraIndex,
) -> Option<BalanceOf<T>>where
EncodeLikeEraIndex: EncodeLike<EraIndex>,
pub fn eras_validator_reward<EncodeLikeEraIndex>(
era_index: EncodeLikeEraIndex,
) -> Option<BalanceOf<T>>where
EncodeLikeEraIndex: EncodeLike<EraIndex>,
Get the total validator era payout for the last Config::HistoryDepth
eras.
sourcepub fn eras_reward_points<EncodeLikeEraIndex>(
era_index: EncodeLikeEraIndex,
) -> EraRewardPoints<T::AccountId>where
EncodeLikeEraIndex: EncodeLike<EraIndex>,
pub fn eras_reward_points<EncodeLikeEraIndex>(
era_index: EncodeLikeEraIndex,
) -> EraRewardPoints<T::AccountId>where
EncodeLikeEraIndex: EncodeLike<EraIndex>,
Get the rewards for the last Config::HistoryDepth
eras.
sourcepub fn eras_total_stake<EncodeLikeEraIndex>(
era_index: EncodeLikeEraIndex,
) -> BalanceOf<T>where
EncodeLikeEraIndex: EncodeLike<EraIndex>,
pub fn eras_total_stake<EncodeLikeEraIndex>(
era_index: EncodeLikeEraIndex,
) -> BalanceOf<T>where
EncodeLikeEraIndex: EncodeLike<EraIndex>,
Get the total amount staked for the last Config::HistoryDepth
eras.
sourcepub fn slash_reward_fraction() -> Perbill
pub fn slash_reward_fraction() -> Perbill
Get the percentage of the slash that is distributed to reporters.
sourcepub fn canceled_payout() -> BalanceOf<T>
pub fn canceled_payout() -> BalanceOf<T>
Get the amount of canceled slash payout.
sourcepub fn slashing_spans<EncodeLikeAccountId>(
account_id: EncodeLikeAccountId,
) -> Option<SlashingSpans>where
EncodeLikeAccountId: EncodeLike<T::AccountId>,
pub fn slashing_spans<EncodeLikeAccountId>(
account_id: EncodeLikeAccountId,
) -> Option<SlashingSpans>where
EncodeLikeAccountId: EncodeLike<T::AccountId>,
Get the slashing spans for given account.
sourcepub fn current_planned_session() -> SessionIndex
pub fn current_planned_session() -> SessionIndex
Get the last planned session scheduled by the session pallet.
source§impl<T: Config> Pallet<T>
impl<T: Config> Pallet<T>
sourcepub fn bond(
origin: OriginFor<T>,
value: BalanceOf<T>,
payee: RewardDestination<T::AccountId>,
) -> DispatchResult
pub fn bond( origin: OriginFor<T>, value: BalanceOf<T>, payee: RewardDestination<T::AccountId>, ) -> DispatchResult
Take the origin account as a stash and lock up value
of its balance. controller
will
be the account that controls it.
value
must be more than the minimum_balance
specified by T::Currency
.
The dispatch origin for this call must be Signed by the stash account.
Emits Bonded
.
§Complexity
- Independent of the arguments. Moderate complexity.
- O(1).
- Three extra DB entries.
NOTE: Two of the storage writes (Self::bonded
, Self::payee
) are never cleaned
unless the origin
falls below existential deposit (or equal to 0) and gets removed
as dust.
sourcepub fn bond_extra(
origin: OriginFor<T>,
max_additional: BalanceOf<T>,
) -> DispatchResult
pub fn bond_extra( origin: OriginFor<T>, max_additional: BalanceOf<T>, ) -> DispatchResult
Add some extra amount that have appeared in the stash free_balance
into the balance up
for staking.
The dispatch origin for this call must be Signed by the stash, not the controller.
Use this if there are additional funds in your stash account that you wish to bond.
Unlike bond
or unbond
this function does not impose
any limitation on the amount that can be added.
Emits Bonded
.
§Complexity
- Independent of the arguments. Insignificant complexity.
- O(1).
sourcepub fn unbond(
origin: OriginFor<T>,
value: BalanceOf<T>,
) -> DispatchResultWithPostInfo
pub fn unbond( origin: OriginFor<T>, value: BalanceOf<T>, ) -> DispatchResultWithPostInfo
Schedule a portion of the stash to be unlocked ready for transfer out after the bond
period ends. If this leaves an amount actively bonded less than
asset::existential_deposit
, then it is increased to the full amount.
The dispatch origin for this call must be Signed by the controller, not the stash.
Once the unlock period is done, you can call withdraw_unbonded
to actually move
the funds out of management ready for transfer.
No more than a limited number of unlocking chunks (see MaxUnlockingChunks
)
can co-exists at the same time. If there are no unlocking chunks slots available
Call::withdraw_unbonded
is called to remove some of the chunks (if possible).
If a user encounters the InsufficientBond
error when calling this extrinsic,
they should call chill
first in order to free up their bonded funds.
Emits Unbonded
.
See also Call::withdraw_unbonded
.
sourcepub fn withdraw_unbonded(
origin: OriginFor<T>,
num_slashing_spans: u32,
) -> DispatchResultWithPostInfo
pub fn withdraw_unbonded( origin: OriginFor<T>, num_slashing_spans: u32, ) -> DispatchResultWithPostInfo
Remove any unlocked chunks from the unlocking
queue from our management.
This essentially frees up that balance to be used by the stash account to do whatever it wants.
The dispatch origin for this call must be Signed by the controller.
Emits Withdrawn
.
See also Call::unbond
.
§Parameters
num_slashing_spans
indicates the number of metadata slashing spans to clear when this call results in a complete removal of all the data related to the stash account. In this case, thenum_slashing_spans
must be larger or equal to the number of slashing spans associated with the stash account in theSlashingSpans
storage type, otherwise the call will fail. The call weight is directly proportional tonum_slashing_spans
.
§Complexity
O(S) where S is the number of slashing spans to remove NOTE: Weight annotation is the kill scenario, we refund otherwise.
sourcepub fn validate(origin: OriginFor<T>, prefs: ValidatorPrefs) -> DispatchResult
pub fn validate(origin: OriginFor<T>, prefs: ValidatorPrefs) -> DispatchResult
Declare the desire to validate for the origin controller.
Effects will be felt at the beginning of the next era.
The dispatch origin for this call must be Signed by the controller, not the stash.
sourcepub fn nominate(
origin: OriginFor<T>,
targets: Vec<<<T as Config>::Lookup as StaticLookup>::Source>,
) -> DispatchResult
pub fn nominate( origin: OriginFor<T>, targets: Vec<<<T as Config>::Lookup as StaticLookup>::Source>, ) -> DispatchResult
Declare the desire to nominate targets
for the origin controller.
Effects will be felt at the beginning of the next era.
The dispatch origin for this call must be Signed by the controller, not the stash.
§Complexity
- The transaction’s complexity is proportional to the size of
targets
(N) which is capped at CompactAssignments::LIMIT (T::MaxNominations). - Both the reads and writes follow a similar pattern.
sourcepub fn chill(origin: OriginFor<T>) -> DispatchResult
pub fn chill(origin: OriginFor<T>) -> DispatchResult
Declare no desire to either validate or nominate.
Effects will be felt at the beginning of the next era.
The dispatch origin for this call must be Signed by the controller, not the stash.
§Complexity
- Independent of the arguments. Insignificant complexity.
- Contains one read.
- Writes are limited to the
origin
account key.
sourcepub fn set_payee(
origin: OriginFor<T>,
payee: RewardDestination<T::AccountId>,
) -> DispatchResult
pub fn set_payee( origin: OriginFor<T>, payee: RewardDestination<T::AccountId>, ) -> DispatchResult
(Re-)set the payment target for a controller.
Effects will be felt instantly (as soon as this function is completed successfully).
The dispatch origin for this call must be Signed by the controller, not the stash.
§Complexity
- O(1)
- Independent of the arguments. Insignificant complexity.
- Contains a limited number of reads.
- Writes are limited to the
origin
account key.
sourcepub fn set_controller(origin: OriginFor<T>) -> DispatchResult
pub fn set_controller(origin: OriginFor<T>) -> DispatchResult
(Re-)sets the controller of a stash to the stash itself. This function previously
accepted a controller
argument to set the controller to an account other than the
stash itself. This functionality has now been removed, now only setting the controller
to the stash, if it is not already.
Effects will be felt instantly (as soon as this function is completed successfully).
The dispatch origin for this call must be Signed by the stash, not the controller.
§Complexity
O(1)
- Independent of the arguments. Insignificant complexity.
- Contains a limited number of reads.
- Writes are limited to the
origin
account key.
sourcepub fn set_validator_count(origin: OriginFor<T>, new: u32) -> DispatchResult
pub fn set_validator_count(origin: OriginFor<T>, new: u32) -> DispatchResult
sourcepub fn increase_validator_count(
origin: OriginFor<T>,
additional: u32,
) -> DispatchResult
pub fn increase_validator_count( origin: OriginFor<T>, additional: u32, ) -> DispatchResult
Increments the ideal number of validators up to maximum of
ElectionProviderBase::MaxWinners
.
The dispatch origin must be Root.
§Complexity
Same as Self::set_validator_count
.
sourcepub fn scale_validator_count(
origin: OriginFor<T>,
factor: Percent,
) -> DispatchResult
pub fn scale_validator_count( origin: OriginFor<T>, factor: Percent, ) -> DispatchResult
Scale up the ideal number of validators by a factor up to maximum of
ElectionProviderBase::MaxWinners
.
The dispatch origin must be Root.
§Complexity
Same as Self::set_validator_count
.
sourcepub fn force_no_eras(origin: OriginFor<T>) -> DispatchResult
pub fn force_no_eras(origin: OriginFor<T>) -> DispatchResult
Force there to be no new eras indefinitely.
The dispatch origin must be Root.
§Warning
The election process starts multiple blocks before the end of the era. Thus the election process may be ongoing when this is called. In this case the election will continue until the next era is triggered.
§Complexity
- No arguments.
- Weight: O(1)
sourcepub fn force_new_era(origin: OriginFor<T>) -> DispatchResult
pub fn force_new_era(origin: OriginFor<T>) -> DispatchResult
Force there to be a new era at the end of the next session. After this, it will be reset to normal (non-forced) behaviour.
The dispatch origin must be Root.
§Warning
The election process starts multiple blocks before the end of the era. If this is called just before a new era is triggered, the election process may not have enough blocks to get a result.
§Complexity
- No arguments.
- Weight: O(1)
sourcepub fn set_invulnerables(
origin: OriginFor<T>,
invulnerables: Vec<T::AccountId>,
) -> DispatchResult
pub fn set_invulnerables( origin: OriginFor<T>, invulnerables: Vec<T::AccountId>, ) -> DispatchResult
Set the validators who cannot be slashed (if any).
The dispatch origin must be Root.
sourcepub fn force_unstake(
origin: OriginFor<T>,
stash: T::AccountId,
num_slashing_spans: u32,
) -> DispatchResult
pub fn force_unstake( origin: OriginFor<T>, stash: T::AccountId, num_slashing_spans: u32, ) -> DispatchResult
Force a current staker to become completely unstaked, immediately.
The dispatch origin must be Root.
§Parameters
num_slashing_spans
: Refer to comments onCall::withdraw_unbonded
for more details.
sourcepub fn force_new_era_always(origin: OriginFor<T>) -> DispatchResult
pub fn force_new_era_always(origin: OriginFor<T>) -> DispatchResult
Force there to be a new era at the end of sessions indefinitely.
The dispatch origin must be Root.
§Warning
The election process starts multiple blocks before the end of the era. If this is called just before a new era is triggered, the election process may not have enough blocks to get a result.
sourcepub fn cancel_deferred_slash(
origin: OriginFor<T>,
era: EraIndex,
slash_indices: Vec<u32>,
) -> DispatchResult
pub fn cancel_deferred_slash( origin: OriginFor<T>, era: EraIndex, slash_indices: Vec<u32>, ) -> DispatchResult
Cancel enactment of a deferred slash.
Can be called by the T::AdminOrigin
.
Parameters: era and indices of the slashes for that era to kill.
sourcepub fn payout_stakers(
origin: OriginFor<T>,
validator_stash: T::AccountId,
era: EraIndex,
) -> DispatchResultWithPostInfo
pub fn payout_stakers( origin: OriginFor<T>, validator_stash: T::AccountId, era: EraIndex, ) -> DispatchResultWithPostInfo
Pay out next page of the stakers behind a validator for the given era.
validator_stash
is the stash account of the validator.era
may be any era between[current_era - history_depth; current_era]
.
The origin of this call must be Signed. Any account can call this function, even if it is not one of the stakers.
The reward payout could be paged in case there are too many nominators backing the
validator_stash
. This call will payout unpaid pages in an ascending order. To claim a
specific page, use payout_stakers_by_page
.`
If all pages are claimed, it returns an error InvalidPage
.
sourcepub fn rebond(
origin: OriginFor<T>,
value: BalanceOf<T>,
) -> DispatchResultWithPostInfo
pub fn rebond( origin: OriginFor<T>, value: BalanceOf<T>, ) -> DispatchResultWithPostInfo
Rebond a portion of the stash scheduled to be unlocked.
The dispatch origin must be signed by the controller.
§Complexity
- Time complexity: O(L), where L is unlocking chunks
- Bounded by
MaxUnlockingChunks
.
sourcepub fn reap_stash(
origin: OriginFor<T>,
stash: T::AccountId,
num_slashing_spans: u32,
) -> DispatchResultWithPostInfo
pub fn reap_stash( origin: OriginFor<T>, stash: T::AccountId, num_slashing_spans: u32, ) -> DispatchResultWithPostInfo
Remove all data structures concerning a staker/stash once it is at a state where it can
be considered dust
in the staking system. The requirements are:
- the
total_balance
of the stash is below existential deposit. - or, the
ledger.total
of the stash is below existential deposit. - or, existential deposit is zero and either
total_balance
orledger.total
is zero.
The former can happen in cases like a slash; the latter when a fully unbonded account
is still receiving staking rewards in RewardDestination::Staked
.
It can be called by anyone, as long as stash
meets the above requirements.
Refunds the transaction fees upon successful execution.
§Parameters
num_slashing_spans
: Refer to comments onCall::withdraw_unbonded
for more details.
sourcepub fn kick(
origin: OriginFor<T>,
who: Vec<<<T as Config>::Lookup as StaticLookup>::Source>,
) -> DispatchResult
pub fn kick( origin: OriginFor<T>, who: Vec<<<T as Config>::Lookup as StaticLookup>::Source>, ) -> DispatchResult
Remove the given nominations from the calling validator.
Effects will be felt at the beginning of the next era.
The dispatch origin for this call must be Signed by the controller, not the stash.
who
: A list of nominator stash accounts who are nominating this validator which should no longer be nominating this validator.
Note: Making this call only makes sense if you first set the validator preferences to block any further nominations.
sourcepub fn set_staking_configs(
origin: OriginFor<T>,
min_nominator_bond: ConfigOp<BalanceOf<T>>,
min_validator_bond: ConfigOp<BalanceOf<T>>,
max_nominator_count: ConfigOp<u32>,
max_validator_count: ConfigOp<u32>,
chill_threshold: ConfigOp<Percent>,
min_commission: ConfigOp<Perbill>,
max_staked_rewards: ConfigOp<Percent>,
) -> DispatchResult
pub fn set_staking_configs( origin: OriginFor<T>, min_nominator_bond: ConfigOp<BalanceOf<T>>, min_validator_bond: ConfigOp<BalanceOf<T>>, max_nominator_count: ConfigOp<u32>, max_validator_count: ConfigOp<u32>, chill_threshold: ConfigOp<Percent>, min_commission: ConfigOp<Perbill>, max_staked_rewards: ConfigOp<Percent>, ) -> DispatchResult
Update the various staking configurations .
min_nominator_bond
: The minimum active bond needed to be a nominator.min_validator_bond
: The minimum active bond needed to be a validator.max_nominator_count
: The max number of users who can be a nominator at once. When set toNone
, no limit is enforced.max_validator_count
: The max number of users who can be a validator at once. When set toNone
, no limit is enforced.chill_threshold
: The ratio ofmax_nominator_count
ormax_validator_count
which should be filled in order for thechill_other
transaction to work.min_commission
: The minimum amount of commission that each validators must maintain. This is checked only upon callingvalidate
. Existing validators are not affected.
RuntimeOrigin must be Root to call this function.
NOTE: Existing nominators and validators will not be affected by this update.
to kick people under the new limits, chill_other
should be called.
sourcepub fn chill_other(origin: OriginFor<T>, stash: T::AccountId) -> DispatchResult
pub fn chill_other(origin: OriginFor<T>, stash: T::AccountId) -> DispatchResult
Declare a controller
to stop participating as either a validator or nominator.
Effects will be felt at the beginning of the next era.
The dispatch origin for this call must be Signed, but can be called by anyone.
If the caller is the same as the controller being targeted, then no further checks are
enforced, and this function behaves just like chill
.
If the caller is different than the controller being targeted, the following conditions must be met:
controller
must belong to a nominator who has become non-decodable,
Or:
- A
ChillThreshold
must be set and checked which defines how close to the max nominators or validators we must reach before users can start chilling one-another. - A
MaxNominatorCount
andMaxValidatorCount
must be set which is used to determine how close we are to the threshold. - A
MinNominatorBond
andMinValidatorBond
must be set and checked, which determines if this is a person that should be chilled because they have not met the threshold bond required.
This can be helpful if bond requirements are updated, and we need to remove old users who do not satisfy these requirements.
sourcepub fn force_apply_min_commission(
origin: OriginFor<T>,
validator_stash: T::AccountId,
) -> DispatchResult
pub fn force_apply_min_commission( origin: OriginFor<T>, validator_stash: T::AccountId, ) -> DispatchResult
Force a validator to have at least the minimum commission. This will not affect a validator who already has a commission greater than or equal to the minimum. Any account can call this.
sourcepub fn set_min_commission(origin: OriginFor<T>, new: Perbill) -> DispatchResult
pub fn set_min_commission(origin: OriginFor<T>, new: Perbill) -> DispatchResult
Sets the minimum amount of commission that each validators must maintain.
This call has lower privilege requirements than set_staking_config
and can be called
by the T::AdminOrigin
. Root can always call this.
sourcepub fn payout_stakers_by_page(
origin: OriginFor<T>,
validator_stash: T::AccountId,
era: EraIndex,
page: Page,
) -> DispatchResultWithPostInfo
pub fn payout_stakers_by_page( origin: OriginFor<T>, validator_stash: T::AccountId, era: EraIndex, page: Page, ) -> DispatchResultWithPostInfo
Pay out a page of the stakers behind a validator for the given era and page.
validator_stash
is the stash account of the validator.era
may be any era between[current_era - history_depth; current_era]
.page
is the page index of nominators to pay out with value between 0 andnum_nominators / T::MaxExposurePageSize
.
The origin of this call must be Signed. Any account can call this function, even if it is not one of the stakers.
If a validator has more than Config::MaxExposurePageSize
nominators backing
them, then the list of nominators is paged, with each page being capped at
[Config::MaxExposurePageSize
.] If a validator has more than one page of nominators,
the call needs to be made for each page separately in order for all the nominators
backing a validator to receive the reward. The nominators are not sorted across pages
and so it should not be assumed the highest staker would be on the topmost page and vice
versa. If rewards are not claimed in Config::HistoryDepth
eras, they are lost.
sourcepub fn update_payee(
origin: OriginFor<T>,
controller: T::AccountId,
) -> DispatchResultWithPostInfo
pub fn update_payee( origin: OriginFor<T>, controller: T::AccountId, ) -> DispatchResultWithPostInfo
Migrates an account’s RewardDestination::Controller
to
RewardDestination::Account(controller)
.
Effects will be felt instantly (as soon as this function is completed successfully).
This will waive the transaction fee if the payee
is successfully migrated.
sourcepub fn deprecate_controller_batch(
origin: OriginFor<T>,
controllers: BoundedVec<T::AccountId, T::MaxControllersInDeprecationBatch>,
) -> DispatchResultWithPostInfo
pub fn deprecate_controller_batch( origin: OriginFor<T>, controllers: BoundedVec<T::AccountId, T::MaxControllersInDeprecationBatch>, ) -> DispatchResultWithPostInfo
Updates a batch of controller accounts to their corresponding stash account if they are not the same. Ignores any controller accounts that do not exist, and does not operate if the stash and controller are already the same.
Effects will be felt instantly (as soon as this function is completed successfully).
The dispatch origin must be T::AdminOrigin
.
sourcepub fn restore_ledger(
origin: OriginFor<T>,
stash: T::AccountId,
maybe_controller: Option<T::AccountId>,
maybe_total: Option<BalanceOf<T>>,
maybe_unlocking: Option<BoundedVec<UnlockChunk<BalanceOf<T>>, T::MaxUnlockingChunks>>,
) -> DispatchResult
pub fn restore_ledger( origin: OriginFor<T>, stash: T::AccountId, maybe_controller: Option<T::AccountId>, maybe_total: Option<BalanceOf<T>>, maybe_unlocking: Option<BoundedVec<UnlockChunk<BalanceOf<T>>, T::MaxUnlockingChunks>>, ) -> DispatchResult
Restores the state of a ledger which is in an inconsistent state.
The requirements to restore a ledger are the following:
- The stash is bonded; or
- The stash is not bonded but it has a staking lock left behind; or
- If the stash has an associated ledger and its state is inconsistent; or
- If the ledger is not corrupted but its staking lock is out of sync.
The maybe_*
input parameters will overwrite the corresponding data and metadata of the
ledger associated with the stash. If the input parameters are not set, the ledger will
be reset values from on-chain state.
Trait Implementations§
source§impl<T: Config> BeforeAllRuntimeMigrations for Pallet<T>
impl<T: Config> BeforeAllRuntimeMigrations for Pallet<T>
source§fn before_all_runtime_migrations() -> Weight
fn before_all_runtime_migrations() -> Weight
source§impl<T> Benchmarking for Pallet<T>where
T: Config + Config,
impl<T> Benchmarking for Pallet<T>where
T: Config + Config,
source§fn benchmarks(extra: bool) -> Vec<BenchmarkMetadata>
fn benchmarks(extra: bool) -> Vec<BenchmarkMetadata>
source§fn run_benchmark(
extrinsic: &[u8],
c: &[(BenchmarkParameter, u32)],
whitelist: &[TrackedStorageKey],
verify: bool,
internal_repeats: u32,
) -> Result<Vec<BenchmarkResult>, BenchmarkError>
fn run_benchmark( extrinsic: &[u8], c: &[(BenchmarkParameter, u32)], whitelist: &[TrackedStorageKey], verify: bool, internal_repeats: u32, ) -> Result<Vec<BenchmarkResult>, BenchmarkError>
source§impl<T: Config> ElectionDataProvider for Pallet<T>
impl<T: Config> ElectionDataProvider for Pallet<T>
§type BlockNumber = <<<T as Config>::Block as HeaderProvider>::HeaderT as Header>::Number
type BlockNumber = <<<T as Config>::Block as HeaderProvider>::HeaderT as Header>::Number
§type MaxVotesPerVoter = <<T as Config>::NominationsQuota as NominationsQuota<<T as Config>::CurrencyBalance>>::MaxNominations
type MaxVotesPerVoter = <<T as Config>::NominationsQuota as NominationsQuota<<T as Config>::CurrencyBalance>>::MaxNominations
source§fn desired_targets() -> Result<u32>
fn desired_targets() -> Result<u32>
source§fn electing_voters(bounds: DataProviderBounds) -> Result<Vec<VoterOf<Self>>>
fn electing_voters(bounds: DataProviderBounds) -> Result<Vec<VoterOf<Self>>>
source§fn electable_targets(bounds: DataProviderBounds) -> Result<Vec<T::AccountId>>
fn electable_targets(bounds: DataProviderBounds) -> Result<Vec<T::AccountId>>
source§fn next_election_prediction(now: BlockNumberFor<T>) -> BlockNumberFor<T>
fn next_election_prediction(now: BlockNumberFor<T>) -> BlockNumberFor<T>
source§fn add_voter(
voter: T::AccountId,
weight: VoteWeight,
targets: BoundedVec<T::AccountId, Self::MaxVotesPerVoter>,
)
fn add_voter( voter: T::AccountId, weight: VoteWeight, targets: BoundedVec<T::AccountId, Self::MaxVotesPerVoter>, )
source§fn add_target(target: T::AccountId)
fn add_target(target: T::AccountId)
source§impl<T> EventHandler<<T as Config>::AccountId, <<<T as Config>::Block as HeaderProvider>::HeaderT as Header>::Number> for Pallet<T>where
T: Config + Config + Config,
impl<T> EventHandler<<T as Config>::AccountId, <<<T as Config>::Block as HeaderProvider>::HeaderT as Header>::Number> for Pallet<T>where
T: Config + Config + Config,
Add reward points to block authors:
- 20 points to the block producer for producing a (non-uncle) block,
source§impl<T: Config> GetStorageVersion for Pallet<T>
impl<T: Config> GetStorageVersion for Pallet<T>
§type InCodeStorageVersion = StorageVersion
type InCodeStorageVersion = StorageVersion
source§fn in_code_storage_version() -> Self::InCodeStorageVersion
fn in_code_storage_version() -> Self::InCodeStorageVersion
storage_version
attribute, or
[NoStorageVersionSet
] if the attribute is missing.source§fn on_chain_storage_version() -> StorageVersion
fn on_chain_storage_version() -> StorageVersion
§fn current_storage_version() -> Self::InCodeStorageVersion
fn current_storage_version() -> Self::InCodeStorageVersion
in_code_storage_version
and will be removed after March 2024.Self::current_storage_version
] instead. Read moresource§impl<T: Config> Hooks<<<<T as Config>::Block as HeaderProvider>::HeaderT as Header>::Number> for Pallet<T>
impl<T: Config> Hooks<<<<T as Config>::Block as HeaderProvider>::HeaderT as Header>::Number> for Pallet<T>
source§fn on_initialize(_now: BlockNumberFor<T>) -> Weight
fn on_initialize(_now: BlockNumberFor<T>) -> Weight
source§fn on_finalize(_n: BlockNumberFor<T>)
fn on_finalize(_n: BlockNumberFor<T>)
source§fn integrity_test()
fn integrity_test()
source§fn try_state(n: BlockNumberFor<T>) -> Result<(), TryRuntimeError>
fn try_state(n: BlockNumberFor<T>) -> Result<(), TryRuntimeError>
§fn on_idle(_n: BlockNumber, _remaining_weight: Weight) -> Weight
fn on_idle(_n: BlockNumber, _remaining_weight: Weight) -> Weight
Hooks::on_finalize
]). Read more§fn on_poll(_n: BlockNumber, _weight: &mut WeightMeter)
fn on_poll(_n: BlockNumber, _weight: &mut WeightMeter)
§fn on_runtime_upgrade() -> Weight
fn on_runtime_upgrade() -> Weight
Executive
pallet. Read more§fn pre_upgrade() -> Result<Vec<u8>, DispatchError>
fn pre_upgrade() -> Result<Vec<u8>, DispatchError>
§fn post_upgrade(_state: Vec<u8>) -> Result<(), DispatchError>
fn post_upgrade(_state: Vec<u8>) -> Result<(), DispatchError>
§fn offchain_worker(_n: BlockNumber)
fn offchain_worker(_n: BlockNumber)
source§impl<T: Config> IntegrityTest for Pallet<T>
impl<T: Config> IntegrityTest for Pallet<T>
source§fn integrity_test()
fn integrity_test()
Hooks::integrity_test
].source§impl<T: Config> OffchainWorker<<<<T as Config>::Block as HeaderProvider>::HeaderT as Header>::Number> for Pallet<T>
impl<T: Config> OffchainWorker<<<<T as Config>::Block as HeaderProvider>::HeaderT as Header>::Number> for Pallet<T>
source§fn offchain_worker(n: BlockNumberFor<T>)
fn offchain_worker(n: BlockNumberFor<T>)
source§impl<T: Config> OnFinalize<<<<T as Config>::Block as HeaderProvider>::HeaderT as Header>::Number> for Pallet<T>
impl<T: Config> OnFinalize<<<<T as Config>::Block as HeaderProvider>::HeaderT as Header>::Number> for Pallet<T>
source§fn on_finalize(n: BlockNumberFor<T>)
fn on_finalize(n: BlockNumberFor<T>)
Hooks::on_finalize
].source§impl<T: Config> OnGenesis for Pallet<T>
impl<T: Config> OnGenesis for Pallet<T>
source§fn on_genesis()
fn on_genesis()
source§impl<T: Config> OnIdle<<<<T as Config>::Block as HeaderProvider>::HeaderT as Header>::Number> for Pallet<T>
impl<T: Config> OnIdle<<<<T as Config>::Block as HeaderProvider>::HeaderT as Header>::Number> for Pallet<T>
source§impl<T: Config> OnInitialize<<<<T as Config>::Block as HeaderProvider>::HeaderT as Header>::Number> for Pallet<T>
impl<T: Config> OnInitialize<<<<T as Config>::Block as HeaderProvider>::HeaderT as Header>::Number> for Pallet<T>
source§fn on_initialize(n: BlockNumberFor<T>) -> Weight
fn on_initialize(n: BlockNumberFor<T>) -> Weight
Hooks::on_initialize
].source§impl<T> OnOffenceHandler<<T as Config>::AccountId, (<T as Config>::ValidatorId, <T as Config>::FullIdentification), Weight> for Pallet<T>where
T: Config<ValidatorId = <T as Config>::AccountId> + Config<FullIdentification = Exposure<<T as Config>::AccountId, BalanceOf<T>>, FullIdentificationOf = ExposureOf<T>> + Config,
T::SessionHandler: SessionHandler<<T as Config>::AccountId>,
T::SessionManager: SessionManager<<T as Config>::AccountId>,
T::ValidatorIdOf: Convert<<T as Config>::AccountId, Option<<T as Config>::AccountId>>,
impl<T> OnOffenceHandler<<T as Config>::AccountId, (<T as Config>::ValidatorId, <T as Config>::FullIdentification), Weight> for Pallet<T>where
T: Config<ValidatorId = <T as Config>::AccountId> + Config<FullIdentification = Exposure<<T as Config>::AccountId, BalanceOf<T>>, FullIdentificationOf = ExposureOf<T>> + Config,
T::SessionHandler: SessionHandler<<T as Config>::AccountId>,
T::SessionManager: SessionManager<<T as Config>::AccountId>,
T::ValidatorIdOf: Convert<<T as Config>::AccountId, Option<<T as Config>::AccountId>>,
This is intended to be used with FilterHistoricalOffences
.
source§fn on_offence(
offenders: &[OffenceDetails<T::AccountId, IdentificationTuple<T>>],
slash_fraction: &[Perbill],
slash_session: SessionIndex,
) -> Weight
fn on_offence( offenders: &[OffenceDetails<T::AccountId, IdentificationTuple<T>>], slash_fraction: &[Perbill], slash_session: SessionIndex, ) -> Weight
source§impl<T: Config> OnPoll<<<<T as Config>::Block as HeaderProvider>::HeaderT as Header>::Number> for Pallet<T>
impl<T: Config> OnPoll<<<<T as Config>::Block as HeaderProvider>::HeaderT as Header>::Number> for Pallet<T>
source§impl<T: Config> OnRuntimeUpgrade for Pallet<T>
impl<T: Config> OnRuntimeUpgrade for Pallet<T>
source§fn on_runtime_upgrade() -> Weight
fn on_runtime_upgrade() -> Weight
Hooks::on_runtime_upgrade
].§fn try_on_runtime_upgrade(checks: bool) -> Result<Weight, DispatchError>
fn try_on_runtime_upgrade(checks: bool) -> Result<Weight, DispatchError>
pre_upgrade
->
on_runtime_upgrade
-> post_upgrade
hooks for a migration. Read moresource§impl<T: Config> PalletInfoAccess for Pallet<T>
impl<T: Config> PalletInfoAccess for Pallet<T>
source§fn module_name() -> &'static str
fn module_name() -> &'static str
source§fn crate_version() -> CrateVersion
fn crate_version() -> CrateVersion
source§impl<T> PartialEq for Pallet<T>
impl<T> PartialEq for Pallet<T>
source§impl<T: Config> SessionManager<<T as Config>::AccountId> for Pallet<T>
impl<T: Config> SessionManager<<T as Config>::AccountId> for Pallet<T>
In this implementation new_session(session)
must be called before end_session(session-1)
i.e. the new session must be planned before the ending of the previous session.
Once the first new_session is planned, all session must start and then end in order, though some session can lag in between the newest session planned and the latest session started.
source§fn new_session(new_index: SessionIndex) -> Option<Vec<T::AccountId>>
fn new_session(new_index: SessionIndex) -> Option<Vec<T::AccountId>>
source§fn new_session_genesis(new_index: SessionIndex) -> Option<Vec<T::AccountId>>
fn new_session_genesis(new_index: SessionIndex) -> Option<Vec<T::AccountId>>
new_session
, but it this should only be called at genesis. Read moresource§fn start_session(start_index: SessionIndex)
fn start_session(start_index: SessionIndex)
source§fn end_session(end_index: SessionIndex)
fn end_session(end_index: SessionIndex)
source§impl<T: Config> SessionManager<<T as Config>::AccountId, Exposure<<T as Config>::AccountId, <T as Config>::CurrencyBalance>> for Pallet<T>
impl<T: Config> SessionManager<<T as Config>::AccountId, Exposure<<T as Config>::AccountId, <T as Config>::CurrencyBalance>> for Pallet<T>
source§fn new_session(
new_index: SessionIndex,
) -> Option<Vec<(T::AccountId, Exposure<T::AccountId, BalanceOf<T>>)>>
fn new_session( new_index: SessionIndex, ) -> Option<Vec<(T::AccountId, Exposure<T::AccountId, BalanceOf<T>>)>>
fn new_session_genesis( new_index: SessionIndex, ) -> Option<Vec<(T::AccountId, Exposure<T::AccountId, BalanceOf<T>>)>>
fn start_session(start_index: SessionIndex)
fn end_session(end_index: SessionIndex)
source§impl<T: Config> StakingInterface for Pallet<T>
impl<T: Config> StakingInterface for Pallet<T>
source§fn is_virtual_staker(who: &T::AccountId) -> bool
fn is_virtual_staker(who: &T::AccountId) -> bool
Whether who
is a virtual staker whose funds are managed by another pallet.
There is an assumption that, this account is keyless and managed by another pallet in the runtime. Hence, it can never sign its own transactions.
§type Balance = <T as Config>::CurrencyBalance
type Balance = <T as Config>::CurrencyBalance
§type CurrencyToVote = <T as Config>::CurrencyToVote
type CurrencyToVote = <T as Config>::CurrencyToVote
source§fn minimum_nominator_bond() -> Self::Balance
fn minimum_nominator_bond() -> Self::Balance
source§fn minimum_validator_bond() -> Self::Balance
fn minimum_validator_bond() -> Self::Balance
source§fn stash_by_ctrl(
controller: &Self::AccountId,
) -> Result<Self::AccountId, DispatchError>
fn stash_by_ctrl( controller: &Self::AccountId, ) -> Result<Self::AccountId, DispatchError>
controller
. Read moresource§fn bonding_duration() -> EraIndex
fn bonding_duration() -> EraIndex
source§fn current_era() -> EraIndex
fn current_era() -> EraIndex
source§fn stake(who: &Self::AccountId) -> Result<Stake<BalanceOf<T>>, DispatchError>
fn stake(who: &Self::AccountId) -> Result<Stake<BalanceOf<T>>, DispatchError>
Stake
] of who
.source§fn bond_extra(who: &Self::AccountId, extra: Self::Balance) -> DispatchResult
fn bond_extra(who: &Self::AccountId, extra: Self::Balance) -> DispatchResult
who
’s free balance against the active bonded balance of
the account. The amount extra actually bonded will never be more than who
’s free
balance.source§fn unbond(who: &Self::AccountId, value: Self::Balance) -> DispatchResult
fn unbond(who: &Self::AccountId, value: Self::Balance) -> DispatchResult
Self::bonding_duration
]. Read moresource§fn set_payee(
stash: &Self::AccountId,
reward_acc: &Self::AccountId,
) -> DispatchResult
fn set_payee( stash: &Self::AccountId, reward_acc: &Self::AccountId, ) -> DispatchResult
source§fn withdraw_unbonded(
who: Self::AccountId,
num_slashing_spans: u32,
) -> Result<bool, DispatchError>
fn withdraw_unbonded( who: Self::AccountId, num_slashing_spans: u32, ) -> Result<bool, DispatchError>
source§fn bond(
who: &Self::AccountId,
value: Self::Balance,
payee: &Self::AccountId,
) -> DispatchResult
fn bond( who: &Self::AccountId, value: Self::Balance, payee: &Self::AccountId, ) -> DispatchResult
value
of who
’s balance, while forwarding any rewards to payee
.source§fn nominate(
who: &Self::AccountId,
targets: Vec<Self::AccountId>,
) -> DispatchResult
fn nominate( who: &Self::AccountId, targets: Vec<Self::AccountId>, ) -> DispatchResult
who
nominate validators
.source§fn desired_validator_count() -> u32
fn desired_validator_count() -> u32
source§fn election_ongoing() -> bool
fn election_ongoing() -> bool
source§fn force_unstake(who: Self::AccountId) -> DispatchResult
fn force_unstake(who: Self::AccountId) -> DispatchResult
source§fn is_exposed_in_era(who: &Self::AccountId, era: &EraIndex) -> bool
fn is_exposed_in_era(who: &Self::AccountId, era: &EraIndex) -> bool
staker
has been exposed in an era.source§fn status(
who: &Self::AccountId,
) -> Result<StakerStatus<Self::AccountId>, DispatchError>
fn status( who: &Self::AccountId, ) -> Result<StakerStatus<Self::AccountId>, DispatchError>
Err
if not staked at all.source§fn slash_reward_fraction() -> Perbill
fn slash_reward_fraction() -> Perbill
source§fn nominations(who: &Self::AccountId) -> Option<Vec<T::AccountId>>
fn nominations(who: &Self::AccountId) -> Option<Vec<T::AccountId>>
None
otherwise.fn add_era_stakers( current_era: &EraIndex, stash: &T::AccountId, exposures: Vec<(Self::AccountId, Self::Balance)>, )
fn set_current_era(era: EraIndex)
fn max_exposure_page_size() -> Page
§fn total_stake(who: &Self::AccountId) -> Result<Self::Balance, DispatchError>
fn total_stake(who: &Self::AccountId) -> Result<Self::Balance, DispatchError>
Err
if not a staker.§fn active_stake(who: &Self::AccountId) -> Result<Self::Balance, DispatchError>
fn active_stake(who: &Self::AccountId) -> Result<Self::Balance, DispatchError>
Stake
], Err
if not a staker.§fn is_unbonding(who: &Self::AccountId) -> Result<bool, DispatchError>
fn is_unbonding(who: &Self::AccountId) -> Result<bool, DispatchError>
Err
if not a staker at all.§fn fully_unbond(who: &Self::AccountId) -> Result<(), DispatchError>
fn fully_unbond(who: &Self::AccountId) -> Result<(), DispatchError>
Err
if not a staker at all.§fn is_validator(who: &Self::AccountId) -> bool
fn is_validator(who: &Self::AccountId) -> bool
source§impl<T: Config> StakingUnchecked for Pallet<T>
impl<T: Config> StakingUnchecked for Pallet<T>
source§fn virtual_bond(
keyless_who: &Self::AccountId,
value: Self::Balance,
payee: &Self::AccountId,
) -> DispatchResult
fn virtual_bond( keyless_who: &Self::AccountId, value: Self::Balance, payee: &Self::AccountId, ) -> DispatchResult
Virtually bonds keyless_who
to payee
with value
.
The payee must not be the same as the keyless_who
.
source§fn migrate_to_virtual_staker(who: &Self::AccountId)
fn migrate_to_virtual_staker(who: &Self::AccountId)
source§fn migrate_to_direct_staker(who: &Self::AccountId)
fn migrate_to_direct_staker(who: &Self::AccountId)
source§impl<T: Config> TryState<<<<T as Config>::Block as HeaderProvider>::HeaderT as Header>::Number> for Pallet<T>
impl<T: Config> TryState<<<<T as Config>::Block as HeaderProvider>::HeaderT as Header>::Number> for Pallet<T>
source§impl<T: Config> WhitelistedStorageKeys for Pallet<T>
impl<T: Config> WhitelistedStorageKeys for Pallet<T>
source§fn whitelisted_storage_keys() -> Vec<TrackedStorageKey>
fn whitelisted_storage_keys() -> Vec<TrackedStorageKey>
Vec<TrackedStorageKey>
indicating the storage keys that
should be whitelisted during benchmarking. This means that those keys
will be excluded from the benchmarking performance calculation.impl<T> Eq for Pallet<T>
Auto Trait Implementations§
impl<T> Freeze for Pallet<T>
impl<T> RefUnwindSafe for Pallet<T>where
T: RefUnwindSafe,
impl<T> Send for Pallet<T>where
T: Send,
impl<T> Sync for Pallet<T>where
T: Sync,
impl<T> Unpin for Pallet<T>where
T: Unpin,
impl<T> UnwindSafe for Pallet<T>where
T: UnwindSafe,
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>,
source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
source§default unsafe fn clone_to_uninit(&self, dst: *mut T)
default unsafe fn clone_to_uninit(&self, dst: *mut T)
clone_to_uninit
)§impl<T> Conv for T
impl<T> Conv 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
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
§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
§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
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
§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> 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> ⓘ
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> ⓘ
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> 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> 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) -> 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
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
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
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>,
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>
self
from the equivalent element of its
superset. Read more§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
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
self.to_subset
but without any property checks. Always succeeds.§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
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
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
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
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
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
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
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)) -> Self
fn tap_borrow_dbg<B>(self, func: impl FnOnce(&B)) -> Self
.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
.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
.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
.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
.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
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
T
.