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_items() {
614 let mut vec = vec![1, 2, 3];
615 let mut vec2 = vec![];
616 for i in vec.drain(..) {
620 assert_eq!(vec2, [1, 2, 3]);
624 fn test_drain_items_reverse() {
625 let mut vec = vec![1, 2, 3];
626 let mut vec2 = vec![];
627 for i in vec.drain(..).rev() {
631 assert_eq!(vec2, [3, 2, 1]);
635 fn test_drain_items_zero_sized() {
636 let mut vec = vec![(), (), ()];
637 let mut vec2 = vec![];
638 for i in vec.drain(..) {
642 assert_eq!(vec2, [(), (), ()]);
647 fn test_drain_out_of_bounds() {
648 let mut v = vec![1, 2, 3, 4, 5];
653 fn test_drain_range() {
654 let mut v = vec![1, 2, 3, 4, 5];
655 for _ in v.drain(4..) {}
656 assert_eq!(v, &[1, 2, 3, 4]);
658 let mut v: Vec<_> = (1..6).map(|x| x.to_string()).collect();
659 for _ in v.drain(1..4) {}
660 assert_eq!(v, &[1.to_string(), 5.to_string()]);
662 let mut v: Vec<_> = (1..6).map(|x| x.to_string()).collect();
663 for _ in v.drain(1..4).rev() {}
664 assert_eq!(v, &[1.to_string(), 5.to_string()]);
666 let mut v: Vec<_> = vec![(); 5];
667 for _ in v.drain(1..4).rev() {}
668 assert_eq!(v, &[(), ()]);
672 fn test_drain_inclusive_range() {
673 let mut v = vec!['a', 'b', 'c', 'd', 'e'];
674 for _ in v.drain(1..=3) {}
675 assert_eq!(v, &['a', 'e']);
677 let mut v: Vec<_> = (0..=5).map(|x| x.to_string()).collect();
678 for _ in v.drain(1..=5) {}
679 assert_eq!(v, &["0".to_string()]);
681 let mut v: Vec<String> = (0..=5).map(|x| x.to_string()).collect();
682 for _ in v.drain(0..=5) {}
683 assert_eq!(v, Vec::<String>::new());
685 let mut v: Vec<_> = (0..=5).map(|x| x.to_string()).collect();
686 for _ in v.drain(0..=3) {}
687 assert_eq!(v, &["4".to_string(), "5".to_string()]);
689 let mut v: Vec<_> = (0..=1).map(|x| x.to_string()).collect();
690 for _ in v.drain(..=0) {}
691 assert_eq!(v, &["1".to_string()]);
695 fn test_drain_max_vec_size() {
696 let mut v = Vec::<()>::with_capacity(usize::MAX);
698 v.set_len(usize::MAX);
700 for _ in v.drain(usize::MAX - 1..) {}
701 assert_eq!(v.len(), usize::MAX - 1);
703 let mut v = Vec::<()>::with_capacity(usize::MAX);
705 v.set_len(usize::MAX);
707 for _ in v.drain(usize::MAX - 1..=usize::MAX - 1) {}
708 assert_eq!(v.len(), usize::MAX - 1);
713 fn test_drain_index_overflow() {
714 let mut v = Vec::<()>::with_capacity(usize::MAX);
716 v.set_len(usize::MAX);
718 v.drain(0..=usize::MAX);
723 fn test_drain_inclusive_out_of_bounds() {
724 let mut v = vec![1, 2, 3, 4, 5];
730 fn test_drain_start_overflow() {
731 let mut v = vec![1, 2, 3];
732 v.drain((Excluded(usize::MAX), Included(0)));
737 fn test_drain_end_overflow() {
738 let mut v = vec![1, 2, 3];
739 v.drain((Included(0), Included(usize::MAX)));
743 fn test_drain_leak() {
744 static mut DROPS: i32 = 0;
746 #[derive(Debug, PartialEq)]
756 panic!("panic in `drop`");
771 catch_unwind(AssertUnwindSafe(|| {
776 assert_eq!(unsafe { DROPS }, 4);
777 assert_eq!(v, vec![D(0, false), D(1, false), D(6, false),]);
782 let mut v = vec![1, 2, 3, 4, 5];
783 let a = [10, 11, 12];
784 v.splice(2..4, a.iter().cloned());
785 assert_eq!(v, &[1, 2, 10, 11, 12, 5]);
786 v.splice(1..3, Some(20));
787 assert_eq!(v, &[1, 20, 11, 12, 5]);
791 fn test_splice_inclusive_range() {
792 let mut v = vec![1, 2, 3, 4, 5];
793 let a = [10, 11, 12];
794 let t1: Vec<_> = v.splice(2..=3, a.iter().cloned()).collect();
795 assert_eq!(v, &[1, 2, 10, 11, 12, 5]);
796 assert_eq!(t1, &[3, 4]);
797 let t2: Vec<_> = v.splice(1..=2, Some(20)).collect();
798 assert_eq!(v, &[1, 20, 11, 12, 5]);
799 assert_eq!(t2, &[2, 10]);
804 fn test_splice_out_of_bounds() {
805 let mut v = vec![1, 2, 3, 4, 5];
806 let a = [10, 11, 12];
807 v.splice(5..6, a.iter().cloned());
812 fn test_splice_inclusive_out_of_bounds() {
813 let mut v = vec![1, 2, 3, 4, 5];
814 let a = [10, 11, 12];
815 v.splice(5..=5, a.iter().cloned());
819 fn test_splice_items_zero_sized() {
820 let mut vec = vec![(), (), ()];
822 let t: Vec<_> = vec.splice(1..2, vec2.iter().cloned()).collect();
823 assert_eq!(vec, &[(), ()]);
824 assert_eq!(t, &[()]);
828 fn test_splice_unbounded() {
829 let mut vec = vec![1, 2, 3, 4, 5];
830 let t: Vec<_> = vec.splice(.., None).collect();
831 assert_eq!(vec, &[]);
832 assert_eq!(t, &[1, 2, 3, 4, 5]);
836 fn test_splice_forget() {
837 let mut v = vec![1, 2, 3, 4, 5];
838 let a = [10, 11, 12];
839 std::mem::forget(v.splice(2..4, a.iter().cloned()));
840 assert_eq!(v, &[1, 2]);
844 fn test_into_boxed_slice() {
845 let xs = vec![1, 2, 3];
846 let ys = xs.into_boxed_slice();
847 assert_eq!(&*ys, [1, 2, 3]);
852 let mut vec = vec![1, 2, 3];
853 let mut vec2 = vec![4, 5, 6];
854 vec.append(&mut vec2);
855 assert_eq!(vec, [1, 2, 3, 4, 5, 6]);
856 assert_eq!(vec2, []);
860 fn test_split_off() {
861 let mut vec = vec![1, 2, 3, 4, 5, 6];
862 let orig_capacity = vec.capacity();
863 let vec2 = vec.split_off(4);
864 assert_eq!(vec, [1, 2, 3, 4]);
865 assert_eq!(vec2, [5, 6]);
866 assert_eq!(vec.capacity(), orig_capacity);
870 fn test_split_off_take_all() {
871 let mut vec = vec![1, 2, 3, 4, 5, 6];
872 let orig_ptr = vec.as_ptr();
873 let orig_capacity = vec.capacity();
874 let vec2 = vec.split_off(0);
876 assert_eq!(vec2, [1, 2, 3, 4, 5, 6]);
877 assert_eq!(vec.capacity(), orig_capacity);
878 assert_eq!(vec2.as_ptr(), orig_ptr);
882 fn test_into_iter_as_slice() {
883 let vec = vec!['a', 'b', 'c'];
884 let mut into_iter = vec.into_iter();
885 assert_eq!(into_iter.as_slice(), &['a', 'b', 'c']);
886 let _ = into_iter.next().unwrap();
887 assert_eq!(into_iter.as_slice(), &['b', 'c']);
888 let _ = into_iter.next().unwrap();
889 let _ = into_iter.next().unwrap();
890 assert_eq!(into_iter.as_slice(), &[]);
894 fn test_into_iter_as_mut_slice() {
895 let vec = vec!['a', 'b', 'c'];
896 let mut into_iter = vec.into_iter();
897 assert_eq!(into_iter.as_slice(), &['a', 'b', 'c']);
898 into_iter.as_mut_slice()[0] = 'x';
899 into_iter.as_mut_slice()[1] = 'y';
900 assert_eq!(into_iter.next().unwrap(), 'x');
901 assert_eq!(into_iter.as_slice(), &['y', 'c']);
905 fn test_into_iter_debug() {
906 let vec = vec!['a', 'b', 'c'];
907 let into_iter = vec.into_iter();
908 let debug = format!("{:?}", into_iter);
909 assert_eq!(debug, "IntoIter(['a', 'b', 'c'])");
913 fn test_into_iter_count() {
914 assert_eq!(vec![1, 2, 3].into_iter().count(), 3);
918 fn test_into_iter_clone() {
919 fn iter_equal<I: Iterator<Item = i32>>(it: I, slice: &[i32]) {
920 let v: Vec<i32> = it.collect();
921 assert_eq!(&v[..], slice);
923 let mut it = vec![1, 2, 3].into_iter();
924 iter_equal(it.clone(), &[1, 2, 3]);
925 assert_eq!(it.next(), Some(1));
926 let mut it = it.rev();
927 iter_equal(it.clone(), &[3, 2]);
928 assert_eq!(it.next(), Some(3));
929 iter_equal(it.clone(), &[2]);
930 assert_eq!(it.next(), Some(2));
931 iter_equal(it.clone(), &[]);
932 assert_eq!(it.next(), None);
936 fn test_into_iter_leak() {
937 static mut DROPS: i32 = 0;
948 panic!("panic in `drop`");
953 let v = vec![D(false), D(true), D(false)];
955 catch_unwind(move || drop(v.into_iter())).ok();
957 assert_eq!(unsafe { DROPS }, 3);
961 fn test_from_iter_specialization() {
962 let src: Vec<usize> = vec![0usize; 1];
963 let srcptr = src.as_ptr();
964 let sink = src.into_iter().collect::<Vec<_>>();
965 let sinkptr = sink.as_ptr();
966 assert_eq!(srcptr, sinkptr);
970 fn test_from_iter_partially_drained_in_place_specialization() {
971 let src: Vec<usize> = vec![0usize; 10];
972 let srcptr = src.as_ptr();
973 let mut iter = src.into_iter();
976 let sink = iter.collect::<Vec<_>>();
977 let sinkptr = sink.as_ptr();
978 assert_eq!(srcptr, sinkptr);
982 fn test_from_iter_specialization_with_iterator_adapters() {
983 fn assert_in_place_trait<T: InPlaceIterable>(_: &T) {}
984 let src: Vec<usize> = vec![0usize; 256];
985 let srcptr = src.as_ptr();
990 .zip(std::iter::repeat(1usize))
992 .map_while(Option::Some)
995 .map(|e| std::num::NonZeroUsize::new(e));
996 assert_in_place_trait(&iter);
997 let sink = iter.collect::<Vec<_>>();
998 let sinkptr = sink.as_ptr();
999 assert_eq!(srcptr, sinkptr as *const usize);
1003 fn test_from_iter_specialization_head_tail_drop() {
1004 let drop_count: Vec<_> = (0..=2).map(|_| Rc::new(())).collect();
1005 let src: Vec<_> = drop_count.iter().cloned().collect();
1006 let srcptr = src.as_ptr();
1007 let iter = src.into_iter();
1008 let sink: Vec<_> = iter.skip(1).take(1).collect();
1009 let sinkptr = sink.as_ptr();
1010 assert_eq!(srcptr, sinkptr, "specialization was applied");
1011 assert_eq!(Rc::strong_count(&drop_count[0]), 1, "front was dropped");
1012 assert_eq!(Rc::strong_count(&drop_count[1]), 2, "one element was collected");
1013 assert_eq!(Rc::strong_count(&drop_count[2]), 1, "tail was dropped");
1014 assert_eq!(sink.len(), 1);
1018 fn test_from_iter_specialization_panic_drop() {
1019 let drop_count: Vec<_> = (0..=2).map(|_| Rc::new(())).collect();
1020 let src: Vec<_> = drop_count.iter().cloned().collect();
1021 let iter = src.into_iter();
1023 let _ = std::panic::catch_unwind(AssertUnwindSafe(|| {
1026 .filter_map(|(i, e)| {
1028 std::panic!("aborting iteration");
1032 .collect::<Vec<_>>();
1036 drop_count.iter().map(Rc::strong_count).all(|count| count == 1),
1037 "all items were dropped once"
1042 fn test_cow_from() {
1043 let borrowed: &[_] = &["borrowed", "(slice)"];
1044 let owned = vec!["owned", "(vec)"];
1045 match (Cow::from(owned.clone()), Cow::from(borrowed)) {
1046 (Cow::Owned(o), Cow::Borrowed(b)) => assert!(o == owned && b == borrowed),
1047 _ => panic!("invalid `Cow::from`"),
1052 fn test_from_cow() {
1053 let borrowed: &[_] = &["borrowed", "(slice)"];
1054 let owned = vec!["owned", "(vec)"];
1055 assert_eq!(Vec::from(Cow::Borrowed(borrowed)), vec!["borrowed", "(slice)"]);
1056 assert_eq!(Vec::from(Cow::Owned(owned)), vec!["owned", "(vec)"]);
1060 fn assert_covariance() {
1061 fn drain<'new>(d: Drain<'static, &'static str>) -> Drain<'new, &'new str> {
1064 fn into_iter<'new>(i: IntoIter<&'static str>) -> IntoIter<&'new str> {
1070 fn from_into_inner() {
1071 let vec = vec![1, 2, 3];
1072 let ptr = vec.as_ptr();
1073 let vec = vec.into_iter().collect::<Vec<_>>();
1074 assert_eq!(vec, [1, 2, 3]);
1075 assert_eq!(vec.as_ptr(), ptr);
1077 let ptr = &vec[1] as *const _;
1078 let mut it = vec.into_iter();
1080 let vec = it.collect::<Vec<_>>();
1081 assert_eq!(vec, [2, 3]);
1082 assert!(ptr != vec.as_ptr());
1086 fn overaligned_allocations() {
1089 let mut v = vec![Foo(273)];
1090 for i in 0..0x1000 {
1092 assert!(v[0].0 == 273);
1093 assert!(v.as_ptr() as usize & 0xff == 0);
1095 assert!(v[0].0 == 273);
1096 assert!(v.as_ptr() as usize & 0xff == 0);
1101 fn drain_filter_empty() {
1102 let mut vec: Vec<i32> = vec![];
1105 let mut iter = vec.drain_filter(|_| true);
1106 assert_eq!(iter.size_hint(), (0, Some(0)));
1107 assert_eq!(iter.next(), None);
1108 assert_eq!(iter.size_hint(), (0, Some(0)));
1109 assert_eq!(iter.next(), None);
1110 assert_eq!(iter.size_hint(), (0, Some(0)));
1112 assert_eq!(vec.len(), 0);
1113 assert_eq!(vec, vec![]);
1117 fn drain_filter_zst() {
1118 let mut vec = vec![(), (), (), (), ()];
1119 let initial_len = vec.len();
1122 let mut iter = vec.drain_filter(|_| true);
1123 assert_eq!(iter.size_hint(), (0, Some(initial_len)));
1124 while let Some(_) = iter.next() {
1126 assert_eq!(iter.size_hint(), (0, Some(initial_len - count)));
1128 assert_eq!(iter.size_hint(), (0, Some(0)));
1129 assert_eq!(iter.next(), None);
1130 assert_eq!(iter.size_hint(), (0, Some(0)));
1133 assert_eq!(count, initial_len);
1134 assert_eq!(vec.len(), 0);
1135 assert_eq!(vec, vec![]);
1139 fn drain_filter_false() {
1140 let mut vec = vec![1, 2, 3, 4, 5, 6, 7, 8, 9, 10];
1142 let initial_len = vec.len();
1145 let mut iter = vec.drain_filter(|_| false);
1146 assert_eq!(iter.size_hint(), (0, Some(initial_len)));
1147 for _ in iter.by_ref() {
1150 assert_eq!(iter.size_hint(), (0, Some(0)));
1151 assert_eq!(iter.next(), None);
1152 assert_eq!(iter.size_hint(), (0, Some(0)));
1155 assert_eq!(count, 0);
1156 assert_eq!(vec.len(), initial_len);
1157 assert_eq!(vec, vec![1, 2, 3, 4, 5, 6, 7, 8, 9, 10]);
1161 fn drain_filter_true() {
1162 let mut vec = vec![1, 2, 3, 4, 5, 6, 7, 8, 9, 10];
1164 let initial_len = vec.len();
1167 let mut iter = vec.drain_filter(|_| true);
1168 assert_eq!(iter.size_hint(), (0, Some(initial_len)));
1169 while let Some(_) = iter.next() {
1171 assert_eq!(iter.size_hint(), (0, Some(initial_len - count)));
1173 assert_eq!(iter.size_hint(), (0, Some(0)));
1174 assert_eq!(iter.next(), None);
1175 assert_eq!(iter.size_hint(), (0, Some(0)));
1178 assert_eq!(count, initial_len);
1179 assert_eq!(vec.len(), 0);
1180 assert_eq!(vec, vec![]);
1184 fn drain_filter_complex() {
1186 // [+xxx++++++xxxxx++++x+x++]
1188 1, 2, 4, 6, 7, 9, 11, 13, 15, 17, 18, 20, 22, 24, 26, 27, 29, 31, 33, 34, 35, 36, 37,
1192 let removed = vec.drain_filter(|x| *x % 2 == 0).collect::<Vec<_>>();
1193 assert_eq!(removed.len(), 10);
1194 assert_eq!(removed, vec![2, 4, 6, 18, 20, 22, 24, 26, 34, 36]);
1196 assert_eq!(vec.len(), 14);
1197 assert_eq!(vec, vec![1, 7, 9, 11, 13, 15, 17, 27, 29, 31, 33, 35, 37, 39]);
1201 // [xxx++++++xxxxx++++x+x++]
1203 2, 4, 6, 7, 9, 11, 13, 15, 17, 18, 20, 22, 24, 26, 27, 29, 31, 33, 34, 35, 36, 37, 39,
1206 let removed = vec.drain_filter(|x| *x % 2 == 0).collect::<Vec<_>>();
1207 assert_eq!(removed.len(), 10);
1208 assert_eq!(removed, vec![2, 4, 6, 18, 20, 22, 24, 26, 34, 36]);
1210 assert_eq!(vec.len(), 13);
1211 assert_eq!(vec, vec![7, 9, 11, 13, 15, 17, 27, 29, 31, 33, 35, 37, 39]);
1215 // [xxx++++++xxxxx++++x+x]
1217 vec![2, 4, 6, 7, 9, 11, 13, 15, 17, 18, 20, 22, 24, 26, 27, 29, 31, 33, 34, 35, 36];
1219 let removed = vec.drain_filter(|x| *x % 2 == 0).collect::<Vec<_>>();
1220 assert_eq!(removed.len(), 10);
1221 assert_eq!(removed, vec![2, 4, 6, 18, 20, 22, 24, 26, 34, 36]);
1223 assert_eq!(vec.len(), 11);
1224 assert_eq!(vec, vec![7, 9, 11, 13, 15, 17, 27, 29, 31, 33, 35]);
1228 // [xxxxxxxxxx+++++++++++]
1229 let mut vec = vec![2, 4, 6, 8, 10, 12, 14, 16, 18, 20, 1, 3, 5, 7, 9, 11, 13, 15, 17, 19];
1231 let removed = vec.drain_filter(|x| *x % 2 == 0).collect::<Vec<_>>();
1232 assert_eq!(removed.len(), 10);
1233 assert_eq!(removed, vec![2, 4, 6, 8, 10, 12, 14, 16, 18, 20]);
1235 assert_eq!(vec.len(), 10);
1236 assert_eq!(vec, vec![1, 3, 5, 7, 9, 11, 13, 15, 17, 19]);
1240 // [+++++++++++xxxxxxxxxx]
1241 let mut vec = vec![1, 3, 5, 7, 9, 11, 13, 15, 17, 19, 2, 4, 6, 8, 10, 12, 14, 16, 18, 20];
1243 let removed = vec.drain_filter(|x| *x % 2 == 0).collect::<Vec<_>>();
1244 assert_eq!(removed.len(), 10);
1245 assert_eq!(removed, vec![2, 4, 6, 8, 10, 12, 14, 16, 18, 20]);
1247 assert_eq!(vec.len(), 10);
1248 assert_eq!(vec, vec![1, 3, 5, 7, 9, 11, 13, 15, 17, 19]);
1252 // FIXME: re-enable emscripten once it can unwind again
1254 #[cfg(not(target_os = "emscripten"))]
1255 fn drain_filter_consumed_panic() {
1257 use std::sync::Mutex;
1261 drop_counts: Rc<Mutex<Vec<usize>>>,
1264 impl Drop for Check {
1265 fn drop(&mut self) {
1266 self.drop_counts.lock().unwrap()[self.index] += 1;
1267 println!("drop: {}", self.index);
1271 let check_count = 10;
1272 let drop_counts = Rc::new(Mutex::new(vec![0_usize; check_count]));
1273 let mut data: Vec<Check> = (0..check_count)
1274 .map(|index| Check { index, drop_counts: Rc::clone(&drop_counts) })
1277 let _ = std::panic::catch_unwind(move || {
1278 let filter = |c: &mut Check| {
1280 panic!("panic at index: {}", c.index);
1282 // Verify that if the filter could panic again on another element
1283 // that it would not cause a double panic and all elements of the
1284 // vec would still be dropped exactly once.
1286 panic!("panic at index: {}", c.index);
1290 let drain = data.drain_filter(filter);
1292 // NOTE: The DrainFilter is explicitly consumed
1293 drain.for_each(drop);
1296 let drop_counts = drop_counts.lock().unwrap();
1297 assert_eq!(check_count, drop_counts.len());
1299 for (index, count) in drop_counts.iter().cloned().enumerate() {
1300 assert_eq!(1, count, "unexpected drop count at index: {} (count: {})", index, count);
1304 // FIXME: Re-enable emscripten once it can catch panics
1306 #[cfg(not(target_os = "emscripten"))]
1307 fn drain_filter_unconsumed_panic() {
1309 use std::sync::Mutex;
1313 drop_counts: Rc<Mutex<Vec<usize>>>,
1316 impl Drop for Check {
1317 fn drop(&mut self) {
1318 self.drop_counts.lock().unwrap()[self.index] += 1;
1319 println!("drop: {}", self.index);
1323 let check_count = 10;
1324 let drop_counts = Rc::new(Mutex::new(vec![0_usize; check_count]));
1325 let mut data: Vec<Check> = (0..check_count)
1326 .map(|index| Check { index, drop_counts: Rc::clone(&drop_counts) })
1329 let _ = std::panic::catch_unwind(move || {
1330 let filter = |c: &mut Check| {
1332 panic!("panic at index: {}", c.index);
1334 // Verify that if the filter could panic again on another element
1335 // that it would not cause a double panic and all elements of the
1336 // vec would still be dropped exactly once.
1338 panic!("panic at index: {}", c.index);
1342 let _drain = data.drain_filter(filter);
1344 // NOTE: The DrainFilter is dropped without being consumed
1347 let drop_counts = drop_counts.lock().unwrap();
1348 assert_eq!(check_count, drop_counts.len());
1350 for (index, count) in drop_counts.iter().cloned().enumerate() {
1351 assert_eq!(1, count, "unexpected drop count at index: {} (count: {})", index, count);
1356 fn drain_filter_unconsumed() {
1357 let mut vec = vec![1, 2, 3, 4];
1358 let drain = vec.drain_filter(|&mut x| x % 2 != 0);
1360 assert_eq!(vec, [2, 4]);
1364 fn test_reserve_exact() {
1365 // This is all the same as test_reserve
1367 let mut v = Vec::new();
1368 assert_eq!(v.capacity(), 0);
1371 assert!(v.capacity() >= 2);
1377 assert!(v.capacity() >= 16);
1378 v.reserve_exact(16);
1379 assert!(v.capacity() >= 32);
1383 v.reserve_exact(16);
1384 assert!(v.capacity() >= 33)
1388 #[cfg_attr(miri, ignore)] // Miri does not support signalling OOM
1389 #[cfg_attr(target_os = "android", ignore)] // Android used in CI has a broken dlmalloc
1390 fn test_try_reserve() {
1391 // These are the interesting cases:
1392 // * exactly isize::MAX should never trigger a CapacityOverflow (can be OOM)
1393 // * > isize::MAX should always fail
1394 // * On 16/32-bit should CapacityOverflow
1395 // * On 64-bit should OOM
1396 // * overflow may trigger when adding `len` to `cap` (in number of elements)
1397 // * overflow may trigger when multiplying `new_cap` by size_of::<T> (to get bytes)
1399 const MAX_CAP: usize = isize::MAX as usize;
1400 const MAX_USIZE: usize = usize::MAX;
1402 // On 16/32-bit, we check that allocations don't exceed isize::MAX,
1403 // on 64-bit, we assume the OS will give an OOM for such a ridiculous size.
1404 // Any platform that succeeds for these requests is technically broken with
1405 // ptr::offset because LLVM is the worst.
1406 let guards_against_isize = usize::BITS < 64;
1409 // Note: basic stuff is checked by test_reserve
1410 let mut empty_bytes: Vec<u8> = Vec::new();
1412 // Check isize::MAX doesn't count as an overflow
1413 if let Err(CapacityOverflow) = empty_bytes.try_reserve(MAX_CAP) {
1414 panic!("isize::MAX shouldn't trigger an overflow!");
1416 // Play it again, frank! (just to be sure)
1417 if let Err(CapacityOverflow) = empty_bytes.try_reserve(MAX_CAP) {
1418 panic!("isize::MAX shouldn't trigger an overflow!");
1421 if guards_against_isize {
1422 // Check isize::MAX + 1 does count as overflow
1423 if let Err(CapacityOverflow) = empty_bytes.try_reserve(MAX_CAP + 1) {
1425 panic!("isize::MAX + 1 should trigger an overflow!")
1428 // Check usize::MAX does count as overflow
1429 if let Err(CapacityOverflow) = empty_bytes.try_reserve(MAX_USIZE) {
1431 panic!("usize::MAX should trigger an overflow!")
1434 // Check isize::MAX + 1 is an OOM
1435 if let Err(AllocError { .. }) = empty_bytes.try_reserve(MAX_CAP + 1) {
1437 panic!("isize::MAX + 1 should trigger an OOM!")
1440 // Check usize::MAX is an OOM
1441 if let Err(AllocError { .. }) = empty_bytes.try_reserve(MAX_USIZE) {
1443 panic!("usize::MAX should trigger an OOM!")
1449 // Same basic idea, but with non-zero len
1450 let mut ten_bytes: Vec<u8> = vec![1, 2, 3, 4, 5, 6, 7, 8, 9, 10];
1452 if let Err(CapacityOverflow) = ten_bytes.try_reserve(MAX_CAP - 10) {
1453 panic!("isize::MAX shouldn't trigger an overflow!");
1455 if let Err(CapacityOverflow) = ten_bytes.try_reserve(MAX_CAP - 10) {
1456 panic!("isize::MAX shouldn't trigger an overflow!");
1458 if guards_against_isize {
1459 if let Err(CapacityOverflow) = ten_bytes.try_reserve(MAX_CAP - 9) {
1461 panic!("isize::MAX + 1 should trigger an overflow!");
1464 if let Err(AllocError { .. }) = ten_bytes.try_reserve(MAX_CAP - 9) {
1466 panic!("isize::MAX + 1 should trigger an OOM!")
1469 // Should always overflow in the add-to-len
1470 if let Err(CapacityOverflow) = ten_bytes.try_reserve(MAX_USIZE) {
1472 panic!("usize::MAX should trigger an overflow!")
1477 // Same basic idea, but with interesting type size
1478 let mut ten_u32s: Vec<u32> = vec![1, 2, 3, 4, 5, 6, 7, 8, 9, 10];
1480 if let Err(CapacityOverflow) = ten_u32s.try_reserve(MAX_CAP / 4 - 10) {
1481 panic!("isize::MAX shouldn't trigger an overflow!");
1483 if let Err(CapacityOverflow) = ten_u32s.try_reserve(MAX_CAP / 4 - 10) {
1484 panic!("isize::MAX shouldn't trigger an overflow!");
1486 if guards_against_isize {
1487 if let Err(CapacityOverflow) = ten_u32s.try_reserve(MAX_CAP / 4 - 9) {
1489 panic!("isize::MAX + 1 should trigger an overflow!");
1492 if let Err(AllocError { .. }) = ten_u32s.try_reserve(MAX_CAP / 4 - 9) {
1494 panic!("isize::MAX + 1 should trigger an OOM!")
1497 // Should fail in the mul-by-size
1498 if let Err(CapacityOverflow) = ten_u32s.try_reserve(MAX_USIZE - 20) {
1500 panic!("usize::MAX should trigger an overflow!");
1506 #[cfg_attr(miri, ignore)] // Miri does not support signalling OOM
1507 #[cfg_attr(target_os = "android", ignore)] // Android used in CI has a broken dlmalloc
1508 fn test_try_reserve_exact() {
1509 // This is exactly the same as test_try_reserve with the method changed.
1510 // See that test for comments.
1512 const MAX_CAP: usize = isize::MAX as usize;
1513 const MAX_USIZE: usize = usize::MAX;
1515 let guards_against_isize = size_of::<usize>() < 8;
1518 let mut empty_bytes: Vec<u8> = Vec::new();
1520 if let Err(CapacityOverflow) = empty_bytes.try_reserve_exact(MAX_CAP) {
1521 panic!("isize::MAX shouldn't trigger an overflow!");
1523 if let Err(CapacityOverflow) = empty_bytes.try_reserve_exact(MAX_CAP) {
1524 panic!("isize::MAX shouldn't trigger an overflow!");
1527 if guards_against_isize {
1528 if let Err(CapacityOverflow) = empty_bytes.try_reserve_exact(MAX_CAP + 1) {
1530 panic!("isize::MAX + 1 should trigger an overflow!")
1533 if let Err(CapacityOverflow) = empty_bytes.try_reserve_exact(MAX_USIZE) {
1535 panic!("usize::MAX should trigger an overflow!")
1538 if let Err(AllocError { .. }) = empty_bytes.try_reserve_exact(MAX_CAP + 1) {
1540 panic!("isize::MAX + 1 should trigger an OOM!")
1543 if let Err(AllocError { .. }) = empty_bytes.try_reserve_exact(MAX_USIZE) {
1545 panic!("usize::MAX should trigger an OOM!")
1551 let mut ten_bytes: Vec<u8> = vec![1, 2, 3, 4, 5, 6, 7, 8, 9, 10];
1553 if let Err(CapacityOverflow) = ten_bytes.try_reserve_exact(MAX_CAP - 10) {
1554 panic!("isize::MAX shouldn't trigger an overflow!");
1556 if let Err(CapacityOverflow) = ten_bytes.try_reserve_exact(MAX_CAP - 10) {
1557 panic!("isize::MAX shouldn't trigger an overflow!");
1559 if guards_against_isize {
1560 if let Err(CapacityOverflow) = ten_bytes.try_reserve_exact(MAX_CAP - 9) {
1562 panic!("isize::MAX + 1 should trigger an overflow!");
1565 if let Err(AllocError { .. }) = ten_bytes.try_reserve_exact(MAX_CAP - 9) {
1567 panic!("isize::MAX + 1 should trigger an OOM!")
1570 if let Err(CapacityOverflow) = ten_bytes.try_reserve_exact(MAX_USIZE) {
1572 panic!("usize::MAX should trigger an overflow!")
1577 let mut ten_u32s: Vec<u32> = vec![1, 2, 3, 4, 5, 6, 7, 8, 9, 10];
1579 if let Err(CapacityOverflow) = ten_u32s.try_reserve_exact(MAX_CAP / 4 - 10) {
1580 panic!("isize::MAX shouldn't trigger an overflow!");
1582 if let Err(CapacityOverflow) = ten_u32s.try_reserve_exact(MAX_CAP / 4 - 10) {
1583 panic!("isize::MAX shouldn't trigger an overflow!");
1585 if guards_against_isize {
1586 if let Err(CapacityOverflow) = ten_u32s.try_reserve_exact(MAX_CAP / 4 - 9) {
1588 panic!("isize::MAX + 1 should trigger an overflow!");
1591 if let Err(AllocError { .. }) = ten_u32s.try_reserve_exact(MAX_CAP / 4 - 9) {
1593 panic!("isize::MAX + 1 should trigger an OOM!")
1596 if let Err(CapacityOverflow) = ten_u32s.try_reserve_exact(MAX_USIZE - 20) {
1598 panic!("usize::MAX should trigger an overflow!")
1604 fn test_stable_pointers() {
1605 /// Pull an element from the iterator, then drop it.
1606 /// Useful to cover both the `next` and `drop` paths of an iterator.
1607 fn next_then_drop<I: Iterator>(mut i: I) {
1612 // Test that, if we reserved enough space, adding and removing elements does not
1613 // invalidate references into the vector (such as `v0`). This test also
1614 // runs in Miri, which would detect such problems.
1615 // Note that this test does *not* constitute a stable guarantee that all these functions do not
1616 // reallocate! Only what is explicitly documented at
1617 // <https://doc.rust-lang.org/nightly/std/vec/struct.Vec.html#guarantees> is stably guaranteed.
1618 let mut v = Vec::with_capacity(128);
1621 // Laundering the lifetime -- we take care that `v` does not reallocate, so that's okay.
1623 let v0 = unsafe { &mut *(v0 as *mut _) };
1624 // Now do a bunch of things and occasionally use `v0` again to assert it is still valid.
1626 // Pushing/inserting and popping/removing
1630 assert_eq!(*v0, 13);
1633 assert_eq!(*v0, 13);
1636 assert_eq!(v.len(), 2);
1637 v.swap_remove(1); // swap_remove the last element
1638 assert_eq!(*v0, 13);
1641 v.append(&mut vec![27, 19]);
1642 assert_eq!(*v0, 13);
1645 v.extend_from_slice(&[1, 2]);
1646 v.extend(&[1, 2]); // `slice::Iter` (with `T: Copy`) specialization
1647 v.extend(vec![2, 3]); // `vec::IntoIter` specialization
1648 v.extend(std::iter::once(3)); // `TrustedLen` specialization
1649 v.extend(std::iter::empty::<i32>()); // `TrustedLen` specialization with empty iterator
1650 v.extend(std::iter::once(3).filter(|_| true)); // base case
1651 v.extend(std::iter::once(&3)); // `cloned` specialization
1652 assert_eq!(*v0, 13);
1656 assert_eq!(*v0, 13);
1659 v.resize_with(v.len() + 10, || 42);
1660 assert_eq!(*v0, 13);
1661 v.resize_with(2, || panic!());
1662 assert_eq!(*v0, 13);
1664 // No-op reservation
1666 v.reserve_exact(32);
1667 assert_eq!(*v0, 13);
1670 v.resize_with(10, || 42);
1671 next_then_drop(v.drain(5..));
1672 assert_eq!(*v0, 13);
1675 v.resize_with(10, || 42);
1676 next_then_drop(v.splice(5.., vec![1, 2, 3, 4, 5])); // empty tail after range
1677 assert_eq!(*v0, 13);
1678 next_then_drop(v.splice(5..8, vec![1])); // replacement is smaller than original range
1679 assert_eq!(*v0, 13);
1680 next_then_drop(v.splice(5..6, vec![1; 10].into_iter().filter(|_| true))); // lower bound not exact
1681 assert_eq!(*v0, 13);
1683 // Smoke test that would fire even outside Miri if an actual relocation happened.
1685 assert_eq!(v[0], 0);
1688 // https://github.com/rust-lang/rust/pull/49496 introduced specialization based on:
1691 // unsafe impl<T: ?Sized> IsZero for *mut T {
1692 // fn is_zero(&self) -> bool {
1693 // (*self).is_null()
1698 // … to call `RawVec::with_capacity_zeroed` for creating `Vec<*mut T>`,
1699 // which is incorrect for fat pointers since `<*mut T>::is_null` only looks at the data component.
1700 // That is, a fat pointer can be “null” without being made entirely of zero bits.
1702 fn vec_macro_repeating_null_raw_fat_pointer() {
1703 let raw_dyn = &mut (|| ()) as &mut dyn Fn() as *mut dyn Fn();
1704 let vtable = dbg!(ptr_metadata(raw_dyn));
1705 let null_raw_dyn = ptr_from_raw_parts(std::ptr::null_mut(), vtable);
1706 assert!(null_raw_dyn.is_null());
1708 let vec = vec![null_raw_dyn; 1];
1709 dbg!(ptr_metadata(vec[0]));
1710 assert!(vec[0] == null_raw_dyn);
1712 // Polyfill for https://github.com/rust-lang/rfcs/pull/2580
1714 fn ptr_metadata(ptr: *mut dyn Fn()) -> *mut () {
1715 unsafe { std::mem::transmute::<*mut dyn Fn(), DynRepr>(ptr).vtable }
1718 fn ptr_from_raw_parts(data: *mut (), vtable: *mut ()) -> *mut dyn Fn() {
1719 unsafe { std::mem::transmute::<DynRepr, *mut dyn Fn()>(DynRepr { data, vtable }) }
1729 // This test will likely fail if you change the capacities used in
1730 // `RawVec::grow_amortized`.
1732 fn test_push_growth_strategy() {
1733 // If the element size is 1, we jump from 0 to 8, then double.
1735 let mut v1: Vec<u8> = vec![];
1736 assert_eq!(v1.capacity(), 0);
1740 assert_eq!(v1.capacity(), 8);
1745 assert_eq!(v1.capacity(), 16);
1750 assert_eq!(v1.capacity(), 32);
1755 assert_eq!(v1.capacity(), 64);
1759 // If the element size is 2..=1024, we jump from 0 to 4, then double.
1761 let mut v2: Vec<u16> = vec![];
1762 let mut v1024: Vec<[u8; 1024]> = vec![];
1763 assert_eq!(v2.capacity(), 0);
1764 assert_eq!(v1024.capacity(), 0);
1768 v1024.push([0; 1024]);
1769 assert_eq!(v2.capacity(), 4);
1770 assert_eq!(v1024.capacity(), 4);
1775 v1024.push([0; 1024]);
1776 assert_eq!(v2.capacity(), 8);
1777 assert_eq!(v1024.capacity(), 8);
1782 v1024.push([0; 1024]);
1783 assert_eq!(v2.capacity(), 16);
1784 assert_eq!(v1024.capacity(), 16);
1789 v1024.push([0; 1024]);
1790 assert_eq!(v2.capacity(), 32);
1791 assert_eq!(v1024.capacity(), 32);
1796 v1024.push([0; 1024]);
1797 assert_eq!(v2.capacity(), 64);
1798 assert_eq!(v1024.capacity(), 64);
1802 // If the element size is > 1024, we jump from 0 to 1, then double.
1804 let mut v1025: Vec<[u8; 1025]> = vec![];
1805 assert_eq!(v1025.capacity(), 0);
1808 v1025.push([0; 1025]);
1809 assert_eq!(v1025.capacity(), 1);
1813 v1025.push([0; 1025]);
1814 assert_eq!(v1025.capacity(), 2);
1818 v1025.push([0; 1025]);
1819 assert_eq!(v1025.capacity(), 4);
1823 v1025.push([0; 1025]);
1824 assert_eq!(v1025.capacity(), 8);
1828 v1025.push([0; 1025]);
1829 assert_eq!(v1025.capacity(), 16);
1833 v1025.push([0; 1025]);
1834 assert_eq!(v1025.capacity(), 32);
1838 v1025.push([0; 1025]);
1839 assert_eq!(v1025.capacity(), 64);
1844 macro_rules! generate_assert_eq_vec_and_prim {
1845 ($name:ident<$B:ident>($type:ty)) => {
1846 fn $name<A: PartialEq<$B> + Debug, $B: Debug>(a: Vec<A>, b: $type) {
1853 generate_assert_eq_vec_and_prim! { assert_eq_vec_and_slice <B>(&[B]) }
1854 generate_assert_eq_vec_and_prim! { assert_eq_vec_and_array_3<B>([B; 3]) }
1857 fn partialeq_vec_and_prim() {
1858 assert_eq_vec_and_slice(vec![1, 2, 3], &[1, 2, 3]);
1859 assert_eq_vec_and_array_3(vec![1, 2, 3], [1, 2, 3]);
1862 macro_rules! assert_partial_eq_valid {
1863 ($a2:expr, $a3:expr; $b2:expr, $b3: expr) => {
1864 assert!($a2 == $b2);
1865 assert!($a2 != $b3);
1866 assert!($a3 != $b2);
1867 assert!($a3 == $b3);
1868 assert_eq!($a2, $b2);
1869 assert_ne!($a2, $b3);
1870 assert_ne!($a3, $b2);
1871 assert_eq!($a3, $b3);
1876 fn partialeq_vec_full() {
1877 let vec2: Vec<_> = vec![1, 2];
1878 let vec3: Vec<_> = vec![1, 2, 3];
1879 let slice2: &[_] = &[1, 2];
1880 let slice3: &[_] = &[1, 2, 3];
1881 let slicemut2: &[_] = &mut [1, 2];
1882 let slicemut3: &[_] = &mut [1, 2, 3];
1883 let array2: [_; 2] = [1, 2];
1884 let array3: [_; 3] = [1, 2, 3];
1885 let arrayref2: &[_; 2] = &[1, 2];
1886 let arrayref3: &[_; 3] = &[1, 2, 3];
1888 assert_partial_eq_valid!(vec2,vec3; vec2,vec3);
1889 assert_partial_eq_valid!(vec2,vec3; slice2,slice3);
1890 assert_partial_eq_valid!(vec2,vec3; slicemut2,slicemut3);
1891 assert_partial_eq_valid!(slice2,slice3; vec2,vec3);
1892 assert_partial_eq_valid!(slicemut2,slicemut3; vec2,vec3);
1893 assert_partial_eq_valid!(vec2,vec3; array2,array3);
1894 assert_partial_eq_valid!(vec2,vec3; arrayref2,arrayref3);
1895 assert_partial_eq_valid!(vec2,vec3; arrayref2[..],arrayref3[..]);
1899 fn test_vec_cycle() {
1902 v: Vec<Cell<Option<&'a C<'a>>>>,
1911 let mut c1 = C::new();
1912 let mut c2 = C::new();
1913 let mut c3 = C::new();
1916 c1.v.push(Cell::new(None));
1917 c1.v.push(Cell::new(None));
1919 c2.v.push(Cell::new(None));
1920 c2.v.push(Cell::new(None));
1922 c3.v.push(Cell::new(None));
1923 c3.v.push(Cell::new(None));
1926 c1.v[0].set(Some(&c2));
1927 c1.v[1].set(Some(&c3));
1929 c2.v[0].set(Some(&c2));
1930 c2.v[1].set(Some(&c3));
1932 c3.v[0].set(Some(&c1));
1933 c3.v[1].set(Some(&c2));
1937 fn test_vec_cycle_wrapped() {
1939 v: Vec<Cell<Option<&'a C<'a>>>>,
1947 fn new() -> Refs<'a> {
1948 Refs { v: Vec::new() }
1954 C { refs: Refs::new() }
1958 let mut c1 = C::new();
1959 let mut c2 = C::new();
1960 let mut c3 = C::new();
1962 c1.refs.v.push(Cell::new(None));
1963 c1.refs.v.push(Cell::new(None));
1964 c2.refs.v.push(Cell::new(None));
1965 c2.refs.v.push(Cell::new(None));
1966 c3.refs.v.push(Cell::new(None));
1967 c3.refs.v.push(Cell::new(None));
1969 c1.refs.v[0].set(Some(&c2));
1970 c1.refs.v[1].set(Some(&c3));
1971 c2.refs.v[0].set(Some(&c2));
1972 c2.refs.v[1].set(Some(&c3));
1973 c3.refs.v[0].set(Some(&c1));
1974 c3.refs.v[1].set(Some(&c2));
1978 fn test_zero_sized_vec_push() {
1982 let mut tester = Vec::with_capacity(len);
1983 assert_eq!(tester.len(), 0);
1984 assert!(tester.capacity() >= len);
1988 assert_eq!(tester.len(), len);
1989 assert_eq!(tester.iter().count(), len);
1995 fn test_vec_macro_repeat() {
1996 assert_eq!(vec![1; 3], vec![1, 1, 1]);
1997 assert_eq!(vec![1; 2], vec![1, 1]);
1998 assert_eq!(vec![1; 1], vec![1]);
1999 assert_eq!(vec![1; 0], vec![]);
2001 // from_elem syntax (see RFC 832)
2002 let el = Box::new(1);
2004 assert_eq!(vec![el; n], vec![Box::new(1), Box::new(1), Box::new(1)]);
2008 fn test_vec_swap() {
2009 let mut a: Vec<isize> = vec![0, 1, 2, 3, 4, 5, 6];
2011 assert_eq!(a[2], 4);
2012 assert_eq!(a[4], 2);
2014 swap(&mut n, &mut a[0]);
2015 assert_eq!(a[0], 42);
2020 fn test_extend_from_within_spec() {
2024 impl Clone for CopyOnly {
2025 fn clone(&self) -> Self {
2026 panic!("extend_from_within must use specialization on copy");
2030 vec![CopyOnly, CopyOnly].extend_from_within(..);
2034 fn test_extend_from_within_clone() {
2035 let mut v = vec![String::from("sssss"), String::from("12334567890"), String::from("c")];
2036 v.extend_from_within(1..);
2038 assert_eq!(v, ["sssss", "12334567890", "c", "12334567890", "c"]);
2042 fn test_extend_from_within_complete_rande() {
2043 let mut v = vec![0, 1, 2, 3];
2044 v.extend_from_within(..);
2046 assert_eq!(v, [0, 1, 2, 3, 0, 1, 2, 3]);
2050 fn test_extend_from_within_empty_rande() {
2051 let mut v = vec![0, 1, 2, 3];
2052 v.extend_from_within(1..1);
2054 assert_eq!(v, [0, 1, 2, 3]);
2059 fn test_extend_from_within_out_of_rande() {
2060 let mut v = vec![0, 1];
2061 v.extend_from_within(..3);
2065 fn test_extend_from_within_zst() {
2066 let mut v = vec![(); 8];
2067 v.extend_from_within(3..7);
2069 assert_eq!(v, [(); 12]);
2073 fn test_extend_from_within_empty_vec() {
2074 let mut v = Vec::<i32>::new();
2075 v.extend_from_within(..);
2081 fn test_extend_from_within() {
2082 let mut v = vec![String::from("a"), String::from("b"), String::from("c")];
2083 v.extend_from_within(1..=2);
2084 v.extend_from_within(..=1);
2086 assert_eq!(v, ["a", "b", "c", "b", "c", "a", "b"]);