key_set 0.1.0

KeySet representing concepts of All, None, Some(list), and AllExceptSome(list), with basic set calculations (intersection, difference, inverse).
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

use key_set::KeySet;

#[test]
fn test_all() {
    let ks = KeySet::All as KeySet<i32>;

    assert_eq!(ks.intersect(&KeySet::All), KeySet::All);
    assert_eq!(ks.intersect(&KeySet::None), KeySet::None);
    assert_eq!(
        ks.intersect(&KeySet::Some(vec![1, 2, 3])),
        KeySet::Some(vec![1, 2, 3])
    );
    assert_eq!(
        ks.intersect(&KeySet::AllExceptSome(vec![1, 2, 3])),
        KeySet::AllExceptSome(vec![1, 2, 3])
    );
}

#[test]
fn test_none() {
    let ks = KeySet::None as KeySet<i32>;

    assert_eq!(ks.intersect(&KeySet::All), KeySet::None);
    assert_eq!(ks.intersect(&KeySet::None), KeySet::None);
    assert_eq!(ks.intersect(&KeySet::Some(vec![1, 2, 3])), KeySet::None);
    assert_eq!(
        ks.intersect(&KeySet::AllExceptSome(vec![1, 2, 3])),
        KeySet::None
    );
}

#[test]
fn test_some() {
    let ks = KeySet::Some(vec![1, 2, 3]);

    assert_eq!(ks.intersect(&KeySet::All), KeySet::Some(vec![1, 2, 3]));
    assert_eq!(ks.intersect(&KeySet::None), KeySet::None);

    assert_eq!(
        ks.intersect(&KeySet::Some(vec![1, 2])),
        KeySet::Some(vec![1, 2])
    );
    assert_eq!(
        ks.intersect(&KeySet::Some(vec![1, 2, 3])),
        KeySet::Some(vec![1, 2, 3])
    );
    assert_eq!(
        ks.intersect(&KeySet::Some(vec![1, 3, 4, 5])),
        KeySet::Some(vec![1, 3])
    );
    assert_eq!(ks.intersect(&KeySet::Some(vec![4, 5])), KeySet::None);

    assert_eq!(
        ks.intersect(&KeySet::AllExceptSome(vec![1, 2])),
        KeySet::Some(vec![3])
    );
    assert_eq!(
        ks.intersect(&KeySet::AllExceptSome(vec![1, 2, 3])),
        KeySet::None
    );
    assert_eq!(
        ks.intersect(&KeySet::AllExceptSome(vec![1, 3, 4, 5])),
        KeySet::Some(vec![2])
    );
    assert_eq!(
        ks.intersect(&KeySet::AllExceptSome(vec![4, 5])),
        KeySet::Some(vec![1, 2, 3])
    );
}

#[test]
fn test_all_except_some() {
    let ks = KeySet::AllExceptSome(vec![1, 2, 3]);

    assert_eq!(
        ks.intersect(&KeySet::All),
        KeySet::AllExceptSome(vec![1, 2, 3])
    );
    assert_eq!(ks.intersect(&KeySet::None), KeySet::None);

    assert_eq!(ks.intersect(&KeySet::Some(vec![1, 2])), KeySet::None);
    assert_eq!(ks.intersect(&KeySet::Some(vec![1, 2, 3])), KeySet::None);
    assert_eq!(
        ks.intersect(&KeySet::Some(vec![1, 3, 4, 5])),
        KeySet::Some(vec![4, 5])
    );
    assert_eq!(
        ks.intersect(&KeySet::Some(vec![4, 5])),
        KeySet::Some(vec![4, 5])
    );

    assert_eq!(
        ks.intersect(&KeySet::AllExceptSome(vec![1, 2])),
        KeySet::AllExceptSome(vec![1, 2, 3])
    );
    assert_eq!(
        ks.intersect(&KeySet::AllExceptSome(vec![1, 2, 3])),
        KeySet::AllExceptSome(vec![1, 2, 3])
    );
    assert_eq!(
        ks.intersect(&KeySet::AllExceptSome(vec![1, 3, 4, 5])),
        KeySet::AllExceptSome(vec![1, 2, 3, 4, 5])
    );
    assert_eq!(
        ks.intersect(&KeySet::AllExceptSome(vec![4, 5])),
        KeySet::AllExceptSome(vec![1, 2, 3, 4, 5])
    );
}