collections2 0.0.1

Traits for generic collections, such as lists, maps and sets (supports no_std)
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

use crate::{Collection, CollectionMut};

pub trait Set<T>: Collection<T> {
    fn len(&self) -> usize;
    fn get(&self, value: &T) -> Option<&T>;
}

pub trait SetMut<T>: CollectionMut<T> {
    fn insert(&mut self, value: T) -> bool;
    fn remove(&mut self, value: &T) -> bool;
    fn capacity(&mut self) -> usize;
}

#[cfg(feature = "std")]
mod std {
    use std::collections::{hash_set, HashSet};
    use std::hash::Hash;

    use super::{Set, SetMut};
    use crate::{Collection, CollectionMut, Iterable};

    mod inner_hashset {
        use std::collections::hash_set::Iter;
        use std::collections::HashSet;
        use std::hash::Hash;

        #[inline(always)]
        pub(crate) fn len<T>(set: &HashSet<T>) -> usize {
            set.len()
        }

        #[inline(always)]
        pub(crate) fn get<'a, T: Hash + Eq>(set: &'a HashSet<T>, key: &T) -> Option<&'a T> {
            set.get(key)
        }

        #[inline(always)]
        pub(crate) fn iter<T>(set: &HashSet<T>) -> Iter<'_, T> {
            set.iter()
        }

        #[inline(always)]
        pub(crate) fn clear<T>(set: &mut HashSet<T>) {
            set.clear();
        }

        #[inline(always)]
        pub(crate) fn capacity<T>(map: &mut HashSet<T>) -> usize {
            map.capacity()
        }

        #[inline(always)]
        pub(crate) fn insert<T: Hash + Eq>(set: &mut HashSet<T>, key: T) -> bool {
            set.insert(key)
        }

        #[inline(always)]
        pub(crate) fn remove<T: Hash + Eq>(map: &mut HashSet<T>, key: &T) -> bool {
            map.remove(key)
        }
    }

    impl<T> Iterable for HashSet<T> {
        type Item<'collection> = &'collection T
        where
            T: 'collection;
        type Iterator<'collection> = hash_set::Iter<'collection, T>
        where
            T: 'collection;

        #[inline(always)]
        fn iter<'c>(&'c self) -> Self::Iterator<'c> {
            inner_hashset::iter(self)
        }
    }

    impl<T> Collection<T> for HashSet<T> {
        fn len(&self) -> usize {
            self.len()
        }

        fn contains(&self, other: &T) -> bool
        where
            T: PartialEq,
        {
            self.iter().find(|x| *x == other).is_some()
        }
    }

    impl<T> CollectionMut<T> for HashSet<T> {
        fn clear(&mut self) {
            inner_hashset::clear(self);
        }
    }

    impl<T: Hash + Eq> Set<T> for HashSet<T> {
        fn len(&self) -> usize {
            inner_hashset::len(self)
        }

        fn get(&self, value: &T) -> Option<&T> {
            inner_hashset::get(self, value)
        }
    }

    impl<T: Hash + Eq> SetMut<T> for HashSet<T> {
        #[inline(always)]
        fn capacity(&mut self) -> usize {
            inner_hashset::capacity(self)
        }

        #[inline(always)]
        fn insert(&mut self, value: T) -> bool {
            inner_hashset::insert(self, value)
        }

        #[inline(always)]
        fn remove(&mut self, value: &T) -> bool {
            inner_hashset::remove(self, value)
        }
    }
}

#[cfg(feature = "std")]
pub use self::std::*;