Run cargo fmt

Author: gvonness-apolitical

src/cubature/adaptive.rs

@@ -408,9 +408,7 @@ mod tests {
     fn inf_bounds_rejected() {
         assert!(adaptive_cubature(|_| 1.0, &[f64::INFINITY], &[1.0], 1e-8).is_err());
         assert!(adaptive_cubature(|_| 1.0, &[0.0], &[f64::NEG_INFINITY], 1e-8).is_err());
-        assert!(
-            adaptive_cubature(|_| 1.0, &[0.0, f64::INFINITY], &[1.0, 1.0], 1e-8).is_err()
-        );
+        assert!(adaptive_cubature(|_| 1.0, &[0.0, f64::INFINITY], &[1.0, 1.0], 1e-8).is_err());
     }
 
     #[test]

src/cubature/monte_carlo.rs

@@ -364,9 +364,8 @@ impl MonteCarloIntegrator {
                 let mean_a = total_sum / total_n as f64;
                 let mean_b = sum / count as f64;
                 let delta = mean_b - mean_a;
-                total_m2 += m2
-                    + delta * delta * (total_n as f64 * count as f64)
-                        / (total_n + count) as f64;
+                total_m2 +=
+                    m2 + delta * delta * (total_n as f64 * count as f64) / (total_n + count) as f64;
             } else {
                 total_m2 += m2;
             }

src/gauss_jacobi.rs

@@ -98,7 +98,11 @@ impl_rule_accessors!(GaussJacobi, nodes_doc: "Returns the nodes on \\[-1, 1\\]."
 ///
 /// μ₀ = 2^(α+β+1) Γ(α+1)Γ(β+1) / Γ(α+β+2)
 #[allow(clippy::cast_precision_loss)] // n is a quadrature order, always small enough for exact f64
-fn compute_jacobi(n: usize, alpha: f64, beta: f64) -> Result<(Vec<f64>, Vec<f64>), QuadratureError> {
+fn compute_jacobi(
+    n: usize,
+    alpha: f64,
+    beta: f64,
+) -> Result<(Vec<f64>, Vec<f64>), QuadratureError> {
     let ab = alpha + beta;
 
     // Diagonal: α_k = (β²-α²) / ((2k+ab)(2k+ab+2))

src/gauss_lobatto.rs

@@ -137,10 +137,7 @@ fn compute_lobatto(n: usize) -> (Vec<f64>, Vec<f64>) {
 
     // Sort ascending (should already be, but ensure)
     let mut pairs: Vec<_> = nodes.into_iter().zip(weights).collect();
-    pairs.sort_by(|a, b| {
-        a.0.partial_cmp(&b.0)
-            .unwrap_or(core::cmp::Ordering::Equal)
-    });
+    pairs.sort_by(|a, b| a.0.partial_cmp(&b.0).unwrap_or(core::cmp::Ordering::Equal));
     let (nodes, weights) = pairs.into_iter().unzip();
 
     (nodes, weights)

src/golub_welsch.rs

@@ -63,10 +63,7 @@ pub(crate) fn golub_welsch(
 
     // Sort ascending by node
     let mut pairs: Vec<_> = d.into_iter().zip(weights).collect();
-    pairs.sort_by(|a, b| {
-        a.0.partial_cmp(&b.0)
-            .unwrap_or(core::cmp::Ordering::Equal)
-    });
+    pairs.sort_by(|a, b| a.0.partial_cmp(&b.0).unwrap_or(core::cmp::Ordering::Equal));
     Ok(pairs.into_iter().unzip())
 }