audit-tools 0.50.13 → 0.50.15

package/dist/audit/orchestrator/fileAnchors.d.ts

@@ -1,69 +0,0 @@
-import type { ExternalAnalyzerResults, AnalyzerLeadProvenance } from "audit-tools/shared";
-import type { GraphBundle } from "audit-tools/shared";
-export type FileAnchorKind = "boundary" | "import" | "export" | "symbol" | "route" | "keyword" | "graph" | "analyzer_signal";
-export interface FileAnchor {
-    kind: FileAnchorKind;
-    name: string;
-    line?: number;
-    /**
-     * Approximate END line of a `symbol`-kind anchor's body (increment 2d,
-     * `path::symbol` slicing). Computed deterministically as the line before the
-     * next top-level declaration boundary (`symbol`/`route` start), clamped to the
-     * file's line count — a lightweight, language-neutral, brace-agnostic extent
-     * (no nesting awareness). Advisory ONLY: it seeds a targeted symbol-span read
-     * so a worker need not re-read a whole god-file, but the worker always
-     * fail-safes to reading more when evidence crosses the span. Present only on
-     * `symbol` anchors that have a `line`; absent everywhere else.
-     */
-    end_line?: number;
-    detail?: string;
-    /**
-     * Content-anchored lead identity (item C), present only on `analyzer_signal`
-     * anchors whose source signal carried one. Rendered into the packet prompt so
-     * the worker can copy it verbatim into `analyzer_provenance` on a finding
-     * born from this lead.
-     */
-    provenance?: AnalyzerLeadProvenance;
-}
-export interface FileAnchorSummary {
-    contract_version: "audit-code-file-anchors/v1alpha1";
-    path: string;
-    total_lines: number;
-    review_mode: "isolated_large_file";
-    scope_basis: string[];
-    anchors: FileAnchor[];
-    omitted_anchor_count: number;
-    counts: {
-        symbols: number;
-        routes: number;
-        keywords: number;
-        graph_edges: number;
-        analyzer_signals: number;
-    };
-}
-/**
- * Path-keyed index of external-analyzer signal anchors (rule/line/summary),
- * built ONCE per dispatch from the whole `externalAnalyzerResults` set so
- * per-task/per-file prompt rendering is an O(1) map read rather than an
- * O(tasks × files × total-results) re-flatten. Key = normalized lowercased
- * path; each bucket is pre-sorted by (line_start, id), matching the original
- * per-path ordering. See {@link analyzerSignalAnchorsForPath} for the reader.
- */
-export type AnalyzerSignalAnchorIndex = Map<string, FileAnchor[]>;
-export declare function buildAnalyzerSignalAnchorIndex(externalAnalyzerResults: ExternalAnalyzerResults[] | undefined): AnalyzerSignalAnchorIndex;
-/**
- * External-analyzer signal anchors (rule/line/summary) for one path — an O(1)
- * read of the pre-built {@link AnalyzerSignalAnchorIndex}. Split out of
- * {@link buildFileAnchorSummary} so packet-level prompt rendering (any
- * multi-file packet, not just isolated-large-file mode) can surface the same
- * grounded lead detail without paying for whole-file content scanning.
- */
-export declare function analyzerSignalAnchorsForPath(path: string, index: AnalyzerSignalAnchorIndex | undefined): FileAnchor[];
-export declare function buildFileAnchorSummary(params: {
-    path: string;
-    content: string;
-    totalLines: number;
-    graphBundle?: GraphBundle;
-    externalAnalyzerResults?: ExternalAnalyzerResults[];
-}): FileAnchorSummary;
-//# sourceMappingURL=fileAnchors.d.ts.map

package/dist/audit/orchestrator/fileAnchors.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"fileAnchors.d.ts","sourceRoot":"","sources":["../../../src/audit/orchestrator/fileAnchors.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,uBAAuB,EAAE,sBAAsB,EAAE,MAAM,oBAAoB,CAAC;AAC1F,OAAO,KAAK,EAAE,WAAW,EAAa,MAAM,oBAAoB,CAAC;AAGjE,MAAM,MAAM,cAAc,GACtB,UAAU,GACV,QAAQ,GACR,QAAQ,GACR,QAAQ,GACR,OAAO,GACP,SAAS,GACT,OAAO,GACP,iBAAiB,CAAC;AAEtB,MAAM,WAAW,UAAU;IACzB,IAAI,EAAE,cAAc,CAAC;IACrB,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,CAAC,EAAE,MAAM,CAAC;IACd;;;;;;;;;OASG;IACH,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB;;;;;OAKG;IACH,UAAU,CAAC,EAAE,sBAAsB,CAAC;CACrC;AAED,MAAM,WAAW,iBAAiB;IAChC,gBAAgB,EAAE,kCAAkC,CAAC;IACrD,IAAI,EAAE,MAAM,CAAC;IACb,WAAW,EAAE,MAAM,CAAC;IACpB,WAAW,EAAE,qBAAqB,CAAC;IACnC,WAAW,EAAE,MAAM,EAAE,CAAC;IACtB,OAAO,EAAE,UAAU,EAAE,CAAC;IACtB,oBAAoB,EAAE,MAAM,CAAC;IAC7B,MAAM,EAAE;QACN,OAAO,EAAE,MAAM,CAAC;QAChB,MAAM,EAAE,MAAM,CAAC;QACf,QAAQ,EAAE,MAAM,CAAC;QACjB,WAAW,EAAE,MAAM,CAAC;QACpB,gBAAgB,EAAE,MAAM,CAAC;KAC1B,CAAC;CACH;AAuGD;;;;;;;GAOG;AACH,MAAM,MAAM,yBAAyB,GAAG,GAAG,CAAC,MAAM,EAAE,UAAU,EAAE,CAAC,CAAC;AAElE,wBAAgB,8BAA8B,CAC5C,uBAAuB,EAAE,uBAAuB,EAAE,GAAG,SAAS,GAC7D,yBAAyB,CAkC3B;AAED;;;;;;GAMG;AACH,wBAAgB,4BAA4B,CAC1C,IAAI,EAAE,MAAM,EACZ,KAAK,EAAE,yBAAyB,GAAG,SAAS,GAC3C,UAAU,EAAE,CAEd;AAyHD,wBAAgB,sBAAsB,CAAC,MAAM,EAAE;IAC7C,IAAI,EAAE,MAAM,CAAC;IACb,OAAO,EAAE,MAAM,CAAC;IAChB,UAAU,EAAE,MAAM,CAAC;IACnB,WAAW,CAAC,EAAE,WAAW,CAAC;IAC1B,uBAAuB,CAAC,EAAE,uBAAuB,EAAE,CAAC;CACrD,GAAG,iBAAiB,CA8FpB"}

package/dist/audit/orchestrator/fileAnchors.js

@@ -1,314 +0,0 @@
-import { normalizeRepoRelPath, compareCodeUnits } from "audit-tools/shared";
-/**
- * Graph buckets in `graph_bundle.json` that carry file-to-file edges relevant to
- * large-file anchoring. Named here (rather than inlined as bare strings in the
- * collection loop) so the set of scanned buckets is a single typed source of
- * truth and each bucket key doubles as a typed fallback edge `kind`. `as const`
- * narrows the element type from `string` to the literal union.
- */
-const GRAPH_EDGE_BUCKETS = ["imports", "calls", "references"];
-const MAX_ANCHORS = 160;
-// Keywords that signal elevated-risk or review-worthy lines, grouped by concern:
-// auth/access:              auth, password, permission, role, secret, token
-// injection/execution:      deserialize, eval, exec, query, spawn, sql
-// crypto:                   decrypt, encrypt
-// concurrency/reliability:  cache, lock, race, retry, timeout, transaction
-// debt markers:             FIXME, TODO
-const KEYWORD_PATTERN = /\b(auth|password|permission|role|secret|token|deserialize|eval|exec|query|spawn|sql|decrypt|encrypt|cache|lock|race|retry|timeout|transaction|FIXME|TODO)\b/i;
-const SYMBOL_PATTERNS = [
-    {
-        kind: "import",
-        pattern: /^\s*import\s+(?:type\s+)?(?:[^"'()]*?\s+from\s+)?["']([^"']+)["']/,
-        label: "import",
-    },
-    {
-        kind: "symbol",
-        pattern: /^\s*(?:export\s+)?(?:async\s+)?function\s+([A-Za-z_$][\w$]*)\b/,
-        label: "function",
-    },
-    {
-        kind: "symbol",
-        pattern: /^\s*(?:export\s+)?class\s+([A-Za-z_$][\w$]*)\b/,
-        label: "class",
-    },
-    {
-        kind: "symbol",
-        pattern: /^\s*(?:export\s+)?interface\s+([A-Za-z_$][\w$]*)\b/,
-        label: "interface",
-    },
-    {
-        kind: "symbol",
-        pattern: /^\s*(?:export\s+)?type\s+([A-Za-z_$][\w$]*)\b/,
-        label: "type",
-    },
-    {
-        kind: "symbol",
-        pattern: /^\s*(?:export\s+)?(?:const|let|var)\s+([A-Za-z_$][\w$]*)\b/,
-        label: "binding",
-    },
-    {
-        kind: "export",
-        pattern: /^\s*export\s+(?:type\s+)?(?:[^"'()]*?\s+from\s+["']([^"']+)["']|(?:default\s+)?(?:async\s+)?(?:function|class|const|let|var|interface|type)\s+([A-Za-z_$][\w$-]*))/,
-        label: "export",
-    },
-    {
-        kind: "symbol",
-        pattern: /^\s*(?:export\s+)?def\s+([A-Za-z_][\w]*)\b/,
-        label: "function",
-    },
-    {
-        kind: "symbol",
-        pattern: /^\s*(?:export\s+)?func\s+(?:\([^)]+\)\s*)?([A-Za-z_][\w]*)\b/,
-        label: "function",
-    },
-    {
-        kind: "symbol",
-        pattern: /^\s*(?:pub\s+)?fn\s+([A-Za-z_][\w]*)\b/,
-        label: "function",
-    },
-    {
-        kind: "route",
-        pattern: /\b(?:app|router|server)\s*\.\s*(get|post|put|patch|delete|use)\s*\(/i,
-        label: "route",
-    },
-    {
-        kind: "route",
-        pattern: /^\s*@(?:Get|Post|Put|Patch|Delete|Route|Controller)\b/,
-        label: "route",
-    },
-];
-function truncate(value, maxLength) {
-    const normalized = value.replace(/\s+/g, " ").trim();
-    return normalized.length > maxLength
-        ? `${normalized.slice(0, maxLength - 3)}...`
-        : normalized;
-}
-function addAnchor(anchors, seen, anchor) {
-    const key = `${anchor.kind}\0${anchor.line ?? ""}\0${anchor.name}\0${anchor.detail ?? ""}`;
-    if (seen.has(key)) {
-        return;
-    }
-    seen.add(key);
-    anchors.push(anchor);
-}
-export function buildAnalyzerSignalAnchorIndex(externalAnalyzerResults) {
-    // Group raw signals by path first so the (line_start, id) sort — and thus the
-    // rendered order — is byte-identical to the pre-index per-path extraction.
-    const grouped = new Map();
-    for (const tool of externalAnalyzerResults ?? []) {
-        for (const result of tool.results ?? []) {
-            const key = normalizeRepoRelPath(result.path).toLowerCase();
-            const bucket = grouped.get(key);
-            if (bucket) {
-                bucket.push(result);
-            }
-            else {
-                grouped.set(key, [result]);
-            }
-        }
-    }
-    const index = new Map();
-    for (const [key, results] of grouped) {
-        results.sort((a, b) => (a.line_start ?? 0) - (b.line_start ?? 0) ||
-            compareCodeUnits(a.id, b.id));
-        index.set(key, results.map((signal) => ({
-            kind: "analyzer_signal",
-            name: truncate(signal.rule ?? signal.category, 80),
-            line: signal.line_start,
-            detail: truncate(signal.summary, 180),
-            ...(signal.provenance !== undefined ? { provenance: signal.provenance } : {}),
-        })));
-    }
-    return index;
-}
-/**
- * External-analyzer signal anchors (rule/line/summary) for one path — an O(1)
- * read of the pre-built {@link AnalyzerSignalAnchorIndex}. Split out of
- * {@link buildFileAnchorSummary} so packet-level prompt rendering (any
- * multi-file packet, not just isolated-large-file mode) can surface the same
- * grounded lead detail without paying for whole-file content scanning.
- */
-export function analyzerSignalAnchorsForPath(path, index) {
-    return index?.get(normalizeRepoRelPath(path).toLowerCase()) ?? [];
-}
-function collectGraphEdges(graphBundle, path) {
-    if (!graphBundle?.graphs) {
-        return [];
-    }
-    const normalizedPath = normalizeRepoRelPath(path).toLowerCase();
-    const edges = [];
-    // Typed as `string` (not the literal union) so the lookup resolves through the
-    // `[key: string]: unknown` index signature on `graphs` — the loop body then
-    // re-validates each entry's shape, matching the original deterministic parse.
-    for (const bucket of GRAPH_EDGE_BUCKETS) {
-        const raw = graphBundle.graphs[bucket];
-        if (!Array.isArray(raw)) {
-            continue;
-        }
-        for (const item of raw) {
-            const record = item;
-            if (item &&
-                typeof item === "object" &&
-                !Array.isArray(item) &&
-                typeof record.from === "string" &&
-                typeof record.to === "string") {
-                const from = normalizeRepoRelPath(record.from).toLowerCase();
-                const to = normalizeRepoRelPath(record.to).toLowerCase();
-                if (from === normalizedPath || to === normalizedPath) {
-                    edges.push({
-                        from: record.from,
-                        to: record.to,
-                        kind: typeof record.kind === "string" ? record.kind : bucket,
-                    });
-                }
-            }
-        }
-    }
-    return edges.sort((a, b) => compareCodeUnits(a.kind ?? "", b.kind ?? "") ||
-        compareCodeUnits(a.from, b.from) ||
-        compareCodeUnits(a.to, b.to));
-}
-/**
- * Assigns an approximate `end_line` span to each TOP-LEVEL `symbol`-kind anchor
- * (increment 2d, `path::symbol` slicing). A top-level declaration's body runs
- * from its line to the line before the NEXT top-level declaration, or to the
- * file end for the last one. Only top-level (zero-indentation) declarations are
- * boundaries and slice targets — a NESTED binding (an indented `const`/`let`
- * the flat regex scanner also matches as a `symbol`) must NOT fragment the
- * enclosing function/class span, and is not itself a useful slice, so it gets no
- * span. `topLevelDeclLines` is the ascending set of zero-indent symbol/route
- * declaration lines gathered during the content scan.
- *
- * This is a deterministic, content-derived, brace-agnostic heuristic (no nesting
- * awareness) — advisory guidance the worker fail-safes past, never a hard read
- * boundary. Mutates the anchors in place; must run on the fully line-sorted list
- * BEFORE the MAX_ANCHORS cap so a surviving anchor's span is independent of the
- * cap.
- */
-function assignSymbolSpans(sorted, totalLines, topLevelDeclLines) {
-    const topLevelSet = new Set(topLevelDeclLines);
-    // Ascending — a linear scan finds the first boundary strictly after a line.
-    const boundaries = [...topLevelDeclLines].sort((a, b) => a - b);
-    for (const anchor of sorted) {
-        if (anchor.kind !== "symbol" || !anchor.line || !topLevelSet.has(anchor.line)) {
-            continue;
-        }
-        const nextBoundary = boundaries.find((line) => line > anchor.line);
-        const end = nextBoundary !== undefined ? nextBoundary - 1 : totalLines;
-        anchor.end_line = Math.max(anchor.line, Math.min(end, totalLines));
-    }
-}
-function scanSymbol(line, lineNumber, anchors, seen) {
-    for (const { kind, pattern, label } of SYMBOL_PATTERNS) {
-        const match = line.match(pattern);
-        if (!match) {
-            continue;
-        }
-        const name = match.slice(1).find((value) => value && value.trim().length > 0) ?? label;
-        addAnchor(anchors, seen, {
-            kind,
-            name: truncate(name, 80),
-            line: lineNumber,
-            detail: truncate(`${label}: ${line}`, 180),
-        });
-        return kind;
-    }
-    return null;
-}
-function scanKeyword(line, lineNumber, anchors, seen) {
-    if (!KEYWORD_PATTERN.test(line)) {
-        return false;
-    }
-    addAnchor(anchors, seen, {
-        kind: "keyword",
-        name: truncate(line.match(KEYWORD_PATTERN)?.[1] ?? "keyword", 80),
-        line: lineNumber,
-        detail: truncate(line, 180),
-    });
-    return true;
-}
-export function buildFileAnchorSummary(params) {
-    const anchors = [];
-    const seen = new Set();
-    const path = normalizeRepoRelPath(params.path);
-    const lines = params.content.split(/\r?\n/);
-    let symbolCount = 0;
-    let routeCount = 0;
-    let keywordCount = 0;
-    // Zero-indent symbol/route declaration lines — the top-level boundaries that
-    // bound per-symbol slice spans (see assignSymbolSpans). A nested (indented)
-    // binding the flat scanner also matches is deliberately excluded so it neither
-    // fragments an enclosing span nor becomes a spurious slice target.
-    const topLevelDeclLines = [];
-    addAnchor(anchors, seen, {
-        kind: "boundary",
-        name: "file_start",
-        line: 1,
-        detail: "Start of isolated large-file review boundary.",
-    });
-    if (params.totalLines > 1) {
-        addAnchor(anchors, seen, {
-            kind: "boundary",
-            name: "file_end",
-            line: params.totalLines,
-            detail: "End of isolated large-file review boundary.",
-        });
-    }
-    lines.forEach((line, index) => {
-        const lineNumber = index + 1;
-        const symbolKind = scanSymbol(line, lineNumber, anchors, seen);
-        if (symbolKind === "route")
-            routeCount += 1;
-        else if (symbolKind === "symbol")
-            symbolCount += 1;
-        // A zero-indent symbol/route declaration is a top-level slice boundary.
-        if ((symbolKind === "symbol" || symbolKind === "route") && /^\S/.test(line)) {
-            topLevelDeclLines.push(lineNumber);
-        }
-        if (scanKeyword(line, lineNumber, anchors, seen))
-            keywordCount += 1;
-    });
-    const graphEdges = collectGraphEdges(params.graphBundle, path);
-    for (const edge of graphEdges) {
-        addAnchor(anchors, seen, {
-            kind: "graph",
-            name: edge.kind ?? "edge",
-            detail: normalizeRepoRelPath(edge.from).toLowerCase() === path.toLowerCase()
-                ? `outbound: ${edge.to}`
-                : `inbound: ${edge.from}`,
-        });
-    }
-    const analyzerSignals = analyzerSignalAnchorsForPath(path, buildAnalyzerSignalAnchorIndex(params.externalAnalyzerResults));
-    for (const signal of analyzerSignals) {
-        addAnchor(anchors, seen, signal);
-    }
-    const sorted = anchors.sort((a, b) => (a.line ?? Number.MAX_SAFE_INTEGER) - (b.line ?? Number.MAX_SAFE_INTEGER) ||
-        compareCodeUnits(a.kind, b.kind) ||
-        compareCodeUnits(a.name, b.name));
-    // Seed per-symbol spans on the full sorted list (before the cap) so a
-    // surviving anchor's span never depends on which anchors the cap dropped.
-    assignSymbolSpans(sorted, params.totalLines, topLevelDeclLines);
-    const boundedAnchors = sorted.slice(0, MAX_ANCHORS);
-    return {
-        contract_version: "audit-code-file-anchors/v1alpha1",
-        path,
-        total_lines: params.totalLines,
-        review_mode: "isolated_large_file",
-        scope_basis: [
-            "single assigned file",
-            "single review packet",
-            "mechanically extracted symbols, routes, graph edges, keywords, and analyzer signals",
-            "host-owned bound result artifact",
-        ],
-        anchors: boundedAnchors,
-        omitted_anchor_count: Math.max(0, sorted.length - boundedAnchors.length),
-        counts: {
-            symbols: symbolCount,
-            routes: routeCount,
-            keywords: keywordCount,
-            graph_edges: graphEdges.length,
-            analyzer_signals: analyzerSignals.length,
-        },
-    };
-}
-//# sourceMappingURL=fileAnchors.js.map

package/dist/audit/orchestrator/fileAnchors.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"fileAnchors.js","sourceRoot":"","sources":["../../../src/audit/orchestrator/fileAnchors.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,oBAAoB,EAAE,gBAAgB,EAAE,MAAM,oBAAoB,CAAC;AAsD5E;;;;;;GAMG;AACH,MAAM,kBAAkB,GAAG,CAAC,SAAS,EAAE,OAAO,EAAE,YAAY,CAAU,CAAC;AAEvE,MAAM,WAAW,GAAG,GAAG,CAAC;AACxB,iFAAiF;AACjF,4EAA4E;AAC5E,uEAAuE;AACvE,6CAA6C;AAC7C,2EAA2E;AAC3E,wCAAwC;AACxC,MAAM,eAAe,GACnB,8JAA8J,CAAC;AACjK,MAAM,eAAe,GAAoE;IACvF;QACE,IAAI,EAAE,QAAQ;QACd,OAAO,EAAE,mEAAmE;QAC5E,KAAK,EAAE,QAAQ;KAChB;IACD;QACE,IAAI,EAAE,QAAQ;QACd,OAAO,EAAE,gEAAgE;QACzE,KAAK,EAAE,UAAU;KAClB;IACD;QACE,IAAI,EAAE,QAAQ;QACd,OAAO,EAAE,gDAAgD;QACzD,KAAK,EAAE,OAAO;KACf;IACD;QACE,IAAI,EAAE,QAAQ;QACd,OAAO,EAAE,oDAAoD;QAC7D,KAAK,EAAE,WAAW;KACnB;IACD;QACE,IAAI,EAAE,QAAQ;QACd,OAAO,EAAE,+CAA+C;QACxD,KAAK,EAAE,MAAM;KACd;IACD;QACE,IAAI,EAAE,QAAQ;QACd,OAAO,EAAE,4DAA4D;QACrE,KAAK,EAAE,SAAS;KACjB;IACD;QACE,IAAI,EAAE,QAAQ;QACd,OAAO,EAAE,oKAAoK;QAC7K,KAAK,EAAE,QAAQ;KAChB;IACD;QACE,IAAI,EAAE,QAAQ;QACd,OAAO,EAAE,4CAA4C;QACrD,KAAK,EAAE,UAAU;KAClB;IACD;QACE,IAAI,EAAE,QAAQ;QACd,OAAO,EAAE,8DAA8D;QACvE,KAAK,EAAE,UAAU;KAClB;IACD;QACE,IAAI,EAAE,QAAQ;QACd,OAAO,EAAE,wCAAwC;QACjD,KAAK,EAAE,UAAU;KAClB;IACD;QACE,IAAI,EAAE,OAAO;QACb,OAAO,EAAE,sEAAsE;QAC/E,KAAK,EAAE,OAAO;KACf;IACD;QACE,IAAI,EAAE,OAAO;QACb,OAAO,EAAE,uDAAuD;QAChE,KAAK,EAAE,OAAO;KACf;CACF,CAAC;AAEF,SAAS,QAAQ,CAAC,KAAa,EAAE,SAAiB;IAChD,MAAM,UAAU,GAAG,KAAK,CAAC,OAAO,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC;IACrD,OAAO,UAAU,CAAC,MAAM,GAAG,SAAS;QAClC,CAAC,CAAC,GAAG,UAAU,CAAC,KAAK,CAAC,CAAC,EAAE,SAAS,GAAG,CAAC,CAAC,KAAK;QAC5C,CAAC,CAAC,UAAU,CAAC;AACjB,CAAC;AAED,SAAS,SAAS,CAChB,OAAqB,EACrB,IAAiB,EACjB,MAAkB;IAElB,MAAM,GAAG,GAAG,GAAG,MAAM,CAAC,IAAI,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,KAAK,MAAM,CAAC,IAAI,KAAK,MAAM,CAAC,MAAM,IAAI,EAAE,EAAE,CAAC;IAC3F,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;QAClB,OAAO;IACT,CAAC;IACD,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IACd,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;AACvB,CAAC;AAYD,MAAM,UAAU,8BAA8B,CAC5C,uBAA8D;IAE9D,8EAA8E;IAC9E,2EAA2E;IAC3E,MAAM,OAAO,GAAG,IAAI,GAAG,EAA8C,CAAC;IACtE,KAAK,MAAM,IAAI,IAAI,uBAAuB,IAAI,EAAE,EAAE,CAAC;QACjD,KAAK,MAAM,MAAM,IAAI,IAAI,CAAC,OAAO,IAAI,EAAE,EAAE,CAAC;YACxC,MAAM,GAAG,GAAG,oBAAoB,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,WAAW,EAAE,CAAC;YAC5D,MAAM,MAAM,GAAG,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YAChC,IAAI,MAAM,EAAE,CAAC;gBACX,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YACtB,CAAC;iBAAM,CAAC;gBACN,OAAO,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC;YAC7B,CAAC;QACH,CAAC;IACH,CAAC;IACD,MAAM,KAAK,GAA8B,IAAI,GAAG,EAAE,CAAC;IACnD,KAAK,MAAM,CAAC,GAAG,EAAE,OAAO,CAAC,IAAI,OAAO,EAAE,CAAC;QACrC,OAAO,CAAC,IAAI,CACV,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CACP,CAAC,CAAC,CAAC,UAAU,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,UAAU,IAAI,CAAC,CAAC;YACzC,gBAAgB,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,CAC/B,CAAC;QACF,KAAK,CAAC,GAAG,CACP,GAAG,EACH,OAAO,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC;YACvB,IAAI,EAAE,iBAA0B;YAChC,IAAI,EAAE,QAAQ,CAAC,MAAM,CAAC,IAAI,IAAI,MAAM,CAAC,QAAQ,EAAE,EAAE,CAAC;YAClD,IAAI,EAAE,MAAM,CAAC,UAAU;YACvB,MAAM,EAAE,QAAQ,CAAC,MAAM,CAAC,OAAO,EAAE,GAAG,CAAC;YACrC,GAAG,CAAC,MAAM,CAAC,UAAU,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,UAAU,EAAE,MAAM,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;SAC9E,CAAC,CAAC,CACJ,CAAC;IACJ,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,4BAA4B,CAC1C,IAAY,EACZ,KAA4C;IAE5C,OAAO,KAAK,EAAE,GAAG,CAAC,oBAAoB,CAAC,IAAI,CAAC,CAAC,WAAW,EAAE,CAAC,IAAI,EAAE,CAAC;AACpE,CAAC;AAED,SAAS,iBAAiB,CAAC,WAAoC,EAAE,IAAY;IAC3E,IAAI,CAAC,WAAW,EAAE,MAAM,EAAE,CAAC;QACzB,OAAO,EAAE,CAAC;IACZ,CAAC;IACD,MAAM,cAAc,GAAG,oBAAoB,CAAC,IAAI,CAAC,CAAC,WAAW,EAAE,CAAC;IAChE,MAAM,KAAK,GAAgB,EAAE,CAAC;IAC9B,+EAA+E;IAC/E,4EAA4E;IAC5E,8EAA8E;IAC9E,KAAK,MAAM,MAAM,IAAI,kBAAuC,EAAE,CAAC;QAC7D,MAAM,GAAG,GAAG,WAAW,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QACvC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC;YACxB,SAAS;QACX,CAAC;QACD,KAAK,MAAM,IAAI,IAAI,GAAG,EAAE,CAAC;YACvB,MAAM,MAAM,GAAG,IAA+B,CAAC;YAC/C,IACE,IAAI;gBACJ,OAAO,IAAI,KAAK,QAAQ;gBACxB,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC;gBACpB,OAAO,MAAM,CAAC,IAAI,KAAK,QAAQ;gBAC/B,OAAO,MAAM,CAAC,EAAE,KAAK,QAAQ,EAC7B,CAAC;gBACD,MAAM,IAAI,GAAG,oBAAoB,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,WAAW,EAAE,CAAC;gBAC7D,MAAM,EAAE,GAAG,oBAAoB,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,WAAW,EAAE,CAAC;gBACzD,IAAI,IAAI,KAAK,cAAc,IAAI,EAAE,KAAK,cAAc,EAAE,CAAC;oBACrD,KAAK,CAAC,IAAI,CAAC;wBACT,IAAI,EAAE,MAAM,CAAC,IAAI;wBACjB,EAAE,EAAE,MAAM,CAAC,EAAE;wBACb,IAAI,EAAE,OAAO,MAAM,CAAC,IAAI,KAAK,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM;qBAC7D,CAAC,CAAC;gBACL,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IACD,OAAO,KAAK,CAAC,IAAI,CACf,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CACP,gBAAgB,CAAC,CAAC,CAAC,IAAI,IAAI,EAAE,EAAE,CAAC,CAAC,IAAI,IAAI,EAAE,CAAC;QAC5C,gBAAgB,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC;QAChC,gBAAgB,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,CAC/B,CAAC;AACJ,CAAC;AAED;;;;;;;;;;;;;;;;GAgBG;AACH,SAAS,iBAAiB,CACxB,MAAoB,EACpB,UAAkB,EAClB,iBAA2B;IAE3B,MAAM,WAAW,GAAG,IAAI,GAAG,CAAC,iBAAiB,CAAC,CAAC;IAC/C,4EAA4E;IAC5E,MAAM,UAAU,GAAG,CAAC,GAAG,iBAAiB,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAChE,KAAK,MAAM,MAAM,IAAI,MAAM,EAAE,CAAC;QAC5B,IAAI,MAAM,CAAC,IAAI,KAAK,QAAQ,IAAI,CAAC,MAAM,CAAC,IAAI,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC;YAC9E,SAAS;QACX,CAAC;QACD,MAAM,YAAY,GAAG,UAAU,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,GAAG,MAAM,CAAC,IAAK,CAAC,CAAC;QACpE,MAAM,GAAG,GAAG,YAAY,KAAK,SAAS,CAAC,CAAC,CAAC,YAAY,GAAG,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC;QACvE,MAAM,CAAC,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,UAAU,CAAC,CAAC,CAAC;IACrE,CAAC;AACH,CAAC;AAED,SAAS,UAAU,CACjB,IAAY,EACZ,UAAkB,EAClB,OAAqB,EACrB,IAAiB;IAEjB,KAAK,MAAM,EAAE,IAAI,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,eAAe,EAAE,CAAC;QACvD,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;QAClC,IAAI,CAAC,KAAK,EAAE,CAAC;YACX,SAAS;QACX,CAAC;QACD,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,IAAI,KAAK,CAAC,IAAI,EAAE,CAAC,MAAM,GAAG,CAAC,CAAC,IAAI,KAAK,CAAC;QACvF,SAAS,CAAC,OAAO,EAAE,IAAI,EAAE;YACvB,IAAI;YACJ,IAAI,EAAE,QAAQ,CAAC,IAAI,EAAE,EAAE,CAAC;YACxB,IAAI,EAAE,UAAU;YAChB,MAAM,EAAE,QAAQ,CAAC,GAAG,KAAK,KAAK,IAAI,EAAE,EAAE,GAAG,CAAC;SAC3C,CAAC,CAAC;QACH,OAAO,IAAI,CAAC;IACd,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,SAAS,WAAW,CAClB,IAAY,EACZ,UAAkB,EAClB,OAAqB,EACrB,IAAiB;IAEjB,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;QAChC,OAAO,KAAK,CAAC;IACf,CAAC;IACD,SAAS,CAAC,OAAO,EAAE,IAAI,EAAE;QACvB,IAAI,EAAE,SAAS;QACf,IAAI,EAAE,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,eAAe,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,SAAS,EAAE,EAAE,CAAC;QACjE,IAAI,EAAE,UAAU;QAChB,MAAM,EAAE,QAAQ,CAAC,IAAI,EAAE,GAAG,CAAC;KAC5B,CAAC,CAAC;IACH,OAAO,IAAI,CAAC;AACd,CAAC;AAED,MAAM,UAAU,sBAAsB,CAAC,MAMtC;IACC,MAAM,OAAO,GAAiB,EAAE,CAAC;IACjC,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,MAAM,IAAI,GAAG,oBAAoB,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IAC/C,MAAM,KAAK,GAAG,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;IAC5C,IAAI,WAAW,GAAG,CAAC,CAAC;IACpB,IAAI,UAAU,GAAG,CAAC,CAAC;IACnB,IAAI,YAAY,GAAG,CAAC,CAAC;IACrB,6EAA6E;IAC7E,4EAA4E;IAC5E,+EAA+E;IAC/E,mEAAmE;IACnE,MAAM,iBAAiB,GAAa,EAAE,CAAC;IAEvC,SAAS,CAAC,OAAO,EAAE,IAAI,EAAE;QACvB,IAAI,EAAE,UAAU;QAChB,IAAI,EAAE,YAAY;QAClB,IAAI,EAAE,CAAC;QACP,MAAM,EAAE,+CAA+C;KACxD,CAAC,CAAC;IAEH,IAAI,MAAM,CAAC,UAAU,GAAG,CAAC,EAAE,CAAC;QAC1B,SAAS,CAAC,OAAO,EAAE,IAAI,EAAE;YACvB,IAAI,EAAE,UAAU;YAChB,IAAI,EAAE,UAAU;YAChB,IAAI,EAAE,MAAM,CAAC,UAAU;YACvB,MAAM,EAAE,6CAA6C;SACtD,CAAC,CAAC;IACL,CAAC;IAED,KAAK,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE;QAC5B,MAAM,UAAU,GAAG,KAAK,GAAG,CAAC,CAAC;QAC7B,MAAM,UAAU,GAAG,UAAU,CAAC,IAAI,EAAE,UAAU,EAAE,OAAO,EAAE,IAAI,CAAC,CAAC;QAC/D,IAAI,UAAU,KAAK,OAAO;YAAE,UAAU,IAAI,CAAC,CAAC;aACvC,IAAI,UAAU,KAAK,QAAQ;YAAE,WAAW,IAAI,CAAC,CAAC;QACnD,wEAAwE;QACxE,IAAI,CAAC,UAAU,KAAK,QAAQ,IAAI,UAAU,KAAK,OAAO,CAAC,IAAI,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;YAC5E,iBAAiB,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QACrC,CAAC;QACD,IAAI,WAAW,CAAC,IAAI,EAAE,UAAU,EAAE,OAAO,EAAE,IAAI,CAAC;YAAE,YAAY,IAAI,CAAC,CAAC;IACtE,CAAC,CAAC,CAAC;IAEH,MAAM,UAAU,GAAG,iBAAiB,CAAC,MAAM,CAAC,WAAW,EAAE,IAAI,CAAC,CAAC;IAC/D,KAAK,MAAM,IAAI,IAAI,UAAU,EAAE,CAAC;QAC9B,SAAS,CAAC,OAAO,EAAE,IAAI,EAAE;YACvB,IAAI,EAAE,OAAO;YACb,IAAI,EAAE,IAAI,CAAC,IAAI,IAAI,MAAM;YACzB,MAAM,EACJ,oBAAoB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,WAAW,EAAE,KAAK,IAAI,CAAC,WAAW,EAAE;gBAClE,CAAC,CAAC,aAAa,IAAI,CAAC,EAAE,EAAE;gBACxB,CAAC,CAAC,YAAY,IAAI,CAAC,IAAI,EAAE;SAC9B,CAAC,CAAC;IACL,CAAC;IAED,MAAM,eAAe,GAAG,4BAA4B,CAClD,IAAI,EACJ,8BAA8B,CAAC,MAAM,CAAC,uBAAuB,CAAC,CAC/D,CAAC;IACF,KAAK,MAAM,MAAM,IAAI,eAAe,EAAE,CAAC;QACrC,SAAS,CAAC,OAAO,EAAE,IAAI,EAAE,MAAM,CAAC,CAAC;IACnC,CAAC;IAED,MAAM,MAAM,GAAG,OAAO,CAAC,IAAI,CACzB,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CACP,CAAC,CAAC,CAAC,IAAI,IAAI,MAAM,CAAC,gBAAgB,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,IAAI,MAAM,CAAC,gBAAgB,CAAC;QACzE,gBAAgB,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC;QAChC,gBAAgB,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CACnC,CAAC;IACF,sEAAsE;IACtE,0EAA0E;IAC1E,iBAAiB,CAAC,MAAM,EAAE,MAAM,CAAC,UAAU,EAAE,iBAAiB,CAAC,CAAC;IAChE,MAAM,cAAc,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,WAAW,CAAC,CAAC;IAEpD,OAAO;QACL,gBAAgB,EAAE,kCAAkC;QACpD,IAAI;QACJ,WAAW,EAAE,MAAM,CAAC,UAAU;QAC9B,WAAW,EAAE,qBAAqB;QAClC,WAAW,EAAE;YACX,sBAAsB;YACtB,sBAAsB;YACtB,qFAAqF;YACrF,kCAAkC;SACnC;QACD,OAAO,EAAE,cAAc;QACvB,oBAAoB,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,MAAM,GAAG,cAAc,CAAC,MAAM,CAAC;QACxE,MAAM,EAAE;YACN,OAAO,EAAE,WAAW;YACpB,MAAM,EAAE,UAAU;YAClB,QAAQ,EAAE,YAAY;YACtB,WAAW,EAAE,UAAU,CAAC,MAAM;YAC9B,gBAAgB,EAAE,eAAe,CAAC,MAAM;SACzC;KACF,CAAC;AACJ,CAAC"}

package/dist/audit/orchestrator/knipGraphCrosscheck.d.ts

@@ -1,65 +0,0 @@
-import type { GraphBundle, SurfaceManifest, CriticalFlowManifest } from "audit-tools/shared";
-/**
- * Render-time knip↔graph cross-check tag for a single knip "unused export" lead.
- *
- * - `LIKELY-DEAD`   — the lead file has normalized in-degree 0, is NOT a known
- *                     entrypoint, AND its own language analyzer actually ran
- *                     (present in `graph_bundle.analyzers_used`). Only then is a
- *                     zero-in-degree verdict trustworthy for this file.
- * - `HAS-IMPORTERS` — the lead file has normalized in-degree > 0 (something
- *                     imports it) → refutes "dead".
- * - `ENTRYPOINT`    — in-degree 0 but the file is a surface/critical-flow
- *                     entrypoint → reachable by definition, not dead.
- * - `UNVERIFIED`    — `analyzers_used` is empty OR the lead's language analyzer
- *                     is absent from it → per-file graph fidelity is unknown, so
- *                     the graph cannot confirm or refute deadness.
- */
-export type KnipGraphTag = "LIKELY-DEAD" | "HAS-IMPORTERS" | "UNVERIFIED" | "ENTRYPOINT";
-/**
- * A pre-derived, normalized index over one {@link GraphBundle} +
- * surface/critical-flow entrypoints, ready for O(1) lookups per lead.
- *
- * CE-001: `deriveGraphSignals` keys fanIn by the RAW `edge.to`, so a
- * Windows-backslash / mixed-case graph node id (`src\\Foo.ts`) never matches a
- * POSIX-normalized knip lead path (`src/Foo.ts`). This index re-keys EVERY node
- * (both `from` and `to` endpoints) and every entrypoint through
- * `normalizeNodeKey` (POSIX separators, `./` stripped, lower-cased) so the lead
- * path — normalized the same way — matches regardless of separator or case.
- */
-export interface KnipGraphIndex {
-    /** Normalized node id → incoming edge count over the structural edge set. */
-    inDegree: Map<string, number>;
-    /** Normalized entrypoint paths from surface_manifest + critical_flows. */
-    entrypoints: Set<string>;
-    /** Analyzer ids that actually ran (from graph_bundle.analyzers_used). */
-    analyzersUsed: Set<string>;
-}
-/**
- * Normalize a graph node id / path / entrypoint to one comparable key:
- * backslashes → forward slashes, leading `./` stripped, lower-cased. Single
- * source so the index and every lookup key agree (CE-001).
- */
-export declare function normalizeNodeKey(path: string): string;
-/**
- * Map a lead file's extension to the id of the language analyzer that owns it
- * (CE-003). Reuses the analyzer registry's own `supports(file)` predicate
- * so extension→analyzer stays single-sourced in the analyzers, not duplicated.
- * Returns null when no registered analyzer claims the file.
- */
-export declare function analyzerIdForFile(path: string): string | null;
-/**
- * Build the normalized cross-check index from the three artifacts. Degrades to
- * empty (never throws) on any missing/malformed input — an absent bundle yields
- * an empty index whose every lead classifies UNVERIFIED.
- */
-export declare function buildKnipGraphIndex(params: {
-    graphBundle?: GraphBundle;
-    surfaceManifest?: SurfaceManifest;
-    criticalFlows?: CriticalFlowManifest;
-}): KnipGraphIndex;
-/**
- * Classify one knip lead path against the pre-built index. Pure: no IO, no
- * mutation. See {@link KnipGraphTag} for the decision table.
- */
-export declare function classifyKnipLead(leadPath: string, index: KnipGraphIndex): KnipGraphTag;
-//# sourceMappingURL=knipGraphCrosscheck.d.ts.map

package/dist/audit/orchestrator/knipGraphCrosscheck.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"knipGraphCrosscheck.d.ts","sourceRoot":"","sources":["../../../src/audit/orchestrator/knipGraphCrosscheck.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EACV,WAAW,EACX,eAAe,EACf,oBAAoB,EACrB,MAAM,oBAAoB,CAAC;AAI5B;;;;;;;;;;;;;;GAcG;AACH,MAAM,MAAM,YAAY,GACpB,aAAa,GACb,eAAe,GACf,YAAY,GACZ,YAAY,CAAC;AAEjB;;;;;;;;;;GAUG;AACH,MAAM,WAAW,cAAc;IAC7B,6EAA6E;IAC7E,QAAQ,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAC9B,0EAA0E;IAC1E,WAAW,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;IACzB,yEAAyE;IACzE,aAAa,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;CAC5B;AAED;;;;GAIG;AACH,wBAAgB,gBAAgB,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,CAErD;AAED;;;;;GAKG;AACH,wBAAgB,iBAAiB,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,GAAG,IAAI,CAK7D;AAED;;;;GAIG;AACH,wBAAgB,mBAAmB,CAAC,MAAM,EAAE;IAC1C,WAAW,CAAC,EAAE,WAAW,CAAC;IAC1B,eAAe,CAAC,EAAE,eAAe,CAAC;IAClC,aAAa,CAAC,EAAE,oBAAoB,CAAC;CACtC,GAAG,cAAc,CAoCjB;AAED;;;GAGG;AACH,wBAAgB,gBAAgB,CAC9B,QAAQ,EAAE,MAAM,EAChB,KAAK,EAAE,cAAc,GACpB,YAAY,CAkBd"}

package/dist/audit/orchestrator/knipGraphCrosscheck.js

@@ -1,85 +0,0 @@
-import { allGraphEdges } from "../extractors/graphSignals.js";
-import { ANALYZER_REGISTRY } from "../extractors/analyzers/registry.js";
-/**
- * Normalize a graph node id / path / entrypoint to one comparable key:
- * backslashes → forward slashes, leading `./` stripped, lower-cased. Single
- * source so the index and every lookup key agree (CE-001).
- */
-export function normalizeNodeKey(path) {
-    return path.replace(/\\/g, "/").replace(/^\.\//, "").toLowerCase();
-}
-/**
- * Map a lead file's extension to the id of the language analyzer that owns it
- * (CE-003). Reuses the analyzer registry's own `supports(file)` predicate
- * so extension→analyzer stays single-sourced in the analyzers, not duplicated.
- * Returns null when no registered analyzer claims the file.
- */
-export function analyzerIdForFile(path) {
-    for (const analyzer of ANALYZER_REGISTRY) {
-        if (analyzer.supports(path))
-            return analyzer.id;
-    }
-    return null;
-}
-/**
- * Build the normalized cross-check index from the three artifacts. Degrades to
- * empty (never throws) on any missing/malformed input — an absent bundle yields
- * an empty index whose every lead classifies UNVERIFIED.
- */
-export function buildKnipGraphIndex(params) {
-    const inDegree = new Map();
-    const entrypoints = new Set();
-    const analyzersUsed = new Set();
-    const { graphBundle, surfaceManifest, criticalFlows } = params;
-    if (graphBundle?.graphs) {
-        for (const edge of allGraphEdges(graphBundle)) {
-            const to = normalizeNodeKey(edge.to);
-            inDegree.set(to, (inDegree.get(to) ?? 0) + 1);
-            // Ensure `from`-only nodes are still known (in-degree 0), so a lead that
-            // appears only as an edge source is treated as present-but-uncited, not
-            // absent. Lookups default missing keys to 0 anyway; recording the source
-            // node keeps the index a faithful node set.
-            const from = normalizeNodeKey(edge.from);
-            if (!inDegree.has(from))
-                inDegree.set(from, 0);
-        }
-    }
-    for (const surface of surfaceManifest?.surfaces ?? []) {
-        if (typeof surface.entrypoint === "string") {
-            entrypoints.add(normalizeNodeKey(surface.entrypoint));
-        }
-    }
-    for (const flow of criticalFlows?.flows ?? []) {
-        for (const entry of flow.entrypoints ?? []) {
-            if (typeof entry === "string")
-                entrypoints.add(normalizeNodeKey(entry));
-        }
-    }
-    for (const id of graphBundle?.analyzers_used ?? []) {
-        if (typeof id === "string")
-            analyzersUsed.add(id);
-    }
-    return { inDegree, entrypoints, analyzersUsed };
-}
-/**
- * Classify one knip lead path against the pre-built index. Pure: no IO, no
- * mutation. See {@link KnipGraphTag} for the decision table.
- */
-export function classifyKnipLead(leadPath, index) {
-    const key = normalizeNodeKey(leadPath);
-    const inDegree = index.inDegree.get(key) ?? 0;
-    if (inDegree > 0)
-        return "HAS-IMPORTERS";
-    if (index.entrypoints.has(key))
-        return "ENTRYPOINT";
-    // In-degree 0 and non-entrypoint: only trust the "dead" reading when this
-    // file's OWN language analyzer actually ran (per-file fidelity, CE-003).
-    const analyzerId = analyzerIdForFile(leadPath);
-    if (index.analyzersUsed.size === 0 ||
-        analyzerId === null ||
-        !index.analyzersUsed.has(analyzerId)) {
-        return "UNVERIFIED";
-    }
-    return "LIKELY-DEAD";
-}
-//# sourceMappingURL=knipGraphCrosscheck.js.map

package/dist/audit/orchestrator/knipGraphCrosscheck.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"knipGraphCrosscheck.js","sourceRoot":"","sources":["../../../src/audit/orchestrator/knipGraphCrosscheck.ts"],"names":[],"mappings":"AAKA,OAAO,EAAE,aAAa,EAAE,MAAM,+BAA+B,CAAC;AAC9D,OAAO,EAAE,iBAAiB,EAAE,MAAM,qCAAqC,CAAC;AA2CxE;;;;GAIG;AACH,MAAM,UAAU,gBAAgB,CAAC,IAAY;IAC3C,OAAO,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC,OAAO,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC,WAAW,EAAE,CAAC;AACrE,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,iBAAiB,CAAC,IAAY;IAC5C,KAAK,MAAM,QAAQ,IAAI,iBAAiB,EAAE,CAAC;QACzC,IAAI,QAAQ,CAAC,QAAQ,CAAC,IAAI,CAAC;YAAE,OAAO,QAAQ,CAAC,EAAE,CAAC;IAClD,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,mBAAmB,CAAC,MAInC;IACC,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC3C,MAAM,WAAW,GAAG,IAAI,GAAG,EAAU,CAAC;IACtC,MAAM,aAAa,GAAG,IAAI,GAAG,EAAU,CAAC;IAExC,MAAM,EAAE,WAAW,EAAE,eAAe,EAAE,aAAa,EAAE,GAAG,MAAM,CAAC;IAE/D,IAAI,WAAW,EAAE,MAAM,EAAE,CAAC;QACxB,KAAK,MAAM,IAAI,IAAI,aAAa,CAAC,WAAW,CAAC,EAAE,CAAC;YAC9C,MAAM,EAAE,GAAG,gBAAgB,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACrC,QAAQ,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAC9C,yEAAyE;YACzE,wEAAwE;YACxE,yEAAyE;YACzE,4CAA4C;YAC5C,MAAM,IAAI,GAAG,gBAAgB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACzC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC;gBAAE,QAAQ,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;QACjD,CAAC;IACH,CAAC;IAED,KAAK,MAAM,OAAO,IAAI,eAAe,EAAE,QAAQ,IAAI,EAAE,EAAE,CAAC;QACtD,IAAI,OAAO,OAAO,CAAC,UAAU,KAAK,QAAQ,EAAE,CAAC;YAC3C,WAAW,CAAC,GAAG,CAAC,gBAAgB,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,CAAC;QACxD,CAAC;IACH,CAAC;IACD,KAAK,MAAM,IAAI,IAAI,aAAa,EAAE,KAAK,IAAI,EAAE,EAAE,CAAC;QAC9C,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,WAAW,IAAI,EAAE,EAAE,CAAC;YAC3C,IAAI,OAAO,KAAK,KAAK,QAAQ;gBAAE,WAAW,CAAC,GAAG,CAAC,gBAAgB,CAAC,KAAK,CAAC,CAAC,CAAC;QAC1E,CAAC;IACH,CAAC;IAED,KAAK,MAAM,EAAE,IAAI,WAAW,EAAE,cAAc,IAAI,EAAE,EAAE,CAAC;QACnD,IAAI,OAAO,EAAE,KAAK,QAAQ;YAAE,aAAa,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IACpD,CAAC;IAED,OAAO,EAAE,QAAQ,EAAE,WAAW,EAAE,aAAa,EAAE,CAAC;AAClD,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,gBAAgB,CAC9B,QAAgB,EAChB,KAAqB;IAErB,MAAM,GAAG,GAAG,gBAAgB,CAAC,QAAQ,CAAC,CAAC;IACvC,MAAM,QAAQ,GAAG,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IAE9C,IAAI,QAAQ,GAAG,CAAC;QAAE,OAAO,eAAe,CAAC;IACzC,IAAI,KAAK,CAAC,WAAW,CAAC,GAAG,CAAC,GAAG,CAAC;QAAE,OAAO,YAAY,CAAC;IAEpD,0EAA0E;IAC1E,yEAAyE;IACzE,MAAM,UAAU,GAAG,iBAAiB,CAAC,QAAQ,CAAC,CAAC;IAC/C,IACE,KAAK,CAAC,aAAa,CAAC,IAAI,KAAK,CAAC;QAC9B,UAAU,KAAK,IAAI;QACnB,CAAC,KAAK,CAAC,aAAa,CAAC,GAAG,CAAC,UAAU,CAAC,EACpC,CAAC;QACD,OAAO,YAAY,CAAC;IACtB,CAAC;IACD,OAAO,aAAa,CAAC;AACvB,CAAC"}

package/dist/audit/orchestrator/selectiveDeepening.d.ts

@@ -1,3 +0,0 @@
-export { buildSelectiveDeepeningTasks, } from "./selectiveDeepening/index.js";
-export type { BuildSelectiveDeepeningTaskOptions } from "./selectiveDeepening/index.js";
-//# sourceMappingURL=selectiveDeepening.d.ts.map

package/dist/audit/orchestrator/selectiveDeepening.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"selectiveDeepening.d.ts","sourceRoot":"","sources":["../../../src/audit/orchestrator/selectiveDeepening.ts"],"names":[],"mappings":"AAKA,OAAO,EACL,4BAA4B,GAC7B,MAAM,+BAA+B,CAAC;AACvC,YAAY,EAAE,kCAAkC,EAAE,MAAM,+BAA+B,CAAC"}

package/dist/audit/orchestrator/selectiveDeepening.js

@@ -1,7 +0,0 @@
-// Public entry for selective deepening. The implementation was split by
-// task-building strategy into ./selectiveDeepening/ (finding-followup, conflict,
-// high-risk-clean, runtime-validation, lens-verification, steward-followup) with
-// the shared primitives in ./selectiveDeepening/shared.ts. This barrel preserves
-// the original module path so importers and tests are unaffected.
-export { buildSelectiveDeepeningTasks, } from "./selectiveDeepening/index.js";
-//# sourceMappingURL=selectiveDeepening.js.map

package/dist/audit/orchestrator/selectiveDeepening.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"selectiveDeepening.js","sourceRoot":"","sources":["../../../src/audit/orchestrator/selectiveDeepening.ts"],"names":[],"mappings":"AAAA,wEAAwE;AACxE,iFAAiF;AACjF,iFAAiF;AACjF,iFAAiF;AACjF,kEAAkE;AAClE,OAAO,EACL,4BAA4B,GAC7B,MAAM,+BAA+B,CAAC"}

package/dist/audit/orchestrator.d.ts

@@ -1,7 +0,0 @@
-import type { AuditTask, UnitManifest } from "./types.js";
-export interface TaskBuildOptions {
-    pass_prefix?: string;
-    limit_lenses?: string[];
-}
-export declare function buildAuditTasks(unitManifest: UnitManifest, options?: TaskBuildOptions | string): AuditTask[];
-//# sourceMappingURL=orchestrator.d.ts.map

package/dist/audit/orchestrator.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"orchestrator.d.ts","sourceRoot":"","sources":["../../src/audit/orchestrator.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,SAAS,EAAE,YAAY,EAAE,MAAM,YAAY,CAAC;AAO1D,MAAM,WAAW,gBAAgB;IAC/B,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,YAAY,CAAC,EAAE,MAAM,EAAE,CAAC;CACzB;AAwDD,wBAAgB,eAAe,CAC7B,YAAY,EAAE,YAAY,EAC1B,OAAO,GAAE,gBAAgB,GAAG,MAAW,GACtC,SAAS,EAAE,CAuBb"}