fix: cargo fmt

Author: JuArce

batcher/aligned-batcher/src/lib.rs

@@ -803,7 +803,10 @@ impl Batcher {
             debug!("Batch queue is full. Evaluating if the incoming proof can replace a lower-priority entry.");
 
             // This cannot panic, if the batch queue is full it has at least one item
-            let (lowest_priority_entry, _) = batch_state_lock.batch_queue.peek().expect("Batch queue was expected to be full, but somehow no item was inside");
+            let (lowest_priority_entry, _) = batch_state_lock
+                .batch_queue
+                .peek()
+                .expect("Batch queue was expected to be full, but somehow no item was inside");
 
             let lowest_fee_in_queue = lowest_priority_entry.nonced_verification_data.max_fee;
 
@@ -814,9 +817,11 @@ impl Batcher {
             // So this will never eject a proof of the same user with a lower nonce
             // which is the expected behaviour
             if new_proof_fee > lowest_fee_in_queue {
-     
                 // This cannot panic, if the batch queue is full it has at least one item
-                let (removed_entry, _) = batch_state_lock.batch_queue.pop().expect("Batch queue was expected to be full, but somehow no item was inside");
+                let (removed_entry, _) = batch_state_lock
+                    .batch_queue
+                    .pop()
+                    .expect("Batch queue was expected to be full, but somehow no item was inside");
 
                 info!(
                     "Incoming proof (nonce: {}, fee: {}) has higher fee. Replacing lowest fee proof from sender {} with nonce {}.",

batcher/aligned-batcher/src/types/batch_state.rs

@@ -246,7 +246,8 @@ impl BatchState {
         if let Entry::Occupied(mut user_state) = self.user_states.entry(addr) {
             user_state.get_mut().proofs_in_batch -= 1;
             user_state.get_mut().nonce -= U256::one();
-            user_state.get_mut().total_fees_in_queue -= removed_entry.nonced_verification_data.max_fee;
+            user_state.get_mut().total_fees_in_queue -=
+                removed_entry.nonced_verification_data.max_fee;
             user_state.get_mut().last_max_fee_limit = new_last_max_fee_limit;
         }
     }