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};
13 use std::__rand::{Rng, thread_rng};
16 fn square(n: usize) -> usize {
20 fn is_odd(n: &usize) -> bool {
26 // Test on-stack from_fn.
27 let mut v: Vec<_> = (0..3).map(square).collect();
30 assert_eq!(v.len(), 3);
36 // Test on-heap from_fn.
37 v = (0..5).map(square).collect();
40 assert_eq!(v.len(), 5);
51 // Test on-stack from_elem.
52 let mut v = vec![10, 10];
55 assert_eq!(v.len(), 2);
60 // Test on-heap from_elem.
75 let xs: [i32; 0] = [];
76 assert!(xs.is_empty());
77 assert!(![0].is_empty());
81 fn test_len_divzero() {
85 let v2: &[Z] = &[[], []];
86 assert_eq!(mem::size_of::<Z>(), 0);
87 assert_eq!(v0.len(), 0);
88 assert_eq!(v1.len(), 1);
89 assert_eq!(v2.len(), 2);
95 assert_eq!(a.get(1), None);
97 assert_eq!(a.get(1).unwrap(), &12);
99 assert_eq!(a.get(1).unwrap(), &12);
105 assert_eq!(a.first(), None);
107 assert_eq!(a.first().unwrap(), &11);
109 assert_eq!(a.first().unwrap(), &11);
113 fn test_first_mut() {
115 assert_eq!(a.first_mut(), None);
117 assert_eq!(*a.first_mut().unwrap(), 11);
119 assert_eq!(*a.first_mut().unwrap(), 11);
123 fn test_split_first() {
124 let mut a = vec![11];
126 assert!(b.split_first().is_none());
127 assert_eq!(a.split_first(), Some((&11, b)));
129 let b: &[i32] = &[12];
130 assert_eq!(a.split_first(), Some((&11, b)));
134 fn test_split_first_mut() {
135 let mut a = vec![11];
136 let b: &mut [i32] = &mut [];
137 assert!(b.split_first_mut().is_none());
138 assert!(a.split_first_mut() == Some((&mut 11, b)));
140 let b: &mut [_] = &mut [12];
141 assert!(a.split_first_mut() == Some((&mut 11, b)));
145 fn test_split_last() {
146 let mut a = vec![11];
148 assert!(b.split_last().is_none());
149 assert_eq!(a.split_last(), Some((&11, b)));
152 assert_eq!(a.split_last(), Some((&12, b)));
156 fn test_split_last_mut() {
157 let mut a = vec![11];
158 let b: &mut [i32] = &mut [];
159 assert!(b.split_last_mut().is_none());
160 assert!(a.split_last_mut() == Some((&mut 11, b)));
163 let b: &mut [_] = &mut [11];
164 assert!(a.split_last_mut() == Some((&mut 12, b)));
170 assert_eq!(a.last(), None);
172 assert_eq!(a.last().unwrap(), &11);
174 assert_eq!(a.last().unwrap(), &12);
180 assert_eq!(a.last_mut(), None);
182 assert_eq!(*a.last_mut().unwrap(), 11);
184 assert_eq!(*a.last_mut().unwrap(), 12);
189 // Test fixed length vector.
190 let vec_fixed = [1, 2, 3, 4];
191 let v_a = vec_fixed[1..vec_fixed.len()].to_vec();
192 assert_eq!(v_a.len(), 3);
194 assert_eq!(v_a[0], 2);
195 assert_eq!(v_a[1], 3);
196 assert_eq!(v_a[2], 4);
199 let vec_stack: &[_] = &[1, 2, 3];
200 let v_b = vec_stack[1..3].to_vec();
201 assert_eq!(v_b.len(), 2);
203 assert_eq!(v_b[0], 2);
204 assert_eq!(v_b[1], 3);
207 let vec_unique = vec![1, 2, 3, 4, 5, 6];
208 let v_d = vec_unique[1..6].to_vec();
209 assert_eq!(v_d.len(), 5);
211 assert_eq!(v_d[0], 2);
212 assert_eq!(v_d[1], 3);
213 assert_eq!(v_d[2], 4);
214 assert_eq!(v_d[3], 5);
215 assert_eq!(v_d[4], 6);
219 fn test_slice_from() {
220 let vec: &[_] = &[1, 2, 3, 4];
221 assert_eq!(&vec[..], vec);
222 let b: &[_] = &[3, 4];
223 assert_eq!(&vec[2..], b);
225 assert_eq!(&vec[4..], b);
230 let vec: &[_] = &[1, 2, 3, 4];
231 assert_eq!(&vec[..4], vec);
232 let b: &[_] = &[1, 2];
233 assert_eq!(&vec[..2], b);
235 assert_eq!(&vec[..0], b);
243 assert_eq!(v.len(), 0);
244 assert_eq!(e, Some(5));
252 fn test_swap_remove() {
253 let mut v = vec![1, 2, 3, 4, 5];
254 let mut e = v.swap_remove(0);
256 assert_eq!(v, [5, 2, 3, 4]);
257 e = v.swap_remove(3);
259 assert_eq!(v, [5, 2, 3]);
264 fn test_swap_remove_fail() {
266 let _ = v.swap_remove(0);
267 let _ = v.swap_remove(0);
271 fn test_swap_remove_noncopyable() {
272 // Tests that we don't accidentally run destructors twice.
273 let mut v: Vec<Box<_>> = Vec::new();
277 let mut _e = v.swap_remove(0);
278 assert_eq!(v.len(), 2);
279 _e = v.swap_remove(1);
280 assert_eq!(v.len(), 1);
281 _e = v.swap_remove(0);
282 assert_eq!(v.len(), 0);
287 // Test on-stack push().
290 assert_eq!(v.len(), 1);
293 // Test on-heap push().
295 assert_eq!(v.len(), 2);
302 let mut v: Vec<Box<_>> = vec![box 6, box 5, box 4];
305 assert_eq!(v.len(), 1);
306 assert_eq!(*(v[0]), 6);
307 // If the unsafe block didn't drop things properly, we blow up here.
312 let mut v: Vec<Box<_>> = vec![box 6, box 5, box 4];
314 assert_eq!(v.len(), 0);
315 // If the unsafe block didn't drop things properly, we blow up here.
320 let mut v = vec![1, 2, 3, 4, 5];
322 assert_eq!(v, [1, 3, 5]);
326 fn test_binary_search() {
327 assert_eq!([1, 2, 3, 4, 5].binary_search(&5).ok(), Some(4));
328 assert_eq!([1, 2, 3, 4, 5].binary_search(&4).ok(), Some(3));
329 assert_eq!([1, 2, 3, 4, 5].binary_search(&3).ok(), Some(2));
330 assert_eq!([1, 2, 3, 4, 5].binary_search(&2).ok(), Some(1));
331 assert_eq!([1, 2, 3, 4, 5].binary_search(&1).ok(), Some(0));
333 assert_eq!([2, 4, 6, 8, 10].binary_search(&1).ok(), None);
334 assert_eq!([2, 4, 6, 8, 10].binary_search(&5).ok(), None);
335 assert_eq!([2, 4, 6, 8, 10].binary_search(&4).ok(), Some(1));
336 assert_eq!([2, 4, 6, 8, 10].binary_search(&10).ok(), Some(4));
338 assert_eq!([2, 4, 6, 8].binary_search(&1).ok(), None);
339 assert_eq!([2, 4, 6, 8].binary_search(&5).ok(), None);
340 assert_eq!([2, 4, 6, 8].binary_search(&4).ok(), Some(1));
341 assert_eq!([2, 4, 6, 8].binary_search(&8).ok(), Some(3));
343 assert_eq!([2, 4, 6].binary_search(&1).ok(), None);
344 assert_eq!([2, 4, 6].binary_search(&5).ok(), None);
345 assert_eq!([2, 4, 6].binary_search(&4).ok(), Some(1));
346 assert_eq!([2, 4, 6].binary_search(&6).ok(), Some(2));
348 assert_eq!([2, 4].binary_search(&1).ok(), None);
349 assert_eq!([2, 4].binary_search(&5).ok(), None);
350 assert_eq!([2, 4].binary_search(&2).ok(), Some(0));
351 assert_eq!([2, 4].binary_search(&4).ok(), Some(1));
353 assert_eq!([2].binary_search(&1).ok(), None);
354 assert_eq!([2].binary_search(&5).ok(), None);
355 assert_eq!([2].binary_search(&2).ok(), Some(0));
357 assert_eq!([].binary_search(&1).ok(), None);
358 assert_eq!([].binary_search(&5).ok(), None);
360 assert!([1, 1, 1, 1, 1].binary_search(&1).ok() != None);
361 assert!([1, 1, 1, 1, 2].binary_search(&1).ok() != None);
362 assert!([1, 1, 1, 2, 2].binary_search(&1).ok() != None);
363 assert!([1, 1, 2, 2, 2].binary_search(&1).ok() != None);
364 assert_eq!([1, 2, 2, 2, 2].binary_search(&1).ok(), Some(0));
366 assert_eq!([1, 2, 3, 4, 5].binary_search(&6).ok(), None);
367 assert_eq!([1, 2, 3, 4, 5].binary_search(&0).ok(), None);
372 let mut v = vec![10, 20];
373 assert_eq!(v[0], 10);
374 assert_eq!(v[1], 20);
376 assert_eq!(v[0], 20);
377 assert_eq!(v[1], 10);
379 let mut v3 = Vec::<i32>::new();
381 assert!(v3.is_empty());
383 // check the 1-byte-types path
384 let mut v = (-50..51i8).collect::<Vec<_>>();
386 assert_eq!(v, (-50..51i8).rev().collect::<Vec<_>>());
388 // check the 2-byte-types path
389 let mut v = (-50..51i16).collect::<Vec<_>>();
391 assert_eq!(v, (-50..51i16).rev().collect::<Vec<_>>());
396 let mut rng = thread_rng();
398 for len in (2..25).chain(500..510) {
400 let mut v: Vec<_> = rng.gen_iter::<i32>().take(len).collect();
401 let mut v1 = v.clone();
404 assert!(v.windows(2).all(|w| w[0] <= w[1]));
406 v1.sort_by(|a, b| a.cmp(b));
407 assert!(v1.windows(2).all(|w| w[0] <= w[1]));
409 v1.sort_by(|a, b| b.cmp(a));
410 assert!(v1.windows(2).all(|w| w[0] >= w[1]));
414 // Sort using a completely random comparison function.
415 // This will reorder the elements *somehow*, but won't panic.
416 let mut v = [0; 500];
417 for i in 0..v.len() {
420 v.sort_by(|_, _| *rng.choose(&[Less, Equal, Greater]).unwrap());
422 for i in 0..v.len() {
423 assert_eq!(v[i], i as i32);
431 let mut v = [0xDEADBEEFu64];
433 assert!(v == [0xDEADBEEF]);
437 fn test_sort_stability() {
438 for len in (2..25).chain(500..510) {
440 let mut counts = [0; 10];
442 // create a vector like [(6, 1), (5, 1), (6, 2), ...],
443 // where the first item of each tuple is random, but
444 // the second item represents which occurrence of that
445 // number this element is, i.e. the second elements
446 // will occur in sorted order.
447 let mut v: Vec<_> = (0..len)
449 let n = thread_rng().gen::<usize>() % 10;
455 // only sort on the first element, so an unstable sort
456 // may mix up the counts.
457 v.sort_by(|&(a, _), &(b, _)| a.cmp(&b));
459 // this comparison includes the count (the second item
460 // of the tuple), so elements with equal first items
461 // will need to be ordered with increasing
462 // counts... i.e. exactly asserting that this sort is
464 assert!(v.windows(2).all(|w| w[0] <= w[1]));
471 let expected: Vec<_> = (0..13).collect();
472 let mut v = Vec::new();
475 v.clone_from(&expected);
477 assert_eq!(v, expected);
478 v.rotate(expected.len());
479 assert_eq!(v, expected);
480 let mut zst_array = [(), (), ()];
484 v = (5..13).chain(0..5).collect();
486 assert_eq!(v, expected);
488 let expected: Vec<_> = (0..1000).collect();
490 // small rotations in large slice, uses ptr::copy
491 v = (2..1000).chain(0..2).collect();
493 assert_eq!(v, expected);
494 v = (998..1000).chain(0..998).collect();
496 assert_eq!(v, expected);
498 // non-small prime rotation, has a few rounds of swapping
499 v = (389..1000).chain(0..389).collect();
501 assert_eq!(v, expected);
506 let v: [Vec<i32>; 0] = [];
509 let d = [vec![1], vec![2, 3]].concat();
510 assert_eq!(d, [1, 2, 3]);
512 let v: &[&[_]] = &[&[1], &[2, 3]];
513 assert_eq!(v.join(&0), [1, 0, 2, 3]);
514 let v: &[&[_]] = &[&[1], &[2], &[3]];
515 assert_eq!(v.join(&0), [1, 0, 2, 0, 3]);
520 let v: [Vec<i32>; 0] = [];
521 assert_eq!(v.join(&0), []);
522 assert_eq!([vec![1], vec![2, 3]].join(&0), [1, 0, 2, 3]);
523 assert_eq!([vec![1], vec![2], vec![3]].join(&0), [1, 0, 2, 0, 3]);
525 let v: [&[_]; 2] = [&[1], &[2, 3]];
526 assert_eq!(v.join(&0), [1, 0, 2, 3]);
527 let v: [&[_]; 3] = [&[1], &[2], &[3]];
528 assert_eq!(v.join(&0), [1, 0, 2, 0, 3]);
533 let mut a = vec![1, 2, 4];
535 assert_eq!(a, [1, 2, 3, 4]);
537 let mut a = vec![1, 2, 3];
539 assert_eq!(a, [0, 1, 2, 3]);
541 let mut a = vec![1, 2, 3];
543 assert_eq!(a, [1, 2, 3, 4]);
552 fn test_insert_oob() {
553 let mut a = vec![1, 2, 3];
559 let mut a = vec![1, 2, 3, 4];
561 assert_eq!(a.remove(2), 3);
562 assert_eq!(a, [1, 2, 4]);
564 assert_eq!(a.remove(2), 4);
565 assert_eq!(a, [1, 2]);
567 assert_eq!(a.remove(0), 1);
570 assert_eq!(a.remove(0), 2);
576 fn test_remove_fail() {
586 assert!(v.capacity() >= 11);
591 let v = vec![1, 2, 3, 4, 5];
593 assert_eq!(v.len(), 2);
598 macro_rules! assert_order {
599 (Greater, $a:expr, $b:expr) => {
600 assert_eq!($a.cmp($b), Greater);
603 (Less, $a:expr, $b:expr) => {
604 assert_eq!($a.cmp($b), Less);
607 (Equal, $a:expr, $b:expr) => {
608 assert_eq!($a.cmp($b), Equal);
614 fn test_total_ord_u8() {
615 let c = &[1u8, 2, 3];
616 assert_order!(Greater, &[1u8, 2, 3, 4][..], &c[..]);
617 let c = &[1u8, 2, 3, 4];
618 assert_order!(Less, &[1u8, 2, 3][..], &c[..]);
619 let c = &[1u8, 2, 3, 6];
620 assert_order!(Equal, &[1u8, 2, 3, 6][..], &c[..]);
621 let c = &[1u8, 2, 3, 4, 5, 6];
622 assert_order!(Less, &[1u8, 2, 3, 4, 5, 5, 5, 5][..], &c[..]);
623 let c = &[1u8, 2, 3, 4];
624 assert_order!(Greater, &[2u8, 2][..], &c[..]);
629 fn test_total_ord_i32() {
631 assert_order!(Greater, &[1, 2, 3, 4][..], &c[..]);
632 let c = &[1, 2, 3, 4];
633 assert_order!(Less, &[1, 2, 3][..], &c[..]);
634 let c = &[1, 2, 3, 6];
635 assert_order!(Equal, &[1, 2, 3, 6][..], &c[..]);
636 let c = &[1, 2, 3, 4, 5, 6];
637 assert_order!(Less, &[1, 2, 3, 4, 5, 5, 5, 5][..], &c[..]);
638 let c = &[1, 2, 3, 4];
639 assert_order!(Greater, &[2, 2][..], &c[..]);
644 let xs = [1, 2, 5, 10, 11];
645 let mut it = xs.iter();
646 assert_eq!(it.size_hint(), (5, Some(5)));
647 assert_eq!(it.next().unwrap(), &1);
648 assert_eq!(it.size_hint(), (4, Some(4)));
649 assert_eq!(it.next().unwrap(), &2);
650 assert_eq!(it.size_hint(), (3, Some(3)));
651 assert_eq!(it.next().unwrap(), &5);
652 assert_eq!(it.size_hint(), (2, Some(2)));
653 assert_eq!(it.next().unwrap(), &10);
654 assert_eq!(it.size_hint(), (1, Some(1)));
655 assert_eq!(it.next().unwrap(), &11);
656 assert_eq!(it.size_hint(), (0, Some(0)));
657 assert!(it.next().is_none());
661 fn test_iter_size_hints() {
662 let mut xs = [1, 2, 5, 10, 11];
663 assert_eq!(xs.iter().size_hint(), (5, Some(5)));
664 assert_eq!(xs.iter_mut().size_hint(), (5, Some(5)));
668 fn test_iter_as_slice() {
669 let xs = [1, 2, 5, 10, 11];
670 let mut iter = xs.iter();
671 assert_eq!(iter.as_slice(), &[1, 2, 5, 10, 11]);
673 assert_eq!(iter.as_slice(), &[2, 5, 10, 11]);
677 fn test_iter_as_ref() {
678 let xs = [1, 2, 5, 10, 11];
679 let mut iter = xs.iter();
680 assert_eq!(iter.as_ref(), &[1, 2, 5, 10, 11]);
682 assert_eq!(iter.as_ref(), &[2, 5, 10, 11]);
686 fn test_iter_clone() {
688 let mut it = xs.iter();
690 let mut jt = it.clone();
691 assert_eq!(it.next(), jt.next());
692 assert_eq!(it.next(), jt.next());
693 assert_eq!(it.next(), jt.next());
697 fn test_iter_is_empty() {
698 let xs = [1, 2, 5, 10, 11];
699 for i in 0..xs.len() {
700 for j in i..xs.len() {
701 assert_eq!(xs[i..j].iter().is_empty(), xs[i..j].is_empty());
707 fn test_mut_iterator() {
708 let mut xs = [1, 2, 3, 4, 5];
712 assert!(xs == [2, 3, 4, 5, 6])
716 fn test_rev_iterator() {
718 let xs = [1, 2, 5, 10, 11];
719 let ys = [11, 10, 5, 2, 1];
721 for &x in xs.iter().rev() {
722 assert_eq!(x, ys[i]);
729 fn test_mut_rev_iterator() {
730 let mut xs = [1, 2, 3, 4, 5];
731 for (i, x) in xs.iter_mut().rev().enumerate() {
734 assert!(xs == [5, 5, 5, 5, 5])
738 fn test_move_iterator() {
739 let xs = vec![1, 2, 3, 4, 5];
740 assert_eq!(xs.into_iter().fold(0, |a: usize, b: usize| 10 * a + b),
745 fn test_move_rev_iterator() {
746 let xs = vec![1, 2, 3, 4, 5];
747 assert_eq!(xs.into_iter().rev().fold(0, |a: usize, b: usize| 10 * a + b),
752 fn test_splitator() {
753 let xs = &[1, 2, 3, 4, 5];
755 let splits: &[&[_]] = &[&[1], &[3], &[5]];
756 assert_eq!(xs.split(|x| *x % 2 == 0).collect::<Vec<_>>(), splits);
757 let splits: &[&[_]] = &[&[], &[2, 3, 4, 5]];
758 assert_eq!(xs.split(|x| *x == 1).collect::<Vec<_>>(), splits);
759 let splits: &[&[_]] = &[&[1, 2, 3, 4], &[]];
760 assert_eq!(xs.split(|x| *x == 5).collect::<Vec<_>>(), splits);
761 let splits: &[&[_]] = &[&[1, 2, 3, 4, 5]];
762 assert_eq!(xs.split(|x| *x == 10).collect::<Vec<_>>(), splits);
763 let splits: &[&[_]] = &[&[], &[], &[], &[], &[], &[]];
764 assert_eq!(xs.split(|_| true).collect::<Vec<&[i32]>>(), splits);
766 let xs: &[i32] = &[];
767 let splits: &[&[i32]] = &[&[]];
768 assert_eq!(xs.split(|x| *x == 5).collect::<Vec<&[i32]>>(), splits);
772 fn test_splitnator() {
773 let xs = &[1, 2, 3, 4, 5];
775 let splits: &[&[_]] = &[&[1, 2, 3, 4, 5]];
776 assert_eq!(xs.splitn(1, |x| *x % 2 == 0).collect::<Vec<_>>(), splits);
777 let splits: &[&[_]] = &[&[1], &[3, 4, 5]];
778 assert_eq!(xs.splitn(2, |x| *x % 2 == 0).collect::<Vec<_>>(), splits);
779 let splits: &[&[_]] = &[&[], &[], &[], &[4, 5]];
780 assert_eq!(xs.splitn(4, |_| true).collect::<Vec<_>>(), splits);
782 let xs: &[i32] = &[];
783 let splits: &[&[i32]] = &[&[]];
784 assert_eq!(xs.splitn(2, |x| *x == 5).collect::<Vec<_>>(), splits);
788 fn test_splitnator_mut() {
789 let xs = &mut [1, 2, 3, 4, 5];
791 let splits: &[&mut [_]] = &[&mut [1, 2, 3, 4, 5]];
792 assert_eq!(xs.splitn_mut(1, |x| *x % 2 == 0).collect::<Vec<_>>(),
794 let splits: &[&mut [_]] = &[&mut [1], &mut [3, 4, 5]];
795 assert_eq!(xs.splitn_mut(2, |x| *x % 2 == 0).collect::<Vec<_>>(),
797 let splits: &[&mut [_]] = &[&mut [], &mut [], &mut [], &mut [4, 5]];
798 assert_eq!(xs.splitn_mut(4, |_| true).collect::<Vec<_>>(), splits);
800 let xs: &mut [i32] = &mut [];
801 let splits: &[&mut [i32]] = &[&mut []];
802 assert_eq!(xs.splitn_mut(2, |x| *x == 5).collect::<Vec<_>>(), splits);
806 fn test_rsplitator() {
807 let xs = &[1, 2, 3, 4, 5];
809 let splits: &[&[_]] = &[&[5], &[3], &[1]];
810 assert_eq!(xs.split(|x| *x % 2 == 0).rev().collect::<Vec<_>>(), splits);
811 let splits: &[&[_]] = &[&[2, 3, 4, 5], &[]];
812 assert_eq!(xs.split(|x| *x == 1).rev().collect::<Vec<_>>(), splits);
813 let splits: &[&[_]] = &[&[], &[1, 2, 3, 4]];
814 assert_eq!(xs.split(|x| *x == 5).rev().collect::<Vec<_>>(), splits);
815 let splits: &[&[_]] = &[&[1, 2, 3, 4, 5]];
816 assert_eq!(xs.split(|x| *x == 10).rev().collect::<Vec<_>>(), splits);
818 let xs: &[i32] = &[];
819 let splits: &[&[i32]] = &[&[]];
820 assert_eq!(xs.split(|x| *x == 5).rev().collect::<Vec<&[i32]>>(), splits);
824 fn test_rsplitnator() {
825 let xs = &[1, 2, 3, 4, 5];
827 let splits: &[&[_]] = &[&[1, 2, 3, 4, 5]];
828 assert_eq!(xs.rsplitn(1, |x| *x % 2 == 0).collect::<Vec<_>>(), splits);
829 let splits: &[&[_]] = &[&[5], &[1, 2, 3]];
830 assert_eq!(xs.rsplitn(2, |x| *x % 2 == 0).collect::<Vec<_>>(), splits);
831 let splits: &[&[_]] = &[&[], &[], &[], &[1, 2]];
832 assert_eq!(xs.rsplitn(4, |_| true).collect::<Vec<_>>(), splits);
834 let xs: &[i32] = &[];
835 let splits: &[&[i32]] = &[&[]];
836 assert_eq!(xs.rsplitn(2, |x| *x == 5).collect::<Vec<&[i32]>>(), splits);
837 assert!(xs.rsplitn(0, |x| *x % 2 == 0).next().is_none());
841 fn test_windowsator() {
842 let v = &[1, 2, 3, 4];
844 let wins: &[&[_]] = &[&[1, 2], &[2, 3], &[3, 4]];
845 assert_eq!(v.windows(2).collect::<Vec<_>>(), wins);
847 let wins: &[&[_]] = &[&[1, 2, 3], &[2, 3, 4]];
848 assert_eq!(v.windows(3).collect::<Vec<_>>(), wins);
849 assert!(v.windows(6).next().is_none());
851 let wins: &[&[_]] = &[&[3, 4], &[2, 3], &[1, 2]];
852 assert_eq!(v.windows(2).rev().collect::<Vec<&[_]>>(), wins);
857 fn test_windowsator_0() {
858 let v = &[1, 2, 3, 4];
859 let _it = v.windows(0);
863 fn test_chunksator() {
864 let v = &[1, 2, 3, 4, 5];
866 assert_eq!(v.chunks(2).len(), 3);
868 let chunks: &[&[_]] = &[&[1, 2], &[3, 4], &[5]];
869 assert_eq!(v.chunks(2).collect::<Vec<_>>(), chunks);
870 let chunks: &[&[_]] = &[&[1, 2, 3], &[4, 5]];
871 assert_eq!(v.chunks(3).collect::<Vec<_>>(), chunks);
872 let chunks: &[&[_]] = &[&[1, 2, 3, 4, 5]];
873 assert_eq!(v.chunks(6).collect::<Vec<_>>(), chunks);
875 let chunks: &[&[_]] = &[&[5], &[3, 4], &[1, 2]];
876 assert_eq!(v.chunks(2).rev().collect::<Vec<_>>(), chunks);
881 fn test_chunksator_0() {
882 let v = &[1, 2, 3, 4];
883 let _it = v.chunks(0);
887 fn test_reverse_part() {
888 let mut values = [1, 2, 3, 4, 5];
889 values[1..4].reverse();
890 assert!(values == [1, 4, 3, 2, 5]);
895 macro_rules! test_show_vec {
896 ($x:expr, $x_str:expr) => ({
897 let (x, x_str) = ($x, $x_str);
898 assert_eq!(format!("{:?}", x), x_str);
899 assert_eq!(format!("{:?}", x), x_str);
902 let empty = Vec::<i32>::new();
903 test_show_vec!(empty, "[]");
904 test_show_vec!(vec![1], "[1]");
905 test_show_vec!(vec![1, 2, 3], "[1, 2, 3]");
906 test_show_vec!(vec![vec![], vec![1], vec![1, 1]], "[[], [1], [1, 1]]");
908 let empty_mut: &mut [i32] = &mut [];
909 test_show_vec!(empty_mut, "[]");
911 test_show_vec!(v, "[1]");
912 let v = &mut [1, 2, 3];
913 test_show_vec!(v, "[1, 2, 3]");
914 let v: &mut [&mut [_]] = &mut [&mut [], &mut [1], &mut [1, 1]];
915 test_show_vec!(v, "[[], [1], [1, 1]]");
919 fn test_vec_default() {
922 let v: $ty = Default::default();
923 assert!(v.is_empty());
933 fn test_overflow_does_not_cause_segfault() {
942 fn test_overflow_does_not_cause_segfault_managed() {
943 let mut v = vec![Rc::new(1)];
949 fn test_mut_split_at() {
950 let mut values = [1, 2, 3, 4, 5];
952 let (left, right) = values.split_at_mut(2);
954 let left: &[_] = left;
955 assert!(left[..left.len()] == [1, 2]);
962 let right: &[_] = right;
963 assert!(right[..right.len()] == [3, 4, 5]);
970 assert!(values == [2, 3, 5, 6, 7]);
973 #[derive(Clone, PartialEq)]
977 fn test_iter_zero_sized() {
978 let mut v = vec![Foo, Foo, Foo];
979 assert_eq!(v.len(), 3);
1004 assert_eq!(cnt, 11);
1006 let xs: [Foo; 3] = [Foo, Foo, Foo];
1016 fn test_shrink_to_fit() {
1017 let mut xs = vec![0, 1, 2, 3];
1021 assert_eq!(xs.capacity(), 128);
1023 assert_eq!(xs.capacity(), 100);
1024 assert_eq!(xs, (0..100).collect::<Vec<_>>());
1028 fn test_starts_with() {
1029 assert!(b"foobar".starts_with(b"foo"));
1030 assert!(!b"foobar".starts_with(b"oob"));
1031 assert!(!b"foobar".starts_with(b"bar"));
1032 assert!(!b"foo".starts_with(b"foobar"));
1033 assert!(!b"bar".starts_with(b"foobar"));
1034 assert!(b"foobar".starts_with(b"foobar"));
1035 let empty: &[u8] = &[];
1036 assert!(empty.starts_with(empty));
1037 assert!(!empty.starts_with(b"foo"));
1038 assert!(b"foobar".starts_with(empty));
1042 fn test_ends_with() {
1043 assert!(b"foobar".ends_with(b"bar"));
1044 assert!(!b"foobar".ends_with(b"oba"));
1045 assert!(!b"foobar".ends_with(b"foo"));
1046 assert!(!b"foo".ends_with(b"foobar"));
1047 assert!(!b"bar".ends_with(b"foobar"));
1048 assert!(b"foobar".ends_with(b"foobar"));
1049 let empty: &[u8] = &[];
1050 assert!(empty.ends_with(empty));
1051 assert!(!empty.ends_with(b"foo"));
1052 assert!(b"foobar".ends_with(empty));
1056 fn test_mut_splitator() {
1057 let mut xs = [0, 1, 0, 2, 3, 0, 0, 4, 5, 0];
1058 assert_eq!(xs.split_mut(|x| *x == 0).count(), 6);
1059 for slice in xs.split_mut(|x| *x == 0) {
1062 assert!(xs == [0, 1, 0, 3, 2, 0, 0, 5, 4, 0]);
1064 let mut xs = [0, 1, 0, 2, 3, 0, 0, 4, 5, 0, 6, 7];
1065 for slice in xs.split_mut(|x| *x == 0).take(5) {
1068 assert!(xs == [0, 1, 0, 3, 2, 0, 0, 5, 4, 0, 6, 7]);
1072 fn test_mut_splitator_rev() {
1073 let mut xs = [1, 2, 0, 3, 4, 0, 0, 5, 6, 0];
1074 for slice in xs.split_mut(|x| *x == 0).rev().take(4) {
1077 assert!(xs == [1, 2, 0, 4, 3, 0, 0, 6, 5, 0]);
1082 let mut v = [0, 1, 2];
1083 assert_eq!(v.get_mut(3), None);
1084 v.get_mut(1).map(|e| *e = 7);
1085 assert_eq!(v[1], 7);
1087 assert_eq!(v.get_mut(2), Some(&mut x));
1091 fn test_mut_chunks() {
1092 let mut v = [0, 1, 2, 3, 4, 5, 6];
1093 assert_eq!(v.chunks_mut(2).len(), 4);
1094 for (i, chunk) in v.chunks_mut(3).enumerate() {
1099 let result = [0, 0, 0, 1, 1, 1, 2];
1100 assert!(v == result);
1104 fn test_mut_chunks_rev() {
1105 let mut v = [0, 1, 2, 3, 4, 5, 6];
1106 for (i, chunk) in v.chunks_mut(3).rev().enumerate() {
1111 let result = [2, 2, 2, 1, 1, 1, 0];
1112 assert!(v == result);
1117 fn test_mut_chunks_0() {
1118 let mut v = [1, 2, 3, 4];
1119 let _it = v.chunks_mut(0);
1123 fn test_mut_last() {
1124 let mut x = [1, 2, 3, 4, 5];
1125 let h = x.last_mut();
1126 assert_eq!(*h.unwrap(), 5);
1128 let y: &mut [i32] = &mut [];
1129 assert!(y.last_mut().is_none());
1134 let xs: Box<_> = box [1, 2, 3];
1135 let ys = xs.to_vec();
1136 assert_eq!(ys, [1, 2, 3]);
1140 fn test_box_slice_clone() {
1141 let data = vec![vec![0, 1], vec![0], vec![1]];
1142 let data2 = data.clone().into_boxed_slice().clone().to_vec();
1144 assert_eq!(data, data2);
1148 #[cfg_attr(target_os = "emscripten", ignore)]
1149 fn test_box_slice_clone_panics() {
1151 use std::sync::atomic::{AtomicUsize, Ordering};
1152 use std::thread::spawn;
1155 count: Arc<AtomicUsize>,
1159 impl Drop for Canary {
1160 fn drop(&mut self) {
1161 self.count.fetch_add(1, Ordering::SeqCst);
1165 impl Clone for Canary {
1166 fn clone(&self) -> Self {
1172 count: self.count.clone(),
1173 panics: self.panics,
1178 let drop_count = Arc::new(AtomicUsize::new(0));
1179 let canary = Canary {
1180 count: drop_count.clone(),
1183 let panic = Canary {
1184 count: drop_count.clone(),
1189 // When xs is dropped, +5.
1190 let xs = vec![canary.clone(), canary.clone(), canary.clone(), panic, canary]
1191 .into_boxed_slice();
1193 // When panic is cloned, +3.
1200 assert_eq!(drop_count.load(Ordering::SeqCst), 8);
1204 fn test_copy_from_slice() {
1205 let src = [0, 1, 2, 3, 4, 5];
1206 let mut dst = [0; 6];
1207 dst.copy_from_slice(&src);
1208 assert_eq!(src, dst)
1212 #[should_panic(expected = "destination and source slices have different lengths")]
1213 fn test_copy_from_slice_dst_longer() {
1214 let src = [0, 1, 2, 3];
1215 let mut dst = [0; 5];
1216 dst.copy_from_slice(&src);
1220 #[should_panic(expected = "destination and source slices have different lengths")]
1221 fn test_copy_from_slice_dst_shorter() {
1222 let src = [0, 1, 2, 3];
1223 let mut dst = [0; 3];
1224 dst.copy_from_slice(&src);