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
use {Parcel, Error};
use std::collections::{HashMap, BTreeMap};
use std::hash::Hash;
use std::io::prelude::*;
pub type SizeType = u32;
macro_rules! impl_map_type {
( $ty:ident => K: $( $k_pred:ident ),+ ) => {
impl<K, V> Parcel for $ty<K, V>
where K: Parcel + $( $k_pred +)+,
V: Parcel
{
const TYPE_NAME: &'static str = stringify!($ty<K,V>);
fn read(read: &mut Read) -> Result<Self, Error> {
let mut map = $ty::new();
let length = SizeType::read(read)?;
for _ in 0..length {
let key = K::read(read)?;
let value = V::read(read)?;
map.insert(key, value);
}
Ok(map)
}
fn write(&self, write: &mut Write) -> Result<(), Error> {
(self.len() as SizeType).write(write)?;
for (key, value) in self.iter() {
key.write(write)?;
value.write(write)?;
}
Ok(())
}
}
}
}
impl_map_type!(HashMap => K: Hash, Eq);
impl_map_type!(BTreeMap => K: Ord);