@@ -32,14 +32,14 @@ pub mod btree_set {
32
32
pub use super :: btree:: set:: * ;
33
33
}
34
34
35
- #[ stable ( feature = "rust1 " , since = "1.0. 0" ) ]
35
+ #[ unstable ( feature = "alloc_hashmap " , reason = "HashMap in liballoc is unstable" , issue= " 0") ]
36
36
pub mod hash_map {
37
37
//! A hash map implemented with linear probing and Robin Hood bucket stealing.
38
38
#[ stable( feature = "rust1" , since = "1.0.0" ) ]
39
39
pub use super :: hash:: map:: * ;
40
40
}
41
41
42
- #[ stable ( feature = "rust1 " , since = "1.0. 0" ) ]
42
+ #[ unstable ( feature = "alloc_hashmap " , reason = "HashMap in liballoc is unstable" , issue= " 0") ]
43
43
pub mod hash_set {
44
44
//! A hash set implemented as a `HashMap` where the value is `()`.
45
45
#[ stable( feature = "rust1" , since = "1.0.0" ) ]
@@ -58,11 +58,11 @@ pub use self::btree_map::BTreeMap;
58
58
#[ doc( no_inline) ]
59
59
pub use self :: btree_set:: BTreeSet ;
60
60
61
- #[ stable ( feature = "rust1 " , since = "1.0. 0" ) ]
61
+ #[ unstable ( feature = "alloc_hashmap " , reason = "HashMap in liballoc is unstable" , issue= " 0") ]
62
62
#[ doc( no_inline) ]
63
63
pub use self :: hash_map:: HashMap ;
64
64
65
- #[ stable ( feature = "rust1 " , since = "1.0. 0" ) ]
65
+ #[ unstable ( feature = "alloc_hashmap " , reason = "HashMap in liballoc is unstable" , issue= " 0") ]
66
66
#[ doc( no_inline) ]
67
67
pub use self :: hash_set:: HashSet ;
68
68
0 commit comments