fmt

Author: ktmlm

src/iterator/db_iter.rs

@@ -65,10 +65,8 @@ impl DBIterator {
     pub fn new(sources: Vec<Vec<(Vec<u8>, Vec<u8>)>>, sequence: SequenceNumber) -> Self {
         let iter_sources: Vec<IterSource> = sources.into_iter().map(IterSource::new).collect();
 
-        let merger = MergingIterator::new(
-            iter_sources,
-            ikey_compare as fn(&[u8], &[u8]) -> Ordering,
-        );
+        let merger =
+            MergingIterator::new(iter_sources, ikey_compare as fn(&[u8], &[u8]) -> Ordering);
 
         Self {
             merger,
@@ -91,10 +89,7 @@ impl DBIterator {
 
     /// Build a DB iterator from pre-built IterSource objects (supports streaming).
     pub fn from_sources(sources: Vec<IterSource>, sequence: SequenceNumber) -> Self {
-        let merger = MergingIterator::new(
-            sources,
-            ikey_compare as fn(&[u8], &[u8]) -> Ordering,
-        );
+        let merger = MergingIterator::new(sources, ikey_compare as fn(&[u8], &[u8]) -> Ordering);
 
         Self {
             merger,
@@ -122,10 +117,7 @@ impl DBIterator {
         sequence: SequenceNumber,
         prefix: Vec<u8>,
     ) -> Self {
-        let merger = MergingIterator::new(
-            sources,
-            ikey_compare as fn(&[u8], &[u8]) -> Ordering,
-        );
+        let merger = MergingIterator::new(sources, ikey_compare as fn(&[u8], &[u8]) -> Ordering);
 
         Self {
             merger,

src/memtable/skiplist.rs

@@ -197,10 +197,7 @@ impl SeekableIterator for MemTableCursorIter {
             return None;
         }
         let (k, v) = unsafe { self.sl().node_kv(self.cursor) };
-        Some((
-            k.as_bytes().to_vec(),
-            LazyValue::Inline(v.clone()),
-        ))
+        Some((k.as_bytes().to_vec(), LazyValue::Inline(v.clone())))
     }
 
     /// Copy directly into caller buffers, reusing their capacity.
@@ -241,10 +238,7 @@ impl SeekableIterator for MemTableCursorIter {
                 return None;
             }
             let (k, v) = unsafe { self.sl().node_kv(ptr) };
-            let result = (
-                k.as_bytes().to_vec(),
-                LazyValue::Inline(v.clone()),
-            );
+            let result = (k.as_bytes().to_vec(), LazyValue::Inline(v.clone()));
             // Follow prev0 for the next prev() call — O(1).
             self.cursor = unsafe { self.sl().node_prev0(ptr) };
             return Some(result);
@@ -257,10 +251,7 @@ impl SeekableIterator for MemTableCursorIter {
             return None;
         }
         let (pk, pv) = unsafe { self.sl().node_kv(prev_ptr) };
-        let result = (
-            pk.as_bytes().to_vec(),
-            LazyValue::Inline(pv.clone()),
-        );
+        let result = (pk.as_bytes().to_vec(), LazyValue::Inline(pv.clone()));
         self.cursor = prev_ptr;
         Some(result)
     }