add tracking issue · rust-lang/rust@d51b71a (original) (raw)
`@@ -868,7 +868,7 @@ impl [T] {
`
868
868
```` /// ```
````
869
869
`///
`
870
870
`` /// [chunks_exact]: #method.chunks_exact
``
871
``
`-
#[unstable(feature = "array_chunks", issue = "none")]
`
``
871
`+
#[unstable(feature = "array_chunks", issue = "74985")]
`
872
872
`#[inline]
`
873
873
`pub fn array_chunks(&self) -> ArrayChunks<'_, T, N> {
`
874
874
`assert_ne!(N, 0);
`
`@@ -5484,7 +5484,7 @@ unsafe impl<'a, T> TrustedRandomAccess for ChunksExactMut<'a, T> {
`
5484
5484
`` /// [remainder]: ../../std/slice/struct.ArrayChunks.html#method.remainder
``
5485
5485
`/// [slices]: ../../std/primitive.slice.html
`
5486
5486
`#[derive(Debug)]
`
5487
``
`-
#[unstable(feature = "array_chunks", issue = "none")]
`
``
5487
`+
#[unstable(feature = "array_chunks", issue = "74985")]
`
5488
5488
`pub struct ArrayChunks<'a, T: 'a, const N: usize> {
`
5489
5489
`iter: Iter<'a, [T; N]>,
`
5490
5490
`rem: &'a [T],
`
`@@ -5494,21 +5494,21 @@ impl<'a, T, const N: usize> ArrayChunks<'a, T, N> {
`
5494
5494
`/// Returns the remainder of the original slice that is not going to be
`
5495
5495
`` /// returned by the iterator. The returned slice has at most chunk_size-1
``
5496
5496
`/// elements.
`
5497
``
`-
#[unstable(feature = "array_chunks", issue = "none")]
`
``
5497
`+
#[unstable(feature = "array_chunks", issue = "74985")]
`
5498
5498
`pub fn remainder(&self) -> &'a [T] {
`
5499
5499
`self.rem
`
5500
5500
`}
`
5501
5501
`}
`
5502
5502
``
5503
5503
`` // FIXME(#26925) Remove in favor of #[derive(Clone)]
``
5504
``
`-
#[unstable(feature = "array_chunks", issue = "none")]
`
``
5504
`+
#[unstable(feature = "array_chunks", issue = "74985")]
`
5505
5505
`impl<T, const N: usize> Clone for ArrayChunks<'_, T, N> {
`
5506
5506
`fn clone(&self) -> Self {
`
5507
5507
`ArrayChunks { iter: self.iter.clone(), rem: self.rem }
`
5508
5508
`}
`
5509
5509
`}
`
5510
5510
``
5511
``
`-
#[unstable(feature = "array_chunks", issue = "none")]
`
``
5511
`+
#[unstable(feature = "array_chunks", issue = "74985")]
`
5512
5512
`impl<'a, T, const N: usize> Iterator for ArrayChunks<'a, T, N> {
`
5513
5513
`type Item = &'a [T; N];
`
5514
5514
``
`@@ -5538,7 +5538,7 @@ impl<'a, T, const N: usize> Iterator for ArrayChunks<'a, T, N> {
`
5538
5538
`}
`
5539
5539
`}
`
5540
5540
``
5541
``
`-
#[unstable(feature = "array_chunks", issue = "none")]
`
``
5541
`+
#[unstable(feature = "array_chunks", issue = "74985")]
`
5542
5542
`impl<'a, T, const N: usize> DoubleEndedIterator for ArrayChunks<'a, T, N> {
`
5543
5543
`#[inline]
`
5544
5544
`fn next_back(&mut self) -> Option<&'a [T; N]> {
`
`@@ -5551,7 +5551,7 @@ impl<'a, T, const N: usize> DoubleEndedIterator for ArrayChunks<'a, T, N> {
`
5551
5551
`}
`
5552
5552
`}
`
5553
5553
``
5554
``
`-
#[unstable(feature = "array_chunks", issue = "none")]
`
``
5554
`+
#[unstable(feature = "array_chunks", issue = "74985")]
`
5555
5555
`impl<T, const N: usize> ExactSizeIterator for ArrayChunks<'_, T, N> {
`
5556
5556
`fn is_empty(&self) -> bool {
`
5557
5557
`self.iter.is_empty()
`
`@@ -5561,11 +5561,11 @@ impl<T, const N: usize> ExactSizeIterator for ArrayChunks<'_, T, N> {
`
5561
5561
`#[unstable(feature = "trusted_len", issue = "37572")]
`
5562
5562
`unsafe impl<T, const N: usize> TrustedLen for ArrayChunks<'_, T, N> {}
`
5563
5563
``
5564
``
`-
#[unstable(feature = "array_chunks", issue = "none")]
`
``
5564
`+
#[unstable(feature = "array_chunks", issue = "74985")]
`
5565
5565
`impl<T, const N: usize> FusedIterator for ArrayChunks<'_, T, N> {}
`
5566
5566
``
5567
5567
`#[doc(hidden)]
`
5568
``
`-
#[unstable(feature = "array_chunks", issue = "none")]
`
``
5568
`+
#[unstable(feature = "array_chunks", issue = "74985")]
`
5569
5569
`unsafe impl<'a, T, const N: usize> TrustedRandomAccess for ArrayChunks<'a, T, N> {
`
5570
5570
`unsafe fn get_unchecked(&mut self, i: usize) -> &'a [T; N] {
`
5571
5571
`unsafe { self.iter.get_unchecked(i) }
`