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.
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.
12 use core::iter::order::*;
13 use core::iter::MinMaxResult::*;
14 use core::num::SignedInt;
22 let empty: [int; 0] = [];
26 assert!(!lt(xs.iter(), ys.iter()));
27 assert!(!le(xs.iter(), ys.iter()));
28 assert!( gt(xs.iter(), ys.iter()));
29 assert!( ge(xs.iter(), ys.iter()));
31 assert!( lt(ys.iter(), xs.iter()));
32 assert!( le(ys.iter(), xs.iter()));
33 assert!(!gt(ys.iter(), xs.iter()));
34 assert!(!ge(ys.iter(), xs.iter()));
36 assert!( lt(empty.iter(), xs.iter()));
37 assert!( le(empty.iter(), xs.iter()));
38 assert!(!gt(empty.iter(), xs.iter()));
39 assert!(!ge(empty.iter(), xs.iter()));
42 let u = [1.0f64, 2.0];
43 let v = [0.0f64/0.0, 3.0];
45 assert!(!lt(u.iter(), v.iter()));
46 assert!(!le(u.iter(), v.iter()));
47 assert!(!gt(u.iter(), v.iter()));
48 assert!(!ge(u.iter(), v.iter()));
54 assert!(lt(a.iter(), b.iter()) == (a[0] < b[0]));
55 assert!(le(a.iter(), b.iter()) == (a[0] <= b[0]));
56 assert!(gt(a.iter(), b.iter()) == (a[0] > b[0]));
57 assert!(ge(a.iter(), b.iter()) == (a[0] >= b[0]));
59 assert!(lt(c.iter(), b.iter()) == (c[0] < b[0]));
60 assert!(le(c.iter(), b.iter()) == (c[0] <= b[0]));
61 assert!(gt(c.iter(), b.iter()) == (c[0] > b[0]));
62 assert!(ge(c.iter(), b.iter()) == (c[0] >= b[0]));
66 fn test_multi_iter() {
69 assert!(eq(xs.iter(), ys.iter().rev()));
70 assert!(lt(xs.iter(), xs.iter().skip(2)));
74 fn test_counter_from_iter() {
75 let it = count(0, 5).take(10);
76 let xs: Vec<int> = FromIterator::from_iter(it);
77 assert!(xs == vec![0, 5, 10, 15, 20, 25, 30, 35, 40, 45]);
81 fn test_iterator_chain() {
82 let xs = [0, 1, 2, 3, 4, 5];
83 let ys = [30, 40, 50, 60];
84 let expected = [0, 1, 2, 3, 4, 5, 30, 40, 50, 60];
85 let mut it = xs.iter().chain(ys.iter());
88 assert_eq!(x, expected[i]);
91 assert_eq!(i, expected.len());
93 let ys = count(30, 10).take(4);
94 let mut it = xs.iter().map(|&x| x).chain(ys);
97 assert_eq!(x, expected[i]);
100 assert_eq!(i, expected.len());
104 fn test_filter_map() {
105 let it = count(0, 1).take(10)
106 .filter_map(|x| if x % 2 == 0 { Some(x*x) } else { None });
107 assert!(it.collect::<Vec<uint>>() == vec![0*0, 2*2, 4*4, 6*6, 8*8]);
111 fn test_iterator_enumerate() {
112 let xs = [0, 1, 2, 3, 4, 5];
113 let mut it = xs.iter().enumerate();
120 fn test_iterator_peekable() {
121 let xs = vec![0, 1, 2, 3, 4, 5];
122 let mut it = xs.iter().map(|&x|x).peekable();
124 assert_eq!(it.len(), 6);
125 assert_eq!(it.peek().unwrap(), &0);
126 assert_eq!(it.len(), 6);
127 assert_eq!(it.next().unwrap(), 0);
128 assert_eq!(it.len(), 5);
129 assert_eq!(it.next().unwrap(), 1);
130 assert_eq!(it.len(), 4);
131 assert_eq!(it.next().unwrap(), 2);
132 assert_eq!(it.len(), 3);
133 assert_eq!(it.peek().unwrap(), &3);
134 assert_eq!(it.len(), 3);
135 assert_eq!(it.peek().unwrap(), &3);
136 assert_eq!(it.len(), 3);
137 assert_eq!(it.next().unwrap(), 3);
138 assert_eq!(it.len(), 2);
139 assert_eq!(it.next().unwrap(), 4);
140 assert_eq!(it.len(), 1);
141 assert_eq!(it.peek().unwrap(), &5);
142 assert_eq!(it.len(), 1);
143 assert_eq!(it.next().unwrap(), 5);
144 assert_eq!(it.len(), 0);
145 assert!(it.peek().is_none());
146 assert_eq!(it.len(), 0);
147 assert!(it.next().is_none());
148 assert_eq!(it.len(), 0);
152 fn test_iterator_take_while() {
153 let xs = [0, 1, 2, 3, 5, 13, 15, 16, 17, 19];
154 let ys = [0, 1, 2, 3, 5, 13];
155 let mut it = xs.iter().take_while(|&x| *x < 15);
158 assert_eq!(*x, ys[i]);
161 assert_eq!(i, ys.len());
165 fn test_iterator_skip_while() {
166 let xs = [0, 1, 2, 3, 5, 13, 15, 16, 17, 19];
167 let ys = [15, 16, 17, 19];
168 let mut it = xs.iter().skip_while(|&x| *x < 15);
171 assert_eq!(*x, ys[i]);
174 assert_eq!(i, ys.len());
178 fn test_iterator_skip() {
179 let xs = [0, 1, 2, 3, 5, 13, 15, 16, 17, 19, 20, 30];
180 let ys = [13, 15, 16, 17, 19, 20, 30];
181 let mut it = xs.iter().skip(5);
183 while let Some(&x) = it.next() {
184 assert_eq!(x, ys[i]);
186 assert_eq!(it.len(), xs.len()-5-i);
188 assert_eq!(i, ys.len());
189 assert_eq!(it.len(), 0);
193 fn test_iterator_take() {
194 let xs = [0, 1, 2, 3, 5, 13, 15, 16, 17, 19];
195 let ys = [0, 1, 2, 3, 5];
196 let mut it = xs.iter().take(5);
198 assert_eq!(it.len(), 5);
199 while let Some(&x) = it.next() {
200 assert_eq!(x, ys[i]);
202 assert_eq!(it.len(), 5-i);
204 assert_eq!(i, ys.len());
205 assert_eq!(it.len(), 0);
209 fn test_iterator_take_short() {
210 let xs = [0, 1, 2, 3];
211 let ys = [0, 1, 2, 3];
212 let mut it = xs.iter().take(5);
214 assert_eq!(it.len(), 4);
215 while let Some(&x) = it.next() {
216 assert_eq!(x, ys[i]);
218 assert_eq!(it.len(), 4-i);
220 assert_eq!(i, ys.len());
221 assert_eq!(it.len(), 0);
225 fn test_iterator_scan() {
226 // test the type inference
227 fn add(old: &mut int, new: &uint) -> Option<f64> {
231 let xs = [0, 1, 2, 3, 4];
232 let ys = [0f64, 1.0, 3.0, 6.0, 10.0];
234 let mut it = xs.iter().scan(0, add);
237 assert_eq!(x, ys[i]);
240 assert_eq!(i, ys.len());
244 fn test_iterator_flat_map() {
246 let ys = [0, 1, 2, 3, 4, 5, 6, 7, 8];
247 let mut it = xs.iter().flat_map(|&x| count(x, 1).take(3));
250 assert_eq!(x, ys[i]);
253 assert_eq!(i, ys.len());
258 let xs = [1, 2, 3, 4];
264 .collect::<Vec<uint>>();
266 assert_eq!(n, xs.len());
267 assert_eq!(&xs[], &ys[]);
272 fn count(st: &mut uint) -> Option<uint> {
282 let mut it = Unfold::new(0, count);
285 assert_eq!(counted, i);
294 let it = count(0, 1).take(cycle_len).cycle();
295 assert_eq!(it.size_hint(), (uint::MAX, None));
296 for (i, x) in it.take(100).enumerate() {
297 assert_eq!(i % cycle_len, x);
300 let mut it = count(0, 1).take(0).cycle();
301 assert_eq!(it.size_hint(), (0, Some(0)));
302 assert_eq!(it.next(), None);
306 fn test_iterator_nth() {
307 let v: &[_] = &[0, 1, 2, 3, 4];
308 for i in 0..v.len() {
309 assert_eq!(v.iter().nth(i).unwrap(), &v[i]);
311 assert_eq!(v.iter().nth(v.len()), None);
315 fn test_iterator_last() {
316 let v: &[_] = &[0, 1, 2, 3, 4];
317 assert_eq!(v.iter().last().unwrap(), &4);
318 assert_eq!(v[..1].iter().last().unwrap(), &0);
322 fn test_iterator_len() {
323 let v: &[_] = &[0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10];
324 assert_eq!(v[..4].iter().count(), 4);
325 assert_eq!(v[..10].iter().count(), 10);
326 assert_eq!(v[..0].iter().count(), 0);
330 fn test_iterator_sum() {
331 let v: &[i32] = &[0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10];
332 assert_eq!(v[..4].iter().map(|&x| x).sum(), 6);
333 assert_eq!(v.iter().map(|&x| x).sum(), 55);
334 assert_eq!(v[..0].iter().map(|&x| x).sum(), 0);
338 fn test_iterator_product() {
339 let v: &[i32] = &[0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10];
340 assert_eq!(v[..4].iter().map(|&x| x).product(), 0);
341 assert_eq!(v[1..5].iter().map(|&x| x).product(), 24);
342 assert_eq!(v[..0].iter().map(|&x| x).product(), 1);
346 fn test_iterator_max() {
347 let v: &[_] = &[0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10];
348 assert_eq!(v[..4].iter().map(|&x| x).max(), Some(3));
349 assert_eq!(v.iter().map(|&x| x).max(), Some(10));
350 assert_eq!(v[..0].iter().map(|&x| x).max(), None);
354 fn test_iterator_min() {
355 let v: &[_] = &[0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10];
356 assert_eq!(v[..4].iter().map(|&x| x).min(), Some(0));
357 assert_eq!(v.iter().map(|&x| x).min(), Some(0));
358 assert_eq!(v[..0].iter().map(|&x| x).min(), None);
362 fn test_iterator_size_hint() {
364 let v: &[_] = &[0, 1, 2, 3, 4, 5, 6, 7, 8, 9];
365 let v2 = &[10, 11, 12];
368 assert_eq!(c.size_hint(), (uint::MAX, None));
369 assert_eq!(vi.clone().size_hint(), (10, Some(10)));
371 assert_eq!(c.clone().take(5).size_hint(), (5, Some(5)));
372 assert_eq!(c.clone().skip(5).size_hint().1, None);
373 assert_eq!(c.clone().take_while(|_| false).size_hint(), (0, None));
374 assert_eq!(c.clone().skip_while(|_| false).size_hint(), (0, None));
375 assert_eq!(c.clone().enumerate().size_hint(), (uint::MAX, None));
376 assert_eq!(c.clone().chain(vi.clone().map(|&i| i)).size_hint(), (uint::MAX, None));
377 assert_eq!(c.clone().zip(vi.clone()).size_hint(), (10, Some(10)));
378 assert_eq!(c.clone().scan(0, |_,_| Some(0)).size_hint(), (0, None));
379 assert_eq!(c.clone().filter(|_| false).size_hint(), (0, None));
380 assert_eq!(c.clone().map(|_| 0).size_hint(), (uint::MAX, None));
381 assert_eq!(c.filter_map(|_| Some(0)).size_hint(), (0, None));
383 assert_eq!(vi.clone().take(5).size_hint(), (5, Some(5)));
384 assert_eq!(vi.clone().take(12).size_hint(), (10, Some(10)));
385 assert_eq!(vi.clone().skip(3).size_hint(), (7, Some(7)));
386 assert_eq!(vi.clone().skip(12).size_hint(), (0, Some(0)));
387 assert_eq!(vi.clone().take_while(|_| false).size_hint(), (0, Some(10)));
388 assert_eq!(vi.clone().skip_while(|_| false).size_hint(), (0, Some(10)));
389 assert_eq!(vi.clone().enumerate().size_hint(), (10, Some(10)));
390 assert_eq!(vi.clone().chain(v2.iter()).size_hint(), (13, Some(13)));
391 assert_eq!(vi.clone().zip(v2.iter()).size_hint(), (3, Some(3)));
392 assert_eq!(vi.clone().scan(0, |_,_| Some(0)).size_hint(), (0, Some(10)));
393 assert_eq!(vi.clone().filter(|_| false).size_hint(), (0, Some(10)));
394 assert_eq!(vi.clone().map(|&i| i+1).size_hint(), (10, Some(10)));
395 assert_eq!(vi.filter_map(|_| Some(0)).size_hint(), (0, Some(10)));
400 let a = vec![1, 2, 3, 4, 5];
401 let b: Vec<int> = a.iter().map(|&x| x).collect();
407 let v: Box<[int]> = box [1, 2, 3, 4, 5];
408 assert!(v.iter().all(|&x| x < 10));
409 assert!(!v.iter().all(|&x| x % 2 == 0));
410 assert!(!v.iter().all(|&x| x > 100));
411 assert!(v[..0].iter().all(|_| panic!()));
416 let v: Box<[int]> = box [1, 2, 3, 4, 5];
417 assert!(v.iter().any(|&x| x < 10));
418 assert!(v.iter().any(|&x| x % 2 == 0));
419 assert!(!v.iter().any(|&x| x > 100));
420 assert!(!v[..0].iter().any(|_| panic!()));
425 let v: &[int] = &[1, 3, 9, 27, 103, 14, 11];
426 assert_eq!(*v.iter().find(|&&x| x & 1 == 0).unwrap(), 14);
427 assert_eq!(*v.iter().find(|&&x| x % 3 == 0).unwrap(), 3);
428 assert!(v.iter().find(|&&x| x % 12 == 0).is_none());
433 let v = &[1, 3, 9, 27, 103, 14, 11];
434 assert_eq!(v.iter().position(|x| *x & 1 == 0).unwrap(), 5);
435 assert_eq!(v.iter().position(|x| *x % 3 == 0).unwrap(), 1);
436 assert!(v.iter().position(|x| *x % 12 == 0).is_none());
441 let xs = &[1, 2, 2, 1, 5, 9, 0, 2];
442 assert_eq!(xs.iter().filter(|x| **x == 2).count(), 3);
443 assert_eq!(xs.iter().filter(|x| **x == 5).count(), 1);
444 assert_eq!(xs.iter().filter(|x| **x == 95).count(), 0);
449 let xs: &[int] = &[-3, 0, 1, 5, -10];
450 assert_eq!(*xs.iter().max_by(|x| x.abs()).unwrap(), -10);
455 let xs: &[int] = &[-3, 0, 1, 5, -10];
456 assert_eq!(*xs.iter().min_by(|x| x.abs()).unwrap(), 0);
462 // sum the first five values
463 let partial_sum = xs.by_ref().take(5).fold(0, |a, b| a + b);
464 assert_eq!(partial_sum, 10);
465 assert_eq!(xs.next(), Some(5));
470 let xs = [2, 4, 6, 8, 10, 12, 14, 16];
471 let mut it = xs.iter();
474 assert!(it.rev().map(|&x| x).collect::<Vec<int>>() ==
475 vec![16, 14, 12, 10, 8, 6]);
480 let xs = [2u8, 4, 6, 8];
482 let mut it = xs.iter().cloned();
483 assert_eq!(it.len(), 4);
484 assert_eq!(it.next(), Some(2));
485 assert_eq!(it.len(), 3);
486 assert_eq!(it.next(), Some(4));
487 assert_eq!(it.len(), 2);
488 assert_eq!(it.next_back(), Some(8));
489 assert_eq!(it.len(), 1);
490 assert_eq!(it.next_back(), Some(6));
491 assert_eq!(it.len(), 0);
492 assert_eq!(it.next_back(), None);
496 fn test_double_ended_map() {
497 let xs = [1, 2, 3, 4, 5, 6];
498 let mut it = xs.iter().map(|&x| x * -1);
499 assert_eq!(it.next(), Some(-1));
500 assert_eq!(it.next(), Some(-2));
501 assert_eq!(it.next_back(), Some(-6));
502 assert_eq!(it.next_back(), Some(-5));
503 assert_eq!(it.next(), Some(-3));
504 assert_eq!(it.next_back(), Some(-4));
505 assert_eq!(it.next(), None);
509 fn test_double_ended_enumerate() {
510 let xs = [1, 2, 3, 4, 5, 6];
511 let mut it = xs.iter().map(|&x| x).enumerate();
512 assert_eq!(it.next(), Some((0, 1)));
513 assert_eq!(it.next(), Some((1, 2)));
514 assert_eq!(it.next_back(), Some((5, 6)));
515 assert_eq!(it.next_back(), Some((4, 5)));
516 assert_eq!(it.next_back(), Some((3, 4)));
517 assert_eq!(it.next_back(), Some((2, 3)));
518 assert_eq!(it.next(), None);
522 fn test_double_ended_zip() {
523 let xs = [1, 2, 3, 4, 5, 6];
524 let ys = [1, 2, 3, 7];
525 let a = xs.iter().map(|&x| x);
526 let b = ys.iter().map(|&x| x);
527 let mut it = a.zip(b);
528 assert_eq!(it.next(), Some((1, 1)));
529 assert_eq!(it.next(), Some((2, 2)));
530 assert_eq!(it.next_back(), Some((4, 7)));
531 assert_eq!(it.next_back(), Some((3, 3)));
532 assert_eq!(it.next(), None);
536 fn test_double_ended_filter() {
537 let xs = [1, 2, 3, 4, 5, 6];
538 let mut it = xs.iter().filter(|&x| *x & 1 == 0);
539 assert_eq!(it.next_back().unwrap(), &6);
540 assert_eq!(it.next_back().unwrap(), &4);
541 assert_eq!(it.next().unwrap(), &2);
542 assert_eq!(it.next_back(), None);
546 fn test_double_ended_filter_map() {
547 let xs = [1, 2, 3, 4, 5, 6];
548 let mut it = xs.iter().filter_map(|&x| if x & 1 == 0 { Some(x * 2) } else { None });
549 assert_eq!(it.next_back().unwrap(), 12);
550 assert_eq!(it.next_back().unwrap(), 8);
551 assert_eq!(it.next().unwrap(), 4);
552 assert_eq!(it.next_back(), None);
556 fn test_double_ended_chain() {
557 let xs = [1, 2, 3, 4, 5];
559 let mut it = xs.iter().chain(ys.iter()).rev();
560 assert_eq!(it.next().unwrap(), &11);
561 assert_eq!(it.next().unwrap(), &9);
562 assert_eq!(it.next_back().unwrap(), &1);
563 assert_eq!(it.next_back().unwrap(), &2);
564 assert_eq!(it.next_back().unwrap(), &3);
565 assert_eq!(it.next_back().unwrap(), &4);
566 assert_eq!(it.next_back().unwrap(), &5);
567 assert_eq!(it.next_back().unwrap(), &7);
568 assert_eq!(it.next_back(), None);
572 fn test_rposition() {
573 fn f(xy: &(int, char)) -> bool { let (_x, y) = *xy; y == 'b' }
574 fn g(xy: &(int, char)) -> bool { let (_x, y) = *xy; y == 'd' }
575 let v = [(0, 'a'), (1, 'b'), (2, 'c'), (3, 'b')];
577 assert_eq!(v.iter().rposition(f), Some(3));
578 assert!(v.iter().rposition(g).is_none());
583 fn test_rposition_panic() {
584 let v = [(box 0, box 0), (box 0, box 0),
585 (box 0, box 0), (box 0, box 0)];
587 v.iter().rposition(|_elt| {
598 fn check_randacc_iter<A, T>(a: T, len: uint) where
600 T: Clone + RandomAccessIterator + Iterator<Item=A>,
602 let mut b = a.clone();
603 assert_eq!(len, b.indexable());
605 for (i, elt) in a.enumerate() {
606 assert!(Some(elt) == b.idx(i));
610 assert!(None == b.idx(n));
611 // call recursively to check after picking off an element
614 check_randacc_iter(b, len-1);
620 fn test_double_ended_flat_map() {
623 let mut it = u.iter().flat_map(|x| v[*x..v.len()].iter());
624 assert_eq!(it.next_back().unwrap(), &8);
625 assert_eq!(it.next().unwrap(), &5);
626 assert_eq!(it.next_back().unwrap(), &7);
627 assert_eq!(it.next_back().unwrap(), &6);
628 assert_eq!(it.next_back().unwrap(), &8);
629 assert_eq!(it.next().unwrap(), &6);
630 assert_eq!(it.next_back().unwrap(), &7);
631 assert_eq!(it.next_back(), None);
632 assert_eq!(it.next(), None);
633 assert_eq!(it.next_back(), None);
637 fn test_random_access_chain() {
638 let xs = [1, 2, 3, 4, 5];
640 let mut it = xs.iter().chain(ys.iter());
641 assert_eq!(it.idx(0).unwrap(), &1);
642 assert_eq!(it.idx(5).unwrap(), &7);
643 assert_eq!(it.idx(7).unwrap(), &11);
644 assert!(it.idx(8).is_none());
650 assert_eq!(it.idx(0).unwrap(), &3);
651 assert_eq!(it.idx(4).unwrap(), &9);
652 assert!(it.idx(6).is_none());
654 check_randacc_iter(it, xs.len() + ys.len() - 3);
658 fn test_random_access_enumerate() {
659 let xs = [1, 2, 3, 4, 5];
660 check_randacc_iter(xs.iter().enumerate(), xs.len());
664 fn test_random_access_rev() {
665 let xs = [1, 2, 3, 4, 5];
666 check_randacc_iter(xs.iter().rev(), xs.len());
667 let mut it = xs.iter().rev();
671 check_randacc_iter(it, xs.len() - 3);
675 fn test_random_access_zip() {
676 let xs = [1, 2, 3, 4, 5];
678 check_randacc_iter(xs.iter().zip(ys.iter()), cmp::min(xs.len(), ys.len()));
682 fn test_random_access_take() {
683 let xs = [1, 2, 3, 4, 5];
684 let empty: &[int] = &[];
685 check_randacc_iter(xs.iter().take(3), 3);
686 check_randacc_iter(xs.iter().take(20), xs.len());
687 check_randacc_iter(xs.iter().take(0), 0);
688 check_randacc_iter(empty.iter().take(2), 0);
692 fn test_random_access_skip() {
693 let xs = [1, 2, 3, 4, 5];
694 let empty: &[int] = &[];
695 check_randacc_iter(xs.iter().skip(2), xs.len() - 2);
696 check_randacc_iter(empty.iter().skip(2), 0);
700 fn test_random_access_inspect() {
701 let xs = [1, 2, 3, 4, 5];
703 // test .map and .inspect that don't implement Clone
704 let mut it = xs.iter().inspect(|_| {});
705 assert_eq!(xs.len(), it.indexable());
706 for (i, elt) in xs.iter().enumerate() {
707 assert_eq!(Some(elt), it.idx(i));
713 fn test_random_access_map() {
714 let xs = [1, 2, 3, 4, 5];
716 let mut it = xs.iter().map(|x| *x);
717 assert_eq!(xs.len(), it.indexable());
718 for (i, elt) in xs.iter().enumerate() {
719 assert_eq!(Some(*elt), it.idx(i));
724 fn test_random_access_cycle() {
725 let xs = [1, 2, 3, 4, 5];
726 let empty: &[int] = &[];
727 check_randacc_iter(xs.iter().cycle().take(27), 27);
728 check_randacc_iter(empty.iter().cycle(), 0);
732 fn test_double_ended_range() {
733 assert!((11..14).rev().collect::<Vec<_>>() == vec![13, 12, 11]);
734 for _ in (10..0).rev() {
735 panic!("unreachable");
738 assert!((11..14).rev().collect::<Vec<_>>() == vec![13, 12, 11]);
739 for _ in (10..0).rev() {
740 panic!("unreachable");
746 assert!((0..5).collect::<Vec<_>>() == vec![0, 1, 2, 3, 4]);
747 assert!((-10..-1).collect::<Vec<_>>() ==
748 vec![-10, -9, -8, -7, -6, -5, -4, -3, -2]);
749 assert!((0..5).rev().collect::<Vec<_>>() == vec![4, 3, 2, 1, 0]);
750 assert_eq!((200..-5).count(), 0);
751 assert_eq!((200..-5).rev().count(), 0);
752 assert_eq!((200..200).count(), 0);
753 assert_eq!((200..200).rev().count(), 0);
755 assert_eq!((0..100).size_hint(), (100, Some(100)));
756 // this test is only meaningful when sizeof uint < sizeof u64
757 assert_eq!((uint::MAX - 1..uint::MAX).size_hint(), (1, Some(1)));
758 assert_eq!((-10..-1).size_hint(), (9, Some(9)));
759 assert_eq!((-1..-10).size_hint(), (0, Some(0)));
763 fn test_range_inclusive() {
764 assert!(range_inclusive(0, 5).collect::<Vec<int>>() ==
765 vec![0, 1, 2, 3, 4, 5]);
766 assert!(range_inclusive(0, 5).rev().collect::<Vec<int>>() ==
767 vec![5, 4, 3, 2, 1, 0]);
768 assert_eq!(range_inclusive(200, -5).count(), 0);
769 assert_eq!(range_inclusive(200, -5).rev().count(), 0);
770 assert!(range_inclusive(200, 200).collect::<Vec<int>>() == vec![200]);
771 assert!(range_inclusive(200, 200).rev().collect::<Vec<int>>() == vec![200]);
775 fn test_range_step() {
776 assert!(range_step(0, 20, 5).collect::<Vec<int>>() ==
778 assert!(range_step(20, 0, -5).collect::<Vec<int>>() ==
779 vec![20, 15, 10, 5]);
780 assert!(range_step(20, 0, -6).collect::<Vec<int>>() ==
782 assert!(range_step(200u8, 255, 50).collect::<Vec<u8>>() ==
784 assert!(range_step(200, -5, 1).collect::<Vec<int>>() == vec![]);
785 assert!(range_step(200, 200, 1).collect::<Vec<int>>() == vec![]);
789 fn test_range_step_inclusive() {
790 assert!(range_step_inclusive(0, 20, 5).collect::<Vec<int>>() ==
791 vec![0, 5, 10, 15, 20]);
792 assert!(range_step_inclusive(20, 0, -5).collect::<Vec<int>>() ==
793 vec![20, 15, 10, 5, 0]);
794 assert!(range_step_inclusive(20, 0, -6).collect::<Vec<int>>() ==
796 assert!(range_step_inclusive(200u8, 255, 50).collect::<Vec<u8>>() ==
798 assert!(range_step_inclusive(200, -5, 1).collect::<Vec<int>>() ==
800 assert!(range_step_inclusive(200, 200, 1).collect::<Vec<int>>() ==
806 let mut ys = [1, 2, 3, 4, 5];
807 ys.iter_mut().reverse_in_place();
808 assert!(ys == [5, 4, 3, 2, 1]);
812 fn test_peekable_is_empty() {
814 let mut it = a.iter().peekable();
815 assert!( !it.is_empty() );
817 assert!( it.is_empty() );
822 let v: [int; 0] = [];
823 assert_eq!(v.iter().min_max(), NoElements);
826 assert!(v.iter().min_max() == OneElement(&1));
828 let v = [1, 2, 3, 4, 5];
829 assert!(v.iter().min_max() == MinMax(&1, &5));
831 let v = [1, 2, 3, 4, 5, 6];
832 assert!(v.iter().min_max() == MinMax(&1, &6));
834 let v = [1, 1, 1, 1];
835 assert!(v.iter().min_max() == MinMax(&1, &1));
839 fn test_min_max_result() {
840 let r: MinMaxResult<int> = NoElements;
841 assert_eq!(r.into_option(), None);
843 let r = OneElement(1);
844 assert_eq!(r.into_option(), Some((1,1)));
847 assert_eq!(r.into_option(), Some((1,2)));
852 let mut it = iterate(1, |x| x * 2);
853 assert_eq!(it.next(), Some(1));
854 assert_eq!(it.next(), Some(2));
855 assert_eq!(it.next(), Some(4));
856 assert_eq!(it.next(), Some(8));
861 let mut it = repeat(42);
862 assert_eq!(it.next(), Some(42));
863 assert_eq!(it.next(), Some(42));
864 assert_eq!(it.next(), Some(42));
870 assert_eq!(it.len(), 3);
871 assert_eq!(it.next(), Some(0));
872 assert_eq!(it.len(), 2);
873 assert_eq!(it.next(), Some(1));
874 assert_eq!(it.len(), 1);
875 assert_eq!(it.next(), Some(2));
876 assert_eq!(it.len(), 0);
877 assert_eq!(it.next(), None);
878 assert_eq!(it.len(), 0);
879 assert_eq!(it.next(), None);
880 assert_eq!(it.len(), 0);
881 assert_eq!(it.next(), None);
882 assert_eq!(it.len(), 0);
886 fn bench_rposition(b: &mut Bencher) {
887 let it: Vec<uint> = (0..300).collect();
889 it.iter().rposition(|&x| x <= 150);
894 fn bench_skip_while(b: &mut Bencher) {
898 it.skip_while(|&x| { sum += x; sum < 4000 }).all(|_| true);
903 fn bench_multiple_take(b: &mut Bencher) {
904 let mut it = (0..42).cycle();
906 let n = it.next().unwrap();
908 it.clone().take(it.next().unwrap()).all(|_| true);