@@ -115,7 +115,6 @@ impl<T> BTreeSet<T> {
115
115
/// # Examples
116
116
///
117
117
/// ```
118
- /// # #![feature(core)]
119
118
/// use std::collections::BTreeSet;
120
119
///
121
120
/// let set: BTreeSet<usize> = [1, 2, 3, 4].iter().cloned().collect();
@@ -124,7 +123,7 @@ impl<T> BTreeSet<T> {
124
123
/// println!("{}", x);
125
124
/// }
126
125
///
127
- /// let v: Vec<usize > = set.iter().cloned().collect();
126
+ /// let v: Vec<_ > = set.iter().cloned().collect();
128
127
/// assert_eq!(v, [1, 2, 3, 4]);
129
128
/// ```
130
129
#[ stable( feature = "rust1" , since = "1.0.0" ) ]
@@ -171,7 +170,6 @@ impl<T: Ord> BTreeSet<T> {
171
170
/// # Examples
172
171
///
173
172
/// ```
174
- /// # #![feature(core)]
175
173
/// use std::collections::BTreeSet;
176
174
///
177
175
/// let mut a = BTreeSet::new();
@@ -182,7 +180,7 @@ impl<T: Ord> BTreeSet<T> {
182
180
/// b.insert(2);
183
181
/// b.insert(3);
184
182
///
185
- /// let diff: Vec<usize > = a.difference(&b).cloned().collect();
183
+ /// let diff: Vec<_ > = a.difference(&b).cloned().collect();
186
184
/// assert_eq!(diff, [1]);
187
185
/// ```
188
186
#[ stable( feature = "rust1" , since = "1.0.0" ) ]
@@ -195,7 +193,6 @@ impl<T: Ord> BTreeSet<T> {
195
193
/// # Examples
196
194
///
197
195
/// ```
198
- /// # #![feature(core)]
199
196
/// use std::collections::BTreeSet;
200
197
///
201
198
/// let mut a = BTreeSet::new();
@@ -206,7 +203,7 @@ impl<T: Ord> BTreeSet<T> {
206
203
/// b.insert(2);
207
204
/// b.insert(3);
208
205
///
209
- /// let sym_diff: Vec<usize > = a.symmetric_difference(&b).cloned().collect();
206
+ /// let sym_diff: Vec<_ > = a.symmetric_difference(&b).cloned().collect();
210
207
/// assert_eq!(sym_diff, [1, 3]);
211
208
/// ```
212
209
#[ stable( feature = "rust1" , since = "1.0.0" ) ]
@@ -220,7 +217,6 @@ impl<T: Ord> BTreeSet<T> {
220
217
/// # Examples
221
218
///
222
219
/// ```
223
- /// # #![feature(core)]
224
220
/// use std::collections::BTreeSet;
225
221
///
226
222
/// let mut a = BTreeSet::new();
@@ -231,7 +227,7 @@ impl<T: Ord> BTreeSet<T> {
231
227
/// b.insert(2);
232
228
/// b.insert(3);
233
229
///
234
- /// let intersection: Vec<usize > = a.intersection(&b).cloned().collect();
230
+ /// let intersection: Vec<_ > = a.intersection(&b).cloned().collect();
235
231
/// assert_eq!(intersection, [2]);
236
232
/// ```
237
233
#[ stable( feature = "rust1" , since = "1.0.0" ) ]
@@ -245,7 +241,6 @@ impl<T: Ord> BTreeSet<T> {
245
241
/// # Examples
246
242
///
247
243
/// ```
248
- /// # #![feature(core)]
249
244
/// use std::collections::BTreeSet;
250
245
///
251
246
/// let mut a = BTreeSet::new();
@@ -254,7 +249,7 @@ impl<T: Ord> BTreeSet<T> {
254
249
/// let mut b = BTreeSet::new();
255
250
/// b.insert(2);
256
251
///
257
- /// let union: Vec<usize > = a.union(&b).cloned().collect();
252
+ /// let union: Vec<_ > = a.union(&b).cloned().collect();
258
253
/// assert_eq!(union, [1, 2]);
259
254
/// ```
260
255
#[ stable( feature = "rust1" , since = "1.0.0" ) ]
@@ -318,7 +313,6 @@ impl<T: Ord> BTreeSet<T> {
318
313
/// # Examples
319
314
///
320
315
/// ```
321
- /// # #![feature(core)]
322
316
/// use std::collections::BTreeSet;
323
317
///
324
318
/// let set: BTreeSet<_> = [1, 2, 3].iter().cloned().collect();
@@ -336,7 +330,6 @@ impl<T: Ord> BTreeSet<T> {
336
330
/// # Examples
337
331
///
338
332
/// ```
339
- /// # #![feature(core)]
340
333
/// use std::collections::BTreeSet;
341
334
///
342
335
/// let a: BTreeSet<_> = [1, 2, 3].iter().cloned().collect();
@@ -358,7 +351,6 @@ impl<T: Ord> BTreeSet<T> {
358
351
/// # Examples
359
352
///
360
353
/// ```
361
- /// # #![feature(core)]
362
354
/// use std::collections::BTreeSet;
363
355
///
364
356
/// let sup: BTreeSet<_> = [1, 2, 3].iter().cloned().collect();
@@ -401,7 +393,6 @@ impl<T: Ord> BTreeSet<T> {
401
393
/// # Examples
402
394
///
403
395
/// ```
404
- /// # #![feature(core)]
405
396
/// use std::collections::BTreeSet;
406
397
///
407
398
/// let sub: BTreeSet<_> = [1, 2].iter().cloned().collect();
@@ -483,12 +474,11 @@ impl<T> IntoIterator for BTreeSet<T> {
483
474
/// # Examples
484
475
///
485
476
/// ```
486
- /// # #![feature(core)]
487
477
/// use std::collections::BTreeSet;
488
478
///
489
479
/// let set: BTreeSet<usize> = [1, 2, 3, 4].iter().cloned().collect();
490
480
///
491
- /// let v: Vec<usize > = set.into_iter().collect();
481
+ /// let v: Vec<_ > = set.into_iter().collect();
492
482
/// assert_eq!(v, [1, 2, 3, 4]);
493
483
/// ```
494
484
fn into_iter ( self ) -> IntoIter < T > {
0 commit comments