Struct frame_support::pallet_prelude::StorageDoubleMap [−][src]
A type that allow to store values for (key1, key2)
couple. Similar to StorageMap
but allow
to iterate and remove value associated to first key.
Each value is stored at:
Twox128(Prefix::pallet_prefix())
++ Twox128(Prefix::STORAGE_PREFIX)
++ Hasher1(encode(key1))
++ Hasher2(encode(key2))
Warning
If the key1s (or key2s) are not trusted (e.g. can be set by a user), a cryptographic hasher
such as blake2_128_concat
must be used for Hasher1 (resp. Hasher2). Otherwise, other values
in storage can be compromised.
Implementations
impl<Prefix, Hasher1, Key1, Hasher2, Key2, Value, QueryKind, OnEmpty> StorageDoubleMap<Prefix, Hasher1, Key1, Hasher2, Key2, Value, QueryKind, OnEmpty> where
Prefix: StorageInstance,
Hasher1: StorageHasher,
Hasher2: StorageHasher,
Key1: FullCodec,
Key2: FullCodec,
Value: FullCodec,
QueryKind: QueryKindTrait<Value, OnEmpty>,
OnEmpty: Get<QueryKind::Query> + 'static,
[src]
Prefix: StorageInstance,
Hasher1: StorageHasher,
Hasher2: StorageHasher,
Key1: FullCodec,
Key2: FullCodec,
Value: FullCodec,
QueryKind: QueryKindTrait<Value, OnEmpty>,
OnEmpty: Get<QueryKind::Query> + 'static,
pub fn hashed_key_for<KArg1, KArg2>(k1: KArg1, k2: KArg2) -> Vec<u8>ⓘ where
KArg1: EncodeLike<Key1>,
KArg2: EncodeLike<Key2>,
[src]
KArg1: EncodeLike<Key1>,
KArg2: EncodeLike<Key2>,
Get the storage key used to fetch a value corresponding to a specific key.
pub fn contains_key<KArg1, KArg2>(k1: KArg1, k2: KArg2) -> bool where
KArg1: EncodeLike<Key1>,
KArg2: EncodeLike<Key2>,
[src]
KArg1: EncodeLike<Key1>,
KArg2: EncodeLike<Key2>,
Does the value (explicitly) exist in storage?
pub fn get<KArg1, KArg2>(k1: KArg1, k2: KArg2) -> QueryKind::Query where
KArg1: EncodeLike<Key1>,
KArg2: EncodeLike<Key2>,
[src]
KArg1: EncodeLike<Key1>,
KArg2: EncodeLike<Key2>,
Load the value associated with the given key from the double map.
pub fn try_get<KArg1, KArg2>(k1: KArg1, k2: KArg2) -> Result<Value, ()> where
KArg1: EncodeLike<Key1>,
KArg2: EncodeLike<Key2>,
[src]
KArg1: EncodeLike<Key1>,
KArg2: EncodeLike<Key2>,
Try to get the value for the given key from the double map.
Returns Ok
if it exists, Err
if not.
pub fn take<KArg1, KArg2>(k1: KArg1, k2: KArg2) -> QueryKind::Query where
KArg1: EncodeLike<Key1>,
KArg2: EncodeLike<Key2>,
[src]
KArg1: EncodeLike<Key1>,
KArg2: EncodeLike<Key2>,
Take a value from storage, removing it afterwards.
pub fn swap<XKArg1, XKArg2, YKArg1, YKArg2>(
x_k1: XKArg1,
x_k2: XKArg2,
y_k1: YKArg1,
y_k2: YKArg2
) where
XKArg1: EncodeLike<Key1>,
XKArg2: EncodeLike<Key2>,
YKArg1: EncodeLike<Key1>,
YKArg2: EncodeLike<Key2>,
[src]
x_k1: XKArg1,
x_k2: XKArg2,
y_k1: YKArg1,
y_k2: YKArg2
) where
XKArg1: EncodeLike<Key1>,
XKArg2: EncodeLike<Key2>,
YKArg1: EncodeLike<Key1>,
YKArg2: EncodeLike<Key2>,
Swap the values of two key-pairs.
pub fn insert<KArg1, KArg2, VArg>(k1: KArg1, k2: KArg2, val: VArg) where
KArg1: EncodeLike<Key1>,
KArg2: EncodeLike<Key2>,
VArg: EncodeLike<Value>,
[src]
KArg1: EncodeLike<Key1>,
KArg2: EncodeLike<Key2>,
VArg: EncodeLike<Value>,
Store a value to be associated with the given keys from the double map.
pub fn remove<KArg1, KArg2>(k1: KArg1, k2: KArg2) where
KArg1: EncodeLike<Key1>,
KArg2: EncodeLike<Key2>,
[src]
KArg1: EncodeLike<Key1>,
KArg2: EncodeLike<Key2>,
Remove the value under the given keys.
pub fn remove_prefix<KArg1: ?Sized>(k1: KArg1) where
KArg1: EncodeLike<Key1>,
[src]
KArg1: EncodeLike<Key1>,
Remove all values under the first key.
pub fn iter_prefix_values<KArg1: ?Sized>(k1: KArg1) -> PrefixIterator<Value>ⓘNotable traits for PrefixIterator<T>
impl<T> Iterator for PrefixIterator<T> type Item = T;
where
KArg1: EncodeLike<Key1>,
[src]
Notable traits for PrefixIterator<T>
impl<T> Iterator for PrefixIterator<T> type Item = T;
KArg1: EncodeLike<Key1>,
Iterate over values that share the first key.
pub fn mutate<KArg1, KArg2, R, F>(k1: KArg1, k2: KArg2, f: F) -> R where
KArg1: EncodeLike<Key1>,
KArg2: EncodeLike<Key2>,
F: FnOnce(&mut QueryKind::Query) -> R,
[src]
KArg1: EncodeLike<Key1>,
KArg2: EncodeLike<Key2>,
F: FnOnce(&mut QueryKind::Query) -> R,
Mutate the value under the given keys.
pub fn try_mutate<KArg1, KArg2, R, E, F>(
k1: KArg1,
k2: KArg2,
f: F
) -> Result<R, E> where
KArg1: EncodeLike<Key1>,
KArg2: EncodeLike<Key2>,
F: FnOnce(&mut QueryKind::Query) -> Result<R, E>,
[src]
k1: KArg1,
k2: KArg2,
f: F
) -> Result<R, E> where
KArg1: EncodeLike<Key1>,
KArg2: EncodeLike<Key2>,
F: FnOnce(&mut QueryKind::Query) -> Result<R, E>,
Mutate the value under the given keys when the closure returns Ok
.
pub fn mutate_exists<KArg1, KArg2, R, F>(k1: KArg1, k2: KArg2, f: F) -> R where
KArg1: EncodeLike<Key1>,
KArg2: EncodeLike<Key2>,
F: FnOnce(&mut Option<Value>) -> R,
[src]
KArg1: EncodeLike<Key1>,
KArg2: EncodeLike<Key2>,
F: FnOnce(&mut Option<Value>) -> R,
Mutate the value under the given keys. Deletes the item if mutated to a None
.
pub fn try_mutate_exists<KArg1, KArg2, R, E, F>(
k1: KArg1,
k2: KArg2,
f: F
) -> Result<R, E> where
KArg1: EncodeLike<Key1>,
KArg2: EncodeLike<Key2>,
F: FnOnce(&mut Option<Value>) -> Result<R, E>,
[src]
k1: KArg1,
k2: KArg2,
f: F
) -> Result<R, E> where
KArg1: EncodeLike<Key1>,
KArg2: EncodeLike<Key2>,
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
.
pub fn append<Item, EncodeLikeItem, KArg1, KArg2>(
k1: KArg1,
k2: KArg2,
item: EncodeLikeItem
) where
KArg1: EncodeLike<Key1>,
KArg2: EncodeLike<Key2>,
Item: Encode,
EncodeLikeItem: EncodeLike<Item>,
Value: StorageAppend<Item>,
[src]
k1: KArg1,
k2: KArg2,
item: EncodeLikeItem
) where
KArg1: EncodeLike<Key1>,
KArg2: EncodeLike<Key2>,
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.
pub fn decode_len<KArg1, KArg2>(key1: KArg1, key2: KArg2) -> Option<usize> where
KArg1: EncodeLike<Key1>,
KArg2: EncodeLike<Key2>,
Value: StorageDecodeLength,
[src]
KArg1: EncodeLike<Key1>,
KArg2: EncodeLike<Key2>,
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.
pub fn migrate_keys<OldHasher1: StorageHasher, OldHasher2: StorageHasher, KeyArg1: EncodeLike<Key1>, KeyArg2: EncodeLike<Key2>>(
key1: KeyArg1,
key2: KeyArg2
) -> Option<Value>
[src]
key1: KeyArg1,
key2: KeyArg2
) -> Option<Value>
Migrate an item with the given key1
and key2
from defunct OldHasher1
and
OldHasher2
to the current hashers.
If the key doesn’t exist, then it’s a no-op. If it does, then it returns its value.
pub fn remove_all()
[src]
Remove all value of the storage.
pub fn iter_values() -> PrefixIterator<Value>ⓘNotable traits for PrefixIterator<T>
impl<T> Iterator for PrefixIterator<T> type Item = T;
[src]
Notable traits for PrefixIterator<T>
impl<T> Iterator for PrefixIterator<T> type Item = T;
Iter over all value of the storage.
NOTE: If a value failed to decode becaues storage is corrupted then it is skipped.
pub fn translate_values<OldValue: Decode, F: FnMut(OldValue) -> Option<Value>>(
f: F
)
[src]
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.
impl<Prefix, Hasher1, Key1, Hasher2, Key2, Value, QueryKind, OnEmpty> StorageDoubleMap<Prefix, Hasher1, Key1, Hasher2, Key2, Value, QueryKind, OnEmpty> where
Prefix: StorageInstance,
Hasher1: StorageHasher + ReversibleStorageHasher,
Hasher2: StorageHasher + ReversibleStorageHasher,
Key1: FullCodec,
Key2: FullCodec,
Value: FullCodec,
QueryKind: QueryKindTrait<Value, OnEmpty>,
OnEmpty: Get<QueryKind::Query> + 'static,
[src]
Prefix: StorageInstance,
Hasher1: StorageHasher + ReversibleStorageHasher,
Hasher2: StorageHasher + ReversibleStorageHasher,
Key1: FullCodec,
Key2: FullCodec,
Value: FullCodec,
QueryKind: QueryKindTrait<Value, OnEmpty>,
OnEmpty: Get<QueryKind::Query> + 'static,
pub fn iter_prefix(k1: impl EncodeLike<Key1>) -> PrefixIterator<(Key2, Value)>ⓘNotable traits for PrefixIterator<T>
impl<T> Iterator for PrefixIterator<T> type Item = T;
[src]
Notable traits for PrefixIterator<T>
impl<T> Iterator for PrefixIterator<T> type Item = T;
Enumerate all elements in the map with first key k1
in no particular order.
If you add or remove values whose first key is k1
to the map while doing this, you’ll get
undefined results.
pub fn drain_prefix(k1: impl EncodeLike<Key1>) -> PrefixIterator<(Key2, Value)>ⓘNotable traits for PrefixIterator<T>
impl<T> Iterator for PrefixIterator<T> type Item = T;
[src]
Notable traits for PrefixIterator<T>
impl<T> Iterator for PrefixIterator<T> type Item = T;
Remove all elements from the map with first key k1
and iterate through them in no
particular order.
If you add elements with first key k1
to the map while doing this, you’ll get undefined
results.
pub fn iter() -> PrefixIterator<(Key1, Key2, Value)>ⓘNotable traits for PrefixIterator<T>
impl<T> Iterator for PrefixIterator<T> type Item = T;
[src]
Notable traits for PrefixIterator<T>
impl<T> Iterator for PrefixIterator<T> type Item = T;
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.
pub fn drain() -> PrefixIterator<(Key1, Key2, Value)>ⓘNotable traits for PrefixIterator<T>
impl<T> Iterator for PrefixIterator<T> type Item = T;
[src]
Notable traits for PrefixIterator<T>
impl<T> Iterator for PrefixIterator<T> type Item = T;
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.
pub fn translate<O: Decode, F: FnMut(Key1, Key2, O) -> Option<Value>>(f: F)
[src]
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
impl<Prefix, Hasher1, Hasher2, Key1, Key2, Value, QueryKind, OnEmpty> StorageDoubleMapMetadata for StorageDoubleMap<Prefix, Hasher1, Key1, Hasher2, Key2, Value, QueryKind, OnEmpty> where
Prefix: StorageInstance,
Hasher1: StorageHasher,
Hasher2: StorageHasher,
Key1: FullCodec,
Key2: FullCodec,
Value: FullCodec,
QueryKind: QueryKindTrait<Value, OnEmpty>,
OnEmpty: Get<QueryKind::Query> + 'static,
[src]
Prefix: StorageInstance,
Hasher1: StorageHasher,
Hasher2: StorageHasher,
Key1: FullCodec,
Key2: FullCodec,
Value: FullCodec,
QueryKind: QueryKindTrait<Value, OnEmpty>,
OnEmpty: Get<QueryKind::Query> + 'static,
const MODIFIER: StorageEntryModifier
[src]
const HASHER1: StorageHasher
[src]
const HASHER2: StorageHasher
[src]
const NAME: &'static str
[src]
const DEFAULT: DefaultByteGetter
[src]
impl<Prefix, Hasher1, Key1, Hasher2, Key2, Value, QueryKind, OnEmpty> StoragePrefixedMap<Value> for StorageDoubleMap<Prefix, Hasher1, Key1, Hasher2, Key2, Value, QueryKind, OnEmpty> where
Prefix: StorageInstance,
Hasher1: StorageHasher,
Hasher2: StorageHasher,
Key1: FullCodec,
Key2: FullCodec,
Value: FullCodec,
QueryKind: QueryKindTrait<Value, OnEmpty>,
OnEmpty: Get<QueryKind::Query> + 'static,
[src]
Prefix: StorageInstance,
Hasher1: StorageHasher,
Hasher2: StorageHasher,
Key1: FullCodec,
Key2: FullCodec,
Value: FullCodec,
QueryKind: QueryKindTrait<Value, OnEmpty>,
OnEmpty: Get<QueryKind::Query> + 'static,
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>ⓘNotable traits for PrefixIterator<T>
impl<T> Iterator for PrefixIterator<T> type Item = T;
[src]
Notable traits for PrefixIterator<T>
impl<T> Iterator for PrefixIterator<T> type Item = T;
fn translate_values<OldValue: Decode, F: FnMut(OldValue) -> Option<Value>>(f: F)
[src]
Auto Trait Implementations
impl<Prefix, Hasher1, Key1, Hasher2, Key2, Value, QueryKind, OnEmpty> RefUnwindSafe for StorageDoubleMap<Prefix, Hasher1, Key1, Hasher2, Key2, Value, QueryKind, OnEmpty> where
Hasher1: RefUnwindSafe,
Hasher2: RefUnwindSafe,
Key1: RefUnwindSafe,
Key2: RefUnwindSafe,
OnEmpty: RefUnwindSafe,
Prefix: RefUnwindSafe,
QueryKind: RefUnwindSafe,
Value: RefUnwindSafe,
Hasher1: RefUnwindSafe,
Hasher2: RefUnwindSafe,
Key1: RefUnwindSafe,
Key2: RefUnwindSafe,
OnEmpty: RefUnwindSafe,
Prefix: RefUnwindSafe,
QueryKind: RefUnwindSafe,
Value: RefUnwindSafe,
impl<Prefix, Hasher1, Key1, Hasher2, Key2, Value, QueryKind, OnEmpty> Send for StorageDoubleMap<Prefix, Hasher1, Key1, Hasher2, Key2, Value, QueryKind, OnEmpty> where
Hasher1: Send,
Hasher2: Send,
Key1: Send,
Key2: Send,
OnEmpty: Send,
Prefix: Send,
QueryKind: Send,
Value: Send,
Hasher1: Send,
Hasher2: Send,
Key1: Send,
Key2: Send,
OnEmpty: Send,
Prefix: Send,
QueryKind: Send,
Value: Send,
impl<Prefix, Hasher1, Key1, Hasher2, Key2, Value, QueryKind, OnEmpty> Sync for StorageDoubleMap<Prefix, Hasher1, Key1, Hasher2, Key2, Value, QueryKind, OnEmpty> where
Hasher1: Sync,
Hasher2: Sync,
Key1: Sync,
Key2: Sync,
OnEmpty: Sync,
Prefix: Sync,
QueryKind: Sync,
Value: Sync,
Hasher1: Sync,
Hasher2: Sync,
Key1: Sync,
Key2: Sync,
OnEmpty: Sync,
Prefix: Sync,
QueryKind: Sync,
Value: Sync,
impl<Prefix, Hasher1, Key1, Hasher2, Key2, Value, QueryKind, OnEmpty> Unpin for StorageDoubleMap<Prefix, Hasher1, Key1, Hasher2, Key2, Value, QueryKind, OnEmpty> where
Hasher1: Unpin,
Hasher2: Unpin,
Key1: Unpin,
Key2: Unpin,
OnEmpty: Unpin,
Prefix: Unpin,
QueryKind: Unpin,
Value: Unpin,
Hasher1: Unpin,
Hasher2: Unpin,
Key1: Unpin,
Key2: Unpin,
OnEmpty: Unpin,
Prefix: Unpin,
QueryKind: Unpin,
Value: Unpin,
impl<Prefix, Hasher1, Key1, Hasher2, Key2, Value, QueryKind, OnEmpty> UnwindSafe for StorageDoubleMap<Prefix, Hasher1, Key1, Hasher2, Key2, Value, QueryKind, OnEmpty> where
Hasher1: UnwindSafe,
Hasher2: UnwindSafe,
Key1: UnwindSafe,
Key2: UnwindSafe,
OnEmpty: UnwindSafe,
Prefix: UnwindSafe,
QueryKind: UnwindSafe,
Value: UnwindSafe,
Hasher1: UnwindSafe,
Hasher2: UnwindSafe,
Key1: UnwindSafe,
Key2: UnwindSafe,
OnEmpty: UnwindSafe,
Prefix: UnwindSafe,
QueryKind: UnwindSafe,
Value: 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,
pub fn borrow_mut(&mut self) -> &mut T
[src]
impl<T> CheckedConversion for T
[src]
pub fn checked_from<T>(t: T) -> Option<Self> where
Self: TryFrom<T>,
[src]
Self: TryFrom<T>,
pub fn checked_into<T>(self) -> Option<T> where
Self: TryInto<T>,
[src]
Self: TryInto<T>,
impl<T> From<T> for T
[src]
impl<T> Instrument for T
[src]
pub fn instrument(self, span: Span) -> Instrumented<Self>
[src]
pub fn in_current_span(self) -> Instrumented<Self>
[src]
impl<T, U> Into<U> for T where
U: From<T>,
[src]
U: From<T>,
impl<T> IsType<T> for T
[src]
pub fn from_ref(&T) -> &T
[src]
pub fn into_ref(&Self) -> &T
[src]
pub fn from_mut(&mut T) -> &mut T
[src]
pub fn into_mut(&mut Self) -> &mut T
[src]
impl<T, Outer> IsWrappedBy<Outer> for T where
T: From<Outer>,
Outer: AsRef<T> + AsMut<T> + From<T>,
[src]
T: From<Outer>,
Outer: AsRef<T> + AsMut<T> + From<T>,
pub fn from_ref(outer: &Outer) -> &T
[src]
Get a reference to the inner from the outer.
pub fn from_mut(outer: &mut Outer) -> &mut T
[src]
Get a mutable reference to the inner from the outer.
impl<T> MaybeRefUnwindSafe for T where
T: RefUnwindSafe,
[src]
T: RefUnwindSafe,
impl<T> Same<T> for T
[src]
type Output = T
Should always be Self
impl<T> SaturatedConversion for T
[src]
pub fn saturated_from<T>(t: T) -> Self where
Self: UniqueSaturatedFrom<T>,
[src]
Self: UniqueSaturatedFrom<T>,
pub fn saturated_into<T>(self) -> T where
Self: UniqueSaturatedInto<T>,
[src]
Self: UniqueSaturatedInto<T>,
impl<K1, K2, V, G> StorageDoubleMap<K1, K2, V> for G where
V: FullCodec,
K1: FullEncode,
K2: FullEncode,
G: StorageDoubleMap<K1, K2, V>,
[src]
V: FullCodec,
K1: FullEncode,
K2: FullEncode,
G: StorageDoubleMap<K1, K2, V>,
type Query = <G as StorageDoubleMap<K1, K2, V>>::Query
The type that get/take returns.
pub fn hashed_key_for<KArg1, KArg2>(KArg1, KArg2) -> Vec<u8, Global>ⓘ where
KArg1: EncodeLike<K1>,
KArg2: EncodeLike<K2>,
[src]
KArg1: EncodeLike<K1>,
KArg2: EncodeLike<K2>,
pub fn contains_key<KArg1, KArg2>(KArg1, KArg2) -> bool where
KArg1: EncodeLike<K1>,
KArg2: EncodeLike<K2>,
[src]
KArg1: EncodeLike<K1>,
KArg2: EncodeLike<K2>,
pub fn get<KArg1, KArg2>(
KArg1,
KArg2
) -> <G as StorageDoubleMap<K1, K2, V>>::Query where
KArg1: EncodeLike<K1>,
KArg2: EncodeLike<K2>,
[src]
KArg1,
KArg2
) -> <G as StorageDoubleMap<K1, K2, V>>::Query where
KArg1: EncodeLike<K1>,
KArg2: EncodeLike<K2>,
pub fn try_get<KArg1, KArg2>(KArg1, KArg2) -> Result<V, ()> where
KArg1: EncodeLike<K1>,
KArg2: EncodeLike<K2>,
[src]
KArg1: EncodeLike<K1>,
KArg2: EncodeLike<K2>,
pub fn take<KArg1, KArg2>(
KArg1,
KArg2
) -> <G as StorageDoubleMap<K1, K2, V>>::Query where
KArg1: EncodeLike<K1>,
KArg2: EncodeLike<K2>,
[src]
KArg1,
KArg2
) -> <G as StorageDoubleMap<K1, K2, V>>::Query where
KArg1: EncodeLike<K1>,
KArg2: EncodeLike<K2>,
pub fn swap<XKArg1, XKArg2, YKArg1, YKArg2>(XKArg1, XKArg2, YKArg1, YKArg2) where
XKArg1: EncodeLike<K1>,
XKArg2: EncodeLike<K2>,
YKArg1: EncodeLike<K1>,
YKArg2: EncodeLike<K2>,
[src]
XKArg1: EncodeLike<K1>,
XKArg2: EncodeLike<K2>,
YKArg1: EncodeLike<K1>,
YKArg2: EncodeLike<K2>,
pub fn insert<KArg1, KArg2, VArg>(KArg1, KArg2, VArg) where
KArg1: EncodeLike<K1>,
KArg2: EncodeLike<K2>,
VArg: EncodeLike<V>,
[src]
KArg1: EncodeLike<K1>,
KArg2: EncodeLike<K2>,
VArg: EncodeLike<V>,
pub fn remove<KArg1, KArg2>(KArg1, KArg2) where
KArg1: EncodeLike<K1>,
KArg2: EncodeLike<K2>,
[src]
KArg1: EncodeLike<K1>,
KArg2: EncodeLike<K2>,
pub fn remove_prefix<KArg1>(KArg1) where
KArg1: EncodeLike<K1>,
[src]
KArg1: EncodeLike<K1>,
pub fn iter_prefix_values<KArg1>(KArg1) -> PrefixIterator<V>ⓘNotable traits for PrefixIterator<T>
impl<T> Iterator for PrefixIterator<T> type Item = T;
where
KArg1: EncodeLike<K1> + ?Sized,
[src]
Notable traits for PrefixIterator<T>
impl<T> Iterator for PrefixIterator<T> type Item = T;
KArg1: EncodeLike<K1> + ?Sized,
pub fn mutate<KArg1, KArg2, R, F>(KArg1, KArg2, F) -> R where
F: FnOnce(&mut <G as StorageDoubleMap<K1, K2, V>>::Query) -> R,
KArg1: EncodeLike<K1>,
KArg2: EncodeLike<K2>,
[src]
F: FnOnce(&mut <G as StorageDoubleMap<K1, K2, V>>::Query) -> R,
KArg1: EncodeLike<K1>,
KArg2: EncodeLike<K2>,
pub fn mutate_exists<KArg1, KArg2, R, F>(KArg1, KArg2, F) -> R where
F: FnOnce(&mut Option<V>) -> R,
KArg1: EncodeLike<K1>,
KArg2: EncodeLike<K2>,
[src]
F: FnOnce(&mut Option<V>) -> R,
KArg1: EncodeLike<K1>,
KArg2: EncodeLike<K2>,
pub fn try_mutate<KArg1, KArg2, R, E, F>(KArg1, KArg2, F) -> Result<R, E> where
F: FnOnce(&mut <G as StorageDoubleMap<K1, K2, V>>::Query) -> Result<R, E>,
KArg1: EncodeLike<K1>,
KArg2: EncodeLike<K2>,
[src]
F: FnOnce(&mut <G as StorageDoubleMap<K1, K2, V>>::Query) -> Result<R, E>,
KArg1: EncodeLike<K1>,
KArg2: EncodeLike<K2>,
pub fn try_mutate_exists<KArg1, KArg2, R, E, F>(KArg1, KArg2, F) -> Result<R, E> where
F: FnOnce(&mut Option<V>) -> Result<R, E>,
KArg1: EncodeLike<K1>,
KArg2: EncodeLike<K2>,
[src]
F: FnOnce(&mut Option<V>) -> Result<R, E>,
KArg1: EncodeLike<K1>,
KArg2: EncodeLike<K2>,
pub fn append<Item, EncodeLikeItem, KArg1, KArg2>(KArg1, KArg2, EncodeLikeItem) where
Item: Encode,
EncodeLikeItem: EncodeLike<Item>,
V: StorageAppend<Item>,
KArg1: EncodeLike<K1>,
KArg2: EncodeLike<K2>,
[src]
Item: Encode,
EncodeLikeItem: EncodeLike<Item>,
V: StorageAppend<Item>,
KArg1: EncodeLike<K1>,
KArg2: EncodeLike<K2>,
pub fn migrate_keys<OldHasher1, OldHasher2, KeyArg1, KeyArg2>(
KeyArg1,
KeyArg2
) -> Option<V> where
KeyArg1: EncodeLike<K1>,
KeyArg2: EncodeLike<K2>,
OldHasher1: StorageHasher,
OldHasher2: StorageHasher,
[src]
KeyArg1,
KeyArg2
) -> Option<V> where
KeyArg1: EncodeLike<K1>,
KeyArg2: EncodeLike<K2>,
OldHasher1: StorageHasher,
OldHasher2: StorageHasher,
fn decode_len<KArg1, KArg2>(key1: KArg1, key2: KArg2) -> Option<usize> where
KArg1: EncodeLike<K1>,
KArg2: EncodeLike<K2>,
V: StorageDecodeLength,
[src]
KArg1: EncodeLike<K1>,
KArg2: EncodeLike<K2>,
V: StorageDecodeLength,
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.
pub 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.
pub fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>
[src]
impl<S, T> UncheckedInto<T> for S where
T: UncheckedFrom<S>,
[src]
T: UncheckedFrom<S>,
pub fn unchecked_into(self) -> T
[src]
impl<T, S> UniqueSaturatedInto<T> for S where
T: Bounded,
S: TryInto<T>,
[src]
T: Bounded,
S: TryInto<T>,
pub fn unique_saturated_into(self) -> T
[src]
impl<V, T> VZip<V> for T where
V: MultiLane<T>,
[src]
V: MultiLane<T>,