rangetools 0.1.4

Extending the Rust Range structs found in std::ops
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
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249

use crate::{EmptyRange, Rangetools as _};

#[test]
fn range() {
    let s = (1..3).union(4..6);
    let i = s.clone().intersection(2..6);
    assert_eq!(i.clone().into_iter().collect::<Vec<_>>(), vec![2, 4, 5]);
    assert!(!i.contains(0));
    assert!(!i.contains(1));
    assert!(i.contains(2));
    assert!(!i.contains(3));
    assert!(i.contains(4));
    assert!(i.contains(5));
    assert!(!i.contains(6));
    assert!(!i.is_empty());
    assert!(s.intersection(10..20).is_empty());
}

#[test]
fn range_from() {
    let s = (1..3).union(4..6);
    let i = s.clone().intersection(2..);
    assert_eq!(i.clone().into_iter().collect::<Vec<_>>(), vec![2, 4, 5]);
    assert!(!i.contains(0));
    assert!(!i.contains(1));
    assert!(i.contains(2));
    assert!(!i.contains(3));
    assert!(i.contains(4));
    assert!(i.contains(5));
    assert!(!i.contains(6));
    assert!(!i.is_empty());
    assert!(s.intersection(10..).is_empty());
}

#[test]
fn range_full() {
    let s = (1..3).union(4..=5);
    let i = s.intersection(..);
    assert_eq!(i.clone().into_iter().collect::<Vec<_>>(), vec![1, 2, 4, 5]);
    assert!(!i.contains(0));
    assert!(i.contains(1));
    assert!(i.contains(2));
    assert!(!i.contains(3));
    assert!(i.contains(4));
    assert!(i.contains(5));
    assert!(!i.contains(6));
    assert!(!i.is_empty());
    assert!((1..1).union(2..2).intersection(..).is_empty());
}

#[test]
fn range_inclusive() {
    let s = (1..3).union(4..6);
    let i = s.clone().intersection(2..=5);
    assert_eq!(i.clone().into_iter().collect::<Vec<_>>(), vec![2, 4, 5]);
    assert!(!i.contains(0));
    assert!(!i.contains(1));
    assert!(i.contains(2));
    assert!(!i.contains(3));
    assert!(i.contains(4));
    assert!(i.contains(5));
    assert!(!i.contains(6));
    assert!(!i.is_empty());
    assert!(s.intersection(10..=20).is_empty());
}

#[test]
fn range_to() {
    let s = (1..3).union(4..6);
    let i = s.clone().intersection(..5);
    assert_eq!(i.clone().into_iter().collect::<Vec<_>>(), vec![1, 2, 4]);
    assert!(!i.contains(0));
    assert!(i.contains(1));
    assert!(i.contains(2));
    assert!(!i.contains(3));
    assert!(i.contains(4));
    assert!(!i.contains(5));
    assert!(!i.contains(6));
    assert!(!i.is_empty());
    assert!(s.intersection(..1).is_empty());
}

#[test]
fn range_to_inclusive() {
    let s = (1..3).union(4..6);
    let i = s.clone().intersection(..=5);
    assert_eq!(i.clone().into_iter().collect::<Vec<_>>(), vec![1, 2, 4, 5]);
    assert!(!i.contains(0));
    assert!(i.contains(1));
    assert!(i.contains(2));
    assert!(!i.contains(3));
    assert!(i.contains(4));
    assert!(i.contains(5));
    assert!(!i.contains(6));
    assert!(!i.is_empty());
    assert!(s.intersection(..=0).is_empty());
}

#[test]
fn bounded_range() {
    let s = (1..3).union(4..6);
    let r = (2..6).intersection(..);
    let i = s.clone().intersection(r);
    assert_eq!(i.clone().into_iter().collect::<Vec<_>>(), vec![2, 4, 5]);
    assert!(!i.contains(0));
    assert!(!i.contains(1));
    assert!(i.contains(2));
    assert!(!i.contains(3));
    assert!(i.contains(4));
    assert!(i.contains(5));
    assert!(!i.contains(6));
    assert!(!i.is_empty());
    let r = (10..20).intersection(..);
    assert!(s.intersection(r).is_empty());
}

#[test]
fn lower_bounded_range() {
    let s = (1..3).union(4..6);
    let r = (2..).intersection(1..);
    let i = s.clone().intersection(r);
    assert_eq!(i.clone().into_iter().collect::<Vec<_>>(), vec![2, 4, 5]);
    assert!(!i.contains(0));
    assert!(!i.contains(1));
    assert!(i.contains(2));
    assert!(!i.contains(3));
    assert!(i.contains(4));
    assert!(i.contains(5));
    assert!(!i.contains(6));
    assert!(!i.is_empty());
    let r = (10..).intersection(20..);
    assert!(s.intersection(r).is_empty());
}

#[test]
fn upper_bounded_range() {
    let s = (1..3).union(4..6);
    let r = (..5).intersection(..6);
    let i = s.clone().intersection(r);
    assert_eq!(i.clone().into_iter().collect::<Vec<_>>(), vec![1, 2, 4]);
    assert!(!i.contains(0));
    assert!(i.contains(1));
    assert!(i.contains(2));
    assert!(!i.contains(3));
    assert!(i.contains(4));
    assert!(!i.contains(5));
    assert!(!i.contains(6));
    assert!(!i.is_empty());
    let r = (..1).intersection(..2);
    assert!(s.intersection(r).is_empty());
}

#[test]
fn unbounded_range() {
    let s = (1..3).union(4..=5);
    let r = (..).to_inner();
    let i = s.intersection(r);
    assert_eq!(i.clone().into_iter().collect::<Vec<_>>(), vec![1, 2, 4, 5]);
    assert!(!i.contains(0));
    assert!(i.contains(1));
    assert!(i.contains(2));
    assert!(!i.contains(3));
    assert!(i.contains(4));
    assert!(i.contains(5));
    assert!(!i.contains(6));
    assert!(!i.is_empty());
    assert!((1..1).union(2..2).intersection(r).is_empty());
}

#[test]
fn empty_range() {
    let s = (1..3).union(4..5);
    let r = EmptyRange::new();
    let i = s.intersection(r);
    assert!(i.is_empty());
    assert_eq!(i.into_iter().collect::<Vec<_>>(), vec![]);
}

#[test]
fn bounded_set() {
    let s1 = (1..3).union(4..6);
    let s2 = (2..=2).union(4..5);
    let i = s1.clone().intersection(s2);
    assert_eq!(i.clone().into_iter().collect::<Vec<_>>(), vec![2, 4]);
    assert!(!i.contains(0));
    assert!(!i.contains(1));
    assert!(i.contains(2));
    assert!(!i.contains(3));
    assert!(i.contains(4));
    assert!(!i.contains(5));
    assert!(!i.contains(6));
    assert!(!i.is_empty());
    let s2 = (10..20).union(30..40);
    assert!(s1.intersection(s2).is_empty());
}

#[test]
fn lower_bounded_set() {
    let s1 = (1..3).union(4..6);
    let s2 = (2..).union(3..);
    let i = s1.clone().intersection(s2);
    assert_eq!(i.clone().into_iter().collect::<Vec<_>>(), vec![2, 4, 5]);
    assert!(!i.contains(0));
    assert!(!i.contains(1));
    assert!(i.contains(2));
    assert!(!i.contains(3));
    assert!(i.contains(4));
    assert!(i.contains(5));
    assert!(!i.contains(6));
    assert!(!i.is_empty());
    let s2 = (10..).union(20..);
    assert!(s1.intersection(s2).is_empty());
}

#[test]
fn upper_bounded_set() {
    let s1 = (1..2).union(3..5);
    let s2 = (..3).union(4..6);
    let i = s1.clone().intersection(s2);
    assert_eq!(i.clone().into_iter().collect::<Vec<_>>(), vec![1, 4]);
    assert!(!i.contains(0));
    assert!(i.contains(1));
    assert!(!i.contains(2));
    assert!(!i.contains(3));
    assert!(i.contains(4));
    assert!(!i.contains(5));
    assert!(!i.contains(6));
    assert!(!i.is_empty());
    let s2 = (..1).union(..0);
    assert!(s1.intersection(s2).is_empty());
}

#[test]
fn unbounded_set() {
    let s = (1..3).union(4..=5);
    let r = (..=1).union(2..3).union(5..);
    let i = s.clone().intersection(r);
    assert_eq!(i.clone().into_iter().collect::<Vec<_>>(), vec![1, 2, 5]);
    assert!(!i.contains(0));
    assert!(i.contains(1));
    assert!(i.contains(2));
    assert!(!i.contains(3));
    assert!(!i.contains(4));
    assert!(i.contains(5));
    assert!(!i.contains(6));
    assert!(!i.is_empty());
    let r = (..1).union(3..4).union(6..);
    assert!(s.intersection(r).is_empty());
}