ds-ext 0.4.0

Extensions to standard Rust data structures which provide additional capabilities
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
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
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117

use async_hash::{default_hash, Digest, Hash, Output};

use super::{LinkedHashMap, OrdHashMap, OrdHashSet};

impl<D, K, V> Hash<D> for LinkedHashMap<K, V>
where
    D: Digest,
    K: Eq + std::hash::Hash,
    (K, V): Hash<D>,
    Self: IntoIterator<Item = (K, V)>,
{
    fn hash(self) -> Output<D> {
        if self.is_empty() {
            return default_hash::<D>();
        }

        let mut hasher = D::new();
        for item in self {
            hasher.update(item.hash());
        }
        hasher.finalize()
    }
}

impl<'a, D, K, V> Hash<D> for &'a LinkedHashMap<K, V>
where
    D: Digest,
    K: Eq + std::hash::Hash,
    (&'a K, &'a V): Hash<D>,
    Self: IntoIterator<Item = (&'a K, &'a V)>,
{
    fn hash(self) -> Output<D> {
        if self.is_empty() {
            return default_hash::<D>();
        }

        let mut hasher = D::new();
        for item in self {
            hasher.update(item.hash());
        }
        hasher.finalize()
    }
}

impl<D, K, V> Hash<D> for OrdHashMap<K, V>
where
    D: Digest,
    K: Eq + std::hash::Hash + Ord,
    (K, V): Hash<D>,
    Self: IntoIterator<Item = (K, V)>,
{
    fn hash(self) -> Output<D> {
        if self.is_empty() {
            return default_hash::<D>();
        }

        let mut hasher = D::new();
        for item in self {
            hasher.update(item.hash());
        }
        hasher.finalize()
    }
}

impl<'a, D, K, V> Hash<D> for &'a OrdHashMap<K, V>
where
    D: Digest,
    K: Eq + std::hash::Hash + Ord,
    (&'a K, &'a V): Hash<D>,
    Self: IntoIterator<Item = (&'a K, &'a V)>,
{
    fn hash(self) -> Output<D> {
        if self.is_empty() {
            return default_hash::<D>();
        }

        let mut hasher = D::new();
        for item in self {
            hasher.update(item.hash());
        }
        hasher.finalize()
    }
}

impl<D: Digest, T> Hash<D> for OrdHashSet<T>
where
    for<'a> &'a T: Hash<D>,
{
    fn hash(self) -> Output<D> {
        if self.is_empty() {
            return default_hash::<D>();
        }

        let mut hasher = D::new();
        for item in self.iter() {
            hasher.update(item.hash());
        }
        hasher.finalize()
    }
}

impl<'a, D: Digest, T> Hash<D> for &'a OrdHashSet<T>
where
    &'a T: Hash<D>,
{
    fn hash(self) -> Output<D> {
        if self.is_empty() {
            return default_hash::<D>();
        }

        let mut hasher = D::new();
        for item in self {
            hasher.update(item.hash());
        }
        hasher.finalize()
    }
}