2 use std::cmp::Ordering::{self, Equal, Greater, Less};
6 use std::sync::atomic::{AtomicUsize, Ordering::Relaxed};
8 use rand::distributions::Standard;
9 use rand::seq::SliceRandom;
10 use rand::{thread_rng, Rng, RngCore};
12 fn square(n: usize) -> usize {
16 fn is_odd(n: &usize) -> bool {
22 // Test on-stack from_fn.
23 let mut v: Vec<_> = (0..3).map(square).collect();
26 assert_eq!(v.len(), 3);
32 // Test on-heap from_fn.
33 v = (0..5).map(square).collect();
36 assert_eq!(v.len(), 5);
47 // Test on-stack from_elem.
48 let mut v = vec![10, 10];
51 assert_eq!(v.len(), 2);
56 // Test on-heap from_elem.
71 let xs: [i32; 0] = [];
72 assert!(xs.is_empty());
73 assert!(![0].is_empty());
77 fn test_len_divzero() {
81 let v2: &[Z] = &[[], []];
82 assert_eq!(mem::size_of::<Z>(), 0);
83 assert_eq!(v0.len(), 0);
84 assert_eq!(v1.len(), 1);
85 assert_eq!(v2.len(), 2);
91 assert_eq!(a.get(1), None);
93 assert_eq!(a.get(1).unwrap(), &12);
95 assert_eq!(a.get(1).unwrap(), &12);
101 assert_eq!(a.first(), None);
103 assert_eq!(a.first().unwrap(), &11);
105 assert_eq!(a.first().unwrap(), &11);
109 fn test_first_mut() {
111 assert_eq!(a.first_mut(), None);
113 assert_eq!(*a.first_mut().unwrap(), 11);
115 assert_eq!(*a.first_mut().unwrap(), 11);
119 fn test_split_first() {
120 let mut a = vec![11];
122 assert!(b.split_first().is_none());
123 assert_eq!(a.split_first(), Some((&11, b)));
125 let b: &[i32] = &[12];
126 assert_eq!(a.split_first(), Some((&11, b)));
130 fn test_split_first_mut() {
131 let mut a = vec![11];
132 let b: &mut [i32] = &mut [];
133 assert!(b.split_first_mut().is_none());
134 assert!(a.split_first_mut() == Some((&mut 11, b)));
136 let b: &mut [_] = &mut [12];
137 assert!(a.split_first_mut() == Some((&mut 11, b)));
141 fn test_split_last() {
142 let mut a = vec![11];
144 assert!(b.split_last().is_none());
145 assert_eq!(a.split_last(), Some((&11, b)));
148 assert_eq!(a.split_last(), Some((&12, b)));
152 fn test_split_last_mut() {
153 let mut a = vec![11];
154 let b: &mut [i32] = &mut [];
155 assert!(b.split_last_mut().is_none());
156 assert!(a.split_last_mut() == Some((&mut 11, b)));
159 let b: &mut [_] = &mut [11];
160 assert!(a.split_last_mut() == Some((&mut 12, b)));
166 assert_eq!(a.last(), None);
168 assert_eq!(a.last().unwrap(), &11);
170 assert_eq!(a.last().unwrap(), &12);
176 assert_eq!(a.last_mut(), None);
178 assert_eq!(*a.last_mut().unwrap(), 11);
180 assert_eq!(*a.last_mut().unwrap(), 12);
185 // Test fixed length vector.
186 let vec_fixed = [1, 2, 3, 4];
187 let v_a = vec_fixed[1..vec_fixed.len()].to_vec();
188 assert_eq!(v_a.len(), 3);
190 assert_eq!(v_a[0], 2);
191 assert_eq!(v_a[1], 3);
192 assert_eq!(v_a[2], 4);
195 let vec_stack: &[_] = &[1, 2, 3];
196 let v_b = vec_stack[1..3].to_vec();
197 assert_eq!(v_b.len(), 2);
199 assert_eq!(v_b[0], 2);
200 assert_eq!(v_b[1], 3);
203 let vec_unique = vec![1, 2, 3, 4, 5, 6];
204 let v_d = vec_unique[1..6].to_vec();
205 assert_eq!(v_d.len(), 5);
207 assert_eq!(v_d[0], 2);
208 assert_eq!(v_d[1], 3);
209 assert_eq!(v_d[2], 4);
210 assert_eq!(v_d[3], 5);
211 assert_eq!(v_d[4], 6);
215 fn test_slice_from() {
216 let vec: &[_] = &[1, 2, 3, 4];
217 assert_eq!(&vec[..], vec);
218 let b: &[_] = &[3, 4];
219 assert_eq!(&vec[2..], b);
221 assert_eq!(&vec[4..], b);
226 let vec: &[_] = &[1, 2, 3, 4];
227 assert_eq!(&vec[..4], vec);
228 let b: &[_] = &[1, 2];
229 assert_eq!(&vec[..2], b);
231 assert_eq!(&vec[..0], b);
238 assert_eq!(v.len(), 0);
239 assert_eq!(e, Some(5));
247 fn test_swap_remove() {
248 let mut v = vec![1, 2, 3, 4, 5];
249 let mut e = v.swap_remove(0);
251 assert_eq!(v, [5, 2, 3, 4]);
252 e = v.swap_remove(3);
254 assert_eq!(v, [5, 2, 3]);
259 fn test_swap_remove_fail() {
261 let _ = v.swap_remove(0);
262 let _ = v.swap_remove(0);
266 fn test_swap_remove_noncopyable() {
267 // Tests that we don't accidentally run destructors twice.
268 let mut v: Vec<Box<_>> = Vec::new();
272 let mut _e = v.swap_remove(0);
273 assert_eq!(v.len(), 2);
274 _e = v.swap_remove(1);
275 assert_eq!(v.len(), 1);
276 _e = v.swap_remove(0);
277 assert_eq!(v.len(), 0);
282 // Test on-stack push().
285 assert_eq!(v.len(), 1);
288 // Test on-heap push().
290 assert_eq!(v.len(), 2);
297 let mut v: Vec<Box<_>> = vec![box 6, box 5, box 4];
300 assert_eq!(v.len(), 1);
301 assert_eq!(*(v[0]), 6);
302 // If the unsafe block didn't drop things properly, we blow up here.
307 let mut v: Vec<Box<_>> = vec![box 6, box 5, box 4];
309 assert_eq!(v.len(), 0);
310 // If the unsafe block didn't drop things properly, we blow up here.
315 let mut v = vec![1, 2, 3, 4, 5];
317 assert_eq!(v, [1, 3, 5]);
321 fn test_binary_search() {
322 assert_eq!([1, 2, 3, 4, 5].binary_search(&5).ok(), Some(4));
323 assert_eq!([1, 2, 3, 4, 5].binary_search(&4).ok(), Some(3));
324 assert_eq!([1, 2, 3, 4, 5].binary_search(&3).ok(), Some(2));
325 assert_eq!([1, 2, 3, 4, 5].binary_search(&2).ok(), Some(1));
326 assert_eq!([1, 2, 3, 4, 5].binary_search(&1).ok(), Some(0));
328 assert_eq!([2, 4, 6, 8, 10].binary_search(&1).ok(), None);
329 assert_eq!([2, 4, 6, 8, 10].binary_search(&5).ok(), None);
330 assert_eq!([2, 4, 6, 8, 10].binary_search(&4).ok(), Some(1));
331 assert_eq!([2, 4, 6, 8, 10].binary_search(&10).ok(), Some(4));
333 assert_eq!([2, 4, 6, 8].binary_search(&1).ok(), None);
334 assert_eq!([2, 4, 6, 8].binary_search(&5).ok(), None);
335 assert_eq!([2, 4, 6, 8].binary_search(&4).ok(), Some(1));
336 assert_eq!([2, 4, 6, 8].binary_search(&8).ok(), Some(3));
338 assert_eq!([2, 4, 6].binary_search(&1).ok(), None);
339 assert_eq!([2, 4, 6].binary_search(&5).ok(), None);
340 assert_eq!([2, 4, 6].binary_search(&4).ok(), Some(1));
341 assert_eq!([2, 4, 6].binary_search(&6).ok(), Some(2));
343 assert_eq!([2, 4].binary_search(&1).ok(), None);
344 assert_eq!([2, 4].binary_search(&5).ok(), None);
345 assert_eq!([2, 4].binary_search(&2).ok(), Some(0));
346 assert_eq!([2, 4].binary_search(&4).ok(), Some(1));
348 assert_eq!([2].binary_search(&1).ok(), None);
349 assert_eq!([2].binary_search(&5).ok(), None);
350 assert_eq!([2].binary_search(&2).ok(), Some(0));
352 assert_eq!([].binary_search(&1).ok(), None);
353 assert_eq!([].binary_search(&5).ok(), None);
355 assert!([1, 1, 1, 1, 1].binary_search(&1).ok() != None);
356 assert!([1, 1, 1, 1, 2].binary_search(&1).ok() != None);
357 assert!([1, 1, 1, 2, 2].binary_search(&1).ok() != None);
358 assert!([1, 1, 2, 2, 2].binary_search(&1).ok() != None);
359 assert_eq!([1, 2, 2, 2, 2].binary_search(&1).ok(), Some(0));
361 assert_eq!([1, 2, 3, 4, 5].binary_search(&6).ok(), None);
362 assert_eq!([1, 2, 3, 4, 5].binary_search(&0).ok(), None);
367 let mut v = vec![10, 20];
368 assert_eq!(v[0], 10);
369 assert_eq!(v[1], 20);
371 assert_eq!(v[0], 20);
372 assert_eq!(v[1], 10);
374 let mut v3 = Vec::<i32>::new();
376 assert!(v3.is_empty());
378 // check the 1-byte-types path
379 let mut v = (-50..51i8).collect::<Vec<_>>();
381 assert_eq!(v, (-50..51i8).rev().collect::<Vec<_>>());
383 // check the 2-byte-types path
384 let mut v = (-50..51i16).collect::<Vec<_>>();
386 assert_eq!(v, (-50..51i16).rev().collect::<Vec<_>>());
390 #[cfg_attr(miri, ignore)] // Miri is too slow
392 let mut rng = thread_rng();
394 for len in (2..25).chain(500..510) {
395 for &modulus in &[5, 10, 100, 1000] {
398 rng.sample_iter::<i32, _>(&Standard).map(|x| x % modulus).take(len).collect();
400 // Sort in default order.
401 let mut v = orig.clone();
403 assert!(v.windows(2).all(|w| w[0] <= w[1]));
405 // Sort in ascending order.
406 let mut v = orig.clone();
407 v.sort_by(|a, b| a.cmp(b));
408 assert!(v.windows(2).all(|w| w[0] <= w[1]));
410 // Sort in descending order.
411 let mut v = orig.clone();
412 v.sort_by(|a, b| b.cmp(a));
413 assert!(v.windows(2).all(|w| w[0] >= w[1]));
415 // Sort in lexicographic order.
416 let mut v1 = orig.clone();
417 let mut v2 = orig.clone();
418 v1.sort_by_key(|x| x.to_string());
419 v2.sort_by_cached_key(|x| x.to_string());
420 assert!(v1.windows(2).all(|w| w[0].to_string() <= w[1].to_string()));
423 // Sort with many pre-sorted runs.
424 let mut v = orig.clone();
428 let a = rng.gen::<usize>() % len;
429 let b = rng.gen::<usize>() % len;
437 assert!(v.windows(2).all(|w| w[0] <= w[1]));
442 // Sort using a completely random comparison function.
443 // This will reorder the elements *somehow*, but won't panic.
444 let mut v = [0; 500];
445 for i in 0..v.len() {
448 v.sort_by(|_, _| *[Less, Equal, Greater].choose(&mut rng).unwrap());
450 for i in 0..v.len() {
451 assert_eq!(v[i], i as i32);
459 let mut v = [0xDEADBEEFu64];
461 assert!(v == [0xDEADBEEF]);
465 fn test_sort_stability() {
467 let large_range = if cfg!(miri) { 0..0 } else { 500..510 };
468 let rounds = if cfg!(miri) { 1 } else { 10 };
470 for len in (2..25).chain(large_range) {
472 let mut counts = [0; 10];
474 // create a vector like [(6, 1), (5, 1), (6, 2), ...],
475 // where the first item of each tuple is random, but
476 // the second item represents which occurrence of that
477 // number this element is, i.e., the second elements
478 // will occur in sorted order.
479 let orig: Vec<_> = (0..len)
481 let n = thread_rng().gen::<usize>() % 10;
487 let mut v = orig.clone();
488 // Only sort on the first element, so an unstable sort
489 // may mix up the counts.
490 v.sort_by(|&(a, _), &(b, _)| a.cmp(&b));
492 // This comparison includes the count (the second item
493 // of the tuple), so elements with equal first items
494 // will need to be ordered with increasing
495 // counts... i.e., exactly asserting that this sort is
497 assert!(v.windows(2).all(|w| w[0] <= w[1]));
499 let mut v = orig.clone();
500 v.sort_by_cached_key(|&(x, _)| x);
501 assert!(v.windows(2).all(|w| w[0] <= w[1]));
507 fn test_rotate_left() {
508 let expected: Vec<_> = (0..13).collect();
509 let mut v = Vec::new();
512 v.clone_from(&expected);
514 assert_eq!(v, expected);
515 v.rotate_left(expected.len());
516 assert_eq!(v, expected);
517 let mut zst_array = [(), (), ()];
518 zst_array.rotate_left(2);
521 v = (5..13).chain(0..5).collect();
523 assert_eq!(v, expected);
525 let expected: Vec<_> = (0..1000).collect();
527 // small rotations in large slice, uses ptr::copy
528 v = (2..1000).chain(0..2).collect();
530 assert_eq!(v, expected);
531 v = (998..1000).chain(0..998).collect();
533 assert_eq!(v, expected);
535 // non-small prime rotation, has a few rounds of swapping
536 v = (389..1000).chain(0..389).collect();
537 v.rotate_left(1000 - 389);
538 assert_eq!(v, expected);
542 fn test_rotate_right() {
543 let expected: Vec<_> = (0..13).collect();
544 let mut v = Vec::new();
547 v.clone_from(&expected);
549 assert_eq!(v, expected);
550 v.rotate_right(expected.len());
551 assert_eq!(v, expected);
552 let mut zst_array = [(), (), ()];
553 zst_array.rotate_right(2);
556 v = (5..13).chain(0..5).collect();
558 assert_eq!(v, expected);
560 let expected: Vec<_> = (0..1000).collect();
562 // small rotations in large slice, uses ptr::copy
563 v = (2..1000).chain(0..2).collect();
565 assert_eq!(v, expected);
566 v = (998..1000).chain(0..998).collect();
568 assert_eq!(v, expected);
570 // non-small prime rotation, has a few rounds of swapping
571 v = (389..1000).chain(0..389).collect();
573 assert_eq!(v, expected);
578 let v: [Vec<i32>; 0] = [];
581 let d = [vec![1], vec![2, 3]].concat();
582 assert_eq!(d, [1, 2, 3]);
584 let v: &[&[_]] = &[&[1], &[2, 3]];
585 assert_eq!(v.join(&0), [1, 0, 2, 3]);
586 let v: &[&[_]] = &[&[1], &[2], &[3]];
587 assert_eq!(v.join(&0), [1, 0, 2, 0, 3]);
592 let v: [Vec<i32>; 0] = [];
593 assert_eq!(v.join(&0), []);
594 assert_eq!([vec![1], vec![2, 3]].join(&0), [1, 0, 2, 3]);
595 assert_eq!([vec![1], vec![2], vec![3]].join(&0), [1, 0, 2, 0, 3]);
597 let v: [&[_]; 2] = [&[1], &[2, 3]];
598 assert_eq!(v.join(&0), [1, 0, 2, 3]);
599 let v: [&[_]; 3] = [&[1], &[2], &[3]];
600 assert_eq!(v.join(&0), [1, 0, 2, 0, 3]);
604 fn test_join_nocopy() {
605 let v: [String; 0] = [];
606 assert_eq!(v.join(","), "");
607 assert_eq!(["a".to_string(), "ab".into()].join(","), "a,ab");
608 assert_eq!(["a".to_string(), "ab".into(), "abc".into()].join(","), "a,ab,abc");
609 assert_eq!(["a".to_string(), "ab".into(), "".into()].join(","), "a,ab,");
614 let mut a = vec![1, 2, 4];
616 assert_eq!(a, [1, 2, 3, 4]);
618 let mut a = vec![1, 2, 3];
620 assert_eq!(a, [0, 1, 2, 3]);
622 let mut a = vec![1, 2, 3];
624 assert_eq!(a, [1, 2, 3, 4]);
633 fn test_insert_oob() {
634 let mut a = vec![1, 2, 3];
640 let mut a = vec![1, 2, 3, 4];
642 assert_eq!(a.remove(2), 3);
643 assert_eq!(a, [1, 2, 4]);
645 assert_eq!(a.remove(2), 4);
646 assert_eq!(a, [1, 2]);
648 assert_eq!(a.remove(0), 1);
651 assert_eq!(a.remove(0), 2);
657 fn test_remove_fail() {
667 assert!(v.capacity() >= 11);
672 let v = vec![1, 2, 3, 4, 5];
674 assert_eq!(v.len(), 2);
679 macro_rules! assert_order {
680 (Greater, $a:expr, $b:expr) => {
681 assert_eq!($a.cmp($b), Greater);
684 (Less, $a:expr, $b:expr) => {
685 assert_eq!($a.cmp($b), Less);
688 (Equal, $a:expr, $b:expr) => {
689 assert_eq!($a.cmp($b), Equal);
695 fn test_total_ord_u8() {
696 let c = &[1u8, 2, 3];
697 assert_order!(Greater, &[1u8, 2, 3, 4][..], &c[..]);
698 let c = &[1u8, 2, 3, 4];
699 assert_order!(Less, &[1u8, 2, 3][..], &c[..]);
700 let c = &[1u8, 2, 3, 6];
701 assert_order!(Equal, &[1u8, 2, 3, 6][..], &c[..]);
702 let c = &[1u8, 2, 3, 4, 5, 6];
703 assert_order!(Less, &[1u8, 2, 3, 4, 5, 5, 5, 5][..], &c[..]);
704 let c = &[1u8, 2, 3, 4];
705 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() {
797 let xs = [1, 2, 5, 10, 11];
798 let ys = [11, 10, 5, 2, 1];
800 for &x in xs.iter().rev() {
801 assert_eq!(x, ys[i]);
808 fn test_mut_rev_iterator() {
809 let mut xs = [1, 2, 3, 4, 5];
810 for (i, x) in xs.iter_mut().rev().enumerate() {
813 assert!(xs == [5, 5, 5, 5, 5])
817 fn test_move_iterator() {
818 let xs = vec![1, 2, 3, 4, 5];
819 assert_eq!(xs.into_iter().fold(0, |a: usize, b: usize| 10 * a + b), 12345);
823 fn test_move_rev_iterator() {
824 let xs = vec![1, 2, 3, 4, 5];
825 assert_eq!(xs.into_iter().rev().fold(0, |a: usize, b: usize| 10 * a + b), 54321);
829 fn test_splitator() {
830 let xs = &[1, 2, 3, 4, 5];
832 let splits: &[&[_]] = &[&[1], &[3], &[5]];
833 assert_eq!(xs.split(|x| *x % 2 == 0).collect::<Vec<_>>(), splits);
834 let splits: &[&[_]] = &[&[], &[2, 3, 4, 5]];
835 assert_eq!(xs.split(|x| *x == 1).collect::<Vec<_>>(), splits);
836 let splits: &[&[_]] = &[&[1, 2, 3, 4], &[]];
837 assert_eq!(xs.split(|x| *x == 5).collect::<Vec<_>>(), splits);
838 let splits: &[&[_]] = &[&[1, 2, 3, 4, 5]];
839 assert_eq!(xs.split(|x| *x == 10).collect::<Vec<_>>(), splits);
840 let splits: &[&[_]] = &[&[], &[], &[], &[], &[], &[]];
841 assert_eq!(xs.split(|_| true).collect::<Vec<&[i32]>>(), splits);
843 let xs: &[i32] = &[];
844 let splits: &[&[i32]] = &[&[]];
845 assert_eq!(xs.split(|x| *x == 5).collect::<Vec<&[i32]>>(), splits);
849 fn test_splitator_inclusive() {
850 let xs = &[1, 2, 3, 4, 5];
852 let splits: &[&[_]] = &[&[1, 2], &[3, 4], &[5]];
853 assert_eq!(xs.split_inclusive(|x| *x % 2 == 0).collect::<Vec<_>>(), splits);
854 let splits: &[&[_]] = &[&[1], &[2, 3, 4, 5]];
855 assert_eq!(xs.split_inclusive(|x| *x == 1).collect::<Vec<_>>(), splits);
856 let splits: &[&[_]] = &[&[1, 2, 3, 4, 5]];
857 assert_eq!(xs.split_inclusive(|x| *x == 5).collect::<Vec<_>>(), splits);
858 let splits: &[&[_]] = &[&[1, 2, 3, 4, 5]];
859 assert_eq!(xs.split_inclusive(|x| *x == 10).collect::<Vec<_>>(), splits);
860 let splits: &[&[_]] = &[&[1], &[2], &[3], &[4], &[5]];
861 assert_eq!(xs.split_inclusive(|_| true).collect::<Vec<&[i32]>>(), splits);
863 let xs: &[i32] = &[];
864 let splits: &[&[i32]] = &[&[]];
865 assert_eq!(xs.split_inclusive(|x| *x == 5).collect::<Vec<&[i32]>>(), splits);
869 fn test_splitator_inclusive_reverse() {
870 let xs = &[1, 2, 3, 4, 5];
872 let splits: &[&[_]] = &[&[5], &[3, 4], &[1, 2]];
873 assert_eq!(xs.split_inclusive(|x| *x % 2 == 0).rev().collect::<Vec<_>>(), splits);
874 let splits: &[&[_]] = &[&[2, 3, 4, 5], &[1]];
875 assert_eq!(xs.split_inclusive(|x| *x == 1).rev().collect::<Vec<_>>(), splits);
876 let splits: &[&[_]] = &[&[1, 2, 3, 4, 5]];
877 assert_eq!(xs.split_inclusive(|x| *x == 5).rev().collect::<Vec<_>>(), splits);
878 let splits: &[&[_]] = &[&[1, 2, 3, 4, 5]];
879 assert_eq!(xs.split_inclusive(|x| *x == 10).rev().collect::<Vec<_>>(), splits);
880 let splits: &[&[_]] = &[&[5], &[4], &[3], &[2], &[1]];
881 assert_eq!(xs.split_inclusive(|_| true).rev().collect::<Vec<_>>(), splits);
883 let xs: &[i32] = &[];
884 let splits: &[&[i32]] = &[&[]];
885 assert_eq!(xs.split_inclusive(|x| *x == 5).rev().collect::<Vec<_>>(), splits);
889 fn test_splitator_mut_inclusive() {
890 let xs = &mut [1, 2, 3, 4, 5];
892 let splits: &[&[_]] = &[&[1, 2], &[3, 4], &[5]];
893 assert_eq!(xs.split_inclusive_mut(|x| *x % 2 == 0).collect::<Vec<_>>(), splits);
894 let splits: &[&[_]] = &[&[1], &[2, 3, 4, 5]];
895 assert_eq!(xs.split_inclusive_mut(|x| *x == 1).collect::<Vec<_>>(), splits);
896 let splits: &[&[_]] = &[&[1, 2, 3, 4, 5]];
897 assert_eq!(xs.split_inclusive_mut(|x| *x == 5).collect::<Vec<_>>(), splits);
898 let splits: &[&[_]] = &[&[1, 2, 3, 4, 5]];
899 assert_eq!(xs.split_inclusive_mut(|x| *x == 10).collect::<Vec<_>>(), splits);
900 let splits: &[&[_]] = &[&[1], &[2], &[3], &[4], &[5]];
901 assert_eq!(xs.split_inclusive_mut(|_| true).collect::<Vec<_>>(), splits);
903 let xs: &mut [i32] = &mut [];
904 let splits: &[&[i32]] = &[&[]];
905 assert_eq!(xs.split_inclusive_mut(|x| *x == 5).collect::<Vec<_>>(), splits);
909 fn test_splitator_mut_inclusive_reverse() {
910 let xs = &mut [1, 2, 3, 4, 5];
912 let splits: &[&[_]] = &[&[5], &[3, 4], &[1, 2]];
913 assert_eq!(xs.split_inclusive_mut(|x| *x % 2 == 0).rev().collect::<Vec<_>>(), splits);
914 let splits: &[&[_]] = &[&[2, 3, 4, 5], &[1]];
915 assert_eq!(xs.split_inclusive_mut(|x| *x == 1).rev().collect::<Vec<_>>(), splits);
916 let splits: &[&[_]] = &[&[1, 2, 3, 4, 5]];
917 assert_eq!(xs.split_inclusive_mut(|x| *x == 5).rev().collect::<Vec<_>>(), splits);
918 let splits: &[&[_]] = &[&[1, 2, 3, 4, 5]];
919 assert_eq!(xs.split_inclusive_mut(|x| *x == 10).rev().collect::<Vec<_>>(), splits);
920 let splits: &[&[_]] = &[&[5], &[4], &[3], &[2], &[1]];
921 assert_eq!(xs.split_inclusive_mut(|_| true).rev().collect::<Vec<_>>(), splits);
923 let xs: &mut [i32] = &mut [];
924 let splits: &[&[i32]] = &[&[]];
925 assert_eq!(xs.split_inclusive_mut(|x| *x == 5).rev().collect::<Vec<_>>(), splits);
929 fn test_splitnator() {
930 let xs = &[1, 2, 3, 4, 5];
932 let splits: &[&[_]] = &[&[1, 2, 3, 4, 5]];
933 assert_eq!(xs.splitn(1, |x| *x % 2 == 0).collect::<Vec<_>>(), splits);
934 let splits: &[&[_]] = &[&[1], &[3, 4, 5]];
935 assert_eq!(xs.splitn(2, |x| *x % 2 == 0).collect::<Vec<_>>(), splits);
936 let splits: &[&[_]] = &[&[], &[], &[], &[4, 5]];
937 assert_eq!(xs.splitn(4, |_| true).collect::<Vec<_>>(), splits);
939 let xs: &[i32] = &[];
940 let splits: &[&[i32]] = &[&[]];
941 assert_eq!(xs.splitn(2, |x| *x == 5).collect::<Vec<_>>(), splits);
945 fn test_splitnator_mut() {
946 let xs = &mut [1, 2, 3, 4, 5];
948 let splits: &[&mut [_]] = &[&mut [1, 2, 3, 4, 5]];
949 assert_eq!(xs.splitn_mut(1, |x| *x % 2 == 0).collect::<Vec<_>>(), splits);
950 let splits: &[&mut [_]] = &[&mut [1], &mut [3, 4, 5]];
951 assert_eq!(xs.splitn_mut(2, |x| *x % 2 == 0).collect::<Vec<_>>(), splits);
952 let splits: &[&mut [_]] = &[&mut [], &mut [], &mut [], &mut [4, 5]];
953 assert_eq!(xs.splitn_mut(4, |_| true).collect::<Vec<_>>(), splits);
955 let xs: &mut [i32] = &mut [];
956 let splits: &[&mut [i32]] = &[&mut []];
957 assert_eq!(xs.splitn_mut(2, |x| *x == 5).collect::<Vec<_>>(), splits);
961 fn test_rsplitator() {
962 let xs = &[1, 2, 3, 4, 5];
964 let splits: &[&[_]] = &[&[5], &[3], &[1]];
965 assert_eq!(xs.split(|x| *x % 2 == 0).rev().collect::<Vec<_>>(), splits);
966 let splits: &[&[_]] = &[&[2, 3, 4, 5], &[]];
967 assert_eq!(xs.split(|x| *x == 1).rev().collect::<Vec<_>>(), splits);
968 let splits: &[&[_]] = &[&[], &[1, 2, 3, 4]];
969 assert_eq!(xs.split(|x| *x == 5).rev().collect::<Vec<_>>(), splits);
970 let splits: &[&[_]] = &[&[1, 2, 3, 4, 5]];
971 assert_eq!(xs.split(|x| *x == 10).rev().collect::<Vec<_>>(), splits);
973 let xs: &[i32] = &[];
974 let splits: &[&[i32]] = &[&[]];
975 assert_eq!(xs.split(|x| *x == 5).rev().collect::<Vec<&[i32]>>(), splits);
979 fn test_rsplitnator() {
980 let xs = &[1, 2, 3, 4, 5];
982 let splits: &[&[_]] = &[&[1, 2, 3, 4, 5]];
983 assert_eq!(xs.rsplitn(1, |x| *x % 2 == 0).collect::<Vec<_>>(), splits);
984 let splits: &[&[_]] = &[&[5], &[1, 2, 3]];
985 assert_eq!(xs.rsplitn(2, |x| *x % 2 == 0).collect::<Vec<_>>(), splits);
986 let splits: &[&[_]] = &[&[], &[], &[], &[1, 2]];
987 assert_eq!(xs.rsplitn(4, |_| true).collect::<Vec<_>>(), splits);
989 let xs: &[i32] = &[];
990 let splits: &[&[i32]] = &[&[]];
991 assert_eq!(xs.rsplitn(2, |x| *x == 5).collect::<Vec<&[i32]>>(), splits);
992 assert!(xs.rsplitn(0, |x| *x % 2 == 0).next().is_none());
996 fn test_windowsator() {
997 let v = &[1, 2, 3, 4];
999 let wins: &[&[_]] = &[&[1, 2], &[2, 3], &[3, 4]];
1000 assert_eq!(v.windows(2).collect::<Vec<_>>(), wins);
1002 let wins: &[&[_]] = &[&[1, 2, 3], &[2, 3, 4]];
1003 assert_eq!(v.windows(3).collect::<Vec<_>>(), wins);
1004 assert!(v.windows(6).next().is_none());
1006 let wins: &[&[_]] = &[&[3, 4], &[2, 3], &[1, 2]];
1007 assert_eq!(v.windows(2).rev().collect::<Vec<&[_]>>(), wins);
1012 fn test_windowsator_0() {
1013 let v = &[1, 2, 3, 4];
1014 let _it = v.windows(0);
1018 fn test_chunksator() {
1019 let v = &[1, 2, 3, 4, 5];
1021 assert_eq!(v.chunks(2).len(), 3);
1023 let chunks: &[&[_]] = &[&[1, 2], &[3, 4], &[5]];
1024 assert_eq!(v.chunks(2).collect::<Vec<_>>(), chunks);
1025 let chunks: &[&[_]] = &[&[1, 2, 3], &[4, 5]];
1026 assert_eq!(v.chunks(3).collect::<Vec<_>>(), chunks);
1027 let chunks: &[&[_]] = &[&[1, 2, 3, 4, 5]];
1028 assert_eq!(v.chunks(6).collect::<Vec<_>>(), chunks);
1030 let chunks: &[&[_]] = &[&[5], &[3, 4], &[1, 2]];
1031 assert_eq!(v.chunks(2).rev().collect::<Vec<_>>(), chunks);
1036 fn test_chunksator_0() {
1037 let v = &[1, 2, 3, 4];
1038 let _it = v.chunks(0);
1042 fn test_chunks_exactator() {
1043 let v = &[1, 2, 3, 4, 5];
1045 assert_eq!(v.chunks_exact(2).len(), 2);
1047 let chunks: &[&[_]] = &[&[1, 2], &[3, 4]];
1048 assert_eq!(v.chunks_exact(2).collect::<Vec<_>>(), chunks);
1049 let chunks: &[&[_]] = &[&[1, 2, 3]];
1050 assert_eq!(v.chunks_exact(3).collect::<Vec<_>>(), chunks);
1051 let chunks: &[&[_]] = &[];
1052 assert_eq!(v.chunks_exact(6).collect::<Vec<_>>(), chunks);
1054 let chunks: &[&[_]] = &[&[3, 4], &[1, 2]];
1055 assert_eq!(v.chunks_exact(2).rev().collect::<Vec<_>>(), chunks);
1060 fn test_chunks_exactator_0() {
1061 let v = &[1, 2, 3, 4];
1062 let _it = v.chunks_exact(0);
1066 fn test_rchunksator() {
1067 let v = &[1, 2, 3, 4, 5];
1069 assert_eq!(v.rchunks(2).len(), 3);
1071 let chunks: &[&[_]] = &[&[4, 5], &[2, 3], &[1]];
1072 assert_eq!(v.rchunks(2).collect::<Vec<_>>(), chunks);
1073 let chunks: &[&[_]] = &[&[3, 4, 5], &[1, 2]];
1074 assert_eq!(v.rchunks(3).collect::<Vec<_>>(), chunks);
1075 let chunks: &[&[_]] = &[&[1, 2, 3, 4, 5]];
1076 assert_eq!(v.rchunks(6).collect::<Vec<_>>(), chunks);
1078 let chunks: &[&[_]] = &[&[1], &[2, 3], &[4, 5]];
1079 assert_eq!(v.rchunks(2).rev().collect::<Vec<_>>(), chunks);
1084 fn test_rchunksator_0() {
1085 let v = &[1, 2, 3, 4];
1086 let _it = v.rchunks(0);
1090 fn test_rchunks_exactator() {
1091 let v = &[1, 2, 3, 4, 5];
1093 assert_eq!(v.rchunks_exact(2).len(), 2);
1095 let chunks: &[&[_]] = &[&[4, 5], &[2, 3]];
1096 assert_eq!(v.rchunks_exact(2).collect::<Vec<_>>(), chunks);
1097 let chunks: &[&[_]] = &[&[3, 4, 5]];
1098 assert_eq!(v.rchunks_exact(3).collect::<Vec<_>>(), chunks);
1099 let chunks: &[&[_]] = &[];
1100 assert_eq!(v.rchunks_exact(6).collect::<Vec<_>>(), chunks);
1102 let chunks: &[&[_]] = &[&[2, 3], &[4, 5]];
1103 assert_eq!(v.rchunks_exact(2).rev().collect::<Vec<_>>(), chunks);
1108 fn test_rchunks_exactator_0() {
1109 let v = &[1, 2, 3, 4];
1110 let _it = v.rchunks_exact(0);
1114 fn test_reverse_part() {
1115 let mut values = [1, 2, 3, 4, 5];
1116 values[1..4].reverse();
1117 assert!(values == [1, 4, 3, 2, 5]);
1122 macro_rules! test_show_vec {
1123 ($x:expr, $x_str:expr) => {{
1124 let (x, x_str) = ($x, $x_str);
1125 assert_eq!(format!("{:?}", x), x_str);
1126 assert_eq!(format!("{:?}", x), x_str);
1129 let empty = Vec::<i32>::new();
1130 test_show_vec!(empty, "[]");
1131 test_show_vec!(vec![1], "[1]");
1132 test_show_vec!(vec![1, 2, 3], "[1, 2, 3]");
1133 test_show_vec!(vec![vec![], vec![1], vec![1, 1]], "[[], [1], [1, 1]]");
1135 let empty_mut: &mut [i32] = &mut [];
1136 test_show_vec!(empty_mut, "[]");
1138 test_show_vec!(v, "[1]");
1139 let v = &mut [1, 2, 3];
1140 test_show_vec!(v, "[1, 2, 3]");
1141 let v: &mut [&mut [_]] = &mut [&mut [], &mut [1], &mut [1, 1]];
1142 test_show_vec!(v, "[[], [1], [1, 1]]");
1146 fn test_vec_default() {
1149 let v: $ty = Default::default();
1150 assert!(v.is_empty());
1160 fn test_overflow_does_not_cause_segfault() {
1162 v.reserve_exact(!0);
1169 fn test_overflow_does_not_cause_segfault_managed() {
1170 let mut v = vec![Rc::new(1)];
1171 v.reserve_exact(!0);
1176 fn test_mut_split_at() {
1177 let mut values = [1, 2, 3, 4, 5];
1179 let (left, right) = values.split_at_mut(2);
1181 let left: &[_] = left;
1182 assert!(left[..left.len()] == [1, 2]);
1189 let right: &[_] = right;
1190 assert!(right[..right.len()] == [3, 4, 5]);
1197 assert!(values == [2, 3, 5, 6, 7]);
1200 #[derive(Clone, PartialEq)]
1204 fn test_iter_zero_sized() {
1205 let mut v = vec![Foo, Foo, Foo];
1206 assert_eq!(v.len(), 3);
1231 assert_eq!(cnt, 11);
1233 let xs: [Foo; 3] = [Foo, Foo, Foo];
1243 fn test_shrink_to_fit() {
1244 let mut xs = vec![0, 1, 2, 3];
1248 assert_eq!(xs.capacity(), 128);
1250 assert_eq!(xs.capacity(), 100);
1251 assert_eq!(xs, (0..100).collect::<Vec<_>>());
1255 fn test_starts_with() {
1256 assert!(b"foobar".starts_with(b"foo"));
1257 assert!(!b"foobar".starts_with(b"oob"));
1258 assert!(!b"foobar".starts_with(b"bar"));
1259 assert!(!b"foo".starts_with(b"foobar"));
1260 assert!(!b"bar".starts_with(b"foobar"));
1261 assert!(b"foobar".starts_with(b"foobar"));
1262 let empty: &[u8] = &[];
1263 assert!(empty.starts_with(empty));
1264 assert!(!empty.starts_with(b"foo"));
1265 assert!(b"foobar".starts_with(empty));
1269 fn test_ends_with() {
1270 assert!(b"foobar".ends_with(b"bar"));
1271 assert!(!b"foobar".ends_with(b"oba"));
1272 assert!(!b"foobar".ends_with(b"foo"));
1273 assert!(!b"foo".ends_with(b"foobar"));
1274 assert!(!b"bar".ends_with(b"foobar"));
1275 assert!(b"foobar".ends_with(b"foobar"));
1276 let empty: &[u8] = &[];
1277 assert!(empty.ends_with(empty));
1278 assert!(!empty.ends_with(b"foo"));
1279 assert!(b"foobar".ends_with(empty));
1283 fn test_mut_splitator() {
1284 let mut xs = [0, 1, 0, 2, 3, 0, 0, 4, 5, 0];
1285 assert_eq!(xs.split_mut(|x| *x == 0).count(), 6);
1286 for slice in xs.split_mut(|x| *x == 0) {
1289 assert!(xs == [0, 1, 0, 3, 2, 0, 0, 5, 4, 0]);
1291 let mut xs = [0, 1, 0, 2, 3, 0, 0, 4, 5, 0, 6, 7];
1292 for slice in xs.split_mut(|x| *x == 0).take(5) {
1295 assert!(xs == [0, 1, 0, 3, 2, 0, 0, 5, 4, 0, 6, 7]);
1299 fn test_mut_splitator_rev() {
1300 let mut xs = [1, 2, 0, 3, 4, 0, 0, 5, 6, 0];
1301 for slice in xs.split_mut(|x| *x == 0).rev().take(4) {
1304 assert!(xs == [1, 2, 0, 4, 3, 0, 0, 6, 5, 0]);
1309 let mut v = [0, 1, 2];
1310 assert_eq!(v.get_mut(3), None);
1311 v.get_mut(1).map(|e| *e = 7);
1312 assert_eq!(v[1], 7);
1314 assert_eq!(v.get_mut(2), Some(&mut x));
1318 fn test_mut_chunks() {
1319 let mut v = [0, 1, 2, 3, 4, 5, 6];
1320 assert_eq!(v.chunks_mut(3).len(), 3);
1321 for (i, chunk) in v.chunks_mut(3).enumerate() {
1326 let result = [0, 0, 0, 1, 1, 1, 2];
1327 assert_eq!(v, result);
1331 fn test_mut_chunks_rev() {
1332 let mut v = [0, 1, 2, 3, 4, 5, 6];
1333 for (i, chunk) in v.chunks_mut(3).rev().enumerate() {
1338 let result = [2, 2, 2, 1, 1, 1, 0];
1339 assert_eq!(v, result);
1344 fn test_mut_chunks_0() {
1345 let mut v = [1, 2, 3, 4];
1346 let _it = v.chunks_mut(0);
1350 fn test_mut_chunks_exact() {
1351 let mut v = [0, 1, 2, 3, 4, 5, 6];
1352 assert_eq!(v.chunks_exact_mut(3).len(), 2);
1353 for (i, chunk) in v.chunks_exact_mut(3).enumerate() {
1358 let result = [0, 0, 0, 1, 1, 1, 6];
1359 assert_eq!(v, result);
1363 fn test_mut_chunks_exact_rev() {
1364 let mut v = [0, 1, 2, 3, 4, 5, 6];
1365 for (i, chunk) in v.chunks_exact_mut(3).rev().enumerate() {
1370 let result = [1, 1, 1, 0, 0, 0, 6];
1371 assert_eq!(v, result);
1376 fn test_mut_chunks_exact_0() {
1377 let mut v = [1, 2, 3, 4];
1378 let _it = v.chunks_exact_mut(0);
1382 fn test_mut_rchunks() {
1383 let mut v = [0, 1, 2, 3, 4, 5, 6];
1384 assert_eq!(v.rchunks_mut(3).len(), 3);
1385 for (i, chunk) in v.rchunks_mut(3).enumerate() {
1390 let result = [2, 1, 1, 1, 0, 0, 0];
1391 assert_eq!(v, result);
1395 fn test_mut_rchunks_rev() {
1396 let mut v = [0, 1, 2, 3, 4, 5, 6];
1397 for (i, chunk) in v.rchunks_mut(3).rev().enumerate() {
1402 let result = [0, 1, 1, 1, 2, 2, 2];
1403 assert_eq!(v, result);
1408 fn test_mut_rchunks_0() {
1409 let mut v = [1, 2, 3, 4];
1410 let _it = v.rchunks_mut(0);
1414 fn test_mut_rchunks_exact() {
1415 let mut v = [0, 1, 2, 3, 4, 5, 6];
1416 assert_eq!(v.rchunks_exact_mut(3).len(), 2);
1417 for (i, chunk) in v.rchunks_exact_mut(3).enumerate() {
1422 let result = [0, 1, 1, 1, 0, 0, 0];
1423 assert_eq!(v, result);
1427 fn test_mut_rchunks_exact_rev() {
1428 let mut v = [0, 1, 2, 3, 4, 5, 6];
1429 for (i, chunk) in v.rchunks_exact_mut(3).rev().enumerate() {
1434 let result = [0, 0, 0, 0, 1, 1, 1];
1435 assert_eq!(v, result);
1440 fn test_mut_rchunks_exact_0() {
1441 let mut v = [1, 2, 3, 4];
1442 let _it = v.rchunks_exact_mut(0);
1446 fn test_mut_last() {
1447 let mut x = [1, 2, 3, 4, 5];
1448 let h = x.last_mut();
1449 assert_eq!(*h.unwrap(), 5);
1451 let y: &mut [i32] = &mut [];
1452 assert!(y.last_mut().is_none());
1457 let xs: Box<_> = box [1, 2, 3];
1458 let ys = xs.to_vec();
1459 assert_eq!(ys, [1, 2, 3]);
1463 fn test_box_slice_clone() {
1464 let data = vec![vec![0, 1], vec![0], vec![1]];
1465 let data2 = data.clone().into_boxed_slice().clone().to_vec();
1467 assert_eq!(data, data2);
1471 #[allow(unused_must_use)] // here, we care about the side effects of `.clone()`
1472 #[cfg_attr(target_os = "emscripten", ignore)]
1473 fn test_box_slice_clone_panics() {
1474 use std::sync::atomic::{AtomicUsize, Ordering};
1478 count: Arc<AtomicUsize>,
1482 impl Drop for Canary {
1483 fn drop(&mut self) {
1484 self.count.fetch_add(1, Ordering::SeqCst);
1488 impl Clone for Canary {
1489 fn clone(&self) -> Self {
1494 Canary { count: self.count.clone(), panics: self.panics }
1498 let drop_count = Arc::new(AtomicUsize::new(0));
1499 let canary = Canary { count: drop_count.clone(), panics: false };
1500 let panic = Canary { count: drop_count.clone(), panics: true };
1502 std::panic::catch_unwind(move || {
1503 // When xs is dropped, +5.
1505 vec![canary.clone(), canary.clone(), canary.clone(), panic, canary].into_boxed_slice();
1507 // When panic is cloned, +3.
1513 assert_eq!(drop_count.load(Ordering::SeqCst), 8);
1517 fn test_copy_from_slice() {
1518 let src = [0, 1, 2, 3, 4, 5];
1519 let mut dst = [0; 6];
1520 dst.copy_from_slice(&src);
1521 assert_eq!(src, dst)
1525 #[should_panic(expected = "source slice length (4) does not match destination slice length (5)")]
1526 fn test_copy_from_slice_dst_longer() {
1527 let src = [0, 1, 2, 3];
1528 let mut dst = [0; 5];
1529 dst.copy_from_slice(&src);
1533 #[should_panic(expected = "source slice length (4) does not match destination slice length (3)")]
1534 fn test_copy_from_slice_dst_shorter() {
1535 let src = [0, 1, 2, 3];
1536 let mut dst = [0; 3];
1537 dst.copy_from_slice(&src);
1540 const MAX_LEN: usize = 80;
1542 static DROP_COUNTS: [AtomicUsize; MAX_LEN] = [
1543 // FIXME(RFC 1109): AtomicUsize is not Copy.
1544 AtomicUsize::new(0),
1545 AtomicUsize::new(0),
1546 AtomicUsize::new(0),
1547 AtomicUsize::new(0),
1548 AtomicUsize::new(0),
1549 AtomicUsize::new(0),
1550 AtomicUsize::new(0),
1551 AtomicUsize::new(0),
1552 AtomicUsize::new(0),
1553 AtomicUsize::new(0),
1554 AtomicUsize::new(0),
1555 AtomicUsize::new(0),
1556 AtomicUsize::new(0),
1557 AtomicUsize::new(0),
1558 AtomicUsize::new(0),
1559 AtomicUsize::new(0),
1560 AtomicUsize::new(0),
1561 AtomicUsize::new(0),
1562 AtomicUsize::new(0),
1563 AtomicUsize::new(0),
1564 AtomicUsize::new(0),
1565 AtomicUsize::new(0),
1566 AtomicUsize::new(0),
1567 AtomicUsize::new(0),
1568 AtomicUsize::new(0),
1569 AtomicUsize::new(0),
1570 AtomicUsize::new(0),
1571 AtomicUsize::new(0),
1572 AtomicUsize::new(0),
1573 AtomicUsize::new(0),
1574 AtomicUsize::new(0),
1575 AtomicUsize::new(0),
1576 AtomicUsize::new(0),
1577 AtomicUsize::new(0),
1578 AtomicUsize::new(0),
1579 AtomicUsize::new(0),
1580 AtomicUsize::new(0),
1581 AtomicUsize::new(0),
1582 AtomicUsize::new(0),
1583 AtomicUsize::new(0),
1584 AtomicUsize::new(0),
1585 AtomicUsize::new(0),
1586 AtomicUsize::new(0),
1587 AtomicUsize::new(0),
1588 AtomicUsize::new(0),
1589 AtomicUsize::new(0),
1590 AtomicUsize::new(0),
1591 AtomicUsize::new(0),
1592 AtomicUsize::new(0),
1593 AtomicUsize::new(0),
1594 AtomicUsize::new(0),
1595 AtomicUsize::new(0),
1596 AtomicUsize::new(0),
1597 AtomicUsize::new(0),
1598 AtomicUsize::new(0),
1599 AtomicUsize::new(0),
1600 AtomicUsize::new(0),
1601 AtomicUsize::new(0),
1602 AtomicUsize::new(0),
1603 AtomicUsize::new(0),
1604 AtomicUsize::new(0),
1605 AtomicUsize::new(0),
1606 AtomicUsize::new(0),
1607 AtomicUsize::new(0),
1608 AtomicUsize::new(0),
1609 AtomicUsize::new(0),
1610 AtomicUsize::new(0),
1611 AtomicUsize::new(0),
1612 AtomicUsize::new(0),
1613 AtomicUsize::new(0),
1614 AtomicUsize::new(0),
1615 AtomicUsize::new(0),
1616 AtomicUsize::new(0),
1617 AtomicUsize::new(0),
1618 AtomicUsize::new(0),
1619 AtomicUsize::new(0),
1620 AtomicUsize::new(0),
1621 AtomicUsize::new(0),
1622 AtomicUsize::new(0),
1623 AtomicUsize::new(0),
1626 static VERSIONS: AtomicUsize = AtomicUsize::new(0);
1628 #[derive(Clone, Eq)]
1629 struct DropCounter {
1632 version: Cell<usize>,
1635 impl PartialEq for DropCounter {
1636 fn eq(&self, other: &Self) -> bool {
1637 self.partial_cmp(other) == Some(Ordering::Equal)
1641 impl PartialOrd for DropCounter {
1642 fn partial_cmp(&self, other: &Self) -> Option<Ordering> {
1643 self.version.set(self.version.get() + 1);
1644 other.version.set(other.version.get() + 1);
1645 VERSIONS.fetch_add(2, Relaxed);
1646 self.x.partial_cmp(&other.x)
1650 impl Ord for DropCounter {
1651 fn cmp(&self, other: &Self) -> Ordering {
1652 self.partial_cmp(other).unwrap()
1656 impl Drop for DropCounter {
1657 fn drop(&mut self) {
1658 DROP_COUNTS[self.id].fetch_add(1, Relaxed);
1659 VERSIONS.fetch_sub(self.version.get(), Relaxed);
1664 ($input:ident, $func:ident) => {
1665 let len = $input.len();
1667 // Work out the total number of comparisons required to sort
1669 let mut count = 0usize;
1670 $input.to_owned().$func(|a, b| {
1675 // ... and then panic on each and every single one.
1676 for panic_countdown in 0..count {
1677 // Refresh the counters.
1678 VERSIONS.store(0, Relaxed);
1680 DROP_COUNTS[i].store(0, Relaxed);
1683 let v = $input.to_owned();
1684 let _ = std::panic::catch_unwind(move || {
1686 let mut panic_countdown = panic_countdown;
1688 if panic_countdown == 0 {
1689 SILENCE_PANIC.with(|s| s.set(true));
1692 panic_countdown -= 1;
1697 // Check that the number of things dropped is exactly
1698 // what we expect (i.e., the contents of `v`).
1699 for (i, c) in DROP_COUNTS.iter().enumerate().take(len) {
1700 let count = c.load(Relaxed);
1701 assert!(count == 1, "found drop count == {} for i == {}, len == {}", count, i, len);
1704 // Check that the most recent versions of values were dropped.
1705 assert_eq!(VERSIONS.load(Relaxed), 0);
1710 thread_local!(static SILENCE_PANIC: Cell<bool> = Cell::new(false));
1713 #[cfg_attr(target_os = "emscripten", ignore)] // no threads
1715 let prev = panic::take_hook();
1716 panic::set_hook(Box::new(move |info| {
1717 if !SILENCE_PANIC.with(|s| s.get()) {
1722 let mut rng = thread_rng();
1724 // Miri is too slow (but still need to `chain` to make the types match)
1725 let lens = if cfg!(miri) { (1..10).chain(0..0) } else { (1..20).chain(70..MAX_LEN) };
1726 let moduli: &[u32] = if cfg!(miri) { &[5] } else { &[5, 20, 50] };
1729 for &modulus in moduli {
1730 for &has_runs in &[false, true] {
1731 let mut input = (0..len)
1732 .map(|id| DropCounter {
1733 x: rng.next_u32() % modulus,
1735 version: Cell::new(0),
1737 .collect::<Vec<_>>();
1740 for c in &mut input {
1745 let a = rng.gen::<usize>() % len;
1746 let b = rng.gen::<usize>() % len;
1748 input[a..b].reverse();
1755 test!(input, sort_by);
1756 test!(input, sort_unstable_by);
1761 // Set default panic hook again.
1762 drop(panic::take_hook());
1766 fn repeat_generic_slice() {
1767 assert_eq!([1, 2].repeat(2), vec![1, 2, 1, 2]);
1768 assert_eq!([1, 2, 3, 4].repeat(0), vec![]);
1769 assert_eq!([1, 2, 3, 4].repeat(1), vec![1, 2, 3, 4]);
1770 assert_eq!([1, 2, 3, 4].repeat(3), vec![1, 2, 3, 4, 1, 2, 3, 4, 1, 2, 3, 4]);