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.
11 use std::cmp::Ordering::{Equal, Greater, Less};
15 use rand::{Rng, thread_rng};
17 fn square(n: usize) -> usize {
21 fn is_odd(n: &usize) -> bool {
27 // Test on-stack from_fn.
28 let mut v: Vec<_> = (0..3).map(square).collect();
31 assert_eq!(v.len(), 3);
37 // Test on-heap from_fn.
38 v = (0..5).map(square).collect();
41 assert_eq!(v.len(), 5);
52 // Test on-stack from_elem.
53 let mut v = vec![10, 10];
56 assert_eq!(v.len(), 2);
61 // Test on-heap from_elem.
76 let xs: [i32; 0] = [];
77 assert!(xs.is_empty());
78 assert!(![0].is_empty());
82 fn test_len_divzero() {
86 let v2: &[Z] = &[[], []];
87 assert_eq!(mem::size_of::<Z>(), 0);
88 assert_eq!(v0.len(), 0);
89 assert_eq!(v1.len(), 1);
90 assert_eq!(v2.len(), 2);
96 assert_eq!(a.get(1), None);
98 assert_eq!(a.get(1).unwrap(), &12);
100 assert_eq!(a.get(1).unwrap(), &12);
106 assert_eq!(a.first(), None);
108 assert_eq!(a.first().unwrap(), &11);
110 assert_eq!(a.first().unwrap(), &11);
114 fn test_first_mut() {
116 assert_eq!(a.first_mut(), None);
118 assert_eq!(*a.first_mut().unwrap(), 11);
120 assert_eq!(*a.first_mut().unwrap(), 11);
124 fn test_split_first() {
125 let mut a = vec![11];
127 assert!(b.split_first().is_none());
128 assert_eq!(a.split_first(), Some((&11, b)));
130 let b: &[i32] = &[12];
131 assert_eq!(a.split_first(), Some((&11, b)));
135 fn test_split_first_mut() {
136 let mut a = vec![11];
137 let b: &mut [i32] = &mut [];
138 assert!(b.split_first_mut().is_none());
139 assert!(a.split_first_mut() == Some((&mut 11, b)));
141 let b: &mut [_] = &mut [12];
142 assert!(a.split_first_mut() == Some((&mut 11, b)));
146 fn test_split_last() {
147 let mut a = vec![11];
149 assert!(b.split_last().is_none());
150 assert_eq!(a.split_last(), Some((&11, b)));
153 assert_eq!(a.split_last(), Some((&12, b)));
157 fn test_split_last_mut() {
158 let mut a = vec![11];
159 let b: &mut [i32] = &mut [];
160 assert!(b.split_last_mut().is_none());
161 assert!(a.split_last_mut() == Some((&mut 11, b)));
164 let b: &mut [_] = &mut [11];
165 assert!(a.split_last_mut() == Some((&mut 12, b)));
171 assert_eq!(a.last(), None);
173 assert_eq!(a.last().unwrap(), &11);
175 assert_eq!(a.last().unwrap(), &12);
181 assert_eq!(a.last_mut(), None);
183 assert_eq!(*a.last_mut().unwrap(), 11);
185 assert_eq!(*a.last_mut().unwrap(), 12);
190 // Test fixed length vector.
191 let vec_fixed = [1, 2, 3, 4];
192 let v_a = vec_fixed[1..vec_fixed.len()].to_vec();
193 assert_eq!(v_a.len(), 3);
195 assert_eq!(v_a[0], 2);
196 assert_eq!(v_a[1], 3);
197 assert_eq!(v_a[2], 4);
200 let vec_stack: &[_] = &[1, 2, 3];
201 let v_b = vec_stack[1..3].to_vec();
202 assert_eq!(v_b.len(), 2);
204 assert_eq!(v_b[0], 2);
205 assert_eq!(v_b[1], 3);
208 let vec_unique = vec![1, 2, 3, 4, 5, 6];
209 let v_d = vec_unique[1..6].to_vec();
210 assert_eq!(v_d.len(), 5);
212 assert_eq!(v_d[0], 2);
213 assert_eq!(v_d[1], 3);
214 assert_eq!(v_d[2], 4);
215 assert_eq!(v_d[3], 5);
216 assert_eq!(v_d[4], 6);
220 fn test_slice_from() {
221 let vec: &[_] = &[1, 2, 3, 4];
222 assert_eq!(&vec[..], vec);
223 let b: &[_] = &[3, 4];
224 assert_eq!(&vec[2..], b);
226 assert_eq!(&vec[4..], b);
231 let vec: &[_] = &[1, 2, 3, 4];
232 assert_eq!(&vec[..4], vec);
233 let b: &[_] = &[1, 2];
234 assert_eq!(&vec[..2], b);
236 assert_eq!(&vec[..0], b);
244 assert_eq!(v.len(), 0);
245 assert_eq!(e, Some(5));
253 fn test_swap_remove() {
254 let mut v = vec![1, 2, 3, 4, 5];
255 let mut e = v.swap_remove(0);
257 assert_eq!(v, [5, 2, 3, 4]);
258 e = v.swap_remove(3);
260 assert_eq!(v, [5, 2, 3]);
265 fn test_swap_remove_fail() {
267 let _ = v.swap_remove(0);
268 let _ = v.swap_remove(0);
272 fn test_swap_remove_noncopyable() {
273 // Tests that we don't accidentally run destructors twice.
274 let mut v: Vec<Box<_>> = Vec::new();
278 let mut _e = v.swap_remove(0);
279 assert_eq!(v.len(), 2);
280 _e = v.swap_remove(1);
281 assert_eq!(v.len(), 1);
282 _e = v.swap_remove(0);
283 assert_eq!(v.len(), 0);
288 // Test on-stack push().
291 assert_eq!(v.len(), 1);
294 // Test on-heap push().
296 assert_eq!(v.len(), 2);
303 let mut v: Vec<Box<_>> = vec![box 6, box 5, box 4];
306 assert_eq!(v.len(), 1);
307 assert_eq!(*(v[0]), 6);
308 // If the unsafe block didn't drop things properly, we blow up here.
313 let mut v: Vec<Box<_>> = vec![box 6, box 5, box 4];
315 assert_eq!(v.len(), 0);
316 // If the unsafe block didn't drop things properly, we blow up here.
321 let mut v = vec![1, 2, 3, 4, 5];
323 assert_eq!(v, [1, 3, 5]);
327 fn test_binary_search() {
328 assert_eq!([1, 2, 3, 4, 5].binary_search(&5).ok(), Some(4));
329 assert_eq!([1, 2, 3, 4, 5].binary_search(&4).ok(), Some(3));
330 assert_eq!([1, 2, 3, 4, 5].binary_search(&3).ok(), Some(2));
331 assert_eq!([1, 2, 3, 4, 5].binary_search(&2).ok(), Some(1));
332 assert_eq!([1, 2, 3, 4, 5].binary_search(&1).ok(), Some(0));
334 assert_eq!([2, 4, 6, 8, 10].binary_search(&1).ok(), None);
335 assert_eq!([2, 4, 6, 8, 10].binary_search(&5).ok(), None);
336 assert_eq!([2, 4, 6, 8, 10].binary_search(&4).ok(), Some(1));
337 assert_eq!([2, 4, 6, 8, 10].binary_search(&10).ok(), Some(4));
339 assert_eq!([2, 4, 6, 8].binary_search(&1).ok(), None);
340 assert_eq!([2, 4, 6, 8].binary_search(&5).ok(), None);
341 assert_eq!([2, 4, 6, 8].binary_search(&4).ok(), Some(1));
342 assert_eq!([2, 4, 6, 8].binary_search(&8).ok(), Some(3));
344 assert_eq!([2, 4, 6].binary_search(&1).ok(), None);
345 assert_eq!([2, 4, 6].binary_search(&5).ok(), None);
346 assert_eq!([2, 4, 6].binary_search(&4).ok(), Some(1));
347 assert_eq!([2, 4, 6].binary_search(&6).ok(), Some(2));
349 assert_eq!([2, 4].binary_search(&1).ok(), None);
350 assert_eq!([2, 4].binary_search(&5).ok(), None);
351 assert_eq!([2, 4].binary_search(&2).ok(), Some(0));
352 assert_eq!([2, 4].binary_search(&4).ok(), Some(1));
354 assert_eq!([2].binary_search(&1).ok(), None);
355 assert_eq!([2].binary_search(&5).ok(), None);
356 assert_eq!([2].binary_search(&2).ok(), Some(0));
358 assert_eq!([].binary_search(&1).ok(), None);
359 assert_eq!([].binary_search(&5).ok(), None);
361 assert!([1, 1, 1, 1, 1].binary_search(&1).ok() != None);
362 assert!([1, 1, 1, 1, 2].binary_search(&1).ok() != None);
363 assert!([1, 1, 1, 2, 2].binary_search(&1).ok() != None);
364 assert!([1, 1, 2, 2, 2].binary_search(&1).ok() != None);
365 assert_eq!([1, 2, 2, 2, 2].binary_search(&1).ok(), Some(0));
367 assert_eq!([1, 2, 3, 4, 5].binary_search(&6).ok(), None);
368 assert_eq!([1, 2, 3, 4, 5].binary_search(&0).ok(), None);
373 let mut v = vec![10, 20];
374 assert_eq!(v[0], 10);
375 assert_eq!(v[1], 20);
377 assert_eq!(v[0], 20);
378 assert_eq!(v[1], 10);
380 let mut v3 = Vec::<i32>::new();
382 assert!(v3.is_empty());
384 // check the 1-byte-types path
385 let mut v = (-50..51i8).collect::<Vec<_>>();
387 assert_eq!(v, (-50..51i8).rev().collect::<Vec<_>>());
389 // check the 2-byte-types path
390 let mut v = (-50..51i16).collect::<Vec<_>>();
392 assert_eq!(v, (-50..51i16).rev().collect::<Vec<_>>());
397 let mut rng = thread_rng();
399 for len in (2..25).chain(500..510) {
400 for &modulus in &[5, 10, 100, 1000] {
402 let orig: Vec<_> = rng.gen_iter::<i32>()
403 .map(|x| x % modulus)
407 // Sort in default order.
408 let mut v = orig.clone();
410 assert!(v.windows(2).all(|w| w[0] <= w[1]));
412 // Sort in ascending order.
413 let mut v = orig.clone();
414 v.sort_by(|a, b| a.cmp(b));
415 assert!(v.windows(2).all(|w| w[0] <= w[1]));
417 // Sort in descending order.
418 let mut v = orig.clone();
419 v.sort_by(|a, b| b.cmp(a));
420 assert!(v.windows(2).all(|w| w[0] >= w[1]));
422 // Sort with many pre-sorted runs.
423 let mut v = orig.clone();
427 let a = rng.gen::<usize>() % len;
428 let b = rng.gen::<usize>() % len;
436 assert!(v.windows(2).all(|w| w[0] <= w[1]));
441 // Sort using a completely random comparison function.
442 // This will reorder the elements *somehow*, but won't panic.
443 let mut v = [0; 500];
444 for i in 0..v.len() {
447 v.sort_by(|_, _| *rng.choose(&[Less, Equal, Greater]).unwrap());
449 for i in 0..v.len() {
450 assert_eq!(v[i], i as i32);
458 let mut v = [0xDEADBEEFu64];
460 assert!(v == [0xDEADBEEF]);
464 fn test_sort_stability() {
465 for len in (2..25).chain(500..510) {
467 let mut counts = [0; 10];
469 // create a vector like [(6, 1), (5, 1), (6, 2), ...],
470 // where the first item of each tuple is random, but
471 // the second item represents which occurrence of that
472 // number this element is, i.e. the second elements
473 // will occur in sorted order.
474 let mut v: Vec<_> = (0..len)
476 let n = thread_rng().gen::<usize>() % 10;
482 // only sort on the first element, so an unstable sort
483 // may mix up the counts.
484 v.sort_by(|&(a, _), &(b, _)| a.cmp(&b));
486 // this comparison includes the count (the second item
487 // of the tuple), so elements with equal first items
488 // will need to be ordered with increasing
489 // counts... i.e. exactly asserting that this sort is
491 assert!(v.windows(2).all(|w| w[0] <= w[1]));
498 let expected: Vec<_> = (0..13).collect();
499 let mut v = Vec::new();
502 v.clone_from(&expected);
504 assert_eq!(v, expected);
505 v.rotate(expected.len());
506 assert_eq!(v, expected);
507 let mut zst_array = [(), (), ()];
511 v = (5..13).chain(0..5).collect();
513 assert_eq!(v, expected);
515 let expected: Vec<_> = (0..1000).collect();
517 // small rotations in large slice, uses ptr::copy
518 v = (2..1000).chain(0..2).collect();
520 assert_eq!(v, expected);
521 v = (998..1000).chain(0..998).collect();
523 assert_eq!(v, expected);
525 // non-small prime rotation, has a few rounds of swapping
526 v = (389..1000).chain(0..389).collect();
528 assert_eq!(v, expected);
533 let v: [Vec<i32>; 0] = [];
536 let d = [vec![1], vec![2, 3]].concat();
537 assert_eq!(d, [1, 2, 3]);
539 let v: &[&[_]] = &[&[1], &[2, 3]];
540 assert_eq!(v.join(&0), [1, 0, 2, 3]);
541 let v: &[&[_]] = &[&[1], &[2], &[3]];
542 assert_eq!(v.join(&0), [1, 0, 2, 0, 3]);
547 let v: [Vec<i32>; 0] = [];
548 assert_eq!(v.join(&0), []);
549 assert_eq!([vec![1], vec![2, 3]].join(&0), [1, 0, 2, 3]);
550 assert_eq!([vec![1], vec![2], vec![3]].join(&0), [1, 0, 2, 0, 3]);
552 let v: [&[_]; 2] = [&[1], &[2, 3]];
553 assert_eq!(v.join(&0), [1, 0, 2, 3]);
554 let v: [&[_]; 3] = [&[1], &[2], &[3]];
555 assert_eq!(v.join(&0), [1, 0, 2, 0, 3]);
560 let mut a = vec![1, 2, 4];
562 assert_eq!(a, [1, 2, 3, 4]);
564 let mut a = vec![1, 2, 3];
566 assert_eq!(a, [0, 1, 2, 3]);
568 let mut a = vec![1, 2, 3];
570 assert_eq!(a, [1, 2, 3, 4]);
579 fn test_insert_oob() {
580 let mut a = vec![1, 2, 3];
586 let mut a = vec![1, 2, 3, 4];
588 assert_eq!(a.remove(2), 3);
589 assert_eq!(a, [1, 2, 4]);
591 assert_eq!(a.remove(2), 4);
592 assert_eq!(a, [1, 2]);
594 assert_eq!(a.remove(0), 1);
597 assert_eq!(a.remove(0), 2);
603 fn test_remove_fail() {
613 assert!(v.capacity() >= 11);
618 let v = vec![1, 2, 3, 4, 5];
620 assert_eq!(v.len(), 2);
625 macro_rules! assert_order {
626 (Greater, $a:expr, $b:expr) => {
627 assert_eq!($a.cmp($b), Greater);
630 (Less, $a:expr, $b:expr) => {
631 assert_eq!($a.cmp($b), Less);
634 (Equal, $a:expr, $b:expr) => {
635 assert_eq!($a.cmp($b), Equal);
641 fn test_total_ord_u8() {
642 let c = &[1u8, 2, 3];
643 assert_order!(Greater, &[1u8, 2, 3, 4][..], &c[..]);
644 let c = &[1u8, 2, 3, 4];
645 assert_order!(Less, &[1u8, 2, 3][..], &c[..]);
646 let c = &[1u8, 2, 3, 6];
647 assert_order!(Equal, &[1u8, 2, 3, 6][..], &c[..]);
648 let c = &[1u8, 2, 3, 4, 5, 6];
649 assert_order!(Less, &[1u8, 2, 3, 4, 5, 5, 5, 5][..], &c[..]);
650 let c = &[1u8, 2, 3, 4];
651 assert_order!(Greater, &[2u8, 2][..], &c[..]);
656 fn test_total_ord_i32() {
658 assert_order!(Greater, &[1, 2, 3, 4][..], &c[..]);
659 let c = &[1, 2, 3, 4];
660 assert_order!(Less, &[1, 2, 3][..], &c[..]);
661 let c = &[1, 2, 3, 6];
662 assert_order!(Equal, &[1, 2, 3, 6][..], &c[..]);
663 let c = &[1, 2, 3, 4, 5, 6];
664 assert_order!(Less, &[1, 2, 3, 4, 5, 5, 5, 5][..], &c[..]);
665 let c = &[1, 2, 3, 4];
666 assert_order!(Greater, &[2, 2][..], &c[..]);
671 let xs = [1, 2, 5, 10, 11];
672 let mut it = xs.iter();
673 assert_eq!(it.size_hint(), (5, Some(5)));
674 assert_eq!(it.next().unwrap(), &1);
675 assert_eq!(it.size_hint(), (4, Some(4)));
676 assert_eq!(it.next().unwrap(), &2);
677 assert_eq!(it.size_hint(), (3, Some(3)));
678 assert_eq!(it.next().unwrap(), &5);
679 assert_eq!(it.size_hint(), (2, Some(2)));
680 assert_eq!(it.next().unwrap(), &10);
681 assert_eq!(it.size_hint(), (1, Some(1)));
682 assert_eq!(it.next().unwrap(), &11);
683 assert_eq!(it.size_hint(), (0, Some(0)));
684 assert!(it.next().is_none());
688 fn test_iter_size_hints() {
689 let mut xs = [1, 2, 5, 10, 11];
690 assert_eq!(xs.iter().size_hint(), (5, Some(5)));
691 assert_eq!(xs.iter_mut().size_hint(), (5, Some(5)));
695 fn test_iter_as_slice() {
696 let xs = [1, 2, 5, 10, 11];
697 let mut iter = xs.iter();
698 assert_eq!(iter.as_slice(), &[1, 2, 5, 10, 11]);
700 assert_eq!(iter.as_slice(), &[2, 5, 10, 11]);
704 fn test_iter_as_ref() {
705 let xs = [1, 2, 5, 10, 11];
706 let mut iter = xs.iter();
707 assert_eq!(iter.as_ref(), &[1, 2, 5, 10, 11]);
709 assert_eq!(iter.as_ref(), &[2, 5, 10, 11]);
713 fn test_iter_clone() {
715 let mut it = xs.iter();
717 let mut jt = it.clone();
718 assert_eq!(it.next(), jt.next());
719 assert_eq!(it.next(), jt.next());
720 assert_eq!(it.next(), jt.next());
724 fn test_iter_is_empty() {
725 let xs = [1, 2, 5, 10, 11];
726 for i in 0..xs.len() {
727 for j in i..xs.len() {
728 assert_eq!(xs[i..j].iter().is_empty(), xs[i..j].is_empty());
734 fn test_mut_iterator() {
735 let mut xs = [1, 2, 3, 4, 5];
739 assert!(xs == [2, 3, 4, 5, 6])
743 fn test_rev_iterator() {
745 let xs = [1, 2, 5, 10, 11];
746 let ys = [11, 10, 5, 2, 1];
748 for &x in xs.iter().rev() {
749 assert_eq!(x, ys[i]);
756 fn test_mut_rev_iterator() {
757 let mut xs = [1, 2, 3, 4, 5];
758 for (i, x) in xs.iter_mut().rev().enumerate() {
761 assert!(xs == [5, 5, 5, 5, 5])
765 fn test_move_iterator() {
766 let xs = vec![1, 2, 3, 4, 5];
767 assert_eq!(xs.into_iter().fold(0, |a: usize, b: usize| 10 * a + b),
772 fn test_move_rev_iterator() {
773 let xs = vec![1, 2, 3, 4, 5];
774 assert_eq!(xs.into_iter().rev().fold(0, |a: usize, b: usize| 10 * a + b),
779 fn test_splitator() {
780 let xs = &[1, 2, 3, 4, 5];
782 let splits: &[&[_]] = &[&[1], &[3], &[5]];
783 assert_eq!(xs.split(|x| *x % 2 == 0).collect::<Vec<_>>(), splits);
784 let splits: &[&[_]] = &[&[], &[2, 3, 4, 5]];
785 assert_eq!(xs.split(|x| *x == 1).collect::<Vec<_>>(), splits);
786 let splits: &[&[_]] = &[&[1, 2, 3, 4], &[]];
787 assert_eq!(xs.split(|x| *x == 5).collect::<Vec<_>>(), splits);
788 let splits: &[&[_]] = &[&[1, 2, 3, 4, 5]];
789 assert_eq!(xs.split(|x| *x == 10).collect::<Vec<_>>(), splits);
790 let splits: &[&[_]] = &[&[], &[], &[], &[], &[], &[]];
791 assert_eq!(xs.split(|_| true).collect::<Vec<&[i32]>>(), splits);
793 let xs: &[i32] = &[];
794 let splits: &[&[i32]] = &[&[]];
795 assert_eq!(xs.split(|x| *x == 5).collect::<Vec<&[i32]>>(), splits);
799 fn test_splitnator() {
800 let xs = &[1, 2, 3, 4, 5];
802 let splits: &[&[_]] = &[&[1, 2, 3, 4, 5]];
803 assert_eq!(xs.splitn(1, |x| *x % 2 == 0).collect::<Vec<_>>(), splits);
804 let splits: &[&[_]] = &[&[1], &[3, 4, 5]];
805 assert_eq!(xs.splitn(2, |x| *x % 2 == 0).collect::<Vec<_>>(), splits);
806 let splits: &[&[_]] = &[&[], &[], &[], &[4, 5]];
807 assert_eq!(xs.splitn(4, |_| true).collect::<Vec<_>>(), splits);
809 let xs: &[i32] = &[];
810 let splits: &[&[i32]] = &[&[]];
811 assert_eq!(xs.splitn(2, |x| *x == 5).collect::<Vec<_>>(), splits);
815 fn test_splitnator_mut() {
816 let xs = &mut [1, 2, 3, 4, 5];
818 let splits: &[&mut [_]] = &[&mut [1, 2, 3, 4, 5]];
819 assert_eq!(xs.splitn_mut(1, |x| *x % 2 == 0).collect::<Vec<_>>(),
821 let splits: &[&mut [_]] = &[&mut [1], &mut [3, 4, 5]];
822 assert_eq!(xs.splitn_mut(2, |x| *x % 2 == 0).collect::<Vec<_>>(),
824 let splits: &[&mut [_]] = &[&mut [], &mut [], &mut [], &mut [4, 5]];
825 assert_eq!(xs.splitn_mut(4, |_| true).collect::<Vec<_>>(), splits);
827 let xs: &mut [i32] = &mut [];
828 let splits: &[&mut [i32]] = &[&mut []];
829 assert_eq!(xs.splitn_mut(2, |x| *x == 5).collect::<Vec<_>>(), splits);
833 fn test_rsplitator() {
834 let xs = &[1, 2, 3, 4, 5];
836 let splits: &[&[_]] = &[&[5], &[3], &[1]];
837 assert_eq!(xs.split(|x| *x % 2 == 0).rev().collect::<Vec<_>>(), splits);
838 let splits: &[&[_]] = &[&[2, 3, 4, 5], &[]];
839 assert_eq!(xs.split(|x| *x == 1).rev().collect::<Vec<_>>(), splits);
840 let splits: &[&[_]] = &[&[], &[1, 2, 3, 4]];
841 assert_eq!(xs.split(|x| *x == 5).rev().collect::<Vec<_>>(), splits);
842 let splits: &[&[_]] = &[&[1, 2, 3, 4, 5]];
843 assert_eq!(xs.split(|x| *x == 10).rev().collect::<Vec<_>>(), splits);
845 let xs: &[i32] = &[];
846 let splits: &[&[i32]] = &[&[]];
847 assert_eq!(xs.split(|x| *x == 5).rev().collect::<Vec<&[i32]>>(), splits);
851 fn test_rsplitnator() {
852 let xs = &[1, 2, 3, 4, 5];
854 let splits: &[&[_]] = &[&[1, 2, 3, 4, 5]];
855 assert_eq!(xs.rsplitn(1, |x| *x % 2 == 0).collect::<Vec<_>>(), splits);
856 let splits: &[&[_]] = &[&[5], &[1, 2, 3]];
857 assert_eq!(xs.rsplitn(2, |x| *x % 2 == 0).collect::<Vec<_>>(), splits);
858 let splits: &[&[_]] = &[&[], &[], &[], &[1, 2]];
859 assert_eq!(xs.rsplitn(4, |_| true).collect::<Vec<_>>(), splits);
861 let xs: &[i32] = &[];
862 let splits: &[&[i32]] = &[&[]];
863 assert_eq!(xs.rsplitn(2, |x| *x == 5).collect::<Vec<&[i32]>>(), splits);
864 assert!(xs.rsplitn(0, |x| *x % 2 == 0).next().is_none());
868 fn test_windowsator() {
869 let v = &[1, 2, 3, 4];
871 let wins: &[&[_]] = &[&[1, 2], &[2, 3], &[3, 4]];
872 assert_eq!(v.windows(2).collect::<Vec<_>>(), wins);
874 let wins: &[&[_]] = &[&[1, 2, 3], &[2, 3, 4]];
875 assert_eq!(v.windows(3).collect::<Vec<_>>(), wins);
876 assert!(v.windows(6).next().is_none());
878 let wins: &[&[_]] = &[&[3, 4], &[2, 3], &[1, 2]];
879 assert_eq!(v.windows(2).rev().collect::<Vec<&[_]>>(), wins);
884 fn test_windowsator_0() {
885 let v = &[1, 2, 3, 4];
886 let _it = v.windows(0);
890 fn test_chunksator() {
891 let v = &[1, 2, 3, 4, 5];
893 assert_eq!(v.chunks(2).len(), 3);
895 let chunks: &[&[_]] = &[&[1, 2], &[3, 4], &[5]];
896 assert_eq!(v.chunks(2).collect::<Vec<_>>(), chunks);
897 let chunks: &[&[_]] = &[&[1, 2, 3], &[4, 5]];
898 assert_eq!(v.chunks(3).collect::<Vec<_>>(), chunks);
899 let chunks: &[&[_]] = &[&[1, 2, 3, 4, 5]];
900 assert_eq!(v.chunks(6).collect::<Vec<_>>(), chunks);
902 let chunks: &[&[_]] = &[&[5], &[3, 4], &[1, 2]];
903 assert_eq!(v.chunks(2).rev().collect::<Vec<_>>(), chunks);
908 fn test_chunksator_0() {
909 let v = &[1, 2, 3, 4];
910 let _it = v.chunks(0);
914 fn test_reverse_part() {
915 let mut values = [1, 2, 3, 4, 5];
916 values[1..4].reverse();
917 assert!(values == [1, 4, 3, 2, 5]);
922 macro_rules! test_show_vec {
923 ($x:expr, $x_str:expr) => ({
924 let (x, x_str) = ($x, $x_str);
925 assert_eq!(format!("{:?}", x), x_str);
926 assert_eq!(format!("{:?}", x), x_str);
929 let empty = Vec::<i32>::new();
930 test_show_vec!(empty, "[]");
931 test_show_vec!(vec![1], "[1]");
932 test_show_vec!(vec![1, 2, 3], "[1, 2, 3]");
933 test_show_vec!(vec![vec![], vec![1], vec![1, 1]], "[[], [1], [1, 1]]");
935 let empty_mut: &mut [i32] = &mut [];
936 test_show_vec!(empty_mut, "[]");
938 test_show_vec!(v, "[1]");
939 let v = &mut [1, 2, 3];
940 test_show_vec!(v, "[1, 2, 3]");
941 let v: &mut [&mut [_]] = &mut [&mut [], &mut [1], &mut [1, 1]];
942 test_show_vec!(v, "[[], [1], [1, 1]]");
946 fn test_vec_default() {
949 let v: $ty = Default::default();
950 assert!(v.is_empty());
960 fn test_overflow_does_not_cause_segfault() {
969 fn test_overflow_does_not_cause_segfault_managed() {
970 let mut v = vec![Rc::new(1)];
976 fn test_mut_split_at() {
977 let mut values = [1, 2, 3, 4, 5];
979 let (left, right) = values.split_at_mut(2);
981 let left: &[_] = left;
982 assert!(left[..left.len()] == [1, 2]);
989 let right: &[_] = right;
990 assert!(right[..right.len()] == [3, 4, 5]);
997 assert!(values == [2, 3, 5, 6, 7]);
1000 #[derive(Clone, PartialEq)]
1004 fn test_iter_zero_sized() {
1005 let mut v = vec![Foo, Foo, Foo];
1006 assert_eq!(v.len(), 3);
1031 assert_eq!(cnt, 11);
1033 let xs: [Foo; 3] = [Foo, Foo, Foo];
1043 fn test_shrink_to_fit() {
1044 let mut xs = vec![0, 1, 2, 3];
1048 assert_eq!(xs.capacity(), 128);
1050 assert_eq!(xs.capacity(), 100);
1051 assert_eq!(xs, (0..100).collect::<Vec<_>>());
1055 fn test_starts_with() {
1056 assert!(b"foobar".starts_with(b"foo"));
1057 assert!(!b"foobar".starts_with(b"oob"));
1058 assert!(!b"foobar".starts_with(b"bar"));
1059 assert!(!b"foo".starts_with(b"foobar"));
1060 assert!(!b"bar".starts_with(b"foobar"));
1061 assert!(b"foobar".starts_with(b"foobar"));
1062 let empty: &[u8] = &[];
1063 assert!(empty.starts_with(empty));
1064 assert!(!empty.starts_with(b"foo"));
1065 assert!(b"foobar".starts_with(empty));
1069 fn test_ends_with() {
1070 assert!(b"foobar".ends_with(b"bar"));
1071 assert!(!b"foobar".ends_with(b"oba"));
1072 assert!(!b"foobar".ends_with(b"foo"));
1073 assert!(!b"foo".ends_with(b"foobar"));
1074 assert!(!b"bar".ends_with(b"foobar"));
1075 assert!(b"foobar".ends_with(b"foobar"));
1076 let empty: &[u8] = &[];
1077 assert!(empty.ends_with(empty));
1078 assert!(!empty.ends_with(b"foo"));
1079 assert!(b"foobar".ends_with(empty));
1083 fn test_mut_splitator() {
1084 let mut xs = [0, 1, 0, 2, 3, 0, 0, 4, 5, 0];
1085 assert_eq!(xs.split_mut(|x| *x == 0).count(), 6);
1086 for slice in xs.split_mut(|x| *x == 0) {
1089 assert!(xs == [0, 1, 0, 3, 2, 0, 0, 5, 4, 0]);
1091 let mut xs = [0, 1, 0, 2, 3, 0, 0, 4, 5, 0, 6, 7];
1092 for slice in xs.split_mut(|x| *x == 0).take(5) {
1095 assert!(xs == [0, 1, 0, 3, 2, 0, 0, 5, 4, 0, 6, 7]);
1099 fn test_mut_splitator_rev() {
1100 let mut xs = [1, 2, 0, 3, 4, 0, 0, 5, 6, 0];
1101 for slice in xs.split_mut(|x| *x == 0).rev().take(4) {
1104 assert!(xs == [1, 2, 0, 4, 3, 0, 0, 6, 5, 0]);
1109 let mut v = [0, 1, 2];
1110 assert_eq!(v.get_mut(3), None);
1111 v.get_mut(1).map(|e| *e = 7);
1112 assert_eq!(v[1], 7);
1114 assert_eq!(v.get_mut(2), Some(&mut x));
1118 fn test_mut_chunks() {
1119 let mut v = [0, 1, 2, 3, 4, 5, 6];
1120 assert_eq!(v.chunks_mut(2).len(), 4);
1121 for (i, chunk) in v.chunks_mut(3).enumerate() {
1126 let result = [0, 0, 0, 1, 1, 1, 2];
1127 assert!(v == result);
1131 fn test_mut_chunks_rev() {
1132 let mut v = [0, 1, 2, 3, 4, 5, 6];
1133 for (i, chunk) in v.chunks_mut(3).rev().enumerate() {
1138 let result = [2, 2, 2, 1, 1, 1, 0];
1139 assert!(v == result);
1144 fn test_mut_chunks_0() {
1145 let mut v = [1, 2, 3, 4];
1146 let _it = v.chunks_mut(0);
1150 fn test_mut_last() {
1151 let mut x = [1, 2, 3, 4, 5];
1152 let h = x.last_mut();
1153 assert_eq!(*h.unwrap(), 5);
1155 let y: &mut [i32] = &mut [];
1156 assert!(y.last_mut().is_none());
1161 let xs: Box<_> = box [1, 2, 3];
1162 let ys = xs.to_vec();
1163 assert_eq!(ys, [1, 2, 3]);
1167 fn test_box_slice_clone() {
1168 let data = vec![vec![0, 1], vec![0], vec![1]];
1169 let data2 = data.clone().into_boxed_slice().clone().to_vec();
1171 assert_eq!(data, data2);
1175 #[cfg_attr(target_os = "emscripten", ignore)]
1176 fn test_box_slice_clone_panics() {
1178 use std::sync::atomic::{AtomicUsize, Ordering};
1179 use std::thread::spawn;
1182 count: Arc<AtomicUsize>,
1186 impl Drop for Canary {
1187 fn drop(&mut self) {
1188 self.count.fetch_add(1, Ordering::SeqCst);
1192 impl Clone for Canary {
1193 fn clone(&self) -> Self {
1199 count: self.count.clone(),
1200 panics: self.panics,
1205 let drop_count = Arc::new(AtomicUsize::new(0));
1206 let canary = Canary {
1207 count: drop_count.clone(),
1210 let panic = Canary {
1211 count: drop_count.clone(),
1216 // When xs is dropped, +5.
1217 let xs = vec![canary.clone(), canary.clone(), canary.clone(), panic, canary]
1218 .into_boxed_slice();
1220 // When panic is cloned, +3.
1227 assert_eq!(drop_count.load(Ordering::SeqCst), 8);
1231 fn test_copy_from_slice() {
1232 let src = [0, 1, 2, 3, 4, 5];
1233 let mut dst = [0; 6];
1234 dst.copy_from_slice(&src);
1235 assert_eq!(src, dst)
1239 #[should_panic(expected = "destination and source slices have different lengths")]
1240 fn test_copy_from_slice_dst_longer() {
1241 let src = [0, 1, 2, 3];
1242 let mut dst = [0; 5];
1243 dst.copy_from_slice(&src);
1247 #[should_panic(expected = "destination and source slices have different lengths")]
1248 fn test_copy_from_slice_dst_shorter() {
1249 let src = [0, 1, 2, 3];
1250 let mut dst = [0; 3];
1251 dst.copy_from_slice(&src);