@@ -2032,7 +2032,7 @@ impl<K, V> BTreeMap<K, V> {
20322032 /// assert_eq!(keys, [1, 2]);
20332033 /// ```
20342034 #[stable(feature = "rust1", since = "1.0.0")]
2035- pub fn keys<'a>(&'a self) -> Keys<'a , K, V> {
2035+ pub fn keys(& self) -> Keys<'_ , K, V> {
20362036 Keys { inner: self.iter() }
20372037 }
20382038
@@ -2053,7 +2053,7 @@ impl<K, V> BTreeMap<K, V> {
20532053 /// assert_eq!(values, ["hello", "goodbye"]);
20542054 /// ```
20552055 #[stable(feature = "rust1", since = "1.0.0")]
2056- pub fn values<'a>(&'a self) -> Values<'a , K, V> {
2056+ pub fn values(& self) -> Values<'_ , K, V> {
20572057 Values { inner: self.iter() }
20582058 }
20592059
@@ -2557,8 +2557,8 @@ enum UnderflowResult<'a, K, V> {
25572557 Stole(NodeRef<marker::Mut<'a>, K, V, marker::Internal>),
25582558}
25592559
2560- fn handle_underfull_node<'a, K, V>(node: NodeRef<marker::Mut<'a >, K, V, marker::LeafOrInternal>)
2561- -> UnderflowResult<'a , K, V> {
2560+ fn handle_underfull_node<K, V>(node: NodeRef<marker::Mut<'_ >, K, V, marker::LeafOrInternal>)
2561+ -> UnderflowResult<'_ , K, V> {
25622562 let parent = if let Ok(parent) = node.ascend() {
25632563 parent
25642564 } else {
0 commit comments