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::*;
19 let empty: [int, ..0] = [];
23 assert!(!lt(xs.iter(), ys.iter()));
24 assert!(!le(xs.iter(), ys.iter()));
25 assert!( gt(xs.iter(), ys.iter()));
26 assert!( ge(xs.iter(), ys.iter()));
28 assert!( lt(ys.iter(), xs.iter()));
29 assert!( le(ys.iter(), xs.iter()));
30 assert!(!gt(ys.iter(), xs.iter()));
31 assert!(!ge(ys.iter(), xs.iter()));
33 assert!( lt(empty.iter(), xs.iter()));
34 assert!( le(empty.iter(), xs.iter()));
35 assert!(!gt(empty.iter(), xs.iter()));
36 assert!(!ge(empty.iter(), xs.iter()));
39 let u = [1.0f64, 2.0];
40 let v = [0.0f64/0.0, 3.0];
42 assert!(!lt(u.iter(), v.iter()));
43 assert!(!le(u.iter(), v.iter()));
44 assert!(!gt(u.iter(), v.iter()));
45 assert!(!ge(u.iter(), v.iter()));
51 assert!(lt(a.iter(), b.iter()) == (a[0] < b[0]));
52 assert!(le(a.iter(), b.iter()) == (a[0] <= b[0]));
53 assert!(gt(a.iter(), b.iter()) == (a[0] > b[0]));
54 assert!(ge(a.iter(), b.iter()) == (a[0] >= b[0]));
56 assert!(lt(c.iter(), b.iter()) == (c[0] < b[0]));
57 assert!(le(c.iter(), b.iter()) == (c[0] <= b[0]));
58 assert!(gt(c.iter(), b.iter()) == (c[0] > b[0]));
59 assert!(ge(c.iter(), b.iter()) == (c[0] >= b[0]));
63 fn test_multi_iter() {
66 assert!(eq(xs.iter(), ys.iter().rev()));
67 assert!(lt(xs.iter(), xs.iter().skip(2)));
71 fn test_counter_from_iter() {
72 let it = count(0i, 5).take(10);
73 let xs: Vec<int> = FromIterator::from_iter(it);
74 assert!(xs == vec![0, 5, 10, 15, 20, 25, 30, 35, 40, 45]);
78 fn test_iterator_chain() {
79 let xs = [0u, 1, 2, 3, 4, 5];
80 let ys = [30u, 40, 50, 60];
81 let expected = [0, 1, 2, 3, 4, 5, 30, 40, 50, 60];
82 let mut it = xs.iter().chain(ys.iter());
85 assert_eq!(x, expected[i]);
88 assert_eq!(i, expected.len());
90 let ys = count(30u, 10).take(4);
91 let mut it = xs.iter().map(|&x| x).chain(ys);
94 assert_eq!(x, expected[i]);
97 assert_eq!(i, expected.len());
101 fn test_filter_map() {
102 let mut it = count(0u, 1u).take(10)
103 .filter_map(|x| if x % 2 == 0 { Some(x*x) } else { None });
104 assert!(it.collect::<Vec<uint>>() == vec![0*0, 2*2, 4*4, 6*6, 8*8]);
108 fn test_iterator_enumerate() {
109 let xs = [0u, 1, 2, 3, 4, 5];
110 let mut it = xs.iter().enumerate();
117 fn test_iterator_peekable() {
118 let xs = vec![0u, 1, 2, 3, 4, 5];
119 let mut it = xs.iter().map(|&x|x).peekable();
120 assert_eq!(it.peek().unwrap(), &0);
121 assert_eq!(it.next().unwrap(), 0);
122 assert_eq!(it.next().unwrap(), 1);
123 assert_eq!(it.next().unwrap(), 2);
124 assert_eq!(it.peek().unwrap(), &3);
125 assert_eq!(it.peek().unwrap(), &3);
126 assert_eq!(it.next().unwrap(), 3);
127 assert_eq!(it.next().unwrap(), 4);
128 assert_eq!(it.peek().unwrap(), &5);
129 assert_eq!(it.next().unwrap(), 5);
130 assert!(it.peek().is_none());
131 assert!(it.next().is_none());
135 fn test_iterator_take_while() {
136 let xs = [0u, 1, 2, 3, 5, 13, 15, 16, 17, 19];
137 let ys = [0u, 1, 2, 3, 5, 13];
138 let mut it = xs.iter().take_while(|&x| *x < 15u);
141 assert_eq!(x, ys[i]);
144 assert_eq!(i, ys.len());
148 fn test_iterator_skip_while() {
149 let xs = [0u, 1, 2, 3, 5, 13, 15, 16, 17, 19];
150 let ys = [15, 16, 17, 19];
151 let mut it = xs.iter().skip_while(|&x| *x < 15u);
154 assert_eq!(x, ys[i]);
157 assert_eq!(i, ys.len());
161 fn test_iterator_skip() {
162 let xs = [0u, 1, 2, 3, 5, 13, 15, 16, 17, 19, 20, 30];
163 let ys = [13, 15, 16, 17, 19, 20, 30];
164 let mut it = xs.iter().skip(5);
167 assert_eq!(x, ys[i]);
170 assert_eq!(i, ys.len());
174 fn test_iterator_take() {
175 let xs = [0u, 1, 2, 3, 5, 13, 15, 16, 17, 19];
176 let ys = [0u, 1, 2, 3, 5];
177 let mut it = xs.iter().take(5);
180 assert_eq!(x, ys[i]);
183 assert_eq!(i, ys.len());
187 fn test_iterator_scan() {
188 // test the type inference
189 fn add(old: &mut int, new: &uint) -> Option<f64> {
193 let xs = [0u, 1, 2, 3, 4];
194 let ys = [0f64, 1.0, 3.0, 6.0, 10.0];
196 let mut it = xs.iter().scan(0, add);
199 assert_eq!(x, ys[i]);
202 assert_eq!(i, ys.len());
206 fn test_iterator_flat_map() {
208 let ys = [0u, 1, 2, 3, 4, 5, 6, 7, 8];
209 let mut it = xs.iter().flat_map(|&x| count(x, 1).take(3));
212 assert_eq!(x, ys[i]);
215 assert_eq!(i, ys.len());
220 let xs = [1u, 2, 3, 4];
226 .collect::<Vec<uint>>();
228 assert_eq!(n, xs.len());
229 assert_eq!(xs.as_slice(), ys.as_slice());
234 fn count(st: &mut uint) -> Option<uint> {
244 let mut it = Unfold::new(0, count);
247 assert_eq!(counted, i);
256 let it = count(0u, 1).take(cycle_len).cycle();
257 assert_eq!(it.size_hint(), (uint::MAX, None));
258 for (i, x) in it.take(100).enumerate() {
259 assert_eq!(i % cycle_len, x);
262 let mut it = count(0u, 1).take(0).cycle();
263 assert_eq!(it.size_hint(), (0, Some(0)));
264 assert_eq!(it.next(), None);
268 fn test_iterator_nth() {
269 let v = &[0i, 1, 2, 3, 4];
270 for i in range(0u, v.len()) {
271 assert_eq!(v.iter().nth(i).unwrap(), &v[i]);
276 fn test_iterator_last() {
277 let v = &[0i, 1, 2, 3, 4];
278 assert_eq!(v.iter().last().unwrap(), &4);
279 assert_eq!(v.slice(0, 1).iter().last().unwrap(), &0);
283 fn test_iterator_len() {
284 let v = &[0i, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10];
285 assert_eq!(v.slice(0, 4).iter().count(), 4);
286 assert_eq!(v.slice(0, 10).iter().count(), 10);
287 assert_eq!(v.slice(0, 0).iter().count(), 0);
291 fn test_iterator_sum() {
292 let v = &[0i, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10];
293 assert_eq!(v.slice(0, 4).iter().map(|&x| x).sum(), 6);
294 assert_eq!(v.iter().map(|&x| x).sum(), 55);
295 assert_eq!(v.slice(0, 0).iter().map(|&x| x).sum(), 0);
299 fn test_iterator_product() {
300 let v = &[0i, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10];
301 assert_eq!(v.slice(0, 4).iter().map(|&x| x).product(), 0);
302 assert_eq!(v.slice(1, 5).iter().map(|&x| x).product(), 24);
303 assert_eq!(v.slice(0, 0).iter().map(|&x| x).product(), 1);
307 fn test_iterator_max() {
308 let v = &[0i, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10];
309 assert_eq!(v.slice(0, 4).iter().map(|&x| x).max(), Some(3));
310 assert_eq!(v.iter().map(|&x| x).max(), Some(10));
311 assert_eq!(v.slice(0, 0).iter().map(|&x| x).max(), None);
315 fn test_iterator_min() {
316 let v = &[0i, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10];
317 assert_eq!(v.slice(0, 4).iter().map(|&x| x).min(), Some(0));
318 assert_eq!(v.iter().map(|&x| x).min(), Some(0));
319 assert_eq!(v.slice(0, 0).iter().map(|&x| x).min(), None);
323 fn test_iterator_size_hint() {
324 let c = count(0i, 1);
325 let v = &[0i, 1, 2, 3, 4, 5, 6, 7, 8, 9];
326 let v2 = &[10i, 11, 12];
329 assert_eq!(c.size_hint(), (uint::MAX, None));
330 assert_eq!(vi.size_hint(), (10, Some(10)));
332 assert_eq!(c.take(5).size_hint(), (5, Some(5)));
333 assert_eq!(c.skip(5).size_hint().val1(), None);
334 assert_eq!(c.take_while(|_| false).size_hint(), (0, None));
335 assert_eq!(c.skip_while(|_| false).size_hint(), (0, None));
336 assert_eq!(c.enumerate().size_hint(), (uint::MAX, None));
337 assert_eq!(c.chain(vi.map(|&i| i)).size_hint(), (uint::MAX, None));
338 assert_eq!(c.zip(vi).size_hint(), (10, Some(10)));
339 assert_eq!(c.scan(0i, |_,_| Some(0i)).size_hint(), (0, None));
340 assert_eq!(c.filter(|_| false).size_hint(), (0, None));
341 assert_eq!(c.map(|_| 0i).size_hint(), (uint::MAX, None));
342 assert_eq!(c.filter_map(|_| Some(0i)).size_hint(), (0, None));
344 assert_eq!(vi.take(5).size_hint(), (5, Some(5)));
345 assert_eq!(vi.take(12).size_hint(), (10, Some(10)));
346 assert_eq!(vi.skip(3).size_hint(), (7, Some(7)));
347 assert_eq!(vi.skip(12).size_hint(), (0, Some(0)));
348 assert_eq!(vi.take_while(|_| false).size_hint(), (0, Some(10)));
349 assert_eq!(vi.skip_while(|_| false).size_hint(), (0, Some(10)));
350 assert_eq!(vi.enumerate().size_hint(), (10, Some(10)));
351 assert_eq!(vi.chain(v2.iter()).size_hint(), (13, Some(13)));
352 assert_eq!(vi.zip(v2.iter()).size_hint(), (3, Some(3)));
353 assert_eq!(vi.scan(0i, |_,_| Some(0i)).size_hint(), (0, Some(10)));
354 assert_eq!(vi.filter(|_| false).size_hint(), (0, Some(10)));
355 assert_eq!(vi.map(|i| i+1).size_hint(), (10, Some(10)));
356 assert_eq!(vi.filter_map(|_| Some(0i)).size_hint(), (0, Some(10)));
361 let a = vec![1i, 2, 3, 4, 5];
362 let b: Vec<int> = a.iter().map(|&x| x).collect();
368 let v: Box<&[int]> = box &[1i, 2, 3, 4, 5];
369 assert!(v.iter().all(|&x| x < 10));
370 assert!(!v.iter().all(|&x| x % 2 == 0));
371 assert!(!v.iter().all(|&x| x > 100));
372 assert!(v.slice(0, 0).iter().all(|_| fail!()));
377 let v: Box<&[int]> = box &[1i, 2, 3, 4, 5];
378 assert!(v.iter().any(|&x| x < 10));
379 assert!(v.iter().any(|&x| x % 2 == 0));
380 assert!(!v.iter().any(|&x| x > 100));
381 assert!(!v.slice(0, 0).iter().any(|_| fail!()));
386 let v: &[int] = &[1i, 3, 9, 27, 103, 14, 11];
387 assert_eq!(*v.iter().find(|x| *x & 1 == 0).unwrap(), 14);
388 assert_eq!(*v.iter().find(|x| *x % 3 == 0).unwrap(), 3);
389 assert!(v.iter().find(|x| *x % 12 == 0).is_none());
394 let v = &[1i, 3, 9, 27, 103, 14, 11];
395 assert_eq!(v.iter().position(|x| *x & 1 == 0).unwrap(), 5);
396 assert_eq!(v.iter().position(|x| *x % 3 == 0).unwrap(), 1);
397 assert!(v.iter().position(|x| *x % 12 == 0).is_none());
402 let xs = &[1i, 2, 2, 1, 5, 9, 0, 2];
403 assert_eq!(xs.iter().filter(|x| **x == 2).count(), 3);
404 assert_eq!(xs.iter().filter(|x| **x == 5).count(), 1);
405 assert_eq!(xs.iter().filter(|x| **x == 95).count(), 0);
410 let xs: &[int] = &[-3i, 0, 1, 5, -10];
411 assert_eq!(*xs.iter().max_by(|x| x.abs()).unwrap(), -10);
416 let xs: &[int] = &[-3i, 0, 1, 5, -10];
417 assert_eq!(*xs.iter().min_by(|x| x.abs()).unwrap(), 0);
422 let mut xs = range(0i, 10);
423 // sum the first five values
424 let partial_sum = xs.by_ref().take(5).fold(0, |a, b| a + b);
425 assert_eq!(partial_sum, 10);
426 assert_eq!(xs.next(), Some(5));
431 let xs = [2i, 4, 6, 8, 10, 12, 14, 16];
432 let mut it = xs.iter();
435 assert!(it.rev().map(|&x| x).collect::<Vec<int>>() ==
436 vec![16, 14, 12, 10, 8, 6]);
440 fn test_double_ended_map() {
441 let xs = [1i, 2, 3, 4, 5, 6];
442 let mut it = xs.iter().map(|&x| x * -1);
443 assert_eq!(it.next(), Some(-1));
444 assert_eq!(it.next(), Some(-2));
445 assert_eq!(it.next_back(), Some(-6));
446 assert_eq!(it.next_back(), Some(-5));
447 assert_eq!(it.next(), Some(-3));
448 assert_eq!(it.next_back(), Some(-4));
449 assert_eq!(it.next(), None);
453 fn test_double_ended_enumerate() {
454 let xs = [1i, 2, 3, 4, 5, 6];
455 let mut it = xs.iter().map(|&x| x).enumerate();
456 assert_eq!(it.next(), Some((0, 1)));
457 assert_eq!(it.next(), Some((1, 2)));
458 assert_eq!(it.next_back(), Some((5, 6)));
459 assert_eq!(it.next_back(), Some((4, 5)));
460 assert_eq!(it.next_back(), Some((3, 4)));
461 assert_eq!(it.next_back(), Some((2, 3)));
462 assert_eq!(it.next(), None);
466 fn test_double_ended_zip() {
467 let xs = [1i, 2, 3, 4, 5, 6];
468 let ys = [1i, 2, 3, 7];
469 let a = xs.iter().map(|&x| x);
470 let b = ys.iter().map(|&x| x);
471 let mut it = a.zip(b);
472 assert_eq!(it.next(), Some((1, 1)));
473 assert_eq!(it.next(), Some((2, 2)));
474 assert_eq!(it.next_back(), Some((4, 7)));
475 assert_eq!(it.next_back(), Some((3, 3)));
476 assert_eq!(it.next(), None);
480 fn test_double_ended_filter() {
481 let xs = [1i, 2, 3, 4, 5, 6];
482 let mut it = xs.iter().filter(|&x| *x & 1 == 0);
483 assert_eq!(it.next_back().unwrap(), &6);
484 assert_eq!(it.next_back().unwrap(), &4);
485 assert_eq!(it.next().unwrap(), &2);
486 assert_eq!(it.next_back(), None);
490 fn test_double_ended_filter_map() {
491 let xs = [1i, 2, 3, 4, 5, 6];
492 let mut it = xs.iter().filter_map(|&x| if x & 1 == 0 { Some(x * 2) } else { None });
493 assert_eq!(it.next_back().unwrap(), 12);
494 assert_eq!(it.next_back().unwrap(), 8);
495 assert_eq!(it.next().unwrap(), 4);
496 assert_eq!(it.next_back(), None);
500 fn test_double_ended_chain() {
501 let xs = [1i, 2, 3, 4, 5];
502 let ys = [7i, 9, 11];
503 let mut it = xs.iter().chain(ys.iter()).rev();
504 assert_eq!(it.next().unwrap(), &11)
505 assert_eq!(it.next().unwrap(), &9)
506 assert_eq!(it.next_back().unwrap(), &1)
507 assert_eq!(it.next_back().unwrap(), &2)
508 assert_eq!(it.next_back().unwrap(), &3)
509 assert_eq!(it.next_back().unwrap(), &4)
510 assert_eq!(it.next_back().unwrap(), &5)
511 assert_eq!(it.next_back().unwrap(), &7)
512 assert_eq!(it.next_back(), None)
516 fn test_rposition() {
517 fn f(xy: &(int, char)) -> bool { let (_x, y) = *xy; y == 'b' }
518 fn g(xy: &(int, char)) -> bool { let (_x, y) = *xy; y == 'd' }
519 let v = [(0i, 'a'), (1, 'b'), (2, 'c'), (3, 'b')];
521 assert_eq!(v.iter().rposition(f), Some(3u));
522 assert!(v.iter().rposition(g).is_none());
527 fn test_rposition_fail() {
529 let v = [(box 0i, box(GC) 0i), (box 0i, box(GC) 0i),
530 (box 0i, box(GC) 0i), (box 0i, box(GC) 0i)];
532 v.iter().rposition(|_elt| {
543 fn check_randacc_iter<A: PartialEq, T: Clone + RandomAccessIterator<A>>(a: T, len: uint)
545 let mut b = a.clone();
546 assert_eq!(len, b.indexable());
548 for (i, elt) in a.enumerate() {
549 assert!(Some(elt) == b.idx(i));
553 assert!(None == b.idx(n));
554 // call recursively to check after picking off an element
557 check_randacc_iter(b, len-1);
563 fn test_double_ended_flat_map() {
566 let mut it = u.iter().flat_map(|x| v.slice(*x, v.len()).iter());
567 assert_eq!(it.next_back().unwrap(), &8);
568 assert_eq!(it.next().unwrap(), &5);
569 assert_eq!(it.next_back().unwrap(), &7);
570 assert_eq!(it.next_back().unwrap(), &6);
571 assert_eq!(it.next_back().unwrap(), &8);
572 assert_eq!(it.next().unwrap(), &6);
573 assert_eq!(it.next_back().unwrap(), &7);
574 assert_eq!(it.next_back(), None);
575 assert_eq!(it.next(), None);
576 assert_eq!(it.next_back(), None);
580 fn test_random_access_chain() {
581 let xs = [1i, 2, 3, 4, 5];
582 let ys = [7i, 9, 11];
583 let mut it = xs.iter().chain(ys.iter());
584 assert_eq!(it.idx(0).unwrap(), &1);
585 assert_eq!(it.idx(5).unwrap(), &7);
586 assert_eq!(it.idx(7).unwrap(), &11);
587 assert!(it.idx(8).is_none());
593 assert_eq!(it.idx(0).unwrap(), &3);
594 assert_eq!(it.idx(4).unwrap(), &9);
595 assert!(it.idx(6).is_none());
597 check_randacc_iter(it, xs.len() + ys.len() - 3);
601 fn test_random_access_enumerate() {
602 let xs = [1i, 2, 3, 4, 5];
603 check_randacc_iter(xs.iter().enumerate(), xs.len());
607 fn test_random_access_rev() {
608 let xs = [1i, 2, 3, 4, 5];
609 check_randacc_iter(xs.iter().rev(), xs.len());
610 let mut it = xs.iter().rev();
614 check_randacc_iter(it, xs.len() - 3);
618 fn test_random_access_zip() {
619 let xs = [1i, 2, 3, 4, 5];
620 let ys = [7i, 9, 11];
621 check_randacc_iter(xs.iter().zip(ys.iter()), cmp::min(xs.len(), ys.len()));
625 fn test_random_access_take() {
626 let xs = [1i, 2, 3, 4, 5];
627 let empty: &[int] = [];
628 check_randacc_iter(xs.iter().take(3), 3);
629 check_randacc_iter(xs.iter().take(20), xs.len());
630 check_randacc_iter(xs.iter().take(0), 0);
631 check_randacc_iter(empty.iter().take(2), 0);
635 fn test_random_access_skip() {
636 let xs = [1i, 2, 3, 4, 5];
637 let empty: &[int] = [];
638 check_randacc_iter(xs.iter().skip(2), xs.len() - 2);
639 check_randacc_iter(empty.iter().skip(2), 0);
643 fn test_random_access_inspect() {
644 let xs = [1i, 2, 3, 4, 5];
646 // test .map and .inspect that don't implement Clone
647 let mut it = xs.iter().inspect(|_| {});
648 assert_eq!(xs.len(), it.indexable());
649 for (i, elt) in xs.iter().enumerate() {
650 assert_eq!(Some(elt), it.idx(i));
656 fn test_random_access_map() {
657 let xs = [1i, 2, 3, 4, 5];
659 let mut it = xs.iter().map(|x| *x);
660 assert_eq!(xs.len(), it.indexable());
661 for (i, elt) in xs.iter().enumerate() {
662 assert_eq!(Some(*elt), it.idx(i));
667 fn test_random_access_cycle() {
668 let xs = [1i, 2, 3, 4, 5];
669 let empty: &[int] = [];
670 check_randacc_iter(xs.iter().cycle().take(27), 27);
671 check_randacc_iter(empty.iter().cycle(), 0);
675 fn test_double_ended_range() {
676 assert!(range(11i, 14).rev().collect::<Vec<int>>() == vec![13i, 12, 11]);
677 for _ in range(10i, 0).rev() {
678 fail!("unreachable");
681 assert!(range(11u, 14).rev().collect::<Vec<uint>>() == vec![13u, 12, 11]);
682 for _ in range(10u, 0).rev() {
683 fail!("unreachable");
689 /// A mock type to check Range when ToPrimitive returns None
692 impl ToPrimitive for Foo {
693 fn to_i64(&self) -> Option<i64> { None }
694 fn to_u64(&self) -> Option<u64> { None }
697 impl Add<Foo, Foo> for Foo {
698 fn add(&self, _: &Foo) -> Foo {
703 impl PartialEq for Foo {
704 fn eq(&self, _: &Foo) -> bool {
709 impl PartialOrd for Foo {
710 fn partial_cmp(&self, _: &Foo) -> Option<Ordering> {
716 fn clone(&self) -> Foo {
721 impl Mul<Foo, Foo> for Foo {
722 fn mul(&self, _: &Foo) -> Foo {
727 impl num::One for Foo {
733 assert!(range(0i, 5).collect::<Vec<int>>() == vec![0i, 1, 2, 3, 4]);
734 assert!(range(-10i, -1).collect::<Vec<int>>() ==
735 vec![-10, -9, -8, -7, -6, -5, -4, -3, -2]);
736 assert!(range(0i, 5).rev().collect::<Vec<int>>() == vec![4, 3, 2, 1, 0]);
737 assert_eq!(range(200i, -5).count(), 0);
738 assert_eq!(range(200i, -5).rev().count(), 0);
739 assert_eq!(range(200i, 200).count(), 0);
740 assert_eq!(range(200i, 200).rev().count(), 0);
742 assert_eq!(range(0i, 100).size_hint(), (100, Some(100)));
743 // this test is only meaningful when sizeof uint < sizeof u64
744 assert_eq!(range(uint::MAX - 1, uint::MAX).size_hint(), (1, Some(1)));
745 assert_eq!(range(-10i, -1).size_hint(), (9, Some(9)));
746 assert_eq!(range(Foo, Foo).size_hint(), (0, None));
750 fn test_range_inclusive() {
751 assert!(range_inclusive(0i, 5).collect::<Vec<int>>() ==
752 vec![0i, 1, 2, 3, 4, 5]);
753 assert!(range_inclusive(0i, 5).rev().collect::<Vec<int>>() ==
754 vec![5i, 4, 3, 2, 1, 0]);
755 assert_eq!(range_inclusive(200i, -5).count(), 0);
756 assert_eq!(range_inclusive(200i, -5).rev().count(), 0);
757 assert!(range_inclusive(200i, 200).collect::<Vec<int>>() == vec![200]);
758 assert!(range_inclusive(200i, 200).rev().collect::<Vec<int>>() == vec![200]);
762 fn test_range_step() {
763 assert!(range_step(0i, 20, 5).collect::<Vec<int>>() ==
765 assert!(range_step(20i, 0, -5).collect::<Vec<int>>() ==
766 vec![20, 15, 10, 5]);
767 assert!(range_step(20i, 0, -6).collect::<Vec<int>>() ==
769 assert!(range_step(200u8, 255, 50).collect::<Vec<u8>>() ==
771 assert!(range_step(200i, -5, 1).collect::<Vec<int>>() == vec![]);
772 assert!(range_step(200i, 200, 1).collect::<Vec<int>>() == vec![]);
776 fn test_range_step_inclusive() {
777 assert!(range_step_inclusive(0i, 20, 5).collect::<Vec<int>>() ==
778 vec![0, 5, 10, 15, 20]);
779 assert!(range_step_inclusive(20i, 0, -5).collect::<Vec<int>>() ==
780 vec![20, 15, 10, 5, 0]);
781 assert!(range_step_inclusive(20i, 0, -6).collect::<Vec<int>>() ==
783 assert!(range_step_inclusive(200u8, 255, 50).collect::<Vec<u8>>() ==
785 assert!(range_step_inclusive(200i, -5, 1).collect::<Vec<int>>() ==
787 assert!(range_step_inclusive(200i, 200, 1).collect::<Vec<int>>() ==
793 let mut ys = [1i, 2, 3, 4, 5];
794 ys.mut_iter().reverse_();
795 assert!(ys == [5, 4, 3, 2, 1]);
799 fn test_peekable_is_empty() {
801 let mut it = a.iter().peekable();
802 assert!( !it.is_empty() );
804 assert!( it.is_empty() );
809 let v: [int, ..0] = [];
810 assert_eq!(v.iter().min_max(), NoElements);
813 assert!(v.iter().min_max() == OneElement(&1));
815 let v = [1i, 2, 3, 4, 5];
816 assert!(v.iter().min_max() == MinMax(&1, &5));
818 let v = [1i, 2, 3, 4, 5, 6];
819 assert!(v.iter().min_max() == MinMax(&1, &6));
821 let v = [1i, 1, 1, 1];
822 assert!(v.iter().min_max() == MinMax(&1, &1));
826 fn test_min_max_result() {
827 let r: MinMaxResult<int> = NoElements;
828 assert_eq!(r.into_option(), None)
830 let r = OneElement(1i);
831 assert_eq!(r.into_option(), Some((1,1)));
833 let r = MinMax(1i,2);
834 assert_eq!(r.into_option(), Some((1,2)));
839 let mut it = iterate(|x| x * 2, 1u);
840 assert_eq!(it.next(), Some(1u));
841 assert_eq!(it.next(), Some(2u));
842 assert_eq!(it.next(), Some(4u));
843 assert_eq!(it.next(), Some(8u));