@@ -1383,7 +1383,7 @@ mod wasm_test_btree {
13831383 }
13841384
13851385 for i in 1 ..root. keys . len ( ) {
1386- if & root. keys [ i - 1 ] >= & root. keys [ i] {
1386+ if root. keys [ i - 1 ] >= root. keys [ i] {
13871387 return Err ( InvariantViolation :: NodeKeysOutOfOrder ) ;
13881388 }
13891389 }
@@ -1440,7 +1440,7 @@ mod wasm_test_btree {
14401440 K : Serialize + fmt:: Debug + Ord ,
14411441 {
14421442 let Some ( root_node_id) = self . root else {
1443- return format ! ( "no root" ) ;
1443+ return "no root" . to_string ( ) ;
14441444 } ;
14451445 let mut string = String :: new ( ) ;
14461446 let root: Node < M , K > = self . get_node ( root_node_id) ;
@@ -1475,7 +1475,7 @@ mod wasm_test_btree {
14751475 K : Ord ,
14761476 {
14771477 for i in 1 ..self . keys . len ( ) {
1478- if & self . keys [ i - 1 ] >= & self . keys [ i] {
1478+ if self . keys [ i - 1 ] >= self . keys [ i] {
14791479 return Err ( InvariantViolation :: NodeKeysOutOfOrder ) ;
14801480 }
14811481 }
@@ -1667,7 +1667,7 @@ mod wasm_test_btree {
16671667 for n in 0 ..500 {
16681668 claim ! ( tree. insert( n) ) ;
16691669 }
1670- for n in ( 500 ..1000 ) . into_iter ( ) . rev ( ) {
1670+ for n in ( 500 ..1000 ) . rev ( ) {
16711671 claim ! ( tree. insert( n) ) ;
16721672 }
16731673
@@ -1729,7 +1729,7 @@ mod wasm_test_btree {
17291729 fn test_btree_remove_only_key_higher_leaf_in_three_node ( ) {
17301730 let mut state_builder = StateBuilder :: open ( StateApi :: open ( ) ) ;
17311731 let mut tree = state_builder. new_btree_set_degree :: < 2 , _ > ( ) ;
1732- for n in ( 0 ..4 ) . into_iter ( ) . rev ( ) {
1732+ for n in ( 0 ..4 ) . rev ( ) {
17331733 tree. insert ( n) ;
17341734 }
17351735 tree. remove ( & 3 ) ;
@@ -1752,7 +1752,7 @@ mod wasm_test_btree {
17521752 fn test_btree_remove_from_higher_leaf_in_three_node_taking_from_sibling ( ) {
17531753 let mut state_builder = StateBuilder :: open ( StateApi :: open ( ) ) ;
17541754 let mut tree = state_builder. new_btree_set_degree :: < 2 , _ > ( ) ;
1755- for n in ( 0 ..4 ) . into_iter ( ) . rev ( ) {
1755+ for n in ( 0 ..4 ) . rev ( ) {
17561756 tree. insert ( n) ;
17571757 }
17581758 claim ! ( tree. contains( & 3 ) ) ;
@@ -1830,7 +1830,7 @@ mod wasm_test_btree {
18301830 fn test_btree_remove_from_root_in_three_node_taking_key_from_lower_child ( ) {
18311831 let mut state_builder = StateBuilder :: open ( StateApi :: open ( ) ) ;
18321832 let mut tree = state_builder. new_btree_set_degree :: < 2 , _ > ( ) ;
1833- for n in ( 0 ..4 ) . into_iter ( ) . rev ( ) {
1833+ for n in ( 0 ..4 ) . rev ( ) {
18341834 tree. insert ( n) ;
18351835 }
18361836 claim ! ( tree. contains( & 2 ) ) ;
@@ -1843,11 +1843,11 @@ mod wasm_test_btree {
18431843 fn test_btree_iter ( ) {
18441844 let mut state_builder = StateBuilder :: open ( StateApi :: open ( ) ) ;
18451845 let mut tree = state_builder. new_btree_set_degree :: < 2 , _ > ( ) ;
1846- let keys: Vec < u32 > = ( 0 ..15 ) . into_iter ( ) . collect ( ) ;
1846+ let keys: Vec < u32 > = ( 0 ..15 ) . collect ( ) ;
18471847 for & k in & keys {
18481848 tree. insert ( k) ;
18491849 }
1850- let iter_keys: Vec < u32 > = tree. iter ( ) . map ( |k| k . clone ( ) ) . collect ( ) ;
1850+ let iter_keys: Vec < u32 > = tree. iter ( ) . map ( |k| * k ) . collect ( ) ;
18511851 claim_eq ! ( keys, iter_keys) ;
18521852 }
18531853
@@ -2064,6 +2064,7 @@ mod wasm_test_btree {
20642064 }
20652065
20662066 /// The different mutating operations to generate for the btree.
2067+ #[ allow( clippy:: enum_variant_names) ]
20672068 #[ derive( Debug , Clone , Copy ) ]
20682069 enum Operation {
20692070 /// Insert a new key in the set.
@@ -2083,7 +2084,7 @@ mod wasm_test_btree {
20832084 tree : & mut StateBTreeSet < u32 , M > ,
20842085 mutations : & [ ( u32 , Operation ) ] ,
20852086 ) -> Result < ( ) , String > {
2086- for ( k, op) in mutations. into_iter ( ) {
2087+ for ( k, op) in mutations. iter ( ) {
20872088 if let Err ( violation) = tree. check_invariants ( ) {
20882089 return Err ( format ! ( "Invariant violated: {:?}" , violation) ) ;
20892090 }
@@ -2115,14 +2116,13 @@ mod wasm_test_btree {
21152116
21162117 impl Arbitrary for Operation {
21172118 fn arbitrary ( g : & mut Gen ) -> Self {
2118- g. choose ( & [
2119+ * g. choose ( & [
21192120 Self :: InsertKeyNotPresent ,
21202121 Self :: InsertKeyPresent ,
21212122 Self :: RemoveKeyPresent ,
21222123 Self :: RemoveKeyNotPresent ,
21232124 ] )
21242125 . unwrap ( )
2125- . clone ( )
21262126 }
21272127 }
21282128
@@ -2141,9 +2141,8 @@ mod wasm_test_btree {
21412141 while mutations. len ( ) < g. size ( ) {
21422142 let op: Operation = Operation :: arbitrary ( g) ;
21432143 match op {
2144- Operation :: InsertKeyPresent if inserted_keys. len ( ) > 0 => {
2145- let indexes: Vec < usize > =
2146- ( 0 ..inserted_keys. len ( ) ) . into_iter ( ) . collect ( ) ;
2144+ Operation :: InsertKeyPresent if !inserted_keys. is_empty ( ) => {
2145+ let indexes: Vec < usize > = ( 0 ..inserted_keys. len ( ) ) . collect ( ) ;
21472146 let k_index = g. choose ( & indexes) . unwrap ( ) ;
21482147 let k = & inserted_keys[ * k_index] ;
21492148 mutations. push ( ( k. clone ( ) , op) ) ;
@@ -2155,9 +2154,8 @@ mod wasm_test_btree {
21552154 mutations. push ( ( k, op) ) ;
21562155 }
21572156 }
2158- Operation :: RemoveKeyPresent if inserted_keys. len ( ) > 0 => {
2159- let indexes: Vec < usize > =
2160- ( 0 ..inserted_keys. len ( ) ) . into_iter ( ) . collect ( ) ;
2157+ Operation :: RemoveKeyPresent if !inserted_keys. is_empty ( ) => {
2158+ let indexes: Vec < usize > = ( 0 ..inserted_keys. len ( ) ) . collect ( ) ;
21612159 let k_index = g. choose ( & indexes) . unwrap ( ) ;
21622160 let k = inserted_keys. remove ( * k_index) ;
21632161 mutations. push ( ( k, op) ) ;
@@ -2173,9 +2171,7 @@ mod wasm_test_btree {
21732171 }
21742172
21752173 Self {
2176- expected_keys : crate :: collections:: BTreeSet :: from_iter (
2177- inserted_keys. into_iter ( ) ,
2178- ) ,
2174+ expected_keys : crate :: collections:: BTreeSet :: from_iter ( inserted_keys) ,
21792175 mutations,
21802176 }
21812177 }
0 commit comments