pub struct StorageNMap<Prefix, Key, Value, QueryKind = OptionQuery, OnEmpty = GetDefault, MaxValues = GetDefault>(_);
Expand description

A type that allow to store values for an arbitrary number of keys in the form of (Key<Hasher1, key1>, Key<Hasher2, key2>, ..., Key<HasherN, keyN>).

Each value is stored at:

Twox128(Prefix::pallet_prefix())
		++ Twox128(Prefix::STORAGE_PREFIX)
		++ Hasher1(encode(key1))
		++ Hasher2(encode(key2))
	++ ...
	++ HasherN(encode(keyN))

Warning

If the keys are not trusted (e.g. can be set by a user), a cryptographic hasher such as blake2_128_concat must be used for the key hashers. Otherwise, other values in storage can be compromised.

Implementations§

source§

impl<Prefix, Key, Value, QueryKind, OnEmpty, MaxValues> StorageNMap<Prefix, Key, Value, QueryKind, OnEmpty, MaxValues>where Prefix: StorageInstance, Key: KeyGenerator, Value: FullCodec, QueryKind: QueryKindTrait<Value, OnEmpty>, OnEmpty: Get<QueryKind::Query> + 'static, MaxValues: Get<Option<u32>>,

source

pub fn hashed_key_for<KArg: EncodeLikeTuple<Key::KArg> + TupleToEncodedIter>( key: KArg ) -> Vec<u8>

Get the storage key used to fetch a value corresponding to a specific key.

source

pub fn contains_key<KArg: EncodeLikeTuple<Key::KArg> + TupleToEncodedIter>( key: KArg ) -> bool

Does the value (explicitly) exist in storage?

source

pub fn get<KArg: EncodeLikeTuple<Key::KArg> + TupleToEncodedIter>( key: KArg ) -> QueryKind::Query

Load the value associated with the given key from the map.

source

pub fn try_get<KArg: EncodeLikeTuple<Key::KArg> + TupleToEncodedIter>( key: KArg ) -> Result<Value, ()>

Try to get the value for the given key from the map.

Returns Ok if it exists, Err if not.

source

pub fn set<KArg: EncodeLikeTuple<Key::KArg> + TupleToEncodedIter>( key: KArg, query: QueryKind::Query )

Store or remove the value to be associated with key so that get returns the query.

source

pub fn take<KArg: EncodeLikeTuple<Key::KArg> + TupleToEncodedIter>( key: KArg ) -> QueryKind::Query

Take a value from storage, removing it afterwards.

source

pub fn swap<KOther, KArg1, KArg2>(key1: KArg1, key2: KArg2)where KOther: KeyGenerator, KArg1: EncodeLikeTuple<Key::KArg> + TupleToEncodedIter, KArg2: EncodeLikeTuple<KOther::KArg> + TupleToEncodedIter,

Swap the values of two key-pairs.

source

pub fn insert<KArg, VArg>(key: KArg, val: VArg)where KArg: EncodeLikeTuple<Key::KArg> + TupleToEncodedIter, VArg: EncodeLike<Value>,

Store a value to be associated with the given keys from the map.

source

pub fn remove<KArg: EncodeLikeTuple<Key::KArg> + TupleToEncodedIter>(key: KArg)

Remove the value under the given keys.

source

pub fn remove_prefix<KP>( partial_key: KP, limit: Option<u32> ) -> KillStorageResultwhere Key: HasKeyPrefix<KP>,

👎Deprecated: Use clear_prefix instead

Remove all values starting with partial_key in the overlay and up to limit in the backend.

All values in the client overlay will be deleted, if there is some limit then up to limit values are deleted from the client backend, if limit is none then all values in the client backend are deleted.

Note

Calling this multiple times per block with a limit set leads always to the same keys being removed and the same result being returned. This happens because the keys to delete in the overlay are not taken into account when deleting keys in the backend.

source

pub fn clear_prefix<KP>( partial_key: KP, limit: u32, maybe_cursor: Option<&[u8]> ) -> MultiRemovalResultswhere Key: HasKeyPrefix<KP>,

Attempt to remove items from the map matching a partial_key prefix.

Returns MultiRemovalResults to inform about the result. Once the resultant maybe_cursor field is None, then no further items remain to be deleted.

NOTE: After the initial call for any given map, it is important that no further items are inserted into the map which match the partial key. If so, then the map may not be empty when the resultant maybe_cursor is None.

Limit

A limit must be provided in order to cap the maximum amount of deletions done in a single call. This is one fewer than the maximum number of backend iterations which may be done by this operation and as such represents the maximum number of backend deletions which may happen. A limit of zero implies that no keys will be deleted, though there may be a single iteration done.

Cursor

A cursor may be passed in to this operation with maybe_cursor. None should only be passed once (in the initial call) for any given storage map and partial_key. Subsequent calls operating on the same map/partial_key should always pass Some, and this should be equal to the previous call result’s maybe_cursor field.

source

pub fn iter_prefix_values<KP>(partial_key: KP) -> PrefixIterator<Value> where Key: HasKeyPrefix<KP>,

Iterate over values that share the first key.

source

pub fn mutate<KArg, R, F>(key: KArg, f: F) -> Rwhere KArg: EncodeLikeTuple<Key::KArg> + TupleToEncodedIter, F: FnOnce(&mut QueryKind::Query) -> R,

Mutate the value under the given keys.

source

pub fn try_mutate<KArg, R, E, F>(key: KArg, f: F) -> Result<R, E>where KArg: EncodeLikeTuple<Key::KArg> + TupleToEncodedIter, F: FnOnce(&mut QueryKind::Query) -> Result<R, E>,

Mutate the value under the given keys when the closure returns Ok.

source

pub fn mutate_exists<KArg, R, F>(key: KArg, f: F) -> Rwhere KArg: EncodeLikeTuple<Key::KArg> + TupleToEncodedIter, F: FnOnce(&mut Option<Value>) -> R,

Mutate the value under the given keys. Deletes the item if mutated to a None.

source

pub fn try_mutate_exists<KArg, R, E, F>(key: KArg, f: F) -> Result<R, E>where KArg: EncodeLikeTuple<Key::KArg> + TupleToEncodedIter, F: FnOnce(&mut Option<Value>) -> Result<R, E>,

Mutate the item, only if an Ok value is returned. Deletes the item if mutated to a None. f will always be called with an option representing if the storage item exists (Some<V>) or if the storage item does not exist (None), independent of the QueryType.

source

pub fn append<Item, EncodeLikeItem, KArg>(key: KArg, item: EncodeLikeItem)where KArg: EncodeLikeTuple<Key::KArg> + TupleToEncodedIter, Item: Encode, EncodeLikeItem: EncodeLike<Item>, Value: StorageAppend<Item>,

Append the given item to the value in the storage.

Value is required to implement StorageAppend.

Warning

If the storage item is not encoded properly, the storage will be overwritten and set to [item]. Any default value set for the storage item will be ignored on overwrite.

source

pub fn decode_len<KArg: EncodeLikeTuple<Key::KArg> + TupleToEncodedIter>( key: KArg ) -> Option<usize>where Value: StorageDecodeLength,

Read the length of the storage value without decoding the entire value under the given key1 and key2.

Value is required to implement StorageDecodeLength.

If the value does not exists or it fails to decode the length, None is returned. Otherwise Some(len) is returned.

Warning

None does not mean that get() does not return a value. The default value is completly ignored by this function.

source

pub fn migrate_keys<KArg>(key: KArg, hash_fns: Key::HArg) -> Option<Value>where KArg: EncodeLikeTuple<Key::KArg> + TupleToEncodedIter,

Migrate an item with the given key from defunct hash_fns to the current hashers.

If the key doesn’t exist, then it’s a no-op. If it does, then it returns its value.

source

pub fn remove_all(limit: Option<u32>) -> KillStorageResult

👎Deprecated: Use clear instead

Remove all values in the overlay and up to limit in the backend.

All values in the client overlay will be deleted, if there is some limit then up to limit values are deleted from the client backend, if limit is none then all values in the client backend are deleted.

Note

Calling this multiple times per block with a limit set leads always to the same keys being removed and the same result being returned. This happens because the keys to delete in the overlay are not taken into account when deleting keys in the backend.

source

pub fn clear(limit: u32, maybe_cursor: Option<&[u8]>) -> MultiRemovalResults

Attempt to remove all items from the map.

Returns MultiRemovalResults to inform about the result. Once the resultant maybe_cursor field is None, then no further items remain to be deleted.

NOTE: After the initial call for any given map, it is important that no further items are inserted into the map. If so, then the map may not be empty when the resultant maybe_cursor is None.

Limit

A limit must always be provided through in order to cap the maximum amount of deletions done in a single call. This is one fewer than the maximum number of backend iterations which may be done by this operation and as such represents the maximum number of backend deletions which may happen. A limit of zero implies that no keys will be deleted, though there may be a single iteration done.

Cursor

A cursor may be passed in to this operation with maybe_cursor. None should only be passed once (in the initial call) for any given storage map. Subsequent calls operating on the same map should always pass Some, and this should be equal to the previous call result’s maybe_cursor field.

source

pub fn iter_values() -> PrefixIterator<Value>

Iter over all value of the storage.

NOTE: If a value failed to decode because storage is corrupted then it is skipped.

source

pub fn translate_values<OldValue: Decode, F: FnMut(OldValue) -> Option<Value>>( f: F )

Translate the values of all elements by a function f, in the map in no particular order. By returning None from f for an element, you’ll remove it from the map.

NOTE: If a value fail to decode because storage is corrupted then it is skipped.

Warning

This function must be used with care, before being updated the storage still contains the old type, thus other calls (such as get) will fail at decoding it.

Usage

This would typically be called inside the module implementation of on_runtime_upgrade.

source§

impl<Prefix, Key, Value, QueryKind, OnEmpty, MaxValues> StorageNMap<Prefix, Key, Value, QueryKind, OnEmpty, MaxValues>where Prefix: StorageInstance, Key: ReversibleKeyGenerator, Value: FullCodec, QueryKind: QueryKindTrait<Value, OnEmpty>, OnEmpty: Get<QueryKind::Query> + 'static, MaxValues: Get<Option<u32>>,

source

pub fn iter_prefix<KP>( kp: KP ) -> PrefixIterator<(<Key as HasKeyPrefix<KP>>::Suffix, Value)> where Key: HasReversibleKeyPrefix<KP>,

Enumerate all elements in the map with prefix key kp in no particular order.

If you add or remove values whose prefix key is kp to the map while doing this, you’ll get undefined results.

source

pub fn iter_prefix_from<KP>( kp: KP, starting_raw_key: Vec<u8> ) -> PrefixIterator<(<Key as HasKeyPrefix<KP>>::Suffix, Value)> where Key: HasReversibleKeyPrefix<KP>,

Enumerate all elements in the map with prefix key kp after a specified starting_raw_key in no particular order.

If you add or remove values whose prefix key is kp to the map while doing this, you’ll get undefined results.

source

pub fn iter_key_prefix<KP>( kp: KP ) -> KeyPrefixIterator<<Key as HasKeyPrefix<KP>>::Suffix> where Key: HasReversibleKeyPrefix<KP>,

Enumerate all suffix keys in the map with prefix key kp in no particular order.

If you add or remove values whose prefix key is kp to the map while doing this, you’ll get undefined results.

source

pub fn iter_key_prefix_from<KP>( kp: KP, starting_raw_key: Vec<u8> ) -> KeyPrefixIterator<<Key as HasKeyPrefix<KP>>::Suffix> where Key: HasReversibleKeyPrefix<KP>,

Enumerate all suffix keys in the map with prefix key kp after a specified starting_raw_key in no particular order.

If you add or remove values whose prefix key is kp to the map while doing this, you’ll get undefined results.

source

pub fn drain_prefix<KP>( kp: KP ) -> PrefixIterator<(<Key as HasKeyPrefix<KP>>::Suffix, Value)> where Key: HasReversibleKeyPrefix<KP>,

Remove all elements from the map with prefix key kp and iterate through them in no particular order.

If you add elements with prefix key k1 to the map while doing this, you’ll get undefined results.

source

pub fn iter() -> PrefixIterator<(Key::Key, Value)>

Enumerate all elements in the map in no particular order.

If you add or remove values to the map while doing this, you’ll get undefined results.

source

pub fn iter_from(starting_raw_key: Vec<u8>) -> PrefixIterator<(Key::Key, Value)>

Enumerate all elements in the map after a specified starting_key in no particular order.

If you add or remove values to the map while doing this, you’ll get undefined results.

source

pub fn iter_keys() -> KeyPrefixIterator<Key::Key>

Enumerate all keys in the map in no particular order.

If you add or remove values to the map while doing this, you’ll get undefined results.

source

pub fn iter_keys_from(starting_raw_key: Vec<u8>) -> KeyPrefixIterator<Key::Key>

Enumerate all keys in the map after a specified starting_raw_key in no particular order.

If you add or remove values to the map while doing this, you’ll get undefined results.

source

pub fn drain() -> PrefixIterator<(Key::Key, Value)>

Remove all elements from the map and iterate through them in no particular order.

If you add elements to the map while doing this, you’ll get undefined results.

source

pub fn translate<O: Decode, F: FnMut(Key::Key, O) -> Option<Value>>(f: F)

Translate the values of all elements by a function f, in the map in no particular order.

By returning None from f for an element, you’ll remove it from the map.

NOTE: If a value fail to decode because storage is corrupted then it is skipped.

Trait Implementations§

source§

impl<Prefix, Key, Value, QueryKind, OnEmpty, MaxValues> PartialStorageInfoTrait for StorageNMap<Prefix, Key, Value, QueryKind, OnEmpty, MaxValues>where Prefix: StorageInstance, Key: KeyGenerator, Value: FullCodec, QueryKind: QueryKindTrait<Value, OnEmpty>, OnEmpty: Get<QueryKind::Query> + 'static, MaxValues: Get<Option<u32>>,

It doesn’t require to implement MaxEncodedLen and give no information for max_size.

source§

impl<Prefix, Key, Value, QueryKind, OnEmpty, MaxValues> StorageEntryMetadataBuilder for StorageNMap<Prefix, Key, Value, QueryKind, OnEmpty, MaxValues>where Prefix: StorageInstance, Key: KeyGenerator, Value: FullCodec + StaticTypeInfo, QueryKind: QueryKindTrait<Value, OnEmpty>, OnEmpty: Get<QueryKind::Query> + 'static, MaxValues: Get<Option<u32>>,

source§

fn build_metadata( docs: Vec<&'static str>, entries: &mut Vec<StorageEntryMetadataIR> )

Build into entries the storage metadata entries of a storage given some docs.
source§

impl<Prefix, Key, Value, QueryKind, OnEmpty, MaxValues> StorageInfoTrait for StorageNMap<Prefix, Key, Value, QueryKind, OnEmpty, MaxValues>where Prefix: StorageInstance, Key: KeyGenerator + KeyGeneratorMaxEncodedLen, Value: FullCodec + MaxEncodedLen, QueryKind: QueryKindTrait<Value, OnEmpty>, OnEmpty: Get<QueryKind::Query> + 'static, MaxValues: Get<Option<u32>>,

source§

impl<Prefix, Key, Value, QueryKind, OnEmpty, MaxValues> StoragePrefixedMap<Value> for StorageNMap<Prefix, Key, Value, QueryKind, OnEmpty, MaxValues>where Prefix: StorageInstance, Key: KeyGenerator, Value: FullCodec, QueryKind: QueryKindTrait<Value, OnEmpty>, OnEmpty: Get<QueryKind::Query> + 'static, MaxValues: Get<Option<u32>>,

source§

fn module_prefix() -> &'static [u8]

Module prefix. Used for generating final key.
source§

fn storage_prefix() -> &'static [u8]

Storage prefix. Used for generating final key.
source§

fn final_prefix() -> [u8; 32]

Final full prefix that prefixes all keys.
source§

fn remove_all(limit: Option<u32>) -> KillStorageResult

👎Deprecated: Use clear instead
Remove all values in the overlay and up to limit in the backend. Read more
source§

fn clear(limit: u32, maybe_cursor: Option<&[u8]>) -> MultiRemovalResults

Attempt to remove all items from the map. Read more
source§

fn iter_values() -> PrefixIterator<Value>

Iter over all value of the storage. Read more
source§

fn translate_values<OldValue: Decode, F: FnMut(OldValue) -> Option<Value>>(f: F)

Translate the values of all elements by a function f, in the map in no particular order. By returning None from f for an element, you’ll remove it from the map. Read more

Auto Trait Implementations§

§

impl<Prefix, Key, Value, QueryKind, OnEmpty, MaxValues> RefUnwindSafe for StorageNMap<Prefix, Key, Value, QueryKind, OnEmpty, MaxValues>where Key: RefUnwindSafe, MaxValues: RefUnwindSafe, OnEmpty: RefUnwindSafe, Prefix: RefUnwindSafe, QueryKind: RefUnwindSafe, Value: RefUnwindSafe,

§

impl<Prefix, Key, Value, QueryKind, OnEmpty, MaxValues> Send for StorageNMap<Prefix, Key, Value, QueryKind, OnEmpty, MaxValues>where Key: Send, MaxValues: Send, OnEmpty: Send, Prefix: Send, QueryKind: Send, Value: Send,

§

impl<Prefix, Key, Value, QueryKind, OnEmpty, MaxValues> Sync for StorageNMap<Prefix, Key, Value, QueryKind, OnEmpty, MaxValues>where Key: Sync, MaxValues: Sync, OnEmpty: Sync, Prefix: Sync, QueryKind: Sync, Value: Sync,

§

impl<Prefix, Key, Value, QueryKind, OnEmpty, MaxValues> Unpin for StorageNMap<Prefix, Key, Value, QueryKind, OnEmpty, MaxValues>where Key: Unpin, MaxValues: Unpin, OnEmpty: Unpin, Prefix: Unpin, QueryKind: Unpin, Value: Unpin,

§

impl<Prefix, Key, Value, QueryKind, OnEmpty, MaxValues> UnwindSafe for StorageNMap<Prefix, Key, Value, QueryKind, OnEmpty, MaxValues>where Key: UnwindSafe, MaxValues: UnwindSafe, OnEmpty: UnwindSafe, Prefix: UnwindSafe, QueryKind: UnwindSafe, Value: 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, 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.

source§

impl<K, V, G> IterableStorageNMap<K, V> for Gwhere K: ReversibleKeyGenerator, V: FullCodec, G: StorageNMap<K, V>,

§

type KeyIterator = KeyPrefixIterator<<K as KeyGenerator>::Key>

The type that iterates over all (key1, key2, key3, ... keyN) tuples.
§

type Iterator = PrefixIterator<(<K as KeyGenerator>::Key, V), ()>

The type that iterates over all (key1, key2, key3, ... keyN), value) tuples.
source§

fn iter_prefix<KP>( kp: KP ) -> PrefixIterator<(<K as HasKeyPrefix<KP>>::Suffix, V), ()> where K: HasReversibleKeyPrefix<KP>,

Enumerate all elements in the map with prefix key kp in lexicographical order of the encoded key. If you add or remove values whose prefix is kp to the map while doing this, you’ll get undefined results.
source§

fn iter_prefix_from<KP>( kp: KP, starting_raw_key: Vec<u8, Global> ) -> PrefixIterator<(<K as HasKeyPrefix<KP>>::Suffix, V), ()> where K: HasReversibleKeyPrefix<KP>,

Enumerate all elements in the map with prefix key kp after a specified starting_raw_key in lexicographical order of the encoded key. If you add or remove values whose prefix is kp to the map while doing this, you’ll get undefined results.
source§

fn iter_key_prefix<KP>( kp: KP ) -> KeyPrefixIterator<<K as HasKeyPrefix<KP>>::Suffix> where K: HasReversibleKeyPrefix<KP>,

Enumerate all suffix keys in the map with prefix key kp in lexicographical order of the encoded key. If you add or remove values whose prefix is kp to the map while doing this, you’ll get undefined results.
source§

fn iter_key_prefix_from<KP>( kp: KP, starting_raw_key: Vec<u8, Global> ) -> KeyPrefixIterator<<K as HasKeyPrefix<KP>>::Suffix> where K: HasReversibleKeyPrefix<KP>,

Enumerate all suffix keys in the map with prefix key kp after a specified starting_raw_key in lexicographical order of the encoded key. If you add or remove values whose prefix is kp to the map while doing this, you’ll get undefined results.
source§

fn drain_prefix<KP>( kp: KP ) -> PrefixIterator<(<K as HasKeyPrefix<KP>>::Suffix, V), ()> where K: HasReversibleKeyPrefix<KP>,

Remove all elements from the map with prefix key kp and iterate through them in lexicographical order of the encoded key. If you add elements with prefix key kp to the map while doing this, you’ll get undefined results.
source§

fn iter() -> <G as IterableStorageNMap<K, V>>::Iterator

Enumerate all elements in the map in lexicographical order of the encoded key. If you add or remove values to the map while doing this, you’ll get undefined results.
source§

fn iter_from( starting_raw_key: Vec<u8, Global> ) -> <G as IterableStorageNMap<K, V>>::Iterator

Enumerate all elements in the map after a specified starting_raw_key in lexicographical order of the encoded key. If you add or remove values to the map while doing this, you’ll get undefined results.
source§

fn iter_keys() -> <G as IterableStorageNMap<K, V>>::KeyIterator

Enumerate all keys in the map in lexicographical order of the encoded key. If you add or remove values to the map while doing this, you’ll get undefined results.
source§

fn iter_keys_from( starting_raw_key: Vec<u8, Global> ) -> <G as IterableStorageNMap<K, V>>::KeyIterator

Enumerate all keys in the map after starting_raw_key in lexicographical order of the encoded key. If you add or remove values to the map while doing this, you’ll get undefined results.
source§

fn drain() -> <G as IterableStorageNMap<K, V>>::Iterator

Remove all elements from the map and iterate through them in lexicographical order of the encoded key. If you add elements to the map while doing this, you’ll get undefined results.
source§

fn translate<O, F>(f: F)where O: Decode, F: FnMut(<K as KeyGenerator>::Key, O) -> Option<V>,

Translate the values of all elements by a function f, in the map in lexicographical order of the encoded key. By returning None from f for an element, you’ll remove it from the map. Read more
§

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
source§

impl<K, V, G> StorageNMap<K, V> for Gwhere K: KeyGenerator, V: FullCodec, G: StorageNMap<K, V>,

§

type Query = <G as StorageNMap<K, V>>::Query

The type that get/take returns.
source§

fn hashed_key_for<KArg>(key: KArg) -> Vec<u8, Global> where KArg: EncodeLikeTuple<<K as KeyGenerator>::KArg> + TupleToEncodedIter,

Get the storage key used to fetch a value corresponding to a specific key.
source§

fn contains_key<KArg>(key: KArg) -> boolwhere KArg: EncodeLikeTuple<<K as KeyGenerator>::KArg> + TupleToEncodedIter,

Does the value (explicitly) exist in storage?
source§

fn get<KArg>(key: KArg) -> <G as StorageNMap<K, V>>::Querywhere KArg: EncodeLikeTuple<<K as KeyGenerator>::KArg> + TupleToEncodedIter,

Load the value associated with the given key from the map.
source§

fn try_get<KArg>(key: KArg) -> Result<V, ()>where KArg: EncodeLikeTuple<<K as KeyGenerator>::KArg> + TupleToEncodedIter,

Try to get the value for the given key from the map. Read more
source§

fn set<KArg>(key: KArg, q: <G as StorageNMap<K, V>>::Query)where KArg: EncodeLikeTuple<<K as KeyGenerator>::KArg> + TupleToEncodedIter,

Store or remove the value to be associated with key so that get returns the query.
source§

fn take<KArg>(key: KArg) -> <G as StorageNMap<K, V>>::Querywhere KArg: EncodeLikeTuple<<K as KeyGenerator>::KArg> + TupleToEncodedIter,

Take the value under a key.
source§

fn swap<KOther, KArg1, KArg2>(key1: KArg1, key2: KArg2)where KOther: KeyGenerator, KArg1: EncodeLikeTuple<<K as KeyGenerator>::KArg> + TupleToEncodedIter, KArg2: EncodeLikeTuple<<KOther as KeyGenerator>::KArg> + TupleToEncodedIter,

Swap the values of two keys.
source§

fn insert<KArg, VArg>(key: KArg, val: VArg)where KArg: EncodeLikeTuple<<K as KeyGenerator>::KArg> + TupleToEncodedIter, VArg: EncodeLike<V>,

Store a value to be associated with the given key from the map.
source§

fn remove<KArg>(key: KArg)where KArg: EncodeLikeTuple<<K as KeyGenerator>::KArg> + TupleToEncodedIter,

Remove the value under a key.
source§

fn remove_prefix<KP>(partial_key: KP, limit: Option<u32>) -> KillStorageResultwhere K: HasKeyPrefix<KP>,

👎Deprecated: Use clear_prefix instead
Remove all values starting with partial_key in the overlay and up to limit in the backend. Read more
source§

fn clear_prefix<KP>( partial_key: KP, limit: u32, maybe_cursor: Option<&[u8]> ) -> MultiRemovalResultswhere K: HasKeyPrefix<KP>,

Attempt to remove items from the map matching a partial_key prefix. Read more
source§

fn contains_prefix<KP>(partial_key: KP) -> boolwhere K: HasKeyPrefix<KP>,

Does any value under a partial_key prefix (explicitly) exist in storage? Might have unexpected behaviour with empty keys, e.g. [].
source§

fn iter_prefix_values<KP>(partial_key: KP) -> PrefixIterator<V, ()> where K: HasKeyPrefix<KP>,

Iterate over values that share the partial prefix key.
source§

fn mutate<KArg, R, F>(key: KArg, f: F) -> Rwhere KArg: EncodeLikeTuple<<K as KeyGenerator>::KArg> + TupleToEncodedIter, F: FnOnce(&mut <G as StorageNMap<K, V>>::Query) -> R,

Mutate the value under a key.
source§

fn try_mutate<KArg, R, E, F>(key: KArg, f: F) -> Result<R, E>where KArg: EncodeLikeTuple<<K as KeyGenerator>::KArg> + TupleToEncodedIter, F: FnOnce(&mut <G as StorageNMap<K, V>>::Query) -> Result<R, E>,

Mutate the item, only if an Ok value is returned.
source§

fn mutate_exists<KArg, R, F>(key: KArg, f: F) -> Rwhere KArg: EncodeLikeTuple<<K as KeyGenerator>::KArg> + TupleToEncodedIter, F: FnOnce(&mut Option<V>) -> R,

Mutate the value under a key. Read more
source§

fn try_mutate_exists<KArg, R, E, F>(key: KArg, f: F) -> Result<R, E>where KArg: EncodeLikeTuple<<K as KeyGenerator>::KArg> + TupleToEncodedIter, F: FnOnce(&mut Option<V>) -> Result<R, E>,

Mutate the item, only if an Ok value is returned. Deletes the item if mutated to a None. f will always be called with an option representing if the storage item exists (Some<V>) or if the storage item does not exist (None), independent of the QueryType.
source§

fn append<Item, EncodeLikeItem, KArg>(key: KArg, item: EncodeLikeItem)where KArg: EncodeLikeTuple<<K as KeyGenerator>::KArg> + TupleToEncodedIter, Item: Encode, EncodeLikeItem: EncodeLike<Item>, V: StorageAppend<Item>,

Append the given items to the value in the storage. Read more
source§

fn migrate_keys<KArg>( key: KArg, hash_fns: <K as KeyGenerator>::HArg ) -> Option<V>where KArg: EncodeLikeTuple<<K as KeyGenerator>::KArg> + TupleToEncodedIter,

Migrate an item with the given key from defunct hash_fns to the current hashers. Read more
source§

fn decode_len<KArg: EncodeLikeTuple<K::KArg> + TupleToEncodedIter>( key: KArg ) -> Option<usize>where V: StorageDecodeLength,

Read the length of the storage value without decoding the entire value under the given key. Read more
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,