@@ -126,13 +126,13 @@ impl<K: Ord, V> SortedMap<K, V> {
126
126
/// Iterate over the keys, sorted
127
127
#[ inline]
128
128
pub fn keys ( & self ) -> impl Iterator < Item = & K > + ExactSizeIterator + DoubleEndedIterator {
129
- self . data . iter ( ) . map ( |& ( ref k, _) | k)
129
+ self . data . iter ( ) . map ( |( k, _) | k)
130
130
}
131
131
132
132
/// Iterate over values, sorted by key
133
133
#[ inline]
134
134
pub fn values ( & self ) -> impl Iterator < Item = & V > + ExactSizeIterator + DoubleEndedIterator {
135
- self . data . iter ( ) . map ( |& ( _, ref v) | v)
135
+ self . data . iter ( ) . map ( |( _, v) | v)
136
136
}
137
137
138
138
#[ inline]
@@ -222,7 +222,7 @@ impl<K: Ord, V> SortedMap<K, V> {
222
222
K : Borrow < Q > ,
223
223
Q : Ord + ?Sized ,
224
224
{
225
- self . data . binary_search_by ( |& ( ref x, _) | x. borrow ( ) . cmp ( key) )
225
+ self . data . binary_search_by ( |( x, _) | x. borrow ( ) . cmp ( key) )
226
226
}
227
227
228
228
#[ inline]
@@ -300,7 +300,7 @@ impl<K: Ord, V> FromIterator<(K, V)> for SortedMap<K, V> {
300
300
fn from_iter < T : IntoIterator < Item = ( K , V ) > > ( iter : T ) -> Self {
301
301
let mut data: Vec < ( K , V ) > = iter. into_iter ( ) . collect ( ) ;
302
302
303
- data. sort_unstable_by ( |& ( ref k1, _) , & ( ref k2, _) | k1. cmp ( k2) ) ;
303
+ data. sort_unstable_by ( |( k1, _) , ( k2, _) | k1. cmp ( k2) ) ;
304
304
data. dedup_by ( |& mut ( ref k1, _) , & mut ( ref k2, _) | k1. cmp ( k2) == Ordering :: Equal ) ;
305
305
306
306
SortedMap { data }
0 commit comments