diff --git a/infos/src/main.rs b/infos/src/main.rs
index 5a12a9d4d..902394af8 100644
--- a/infos/src/main.rs
+++ b/infos/src/main.rs
@@ -354,8 +354,7 @@ fn biggest_value_sizes(index: &Index, rtxn: &heed::RoTxn, limit: usize) -> anyho
         word_prefix_level_position_docids,
         facet_field_id_value_docids,
         field_id_docid_facet_values: _,
-        documents,
-        ..
+        documents
     } = index;
 
     let main_name = "main";
diff --git a/milli/src/search/criteria/attribute.rs b/milli/src/search/criteria/attribute.rs
index 745d8cdb0..18a18816c 100644
--- a/milli/src/search/criteria/attribute.rs
+++ b/milli/src/search/criteria/attribute.rs
@@ -13,7 +13,7 @@ use super::{Criterion, CriterionResult, Context, resolve_query_tree};
 
 /// To be able to divide integers by the number of words in the query
 /// we want to find a multiplier that allow us to divide by any number between 1 and 10.
-/// We Choosed the LCM of all numbers between 1 and 10 as the multiplier (https://en.wikipedia.org/wiki/Least_common_multiple).
+/// We chose the LCM of all numbers between 1 and 10 as the multiplier (https://en.wikipedia.org/wiki/Least_common_multiple).
 const LCM_10_FIRST_NUMBERS: u32 = 2520;
 
 pub struct Attribute<'t> {
diff --git a/milli/src/search/criteria/final.rs b/milli/src/search/criteria/final.rs
index d3c394467..f8bc43204 100644
--- a/milli/src/search/criteria/final.rs
+++ b/milli/src/search/criteria/final.rs
@@ -44,11 +44,7 @@ impl<'t> Final<'t> {
 
                     bucket_candidates.union_with(&candidates);
 
-                    return Ok(Some(FinalResult {
-                        query_tree,
-                        candidates,
-                        bucket_candidates,
-                    }));
+                    return Ok(Some(FinalResult { query_tree, candidates, bucket_candidates }));
                 },
                 None => return Ok(None),
             }
diff --git a/milli/src/search/criteria/mod.rs b/milli/src/search/criteria/mod.rs
index b972a0b2c..d3eac94fd 100644
--- a/milli/src/search/criteria/mod.rs
+++ b/milli/src/search/criteria/mod.rs
@@ -123,7 +123,15 @@ impl<'c> Context<'c> for CriteriaBuilder<'c> {
         Ok(words_positions)
     }
 
-    fn word_position_iterator(&self, word: &str, level: TreeLevel, in_prefix_cache: bool, left: Option<u32>, right: Option<u32>) -> heed::Result<Box<dyn Iterator<Item =heed::Result<((&'c str, TreeLevel, u32, u32), RoaringBitmap)>> + 'c>> {
+    fn word_position_iterator(
+        &self,
+        word: &str,
+        level: TreeLevel,
+        in_prefix_cache: bool,
+        left: Option<u32>,
+        right: Option<u32>
+    ) -> heed::Result<Box<dyn Iterator<Item =heed::Result<((&'c str, TreeLevel, u32, u32), RoaringBitmap)>> + 'c>>
+    {
         let range = {
             let left = left.unwrap_or(u32::min_value());
             let right = right.unwrap_or(u32::max_value());