1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160
// This file is part of Gear.
// Copyright (C) 2022-2024 Gear Technologies Inc.
// SPDX-License-Identifier: GPL-3.0-or-later WITH Classpath-exception-2.0
// This program is free software: you can redistribute it and/or modify
// it under the terms of the GNU General Public License as published by
// the Free Software Foundation, either version 3 of the License, or
// (at your option) any later version.
// This program is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
// GNU General Public License for more details.
// You should have received a copy of the GNU General Public License
// along with this program. If not, see <https://www.gnu.org/licenses/>.
//! Module for map storing primitive.
//!
//! This primitive defines interface of interaction
//! with globally stored single-key map (Key -> Value).
use sp_runtime::codec::{Encode, EncodeAppend, EncodeLike};
/// Represents logic of managing globally stored
/// single-key map for more complicated logic.
///
/// In fact, represents custom implementation/wrapper
/// around of Substrate's `StorageMap` with `OptionQuery`.
pub trait MapStorage {
/// Map's key type.
type Key;
/// Map's stored value type.
type Value;
/// Returns bool, defining does map contain value under given key.
fn contains_key(key: &Self::Key) -> bool;
/// Gets value stored under given key, if present.
fn get(key: &Self::Key) -> Option<Self::Value>;
/// Inserts value with given key.
fn insert(key: Self::Key, value: Self::Value);
/// Mutates value by `Option` reference, which stored (or not
/// in `None` case) under given key with given function.
///
/// May return generic type value.
fn mutate<R, F: FnOnce(&mut Option<Self::Value>) -> R>(key: Self::Key, f: F) -> R;
/// Works the same as `Self::mutate`, but triggers if value present.
fn mutate_exists<R, F: FnOnce(&mut Self::Value) -> R>(key: Self::Key, f: F) -> Option<R> {
Self::mutate(key, |opt_val| opt_val.as_mut().map(f))
}
/// Mutates all stored values with given convert function.
fn mutate_values<F: FnMut(Self::Value) -> Self::Value>(f: F);
/// Removes value stored under the given key.
fn remove(key: Self::Key);
/// Removes all values.
fn clear();
/// Gets value stored under given key, if present,
/// and removes it from storage.
fn take(key: Self::Key) -> Option<Self::Value>;
}
pub trait AppendMapStorage<Item, Key, Value>: MapStorage<Key = Key, Value = Value>
where
Item: Encode,
Key: Encode,
Value: EncodeAppend<Item = Item>,
{
fn append<EncodeLikeKey, EncodeLikeItem>(key: EncodeLikeKey, item: EncodeLikeItem)
where
EncodeLikeKey: EncodeLike<Key>,
EncodeLikeItem: EncodeLike<Item>;
}
/// Creates new type with specified name and key-value types and implements
/// `MapStorage` for it based on specified storage,
/// which is a `Substrate`'s `StorageMap`.
///
/// This macro main purpose is to follow newtype pattern
/// and avoid `Substrate` dependencies in `gear_common`.
///
/// Requires `PhantomData` be in scope: from `std`, `core` or `sp_std`.
///
/// Requires `Config` be in scope of the crate root where it called.
///
/// Has two implementations to provide auto addition of `Counted` logic
/// (for `Substrate`'s `CountedStorageMap`) due to storage's
/// arguments difference.
#[allow(clippy::crate_in_macro_def)]
#[macro_export]
macro_rules! wrap_storage_map {
(storage: $storage: ident, name: $name: ident, key: $key: ty, value: $val: ty) => {
pub struct $name<T>(PhantomData<T>);
impl<T: crate::Config> MapStorage for $name<T> {
type Key = $key;
type Value = $val;
fn contains_key(key: &Self::Key) -> bool {
$storage::<T>::contains_key(key)
}
fn get(key: &Self::Key) -> Option<Self::Value> {
$storage::<T>::get(key)
}
fn insert(key: Self::Key, value: Self::Value) {
$storage::<T>::insert(key, value)
}
fn mutate<R, F: FnOnce(&mut Option<Self::Value>) -> R>(key: Self::Key, f: F) -> R {
$storage::<T>::mutate(key, f)
}
fn mutate_values<F: FnMut(Self::Value) -> Self::Value>(mut f: F) {
let f = |v| Some(f(v));
$storage::<T>::translate_values(f)
}
fn remove(key: Self::Key) {
$storage::<T>::remove(key)
}
fn clear() {
let _ = $storage::<T>::clear(u32::MAX, None);
}
fn take(key: Self::Key) -> Option<Self::Value> {
$storage::<T>::take(key)
}
}
};
}
/// Same as `wrap_storage_map!`, but with length type parameter
/// to auto-impl `Counted` trait of `gear_common` storage primitives.
///
/// Better to use Rust's numeric types as `Length`.
#[allow(clippy::crate_in_macro_def)]
#[macro_export]
macro_rules! wrap_counted_storage_map {
(storage: $storage: ident, name: $name: ident, key: $key: ty, value: $val: ty, length: $len: ty) => {
$crate::wrap_storage_map!(storage: $storage, name: $name, key: $key, value: $val);
impl<T: crate::Config> Counted for $name<T> {
type Length = $len;
fn len() -> Self::Length {
$storage::<T>::count() as Self::Length
}
}
};
}