Struct pallet_staking::UseValidatorsMap
source · pub struct UseValidatorsMap<T>(_);
Expand description
A simple sorted list implementation that does not require any additional pallets. Note, this
does not provide validators in sorted order. If you desire nominators in a sorted order take
a look at [pallet-bags-list
].
Trait Implementations§
source§impl<T: Config> SortedListProvider<<T as Config>::AccountId> for UseValidatorsMap<T>
impl<T: Config> SortedListProvider<<T as Config>::AccountId> for UseValidatorsMap<T>
source§fn iter() -> Box<dyn Iterator<Item = T::AccountId>>
fn iter() -> Box<dyn Iterator<Item = T::AccountId>>
Returns iterator over voter list, which can have take
called on it.
§type Score = <T as Config>::CurrencyBalance
type Score = <T as Config>::CurrencyBalance
The type used by the list to compare nodes for ordering.
source§fn iter_from(
start: &T::AccountId
) -> Result<Box<dyn Iterator<Item = T::AccountId>>, Self::Error>
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. Read more
source§fn on_insert(_: T::AccountId, _weight: Self::Score) -> Result<(), Self::Error>
fn on_insert(_: T::AccountId, _weight: Self::Score) -> Result<(), Self::Error>
Hook for inserting a new id. Read more
source§fn on_update(_: &T::AccountId, _weight: Self::Score) -> Result<(), Self::Error>
fn on_update(_: &T::AccountId, _weight: Self::Score) -> Result<(), Self::Error>
Hook for updating a single id. Read more
source§fn on_remove(_: &T::AccountId) -> Result<(), Self::Error>
fn on_remove(_: &T::AccountId) -> Result<(), Self::Error>
Hook for removing am id from the list. Read more
source§fn unsafe_regenerate(
_: impl IntoIterator<Item = T::AccountId>,
_: Box<dyn Fn(&T::AccountId) -> Self::Score>
) -> u32
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. Read more
source§fn try_state() -> Result<(), TryRuntimeError>
fn try_state() -> Result<(), TryRuntimeError>
Check internal state of the list. Only meant for debugging.
source§fn unsafe_clear()
fn unsafe_clear()
Remove all items from the list. Read more
source§fn score_update_worst_case(
_who: &T::AccountId,
_is_increase: bool
) -> Self::Score
fn score_update_worst_case( _who: &T::AccountId, _is_increase: bool ) -> Self::Score
If
who
changes by the returned amount they are guaranteed to have a worst case change
in their list position.§fn on_increase(
id: &AccountId,
additional: Self::Score
) -> Result<(), Self::Error>
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>
fn on_decrease( id: &AccountId, decreased: Self::Score ) -> Result<(), Self::Error>
Same as
on_update
, but incorporate some decreased score. Read moreAuto Trait Implementations§
impl<T> RefUnwindSafe for UseValidatorsMap<T>where T: RefUnwindSafe,
impl<T> Send for UseValidatorsMap<T>where T: Send,
impl<T> Sync for UseValidatorsMap<T>where T: Sync,
impl<T> Unpin for UseValidatorsMap<T>where T: Unpin,
impl<T> UnwindSafe for UseValidatorsMap<T>where T: UnwindSafe,
Blanket Implementations§
source§impl<T> CheckedConversion for T
impl<T> CheckedConversion for T
source§impl<T> Instrument for T
impl<T> Instrument for T
source§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
source§fn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
source§impl<T, Outer> IsWrappedBy<Outer> for Twhere
Outer: AsRef<T> + AsMut<T> + From<T>,
T: From<Outer>,
impl<T, Outer> IsWrappedBy<Outer> for Twhere Outer: AsRef<T> + AsMut<T> + From<T>, T: From<Outer>,
§impl<T> Pointable for T
impl<T> Pointable for T
source§impl<T> SaturatedConversion for T
impl<T> SaturatedConversion for T
source§fn saturated_from<T>(t: T) -> Selfwhere
Self: UniqueSaturatedFrom<T>,
fn saturated_from<T>(t: T) -> Selfwhere Self: UniqueSaturatedFrom<T>,
source§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.source§impl<S, T> UncheckedInto<T> for Swhere
T: UncheckedFrom<S>,
impl<S, T> UncheckedInto<T> for Swhere T: UncheckedFrom<S>,
source§fn unchecked_into(self) -> T
fn unchecked_into(self) -> T
The counterpart to
unchecked_from
.source§impl<T, S> UniqueSaturatedInto<T> for Swhere
T: Bounded,
S: TryInto<T>,
impl<T, S> UniqueSaturatedInto<T> for Swhere T: Bounded, S: TryInto<T>,
source§fn unique_saturated_into(self) -> T
fn unique_saturated_into(self) -> T
Consume self to return an equivalent value of
T
.