Struct pallet_staking::UseNominatorsAndValidatorsMap

pub struct UseNominatorsAndValidatorsMap<T>(/* private fields */);

A simple voter list implementation that does not require any additional pallets. Note, this does not provided nominators in sorted ordered. If you desire nominators in a sorted order take a look at [`pallet-bags-list].

Trait Implementations

impl<T: Config> SortedListProvider<<T as Config>::AccountId> for UseNominatorsAndValidatorsMap<T>

type Error = ()

The list’s error type.

type Score = u64

The type used by the list to compare nodes for ordering.

fn iter() -> Box<dyn Iterator<Item = T::AccountId>>

An iterator over the list, which can have take called on it.

fn iter_from( start: &T::AccountId ) -> Result<Box<dyn Iterator<Item = T::AccountId>>, Self::Error>

Returns an iterator over the list, starting right after from the given voter.

fn count() -> u32

The current count of ids in the list.

fn contains(id: &T::AccountId) -> bool

Return true if the list already contains id.

fn on_insert(_: T::AccountId, _weight: Self::Score) -> Result<(), Self::Error>

Hook for inserting a new id.

fn get_score(id: &T::AccountId) -> Result<Self::Score, Self::Error>

Get the score of id.

fn on_update(_: &T::AccountId, _weight: Self::Score) -> Result<(), Self::Error>

Hook for updating a single id.

fn on_remove(_: &T::AccountId) -> Result<(), Self::Error>

Hook for removing am id from the list.

fn unsafe_regenerate( _: impl IntoIterator<Item = T::AccountId>, _: Box<dyn Fn(&T::AccountId) -> Self::Score> ) -> u32

Regenerate this list from scratch. Returns the count of items inserted.

fn unsafe_clear()

Remove all items from the list.

fn on_increase( id: &AccountId, additional: Self::Score ) -> Result<(), Self::Error>

Same as on_update, but incorporate some increased score.

fn on_decrease( id: &AccountId, decreased: Self::Score ) -> Result<(), Self::Error>

Same as on_update, but incorporate some decreased score.