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>

source§

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

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

type Error = ()

The list’s error type.
source§

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 count() -> u32

The current count of ids in the list.
source§

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

Return true if the list already contains id.
source§

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

Hook for inserting a new id. Read more
source§

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

Get the score of id.
source§

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>

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

Regenerate this list from scratch. Returns the count of items inserted. Read more
source§

fn try_state() -> Result<(), TryRuntimeError>

Check internal state of the list. Only meant for debugging.
source§

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

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>

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. Read more

Auto 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> Any for Twhere T: 'static + ?Sized,

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for Twhere T: ?Sized,

const: unstable · source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for Twhere T: ?Sized,

const: unstable · source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
source§

impl<T> CheckedConversion for T

source§

fn checked_from<T>(t: T) -> Option<Self>where Self: TryFrom<T>,

Convert from a value of T into an equivalent instance of Option<Self>. Read more
source§

fn checked_into<T>(self) -> Option<T>where Self: TryInto<T>,

Consume self to return Some equivalent value of Option<T>. Read more
source§

impl<T> From<T> for T

const: unstable · source§

fn from(t: T) -> T

Returns the argument unchanged.

source§

impl<T> Instrument for T

source§

fn instrument(self, span: Span) -> Instrumented<Self>

Instruments this type with the provided Span, returning an Instrumented wrapper. Read more
source§

fn in_current_span(self) -> Instrumented<Self>

Instruments this type with the current Span, returning an Instrumented wrapper. Read more
source§

impl<T, U> Into<U> for Twhere U: From<T>,

const: unstable · source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

source§

impl<T> IsType<T> for T

source§

fn from_ref(t: &T) -> &T

Cast reference.
source§

fn into_ref(&self) -> &T

Cast reference.
source§

fn from_mut(t: &mut T) -> &mut T

Cast mutable reference.
source§

fn into_mut(&mut self) -> &mut T

Cast mutable reference.
source§

impl<T, Outer> IsWrappedBy<Outer> for Twhere Outer: AsRef<T> + AsMut<T> + From<T>, T: From<Outer>,

source§

fn from_ref(outer: &Outer) -> &T

Get a reference to the inner from the outer.

source§

fn from_mut(outer: &mut Outer) -> &mut T

Get a mutable reference to the inner from the outer.

§

impl<T> Pointable for T

§

const ALIGN: usize = mem::align_of::<T>()

The alignment of pointer.
§

type Init = T

The type for initializers.
§

unsafe fn init(init: <T as Pointable>::Init) -> usize

Initializes a with the given initializer. Read more
§

unsafe fn deref<'a>(ptr: usize) -> &'a T

Dereferences the given pointer. Read more
§

unsafe fn deref_mut<'a>(ptr: usize) -> &'a mut T

Mutably dereferences the given pointer. Read more
§

unsafe fn drop(ptr: usize)

Drops the object pointed to by the given pointer. Read more
source§

impl<T> Same<T> for T

§

type Output = T

Should always be Self
source§

impl<T> SaturatedConversion for T

source§

fn saturated_from<T>(t: T) -> Selfwhere Self: UniqueSaturatedFrom<T>,

Convert from a value of T into an equivalent instance of Self. Read more
source§

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>,

§

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

Checks if self is actually part of its subset T (and can be converted to it).
§

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

The inclusion map: converts self to the equivalent element of its superset.
source§

impl<T, U> TryFrom<U> for Twhere U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
const: unstable · source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
source§

impl<T, U> TryInto<U> for Twhere U: TryFrom<T>,

§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
const: unstable · source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
source§

impl<S, T> UncheckedInto<T> for Swhere T: UncheckedFrom<S>,

source§

fn unchecked_into(self) -> T

The counterpart to unchecked_from.
source§

impl<T, S> UniqueSaturatedInto<T> for Swhere T: Bounded, S: TryInto<T>,

source§

fn unique_saturated_into(self) -> T

Consume self to return an equivalent value of T.
§

impl<V, T> VZip<V> for Twhere V: MultiLane<T>,

§

fn vzip(self) -> V

source§

impl<T> WithSubscriber for T

source§

fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self>where S: Into<Dispatch>,

Attaches the provided Subscriber to this type, returning a WithDispatch wrapper. Read more
source§

fn with_current_subscriber(self) -> WithDispatch<Self>

Attaches the current default Subscriber to this type, returning a WithDispatch wrapper. Read more
§

impl<T> JsonSchemaMaybe for T

source§

impl<T> MaybeRefUnwindSafe for Twhere T: RefUnwindSafe,