|
1 | 1 | diff --git a/src/arrayvec_copy_generated.rs b/src/arrayvec_copy.rs
|
2 |
| -index b12aa9e..5597af9 100644 |
| 2 | +index b12aa9e..8e4c3a9 100644 |
3 | 3 | --- a/src/arrayvec_copy_generated.rs
|
4 | 4 | +++ b/src/arrayvec_copy.rs
|
5 | 5 | @@ -27,6 +27,9 @@ use crate::utils::MakeMaybeUninit;
|
@@ -27,7 +27,28 @@ index b12aa9e..5597af9 100644
|
27 | 27 | macro_rules! panic_oob {
|
28 | 28 | ($method_name:expr, $index:expr, $len:expr) => {
|
29 | 29 | panic!(concat!("ArrayVecCopy::", $method_name, ": index {} is out of bounds in vector of length {}"),
|
30 |
| -@@ -964,21 +959,6 @@ impl<T: Copy, const CAP: usize> DoubleEndedIterator for IntoIter<T, CAP> { |
| 30 | +@@ -87,20 +82,6 @@ impl<T: Copy, const CAP: usize> ArrayVecCopy<T, CAP> { |
| 31 | + } |
| 32 | + } |
| 33 | + |
| 34 | +- /// Create a new empty `ArrayVecCopy` (const fn). |
| 35 | +- /// |
| 36 | +- /// The maximum capacity is given by the generic parameter `CAP`. |
| 37 | +- /// |
| 38 | +- /// ``` |
| 39 | +- /// use arrayvec::ArrayVecCopy; |
| 40 | +- /// |
| 41 | +- /// static ARRAY: ArrayVecCopy<u8, 1024> = ArrayVecCopy::new_const(); |
| 42 | +- /// ``` |
| 43 | +- pub const fn new_const() -> ArrayVecCopy<T, CAP> { |
| 44 | +- assert_capacity_limit_const!(CAP); |
| 45 | +- ArrayVecCopy { xs: MakeMaybeUninit::ARRAY, len: 0 } |
| 46 | +- } |
| 47 | +- |
| 48 | + /// Return the number of elements in the `ArrayVecCopy`. |
| 49 | + /// |
| 50 | + /// ``` |
| 51 | +@@ -964,21 +945,6 @@ impl<T: Copy, const CAP: usize> DoubleEndedIterator for IntoIter<T, CAP> { |
31 | 52 |
|
32 | 53 | impl<T: Copy, const CAP: usize> ExactSizeIterator for IntoIter<T, CAP> { }
|
33 | 54 |
|
|
0 commit comments