kimun 0.20.0

Code metrics tool — health score, complexity, duplication, hotspots, ownership
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

use std::collections::HashMap;

use super::*;

fn make_blame(author: &str, email: &str, lines: usize, time: i64) -> BlameInfo {
    BlameInfo {
        author: author.to_string(),
        email: email.to_string(),
        lines,
        last_commit_time: time,
    }
}

#[test]
fn test_critical_single_owner() {
    let blames = vec![make_blame("Alice", "alice@x.com", 90, 100)];
    let recent = HashSet::from(["alice@x.com".to_string()]);
    let result = compute_ownership(PathBuf::from("a.rs"), "Rust", &blames, &recent);

    assert_eq!(result.risk, RiskLevel::Critical);
    assert_eq!(result.primary_owner, "Alice");
    assert!((result.ownership_pct - 100.0).abs() < 0.01);
    assert!(!result.knowledge_loss);
}

#[test]
fn test_high_risk() {
    let blames = vec![
        make_blame("Alice", "alice@x.com", 70, 100),
        make_blame("Bob", "bob@x.com", 30, 100),
    ];
    let recent = HashSet::new();
    let result = compute_ownership(PathBuf::from("a.rs"), "Rust", &blames, &recent);
    assert_eq!(result.risk, RiskLevel::High);
}

#[test]
fn test_medium_risk() {
    let blames = vec![
        make_blame("Alice", "alice@x.com", 50, 100),
        make_blame("Bob", "bob@x.com", 40, 100),
        make_blame("Carol", "carol@x.com", 10, 100),
    ];
    let recent = HashSet::new();
    let result = compute_ownership(PathBuf::from("a.rs"), "Rust", &blames, &recent);
    assert_eq!(result.risk, RiskLevel::Medium);
}

#[test]
fn test_low_risk() {
    let blames = vec![
        make_blame("Alice", "alice@x.com", 25, 100),
        make_blame("Bob", "bob@x.com", 25, 100),
        make_blame("Carol", "carol@x.com", 25, 100),
        make_blame("Dan", "dan@x.com", 25, 100),
    ];
    let recent = HashSet::new();
    let result = compute_ownership(PathBuf::from("a.rs"), "Rust", &blames, &recent);
    assert_eq!(result.risk, RiskLevel::Low);
}

#[test]
fn test_knowledge_loss_detected() {
    let blames = vec![make_blame("Alice", "alice@x.com", 100, 100)];
    // Alice is NOT in recent authors → knowledge loss
    let recent = HashSet::from(["bob@x.com".to_string()]);
    let result = compute_ownership(PathBuf::from("a.rs"), "Rust", &blames, &recent);
    assert!(result.knowledge_loss);
}

#[test]
fn test_no_knowledge_loss_when_no_since() {
    let blames = vec![make_blame("Alice", "alice@x.com", 100, 100)];
    // Empty recent_authors means --since was not used → no knowledge loss check
    let recent = HashSet::new();
    let result = compute_ownership(PathBuf::from("a.rs"), "Rust", &blames, &recent);
    assert!(!result.knowledge_loss);
}

#[test]
fn test_empty_blames() {
    let blames: Vec<BlameInfo> = vec![];
    let recent = HashSet::new();
    let result = compute_ownership(PathBuf::from("a.rs"), "Rust", &blames, &recent);
    assert_eq!(result.total_lines, 0);
    assert_eq!(result.risk, RiskLevel::Low);
}

#[test]
fn test_contributors_count() {
    let blames = vec![
        make_blame("Alice", "alice@x.com", 50, 100),
        make_blame("Bob", "bob@x.com", 50, 100),
    ];
    let recent = HashSet::new();
    let result = compute_ownership(PathBuf::from("a.rs"), "Rust", &blames, &recent);
    assert_eq!(result.contributors, 2);
}

// --- bus factor tests ---

fn author_map(entries: &[(&str, usize)]) -> HashMap<String, usize> {
    entries.iter().map(|(k, v)| (k.to_string(), *v)).collect()
}

#[test]
fn bus_factor_single_dominant_owner() {
    // One person owns 90% → bus factor = 1
    let map = author_map(&[("Alice", 90), ("Bob", 10)]);
    let bf = compute_bus_factor(&map, 80.0);
    assert_eq!(bf.factor, 1);
    assert_eq!(bf.total_lines, 100);
    assert!(bf.contributors[0].is_critical);
    assert!(!bf.contributors[1].is_critical);
}

#[test]
fn bus_factor_two_owners_needed() {
    // Alice 69%, Carol 20%, Bob 11% → sorted: Alice, Carol, Bob
    // Alice alone: 69% < 80%, Alice+Carol: 89% ≥ 80% → bus factor = 2
    let map = author_map(&[("Alice", 69), ("Bob", 11), ("Carol", 20)]);
    let bf = compute_bus_factor(&map, 80.0);
    assert_eq!(bf.factor, 2);
    assert_eq!(bf.contributors[0].author, "Alice");
    assert_eq!(bf.contributors[1].author, "Carol");
}

#[test]
fn bus_factor_exact_threshold() {
    // Alice owns exactly 80% → bus factor = 1
    let map = author_map(&[("Alice", 80), ("Bob", 20)]);
    let bf = compute_bus_factor(&map, 80.0);
    assert_eq!(bf.factor, 1);
}

#[test]
fn bus_factor_empty() {
    let map = author_map(&[]);
    let bf = compute_bus_factor(&map, 80.0);
    assert_eq!(bf.factor, 0);
    assert_eq!(bf.total_lines, 0);
    assert!(bf.contributors.is_empty());
}

#[test]
fn bus_factor_cumulative_pct_reaches_100() {
    let map = author_map(&[("Alice", 50), ("Bob", 50)]);
    let bf = compute_bus_factor(&map, 80.0);
    let last = bf.contributors.last().unwrap();
    assert!((last.cumulative_pct - 100.0).abs() < 0.01);
}

#[test]
fn bus_factor_contributors_sorted_descending() {
    let map = author_map(&[("C", 10), ("A", 50), ("B", 40)]);
    let bf = compute_bus_factor(&map, 80.0);
    assert_eq!(bf.contributors[0].author, "A");
    assert_eq!(bf.contributors[1].author, "B");
    assert_eq!(bf.contributors[2].author, "C");
}