Merge branch 'master' into add-euler-totient-function

Author: vil02

Cargo.toml

@@ -31,7 +31,6 @@ cast_precision_loss = { level = "allow", priority = 1 }
 cast_sign_loss = { level = "allow", priority = 1 }
 cloned_instead_of_copied = { 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_iter_loop = { level = "allow", priority = 1 }
 float_cmp = { level = "allow", priority = 1 }
@@ -166,6 +165,5 @@ doc_lazy_continuation = { level = "allow", priority = 1 }
 needless_return = { level = "allow", priority = 1 }
 doc_overindented_list_items = { level = "allow", priority = 1 }
 # complexity-lints
-needless_lifetimes = { level = "allow", priority = 1 }
 precedence = { level = "allow", priority = 1 }
 manual_div_ceil = { level = "allow", priority = 1 }

src/ciphers/transposition.rs

@@ -161,7 +161,7 @@ fn decrypt(mut msg: String, key_order: Vec<usize>) -> String {
 
     for key in key_order {
         if let Some((_, column)) = indexed_vec.iter().find(|(key_index, _)| key_index == &key) {
-            decrypted_vec.push(column.to_string());
+            decrypted_vec.push(column.clone());
         }
     }
 

src/data_structures/binary_search_tree.rs

@@ -184,7 +184,7 @@ where
     stack: Vec<&'a BinarySearchTree<T>>,
 }
 
-impl<'a, T> BinarySearchTreeIter<'a, T>
+impl<T> BinarySearchTreeIter<'_, T>
 where
     T: Ord,
 {

src/data_structures/veb_tree.rs

@@ -221,7 +221,7 @@ impl<'a> VebTreeIter<'a> {
     }
 }
 
-impl<'a> Iterator for VebTreeIter<'a> {
+impl Iterator for VebTreeIter<'_> {
     type Item = u32;
 
     fn next(&mut self) -> Option<u32> {

src/math/interquartile_range.rs

@@ -13,7 +13,7 @@ pub fn find_median(numbers: &[f64]) -> f64 {
     let mid = length / 2;
 
     if length % 2 == 0 {
-        (numbers[mid - 1] + numbers[mid]) / 2.0
+        f64::midpoint(numbers[mid - 1], numbers[mid])
     } else {
         numbers[mid]
     }

src/math/perfect_square.rs

@@ -18,7 +18,7 @@ pub fn perfect_square_binary_search(n: i32) -> bool {
     let mut right = n;
 
     while left <= right {
-        let mid = (left + right) / 2;
+        let mid = i32::midpoint(left, right);
         let mid_squared = mid * mid;
 
         match mid_squared.cmp(&n) {

src/math/random.rs

@@ -107,7 +107,7 @@ impl PCG32 {
     }
 }
 
-impl<'a> Iterator for IterMut<'a> {
+impl Iterator for IterMut<'_> {
     type Item = u32;
     fn next(&mut self) -> Option<Self::Item> {
         Some(self.pcg.get_u32())

src/sorting/dutch_national_flag_sort.rs

@@ -11,7 +11,7 @@ pub enum Colors {
     White, //  | Define the three colors of the Dutch Flag: 🇳🇱
     Blue,  // /
 }
-use Colors::*;
+use Colors::{Blue, Red, White};
 
 // Algorithm implementation
 pub fn dutch_national_flag_sort(mut sequence: Vec<Colors>) -> Vec<Colors> {