style: incldue explicit_into_iter_loop (#749)

Author: vil02

Cargo.toml

@@ -37,7 +37,6 @@ default_trait_access = { level = "allow", priority = 1 }
 doc_markdown = { level = "allow", priority = 1 }
 enum_glob_use = { level = "allow", priority = 1 }
 explicit_deref_methods = { level = "allow", priority = 1 }
-explicit_into_iter_loop = { level = "allow", priority = 1 }
 explicit_iter_loop = { level = "allow", priority = 1 }
 float_cmp = { level = "allow", priority = 1 }
 from_iter_instead_of_collect = { level = "allow", priority = 1 }

src/big_integer/fast_factorial.rs

@@ -44,7 +44,7 @@ pub fn fast_factorial(n: usize) -> BigUint {
     a.resize(max_bits as usize, BigUint::one());
 
     // For every prime p, multiply a[i] by p if the ith bit of p's index is 1
-    for (p, i) in p_indeces.into_iter() {
+    for (p, i) in p_indeces {
         let mut bit = 1usize;
         while bit.ilog2() < max_bits {
             if (bit & i) > 0 {

src/data_structures/trie.rs

@@ -32,7 +32,7 @@ where
         Key: Eq + Hash,
     {
         let mut node = &mut self.root;
-        for c in key.into_iter() {
+        for c in key {
             node = node.children.entry(c).or_default();
         }
         node.value = Some(value);
@@ -43,7 +43,7 @@ where
         Key: Eq + Hash,
     {
         let mut node = &self.root;
-        for c in key.into_iter() {
+        for c in key {
             if node.children.contains_key(&c) {
                 node = node.children.get(&c).unwrap()
             } else {