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 v: [Vec<i32>; 0] = [];
474 let d = [vec![1], vec![2, 3]].concat();
475 assert_eq!(d, [1, 2, 3]);
477 let v: &[&[_]] = &[&[1], &[2, 3]];
478 assert_eq!(v.join(&0), [1, 0, 2, 3]);
479 let v: &[&[_]] = &[&[1], &[2], &[3]];
480 assert_eq!(v.join(&0), [1, 0, 2, 0, 3]);
485 let v: [Vec<i32>; 0] = [];
486 assert_eq!(v.join(&0), []);
487 assert_eq!([vec![1], vec![2, 3]].join(&0), [1, 0, 2, 3]);
488 assert_eq!([vec![1], vec![2], vec![3]].join(&0), [1, 0, 2, 0, 3]);
490 let v: [&[_]; 2] = [&[1], &[2, 3]];
491 assert_eq!(v.join(&0), [1, 0, 2, 3]);
492 let v: [&[_]; 3] = [&[1], &[2], &[3]];
493 assert_eq!(v.join(&0), [1, 0, 2, 0, 3]);
498 let mut a = vec![1, 2, 4];
500 assert_eq!(a, [1, 2, 3, 4]);
502 let mut a = vec![1, 2, 3];
504 assert_eq!(a, [0, 1, 2, 3]);
506 let mut a = vec![1, 2, 3];
508 assert_eq!(a, [1, 2, 3, 4]);
517 fn test_insert_oob() {
518 let mut a = vec![1, 2, 3];
524 let mut a = vec![1, 2, 3, 4];
526 assert_eq!(a.remove(2), 3);
527 assert_eq!(a, [1, 2, 4]);
529 assert_eq!(a.remove(2), 4);
530 assert_eq!(a, [1, 2]);
532 assert_eq!(a.remove(0), 1);
535 assert_eq!(a.remove(0), 2);
541 fn test_remove_fail() {
551 assert!(v.capacity() >= 11);
556 let v = vec![1, 2, 3, 4, 5];
558 assert_eq!(v.len(), 2);
563 macro_rules! assert_order {
564 (Greater, $a:expr, $b:expr) => {
565 assert_eq!($a.cmp($b), Greater);
568 (Less, $a:expr, $b:expr) => {
569 assert_eq!($a.cmp($b), Less);
572 (Equal, $a:expr, $b:expr) => {
573 assert_eq!($a.cmp($b), Equal);
579 fn test_total_ord_u8() {
580 let c = &[1u8, 2, 3];
581 assert_order!(Greater, &[1u8, 2, 3, 4][..], &c[..]);
582 let c = &[1u8, 2, 3, 4];
583 assert_order!(Less, &[1u8, 2, 3][..], &c[..]);
584 let c = &[1u8, 2, 3, 6];
585 assert_order!(Equal, &[1u8, 2, 3, 6][..], &c[..]);
586 let c = &[1u8, 2, 3, 4, 5, 6];
587 assert_order!(Less, &[1u8, 2, 3, 4, 5, 5, 5, 5][..], &c[..]);
588 let c = &[1u8, 2, 3, 4];
589 assert_order!(Greater, &[2u8, 2][..], &c[..]);
594 fn test_total_ord_i32() {
596 assert_order!(Greater, &[1, 2, 3, 4][..], &c[..]);
597 let c = &[1, 2, 3, 4];
598 assert_order!(Less, &[1, 2, 3][..], &c[..]);
599 let c = &[1, 2, 3, 6];
600 assert_order!(Equal, &[1, 2, 3, 6][..], &c[..]);
601 let c = &[1, 2, 3, 4, 5, 6];
602 assert_order!(Less, &[1, 2, 3, 4, 5, 5, 5, 5][..], &c[..]);
603 let c = &[1, 2, 3, 4];
604 assert_order!(Greater, &[2, 2][..], &c[..]);
609 let xs = [1, 2, 5, 10, 11];
610 let mut it = xs.iter();
611 assert_eq!(it.size_hint(), (5, Some(5)));
612 assert_eq!(it.next().unwrap(), &1);
613 assert_eq!(it.size_hint(), (4, Some(4)));
614 assert_eq!(it.next().unwrap(), &2);
615 assert_eq!(it.size_hint(), (3, Some(3)));
616 assert_eq!(it.next().unwrap(), &5);
617 assert_eq!(it.size_hint(), (2, Some(2)));
618 assert_eq!(it.next().unwrap(), &10);
619 assert_eq!(it.size_hint(), (1, Some(1)));
620 assert_eq!(it.next().unwrap(), &11);
621 assert_eq!(it.size_hint(), (0, Some(0)));
622 assert!(it.next().is_none());
626 fn test_iter_size_hints() {
627 let mut xs = [1, 2, 5, 10, 11];
628 assert_eq!(xs.iter().size_hint(), (5, Some(5)));
629 assert_eq!(xs.iter_mut().size_hint(), (5, Some(5)));
633 fn test_iter_as_slice() {
634 let xs = [1, 2, 5, 10, 11];
635 let mut iter = xs.iter();
636 assert_eq!(iter.as_slice(), &[1, 2, 5, 10, 11]);
638 assert_eq!(iter.as_slice(), &[2, 5, 10, 11]);
642 fn test_iter_as_ref() {
643 let xs = [1, 2, 5, 10, 11];
644 let mut iter = xs.iter();
645 assert_eq!(iter.as_ref(), &[1, 2, 5, 10, 11]);
647 assert_eq!(iter.as_ref(), &[2, 5, 10, 11]);
651 fn test_iter_clone() {
653 let mut it = xs.iter();
655 let mut jt = it.clone();
656 assert_eq!(it.next(), jt.next());
657 assert_eq!(it.next(), jt.next());
658 assert_eq!(it.next(), jt.next());
662 fn test_iter_is_empty() {
663 let xs = [1, 2, 5, 10, 11];
664 for i in 0..xs.len() {
665 for j in i..xs.len() {
666 assert_eq!(xs[i..j].iter().is_empty(), xs[i..j].is_empty());
672 fn test_mut_iterator() {
673 let mut xs = [1, 2, 3, 4, 5];
677 assert!(xs == [2, 3, 4, 5, 6])
681 fn test_rev_iterator() {
683 let xs = [1, 2, 5, 10, 11];
684 let ys = [11, 10, 5, 2, 1];
686 for &x in xs.iter().rev() {
687 assert_eq!(x, ys[i]);
694 fn test_mut_rev_iterator() {
695 let mut xs = [1, 2, 3, 4, 5];
696 for (i, x) in xs.iter_mut().rev().enumerate() {
699 assert!(xs == [5, 5, 5, 5, 5])
703 fn test_move_iterator() {
704 let xs = vec![1, 2, 3, 4, 5];
705 assert_eq!(xs.into_iter().fold(0, |a: usize, b: usize| 10 * a + b),
710 fn test_move_rev_iterator() {
711 let xs = vec![1, 2, 3, 4, 5];
712 assert_eq!(xs.into_iter().rev().fold(0, |a: usize, b: usize| 10 * a + b),
717 fn test_splitator() {
718 let xs = &[1, 2, 3, 4, 5];
720 let splits: &[&[_]] = &[&[1], &[3], &[5]];
721 assert_eq!(xs.split(|x| *x % 2 == 0).collect::<Vec<_>>(), splits);
722 let splits: &[&[_]] = &[&[], &[2, 3, 4, 5]];
723 assert_eq!(xs.split(|x| *x == 1).collect::<Vec<_>>(), splits);
724 let splits: &[&[_]] = &[&[1, 2, 3, 4], &[]];
725 assert_eq!(xs.split(|x| *x == 5).collect::<Vec<_>>(), splits);
726 let splits: &[&[_]] = &[&[1, 2, 3, 4, 5]];
727 assert_eq!(xs.split(|x| *x == 10).collect::<Vec<_>>(), splits);
728 let splits: &[&[_]] = &[&[], &[], &[], &[], &[], &[]];
729 assert_eq!(xs.split(|_| true).collect::<Vec<&[i32]>>(), splits);
731 let xs: &[i32] = &[];
732 let splits: &[&[i32]] = &[&[]];
733 assert_eq!(xs.split(|x| *x == 5).collect::<Vec<&[i32]>>(), splits);
737 fn test_splitnator() {
738 let xs = &[1, 2, 3, 4, 5];
740 let splits: &[&[_]] = &[&[1, 2, 3, 4, 5]];
741 assert_eq!(xs.splitn(1, |x| *x % 2 == 0).collect::<Vec<_>>(), splits);
742 let splits: &[&[_]] = &[&[1], &[3, 4, 5]];
743 assert_eq!(xs.splitn(2, |x| *x % 2 == 0).collect::<Vec<_>>(), splits);
744 let splits: &[&[_]] = &[&[], &[], &[], &[4, 5]];
745 assert_eq!(xs.splitn(4, |_| true).collect::<Vec<_>>(), splits);
747 let xs: &[i32] = &[];
748 let splits: &[&[i32]] = &[&[]];
749 assert_eq!(xs.splitn(2, |x| *x == 5).collect::<Vec<_>>(), splits);
753 fn test_splitnator_mut() {
754 let xs = &mut [1, 2, 3, 4, 5];
756 let splits: &[&mut [_]] = &[&mut [1, 2, 3, 4, 5]];
757 assert_eq!(xs.splitn_mut(1, |x| *x % 2 == 0).collect::<Vec<_>>(),
759 let splits: &[&mut [_]] = &[&mut [1], &mut [3, 4, 5]];
760 assert_eq!(xs.splitn_mut(2, |x| *x % 2 == 0).collect::<Vec<_>>(),
762 let splits: &[&mut [_]] = &[&mut [], &mut [], &mut [], &mut [4, 5]];
763 assert_eq!(xs.splitn_mut(4, |_| true).collect::<Vec<_>>(), splits);
765 let xs: &mut [i32] = &mut [];
766 let splits: &[&mut [i32]] = &[&mut []];
767 assert_eq!(xs.splitn_mut(2, |x| *x == 5).collect::<Vec<_>>(), splits);
771 fn test_rsplitator() {
772 let xs = &[1, 2, 3, 4, 5];
774 let splits: &[&[_]] = &[&[5], &[3], &[1]];
775 assert_eq!(xs.split(|x| *x % 2 == 0).rev().collect::<Vec<_>>(), splits);
776 let splits: &[&[_]] = &[&[2, 3, 4, 5], &[]];
777 assert_eq!(xs.split(|x| *x == 1).rev().collect::<Vec<_>>(), splits);
778 let splits: &[&[_]] = &[&[], &[1, 2, 3, 4]];
779 assert_eq!(xs.split(|x| *x == 5).rev().collect::<Vec<_>>(), splits);
780 let splits: &[&[_]] = &[&[1, 2, 3, 4, 5]];
781 assert_eq!(xs.split(|x| *x == 10).rev().collect::<Vec<_>>(), splits);
783 let xs: &[i32] = &[];
784 let splits: &[&[i32]] = &[&[]];
785 assert_eq!(xs.split(|x| *x == 5).rev().collect::<Vec<&[i32]>>(), splits);
789 fn test_rsplitnator() {
790 let xs = &[1, 2, 3, 4, 5];
792 let splits: &[&[_]] = &[&[1, 2, 3, 4, 5]];
793 assert_eq!(xs.rsplitn(1, |x| *x % 2 == 0).collect::<Vec<_>>(), splits);
794 let splits: &[&[_]] = &[&[5], &[1, 2, 3]];
795 assert_eq!(xs.rsplitn(2, |x| *x % 2 == 0).collect::<Vec<_>>(), splits);
796 let splits: &[&[_]] = &[&[], &[], &[], &[1, 2]];
797 assert_eq!(xs.rsplitn(4, |_| true).collect::<Vec<_>>(), splits);
799 let xs: &[i32] = &[];
800 let splits: &[&[i32]] = &[&[]];
801 assert_eq!(xs.rsplitn(2, |x| *x == 5).collect::<Vec<&[i32]>>(), splits);
802 assert!(xs.rsplitn(0, |x| *x % 2 == 0).next().is_none());
806 fn test_windowsator() {
807 let v = &[1, 2, 3, 4];
809 let wins: &[&[_]] = &[&[1, 2], &[2, 3], &[3, 4]];
810 assert_eq!(v.windows(2).collect::<Vec<_>>(), wins);
812 let wins: &[&[_]] = &[&[1, 2, 3], &[2, 3, 4]];
813 assert_eq!(v.windows(3).collect::<Vec<_>>(), wins);
814 assert!(v.windows(6).next().is_none());
816 let wins: &[&[_]] = &[&[3, 4], &[2, 3], &[1, 2]];
817 assert_eq!(v.windows(2).rev().collect::<Vec<&[_]>>(), wins);
822 fn test_windowsator_0() {
823 let v = &[1, 2, 3, 4];
824 let _it = v.windows(0);
828 fn test_chunksator() {
829 let v = &[1, 2, 3, 4, 5];
831 assert_eq!(v.chunks(2).len(), 3);
833 let chunks: &[&[_]] = &[&[1, 2], &[3, 4], &[5]];
834 assert_eq!(v.chunks(2).collect::<Vec<_>>(), chunks);
835 let chunks: &[&[_]] = &[&[1, 2, 3], &[4, 5]];
836 assert_eq!(v.chunks(3).collect::<Vec<_>>(), chunks);
837 let chunks: &[&[_]] = &[&[1, 2, 3, 4, 5]];
838 assert_eq!(v.chunks(6).collect::<Vec<_>>(), chunks);
840 let chunks: &[&[_]] = &[&[5], &[3, 4], &[1, 2]];
841 assert_eq!(v.chunks(2).rev().collect::<Vec<_>>(), chunks);
846 fn test_chunksator_0() {
847 let v = &[1, 2, 3, 4];
848 let _it = v.chunks(0);
852 fn test_reverse_part() {
853 let mut values = [1, 2, 3, 4, 5];
854 values[1..4].reverse();
855 assert!(values == [1, 4, 3, 2, 5]);
860 macro_rules! test_show_vec {
861 ($x:expr, $x_str:expr) => ({
862 let (x, x_str) = ($x, $x_str);
863 assert_eq!(format!("{:?}", x), x_str);
864 assert_eq!(format!("{:?}", x), x_str);
867 let empty = Vec::<i32>::new();
868 test_show_vec!(empty, "[]");
869 test_show_vec!(vec![1], "[1]");
870 test_show_vec!(vec![1, 2, 3], "[1, 2, 3]");
871 test_show_vec!(vec![vec![], vec![1], vec![1, 1]], "[[], [1], [1, 1]]");
873 let empty_mut: &mut [i32] = &mut [];
874 test_show_vec!(empty_mut, "[]");
876 test_show_vec!(v, "[1]");
877 let v = &mut [1, 2, 3];
878 test_show_vec!(v, "[1, 2, 3]");
879 let v: &mut [&mut [_]] = &mut [&mut [], &mut [1], &mut [1, 1]];
880 test_show_vec!(v, "[[], [1], [1, 1]]");
884 fn test_vec_default() {
887 let v: $ty = Default::default();
888 assert!(v.is_empty());
898 fn test_overflow_does_not_cause_segfault() {
907 fn test_overflow_does_not_cause_segfault_managed() {
908 let mut v = vec![Rc::new(1)];
914 fn test_mut_split_at() {
915 let mut values = [1, 2, 3, 4, 5];
917 let (left, right) = values.split_at_mut(2);
919 let left: &[_] = left;
920 assert!(left[..left.len()] == [1, 2]);
927 let right: &[_] = right;
928 assert!(right[..right.len()] == [3, 4, 5]);
935 assert!(values == [2, 3, 5, 6, 7]);
938 #[derive(Clone, PartialEq)]
942 fn test_iter_zero_sized() {
943 let mut v = vec![Foo, Foo, Foo];
944 assert_eq!(v.len(), 3);
971 let xs: [Foo; 3] = [Foo, Foo, Foo];
981 fn test_shrink_to_fit() {
982 let mut xs = vec![0, 1, 2, 3];
986 assert_eq!(xs.capacity(), 128);
988 assert_eq!(xs.capacity(), 100);
989 assert_eq!(xs, (0..100).collect::<Vec<_>>());
993 fn test_starts_with() {
994 assert!(b"foobar".starts_with(b"foo"));
995 assert!(!b"foobar".starts_with(b"oob"));
996 assert!(!b"foobar".starts_with(b"bar"));
997 assert!(!b"foo".starts_with(b"foobar"));
998 assert!(!b"bar".starts_with(b"foobar"));
999 assert!(b"foobar".starts_with(b"foobar"));
1000 let empty: &[u8] = &[];
1001 assert!(empty.starts_with(empty));
1002 assert!(!empty.starts_with(b"foo"));
1003 assert!(b"foobar".starts_with(empty));
1007 fn test_ends_with() {
1008 assert!(b"foobar".ends_with(b"bar"));
1009 assert!(!b"foobar".ends_with(b"oba"));
1010 assert!(!b"foobar".ends_with(b"foo"));
1011 assert!(!b"foo".ends_with(b"foobar"));
1012 assert!(!b"bar".ends_with(b"foobar"));
1013 assert!(b"foobar".ends_with(b"foobar"));
1014 let empty: &[u8] = &[];
1015 assert!(empty.ends_with(empty));
1016 assert!(!empty.ends_with(b"foo"));
1017 assert!(b"foobar".ends_with(empty));
1021 fn test_mut_splitator() {
1022 let mut xs = [0, 1, 0, 2, 3, 0, 0, 4, 5, 0];
1023 assert_eq!(xs.split_mut(|x| *x == 0).count(), 6);
1024 for slice in xs.split_mut(|x| *x == 0) {
1027 assert!(xs == [0, 1, 0, 3, 2, 0, 0, 5, 4, 0]);
1029 let mut xs = [0, 1, 0, 2, 3, 0, 0, 4, 5, 0, 6, 7];
1030 for slice in xs.split_mut(|x| *x == 0).take(5) {
1033 assert!(xs == [0, 1, 0, 3, 2, 0, 0, 5, 4, 0, 6, 7]);
1037 fn test_mut_splitator_rev() {
1038 let mut xs = [1, 2, 0, 3, 4, 0, 0, 5, 6, 0];
1039 for slice in xs.split_mut(|x| *x == 0).rev().take(4) {
1042 assert!(xs == [1, 2, 0, 4, 3, 0, 0, 6, 5, 0]);
1047 let mut v = [0, 1, 2];
1048 assert_eq!(v.get_mut(3), None);
1049 v.get_mut(1).map(|e| *e = 7);
1050 assert_eq!(v[1], 7);
1052 assert_eq!(v.get_mut(2), Some(&mut x));
1056 fn test_mut_chunks() {
1057 let mut v = [0, 1, 2, 3, 4, 5, 6];
1058 assert_eq!(v.chunks_mut(2).len(), 4);
1059 for (i, chunk) in v.chunks_mut(3).enumerate() {
1064 let result = [0, 0, 0, 1, 1, 1, 2];
1065 assert!(v == result);
1069 fn test_mut_chunks_rev() {
1070 let mut v = [0, 1, 2, 3, 4, 5, 6];
1071 for (i, chunk) in v.chunks_mut(3).rev().enumerate() {
1076 let result = [2, 2, 2, 1, 1, 1, 0];
1077 assert!(v == result);
1082 fn test_mut_chunks_0() {
1083 let mut v = [1, 2, 3, 4];
1084 let _it = v.chunks_mut(0);
1088 fn test_mut_last() {
1089 let mut x = [1, 2, 3, 4, 5];
1090 let h = x.last_mut();
1091 assert_eq!(*h.unwrap(), 5);
1093 let y: &mut [i32] = &mut [];
1094 assert!(y.last_mut().is_none());
1099 let xs: Box<_> = box [1, 2, 3];
1100 let ys = xs.to_vec();
1101 assert_eq!(ys, [1, 2, 3]);
1105 fn test_box_slice_clone() {
1106 let data = vec![vec![0, 1], vec![0], vec![1]];
1107 let data2 = data.clone().into_boxed_slice().clone().to_vec();
1109 assert_eq!(data, data2);
1113 #[cfg_attr(target_os = "emscripten", ignore)]
1114 fn test_box_slice_clone_panics() {
1116 use std::sync::atomic::{AtomicUsize, Ordering};
1117 use std::thread::spawn;
1120 count: Arc<AtomicUsize>,
1124 impl Drop for Canary {
1125 fn drop(&mut self) {
1126 self.count.fetch_add(1, Ordering::SeqCst);
1130 impl Clone for Canary {
1131 fn clone(&self) -> Self {
1137 count: self.count.clone(),
1138 panics: self.panics,
1143 let drop_count = Arc::new(AtomicUsize::new(0));
1144 let canary = Canary {
1145 count: drop_count.clone(),
1148 let panic = Canary {
1149 count: drop_count.clone(),
1154 // When xs is dropped, +5.
1155 let xs = vec![canary.clone(), canary.clone(), canary.clone(), panic, canary]
1156 .into_boxed_slice();
1158 // When panic is cloned, +3.
1165 assert_eq!(drop_count.load(Ordering::SeqCst), 8);
1169 fn test_copy_from_slice() {
1170 let src = [0, 1, 2, 3, 4, 5];
1171 let mut dst = [0; 6];
1172 dst.copy_from_slice(&src);
1173 assert_eq!(src, dst)
1177 #[should_panic(expected = "destination and source slices have different lengths")]
1178 fn test_copy_from_slice_dst_longer() {
1179 let src = [0, 1, 2, 3];
1180 let mut dst = [0; 5];
1181 dst.copy_from_slice(&src);
1185 #[should_panic(expected = "destination and source slices have different lengths")]
1186 fn test_copy_from_slice_dst_shorter() {
1187 let src = [0, 1, 2, 3];
1188 let mut dst = [0; 3];
1189 dst.copy_from_slice(&src);