Run cargo fmt

Author: jturner314

src/correlation.rs

@@ -178,7 +178,7 @@ mod cov_tests {
         let a = Array::from_elem((n_random_variables, n_observations), value);
         a.cov(1.).all_close(
             &Array::zeros((n_random_variables, n_random_variables)),
-            1e-8
+            1e-8,
         )
     }
 
@@ -188,7 +188,7 @@ mod cov_tests {
         let n_observations = 4;
         let a = Array::random(
             (n_random_variables, n_observations),
-            Uniform::new(-bound.abs(), bound.abs())
+            Uniform::new(-bound.abs(), bound.abs()),
         );
         let covariance = a.cov(1.);
         covariance.all_close(&covariance.t(), 1e-8)
@@ -278,7 +278,7 @@ mod pearson_correlation_tests {
         let n_observations = 4;
         let a = Array::random(
             (n_random_variables, n_observations),
-            Uniform::new(-bound.abs(), bound.abs())
+            Uniform::new(-bound.abs(), bound.abs()),
         );
         let pearson_correlation = a.pearson_correlation();
         pearson_correlation.all_close(&pearson_correlation.t(), 1e-8)
@@ -290,7 +290,10 @@ mod pearson_correlation_tests {
         let n_observations = 4;
         let a = Array::from_elem((n_random_variables, n_observations), value);
         let pearson_correlation = a.pearson_correlation();
-        pearson_correlation.iter().map(|x| x.is_nan()).fold(true, |acc, flag| acc & flag)
+        pearson_correlation
+            .iter()
+            .map(|x| x.is_nan())
+            .fold(true, |acc, flag| acc & flag)
     }
 
     #[test]

src/entropy.rs

@@ -217,8 +217,8 @@ where
 #[cfg(test)]
 mod tests {
     use super::EntropyExt;
-    use approx::assert_abs_diff_eq;
     use crate::errors::{EmptyInput, MultiInputError};
+    use approx::assert_abs_diff_eq;
     use ndarray::{array, Array1};
     use noisy_float::types::n64;
     use std::f64;

src/histogram/bins.rs

@@ -340,7 +340,7 @@ mod edges_tests {
         let edges = Edges::from(v);
         let n = edges.len();
         for i in 1..n {
-            if edges[i-1] > edges[i] {
+            if edges[i - 1] > edges[i] {
                 return false;
             }
         }
@@ -353,7 +353,7 @@ mod edges_tests {
         let edges = Edges::from(a);
         let n = edges.len();
         for i in 1..n {
-            if edges[i-1] > edges[i] {
+            if edges[i - 1] > edges[i] {
                 return false;
             }
         }
@@ -367,7 +367,7 @@ mod edges_tests {
         if view.len() == 0 {
             true
         } else {
-            let last = view[view.len()-1];
+            let last = view[view.len() - 1];
             edges.indices_of(&last).is_none()
         }
     }

src/quantile/mod.rs

@@ -1,12 +1,12 @@
 use self::interpolate::{higher_index, lower_index, Interpolate};
 use super::sort::get_many_from_sorted_mut_unchecked;
-use crate::errors::{EmptyInput, MinMaxError, MinMaxError::UndefinedOrder};
 use crate::errors::QuantileError;
+use crate::errors::{EmptyInput, MinMaxError, MinMaxError::UndefinedOrder};
+use crate::{MaybeNan, MaybeNanExt};
 use ndarray::prelude::*;
 use ndarray::{Data, DataMut, RemoveAxis, Zip};
 use noisy_float::types::N64;
 use std::cmp;
-use crate::{MaybeNan, MaybeNanExt};
 
 /// Quantile methods for `ArrayBase`.
 pub trait QuantileExt<A, S, D>