Fixed some clippy lints.

Cargo.toml

@@ -56,9 +56,9 @@ fatal-warnings = []
 std = []
 
 [lints.clippy]
-all = { level = "warn", priority = -1 }
-pedantic = { level = "warn", priority = -1 }
-correctness = "deny"
+all = { level = "warn", priority = -2 }
+pedantic = { level = "warn", priority = -2 }
+correctness = { level = "deny", priority = -1 }
 
 enum-glob-use = "allow"
 if-not-else = "allow"

src/list/test.rs

@@ -258,7 +258,7 @@ fn test_partial_ord() {
     let list_1_prime = list!["a"];
     let list_2 = list!["b"];
     let list_3 = list![0.0];
-    let list_4 = list![core::f32::NAN];
+    let list_4 = list![f32::NAN];
 
     assert_eq!(list_1.partial_cmp(&list_1_prime), Some(Ordering::Equal));
     assert_eq!(list_1.partial_cmp(&list_2), Some(Ordering::Less));

src/map/hash_trie_map/mod.rs

@@ -213,7 +213,6 @@ mod node_utils {
     use super::HashValue;
     use core::hash::BuildHasher;
     use core::hash::Hash;
-    use core::hash::Hasher;
     use core::mem::size_of_val;
 
     /// Returns the index of the array for the given hash on depth `depth`.
@@ -237,11 +236,7 @@ mod node_utils {
     }
 
     pub fn hash<T: ?Sized + Hash, H: BuildHasher>(v: &T, hasher_builder: &H) -> HashValue {
-        let mut hasher = hasher_builder.build_hasher();
-
-        v.hash(&mut hasher);
-
-        hasher.finish()
+        hasher_builder.hash_one(&v)
     }
 }
 

src/map/red_black_tree_map/test.rs

@@ -1750,7 +1750,7 @@ fn test_partial_ord() {
     let map_1_prime = rbt_map!["a" => 0xa];
     let map_2 = rbt_map!["b" => 0xb];
     let map_3 = rbt_map![0 => 0.0];
-    let map_4 = rbt_map![0 => core::f32::NAN];
+    let map_4 = rbt_map![0 => f32::NAN];
 
     assert_eq!(map_1.partial_cmp(&map_1_prime), Some(Ordering::Equal));
     assert_eq!(map_1.partial_cmp(&map_2), Some(Ordering::Less));

src/queue/test.rs

@@ -353,7 +353,7 @@ fn test_partial_ord() {
     let queue_1_prime = queue!["a"];
     let queue_2 = queue!["b"];
     let queue_3 = queue![0.0];
-    let queue_4 = queue![core::f32::NAN];
+    let queue_4 = queue![f32::NAN];
 
     assert_eq!(queue_1.partial_cmp(&queue_1_prime), Some(Ordering::Equal));
     assert_eq!(queue_1.partial_cmp(&queue_2), Some(Ordering::Less));

src/set/hash_trie_set/mod.rs

@@ -193,7 +193,7 @@ where
         T: Borrow<V>,
         V: Hash + Eq,
     {
-        self.map.get_key_value(v).map(|(k, _)| k)
+        self.map.get_key_value(v).map(|(k, ())| k)
     }
 
     #[must_use]

src/set/red_black_tree_set/mod.rs

@@ -168,7 +168,7 @@ where
         T: Borrow<V>,
         V: Ord,
     {
-        self.map.get_key_value(v).map(|(k, _)| k)
+        self.map.get_key_value(v).map(|(k, ())| k)
     }
 
     #[must_use]
@@ -182,12 +182,12 @@ where
 
     #[must_use]
     pub fn first(&self) -> Option<&T> {
-        self.map.first().map(|(k, _)| k)
+        self.map.first().map(|(k, ())| k)
     }
 
     #[must_use]
     pub fn last(&self) -> Option<&T> {
-        self.map.last().map(|(k, _)| k)
+        self.map.last().map(|(k, ())| k)
     }
 
     #[must_use]
@@ -279,7 +279,7 @@ where
         Q: Ord + ?Sized,
         RB: RangeBounds<Q>,
     {
-        self.map.range(range).map(|(k, _)| k)
+        self.map.range(range).map(|(k, ())| k)
     }
 }
 

src/stack/test.rs

@@ -188,7 +188,7 @@ fn test_partial_ord() {
     let stack_1_prime = stack!["a"];
     let stack_2 = stack!["b"];
     let stack_3 = stack![0.0];
-    let stack_4 = stack![core::f32::NAN];
+    let stack_4 = stack![f32::NAN];
 
     assert_eq!(stack_1.partial_cmp(&stack_1_prime), Some(Ordering::Equal));
     assert_eq!(stack_1.partial_cmp(&stack_2), Some(Ordering::Less));

src/vector/test.rs

@@ -623,7 +623,7 @@ fn test_partial_ord() {
     let vector_1_prime = vector!["a"];
     let vector_2 = vector!["b"];
     let vector_3 = vector![0.0];
-    let vector_4 = vector![core::f32::NAN];
+    let vector_4 = vector![f32::NAN];
 
     assert_eq!(vector_1.partial_cmp(&vector_1_prime), Some(Ordering::Equal));
     assert_eq!(vector_1.partial_cmp(&vector_2), Some(Ordering::Less));