ordermap 0.5.10

A hash table with consistent order and fast iteration.
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

#[cfg(feature = "arbitrary")]
#[cfg_attr(docsrs, doc(cfg(feature = "arbitrary")))]
mod impl_arbitrary {
    use crate::{OrderMap, OrderSet};
    use arbitrary::{Arbitrary, Result, Unstructured};
    use core::hash::{BuildHasher, Hash};
    use indexmap::{IndexMap, IndexSet};

    impl<'a, K, V, S> Arbitrary<'a> for OrderMap<K, V, S>
    where
        K: Arbitrary<'a> + Hash + Eq,
        V: Arbitrary<'a>,
        S: BuildHasher + Default,
    {
        fn arbitrary(u: &mut Unstructured<'a>) -> Result<Self> {
            IndexMap::arbitrary(u).map(|inner| Self { inner })
        }

        fn arbitrary_take_rest(u: Unstructured<'a>) -> Result<Self> {
            IndexMap::arbitrary_take_rest(u).map(|inner| Self { inner })
        }
    }

    impl<'a, T, S> Arbitrary<'a> for OrderSet<T, S>
    where
        T: Arbitrary<'a> + Hash + Eq,
        S: BuildHasher + Default,
    {
        fn arbitrary(u: &mut Unstructured<'a>) -> Result<Self> {
            IndexSet::arbitrary(u).map(|inner| Self { inner })
        }

        fn arbitrary_take_rest(u: Unstructured<'a>) -> Result<Self> {
            IndexSet::arbitrary_take_rest(u).map(|inner| Self { inner })
        }
    }
}

#[cfg(feature = "quickcheck")]
#[cfg_attr(docsrs, doc(cfg(feature = "quickcheck")))]
mod impl_quickcheck {
    use crate::{OrderMap, OrderSet};
    use alloc::boxed::Box;
    use core::hash::{BuildHasher, Hash};
    use indexmap::{IndexMap, IndexSet};
    use quickcheck::{Arbitrary, Gen};

    impl<K, V, S> Arbitrary for OrderMap<K, V, S>
    where
        K: Arbitrary + Hash + Eq,
        V: Arbitrary,
        S: BuildHasher + Default + Clone + 'static,
    {
        fn arbitrary(g: &mut Gen) -> Self {
            Self {
                inner: IndexMap::arbitrary(g),
            }
        }

        fn shrink(&self) -> Box<dyn Iterator<Item = Self>> {
            Box::new(self.inner.shrink().map(|inner| Self { inner }))
        }
    }

    impl<T, S> Arbitrary for OrderSet<T, S>
    where
        T: Arbitrary + Hash + Eq,
        S: BuildHasher + Default + Clone + 'static,
    {
        fn arbitrary(g: &mut Gen) -> Self {
            Self {
                inner: IndexSet::arbitrary(g),
            }
        }

        fn shrink(&self) -> Box<dyn Iterator<Item = Self>> {
            Box::new(self.inner.shrink().map(|inner| Self { inner }))
        }
    }
}