2 use std::collections::TryReserveError::*;
4 use std::iter::InPlaceIterable;
6 use std::ops::Bound::*;
7 use std::panic::{catch_unwind, AssertUnwindSafe};
9 use std::vec::{Drain, IntoIter};
11 struct DropCounter<'a> {
15 impl Drop for DropCounter<'_> {
22 fn test_small_vec_struct() {
23 assert_eq!(size_of::<Vec<u8>>(), size_of::<usize>() * 3);
27 fn test_double_drop() {
33 let (mut count_x, mut count_y) = (0, 0);
35 let mut tv = TwoVec { x: Vec::new(), y: Vec::new() };
36 tv.x.push(DropCounter { count: &mut count_x });
37 tv.y.push(DropCounter { count: &mut count_y });
39 // If Vec had a drop flag, here is where it would be zeroed.
40 // Instead, it should rely on its internal state to prevent
41 // doing anything significant when dropped multiple times.
44 // Here tv goes out of scope, tv.y should be dropped, but not tv.x.
47 assert_eq!(count_x, 1);
48 assert_eq!(count_y, 1);
53 let mut v = Vec::new();
54 assert_eq!(v.capacity(), 0);
57 assert!(v.capacity() >= 2);
63 assert!(v.capacity() >= 16);
65 assert!(v.capacity() >= 32);
70 assert!(v.capacity() >= 33)
74 fn test_zst_capacity() {
75 assert_eq!(Vec::<()>::new().capacity(), usize::MAX);
80 let v: Vec<isize> = vec![10, 20];
85 assert_eq!(v[x + 1], 20);
88 assert_eq!(v[x - 1], 10);
93 let vec1: Vec<isize> = vec![];
94 assert_eq!("[]", format!("{:?}", vec1));
96 let vec2 = vec![0, 1];
97 assert_eq!("[0, 1]", format!("{:?}", vec2));
99 let slice: &[isize] = &[4, 5];
100 assert_eq!("[4, 5]", format!("{:?}", slice));
109 assert_eq!(v, [1, 2]);
111 assert_eq!(v, [1, 2, 3]);
116 let mut v = Vec::new();
117 let mut w = Vec::new();
136 v.extend(w.clone()); // specializes to `append`
137 assert!(v.iter().eq(w.iter().chain(w.iter())));
140 #[derive(PartialEq, Debug)]
143 let mut a = Vec::new();
144 let b = vec![Foo, Foo];
147 assert_eq!(a, &[Foo, Foo]);
152 let mut x = Vec::new();
153 let y = vec![DropCounter { count: &mut count_x }];
156 assert_eq!(count_x, 1);
160 fn test_extend_from_slice() {
161 let a: Vec<isize> = vec![1, 2, 3, 4, 5];
162 let b: Vec<isize> = vec![6, 7, 8, 9, 0];
164 let mut v: Vec<isize> = a;
166 v.extend_from_slice(&b);
168 assert_eq!(v, [1, 2, 3, 4, 5, 6, 7, 8, 9, 0]);
172 fn test_extend_ref() {
173 let mut v = vec![1, 2];
174 v.extend(&[3, 4, 5]);
176 assert_eq!(v.len(), 5);
177 assert_eq!(v, [1, 2, 3, 4, 5]);
182 assert_eq!(v.len(), 7);
183 assert_eq!(v, [1, 2, 3, 4, 5, 6, 7]);
187 fn test_slice_from_ref() {
188 let values = vec![1, 2, 3, 4, 5];
189 let slice = &values[1..3];
191 assert_eq!(slice, [2, 3]);
195 fn test_slice_from_mut() {
196 let mut values = vec![1, 2, 3, 4, 5];
198 let slice = &mut values[2..];
199 assert!(slice == [3, 4, 5]);
205 assert!(values == [1, 2, 5, 6, 7]);
209 fn test_slice_to_mut() {
210 let mut values = vec![1, 2, 3, 4, 5];
212 let slice = &mut values[..2];
213 assert!(slice == [1, 2]);
219 assert!(values == [2, 3, 3, 4, 5]);
223 fn test_split_at_mut() {
224 let mut values = vec![1, 2, 3, 4, 5];
226 let (left, right) = values.split_at_mut(2);
228 let left: &[_] = left;
229 assert!(&left[..left.len()] == &[1, 2]);
236 let right: &[_] = right;
237 assert!(&right[..right.len()] == &[3, 4, 5]);
244 assert_eq!(values, [2, 3, 5, 6, 7]);
249 let v: Vec<i32> = vec![];
250 let w = vec![1, 2, 3];
252 assert_eq!(v, v.clone());
256 // they should be disjoint in memory.
257 assert!(w.as_ptr() != z.as_ptr())
261 fn test_clone_from() {
263 let three: Vec<Box<_>> = vec![box 1, box 2, box 3];
264 let two: Vec<Box<_>> = vec![box 4, box 5];
266 v.clone_from(&three);
267 assert_eq!(v, three);
270 v.clone_from(&three);
271 assert_eq!(v, three);
278 v.clone_from(&three);
284 let mut vec = vec![1, 2, 3, 4];
285 vec.retain(|&x| x % 2 == 0);
286 assert_eq!(vec, [2, 4]);
291 fn case(a: Vec<i32>, b: Vec<i32>) {
296 case(vec![], vec![]);
297 case(vec![1], vec![1]);
298 case(vec![1, 1], vec![1]);
299 case(vec![1, 2, 3], vec![1, 2, 3]);
300 case(vec![1, 1, 2, 3], vec![1, 2, 3]);
301 case(vec![1, 2, 2, 3], vec![1, 2, 3]);
302 case(vec![1, 2, 3, 3], vec![1, 2, 3]);
303 case(vec![1, 1, 2, 2, 2, 3, 3], vec![1, 2, 3]);
307 fn test_dedup_by_key() {
308 fn case(a: Vec<i32>, b: Vec<i32>) {
310 v.dedup_by_key(|i| *i / 10);
313 case(vec![], vec![]);
314 case(vec![10], vec![10]);
315 case(vec![10, 11], vec![10]);
316 case(vec![10, 20, 30], vec![10, 20, 30]);
317 case(vec![10, 11, 20, 30], vec![10, 20, 30]);
318 case(vec![10, 20, 21, 30], vec![10, 20, 30]);
319 case(vec![10, 20, 30, 31], vec![10, 20, 30]);
320 case(vec![10, 11, 20, 21, 22, 30, 31], vec![10, 20, 30]);
325 let mut vec = vec!["foo", "bar", "Bar", "baz", "bar"];
326 vec.dedup_by(|a, b| a.eq_ignore_ascii_case(b));
328 assert_eq!(vec, ["foo", "bar", "baz", "bar"]);
330 let mut vec = vec![("foo", 1), ("foo", 2), ("bar", 3), ("bar", 4), ("bar", 5)];
331 vec.dedup_by(|a, b| {
338 assert_eq!(vec, [("foo", 3), ("bar", 12)]);
342 fn test_dedup_unique() {
343 let mut v0: Vec<Box<_>> = vec![box 1, box 1, box 2, box 3];
345 let mut v1: Vec<Box<_>> = vec![box 1, box 2, box 2, box 3];
347 let mut v2: Vec<Box<_>> = vec![box 1, box 2, box 3, box 3];
349 // If the boxed pointers were leaked or otherwise misused, valgrind
350 // and/or rt should raise errors.
354 fn zero_sized_values() {
355 let mut v = Vec::new();
356 assert_eq!(v.len(), 0);
358 assert_eq!(v.len(), 1);
360 assert_eq!(v.len(), 2);
361 assert_eq!(v.pop(), Some(()));
362 assert_eq!(v.pop(), Some(()));
363 assert_eq!(v.pop(), None);
365 assert_eq!(v.iter().count(), 0);
367 assert_eq!(v.iter().count(), 1);
369 assert_eq!(v.iter().count(), 2);
373 assert_eq!(v.iter_mut().count(), 2);
375 assert_eq!(v.iter_mut().count(), 3);
377 assert_eq!(v.iter_mut().count(), 4);
379 for &mut () in &mut v {}
383 assert_eq!(v.iter_mut().count(), 0);
387 fn test_partition() {
388 assert_eq!(vec![].into_iter().partition(|x: &i32| *x < 3), (vec![], vec![]));
389 assert_eq!(vec![1, 2, 3].into_iter().partition(|x| *x < 4), (vec![1, 2, 3], vec![]));
390 assert_eq!(vec![1, 2, 3].into_iter().partition(|x| *x < 2), (vec![1], vec![2, 3]));
391 assert_eq!(vec![1, 2, 3].into_iter().partition(|x| *x < 0), (vec![], vec![1, 2, 3]));
395 fn test_zip_unzip() {
396 let z1 = vec![(1, 4), (2, 5), (3, 6)];
398 let (left, right): (Vec<_>, Vec<_>) = z1.iter().cloned().unzip();
400 assert_eq!((1, 4), (left[0], right[0]));
401 assert_eq!((2, 5), (left[1], right[1]));
402 assert_eq!((3, 6), (left[2], right[2]));
407 let x: &[isize] = &[1, 2, 3, 4, 5];
408 let cmp: &[isize] = &[1, 2, 3, 4, 5];
409 assert_eq!(&x[..], cmp);
410 let cmp: &[isize] = &[3, 4, 5];
411 assert_eq!(&x[2..], cmp);
412 let cmp: &[isize] = &[1, 2, 3];
413 assert_eq!(&x[..3], cmp);
414 let cmp: &[isize] = &[2, 3, 4];
415 assert_eq!(&x[1..4], cmp);
417 let x: Vec<isize> = vec![1, 2, 3, 4, 5];
418 let cmp: &[isize] = &[1, 2, 3, 4, 5];
419 assert_eq!(&x[..], cmp);
420 let cmp: &[isize] = &[3, 4, 5];
421 assert_eq!(&x[2..], cmp);
422 let cmp: &[isize] = &[1, 2, 3];
423 assert_eq!(&x[..3], cmp);
424 let cmp: &[isize] = &[2, 3, 4];
425 assert_eq!(&x[1..4], cmp);
429 fn test_vec_truncate_drop() {
430 static mut DROPS: u32 = 0;
440 let mut v = vec![Elem(1), Elem(2), Elem(3), Elem(4), Elem(5)];
441 assert_eq!(unsafe { DROPS }, 0);
443 assert_eq!(unsafe { DROPS }, 2);
445 assert_eq!(unsafe { DROPS }, 5);
450 fn test_vec_truncate_fail() {
452 impl Drop for BadElem {
454 let BadElem(ref mut x) = *self;
456 panic!("BadElem panic: 0xbadbeef")
461 let mut v = vec![BadElem(1), BadElem(2), BadElem(0xbadbeef), BadElem(4)];
467 let vec = vec![1, 2, 3];
468 assert!(vec[1] == 2);
473 fn test_index_out_of_bounds() {
474 let vec = vec![1, 2, 3];
480 fn test_slice_out_of_bounds_1() {
481 let x = vec![1, 2, 3, 4, 5];
487 fn test_slice_out_of_bounds_2() {
488 let x = vec![1, 2, 3, 4, 5];
494 fn test_slice_out_of_bounds_3() {
495 let x = vec![1, 2, 3, 4, 5];
501 fn test_slice_out_of_bounds_4() {
502 let x = vec![1, 2, 3, 4, 5];
508 fn test_slice_out_of_bounds_5() {
509 let x = vec![1, 2, 3, 4, 5];
515 fn test_swap_remove_empty() {
516 let mut vec = Vec::<i32>::new();
521 fn test_move_items() {
522 let vec = vec![1, 2, 3];
523 let mut vec2 = vec![];
527 assert_eq!(vec2, [1, 2, 3]);
531 fn test_move_items_reverse() {
532 let vec = vec![1, 2, 3];
533 let mut vec2 = vec![];
534 for i in vec.into_iter().rev() {
537 assert_eq!(vec2, [3, 2, 1]);
541 fn test_move_items_zero_sized() {
542 let vec = vec![(), (), ()];
543 let mut vec2 = vec![];
547 assert_eq!(vec2, [(), (), ()]);
551 fn test_drain_items() {
552 let mut vec = vec![1, 2, 3];
553 let mut vec2 = vec![];
554 for i in vec.drain(..) {
558 assert_eq!(vec2, [1, 2, 3]);
562 fn test_drain_items_reverse() {
563 let mut vec = vec![1, 2, 3];
564 let mut vec2 = vec![];
565 for i in vec.drain(..).rev() {
569 assert_eq!(vec2, [3, 2, 1]);
573 fn test_drain_items_zero_sized() {
574 let mut vec = vec![(), (), ()];
575 let mut vec2 = vec![];
576 for i in vec.drain(..) {
580 assert_eq!(vec2, [(), (), ()]);
585 fn test_drain_out_of_bounds() {
586 let mut v = vec![1, 2, 3, 4, 5];
591 fn test_drain_range() {
592 let mut v = vec![1, 2, 3, 4, 5];
593 for _ in v.drain(4..) {}
594 assert_eq!(v, &[1, 2, 3, 4]);
596 let mut v: Vec<_> = (1..6).map(|x| x.to_string()).collect();
597 for _ in v.drain(1..4) {}
598 assert_eq!(v, &[1.to_string(), 5.to_string()]);
600 let mut v: Vec<_> = (1..6).map(|x| x.to_string()).collect();
601 for _ in v.drain(1..4).rev() {}
602 assert_eq!(v, &[1.to_string(), 5.to_string()]);
604 let mut v: Vec<_> = vec![(); 5];
605 for _ in v.drain(1..4).rev() {}
606 assert_eq!(v, &[(), ()]);
610 fn test_drain_inclusive_range() {
611 let mut v = vec!['a', 'b', 'c', 'd', 'e'];
612 for _ in v.drain(1..=3) {}
613 assert_eq!(v, &['a', 'e']);
615 let mut v: Vec<_> = (0..=5).map(|x| x.to_string()).collect();
616 for _ in v.drain(1..=5) {}
617 assert_eq!(v, &["0".to_string()]);
619 let mut v: Vec<String> = (0..=5).map(|x| x.to_string()).collect();
620 for _ in v.drain(0..=5) {}
621 assert_eq!(v, Vec::<String>::new());
623 let mut v: Vec<_> = (0..=5).map(|x| x.to_string()).collect();
624 for _ in v.drain(0..=3) {}
625 assert_eq!(v, &["4".to_string(), "5".to_string()]);
627 let mut v: Vec<_> = (0..=1).map(|x| x.to_string()).collect();
628 for _ in v.drain(..=0) {}
629 assert_eq!(v, &["1".to_string()]);
633 fn test_drain_max_vec_size() {
634 let mut v = Vec::<()>::with_capacity(usize::MAX);
636 v.set_len(usize::MAX);
638 for _ in v.drain(usize::MAX - 1..) {}
639 assert_eq!(v.len(), usize::MAX - 1);
641 let mut v = Vec::<()>::with_capacity(usize::MAX);
643 v.set_len(usize::MAX);
645 for _ in v.drain(usize::MAX - 1..=usize::MAX - 1) {}
646 assert_eq!(v.len(), usize::MAX - 1);
651 fn test_drain_index_overflow() {
652 let mut v = Vec::<()>::with_capacity(usize::MAX);
654 v.set_len(usize::MAX);
656 v.drain(0..=usize::MAX);
661 fn test_drain_inclusive_out_of_bounds() {
662 let mut v = vec![1, 2, 3, 4, 5];
668 fn test_drain_start_overflow() {
669 let mut v = vec![1, 2, 3];
670 v.drain((Excluded(usize::MAX), Included(0)));
675 fn test_drain_end_overflow() {
676 let mut v = vec![1, 2, 3];
677 v.drain((Included(0), Included(usize::MAX)));
681 fn test_drain_leak() {
682 static mut DROPS: i32 = 0;
684 #[derive(Debug, PartialEq)]
694 panic!("panic in `drop`");
709 catch_unwind(AssertUnwindSafe(|| {
714 assert_eq!(unsafe { DROPS }, 4);
715 assert_eq!(v, vec![D(0, false), D(1, false), D(6, false),]);
720 let mut v = vec![1, 2, 3, 4, 5];
721 let a = [10, 11, 12];
722 v.splice(2..4, a.iter().cloned());
723 assert_eq!(v, &[1, 2, 10, 11, 12, 5]);
724 v.splice(1..3, Some(20));
725 assert_eq!(v, &[1, 20, 11, 12, 5]);
729 fn test_splice_inclusive_range() {
730 let mut v = vec![1, 2, 3, 4, 5];
731 let a = [10, 11, 12];
732 let t1: Vec<_> = v.splice(2..=3, a.iter().cloned()).collect();
733 assert_eq!(v, &[1, 2, 10, 11, 12, 5]);
734 assert_eq!(t1, &[3, 4]);
735 let t2: Vec<_> = v.splice(1..=2, Some(20)).collect();
736 assert_eq!(v, &[1, 20, 11, 12, 5]);
737 assert_eq!(t2, &[2, 10]);
742 fn test_splice_out_of_bounds() {
743 let mut v = vec![1, 2, 3, 4, 5];
744 let a = [10, 11, 12];
745 v.splice(5..6, a.iter().cloned());
750 fn test_splice_inclusive_out_of_bounds() {
751 let mut v = vec![1, 2, 3, 4, 5];
752 let a = [10, 11, 12];
753 v.splice(5..=5, a.iter().cloned());
757 fn test_splice_items_zero_sized() {
758 let mut vec = vec![(), (), ()];
760 let t: Vec<_> = vec.splice(1..2, vec2.iter().cloned()).collect();
761 assert_eq!(vec, &[(), ()]);
762 assert_eq!(t, &[()]);
766 fn test_splice_unbounded() {
767 let mut vec = vec![1, 2, 3, 4, 5];
768 let t: Vec<_> = vec.splice(.., None).collect();
769 assert_eq!(vec, &[]);
770 assert_eq!(t, &[1, 2, 3, 4, 5]);
774 fn test_splice_forget() {
775 let mut v = vec![1, 2, 3, 4, 5];
776 let a = [10, 11, 12];
777 std::mem::forget(v.splice(2..4, a.iter().cloned()));
778 assert_eq!(v, &[1, 2]);
782 fn test_into_boxed_slice() {
783 let xs = vec![1, 2, 3];
784 let ys = xs.into_boxed_slice();
785 assert_eq!(&*ys, [1, 2, 3]);
790 let mut vec = vec![1, 2, 3];
791 let mut vec2 = vec![4, 5, 6];
792 vec.append(&mut vec2);
793 assert_eq!(vec, [1, 2, 3, 4, 5, 6]);
794 assert_eq!(vec2, []);
798 fn test_split_off() {
799 let mut vec = vec![1, 2, 3, 4, 5, 6];
800 let orig_capacity = vec.capacity();
801 let vec2 = vec.split_off(4);
802 assert_eq!(vec, [1, 2, 3, 4]);
803 assert_eq!(vec2, [5, 6]);
804 assert_eq!(vec.capacity(), orig_capacity);
808 fn test_split_off_take_all() {
809 let mut vec = vec![1, 2, 3, 4, 5, 6];
810 let orig_ptr = vec.as_ptr();
811 let orig_capacity = vec.capacity();
812 let vec2 = vec.split_off(0);
814 assert_eq!(vec2, [1, 2, 3, 4, 5, 6]);
815 assert_eq!(vec.capacity(), orig_capacity);
816 assert_eq!(vec2.as_ptr(), orig_ptr);
820 fn test_into_iter_as_slice() {
821 let vec = vec!['a', 'b', 'c'];
822 let mut into_iter = vec.into_iter();
823 assert_eq!(into_iter.as_slice(), &['a', 'b', 'c']);
824 let _ = into_iter.next().unwrap();
825 assert_eq!(into_iter.as_slice(), &['b', 'c']);
826 let _ = into_iter.next().unwrap();
827 let _ = into_iter.next().unwrap();
828 assert_eq!(into_iter.as_slice(), &[]);
832 fn test_into_iter_as_mut_slice() {
833 let vec = vec!['a', 'b', 'c'];
834 let mut into_iter = vec.into_iter();
835 assert_eq!(into_iter.as_slice(), &['a', 'b', 'c']);
836 into_iter.as_mut_slice()[0] = 'x';
837 into_iter.as_mut_slice()[1] = 'y';
838 assert_eq!(into_iter.next().unwrap(), 'x');
839 assert_eq!(into_iter.as_slice(), &['y', 'c']);
843 fn test_into_iter_debug() {
844 let vec = vec!['a', 'b', 'c'];
845 let into_iter = vec.into_iter();
846 let debug = format!("{:?}", into_iter);
847 assert_eq!(debug, "IntoIter(['a', 'b', 'c'])");
851 fn test_into_iter_count() {
852 assert_eq!(vec![1, 2, 3].into_iter().count(), 3);
856 fn test_into_iter_clone() {
857 fn iter_equal<I: Iterator<Item = i32>>(it: I, slice: &[i32]) {
858 let v: Vec<i32> = it.collect();
859 assert_eq!(&v[..], slice);
861 let mut it = vec![1, 2, 3].into_iter();
862 iter_equal(it.clone(), &[1, 2, 3]);
863 assert_eq!(it.next(), Some(1));
864 let mut it = it.rev();
865 iter_equal(it.clone(), &[3, 2]);
866 assert_eq!(it.next(), Some(3));
867 iter_equal(it.clone(), &[2]);
868 assert_eq!(it.next(), Some(2));
869 iter_equal(it.clone(), &[]);
870 assert_eq!(it.next(), None);
874 fn test_into_iter_leak() {
875 static mut DROPS: i32 = 0;
886 panic!("panic in `drop`");
891 let v = vec![D(false), D(true), D(false)];
893 catch_unwind(move || drop(v.into_iter())).ok();
895 assert_eq!(unsafe { DROPS }, 3);
899 fn test_from_iter_specialization() {
900 let src: Vec<usize> = vec![0usize; 1];
901 let srcptr = src.as_ptr();
902 let sink = src.into_iter().collect::<Vec<_>>();
903 let sinkptr = sink.as_ptr();
904 assert_eq!(srcptr, sinkptr);
908 fn test_from_iter_partially_drained_in_place_specialization() {
909 let src: Vec<usize> = vec![0usize; 10];
910 let srcptr = src.as_ptr();
911 let mut iter = src.into_iter();
914 let sink = iter.collect::<Vec<_>>();
915 let sinkptr = sink.as_ptr();
916 assert_eq!(srcptr, sinkptr);
920 fn test_from_iter_specialization_with_iterator_adapters() {
921 fn assert_in_place_trait<T: InPlaceIterable>(_: &T) {};
922 let src: Vec<usize> = vec![0usize; 256];
923 let srcptr = src.as_ptr();
928 .zip(std::iter::repeat(1usize))
930 .map_while(Option::Some)
933 .map(|e| std::num::NonZeroUsize::new(e));
934 assert_in_place_trait(&iter);
935 let sink = iter.collect::<Vec<_>>();
936 let sinkptr = sink.as_ptr();
937 assert_eq!(srcptr, sinkptr as *const usize);
941 fn test_from_iter_specialization_head_tail_drop() {
942 let drop_count: Vec<_> = (0..=2).map(|_| Rc::new(())).collect();
943 let src: Vec<_> = drop_count.iter().cloned().collect();
944 let srcptr = src.as_ptr();
945 let iter = src.into_iter();
946 let sink: Vec<_> = iter.skip(1).take(1).collect();
947 let sinkptr = sink.as_ptr();
948 assert_eq!(srcptr, sinkptr, "specialization was applied");
949 assert_eq!(Rc::strong_count(&drop_count[0]), 1, "front was dropped");
950 assert_eq!(Rc::strong_count(&drop_count[1]), 2, "one element was collected");
951 assert_eq!(Rc::strong_count(&drop_count[2]), 1, "tail was dropped");
952 assert_eq!(sink.len(), 1);
956 fn test_from_iter_specialization_panic_drop() {
957 let drop_count: Vec<_> = (0..=2).map(|_| Rc::new(())).collect();
958 let src: Vec<_> = drop_count.iter().cloned().collect();
959 let iter = src.into_iter();
961 let _ = std::panic::catch_unwind(AssertUnwindSafe(|| {
964 .filter_map(|(i, e)| {
966 std::panic!("aborting iteration");
970 .collect::<Vec<_>>();
974 drop_count.iter().map(Rc::strong_count).all(|count| count == 1),
975 "all items were dropped once"
981 let borrowed: &[_] = &["borrowed", "(slice)"];
982 let owned = vec!["owned", "(vec)"];
983 match (Cow::from(owned.clone()), Cow::from(borrowed)) {
984 (Cow::Owned(o), Cow::Borrowed(b)) => assert!(o == owned && b == borrowed),
985 _ => panic!("invalid `Cow::from`"),
991 let borrowed: &[_] = &["borrowed", "(slice)"];
992 let owned = vec!["owned", "(vec)"];
993 assert_eq!(Vec::from(Cow::Borrowed(borrowed)), vec!["borrowed", "(slice)"]);
994 assert_eq!(Vec::from(Cow::Owned(owned)), vec!["owned", "(vec)"]);
998 fn assert_covariance() {
999 fn drain<'new>(d: Drain<'static, &'static str>) -> Drain<'new, &'new str> {
1002 fn into_iter<'new>(i: IntoIter<&'static str>) -> IntoIter<&'new str> {
1008 fn from_into_inner() {
1009 let vec = vec![1, 2, 3];
1010 let ptr = vec.as_ptr();
1011 let vec = vec.into_iter().collect::<Vec<_>>();
1012 assert_eq!(vec, [1, 2, 3]);
1013 assert_eq!(vec.as_ptr(), ptr);
1015 let ptr = &vec[1] as *const _;
1016 let mut it = vec.into_iter();
1018 let vec = it.collect::<Vec<_>>();
1019 assert_eq!(vec, [2, 3]);
1020 assert!(ptr != vec.as_ptr());
1024 fn overaligned_allocations() {
1027 let mut v = vec![Foo(273)];
1028 for i in 0..0x1000 {
1030 assert!(v[0].0 == 273);
1031 assert!(v.as_ptr() as usize & 0xff == 0);
1033 assert!(v[0].0 == 273);
1034 assert!(v.as_ptr() as usize & 0xff == 0);
1039 fn drain_filter_empty() {
1040 let mut vec: Vec<i32> = vec![];
1043 let mut iter = vec.drain_filter(|_| true);
1044 assert_eq!(iter.size_hint(), (0, Some(0)));
1045 assert_eq!(iter.next(), None);
1046 assert_eq!(iter.size_hint(), (0, Some(0)));
1047 assert_eq!(iter.next(), None);
1048 assert_eq!(iter.size_hint(), (0, Some(0)));
1050 assert_eq!(vec.len(), 0);
1051 assert_eq!(vec, vec![]);
1055 fn drain_filter_zst() {
1056 let mut vec = vec![(), (), (), (), ()];
1057 let initial_len = vec.len();
1060 let mut iter = vec.drain_filter(|_| true);
1061 assert_eq!(iter.size_hint(), (0, Some(initial_len)));
1062 while let Some(_) = iter.next() {
1064 assert_eq!(iter.size_hint(), (0, Some(initial_len - count)));
1066 assert_eq!(iter.size_hint(), (0, Some(0)));
1067 assert_eq!(iter.next(), None);
1068 assert_eq!(iter.size_hint(), (0, Some(0)));
1071 assert_eq!(count, initial_len);
1072 assert_eq!(vec.len(), 0);
1073 assert_eq!(vec, vec![]);
1077 fn drain_filter_false() {
1078 let mut vec = vec![1, 2, 3, 4, 5, 6, 7, 8, 9, 10];
1080 let initial_len = vec.len();
1083 let mut iter = vec.drain_filter(|_| false);
1084 assert_eq!(iter.size_hint(), (0, Some(initial_len)));
1085 for _ in iter.by_ref() {
1088 assert_eq!(iter.size_hint(), (0, Some(0)));
1089 assert_eq!(iter.next(), None);
1090 assert_eq!(iter.size_hint(), (0, Some(0)));
1093 assert_eq!(count, 0);
1094 assert_eq!(vec.len(), initial_len);
1095 assert_eq!(vec, vec![1, 2, 3, 4, 5, 6, 7, 8, 9, 10]);
1099 fn drain_filter_true() {
1100 let mut vec = vec![1, 2, 3, 4, 5, 6, 7, 8, 9, 10];
1102 let initial_len = vec.len();
1105 let mut iter = vec.drain_filter(|_| true);
1106 assert_eq!(iter.size_hint(), (0, Some(initial_len)));
1107 while let Some(_) = iter.next() {
1109 assert_eq!(iter.size_hint(), (0, Some(initial_len - count)));
1111 assert_eq!(iter.size_hint(), (0, Some(0)));
1112 assert_eq!(iter.next(), None);
1113 assert_eq!(iter.size_hint(), (0, Some(0)));
1116 assert_eq!(count, initial_len);
1117 assert_eq!(vec.len(), 0);
1118 assert_eq!(vec, vec![]);
1122 fn drain_filter_complex() {
1124 // [+xxx++++++xxxxx++++x+x++]
1126 1, 2, 4, 6, 7, 9, 11, 13, 15, 17, 18, 20, 22, 24, 26, 27, 29, 31, 33, 34, 35, 36, 37,
1130 let removed = vec.drain_filter(|x| *x % 2 == 0).collect::<Vec<_>>();
1131 assert_eq!(removed.len(), 10);
1132 assert_eq!(removed, vec![2, 4, 6, 18, 20, 22, 24, 26, 34, 36]);
1134 assert_eq!(vec.len(), 14);
1135 assert_eq!(vec, vec![1, 7, 9, 11, 13, 15, 17, 27, 29, 31, 33, 35, 37, 39]);
1139 // [xxx++++++xxxxx++++x+x++]
1141 2, 4, 6, 7, 9, 11, 13, 15, 17, 18, 20, 22, 24, 26, 27, 29, 31, 33, 34, 35, 36, 37, 39,
1144 let removed = vec.drain_filter(|x| *x % 2 == 0).collect::<Vec<_>>();
1145 assert_eq!(removed.len(), 10);
1146 assert_eq!(removed, vec![2, 4, 6, 18, 20, 22, 24, 26, 34, 36]);
1148 assert_eq!(vec.len(), 13);
1149 assert_eq!(vec, vec![7, 9, 11, 13, 15, 17, 27, 29, 31, 33, 35, 37, 39]);
1153 // [xxx++++++xxxxx++++x+x]
1155 vec![2, 4, 6, 7, 9, 11, 13, 15, 17, 18, 20, 22, 24, 26, 27, 29, 31, 33, 34, 35, 36];
1157 let removed = vec.drain_filter(|x| *x % 2 == 0).collect::<Vec<_>>();
1158 assert_eq!(removed.len(), 10);
1159 assert_eq!(removed, vec![2, 4, 6, 18, 20, 22, 24, 26, 34, 36]);
1161 assert_eq!(vec.len(), 11);
1162 assert_eq!(vec, vec![7, 9, 11, 13, 15, 17, 27, 29, 31, 33, 35]);
1166 // [xxxxxxxxxx+++++++++++]
1167 let mut vec = vec![2, 4, 6, 8, 10, 12, 14, 16, 18, 20, 1, 3, 5, 7, 9, 11, 13, 15, 17, 19];
1169 let removed = vec.drain_filter(|x| *x % 2 == 0).collect::<Vec<_>>();
1170 assert_eq!(removed.len(), 10);
1171 assert_eq!(removed, vec![2, 4, 6, 8, 10, 12, 14, 16, 18, 20]);
1173 assert_eq!(vec.len(), 10);
1174 assert_eq!(vec, vec![1, 3, 5, 7, 9, 11, 13, 15, 17, 19]);
1178 // [+++++++++++xxxxxxxxxx]
1179 let mut vec = vec![1, 3, 5, 7, 9, 11, 13, 15, 17, 19, 2, 4, 6, 8, 10, 12, 14, 16, 18, 20];
1181 let removed = vec.drain_filter(|x| *x % 2 == 0).collect::<Vec<_>>();
1182 assert_eq!(removed.len(), 10);
1183 assert_eq!(removed, vec![2, 4, 6, 8, 10, 12, 14, 16, 18, 20]);
1185 assert_eq!(vec.len(), 10);
1186 assert_eq!(vec, vec![1, 3, 5, 7, 9, 11, 13, 15, 17, 19]);
1190 // FIXME: re-enable emscripten once it can unwind again
1192 #[cfg(not(target_os = "emscripten"))]
1193 fn drain_filter_consumed_panic() {
1195 use std::sync::Mutex;
1199 drop_counts: Rc<Mutex<Vec<usize>>>,
1202 impl Drop for Check {
1203 fn drop(&mut self) {
1204 self.drop_counts.lock().unwrap()[self.index] += 1;
1205 println!("drop: {}", self.index);
1209 let check_count = 10;
1210 let drop_counts = Rc::new(Mutex::new(vec![0_usize; check_count]));
1211 let mut data: Vec<Check> = (0..check_count)
1212 .map(|index| Check { index, drop_counts: Rc::clone(&drop_counts) })
1215 let _ = std::panic::catch_unwind(move || {
1216 let filter = |c: &mut Check| {
1218 panic!("panic at index: {}", c.index);
1220 // Verify that if the filter could panic again on another element
1221 // that it would not cause a double panic and all elements of the
1222 // vec would still be dropped exactly once.
1224 panic!("panic at index: {}", c.index);
1228 let drain = data.drain_filter(filter);
1230 // NOTE: The DrainFilter is explicitly consumed
1231 drain.for_each(drop);
1234 let drop_counts = drop_counts.lock().unwrap();
1235 assert_eq!(check_count, drop_counts.len());
1237 for (index, count) in drop_counts.iter().cloned().enumerate() {
1238 assert_eq!(1, count, "unexpected drop count at index: {} (count: {})", index, count);
1242 // FIXME: Re-enable emscripten once it can catch panics
1244 #[cfg(not(target_os = "emscripten"))]
1245 fn drain_filter_unconsumed_panic() {
1247 use std::sync::Mutex;
1251 drop_counts: Rc<Mutex<Vec<usize>>>,
1254 impl Drop for Check {
1255 fn drop(&mut self) {
1256 self.drop_counts.lock().unwrap()[self.index] += 1;
1257 println!("drop: {}", self.index);
1261 let check_count = 10;
1262 let drop_counts = Rc::new(Mutex::new(vec![0_usize; check_count]));
1263 let mut data: Vec<Check> = (0..check_count)
1264 .map(|index| Check { index, drop_counts: Rc::clone(&drop_counts) })
1267 let _ = std::panic::catch_unwind(move || {
1268 let filter = |c: &mut Check| {
1270 panic!("panic at index: {}", c.index);
1272 // Verify that if the filter could panic again on another element
1273 // that it would not cause a double panic and all elements of the
1274 // vec would still be dropped exactly once.
1276 panic!("panic at index: {}", c.index);
1280 let _drain = data.drain_filter(filter);
1282 // NOTE: The DrainFilter is dropped without being consumed
1285 let drop_counts = drop_counts.lock().unwrap();
1286 assert_eq!(check_count, drop_counts.len());
1288 for (index, count) in drop_counts.iter().cloned().enumerate() {
1289 assert_eq!(1, count, "unexpected drop count at index: {} (count: {})", index, count);
1294 fn drain_filter_unconsumed() {
1295 let mut vec = vec![1, 2, 3, 4];
1296 let drain = vec.drain_filter(|&mut x| x % 2 != 0);
1298 assert_eq!(vec, [2, 4]);
1302 fn test_reserve_exact() {
1303 // This is all the same as test_reserve
1305 let mut v = Vec::new();
1306 assert_eq!(v.capacity(), 0);
1309 assert!(v.capacity() >= 2);
1315 assert!(v.capacity() >= 16);
1316 v.reserve_exact(16);
1317 assert!(v.capacity() >= 32);
1321 v.reserve_exact(16);
1322 assert!(v.capacity() >= 33)
1326 #[cfg_attr(miri, ignore)] // Miri does not support signalling OOM
1327 #[cfg_attr(target_os = "android", ignore)] // Android used in CI has a broken dlmalloc
1328 fn test_try_reserve() {
1329 // These are the interesting cases:
1330 // * exactly isize::MAX should never trigger a CapacityOverflow (can be OOM)
1331 // * > isize::MAX should always fail
1332 // * On 16/32-bit should CapacityOverflow
1333 // * On 64-bit should OOM
1334 // * overflow may trigger when adding `len` to `cap` (in number of elements)
1335 // * overflow may trigger when multiplying `new_cap` by size_of::<T> (to get bytes)
1337 const MAX_CAP: usize = isize::MAX as usize;
1338 const MAX_USIZE: usize = usize::MAX;
1340 // On 16/32-bit, we check that allocations don't exceed isize::MAX,
1341 // on 64-bit, we assume the OS will give an OOM for such a ridiculous size.
1342 // Any platform that succeeds for these requests is technically broken with
1343 // ptr::offset because LLVM is the worst.
1344 let guards_against_isize = usize::BITS < 64;
1347 // Note: basic stuff is checked by test_reserve
1348 let mut empty_bytes: Vec<u8> = Vec::new();
1350 // Check isize::MAX doesn't count as an overflow
1351 if let Err(CapacityOverflow) = empty_bytes.try_reserve(MAX_CAP) {
1352 panic!("isize::MAX shouldn't trigger an overflow!");
1354 // Play it again, frank! (just to be sure)
1355 if let Err(CapacityOverflow) = empty_bytes.try_reserve(MAX_CAP) {
1356 panic!("isize::MAX shouldn't trigger an overflow!");
1359 if guards_against_isize {
1360 // Check isize::MAX + 1 does count as overflow
1361 if let Err(CapacityOverflow) = empty_bytes.try_reserve(MAX_CAP + 1) {
1363 panic!("isize::MAX + 1 should trigger an overflow!")
1366 // Check usize::MAX does count as overflow
1367 if let Err(CapacityOverflow) = empty_bytes.try_reserve(MAX_USIZE) {
1369 panic!("usize::MAX should trigger an overflow!")
1372 // Check isize::MAX + 1 is an OOM
1373 if let Err(AllocError { .. }) = empty_bytes.try_reserve(MAX_CAP + 1) {
1375 panic!("isize::MAX + 1 should trigger an OOM!")
1378 // Check usize::MAX is an OOM
1379 if let Err(AllocError { .. }) = empty_bytes.try_reserve(MAX_USIZE) {
1381 panic!("usize::MAX should trigger an OOM!")
1387 // Same basic idea, but with non-zero len
1388 let mut ten_bytes: Vec<u8> = vec![1, 2, 3, 4, 5, 6, 7, 8, 9, 10];
1390 if let Err(CapacityOverflow) = ten_bytes.try_reserve(MAX_CAP - 10) {
1391 panic!("isize::MAX shouldn't trigger an overflow!");
1393 if let Err(CapacityOverflow) = ten_bytes.try_reserve(MAX_CAP - 10) {
1394 panic!("isize::MAX shouldn't trigger an overflow!");
1396 if guards_against_isize {
1397 if let Err(CapacityOverflow) = ten_bytes.try_reserve(MAX_CAP - 9) {
1399 panic!("isize::MAX + 1 should trigger an overflow!");
1402 if let Err(AllocError { .. }) = ten_bytes.try_reserve(MAX_CAP - 9) {
1404 panic!("isize::MAX + 1 should trigger an OOM!")
1407 // Should always overflow in the add-to-len
1408 if let Err(CapacityOverflow) = ten_bytes.try_reserve(MAX_USIZE) {
1410 panic!("usize::MAX should trigger an overflow!")
1415 // Same basic idea, but with interesting type size
1416 let mut ten_u32s: Vec<u32> = vec![1, 2, 3, 4, 5, 6, 7, 8, 9, 10];
1418 if let Err(CapacityOverflow) = ten_u32s.try_reserve(MAX_CAP / 4 - 10) {
1419 panic!("isize::MAX shouldn't trigger an overflow!");
1421 if let Err(CapacityOverflow) = ten_u32s.try_reserve(MAX_CAP / 4 - 10) {
1422 panic!("isize::MAX shouldn't trigger an overflow!");
1424 if guards_against_isize {
1425 if let Err(CapacityOverflow) = ten_u32s.try_reserve(MAX_CAP / 4 - 9) {
1427 panic!("isize::MAX + 1 should trigger an overflow!");
1430 if let Err(AllocError { .. }) = ten_u32s.try_reserve(MAX_CAP / 4 - 9) {
1432 panic!("isize::MAX + 1 should trigger an OOM!")
1435 // Should fail in the mul-by-size
1436 if let Err(CapacityOverflow) = ten_u32s.try_reserve(MAX_USIZE - 20) {
1438 panic!("usize::MAX should trigger an overflow!");
1444 #[cfg_attr(miri, ignore)] // Miri does not support signalling OOM
1445 #[cfg_attr(target_os = "android", ignore)] // Android used in CI has a broken dlmalloc
1446 fn test_try_reserve_exact() {
1447 // This is exactly the same as test_try_reserve with the method changed.
1448 // See that test for comments.
1450 const MAX_CAP: usize = isize::MAX as usize;
1451 const MAX_USIZE: usize = usize::MAX;
1453 let guards_against_isize = size_of::<usize>() < 8;
1456 let mut empty_bytes: Vec<u8> = Vec::new();
1458 if let Err(CapacityOverflow) = empty_bytes.try_reserve_exact(MAX_CAP) {
1459 panic!("isize::MAX shouldn't trigger an overflow!");
1461 if let Err(CapacityOverflow) = empty_bytes.try_reserve_exact(MAX_CAP) {
1462 panic!("isize::MAX shouldn't trigger an overflow!");
1465 if guards_against_isize {
1466 if let Err(CapacityOverflow) = empty_bytes.try_reserve_exact(MAX_CAP + 1) {
1468 panic!("isize::MAX + 1 should trigger an overflow!")
1471 if let Err(CapacityOverflow) = empty_bytes.try_reserve_exact(MAX_USIZE) {
1473 panic!("usize::MAX should trigger an overflow!")
1476 if let Err(AllocError { .. }) = empty_bytes.try_reserve_exact(MAX_CAP + 1) {
1478 panic!("isize::MAX + 1 should trigger an OOM!")
1481 if let Err(AllocError { .. }) = empty_bytes.try_reserve_exact(MAX_USIZE) {
1483 panic!("usize::MAX should trigger an OOM!")
1489 let mut ten_bytes: Vec<u8> = vec![1, 2, 3, 4, 5, 6, 7, 8, 9, 10];
1491 if let Err(CapacityOverflow) = ten_bytes.try_reserve_exact(MAX_CAP - 10) {
1492 panic!("isize::MAX shouldn't trigger an overflow!");
1494 if let Err(CapacityOverflow) = ten_bytes.try_reserve_exact(MAX_CAP - 10) {
1495 panic!("isize::MAX shouldn't trigger an overflow!");
1497 if guards_against_isize {
1498 if let Err(CapacityOverflow) = ten_bytes.try_reserve_exact(MAX_CAP - 9) {
1500 panic!("isize::MAX + 1 should trigger an overflow!");
1503 if let Err(AllocError { .. }) = ten_bytes.try_reserve_exact(MAX_CAP - 9) {
1505 panic!("isize::MAX + 1 should trigger an OOM!")
1508 if let Err(CapacityOverflow) = ten_bytes.try_reserve_exact(MAX_USIZE) {
1510 panic!("usize::MAX should trigger an overflow!")
1515 let mut ten_u32s: Vec<u32> = vec![1, 2, 3, 4, 5, 6, 7, 8, 9, 10];
1517 if let Err(CapacityOverflow) = ten_u32s.try_reserve_exact(MAX_CAP / 4 - 10) {
1518 panic!("isize::MAX shouldn't trigger an overflow!");
1520 if let Err(CapacityOverflow) = ten_u32s.try_reserve_exact(MAX_CAP / 4 - 10) {
1521 panic!("isize::MAX shouldn't trigger an overflow!");
1523 if guards_against_isize {
1524 if let Err(CapacityOverflow) = ten_u32s.try_reserve_exact(MAX_CAP / 4 - 9) {
1526 panic!("isize::MAX + 1 should trigger an overflow!");
1529 if let Err(AllocError { .. }) = ten_u32s.try_reserve_exact(MAX_CAP / 4 - 9) {
1531 panic!("isize::MAX + 1 should trigger an OOM!")
1534 if let Err(CapacityOverflow) = ten_u32s.try_reserve_exact(MAX_USIZE - 20) {
1536 panic!("usize::MAX should trigger an overflow!")
1542 fn test_stable_pointers() {
1543 /// Pull an element from the iterator, then drop it.
1544 /// Useful to cover both the `next` and `drop` paths of an iterator.
1545 fn next_then_drop<I: Iterator>(mut i: I) {
1550 // Test that, if we reserved enough space, adding and removing elements does not
1551 // invalidate references into the vector (such as `v0`). This test also
1552 // runs in Miri, which would detect such problems.
1553 // Note that this test does *not* constitute a stable guarantee that all these functions do not
1554 // reallocate! Only what is explicitly documented at
1555 // <https://doc.rust-lang.org/nightly/std/vec/struct.Vec.html#guarantees> is stably guaranteed.
1556 let mut v = Vec::with_capacity(128);
1559 // Laundering the lifetime -- we take care that `v` does not reallocate, so that's okay.
1561 let v0 = unsafe { &mut *(v0 as *mut _) };
1562 // Now do a bunch of things and occasionally use `v0` again to assert it is still valid.
1564 // Pushing/inserting and popping/removing
1568 assert_eq!(*v0, 13);
1571 assert_eq!(*v0, 13);
1574 assert_eq!(v.len(), 2);
1575 v.swap_remove(1); // swap_remove the last element
1576 assert_eq!(*v0, 13);
1579 v.append(&mut vec![27, 19]);
1580 assert_eq!(*v0, 13);
1583 v.extend_from_slice(&[1, 2]);
1584 v.extend(&[1, 2]); // `slice::Iter` (with `T: Copy`) specialization
1585 v.extend(vec![2, 3]); // `vec::IntoIter` specialization
1586 v.extend(std::iter::once(3)); // `TrustedLen` specialization
1587 v.extend(std::iter::empty::<i32>()); // `TrustedLen` specialization with empty iterator
1588 v.extend(std::iter::once(3).filter(|_| true)); // base case
1589 v.extend(std::iter::once(&3)); // `cloned` specialization
1590 assert_eq!(*v0, 13);
1594 assert_eq!(*v0, 13);
1597 v.resize_with(v.len() + 10, || 42);
1598 assert_eq!(*v0, 13);
1599 v.resize_with(2, || panic!());
1600 assert_eq!(*v0, 13);
1602 // No-op reservation
1604 v.reserve_exact(32);
1605 assert_eq!(*v0, 13);
1608 v.resize_with(10, || 42);
1609 next_then_drop(v.drain(5..));
1610 assert_eq!(*v0, 13);
1613 v.resize_with(10, || 42);
1614 next_then_drop(v.splice(5.., vec![1, 2, 3, 4, 5])); // empty tail after range
1615 assert_eq!(*v0, 13);
1616 next_then_drop(v.splice(5..8, vec![1])); // replacement is smaller than original range
1617 assert_eq!(*v0, 13);
1618 next_then_drop(v.splice(5..6, vec![1; 10].into_iter().filter(|_| true))); // lower bound not exact
1619 assert_eq!(*v0, 13);
1621 // Smoke test that would fire even outside Miri if an actual relocation happened.
1623 assert_eq!(v[0], 0);
1626 // https://github.com/rust-lang/rust/pull/49496 introduced specialization based on:
1629 // unsafe impl<T: ?Sized> IsZero for *mut T {
1630 // fn is_zero(&self) -> bool {
1631 // (*self).is_null()
1636 // … to call `RawVec::with_capacity_zeroed` for creating `Vec<*mut T>`,
1637 // which is incorrect for fat pointers since `<*mut T>::is_null` only looks at the data component.
1638 // That is, a fat pointer can be “null” without being made entirely of zero bits.
1640 fn vec_macro_repeating_null_raw_fat_pointer() {
1641 let raw_dyn = &mut (|| ()) as &mut dyn Fn() as *mut dyn Fn();
1642 let vtable = dbg!(ptr_metadata(raw_dyn));
1643 let null_raw_dyn = ptr_from_raw_parts(std::ptr::null_mut(), vtable);
1644 assert!(null_raw_dyn.is_null());
1646 let vec = vec![null_raw_dyn; 1];
1647 dbg!(ptr_metadata(vec[0]));
1648 assert!(vec[0] == null_raw_dyn);
1650 // Polyfill for https://github.com/rust-lang/rfcs/pull/2580
1652 fn ptr_metadata(ptr: *mut dyn Fn()) -> *mut () {
1653 unsafe { std::mem::transmute::<*mut dyn Fn(), DynRepr>(ptr).vtable }
1656 fn ptr_from_raw_parts(data: *mut (), vtable: *mut ()) -> *mut dyn Fn() {
1657 unsafe { std::mem::transmute::<DynRepr, *mut dyn Fn()>(DynRepr { data, vtable }) }
1667 // This test will likely fail if you change the capacities used in
1668 // `RawVec::grow_amortized`.
1670 fn test_push_growth_strategy() {
1671 // If the element size is 1, we jump from 0 to 8, then double.
1673 let mut v1: Vec<u8> = vec![];
1674 assert_eq!(v1.capacity(), 0);
1678 assert_eq!(v1.capacity(), 8);
1683 assert_eq!(v1.capacity(), 16);
1688 assert_eq!(v1.capacity(), 32);
1693 assert_eq!(v1.capacity(), 64);
1697 // If the element size is 2..=1024, we jump from 0 to 4, then double.
1699 let mut v2: Vec<u16> = vec![];
1700 let mut v1024: Vec<[u8; 1024]> = vec![];
1701 assert_eq!(v2.capacity(), 0);
1702 assert_eq!(v1024.capacity(), 0);
1706 v1024.push([0; 1024]);
1707 assert_eq!(v2.capacity(), 4);
1708 assert_eq!(v1024.capacity(), 4);
1713 v1024.push([0; 1024]);
1714 assert_eq!(v2.capacity(), 8);
1715 assert_eq!(v1024.capacity(), 8);
1720 v1024.push([0; 1024]);
1721 assert_eq!(v2.capacity(), 16);
1722 assert_eq!(v1024.capacity(), 16);
1727 v1024.push([0; 1024]);
1728 assert_eq!(v2.capacity(), 32);
1729 assert_eq!(v1024.capacity(), 32);
1734 v1024.push([0; 1024]);
1735 assert_eq!(v2.capacity(), 64);
1736 assert_eq!(v1024.capacity(), 64);
1740 // If the element size is > 1024, we jump from 0 to 1, then double.
1742 let mut v1025: Vec<[u8; 1025]> = vec![];
1743 assert_eq!(v1025.capacity(), 0);
1746 v1025.push([0; 1025]);
1747 assert_eq!(v1025.capacity(), 1);
1751 v1025.push([0; 1025]);
1752 assert_eq!(v1025.capacity(), 2);
1756 v1025.push([0; 1025]);
1757 assert_eq!(v1025.capacity(), 4);
1761 v1025.push([0; 1025]);
1762 assert_eq!(v1025.capacity(), 8);
1766 v1025.push([0; 1025]);
1767 assert_eq!(v1025.capacity(), 16);
1771 v1025.push([0; 1025]);
1772 assert_eq!(v1025.capacity(), 32);
1776 v1025.push([0; 1025]);
1777 assert_eq!(v1025.capacity(), 64);
1782 macro_rules! generate_assert_eq_vec_and_prim {
1783 ($name:ident<$B:ident>($type:ty)) => {
1784 fn $name<A: PartialEq<$B> + Debug, $B: Debug>(a: Vec<A>, b: $type) {
1791 generate_assert_eq_vec_and_prim! { assert_eq_vec_and_slice <B>(&[B]) }
1792 generate_assert_eq_vec_and_prim! { assert_eq_vec_and_array_3<B>([B; 3]) }
1795 fn partialeq_vec_and_prim() {
1796 assert_eq_vec_and_slice(vec![1, 2, 3], &[1, 2, 3]);
1797 assert_eq_vec_and_array_3(vec![1, 2, 3], [1, 2, 3]);
1800 macro_rules! assert_partial_eq_valid {
1801 ($a2:ident, $a3:ident; $b2:ident, $b3: ident) => {
1802 assert!($a2 == $b2);
1803 assert!($a2 != $b3);
1804 assert!($a3 != $b2);
1805 assert!($a3 == $b3);
1806 assert_eq!($a2, $b2);
1807 assert_ne!($a2, $b3);
1808 assert_ne!($a3, $b2);
1809 assert_eq!($a3, $b3);
1814 fn partialeq_vec_full() {
1815 let vec2: Vec<_> = vec![1, 2];
1816 let vec3: Vec<_> = vec![1, 2, 3];
1817 let slice2: &[_] = &[1, 2];
1818 let slice3: &[_] = &[1, 2, 3];
1819 let slicemut2: &[_] = &mut [1, 2];
1820 let slicemut3: &[_] = &mut [1, 2, 3];
1821 let array2: [_; 2] = [1, 2];
1822 let array3: [_; 3] = [1, 2, 3];
1823 let arrayref2: &[_; 2] = &[1, 2];
1824 let arrayref3: &[_; 3] = &[1, 2, 3];
1826 assert_partial_eq_valid!(vec2,vec3; vec2,vec3);
1827 assert_partial_eq_valid!(vec2,vec3; slice2,slice3);
1828 assert_partial_eq_valid!(vec2,vec3; slicemut2,slicemut3);
1829 assert_partial_eq_valid!(slice2,slice3; vec2,vec3);
1830 assert_partial_eq_valid!(slicemut2,slicemut3; vec2,vec3);
1831 assert_partial_eq_valid!(vec2,vec3; array2,array3);
1832 assert_partial_eq_valid!(vec2,vec3; arrayref2,arrayref3);