batuta 0.7.3

Sovereign AI orchestration: autonomous agents, ML serving, code analysis, and transpilation pipelines
Documentation
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
use super::*;
use crate::stack::quality::{QualityGrade, StackLayer};

// ========================================================================
// Test helpers
// ========================================================================

/// Build a healthy component with slight per-index variation
fn make_healthy_component(name: impl Into<String>, offset: f64) -> ComponentNode {
    let mut node = ComponentNode::new(name, "1.0", StackLayer::Compute);
    node.metrics = ComponentMetrics {
        demo_score: 90.0 + offset,
        coverage: 85.0 + offset,
        mutation_score: 80.0,
        complexity_avg: 5.0,
        satd_count: 2,
        dead_code_pct: 1.0,
        grade: QualityGrade::A,
    };
    node
}

/// Build an anomalous component with metrics that deviate strongly
fn make_anomalous_component(name: impl Into<String>) -> ComponentNode {
    let mut node = ComponentNode::new(name, "1.0", StackLayer::Ml);
    node.metrics = ComponentMetrics {
        demo_score: 30.0,
        coverage: 20.0,
        mutation_score: 10.0,
        complexity_avg: 25.0,
        satd_count: 50,
        dead_code_pct: 30.0,
        grade: QualityGrade::F,
    };
    node
}

// ========================================================================
// Isolation Forest Tests
// ========================================================================

#[test]
fn test_isolation_forest_new() {
    let forest = IsolationForest::new(10, 32, 42);
    assert_eq!(forest.n_trees, 10);
    assert_eq!(forest.sample_size, 32);
    assert_eq!(forest.seed, 42);
}

#[test]
fn test_isolation_forest_default() {
    let forest = IsolationForest::default_forest();
    assert_eq!(forest.n_trees, 100);
    assert_eq!(forest.sample_size, 256);
}

#[test]
fn test_isolation_forest_with_feature_names() {
    let forest = IsolationForest::new(10, 32, 42)
        .with_feature_names(vec!["demo_score".into(), "coverage".into()]);
    assert_eq!(forest.feature_names.len(), 2);
}

#[test]
fn test_isolation_forest_fit_empty() {
    let mut forest = IsolationForest::new(10, 32, 42);
    forest.fit(&[]);
    assert!(forest.trees.is_empty());
}

#[test]
fn test_isolation_forest_fit() {
    let mut forest = IsolationForest::new(10, 32, 42);
    let data = vec![
        vec![90.0, 85.0, 80.0],
        vec![88.0, 82.0, 78.0],
        vec![92.0, 88.0, 82.0],
        vec![85.0, 80.0, 75.0],
    ];
    forest.fit(&data);
    assert_eq!(forest.trees.len(), 10);
}

#[test]
fn test_isolation_forest_score_empty() {
    let forest = IsolationForest::new(10, 32, 42);
    let scores = forest.score(&[vec![90.0, 85.0]]);
    assert_eq!(scores, vec![0.0]); // No trees fitted
}

#[test]
fn test_isolation_forest_score() {
    let mut forest = IsolationForest::new(10, 32, 42);
    let data = vec![
        vec![90.0, 85.0],
        vec![88.0, 82.0],
        vec![92.0, 88.0],
        vec![10.0, 5.0], // Anomaly
    ];
    forest.fit(&data);
    let scores = forest.score(&data);

    assert_eq!(scores.len(), 4);
    // All scores should be in [0, 1]
    for score in &scores {
        assert!(*score >= 0.0 && *score <= 1.0);
    }
}

#[test]
fn test_isolation_forest_predict() {
    let mut forest = IsolationForest::new(10, 32, 42);
    let data = vec![vec![90.0, 85.0], vec![88.0, 82.0], vec![92.0, 88.0]];
    forest.fit(&data);
    let predictions = forest.predict(&data, 0.5);
    assert_eq!(predictions.len(), 3);
}

#[test]
fn test_isolation_forest_detect_anomalies_empty() {
    let forest = IsolationForest::default_forest();
    let diag = StackDiagnostics::new();
    let anomalies = forest.detect_anomalies(&diag, 0.5);
    assert!(anomalies.is_empty());
}

#[test]
fn test_isolation_forest_detect_anomalies() {
    let mut forest = IsolationForest::new(50, 64, 42);
    let mut diag = StackDiagnostics::new();

    // Add normal components
    for i in 0..5 {
        diag.add_component(make_healthy_component(format!("healthy{i}"), i as f64));
    }

    // Add anomalous component
    diag.add_component(make_anomalous_component("anomalous"));

    // Train on component data
    let data: Vec<Vec<f64>> = diag.components().map(|c| extract_features(&c.metrics)).collect();
    forest.fit(&data);

    // Should detect at least something (may or may not flag anomaly depending on threshold)
    let anomalies = forest.detect_anomalies(&diag, 0.3);
    // Just verify it runs without error
    assert!(anomalies.len() <= 6);
}

#[test]
fn test_isolation_forest_categorize_anomaly() {
    let forest = IsolationForest::default_forest();

    // Low demo score -> QualityRegression
    let cat1 = forest.categorize_anomaly(&[50.0, 80.0, 75.0, 5.0, 2.0, 1.0]);
    assert_eq!(cat1, AnomalyCategory::QualityRegression);

    // Low coverage -> CoverageDrop
    let cat2 = forest.categorize_anomaly(&[80.0, 40.0, 75.0, 5.0, 2.0, 1.0]);
    assert_eq!(cat2, AnomalyCategory::CoverageDrop);

    // High complexity -> ComplexityIncrease
    let cat3 = forest.categorize_anomaly(&[80.0, 80.0, 75.0, 20.0, 2.0, 1.0]);
    assert_eq!(cat3, AnomalyCategory::ComplexityIncrease);

    // High dead code -> DependencyRisk
    let cat4 = forest.categorize_anomaly(&[80.0, 80.0, 75.0, 5.0, 2.0, 15.0]);
    assert_eq!(cat4, AnomalyCategory::DependencyRisk);

    // Normal -> Other
    let cat5 = forest.categorize_anomaly(&[90.0, 90.0, 85.0, 5.0, 2.0, 1.0]);
    assert_eq!(cat5, AnomalyCategory::Other);
}

#[test]
fn test_average_path_length() {
    assert_eq!(average_path_length(0.0), 0.0);
    assert_eq!(average_path_length(1.0), 0.0);

    // For n=2, c(n) ≈ 1
    let c2 = average_path_length(2.0);
    assert!(c2 > 0.0 && c2 < 2.0);

    // For larger n, c(n) grows logarithmically
    let c256 = average_path_length(256.0);
    assert!(c256 > c2);
}

// ========================================================================
// Error Forecaster Tests
// ========================================================================

#[test]
fn test_error_forecaster_new() {
    let forecaster = ErrorForecaster::new(0.5);
    assert_eq!(forecaster.alpha, 0.5);
    assert!(forecaster.history().is_empty());
}

#[test]
fn test_error_forecaster_alpha_clamp() {
    let f1 = ErrorForecaster::new(-0.5);
    assert_eq!(f1.alpha, 0.0);

    let f2 = ErrorForecaster::new(1.5);
    assert_eq!(f2.alpha, 1.0);
}

#[test]
fn test_error_forecaster_default() {
    let forecaster = ErrorForecaster::default_forecaster();
    assert_eq!(forecaster.alpha, 0.3);
}

#[test]
fn test_error_forecaster_observe() {
    let mut forecaster = ErrorForecaster::new(0.5);
    forecaster.observe(100.0);
    assert_eq!(forecaster.current_level(), 100.0);
    assert_eq!(forecaster.history().len(), 1);

    forecaster.observe(80.0);
    // Level = 0.5 * 80 + 0.5 * 100 = 90
    assert_eq!(forecaster.current_level(), 90.0);
    assert_eq!(forecaster.history().len(), 2);
}

#[test]
fn test_error_forecaster_forecast() {
    let mut forecaster = ErrorForecaster::new(0.3);
    forecaster.observe(100.0);
    forecaster.observe(90.0);
    forecaster.observe(85.0);

    let forecast = forecaster.forecast(5);
    assert_eq!(forecast.len(), 5);
    // All forecasts should be the same (simple exponential smoothing)
    let level = forecaster.current_level();
    for f in &forecast {
        assert_eq!(*f, level);
    }
}

#[test]
fn test_error_forecaster_error_metrics_empty() {
    let forecaster = ErrorForecaster::new(0.3);
    let metrics = forecaster.error_metrics();
    assert_eq!(metrics.mae, 0.0);
    assert_eq!(metrics.mse, 0.0);
    assert_eq!(metrics.rmse, 0.0);
}

#[test]
fn test_error_forecaster_error_metrics_single() {
    let mut forecaster = ErrorForecaster::new(0.3);
    forecaster.observe(100.0);
    let metrics = forecaster.error_metrics();
    assert_eq!(metrics.mae, 0.0); // Not enough data
}

#[test]
fn test_error_forecaster_error_metrics() {
    let mut forecaster = ErrorForecaster::new(0.5);
    forecaster.observe(100.0);
    forecaster.observe(110.0);
    forecaster.observe(105.0);
    forecaster.observe(108.0);

    let metrics = forecaster.error_metrics();
    assert!(metrics.mae >= 0.0);
    assert!(metrics.mse >= 0.0);
    assert!(metrics.rmse >= 0.0);
    assert_eq!(metrics.rmse, metrics.mse.sqrt());
}

#[test]
fn test_error_forecaster_exponential_smoothing() {
    // Test the exponential smoothing formula
    let mut forecaster = ErrorForecaster::new(0.3);
    forecaster.observe(100.0); // Level = 100
    forecaster.observe(130.0); // Level = 0.3*130 + 0.7*100 = 39 + 70 = 109
    forecaster.observe(100.0); // Level = 0.3*100 + 0.7*109 = 30 + 76.3 = 106.3

    let level = forecaster.current_level();
    assert!((level - 106.3).abs() < 0.01);
}

#[test]
fn test_forecast_metrics_default() {
    let metrics = ForecastMetrics::default();
    assert_eq!(metrics.mae, 0.0);
    assert_eq!(metrics.mse, 0.0);
    assert_eq!(metrics.rmse, 0.0);
    assert_eq!(metrics.mape, 0.0);
}

// ========================================================================
// Additional coverage tests
// ========================================================================

#[test]
fn test_extract_features() {
    let metrics = ComponentMetrics {
        demo_score: 85.0,
        coverage: 90.0,
        mutation_score: 75.0,
        complexity_avg: 8.0,
        satd_count: 5,
        dead_code_pct: 2.0,
        grade: QualityGrade::A,
    };
    let features = extract_features(&metrics);
    assert_eq!(features.len(), 6);
    assert_eq!(features[0], 85.0); // demo_score
    assert_eq!(features[1], 90.0); // coverage
    assert_eq!(features[2], 75.0); // mutation_score
    assert_eq!(features[3], 8.0); // complexity_avg
    assert_eq!(features[4], 5.0); // satd_count
    assert_eq!(features[5], 2.0); // dead_code_pct
}

#[test]
fn test_rule_matches_below() {
    let rule = &CATEGORY_RULES[0]; // FEAT_DEMO_SCORE < 70
    let features = vec![60.0, 80.0, 80.0, 5.0, 2.0, 1.0];
    assert!(rule_matches(rule, &features));

    let features_above = vec![80.0, 80.0, 80.0, 5.0, 2.0, 1.0];
    assert!(!rule_matches(rule, &features_above));
}

#[test]
fn test_rule_matches_above() {
    let rule = &CATEGORY_RULES[2]; // FEAT_COMPLEXITY > 15
    let features_high = vec![80.0, 80.0, 80.0, 20.0, 2.0, 1.0];
    assert!(rule_matches(rule, &features_high));

    let features_low = vec![80.0, 80.0, 80.0, 5.0, 2.0, 1.0];
    assert!(!rule_matches(rule, &features_low));
}

#[test]
fn test_find_matching_rule_quality_regression() {
    let features = vec![50.0, 80.0, 75.0, 5.0, 2.0, 1.0];
    let rule = find_matching_rule(&features);
    assert!(rule.is_some());
    assert_eq!(rule.unwrap().category, AnomalyCategory::QualityRegression);
}

#[test]
fn test_find_matching_rule_none() {
    let features = vec![90.0, 90.0, 85.0, 5.0, 2.0, 1.0];
    let rule = find_matching_rule(&features);
    assert!(rule.is_none());
}

#[test]
fn test_render_description() {
    let template = "Quality score {val:.1} is below threshold";
    let features = vec![50.5, 80.0, 75.0, 5.0, 2.0, 1.0];
    let desc = render_description(template, &features, 0);
    assert!(desc.contains("50.5"));
}

#[test]
fn test_simple_rng_seed() {
    let rng1 = SimpleRng::seed_from_u64(42);
    let rng2 = SimpleRng::seed_from_u64(42);
    assert_eq!(rng1.state, rng2.state);
}

#[test]
fn test_simple_rng_next_u64() {
    let mut rng = SimpleRng::seed_from_u64(42);
    let v1 = rng.next_u64();
    let v2 = rng.next_u64();
    assert_ne!(v1, v2);
}

#[test]
fn test_simple_rng_gen_range() {
    let mut rng = SimpleRng::seed_from_u64(42);
    for _ in 0..100 {
        let val = rng.gen_range(0..10);
        assert!(val < 10);
    }
}

#[test]
fn test_simple_rng_gen_range_empty() {
    let mut rng = SimpleRng::seed_from_u64(42);
    let val = rng.gen_range(5..5);
    assert_eq!(val, 5);
}

#[test]
fn test_simple_rng_gen_range_f64() {
    let mut rng = SimpleRng::seed_from_u64(42);
    for _ in 0..100 {
        let val = rng.gen_range_f64(0.0..1.0);
        assert!((0.0..1.0).contains(&val));
    }
}

#[test]
fn test_isolation_forest_describe_anomaly_short_features() {
    let forest = IsolationForest::default_forest();
    let desc = forest.describe_anomaly(&[50.0], &AnomalyCategory::QualityRegression);
    assert!(desc.contains("Unusual metric combination"));
}

#[test]
fn test_isolation_forest_describe_anomaly_mismatch() {
    let forest = IsolationForest::default_forest();
    // Features trigger QualityRegression but we ask for CoverageDrop
    let features = vec![50.0, 80.0, 75.0, 5.0, 2.0, 1.0];
    let desc = forest.describe_anomaly(&features, &AnomalyCategory::CoverageDrop);
    assert!(desc.contains("Unusual metric combination"));
}

#[test]
fn test_isolation_forest_recommend_action_quality_low_coverage() {
    let forest = IsolationForest::default_forest();
    let features = vec![50.0, 60.0, 75.0, 5.0, 2.0, 1.0]; // Low quality AND coverage < 80
    let rec = forest.recommend_action(&AnomalyCategory::QualityRegression, &features);
    assert!(rec.contains("coverage above 80"));
}

#[test]
fn test_isolation_forest_recommend_action_quality_high_coverage() {
    let forest = IsolationForest::default_forest();
    let features = vec![50.0, 85.0, 75.0, 5.0, 2.0, 1.0]; // Low quality but coverage >= 80
    let rec = forest.recommend_action(&AnomalyCategory::QualityRegression, &features);
    assert!(rec.contains("Review recent changes"));
}

#[test]
fn test_isolation_forest_recommend_action_fallback() {
    let forest = IsolationForest::default_forest();
    let features = vec![90.0, 90.0, 85.0, 5.0, 2.0, 1.0]; // All healthy
    let rec = forest.recommend_action(&AnomalyCategory::Other, &features);
    assert!(rec.contains("unusual patterns"));
}

#[test]
fn test_isolation_forest_categorize_short_features() {
    let forest = IsolationForest::default_forest();
    let cat = forest.categorize_anomaly(&[50.0, 80.0]);
    assert_eq!(cat, AnomalyCategory::Other);
}

#[test]
fn test_isolation_tree_external_node() {
    let mut rng = SimpleRng::seed_from_u64(42);
    let tree = IsolationTree::build(&[], 10, &mut rng);
    match tree {
        IsolationTree::External { size } => assert_eq!(size, 0),
        _ => panic!("Expected External node for empty data"),
    }
}

#[test]
fn test_isolation_tree_single_point() {
    let mut rng = SimpleRng::seed_from_u64(42);
    let data = vec![vec![1.0, 2.0, 3.0]];
    let tree = IsolationTree::build(&data, 10, &mut rng);
    match tree {
        IsolationTree::External { size } => assert_eq!(size, 1),
        _ => panic!("Expected External node for single point"),
    }
}

#[test]
fn test_isolation_tree_empty_features() {
    let mut rng = SimpleRng::seed_from_u64(42);
    let data = vec![vec![], vec![]];
    let tree = IsolationTree::build(&data, 10, &mut rng);
    match tree {
        IsolationTree::External { size } => assert_eq!(size, 2),
        _ => panic!("Expected External node for empty features"),
    }
}

#[test]
fn test_isolation_tree_constant_values() {
    let mut rng = SimpleRng::seed_from_u64(42);
    let data = vec![vec![5.0, 5.0], vec![5.0, 5.0], vec![5.0, 5.0]];
    let tree = IsolationTree::build(&data, 10, &mut rng);
    // Constant values -> External (can't split)
    match tree {
        IsolationTree::External { size } => assert_eq!(size, 3),
        _ => panic!("Expected External node for constant values"),
    }
}

#[test]
fn test_isolation_tree_path_length_external() {
    let tree = IsolationTree::External { size: 10 };
    let point = vec![1.0, 2.0];
    let path = tree.path_length(&point, 0);
    assert!(path > 0);
}

#[test]
fn test_isolation_forest_score_empty_data() {
    let mut forest = IsolationForest::new(10, 32, 42);
    forest.fit(&[vec![1.0, 2.0], vec![3.0, 4.0]]);
    let scores = forest.score(&[]);
    assert!(scores.is_empty());
}

#[test]
fn test_forecast_metrics_fields() {
    let metrics = ForecastMetrics { mae: 1.5, mse: 2.25, rmse: 1.5, mape: 5.0 };
    assert_eq!(metrics.mae, 1.5);
    assert_eq!(metrics.mse, 2.25);
    assert_eq!(metrics.rmse, 1.5);
    assert_eq!(metrics.mape, 5.0);
}

#[test]
fn test_error_forecaster_history() {
    let mut forecaster = ErrorForecaster::new(0.5);
    forecaster.observe(100.0);
    forecaster.observe(200.0);
    let history = forecaster.history();
    assert_eq!(history.len(), 2);
    assert_eq!(history[0], 100.0);
    assert_eq!(history[1], 200.0);
}

#[test]
fn test_error_forecaster_mape_with_zeros() {
    let mut forecaster = ErrorForecaster::new(0.5);
    forecaster.observe(0.0);
    forecaster.observe(0.0);
    forecaster.observe(1.0);
    let metrics = forecaster.error_metrics();
    // MAPE should be NaN when there are zeros in history
    assert!(metrics.mape.is_nan());
}

#[test]
fn test_category_rule_coverage_drop() {
    let features = vec![80.0, 40.0, 75.0, 5.0, 2.0, 1.0]; // Low coverage
    let rule = find_matching_rule(&features);
    assert!(rule.is_some());
    assert_eq!(rule.unwrap().category, AnomalyCategory::CoverageDrop);
}

#[test]
fn test_category_rule_dependency_risk() {
    let features = vec![80.0, 80.0, 75.0, 5.0, 2.0, 15.0]; // High dead code
    let rule = find_matching_rule(&features);
    assert!(rule.is_some());
    assert_eq!(rule.unwrap().category, AnomalyCategory::DependencyRisk);
}