@@ -1083,26 +1083,30 @@ impl<T, I: SplitIter + Iterator<Item=T>> Iterator for GenericSplitN<I> {
1083
1083
1084
1084
/// An iterator over subslices separated by elements that match a predicate
1085
1085
/// function, limited to a given number of splits.
1086
+ #[ stable]
1086
1087
pub struct SplitN < ' a , T : ' a , P > where P : FnMut ( & T ) -> bool {
1087
1088
inner : GenericSplitN < Split < ' a , T , P > >
1088
1089
}
1089
1090
1090
1091
/// An iterator over subslices separated by elements that match a
1091
1092
/// predicate function, limited to a given number of splits, starting
1092
1093
/// from the end of the slice.
1094
+ #[ stable]
1093
1095
pub struct RSplitN < ' a , T : ' a , P > where P : FnMut ( & T ) -> bool {
1094
1096
inner : GenericSplitN < Split < ' a , T , P > >
1095
1097
}
1096
1098
1097
1099
/// An iterator over subslices separated by elements that match a predicate
1098
1100
/// function, limited to a given number of splits.
1101
+ #[ stable]
1099
1102
pub struct SplitNMut < ' a , T : ' a , P > where P : FnMut ( & T ) -> bool {
1100
1103
inner : GenericSplitN < SplitMut < ' a , T , P > >
1101
1104
}
1102
1105
1103
1106
/// An iterator over subslices separated by elements that match a
1104
1107
/// predicate function, limited to a given number of splits, starting
1105
1108
/// from the end of the slice.
1109
+ #[ stable]
1106
1110
pub struct RSplitNMut < ' a , T : ' a , P > where P : FnMut ( & T ) -> bool {
1107
1111
inner : GenericSplitN < SplitMut < ' a , T , P > >
1108
1112
}
@@ -1134,7 +1138,7 @@ forward_iterator! { RSplitNMut: T, &'a mut [T] }
1134
1138
1135
1139
/// An iterator over overlapping subslices of length `size`.
1136
1140
#[ derive( Clone ) ]
1137
- #[ experimental = "needs review" ]
1141
+ #[ stable ]
1138
1142
pub struct Windows < ' a , T : ' a > {
1139
1143
v : & ' a [ T ] ,
1140
1144
size : uint
@@ -1171,7 +1175,7 @@ impl<'a, T> Iterator for Windows<'a, T> {
1171
1175
/// When the slice len is not evenly divided by the chunk size, the last slice
1172
1176
/// of the iteration will be the remainder.
1173
1177
#[ derive( Clone ) ]
1174
- #[ experimental = "needs review" ]
1178
+ #[ stable ]
1175
1179
pub struct Chunks < ' a , T : ' a > {
1176
1180
v : & ' a [ T ] ,
1177
1181
size : uint
@@ -1246,7 +1250,7 @@ impl<'a, T> RandomAccessIterator for Chunks<'a, T> {
1246
1250
/// An iterator over a slice in (non-overlapping) mutable chunks (`size`
1247
1251
/// elements at a time). When the slice len is not evenly divided by the chunk
1248
1252
/// size, the last slice of the iteration will be the remainder.
1249
- #[ experimental = "needs review" ]
1253
+ #[ stable ]
1250
1254
pub struct ChunksMut < ' a , T : ' a > {
1251
1255
v : & ' a mut [ T ] ,
1252
1256
chunk_size : uint
@@ -1360,7 +1364,7 @@ pub unsafe fn from_raw_buf<'a, T>(p: &'a *const T, len: uint) -> &'a [T] {
1360
1364
/// not being able to provide a non-aliasing guarantee of the returned mutable
1361
1365
/// slice.
1362
1366
#[ inline]
1363
- #[ unstable = "jshould be renamed to from_raw_parts_mut" ]
1367
+ #[ unstable = "should be renamed to from_raw_parts_mut" ]
1364
1368
pub unsafe fn from_raw_mut_buf < ' a , T > ( p : & ' a * mut T , len : uint ) -> & ' a mut [ T ] {
1365
1369
transmute ( RawSlice { data : * p as * const T , len : len } )
1366
1370
}
0 commit comments