]>
Commit | Line | Data |
---|---|---|
1a4d82fc JJ |
1 | // Copyright 2014 The Rust Project Developers. See the COPYRIGHT |
2 | // file at the top-level directory of this distribution and at | |
3 | // http://rust-lang.org/COPYRIGHT. | |
4 | // | |
5 | // Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or | |
6 | // http://www.apache.org/licenses/LICENSE-2.0> or the MIT license | |
7 | // <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your | |
8 | // option. This file may not be copied, modified, or distributed | |
9 | // except according to those terms. | |
10 | ||
11 | use core::iter::*; | |
d9579d0f | 12 | use core::{i8, i16, isize}; |
c34b1796 | 13 | use core::usize; |
1a4d82fc JJ |
14 | |
15 | use test::Bencher; | |
16 | ||
17 | #[test] | |
18 | fn test_lt() { | |
c34b1796 | 19 | let empty: [isize; 0] = []; |
85aaf69f SL |
20 | let xs = [1,2,3]; |
21 | let ys = [1,2,0]; | |
1a4d82fc | 22 | |
e9174d1e SL |
23 | assert!(!xs.iter().lt(ys.iter())); |
24 | assert!(!xs.iter().le(ys.iter())); | |
25 | assert!( xs.iter().gt(ys.iter())); | |
26 | assert!( xs.iter().ge(ys.iter())); | |
1a4d82fc | 27 | |
e9174d1e SL |
28 | assert!( ys.iter().lt(xs.iter())); |
29 | assert!( ys.iter().le(xs.iter())); | |
30 | assert!(!ys.iter().gt(xs.iter())); | |
31 | assert!(!ys.iter().ge(xs.iter())); | |
1a4d82fc | 32 | |
e9174d1e SL |
33 | assert!( empty.iter().lt(xs.iter())); |
34 | assert!( empty.iter().le(xs.iter())); | |
35 | assert!(!empty.iter().gt(xs.iter())); | |
36 | assert!(!empty.iter().ge(xs.iter())); | |
1a4d82fc JJ |
37 | |
38 | // Sequence with NaN | |
39 | let u = [1.0f64, 2.0]; | |
40 | let v = [0.0f64/0.0, 3.0]; | |
41 | ||
e9174d1e SL |
42 | assert!(!u.iter().lt(v.iter())); |
43 | assert!(!u.iter().le(v.iter())); | |
44 | assert!(!u.iter().gt(v.iter())); | |
45 | assert!(!u.iter().ge(v.iter())); | |
1a4d82fc JJ |
46 | |
47 | let a = [0.0f64/0.0]; | |
48 | let b = [1.0f64]; | |
49 | let c = [2.0f64]; | |
50 | ||
e9174d1e SL |
51 | assert!(a.iter().lt(b.iter()) == (a[0] < b[0])); |
52 | assert!(a.iter().le(b.iter()) == (a[0] <= b[0])); | |
53 | assert!(a.iter().gt(b.iter()) == (a[0] > b[0])); | |
54 | assert!(a.iter().ge(b.iter()) == (a[0] >= b[0])); | |
1a4d82fc | 55 | |
e9174d1e SL |
56 | assert!(c.iter().lt(b.iter()) == (c[0] < b[0])); |
57 | assert!(c.iter().le(b.iter()) == (c[0] <= b[0])); | |
58 | assert!(c.iter().gt(b.iter()) == (c[0] > b[0])); | |
59 | assert!(c.iter().ge(b.iter()) == (c[0] >= b[0])); | |
1a4d82fc JJ |
60 | } |
61 | ||
62 | #[test] | |
63 | fn test_multi_iter() { | |
85aaf69f SL |
64 | let xs = [1,2,3,4]; |
65 | let ys = [4,3,2,1]; | |
e9174d1e SL |
66 | assert!(xs.iter().eq(ys.iter().rev())); |
67 | assert!(xs.iter().lt(xs.iter().skip(2))); | |
1a4d82fc JJ |
68 | } |
69 | ||
70 | #[test] | |
71 | fn test_counter_from_iter() { | |
c34b1796 AL |
72 | let it = (0..).step_by(5).take(10); |
73 | let xs: Vec<isize> = FromIterator::from_iter(it); | |
74 | assert_eq!(xs, [0, 5, 10, 15, 20, 25, 30, 35, 40, 45]); | |
1a4d82fc JJ |
75 | } |
76 | ||
77 | #[test] | |
78 | fn test_iterator_chain() { | |
85aaf69f SL |
79 | let xs = [0, 1, 2, 3, 4, 5]; |
80 | let ys = [30, 40, 50, 60]; | |
1a4d82fc | 81 | let expected = [0, 1, 2, 3, 4, 5, 30, 40, 50, 60]; |
62682a34 | 82 | let it = xs.iter().chain(&ys); |
1a4d82fc JJ |
83 | let mut i = 0; |
84 | for &x in it { | |
85 | assert_eq!(x, expected[i]); | |
86 | i += 1; | |
87 | } | |
88 | assert_eq!(i, expected.len()); | |
89 | ||
c34b1796 AL |
90 | let ys = (30..).step_by(10).take(4); |
91 | let it = xs.iter().cloned().chain(ys); | |
1a4d82fc JJ |
92 | let mut i = 0; |
93 | for x in it { | |
94 | assert_eq!(x, expected[i]); | |
95 | i += 1; | |
96 | } | |
97 | assert_eq!(i, expected.len()); | |
98 | } | |
99 | ||
d9579d0f AL |
100 | #[test] |
101 | fn test_iterator_chain_nth() { | |
102 | let xs = [0, 1, 2, 3, 4, 5]; | |
103 | let ys = [30, 40, 50, 60]; | |
104 | let zs = []; | |
105 | let expected = [0, 1, 2, 3, 4, 5, 30, 40, 50, 60]; | |
106 | for (i, x) in expected.iter().enumerate() { | |
62682a34 | 107 | assert_eq!(Some(x), xs.iter().chain(&ys).nth(i)); |
d9579d0f | 108 | } |
62682a34 | 109 | assert_eq!(zs.iter().chain(&xs).nth(0), Some(&0)); |
d9579d0f | 110 | |
62682a34 | 111 | let mut it = xs.iter().chain(&zs); |
d9579d0f AL |
112 | assert_eq!(it.nth(5), Some(&5)); |
113 | assert_eq!(it.next(), None); | |
114 | } | |
115 | ||
116 | #[test] | |
117 | fn test_iterator_chain_last() { | |
118 | let xs = [0, 1, 2, 3, 4, 5]; | |
119 | let ys = [30, 40, 50, 60]; | |
120 | let zs = []; | |
62682a34 SL |
121 | assert_eq!(xs.iter().chain(&ys).last(), Some(&60)); |
122 | assert_eq!(zs.iter().chain(&ys).last(), Some(&60)); | |
123 | assert_eq!(ys.iter().chain(&zs).last(), Some(&60)); | |
124 | assert_eq!(zs.iter().chain(&zs).last(), None); | |
d9579d0f AL |
125 | } |
126 | ||
127 | #[test] | |
128 | fn test_iterator_chain_count() { | |
129 | let xs = [0, 1, 2, 3, 4, 5]; | |
130 | let ys = [30, 40, 50, 60]; | |
131 | let zs = []; | |
62682a34 SL |
132 | assert_eq!(xs.iter().chain(&ys).count(), 10); |
133 | assert_eq!(zs.iter().chain(&ys).count(), 4); | |
d9579d0f AL |
134 | } |
135 | ||
1a4d82fc JJ |
136 | #[test] |
137 | fn test_filter_map() { | |
c34b1796 | 138 | let it = (0..).step_by(1).take(10) |
1a4d82fc | 139 | .filter_map(|x| if x % 2 == 0 { Some(x*x) } else { None }); |
c34b1796 | 140 | assert_eq!(it.collect::<Vec<usize>>(), [0*0, 2*2, 4*4, 6*6, 8*8]); |
1a4d82fc JJ |
141 | } |
142 | ||
143 | #[test] | |
144 | fn test_iterator_enumerate() { | |
85aaf69f | 145 | let xs = [0, 1, 2, 3, 4, 5]; |
c34b1796 | 146 | let it = xs.iter().enumerate(); |
1a4d82fc JJ |
147 | for (i, &x) in it { |
148 | assert_eq!(i, x); | |
149 | } | |
150 | } | |
151 | ||
d9579d0f AL |
152 | #[test] |
153 | fn test_iterator_enumerate_nth() { | |
154 | let xs = [0, 1, 2, 3, 4, 5]; | |
155 | for (i, &x) in xs.iter().enumerate() { | |
156 | assert_eq!(i, x); | |
157 | } | |
158 | ||
159 | let mut it = xs.iter().enumerate(); | |
160 | while let Some((i, &x)) = it.nth(0) { | |
161 | assert_eq!(i, x); | |
162 | } | |
163 | ||
164 | let mut it = xs.iter().enumerate(); | |
165 | while let Some((i, &x)) = it.nth(1) { | |
166 | assert_eq!(i, x); | |
167 | } | |
168 | ||
169 | let (i, &x) = xs.iter().enumerate().nth(3).unwrap(); | |
170 | assert_eq!(i, x); | |
171 | assert_eq!(i, 3); | |
172 | } | |
173 | ||
174 | #[test] | |
175 | fn test_iterator_enumerate_count() { | |
176 | let xs = [0, 1, 2, 3, 4, 5]; | |
177 | assert_eq!(xs.iter().count(), 6); | |
178 | } | |
179 | ||
1a4d82fc JJ |
180 | #[test] |
181 | fn test_iterator_peekable() { | |
85aaf69f SL |
182 | let xs = vec![0, 1, 2, 3, 4, 5]; |
183 | let mut it = xs.iter().cloned().peekable(); | |
184 | ||
185 | assert_eq!(it.len(), 6); | |
1a4d82fc | 186 | assert_eq!(it.peek().unwrap(), &0); |
85aaf69f | 187 | assert_eq!(it.len(), 6); |
1a4d82fc | 188 | assert_eq!(it.next().unwrap(), 0); |
85aaf69f | 189 | assert_eq!(it.len(), 5); |
1a4d82fc | 190 | assert_eq!(it.next().unwrap(), 1); |
85aaf69f | 191 | assert_eq!(it.len(), 4); |
1a4d82fc | 192 | assert_eq!(it.next().unwrap(), 2); |
85aaf69f | 193 | assert_eq!(it.len(), 3); |
1a4d82fc | 194 | assert_eq!(it.peek().unwrap(), &3); |
85aaf69f | 195 | assert_eq!(it.len(), 3); |
1a4d82fc | 196 | assert_eq!(it.peek().unwrap(), &3); |
85aaf69f | 197 | assert_eq!(it.len(), 3); |
1a4d82fc | 198 | assert_eq!(it.next().unwrap(), 3); |
85aaf69f | 199 | assert_eq!(it.len(), 2); |
1a4d82fc | 200 | assert_eq!(it.next().unwrap(), 4); |
85aaf69f | 201 | assert_eq!(it.len(), 1); |
1a4d82fc | 202 | assert_eq!(it.peek().unwrap(), &5); |
85aaf69f | 203 | assert_eq!(it.len(), 1); |
1a4d82fc | 204 | assert_eq!(it.next().unwrap(), 5); |
85aaf69f | 205 | assert_eq!(it.len(), 0); |
1a4d82fc | 206 | assert!(it.peek().is_none()); |
85aaf69f | 207 | assert_eq!(it.len(), 0); |
1a4d82fc | 208 | assert!(it.next().is_none()); |
85aaf69f | 209 | assert_eq!(it.len(), 0); |
1a4d82fc JJ |
210 | } |
211 | ||
d9579d0f AL |
212 | #[test] |
213 | fn test_iterator_peekable_count() { | |
214 | let xs = [0, 1, 2, 3, 4, 5]; | |
215 | let ys = [10]; | |
216 | let zs: [i32; 0] = []; | |
217 | ||
218 | assert_eq!(xs.iter().peekable().count(), 6); | |
219 | ||
220 | let mut it = xs.iter().peekable(); | |
221 | assert_eq!(it.peek(), Some(&&0)); | |
222 | assert_eq!(it.count(), 6); | |
223 | ||
224 | assert_eq!(ys.iter().peekable().count(), 1); | |
225 | ||
226 | let mut it = ys.iter().peekable(); | |
227 | assert_eq!(it.peek(), Some(&&10)); | |
228 | assert_eq!(it.count(), 1); | |
229 | ||
230 | assert_eq!(zs.iter().peekable().count(), 0); | |
231 | ||
232 | let mut it = zs.iter().peekable(); | |
233 | assert_eq!(it.peek(), None); | |
234 | ||
235 | } | |
236 | ||
237 | #[test] | |
238 | fn test_iterator_peekable_nth() { | |
239 | let xs = [0, 1, 2, 3, 4, 5]; | |
240 | let mut it = xs.iter().peekable(); | |
241 | ||
242 | assert_eq!(it.peek(), Some(&&0)); | |
243 | assert_eq!(it.nth(0), Some(&0)); | |
244 | assert_eq!(it.peek(), Some(&&1)); | |
245 | assert_eq!(it.nth(1), Some(&2)); | |
246 | assert_eq!(it.peek(), Some(&&3)); | |
247 | assert_eq!(it.nth(2), Some(&5)); | |
248 | assert_eq!(it.next(), None); | |
249 | } | |
250 | ||
251 | #[test] | |
252 | fn test_iterator_peekable_last() { | |
253 | let xs = [0, 1, 2, 3, 4, 5]; | |
254 | let ys = [0]; | |
255 | ||
256 | let mut it = xs.iter().peekable(); | |
257 | assert_eq!(it.peek(), Some(&&0)); | |
258 | assert_eq!(it.last(), Some(&5)); | |
259 | ||
260 | let mut it = ys.iter().peekable(); | |
261 | assert_eq!(it.peek(), Some(&&0)); | |
262 | assert_eq!(it.last(), Some(&0)); | |
263 | } | |
264 | ||
1a4d82fc JJ |
265 | #[test] |
266 | fn test_iterator_take_while() { | |
85aaf69f SL |
267 | let xs = [0, 1, 2, 3, 5, 13, 15, 16, 17, 19]; |
268 | let ys = [0, 1, 2, 3, 5, 13]; | |
c34b1796 | 269 | let it = xs.iter().take_while(|&x| *x < 15); |
1a4d82fc JJ |
270 | let mut i = 0; |
271 | for x in it { | |
272 | assert_eq!(*x, ys[i]); | |
273 | i += 1; | |
274 | } | |
275 | assert_eq!(i, ys.len()); | |
276 | } | |
277 | ||
278 | #[test] | |
279 | fn test_iterator_skip_while() { | |
85aaf69f | 280 | let xs = [0, 1, 2, 3, 5, 13, 15, 16, 17, 19]; |
1a4d82fc | 281 | let ys = [15, 16, 17, 19]; |
c34b1796 | 282 | let it = xs.iter().skip_while(|&x| *x < 15); |
1a4d82fc JJ |
283 | let mut i = 0; |
284 | for x in it { | |
285 | assert_eq!(*x, ys[i]); | |
286 | i += 1; | |
287 | } | |
288 | assert_eq!(i, ys.len()); | |
289 | } | |
290 | ||
291 | #[test] | |
292 | fn test_iterator_skip() { | |
85aaf69f | 293 | let xs = [0, 1, 2, 3, 5, 13, 15, 16, 17, 19, 20, 30]; |
1a4d82fc JJ |
294 | let ys = [13, 15, 16, 17, 19, 20, 30]; |
295 | let mut it = xs.iter().skip(5); | |
296 | let mut i = 0; | |
85aaf69f | 297 | while let Some(&x) = it.next() { |
1a4d82fc JJ |
298 | assert_eq!(x, ys[i]); |
299 | i += 1; | |
85aaf69f | 300 | assert_eq!(it.len(), xs.len()-5-i); |
1a4d82fc JJ |
301 | } |
302 | assert_eq!(i, ys.len()); | |
85aaf69f | 303 | assert_eq!(it.len(), 0); |
1a4d82fc JJ |
304 | } |
305 | ||
d9579d0f AL |
306 | #[test] |
307 | fn test_iterator_skip_nth() { | |
308 | let xs = [0, 1, 2, 3, 5, 13, 15, 16, 17, 19, 20, 30]; | |
309 | ||
310 | let mut it = xs.iter().skip(0); | |
311 | assert_eq!(it.nth(0), Some(&0)); | |
312 | assert_eq!(it.nth(1), Some(&2)); | |
313 | ||
314 | let mut it = xs.iter().skip(5); | |
315 | assert_eq!(it.nth(0), Some(&13)); | |
316 | assert_eq!(it.nth(1), Some(&16)); | |
317 | ||
318 | let mut it = xs.iter().skip(12); | |
319 | assert_eq!(it.nth(0), None); | |
320 | ||
321 | } | |
322 | ||
323 | #[test] | |
324 | fn test_iterator_skip_count() { | |
325 | let xs = [0, 1, 2, 3, 5, 13, 15, 16, 17, 19, 20, 30]; | |
326 | ||
327 | assert_eq!(xs.iter().skip(0).count(), 12); | |
328 | assert_eq!(xs.iter().skip(1).count(), 11); | |
329 | assert_eq!(xs.iter().skip(11).count(), 1); | |
330 | assert_eq!(xs.iter().skip(12).count(), 0); | |
331 | assert_eq!(xs.iter().skip(13).count(), 0); | |
332 | } | |
333 | ||
334 | #[test] | |
335 | fn test_iterator_skip_last() { | |
336 | let xs = [0, 1, 2, 3, 5, 13, 15, 16, 17, 19, 20, 30]; | |
337 | ||
338 | assert_eq!(xs.iter().skip(0).last(), Some(&30)); | |
339 | assert_eq!(xs.iter().skip(1).last(), Some(&30)); | |
340 | assert_eq!(xs.iter().skip(11).last(), Some(&30)); | |
341 | assert_eq!(xs.iter().skip(12).last(), None); | |
342 | assert_eq!(xs.iter().skip(13).last(), None); | |
343 | ||
344 | let mut it = xs.iter().skip(5); | |
345 | assert_eq!(it.next(), Some(&13)); | |
346 | assert_eq!(it.last(), Some(&30)); | |
347 | } | |
348 | ||
1a4d82fc JJ |
349 | #[test] |
350 | fn test_iterator_take() { | |
85aaf69f SL |
351 | let xs = [0, 1, 2, 3, 5, 13, 15, 16, 17, 19]; |
352 | let ys = [0, 1, 2, 3, 5]; | |
1a4d82fc JJ |
353 | let mut it = xs.iter().take(5); |
354 | let mut i = 0; | |
85aaf69f SL |
355 | assert_eq!(it.len(), 5); |
356 | while let Some(&x) = it.next() { | |
357 | assert_eq!(x, ys[i]); | |
358 | i += 1; | |
359 | assert_eq!(it.len(), 5-i); | |
360 | } | |
361 | assert_eq!(i, ys.len()); | |
362 | assert_eq!(it.len(), 0); | |
363 | } | |
364 | ||
d9579d0f AL |
365 | #[test] |
366 | fn test_iterator_take_nth() { | |
367 | let xs = [0, 1, 2, 4, 5]; | |
368 | let mut it = xs.iter(); | |
369 | { | |
370 | let mut take = it.by_ref().take(3); | |
371 | let mut i = 0; | |
372 | while let Some(&x) = take.nth(0) { | |
373 | assert_eq!(x, i); | |
374 | i += 1; | |
375 | } | |
376 | } | |
377 | assert_eq!(it.nth(1), Some(&5)); | |
378 | assert_eq!(it.nth(0), None); | |
379 | ||
380 | let xs = [0, 1, 2, 3, 4]; | |
381 | let mut it = xs.iter().take(7); | |
382 | let mut i = 1; | |
383 | while let Some(&x) = it.nth(1) { | |
384 | assert_eq!(x, i); | |
385 | i += 2; | |
386 | } | |
387 | } | |
388 | ||
85aaf69f SL |
389 | #[test] |
390 | fn test_iterator_take_short() { | |
391 | let xs = [0, 1, 2, 3]; | |
392 | let ys = [0, 1, 2, 3]; | |
393 | let mut it = xs.iter().take(5); | |
394 | let mut i = 0; | |
395 | assert_eq!(it.len(), 4); | |
396 | while let Some(&x) = it.next() { | |
1a4d82fc JJ |
397 | assert_eq!(x, ys[i]); |
398 | i += 1; | |
85aaf69f | 399 | assert_eq!(it.len(), 4-i); |
1a4d82fc JJ |
400 | } |
401 | assert_eq!(i, ys.len()); | |
85aaf69f | 402 | assert_eq!(it.len(), 0); |
1a4d82fc JJ |
403 | } |
404 | ||
405 | #[test] | |
406 | fn test_iterator_scan() { | |
407 | // test the type inference | |
c34b1796 AL |
408 | fn add(old: &mut isize, new: &usize) -> Option<f64> { |
409 | *old += *new as isize; | |
1a4d82fc JJ |
410 | Some(*old as f64) |
411 | } | |
85aaf69f | 412 | let xs = [0, 1, 2, 3, 4]; |
1a4d82fc JJ |
413 | let ys = [0f64, 1.0, 3.0, 6.0, 10.0]; |
414 | ||
c34b1796 | 415 | let it = xs.iter().scan(0, add); |
1a4d82fc JJ |
416 | let mut i = 0; |
417 | for x in it { | |
418 | assert_eq!(x, ys[i]); | |
419 | i += 1; | |
420 | } | |
421 | assert_eq!(i, ys.len()); | |
422 | } | |
423 | ||
424 | #[test] | |
425 | fn test_iterator_flat_map() { | |
85aaf69f SL |
426 | let xs = [0, 3, 6]; |
427 | let ys = [0, 1, 2, 3, 4, 5, 6, 7, 8]; | |
c34b1796 | 428 | let it = xs.iter().flat_map(|&x| (x..).step_by(1).take(3)); |
1a4d82fc JJ |
429 | let mut i = 0; |
430 | for x in it { | |
431 | assert_eq!(x, ys[i]); | |
432 | i += 1; | |
433 | } | |
434 | assert_eq!(i, ys.len()); | |
435 | } | |
436 | ||
437 | #[test] | |
438 | fn test_inspect() { | |
85aaf69f SL |
439 | let xs = [1, 2, 3, 4]; |
440 | let mut n = 0; | |
1a4d82fc JJ |
441 | |
442 | let ys = xs.iter() | |
85aaf69f | 443 | .cloned() |
1a4d82fc | 444 | .inspect(|_| n += 1) |
c34b1796 | 445 | .collect::<Vec<usize>>(); |
1a4d82fc JJ |
446 | |
447 | assert_eq!(n, xs.len()); | |
85aaf69f | 448 | assert_eq!(&xs[..], &ys[..]); |
1a4d82fc JJ |
449 | } |
450 | ||
1a4d82fc JJ |
451 | #[test] |
452 | fn test_cycle() { | |
453 | let cycle_len = 3; | |
c34b1796 AL |
454 | let it = (0..).step_by(1).take(cycle_len).cycle(); |
455 | assert_eq!(it.size_hint(), (usize::MAX, None)); | |
1a4d82fc JJ |
456 | for (i, x) in it.take(100).enumerate() { |
457 | assert_eq!(i % cycle_len, x); | |
458 | } | |
459 | ||
c34b1796 | 460 | let mut it = (0..).step_by(1).take(0).cycle(); |
1a4d82fc JJ |
461 | assert_eq!(it.size_hint(), (0, Some(0))); |
462 | assert_eq!(it.next(), None); | |
463 | } | |
464 | ||
465 | #[test] | |
466 | fn test_iterator_nth() { | |
85aaf69f SL |
467 | let v: &[_] = &[0, 1, 2, 3, 4]; |
468 | for i in 0..v.len() { | |
1a4d82fc JJ |
469 | assert_eq!(v.iter().nth(i).unwrap(), &v[i]); |
470 | } | |
471 | assert_eq!(v.iter().nth(v.len()), None); | |
472 | } | |
473 | ||
474 | #[test] | |
475 | fn test_iterator_last() { | |
85aaf69f | 476 | let v: &[_] = &[0, 1, 2, 3, 4]; |
1a4d82fc JJ |
477 | assert_eq!(v.iter().last().unwrap(), &4); |
478 | assert_eq!(v[..1].iter().last().unwrap(), &0); | |
479 | } | |
480 | ||
481 | #[test] | |
482 | fn test_iterator_len() { | |
85aaf69f | 483 | let v: &[_] = &[0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10]; |
1a4d82fc JJ |
484 | assert_eq!(v[..4].iter().count(), 4); |
485 | assert_eq!(v[..10].iter().count(), 10); | |
85aaf69f | 486 | assert_eq!(v[..0].iter().count(), 0); |
1a4d82fc JJ |
487 | } |
488 | ||
489 | #[test] | |
490 | fn test_iterator_sum() { | |
85aaf69f | 491 | let v: &[i32] = &[0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10]; |
9346a6ac AL |
492 | assert_eq!(v[..4].iter().cloned().sum::<i32>(), 6); |
493 | assert_eq!(v.iter().cloned().sum::<i32>(), 55); | |
494 | assert_eq!(v[..0].iter().cloned().sum::<i32>(), 0); | |
1a4d82fc JJ |
495 | } |
496 | ||
497 | #[test] | |
498 | fn test_iterator_product() { | |
85aaf69f | 499 | let v: &[i32] = &[0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10]; |
9346a6ac AL |
500 | assert_eq!(v[..4].iter().cloned().product::<i32>(), 0); |
501 | assert_eq!(v[1..5].iter().cloned().product::<i32>(), 24); | |
502 | assert_eq!(v[..0].iter().cloned().product::<i32>(), 1); | |
1a4d82fc JJ |
503 | } |
504 | ||
505 | #[test] | |
506 | fn test_iterator_max() { | |
85aaf69f SL |
507 | let v: &[_] = &[0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10]; |
508 | assert_eq!(v[..4].iter().cloned().max(), Some(3)); | |
509 | assert_eq!(v.iter().cloned().max(), Some(10)); | |
510 | assert_eq!(v[..0].iter().cloned().max(), None); | |
1a4d82fc JJ |
511 | } |
512 | ||
513 | #[test] | |
514 | fn test_iterator_min() { | |
85aaf69f SL |
515 | let v: &[_] = &[0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10]; |
516 | assert_eq!(v[..4].iter().cloned().min(), Some(0)); | |
517 | assert_eq!(v.iter().cloned().min(), Some(0)); | |
518 | assert_eq!(v[..0].iter().cloned().min(), None); | |
1a4d82fc JJ |
519 | } |
520 | ||
521 | #[test] | |
522 | fn test_iterator_size_hint() { | |
c34b1796 | 523 | let c = (0..).step_by(1); |
85aaf69f SL |
524 | let v: &[_] = &[0, 1, 2, 3, 4, 5, 6, 7, 8, 9]; |
525 | let v2 = &[10, 11, 12]; | |
1a4d82fc JJ |
526 | let vi = v.iter(); |
527 | ||
c34b1796 | 528 | assert_eq!(c.size_hint(), (usize::MAX, None)); |
85aaf69f SL |
529 | assert_eq!(vi.clone().size_hint(), (10, Some(10))); |
530 | ||
531 | assert_eq!(c.clone().take(5).size_hint(), (5, Some(5))); | |
532 | assert_eq!(c.clone().skip(5).size_hint().1, None); | |
533 | assert_eq!(c.clone().take_while(|_| false).size_hint(), (0, None)); | |
534 | assert_eq!(c.clone().skip_while(|_| false).size_hint(), (0, None)); | |
c34b1796 AL |
535 | assert_eq!(c.clone().enumerate().size_hint(), (usize::MAX, None)); |
536 | assert_eq!(c.clone().chain(vi.clone().cloned()).size_hint(), (usize::MAX, None)); | |
85aaf69f SL |
537 | assert_eq!(c.clone().zip(vi.clone()).size_hint(), (10, Some(10))); |
538 | assert_eq!(c.clone().scan(0, |_,_| Some(0)).size_hint(), (0, None)); | |
539 | assert_eq!(c.clone().filter(|_| false).size_hint(), (0, None)); | |
c34b1796 | 540 | assert_eq!(c.clone().map(|_| 0).size_hint(), (usize::MAX, None)); |
85aaf69f SL |
541 | assert_eq!(c.filter_map(|_| Some(0)).size_hint(), (0, None)); |
542 | ||
543 | assert_eq!(vi.clone().take(5).size_hint(), (5, Some(5))); | |
544 | assert_eq!(vi.clone().take(12).size_hint(), (10, Some(10))); | |
545 | assert_eq!(vi.clone().skip(3).size_hint(), (7, Some(7))); | |
546 | assert_eq!(vi.clone().skip(12).size_hint(), (0, Some(0))); | |
547 | assert_eq!(vi.clone().take_while(|_| false).size_hint(), (0, Some(10))); | |
548 | assert_eq!(vi.clone().skip_while(|_| false).size_hint(), (0, Some(10))); | |
549 | assert_eq!(vi.clone().enumerate().size_hint(), (10, Some(10))); | |
62682a34 SL |
550 | assert_eq!(vi.clone().chain(v2).size_hint(), (13, Some(13))); |
551 | assert_eq!(vi.clone().zip(v2).size_hint(), (3, Some(3))); | |
85aaf69f SL |
552 | assert_eq!(vi.clone().scan(0, |_,_| Some(0)).size_hint(), (0, Some(10))); |
553 | assert_eq!(vi.clone().filter(|_| false).size_hint(), (0, Some(10))); | |
554 | assert_eq!(vi.clone().map(|&i| i+1).size_hint(), (10, Some(10))); | |
555 | assert_eq!(vi.filter_map(|_| Some(0)).size_hint(), (0, Some(10))); | |
1a4d82fc JJ |
556 | } |
557 | ||
558 | #[test] | |
559 | fn test_collect() { | |
85aaf69f | 560 | let a = vec![1, 2, 3, 4, 5]; |
c34b1796 | 561 | let b: Vec<isize> = a.iter().cloned().collect(); |
1a4d82fc JJ |
562 | assert!(a == b); |
563 | } | |
564 | ||
565 | #[test] | |
566 | fn test_all() { | |
c34b1796 AL |
567 | // FIXME (#22405): Replace `Box::new` with `box` here when/if possible. |
568 | let v: Box<[isize]> = Box::new([1, 2, 3, 4, 5]); | |
1a4d82fc JJ |
569 | assert!(v.iter().all(|&x| x < 10)); |
570 | assert!(!v.iter().all(|&x| x % 2 == 0)); | |
571 | assert!(!v.iter().all(|&x| x > 100)); | |
85aaf69f | 572 | assert!(v[..0].iter().all(|_| panic!())); |
1a4d82fc JJ |
573 | } |
574 | ||
575 | #[test] | |
576 | fn test_any() { | |
c34b1796 AL |
577 | // FIXME (#22405): Replace `Box::new` with `box` here when/if possible. |
578 | let v: Box<[isize]> = Box::new([1, 2, 3, 4, 5]); | |
1a4d82fc JJ |
579 | assert!(v.iter().any(|&x| x < 10)); |
580 | assert!(v.iter().any(|&x| x % 2 == 0)); | |
581 | assert!(!v.iter().any(|&x| x > 100)); | |
85aaf69f | 582 | assert!(!v[..0].iter().any(|_| panic!())); |
1a4d82fc JJ |
583 | } |
584 | ||
585 | #[test] | |
586 | fn test_find() { | |
c34b1796 | 587 | let v: &[isize] = &[1, 3, 9, 27, 103, 14, 11]; |
1a4d82fc JJ |
588 | assert_eq!(*v.iter().find(|&&x| x & 1 == 0).unwrap(), 14); |
589 | assert_eq!(*v.iter().find(|&&x| x % 3 == 0).unwrap(), 3); | |
590 | assert!(v.iter().find(|&&x| x % 12 == 0).is_none()); | |
591 | } | |
592 | ||
593 | #[test] | |
594 | fn test_position() { | |
85aaf69f | 595 | let v = &[1, 3, 9, 27, 103, 14, 11]; |
1a4d82fc JJ |
596 | assert_eq!(v.iter().position(|x| *x & 1 == 0).unwrap(), 5); |
597 | assert_eq!(v.iter().position(|x| *x % 3 == 0).unwrap(), 1); | |
598 | assert!(v.iter().position(|x| *x % 12 == 0).is_none()); | |
599 | } | |
600 | ||
601 | #[test] | |
602 | fn test_count() { | |
85aaf69f | 603 | let xs = &[1, 2, 2, 1, 5, 9, 0, 2]; |
1a4d82fc JJ |
604 | assert_eq!(xs.iter().filter(|x| **x == 2).count(), 3); |
605 | assert_eq!(xs.iter().filter(|x| **x == 5).count(), 1); | |
606 | assert_eq!(xs.iter().filter(|x| **x == 95).count(), 0); | |
607 | } | |
608 | ||
609 | #[test] | |
610 | fn test_max_by() { | |
c34b1796 | 611 | let xs: &[isize] = &[-3, 0, 1, 5, -10]; |
1a4d82fc JJ |
612 | assert_eq!(*xs.iter().max_by(|x| x.abs()).unwrap(), -10); |
613 | } | |
614 | ||
615 | #[test] | |
616 | fn test_min_by() { | |
c34b1796 | 617 | let xs: &[isize] = &[-3, 0, 1, 5, -10]; |
1a4d82fc JJ |
618 | assert_eq!(*xs.iter().min_by(|x| x.abs()).unwrap(), 0); |
619 | } | |
620 | ||
621 | #[test] | |
622 | fn test_by_ref() { | |
85aaf69f | 623 | let mut xs = 0..10; |
1a4d82fc JJ |
624 | // sum the first five values |
625 | let partial_sum = xs.by_ref().take(5).fold(0, |a, b| a + b); | |
626 | assert_eq!(partial_sum, 10); | |
627 | assert_eq!(xs.next(), Some(5)); | |
628 | } | |
629 | ||
630 | #[test] | |
631 | fn test_rev() { | |
85aaf69f | 632 | let xs = [2, 4, 6, 8, 10, 12, 14, 16]; |
1a4d82fc JJ |
633 | let mut it = xs.iter(); |
634 | it.next(); | |
635 | it.next(); | |
c34b1796 | 636 | assert!(it.rev().cloned().collect::<Vec<isize>>() == |
1a4d82fc JJ |
637 | vec![16, 14, 12, 10, 8, 6]); |
638 | } | |
639 | ||
640 | #[test] | |
641 | fn test_cloned() { | |
642 | let xs = [2u8, 4, 6, 8]; | |
643 | ||
644 | let mut it = xs.iter().cloned(); | |
645 | assert_eq!(it.len(), 4); | |
646 | assert_eq!(it.next(), Some(2)); | |
647 | assert_eq!(it.len(), 3); | |
648 | assert_eq!(it.next(), Some(4)); | |
649 | assert_eq!(it.len(), 2); | |
650 | assert_eq!(it.next_back(), Some(8)); | |
651 | assert_eq!(it.len(), 1); | |
652 | assert_eq!(it.next_back(), Some(6)); | |
653 | assert_eq!(it.len(), 0); | |
654 | assert_eq!(it.next_back(), None); | |
655 | } | |
656 | ||
657 | #[test] | |
658 | fn test_double_ended_map() { | |
85aaf69f | 659 | let xs = [1, 2, 3, 4, 5, 6]; |
1a4d82fc JJ |
660 | let mut it = xs.iter().map(|&x| x * -1); |
661 | assert_eq!(it.next(), Some(-1)); | |
662 | assert_eq!(it.next(), Some(-2)); | |
663 | assert_eq!(it.next_back(), Some(-6)); | |
664 | assert_eq!(it.next_back(), Some(-5)); | |
665 | assert_eq!(it.next(), Some(-3)); | |
666 | assert_eq!(it.next_back(), Some(-4)); | |
667 | assert_eq!(it.next(), None); | |
668 | } | |
669 | ||
670 | #[test] | |
671 | fn test_double_ended_enumerate() { | |
85aaf69f SL |
672 | let xs = [1, 2, 3, 4, 5, 6]; |
673 | let mut it = xs.iter().cloned().enumerate(); | |
1a4d82fc JJ |
674 | assert_eq!(it.next(), Some((0, 1))); |
675 | assert_eq!(it.next(), Some((1, 2))); | |
676 | assert_eq!(it.next_back(), Some((5, 6))); | |
677 | assert_eq!(it.next_back(), Some((4, 5))); | |
678 | assert_eq!(it.next_back(), Some((3, 4))); | |
679 | assert_eq!(it.next_back(), Some((2, 3))); | |
680 | assert_eq!(it.next(), None); | |
681 | } | |
682 | ||
683 | #[test] | |
684 | fn test_double_ended_zip() { | |
85aaf69f SL |
685 | let xs = [1, 2, 3, 4, 5, 6]; |
686 | let ys = [1, 2, 3, 7]; | |
687 | let a = xs.iter().cloned(); | |
688 | let b = ys.iter().cloned(); | |
1a4d82fc JJ |
689 | let mut it = a.zip(b); |
690 | assert_eq!(it.next(), Some((1, 1))); | |
691 | assert_eq!(it.next(), Some((2, 2))); | |
692 | assert_eq!(it.next_back(), Some((4, 7))); | |
693 | assert_eq!(it.next_back(), Some((3, 3))); | |
694 | assert_eq!(it.next(), None); | |
695 | } | |
696 | ||
697 | #[test] | |
698 | fn test_double_ended_filter() { | |
85aaf69f | 699 | let xs = [1, 2, 3, 4, 5, 6]; |
1a4d82fc JJ |
700 | let mut it = xs.iter().filter(|&x| *x & 1 == 0); |
701 | assert_eq!(it.next_back().unwrap(), &6); | |
702 | assert_eq!(it.next_back().unwrap(), &4); | |
703 | assert_eq!(it.next().unwrap(), &2); | |
704 | assert_eq!(it.next_back(), None); | |
705 | } | |
706 | ||
707 | #[test] | |
708 | fn test_double_ended_filter_map() { | |
85aaf69f | 709 | let xs = [1, 2, 3, 4, 5, 6]; |
1a4d82fc JJ |
710 | let mut it = xs.iter().filter_map(|&x| if x & 1 == 0 { Some(x * 2) } else { None }); |
711 | assert_eq!(it.next_back().unwrap(), 12); | |
712 | assert_eq!(it.next_back().unwrap(), 8); | |
713 | assert_eq!(it.next().unwrap(), 4); | |
714 | assert_eq!(it.next_back(), None); | |
715 | } | |
716 | ||
717 | #[test] | |
718 | fn test_double_ended_chain() { | |
85aaf69f SL |
719 | let xs = [1, 2, 3, 4, 5]; |
720 | let ys = [7, 9, 11]; | |
62682a34 | 721 | let mut it = xs.iter().chain(&ys).rev(); |
1a4d82fc JJ |
722 | assert_eq!(it.next().unwrap(), &11); |
723 | assert_eq!(it.next().unwrap(), &9); | |
724 | assert_eq!(it.next_back().unwrap(), &1); | |
725 | assert_eq!(it.next_back().unwrap(), &2); | |
726 | assert_eq!(it.next_back().unwrap(), &3); | |
727 | assert_eq!(it.next_back().unwrap(), &4); | |
728 | assert_eq!(it.next_back().unwrap(), &5); | |
729 | assert_eq!(it.next_back().unwrap(), &7); | |
730 | assert_eq!(it.next_back(), None); | |
e9174d1e SL |
731 | |
732 | ||
733 | // test that .chain() is well behaved with an unfused iterator | |
734 | struct CrazyIterator(bool); | |
735 | impl CrazyIterator { fn new() -> CrazyIterator { CrazyIterator(false) } } | |
736 | impl Iterator for CrazyIterator { | |
737 | type Item = i32; | |
738 | fn next(&mut self) -> Option<i32> { | |
739 | if self.0 { Some(99) } else { self.0 = true; None } | |
740 | } | |
741 | } | |
742 | ||
743 | impl DoubleEndedIterator for CrazyIterator { | |
744 | fn next_back(&mut self) -> Option<i32> { | |
745 | self.next() | |
746 | } | |
747 | } | |
748 | ||
749 | assert_eq!(CrazyIterator::new().chain(0..10).rev().last(), Some(0)); | |
750 | assert!((0..10).chain(CrazyIterator::new()).rev().any(|i| i == 0)); | |
1a4d82fc JJ |
751 | } |
752 | ||
753 | #[test] | |
754 | fn test_rposition() { | |
c34b1796 AL |
755 | fn f(xy: &(isize, char)) -> bool { let (_x, y) = *xy; y == 'b' } |
756 | fn g(xy: &(isize, char)) -> bool { let (_x, y) = *xy; y == 'd' } | |
85aaf69f | 757 | let v = [(0, 'a'), (1, 'b'), (2, 'c'), (3, 'b')]; |
1a4d82fc | 758 | |
85aaf69f | 759 | assert_eq!(v.iter().rposition(f), Some(3)); |
1a4d82fc JJ |
760 | assert!(v.iter().rposition(g).is_none()); |
761 | } | |
762 | ||
763 | #[test] | |
c34b1796 | 764 | #[should_panic] |
1a4d82fc | 765 | fn test_rposition_panic() { |
c34b1796 AL |
766 | let v: [(Box<_>, Box<_>); 4] = |
767 | [(box 0, box 0), (box 0, box 0), | |
768 | (box 0, box 0), (box 0, box 0)]; | |
85aaf69f | 769 | let mut i = 0; |
1a4d82fc JJ |
770 | v.iter().rposition(|_elt| { |
771 | if i == 2 { | |
772 | panic!() | |
773 | } | |
774 | i += 1; | |
775 | false | |
776 | }); | |
777 | } | |
778 | ||
779 | ||
1a4d82fc JJ |
780 | #[test] |
781 | fn test_double_ended_flat_map() { | |
85aaf69f SL |
782 | let u = [0,1]; |
783 | let v = [5,6,7,8]; | |
62682a34 | 784 | let mut it = u.iter().flat_map(|x| &v[*x..v.len()]); |
1a4d82fc JJ |
785 | assert_eq!(it.next_back().unwrap(), &8); |
786 | assert_eq!(it.next().unwrap(), &5); | |
787 | assert_eq!(it.next_back().unwrap(), &7); | |
788 | assert_eq!(it.next_back().unwrap(), &6); | |
789 | assert_eq!(it.next_back().unwrap(), &8); | |
790 | assert_eq!(it.next().unwrap(), &6); | |
791 | assert_eq!(it.next_back().unwrap(), &7); | |
792 | assert_eq!(it.next_back(), None); | |
793 | assert_eq!(it.next(), None); | |
794 | assert_eq!(it.next_back(), None); | |
795 | } | |
796 | ||
1a4d82fc JJ |
797 | #[test] |
798 | fn test_double_ended_range() { | |
c34b1796 | 799 | assert_eq!((11..14).rev().collect::<Vec<_>>(), [13, 12, 11]); |
85aaf69f | 800 | for _ in (10..0).rev() { |
1a4d82fc JJ |
801 | panic!("unreachable"); |
802 | } | |
803 | ||
c34b1796 | 804 | assert_eq!((11..14).rev().collect::<Vec<_>>(), [13, 12, 11]); |
85aaf69f | 805 | for _ in (10..0).rev() { |
1a4d82fc JJ |
806 | panic!("unreachable"); |
807 | } | |
808 | } | |
809 | ||
810 | #[test] | |
811 | fn test_range() { | |
c34b1796 AL |
812 | assert_eq!((0..5).collect::<Vec<_>>(), [0, 1, 2, 3, 4]); |
813 | assert_eq!((-10..-1).collect::<Vec<_>>(), [-10, -9, -8, -7, -6, -5, -4, -3, -2]); | |
814 | assert_eq!((0..5).rev().collect::<Vec<_>>(), [4, 3, 2, 1, 0]); | |
85aaf69f SL |
815 | assert_eq!((200..-5).count(), 0); |
816 | assert_eq!((200..-5).rev().count(), 0); | |
817 | assert_eq!((200..200).count(), 0); | |
818 | assert_eq!((200..200).rev().count(), 0); | |
1a4d82fc | 819 | |
85aaf69f | 820 | assert_eq!((0..100).size_hint(), (100, Some(100))); |
c34b1796 AL |
821 | // this test is only meaningful when sizeof usize < sizeof u64 |
822 | assert_eq!((usize::MAX - 1..usize::MAX).size_hint(), (1, Some(1))); | |
85aaf69f SL |
823 | assert_eq!((-10..-1).size_hint(), (9, Some(9))); |
824 | assert_eq!((-1..-10).size_hint(), (0, Some(0))); | |
d9579d0f AL |
825 | |
826 | assert_eq!((-70..58i8).size_hint(), (128, Some(128))); | |
827 | assert_eq!((-128..127i8).size_hint(), (255, Some(255))); | |
828 | assert_eq!((-2..isize::MAX).size_hint(), | |
829 | (isize::MAX as usize + 2, Some(isize::MAX as usize + 2))); | |
1a4d82fc JJ |
830 | } |
831 | ||
832 | #[test] | |
1a4d82fc | 833 | fn test_range_step() { |
c34b1796 AL |
834 | assert_eq!((0..20).step_by(5).collect::<Vec<isize>>(), [0, 5, 10, 15]); |
835 | assert_eq!((20..0).step_by(-5).collect::<Vec<isize>>(), [20, 15, 10, 5]); | |
836 | assert_eq!((20..0).step_by(-6).collect::<Vec<isize>>(), [20, 14, 8, 2]); | |
837 | assert_eq!((200..255).step_by(50).collect::<Vec<u8>>(), [200, 250]); | |
838 | assert_eq!((200..-5).step_by(1).collect::<Vec<isize>>(), []); | |
839 | assert_eq!((200..200).step_by(1).collect::<Vec<isize>>(), []); | |
d9579d0f AL |
840 | |
841 | assert_eq!((0..20).step_by(1).size_hint(), (20, Some(20))); | |
842 | assert_eq!((0..20).step_by(21).size_hint(), (1, Some(1))); | |
843 | assert_eq!((0..20).step_by(5).size_hint(), (4, Some(4))); | |
844 | assert_eq!((20..0).step_by(-5).size_hint(), (4, Some(4))); | |
845 | assert_eq!((20..0).step_by(-6).size_hint(), (4, Some(4))); | |
846 | assert_eq!((20..-5).step_by(1).size_hint(), (0, Some(0))); | |
847 | assert_eq!((20..20).step_by(1).size_hint(), (0, Some(0))); | |
848 | assert_eq!((0..1).step_by(0).size_hint(), (0, None)); | |
849 | assert_eq!((i8::MAX..i8::MIN).step_by(i8::MIN).size_hint(), (2, Some(2))); | |
850 | assert_eq!((i16::MIN..i16::MAX).step_by(i16::MAX).size_hint(), (3, Some(3))); | |
851 | assert_eq!((isize::MIN..isize::MAX).step_by(1).size_hint(), (usize::MAX, Some(usize::MAX))); | |
1a4d82fc JJ |
852 | } |
853 | ||
1a4d82fc JJ |
854 | #[test] |
855 | fn test_peekable_is_empty() { | |
85aaf69f | 856 | let a = [1]; |
1a4d82fc JJ |
857 | let mut it = a.iter().peekable(); |
858 | assert!( !it.is_empty() ); | |
859 | it.next(); | |
860 | assert!( it.is_empty() ); | |
861 | } | |
862 | ||
1a4d82fc JJ |
863 | #[test] |
864 | fn test_repeat() { | |
85aaf69f SL |
865 | let mut it = repeat(42); |
866 | assert_eq!(it.next(), Some(42)); | |
867 | assert_eq!(it.next(), Some(42)); | |
868 | assert_eq!(it.next(), Some(42)); | |
869 | } | |
870 | ||
871 | #[test] | |
872 | fn test_fuse() { | |
873 | let mut it = 0..3; | |
874 | assert_eq!(it.len(), 3); | |
875 | assert_eq!(it.next(), Some(0)); | |
876 | assert_eq!(it.len(), 2); | |
877 | assert_eq!(it.next(), Some(1)); | |
878 | assert_eq!(it.len(), 1); | |
879 | assert_eq!(it.next(), Some(2)); | |
880 | assert_eq!(it.len(), 0); | |
881 | assert_eq!(it.next(), None); | |
882 | assert_eq!(it.len(), 0); | |
883 | assert_eq!(it.next(), None); | |
884 | assert_eq!(it.len(), 0); | |
885 | assert_eq!(it.next(), None); | |
886 | assert_eq!(it.len(), 0); | |
1a4d82fc JJ |
887 | } |
888 | ||
d9579d0f AL |
889 | #[test] |
890 | fn test_fuse_nth() { | |
891 | let xs = [0, 1, 2]; | |
892 | let mut it = xs.iter(); | |
893 | ||
894 | assert_eq!(it.len(), 3); | |
895 | assert_eq!(it.nth(2), Some(&2)); | |
896 | assert_eq!(it.len(), 0); | |
897 | assert_eq!(it.nth(2), None); | |
898 | assert_eq!(it.len(), 0); | |
899 | } | |
900 | ||
901 | #[test] | |
902 | fn test_fuse_last() { | |
903 | let xs = [0, 1, 2]; | |
904 | let it = xs.iter(); | |
905 | ||
906 | assert_eq!(it.len(), 3); | |
907 | assert_eq!(it.last(), Some(&2)); | |
908 | } | |
909 | ||
910 | #[test] | |
911 | fn test_fuse_count() { | |
912 | let xs = [0, 1, 2]; | |
913 | let it = xs.iter(); | |
914 | ||
915 | assert_eq!(it.len(), 3); | |
916 | assert_eq!(it.count(), 3); | |
917 | // Can't check len now because count consumes. | |
918 | } | |
919 | ||
62682a34 SL |
920 | #[test] |
921 | fn test_once() { | |
922 | let mut it = once(42); | |
923 | assert_eq!(it.next(), Some(42)); | |
924 | assert_eq!(it.next(), None); | |
925 | } | |
926 | ||
927 | #[test] | |
928 | fn test_empty() { | |
929 | let mut it = empty::<i32>(); | |
930 | assert_eq!(it.next(), None); | |
931 | } | |
932 | ||
1a4d82fc JJ |
933 | #[bench] |
934 | fn bench_rposition(b: &mut Bencher) { | |
c34b1796 | 935 | let it: Vec<usize> = (0..300).collect(); |
1a4d82fc JJ |
936 | b.iter(|| { |
937 | it.iter().rposition(|&x| x <= 150); | |
938 | }); | |
939 | } | |
940 | ||
941 | #[bench] | |
942 | fn bench_skip_while(b: &mut Bencher) { | |
943 | b.iter(|| { | |
85aaf69f | 944 | let it = 0..100; |
1a4d82fc JJ |
945 | let mut sum = 0; |
946 | it.skip_while(|&x| { sum += x; sum < 4000 }).all(|_| true); | |
947 | }); | |
948 | } | |
949 | ||
950 | #[bench] | |
951 | fn bench_multiple_take(b: &mut Bencher) { | |
85aaf69f | 952 | let mut it = (0..42).cycle(); |
1a4d82fc JJ |
953 | b.iter(|| { |
954 | let n = it.next().unwrap(); | |
85aaf69f SL |
955 | for _ in 0..n { |
956 | it.clone().take(it.next().unwrap()).all(|_| true); | |
1a4d82fc JJ |
957 | } |
958 | }); | |
959 | } | |
9346a6ac AL |
960 | |
961 | fn scatter(x: i32) -> i32 { (x * 31) % 127 } | |
962 | ||
963 | #[bench] | |
964 | fn bench_max_by(b: &mut Bencher) { | |
965 | b.iter(|| { | |
966 | let it = 0..100; | |
967 | it.max_by(|&x| scatter(x)) | |
968 | }) | |
969 | } | |
970 | ||
971 | // http://www.reddit.com/r/rust/comments/31syce/using_iterators_to_find_the_index_of_the_min_or/ | |
972 | #[bench] | |
973 | fn bench_max_by2(b: &mut Bencher) { | |
974 | fn max_index_iter(array: &[i32]) -> usize { | |
975 | array.iter().enumerate().max_by(|&(_, item)| item).unwrap().0 | |
976 | } | |
977 | ||
978 | let mut data = vec![0i32; 1638]; | |
979 | data[514] = 9999; | |
980 | ||
981 | b.iter(|| max_index_iter(&data)); | |
982 | } | |
983 | ||
984 | #[bench] | |
985 | fn bench_max(b: &mut Bencher) { | |
986 | b.iter(|| { | |
987 | let it = 0..100; | |
988 | it.map(scatter).max() | |
989 | }) | |
990 | } |