pi-harness-runtime 0.10.11 → 0.10.13

package/packages/autonomous-refactor/src/detector.ts

@@ -0,0 +1,219 @@
+/**
+ * Autonomous Refactor — Pattern Detection (RFC-0092)
+ */
+
+import type { RefactorFinding, RiskLevel } from "./types.js";
+
+let findingCounter = 0;
+
+export function detectRefactorings(
+	files: Array<{ path: string; content: string }>,
+): RefactorFinding[] {
+	const findings: RefactorFinding[] = [];
+
+	for (const file of files) {
+		findings.push(...detectMagicLiterals(file));
+		findings.push(...detectLongFunctions(file));
+		findings.push(...detectNestedConditionals(file));
+		findings.push(...detectUnusedVariables(file));
+	}
+
+	return findings.sort((a, b) => b.confidence - a.confidence);
+}
+
+function detectMagicLiterals(file: {
+	path: string;
+	content: string;
+}): RefactorFinding[] {
+	const findings: RefactorFinding[] = [];
+	const lines = file.content.split("\n");
+
+	for (let i = 0; i < lines.length; i++) {
+		const line = lines[i];
+		if (line.includes("//") || line.includes("/*")) continue;
+
+		const magicMatch = line.match(/\b([2-9]|[1-9]\d+)\b/g);
+		if (magicMatch && magicMatch.length > 0) {
+			findings.push({
+				id: `ref-${++findingCounter}-${Date.now()}`,
+				type: "replace-magic-literal",
+				file: file.path,
+				location: { line: i + 1, column: line.search(/\d/) + 1 },
+				description: `Magic number "${magicMatch[0]}" found`,
+				risk: "low",
+				confidence: 0.75,
+				rationale: [
+					"Magic numbers reduce readability",
+					"Named constants are self-documenting",
+				],
+			});
+		}
+
+		const strMatch = line.match(/'([^']{4,})'/g) || line.match(/"([^"]{4,})"/g);
+		if (strMatch && !strMatch.some((m) => m.toLowerCase().includes("url"))) {
+			findings.push({
+				id: `ref-${++findingCounter}-${Date.now()}`,
+				type: "replace-magic-literal",
+				file: file.path,
+				location: { line: i + 1, column: line.indexOf(strMatch[0]) + 1 },
+				description: `Magic string literal found`,
+				risk: "low",
+				confidence: 0.6,
+				rationale: ["String literals without context reduce clarity"],
+			});
+		}
+	}
+
+	return findings.slice(0, 5);
+}
+
+function detectLongFunctions(file: {
+	path: string;
+	content: string;
+}): RefactorFinding[] {
+	const findings: RefactorFinding[] = [];
+	const lines = file.content.split("\n");
+	const THRESHOLD = 30;
+	let braceDepth = 0;
+	let funcStart = -1;
+	// foundFunc removed, use funcStart < 0 as sentinel
+	let funcName = "anonymous";
+
+	for (let i = 0; i < lines.length; i++) {
+		const line = lines[i];
+		braceDepth += (line.match(/\{/g) || []).length;
+		braceDepth -= (line.match(/\}/g) || []).length;
+
+		const funcMatch = line.match(
+			/(?:function\s+(\w+)|const\s+(\w+)\s*=|(\w+)\s*\([^)]*\)\s*\{)/,
+		);
+		// Only capture function start once — avoid re-matching const/arrow as functions
+		if (funcMatch && funcStart < 0) {
+			funcStart = i;
+			funcName = funcMatch[1] ?? funcMatch[2] ?? funcMatch[3] ?? "anonymous";
+		}
+
+		if (funcStart >= 0 && braceDepth === 0) {
+			const funcLength = i - funcStart + 1;
+			if (funcLength > THRESHOLD) {
+				findings.push({
+					id: `ref-${++findingCounter}-${Date.now()}`,
+					type: "extract-method",
+					file: file.path,
+					location: { line: funcStart + 1, column: 1 },
+					description: `Function "${funcName}" is ${funcLength} lines (threshold: ${THRESHOLD})`,
+					risk: "medium",
+					confidence: 0.7,
+					rationale: [
+						"Long functions are harder to test",
+						"Splitting improves single responsibility",
+						`Current length: ${funcLength} lines`,
+					],
+				});
+			}
+			funcStart = -1;
+		}
+	}
+
+	return findings;
+}
+
+function detectNestedConditionals(file: {
+	path: string;
+	content: string;
+}): RefactorFinding[] {
+	const findings: RefactorFinding[] = [];
+	const lines = file.content.split("\n");
+	let maxDepth = 0;
+	let currentDepth = 0;
+	let maxLine = 0;
+
+	for (let i = 0; i < lines.length; i++) {
+		const line = lines[i].trim();
+		if (
+			line.startsWith("if") ||
+			line.startsWith("else if") ||
+			line.includes("?")
+		) {
+			currentDepth++;
+			if (currentDepth > maxDepth) {
+				maxDepth = currentDepth;
+				maxLine = i + 1;
+			}
+		}
+		if (line === "}" && currentDepth > 0) currentDepth--;
+	}
+
+	if (maxDepth > 3) {
+		findings.push({
+			id: `ref-${++findingCounter}-${Date.now()}`,
+			type: "simplify-conditional",
+			file: file.path,
+			location: { line: maxLine, column: 1 },
+			description: `${maxDepth} levels of nested conditionals detected`,
+			risk: "medium",
+			confidence: 0.65,
+			rationale: [
+				"Deep nesting reduces readability",
+				"Consider early returns or polymorphism",
+			],
+		});
+	}
+
+	return findings;
+}
+
+function detectUnusedVariables(file: {
+	path: string;
+	content: string;
+}): RefactorFinding[] {
+	const findings: RefactorFinding[] = [];
+	const lines = file.content.split("\n");
+
+	for (let i = 0; i < lines.length; i++) {
+		const line = lines[i];
+		const declMatch = line.match(/^\s*(const|let|var)\s+([a-zA-Z_]\w*)\s*=/);
+		if (!declMatch) continue;
+
+		const varName = declMatch[2];
+		const afterDecl = lines.slice(i + 1).join("\n");
+
+		// Count by splitting instead of regex to avoid ReDoS
+		const escaped = varName.replace(/[.*+?^${}()|[\]\\]/g, "\\$&");
+		const pattern = new RegExp(`\\b${escaped}\\b`, "g");
+		const occurrences = (afterDecl.match(pattern) || []).length;
+
+		if (occurrences === 0 && !varName.startsWith("_")) {
+			findings.push({
+				id: `ref-${++findingCounter}-${Date.now()}`,
+				type: "rename-variable",
+				file: file.path,
+				location: { line: i + 1, column: line.indexOf(varName) + 1 },
+				description: `Variable "${varName}" appears unused after declaration`,
+				risk: "low",
+				confidence: 0.6,
+				rationale: ["Unused variables add noise", "Remove or use the variable"],
+			});
+		}
+	}
+
+	return findings;
+}
+
+export function assessRisk(finding: RefactorFinding): RiskLevel {
+	return finding.risk;
+}
+
+export function calculatePriority(finding: RefactorFinding): number {
+	const confidenceWeight = 0.4;
+	const riskWeight: Record<RiskLevel, number> = {
+		low: 0.2,
+		medium: 0.4,
+		high: 0.7,
+		critical: 1.0,
+	};
+	return (
+		finding.confidence * confidenceWeight +
+		(1 - finding.confidence) * riskWeight[finding.risk]
+	);
+}

package/packages/autonomous-refactor/src/index.ts

@@ -0,0 +1,16 @@
+/**
+ * Autonomous Refactor — Main Entry (RFC-0092)
+ */
+
+export {
+	detectRefactorings,
+	assessRisk,
+	calculatePriority,
+} from "./detector.js";
+export {
+	createPlan,
+	filterByRisk,
+	groupByFile,
+	groupByType,
+} from "./planner.js";
+export type * from "./types.js";

package/packages/autonomous-refactor/src/planner.ts

@@ -0,0 +1,99 @@
+/**
+ * Autonomous Refactor — Planning Engine (RFC-0092)
+ */
+
+import type {
+	RefactorFinding,
+	RefactorPlan,
+	RefactorConfig,
+	RiskLevel,
+} from "./types.js";
+import { DEFAULT_CONFIG } from "./types.js";
+import { calculatePriority } from "./detector.js";
+
+export function createPlan(
+	findings: RefactorFinding[],
+	config?: Partial<RefactorConfig>,
+): RefactorPlan {
+	const cfg = { ...DEFAULT_CONFIG, ...config } as Required<RefactorConfig>;
+
+	const riskOrder: Record<RiskLevel, number> = {
+		low: 0,
+		medium: 1,
+		high: 2,
+		critical: 3,
+	};
+	const threshold = riskOrder[cfg.riskThreshold];
+
+	const filtered = findings.filter((f) => riskOrder[f.risk] <= threshold);
+	const sorted = [...filtered].sort(
+		(a, b) => calculatePriority(b) - calculatePriority(a),
+	);
+	const limited = sorted.slice(0, cfg.maxFindings);
+
+	const blockers: string[] = [];
+	if (cfg.preserveBehavior) {
+		blockers.push("All changes must preserve existing behavior");
+	}
+
+	const avgRisk =
+		limited.reduce((sum, f) => {
+			const riskMap: Record<RiskLevel, number> = {
+				low: 5,
+				medium: 15,
+				high: 30,
+				critical: 50,
+			};
+			return sum + (riskMap[f.risk] ?? 0);
+		}, 0) / Math.max(limited.length, 1);
+
+	return {
+		id: `plan-${Date.now()}-${Math.random().toString(36).slice(2, 8)}`,
+		findings: limited,
+		priorityOrder: limited.map((f) => f.id),
+		estimatedImpact: {
+			complexityReduction: Math.min(avgRisk, 40),
+			maintainabilityImprovement: avgRisk * 0.8,
+			riskExposure: avgRisk * 0.6,
+		},
+		blockers,
+	};
+}
+
+export function filterByRisk(
+	findings: RefactorFinding[],
+	maxRisk: RiskLevel,
+): RefactorFinding[] {
+	const riskOrder: Record<RiskLevel, number> = {
+		low: 0,
+		medium: 1,
+		high: 2,
+		critical: 3,
+	};
+	const threshold = riskOrder[maxRisk];
+	return findings.filter((f) => riskOrder[f.risk] <= threshold);
+}
+
+export function groupByFile(
+	findings: RefactorFinding[],
+): Map<string, RefactorFinding[]> {
+	const groups = new Map<string, RefactorFinding[]>();
+	for (const f of findings) {
+		const existing = groups.get(f.file) ?? [];
+		existing.push(f);
+		groups.set(f.file, existing);
+	}
+	return groups;
+}
+
+export function groupByType(
+	findings: RefactorFinding[],
+): Map<RefactorFinding["type"], RefactorFinding[]> {
+	const groups = new Map<RefactorFinding["type"], RefactorFinding[]>();
+	for (const f of findings) {
+		const existing = groups.get(f.type) ?? [];
+		existing.push(f);
+		groups.set(f.type, existing);
+	}
+	return groups;
+}

package/packages/autonomous-refactor/src/types.ts

@@ -0,0 +1,57 @@
+/**
+ * Autonomous Refactor — Types (RFC-0092)
+ */
+
+export type RefactorType =
+	| "extract-method"
+	| "inline-method"
+	| "rename-variable"
+	| "move-function"
+	| "extract-interface"
+	| "replace-loop-pipeline"
+	| "introduce-null-object"
+	| "extract-superclass"
+	| "simplify-conditional"
+	| "replace-magic-literal";
+
+export type RiskLevel = "low" | "medium" | "high" | "critical";
+
+export interface RefactorFinding {
+	id: string;
+	type: RefactorType;
+	file: string;
+	location: { line: number; column: number };
+	description: string;
+	risk: RiskLevel;
+	confidence: number;
+	suggestedFix?: string;
+	rationale?: string[];
+}
+
+export interface RefactorPlan {
+	id: string;
+	findings: RefactorFinding[];
+	priorityOrder: string[];
+	estimatedImpact: {
+		complexityReduction: number;
+		maintainabilityImprovement: number;
+		riskExposure: number;
+	};
+	blockers: string[];
+}
+
+export interface RefactorConfig {
+	maxFindings: number;
+	riskThreshold: RiskLevel;
+	autoApply: boolean;
+	requireReviewAbove: RiskLevel;
+	preserveBehavior: boolean;
+}
+
+export const DEFAULT_CONFIG: Required<RefactorConfig> = {
+	maxFindings: 50,
+	riskThreshold: "medium",
+	autoApply: false,
+	requireReviewAbove: "high",
+	preserveBehavior: true,
+};

package/packages/autonomous-runtime/dist/inbox.d.ts

@@ -0,0 +1,75 @@
+import type { TaskRecord, TaskStatus, TaskEvent } from "./types.js";
+export declare class InboxError extends Error {
+    constructor(msg: string);
+}
+/**
+ * Manages the append-only task inbox at `~/.pi/harness/inbox/tasks.jsonl`.
+ *
+ * Storage layout:
+ * ```
+ * ~/.pi/harness/inbox/
+ * +-- tasks.jsonl   # append-only log (one JSON line per task)
+ * +-- claimed/      # active leases (one JSON file per task)
+ * +-- BACKLOG.md   # human-friendly authoring surface (optional)
+ * ```
+ *
+ * Operations are:
+ * - **append**  — append a new task to tasks.jsonl
+ * - **list**    — read all tasks, filterable by status
+ * - **transition** — update a task's status in-place (rewrite)
+ * - **get**     — read one task by id
+ * - **reindex** — compact tasks.jsonl by rewriting it from in-memory state
+ */
+export declare class TaskInbox {
+    private readonly tasksPath;
+    private readonly inboxDir;
+    private _cache;
+    constructor(options?: {
+        tasksPath?: string;
+        inboxDir?: string;
+    });
+    /** Ensure the inbox directory exists. Call before any write. */
+    ensureDir(): void;
+    /**
+     * Append a new task to tasks.jsonl.
+     * The task is validated before writing. Duplicate ids are rejected.
+     *
+     * @throws {InboxError} if the task id already exists or validation fails
+     */
+    append(task: TaskRecord): void;
+    /**
+     * Read all tasks from tasks.jsonl.
+     * Results are sorted by priority ASC then createdAt ASC (oldest first).
+     *
+     * @param filter Optionally filter by status. If omitted, returns all.
+     */
+    list(filter?: {
+        status?: TaskStatus | TaskStatus[];
+    }): TaskRecord[];
+    /** Retrieve a single task by id, or null if not found. */
+    get(id: string): TaskRecord | null;
+    /**
+     * Update a task's status in-place inside tasks.jsonl.
+     *
+     * Uses read→parse→update→rewrite to avoid corrupting the JSONL file.
+     * The rewrite is atomic (write-tmp-then-rename).
+     *
+     * @param taskId       The id of the task to transition
+     * @param newStatus    The target status
+     * @param extra       Optional additional fields to merge into the task record
+     * @param event       Optional TaskEvent to append to the history
+     * @throws {InboxError} if the task does not exist
+     */
+    transition(taskId: string, newStatus: TaskStatus, extra?: Partial<TaskRecord>, event?: TaskEvent): TaskRecord;
+    /** Convenience: mark a task as completed with a result. */
+    complete(taskId: string, result: TaskRecord["result"]): TaskRecord;
+    /** Convenience: mark a task as failed with a reason. */
+    fail(taskId: string, reason: string): TaskRecord;
+    /** Rewrite tasks.jsonl from the given task list. */
+    private _rewriteAll;
+    /** Force a full reindex. Call after manual edits to tasks.jsonl. */
+    reindex(): void;
+    /** Return counts of tasks grouped by status. */
+    stats(): Record<TaskStatus, number>;
+}
+//# sourceMappingURL=inbox.d.ts.map

package/packages/autonomous-runtime/dist/inbox.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"inbox.d.ts","sourceRoot":"","sources":["../src/inbox.ts"],"names":[],"mappings":"AAcA,OAAO,KAAK,EAAE,UAAU,EAAE,UAAU,EAAE,SAAS,EAAE,MAAM,YAAY,CAAC;AAKpE,qBAAa,UAAW,SAAQ,KAAK;IACpC,YAAY,GAAG,EAAE,MAAM,EAGtB;CACD;AAID;;;;;;;;;;;;;;;;;GAiBG;AACH,qBAAa,SAAS;IACrB,OAAO,CAAC,QAAQ,CAAC,SAAS,CAAS;IACnC,OAAO,CAAC,QAAQ,CAAC,QAAQ,CAAS;IAClC,OAAO,CAAC,MAAM,CAA6B;IAE3C,YAAY,OAAO,GAAE;QAAE,SAAS,CAAC,EAAE,MAAM,CAAC;QAAC,QAAQ,CAAC,EAAE,MAAM,CAAA;KAAO,EAGlE;IAED,gEAAgE;IAChE,SAAS,IAAI,IAAI,CAIhB;IAID;;;;;OAKG;IACH,MAAM,CAAC,IAAI,EAAE,UAAU,GAAG,IAAI,CAc7B;IAID;;;;;OAKG;IACH,IAAI,CAAC,MAAM,CAAC,EAAE;QAAE,MAAM,CAAC,EAAE,UAAU,GAAG,UAAU,EAAE,CAAA;KAAE,GAAG,UAAU,EAAE,CAoClE;IAID,0DAA0D;IAC1D,GAAG,CAAC,EAAE,EAAE,MAAM,GAAG,UAAU,GAAG,IAAI,CAGjC;IAID;;;;;;;;;;;OAWG;IACH,UAAU,CACT,MAAM,EAAE,MAAM,EACd,SAAS,EAAE,UAAU,EACrB,KAAK,CAAC,EAAE,OAAO,CAAC,UAAU,CAAC,EAC3B,KAAK,CAAC,EAAE,SAAS,GACf,UAAU,CAqCZ;IAID,2DAA2D;IAC3D,QAAQ,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,UAAU,CAAC,QAAQ,CAAC,GAAG,UAAU,CAWjE;IAED,wDAAwD;IACxD,IAAI,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,GAAG,UAAU,CAe/C;IAID,oDAAoD;IACpD,OAAO,CAAC,WAAW;IAUnB,oEAAoE;IACpE,OAAO,IAAI,IAAI,CAKd;IAID,gDAAgD;IAChD,KAAK,IAAI,MAAM,CAAC,UAAU,EAAE,MAAM,CAAC,CAOlC;CACD"}

package/packages/autonomous-runtime/dist/inbox.js

@@ -0,0 +1,212 @@
+/**
+ * Task Inbox — RFC-0101 §2
+ *
+ * Append-only durable store for TaskRecords backed by `tasks.jsonl`.
+ * One JSONL line per task — easy to tail, grep, and replay.
+ */
+import { appendFileSync, existsSync, mkdirSync, readFileSync, writeFileSync, } from "node:fs";
+import { getInboxDir, getTasksPath } from "./types.js";
+// --- Errors -------------------------------------------------------------------
+export class InboxError extends Error {
+    constructor(msg) {
+        super(`[InboxError] ${msg}`);
+        this.name = "InboxError";
+    }
+}
+// --- TaskInbox ----------------------------------------------------------------
+/**
+ * Manages the append-only task inbox at `~/.pi/harness/inbox/tasks.jsonl`.
+ *
+ * Storage layout:
+ * ```
+ * ~/.pi/harness/inbox/
+ * +-- tasks.jsonl   # append-only log (one JSON line per task)
+ * +-- claimed/      # active leases (one JSON file per task)
+ * +-- BACKLOG.md   # human-friendly authoring surface (optional)
+ * ```
+ *
+ * Operations are:
+ * - **append**  — append a new task to tasks.jsonl
+ * - **list**    — read all tasks, filterable by status
+ * - **transition** — update a task's status in-place (rewrite)
+ * - **get**     — read one task by id
+ * - **reindex** — compact tasks.jsonl by rewriting it from in-memory state
+ */
+export class TaskInbox {
+    tasksPath;
+    inboxDir;
+    _cache = null;
+    constructor(options = {}) {
+        this.inboxDir = options.inboxDir ?? getInboxDir();
+        this.tasksPath = options.tasksPath ?? getTasksPath();
+    }
+    /** Ensure the inbox directory exists. Call before any write. */
+    ensureDir() {
+        if (!existsSync(this.inboxDir)) {
+            mkdirSync(this.inboxDir, { recursive: true });
+        }
+    }
+    // --- append --------------------------------------------------------------
+    /**
+     * Append a new task to tasks.jsonl.
+     * The task is validated before writing. Duplicate ids are rejected.
+     *
+     * @throws {InboxError} if the task id already exists or validation fails
+     */
+    append(task) {
+        this.ensureDir();
+        // Guard against duplicate ids
+        const existing = this.list().find((t) => t.id === task.id);
+        if (existing) {
+            throw new InboxError(`Task ${task.id} already exists in inbox (status=${existing.status})`);
+        }
+        const line = JSON.stringify(task) + "\n";
+        appendFileSync(this.tasksPath, line, "utf8");
+        this._cache = null; // invalidate
+    }
+    // --- list -----------------------------------------------------------------
+    /**
+     * Read all tasks from tasks.jsonl.
+     * Results are sorted by priority ASC then createdAt ASC (oldest first).
+     *
+     * @param filter Optionally filter by status. If omitted, returns all.
+     */
+    list(filter) {
+        if (!existsSync(this.tasksPath)) {
+            return [];
+        }
+        const raw = readFileSync(this.tasksPath, "utf8");
+        const tasks = [];
+        for (const line of raw.split("\n")) {
+            const trimmed = line.trim();
+            if (!trimmed)
+                continue;
+            try {
+                const task = JSON.parse(trimmed);
+                tasks.push(task);
+            }
+            catch {
+                // Corrupt line — skip but don't fail the whole list
+                console.warn(`[TaskInbox] Skipping corrupt line in ${this.tasksPath}`);
+            }
+        }
+        // Filter by status
+        let filtered = tasks;
+        if (filter?.status !== undefined) {
+            const statuses = Array.isArray(filter.status)
+                ? filter.status
+                : [filter.status];
+            filtered = tasks.filter((t) => statuses.includes(t.status));
+        }
+        // Sort: priority ASC, then createdAt ASC
+        filtered.sort((a, b) => {
+            if (a.priority !== b.priority)
+                return a.priority - b.priority;
+            return a.createdAt.localeCompare(b.createdAt);
+        });
+        return filtered;
+    }
+    // --- get -----------------------------------------------------------------
+    /** Retrieve a single task by id, or null if not found. */
+    get(id) {
+        const tasks = this.list();
+        return tasks.find((t) => t.id === id) ?? null;
+    }
+    // --- transition ----------------------------------------------------------
+    /**
+     * Update a task's status in-place inside tasks.jsonl.
+     *
+     * Uses read→parse→update→rewrite to avoid corrupting the JSONL file.
+     * The rewrite is atomic (write-tmp-then-rename).
+     *
+     * @param taskId       The id of the task to transition
+     * @param newStatus    The target status
+     * @param extra       Optional additional fields to merge into the task record
+     * @param event       Optional TaskEvent to append to the history
+     * @throws {InboxError} if the task does not exist
+     */
+    transition(taskId, newStatus, extra, event) {
+        if (!existsSync(this.tasksPath)) {
+            throw new InboxError(`tasks.jsonl does not exist at ${this.tasksPath}`);
+        }
+        const tasks = this.list();
+        const idx = tasks.findIndex((t) => t.id === taskId);
+        if (idx === -1) {
+            throw new InboxError(`Task ${taskId} not found in inbox`);
+        }
+        const updated = {
+            ...tasks[idx],
+            ...extra,
+            status: newStatus,
+            updatedAt: new Date().toISOString(),
+            history: event
+                ? [...tasks[idx].history, event]
+                : [
+                    ...tasks[idx].history,
+                    {
+                        ts: new Date().toISOString(),
+                        kind: "transitioned",
+                        payload: { from: tasks[idx].status, to: newStatus },
+                    },
+                ],
+        };
+        // Rewrite tasks.jsonl atomically
+        this._rewriteAll([
+            ...tasks.slice(0, idx),
+            updated,
+            ...tasks.slice(idx + 1),
+        ]);
+        this._cache = null;
+        return updated;
+    }
+    // --- markDone / markFailed -----------------------------------------------
+    /** Convenience: mark a task as completed with a result. */
+    complete(taskId, result) {
+        return this.transition(taskId, "completed", { result }, {
+            ts: new Date().toISOString(),
+            kind: "completed",
+            payload: { result },
+        });
+    }
+    /** Convenience: mark a task as failed with a reason. */
+    fail(taskId, reason) {
+        const task = this.get(taskId);
+        const attempts = (task?.attempts ?? 0) + 1;
+        const newStatus = attempts >= (task?.maxAttempts ?? 3) ? "dead_letter" : "retrying";
+        return this.transition(taskId, newStatus, { failureReason: reason, attempts }, {
+            ts: new Date().toISOString(),
+            kind: newStatus === "dead_letter" ? "dead_lettered" : "failed",
+            payload: { reason, attempts },
+        });
+    }
+    // --- reindex -------------------------------------------------------------
+    /** Rewrite tasks.jsonl from the given task list. */
+    _rewriteAll(tasks) {
+        const tmp = `${this.tasksPath}.tmp`;
+        const content = tasks.map((t) => JSON.stringify(t)).join("\n") + "\n";
+        writeFileSync(tmp, content, "utf8");
+        // Atomic rename (POSIX guarantees atomicity)
+        // Bun/Node will use the native rename which is atomic on POSIX
+        const { renameSync } = require("node:fs");
+        renameSync(tmp, this.tasksPath);
+    }
+    /** Force a full reindex. Call after manual edits to tasks.jsonl. */
+    reindex() {
+        if (!existsSync(this.tasksPath))
+            return;
+        const tasks = this.list(); // reads and validates
+        this._rewriteAll(tasks);
+        this._cache = null;
+    }
+    // --- count ---------------------------------------------------------------
+    /** Return counts of tasks grouped by status. */
+    stats() {
+        const tasks = this.list();
+        const counts = {};
+        for (const t of tasks) {
+            counts[t.status] = (counts[t.status] ?? 0) + 1;
+        }
+        return counts;
+    }
+}
+//# sourceMappingURL=inbox.js.map

package/packages/autonomous-runtime/dist/inbox.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"inbox.js","sourceRoot":"","sources":["../src/inbox.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AACH,OAAO,EACN,cAAc,EACd,UAAU,EACV,SAAS,EACT,YAAY,EACZ,aAAa,GACb,MAAM,SAAS,CAAC;AAGjB,OAAO,EAAE,WAAW,EAAE,YAAY,EAAE,MAAM,YAAY,CAAC;AAEvD,iFAAiF;AAEjF,MAAM,OAAO,UAAW,SAAQ,KAAK;IACpC,YAAY,GAAW;QACtB,KAAK,CAAC,gBAAgB,GAAG,EAAE,CAAC,CAAC;QAC7B,IAAI,CAAC,IAAI,GAAG,YAAY,CAAC;IAC1B,CAAC;CACD;AAED,iFAAiF;AAEjF;;;;;;;;;;;;;;;;;GAiBG;AACH,MAAM,OAAO,SAAS;IACJ,SAAS,CAAS;IAClB,QAAQ,CAAS;IAC1B,MAAM,GAAwB,IAAI,CAAC;IAE3C,YAAY,OAAO,GAA8C,EAAE;QAClE,IAAI,CAAC,QAAQ,GAAG,OAAO,CAAC,QAAQ,IAAI,WAAW,EAAE,CAAC;QAClD,IAAI,CAAC,SAAS,GAAG,OAAO,CAAC,SAAS,IAAI,YAAY,EAAE,CAAC;IACtD,CAAC;IAED,gEAAgE;IAChE,SAAS;QACR,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC;YAChC,SAAS,CAAC,IAAI,CAAC,QAAQ,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;QAC/C,CAAC;IACF,CAAC;IAED,4EAA4E;IAE5E;;;;;OAKG;IACH,MAAM,CAAC,IAAgB;QACtB,IAAI,CAAC,SAAS,EAAE,CAAC;QAEjB,8BAA8B;QAC9B,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,IAAI,CAAC,EAAE,CAAC,CAAC;QAC3D,IAAI,QAAQ,EAAE,CAAC;YACd,MAAM,IAAI,UAAU,CACnB,QAAQ,IAAI,CAAC,EAAE,oCAAoC,QAAQ,CAAC,MAAM,GAAG,CACrE,CAAC;QACH,CAAC;QAED,MAAM,IAAI,GAAG,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC;QACzC,cAAc,CAAC,IAAI,CAAC,SAAS,EAAE,IAAI,EAAE,MAAM,CAAC,CAAC;QAC7C,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,CAAC,aAAa;IAClC,CAAC;IAED,6EAA6E;IAE7E;;;;;OAKG;IACH,IAAI,CAAC,MAA+C;QACnD,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,SAAS,CAAC,EAAE,CAAC;YACjC,OAAO,EAAE,CAAC;QACX,CAAC;QAED,MAAM,GAAG,GAAG,YAAY,CAAC,IAAI,CAAC,SAAS,EAAE,MAAM,CAAC,CAAC;QACjD,MAAM,KAAK,GAAiB,EAAE,CAAC;QAE/B,KAAK,MAAM,IAAI,IAAI,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC;YACpC,MAAM,OAAO,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC;YAC5B,IAAI,CAAC,OAAO;gBAAE,SAAS;YACvB,IAAI,CAAC;gBACJ,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAe,CAAC;gBAC/C,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAClB,CAAC;YAAC,MAAM,CAAC;gBACR,oDAAoD;gBACpD,OAAO,CAAC,IAAI,CAAC,wCAAwC,IAAI,CAAC,SAAS,EAAE,CAAC,CAAC;YACxE,CAAC;QACF,CAAC;QAED,mBAAmB;QACnB,IAAI,QAAQ,GAAG,KAAK,CAAC;QACrB,IAAI,MAAM,EAAE,MAAM,KAAK,SAAS,EAAE,CAAC;YAClC,MAAM,QAAQ,GAAG,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,MAAM,CAAC;gBAC5C,CAAC,CAAC,MAAM,CAAC,MAAM;gBACf,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;YACnB,QAAQ,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC;QAC7D,CAAC;QAED,yCAAyC;QACzC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;YACtB,IAAI,CAAC,CAAC,QAAQ,KAAK,CAAC,CAAC,QAAQ;gBAAE,OAAO,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,QAAQ,CAAC;YAC9D,OAAO,CAAC,CAAC,SAAS,CAAC,aAAa,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;QAC/C,CAAC,CAAC,CAAC;QAEH,OAAO,QAAQ,CAAC;IACjB,CAAC;IAED,4EAA4E;IAE5E,0DAA0D;IAC1D,GAAG,CAAC,EAAU;QACb,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC;QAC1B,OAAO,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,IAAI,IAAI,CAAC;IAC/C,CAAC;IAED,4EAA4E;IAE5E;;;;;;;;;;;OAWG;IACH,UAAU,CACT,MAAc,EACd,SAAqB,EACrB,KAA2B,EAC3B,KAAiB;QAEjB,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,SAAS,CAAC,EAAE,CAAC;YACjC,MAAM,IAAI,UAAU,CAAC,iCAAiC,IAAI,CAAC,SAAS,EAAE,CAAC,CAAC;QACzE,CAAC;QAED,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC;QAC1B,MAAM,GAAG,GAAG,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,MAAM,CAAC,CAAC;QACpD,IAAI,GAAG,KAAK,CAAC,CAAC,EAAE,CAAC;YAChB,MAAM,IAAI,UAAU,CAAC,QAAQ,MAAM,qBAAqB,CAAC,CAAC;QAC3D,CAAC;QAED,MAAM,OAAO,GAAe;YAC3B,GAAG,KAAK,CAAC,GAAG,CAAC;YACb,GAAG,KAAK;YACR,MAAM,EAAE,SAAS;YACjB,SAAS,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;YACnC,OAAO,EAAE,KAAK;gBACb,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,OAAO,EAAE,KAAK,CAAC;gBAChC,CAAC,CAAC;oBACA,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,OAAO;oBACrB;wBACC,EAAE,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;wBAC5B,IAAI,EAAE,cAAc;wBACpB,OAAO,EAAE,EAAE,IAAI,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,EAAE,EAAE,SAAS,EAAE;qBACnD;iBACD;SACH,CAAC;QAEF,iCAAiC;QACjC,IAAI,CAAC,WAAW,CAAC;YAChB,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC;YACtB,OAAO;YACP,GAAG,KAAK,CAAC,KAAK,CAAC,GAAG,GAAG,CAAC,CAAC;SACvB,CAAC,CAAC;QACH,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC;QAEnB,OAAO,OAAO,CAAC;IAChB,CAAC;IAED,4EAA4E;IAE5E,2DAA2D;IAC3D,QAAQ,CAAC,MAAc,EAAE,MAA4B;QACpD,OAAO,IAAI,CAAC,UAAU,CACrB,MAAM,EACN,WAAW,EACX,EAAE,MAAM,EAAE,EACV;YACC,EAAE,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;YAC5B,IAAI,EAAE,WAAW;YACjB,OAAO,EAAE,EAAE,MAAM,EAAE;SACnB,CACD,CAAC;IACH,CAAC;IAED,wDAAwD;IACxD,IAAI,CAAC,MAAc,EAAE,MAAc;QAClC,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QAC9B,MAAM,QAAQ,GAAG,CAAC,IAAI,EAAE,QAAQ,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;QAC3C,MAAM,SAAS,GACd,QAAQ,IAAI,CAAC,IAAI,EAAE,WAAW,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,UAAU,CAAC;QACnE,OAAO,IAAI,CAAC,UAAU,CACrB,MAAM,EACN,SAAS,EACT,EAAE,aAAa,EAAE,MAAM,EAAE,QAAQ,EAAE,EACnC;YACC,EAAE,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;YAC5B,IAAI,EAAE,SAAS,KAAK,aAAa,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,QAAQ;YAC9D,OAAO,EAAE,EAAE,MAAM,EAAE,QAAQ,EAAE;SAC7B,CACD,CAAC;IACH,CAAC;IAED,4EAA4E;IAE5E,oDAAoD;IAC5C,WAAW,CAAC,KAAmB;QACtC,MAAM,GAAG,GAAG,GAAG,IAAI,CAAC,SAAS,MAAM,CAAC;QACpC,MAAM,OAAO,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC;QACtE,aAAa,CAAC,GAAG,EAAE,OAAO,EAAE,MAAM,CAAC,CAAC;QACpC,6CAA6C;QAC7C,+DAA+D;QAC/D,MAAM,EAAE,UAAU,EAAE,GAAG,OAAO,CAAC,SAAS,CAAC,CAAC;QAC1C,UAAU,CAAC,GAAG,EAAE,IAAI,CAAC,SAAS,CAAC,CAAC;IACjC,CAAC;IAED,oEAAoE;IACpE,OAAO;QACN,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,SAAS,CAAC;YAAE,OAAO;QACxC,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,sBAAsB;QACjD,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC;QACxB,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC;IACpB,CAAC;IAED,4EAA4E;IAE5E,gDAAgD;IAChD,KAAK;QACJ,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC;QAC1B,MAAM,MAAM,GAA2B,EAAE,CAAC;QAC1C,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;YACvB,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;QAChD,CAAC;QACD,OAAO,MAAoC,CAAC;IAC7C,CAAC;CACD"}