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
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
//! Helpers for dealing with CosmWasm storage.

pub use crate::prelude::*;
use cosmwasm_std::{from_json, Binary, Empty, QuerierWrapper};
use cw_storage_plus::{KeyDeserialize, Prefixer, PrimaryKey};

/// A multilevel [Map] where the suffix of the key monotonically increases.
///
/// This represents a common pattern where we want to store a data series by
/// some key, such as a series of position events per position. The [u64] is
/// guaranteed to monotonically increase over time per `K` value.
pub type MonotonicMultilevelMap<'a, K, T> = Map<(K, u64), T>;

/// Push a new value to a [MonotonicMultilevelMap].
pub fn push_to_monotonic_multilevel_map<'a, K, T>(
    store: &mut dyn Storage,
    m: MonotonicMultilevelMap<'a, K, T>,
    k: K,
    t: &T,
) -> Result<u64>
where
    K: PrimaryKey<'a> + Prefixer<'a> + KeyDeserialize,
    T: serde::Serialize + serde::de::DeserializeOwned,
{
    let next_id = m
        .prefix(k.clone())
        .keys(store, None, None, cosmwasm_std::Order::Descending)
        .next()
        .transpose()?
        .map_or(0, |x| x + 1);
    m.save(store, (k, next_id), t)?;
    Ok(next_id)
}

/// Helper to paginate over [MonotonicMultilevelMap]
pub fn collect_monotonic_multilevel_map<'a, K, T>(
    store: &dyn Storage,
    m: MonotonicMultilevelMap<'a, K, T>,
    k: K,
    after_id: Option<u64>,
    limit: Option<u32>,
    order: Order,
) -> Result<Vec<(u64, T)>>
where
    K: PrimaryKey<'a> + Prefixer<'a> + KeyDeserialize,
    T: serde::Serialize + serde::de::DeserializeOwned,
{
    let iter = m
        .prefix(k)
        .range(store, after_id.map(Bound::exclusive), None, order)
        .map(|res| res.map_err(|err| err.into()));

    match limit {
        Some(limit) => iter.take(limit.try_into()?).collect(),
        None => iter.collect(),
    }
}

/// A [Map] where the key monotonically increases.
///
/// This represents a common pattern where we want to store data with unique keys
/// The [u64] key is guaranteed to monotonically increase over time per pushed value.
pub type MonotonicMap<'a, T> = Map<u64, T>;

/// Push a new value to a [MonotonicMap].
pub fn push_to_monotonic_map<T>(store: &mut dyn Storage, m: MonotonicMap<T>, t: &T) -> Result<u64>
where
    T: serde::Serialize + serde::de::DeserializeOwned,
{
    let next_id = m
        .keys(store, None, None, cosmwasm_std::Order::Descending)
        .next()
        .transpose()?
        .map_or(0, |x| x + 1);
    m.save(store, next_id, t)?;
    Ok(next_id)
}

/// Helper to paginate over [MonotonicMap]
pub fn collect_monotonic_map<T>(
    store: &dyn Storage,
    m: MonotonicMap<T>,
    after_id: Option<u64>,
    limit: Option<u32>,
    order: Order,
) -> Result<Vec<(u64, T)>>
where
    T: serde::Serialize + serde::de::DeserializeOwned,
{
    let iter = m
        .range(store, after_id.map(Bound::exclusive), None, order)
        .map(|res| res.map_err(|err| err.into()));

    match limit {
        Some(limit) => iter.take(limit.try_into()?).collect(),
        None => iter.collect(),
    }
}

/// Load an [cw_storage_plus::Item] stored in an external contract
pub fn load_external_item<T: serde::de::DeserializeOwned>(
    querier: &QuerierWrapper<Empty>,
    contract_addr: impl Into<String>,
    key: impl Into<Binary>,
) -> anyhow::Result<T> {
    // only deserialize for extra context if in debug mode
    // because we must pass the key in as an owned value
    // and so we have to extract the name in the happy path too
    let key: Binary = key.into();
    let debug_key_name = if cfg!(debug_assertions) {
        from_json::<String>(&key).ok()
    } else {
        None
    };

    external_helper(querier, contract_addr, key, || {
        perp_anyhow!(
            ErrorId::Any,
            ErrorDomain::Default,
            "unable to load external item {}",
            debug_key_name.unwrap_or_default()
        )
    })
}

/// Load a value from a [cw_storage_plus::Map] stored in an external contract
pub fn load_external_map<'a, T: serde::de::DeserializeOwned>(
    querier: &QuerierWrapper<Empty>,
    contract_addr: impl Into<String>,
    namespace: &str,
    key: &impl PrimaryKey<'a>,
) -> anyhow::Result<T> {
    external_helper(querier, contract_addr, map_key(namespace, key), || {
        perp_anyhow!(
            ErrorId::Any,
            ErrorDomain::Default,
            "unable to load external map {}",
            namespace
        )
    })
}

/// Check if a [cw_storage_plus::Map] in an external contract has a specific key
pub fn external_map_has<'a>(
    querier: &QuerierWrapper<Empty>,
    contract_addr: impl Into<String>,
    namespace: &str,
    key: &impl PrimaryKey<'a>,
) -> anyhow::Result<bool> {
    querier
        .query_wasm_raw(contract_addr, map_key(namespace, key))
        .map(|x| x.is_some())
        .map_err(|e| e.into())
}

fn external_helper<T: serde::de::DeserializeOwned>(
    querier: &QuerierWrapper<Empty>,
    contract_addr: impl Into<String>,
    key: impl Into<Binary>,
    mk_error_message: impl FnOnce() -> anyhow::Error,
) -> anyhow::Result<T> {
    let res = querier
        .query_wasm_raw(contract_addr, key)?
        .ok_or_else(mk_error_message)?;
    serde_json_wasm::from_slice(&res).map_err(|err| err.into())
}
/// Generate a storage key for a value in a [cw_storage_plus::Map].
pub fn map_key<'a, K: PrimaryKey<'a>>(namespace: &str, key: &K) -> Vec<u8> {
    // Taken from https://github.com/CosmWasm/cw-storage-plus/blob/69300779519d8ba956fb53725e44e2b59c317b1c/src/helpers.rs#L57
    // If only that was exposed...

    let mut size = namespace.len();
    let key = key.key();
    assert!(!key.is_empty());

    for x in &key {
        size += x.as_ref().len() + 2;
    }

    let mut out = Vec::<u8>::with_capacity(size);

    for prefix in std::iter::once(namespace.as_bytes())
        .chain(key.iter().take(key.len() - 1).map(|key| key.as_ref()))
    {
        out.extend_from_slice(&encode_length(prefix));
        out.extend_from_slice(prefix);
    }

    if let Some(last) = key.last() {
        out.extend_from_slice(last.as_ref());
    }

    out
}

fn encode_length(bytes: &[u8]) -> [u8; 2] {
    if let Ok(len) = u16::try_from(bytes.len()) {
        len.to_be_bytes()
    } else {
        panic!("only supports namespaces up to length 0xFFFF")
    }
}

#[cfg(test)]
mod tests {
    use super::*;
    use cosmwasm_std::testing::mock_dependencies;
    use cw_storage_plus::Map;

    #[test]
    fn simple_keys_work() {
        let mut deps = mock_dependencies();
        let m = Map::<&str, String>::new("foobarbazbin");
        m.save(&mut deps.storage, "somekey", &"somevalue".to_owned())
            .unwrap();
        let key = map_key("foobarbazbin", &"somekey");
        assert_eq!(deps.as_ref().storage.get(&key).unwrap(), b"\"somevalue\"");
    }

    #[test]
    fn complex_keys_work() {
        const NAMESPACE: &str = "👋";
        let mut deps = mock_dependencies();
        let m = Map::<ComplexKey, String>::new(NAMESPACE);
        let key = (
            ("level1".to_owned(), "level™️💪".to_owned()),
            "level-".to_owned(),
        );
        let storage_key = map_key(NAMESPACE, &key);
        m.save(&mut deps.storage, key, &"somevalue".to_owned())
            .unwrap();
        assert_eq!(
            deps.as_ref().storage.get(&storage_key).unwrap(),
            b"\"somevalue\""
        );
    }

    type ComplexKey = ((String, String), String);
}