[−][src]Struct pallet_democracy::Locks
Accounts for which there are locks in action which may be removed at some point in the future. The value is the block number at which the lock expires and may be removed.
TWOX-NOTE: OK ― AccountId is a secure hash.
Trait Implementations
impl<T: Trait> StorageMap<<T as Trait>::AccountId, <T as Trait>::BlockNumber> for Locks<T>[src]
type Query = Option<T::BlockNumber>
The type that get/take returns.
type Hasher = Twox64Concat
Hasher. Used for generating final key.
fn module_prefix() -> &'static [u8][src]
fn storage_prefix() -> &'static [u8][src]
fn from_optional_value_to_query(v: Option<T::BlockNumber>) -> Self::Query[src]
fn from_query_to_optional_value(v: Self::Query) -> Option<T::BlockNumber>[src]
fn prefix_hash() -> Vec<u8>[src]
fn storage_map_final_key<KeyArg>(key: KeyArg) -> Vec<u8> where
KeyArg: EncodeLike<K>, [src]
KeyArg: EncodeLike<K>,
impl<T: Trait> StoragePrefixedMap<<T as Trait>::BlockNumber> for Locks<T>[src]
fn module_prefix() -> &'static [u8][src]
fn storage_prefix() -> &'static [u8][src]
fn final_prefix() -> [u8; 32][src]
fn remove_all()[src]
fn iter_values() -> PrefixIterator<Value>[src]
fn translate_values<OldValue, TV>(translate_val: TV) -> Result<(), u32> where
OldValue: Decode,
TV: Fn(OldValue) -> Value, [src]
OldValue: Decode,
TV: Fn(OldValue) -> Value,
Auto Trait Implementations
impl<T> RefUnwindSafe for Locks<T> where
T: RefUnwindSafe,
T: RefUnwindSafe,
impl<T> Send for Locks<T> where
T: Send,
T: Send,
impl<T> Sync for Locks<T> where
T: Sync,
T: Sync,
impl<T> Unpin for Locks<T> where
T: Unpin,
T: Unpin,
impl<T> UnwindSafe for Locks<T> where
T: UnwindSafe,
T: UnwindSafe,
Blanket Implementations
impl<T> Any for T where
T: 'static + ?Sized, [src]
T: 'static + ?Sized,
impl<T> Borrow<T> for T where
T: ?Sized, [src]
T: ?Sized,
impl<T> BorrowMut<T> for T where
T: ?Sized, [src]
T: ?Sized,
fn borrow_mut(&mut self) -> &mut T[src]
impl<T> CheckedConversion for T[src]
fn checked_from<T>(t: T) -> Option<Self> where
Self: TryFrom<T>, [src]
Self: TryFrom<T>,
fn checked_into<T>(self) -> Option<T> where
Self: TryInto<T>, [src]
Self: TryInto<T>,
impl<T> From<T> for T[src]
impl<T, U> Into<U> for T where
U: From<T>, [src]
U: From<T>,
impl<T> IsType<T> for T[src]
fn from_ref(t: &T) -> &T[src]
fn into_ref(&self) -> &T[src]
fn from_mut(t: &mut T) -> &mut T[src]
fn into_mut(&mut self) -> &mut T[src]
impl<T, Outer> IsWrappedBy<Outer> for T where
Outer: AsRef<T> + AsMut<T> + From<T>,
T: From<Outer>,
Outer: AsRef<T> + AsMut<T> + From<T>,
T: From<Outer>,
fn from_ref(outer: &Outer) -> &T
Get a reference to the inner from the outer.
fn from_mut(outer: &mut Outer) -> &mut T
Get a mutable reference to the inner from the outer.
impl<K, V, G> IterableStorageMap<K, V> for G where
G: StorageMap<K, V>,
K: FullCodec,
V: FullCodec,
<G as StorageMap<K, V>>::Hasher: ReversibleStorageHasher, [src]
G: StorageMap<K, V>,
K: FullCodec,
V: FullCodec,
<G as StorageMap<K, V>>::Hasher: ReversibleStorageHasher,
type Iterator = StorageMapIterator<K, V, <G as StorageMap<K, V>>::Hasher>
The type that iterates over all (key, value).
fn iter() -> <G as IterableStorageMap<K, V>>::Iterator[src]
Enumerate all elements in the map.
fn drain() -> <G as IterableStorageMap<K, V>>::Iterator[src]
Enumerate all elements in the map.
fn translate<O, F>(f: F) where
F: Fn(K, O) -> Option<V>,
O: Decode, [src]
F: Fn(K, O) -> Option<V>,
O: Decode,
impl<T> MaybeRefUnwindSafe for T where
T: RefUnwindSafe,
T: RefUnwindSafe,
impl<T> Same<T> for T
type Output = T
Should always be Self
impl<T> SaturatedConversion for T
fn saturated_from<T>(t: T) -> Self where
Self: UniqueSaturatedFrom<T>,
Self: UniqueSaturatedFrom<T>,
fn saturated_into<T>(self) -> T where
Self: UniqueSaturatedInto<T>,
Self: UniqueSaturatedInto<T>,
impl<K, V, G> StorageMap<K, V> for G where
G: StorageMap<K, V>,
K: FullEncode,
V: FullCodec, [src]
G: StorageMap<K, V>,
K: FullEncode,
V: FullCodec,
type Query = <G as StorageMap<K, V>>::Query
The type that get/take return.
fn hashed_key_for<KeyArg>(key: KeyArg) -> Vec<u8> where
KeyArg: EncodeLike<K>, [src]
KeyArg: EncodeLike<K>,
fn swap<KeyArg1, KeyArg2>(key1: KeyArg1, key2: KeyArg2) where
KeyArg1: EncodeLike<K>,
KeyArg2: EncodeLike<K>, [src]
KeyArg1: EncodeLike<K>,
KeyArg2: EncodeLike<K>,
fn contains_key<KeyArg>(key: KeyArg) -> bool where
KeyArg: EncodeLike<K>, [src]
KeyArg: EncodeLike<K>,
fn get<KeyArg>(key: KeyArg) -> <G as StorageMap<K, V>>::Query where
KeyArg: EncodeLike<K>, [src]
KeyArg: EncodeLike<K>,
fn insert<KeyArg, ValArg>(key: KeyArg, val: ValArg) where
KeyArg: EncodeLike<K>,
ValArg: EncodeLike<V>, [src]
KeyArg: EncodeLike<K>,
ValArg: EncodeLike<V>,
fn remove<KeyArg>(key: KeyArg) where
KeyArg: EncodeLike<K>, [src]
KeyArg: EncodeLike<K>,
fn mutate<KeyArg, R, F>(key: KeyArg, f: F) -> R where
F: FnOnce(&mut <G as StorageMap<K, V>>::Query) -> R,
KeyArg: EncodeLike<K>, [src]
F: FnOnce(&mut <G as StorageMap<K, V>>::Query) -> R,
KeyArg: EncodeLike<K>,
fn mutate_exists<KeyArg, R, F>(key: KeyArg, f: F) -> R where
F: FnOnce(&mut Option<V>) -> R,
KeyArg: EncodeLike<K>, [src]
F: FnOnce(&mut Option<V>) -> R,
KeyArg: EncodeLike<K>,
fn try_mutate<KeyArg, R, E, F>(key: KeyArg, f: F) -> Result<R, E> where
F: FnOnce(&mut <G as StorageMap<K, V>>::Query) -> Result<R, E>,
KeyArg: EncodeLike<K>, [src]
F: FnOnce(&mut <G as StorageMap<K, V>>::Query) -> Result<R, E>,
KeyArg: EncodeLike<K>,
fn try_mutate_exists<KeyArg, R, E, F>(key: KeyArg, f: F) -> Result<R, E> where
F: FnOnce(&mut Option<V>) -> Result<R, E>,
KeyArg: EncodeLike<K>, [src]
F: FnOnce(&mut Option<V>) -> Result<R, E>,
KeyArg: EncodeLike<K>,
fn take<KeyArg>(key: KeyArg) -> <G as StorageMap<K, V>>::Query where
KeyArg: EncodeLike<K>, [src]
KeyArg: EncodeLike<K>,
fn append<Item, EncodeLikeItem, EncodeLikeKey>(
key: EncodeLikeKey,
item: EncodeLikeItem
) where
EncodeLikeItem: EncodeLike<Item>,
EncodeLikeKey: EncodeLike<K>,
Item: Encode,
V: StorageAppend<Item>, [src]
key: EncodeLikeKey,
item: EncodeLikeItem
) where
EncodeLikeItem: EncodeLike<Item>,
EncodeLikeKey: EncodeLike<K>,
Item: Encode,
V: StorageAppend<Item>,
fn migrate_key<OldHasher, KeyArg>(key: KeyArg) -> Option<V> where
KeyArg: EncodeLike<K>,
OldHasher: StorageHasher, [src]
KeyArg: EncodeLike<K>,
OldHasher: StorageHasher,
fn decode_len<KeyArg>(key: KeyArg) -> Option<usize> where
KeyArg: EncodeLike<K>,
V: StorageDecodeLength, [src]
KeyArg: EncodeLike<K>,
V: StorageDecodeLength,
fn migrate_key_from_blake<KeyArg>(key: KeyArg) -> Option<V> where
KeyArg: EncodeLike<K>, [src]
KeyArg: EncodeLike<K>,
impl<SS, SP> SupersetOf<SS> for SP where
SS: SubsetOf<SP>,
SS: SubsetOf<SP>,
fn to_subset(&self) -> Option<SS>
fn is_in_subset(&self) -> bool
unsafe fn to_subset_unchecked(&self) -> SS
fn from_subset(element: &SS) -> SP
impl<T, U> TryFrom<U> for T where
U: Into<T>, [src]
U: Into<T>,
type Error = Infallible
The type returned in the event of a conversion error.
fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>[src]
impl<T, U> TryInto<U> for T where
U: TryFrom<T>, [src]
U: TryFrom<T>,
type Error = <U as TryFrom<T>>::Error
The type returned in the event of a conversion error.
fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>[src]
impl<S, T> UncheckedInto<T> for S where
T: UncheckedFrom<S>,
T: UncheckedFrom<S>,
fn unchecked_into(self) -> T
impl<T, S> UniqueSaturatedInto<T> for S where
S: TryInto<T>,
T: Bounded,
S: TryInto<T>,
T: Bounded,
fn unique_saturated_into(self) -> T
impl<V, T> VZip<V> for T where
V: MultiLane<T>,
V: MultiLane<T>,