@@ -553,7 +553,8 @@ impl<K, V, S> HashMap<K, V, S>
553
553
/// map.insert(1, 2);
554
554
/// ```
555
555
#[ inline]
556
- #[ unstable( feature = "hashmap_hasher" , reason = "hasher stuff is unclear" ) ]
556
+ #[ unstable( feature = "hashmap_hasher" , reason = "hasher stuff is unclear" ,
557
+ issue = "27713" ) ]
557
558
pub fn with_hash_state ( hash_state : S ) -> HashMap < K , V , S > {
558
559
HashMap {
559
560
hash_state : hash_state,
@@ -583,7 +584,8 @@ impl<K, V, S> HashMap<K, V, S>
583
584
/// map.insert(1, 2);
584
585
/// ```
585
586
#[ inline]
586
- #[ unstable( feature = "hashmap_hasher" , reason = "hasher stuff is unclear" ) ]
587
+ #[ unstable( feature = "hashmap_hasher" , reason = "hasher stuff is unclear" ,
588
+ issue = "27713" ) ]
587
589
pub fn with_capacity_and_hash_state ( capacity : usize , hash_state : S )
588
590
-> HashMap < K , V , S > {
589
591
let resize_policy = DefaultResizePolicy :: new ( ) ;
@@ -998,7 +1000,8 @@ impl<K, V, S> HashMap<K, V, S>
998
1000
/// ```
999
1001
#[ inline]
1000
1002
#[ unstable( feature = "drain" ,
1001
- reason = "matches collection reform specification, waiting for dust to settle" ) ]
1003
+ reason = "matches collection reform specification, waiting for dust to settle" ,
1004
+ issue = "27711" ) ]
1002
1005
pub fn drain ( & mut self ) -> Drain < K , V > {
1003
1006
fn last_two < A , B , C > ( ( _, b, c) : ( A , B , C ) ) -> ( B , C ) { ( b, c) }
1004
1007
let last_two: fn ( ( SafeHash , K , V ) ) -> ( K , V ) = last_two; // coerce to fn pointer
@@ -1311,7 +1314,8 @@ impl<'a, K, V> Clone for Values<'a, K, V> {
1311
1314
1312
1315
/// HashMap drain iterator.
1313
1316
#[ unstable( feature = "drain" ,
1314
- reason = "matches collection reform specification, waiting for dust to settle" ) ]
1317
+ reason = "matches collection reform specification, waiting for dust to settle" ,
1318
+ issue = "27711" ) ]
1315
1319
pub struct Drain < ' a , K : ' a , V : ' a > {
1316
1320
inner : iter:: Map < table:: Drain < ' a , K , V > , fn ( ( SafeHash , K , V ) ) -> ( K , V ) >
1317
1321
}
@@ -1587,14 +1591,16 @@ impl<K, V, S> Extend<(K, V)> for HashMap<K, V, S>
1587
1591
/// instances are unlikely to produce the same result for the same values.
1588
1592
#[ derive( Clone ) ]
1589
1593
#[ unstable( feature = "hashmap_hasher" ,
1590
- reason = "hashing an hash maps may be altered" ) ]
1594
+ reason = "hashing an hash maps may be altered" ,
1595
+ issue = "27713" ) ]
1591
1596
pub struct RandomState {
1592
1597
k0 : u64 ,
1593
1598
k1 : u64 ,
1594
1599
}
1595
1600
1596
1601
#[ unstable( feature = "hashmap_hasher" ,
1597
- reason = "hashing an hash maps may be altered" ) ]
1602
+ reason = "hashing an hash maps may be altered" ,
1603
+ issue = "27713" ) ]
1598
1604
impl RandomState {
1599
1605
/// Constructs a new `RandomState` that is initialized with random keys.
1600
1606
#[ inline]
@@ -1606,7 +1612,8 @@ impl RandomState {
1606
1612
}
1607
1613
1608
1614
#[ unstable( feature = "hashmap_hasher" ,
1609
- reason = "hashing an hash maps may be altered" ) ]
1615
+ reason = "hashing an hash maps may be altered" ,
1616
+ issue = "27713" ) ]
1610
1617
impl HashState for RandomState {
1611
1618
type Hasher = SipHasher ;
1612
1619
#[ inline]
0 commit comments