From cd6d9eab5d75584edfcae4ffdef8b0836db80c1e Mon Sep 17 00:00:00 2001 From: Brian Anderson Date: Thu, 22 Jan 2015 18:22:03 -0800 Subject: Set unstable feature names appropriately * `core` - for the core crate * `hash` - hashing * `io` - io * `path` - path * `alloc` - alloc crate * `rand` - rand crate * `collections` - collections crate * `std_misc` - other parts of std * `test` - test crate * `rustc_private` - everything else --- src/libstd/collections/hash/map.rs | 30 +++++++++++++++--------------- src/libstd/collections/hash/set.rs | 6 +++--- src/libstd/collections/mod.rs | 2 +- 3 files changed, 19 insertions(+), 19 deletions(-) (limited to 'src/libstd/collections') diff --git a/src/libstd/collections/hash/map.rs b/src/libstd/collections/hash/map.rs index b9ddf54f2c8..0a0aaa9da87 100644 --- a/src/libstd/collections/hash/map.rs +++ b/src/libstd/collections/hash/map.rs @@ -539,7 +539,7 @@ impl HashMap /// map.insert(1i, 2u); /// ``` #[inline] - #[unstable(feature = "unnamed_feature", reason = "hasher stuff is unclear")] + #[unstable(feature = "std_misc", reason = "hasher stuff is unclear")] pub fn with_hash_state(hash_state: S) -> HashMap { HashMap { hash_state: hash_state, @@ -567,7 +567,7 @@ impl HashMap /// map.insert(1i, 2u); /// ``` #[inline] - #[unstable(feature = "unnamed_feature", reason = "hasher stuff is unclear")] + #[unstable(feature = "std_misc", reason = "hasher stuff is unclear")] pub fn with_capacity_and_hash_state(capacity: uint, hash_state: S) -> HashMap { let resize_policy = DefaultResizePolicy::new(); @@ -928,7 +928,7 @@ impl HashMap } /// Gets the given key's corresponding entry in the map for in-place manipulation. - #[unstable(feature = "unnamed_feature", + #[unstable(feature = "std_misc", reason = "precise API still being fleshed out")] pub fn entry<'a>(&'a mut self, key: K) -> Entry<'a, K, V> { @@ -990,7 +990,7 @@ impl HashMap /// assert!(a.is_empty()); /// ``` #[inline] - #[unstable(feature = "unnamed_feature", + #[unstable(feature = "std_misc", reason = "matches collection reform specification, waiting for dust to settle")] pub fn drain(&mut self) -> Drain { fn last_two((_, b, c): (A, B, C)) -> (B, C) { (b, c) } @@ -1339,7 +1339,7 @@ impl<'a, K, V> Clone for Values<'a, K, V> { } /// HashMap drain iterator -#[unstable(feature = "unnamed_feature", +#[unstable(feature = "std_misc", reason = "matches collection reform specification, waiting for dust to settle")] pub struct Drain<'a, K: 'a, V: 'a> { inner: iter::Map< @@ -1351,14 +1351,14 @@ pub struct Drain<'a, K: 'a, V: 'a> { } /// A view into a single occupied location in a HashMap -#[unstable(feature = "unnamed_feature", +#[unstable(feature = "std_misc", reason = "precise API still being fleshed out")] pub struct OccupiedEntry<'a, K: 'a, V: 'a> { elem: FullBucket>, } /// A view into a single empty location in a HashMap -#[unstable(feature = "unnamed_feature", +#[unstable(feature = "std_misc", reason = "precise API still being fleshed out")] pub struct VacantEntry<'a, K: 'a, V: 'a> { hash: SafeHash, @@ -1367,7 +1367,7 @@ pub struct VacantEntry<'a, K: 'a, V: 'a> { } /// A view into a single location in a map, which may be vacant or occupied -#[unstable(feature = "unnamed_feature", +#[unstable(feature = "std_misc", reason = "precise API still being fleshed out")] pub enum Entry<'a, K: 'a, V: 'a> { /// An occupied Entry @@ -1457,7 +1457,7 @@ impl<'a, K, V> ExactSizeIterator for Drain<'a, K, V> { #[inline] fn len(&self) -> usize { self.inner.len() } } -#[unstable(feature = "unnamed_feature", +#[unstable(feature = "std_misc", reason = "matches collection reform v2 specification, waiting for dust to settle")] impl<'a, K, V> Entry<'a, K, V> { /// Returns a mutable reference to the entry if occupied, or the VacantEntry if vacant @@ -1469,7 +1469,7 @@ impl<'a, K, V> Entry<'a, K, V> { } } -#[unstable(feature = "unnamed_feature", +#[unstable(feature = "std_misc", reason = "matches collection reform v2 specification, waiting for dust to settle")] impl<'a, K, V> OccupiedEntry<'a, K, V> { /// Gets a reference to the value in the entry @@ -1501,7 +1501,7 @@ impl<'a, K, V> OccupiedEntry<'a, K, V> { } } -#[unstable(feature = "unnamed_feature", +#[unstable(feature = "std_misc", reason = "matches collection reform v2 specification, waiting for dust to settle")] impl<'a, K: 'a, V: 'a> VacantEntry<'a, K, V> { /// Sets the value of the entry with the VacantEntry's key, @@ -1554,14 +1554,14 @@ impl Extend<(K, V)> for HashMap /// instances are unlikely to produce the same result for the same values. #[derive(Clone)] #[allow(missing_copy_implementations)] -#[unstable(feature = "unnamed_feature", +#[unstable(feature = "std_misc", reason = "hashing an hash maps may be altered")] pub struct RandomState { k0: u64, k1: u64, } -#[unstable(feature = "unnamed_feature", +#[unstable(feature = "std_misc", reason = "hashing an hash maps may be altered")] impl RandomState { /// Construct a new `RandomState` that is initialized with random keys. @@ -1572,7 +1572,7 @@ impl RandomState { } } -#[unstable(feature = "unnamed_feature", +#[unstable(feature = "std_misc", reason = "hashing an hash maps may be altered")] impl HashState for RandomState { type Hasher = Hasher; @@ -1581,7 +1581,7 @@ impl HashState for RandomState { } } -#[unstable(feature = "unnamed_feature", +#[unstable(feature = "std_misc", reason = "hashing an hash maps may be altered")] impl Default for RandomState { #[inline] diff --git a/src/libstd/collections/hash/set.rs b/src/libstd/collections/hash/set.rs index 18778c5ee27..98c67186a3c 100644 --- a/src/libstd/collections/hash/set.rs +++ b/src/libstd/collections/hash/set.rs @@ -147,7 +147,7 @@ impl HashSet /// set.insert(2u); /// ``` #[inline] - #[unstable(feature = "unnamed_feature", reason = "hasher stuff is unclear")] + #[unstable(feature = "std_misc", reason = "hasher stuff is unclear")] pub fn with_hash_state(hash_state: S) -> HashSet { HashSet::with_capacity_and_hash_state(INITIAL_CAPACITY, hash_state) } @@ -171,7 +171,7 @@ impl HashSet /// set.insert(1i); /// ``` #[inline] - #[unstable(feature = "unnamed_feature", reason = "hasher stuff is unclear")] + #[unstable(feature = "std_misc", reason = "hasher stuff is unclear")] pub fn with_capacity_and_hash_state(capacity: uint, hash_state: S) -> HashSet { HashSet { @@ -419,7 +419,7 @@ impl HashSet /// Clears the set, returning all elements in an iterator. #[inline] - #[unstable(feature = "unnamed_feature", + #[unstable(feature = "std_misc", reason = "matches collection reform specification, waiting for dust to settle")] pub fn drain(&mut self) -> Drain { fn first((a, _): (A, B)) -> A { a } diff --git a/src/libstd/collections/mod.rs b/src/libstd/collections/mod.rs index 4d2d1e8e91c..fae17af472c 100644 --- a/src/libstd/collections/mod.rs +++ b/src/libstd/collections/mod.rs @@ -337,7 +337,7 @@ pub mod hash_set { /// Experimental support for providing custom hash algorithms to a HashMap and /// HashSet. -#[unstable(feature = "unnamed_feature", reason = "module was recently added")] +#[unstable(feature = "std_misc", reason = "module was recently added")] pub mod hash_state { pub use super::hash::state::*; } -- cgit 1.4.1-3-g733a5