style: resole clippy issues

src/data_structures/mod.rs

@@ -3,7 +3,7 @@ mod b_tree;
 mod binary_search_tree;
 mod fenwick_tree;
 mod floyds_algorithm;
-mod graph;
+pub mod graph;
 mod hash_table;
 mod heap;
 mod infix_to_postfix;

src/data_structures/probabilistic/bloom_filter.rs

@@ -3,7 +3,7 @@ use std::hash::{BuildHasher, Hash, Hasher};
 
 /// A Bloom Filter <https://en.wikipedia.org/wiki/Bloom_filter> is a probabilistic data structure testing whether an element belongs to a set or not
 /// Therefore, its contract looks very close to the one of a set, for example a `HashSet`
-trait BloomFilter<Item: Hash> {
+pub trait BloomFilter<Item: Hash> {
     fn insert(&mut self, item: Item);
     fn contains(&self, item: &Item) -> bool;
 }

src/graph/floyd_warshall.rs

@@ -36,7 +36,7 @@ pub fn floyd_warshall<V: Ord + Copy, E: Ord + Copy + Add<Output = E> + num_trait
     let keys = map.keys().copied().collect::<Vec<_>>();
     for &k in &keys {
         for &i in &keys {
-            if map[&i].get(&k).is_none() {
+            if !map[&i].contains_key(&k) {
                 continue;
             }
             for &j in &keys {

src/math/linear_sieve.rs

@@ -76,6 +76,12 @@ impl LinearSieve {
     }
 }
 
+impl Default for LinearSieve {
+    fn default() -> Self {
+        Self::new()
+    }
+}
+
 #[cfg(test)]
 mod tests {
     use super::LinearSieve;

src/math/trig_functions.rs

@@ -154,15 +154,6 @@ mod tests {
 
     const TOL: f64 = 1e-10;
 
-    trait Verify {
-        fn verify<T: Into<f64> + Copy>(
-            trig_func: &TrigFuncType,
-            angle: T,
-            expected_result: f64,
-            is_radian: bool,
-        );
-    }
-
     impl TrigFuncType {
         fn verify<T: Into<f64> + Copy>(&self, angle: T, expected_result: f64, is_radian: bool) {
             let value = match self {