clippy

Author: marvin-j97

src/abstract.rs

@@ -14,7 +14,6 @@ use std::{ops::RangeBounds, sync::Arc};
 pub type RangeItem = crate::Result<KvPair>;
 
 /// Generic Tree API
-#[expect(clippy::module_name_repetitions)]
 #[enum_dispatch]
 pub trait AbstractTree {
     #[doc(hidden)]

src/compaction/leveled.rs

@@ -371,9 +371,6 @@ impl CompactionStrategy for Strategy {
             }
 
             // NOTE: Never score Lmax
-            //
-            // NOTE: We check for level length above
-            #[expect(clippy::indexing_slicing)]
             {
                 scores[6] = (0.0, 0);
             }

src/table/block/encoder.rs

@@ -138,7 +138,6 @@ impl<'a, Context: Default, Item: Encodable<Context>> Encoder<'a, Context, Item>
 
             self.base_key = item.key();
         } else {
-            #[expect(clippy::cast_possible_truncation, reason = "keys are u16 long max")]
             let shared_prefix_len = longest_shared_prefix_length(self.base_key, item.key());
             item.encode_truncated_into(&mut *self.writer, &mut self.state, shared_prefix_len)?;
         }

src/table/data_block/iter.rs

@@ -128,7 +128,6 @@ impl<'a> Iter<'a> {
                 std::cmp::Ordering::Equal => {
                     // Consume all items equal to the needle to enforce strictness
                     self.decoder.next().expect("should exist");
-                    continue;
                 }
                 std::cmp::Ordering::Less => {
                     self.decoder.next().expect("should exist");
@@ -160,7 +159,6 @@ impl<'a> Iter<'a> {
                 std::cmp::Ordering::Equal => {
                     // Consume all items equal to the needle from the high end
                     self.decoder.next_back().expect("should exist");
-                    continue;
                 }
                 std::cmp::Ordering::Greater => {
                     self.decoder.next_back().expect("should exist");

src/table/filter/standard_bloom/mod.rs

@@ -64,7 +64,6 @@ impl<'a> StandardBloomFilterReader<'a> {
 
         let offset = reader.position() as usize;
 
-        #[expect(clippy::indexing_slicing)]
         Ok(Self {
             k,
             m,

src/table/iter.rs

@@ -332,7 +332,6 @@ impl DoubleEndedIterator for Iter {
 
             // Retrieve the next data block from the cache (or disk on miss) so the high-side reader
             // can serve entries in reverse order.
-            #[expect(clippy::single_match_else)]
             let block = match self.cache.get_block(self.table_id, handle.offset()) {
                 Some(block) => block,
                 None => {

src/tree/mod.rs

@@ -200,7 +200,6 @@ impl AbstractTree for Tree {
         let mut count = 0;
         let mut last_key = None;
 
-        #[expect(clippy::explicit_counter_loop)]
         for (key, value) in iter {
             if let Some(last_key) = &last_key {
                 assert!(

src/version/mod.rs

@@ -679,7 +679,6 @@ impl Version {
                 write!(f, "  ")?;
 
                 if run.len() >= 30 {
-                    #[expect(clippy::indexing_slicing)]
                     for table in run.iter().take(2) {
                         let id = table.id();
                         let is_hidden = hidden_set.is_hidden(id);
@@ -693,7 +692,6 @@ impl Version {
                     }
                     write!(f, " . . . ")?;
 
-                    #[expect(clippy::indexing_slicing)]
                     for table in run.iter().rev().take(2).rev() {
                         let id = table.id();
                         let is_hidden = hidden_set.is_hidden(id);