audit-tools 0.28.0

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

@@ -0,0 +1,154 @@
+import { z } from "zod";
+import type { AuditTask } from "../types.js";
+import type { GraphBundle } from "audit-tools/shared";
+export declare const TaskAffinityEdgeKindSchema: z.ZodEnum<["shared_file", "cross_lens_same_file", "same_flow", "same_unit", "call_adjacent", "same_dir"]>;
+export type TaskAffinityEdgeKind = z.infer<typeof TaskAffinityEdgeKindSchema>;
+export declare const TaskAffinityNodeSchema: z.ZodObject<{
+    task_id: z.ZodString;
+    unit_id: z.ZodString;
+    lens: z.ZodString;
+    file_paths: z.ZodArray<z.ZodString, "many">;
+    /** Frozen byte-based content-token estimate (from the task). */
+    token_estimate: z.ZodNumber;
+    /** Frozen audit-risk score in [0,1] (from the task). */
+    risk_estimate: z.ZodNumber;
+}, "strict", z.ZodTypeAny, {
+    unit_id: string;
+    lens: string;
+    task_id: string;
+    file_paths: string[];
+    token_estimate: number;
+    risk_estimate: number;
+}, {
+    unit_id: string;
+    lens: string;
+    task_id: string;
+    file_paths: string[];
+    token_estimate: number;
+    risk_estimate: number;
+}>;
+export type TaskAffinityNode = z.infer<typeof TaskAffinityNodeSchema>;
+export declare const TaskAffinityEdgeSchema: z.ZodObject<{
+    /** task_id of one endpoint (undirected; emitted once, from < to). */
+    from: z.ZodString;
+    to: z.ZodString;
+    /** Dominant relatedness kind (the one contributing the max weight). */
+    kind: z.ZodEnum<["shared_file", "cross_lens_same_file", "same_flow", "same_unit", "call_adjacent", "same_dir"]>;
+    /** Affinity weight in [0,1]; higher = pack together first. */
+    weight: z.ZodNumber;
+    /** All contributing kinds (+ "same_lens" bonus), for transparency. */
+    reason: z.ZodOptional<z.ZodString>;
+}, "strict", z.ZodTypeAny, {
+    kind: "shared_file" | "cross_lens_same_file" | "same_flow" | "same_unit" | "call_adjacent" | "same_dir";
+    from: string;
+    to: string;
+    weight: number;
+    reason?: string | undefined;
+}, {
+    kind: "shared_file" | "cross_lens_same_file" | "same_flow" | "same_unit" | "call_adjacent" | "same_dir";
+    from: string;
+    to: string;
+    weight: number;
+    reason?: string | undefined;
+}>;
+export type TaskAffinityEdge = z.infer<typeof TaskAffinityEdgeSchema>;
+export declare const TaskAffinityGraphSchema: z.ZodObject<{
+    schema_version: z.ZodLiteral<"task-affinity-graph/v1">;
+    nodes: z.ZodArray<z.ZodObject<{
+        task_id: z.ZodString;
+        unit_id: z.ZodString;
+        lens: z.ZodString;
+        file_paths: z.ZodArray<z.ZodString, "many">;
+        /** Frozen byte-based content-token estimate (from the task). */
+        token_estimate: z.ZodNumber;
+        /** Frozen audit-risk score in [0,1] (from the task). */
+        risk_estimate: z.ZodNumber;
+    }, "strict", z.ZodTypeAny, {
+        unit_id: string;
+        lens: string;
+        task_id: string;
+        file_paths: string[];
+        token_estimate: number;
+        risk_estimate: number;
+    }, {
+        unit_id: string;
+        lens: string;
+        task_id: string;
+        file_paths: string[];
+        token_estimate: number;
+        risk_estimate: number;
+    }>, "many">;
+    edges: z.ZodArray<z.ZodObject<{
+        /** task_id of one endpoint (undirected; emitted once, from < to). */
+        from: z.ZodString;
+        to: z.ZodString;
+        /** Dominant relatedness kind (the one contributing the max weight). */
+        kind: z.ZodEnum<["shared_file", "cross_lens_same_file", "same_flow", "same_unit", "call_adjacent", "same_dir"]>;
+        /** Affinity weight in [0,1]; higher = pack together first. */
+        weight: z.ZodNumber;
+        /** All contributing kinds (+ "same_lens" bonus), for transparency. */
+        reason: z.ZodOptional<z.ZodString>;
+    }, "strict", z.ZodTypeAny, {
+        kind: "shared_file" | "cross_lens_same_file" | "same_flow" | "same_unit" | "call_adjacent" | "same_dir";
+        from: string;
+        to: string;
+        weight: number;
+        reason?: string | undefined;
+    }, {
+        kind: "shared_file" | "cross_lens_same_file" | "same_flow" | "same_unit" | "call_adjacent" | "same_dir";
+        from: string;
+        to: string;
+        weight: number;
+        reason?: string | undefined;
+    }>, "many">;
+}, "strict", z.ZodTypeAny, {
+    schema_version: "task-affinity-graph/v1";
+    nodes: {
+        unit_id: string;
+        lens: string;
+        task_id: string;
+        file_paths: string[];
+        token_estimate: number;
+        risk_estimate: number;
+    }[];
+    edges: {
+        kind: "shared_file" | "cross_lens_same_file" | "same_flow" | "same_unit" | "call_adjacent" | "same_dir";
+        from: string;
+        to: string;
+        weight: number;
+        reason?: string | undefined;
+    }[];
+}, {
+    schema_version: "task-affinity-graph/v1";
+    nodes: {
+        unit_id: string;
+        lens: string;
+        task_id: string;
+        file_paths: string[];
+        token_estimate: number;
+        risk_estimate: number;
+    }[];
+    edges: {
+        kind: "shared_file" | "cross_lens_same_file" | "same_flow" | "same_unit" | "call_adjacent" | "same_dir";
+        from: string;
+        to: string;
+        weight: number;
+        reason?: string | undefined;
+    }[];
+}>;
+export type TaskAffinityGraph = z.infer<typeof TaskAffinityGraphSchema>;
+/**
+ * Restrict a task-affinity graph to a set of task ids, keeping only nodes whose
+ * task survives and edges whose both endpoints survive. Used at dispatch to
+ * partition only the still-pending tasks from a persisted full-run graph.
+ */
+export declare function filterTaskAffinityGraph(graph: TaskAffinityGraph, keep: ReadonlySet<string>): TaskAffinityGraph;
+/**
+ * Build the provider-neutral task-affinity graph from frozen tasks. Each task
+ * must already carry `token_estimate` and `risk_estimate` (planning freezes
+ * them); missing values default to 0 so the graph is always well-formed.
+ */
+export declare function buildTaskAffinityGraph(tasks: ReadonlyArray<AuditTask>, options?: {
+    graphBundle?: GraphBundle;
+}): TaskAffinityGraph;
+//# sourceMappingURL=taskAffinityGraph.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"taskAffinityGraph.d.ts","sourceRoot":"","sources":["../../../src/audit/orchestrator/taskAffinityGraph.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,CAAC,EAAE,MAAM,KAAK,CAAC;AACxB,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,aAAa,CAAC;AAC7C,OAAO,KAAK,EAAE,WAAW,EAAa,MAAM,oBAAoB,CAAC;AAiBjE,eAAO,MAAM,0BAA0B,2GAOrC,CAAC;AACH,MAAM,MAAM,oBAAoB,GAAG,CAAC,CAAC,KAAK,CAAC,OAAO,0BAA0B,CAAC,CAAC;AAE9E,eAAO,MAAM,sBAAsB;;;;;IAM/B,gEAAgE;;IAEhE,wDAAwD;;;;;;;;;;;;;;;;EAGjD,CAAC;AACZ,MAAM,MAAM,gBAAgB,GAAG,CAAC,CAAC,KAAK,CAAC,OAAO,sBAAsB,CAAC,CAAC;AAEtE,eAAO,MAAM,sBAAsB;IAE/B,qEAAqE;;;IAGrE,uEAAuE;;IAEvE,8DAA8D;;IAE9D,sEAAsE;;;;;;;;;;;;;;EAG/D,CAAC;AACZ,MAAM,MAAM,gBAAgB,GAAG,CAAC,CAAC,KAAK,CAAC,OAAO,sBAAsB,CAAC,CAAC;AAEtE,eAAO,MAAM,uBAAuB;;;;;;;QAvBhC,gEAAgE;;QAEhE,wDAAwD;;;;;;;;;;;;;;;;;;QAQxD,qEAAqE;;;QAGrE,uEAAuE;;QAEvE,8DAA8D;;QAE9D,sEAAsE;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;EAY/D,CAAC;AACZ,MAAM,MAAM,iBAAiB,GAAG,CAAC,CAAC,KAAK,CAAC,OAAO,uBAAuB,CAAC,CAAC;AAExE;;;;GAIG;AACH,wBAAgB,uBAAuB,CACrC,KAAK,EAAE,iBAAiB,EACxB,IAAI,EAAE,WAAW,CAAC,MAAM,CAAC,GACxB,iBAAiB,CAKnB;AAsED;;;;GAIG;AACH,wBAAgB,sBAAsB,CACpC,KAAK,EAAE,aAAa,CAAC,SAAS,CAAC,EAC/B,OAAO,GAAE;IAAE,WAAW,CAAC,EAAE,WAAW,CAAA;CAAO,GAC1C,iBAAiB,CAkFnB"}

package/dist/audit/orchestrator/taskAffinityGraph.js

@@ -0,0 +1,216 @@
+import { z } from "zod";
+// ---------------------------------------------------------------------------
+// Task-affinity graph (Phase A of the plan/dispatch seam).
+//
+// Nodes are audit tasks carrying their FROZEN provider-neutral estimates;
+// edges express SOFT, weighted relatedness between tasks. This graph is the
+// persisted, provider-neutral planning artifact. It encodes no model, packet,
+// tier, or concurrency decision. At dispatch time a provider partitions this
+// graph into packets just-in-time, under its own model's context + risk-mass
+// ceilings (see docs/audit-workflow-design.md).
+//
+// Reuses the language-neutral edge contract shape (from/to/kind/weight/reason)
+// and is kept DISTINCT from graph_bundle.json (which is code structure, not
+// tasks).
+// ---------------------------------------------------------------------------
+export const TaskAffinityEdgeKindSchema = z.enum([
+    "shared_file",
+    "cross_lens_same_file",
+    "same_flow",
+    "same_unit",
+    "call_adjacent",
+    "same_dir",
+]);
+export const TaskAffinityNodeSchema = z
+    .object({
+    task_id: z.string(),
+    unit_id: z.string(),
+    lens: z.string(),
+    file_paths: z.array(z.string()),
+    /** Frozen byte-based content-token estimate (from the task). */
+    token_estimate: z.number(),
+    /** Frozen audit-risk score in [0,1] (from the task). */
+    risk_estimate: z.number(),
+})
+    .strict();
+export const TaskAffinityEdgeSchema = z
+    .object({
+    /** task_id of one endpoint (undirected; emitted once, from < to). */
+    from: z.string(),
+    to: z.string(),
+    /** Dominant relatedness kind (the one contributing the max weight). */
+    kind: TaskAffinityEdgeKindSchema,
+    /** Affinity weight in [0,1]; higher = pack together first. */
+    weight: z.number(),
+    /** All contributing kinds (+ "same_lens" bonus), for transparency. */
+    reason: z.string().optional(),
+})
+    .strict();
+export const TaskAffinityGraphSchema = z
+    .object({
+    schema_version: z.literal("task-affinity-graph/v1"),
+    nodes: z.array(TaskAffinityNodeSchema),
+    edges: z.array(TaskAffinityEdgeSchema),
+})
+    .strict();
+/**
+ * Restrict a task-affinity graph to a set of task ids, keeping only nodes whose
+ * task survives and edges whose both endpoints survive. Used at dispatch to
+ * partition only the still-pending tasks from a persisted full-run graph.
+ */
+export function filterTaskAffinityGraph(graph, keep) {
+    const nodes = graph.nodes.filter((n) => keep.has(n.task_id));
+    const have = new Set(nodes.map((n) => n.task_id));
+    const edges = graph.edges.filter((e) => have.has(e.from) && have.has(e.to));
+    return { schema_version: graph.schema_version, nodes, edges };
+}
+// Per-kind base weights. Tuned so stronger structural coupling packs first.
+const KIND_WEIGHT = {
+    shared_file: 0.9,
+    cross_lens_same_file: 0.85,
+    same_flow: 0.6,
+    same_unit: 0.55,
+    call_adjacent: 0.4,
+    same_dir: 0.35,
+};
+// Small additive nudge when two related tasks also share a lens (a single agent
+// reviewing one lens benefits from shared mental model). Never a standalone edge.
+const SAME_LENS_BONUS = 0.05;
+function dirOf(path) {
+    const norm = path.replace(/\\/g, "/");
+    const idx = norm.lastIndexOf("/");
+    return idx === -1 ? "" : norm.slice(0, idx);
+}
+function flowIdsOf(task) {
+    const out = new Set();
+    for (const tag of task.tags ?? []) {
+        if (tag.startsWith("critical_flow:"))
+            out.add(tag.slice("critical_flow:".length));
+    }
+    return out;
+}
+function looksLikePath(value) {
+    return value.includes("/") || value.includes("\\");
+}
+/**
+ * Build a file → adjacent-files map from the code-structure graph bundle's
+ * import/call/reference edges. Only path-like endpoints are used, so this
+ * degrades gracefully to "no call-adjacency edges" when the bundle's nodes are
+ * symbol ids rather than file paths.
+ */
+function buildFileAdjacency(graphBundle) {
+    const adjacency = new Map();
+    if (!graphBundle)
+        return adjacency;
+    const edgeGroups = [
+        graphBundle.graphs.imports,
+        graphBundle.graphs.calls,
+        graphBundle.graphs.references,
+    ];
+    const link = (a, b) => {
+        if (!adjacency.has(a))
+            adjacency.set(a, new Set());
+        adjacency.get(a).add(b);
+    };
+    for (const edges of edgeGroups) {
+        if (!Array.isArray(edges))
+            continue;
+        for (const edge of edges) {
+            if (!edge || !looksLikePath(edge.from) || !looksLikePath(edge.to))
+                continue;
+            const a = edge.from.replace(/\\/g, "/");
+            const b = edge.to.replace(/\\/g, "/");
+            if (a === b)
+                continue;
+            link(a, b);
+            link(b, a);
+        }
+    }
+    return adjacency;
+}
+function intersects(a, b) {
+    for (const item of b)
+        if (a.has(item))
+            return true;
+    return false;
+}
+/**
+ * Build the provider-neutral task-affinity graph from frozen tasks. Each task
+ * must already carry `token_estimate` and `risk_estimate` (planning freezes
+ * them); missing values default to 0 so the graph is always well-formed.
+ */
+export function buildTaskAffinityGraph(tasks, options = {}) {
+    const nodes = tasks.map((task) => ({
+        task_id: task.task_id,
+        unit_id: task.unit_id,
+        lens: task.lens,
+        file_paths: task.file_paths,
+        token_estimate: task.token_estimate ?? 0,
+        risk_estimate: task.risk_estimate ?? 0,
+    }));
+    const adjacency = buildFileAdjacency(options.graphBundle);
+    // Precompute per-task derived sets to keep the O(n^2) pass cheap.
+    const fileSets = tasks.map((t) => new Set(t.file_paths.map((p) => p.replace(/\\/g, "/"))));
+    const dirSets = tasks.map((t) => new Set(t.file_paths.map((p) => dirOf(p))));
+    const flowSets = tasks.map((t) => flowIdsOf(t));
+    const neighborSets = tasks.map((t) => {
+        const out = new Set();
+        for (const p of t.file_paths) {
+            const adj = adjacency.get(p.replace(/\\/g, "/"));
+            if (adj)
+                for (const n of adj)
+                    out.add(n);
+        }
+        return out;
+    });
+    const edges = [];
+    for (let i = 0; i < tasks.length; i++) {
+        for (let j = i + 1; j < tasks.length; j++) {
+            const kinds = [];
+            const sharesFile = intersects(fileSets[i], fileSets[j]);
+            if (sharesFile) {
+                // Same file(s), different lens → a single agent could cover both lenses.
+                kinds.push(tasks[i].lens !== tasks[j].lens ? "cross_lens_same_file" : "shared_file");
+            }
+            if (flowSets[i].size > 0 && intersects(flowSets[i], flowSets[j])) {
+                kinds.push("same_flow");
+            }
+            if (tasks[i].unit_id === tasks[j].unit_id)
+                kinds.push("same_unit");
+            if (neighborSets[i].size > 0 &&
+                (intersects(neighborSets[i], fileSets[j]) ||
+                    intersects(neighborSets[j], fileSets[i]))) {
+                kinds.push("call_adjacent");
+            }
+            if (intersects(dirSets[i], dirSets[j]))
+                kinds.push("same_dir");
+            if (kinds.length === 0)
+                continue;
+            let dominant = kinds[0];
+            let weight = KIND_WEIGHT[dominant];
+            for (const k of kinds) {
+                if (KIND_WEIGHT[k] > weight) {
+                    weight = KIND_WEIGHT[k];
+                    dominant = k;
+                }
+            }
+            const reasons = [...kinds];
+            if (tasks[i].lens === tasks[j].lens) {
+                weight = Math.min(1, weight + SAME_LENS_BONUS);
+                reasons.push("same_lens");
+            }
+            const [from, to] = tasks[i].task_id < tasks[j].task_id
+                ? [tasks[i].task_id, tasks[j].task_id]
+                : [tasks[j].task_id, tasks[i].task_id];
+            edges.push({
+                from,
+                to,
+                kind: dominant,
+                weight: Math.round(weight * 1000) / 1000,
+                reason: reasons.join(","),
+            });
+        }
+    }
+    return { schema_version: "task-affinity-graph/v1", nodes, edges };
+}
+//# sourceMappingURL=taskAffinityGraph.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"taskAffinityGraph.js","sourceRoot":"","sources":["../../../src/audit/orchestrator/taskAffinityGraph.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,CAAC,EAAE,MAAM,KAAK,CAAC;AAIxB,8EAA8E;AAC9E,2DAA2D;AAC3D,EAAE;AACF,0EAA0E;AAC1E,4EAA4E;AAC5E,8EAA8E;AAC9E,6EAA6E;AAC7E,6EAA6E;AAC7E,gDAAgD;AAChD,EAAE;AACF,+EAA+E;AAC/E,4EAA4E;AAC5E,UAAU;AACV,8EAA8E;AAE9E,MAAM,CAAC,MAAM,0BAA0B,GAAG,CAAC,CAAC,IAAI,CAAC;IAC/C,aAAa;IACb,sBAAsB;IACtB,WAAW;IACX,WAAW;IACX,eAAe;IACf,UAAU;CACX,CAAC,CAAC;AAGH,MAAM,CAAC,MAAM,sBAAsB,GAAG,CAAC;KACpC,MAAM,CAAC;IACN,OAAO,EAAE,CAAC,CAAC,MAAM,EAAE;IACnB,OAAO,EAAE,CAAC,CAAC,MAAM,EAAE;IACnB,IAAI,EAAE,CAAC,CAAC,MAAM,EAAE;IAChB,UAAU,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC;IAC/B,gEAAgE;IAChE,cAAc,EAAE,CAAC,CAAC,MAAM,EAAE;IAC1B,wDAAwD;IACxD,aAAa,EAAE,CAAC,CAAC,MAAM,EAAE;CAC1B,CAAC;KACD,MAAM,EAAE,CAAC;AAGZ,MAAM,CAAC,MAAM,sBAAsB,GAAG,CAAC;KACpC,MAAM,CAAC;IACN,qEAAqE;IACrE,IAAI,EAAE,CAAC,CAAC,MAAM,EAAE;IAChB,EAAE,EAAE,CAAC,CAAC,MAAM,EAAE;IACd,uEAAuE;IACvE,IAAI,EAAE,0BAA0B;IAChC,8DAA8D;IAC9D,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE;IAClB,sEAAsE;IACtE,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,EAAE;CAC9B,CAAC;KACD,MAAM,EAAE,CAAC;AAGZ,MAAM,CAAC,MAAM,uBAAuB,GAAG,CAAC;KACrC,MAAM,CAAC;IACN,cAAc,EAAE,CAAC,CAAC,OAAO,CAAC,wBAAwB,CAAC;IACnD,KAAK,EAAE,CAAC,CAAC,KAAK,CAAC,sBAAsB,CAAC;IACtC,KAAK,EAAE,CAAC,CAAC,KAAK,CAAC,sBAAsB,CAAC;CACvC,CAAC;KACD,MAAM,EAAE,CAAC;AAGZ;;;;GAIG;AACH,MAAM,UAAU,uBAAuB,CACrC,KAAwB,EACxB,IAAyB;IAEzB,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC;IAC7D,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC;IAClD,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC5E,OAAO,EAAE,cAAc,EAAE,KAAK,CAAC,cAAc,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC;AAChE,CAAC;AAED,4EAA4E;AAC5E,MAAM,WAAW,GAAyC;IACxD,WAAW,EAAE,GAAG;IAChB,oBAAoB,EAAE,IAAI;IAC1B,SAAS,EAAE,GAAG;IACd,SAAS,EAAE,IAAI;IACf,aAAa,EAAE,GAAG;IAClB,QAAQ,EAAE,IAAI;CACf,CAAC;AACF,gFAAgF;AAChF,kFAAkF;AAClF,MAAM,eAAe,GAAG,IAAI,CAAC;AAE7B,SAAS,KAAK,CAAC,IAAY;IACzB,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;IACtC,MAAM,GAAG,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC;IAClC,OAAO,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;AAC9C,CAAC;AAED,SAAS,SAAS,CAAC,IAAe;IAChC,MAAM,GAAG,GAAG,IAAI,GAAG,EAAU,CAAC;IAC9B,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,IAAI,IAAI,EAAE,EAAE,CAAC;QAClC,IAAI,GAAG,CAAC,UAAU,CAAC,gBAAgB,CAAC;YAAE,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,gBAAgB,CAAC,MAAM,CAAC,CAAC,CAAC;IACpF,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,SAAS,aAAa,CAAC,KAAa;IAClC,OAAO,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;AACrD,CAAC;AAED;;;;;GAKG;AACH,SAAS,kBAAkB,CAAC,WAAyB;IACnD,MAAM,SAAS,GAAG,IAAI,GAAG,EAAuB,CAAC;IACjD,IAAI,CAAC,WAAW;QAAE,OAAO,SAAS,CAAC;IACnC,MAAM,UAAU,GAAmC;QACjD,WAAW,CAAC,MAAM,CAAC,OAAO;QAC1B,WAAW,CAAC,MAAM,CAAC,KAAK;QACxB,WAAW,CAAC,MAAM,CAAC,UAAU;KAC9B,CAAC;IACF,MAAM,IAAI,GAAG,CAAC,CAAS,EAAE,CAAS,EAAE,EAAE;QACpC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC;YAAE,SAAS,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;QACnD,SAAS,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IAC3B,CAAC,CAAC;IACF,KAAK,MAAM,KAAK,IAAI,UAAU,EAAE,CAAC;QAC/B,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC;YAAE,SAAS;QACpC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,IAAI,CAAC,IAAI,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,EAAE,CAAC;gBAAE,SAAS;YAC5E,MAAM,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;YACxC,MAAM,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;YACtC,IAAI,CAAC,KAAK,CAAC;gBAAE,SAAS;YACtB,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YACX,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACb,CAAC;IACH,CAAC;IACD,OAAO,SAAS,CAAC;AACnB,CAAC;AAED,SAAS,UAAU,CAAI,CAAS,EAAE,CAAc;IAC9C,KAAK,MAAM,IAAI,IAAI,CAAC;QAAE,IAAI,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC;YAAE,OAAO,IAAI,CAAC;IACnD,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,sBAAsB,CACpC,KAA+B,EAC/B,UAAyC,EAAE;IAE3C,MAAM,KAAK,GAAuB,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;QACrD,OAAO,EAAE,IAAI,CAAC,OAAO;QACrB,OAAO,EAAE,IAAI,CAAC,OAAO;QACrB,IAAI,EAAE,IAAI,CAAC,IAAI;QACf,UAAU,EAAE,IAAI,CAAC,UAAU;QAC3B,cAAc,EAAE,IAAI,CAAC,cAAc,IAAI,CAAC;QACxC,aAAa,EAAE,IAAI,CAAC,aAAa,IAAI,CAAC;KACvC,CAAC,CAAC,CAAC;IAEJ,MAAM,SAAS,GAAG,kBAAkB,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC;IAC1D,kEAAkE;IAClE,MAAM,QAAQ,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IAC3F,MAAM,OAAO,GAAG,KAAK,CAAC,GAAG,CACvB,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAClD,CAAC;IACF,MAAM,QAAQ,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;IAChD,MAAM,YAAY,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE;QACnC,MAAM,GAAG,GAAG,IAAI,GAAG,EAAU,CAAC;QAC9B,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,UAAU,EAAE,CAAC;YAC7B,MAAM,GAAG,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC,CAAC;YACjD,IAAI,GAAG;gBAAE,KAAK,MAAM,CAAC,IAAI,GAAG;oBAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAC3C,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC,CAAC,CAAC;IAEH,MAAM,KAAK,GAAuB,EAAE,CAAC;IACrC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACtC,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC1C,MAAM,KAAK,GAA2B,EAAE,CAAC;YAEzC,MAAM,UAAU,GAAG,UAAU,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;YACxD,IAAI,UAAU,EAAE,CAAC;gBACf,yEAAyE;gBACzE,KAAK,CAAC,IAAI,CACR,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,sBAAsB,CAAC,CAAC,CAAC,aAAa,CACzE,CAAC;YACJ,CAAC;YACD,IAAI,QAAQ,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,IAAI,UAAU,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;gBACjE,KAAK,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;YAC1B,CAAC;YACD,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,OAAO,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,OAAO;gBAAE,KAAK,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;YACnE,IACE,YAAY,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC;gBACxB,CAAC,UAAU,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC;oBACvC,UAAU,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,EAC3C,CAAC;gBACD,KAAK,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC;YAC9B,CAAC;YACD,IAAI,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC;gBAAE,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;YAE/D,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;gBAAE,SAAS;YAEjC,IAAI,QAAQ,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;YACxB,IAAI,MAAM,GAAG,WAAW,CAAC,QAAQ,CAAC,CAAC;YACnC,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;gBACtB,IAAI,WAAW,CAAC,CAAC,CAAC,GAAG,MAAM,EAAE,CAAC;oBAC5B,MAAM,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC;oBACxB,QAAQ,GAAG,CAAC,CAAC;gBACf,CAAC;YACH,CAAC;YACD,MAAM,OAAO,GAAa,CAAC,GAAG,KAAK,CAAC,CAAC;YACrC,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;gBACpC,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,GAAG,eAAe,CAAC,CAAC;gBAC/C,OAAO,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;YAC5B,CAAC;YAED,MAAM,CAAC,IAAI,EAAE,EAAE,CAAC,GACd,KAAK,CAAC,CAAC,CAAC,CAAC,OAAO,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,OAAO;gBACjC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC;gBACtC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC;YAC3C,KAAK,CAAC,IAAI,CAAC;gBACT,IAAI;gBACJ,EAAE;gBACF,IAAI,EAAE,QAAQ;gBACd,MAAM,EAAE,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,IAAI,CAAC,GAAG,IAAI;gBACxC,MAAM,EAAE,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC;aAC1B,CAAC,CAAC;QACL,CAAC;IACH,CAAC;IAED,OAAO,EAAE,cAAc,EAAE,wBAAwB,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC;AACpE,CAAC"}

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

@@ -0,0 +1,43 @@
+import type { ExternalAnalyzerResults } from "../types/externalAnalyzer.js";
+import type { AuditTask, CoverageMatrix } from "../types.js";
+import type { CriticalFlowManifest } from "audit-tools/shared";
+export interface UnitLineIndex {
+    [path: string]: number;
+}
+export interface BuildChunkedTaskOptions {
+    /**
+     * Line count above which a single file gets its own task rather than being
+     * grouped with the rest of its unit. Default: `DEFAULT_FILE_SPLIT_THRESHOLD`
+     * (5000). Set to 0 to disable splitting entirely.
+     */
+    file_split_threshold?: number;
+    /**
+     * Approximate total line budget for a review task. Multi-file blocks above
+     * this budget are split into multiple bounded review tasks. Default: 1500.
+     * Set to 0 to disable aggregate line-budget splitting.
+     */
+    max_task_lines?: number;
+    /**
+     * Maximum number of files in one review task. Default: 0 (disabled).
+     * Token budget (max_task_lines) is the real constraint; file-count splitting
+     * is off by default. Set to a positive integer to re-enable.
+     */
+    max_task_files?: number;
+    /**
+     * Test files at or below this size can be batched across unit boundaries.
+     * Default: 250. Set to 0 to disable tiny-test batching.
+     */
+    tiny_test_file_lines?: number;
+    limit_lenses?: string[];
+    /**
+     * Lenses whose tasks should have their priority elevated by one tier
+     * (low→medium, medium→high). Derived from free_form_intent at planning time;
+     * never promoted above 'high'.
+     */
+    intent_priority_boost?: string[];
+    external_analyzer_results?: ExternalAnalyzerResults;
+    critical_flows?: CriticalFlowManifest;
+}
+export declare function buildChunkedAuditTasks(coverageMatrix: CoverageMatrix, unitLineIndex: UnitLineIndex, options?: BuildChunkedTaskOptions): AuditTask[];
+export declare function buildExternalSignalTasks(coverageMatrix: CoverageMatrix, _unitLineIndex: UnitLineIndex, externalAnalyzerResults?: ExternalAnalyzerResults): AuditTask[];
+//# sourceMappingURL=taskBuilder.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"taskBuilder.d.ts","sourceRoot":"","sources":["../../../src/audit/orchestrator/taskBuilder.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,uBAAuB,EAAE,MAAM,8BAA8B,CAAC;AAC5E,OAAO,KAAK,EACV,SAAS,EACT,cAAc,EAEf,MAAM,aAAa,CAAC;AACrB,OAAO,KAAK,EAAE,oBAAoB,EAAE,MAAM,oBAAoB,CAAC;AAS/D,MAAM,WAAW,aAAa;IAC5B,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,CAAC;CACxB;AAED,MAAM,WAAW,uBAAuB;IACtC;;;;OAIG;IACH,oBAAoB,CAAC,EAAE,MAAM,CAAC;IAC9B;;;;OAIG;IACH,cAAc,CAAC,EAAE,MAAM,CAAC;IACxB;;;;OAIG;IACH,cAAc,CAAC,EAAE,MAAM,CAAC;IACxB;;;OAGG;IACH,oBAAoB,CAAC,EAAE,MAAM,CAAC;IAC9B,YAAY,CAAC,EAAE,MAAM,EAAE,CAAC;IACxB;;;;OAIG;IACH,qBAAqB,CAAC,EAAE,MAAM,EAAE,CAAC;IACjC,yBAAyB,CAAC,EAAE,uBAAuB,CAAC;IACpD,cAAc,CAAC,EAAE,oBAAoB,CAAC;CACvC;AAiVD,wBAAgB,sBAAsB,CACpC,cAAc,EAAE,cAAc,EAC9B,aAAa,EAAE,aAAa,EAC5B,OAAO,GAAE,uBAA4B,GACpC,SAAS,EAAE,CAuFb;AAOD,wBAAgB,wBAAwB,CACtC,cAAc,EAAE,cAAc,EAC9B,cAAc,EAAE,aAAa,EAC7B,uBAAuB,CAAC,EAAE,uBAAuB,GAChD,SAAS,EAAE,CA0Cb"}