purecontext-mcp 1.1.7 → 1.2.0

package/dist/server/tools/render-import-graph.js

@@ -0,0 +1,158 @@
+/**
+ * render-import-graph.ts
+ *
+ * MCP tool: render_import_graph
+ *
+ * Render a file-level import graph for a directory as a Mermaid or DOT diagram.
+ *
+ * Node categories:
+ *   - In-scope nodes   — files whose path starts with `filePath` (no special style)
+ *   - Boundary nodes   — files OUTSIDE `filePath` that are imported by in-scope files
+ *                        (shown with a grey fill so the import boundary is visible)
+ *   - External nodes   — npm package specifiers (only when includeExternal: true;
+ *                        these are not stored in dep_edges so they are a no-op at
+ *                        the moment — the parameter is accepted for API stability)
+ *
+ * All dep_edges are internal file-to-file edges (external npm imports are dropped
+ * at graph-build time in graph-builder.ts). Boundary nodes are detected by
+ * comparing `targetFile` against the `filePath` scope prefix.
+ */
+import { z } from 'zod';
+import { openDatabase, getRepo } from '../../core/db/schema.js';
+import { getAllDepEdges } from '../../core/db/dep-store.js';
+import { sanitizeId, shortLabel, parentDir, pruneGraph, renderMermaidImportGraph, renderDot, } from '../../graph/diagram-renderer.js';
+import { buildMeta } from './_meta.js';
+export const name = 'render_import_graph';
+export const description = 'Render a file-level import graph for a directory as a Mermaid or DOT diagram. ' +
+    'Nodes = files, edges = import relationships. Files inside the directory are ' +
+    'clustered by subdirectory using Mermaid subgraph blocks. Files outside the ' +
+    'directory that are imported by in-scope files appear as grey boundary nodes. ' +
+    'Use maxNodes (default 30) to keep large graphs readable. ' +
+    'Mermaid output renders natively in GitHub, VS Code, and Claude.';
+export const inputSchema = {
+    repoId: z.string().describe('Repo ID from index_folder or resolve_repo'),
+    filePath: z
+        .string()
+        .describe('Directory path to scope the graph to (relative to repo root). ' +
+        'E.g. "src/core/" — only files under this directory are rendered as primary nodes. ' +
+        'Files outside this directory that are imported by in-scope files appear as boundary nodes.'),
+    includeExternal: z
+        .boolean()
+        .optional()
+        .describe('When true, external npm imports appear as grey terminal nodes. ' +
+        'Default false. Note: external imports are not stored in the dep graph, ' +
+        'so this option currently has no effect (reserved for future use).'),
+    maxNodes: z
+        .number()
+        .int()
+        .min(1)
+        .max(200)
+        .optional()
+        .describe('Maximum number of nodes to include. Least-connected nodes are dropped first. Default 30.'),
+    format: z
+        .enum(['mermaid', 'dot'])
+        .optional()
+        .describe('Output format. Default "mermaid".'),
+};
+// ─── Handler ──────────────────────────────────────────────────────────────────
+export async function handler(args) {
+    const t0 = Date.now();
+    const { repoId, filePath, includeExternal = false, maxNodes = 30, format = 'mermaid', } = args;
+    const db = openDatabase(repoId);
+    try {
+        const repo = getRepo(db, repoId);
+        if (!repo) {
+            return {
+                content: [
+                    { type: 'text', text: JSON.stringify({ error: `Repo "${repoId}" not found. Run index_folder first.` }) },
+                ],
+                isError: true,
+            };
+        }
+        // Normalise scope prefix — always ends with '/'
+        const scopePrefix = filePath.endsWith('/') ? filePath : filePath + '/';
+        // Fetch all dep_edges for the repo and filter to edges whose source is in scope.
+        const allEdges = getAllDepEdges(db, repoId);
+        const sourceEdges = allEdges.filter((e) => e.sourceFile.startsWith(scopePrefix));
+        // Classify edges into internal (both endpoints in scope) and boundary
+        // (target is an internal file but outside the scope prefix).
+        const internalEdges = sourceEdges.filter((e) => e.targetFile.startsWith(scopePrefix));
+        const boundaryEdges = sourceEdges.filter((e) => !e.targetFile.startsWith(scopePrefix));
+        // Build node set: collect in-scope files from all source edges, then add
+        // boundary files from boundary edges.
+        const inScopeFiles = new Set();
+        for (const e of sourceEdges) {
+            inScopeFiles.add(e.sourceFile);
+        }
+        for (const e of internalEdges) {
+            inScopeFiles.add(e.targetFile);
+        }
+        const boundaryFiles = new Set();
+        for (const e of boundaryEdges) {
+            boundaryFiles.add(e.targetFile);
+        }
+        // Build GraphNode array: in-scope nodes clustered by subdirectory, boundary
+        // nodes placed in a synthetic 'external' group.
+        const nodes = [];
+        for (const fp of inScopeFiles) {
+            nodes.push({
+                id: sanitizeId(fp),
+                label: shortLabel(fp),
+                fullPath: fp,
+                group: parentDir(fp),
+            });
+        }
+        for (const fp of boundaryFiles) {
+            nodes.push({
+                id: sanitizeId(fp),
+                label: shortLabel(fp),
+                fullPath: fp,
+                group: parentDir(fp),
+                styleClass: 'boundary',
+            });
+        }
+        // includeExternal: external npm imports are not stored in dep_edges, so
+        // this branch intentionally has no effect until a future phase persists them.
+        void includeExternal;
+        // Deduplicate edges (same source→target pair may appear multiple times).
+        const seenEdges = new Set();
+        const edges = [];
+        for (const e of [...internalEdges, ...boundaryEdges]) {
+            const key = `${e.sourceFile}→${e.targetFile}`;
+            if (!seenEdges.has(key)) {
+                seenEdges.add(key);
+                edges.push({
+                    source: sanitizeId(e.sourceFile),
+                    target: sanitizeId(e.targetFile),
+                });
+            }
+        }
+        // Apply maxNodes pruning — drops least-connected nodes first.
+        const { nodes: prunedNodes, edges: prunedEdges, truncated } = pruneGraph(nodes, edges, maxNodes);
+        // Count in-scope files (boundary nodes don't count as "files in graph").
+        const fileCount = prunedNodes.filter((n) => !n.styleClass).length;
+        // Render.
+        let diagram;
+        if (format === 'dot') {
+            diagram = renderDot(prunedNodes, prunedEdges);
+        }
+        else {
+            diagram = renderMermaidImportGraph(prunedNodes, prunedEdges);
+        }
+        const output = {
+            diagram,
+            fileCount,
+            edgeCount: prunedEdges.length,
+            truncated,
+            _tokenEstimate: Math.ceil(diagram.length / 4),
+            _meta: buildMeta({ timingMs: Date.now() - t0 }),
+        };
+        return {
+            content: [{ type: 'text', text: JSON.stringify(output, null, 2) }],
+        };
+    }
+    finally {
+        db.close();
+    }
+}
+//# sourceMappingURL=render-import-graph.js.map

package/dist/server/tools/render-import-graph.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"render-import-graph.js","sourceRoot":"","sources":["../../../src/server/tools/render-import-graph.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;GAkBG;AAEH,OAAO,EAAE,CAAC,EAAE,MAAM,KAAK,CAAC;AACxB,OAAO,EAAE,YAAY,EAAE,OAAO,EAAE,MAAM,yBAAyB,CAAC;AAChE,OAAO,EAAE,cAAc,EAAE,MAAM,4BAA4B,CAAC;AAC5D,OAAO,EACL,UAAU,EACV,UAAU,EACV,SAAS,EACT,UAAU,EACV,wBAAwB,EACxB,SAAS,GAGV,MAAM,iCAAiC,CAAC;AACzC,OAAO,EAAE,SAAS,EAAE,MAAM,YAAY,CAAC;AAGvC,MAAM,CAAC,MAAM,IAAI,GAAG,qBAAqB,CAAC;AAE1C,MAAM,CAAC,MAAM,WAAW,GACtB,gFAAgF;IAChF,8EAA8E;IAC9E,6EAA6E;IAC7E,+EAA+E;IAC/E,2DAA2D;IAC3D,iEAAiE,CAAC;AAEpE,MAAM,CAAC,MAAM,WAAW,GAAG;IACzB,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,CAAC,2CAA2C,CAAC;IACxE,QAAQ,EAAE,CAAC;SACR,MAAM,EAAE;SACR,QAAQ,CACP,gEAAgE;QAChE,oFAAoF;QACpF,4FAA4F,CAC7F;IACH,eAAe,EAAE,CAAC;SACf,OAAO,EAAE;SACT,QAAQ,EAAE;SACV,QAAQ,CACP,iEAAiE;QACjE,yEAAyE;QACzE,mEAAmE,CACpE;IACH,QAAQ,EAAE,CAAC;SACR,MAAM,EAAE;SACR,GAAG,EAAE;SACL,GAAG,CAAC,CAAC,CAAC;SACN,GAAG,CAAC,GAAG,CAAC;SACR,QAAQ,EAAE;SACV,QAAQ,CAAC,0FAA0F,CAAC;IACvG,MAAM,EAAE,CAAC;SACN,IAAI,CAAC,CAAC,SAAS,EAAE,KAAK,CAAC,CAAC;SACxB,QAAQ,EAAE;SACV,QAAQ,CAAC,mCAAmC,CAAC;CACjD,CAAC;AAaF,iFAAiF;AAEjF,MAAM,CAAC,KAAK,UAAU,OAAO,CAAC,IAM7B;IACC,MAAM,EAAE,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;IACtB,MAAM,EACJ,MAAM,EACN,QAAQ,EACR,eAAe,GAAG,KAAK,EACvB,QAAQ,GAAG,EAAE,EACb,MAAM,GAAG,SAAS,GACnB,GAAG,IAAI,CAAC;IAET,MAAM,EAAE,GAAG,YAAY,CAAC,MAAM,CAAC,CAAC;IAEhC,IAAI,CAAC;QACH,MAAM,IAAI,GAAG,OAAO,CAAC,EAAE,EAAE,MAAM,CAAC,CAAC;QACjC,IAAI,CAAC,IAAI,EAAE,CAAC;YACV,OAAO;gBACL,OAAO,EAAE;oBACP,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,IAAI,CAAC,SAAS,CAAC,EAAE,KAAK,EAAE,SAAS,MAAM,sCAAsC,EAAE,CAAC,EAAE;iBACzG;gBACD,OAAO,EAAE,IAAI;aACd,CAAC;QACJ,CAAC;QAED,gDAAgD;QAChD,MAAM,WAAW,GAAG,QAAQ,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,QAAQ,GAAG,GAAG,CAAC;QAEvE,iFAAiF;QACjF,MAAM,QAAQ,GAAG,cAAc,CAAC,EAAE,EAAE,MAAM,CAAC,CAAC;QAC5C,MAAM,WAAW,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,UAAU,CAAC,WAAW,CAAC,CAAC,CAAC;QAEjF,sEAAsE;QACtE,6DAA6D;QAC7D,MAAM,aAAa,GAAG,WAAW,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,UAAU,CAAC,WAAW,CAAC,CAAC,CAAC;QACtF,MAAM,aAAa,GAAG,WAAW,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,UAAU,CAAC,WAAW,CAAC,CAAC,CAAC;QAEvF,yEAAyE;QACzE,sCAAsC;QACtC,MAAM,YAAY,GAAG,IAAI,GAAG,EAAU,CAAC;QACvC,KAAK,MAAM,CAAC,IAAI,WAAW,EAAE,CAAC;YAC5B,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC;QACjC,CAAC;QACD,KAAK,MAAM,CAAC,IAAI,aAAa,EAAE,CAAC;YAC9B,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC;QACjC,CAAC;QAED,MAAM,aAAa,GAAG,IAAI,GAAG,EAAU,CAAC;QACxC,KAAK,MAAM,CAAC,IAAI,aAAa,EAAE,CAAC;YAC9B,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC;QAClC,CAAC;QAED,4EAA4E;QAC5E,gDAAgD;QAChD,MAAM,KAAK,GAAgB,EAAE,CAAC;QAE9B,KAAK,MAAM,EAAE,IAAI,YAAY,EAAE,CAAC;YAC9B,KAAK,CAAC,IAAI,CAAC;gBACT,EAAE,EAAE,UAAU,CAAC,EAAE,CAAC;gBAClB,KAAK,EAAE,UAAU,CAAC,EAAE,CAAC;gBACrB,QAAQ,EAAE,EAAE;gBACZ,KAAK,EAAE,SAAS,CAAC,EAAE,CAAC;aACrB,CAAC,CAAC;QACL,CAAC;QAED,KAAK,MAAM,EAAE,IAAI,aAAa,EAAE,CAAC;YAC/B,KAAK,CAAC,IAAI,CAAC;gBACT,EAAE,EAAE,UAAU,CAAC,EAAE,CAAC;gBAClB,KAAK,EAAE,UAAU,CAAC,EAAE,CAAC;gBACrB,QAAQ,EAAE,EAAE;gBACZ,KAAK,EAAE,SAAS,CAAC,EAAE,CAAC;gBACpB,UAAU,EAAE,UAAU;aACvB,CAAC,CAAC;QACL,CAAC;QAED,wEAAwE;QACxE,8EAA8E;QAC9E,KAAK,eAAe,CAAC;QAErB,yEAAyE;QACzE,MAAM,SAAS,GAAG,IAAI,GAAG,EAAU,CAAC;QACpC,MAAM,KAAK,GAAgB,EAAE,CAAC;QAE9B,KAAK,MAAM,CAAC,IAAI,CAAC,GAAG,aAAa,EAAE,GAAG,aAAa,CAAC,EAAE,CAAC;YACrD,MAAM,GAAG,GAAG,GAAG,CAAC,CAAC,UAAU,IAAI,CAAC,CAAC,UAAU,EAAE,CAAC;YAC9C,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;gBACxB,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;gBACnB,KAAK,CAAC,IAAI,CAAC;oBACT,MAAM,EAAE,UAAU,CAAC,CAAC,CAAC,UAAU,CAAC;oBAChC,MAAM,EAAE,UAAU,CAAC,CAAC,CAAC,UAAU,CAAC;iBACjC,CAAC,CAAC;YACL,CAAC;QACH,CAAC;QAED,8DAA8D;QAC9D,MAAM,EAAE,KAAK,EAAE,WAAW,EAAE,KAAK,EAAE,WAAW,EAAE,SAAS,EAAE,GAAG,UAAU,CAAC,KAAK,EAAE,KAAK,EAAE,QAAQ,CAAC,CAAC;QAEjG,yEAAyE;QACzE,MAAM,SAAS,GAAG,WAAW,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,MAAM,CAAC;QAElE,UAAU;QACV,IAAI,OAAe,CAAC;QACpB,IAAI,MAAM,KAAK,KAAK,EAAE,CAAC;YACrB,OAAO,GAAG,SAAS,CAAC,WAAW,EAAE,WAAW,CAAC,CAAC;QAChD,CAAC;aAAM,CAAC;YACN,OAAO,GAAG,wBAAwB,CAAC,WAAW,EAAE,WAAW,CAAC,CAAC;QAC/D,CAAC;QAED,MAAM,MAAM,GAA4B;YACtC,OAAO;YACP,SAAS;YACT,SAAS,EAAE,WAAW,CAAC,MAAM;YAC7B,SAAS;YACT,cAAc,EAAE,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC;YAC7C,KAAK,EAAE,SAAS,CAAC,EAAE,QAAQ,EAAE,IAAI,CAAC,GAAG,EAAE,GAAG,EAAE,EAAE,CAAC;SAChD,CAAC;QAEF,OAAO;YACL,OAAO,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC;SACnE,CAAC;IACJ,CAAC;YAAS,CAAC;QACT,EAAE,CAAC,KAAK,EAAE,CAAC;IACb,CAAC;AACH,CAAC"}

package/dist/server/tools/search-ast.d.ts

@@ -0,0 +1,55 @@
+/**
+ * search-ast.ts
+ *
+ * MCP tool: search_ast
+ *
+ * Structural AST node-type search. Re-parses the raw file content stored in
+ * the index using the appropriate tree-sitter grammar and walks the resulting
+ * AST to find every node whose type matches `nodeType`.
+ *
+ * Only files backed by a WASM grammar are searched. Files handled by the
+ * regex-based fallback (Perl, Terraform, Nix, Protobuf, GraphQL, Groovy,
+ * Erlang, GDScript, XML, etc.) are silently skipped and noted in `skippedFiles`.
+ *
+ * Common node types (case-sensitive, tree-sitter names):
+ *   TypeScript / JavaScript:
+ *     arrow_function          function_declaration       class_declaration
+ *     interface_declaration   try_statement              await_expression
+ *     call_expression         import_statement           jsx_element
+ *     template_string         throw_statement            type_alias_declaration
+ *   Python:
+ *     function_definition     class_definition           for_statement
+ *     with_statement          decorated_definition       lambda
+ *   Rust:
+ *     function_item           struct_item                impl_item
+ *     match_expression        closure_expression         trait_item
+ *   Go:
+ *     function_declaration    method_declaration         go_statement
+ *     defer_statement         type_declaration           interface_type
+ *   Java / Kotlin:
+ *     method_declaration      class_declaration          try_statement
+ *     lambda_expression       annotation
+ */
+import { z } from 'zod';
+import type { CallToolResult } from '@modelcontextprotocol/sdk/types.js';
+export declare const name = "search_ast";
+export declare const description: string;
+export declare const inputSchema: {
+    repoId: z.ZodString;
+    nodeType: z.ZodString;
+    language: z.ZodOptional<z.ZodString>;
+    filePath: z.ZodOptional<z.ZodString>;
+    includeText: z.ZodOptional<z.ZodBoolean>;
+    maxTextLength: z.ZodOptional<z.ZodNumber>;
+    limit: z.ZodOptional<z.ZodNumber>;
+};
+export declare function handler(args: {
+    repoId: string;
+    nodeType: string;
+    language?: string;
+    filePath?: string;
+    includeText?: boolean;
+    maxTextLength?: number;
+    limit?: number;
+}): Promise<CallToolResult>;
+//# sourceMappingURL=search-ast.d.ts.map

package/dist/server/tools/search-ast.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"search-ast.d.ts","sourceRoot":"","sources":["../../../src/server/tools/search-ast.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA+BG;AAEH,OAAO,EAAE,CAAC,EAAE,MAAM,KAAK,CAAC;AAKxB,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,oCAAoC,CAAC;AAGzE,eAAO,MAAM,IAAI,eAAe,CAAC;AAEjC,eAAO,MAAM,WAAW,QAe2B,CAAC;AAEpD,eAAO,MAAM,WAAW;;;;;;;;CAwCvB,CAAC;AAiCF,wBAAsB,OAAO,CAAC,IAAI,EAAE;IAClC,MAAM,EAAE,MAAM,CAAC;IACf,QAAQ,EAAE,MAAM,CAAC;IACjB,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,WAAW,CAAC,EAAE,OAAO,CAAC;IACtB,aAAa,CAAC,EAAE,MAAM,CAAC;IACvB,KAAK,CAAC,EAAE,MAAM,CAAC;CAChB,GAAG,OAAO,CAAC,cAAc,CAAC,CAgN1B"}

package/dist/server/tools/search-ast.js

@@ -0,0 +1,279 @@
+/**
+ * search-ast.ts
+ *
+ * MCP tool: search_ast
+ *
+ * Structural AST node-type search. Re-parses the raw file content stored in
+ * the index using the appropriate tree-sitter grammar and walks the resulting
+ * AST to find every node whose type matches `nodeType`.
+ *
+ * Only files backed by a WASM grammar are searched. Files handled by the
+ * regex-based fallback (Perl, Terraform, Nix, Protobuf, GraphQL, Groovy,
+ * Erlang, GDScript, XML, etc.) are silently skipped and noted in `skippedFiles`.
+ *
+ * Common node types (case-sensitive, tree-sitter names):
+ *   TypeScript / JavaScript:
+ *     arrow_function          function_declaration       class_declaration
+ *     interface_declaration   try_statement              await_expression
+ *     call_expression         import_statement           jsx_element
+ *     template_string         throw_statement            type_alias_declaration
+ *   Python:
+ *     function_definition     class_definition           for_statement
+ *     with_statement          decorated_definition       lambda
+ *   Rust:
+ *     function_item           struct_item                impl_item
+ *     match_expression        closure_expression         trait_item
+ *   Go:
+ *     function_declaration    method_declaration         go_statement
+ *     defer_statement         type_declaration           interface_type
+ *   Java / Kotlin:
+ *     method_declaration      class_declaration          try_statement
+ *     lambda_expression       annotation
+ */
+import { z } from 'zod';
+import { openDatabase } from '../../core/db/schema.js';
+import { buildMeta } from './_meta.js';
+import { getHandler } from '../../handlers/handler-registry.js';
+import { initParser, parseFile, isInitialized } from '../../core/parse-dispatcher.js';
+export const name = 'search_ast';
+export const description = 'Structural AST node-type search. Finds every occurrence of a specific ' +
+    'tree-sitter node type across indexed files — e.g. all arrow functions, all ' +
+    'try/catch blocks, all await expressions, all JSX elements — without reading ' +
+    'files manually. Re-parses stored file content using the appropriate grammar. ' +
+    'Only files backed by a WASM grammar (TypeScript, JavaScript, Python, Go, ' +
+    'Rust, Java, C/C++, etc.) are searched; regex-only handlers are skipped.' +
+    '\n\nNode type is the exact tree-sitter internal name (case-sensitive):' +
+    '\n  "arrow_function"       — all arrow functions' +
+    '\n  "try_statement"        — all try/catch blocks' +
+    '\n  "await_expression"     — all awaited expressions' +
+    '\n  "class_declaration"    — all class declarations' +
+    '\n  "interface_declaration"— all TypeScript interfaces' +
+    '\n  "jsx_element"          — all JSX elements' +
+    '\n  "template_string"      — all template literals' +
+    '\n  "call_expression"      — all function calls';
+export const inputSchema = {
+    repoId: z.string().describe('Repository ID returned by index_folder or list_repos'),
+    nodeType: z
+        .string()
+        .min(1)
+        .describe('The tree-sitter AST node type to search for (e.g. "arrow_function", ' +
+        '"try_statement", "class_declaration"). Exact, case-sensitive match.'),
+    language: z
+        .string()
+        .optional()
+        .describe('Restrict search to files of a specific language ' +
+        '(e.g. "typescript", "javascript", "python", "go", "rust", "java"). ' +
+        'When omitted, all WASM-backed grammar files in the repo are searched.'),
+    filePath: z
+        .string()
+        .optional()
+        .describe('Restrict search to a specific file path or directory prefix'),
+    includeText: z
+        .boolean()
+        .optional()
+        .describe('Whether to include the matched node\'s source text in each result ' +
+        '(default true). Set false to reduce response size when you only need locations.'),
+    maxTextLength: z
+        .number()
+        .int()
+        .positive()
+        .optional()
+        .describe('Maximum characters of matched node text to include (default 120)'),
+    limit: z
+        .number()
+        .int()
+        .positive()
+        .optional()
+        .describe('Maximum number of matches to return (default 50)'),
+};
+// ─── Internals ────────────────────────────────────────────────────────────────
+/** Recursively walk the AST collecting nodes whose type === targetType. */
+function collectNodes(node, targetType, results) {
+    if (node.type === targetType) {
+        results.push(node);
+    }
+    for (const child of node.children) {
+        collectNodes(child, targetType, results);
+    }
+}
+/** Count newlines in `buf` up to (not including) byte offset `byteOffset`. */
+function byteOffsetToLine(buf, byteOffset) {
+    let line = 1;
+    const end = Math.min(byteOffset, buf.length);
+    for (let i = 0; i < end; i++) {
+        if (buf[i] === 0x0a)
+            line++;
+    }
+    return line;
+}
+// ─── Handler ──────────────────────────────────────────────────────────────────
+export async function handler(args) {
+    const t0 = Date.now();
+    const { repoId, nodeType, language, filePath, includeText = true, maxTextLength = 120, limit = 50, } = args;
+    // ── Validate nodeType is a non-empty string ──────────────────────────────────
+    if (!nodeType || nodeType.trim().length === 0) {
+        return {
+            content: [{
+                    type: 'text',
+                    text: JSON.stringify({ error: 'nodeType must be a non-empty string' }),
+                }],
+            isError: true,
+        };
+    }
+    const db = openDatabase(repoId);
+    try {
+        // ── Verify repo exists ───────────────────────────────────────────────────
+        const repoRow = db.prepare('SELECT id FROM repos WHERE id = ?').get(repoId);
+        if (!repoRow) {
+            return {
+                content: [{
+                        type: 'text',
+                        text: JSON.stringify({ error: `Repository not found: ${repoId}` }),
+                    }],
+                isError: true,
+            };
+        }
+        // ── Build file query ─────────────────────────────────────────────────────
+        // Resolve language → allowed extensions if language filter was specified
+        let allowedExtensions = null;
+        if (language) {
+            const h = getHandler(`.${language}`);
+            if (h) {
+                allowedExtensions = new Set(h.extensions());
+            }
+            else {
+                // Try by looking up a handler via getHandler with common patterns
+                // e.g. "typescript" → try ".ts"
+                const langToExt = {
+                    typescript: ['.ts', '.tsx'],
+                    javascript: ['.js', '.jsx', '.mjs', '.cjs'],
+                    python: ['.py'],
+                    go: ['.go'],
+                    rust: ['.rs'],
+                    java: ['.java'],
+                    kotlin: ['.kt', '.kts'],
+                    csharp: ['.cs'],
+                    cpp: ['.cpp', '.cc', '.cxx', '.hpp', '.hxx', '.hh'],
+                    c: ['.c', '.h'],
+                    php: ['.php'],
+                    ruby: ['.rb'],
+                    lua: ['.lua'],
+                    dart: ['.dart'],
+                    swift: ['.swift'],
+                    scala: ['.scala', '.sc'],
+                    elixir: ['.ex', '.exs'],
+                    haskell: ['.hs', '.lhs'],
+                    r: ['.r'],
+                    bash: ['.sh', '.bash'],
+                };
+                const exts = langToExt[language.toLowerCase()];
+                if (exts) {
+                    allowedExtensions = new Set(exts);
+                }
+                // If language is unknown, proceed without extension filter — will just get 0 matches
+            }
+        }
+        const conditions = ['repo_id = @repoId', 'raw_content IS NOT NULL'];
+        const params = { repoId };
+        if (filePath) {
+            conditions.push('(path = @filePath OR path LIKE @filePathPrefix)');
+            params['filePath'] = filePath;
+            params['filePathPrefix'] = `${filePath}%`;
+        }
+        const sql = `
+      SELECT path, raw_content
+      FROM files
+      WHERE ${conditions.join(' AND ')}
+      ORDER BY path
+    `;
+        const fileRows = db.prepare(sql).all(params);
+        // ── Initialize tree-sitter parser (idempotent) ───────────────────────────
+        if (!isInitialized()) {
+            await initParser();
+        }
+        // ── Walk files and collect matches ───────────────────────────────────────
+        const matches = [];
+        const skippedFiles = [];
+        let totalMatchesBeforeLimit = 0;
+        let truncated = false;
+        for (const row of fileRows) {
+            if (!row.raw_content)
+                continue;
+            const filePath = row.path;
+            const content = row.raw_content;
+            // ── Extension filter ─────────────────────────────────────────────────
+            const ext = filePath.includes('.')
+                ? `.${filePath.split('.').pop().toLowerCase()}`
+                : '';
+            if (allowedExtensions && !allowedExtensions.has(ext)) {
+                continue;
+            }
+            // ── Get handler — skip files with no WASM grammar ───────────────────
+            const h = getHandler(filePath);
+            if (!h || h.grammarPath() === null) {
+                if (h)
+                    skippedFiles.push(filePath); // has handler but regex-only
+                continue;
+            }
+            // ── Parse and walk AST ───────────────────────────────────────────────
+            let tree;
+            try {
+                tree = await parseFile(content, h);
+            }
+            catch {
+                skippedFiles.push(filePath);
+                continue;
+            }
+            const found = [];
+            collectNodes(tree.rootNode, nodeType, found);
+            totalMatchesBeforeLimit += found.length;
+            for (const node of found) {
+                if (matches.length >= limit) {
+                    truncated = true;
+                    break;
+                }
+                const startLine = byteOffsetToLine(content, node.startIndex);
+                const endLine = byteOffsetToLine(content, node.endIndex);
+                const rawText = content.toString('utf8', node.startIndex, node.endIndex);
+                const text = includeText
+                    ? rawText.length > maxTextLength
+                        ? rawText.slice(0, maxTextLength) + '…'
+                        : rawText
+                    : '';
+                matches.push({
+                    filePath,
+                    startLine,
+                    endLine,
+                    startByte: node.startIndex,
+                    endByte: node.endIndex,
+                    nodeType,
+                    text,
+                });
+            }
+            if (truncated)
+                break;
+        }
+        // ── Token estimate ───────────────────────────────────────────────────────
+        const responseBytes = matches.reduce((sum, m) => sum + m.text.length + m.filePath.length + 60, 0);
+        const tokenEstimate = Math.ceil(responseBytes / 4);
+        return {
+            content: [{
+                    type: 'text',
+                    text: JSON.stringify({
+                        matches,
+                        totalFound: matches.length,
+                        truncated,
+                        nodeTypeSearched: nodeType,
+                        filesSearched: fileRows.length - skippedFiles.length,
+                        skippedFiles: skippedFiles.length > 0 ? skippedFiles : undefined,
+                        _tokenEstimate: tokenEstimate,
+                        _meta: buildMeta({ timingMs: Date.now() - t0 }),
+                    }, null, 2),
+                }],
+        };
+    }
+    finally {
+        db.close();
+    }
+}
+//# sourceMappingURL=search-ast.js.map

package/dist/server/tools/search-ast.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"search-ast.js","sourceRoot":"","sources":["../../../src/server/tools/search-ast.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA+BG;AAEH,OAAO,EAAE,CAAC,EAAE,MAAM,KAAK,CAAC;AACxB,OAAO,EAAE,YAAY,EAAE,MAAM,yBAAyB,CAAC;AACvD,OAAO,EAAE,SAAS,EAAE,MAAM,YAAY,CAAC;AACvC,OAAO,EAAE,UAAU,EAAE,MAAM,oCAAoC,CAAC;AAChE,OAAO,EAAE,UAAU,EAAE,SAAS,EAAE,aAAa,EAAE,MAAM,gCAAgC,CAAC;AAItF,MAAM,CAAC,MAAM,IAAI,GAAG,YAAY,CAAC;AAEjC,MAAM,CAAC,MAAM,WAAW,GACtB,wEAAwE;IACxE,6EAA6E;IAC7E,8EAA8E;IAC9E,+EAA+E;IAC/E,2EAA2E;IAC3E,yEAAyE;IACzE,wEAAwE;IACxE,kDAAkD;IAClD,mDAAmD;IACnD,sDAAsD;IACtD,qDAAqD;IACrD,wDAAwD;IACxD,+CAA+C;IAC/C,oDAAoD;IACpD,iDAAiD,CAAC;AAEpD,MAAM,CAAC,MAAM,WAAW,GAAG;IACzB,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,CAAC,sDAAsD,CAAC;IACnF,QAAQ,EAAE,CAAC;SACR,MAAM,EAAE;SACR,GAAG,CAAC,CAAC,CAAC;SACN,QAAQ,CACP,sEAAsE;QACtE,qEAAqE,CACtE;IACH,QAAQ,EAAE,CAAC;SACR,MAAM,EAAE;SACR,QAAQ,EAAE;SACV,QAAQ,CACP,kDAAkD;QAClD,qEAAqE;QACrE,uEAAuE,CACxE;IACH,QAAQ,EAAE,CAAC;SACR,MAAM,EAAE;SACR,QAAQ,EAAE;SACV,QAAQ,CAAC,6DAA6D,CAAC;IAC1E,WAAW,EAAE,CAAC;SACX,OAAO,EAAE;SACT,QAAQ,EAAE;SACV,QAAQ,CACP,oEAAoE;QACpE,iFAAiF,CAClF;IACH,aAAa,EAAE,CAAC;SACb,MAAM,EAAE;SACR,GAAG,EAAE;SACL,QAAQ,EAAE;SACV,QAAQ,EAAE;SACV,QAAQ,CAAC,kEAAkE,CAAC;IAC/E,KAAK,EAAE,CAAC;SACL,MAAM,EAAE;SACR,GAAG,EAAE;SACL,QAAQ,EAAE;SACV,QAAQ,EAAE;SACV,QAAQ,CAAC,kDAAkD,CAAC;CAChE,CAAC;AAEF,iFAAiF;AAEjF,2EAA2E;AAC3E,SAAS,YAAY,CAAC,IAAgB,EAAE,UAAkB,EAAE,OAAqB;IAC/E,IAAI,IAAI,CAAC,IAAI,KAAK,UAAU,EAAE,CAAC;QAC7B,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACrB,CAAC;IACD,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;QAClC,YAAY,CAAC,KAAK,EAAE,UAAU,EAAE,OAAO,CAAC,CAAC;IAC3C,CAAC;AACH,CAAC;AAED,8EAA8E;AAC9E,SAAS,gBAAgB,CAAC,GAAW,EAAE,UAAkB;IACvD,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,UAAU,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;IAC7C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;QAC7B,IAAI,GAAG,CAAC,CAAC,CAAC,KAAK,IAAI;YAAE,IAAI,EAAE,CAAC;IAC9B,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AASD,iFAAiF;AAEjF,MAAM,CAAC,KAAK,UAAU,OAAO,CAAC,IAQ7B;IACC,MAAM,EAAE,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;IACtB,MAAM,EACJ,MAAM,EACN,QAAQ,EACR,QAAQ,EACR,QAAQ,EACR,WAAW,GAAG,IAAI,EAClB,aAAa,GAAG,GAAG,EACnB,KAAK,GAAG,EAAE,GACX,GAAG,IAAI,CAAC;IAET,gFAAgF;IAChF,IAAI,CAAC,QAAQ,IAAI,QAAQ,CAAC,IAAI,EAAE,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC9C,OAAO;YACL,OAAO,EAAE,CAAC;oBACR,IAAI,EAAE,MAAM;oBACZ,IAAI,EAAE,IAAI,CAAC,SAAS,CAAC,EAAE,KAAK,EAAE,qCAAqC,EAAE,CAAC;iBACvE,CAAC;YACF,OAAO,EAAE,IAAI;SACd,CAAC;IACJ,CAAC;IAED,MAAM,EAAE,GAAG,YAAY,CAAC,MAAM,CAAC,CAAC;IAChC,IAAI,CAAC;QACH,4EAA4E;QAC5E,MAAM,OAAO,GAAG,EAAE,CAAC,OAAO,CACxB,mCAAmC,CACpC,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACd,IAAI,CAAC,OAAO,EAAE,CAAC;YACb,OAAO;gBACL,OAAO,EAAE,CAAC;wBACR,IAAI,EAAE,MAAM;wBACZ,IAAI,EAAE,IAAI,CAAC,SAAS,CAAC,EAAE,KAAK,EAAE,yBAAyB,MAAM,EAAE,EAAE,CAAC;qBACnE,CAAC;gBACF,OAAO,EAAE,IAAI;aACd,CAAC;QACJ,CAAC;QAED,4EAA4E;QAC5E,yEAAyE;QACzE,IAAI,iBAAiB,GAAuB,IAAI,CAAC;QACjD,IAAI,QAAQ,EAAE,CAAC;YACb,MAAM,CAAC,GAAG,UAAU,CAAC,IAAI,QAAQ,EAAE,CAAC,CAAC;YACrC,IAAI,CAAC,EAAE,CAAC;gBACN,iBAAiB,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,UAAU,EAAE,CAAC,CAAC;YAC9C,CAAC;iBAAM,CAAC;gBACN,kEAAkE;gBAClE,gCAAgC;gBAChC,MAAM,SAAS,GAA6B;oBAC1C,UAAU,EAAG,CAAC,KAAK,EAAE,MAAM,CAAC;oBAC5B,UAAU,EAAG,CAAC,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC;oBAC5C,MAAM,EAAO,CAAC,KAAK,CAAC;oBACpB,EAAE,EAAW,CAAC,KAAK,CAAC;oBACpB,IAAI,EAAS,CAAC,KAAK,CAAC;oBACpB,IAAI,EAAS,CAAC,OAAO,CAAC;oBACtB,MAAM,EAAO,CAAC,KAAK,EAAE,MAAM,CAAC;oBAC5B,MAAM,EAAO,CAAC,KAAK,CAAC;oBACpB,GAAG,EAAU,CAAC,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,KAAK,CAAC;oBAC3D,CAAC,EAAY,CAAC,IAAI,EAAE,IAAI,CAAC;oBACzB,GAAG,EAAU,CAAC,MAAM,CAAC;oBACrB,IAAI,EAAS,CAAC,KAAK,CAAC;oBACpB,GAAG,EAAU,CAAC,MAAM,CAAC;oBACrB,IAAI,EAAS,CAAC,OAAO,CAAC;oBACtB,KAAK,EAAQ,CAAC,QAAQ,CAAC;oBACvB,KAAK,EAAQ,CAAC,QAAQ,EAAE,KAAK,CAAC;oBAC9B,MAAM,EAAO,CAAC,KAAK,EAAE,MAAM,CAAC;oBAC5B,OAAO,EAAM,CAAC,KAAK,EAAE,MAAM,CAAC;oBAC5B,CAAC,EAAY,CAAC,IAAI,CAAC;oBACnB,IAAI,EAAS,CAAC,KAAK,EAAE,OAAO,CAAC;iBAC9B,CAAC;gBACF,MAAM,IAAI,GAAG,SAAS,CAAC,QAAQ,CAAC,WAAW,EAAE,CAAC,CAAC;gBAC/C,IAAI,IAAI,EAAE,CAAC;oBACT,iBAAiB,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,CAAC;gBACpC,CAAC;gBACD,qFAAqF;YACvF,CAAC;QACH,CAAC;QAED,MAAM,UAAU,GAAa,CAAC,mBAAmB,EAAE,yBAAyB,CAAC,CAAC;QAC9E,MAAM,MAAM,GAA4B,EAAE,MAAM,EAAE,CAAC;QAEnD,IAAI,QAAQ,EAAE,CAAC;YACb,UAAU,CAAC,IAAI,CAAC,iDAAiD,CAAC,CAAC;YACnE,MAAM,CAAC,UAAU,CAAC,GAAG,QAAQ,CAAC;YAC9B,MAAM,CAAC,gBAAgB,CAAC,GAAG,GAAG,QAAQ,GAAG,CAAC;QAC5C,CAAC;QAED,MAAM,GAAG,GAAG;;;cAGF,UAAU,CAAC,IAAI,CAAC,OAAO,CAAC;;KAEjC,CAAC;QAEF,MAAM,QAAQ,GAAG,EAAE,CAAC,OAAO,CAAmC,GAAG,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QAE/E,4EAA4E;QAC5E,IAAI,CAAC,aAAa,EAAE,EAAE,CAAC;YACrB,MAAM,UAAU,EAAE,CAAC;QACrB,CAAC;QAED,4EAA4E;QAC5E,MAAM,OAAO,GAQR,EAAE,CAAC;QACR,MAAM,YAAY,GAAa,EAAE,CAAC;QAClC,IAAI,uBAAuB,GAAG,CAAC,CAAC;QAChC,IAAI,SAAS,GAAG,KAAK,CAAC;QAEtB,KAAK,MAAM,GAAG,IAAI,QAAQ,EAAE,CAAC;YAC3B,IAAI,CAAC,GAAG,CAAC,WAAW;gBAAE,SAAS;YAE/B,MAAM,QAAQ,GAAG,GAAG,CAAC,IAAI,CAAC;YAC1B,MAAM,OAAO,GAAG,GAAG,CAAC,WAAW,CAAC;YAEhC,wEAAwE;YACxE,MAAM,GAAG,GAAG,QAAQ,CAAC,QAAQ,CAAC,GAAG,CAAC;gBAChC,CAAC,CAAC,IAAI,QAAQ,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,GAAG,EAAG,CAAC,WAAW,EAAE,EAAE;gBAChD,CAAC,CAAC,EAAE,CAAC;YAEP,IAAI,iBAAiB,IAAI,CAAC,iBAAiB,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;gBACrD,SAAS;YACX,CAAC;YAED,uEAAuE;YACvE,MAAM,CAAC,GAAG,UAAU,CAAC,QAAQ,CAAC,CAAC;YAC/B,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,WAAW,EAAE,KAAK,IAAI,EAAE,CAAC;gBACnC,IAAI,CAAC;oBAAE,YAAY,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,6BAA6B;gBACjE,SAAS;YACX,CAAC;YAED,wEAAwE;YACxE,IAAI,IAAI,CAAC;YACT,IAAI,CAAC;gBACH,IAAI,GAAG,MAAM,SAAS,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC;YACrC,CAAC;YAAC,MAAM,CAAC;gBACP,YAAY,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;gBAC5B,SAAS;YACX,CAAC;YAED,MAAM,KAAK,GAAiB,EAAE,CAAC;YAC/B,YAAY,CAAC,IAAI,CAAC,QAAQ,EAAE,QAAQ,EAAE,KAAK,CAAC,CAAC;YAC7C,uBAAuB,IAAI,KAAK,CAAC,MAAM,CAAC;YAExC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;gBACzB,IAAI,OAAO,CAAC,MAAM,IAAI,KAAK,EAAE,CAAC;oBAC5B,SAAS,GAAG,IAAI,CAAC;oBACjB,MAAM;gBACR,CAAC;gBACD,MAAM,SAAS,GAAG,gBAAgB,CAAC,OAAO,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC;gBAC7D,MAAM,OAAO,GAAG,gBAAgB,CAAC,OAAO,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;gBACzD,MAAM,OAAO,GAAG,OAAO,CAAC,QAAQ,CAAC,MAAM,EAAE,IAAI,CAAC,UAAU,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;gBACzE,MAAM,IAAI,GAAG,WAAW;oBACtB,CAAC,CAAC,OAAO,CAAC,MAAM,GAAG,aAAa;wBAC9B,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,aAAa,CAAC,GAAG,GAAG;wBACvC,CAAC,CAAC,OAAO;oBACX,CAAC,CAAC,EAAE,CAAC;gBAEP,OAAO,CAAC,IAAI,CAAC;oBACX,QAAQ;oBACR,SAAS;oBACT,OAAO;oBACP,SAAS,EAAE,IAAI,CAAC,UAAU;oBAC1B,OAAO,EAAE,IAAI,CAAC,QAAQ;oBACtB,QAAQ;oBACR,IAAI;iBACL,CAAC,CAAC;YACL,CAAC;YAED,IAAI,SAAS;gBAAE,MAAM;QACvB,CAAC;QAED,4EAA4E;QAC5E,MAAM,aAAa,GAAG,OAAO,CAAC,MAAM,CAClC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,QAAQ,CAAC,MAAM,GAAG,EAAE,EACxD,CAAC,CACF,CAAC;QACF,MAAM,aAAa,GAAG,IAAI,CAAC,IAAI,CAAC,aAAa,GAAG,CAAC,CAAC,CAAC;QAEnD,OAAO;YACL,OAAO,EAAE,CAAC;oBACR,IAAI,EAAE,MAAM;oBACZ,IAAI,EAAE,IAAI,CAAC,SAAS,CAClB;wBACE,OAAO;wBACP,UAAU,EAAE,OAAO,CAAC,MAAM;wBAC1B,SAAS;wBACT,gBAAgB,EAAE,QAAQ;wBAC1B,aAAa,EAAE,QAAQ,CAAC,MAAM,GAAG,YAAY,CAAC,MAAM;wBACpD,YAAY,EAAE,YAAY,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,SAAS;wBAChE,cAAc,EAAE,aAAa;wBAC7B,KAAK,EAAE,SAAS,CAAC,EAAE,QAAQ,EAAE,IAAI,CAAC,GAAG,EAAE,GAAG,EAAE,EAAE,CAAC;qBAChD,EACD,IAAI,EACJ,CAAC,CACF;iBACF,CAAC;SACH,CAAC;IACJ,CAAC;YAAS,CAAC;QACT,EAAE,CAAC,KAAK,EAAE,CAAC;IACb,CAAC;AACH,CAAC"}

package/dist/server/tools/search-by-complexity.d.ts

@@ -0,0 +1,92 @@
+/**
+ * search-by-complexity.ts
+ *
+ * MCP tool: search_by_complexity
+ *
+ * Find all symbols whose complexity metrics match a set of min/max filters.
+ * Covers six dimensions stored at index time:
+ *   cyclomatic_complexity, cognitive_complexity, line_count,
+ *   nesting_depth, param_count, return_count
+ *
+ * All filters are optional and combined with AND. Omitting a filter means
+ * "no constraint on that dimension". The tool returns only symbols that have
+ * metrics (logic-carrying kinds: function, method, class, component, etc.).
+ *
+ * Designed for targeted queries like:
+ *   "show me every function with ≥8 cyclomatic complexity"
+ *   "find all methods with exactly 0–2 parameters"
+ *   "list functions that are between 20 and 50 lines"
+ *
+ * Use get_quality_metrics when you want a ranked worst-offenders list with a
+ * composite score. Use search_by_complexity when you have a specific threshold
+ * or range in mind for one or more individual dimensions.
+ */
+import { z } from 'zod';
+import type { CallToolResult } from '@modelcontextprotocol/sdk/types.js';
+export declare const name = "search_by_complexity";
+export declare const description: string;
+export declare const inputSchema: {
+    repoId: z.ZodString;
+    minCyclomaticComplexity: z.ZodOptional<z.ZodNumber>;
+    maxCyclomaticComplexity: z.ZodOptional<z.ZodNumber>;
+    minCognitiveComplexity: z.ZodOptional<z.ZodNumber>;
+    maxCognitiveComplexity: z.ZodOptional<z.ZodNumber>;
+    minLineCount: z.ZodOptional<z.ZodNumber>;
+    maxLineCount: z.ZodOptional<z.ZodNumber>;
+    minNestingDepth: z.ZodOptional<z.ZodNumber>;
+    maxNestingDepth: z.ZodOptional<z.ZodNumber>;
+    minParamCount: z.ZodOptional<z.ZodNumber>;
+    maxParamCount: z.ZodOptional<z.ZodNumber>;
+    minReturnCount: z.ZodOptional<z.ZodNumber>;
+    maxReturnCount: z.ZodOptional<z.ZodNumber>;
+    sortBy: z.ZodOptional<z.ZodEnum<{
+        size: "size";
+        params: "params";
+        complexity: "complexity";
+        nesting: "nesting";
+        cognitive: "cognitive";
+        returns: "returns";
+    }>>;
+    sortOrder: z.ZodOptional<z.ZodEnum<{
+        asc: "asc";
+        desc: "desc";
+    }>>;
+    kind: z.ZodOptional<z.ZodEnum<{
+        function: "function";
+        method: "method";
+        class: "class";
+        const: "const";
+        type: "type";
+        interface: "interface";
+        enum: "enum";
+        component: "component";
+        composable: "composable";
+        hook: "hook";
+        route: "route";
+        decorator: "decorator";
+        middleware: "middleware";
+    }>>;
+    filePath: z.ZodOptional<z.ZodString>;
+    limit: z.ZodOptional<z.ZodNumber>;
+};
+export declare function handler(args: {
+    repoId: string;
+    minCyclomaticComplexity?: number;
+    maxCyclomaticComplexity?: number;
+    minCognitiveComplexity?: number;
+    maxCognitiveComplexity?: number;
+    minLineCount?: number;
+    maxLineCount?: number;
+    minNestingDepth?: number;
+    maxNestingDepth?: number;
+    minParamCount?: number;
+    maxParamCount?: number;
+    minReturnCount?: number;
+    maxReturnCount?: number;
+    sortBy?: 'complexity' | 'cognitive' | 'size' | 'nesting' | 'params' | 'returns';
+    sortOrder?: 'asc' | 'desc';
+    kind?: string;
+    filePath?: string;
+    limit?: number;
+}): Promise<CallToolResult>;
+//# sourceMappingURL=search-by-complexity.d.ts.map

package/dist/server/tools/search-by-complexity.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"search-by-complexity.d.ts","sourceRoot":"","sources":["../../../src/server/tools/search-by-complexity.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;GAsBG;AAEH,OAAO,EAAE,CAAC,EAAE,MAAM,KAAK,CAAC;AAGxB,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,oCAAoC,CAAC;AAGzE,eAAO,MAAM,IAAI,yBAAyB,CAAC;AAE3C,eAAO,MAAM,WAAW,QAYyD,CAAC;AAElF,eAAO,MAAM,WAAW;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;CAuEvB,CAAC;AAiCF,wBAAsB,OAAO,CAAC,IAAI,EAAE;IAClC,MAAM,EAAE,MAAM,CAAC;IACf,uBAAuB,CAAC,EAAE,MAAM,CAAC;IACjC,uBAAuB,CAAC,EAAE,MAAM,CAAC;IACjC,sBAAsB,CAAC,EAAE,MAAM,CAAC;IAChC,sBAAsB,CAAC,EAAE,MAAM,CAAC;IAChC,YAAY,CAAC,EAAE,MAAM,CAAC;IACtB,YAAY,CAAC,EAAE,MAAM,CAAC;IACtB,eAAe,CAAC,EAAE,MAAM,CAAC;IACzB,eAAe,CAAC,EAAE,MAAM,CAAC;IACzB,aAAa,CAAC,EAAE,MAAM,CAAC;IACvB,aAAa,CAAC,EAAE,MAAM,CAAC;IACvB,cAAc,CAAC,EAAE,MAAM,CAAC;IACxB,cAAc,CAAC,EAAE,MAAM,CAAC;IACxB,MAAM,CAAC,EAAE,YAAY,GAAG,WAAW,GAAG,MAAM,GAAG,SAAS,GAAG,QAAQ,GAAG,SAAS,CAAC;IAChF,SAAS,CAAC,EAAE,KAAK,GAAG,MAAM,CAAC;IAC3B,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,KAAK,CAAC,EAAE,MAAM,CAAC;CAChB,GAAG,OAAO,CAAC,cAAc,CAAC,CAyK1B"}