@kevinrabun/judges 3.1.1 → 3.2.0

package/README.md

@@ -1,6 +1,6 @@
 # Judges Panel
 
-An MCP (Model Context Protocol) server that provides a panel of **35 specialized judges** to evaluate AI-generated code — acting as an independent quality gate regardless of which project is being reviewed. Includes **built-in AST analysis** powered by the TypeScript Compiler API — no separate parser server needed.
+An MCP (Model Context Protocol) server that provides a panel of **35 specialized judges** to evaluate AI-generated code — acting as an independent quality gate regardless of which project is being reviewed. Combines **deterministic pattern matching & AST analysis** (instant, offline, zero LLM calls) with **LLM-powered deep-review prompts** that let your AI assistant perform expert-persona analysis across all 35 domains.
 
 **Highlights:**
 - Includes an **App Builder Workflow (3-step)** demo for release decisions, plain-language risk summaries, and prioritized fixes — see [Try the Demo](#2-try-the-demo).
@@ -11,7 +11,7 @@ An MCP (Model Context Protocol) server that provides a panel of **35 specialized
 [![npm](https://img.shields.io/npm/v/@kevinrabun/judges)](https://www.npmjs.com/package/@kevinrabun/judges)
 [![npm downloads](https://img.shields.io/npm/dw/@kevinrabun/judges)](https://www.npmjs.com/package/@kevinrabun/judges)
 [![License: MIT](https://img.shields.io/badge/License-MIT-yellow.svg)](https://opensource.org/licenses/MIT)
-[![Tests](https://img.shields.io/badge/tests-899-brightgreen)](https://github.com/KevinRabun/judges/actions)
+[![Tests](https://img.shields.io/badge/tests-702-brightgreen)](https://github.com/KevinRabun/judges/actions)
 
 ---
 
@@ -24,7 +24,7 @@ AI code generators (Copilot, Cursor, Claude, ChatGPT, etc.) write code fast —
 | **Scope** | Style + some bugs | Bugs + code smells | Security patterns | **35 domains**: security, cost, compliance, a11y, API design, cloud, UX, … |
 | **AI-generated code focus** | No | No | Partial | **Purpose-built** for AI output failure modes |
 | **Setup** | Config per project | Server + scanner | Cloud or local | **One command**: `npx @kevinrabun/judges eval file.ts` |
-| **Auto-fix patches** | Some | No | No | **47 deterministic patches** — no LLM needed |
+| **Auto-fix patches** | Some | No | No | **47 deterministic patches** — instant, offline |
 | **Non-technical output** | No | Dashboard | No | **Plain-language findings** with What/Why/Next |
 | **MCP native** | No | No | No | **Yes** — works inside Copilot, Claude, Cursor |
 | **SARIF output** | No | Yes | Yes | **Yes** — upload to GitHub Code Scanning |
@@ -367,24 +367,24 @@ This helps keep Copilot feedback aligned with Judges findings.
 
 The tribunal operates in three layers:
 
-1. **Pattern-Based Analysis** — All tools (`evaluate_code`, `evaluate_code_single_judge`, `evaluate_project`, `evaluate_diff`) perform heuristic analysis using regex pattern matching to catch common anti-patterns. This works entirely offline with zero external API calls.
+1. **Pattern-Based Analysis** — All tools (`evaluate_code`, `evaluate_code_single_judge`, `evaluate_project`, `evaluate_diff`) perform heuristic analysis using regex pattern matching to catch common anti-patterns. This layer is instant, deterministic, and runs entirely offline with zero external API calls.
 
-2. **AST-Based Structural Analysis** — The Code Structure judge (`STRUCT-*` rules) uses real Abstract Syntax Tree parsing to measure cyclomatic complexity, nesting depth, function length, parameter count, dead code, and type safety with precision that regex cannot achieve. JavaScript/TypeScript files are parsed via the TypeScript Compiler API; Python, Rust, Go, Java, and C# use a scope-tracking structural parser. No external AST server required.
+2. **AST-Based Structural Analysis** — The Code Structure judge (`STRUCT-*` rules) uses real Abstract Syntax Tree parsing to measure cyclomatic complexity, nesting depth, function length, parameter count, dead code, and type safety with precision that regex cannot achieve. JavaScript/TypeScript files are parsed via the TypeScript Compiler API. Python, Rust, Go, Java, and C# are parsed via **tree-sitter WASM grammars** — real syntax trees compiled to WebAssembly that run in-process with zero native dependencies. A scope-tracking structural parser is kept as a fallback when WASM grammars are unavailable. No external AST server required.
 
-3. **LLM-Powered Deep Analysis (Prompts)** — The server exposes MCP prompts (e.g., `judge-data-security`, `full-tribunal`) that provide each judge's expert persona as a system prompt. When used by an LLM-based client, this enables deeper, context-aware analysis beyond what static analysis can detect.
+3. **LLM-Powered Deep Analysis (Prompts)** — The server exposes MCP prompts (e.g., `judge-data-security`, `full-tribunal`) that provide each judge's expert persona as a system prompt. When used by an LLM-based client (Copilot, Claude, Cursor, etc.), the host LLM performs deeper, context-aware probabilistic analysis beyond what static patterns can detect. This is where the `systemPrompt` on each judge comes alive — Judges itself makes no LLM calls, but it provides the expert criteria so your AI assistant can act as 35 specialized reviewers.
 
 ---
 
 ## Composable by Design
 
-Judges Panel covers **heuristic pattern detection** and **AST structural analysis** in a single server — fast, offline, and self-contained. It does not try to be a CVE scanner or a linter. Those capabilities belong in dedicated MCP servers that an AI agent can orchestrate alongside Judges.
+Judges Panel is a **dual-layer** review system: instant **deterministic tools** (offline, no API keys) for pattern and AST analysis, plus **35 expert-persona MCP prompts** that unlock LLM-powered deep analysis when connected to an AI client. It does not try to be a CVE scanner or a linter. Those capabilities belong in dedicated MCP servers that an AI agent can orchestrate alongside Judges.
 
 ### Built-in AST Analysis (v2.0.0)
 
 Unlike earlier versions that recommended a separate AST MCP server, Judges Panel now includes **real AST-based structural analysis** out of the box:
 
 - **JavaScript / TypeScript** — Parsed with the TypeScript Compiler API (`ts.createSourceFile`) for full-fidelity AST
-- **Python, Rust, Go, Java, C#** — Analyzed with a scope-tracking structural parser that counts decision points and nesting levels
+- **Python, Rust, Go, Java, C#** — Parsed with **tree-sitter WASM grammars** for full syntax-tree analysis (functions, complexity, nesting, dead code, type safety). Falls back to a scope-tracking structural parser when WASM grammars are unavailable
 
 The Code Structure judge (`STRUCT-*`) uses these parsers to accurately measure:
 
@@ -811,7 +811,8 @@ judges/
 │   │   ├── index.ts          # analyzeStructure() — routes to correct parser
 │   │   ├── types.ts          # FunctionInfo, CodeStructure interfaces
 │   │   ├── typescript-ast.ts # TypeScript Compiler API parser (JS/TS)
-│   │   └── structural-parser.ts  # Scope-tracking parser (Python/Rust/Go/Java/C#)
+│   │   ├── tree-sitter-ast.ts    # Tree-sitter WASM parser (Python/Rust/Go/Java/C#)
+│   │   └── structural-parser.ts  # Fallback scope-tracking parser
 │   ├── evaluators/           # Analysis engine for each judge
 │   │   ├── index.ts          # evaluateWithJudge(), evaluateWithTribunal(), evaluateProject(), etc.
 │   │   ├── shared.ts         # Scoring, verdict logic, markdown formatters
@@ -829,6 +830,12 @@ judges/
 │   └── demo.ts                   # Run: npm run demo
 ├── tests/
 │   └── judges.test.ts            # Run: npm test
+├── grammars/                 # Tree-sitter WASM grammar files
+│   ├── tree-sitter-python.wasm
+│   ├── tree-sitter-go.wasm
+│   ├── tree-sitter-rust.wasm
+│   ├── tree-sitter-java.wasm
+│   └── tree-sitter-c_sharp.wasm
 ├── server.json               # MCP Registry manifest
 ├── package.json
 ├── tsconfig.json

package/dist/ast/index.d.ts

@@ -1,5 +1,6 @@
 import type { CodeStructure, FunctionInfo } from "./types.js";
 export type { CodeStructure, FunctionInfo };
+export { isTreeSitterAvailable, isTreeSitterReadySync } from "./tree-sitter-ast.js";
 export { analyzeTaintFlows } from "./taint-tracker.js";
 export type { TaintFlow, TaintSourceKind, TaintSinkKind } from "./taint-tracker.js";
 export { analyzeCrossFileTaint } from "./cross-file-taint.js";
@@ -7,10 +8,20 @@ export type { CrossFileTaintFlow } from "./cross-file-taint.js";
 /**
  * Analyse source code structurally. For JavaScript/TypeScript this uses the
  * TypeScript compiler API (full AST). For Python, Rust, Go, Java, and C# it
- * uses a lightweight scope-tracking parser.
+ * uses tree-sitter (real AST via WASM) when available, falling back to the
+ * lightweight scope-tracking parser.
  *
  * Returns function metrics (complexity, nesting, length, params), dead code
  * locations, deep-nesting locations, and type-safety issues.
  */
 export declare function analyzeStructure(code: string, language: string): CodeStructure;
+/**
+ * Async version of analyzeStructure that uses tree-sitter (real AST) for
+ * Python, Rust, Go, Java, and C# when WASM grammars are available.
+ * Falls back to the structural parser if tree-sitter is not available.
+ *
+ * Prefer this over analyzeStructure() for Tier 2 languages — it provides
+ * the same depth of analysis that the TS Compiler API gives JS/TS.
+ */
+export declare function analyzeStructureAsync(code: string, language: string): Promise<CodeStructure>;
 //# sourceMappingURL=index.d.ts.map

package/dist/ast/index.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/ast/index.ts"],"names":[],"mappings":"AAUA,OAAO,KAAK,EAAE,aAAa,EAAE,YAAY,EAAE,MAAM,YAAY,CAAC;AAE9D,YAAY,EAAE,aAAa,EAAE,YAAY,EAAE,CAAC;AAG5C,OAAO,EAAE,iBAAiB,EAAE,MAAM,oBAAoB,CAAC;AACvD,YAAY,EAAE,SAAS,EAAE,eAAe,EAAE,aAAa,EAAE,MAAM,oBAAoB,CAAC;AAGpF,OAAO,EAAE,qBAAqB,EAAE,MAAM,uBAAuB,CAAC;AAC9D,YAAY,EAAE,kBAAkB,EAAE,MAAM,uBAAuB,CAAC;AAEhE;;;;;;;GAOG;AACH,wBAAgB,gBAAgB,CAAC,IAAI,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,GAAG,aAAa,CA6B9E"}
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/ast/index.ts"],"names":[],"mappings":"AAiBA,OAAO,KAAK,EAAE,aAAa,EAAE,YAAY,EAAE,MAAM,YAAY,CAAC;AAE9D,YAAY,EAAE,aAAa,EAAE,YAAY,EAAE,CAAC;AAG5C,OAAO,EAAE,qBAAqB,EAAE,qBAAqB,EAAE,MAAM,sBAAsB,CAAC;AAGpF,OAAO,EAAE,iBAAiB,EAAE,MAAM,oBAAoB,CAAC;AACvD,YAAY,EAAE,SAAS,EAAE,eAAe,EAAE,aAAa,EAAE,MAAM,oBAAoB,CAAC;AAGpF,OAAO,EAAE,qBAAqB,EAAE,MAAM,uBAAuB,CAAC;AAC9D,YAAY,EAAE,kBAAkB,EAAE,MAAM,uBAAuB,CAAC;AAahE;;;;;;;;GAQG;AACH,wBAAgB,gBAAgB,CAAC,IAAI,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,GAAG,aAAa,CAuC9E;AAED;;;;;;;GAOG;AACH,wBAAsB,qBAAqB,CAAC,IAAI,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,GAAG,OAAO,CAAC,aAAa,CAAC,CAsClG"}

package/dist/ast/index.js

@@ -1,20 +1,33 @@
 // ─────────────────────────────────────────────────────────────────────────────
 // AST Analysis — Unified Entry Point
 // ─────────────────────────────────────────────────────────────────────────────
-// Routes to the TypeScript compiler-based parser for JS/TS or the lightweight
-// structural parser for Python, Rust, Go, Java, and C#.
+// Routes to the TypeScript compiler-based parser for JS/TS, the tree-sitter
+// real-AST parser for Python, Rust, Go, Java, and C# (when WASM grammars are
+// available), or the lightweight structural parser as a fallback.
 // ─────────────────────────────────────────────────────────────────────────────
 import { normalizeLanguage } from "../language-patterns.js";
 import { analyzeTypeScript } from "./typescript-ast.js";
 import { analyzeStructurally } from "./structural-parser.js";
+import { isTreeSitterAvailable, isTreeSitterReadySync, analyzeWithTreeSitter, analyzeWithTreeSitterSync, } from "./tree-sitter-ast.js";
+// Re-export tree-sitter availability checks
+export { isTreeSitterAvailable, isTreeSitterReadySync } from "./tree-sitter-ast.js";
 // Re-export taint analysis
 export { analyzeTaintFlows } from "./taint-tracker.js";
 // Re-export cross-file taint analysis
 export { analyzeCrossFileTaint } from "./cross-file-taint.js";
+// ─── Tree-sitter Warm-up ────────────────────────────────────────────────────
+// Pre-initialize tree-sitter on module load so it's ready when needed.
+// This is fire-and-forget; if it fails, analyzeStructure falls back silently.
+const TREE_SITTER_LANGS = ["python", "rust", "go", "java", "csharp"];
+const treeSitterReady = new Map();
+for (const lang of TREE_SITTER_LANGS) {
+    treeSitterReady.set(lang, isTreeSitterAvailable(lang));
+}
 /**
  * Analyse source code structurally. For JavaScript/TypeScript this uses the
  * TypeScript compiler API (full AST). For Python, Rust, Go, Java, and C# it
- * uses a lightweight scope-tracking parser.
+ * uses tree-sitter (real AST via WASM) when available, falling back to the
+ * lightweight scope-tracking parser.
  *
  * Returns function metrics (complexity, nesting, length, params), dead code
  * locations, deep-nesting locations, and type-safety issues.
@@ -30,6 +43,17 @@ export function analyzeStructure(code, language) {
         case "go":
         case "java":
         case "csharp":
+            // Use tree-sitter (real AST) if WASM runtime + grammar already loaded,
+            // otherwise fall back to the lightweight structural parser.
+            // parser.parse() is synchronous in web-tree-sitter once initialized.
+            if (isTreeSitterReadySync(lang)) {
+                try {
+                    return analyzeWithTreeSitterSync(code, lang);
+                }
+                catch {
+                    // Tree-sitter failed at runtime — fall back silently
+                }
+            }
             return analyzeStructurally(code, lang);
         default:
             // Unknown language — return a minimal structure
@@ -46,4 +70,49 @@ export function analyzeStructure(code, language) {
             };
     }
 }
+/**
+ * Async version of analyzeStructure that uses tree-sitter (real AST) for
+ * Python, Rust, Go, Java, and C# when WASM grammars are available.
+ * Falls back to the structural parser if tree-sitter is not available.
+ *
+ * Prefer this over analyzeStructure() for Tier 2 languages — it provides
+ * the same depth of analysis that the TS Compiler API gives JS/TS.
+ */
+export async function analyzeStructureAsync(code, language) {
+    const lang = normalizeLanguage(language);
+    switch (lang) {
+        case "javascript":
+        case "typescript":
+            return analyzeTypeScript(code, lang);
+        case "python":
+        case "rust":
+        case "go":
+        case "java":
+        case "csharp": {
+            // Try tree-sitter first (real AST), fall back to structural parser
+            const available = await (treeSitterReady.get(lang) ?? Promise.resolve(false));
+            if (available) {
+                try {
+                    return await analyzeWithTreeSitter(code, lang);
+                }
+                catch {
+                    // Tree-sitter failed at runtime — fall back silently
+                }
+            }
+            return analyzeStructurally(code, lang);
+        }
+        default:
+            return {
+                language: lang,
+                totalLines: code.split("\n").length,
+                functions: [],
+                fileCyclomaticComplexity: 1,
+                maxNestingDepth: 0,
+                deadCodeLines: [],
+                deepNestLines: [],
+                typeAnyLines: [],
+                imports: [],
+            };
+    }
+}
 //# sourceMappingURL=index.js.map

package/dist/ast/index.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/ast/index.ts"],"names":[],"mappings":"AAAA,gFAAgF;AAChF,qCAAqC;AACrC,gFAAgF;AAChF,8EAA8E;AAC9E,wDAAwD;AACxD,gFAAgF;AAEhF,OAAO,EAAE,iBAAiB,EAAE,MAAM,yBAAyB,CAAC;AAC5D,OAAO,EAAE,iBAAiB,EAAE,MAAM,qBAAqB,CAAC;AACxD,OAAO,EAAE,mBAAmB,EAAE,MAAM,wBAAwB,CAAC;AAK7D,2BAA2B;AAC3B,OAAO,EAAE,iBAAiB,EAAE,MAAM,oBAAoB,CAAC;AAGvD,sCAAsC;AACtC,OAAO,EAAE,qBAAqB,EAAE,MAAM,uBAAuB,CAAC;AAG9D;;;;;;;GAOG;AACH,MAAM,UAAU,gBAAgB,CAAC,IAAY,EAAE,QAAgB;IAC7D,MAAM,IAAI,GAAG,iBAAiB,CAAC,QAAQ,CAAC,CAAC;IAEzC,QAAQ,IAAI,EAAE,CAAC;QACb,KAAK,YAAY,CAAC;QAClB,KAAK,YAAY;YACf,OAAO,iBAAiB,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;QAEvC,KAAK,QAAQ,CAAC;QACd,KAAK,MAAM,CAAC;QACZ,KAAK,IAAI,CAAC;QACV,KAAK,MAAM,CAAC;QACZ,KAAK,QAAQ;YACX,OAAO,mBAAmB,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;QAEzC;YACE,gDAAgD;YAChD,OAAO;gBACL,QAAQ,EAAE,IAAI;gBACd,UAAU,EAAE,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,MAAM;gBACnC,SAAS,EAAE,EAAE;gBACb,wBAAwB,EAAE,CAAC;gBAC3B,eAAe,EAAE,CAAC;gBAClB,aAAa,EAAE,EAAE;gBACjB,aAAa,EAAE,EAAE;gBACjB,YAAY,EAAE,EAAE;gBAChB,OAAO,EAAE,EAAE;aACZ,CAAC;IACN,CAAC;AACH,CAAC"}
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/ast/index.ts"],"names":[],"mappings":"AAAA,gFAAgF;AAChF,qCAAqC;AACrC,gFAAgF;AAChF,4EAA4E;AAC5E,6EAA6E;AAC7E,kEAAkE;AAClE,gFAAgF;AAEhF,OAAO,EAAE,iBAAiB,EAAE,MAAM,yBAAyB,CAAC;AAC5D,OAAO,EAAE,iBAAiB,EAAE,MAAM,qBAAqB,CAAC;AACxD,OAAO,EAAE,mBAAmB,EAAE,MAAM,wBAAwB,CAAC;AAC7D,OAAO,EACL,qBAAqB,EACrB,qBAAqB,EACrB,qBAAqB,EACrB,yBAAyB,GAC1B,MAAM,sBAAsB,CAAC;AAK9B,4CAA4C;AAC5C,OAAO,EAAE,qBAAqB,EAAE,qBAAqB,EAAE,MAAM,sBAAsB,CAAC;AAEpF,2BAA2B;AAC3B,OAAO,EAAE,iBAAiB,EAAE,MAAM,oBAAoB,CAAC;AAGvD,sCAAsC;AACtC,OAAO,EAAE,qBAAqB,EAAE,MAAM,uBAAuB,CAAC;AAG9D,+EAA+E;AAC/E,uEAAuE;AACvE,8EAA8E;AAE9E,MAAM,iBAAiB,GAAG,CAAC,QAAQ,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,QAAQ,CAAU,CAAC;AAC9E,MAAM,eAAe,GAAG,IAAI,GAAG,EAA4B,CAAC;AAE5D,KAAK,MAAM,IAAI,IAAI,iBAAiB,EAAE,CAAC;IACrC,eAAe,CAAC,GAAG,CAAC,IAAI,EAAE,qBAAqB,CAAC,IAAI,CAAC,CAAC,CAAC;AACzD,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,gBAAgB,CAAC,IAAY,EAAE,QAAgB;IAC7D,MAAM,IAAI,GAAG,iBAAiB,CAAC,QAAQ,CAAC,CAAC;IAEzC,QAAQ,IAAI,EAAE,CAAC;QACb,KAAK,YAAY,CAAC;QAClB,KAAK,YAAY;YACf,OAAO,iBAAiB,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;QAEvC,KAAK,QAAQ,CAAC;QACd,KAAK,MAAM,CAAC;QACZ,KAAK,IAAI,CAAC;QACV,KAAK,MAAM,CAAC;QACZ,KAAK,QAAQ;YACX,uEAAuE;YACvE,4DAA4D;YAC5D,qEAAqE;YACrE,IAAI,qBAAqB,CAAC,IAAI,CAAC,EAAE,CAAC;gBAChC,IAAI,CAAC;oBACH,OAAO,yBAAyB,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;gBAC/C,CAAC;gBAAC,MAAM,CAAC;oBACP,qDAAqD;gBACvD,CAAC;YACH,CAAC;YACD,OAAO,mBAAmB,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;QAEzC;YACE,gDAAgD;YAChD,OAAO;gBACL,QAAQ,EAAE,IAAI;gBACd,UAAU,EAAE,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,MAAM;gBACnC,SAAS,EAAE,EAAE;gBACb,wBAAwB,EAAE,CAAC;gBAC3B,eAAe,EAAE,CAAC;gBAClB,aAAa,EAAE,EAAE;gBACjB,aAAa,EAAE,EAAE;gBACjB,YAAY,EAAE,EAAE;gBAChB,OAAO,EAAE,EAAE;aACZ,CAAC;IACN,CAAC;AACH,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,CAAC,KAAK,UAAU,qBAAqB,CAAC,IAAY,EAAE,QAAgB;IACxE,MAAM,IAAI,GAAG,iBAAiB,CAAC,QAAQ,CAAC,CAAC;IAEzC,QAAQ,IAAI,EAAE,CAAC;QACb,KAAK,YAAY,CAAC;QAClB,KAAK,YAAY;YACf,OAAO,iBAAiB,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;QAEvC,KAAK,QAAQ,CAAC;QACd,KAAK,MAAM,CAAC;QACZ,KAAK,IAAI,CAAC;QACV,KAAK,MAAM,CAAC;QACZ,KAAK,QAAQ,CAAC,CAAC,CAAC;YACd,mEAAmE;YACnE,MAAM,SAAS,GAAG,MAAM,CAAC,eAAe,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,OAAO,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC;YAC9E,IAAI,SAAS,EAAE,CAAC;gBACd,IAAI,CAAC;oBACH,OAAO,MAAM,qBAAqB,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;gBACjD,CAAC;gBAAC,MAAM,CAAC;oBACP,qDAAqD;gBACvD,CAAC;YACH,CAAC;YACD,OAAO,mBAAmB,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;QACzC,CAAC;QAED;YACE,OAAO;gBACL,QAAQ,EAAE,IAAI;gBACd,UAAU,EAAE,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,MAAM;gBACnC,SAAS,EAAE,EAAE;gBACb,wBAAwB,EAAE,CAAC;gBAC3B,eAAe,EAAE,CAAC;gBAClB,aAAa,EAAE,EAAE;gBACjB,aAAa,EAAE,EAAE;gBACjB,YAAY,EAAE,EAAE;gBAChB,OAAO,EAAE,EAAE;aACZ,CAAC;IACN,CAAC;AACH,CAAC"}

package/dist/ast/tree-sitter-ast.d.ts

@@ -0,0 +1,34 @@
+import type { CodeStructure } from "./types.js";
+/**
+ * Check whether tree-sitter analysis is available for a given language.
+ * Must be called (and awaited) before analyzeWithTreeSitter.
+ */
+export declare function isTreeSitterAvailable(lang: string): Promise<boolean>;
+/**
+ * Synchronous readiness check — returns true only if tree-sitter's WASM
+ * runtime AND the grammar for `lang` have already been loaded into memory.
+ * This is safe to call from synchronous code paths; if the async init
+ * hasn't finished yet, it simply returns false and the caller falls back
+ * to the structural parser.
+ */
+export declare function isTreeSitterReadySync(lang: string): boolean;
+/**
+ * Synchronous tree-sitter analysis. Can ONLY be called when
+ * isTreeSitterReadySync(lang) returns true (i.e. parser module and grammar
+ * are already loaded). parser.parse() is synchronous in web-tree-sitter
+ * once the WASM runtime and grammar are in memory.
+ *
+ * Returns the same CodeStructure interface as analyzeWithTreeSitter.
+ * Throws if preconditions are not met.
+ */
+export declare function analyzeWithTreeSitterSync(code: string, language: string): CodeStructure;
+/**
+ * Analyse source code using tree-sitter's real syntax tree.
+ * Returns the same CodeStructure interface as the TypeScript and
+ * structural parsers — but with much higher precision for non-JS/TS languages.
+ *
+ * IMPORTANT: Call isTreeSitterAvailable(lang) first. If it returns false,
+ * fall back to analyzeStructurally().
+ */
+export declare function analyzeWithTreeSitter(code: string, language: string): Promise<CodeStructure>;
+//# sourceMappingURL=tree-sitter-ast.d.ts.map

package/dist/ast/tree-sitter-ast.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"tree-sitter-ast.d.ts","sourceRoot":"","sources":["../../src/ast/tree-sitter-ast.ts"],"names":[],"mappings":"AAkBA,OAAO,KAAK,EAAE,aAAa,EAAgB,MAAM,YAAY,CAAC;AAkG9D;;;GAGG;AACH,wBAAsB,qBAAqB,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO,CAAC,OAAO,CAAC,CAK1E;AAED;;;;;;GAMG;AACH,wBAAgB,qBAAqB,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO,CAE3D;AAED;;;;;;;;GAQG;AACH,wBAAgB,yBAAyB,CAAC,IAAI,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,GAAG,aAAa,CAKvF;AAED;;;;;;;GAOG;AACH,wBAAsB,qBAAqB,CAAC,IAAI,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,GAAG,OAAO,CAAC,aAAa,CAAC,CAKlG"}

package/dist/ast/tree-sitter-ast.js

@@ -0,0 +1,747 @@
+// ─────────────────────────────────────────────────────────────────────────────
+// Tree-sitter AST — Real syntax-tree analysis for Python, Go, Rust, Java, C#
+// ─────────────────────────────────────────────────────────────────────────────
+// Uses web-tree-sitter (WASM-based, zero native deps) to parse source code
+// into a full syntax tree, then walks the tree to extract function metrics,
+// dead code, deep nesting, type-safety issues, and imports.
+//
+// This replaces the lightweight structural parser for Tier 2 languages,
+// elevating them from regex-based heuristics to real AST analysis — the
+// same depth the TypeScript Compiler API provides for JS/TS.
+//
+// Graceful degradation: if tree-sitter WASM grammars aren't available at
+// runtime, the caller can fall back to the structural parser.
+// ─────────────────────────────────────────────────────────────────────────────
+import { createRequire } from "node:module";
+import { fileURLToPath } from "node:url";
+import { dirname, join } from "node:path";
+const require = createRequire(import.meta.url);
+// ─── Lazy Initialization ────────────────────────────────────────────────────
+let initPromise = null;
+let parserModule = null;
+// Grammar file name mapping
+const GRAMMAR_FILES = {
+    python: "tree-sitter-python.wasm",
+    go: "tree-sitter-go.wasm",
+    rust: "tree-sitter-rust.wasm",
+    java: "tree-sitter-java.wasm",
+    csharp: "tree-sitter-c_sharp.wasm",
+};
+// Cached language instances
+const languageCache = new Map();
+// Resolve grammar directory relative to this module
+const __dirname = dirname(fileURLToPath(import.meta.url));
+// In development: src/ast/ → ../../grammars/
+// In dist: dist/ast/ → ../../grammars/
+const GRAMMAR_DIR = join(__dirname, "..", "..", "grammars");
+async function ensureInit() {
+    if (initPromise)
+        return initPromise;
+    initPromise = (async () => {
+        try {
+            const mod = require("web-tree-sitter");
+            await mod.Parser.init();
+            parserModule = mod;
+            return true;
+        }
+        catch {
+            return false;
+        }
+    })();
+    return initPromise;
+}
+async function getLanguage(lang) {
+    if (languageCache.has(lang))
+        return languageCache.get(lang);
+    const file = GRAMMAR_FILES[lang];
+    if (!file)
+        return null;
+    try {
+        const grammar = await parserModule.Language.load(join(GRAMMAR_DIR, file));
+        languageCache.set(lang, grammar);
+        return grammar;
+    }
+    catch {
+        return null;
+    }
+}
+// ─── Public API ──────────────────────────────────────────────────────────────
+/**
+ * Check whether tree-sitter analysis is available for a given language.
+ * Must be called (and awaited) before analyzeWithTreeSitter.
+ */
+export async function isTreeSitterAvailable(lang) {
+    const ready = await ensureInit();
+    if (!ready)
+        return false;
+    const grammar = await getLanguage(lang);
+    return grammar !== null;
+}
+/**
+ * Synchronous readiness check — returns true only if tree-sitter's WASM
+ * runtime AND the grammar for `lang` have already been loaded into memory.
+ * This is safe to call from synchronous code paths; if the async init
+ * hasn't finished yet, it simply returns false and the caller falls back
+ * to the structural parser.
+ */
+export function isTreeSitterReadySync(lang) {
+    return parserModule !== null && languageCache.has(lang);
+}
+/**
+ * Synchronous tree-sitter analysis. Can ONLY be called when
+ * isTreeSitterReadySync(lang) returns true (i.e. parser module and grammar
+ * are already loaded). parser.parse() is synchronous in web-tree-sitter
+ * once the WASM runtime and grammar are in memory.
+ *
+ * Returns the same CodeStructure interface as analyzeWithTreeSitter.
+ * Throws if preconditions are not met.
+ */
+export function analyzeWithTreeSitterSync(code, language) {
+    if (!parserModule)
+        throw new Error("Tree-sitter not initialized");
+    const grammar = languageCache.get(language);
+    if (!grammar)
+        throw new Error(`Tree-sitter grammar for ${language} not loaded`);
+    return parseAndAnalyze(code, language, grammar);
+}
+/**
+ * Analyse source code using tree-sitter's real syntax tree.
+ * Returns the same CodeStructure interface as the TypeScript and
+ * structural parsers — but with much higher precision for non-JS/TS languages.
+ *
+ * IMPORTANT: Call isTreeSitterAvailable(lang) first. If it returns false,
+ * fall back to analyzeStructurally().
+ */
+export async function analyzeWithTreeSitter(code, language) {
+    if (!parserModule)
+        throw new Error("Tree-sitter not initialized");
+    const grammar = await getLanguage(language);
+    if (!grammar)
+        throw new Error(`Tree-sitter grammar for ${language} not available`);
+    return parseAndAnalyze(code, language, grammar);
+}
+/**
+ * Shared parsing + analysis logic used by both sync and async entry points.
+ */
+function parseAndAnalyze(code, language, grammar) {
+    const parser = new parserModule.Parser();
+    parser.setLanguage(grammar);
+    const tree = parser.parse(code);
+    const root = tree.rootNode;
+    const lines = code.split("\n");
+    // Extract all analysis data from the tree
+    const functions = extractFunctions(root, language);
+    const deadCodeLines = detectDeadCode(root, language);
+    const deepNestLines = detectDeepNesting(root, language);
+    const typeAnyLines = detectWeakTypes(root, language);
+    const imports = extractImports(root, language);
+    const classes = extractClasses(root, language);
+    // Compute file-level metrics
+    const fileCyclomaticComplexity = functions.reduce((sum, f) => sum + f.cyclomaticComplexity, 0) || 1;
+    const maxNestingDepth = functions.reduce((max, f) => Math.max(max, f.maxNestingDepth), 0);
+    return {
+        language,
+        totalLines: lines.length,
+        functions,
+        fileCyclomaticComplexity,
+        maxNestingDepth,
+        deadCodeLines,
+        deepNestLines,
+        typeAnyLines,
+        imports,
+        classes: classes.length > 0 ? classes : undefined,
+    };
+}
+// ─── Function Extraction ────────────────────────────────────────────────────
+/** Node types that represent function/method definitions per language */
+const FUNCTION_NODE_TYPES = {
+    python: ["function_definition"],
+    go: ["function_declaration", "method_declaration"],
+    rust: ["function_item"],
+    java: ["method_declaration", "constructor_declaration"],
+    csharp: ["method_declaration", "constructor_declaration", "local_function_statement"],
+};
+function extractFunctions(root, language) {
+    const funcTypes = FUNCTION_NODE_TYPES[language] || [];
+    const functions = [];
+    const classRanges = extractClassRanges(root, language);
+    walkTree(root, (node) => {
+        if (funcTypes.includes(node.type)) {
+            const info = analyzeFunctionNode(node, language, classRanges);
+            if (info)
+                functions.push(info);
+        }
+    });
+    return functions;
+}
+function extractClassRanges(root, language) {
+    const classTypes = CLASS_NODE_TYPES[language] || [];
+    const ranges = [];
+    walkTree(root, (node) => {
+        if (classTypes.includes(node.type)) {
+            const nameNode = node.childForFieldName("name");
+            if (nameNode) {
+                ranges.push({
+                    name: nameNode.text,
+                    startLine: node.startPosition.row + 1,
+                    endLine: node.endPosition.row + 1,
+                });
+            }
+        }
+    });
+    return ranges;
+}
+function analyzeFunctionNode(node, language, classRanges) {
+    // Get function name
+    const nameNode = node.childForFieldName("name");
+    let name = nameNode?.text || "<anonymous>";
+    // For Go method_declaration, extract receiver type
+    if (language === "go" && node.type === "method_declaration") {
+        const receiver = node.childForFieldName("receiver");
+        if (receiver) {
+            // Extract the type from the receiver parameter list
+            const typeNode = findFirstByType(receiver, "type_identifier");
+            if (typeNode) {
+                name = `${typeNode.text}.${name}`;
+            }
+        }
+    }
+    // Check if function is inside a class
+    const startLine = node.startPosition.row + 1;
+    const endLine = node.endPosition.row + 1;
+    const containingClass = classRanges.find((c) => startLine >= c.startLine && endLine <= c.endLine);
+    if (containingClass && language !== "go") {
+        name = `${containingClass.name}.${name}`;
+    }
+    // Count parameters
+    const paramCount = countParameters(node, language);
+    // Compute cyclomatic complexity
+    const complexity = computeCyclomaticComplexity(node, language);
+    // Compute max nesting depth
+    const maxNesting = computeMaxNesting(node, language, 0);
+    // Check for decorators (Python, Java, C#)
+    const decorators = extractDecorators(node, language);
+    // Check for async
+    const isAsync = checkIsAsync(node, language);
+    const info = {
+        name,
+        startLine,
+        endLine,
+        lineCount: endLine - startLine + 1,
+        parameterCount: paramCount,
+        cyclomaticComplexity: complexity,
+        maxNestingDepth: maxNesting,
+    };
+    if (decorators.length > 0)
+        info.decorators = decorators;
+    if (containingClass)
+        info.className = containingClass.name;
+    if (isAsync)
+        info.isAsync = true;
+    return info;
+}
+// ─── Parameter Counting ─────────────────────────────────────────────────────
+function countParameters(funcNode, language) {
+    let paramsNode = null;
+    switch (language) {
+        case "python":
+            paramsNode = funcNode.childForFieldName("parameters");
+            if (!paramsNode)
+                return 0;
+            // Count identifier children, excluding 'self' and 'cls'
+            return paramsNode.namedChildren.filter((c) => {
+                if (c.type === "identifier" && (c.text === "self" || c.text === "cls"))
+                    return false;
+                // Also handle typed_parameter, typed_default_parameter, etc.
+                if (c.type === "identifier" ||
+                    c.type === "default_parameter" ||
+                    c.type === "typed_parameter" ||
+                    c.type === "typed_default_parameter" ||
+                    c.type === "list_splat_pattern" ||
+                    c.type === "dictionary_splat_pattern") {
+                    // For typed_parameter, check if it's self/cls
+                    if (c.type === "typed_parameter") {
+                        const nameChild = c.namedChildren[0];
+                        if (nameChild && (nameChild.text === "self" || nameChild.text === "cls"))
+                            return false;
+                    }
+                    return true;
+                }
+                return false;
+            }).length;
+        case "go":
+            paramsNode = funcNode.childForFieldName("parameters");
+            if (!paramsNode)
+                return 0;
+            return paramsNode.namedChildren.filter((c) => c.type === "parameter_declaration").length;
+        case "rust":
+            paramsNode = funcNode.childForFieldName("parameters");
+            if (!paramsNode)
+                return 0;
+            return paramsNode.namedChildren.filter((c) => c.type === "parameter" || c.type === "self_parameter").length;
+        case "java":
+            paramsNode = funcNode.childForFieldName("parameters");
+            if (!paramsNode)
+                return 0;
+            return paramsNode.namedChildren.filter((c) => c.type === "formal_parameter" || c.type === "spread_parameter")
+                .length;
+        case "csharp":
+            paramsNode = funcNode.childForFieldName("parameters");
+            if (!paramsNode)
+                return 0;
+            return paramsNode.namedChildren.filter((c) => c.type === "parameter").length;
+        default:
+            return 0;
+    }
+}
+// ─── Cyclomatic Complexity ──────────────────────────────────────────────────
+// CC = 1 + number of decision points
+const DECISION_NODE_TYPES = {
+    python: new Set([
+        "if_statement",
+        "elif_clause",
+        "for_statement",
+        "while_statement",
+        "except_clause",
+        "conditional_expression",
+        "for_in_clause",
+        // Boolean operators — each 'and'/'or' is a decision point
+        "boolean_operator",
+    ]),
+    go: new Set(["if_statement", "for_statement", "expression_case", "default_case", "type_case", "communication_case"]),
+    rust: new Set(["if_expression", "for_expression", "while_expression", "loop_expression", "match_arm"]),
+    java: new Set([
+        "if_statement",
+        "for_statement",
+        "enhanced_for_statement",
+        "while_statement",
+        "do_statement",
+        "catch_clause",
+        "switch_block_statement_group",
+        "ternary_expression",
+    ]),
+    csharp: new Set([
+        "if_statement",
+        "for_statement",
+        "for_each_statement",
+        "while_statement",
+        "do_statement",
+        "catch_clause",
+        "switch_section",
+        "conditional_expression",
+    ]),
+};
+// Binary operators that add to complexity (&&, ||)
+const LOGICAL_OPS = new Set(["&&", "||", "and", "or"]);
+function computeCyclomaticComplexity(funcNode, language) {
+    let complexity = 1; // base path
+    const decisionTypes = DECISION_NODE_TYPES[language] || new Set();
+    walkTree(funcNode, (node) => {
+        if (decisionTypes.has(node.type)) {
+            complexity++;
+        }
+        // Check binary expressions for logical operators (&&, ||)
+        if (node.type === "binary_expression") {
+            const op = node.children.find((c) => c.type === "&&" || c.type === "||" || c.text === "&&" || c.text === "||");
+            if (op)
+                complexity++;
+        }
+    });
+    return complexity;
+}
+// ─── Nesting Depth ──────────────────────────────────────────────────────────
+const NESTING_NODE_TYPES = {
+    python: new Set([
+        "if_statement",
+        "for_statement",
+        "while_statement",
+        "with_statement",
+        "try_statement",
+        "except_clause",
+        "for_in_clause",
+        "function_definition",
+        "class_definition",
+    ]),
+    go: new Set([
+        "if_statement",
+        "for_statement",
+        "select_statement",
+        "type_switch_statement",
+        "expression_switch_statement",
+        "func_literal",
+    ]),
+    rust: new Set([
+        "if_expression",
+        "for_expression",
+        "while_expression",
+        "loop_expression",
+        "match_expression",
+        "closure_expression",
+    ]),
+    java: new Set([
+        "if_statement",
+        "for_statement",
+        "enhanced_for_statement",
+        "while_statement",
+        "do_statement",
+        "try_statement",
+        "switch_expression",
+        "lambda_expression",
+    ]),
+    csharp: new Set([
+        "if_statement",
+        "for_statement",
+        "for_each_statement",
+        "while_statement",
+        "do_statement",
+        "try_statement",
+        "switch_statement",
+        "lambda_expression",
+    ]),
+};
+function computeMaxNesting(node, language, currentDepth) {
+    const nestingTypes = NESTING_NODE_TYPES[language] || new Set();
+    let maxDepth = currentDepth;
+    for (const child of node.namedChildren) {
+        let childDepth = currentDepth;
+        if (nestingTypes.has(child.type)) {
+            childDepth = currentDepth + 1;
+            if (childDepth > maxDepth)
+                maxDepth = childDepth;
+        }
+        const subMax = computeMaxNesting(child, language, childDepth);
+        if (subMax > maxDepth)
+            maxDepth = subMax;
+    }
+    return maxDepth;
+}
+// ─── Dead Code Detection ────────────────────────────────────────────────────
+/** Node types that represent terminal statements (control flow never continues past them) */
+const TERMINAL_TYPES = {
+    python: new Set(["return_statement", "raise_statement", "break_statement", "continue_statement"]),
+    go: new Set(["return_statement", "break_statement", "continue_statement"]),
+    rust: new Set(["return_expression", "break_expression", "continue_expression"]),
+    java: new Set(["return_statement", "throw_statement", "break_statement", "continue_statement"]),
+    csharp: new Set(["return_statement", "throw_statement", "break_statement", "continue_statement"]),
+};
+/** Node types that represent blocks containing sequential statements */
+const BLOCK_TYPES = {
+    python: new Set(["block"]),
+    go: new Set(["block"]),
+    rust: new Set(["block"]),
+    java: new Set(["block"]),
+    csharp: new Set(["block"]),
+};
+function detectDeadCode(root, language) {
+    const deadLines = [];
+    const terminalTypes = TERMINAL_TYPES[language] || new Set();
+    const blockTypes = BLOCK_TYPES[language] || new Set();
+    walkTree(root, (node) => {
+        if (!blockTypes.has(node.type))
+            return;
+        const children = node.namedChildren;
+        let foundTerminal = false;
+        for (const child of children) {
+            if (foundTerminal) {
+                // Everything after a terminal statement is dead code
+                for (let line = child.startPosition.row + 1; line <= child.endPosition.row + 1; line++) {
+                    deadLines.push(line);
+                }
+            }
+            // Check if this child IS a terminal or CONTAINS a bare terminal
+            // (only direct children, not nested in sub-blocks)
+            if (terminalTypes.has(child.type)) {
+                foundTerminal = true;
+            }
+            // For expression_statement wrapping a return (Rust)
+            if (child.type === "expression_statement") {
+                const expr = child.namedChildren[0];
+                if (expr && terminalTypes.has(expr.type)) {
+                    foundTerminal = true;
+                }
+            }
+        }
+    });
+    return [...new Set(deadLines)].sort((a, b) => a - b);
+}
+// ─── Deep Nesting Detection ─────────────────────────────────────────────────
+function detectDeepNesting(root, language) {
+    const deepLines = [];
+    const nestingTypes = NESTING_NODE_TYPES[language] || new Set();
+    const threshold = 4; // Depth > 4 is "deep"
+    function walk(node, depth) {
+        for (const child of node.namedChildren) {
+            let childDepth = depth;
+            if (nestingTypes.has(child.type)) {
+                childDepth = depth + 1;
+            }
+            if (childDepth > threshold) {
+                // Mark all lines in this deeply-nested node
+                for (let line = child.startPosition.row + 1; line <= child.endPosition.row + 1; line++) {
+                    deepLines.push(line);
+                }
+            }
+            walk(child, childDepth);
+        }
+    }
+    walk(root, 0);
+    return [...new Set(deepLines)].sort((a, b) => a - b);
+}
+// ─── Weak Type Detection ────────────────────────────────────────────────────
+const WEAK_TYPE_PATTERNS = {
+    python: (node) => {
+        // typing.Any or just Any in type annotations
+        if (node.type === "type" || node.type === "annotation") {
+            return node.text.includes("Any");
+        }
+        return false;
+    },
+    go: (node) => {
+        // interface{} or any keyword
+        if (node.type === "interface_type") {
+            // Empty interface
+            return node.namedChildren.length === 0;
+        }
+        if (node.type === "type_identifier" && node.text === "any")
+            return true;
+        return false;
+    },
+    rust: (node) => {
+        // unsafe blocks and raw pointer casts
+        if (node.type === "unsafe_block")
+            return true;
+        if (node.type === "type_cast_expression") {
+            return node.text.includes("*const") || node.text.includes("*mut");
+        }
+        return false;
+    },
+    java: (node) => {
+        // Object type, Class<?>
+        if (node.type === "type_identifier" && node.text === "Object")
+            return true;
+        if (node.type === "generic_type" && node.text.includes("Class<?>"))
+            return true;
+        return false;
+    },
+    csharp: (node) => {
+        // dynamic, object
+        if (node.type === "predefined_type" && (node.text === "dynamic" || node.text === "object")) {
+            return true;
+        }
+        if (node.type === "identifier" && node.text === "dynamic")
+            return true;
+        return false;
+    },
+};
+function detectWeakTypes(root, language) {
+    const weakLines = [];
+    const checker = WEAK_TYPE_PATTERNS[language];
+    if (!checker)
+        return weakLines;
+    walkTree(root, (node) => {
+        if (checker(node)) {
+            weakLines.push(node.startPosition.row + 1);
+        }
+    });
+    return [...new Set(weakLines)].sort((a, b) => a - b);
+}
+// ─── Import Extraction ──────────────────────────────────────────────────────
+const IMPORT_NODE_TYPES = {
+    python: ["import_statement", "import_from_statement"],
+    go: ["import_declaration"],
+    rust: ["use_declaration"],
+    java: ["import_declaration"],
+    csharp: ["using_directive"],
+};
+function extractImports(root, language) {
+    const imports = [];
+    const importTypes = IMPORT_NODE_TYPES[language] || [];
+    walkTree(root, (node) => {
+        if (!importTypes.includes(node.type))
+            return;
+        switch (language) {
+            case "python":
+                if (node.type === "import_statement") {
+                    // import os, import os.path
+                    for (const child of node.namedChildren) {
+                        if (child.type === "dotted_name" || child.type === "aliased_import") {
+                            const name = child.type === "aliased_import" ? child.childForFieldName("name")?.text || child.text : child.text;
+                            if (name)
+                                imports.push(name);
+                        }
+                    }
+                }
+                else if (node.type === "import_from_statement") {
+                    // from flask import Flask
+                    const moduleNode = node.childForFieldName("module_name");
+                    if (moduleNode)
+                        imports.push(moduleNode.text);
+                }
+                break;
+            case "go":
+                // import "fmt" or import ( "fmt" "net/http" )
+                walkTree(node, (child) => {
+                    if (child.type === "import_spec" || child.type === "interpreted_string_literal") {
+                        const text = child.text.replace(/"/g, "");
+                        if (text && text !== "(" && text !== ")")
+                            imports.push(text);
+                    }
+                });
+                break;
+            case "rust":
+                // use std::io; use crate::module_name;
+                {
+                    const pathNode = node.namedChildren.find((c) => c.type === "scoped_identifier" ||
+                        c.type === "identifier" ||
+                        c.type === "use_wildcard" ||
+                        c.type === "use_list" ||
+                        c.type === "scoped_use_list");
+                    if (pathNode) {
+                        // Extract the root crate/module name
+                        const fullPath = pathNode.text;
+                        const rootModule = fullPath.split("::")[0];
+                        if (rootModule)
+                            imports.push(rootModule);
+                    }
+                }
+                break;
+            case "java":
+                // import com.example.Foo;
+                {
+                    const nameNode = node.namedChildren.find((c) => c.type === "scoped_identifier" || c.type === "identifier");
+                    if (nameNode)
+                        imports.push(nameNode.text);
+                }
+                break;
+            case "csharp":
+                // using System.IO;
+                {
+                    const nameNode = node.namedChildren.find((c) => c.type === "qualified_name" || c.type === "identifier");
+                    if (nameNode)
+                        imports.push(nameNode.text);
+                }
+                break;
+        }
+    });
+    return imports;
+}
+// ─── Class Extraction ───────────────────────────────────────────────────────
+const CLASS_NODE_TYPES = {
+    python: ["class_definition"],
+    go: ["type_declaration"],
+    rust: ["struct_item", "enum_item"],
+    java: ["class_declaration", "interface_declaration", "enum_declaration"],
+    csharp: ["class_declaration", "struct_declaration", "interface_declaration", "enum_declaration"],
+};
+function extractClasses(root, language) {
+    const classes = [];
+    const classTypes = CLASS_NODE_TYPES[language] || [];
+    walkTree(root, (node) => {
+        if (!classTypes.includes(node.type))
+            return;
+        if (language === "go" && node.type === "type_declaration") {
+            // Only count struct types:  type Foo struct { ... }
+            const spec = node.namedChildren.find((c) => c.type === "type_spec");
+            if (spec) {
+                const typeBody = spec.childForFieldName("type");
+                if (typeBody && typeBody.type === "struct_type") {
+                    const nameNode = spec.childForFieldName("name");
+                    if (nameNode)
+                        classes.push(nameNode.text);
+                }
+            }
+            return;
+        }
+        const nameNode = node.childForFieldName("name");
+        if (nameNode)
+            classes.push(nameNode.text);
+    });
+    return classes;
+}
+// ─── Decorator / Annotation Extraction ──────────────────────────────────────
+function extractDecorators(funcNode, language) {
+    const decorators = [];
+    switch (language) {
+        case "python": {
+            // Decorators are siblings before the function_definition, but in the
+            // tree-sitter grammar they're children of a decorated_definition parent.
+            const parent = funcNode.parent;
+            if (parent && parent.type === "decorated_definition") {
+                for (const child of parent.namedChildren) {
+                    if (child.type === "decorator") {
+                        // Extract decorator name (without the @)
+                        const text = child.text.replace(/^@/, "").split("(")[0];
+                        decorators.push(text);
+                    }
+                }
+            }
+            break;
+        }
+        case "java": {
+            // Annotations are modifiers before the method
+            const modifiers = funcNode.childForFieldName("modifiers") || funcNode.childForFieldName("modifier");
+            if (modifiers) {
+                for (const child of modifiers.namedChildren) {
+                    if (child.type === "marker_annotation" || child.type === "annotation") {
+                        decorators.push(child.text.replace(/^@/, "").split("(")[0]);
+                    }
+                }
+            }
+            break;
+        }
+        case "csharp": {
+            // Attribute lists before the method
+            const parent = funcNode.parent;
+            if (parent) {
+                for (const child of parent.namedChildren) {
+                    if (child.type === "attribute_list" && child.endPosition.row < funcNode.startPosition.row) {
+                        decorators.push(child.text.replace(/[\[\]]/g, "").split("(")[0]);
+                    }
+                }
+            }
+            break;
+        }
+    }
+    return decorators;
+}
+// ─── Async Detection ────────────────────────────────────────────────────────
+function checkIsAsync(funcNode, language) {
+    switch (language) {
+        case "python":
+            // In Python tree-sitter, async functions have type "function_definition"
+            // but the parent is a "decorated_definition" or the text starts with "async"
+            return funcNode.text.trimStart().startsWith("async ");
+        case "rust":
+            // async fn
+            return funcNode.text.trimStart().startsWith("async ");
+        case "java":
+        case "csharp": {
+            // Check modifiers for 'async' keyword
+            const modifiers = funcNode.childForFieldName("modifiers");
+            if (modifiers) {
+                return modifiers.children.some((c) => c.text === "async");
+            }
+            return false;
+        }
+        default:
+            return false;
+    }
+}
+// ─── Tree Walking Helper ────────────────────────────────────────────────────
+function walkTree(node, callback) {
+    callback(node);
+    for (const child of node.children) {
+        walkTree(child, callback);
+    }
+}
+function findFirstByType(node, type) {
+    if (node.type === type)
+        return node;
+    for (const child of node.children) {
+        const found = findFirstByType(child, type);
+        if (found)
+            return found;
+    }
+    return null;
+}
+//# sourceMappingURL=tree-sitter-ast.js.map

package/dist/ast/tree-sitter-ast.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"tree-sitter-ast.js","sourceRoot":"","sources":["../../src/ast/tree-sitter-ast.ts"],"names":[],"mappings":"AAAA,gFAAgF;AAChF,6EAA6E;AAC7E,gFAAgF;AAChF,2EAA2E;AAC3E,4EAA4E;AAC5E,4DAA4D;AAC5D,EAAE;AACF,wEAAwE;AACxE,wEAAwE;AACxE,6DAA6D;AAC7D,EAAE;AACF,yEAAyE;AACzE,8DAA8D;AAC9D,gFAAgF;AAEhF,OAAO,EAAE,aAAa,EAAE,MAAM,aAAa,CAAC;AAC5C,OAAO,EAAE,aAAa,EAAE,MAAM,UAAU,CAAC;AACzC,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,MAAM,WAAW,CAAC;AAG1C,MAAM,OAAO,GAAG,aAAa,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;AAE/C,+EAA+E;AAE/E,IAAI,WAAW,GAA4B,IAAI,CAAC;AAChD,IAAI,YAAY,GAA4B,IAAI,CAAC;AA2CjD,4BAA4B;AAC5B,MAAM,aAAa,GAA2B;IAC5C,MAAM,EAAE,yBAAyB;IACjC,EAAE,EAAE,qBAAqB;IACzB,IAAI,EAAE,uBAAuB;IAC7B,IAAI,EAAE,uBAAuB;IAC7B,MAAM,EAAE,0BAA0B;CACnC,CAAC;AAEF,4BAA4B;AAC5B,MAAM,aAAa,GAAG,IAAI,GAAG,EAA8B,CAAC;AAE5D,oDAAoD;AACpD,MAAM,SAAS,GAAG,OAAO,CAAC,aAAa,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;AAC1D,6CAA6C;AAC7C,uCAAuC;AACvC,MAAM,WAAW,GAAG,IAAI,CAAC,SAAS,EAAE,IAAI,EAAE,IAAI,EAAE,UAAU,CAAC,CAAC;AAE5D,KAAK,UAAU,UAAU;IACvB,IAAI,WAAW;QAAE,OAAO,WAAW,CAAC;IACpC,WAAW,GAAG,CAAC,KAAK,IAAI,EAAE;QACxB,IAAI,CAAC;YACH,MAAM,GAAG,GAAG,OAAO,CAAC,iBAAiB,CAAqB,CAAC;YAC3D,MAAM,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;YACxB,YAAY,GAAG,GAAG,CAAC;YACnB,OAAO,IAAI,CAAC;QACd,CAAC;QAAC,MAAM,CAAC;YACP,OAAO,KAAK,CAAC;QACf,CAAC;IACH,CAAC,CAAC,EAAE,CAAC;IACL,OAAO,WAAW,CAAC;AACrB,CAAC;AAED,KAAK,UAAU,WAAW,CAAC,IAAY;IACrC,IAAI,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC;QAAE,OAAO,aAAa,CAAC,GAAG,CAAC,IAAI,CAAE,CAAC;IAC7D,MAAM,IAAI,GAAG,aAAa,CAAC,IAAI,CAAC,CAAC;IACjC,IAAI,CAAC,IAAI;QAAE,OAAO,IAAI,CAAC;IACvB,IAAI,CAAC;QACH,MAAM,OAAO,GAAG,MAAM,YAAa,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,WAAW,EAAE,IAAI,CAAC,CAAC,CAAC;QAC3E,aAAa,CAAC,GAAG,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;QACjC,OAAO,OAAO,CAAC;IACjB,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,IAAI,CAAC;IACd,CAAC;AACH,CAAC;AAED,gFAAgF;AAEhF;;;GAGG;AACH,MAAM,CAAC,KAAK,UAAU,qBAAqB,CAAC,IAAY;IACtD,MAAM,KAAK,GAAG,MAAM,UAAU,EAAE,CAAC;IACjC,IAAI,CAAC,KAAK;QAAE,OAAO,KAAK,CAAC;IACzB,MAAM,OAAO,GAAG,MAAM,WAAW,CAAC,IAAI,CAAC,CAAC;IACxC,OAAO,OAAO,KAAK,IAAI,CAAC;AAC1B,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,qBAAqB,CAAC,IAAY;IAChD,OAAO,YAAY,KAAK,IAAI,IAAI,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;AAC1D,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,yBAAyB,CAAC,IAAY,EAAE,QAAgB;IACtE,IAAI,CAAC,YAAY;QAAE,MAAM,IAAI,KAAK,CAAC,6BAA6B,CAAC,CAAC;IAClE,MAAM,OAAO,GAAG,aAAa,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;IAC5C,IAAI,CAAC,OAAO;QAAE,MAAM,IAAI,KAAK,CAAC,2BAA2B,QAAQ,aAAa,CAAC,CAAC;IAChF,OAAO,eAAe,CAAC,IAAI,EAAE,QAAQ,EAAE,OAAO,CAAC,CAAC;AAClD,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,CAAC,KAAK,UAAU,qBAAqB,CAAC,IAAY,EAAE,QAAgB;IACxE,IAAI,CAAC,YAAY;QAAE,MAAM,IAAI,KAAK,CAAC,6BAA6B,CAAC,CAAC;IAClE,MAAM,OAAO,GAAG,MAAM,WAAW,CAAC,QAAQ,CAAC,CAAC;IAC5C,IAAI,CAAC,OAAO;QAAE,MAAM,IAAI,KAAK,CAAC,2BAA2B,QAAQ,gBAAgB,CAAC,CAAC;IACnF,OAAO,eAAe,CAAC,IAAI,EAAE,QAAQ,EAAE,OAAO,CAAC,CAAC;AAClD,CAAC;AAED;;GAEG;AACH,SAAS,eAAe,CAAC,IAAY,EAAE,QAAgB,EAAE,OAA2B;IAClF,MAAM,MAAM,GAAG,IAAI,YAAa,CAAC,MAAM,EAAE,CAAC;IAC1C,MAAM,CAAC,WAAW,CAAC,OAAO,CAAC,CAAC;IAC5B,MAAM,IAAI,GAAG,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IAChC,MAAM,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC;IAC3B,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IAE/B,0CAA0C;IAC1C,MAAM,SAAS,GAAG,gBAAgB,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;IACnD,MAAM,aAAa,GAAG,cAAc,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;IACrD,MAAM,aAAa,GAAG,iBAAiB,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;IACxD,MAAM,YAAY,GAAG,eAAe,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;IACrD,MAAM,OAAO,GAAG,cAAc,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;IAC/C,MAAM,OAAO,GAAG,cAAc,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;IAE/C,6BAA6B;IAC7B,MAAM,wBAAwB,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,oBAAoB,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC;IACpG,MAAM,eAAe,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,eAAe,CAAC,EAAE,CAAC,CAAC,CAAC;IAE1F,OAAO;QACL,QAAQ;QACR,UAAU,EAAE,KAAK,CAAC,MAAM;QACxB,SAAS;QACT,wBAAwB;QACxB,eAAe;QACf,aAAa;QACb,aAAa;QACb,YAAY;QACZ,OAAO;QACP,OAAO,EAAE,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,SAAS;KAClD,CAAC;AACJ,CAAC;AAED,+EAA+E;AAE/E,yEAAyE;AACzE,MAAM,mBAAmB,GAA6B;IACpD,MAAM,EAAE,CAAC,qBAAqB,CAAC;IAC/B,EAAE,EAAE,CAAC,sBAAsB,EAAE,oBAAoB,CAAC;IAClD,IAAI,EAAE,CAAC,eAAe,CAAC;IACvB,IAAI,EAAE,CAAC,oBAAoB,EAAE,yBAAyB,CAAC;IACvD,MAAM,EAAE,CAAC,oBAAoB,EAAE,yBAAyB,EAAE,0BAA0B,CAAC;CACtF,CAAC;AAEF,SAAS,gBAAgB,CAAC,IAAgB,EAAE,QAAgB;IAC1D,MAAM,SAAS,GAAG,mBAAmB,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAC;IACtD,MAAM,SAAS,GAAmB,EAAE,CAAC;IACrC,MAAM,WAAW,GAAG,kBAAkB,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;IAEvD,QAAQ,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,EAAE;QACtB,IAAI,SAAS,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;YAClC,MAAM,IAAI,GAAG,mBAAmB,CAAC,IAAI,EAAE,QAAQ,EAAE,WAAW,CAAC,CAAC;YAC9D,IAAI,IAAI;gBAAE,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACjC,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,OAAO,SAAS,CAAC;AACnB,CAAC;AAQD,SAAS,kBAAkB,CAAC,IAAgB,EAAE,QAAgB;IAC5D,MAAM,UAAU,GAAG,gBAAgB,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAC;IACpD,MAAM,MAAM,GAAiB,EAAE,CAAC;IAEhC,QAAQ,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,EAAE;QACtB,IAAI,UAAU,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;YACnC,MAAM,QAAQ,GAAG,IAAI,CAAC,iBAAiB,CAAC,MAAM,CAAC,CAAC;YAChD,IAAI,QAAQ,EAAE,CAAC;gBACb,MAAM,CAAC,IAAI,CAAC;oBACV,IAAI,EAAE,QAAQ,CAAC,IAAI;oBACnB,SAAS,EAAE,IAAI,CAAC,aAAa,CAAC,GAAG,GAAG,CAAC;oBACrC,OAAO,EAAE,IAAI,CAAC,WAAW,CAAC,GAAG,GAAG,CAAC;iBAClC,CAAC,CAAC;YACL,CAAC;QACH,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,SAAS,mBAAmB,CAAC,IAAgB,EAAE,QAAgB,EAAE,WAAyB;IACxF,oBAAoB;IACpB,MAAM,QAAQ,GAAG,IAAI,CAAC,iBAAiB,CAAC,MAAM,CAAC,CAAC;IAChD,IAAI,IAAI,GAAG,QAAQ,EAAE,IAAI,IAAI,aAAa,CAAC;IAE3C,mDAAmD;IACnD,IAAI,QAAQ,KAAK,IAAI,IAAI,IAAI,CAAC,IAAI,KAAK,oBAAoB,EAAE,CAAC;QAC5D,MAAM,QAAQ,GAAG,IAAI,CAAC,iBAAiB,CAAC,UAAU,CAAC,CAAC;QACpD,IAAI,QAAQ,EAAE,CAAC;YACb,oDAAoD;YACpD,MAAM,QAAQ,GAAG,eAAe,CAAC,QAAQ,EAAE,iBAAiB,CAAC,CAAC;YAC9D,IAAI,QAAQ,EAAE,CAAC;gBACb,IAAI,GAAG,GAAG,QAAQ,CAAC,IAAI,IAAI,IAAI,EAAE,CAAC;YACpC,CAAC;QACH,CAAC;IACH,CAAC;IAED,sCAAsC;IACtC,MAAM,SAAS,GAAG,IAAI,CAAC,aAAa,CAAC,GAAG,GAAG,CAAC,CAAC;IAC7C,MAAM,OAAO,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,GAAG,CAAC,CAAC;IACzC,MAAM,eAAe,GAAG,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,SAAS,IAAI,CAAC,CAAC,SAAS,IAAI,OAAO,IAAI,CAAC,CAAC,OAAO,CAAC,CAAC;IAElG,IAAI,eAAe,IAAI,QAAQ,KAAK,IAAI,EAAE,CAAC;QACzC,IAAI,GAAG,GAAG,eAAe,CAAC,IAAI,IAAI,IAAI,EAAE,CAAC;IAC3C,CAAC;IAED,mBAAmB;IACnB,MAAM,UAAU,GAAG,eAAe,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;IAEnD,gCAAgC;IAChC,MAAM,UAAU,GAAG,2BAA2B,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;IAE/D,4BAA4B;IAC5B,MAAM,UAAU,GAAG,iBAAiB,CAAC,IAAI,EAAE,QAAQ,EAAE,CAAC,CAAC,CAAC;IAExD,0CAA0C;IAC1C,MAAM,UAAU,GAAG,iBAAiB,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;IAErD,kBAAkB;IAClB,MAAM,OAAO,GAAG,YAAY,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;IAE7C,MAAM,IAAI,GAAiB;QACzB,IAAI;QACJ,SAAS;QACT,OAAO;QACP,SAAS,EAAE,OAAO,GAAG,SAAS,GAAG,CAAC;QAClC,cAAc,EAAE,UAAU;QAC1B,oBAAoB,EAAE,UAAU;QAChC,eAAe,EAAE,UAAU;KAC5B,CAAC;IAEF,IAAI,UAAU,CAAC,MAAM,GAAG,CAAC;QAAE,IAAI,CAAC,UAAU,GAAG,UAAU,CAAC;IACxD,IAAI,eAAe;QAAE,IAAI,CAAC,SAAS,GAAG,eAAe,CAAC,IAAI,CAAC;IAC3D,IAAI,OAAO;QAAE,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC;IAEjC,OAAO,IAAI,CAAC;AACd,CAAC;AAED,+EAA+E;AAE/E,SAAS,eAAe,CAAC,QAAoB,EAAE,QAAgB;IAC7D,IAAI,UAAU,GAAsB,IAAI,CAAC;IAEzC,QAAQ,QAAQ,EAAE,CAAC;QACjB,KAAK,QAAQ;YACX,UAAU,GAAG,QAAQ,CAAC,iBAAiB,CAAC,YAAY,CAAC,CAAC;YACtD,IAAI,CAAC,UAAU;gBAAE,OAAO,CAAC,CAAC;YAC1B,wDAAwD;YACxD,OAAO,UAAU,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE;gBAC3C,IAAI,CAAC,CAAC,IAAI,KAAK,YAAY,IAAI,CAAC,CAAC,CAAC,IAAI,KAAK,MAAM,IAAI,CAAC,CAAC,IAAI,KAAK,KAAK,CAAC;oBAAE,OAAO,KAAK,CAAC;gBACrF,6DAA6D;gBAC7D,IACE,CAAC,CAAC,IAAI,KAAK,YAAY;oBACvB,CAAC,CAAC,IAAI,KAAK,mBAAmB;oBAC9B,CAAC,CAAC,IAAI,KAAK,iBAAiB;oBAC5B,CAAC,CAAC,IAAI,KAAK,yBAAyB;oBACpC,CAAC,CAAC,IAAI,KAAK,oBAAoB;oBAC/B,CAAC,CAAC,IAAI,KAAK,0BAA0B,EACrC,CAAC;oBACD,8CAA8C;oBAC9C,IAAI,CAAC,CAAC,IAAI,KAAK,iBAAiB,EAAE,CAAC;wBACjC,MAAM,SAAS,GAAG,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC;wBACrC,IAAI,SAAS,IAAI,CAAC,SAAS,CAAC,IAAI,KAAK,MAAM,IAAI,SAAS,CAAC,IAAI,KAAK,KAAK,CAAC;4BAAE,OAAO,KAAK,CAAC;oBACzF,CAAC;oBACD,OAAO,IAAI,CAAC;gBACd,CAAC;gBACD,OAAO,KAAK,CAAC;YACf,CAAC,CAAC,CAAC,MAAM,CAAC;QAEZ,KAAK,IAAI;YACP,UAAU,GAAG,QAAQ,CAAC,iBAAiB,CAAC,YAAY,CAAC,CAAC;YACtD,IAAI,CAAC,UAAU;gBAAE,OAAO,CAAC,CAAC;YAC1B,OAAO,UAAU,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,uBAAuB,CAAC,CAAC,MAAM,CAAC;QAE3F,KAAK,MAAM;YACT,UAAU,GAAG,QAAQ,CAAC,iBAAiB,CAAC,YAAY,CAAC,CAAC;YACtD,IAAI,CAAC,UAAU;gBAAE,OAAO,CAAC,CAAC;YAC1B,OAAO,UAAU,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,WAAW,IAAI,CAAC,CAAC,IAAI,KAAK,gBAAgB,CAAC,CAAC,MAAM,CAAC;QAE9G,KAAK,MAAM;YACT,UAAU,GAAG,QAAQ,CAAC,iBAAiB,CAAC,YAAY,CAAC,CAAC;YACtD,IAAI,CAAC,UAAU;gBAAE,OAAO,CAAC,CAAC;YAC1B,OAAO,UAAU,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,kBAAkB,IAAI,CAAC,CAAC,IAAI,KAAK,kBAAkB,CAAC;iBAC1G,MAAM,CAAC;QAEZ,KAAK,QAAQ;YACX,UAAU,GAAG,QAAQ,CAAC,iBAAiB,CAAC,YAAY,CAAC,CAAC;YACtD,IAAI,CAAC,UAAU;gBAAE,OAAO,CAAC,CAAC;YAC1B,OAAO,UAAU,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,WAAW,CAAC,CAAC,MAAM,CAAC;QAE/E;YACE,OAAO,CAAC,CAAC;IACb,CAAC;AACH,CAAC;AAED,+EAA+E;AAC/E,qCAAqC;AAErC,MAAM,mBAAmB,GAAgC;IACvD,MAAM,EAAE,IAAI,GAAG,CAAC;QACd,cAAc;QACd,aAAa;QACb,eAAe;QACf,iBAAiB;QACjB,eAAe;QACf,wBAAwB;QACxB,eAAe;QACf,0DAA0D;QAC1D,kBAAkB;KACnB,CAAC;IACF,EAAE,EAAE,IAAI,GAAG,CAAC,CAAC,cAAc,EAAE,eAAe,EAAE,iBAAiB,EAAE,cAAc,EAAE,WAAW,EAAE,oBAAoB,CAAC,CAAC;IACpH,IAAI,EAAE,IAAI,GAAG,CAAC,CAAC,eAAe,EAAE,gBAAgB,EAAE,kBAAkB,EAAE,iBAAiB,EAAE,WAAW,CAAC,CAAC;IACtG,IAAI,EAAE,IAAI,GAAG,CAAC;QACZ,cAAc;QACd,eAAe;QACf,wBAAwB;QACxB,iBAAiB;QACjB,cAAc;QACd,cAAc;QACd,8BAA8B;QAC9B,oBAAoB;KACrB,CAAC;IACF,MAAM,EAAE,IAAI,GAAG,CAAC;QACd,cAAc;QACd,eAAe;QACf,oBAAoB;QACpB,iBAAiB;QACjB,cAAc;QACd,cAAc;QACd,gBAAgB;QAChB,wBAAwB;KACzB,CAAC;CACH,CAAC;AAEF,mDAAmD;AACnD,MAAM,WAAW,GAAG,IAAI,GAAG,CAAC,CAAC,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC,CAAC;AAEvD,SAAS,2BAA2B,CAAC,QAAoB,EAAE,QAAgB;IACzE,IAAI,UAAU,GAAG,CAAC,CAAC,CAAC,YAAY;IAChC,MAAM,aAAa,GAAG,mBAAmB,CAAC,QAAQ,CAAC,IAAI,IAAI,GAAG,EAAE,CAAC;IAEjE,QAAQ,CAAC,QAAQ,EAAE,CAAC,IAAI,EAAE,EAAE;QAC1B,IAAI,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;YACjC,UAAU,EAAE,CAAC;QACf,CAAC;QACD,0DAA0D;QAC1D,IAAI,IAAI,CAAC,IAAI,KAAK,mBAAmB,EAAE,CAAC;YACtC,MAAM,EAAE,GAAG,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,IAAI,IAAI,CAAC,CAAC,IAAI,KAAK,IAAI,IAAI,CAAC,CAAC,IAAI,KAAK,IAAI,IAAI,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,CAAC;YAC/G,IAAI,EAAE;gBAAE,UAAU,EAAE,CAAC;QACvB,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,OAAO,UAAU,CAAC;AACpB,CAAC;AAED,+EAA+E;AAE/E,MAAM,kBAAkB,GAAgC;IACtD,MAAM,EAAE,IAAI,GAAG,CAAC;QACd,cAAc;QACd,eAAe;QACf,iBAAiB;QACjB,gBAAgB;QAChB,eAAe;QACf,eAAe;QACf,eAAe;QACf,qBAAqB;QACrB,kBAAkB;KACnB,CAAC;IACF,EAAE,EAAE,IAAI,GAAG,CAAC;QACV,cAAc;QACd,eAAe;QACf,kBAAkB;QAClB,uBAAuB;QACvB,6BAA6B;QAC7B,cAAc;KACf,CAAC;IACF,IAAI,EAAE,IAAI,GAAG,CAAC;QACZ,eAAe;QACf,gBAAgB;QAChB,kBAAkB;QAClB,iBAAiB;QACjB,kBAAkB;QAClB,oBAAoB;KACrB,CAAC;IACF,IAAI,EAAE,IAAI,GAAG,CAAC;QACZ,cAAc;QACd,eAAe;QACf,wBAAwB;QACxB,iBAAiB;QACjB,cAAc;QACd,eAAe;QACf,mBAAmB;QACnB,mBAAmB;KACpB,CAAC;IACF,MAAM,EAAE,IAAI,GAAG,CAAC;QACd,cAAc;QACd,eAAe;QACf,oBAAoB;QACpB,iBAAiB;QACjB,cAAc;QACd,eAAe;QACf,kBAAkB;QAClB,mBAAmB;KACpB,CAAC;CACH,CAAC;AAEF,SAAS,iBAAiB,CAAC,IAAgB,EAAE,QAAgB,EAAE,YAAoB;IACjF,MAAM,YAAY,GAAG,kBAAkB,CAAC,QAAQ,CAAC,IAAI,IAAI,GAAG,EAAE,CAAC;IAC/D,IAAI,QAAQ,GAAG,YAAY,CAAC;IAE5B,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,aAAa,EAAE,CAAC;QACvC,IAAI,UAAU,GAAG,YAAY,CAAC;QAC9B,IAAI,YAAY,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC;YACjC,UAAU,GAAG,YAAY,GAAG,CAAC,CAAC;YAC9B,IAAI,UAAU,GAAG,QAAQ;gBAAE,QAAQ,GAAG,UAAU,CAAC;QACnD,CAAC;QACD,MAAM,MAAM,GAAG,iBAAiB,CAAC,KAAK,EAAE,QAAQ,EAAE,UAAU,CAAC,CAAC;QAC9D,IAAI,MAAM,GAAG,QAAQ;YAAE,QAAQ,GAAG,MAAM,CAAC;IAC3C,CAAC;IAED,OAAO,QAAQ,CAAC;AAClB,CAAC;AAED,+EAA+E;AAE/E,6FAA6F;AAC7F,MAAM,cAAc,GAAgC;IAClD,MAAM,EAAE,IAAI,GAAG,CAAC,CAAC,kBAAkB,EAAE,iBAAiB,EAAE,iBAAiB,EAAE,oBAAoB,CAAC,CAAC;IACjG,EAAE,EAAE,IAAI,GAAG,CAAC,CAAC,kBAAkB,EAAE,iBAAiB,EAAE,oBAAoB,CAAC,CAAC;IAC1E,IAAI,EAAE,IAAI,GAAG,CAAC,CAAC,mBAAmB,EAAE,kBAAkB,EAAE,qBAAqB,CAAC,CAAC;IAC/E,IAAI,EAAE,IAAI,GAAG,CAAC,CAAC,kBAAkB,EAAE,iBAAiB,EAAE,iBAAiB,EAAE,oBAAoB,CAAC,CAAC;IAC/F,MAAM,EAAE,IAAI,GAAG,CAAC,CAAC,kBAAkB,EAAE,iBAAiB,EAAE,iBAAiB,EAAE,oBAAoB,CAAC,CAAC;CAClG,CAAC;AAEF,wEAAwE;AACxE,MAAM,WAAW,GAAgC;IAC/C,MAAM,EAAE,IAAI,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC;IAC1B,EAAE,EAAE,IAAI,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC;IACtB,IAAI,EAAE,IAAI,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC;IACxB,IAAI,EAAE,IAAI,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC;IACxB,MAAM,EAAE,IAAI,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC;CAC3B,CAAC;AAEF,SAAS,cAAc,CAAC,IAAgB,EAAE,QAAgB;IACxD,MAAM,SAAS,GAAa,EAAE,CAAC;IAC/B,MAAM,aAAa,GAAG,cAAc,CAAC,QAAQ,CAAC,IAAI,IAAI,GAAG,EAAE,CAAC;IAC5D,MAAM,UAAU,GAAG,WAAW,CAAC,QAAQ,CAAC,IAAI,IAAI,GAAG,EAAE,CAAC;IAEtD,QAAQ,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,EAAE;QACtB,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC;YAAE,OAAO;QAEvC,MAAM,QAAQ,GAAG,IAAI,CAAC,aAAa,CAAC;QACpC,IAAI,aAAa,GAAG,KAAK,CAAC;QAE1B,KAAK,MAAM,KAAK,IAAI,QAAQ,EAAE,CAAC;YAC7B,IAAI,aAAa,EAAE,CAAC;gBAClB,qDAAqD;gBACrD,KAAK,IAAI,IAAI,GAAG,KAAK,CAAC,aAAa,CAAC,GAAG,GAAG,CAAC,EAAE,IAAI,IAAI,KAAK,CAAC,WAAW,CAAC,GAAG,GAAG,CAAC,EAAE,IAAI,EAAE,EAAE,CAAC;oBACvF,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBACvB,CAAC;YACH,CAAC;YACD,gEAAgE;YAChE,mDAAmD;YACnD,IAAI,aAAa,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC;gBAClC,aAAa,GAAG,IAAI,CAAC;YACvB,CAAC;YACD,oDAAoD;YACpD,IAAI,KAAK,CAAC,IAAI,KAAK,sBAAsB,EAAE,CAAC;gBAC1C,MAAM,IAAI,GAAG,KAAK,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC;gBACpC,IAAI,IAAI,IAAI,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;oBACzC,aAAa,GAAG,IAAI,CAAC;gBACvB,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,OAAO,CAAC,GAAG,IAAI,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;AACvD,CAAC;AAED,+EAA+E;AAE/E,SAAS,iBAAiB,CAAC,IAAgB,EAAE,QAAgB;IAC3D,MAAM,SAAS,GAAa,EAAE,CAAC;IAC/B,MAAM,YAAY,GAAG,kBAAkB,CAAC,QAAQ,CAAC,IAAI,IAAI,GAAG,EAAE,CAAC;IAC/D,MAAM,SAAS,GAAG,CAAC,CAAC,CAAC,sBAAsB;IAE3C,SAAS,IAAI,CAAC,IAAgB,EAAE,KAAa;QAC3C,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,aAAa,EAAE,CAAC;YACvC,IAAI,UAAU,GAAG,KAAK,CAAC;YACvB,IAAI,YAAY,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC;gBACjC,UAAU,GAAG,KAAK,GAAG,CAAC,CAAC;YACzB,CAAC;YACD,IAAI,UAAU,GAAG,SAAS,EAAE,CAAC;gBAC3B,4CAA4C;gBAC5C,KAAK,IAAI,IAAI,GAAG,KAAK,CAAC,aAAa,CAAC,GAAG,GAAG,CAAC,EAAE,IAAI,IAAI,KAAK,CAAC,WAAW,CAAC,GAAG,GAAG,CAAC,EAAE,IAAI,EAAE,EAAE,CAAC;oBACvF,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBACvB,CAAC;YACH,CAAC;YACD,IAAI,CAAC,KAAK,EAAE,UAAU,CAAC,CAAC;QAC1B,CAAC;IACH,CAAC;IAED,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;IACd,OAAO,CAAC,GAAG,IAAI,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;AACvD,CAAC;AAED,+EAA+E;AAE/E,MAAM,kBAAkB,GAAkD;IACxE,MAAM,EAAE,CAAC,IAAI,EAAE,EAAE;QACf,6CAA6C;QAC7C,IAAI,IAAI,CAAC,IAAI,KAAK,MAAM,IAAI,IAAI,CAAC,IAAI,KAAK,YAAY,EAAE,CAAC;YACvD,OAAO,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;QACnC,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD,EAAE,EAAE,CAAC,IAAI,EAAE,EAAE;QACX,6BAA6B;QAC7B,IAAI,IAAI,CAAC,IAAI,KAAK,gBAAgB,EAAE,CAAC;YACnC,kBAAkB;YAClB,OAAO,IAAI,CAAC,aAAa,CAAC,MAAM,KAAK,CAAC,CAAC;QACzC,CAAC;QACD,IAAI,IAAI,CAAC,IAAI,KAAK,iBAAiB,IAAI,IAAI,CAAC,IAAI,KAAK,KAAK;YAAE,OAAO,IAAI,CAAC;QACxE,OAAO,KAAK,CAAC;IACf,CAAC;IACD,IAAI,EAAE,CAAC,IAAI,EAAE,EAAE;QACb,sCAAsC;QACtC,IAAI,IAAI,CAAC,IAAI,KAAK,cAAc;YAAE,OAAO,IAAI,CAAC;QAC9C,IAAI,IAAI,CAAC,IAAI,KAAK,sBAAsB,EAAE,CAAC;YACzC,OAAO,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;QACpE,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD,IAAI,EAAE,CAAC,IAAI,EAAE,EAAE;QACb,wBAAwB;QACxB,IAAI,IAAI,CAAC,IAAI,KAAK,iBAAiB,IAAI,IAAI,CAAC,IAAI,KAAK,QAAQ;YAAE,OAAO,IAAI,CAAC;QAC3E,IAAI,IAAI,CAAC,IAAI,KAAK,cAAc,IAAI,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,UAAU,CAAC;YAAE,OAAO,IAAI,CAAC;QAChF,OAAO,KAAK,CAAC;IACf,CAAC;IACD,MAAM,EAAE,CAAC,IAAI,EAAE,EAAE;QACf,kBAAkB;QAClB,IAAI,IAAI,CAAC,IAAI,KAAK,iBAAiB,IAAI,CAAC,IAAI,CAAC,IAAI,KAAK,SAAS,IAAI,IAAI,CAAC,IAAI,KAAK,QAAQ,CAAC,EAAE,CAAC;YAC3F,OAAO,IAAI,CAAC;QACd,CAAC;QACD,IAAI,IAAI,CAAC,IAAI,KAAK,YAAY,IAAI,IAAI,CAAC,IAAI,KAAK,SAAS;YAAE,OAAO,IAAI,CAAC;QACvE,OAAO,KAAK,CAAC;IACf,CAAC;CACF,CAAC;AAEF,SAAS,eAAe,CAAC,IAAgB,EAAE,QAAgB;IACzD,MAAM,SAAS,GAAa,EAAE,CAAC;IAC/B,MAAM,OAAO,GAAG,kBAAkB,CAAC,QAAQ,CAAC,CAAC;IAC7C,IAAI,CAAC,OAAO;QAAE,OAAO,SAAS,CAAC;IAE/B,QAAQ,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,EAAE;QACtB,IAAI,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC;YAClB,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;QAC7C,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,OAAO,CAAC,GAAG,IAAI,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;AACvD,CAAC;AAED,+EAA+E;AAE/E,MAAM,iBAAiB,GAA6B;IAClD,MAAM,EAAE,CAAC,kBAAkB,EAAE,uBAAuB,CAAC;IACrD,EAAE,EAAE,CAAC,oBAAoB,CAAC;IAC1B,IAAI,EAAE,CAAC,iBAAiB,CAAC;IACzB,IAAI,EAAE,CAAC,oBAAoB,CAAC;IAC5B,MAAM,EAAE,CAAC,iBAAiB,CAAC;CAC5B,CAAC;AAEF,SAAS,cAAc,CAAC,IAAgB,EAAE,QAAgB;IACxD,MAAM,OAAO,GAAa,EAAE,CAAC;IAC7B,MAAM,WAAW,GAAG,iBAAiB,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAC;IAEtD,QAAQ,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,EAAE;QACtB,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC;YAAE,OAAO;QAE7C,QAAQ,QAAQ,EAAE,CAAC;YACjB,KAAK,QAAQ;gBACX,IAAI,IAAI,CAAC,IAAI,KAAK,kBAAkB,EAAE,CAAC;oBACrC,4BAA4B;oBAC5B,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,aAAa,EAAE,CAAC;wBACvC,IAAI,KAAK,CAAC,IAAI,KAAK,aAAa,IAAI,KAAK,CAAC,IAAI,KAAK,gBAAgB,EAAE,CAAC;4BACpE,MAAM,IAAI,GACR,KAAK,CAAC,IAAI,KAAK,gBAAgB,CAAC,CAAC,CAAC,KAAK,CAAC,iBAAiB,CAAC,MAAM,CAAC,EAAE,IAAI,IAAI,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC;4BACrG,IAAI,IAAI;gCAAE,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;wBAC/B,CAAC;oBACH,CAAC;gBACH,CAAC;qBAAM,IAAI,IAAI,CAAC,IAAI,KAAK,uBAAuB,EAAE,CAAC;oBACjD,0BAA0B;oBAC1B,MAAM,UAAU,GAAG,IAAI,CAAC,iBAAiB,CAAC,aAAa,CAAC,CAAC;oBACzD,IAAI,UAAU;wBAAE,OAAO,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;gBAChD,CAAC;gBACD,MAAM;YAER,KAAK,IAAI;gBACP,8CAA8C;gBAC9C,QAAQ,CAAC,IAAI,EAAE,CAAC,KAAK,EAAE,EAAE;oBACvB,IAAI,KAAK,CAAC,IAAI,KAAK,aAAa,IAAI,KAAK,CAAC,IAAI,KAAK,4BAA4B,EAAE,CAAC;wBAChF,MAAM,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;wBAC1C,IAAI,IAAI,IAAI,IAAI,KAAK,GAAG,IAAI,IAAI,KAAK,GAAG;4BAAE,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;oBAC/D,CAAC;gBACH,CAAC,CAAC,CAAC;gBACH,MAAM;YAER,KAAK,MAAM;gBACT,uCAAuC;gBACvC,CAAC;oBACC,MAAM,QAAQ,GAAG,IAAI,CAAC,aAAa,CAAC,IAAI,CACtC,CAAC,CAAC,EAAE,EAAE,CACJ,CAAC,CAAC,IAAI,KAAK,mBAAmB;wBAC9B,CAAC,CAAC,IAAI,KAAK,YAAY;wBACvB,CAAC,CAAC,IAAI,KAAK,cAAc;wBACzB,CAAC,CAAC,IAAI,KAAK,UAAU;wBACrB,CAAC,CAAC,IAAI,KAAK,iBAAiB,CAC/B,CAAC;oBACF,IAAI,QAAQ,EAAE,CAAC;wBACb,qCAAqC;wBACrC,MAAM,QAAQ,GAAG,QAAQ,CAAC,IAAI,CAAC;wBAC/B,MAAM,UAAU,GAAG,QAAQ,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;wBAC3C,IAAI,UAAU;4BAAE,OAAO,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;oBAC3C,CAAC;gBACH,CAAC;gBACD,MAAM;YAER,KAAK,MAAM;gBACT,0BAA0B;gBAC1B,CAAC;oBACC,MAAM,QAAQ,GAAG,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,mBAAmB,IAAI,CAAC,CAAC,IAAI,KAAK,YAAY,CAAC,CAAC;oBAC3G,IAAI,QAAQ;wBAAE,OAAO,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;gBAC5C,CAAC;gBACD,MAAM;YAER,KAAK,QAAQ;gBACX,mBAAmB;gBACnB,CAAC;oBACC,MAAM,QAAQ,GAAG,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,gBAAgB,IAAI,CAAC,CAAC,IAAI,KAAK,YAAY,CAAC,CAAC;oBACxG,IAAI,QAAQ;wBAAE,OAAO,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;gBAC5C,CAAC;gBACD,MAAM;QACV,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,OAAO,OAAO,CAAC;AACjB,CAAC;AAED,+EAA+E;AAE/E,MAAM,gBAAgB,GAA6B;IACjD,MAAM,EAAE,CAAC,kBAAkB,CAAC;IAC5B,EAAE,EAAE,CAAC,kBAAkB,CAAC;IACxB,IAAI,EAAE,CAAC,aAAa,EAAE,WAAW,CAAC;IAClC,IAAI,EAAE,CAAC,mBAAmB,EAAE,uBAAuB,EAAE,kBAAkB,CAAC;IACxE,MAAM,EAAE,CAAC,mBAAmB,EAAE,oBAAoB,EAAE,uBAAuB,EAAE,kBAAkB,CAAC;CACjG,CAAC;AAEF,SAAS,cAAc,CAAC,IAAgB,EAAE,QAAgB;IACxD,MAAM,OAAO,GAAa,EAAE,CAAC;IAC7B,MAAM,UAAU,GAAG,gBAAgB,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAC;IAEpD,QAAQ,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,EAAE;QACtB,IAAI,CAAC,UAAU,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC;YAAE,OAAO;QAE5C,IAAI,QAAQ,KAAK,IAAI,IAAI,IAAI,CAAC,IAAI,KAAK,kBAAkB,EAAE,CAAC;YAC1D,oDAAoD;YACpD,MAAM,IAAI,GAAG,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,WAAW,CAAC,CAAC;YACpE,IAAI,IAAI,EAAE,CAAC;gBACT,MAAM,QAAQ,GAAG,IAAI,CAAC,iBAAiB,CAAC,MAAM,CAAC,CAAC;gBAChD,IAAI,QAAQ,IAAI,QAAQ,CAAC,IAAI,KAAK,aAAa,EAAE,CAAC;oBAChD,MAAM,QAAQ,GAAG,IAAI,CAAC,iBAAiB,CAAC,MAAM,CAAC,CAAC;oBAChD,IAAI,QAAQ;wBAAE,OAAO,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;gBAC5C,CAAC;YACH,CAAC;YACD,OAAO;QACT,CAAC;QAED,MAAM,QAAQ,GAAG,IAAI,CAAC,iBAAiB,CAAC,MAAM,CAAC,CAAC;QAChD,IAAI,QAAQ;YAAE,OAAO,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;IAC5C,CAAC,CAAC,CAAC;IAEH,OAAO,OAAO,CAAC;AACjB,CAAC;AAED,+EAA+E;AAE/E,SAAS,iBAAiB,CAAC,QAAoB,EAAE,QAAgB;IAC/D,MAAM,UAAU,GAAa,EAAE,CAAC;IAEhC,QAAQ,QAAQ,EAAE,CAAC;QACjB,KAAK,QAAQ,CAAC,CAAC,CAAC;YACd,qEAAqE;YACrE,yEAAyE;YACzE,MAAM,MAAM,GAAG,QAAQ,CAAC,MAAM,CAAC;YAC/B,IAAI,MAAM,IAAI,MAAM,CAAC,IAAI,KAAK,sBAAsB,EAAE,CAAC;gBACrD,KAAK,MAAM,KAAK,IAAI,MAAM,CAAC,aAAa,EAAE,CAAC;oBACzC,IAAI,KAAK,CAAC,IAAI,KAAK,WAAW,EAAE,CAAC;wBAC/B,yCAAyC;wBACzC,MAAM,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;wBACxD,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;oBACxB,CAAC;gBACH,CAAC;YACH,CAAC;YACD,MAAM;QACR,CAAC;QACD,KAAK,MAAM,CAAC,CAAC,CAAC;YACZ,8CAA8C;YAC9C,MAAM,SAAS,GAAG,QAAQ,CAAC,iBAAiB,CAAC,WAAW,CAAC,IAAI,QAAQ,CAAC,iBAAiB,CAAC,UAAU,CAAC,CAAC;YACpG,IAAI,SAAS,EAAE,CAAC;gBACd,KAAK,MAAM,KAAK,IAAI,SAAS,CAAC,aAAa,EAAE,CAAC;oBAC5C,IAAI,KAAK,CAAC,IAAI,KAAK,mBAAmB,IAAI,KAAK,CAAC,IAAI,KAAK,YAAY,EAAE,CAAC;wBACtE,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;oBAC9D,CAAC;gBACH,CAAC;YACH,CAAC;YACD,MAAM;QACR,CAAC;QACD,KAAK,QAAQ,CAAC,CAAC,CAAC;YACd,oCAAoC;YACpC,MAAM,MAAM,GAAG,QAAQ,CAAC,MAAM,CAAC;YAC/B,IAAI,MAAM,EAAE,CAAC;gBACX,KAAK,MAAM,KAAK,IAAI,MAAM,CAAC,aAAa,EAAE,CAAC;oBACzC,IAAI,KAAK,CAAC,IAAI,KAAK,gBAAgB,IAAI,KAAK,CAAC,WAAW,CAAC,GAAG,GAAG,QAAQ,CAAC,aAAa,CAAC,GAAG,EAAE,CAAC;wBAC1F,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,SAAS,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;oBACnE,CAAC;gBACH,CAAC;YACH,CAAC;YACD,MAAM;QACR,CAAC;IACH,CAAC;IAED,OAAO,UAAU,CAAC;AACpB,CAAC;AAED,+EAA+E;AAE/E,SAAS,YAAY,CAAC,QAAoB,EAAE,QAAgB;IAC1D,QAAQ,QAAQ,EAAE,CAAC;QACjB,KAAK,QAAQ;YACX,yEAAyE;YACzE,6EAA6E;YAC7E,OAAO,QAAQ,CAAC,IAAI,CAAC,SAAS,EAAE,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC;QAExD,KAAK,MAAM;YACT,WAAW;YACX,OAAO,QAAQ,CAAC,IAAI,CAAC,SAAS,EAAE,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC;QAExD,KAAK,MAAM,CAAC;QACZ,KAAK,QAAQ,CAAC,CAAC,CAAC;YACd,sCAAsC;YACtC,MAAM,SAAS,GAAG,QAAQ,CAAC,iBAAiB,CAAC,WAAW,CAAC,CAAC;YAC1D,IAAI,SAAS,EAAE,CAAC;gBACd,OAAO,SAAS,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,OAAO,CAAC,CAAC;YAC5D,CAAC;YACD,OAAO,KAAK,CAAC;QACf,CAAC;QAED;YACE,OAAO,KAAK,CAAC;IACjB,CAAC;AACH,CAAC;AAED,+EAA+E;AAE/E,SAAS,QAAQ,CAAC,IAAgB,EAAE,QAAoC;IACtE,QAAQ,CAAC,IAAI,CAAC,CAAC;IACf,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;QAClC,QAAQ,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC;IAC5B,CAAC;AACH,CAAC;AAED,SAAS,eAAe,CAAC,IAAgB,EAAE,IAAY;IACrD,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI;QAAE,OAAO,IAAI,CAAC;IACpC,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;QAClC,MAAM,KAAK,GAAG,eAAe,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;QAC3C,IAAI,KAAK;YAAE,OAAO,KAAK,CAAC;IAC1B,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC"}

package/dist/index.js

@@ -34,7 +34,7 @@ else {
         const { registerPrompts } = await import("./tools/prompts.js");
         const server = new McpServer({
             name: "judges",
-            version: "3.1.1",
+            version: "3.2.0",
         });
         registerTools(server);
         registerPrompts(server);

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@kevinrabun/judges",
-  "version": "3.1.1",
+  "version": "3.2.0",
   "description": "35 specialized judges that evaluate AI-generated code for security, cost, and quality.",
   "mcpName": "io.github.KevinRabun/judges",
   "type": "module",
@@ -28,6 +28,7 @@
   },
   "files": [
     "dist",
+    "grammars",
     "server.json",
     "README.md",
     "LICENSE"
@@ -59,7 +60,8 @@
     "tribunal",
     "ai-code-review",
     "code-quality",
-    "static-analysis"
+    "static-analysis",
+    "dual-layer-analysis"
   ],
   "repository": {
     "type": "git",
@@ -80,6 +82,7 @@
   "dependencies": {
     "@modelcontextprotocol/sdk": "^1.26.0",
     "typescript": "^5.9.3",
+    "web-tree-sitter": "^0.25.10",
     "zod": "^4.3.6"
   },
   "devDependencies": {
@@ -93,6 +96,12 @@
     "husky": "^9.1.7",
     "lint-staged": "^16.2.7",
     "prettier": "^3.8.1",
+    "tree-sitter-c-sharp": "^0.23.1",
+    "tree-sitter-cli": "^0.25.5",
+    "tree-sitter-go": "^0.23.4",
+    "tree-sitter-java": "^0.23.5",
+    "tree-sitter-python": "^0.23.6",
+    "tree-sitter-rust": "^0.23.2",
     "tsx": "^4.19.4"
   },
   "overrides": {

package/server.json

@@ -7,12 +7,12 @@
     "url": "https://github.com/kevinrabun/judges",
     "source": "github"
   },
-  "version": "3.1.1",
+  "version": "3.2.0",
   "packages": [
     {
       "registryType": "npm",
       "identifier": "@kevinrabun/judges",
-      "version": "3.1.1",
+      "version": "3.2.0",
       "transport": {
         "type": "stdio"
       }