@@ -84,7 +84,7 @@ impl<T: Copy, const CAP: usize> ArrayVecCopy<T, CAP> {
84
84
/// The maximum capacity is given by the generic parameter `CAP`.
85
85
///
86
86
/// ```
87
- /// use arrayvec::ArrayVecCopy;
87
+ /// use arrayvec::copy:: ArrayVecCopy;
88
88
///
89
89
/// let mut array = ArrayVecCopy::<_, 16>::new();
90
90
/// array.push(1);
@@ -107,7 +107,7 @@ impl<T: Copy, const CAP: usize> ArrayVecCopy<T, CAP> {
107
107
/// The maximum capacity is given by the generic parameter `CAP`.
108
108
///
109
109
/// ```
110
- /// use arrayvec::ArrayVecCopy;
110
+ /// use arrayvec::copy:: ArrayVecCopy;
111
111
///
112
112
/// static ARRAY: ArrayVecCopy<u8, 1024> = ArrayVecCopy::new_const();
113
113
/// ```
@@ -119,7 +119,7 @@ impl<T: Copy, const CAP: usize> ArrayVecCopy<T, CAP> {
119
119
/// Return the number of elements in the `ArrayVecCopy`.
120
120
///
121
121
/// ```
122
- /// use arrayvec::ArrayVecCopy;
122
+ /// use arrayvec::copy:: ArrayVecCopy;
123
123
///
124
124
/// let mut array = ArrayVecCopy::from([1, 2, 3]);
125
125
/// array.pop();
@@ -131,7 +131,7 @@ impl<T: Copy, const CAP: usize> ArrayVecCopy<T, CAP> {
131
131
/// Returns whether the `ArrayVecCopy` is empty.
132
132
///
133
133
/// ```
134
- /// use arrayvec::ArrayVecCopy;
134
+ /// use arrayvec::copy:: ArrayVecCopy;
135
135
///
136
136
/// let mut array = ArrayVecCopy::from([1]);
137
137
/// array.pop();
@@ -143,7 +143,7 @@ impl<T: Copy, const CAP: usize> ArrayVecCopy<T, CAP> {
143
143
/// Return the capacity of the `ArrayVecCopy`.
144
144
///
145
145
/// ```
146
- /// use arrayvec::ArrayVecCopy;
146
+ /// use arrayvec::copy:: ArrayVecCopy;
147
147
///
148
148
/// let array = ArrayVecCopy::from([1, 2, 3]);
149
149
/// assert_eq!(array.capacity(), 3);
@@ -154,7 +154,7 @@ impl<T: Copy, const CAP: usize> ArrayVecCopy<T, CAP> {
154
154
/// Return true if the `ArrayVecCopy` is completely filled to its capacity, false otherwise.
155
155
///
156
156
/// ```
157
- /// use arrayvec::ArrayVecCopy;
157
+ /// use arrayvec::copy:: ArrayVecCopy;
158
158
///
159
159
/// let mut array = ArrayVecCopy::<_, 1>::new();
160
160
/// assert!(!array.is_full());
@@ -166,7 +166,7 @@ impl<T: Copy, const CAP: usize> ArrayVecCopy<T, CAP> {
166
166
/// Returns the capacity left in the `ArrayVecCopy`.
167
167
///
168
168
/// ```
169
- /// use arrayvec::ArrayVecCopy;
169
+ /// use arrayvec::copy:: ArrayVecCopy;
170
170
///
171
171
/// let mut array = ArrayVecCopy::from([1, 2, 3]);
172
172
/// array.pop();
@@ -181,7 +181,7 @@ impl<T: Copy, const CAP: usize> ArrayVecCopy<T, CAP> {
181
181
/// ***Panics*** if the vector is already full.
182
182
///
183
183
/// ```
184
- /// use arrayvec::ArrayVecCopy;
184
+ /// use arrayvec::copy:: ArrayVecCopy;
185
185
///
186
186
/// let mut array = ArrayVecCopy::<_, 2>::new();
187
187
///
@@ -201,7 +201,7 @@ impl<T: Copy, const CAP: usize> ArrayVecCopy<T, CAP> {
201
201
/// is already full.
202
202
///
203
203
/// ```
204
- /// use arrayvec::ArrayVecCopy;
204
+ /// use arrayvec::copy:: ArrayVecCopy;
205
205
///
206
206
/// let mut array = ArrayVecCopy::<_, 2>::new();
207
207
///
@@ -229,7 +229,7 @@ impl<T: Copy, const CAP: usize> ArrayVecCopy<T, CAP> {
229
229
/// This method uses *debug assertions* to check that the arrayvec is not full.
230
230
///
231
231
/// ```
232
- /// use arrayvec::ArrayVecCopy;
232
+ /// use arrayvec::copy:: ArrayVecCopy;
233
233
///
234
234
/// let mut array = ArrayVecCopy::<_, 2>::new();
235
235
///
@@ -253,7 +253,7 @@ impl<T: Copy, const CAP: usize> ArrayVecCopy<T, CAP> {
253
253
/// effect.
254
254
///
255
255
/// ```
256
- /// use arrayvec::ArrayVecCopy;
256
+ /// use arrayvec::copy:: ArrayVecCopy;
257
257
///
258
258
/// let mut array = ArrayVecCopy::from([1, 2, 3, 4, 5]);
259
259
/// array.truncate(3);
@@ -287,7 +287,7 @@ impl<T: Copy, const CAP: usize> ArrayVecCopy<T, CAP> {
287
287
/// `try_insert` for fallible version.
288
288
///
289
289
/// ```
290
- /// use arrayvec::ArrayVecCopy;
290
+ /// use arrayvec::copy:: ArrayVecCopy;
291
291
///
292
292
/// let mut array = ArrayVecCopy::<_, 2>::new();
293
293
///
@@ -311,7 +311,7 @@ impl<T: Copy, const CAP: usize> ArrayVecCopy<T, CAP> {
311
311
/// ***Panics*** `index` is out of bounds.
312
312
///
313
313
/// ```
314
- /// use arrayvec::ArrayVecCopy;
314
+ /// use arrayvec::copy:: ArrayVecCopy;
315
315
///
316
316
/// let mut array = ArrayVecCopy::<_, 2>::new();
317
317
///
@@ -352,7 +352,7 @@ impl<T: Copy, const CAP: usize> ArrayVecCopy<T, CAP> {
352
352
/// Return `Some(` *element* `)` if the vector is non-empty, else `None`.
353
353
///
354
354
/// ```
355
- /// use arrayvec::ArrayVecCopy;
355
+ /// use arrayvec::copy:: ArrayVecCopy;
356
356
///
357
357
/// let mut array = ArrayVecCopy::<_, 2>::new();
358
358
///
@@ -374,7 +374,7 @@ impl<T: Copy, const CAP: usize> ArrayVecCopy<T, CAP> {
374
374
/// ***Panics*** if the `index` is out of bounds.
375
375
///
376
376
/// ```
377
- /// use arrayvec::ArrayVecCopy;
377
+ /// use arrayvec::copy:: ArrayVecCopy;
378
378
///
379
379
/// let mut array = ArrayVecCopy::from([1, 2, 3]);
380
380
///
@@ -399,7 +399,7 @@ impl<T: Copy, const CAP: usize> ArrayVecCopy<T, CAP> {
399
399
/// Return `Some(` *element* `)` if the index is in bounds, else `None`.
400
400
///
401
401
/// ```
402
- /// use arrayvec::ArrayVecCopy;
402
+ /// use arrayvec::copy:: ArrayVecCopy;
403
403
///
404
404
/// let mut array = ArrayVecCopy::from([1, 2, 3]);
405
405
///
@@ -424,7 +424,7 @@ impl<T: Copy, const CAP: usize> ArrayVecCopy<T, CAP> {
424
424
/// ***Panics*** if the `index` is out of bounds.
425
425
///
426
426
/// ```
427
- /// use arrayvec::ArrayVecCopy;
427
+ /// use arrayvec::copy:: ArrayVecCopy;
428
428
///
429
429
/// let mut array = ArrayVecCopy::from([1, 2, 3]);
430
430
///
@@ -445,7 +445,7 @@ impl<T: Copy, const CAP: usize> ArrayVecCopy<T, CAP> {
445
445
/// is no element at `index`. Otherwise, return the element inside `Some`.
446
446
///
447
447
/// ```
448
- /// use arrayvec::ArrayVecCopy;
448
+ /// use arrayvec::copy:: ArrayVecCopy;
449
449
///
450
450
/// let mut array = ArrayVecCopy::from([1, 2, 3]);
451
451
///
@@ -470,7 +470,7 @@ impl<T: Copy, const CAP: usize> ArrayVecCopy<T, CAP> {
470
470
/// elements.
471
471
///
472
472
/// ```
473
- /// use arrayvec::ArrayVecCopy;
473
+ /// use arrayvec::copy:: ArrayVecCopy;
474
474
///
475
475
/// let mut array = ArrayVecCopy::from([1, 2, 3, 4]);
476
476
/// array.retain(|x| *x & 1 != 0 );
@@ -562,7 +562,7 @@ impl<T: Copy, const CAP: usize> ArrayVecCopy<T, CAP> {
562
562
/// # Examples
563
563
///
564
564
/// ```
565
- /// use arrayvec::ArrayVecCopy;
565
+ /// use arrayvec::copy:: ArrayVecCopy;
566
566
///
567
567
/// // Allocate vector big enough for 10 elements.
568
568
/// let mut v: ArrayVecCopy<i32, 10> = ArrayVecCopy::new();
@@ -601,7 +601,7 @@ impl<T: Copy, const CAP: usize> ArrayVecCopy<T, CAP> {
601
601
/// Copy all elements from the slice and append to the `ArrayVecCopy`.
602
602
///
603
603
/// ```
604
- /// use arrayvec::ArrayVecCopy;
604
+ /// use arrayvec::copy:: ArrayVecCopy;
605
605
///
606
606
/// let mut vec: ArrayVecCopy<usize, 10> = ArrayVecCopy::new();
607
607
/// vec.push(1);
@@ -645,7 +645,7 @@ impl<T: Copy, const CAP: usize> ArrayVecCopy<T, CAP> {
645
645
/// the end point is greater than the length of the vector.
646
646
///
647
647
/// ```
648
- /// use arrayvec::ArrayVecCopy;
648
+ /// use arrayvec::copy:: ArrayVecCopy;
649
649
///
650
650
/// let mut v1 = ArrayVecCopy::from([1, 2, 3]);
651
651
/// let v2: ArrayVecCopy<_, 3> = v1.drain(0..2).collect();
@@ -726,7 +726,7 @@ impl<T: Copy, const CAP: usize> ArrayVecCopy<T, CAP> {
726
726
/// Returns the ArrayVecCopy, replacing the original with a new empty ArrayVecCopy.
727
727
///
728
728
/// ```
729
- /// use arrayvec::ArrayVecCopy;
729
+ /// use arrayvec::copy:: ArrayVecCopy;
730
730
///
731
731
/// let mut v = ArrayVecCopy::from([0, 1, 2, 3]);
732
732
/// assert_eq!([0, 1, 2, 3], v.take().into_inner().unwrap());
@@ -796,7 +796,7 @@ impl<T: Copy, const CAP: usize> DerefMut for ArrayVecCopy<T, CAP> {
796
796
/// Create an `ArrayVecCopy` from an array.
797
797
///
798
798
/// ```
799
- /// use arrayvec::ArrayVecCopy;
799
+ /// use arrayvec::copy:: ArrayVecCopy;
800
800
///
801
801
/// let mut array = ArrayVecCopy::from([1, 2, 3]);
802
802
/// assert_eq!(array.len(), 3);
@@ -821,7 +821,7 @@ impl<T: Copy, const CAP: usize> From<[T; CAP]> for ArrayVecCopy<T, CAP> {
821
821
/// fit.
822
822
///
823
823
/// ```
824
- /// use arrayvec::ArrayVecCopy;
824
+ /// use arrayvec::copy:: ArrayVecCopy;
825
825
/// use std::convert::TryInto as _;
826
826
///
827
827
/// let array: ArrayVecCopy<_, 4> = (&[1, 2, 3] as &[_]).try_into().unwrap();
@@ -848,7 +848,7 @@ impl<T: Copy, const CAP: usize> std::convert::TryFrom<&[T]> for ArrayVecCopy<T,
848
848
/// Iterate the `ArrayVecCopy` with references to each element.
849
849
///
850
850
/// ```
851
- /// use arrayvec::ArrayVecCopy;
851
+ /// use arrayvec::copy:: ArrayVecCopy;
852
852
///
853
853
/// let array = ArrayVecCopy::from([1, 2, 3]);
854
854
///
@@ -865,7 +865,7 @@ impl<'a, T: Copy + 'a, const CAP: usize> IntoIterator for &'a ArrayVecCopy<T, CA
865
865
/// Iterate the `ArrayVecCopy` with mutable references to each element.
866
866
///
867
867
/// ```
868
- /// use arrayvec::ArrayVecCopy;
868
+ /// use arrayvec::copy:: ArrayVecCopy;
869
869
///
870
870
/// let mut array = ArrayVecCopy::from([1, 2, 3]);
871
871
///
@@ -884,7 +884,7 @@ impl<'a, T: Copy + 'a, const CAP: usize> IntoIterator for &'a mut ArrayVecCopy<T
884
884
/// The vector is consumed by this operation.
885
885
///
886
886
/// ```
887
- /// use arrayvec::ArrayVecCopy;
887
+ /// use arrayvec::copy:: ArrayVecCopy;
888
888
///
889
889
/// for elt in ArrayVecCopy::from([1, 2, 3]) {
890
890
/// // ...
@@ -906,7 +906,7 @@ impl<T: Copy, const CAP: usize> IntoIterator for ArrayVecCopy<T, CAP> {
906
906
/// Cannot ensure that previous moves of the `ArrayVecCopy` did not leave values on the stack.
907
907
///
908
908
/// ```
909
- /// use arrayvec::ArrayVecCopy;
909
+ /// use arrayvec::copy:: ArrayVecCopy;
910
910
/// use zeroize::Zeroize;
911
911
/// let mut array = ArrayVecCopy::from([1, 2, 3]);
912
912
/// array.zeroize();
0 commit comments