clippy

Author: jesper-olsen

src/general/huffman_encoding.rs

@@ -78,12 +78,12 @@ pub struct HuffmanDictionary<T> {
 
 impl<T: Clone + Copy + Ord> HuffmanDictionary<T> {
     /// Creates a new Huffman dictionary from alphabet symbols and their frequencies.
-    /// 
+    ///
     /// Returns `None` if the alphabet is empty.
-    /// 
+    ///
     /// # Arguments
     /// * `alphabet` - A slice of tuples containing symbols and their frequencies
-    /// 
+    ///
     /// # Example
     /// ```
     /// # use the_algorithms_rust::general::HuffmanDictionary;

src/machine_learning/loss_function/kl_divergence_loss.rs

@@ -16,7 +16,7 @@ pub fn kld_loss(actual: &[f64], predicted: &[f64]) -> f64 {
     let loss: f64 = actual
         .iter()
         .zip(predicted.iter())
-        .map(|(&a, &p)| ((a + eps) * ((a + eps) / (p + eps)).ln()))
+        .map(|(&a, &p)| (a + eps) * ((a + eps) / (p + eps)).ln())
         .sum();
     loss
 }