From d15d55973946f8f582ba69b1789b5b5d35da5b2d Mon Sep 17 00:00:00 2001 From: Alex Crichton Date: Fri, 29 Aug 2014 14:33:08 -0700 Subject: Register new snapshots --- src/libcore/slice.rs | 59 ---------------------------------------------------- 1 file changed, 59 deletions(-) (limited to 'src/libcore/slice.rs') diff --git a/src/libcore/slice.rs b/src/libcore/slice.rs index 5a70cd8c847..5070a3973d1 100644 --- a/src/libcore/slice.rs +++ b/src/libcore/slice.rs @@ -1125,7 +1125,6 @@ impl<'a, T> ExactSize<&'a mut T> for MutItems<'a, T> {} /// An iterator over the slices of a vector separated by elements that /// match a predicate function. -#[cfg(not(stage0))] #[experimental = "needs review"] pub struct Splits<'a, T:'a> { v: &'a [T], @@ -1133,14 +1132,6 @@ pub struct Splits<'a, T:'a> { finished: bool } -/// Dox. -#[cfg(stage0)] -pub struct Splits<'a, T> { - v: &'a [T], - pred: |t: &T|: 'a -> bool, - finished: bool -} - #[experimental = "needs review"] impl<'a, T> Iterator<&'a [T]> for Splits<'a, T> { #[inline] @@ -1192,7 +1183,6 @@ impl<'a, T> DoubleEndedIterator<&'a [T]> for Splits<'a, T> { /// An iterator over the subslices of the vector which are separated /// by elements that match `pred`. -#[cfg(not(stage0))] #[experimental = "needs review"] pub struct MutSplits<'a, T:'a> { v: &'a mut [T], @@ -1200,14 +1190,6 @@ pub struct MutSplits<'a, T:'a> { finished: bool } -/// Dox -#[cfg(stage0)] -pub struct MutSplits<'a, T> { - v: &'a mut [T], - pred: |t: &T|: 'a -> bool, - finished: bool -} - #[experimental = "needs review"] impl<'a, T> Iterator<&'a mut [T]> for MutSplits<'a, T> { #[inline] @@ -1270,7 +1252,6 @@ impl<'a, T> DoubleEndedIterator<&'a mut [T]> for MutSplits<'a, T> { /// An iterator over the slices of a vector separated by elements that /// match a predicate function, splitting at most a fixed number of times. -#[cfg(not(stage0))] #[experimental = "needs review"] pub struct SplitsN<'a, T:'a> { iter: Splits<'a, T>, @@ -1278,14 +1259,6 @@ pub struct SplitsN<'a, T:'a> { invert: bool } -/// Dox. -#[cfg(stage0)] -pub struct SplitsN<'a, T> { - iter: Splits<'a, T>, - count: uint, - invert: bool -} - #[experimental = "needs review"] impl<'a, T> Iterator<&'a [T]> for SplitsN<'a, T> { #[inline] @@ -1315,17 +1288,6 @@ impl<'a, T> Iterator<&'a [T]> for SplitsN<'a, T> { /// An iterator over the (overlapping) slices of length `size` within /// a vector. -#[cfg(stage0)] -#[deriving(Clone)] -#[experimental = "needs review"] -pub struct Windows<'a, T> { - v: &'a [T], - size: uint -} - -/// An iterator over the (overlapping) slices of length `size` within -/// a vector. -#[cfg(not(stage0))] #[deriving(Clone)] #[experimental = "needs review"] pub struct Windows<'a, T:'a> { @@ -1361,21 +1323,8 @@ impl<'a, T> Iterator<&'a [T]> for Windows<'a, T> { /// /// When the vector len is not evenly divided by the chunk size, /// the last slice of the iteration will be the remainder. -#[cfg(stage0)] #[deriving(Clone)] #[experimental = "needs review"] -pub struct Chunks<'a, T> { - v: &'a [T], - size: uint -} - -/// An iterator over a vector in (non-overlapping) chunks (`size` -/// elements at a time). -/// -/// When the vector len is not evenly divided by the chunk size, -/// the last slice of the iteration will be the remainder. -#[cfg(not(stage0))] -#[deriving(Clone)] pub struct Chunks<'a, T:'a> { v: &'a [T], size: uint @@ -1447,20 +1396,12 @@ impl<'a, T> RandomAccessIterator<&'a [T]> for Chunks<'a, T> { /// An iterator over a vector in (non-overlapping) mutable chunks (`size` elements at a time). When /// the vector len is not evenly divided by the chunk size, the last slice of the iteration will be /// the remainder. -#[cfg(not(stage0))] #[experimental = "needs review"] pub struct MutChunks<'a, T:'a> { v: &'a mut [T], chunk_size: uint } -/// Dox. -#[cfg(stage0)] -pub struct MutChunks<'a, T> { - v: &'a mut [T], - chunk_size: uint -} - #[experimental = "needs review"] impl<'a, T> Iterator<&'a mut [T]> for MutChunks<'a, T> { #[inline] -- cgit 1.4.1-3-g733a5