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

// Python Arithmetic Operator Replacement (AOR) and Relational Operator Replacement (ROR)
// include!()'d from python_tree_sitter_mutations.rs

impl TreeSitterMutationOperator for PythonBinaryOpMutation {
    fn name(&self) -> &str {
        "PythonBinaryOp"
    }

    fn can_mutate(&self, node: &Node, _source: &[u8]) -> bool {
        node.kind() == "binary_operator"
    }

    fn mutate(&self, node: &Node, source: &[u8]) -> Vec<MutatedSource> {
        // Find operator child node (middle child in binary_operator)
        let mut cursor = node.walk();
        let mut operator_node = None;

        for child in node.children(&mut cursor) {
            let kind = child.kind();
            // Python operators are represented as their literal text
            if matches!(kind, "+" | "-" | "*" | "/" | "//" | "%" | "**") {
                operator_node = Some(child);
                break;
            }
        }

        let operator_node = match operator_node {
            Some(n) => n,
            None => return vec![],
        };

        let op_bytes = &source[operator_node.byte_range()];
        let op_text = std::str::from_utf8(op_bytes).unwrap_or("");

        // Generate replacement operators
        let replacements = python_binary_op_replacements(op_text);
        if replacements.is_empty() {
            return vec![];
        }

        build_operator_mutations(source, &operator_node, op_text, &replacements)
    }

    fn kill_probability(&self) -> f64 {
        0.85 // Arithmetic mutations are usually caught by tests
    }
}

/// Returns the set of replacement operators for a given Python binary operator.
fn python_binary_op_replacements(op_text: &str) -> Vec<&'static str> {
    match op_text {
        "+" => vec!["-", "*", "/", "//", "%", "**"],
        "-" => vec!["+", "*", "/", "//", "%", "**"],
        "*" => vec!["+", "-", "/", "//", "%", "**"],
        "/" => vec!["+", "-", "*", "//", "%", "**"],
        "//" => vec!["+", "-", "*", "/", "%", "**"],
        "%" => vec!["+", "-", "*", "/", "//", "**"],
        "**" => vec!["+", "-", "*", "/", "//", "%"],
        _ => vec![],
    }
}

impl TreeSitterMutationOperator for PythonRelationalOpMutation {
    fn name(&self) -> &str {
        "PythonRelationalOp"
    }

    fn can_mutate(&self, node: &Node, _source: &[u8]) -> bool {
        node.kind() == "comparison_operator"
    }

    fn mutate(&self, node: &Node, source: &[u8]) -> Vec<MutatedSource> {
        // Find comparison operator child node
        let mut cursor = node.walk();
        let mut operator_node = None;

        for child in node.children(&mut cursor) {
            let kind = child.kind();
            // Python comparison operators
            if matches!(
                kind,
                "<" | ">" | "<=" | ">=" | "==" | "!=" | "is" | "is not" | "in" | "not in"
            ) {
                // Only handle relational operators here (not identity/membership)
                if matches!(kind, "<" | ">" | "<=" | ">=" | "==" | "!=") {
                    operator_node = Some(child);
                    break;
                }
            }
        }

        let operator_node = match operator_node {
            Some(n) => n,
            None => return vec![],
        };

        let op_bytes = &source[operator_node.byte_range()];
        let op_text = std::str::from_utf8(op_bytes).unwrap_or("");

        // Generate replacement operators
        let replacements = python_relational_op_replacements(op_text);
        if replacements.is_empty() {
            return vec![];
        }

        build_operator_mutations(source, &operator_node, op_text, &replacements)
    }

    fn kill_probability(&self) -> f64 {
        0.75 // Relational mutations sometimes survive
    }
}

/// Returns the set of replacement operators for a given Python relational operator.
fn python_relational_op_replacements(op_text: &str) -> Vec<&'static str> {
    match op_text {
        "<" => vec![">", "<=", ">=", "==", "!="],
        ">" => vec!["<", "<=", ">=", "==", "!="],
        "<=" => vec!["<", ">", ">=", "==", "!="],
        ">=" => vec!["<", ">", "<=", "==", "!="],
        "==" => vec!["!=", "<", ">", "<=", ">="],
        "!=" => vec!["==", "<", ">", "<=", ">="],
        _ => vec![],
    }
}

/// Build MutatedSource entries by splicing each replacement operator into the source.
fn build_operator_mutations(
    source: &[u8],
    operator_node: &Node,
    op_text: &str,
    replacements: &[&str],
) -> Vec<MutatedSource> {
    replacements
        .iter()
        .map(|new_op| {
            let mut mutated = source.to_vec();
            mutated.splice(operator_node.byte_range(), new_op.bytes());

            MutatedSource {
                source: String::from_utf8(mutated).expect(
                    "mutated source is valid UTF-8 (original source + ASCII operators)",
                ),
                description: format!("{} → {}", op_text, new_op),
                location: SourceLocation {
                    line: operator_node.start_position().row + 1,
                    column: operator_node.start_position().column + 1,
                    end_line: operator_node.end_position().row + 1,
                    end_column: operator_node.end_position().column + 1,
                },
            }
        })
        .collect()
}