@@ -356,6 +356,7 @@ impl<K, V, S> HashMap<K, V, S> {
356
356
///
357
357
/// In the current implementation, iterating over keys takes O(capacity) time
358
358
/// instead of O(len) because it internally visits empty buckets too.
359
+ #[ rustc_lint_query_instability]
359
360
#[ stable( feature = "rust1" , since = "1.0.0" ) ]
360
361
pub fn keys ( & self ) -> Keys < ' _ , K , V > {
361
362
Keys { inner : self . iter ( ) }
@@ -417,6 +418,7 @@ impl<K, V, S> HashMap<K, V, S> {
417
418
///
418
419
/// In the current implementation, iterating over values takes O(capacity) time
419
420
/// instead of O(len) because it internally visits empty buckets too.
421
+ #[ rustc_lint_query_instability]
420
422
#[ stable( feature = "rust1" , since = "1.0.0" ) ]
421
423
pub fn values ( & self ) -> Values < ' _ , K , V > {
422
424
Values { inner : self . iter ( ) }
@@ -449,6 +451,7 @@ impl<K, V, S> HashMap<K, V, S> {
449
451
///
450
452
/// In the current implementation, iterating over values takes O(capacity) time
451
453
/// instead of O(len) because it internally visits empty buckets too.
454
+ #[ rustc_lint_query_instability]
452
455
#[ stable( feature = "map_values_mut" , since = "1.10.0" ) ]
453
456
pub fn values_mut ( & mut self ) -> ValuesMut < ' _ , K , V > {
454
457
ValuesMut { inner : self . iter_mut ( ) }
0 commit comments