audit-tools 0.28.0

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

@@ -0,0 +1 @@
+{"version":3,"file":"reviewPacketGraphContext.d.ts","sourceRoot":"","sources":["../../../src/audit/orchestrator/reviewPacketGraphContext.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,WAAW,EAAE,SAAS,EAAE,MAAM,oBAAoB,CAAC;AAEjE,OAAO,KAAK,EACV,qBAAqB,EACrB,mBAAmB,EACpB,MAAM,4BAA4B,CAAC;AAWpC,wBAAgB,YAAY,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,CAElD;AA+CD,wBAAgB,uBAAuB,CACrC,SAAS,EAAE,MAAM,EAAE,EACnB,UAAU,EAAE,SAAS,EAAE,EACvB,WAAW,CAAC,EAAE,WAAW,GACxB;IACD,QAAQ,EAAE,qBAAqB,EAAE,CAAC;IAClC,aAAa,EAAE,MAAM,EAAE,CAAC;IACxB,WAAW,EAAE,MAAM,EAAE,CAAC;IACtB,OAAO,EAAE,mBAAmB,CAAC;CAC9B,CAqDA"}

package/dist/audit/orchestrator/reviewPacketGraphContext.js

@@ -0,0 +1,95 @@
+import { isRecord } from "audit-tools/shared";
+import { normalizeGraphPath } from "../extractors/graphPathUtils.js";
+import { isConcreteGraphEdge, graphEdgeConfidence } from "./reviewPacketGraphEdges.js";
+// Packet-level graph context: entrypoint extraction, internal/boundary edge
+// classification, cohesion scoring, key-edge selection. Consumed by buildPacket
+// in reviewPackets.ts and by prompt rendering in dispatch.ts.
+const MAX_PACKET_KEY_EDGES = 8;
+const MAX_PACKET_BOUNDARY_FILES = 12;
+export function roundQuality(value) {
+    return Math.round(value * 1000) / 1000;
+}
+function compareGraphEdges(a, b) {
+    const confidenceDelta = graphEdgeConfidence(b) - graphEdgeConfidence(a);
+    if (confidenceDelta !== 0)
+        return confidenceDelta;
+    return (a.from.localeCompare(b.from) ||
+        a.to.localeCompare(b.to) ||
+        (a.kind ?? "").localeCompare(b.kind ?? ""));
+}
+function reviewPacketGraphEdge(edge) {
+    const result = {
+        from: edge.from,
+        to: edge.to,
+        confidence: graphEdgeConfidence(edge),
+    };
+    if (edge.kind)
+        result.kind = edge.kind;
+    if (edge.reason)
+        result.reason = edge.reason;
+    return result;
+}
+function packetEntrypoints(filePaths, graphBundle) {
+    const fileSet = new Set(filePaths.map(normalizeGraphPath));
+    const routes = Array.isArray(graphBundle?.graphs.routes)
+        ? graphBundle.graphs.routes
+        : [];
+    return routes
+        .filter((route) => isRecord(route) &&
+        typeof route.handler === "string" &&
+        typeof route.path === "string" &&
+        fileSet.has(normalizeGraphPath(route.handler)))
+        .map((route) => {
+        const method = typeof route.method === "string" ? `${route.method} ` : "";
+        return `${method}${route.path} -> ${route.handler}`;
+    })
+        .sort((a, b) => a.localeCompare(b));
+}
+export function buildPacketGraphContext(filePaths, graphEdges, graphBundle) {
+    const fileSet = new Set(filePaths.map(normalizeGraphPath));
+    const internalEdges = [];
+    const boundaryFiles = new Set();
+    let boundaryEdgeCount = 0;
+    for (const edge of graphEdges) {
+        if (!isConcreteGraphEdge(edge)) {
+            continue;
+        }
+        const fromInPacket = fileSet.has(normalizeGraphPath(edge.from));
+        const toInPacket = fileSet.has(normalizeGraphPath(edge.to));
+        if (fromInPacket && toInPacket) {
+            internalEdges.push(edge);
+        }
+        else if (fromInPacket !== toInPacket) {
+            boundaryEdgeCount += 1;
+            boundaryFiles.add(fromInPacket ? edge.to : edge.from);
+        }
+    }
+    const internallyConnectedFiles = new Set();
+    for (const edge of internalEdges) {
+        internallyConnectedFiles.add(normalizeGraphPath(edge.from));
+        internallyConnectedFiles.add(normalizeGraphPath(edge.to));
+    }
+    const unexplainedFileCount = filePaths.length <= 1
+        ? 0
+        : filePaths.filter((path) => !internallyConnectedFiles.has(normalizeGraphPath(path))).length;
+    const cohesionScore = filePaths.length <= 1
+        ? 1
+        : Math.min(1, internalEdges.length / (filePaths.length - 1));
+    return {
+        keyEdges: internalEdges
+            .sort(compareGraphEdges)
+            .slice(0, MAX_PACKET_KEY_EDGES)
+            .map(reviewPacketGraphEdge),
+        boundaryFiles: [...boundaryFiles]
+            .sort((a, b) => a.localeCompare(b))
+            .slice(0, MAX_PACKET_BOUNDARY_FILES),
+        entrypoints: packetEntrypoints(filePaths, graphBundle),
+        quality: {
+            cohesion_score: roundQuality(cohesionScore),
+            internal_edge_count: internalEdges.length,
+            boundary_edge_count: boundaryEdgeCount,
+            unexplained_file_count: unexplainedFileCount,
+        },
+    };
+}
+//# sourceMappingURL=reviewPacketGraphContext.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"reviewPacketGraphContext.js","sourceRoot":"","sources":["../../../src/audit/orchestrator/reviewPacketGraphContext.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,QAAQ,EAAE,MAAM,oBAAoB,CAAC;AAK9C,OAAO,EAAE,kBAAkB,EAAE,MAAM,iCAAiC,CAAC;AACrE,OAAO,EAAE,mBAAmB,EAAE,mBAAmB,EAAE,MAAM,6BAA6B,CAAC;AAEvF,4EAA4E;AAC5E,gFAAgF;AAChF,8DAA8D;AAE9D,MAAM,oBAAoB,GAAG,CAAC,CAAC;AAC/B,MAAM,yBAAyB,GAAG,EAAE,CAAC;AAErC,MAAM,UAAU,YAAY,CAAC,KAAa;IACxC,OAAO,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,IAAI,CAAC,GAAG,IAAI,CAAC;AACzC,CAAC;AAED,SAAS,iBAAiB,CAAC,CAAY,EAAE,CAAY;IACnD,MAAM,eAAe,GAAG,mBAAmB,CAAC,CAAC,CAAC,GAAG,mBAAmB,CAAC,CAAC,CAAC,CAAC;IACxE,IAAI,eAAe,KAAK,CAAC;QAAE,OAAO,eAAe,CAAC;IAClD,OAAO,CACL,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC;QAC5B,CAAC,CAAC,EAAE,CAAC,aAAa,CAAC,CAAC,CAAC,EAAE,CAAC;QACxB,CAAC,CAAC,CAAC,IAAI,IAAI,EAAE,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,IAAI,IAAI,EAAE,CAAC,CAC3C,CAAC;AACJ,CAAC;AAED,SAAS,qBAAqB,CAAC,IAAe;IAC5C,MAAM,MAAM,GAA0B;QACpC,IAAI,EAAE,IAAI,CAAC,IAAI;QACf,EAAE,EAAE,IAAI,CAAC,EAAE;QACX,UAAU,EAAE,mBAAmB,CAAC,IAAI,CAAC;KACtC,CAAC;IACF,IAAI,IAAI,CAAC,IAAI;QAAE,MAAM,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;IACvC,IAAI,IAAI,CAAC,MAAM;QAAE,MAAM,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC;IAC7C,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,SAAS,iBAAiB,CACxB,SAAmB,EACnB,WAAyB;IAEzB,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,SAAS,CAAC,GAAG,CAAC,kBAAkB,CAAC,CAAC,CAAC;IAC3D,MAAM,MAAM,GAAG,KAAK,CAAC,OAAO,CAAC,WAAW,EAAE,MAAM,CAAC,MAAM,CAAC;QACtD,CAAC,CAAC,WAAW,CAAC,MAAM,CAAC,MAAM;QAC3B,CAAC,CAAC,EAAE,CAAC;IAEP,OAAO,MAAM;SACV,MAAM,CACL,CAAC,KAAK,EAAE,EAAE,CACR,QAAQ,CAAC,KAAK,CAAC;QACf,OAAO,KAAK,CAAC,OAAO,KAAK,QAAQ;QACjC,OAAO,KAAK,CAAC,IAAI,KAAK,QAAQ;QAC9B,OAAO,CAAC,GAAG,CAAC,kBAAkB,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CACjD;SACA,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE;QACb,MAAM,MAAM,GAAG,OAAO,KAAK,CAAC,MAAM,KAAK,QAAQ,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;QAC1E,OAAO,GAAG,MAAM,GAAG,KAAK,CAAC,IAAI,OAAO,KAAK,CAAC,OAAO,EAAE,CAAC;IACtD,CAAC,CAAC;SACD,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC;AACxC,CAAC;AAED,MAAM,UAAU,uBAAuB,CACrC,SAAmB,EACnB,UAAuB,EACvB,WAAyB;IAOzB,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,SAAS,CAAC,GAAG,CAAC,kBAAkB,CAAC,CAAC,CAAC;IAC3D,MAAM,aAAa,GAAgB,EAAE,CAAC;IACtC,MAAM,aAAa,GAAG,IAAI,GAAG,EAAU,CAAC;IACxC,IAAI,iBAAiB,GAAG,CAAC,CAAC;IAE1B,KAAK,MAAM,IAAI,IAAI,UAAU,EAAE,CAAC;QAC9B,IAAI,CAAC,mBAAmB,CAAC,IAAI,CAAC,EAAE,CAAC;YAC/B,SAAS;QACX,CAAC;QACD,MAAM,YAAY,GAAG,OAAO,CAAC,GAAG,CAAC,kBAAkB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;QAChE,MAAM,UAAU,GAAG,OAAO,CAAC,GAAG,CAAC,kBAAkB,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;QAC5D,IAAI,YAAY,IAAI,UAAU,EAAE,CAAC;YAC/B,aAAa,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC3B,CAAC;aAAM,IAAI,YAAY,KAAK,UAAU,EAAE,CAAC;YACvC,iBAAiB,IAAI,CAAC,CAAC;YACvB,aAAa,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACxD,CAAC;IACH,CAAC;IAED,MAAM,wBAAwB,GAAG,IAAI,GAAG,EAAU,CAAC;IACnD,KAAK,MAAM,IAAI,IAAI,aAAa,EAAE,CAAC;QACjC,wBAAwB,CAAC,GAAG,CAAC,kBAAkB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;QAC5D,wBAAwB,CAAC,GAAG,CAAC,kBAAkB,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;IAC5D,CAAC;IAED,MAAM,oBAAoB,GACxB,SAAS,CAAC,MAAM,IAAI,CAAC;QACnB,CAAC,CAAC,CAAC;QACH,CAAC,CAAC,SAAS,CAAC,MAAM,CACd,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,wBAAwB,CAAC,GAAG,CAAC,kBAAkB,CAAC,IAAI,CAAC,CAAC,CAClE,CAAC,MAAM,CAAC;IACf,MAAM,aAAa,GACjB,SAAS,CAAC,MAAM,IAAI,CAAC;QACnB,CAAC,CAAC,CAAC;QACH,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,aAAa,CAAC,MAAM,GAAG,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC;IAEjE,OAAO;QACL,QAAQ,EAAE,aAAa;aACpB,IAAI,CAAC,iBAAiB,CAAC;aACvB,KAAK,CAAC,CAAC,EAAE,oBAAoB,CAAC;aAC9B,GAAG,CAAC,qBAAqB,CAAC;QAC7B,aAAa,EAAE,CAAC,GAAG,aAAa,CAAC;aAC9B,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC;aAClC,KAAK,CAAC,CAAC,EAAE,yBAAyB,CAAC;QACtC,WAAW,EAAE,iBAAiB,CAAC,SAAS,EAAE,WAAW,CAAC;QACtD,OAAO,EAAE;YACP,cAAc,EAAE,YAAY,CAAC,aAAa,CAAC;YAC3C,mBAAmB,EAAE,aAAa,CAAC,MAAM;YACzC,mBAAmB,EAAE,iBAAiB;YACtC,sBAAsB,EAAE,oBAAoB;SAC7C;KACF,CAAC;AACJ,CAAC"}

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

@@ -0,0 +1,23 @@
+import type { AuditTask } from "../types.js";
+import type { GraphBundle, GraphEdge } from "audit-tools/shared";
+import { UnionFind } from "./unionFind.js";
+import { normalizeGraphPath } from "../extractors/graphPathUtils.js";
+export { normalizeGraphPath };
+/**
+ * Fan-in / fan-out degree above which a node is treated as a hub. Exported so
+ * the Phase 3 delta-scope expansion skips the same hubs that packet planning
+ * skips, preventing scope blow-up through highly-connected modules.
+ */
+export declare const HIGH_FAN_DEGREE_THRESHOLD = 12;
+export declare function collectGraphEdges(graphBundle?: GraphBundle): GraphEdge[];
+export declare function graphEdgeConfidence(edge: GraphEdge): number;
+export declare function isConcreteGraphEdge(edge: GraphEdge): boolean;
+export interface GraphDegreeIndex {
+    fanIn: Map<string, number>;
+    fanOut: Map<string, number>;
+}
+export declare function buildGraphDegreeIndex(edges: GraphEdge[]): GraphDegreeIndex;
+export declare function isPacketExpansionEdge(edge: GraphEdge, degreeIndex: GraphDegreeIndex): boolean;
+export declare function buildFileToGroupKeys(groups: Map<string, AuditTask[]>): Map<string, Set<string>>;
+export declare function unionFindFromGroups(groups: Map<string, AuditTask[]>, graphEdges: GraphEdge[]): UnionFind;
+//# sourceMappingURL=reviewPacketGraphEdges.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"reviewPacketGraphEdges.d.ts","sourceRoot":"","sources":["../../../src/audit/orchestrator/reviewPacketGraphEdges.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,aAAa,CAAC;AAC7C,OAAO,KAAK,EAAE,WAAW,EAAE,SAAS,EAAE,MAAM,oBAAoB,CAAC;AAEjE,OAAO,EAAE,SAAS,EAAE,MAAM,gBAAgB,CAAC;AAC3C,OAAO,EAAE,kBAAkB,EAAE,MAAM,iCAAiC,CAAC;AAMrE,OAAO,EAAE,kBAAkB,EAAE,CAAC;AAG9B;;;;GAIG;AACH,eAAO,MAAM,yBAAyB,KAAK,CAAC;AAG5C,wBAAgB,iBAAiB,CAAC,WAAW,CAAC,EAAE,WAAW,GAAG,SAAS,EAAE,CAmCxE;AAED,wBAAgB,mBAAmB,CAAC,IAAI,EAAE,SAAS,GAAG,MAAM,CAW3D;AAED,wBAAgB,mBAAmB,CAAC,IAAI,EAAE,SAAS,GAAG,OAAO,CAE5D;AAED,MAAM,WAAW,gBAAgB;IAC/B,KAAK,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAC3B,MAAM,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;CAC7B;AAED,wBAAgB,qBAAqB,CAAC,KAAK,EAAE,SAAS,EAAE,GAAG,gBAAgB,CAe1E;AAED,wBAAgB,qBAAqB,CACnC,IAAI,EAAE,SAAS,EACf,WAAW,EAAE,gBAAgB,GAC5B,OAAO,CAgBT;AAED,wBAAgB,oBAAoB,CAClC,MAAM,EAAE,GAAG,CAAC,MAAM,EAAE,SAAS,EAAE,CAAC,GAC/B,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC,CAW1B;AAED,wBAAgB,mBAAmB,CACjC,MAAM,EAAE,GAAG,CAAC,MAAM,EAAE,SAAS,EAAE,CAAC,EAChC,UAAU,EAAE,SAAS,EAAE,GACtB,SAAS,CAmEX"}

package/dist/audit/orchestrator/reviewPacketGraphEdges.js

@@ -0,0 +1,169 @@
+import { isRecord } from "audit-tools/shared";
+import { UnionFind } from "./unionFind.js";
+import { normalizeGraphPath } from "../extractors/graphPathUtils.js";
+// Graph-edge primitives: collection, scoring, degree indexing, expansion
+// predicate, group-key utilities, and the union-find merge step that derives
+// the initial clustering from shared-file links and filtered graph edges.
+// Imported by reviewPacketGraphClustering and reviewPacketGraph (barrel).
+export { normalizeGraphPath };
+const PACKET_EXPANSION_MIN_CONFIDENCE = 0.65;
+/**
+ * Fan-in / fan-out degree above which a node is treated as a hub. Exported so
+ * the Phase 3 delta-scope expansion skips the same hubs that packet planning
+ * skips, preventing scope blow-up through highly-connected modules.
+ */
+export const HIGH_FAN_DEGREE_THRESHOLD = 12;
+const HIGH_FAN_EXPANSION_CONFIDENCE = 0.99;
+export function collectGraphEdges(graphBundle) {
+    if (!graphBundle?.graphs) {
+        return [];
+    }
+    const edges = [];
+    for (const key of ["imports", "calls", "references"]) {
+        const raw = graphBundle.graphs[key];
+        if (!Array.isArray(raw)) {
+            continue;
+        }
+        for (const item of raw) {
+            if (!isRecord(item)) {
+                continue;
+            }
+            if (typeof item.from !== "string" || typeof item.to !== "string") {
+                continue;
+            }
+            const edge = {
+                from: item.from,
+                to: item.to,
+                kind: typeof item.kind === "string" ? item.kind : undefined,
+            };
+            if (item.direction === "directed" || item.direction === "undirected") {
+                edge.direction = item.direction;
+            }
+            if (typeof item.confidence === "number" && Number.isFinite(item.confidence)) {
+                edge.confidence = Math.min(1, Math.max(0, item.confidence));
+            }
+            if (typeof item.reason === "string" && item.reason.trim().length > 0) {
+                edge.reason = item.reason.trim();
+            }
+            edges.push(edge);
+        }
+    }
+    return edges;
+}
+export function graphEdgeConfidence(edge) {
+    if (typeof edge.confidence === "number" && Number.isFinite(edge.confidence)) {
+        return Math.min(1, Math.max(0, edge.confidence));
+    }
+    if (edge.kind === "heuristic-container-edge") {
+        return 0.25;
+    }
+    if (edge.kind?.startsWith("heuristic-")) {
+        return 0.5;
+    }
+    return 0.8;
+}
+export function isConcreteGraphEdge(edge) {
+    return edge.kind !== "heuristic-container-edge";
+}
+export function buildGraphDegreeIndex(edges) {
+    const fanIn = new Map();
+    const fanOut = new Map();
+    for (const edge of edges) {
+        if (!isConcreteGraphEdge(edge)) {
+            continue;
+        }
+        const from = normalizeGraphPath(edge.from);
+        const to = normalizeGraphPath(edge.to);
+        fanOut.set(from, (fanOut.get(from) ?? 0) + 1);
+        fanIn.set(to, (fanIn.get(to) ?? 0) + 1);
+    }
+    return { fanIn, fanOut };
+}
+export function isPacketExpansionEdge(edge, degreeIndex) {
+    if (!isConcreteGraphEdge(edge)) {
+        return false;
+    }
+    const confidence = graphEdgeConfidence(edge);
+    if (confidence < PACKET_EXPANSION_MIN_CONFIDENCE) {
+        return false;
+    }
+    const fromFanOut = degreeIndex.fanOut.get(normalizeGraphPath(edge.from)) ?? 0;
+    const toFanIn = degreeIndex.fanIn.get(normalizeGraphPath(edge.to)) ?? 0;
+    const highFanEdge = fromFanOut > HIGH_FAN_DEGREE_THRESHOLD ||
+        toFanIn > HIGH_FAN_DEGREE_THRESHOLD;
+    return !highFanEdge || confidence >= HIGH_FAN_EXPANSION_CONFIDENCE;
+}
+export function buildFileToGroupKeys(groups) {
+    const fileToGroupKeys = new Map();
+    for (const [key, tasks] of groups) {
+        for (const path of new Set(tasks.flatMap((task) => task.file_paths))) {
+            const normalized = normalizeGraphPath(path);
+            const existing = fileToGroupKeys.get(normalized) ?? new Set();
+            existing.add(key);
+            fileToGroupKeys.set(normalized, existing);
+        }
+    }
+    return fileToGroupKeys;
+}
+export function unionFindFromGroups(groups, graphEdges) {
+    const uf = new UnionFind(groups.keys());
+    const fileToGroupKeys = buildFileToGroupKeys(groups);
+    const degreeIndex = buildGraphDegreeIndex(graphEdges);
+    const verbose = Boolean(process.env.AUDIT_CODE_VERBOSE);
+    for (const keys of fileToGroupKeys.values()) {
+        const [first, ...rest] = [...keys].sort((a, b) => a.localeCompare(b));
+        if (!first)
+            continue;
+        for (const key of rest) {
+            if (verbose) {
+                const rootBefore = uf.find(key);
+                const rootFirst = uf.find(first);
+                uf.union(first, key);
+                if (rootFirst !== rootBefore) {
+                    process.stderr.write(`[audit-code:packet-planning] shared-file merge: "${first}" + "${key}" (roots "${rootFirst}" + "${rootBefore}" → "${uf.find(first)}")\n`);
+                }
+            }
+            else {
+                uf.union(first, key);
+            }
+        }
+    }
+    for (const edge of graphEdges) {
+        const fromGroups = fileToGroupKeys.get(normalizeGraphPath(edge.from));
+        const toGroups = fileToGroupKeys.get(normalizeGraphPath(edge.to));
+        if (!isPacketExpansionEdge(edge, degreeIndex)) {
+            if (verbose && fromGroups && toGroups) {
+                // Edge has group mappings but was filtered — check if it was the
+                // high fan-degree guard specifically.
+                const fromFanOut = degreeIndex.fanOut.get(normalizeGraphPath(edge.from)) ?? 0;
+                const toFanIn = degreeIndex.fanIn.get(normalizeGraphPath(edge.to)) ?? 0;
+                const highFanEdge = fromFanOut > HIGH_FAN_DEGREE_THRESHOLD ||
+                    toFanIn > HIGH_FAN_DEGREE_THRESHOLD;
+                if (highFanEdge) {
+                    process.stderr.write(`[audit-code:packet-planning] edge skip (high-fan-degree): "${edge.from}" → "${edge.to}" (fanOut=${fromFanOut}, fanIn=${toFanIn})\n`);
+                }
+            }
+            continue;
+        }
+        if (!fromGroups || !toGroups) {
+            continue;
+        }
+        for (const fromKey of fromGroups) {
+            for (const toKey of toGroups) {
+                if (verbose) {
+                    const rootFrom = uf.find(fromKey);
+                    const rootTo = uf.find(toKey);
+                    uf.union(fromKey, toKey);
+                    if (rootFrom !== rootTo) {
+                        process.stderr.write(`[audit-code:packet-planning] edge-driven merge: "${fromKey}" + "${toKey}" via edge "${edge.from}" → "${edge.to}" (kind=${edge.kind ?? "unknown"})\n`);
+                    }
+                }
+                else {
+                    uf.union(fromKey, toKey);
+                }
+            }
+        }
+    }
+    return uf;
+}
+//# sourceMappingURL=reviewPacketGraphEdges.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"reviewPacketGraphEdges.js","sourceRoot":"","sources":["../../../src/audit/orchestrator/reviewPacketGraphEdges.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,QAAQ,EAAE,MAAM,oBAAoB,CAAC;AAC9C,OAAO,EAAE,SAAS,EAAE,MAAM,gBAAgB,CAAC;AAC3C,OAAO,EAAE,kBAAkB,EAAE,MAAM,iCAAiC,CAAC;AAErE,yEAAyE;AACzE,6EAA6E;AAC7E,0EAA0E;AAC1E,0EAA0E;AAC1E,OAAO,EAAE,kBAAkB,EAAE,CAAC;AAE9B,MAAM,+BAA+B,GAAG,IAAI,CAAC;AAC7C;;;;GAIG;AACH,MAAM,CAAC,MAAM,yBAAyB,GAAG,EAAE,CAAC;AAC5C,MAAM,6BAA6B,GAAG,IAAI,CAAC;AAE3C,MAAM,UAAU,iBAAiB,CAAC,WAAyB;IACzD,IAAI,CAAC,WAAW,EAAE,MAAM,EAAE,CAAC;QACzB,OAAO,EAAE,CAAC;IACZ,CAAC;IACD,MAAM,KAAK,GAAgB,EAAE,CAAC;IAC9B,KAAK,MAAM,GAAG,IAAI,CAAC,SAAS,EAAE,OAAO,EAAE,YAAY,CAAC,EAAE,CAAC;QACrD,MAAM,GAAG,GAAG,WAAW,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QACpC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC;YACxB,SAAS;QACX,CAAC;QACD,KAAK,MAAM,IAAI,IAAI,GAAG,EAAE,CAAC;YACvB,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC;gBACpB,SAAS;YACX,CAAC;YACD,IAAI,OAAO,IAAI,CAAC,IAAI,KAAK,QAAQ,IAAI,OAAO,IAAI,CAAC,EAAE,KAAK,QAAQ,EAAE,CAAC;gBACjE,SAAS;YACX,CAAC;YACD,MAAM,IAAI,GAAc;gBACtB,IAAI,EAAE,IAAI,CAAC,IAAI;gBACf,EAAE,EAAE,IAAI,CAAC,EAAE;gBACX,IAAI,EAAE,OAAO,IAAI,CAAC,IAAI,KAAK,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS;aAC5D,CAAC;YACF,IAAI,IAAI,CAAC,SAAS,KAAK,UAAU,IAAI,IAAI,CAAC,SAAS,KAAK,YAAY,EAAE,CAAC;gBACrE,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,SAAS,CAAC;YAClC,CAAC;YACD,IAAI,OAAO,IAAI,CAAC,UAAU,KAAK,QAAQ,IAAI,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,UAAU,CAAC,EAAE,CAAC;gBAC5E,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC;YAC9D,CAAC;YACD,IAAI,OAAO,IAAI,CAAC,MAAM,KAAK,QAAQ,IAAI,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACrE,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;YACnC,CAAC;YACD,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACnB,CAAC;IACH,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED,MAAM,UAAU,mBAAmB,CAAC,IAAe;IACjD,IAAI,OAAO,IAAI,CAAC,UAAU,KAAK,QAAQ,IAAI,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,UAAU,CAAC,EAAE,CAAC;QAC5E,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC;IACnD,CAAC;IACD,IAAI,IAAI,CAAC,IAAI,KAAK,0BAA0B,EAAE,CAAC;QAC7C,OAAO,IAAI,CAAC;IACd,CAAC;IACD,IAAI,IAAI,CAAC,IAAI,EAAE,UAAU,CAAC,YAAY,CAAC,EAAE,CAAC;QACxC,OAAO,GAAG,CAAC;IACb,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,MAAM,UAAU,mBAAmB,CAAC,IAAe;IACjD,OAAO,IAAI,CAAC,IAAI,KAAK,0BAA0B,CAAC;AAClD,CAAC;AAOD,MAAM,UAAU,qBAAqB,CAAC,KAAkB;IACtD,MAAM,KAAK,GAAG,IAAI,GAAG,EAAkB,CAAC;IACxC,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAC;IAEzC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,IAAI,CAAC,mBAAmB,CAAC,IAAI,CAAC,EAAE,CAAC;YAC/B,SAAS;QACX,CAAC;QACD,MAAM,IAAI,GAAG,kBAAkB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC3C,MAAM,EAAE,GAAG,kBAAkB,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACvC,MAAM,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAC9C,KAAK,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAC1C,CAAC;IAED,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC;AAC3B,CAAC;AAED,MAAM,UAAU,qBAAqB,CACnC,IAAe,EACf,WAA6B;IAE7B,IAAI,CAAC,mBAAmB,CAAC,IAAI,CAAC,EAAE,CAAC;QAC/B,OAAO,KAAK,CAAC;IACf,CAAC;IACD,MAAM,UAAU,GAAG,mBAAmB,CAAC,IAAI,CAAC,CAAC;IAC7C,IAAI,UAAU,GAAG,+BAA+B,EAAE,CAAC;QACjD,OAAO,KAAK,CAAC;IACf,CAAC;IAED,MAAM,UAAU,GAAG,WAAW,CAAC,MAAM,CAAC,GAAG,CAAC,kBAAkB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC;IAC9E,MAAM,OAAO,GAAG,WAAW,CAAC,KAAK,CAAC,GAAG,CAAC,kBAAkB,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC;IACxE,MAAM,WAAW,GACf,UAAU,GAAG,yBAAyB;QACtC,OAAO,GAAG,yBAAyB,CAAC;IAEtC,OAAO,CAAC,WAAW,IAAI,UAAU,IAAI,6BAA6B,CAAC;AACrE,CAAC;AAED,MAAM,UAAU,oBAAoB,CAClC,MAAgC;IAEhC,MAAM,eAAe,GAAG,IAAI,GAAG,EAAuB,CAAC;IACvD,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,MAAM,EAAE,CAAC;QAClC,KAAK,MAAM,IAAI,IAAI,IAAI,GAAG,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC;YACrE,MAAM,UAAU,GAAG,kBAAkB,CAAC,IAAI,CAAC,CAAC;YAC5C,MAAM,QAAQ,GAAG,eAAe,CAAC,GAAG,CAAC,UAAU,CAAC,IAAI,IAAI,GAAG,EAAU,CAAC;YACtE,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YAClB,eAAe,CAAC,GAAG,CAAC,UAAU,EAAE,QAAQ,CAAC,CAAC;QAC5C,CAAC;IACH,CAAC;IACD,OAAO,eAAe,CAAC;AACzB,CAAC;AAED,MAAM,UAAU,mBAAmB,CACjC,MAAgC,EAChC,UAAuB;IAEvB,MAAM,EAAE,GAAG,IAAI,SAAS,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC;IACxC,MAAM,eAAe,GAAG,oBAAoB,CAAC,MAAM,CAAC,CAAC;IACrD,MAAM,WAAW,GAAG,qBAAqB,CAAC,UAAU,CAAC,CAAC;IACtD,MAAM,OAAO,GAAG,OAAO,CAAC,OAAO,CAAC,GAAG,CAAC,kBAAkB,CAAC,CAAC;IAExD,KAAK,MAAM,IAAI,IAAI,eAAe,CAAC,MAAM,EAAE,EAAE,CAAC;QAC5C,MAAM,CAAC,KAAK,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC;QACtE,IAAI,CAAC,KAAK;YAAE,SAAS;QACrB,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;YACvB,IAAI,OAAO,EAAE,CAAC;gBACZ,MAAM,UAAU,GAAG,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;gBAChC,MAAM,SAAS,GAAG,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;gBACjC,EAAE,CAAC,KAAK,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;gBACrB,IAAI,SAAS,KAAK,UAAU,EAAE,CAAC;oBAC7B,OAAO,CAAC,MAAM,CAAC,KAAK,CAClB,oDAAoD,KAAK,QAAQ,GAAG,aAAa,SAAS,QAAQ,UAAU,QAAQ,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CACzI,CAAC;gBACJ,CAAC;YACH,CAAC;iBAAM,CAAC;gBACN,EAAE,CAAC,KAAK,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;YACvB,CAAC;QACH,CAAC;IACH,CAAC;IAED,KAAK,MAAM,IAAI,IAAI,UAAU,EAAE,CAAC;QAC9B,MAAM,UAAU,GAAG,eAAe,CAAC,GAAG,CAAC,kBAAkB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;QACtE,MAAM,QAAQ,GAAG,eAAe,CAAC,GAAG,CAAC,kBAAkB,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;QAClE,IAAI,CAAC,qBAAqB,CAAC,IAAI,EAAE,WAAW,CAAC,EAAE,CAAC;YAC9C,IAAI,OAAO,IAAI,UAAU,IAAI,QAAQ,EAAE,CAAC;gBACtC,iEAAiE;gBACjE,sCAAsC;gBACtC,MAAM,UAAU,GAAG,WAAW,CAAC,MAAM,CAAC,GAAG,CAAC,kBAAkB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC;gBAC9E,MAAM,OAAO,GAAG,WAAW,CAAC,KAAK,CAAC,GAAG,CAAC,kBAAkB,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC;gBACxE,MAAM,WAAW,GACf,UAAU,GAAG,yBAAyB;oBACtC,OAAO,GAAG,yBAAyB,CAAC;gBACtC,IAAI,WAAW,EAAE,CAAC;oBAChB,OAAO,CAAC,MAAM,CAAC,KAAK,CAClB,8DAA8D,IAAI,CAAC,IAAI,QAAQ,IAAI,CAAC,EAAE,aAAa,UAAU,WAAW,OAAO,KAAK,CACrI,CAAC;gBACJ,CAAC;YACH,CAAC;YACD,SAAS;QACX,CAAC;QACD,IAAI,CAAC,UAAU,IAAI,CAAC,QAAQ,EAAE,CAAC;YAC7B,SAAS;QACX,CAAC;QACD,KAAK,MAAM,OAAO,IAAI,UAAU,EAAE,CAAC;YACjC,KAAK,MAAM,KAAK,IAAI,QAAQ,EAAE,CAAC;gBAC7B,IAAI,OAAO,EAAE,CAAC;oBACZ,MAAM,QAAQ,GAAG,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;oBAClC,MAAM,MAAM,GAAG,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;oBAC9B,EAAE,CAAC,KAAK,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC;oBACzB,IAAI,QAAQ,KAAK,MAAM,EAAE,CAAC;wBACxB,OAAO,CAAC,MAAM,CAAC,KAAK,CAClB,oDAAoD,OAAO,QAAQ,KAAK,eAAe,IAAI,CAAC,IAAI,QAAQ,IAAI,CAAC,EAAE,WAAW,IAAI,CAAC,IAAI,IAAI,SAAS,KAAK,CACtJ,CAAC;oBACJ,CAAC;gBACH,CAAC;qBAAM,CAAC;oBACN,EAAE,CAAC,KAAK,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC;gBAC3B,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,EAAE,CAAC;AACZ,CAAC"}

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

@@ -0,0 +1,17 @@
+import type { AuditTask } from "../types.js";
+import type { AuditPlanMetrics, ReviewPacket } from "../types/reviewPlanning.js";
+import type { GraphEdge } from "audit-tools/shared";
+interface ReviewPacketPlanningData {
+    graphEdges: GraphEdge[];
+    groups: Map<string, AuditTask[]>;
+    planningGraphEdges: GraphEdge[];
+    packets: ReviewPacket[];
+}
+/**
+ * Compute AuditPlanMetrics from pre-built planning data.
+ * Called by buildAuditPlanMetrics in reviewPackets.ts after it runs the
+ * planning pass; not intended for direct use outside this module pair.
+ */
+export declare function computeAuditPlanMetrics(planningData: ReviewPacketPlanningData, tasks: AuditTask[], lineIndex?: Record<string, number>, generatedAt?: Date): AuditPlanMetrics;
+export {};
+//# sourceMappingURL=reviewPacketMetrics.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"reviewPacketMetrics.d.ts","sourceRoot":"","sources":["../../../src/audit/orchestrator/reviewPacketMetrics.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,aAAa,CAAC;AAC7C,OAAO,KAAK,EACV,gBAAgB,EAChB,YAAY,EAEb,MAAM,4BAA4B,CAAC;AACpC,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,oBAAoB,CAAC;AAyBpD,UAAU,wBAAwB;IAChC,UAAU,EAAE,SAAS,EAAE,CAAC;IACxB,MAAM,EAAE,GAAG,CAAC,MAAM,EAAE,SAAS,EAAE,CAAC,CAAC;IACjC,kBAAkB,EAAE,SAAS,EAAE,CAAC;IAChC,OAAO,EAAE,YAAY,EAAE,CAAC;CACzB;AAuYD;;;;GAIG;AACH,wBAAgB,uBAAuB,CACrC,YAAY,EAAE,wBAAwB,EACtC,KAAK,EAAE,SAAS,EAAE,EAClB,SAAS,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,EAClC,WAAW,CAAC,EAAE,IAAI,GACjB,gBAAgB,CAuElB"}

package/dist/audit/orchestrator/reviewPacketMetrics.js

@@ -0,0 +1,322 @@
+import { normalizeGraphPath } from "../extractors/graphPathUtils.js";
+import { HIGH_FAN_DEGREE_THRESHOLD, buildGraphDegreeIndex, isConcreteGraphEdge, isPacketExpansionEdge, buildFileToGroupKeys, } from "./reviewPacketGraphEdges.js";
+import { roundQuality } from "./reviewPacketGraphContext.js";
+// Audit-plan quality metrics: packet cohesion, weakly-explained packet
+// analysis, edge-kind breakdowns. buildAuditPlanMetrics is the single entry
+// point; all helpers below are module-private.
+const MAX_WEAK_PACKET_SAMPLES = 12;
+const MAX_WEAK_PACKET_SAMPLE_FILES = 8;
+const WEAK_PACKET_GAP_ORDER = [
+    "missing_internal_edges",
+    "unexplained_files",
+    "partial_cohesion",
+];
+// --- private helpers ---
+function normalizePriority(priority) {
+    return priority ?? "low";
+}
+function lineCountForPath(task, path, lineIndex) {
+    return task.file_line_counts?.[path] ?? lineIndex?.[path] ?? 0;
+}
+function taskLineCount(task, lineIndex) {
+    return task.file_paths.reduce((sum, path) => sum + lineCountForPath(task, path, lineIndex), 0);
+}
+function edgeKindKey(edge) {
+    const kind = edge.kind?.trim();
+    return kind && kind.length > 0 ? kind : "unknown";
+}
+function edgeIdentity(edge) {
+    return [
+        normalizeGraphPath(edge.from),
+        normalizeGraphPath(edge.to),
+        edgeKindKey(edge),
+    ].join("\0");
+}
+function incrementEdgeKindCount(counts, edge) {
+    const key = edgeKindKey(edge);
+    counts[key] = (counts[key] ?? 0) + 1;
+}
+function sortCountRecord(counts) {
+    return Object.fromEntries(Object.entries(counts).sort((a, b) => a[0].localeCompare(b[0])));
+}
+function buildTaskToGroupKey(groups) {
+    const taskToGroupKey = new Map();
+    for (const [groupKey, tasks] of groups) {
+        for (const task of tasks) {
+            taskToGroupKey.set(task.task_id, groupKey);
+        }
+    }
+    return taskToGroupKey;
+}
+function buildGroupToPacketIds(packets, groups) {
+    const taskToGroupKey = buildTaskToGroupKey(groups);
+    const groupToPacketIds = new Map();
+    for (const packet of packets) {
+        const packetGroupKeys = new Set(packet.task_ids
+            .map((taskId) => taskToGroupKey.get(taskId))
+            .filter((groupKey) => groupKey !== undefined));
+        for (const groupKey of packetGroupKeys) {
+            const packetIds = groupToPacketIds.get(groupKey) ?? new Set();
+            packetIds.add(packet.packet_id);
+            groupToPacketIds.set(groupKey, packetIds);
+        }
+    }
+    return groupToPacketIds;
+}
+function setsOverlap(a, b) {
+    if (!a || !b) {
+        return false;
+    }
+    for (const value of a) {
+        if (b.has(value)) {
+            return true;
+        }
+    }
+    return false;
+}
+function countMergeEdgeKinds(packets, groups, planningGraphEdges) {
+    const counts = {};
+    const seen = new Set();
+    const fileToGroupKeys = buildFileToGroupKeys(groups);
+    const groupToPacketIds = buildGroupToPacketIds(packets, groups);
+    const degreeIndex = buildGraphDegreeIndex(planningGraphEdges);
+    for (const edge of planningGraphEdges) {
+        if (!isPacketExpansionEdge(edge, degreeIndex)) {
+            continue;
+        }
+        const fromGroups = fileToGroupKeys.get(normalizeGraphPath(edge.from));
+        const toGroups = fileToGroupKeys.get(normalizeGraphPath(edge.to));
+        if (!fromGroups || !toGroups) {
+            continue;
+        }
+        let mergedDistinctGroups = false;
+        for (const fromKey of fromGroups) {
+            for (const toKey of toGroups) {
+                if (fromKey !== toKey &&
+                    setsOverlap(groupToPacketIds.get(fromKey), groupToPacketIds.get(toKey))) {
+                    mergedDistinctGroups = true;
+                    break;
+                }
+            }
+            if (mergedDistinctGroups) {
+                break;
+            }
+        }
+        const identity = edgeIdentity(edge);
+        if (mergedDistinctGroups && !seen.has(identity)) {
+            seen.add(identity);
+            incrementEdgeKindCount(counts, edge);
+        }
+    }
+    return sortCountRecord(counts);
+}
+function buildFileToPacketIds(packets) {
+    const fileToPacketIds = new Map();
+    for (const packet of packets) {
+        for (const path of packet.file_paths) {
+            const normalized = normalizeGraphPath(path);
+            const packetIds = fileToPacketIds.get(normalized) ?? new Set();
+            packetIds.add(packet.packet_id);
+            fileToPacketIds.set(normalized, packetIds);
+        }
+    }
+    return fileToPacketIds;
+}
+function countBoundaryOnlyEdgeKinds(packets, planningGraphEdges) {
+    const counts = {};
+    const seen = new Set();
+    const fileToPacketIds = buildFileToPacketIds(packets);
+    for (const edge of planningGraphEdges) {
+        if (!isConcreteGraphEdge(edge)) {
+            continue;
+        }
+        const fromPacketIds = fileToPacketIds.get(normalizeGraphPath(edge.from));
+        const toPacketIds = fileToPacketIds.get(normalizeGraphPath(edge.to));
+        if (!fromPacketIds && !toPacketIds) {
+            continue;
+        }
+        if (setsOverlap(fromPacketIds, toPacketIds)) {
+            continue;
+        }
+        const identity = edgeIdentity(edge);
+        if (!seen.has(identity)) {
+            seen.add(identity);
+            incrementEdgeKindCount(counts, edge);
+        }
+    }
+    return sortCountRecord(counts);
+}
+function isWeaklyExplainedPacket(packet) {
+    return (packet.file_paths.length > 1 &&
+        (packet.quality.internal_edge_count === 0 ||
+            packet.quality.cohesion_score < 1 ||
+            packet.quality.unexplained_file_count > 0));
+}
+function weaklyExplainedPackets(packets) {
+    return packets.filter(isWeaklyExplainedPacket);
+}
+function weaklyExplainedPacketIds(weakPackets) {
+    return weakPackets
+        .map((packet) => packet.packet_id)
+        .sort((a, b) => a.localeCompare(b));
+}
+function weakPacketPrimaryGap(packet) {
+    if (packet.quality.internal_edge_count === 0) {
+        return "missing_internal_edges";
+    }
+    if (packet.quality.unexplained_file_count > 0) {
+        return "unexplained_files";
+    }
+    return "partial_cohesion";
+}
+function weaklyExplainedGapCounts(weakPackets) {
+    const counts = {
+        missing_internal_edges: 0,
+        unexplained_files: 0,
+        partial_cohesion: 0,
+    };
+    for (const packet of weakPackets) {
+        counts[weakPacketPrimaryGap(packet)] += 1;
+    }
+    return Object.fromEntries(WEAK_PACKET_GAP_ORDER.map((gap) => [gap, counts[gap]]));
+}
+function fileExtensionBucket(path) {
+    const basename = normalizeGraphPath(path).split("/").at(-1) ?? "";
+    const extensionStart = basename.lastIndexOf(".");
+    if (extensionStart <= 0 || extensionStart === basename.length - 1) {
+        return "no_extension";
+    }
+    return basename.slice(extensionStart).toLowerCase();
+}
+function weaklyExplainedFileExtensionCounts(weakPackets) {
+    const counts = {};
+    const seenPaths = new Set();
+    for (const packet of weakPackets) {
+        for (const path of packet.file_paths) {
+            const normalized = normalizeGraphPath(path);
+            if (seenPaths.has(normalized)) {
+                continue;
+            }
+            seenPaths.add(normalized);
+            const extension = fileExtensionBucket(path);
+            counts[extension] = (counts[extension] ?? 0) + 1;
+        }
+    }
+    return sortCountRecord(counts);
+}
+function weaklyExplainedPacketSamples(weakPackets) {
+    return weakPackets
+        .sort((a, b) => b.quality.unexplained_file_count - a.quality.unexplained_file_count ||
+        a.quality.cohesion_score - b.quality.cohesion_score ||
+        b.file_paths.length - a.file_paths.length ||
+        a.packet_id.localeCompare(b.packet_id))
+        .slice(0, MAX_WEAK_PACKET_SAMPLES)
+        .map((packet) => ({
+        packet_id: packet.packet_id,
+        primary_gap: weakPacketPrimaryGap(packet),
+        file_count: packet.file_paths.length,
+        sample_file_paths: packet.file_paths.slice(0, MAX_WEAK_PACKET_SAMPLE_FILES),
+        cohesion_score: packet.quality.cohesion_score,
+        internal_edge_count: packet.quality.internal_edge_count,
+        boundary_edge_count: packet.quality.boundary_edge_count,
+        unexplained_file_count: packet.quality.unexplained_file_count,
+    }));
+}
+function countHighDegreeTaskFiles(degreeMap, taskFiles) {
+    let count = 0;
+    for (const [path, degree] of degreeMap) {
+        if (degree > HIGH_FAN_DEGREE_THRESHOLD && taskFiles.has(path)) {
+            count += 1;
+        }
+    }
+    return count;
+}
+function buildPacketQualityMetrics(packets, tasks, graphEdges, planningGraphEdges, groups) {
+    const packetTaskIds = new Set(packets.flatMap((packet) => packet.task_ids));
+    const orphanTaskCount = tasks.filter((task) => !packetTaskIds.has(task.task_id)).length;
+    const degreeIndex = buildGraphDegreeIndex(graphEdges);
+    const taskFiles = new Set(tasks.flatMap((task) => task.file_paths.map(normalizeGraphPath)));
+    const largestUnexplainedPacket = packets.reduce((largest, packet) => !largest ||
+        packet.quality.unexplained_file_count >
+            largest.quality.unexplained_file_count
+        ? packet
+        : largest, undefined);
+    const largestUnexplainedFiles = largestUnexplainedPacket?.quality.unexplained_file_count ?? 0;
+    const weakPackets = weaklyExplainedPackets(packets);
+    const weakPacketIds = weaklyExplainedPacketIds(weakPackets);
+    const weakPacketSamples = weaklyExplainedPacketSamples(weakPackets);
+    return {
+        average_cohesion_score: packets.length > 0
+            ? roundQuality(packets.reduce((sum, packet) => sum + packet.quality.cohesion_score, 0) / packets.length)
+            : 0,
+        boundary_crossing_count: packets.reduce((sum, packet) => sum + packet.quality.boundary_edge_count, 0),
+        merge_edge_kind_counts: countMergeEdgeKinds(packets, groups, planningGraphEdges),
+        boundary_edge_kind_counts: countBoundaryOnlyEdgeKinds(packets, planningGraphEdges),
+        orphan_task_count: orphanTaskCount,
+        high_fan_in_file_count: countHighDegreeTaskFiles(degreeIndex.fanIn, taskFiles),
+        high_fan_out_file_count: countHighDegreeTaskFiles(degreeIndex.fanOut, taskFiles),
+        weakly_explained_gap_counts: weaklyExplainedGapCounts(weakPackets),
+        weakly_explained_file_extension_counts: weaklyExplainedFileExtensionCounts(weakPackets),
+        weakly_explained_packet_count: weakPacketIds.length,
+        weakly_explained_packet_ids: weakPacketIds,
+        weakly_explained_packet_samples: weakPacketSamples,
+        largest_unexplained_packet_id: largestUnexplainedFiles > 0
+            ? largestUnexplainedPacket?.packet_id
+            : undefined,
+        largest_unexplained_packet_files: largestUnexplainedFiles,
+    };
+}
+// --- public entry point ---
+/**
+ * Compute AuditPlanMetrics from pre-built planning data.
+ * Called by buildAuditPlanMetrics in reviewPackets.ts after it runs the
+ * planning pass; not intended for direct use outside this module pair.
+ */
+export function computeAuditPlanMetrics(planningData, tasks, lineIndex, generatedAt) {
+    const { graphEdges, groups, packets, planningGraphEdges } = planningData;
+    const taskLineCounts = tasks.map((task) => taskLineCount(task, lineIndex));
+    const totalTaskLines = taskLineCounts.reduce((sum, value) => sum + value, 0);
+    const totalPacketLines = packets.reduce((sum, packet) => sum + packet.total_lines, 0);
+    const largestTaskIndex = taskLineCounts.reduce((largest, value, index) => (value > taskLineCounts[largest] ? index : largest), 0);
+    const largestPacket = packets.reduce((largest, packet) => !largest || packet.total_lines > largest.total_lines ? packet : largest, undefined);
+    const taskFileReferences = tasks.reduce((sum, task) => sum + task.file_paths.length, 0);
+    const uniqueFiles = new Set(tasks.flatMap((task) => task.file_paths));
+    const lensTaskCounts = {};
+    const priorityTaskCounts = {
+        high: 0,
+        medium: 0,
+        low: 0,
+    };
+    for (const task of tasks) {
+        lensTaskCounts[task.lens] = (lensTaskCounts[task.lens] ?? 0) + 1;
+        priorityTaskCounts[normalizePriority(task.priority)] += 1;
+    }
+    return {
+        generated_at: (generatedAt ?? new Date()).toISOString(),
+        task_count: tasks.length,
+        packet_count: packets.length,
+        estimated_agent_reduction: Math.max(0, tasks.length - packets.length),
+        estimated_agent_reduction_ratio: tasks.length === 0 ? 0 : Math.max(0, tasks.length - packets.length) / tasks.length,
+        unique_file_count: uniqueFiles.size,
+        task_file_reference_count: taskFileReferences,
+        repeated_file_reference_count: Math.max(0, taskFileReferences - uniqueFiles.size),
+        total_task_lines: totalTaskLines,
+        total_packet_lines: totalPacketLines,
+        repeated_line_reference_count: Math.max(0, totalTaskLines - totalPacketLines),
+        min_task_lines: taskLineCounts.length > 0 ? Math.min(...taskLineCounts) : 0,
+        max_task_lines: taskLineCounts.length > 0 ? Math.max(...taskLineCounts) : 0,
+        average_task_lines: taskLineCounts.length > 0 ? totalTaskLines / taskLineCounts.length : 0,
+        largest_task_id: tasks[largestTaskIndex]?.task_id,
+        largest_packet_id: largestPacket?.packet_id,
+        lens_task_counts: lensTaskCounts,
+        priority_task_counts: priorityTaskCounts,
+        packet_quality: buildPacketQualityMetrics(packets, tasks, graphEdges, planningGraphEdges, groups),
+        packet_size: {
+            single_task_packets: packets.filter((packet) => packet.task_ids.length === 1).length,
+            multi_task_packets: packets.filter((packet) => packet.task_ids.length > 1).length,
+            max_tasks_per_packet: packets.length > 0 ? Math.max(...packets.map((packet) => packet.task_ids.length)) : 0,
+            max_files_per_packet: packets.length > 0 ? Math.max(...packets.map((packet) => packet.file_paths.length)) : 0,
+        },
+    };
+}
+//# sourceMappingURL=reviewPacketMetrics.js.map