@@ -95,7 +95,7 @@ fn find_seed_same_bucket() {
95
95
let mut seed = 1 ;
96
96
' main: loop {
97
97
if seed % 1000 == 0 {
98
- println ! ( "Seed: {}" , seed ) ;
98
+ println ! ( "Seed: {seed}" ) ;
99
99
}
100
100
101
101
let keys = generate_deterministic_keypair ( 11 , seed) ;
@@ -116,7 +116,7 @@ fn find_seed_same_bucket() {
116
116
}
117
117
break ;
118
118
}
119
- println ! ( "Found Seed: {}" , seed ) ;
119
+ println ! ( "Found Seed: {seed}" ) ;
120
120
}
121
121
122
122
#[ allow( dead_code) ]
@@ -147,12 +147,12 @@ fn find_seed_spread_bucket() {
147
147
break ;
148
148
}
149
149
if seed % 1000 == 0 {
150
- println ! ( "Seed: {}" , seed ) ;
150
+ println ! ( "Seed: {seed}" ) ;
151
151
}
152
152
}
153
- println ! ( "Found Seed: {}" , seed ) ;
153
+ println ! ( "Found Seed: {seed}" ) ;
154
154
for ( k, v) in buckets. iter ( ) {
155
- println ! ( "{}, {}" , k , v ) ;
155
+ println ! ( "{k }, {v}" ) ;
156
156
}
157
157
}
158
158
@@ -172,7 +172,7 @@ fn find_seed_linear_topology() {
172
172
' main: loop {
173
173
seed += 1 ;
174
174
if seed % 1000 == 0 {
175
- println ! ( "Trying seed: {}" , seed ) ;
175
+ println ! ( "Trying seed: {seed}" ) ;
176
176
}
177
177
178
178
let keys = generate_deterministic_keypair ( 11 , seed) ;
@@ -233,22 +233,21 @@ fn find_seed_linear_topology() {
233
233
break ;
234
234
}
235
235
// We've found a solution. Check it.
236
- println ! ( "Found Seed: {}" , seed ) ;
237
- println ! ( "Ordering: {:?}" , ordering ) ;
236
+ println ! ( "Found Seed: {seed}" ) ;
237
+ println ! ( "Ordering: {ordering :?}" ) ;
238
238
let target = main_result. remove ( 0 ) ;
239
239
// remove the target
240
- println ! ( "Target: {}" , target ) ;
240
+ println ! ( "Target: {target}" ) ;
241
241
for ( x, id) in main_result. iter ( ) . enumerate ( ) {
242
- println ! ( "Node{}: {}" , x , id ) ;
242
+ println ! ( "Node{x }: {id}" ) ;
243
243
}
244
244
245
245
for ( node, previous_node) in main_result. iter ( ) . skip ( 1 ) . zip ( main_result. clone ( ) ) {
246
246
let key: Key < NodeId > = ( * node) . into ( ) ;
247
247
let distance = key. log2_distance ( & previous_node. into ( ) ) . unwrap ( ) ;
248
248
let target_distance = key. log2_distance ( & target. into ( ) ) . unwrap ( ) ;
249
249
println ! (
250
- "Distance of node {} relative to next node: {} is: {}, relative to target {}" ,
251
- previous_node, node, distance, target_distance
250
+ "Distance of node {previous_node} relative to next node: {node} is: {distance}, relative to target {target_distance}"
252
251
) ;
253
252
}
254
253
}
@@ -391,7 +390,7 @@ async fn test_findnode_query() {
391
390
let distance = key
392
391
. log2_distance ( & previous_node_enr. node_id ( ) . into ( ) )
393
392
. unwrap ( ) ;
394
- println ! ( "Distance of node relative to next: {}" , distance ) ;
393
+ println ! ( "Distance of node relative to next: {distance}" ) ;
395
394
node. add_enr ( previous_node_enr) . unwrap ( ) ;
396
395
}
397
396
@@ -533,7 +532,7 @@ async fn test_predicate_search() {
533
532
found_nodes. len( ) ,
534
533
total_nodes,
535
534
) ;
536
- println ! ( "Nodes expected to pass predicate search {}" , num_nodes ) ;
535
+ println ! ( "Nodes expected to pass predicate search {num_nodes}" ) ;
537
536
assert_eq ! ( found_nodes. len( ) , num_nodes) ;
538
537
}
539
538
0 commit comments