1 //! Utilities for the array primitive type.
3 //! *[See also the array primitive type](array).*
5 #![stable(feature = "core_array", since = "1.36.0")]
7 use crate::borrow::{Borrow, BorrowMut};
8 use crate::cmp::Ordering;
9 use crate::convert::{Infallible, TryFrom};
10 #[cfg(not(bootstrap))]
11 use crate::error::Error;
13 use crate::hash::{self, Hash};
14 use crate::iter::TrustedLen;
15 use crate::mem::{self, MaybeUninit};
17 ChangeOutputType, ControlFlow, FromResidual, Index, IndexMut, NeverShortCircuit, Residual, Try,
19 use crate::slice::{Iter, IterMut};
24 #[stable(feature = "array_value_iter", since = "1.51.0")]
25 pub use iter::IntoIter;
27 /// Creates an array `[T; N]` where each array element `T` is returned by the `cb` call.
31 /// * `cb`: Callback where the passed argument is the current array index.
36 /// let array = core::array::from_fn(|i| i);
37 /// assert_eq!(array, [0, 1, 2, 3, 4]);
40 #[stable(feature = "array_from_fn", since = "1.63.0")]
41 pub fn from_fn<T, const N: usize, F>(mut cb: F) -> [T; N]
53 /// Creates an array `[T; N]` where each fallible array element `T` is returned by the `cb` call.
54 /// Unlike [`from_fn`], where the element creation can't fail, this version will return an error
55 /// if any element creation was unsuccessful.
57 /// The return type of this function depends on the return type of the closure.
58 /// If you return `Result<T, E>` from the closure, you'll get a `Result<[T; N]; E>`.
59 /// If you return `Option<T>` from the closure, you'll get an `Option<[T; N]>`.
63 /// * `cb`: Callback where the passed argument is the current array index.
68 /// #![feature(array_try_from_fn)]
70 /// let array: Result<[u8; 5], _> = std::array::try_from_fn(|i| i.try_into());
71 /// assert_eq!(array, Ok([0, 1, 2, 3, 4]));
73 /// let array: Result<[i8; 200], _> = std::array::try_from_fn(|i| i.try_into());
74 /// assert!(array.is_err());
76 /// let array: Option<[_; 4]> = std::array::try_from_fn(|i| i.checked_add(100));
77 /// assert_eq!(array, Some([100, 101, 102, 103]));
79 /// let array: Option<[_; 4]> = std::array::try_from_fn(|i| i.checked_sub(100));
80 /// assert_eq!(array, None);
83 #[unstable(feature = "array_try_from_fn", issue = "89379")]
84 pub fn try_from_fn<R, const N: usize, F>(cb: F) -> ChangeOutputType<R, [R::Output; N]>
88 R::Residual: Residual<[R::Output; N]>,
90 // SAFETY: we know for certain that this iterator will yield exactly `N`
92 unsafe { try_collect_into_array_unchecked(&mut (0..N).map(cb)) }
95 /// Converts a reference to `T` into a reference to an array of length 1 (without copying).
96 #[stable(feature = "array_from_ref", since = "1.53.0")]
97 #[rustc_const_stable(feature = "const_array_from_ref_shared", since = "1.63.0")]
98 pub const fn from_ref<T>(s: &T) -> &[T; 1] {
99 // SAFETY: Converting `&T` to `&[T; 1]` is sound.
100 unsafe { &*(s as *const T).cast::<[T; 1]>() }
103 /// Converts a mutable reference to `T` into a mutable reference to an array of length 1 (without copying).
104 #[stable(feature = "array_from_ref", since = "1.53.0")]
105 #[rustc_const_unstable(feature = "const_array_from_ref", issue = "90206")]
106 pub const fn from_mut<T>(s: &mut T) -> &mut [T; 1] {
107 // SAFETY: Converting `&mut T` to `&mut [T; 1]` is sound.
108 unsafe { &mut *(s as *mut T).cast::<[T; 1]>() }
111 /// The error type returned when a conversion from a slice to an array fails.
112 #[stable(feature = "try_from", since = "1.34.0")]
113 #[derive(Debug, Copy, Clone)]
114 pub struct TryFromSliceError(());
116 #[stable(feature = "core_array", since = "1.36.0")]
117 impl fmt::Display for TryFromSliceError {
119 fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
120 fmt::Display::fmt(self.__description(), f)
124 #[cfg(not(bootstrap))]
125 #[stable(feature = "try_from", since = "1.34.0")]
126 impl Error for TryFromSliceError {
128 fn description(&self) -> &str {
133 impl TryFromSliceError {
135 feature = "array_error_internals",
136 reason = "available through Error trait and this method should not \
137 be exposed publicly",
142 pub fn __description(&self) -> &str {
143 "could not convert slice to array"
147 #[stable(feature = "try_from_slice_error", since = "1.36.0")]
148 #[rustc_const_unstable(feature = "const_convert", issue = "88674")]
149 impl const From<Infallible> for TryFromSliceError {
150 fn from(x: Infallible) -> TryFromSliceError {
155 #[stable(feature = "rust1", since = "1.0.0")]
156 impl<T, const N: usize> AsRef<[T]> for [T; N] {
158 fn as_ref(&self) -> &[T] {
163 #[stable(feature = "rust1", since = "1.0.0")]
164 impl<T, const N: usize> AsMut<[T]> for [T; N] {
166 fn as_mut(&mut self) -> &mut [T] {
171 #[stable(feature = "array_borrow", since = "1.4.0")]
172 #[rustc_const_unstable(feature = "const_borrow", issue = "91522")]
173 impl<T, const N: usize> const Borrow<[T]> for [T; N] {
174 fn borrow(&self) -> &[T] {
179 #[stable(feature = "array_borrow", since = "1.4.0")]
180 #[rustc_const_unstable(feature = "const_borrow", issue = "91522")]
181 impl<T, const N: usize> const BorrowMut<[T]> for [T; N] {
182 fn borrow_mut(&mut self) -> &mut [T] {
187 /// Tries to create an array `[T; N]` by copying from a slice `&[T]`. Succeeds if
188 /// `slice.len() == N`.
191 /// let bytes: [u8; 3] = [1, 0, 2];
193 /// let bytes_head: [u8; 2] = <[u8; 2]>::try_from(&bytes[0..2]).unwrap();
194 /// assert_eq!(1, u16::from_le_bytes(bytes_head));
196 /// let bytes_tail: [u8; 2] = bytes[1..3].try_into().unwrap();
197 /// assert_eq!(512, u16::from_le_bytes(bytes_tail));
199 #[stable(feature = "try_from", since = "1.34.0")]
200 impl<T, const N: usize> TryFrom<&[T]> for [T; N]
204 type Error = TryFromSliceError;
206 fn try_from(slice: &[T]) -> Result<[T; N], TryFromSliceError> {
207 <&Self>::try_from(slice).map(|r| *r)
211 /// Tries to create an array `[T; N]` by copying from a mutable slice `&mut [T]`.
212 /// Succeeds if `slice.len() == N`.
215 /// let mut bytes: [u8; 3] = [1, 0, 2];
217 /// let bytes_head: [u8; 2] = <[u8; 2]>::try_from(&mut bytes[0..2]).unwrap();
218 /// assert_eq!(1, u16::from_le_bytes(bytes_head));
220 /// let bytes_tail: [u8; 2] = (&mut bytes[1..3]).try_into().unwrap();
221 /// assert_eq!(512, u16::from_le_bytes(bytes_tail));
223 #[stable(feature = "try_from_mut_slice_to_array", since = "1.59.0")]
224 impl<T, const N: usize> TryFrom<&mut [T]> for [T; N]
228 type Error = TryFromSliceError;
230 fn try_from(slice: &mut [T]) -> Result<[T; N], TryFromSliceError> {
231 <Self>::try_from(&*slice)
235 /// Tries to create an array ref `&[T; N]` from a slice ref `&[T]`. Succeeds if
236 /// `slice.len() == N`.
239 /// let bytes: [u8; 3] = [1, 0, 2];
241 /// let bytes_head: &[u8; 2] = <&[u8; 2]>::try_from(&bytes[0..2]).unwrap();
242 /// assert_eq!(1, u16::from_le_bytes(*bytes_head));
244 /// let bytes_tail: &[u8; 2] = bytes[1..3].try_into().unwrap();
245 /// assert_eq!(512, u16::from_le_bytes(*bytes_tail));
247 #[stable(feature = "try_from", since = "1.34.0")]
248 impl<'a, T, const N: usize> TryFrom<&'a [T]> for &'a [T; N] {
249 type Error = TryFromSliceError;
251 fn try_from(slice: &[T]) -> Result<&[T; N], TryFromSliceError> {
252 if slice.len() == N {
253 let ptr = slice.as_ptr() as *const [T; N];
254 // SAFETY: ok because we just checked that the length fits
257 Err(TryFromSliceError(()))
262 /// Tries to create a mutable array ref `&mut [T; N]` from a mutable slice ref
263 /// `&mut [T]`. Succeeds if `slice.len() == N`.
266 /// let mut bytes: [u8; 3] = [1, 0, 2];
268 /// let bytes_head: &mut [u8; 2] = <&mut [u8; 2]>::try_from(&mut bytes[0..2]).unwrap();
269 /// assert_eq!(1, u16::from_le_bytes(*bytes_head));
271 /// let bytes_tail: &mut [u8; 2] = (&mut bytes[1..3]).try_into().unwrap();
272 /// assert_eq!(512, u16::from_le_bytes(*bytes_tail));
274 #[stable(feature = "try_from", since = "1.34.0")]
275 impl<'a, T, const N: usize> TryFrom<&'a mut [T]> for &'a mut [T; N] {
276 type Error = TryFromSliceError;
278 fn try_from(slice: &mut [T]) -> Result<&mut [T; N], TryFromSliceError> {
279 if slice.len() == N {
280 let ptr = slice.as_mut_ptr() as *mut [T; N];
281 // SAFETY: ok because we just checked that the length fits
282 unsafe { Ok(&mut *ptr) }
284 Err(TryFromSliceError(()))
289 /// The hash of an array is the same as that of the corresponding slice,
290 /// as required by the `Borrow` implementation.
293 /// #![feature(build_hasher_simple_hash_one)]
294 /// use std::hash::BuildHasher;
296 /// let b = std::collections::hash_map::RandomState::new();
297 /// let a: [u8; 3] = [0xa8, 0x3c, 0x09];
298 /// let s: &[u8] = &[0xa8, 0x3c, 0x09];
299 /// assert_eq!(b.hash_one(a), b.hash_one(s));
301 #[stable(feature = "rust1", since = "1.0.0")]
302 impl<T: Hash, const N: usize> Hash for [T; N] {
303 fn hash<H: hash::Hasher>(&self, state: &mut H) {
304 Hash::hash(&self[..], state)
308 #[stable(feature = "rust1", since = "1.0.0")]
309 impl<T: fmt::Debug, const N: usize> fmt::Debug for [T; N] {
310 fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
311 fmt::Debug::fmt(&&self[..], f)
315 #[stable(feature = "rust1", since = "1.0.0")]
316 impl<'a, T, const N: usize> IntoIterator for &'a [T; N] {
318 type IntoIter = Iter<'a, T>;
320 fn into_iter(self) -> Iter<'a, T> {
325 #[stable(feature = "rust1", since = "1.0.0")]
326 impl<'a, T, const N: usize> IntoIterator for &'a mut [T; N] {
327 type Item = &'a mut T;
328 type IntoIter = IterMut<'a, T>;
330 fn into_iter(self) -> IterMut<'a, T> {
335 #[stable(feature = "index_trait_on_arrays", since = "1.50.0")]
336 #[rustc_const_unstable(feature = "const_slice_index", issue = "none")]
337 impl<T, I, const N: usize> const Index<I> for [T; N]
339 [T]: ~const Index<I>,
341 type Output = <[T] as Index<I>>::Output;
344 fn index(&self, index: I) -> &Self::Output {
345 Index::index(self as &[T], index)
349 #[stable(feature = "index_trait_on_arrays", since = "1.50.0")]
350 #[rustc_const_unstable(feature = "const_slice_index", issue = "none")]
351 impl<T, I, const N: usize> const IndexMut<I> for [T; N]
353 [T]: ~const IndexMut<I>,
356 fn index_mut(&mut self, index: I) -> &mut Self::Output {
357 IndexMut::index_mut(self as &mut [T], index)
361 #[stable(feature = "rust1", since = "1.0.0")]
362 impl<T: PartialOrd, const N: usize> PartialOrd for [T; N] {
364 fn partial_cmp(&self, other: &[T; N]) -> Option<Ordering> {
365 PartialOrd::partial_cmp(&&self[..], &&other[..])
368 fn lt(&self, other: &[T; N]) -> bool {
369 PartialOrd::lt(&&self[..], &&other[..])
372 fn le(&self, other: &[T; N]) -> bool {
373 PartialOrd::le(&&self[..], &&other[..])
376 fn ge(&self, other: &[T; N]) -> bool {
377 PartialOrd::ge(&&self[..], &&other[..])
380 fn gt(&self, other: &[T; N]) -> bool {
381 PartialOrd::gt(&&self[..], &&other[..])
385 /// Implements comparison of arrays [lexicographically](Ord#lexicographical-comparison).
386 #[stable(feature = "rust1", since = "1.0.0")]
387 impl<T: Ord, const N: usize> Ord for [T; N] {
389 fn cmp(&self, other: &[T; N]) -> Ordering {
390 Ord::cmp(&&self[..], &&other[..])
394 #[stable(feature = "copy_clone_array_lib", since = "1.58.0")]
395 impl<T: Copy, const N: usize> Copy for [T; N] {}
397 #[stable(feature = "copy_clone_array_lib", since = "1.58.0")]
398 impl<T: Clone, const N: usize> Clone for [T; N] {
400 fn clone(&self) -> Self {
401 SpecArrayClone::clone(self)
405 fn clone_from(&mut self, other: &Self) {
406 self.clone_from_slice(other);
410 trait SpecArrayClone: Clone {
411 fn clone<const N: usize>(array: &[Self; N]) -> [Self; N];
414 impl<T: Clone> SpecArrayClone for T {
416 default fn clone<const N: usize>(array: &[T; N]) -> [T; N] {
417 // SAFETY: we know for certain that this iterator will yield exactly `N`
419 unsafe { collect_into_array_unchecked(&mut array.iter().cloned()) }
423 impl<T: Copy> SpecArrayClone for T {
425 fn clone<const N: usize>(array: &[T; N]) -> [T; N] {
430 // The Default impls cannot be done with const generics because `[T; 0]` doesn't
431 // require Default to be implemented, and having different impl blocks for
432 // different numbers isn't supported yet.
434 macro_rules! array_impl_default {
435 {$n:expr, $t:ident $($ts:ident)*} => {
436 #[stable(since = "1.4.0", feature = "array_default")]
437 impl<T> Default for [T; $n] where T: Default {
438 fn default() -> [T; $n] {
439 [$t::default(), $($ts::default()),*]
442 array_impl_default!{($n - 1), $($ts)*}
445 #[stable(since = "1.4.0", feature = "array_default")]
446 #[rustc_const_unstable(feature = "const_default_impls", issue = "87864")]
447 impl<T> const Default for [T; $n] {
448 fn default() -> [T; $n] { [] }
453 array_impl_default! {32, T T T T T T T T T T T T T T T T T T T T T T T T T T T T T T T T}
455 impl<T, const N: usize> [T; N] {
456 /// Returns an array of the same size as `self`, with function `f` applied to each element
459 /// If you don't necessarily need a new fixed-size array, consider using
460 /// [`Iterator::map`] instead.
463 /// # Note on performance and stack usage
465 /// Unfortunately, usages of this method are currently not always optimized
466 /// as well as they could be. This mainly concerns large arrays, as mapping
467 /// over small arrays seem to be optimized just fine. Also note that in
468 /// debug mode (i.e. without any optimizations), this method can use a lot
469 /// of stack space (a few times the size of the array or more).
471 /// Therefore, in performance-critical code, try to avoid using this method
472 /// on large arrays or check the emitted code. Also try to avoid chained
473 /// maps (e.g. `arr.map(...).map(...)`).
475 /// In many cases, you can instead use [`Iterator::map`] by calling `.iter()`
476 /// or `.into_iter()` on your array. `[T; N]::map` is only necessary if you
477 /// really need a new array of the same size as the result. Rust's lazy
478 /// iterators tend to get optimized very well.
484 /// let x = [1, 2, 3];
485 /// let y = x.map(|v| v + 1);
486 /// assert_eq!(y, [2, 3, 4]);
488 /// let x = [1, 2, 3];
489 /// let mut temp = 0;
490 /// let y = x.map(|v| { temp += 1; v * temp });
491 /// assert_eq!(y, [1, 4, 9]);
493 /// let x = ["Ferris", "Bueller's", "Day", "Off"];
494 /// let y = x.map(|v| v.len());
495 /// assert_eq!(y, [6, 9, 3, 3]);
497 #[stable(feature = "array_map", since = "1.55.0")]
498 pub fn map<F, U>(self, f: F) -> [U; N]
502 // SAFETY: we know for certain that this iterator will yield exactly `N`
504 unsafe { collect_into_array_unchecked(&mut IntoIterator::into_iter(self).map(f)) }
507 /// A fallible function `f` applied to each element on array `self` in order to
508 /// return an array the same size as `self` or the first error encountered.
510 /// The return type of this function depends on the return type of the closure.
511 /// If you return `Result<T, E>` from the closure, you'll get a `Result<[T; N]; E>`.
512 /// If you return `Option<T>` from the closure, you'll get an `Option<[T; N]>`.
517 /// #![feature(array_try_map)]
518 /// let a = ["1", "2", "3"];
519 /// let b = a.try_map(|v| v.parse::<u32>()).unwrap().map(|v| v + 1);
520 /// assert_eq!(b, [2, 3, 4]);
522 /// let a = ["1", "2a", "3"];
523 /// let b = a.try_map(|v| v.parse::<u32>());
524 /// assert!(b.is_err());
526 /// use std::num::NonZeroU32;
527 /// let z = [1, 2, 0, 3, 4];
528 /// assert_eq!(z.try_map(NonZeroU32::new), None);
529 /// let a = [1, 2, 3];
530 /// let b = a.try_map(NonZeroU32::new);
531 /// let c = b.map(|x| x.map(NonZeroU32::get));
532 /// assert_eq!(c, Some(a));
534 #[unstable(feature = "array_try_map", issue = "79711")]
535 pub fn try_map<F, R>(self, f: F) -> ChangeOutputType<R, [R::Output; N]>
539 R::Residual: Residual<[R::Output; N]>,
541 // SAFETY: we know for certain that this iterator will yield exactly `N`
543 unsafe { try_collect_into_array_unchecked(&mut IntoIterator::into_iter(self).map(f)) }
546 /// 'Zips up' two arrays into a single array of pairs.
548 /// `zip()` returns a new array where every element is a tuple where the
549 /// first element comes from the first array, and the second element comes
550 /// from the second array. In other words, it zips two arrays together,
551 /// into a single one.
556 /// #![feature(array_zip)]
557 /// let x = [1, 2, 3];
558 /// let y = [4, 5, 6];
559 /// let z = x.zip(y);
560 /// assert_eq!(z, [(1, 4), (2, 5), (3, 6)]);
562 #[unstable(feature = "array_zip", issue = "80094")]
563 pub fn zip<U>(self, rhs: [U; N]) -> [(T, U); N] {
564 let mut iter = IntoIterator::into_iter(self).zip(rhs);
566 // SAFETY: we know for certain that this iterator will yield exactly `N`
568 unsafe { collect_into_array_unchecked(&mut iter) }
571 /// Returns a slice containing the entire array. Equivalent to `&s[..]`.
572 #[stable(feature = "array_as_slice", since = "1.57.0")]
573 #[rustc_const_stable(feature = "array_as_slice", since = "1.57.0")]
574 pub const fn as_slice(&self) -> &[T] {
578 /// Returns a mutable slice containing the entire array. Equivalent to
580 #[stable(feature = "array_as_slice", since = "1.57.0")]
581 pub fn as_mut_slice(&mut self) -> &mut [T] {
585 /// Borrows each element and returns an array of references with the same
592 /// #![feature(array_methods)]
594 /// let floats = [3.1, 2.7, -1.0];
595 /// let float_refs: [&f64; 3] = floats.each_ref();
596 /// assert_eq!(float_refs, [&3.1, &2.7, &-1.0]);
599 /// This method is particularly useful if combined with other methods, like
600 /// [`map`](#method.map). This way, you can avoid moving the original
601 /// array if its elements are not [`Copy`].
604 /// #![feature(array_methods)]
606 /// let strings = ["Ferris".to_string(), "♥".to_string(), "Rust".to_string()];
607 /// let is_ascii = strings.each_ref().map(|s| s.is_ascii());
608 /// assert_eq!(is_ascii, [true, false, true]);
610 /// // We can still access the original array: it has not been moved.
611 /// assert_eq!(strings.len(), 3);
613 #[unstable(feature = "array_methods", issue = "76118")]
614 pub fn each_ref(&self) -> [&T; N] {
615 // SAFETY: we know for certain that this iterator will yield exactly `N`
617 unsafe { collect_into_array_unchecked(&mut self.iter()) }
620 /// Borrows each element mutably and returns an array of mutable references
621 /// with the same size as `self`.
627 /// #![feature(array_methods)]
629 /// let mut floats = [3.1, 2.7, -1.0];
630 /// let float_refs: [&mut f64; 3] = floats.each_mut();
631 /// *float_refs[0] = 0.0;
632 /// assert_eq!(float_refs, [&mut 0.0, &mut 2.7, &mut -1.0]);
633 /// assert_eq!(floats, [0.0, 2.7, -1.0]);
635 #[unstable(feature = "array_methods", issue = "76118")]
636 pub fn each_mut(&mut self) -> [&mut T; N] {
637 // SAFETY: we know for certain that this iterator will yield exactly `N`
639 unsafe { collect_into_array_unchecked(&mut self.iter_mut()) }
642 /// Divides one array reference into two at an index.
644 /// The first will contain all indices from `[0, M)` (excluding
645 /// the index `M` itself) and the second will contain all
646 /// indices from `[M, N)` (excluding the index `N` itself).
650 /// Panics if `M > N`.
655 /// #![feature(split_array)]
657 /// let v = [1, 2, 3, 4, 5, 6];
660 /// let (left, right) = v.split_array_ref::<0>();
661 /// assert_eq!(left, &[]);
662 /// assert_eq!(right, &[1, 2, 3, 4, 5, 6]);
666 /// let (left, right) = v.split_array_ref::<2>();
667 /// assert_eq!(left, &[1, 2]);
668 /// assert_eq!(right, &[3, 4, 5, 6]);
672 /// let (left, right) = v.split_array_ref::<6>();
673 /// assert_eq!(left, &[1, 2, 3, 4, 5, 6]);
674 /// assert_eq!(right, &[]);
678 feature = "split_array",
679 reason = "return type should have array as 2nd element",
683 pub fn split_array_ref<const M: usize>(&self) -> (&[T; M], &[T]) {
684 (&self[..]).split_array_ref::<M>()
687 /// Divides one mutable array reference into two at an index.
689 /// The first will contain all indices from `[0, M)` (excluding
690 /// the index `M` itself) and the second will contain all
691 /// indices from `[M, N)` (excluding the index `N` itself).
695 /// Panics if `M > N`.
700 /// #![feature(split_array)]
702 /// let mut v = [1, 0, 3, 0, 5, 6];
703 /// let (left, right) = v.split_array_mut::<2>();
704 /// assert_eq!(left, &mut [1, 0][..]);
705 /// assert_eq!(right, &mut [3, 0, 5, 6]);
708 /// assert_eq!(v, [1, 2, 3, 4, 5, 6]);
711 feature = "split_array",
712 reason = "return type should have array as 2nd element",
716 pub fn split_array_mut<const M: usize>(&mut self) -> (&mut [T; M], &mut [T]) {
717 (&mut self[..]).split_array_mut::<M>()
720 /// Divides one array reference into two at an index from the end.
722 /// The first will contain all indices from `[0, N - M)` (excluding
723 /// the index `N - M` itself) and the second will contain all
724 /// indices from `[N - M, N)` (excluding the index `N` itself).
728 /// Panics if `M > N`.
733 /// #![feature(split_array)]
735 /// let v = [1, 2, 3, 4, 5, 6];
738 /// let (left, right) = v.rsplit_array_ref::<0>();
739 /// assert_eq!(left, &[1, 2, 3, 4, 5, 6]);
740 /// assert_eq!(right, &[]);
744 /// let (left, right) = v.rsplit_array_ref::<2>();
745 /// assert_eq!(left, &[1, 2, 3, 4]);
746 /// assert_eq!(right, &[5, 6]);
750 /// let (left, right) = v.rsplit_array_ref::<6>();
751 /// assert_eq!(left, &[]);
752 /// assert_eq!(right, &[1, 2, 3, 4, 5, 6]);
756 feature = "split_array",
757 reason = "return type should have array as 2nd element",
761 pub fn rsplit_array_ref<const M: usize>(&self) -> (&[T], &[T; M]) {
762 (&self[..]).rsplit_array_ref::<M>()
765 /// Divides one mutable array reference into two at an index from the end.
767 /// The first will contain all indices from `[0, N - M)` (excluding
768 /// the index `N - M` itself) and the second will contain all
769 /// indices from `[N - M, N)` (excluding the index `N` itself).
773 /// Panics if `M > N`.
778 /// #![feature(split_array)]
780 /// let mut v = [1, 0, 3, 0, 5, 6];
781 /// let (left, right) = v.rsplit_array_mut::<4>();
782 /// assert_eq!(left, &mut [1, 0]);
783 /// assert_eq!(right, &mut [3, 0, 5, 6][..]);
786 /// assert_eq!(v, [1, 2, 3, 4, 5, 6]);
789 feature = "split_array",
790 reason = "return type should have array as 2nd element",
794 pub fn rsplit_array_mut<const M: usize>(&mut self) -> (&mut [T], &mut [T; M]) {
795 (&mut self[..]).rsplit_array_mut::<M>()
799 /// Pulls `N` items from `iter` and returns them as an array. If the iterator
800 /// yields fewer than `N` items, this function exhibits undefined behavior.
802 /// See [`try_collect_into_array`] for more information.
807 /// It is up to the caller to guarantee that `iter` yields at least `N` items.
808 /// Violating this condition causes undefined behavior.
809 unsafe fn try_collect_into_array_unchecked<I, T, R, const N: usize>(iter: &mut I) -> R::TryType
811 // Note: `TrustedLen` here is somewhat of an experiment. This is just an
812 // internal function, so feel free to remove if this bound turns out to be a
813 // bad idea. In that case, remember to also remove the lower bound
814 // `debug_assert!` below!
815 I: Iterator + TrustedLen,
816 I::Item: Try<Output = T, Residual = R>,
819 debug_assert!(N <= iter.size_hint().1.unwrap_or(usize::MAX));
820 debug_assert!(N <= iter.size_hint().0);
822 // SAFETY: covered by the function contract.
823 unsafe { try_collect_into_array(iter).unwrap_unchecked() }
826 // Infallible version of `try_collect_into_array_unchecked`.
827 unsafe fn collect_into_array_unchecked<I, const N: usize>(iter: &mut I) -> [I::Item; N]
829 I: Iterator + TrustedLen,
831 let mut map = iter.map(NeverShortCircuit);
833 // SAFETY: The same safety considerations w.r.t. the iterator length
834 // apply for `try_collect_into_array_unchecked` as for
835 // `collect_into_array_unchecked`
836 match unsafe { try_collect_into_array_unchecked(&mut map) } {
837 NeverShortCircuit(array) => array,
841 /// Pulls `N` items from `iter` and returns them as an array. If the iterator
842 /// yields fewer than `N` items, `Err` is returned containing an iterator over
843 /// the already yielded items.
845 /// Since the iterator is passed as a mutable reference and this function calls
846 /// `next` at most `N` times, the iterator can still be used afterwards to
847 /// retrieve the remaining items.
849 /// If `iter.next()` panicks, all items already yielded by the iterator are
852 fn try_collect_into_array<I, T, R, const N: usize>(
854 ) -> Result<R::TryType, IntoIter<T, N>>
857 I::Item: Try<Output = T, Residual = R>,
861 // SAFETY: An empty array is always inhabited and has no validity invariants.
862 return Ok(Try::from_output(unsafe { mem::zeroed() }));
865 struct Guard<'a, T, const N: usize> {
866 array_mut: &'a mut [MaybeUninit<T>; N],
870 impl<T, const N: usize> Drop for Guard<'_, T, N> {
872 debug_assert!(self.initialized <= N);
874 // SAFETY: this slice will contain only initialized objects.
876 crate::ptr::drop_in_place(MaybeUninit::slice_assume_init_mut(
877 &mut self.array_mut.get_unchecked_mut(..self.initialized),
883 let mut array = MaybeUninit::uninit_array::<N>();
884 let mut guard = Guard { array_mut: &mut array, initialized: 0 };
889 let item = match item_rslt.branch() {
890 ControlFlow::Break(r) => {
891 return Ok(FromResidual::from_residual(r));
893 ControlFlow::Continue(elem) => elem,
896 // SAFETY: `guard.initialized` starts at 0, is increased by one in the
897 // loop and the loop is aborted once it reaches N (which is
900 guard.array_mut.get_unchecked_mut(guard.initialized).write(item);
902 guard.initialized += 1;
905 let alive = 0..guard.initialized;
907 // SAFETY: `array` was initialized with exactly `initialized`
908 // number of elements.
909 return Err(unsafe { IntoIter::new_unchecked(array, alive) });
915 // SAFETY: All elements of the array were populated in the loop above.
916 let output = unsafe { MaybeUninit::array_assume_init(array) };
917 Ok(Try::from_output(output))
920 /// Returns the next chunk of `N` items from the iterator or errors with an
921 /// iterator over the remainder. Used for `Iterator::next_chunk`.
923 pub(crate) fn iter_next_chunk<I, const N: usize>(
925 ) -> Result<[I::Item; N], IntoIter<I::Item, N>>
929 let mut map = iter.map(NeverShortCircuit);
930 try_collect_into_array(&mut map).map(|NeverShortCircuit(arr)| arr)