pmat 3.15.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

impl EfficiencyAnalyzer {
    #[provable_contracts_macros::contract("pmat-core.yaml", equation = "check_compliance")]
    /// Create a new instance.
    pub fn new() -> Self {
        Self {
            _max_loop_depth: 0,
            _recursive_calls: 0,
        }
    }

    #[provable_contracts_macros::contract("pmat-core.yaml", equation = "check_compliance")]
    /// Analyze.
    pub fn analyze(&self, ast: &syn::File) -> String {
        let mut visitor = EfficiencyVisitor {
            current_loop_depth: 0,
            max_loop_depth: 0,
            has_recursion: false,
        };
        visitor.visit_file(ast);
        visitor.compute_complexity()
    }

    #[provable_contracts_macros::contract("pmat-core.yaml", equation = "check_compliance")]
    /// Analyze string.
    pub fn analyze_string(&self, code: &str) -> Result<EfficiencyResult, syn::Error> {
        let ast = syn::parse_file(code)?;
        Ok(EfficiencyResult {
            time_complexity: self.analyze(&ast),
            space_complexity: self.analyze_space(&ast),
        })
    }

    #[provable_contracts_macros::contract("pmat-core.yaml", equation = "check_compliance")]
    fn analyze_space(&self, ast: &syn::File) -> String {
        let mut visitor = SpaceComplexityVisitor {
            allocations: 0,
            recursive_depth: 0,
        };
        visitor.visit_file(ast);
        visitor.compute_space_complexity()
    }
}

impl EfficiencyVisitor {
    #[provable_contracts_macros::contract("pmat-core.yaml", equation = "check_compliance")]
    fn compute_complexity(&self) -> String {
        match self.max_loop_depth {
            0 => "O(1)".to_string(),
            1 => {
                if self.has_recursion {
                    "O(n log n)".to_string() // Assume divide-and-conquer
                } else {
                    "O(n)".to_string()
                }
            }
            2 => "O(n^2)".to_string(),
            3 => "O(n^3)".to_string(),
            _ => format!("O(n^{})", self.max_loop_depth),
        }
    }
}

impl<'ast> Visit<'ast> for EfficiencyVisitor {
    fn visit_expr_for_loop(&mut self, node: &'ast syn::ExprForLoop) {
        self.current_loop_depth += 1;
        if self.current_loop_depth > self.max_loop_depth {
            self.max_loop_depth = self.current_loop_depth;
        }
        syn::visit::visit_expr_for_loop(self, node);
        self.current_loop_depth -= 1;
    }

    fn visit_expr_while(&mut self, node: &'ast syn::ExprWhile) {
        self.current_loop_depth += 1;
        if self.current_loop_depth > self.max_loop_depth {
            self.max_loop_depth = self.current_loop_depth;
        }
        syn::visit::visit_expr_while(self, node);
        self.current_loop_depth -= 1;
    }

    fn visit_expr_loop(&mut self, node: &'ast syn::ExprLoop) {
        self.current_loop_depth += 1;
        if self.current_loop_depth > self.max_loop_depth {
            self.max_loop_depth = self.current_loop_depth;
        }
        syn::visit::visit_expr_loop(self, node);
        self.current_loop_depth -= 1;
    }

    fn visit_expr_call(&mut self, node: &'ast syn::ExprCall) {
        // Simple recursion detection (would need more sophisticated analysis in production)
        if let syn::Expr::Path(_path) = &*node.func {
            // Check if it's potentially a recursive call
            // This is simplified - real implementation would track function names
            self.has_recursion = self.current_loop_depth == 0;
        }
        syn::visit::visit_expr_call(self, node);
    }
}

impl SpaceComplexityVisitor {
    #[provable_contracts_macros::contract("pmat-core.yaml", equation = "check_compliance")]
    fn compute_space_complexity(&self) -> String {
        if self.recursive_depth > 0 {
            "O(n)".to_string() // Recursive calls use stack space
        } else if self.allocations > 0 {
            "O(n)".to_string() // Assuming dynamic allocations scale with input
        } else {
            "O(1)".to_string() // Constant space
        }
    }
}

impl<'ast> Visit<'ast> for SpaceComplexityVisitor {
    fn visit_expr_call(&mut self, node: &'ast syn::ExprCall) {
        // Check for allocation functions
        if let syn::Expr::Path(path) = &*node.func {
            if let Some(ident) = path.path.get_ident() {
                let name = ident.to_string();
                if name.contains("vec") || name.contains("Vec") || name.contains("alloc") {
                    self.allocations += 1;
                }
            }
        }
        syn::visit::visit_expr_call(self, node);
    }

    fn visit_local(&mut self, node: &'ast syn::Local) {
        // Check for vector/array declarations
        if let syn::Pat::Type(_pat_type) = &node.pat {
            // Simplified check for dynamic allocations
            self.allocations += 1;
        }
        syn::visit::visit_local(self, node);
    }
}