audit-tools 0.28.0

package/dist/audit/cli/mergeAndIngestCommand.js

@@ -0,0 +1,541 @@
+import { readFile, readdir, rm } from "node:fs/promises";
+import { join, resolve } from "node:path";
+import { isFileMissingError, mapWithConcurrency, readJsonFile, writeJsonFile } from "audit-tools/shared";
+import { validateAuditResults } from "../validation/auditResults.js";
+import { verifyFindingGrounding } from "../validation/quoteGrounding.js";
+import { ANCHOR_GROUNDING_CONCURRENCY, anchorEvidenceLine, combineGroundingWithAnchor, verifyFindingAnchor, } from "../validation/anchorGrounding.js";
+import { runAuditStep } from "./auditStep.js";
+import { DISPATCH_RESULT_MAP_FILENAME, ACTIVE_DISPATCH_FILENAME, loadDispatchResultMap, entriesByTaskId, buildPendingAuditTasks, } from "./dispatch.js";
+import { addFileLineCountHints } from "./lineIndex.js";
+import { isCanonicalResultFilename, getArtifactsDir, getFlag } from "./args.js";
+import { buildWorkerResult } from "./workerResult.js";
+import { PACKET_SCHEMA_FILENAMES } from "../io/runArtifacts.js";
+// Schema pointer files prepare-dispatch copies into task-results/ for optional
+// worker self-validation. They are expected, not stray — skip them when
+// scanning for spurious files.
+const PACKET_SCHEMA_FILENAME_SET = new Set(PACKET_SCHEMA_FILENAMES);
+/**
+ * Canonical key for a finding used to detect cross-packet duplicates.
+ * Stable across result ordering: lens + category + title + first affected file.
+ */
+function findingKey(f) {
+    return [
+        (f.lens ?? "").trim().toLowerCase(),
+        (f.category ?? "").trim().toLowerCase(),
+        (f.title ?? "").trim().toLowerCase(),
+        f.affected_files?.[0]?.path ?? "",
+    ].join("|");
+}
+/**
+ * Scan the accepted results and warn when findings share the same canonical key
+ * across different packets. All results are in memory at merge time, so this
+ * check is more accurate than the per-packet early-warning that previously lived
+ * in submit-packet.
+ */
+function warnOnDuplicateFindings(passing) {
+    const seenKeys = new Map(); // key → task_id
+    let dupCount = 0;
+    for (const result of passing) {
+        for (const f of result.findings ?? []) {
+            const key = findingKey(f);
+            const prior = seenKeys.get(key);
+            if (prior) {
+                dupCount++;
+            }
+            else {
+                seenKeys.set(key, result.task_id);
+            }
+        }
+    }
+    if (dupCount > 0) {
+        process.stderr.write(`[merge-and-ingest] Warning: ${dupCount} finding(s) appear to duplicate findings across packets in this run.\n`);
+    }
+}
+/**
+ * Index every task_id that has an on-disk result in task-results/, regardless of
+ * filename convention — packet `.inline-result.json` arrays, canonical per-task
+ * files, or a stray name. The host writes one array file per packet, so a per-
+ * task canonical-name probe never finds these; recovering by task_id matches how
+ * the main ingest path collects results.
+ */
+async function taskIdsWithOnDiskResults(taskResultsDir) {
+    let files;
+    try {
+        files = (await readdir(taskResultsDir)).filter((f) => f.endsWith(".json"));
+    }
+    catch {
+        return new Set();
+    }
+    const ids = new Set();
+    for (const filename of files) {
+        if (PACKET_SCHEMA_FILENAME_SET.has(filename))
+            continue;
+        try {
+            const parsed = JSON.parse(await readFile(join(taskResultsDir, filename), "utf8"));
+            for (const item of Array.isArray(parsed) ? parsed : [parsed]) {
+                if (item && typeof item === "object" && !Array.isArray(item)) {
+                    const tid = item.task_id;
+                    if (typeof tid === "string")
+                        ids.add(tid);
+                }
+            }
+        }
+        catch {
+            /* not parseable — skip */
+        }
+    }
+    return ids;
+}
+/**
+ * Check for a completed-run marker and either replay its summary (no-op) or
+ * invalidate a stale marker and signal to re-process.
+ *
+ * Returns the prior summary object when the run is definitively terminal
+ * (caller should replay and return), or null when processing must continue.
+ */
+async function checkIdempotencyReplay(runId, mergeCompletePath, tasksPath, taskResultsDir) {
+    let priorSummary = null;
+    try {
+        priorSummary = await readJsonFile(mergeCompletePath);
+    }
+    catch (e) {
+        if (!isFileMissingError(e))
+            throw e;
+    }
+    if (!priorSummary)
+        return null;
+    // A completion marker can go stale. Selective deepening appends new pending
+    // tasks to the SAME run-id, and their answers then land on disk (in this
+    // round's packet result files) while the marker still says the run is done.
+    // If any pending task has a recoverable on-disk result — matched by task_id,
+    // the same way the main ingest path recovers them — the marker no longer
+    // reflects reality: discard it and re-process so those answers ingest instead
+    // of replaying a no-op forever. A genuinely terminal run (no pending tasks, or
+    // pending tasks not yet answered) still replays cleanly.
+    let pendingWithResults = 0;
+    try {
+        const pending = await readJsonFile(tasksPath);
+        const answered = await taskIdsWithOnDiskResults(taskResultsDir);
+        for (const task of pending) {
+            if (answered.has(task.task_id)) {
+                pendingWithResults++;
+            }
+        }
+    }
+    catch { /* no pending-tasks file — treat as terminal and replay */ }
+    if (pendingWithResults === 0) {
+        return priorSummary;
+    }
+    process.stderr.write(`[merge-and-ingest] completion marker for ${runId} is stale: ` +
+        `${pendingWithResults} pending task(s) have un-ingested on-disk results; re-processing.\n`);
+    await rm(mergeCompletePath, { force: true });
+    return null;
+}
+/**
+ * Scan the task-results/ directory to build a fallback lookup table keyed by
+ * task_id from files that are NOT in the expected result-path set for this
+ * round. Also tracks spurious (non-canonical) filenames for warning output.
+ *
+ * Returns both the fallback map and the list of spurious filenames.
+ */
+async function scanTaskResults(taskResultsDir, expectedPaths) {
+    let files;
+    try {
+        files = (await readdir(taskResultsDir)).filter(f => f.endsWith(".json")).sort();
+    }
+    catch {
+        files = [];
+    }
+    const fallbackByTaskId = new Map();
+    const spuriousFiles = [];
+    for (const filename of files) {
+        // Schema pointer files (audit_result/finding/audit_task .schema.json) are
+        // copied into task-results/ by prepare-dispatch for optional worker
+        // self-validation; they are expected, not stray.
+        if (PACKET_SCHEMA_FILENAME_SET.has(filename))
+            continue;
+        const filePath = resolve(join(taskResultsDir, filename));
+        if (expectedPaths.has(filePath))
+            continue;
+        // Not part of this round's plan. Still read it so a current task can be
+        // recovered by task_id (e.g. a subagent wrote a valid result under a
+        // non-assigned name, or wrote an inline AuditResult[] array to a packet
+        // result file). Expand top-level arrays element-by-element so a worker
+        // that emits an AuditResult[] payload can be recovered by task_id (INV-01).
+        try {
+            const raw = await readFile(filePath, "utf8");
+            const parsed = JSON.parse(raw);
+            const candidates = Array.isArray(parsed) ? parsed : [parsed];
+            for (const item of candidates) {
+                if (!item || typeof item !== "object" || Array.isArray(item))
+                    continue;
+                const tid = typeof item.task_id === "string"
+                    ? String(item.task_id) : undefined;
+                if (tid && !fallbackByTaskId.has(tid)) {
+                    fallbackByTaskId.set(tid, item);
+                }
+            }
+        }
+        catch { /* not parseable — skip */ }
+        // Only genuinely stray files are "spurious". Canonical per-task result files
+        // (<stem>_<digest>.json) left by prior deepening rounds in the same
+        // task-results/ dir are legitimate and must not inflate the count or bury
+        // the real stray-file signal (3 -> 191 over a run before this fix).
+        if (!isCanonicalResultFilename(filename)) {
+            spuriousFiles.push(filename);
+        }
+    }
+    return { fallbackByTaskId, spuriousFiles };
+}
+/**
+ * Validate each pending task's result, classifying into passing/failing/notDispatched.
+ * Reads results from the result-map paths or falls back to the task_id lookup table
+ * for tasks recovered from non-canonical files.
+ */
+async function validateAndCollectResults(allTasks, entryByTaskId, fallbackByTaskId) {
+    const passing = [];
+    const failing = [];
+    // Pending tasks that were NOT dispatched this round. Not failures — they
+    // re-enter dispatch on the next round.
+    const notDispatched = [];
+    const seenTaskIds = new Set();
+    // Results recovered by task_id from packet result files. The host writes one
+    // array file per packet, so this is the normal collection path, not an error.
+    let recoveredCount = 0;
+    for (const task of allTasks) {
+        const entry = entryByTaskId.get(task.task_id);
+        let obj;
+        if (entry) {
+            const filePath = entry.result_path;
+            try {
+                obj = JSON.parse(await readFile(filePath, "utf8"));
+            }
+            catch (e) {
+                if (isFileMissingError(e)) {
+                    const fallback = fallbackByTaskId.get(task.task_id);
+                    if (fallback) {
+                        recoveredCount++;
+                        obj = fallback;
+                    }
+                    else {
+                        failing.push({
+                            task_id: task.task_id,
+                            errors: ["Missing audit result for assigned task."],
+                        });
+                        continue;
+                    }
+                }
+                else {
+                    failing.push({ task_id: task.task_id, errors: [`Invalid JSON: ${e.message}`] });
+                    continue;
+                }
+            }
+        }
+        else {
+            // No result-map entry => this pending task was not dispatched this round.
+            // But its answer may already exist on disk under a canonical per-task name
+            // (e.g. a selective-deepening task answered in a prior round whose dispatch
+            // manifest was later regenerated empty — the no-progress loop this guards
+            // against). Recover it by task_id so it ingests instead of looping forever
+            // as "pending"; only when no such file exists is the task genuinely held
+            // back for the next dispatch (not a failure).
+            const fallback = fallbackByTaskId.get(task.task_id);
+            if (!fallback) {
+                notDispatched.push(task.task_id);
+                continue;
+            }
+            recoveredCount++;
+            obj = fallback;
+        }
+        const record = obj && typeof obj === "object" && !Array.isArray(obj)
+            ? obj
+            : undefined;
+        const taskId = typeof record?.task_id === "string"
+            ? String(record.task_id) : undefined;
+        const resultErrors = [];
+        if (taskId) {
+            if (seenTaskIds.has(taskId)) {
+                resultErrors.push(`Duplicate audit result for assigned task '${taskId}'.`);
+            }
+            else {
+                seenTaskIds.add(taskId);
+            }
+            if (taskId !== task.task_id) {
+                resultErrors.push(`Result file is assigned to '${task.task_id}' but contains task_id '${taskId}'.`);
+            }
+        }
+        const issues = validateAuditResults([obj], [task], { lineIndex: task.file_line_counts ?? {} });
+        resultErrors.push(...issues
+            .filter(i => i.severity === "error")
+            .map(i => i.message));
+        if (resultErrors.length === 0) {
+            passing.push(obj);
+        }
+        else {
+            failing.push({ task_id: taskId ?? task.task_id, errors: resultErrors });
+        }
+    }
+    return { passing, failing, notDispatched, recoveredCount };
+}
+/**
+ * Grounding pass (S7): re-verify each finding against disk before it is admitted
+ * as fact. Tier-1 (quote-and-verify) re-reads the cited verbatim span and
+ * content-matches it; tier-2 (executable anchor) runs the finding's read-only
+ * behavior-check command. The combined verdict annotates `finding.grounding`: a
+ * finding that does not re-verify is `ungrounded` (surfaced, not confirmed), and
+ * one a tool-anchor actively DISPROVED is `refuted` (a distinct status that
+ * synthesis quarantines-EXCLUDES from the admitted contract — B4). Neither is
+ * silently dropped here nor silently admitted as confirmed. The confirmed bit is always the tool's
+ * re-check, never the model's word. Advisory metadata: this does not fail a
+ * result, so a weaker auditor's confident-but-fake finding is flagged for review
+ * rather than merged as fact. Mutates the findings in place and returns the
+ * ungrounded references.
+ */
+export async function groundPassingFindings(repoRoot, passing) {
+    // Flatten to a stable-ordered work list (one entry per finding, carrying its
+    // owning result for the task_id).
+    const work = [];
+    for (const result of passing) {
+        for (const finding of result.findings) {
+            work.push({ result, finding });
+        }
+    }
+    // Ground each finding under a bounded concurrency pool: tier-2 anchors spawn
+    // child processes, so a serial pass costs the SUM of their runtimes (noticeably
+    // slow with many anchored findings); the pool turns that into ~N/cap batches.
+    // Each unit mutates only its own finding (no shared state), and
+    // mapWithConcurrency preserves input order, so the ungrounded list is
+    // deterministic regardless of which command finished first.
+    const perFinding = await mapWithConcurrency(work, ANCHOR_GROUNDING_CONCURRENCY, async ({ result, finding }) => {
+        const tier1 = await verifyFindingGrounding(repoRoot, finding);
+        const anchor = await verifyFindingAnchor(repoRoot, finding);
+        // Record the run (confirmed/refuted/inconclusive) as evidence; a skipped
+        // anchor (off-allowlist / disabled) was not run, so add no noise.
+        if (anchor && anchor.status !== "skipped") {
+            finding.evidence = [
+                ...new Set([...(finding.evidence ?? []), anchorEvidenceLine(anchor)]),
+            ];
+        }
+        finding.grounding = combineGroundingWithAnchor(tier1, anchor);
+        return finding.grounding.status === "ungrounded"
+            ? {
+                task_id: result.task_id,
+                finding_id: finding.id,
+                path: finding.affected_files?.[0]?.path ?? "?",
+            }
+            : null;
+    });
+    return perFinding.filter((entry) => entry !== null);
+}
+/**
+ * Ingest a dispatched run's per-packet AuditResult files into the cumulative
+ * audit store. The callable core of `cmdMergeAndIngest` (the CLI is a thin argv →
+ * call → stdout/exit-code wrapper). The in-process audit rolling driver
+ * (A8(a) `driveRollingAuditDispatch`) calls this directly once it has driven every
+ * packet through the configured provider, the symmetric counterpart of remediate's
+ * callable `mergeImplementResults`. Resolves with the summary payload + a failure
+ * flag; never writes stdout or mutates `process.exitCode` itself.
+ */
+export async function mergeAndIngest(params) {
+    const { runId, artifactsDir } = params;
+    const runDir = join(artifactsDir, "runs", runId);
+    const taskResultsDir = join(runDir, "task-results");
+    const auditResultsPath = join(runDir, "run-results.json");
+    const taskPath = join(runDir, "task.json");
+    const tasksPath = join(runDir, "pending-audit-tasks.json");
+    const mergeCompletePath = join(runDir, "merge-complete.json");
+    // Phase 1: idempotency — replay a completed run or discard a stale marker.
+    const priorSummary = await checkIdempotencyReplay(runId, mergeCompletePath, tasksPath, taskResultsDir);
+    if (priorSummary) {
+        return {
+            summary: { ...priorSummary, idempotent_replay: true },
+            has_failures: false,
+        };
+    }
+    const workerTask = await readJsonFile(taskPath);
+    const resultMap = await loadDispatchResultMap(runDir);
+    if (!resultMap) {
+        throw new Error(`No ${DISPATCH_RESULT_MAP_FILENAME} found for run ${runId}; run prepare-dispatch first.`);
+    }
+    let allTasks = [];
+    try {
+        allTasks = await readJsonFile(tasksPath);
+    }
+    catch { /* may not exist */ }
+    const entryByTaskId = entriesByTaskId(resultMap.entries);
+    if (entryByTaskId.size !== resultMap.entries.length) {
+        throw new Error(`Dispatch result map for run ${runId} contains duplicate task entries.`);
+    }
+    const expectedPaths = new Set(resultMap.entries.map((entry) => resolve(entry.result_path)));
+    // Phase 2: scan task-results/ to build the fallback-by-task_id recovery table.
+    const { fallbackByTaskId, spuriousFiles } = await scanTaskResults(taskResultsDir, expectedPaths);
+    // Collapse stray-file warnings into a single stderr line so the real summary
+    // (emitted as the sole stdout JSON payload) is never buried under a wall of
+    // per-file warnings.
+    if (spuriousFiles.length > 0) {
+        process.stderr.write(`[merge-and-ingest] Warning: ${spuriousFiles.length} unexpected file(s) in ` +
+            `task-results/ ignored: ${spuriousFiles.join(", ")}\n`);
+    }
+    // Phase 3: validate each task's result and classify into passing/failing/notDispatched.
+    const { passing, failing, notDispatched, recoveredCount } = await validateAndCollectResults(allTasks, entryByTaskId, fallbackByTaskId);
+    if (recoveredCount > 0) {
+        process.stderr.write(`[merge-and-ingest] Recovered ${recoveredCount} result(s) by task_id from packet result files.\n`);
+    }
+    // Phase 3.5: quote-and-verify grounding (S7). Re-read each finding's cited
+    // verbatim span from disk and content-match it; annotate the finding and
+    // surface ungrounded findings (hallucinated or stale quotes) without dropping
+    // them. The grounding marker travels with the finding into the merged store.
+    const ungrounded = await groundPassingFindings(workerTask.repo_root, passing);
+    if (ungrounded.length > 0) {
+        process.stderr.write(`[merge-and-ingest] ${ungrounded.length} finding(s) could not be grounded against disk (marked ungrounded): ${ungrounded
+            .map((u) => `${u.finding_id} (${u.path})`)
+            .join(", ")}\n`);
+    }
+    // Phase 4: warn on cross-packet duplicate findings (all results in memory here —
+    // more accurate than per-packet early-warning at submit time).
+    warnOnDuplicateFindings(passing);
+    // FND-OBS-48c05a13: log notDispatched task IDs early (before ingestion) so
+    // operators can trace which tasks were budget-capped and re-enter dispatch on
+    // the next round, even if ingestion later throws.
+    if (notDispatched.length > 0) {
+        process.stderr.write(`[merge-and-ingest] ${notDispatched.length} task(s) not dispatched this round (budget-capped): ${notDispatched.join(", ")}\n`);
+    }
+    const failedTasksPath = join(runDir, "failed-tasks.json");
+    if (failing.length > 0) {
+        await writeJsonFile(failedTasksPath, failing);
+    }
+    if (passing.length === 0 && failing.length > 0) {
+        // Nothing merged and at least one failure: a blocked no-op. Do NOT write the
+        // transient results file here — truncating it to [] reads as catastrophic
+        // data loss on a re-run when the cumulative audit_results.jsonl store is in
+        // fact intact and the first merge had simply already succeeded.
+        throw new Error(`All ${failing.length} assigned task result(s) were missing or invalid; blocked before ingestion. See ${failedTasksPath}`);
+    }
+    const findingCount = passing.reduce((sum, result) => sum + result.findings.length, 0);
+    let result = null;
+    if (passing.length > 0) {
+        // Write the transient results file only when there is something to ingest.
+        // Writing [] unconditionally would, on a stray re-invocation where every
+        // accepted task was already pruned from the pending set (passing=0,
+        // notDispatched>0), truncate a prior run-results.json — the same data loss
+        // the failing>0 guard above prevents but a notDispatched-only merge bypasses.
+        await writeJsonFile(auditResultsPath, passing);
+        result = await runAuditStep({
+            root: workerTask.repo_root,
+            artifactsDir,
+            preferredExecutor: "result_ingestion_executor",
+            auditResultsPath,
+        });
+        const updatedPendingTasks = await addFileLineCountHints(workerTask.repo_root, buildPendingAuditTasks(result.updated_bundle));
+        await writeJsonFile(tasksPath, updatedPendingTasks);
+    }
+    const activeDispatchPath = join(artifactsDir, ACTIVE_DISPATCH_FILENAME);
+    try {
+        const dispatch = await readJsonFile(activeDispatchPath);
+        if (dispatch.run_id === runId) {
+            // "merged" only when this round is fully drained: every dispatched task
+            // accepted AND nothing held back (budget-capped notDispatched > 0 stays
+            // "active" because a follow-up round on the same run-id still has to merge).
+            dispatch.status =
+                failing.length > 0 || notDispatched.length > 0 ? "active" : "merged";
+            await writeJsonFile(activeDispatchPath, dispatch);
+        }
+    }
+    catch { /* no active dispatch file — skip */ }
+    let retryDispatchPath = null;
+    if (failing.length > 0) {
+        const failedTaskIds = new Set(failing.map((f) => f.task_id));
+        const failedPacketIds = [
+            ...new Set(resultMap.entries
+                .filter((e) => failedTaskIds.has(e.task_id))
+                .map((e) => e.packet_id)),
+        ];
+        const retryDispatch = {
+            run_id: runId,
+            retry_packet_ids: failedPacketIds,
+            failed_task_count: failing.length,
+            accepted_task_count: passing.length,
+        };
+        retryDispatchPath = join(runDir, "retry-dispatch.json");
+        await writeJsonFile(retryDispatchPath, retryDispatch);
+        process.stderr.write(`[merge-and-ingest] ${passing.length} accepted, ${failing.length} failed. ` +
+            `Retry packets: ${failedPacketIds.join(", ")}\n`);
+    }
+    // "partial" whenever work remains for this run — either genuine dispatched
+    // failures (failing) or tasks held back this round (notDispatched). The exit
+    // code below distinguishes the two: only genuine failures exit non-zero, so a
+    // budget-capped round reports status "partial" but exits 0 (progressing, not an error).
+    const status = failing.length > 0 || notDispatched.length > 0
+        ? "partial"
+        : (result?.progress_made ? "completed" : "no_progress");
+    // WorkerResultStatus does not have "partial"; use "blocked" when tasks failed
+    // but progress was also made (passing.length > 0), else "no_progress" for all
+    // failures (COR-48c05a13: was always "no_progress" even when passing.length > 0
+    // and result.progress_made is true).
+    const workerResultStatus = failing.length === 0
+        ? (result?.progress_made ? "completed" : "no_progress")
+        : passing.length > 0 || result?.progress_made
+            ? "blocked"
+            : "no_progress";
+    const workerResult = buildWorkerResult({
+        runId,
+        obligationId: workerTask.obligation_id,
+        status: workerResultStatus,
+        progressMade: result?.progress_made ?? false,
+        selectedExecutor: result?.selected_executor ?? null,
+        artifactsWritten: result?.artifacts_written ?? [],
+        summary: result?.progress_summary ?? `${failing.length} task(s) failed`,
+        nextLikelyStep: result?.next_likely_step ?? null,
+        errors: [],
+    });
+    await writeJsonFile(workerTask.result_path, workerResult);
+    const summaryPayload = {
+        run_id: runId,
+        status,
+        accepted_count: passing.length,
+        rejected_count: failing.length,
+        not_dispatched_count: notDispatched.length,
+        spurious_file_count: spuriousFiles.length,
+        finding_count: findingCount,
+        audit_results_path: auditResultsPath,
+        ...(retryDispatchPath ? { retry_dispatch_path: retryDispatchPath } : {}),
+        ...(result ? {
+            selected_executor: workerResult.selected_executor,
+            progress_made: workerResult.progress_made,
+            progress_summary: workerResult.summary,
+            next_likely_step: workerResult.next_likely_step,
+        } : {}),
+    };
+    // Record a completion marker for a fully-merged run so a stray re-invocation
+    // replays this summary (above) instead of re-processing — and possibly
+    // clobbering — terminal state. Only when this round is fully drained: genuine
+    // failures stay replayable for retry, and budget-capped rounds (notDispatched > 0)
+    // must NOT be marked complete or a follow-up merge on the same run-id would
+    // short-circuit to an idempotent replay and silently drop deferred results.
+    //
+    // Selective deepening appends new pending tasks to the SAME run-id; this marker
+    // can therefore go stale once those tasks are later dispatched and answered. The
+    // replay guard at the top detects that (a pending task with an on-disk result)
+    // and re-processes, so a premature marker self-heals instead of stranding the
+    // deepening answers behind an idempotent replay (the no-progress loop).
+    if (failing.length === 0 && notDispatched.length === 0) {
+        await writeJsonFile(mergeCompletePath, summaryPayload);
+    }
+    return { summary: summaryPayload, has_failures: failing.length > 0 };
+}
+/**
+ * CLI wrapper for `merge-and-ingest`: parse argv, run the callable core, emit the
+ * summary as the sole stdout JSON payload, and set the exit code on failure.
+ */
+export async function cmdMergeAndIngest(argv) {
+    const runId = getFlag(argv, "--run-id");
+    if (!runId)
+        throw new Error("merge-and-ingest requires --run-id <run_id>");
+    const artifactsDir = getArtifactsDir(argv);
+    const { summary, has_failures } = await mergeAndIngest({ runId, artifactsDir });
+    console.log(JSON.stringify(summary, null, 2));
+    if (has_failures) {
+        process.exitCode = 2;
+    }
+}
+//# sourceMappingURL=mergeAndIngestCommand.js.map

package/dist/audit/cli/mergeAndIngestCommand.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"mergeAndIngestCommand.js","sourceRoot":"","sources":["../../../src/audit/cli/mergeAndIngestCommand.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,OAAO,EAAE,EAAE,EAAE,MAAM,kBAAkB,CAAC;AACzD,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,MAAM,WAAW,CAAC;AAC1C,OAAO,EAAE,kBAAkB,EAAE,kBAAkB,EAAE,YAAY,EAAE,aAAa,EAAE,MAAM,oBAAoB,CAAC;AAGzG,OAAO,EAAE,oBAAoB,EAAE,MAAM,+BAA+B,CAAC;AACrE,OAAO,EAAE,sBAAsB,EAAE,MAAM,iCAAiC,CAAC;AACzE,OAAO,EACL,4BAA4B,EAC5B,kBAAkB,EAClB,0BAA0B,EAC1B,mBAAmB,GACpB,MAAM,kCAAkC,CAAC;AAC1C,OAAO,EAAE,YAAY,EAAE,MAAM,gBAAgB,CAAC;AAC9C,OAAO,EAEL,4BAA4B,EAC5B,wBAAwB,EACxB,qBAAqB,EACrB,eAAe,EACf,sBAAsB,GACvB,MAAM,eAAe,CAAC;AACvB,OAAO,EAAE,qBAAqB,EAAE,MAAM,gBAAgB,CAAC;AACvD,OAAO,EAAE,yBAAyB,EAAE,eAAe,EAAE,OAAO,EAAE,MAAM,WAAW,CAAC;AAChF,OAAO,EAAE,iBAAiB,EAAE,MAAM,mBAAmB,CAAC;AACtD,OAAO,EAAE,uBAAuB,EAAE,MAAM,uBAAuB,CAAC;AAEhE,+EAA+E;AAC/E,wEAAwE;AACxE,+BAA+B;AAC/B,MAAM,0BAA0B,GAAG,IAAI,GAAG,CAAS,uBAAuB,CAAC,CAAC;AAE5E;;;GAGG;AACH,SAAS,UAAU,CAAC,CAAiG;IACnH,OAAO;QACL,CAAC,CAAC,CAAC,IAAI,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,WAAW,EAAE;QACnC,CAAC,CAAC,CAAC,QAAQ,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,WAAW,EAAE;QACvC,CAAC,CAAC,CAAC,KAAK,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,WAAW,EAAE;QACpC,CAAC,CAAC,cAAc,EAAE,CAAC,CAAC,CAAC,EAAE,IAAI,IAAI,EAAE;KAClC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;AACd,CAAC;AAED;;;;;GAKG;AACH,SAAS,uBAAuB,CAAC,OAAsB;IACrD,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAC,CAAC,gBAAgB;IAC5D,IAAI,QAAQ,GAAG,CAAC,CAAC;IACjB,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;QAC7B,KAAK,MAAM,CAAC,IAAI,MAAM,CAAC,QAAQ,IAAI,EAAE,EAAE,CAAC;YACtC,MAAM,GAAG,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;YAC1B,MAAM,KAAK,GAAG,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YAChC,IAAI,KAAK,EAAE,CAAC;gBACV,QAAQ,EAAE,CAAC;YACb,CAAC;iBAAM,CAAC;gBACN,QAAQ,CAAC,GAAG,CAAC,GAAG,EAAE,MAAM,CAAC,OAAO,CAAC,CAAC;YACpC,CAAC;QACH,CAAC;IACH,CAAC;IACD,IAAI,QAAQ,GAAG,CAAC,EAAE,CAAC;QACjB,OAAO,CAAC,MAAM,CAAC,KAAK,CAClB,+BAA+B,QAAQ,wEAAwE,CAChH,CAAC;IACJ,CAAC;AACH,CAAC;AAED;;;;;;GAMG;AACH,KAAK,UAAU,wBAAwB,CAAC,cAAsB;IAC5D,IAAI,KAAe,CAAC;IACpB,IAAI,CAAC;QACH,KAAK,GAAG,CAAC,MAAM,OAAO,CAAC,cAAc,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC;IAC7E,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,IAAI,GAAG,EAAE,CAAC;IACnB,CAAC;IACD,MAAM,GAAG,GAAG,IAAI,GAAG,EAAU,CAAC;IAC9B,KAAK,MAAM,QAAQ,IAAI,KAAK,EAAE,CAAC;QAC7B,IAAI,0BAA0B,CAAC,GAAG,CAAC,QAAQ,CAAC;YAAE,SAAS;QACvD,IAAI,CAAC;YACH,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,QAAQ,CAAC,IAAI,CAAC,cAAc,EAAE,QAAQ,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC;YAClF,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC;gBAC7D,IAAI,IAAI,IAAI,OAAO,IAAI,KAAK,QAAQ,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC;oBAC7D,MAAM,GAAG,GAAI,IAAgC,CAAC,OAAO,CAAC;oBACtD,IAAI,OAAO,GAAG,KAAK,QAAQ;wBAAE,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;gBAC5C,CAAC;YACH,CAAC;QACH,CAAC;QAAC,MAAM,CAAC;YACP,0BAA0B;QAC5B,CAAC;IACH,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED;;;;;;GAMG;AACH,KAAK,UAAU,sBAAsB,CACnC,KAAa,EACb,iBAAyB,EACzB,SAAiB,EACjB,cAAsB;IAEtB,IAAI,YAAY,GAAmC,IAAI,CAAC;IACxD,IAAI,CAAC;QACH,YAAY,GAAG,MAAM,YAAY,CAA0B,iBAAiB,CAAC,CAAC;IAChF,CAAC;IAAC,OAAO,CAAC,EAAE,CAAC;QACX,IAAI,CAAC,kBAAkB,CAAC,CAAC,CAAC;YAAE,MAAM,CAAC,CAAC;IACtC,CAAC;IACD,IAAI,CAAC,YAAY;QAAE,OAAO,IAAI,CAAC;IAE/B,4EAA4E;IAC5E,yEAAyE;IACzE,4EAA4E;IAC5E,6EAA6E;IAC7E,yEAAyE;IACzE,8EAA8E;IAC9E,+EAA+E;IAC/E,yDAAyD;IACzD,IAAI,kBAAkB,GAAG,CAAC,CAAC;IAC3B,IAAI,CAAC;QACH,MAAM,OAAO,GAAG,MAAM,YAAY,CAAc,SAAS,CAAC,CAAC;QAC3D,MAAM,QAAQ,GAAG,MAAM,wBAAwB,CAAC,cAAc,CAAC,CAAC;QAChE,KAAK,MAAM,IAAI,IAAI,OAAO,EAAE,CAAC;YAC3B,IAAI,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC;gBAC/B,kBAAkB,EAAE,CAAC;YACvB,CAAC;QACH,CAAC;IACH,CAAC;IAAC,MAAM,CAAC,CAAC,0DAA0D,CAAC,CAAC;IAEtE,IAAI,kBAAkB,KAAK,CAAC,EAAE,CAAC;QAC7B,OAAO,YAAY,CAAC;IACtB,CAAC;IAED,OAAO,CAAC,MAAM,CAAC,KAAK,CAClB,4CAA4C,KAAK,aAAa;QAC5D,GAAG,kBAAkB,qEAAqE,CAC7F,CAAC;IACF,MAAM,EAAE,CAAC,iBAAiB,EAAE,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC,CAAC;IAC7C,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;;;;GAMG;AACH,KAAK,UAAU,eAAe,CAC5B,cAAsB,EACtB,aAA0B;IAE1B,IAAI,KAAe,CAAC;IACpB,IAAI,CAAC;QACH,KAAK,GAAG,CAAC,MAAM,OAAO,CAAC,cAAc,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;IAClF,CAAC;IAAC,MAAM,CAAC;QACP,KAAK,GAAG,EAAE,CAAC;IACb,CAAC;IAED,MAAM,gBAAgB,GAAG,IAAI,GAAG,EAAmB,CAAC;IACpD,MAAM,aAAa,GAAa,EAAE,CAAC;IAEnC,KAAK,MAAM,QAAQ,IAAI,KAAK,EAAE,CAAC;QAC7B,0EAA0E;QAC1E,oEAAoE;QACpE,iDAAiD;QACjD,IAAI,0BAA0B,CAAC,GAAG,CAAC,QAAQ,CAAC;YAAE,SAAS;QACvD,MAAM,QAAQ,GAAG,OAAO,CAAC,IAAI,CAAC,cAAc,EAAE,QAAQ,CAAC,CAAC,CAAC;QACzD,IAAI,aAAa,CAAC,GAAG,CAAC,QAAQ,CAAC;YAAE,SAAS;QAE1C,wEAAwE;QACxE,qEAAqE;QACrE,wEAAwE;QACxE,uEAAuE;QACvE,4EAA4E;QAC5E,IAAI,CAAC;YACH,MAAM,GAAG,GAAG,MAAM,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC;YAC7C,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;YAC/B,MAAM,UAAU,GAAc,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;YACxE,KAAK,MAAM,IAAI,IAAI,UAAU,EAAE,CAAC;gBAC9B,IAAI,CAAC,IAAI,IAAI,OAAO,IAAI,KAAK,QAAQ,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC;oBAAE,SAAS;gBACvE,MAAM,GAAG,GAAG,OAAQ,IAAgC,CAAC,OAAO,KAAK,QAAQ;oBACvE,CAAC,CAAC,MAAM,CAAE,IAAgC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;gBAClE,IAAI,GAAG,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;oBACtC,gBAAgB,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;gBAClC,CAAC;YACH,CAAC;QACH,CAAC;QAAC,MAAM,CAAC,CAAC,0BAA0B,CAAC,CAAC;QAEtC,6EAA6E;QAC7E,oEAAoE;QACpE,0EAA0E;QAC1E,oEAAoE;QACpE,IAAI,CAAC,yBAAyB,CAAC,QAAQ,CAAC,EAAE,CAAC;YACzC,aAAa,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QAC/B,CAAC;IACH,CAAC;IAED,OAAO,EAAE,gBAAgB,EAAE,aAAa,EAAE,CAAC;AAC7C,CAAC;AAED;;;;GAIG;AACH,KAAK,UAAU,yBAAyB,CACtC,QAAqB,EACrB,aAAuF,EACvF,gBAAsC;IAOtC,MAAM,OAAO,GAAkB,EAAE,CAAC;IAClC,MAAM,OAAO,GAAiD,EAAE,CAAC;IACjE,yEAAyE;IACzE,uCAAuC;IACvC,MAAM,aAAa,GAAa,EAAE,CAAC;IACnC,MAAM,WAAW,GAAG,IAAI,GAAG,EAAU,CAAC;IACtC,6EAA6E;IAC7E,8EAA8E;IAC9E,IAAI,cAAc,GAAG,CAAC,CAAC;IAEvB,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;QAC5B,MAAM,KAAK,GAAG,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QAC9C,IAAI,GAAY,CAAC;QACjB,IAAI,KAAK,EAAE,CAAC;YACV,MAAM,QAAQ,GAAG,KAAK,CAAC,WAAW,CAAC;YACnC,IAAI,CAAC;gBACH,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC,CAAC;YACrD,CAAC;YAAC,OAAO,CAAC,EAAE,CAAC;gBACX,IAAI,kBAAkB,CAAC,CAAC,CAAC,EAAE,CAAC;oBAC1B,MAAM,QAAQ,GAAG,gBAAgB,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;oBACpD,IAAI,QAAQ,EAAE,CAAC;wBACb,cAAc,EAAE,CAAC;wBACjB,GAAG,GAAG,QAAQ,CAAC;oBACjB,CAAC;yBAAM,CAAC;wBACN,OAAO,CAAC,IAAI,CAAC;4BACX,OAAO,EAAE,IAAI,CAAC,OAAO;4BACrB,MAAM,EAAE,CAAC,yCAAyC,CAAC;yBACpD,CAAC,CAAC;wBACH,SAAS;oBACX,CAAC;gBACH,CAAC;qBAAM,CAAC;oBACN,OAAO,CAAC,IAAI,CAAC,EAAE,OAAO,EAAE,IAAI,CAAC,OAAO,EAAE,MAAM,EAAE,CAAC,iBAAkB,CAAW,CAAC,OAAO,EAAE,CAAC,EAAE,CAAC,CAAC;oBAC3F,SAAS;gBACX,CAAC;YACH,CAAC;QACH,CAAC;aAAM,CAAC;YACN,0EAA0E;YAC1E,2EAA2E;YAC3E,4EAA4E;YAC5E,0EAA0E;YAC1E,2EAA2E;YAC3E,yEAAyE;YACzE,8CAA8C;YAC9C,MAAM,QAAQ,GAAG,gBAAgB,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YACpD,IAAI,CAAC,QAAQ,EAAE,CAAC;gBACd,aAAa,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;gBACjC,SAAS;YACX,CAAC;YACD,cAAc,EAAE,CAAC;YACjB,GAAG,GAAG,QAAQ,CAAC;QACjB,CAAC;QACD,MAAM,MAAM,GAAG,GAAG,IAAI,OAAO,GAAG,KAAK,QAAQ,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC;YAClE,CAAC,CAAC,GAA8B;YAChC,CAAC,CAAC,SAAS,CAAC;QACd,MAAM,MAAM,GAAG,OAAO,MAAM,EAAE,OAAO,KAAK,QAAQ;YAChD,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;QACvC,MAAM,YAAY,GAAa,EAAE,CAAC;QAClC,IAAI,MAAM,EAAE,CAAC;YACX,IAAI,WAAW,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;gBAC5B,YAAY,CAAC,IAAI,CAAC,6CAA6C,MAAM,IAAI,CAAC,CAAC;YAC7E,CAAC;iBAAM,CAAC;gBACN,WAAW,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YAC1B,CAAC;YACD,IAAI,MAAM,KAAK,IAAI,CAAC,OAAO,EAAE,CAAC;gBAC5B,YAAY,CAAC,IAAI,CACf,+BAA+B,IAAI,CAAC,OAAO,2BAA2B,MAAM,IAAI,CACjF,CAAC;YACJ,CAAC;QACH,CAAC;QACD,MAAM,MAAM,GAAG,oBAAoB,CACjC,CAAC,GAAG,CAAC,EACL,CAAC,IAAI,CAAC,EACN,EAAE,SAAS,EAAE,IAAI,CAAC,gBAAgB,IAAI,EAAE,EAAE,CAC3C,CAAC;QACF,YAAY,CAAC,IAAI,CACf,GAAG,MAAM;aACN,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,QAAQ,KAAK,OAAO,CAAC;aACnC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CACvB,CAAC;QACF,IAAI,YAAY,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC9B,OAAO,CAAC,IAAI,CAAC,GAAkB,CAAC,CAAC;QACnC,CAAC;aAAM,CAAC;YACN,OAAO,CAAC,IAAI,CAAC,EAAE,OAAO,EAAE,MAAM,IAAI,IAAI,CAAC,OAAO,EAAE,MAAM,EAAE,YAAY,EAAE,CAAC,CAAC;QAC1E,CAAC;IACH,CAAC;IAED,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,aAAa,EAAE,cAAc,EAAE,CAAC;AAC7D,CAAC;AAED;;;;;;;;;;;;;GAaG;AACH,MAAM,CAAC,KAAK,UAAU,qBAAqB,CACzC,QAAgB,EAChB,OAAsB;IAEtB,6EAA6E;IAC7E,kCAAkC;IAClC,MAAM,IAAI,GAA6E,EAAE,CAAC;IAC1F,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;QAC7B,KAAK,MAAM,OAAO,IAAI,MAAM,CAAC,QAAQ,EAAE,CAAC;YACtC,IAAI,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,OAAO,EAAE,CAAC,CAAC;QACjC,CAAC;IACH,CAAC;IAED,6EAA6E;IAC7E,gFAAgF;IAChF,8EAA8E;IAC9E,gEAAgE;IAChE,sEAAsE;IACtE,4DAA4D;IAC5D,MAAM,UAAU,GAAG,MAAM,kBAAkB,CACzC,IAAI,EACJ,4BAA4B,EAC5B,KAAK,EAAE,EAAE,MAAM,EAAE,OAAO,EAAE,EAAE,EAAE;QAC5B,MAAM,KAAK,GAAG,MAAM,sBAAsB,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC;QAC9D,MAAM,MAAM,GAAG,MAAM,mBAAmB,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC;QAC5D,yEAAyE;QACzE,kEAAkE;QAClE,IAAI,MAAM,IAAI,MAAM,CAAC,MAAM,KAAK,SAAS,EAAE,CAAC;YAC1C,OAAO,CAAC,QAAQ,GAAG;gBACjB,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,QAAQ,IAAI,EAAE,CAAC,EAAE,kBAAkB,CAAC,MAAM,CAAC,CAAC,CAAC;aACtE,CAAC;QACJ,CAAC;QACD,OAAO,CAAC,SAAS,GAAG,0BAA0B,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;QAC9D,OAAO,OAAO,CAAC,SAAS,CAAC,MAAM,KAAK,YAAY;YAC9C,CAAC,CAAC;gBACE,OAAO,EAAE,MAAM,CAAC,OAAO;gBACvB,UAAU,EAAE,OAAO,CAAC,EAAE;gBACtB,IAAI,EAAE,OAAO,CAAC,cAAc,EAAE,CAAC,CAAC,CAAC,EAAE,IAAI,IAAI,GAAG;aAC/C;YACH,CAAC,CAAC,IAAI,CAAC;IACX,CAAC,CACF,CAAC;IACF,OAAO,UAAU,CAAC,MAAM,CACtB,CAAC,KAAK,EAAkE,EAAE,CACxE,KAAK,KAAK,IAAI,CACjB,CAAC;AACJ,CAAC;AAUD;;;;;;;;GAQG;AACH,MAAM,CAAC,KAAK,UAAU,cAAc,CAAC,MAGpC;IACC,MAAM,EAAE,KAAK,EAAE,YAAY,EAAE,GAAG,MAAM,CAAC;IAEvC,MAAM,MAAM,GAAG,IAAI,CAAC,YAAY,EAAE,MAAM,EAAE,KAAK,CAAC,CAAC;IACjD,MAAM,cAAc,GAAG,IAAI,CAAC,MAAM,EAAE,cAAc,CAAC,CAAC;IACpD,MAAM,gBAAgB,GAAG,IAAI,CAAC,MAAM,EAAE,kBAAkB,CAAC,CAAC;IAC1D,MAAM,QAAQ,GAAG,IAAI,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC;IAC3C,MAAM,SAAS,GAAG,IAAI,CAAC,MAAM,EAAE,0BAA0B,CAAC,CAAC;IAC3D,MAAM,iBAAiB,GAAG,IAAI,CAAC,MAAM,EAAE,qBAAqB,CAAC,CAAC;IAE9D,2EAA2E;IAC3E,MAAM,YAAY,GAAG,MAAM,sBAAsB,CAAC,KAAK,EAAE,iBAAiB,EAAE,SAAS,EAAE,cAAc,CAAC,CAAC;IACvG,IAAI,YAAY,EAAE,CAAC;QACjB,OAAO;YACL,OAAO,EAAE,EAAE,GAAG,YAAY,EAAE,iBAAiB,EAAE,IAAI,EAAE;YACrD,YAAY,EAAE,KAAK;SACpB,CAAC;IACJ,CAAC;IAED,MAAM,UAAU,GAAG,MAAM,YAAY,CAAa,QAAQ,CAAC,CAAC;IAC5D,MAAM,SAAS,GAAG,MAAM,qBAAqB,CAAC,MAAM,CAAC,CAAC;IACtD,IAAI,CAAC,SAAS,EAAE,CAAC;QACf,MAAM,IAAI,KAAK,CACb,MAAM,4BAA4B,kBAAkB,KAAK,+BAA+B,CACzF,CAAC;IACJ,CAAC;IAED,IAAI,QAAQ,GAAgB,EAAE,CAAC;IAC/B,IAAI,CAAC;QAAC,QAAQ,GAAG,MAAM,YAAY,CAAc,SAAS,CAAC,CAAC;IAAC,CAAC;IAAC,MAAM,CAAC,CAAC,mBAAmB,CAAC,CAAC;IAC5F,MAAM,aAAa,GAAG,eAAe,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC;IACzD,IAAI,aAAa,CAAC,IAAI,KAAK,SAAS,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC;QACpD,MAAM,IAAI,KAAK,CAAC,+BAA+B,KAAK,mCAAmC,CAAC,CAAC;IAC3F,CAAC;IACD,MAAM,aAAa,GAAG,IAAI,GAAG,CAC3B,SAAS,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,OAAO,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC,CAC7D,CAAC;IAEF,+EAA+E;IAC/E,MAAM,EAAE,gBAAgB,EAAE,aAAa,EAAE,GAAG,MAAM,eAAe,CAAC,cAAc,EAAE,aAAa,CAAC,CAAC;IAEjG,6EAA6E;IAC7E,4EAA4E;IAC5E,qBAAqB;IACrB,IAAI,aAAa,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC7B,OAAO,CAAC,MAAM,CAAC,KAAK,CAClB,+BAA+B,aAAa,CAAC,MAAM,yBAAyB;YAC1E,0BAA0B,aAAa,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CACzD,CAAC;IACJ,CAAC;IAED,wFAAwF;IACxF,MAAM,EAAE,OAAO,EAAE,OAAO,EAAE,aAAa,EAAE,cAAc,EAAE,GAAG,MAAM,yBAAyB,CACzF,QAAQ,EACR,aAAa,EACb,gBAAgB,CACjB,CAAC;IACF,IAAI,cAAc,GAAG,CAAC,EAAE,CAAC;QACvB,OAAO,CAAC,MAAM,CAAC,KAAK,CAClB,gCAAgC,cAAc,mDAAmD,CAClG,CAAC;IACJ,CAAC;IAED,2EAA2E;IAC3E,yEAAyE;IACzE,8EAA8E;IAC9E,6EAA6E;IAC7E,MAAM,UAAU,GAAG,MAAM,qBAAqB,CAAC,UAAU,CAAC,SAAS,EAAE,OAAO,CAAC,CAAC;IAC9E,IAAI,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC1B,OAAO,CAAC,MAAM,CAAC,KAAK,CAClB,sBAAsB,UAAU,CAAC,MAAM,uEAAuE,UAAU;aACrH,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,UAAU,KAAK,CAAC,CAAC,IAAI,GAAG,CAAC;aACzC,IAAI,CAAC,IAAI,CAAC,IAAI,CAClB,CAAC;IACJ,CAAC;IAED,iFAAiF;IACjF,+DAA+D;IAC/D,uBAAuB,CAAC,OAAO,CAAC,CAAC;IAEjC,2EAA2E;IAC3E,8EAA8E;IAC9E,kDAAkD;IAClD,IAAI,aAAa,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC7B,OAAO,CAAC,MAAM,CAAC,KAAK,CAClB,sBAAsB,aAAa,CAAC,MAAM,uDAAuD,aAAa,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAC9H,CAAC;IACJ,CAAC;IAED,MAAM,eAAe,GAAG,IAAI,CAAC,MAAM,EAAE,mBAAmB,CAAC,CAAC;IAC1D,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACvB,MAAM,aAAa,CAAC,eAAe,EAAE,OAAO,CAAC,CAAC;IAChD,CAAC;IAED,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC/C,6EAA6E;QAC7E,0EAA0E;QAC1E,4EAA4E;QAC5E,gEAAgE;QAChE,MAAM,IAAI,KAAK,CACb,OAAO,OAAO,CAAC,MAAM,mFAAmF,eAAe,EAAE,CAC1H,CAAC;IACJ,CAAC;IAED,MAAM,YAAY,GAAG,OAAO,CAAC,MAAM,CACjC,CAAC,GAAG,EAAE,MAAM,EAAE,EAAE,CAAC,GAAG,GAAG,MAAM,CAAC,QAAQ,CAAC,MAAM,EAC7C,CAAC,CACF,CAAC;IAEF,IAAI,MAAM,GAAoD,IAAI,CAAC;IACnE,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACvB,2EAA2E;QAC3E,yEAAyE;QACzE,oEAAoE;QACpE,2EAA2E;QAC3E,8EAA8E;QAC9E,MAAM,aAAa,CAAC,gBAAgB,EAAE,OAAO,CAAC,CAAC;QAC/C,MAAM,GAAG,MAAM,YAAY,CAAC;YAC1B,IAAI,EAAE,UAAU,CAAC,SAAS;YAC1B,YAAY;YACZ,iBAAiB,EAAE,2BAA2B;YAC9C,gBAAgB;SACjB,CAAC,CAAC;QACH,MAAM,mBAAmB,GAAG,MAAM,qBAAqB,CACrD,UAAU,CAAC,SAAS,EACpB,sBAAsB,CAAC,MAAM,CAAC,cAAc,CAAC,CAC9C,CAAC;QACF,MAAM,aAAa,CAAC,SAAS,EAAE,mBAAmB,CAAC,CAAC;IACtD,CAAC;IAED,MAAM,kBAAkB,GAAG,IAAI,CAAC,YAAY,EAAE,wBAAwB,CAAC,CAAC;IACxE,IAAI,CAAC;QACH,MAAM,QAAQ,GAAG,MAAM,YAAY,CAAsB,kBAAkB,CAAC,CAAC;QAC7E,IAAI,QAAQ,CAAC,MAAM,KAAK,KAAK,EAAE,CAAC;YAC9B,wEAAwE;YACxE,wEAAwE;YACxE,6EAA6E;YAC7E,QAAQ,CAAC,MAAM;gBACb,OAAO,CAAC,MAAM,GAAG,CAAC,IAAI,aAAa,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,QAAQ,CAAC;YACvE,MAAM,aAAa,CAAC,kBAAkB,EAAE,QAAQ,CAAC,CAAC;QACpD,CAAC;IACH,CAAC;IAAC,MAAM,CAAC,CAAC,oCAAoC,CAAC,CAAC;IAEhD,IAAI,iBAAiB,GAAkB,IAAI,CAAC;IAC5C,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACvB,MAAM,aAAa,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC;QAC7D,MAAM,eAAe,GAAG;YACtB,GAAG,IAAI,GAAG,CACR,SAAS,CAAC,OAAO;iBACd,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC;iBAC3C,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,CAC3B;SACF,CAAC;QACF,MAAM,aAAa,GAAG;YACpB,MAAM,EAAE,KAAK;YACb,gBAAgB,EAAE,eAAe;YACjC,iBAAiB,EAAE,OAAO,CAAC,MAAM;YACjC,mBAAmB,EAAE,OAAO,CAAC,MAAM;SACpC,CAAC;QACF,iBAAiB,GAAG,IAAI,CAAC,MAAM,EAAE,qBAAqB,CAAC,CAAC;QACxD,MAAM,aAAa,CAAC,iBAAiB,EAAE,aAAa,CAAC,CAAC;QACtD,OAAO,CAAC,MAAM,CAAC,KAAK,CAClB,sBAAsB,OAAO,CAAC,MAAM,cAAc,OAAO,CAAC,MAAM,WAAW;YAC3E,kBAAkB,eAAe,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CACjD,CAAC;IACJ,CAAC;IAED,2EAA2E;IAC3E,6EAA6E;IAC7E,8EAA8E;IAC9E,wFAAwF;IACxF,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,GAAG,CAAC,IAAI,aAAa,CAAC,MAAM,GAAG,CAAC;QAC3D,CAAC,CAAC,SAAS;QACX,CAAC,CAAC,CAAC,MAAM,EAAE,aAAa,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC;IAC1D,8EAA8E;IAC9E,8EAA8E;IAC9E,gFAAgF;IAChF,qCAAqC;IACrC,MAAM,kBAAkB,GACtB,OAAO,CAAC,MAAM,KAAK,CAAC;QAClB,CAAC,CAAC,CAAC,MAAM,EAAE,aAAa,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,aAAa,CAAC;QACvD,CAAC,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,IAAI,MAAM,EAAE,aAAa;YAC3C,CAAC,CAAC,SAAS;YACX,CAAC,CAAC,aAAa,CAAC;IACtB,MAAM,YAAY,GAAG,iBAAiB,CAAC;QACrC,KAAK;QACL,YAAY,EAAE,UAAU,CAAC,aAAa;QACtC,MAAM,EAAE,kBAAkB;QAC1B,YAAY,EAAE,MAAM,EAAE,aAAa,IAAI,KAAK;QAC5C,gBAAgB,EAAE,MAAM,EAAE,iBAAiB,IAAI,IAAI;QACnD,gBAAgB,EAAE,MAAM,EAAE,iBAAiB,IAAI,EAAE;QACjD,OAAO,EAAE,MAAM,EAAE,gBAAgB,IAAI,GAAG,OAAO,CAAC,MAAM,iBAAiB;QACvE,cAAc,EAAE,MAAM,EAAE,gBAAgB,IAAI,IAAI;QAChD,MAAM,EAAE,EAAE;KACX,CAAC,CAAC;IACH,MAAM,aAAa,CAAC,UAAU,CAAC,WAAW,EAAE,YAAY,CAAC,CAAC;IAC1D,MAAM,cAAc,GAAG;QACrB,MAAM,EAAE,KAAK;QACb,MAAM;QACN,cAAc,EAAE,OAAO,CAAC,MAAM;QAC9B,cAAc,EAAE,OAAO,CAAC,MAAM;QAC9B,oBAAoB,EAAE,aAAa,CAAC,MAAM;QAC1C,mBAAmB,EAAE,aAAa,CAAC,MAAM;QACzC,aAAa,EAAE,YAAY;QAC3B,kBAAkB,EAAE,gBAAgB;QACpC,GAAG,CAAC,iBAAiB,CAAC,CAAC,CAAC,EAAE,mBAAmB,EAAE,iBAAiB,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QACxE,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC;YACX,iBAAiB,EAAE,YAAY,CAAC,iBAAiB;YACjD,aAAa,EAAE,YAAY,CAAC,aAAa;YACzC,gBAAgB,EAAE,YAAY,CAAC,OAAO;YACtC,gBAAgB,EAAE,YAAY,CAAC,gBAAgB;SAChD,CAAC,CAAC,CAAC,EAAE,CAAC;KACR,CAAC;IAEF,6EAA6E;IAC7E,uEAAuE;IACvE,8EAA8E;IAC9E,mFAAmF;IACnF,4EAA4E;IAC5E,4EAA4E;IAC5E,EAAE;IACF,gFAAgF;IAChF,iFAAiF;IACjF,+EAA+E;IAC/E,8EAA8E;IAC9E,wEAAwE;IACxE,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,IAAI,aAAa,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACvD,MAAM,aAAa,CAAC,iBAAiB,EAAE,cAAc,CAAC,CAAC;IACzD,CAAC;IAED,OAAO,EAAE,OAAO,EAAE,cAAc,EAAE,YAAY,EAAE,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;AACvE,CAAC;AAED;;;GAGG;AACH,MAAM,CAAC,KAAK,UAAU,iBAAiB,CAAC,IAAc;IACpD,MAAM,KAAK,GAAG,OAAO,CAAC,IAAI,EAAE,UAAU,CAAC,CAAC;IACxC,IAAI,CAAC,KAAK;QAAE,MAAM,IAAI,KAAK,CAAC,6CAA6C,CAAC,CAAC;IAC3E,MAAM,YAAY,GAAG,eAAe,CAAC,IAAI,CAAC,CAAC;IAE3C,MAAM,EAAE,OAAO,EAAE,YAAY,EAAE,GAAG,MAAM,cAAc,CAAC,EAAE,KAAK,EAAE,YAAY,EAAE,CAAC,CAAC;IAChF,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,OAAO,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC;IAC9C,IAAI,YAAY,EAAE,CAAC;QACjB,OAAO,CAAC,QAAQ,GAAG,CAAC,CAAC;IACvB,CAAC;AACH,CAAC"}

package/dist/audit/cli/nextStepCommand.d.ts

@@ -0,0 +1,22 @@
+export { tryConsumeIncoming, buildTerminalStep, handleGraphEnrichmentBranch, handleDesignReviewBranch, handleSynthesisNarrativeBranch, executeAndRecord, checkFinalizationCycle, checkNoProgressBeforeDispatch, runDeterministicForNextStep, } from "./nextStepHelpers.js";
+export declare function cmdNextStep(argv: string[]): Promise<void>;
+/**
+ * Scan argv for a TRUE boolean flag (parity with remediate-code's commander
+ * boolean). A bare `<flag>` resolves true and NEVER swallows the next token; the
+ * `--no-<flag>` form and the `<flag>=false` spelling resolve false; `<flag>=true`
+ * resolves true; absence stays `undefined` so the tristate reaches
+ * resolveHostDispatchCapability intact. A non-boolean `<flag>=<other>` value
+ * fails loudly. When the flag appears more than once, the last occurrence wins.
+ */
+export declare function parseHostBooleanFlag(argv: string[], flag: string): boolean | undefined;
+/**
+ * Single-step bootstrap writer for `intake/conversation-start.md`.
+ *
+ * Sole writer + idempotent-on-target (INV-CC-03): re-applying the identical
+ * guidance is a byte-identical no-op (the existing file is left untouched, never
+ * appended to), and a pre-existing file with DIFFERING content is never silently
+ * clobbered — that case fails loudly so host/conversation-authored guidance can't
+ * be lost. The guidance file's bytes are written verbatim.
+ */
+export declare function applyGuidanceFile(artifactsDir: string, guidanceFilePath: string): string;
+//# sourceMappingURL=nextStepCommand.d.ts.map

package/dist/audit/cli/nextStepCommand.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"nextStepCommand.d.ts","sourceRoot":"","sources":["../../../src/audit/cli/nextStepCommand.ts"],"names":[],"mappings":"AA6DA,OAAO,EACL,kBAAkB,EAClB,iBAAiB,EACjB,2BAA2B,EAC3B,wBAAwB,EACxB,8BAA8B,EAC9B,gBAAgB,EAChB,sBAAsB,EACtB,6BAA6B,EAC7B,2BAA2B,GAC5B,MAAM,sBAAsB,CAAC;AAI9B,wBAAsB,WAAW,CAAC,IAAI,EAAE,MAAM,EAAE,GAAG,OAAO,CAAC,IAAI,CAAC,CAohB/D;AAED;;;;;;;GAOG;AACH,wBAAgB,oBAAoB,CAClC,IAAI,EAAE,MAAM,EAAE,EACd,IAAI,EAAE,MAAM,GACX,OAAO,GAAG,SAAS,CAiBrB;AAED;;;;;;;;GAQG;AACH,wBAAgB,iBAAiB,CAC/B,YAAY,EAAE,MAAM,EACpB,gBAAgB,EAAE,MAAM,GACvB,MAAM,CAsBR"}