Struct near_sdk::collections::LookupMap
source · [−]pub struct LookupMap<K, V> { /* private fields */ }
Expand description
An non-iterable implementation of a map that stores its content directly on the trie.
Implementations
Create a new map. Use key_prefix
as a unique prefix for keys.
Inserts a serialized key-value pair into the map.
If the map did not have this key present, None
is returned. Otherwise returns
a serialized value. Note, the keys that have the same hash value are undistinguished by
the implementation.
Returns true if the map contains a given key.
Removes a key from the map, returning the value at the key if the key was previously in the map.
Inserts a key-value pair into the map.
If the map did not have this key present, None
is returned. Otherwise returns
a value. Note, the keys that have the same hash value are undistinguished by
the implementation.