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

#![cfg_attr(coverage_nightly, coverage(off))]
#[cfg(test)]
mod tests {
    use crate::models::dag::{DependencyGraph, Edge, EdgeType, NodeInfo, NodeType};
    use crate::services::mermaid_generator::{MermaidGenerator, MermaidOptions};
    use proptest::prelude::*;

    // Strategy for generating valid node IDs
    fn node_id_strategy() -> impl Strategy<Value = String> {
        prop::string::string_regex("[a-zA-Z][a-zA-Z0-9_]{0,50}").unwrap()
    }

    // Strategy for generating labels with special characters
    fn label_strategy() -> impl Strategy<Value = String> {
        prop::string::string_regex(".{0,100}").unwrap()
    }

    // Strategy for generating node types
    fn node_type_strategy() -> impl Strategy<Value = NodeType> {
        prop_oneof![
            Just(NodeType::Function),
            Just(NodeType::Class),
            Just(NodeType::Module),
            Just(NodeType::Trait),
            Just(NodeType::Interface),
        ]
    }

    // Strategy for generating edge types
    fn edge_type_strategy() -> impl Strategy<Value = EdgeType> {
        prop_oneof![
            Just(EdgeType::Calls),
            Just(EdgeType::Imports),
            Just(EdgeType::Inherits),
            Just(EdgeType::Implements),
            Just(EdgeType::Uses),
        ]
    }

    // Strategy for generating nodes
    fn node_strategy() -> impl Strategy<Value = NodeInfo> {
        (
            node_id_strategy(),
            label_strategy(),
            node_type_strategy(),
            prop::string::string_regex("[a-zA-Z0-9_/\\.]{1,50}\\.rs").unwrap(),
            0usize..10000,
            0u32..100,
        )
            .prop_map(
                |(id, label, node_type, file_path, line_number, complexity)| NodeInfo {
                    id,
                    label,
                    node_type,
                    file_path,
                    line_number,
                    complexity,
                    metadata: rustc_hash::FxHashMap::default(),
                },
            )
    }

    proptest! {
        #![proptest_config(ProptestConfig::with_cases(100))]

        #[test]
        fn mermaid_generation_never_panics(
            nodes in prop::collection::vec(node_strategy(), 0..100)
        ) {
            let mut graph = DependencyGraph::new();
            let node_ids: Vec<String> = nodes.iter().map(|n| n.id.clone()).collect();

            // Add nodes
            for node in nodes {
                graph.add_node(node);
            }

            // Add some edges
            if node_ids.len() >= 2 {
                let edge_count = node_ids.len().min(20);
                for i in 0..edge_count {
                    let from_idx = i % node_ids.len();
                    let to_idx = (i * 3 + 1) % node_ids.len();
                    if from_idx != to_idx {
                        graph.add_edge(Edge {
                            from: node_ids[from_idx].clone(),
                            to: node_ids[to_idx].clone(),
                            edge_type: EdgeType::Calls,
                            weight: 1,
                        });
                    }
                }
            }

            let generator = MermaidGenerator::new(MermaidOptions::default());

            // Should not panic
            let result = std::panic::catch_unwind(std::panic::AssertUnwindSafe(|| {
                generator.generate(&graph)
            }));

            prop_assert!(result.is_ok());

            if let Ok(output) = result {
                // Basic validation
                prop_assert!(output.starts_with("graph TD\n"));
            }
        }

        #[test]
        fn escaped_labels_are_valid(
            label in label_strategy()
        ) {
            let mut graph = DependencyGraph::new();

            graph.add_node(NodeInfo {
                id: "test_node".to_string(),
                label: label.clone(),
                node_type: NodeType::Function,
                file_path: "test.rs".to_string(),
                line_number: 1,
                complexity: 5,
                metadata: rustc_hash::FxHashMap::default(),
            });

            let generator = MermaidGenerator::new(MermaidOptions {
                show_complexity: true,
                ..Default::default()
            });

            let output = generator.generate(&graph);

            // Should contain the node
            prop_assert!(output.contains("test_node"));

            // Should not have unescaped special characters in the output
            if output.contains("[") {
                // Find the label content
                let lines: Vec<&str> = output.lines().collect();
                for line in lines {
                    if line.contains("test_node") && line.contains("[") {
                        let start = line.find("[").unwrap() + 1;
                        let end = line.rfind("]").unwrap();
                        let content = &line[start..end];

                        // Basic validation that special chars were properly handled
                        if content.contains(" - ") {
                            prop_assert!(!content.contains("|"));
                        }
                        if content.contains(" and ") {
                            prop_assert!(!content.contains("&"));
                        }
                    }
                }
            }
        }

        #[test]
        fn sanitized_ids_are_valid(
            id in prop::string::string_regex(".{0,100}").unwrap()
        ) {
            let generator = MermaidGenerator::default();
            let sanitized = generator.sanitize_id(&id);

            // Should only contain valid characters
            prop_assert!(sanitized.chars().all(|c| c.is_alphanumeric() || c == '_'));

            // Should start with letter or underscore
            if !sanitized.is_empty() {
                prop_assert!(sanitized.chars().next().unwrap().is_alphabetic() ||
                           sanitized.starts_with('_'));
            }
        }

        #[test]
        fn all_nodes_appear_in_output(
            nodes in prop::collection::vec(node_strategy(), 1..20)
        ) {
            let mut graph = DependencyGraph::new();

            for node in &nodes {
                graph.add_node(node.clone());
            }

            // Add edges to ensure nodes are connected (PageRank needs connections)
            if nodes.len() > 1 {
                for i in 0..nodes.len()-1 {
                    graph.add_edge(Edge {
                        from: nodes[i].id.clone(),
                        to: nodes[(i+1) % nodes.len()].id.clone(),
                        edge_type: EdgeType::Calls,
                        weight: 1,
                    });
                }
            }

            let generator = MermaidGenerator::new(MermaidOptions::default());
            let output = generator.generate(&graph);

            // The PageRank-based algorithm may filter nodes, so we check that:
            // 1. Output is valid mermaid
            prop_assert!(output.starts_with("graph TD\n"), "Output should start with graph directive");

            // 2. At least some nodes appear (PageRank will select important ones)
            let nodes_found = nodes.iter().filter(|node| {
                let sanitized_id = generator.sanitize_id(&node.id);
                output.contains(&sanitized_id)
            }).count();

            // For connected graphs, we expect a reasonable number of nodes to appear
            let expected_min = if nodes.len() <= 5 { nodes.len() } else { nodes.len() / 4 };
            prop_assert!(nodes_found >= expected_min.max(1),
                "Expected at least {} nodes in output, found {}", expected_min.max(1), nodes_found);
        }

        #[test]
        fn complexity_colors_are_consistent(
            complexity in 0u32..100
        ) {
            let generator = MermaidGenerator::default();
            let color = generator.get_complexity_color(complexity);

            // Should return a valid color
            prop_assert!(color.starts_with('#'));
            prop_assert_eq!(color.len(), 7); // #RRGGBB format

            // Colors should be consistent for ranges
            match complexity {
                1..=3 => prop_assert_eq!(color, "#90EE90"),
                4..=7 => prop_assert_eq!(color, "#FFD700"),
                8..=12 => prop_assert_eq!(color, "#FFA500"),
                _ => prop_assert_eq!(color, "#FF6347"),
            }
        }

        #[test]
        fn edge_arrows_are_correct(
            edge_type in edge_type_strategy()
        ) {
            let generator = MermaidGenerator::default();
            let arrow = generator.get_edge_arrow(&edge_type);

            match edge_type {
                EdgeType::Calls => prop_assert_eq!(arrow, "-->"),
                EdgeType::Imports => prop_assert_eq!(arrow, "-.->"),
                EdgeType::Inherits => prop_assert_eq!(arrow, "-->|inherits|"),
                EdgeType::Implements => prop_assert_eq!(arrow, "-->|implements|"),
                EdgeType::Uses => prop_assert_eq!(arrow, "---"),
            }
        }
    }
}