1 // Copyright 2012-2015 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.
11 use std::cmp::Ordering::{Equal, Greater, Less};
12 use std::default::Default;
13 use std::iter::RandomAccessIterator;
15 use std::__rand::{Rng, thread_rng};
17 use std::slice::ElementSwaps;
19 fn square(n: usize) -> usize { n * n }
21 fn is_odd(n: &usize) -> bool { *n % 2 == 1 }
25 // Test on-stack from_fn.
26 let mut v: Vec<_> = (0..3).map(square).collect();
29 assert_eq!(v.len(), 3);
35 // Test on-heap from_fn.
36 v = (0..5).map(square).collect();
39 assert_eq!(v.len(), 5);
50 // Test on-stack from_elem.
51 let mut v = vec![10, 10];
54 assert_eq!(v.len(), 2);
59 // Test on-heap from_elem.
74 let xs: [i32; 0] = [];
75 assert!(xs.is_empty());
76 assert!(![0].is_empty());
80 fn test_len_divzero() {
83 let v1 : &[Z] = &[[]];
84 let v2 : &[Z] = &[[], []];
85 assert_eq!(mem::size_of::<Z>(), 0);
86 assert_eq!(v0.len(), 0);
87 assert_eq!(v1.len(), 1);
88 assert_eq!(v2.len(), 2);
94 assert_eq!(a.get(1), None);
96 assert_eq!(a.get(1).unwrap(), &12);
98 assert_eq!(a.get(1).unwrap(), &12);
104 assert_eq!(a.first(), None);
106 assert_eq!(a.first().unwrap(), &11);
108 assert_eq!(a.first().unwrap(), &11);
112 fn test_first_mut() {
114 assert_eq!(a.first_mut(), None);
116 assert_eq!(*a.first_mut().unwrap(), 11);
118 assert_eq!(*a.first_mut().unwrap(), 11);
123 let mut a = vec![11];
125 assert_eq!(a.tail(), b);
127 let b: &[i32] = &[12];
128 assert_eq!(a.tail(), b);
133 let mut a = vec![11];
134 let b: &mut [i32] = &mut [];
135 assert!(a.tail_mut() == b);
137 let b: &mut [_] = &mut [12];
138 assert!(a.tail_mut() == b);
143 fn test_tail_empty() {
144 let a = Vec::<i32>::new();
150 fn test_tail_mut_empty() {
151 let mut a = Vec::<i32>::new();
157 let mut a = vec![11];
159 assert_eq!(a.init(), b);
162 assert_eq!(a.init(), b);
167 let mut a = vec![11];
168 let b: &mut [i32] = &mut [];
169 assert!(a.init_mut() == b);
171 let b: &mut [_] = &mut [11];
172 assert!(a.init_mut() == b);
177 fn test_init_empty() {
178 let a = Vec::<i32>::new();
184 fn test_init_mut_empty() {
185 let mut a = Vec::<i32>::new();
192 assert_eq!(a.last(), None);
194 assert_eq!(a.last().unwrap(), &11);
196 assert_eq!(a.last().unwrap(), &12);
202 assert_eq!(a.last_mut(), None);
204 assert_eq!(*a.last_mut().unwrap(), 11);
206 assert_eq!(*a.last_mut().unwrap(), 12);
211 // Test fixed length vector.
212 let vec_fixed = [1, 2, 3, 4];
213 let v_a = vec_fixed[1..vec_fixed.len()].to_vec();
214 assert_eq!(v_a.len(), 3);
216 assert_eq!(v_a[0], 2);
217 assert_eq!(v_a[1], 3);
218 assert_eq!(v_a[2], 4);
221 let vec_stack: &[_] = &[1, 2, 3];
222 let v_b = vec_stack[1..3].to_vec();
223 assert_eq!(v_b.len(), 2);
225 assert_eq!(v_b[0], 2);
226 assert_eq!(v_b[1], 3);
229 let vec_unique = vec![1, 2, 3, 4, 5, 6];
230 let v_d = vec_unique[1..6].to_vec();
231 assert_eq!(v_d.len(), 5);
233 assert_eq!(v_d[0], 2);
234 assert_eq!(v_d[1], 3);
235 assert_eq!(v_d[2], 4);
236 assert_eq!(v_d[3], 5);
237 assert_eq!(v_d[4], 6);
241 fn test_slice_from() {
242 let vec: &[_] = &[1, 2, 3, 4];
243 assert_eq!(&vec[..], vec);
244 let b: &[_] = &[3, 4];
245 assert_eq!(&vec[2..], b);
247 assert_eq!(&vec[4..], b);
252 let vec: &[_] = &[1, 2, 3, 4];
253 assert_eq!(&vec[..4], vec);
254 let b: &[_] = &[1, 2];
255 assert_eq!(&vec[..2], b);
257 assert_eq!(&vec[..0], b);
265 assert_eq!(v.len(), 0);
266 assert_eq!(e, Some(5));
274 fn test_swap_remove() {
275 let mut v = vec![1, 2, 3, 4, 5];
276 let mut e = v.swap_remove(0);
278 assert_eq!(v, [5, 2, 3, 4]);
279 e = v.swap_remove(3);
281 assert_eq!(v, [5, 2, 3]);
286 fn test_swap_remove_fail() {
288 let _ = v.swap_remove(0);
289 let _ = v.swap_remove(0);
293 fn test_swap_remove_noncopyable() {
294 // Tests that we don't accidentally run destructors twice.
295 let mut v: Vec<Box<_>> = Vec::new();
299 let mut _e = v.swap_remove(0);
300 assert_eq!(v.len(), 2);
301 _e = v.swap_remove(1);
302 assert_eq!(v.len(), 1);
303 _e = v.swap_remove(0);
304 assert_eq!(v.len(), 0);
309 // Test on-stack push().
312 assert_eq!(v.len(), 1);
315 // Test on-heap push().
317 assert_eq!(v.len(), 2);
324 let mut v: Vec<Box<_>> = vec![box 6,box 5,box 4];
327 assert_eq!(v.len(), 1);
328 assert_eq!(*(v[0]), 6);
329 // If the unsafe block didn't drop things properly, we blow up here.
334 let mut v: Vec<Box<_>> = vec![box 6,box 5,box 4];
336 assert_eq!(v.len(), 0);
337 // If the unsafe block didn't drop things properly, we blow up here.
342 fn case(a: Vec<i32>, b: Vec<i32>) {
347 case(vec![], vec![]);
348 case(vec![1], vec![1]);
349 case(vec![1,1], vec![1]);
350 case(vec![1,2,3], vec![1,2,3]);
351 case(vec![1,1,2,3], vec![1,2,3]);
352 case(vec![1,2,2,3], vec![1,2,3]);
353 case(vec![1,2,3,3], vec![1,2,3]);
354 case(vec![1,1,2,2,2,3,3], vec![1,2,3]);
358 fn test_dedup_unique() {
359 let mut v0: Vec<Box<_>> = vec![box 1, box 1, box 2, box 3];
361 let mut v1: Vec<Box<_>> = vec![box 1, box 2, box 2, box 3];
363 let mut v2: Vec<Box<_>> = vec![box 1, box 2, box 3, box 3];
366 * If the boxed pointers were leaked or otherwise misused, valgrind
367 * and/or rt should raise errors.
372 fn test_dedup_shared() {
373 let mut v0: Vec<Box<_>> = vec![box 1, box 1, box 2, box 3];
375 let mut v1: Vec<Box<_>> = vec![box 1, box 2, box 2, box 3];
377 let mut v2: Vec<Box<_>> = vec![box 1, box 2, box 3, box 3];
380 * If the pointers were leaked or otherwise misused, valgrind and/or
381 * rt should raise errors.
387 let mut v = vec![1, 2, 3, 4, 5];
389 assert_eq!(v, [1, 3, 5]);
393 fn test_element_swaps() {
394 let mut v = [1, 2, 3];
395 for (i, (a, b)) in ElementSwaps::new(v.len()).enumerate() {
398 0 => assert!(v == [1, 3, 2]),
399 1 => assert!(v == [3, 1, 2]),
400 2 => assert!(v == [3, 2, 1]),
401 3 => assert!(v == [2, 3, 1]),
402 4 => assert!(v == [2, 1, 3]),
403 5 => assert!(v == [1, 2, 3]),
410 fn test_lexicographic_permutations() {
411 let v : &mut[_] = &mut[1, 2, 3, 4, 5];
412 assert!(v.prev_permutation() == false);
413 assert!(v.next_permutation());
414 let b: &mut[_] = &mut[1, 2, 3, 5, 4];
416 assert!(v.prev_permutation());
417 let b: &mut[_] = &mut[1, 2, 3, 4, 5];
419 assert!(v.next_permutation());
420 assert!(v.next_permutation());
421 let b: &mut[_] = &mut[1, 2, 4, 3, 5];
423 assert!(v.next_permutation());
424 let b: &mut[_] = &mut[1, 2, 4, 5, 3];
427 let v : &mut[_] = &mut[1, 0, 0, 0];
428 assert!(v.next_permutation() == false);
429 assert!(v.prev_permutation());
430 let b: &mut[_] = &mut[0, 1, 0, 0];
432 assert!(v.prev_permutation());
433 let b: &mut[_] = &mut[0, 0, 1, 0];
435 assert!(v.prev_permutation());
436 let b: &mut[_] = &mut[0, 0, 0, 1];
438 assert!(v.prev_permutation() == false);
442 fn test_lexicographic_permutations_empty_and_short() {
443 let empty : &mut[i32] = &mut[];
444 assert!(empty.next_permutation() == false);
445 let b: &mut[i32] = &mut[];
447 assert!(empty.prev_permutation() == false);
450 let one_elem : &mut[_] = &mut[4];
451 assert!(one_elem.prev_permutation() == false);
452 let b: &mut[_] = &mut[4];
453 assert!(one_elem == b);
454 assert!(one_elem.next_permutation() == false);
455 assert!(one_elem == b);
457 let two_elem : &mut[_] = &mut[1, 2];
458 assert!(two_elem.prev_permutation() == false);
459 let b : &mut[_] = &mut[1, 2];
460 let c : &mut[_] = &mut[2, 1];
461 assert!(two_elem == b);
462 assert!(two_elem.next_permutation());
463 assert!(two_elem == c);
464 assert!(two_elem.next_permutation() == false);
465 assert!(two_elem == c);
466 assert!(two_elem.prev_permutation());
467 assert!(two_elem == b);
468 assert!(two_elem.prev_permutation() == false);
469 assert!(two_elem == b);
473 fn test_position_elem() {
474 assert!([].position_elem(&1).is_none());
476 let v1 = vec![1, 2, 3, 3, 2, 5];
477 assert_eq!(v1.position_elem(&1), Some(0));
478 assert_eq!(v1.position_elem(&2), Some(1));
479 assert_eq!(v1.position_elem(&5), Some(5));
480 assert!(v1.position_elem(&4).is_none());
484 fn test_binary_search() {
485 assert_eq!([1,2,3,4,5].binary_search(&5).ok(), Some(4));
486 assert_eq!([1,2,3,4,5].binary_search(&4).ok(), Some(3));
487 assert_eq!([1,2,3,4,5].binary_search(&3).ok(), Some(2));
488 assert_eq!([1,2,3,4,5].binary_search(&2).ok(), Some(1));
489 assert_eq!([1,2,3,4,5].binary_search(&1).ok(), Some(0));
491 assert_eq!([2,4,6,8,10].binary_search(&1).ok(), None);
492 assert_eq!([2,4,6,8,10].binary_search(&5).ok(), None);
493 assert_eq!([2,4,6,8,10].binary_search(&4).ok(), Some(1));
494 assert_eq!([2,4,6,8,10].binary_search(&10).ok(), Some(4));
496 assert_eq!([2,4,6,8].binary_search(&1).ok(), None);
497 assert_eq!([2,4,6,8].binary_search(&5).ok(), None);
498 assert_eq!([2,4,6,8].binary_search(&4).ok(), Some(1));
499 assert_eq!([2,4,6,8].binary_search(&8).ok(), Some(3));
501 assert_eq!([2,4,6].binary_search(&1).ok(), None);
502 assert_eq!([2,4,6].binary_search(&5).ok(), None);
503 assert_eq!([2,4,6].binary_search(&4).ok(), Some(1));
504 assert_eq!([2,4,6].binary_search(&6).ok(), Some(2));
506 assert_eq!([2,4].binary_search(&1).ok(), None);
507 assert_eq!([2,4].binary_search(&5).ok(), None);
508 assert_eq!([2,4].binary_search(&2).ok(), Some(0));
509 assert_eq!([2,4].binary_search(&4).ok(), Some(1));
511 assert_eq!([2].binary_search(&1).ok(), None);
512 assert_eq!([2].binary_search(&5).ok(), None);
513 assert_eq!([2].binary_search(&2).ok(), Some(0));
515 assert_eq!([].binary_search(&1).ok(), None);
516 assert_eq!([].binary_search(&5).ok(), None);
518 assert!([1,1,1,1,1].binary_search(&1).ok() != None);
519 assert!([1,1,1,1,2].binary_search(&1).ok() != None);
520 assert!([1,1,1,2,2].binary_search(&1).ok() != None);
521 assert!([1,1,2,2,2].binary_search(&1).ok() != None);
522 assert_eq!([1,2,2,2,2].binary_search(&1).ok(), Some(0));
524 assert_eq!([1,2,3,4,5].binary_search(&6).ok(), None);
525 assert_eq!([1,2,3,4,5].binary_search(&0).ok(), None);
530 let mut v = vec![10, 20];
531 assert_eq!(v[0], 10);
532 assert_eq!(v[1], 20);
534 assert_eq!(v[0], 20);
535 assert_eq!(v[1], 10);
537 let mut v3 = Vec::<i32>::new();
539 assert!(v3.is_empty());
546 let mut v: Vec<_> = thread_rng().gen_iter::<i32>().take(len).collect();
547 let mut v1 = v.clone();
550 assert!(v.windows(2).all(|w| w[0] <= w[1]));
552 v1.sort_by(|a, b| a.cmp(b));
553 assert!(v1.windows(2).all(|w| w[0] <= w[1]));
555 v1.sort_by(|a, b| b.cmp(a));
556 assert!(v1.windows(2).all(|w| w[0] >= w[1]));
561 let mut v: [i32; 0] = [];
564 let mut v = [0xDEADBEEFu64];
566 assert!(v == [0xDEADBEEF]);
570 fn test_sort_stability() {
573 let mut counts = [0; 10];
575 // create a vector like [(6, 1), (5, 1), (6, 2), ...],
576 // where the first item of each tuple is random, but
577 // the second item represents which occurrence of that
578 // number this element is, i.e. the second elements
579 // will occur in sorted order.
580 let mut v: Vec<_> = (0..len).map(|_| {
581 let n = thread_rng().gen::<usize>() % 10;
586 // only sort on the first element, so an unstable sort
587 // may mix up the counts.
588 v.sort_by(|&(a,_), &(b,_)| a.cmp(&b));
590 // this comparison includes the count (the second item
591 // of the tuple), so elements with equal first items
592 // will need to be ordered with increasing
593 // counts... i.e. exactly asserting that this sort is
595 assert!(v.windows(2).all(|w| w[0] <= w[1]));
602 let v: [Vec<i32>; 0] = [];
605 let d = [vec![1], vec![2, 3]].concat();
606 assert_eq!(d, [1, 2, 3]);
608 let v: &[&[_]] = &[&[1], &[2, 3]];
609 assert_eq!(v.connect(&0), [1, 0, 2, 3]);
610 let v: &[&[_]] = &[&[1], &[2], &[3]];
611 assert_eq!(v.connect(&0), [1, 0, 2, 0, 3]);
616 let v: [Vec<i32>; 0] = [];
617 assert_eq!(v.connect(&0), []);
618 assert_eq!([vec![1], vec![2, 3]].connect(&0), [1, 0, 2, 3]);
619 assert_eq!([vec![1], vec![2], vec![3]].connect(&0), [1, 0, 2, 0, 3]);
621 let v: [&[_]; 2] = [&[1], &[2, 3]];
622 assert_eq!(v.connect(&0), [1, 0, 2, 3]);
623 let v: [&[_]; 3] = [&[1], &[2], &[3]];
624 assert_eq!(v.connect(&0), [1, 0, 2, 0, 3]);
629 let mut a = vec![1, 2, 4];
631 assert_eq!(a, [1, 2, 3, 4]);
633 let mut a = vec![1, 2, 3];
635 assert_eq!(a, [0, 1, 2, 3]);
637 let mut a = vec![1, 2, 3];
639 assert_eq!(a, [1, 2, 3, 4]);
648 fn test_insert_oob() {
649 let mut a = vec![1, 2, 3];
655 let mut a = vec![1, 2, 3, 4];
657 assert_eq!(a.remove(2), 3);
658 assert_eq!(a, [1, 2, 4]);
660 assert_eq!(a.remove(2), 4);
661 assert_eq!(a, [1, 2]);
663 assert_eq!(a.remove(0), 1);
666 assert_eq!(a.remove(0), 2);
672 fn test_remove_fail() {
682 assert!(v.capacity() >= 11);
687 let v = vec![1, 2, 3, 4, 5];
689 assert_eq!(v.len(), 2);
696 fn test_permute_fail() {
697 let v: [(Box<_>, Rc<_>); 4] =
698 [(box 0, Rc::new(0)), (box 0, Rc::new(0)),
699 (box 0, Rc::new(0)), (box 0, Rc::new(0))];
701 for _ in v.permutations() {
710 fn test_total_ord() {
712 [1, 2, 3, 4][..].cmp(c) == Greater;
713 let c = &[1, 2, 3, 4];
714 [1, 2, 3][..].cmp(c) == Less;
715 let c = &[1, 2, 3, 6];
716 [1, 2, 3, 4][..].cmp(c) == Equal;
717 let c = &[1, 2, 3, 4, 5, 6];
718 [1, 2, 3, 4, 5, 5, 5, 5][..].cmp(c) == Less;
719 let c = &[1, 2, 3, 4];
720 [2, 2][..].cmp(c) == Greater;
725 let xs = [1, 2, 5, 10, 11];
726 let mut it = xs.iter();
727 assert_eq!(it.size_hint(), (5, Some(5)));
728 assert_eq!(it.next().unwrap(), &1);
729 assert_eq!(it.size_hint(), (4, Some(4)));
730 assert_eq!(it.next().unwrap(), &2);
731 assert_eq!(it.size_hint(), (3, Some(3)));
732 assert_eq!(it.next().unwrap(), &5);
733 assert_eq!(it.size_hint(), (2, Some(2)));
734 assert_eq!(it.next().unwrap(), &10);
735 assert_eq!(it.size_hint(), (1, Some(1)));
736 assert_eq!(it.next().unwrap(), &11);
737 assert_eq!(it.size_hint(), (0, Some(0)));
738 assert!(it.next().is_none());
742 fn test_random_access_iterator() {
743 let xs = [1, 2, 5, 10, 11];
744 let mut it = xs.iter();
746 assert_eq!(it.indexable(), 5);
747 assert_eq!(it.idx(0).unwrap(), &1);
748 assert_eq!(it.idx(2).unwrap(), &5);
749 assert_eq!(it.idx(4).unwrap(), &11);
750 assert!(it.idx(5).is_none());
752 assert_eq!(it.next().unwrap(), &1);
753 assert_eq!(it.indexable(), 4);
754 assert_eq!(it.idx(0).unwrap(), &2);
755 assert_eq!(it.idx(3).unwrap(), &11);
756 assert!(it.idx(4).is_none());
758 assert_eq!(it.next().unwrap(), &2);
759 assert_eq!(it.indexable(), 3);
760 assert_eq!(it.idx(1).unwrap(), &10);
761 assert!(it.idx(3).is_none());
763 assert_eq!(it.next().unwrap(), &5);
764 assert_eq!(it.indexable(), 2);
765 assert_eq!(it.idx(1).unwrap(), &11);
767 assert_eq!(it.next().unwrap(), &10);
768 assert_eq!(it.indexable(), 1);
769 assert_eq!(it.idx(0).unwrap(), &11);
770 assert!(it.idx(1).is_none());
772 assert_eq!(it.next().unwrap(), &11);
773 assert_eq!(it.indexable(), 0);
774 assert!(it.idx(0).is_none());
776 assert!(it.next().is_none());
780 fn test_iter_size_hints() {
781 let mut xs = [1, 2, 5, 10, 11];
782 assert_eq!(xs.iter().size_hint(), (5, Some(5)));
783 assert_eq!(xs.iter_mut().size_hint(), (5, Some(5)));
787 fn test_iter_clone() {
789 let mut it = xs.iter();
791 let mut jt = it.clone();
792 assert_eq!(it.next(), jt.next());
793 assert_eq!(it.next(), jt.next());
794 assert_eq!(it.next(), jt.next());
798 fn test_mut_iterator() {
799 let mut xs = [1, 2, 3, 4, 5];
803 assert!(xs == [2, 3, 4, 5, 6])
807 fn test_rev_iterator() {
809 let xs = [1, 2, 5, 10, 11];
810 let ys = [11, 10, 5, 2, 1];
812 for &x in xs.iter().rev() {
813 assert_eq!(x, ys[i]);
820 fn test_mut_rev_iterator() {
821 let mut xs = [1, 2, 3, 4, 5];
822 for (i,x) in xs.iter_mut().rev().enumerate() {
825 assert!(xs == [5, 5, 5, 5, 5])
829 fn test_move_iterator() {
830 let xs = vec![1,2,3,4,5];
831 assert_eq!(xs.into_iter().fold(0, |a: usize, b: usize| 10*a + b), 12345);
835 fn test_move_rev_iterator() {
836 let xs = vec![1,2,3,4,5];
837 assert_eq!(xs.into_iter().rev().fold(0, |a: usize, b: usize| 10*a + b), 54321);
841 fn test_splitator() {
842 let xs = &[1,2,3,4,5];
844 let splits: &[&[_]] = &[&[1], &[3], &[5]];
845 assert_eq!(xs.split(|x| *x % 2 == 0).collect::<Vec<_>>(),
847 let splits: &[&[_]] = &[&[], &[2,3,4,5]];
848 assert_eq!(xs.split(|x| *x == 1).collect::<Vec<_>>(),
850 let splits: &[&[_]] = &[&[1,2,3,4], &[]];
851 assert_eq!(xs.split(|x| *x == 5).collect::<Vec<_>>(),
853 let splits: &[&[_]] = &[&[1,2,3,4,5]];
854 assert_eq!(xs.split(|x| *x == 10).collect::<Vec<_>>(),
856 let splits: &[&[_]] = &[&[], &[], &[], &[], &[], &[]];
857 assert_eq!(xs.split(|_| true).collect::<Vec<&[i32]>>(),
860 let xs: &[i32] = &[];
861 let splits: &[&[i32]] = &[&[]];
862 assert_eq!(xs.split(|x| *x == 5).collect::<Vec<&[i32]>>(), splits);
866 fn test_splitnator() {
867 let xs = &[1,2,3,4,5];
869 let splits: &[&[_]] = &[&[1,2,3,4,5]];
870 assert_eq!(xs.splitn(1, |x| *x % 2 == 0).collect::<Vec<_>>(),
872 let splits: &[&[_]] = &[&[1], &[3,4,5]];
873 assert_eq!(xs.splitn(2, |x| *x % 2 == 0).collect::<Vec<_>>(),
875 let splits: &[&[_]] = &[&[], &[], &[], &[4,5]];
876 assert_eq!(xs.splitn(4, |_| true).collect::<Vec<_>>(),
879 let xs: &[i32] = &[];
880 let splits: &[&[i32]] = &[&[]];
881 assert_eq!(xs.splitn(2, |x| *x == 5).collect::<Vec<_>>(), splits);
885 fn test_splitnator_mut() {
886 let xs = &mut [1,2,3,4,5];
888 let splits: &[&mut[_]] = &[&mut [1,2,3,4,5]];
889 assert_eq!(xs.splitn_mut(1, |x| *x % 2 == 0).collect::<Vec<_>>(),
891 let splits: &[&mut[_]] = &[&mut [1], &mut [3,4,5]];
892 assert_eq!(xs.splitn_mut(2, |x| *x % 2 == 0).collect::<Vec<_>>(),
894 let splits: &[&mut[_]] = &[&mut [], &mut [], &mut [], &mut [4,5]];
895 assert_eq!(xs.splitn_mut(4, |_| true).collect::<Vec<_>>(),
898 let xs: &mut [i32] = &mut [];
899 let splits: &[&mut[i32]] = &[&mut []];
900 assert_eq!(xs.splitn_mut(2, |x| *x == 5).collect::<Vec<_>>(),
905 fn test_rsplitator() {
906 let xs = &[1,2,3,4,5];
908 let splits: &[&[_]] = &[&[5], &[3], &[1]];
909 assert_eq!(xs.split(|x| *x % 2 == 0).rev().collect::<Vec<_>>(),
911 let splits: &[&[_]] = &[&[2,3,4,5], &[]];
912 assert_eq!(xs.split(|x| *x == 1).rev().collect::<Vec<_>>(),
914 let splits: &[&[_]] = &[&[], &[1,2,3,4]];
915 assert_eq!(xs.split(|x| *x == 5).rev().collect::<Vec<_>>(),
917 let splits: &[&[_]] = &[&[1,2,3,4,5]];
918 assert_eq!(xs.split(|x| *x == 10).rev().collect::<Vec<_>>(),
921 let xs: &[i32] = &[];
922 let splits: &[&[i32]] = &[&[]];
923 assert_eq!(xs.split(|x| *x == 5).rev().collect::<Vec<&[i32]>>(), splits);
927 fn test_rsplitnator() {
928 let xs = &[1,2,3,4,5];
930 let splits: &[&[_]] = &[&[1,2,3,4,5]];
931 assert_eq!(xs.rsplitn(1, |x| *x % 2 == 0).collect::<Vec<_>>(),
933 let splits: &[&[_]] = &[&[5], &[1,2,3]];
934 assert_eq!(xs.rsplitn(2, |x| *x % 2 == 0).collect::<Vec<_>>(),
936 let splits: &[&[_]] = &[&[], &[], &[], &[1,2]];
937 assert_eq!(xs.rsplitn(4, |_| true).collect::<Vec<_>>(),
940 let xs: &[i32] = &[];
941 let splits: &[&[i32]] = &[&[]];
942 assert_eq!(xs.rsplitn(2, |x| *x == 5).collect::<Vec<&[i32]>>(), splits);
943 assert!(xs.rsplitn(0, |x| *x % 2 == 0).next().is_none());
947 fn test_windowsator() {
950 let wins: &[&[_]] = &[&[1,2], &[2,3], &[3,4]];
951 assert_eq!(v.windows(2).collect::<Vec<_>>(), wins);
953 let wins: &[&[_]] = &[&[1,2,3], &[2,3,4]];
954 assert_eq!(v.windows(3).collect::<Vec<_>>(), wins);
955 assert!(v.windows(6).next().is_none());
957 let wins: &[&[_]] = &[&[3,4], &[2,3], &[1,2]];
958 assert_eq!(v.windows(2).rev().collect::<Vec<&[_]>>(), wins);
959 let mut it = v.windows(2);
960 assert_eq!(it.indexable(), 3);
961 let win: &[_] = &[1,2];
962 assert_eq!(it.idx(0).unwrap(), win);
963 let win: &[_] = &[2,3];
964 assert_eq!(it.idx(1).unwrap(), win);
965 let win: &[_] = &[3,4];
966 assert_eq!(it.idx(2).unwrap(), win);
967 assert_eq!(it.idx(3), None);
972 fn test_windowsator_0() {
974 let _it = v.windows(0);
978 fn test_chunksator() {
979 let v = &[1,2,3,4,5];
981 assert_eq!(v.chunks(2).len(), 3);
983 let chunks: &[&[_]] = &[&[1,2], &[3,4], &[5]];
984 assert_eq!(v.chunks(2).collect::<Vec<_>>(), chunks);
985 let chunks: &[&[_]] = &[&[1,2,3], &[4,5]];
986 assert_eq!(v.chunks(3).collect::<Vec<_>>(), chunks);
987 let chunks: &[&[_]] = &[&[1,2,3,4,5]];
988 assert_eq!(v.chunks(6).collect::<Vec<_>>(), chunks);
990 let chunks: &[&[_]] = &[&[5], &[3,4], &[1,2]];
991 assert_eq!(v.chunks(2).rev().collect::<Vec<_>>(), chunks);
992 let mut it = v.chunks(2);
993 assert_eq!(it.indexable(), 3);
995 let chunk: &[_] = &[1,2];
996 assert_eq!(it.idx(0).unwrap(), chunk);
997 let chunk: &[_] = &[3,4];
998 assert_eq!(it.idx(1).unwrap(), chunk);
999 let chunk: &[_] = &[5];
1000 assert_eq!(it.idx(2).unwrap(), chunk);
1001 assert_eq!(it.idx(3), None);
1006 fn test_chunksator_0() {
1008 let _it = v.chunks(0);
1012 fn test_move_from() {
1013 let mut a = [1,2,3,4,5];
1014 let b = vec![6,7,8];
1015 assert_eq!(a.move_from(b, 0, 3), 3);
1016 assert!(a == [6,7,8,4,5]);
1017 let mut a = [7,2,8,1];
1018 let b = vec![3,1,4,1,5,9];
1019 assert_eq!(a.move_from(b, 0, 6), 4);
1020 assert!(a == [3,1,4,1]);
1021 let mut a = [1,2,3,4];
1022 let b = vec![5,6,7,8,9,0];
1023 assert_eq!(a.move_from(b, 2, 3), 1);
1024 assert!(a == [7,2,3,4]);
1025 let mut a = [1,2,3,4,5];
1026 let b = vec![5,6,7,8,9,0];
1027 assert_eq!(a[2..4].move_from(b,1,6), 2);
1028 assert!(a == [1,2,6,7,5]);
1032 fn test_reverse_part() {
1033 let mut values = [1,2,3,4,5];
1034 values[1..4].reverse();
1035 assert!(values == [1,4,3,2,5]);
1040 macro_rules! test_show_vec {
1041 ($x:expr, $x_str:expr) => ({
1042 let (x, x_str) = ($x, $x_str);
1043 assert_eq!(format!("{:?}", x), x_str);
1044 assert_eq!(format!("{:?}", x), x_str);
1047 let empty = Vec::<i32>::new();
1048 test_show_vec!(empty, "[]");
1049 test_show_vec!(vec![1], "[1]");
1050 test_show_vec!(vec![1, 2, 3], "[1, 2, 3]");
1051 test_show_vec!(vec![vec![], vec![1], vec![1, 1]],
1052 "[[], [1], [1, 1]]");
1054 let empty_mut: &mut [i32] = &mut[];
1055 test_show_vec!(empty_mut, "[]");
1057 test_show_vec!(v, "[1]");
1058 let v = &mut[1, 2, 3];
1059 test_show_vec!(v, "[1, 2, 3]");
1060 let v: &mut[&mut[_]] = &mut[&mut[], &mut[1], &mut[1, 1]];
1061 test_show_vec!(v, "[[], [1], [1, 1]]");
1065 fn test_vec_default() {
1068 let v: $ty = Default::default();
1069 assert!(v.is_empty());
1078 fn test_bytes_set_memory() {
1079 use std::slice::bytes::MutableByteVector;
1081 let mut values = [1,2,3,4,5];
1082 values[0..5].set_memory(0xAB);
1083 assert!(values == [0xAB, 0xAB, 0xAB, 0xAB, 0xAB]);
1084 values[2..4].set_memory(0xFF);
1085 assert!(values == [0xAB, 0xAB, 0xFF, 0xFF, 0xAB]);
1090 fn test_overflow_does_not_cause_segfault() {
1092 v.reserve_exact(!0);
1099 fn test_overflow_does_not_cause_segfault_managed() {
1100 let mut v = vec![Rc::new(1)];
1101 v.reserve_exact(!0);
1106 fn test_mut_split_at() {
1107 let mut values = [1u8,2,3,4,5];
1109 let (left, right) = values.split_at_mut(2);
1111 let left: &[_] = left;
1112 assert!(left[..left.len()] == [1, 2]);
1119 let right: &[_] = right;
1120 assert!(right[..right.len()] == [3, 4, 5]);
1127 assert!(values == [2, 3, 5, 6, 7]);
1130 #[derive(Clone, PartialEq)]
1134 fn test_iter_zero_sized() {
1135 let mut v = vec![Foo, Foo, Foo];
1136 assert_eq!(v.len(), 3);
1161 assert_eq!(cnt, 11);
1163 let xs: [Foo; 3] = [Foo, Foo, Foo];
1173 fn test_shrink_to_fit() {
1174 let mut xs = vec![0, 1, 2, 3];
1178 assert_eq!(xs.capacity(), 128);
1180 assert_eq!(xs.capacity(), 100);
1181 assert_eq!(xs, (0..100).collect::<Vec<_>>());
1185 fn test_starts_with() {
1186 assert!(b"foobar".starts_with(b"foo"));
1187 assert!(!b"foobar".starts_with(b"oob"));
1188 assert!(!b"foobar".starts_with(b"bar"));
1189 assert!(!b"foo".starts_with(b"foobar"));
1190 assert!(!b"bar".starts_with(b"foobar"));
1191 assert!(b"foobar".starts_with(b"foobar"));
1192 let empty: &[u8] = &[];
1193 assert!(empty.starts_with(empty));
1194 assert!(!empty.starts_with(b"foo"));
1195 assert!(b"foobar".starts_with(empty));
1199 fn test_ends_with() {
1200 assert!(b"foobar".ends_with(b"bar"));
1201 assert!(!b"foobar".ends_with(b"oba"));
1202 assert!(!b"foobar".ends_with(b"foo"));
1203 assert!(!b"foo".ends_with(b"foobar"));
1204 assert!(!b"bar".ends_with(b"foobar"));
1205 assert!(b"foobar".ends_with(b"foobar"));
1206 let empty: &[u8] = &[];
1207 assert!(empty.ends_with(empty));
1208 assert!(!empty.ends_with(b"foo"));
1209 assert!(b"foobar".ends_with(empty));
1213 fn test_mut_splitator() {
1214 let mut xs = [0,1,0,2,3,0,0,4,5,0];
1215 assert_eq!(xs.split_mut(|x| *x == 0).count(), 6);
1216 for slice in xs.split_mut(|x| *x == 0) {
1219 assert!(xs == [0,1,0,3,2,0,0,5,4,0]);
1221 let mut xs = [0,1,0,2,3,0,0,4,5,0,6,7];
1222 for slice in xs.split_mut(|x| *x == 0).take(5) {
1225 assert!(xs == [0,1,0,3,2,0,0,5,4,0,6,7]);
1229 fn test_mut_splitator_rev() {
1230 let mut xs = [1,2,0,3,4,0,0,5,6,0];
1231 for slice in xs.split_mut(|x| *x == 0).rev().take(4) {
1234 assert!(xs == [1,2,0,4,3,0,0,6,5,0]);
1239 let mut v = [0,1,2];
1240 assert_eq!(v.get_mut(3), None);
1241 v.get_mut(1).map(|e| *e = 7);
1242 assert_eq!(v[1], 7);
1244 assert_eq!(v.get_mut(2), Some(&mut x));
1248 fn test_mut_chunks() {
1249 let mut v = [0, 1, 2, 3, 4, 5, 6];
1250 assert_eq!(v.chunks_mut(2).len(), 4);
1251 for (i, chunk) in v.chunks_mut(3).enumerate() {
1256 let result = [0, 0, 0, 1, 1, 1, 2];
1257 assert!(v == result);
1261 fn test_mut_chunks_rev() {
1262 let mut v = [0, 1, 2, 3, 4, 5, 6];
1263 for (i, chunk) in v.chunks_mut(3).rev().enumerate() {
1268 let result = [2, 2, 2, 1, 1, 1, 0];
1269 assert!(v == result);
1274 fn test_mut_chunks_0() {
1275 let mut v = [1, 2, 3, 4];
1276 let _it = v.chunks_mut(0);
1280 fn test_mut_last() {
1281 let mut x = [1, 2, 3, 4, 5];
1282 let h = x.last_mut();
1283 assert_eq!(*h.unwrap(), 5);
1285 let y: &mut [i32] = &mut [];
1286 assert!(y.last_mut().is_none());
1291 let xs: Box<_> = box [1, 2, 3];
1292 let ys = xs.to_vec();
1293 assert_eq!(ys, [1, 2, 3]);
1297 use std::iter::repeat;
1298 use std::{mem, ptr};
1299 use std::__rand::{Rng, thread_rng};
1301 use test::{Bencher, black_box};
1304 fn iterator(b: &mut Bencher) {
1305 // peculiar numbers to stop LLVM from optimising the summation
1307 let v: Vec<_> = (0..100).map(|i| i ^ (i << 1) ^ (i >> 1)).collect();
1314 // sum == 11806, to stop dead code elimination.
1315 if sum == 0 {panic!()}
1320 fn mut_iterator(b: &mut Bencher) {
1321 let mut v: Vec<_> = repeat(0).take(100).collect();
1333 fn concat(b: &mut Bencher) {
1334 let xss: Vec<Vec<i32>> =
1335 (0..100).map(|i| (0..i).collect()).collect();
1342 fn connect(b: &mut Bencher) {
1343 let xss: Vec<Vec<i32>> =
1344 (0..100).map(|i| (0..i).collect()).collect();
1351 fn push(b: &mut Bencher) {
1352 let mut vec = Vec::<i32>::new();
1360 fn starts_with_same_vector(b: &mut Bencher) {
1361 let vec: Vec<_> = (0..100).collect();
1363 vec.starts_with(&vec)
1368 fn starts_with_single_element(b: &mut Bencher) {
1369 let vec: Vec<_> = vec![0];
1371 vec.starts_with(&vec)
1376 fn starts_with_diff_one_element_at_end(b: &mut Bencher) {
1377 let vec: Vec<_> = (0..100).collect();
1378 let mut match_vec: Vec<_> = (0..99).collect();
1381 vec.starts_with(&match_vec)
1386 fn ends_with_same_vector(b: &mut Bencher) {
1387 let vec: Vec<_> = (0..100).collect();
1394 fn ends_with_single_element(b: &mut Bencher) {
1395 let vec: Vec<_> = vec![0];
1402 fn ends_with_diff_one_element_at_beginning(b: &mut Bencher) {
1403 let vec: Vec<_> = (0..100).collect();
1404 let mut match_vec: Vec<_> = (0..100).collect();
1407 vec.starts_with(&match_vec)
1412 fn contains_last_element(b: &mut Bencher) {
1413 let vec: Vec<_> = (0..100).collect();
1420 fn zero_1kb_from_elem(b: &mut Bencher) {
1422 repeat(0u8).take(1024).collect::<Vec<_>>()
1427 fn zero_1kb_set_memory(b: &mut Bencher) {
1429 let mut v = Vec::<u8>::with_capacity(1024);
1431 let vp = v.as_mut_ptr();
1432 ptr::write_bytes(vp, 0, 1024);
1440 fn zero_1kb_loop_set(b: &mut Bencher) {
1442 let mut v = Vec::<u8>::with_capacity(1024);
1453 fn zero_1kb_mut_iter(b: &mut Bencher) {
1455 let mut v = Vec::<u8>::with_capacity(1024);
1467 fn random_inserts(b: &mut Bencher) {
1468 let mut rng = thread_rng();
1470 let mut v: Vec<_> = repeat((0, 0)).take(30).collect();
1473 v.insert(rng.gen::<usize>() % (l + 1),
1479 fn random_removes(b: &mut Bencher) {
1480 let mut rng = thread_rng();
1482 let mut v: Vec<_> = repeat((0, 0)).take(130).collect();
1485 v.remove(rng.gen::<usize>() % l);
1491 fn sort_random_small(b: &mut Bencher) {
1492 let mut rng = thread_rng();
1494 let mut v: Vec<_> = rng.gen_iter::<u64>().take(5).collect();
1497 b.bytes = 5 * mem::size_of::<u64>() as u64;
1501 fn sort_random_medium(b: &mut Bencher) {
1502 let mut rng = thread_rng();
1504 let mut v: Vec<_> = rng.gen_iter::<u64>().take(100).collect();
1507 b.bytes = 100 * mem::size_of::<u64>() as u64;
1511 fn sort_random_large(b: &mut Bencher) {
1512 let mut rng = thread_rng();
1514 let mut v: Vec<_> = rng.gen_iter::<u64>().take(10000).collect();
1517 b.bytes = 10000 * mem::size_of::<u64>() as u64;
1521 fn sort_sorted(b: &mut Bencher) {
1522 let mut v: Vec<_> = (0..10000).collect();
1526 b.bytes = (v.len() * mem::size_of_val(&v[0])) as u64;
1529 type BigSortable = (u64, u64, u64, u64);
1532 fn sort_big_random_small(b: &mut Bencher) {
1533 let mut rng = thread_rng();
1535 let mut v = rng.gen_iter::<BigSortable>().take(5)
1536 .collect::<Vec<BigSortable>>();
1539 b.bytes = 5 * mem::size_of::<BigSortable>() as u64;
1543 fn sort_big_random_medium(b: &mut Bencher) {
1544 let mut rng = thread_rng();
1546 let mut v = rng.gen_iter::<BigSortable>().take(100)
1547 .collect::<Vec<BigSortable>>();
1550 b.bytes = 100 * mem::size_of::<BigSortable>() as u64;
1554 fn sort_big_random_large(b: &mut Bencher) {
1555 let mut rng = thread_rng();
1557 let mut v = rng.gen_iter::<BigSortable>().take(10000)
1558 .collect::<Vec<BigSortable>>();
1561 b.bytes = 10000 * mem::size_of::<BigSortable>() as u64;
1565 fn sort_big_sorted(b: &mut Bencher) {
1566 let mut v: Vec<BigSortable> = (0..10000).map(|i| (i, i, i, i)).collect();
1570 b.bytes = (v.len() * mem::size_of_val(&v[0])) as u64;