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.
12 use std::cmp::Ordering::{Equal, Greater, Less};
13 use std::cmp::Ordering;
17 use std::sync::atomic::Ordering::Relaxed;
18 use std::sync::atomic::{ATOMIC_USIZE_INIT, AtomicUsize};
21 use rand::{Rng, RngCore, thread_rng};
22 use rand::distributions::Standard;
24 fn square(n: usize) -> usize {
28 fn is_odd(n: &usize) -> bool {
34 // Test on-stack from_fn.
35 let mut v: Vec<_> = (0..3).map(square).collect();
38 assert_eq!(v.len(), 3);
44 // Test on-heap from_fn.
45 v = (0..5).map(square).collect();
48 assert_eq!(v.len(), 5);
59 // Test on-stack from_elem.
60 let mut v = vec![10, 10];
63 assert_eq!(v.len(), 2);
68 // Test on-heap from_elem.
83 let xs: [i32; 0] = [];
84 assert!(xs.is_empty());
85 assert!(![0].is_empty());
89 fn test_len_divzero() {
93 let v2: &[Z] = &[[], []];
94 assert_eq!(mem::size_of::<Z>(), 0);
95 assert_eq!(v0.len(), 0);
96 assert_eq!(v1.len(), 1);
97 assert_eq!(v2.len(), 2);
102 let mut a = vec![11];
103 assert_eq!(a.get(1), None);
105 assert_eq!(a.get(1).unwrap(), &12);
106 a = vec![11, 12, 13];
107 assert_eq!(a.get(1).unwrap(), &12);
113 assert_eq!(a.first(), None);
115 assert_eq!(a.first().unwrap(), &11);
117 assert_eq!(a.first().unwrap(), &11);
121 fn test_first_mut() {
123 assert_eq!(a.first_mut(), None);
125 assert_eq!(*a.first_mut().unwrap(), 11);
127 assert_eq!(*a.first_mut().unwrap(), 11);
131 fn test_split_first() {
132 let mut a = vec![11];
134 assert!(b.split_first().is_none());
135 assert_eq!(a.split_first(), Some((&11, b)));
137 let b: &[i32] = &[12];
138 assert_eq!(a.split_first(), Some((&11, b)));
142 fn test_split_first_mut() {
143 let mut a = vec![11];
144 let b: &mut [i32] = &mut [];
145 assert!(b.split_first_mut().is_none());
146 assert!(a.split_first_mut() == Some((&mut 11, b)));
148 let b: &mut [_] = &mut [12];
149 assert!(a.split_first_mut() == Some((&mut 11, b)));
153 fn test_split_last() {
154 let mut a = vec![11];
156 assert!(b.split_last().is_none());
157 assert_eq!(a.split_last(), Some((&11, b)));
160 assert_eq!(a.split_last(), Some((&12, b)));
164 fn test_split_last_mut() {
165 let mut a = vec![11];
166 let b: &mut [i32] = &mut [];
167 assert!(b.split_last_mut().is_none());
168 assert!(a.split_last_mut() == Some((&mut 11, b)));
171 let b: &mut [_] = &mut [11];
172 assert!(a.split_last_mut() == Some((&mut 12, b)));
178 assert_eq!(a.last(), None);
180 assert_eq!(a.last().unwrap(), &11);
182 assert_eq!(a.last().unwrap(), &12);
188 assert_eq!(a.last_mut(), None);
190 assert_eq!(*a.last_mut().unwrap(), 11);
192 assert_eq!(*a.last_mut().unwrap(), 12);
197 // Test fixed length vector.
198 let vec_fixed = [1, 2, 3, 4];
199 let v_a = vec_fixed[1..vec_fixed.len()].to_vec();
200 assert_eq!(v_a.len(), 3);
202 assert_eq!(v_a[0], 2);
203 assert_eq!(v_a[1], 3);
204 assert_eq!(v_a[2], 4);
207 let vec_stack: &[_] = &[1, 2, 3];
208 let v_b = vec_stack[1..3].to_vec();
209 assert_eq!(v_b.len(), 2);
211 assert_eq!(v_b[0], 2);
212 assert_eq!(v_b[1], 3);
215 let vec_unique = vec![1, 2, 3, 4, 5, 6];
216 let v_d = vec_unique[1..6].to_vec();
217 assert_eq!(v_d.len(), 5);
219 assert_eq!(v_d[0], 2);
220 assert_eq!(v_d[1], 3);
221 assert_eq!(v_d[2], 4);
222 assert_eq!(v_d[3], 5);
223 assert_eq!(v_d[4], 6);
227 fn test_slice_from() {
228 let vec: &[_] = &[1, 2, 3, 4];
229 assert_eq!(&vec[..], vec);
230 let b: &[_] = &[3, 4];
231 assert_eq!(&vec[2..], b);
233 assert_eq!(&vec[4..], b);
238 let vec: &[_] = &[1, 2, 3, 4];
239 assert_eq!(&vec[..4], vec);
240 let b: &[_] = &[1, 2];
241 assert_eq!(&vec[..2], b);
243 assert_eq!(&vec[..0], b);
251 assert_eq!(v.len(), 0);
252 assert_eq!(e, Some(5));
260 fn test_swap_remove() {
261 let mut v = vec![1, 2, 3, 4, 5];
262 let mut e = v.swap_remove(0);
264 assert_eq!(v, [5, 2, 3, 4]);
265 e = v.swap_remove(3);
267 assert_eq!(v, [5, 2, 3]);
272 fn test_swap_remove_fail() {
274 let _ = v.swap_remove(0);
275 let _ = v.swap_remove(0);
279 fn test_swap_remove_noncopyable() {
280 // Tests that we don't accidentally run destructors twice.
281 let mut v: Vec<Box<_>> = Vec::new();
285 let mut _e = v.swap_remove(0);
286 assert_eq!(v.len(), 2);
287 _e = v.swap_remove(1);
288 assert_eq!(v.len(), 1);
289 _e = v.swap_remove(0);
290 assert_eq!(v.len(), 0);
295 // Test on-stack push().
298 assert_eq!(v.len(), 1);
301 // Test on-heap push().
303 assert_eq!(v.len(), 2);
310 let mut v: Vec<Box<_>> = vec![box 6, box 5, box 4];
313 assert_eq!(v.len(), 1);
314 assert_eq!(*(v[0]), 6);
315 // If the unsafe block didn't drop things properly, we blow up here.
320 let mut v: Vec<Box<_>> = vec![box 6, box 5, box 4];
322 assert_eq!(v.len(), 0);
323 // If the unsafe block didn't drop things properly, we blow up here.
328 let mut v = vec![1, 2, 3, 4, 5];
330 assert_eq!(v, [1, 3, 5]);
334 fn test_binary_search() {
335 assert_eq!([1, 2, 3, 4, 5].binary_search(&5).ok(), Some(4));
336 assert_eq!([1, 2, 3, 4, 5].binary_search(&4).ok(), Some(3));
337 assert_eq!([1, 2, 3, 4, 5].binary_search(&3).ok(), Some(2));
338 assert_eq!([1, 2, 3, 4, 5].binary_search(&2).ok(), Some(1));
339 assert_eq!([1, 2, 3, 4, 5].binary_search(&1).ok(), Some(0));
341 assert_eq!([2, 4, 6, 8, 10].binary_search(&1).ok(), None);
342 assert_eq!([2, 4, 6, 8, 10].binary_search(&5).ok(), None);
343 assert_eq!([2, 4, 6, 8, 10].binary_search(&4).ok(), Some(1));
344 assert_eq!([2, 4, 6, 8, 10].binary_search(&10).ok(), Some(4));
346 assert_eq!([2, 4, 6, 8].binary_search(&1).ok(), None);
347 assert_eq!([2, 4, 6, 8].binary_search(&5).ok(), None);
348 assert_eq!([2, 4, 6, 8].binary_search(&4).ok(), Some(1));
349 assert_eq!([2, 4, 6, 8].binary_search(&8).ok(), Some(3));
351 assert_eq!([2, 4, 6].binary_search(&1).ok(), None);
352 assert_eq!([2, 4, 6].binary_search(&5).ok(), None);
353 assert_eq!([2, 4, 6].binary_search(&4).ok(), Some(1));
354 assert_eq!([2, 4, 6].binary_search(&6).ok(), Some(2));
356 assert_eq!([2, 4].binary_search(&1).ok(), None);
357 assert_eq!([2, 4].binary_search(&5).ok(), None);
358 assert_eq!([2, 4].binary_search(&2).ok(), Some(0));
359 assert_eq!([2, 4].binary_search(&4).ok(), Some(1));
361 assert_eq!([2].binary_search(&1).ok(), None);
362 assert_eq!([2].binary_search(&5).ok(), None);
363 assert_eq!([2].binary_search(&2).ok(), Some(0));
365 assert_eq!([].binary_search(&1).ok(), None);
366 assert_eq!([].binary_search(&5).ok(), None);
368 assert!([1, 1, 1, 1, 1].binary_search(&1).ok() != None);
369 assert!([1, 1, 1, 1, 2].binary_search(&1).ok() != None);
370 assert!([1, 1, 1, 2, 2].binary_search(&1).ok() != None);
371 assert!([1, 1, 2, 2, 2].binary_search(&1).ok() != None);
372 assert_eq!([1, 2, 2, 2, 2].binary_search(&1).ok(), Some(0));
374 assert_eq!([1, 2, 3, 4, 5].binary_search(&6).ok(), None);
375 assert_eq!([1, 2, 3, 4, 5].binary_search(&0).ok(), None);
380 let mut v = vec![10, 20];
381 assert_eq!(v[0], 10);
382 assert_eq!(v[1], 20);
384 assert_eq!(v[0], 20);
385 assert_eq!(v[1], 10);
387 let mut v3 = Vec::<i32>::new();
389 assert!(v3.is_empty());
391 // check the 1-byte-types path
392 let mut v = (-50..51i8).collect::<Vec<_>>();
394 assert_eq!(v, (-50..51i8).rev().collect::<Vec<_>>());
396 // check the 2-byte-types path
397 let mut v = (-50..51i16).collect::<Vec<_>>();
399 assert_eq!(v, (-50..51i16).rev().collect::<Vec<_>>());
404 let mut rng = thread_rng();
406 for len in (2..25).chain(500..510) {
407 for &modulus in &[5, 10, 100, 1000] {
409 let orig: Vec<_> = rng.sample_iter::<i32, _>(&Standard)
410 .map(|x| x % modulus)
414 // Sort in default order.
415 let mut v = orig.clone();
417 assert!(v.windows(2).all(|w| w[0] <= w[1]));
419 // Sort in ascending order.
420 let mut v = orig.clone();
421 v.sort_by(|a, b| a.cmp(b));
422 assert!(v.windows(2).all(|w| w[0] <= w[1]));
424 // Sort in descending order.
425 let mut v = orig.clone();
426 v.sort_by(|a, b| b.cmp(a));
427 assert!(v.windows(2).all(|w| w[0] >= w[1]));
429 // Sort in lexicographic order.
430 let mut v1 = orig.clone();
431 let mut v2 = orig.clone();
432 v1.sort_by_key(|x| x.to_string());
433 v2.sort_by_cached_key(|x| x.to_string());
434 assert!(v1.windows(2).all(|w| w[0].to_string() <= w[1].to_string()));
437 // Sort with many pre-sorted runs.
438 let mut v = orig.clone();
442 let a = rng.gen::<usize>() % len;
443 let b = rng.gen::<usize>() % len;
451 assert!(v.windows(2).all(|w| w[0] <= w[1]));
456 // Sort using a completely random comparison function.
457 // This will reorder the elements *somehow*, but won't panic.
458 let mut v = [0; 500];
459 for i in 0..v.len() {
462 v.sort_by(|_, _| *rng.choose(&[Less, Equal, Greater]).unwrap());
464 for i in 0..v.len() {
465 assert_eq!(v[i], i as i32);
473 let mut v = [0xDEADBEEFu64];
475 assert!(v == [0xDEADBEEF]);
479 fn test_sort_stability() {
480 for len in (2..25).chain(500..510) {
482 let mut counts = [0; 10];
484 // create a vector like [(6, 1), (5, 1), (6, 2), ...],
485 // where the first item of each tuple is random, but
486 // the second item represents which occurrence of that
487 // number this element is, i.e. the second elements
488 // will occur in sorted order.
489 let mut orig: Vec<_> = (0..len)
491 let n = thread_rng().gen::<usize>() % 10;
497 let mut v = orig.clone();
498 // Only sort on the first element, so an unstable sort
499 // may mix up the counts.
500 v.sort_by(|&(a, _), &(b, _)| a.cmp(&b));
502 // This comparison includes the count (the second item
503 // of the tuple), so elements with equal first items
504 // will need to be ordered with increasing
505 // counts... i.e. exactly asserting that this sort is
507 assert!(v.windows(2).all(|w| w[0] <= w[1]));
509 let mut v = orig.clone();
510 v.sort_by_cached_key(|&(x, _)| x);
511 assert!(v.windows(2).all(|w| w[0] <= w[1]));
517 fn test_rotate_left() {
518 let expected: Vec<_> = (0..13).collect();
519 let mut v = Vec::new();
522 v.clone_from(&expected);
524 assert_eq!(v, expected);
525 v.rotate_left(expected.len());
526 assert_eq!(v, expected);
527 let mut zst_array = [(), (), ()];
528 zst_array.rotate_left(2);
531 v = (5..13).chain(0..5).collect();
533 assert_eq!(v, expected);
535 let expected: Vec<_> = (0..1000).collect();
537 // small rotations in large slice, uses ptr::copy
538 v = (2..1000).chain(0..2).collect();
540 assert_eq!(v, expected);
541 v = (998..1000).chain(0..998).collect();
543 assert_eq!(v, expected);
545 // non-small prime rotation, has a few rounds of swapping
546 v = (389..1000).chain(0..389).collect();
547 v.rotate_left(1000-389);
548 assert_eq!(v, expected);
552 fn test_rotate_right() {
553 let expected: Vec<_> = (0..13).collect();
554 let mut v = Vec::new();
557 v.clone_from(&expected);
559 assert_eq!(v, expected);
560 v.rotate_right(expected.len());
561 assert_eq!(v, expected);
562 let mut zst_array = [(), (), ()];
563 zst_array.rotate_right(2);
566 v = (5..13).chain(0..5).collect();
568 assert_eq!(v, expected);
570 let expected: Vec<_> = (0..1000).collect();
572 // small rotations in large slice, uses ptr::copy
573 v = (2..1000).chain(0..2).collect();
575 assert_eq!(v, expected);
576 v = (998..1000).chain(0..998).collect();
578 assert_eq!(v, expected);
580 // non-small prime rotation, has a few rounds of swapping
581 v = (389..1000).chain(0..389).collect();
583 assert_eq!(v, expected);
588 let v: [Vec<i32>; 0] = [];
591 let d = [vec![1], vec![2, 3]].concat();
592 assert_eq!(d, [1, 2, 3]);
594 let v: &[&[_]] = &[&[1], &[2, 3]];
595 assert_eq!(v.join(&0), [1, 0, 2, 3]);
596 let v: &[&[_]] = &[&[1], &[2], &[3]];
597 assert_eq!(v.join(&0), [1, 0, 2, 0, 3]);
602 let v: [Vec<i32>; 0] = [];
603 assert_eq!(v.join(&0), []);
604 assert_eq!([vec![1], vec![2, 3]].join(&0), [1, 0, 2, 3]);
605 assert_eq!([vec![1], vec![2], vec![3]].join(&0), [1, 0, 2, 0, 3]);
607 let v: [&[_]; 2] = [&[1], &[2, 3]];
608 assert_eq!(v.join(&0), [1, 0, 2, 3]);
609 let v: [&[_]; 3] = [&[1], &[2], &[3]];
610 assert_eq!(v.join(&0), [1, 0, 2, 0, 3]);
614 fn test_join_nocopy() {
615 let v: [String; 0] = [];
616 assert_eq!(v.join(","), "");
617 assert_eq!(["a".to_string(), "ab".into()].join(","), "a,ab");
618 assert_eq!(["a".to_string(), "ab".into(), "abc".into()].join(","), "a,ab,abc");
619 assert_eq!(["a".to_string(), "ab".into(), "".into()].join(","), "a,ab,");
624 let mut a = vec![1, 2, 4];
626 assert_eq!(a, [1, 2, 3, 4]);
628 let mut a = vec![1, 2, 3];
630 assert_eq!(a, [0, 1, 2, 3]);
632 let mut a = vec![1, 2, 3];
634 assert_eq!(a, [1, 2, 3, 4]);
643 fn test_insert_oob() {
644 let mut a = vec![1, 2, 3];
650 let mut a = vec![1, 2, 3, 4];
652 assert_eq!(a.remove(2), 3);
653 assert_eq!(a, [1, 2, 4]);
655 assert_eq!(a.remove(2), 4);
656 assert_eq!(a, [1, 2]);
658 assert_eq!(a.remove(0), 1);
661 assert_eq!(a.remove(0), 2);
667 fn test_remove_fail() {
677 assert!(v.capacity() >= 11);
682 let v = vec![1, 2, 3, 4, 5];
684 assert_eq!(v.len(), 2);
689 macro_rules! assert_order {
690 (Greater, $a:expr, $b:expr) => {
691 assert_eq!($a.cmp($b), Greater);
694 (Less, $a:expr, $b:expr) => {
695 assert_eq!($a.cmp($b), Less);
698 (Equal, $a:expr, $b:expr) => {
699 assert_eq!($a.cmp($b), Equal);
705 fn test_total_ord_u8() {
706 let c = &[1u8, 2, 3];
707 assert_order!(Greater, &[1u8, 2, 3, 4][..], &c[..]);
708 let c = &[1u8, 2, 3, 4];
709 assert_order!(Less, &[1u8, 2, 3][..], &c[..]);
710 let c = &[1u8, 2, 3, 6];
711 assert_order!(Equal, &[1u8, 2, 3, 6][..], &c[..]);
712 let c = &[1u8, 2, 3, 4, 5, 6];
713 assert_order!(Less, &[1u8, 2, 3, 4, 5, 5, 5, 5][..], &c[..]);
714 let c = &[1u8, 2, 3, 4];
715 assert_order!(Greater, &[2u8, 2][..], &c[..]);
720 fn test_total_ord_i32() {
722 assert_order!(Greater, &[1, 2, 3, 4][..], &c[..]);
723 let c = &[1, 2, 3, 4];
724 assert_order!(Less, &[1, 2, 3][..], &c[..]);
725 let c = &[1, 2, 3, 6];
726 assert_order!(Equal, &[1, 2, 3, 6][..], &c[..]);
727 let c = &[1, 2, 3, 4, 5, 6];
728 assert_order!(Less, &[1, 2, 3, 4, 5, 5, 5, 5][..], &c[..]);
729 let c = &[1, 2, 3, 4];
730 assert_order!(Greater, &[2, 2][..], &c[..]);
735 let xs = [1, 2, 5, 10, 11];
736 let mut it = xs.iter();
737 assert_eq!(it.size_hint(), (5, Some(5)));
738 assert_eq!(it.next().unwrap(), &1);
739 assert_eq!(it.size_hint(), (4, Some(4)));
740 assert_eq!(it.next().unwrap(), &2);
741 assert_eq!(it.size_hint(), (3, Some(3)));
742 assert_eq!(it.next().unwrap(), &5);
743 assert_eq!(it.size_hint(), (2, Some(2)));
744 assert_eq!(it.next().unwrap(), &10);
745 assert_eq!(it.size_hint(), (1, Some(1)));
746 assert_eq!(it.next().unwrap(), &11);
747 assert_eq!(it.size_hint(), (0, Some(0)));
748 assert!(it.next().is_none());
752 fn test_iter_size_hints() {
753 let mut xs = [1, 2, 5, 10, 11];
754 assert_eq!(xs.iter().size_hint(), (5, Some(5)));
755 assert_eq!(xs.iter_mut().size_hint(), (5, Some(5)));
759 fn test_iter_as_slice() {
760 let xs = [1, 2, 5, 10, 11];
761 let mut iter = xs.iter();
762 assert_eq!(iter.as_slice(), &[1, 2, 5, 10, 11]);
764 assert_eq!(iter.as_slice(), &[2, 5, 10, 11]);
768 fn test_iter_as_ref() {
769 let xs = [1, 2, 5, 10, 11];
770 let mut iter = xs.iter();
771 assert_eq!(iter.as_ref(), &[1, 2, 5, 10, 11]);
773 assert_eq!(iter.as_ref(), &[2, 5, 10, 11]);
777 fn test_iter_clone() {
779 let mut it = xs.iter();
781 let mut jt = it.clone();
782 assert_eq!(it.next(), jt.next());
783 assert_eq!(it.next(), jt.next());
784 assert_eq!(it.next(), jt.next());
788 fn test_iter_is_empty() {
789 let xs = [1, 2, 5, 10, 11];
790 for i in 0..xs.len() {
791 for j in i..xs.len() {
792 assert_eq!(xs[i..j].iter().is_empty(), xs[i..j].is_empty());
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),
836 fn test_move_rev_iterator() {
837 let xs = vec![1, 2, 3, 4, 5];
838 assert_eq!(xs.into_iter().rev().fold(0, |a: usize, b: usize| 10 * a + b),
843 fn test_splitator() {
844 let xs = &[1, 2, 3, 4, 5];
846 let splits: &[&[_]] = &[&[1], &[3], &[5]];
847 assert_eq!(xs.split(|x| *x % 2 == 0).collect::<Vec<_>>(), splits);
848 let splits: &[&[_]] = &[&[], &[2, 3, 4, 5]];
849 assert_eq!(xs.split(|x| *x == 1).collect::<Vec<_>>(), splits);
850 let splits: &[&[_]] = &[&[1, 2, 3, 4], &[]];
851 assert_eq!(xs.split(|x| *x == 5).collect::<Vec<_>>(), splits);
852 let splits: &[&[_]] = &[&[1, 2, 3, 4, 5]];
853 assert_eq!(xs.split(|x| *x == 10).collect::<Vec<_>>(), splits);
854 let splits: &[&[_]] = &[&[], &[], &[], &[], &[], &[]];
855 assert_eq!(xs.split(|_| true).collect::<Vec<&[i32]>>(), splits);
857 let xs: &[i32] = &[];
858 let splits: &[&[i32]] = &[&[]];
859 assert_eq!(xs.split(|x| *x == 5).collect::<Vec<&[i32]>>(), splits);
863 fn test_splitnator() {
864 let xs = &[1, 2, 3, 4, 5];
866 let splits: &[&[_]] = &[&[1, 2, 3, 4, 5]];
867 assert_eq!(xs.splitn(1, |x| *x % 2 == 0).collect::<Vec<_>>(), splits);
868 let splits: &[&[_]] = &[&[1], &[3, 4, 5]];
869 assert_eq!(xs.splitn(2, |x| *x % 2 == 0).collect::<Vec<_>>(), splits);
870 let splits: &[&[_]] = &[&[], &[], &[], &[4, 5]];
871 assert_eq!(xs.splitn(4, |_| true).collect::<Vec<_>>(), splits);
873 let xs: &[i32] = &[];
874 let splits: &[&[i32]] = &[&[]];
875 assert_eq!(xs.splitn(2, |x| *x == 5).collect::<Vec<_>>(), splits);
879 fn test_splitnator_mut() {
880 let xs = &mut [1, 2, 3, 4, 5];
882 let splits: &[&mut [_]] = &[&mut [1, 2, 3, 4, 5]];
883 assert_eq!(xs.splitn_mut(1, |x| *x % 2 == 0).collect::<Vec<_>>(),
885 let splits: &[&mut [_]] = &[&mut [1], &mut [3, 4, 5]];
886 assert_eq!(xs.splitn_mut(2, |x| *x % 2 == 0).collect::<Vec<_>>(),
888 let splits: &[&mut [_]] = &[&mut [], &mut [], &mut [], &mut [4, 5]];
889 assert_eq!(xs.splitn_mut(4, |_| true).collect::<Vec<_>>(), splits);
891 let xs: &mut [i32] = &mut [];
892 let splits: &[&mut [i32]] = &[&mut []];
893 assert_eq!(xs.splitn_mut(2, |x| *x == 5).collect::<Vec<_>>(), splits);
897 fn test_rsplitator() {
898 let xs = &[1, 2, 3, 4, 5];
900 let splits: &[&[_]] = &[&[5], &[3], &[1]];
901 assert_eq!(xs.split(|x| *x % 2 == 0).rev().collect::<Vec<_>>(), splits);
902 let splits: &[&[_]] = &[&[2, 3, 4, 5], &[]];
903 assert_eq!(xs.split(|x| *x == 1).rev().collect::<Vec<_>>(), splits);
904 let splits: &[&[_]] = &[&[], &[1, 2, 3, 4]];
905 assert_eq!(xs.split(|x| *x == 5).rev().collect::<Vec<_>>(), splits);
906 let splits: &[&[_]] = &[&[1, 2, 3, 4, 5]];
907 assert_eq!(xs.split(|x| *x == 10).rev().collect::<Vec<_>>(), splits);
909 let xs: &[i32] = &[];
910 let splits: &[&[i32]] = &[&[]];
911 assert_eq!(xs.split(|x| *x == 5).rev().collect::<Vec<&[i32]>>(), splits);
915 fn test_rsplitnator() {
916 let xs = &[1, 2, 3, 4, 5];
918 let splits: &[&[_]] = &[&[1, 2, 3, 4, 5]];
919 assert_eq!(xs.rsplitn(1, |x| *x % 2 == 0).collect::<Vec<_>>(), splits);
920 let splits: &[&[_]] = &[&[5], &[1, 2, 3]];
921 assert_eq!(xs.rsplitn(2, |x| *x % 2 == 0).collect::<Vec<_>>(), splits);
922 let splits: &[&[_]] = &[&[], &[], &[], &[1, 2]];
923 assert_eq!(xs.rsplitn(4, |_| true).collect::<Vec<_>>(), splits);
925 let xs: &[i32] = &[];
926 let splits: &[&[i32]] = &[&[]];
927 assert_eq!(xs.rsplitn(2, |x| *x == 5).collect::<Vec<&[i32]>>(), splits);
928 assert!(xs.rsplitn(0, |x| *x % 2 == 0).next().is_none());
932 fn test_windowsator() {
933 let v = &[1, 2, 3, 4];
935 let wins: &[&[_]] = &[&[1, 2], &[2, 3], &[3, 4]];
936 assert_eq!(v.windows(2).collect::<Vec<_>>(), wins);
938 let wins: &[&[_]] = &[&[1, 2, 3], &[2, 3, 4]];
939 assert_eq!(v.windows(3).collect::<Vec<_>>(), wins);
940 assert!(v.windows(6).next().is_none());
942 let wins: &[&[_]] = &[&[3, 4], &[2, 3], &[1, 2]];
943 assert_eq!(v.windows(2).rev().collect::<Vec<&[_]>>(), wins);
948 fn test_windowsator_0() {
949 let v = &[1, 2, 3, 4];
950 let _it = v.windows(0);
954 fn test_chunksator() {
955 let v = &[1, 2, 3, 4, 5];
957 assert_eq!(v.chunks(2).len(), 3);
959 let chunks: &[&[_]] = &[&[1, 2], &[3, 4], &[5]];
960 assert_eq!(v.chunks(2).collect::<Vec<_>>(), chunks);
961 let chunks: &[&[_]] = &[&[1, 2, 3], &[4, 5]];
962 assert_eq!(v.chunks(3).collect::<Vec<_>>(), chunks);
963 let chunks: &[&[_]] = &[&[1, 2, 3, 4, 5]];
964 assert_eq!(v.chunks(6).collect::<Vec<_>>(), chunks);
966 let chunks: &[&[_]] = &[&[5], &[3, 4], &[1, 2]];
967 assert_eq!(v.chunks(2).rev().collect::<Vec<_>>(), chunks);
972 fn test_chunksator_0() {
973 let v = &[1, 2, 3, 4];
974 let _it = v.chunks(0);
978 fn test_exact_chunksator() {
979 let v = &[1, 2, 3, 4, 5];
981 assert_eq!(v.exact_chunks(2).len(), 2);
983 let chunks: &[&[_]] = &[&[1, 2], &[3, 4]];
984 assert_eq!(v.exact_chunks(2).collect::<Vec<_>>(), chunks);
985 let chunks: &[&[_]] = &[&[1, 2, 3]];
986 assert_eq!(v.exact_chunks(3).collect::<Vec<_>>(), chunks);
987 let chunks: &[&[_]] = &[];
988 assert_eq!(v.exact_chunks(6).collect::<Vec<_>>(), chunks);
990 let chunks: &[&[_]] = &[&[3, 4], &[1, 2]];
991 assert_eq!(v.exact_chunks(2).rev().collect::<Vec<_>>(), chunks);
996 fn test_exact_chunksator_0() {
997 let v = &[1, 2, 3, 4];
998 let _it = v.exact_chunks(0);
1002 fn test_reverse_part() {
1003 let mut values = [1, 2, 3, 4, 5];
1004 values[1..4].reverse();
1005 assert!(values == [1, 4, 3, 2, 5]);
1010 macro_rules! test_show_vec {
1011 ($x:expr, $x_str:expr) => ({
1012 let (x, x_str) = ($x, $x_str);
1013 assert_eq!(format!("{:?}", x), x_str);
1014 assert_eq!(format!("{:?}", x), x_str);
1017 let empty = Vec::<i32>::new();
1018 test_show_vec!(empty, "[]");
1019 test_show_vec!(vec![1], "[1]");
1020 test_show_vec!(vec![1, 2, 3], "[1, 2, 3]");
1021 test_show_vec!(vec![vec![], vec![1], vec![1, 1]], "[[], [1], [1, 1]]");
1023 let empty_mut: &mut [i32] = &mut [];
1024 test_show_vec!(empty_mut, "[]");
1026 test_show_vec!(v, "[1]");
1027 let v = &mut [1, 2, 3];
1028 test_show_vec!(v, "[1, 2, 3]");
1029 let v: &mut [&mut [_]] = &mut [&mut [], &mut [1], &mut [1, 1]];
1030 test_show_vec!(v, "[[], [1], [1, 1]]");
1034 fn test_vec_default() {
1037 let v: $ty = Default::default();
1038 assert!(v.is_empty());
1048 fn test_overflow_does_not_cause_segfault() {
1050 v.reserve_exact(!0);
1057 fn test_overflow_does_not_cause_segfault_managed() {
1058 let mut v = vec![Rc::new(1)];
1059 v.reserve_exact(!0);
1064 fn test_mut_split_at() {
1065 let mut values = [1, 2, 3, 4, 5];
1067 let (left, right) = values.split_at_mut(2);
1069 let left: &[_] = left;
1070 assert!(left[..left.len()] == [1, 2]);
1077 let right: &[_] = right;
1078 assert!(right[..right.len()] == [3, 4, 5]);
1085 assert!(values == [2, 3, 5, 6, 7]);
1088 #[derive(Clone, PartialEq)]
1092 fn test_iter_zero_sized() {
1093 let mut v = vec![Foo, Foo, Foo];
1094 assert_eq!(v.len(), 3);
1119 assert_eq!(cnt, 11);
1121 let xs: [Foo; 3] = [Foo, Foo, Foo];
1131 fn test_shrink_to_fit() {
1132 let mut xs = vec![0, 1, 2, 3];
1136 assert_eq!(xs.capacity(), 128);
1138 assert_eq!(xs.capacity(), 100);
1139 assert_eq!(xs, (0..100).collect::<Vec<_>>());
1143 fn test_starts_with() {
1144 assert!(b"foobar".starts_with(b"foo"));
1145 assert!(!b"foobar".starts_with(b"oob"));
1146 assert!(!b"foobar".starts_with(b"bar"));
1147 assert!(!b"foo".starts_with(b"foobar"));
1148 assert!(!b"bar".starts_with(b"foobar"));
1149 assert!(b"foobar".starts_with(b"foobar"));
1150 let empty: &[u8] = &[];
1151 assert!(empty.starts_with(empty));
1152 assert!(!empty.starts_with(b"foo"));
1153 assert!(b"foobar".starts_with(empty));
1157 fn test_ends_with() {
1158 assert!(b"foobar".ends_with(b"bar"));
1159 assert!(!b"foobar".ends_with(b"oba"));
1160 assert!(!b"foobar".ends_with(b"foo"));
1161 assert!(!b"foo".ends_with(b"foobar"));
1162 assert!(!b"bar".ends_with(b"foobar"));
1163 assert!(b"foobar".ends_with(b"foobar"));
1164 let empty: &[u8] = &[];
1165 assert!(empty.ends_with(empty));
1166 assert!(!empty.ends_with(b"foo"));
1167 assert!(b"foobar".ends_with(empty));
1171 fn test_mut_splitator() {
1172 let mut xs = [0, 1, 0, 2, 3, 0, 0, 4, 5, 0];
1173 assert_eq!(xs.split_mut(|x| *x == 0).count(), 6);
1174 for slice in xs.split_mut(|x| *x == 0) {
1177 assert!(xs == [0, 1, 0, 3, 2, 0, 0, 5, 4, 0]);
1179 let mut xs = [0, 1, 0, 2, 3, 0, 0, 4, 5, 0, 6, 7];
1180 for slice in xs.split_mut(|x| *x == 0).take(5) {
1183 assert!(xs == [0, 1, 0, 3, 2, 0, 0, 5, 4, 0, 6, 7]);
1187 fn test_mut_splitator_rev() {
1188 let mut xs = [1, 2, 0, 3, 4, 0, 0, 5, 6, 0];
1189 for slice in xs.split_mut(|x| *x == 0).rev().take(4) {
1192 assert!(xs == [1, 2, 0, 4, 3, 0, 0, 6, 5, 0]);
1197 let mut v = [0, 1, 2];
1198 assert_eq!(v.get_mut(3), None);
1199 v.get_mut(1).map(|e| *e = 7);
1200 assert_eq!(v[1], 7);
1202 assert_eq!(v.get_mut(2), Some(&mut x));
1206 fn test_mut_chunks() {
1207 let mut v = [0, 1, 2, 3, 4, 5, 6];
1208 assert_eq!(v.chunks_mut(2).len(), 4);
1209 for (i, chunk) in v.chunks_mut(3).enumerate() {
1214 let result = [0, 0, 0, 1, 1, 1, 2];
1215 assert_eq!(v, result);
1219 fn test_mut_chunks_rev() {
1220 let mut v = [0, 1, 2, 3, 4, 5, 6];
1221 for (i, chunk) in v.chunks_mut(3).rev().enumerate() {
1226 let result = [2, 2, 2, 1, 1, 1, 0];
1227 assert_eq!(v, result);
1232 fn test_mut_chunks_0() {
1233 let mut v = [1, 2, 3, 4];
1234 let _it = v.chunks_mut(0);
1238 fn test_mut_exact_chunks() {
1239 let mut v = [0, 1, 2, 3, 4, 5, 6];
1240 assert_eq!(v.exact_chunks_mut(2).len(), 3);
1241 for (i, chunk) in v.exact_chunks_mut(3).enumerate() {
1246 let result = [0, 0, 0, 1, 1, 1, 6];
1247 assert_eq!(v, result);
1251 fn test_mut_exact_chunks_rev() {
1252 let mut v = [0, 1, 2, 3, 4, 5, 6];
1253 for (i, chunk) in v.exact_chunks_mut(3).rev().enumerate() {
1258 let result = [1, 1, 1, 0, 0, 0, 6];
1259 assert_eq!(v, result);
1264 fn test_mut_exact_chunks_0() {
1265 let mut v = [1, 2, 3, 4];
1266 let _it = v.exact_chunks_mut(0);
1270 fn test_mut_last() {
1271 let mut x = [1, 2, 3, 4, 5];
1272 let h = x.last_mut();
1273 assert_eq!(*h.unwrap(), 5);
1275 let y: &mut [i32] = &mut [];
1276 assert!(y.last_mut().is_none());
1281 let xs: Box<_> = box [1, 2, 3];
1282 let ys = xs.to_vec();
1283 assert_eq!(ys, [1, 2, 3]);
1287 fn test_box_slice_clone() {
1288 let data = vec![vec![0, 1], vec![0], vec![1]];
1289 let data2 = data.clone().into_boxed_slice().clone().to_vec();
1291 assert_eq!(data, data2);
1295 #[allow(unused_must_use)] // here, we care about the side effects of `.clone()`
1296 #[cfg_attr(target_os = "emscripten", ignore)]
1297 fn test_box_slice_clone_panics() {
1299 use std::sync::atomic::{AtomicUsize, Ordering};
1300 use std::thread::spawn;
1303 count: Arc<AtomicUsize>,
1307 impl Drop for Canary {
1308 fn drop(&mut self) {
1309 self.count.fetch_add(1, Ordering::SeqCst);
1313 impl Clone for Canary {
1314 fn clone(&self) -> Self {
1320 count: self.count.clone(),
1321 panics: self.panics,
1326 let drop_count = Arc::new(AtomicUsize::new(0));
1327 let canary = Canary {
1328 count: drop_count.clone(),
1331 let panic = Canary {
1332 count: drop_count.clone(),
1337 // When xs is dropped, +5.
1338 let xs = vec![canary.clone(), canary.clone(), canary.clone(), panic, canary]
1339 .into_boxed_slice();
1341 // When panic is cloned, +3.
1348 assert_eq!(drop_count.load(Ordering::SeqCst), 8);
1352 fn test_copy_from_slice() {
1353 let src = [0, 1, 2, 3, 4, 5];
1354 let mut dst = [0; 6];
1355 dst.copy_from_slice(&src);
1356 assert_eq!(src, dst)
1360 #[should_panic(expected = "destination and source slices have different lengths")]
1361 fn test_copy_from_slice_dst_longer() {
1362 let src = [0, 1, 2, 3];
1363 let mut dst = [0; 5];
1364 dst.copy_from_slice(&src);
1368 #[should_panic(expected = "destination and source slices have different lengths")]
1369 fn test_copy_from_slice_dst_shorter() {
1370 let src = [0, 1, 2, 3];
1371 let mut dst = [0; 3];
1372 dst.copy_from_slice(&src);
1375 const MAX_LEN: usize = 80;
1377 static DROP_COUNTS: [AtomicUsize; MAX_LEN] = [
1378 // FIXME(RFC 1109): AtomicUsize is not Copy.
1379 AtomicUsize::new(0), AtomicUsize::new(0), AtomicUsize::new(0), AtomicUsize::new(0),
1380 AtomicUsize::new(0), AtomicUsize::new(0), AtomicUsize::new(0), AtomicUsize::new(0),
1381 AtomicUsize::new(0), AtomicUsize::new(0), AtomicUsize::new(0), AtomicUsize::new(0),
1382 AtomicUsize::new(0), AtomicUsize::new(0), AtomicUsize::new(0), AtomicUsize::new(0),
1383 AtomicUsize::new(0), AtomicUsize::new(0), AtomicUsize::new(0), AtomicUsize::new(0),
1384 AtomicUsize::new(0), AtomicUsize::new(0), AtomicUsize::new(0), AtomicUsize::new(0),
1385 AtomicUsize::new(0), AtomicUsize::new(0), AtomicUsize::new(0), AtomicUsize::new(0),
1386 AtomicUsize::new(0), AtomicUsize::new(0), AtomicUsize::new(0), AtomicUsize::new(0),
1387 AtomicUsize::new(0), AtomicUsize::new(0), AtomicUsize::new(0), AtomicUsize::new(0),
1388 AtomicUsize::new(0), AtomicUsize::new(0), AtomicUsize::new(0), AtomicUsize::new(0),
1389 AtomicUsize::new(0), AtomicUsize::new(0), AtomicUsize::new(0), AtomicUsize::new(0),
1390 AtomicUsize::new(0), AtomicUsize::new(0), AtomicUsize::new(0), AtomicUsize::new(0),
1391 AtomicUsize::new(0), AtomicUsize::new(0), AtomicUsize::new(0), AtomicUsize::new(0),
1392 AtomicUsize::new(0), AtomicUsize::new(0), AtomicUsize::new(0), AtomicUsize::new(0),
1393 AtomicUsize::new(0), AtomicUsize::new(0), AtomicUsize::new(0), AtomicUsize::new(0),
1394 AtomicUsize::new(0), AtomicUsize::new(0), AtomicUsize::new(0), AtomicUsize::new(0),
1395 AtomicUsize::new(0), AtomicUsize::new(0), AtomicUsize::new(0), AtomicUsize::new(0),
1396 AtomicUsize::new(0), AtomicUsize::new(0), AtomicUsize::new(0), AtomicUsize::new(0),
1397 AtomicUsize::new(0), AtomicUsize::new(0), AtomicUsize::new(0), AtomicUsize::new(0),
1398 AtomicUsize::new(0), AtomicUsize::new(0), AtomicUsize::new(0), AtomicUsize::new(0),
1401 static VERSIONS: AtomicUsize = ATOMIC_USIZE_INIT;
1403 #[derive(Clone, Eq)]
1404 struct DropCounter {
1407 version: Cell<usize>,
1410 impl PartialEq for DropCounter {
1411 fn eq(&self, other: &Self) -> bool {
1412 self.partial_cmp(other) == Some(Ordering::Equal)
1416 impl PartialOrd for DropCounter {
1417 fn partial_cmp(&self, other: &Self) -> Option<Ordering> {
1418 self.version.set(self.version.get() + 1);
1419 other.version.set(other.version.get() + 1);
1420 VERSIONS.fetch_add(2, Relaxed);
1421 self.x.partial_cmp(&other.x)
1425 impl Ord for DropCounter {
1426 fn cmp(&self, other: &Self) -> Ordering {
1427 self.partial_cmp(other).unwrap()
1431 impl Drop for DropCounter {
1432 fn drop(&mut self) {
1433 DROP_COUNTS[self.id].fetch_add(1, Relaxed);
1434 VERSIONS.fetch_sub(self.version.get(), Relaxed);
1439 ($input:ident, $func:ident) => {
1440 let len = $input.len();
1442 // Work out the total number of comparisons required to sort
1444 let mut count = 0usize;
1445 $input.to_owned().$func(|a, b| { count += 1; a.cmp(b) });
1447 // ... and then panic on each and every single one.
1448 for panic_countdown in 0..count {
1449 // Refresh the counters.
1450 VERSIONS.store(0, Relaxed);
1452 DROP_COUNTS[i].store(0, Relaxed);
1455 let v = $input.to_owned();
1456 let _ = thread::spawn(move || {
1458 let mut panic_countdown = panic_countdown;
1460 if panic_countdown == 0 {
1461 SILENCE_PANIC.with(|s| s.set(true));
1464 panic_countdown -= 1;
1469 // Check that the number of things dropped is exactly
1470 // what we expect (i.e. the contents of `v`).
1471 for (i, c) in DROP_COUNTS.iter().enumerate().take(len) {
1472 let count = c.load(Relaxed);
1474 "found drop count == {} for i == {}, len == {}",
1478 // Check that the most recent versions of values were dropped.
1479 assert_eq!(VERSIONS.load(Relaxed), 0);
1484 thread_local!(static SILENCE_PANIC: Cell<bool> = Cell::new(false));
1487 #[cfg_attr(target_os = "emscripten", ignore)] // no threads
1489 let prev = panic::take_hook();
1490 panic::set_hook(Box::new(move |info| {
1491 if !SILENCE_PANIC.with(|s| s.get()) {
1496 let mut rng = thread_rng();
1498 for len in (1..20).chain(70..MAX_LEN) {
1499 for &modulus in &[5, 20, 50] {
1500 for &has_runs in &[false, true] {
1501 let mut input = (0..len)
1504 x: rng.next_u32() % modulus,
1506 version: Cell::new(0),
1509 .collect::<Vec<_>>();
1512 for c in &mut input {
1517 let a = rng.gen::<usize>() % len;
1518 let b = rng.gen::<usize>() % len;
1520 input[a..b].reverse();
1527 test!(input, sort_by);
1528 test!(input, sort_unstable_by);
1535 fn repeat_generic_slice() {
1536 assert_eq!([1, 2].repeat(2), vec![1, 2, 1, 2]);
1537 assert_eq!([1, 2, 3, 4].repeat(0), vec![]);
1538 assert_eq!([1, 2, 3, 4].repeat(1), vec![1, 2, 3, 4]);
1540 [1, 2, 3, 4].repeat(3),
1541 vec![1, 2, 3, 4, 1, 2, 3, 4, 1, 2, 3, 4]