fix lints

Author: ktmlm

src/iterator/range_del.rs

@@ -214,7 +214,7 @@ impl FragmentedRangeTombstoneList {
             // Collect (seq, level) pairs from active tombstones, sorted by seq descending.
             let mut seq_levels: Vec<(SequenceNumber, usize)> =
                 active.iter().map(|&idx| (raw[idx].2, raw[idx].3)).collect();
-            seq_levels.sort_unstable_by(|a, b| b.0.cmp(&a.0));
+            seq_levels.sort_unstable_by_key(|sl| std::cmp::Reverse(sl.0));
             seq_levels.dedup_by_key(|sl| sl.0);
 
             fragments.push(TombstoneFragment {

src/manifest/version_set.rs

@@ -186,7 +186,7 @@ impl VersionSet {
         }
 
         // Sort L0 by file number descending (newest first)
-        version.files[0].sort_by(|a, b| b.meta.number.cmp(&a.meta.number));
+        version.files[0].sort_by_key(|file| std::cmp::Reverse(file.meta.number));
         // Sort L1+ by smallest key
         for level in 1..num_levels {
             version.files[level]

src/sst/block.rs

@@ -145,14 +145,10 @@ impl Block {
             let rp = self.restart_point(mid) as usize;
 
             match decode_entry_at(&self.data, rp, &[]) {
-                Some((key, _, _)) => {
-                    if compare(&key, target) == Ordering::Less {
-                        left = mid + 1;
-                    } else {
-                        right = mid;
-                    }
+                Some((key, _, _)) if compare(&key, target) == Ordering::Less => {
+                    left = mid + 1;
                 }
-                None => {
+                Some(_) | None => {
                     right = mid;
                 }
             }
@@ -204,14 +200,10 @@ impl Block {
             let rp = self.restart_point(mid) as usize;
 
             match decode_entry_at(&self.data, rp, &[]) {
-                Some((key, _, _)) => {
-                    if compare(&key, target) != Ordering::Greater {
-                        left = mid + 1;
-                    } else {
-                        right = mid;
-                    }
+                Some((key, _, _)) if compare(&key, target) != Ordering::Greater => {
+                    left = mid + 1;
                 }
-                None => {
+                Some(_) | None => {
                     right = mid;
                 }
             }