anchorhash 0.2.2

A consistent hashing algorithm that outperforms state-of-the-art algorithms.
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
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136

use std::iter::FusedIterator;

use hashbrown::hash_map::{Values, ValuesMut};

/// An iterator yielding resources assigned to an [`AnchorHash`] instance in
/// an arbitrary order.
///
/// [`AnchorHash`]: crate::AnchorHash  
#[derive(Debug, Clone)]
pub struct ResourceIterator<'a, R>(Values<'a, u16, R>);

impl<'a, R> From<Values<'a, u16, R>> for ResourceIterator<'a, R> {
    fn from(v: Values<'a, u16, R>) -> Self {
        Self(v)
    }
}

impl<'a, R> Iterator for ResourceIterator<'a, R> {
    type Item = &'a R;

    fn next(&mut self) -> Option<Self::Item> {
        self.0.next()
    }

    fn size_hint(&self) -> (usize, Option<usize>) {
        self.0.size_hint()
    }
}

impl<'a, R> ExactSizeIterator for ResourceIterator<'a, R> {}
impl<'a, R> FusedIterator for ResourceIterator<'a, R> {}

/// An iterator yielding mutable references to the resources assigned to an
/// [`AnchorHash`] instance in an arbitrary order.
///
/// [`AnchorHash`]: crate::AnchorHash  
#[derive(Debug)]
pub struct ResourceMutIterator<'a, R>(ValuesMut<'a, u16, R>);

impl<'a, R> From<ValuesMut<'a, u16, R>> for ResourceMutIterator<'a, R> {
    fn from(v: ValuesMut<'a, u16, R>) -> Self {
        Self(v)
    }
}

impl<'a, R> Iterator for ResourceMutIterator<'a, R> {
    type Item = &'a mut R;

    fn next(&mut self) -> Option<Self::Item> {
        self.0.next()
    }

    fn size_hint(&self) -> (usize, Option<usize>) {
        self.0.size_hint()
    }
}

impl<'a, R> ExactSizeIterator for ResourceMutIterator<'a, R> {}
impl<'a, R> FusedIterator for ResourceMutIterator<'a, R> {}

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

    fn assert_fused_impl<F: FusedIterator>(_iter: F) {}

    #[test]
    fn test_iter_fused() {
        let a = vec!["A", "B", "C", "D"]
            .into_iter()
            .collect::<crate::AnchorHash<usize, _, _>>();

        assert_fused_impl(a.resources());
        assert_fused_impl(a.resources().0);
    }

    #[test]
    fn test_iter_mut_fused() {
        let mut a = vec!["A", "B", "C", "D"]
            .into_iter()
            .collect::<crate::AnchorHash<usize, _, _>>();

        assert_fused_impl(a.resources_mut());
        assert_fused_impl(a.resources_mut().0);
    }

    #[test]
    fn test_exact_size_iter() {
        let a = vec!["A", "B", "C", "D"]
            .into_iter()
            .collect::<crate::AnchorHash<usize, _, _>>();

        let got = a.resources().len();
        assert_eq!(got, 4);
    }

    #[test]
    fn test_exact_size_iter_mut() {
        let mut a = vec!["A", "B", "C", "D"]
            .into_iter()
            .collect::<crate::AnchorHash<usize, _, _>>();

        let got = a.resources_mut().len();
        assert_eq!(got, 4);
    }

    #[test]
    fn test_resource_iter() {
        let mut resources = vec!["A", "B", "C", "D"];
        let a = resources
            .clone()
            .into_iter()
            .collect::<crate::AnchorHash<usize, _, _>>();

        let mut got = a.resources().cloned().collect::<Vec<_>>();

        resources.sort_unstable();
        got.sort_unstable();
        assert_eq!(resources, got);
    }

    #[test]
    fn test_resource_iter_mut() {
        let mut resources = vec!["A", "B", "C", "D"];
        let mut a = resources
            .clone()
            .into_iter()
            .collect::<crate::AnchorHash<usize, _, _>>();

        let mut got = a.resources_mut().map(|v| *v).collect::<Vec<_>>();

        resources.sort_unstable();
        got.sort_unstable();
        assert_eq!(resources, got);
    }
}