2 use std::cmp::Ordering::{self, Equal, Greater, Less};
6 use std::sync::atomic::{Ordering::Relaxed, AtomicUsize};
9 use rand::{Rng, RngCore, thread_rng};
10 use rand::seq::SliceRandom;
11 use rand::distributions::Standard;
13 fn square(n: usize) -> usize {
17 fn is_odd(n: &usize) -> bool {
23 // Test on-stack from_fn.
24 let mut v: Vec<_> = (0..3).map(square).collect();
27 assert_eq!(v.len(), 3);
33 // Test on-heap from_fn.
34 v = (0..5).map(square).collect();
37 assert_eq!(v.len(), 5);
48 // Test on-stack from_elem.
49 let mut v = vec![10, 10];
52 assert_eq!(v.len(), 2);
57 // Test on-heap from_elem.
72 let xs: [i32; 0] = [];
73 assert!(xs.is_empty());
74 assert!(![0].is_empty());
78 fn test_len_divzero() {
82 let v2: &[Z] = &[[], []];
83 assert_eq!(mem::size_of::<Z>(), 0);
84 assert_eq!(v0.len(), 0);
85 assert_eq!(v1.len(), 1);
86 assert_eq!(v2.len(), 2);
92 assert_eq!(a.get(1), None);
94 assert_eq!(a.get(1).unwrap(), &12);
96 assert_eq!(a.get(1).unwrap(), &12);
102 assert_eq!(a.first(), None);
104 assert_eq!(a.first().unwrap(), &11);
106 assert_eq!(a.first().unwrap(), &11);
110 fn test_first_mut() {
112 assert_eq!(a.first_mut(), None);
114 assert_eq!(*a.first_mut().unwrap(), 11);
116 assert_eq!(*a.first_mut().unwrap(), 11);
120 fn test_split_first() {
121 let mut a = vec![11];
123 assert!(b.split_first().is_none());
124 assert_eq!(a.split_first(), Some((&11, b)));
126 let b: &[i32] = &[12];
127 assert_eq!(a.split_first(), Some((&11, b)));
131 fn test_split_first_mut() {
132 let mut a = vec![11];
133 let b: &mut [i32] = &mut [];
134 assert!(b.split_first_mut().is_none());
135 assert!(a.split_first_mut() == Some((&mut 11, b)));
137 let b: &mut [_] = &mut [12];
138 assert!(a.split_first_mut() == Some((&mut 11, b)));
142 fn test_split_last() {
143 let mut a = vec![11];
145 assert!(b.split_last().is_none());
146 assert_eq!(a.split_last(), Some((&11, b)));
149 assert_eq!(a.split_last(), Some((&12, b)));
153 fn test_split_last_mut() {
154 let mut a = vec![11];
155 let b: &mut [i32] = &mut [];
156 assert!(b.split_last_mut().is_none());
157 assert!(a.split_last_mut() == Some((&mut 11, b)));
160 let b: &mut [_] = &mut [11];
161 assert!(a.split_last_mut() == Some((&mut 12, b)));
167 assert_eq!(a.last(), None);
169 assert_eq!(a.last().unwrap(), &11);
171 assert_eq!(a.last().unwrap(), &12);
177 assert_eq!(a.last_mut(), None);
179 assert_eq!(*a.last_mut().unwrap(), 11);
181 assert_eq!(*a.last_mut().unwrap(), 12);
186 // Test fixed length vector.
187 let vec_fixed = [1, 2, 3, 4];
188 let v_a = vec_fixed[1..vec_fixed.len()].to_vec();
189 assert_eq!(v_a.len(), 3);
191 assert_eq!(v_a[0], 2);
192 assert_eq!(v_a[1], 3);
193 assert_eq!(v_a[2], 4);
196 let vec_stack: &[_] = &[1, 2, 3];
197 let v_b = vec_stack[1..3].to_vec();
198 assert_eq!(v_b.len(), 2);
200 assert_eq!(v_b[0], 2);
201 assert_eq!(v_b[1], 3);
204 let vec_unique = vec![1, 2, 3, 4, 5, 6];
205 let v_d = vec_unique[1..6].to_vec();
206 assert_eq!(v_d.len(), 5);
208 assert_eq!(v_d[0], 2);
209 assert_eq!(v_d[1], 3);
210 assert_eq!(v_d[2], 4);
211 assert_eq!(v_d[3], 5);
212 assert_eq!(v_d[4], 6);
216 fn test_slice_from() {
217 let vec: &[_] = &[1, 2, 3, 4];
218 assert_eq!(&vec[..], vec);
219 let b: &[_] = &[3, 4];
220 assert_eq!(&vec[2..], b);
222 assert_eq!(&vec[4..], b);
227 let vec: &[_] = &[1, 2, 3, 4];
228 assert_eq!(&vec[..4], vec);
229 let b: &[_] = &[1, 2];
230 assert_eq!(&vec[..2], b);
232 assert_eq!(&vec[..0], b);
240 assert_eq!(v.len(), 0);
241 assert_eq!(e, Some(5));
249 fn test_swap_remove() {
250 let mut v = vec![1, 2, 3, 4, 5];
251 let mut e = v.swap_remove(0);
253 assert_eq!(v, [5, 2, 3, 4]);
254 e = v.swap_remove(3);
256 assert_eq!(v, [5, 2, 3]);
261 fn test_swap_remove_fail() {
263 let _ = v.swap_remove(0);
264 let _ = v.swap_remove(0);
268 fn test_swap_remove_noncopyable() {
269 // Tests that we don't accidentally run destructors twice.
270 let mut v: Vec<Box<_>> = Vec::new();
274 let mut _e = v.swap_remove(0);
275 assert_eq!(v.len(), 2);
276 _e = v.swap_remove(1);
277 assert_eq!(v.len(), 1);
278 _e = v.swap_remove(0);
279 assert_eq!(v.len(), 0);
284 // Test on-stack push().
287 assert_eq!(v.len(), 1);
290 // Test on-heap push().
292 assert_eq!(v.len(), 2);
299 let mut v: Vec<Box<_>> = vec![box 6, box 5, box 4];
302 assert_eq!(v.len(), 1);
303 assert_eq!(*(v[0]), 6);
304 // If the unsafe block didn't drop things properly, we blow up here.
309 let mut v: Vec<Box<_>> = vec![box 6, box 5, box 4];
311 assert_eq!(v.len(), 0);
312 // If the unsafe block didn't drop things properly, we blow up here.
317 let mut v = vec![1, 2, 3, 4, 5];
319 assert_eq!(v, [1, 3, 5]);
323 fn test_binary_search() {
324 assert_eq!([1, 2, 3, 4, 5].binary_search(&5).ok(), Some(4));
325 assert_eq!([1, 2, 3, 4, 5].binary_search(&4).ok(), Some(3));
326 assert_eq!([1, 2, 3, 4, 5].binary_search(&3).ok(), Some(2));
327 assert_eq!([1, 2, 3, 4, 5].binary_search(&2).ok(), Some(1));
328 assert_eq!([1, 2, 3, 4, 5].binary_search(&1).ok(), Some(0));
330 assert_eq!([2, 4, 6, 8, 10].binary_search(&1).ok(), None);
331 assert_eq!([2, 4, 6, 8, 10].binary_search(&5).ok(), None);
332 assert_eq!([2, 4, 6, 8, 10].binary_search(&4).ok(), Some(1));
333 assert_eq!([2, 4, 6, 8, 10].binary_search(&10).ok(), Some(4));
335 assert_eq!([2, 4, 6, 8].binary_search(&1).ok(), None);
336 assert_eq!([2, 4, 6, 8].binary_search(&5).ok(), None);
337 assert_eq!([2, 4, 6, 8].binary_search(&4).ok(), Some(1));
338 assert_eq!([2, 4, 6, 8].binary_search(&8).ok(), Some(3));
340 assert_eq!([2, 4, 6].binary_search(&1).ok(), None);
341 assert_eq!([2, 4, 6].binary_search(&5).ok(), None);
342 assert_eq!([2, 4, 6].binary_search(&4).ok(), Some(1));
343 assert_eq!([2, 4, 6].binary_search(&6).ok(), Some(2));
345 assert_eq!([2, 4].binary_search(&1).ok(), None);
346 assert_eq!([2, 4].binary_search(&5).ok(), None);
347 assert_eq!([2, 4].binary_search(&2).ok(), Some(0));
348 assert_eq!([2, 4].binary_search(&4).ok(), Some(1));
350 assert_eq!([2].binary_search(&1).ok(), None);
351 assert_eq!([2].binary_search(&5).ok(), None);
352 assert_eq!([2].binary_search(&2).ok(), Some(0));
354 assert_eq!([].binary_search(&1).ok(), None);
355 assert_eq!([].binary_search(&5).ok(), None);
357 assert!([1, 1, 1, 1, 1].binary_search(&1).ok() != None);
358 assert!([1, 1, 1, 1, 2].binary_search(&1).ok() != None);
359 assert!([1, 1, 1, 2, 2].binary_search(&1).ok() != None);
360 assert!([1, 1, 2, 2, 2].binary_search(&1).ok() != None);
361 assert_eq!([1, 2, 2, 2, 2].binary_search(&1).ok(), Some(0));
363 assert_eq!([1, 2, 3, 4, 5].binary_search(&6).ok(), None);
364 assert_eq!([1, 2, 3, 4, 5].binary_search(&0).ok(), None);
369 let mut v = vec![10, 20];
370 assert_eq!(v[0], 10);
371 assert_eq!(v[1], 20);
373 assert_eq!(v[0], 20);
374 assert_eq!(v[1], 10);
376 let mut v3 = Vec::<i32>::new();
378 assert!(v3.is_empty());
380 // check the 1-byte-types path
381 let mut v = (-50..51i8).collect::<Vec<_>>();
383 assert_eq!(v, (-50..51i8).rev().collect::<Vec<_>>());
385 // check the 2-byte-types path
386 let mut v = (-50..51i16).collect::<Vec<_>>();
388 assert_eq!(v, (-50..51i16).rev().collect::<Vec<_>>());
393 let mut rng = thread_rng();
395 for len in (2..25).chain(500..510) {
396 for &modulus in &[5, 10, 100, 1000] {
398 let orig: Vec<_> = rng.sample_iter::<i32, _>(&Standard)
399 .map(|x| x % modulus)
403 // Sort in default order.
404 let mut v = orig.clone();
406 assert!(v.windows(2).all(|w| w[0] <= w[1]));
408 // Sort in ascending order.
409 let mut v = orig.clone();
410 v.sort_by(|a, b| a.cmp(b));
411 assert!(v.windows(2).all(|w| w[0] <= w[1]));
413 // Sort in descending order.
414 let mut v = orig.clone();
415 v.sort_by(|a, b| b.cmp(a));
416 assert!(v.windows(2).all(|w| w[0] >= w[1]));
418 // Sort in lexicographic order.
419 let mut v1 = orig.clone();
420 let mut v2 = orig.clone();
421 v1.sort_by_key(|x| x.to_string());
422 v2.sort_by_cached_key(|x| x.to_string());
423 assert!(v1.windows(2).all(|w| w[0].to_string() <= w[1].to_string()));
426 // Sort with many pre-sorted runs.
427 let mut v = orig.clone();
431 let a = rng.gen::<usize>() % len;
432 let b = rng.gen::<usize>() % len;
440 assert!(v.windows(2).all(|w| w[0] <= w[1]));
445 // Sort using a completely random comparison function.
446 // This will reorder the elements *somehow*, but won't panic.
447 let mut v = [0; 500];
448 for i in 0..v.len() {
451 v.sort_by(|_, _| *[Less, Equal, Greater].choose(&mut rng).unwrap());
453 for i in 0..v.len() {
454 assert_eq!(v[i], i as i32);
462 let mut v = [0xDEADBEEFu64];
464 assert!(v == [0xDEADBEEF]);
468 fn test_sort_stability() {
469 for len in (2..25).chain(500..510) {
471 let mut counts = [0; 10];
473 // create a vector like [(6, 1), (5, 1), (6, 2), ...],
474 // where the first item of each tuple is random, but
475 // the second item represents which occurrence of that
476 // number this element is, i.e., the second elements
477 // will occur in sorted order.
478 let orig: Vec<_> = (0..len)
480 let n = thread_rng().gen::<usize>() % 10;
486 let mut v = orig.clone();
487 // Only sort on the first element, so an unstable sort
488 // may mix up the counts.
489 v.sort_by(|&(a, _), &(b, _)| a.cmp(&b));
491 // This comparison includes the count (the second item
492 // of the tuple), so elements with equal first items
493 // will need to be ordered with increasing
494 // counts... i.e., exactly asserting that this sort is
496 assert!(v.windows(2).all(|w| w[0] <= w[1]));
498 let mut v = orig.clone();
499 v.sort_by_cached_key(|&(x, _)| x);
500 assert!(v.windows(2).all(|w| w[0] <= w[1]));
506 fn test_rotate_left() {
507 let expected: Vec<_> = (0..13).collect();
508 let mut v = Vec::new();
511 v.clone_from(&expected);
513 assert_eq!(v, expected);
514 v.rotate_left(expected.len());
515 assert_eq!(v, expected);
516 let mut zst_array = [(), (), ()];
517 zst_array.rotate_left(2);
520 v = (5..13).chain(0..5).collect();
522 assert_eq!(v, expected);
524 let expected: Vec<_> = (0..1000).collect();
526 // small rotations in large slice, uses ptr::copy
527 v = (2..1000).chain(0..2).collect();
529 assert_eq!(v, expected);
530 v = (998..1000).chain(0..998).collect();
532 assert_eq!(v, expected);
534 // non-small prime rotation, has a few rounds of swapping
535 v = (389..1000).chain(0..389).collect();
536 v.rotate_left(1000-389);
537 assert_eq!(v, expected);
541 fn test_rotate_right() {
542 let expected: Vec<_> = (0..13).collect();
543 let mut v = Vec::new();
546 v.clone_from(&expected);
548 assert_eq!(v, expected);
549 v.rotate_right(expected.len());
550 assert_eq!(v, expected);
551 let mut zst_array = [(), (), ()];
552 zst_array.rotate_right(2);
555 v = (5..13).chain(0..5).collect();
557 assert_eq!(v, expected);
559 let expected: Vec<_> = (0..1000).collect();
561 // small rotations in large slice, uses ptr::copy
562 v = (2..1000).chain(0..2).collect();
564 assert_eq!(v, expected);
565 v = (998..1000).chain(0..998).collect();
567 assert_eq!(v, expected);
569 // non-small prime rotation, has a few rounds of swapping
570 v = (389..1000).chain(0..389).collect();
572 assert_eq!(v, expected);
577 let v: [Vec<i32>; 0] = [];
580 let d = [vec![1], vec![2, 3]].concat();
581 assert_eq!(d, [1, 2, 3]);
583 let v: &[&[_]] = &[&[1], &[2, 3]];
584 assert_eq!(v.join(&0), [1, 0, 2, 3]);
585 let v: &[&[_]] = &[&[1], &[2], &[3]];
586 assert_eq!(v.join(&0), [1, 0, 2, 0, 3]);
591 let v: [Vec<i32>; 0] = [];
592 assert_eq!(v.join(&0), []);
593 assert_eq!([vec![1], vec![2, 3]].join(&0), [1, 0, 2, 3]);
594 assert_eq!([vec![1], vec![2], vec![3]].join(&0), [1, 0, 2, 0, 3]);
596 let v: [&[_]; 2] = [&[1], &[2, 3]];
597 assert_eq!(v.join(&0), [1, 0, 2, 3]);
598 let v: [&[_]; 3] = [&[1], &[2], &[3]];
599 assert_eq!(v.join(&0), [1, 0, 2, 0, 3]);
603 fn test_join_nocopy() {
604 let v: [String; 0] = [];
605 assert_eq!(v.join(","), "");
606 assert_eq!(["a".to_string(), "ab".into()].join(","), "a,ab");
607 assert_eq!(["a".to_string(), "ab".into(), "abc".into()].join(","), "a,ab,abc");
608 assert_eq!(["a".to_string(), "ab".into(), "".into()].join(","), "a,ab,");
613 let mut a = vec![1, 2, 4];
615 assert_eq!(a, [1, 2, 3, 4]);
617 let mut a = vec![1, 2, 3];
619 assert_eq!(a, [0, 1, 2, 3]);
621 let mut a = vec![1, 2, 3];
623 assert_eq!(a, [1, 2, 3, 4]);
632 fn test_insert_oob() {
633 let mut a = vec![1, 2, 3];
639 let mut a = vec![1, 2, 3, 4];
641 assert_eq!(a.remove(2), 3);
642 assert_eq!(a, [1, 2, 4]);
644 assert_eq!(a.remove(2), 4);
645 assert_eq!(a, [1, 2]);
647 assert_eq!(a.remove(0), 1);
650 assert_eq!(a.remove(0), 2);
656 fn test_remove_fail() {
666 assert!(v.capacity() >= 11);
671 let v = vec![1, 2, 3, 4, 5];
673 assert_eq!(v.len(), 2);
678 macro_rules! assert_order {
679 (Greater, $a:expr, $b:expr) => {
680 assert_eq!($a.cmp($b), Greater);
683 (Less, $a:expr, $b:expr) => {
684 assert_eq!($a.cmp($b), Less);
687 (Equal, $a:expr, $b:expr) => {
688 assert_eq!($a.cmp($b), Equal);
694 fn test_total_ord_u8() {
695 let c = &[1u8, 2, 3];
696 assert_order!(Greater, &[1u8, 2, 3, 4][..], &c[..]);
697 let c = &[1u8, 2, 3, 4];
698 assert_order!(Less, &[1u8, 2, 3][..], &c[..]);
699 let c = &[1u8, 2, 3, 6];
700 assert_order!(Equal, &[1u8, 2, 3, 6][..], &c[..]);
701 let c = &[1u8, 2, 3, 4, 5, 6];
702 assert_order!(Less, &[1u8, 2, 3, 4, 5, 5, 5, 5][..], &c[..]);
703 let c = &[1u8, 2, 3, 4];
704 assert_order!(Greater, &[2u8, 2][..], &c[..]);
709 fn test_total_ord_i32() {
711 assert_order!(Greater, &[1, 2, 3, 4][..], &c[..]);
712 let c = &[1, 2, 3, 4];
713 assert_order!(Less, &[1, 2, 3][..], &c[..]);
714 let c = &[1, 2, 3, 6];
715 assert_order!(Equal, &[1, 2, 3, 6][..], &c[..]);
716 let c = &[1, 2, 3, 4, 5, 6];
717 assert_order!(Less, &[1, 2, 3, 4, 5, 5, 5, 5][..], &c[..]);
718 let c = &[1, 2, 3, 4];
719 assert_order!(Greater, &[2, 2][..], &c[..]);
724 let xs = [1, 2, 5, 10, 11];
725 let mut it = xs.iter();
726 assert_eq!(it.size_hint(), (5, Some(5)));
727 assert_eq!(it.next().unwrap(), &1);
728 assert_eq!(it.size_hint(), (4, Some(4)));
729 assert_eq!(it.next().unwrap(), &2);
730 assert_eq!(it.size_hint(), (3, Some(3)));
731 assert_eq!(it.next().unwrap(), &5);
732 assert_eq!(it.size_hint(), (2, Some(2)));
733 assert_eq!(it.next().unwrap(), &10);
734 assert_eq!(it.size_hint(), (1, Some(1)));
735 assert_eq!(it.next().unwrap(), &11);
736 assert_eq!(it.size_hint(), (0, Some(0)));
737 assert!(it.next().is_none());
741 fn test_iter_size_hints() {
742 let mut xs = [1, 2, 5, 10, 11];
743 assert_eq!(xs.iter().size_hint(), (5, Some(5)));
744 assert_eq!(xs.iter_mut().size_hint(), (5, Some(5)));
748 fn test_iter_as_slice() {
749 let xs = [1, 2, 5, 10, 11];
750 let mut iter = xs.iter();
751 assert_eq!(iter.as_slice(), &[1, 2, 5, 10, 11]);
753 assert_eq!(iter.as_slice(), &[2, 5, 10, 11]);
757 fn test_iter_as_ref() {
758 let xs = [1, 2, 5, 10, 11];
759 let mut iter = xs.iter();
760 assert_eq!(iter.as_ref(), &[1, 2, 5, 10, 11]);
762 assert_eq!(iter.as_ref(), &[2, 5, 10, 11]);
766 fn test_iter_clone() {
768 let mut it = xs.iter();
770 let mut jt = it.clone();
771 assert_eq!(it.next(), jt.next());
772 assert_eq!(it.next(), jt.next());
773 assert_eq!(it.next(), jt.next());
777 fn test_iter_is_empty() {
778 let xs = [1, 2, 5, 10, 11];
779 for i in 0..xs.len() {
780 for j in i..xs.len() {
781 assert_eq!(xs[i..j].iter().is_empty(), xs[i..j].is_empty());
787 fn test_mut_iterator() {
788 let mut xs = [1, 2, 3, 4, 5];
792 assert!(xs == [2, 3, 4, 5, 6])
796 fn test_rev_iterator() {
798 let xs = [1, 2, 5, 10, 11];
799 let ys = [11, 10, 5, 2, 1];
801 for &x in xs.iter().rev() {
802 assert_eq!(x, ys[i]);
809 fn test_mut_rev_iterator() {
810 let mut xs = [1, 2, 3, 4, 5];
811 for (i, x) in xs.iter_mut().rev().enumerate() {
814 assert!(xs == [5, 5, 5, 5, 5])
818 fn test_move_iterator() {
819 let xs = vec![1, 2, 3, 4, 5];
820 assert_eq!(xs.into_iter().fold(0, |a: usize, b: usize| 10 * a + b),
825 fn test_move_rev_iterator() {
826 let xs = vec![1, 2, 3, 4, 5];
827 assert_eq!(xs.into_iter().rev().fold(0, |a: usize, b: usize| 10 * a + b),
832 fn test_splitator() {
833 let xs = &[1, 2, 3, 4, 5];
835 let splits: &[&[_]] = &[&[1], &[3], &[5]];
836 assert_eq!(xs.split(|x| *x % 2 == 0).collect::<Vec<_>>(), splits);
837 let splits: &[&[_]] = &[&[], &[2, 3, 4, 5]];
838 assert_eq!(xs.split(|x| *x == 1).collect::<Vec<_>>(), splits);
839 let splits: &[&[_]] = &[&[1, 2, 3, 4], &[]];
840 assert_eq!(xs.split(|x| *x == 5).collect::<Vec<_>>(), splits);
841 let splits: &[&[_]] = &[&[1, 2, 3, 4, 5]];
842 assert_eq!(xs.split(|x| *x == 10).collect::<Vec<_>>(), splits);
843 let splits: &[&[_]] = &[&[], &[], &[], &[], &[], &[]];
844 assert_eq!(xs.split(|_| true).collect::<Vec<&[i32]>>(), splits);
846 let xs: &[i32] = &[];
847 let splits: &[&[i32]] = &[&[]];
848 assert_eq!(xs.split(|x| *x == 5).collect::<Vec<&[i32]>>(), splits);
852 fn test_splitnator() {
853 let xs = &[1, 2, 3, 4, 5];
855 let splits: &[&[_]] = &[&[1, 2, 3, 4, 5]];
856 assert_eq!(xs.splitn(1, |x| *x % 2 == 0).collect::<Vec<_>>(), splits);
857 let splits: &[&[_]] = &[&[1], &[3, 4, 5]];
858 assert_eq!(xs.splitn(2, |x| *x % 2 == 0).collect::<Vec<_>>(), splits);
859 let splits: &[&[_]] = &[&[], &[], &[], &[4, 5]];
860 assert_eq!(xs.splitn(4, |_| true).collect::<Vec<_>>(), splits);
862 let xs: &[i32] = &[];
863 let splits: &[&[i32]] = &[&[]];
864 assert_eq!(xs.splitn(2, |x| *x == 5).collect::<Vec<_>>(), splits);
868 fn test_splitnator_mut() {
869 let xs = &mut [1, 2, 3, 4, 5];
871 let splits: &[&mut [_]] = &[&mut [1, 2, 3, 4, 5]];
872 assert_eq!(xs.splitn_mut(1, |x| *x % 2 == 0).collect::<Vec<_>>(),
874 let splits: &[&mut [_]] = &[&mut [1], &mut [3, 4, 5]];
875 assert_eq!(xs.splitn_mut(2, |x| *x % 2 == 0).collect::<Vec<_>>(),
877 let splits: &[&mut [_]] = &[&mut [], &mut [], &mut [], &mut [4, 5]];
878 assert_eq!(xs.splitn_mut(4, |_| true).collect::<Vec<_>>(), splits);
880 let xs: &mut [i32] = &mut [];
881 let splits: &[&mut [i32]] = &[&mut []];
882 assert_eq!(xs.splitn_mut(2, |x| *x == 5).collect::<Vec<_>>(), splits);
886 fn test_rsplitator() {
887 let xs = &[1, 2, 3, 4, 5];
889 let splits: &[&[_]] = &[&[5], &[3], &[1]];
890 assert_eq!(xs.split(|x| *x % 2 == 0).rev().collect::<Vec<_>>(), splits);
891 let splits: &[&[_]] = &[&[2, 3, 4, 5], &[]];
892 assert_eq!(xs.split(|x| *x == 1).rev().collect::<Vec<_>>(), splits);
893 let splits: &[&[_]] = &[&[], &[1, 2, 3, 4]];
894 assert_eq!(xs.split(|x| *x == 5).rev().collect::<Vec<_>>(), splits);
895 let splits: &[&[_]] = &[&[1, 2, 3, 4, 5]];
896 assert_eq!(xs.split(|x| *x == 10).rev().collect::<Vec<_>>(), splits);
898 let xs: &[i32] = &[];
899 let splits: &[&[i32]] = &[&[]];
900 assert_eq!(xs.split(|x| *x == 5).rev().collect::<Vec<&[i32]>>(), splits);
904 fn test_rsplitnator() {
905 let xs = &[1, 2, 3, 4, 5];
907 let splits: &[&[_]] = &[&[1, 2, 3, 4, 5]];
908 assert_eq!(xs.rsplitn(1, |x| *x % 2 == 0).collect::<Vec<_>>(), splits);
909 let splits: &[&[_]] = &[&[5], &[1, 2, 3]];
910 assert_eq!(xs.rsplitn(2, |x| *x % 2 == 0).collect::<Vec<_>>(), splits);
911 let splits: &[&[_]] = &[&[], &[], &[], &[1, 2]];
912 assert_eq!(xs.rsplitn(4, |_| true).collect::<Vec<_>>(), splits);
914 let xs: &[i32] = &[];
915 let splits: &[&[i32]] = &[&[]];
916 assert_eq!(xs.rsplitn(2, |x| *x == 5).collect::<Vec<&[i32]>>(), splits);
917 assert!(xs.rsplitn(0, |x| *x % 2 == 0).next().is_none());
921 fn test_windowsator() {
922 let v = &[1, 2, 3, 4];
924 let wins: &[&[_]] = &[&[1, 2], &[2, 3], &[3, 4]];
925 assert_eq!(v.windows(2).collect::<Vec<_>>(), wins);
927 let wins: &[&[_]] = &[&[1, 2, 3], &[2, 3, 4]];
928 assert_eq!(v.windows(3).collect::<Vec<_>>(), wins);
929 assert!(v.windows(6).next().is_none());
931 let wins: &[&[_]] = &[&[3, 4], &[2, 3], &[1, 2]];
932 assert_eq!(v.windows(2).rev().collect::<Vec<&[_]>>(), wins);
937 fn test_windowsator_0() {
938 let v = &[1, 2, 3, 4];
939 let _it = v.windows(0);
943 fn test_chunksator() {
944 let v = &[1, 2, 3, 4, 5];
946 assert_eq!(v.chunks(2).len(), 3);
948 let chunks: &[&[_]] = &[&[1, 2], &[3, 4], &[5]];
949 assert_eq!(v.chunks(2).collect::<Vec<_>>(), chunks);
950 let chunks: &[&[_]] = &[&[1, 2, 3], &[4, 5]];
951 assert_eq!(v.chunks(3).collect::<Vec<_>>(), chunks);
952 let chunks: &[&[_]] = &[&[1, 2, 3, 4, 5]];
953 assert_eq!(v.chunks(6).collect::<Vec<_>>(), chunks);
955 let chunks: &[&[_]] = &[&[5], &[3, 4], &[1, 2]];
956 assert_eq!(v.chunks(2).rev().collect::<Vec<_>>(), chunks);
961 fn test_chunksator_0() {
962 let v = &[1, 2, 3, 4];
963 let _it = v.chunks(0);
967 fn test_chunks_exactator() {
968 let v = &[1, 2, 3, 4, 5];
970 assert_eq!(v.chunks_exact(2).len(), 2);
972 let chunks: &[&[_]] = &[&[1, 2], &[3, 4]];
973 assert_eq!(v.chunks_exact(2).collect::<Vec<_>>(), chunks);
974 let chunks: &[&[_]] = &[&[1, 2, 3]];
975 assert_eq!(v.chunks_exact(3).collect::<Vec<_>>(), chunks);
976 let chunks: &[&[_]] = &[];
977 assert_eq!(v.chunks_exact(6).collect::<Vec<_>>(), chunks);
979 let chunks: &[&[_]] = &[&[3, 4], &[1, 2]];
980 assert_eq!(v.chunks_exact(2).rev().collect::<Vec<_>>(), chunks);
985 fn test_chunks_exactator_0() {
986 let v = &[1, 2, 3, 4];
987 let _it = v.chunks_exact(0);
991 fn test_rchunksator() {
992 let v = &[1, 2, 3, 4, 5];
994 assert_eq!(v.rchunks(2).len(), 3);
996 let chunks: &[&[_]] = &[&[4, 5], &[2, 3], &[1]];
997 assert_eq!(v.rchunks(2).collect::<Vec<_>>(), chunks);
998 let chunks: &[&[_]] = &[&[3, 4, 5], &[1, 2]];
999 assert_eq!(v.rchunks(3).collect::<Vec<_>>(), chunks);
1000 let chunks: &[&[_]] = &[&[1, 2, 3, 4, 5]];
1001 assert_eq!(v.rchunks(6).collect::<Vec<_>>(), chunks);
1003 let chunks: &[&[_]] = &[&[1], &[2, 3], &[4, 5]];
1004 assert_eq!(v.rchunks(2).rev().collect::<Vec<_>>(), chunks);
1009 fn test_rchunksator_0() {
1010 let v = &[1, 2, 3, 4];
1011 let _it = v.rchunks(0);
1015 fn test_rchunks_exactator() {
1016 let v = &[1, 2, 3, 4, 5];
1018 assert_eq!(v.rchunks_exact(2).len(), 2);
1020 let chunks: &[&[_]] = &[&[4, 5], &[2, 3]];
1021 assert_eq!(v.rchunks_exact(2).collect::<Vec<_>>(), chunks);
1022 let chunks: &[&[_]] = &[&[3, 4, 5]];
1023 assert_eq!(v.rchunks_exact(3).collect::<Vec<_>>(), chunks);
1024 let chunks: &[&[_]] = &[];
1025 assert_eq!(v.rchunks_exact(6).collect::<Vec<_>>(), chunks);
1027 let chunks: &[&[_]] = &[&[2, 3], &[4, 5]];
1028 assert_eq!(v.rchunks_exact(2).rev().collect::<Vec<_>>(), chunks);
1033 fn test_rchunks_exactator_0() {
1034 let v = &[1, 2, 3, 4];
1035 let _it = v.rchunks_exact(0);
1039 fn test_reverse_part() {
1040 let mut values = [1, 2, 3, 4, 5];
1041 values[1..4].reverse();
1042 assert!(values == [1, 4, 3, 2, 5]);
1047 macro_rules! test_show_vec {
1048 ($x:expr, $x_str:expr) => ({
1049 let (x, x_str) = ($x, $x_str);
1050 assert_eq!(format!("{:?}", x), x_str);
1051 assert_eq!(format!("{:?}", x), x_str);
1054 let empty = Vec::<i32>::new();
1055 test_show_vec!(empty, "[]");
1056 test_show_vec!(vec![1], "[1]");
1057 test_show_vec!(vec![1, 2, 3], "[1, 2, 3]");
1058 test_show_vec!(vec![vec![], vec![1], vec![1, 1]], "[[], [1], [1, 1]]");
1060 let empty_mut: &mut [i32] = &mut [];
1061 test_show_vec!(empty_mut, "[]");
1063 test_show_vec!(v, "[1]");
1064 let v = &mut [1, 2, 3];
1065 test_show_vec!(v, "[1, 2, 3]");
1066 let v: &mut [&mut [_]] = &mut [&mut [], &mut [1], &mut [1, 1]];
1067 test_show_vec!(v, "[[], [1], [1, 1]]");
1071 fn test_vec_default() {
1074 let v: $ty = Default::default();
1075 assert!(v.is_empty());
1085 fn test_overflow_does_not_cause_segfault() {
1087 v.reserve_exact(!0);
1094 fn test_overflow_does_not_cause_segfault_managed() {
1095 let mut v = vec![Rc::new(1)];
1096 v.reserve_exact(!0);
1101 fn test_mut_split_at() {
1102 let mut values = [1, 2, 3, 4, 5];
1104 let (left, right) = values.split_at_mut(2);
1106 let left: &[_] = left;
1107 assert!(left[..left.len()] == [1, 2]);
1114 let right: &[_] = right;
1115 assert!(right[..right.len()] == [3, 4, 5]);
1122 assert!(values == [2, 3, 5, 6, 7]);
1125 #[derive(Clone, PartialEq)]
1129 fn test_iter_zero_sized() {
1130 let mut v = vec![Foo, Foo, Foo];
1131 assert_eq!(v.len(), 3);
1156 assert_eq!(cnt, 11);
1158 let xs: [Foo; 3] = [Foo, Foo, Foo];
1168 fn test_shrink_to_fit() {
1169 let mut xs = vec![0, 1, 2, 3];
1173 assert_eq!(xs.capacity(), 128);
1175 assert_eq!(xs.capacity(), 100);
1176 assert_eq!(xs, (0..100).collect::<Vec<_>>());
1180 fn test_starts_with() {
1181 assert!(b"foobar".starts_with(b"foo"));
1182 assert!(!b"foobar".starts_with(b"oob"));
1183 assert!(!b"foobar".starts_with(b"bar"));
1184 assert!(!b"foo".starts_with(b"foobar"));
1185 assert!(!b"bar".starts_with(b"foobar"));
1186 assert!(b"foobar".starts_with(b"foobar"));
1187 let empty: &[u8] = &[];
1188 assert!(empty.starts_with(empty));
1189 assert!(!empty.starts_with(b"foo"));
1190 assert!(b"foobar".starts_with(empty));
1194 fn test_ends_with() {
1195 assert!(b"foobar".ends_with(b"bar"));
1196 assert!(!b"foobar".ends_with(b"oba"));
1197 assert!(!b"foobar".ends_with(b"foo"));
1198 assert!(!b"foo".ends_with(b"foobar"));
1199 assert!(!b"bar".ends_with(b"foobar"));
1200 assert!(b"foobar".ends_with(b"foobar"));
1201 let empty: &[u8] = &[];
1202 assert!(empty.ends_with(empty));
1203 assert!(!empty.ends_with(b"foo"));
1204 assert!(b"foobar".ends_with(empty));
1208 fn test_mut_splitator() {
1209 let mut xs = [0, 1, 0, 2, 3, 0, 0, 4, 5, 0];
1210 assert_eq!(xs.split_mut(|x| *x == 0).count(), 6);
1211 for slice in xs.split_mut(|x| *x == 0) {
1214 assert!(xs == [0, 1, 0, 3, 2, 0, 0, 5, 4, 0]);
1216 let mut xs = [0, 1, 0, 2, 3, 0, 0, 4, 5, 0, 6, 7];
1217 for slice in xs.split_mut(|x| *x == 0).take(5) {
1220 assert!(xs == [0, 1, 0, 3, 2, 0, 0, 5, 4, 0, 6, 7]);
1224 fn test_mut_splitator_rev() {
1225 let mut xs = [1, 2, 0, 3, 4, 0, 0, 5, 6, 0];
1226 for slice in xs.split_mut(|x| *x == 0).rev().take(4) {
1229 assert!(xs == [1, 2, 0, 4, 3, 0, 0, 6, 5, 0]);
1234 let mut v = [0, 1, 2];
1235 assert_eq!(v.get_mut(3), None);
1236 v.get_mut(1).map(|e| *e = 7);
1237 assert_eq!(v[1], 7);
1239 assert_eq!(v.get_mut(2), Some(&mut x));
1243 fn test_mut_chunks() {
1244 let mut v = [0, 1, 2, 3, 4, 5, 6];
1245 assert_eq!(v.chunks_mut(3).len(), 3);
1246 for (i, chunk) in v.chunks_mut(3).enumerate() {
1251 let result = [0, 0, 0, 1, 1, 1, 2];
1252 assert_eq!(v, result);
1256 fn test_mut_chunks_rev() {
1257 let mut v = [0, 1, 2, 3, 4, 5, 6];
1258 for (i, chunk) in v.chunks_mut(3).rev().enumerate() {
1263 let result = [2, 2, 2, 1, 1, 1, 0];
1264 assert_eq!(v, result);
1269 fn test_mut_chunks_0() {
1270 let mut v = [1, 2, 3, 4];
1271 let _it = v.chunks_mut(0);
1275 fn test_mut_chunks_exact() {
1276 let mut v = [0, 1, 2, 3, 4, 5, 6];
1277 assert_eq!(v.chunks_exact_mut(3).len(), 2);
1278 for (i, chunk) in v.chunks_exact_mut(3).enumerate() {
1283 let result = [0, 0, 0, 1, 1, 1, 6];
1284 assert_eq!(v, result);
1288 fn test_mut_chunks_exact_rev() {
1289 let mut v = [0, 1, 2, 3, 4, 5, 6];
1290 for (i, chunk) in v.chunks_exact_mut(3).rev().enumerate() {
1295 let result = [1, 1, 1, 0, 0, 0, 6];
1296 assert_eq!(v, result);
1301 fn test_mut_chunks_exact_0() {
1302 let mut v = [1, 2, 3, 4];
1303 let _it = v.chunks_exact_mut(0);
1307 fn test_mut_rchunks() {
1308 let mut v = [0, 1, 2, 3, 4, 5, 6];
1309 assert_eq!(v.rchunks_mut(3).len(), 3);
1310 for (i, chunk) in v.rchunks_mut(3).enumerate() {
1315 let result = [2, 1, 1, 1, 0, 0, 0];
1316 assert_eq!(v, result);
1320 fn test_mut_rchunks_rev() {
1321 let mut v = [0, 1, 2, 3, 4, 5, 6];
1322 for (i, chunk) in v.rchunks_mut(3).rev().enumerate() {
1327 let result = [0, 1, 1, 1, 2, 2, 2];
1328 assert_eq!(v, result);
1333 fn test_mut_rchunks_0() {
1334 let mut v = [1, 2, 3, 4];
1335 let _it = v.rchunks_mut(0);
1339 fn test_mut_rchunks_exact() {
1340 let mut v = [0, 1, 2, 3, 4, 5, 6];
1341 assert_eq!(v.rchunks_exact_mut(3).len(), 2);
1342 for (i, chunk) in v.rchunks_exact_mut(3).enumerate() {
1347 let result = [0, 1, 1, 1, 0, 0, 0];
1348 assert_eq!(v, result);
1352 fn test_mut_rchunks_exact_rev() {
1353 let mut v = [0, 1, 2, 3, 4, 5, 6];
1354 for (i, chunk) in v.rchunks_exact_mut(3).rev().enumerate() {
1359 let result = [0, 0, 0, 0, 1, 1, 1];
1360 assert_eq!(v, result);
1365 fn test_mut_rchunks_exact_0() {
1366 let mut v = [1, 2, 3, 4];
1367 let _it = v.rchunks_exact_mut(0);
1371 fn test_mut_last() {
1372 let mut x = [1, 2, 3, 4, 5];
1373 let h = x.last_mut();
1374 assert_eq!(*h.unwrap(), 5);
1376 let y: &mut [i32] = &mut [];
1377 assert!(y.last_mut().is_none());
1382 let xs: Box<_> = box [1, 2, 3];
1383 let ys = xs.to_vec();
1384 assert_eq!(ys, [1, 2, 3]);
1388 fn test_box_slice_clone() {
1389 let data = vec![vec![0, 1], vec![0], vec![1]];
1390 let data2 = data.clone().into_boxed_slice().clone().to_vec();
1392 assert_eq!(data, data2);
1396 #[allow(unused_must_use)] // here, we care about the side effects of `.clone()`
1397 #[cfg_attr(target_os = "emscripten", ignore)]
1398 fn test_box_slice_clone_panics() {
1400 use std::sync::atomic::{AtomicUsize, Ordering};
1401 use std::thread::spawn;
1404 count: Arc<AtomicUsize>,
1408 impl Drop for Canary {
1409 fn drop(&mut self) {
1410 self.count.fetch_add(1, Ordering::SeqCst);
1414 impl Clone for Canary {
1415 fn clone(&self) -> Self {
1421 count: self.count.clone(),
1422 panics: self.panics,
1427 let drop_count = Arc::new(AtomicUsize::new(0));
1428 let canary = Canary {
1429 count: drop_count.clone(),
1432 let panic = Canary {
1433 count: drop_count.clone(),
1438 // When xs is dropped, +5.
1439 let xs = vec![canary.clone(), canary.clone(), canary.clone(), panic, canary]
1440 .into_boxed_slice();
1442 // When panic is cloned, +3.
1449 assert_eq!(drop_count.load(Ordering::SeqCst), 8);
1453 fn test_copy_from_slice() {
1454 let src = [0, 1, 2, 3, 4, 5];
1455 let mut dst = [0; 6];
1456 dst.copy_from_slice(&src);
1457 assert_eq!(src, dst)
1461 #[should_panic(expected = "destination and source slices have different lengths")]
1462 fn test_copy_from_slice_dst_longer() {
1463 let src = [0, 1, 2, 3];
1464 let mut dst = [0; 5];
1465 dst.copy_from_slice(&src);
1469 #[should_panic(expected = "destination and source slices have different lengths")]
1470 fn test_copy_from_slice_dst_shorter() {
1471 let src = [0, 1, 2, 3];
1472 let mut dst = [0; 3];
1473 dst.copy_from_slice(&src);
1476 const MAX_LEN: usize = 80;
1478 static DROP_COUNTS: [AtomicUsize; MAX_LEN] = [
1479 // FIXME(RFC 1109): AtomicUsize is not Copy.
1480 AtomicUsize::new(0), AtomicUsize::new(0), AtomicUsize::new(0), AtomicUsize::new(0),
1481 AtomicUsize::new(0), AtomicUsize::new(0), AtomicUsize::new(0), AtomicUsize::new(0),
1482 AtomicUsize::new(0), AtomicUsize::new(0), AtomicUsize::new(0), AtomicUsize::new(0),
1483 AtomicUsize::new(0), AtomicUsize::new(0), AtomicUsize::new(0), AtomicUsize::new(0),
1484 AtomicUsize::new(0), AtomicUsize::new(0), AtomicUsize::new(0), AtomicUsize::new(0),
1485 AtomicUsize::new(0), AtomicUsize::new(0), AtomicUsize::new(0), AtomicUsize::new(0),
1486 AtomicUsize::new(0), AtomicUsize::new(0), AtomicUsize::new(0), AtomicUsize::new(0),
1487 AtomicUsize::new(0), AtomicUsize::new(0), AtomicUsize::new(0), AtomicUsize::new(0),
1488 AtomicUsize::new(0), AtomicUsize::new(0), AtomicUsize::new(0), AtomicUsize::new(0),
1489 AtomicUsize::new(0), AtomicUsize::new(0), AtomicUsize::new(0), AtomicUsize::new(0),
1490 AtomicUsize::new(0), AtomicUsize::new(0), AtomicUsize::new(0), AtomicUsize::new(0),
1491 AtomicUsize::new(0), AtomicUsize::new(0), AtomicUsize::new(0), AtomicUsize::new(0),
1492 AtomicUsize::new(0), AtomicUsize::new(0), AtomicUsize::new(0), AtomicUsize::new(0),
1493 AtomicUsize::new(0), AtomicUsize::new(0), AtomicUsize::new(0), AtomicUsize::new(0),
1494 AtomicUsize::new(0), AtomicUsize::new(0), AtomicUsize::new(0), AtomicUsize::new(0),
1495 AtomicUsize::new(0), AtomicUsize::new(0), AtomicUsize::new(0), AtomicUsize::new(0),
1496 AtomicUsize::new(0), AtomicUsize::new(0), AtomicUsize::new(0), AtomicUsize::new(0),
1497 AtomicUsize::new(0), AtomicUsize::new(0), AtomicUsize::new(0), AtomicUsize::new(0),
1498 AtomicUsize::new(0), AtomicUsize::new(0), AtomicUsize::new(0), AtomicUsize::new(0),
1499 AtomicUsize::new(0), AtomicUsize::new(0), AtomicUsize::new(0), AtomicUsize::new(0),
1502 static VERSIONS: AtomicUsize = AtomicUsize::new(0);
1504 #[derive(Clone, Eq)]
1505 struct DropCounter {
1508 version: Cell<usize>,
1511 impl PartialEq for DropCounter {
1512 fn eq(&self, other: &Self) -> bool {
1513 self.partial_cmp(other) == Some(Ordering::Equal)
1517 impl PartialOrd for DropCounter {
1518 fn partial_cmp(&self, other: &Self) -> Option<Ordering> {
1519 self.version.set(self.version.get() + 1);
1520 other.version.set(other.version.get() + 1);
1521 VERSIONS.fetch_add(2, Relaxed);
1522 self.x.partial_cmp(&other.x)
1526 impl Ord for DropCounter {
1527 fn cmp(&self, other: &Self) -> Ordering {
1528 self.partial_cmp(other).unwrap()
1532 impl Drop for DropCounter {
1533 fn drop(&mut self) {
1534 DROP_COUNTS[self.id].fetch_add(1, Relaxed);
1535 VERSIONS.fetch_sub(self.version.get(), Relaxed);
1540 ($input:ident, $func:ident) => {
1541 let len = $input.len();
1543 // Work out the total number of comparisons required to sort
1545 let mut count = 0usize;
1546 $input.to_owned().$func(|a, b| { count += 1; a.cmp(b) });
1548 // ... and then panic on each and every single one.
1549 for panic_countdown in 0..count {
1550 // Refresh the counters.
1551 VERSIONS.store(0, Relaxed);
1553 DROP_COUNTS[i].store(0, Relaxed);
1556 let v = $input.to_owned();
1557 let _ = thread::spawn(move || {
1559 let mut panic_countdown = panic_countdown;
1561 if panic_countdown == 0 {
1562 SILENCE_PANIC.with(|s| s.set(true));
1565 panic_countdown -= 1;
1570 // Check that the number of things dropped is exactly
1571 // what we expect (i.e., the contents of `v`).
1572 for (i, c) in DROP_COUNTS.iter().enumerate().take(len) {
1573 let count = c.load(Relaxed);
1575 "found drop count == {} for i == {}, len == {}",
1579 // Check that the most recent versions of values were dropped.
1580 assert_eq!(VERSIONS.load(Relaxed), 0);
1585 thread_local!(static SILENCE_PANIC: Cell<bool> = Cell::new(false));
1588 #[cfg_attr(target_os = "emscripten", ignore)] // no threads
1590 let prev = panic::take_hook();
1591 panic::set_hook(Box::new(move |info| {
1592 if !SILENCE_PANIC.with(|s| s.get()) {
1597 let mut rng = thread_rng();
1599 for len in (1..20).chain(70..MAX_LEN) {
1600 for &modulus in &[5, 20, 50] {
1601 for &has_runs in &[false, true] {
1602 let mut input = (0..len)
1605 x: rng.next_u32() % modulus,
1607 version: Cell::new(0),
1610 .collect::<Vec<_>>();
1613 for c in &mut input {
1618 let a = rng.gen::<usize>() % len;
1619 let b = rng.gen::<usize>() % len;
1621 input[a..b].reverse();
1628 test!(input, sort_by);
1629 test!(input, sort_unstable_by);
1636 fn repeat_generic_slice() {
1637 assert_eq!([1, 2].repeat(2), vec![1, 2, 1, 2]);
1638 assert_eq!([1, 2, 3, 4].repeat(0), vec![]);
1639 assert_eq!([1, 2, 3, 4].repeat(1), vec![1, 2, 3, 4]);
1641 [1, 2, 3, 4].repeat(3),
1642 vec![1, 2, 3, 4, 1, 2, 3, 4, 1, 2, 3, 4]