From 93701b399b2d3cbb056c1eaaf1fba421585bb2bd Mon Sep 17 00:00:00 2001 From: Ulrik Sverdrup Date: Tue, 19 May 2015 03:33:17 +0200 Subject: [PATCH] collections: Clean up feature flags doc examples --- src/libcollections/btree/map.rs | 5 +---- src/libcollections/btree/set.rs | 22 ++++++---------------- src/libcollections/linked_list.rs | 5 ----- src/libcollections/slice.rs | 2 -- src/libcollections/vec_deque.rs | 6 ------ 5 files changed, 7 insertions(+), 33 deletions(-) diff --git a/src/libcollections/btree/map.rs b/src/libcollections/btree/map.rs index 291b66939e5ef..c5de4d3572c0c 100644 --- a/src/libcollections/btree/map.rs +++ b/src/libcollections/btree/map.rs @@ -1291,14 +1291,13 @@ impl BTreeMap { /// # Examples /// /// ``` - /// # #![feature(core)] /// use std::collections::BTreeMap; /// /// let mut a = BTreeMap::new(); /// a.insert(1, "a"); /// a.insert(2, "b"); /// - /// let keys: Vec = a.keys().cloned().collect(); + /// let keys: Vec<_> = a.keys().cloned().collect(); /// assert_eq!(keys, [1, 2]); /// ``` #[stable(feature = "rust1", since = "1.0.0")] @@ -1314,7 +1313,6 @@ impl BTreeMap { /// # Examples /// /// ``` - /// # #![feature(core)] /// use std::collections::BTreeMap; /// /// let mut a = BTreeMap::new(); @@ -1555,7 +1553,6 @@ impl BTreeMap { /// # Examples /// /// ``` - /// # #![feature(collections)] /// use std::collections::BTreeMap; /// /// let mut count: BTreeMap<&str, usize> = BTreeMap::new(); diff --git a/src/libcollections/btree/set.rs b/src/libcollections/btree/set.rs index fc346151e0b4b..e9878b96653e4 100644 --- a/src/libcollections/btree/set.rs +++ b/src/libcollections/btree/set.rs @@ -115,7 +115,6 @@ impl BTreeSet { /// # Examples /// /// ``` - /// # #![feature(core)] /// use std::collections::BTreeSet; /// /// let set: BTreeSet = [1, 2, 3, 4].iter().cloned().collect(); @@ -124,7 +123,7 @@ impl BTreeSet { /// println!("{}", x); /// } /// - /// let v: Vec = set.iter().cloned().collect(); + /// let v: Vec<_> = set.iter().cloned().collect(); /// assert_eq!(v, [1, 2, 3, 4]); /// ``` #[stable(feature = "rust1", since = "1.0.0")] @@ -171,7 +170,6 @@ impl BTreeSet { /// # Examples /// /// ``` - /// # #![feature(core)] /// use std::collections::BTreeSet; /// /// let mut a = BTreeSet::new(); @@ -182,7 +180,7 @@ impl BTreeSet { /// b.insert(2); /// b.insert(3); /// - /// let diff: Vec = a.difference(&b).cloned().collect(); + /// let diff: Vec<_> = a.difference(&b).cloned().collect(); /// assert_eq!(diff, [1]); /// ``` #[stable(feature = "rust1", since = "1.0.0")] @@ -195,7 +193,6 @@ impl BTreeSet { /// # Examples /// /// ``` - /// # #![feature(core)] /// use std::collections::BTreeSet; /// /// let mut a = BTreeSet::new(); @@ -206,7 +203,7 @@ impl BTreeSet { /// b.insert(2); /// b.insert(3); /// - /// let sym_diff: Vec = a.symmetric_difference(&b).cloned().collect(); + /// let sym_diff: Vec<_> = a.symmetric_difference(&b).cloned().collect(); /// assert_eq!(sym_diff, [1, 3]); /// ``` #[stable(feature = "rust1", since = "1.0.0")] @@ -220,7 +217,6 @@ impl BTreeSet { /// # Examples /// /// ``` - /// # #![feature(core)] /// use std::collections::BTreeSet; /// /// let mut a = BTreeSet::new(); @@ -231,7 +227,7 @@ impl BTreeSet { /// b.insert(2); /// b.insert(3); /// - /// let intersection: Vec = a.intersection(&b).cloned().collect(); + /// let intersection: Vec<_> = a.intersection(&b).cloned().collect(); /// assert_eq!(intersection, [2]); /// ``` #[stable(feature = "rust1", since = "1.0.0")] @@ -245,7 +241,6 @@ impl BTreeSet { /// # Examples /// /// ``` - /// # #![feature(core)] /// use std::collections::BTreeSet; /// /// let mut a = BTreeSet::new(); @@ -254,7 +249,7 @@ impl BTreeSet { /// let mut b = BTreeSet::new(); /// b.insert(2); /// - /// let union: Vec = a.union(&b).cloned().collect(); + /// let union: Vec<_> = a.union(&b).cloned().collect(); /// assert_eq!(union, [1, 2]); /// ``` #[stable(feature = "rust1", since = "1.0.0")] @@ -318,7 +313,6 @@ impl BTreeSet { /// # Examples /// /// ``` - /// # #![feature(core)] /// use std::collections::BTreeSet; /// /// let set: BTreeSet<_> = [1, 2, 3].iter().cloned().collect(); @@ -336,7 +330,6 @@ impl BTreeSet { /// # Examples /// /// ``` - /// # #![feature(core)] /// use std::collections::BTreeSet; /// /// let a: BTreeSet<_> = [1, 2, 3].iter().cloned().collect(); @@ -358,7 +351,6 @@ impl BTreeSet { /// # Examples /// /// ``` - /// # #![feature(core)] /// use std::collections::BTreeSet; /// /// let sup: BTreeSet<_> = [1, 2, 3].iter().cloned().collect(); @@ -401,7 +393,6 @@ impl BTreeSet { /// # Examples /// /// ``` - /// # #![feature(core)] /// use std::collections::BTreeSet; /// /// let sub: BTreeSet<_> = [1, 2].iter().cloned().collect(); @@ -483,12 +474,11 @@ impl IntoIterator for BTreeSet { /// # Examples /// /// ``` - /// # #![feature(core)] /// use std::collections::BTreeSet; /// /// let set: BTreeSet = [1, 2, 3, 4].iter().cloned().collect(); /// - /// let v: Vec = set.into_iter().collect(); + /// let v: Vec<_> = set.into_iter().collect(); /// assert_eq!(v, [1, 2, 3, 4]); /// ``` fn into_iter(self) -> IntoIter { diff --git a/src/libcollections/linked_list.rs b/src/libcollections/linked_list.rs index f6dc5cf7d90a0..669f05b33ca6c 100644 --- a/src/libcollections/linked_list.rs +++ b/src/libcollections/linked_list.rs @@ -230,7 +230,6 @@ impl LinkedList { /// # Examples /// /// ``` - /// # #![feature(collections)] /// use std::collections::LinkedList; /// /// let mut a = LinkedList::new(); @@ -473,7 +472,6 @@ impl LinkedList { /// # Examples /// /// ``` - /// # #![feature(collections)] /// use std::collections::LinkedList; /// /// let mut dl = LinkedList::new(); @@ -521,7 +519,6 @@ impl LinkedList { /// # Examples /// /// ``` - /// # #![feature(collections)] /// use std::collections::LinkedList; /// /// let mut d = LinkedList::new(); @@ -540,7 +537,6 @@ impl LinkedList { /// # Examples /// /// ``` - /// # #![feature(collections)] /// use std::collections::LinkedList; /// /// let mut d = LinkedList::new(); @@ -566,7 +562,6 @@ impl LinkedList { /// # Examples /// /// ``` - /// # #![feature(collections)] /// use std::collections::LinkedList; /// /// let mut d = LinkedList::new(); diff --git a/src/libcollections/slice.rs b/src/libcollections/slice.rs index d5a069b194a5d..c0da6331b2211 100644 --- a/src/libcollections/slice.rs +++ b/src/libcollections/slice.rs @@ -529,7 +529,6 @@ impl [T] { /// found; the fourth could match any position in `[1,4]`. /// /// ```rust - /// # #![feature(core)] /// let s = [0, 1, 1, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55]; /// /// let seek = 13; @@ -865,7 +864,6 @@ impl [T] { /// found; the fourth could match any position in `[1,4]`. /// /// ```rust - /// # #![feature(core)] /// let s = [0, 1, 1, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55]; /// /// assert_eq!(s.binary_search(&13), Ok(9)); diff --git a/src/libcollections/vec_deque.rs b/src/libcollections/vec_deque.rs index f70906f84b869..80bbe4681e728 100644 --- a/src/libcollections/vec_deque.rs +++ b/src/libcollections/vec_deque.rs @@ -247,7 +247,6 @@ impl VecDeque { /// # Examples /// /// ``` - /// # #![feature(collections)] /// use std::collections::VecDeque; /// /// let mut buf = VecDeque::new(); @@ -275,7 +274,6 @@ impl VecDeque { /// # Examples /// /// ``` - /// # #![feature(collections)] /// use std::collections::VecDeque; /// /// let buf: VecDeque = VecDeque::with_capacity(10); @@ -299,7 +297,6 @@ impl VecDeque { /// # Examples /// /// ``` - /// # #![feature(collections)] /// use std::collections::VecDeque; /// /// let mut buf: VecDeque = vec![1].into_iter().collect(); @@ -321,7 +318,6 @@ impl VecDeque { /// # Examples /// /// ``` - /// # #![feature(collections)] /// use std::collections::VecDeque; /// /// let mut buf: VecDeque = vec![1].into_iter().collect(); @@ -508,7 +504,6 @@ impl VecDeque { /// # Examples /// /// ``` - /// # #![feature(core)] /// use std::collections::VecDeque; /// /// let mut buf = VecDeque::new(); @@ -533,7 +528,6 @@ impl VecDeque { /// # Examples /// /// ``` - /// # #![feature(core)] /// use std::collections::VecDeque; /// /// let mut buf = VecDeque::new();