@mohantn/gate-keeper 2.1.0

package/dist/graph/relationship-extractor.js

@@ -0,0 +1,254 @@
+"use strict";
+/**
+ * AST-based semantic relationship extractor.
+ *
+ * Piggybacks on the TypeScript Compiler API (ts.createSourceFile) to extract
+ * relationships the existing import-only dependency graph misses:
+ *
+ *   FUNCTION_CALL   — file A calls an imported function from file B
+ *   CLASS_EXTENDS   — file A's class extends an imported class from file B
+ *   IMPLEMENTS      — file A's class implements an imported interface from file B
+ *   COMMENTS_ABOUT  — "why:", "rationale:", JSDoc summaries embedded as WhyNodes
+ *
+ * Confidence is always EXTRACTED (direct AST evidence) for calls/heritage and
+ * INFERRED for JSDoc (not always a hard relationship).
+ *
+ * Usage:
+ *   const extractor = new RelationshipExtractor();
+ *   const result = extractor.extractFromFile(filePath, knownFilesSet);
+ */
+var __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    var desc = Object.getOwnPropertyDescriptor(m, k);
+    if (!desc || ("get" in desc ? !m.__esModule : desc.writable || desc.configurable)) {
+      desc = { enumerable: true, get: function() { return m[k]; } };
+    }
+    Object.defineProperty(o, k2, desc);
+}) : (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    o[k2] = m[k];
+}));
+var __setModuleDefault = (this && this.__setModuleDefault) || (Object.create ? (function(o, v) {
+    Object.defineProperty(o, "default", { enumerable: true, value: v });
+}) : function(o, v) {
+    o["default"] = v;
+});
+var __importStar = (this && this.__importStar) || (function () {
+    var ownKeys = function(o) {
+        ownKeys = Object.getOwnPropertyNames || function (o) {
+            var ar = [];
+            for (var k in o) if (Object.prototype.hasOwnProperty.call(o, k)) ar[ar.length] = k;
+            return ar;
+        };
+        return ownKeys(o);
+    };
+    return function (mod) {
+        if (mod && mod.__esModule) return mod;
+        var result = {};
+        if (mod != null) for (var k = ownKeys(mod), i = 0; i < k.length; i++) if (k[i] !== "default") __createBinding(result, mod, k[i]);
+        __setModuleDefault(result, mod);
+        return result;
+    };
+})();
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.RelationshipExtractor = void 0;
+const ts = __importStar(require("typescript"));
+const fs = __importStar(require("fs"));
+const path = __importStar(require("path"));
+const relationship_types_1 = require("./relationship-types");
+const EXTENSIONS = ['.ts', '.tsx', '.js', '.jsx'];
+const WHY_PATTERNS = [
+    /\/\/\s*why:\s*(.+)/i,
+    /\/\/\s*rationale:\s*(.+)/i,
+    /\/\/\s*because:\s*(.+)/i,
+    /\/\/\s*reason:\s*(.+)/i,
+];
+class RelationshipExtractor {
+    /**
+     * Extract semantic relationships from a single file.
+     *
+     * @param filePath   Absolute path to analyze.
+     * @param knownFiles Set of absolute paths already tracked in the graph.
+     *                   Only imports resolving to known files generate edges.
+     */
+    extractFromFile(filePath, knownFiles) {
+        let content;
+        try {
+            content = fs.readFileSync(filePath, 'utf8');
+        }
+        catch {
+            return { enrichedEdges: [], whyComments: [] };
+        }
+        const sf = ts.createSourceFile(filePath, content, ts.ScriptTarget.Latest, true);
+        const importMap = this.buildImportMap(sf, path.dirname(filePath), knownFiles);
+        return {
+            enrichedEdges: [
+                ...this.extractFunctionCalls(sf, filePath, importMap),
+                ...this.extractClassRelations(sf, filePath, importMap),
+            ],
+            whyComments: this.extractWhyComments(content, filePath),
+        };
+    }
+    // ── Import map ─────────────────────────────────────────────
+    buildImportMap(sf, dir, knownFiles) {
+        const map = new Map(); // localName → resolved absolute path
+        const visit = (node) => {
+            if (ts.isImportDeclaration(node)) {
+                const rawSpec = node.moduleSpecifier.text;
+                if (!rawSpec.startsWith('.')) {
+                    ts.forEachChild(node, visit);
+                    return; // skip npm packages
+                }
+                const resolved = this.resolveModule(rawSpec, dir);
+                if (!resolved || !knownFiles.has(resolved)) {
+                    ts.forEachChild(node, visit);
+                    return;
+                }
+                const clause = node.importClause;
+                if (!clause) {
+                    ts.forEachChild(node, visit);
+                    return;
+                }
+                // default import: import Foo from './foo'
+                if (clause.name)
+                    map.set(clause.name.text, resolved);
+                if (clause.namedBindings) {
+                    if (ts.isNamedImports(clause.namedBindings)) {
+                        // named: import { foo, bar as baz } from './foo'
+                        for (const el of clause.namedBindings.elements) {
+                            map.set(el.name.text, resolved);
+                        }
+                    }
+                    else if (ts.isNamespaceImport(clause.namedBindings)) {
+                        // namespace: import * as mod from './foo'
+                        map.set(clause.namedBindings.name.text, resolved);
+                    }
+                }
+            }
+            ts.forEachChild(node, visit);
+        };
+        visit(sf);
+        return map;
+    }
+    // ── Function calls ─────────────────────────────────────────
+    extractFunctionCalls(sf, filePath, importMap) {
+        const edges = [];
+        // Deduplicate per target file (one edge per file pair, not per call site)
+        const seen = new Set();
+        const visit = (node) => {
+            if (ts.isCallExpression(node) || ts.isNewExpression(node)) {
+                const localName = this.resolveCalleeName(node.expression);
+                if (localName && importMap.has(localName)) {
+                    const target = importMap.get(localName);
+                    const key = `${filePath}→${target}:FUNCTION_CALL`;
+                    if (!seen.has(key)) {
+                        seen.add(key);
+                        const { line } = sf.getLineAndCharacterOfPosition(node.getStart());
+                        edges.push({
+                            source: filePath,
+                            target,
+                            type: 'FUNCTION_CALL',
+                            confidence: 'EXTRACTED',
+                            weight: relationship_types_1.RELATIONSHIP_WEIGHTS.FUNCTION_CALL,
+                            rationale: `calls ${localName} (first at line ${line + 1})`,
+                        });
+                    }
+                }
+            }
+            ts.forEachChild(node, visit);
+        };
+        visit(sf);
+        return edges;
+    }
+    resolveCalleeName(expr) {
+        if (ts.isIdentifier(expr))
+            return expr.text;
+        // obj.method() — check if `obj` is the imported name
+        if (ts.isPropertyAccessExpression(expr) && ts.isIdentifier(expr.expression)) {
+            return expr.expression.text;
+        }
+        return null;
+    }
+    // ── Class heritage ─────────────────────────────────────────
+    extractClassRelations(sf, filePath, importMap) {
+        const edges = [];
+        const visit = (node) => {
+            if (ts.isClassDeclaration(node) || ts.isClassExpression(node)) {
+                const className = ts.isClassDeclaration(node) ? (node.name?.text ?? '<anonymous>') : '<expr>';
+                for (const clause of node.heritageClauses ?? []) {
+                    const relType = clause.token === ts.SyntaxKind.ExtendsKeyword ? 'CLASS_EXTENDS' : 'IMPLEMENTS';
+                    for (const typeRef of clause.types) {
+                        const baseName = ts.isIdentifier(typeRef.expression) ? typeRef.expression.text : null;
+                        if (baseName && importMap.has(baseName)) {
+                            edges.push({
+                                source: filePath,
+                                target: importMap.get(baseName),
+                                type: relType,
+                                confidence: 'EXTRACTED',
+                                weight: relationship_types_1.RELATIONSHIP_WEIGHTS[relType],
+                                rationale: `${className} ${relType === 'CLASS_EXTENDS' ? 'extends' : 'implements'} ${baseName}`,
+                            });
+                        }
+                    }
+                }
+            }
+            ts.forEachChild(node, visit);
+        };
+        visit(sf);
+        return edges;
+    }
+    // ── Why comments ───────────────────────────────────────────
+    extractWhyComments(content, filePath) {
+        const nodes = [];
+        const lines = content.split('\n');
+        // Inline why: / rationale: comments
+        for (let i = 0; i < lines.length; i++) {
+            for (const pattern of WHY_PATTERNS) {
+                const m = lines[i].match(pattern);
+                if (m?.[1]) {
+                    nodes.push({
+                        id: `${filePath}:${i + 1}:why`,
+                        text: m[1].trim().slice(0, 300),
+                        file: filePath,
+                        line: i + 1,
+                    });
+                    break;
+                }
+            }
+        }
+        // JSDoc block summaries (first non-empty line after /**, ignoring @tags)
+        const jsdocRe = /\/\*\*([\s\S]*?)\*\//g;
+        let m;
+        while ((m = jsdocRe.exec(content)) !== null) {
+            const rawLines = m[1].split('\n').map(l => l.replace(/^\s*\*\s?/, '').trim()).filter(Boolean);
+            const summary = rawLines.find(l => l.length > 10 && !l.startsWith('@'));
+            if (summary) {
+                const lineNum = content.substring(0, m.index).split('\n').length;
+                nodes.push({
+                    id: `${filePath}:${lineNum}:jsdoc`,
+                    text: summary.slice(0, 300),
+                    file: filePath,
+                    line: lineNum,
+                });
+            }
+        }
+        return nodes;
+    }
+    // ── Module resolution ──────────────────────────────────────
+    resolveModule(specifier, dir) {
+        const base = path.resolve(dir, specifier);
+        for (const ext of EXTENSIONS) {
+            const full = base + ext;
+            if (fs.existsSync(full))
+                return full;
+        }
+        for (const ext of EXTENSIONS) {
+            const index = path.join(base, `index${ext}`);
+            if (fs.existsSync(index))
+                return index;
+        }
+        return null;
+    }
+}
+exports.RelationshipExtractor = RelationshipExtractor;
+//# sourceMappingURL=relationship-extractor.js.map

package/dist/graph/relationship-extractor.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"relationship-extractor.js","sourceRoot":"","sources":["../../src/graph/relationship-extractor.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;;;;;;;;GAiBG;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAEH,+CAAiC;AACjC,uCAAyB;AACzB,2CAA6B;AAC7B,6DAAqG;AAOrG,MAAM,UAAU,GAAG,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC;AAClD,MAAM,YAAY,GAAG;IACnB,qBAAqB;IACrB,2BAA2B;IAC3B,yBAAyB;IACzB,wBAAwB;CACzB,CAAC;AAEF,MAAa,qBAAqB;IAChC;;;;;;OAMG;IACH,eAAe,CAAC,QAAgB,EAAE,UAA+B;QAC/D,IAAI,OAAe,CAAC;QACpB,IAAI,CAAC;YACH,OAAO,GAAG,EAAE,CAAC,YAAY,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC;QAC9C,CAAC;QAAC,MAAM,CAAC;YACP,OAAO,EAAE,aAAa,EAAE,EAAE,EAAE,WAAW,EAAE,EAAE,EAAE,CAAC;QAChD,CAAC;QAED,MAAM,EAAE,GAAG,EAAE,CAAC,gBAAgB,CAAC,QAAQ,EAAE,OAAO,EAAE,EAAE,CAAC,YAAY,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;QAChF,MAAM,SAAS,GAAG,IAAI,CAAC,cAAc,CAAC,EAAE,EAAE,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAE,UAAU,CAAC,CAAC;QAE9E,OAAO;YACL,aAAa,EAAE;gBACb,GAAG,IAAI,CAAC,oBAAoB,CAAC,EAAE,EAAE,QAAQ,EAAE,SAAS,CAAC;gBACrD,GAAG,IAAI,CAAC,qBAAqB,CAAC,EAAE,EAAE,QAAQ,EAAE,SAAS,CAAC;aACvD;YACD,WAAW,EAAE,IAAI,CAAC,kBAAkB,CAAC,OAAO,EAAE,QAAQ,CAAC;SACxD,CAAC;IACJ,CAAC;IAED,8DAA8D;IAEtD,cAAc,CACpB,EAAiB,EACjB,GAAW,EACX,UAA+B;QAE/B,MAAM,GAAG,GAAG,IAAI,GAAG,EAAkB,CAAC,CAAC,qCAAqC;QAE5E,MAAM,KAAK,GAAG,CAAC,IAAa,EAAQ,EAAE;YACpC,IAAI,EAAE,CAAC,mBAAmB,CAAC,IAAI,CAAC,EAAE,CAAC;gBACjC,MAAM,OAAO,GAAI,IAAI,CAAC,eAAoC,CAAC,IAAI,CAAC;gBAChE,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC;oBAC7B,EAAE,CAAC,YAAY,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;oBAC7B,OAAO,CAAC,oBAAoB;gBAC9B,CAAC;gBACD,MAAM,QAAQ,GAAG,IAAI,CAAC,aAAa,CAAC,OAAO,EAAE,GAAG,CAAC,CAAC;gBAClD,IAAI,CAAC,QAAQ,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;oBAC3C,EAAE,CAAC,YAAY,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;oBAC7B,OAAO;gBACT,CAAC;gBAED,MAAM,MAAM,GAAG,IAAI,CAAC,YAAY,CAAC;gBACjC,IAAI,CAAC,MAAM,EAAE,CAAC;oBAAC,EAAE,CAAC,YAAY,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;oBAAC,OAAO;gBAAC,CAAC;gBAEtD,0CAA0C;gBAC1C,IAAI,MAAM,CAAC,IAAI;oBAAE,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;gBAErD,IAAI,MAAM,CAAC,aAAa,EAAE,CAAC;oBACzB,IAAI,EAAE,CAAC,cAAc,CAAC,MAAM,CAAC,aAAa,CAAC,EAAE,CAAC;wBAC5C,iDAAiD;wBACjD,KAAK,MAAM,EAAE,IAAI,MAAM,CAAC,aAAa,CAAC,QAAQ,EAAE,CAAC;4BAC/C,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;wBAClC,CAAC;oBACH,CAAC;yBAAM,IAAI,EAAE,CAAC,iBAAiB,CAAC,MAAM,CAAC,aAAa,CAAC,EAAE,CAAC;wBACtD,0CAA0C;wBAC1C,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,aAAa,CAAC,IAAI,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;oBACpD,CAAC;gBACH,CAAC;YACH,CAAC;YACD,EAAE,CAAC,YAAY,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;QAC/B,CAAC,CAAC;QACF,KAAK,CAAC,EAAE,CAAC,CAAC;QACV,OAAO,GAAG,CAAC;IACb,CAAC;IAED,8DAA8D;IAEtD,oBAAoB,CAC1B,EAAiB,EACjB,QAAgB,EAChB,SAA8B;QAE9B,MAAM,KAAK,GAAmB,EAAE,CAAC;QACjC,0EAA0E;QAC1E,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;QAE/B,MAAM,KAAK,GAAG,CAAC,IAAa,EAAQ,EAAE;YACpC,IAAI,EAAE,CAAC,gBAAgB,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,eAAe,CAAC,IAAI,CAAC,EAAE,CAAC;gBAC1D,MAAM,SAAS,GAAG,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;gBAC1D,IAAI,SAAS,IAAI,SAAS,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,CAAC;oBAC1C,MAAM,MAAM,GAAG,SAAS,CAAC,GAAG,CAAC,SAAS,CAAE,CAAC;oBACzC,MAAM,GAAG,GAAG,GAAG,QAAQ,IAAI,MAAM,gBAAgB,CAAC;oBAClD,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;wBACnB,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;wBACd,MAAM,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC,6BAA6B,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC;wBACnE,KAAK,CAAC,IAAI,CAAC;4BACT,MAAM,EAAE,QAAQ;4BAChB,MAAM;4BACN,IAAI,EAAE,eAAe;4BACrB,UAAU,EAAE,WAAW;4BACvB,MAAM,EAAE,yCAAoB,CAAC,aAAa;4BAC1C,SAAS,EAAE,SAAS,SAAS,mBAAmB,IAAI,GAAG,CAAC,GAAG;yBAC5D,CAAC,CAAC;oBACL,CAAC;gBACH,CAAC;YACH,CAAC;YACD,EAAE,CAAC,YAAY,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;QAC/B,CAAC,CAAC;QACF,KAAK,CAAC,EAAE,CAAC,CAAC;QACV,OAAO,KAAK,CAAC;IACf,CAAC;IAEO,iBAAiB,CAAC,IAAmB;QAC3C,IAAI,EAAE,CAAC,YAAY,CAAC,IAAI,CAAC;YAAE,OAAO,IAAI,CAAC,IAAI,CAAC;QAC5C,qDAAqD;QACrD,IAAI,EAAE,CAAC,0BAA0B,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,YAAY,CAAC,IAAI,CAAC,UAAU,CAAC,EAAE,CAAC;YAC5E,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC;QAC9B,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED,8DAA8D;IAEtD,qBAAqB,CAC3B,EAAiB,EACjB,QAAgB,EAChB,SAA8B;QAE9B,MAAM,KAAK,GAAmB,EAAE,CAAC;QAEjC,MAAM,KAAK,GAAG,CAAC,IAAa,EAAQ,EAAE;YACpC,IAAI,EAAE,CAAC,kBAAkB,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,iBAAiB,CAAC,IAAI,CAAC,EAAE,CAAC;gBAC9D,MAAM,SAAS,GAAG,EAAE,CAAC,kBAAkB,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,IAAI,aAAa,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC;gBAC9F,KAAK,MAAM,MAAM,IAAI,IAAI,CAAC,eAAe,IAAI,EAAE,EAAE,CAAC;oBAChD,MAAM,OAAO,GACX,MAAM,CAAC,KAAK,KAAK,EAAE,CAAC,UAAU,CAAC,cAAc,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,YAAY,CAAC;oBACjF,KAAK,MAAM,OAAO,IAAI,MAAM,CAAC,KAAK,EAAE,CAAC;wBACnC,MAAM,QAAQ,GAAG,EAAE,CAAC,YAAY,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC;wBACtF,IAAI,QAAQ,IAAI,SAAS,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;4BACxC,KAAK,CAAC,IAAI,CAAC;gCACT,MAAM,EAAE,QAAQ;gCAChB,MAAM,EAAE,SAAS,CAAC,GAAG,CAAC,QAAQ,CAAE;gCAChC,IAAI,EAAE,OAAO;gCACb,UAAU,EAAE,WAAW;gCACvB,MAAM,EAAE,yCAAoB,CAAC,OAAO,CAAC;gCACrC,SAAS,EAAE,GAAG,SAAS,IAAI,OAAO,KAAK,eAAe,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,YAAY,IAAI,QAAQ,EAAE;6BAChG,CAAC,CAAC;wBACL,CAAC;oBACH,CAAC;gBACH,CAAC;YACH,CAAC;YACD,EAAE,CAAC,YAAY,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;QAC/B,CAAC,CAAC;QACF,KAAK,CAAC,EAAE,CAAC,CAAC;QACV,OAAO,KAAK,CAAC;IACf,CAAC;IAED,8DAA8D;IAEtD,kBAAkB,CAAC,OAAe,EAAE,QAAgB;QAC1D,MAAM,KAAK,GAAc,EAAE,CAAC;QAC5B,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;QAElC,oCAAoC;QACpC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACtC,KAAK,MAAM,OAAO,IAAI,YAAY,EAAE,CAAC;gBACnC,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,CAAE,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;gBACnC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;oBACX,KAAK,CAAC,IAAI,CAAC;wBACT,EAAE,EAAE,GAAG,QAAQ,IAAI,CAAC,GAAG,CAAC,MAAM;wBAC9B,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC;wBAC/B,IAAI,EAAE,QAAQ;wBACd,IAAI,EAAE,CAAC,GAAG,CAAC;qBACZ,CAAC,CAAC;oBACH,MAAM;gBACR,CAAC;YACH,CAAC;QACH,CAAC;QAED,yEAAyE;QACzE,MAAM,OAAO,GAAG,uBAAuB,CAAC;QACxC,IAAI,CAAyB,CAAC;QAC9B,OAAO,CAAC,CAAC,GAAG,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,KAAK,IAAI,EAAE,CAAC;YAC5C,MAAM,QAAQ,GAAG,CAAC,CAAC,CAAC,CAAE,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,WAAW,EAAE,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;YAC/F,MAAM,OAAO,GAAG,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,EAAE,IAAI,CAAC,CAAC,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC;YACxE,IAAI,OAAO,EAAE,CAAC;gBACZ,MAAM,OAAO,GAAG,OAAO,CAAC,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC;gBACjE,KAAK,CAAC,IAAI,CAAC;oBACT,EAAE,EAAE,GAAG,QAAQ,IAAI,OAAO,QAAQ;oBAClC,IAAI,EAAE,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC;oBAC3B,IAAI,EAAE,QAAQ;oBACd,IAAI,EAAE,OAAO;iBACd,CAAC,CAAC;YACL,CAAC;QACH,CAAC;QAED,OAAO,KAAK,CAAC;IACf,CAAC;IAED,8DAA8D;IAEtD,aAAa,CAAC,SAAiB,EAAE,GAAW;QAClD,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,EAAE,SAAS,CAAC,CAAC;QAC1C,KAAK,MAAM,GAAG,IAAI,UAAU,EAAE,CAAC;YAC7B,MAAM,IAAI,GAAG,IAAI,GAAG,GAAG,CAAC;YACxB,IAAI,EAAE,CAAC,UAAU,CAAC,IAAI,CAAC;gBAAE,OAAO,IAAI,CAAC;QACvC,CAAC;QACD,KAAK,MAAM,GAAG,IAAI,UAAU,EAAE,CAAC;YAC7B,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,QAAQ,GAAG,EAAE,CAAC,CAAC;YAC7C,IAAI,EAAE,CAAC,UAAU,CAAC,KAAK,CAAC;gBAAE,OAAO,KAAK,CAAC;QACzC,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;CACF;AApND,sDAoNC"}

package/dist/graph/relationship-types.d.ts

@@ -0,0 +1,24 @@
+/**
+ * Semantic relationship types for the enriched knowledge graph.
+ *
+ * Every edge in the graph carries a RelationshipType and ConfidenceLevel so
+ * agents can filter, weight, and reason about connections without reading files.
+ */
+export type RelationshipType = 'IMPORT' | 'FUNCTION_CALL' | 'CLASS_EXTENDS' | 'IMPLEMENTS' | 'SHARED_DEPENDENCY' | 'CONFIG_REFERENCE' | 'TEST_COVERS' | 'COMMENTS_ABOUT' | 'SIMILAR_TOPIC';
+export type ConfidenceLevel = 'EXTRACTED' | 'INFERRED' | 'AMBIGUOUS';
+export declare const RELATIONSHIP_WEIGHTS: Record<RelationshipType, number>;
+export interface EnrichedEdge {
+    source: string;
+    target: string;
+    type: RelationshipType;
+    confidence: ConfidenceLevel;
+    weight: number;
+    rationale?: string;
+}
+export interface WhyNode {
+    id: string;
+    text: string;
+    file: string;
+    line: number;
+}
+//# sourceMappingURL=relationship-types.d.ts.map

package/dist/graph/relationship-types.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"relationship-types.d.ts","sourceRoot":"","sources":["../../src/graph/relationship-types.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,MAAM,MAAM,gBAAgB,GACxB,QAAQ,GACR,eAAe,GACf,eAAe,GACf,YAAY,GACZ,mBAAmB,GACnB,kBAAkB,GAClB,aAAa,GACb,gBAAgB,GAChB,eAAe,CAAC;AAEpB,MAAM,MAAM,eAAe,GAAG,WAAW,GAAG,UAAU,GAAG,WAAW,CAAC;AAErE,eAAO,MAAM,oBAAoB,EAAE,MAAM,CAAC,gBAAgB,EAAE,MAAM,CAUjE,CAAC;AAEF,MAAM,WAAW,YAAY;IAC3B,MAAM,EAAE,MAAM,CAAC;IACf,MAAM,EAAE,MAAM,CAAC;IACf,IAAI,EAAE,gBAAgB,CAAC;IACvB,UAAU,EAAE,eAAe,CAAC;IAC5B,MAAM,EAAE,MAAM,CAAC;IACf,SAAS,CAAC,EAAE,MAAM,CAAC;CACpB;AAED,MAAM,WAAW,OAAO;IACtB,EAAE,EAAE,MAAM,CAAC;IACX,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,MAAM,CAAC;CACd"}

package/dist/graph/relationship-types.js

@@ -0,0 +1,21 @@
+"use strict";
+/**
+ * Semantic relationship types for the enriched knowledge graph.
+ *
+ * Every edge in the graph carries a RelationshipType and ConfidenceLevel so
+ * agents can filter, weight, and reason about connections without reading files.
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.RELATIONSHIP_WEIGHTS = void 0;
+exports.RELATIONSHIP_WEIGHTS = {
+    CLASS_EXTENDS: 3,
+    IMPLEMENTS: 3,
+    FUNCTION_CALL: 2,
+    TEST_COVERS: 2,
+    IMPORT: 1,
+    CONFIG_REFERENCE: 1,
+    SHARED_DEPENDENCY: 0.5,
+    COMMENTS_ABOUT: 0.5,
+    SIMILAR_TOPIC: 0.25,
+};
+//# sourceMappingURL=relationship-types.js.map

package/dist/graph/relationship-types.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"relationship-types.js","sourceRoot":"","sources":["../../src/graph/relationship-types.ts"],"names":[],"mappings":";AAAA;;;;;GAKG;;;AAeU,QAAA,oBAAoB,GAAqC;IACpE,aAAa,EAAK,CAAC;IACnB,UAAU,EAAQ,CAAC;IACnB,aAAa,EAAK,CAAC;IACnB,WAAW,EAAO,CAAC;IACnB,MAAM,EAAY,CAAC;IACnB,gBAAgB,EAAE,CAAC;IACnB,iBAAiB,EAAE,GAAG;IACtB,cAAc,EAAI,GAAG;IACrB,aAAa,EAAK,IAAI;CACvB,CAAC"}

package/dist/graph/surprising-connections.d.ts

@@ -0,0 +1,39 @@
+/**
+ * Surprising connection detection for the knowledge graph.
+ *
+ * "Surprising" = a dependency edge that crosses module boundaries in an
+ * unexpected way. Scored by: how far apart the directories are × how rare
+ * that specific cross-module path is.
+ *
+ * score = directoryDistance(a, b) / log(crossEdgeCount + 1)
+ *
+ * High score = few edges between those modules + deep directory separation.
+ */
+interface GNode {
+    id: string;
+}
+interface GEdge {
+    source: string;
+    target: string;
+}
+export interface SurprisingConnection {
+    source: string;
+    target: string;
+    sourceModule: string;
+    targetModule: string;
+    score: number;
+    explanation: string;
+}
+/**
+ * Returns the "module" label for a file path — the meaningful top-level
+ * directory group. Skips common language-convention prefixes (src/, lib/)
+ * so that `src/auth/service.ts` → `auth`, not `src`.
+ */
+export declare function getModule(filePath: string, repoRoot: string): string;
+/**
+ * Find edges that cross module boundaries, ranked by "unexpectedness".
+ * Returns at most `topN` results.
+ */
+export declare function findSurprisingConnections(nodes: ReadonlyArray<GNode>, edges: ReadonlyArray<GEdge>, repoRoot: string, topN?: number): SurprisingConnection[];
+export {};
+//# sourceMappingURL=surprising-connections.d.ts.map

package/dist/graph/surprising-connections.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"surprising-connections.d.ts","sourceRoot":"","sources":["../../src/graph/surprising-connections.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAIH,UAAU,KAAK;IAAG,EAAE,EAAE,MAAM,CAAA;CAAE;AAC9B,UAAU,KAAK;IAAG,MAAM,EAAE,MAAM,CAAC;IAAC,MAAM,EAAE,MAAM,CAAA;CAAE;AAElD,MAAM,WAAW,oBAAoB;IACnC,MAAM,EAAE,MAAM,CAAC;IACf,MAAM,EAAE,MAAM,CAAC;IACf,YAAY,EAAE,MAAM,CAAC;IACrB,YAAY,EAAE,MAAM,CAAC;IACrB,KAAK,EAAE,MAAM,CAAC;IACd,WAAW,EAAE,MAAM,CAAC;CACrB;AAKD;;;;GAIG;AACH,wBAAgB,SAAS,CAAC,QAAQ,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,GAAG,MAAM,CAMpE;AAaD;;;GAGG;AACH,wBAAgB,yBAAyB,CACvC,KAAK,EAAE,aAAa,CAAC,KAAK,CAAC,EAC3B,KAAK,EAAE,aAAa,CAAC,KAAK,CAAC,EAC3B,QAAQ,EAAE,MAAM,EAChB,IAAI,SAAK,GACR,oBAAoB,EAAE,CA6CxB"}

package/dist/graph/surprising-connections.js

@@ -0,0 +1,127 @@
+"use strict";
+/**
+ * Surprising connection detection for the knowledge graph.
+ *
+ * "Surprising" = a dependency edge that crosses module boundaries in an
+ * unexpected way. Scored by: how far apart the directories are × how rare
+ * that specific cross-module path is.
+ *
+ * score = directoryDistance(a, b) / log(crossEdgeCount + 1)
+ *
+ * High score = few edges between those modules + deep directory separation.
+ */
+var __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    var desc = Object.getOwnPropertyDescriptor(m, k);
+    if (!desc || ("get" in desc ? !m.__esModule : desc.writable || desc.configurable)) {
+      desc = { enumerable: true, get: function() { return m[k]; } };
+    }
+    Object.defineProperty(o, k2, desc);
+}) : (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    o[k2] = m[k];
+}));
+var __setModuleDefault = (this && this.__setModuleDefault) || (Object.create ? (function(o, v) {
+    Object.defineProperty(o, "default", { enumerable: true, value: v });
+}) : function(o, v) {
+    o["default"] = v;
+});
+var __importStar = (this && this.__importStar) || (function () {
+    var ownKeys = function(o) {
+        ownKeys = Object.getOwnPropertyNames || function (o) {
+            var ar = [];
+            for (var k in o) if (Object.prototype.hasOwnProperty.call(o, k)) ar[ar.length] = k;
+            return ar;
+        };
+        return ownKeys(o);
+    };
+    return function (mod) {
+        if (mod && mod.__esModule) return mod;
+        var result = {};
+        if (mod != null) for (var k = ownKeys(mod), i = 0; i < k.length; i++) if (k[i] !== "default") __createBinding(result, mod, k[i]);
+        __setModuleDefault(result, mod);
+        return result;
+    };
+})();
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.getModule = getModule;
+exports.findSurprisingConnections = findSurprisingConnections;
+const path = __importStar(require("path"));
+// Common single-level prefixes that aren't meaningful module names on their own.
+const COMMON_PREFIXES = new Set(['src', 'lib', 'app', 'packages', 'modules', 'source']);
+/**
+ * Returns the "module" label for a file path — the meaningful top-level
+ * directory group. Skips common language-convention prefixes (src/, lib/)
+ * so that `src/auth/service.ts` → `auth`, not `src`.
+ */
+function getModule(filePath, repoRoot) {
+    const rel = path.relative(repoRoot, filePath);
+    const parts = rel.split(path.sep).filter(Boolean);
+    if (parts.length <= 1)
+        return '(root)';
+    if (COMMON_PREFIXES.has(parts[0]) && parts.length > 2)
+        return parts[1];
+    return parts[0];
+}
+function directoryDistance(a, b) {
+    const aParts = a.split(path.sep);
+    const bParts = b.split(path.sep);
+    let common = 0;
+    for (let i = 0; i < Math.min(aParts.length, bParts.length); i++) {
+        if (aParts[i] === bParts[i])
+            common++;
+        else
+            break;
+    }
+    return (aParts.length - 1 - common) + (bParts.length - 1 - common);
+}
+/**
+ * Find edges that cross module boundaries, ranked by "unexpectedness".
+ * Returns at most `topN` results.
+ */
+function findSurprisingConnections(nodes, edges, repoRoot, topN = 10) {
+    const nodeIds = new Set(nodes.map(n => n.id));
+    const moduleOf = new Map();
+    for (const n of nodes)
+        moduleOf.set(n.id, getModule(n.id, repoRoot));
+    // Count cross-module edges per module-pair key
+    const pairCounts = new Map();
+    for (const e of edges) {
+        if (!nodeIds.has(e.source) || !nodeIds.has(e.target))
+            continue;
+        const sm = moduleOf.get(e.source) ?? '(unknown)';
+        const tm = moduleOf.get(e.target) ?? '(unknown)';
+        if (sm !== tm) {
+            const key = `${sm}→${tm}`;
+            pairCounts.set(key, (pairCounts.get(key) ?? 0) + 1);
+        }
+    }
+    const results = [];
+    for (const e of edges) {
+        if (!nodeIds.has(e.source) || !nodeIds.has(e.target))
+            continue;
+        const sm = moduleOf.get(e.source) ?? '(unknown)';
+        const tm = moduleOf.get(e.target) ?? '(unknown)';
+        if (sm === tm)
+            continue;
+        const pairCount = pairCounts.get(`${sm}→${tm}`) ?? 1;
+        const dist = directoryDistance(e.source, e.target);
+        const score = dist / Math.log(pairCount + 1);
+        results.push({
+            source: e.source,
+            target: e.target,
+            sourceModule: sm,
+            targetModule: tm,
+            score,
+            explanation: `${sm} → ${tm} (${pairCount} cross-edge${pairCount !== 1 ? 's' : ''}, distance ${dist})`,
+        });
+    }
+    return results
+        .sort((a, b) => b.score - a.score)
+        .filter((r, i, arr) => {
+        // Deduplicate: keep only first occurrence of each source→target pair
+        return arr.findIndex(x => x.source === r.source && x.target === r.target) === i;
+    })
+        .slice(0, topN);
+}
+//# sourceMappingURL=surprising-connections.js.map

package/dist/graph/surprising-connections.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"surprising-connections.js","sourceRoot":"","sources":["../../src/graph/surprising-connections.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;GAUG;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAwBH,8BAMC;AAiBD,8DAkDC;AA/FD,2CAA6B;AAc7B,iFAAiF;AACjF,MAAM,eAAe,GAAG,IAAI,GAAG,CAAC,CAAC,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,UAAU,EAAE,SAAS,EAAE,QAAQ,CAAC,CAAC,CAAC;AAExF;;;;GAIG;AACH,SAAgB,SAAS,CAAC,QAAgB,EAAE,QAAgB;IAC1D,MAAM,GAAG,GAAG,IAAI,CAAC,QAAQ,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;IAC9C,MAAM,KAAK,GAAG,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;IAClD,IAAI,KAAK,CAAC,MAAM,IAAI,CAAC;QAAE,OAAO,QAAQ,CAAC;IACvC,IAAI,eAAe,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAE,CAAC,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC;QAAE,OAAO,KAAK,CAAC,CAAC,CAAE,CAAC;IACzE,OAAO,KAAK,CAAC,CAAC,CAAE,CAAC;AACnB,CAAC;AAED,SAAS,iBAAiB,CAAC,CAAS,EAAE,CAAS;IAC7C,MAAM,MAAM,GAAG,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IACjC,MAAM,MAAM,GAAG,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IACjC,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAChE,IAAI,MAAM,CAAC,CAAC,CAAC,KAAK,MAAM,CAAC,CAAC,CAAC;YAAE,MAAM,EAAE,CAAC;;YACjC,MAAM;IACb,CAAC;IACD,OAAO,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,GAAG,MAAM,CAAC,CAAC;AACrE,CAAC;AAED;;;GAGG;AACH,SAAgB,yBAAyB,CACvC,KAA2B,EAC3B,KAA2B,EAC3B,QAAgB,EAChB,IAAI,GAAG,EAAE;IAET,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC9C,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC3C,KAAK,MAAM,CAAC,IAAI,KAAK;QAAE,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,SAAS,CAAC,CAAC,CAAC,EAAE,EAAE,QAAQ,CAAC,CAAC,CAAC;IAErE,+CAA+C;IAC/C,MAAM,UAAU,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC7C,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACtB,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC;YAAE,SAAS;QAC/D,MAAM,EAAE,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,WAAW,CAAC;QACjD,MAAM,EAAE,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,WAAW,CAAC;QACjD,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC;YACd,MAAM,GAAG,GAAG,GAAG,EAAE,IAAI,EAAE,EAAE,CAAC;YAC1B,UAAU,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACtD,CAAC;IACH,CAAC;IAED,MAAM,OAAO,GAA2B,EAAE,CAAC;IAC3C,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACtB,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC;YAAE,SAAS;QAC/D,MAAM,EAAE,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,WAAW,CAAC;QACjD,MAAM,EAAE,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,WAAW,CAAC;QACjD,IAAI,EAAE,KAAK,EAAE;YAAE,SAAS;QAExB,MAAM,SAAS,GAAG,UAAU,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,CAAC;QACrD,MAAM,IAAI,GAAG,iBAAiB,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC;QACnD,MAAM,KAAK,GAAG,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,SAAS,GAAG,CAAC,CAAC,CAAC;QAE7C,OAAO,CAAC,IAAI,CAAC;YACX,MAAM,EAAE,CAAC,CAAC,MAAM;YAChB,MAAM,EAAE,CAAC,CAAC,MAAM;YAChB,YAAY,EAAE,EAAE;YAChB,YAAY,EAAE,EAAE;YAChB,KAAK;YACL,WAAW,EAAE,GAAG,EAAE,MAAM,EAAE,KAAK,SAAS,cAAc,SAAS,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,cAAc,IAAI,GAAG;SACtG,CAAC,CAAC;IACL,CAAC;IAED,OAAO,OAAO;SACX,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC;SACjC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,EAAE;QACpB,qEAAqE;QACrE,OAAO,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;IAClF,CAAC,CAAC;SACD,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;AACpB,CAAC"}

package/dist/hook-pre-tool-use.d.ts

@@ -0,0 +1,14 @@
+/**
+ * gate-keeper pre-tool-use hook
+ *
+ * Called by Claude Code's PreToolUse hook on every Write/Edit operation.
+ * Calls the daemon's check_pre_edit_safety endpoint and prints a warning
+ * (exit code 0 — non-blocking) if the edit would impact 3+ fragile
+ * dependents or has a "block" verdict.
+ *
+ * The warning is printed to stderr so Claude sees it but the edit is
+ * allowed to proceed. This is a safety advisory, not a gate — for
+ * blocking quality gates, see hook-receiver.ts (PostToolUse).
+ */
+export declare function main(): Promise<void>;
+//# sourceMappingURL=hook-pre-tool-use.d.ts.map

package/dist/hook-pre-tool-use.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"hook-pre-tool-use.d.ts","sourceRoot":"","sources":["../src/hook-pre-tool-use.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AA+DH,wBAAsB,IAAI,IAAI,OAAO,CAAC,IAAI,CAAC,CAyE1C"}