pub struct Mapx<K, V> where
K: Clone + PartialEq + Eq + PartialOrd + Ord + Hash + Serialize + DeserializeOwned + Debug,
V: Clone + PartialEq + Serialize + DeserializeOwned + Debug, { /* fields omitted */ }
Expand description
To solve the problem of unlimited memory usage,
use this to replace the original in-memory BTreeMap<_, _>
.
Implementations
Imitate the behavior of ‘BTreeMap<_>.get(…)’
Any faster/better choice other than JSON ?
Imitate the behavior of ‘BTreeMap<_>.get_mut(…)’
Imitate the behavior of ‘BTreeMap<_>.insert(…)’.
Imitate the behavior of ‘.entry(…).or_insert(…)’
Check if a key is exists.
Remove a <K, V> from mem and disk.
Trait Implementations
impl<'de, K, V> Deserialize<'de> for Mapx<K, V> where
K: Clone + PartialEq + Eq + PartialOrd + Ord + Hash + Serialize + DeserializeOwned + Debug,
V: Clone + PartialEq + Serialize + DeserializeOwned + Debug,
impl<'de, K, V> Deserialize<'de> for Mapx<K, V> where
K: Clone + PartialEq + Eq + PartialOrd + Ord + Hash + Serialize + DeserializeOwned + Debug,
V: Clone + PartialEq + Serialize + DeserializeOwned + Debug,
Deserialize this value from the given Serde deserializer. Read more
impl<K, V> Eq for Mapx<K, V> where
K: Clone + PartialEq + Eq + PartialOrd + Ord + Hash + Serialize + DeserializeOwned + Debug,
V: Clone + PartialEq + Serialize + DeserializeOwned + Debug,
impl<K, V> StructuralPartialEq for Mapx<K, V> where
K: Clone + PartialEq + Eq + PartialOrd + Ord + Hash + Serialize + DeserializeOwned + Debug,
V: Clone + PartialEq + Serialize + DeserializeOwned + Debug,
Auto Trait Implementations
impl<K, V> RefUnwindSafe for Mapx<K, V> where
K: RefUnwindSafe,
V: RefUnwindSafe,
impl<K, V> UnwindSafe for Mapx<K, V> where
K: UnwindSafe,
V: UnwindSafe,
Blanket Implementations
Mutably borrows from an owned value. Read more