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

macro_rules! impl_map_type {
    ( $ty:ident => K: $( $k_pred:ident ),+ ) => {
        impl<K, V> crate::ExternallyLengthPrefixed for $ty<K, V>
            where K: crate::Protocol + $( $k_pred +)+,
                  V: crate::Protocol
        {
            fn read(read: &mut dyn crate::BitRead,
                    byte_order: crate::ByteOrder,
                    ctx: &mut dyn core::any::Any,
                    length: usize,
                    ) -> Result<Self, crate::Error> {
                let mut map = $ty::new();

                for _ in 0..length {
                    let key = K::read(read, byte_order, ctx)?;
                    let value = V::read(read, byte_order, ctx)?;

                    map.insert(key, value);
                }

                Ok(map)
            }

            fn write(&self, write: &mut dyn crate::BitWrite,
                    byte_order: crate::ByteOrder,
                    ctx: &mut dyn core::any::Any,
                    ) -> Result<(), crate::Error> {
                for (key, value) in self.iter() {
                    key.write(write, byte_order, ctx)?;
                    value.write(write, byte_order, ctx)?;
                }

                Ok(())
            }
        }
    }
}

macro_rules! test_map_type {
    ( $t:ident ) => {
        #[cfg(test)]
        #[allow(unused_imports)]
        mod tests {
            use super::*;

            test_externally_length_prefixed!($t<u8, u16> => [[0x01, 0x00, 0x02, 0x03, 0x00, 0x04], $t::from([(1, 2), (3, 4)])]);
        }
    }
}

mod hash_map {
    use std::collections::HashMap;
    use std::hash::Hash;

    impl_map_type!(HashMap => K: Hash, Eq);
}

mod b_tree_map {
    use std::collections::BTreeMap;

    impl_map_type!(BTreeMap => K: Ord);
    test_map_type!(BTreeMap);
}