@neurcode-ai/cli 0.10.1 → 0.12.0

package/dist/utils/import-edge-classifier.d.ts

@@ -0,0 +1,76 @@
+/**
+ * Deterministic import-edge classifier.
+ *
+ * Pure path arithmetic — no AST, no filesystem walks beyond explicit
+ * candidate-file existence checks, no probability. Same input always
+ * produces the same output.
+ *
+ * The classifier takes an `ImportEdge`, resolves it to one or more candidate
+ * repository paths, and matches those candidates against:
+ *   - the explicit `forbiddenBoundaries` declared by the intent contract
+ *   - the existing path-boundary classifier (generated-code, infra, ci,
+ *     dependency-manifest, sensitive)
+ *
+ * Only edges whose target falls within a forbidden boundary OR a
+ * `review-required` boundary OR a generated-code path produce findings.
+ * Edges that resolve to unrelated, unflagged paths are silently skipped —
+ * they are signal-free.
+ */
+import type { ImportEdge, ImportLanguage } from './import-edge-extractor';
+export type ImportEdgeSeverity = 'blocking' | 'advisory';
+export type ImportEdgePolicy = 'forbidden' | 'review-required' | 'generated-code';
+export type ImportEdgeBoundaryType = 'sensitive' | 'infra' | 'ci' | 'dependency-manifest' | 'service' | 'module' | 'generated-code' | 'unspecified';
+export interface ImportEdgeFinding {
+    /** The diff file that introduced the new import. */
+    sourceFile: string;
+    /** 1-based line number where the import appeared. */
+    sourceLine: number;
+    /** Verbatim authored target text (e.g. `airflow.providers.celery.executors.celery_executor`). */
+    importTarget: string;
+    /** Repository-relative path the target resolved to, when known. */
+    resolvedTargetPath: string;
+    /** The forbidden-boundary or classifier path that matched. */
+    resolvedBoundary: string;
+    /** Boundary classification carried into the canonical envelope. */
+    boundaryType: ImportEdgeBoundaryType;
+    /** Governance policy applied to the edge. */
+    policy: ImportEdgePolicy;
+    /** Derived severity (forbidden → blocking, review-required → advisory). */
+    governanceSeverity: ImportEdgeSeverity;
+    /** Human reason copied from the intent boundary, when available. */
+    reason: string;
+    /** Edge kind echoed from the extractor (static / relative / dynamic / require / side-effect). */
+    edgeKind: 'static' | 'relative' | 'dynamic' | 'require' | 'side-effect';
+    language: ImportLanguage;
+    /** Guarantee markers — never inferred, always literal. */
+    deterministic: true;
+    replayStable: true;
+}
+export interface IntentForbiddenBoundary {
+    type: string;
+    path: string;
+    policy: 'forbidden' | 'review-required' | 'allowed';
+    reason?: string;
+}
+export interface IntentApprovedScope {
+    files: readonly string[];
+    modules: readonly string[];
+    services: readonly string[];
+}
+export interface IntentContextSnapshot {
+    approvedScope: IntentApprovedScope;
+    forbiddenBoundaries: readonly IntentForbiddenBoundary[];
+}
+/** Candidate repository-relative paths for an import edge, in priority order. */
+export declare function candidatePathsForEdge(edge: ImportEdge, projectRoot: string, intent: IntentContextSnapshot): string[];
+/**
+ * Resolve an edge to a single ImportEdgeFinding, or null if the edge is
+ * either unresolvable or resolves outside any flagged boundary.
+ *
+ * Resolution priority:
+ *   1. Explicit `forbiddenBoundaries` (forbidden first, then review-required)
+ *   2. Path-boundary classifier (generated-code only — other classifier
+ *      categories are diagnostic but not auto-blocking for imports)
+ */
+export declare function classifyImportEdge(edge: ImportEdge, projectRoot: string, intent: IntentContextSnapshot): ImportEdgeFinding | null;
+//# sourceMappingURL=import-edge-classifier.d.ts.map

package/dist/utils/import-edge-classifier.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"import-edge-classifier.d.ts","sourceRoot":"","sources":["../../src/utils/import-edge-classifier.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;GAiBG;AAMH,OAAO,KAAK,EAAE,UAAU,EAAE,cAAc,EAAE,MAAM,yBAAyB,CAAC;AAO1E,MAAM,MAAM,kBAAkB,GAAG,UAAU,GAAG,UAAU,CAAC;AACzD,MAAM,MAAM,gBAAgB,GAAG,WAAW,GAAG,iBAAiB,GAAG,gBAAgB,CAAC;AAClF,MAAM,MAAM,sBAAsB,GAC9B,WAAW,GACX,OAAO,GACP,IAAI,GACJ,qBAAqB,GACrB,SAAS,GACT,QAAQ,GACR,gBAAgB,GAChB,aAAa,CAAC;AAElB,MAAM,WAAW,iBAAiB;IAChC,oDAAoD;IACpD,UAAU,EAAE,MAAM,CAAC;IACnB,qDAAqD;IACrD,UAAU,EAAE,MAAM,CAAC;IACnB,iGAAiG;IACjG,YAAY,EAAE,MAAM,CAAC;IACrB,mEAAmE;IACnE,kBAAkB,EAAE,MAAM,CAAC;IAC3B,8DAA8D;IAC9D,gBAAgB,EAAE,MAAM,CAAC;IACzB,mEAAmE;IACnE,YAAY,EAAE,sBAAsB,CAAC;IACrC,6CAA6C;IAC7C,MAAM,EAAE,gBAAgB,CAAC;IACzB,2EAA2E;IAC3E,kBAAkB,EAAE,kBAAkB,CAAC;IACvC,oEAAoE;IACpE,MAAM,EAAE,MAAM,CAAC;IACf,iGAAiG;IACjG,QAAQ,EAAE,QAAQ,GAAG,UAAU,GAAG,SAAS,GAAG,SAAS,GAAG,aAAa,CAAC;IACxE,QAAQ,EAAE,cAAc,CAAC;IACzB,0DAA0D;IAC1D,aAAa,EAAE,IAAI,CAAC;IACpB,YAAY,EAAE,IAAI,CAAC;CACpB;AAED,MAAM,WAAW,uBAAuB;IACtC,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,MAAM,CAAC;IACb,MAAM,EAAE,WAAW,GAAG,iBAAiB,GAAG,SAAS,CAAC;IACpD,MAAM,CAAC,EAAE,MAAM,CAAC;CACjB;AAED,MAAM,WAAW,mBAAmB;IAClC,KAAK,EAAE,SAAS,MAAM,EAAE,CAAC;IACzB,OAAO,EAAE,SAAS,MAAM,EAAE,CAAC;IAC3B,QAAQ,EAAE,SAAS,MAAM,EAAE,CAAC;CAC7B;AAED,MAAM,WAAW,qBAAqB;IACpC,aAAa,EAAE,mBAAmB,CAAC;IACnC,mBAAmB,EAAE,SAAS,uBAAuB,EAAE,CAAC;CACzD;AAUD,iFAAiF;AACjF,wBAAgB,qBAAqB,CACnC,IAAI,EAAE,UAAU,EAChB,WAAW,EAAE,MAAM,EACnB,MAAM,EAAE,qBAAqB,GAC5B,MAAM,EAAE,CAKV;AAkJD;;;;;;;;GAQG;AACH,wBAAgB,kBAAkB,CAChC,IAAI,EAAE,UAAU,EAChB,WAAW,EAAE,MAAM,EACnB,MAAM,EAAE,qBAAqB,GAC5B,iBAAiB,GAAG,IAAI,CA8E1B"}

package/dist/utils/import-edge-classifier.js

@@ -0,0 +1,308 @@
+"use strict";
+/**
+ * Deterministic import-edge classifier.
+ *
+ * Pure path arithmetic — no AST, no filesystem walks beyond explicit
+ * candidate-file existence checks, no probability. Same input always
+ * produces the same output.
+ *
+ * The classifier takes an `ImportEdge`, resolves it to one or more candidate
+ * repository paths, and matches those candidates against:
+ *   - the explicit `forbiddenBoundaries` declared by the intent contract
+ *   - the existing path-boundary classifier (generated-code, infra, ci,
+ *     dependency-manifest, sensitive)
+ *
+ * Only edges whose target falls within a forbidden boundary OR a
+ * `review-required` boundary OR a generated-code path produce findings.
+ * Edges that resolve to unrelated, unflagged paths are silently skipped —
+ * they are signal-free.
+ */
+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.candidatePathsForEdge = candidatePathsForEdge;
+exports.classifyImportEdge = classifyImportEdge;
+const path = __importStar(require("path"));
+const fs = __importStar(require("fs"));
+const core_1 = require("@neurcode-ai/core");
+const path_boundary_classifier_1 = require("./path-boundary-classifier");
+// ────────────────────────────────────────────────────────────────────────────
+// Resolution helpers
+// ────────────────────────────────────────────────────────────────────────────
+const PY_INIT = '__init__.py';
+const PY_INIT_STUB = '__init__.pyi';
+const PY_FILE_EXTS = ['.py', '.pyi'];
+/** Candidate repository-relative paths for an import edge, in priority order. */
+function candidatePathsForEdge(edge, projectRoot, intent) {
+    if (edge.language === 'python') {
+        return candidatesForPython(edge, projectRoot, intent);
+    }
+    return candidatesForJavaScript(edge, projectRoot);
+}
+function candidatesForPython(edge, projectRoot, intent) {
+    const out = [];
+    // Relative imports: `from .foo import x` / `from ..bar import y`
+    if (edge.relativeLevel > 0) {
+        const sourceDirParts = path.posix
+            .normalize(edge.sourceFile)
+            .split('/')
+            .slice(0, -1);
+        const goUp = Math.max(0, edge.relativeLevel - 1);
+        const base = sourceDirParts.slice(0, sourceDirParts.length - goUp);
+        const targetParts = edge.importTarget
+            .replace(/^\.+/, '')
+            .split('.')
+            .filter(Boolean);
+        const baseJoined = [...base, ...targetParts].join('/');
+        if (baseJoined) {
+            out.push(...materializePythonModulePaths(baseJoined, projectRoot));
+        }
+        return uniqueOrdered(out);
+    }
+    // Absolute imports: try several layout roots so monorepos (Airflow,
+    // Celery, etc.) and src/-style packages all resolve.
+    const dotted = edge.importTarget.split('.').filter(Boolean);
+    if (dotted.length === 0)
+        return out;
+    const moduleRel = dotted.join('/');
+    const layoutRoots = inferLayoutRoots(intent);
+    for (const rootPrefix of layoutRoots) {
+        const composed = rootPrefix ? `${rootPrefix}/${moduleRel}` : moduleRel;
+        out.push(...materializePythonModulePaths(composed, projectRoot));
+    }
+    return uniqueOrdered(out);
+}
+function materializePythonModulePaths(modulePath, projectRoot) {
+    const out = [];
+    for (const ext of PY_FILE_EXTS) {
+        const candidate = `${modulePath}${ext}`;
+        if (existsAtRoot(projectRoot, candidate))
+            out.push(candidate);
+    }
+    for (const init of [PY_INIT, PY_INIT_STUB]) {
+        const candidate = `${modulePath}/${init}`;
+        if (existsAtRoot(projectRoot, candidate))
+            out.push(candidate);
+    }
+    // Always include the unresolved candidates for boundary matching even if
+    // the file does not physically exist (e.g. when intent forbids importing
+    // a not-yet-installed module).
+    for (const ext of PY_FILE_EXTS)
+        out.push(`${modulePath}${ext}`);
+    out.push(`${modulePath}/${PY_INIT}`);
+    out.push(modulePath);
+    return out;
+}
+function candidatesForJavaScript(edge, projectRoot) {
+    const target = edge.importTarget;
+    // External packages: anything that does not start with `./`, `../`, `/`
+    // is treated as bare and skipped from boundary-match resolution.
+    if (!target.startsWith('.') && !target.startsWith('/'))
+        return [];
+    const sourceDirParts = path.posix
+        .normalize(edge.sourceFile)
+        .split('/')
+        .slice(0, -1);
+    const relative = target.startsWith('/') ? target.slice(1) : path.posix.normalize([...sourceDirParts, target].join('/'));
+    const exts = ['.ts', '.tsx', '.js', '.jsx', '.mjs', '.cjs'];
+    const out = [];
+    for (const ext of exts) {
+        const candidate = `${relative}${ext}`;
+        if (existsAtRoot(projectRoot, candidate))
+            out.push(candidate);
+        out.push(candidate); // also include unresolved form for boundary matching
+    }
+    for (const indexFile of ['index.ts', 'index.tsx', 'index.js', 'index.jsx', 'index.mjs', 'index.cjs']) {
+        const candidate = `${relative}/${indexFile}`;
+        if (existsAtRoot(projectRoot, candidate))
+            out.push(candidate);
+        out.push(candidate);
+    }
+    out.push(relative);
+    return uniqueOrdered(out);
+}
+function inferLayoutRoots(intent) {
+    // Always include the bare root first; then derive additional layout
+    // prefixes from any approved module that ends in a canonical Python
+    // source root (`/src`). This is bounded and deterministic.
+    const roots = new Set(['']);
+    for (const mod of intent.approvedScope.modules) {
+        const normalized = (0, core_1.normalizeRepoPath)(mod);
+        if (!normalized)
+            continue;
+        const parts = normalized.split('/');
+        for (let i = 1; i <= parts.length; i++) {
+            const prefix = parts.slice(0, i).join('/');
+            // Common monorepo source roots:
+            //   `airflow-core/src/airflow/jobs`  → `airflow-core/src`
+            //   `apps/api/src/foo`               → `apps/api/src`
+            //   `packages/core/src/util`         → `packages/core/src`
+            if (prefix.endsWith('/src') || prefix === 'src')
+                roots.add(prefix);
+        }
+        // Whole-prefix mode: also useful for shallow projects (`apps/api`)
+        roots.add(normalized);
+    }
+    return [...roots].sort();
+}
+function existsAtRoot(projectRoot, repoRelative) {
+    try {
+        return fs.existsSync(path.join(projectRoot, repoRelative));
+    }
+    catch {
+        return false;
+    }
+}
+function uniqueOrdered(values) {
+    const seen = new Set();
+    const out = [];
+    for (const v of values) {
+        if (seen.has(v))
+            continue;
+        seen.add(v);
+        out.push(v);
+    }
+    return out;
+}
+// ────────────────────────────────────────────────────────────────────────────
+// Boundary matching
+// ────────────────────────────────────────────────────────────────────────────
+const ALLOWED_BOUNDARY_TYPES = new Set([
+    'sensitive', 'infra', 'ci', 'dependency-manifest', 'service', 'module', 'generated-code', 'unspecified',
+]);
+function asBoundaryType(value) {
+    if (value && ALLOWED_BOUNDARY_TYPES.has(value)) {
+        return value;
+    }
+    return 'unspecified';
+}
+/**
+ * Resolve an edge to a single ImportEdgeFinding, or null if the edge is
+ * either unresolvable or resolves outside any flagged boundary.
+ *
+ * Resolution priority:
+ *   1. Explicit `forbiddenBoundaries` (forbidden first, then review-required)
+ *   2. Path-boundary classifier (generated-code only — other classifier
+ *      categories are diagnostic but not auto-blocking for imports)
+ */
+function classifyImportEdge(edge, projectRoot, intent) {
+    const candidates = candidatePathsForEdge(edge, projectRoot, intent);
+    if (candidates.length === 0)
+        return null;
+    // Pre-normalise approved-scope so we can short-circuit edges that resolve
+    // inside the declared scope. An import from an allowed file *into* an
+    // allowed module is signal-free.
+    const approvedFileSet = new Set(intent.approvedScope.files.map((p) => (0, core_1.normalizeRepoPath)(p)).filter(Boolean));
+    const approvedModulePaths = intent.approvedScope.modules.map((p) => (0, core_1.normalizeRepoPath)(p)).filter(Boolean);
+    // First pass: forbidden boundaries (forbidden > review-required).
+    const forbiddenSorted = [...intent.forbiddenBoundaries].sort((a, b) => {
+        if (a.policy === b.policy)
+            return 0;
+        if (a.policy === 'forbidden')
+            return -1;
+        if (b.policy === 'forbidden')
+            return 1;
+        return 0;
+    });
+    for (const boundary of forbiddenSorted) {
+        if (boundary.policy === 'allowed')
+            continue;
+        const boundaryPath = (0, core_1.normalizeRepoPath)(boundary.path);
+        if (!boundaryPath)
+            continue;
+        for (const candidate of candidates) {
+            const normalized = (0, core_1.normalizeRepoPath)(candidate);
+            if (!normalized)
+                continue;
+            if (normalized === boundaryPath || normalized.startsWith(`${boundaryPath}/`)) {
+                // Skip if the resolved target is also inside the approved scope —
+                // that means the intent allowed the import explicitly.
+                if (approvedFileSet.has(normalized))
+                    continue;
+                if (matchesPrefix(normalized, approvedModulePaths) && boundary.policy !== 'forbidden') {
+                    continue;
+                }
+                return {
+                    sourceFile: edge.sourceFile,
+                    sourceLine: edge.sourceLine,
+                    importTarget: edge.importTarget,
+                    resolvedTargetPath: normalized,
+                    resolvedBoundary: boundaryPath,
+                    boundaryType: asBoundaryType(boundary.type),
+                    policy: boundary.policy === 'forbidden' ? 'forbidden' : 'review-required',
+                    governanceSeverity: boundary.policy === 'forbidden' ? 'blocking' : 'advisory',
+                    reason: boundary.reason ?? `Import edge crosses ${boundary.type} boundary (${boundary.path}).`,
+                    edgeKind: edge.importKind,
+                    language: edge.language,
+                    deterministic: true,
+                    replayStable: true,
+                };
+            }
+        }
+    }
+    // Second pass: generated-code classifier. Only fire if the target was not
+    // already explicitly allowed.
+    for (const candidate of candidates) {
+        const normalized = (0, core_1.normalizeRepoPath)(candidate);
+        if (!normalized)
+            continue;
+        if (approvedFileSet.has(normalized))
+            continue;
+        if (matchesPrefix(normalized, approvedModulePaths))
+            continue;
+        const classification = (0, path_boundary_classifier_1.classifyPathBoundary)(normalized);
+        if (classification?.category === 'generated-code') {
+            return {
+                sourceFile: edge.sourceFile,
+                sourceLine: edge.sourceLine,
+                importTarget: edge.importTarget,
+                resolvedTargetPath: normalized,
+                resolvedBoundary: normalized,
+                boundaryType: 'generated-code',
+                policy: 'generated-code',
+                governanceSeverity: 'blocking',
+                reason: `Import edge targets generated-code (${classification.reason}). Regenerate from source instead of importing from a hand-written path.`,
+                edgeKind: edge.importKind,
+                language: edge.language,
+                deterministic: true,
+                replayStable: true,
+            };
+        }
+    }
+    return null;
+}
+function matchesPrefix(file, prefixes) {
+    return prefixes.some((p) => p && (file === p || file.startsWith(`${p}/`)));
+}
+//# sourceMappingURL=import-edge-classifier.js.map

package/dist/utils/import-edge-classifier.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"import-edge-classifier.js","sourceRoot":"","sources":["../../src/utils/import-edge-classifier.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;;;;;;;;GAiBG;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA+EH,sDASC;AA2JD,gDAkFC;AAnUD,2CAA6B;AAC7B,uCAAyB;AACzB,4CAAsD;AAGtD,yEAAkE;AA+DlE,+EAA+E;AAC/E,qBAAqB;AACrB,+EAA+E;AAE/E,MAAM,OAAO,GAAG,aAAa,CAAC;AAC9B,MAAM,YAAY,GAAG,cAAc,CAAC;AACpC,MAAM,YAAY,GAAG,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;AAErC,iFAAiF;AACjF,SAAgB,qBAAqB,CACnC,IAAgB,EAChB,WAAmB,EACnB,MAA6B;IAE7B,IAAI,IAAI,CAAC,QAAQ,KAAK,QAAQ,EAAE,CAAC;QAC/B,OAAO,mBAAmB,CAAC,IAAI,EAAE,WAAW,EAAE,MAAM,CAAC,CAAC;IACxD,CAAC;IACD,OAAO,uBAAuB,CAAC,IAAI,EAAE,WAAW,CAAC,CAAC;AACpD,CAAC;AAED,SAAS,mBAAmB,CAC1B,IAAgB,EAChB,WAAmB,EACnB,MAA6B;IAE7B,MAAM,GAAG,GAAa,EAAE,CAAC;IAEzB,iEAAiE;IACjE,IAAI,IAAI,CAAC,aAAa,GAAG,CAAC,EAAE,CAAC;QAC3B,MAAM,cAAc,GAAG,IAAI,CAAC,KAAK;aAC9B,SAAS,CAAC,IAAI,CAAC,UAAU,CAAC;aAC1B,KAAK,CAAC,GAAG,CAAC;aACV,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAChB,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,aAAa,GAAG,CAAC,CAAC,CAAC;QACjD,MAAM,IAAI,GAAG,cAAc,CAAC,KAAK,CAAC,CAAC,EAAE,cAAc,CAAC,MAAM,GAAG,IAAI,CAAC,CAAC;QACnE,MAAM,WAAW,GAAG,IAAI,CAAC,YAAY;aAClC,OAAO,CAAC,MAAM,EAAE,EAAE,CAAC;aACnB,KAAK,CAAC,GAAG,CAAC;aACV,MAAM,CAAC,OAAO,CAAC,CAAC;QACnB,MAAM,UAAU,GAAG,CAAC,GAAG,IAAI,EAAE,GAAG,WAAW,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACvD,IAAI,UAAU,EAAE,CAAC;YACf,GAAG,CAAC,IAAI,CAAC,GAAG,4BAA4B,CAAC,UAAU,EAAE,WAAW,CAAC,CAAC,CAAC;QACrE,CAAC;QACD,OAAO,aAAa,CAAC,GAAG,CAAC,CAAC;IAC5B,CAAC;IAED,oEAAoE;IACpE,qDAAqD;IACrD,MAAM,MAAM,GAAG,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;IAC5D,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,GAAG,CAAC;IAEpC,MAAM,SAAS,GAAG,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IACnC,MAAM,WAAW,GAAG,gBAAgB,CAAC,MAAM,CAAC,CAAC;IAC7C,KAAK,MAAM,UAAU,IAAI,WAAW,EAAE,CAAC;QACrC,MAAM,QAAQ,GAAG,UAAU,CAAC,CAAC,CAAC,GAAG,UAAU,IAAI,SAAS,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC;QACvE,GAAG,CAAC,IAAI,CAAC,GAAG,4BAA4B,CAAC,QAAQ,EAAE,WAAW,CAAC,CAAC,CAAC;IACnE,CAAC;IACD,OAAO,aAAa,CAAC,GAAG,CAAC,CAAC;AAC5B,CAAC;AAED,SAAS,4BAA4B,CAAC,UAAkB,EAAE,WAAmB;IAC3E,MAAM,GAAG,GAAa,EAAE,CAAC;IACzB,KAAK,MAAM,GAAG,IAAI,YAAY,EAAE,CAAC;QAC/B,MAAM,SAAS,GAAG,GAAG,UAAU,GAAG,GAAG,EAAE,CAAC;QACxC,IAAI,YAAY,CAAC,WAAW,EAAE,SAAS,CAAC;YAAE,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;IAChE,CAAC;IACD,KAAK,MAAM,IAAI,IAAI,CAAC,OAAO,EAAE,YAAY,CAAC,EAAE,CAAC;QAC3C,MAAM,SAAS,GAAG,GAAG,UAAU,IAAI,IAAI,EAAE,CAAC;QAC1C,IAAI,YAAY,CAAC,WAAW,EAAE,SAAS,CAAC;YAAE,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;IAChE,CAAC;IACD,yEAAyE;IACzE,yEAAyE;IACzE,+BAA+B;IAC/B,KAAK,MAAM,GAAG,IAAI,YAAY;QAAE,GAAG,CAAC,IAAI,CAAC,GAAG,UAAU,GAAG,GAAG,EAAE,CAAC,CAAC;IAChE,GAAG,CAAC,IAAI,CAAC,GAAG,UAAU,IAAI,OAAO,EAAE,CAAC,CAAC;IACrC,GAAG,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;IACrB,OAAO,GAAG,CAAC;AACb,CAAC;AAED,SAAS,uBAAuB,CAAC,IAAgB,EAAE,WAAmB;IACpE,MAAM,MAAM,GAAG,IAAI,CAAC,YAAY,CAAC;IACjC,wEAAwE;IACxE,iEAAiE;IACjE,IAAI,CAAC,MAAM,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,UAAU,CAAC,GAAG,CAAC;QAAE,OAAO,EAAE,CAAC;IAElE,MAAM,cAAc,GAAG,IAAI,CAAC,KAAK;SAC9B,SAAS,CAAC,IAAI,CAAC,UAAU,CAAC;SAC1B,KAAK,CAAC,GAAG,CAAC;SACV,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IAChB,MAAM,QAAQ,GAAG,MAAM,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,GAAG,cAAc,EAAE,MAAM,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;IAExH,MAAM,IAAI,GAAG,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC;IAC5D,MAAM,GAAG,GAAa,EAAE,CAAC;IACzB,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;QACvB,MAAM,SAAS,GAAG,GAAG,QAAQ,GAAG,GAAG,EAAE,CAAC;QACtC,IAAI,YAAY,CAAC,WAAW,EAAE,SAAS,CAAC;YAAE,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QAC9D,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,qDAAqD;IAC5E,CAAC;IACD,KAAK,MAAM,SAAS,IAAI,CAAC,UAAU,EAAE,WAAW,EAAE,UAAU,EAAE,WAAW,EAAE,WAAW,EAAE,WAAW,CAAC,EAAE,CAAC;QACrG,MAAM,SAAS,GAAG,GAAG,QAAQ,IAAI,SAAS,EAAE,CAAC;QAC7C,IAAI,YAAY,CAAC,WAAW,EAAE,SAAS,CAAC;YAAE,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QAC9D,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;IACtB,CAAC;IACD,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;IACnB,OAAO,aAAa,CAAC,GAAG,CAAC,CAAC;AAC5B,CAAC;AAED,SAAS,gBAAgB,CAAC,MAA6B;IACrD,oEAAoE;IACpE,oEAAoE;IACpE,2DAA2D;IAC3D,MAAM,KAAK,GAAG,IAAI,GAAG,CAAS,CAAC,EAAE,CAAC,CAAC,CAAC;IACpC,KAAK,MAAM,GAAG,IAAI,MAAM,CAAC,aAAa,CAAC,OAAO,EAAE,CAAC;QAC/C,MAAM,UAAU,GAAG,IAAA,wBAAiB,EAAC,GAAG,CAAC,CAAC;QAC1C,IAAI,CAAC,UAAU;YAAE,SAAS;QAC1B,MAAM,KAAK,GAAG,UAAU,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;QACpC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACvC,MAAM,MAAM,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YAC3C,gCAAgC;YAChC,0DAA0D;YAC1D,sDAAsD;YACtD,2DAA2D;YAC3D,IAAI,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,IAAI,MAAM,KAAK,KAAK;gBAAE,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACrE,CAAC;QACD,mEAAmE;QACnE,KAAK,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;IACxB,CAAC;IACD,OAAO,CAAC,GAAG,KAAK,CAAC,CAAC,IAAI,EAAE,CAAC;AAC3B,CAAC;AAED,SAAS,YAAY,CAAC,WAAmB,EAAE,YAAoB;IAC7D,IAAI,CAAC;QACH,OAAO,EAAE,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,WAAW,EAAE,YAAY,CAAC,CAAC,CAAC;IAC7D,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,KAAK,CAAC;IACf,CAAC;AACH,CAAC;AAED,SAAS,aAAa,CAAC,MAAyB;IAC9C,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,MAAM,GAAG,GAAa,EAAE,CAAC;IACzB,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;QACvB,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;YAAE,SAAS;QAC1B,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACZ,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACd,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,+EAA+E;AAC/E,oBAAoB;AACpB,+EAA+E;AAE/E,MAAM,sBAAsB,GAAG,IAAI,GAAG,CAAyB;IAC7D,WAAW,EAAE,OAAO,EAAE,IAAI,EAAE,qBAAqB,EAAE,SAAS,EAAE,QAAQ,EAAE,gBAAgB,EAAE,aAAa;CACxG,CAAC,CAAC;AAEH,SAAS,cAAc,CAAC,KAAgC;IACtD,IAAI,KAAK,IAAI,sBAAsB,CAAC,GAAG,CAAC,KAA+B,CAAC,EAAE,CAAC;QACzE,OAAO,KAA+B,CAAC;IACzC,CAAC;IACD,OAAO,aAAa,CAAC;AACvB,CAAC;AAED;;;;;;;;GAQG;AACH,SAAgB,kBAAkB,CAChC,IAAgB,EAChB,WAAmB,EACnB,MAA6B;IAE7B,MAAM,UAAU,GAAG,qBAAqB,CAAC,IAAI,EAAE,WAAW,EAAE,MAAM,CAAC,CAAC;IACpE,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC;IAEzC,0EAA0E;IAC1E,sEAAsE;IACtE,iCAAiC;IACjC,MAAM,eAAe,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,aAAa,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAA,wBAAiB,EAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,OAAO,CAAa,CAAC,CAAC;IACzH,MAAM,mBAAmB,GAAG,MAAM,CAAC,aAAa,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAA,wBAAiB,EAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,OAAO,CAAa,CAAC;IAEtH,kEAAkE;IAClE,MAAM,eAAe,GAAG,CAAC,GAAG,MAAM,CAAC,mBAAmB,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QACpE,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM;YAAE,OAAO,CAAC,CAAC;QACpC,IAAI,CAAC,CAAC,MAAM,KAAK,WAAW;YAAE,OAAO,CAAC,CAAC,CAAC;QACxC,IAAI,CAAC,CAAC,MAAM,KAAK,WAAW;YAAE,OAAO,CAAC,CAAC;QACvC,OAAO,CAAC,CAAC;IACX,CAAC,CAAC,CAAC;IACH,KAAK,MAAM,QAAQ,IAAI,eAAe,EAAE,CAAC;QACvC,IAAI,QAAQ,CAAC,MAAM,KAAK,SAAS;YAAE,SAAS;QAC5C,MAAM,YAAY,GAAG,IAAA,wBAAiB,EAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;QACtD,IAAI,CAAC,YAAY;YAAE,SAAS;QAC5B,KAAK,MAAM,SAAS,IAAI,UAAU,EAAE,CAAC;YACnC,MAAM,UAAU,GAAG,IAAA,wBAAiB,EAAC,SAAS,CAAC,CAAC;YAChD,IAAI,CAAC,UAAU;gBAAE,SAAS;YAC1B,IAAI,UAAU,KAAK,YAAY,IAAI,UAAU,CAAC,UAAU,CAAC,GAAG,YAAY,GAAG,CAAC,EAAE,CAAC;gBAC7E,kEAAkE;gBAClE,uDAAuD;gBACvD,IAAI,eAAe,CAAC,GAAG,CAAC,UAAU,CAAC;oBAAE,SAAS;gBAC9C,IAAI,aAAa,CAAC,UAAU,EAAE,mBAAmB,CAAC,IAAI,QAAQ,CAAC,MAAM,KAAK,WAAW,EAAE,CAAC;oBACtF,SAAS;gBACX,CAAC;gBACD,OAAO;oBACL,UAAU,EAAE,IAAI,CAAC,UAAU;oBAC3B,UAAU,EAAE,IAAI,CAAC,UAAU;oBAC3B,YAAY,EAAE,IAAI,CAAC,YAAY;oBAC/B,kBAAkB,EAAE,UAAU;oBAC9B,gBAAgB,EAAE,YAAY;oBAC9B,YAAY,EAAE,cAAc,CAAC,QAAQ,CAAC,IAAI,CAAC;oBAC3C,MAAM,EAAE,QAAQ,CAAC,MAAM,KAAK,WAAW,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,iBAAiB;oBACzE,kBAAkB,EAAE,QAAQ,CAAC,MAAM,KAAK,WAAW,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,UAAU;oBAC7E,MAAM,EAAE,QAAQ,CAAC,MAAM,IAAI,uBAAuB,QAAQ,CAAC,IAAI,cAAc,QAAQ,CAAC,IAAI,IAAI;oBAC9F,QAAQ,EAAE,IAAI,CAAC,UAAU;oBACzB,QAAQ,EAAE,IAAI,CAAC,QAAQ;oBACvB,aAAa,EAAE,IAAI;oBACnB,YAAY,EAAE,IAAI;iBACnB,CAAC;YACJ,CAAC;QACH,CAAC;IACH,CAAC;IAED,0EAA0E;IAC1E,8BAA8B;IAC9B,KAAK,MAAM,SAAS,IAAI,UAAU,EAAE,CAAC;QACnC,MAAM,UAAU,GAAG,IAAA,wBAAiB,EAAC,SAAS,CAAC,CAAC;QAChD,IAAI,CAAC,UAAU;YAAE,SAAS;QAC1B,IAAI,eAAe,CAAC,GAAG,CAAC,UAAU,CAAC;YAAE,SAAS;QAC9C,IAAI,aAAa,CAAC,UAAU,EAAE,mBAAmB,CAAC;YAAE,SAAS;QAC7D,MAAM,cAAc,GAAG,IAAA,+CAAoB,EAAC,UAAU,CAAC,CAAC;QACxD,IAAI,cAAc,EAAE,QAAQ,KAAK,gBAAgB,EAAE,CAAC;YAClD,OAAO;gBACL,UAAU,EAAE,IAAI,CAAC,UAAU;gBAC3B,UAAU,EAAE,IAAI,CAAC,UAAU;gBAC3B,YAAY,EAAE,IAAI,CAAC,YAAY;gBAC/B,kBAAkB,EAAE,UAAU;gBAC9B,gBAAgB,EAAE,UAAU;gBAC5B,YAAY,EAAE,gBAAgB;gBAC9B,MAAM,EAAE,gBAAgB;gBACxB,kBAAkB,EAAE,UAAU;gBAC9B,MAAM,EAAE,uCAAuC,cAAc,CAAC,MAAM,0EAA0E;gBAC9I,QAAQ,EAAE,IAAI,CAAC,UAAU;gBACzB,QAAQ,EAAE,IAAI,CAAC,QAAQ;gBACvB,aAAa,EAAE,IAAI;gBACnB,YAAY,EAAE,IAAI;aACnB,CAAC;QACJ,CAAC;IACH,CAAC;IAED,OAAO,IAAI,CAAC;AACd,CAAC;AAED,SAAS,aAAa,CAAC,IAAY,EAAE,QAA2B;IAC9D,OAAO,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,KAAK,CAAC,IAAI,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;AAC7E,CAAC"}

package/dist/utils/import-edge-extractor.d.ts

@@ -0,0 +1,52 @@
+/**
+ * Deterministic import-edge extractor.
+ *
+ * Pure regex over source lines — no AST, no inference, no probability.
+ * Same input always produces the same output, in the same canonical order.
+ *
+ * Supported languages:
+ *   - Python: `import x.y.z`, `from x.y import z`, relative `from .foo import bar`
+ *   - TypeScript / JavaScript:
+ *       `import ... from "..."`
+ *       `import "..."` (side-effect)
+ *       `import("...")` (dynamic)
+ *       `require("...")` (CommonJS)
+ *
+ * The extractor is diff-aware: it consumes already-added source lines so we
+ * only flag imports introduced by the current diff. Pre-existing imports
+ * stay outside the governance frame.
+ */
+import type { DiffFile } from '@neurcode-ai/diff-parser';
+export type ImportLanguage = 'python' | 'typescript' | 'javascript';
+export type ImportEdgeKind = 'static' | 'relative' | 'dynamic' | 'require' | 'side-effect';
+export interface ImportEdge {
+    /** The diff file that contains the new import line. */
+    sourceFile: string;
+    /** 1-based line number within sourceFile, where deterministically known. */
+    sourceLine: number;
+    /** Verbatim text of the import-bearing line (trimmed). */
+    importStatement: string;
+    /**
+     * The raw import target as authored.
+     *   - Python: `x.y.z`, `.foo`, `..foo.bar`
+     *   - TS/JS: `./bar`, `../baz`, `@org/pkg/sub`, `node:fs`
+     */
+    importTarget: string;
+    importKind: ImportEdgeKind;
+    language: ImportLanguage;
+    /** Number of leading dots for Python relative imports; 0 otherwise. */
+    relativeLevel: number;
+}
+/**
+ * Extract import edges from the added lines of a diff. Deterministic and
+ * order-stable: identical diffs yield identical edge arrays.
+ */
+export declare function extractImportEdgesFromDiff(diffFiles: readonly DiffFile[]): ImportEdge[];
+/**
+ * Sort edges into a canonical, replay-stable order.
+ *
+ * Order: sourceFile → importTarget → sourceLine → importKind. Identical
+ * tuples are deduplicated.
+ */
+export declare function canonicalizeEdges(edges: readonly ImportEdge[]): ImportEdge[];
+//# sourceMappingURL=import-edge-extractor.d.ts.map

package/dist/utils/import-edge-extractor.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"import-edge-extractor.d.ts","sourceRoot":"","sources":["../../src/utils/import-edge-extractor.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;GAiBG;AAEH,OAAO,KAAK,EAAE,QAAQ,EAAY,MAAM,0BAA0B,CAAC;AAEnE,MAAM,MAAM,cAAc,GAAG,QAAQ,GAAG,YAAY,GAAG,YAAY,CAAC;AACpE,MAAM,MAAM,cAAc,GAAG,QAAQ,GAAG,UAAU,GAAG,SAAS,GAAG,SAAS,GAAG,aAAa,CAAC;AAE3F,MAAM,WAAW,UAAU;IACzB,uDAAuD;IACvD,UAAU,EAAE,MAAM,CAAC;IACnB,4EAA4E;IAC5E,UAAU,EAAE,MAAM,CAAC;IACnB,0DAA0D;IAC1D,eAAe,EAAE,MAAM,CAAC;IACxB;;;;OAIG;IACH,YAAY,EAAE,MAAM,CAAC;IACrB,UAAU,EAAE,cAAc,CAAC;IAC3B,QAAQ,EAAE,cAAc,CAAC;IACzB,uEAAuE;IACvE,aAAa,EAAE,MAAM,CAAC;CACvB;AAuKD;;;GAGG;AACH,wBAAgB,0BAA0B,CAAC,SAAS,EAAE,SAAS,QAAQ,EAAE,GAAG,UAAU,EAAE,CAavF;AAED;;;;;GAKG;AACH,wBAAgB,iBAAiB,CAAC,KAAK,EAAE,SAAS,UAAU,EAAE,GAAG,UAAU,EAAE,CAiB5E"}