File tree 3 files changed +1
-6
lines changed
3 files changed +1
-6
lines changed Original file line number Diff line number Diff line change 112
112
#![ feature( maybe_uninit_extra, maybe_uninit_slice, maybe_uninit_array) ]
113
113
#![ feature( alloc_layout_extra) ]
114
114
#![ feature( try_trait) ]
115
- #![ feature( iter_nth_back) ]
116
115
117
116
// Allow testing this library
118
117
Original file line number Diff line number Diff line change @@ -88,15 +88,13 @@ pub trait DoubleEndedIterator: Iterator {
88
88
/// Basic usage:
89
89
///
90
90
/// ```
91
- /// #![feature(iter_nth_back)]
92
91
/// let a = [1, 2, 3];
93
92
/// assert_eq!(a.iter().nth_back(2), Some(&1));
94
93
/// ```
95
94
///
96
95
/// Calling `nth_back()` multiple times doesn't rewind the iterator:
97
96
///
98
97
/// ```
99
- /// #![feature(iter_nth_back)]
100
98
/// let a = [1, 2, 3];
101
99
///
102
100
/// let mut iter = a.iter();
@@ -108,12 +106,11 @@ pub trait DoubleEndedIterator: Iterator {
108
106
/// Returning `None` if there are less than `n + 1` elements:
109
107
///
110
108
/// ```
111
- /// #![feature(iter_nth_back)]
112
109
/// let a = [1, 2, 3];
113
110
/// assert_eq!(a.iter().nth_back(10), None);
114
111
/// ```
115
112
#[ inline]
116
- #[ unstable ( feature = "iter_nth_back" , issue = "56995 " ) ]
113
+ #[ stable ( feature = "iter_nth_back" , since = "1.37.0 " ) ]
117
114
fn nth_back ( & mut self , mut n : usize ) -> Option < Self :: Item > {
118
115
for x in self . rev ( ) {
119
116
if n == 0 { return Some ( x) }
Original file line number Diff line number Diff line change 10
10
#![ feature( fmt_internals) ]
11
11
#![ feature( hashmap_internals) ]
12
12
#![ feature( is_sorted) ]
13
- #![ feature( iter_nth_back) ]
14
13
#![ feature( iter_once_with) ]
15
14
#![ feature( pattern) ]
16
15
#![ feature( range_is_empty) ]
You can’t perform that action at this time.
0 commit comments