2 use std::cmp::Ordering::{self, Equal, Greater, Less};
6 use std::sync::atomic::{Ordering::Relaxed, AtomicUsize};
8 use rand::{Rng, RngCore, thread_rng};
9 use rand::seq::SliceRandom;
10 use rand::distributions::Standard;
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);
239 assert_eq!(v.len(), 0);
240 assert_eq!(e, Some(5));
248 fn test_swap_remove() {
249 let mut v = vec![1, 2, 3, 4, 5];
250 let mut e = v.swap_remove(0);
252 assert_eq!(v, [5, 2, 3, 4]);
253 e = v.swap_remove(3);
255 assert_eq!(v, [5, 2, 3]);
260 fn test_swap_remove_fail() {
262 let _ = v.swap_remove(0);
263 let _ = v.swap_remove(0);
267 fn test_swap_remove_noncopyable() {
268 // Tests that we don't accidentally run destructors twice.
269 let mut v: Vec<Box<_>> = Vec::new();
273 let mut _e = v.swap_remove(0);
274 assert_eq!(v.len(), 2);
275 _e = v.swap_remove(1);
276 assert_eq!(v.len(), 1);
277 _e = v.swap_remove(0);
278 assert_eq!(v.len(), 0);
283 // Test on-stack push().
286 assert_eq!(v.len(), 1);
289 // Test on-heap push().
291 assert_eq!(v.len(), 2);
298 let mut v: Vec<Box<_>> = vec![box 6, box 5, box 4];
301 assert_eq!(v.len(), 1);
302 assert_eq!(*(v[0]), 6);
303 // If the unsafe block didn't drop things properly, we blow up here.
308 let mut v: Vec<Box<_>> = vec![box 6, box 5, box 4];
310 assert_eq!(v.len(), 0);
311 // If the unsafe block didn't drop things properly, we blow up here.
316 let mut v = vec![1, 2, 3, 4, 5];
318 assert_eq!(v, [1, 3, 5]);
322 fn test_binary_search() {
323 assert_eq!([1, 2, 3, 4, 5].binary_search(&5).ok(), Some(4));
324 assert_eq!([1, 2, 3, 4, 5].binary_search(&4).ok(), Some(3));
325 assert_eq!([1, 2, 3, 4, 5].binary_search(&3).ok(), Some(2));
326 assert_eq!([1, 2, 3, 4, 5].binary_search(&2).ok(), Some(1));
327 assert_eq!([1, 2, 3, 4, 5].binary_search(&1).ok(), Some(0));
329 assert_eq!([2, 4, 6, 8, 10].binary_search(&1).ok(), None);
330 assert_eq!([2, 4, 6, 8, 10].binary_search(&5).ok(), None);
331 assert_eq!([2, 4, 6, 8, 10].binary_search(&4).ok(), Some(1));
332 assert_eq!([2, 4, 6, 8, 10].binary_search(&10).ok(), Some(4));
334 assert_eq!([2, 4, 6, 8].binary_search(&1).ok(), None);
335 assert_eq!([2, 4, 6, 8].binary_search(&5).ok(), None);
336 assert_eq!([2, 4, 6, 8].binary_search(&4).ok(), Some(1));
337 assert_eq!([2, 4, 6, 8].binary_search(&8).ok(), Some(3));
339 assert_eq!([2, 4, 6].binary_search(&1).ok(), None);
340 assert_eq!([2, 4, 6].binary_search(&5).ok(), None);
341 assert_eq!([2, 4, 6].binary_search(&4).ok(), Some(1));
342 assert_eq!([2, 4, 6].binary_search(&6).ok(), Some(2));
344 assert_eq!([2, 4].binary_search(&1).ok(), None);
345 assert_eq!([2, 4].binary_search(&5).ok(), None);
346 assert_eq!([2, 4].binary_search(&2).ok(), Some(0));
347 assert_eq!([2, 4].binary_search(&4).ok(), Some(1));
349 assert_eq!([2].binary_search(&1).ok(), None);
350 assert_eq!([2].binary_search(&5).ok(), None);
351 assert_eq!([2].binary_search(&2).ok(), Some(0));
353 assert_eq!([].binary_search(&1).ok(), None);
354 assert_eq!([].binary_search(&5).ok(), None);
356 assert!([1, 1, 1, 1, 1].binary_search(&1).ok() != None);
357 assert!([1, 1, 1, 1, 2].binary_search(&1).ok() != None);
358 assert!([1, 1, 1, 2, 2].binary_search(&1).ok() != None);
359 assert!([1, 1, 2, 2, 2].binary_search(&1).ok() != None);
360 assert_eq!([1, 2, 2, 2, 2].binary_search(&1).ok(), Some(0));
362 assert_eq!([1, 2, 3, 4, 5].binary_search(&6).ok(), None);
363 assert_eq!([1, 2, 3, 4, 5].binary_search(&0).ok(), None);
368 let mut v = vec![10, 20];
369 assert_eq!(v[0], 10);
370 assert_eq!(v[1], 20);
372 assert_eq!(v[0], 20);
373 assert_eq!(v[1], 10);
375 let mut v3 = Vec::<i32>::new();
377 assert!(v3.is_empty());
379 // check the 1-byte-types path
380 let mut v = (-50..51i8).collect::<Vec<_>>();
382 assert_eq!(v, (-50..51i8).rev().collect::<Vec<_>>());
384 // check the 2-byte-types path
385 let mut v = (-50..51i16).collect::<Vec<_>>();
387 assert_eq!(v, (-50..51i16).rev().collect::<Vec<_>>());
391 #[cfg(not(miri))] // Miri is too slow
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 #[cfg(not(miri))] // Miri is too slow
470 let large_range = 500..510;
471 #[cfg(not(miri))] // Miri is too slow
475 let large_range = 0..0; // empty range
479 for len in (2..25).chain(large_range) {
481 let mut counts = [0; 10];
483 // create a vector like [(6, 1), (5, 1), (6, 2), ...],
484 // where the first item of each tuple is random, but
485 // the second item represents which occurrence of that
486 // number this element is, i.e., the second elements
487 // will occur in sorted order.
488 let orig: Vec<_> = (0..len)
490 let n = thread_rng().gen::<usize>() % 10;
496 let mut v = orig.clone();
497 // Only sort on the first element, so an unstable sort
498 // may mix up the counts.
499 v.sort_by(|&(a, _), &(b, _)| a.cmp(&b));
501 // This comparison includes the count (the second item
502 // of the tuple), so elements with equal first items
503 // will need to be ordered with increasing
504 // counts... i.e., exactly asserting that this sort is
506 assert!(v.windows(2).all(|w| w[0] <= w[1]));
508 let mut v = orig.clone();
509 v.sort_by_cached_key(|&(x, _)| x);
510 assert!(v.windows(2).all(|w| w[0] <= w[1]));
516 fn test_rotate_left() {
517 let expected: Vec<_> = (0..13).collect();
518 let mut v = Vec::new();
521 v.clone_from(&expected);
523 assert_eq!(v, expected);
524 v.rotate_left(expected.len());
525 assert_eq!(v, expected);
526 let mut zst_array = [(), (), ()];
527 zst_array.rotate_left(2);
530 v = (5..13).chain(0..5).collect();
532 assert_eq!(v, expected);
534 let expected: Vec<_> = (0..1000).collect();
536 // small rotations in large slice, uses ptr::copy
537 v = (2..1000).chain(0..2).collect();
539 assert_eq!(v, expected);
540 v = (998..1000).chain(0..998).collect();
542 assert_eq!(v, expected);
544 // non-small prime rotation, has a few rounds of swapping
545 v = (389..1000).chain(0..389).collect();
546 v.rotate_left(1000-389);
547 assert_eq!(v, expected);
551 fn test_rotate_right() {
552 let expected: Vec<_> = (0..13).collect();
553 let mut v = Vec::new();
556 v.clone_from(&expected);
558 assert_eq!(v, expected);
559 v.rotate_right(expected.len());
560 assert_eq!(v, expected);
561 let mut zst_array = [(), (), ()];
562 zst_array.rotate_right(2);
565 v = (5..13).chain(0..5).collect();
567 assert_eq!(v, expected);
569 let expected: Vec<_> = (0..1000).collect();
571 // small rotations in large slice, uses ptr::copy
572 v = (2..1000).chain(0..2).collect();
574 assert_eq!(v, expected);
575 v = (998..1000).chain(0..998).collect();
577 assert_eq!(v, expected);
579 // non-small prime rotation, has a few rounds of swapping
580 v = (389..1000).chain(0..389).collect();
582 assert_eq!(v, expected);
587 let v: [Vec<i32>; 0] = [];
590 let d = [vec![1], vec![2, 3]].concat();
591 assert_eq!(d, [1, 2, 3]);
593 let v: &[&[_]] = &[&[1], &[2, 3]];
594 assert_eq!(v.join(&0), [1, 0, 2, 3]);
595 let v: &[&[_]] = &[&[1], &[2], &[3]];
596 assert_eq!(v.join(&0), [1, 0, 2, 0, 3]);
601 let v: [Vec<i32>; 0] = [];
602 assert_eq!(v.join(&0), []);
603 assert_eq!([vec![1], vec![2, 3]].join(&0), [1, 0, 2, 3]);
604 assert_eq!([vec![1], vec![2], vec![3]].join(&0), [1, 0, 2, 0, 3]);
606 let v: [&[_]; 2] = [&[1], &[2, 3]];
607 assert_eq!(v.join(&0), [1, 0, 2, 3]);
608 let v: [&[_]; 3] = [&[1], &[2], &[3]];
609 assert_eq!(v.join(&0), [1, 0, 2, 0, 3]);
613 fn test_join_nocopy() {
614 let v: [String; 0] = [];
615 assert_eq!(v.join(","), "");
616 assert_eq!(["a".to_string(), "ab".into()].join(","), "a,ab");
617 assert_eq!(["a".to_string(), "ab".into(), "abc".into()].join(","), "a,ab,abc");
618 assert_eq!(["a".to_string(), "ab".into(), "".into()].join(","), "a,ab,");
623 let mut a = vec![1, 2, 4];
625 assert_eq!(a, [1, 2, 3, 4]);
627 let mut a = vec![1, 2, 3];
629 assert_eq!(a, [0, 1, 2, 3]);
631 let mut a = vec![1, 2, 3];
633 assert_eq!(a, [1, 2, 3, 4]);
642 fn test_insert_oob() {
643 let mut a = vec![1, 2, 3];
649 let mut a = vec![1, 2, 3, 4];
651 assert_eq!(a.remove(2), 3);
652 assert_eq!(a, [1, 2, 4]);
654 assert_eq!(a.remove(2), 4);
655 assert_eq!(a, [1, 2]);
657 assert_eq!(a.remove(0), 1);
660 assert_eq!(a.remove(0), 2);
666 fn test_remove_fail() {
676 assert!(v.capacity() >= 11);
681 let v = vec![1, 2, 3, 4, 5];
683 assert_eq!(v.len(), 2);
688 macro_rules! assert_order {
689 (Greater, $a:expr, $b:expr) => {
690 assert_eq!($a.cmp($b), Greater);
693 (Less, $a:expr, $b:expr) => {
694 assert_eq!($a.cmp($b), Less);
697 (Equal, $a:expr, $b:expr) => {
698 assert_eq!($a.cmp($b), Equal);
704 fn test_total_ord_u8() {
705 let c = &[1u8, 2, 3];
706 assert_order!(Greater, &[1u8, 2, 3, 4][..], &c[..]);
707 let c = &[1u8, 2, 3, 4];
708 assert_order!(Less, &[1u8, 2, 3][..], &c[..]);
709 let c = &[1u8, 2, 3, 6];
710 assert_order!(Equal, &[1u8, 2, 3, 6][..], &c[..]);
711 let c = &[1u8, 2, 3, 4, 5, 6];
712 assert_order!(Less, &[1u8, 2, 3, 4, 5, 5, 5, 5][..], &c[..]);
713 let c = &[1u8, 2, 3, 4];
714 assert_order!(Greater, &[2u8, 2][..], &c[..]);
719 fn test_total_ord_i32() {
721 assert_order!(Greater, &[1, 2, 3, 4][..], &c[..]);
722 let c = &[1, 2, 3, 4];
723 assert_order!(Less, &[1, 2, 3][..], &c[..]);
724 let c = &[1, 2, 3, 6];
725 assert_order!(Equal, &[1, 2, 3, 6][..], &c[..]);
726 let c = &[1, 2, 3, 4, 5, 6];
727 assert_order!(Less, &[1, 2, 3, 4, 5, 5, 5, 5][..], &c[..]);
728 let c = &[1, 2, 3, 4];
729 assert_order!(Greater, &[2, 2][..], &c[..]);
734 let xs = [1, 2, 5, 10, 11];
735 let mut it = xs.iter();
736 assert_eq!(it.size_hint(), (5, Some(5)));
737 assert_eq!(it.next().unwrap(), &1);
738 assert_eq!(it.size_hint(), (4, Some(4)));
739 assert_eq!(it.next().unwrap(), &2);
740 assert_eq!(it.size_hint(), (3, Some(3)));
741 assert_eq!(it.next().unwrap(), &5);
742 assert_eq!(it.size_hint(), (2, Some(2)));
743 assert_eq!(it.next().unwrap(), &10);
744 assert_eq!(it.size_hint(), (1, Some(1)));
745 assert_eq!(it.next().unwrap(), &11);
746 assert_eq!(it.size_hint(), (0, Some(0)));
747 assert!(it.next().is_none());
751 fn test_iter_size_hints() {
752 let mut xs = [1, 2, 5, 10, 11];
753 assert_eq!(xs.iter().size_hint(), (5, Some(5)));
754 assert_eq!(xs.iter_mut().size_hint(), (5, Some(5)));
758 fn test_iter_as_slice() {
759 let xs = [1, 2, 5, 10, 11];
760 let mut iter = xs.iter();
761 assert_eq!(iter.as_slice(), &[1, 2, 5, 10, 11]);
763 assert_eq!(iter.as_slice(), &[2, 5, 10, 11]);
767 fn test_iter_as_ref() {
768 let xs = [1, 2, 5, 10, 11];
769 let mut iter = xs.iter();
770 assert_eq!(iter.as_ref(), &[1, 2, 5, 10, 11]);
772 assert_eq!(iter.as_ref(), &[2, 5, 10, 11]);
776 fn test_iter_clone() {
778 let mut it = xs.iter();
780 let mut jt = it.clone();
781 assert_eq!(it.next(), jt.next());
782 assert_eq!(it.next(), jt.next());
783 assert_eq!(it.next(), jt.next());
787 fn test_iter_is_empty() {
788 let xs = [1, 2, 5, 10, 11];
789 for i in 0..xs.len() {
790 for j in i..xs.len() {
791 assert_eq!(xs[i..j].iter().is_empty(), xs[i..j].is_empty());
797 fn test_mut_iterator() {
798 let mut xs = [1, 2, 3, 4, 5];
802 assert!(xs == [2, 3, 4, 5, 6])
806 fn test_rev_iterator() {
808 let xs = [1, 2, 5, 10, 11];
809 let ys = [11, 10, 5, 2, 1];
811 for &x in xs.iter().rev() {
812 assert_eq!(x, ys[i]);
819 fn test_mut_rev_iterator() {
820 let mut xs = [1, 2, 3, 4, 5];
821 for (i, x) in xs.iter_mut().rev().enumerate() {
824 assert!(xs == [5, 5, 5, 5, 5])
828 fn test_move_iterator() {
829 let xs = vec![1, 2, 3, 4, 5];
830 assert_eq!(xs.into_iter().fold(0, |a: usize, b: usize| 10 * a + b),
835 fn test_move_rev_iterator() {
836 let xs = vec![1, 2, 3, 4, 5];
837 assert_eq!(xs.into_iter().rev().fold(0, |a: usize, b: usize| 10 * a + b),
842 fn test_splitator() {
843 let xs = &[1, 2, 3, 4, 5];
845 let splits: &[&[_]] = &[&[1], &[3], &[5]];
846 assert_eq!(xs.split(|x| *x % 2 == 0).collect::<Vec<_>>(), splits);
847 let splits: &[&[_]] = &[&[], &[2, 3, 4, 5]];
848 assert_eq!(xs.split(|x| *x == 1).collect::<Vec<_>>(), splits);
849 let splits: &[&[_]] = &[&[1, 2, 3, 4], &[]];
850 assert_eq!(xs.split(|x| *x == 5).collect::<Vec<_>>(), splits);
851 let splits: &[&[_]] = &[&[1, 2, 3, 4, 5]];
852 assert_eq!(xs.split(|x| *x == 10).collect::<Vec<_>>(), splits);
853 let splits: &[&[_]] = &[&[], &[], &[], &[], &[], &[]];
854 assert_eq!(xs.split(|_| true).collect::<Vec<&[i32]>>(), splits);
856 let xs: &[i32] = &[];
857 let splits: &[&[i32]] = &[&[]];
858 assert_eq!(xs.split(|x| *x == 5).collect::<Vec<&[i32]>>(), splits);
862 fn test_splitnator() {
863 let xs = &[1, 2, 3, 4, 5];
865 let splits: &[&[_]] = &[&[1, 2, 3, 4, 5]];
866 assert_eq!(xs.splitn(1, |x| *x % 2 == 0).collect::<Vec<_>>(), splits);
867 let splits: &[&[_]] = &[&[1], &[3, 4, 5]];
868 assert_eq!(xs.splitn(2, |x| *x % 2 == 0).collect::<Vec<_>>(), splits);
869 let splits: &[&[_]] = &[&[], &[], &[], &[4, 5]];
870 assert_eq!(xs.splitn(4, |_| true).collect::<Vec<_>>(), splits);
872 let xs: &[i32] = &[];
873 let splits: &[&[i32]] = &[&[]];
874 assert_eq!(xs.splitn(2, |x| *x == 5).collect::<Vec<_>>(), splits);
878 fn test_splitnator_mut() {
879 let xs = &mut [1, 2, 3, 4, 5];
881 let splits: &[&mut [_]] = &[&mut [1, 2, 3, 4, 5]];
882 assert_eq!(xs.splitn_mut(1, |x| *x % 2 == 0).collect::<Vec<_>>(),
884 let splits: &[&mut [_]] = &[&mut [1], &mut [3, 4, 5]];
885 assert_eq!(xs.splitn_mut(2, |x| *x % 2 == 0).collect::<Vec<_>>(),
887 let splits: &[&mut [_]] = &[&mut [], &mut [], &mut [], &mut [4, 5]];
888 assert_eq!(xs.splitn_mut(4, |_| true).collect::<Vec<_>>(), splits);
890 let xs: &mut [i32] = &mut [];
891 let splits: &[&mut [i32]] = &[&mut []];
892 assert_eq!(xs.splitn_mut(2, |x| *x == 5).collect::<Vec<_>>(), splits);
896 fn test_rsplitator() {
897 let xs = &[1, 2, 3, 4, 5];
899 let splits: &[&[_]] = &[&[5], &[3], &[1]];
900 assert_eq!(xs.split(|x| *x % 2 == 0).rev().collect::<Vec<_>>(), splits);
901 let splits: &[&[_]] = &[&[2, 3, 4, 5], &[]];
902 assert_eq!(xs.split(|x| *x == 1).rev().collect::<Vec<_>>(), splits);
903 let splits: &[&[_]] = &[&[], &[1, 2, 3, 4]];
904 assert_eq!(xs.split(|x| *x == 5).rev().collect::<Vec<_>>(), splits);
905 let splits: &[&[_]] = &[&[1, 2, 3, 4, 5]];
906 assert_eq!(xs.split(|x| *x == 10).rev().collect::<Vec<_>>(), splits);
908 let xs: &[i32] = &[];
909 let splits: &[&[i32]] = &[&[]];
910 assert_eq!(xs.split(|x| *x == 5).rev().collect::<Vec<&[i32]>>(), splits);
914 fn test_rsplitnator() {
915 let xs = &[1, 2, 3, 4, 5];
917 let splits: &[&[_]] = &[&[1, 2, 3, 4, 5]];
918 assert_eq!(xs.rsplitn(1, |x| *x % 2 == 0).collect::<Vec<_>>(), splits);
919 let splits: &[&[_]] = &[&[5], &[1, 2, 3]];
920 assert_eq!(xs.rsplitn(2, |x| *x % 2 == 0).collect::<Vec<_>>(), splits);
921 let splits: &[&[_]] = &[&[], &[], &[], &[1, 2]];
922 assert_eq!(xs.rsplitn(4, |_| true).collect::<Vec<_>>(), splits);
924 let xs: &[i32] = &[];
925 let splits: &[&[i32]] = &[&[]];
926 assert_eq!(xs.rsplitn(2, |x| *x == 5).collect::<Vec<&[i32]>>(), splits);
927 assert!(xs.rsplitn(0, |x| *x % 2 == 0).next().is_none());
931 fn test_windowsator() {
932 let v = &[1, 2, 3, 4];
934 let wins: &[&[_]] = &[&[1, 2], &[2, 3], &[3, 4]];
935 assert_eq!(v.windows(2).collect::<Vec<_>>(), wins);
937 let wins: &[&[_]] = &[&[1, 2, 3], &[2, 3, 4]];
938 assert_eq!(v.windows(3).collect::<Vec<_>>(), wins);
939 assert!(v.windows(6).next().is_none());
941 let wins: &[&[_]] = &[&[3, 4], &[2, 3], &[1, 2]];
942 assert_eq!(v.windows(2).rev().collect::<Vec<&[_]>>(), wins);
947 fn test_windowsator_0() {
948 let v = &[1, 2, 3, 4];
949 let _it = v.windows(0);
953 fn test_chunksator() {
954 let v = &[1, 2, 3, 4, 5];
956 assert_eq!(v.chunks(2).len(), 3);
958 let chunks: &[&[_]] = &[&[1, 2], &[3, 4], &[5]];
959 assert_eq!(v.chunks(2).collect::<Vec<_>>(), chunks);
960 let chunks: &[&[_]] = &[&[1, 2, 3], &[4, 5]];
961 assert_eq!(v.chunks(3).collect::<Vec<_>>(), chunks);
962 let chunks: &[&[_]] = &[&[1, 2, 3, 4, 5]];
963 assert_eq!(v.chunks(6).collect::<Vec<_>>(), chunks);
965 let chunks: &[&[_]] = &[&[5], &[3, 4], &[1, 2]];
966 assert_eq!(v.chunks(2).rev().collect::<Vec<_>>(), chunks);
971 fn test_chunksator_0() {
972 let v = &[1, 2, 3, 4];
973 let _it = v.chunks(0);
977 fn test_chunks_exactator() {
978 let v = &[1, 2, 3, 4, 5];
980 assert_eq!(v.chunks_exact(2).len(), 2);
982 let chunks: &[&[_]] = &[&[1, 2], &[3, 4]];
983 assert_eq!(v.chunks_exact(2).collect::<Vec<_>>(), chunks);
984 let chunks: &[&[_]] = &[&[1, 2, 3]];
985 assert_eq!(v.chunks_exact(3).collect::<Vec<_>>(), chunks);
986 let chunks: &[&[_]] = &[];
987 assert_eq!(v.chunks_exact(6).collect::<Vec<_>>(), chunks);
989 let chunks: &[&[_]] = &[&[3, 4], &[1, 2]];
990 assert_eq!(v.chunks_exact(2).rev().collect::<Vec<_>>(), chunks);
995 fn test_chunks_exactator_0() {
996 let v = &[1, 2, 3, 4];
997 let _it = v.chunks_exact(0);
1001 fn test_rchunksator() {
1002 let v = &[1, 2, 3, 4, 5];
1004 assert_eq!(v.rchunks(2).len(), 3);
1006 let chunks: &[&[_]] = &[&[4, 5], &[2, 3], &[1]];
1007 assert_eq!(v.rchunks(2).collect::<Vec<_>>(), chunks);
1008 let chunks: &[&[_]] = &[&[3, 4, 5], &[1, 2]];
1009 assert_eq!(v.rchunks(3).collect::<Vec<_>>(), chunks);
1010 let chunks: &[&[_]] = &[&[1, 2, 3, 4, 5]];
1011 assert_eq!(v.rchunks(6).collect::<Vec<_>>(), chunks);
1013 let chunks: &[&[_]] = &[&[1], &[2, 3], &[4, 5]];
1014 assert_eq!(v.rchunks(2).rev().collect::<Vec<_>>(), chunks);
1019 fn test_rchunksator_0() {
1020 let v = &[1, 2, 3, 4];
1021 let _it = v.rchunks(0);
1025 fn test_rchunks_exactator() {
1026 let v = &[1, 2, 3, 4, 5];
1028 assert_eq!(v.rchunks_exact(2).len(), 2);
1030 let chunks: &[&[_]] = &[&[4, 5], &[2, 3]];
1031 assert_eq!(v.rchunks_exact(2).collect::<Vec<_>>(), chunks);
1032 let chunks: &[&[_]] = &[&[3, 4, 5]];
1033 assert_eq!(v.rchunks_exact(3).collect::<Vec<_>>(), chunks);
1034 let chunks: &[&[_]] = &[];
1035 assert_eq!(v.rchunks_exact(6).collect::<Vec<_>>(), chunks);
1037 let chunks: &[&[_]] = &[&[2, 3], &[4, 5]];
1038 assert_eq!(v.rchunks_exact(2).rev().collect::<Vec<_>>(), chunks);
1043 fn test_rchunks_exactator_0() {
1044 let v = &[1, 2, 3, 4];
1045 let _it = v.rchunks_exact(0);
1049 fn test_reverse_part() {
1050 let mut values = [1, 2, 3, 4, 5];
1051 values[1..4].reverse();
1052 assert!(values == [1, 4, 3, 2, 5]);
1057 macro_rules! test_show_vec {
1058 ($x:expr, $x_str:expr) => ({
1059 let (x, x_str) = ($x, $x_str);
1060 assert_eq!(format!("{:?}", x), x_str);
1061 assert_eq!(format!("{:?}", x), x_str);
1064 let empty = Vec::<i32>::new();
1065 test_show_vec!(empty, "[]");
1066 test_show_vec!(vec![1], "[1]");
1067 test_show_vec!(vec![1, 2, 3], "[1, 2, 3]");
1068 test_show_vec!(vec![vec![], vec![1], vec![1, 1]], "[[], [1], [1, 1]]");
1070 let empty_mut: &mut [i32] = &mut [];
1071 test_show_vec!(empty_mut, "[]");
1073 test_show_vec!(v, "[1]");
1074 let v = &mut [1, 2, 3];
1075 test_show_vec!(v, "[1, 2, 3]");
1076 let v: &mut [&mut [_]] = &mut [&mut [], &mut [1], &mut [1, 1]];
1077 test_show_vec!(v, "[[], [1], [1, 1]]");
1081 fn test_vec_default() {
1084 let v: $ty = Default::default();
1085 assert!(v.is_empty());
1095 fn test_overflow_does_not_cause_segfault() {
1097 v.reserve_exact(!0);
1104 fn test_overflow_does_not_cause_segfault_managed() {
1105 let mut v = vec![Rc::new(1)];
1106 v.reserve_exact(!0);
1111 fn test_mut_split_at() {
1112 let mut values = [1, 2, 3, 4, 5];
1114 let (left, right) = values.split_at_mut(2);
1116 let left: &[_] = left;
1117 assert!(left[..left.len()] == [1, 2]);
1124 let right: &[_] = right;
1125 assert!(right[..right.len()] == [3, 4, 5]);
1132 assert!(values == [2, 3, 5, 6, 7]);
1135 #[derive(Clone, PartialEq)]
1139 fn test_iter_zero_sized() {
1140 let mut v = vec![Foo, Foo, Foo];
1141 assert_eq!(v.len(), 3);
1166 assert_eq!(cnt, 11);
1168 let xs: [Foo; 3] = [Foo, Foo, Foo];
1178 fn test_shrink_to_fit() {
1179 let mut xs = vec![0, 1, 2, 3];
1183 assert_eq!(xs.capacity(), 128);
1185 assert_eq!(xs.capacity(), 100);
1186 assert_eq!(xs, (0..100).collect::<Vec<_>>());
1190 fn test_starts_with() {
1191 assert!(b"foobar".starts_with(b"foo"));
1192 assert!(!b"foobar".starts_with(b"oob"));
1193 assert!(!b"foobar".starts_with(b"bar"));
1194 assert!(!b"foo".starts_with(b"foobar"));
1195 assert!(!b"bar".starts_with(b"foobar"));
1196 assert!(b"foobar".starts_with(b"foobar"));
1197 let empty: &[u8] = &[];
1198 assert!(empty.starts_with(empty));
1199 assert!(!empty.starts_with(b"foo"));
1200 assert!(b"foobar".starts_with(empty));
1204 fn test_ends_with() {
1205 assert!(b"foobar".ends_with(b"bar"));
1206 assert!(!b"foobar".ends_with(b"oba"));
1207 assert!(!b"foobar".ends_with(b"foo"));
1208 assert!(!b"foo".ends_with(b"foobar"));
1209 assert!(!b"bar".ends_with(b"foobar"));
1210 assert!(b"foobar".ends_with(b"foobar"));
1211 let empty: &[u8] = &[];
1212 assert!(empty.ends_with(empty));
1213 assert!(!empty.ends_with(b"foo"));
1214 assert!(b"foobar".ends_with(empty));
1218 fn test_mut_splitator() {
1219 let mut xs = [0, 1, 0, 2, 3, 0, 0, 4, 5, 0];
1220 assert_eq!(xs.split_mut(|x| *x == 0).count(), 6);
1221 for slice in xs.split_mut(|x| *x == 0) {
1224 assert!(xs == [0, 1, 0, 3, 2, 0, 0, 5, 4, 0]);
1226 let mut xs = [0, 1, 0, 2, 3, 0, 0, 4, 5, 0, 6, 7];
1227 for slice in xs.split_mut(|x| *x == 0).take(5) {
1230 assert!(xs == [0, 1, 0, 3, 2, 0, 0, 5, 4, 0, 6, 7]);
1234 fn test_mut_splitator_rev() {
1235 let mut xs = [1, 2, 0, 3, 4, 0, 0, 5, 6, 0];
1236 for slice in xs.split_mut(|x| *x == 0).rev().take(4) {
1239 assert!(xs == [1, 2, 0, 4, 3, 0, 0, 6, 5, 0]);
1244 let mut v = [0, 1, 2];
1245 assert_eq!(v.get_mut(3), None);
1246 v.get_mut(1).map(|e| *e = 7);
1247 assert_eq!(v[1], 7);
1249 assert_eq!(v.get_mut(2), Some(&mut x));
1253 fn test_mut_chunks() {
1254 let mut v = [0, 1, 2, 3, 4, 5, 6];
1255 assert_eq!(v.chunks_mut(3).len(), 3);
1256 for (i, chunk) in v.chunks_mut(3).enumerate() {
1261 let result = [0, 0, 0, 1, 1, 1, 2];
1262 assert_eq!(v, result);
1266 fn test_mut_chunks_rev() {
1267 let mut v = [0, 1, 2, 3, 4, 5, 6];
1268 for (i, chunk) in v.chunks_mut(3).rev().enumerate() {
1273 let result = [2, 2, 2, 1, 1, 1, 0];
1274 assert_eq!(v, result);
1279 fn test_mut_chunks_0() {
1280 let mut v = [1, 2, 3, 4];
1281 let _it = v.chunks_mut(0);
1285 fn test_mut_chunks_exact() {
1286 let mut v = [0, 1, 2, 3, 4, 5, 6];
1287 assert_eq!(v.chunks_exact_mut(3).len(), 2);
1288 for (i, chunk) in v.chunks_exact_mut(3).enumerate() {
1293 let result = [0, 0, 0, 1, 1, 1, 6];
1294 assert_eq!(v, result);
1298 fn test_mut_chunks_exact_rev() {
1299 let mut v = [0, 1, 2, 3, 4, 5, 6];
1300 for (i, chunk) in v.chunks_exact_mut(3).rev().enumerate() {
1305 let result = [1, 1, 1, 0, 0, 0, 6];
1306 assert_eq!(v, result);
1311 fn test_mut_chunks_exact_0() {
1312 let mut v = [1, 2, 3, 4];
1313 let _it = v.chunks_exact_mut(0);
1317 fn test_mut_rchunks() {
1318 let mut v = [0, 1, 2, 3, 4, 5, 6];
1319 assert_eq!(v.rchunks_mut(3).len(), 3);
1320 for (i, chunk) in v.rchunks_mut(3).enumerate() {
1325 let result = [2, 1, 1, 1, 0, 0, 0];
1326 assert_eq!(v, result);
1330 fn test_mut_rchunks_rev() {
1331 let mut v = [0, 1, 2, 3, 4, 5, 6];
1332 for (i, chunk) in v.rchunks_mut(3).rev().enumerate() {
1337 let result = [0, 1, 1, 1, 2, 2, 2];
1338 assert_eq!(v, result);
1343 fn test_mut_rchunks_0() {
1344 let mut v = [1, 2, 3, 4];
1345 let _it = v.rchunks_mut(0);
1349 fn test_mut_rchunks_exact() {
1350 let mut v = [0, 1, 2, 3, 4, 5, 6];
1351 assert_eq!(v.rchunks_exact_mut(3).len(), 2);
1352 for (i, chunk) in v.rchunks_exact_mut(3).enumerate() {
1357 let result = [0, 1, 1, 1, 0, 0, 0];
1358 assert_eq!(v, result);
1362 fn test_mut_rchunks_exact_rev() {
1363 let mut v = [0, 1, 2, 3, 4, 5, 6];
1364 for (i, chunk) in v.rchunks_exact_mut(3).rev().enumerate() {
1369 let result = [0, 0, 0, 0, 1, 1, 1];
1370 assert_eq!(v, result);
1375 fn test_mut_rchunks_exact_0() {
1376 let mut v = [1, 2, 3, 4];
1377 let _it = v.rchunks_exact_mut(0);
1381 fn test_mut_last() {
1382 let mut x = [1, 2, 3, 4, 5];
1383 let h = x.last_mut();
1384 assert_eq!(*h.unwrap(), 5);
1386 let y: &mut [i32] = &mut [];
1387 assert!(y.last_mut().is_none());
1392 let xs: Box<_> = box [1, 2, 3];
1393 let ys = xs.to_vec();
1394 assert_eq!(ys, [1, 2, 3]);
1398 fn test_box_slice_clone() {
1399 let data = vec![vec![0, 1], vec![0], vec![1]];
1400 let data2 = data.clone().into_boxed_slice().clone().to_vec();
1402 assert_eq!(data, data2);
1406 #[allow(unused_must_use)] // here, we care about the side effects of `.clone()`
1407 #[cfg_attr(target_os = "emscripten", ignore)]
1408 #[cfg(not(miri))] // Miri does not support catching panics
1409 fn test_box_slice_clone_panics() {
1411 use std::sync::atomic::{AtomicUsize, Ordering};
1414 count: Arc<AtomicUsize>,
1418 impl Drop for Canary {
1419 fn drop(&mut self) {
1420 self.count.fetch_add(1, Ordering::SeqCst);
1424 impl Clone for Canary {
1425 fn clone(&self) -> Self {
1431 count: self.count.clone(),
1432 panics: self.panics,
1437 let drop_count = Arc::new(AtomicUsize::new(0));
1438 let canary = Canary {
1439 count: drop_count.clone(),
1442 let panic = Canary {
1443 count: drop_count.clone(),
1447 std::panic::catch_unwind(move || {
1448 // When xs is dropped, +5.
1449 let xs = vec![canary.clone(), canary.clone(), canary.clone(), panic, canary]
1450 .into_boxed_slice();
1452 // When panic is cloned, +3.
1458 assert_eq!(drop_count.load(Ordering::SeqCst), 8);
1462 fn test_copy_from_slice() {
1463 let src = [0, 1, 2, 3, 4, 5];
1464 let mut dst = [0; 6];
1465 dst.copy_from_slice(&src);
1466 assert_eq!(src, dst)
1470 #[should_panic(expected = "destination and source slices have different lengths")]
1471 fn test_copy_from_slice_dst_longer() {
1472 let src = [0, 1, 2, 3];
1473 let mut dst = [0; 5];
1474 dst.copy_from_slice(&src);
1478 #[should_panic(expected = "destination and source slices have different lengths")]
1479 fn test_copy_from_slice_dst_shorter() {
1480 let src = [0, 1, 2, 3];
1481 let mut dst = [0; 3];
1482 dst.copy_from_slice(&src);
1485 const MAX_LEN: usize = 80;
1487 static DROP_COUNTS: [AtomicUsize; MAX_LEN] = [
1488 // FIXME(RFC 1109): AtomicUsize is not Copy.
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),
1500 AtomicUsize::new(0), AtomicUsize::new(0), AtomicUsize::new(0), AtomicUsize::new(0),
1501 AtomicUsize::new(0), AtomicUsize::new(0), AtomicUsize::new(0), AtomicUsize::new(0),
1502 AtomicUsize::new(0), AtomicUsize::new(0), AtomicUsize::new(0), AtomicUsize::new(0),
1503 AtomicUsize::new(0), AtomicUsize::new(0), AtomicUsize::new(0), AtomicUsize::new(0),
1504 AtomicUsize::new(0), AtomicUsize::new(0), AtomicUsize::new(0), AtomicUsize::new(0),
1505 AtomicUsize::new(0), AtomicUsize::new(0), AtomicUsize::new(0), AtomicUsize::new(0),
1506 AtomicUsize::new(0), AtomicUsize::new(0), AtomicUsize::new(0), AtomicUsize::new(0),
1507 AtomicUsize::new(0), AtomicUsize::new(0), AtomicUsize::new(0), AtomicUsize::new(0),
1508 AtomicUsize::new(0), AtomicUsize::new(0), AtomicUsize::new(0), AtomicUsize::new(0),
1511 static VERSIONS: AtomicUsize = AtomicUsize::new(0);
1513 #[derive(Clone, Eq)]
1514 struct DropCounter {
1517 version: Cell<usize>,
1520 impl PartialEq for DropCounter {
1521 fn eq(&self, other: &Self) -> bool {
1522 self.partial_cmp(other) == Some(Ordering::Equal)
1526 impl PartialOrd for DropCounter {
1527 fn partial_cmp(&self, other: &Self) -> Option<Ordering> {
1528 self.version.set(self.version.get() + 1);
1529 other.version.set(other.version.get() + 1);
1530 VERSIONS.fetch_add(2, Relaxed);
1531 self.x.partial_cmp(&other.x)
1535 impl Ord for DropCounter {
1536 fn cmp(&self, other: &Self) -> Ordering {
1537 self.partial_cmp(other).unwrap()
1541 impl Drop for DropCounter {
1542 fn drop(&mut self) {
1543 DROP_COUNTS[self.id].fetch_add(1, Relaxed);
1544 VERSIONS.fetch_sub(self.version.get(), Relaxed);
1549 ($input:ident, $func:ident) => {
1550 let len = $input.len();
1552 // Work out the total number of comparisons required to sort
1554 let mut count = 0usize;
1555 $input.to_owned().$func(|a, b| { count += 1; a.cmp(b) });
1557 // ... and then panic on each and every single one.
1558 for panic_countdown in 0..count {
1559 // Refresh the counters.
1560 VERSIONS.store(0, Relaxed);
1562 DROP_COUNTS[i].store(0, Relaxed);
1565 let v = $input.to_owned();
1566 let _ = std::panic::catch_unwind(move || {
1568 let mut panic_countdown = panic_countdown;
1570 if panic_countdown == 0 {
1571 SILENCE_PANIC.with(|s| s.set(true));
1574 panic_countdown -= 1;
1579 // Check that the number of things dropped is exactly
1580 // what we expect (i.e., the contents of `v`).
1581 for (i, c) in DROP_COUNTS.iter().enumerate().take(len) {
1582 let count = c.load(Relaxed);
1584 "found drop count == {} for i == {}, len == {}",
1588 // Check that the most recent versions of values were dropped.
1589 assert_eq!(VERSIONS.load(Relaxed), 0);
1594 thread_local!(static SILENCE_PANIC: Cell<bool> = Cell::new(false));
1597 #[cfg_attr(target_os = "emscripten", ignore)] // no threads
1598 #[cfg(not(miri))] // Miri does not support catching panics
1600 let prev = panic::take_hook();
1601 panic::set_hook(Box::new(move |info| {
1602 if !SILENCE_PANIC.with(|s| s.get()) {
1607 let mut rng = thread_rng();
1609 for len in (1..20).chain(70..MAX_LEN) {
1610 for &modulus in &[5, 20, 50] {
1611 for &has_runs in &[false, true] {
1612 let mut input = (0..len)
1615 x: rng.next_u32() % modulus,
1617 version: Cell::new(0),
1620 .collect::<Vec<_>>();
1623 for c in &mut input {
1628 let a = rng.gen::<usize>() % len;
1629 let b = rng.gen::<usize>() % len;
1631 input[a..b].reverse();
1638 test!(input, sort_by);
1639 test!(input, sort_unstable_by);
1646 fn repeat_generic_slice() {
1647 assert_eq!([1, 2].repeat(2), vec![1, 2, 1, 2]);
1648 assert_eq!([1, 2, 3, 4].repeat(0), vec![]);
1649 assert_eq!([1, 2, 3, 4].repeat(1), vec![1, 2, 3, 4]);
1651 [1, 2, 3, 4].repeat(3),
1652 vec![1, 2, 3, 4, 1, 2, 3, 4, 1, 2, 3, 4]