Applied clippy suggestions

src/simple/builder.rs

@@ -133,7 +133,7 @@ impl<K: Clone + Ord> SearchIndexBuilder<K> {
     ///
     /// [`StrsimMetric`]: enum.StrsimMetric.html
     #[cfg(feature = "strsim")]
-    pub const fn strsim_metric(mut self, strsim_metric: Option<StrsimMetric>) -> Self {
+    #[must_use] pub const fn strsim_metric(mut self, strsim_metric: Option<StrsimMetric>) -> Self {
         self.strsim_metric = strsim_metric;
         self
     } // fn

src/simple/internal/strsim/autocomplete/context_damerau_levenshtein.rs

@@ -70,7 +70,7 @@ impl<K: Hash + Ord> SearchIndex<K> {
                 // Insert the score into the top scores (if it's normal and high
                 // enough):
                 if score.is_normal() && score >= self.fuzzy_minimum_score {
-                    top_scores.insert(index_keyword, index_keys, score)
+                    top_scores.insert(index_keyword, index_keys, score);
                 } // if
             }); // for_each
 

src/simple/internal/strsim/autocomplete/context_jaro_winkler.rs

@@ -70,7 +70,7 @@ impl<K: Hash + Ord> SearchIndex<K> {
                 // Insert the score into the top scores (if it's normal and high
                 // enough):
                 if score.is_normal() && score >= self.fuzzy_minimum_score {
-                    top_scores.insert(index_keyword, index_keys, score)
+                    top_scores.insert(index_keyword, index_keys, score);
                 } // if
             }); // for_each
 

src/simple/internal/strsim/autocomplete/context_levenshtein.rs

@@ -70,7 +70,7 @@ impl<K: Hash + Ord> SearchIndex<K> {
                 // Insert the score into the top scores (if it's normal and high
                 // enough):
                 if score.is_normal() && score >= self.fuzzy_minimum_score {
-                    top_scores.insert(index_keyword, index_keys, score)
+                    top_scores.insert(index_keyword, index_keys, score);
                 } // if
             }); // for_each
 

src/simple/internal/strsim/autocomplete/global_levenshtein.rs

@@ -54,7 +54,7 @@ impl<K: Hash + Ord> SearchIndex<K> {
                 // Insert the score into the top scores (if it's normal and high
                 // enough):
                 if score.is_normal() && score >= self.fuzzy_minimum_score {
-                    top_scores.insert(index_keyword, index_keys, score)
+                    top_scores.insert(index_keyword, index_keys, score);
                 } // if
             }); // for_each
 

src/simple/internal/strsim/autocomplete/mod.rs

@@ -1,12 +1,12 @@
 //! Fuzzy matching for autocompletion.
 
-pub(crate) mod context_damerau_levenshtein;
-pub(crate) mod context_jaro;
-pub(crate) mod context_jaro_winkler;
-pub(crate) mod context_levenshtein;
-pub(crate) mod context_sorensen_dice;
-pub(crate) mod global_damerau_levenshtein;
-pub(crate) mod global_jaro;
-pub(crate) mod global_jaro_winkler;
-pub(crate) mod global_levenshtein;
-pub(crate) mod global_sorensen_dice;
+pub mod context_damerau_levenshtein;
+pub mod context_jaro;
+pub mod context_jaro_winkler;
+pub mod context_levenshtein;
+pub mod context_sorensen_dice;
+pub mod global_damerau_levenshtein;
+pub mod global_jaro;
+pub mod global_jaro_winkler;
+pub mod global_levenshtein;
+pub mod global_sorensen_dice;

src/simple/internal/strsim/keyword/mod.rs

@@ -1,7 +1,7 @@
 //! Fuzzy matching for keyword substitution.
 
-pub(crate) mod global_damerau_levenshtein;
-pub(crate) mod global_jaro;
-pub(crate) mod global_jaro_winkler;
-pub(crate) mod global_levenshtein;
-pub(crate) mod global_sorensen_dice;
+pub mod global_damerau_levenshtein;
+pub mod global_jaro;
+pub mod global_jaro_winkler;
+pub mod global_levenshtein;
+pub mod global_sorensen_dice;

src/simple/internal/strsim/strsim_autocomplete.rs

@@ -87,13 +87,14 @@ impl<K: Hash + Ord> SearchIndex<K> {
     /// );
     /// ```
 
-    pub fn strsim_autocomplete(&self, keyword: &str) -> Vec<&str> {
+    #[must_use] pub fn strsim_autocomplete(&self, keyword: &str) -> Vec<&str> {
         // If case sensitivity set, leave case intact. Otherwise, normalize
         // keyword to lower case:
-        let keyword = match self.case_sensitive {
-            true => keyword.to_string(),
-            false => keyword.to_lowercase(),
-        }; // match
+        let keyword = if self.case_sensitive {
+            keyword.to_string()
+        } else {
+            keyword.to_lowercase()
+        };
 
         // Call global autocompletion provider:
         self.strsim_global_autocomplete(&keyword)

src/simple/internal/strsim/strsim_context_autocomplete.rs

@@ -63,6 +63,7 @@ impl<K: Hash + Ord> SearchIndex<K> {
         // Attempt to find the top matches for the user's (partial) keyword
         // using the selected string similarity metric defined in the
         // `SearchIndex`:
+        #[allow(clippy::option_if_let_else)] // This lint makes things less readable 👎
         if let Some(strsim_metric) = &self.strsim_metric {
             match strsim_metric {
                 StrsimMetric::DamerauLevenshtein => self

src/simple/internal/strsim/strsim_global_autocomplete.rs

@@ -62,6 +62,7 @@ impl<K: Hash + Ord> SearchIndex<K> {
         // Attempt to find the top matches for the user's (partial) keyword
         // using the selected string similarity metric defined in the
         // `SearchIndex`:
+        #[allow(clippy::option_if_let_else)] // I don't like this lint
         if let Some(strsim_metric) = &self.strsim_metric {
             match strsim_metric {
                 StrsimMetric::DamerauLevenshtein => self

src/simple/internal/strsim/strsim_global_keyword.rs

@@ -57,6 +57,7 @@ impl<K: Hash + Ord> SearchIndex<K> {
 
         // Attempt to find the closest match for the user's keyword using the
         // selected string similarity metric defined in the `SearchIndex`:
+        #[allow(clippy::option_if_let_else)] // I hate this lint
         if let Some(strsim_metric) = &self.strsim_metric {
             match strsim_metric {
                 StrsimMetric::DamerauLevenshtein => {

src/simple/internal/strsim/strsim_keyword.rs

@@ -82,16 +82,17 @@ impl<K: Hash + Ord> SearchIndex<K> {
     /// );
     /// ```
 
-    pub fn strsim_keyword(&self, keyword: &str) -> Option<&str> {
+    #[must_use] pub fn strsim_keyword(&self, keyword: &str) -> Option<&str> {
         // If case sensitivity set, leave case intact. Otherwise, normalize
         // keyword to lower case:
-        let keyword = match self.case_sensitive {
-            true => keyword.to_string(),
-            false => keyword.to_lowercase(),
-        }; // match
+        let keyword = if self.case_sensitive {
+            keyword.to_string()
+        } else {
+            keyword.to_lowercase()
+        }; // if
 
         // Call global keyword subtitution provider:
         self.strsim_global_keyword(&keyword)
-            .map(|kstring| kstring.as_str())
+            .map(kstring::KStringBase::as_str)
     } // fn
 } // impl

src/simple/search/live.rs

@@ -182,7 +182,7 @@ impl<K: Hash + Ord> SearchIndex<K> {
                         .take(*maximum_search_results)
                         // Collect all keyword autocompletions into a
                         // `BTreeSet`:
-                        .collect()
+                        .collect();
                 } // if
 
                 // Return search results to caller:
@@ -296,7 +296,7 @@ impl<K: Hash + Ord> SearchIndex<K> {
                         .take(*maximum_search_results)
                         // Collect all keyword autocompletions into a
                         // `BTreeSet`:
-                        .collect()
+                        .collect();
                 } // if
 
                 // Return search results to caller: