1 use core::alloc::{Allocator, Layout};
2 use core::iter::IntoIterator;
3 use core::ptr::NonNull;
4 use std::alloc::System;
5 use std::assert_matches::assert_matches;
8 use std::collections::TryReserveErrorKind::*;
10 use std::iter::InPlaceIterable;
11 use std::mem::{size_of, swap};
12 use std::ops::Bound::*;
13 use std::panic::{catch_unwind, AssertUnwindSafe};
15 use std::sync::atomic::{AtomicU32, Ordering};
16 use std::vec::{Drain, IntoIter};
18 struct DropCounter<'a> {
22 impl Drop for DropCounter<'_> {
29 fn test_small_vec_struct() {
30 assert_eq!(size_of::<Vec<u8>>(), size_of::<usize>() * 3);
34 fn test_double_drop() {
40 let (mut count_x, mut count_y) = (0, 0);
42 let mut tv = TwoVec { x: Vec::new(), y: Vec::new() };
43 tv.x.push(DropCounter { count: &mut count_x });
44 tv.y.push(DropCounter { count: &mut count_y });
46 // If Vec had a drop flag, here is where it would be zeroed.
47 // Instead, it should rely on its internal state to prevent
48 // doing anything significant when dropped multiple times.
51 // Here tv goes out of scope, tv.y should be dropped, but not tv.x.
54 assert_eq!(count_x, 1);
55 assert_eq!(count_y, 1);
60 let mut v = Vec::new();
61 assert_eq!(v.capacity(), 0);
64 assert!(v.capacity() >= 2);
70 assert!(v.capacity() >= 16);
72 assert!(v.capacity() >= 32);
77 assert!(v.capacity() >= 33)
81 fn test_zst_capacity() {
82 assert_eq!(Vec::<()>::new().capacity(), usize::MAX);
87 let v: Vec<isize> = vec![10, 20];
92 assert_eq!(v[x + 1], 20);
95 assert_eq!(v[x - 1], 10);
100 let vec1: Vec<isize> = vec![];
101 assert_eq!("[]", format!("{:?}", vec1));
103 let vec2 = vec![0, 1];
104 assert_eq!("[0, 1]", format!("{:?}", vec2));
106 let slice: &[isize] = &[4, 5];
107 assert_eq!("[4, 5]", format!("{slice:?}"));
116 assert_eq!(v, [1, 2]);
118 assert_eq!(v, [1, 2, 3]);
123 let mut v = Vec::new();
124 let mut w = Vec::new();
143 v.extend(w.clone()); // specializes to `append`
144 assert!(v.iter().eq(w.iter().chain(w.iter())));
147 #[derive(PartialEq, Debug)]
150 let mut a = Vec::new();
151 let b = vec![Foo, Foo];
154 assert_eq!(a, &[Foo, Foo]);
159 let mut x = Vec::new();
160 let y = vec![DropCounter { count: &mut count_x }];
163 assert_eq!(count_x, 1);
167 fn test_extend_from_slice() {
168 let a: Vec<isize> = vec![1, 2, 3, 4, 5];
169 let b: Vec<isize> = vec![6, 7, 8, 9, 0];
171 let mut v: Vec<isize> = a;
173 v.extend_from_slice(&b);
175 assert_eq!(v, [1, 2, 3, 4, 5, 6, 7, 8, 9, 0]);
179 fn test_extend_ref() {
180 let mut v = vec![1, 2];
181 v.extend(&[3, 4, 5]);
183 assert_eq!(v.len(), 5);
184 assert_eq!(v, [1, 2, 3, 4, 5]);
189 assert_eq!(v.len(), 7);
190 assert_eq!(v, [1, 2, 3, 4, 5, 6, 7]);
194 fn test_slice_from_ref() {
195 let values = vec![1, 2, 3, 4, 5];
196 let slice = &values[1..3];
198 assert_eq!(slice, [2, 3]);
202 fn test_slice_from_mut() {
203 let mut values = vec![1, 2, 3, 4, 5];
205 let slice = &mut values[2..];
206 assert!(slice == [3, 4, 5]);
212 assert!(values == [1, 2, 5, 6, 7]);
216 fn test_slice_to_mut() {
217 let mut values = vec![1, 2, 3, 4, 5];
219 let slice = &mut values[..2];
220 assert!(slice == [1, 2]);
226 assert!(values == [2, 3, 3, 4, 5]);
230 fn test_split_at_mut() {
231 let mut values = vec![1, 2, 3, 4, 5];
233 let (left, right) = values.split_at_mut(2);
235 let left: &[_] = left;
236 assert!(&left[..left.len()] == &[1, 2]);
243 let right: &[_] = right;
244 assert!(&right[..right.len()] == &[3, 4, 5]);
251 assert_eq!(values, [2, 3, 5, 6, 7]);
256 let v: Vec<i32> = vec![];
257 let w = vec![1, 2, 3];
259 assert_eq!(v, v.clone());
263 // they should be disjoint in memory.
264 assert!(w.as_ptr() != z.as_ptr())
268 fn test_clone_from() {
270 let three: Vec<Box<_>> = vec![Box::new(1), Box::new(2), Box::new(3)];
271 let two: Vec<Box<_>> = vec![Box::new(4), Box::new(5)];
273 v.clone_from(&three);
274 assert_eq!(v, three);
277 v.clone_from(&three);
278 assert_eq!(v, three);
285 v.clone_from(&three);
291 let mut vec = vec![1, 2, 3, 4];
292 vec.retain(|&x| x % 2 == 0);
293 assert_eq!(vec, [2, 4]);
297 fn test_retain_predicate_order() {
298 for to_keep in [true, false] {
299 let mut number_of_executions = 0;
300 let mut vec = vec![1, 2, 3, 4];
301 let mut next_expected = 1;
303 assert_eq!(next_expected, x);
305 number_of_executions += 1;
308 assert_eq!(number_of_executions, 4);
313 fn test_retain_pred_panic_with_hole() {
314 let v = (0..5).map(Rc::new).collect::<Vec<_>>();
315 catch_unwind(AssertUnwindSafe(|| {
316 let mut v = v.clone();
317 v.retain(|r| match **r {
325 // Everything is dropped when predicate panicked.
326 assert!(v.iter().all(|r| Rc::strong_count(r) == 1));
330 fn test_retain_pred_panic_no_hole() {
331 let v = (0..5).map(Rc::new).collect::<Vec<_>>();
332 catch_unwind(AssertUnwindSafe(|| {
333 let mut v = v.clone();
334 v.retain(|r| match **r {
340 // Everything is dropped when predicate panicked.
341 assert!(v.iter().all(|r| Rc::strong_count(r) == 1));
345 fn test_retain_drop_panic() {
346 struct Wrap(Rc<i32>);
356 let v = (0..5).map(|x| Rc::new(x)).collect::<Vec<_>>();
357 catch_unwind(AssertUnwindSafe(|| {
358 let mut v = v.iter().map(|r| Wrap(r.clone())).collect::<Vec<_>>();
359 v.retain(|w| match *w.0 {
363 3 => false, // Drop panic.
368 // Other elements are dropped when `drop` of one element panicked.
369 // The panicked wrapper also has its Rc dropped.
370 assert!(v.iter().all(|r| Rc::strong_count(r) == 1));
374 fn test_retain_maybeuninits() {
375 // This test aimed to be run under miri.
376 use core::mem::MaybeUninit;
377 let mut vec: Vec<_> = [1i32, 2, 3, 4].map(|v| MaybeUninit::new(vec![v])).into();
379 // SAFETY: Retain must visit every element of Vec in original order and exactly once.
380 // Our values is initialized at creation of Vec.
381 let v = unsafe { x.assume_init_ref()[0] };
385 // SAFETY: Value is initialized.
386 // Value wouldn't be dropped by `Vec::retain`
387 // because `MaybeUninit` doesn't drop content.
388 drop(unsafe { x.assume_init_read() });
391 let vec: Vec<i32> = vec
394 // SAFETY: All values dropped in retain predicate must be removed by `Vec::retain`.
395 // Remaining values are initialized.
399 assert_eq!(vec, [2, 4]);
404 fn case(a: Vec<i32>, b: Vec<i32>) {
409 case(vec![], vec![]);
410 case(vec![1], vec![1]);
411 case(vec![1, 1], vec![1]);
412 case(vec![1, 2, 3], vec![1, 2, 3]);
413 case(vec![1, 1, 2, 3], vec![1, 2, 3]);
414 case(vec![1, 2, 2, 3], vec![1, 2, 3]);
415 case(vec![1, 2, 3, 3], vec![1, 2, 3]);
416 case(vec![1, 1, 2, 2, 2, 3, 3], vec![1, 2, 3]);
420 fn test_dedup_by_key() {
421 fn case(a: Vec<i32>, b: Vec<i32>) {
423 v.dedup_by_key(|i| *i / 10);
426 case(vec![], vec![]);
427 case(vec![10], vec![10]);
428 case(vec![10, 11], vec![10]);
429 case(vec![10, 20, 30], vec![10, 20, 30]);
430 case(vec![10, 11, 20, 30], vec![10, 20, 30]);
431 case(vec![10, 20, 21, 30], vec![10, 20, 30]);
432 case(vec![10, 20, 30, 31], vec![10, 20, 30]);
433 case(vec![10, 11, 20, 21, 22, 30, 31], vec![10, 20, 30]);
438 let mut vec = vec!["foo", "bar", "Bar", "baz", "bar"];
439 vec.dedup_by(|a, b| a.eq_ignore_ascii_case(b));
441 assert_eq!(vec, ["foo", "bar", "baz", "bar"]);
443 let mut vec = vec![("foo", 1), ("foo", 2), ("bar", 3), ("bar", 4), ("bar", 5)];
444 vec.dedup_by(|a, b| {
451 assert_eq!(vec, [("foo", 3), ("bar", 12)]);
455 fn test_dedup_unique() {
456 let mut v0: Vec<Box<_>> = vec![Box::new(1), Box::new(1), Box::new(2), Box::new(3)];
458 let mut v1: Vec<Box<_>> = vec![Box::new(1), Box::new(2), Box::new(2), Box::new(3)];
460 let mut v2: Vec<Box<_>> = vec![Box::new(1), Box::new(2), Box::new(3), Box::new(3)];
462 // If the boxed pointers were leaked or otherwise misused, valgrind
463 // and/or rt should raise errors.
467 fn zero_sized_values() {
468 let mut v = Vec::new();
469 assert_eq!(v.len(), 0);
471 assert_eq!(v.len(), 1);
473 assert_eq!(v.len(), 2);
474 assert_eq!(v.pop(), Some(()));
475 assert_eq!(v.pop(), Some(()));
476 assert_eq!(v.pop(), None);
478 assert_eq!(v.iter().count(), 0);
480 assert_eq!(v.iter().count(), 1);
482 assert_eq!(v.iter().count(), 2);
486 assert_eq!(v.iter_mut().count(), 2);
488 assert_eq!(v.iter_mut().count(), 3);
490 assert_eq!(v.iter_mut().count(), 4);
492 for &mut () in &mut v {}
496 assert_eq!(v.iter_mut().count(), 0);
500 fn test_partition() {
501 assert_eq!([].into_iter().partition(|x: &i32| *x < 3), (vec![], vec![]));
502 assert_eq!([1, 2, 3].into_iter().partition(|x| *x < 4), (vec![1, 2, 3], vec![]));
503 assert_eq!([1, 2, 3].into_iter().partition(|x| *x < 2), (vec![1], vec![2, 3]));
504 assert_eq!([1, 2, 3].into_iter().partition(|x| *x < 0), (vec![], vec![1, 2, 3]));
508 fn test_zip_unzip() {
509 let z1 = vec![(1, 4), (2, 5), (3, 6)];
511 let (left, right): (Vec<_>, Vec<_>) = z1.iter().cloned().unzip();
513 assert_eq!((1, 4), (left[0], right[0]));
514 assert_eq!((2, 5), (left[1], right[1]));
515 assert_eq!((3, 6), (left[2], right[2]));
520 let x: &[isize] = &[1, 2, 3, 4, 5];
521 let cmp: &[isize] = &[1, 2, 3, 4, 5];
522 assert_eq!(&x[..], cmp);
523 let cmp: &[isize] = &[3, 4, 5];
524 assert_eq!(&x[2..], cmp);
525 let cmp: &[isize] = &[1, 2, 3];
526 assert_eq!(&x[..3], cmp);
527 let cmp: &[isize] = &[2, 3, 4];
528 assert_eq!(&x[1..4], cmp);
530 let x: Vec<isize> = vec![1, 2, 3, 4, 5];
531 let cmp: &[isize] = &[1, 2, 3, 4, 5];
532 assert_eq!(&x[..], cmp);
533 let cmp: &[isize] = &[3, 4, 5];
534 assert_eq!(&x[2..], cmp);
535 let cmp: &[isize] = &[1, 2, 3];
536 assert_eq!(&x[..3], cmp);
537 let cmp: &[isize] = &[2, 3, 4];
538 assert_eq!(&x[1..4], cmp);
542 fn test_vec_truncate_drop() {
543 static mut DROPS: u32 = 0;
553 let mut v = vec![Elem(1), Elem(2), Elem(3), Elem(4), Elem(5)];
554 assert_eq!(unsafe { DROPS }, 0);
556 assert_eq!(unsafe { DROPS }, 2);
558 assert_eq!(unsafe { DROPS }, 5);
563 fn test_vec_truncate_fail() {
565 impl Drop for BadElem {
567 let BadElem(ref mut x) = *self;
569 panic!("BadElem panic: 0xbadbeef")
574 let mut v = vec![BadElem(1), BadElem(2), BadElem(0xbadbeef), BadElem(4)];
580 let vec = vec![1, 2, 3];
581 assert!(vec[1] == 2);
586 fn test_index_out_of_bounds() {
587 let vec = vec![1, 2, 3];
593 fn test_slice_out_of_bounds_1() {
594 let x = vec![1, 2, 3, 4, 5];
600 fn test_slice_out_of_bounds_2() {
601 let x = vec![1, 2, 3, 4, 5];
607 fn test_slice_out_of_bounds_3() {
608 let x = vec![1, 2, 3, 4, 5];
614 fn test_slice_out_of_bounds_4() {
615 let x = vec![1, 2, 3, 4, 5];
621 fn test_slice_out_of_bounds_5() {
622 let x = vec![1, 2, 3, 4, 5];
628 fn test_swap_remove_empty() {
629 let mut vec = Vec::<i32>::new();
634 fn test_move_items() {
635 let vec = vec![1, 2, 3];
636 let mut vec2 = vec![];
640 assert_eq!(vec2, [1, 2, 3]);
644 fn test_move_items_reverse() {
645 let vec = vec![1, 2, 3];
646 let mut vec2 = vec![];
647 for i in vec.into_iter().rev() {
650 assert_eq!(vec2, [3, 2, 1]);
654 fn test_move_items_zero_sized() {
655 let vec = vec![(), (), ()];
656 let mut vec2 = vec![];
660 assert_eq!(vec2, [(), (), ()]);
664 fn test_drain_empty_vec() {
665 let mut vec: Vec<i32> = vec![];
666 let mut vec2: Vec<i32> = vec![];
667 for i in vec.drain(..) {
670 assert!(vec.is_empty());
671 assert!(vec2.is_empty());
675 fn test_drain_items() {
676 let mut vec = vec![1, 2, 3];
677 let mut vec2 = vec![];
678 for i in vec.drain(..) {
682 assert_eq!(vec2, [1, 2, 3]);
686 fn test_drain_items_reverse() {
687 let mut vec = vec![1, 2, 3];
688 let mut vec2 = vec![];
689 for i in vec.drain(..).rev() {
693 assert_eq!(vec2, [3, 2, 1]);
697 fn test_drain_items_zero_sized() {
698 let mut vec = vec![(), (), ()];
699 let mut vec2 = vec![];
700 for i in vec.drain(..) {
704 assert_eq!(vec2, [(), (), ()]);
709 fn test_drain_out_of_bounds() {
710 let mut v = vec![1, 2, 3, 4, 5];
715 fn test_drain_range() {
716 let mut v = vec![1, 2, 3, 4, 5];
717 for _ in v.drain(4..) {}
718 assert_eq!(v, &[1, 2, 3, 4]);
720 let mut v: Vec<_> = (1..6).map(|x| x.to_string()).collect();
721 for _ in v.drain(1..4) {}
722 assert_eq!(v, &[1.to_string(), 5.to_string()]);
724 let mut v: Vec<_> = (1..6).map(|x| x.to_string()).collect();
725 for _ in v.drain(1..4).rev() {}
726 assert_eq!(v, &[1.to_string(), 5.to_string()]);
728 let mut v: Vec<_> = vec![(); 5];
729 for _ in v.drain(1..4).rev() {}
730 assert_eq!(v, &[(), ()]);
734 fn test_drain_inclusive_range() {
735 let mut v = vec!['a', 'b', 'c', 'd', 'e'];
736 for _ in v.drain(1..=3) {}
737 assert_eq!(v, &['a', 'e']);
739 let mut v: Vec<_> = (0..=5).map(|x| x.to_string()).collect();
740 for _ in v.drain(1..=5) {}
741 assert_eq!(v, &["0".to_string()]);
743 let mut v: Vec<String> = (0..=5).map(|x| x.to_string()).collect();
744 for _ in v.drain(0..=5) {}
745 assert_eq!(v, Vec::<String>::new());
747 let mut v: Vec<_> = (0..=5).map(|x| x.to_string()).collect();
748 for _ in v.drain(0..=3) {}
749 assert_eq!(v, &["4".to_string(), "5".to_string()]);
751 let mut v: Vec<_> = (0..=1).map(|x| x.to_string()).collect();
752 for _ in v.drain(..=0) {}
753 assert_eq!(v, &["1".to_string()]);
757 fn test_drain_max_vec_size() {
758 let mut v = Vec::<()>::with_capacity(usize::MAX);
760 v.set_len(usize::MAX);
762 for _ in v.drain(usize::MAX - 1..) {}
763 assert_eq!(v.len(), usize::MAX - 1);
765 let mut v = Vec::<()>::with_capacity(usize::MAX);
767 v.set_len(usize::MAX);
769 for _ in v.drain(usize::MAX - 1..=usize::MAX - 1) {}
770 assert_eq!(v.len(), usize::MAX - 1);
775 fn test_drain_index_overflow() {
776 let mut v = Vec::<()>::with_capacity(usize::MAX);
778 v.set_len(usize::MAX);
780 v.drain(0..=usize::MAX);
785 fn test_drain_inclusive_out_of_bounds() {
786 let mut v = vec![1, 2, 3, 4, 5];
792 fn test_drain_start_overflow() {
793 let mut v = vec![1, 2, 3];
794 v.drain((Excluded(usize::MAX), Included(0)));
799 fn test_drain_end_overflow() {
800 let mut v = vec![1, 2, 3];
801 v.drain((Included(0), Included(usize::MAX)));
805 fn test_drain_leak() {
806 static mut DROPS: i32 = 0;
808 #[derive(Debug, PartialEq)]
818 panic!("panic in `drop`");
833 catch_unwind(AssertUnwindSafe(|| {
838 assert_eq!(unsafe { DROPS }, 4);
839 assert_eq!(v, vec![D(0, false), D(1, false), D(6, false),]);
843 fn test_drain_keep_rest() {
844 let mut v = vec![0, 1, 2, 3, 4, 5, 6];
845 let mut drain = v.drain(1..6);
846 assert_eq!(drain.next(), Some(1));
847 assert_eq!(drain.next_back(), Some(5));
848 assert_eq!(drain.next(), Some(2));
851 assert_eq!(v, &[0, 3, 4, 6]);
855 fn test_drain_keep_rest_all() {
856 let mut v = vec![0, 1, 2, 3, 4, 5, 6];
857 v.drain(1..6).keep_rest();
858 assert_eq!(v, &[0, 1, 2, 3, 4, 5, 6]);
862 fn test_drain_keep_rest_none() {
863 let mut v = vec![0, 1, 2, 3, 4, 5, 6];
864 let mut drain = v.drain(1..6);
866 drain.by_ref().for_each(drop);
869 assert_eq!(v, &[0, 6]);
874 let mut v = vec![1, 2, 3, 4, 5];
875 let a = [10, 11, 12];
877 assert_eq!(v, &[1, 2, 10, 11, 12, 5]);
878 v.splice(1..3, Some(20));
879 assert_eq!(v, &[1, 20, 11, 12, 5]);
883 fn test_splice_inclusive_range() {
884 let mut v = vec![1, 2, 3, 4, 5];
885 let a = [10, 11, 12];
886 let t1: Vec<_> = v.splice(2..=3, a).collect();
887 assert_eq!(v, &[1, 2, 10, 11, 12, 5]);
888 assert_eq!(t1, &[3, 4]);
889 let t2: Vec<_> = v.splice(1..=2, Some(20)).collect();
890 assert_eq!(v, &[1, 20, 11, 12, 5]);
891 assert_eq!(t2, &[2, 10]);
896 fn test_splice_out_of_bounds() {
897 let mut v = vec![1, 2, 3, 4, 5];
898 let a = [10, 11, 12];
904 fn test_splice_inclusive_out_of_bounds() {
905 let mut v = vec![1, 2, 3, 4, 5];
906 let a = [10, 11, 12];
911 fn test_splice_items_zero_sized() {
912 let mut vec = vec![(), (), ()];
914 let t: Vec<_> = vec.splice(1..2, vec2.iter().cloned()).collect();
915 assert_eq!(vec, &[(), ()]);
916 assert_eq!(t, &[()]);
920 fn test_splice_unbounded() {
921 let mut vec = vec![1, 2, 3, 4, 5];
922 let t: Vec<_> = vec.splice(.., None).collect();
923 assert_eq!(vec, &[]);
924 assert_eq!(t, &[1, 2, 3, 4, 5]);
928 fn test_splice_forget() {
929 let mut v = vec![1, 2, 3, 4, 5];
930 let a = [10, 11, 12];
931 std::mem::forget(v.splice(2..4, a));
932 assert_eq!(v, &[1, 2]);
936 fn test_into_boxed_slice() {
937 let xs = vec![1, 2, 3];
938 let ys = xs.into_boxed_slice();
939 assert_eq!(&*ys, [1, 2, 3]);
944 let mut vec = vec![1, 2, 3];
945 let mut vec2 = vec![4, 5, 6];
946 vec.append(&mut vec2);
947 assert_eq!(vec, [1, 2, 3, 4, 5, 6]);
948 assert_eq!(vec2, []);
952 fn test_split_off() {
953 let mut vec = vec![1, 2, 3, 4, 5, 6];
954 let orig_capacity = vec.capacity();
955 let vec2 = vec.split_off(4);
956 assert_eq!(vec, [1, 2, 3, 4]);
957 assert_eq!(vec2, [5, 6]);
958 assert_eq!(vec.capacity(), orig_capacity);
962 fn test_split_off_take_all() {
963 let mut vec = vec![1, 2, 3, 4, 5, 6];
964 let orig_ptr = vec.as_ptr();
965 let orig_capacity = vec.capacity();
966 let vec2 = vec.split_off(0);
968 assert_eq!(vec2, [1, 2, 3, 4, 5, 6]);
969 assert_eq!(vec.capacity(), orig_capacity);
970 assert_eq!(vec2.as_ptr(), orig_ptr);
974 fn test_into_iter_as_slice() {
975 let vec = vec!['a', 'b', 'c'];
976 let mut into_iter = vec.into_iter();
977 assert_eq!(into_iter.as_slice(), &['a', 'b', 'c']);
978 let _ = into_iter.next().unwrap();
979 assert_eq!(into_iter.as_slice(), &['b', 'c']);
980 let _ = into_iter.next().unwrap();
981 let _ = into_iter.next().unwrap();
982 assert_eq!(into_iter.as_slice(), &[]);
986 fn test_into_iter_as_mut_slice() {
987 let vec = vec!['a', 'b', 'c'];
988 let mut into_iter = vec.into_iter();
989 assert_eq!(into_iter.as_slice(), &['a', 'b', 'c']);
990 into_iter.as_mut_slice()[0] = 'x';
991 into_iter.as_mut_slice()[1] = 'y';
992 assert_eq!(into_iter.next().unwrap(), 'x');
993 assert_eq!(into_iter.as_slice(), &['y', 'c']);
997 fn test_into_iter_debug() {
998 let vec = vec!['a', 'b', 'c'];
999 let into_iter = vec.into_iter();
1000 let debug = format!("{into_iter:?}");
1001 assert_eq!(debug, "IntoIter(['a', 'b', 'c'])");
1005 fn test_into_iter_count() {
1006 assert_eq!([1, 2, 3].into_iter().count(), 3);
1010 fn test_into_iter_next_chunk() {
1011 let mut iter = b"lorem".to_vec().into_iter();
1013 assert_eq!(iter.next_chunk().unwrap(), [b'l', b'o']); // N is inferred as 2
1014 assert_eq!(iter.next_chunk().unwrap(), [b'r', b'e', b'm']); // N is inferred as 3
1015 assert_eq!(iter.next_chunk::<4>().unwrap_err().as_slice(), &[]); // N is explicitly 4
1019 fn test_into_iter_clone() {
1020 fn iter_equal<I: Iterator<Item = i32>>(it: I, slice: &[i32]) {
1021 let v: Vec<i32> = it.collect();
1022 assert_eq!(&v[..], slice);
1024 let mut it = [1, 2, 3].into_iter();
1025 iter_equal(it.clone(), &[1, 2, 3]);
1026 assert_eq!(it.next(), Some(1));
1027 let mut it = it.rev();
1028 iter_equal(it.clone(), &[3, 2]);
1029 assert_eq!(it.next(), Some(3));
1030 iter_equal(it.clone(), &[2]);
1031 assert_eq!(it.next(), Some(2));
1032 iter_equal(it.clone(), &[]);
1033 assert_eq!(it.next(), None);
1037 fn test_into_iter_leak() {
1038 static mut DROPS: i32 = 0;
1043 fn drop(&mut self) {
1049 panic!("panic in `drop`");
1054 let v = vec![D(false), D(true), D(false)];
1056 catch_unwind(move || drop(v.into_iter())).ok();
1058 assert_eq!(unsafe { DROPS }, 3);
1062 fn test_into_iter_advance_by() {
1063 let mut i = [1, 2, 3, 4, 5].into_iter();
1064 i.advance_by(0).unwrap();
1065 i.advance_back_by(0).unwrap();
1066 assert_eq!(i.as_slice(), [1, 2, 3, 4, 5]);
1068 i.advance_by(1).unwrap();
1069 i.advance_back_by(1).unwrap();
1070 assert_eq!(i.as_slice(), [2, 3, 4]);
1072 assert_eq!(i.advance_back_by(usize::MAX), Err(3));
1074 assert_eq!(i.advance_by(usize::MAX), Err(0));
1076 i.advance_by(0).unwrap();
1077 i.advance_back_by(0).unwrap();
1079 assert_eq!(i.len(), 0);
1083 fn test_into_iter_drop_allocator() {
1084 struct ReferenceCountedAllocator<'a>(DropCounter<'a>);
1086 unsafe impl Allocator for ReferenceCountedAllocator<'_> {
1087 fn allocate(&self, layout: Layout) -> Result<NonNull<[u8]>, core::alloc::AllocError> {
1088 System.allocate(layout)
1091 unsafe fn deallocate(&self, ptr: NonNull<u8>, layout: Layout) {
1092 System.deallocate(ptr, layout)
1096 let mut drop_count = 0;
1098 let allocator = ReferenceCountedAllocator(DropCounter { count: &mut drop_count });
1099 let _ = Vec::<u32, _>::new_in(allocator);
1100 assert_eq!(drop_count, 1);
1102 let allocator = ReferenceCountedAllocator(DropCounter { count: &mut drop_count });
1103 let _ = Vec::<u32, _>::new_in(allocator).into_iter();
1104 assert_eq!(drop_count, 2);
1108 fn test_into_iter_zst() {
1109 for _ in vec![[0u64; 0]].into_iter() {}
1110 for _ in vec![[0u64; 0]; 5].into_iter().rev() {}
1114 fn test_from_iter_specialization() {
1115 let src: Vec<usize> = vec![0usize; 1];
1116 let srcptr = src.as_ptr();
1117 let sink = src.into_iter().collect::<Vec<_>>();
1118 let sinkptr = sink.as_ptr();
1119 assert_eq!(srcptr, sinkptr);
1123 fn test_from_iter_partially_drained_in_place_specialization() {
1124 let src: Vec<usize> = vec![0usize; 10];
1125 let srcptr = src.as_ptr();
1126 let mut iter = src.into_iter();
1129 let sink = iter.collect::<Vec<_>>();
1130 let sinkptr = sink.as_ptr();
1131 assert_eq!(srcptr, sinkptr);
1135 fn test_from_iter_specialization_with_iterator_adapters() {
1136 fn assert_in_place_trait<T: InPlaceIterable>(_: &T) {}
1137 let src: Vec<usize> = vec![0usize; 256];
1138 let srcptr = src.as_ptr();
1143 .zip(std::iter::repeat(1usize))
1144 .map(|(a, b)| a + b)
1145 .map_while(Option::Some)
1147 .map(|e| if e != usize::MAX { Ok(std::num::NonZeroUsize::new(e)) } else { Err(()) });
1148 assert_in_place_trait(&iter);
1149 let sink = iter.collect::<Result<Vec<_>, _>>().unwrap();
1150 let sinkptr = sink.as_ptr();
1151 assert_eq!(srcptr, sinkptr as *const usize);
1155 fn test_from_iter_specialization_head_tail_drop() {
1156 let drop_count: Vec<_> = (0..=2).map(|_| Rc::new(())).collect();
1157 let src: Vec<_> = drop_count.iter().cloned().collect();
1158 let srcptr = src.as_ptr();
1159 let iter = src.into_iter();
1160 let sink: Vec<_> = iter.skip(1).take(1).collect();
1161 let sinkptr = sink.as_ptr();
1162 assert_eq!(srcptr, sinkptr, "specialization was applied");
1163 assert_eq!(Rc::strong_count(&drop_count[0]), 1, "front was dropped");
1164 assert_eq!(Rc::strong_count(&drop_count[1]), 2, "one element was collected");
1165 assert_eq!(Rc::strong_count(&drop_count[2]), 1, "tail was dropped");
1166 assert_eq!(sink.len(), 1);
1170 fn test_from_iter_specialization_panic_during_iteration_drops() {
1171 let drop_count: Vec<_> = (0..=2).map(|_| Rc::new(())).collect();
1172 let src: Vec<_> = drop_count.iter().cloned().collect();
1173 let iter = src.into_iter();
1175 let _ = std::panic::catch_unwind(AssertUnwindSafe(|| {
1178 .filter_map(|(i, e)| {
1180 std::panic!("aborting iteration");
1184 .collect::<Vec<_>>();
1188 drop_count.iter().map(Rc::strong_count).all(|count| count == 1),
1189 "all items were dropped once"
1194 fn test_from_iter_specialization_panic_during_drop_doesnt_leak() {
1195 static mut DROP_COUNTER_OLD: [usize; 5] = [0; 5];
1196 static mut DROP_COUNTER_NEW: [usize; 2] = [0; 2];
1202 fn drop(&mut self) {
1204 DROP_COUNTER_OLD[self.0] += 1;
1211 println!("Dropped Old: {}", self.0);
1219 fn drop(&mut self) {
1221 DROP_COUNTER_NEW[self.0] += 1;
1224 println!("Dropped New: {}", self.0);
1228 let _ = std::panic::catch_unwind(AssertUnwindSafe(|| {
1229 let v = vec![Old(0), Old(1), Old(2), Old(3), Old(4)];
1230 let _ = v.into_iter().map(|x| New(x.0)).take(2).collect::<Vec<_>>();
1233 assert_eq!(unsafe { DROP_COUNTER_OLD[0] }, 1);
1234 assert_eq!(unsafe { DROP_COUNTER_OLD[1] }, 1);
1235 assert_eq!(unsafe { DROP_COUNTER_OLD[2] }, 1);
1236 assert_eq!(unsafe { DROP_COUNTER_OLD[3] }, 1);
1237 assert_eq!(unsafe { DROP_COUNTER_OLD[4] }, 1);
1239 assert_eq!(unsafe { DROP_COUNTER_NEW[0] }, 1);
1240 assert_eq!(unsafe { DROP_COUNTER_NEW[1] }, 1);
1243 // regression test for issue #85322. Peekable previously implemented InPlaceIterable,
1244 // but due to an interaction with IntoIter's current Clone implementation it failed to uphold
1247 fn test_collect_after_iterator_clone() {
1249 let mut i = v.into_iter().map(|i| i + 1).peekable();
1251 let v = i.clone().collect::<Vec<_>>();
1252 assert_eq!(v, [1, 1, 1, 1, 1]);
1253 assert!(v.len() <= v.capacity());
1256 fn test_cow_from() {
1257 let borrowed: &[_] = &["borrowed", "(slice)"];
1258 let owned = vec!["owned", "(vec)"];
1259 match (Cow::from(owned.clone()), Cow::from(borrowed)) {
1260 (Cow::Owned(o), Cow::Borrowed(b)) => assert!(o == owned && b == borrowed),
1261 _ => panic!("invalid `Cow::from`"),
1266 fn test_from_cow() {
1267 let borrowed: &[_] = &["borrowed", "(slice)"];
1268 let owned = vec!["owned", "(vec)"];
1269 assert_eq!(Vec::from(Cow::Borrowed(borrowed)), vec!["borrowed", "(slice)"]);
1270 assert_eq!(Vec::from(Cow::Owned(owned)), vec!["owned", "(vec)"]);
1274 fn assert_covariance() {
1275 fn drain<'new>(d: Drain<'static, &'static str>) -> Drain<'new, &'new str> {
1278 fn into_iter<'new>(i: IntoIter<&'static str>) -> IntoIter<&'new str> {
1284 fn from_into_inner() {
1285 let vec = vec![1, 2, 3];
1286 let ptr = vec.as_ptr();
1287 let vec = vec.into_iter().collect::<Vec<_>>();
1288 assert_eq!(vec, [1, 2, 3]);
1289 assert_eq!(vec.as_ptr(), ptr);
1291 let ptr = &vec[1] as *const _;
1292 let mut it = vec.into_iter();
1294 let vec = it.collect::<Vec<_>>();
1295 assert_eq!(vec, [2, 3]);
1296 assert!(ptr != vec.as_ptr());
1300 fn overaligned_allocations() {
1303 let mut v = vec![Foo(273)];
1304 for i in 0..0x1000 {
1306 assert!(v[0].0 == 273);
1307 assert!(v.as_ptr() as usize & 0xff == 0);
1309 assert!(v[0].0 == 273);
1310 assert!(v.as_ptr() as usize & 0xff == 0);
1315 fn drain_filter_empty() {
1316 let mut vec: Vec<i32> = vec![];
1319 let mut iter = vec.drain_filter(|_| true);
1320 assert_eq!(iter.size_hint(), (0, Some(0)));
1321 assert_eq!(iter.next(), None);
1322 assert_eq!(iter.size_hint(), (0, Some(0)));
1323 assert_eq!(iter.next(), None);
1324 assert_eq!(iter.size_hint(), (0, Some(0)));
1326 assert_eq!(vec.len(), 0);
1327 assert_eq!(vec, vec![]);
1331 fn drain_filter_zst() {
1332 let mut vec = vec![(), (), (), (), ()];
1333 let initial_len = vec.len();
1336 let mut iter = vec.drain_filter(|_| true);
1337 assert_eq!(iter.size_hint(), (0, Some(initial_len)));
1338 while let Some(_) = iter.next() {
1340 assert_eq!(iter.size_hint(), (0, Some(initial_len - count)));
1342 assert_eq!(iter.size_hint(), (0, Some(0)));
1343 assert_eq!(iter.next(), None);
1344 assert_eq!(iter.size_hint(), (0, Some(0)));
1347 assert_eq!(count, initial_len);
1348 assert_eq!(vec.len(), 0);
1349 assert_eq!(vec, vec![]);
1353 fn drain_filter_false() {
1354 let mut vec = vec![1, 2, 3, 4, 5, 6, 7, 8, 9, 10];
1356 let initial_len = vec.len();
1359 let mut iter = vec.drain_filter(|_| false);
1360 assert_eq!(iter.size_hint(), (0, Some(initial_len)));
1361 for _ in iter.by_ref() {
1364 assert_eq!(iter.size_hint(), (0, Some(0)));
1365 assert_eq!(iter.next(), None);
1366 assert_eq!(iter.size_hint(), (0, Some(0)));
1369 assert_eq!(count, 0);
1370 assert_eq!(vec.len(), initial_len);
1371 assert_eq!(vec, vec![1, 2, 3, 4, 5, 6, 7, 8, 9, 10]);
1375 fn drain_filter_true() {
1376 let mut vec = vec![1, 2, 3, 4, 5, 6, 7, 8, 9, 10];
1378 let initial_len = vec.len();
1381 let mut iter = vec.drain_filter(|_| true);
1382 assert_eq!(iter.size_hint(), (0, Some(initial_len)));
1383 while let Some(_) = iter.next() {
1385 assert_eq!(iter.size_hint(), (0, Some(initial_len - count)));
1387 assert_eq!(iter.size_hint(), (0, Some(0)));
1388 assert_eq!(iter.next(), None);
1389 assert_eq!(iter.size_hint(), (0, Some(0)));
1392 assert_eq!(count, initial_len);
1393 assert_eq!(vec.len(), 0);
1394 assert_eq!(vec, vec![]);
1398 fn drain_filter_complex() {
1400 // [+xxx++++++xxxxx++++x+x++]
1402 1, 2, 4, 6, 7, 9, 11, 13, 15, 17, 18, 20, 22, 24, 26, 27, 29, 31, 33, 34, 35, 36, 37,
1406 let removed = vec.drain_filter(|x| *x % 2 == 0).collect::<Vec<_>>();
1407 assert_eq!(removed.len(), 10);
1408 assert_eq!(removed, vec![2, 4, 6, 18, 20, 22, 24, 26, 34, 36]);
1410 assert_eq!(vec.len(), 14);
1411 assert_eq!(vec, vec![1, 7, 9, 11, 13, 15, 17, 27, 29, 31, 33, 35, 37, 39]);
1415 // [xxx++++++xxxxx++++x+x++]
1417 2, 4, 6, 7, 9, 11, 13, 15, 17, 18, 20, 22, 24, 26, 27, 29, 31, 33, 34, 35, 36, 37, 39,
1420 let removed = vec.drain_filter(|x| *x % 2 == 0).collect::<Vec<_>>();
1421 assert_eq!(removed.len(), 10);
1422 assert_eq!(removed, vec![2, 4, 6, 18, 20, 22, 24, 26, 34, 36]);
1424 assert_eq!(vec.len(), 13);
1425 assert_eq!(vec, vec![7, 9, 11, 13, 15, 17, 27, 29, 31, 33, 35, 37, 39]);
1429 // [xxx++++++xxxxx++++x+x]
1431 vec![2, 4, 6, 7, 9, 11, 13, 15, 17, 18, 20, 22, 24, 26, 27, 29, 31, 33, 34, 35, 36];
1433 let removed = vec.drain_filter(|x| *x % 2 == 0).collect::<Vec<_>>();
1434 assert_eq!(removed.len(), 10);
1435 assert_eq!(removed, vec![2, 4, 6, 18, 20, 22, 24, 26, 34, 36]);
1437 assert_eq!(vec.len(), 11);
1438 assert_eq!(vec, vec![7, 9, 11, 13, 15, 17, 27, 29, 31, 33, 35]);
1442 // [xxxxxxxxxx+++++++++++]
1443 let mut vec = vec![2, 4, 6, 8, 10, 12, 14, 16, 18, 20, 1, 3, 5, 7, 9, 11, 13, 15, 17, 19];
1445 let removed = vec.drain_filter(|x| *x % 2 == 0).collect::<Vec<_>>();
1446 assert_eq!(removed.len(), 10);
1447 assert_eq!(removed, vec![2, 4, 6, 8, 10, 12, 14, 16, 18, 20]);
1449 assert_eq!(vec.len(), 10);
1450 assert_eq!(vec, vec![1, 3, 5, 7, 9, 11, 13, 15, 17, 19]);
1454 // [+++++++++++xxxxxxxxxx]
1455 let mut vec = vec![1, 3, 5, 7, 9, 11, 13, 15, 17, 19, 2, 4, 6, 8, 10, 12, 14, 16, 18, 20];
1457 let removed = vec.drain_filter(|x| *x % 2 == 0).collect::<Vec<_>>();
1458 assert_eq!(removed.len(), 10);
1459 assert_eq!(removed, vec![2, 4, 6, 8, 10, 12, 14, 16, 18, 20]);
1461 assert_eq!(vec.len(), 10);
1462 assert_eq!(vec, vec![1, 3, 5, 7, 9, 11, 13, 15, 17, 19]);
1466 // FIXME: re-enable emscripten once it can unwind again
1468 #[cfg(not(target_os = "emscripten"))]
1469 fn drain_filter_consumed_panic() {
1471 use std::sync::Mutex;
1475 drop_counts: Rc<Mutex<Vec<usize>>>,
1478 impl Drop for Check {
1479 fn drop(&mut self) {
1480 self.drop_counts.lock().unwrap()[self.index] += 1;
1481 println!("drop: {}", self.index);
1485 let check_count = 10;
1486 let drop_counts = Rc::new(Mutex::new(vec![0_usize; check_count]));
1487 let mut data: Vec<Check> = (0..check_count)
1488 .map(|index| Check { index, drop_counts: Rc::clone(&drop_counts) })
1491 let _ = std::panic::catch_unwind(move || {
1492 let filter = |c: &mut Check| {
1494 panic!("panic at index: {}", c.index);
1496 // Verify that if the filter could panic again on another element
1497 // that it would not cause a double panic and all elements of the
1498 // vec would still be dropped exactly once.
1500 panic!("panic at index: {}", c.index);
1504 let drain = data.drain_filter(filter);
1506 // NOTE: The DrainFilter is explicitly consumed
1507 drain.for_each(drop);
1510 let drop_counts = drop_counts.lock().unwrap();
1511 assert_eq!(check_count, drop_counts.len());
1513 for (index, count) in drop_counts.iter().cloned().enumerate() {
1514 assert_eq!(1, count, "unexpected drop count at index: {} (count: {})", index, count);
1518 // FIXME: Re-enable emscripten once it can catch panics
1520 #[cfg(not(target_os = "emscripten"))]
1521 fn drain_filter_unconsumed_panic() {
1523 use std::sync::Mutex;
1527 drop_counts: Rc<Mutex<Vec<usize>>>,
1530 impl Drop for Check {
1531 fn drop(&mut self) {
1532 self.drop_counts.lock().unwrap()[self.index] += 1;
1533 println!("drop: {}", self.index);
1537 let check_count = 10;
1538 let drop_counts = Rc::new(Mutex::new(vec![0_usize; check_count]));
1539 let mut data: Vec<Check> = (0..check_count)
1540 .map(|index| Check { index, drop_counts: Rc::clone(&drop_counts) })
1543 let _ = std::panic::catch_unwind(move || {
1544 let filter = |c: &mut Check| {
1546 panic!("panic at index: {}", c.index);
1548 // Verify that if the filter could panic again on another element
1549 // that it would not cause a double panic and all elements of the
1550 // vec would still be dropped exactly once.
1552 panic!("panic at index: {}", c.index);
1556 let _drain = data.drain_filter(filter);
1558 // NOTE: The DrainFilter is dropped without being consumed
1561 let drop_counts = drop_counts.lock().unwrap();
1562 assert_eq!(check_count, drop_counts.len());
1564 for (index, count) in drop_counts.iter().cloned().enumerate() {
1565 assert_eq!(1, count, "unexpected drop count at index: {} (count: {})", index, count);
1570 fn drain_filter_unconsumed() {
1571 let mut vec = vec![1, 2, 3, 4];
1572 let drain = vec.drain_filter(|&mut x| x % 2 != 0);
1574 assert_eq!(vec, [2, 4]);
1578 fn test_drain_filter_keep_rest() {
1579 let mut v = vec![0, 1, 2, 3, 4, 5, 6];
1580 let mut drain = v.drain_filter(|&mut x| x % 2 == 0);
1581 assert_eq!(drain.next(), Some(0));
1582 assert_eq!(drain.next(), Some(2));
1585 assert_eq!(v, &[1, 3, 4, 5, 6]);
1589 fn test_drain_filter_keep_rest_all() {
1590 let mut v = vec![0, 1, 2, 3, 4, 5, 6];
1591 v.drain_filter(|_| true).keep_rest();
1592 assert_eq!(v, &[0, 1, 2, 3, 4, 5, 6]);
1596 fn test_drain_filter_keep_rest_none() {
1597 let mut v = vec![0, 1, 2, 3, 4, 5, 6];
1598 let mut drain = v.drain_filter(|_| true);
1600 drain.by_ref().for_each(drop);
1607 fn test_reserve_exact() {
1608 // This is all the same as test_reserve
1610 let mut v = Vec::new();
1611 assert_eq!(v.capacity(), 0);
1614 assert!(v.capacity() >= 2);
1620 assert!(v.capacity() >= 16);
1621 v.reserve_exact(16);
1622 assert!(v.capacity() >= 32);
1626 v.reserve_exact(16);
1627 assert!(v.capacity() >= 33)
1631 #[cfg_attr(miri, ignore)] // Miri does not support signalling OOM
1632 #[cfg_attr(target_os = "android", ignore)] // Android used in CI has a broken dlmalloc
1633 fn test_try_reserve() {
1634 // These are the interesting cases:
1635 // * exactly isize::MAX should never trigger a CapacityOverflow (can be OOM)
1636 // * > isize::MAX should always fail
1637 // * On 16/32-bit should CapacityOverflow
1638 // * On 64-bit should OOM
1639 // * overflow may trigger when adding `len` to `cap` (in number of elements)
1640 // * overflow may trigger when multiplying `new_cap` by size_of::<T> (to get bytes)
1642 const MAX_CAP: usize = isize::MAX as usize;
1643 const MAX_USIZE: usize = usize::MAX;
1646 // Note: basic stuff is checked by test_reserve
1647 let mut empty_bytes: Vec<u8> = Vec::new();
1649 // Check isize::MAX doesn't count as an overflow
1650 if let Err(CapacityOverflow) = empty_bytes.try_reserve(MAX_CAP).map_err(|e| e.kind()) {
1651 panic!("isize::MAX shouldn't trigger an overflow!");
1653 // Play it again, frank! (just to be sure)
1654 if let Err(CapacityOverflow) = empty_bytes.try_reserve(MAX_CAP).map_err(|e| e.kind()) {
1655 panic!("isize::MAX shouldn't trigger an overflow!");
1658 // Check isize::MAX + 1 does count as overflow
1660 empty_bytes.try_reserve(MAX_CAP + 1).map_err(|e| e.kind()),
1661 Err(CapacityOverflow),
1662 "isize::MAX + 1 should trigger an overflow!"
1665 // Check usize::MAX does count as overflow
1667 empty_bytes.try_reserve(MAX_USIZE).map_err(|e| e.kind()),
1668 Err(CapacityOverflow),
1669 "usize::MAX should trigger an overflow!"
1674 // Same basic idea, but with non-zero len
1675 let mut ten_bytes: Vec<u8> = vec![1, 2, 3, 4, 5, 6, 7, 8, 9, 10];
1677 if let Err(CapacityOverflow) = ten_bytes.try_reserve(MAX_CAP - 10).map_err(|e| e.kind()) {
1678 panic!("isize::MAX shouldn't trigger an overflow!");
1680 if let Err(CapacityOverflow) = ten_bytes.try_reserve(MAX_CAP - 10).map_err(|e| e.kind()) {
1681 panic!("isize::MAX shouldn't trigger an overflow!");
1685 ten_bytes.try_reserve(MAX_CAP - 9).map_err(|e| e.kind()),
1686 Err(CapacityOverflow),
1687 "isize::MAX + 1 should trigger an overflow!"
1690 // Should always overflow in the add-to-len
1692 ten_bytes.try_reserve(MAX_USIZE).map_err(|e| e.kind()),
1693 Err(CapacityOverflow),
1694 "usize::MAX should trigger an overflow!"
1699 // Same basic idea, but with interesting type size
1700 let mut ten_u32s: Vec<u32> = vec![1, 2, 3, 4, 5, 6, 7, 8, 9, 10];
1702 if let Err(CapacityOverflow) = ten_u32s.try_reserve(MAX_CAP / 4 - 10).map_err(|e| e.kind())
1704 panic!("isize::MAX shouldn't trigger an overflow!");
1706 if let Err(CapacityOverflow) = ten_u32s.try_reserve(MAX_CAP / 4 - 10).map_err(|e| e.kind())
1708 panic!("isize::MAX shouldn't trigger an overflow!");
1712 ten_u32s.try_reserve(MAX_CAP / 4 - 9).map_err(|e| e.kind()),
1713 Err(CapacityOverflow),
1714 "isize::MAX + 1 should trigger an overflow!"
1717 // Should fail in the mul-by-size
1719 ten_u32s.try_reserve(MAX_USIZE - 20).map_err(|e| e.kind()),
1720 Err(CapacityOverflow),
1721 "usize::MAX should trigger an overflow!"
1727 #[cfg_attr(miri, ignore)] // Miri does not support signalling OOM
1728 #[cfg_attr(target_os = "android", ignore)] // Android used in CI has a broken dlmalloc
1729 fn test_try_reserve_exact() {
1730 // This is exactly the same as test_try_reserve with the method changed.
1731 // See that test for comments.
1733 const MAX_CAP: usize = isize::MAX as usize;
1734 const MAX_USIZE: usize = usize::MAX;
1737 let mut empty_bytes: Vec<u8> = Vec::new();
1739 if let Err(CapacityOverflow) = empty_bytes.try_reserve_exact(MAX_CAP).map_err(|e| e.kind())
1741 panic!("isize::MAX shouldn't trigger an overflow!");
1743 if let Err(CapacityOverflow) = empty_bytes.try_reserve_exact(MAX_CAP).map_err(|e| e.kind())
1745 panic!("isize::MAX shouldn't trigger an overflow!");
1749 empty_bytes.try_reserve_exact(MAX_CAP + 1).map_err(|e| e.kind()),
1750 Err(CapacityOverflow),
1751 "isize::MAX + 1 should trigger an overflow!"
1755 empty_bytes.try_reserve_exact(MAX_USIZE).map_err(|e| e.kind()),
1756 Err(CapacityOverflow),
1757 "usize::MAX should trigger an overflow!"
1762 let mut ten_bytes: Vec<u8> = vec![1, 2, 3, 4, 5, 6, 7, 8, 9, 10];
1764 if let Err(CapacityOverflow) =
1765 ten_bytes.try_reserve_exact(MAX_CAP - 10).map_err(|e| e.kind())
1767 panic!("isize::MAX shouldn't trigger an overflow!");
1769 if let Err(CapacityOverflow) =
1770 ten_bytes.try_reserve_exact(MAX_CAP - 10).map_err(|e| e.kind())
1772 panic!("isize::MAX shouldn't trigger an overflow!");
1776 ten_bytes.try_reserve_exact(MAX_CAP - 9).map_err(|e| e.kind()),
1777 Err(CapacityOverflow),
1778 "isize::MAX + 1 should trigger an overflow!"
1782 ten_bytes.try_reserve_exact(MAX_USIZE).map_err(|e| e.kind()),
1783 Err(CapacityOverflow),
1784 "usize::MAX should trigger an overflow!"
1789 let mut ten_u32s: Vec<u32> = vec![1, 2, 3, 4, 5, 6, 7, 8, 9, 10];
1791 if let Err(CapacityOverflow) =
1792 ten_u32s.try_reserve_exact(MAX_CAP / 4 - 10).map_err(|e| e.kind())
1794 panic!("isize::MAX shouldn't trigger an overflow!");
1796 if let Err(CapacityOverflow) =
1797 ten_u32s.try_reserve_exact(MAX_CAP / 4 - 10).map_err(|e| e.kind())
1799 panic!("isize::MAX shouldn't trigger an overflow!");
1803 ten_u32s.try_reserve_exact(MAX_CAP / 4 - 9).map_err(|e| e.kind()),
1804 Err(CapacityOverflow),
1805 "isize::MAX + 1 should trigger an overflow!"
1809 ten_u32s.try_reserve_exact(MAX_USIZE - 20).map_err(|e| e.kind()),
1810 Err(CapacityOverflow),
1811 "usize::MAX should trigger an overflow!"
1817 fn test_stable_pointers() {
1818 /// Pull an element from the iterator, then drop it.
1819 /// Useful to cover both the `next` and `drop` paths of an iterator.
1820 fn next_then_drop<I: Iterator>(mut i: I) {
1825 // Test that, if we reserved enough space, adding and removing elements does not
1826 // invalidate references into the vector (such as `v0`). This test also
1827 // runs in Miri, which would detect such problems.
1828 // Note that this test does *not* constitute a stable guarantee that all these functions do not
1829 // reallocate! Only what is explicitly documented at
1830 // <https://doc.rust-lang.org/nightly/std/vec/struct.Vec.html#guarantees> is stably guaranteed.
1831 let mut v = Vec::with_capacity(128);
1834 // Laundering the lifetime -- we take care that `v` does not reallocate, so that's okay.
1836 let v0 = unsafe { &mut *(v0 as *mut _) };
1837 // Now do a bunch of things and occasionally use `v0` again to assert it is still valid.
1839 // Pushing/inserting and popping/removing
1843 assert_eq!(*v0, 13);
1846 assert_eq!(*v0, 13);
1849 assert_eq!(v.len(), 2);
1850 v.swap_remove(1); // swap_remove the last element
1851 assert_eq!(*v0, 13);
1854 v.append(&mut vec![27, 19]);
1855 assert_eq!(*v0, 13);
1858 v.extend_from_slice(&[1, 2]);
1859 v.extend(&[1, 2]); // `slice::Iter` (with `T: Copy`) specialization
1860 v.extend(vec![2, 3]); // `vec::IntoIter` specialization
1861 v.extend(std::iter::once(3)); // `TrustedLen` specialization
1862 v.extend(std::iter::empty::<i32>()); // `TrustedLen` specialization with empty iterator
1863 v.extend(std::iter::once(3).filter(|_| true)); // base case
1864 v.extend(std::iter::once(&3)); // `cloned` specialization
1865 assert_eq!(*v0, 13);
1869 assert_eq!(*v0, 13);
1872 v.resize_with(v.len() + 10, || 42);
1873 assert_eq!(*v0, 13);
1874 v.resize_with(2, || panic!());
1875 assert_eq!(*v0, 13);
1877 // No-op reservation
1879 v.reserve_exact(32);
1880 assert_eq!(*v0, 13);
1883 v.resize_with(10, || 42);
1884 next_then_drop(v.drain(5..));
1885 assert_eq!(*v0, 13);
1888 v.resize_with(10, || 42);
1889 next_then_drop(v.splice(5.., vec![1, 2, 3, 4, 5])); // empty tail after range
1890 assert_eq!(*v0, 13);
1891 next_then_drop(v.splice(5..8, vec![1])); // replacement is smaller than original range
1892 assert_eq!(*v0, 13);
1893 next_then_drop(v.splice(5..6, [1; 10].into_iter().filter(|_| true))); // lower bound not exact
1894 assert_eq!(*v0, 13);
1896 // spare_capacity_mut
1897 v.spare_capacity_mut();
1898 assert_eq!(*v0, 13);
1900 // Smoke test that would fire even outside Miri if an actual relocation happened.
1902 assert_eq!(v[0], 0);
1905 // https://github.com/rust-lang/rust/pull/49496 introduced specialization based on:
1908 // unsafe impl<T: ?Sized> IsZero for *mut T {
1909 // fn is_zero(&self) -> bool {
1910 // (*self).is_null()
1915 // … to call `RawVec::with_capacity_zeroed` for creating `Vec<*mut T>`,
1916 // which is incorrect for fat pointers since `<*mut T>::is_null` only looks at the data component.
1917 // That is, a fat pointer can be “null” without being made entirely of zero bits.
1919 fn vec_macro_repeating_null_raw_fat_pointer() {
1920 let raw_dyn = &mut (|| ()) as &mut dyn Fn() as *mut dyn Fn();
1921 let vtable = dbg!(ptr_metadata(raw_dyn));
1922 let null_raw_dyn = ptr_from_raw_parts(std::ptr::null_mut(), vtable);
1923 assert!(null_raw_dyn.is_null());
1925 let vec = vec![null_raw_dyn; 1];
1926 dbg!(ptr_metadata(vec[0]));
1927 assert!(vec[0] == null_raw_dyn);
1929 // Polyfill for https://github.com/rust-lang/rfcs/pull/2580
1931 fn ptr_metadata(ptr: *mut dyn Fn()) -> *mut () {
1932 unsafe { std::mem::transmute::<*mut dyn Fn(), DynRepr>(ptr).vtable }
1935 fn ptr_from_raw_parts(data: *mut (), vtable: *mut ()) -> *mut dyn Fn() {
1936 unsafe { std::mem::transmute::<DynRepr, *mut dyn Fn()>(DynRepr { data, vtable }) }
1946 // This test will likely fail if you change the capacities used in
1947 // `RawVec::grow_amortized`.
1949 fn test_push_growth_strategy() {
1950 // If the element size is 1, we jump from 0 to 8, then double.
1952 let mut v1: Vec<u8> = vec![];
1953 assert_eq!(v1.capacity(), 0);
1957 assert_eq!(v1.capacity(), 8);
1962 assert_eq!(v1.capacity(), 16);
1967 assert_eq!(v1.capacity(), 32);
1972 assert_eq!(v1.capacity(), 64);
1976 // If the element size is 2..=1024, we jump from 0 to 4, then double.
1978 let mut v2: Vec<u16> = vec![];
1979 let mut v1024: Vec<[u8; 1024]> = vec![];
1980 assert_eq!(v2.capacity(), 0);
1981 assert_eq!(v1024.capacity(), 0);
1985 v1024.push([0; 1024]);
1986 assert_eq!(v2.capacity(), 4);
1987 assert_eq!(v1024.capacity(), 4);
1992 v1024.push([0; 1024]);
1993 assert_eq!(v2.capacity(), 8);
1994 assert_eq!(v1024.capacity(), 8);
1999 v1024.push([0; 1024]);
2000 assert_eq!(v2.capacity(), 16);
2001 assert_eq!(v1024.capacity(), 16);
2006 v1024.push([0; 1024]);
2007 assert_eq!(v2.capacity(), 32);
2008 assert_eq!(v1024.capacity(), 32);
2013 v1024.push([0; 1024]);
2014 assert_eq!(v2.capacity(), 64);
2015 assert_eq!(v1024.capacity(), 64);
2019 // If the element size is > 1024, we jump from 0 to 1, then double.
2021 let mut v1025: Vec<[u8; 1025]> = vec![];
2022 assert_eq!(v1025.capacity(), 0);
2025 v1025.push([0; 1025]);
2026 assert_eq!(v1025.capacity(), 1);
2030 v1025.push([0; 1025]);
2031 assert_eq!(v1025.capacity(), 2);
2035 v1025.push([0; 1025]);
2036 assert_eq!(v1025.capacity(), 4);
2040 v1025.push([0; 1025]);
2041 assert_eq!(v1025.capacity(), 8);
2045 v1025.push([0; 1025]);
2046 assert_eq!(v1025.capacity(), 16);
2050 v1025.push([0; 1025]);
2051 assert_eq!(v1025.capacity(), 32);
2055 v1025.push([0; 1025]);
2056 assert_eq!(v1025.capacity(), 64);
2061 macro_rules! generate_assert_eq_vec_and_prim {
2062 ($name:ident<$B:ident>($type:ty)) => {
2063 fn $name<A: PartialEq<$B> + Debug, $B: Debug>(a: Vec<A>, b: $type) {
2070 generate_assert_eq_vec_and_prim! { assert_eq_vec_and_slice <B>(&[B]) }
2071 generate_assert_eq_vec_and_prim! { assert_eq_vec_and_array_3<B>([B; 3]) }
2074 fn partialeq_vec_and_prim() {
2075 assert_eq_vec_and_slice(vec![1, 2, 3], &[1, 2, 3]);
2076 assert_eq_vec_and_array_3(vec![1, 2, 3], [1, 2, 3]);
2079 macro_rules! assert_partial_eq_valid {
2080 ($a2:expr, $a3:expr; $b2:expr, $b3: expr) => {
2081 assert!($a2 == $b2);
2082 assert!($a2 != $b3);
2083 assert!($a3 != $b2);
2084 assert!($a3 == $b3);
2085 assert_eq!($a2, $b2);
2086 assert_ne!($a2, $b3);
2087 assert_ne!($a3, $b2);
2088 assert_eq!($a3, $b3);
2093 fn partialeq_vec_full() {
2094 let vec2: Vec<_> = vec![1, 2];
2095 let vec3: Vec<_> = vec![1, 2, 3];
2096 let slice2: &[_] = &[1, 2];
2097 let slice3: &[_] = &[1, 2, 3];
2098 let slicemut2: &[_] = &mut [1, 2];
2099 let slicemut3: &[_] = &mut [1, 2, 3];
2100 let array2: [_; 2] = [1, 2];
2101 let array3: [_; 3] = [1, 2, 3];
2102 let arrayref2: &[_; 2] = &[1, 2];
2103 let arrayref3: &[_; 3] = &[1, 2, 3];
2105 assert_partial_eq_valid!(vec2,vec3; vec2,vec3);
2106 assert_partial_eq_valid!(vec2,vec3; slice2,slice3);
2107 assert_partial_eq_valid!(vec2,vec3; slicemut2,slicemut3);
2108 assert_partial_eq_valid!(slice2,slice3; vec2,vec3);
2109 assert_partial_eq_valid!(slicemut2,slicemut3; vec2,vec3);
2110 assert_partial_eq_valid!(vec2,vec3; array2,array3);
2111 assert_partial_eq_valid!(vec2,vec3; arrayref2,arrayref3);
2112 assert_partial_eq_valid!(vec2,vec3; arrayref2[..],arrayref3[..]);
2116 fn test_vec_cycle() {
2119 v: Vec<Cell<Option<&'a C<'a>>>>,
2128 let mut c1 = C::new();
2129 let mut c2 = C::new();
2130 let mut c3 = C::new();
2133 c1.v.push(Cell::new(None));
2134 c1.v.push(Cell::new(None));
2136 c2.v.push(Cell::new(None));
2137 c2.v.push(Cell::new(None));
2139 c3.v.push(Cell::new(None));
2140 c3.v.push(Cell::new(None));
2143 c1.v[0].set(Some(&c2));
2144 c1.v[1].set(Some(&c3));
2146 c2.v[0].set(Some(&c2));
2147 c2.v[1].set(Some(&c3));
2149 c3.v[0].set(Some(&c1));
2150 c3.v[1].set(Some(&c2));
2154 fn test_vec_cycle_wrapped() {
2156 v: Vec<Cell<Option<&'a C<'a>>>>,
2164 fn new() -> Refs<'a> {
2165 Refs { v: Vec::new() }
2171 C { refs: Refs::new() }
2175 let mut c1 = C::new();
2176 let mut c2 = C::new();
2177 let mut c3 = C::new();
2179 c1.refs.v.push(Cell::new(None));
2180 c1.refs.v.push(Cell::new(None));
2181 c2.refs.v.push(Cell::new(None));
2182 c2.refs.v.push(Cell::new(None));
2183 c3.refs.v.push(Cell::new(None));
2184 c3.refs.v.push(Cell::new(None));
2186 c1.refs.v[0].set(Some(&c2));
2187 c1.refs.v[1].set(Some(&c3));
2188 c2.refs.v[0].set(Some(&c2));
2189 c2.refs.v[1].set(Some(&c3));
2190 c3.refs.v[0].set(Some(&c1));
2191 c3.refs.v[1].set(Some(&c2));
2195 fn test_zero_sized_capacity() {
2196 for len in [0, 1, 2, 4, 8, 16, 32, 64, 128, 256] {
2197 let v = Vec::<()>::with_capacity(len);
2198 assert_eq!(v.len(), 0);
2199 assert_eq!(v.capacity(), usize::MAX);
2204 fn test_zero_sized_vec_push() {
2208 let mut tester = Vec::with_capacity(len);
2209 assert_eq!(tester.len(), 0);
2210 assert!(tester.capacity() >= len);
2214 assert_eq!(tester.len(), len);
2215 assert_eq!(tester.iter().count(), len);
2221 fn test_vec_macro_repeat() {
2222 assert_eq!(vec![1; 3], vec![1, 1, 1]);
2223 assert_eq!(vec![1; 2], vec![1, 1]);
2224 assert_eq!(vec![1; 1], vec![1]);
2225 assert_eq!(vec![1; 0], vec![]);
2227 // from_elem syntax (see RFC 832)
2228 let el = Box::new(1);
2230 assert_eq!(vec![el; n], vec![Box::new(1), Box::new(1), Box::new(1)]);
2234 fn test_vec_swap() {
2235 let mut a: Vec<isize> = vec![0, 1, 2, 3, 4, 5, 6];
2237 assert_eq!(a[2], 4);
2238 assert_eq!(a[4], 2);
2240 swap(&mut n, &mut a[0]);
2241 assert_eq!(a[0], 42);
2246 fn test_extend_from_within_spec() {
2250 impl Clone for CopyOnly {
2251 fn clone(&self) -> Self {
2252 panic!("extend_from_within must use specialization on copy");
2256 vec![CopyOnly, CopyOnly].extend_from_within(..);
2260 fn test_extend_from_within_clone() {
2261 let mut v = vec![String::from("sssss"), String::from("12334567890"), String::from("c")];
2262 v.extend_from_within(1..);
2264 assert_eq!(v, ["sssss", "12334567890", "c", "12334567890", "c"]);
2268 fn test_extend_from_within_complete_rande() {
2269 let mut v = vec![0, 1, 2, 3];
2270 v.extend_from_within(..);
2272 assert_eq!(v, [0, 1, 2, 3, 0, 1, 2, 3]);
2276 fn test_extend_from_within_empty_rande() {
2277 let mut v = vec![0, 1, 2, 3];
2278 v.extend_from_within(1..1);
2280 assert_eq!(v, [0, 1, 2, 3]);
2285 fn test_extend_from_within_out_of_rande() {
2286 let mut v = vec![0, 1];
2287 v.extend_from_within(..3);
2291 fn test_extend_from_within_zst() {
2292 let mut v = vec![(); 8];
2293 v.extend_from_within(3..7);
2295 assert_eq!(v, [(); 12]);
2299 fn test_extend_from_within_empty_vec() {
2300 let mut v = Vec::<i32>::new();
2301 v.extend_from_within(..);
2307 fn test_extend_from_within() {
2308 let mut v = vec![String::from("a"), String::from("b"), String::from("c")];
2309 v.extend_from_within(1..=2);
2310 v.extend_from_within(..=1);
2312 assert_eq!(v, ["a", "b", "c", "b", "c", "a", "b"]);
2316 fn test_vec_dedup_by() {
2317 let mut vec: Vec<i32> = vec![1, -1, 2, 3, 1, -5, 5, -2, 2];
2319 vec.dedup_by(|a, b| a.abs() == b.abs());
2321 assert_eq!(vec, [1, 2, 3, 1, -5, -2]);
2325 fn test_vec_dedup_empty() {
2326 let mut vec: Vec<i32> = Vec::new();
2330 assert_eq!(vec, []);
2334 fn test_vec_dedup_one() {
2335 let mut vec = vec![12i32];
2339 assert_eq!(vec, [12]);
2343 fn test_vec_dedup_multiple_ident() {
2344 let mut vec = vec![12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11];
2348 assert_eq!(vec, [12, 11]);
2352 fn test_vec_dedup_partialeq() {
2354 struct Foo(i32, i32);
2356 impl PartialEq for Foo {
2357 fn eq(&self, other: &Foo) -> bool {
2362 let mut vec = vec![Foo(0, 1), Foo(0, 5), Foo(1, 7), Foo(1, 9)];
2365 assert_eq!(vec, [Foo(0, 1), Foo(1, 7)]);
2369 fn test_vec_dedup() {
2370 let mut vec: Vec<bool> = Vec::with_capacity(8);
2371 let mut template = vec.clone();
2373 for x in 0u8..255u8 {
2377 let iter = (0..8).map(move |bit| (x >> bit) & 1 == 1);
2379 template.extend_from_slice(&vec);
2381 let (dedup, _) = template.partition_dedup();
2384 assert_eq!(vec, dedup);
2389 fn test_vec_dedup_panicking() {
2392 drop_counter: &'a Cell<u32>,
2397 impl<'a> PartialEq for Panic<'a> {
2398 fn eq(&self, other: &Self) -> bool {
2399 self.value == other.value
2403 impl<'a> Drop for Panic<'a> {
2404 fn drop(&mut self) {
2405 self.drop_counter.set(self.drop_counter.get() + 1);
2406 if !std::thread::panicking() {
2407 assert!(self.index != 4);
2412 let drop_counter = &Cell::new(0);
2414 Panic { drop_counter, value: false, index: 0 },
2415 Panic { drop_counter, value: false, index: 5 },
2416 Panic { drop_counter, value: true, index: 6 },
2417 Panic { drop_counter, value: true, index: 7 },
2420 Panic { drop_counter, value: false, index: 0 },
2421 // these elements get deduplicated
2422 Panic { drop_counter, value: false, index: 1 },
2423 Panic { drop_counter, value: false, index: 2 },
2424 Panic { drop_counter, value: false, index: 3 },
2425 Panic { drop_counter, value: false, index: 4 },
2426 // here it panics while dropping the item with index==4
2427 Panic { drop_counter, value: false, index: 5 },
2428 Panic { drop_counter, value: true, index: 6 },
2429 Panic { drop_counter, value: true, index: 7 },
2432 let _ = catch_unwind(AssertUnwindSafe(|| vec.dedup())).unwrap_err();
2434 assert_eq!(drop_counter.get(), 4);
2436 let ok = vec.iter().zip(expected.iter()).all(|(x, y)| x.index == y.index);
2439 panic!("expected: {expected:?}\ngot: {vec:?}\n");
2443 // Regression test for issue #82533
2445 fn test_extend_from_within_panicing_clone() {
2447 drop_count: &'dc AtomicU32,
2451 impl Clone for Panic<'_> {
2452 fn clone(&self) -> Self {
2454 panic!("panic! at the clone");
2461 impl Drop for Panic<'_> {
2462 fn drop(&mut self) {
2463 self.drop_count.fetch_add(1, Ordering::SeqCst);
2467 let count = core::sync::atomic::AtomicU32::new(0);
2469 Panic { drop_count: &count, aaaaa: false },
2470 Panic { drop_count: &count, aaaaa: true },
2471 Panic { drop_count: &count, aaaaa: false },
2474 // This should clone&append one Panic{..} at the end, and then panic while
2475 // cloning second Panic{..}. This means that `Panic::drop` should be called
2476 // 4 times (3 for items already in vector, 1 for just appended).
2478 // Previously just appended item was leaked, making drop_count = 3, instead of 4.
2479 std::panic::catch_unwind(move || vec.extend_from_within(..)).unwrap_err();
2481 assert_eq!(count.load(Ordering::SeqCst), 4);
2485 #[should_panic = "vec len overflow"]
2486 fn test_into_flattened_size_overflow() {
2487 let v = vec![[(); usize::MAX]; 2];
2488 let _ = v.into_flattened();