@@ -110,9 +110,9 @@ impl<'a, K: 'a, V: 'a> Iterator for Range<'a, K, V> {
110110
111111 fn next ( & mut self ) -> Option < Self :: Item > {
112112 match self . 0 {
113- RangeInner :: Borrowed { ref slice, ref mut begin, ref end } => {
113+ RangeInner :: Borrowed { slice, ref mut begin, ref end } => {
114114 * begin += 1 ;
115- if * begin- 1 >= * end {
115+ if * begin > * end {
116116 None
117117 } else {
118118 match slice[ * begin-1 ] {
@@ -130,7 +130,7 @@ impl<'a, K: 'a, V: 'a> Iterator for Range<'a, K, V> {
130130impl < ' a , K : ' a , V : ' a > DoubleEndedIterator for Range < ' a , K , V > {
131131 fn next_back ( & mut self ) -> Option < Self :: Item > {
132132 match self . 0 {
133- RangeInner :: Borrowed { ref slice, ref begin, ref mut end } => {
133+ RangeInner :: Borrowed { slice, ref begin, ref mut end } => {
134134 if * begin >= * end {
135135 None
136136 } else {
@@ -150,7 +150,7 @@ impl<'a, K: 'a, V: 'a> DoubleEndedIterator for Range<'a, K, V> {
150150fn binary_search_by_key_range < ' a , K , V , Q : ' a , R > ( slice : & [ Option < ( K , V ) > ] , range : R ) -> Result < ( usize , usize ) , ( ) >
151151 where K : Ord + Borrow < Q > , Q : Ord + ?Sized , R : RangeBounds < Q >
152152{
153- if slice. len ( ) == 0 {
153+ if slice. is_empty ( ) {
154154 return Err ( ( ) )
155155 }
156156 let ( mut left, mut right) = ( 0 , slice. len ( ) - 1 ) ;
@@ -316,7 +316,7 @@ impl<'a, K: Ord + 'a, V: 'a> ManagedMap<'a, K, V> {
316316
317317 pub fn insert ( & mut self , key : K , new_value : V ) -> Result < Option < V > , ( K , V ) > {
318318 match self {
319- & mut ManagedMap :: Borrowed ( ref mut pairs) if pairs. len ( ) < 1 =>
319+ & mut ManagedMap :: Borrowed ( ref mut pairs) if pairs. is_empty ( ) =>
320320 Err ( ( key, new_value) ) , // no space at all
321321 & mut ManagedMap :: Borrowed ( ref mut pairs) => {
322322 match binary_search_by_key ( pairs, & key) {
@@ -421,7 +421,7 @@ impl<'a, K: Ord + 'a, V: 'a> Iterator for Iter<'a, K, V> {
421421 match self {
422422 & mut Iter :: Borrowed ( ref mut iter) =>
423423 match iter. next ( ) {
424- Some ( & Some ( ( ref k, ref v) ) ) => Some ( ( & k, & v) ) ,
424+ Some ( & Some ( ( ref k, ref v) ) ) => Some ( ( k, v) ) ,
425425 Some ( & None ) => None ,
426426 None => None ,
427427 } ,
@@ -461,7 +461,7 @@ impl<'a, K: Ord + 'a, V: 'a> Iterator for IterMut<'a, K, V> {
461461 match self {
462462 & mut IterMut :: Borrowed ( ref mut iter) =>
463463 match iter. next ( ) {
464- Some ( & mut Some ( ( ref k, ref mut v) ) ) => Some ( ( & k, v) ) ,
464+ Some ( & mut Some ( ( ref k, ref mut v) ) ) => Some ( ( k, v) ) ,
465465 Some ( & mut None ) => None ,
466466 None => None ,
467467 } ,
@@ -988,7 +988,7 @@ mod test {
988988 {
989989 let mut iter = map. iter_mut ( ) ;
990990 assert_eq ! ( iter. size_hint( ) , ( 0 , Some ( 4 ) ) ) ;
991- for ( _k, mut v) in & mut iter {
991+ for ( _k, v) in & mut iter {
992992 * v += 1 ;
993993 }
994994 assert_eq ! ( iter. size_hint( ) , ( 0 , Some ( 0 ) ) ) ;
0 commit comments