total-maps 0.3.0

Maps where every possible key has an associated value
Documentation 
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

use std::{
    collections::{BTreeMap, HashMap},
    hash::Hash,
};

use serde::{Deserialize, Serialize};

use crate::{Commonality, TotalBTreeMap, TotalHashMap};

impl<K: Serialize, V: Serialize, C> Serialize for TotalHashMap<K, V, C> {
    fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
    where
        S: serde::Serializer,
    {
        self.as_hash_map().serialize(serializer)
    }
}
impl<'de, K: Deserialize<'de> + Eq + Hash, V: Deserialize<'de>, C: Commonality<V>> Deserialize<'de>
    for TotalHashMap<K, V, C>
{
    fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
    where
        D: serde::Deserializer<'de>,
    {
        let mut this = Self::default();
        *this.as_hash_map_mut() = HashMap::deserialize(deserializer)?;
        Ok(this)
    }
}

impl<K: Serialize, V: Serialize, C> Serialize for TotalBTreeMap<K, V, C> {
    fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
    where
        S: serde::Serializer,
    {
        self.as_btree_map().serialize(serializer)
    }
}
impl<'de, K: Deserialize<'de> + Ord, V: Deserialize<'de>, C: Commonality<V>> Deserialize<'de>
    for TotalBTreeMap<K, V, C>
{
    fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
    where
        D: serde::Deserializer<'de>,
    {
        let mut this = Self::default();
        *this.as_btree_map_mut() = BTreeMap::deserialize(deserializer)?;
        Ok(this)
    }
}