1 // Copyright 2012-2015 The Rust Project Developers. See the COPYRIGHT
2 // file at the top-level directory of this distribution and at
3 // http://rust-lang.org/COPYRIGHT.
5 // Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or
6 // http://www.apache.org/licenses/LICENSE-2.0> or the MIT license
7 // <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your
8 // option. This file may not be copied, modified, or distributed
9 // except according to those terms.
12 use std::cmp::Ordering::{Equal, Greater, Less};
13 use std::cmp::Ordering;
17 use std::sync::atomic::Ordering::Relaxed;
18 use std::sync::atomic::{ATOMIC_USIZE_INIT, AtomicUsize};
21 use rand::{Rng, thread_rng};
23 fn square(n: usize) -> usize {
27 fn is_odd(n: &usize) -> bool {
33 // Test on-stack from_fn.
34 let mut v: Vec<_> = (0..3).map(square).collect();
37 assert_eq!(v.len(), 3);
43 // Test on-heap from_fn.
44 v = (0..5).map(square).collect();
47 assert_eq!(v.len(), 5);
58 // Test on-stack from_elem.
59 let mut v = vec![10, 10];
62 assert_eq!(v.len(), 2);
67 // Test on-heap from_elem.
82 let xs: [i32; 0] = [];
83 assert!(xs.is_empty());
84 assert!(![0].is_empty());
88 fn test_len_divzero() {
92 let v2: &[Z] = &[[], []];
93 assert_eq!(mem::size_of::<Z>(), 0);
94 assert_eq!(v0.len(), 0);
95 assert_eq!(v1.len(), 1);
96 assert_eq!(v2.len(), 2);
101 let mut a = vec![11];
102 assert_eq!(a.get(1), None);
104 assert_eq!(a.get(1).unwrap(), &12);
105 a = vec![11, 12, 13];
106 assert_eq!(a.get(1).unwrap(), &12);
112 assert_eq!(a.first(), None);
114 assert_eq!(a.first().unwrap(), &11);
116 assert_eq!(a.first().unwrap(), &11);
120 fn test_first_mut() {
122 assert_eq!(a.first_mut(), None);
124 assert_eq!(*a.first_mut().unwrap(), 11);
126 assert_eq!(*a.first_mut().unwrap(), 11);
130 fn test_split_first() {
131 let mut a = vec![11];
133 assert!(b.split_first().is_none());
134 assert_eq!(a.split_first(), Some((&11, b)));
136 let b: &[i32] = &[12];
137 assert_eq!(a.split_first(), Some((&11, b)));
141 fn test_split_first_mut() {
142 let mut a = vec![11];
143 let b: &mut [i32] = &mut [];
144 assert!(b.split_first_mut().is_none());
145 assert!(a.split_first_mut() == Some((&mut 11, b)));
147 let b: &mut [_] = &mut [12];
148 assert!(a.split_first_mut() == Some((&mut 11, b)));
152 fn test_split_last() {
153 let mut a = vec![11];
155 assert!(b.split_last().is_none());
156 assert_eq!(a.split_last(), Some((&11, b)));
159 assert_eq!(a.split_last(), Some((&12, b)));
163 fn test_split_last_mut() {
164 let mut a = vec![11];
165 let b: &mut [i32] = &mut [];
166 assert!(b.split_last_mut().is_none());
167 assert!(a.split_last_mut() == Some((&mut 11, b)));
170 let b: &mut [_] = &mut [11];
171 assert!(a.split_last_mut() == Some((&mut 12, b)));
177 assert_eq!(a.last(), None);
179 assert_eq!(a.last().unwrap(), &11);
181 assert_eq!(a.last().unwrap(), &12);
187 assert_eq!(a.last_mut(), None);
189 assert_eq!(*a.last_mut().unwrap(), 11);
191 assert_eq!(*a.last_mut().unwrap(), 12);
196 // Test fixed length vector.
197 let vec_fixed = [1, 2, 3, 4];
198 let v_a = vec_fixed[1..vec_fixed.len()].to_vec();
199 assert_eq!(v_a.len(), 3);
201 assert_eq!(v_a[0], 2);
202 assert_eq!(v_a[1], 3);
203 assert_eq!(v_a[2], 4);
206 let vec_stack: &[_] = &[1, 2, 3];
207 let v_b = vec_stack[1..3].to_vec();
208 assert_eq!(v_b.len(), 2);
210 assert_eq!(v_b[0], 2);
211 assert_eq!(v_b[1], 3);
214 let vec_unique = vec![1, 2, 3, 4, 5, 6];
215 let v_d = vec_unique[1..6].to_vec();
216 assert_eq!(v_d.len(), 5);
218 assert_eq!(v_d[0], 2);
219 assert_eq!(v_d[1], 3);
220 assert_eq!(v_d[2], 4);
221 assert_eq!(v_d[3], 5);
222 assert_eq!(v_d[4], 6);
226 fn test_slice_from() {
227 let vec: &[_] = &[1, 2, 3, 4];
228 assert_eq!(&vec[..], vec);
229 let b: &[_] = &[3, 4];
230 assert_eq!(&vec[2..], b);
232 assert_eq!(&vec[4..], b);
237 let vec: &[_] = &[1, 2, 3, 4];
238 assert_eq!(&vec[..4], vec);
239 let b: &[_] = &[1, 2];
240 assert_eq!(&vec[..2], b);
242 assert_eq!(&vec[..0], b);
250 assert_eq!(v.len(), 0);
251 assert_eq!(e, Some(5));
259 fn test_swap_remove() {
260 let mut v = vec![1, 2, 3, 4, 5];
261 let mut e = v.swap_remove(0);
263 assert_eq!(v, [5, 2, 3, 4]);
264 e = v.swap_remove(3);
266 assert_eq!(v, [5, 2, 3]);
271 fn test_swap_remove_fail() {
273 let _ = v.swap_remove(0);
274 let _ = v.swap_remove(0);
278 fn test_swap_remove_noncopyable() {
279 // Tests that we don't accidentally run destructors twice.
280 let mut v: Vec<Box<_>> = Vec::new();
284 let mut _e = v.swap_remove(0);
285 assert_eq!(v.len(), 2);
286 _e = v.swap_remove(1);
287 assert_eq!(v.len(), 1);
288 _e = v.swap_remove(0);
289 assert_eq!(v.len(), 0);
294 // Test on-stack push().
297 assert_eq!(v.len(), 1);
300 // Test on-heap push().
302 assert_eq!(v.len(), 2);
309 let mut v: Vec<Box<_>> = vec![box 6, box 5, box 4];
312 assert_eq!(v.len(), 1);
313 assert_eq!(*(v[0]), 6);
314 // If the unsafe block didn't drop things properly, we blow up here.
319 let mut v: Vec<Box<_>> = vec![box 6, box 5, box 4];
321 assert_eq!(v.len(), 0);
322 // If the unsafe block didn't drop things properly, we blow up here.
327 let mut v = vec![1, 2, 3, 4, 5];
329 assert_eq!(v, [1, 3, 5]);
333 fn test_binary_search() {
334 assert_eq!([1, 2, 3, 4, 5].binary_search(&5).ok(), Some(4));
335 assert_eq!([1, 2, 3, 4, 5].binary_search(&4).ok(), Some(3));
336 assert_eq!([1, 2, 3, 4, 5].binary_search(&3).ok(), Some(2));
337 assert_eq!([1, 2, 3, 4, 5].binary_search(&2).ok(), Some(1));
338 assert_eq!([1, 2, 3, 4, 5].binary_search(&1).ok(), Some(0));
340 assert_eq!([2, 4, 6, 8, 10].binary_search(&1).ok(), None);
341 assert_eq!([2, 4, 6, 8, 10].binary_search(&5).ok(), None);
342 assert_eq!([2, 4, 6, 8, 10].binary_search(&4).ok(), Some(1));
343 assert_eq!([2, 4, 6, 8, 10].binary_search(&10).ok(), Some(4));
345 assert_eq!([2, 4, 6, 8].binary_search(&1).ok(), None);
346 assert_eq!([2, 4, 6, 8].binary_search(&5).ok(), None);
347 assert_eq!([2, 4, 6, 8].binary_search(&4).ok(), Some(1));
348 assert_eq!([2, 4, 6, 8].binary_search(&8).ok(), Some(3));
350 assert_eq!([2, 4, 6].binary_search(&1).ok(), None);
351 assert_eq!([2, 4, 6].binary_search(&5).ok(), None);
352 assert_eq!([2, 4, 6].binary_search(&4).ok(), Some(1));
353 assert_eq!([2, 4, 6].binary_search(&6).ok(), Some(2));
355 assert_eq!([2, 4].binary_search(&1).ok(), None);
356 assert_eq!([2, 4].binary_search(&5).ok(), None);
357 assert_eq!([2, 4].binary_search(&2).ok(), Some(0));
358 assert_eq!([2, 4].binary_search(&4).ok(), Some(1));
360 assert_eq!([2].binary_search(&1).ok(), None);
361 assert_eq!([2].binary_search(&5).ok(), None);
362 assert_eq!([2].binary_search(&2).ok(), Some(0));
364 assert_eq!([].binary_search(&1).ok(), None);
365 assert_eq!([].binary_search(&5).ok(), None);
367 assert!([1, 1, 1, 1, 1].binary_search(&1).ok() != None);
368 assert!([1, 1, 1, 1, 2].binary_search(&1).ok() != None);
369 assert!([1, 1, 1, 2, 2].binary_search(&1).ok() != None);
370 assert!([1, 1, 2, 2, 2].binary_search(&1).ok() != None);
371 assert_eq!([1, 2, 2, 2, 2].binary_search(&1).ok(), Some(0));
373 assert_eq!([1, 2, 3, 4, 5].binary_search(&6).ok(), None);
374 assert_eq!([1, 2, 3, 4, 5].binary_search(&0).ok(), None);
379 let mut v = vec![10, 20];
380 assert_eq!(v[0], 10);
381 assert_eq!(v[1], 20);
383 assert_eq!(v[0], 20);
384 assert_eq!(v[1], 10);
386 let mut v3 = Vec::<i32>::new();
388 assert!(v3.is_empty());
390 // check the 1-byte-types path
391 let mut v = (-50..51i8).collect::<Vec<_>>();
393 assert_eq!(v, (-50..51i8).rev().collect::<Vec<_>>());
395 // check the 2-byte-types path
396 let mut v = (-50..51i16).collect::<Vec<_>>();
398 assert_eq!(v, (-50..51i16).rev().collect::<Vec<_>>());
403 let mut rng = thread_rng();
405 for len in (2..25).chain(500..510) {
406 for &modulus in &[5, 10, 100, 1000] {
408 let orig: Vec<_> = rng.gen_iter::<i32>()
409 .map(|x| x % modulus)
413 // Sort in default order.
414 let mut v = orig.clone();
416 assert!(v.windows(2).all(|w| w[0] <= w[1]));
418 // Sort in ascending order.
419 let mut v = orig.clone();
420 v.sort_by(|a, b| a.cmp(b));
421 assert!(v.windows(2).all(|w| w[0] <= w[1]));
423 // Sort in descending order.
424 let mut v = orig.clone();
425 v.sort_by(|a, b| b.cmp(a));
426 assert!(v.windows(2).all(|w| w[0] >= w[1]));
428 // Sort in lexicographic order.
429 let mut v1 = orig.clone();
430 let mut v2 = orig.clone();
431 v1.sort_by_key(|x| x.to_string());
432 v2.sort_by_cached_key(|x| x.to_string());
433 assert!(v1.windows(2).all(|w| w[0].to_string() <= w[1].to_string()));
436 // Sort with many pre-sorted runs.
437 let mut v = orig.clone();
441 let a = rng.gen::<usize>() % len;
442 let b = rng.gen::<usize>() % len;
450 assert!(v.windows(2).all(|w| w[0] <= w[1]));
455 // Sort using a completely random comparison function.
456 // This will reorder the elements *somehow*, but won't panic.
457 let mut v = [0; 500];
458 for i in 0..v.len() {
461 v.sort_by(|_, _| *rng.choose(&[Less, Equal, Greater]).unwrap());
463 for i in 0..v.len() {
464 assert_eq!(v[i], i as i32);
472 let mut v = [0xDEADBEEFu64];
474 assert!(v == [0xDEADBEEF]);
478 fn test_sort_stability() {
479 for len in (2..25).chain(500..510) {
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 mut 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_exact_chunksator() {
978 let v = &[1, 2, 3, 4, 5];
980 assert_eq!(v.exact_chunks(2).len(), 2);
982 let chunks: &[&[_]] = &[&[1, 2], &[3, 4]];
983 assert_eq!(v.exact_chunks(2).collect::<Vec<_>>(), chunks);
984 let chunks: &[&[_]] = &[&[1, 2, 3]];
985 assert_eq!(v.exact_chunks(3).collect::<Vec<_>>(), chunks);
986 let chunks: &[&[_]] = &[];
987 assert_eq!(v.exact_chunks(6).collect::<Vec<_>>(), chunks);
989 let chunks: &[&[_]] = &[&[3, 4], &[1, 2]];
990 assert_eq!(v.exact_chunks(2).rev().collect::<Vec<_>>(), chunks);
995 fn test_exact_chunksator_0() {
996 let v = &[1, 2, 3, 4];
997 let _it = v.exact_chunks(0);
1001 fn test_reverse_part() {
1002 let mut values = [1, 2, 3, 4, 5];
1003 values[1..4].reverse();
1004 assert!(values == [1, 4, 3, 2, 5]);
1009 macro_rules! test_show_vec {
1010 ($x:expr, $x_str:expr) => ({
1011 let (x, x_str) = ($x, $x_str);
1012 assert_eq!(format!("{:?}", x), x_str);
1013 assert_eq!(format!("{:?}", x), x_str);
1016 let empty = Vec::<i32>::new();
1017 test_show_vec!(empty, "[]");
1018 test_show_vec!(vec![1], "[1]");
1019 test_show_vec!(vec![1, 2, 3], "[1, 2, 3]");
1020 test_show_vec!(vec![vec![], vec![1], vec![1, 1]], "[[], [1], [1, 1]]");
1022 let empty_mut: &mut [i32] = &mut [];
1023 test_show_vec!(empty_mut, "[]");
1025 test_show_vec!(v, "[1]");
1026 let v = &mut [1, 2, 3];
1027 test_show_vec!(v, "[1, 2, 3]");
1028 let v: &mut [&mut [_]] = &mut [&mut [], &mut [1], &mut [1, 1]];
1029 test_show_vec!(v, "[[], [1], [1, 1]]");
1033 fn test_vec_default() {
1036 let v: $ty = Default::default();
1037 assert!(v.is_empty());
1047 fn test_overflow_does_not_cause_segfault() {
1049 v.reserve_exact(!0);
1056 fn test_overflow_does_not_cause_segfault_managed() {
1057 let mut v = vec![Rc::new(1)];
1058 v.reserve_exact(!0);
1063 fn test_mut_split_at() {
1064 let mut values = [1, 2, 3, 4, 5];
1066 let (left, right) = values.split_at_mut(2);
1068 let left: &[_] = left;
1069 assert!(left[..left.len()] == [1, 2]);
1076 let right: &[_] = right;
1077 assert!(right[..right.len()] == [3, 4, 5]);
1084 assert!(values == [2, 3, 5, 6, 7]);
1087 #[derive(Clone, PartialEq)]
1091 fn test_iter_zero_sized() {
1092 let mut v = vec![Foo, Foo, Foo];
1093 assert_eq!(v.len(), 3);
1118 assert_eq!(cnt, 11);
1120 let xs: [Foo; 3] = [Foo, Foo, Foo];
1130 fn test_shrink_to_fit() {
1131 let mut xs = vec![0, 1, 2, 3];
1135 assert_eq!(xs.capacity(), 128);
1137 assert_eq!(xs.capacity(), 100);
1138 assert_eq!(xs, (0..100).collect::<Vec<_>>());
1142 fn test_starts_with() {
1143 assert!(b"foobar".starts_with(b"foo"));
1144 assert!(!b"foobar".starts_with(b"oob"));
1145 assert!(!b"foobar".starts_with(b"bar"));
1146 assert!(!b"foo".starts_with(b"foobar"));
1147 assert!(!b"bar".starts_with(b"foobar"));
1148 assert!(b"foobar".starts_with(b"foobar"));
1149 let empty: &[u8] = &[];
1150 assert!(empty.starts_with(empty));
1151 assert!(!empty.starts_with(b"foo"));
1152 assert!(b"foobar".starts_with(empty));
1156 fn test_ends_with() {
1157 assert!(b"foobar".ends_with(b"bar"));
1158 assert!(!b"foobar".ends_with(b"oba"));
1159 assert!(!b"foobar".ends_with(b"foo"));
1160 assert!(!b"foo".ends_with(b"foobar"));
1161 assert!(!b"bar".ends_with(b"foobar"));
1162 assert!(b"foobar".ends_with(b"foobar"));
1163 let empty: &[u8] = &[];
1164 assert!(empty.ends_with(empty));
1165 assert!(!empty.ends_with(b"foo"));
1166 assert!(b"foobar".ends_with(empty));
1170 fn test_mut_splitator() {
1171 let mut xs = [0, 1, 0, 2, 3, 0, 0, 4, 5, 0];
1172 assert_eq!(xs.split_mut(|x| *x == 0).count(), 6);
1173 for slice in xs.split_mut(|x| *x == 0) {
1176 assert!(xs == [0, 1, 0, 3, 2, 0, 0, 5, 4, 0]);
1178 let mut xs = [0, 1, 0, 2, 3, 0, 0, 4, 5, 0, 6, 7];
1179 for slice in xs.split_mut(|x| *x == 0).take(5) {
1182 assert!(xs == [0, 1, 0, 3, 2, 0, 0, 5, 4, 0, 6, 7]);
1186 fn test_mut_splitator_rev() {
1187 let mut xs = [1, 2, 0, 3, 4, 0, 0, 5, 6, 0];
1188 for slice in xs.split_mut(|x| *x == 0).rev().take(4) {
1191 assert!(xs == [1, 2, 0, 4, 3, 0, 0, 6, 5, 0]);
1196 let mut v = [0, 1, 2];
1197 assert_eq!(v.get_mut(3), None);
1198 v.get_mut(1).map(|e| *e = 7);
1199 assert_eq!(v[1], 7);
1201 assert_eq!(v.get_mut(2), Some(&mut x));
1205 fn test_mut_chunks() {
1206 let mut v = [0, 1, 2, 3, 4, 5, 6];
1207 assert_eq!(v.chunks_mut(2).len(), 4);
1208 for (i, chunk) in v.chunks_mut(3).enumerate() {
1213 let result = [0, 0, 0, 1, 1, 1, 2];
1214 assert_eq!(v, result);
1218 fn test_mut_chunks_rev() {
1219 let mut v = [0, 1, 2, 3, 4, 5, 6];
1220 for (i, chunk) in v.chunks_mut(3).rev().enumerate() {
1225 let result = [2, 2, 2, 1, 1, 1, 0];
1226 assert_eq!(v, result);
1231 fn test_mut_chunks_0() {
1232 let mut v = [1, 2, 3, 4];
1233 let _it = v.chunks_mut(0);
1237 fn test_mut_exact_chunks() {
1238 let mut v = [0, 1, 2, 3, 4, 5, 6];
1239 assert_eq!(v.exact_chunks_mut(2).len(), 3);
1240 for (i, chunk) in v.exact_chunks_mut(3).enumerate() {
1245 let result = [0, 0, 0, 1, 1, 1, 6];
1246 assert_eq!(v, result);
1250 fn test_mut_exact_chunks_rev() {
1251 let mut v = [0, 1, 2, 3, 4, 5, 6];
1252 for (i, chunk) in v.exact_chunks_mut(3).rev().enumerate() {
1257 let result = [1, 1, 1, 0, 0, 0, 6];
1258 assert_eq!(v, result);
1263 fn test_mut_exact_chunks_0() {
1264 let mut v = [1, 2, 3, 4];
1265 let _it = v.exact_chunks_mut(0);
1269 fn test_mut_last() {
1270 let mut x = [1, 2, 3, 4, 5];
1271 let h = x.last_mut();
1272 assert_eq!(*h.unwrap(), 5);
1274 let y: &mut [i32] = &mut [];
1275 assert!(y.last_mut().is_none());
1280 let xs: Box<_> = box [1, 2, 3];
1281 let ys = xs.to_vec();
1282 assert_eq!(ys, [1, 2, 3]);
1286 fn test_box_slice_clone() {
1287 let data = vec![vec![0, 1], vec![0], vec![1]];
1288 let data2 = data.clone().into_boxed_slice().clone().to_vec();
1290 assert_eq!(data, data2);
1294 #[allow(unused_must_use)] // here, we care about the side effects of `.clone()`
1295 #[cfg_attr(target_os = "emscripten", ignore)]
1296 fn test_box_slice_clone_panics() {
1298 use std::sync::atomic::{AtomicUsize, Ordering};
1299 use std::thread::spawn;
1302 count: Arc<AtomicUsize>,
1306 impl Drop for Canary {
1307 fn drop(&mut self) {
1308 self.count.fetch_add(1, Ordering::SeqCst);
1312 impl Clone for Canary {
1313 fn clone(&self) -> Self {
1319 count: self.count.clone(),
1320 panics: self.panics,
1325 let drop_count = Arc::new(AtomicUsize::new(0));
1326 let canary = Canary {
1327 count: drop_count.clone(),
1330 let panic = Canary {
1331 count: drop_count.clone(),
1336 // When xs is dropped, +5.
1337 let xs = vec![canary.clone(), canary.clone(), canary.clone(), panic, canary]
1338 .into_boxed_slice();
1340 // When panic is cloned, +3.
1347 assert_eq!(drop_count.load(Ordering::SeqCst), 8);
1351 fn test_copy_from_slice() {
1352 let src = [0, 1, 2, 3, 4, 5];
1353 let mut dst = [0; 6];
1354 dst.copy_from_slice(&src);
1355 assert_eq!(src, dst)
1359 #[should_panic(expected = "destination and source slices have different lengths")]
1360 fn test_copy_from_slice_dst_longer() {
1361 let src = [0, 1, 2, 3];
1362 let mut dst = [0; 5];
1363 dst.copy_from_slice(&src);
1367 #[should_panic(expected = "destination and source slices have different lengths")]
1368 fn test_copy_from_slice_dst_shorter() {
1369 let src = [0, 1, 2, 3];
1370 let mut dst = [0; 3];
1371 dst.copy_from_slice(&src);
1374 const MAX_LEN: usize = 80;
1376 static DROP_COUNTS: [AtomicUsize; MAX_LEN] = [
1377 // FIXME(RFC 1109): AtomicUsize is not Copy.
1378 AtomicUsize::new(0), AtomicUsize::new(0), AtomicUsize::new(0), AtomicUsize::new(0),
1379 AtomicUsize::new(0), AtomicUsize::new(0), AtomicUsize::new(0), AtomicUsize::new(0),
1380 AtomicUsize::new(0), AtomicUsize::new(0), AtomicUsize::new(0), AtomicUsize::new(0),
1381 AtomicUsize::new(0), AtomicUsize::new(0), AtomicUsize::new(0), AtomicUsize::new(0),
1382 AtomicUsize::new(0), AtomicUsize::new(0), AtomicUsize::new(0), AtomicUsize::new(0),
1383 AtomicUsize::new(0), AtomicUsize::new(0), AtomicUsize::new(0), AtomicUsize::new(0),
1384 AtomicUsize::new(0), AtomicUsize::new(0), AtomicUsize::new(0), AtomicUsize::new(0),
1385 AtomicUsize::new(0), AtomicUsize::new(0), AtomicUsize::new(0), AtomicUsize::new(0),
1386 AtomicUsize::new(0), AtomicUsize::new(0), AtomicUsize::new(0), AtomicUsize::new(0),
1387 AtomicUsize::new(0), AtomicUsize::new(0), AtomicUsize::new(0), AtomicUsize::new(0),
1388 AtomicUsize::new(0), AtomicUsize::new(0), AtomicUsize::new(0), AtomicUsize::new(0),
1389 AtomicUsize::new(0), AtomicUsize::new(0), AtomicUsize::new(0), AtomicUsize::new(0),
1390 AtomicUsize::new(0), AtomicUsize::new(0), AtomicUsize::new(0), AtomicUsize::new(0),
1391 AtomicUsize::new(0), AtomicUsize::new(0), AtomicUsize::new(0), AtomicUsize::new(0),
1392 AtomicUsize::new(0), AtomicUsize::new(0), AtomicUsize::new(0), AtomicUsize::new(0),
1393 AtomicUsize::new(0), AtomicUsize::new(0), AtomicUsize::new(0), AtomicUsize::new(0),
1394 AtomicUsize::new(0), AtomicUsize::new(0), AtomicUsize::new(0), AtomicUsize::new(0),
1395 AtomicUsize::new(0), AtomicUsize::new(0), AtomicUsize::new(0), AtomicUsize::new(0),
1396 AtomicUsize::new(0), AtomicUsize::new(0), AtomicUsize::new(0), AtomicUsize::new(0),
1397 AtomicUsize::new(0), AtomicUsize::new(0), AtomicUsize::new(0), AtomicUsize::new(0),
1400 static VERSIONS: AtomicUsize = ATOMIC_USIZE_INIT;
1402 #[derive(Clone, Eq)]
1403 struct DropCounter {
1406 version: Cell<usize>,
1409 impl PartialEq for DropCounter {
1410 fn eq(&self, other: &Self) -> bool {
1411 self.partial_cmp(other) == Some(Ordering::Equal)
1415 impl PartialOrd for DropCounter {
1416 fn partial_cmp(&self, other: &Self) -> Option<Ordering> {
1417 self.version.set(self.version.get() + 1);
1418 other.version.set(other.version.get() + 1);
1419 VERSIONS.fetch_add(2, Relaxed);
1420 self.x.partial_cmp(&other.x)
1424 impl Ord for DropCounter {
1425 fn cmp(&self, other: &Self) -> Ordering {
1426 self.partial_cmp(other).unwrap()
1430 impl Drop for DropCounter {
1431 fn drop(&mut self) {
1432 DROP_COUNTS[self.id].fetch_add(1, Relaxed);
1433 VERSIONS.fetch_sub(self.version.get(), Relaxed);
1438 ($input:ident, $func:ident) => {
1439 let len = $input.len();
1441 // Work out the total number of comparisons required to sort
1443 let mut count = 0usize;
1444 $input.to_owned().$func(|a, b| { count += 1; a.cmp(b) });
1446 // ... and then panic on each and every single one.
1447 for panic_countdown in 0..count {
1448 // Refresh the counters.
1449 VERSIONS.store(0, Relaxed);
1451 DROP_COUNTS[i].store(0, Relaxed);
1454 let v = $input.to_owned();
1455 let _ = thread::spawn(move || {
1457 let mut panic_countdown = panic_countdown;
1459 if panic_countdown == 0 {
1460 SILENCE_PANIC.with(|s| s.set(true));
1463 panic_countdown -= 1;
1468 // Check that the number of things dropped is exactly
1469 // what we expect (i.e. the contents of `v`).
1470 for (i, c) in DROP_COUNTS.iter().enumerate().take(len) {
1471 let count = c.load(Relaxed);
1473 "found drop count == {} for i == {}, len == {}",
1477 // Check that the most recent versions of values were dropped.
1478 assert_eq!(VERSIONS.load(Relaxed), 0);
1483 thread_local!(static SILENCE_PANIC: Cell<bool> = Cell::new(false));
1486 #[cfg_attr(target_os = "emscripten", ignore)] // no threads
1488 let prev = panic::take_hook();
1489 panic::set_hook(Box::new(move |info| {
1490 if !SILENCE_PANIC.with(|s| s.get()) {
1495 let mut rng = thread_rng();
1497 for len in (1..20).chain(70..MAX_LEN) {
1498 for &modulus in &[5, 20, 50] {
1499 for &has_runs in &[false, true] {
1500 let mut input = (0..len)
1503 x: rng.next_u32() % modulus,
1505 version: Cell::new(0),
1508 .collect::<Vec<_>>();
1511 for c in &mut input {
1516 let a = rng.gen::<usize>() % len;
1517 let b = rng.gen::<usize>() % len;
1519 input[a..b].reverse();
1526 test!(input, sort_by);
1527 test!(input, sort_unstable_by);