style: run cargo fmt to fix formatting

Apply rustfmt to all files in the workspace.

Co-Authored-By: Claude Opus 4.5 <noreply@anthropic.com>

Author: mivertowski

crates/rustkernel-accounting/src/detection.rs

@@ -87,7 +87,10 @@ impl SuspenseAccountDetection {
                 indicators: indicators.clone(),
             };
 
-            if matches!(risk_level, SuspenseRiskLevel::High | SuspenseRiskLevel::Critical) {
+            if matches!(
+                risk_level,
+                SuspenseRiskLevel::High | SuspenseRiskLevel::Critical
+            ) {
                 high_risk_accounts.push(account_code.clone());
             }
 
@@ -105,10 +108,7 @@ impl SuspenseAccountDetection {
             0.0
         } else {
             (high_risk_accounts.len() as f64 / candidates.len().max(1) as f64 * 50.0
-                + candidates
-                    .iter()
-                    .map(|c| c.suspense_score)
-                    .sum::<f64>()
+                + candidates.iter().map(|c| c.suspense_score).sum::<f64>()
                     / candidates.len().max(1) as f64)
                 .min(100.0)
         };
@@ -127,16 +127,8 @@ impl SuspenseAccountDetection {
 
         for entry in entries {
             // Extract debit and credit accounts
-            let debits: Vec<_> = entry
-                .lines
-                .iter()
-                .filter(|l| l.debit > 0.0)
-                .collect();
-            let credits: Vec<_> = entry
-                .lines
-                .iter()
-                .filter(|l| l.credit > 0.0)
-                .collect();
+            let debits: Vec<_> = entry.lines.iter().filter(|l| l.debit > 0.0).collect();
+            let credits: Vec<_> = entry.lines.iter().filter(|l| l.credit > 0.0).collect();
 
             // Create edges between debit and credit accounts
             for debit_line in &debits {
@@ -217,10 +209,7 @@ impl SuspenseAccountDetection {
     }
 
     /// Calculate suspense score from indicators.
-    fn calculate_suspense_score(
-        indicators: &[SuspenseIndicator],
-        metrics: &AccountMetrics,
-    ) -> f64 {
+    fn calculate_suspense_score(indicators: &[SuspenseIndicator], metrics: &AccountMetrics) -> f64 {
         let mut score = 0.0;
 
         for indicator in indicators {
@@ -403,10 +392,8 @@ impl GaapViolationDetection {
             })
             .count();
 
-        let compliance_score = (100.0
-            - (violations.len() as f64 * 2.0)
-            - (major_violations as f64 * 10.0))
-            .max(0.0);
+        let compliance_score =
+            (100.0 - (violations.len() as f64 * 2.0) - (major_violations as f64 * 10.0)).max(0.0);
 
         GaapViolationResult {
             violations,
@@ -445,8 +432,9 @@ impl GaapViolationDetection {
                             credit.account_code, debit.account_code
                         ),
                         severity: GaapViolationSeverity::Major,
-                        remediation: "Route through retained earnings or appropriate capital account"
-                            .to_string(),
+                        remediation:
+                            "Route through retained earnings or appropriate capital account"
+                                .to_string(),
                     });
                 }
             }
@@ -499,12 +487,17 @@ impl GaapViolationDetection {
     }
 
     /// Check for suspense account misuse.
-    fn check_suspense_misuse(entry: &JournalEntry, config: &GaapDetectionConfig) -> Option<GaapViolation> {
+    fn check_suspense_misuse(
+        entry: &JournalEntry,
+        config: &GaapDetectionConfig,
+    ) -> Option<GaapViolation> {
         let suspense_keywords = ["suspense", "clearing", "holding", "temporary"];
 
         for line in &entry.lines {
             let account_lower = line.account_code.to_lowercase();
-            let is_suspense = suspense_keywords.iter().any(|kw| account_lower.contains(kw));
+            let is_suspense = suspense_keywords
+                .iter()
+                .any(|kw| account_lower.contains(kw));
 
             if is_suspense {
                 let amount = line.debit.max(line.credit);
@@ -520,8 +513,9 @@ impl GaapViolationDetection {
                             amount, line.account_code
                         ),
                         severity: GaapViolationSeverity::Minor,
-                        remediation: "Clear suspense account to proper account within reporting period"
-                            .to_string(),
+                        remediation:
+                            "Clear suspense account to proper account within reporting period"
+                                .to_string(),
                     });
                 }
             }
@@ -590,8 +584,9 @@ impl GaapViolationDetection {
                             from, to
                         ),
                         severity: GaapViolationSeverity::Critical,
-                        remediation: "Review entries for potential revenue inflation or wash transactions"
-                            .to_string(),
+                        remediation:
+                            "Review entries for potential revenue inflation or wash transactions"
+                                .to_string(),
                     });
                 }
 
@@ -722,8 +717,7 @@ impl AccountGraph {
 
             // Calculate average holding period
             if metrics.first_activity > 0 && metrics.last_activity > metrics.first_activity {
-                let days =
-                    (metrics.last_activity - metrics.first_activity) as f64 / 86400.0;
+                let days = (metrics.last_activity - metrics.first_activity) as f64 / 86400.0;
                 metrics.avg_holding_days = days / metrics.transaction_count.max(1) as f64;
             }
 
@@ -839,7 +833,11 @@ mod tests {
         assert!(suspense_candidate.is_some());
 
         let candidate = suspense_candidate.unwrap();
-        assert!(candidate.indicators.contains(&SuspenseIndicator::SuspenseNaming));
+        assert!(
+            candidate
+                .indicators
+                .contains(&SuspenseIndicator::SuspenseNaming)
+        );
     }
 
     #[test]
@@ -855,7 +853,12 @@ mod tests {
 
     #[test]
     fn test_gaap_direct_revenue_expense() {
-        let entries = vec![create_test_entry(1, "SALARIES_EXPENSE", "SALES_REVENUE", 10000.0)];
+        let entries = vec![create_test_entry(
+            1,
+            "SALARIES_EXPENSE",
+            "SALES_REVENUE",
+            10000.0,
+        )];
 
         let mut account_types = HashMap::new();
         account_types.insert("SALES_REVENUE".to_string(), AccountType::Revenue);
@@ -916,7 +919,12 @@ mod tests {
 
     #[test]
     fn test_gaap_improper_asset_expense() {
-        let entries = vec![create_test_entry(1, "OFFICE_EXPENSE", "EQUIPMENT_ASSET", 15000.0)];
+        let entries = vec![create_test_entry(
+            1,
+            "OFFICE_EXPENSE",
+            "EQUIPMENT_ASSET",
+            15000.0,
+        )];
 
         let mut account_types = HashMap::new();
         account_types.insert("EQUIPMENT_ASSET".to_string(), AccountType::Asset);

crates/rustkernel-accounting/src/lib.rs

@@ -84,11 +84,7 @@ pub fn register_all(
             .metadata()
             .clone(),
     )?;
-    registry.register_metadata(
-        detection::GaapViolationDetection::new()
-            .metadata()
-            .clone(),
-    )?;
+    registry.register_metadata(detection::GaapViolationDetection::new().metadata().clone())?;
 
     tracing::info!("Registered 9 accounting kernels");
     Ok(())

crates/rustkernel-compliance/src/aml.rs

@@ -1244,10 +1244,10 @@ pub struct FlowReversalConfig {
 impl Default for FlowReversalConfig {
     fn default() -> Self {
         Self {
-            max_window_seconds: 86400, // 24 hours
+            max_window_seconds: 86400,       // 24 hours
             suspicious_window_seconds: 3600, // 1 hour
-            critical_window_seconds: 300, // 5 minutes
-            min_amount_match_ratio: 0.9, // 90% match
+            critical_window_seconds: 300,    // 5 minutes
+            min_amount_match_ratio: 0.9,     // 90% match
         }
     }
 }
@@ -1404,10 +1404,7 @@ impl FlowSplitRatio {
                     risk_level,
                 });
 
-                if matches!(
-                    risk_level,
-                    SplitRiskLevel::High | SplitRiskLevel::Critical
-                ) {
+                if matches!(risk_level, SplitRiskLevel::High | SplitRiskLevel::Critical) {
                     structuring_entities.insert(source_id);
                 }
             }
@@ -1481,7 +1478,8 @@ impl FlowSplitRatio {
     ) -> Vec<crate::types::FlowSplitPattern> {
         // Sort by risk level (highest first), then by total amount
         splits.sort_by(|a, b| {
-            let risk_ord = Self::risk_level_ord(&b.risk_level).cmp(&Self::risk_level_ord(&a.risk_level));
+            let risk_ord =
+                Self::risk_level_ord(&b.risk_level).cmp(&Self::risk_level_ord(&a.risk_level));
             if risk_ord == std::cmp::Ordering::Equal {
                 b.total_amount
                     .partial_cmp(&a.total_amount)

crates/rustkernel-graph/src/cycles.rs

@@ -268,7 +268,12 @@ impl ShortCycleParticipation {
     pub fn find_high_risk_nodes(graph: &CsrGraph) -> Vec<CycleParticipationResult> {
         Self::compute_all(graph)
             .into_iter()
-            .filter(|r| matches!(r.risk_level, CycleRiskLevel::High | CycleRiskLevel::Critical))
+            .filter(|r| {
+                matches!(
+                    r.risk_level,
+                    CycleRiskLevel::High | CycleRiskLevel::Critical
+                )
+            })
             .collect()
     }
 
@@ -300,26 +305,17 @@ mod tests {
 
     fn create_triangle_graph() -> CsrGraph {
         // Undirected triangle: 0 - 1 - 2 - 0 (bidirectional edges)
-        CsrGraph::from_edges(
-            3,
-            &[(0, 1), (1, 0), (0, 2), (2, 0), (1, 2), (2, 1)],
-        )
+        CsrGraph::from_edges(3, &[(0, 1), (1, 0), (0, 2), (2, 0), (1, 2), (2, 1)])
     }
 
     fn create_square_graph() -> CsrGraph {
         // Square: 0 -> 1 -> 2 -> 3 -> 0
-        CsrGraph::from_edges(
-            4,
-            &[(0, 1), (1, 2), (2, 3), (3, 0)],
-        )
+        CsrGraph::from_edges(4, &[(0, 1), (1, 2), (2, 3), (3, 0)])
     }
 
     fn create_reciprocal_graph() -> CsrGraph {
         // Bidirectional edges: 0 <-> 1, 1 <-> 2
-        CsrGraph::from_edges(
-            3,
-            &[(0, 1), (1, 0), (1, 2), (2, 1)],
-        )
+        CsrGraph::from_edges(3, &[(0, 1), (1, 0), (1, 2), (2, 1)])
     }
 
     fn create_complex_graph() -> CsrGraph {
@@ -328,9 +324,19 @@ mod tests {
             5,
             &[
                 // Triangle 0-1-2
-                (0, 1), (1, 0), (1, 2), (2, 1), (0, 2), (2, 0),
+                (0, 1),
+                (1, 0),
+                (1, 2),
+                (2, 1),
+                (0, 2),
+                (2, 0),
                 // Triangle 2-3-4
-                (2, 3), (3, 2), (3, 4), (4, 3), (2, 4), (4, 2),
+                (2, 3),
+                (3, 2),
+                (3, 4),
+                (4, 3),
+                (2, 4),
+                (4, 2),
             ],
         )
     }
@@ -357,17 +363,32 @@ mod tests {
         let counts = ShortCycleParticipation::detect_3_cycles(&graph);
 
         // All three nodes participate in one triangle
-        assert!(counts[0] >= 1, "Node 0 should participate in triangle: got {}", counts[0]);
-        assert!(counts[1] >= 1, "Node 1 should participate in triangle: got {}", counts[1]);
-        assert!(counts[2] >= 1, "Node 2 should participate in triangle: got {}", counts[2]);
+        assert!(
+            counts[0] >= 1,
+            "Node 0 should participate in triangle: got {}",
+            counts[0]
+        );
+        assert!(
+            counts[1] >= 1,
+            "Node 1 should participate in triangle: got {}",
+            counts[1]
+        );
+        assert!(
+            counts[2] >= 1,
+            "Node 2 should participate in triangle: got {}",
+            counts[2]
+        );
     }
 
     #[test]
     fn test_count_triangles() {
         let graph = create_triangle_graph();
         let count = ShortCycleParticipation::count_triangles(&graph);
 
-        assert_eq!(count, 1, "Should find 1 triangle in undirected triangle graph");
+        assert_eq!(
+            count, 1,
+            "Should find 1 triangle in undirected triangle graph"
+        );
     }
 
     #[test]
@@ -424,7 +445,10 @@ mod tests {
 
         assert_eq!(results.len(), 3);
         for result in &results {
-            assert!(result.cycle_count_3hop >= 1, "Each node should have at least 1 triangle participation");
+            assert!(
+                result.cycle_count_3hop >= 1,
+                "Each node should have at least 1 triangle participation"
+            );
             assert_eq!(result.cycle_count_4hop, 0);
         }
     }