pmat 3.11.0

PMAT - Zero-config AI context generation and code quality toolkit (CLI, MCP, HTTP)
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

// Tests for internal data structures and edge cases
// Included by parallel_louvain.rs - shares parent scope

#[cfg_attr(coverage_nightly, coverage(off))]
#[cfg(test)]
mod tests_internals {
    use super::*;
    use crate::graph::types::{NodeData, Symbol, SymbolKind, Visibility};
    use std::path::PathBuf;

    fn create_test_node(name: &str) -> NodeData {
        NodeData {
            path: PathBuf::from(format!("{}.rs", name)),
            module: name.to_string(),
            symbols: vec![Symbol {
                name: name.to_string(),
                kind: SymbolKind::Function,
                visibility: Visibility::Public,
                line: 1,
            }],
            loc: 100,
            complexity: 5.0,
            ast_hash: 12345,
        }
    }

    fn create_two_community_graph() -> UndirectedGraph {
        let mut graph = UndirectedGraph::new();
        let nodes: Vec<_> = (0..6)
            .map(|i| graph.add_node(create_test_node(&format!("node{}", i))))
            .collect();

        graph.add_edge(nodes[0], nodes[1], 1.0);
        graph.add_edge(nodes[1], nodes[2], 1.0);
        graph.add_edge(nodes[0], nodes[2], 1.0);
        graph.add_edge(nodes[3], nodes[4], 1.0);
        graph.add_edge(nodes[4], nodes[5], 1.0);
        graph.add_edge(nodes[3], nodes[5], 1.0);
        graph.add_edge(nodes[2], nodes[3], 0.1);

        graph
    }

    fn create_chain_graph(n: usize) -> UndirectedGraph {
        let mut graph = UndirectedGraph::new();
        let nodes: Vec<_> = (0..n)
            .map(|i| graph.add_node(create_test_node(&format!("node{}", i))))
            .collect();
        for i in 0..n - 1 {
            graph.add_edge(nodes[i], nodes[i + 1], 1.0);
        }
        graph
    }

    fn create_complete_graph(n: usize) -> UndirectedGraph {
        let mut graph = UndirectedGraph::new();
        let nodes: Vec<_> = (0..n)
            .map(|i| graph.add_node(create_test_node(&format!("node{}", i))))
            .collect();
        for i in 0..n {
            for j in i + 1..n {
                graph.add_edge(nodes[i], nodes[j], 1.0);
            }
        }
        graph
    }

    // ============ Num Communities Tests ============

    #[test]
    fn test_num_communities_empty() {
        let communities: Vec<usize> = vec![];
        assert_eq!(ParallelLouvain::num_communities(&communities), 0);
    }

    #[test]
    fn test_num_communities_single() {
        let communities = vec![0, 0, 0, 0];
        assert_eq!(ParallelLouvain::num_communities(&communities), 1);
    }

    #[test]
    fn test_num_communities_multiple() {
        let communities = vec![0, 1, 2, 0, 1, 2];
        assert_eq!(ParallelLouvain::num_communities(&communities), 3);
    }

    #[test]
    fn test_num_communities_non_contiguous() {
        let communities = vec![0, 5, 10, 5, 0];
        assert_eq!(ParallelLouvain::num_communities(&communities), 3);
    }

    // ============ Renumbering Tests ============

    #[test]
    fn test_renumber_already_contiguous() {
        let louvain = ParallelLouvain::new();
        let mut communities = vec![0, 1, 2, 0, 1, 2];
        louvain.renumber_communities(&mut communities);

        // Should still be valid after renumbering
        assert_eq!(ParallelLouvain::num_communities(&communities), 3);
        assert!(communities.iter().all(|&c| c < 3));
    }

    #[test]
    fn test_renumber_non_contiguous() {
        let louvain = ParallelLouvain::new();
        let mut communities = vec![10, 20, 10, 30, 20];
        louvain.renumber_communities(&mut communities);

        // Should be renumbered to 0, 1, 2
        assert_eq!(ParallelLouvain::num_communities(&communities), 3);
        assert!(communities.iter().all(|&c| c < 3));

        // Same original community should still be same
        assert_eq!(communities[0], communities[2]); // Originally both 10
        assert_eq!(communities[1], communities[4]); // Originally both 20
    }

    #[test]
    fn test_renumber_empty() {
        let louvain = ParallelLouvain::new();
        let mut communities: Vec<usize> = vec![];
        louvain.renumber_communities(&mut communities);
        assert!(communities.is_empty());
    }

    // ============ GraphData Tests ============

    #[test]
    fn test_graph_data_from_empty() {
        let graph = UndirectedGraph::new();
        let data = GraphData::from_graph(&graph);

        assert_eq!(data.n, 0);
        assert!(data.neighbors.is_empty());
        assert!(data.degrees.is_empty());
        assert_eq!(data.total_weight, 0.0);
    }

    #[test]
    fn test_graph_data_from_two_node_graph() {
        let mut graph = UndirectedGraph::new();
        let n0 = graph.add_node(create_test_node("a"));
        let n1 = graph.add_node(create_test_node("b"));
        graph.add_edge(n0, n1, 2.5);

        let data = GraphData::from_graph(&graph);

        assert_eq!(data.n, 2);
        assert_eq!(data.total_weight, 2.5);
        assert_eq!(data.degrees[0], 2.5);
        assert_eq!(data.degrees[1], 2.5);
        assert_eq!(data.neighbors[0].len(), 1);
        assert_eq!(data.neighbors[1].len(), 1);
    }

    #[test]
    fn test_graph_data_neighbor_weight_to_community() {
        let graph = create_two_community_graph();
        let data = GraphData::from_graph(&graph);
        let communities = vec![0, 0, 0, 1, 1, 1];

        // Node 2 has edges to nodes 0, 1 (same community) and node 3 (different)
        let weight_to_same = data.neighbor_weight_to_community(2, 0, &communities);
        let weight_to_other = data.neighbor_weight_to_community(2, 1, &communities);

        assert!(weight_to_same > 0.0, "Should have weight to own community");
        assert!(
            weight_to_other > 0.0,
            "Should have weight to other community via bridge"
        );
    }

    // ============ CommunityData Tests ============

    #[test]
    fn test_community_data_new() {
        let graph = create_two_community_graph();
        let data = GraphData::from_graph(&graph);
        let communities = vec![0, 0, 0, 1, 1, 1];

        let comm_data = CommunityData::new(&communities, &data);

        assert_eq!(comm_data.node_to_community.len(), 6);
        assert!(comm_data.community_degrees.contains_key(&0));
        assert!(comm_data.community_degrees.contains_key(&1));
    }

    // ============ Convergence Tests ============

    #[test]
    fn test_max_iterations_limit() {
        let graph = create_chain_graph(10);
        let louvain = ParallelLouvain::new().with_max_iterations(1);
        let communities = louvain.detect(&graph);

        // Should still return valid communities even with 1 iteration
        assert_eq!(communities.len(), 10);
    }

    // ============ Edge Weight Tests ============

    #[test]
    fn test_equal_weights() {
        let graph = create_complete_graph(4);
        let louvain = ParallelLouvain::new();
        let communities = louvain.detect(&graph);

        // With equal weights, behavior depends on algorithm specifics
        assert_eq!(communities.len(), 4);
    }

    // ============ Edge Cases ============

    #[test]
    fn test_self_loop_handling() {
        let mut graph = UndirectedGraph::new();
        let n0 = graph.add_node(create_test_node("node0"));
        let n1 = graph.add_node(create_test_node("node1"));
        graph.add_edge(n0, n1, 1.0);

        let louvain = ParallelLouvain::new();
        let communities = louvain.detect(&graph);

        assert_eq!(communities.len(), 2);
    }

    #[test]
    fn test_negative_weight_handling() {
        let mut graph = UndirectedGraph::new();
        let n0 = graph.add_node(create_test_node("node0"));
        let n1 = graph.add_node(create_test_node("node1"));
        graph.add_edge(n0, n1, 0.0);

        let louvain = ParallelLouvain::new();
        let communities = louvain.detect(&graph);

        assert_eq!(communities.len(), 2);
    }

    #[test]
    fn test_very_small_weights() {
        let mut graph = UndirectedGraph::new();
        let n0 = graph.add_node(create_test_node("node0"));
        let n1 = graph.add_node(create_test_node("node1"));
        graph.add_edge(n0, n1, 1e-10);

        let louvain = ParallelLouvain::new();
        let communities = louvain.detect(&graph);

        assert_eq!(communities.len(), 2);
    }

    #[test]
    fn test_very_large_weights() {
        let mut graph = UndirectedGraph::new();
        let n0 = graph.add_node(create_test_node("node0"));
        let n1 = graph.add_node(create_test_node("node1"));
        graph.add_edge(n0, n1, 1e10);

        let louvain = ParallelLouvain::new();
        let communities = louvain.detect(&graph);

        assert_eq!(communities.len(), 2);
        // Large weight should keep them together
        assert_eq!(communities[0], communities[1]);
    }
}