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
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97

use super::super::Collate;
use super::DefaultCollate;
use std::{
    cmp::Eq,
    collections::{BTreeMap, HashMap},
    hash::{BuildHasher, Hash},
};

impl<K, V, H> Collate<HashMap<K, V, H>> for DefaultCollate
where
    K: Eq + Hash + Clone,
    V: Clone,
    Self: Collate<V>,
    H: BuildHasher,
{
    type Output = HashMap<K, <Self as Collate<V>>::Output>;
    fn collate(&self, batch: Vec<HashMap<K, V, H>>) -> Self::Output {
        let mut collated = HashMap::with_capacity(batch[0].keys().len());
        for key in batch[0].keys() {
            let vec: Vec<_> = batch.iter().map(|hash_map| hash_map[key].clone()).collect();
            collated.insert(key.clone(), self.collate(vec));
        }
        collated
    }
}
impl<K, V> Collate<BTreeMap<K, V>> for DefaultCollate
where
    K: Ord + Clone,
    V: Clone,
    Self: Collate<V>,
{
    type Output = BTreeMap<K, <Self as Collate<V>>::Output>;
    fn collate(&self, batch: Vec<BTreeMap<K, V>>) -> Self::Output {
        let mut collated = BTreeMap::new();
        for key in batch[0].keys() {
            let vec: Vec<_> = batch.iter().map(|hash_map| hash_map[key].clone()).collect();
            collated.insert(key.clone(), self.collate(vec));
        }
        collated
    }
}

#[cfg(test)]
mod tests {
    use super::*;
    use ndarray::array;

    #[test]
    fn vec_of_hash_map() {
        let map1 = HashMap::from([("A", 0), ("B", 1)]);
        let map2 = HashMap::from([("A", 100), ("B", 100)]);
        let expected_result = HashMap::from([("A", array![0, 100]), ("B", array![1, 100])]);
        assert_eq!(
            DefaultCollate::default().collate(vec![map1, map2]),
            expected_result
        );

        // Same value type but different key
        let map1 = HashMap::from([(1, 0), (2, 1)]);
        let map2 = HashMap::from([(1, 100), (2, 100)]);
        let expected_result = HashMap::from([(1, array![0, 100]), (2, array![1, 100])]);
        assert_eq!(
            DefaultCollate::default().collate(vec![map1, map2]),
            expected_result
        );

        let map1 = HashMap::from([("A", 0.0), ("B", 1.0)]);
        let map2 = HashMap::from([("A", 100.0), ("B", 100.0)]);
        let expected_result = HashMap::from([("A", array![0.0, 100.0]), ("B", array![1.0, 100.0])]);
        assert_eq!(
            DefaultCollate::default().collate(vec![map1, map2]),
            expected_result
        );
    }

    #[test]
    fn specialized() {
        let map1 = HashMap::from([("A", String::from("0")), ("B", String::from("1"))]);
        let map2 = HashMap::from([("A", String::from("100")), ("B", String::from("100"))]);
        let expected_result = HashMap::from([
            ("A", vec![String::from("0"), String::from("100")]),
            ("B", vec![String::from("1"), String::from("100")]),
        ]);
        assert_eq!(
            DefaultCollate::default().collate(vec![map1, map2]),
            expected_result
        );

        let map1 = HashMap::from([("A", "0"), ("B", "1")]);
        let map2 = HashMap::from([("A", "100"), ("B", "100")]);
        let expected_result = HashMap::from([("A", vec!["0", "100"]), ("B", vec!["1", "100"])]);
        assert_eq!(
            DefaultCollate::default().collate(vec![map1, map2]),
            expected_result
        );
    }
}