@@ -2004,7 +2004,7 @@ impl<K, V> BTreeMap<K, V> {
20042004 /// assert_eq!(keys, [1, 2]);
20052005 /// ```
20062006 #[ stable( feature = "rust1" , since = "1.0.0" ) ]
2007- pub fn keys < ' a > ( & ' a self ) -> Keys < ' a , K , V > {
2007+ pub fn keys ( & self ) -> Keys < ' _ , K , V > {
20082008 Keys { inner : self . iter ( ) }
20092009 }
20102010
@@ -2025,7 +2025,7 @@ impl<K, V> BTreeMap<K, V> {
20252025 /// assert_eq!(values, ["hello", "goodbye"]);
20262026 /// ```
20272027 #[ stable( feature = "rust1" , since = "1.0.0" ) ]
2028- pub fn values < ' a > ( & ' a self ) -> Values < ' a , K , V > {
2028+ pub fn values ( & self ) -> Values < ' _ , K , V > {
20292029 Values { inner : self . iter ( ) }
20302030 }
20312031
@@ -2529,8 +2529,8 @@ enum UnderflowResult<'a, K, V> {
25292529 Stole ( NodeRef < marker:: Mut < ' a > , K , V , marker:: Internal > ) ,
25302530}
25312531
2532- fn handle_underfull_node < ' a , K , V > ( node : NodeRef < marker:: Mut < ' a > , K , V , marker:: LeafOrInternal > )
2533- -> UnderflowResult < ' a , K , V > {
2532+ fn handle_underfull_node < K , V > ( node : NodeRef < marker:: Mut < ' _ > , K , V , marker:: LeafOrInternal > )
2533+ -> UnderflowResult < ' _ , K , V > {
25342534 let parent = if let Ok ( parent) = node. ascend ( ) {
25352535 parent
25362536 } else {
0 commit comments