chore(core): fmt

Author: evanlinjin

crates/core/benches/checkpoint_skiplist.rs

@@ -1,7 +1,7 @@
 use bdk_core::CheckPoint;
-use bitcoin::BlockHash;
 use bitcoin::hashes::Hash;
-use criterion::{black_box, criterion_group, criterion_main, Criterion, Bencher};
+use bitcoin::BlockHash;
+use criterion::{black_box, criterion_group, criterion_main, Bencher, Criterion};
 
 /// Create a checkpoint chain with the given length
 fn create_checkpoint_chain(length: u32) -> CheckPoint<BlockHash> {
@@ -206,4 +206,4 @@ criterion_group!(
     bench_skip_pointer_analysis
 );
 
-criterion_main!(benches);
+criterion_main!(benches);

crates/core/src/checkpoint.rs

@@ -235,12 +235,11 @@ impl<D> CheckPoint<D> {
         }
 
         // Now iterate normally from the found starting point
-        current.into_iter()
-            .take_while(move |cp| match start_bound {
-                core::ops::Bound::Included(inc_bound) => cp.height() >= inc_bound,
-                core::ops::Bound::Excluded(exc_bound) => cp.height() > exc_bound,
-                core::ops::Bound::Unbounded => true,
-            })
+        current.into_iter().take_while(move |cp| match start_bound {
+            core::ops::Bound::Included(inc_bound) => cp.height() >= inc_bound,
+            core::ops::Bound::Excluded(exc_bound) => cp.height() > exc_bound,
+            core::ops::Bound::Unbounded => true,
+        })
     }
 
     /// Returns the checkpoint at `height` if one exists, otherwise the nearest checkpoint at a
@@ -390,12 +389,16 @@ where
         let base_index = result.index();
 
         // First insert the new block
-        result = result.push_with_index(height, data, base_index + 1).expect("height is valid");
+        result = result
+            .push_with_index(height, data, base_index + 1)
+            .expect("height is valid");
 
         // Then re-add all the tail blocks with updated indices
         let mut current_index = base_index + 2;
         for (h, d) in tail.into_iter().rev() {
-            result = result.push_with_index(h, d, current_index).expect("tail is in order");
+            result = result
+                .push_with_index(h, d, current_index)
+                .expect("tail is in order");
             current_index += 1;
         }
 
@@ -406,7 +409,9 @@ where
     fn push_with_index(self, height: u32, data: D, new_index: u32) -> Result<Self, Self> {
         if self.height() < height {
             // Calculate skip pointer
-            let skip = if new_index >= CHECKPOINT_SKIP_INTERVAL && new_index % CHECKPOINT_SKIP_INTERVAL == 0 {
+            let skip = if new_index >= CHECKPOINT_SKIP_INTERVAL
+                && new_index % CHECKPOINT_SKIP_INTERVAL == 0
+            {
                 // Navigate back CHECKPOINT_SKIP_INTERVAL checkpoints
                 let target_index = new_index - CHECKPOINT_SKIP_INTERVAL;
                 let mut current = Some(self.0.clone());
@@ -453,7 +458,9 @@ where
             let new_index = self.0.index + 1;
 
             // Calculate skip pointer
-            let skip = if new_index >= CHECKPOINT_SKIP_INTERVAL && new_index % CHECKPOINT_SKIP_INTERVAL == 0 {
+            let skip = if new_index >= CHECKPOINT_SKIP_INTERVAL
+                && new_index % CHECKPOINT_SKIP_INTERVAL == 0
+            {
                 // Navigate back CHECKPOINT_SKIP_INTERVAL checkpoints
                 let mut current = Some(self.0.clone());
                 let mut steps = 0;

crates/core/tests/test_checkpoint_skiplist.rs

@@ -1,6 +1,6 @@
 use bdk_core::CheckPoint;
-use bitcoin::BlockHash;
 use bitcoin::hashes::Hash;
+use bitcoin::BlockHash;
 
 #[test]
 fn test_skiplist_indices() {
@@ -193,4 +193,4 @@ fn test_skiplist_range_uses_skip_pointers() {
     assert_eq!(range_items.len(), 51);
     assert_eq!(range_items.first().unwrap().height(), 500);
     assert_eq!(range_items.last().unwrap().height(), 450);
-}
+}