1 use std::cmp::Ordering::{Equal, Greater, Less};
2 use std::convert::identity;
8 fn square(n: usize) -> usize {
12 fn is_odd(n: &usize) -> bool {
18 // Test on-stack from_fn.
19 let mut v: Vec<_> = (0..3).map(square).collect();
22 assert_eq!(v.len(), 3);
28 // Test on-heap from_fn.
29 v = (0..5).map(square).collect();
32 assert_eq!(v.len(), 5);
43 // Test on-stack from_elem.
44 let mut v = vec![10, 10];
47 assert_eq!(v.len(), 2);
52 // Test on-heap from_elem.
67 let xs: [i32; 0] = [];
68 assert!(xs.is_empty());
69 assert!(![0].is_empty());
73 fn test_len_divzero() {
77 let v2: &[Z] = &[[], []];
78 assert_eq!(mem::size_of::<Z>(), 0);
79 assert_eq!(v0.len(), 0);
80 assert_eq!(v1.len(), 1);
81 assert_eq!(v2.len(), 2);
87 assert_eq!(a.get(1), None);
89 assert_eq!(a.get(1).unwrap(), &12);
91 assert_eq!(a.get(1).unwrap(), &12);
97 assert_eq!(a.first(), None);
99 assert_eq!(a.first().unwrap(), &11);
101 assert_eq!(a.first().unwrap(), &11);
105 fn test_first_mut() {
107 assert_eq!(a.first_mut(), None);
109 assert_eq!(*a.first_mut().unwrap(), 11);
111 assert_eq!(*a.first_mut().unwrap(), 11);
115 fn test_split_first() {
116 let mut a = vec![11];
118 assert!(b.split_first().is_none());
119 assert_eq!(a.split_first(), Some((&11, b)));
121 let b: &[i32] = &[12];
122 assert_eq!(a.split_first(), Some((&11, b)));
126 fn test_split_first_mut() {
127 let mut a = vec![11];
128 let b: &mut [i32] = &mut [];
129 assert!(b.split_first_mut().is_none());
130 assert!(a.split_first_mut() == Some((&mut 11, b)));
132 let b: &mut [_] = &mut [12];
133 assert!(a.split_first_mut() == Some((&mut 11, b)));
137 fn test_split_last() {
138 let mut a = vec![11];
140 assert!(b.split_last().is_none());
141 assert_eq!(a.split_last(), Some((&11, b)));
144 assert_eq!(a.split_last(), Some((&12, b)));
148 fn test_split_last_mut() {
149 let mut a = vec![11];
150 let b: &mut [i32] = &mut [];
151 assert!(b.split_last_mut().is_none());
152 assert!(a.split_last_mut() == Some((&mut 11, b)));
155 let b: &mut [_] = &mut [11];
156 assert!(a.split_last_mut() == Some((&mut 12, b)));
162 assert_eq!(a.last(), None);
164 assert_eq!(a.last().unwrap(), &11);
166 assert_eq!(a.last().unwrap(), &12);
172 assert_eq!(a.last_mut(), None);
174 assert_eq!(*a.last_mut().unwrap(), 11);
176 assert_eq!(*a.last_mut().unwrap(), 12);
181 // Test fixed length vector.
182 let vec_fixed = [1, 2, 3, 4];
183 let v_a = vec_fixed[1..vec_fixed.len()].to_vec();
184 assert_eq!(v_a.len(), 3);
186 assert_eq!(v_a[0], 2);
187 assert_eq!(v_a[1], 3);
188 assert_eq!(v_a[2], 4);
191 let vec_stack: &[_] = &[1, 2, 3];
192 let v_b = vec_stack[1..3].to_vec();
193 assert_eq!(v_b.len(), 2);
195 assert_eq!(v_b[0], 2);
196 assert_eq!(v_b[1], 3);
199 let vec_unique = vec![1, 2, 3, 4, 5, 6];
200 let v_d = vec_unique[1..6].to_vec();
201 assert_eq!(v_d.len(), 5);
203 assert_eq!(v_d[0], 2);
204 assert_eq!(v_d[1], 3);
205 assert_eq!(v_d[2], 4);
206 assert_eq!(v_d[3], 5);
207 assert_eq!(v_d[4], 6);
211 fn test_slice_from() {
212 let vec: &[_] = &[1, 2, 3, 4];
213 assert_eq!(&vec[..], vec);
214 let b: &[_] = &[3, 4];
215 assert_eq!(&vec[2..], b);
217 assert_eq!(&vec[4..], b);
222 let vec: &[_] = &[1, 2, 3, 4];
223 assert_eq!(&vec[..4], vec);
224 let b: &[_] = &[1, 2];
225 assert_eq!(&vec[..2], b);
227 assert_eq!(&vec[..0], b);
234 assert_eq!(v.len(), 0);
235 assert_eq!(e, Some(5));
243 fn test_swap_remove() {
244 let mut v = vec![1, 2, 3, 4, 5];
245 let mut e = v.swap_remove(0);
247 assert_eq!(v, [5, 2, 3, 4]);
248 e = v.swap_remove(3);
250 assert_eq!(v, [5, 2, 3]);
255 fn test_swap_remove_fail() {
257 let _ = v.swap_remove(0);
258 let _ = v.swap_remove(0);
262 fn test_swap_remove_noncopyable() {
263 // Tests that we don't accidentally run destructors twice.
264 let mut v: Vec<Box<_>> = Vec::new();
268 let mut _e = v.swap_remove(0);
269 assert_eq!(v.len(), 2);
270 _e = v.swap_remove(1);
271 assert_eq!(v.len(), 1);
272 _e = v.swap_remove(0);
273 assert_eq!(v.len(), 0);
278 // Test on-stack push().
281 assert_eq!(v.len(), 1);
284 // Test on-heap push().
286 assert_eq!(v.len(), 2);
293 let mut v: Vec<Box<_>> = vec![Box::new(6), Box::new(5), Box::new(4)];
296 assert_eq!(v.len(), 1);
297 assert_eq!(*(v[0]), 6);
298 // If the unsafe block didn't drop things properly, we blow up here.
303 let mut v: Vec<Box<_>> = vec![Box::new(6), Box::new(5), Box::new(4)];
305 assert_eq!(v.len(), 0);
306 // If the unsafe block didn't drop things properly, we blow up here.
311 let mut v = vec![1, 2, 3, 4, 5];
313 assert_eq!(v, [1, 3, 5]);
317 fn test_binary_search() {
318 assert_eq!([1, 2, 3, 4, 5].binary_search(&5).ok(), Some(4));
319 assert_eq!([1, 2, 3, 4, 5].binary_search(&4).ok(), Some(3));
320 assert_eq!([1, 2, 3, 4, 5].binary_search(&3).ok(), Some(2));
321 assert_eq!([1, 2, 3, 4, 5].binary_search(&2).ok(), Some(1));
322 assert_eq!([1, 2, 3, 4, 5].binary_search(&1).ok(), Some(0));
324 assert_eq!([2, 4, 6, 8, 10].binary_search(&1).ok(), None);
325 assert_eq!([2, 4, 6, 8, 10].binary_search(&5).ok(), None);
326 assert_eq!([2, 4, 6, 8, 10].binary_search(&4).ok(), Some(1));
327 assert_eq!([2, 4, 6, 8, 10].binary_search(&10).ok(), Some(4));
329 assert_eq!([2, 4, 6, 8].binary_search(&1).ok(), None);
330 assert_eq!([2, 4, 6, 8].binary_search(&5).ok(), None);
331 assert_eq!([2, 4, 6, 8].binary_search(&4).ok(), Some(1));
332 assert_eq!([2, 4, 6, 8].binary_search(&8).ok(), Some(3));
334 assert_eq!([2, 4, 6].binary_search(&1).ok(), None);
335 assert_eq!([2, 4, 6].binary_search(&5).ok(), None);
336 assert_eq!([2, 4, 6].binary_search(&4).ok(), Some(1));
337 assert_eq!([2, 4, 6].binary_search(&6).ok(), Some(2));
339 assert_eq!([2, 4].binary_search(&1).ok(), None);
340 assert_eq!([2, 4].binary_search(&5).ok(), None);
341 assert_eq!([2, 4].binary_search(&2).ok(), Some(0));
342 assert_eq!([2, 4].binary_search(&4).ok(), Some(1));
344 assert_eq!([2].binary_search(&1).ok(), None);
345 assert_eq!([2].binary_search(&5).ok(), None);
346 assert_eq!([2].binary_search(&2).ok(), Some(0));
348 assert_eq!([].binary_search(&1).ok(), None);
349 assert_eq!([].binary_search(&5).ok(), None);
351 assert!([1, 1, 1, 1, 1].binary_search(&1).ok() != None);
352 assert!([1, 1, 1, 1, 2].binary_search(&1).ok() != None);
353 assert!([1, 1, 1, 2, 2].binary_search(&1).ok() != None);
354 assert!([1, 1, 2, 2, 2].binary_search(&1).ok() != None);
355 assert_eq!([1, 2, 2, 2, 2].binary_search(&1).ok(), Some(0));
357 assert_eq!([1, 2, 3, 4, 5].binary_search(&6).ok(), None);
358 assert_eq!([1, 2, 3, 4, 5].binary_search(&0).ok(), None);
363 let mut v = vec![10, 20];
364 assert_eq!(v[0], 10);
365 assert_eq!(v[1], 20);
367 assert_eq!(v[0], 20);
368 assert_eq!(v[1], 10);
370 let mut v3 = Vec::<i32>::new();
372 assert!(v3.is_empty());
374 // check the 1-byte-types path
375 let mut v = (-50..51i8).collect::<Vec<_>>();
377 assert_eq!(v, (-50..51i8).rev().collect::<Vec<_>>());
379 // check the 2-byte-types path
380 let mut v = (-50..51i16).collect::<Vec<_>>();
382 assert_eq!(v, (-50..51i16).rev().collect::<Vec<_>>());
386 fn test_rotate_left() {
387 let expected: Vec<_> = (0..13).collect();
388 let mut v = Vec::new();
391 v.clone_from(&expected);
393 assert_eq!(v, expected);
394 v.rotate_left(expected.len());
395 assert_eq!(v, expected);
396 let mut zst_array = [(), (), ()];
397 zst_array.rotate_left(2);
400 v = (5..13).chain(0..5).collect();
402 assert_eq!(v, expected);
404 let expected: Vec<_> = (0..1000).collect();
406 // small rotations in large slice, uses ptr::copy
407 v = (2..1000).chain(0..2).collect();
409 assert_eq!(v, expected);
410 v = (998..1000).chain(0..998).collect();
412 assert_eq!(v, expected);
414 // non-small prime rotation, has a few rounds of swapping
415 v = (389..1000).chain(0..389).collect();
416 v.rotate_left(1000 - 389);
417 assert_eq!(v, expected);
421 fn test_rotate_right() {
422 let expected: Vec<_> = (0..13).collect();
423 let mut v = Vec::new();
426 v.clone_from(&expected);
428 assert_eq!(v, expected);
429 v.rotate_right(expected.len());
430 assert_eq!(v, expected);
431 let mut zst_array = [(), (), ()];
432 zst_array.rotate_right(2);
435 v = (5..13).chain(0..5).collect();
437 assert_eq!(v, expected);
439 let expected: Vec<_> = (0..1000).collect();
441 // small rotations in large slice, uses ptr::copy
442 v = (2..1000).chain(0..2).collect();
444 assert_eq!(v, expected);
445 v = (998..1000).chain(0..998).collect();
447 assert_eq!(v, expected);
449 // non-small prime rotation, has a few rounds of swapping
450 v = (389..1000).chain(0..389).collect();
452 assert_eq!(v, expected);
457 let v: [Vec<i32>; 0] = [];
460 let d = [vec![1], vec![2, 3]].concat();
461 assert_eq!(d, [1, 2, 3]);
463 let v: &[&[_]] = &[&[1], &[2, 3]];
464 assert_eq!(v.join(&0), [1, 0, 2, 3]);
465 let v: &[&[_]] = &[&[1], &[2], &[3]];
466 assert_eq!(v.join(&0), [1, 0, 2, 0, 3]);
471 let v: [Vec<i32>; 0] = [];
472 assert_eq!(v.join(&0), []);
473 assert_eq!([vec![1], vec![2, 3]].join(&0), [1, 0, 2, 3]);
474 assert_eq!([vec![1], vec![2], vec![3]].join(&0), [1, 0, 2, 0, 3]);
476 let v: [&[_]; 2] = [&[1], &[2, 3]];
477 assert_eq!(v.join(&0), [1, 0, 2, 3]);
478 let v: [&[_]; 3] = [&[1], &[2], &[3]];
479 assert_eq!(v.join(&0), [1, 0, 2, 0, 3]);
483 fn test_join_nocopy() {
484 let v: [String; 0] = [];
485 assert_eq!(v.join(","), "");
486 assert_eq!(["a".to_string(), "ab".into()].join(","), "a,ab");
487 assert_eq!(["a".to_string(), "ab".into(), "abc".into()].join(","), "a,ab,abc");
488 assert_eq!(["a".to_string(), "ab".into(), "".into()].join(","), "a,ab,");
493 let mut a = vec![1, 2, 4];
495 assert_eq!(a, [1, 2, 3, 4]);
497 let mut a = vec![1, 2, 3];
499 assert_eq!(a, [0, 1, 2, 3]);
501 let mut a = vec![1, 2, 3];
503 assert_eq!(a, [1, 2, 3, 4]);
512 fn test_insert_oob() {
513 let mut a = vec![1, 2, 3];
519 let mut a = vec![1, 2, 3, 4];
521 assert_eq!(a.remove(2), 3);
522 assert_eq!(a, [1, 2, 4]);
524 assert_eq!(a.remove(2), 4);
525 assert_eq!(a, [1, 2]);
527 assert_eq!(a.remove(0), 1);
530 assert_eq!(a.remove(0), 2);
536 fn test_remove_fail() {
546 assert!(v.capacity() >= 11);
551 let v = vec![1, 2, 3, 4, 5];
553 assert_eq!(v.len(), 2);
558 macro_rules! assert_order {
559 (Greater, $a:expr, $b:expr) => {
560 assert_eq!($a.cmp($b), Greater);
563 (Less, $a:expr, $b:expr) => {
564 assert_eq!($a.cmp($b), Less);
567 (Equal, $a:expr, $b:expr) => {
568 assert_eq!($a.cmp($b), Equal);
574 fn test_total_ord_u8() {
575 let c = &[1u8, 2, 3];
576 assert_order!(Greater, &[1u8, 2, 3, 4][..], &c[..]);
577 let c = &[1u8, 2, 3, 4];
578 assert_order!(Less, &[1u8, 2, 3][..], &c[..]);
579 let c = &[1u8, 2, 3, 6];
580 assert_order!(Equal, &[1u8, 2, 3, 6][..], &c[..]);
581 let c = &[1u8, 2, 3, 4, 5, 6];
582 assert_order!(Less, &[1u8, 2, 3, 4, 5, 5, 5, 5][..], &c[..]);
583 let c = &[1u8, 2, 3, 4];
584 assert_order!(Greater, &[2u8, 2][..], &c[..]);
588 fn test_total_ord_i32() {
590 assert_order!(Greater, &[1, 2, 3, 4][..], &c[..]);
591 let c = &[1, 2, 3, 4];
592 assert_order!(Less, &[1, 2, 3][..], &c[..]);
593 let c = &[1, 2, 3, 6];
594 assert_order!(Equal, &[1, 2, 3, 6][..], &c[..]);
595 let c = &[1, 2, 3, 4, 5, 6];
596 assert_order!(Less, &[1, 2, 3, 4, 5, 5, 5, 5][..], &c[..]);
597 let c = &[1, 2, 3, 4];
598 assert_order!(Greater, &[2, 2][..], &c[..]);
603 let xs = [1, 2, 5, 10, 11];
604 let mut it = xs.iter();
605 assert_eq!(it.size_hint(), (5, Some(5)));
606 assert_eq!(it.next().unwrap(), &1);
607 assert_eq!(it.size_hint(), (4, Some(4)));
608 assert_eq!(it.next().unwrap(), &2);
609 assert_eq!(it.size_hint(), (3, Some(3)));
610 assert_eq!(it.next().unwrap(), &5);
611 assert_eq!(it.size_hint(), (2, Some(2)));
612 assert_eq!(it.next().unwrap(), &10);
613 assert_eq!(it.size_hint(), (1, Some(1)));
614 assert_eq!(it.next().unwrap(), &11);
615 assert_eq!(it.size_hint(), (0, Some(0)));
616 assert!(it.next().is_none());
620 fn test_iter_size_hints() {
621 let mut xs = [1, 2, 5, 10, 11];
622 assert_eq!(xs.iter().size_hint(), (5, Some(5)));
623 assert_eq!(xs.iter_mut().size_hint(), (5, Some(5)));
627 fn test_iter_as_slice() {
628 let xs = [1, 2, 5, 10, 11];
629 let mut iter = xs.iter();
630 assert_eq!(iter.as_slice(), &[1, 2, 5, 10, 11]);
632 assert_eq!(iter.as_slice(), &[2, 5, 10, 11]);
636 fn test_iter_as_ref() {
637 let xs = [1, 2, 5, 10, 11];
638 let mut iter = xs.iter();
639 assert_eq!(iter.as_ref(), &[1, 2, 5, 10, 11]);
641 assert_eq!(iter.as_ref(), &[2, 5, 10, 11]);
645 fn test_iter_clone() {
647 let mut it = xs.iter();
649 let mut jt = it.clone();
650 assert_eq!(it.next(), jt.next());
651 assert_eq!(it.next(), jt.next());
652 assert_eq!(it.next(), jt.next());
656 fn test_iter_is_empty() {
657 let xs = [1, 2, 5, 10, 11];
658 for i in 0..xs.len() {
659 for j in i..xs.len() {
660 assert_eq!(xs[i..j].iter().is_empty(), xs[i..j].is_empty());
666 fn test_mut_iterator() {
667 let mut xs = [1, 2, 3, 4, 5];
671 assert!(xs == [2, 3, 4, 5, 6])
675 fn test_rev_iterator() {
676 let xs = [1, 2, 5, 10, 11];
677 let ys = [11, 10, 5, 2, 1];
679 for &x in xs.iter().rev() {
680 assert_eq!(x, ys[i]);
687 fn test_mut_rev_iterator() {
688 let mut xs = [1, 2, 3, 4, 5];
689 for (i, x) in xs.iter_mut().rev().enumerate() {
692 assert!(xs == [5, 5, 5, 5, 5])
696 fn test_move_iterator() {
697 let xs = vec![1, 2, 3, 4, 5];
698 assert_eq!(xs.into_iter().fold(0, |a: usize, b: usize| 10 * a + b), 12345);
702 fn test_move_rev_iterator() {
703 let xs = vec![1, 2, 3, 4, 5];
704 assert_eq!(xs.into_iter().rev().fold(0, |a: usize, b: usize| 10 * a + b), 54321);
708 fn test_splitator() {
709 let xs = &[1, 2, 3, 4, 5];
711 let splits: &[&[_]] = &[&[1], &[3], &[5]];
712 assert_eq!(xs.split(|x| *x % 2 == 0).collect::<Vec<_>>(), splits);
713 let splits: &[&[_]] = &[&[], &[2, 3, 4, 5]];
714 assert_eq!(xs.split(|x| *x == 1).collect::<Vec<_>>(), splits);
715 let splits: &[&[_]] = &[&[1, 2, 3, 4], &[]];
716 assert_eq!(xs.split(|x| *x == 5).collect::<Vec<_>>(), splits);
717 let splits: &[&[_]] = &[&[1, 2, 3, 4, 5]];
718 assert_eq!(xs.split(|x| *x == 10).collect::<Vec<_>>(), splits);
719 let splits: &[&[_]] = &[&[], &[], &[], &[], &[], &[]];
720 assert_eq!(xs.split(|_| true).collect::<Vec<&[i32]>>(), splits);
722 let xs: &[i32] = &[];
723 let splits: &[&[i32]] = &[&[]];
724 assert_eq!(xs.split(|x| *x == 5).collect::<Vec<&[i32]>>(), splits);
728 fn test_splitator_inclusive() {
729 let xs = &[1, 2, 3, 4, 5];
731 let splits: &[&[_]] = &[&[1, 2], &[3, 4], &[5]];
732 assert_eq!(xs.split_inclusive(|x| *x % 2 == 0).collect::<Vec<_>>(), splits);
733 let splits: &[&[_]] = &[&[1], &[2, 3, 4, 5]];
734 assert_eq!(xs.split_inclusive(|x| *x == 1).collect::<Vec<_>>(), splits);
735 let splits: &[&[_]] = &[&[1, 2, 3, 4, 5]];
736 assert_eq!(xs.split_inclusive(|x| *x == 5).collect::<Vec<_>>(), splits);
737 let splits: &[&[_]] = &[&[1, 2, 3, 4, 5]];
738 assert_eq!(xs.split_inclusive(|x| *x == 10).collect::<Vec<_>>(), splits);
739 let splits: &[&[_]] = &[&[1], &[2], &[3], &[4], &[5]];
740 assert_eq!(xs.split_inclusive(|_| true).collect::<Vec<&[i32]>>(), splits);
742 let xs: &[i32] = &[];
743 let splits: &[&[i32]] = &[];
744 assert_eq!(xs.split_inclusive(|x| *x == 5).collect::<Vec<&[i32]>>(), splits);
748 fn test_splitator_inclusive_reverse() {
749 let xs = &[1, 2, 3, 4, 5];
751 let splits: &[&[_]] = &[&[5], &[3, 4], &[1, 2]];
752 assert_eq!(xs.split_inclusive(|x| *x % 2 == 0).rev().collect::<Vec<_>>(), splits);
753 let splits: &[&[_]] = &[&[2, 3, 4, 5], &[1]];
754 assert_eq!(xs.split_inclusive(|x| *x == 1).rev().collect::<Vec<_>>(), splits);
755 let splits: &[&[_]] = &[&[1, 2, 3, 4, 5]];
756 assert_eq!(xs.split_inclusive(|x| *x == 5).rev().collect::<Vec<_>>(), splits);
757 let splits: &[&[_]] = &[&[1, 2, 3, 4, 5]];
758 assert_eq!(xs.split_inclusive(|x| *x == 10).rev().collect::<Vec<_>>(), splits);
759 let splits: &[&[_]] = &[&[5], &[4], &[3], &[2], &[1]];
760 assert_eq!(xs.split_inclusive(|_| true).rev().collect::<Vec<_>>(), splits);
762 let xs: &[i32] = &[];
763 let splits: &[&[i32]] = &[];
764 assert_eq!(xs.split_inclusive(|x| *x == 5).rev().collect::<Vec<_>>(), splits);
768 fn test_splitator_mut_inclusive() {
769 let xs = &mut [1, 2, 3, 4, 5];
771 let splits: &[&[_]] = &[&[1, 2], &[3, 4], &[5]];
772 assert_eq!(xs.split_inclusive_mut(|x| *x % 2 == 0).collect::<Vec<_>>(), splits);
773 let splits: &[&[_]] = &[&[1], &[2, 3, 4, 5]];
774 assert_eq!(xs.split_inclusive_mut(|x| *x == 1).collect::<Vec<_>>(), splits);
775 let splits: &[&[_]] = &[&[1, 2, 3, 4, 5]];
776 assert_eq!(xs.split_inclusive_mut(|x| *x == 5).collect::<Vec<_>>(), splits);
777 let splits: &[&[_]] = &[&[1, 2, 3, 4, 5]];
778 assert_eq!(xs.split_inclusive_mut(|x| *x == 10).collect::<Vec<_>>(), splits);
779 let splits: &[&[_]] = &[&[1], &[2], &[3], &[4], &[5]];
780 assert_eq!(xs.split_inclusive_mut(|_| true).collect::<Vec<_>>(), splits);
782 let xs: &mut [i32] = &mut [];
783 let splits: &[&[i32]] = &[];
784 assert_eq!(xs.split_inclusive_mut(|x| *x == 5).collect::<Vec<_>>(), splits);
788 fn test_splitator_mut_inclusive_reverse() {
789 let xs = &mut [1, 2, 3, 4, 5];
791 let splits: &[&[_]] = &[&[5], &[3, 4], &[1, 2]];
792 assert_eq!(xs.split_inclusive_mut(|x| *x % 2 == 0).rev().collect::<Vec<_>>(), splits);
793 let splits: &[&[_]] = &[&[2, 3, 4, 5], &[1]];
794 assert_eq!(xs.split_inclusive_mut(|x| *x == 1).rev().collect::<Vec<_>>(), splits);
795 let splits: &[&[_]] = &[&[1, 2, 3, 4, 5]];
796 assert_eq!(xs.split_inclusive_mut(|x| *x == 5).rev().collect::<Vec<_>>(), splits);
797 let splits: &[&[_]] = &[&[1, 2, 3, 4, 5]];
798 assert_eq!(xs.split_inclusive_mut(|x| *x == 10).rev().collect::<Vec<_>>(), splits);
799 let splits: &[&[_]] = &[&[5], &[4], &[3], &[2], &[1]];
800 assert_eq!(xs.split_inclusive_mut(|_| true).rev().collect::<Vec<_>>(), splits);
802 let xs: &mut [i32] = &mut [];
803 let splits: &[&[i32]] = &[];
804 assert_eq!(xs.split_inclusive_mut(|x| *x == 5).rev().collect::<Vec<_>>(), splits);
808 fn test_splitnator() {
809 let xs = &[1, 2, 3, 4, 5];
811 let splits: &[&[_]] = &[&[1, 2, 3, 4, 5]];
812 assert_eq!(xs.splitn(1, |x| *x % 2 == 0).collect::<Vec<_>>(), splits);
813 let splits: &[&[_]] = &[&[1], &[3, 4, 5]];
814 assert_eq!(xs.splitn(2, |x| *x % 2 == 0).collect::<Vec<_>>(), splits);
815 let splits: &[&[_]] = &[&[], &[], &[], &[4, 5]];
816 assert_eq!(xs.splitn(4, |_| true).collect::<Vec<_>>(), splits);
818 let xs: &[i32] = &[];
819 let splits: &[&[i32]] = &[&[]];
820 assert_eq!(xs.splitn(2, |x| *x == 5).collect::<Vec<_>>(), splits);
824 fn test_splitnator_mut() {
825 let xs = &mut [1, 2, 3, 4, 5];
827 let splits: &[&mut [_]] = &[&mut [1, 2, 3, 4, 5]];
828 assert_eq!(xs.splitn_mut(1, |x| *x % 2 == 0).collect::<Vec<_>>(), splits);
829 let splits: &[&mut [_]] = &[&mut [1], &mut [3, 4, 5]];
830 assert_eq!(xs.splitn_mut(2, |x| *x % 2 == 0).collect::<Vec<_>>(), splits);
831 let splits: &[&mut [_]] = &[&mut [], &mut [], &mut [], &mut [4, 5]];
832 assert_eq!(xs.splitn_mut(4, |_| true).collect::<Vec<_>>(), splits);
834 let xs: &mut [i32] = &mut [];
835 let splits: &[&mut [i32]] = &[&mut []];
836 assert_eq!(xs.splitn_mut(2, |x| *x == 5).collect::<Vec<_>>(), splits);
840 fn test_rsplitator() {
841 let xs = &[1, 2, 3, 4, 5];
843 let splits: &[&[_]] = &[&[5], &[3], &[1]];
844 assert_eq!(xs.split(|x| *x % 2 == 0).rev().collect::<Vec<_>>(), splits);
845 let splits: &[&[_]] = &[&[2, 3, 4, 5], &[]];
846 assert_eq!(xs.split(|x| *x == 1).rev().collect::<Vec<_>>(), splits);
847 let splits: &[&[_]] = &[&[], &[1, 2, 3, 4]];
848 assert_eq!(xs.split(|x| *x == 5).rev().collect::<Vec<_>>(), splits);
849 let splits: &[&[_]] = &[&[1, 2, 3, 4, 5]];
850 assert_eq!(xs.split(|x| *x == 10).rev().collect::<Vec<_>>(), splits);
852 let xs: &[i32] = &[];
853 let splits: &[&[i32]] = &[&[]];
854 assert_eq!(xs.split(|x| *x == 5).rev().collect::<Vec<&[i32]>>(), splits);
858 fn test_rsplitnator() {
859 let xs = &[1, 2, 3, 4, 5];
861 let splits: &[&[_]] = &[&[1, 2, 3, 4, 5]];
862 assert_eq!(xs.rsplitn(1, |x| *x % 2 == 0).collect::<Vec<_>>(), splits);
863 let splits: &[&[_]] = &[&[5], &[1, 2, 3]];
864 assert_eq!(xs.rsplitn(2, |x| *x % 2 == 0).collect::<Vec<_>>(), splits);
865 let splits: &[&[_]] = &[&[], &[], &[], &[1, 2]];
866 assert_eq!(xs.rsplitn(4, |_| true).collect::<Vec<_>>(), splits);
868 let xs: &[i32] = &[];
869 let splits: &[&[i32]] = &[&[]];
870 assert_eq!(xs.rsplitn(2, |x| *x == 5).collect::<Vec<&[i32]>>(), splits);
871 assert!(xs.rsplitn(0, |x| *x % 2 == 0).next().is_none());
875 fn test_split_iterators_size_hint() {
876 #[derive(Copy, Clone)]
881 fn assert_tight_size_hints(mut it: impl Iterator, which: Bounds, ctx: impl fmt::Display) {
884 let mut lower_bounds = vec![it.size_hint().0];
885 while let Some(_) = it.next() {
886 lower_bounds.push(it.size_hint().0);
888 let target: Vec<_> = (0..lower_bounds.len()).rev().collect();
889 assert_eq!(lower_bounds, target, "lower bounds incorrect or not tight: {}", ctx);
892 let mut upper_bounds = vec![it.size_hint().1];
893 while let Some(_) = it.next() {
894 upper_bounds.push(it.size_hint().1);
896 let target: Vec<_> = (0..upper_bounds.len()).map(Some).rev().collect();
897 assert_eq!(upper_bounds, target, "upper bounds incorrect or not tight: {}", ctx);
903 let mut v: Vec<u8> = (0..len).collect();
905 // p: predicate, b: bound selection
907 // with a predicate always returning false, the split*-iterators
908 // become maximally short, so the size_hint lower bounds are tight
909 ((|_| false) as fn(&_) -> _, Bounds::Lower),
910 // with a predicate always returning true, the split*-iterators
911 // become maximally long, so the size_hint upper bounds are tight
912 ((|_| true) as fn(&_) -> _, Bounds::Upper),
914 use assert_tight_size_hints as a;
915 use format_args as f;
917 a(v.split(p), b, "split");
918 a(v.split_mut(p), b, "split_mut");
919 a(v.split_inclusive(p), b, "split_inclusive");
920 a(v.split_inclusive_mut(p), b, "split_inclusive_mut");
921 a(v.rsplit(p), b, "rsplit");
922 a(v.rsplit_mut(p), b, "rsplit_mut");
925 a(v.splitn(n, p), b, f!("splitn, n = {n}"));
926 a(v.splitn_mut(n, p), b, f!("splitn_mut, n = {n}"));
927 a(v.rsplitn(n, p), b, f!("rsplitn, n = {n}"));
928 a(v.rsplitn_mut(n, p), b, f!("rsplitn_mut, n = {n}"));
935 fn test_windowsator() {
936 let v = &[1, 2, 3, 4];
938 let wins: &[&[_]] = &[&[1, 2], &[2, 3], &[3, 4]];
939 assert_eq!(v.windows(2).collect::<Vec<_>>(), wins);
941 let wins: &[&[_]] = &[&[1, 2, 3], &[2, 3, 4]];
942 assert_eq!(v.windows(3).collect::<Vec<_>>(), wins);
943 assert!(v.windows(6).next().is_none());
945 let wins: &[&[_]] = &[&[3, 4], &[2, 3], &[1, 2]];
946 assert_eq!(v.windows(2).rev().collect::<Vec<&[_]>>(), wins);
951 fn test_windowsator_0() {
952 let v = &[1, 2, 3, 4];
953 let _it = v.windows(0);
957 fn test_chunksator() {
958 let v = &[1, 2, 3, 4, 5];
960 assert_eq!(v.chunks(2).len(), 3);
962 let chunks: &[&[_]] = &[&[1, 2], &[3, 4], &[5]];
963 assert_eq!(v.chunks(2).collect::<Vec<_>>(), chunks);
964 let chunks: &[&[_]] = &[&[1, 2, 3], &[4, 5]];
965 assert_eq!(v.chunks(3).collect::<Vec<_>>(), chunks);
966 let chunks: &[&[_]] = &[&[1, 2, 3, 4, 5]];
967 assert_eq!(v.chunks(6).collect::<Vec<_>>(), chunks);
969 let chunks: &[&[_]] = &[&[5], &[3, 4], &[1, 2]];
970 assert_eq!(v.chunks(2).rev().collect::<Vec<_>>(), chunks);
975 fn test_chunksator_0() {
976 let v = &[1, 2, 3, 4];
977 let _it = v.chunks(0);
981 fn test_chunks_exactator() {
982 let v = &[1, 2, 3, 4, 5];
984 assert_eq!(v.chunks_exact(2).len(), 2);
986 let chunks: &[&[_]] = &[&[1, 2], &[3, 4]];
987 assert_eq!(v.chunks_exact(2).collect::<Vec<_>>(), chunks);
988 let chunks: &[&[_]] = &[&[1, 2, 3]];
989 assert_eq!(v.chunks_exact(3).collect::<Vec<_>>(), chunks);
990 let chunks: &[&[_]] = &[];
991 assert_eq!(v.chunks_exact(6).collect::<Vec<_>>(), chunks);
993 let chunks: &[&[_]] = &[&[3, 4], &[1, 2]];
994 assert_eq!(v.chunks_exact(2).rev().collect::<Vec<_>>(), chunks);
999 fn test_chunks_exactator_0() {
1000 let v = &[1, 2, 3, 4];
1001 let _it = v.chunks_exact(0);
1005 fn test_rchunksator() {
1006 let v = &[1, 2, 3, 4, 5];
1008 assert_eq!(v.rchunks(2).len(), 3);
1010 let chunks: &[&[_]] = &[&[4, 5], &[2, 3], &[1]];
1011 assert_eq!(v.rchunks(2).collect::<Vec<_>>(), chunks);
1012 let chunks: &[&[_]] = &[&[3, 4, 5], &[1, 2]];
1013 assert_eq!(v.rchunks(3).collect::<Vec<_>>(), chunks);
1014 let chunks: &[&[_]] = &[&[1, 2, 3, 4, 5]];
1015 assert_eq!(v.rchunks(6).collect::<Vec<_>>(), chunks);
1017 let chunks: &[&[_]] = &[&[1], &[2, 3], &[4, 5]];
1018 assert_eq!(v.rchunks(2).rev().collect::<Vec<_>>(), chunks);
1023 fn test_rchunksator_0() {
1024 let v = &[1, 2, 3, 4];
1025 let _it = v.rchunks(0);
1029 fn test_rchunks_exactator() {
1030 let v = &[1, 2, 3, 4, 5];
1032 assert_eq!(v.rchunks_exact(2).len(), 2);
1034 let chunks: &[&[_]] = &[&[4, 5], &[2, 3]];
1035 assert_eq!(v.rchunks_exact(2).collect::<Vec<_>>(), chunks);
1036 let chunks: &[&[_]] = &[&[3, 4, 5]];
1037 assert_eq!(v.rchunks_exact(3).collect::<Vec<_>>(), chunks);
1038 let chunks: &[&[_]] = &[];
1039 assert_eq!(v.rchunks_exact(6).collect::<Vec<_>>(), chunks);
1041 let chunks: &[&[_]] = &[&[2, 3], &[4, 5]];
1042 assert_eq!(v.rchunks_exact(2).rev().collect::<Vec<_>>(), chunks);
1047 fn test_rchunks_exactator_0() {
1048 let v = &[1, 2, 3, 4];
1049 let _it = v.rchunks_exact(0);
1053 fn test_reverse_part() {
1054 let mut values = [1, 2, 3, 4, 5];
1055 values[1..4].reverse();
1056 assert!(values == [1, 4, 3, 2, 5]);
1061 macro_rules! test_show_vec {
1062 ($x:expr, $x_str:expr) => {{
1063 let (x, x_str) = ($x, $x_str);
1064 assert_eq!(format!("{x:?}"), x_str);
1065 assert_eq!(format!("{x:?}"), x_str);
1068 let empty = Vec::<i32>::new();
1069 test_show_vec!(empty, "[]");
1070 test_show_vec!(vec![1], "[1]");
1071 test_show_vec!(vec![1, 2, 3], "[1, 2, 3]");
1072 test_show_vec!(vec![vec![], vec![1], vec![1, 1]], "[[], [1], [1, 1]]");
1074 let empty_mut: &mut [i32] = &mut [];
1075 test_show_vec!(empty_mut, "[]");
1077 test_show_vec!(v, "[1]");
1078 let v = &mut [1, 2, 3];
1079 test_show_vec!(v, "[1, 2, 3]");
1080 let v: &mut [&mut [_]] = &mut [&mut [], &mut [1], &mut [1, 1]];
1081 test_show_vec!(v, "[[], [1], [1, 1]]");
1085 fn test_vec_default() {
1088 let v: $ty = Default::default();
1089 assert!(v.is_empty());
1099 fn test_overflow_does_not_cause_segfault() {
1101 v.reserve_exact(!0);
1108 fn test_overflow_does_not_cause_segfault_managed() {
1109 let mut v = vec![Rc::new(1)];
1110 v.reserve_exact(!0);
1115 fn test_mut_split_at() {
1116 let mut values = [1, 2, 3, 4, 5];
1118 let (left, right) = values.split_at_mut(2);
1120 let left: &[_] = left;
1121 assert!(left[..left.len()] == [1, 2]);
1128 let right: &[_] = right;
1129 assert!(right[..right.len()] == [3, 4, 5]);
1136 assert!(values == [2, 3, 5, 6, 7]);
1139 #[derive(Clone, PartialEq)]
1143 fn test_iter_zero_sized() {
1144 let mut v = vec![Foo, Foo, Foo];
1145 assert_eq!(v.len(), 3);
1170 assert_eq!(cnt, 11);
1172 let xs: [Foo; 3] = [Foo, Foo, Foo];
1182 fn test_shrink_to_fit() {
1183 let mut xs = vec![0, 1, 2, 3];
1187 assert_eq!(xs.capacity(), 128);
1189 assert_eq!(xs.capacity(), 100);
1190 assert_eq!(xs, (0..100).collect::<Vec<_>>());
1194 fn test_starts_with() {
1195 assert!(b"foobar".starts_with(b"foo"));
1196 assert!(!b"foobar".starts_with(b"oob"));
1197 assert!(!b"foobar".starts_with(b"bar"));
1198 assert!(!b"foo".starts_with(b"foobar"));
1199 assert!(!b"bar".starts_with(b"foobar"));
1200 assert!(b"foobar".starts_with(b"foobar"));
1201 let empty: &[u8] = &[];
1202 assert!(empty.starts_with(empty));
1203 assert!(!empty.starts_with(b"foo"));
1204 assert!(b"foobar".starts_with(empty));
1208 fn test_ends_with() {
1209 assert!(b"foobar".ends_with(b"bar"));
1210 assert!(!b"foobar".ends_with(b"oba"));
1211 assert!(!b"foobar".ends_with(b"foo"));
1212 assert!(!b"foo".ends_with(b"foobar"));
1213 assert!(!b"bar".ends_with(b"foobar"));
1214 assert!(b"foobar".ends_with(b"foobar"));
1215 let empty: &[u8] = &[];
1216 assert!(empty.ends_with(empty));
1217 assert!(!empty.ends_with(b"foo"));
1218 assert!(b"foobar".ends_with(empty));
1222 fn test_mut_splitator() {
1223 let mut xs = [0, 1, 0, 2, 3, 0, 0, 4, 5, 0];
1224 assert_eq!(xs.split_mut(|x| *x == 0).count(), 6);
1225 for slice in xs.split_mut(|x| *x == 0) {
1228 assert!(xs == [0, 1, 0, 3, 2, 0, 0, 5, 4, 0]);
1230 let mut xs = [0, 1, 0, 2, 3, 0, 0, 4, 5, 0, 6, 7];
1231 for slice in xs.split_mut(|x| *x == 0).take(5) {
1234 assert!(xs == [0, 1, 0, 3, 2, 0, 0, 5, 4, 0, 6, 7]);
1238 fn test_mut_splitator_rev() {
1239 let mut xs = [1, 2, 0, 3, 4, 0, 0, 5, 6, 0];
1240 for slice in xs.split_mut(|x| *x == 0).rev().take(4) {
1243 assert!(xs == [1, 2, 0, 4, 3, 0, 0, 6, 5, 0]);
1248 let mut v = [0, 1, 2];
1249 assert_eq!(v.get_mut(3), None);
1250 v.get_mut(1).map(|e| *e = 7);
1251 assert_eq!(v[1], 7);
1253 assert_eq!(v.get_mut(2), Some(&mut x));
1257 fn test_mut_chunks() {
1258 let mut v = [0, 1, 2, 3, 4, 5, 6];
1259 assert_eq!(v.chunks_mut(3).len(), 3);
1260 for (i, chunk) in v.chunks_mut(3).enumerate() {
1265 let result = [0, 0, 0, 1, 1, 1, 2];
1266 assert_eq!(v, result);
1270 fn test_mut_chunks_rev() {
1271 let mut v = [0, 1, 2, 3, 4, 5, 6];
1272 for (i, chunk) in v.chunks_mut(3).rev().enumerate() {
1277 let result = [2, 2, 2, 1, 1, 1, 0];
1278 assert_eq!(v, result);
1283 fn test_mut_chunks_0() {
1284 let mut v = [1, 2, 3, 4];
1285 let _it = v.chunks_mut(0);
1289 fn test_mut_chunks_exact() {
1290 let mut v = [0, 1, 2, 3, 4, 5, 6];
1291 assert_eq!(v.chunks_exact_mut(3).len(), 2);
1292 for (i, chunk) in v.chunks_exact_mut(3).enumerate() {
1297 let result = [0, 0, 0, 1, 1, 1, 6];
1298 assert_eq!(v, result);
1302 fn test_mut_chunks_exact_rev() {
1303 let mut v = [0, 1, 2, 3, 4, 5, 6];
1304 for (i, chunk) in v.chunks_exact_mut(3).rev().enumerate() {
1309 let result = [1, 1, 1, 0, 0, 0, 6];
1310 assert_eq!(v, result);
1315 fn test_mut_chunks_exact_0() {
1316 let mut v = [1, 2, 3, 4];
1317 let _it = v.chunks_exact_mut(0);
1321 fn test_mut_rchunks() {
1322 let mut v = [0, 1, 2, 3, 4, 5, 6];
1323 assert_eq!(v.rchunks_mut(3).len(), 3);
1324 for (i, chunk) in v.rchunks_mut(3).enumerate() {
1329 let result = [2, 1, 1, 1, 0, 0, 0];
1330 assert_eq!(v, result);
1334 fn test_mut_rchunks_rev() {
1335 let mut v = [0, 1, 2, 3, 4, 5, 6];
1336 for (i, chunk) in v.rchunks_mut(3).rev().enumerate() {
1341 let result = [0, 1, 1, 1, 2, 2, 2];
1342 assert_eq!(v, result);
1347 fn test_mut_rchunks_0() {
1348 let mut v = [1, 2, 3, 4];
1349 let _it = v.rchunks_mut(0);
1353 fn test_mut_rchunks_exact() {
1354 let mut v = [0, 1, 2, 3, 4, 5, 6];
1355 assert_eq!(v.rchunks_exact_mut(3).len(), 2);
1356 for (i, chunk) in v.rchunks_exact_mut(3).enumerate() {
1361 let result = [0, 1, 1, 1, 0, 0, 0];
1362 assert_eq!(v, result);
1366 fn test_mut_rchunks_exact_rev() {
1367 let mut v = [0, 1, 2, 3, 4, 5, 6];
1368 for (i, chunk) in v.rchunks_exact_mut(3).rev().enumerate() {
1373 let result = [0, 0, 0, 0, 1, 1, 1];
1374 assert_eq!(v, result);
1379 fn test_mut_rchunks_exact_0() {
1380 let mut v = [1, 2, 3, 4];
1381 let _it = v.rchunks_exact_mut(0);
1385 fn test_mut_last() {
1386 let mut x = [1, 2, 3, 4, 5];
1387 let h = x.last_mut();
1388 assert_eq!(*h.unwrap(), 5);
1390 let y: &mut [i32] = &mut [];
1391 assert!(y.last_mut().is_none());
1396 let xs: Box<_> = Box::new([1, 2, 3]);
1397 let ys = xs.to_vec();
1398 assert_eq!(ys, [1, 2, 3]);
1402 fn test_in_place_iterator_specialization() {
1403 let src: Box<[usize]> = Box::new([1, 2, 3]);
1404 let src_ptr = src.as_ptr();
1405 let sink: Box<_> = src.into_vec().into_iter().map(std::convert::identity).collect();
1406 let sink_ptr = sink.as_ptr();
1407 assert_eq!(src_ptr, sink_ptr);
1411 fn test_box_slice_clone() {
1412 let data = vec![vec![0, 1], vec![0], vec![1]];
1413 let data2 = data.clone().into_boxed_slice().clone().to_vec();
1415 assert_eq!(data, data2);
1419 #[allow(unused_must_use)] // here, we care about the side effects of `.clone()`
1420 #[cfg_attr(target_os = "emscripten", ignore)]
1421 fn test_box_slice_clone_panics() {
1422 use std::sync::atomic::{AtomicUsize, Ordering};
1426 count: Arc<AtomicUsize>,
1430 impl Drop for Canary {
1431 fn drop(&mut self) {
1432 self.count.fetch_add(1, Ordering::SeqCst);
1436 impl Clone for Canary {
1437 fn clone(&self) -> Self {
1442 Canary { count: self.count.clone(), panics: self.panics }
1446 let drop_count = Arc::new(AtomicUsize::new(0));
1447 let canary = Canary { count: drop_count.clone(), panics: false };
1448 let panic = Canary { count: drop_count.clone(), panics: true };
1450 std::panic::catch_unwind(move || {
1451 // When xs is dropped, +5.
1453 vec![canary.clone(), canary.clone(), canary.clone(), panic, canary].into_boxed_slice();
1455 // When panic is cloned, +3.
1461 assert_eq!(drop_count.load(Ordering::SeqCst), 8);
1465 fn test_copy_from_slice() {
1466 let src = [0, 1, 2, 3, 4, 5];
1467 let mut dst = [0; 6];
1468 dst.copy_from_slice(&src);
1469 assert_eq!(src, dst)
1473 #[should_panic(expected = "source slice length (4) does not match destination slice length (5)")]
1474 fn test_copy_from_slice_dst_longer() {
1475 let src = [0, 1, 2, 3];
1476 let mut dst = [0; 5];
1477 dst.copy_from_slice(&src);
1481 #[should_panic(expected = "source slice length (4) does not match destination slice length (3)")]
1482 fn test_copy_from_slice_dst_shorter() {
1483 let src = [0, 1, 2, 3];
1484 let mut dst = [0; 3];
1485 dst.copy_from_slice(&src);
1489 fn repeat_generic_slice() {
1490 assert_eq!([1, 2].repeat(2), vec![1, 2, 1, 2]);
1491 assert_eq!([1, 2, 3, 4].repeat(0), vec![]);
1492 assert_eq!([1, 2, 3, 4].repeat(1), vec![1, 2, 3, 4]);
1493 assert_eq!([1, 2, 3, 4].repeat(3), vec![1, 2, 3, 4, 1, 2, 3, 4, 1, 2, 3, 4]);
1497 #[allow(unreachable_patterns)]
1498 fn subslice_patterns() {
1499 // This test comprehensively checks the passing static and dynamic semantics
1500 // of subslice patterns `..`, `x @ ..`, `ref x @ ..`, and `ref mut @ ..`
1501 // in slice patterns `[$($pat), $(,)?]` .
1503 #[derive(PartialEq, Debug, Clone)]
1507 ($($e:expr),* $(,)?) => {
1513 ($inp:expr, $typ:ty, $out:expr $(,)?) => {
1514 assert_eq!($out, identity::<$typ>($inp))
1519 ($e:expr, $p:pat => $b:expr) => {
1529 // Matching slices using `ref` patterns:
1530 let mut v = vec![N(0), N(1), N(2), N(3), N(4)];
1531 let mut vc = (0..=4).collect::<Vec<u8>>();
1533 let [..] = v[..]; // Always matches.
1534 m!(v[..], [N(0), ref sub @ .., N(4)] => c!(sub, &[N], n![1, 2, 3]));
1535 m!(v[..], [N(0), ref sub @ ..] => c!(sub, &[N], n![1, 2, 3, 4]));
1536 m!(v[..], [ref sub @ .., N(4)] => c!(sub, &[N], n![0, 1, 2, 3]));
1537 m!(v[..], [ref sub @ .., _, _, _, _, _] => c!(sub, &[N], &n![] as &[N]));
1538 m!(v[..], [_, _, _, _, _, ref sub @ ..] => c!(sub, &[N], &n![] as &[N]));
1539 m!(vc[..], [x, .., y] => c!((x, y), (u8, u8), (0, 4)));
1541 // Matching slices using `ref mut` patterns:
1542 let [..] = v[..]; // Always matches.
1543 m!(v[..], [N(0), ref mut sub @ .., N(4)] => c!(sub, &mut [N], n![1, 2, 3]));
1544 m!(v[..], [N(0), ref mut sub @ ..] => c!(sub, &mut [N], n![1, 2, 3, 4]));
1545 m!(v[..], [ref mut sub @ .., N(4)] => c!(sub, &mut [N], n![0, 1, 2, 3]));
1546 m!(v[..], [ref mut sub @ .., _, _, _, _, _] => c!(sub, &mut [N], &mut n![] as &mut [N]));
1547 m!(v[..], [_, _, _, _, _, ref mut sub @ ..] => c!(sub, &mut [N], &mut n![] as &mut [N]));
1548 m!(vc[..], [x, .., y] => c!((x, y), (u8, u8), (0, 4)));
1550 // Matching slices using default binding modes (&):
1551 let [..] = &v[..]; // Always matches.
1552 m!(&v[..], [N(0), sub @ .., N(4)] => c!(sub, &[N], n![1, 2, 3]));
1553 m!(&v[..], [N(0), sub @ ..] => c!(sub, &[N], n![1, 2, 3, 4]));
1554 m!(&v[..], [sub @ .., N(4)] => c!(sub, &[N], n![0, 1, 2, 3]));
1555 m!(&v[..], [sub @ .., _, _, _, _, _] => c!(sub, &[N], &n![] as &[N]));
1556 m!(&v[..], [_, _, _, _, _, sub @ ..] => c!(sub, &[N], &n![] as &[N]));
1557 m!(&vc[..], [x, .., y] => c!((x, y), (&u8, &u8), (&0, &4)));
1559 // Matching slices using default binding modes (&mut):
1560 let [..] = &mut v[..]; // Always matches.
1561 m!(&mut v[..], [N(0), sub @ .., N(4)] => c!(sub, &mut [N], n![1, 2, 3]));
1562 m!(&mut v[..], [N(0), sub @ ..] => c!(sub, &mut [N], n![1, 2, 3, 4]));
1563 m!(&mut v[..], [sub @ .., N(4)] => c!(sub, &mut [N], n![0, 1, 2, 3]));
1564 m!(&mut v[..], [sub @ .., _, _, _, _, _] => c!(sub, &mut [N], &mut n![] as &mut [N]));
1565 m!(&mut v[..], [_, _, _, _, _, sub @ ..] => c!(sub, &mut [N], &mut n![] as &mut [N]));
1566 m!(&mut vc[..], [x, .., y] => c!((x, y), (&mut u8, &mut u8), (&mut 0, &mut 4)));
1569 let mut v = n![0, 1, 2, 3, 4];
1570 let vc = [0, 1, 2, 3, 4];
1572 // Matching arrays by value:
1573 m!(v.clone(), [N(0), sub @ .., N(4)] => c!(sub, [N; 3], n![1, 2, 3]));
1574 m!(v.clone(), [N(0), sub @ ..] => c!(sub, [N; 4], n![1, 2, 3, 4]));
1575 m!(v.clone(), [sub @ .., N(4)] => c!(sub, [N; 4], n![0, 1, 2, 3]));
1576 m!(v.clone(), [sub @ .., _, _, _, _, _] => c!(sub, [N; 0], n![] as [N; 0]));
1577 m!(v.clone(), [_, _, _, _, _, sub @ ..] => c!(sub, [N; 0], n![] as [N; 0]));
1578 m!(v.clone(), [x, .., y] => c!((x, y), (N, N), (N(0), N(4))));
1579 m!(v.clone(), [..] => ());
1581 // Matching arrays by ref patterns:
1582 m!(v, [N(0), ref sub @ .., N(4)] => c!(sub, &[N; 3], &n![1, 2, 3]));
1583 m!(v, [N(0), ref sub @ ..] => c!(sub, &[N; 4], &n![1, 2, 3, 4]));
1584 m!(v, [ref sub @ .., N(4)] => c!(sub, &[N; 4], &n![0, 1, 2, 3]));
1585 m!(v, [ref sub @ .., _, _, _, _, _] => c!(sub, &[N; 0], &n![] as &[N; 0]));
1586 m!(v, [_, _, _, _, _, ref sub @ ..] => c!(sub, &[N; 0], &n![] as &[N; 0]));
1587 m!(vc, [x, .., y] => c!((x, y), (u8, u8), (0, 4)));
1589 // Matching arrays by ref mut patterns:
1590 m!(v, [N(0), ref mut sub @ .., N(4)] => c!(sub, &mut [N; 3], &mut n![1, 2, 3]));
1591 m!(v, [N(0), ref mut sub @ ..] => c!(sub, &mut [N; 4], &mut n![1, 2, 3, 4]));
1592 m!(v, [ref mut sub @ .., N(4)] => c!(sub, &mut [N; 4], &mut n![0, 1, 2, 3]));
1593 m!(v, [ref mut sub @ .., _, _, _, _, _] => c!(sub, &mut [N; 0], &mut n![] as &mut [N; 0]));
1594 m!(v, [_, _, _, _, _, ref mut sub @ ..] => c!(sub, &mut [N; 0], &mut n![] as &mut [N; 0]));
1596 // Matching arrays by default binding modes (&):
1597 m!(&v, [N(0), sub @ .., N(4)] => c!(sub, &[N; 3], &n![1, 2, 3]));
1598 m!(&v, [N(0), sub @ ..] => c!(sub, &[N; 4], &n![1, 2, 3, 4]));
1599 m!(&v, [sub @ .., N(4)] => c!(sub, &[N; 4], &n![0, 1, 2, 3]));
1600 m!(&v, [sub @ .., _, _, _, _, _] => c!(sub, &[N; 0], &n![] as &[N; 0]));
1601 m!(&v, [_, _, _, _, _, sub @ ..] => c!(sub, &[N; 0], &n![] as &[N; 0]));
1603 m!(&v, [x, .., y] => c!((x, y), (&N, &N), (&N(0), &N(4))));
1605 // Matching arrays by default binding modes (&mut):
1606 m!(&mut v, [N(0), sub @ .., N(4)] => c!(sub, &mut [N; 3], &mut n![1, 2, 3]));
1607 m!(&mut v, [N(0), sub @ ..] => c!(sub, &mut [N; 4], &mut n![1, 2, 3, 4]));
1608 m!(&mut v, [sub @ .., N(4)] => c!(sub, &mut [N; 4], &mut n![0, 1, 2, 3]));
1609 m!(&mut v, [sub @ .., _, _, _, _, _] => c!(sub, &mut [N; 0], &mut n![] as &[N; 0]));
1610 m!(&mut v, [_, _, _, _, _, sub @ ..] => c!(sub, &mut [N; 0], &mut n![] as &[N; 0]));
1611 m!(&mut v, [..] => ());
1612 m!(&mut v, [x, .., y] => c!((x, y), (&mut N, &mut N), (&mut N(0), &mut N(4))));
1616 fn test_group_by() {
1617 let slice = &[1, 1, 1, 3, 3, 2, 2, 2, 1, 0];
1619 let mut iter = slice.group_by(|a, b| a == b);
1620 assert_eq!(iter.next(), Some(&[1, 1, 1][..]));
1621 assert_eq!(iter.next(), Some(&[3, 3][..]));
1622 assert_eq!(iter.next(), Some(&[2, 2, 2][..]));
1623 assert_eq!(iter.next(), Some(&[1][..]));
1624 assert_eq!(iter.next(), Some(&[0][..]));
1625 assert_eq!(iter.next(), None);
1627 let mut iter = slice.group_by(|a, b| a == b);
1628 assert_eq!(iter.next_back(), Some(&[0][..]));
1629 assert_eq!(iter.next_back(), Some(&[1][..]));
1630 assert_eq!(iter.next_back(), Some(&[2, 2, 2][..]));
1631 assert_eq!(iter.next_back(), Some(&[3, 3][..]));
1632 assert_eq!(iter.next_back(), Some(&[1, 1, 1][..]));
1633 assert_eq!(iter.next_back(), None);
1635 let mut iter = slice.group_by(|a, b| a == b);
1636 assert_eq!(iter.next(), Some(&[1, 1, 1][..]));
1637 assert_eq!(iter.next_back(), Some(&[0][..]));
1638 assert_eq!(iter.next(), Some(&[3, 3][..]));
1639 assert_eq!(iter.next_back(), Some(&[1][..]));
1640 assert_eq!(iter.next(), Some(&[2, 2, 2][..]));
1641 assert_eq!(iter.next_back(), None);
1645 fn test_group_by_mut() {
1646 let slice = &mut [1, 1, 1, 3, 3, 2, 2, 2, 1, 0];
1648 let mut iter = slice.group_by_mut(|a, b| a == b);
1649 assert_eq!(iter.next(), Some(&mut [1, 1, 1][..]));
1650 assert_eq!(iter.next(), Some(&mut [3, 3][..]));
1651 assert_eq!(iter.next(), Some(&mut [2, 2, 2][..]));
1652 assert_eq!(iter.next(), Some(&mut [1][..]));
1653 assert_eq!(iter.next(), Some(&mut [0][..]));
1654 assert_eq!(iter.next(), None);
1656 let mut iter = slice.group_by_mut(|a, b| a == b);
1657 assert_eq!(iter.next_back(), Some(&mut [0][..]));
1658 assert_eq!(iter.next_back(), Some(&mut [1][..]));
1659 assert_eq!(iter.next_back(), Some(&mut [2, 2, 2][..]));
1660 assert_eq!(iter.next_back(), Some(&mut [3, 3][..]));
1661 assert_eq!(iter.next_back(), Some(&mut [1, 1, 1][..]));
1662 assert_eq!(iter.next_back(), None);
1664 let mut iter = slice.group_by_mut(|a, b| a == b);
1665 assert_eq!(iter.next(), Some(&mut [1, 1, 1][..]));
1666 assert_eq!(iter.next_back(), Some(&mut [0][..]));
1667 assert_eq!(iter.next(), Some(&mut [3, 3][..]));
1668 assert_eq!(iter.next_back(), Some(&mut [1][..]));
1669 assert_eq!(iter.next(), Some(&mut [2, 2, 2][..]));
1670 assert_eq!(iter.next_back(), None);