3 use std::collections::TryReserveError::*;
5 use std::iter::InPlaceIterable;
6 use std::mem::{size_of, swap};
7 use std::ops::Bound::*;
8 use std::panic::{catch_unwind, AssertUnwindSafe};
10 use std::vec::{Drain, IntoIter};
12 struct DropCounter<'a> {
16 impl Drop for DropCounter<'_> {
23 fn test_small_vec_struct() {
24 assert_eq!(size_of::<Vec<u8>>(), size_of::<usize>() * 3);
28 fn test_double_drop() {
34 let (mut count_x, mut count_y) = (0, 0);
36 let mut tv = TwoVec { x: Vec::new(), y: Vec::new() };
37 tv.x.push(DropCounter { count: &mut count_x });
38 tv.y.push(DropCounter { count: &mut count_y });
40 // If Vec had a drop flag, here is where it would be zeroed.
41 // Instead, it should rely on its internal state to prevent
42 // doing anything significant when dropped multiple times.
45 // Here tv goes out of scope, tv.y should be dropped, but not tv.x.
48 assert_eq!(count_x, 1);
49 assert_eq!(count_y, 1);
54 let mut v = Vec::new();
55 assert_eq!(v.capacity(), 0);
58 assert!(v.capacity() >= 2);
64 assert!(v.capacity() >= 16);
66 assert!(v.capacity() >= 32);
71 assert!(v.capacity() >= 33)
75 fn test_zst_capacity() {
76 assert_eq!(Vec::<()>::new().capacity(), usize::MAX);
81 let v: Vec<isize> = vec![10, 20];
86 assert_eq!(v[x + 1], 20);
89 assert_eq!(v[x - 1], 10);
94 let vec1: Vec<isize> = vec![];
95 assert_eq!("[]", format!("{:?}", vec1));
97 let vec2 = vec![0, 1];
98 assert_eq!("[0, 1]", format!("{:?}", vec2));
100 let slice: &[isize] = &[4, 5];
101 assert_eq!("[4, 5]", format!("{:?}", slice));
110 assert_eq!(v, [1, 2]);
112 assert_eq!(v, [1, 2, 3]);
117 let mut v = Vec::new();
118 let mut w = Vec::new();
137 v.extend(w.clone()); // specializes to `append`
138 assert!(v.iter().eq(w.iter().chain(w.iter())));
141 #[derive(PartialEq, Debug)]
144 let mut a = Vec::new();
145 let b = vec![Foo, Foo];
148 assert_eq!(a, &[Foo, Foo]);
153 let mut x = Vec::new();
154 let y = vec![DropCounter { count: &mut count_x }];
157 assert_eq!(count_x, 1);
161 fn test_extend_from_slice() {
162 let a: Vec<isize> = vec![1, 2, 3, 4, 5];
163 let b: Vec<isize> = vec![6, 7, 8, 9, 0];
165 let mut v: Vec<isize> = a;
167 v.extend_from_slice(&b);
169 assert_eq!(v, [1, 2, 3, 4, 5, 6, 7, 8, 9, 0]);
173 fn test_extend_ref() {
174 let mut v = vec![1, 2];
175 v.extend(&[3, 4, 5]);
177 assert_eq!(v.len(), 5);
178 assert_eq!(v, [1, 2, 3, 4, 5]);
183 assert_eq!(v.len(), 7);
184 assert_eq!(v, [1, 2, 3, 4, 5, 6, 7]);
188 fn test_slice_from_ref() {
189 let values = vec![1, 2, 3, 4, 5];
190 let slice = &values[1..3];
192 assert_eq!(slice, [2, 3]);
196 fn test_slice_from_mut() {
197 let mut values = vec![1, 2, 3, 4, 5];
199 let slice = &mut values[2..];
200 assert!(slice == [3, 4, 5]);
206 assert!(values == [1, 2, 5, 6, 7]);
210 fn test_slice_to_mut() {
211 let mut values = vec![1, 2, 3, 4, 5];
213 let slice = &mut values[..2];
214 assert!(slice == [1, 2]);
220 assert!(values == [2, 3, 3, 4, 5]);
224 fn test_split_at_mut() {
225 let mut values = vec![1, 2, 3, 4, 5];
227 let (left, right) = values.split_at_mut(2);
229 let left: &[_] = left;
230 assert!(&left[..left.len()] == &[1, 2]);
237 let right: &[_] = right;
238 assert!(&right[..right.len()] == &[3, 4, 5]);
245 assert_eq!(values, [2, 3, 5, 6, 7]);
250 let v: Vec<i32> = vec![];
251 let w = vec![1, 2, 3];
253 assert_eq!(v, v.clone());
257 // they should be disjoint in memory.
258 assert!(w.as_ptr() != z.as_ptr())
262 fn test_clone_from() {
264 let three: Vec<Box<_>> = vec![box 1, box 2, box 3];
265 let two: Vec<Box<_>> = vec![box 4, box 5];
267 v.clone_from(&three);
268 assert_eq!(v, three);
271 v.clone_from(&three);
272 assert_eq!(v, three);
279 v.clone_from(&three);
285 let mut vec = vec![1, 2, 3, 4];
286 vec.retain(|&x| x % 2 == 0);
287 assert_eq!(vec, [2, 4]);
291 fn test_retain_pred_panic_with_hole() {
292 let v = (0..5).map(Rc::new).collect::<Vec<_>>();
293 catch_unwind(AssertUnwindSafe(|| {
294 let mut v = v.clone();
295 v.retain(|r| match **r {
303 // Everything is dropped when predicate panicked.
304 assert!(v.iter().all(|r| Rc::strong_count(r) == 1));
308 fn test_retain_pred_panic_no_hole() {
309 let v = (0..5).map(Rc::new).collect::<Vec<_>>();
310 catch_unwind(AssertUnwindSafe(|| {
311 let mut v = v.clone();
312 v.retain(|r| match **r {
318 // Everything is dropped when predicate panicked.
319 assert!(v.iter().all(|r| Rc::strong_count(r) == 1));
323 fn test_retain_drop_panic() {
324 struct Wrap(Rc<i32>);
334 let v = (0..5).map(|x| Rc::new(x)).collect::<Vec<_>>();
335 catch_unwind(AssertUnwindSafe(|| {
336 let mut v = v.iter().map(|r| Wrap(r.clone())).collect::<Vec<_>>();
337 v.retain(|w| match *w.0 {
341 3 => false, // Drop panic.
346 // Other elements are dropped when `drop` of one element panicked.
347 // The panicked wrapper also has its Rc dropped.
348 assert!(v.iter().all(|r| Rc::strong_count(r) == 1));
353 fn case(a: Vec<i32>, b: Vec<i32>) {
358 case(vec![], vec![]);
359 case(vec![1], vec![1]);
360 case(vec![1, 1], vec![1]);
361 case(vec![1, 2, 3], vec![1, 2, 3]);
362 case(vec![1, 1, 2, 3], vec![1, 2, 3]);
363 case(vec![1, 2, 2, 3], vec![1, 2, 3]);
364 case(vec![1, 2, 3, 3], vec![1, 2, 3]);
365 case(vec![1, 1, 2, 2, 2, 3, 3], vec![1, 2, 3]);
369 fn test_dedup_by_key() {
370 fn case(a: Vec<i32>, b: Vec<i32>) {
372 v.dedup_by_key(|i| *i / 10);
375 case(vec![], vec![]);
376 case(vec![10], vec![10]);
377 case(vec![10, 11], vec![10]);
378 case(vec![10, 20, 30], vec![10, 20, 30]);
379 case(vec![10, 11, 20, 30], vec![10, 20, 30]);
380 case(vec![10, 20, 21, 30], vec![10, 20, 30]);
381 case(vec![10, 20, 30, 31], vec![10, 20, 30]);
382 case(vec![10, 11, 20, 21, 22, 30, 31], vec![10, 20, 30]);
387 let mut vec = vec!["foo", "bar", "Bar", "baz", "bar"];
388 vec.dedup_by(|a, b| a.eq_ignore_ascii_case(b));
390 assert_eq!(vec, ["foo", "bar", "baz", "bar"]);
392 let mut vec = vec![("foo", 1), ("foo", 2), ("bar", 3), ("bar", 4), ("bar", 5)];
393 vec.dedup_by(|a, b| {
400 assert_eq!(vec, [("foo", 3), ("bar", 12)]);
404 fn test_dedup_unique() {
405 let mut v0: Vec<Box<_>> = vec![box 1, box 1, box 2, box 3];
407 let mut v1: Vec<Box<_>> = vec![box 1, box 2, box 2, box 3];
409 let mut v2: Vec<Box<_>> = vec![box 1, box 2, box 3, box 3];
411 // If the boxed pointers were leaked or otherwise misused, valgrind
412 // and/or rt should raise errors.
416 fn zero_sized_values() {
417 let mut v = Vec::new();
418 assert_eq!(v.len(), 0);
420 assert_eq!(v.len(), 1);
422 assert_eq!(v.len(), 2);
423 assert_eq!(v.pop(), Some(()));
424 assert_eq!(v.pop(), Some(()));
425 assert_eq!(v.pop(), None);
427 assert_eq!(v.iter().count(), 0);
429 assert_eq!(v.iter().count(), 1);
431 assert_eq!(v.iter().count(), 2);
435 assert_eq!(v.iter_mut().count(), 2);
437 assert_eq!(v.iter_mut().count(), 3);
439 assert_eq!(v.iter_mut().count(), 4);
441 for &mut () in &mut v {}
445 assert_eq!(v.iter_mut().count(), 0);
449 fn test_partition() {
450 assert_eq!(vec![].into_iter().partition(|x: &i32| *x < 3), (vec![], vec![]));
451 assert_eq!(vec![1, 2, 3].into_iter().partition(|x| *x < 4), (vec![1, 2, 3], vec![]));
452 assert_eq!(vec![1, 2, 3].into_iter().partition(|x| *x < 2), (vec![1], vec![2, 3]));
453 assert_eq!(vec![1, 2, 3].into_iter().partition(|x| *x < 0), (vec![], vec![1, 2, 3]));
457 fn test_zip_unzip() {
458 let z1 = vec![(1, 4), (2, 5), (3, 6)];
460 let (left, right): (Vec<_>, Vec<_>) = z1.iter().cloned().unzip();
462 assert_eq!((1, 4), (left[0], right[0]));
463 assert_eq!((2, 5), (left[1], right[1]));
464 assert_eq!((3, 6), (left[2], right[2]));
469 let x: &[isize] = &[1, 2, 3, 4, 5];
470 let cmp: &[isize] = &[1, 2, 3, 4, 5];
471 assert_eq!(&x[..], cmp);
472 let cmp: &[isize] = &[3, 4, 5];
473 assert_eq!(&x[2..], cmp);
474 let cmp: &[isize] = &[1, 2, 3];
475 assert_eq!(&x[..3], cmp);
476 let cmp: &[isize] = &[2, 3, 4];
477 assert_eq!(&x[1..4], cmp);
479 let x: Vec<isize> = vec![1, 2, 3, 4, 5];
480 let cmp: &[isize] = &[1, 2, 3, 4, 5];
481 assert_eq!(&x[..], cmp);
482 let cmp: &[isize] = &[3, 4, 5];
483 assert_eq!(&x[2..], cmp);
484 let cmp: &[isize] = &[1, 2, 3];
485 assert_eq!(&x[..3], cmp);
486 let cmp: &[isize] = &[2, 3, 4];
487 assert_eq!(&x[1..4], cmp);
491 fn test_vec_truncate_drop() {
492 static mut DROPS: u32 = 0;
502 let mut v = vec![Elem(1), Elem(2), Elem(3), Elem(4), Elem(5)];
503 assert_eq!(unsafe { DROPS }, 0);
505 assert_eq!(unsafe { DROPS }, 2);
507 assert_eq!(unsafe { DROPS }, 5);
512 fn test_vec_truncate_fail() {
514 impl Drop for BadElem {
516 let BadElem(ref mut x) = *self;
518 panic!("BadElem panic: 0xbadbeef")
523 let mut v = vec![BadElem(1), BadElem(2), BadElem(0xbadbeef), BadElem(4)];
529 let vec = vec![1, 2, 3];
530 assert!(vec[1] == 2);
535 fn test_index_out_of_bounds() {
536 let vec = vec![1, 2, 3];
542 fn test_slice_out_of_bounds_1() {
543 let x = vec![1, 2, 3, 4, 5];
549 fn test_slice_out_of_bounds_2() {
550 let x = vec![1, 2, 3, 4, 5];
556 fn test_slice_out_of_bounds_3() {
557 let x = vec![1, 2, 3, 4, 5];
563 fn test_slice_out_of_bounds_4() {
564 let x = vec![1, 2, 3, 4, 5];
570 fn test_slice_out_of_bounds_5() {
571 let x = vec![1, 2, 3, 4, 5];
577 fn test_swap_remove_empty() {
578 let mut vec = Vec::<i32>::new();
583 fn test_move_items() {
584 let vec = vec![1, 2, 3];
585 let mut vec2 = vec![];
589 assert_eq!(vec2, [1, 2, 3]);
593 fn test_move_items_reverse() {
594 let vec = vec![1, 2, 3];
595 let mut vec2 = vec![];
596 for i in vec.into_iter().rev() {
599 assert_eq!(vec2, [3, 2, 1]);
603 fn test_move_items_zero_sized() {
604 let vec = vec![(), (), ()];
605 let mut vec2 = vec![];
609 assert_eq!(vec2, [(), (), ()]);
613 fn test_drain_empty_vec() {
614 let mut vec: Vec<i32> = vec![];
615 let mut vec2: Vec<i32> = vec![];
616 for i in vec.drain(..) {
619 assert!(vec.is_empty());
620 assert!(vec2.is_empty());
624 fn test_drain_items() {
625 let mut vec = vec![1, 2, 3];
626 let mut vec2 = vec![];
627 for i in vec.drain(..) {
631 assert_eq!(vec2, [1, 2, 3]);
635 fn test_drain_items_reverse() {
636 let mut vec = vec![1, 2, 3];
637 let mut vec2 = vec![];
638 for i in vec.drain(..).rev() {
642 assert_eq!(vec2, [3, 2, 1]);
646 fn test_drain_items_zero_sized() {
647 let mut vec = vec![(), (), ()];
648 let mut vec2 = vec![];
649 for i in vec.drain(..) {
653 assert_eq!(vec2, [(), (), ()]);
658 fn test_drain_out_of_bounds() {
659 let mut v = vec![1, 2, 3, 4, 5];
664 fn test_drain_range() {
665 let mut v = vec![1, 2, 3, 4, 5];
666 for _ in v.drain(4..) {}
667 assert_eq!(v, &[1, 2, 3, 4]);
669 let mut v: Vec<_> = (1..6).map(|x| x.to_string()).collect();
670 for _ in v.drain(1..4) {}
671 assert_eq!(v, &[1.to_string(), 5.to_string()]);
673 let mut v: Vec<_> = (1..6).map(|x| x.to_string()).collect();
674 for _ in v.drain(1..4).rev() {}
675 assert_eq!(v, &[1.to_string(), 5.to_string()]);
677 let mut v: Vec<_> = vec![(); 5];
678 for _ in v.drain(1..4).rev() {}
679 assert_eq!(v, &[(), ()]);
683 fn test_drain_inclusive_range() {
684 let mut v = vec!['a', 'b', 'c', 'd', 'e'];
685 for _ in v.drain(1..=3) {}
686 assert_eq!(v, &['a', 'e']);
688 let mut v: Vec<_> = (0..=5).map(|x| x.to_string()).collect();
689 for _ in v.drain(1..=5) {}
690 assert_eq!(v, &["0".to_string()]);
692 let mut v: Vec<String> = (0..=5).map(|x| x.to_string()).collect();
693 for _ in v.drain(0..=5) {}
694 assert_eq!(v, Vec::<String>::new());
696 let mut v: Vec<_> = (0..=5).map(|x| x.to_string()).collect();
697 for _ in v.drain(0..=3) {}
698 assert_eq!(v, &["4".to_string(), "5".to_string()]);
700 let mut v: Vec<_> = (0..=1).map(|x| x.to_string()).collect();
701 for _ in v.drain(..=0) {}
702 assert_eq!(v, &["1".to_string()]);
706 fn test_drain_max_vec_size() {
707 let mut v = Vec::<()>::with_capacity(usize::MAX);
709 v.set_len(usize::MAX);
711 for _ in v.drain(usize::MAX - 1..) {}
712 assert_eq!(v.len(), usize::MAX - 1);
714 let mut v = Vec::<()>::with_capacity(usize::MAX);
716 v.set_len(usize::MAX);
718 for _ in v.drain(usize::MAX - 1..=usize::MAX - 1) {}
719 assert_eq!(v.len(), usize::MAX - 1);
724 fn test_drain_index_overflow() {
725 let mut v = Vec::<()>::with_capacity(usize::MAX);
727 v.set_len(usize::MAX);
729 v.drain(0..=usize::MAX);
734 fn test_drain_inclusive_out_of_bounds() {
735 let mut v = vec![1, 2, 3, 4, 5];
741 fn test_drain_start_overflow() {
742 let mut v = vec![1, 2, 3];
743 v.drain((Excluded(usize::MAX), Included(0)));
748 fn test_drain_end_overflow() {
749 let mut v = vec![1, 2, 3];
750 v.drain((Included(0), Included(usize::MAX)));
754 fn test_drain_leak() {
755 static mut DROPS: i32 = 0;
757 #[derive(Debug, PartialEq)]
767 panic!("panic in `drop`");
782 catch_unwind(AssertUnwindSafe(|| {
787 assert_eq!(unsafe { DROPS }, 4);
788 assert_eq!(v, vec![D(0, false), D(1, false), D(6, false),]);
793 let mut v = vec![1, 2, 3, 4, 5];
794 let a = [10, 11, 12];
795 v.splice(2..4, a.iter().cloned());
796 assert_eq!(v, &[1, 2, 10, 11, 12, 5]);
797 v.splice(1..3, Some(20));
798 assert_eq!(v, &[1, 20, 11, 12, 5]);
802 fn test_splice_inclusive_range() {
803 let mut v = vec![1, 2, 3, 4, 5];
804 let a = [10, 11, 12];
805 let t1: Vec<_> = v.splice(2..=3, a.iter().cloned()).collect();
806 assert_eq!(v, &[1, 2, 10, 11, 12, 5]);
807 assert_eq!(t1, &[3, 4]);
808 let t2: Vec<_> = v.splice(1..=2, Some(20)).collect();
809 assert_eq!(v, &[1, 20, 11, 12, 5]);
810 assert_eq!(t2, &[2, 10]);
815 fn test_splice_out_of_bounds() {
816 let mut v = vec![1, 2, 3, 4, 5];
817 let a = [10, 11, 12];
818 v.splice(5..6, a.iter().cloned());
823 fn test_splice_inclusive_out_of_bounds() {
824 let mut v = vec![1, 2, 3, 4, 5];
825 let a = [10, 11, 12];
826 v.splice(5..=5, a.iter().cloned());
830 fn test_splice_items_zero_sized() {
831 let mut vec = vec![(), (), ()];
833 let t: Vec<_> = vec.splice(1..2, vec2.iter().cloned()).collect();
834 assert_eq!(vec, &[(), ()]);
835 assert_eq!(t, &[()]);
839 fn test_splice_unbounded() {
840 let mut vec = vec![1, 2, 3, 4, 5];
841 let t: Vec<_> = vec.splice(.., None).collect();
842 assert_eq!(vec, &[]);
843 assert_eq!(t, &[1, 2, 3, 4, 5]);
847 fn test_splice_forget() {
848 let mut v = vec![1, 2, 3, 4, 5];
849 let a = [10, 11, 12];
850 std::mem::forget(v.splice(2..4, a.iter().cloned()));
851 assert_eq!(v, &[1, 2]);
855 fn test_into_boxed_slice() {
856 let xs = vec![1, 2, 3];
857 let ys = xs.into_boxed_slice();
858 assert_eq!(&*ys, [1, 2, 3]);
863 let mut vec = vec![1, 2, 3];
864 let mut vec2 = vec![4, 5, 6];
865 vec.append(&mut vec2);
866 assert_eq!(vec, [1, 2, 3, 4, 5, 6]);
867 assert_eq!(vec2, []);
871 fn test_split_off() {
872 let mut vec = vec![1, 2, 3, 4, 5, 6];
873 let orig_capacity = vec.capacity();
874 let vec2 = vec.split_off(4);
875 assert_eq!(vec, [1, 2, 3, 4]);
876 assert_eq!(vec2, [5, 6]);
877 assert_eq!(vec.capacity(), orig_capacity);
881 fn test_split_off_take_all() {
882 let mut vec = vec![1, 2, 3, 4, 5, 6];
883 let orig_ptr = vec.as_ptr();
884 let orig_capacity = vec.capacity();
885 let vec2 = vec.split_off(0);
887 assert_eq!(vec2, [1, 2, 3, 4, 5, 6]);
888 assert_eq!(vec.capacity(), orig_capacity);
889 assert_eq!(vec2.as_ptr(), orig_ptr);
893 fn test_into_iter_as_slice() {
894 let vec = vec!['a', 'b', 'c'];
895 let mut into_iter = vec.into_iter();
896 assert_eq!(into_iter.as_slice(), &['a', 'b', 'c']);
897 let _ = into_iter.next().unwrap();
898 assert_eq!(into_iter.as_slice(), &['b', 'c']);
899 let _ = into_iter.next().unwrap();
900 let _ = into_iter.next().unwrap();
901 assert_eq!(into_iter.as_slice(), &[]);
905 fn test_into_iter_as_mut_slice() {
906 let vec = vec!['a', 'b', 'c'];
907 let mut into_iter = vec.into_iter();
908 assert_eq!(into_iter.as_slice(), &['a', 'b', 'c']);
909 into_iter.as_mut_slice()[0] = 'x';
910 into_iter.as_mut_slice()[1] = 'y';
911 assert_eq!(into_iter.next().unwrap(), 'x');
912 assert_eq!(into_iter.as_slice(), &['y', 'c']);
916 fn test_into_iter_debug() {
917 let vec = vec!['a', 'b', 'c'];
918 let into_iter = vec.into_iter();
919 let debug = format!("{:?}", into_iter);
920 assert_eq!(debug, "IntoIter(['a', 'b', 'c'])");
924 fn test_into_iter_count() {
925 assert_eq!(vec![1, 2, 3].into_iter().count(), 3);
929 fn test_into_iter_clone() {
930 fn iter_equal<I: Iterator<Item = i32>>(it: I, slice: &[i32]) {
931 let v: Vec<i32> = it.collect();
932 assert_eq!(&v[..], slice);
934 let mut it = vec![1, 2, 3].into_iter();
935 iter_equal(it.clone(), &[1, 2, 3]);
936 assert_eq!(it.next(), Some(1));
937 let mut it = it.rev();
938 iter_equal(it.clone(), &[3, 2]);
939 assert_eq!(it.next(), Some(3));
940 iter_equal(it.clone(), &[2]);
941 assert_eq!(it.next(), Some(2));
942 iter_equal(it.clone(), &[]);
943 assert_eq!(it.next(), None);
947 fn test_into_iter_leak() {
948 static mut DROPS: i32 = 0;
959 panic!("panic in `drop`");
964 let v = vec![D(false), D(true), D(false)];
966 catch_unwind(move || drop(v.into_iter())).ok();
968 assert_eq!(unsafe { DROPS }, 3);
972 fn test_from_iter_specialization() {
973 let src: Vec<usize> = vec![0usize; 1];
974 let srcptr = src.as_ptr();
975 let sink = src.into_iter().collect::<Vec<_>>();
976 let sinkptr = sink.as_ptr();
977 assert_eq!(srcptr, sinkptr);
981 fn test_from_iter_partially_drained_in_place_specialization() {
982 let src: Vec<usize> = vec![0usize; 10];
983 let srcptr = src.as_ptr();
984 let mut iter = src.into_iter();
987 let sink = iter.collect::<Vec<_>>();
988 let sinkptr = sink.as_ptr();
989 assert_eq!(srcptr, sinkptr);
993 fn test_from_iter_specialization_with_iterator_adapters() {
994 fn assert_in_place_trait<T: InPlaceIterable>(_: &T) {}
995 let src: Vec<usize> = vec![0usize; 256];
996 let srcptr = src.as_ptr();
1001 .zip(std::iter::repeat(1usize))
1002 .map(|(a, b)| a + b)
1003 .map_while(Option::Some)
1006 .map(|e| std::num::NonZeroUsize::new(e));
1007 assert_in_place_trait(&iter);
1008 let sink = iter.collect::<Vec<_>>();
1009 let sinkptr = sink.as_ptr();
1010 assert_eq!(srcptr, sinkptr as *const usize);
1014 fn test_from_iter_specialization_head_tail_drop() {
1015 let drop_count: Vec<_> = (0..=2).map(|_| Rc::new(())).collect();
1016 let src: Vec<_> = drop_count.iter().cloned().collect();
1017 let srcptr = src.as_ptr();
1018 let iter = src.into_iter();
1019 let sink: Vec<_> = iter.skip(1).take(1).collect();
1020 let sinkptr = sink.as_ptr();
1021 assert_eq!(srcptr, sinkptr, "specialization was applied");
1022 assert_eq!(Rc::strong_count(&drop_count[0]), 1, "front was dropped");
1023 assert_eq!(Rc::strong_count(&drop_count[1]), 2, "one element was collected");
1024 assert_eq!(Rc::strong_count(&drop_count[2]), 1, "tail was dropped");
1025 assert_eq!(sink.len(), 1);
1029 fn test_from_iter_specialization_panic_drop() {
1030 let drop_count: Vec<_> = (0..=2).map(|_| Rc::new(())).collect();
1031 let src: Vec<_> = drop_count.iter().cloned().collect();
1032 let iter = src.into_iter();
1034 let _ = std::panic::catch_unwind(AssertUnwindSafe(|| {
1037 .filter_map(|(i, e)| {
1039 std::panic!("aborting iteration");
1043 .collect::<Vec<_>>();
1047 drop_count.iter().map(Rc::strong_count).all(|count| count == 1),
1048 "all items were dropped once"
1053 fn test_cow_from() {
1054 let borrowed: &[_] = &["borrowed", "(slice)"];
1055 let owned = vec!["owned", "(vec)"];
1056 match (Cow::from(owned.clone()), Cow::from(borrowed)) {
1057 (Cow::Owned(o), Cow::Borrowed(b)) => assert!(o == owned && b == borrowed),
1058 _ => panic!("invalid `Cow::from`"),
1063 fn test_from_cow() {
1064 let borrowed: &[_] = &["borrowed", "(slice)"];
1065 let owned = vec!["owned", "(vec)"];
1066 assert_eq!(Vec::from(Cow::Borrowed(borrowed)), vec!["borrowed", "(slice)"]);
1067 assert_eq!(Vec::from(Cow::Owned(owned)), vec!["owned", "(vec)"]);
1071 fn assert_covariance() {
1072 fn drain<'new>(d: Drain<'static, &'static str>) -> Drain<'new, &'new str> {
1075 fn into_iter<'new>(i: IntoIter<&'static str>) -> IntoIter<&'new str> {
1081 fn from_into_inner() {
1082 let vec = vec![1, 2, 3];
1083 let ptr = vec.as_ptr();
1084 let vec = vec.into_iter().collect::<Vec<_>>();
1085 assert_eq!(vec, [1, 2, 3]);
1086 assert_eq!(vec.as_ptr(), ptr);
1088 let ptr = &vec[1] as *const _;
1089 let mut it = vec.into_iter();
1091 let vec = it.collect::<Vec<_>>();
1092 assert_eq!(vec, [2, 3]);
1093 assert!(ptr != vec.as_ptr());
1097 fn overaligned_allocations() {
1100 let mut v = vec![Foo(273)];
1101 for i in 0..0x1000 {
1103 assert!(v[0].0 == 273);
1104 assert!(v.as_ptr() as usize & 0xff == 0);
1106 assert!(v[0].0 == 273);
1107 assert!(v.as_ptr() as usize & 0xff == 0);
1112 fn drain_filter_empty() {
1113 let mut vec: Vec<i32> = vec![];
1116 let mut iter = vec.drain_filter(|_| true);
1117 assert_eq!(iter.size_hint(), (0, Some(0)));
1118 assert_eq!(iter.next(), None);
1119 assert_eq!(iter.size_hint(), (0, Some(0)));
1120 assert_eq!(iter.next(), None);
1121 assert_eq!(iter.size_hint(), (0, Some(0)));
1123 assert_eq!(vec.len(), 0);
1124 assert_eq!(vec, vec![]);
1128 fn drain_filter_zst() {
1129 let mut vec = vec![(), (), (), (), ()];
1130 let initial_len = vec.len();
1133 let mut iter = vec.drain_filter(|_| true);
1134 assert_eq!(iter.size_hint(), (0, Some(initial_len)));
1135 while let Some(_) = iter.next() {
1137 assert_eq!(iter.size_hint(), (0, Some(initial_len - count)));
1139 assert_eq!(iter.size_hint(), (0, Some(0)));
1140 assert_eq!(iter.next(), None);
1141 assert_eq!(iter.size_hint(), (0, Some(0)));
1144 assert_eq!(count, initial_len);
1145 assert_eq!(vec.len(), 0);
1146 assert_eq!(vec, vec![]);
1150 fn drain_filter_false() {
1151 let mut vec = vec![1, 2, 3, 4, 5, 6, 7, 8, 9, 10];
1153 let initial_len = vec.len();
1156 let mut iter = vec.drain_filter(|_| false);
1157 assert_eq!(iter.size_hint(), (0, Some(initial_len)));
1158 for _ in iter.by_ref() {
1161 assert_eq!(iter.size_hint(), (0, Some(0)));
1162 assert_eq!(iter.next(), None);
1163 assert_eq!(iter.size_hint(), (0, Some(0)));
1166 assert_eq!(count, 0);
1167 assert_eq!(vec.len(), initial_len);
1168 assert_eq!(vec, vec![1, 2, 3, 4, 5, 6, 7, 8, 9, 10]);
1172 fn drain_filter_true() {
1173 let mut vec = vec![1, 2, 3, 4, 5, 6, 7, 8, 9, 10];
1175 let initial_len = vec.len();
1178 let mut iter = vec.drain_filter(|_| true);
1179 assert_eq!(iter.size_hint(), (0, Some(initial_len)));
1180 while let Some(_) = iter.next() {
1182 assert_eq!(iter.size_hint(), (0, Some(initial_len - count)));
1184 assert_eq!(iter.size_hint(), (0, Some(0)));
1185 assert_eq!(iter.next(), None);
1186 assert_eq!(iter.size_hint(), (0, Some(0)));
1189 assert_eq!(count, initial_len);
1190 assert_eq!(vec.len(), 0);
1191 assert_eq!(vec, vec![]);
1195 fn drain_filter_complex() {
1197 // [+xxx++++++xxxxx++++x+x++]
1199 1, 2, 4, 6, 7, 9, 11, 13, 15, 17, 18, 20, 22, 24, 26, 27, 29, 31, 33, 34, 35, 36, 37,
1203 let removed = vec.drain_filter(|x| *x % 2 == 0).collect::<Vec<_>>();
1204 assert_eq!(removed.len(), 10);
1205 assert_eq!(removed, vec![2, 4, 6, 18, 20, 22, 24, 26, 34, 36]);
1207 assert_eq!(vec.len(), 14);
1208 assert_eq!(vec, vec![1, 7, 9, 11, 13, 15, 17, 27, 29, 31, 33, 35, 37, 39]);
1212 // [xxx++++++xxxxx++++x+x++]
1214 2, 4, 6, 7, 9, 11, 13, 15, 17, 18, 20, 22, 24, 26, 27, 29, 31, 33, 34, 35, 36, 37, 39,
1217 let removed = vec.drain_filter(|x| *x % 2 == 0).collect::<Vec<_>>();
1218 assert_eq!(removed.len(), 10);
1219 assert_eq!(removed, vec![2, 4, 6, 18, 20, 22, 24, 26, 34, 36]);
1221 assert_eq!(vec.len(), 13);
1222 assert_eq!(vec, vec![7, 9, 11, 13, 15, 17, 27, 29, 31, 33, 35, 37, 39]);
1226 // [xxx++++++xxxxx++++x+x]
1228 vec![2, 4, 6, 7, 9, 11, 13, 15, 17, 18, 20, 22, 24, 26, 27, 29, 31, 33, 34, 35, 36];
1230 let removed = vec.drain_filter(|x| *x % 2 == 0).collect::<Vec<_>>();
1231 assert_eq!(removed.len(), 10);
1232 assert_eq!(removed, vec![2, 4, 6, 18, 20, 22, 24, 26, 34, 36]);
1234 assert_eq!(vec.len(), 11);
1235 assert_eq!(vec, vec![7, 9, 11, 13, 15, 17, 27, 29, 31, 33, 35]);
1239 // [xxxxxxxxxx+++++++++++]
1240 let mut vec = vec![2, 4, 6, 8, 10, 12, 14, 16, 18, 20, 1, 3, 5, 7, 9, 11, 13, 15, 17, 19];
1242 let removed = vec.drain_filter(|x| *x % 2 == 0).collect::<Vec<_>>();
1243 assert_eq!(removed.len(), 10);
1244 assert_eq!(removed, vec![2, 4, 6, 8, 10, 12, 14, 16, 18, 20]);
1246 assert_eq!(vec.len(), 10);
1247 assert_eq!(vec, vec![1, 3, 5, 7, 9, 11, 13, 15, 17, 19]);
1251 // [+++++++++++xxxxxxxxxx]
1252 let mut vec = vec![1, 3, 5, 7, 9, 11, 13, 15, 17, 19, 2, 4, 6, 8, 10, 12, 14, 16, 18, 20];
1254 let removed = vec.drain_filter(|x| *x % 2 == 0).collect::<Vec<_>>();
1255 assert_eq!(removed.len(), 10);
1256 assert_eq!(removed, vec![2, 4, 6, 8, 10, 12, 14, 16, 18, 20]);
1258 assert_eq!(vec.len(), 10);
1259 assert_eq!(vec, vec![1, 3, 5, 7, 9, 11, 13, 15, 17, 19]);
1263 // FIXME: re-enable emscripten once it can unwind again
1265 #[cfg(not(target_os = "emscripten"))]
1266 fn drain_filter_consumed_panic() {
1268 use std::sync::Mutex;
1272 drop_counts: Rc<Mutex<Vec<usize>>>,
1275 impl Drop for Check {
1276 fn drop(&mut self) {
1277 self.drop_counts.lock().unwrap()[self.index] += 1;
1278 println!("drop: {}", self.index);
1282 let check_count = 10;
1283 let drop_counts = Rc::new(Mutex::new(vec![0_usize; check_count]));
1284 let mut data: Vec<Check> = (0..check_count)
1285 .map(|index| Check { index, drop_counts: Rc::clone(&drop_counts) })
1288 let _ = std::panic::catch_unwind(move || {
1289 let filter = |c: &mut Check| {
1291 panic!("panic at index: {}", c.index);
1293 // Verify that if the filter could panic again on another element
1294 // that it would not cause a double panic and all elements of the
1295 // vec would still be dropped exactly once.
1297 panic!("panic at index: {}", c.index);
1301 let drain = data.drain_filter(filter);
1303 // NOTE: The DrainFilter is explicitly consumed
1304 drain.for_each(drop);
1307 let drop_counts = drop_counts.lock().unwrap();
1308 assert_eq!(check_count, drop_counts.len());
1310 for (index, count) in drop_counts.iter().cloned().enumerate() {
1311 assert_eq!(1, count, "unexpected drop count at index: {} (count: {})", index, count);
1315 // FIXME: Re-enable emscripten once it can catch panics
1317 #[cfg(not(target_os = "emscripten"))]
1318 fn drain_filter_unconsumed_panic() {
1320 use std::sync::Mutex;
1324 drop_counts: Rc<Mutex<Vec<usize>>>,
1327 impl Drop for Check {
1328 fn drop(&mut self) {
1329 self.drop_counts.lock().unwrap()[self.index] += 1;
1330 println!("drop: {}", self.index);
1334 let check_count = 10;
1335 let drop_counts = Rc::new(Mutex::new(vec![0_usize; check_count]));
1336 let mut data: Vec<Check> = (0..check_count)
1337 .map(|index| Check { index, drop_counts: Rc::clone(&drop_counts) })
1340 let _ = std::panic::catch_unwind(move || {
1341 let filter = |c: &mut Check| {
1343 panic!("panic at index: {}", c.index);
1345 // Verify that if the filter could panic again on another element
1346 // that it would not cause a double panic and all elements of the
1347 // vec would still be dropped exactly once.
1349 panic!("panic at index: {}", c.index);
1353 let _drain = data.drain_filter(filter);
1355 // NOTE: The DrainFilter is dropped without being consumed
1358 let drop_counts = drop_counts.lock().unwrap();
1359 assert_eq!(check_count, drop_counts.len());
1361 for (index, count) in drop_counts.iter().cloned().enumerate() {
1362 assert_eq!(1, count, "unexpected drop count at index: {} (count: {})", index, count);
1367 fn drain_filter_unconsumed() {
1368 let mut vec = vec![1, 2, 3, 4];
1369 let drain = vec.drain_filter(|&mut x| x % 2 != 0);
1371 assert_eq!(vec, [2, 4]);
1375 fn test_reserve_exact() {
1376 // This is all the same as test_reserve
1378 let mut v = Vec::new();
1379 assert_eq!(v.capacity(), 0);
1382 assert!(v.capacity() >= 2);
1388 assert!(v.capacity() >= 16);
1389 v.reserve_exact(16);
1390 assert!(v.capacity() >= 32);
1394 v.reserve_exact(16);
1395 assert!(v.capacity() >= 33)
1399 #[cfg_attr(miri, ignore)] // Miri does not support signalling OOM
1400 #[cfg_attr(target_os = "android", ignore)] // Android used in CI has a broken dlmalloc
1401 fn test_try_reserve() {
1402 // These are the interesting cases:
1403 // * exactly isize::MAX should never trigger a CapacityOverflow (can be OOM)
1404 // * > isize::MAX should always fail
1405 // * On 16/32-bit should CapacityOverflow
1406 // * On 64-bit should OOM
1407 // * overflow may trigger when adding `len` to `cap` (in number of elements)
1408 // * overflow may trigger when multiplying `new_cap` by size_of::<T> (to get bytes)
1410 const MAX_CAP: usize = isize::MAX as usize;
1411 const MAX_USIZE: usize = usize::MAX;
1413 // On 16/32-bit, we check that allocations don't exceed isize::MAX,
1414 // on 64-bit, we assume the OS will give an OOM for such a ridiculous size.
1415 // Any platform that succeeds for these requests is technically broken with
1416 // ptr::offset because LLVM is the worst.
1417 let guards_against_isize = usize::BITS < 64;
1420 // Note: basic stuff is checked by test_reserve
1421 let mut empty_bytes: Vec<u8> = Vec::new();
1423 // Check isize::MAX doesn't count as an overflow
1424 if let Err(CapacityOverflow) = empty_bytes.try_reserve(MAX_CAP) {
1425 panic!("isize::MAX shouldn't trigger an overflow!");
1427 // Play it again, frank! (just to be sure)
1428 if let Err(CapacityOverflow) = empty_bytes.try_reserve(MAX_CAP) {
1429 panic!("isize::MAX shouldn't trigger an overflow!");
1432 if guards_against_isize {
1433 // Check isize::MAX + 1 does count as overflow
1434 if let Err(CapacityOverflow) = empty_bytes.try_reserve(MAX_CAP + 1) {
1436 panic!("isize::MAX + 1 should trigger an overflow!")
1439 // Check usize::MAX does count as overflow
1440 if let Err(CapacityOverflow) = empty_bytes.try_reserve(MAX_USIZE) {
1442 panic!("usize::MAX should trigger an overflow!")
1445 // Check isize::MAX + 1 is an OOM
1446 if let Err(AllocError { .. }) = empty_bytes.try_reserve(MAX_CAP + 1) {
1448 panic!("isize::MAX + 1 should trigger an OOM!")
1451 // Check usize::MAX is an OOM
1452 if let Err(AllocError { .. }) = empty_bytes.try_reserve(MAX_USIZE) {
1454 panic!("usize::MAX should trigger an OOM!")
1460 // Same basic idea, but with non-zero len
1461 let mut ten_bytes: Vec<u8> = vec![1, 2, 3, 4, 5, 6, 7, 8, 9, 10];
1463 if let Err(CapacityOverflow) = ten_bytes.try_reserve(MAX_CAP - 10) {
1464 panic!("isize::MAX shouldn't trigger an overflow!");
1466 if let Err(CapacityOverflow) = ten_bytes.try_reserve(MAX_CAP - 10) {
1467 panic!("isize::MAX shouldn't trigger an overflow!");
1469 if guards_against_isize {
1470 if let Err(CapacityOverflow) = ten_bytes.try_reserve(MAX_CAP - 9) {
1472 panic!("isize::MAX + 1 should trigger an overflow!");
1475 if let Err(AllocError { .. }) = ten_bytes.try_reserve(MAX_CAP - 9) {
1477 panic!("isize::MAX + 1 should trigger an OOM!")
1480 // Should always overflow in the add-to-len
1481 if let Err(CapacityOverflow) = ten_bytes.try_reserve(MAX_USIZE) {
1483 panic!("usize::MAX should trigger an overflow!")
1488 // Same basic idea, but with interesting type size
1489 let mut ten_u32s: Vec<u32> = vec![1, 2, 3, 4, 5, 6, 7, 8, 9, 10];
1491 if let Err(CapacityOverflow) = ten_u32s.try_reserve(MAX_CAP / 4 - 10) {
1492 panic!("isize::MAX shouldn't trigger an overflow!");
1494 if let Err(CapacityOverflow) = ten_u32s.try_reserve(MAX_CAP / 4 - 10) {
1495 panic!("isize::MAX shouldn't trigger an overflow!");
1497 if guards_against_isize {
1498 if let Err(CapacityOverflow) = ten_u32s.try_reserve(MAX_CAP / 4 - 9) {
1500 panic!("isize::MAX + 1 should trigger an overflow!");
1503 if let Err(AllocError { .. }) = ten_u32s.try_reserve(MAX_CAP / 4 - 9) {
1505 panic!("isize::MAX + 1 should trigger an OOM!")
1508 // Should fail in the mul-by-size
1509 if let Err(CapacityOverflow) = ten_u32s.try_reserve(MAX_USIZE - 20) {
1511 panic!("usize::MAX should trigger an overflow!");
1517 #[cfg_attr(miri, ignore)] // Miri does not support signalling OOM
1518 #[cfg_attr(target_os = "android", ignore)] // Android used in CI has a broken dlmalloc
1519 fn test_try_reserve_exact() {
1520 // This is exactly the same as test_try_reserve with the method changed.
1521 // See that test for comments.
1523 const MAX_CAP: usize = isize::MAX as usize;
1524 const MAX_USIZE: usize = usize::MAX;
1526 let guards_against_isize = size_of::<usize>() < 8;
1529 let mut empty_bytes: Vec<u8> = Vec::new();
1531 if let Err(CapacityOverflow) = empty_bytes.try_reserve_exact(MAX_CAP) {
1532 panic!("isize::MAX shouldn't trigger an overflow!");
1534 if let Err(CapacityOverflow) = empty_bytes.try_reserve_exact(MAX_CAP) {
1535 panic!("isize::MAX shouldn't trigger an overflow!");
1538 if guards_against_isize {
1539 if let Err(CapacityOverflow) = empty_bytes.try_reserve_exact(MAX_CAP + 1) {
1541 panic!("isize::MAX + 1 should trigger an overflow!")
1544 if let Err(CapacityOverflow) = empty_bytes.try_reserve_exact(MAX_USIZE) {
1546 panic!("usize::MAX should trigger an overflow!")
1549 if let Err(AllocError { .. }) = empty_bytes.try_reserve_exact(MAX_CAP + 1) {
1551 panic!("isize::MAX + 1 should trigger an OOM!")
1554 if let Err(AllocError { .. }) = empty_bytes.try_reserve_exact(MAX_USIZE) {
1556 panic!("usize::MAX should trigger an OOM!")
1562 let mut ten_bytes: Vec<u8> = vec![1, 2, 3, 4, 5, 6, 7, 8, 9, 10];
1564 if let Err(CapacityOverflow) = ten_bytes.try_reserve_exact(MAX_CAP - 10) {
1565 panic!("isize::MAX shouldn't trigger an overflow!");
1567 if let Err(CapacityOverflow) = ten_bytes.try_reserve_exact(MAX_CAP - 10) {
1568 panic!("isize::MAX shouldn't trigger an overflow!");
1570 if guards_against_isize {
1571 if let Err(CapacityOverflow) = ten_bytes.try_reserve_exact(MAX_CAP - 9) {
1573 panic!("isize::MAX + 1 should trigger an overflow!");
1576 if let Err(AllocError { .. }) = ten_bytes.try_reserve_exact(MAX_CAP - 9) {
1578 panic!("isize::MAX + 1 should trigger an OOM!")
1581 if let Err(CapacityOverflow) = ten_bytes.try_reserve_exact(MAX_USIZE) {
1583 panic!("usize::MAX should trigger an overflow!")
1588 let mut ten_u32s: Vec<u32> = vec![1, 2, 3, 4, 5, 6, 7, 8, 9, 10];
1590 if let Err(CapacityOverflow) = ten_u32s.try_reserve_exact(MAX_CAP / 4 - 10) {
1591 panic!("isize::MAX shouldn't trigger an overflow!");
1593 if let Err(CapacityOverflow) = ten_u32s.try_reserve_exact(MAX_CAP / 4 - 10) {
1594 panic!("isize::MAX shouldn't trigger an overflow!");
1596 if guards_against_isize {
1597 if let Err(CapacityOverflow) = ten_u32s.try_reserve_exact(MAX_CAP / 4 - 9) {
1599 panic!("isize::MAX + 1 should trigger an overflow!");
1602 if let Err(AllocError { .. }) = ten_u32s.try_reserve_exact(MAX_CAP / 4 - 9) {
1604 panic!("isize::MAX + 1 should trigger an OOM!")
1607 if let Err(CapacityOverflow) = ten_u32s.try_reserve_exact(MAX_USIZE - 20) {
1609 panic!("usize::MAX should trigger an overflow!")
1615 fn test_stable_pointers() {
1616 /// Pull an element from the iterator, then drop it.
1617 /// Useful to cover both the `next` and `drop` paths of an iterator.
1618 fn next_then_drop<I: Iterator>(mut i: I) {
1623 // Test that, if we reserved enough space, adding and removing elements does not
1624 // invalidate references into the vector (such as `v0`). This test also
1625 // runs in Miri, which would detect such problems.
1626 // Note that this test does *not* constitute a stable guarantee that all these functions do not
1627 // reallocate! Only what is explicitly documented at
1628 // <https://doc.rust-lang.org/nightly/std/vec/struct.Vec.html#guarantees> is stably guaranteed.
1629 let mut v = Vec::with_capacity(128);
1632 // Laundering the lifetime -- we take care that `v` does not reallocate, so that's okay.
1634 let v0 = unsafe { &mut *(v0 as *mut _) };
1635 // Now do a bunch of things and occasionally use `v0` again to assert it is still valid.
1637 // Pushing/inserting and popping/removing
1641 assert_eq!(*v0, 13);
1644 assert_eq!(*v0, 13);
1647 assert_eq!(v.len(), 2);
1648 v.swap_remove(1); // swap_remove the last element
1649 assert_eq!(*v0, 13);
1652 v.append(&mut vec![27, 19]);
1653 assert_eq!(*v0, 13);
1656 v.extend_from_slice(&[1, 2]);
1657 v.extend(&[1, 2]); // `slice::Iter` (with `T: Copy`) specialization
1658 v.extend(vec![2, 3]); // `vec::IntoIter` specialization
1659 v.extend(std::iter::once(3)); // `TrustedLen` specialization
1660 v.extend(std::iter::empty::<i32>()); // `TrustedLen` specialization with empty iterator
1661 v.extend(std::iter::once(3).filter(|_| true)); // base case
1662 v.extend(std::iter::once(&3)); // `cloned` specialization
1663 assert_eq!(*v0, 13);
1667 assert_eq!(*v0, 13);
1670 v.resize_with(v.len() + 10, || 42);
1671 assert_eq!(*v0, 13);
1672 v.resize_with(2, || panic!());
1673 assert_eq!(*v0, 13);
1675 // No-op reservation
1677 v.reserve_exact(32);
1678 assert_eq!(*v0, 13);
1681 v.resize_with(10, || 42);
1682 next_then_drop(v.drain(5..));
1683 assert_eq!(*v0, 13);
1686 v.resize_with(10, || 42);
1687 next_then_drop(v.splice(5.., vec![1, 2, 3, 4, 5])); // empty tail after range
1688 assert_eq!(*v0, 13);
1689 next_then_drop(v.splice(5..8, vec![1])); // replacement is smaller than original range
1690 assert_eq!(*v0, 13);
1691 next_then_drop(v.splice(5..6, vec![1; 10].into_iter().filter(|_| true))); // lower bound not exact
1692 assert_eq!(*v0, 13);
1694 // Smoke test that would fire even outside Miri if an actual relocation happened.
1696 assert_eq!(v[0], 0);
1699 // https://github.com/rust-lang/rust/pull/49496 introduced specialization based on:
1702 // unsafe impl<T: ?Sized> IsZero for *mut T {
1703 // fn is_zero(&self) -> bool {
1704 // (*self).is_null()
1709 // … to call `RawVec::with_capacity_zeroed` for creating `Vec<*mut T>`,
1710 // which is incorrect for fat pointers since `<*mut T>::is_null` only looks at the data component.
1711 // That is, a fat pointer can be “null” without being made entirely of zero bits.
1713 fn vec_macro_repeating_null_raw_fat_pointer() {
1714 let raw_dyn = &mut (|| ()) as &mut dyn Fn() as *mut dyn Fn();
1715 let vtable = dbg!(ptr_metadata(raw_dyn));
1716 let null_raw_dyn = ptr_from_raw_parts(std::ptr::null_mut(), vtable);
1717 assert!(null_raw_dyn.is_null());
1719 let vec = vec![null_raw_dyn; 1];
1720 dbg!(ptr_metadata(vec[0]));
1721 assert!(vec[0] == null_raw_dyn);
1723 // Polyfill for https://github.com/rust-lang/rfcs/pull/2580
1725 fn ptr_metadata(ptr: *mut dyn Fn()) -> *mut () {
1726 unsafe { std::mem::transmute::<*mut dyn Fn(), DynRepr>(ptr).vtable }
1729 fn ptr_from_raw_parts(data: *mut (), vtable: *mut ()) -> *mut dyn Fn() {
1730 unsafe { std::mem::transmute::<DynRepr, *mut dyn Fn()>(DynRepr { data, vtable }) }
1740 // This test will likely fail if you change the capacities used in
1741 // `RawVec::grow_amortized`.
1743 fn test_push_growth_strategy() {
1744 // If the element size is 1, we jump from 0 to 8, then double.
1746 let mut v1: Vec<u8> = vec![];
1747 assert_eq!(v1.capacity(), 0);
1751 assert_eq!(v1.capacity(), 8);
1756 assert_eq!(v1.capacity(), 16);
1761 assert_eq!(v1.capacity(), 32);
1766 assert_eq!(v1.capacity(), 64);
1770 // If the element size is 2..=1024, we jump from 0 to 4, then double.
1772 let mut v2: Vec<u16> = vec![];
1773 let mut v1024: Vec<[u8; 1024]> = vec![];
1774 assert_eq!(v2.capacity(), 0);
1775 assert_eq!(v1024.capacity(), 0);
1779 v1024.push([0; 1024]);
1780 assert_eq!(v2.capacity(), 4);
1781 assert_eq!(v1024.capacity(), 4);
1786 v1024.push([0; 1024]);
1787 assert_eq!(v2.capacity(), 8);
1788 assert_eq!(v1024.capacity(), 8);
1793 v1024.push([0; 1024]);
1794 assert_eq!(v2.capacity(), 16);
1795 assert_eq!(v1024.capacity(), 16);
1800 v1024.push([0; 1024]);
1801 assert_eq!(v2.capacity(), 32);
1802 assert_eq!(v1024.capacity(), 32);
1807 v1024.push([0; 1024]);
1808 assert_eq!(v2.capacity(), 64);
1809 assert_eq!(v1024.capacity(), 64);
1813 // If the element size is > 1024, we jump from 0 to 1, then double.
1815 let mut v1025: Vec<[u8; 1025]> = vec![];
1816 assert_eq!(v1025.capacity(), 0);
1819 v1025.push([0; 1025]);
1820 assert_eq!(v1025.capacity(), 1);
1824 v1025.push([0; 1025]);
1825 assert_eq!(v1025.capacity(), 2);
1829 v1025.push([0; 1025]);
1830 assert_eq!(v1025.capacity(), 4);
1834 v1025.push([0; 1025]);
1835 assert_eq!(v1025.capacity(), 8);
1839 v1025.push([0; 1025]);
1840 assert_eq!(v1025.capacity(), 16);
1844 v1025.push([0; 1025]);
1845 assert_eq!(v1025.capacity(), 32);
1849 v1025.push([0; 1025]);
1850 assert_eq!(v1025.capacity(), 64);
1855 macro_rules! generate_assert_eq_vec_and_prim {
1856 ($name:ident<$B:ident>($type:ty)) => {
1857 fn $name<A: PartialEq<$B> + Debug, $B: Debug>(a: Vec<A>, b: $type) {
1864 generate_assert_eq_vec_and_prim! { assert_eq_vec_and_slice <B>(&[B]) }
1865 generate_assert_eq_vec_and_prim! { assert_eq_vec_and_array_3<B>([B; 3]) }
1868 fn partialeq_vec_and_prim() {
1869 assert_eq_vec_and_slice(vec![1, 2, 3], &[1, 2, 3]);
1870 assert_eq_vec_and_array_3(vec![1, 2, 3], [1, 2, 3]);
1873 macro_rules! assert_partial_eq_valid {
1874 ($a2:expr, $a3:expr; $b2:expr, $b3: expr) => {
1875 assert!($a2 == $b2);
1876 assert!($a2 != $b3);
1877 assert!($a3 != $b2);
1878 assert!($a3 == $b3);
1879 assert_eq!($a2, $b2);
1880 assert_ne!($a2, $b3);
1881 assert_ne!($a3, $b2);
1882 assert_eq!($a3, $b3);
1887 fn partialeq_vec_full() {
1888 let vec2: Vec<_> = vec![1, 2];
1889 let vec3: Vec<_> = vec![1, 2, 3];
1890 let slice2: &[_] = &[1, 2];
1891 let slice3: &[_] = &[1, 2, 3];
1892 let slicemut2: &[_] = &mut [1, 2];
1893 let slicemut3: &[_] = &mut [1, 2, 3];
1894 let array2: [_; 2] = [1, 2];
1895 let array3: [_; 3] = [1, 2, 3];
1896 let arrayref2: &[_; 2] = &[1, 2];
1897 let arrayref3: &[_; 3] = &[1, 2, 3];
1899 assert_partial_eq_valid!(vec2,vec3; vec2,vec3);
1900 assert_partial_eq_valid!(vec2,vec3; slice2,slice3);
1901 assert_partial_eq_valid!(vec2,vec3; slicemut2,slicemut3);
1902 assert_partial_eq_valid!(slice2,slice3; vec2,vec3);
1903 assert_partial_eq_valid!(slicemut2,slicemut3; vec2,vec3);
1904 assert_partial_eq_valid!(vec2,vec3; array2,array3);
1905 assert_partial_eq_valid!(vec2,vec3; arrayref2,arrayref3);
1906 assert_partial_eq_valid!(vec2,vec3; arrayref2[..],arrayref3[..]);
1910 fn test_vec_cycle() {
1913 v: Vec<Cell<Option<&'a C<'a>>>>,
1922 let mut c1 = C::new();
1923 let mut c2 = C::new();
1924 let mut c3 = C::new();
1927 c1.v.push(Cell::new(None));
1928 c1.v.push(Cell::new(None));
1930 c2.v.push(Cell::new(None));
1931 c2.v.push(Cell::new(None));
1933 c3.v.push(Cell::new(None));
1934 c3.v.push(Cell::new(None));
1937 c1.v[0].set(Some(&c2));
1938 c1.v[1].set(Some(&c3));
1940 c2.v[0].set(Some(&c2));
1941 c2.v[1].set(Some(&c3));
1943 c3.v[0].set(Some(&c1));
1944 c3.v[1].set(Some(&c2));
1948 fn test_vec_cycle_wrapped() {
1950 v: Vec<Cell<Option<&'a C<'a>>>>,
1958 fn new() -> Refs<'a> {
1959 Refs { v: Vec::new() }
1965 C { refs: Refs::new() }
1969 let mut c1 = C::new();
1970 let mut c2 = C::new();
1971 let mut c3 = C::new();
1973 c1.refs.v.push(Cell::new(None));
1974 c1.refs.v.push(Cell::new(None));
1975 c2.refs.v.push(Cell::new(None));
1976 c2.refs.v.push(Cell::new(None));
1977 c3.refs.v.push(Cell::new(None));
1978 c3.refs.v.push(Cell::new(None));
1980 c1.refs.v[0].set(Some(&c2));
1981 c1.refs.v[1].set(Some(&c3));
1982 c2.refs.v[0].set(Some(&c2));
1983 c2.refs.v[1].set(Some(&c3));
1984 c3.refs.v[0].set(Some(&c1));
1985 c3.refs.v[1].set(Some(&c2));
1989 fn test_zero_sized_vec_push() {
1993 let mut tester = Vec::with_capacity(len);
1994 assert_eq!(tester.len(), 0);
1995 assert!(tester.capacity() >= len);
1999 assert_eq!(tester.len(), len);
2000 assert_eq!(tester.iter().count(), len);
2006 fn test_vec_macro_repeat() {
2007 assert_eq!(vec![1; 3], vec![1, 1, 1]);
2008 assert_eq!(vec![1; 2], vec![1, 1]);
2009 assert_eq!(vec![1; 1], vec![1]);
2010 assert_eq!(vec![1; 0], vec![]);
2012 // from_elem syntax (see RFC 832)
2013 let el = Box::new(1);
2015 assert_eq!(vec![el; n], vec![Box::new(1), Box::new(1), Box::new(1)]);
2019 fn test_vec_swap() {
2020 let mut a: Vec<isize> = vec![0, 1, 2, 3, 4, 5, 6];
2022 assert_eq!(a[2], 4);
2023 assert_eq!(a[4], 2);
2025 swap(&mut n, &mut a[0]);
2026 assert_eq!(a[0], 42);
2031 fn test_extend_from_within_spec() {
2035 impl Clone for CopyOnly {
2036 fn clone(&self) -> Self {
2037 panic!("extend_from_within must use specialization on copy");
2041 vec![CopyOnly, CopyOnly].extend_from_within(..);
2045 fn test_extend_from_within_clone() {
2046 let mut v = vec![String::from("sssss"), String::from("12334567890"), String::from("c")];
2047 v.extend_from_within(1..);
2049 assert_eq!(v, ["sssss", "12334567890", "c", "12334567890", "c"]);
2053 fn test_extend_from_within_complete_rande() {
2054 let mut v = vec![0, 1, 2, 3];
2055 v.extend_from_within(..);
2057 assert_eq!(v, [0, 1, 2, 3, 0, 1, 2, 3]);
2061 fn test_extend_from_within_empty_rande() {
2062 let mut v = vec![0, 1, 2, 3];
2063 v.extend_from_within(1..1);
2065 assert_eq!(v, [0, 1, 2, 3]);
2070 fn test_extend_from_within_out_of_rande() {
2071 let mut v = vec![0, 1];
2072 v.extend_from_within(..3);
2076 fn test_extend_from_within_zst() {
2077 let mut v = vec![(); 8];
2078 v.extend_from_within(3..7);
2080 assert_eq!(v, [(); 12]);
2084 fn test_extend_from_within_empty_vec() {
2085 let mut v = Vec::<i32>::new();
2086 v.extend_from_within(..);
2092 fn test_extend_from_within() {
2093 let mut v = vec![String::from("a"), String::from("b"), String::from("c")];
2094 v.extend_from_within(1..=2);
2095 v.extend_from_within(..=1);
2097 assert_eq!(v, ["a", "b", "c", "b", "c", "a", "b"]);