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

use std::collections::HashSet;
use std::hash::Hash;

use crate::set::traits::{Finite, Intersect, Set};

impl<T> Finite for Vec<T> {
    fn size(&self) -> usize {
        self.len()
    }
}

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

impl<T: Clone + Eq + Hash> Set<&T, HashSet<T>> for HashSet<T> {
    fn is_empty(&self) -> bool {
        self.is_empty()
    }

    fn contains(&self, item: &T) -> bool {
        self.contains(item)
    }
}

impl<T: Clone + Eq + Hash> Intersect<&HashSet<T>, HashSet<T>> for HashSet<T> {
    fn intersect(&self, other: &HashSet<T>) -> HashSet<T> {
        self.intersection(other).map(|x| x.clone()).collect()
    }
}

#[cfg(test)]
mod tests {
    use std::collections::HashSet;

    use crate::set::traits::{Cardinality, Countable, CountableType, Finite, HasCardinality, Set};

    #[test]
    fn test_finite_vec() {
        let v = vec![2, 5, 1, 7, -12, 3, 5, 71, -2];
        assert_eq!(Finite::size(&v), v.len());
        assert_eq!(Countable::count(&v), CountableType::Finite(v.len()));
        assert_eq!(Countable::is_finite(&v), true);
        assert_eq!(HasCardinality::get_cardinality(&v), Cardinality::Countable(CountableType::Finite(v.len())));
    }

    #[test]
    fn test_set() {
        let mut s = HashSet::new();
        assert_eq!(s.is_empty(), true);
        s.insert(3);
        assert_eq!(s.is_empty(), false);
        assert_eq!(Set::<&i32, HashSet<i32>>::contains(&s, &3), true);
        assert_eq!(Set::<&i32, HashSet<i32>>::contains(&s, &4), false);
        assert_eq!(Set::<&i32, HashSet<i32>>::contains(&s, &2), false);
    }
}