cargo clippy --fix

Author: ekinimo

Diff for: src/proptest_triemap.rs

@@ -110,7 +110,7 @@ fn test_triemap_memory_reuse() {
 
     // Remove some data
     for i in 0..50 {
-        trie.remove(&format!("key_{}", i));
+        trie.remove(format!("key_{}", i));
     }
 
     // Check free indices after removal
@@ -127,7 +127,7 @@ fn test_triemap_memory_reuse() {
 
     // Verify data integrity
     for i in 50..150 {
-        assert_eq!(trie.get(&format!("key_{}", i)), Some(&(i as i32)));
+        assert_eq!(trie.get(format!("key_{}", i)), Some(&{ i }));
     }
 }
 
@@ -809,7 +809,7 @@ fn test_retained_capacity_after_removals() {
     let capacity_before = trie.capacity();
 
     for i in 0..1000 {
-        trie.remove(&format!("key_{}", i));
+        trie.remove(format!("key_{}", i));
     }
 
     let capacity_after = trie.capacity();
@@ -836,7 +836,7 @@ fn test_reused_indices_after_removal() {
     assert_eq!(trie.free_indices.len(), 0);
 
     for i in 0..5 {
-        trie.remove(&format!("key_{}", i));
+        trie.remove(format!("key_{}", i));
     }
 
     assert_eq!(trie.free_indices.len(), 5);
@@ -848,7 +848,7 @@ fn test_reused_indices_after_removal() {
     assert_eq!(trie.free_indices.len(), 0);
 
     for i in 5..15 {
-        assert_eq!(trie.get(&format!("key_{}", i)), Some(&i));
+        assert_eq!(trie.get(format!("key_{}", i)), Some(&i));
     }
 }
 

Diff for: src/trie_map.rs

@@ -719,7 +719,7 @@ impl<T> TrieMap<T> {
     /// assert_eq!(map.get("a"), Some(&11));
     /// assert_eq!(map.get("b"), Some(&12));
     /// ```
-    pub fn iter_mut<'a>(&'a mut self) -> impl Iterator<Item = (Vec<u8>, &'a mut T)> + 'a {
+    pub fn iter_mut(&mut self) -> impl Iterator<Item = (Vec<u8>, &mut T)> + '_ {
         let mut keys_indices = Vec::with_capacity(self.size);
         let mut current_key = Vec::new();
         Self::collect_keys_indices(&self.root, &mut current_key, &mut keys_indices);
@@ -1640,7 +1640,6 @@ impl<T> TrieMap<T> {
     ) -> impl Iterator<Item = (Vec<u8>, &'a T)> + 'a {
         self.iter()
             .filter(move |(key, _)| other.contains_key(key))
-            .map(|(key, value)| (key, value))
     }
 
     /// Returns an iterator over the entries whose keys are in this map but not in the other map.
@@ -1670,7 +1669,6 @@ impl<T> TrieMap<T> {
     ) -> impl Iterator<Item = (Vec<u8>, &'a T)> + 'a {
         self.iter()
             .filter(move |(key, _)| !other.contains_key(key))
-            .map(|(key, value)| (key, value))
     }
 
     /// Returns an iterator over entries whose keys are in exactly one of the maps.

Diff for: src/trie_map/tests.rs

@@ -1214,7 +1214,7 @@ fn test_entry_or_insert_with() {
             100
         });
         assert_eq!(*value, 84);
-        assert_eq!(called.get(), false);
+        assert!(!called.get());
     }
 }
 
@@ -1792,7 +1792,7 @@ fn test_get_or_insert_with() {
         });
 
         assert_eq!(*value, 42);
-        assert_eq!(called.get(), false);
+        assert!(!called.get());
     }
 }