@exla/rudder 0.0.0-stage → 3.4.1

package/dist/graph.d.ts

@@ -0,0 +1,93 @@
+import type { DepType, NodeStatus, RudderGraph, RunRecord, TaskNode } from "./types.js";
+export declare function graphPath(repoRoot: string): string;
+/**
+ * Read the graph for a repo. Returns an empty graph (not null) when graph.json
+ * is absent or malformed, so callers never special-case the first-write path.
+ */
+export declare function readGraph(repoRoot: string): Promise<RudderGraph>;
+/**
+ * Content-hashed node id: stable mergeable key from the title, the current
+ * time, and a nonce so two nodes with the same title never collide.
+ */
+export declare function newNodeId(title: string): string;
+export declare function newEdgeId(from: string, to: string): string;
+/**
+ * Atomically read-modify-write the graph under the per-path lock (daemon-only
+ * writer). The transform mutates/returns the graph; keys are sorted and the
+ * updatedAt stamp refreshed before write so diffs stay minimal.
+ */
+export declare function updateGraph(repoRoot: string, fn: (graph: RudderGraph) => RudderGraph | void): Promise<RudderGraph>;
+/** A dependency edge in the mirror payload: this node depends `on` another. */
+export type MirrorDep = {
+    on: string;
+    type: DepType;
+};
+/** One node in the mirror payload. Only `id`, `title`, `status`, and `deps` are
+ * load-bearing; the rest enrich the board projection when the TUI knows them. */
+export type MirrorNode = {
+    id: string;
+    title: string;
+    prompt?: string;
+    status: string;
+    runId?: string;
+    jjChangeId?: string;
+    backend?: string;
+    model?: string;
+    effort?: string;
+    workspacePath?: string;
+    deps?: MirrorDep[];
+};
+export type MirrorPayload = {
+    nodes?: MirrorNode[];
+};
+/** Map a TUI status string onto the DAG-level NodeStatus vocabulary. Unknown
+ * values fall back to "planned" so a malformed payload never crashes the mirror. */
+export declare function mirrorNodeStatus(status: string | undefined): NodeStatus;
+/**
+ * Project a TUI plan payload into the graph, IN PLACE. Upserts every node in the
+ * payload (mapping TUI status -> NodeStatus), rebuilds each node's incoming edges
+ * from its deps, and PRUNES any graph node/edge no longer present in the payload
+ * so the mirror exactly reflects the current TUI plan (not an append-only log).
+ * Pure (no IO): callers wrap it in updateGraph. The prompt is taken from the
+ * payload when present (so a re-plan that reuses a node id cannot leave a stale
+ * prompt from the previous plan); source/createdAt are preserved on upsert;
+ * everything else is overwritten from the payload.
+ */
+export declare function mirrorPlanIntoGraph(graph: RudderGraph, payload: MirrorPayload): RudderGraph;
+export declare function hardParents(graph: RudderGraph, id: string): string[];
+export declare function softParents(graph: RudderGraph, id: string): string[];
+/**
+ * Judge parents of a node: the variants a judge node compares. A judge edge
+ * gates readiness on the variant REACHING review (finishing its work), not on
+ * merge. Fan-out-and-judge uses this so the judge launches once every variant
+ * has produced a diff to compare.
+ */
+export declare function judgeParents(graph: RudderGraph, id: string): string[];
+/**
+ * Direct dependents (children) of a node: nodes with an edge `from` this id.
+ */
+export declare function dependents(graph: RudderGraph, id: string): string[];
+/**
+ * A node is ready when it is still `planned` AND every hard-dep parent has
+ * merged AND every judge parent has reached review or merged. Soft parents
+ * never block readiness. A judge node (which has judge parents) launches only
+ * once all of its variants have finished their work (review or merged), so it
+ * has every variant's diff to compare.
+ */
+export declare function isReady(graph: RudderGraph, node: TaskNode): boolean;
+/**
+ * Every node eligible to launch: planned with all hard parents merged.
+ */
+export declare function readyNodes(graph: RudderGraph): TaskNode[];
+/**
+ * The frontier: non-merged leaves. A node is on the frontier when it is not
+ * merged AND has no non-merged child (every dependent is already merged, or it
+ * has no dependents). Injection reconciliation attaches new nodes here.
+ */
+export declare function frontier(graph: RudderGraph): TaskNode[];
+/**
+ * Project a worker-owned RunStatus into the DAG-level NodeStatus. With no run
+ * yet, the node keeps its deps-derived status (planned/ready/blocked); the
+ * scheduler decides those. Mirrors plan section 2's projection table.
+ */
+export declare function projectNodeStatus(node: TaskNode, run?: RunRecord): NodeStatus;

package/dist/graph.js

@@ -0,0 +1,372 @@
+import path from "node:path";
+import { adoptLegacyWorkspaceKey, ensureProjectRuntimeIgnored, projectStateDir } from "./state.js";
+import { nowIso, pathExists, readJson, shortHash, updateJson } from "./util.js";
+// ---------------------------------------------------------------------------
+// graph.json IO. The graph is the daemon-owned DAG topology. nodes/edges are
+// objects keyed by id so two branches that each add nodes merge as a clean key
+// union (no line conflicts). Keys are sorted on write for minimal diffs.
+// ---------------------------------------------------------------------------
+export function graphPath(repoRoot) {
+    return path.join(projectStateDir(repoRoot), "graph.json");
+}
+function emptyGraph(repoRoot) {
+    return {
+        version: 1,
+        repoRoot,
+        nodes: {},
+        edges: {},
+        updatedAt: nowIso(),
+    };
+}
+/**
+ * Read the graph for a repo. Returns an empty graph (not null) when graph.json
+ * is absent or malformed, so callers never special-case the first-write path.
+ */
+export async function readGraph(repoRoot) {
+    const graph = await readJson(graphPath(repoRoot));
+    if (graph && graph.version === 1 && graph.nodes && graph.edges) {
+        return {
+            version: 1,
+            repoRoot: graph.repoRoot || repoRoot,
+            ...(graph.integrationChangeId ? { integrationChangeId: graph.integrationChangeId } : {}),
+            nodes: adoptLegacyNodeWorkspaceKeys(graph.nodes),
+            edges: graph.edges,
+            updatedAt: graph.updatedAt || nowIso(),
+        };
+    }
+    return emptyGraph(repoRoot);
+}
+/**
+ * Nodes written before the worktree->workspace rename store isolation info under
+ * `worktree`. Promote it in place so the scheduler, board and TUI only ever read
+ * `workspace`; the next updateGraph persists the new key.
+ */
+function adoptLegacyNodeWorkspaceKeys(nodes) {
+    for (const node of Object.values(nodes)) {
+        adoptLegacyWorkspaceKey(node);
+    }
+    return nodes;
+}
+/**
+ * Content-hashed node id: stable mergeable key from the title, the current
+ * time, and a nonce so two nodes with the same title never collide.
+ */
+export function newNodeId(title) {
+    return shortHash(`${title}:${nowIso()}:${Math.random()}`);
+}
+export function newEdgeId(from, to) {
+    return shortHash(`${from}->${to}:${nowIso()}:${Math.random()}`);
+}
+/**
+ * Atomically read-modify-write the graph under the per-path lock (daemon-only
+ * writer). The transform mutates/returns the graph; keys are sorted and the
+ * updatedAt stamp refreshed before write so diffs stay minimal.
+ */
+export async function updateGraph(repoRoot, fn) {
+    // graph.json is mutable scheduler state, never source code. Install the
+    // exclusion before the first write even when callers bypass `rudder plan`.
+    await ensureProjectRuntimeIgnored(repoRoot);
+    let result = emptyGraph(repoRoot);
+    const file = graphPath(repoRoot);
+    const existed = await pathExists(file);
+    await updateJson(file, (current) => {
+        // Once a graph exists, a transient/contended read must never be interpreted
+        // as an empty DAG. Throwing leaves the atomic file untouched and lets the
+        // scheduler retry; silently using emptyGraph here can erase the whole fleet.
+        if (existed && !(current && current.version === 1 && current.nodes && current.edges)) {
+            throw new Error(`Refusing to replace an unreadable existing graph: ${file}`);
+        }
+        const base = current && current.version === 1 && current.nodes && current.edges
+            ? current
+            : emptyGraph(repoRoot);
+        const next = fn(base) ?? base;
+        next.version = 1;
+        next.repoRoot = next.repoRoot || repoRoot;
+        next.updatedAt = nowIso();
+        const sorted = sortGraph(next);
+        result = sorted;
+        return sorted;
+    });
+    return result;
+}
+/** Map a TUI status string onto the DAG-level NodeStatus vocabulary. Unknown
+ * values fall back to "planned" so a malformed payload never crashes the mirror. */
+export function mirrorNodeStatus(status) {
+    switch (status) {
+        case "ready":
+            return "ready";
+        case "running":
+            return "running";
+        case "review":
+            return "review";
+        case "merged":
+            return "merged";
+        case "failed":
+            return "failed";
+        case "blocked":
+            return "blocked";
+        default:
+            return "planned";
+    }
+}
+function mirrorBackend(backend) {
+    return backend === "codex" || backend === "acpx" || backend === "opencode" ? backend : "claude";
+}
+function mirrorEffort(effort) {
+    switch (effort) {
+        case "low":
+        case "medium":
+        case "high":
+        case "xhigh":
+        case "max":
+            return effort;
+        default:
+            return undefined;
+    }
+}
+/** Stable, mergeable edge id keyed only by endpoints + type (no timestamp/nonce)
+ * so re-mirroring an unchanged plan reuses the same key and the prune is a no-op. */
+function mirrorEdgeId(from, to, type) {
+    return `e_${from}__${type}__${to}`;
+}
+/**
+ * Project a TUI plan payload into the graph, IN PLACE. Upserts every node in the
+ * payload (mapping TUI status -> NodeStatus), rebuilds each node's incoming edges
+ * from its deps, and PRUNES any graph node/edge no longer present in the payload
+ * so the mirror exactly reflects the current TUI plan (not an append-only log).
+ * Pure (no IO): callers wrap it in updateGraph. The prompt is taken from the
+ * payload when present (so a re-plan that reuses a node id cannot leave a stale
+ * prompt from the previous plan); source/createdAt are preserved on upsert;
+ * everything else is overwritten from the payload.
+ */
+export function mirrorPlanIntoGraph(graph, payload) {
+    const inNodes = Array.isArray(payload.nodes) ? payload.nodes : [];
+    const createdAt = nowIso();
+    const keepNodeIds = new Set();
+    const keepEdgeIds = new Set();
+    for (const incoming of inNodes) {
+        if (!incoming || typeof incoming.id !== "string" || !incoming.id) {
+            continue;
+        }
+        keepNodeIds.add(incoming.id);
+        const title = (incoming.title || incoming.id).slice(0, 200);
+        const status = mirrorNodeStatus(incoming.status);
+        const incomingEdgeIds = [];
+        const deps = Array.isArray(incoming.deps) ? incoming.deps : [];
+        for (const dep of deps) {
+            if (!dep || typeof dep.on !== "string" || !dep.on) {
+                continue;
+            }
+            const type = dep.type === "soft" ? "soft" : "hard";
+            const edgeId = mirrorEdgeId(dep.on, incoming.id, type);
+            keepEdgeIds.add(edgeId);
+            graph.edges[edgeId] = { id: edgeId, from: dep.on, to: incoming.id, type };
+            incomingEdgeIds.push(edgeId);
+        }
+        const existing = graph.nodes[incoming.id];
+        const effort = mirrorEffort(incoming.effort);
+        // Prompt comes from the payload when it carries one, so a re-plan that reuses
+        // this id overwrites the previous plan's prompt instead of keeping it stale.
+        const prompt = typeof incoming.prompt === "string" && incoming.prompt.trim()
+            ? incoming.prompt
+            : existing?.prompt ?? title;
+        graph.nodes[incoming.id] = {
+            id: incoming.id,
+            title,
+            prompt,
+            backend: mirrorBackend(incoming.backend),
+            ...(incoming.model ? { model: incoming.model } : {}),
+            ...(effort ? { effort } : {}),
+            status,
+            ...(incoming.runId ? { runId: incoming.runId } : {}),
+            ...(incoming.workspacePath ? { workspace: { path: incoming.workspacePath } } : {}),
+            ...(incoming.jjChangeId ? { jjChangeId: incoming.jjChangeId } : {}),
+            deps: incomingEdgeIds,
+            source: existing?.source ?? "planner",
+            createdAt: existing?.createdAt ?? createdAt,
+            updatedAt: createdAt,
+        };
+    }
+    // PRUNE: drop graph nodes/edges absent from the payload so the mirror is an
+    // exact reflection of the live TUI plan.
+    for (const id of Object.keys(graph.nodes)) {
+        if (!keepNodeIds.has(id)) {
+            delete graph.nodes[id];
+        }
+    }
+    for (const id of Object.keys(graph.edges)) {
+        if (!keepEdgeIds.has(id)) {
+            delete graph.edges[id];
+        }
+    }
+    return graph;
+}
+function sortGraph(graph) {
+    const nodes = {};
+    for (const key of Object.keys(graph.nodes).sort()) {
+        const node = graph.nodes[key];
+        if (node) {
+            nodes[key] = node;
+        }
+    }
+    const edges = {};
+    for (const key of Object.keys(graph.edges).sort()) {
+        const edge = graph.edges[key];
+        if (edge) {
+            edges[key] = edge;
+        }
+    }
+    return {
+        version: 1,
+        repoRoot: graph.repoRoot,
+        ...(graph.integrationChangeId ? { integrationChangeId: graph.integrationChangeId } : {}),
+        nodes,
+        edges,
+        updatedAt: graph.updatedAt,
+    };
+}
+// ---------------------------------------------------------------------------
+// Pure queries. None of these mutate or read disk.
+// ---------------------------------------------------------------------------
+export function hardParents(graph, id) {
+    const parents = [];
+    for (const edge of Object.values(graph.edges)) {
+        if (edge.to === id && edge.type === "hard") {
+            parents.push(edge.from);
+        }
+    }
+    return parents;
+}
+export function softParents(graph, id) {
+    const parents = [];
+    for (const edge of Object.values(graph.edges)) {
+        if (edge.to === id && edge.type === "soft") {
+            parents.push(edge.from);
+        }
+    }
+    return parents;
+}
+/**
+ * Judge parents of a node: the variants a judge node compares. A judge edge
+ * gates readiness on the variant REACHING review (finishing its work), not on
+ * merge. Fan-out-and-judge uses this so the judge launches once every variant
+ * has produced a diff to compare.
+ */
+export function judgeParents(graph, id) {
+    const parents = [];
+    for (const edge of Object.values(graph.edges)) {
+        if (edge.to === id && edge.type === "judge") {
+            parents.push(edge.from);
+        }
+    }
+    return parents;
+}
+/**
+ * Direct dependents (children) of a node: nodes with an edge `from` this id.
+ */
+export function dependents(graph, id) {
+    const out = [];
+    for (const edge of Object.values(graph.edges)) {
+        if (edge.from === id) {
+            out.push(edge.to);
+        }
+    }
+    return out;
+}
+/**
+ * A node is ready when it is still `planned` AND every hard-dep parent has
+ * merged AND every judge parent has reached review or merged. Soft parents
+ * never block readiness. A judge node (which has judge parents) launches only
+ * once all of its variants have finished their work (review or merged), so it
+ * has every variant's diff to compare.
+ */
+export function isReady(graph, node) {
+    if (node.status !== "planned") {
+        return false;
+    }
+    // A hard dep id that is NOT part of the plan (pruned or never existed) is treated
+    // as satisfied, matching the Rust scheduler's permissive rule: never deadlock on a
+    // dangling reference. Otherwise the parent must be merged.
+    const hardMet = hardParents(graph, node.id).every((parentId) => {
+        const parent = graph.nodes[parentId];
+        return parent === undefined || parent.status === "merged";
+    });
+    if (!hardMet) {
+        return false;
+    }
+    return judgeParents(graph, node.id).every((parentId) => {
+        const parent = graph.nodes[parentId];
+        return parent === undefined || parent.status === "review" || parent.status === "merged";
+    });
+}
+/**
+ * Every node eligible to launch: planned with all hard parents merged.
+ */
+export function readyNodes(graph) {
+    return Object.values(graph.nodes).filter((node) => isReady(graph, node));
+}
+/**
+ * The frontier: non-merged leaves. A node is on the frontier when it is not
+ * merged AND has no non-merged child (every dependent is already merged, or it
+ * has no dependents). Injection reconciliation attaches new nodes here.
+ */
+export function frontier(graph) {
+    return Object.values(graph.nodes).filter((node) => {
+        if (node.status === "merged") {
+            return false;
+        }
+        const children = dependents(graph, node.id);
+        return children.every((childId) => graph.nodes[childId]?.status === "merged");
+    });
+}
+/**
+ * Project a worker-owned RunStatus into the DAG-level NodeStatus. With no run
+ * yet, the node keeps its deps-derived status (planned/ready/blocked); the
+ * scheduler decides those. Mirrors plan section 2's projection table.
+ */
+export function projectNodeStatus(node, run) {
+    // Daemon-owned terminal graph statuses are STICKY against re-projection. The
+    // worker only ever writes "completed" to run.json (it never writes "merged" —
+    // merge state lives in graph.json, owned by the daemon). So once the daemon
+    // has merged a node, or blocked it on a merge conflict / handed it to a
+    // resolver, the run.json stays "completed" forever. Without this guard the
+    // next tick re-projects merged -> review, integration fires again on an
+    // already-merged change, and the node thrashes review<->merged, never settling
+    // as done. `blocked` is likewise daemon-owned (failed-parent propagation or a
+    // held merge conflict) and must not be re-projected back to review.
+    if (node.status === "merged" || node.status === "blocked") {
+        return node.status;
+    }
+    if (!run) {
+        return node.status === "ready" ? "ready" : "planned";
+    }
+    return nodeStatusFromRunStatus(run.status, node.status);
+}
+function nodeStatusFromRunStatus(runStatus, fallback) {
+    switch (runStatus) {
+        case "created":
+        case "running":
+        case "steering":
+        case "verifying":
+        case "migrated":
+            return "running";
+        case "completed":
+            return "review";
+        case "failed":
+        case "cancelled":
+        case "orphaned":
+            return "failed";
+        // Paused is RESUMABLE (quitting the dashboard pauses live workers);
+        // projecting it as "failed" turned every node red on quit as if the fleet
+        // had crashed. "blocked" reads as not-progressing without claiming death.
+        case "paused":
+            return "blocked";
+        case "merged":
+            return "merged";
+        case "merge-conflict":
+            return "failed";
+        default:
+            return fallback;
+    }
+}
+//# sourceMappingURL=graph.js.map

package/dist/graph.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph.js","sourceRoot":"","sources":["../src/graph.ts"],"names":[],"mappings":"AAAA,OAAO,IAAI,MAAM,WAAW,CAAC;AAc7B,OAAO,EAAE,uBAAuB,EAAE,2BAA2B,EAAE,eAAe,EAAE,MAAM,YAAY,CAAC;AACnG,OAAO,EAAE,MAAM,EAAE,UAAU,EAAE,QAAQ,EAAE,SAAS,EAAE,UAAU,EAAE,MAAM,WAAW,CAAC;AAEhF,8EAA8E;AAC9E,6EAA6E;AAC7E,+EAA+E;AAC/E,yEAAyE;AACzE,8EAA8E;AAE9E,MAAM,UAAU,SAAS,CAAC,QAAgB;IACxC,OAAO,IAAI,CAAC,IAAI,CAAC,eAAe,CAAC,QAAQ,CAAC,EAAE,YAAY,CAAC,CAAC;AAC5D,CAAC;AAED,SAAS,UAAU,CAAC,QAAgB;IAClC,OAAO;QACL,OAAO,EAAE,CAAC;QACV,QAAQ;QACR,KAAK,EAAE,EAAE;QACT,KAAK,EAAE,EAAE;QACT,SAAS,EAAE,MAAM,EAAE;KACpB,CAAC;AACJ,CAAC;AAED;;;GAGG;AACH,MAAM,CAAC,KAAK,UAAU,SAAS,CAAC,QAAgB;IAC9C,MAAM,KAAK,GAAG,MAAM,QAAQ,CAAc,SAAS,CAAC,QAAQ,CAAC,CAAC,CAAC;IAC/D,IAAI,KAAK,IAAI,KAAK,CAAC,OAAO,KAAK,CAAC,IAAI,KAAK,CAAC,KAAK,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;QAC/D,OAAO;YACL,OAAO,EAAE,CAAC;YACV,QAAQ,EAAE,KAAK,CAAC,QAAQ,IAAI,QAAQ;YACpC,GAAG,CAAC,KAAK,CAAC,mBAAmB,CAAC,CAAC,CAAC,EAAE,mBAAmB,EAAE,KAAK,CAAC,mBAAmB,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YACxF,KAAK,EAAE,4BAA4B,CAAC,KAAK,CAAC,KAAK,CAAC;YAChD,KAAK,EAAE,KAAK,CAAC,KAAK;YAClB,SAAS,EAAE,KAAK,CAAC,SAAS,IAAI,MAAM,EAAE;SACvC,CAAC;IACJ,CAAC;IACD,OAAO,UAAU,CAAC,QAAQ,CAAC,CAAC;AAC9B,CAAC;AAED;;;;GAIG;AACH,SAAS,4BAA4B,CAAC,KAA+B;IACnE,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC;QACxC,uBAAuB,CAAC,IAAI,CAAC,CAAC;IAChC,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,SAAS,CAAC,KAAa;IACrC,OAAO,SAAS,CAAC,GAAG,KAAK,IAAI,MAAM,EAAE,IAAI,IAAI,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC;AAC5D,CAAC;AAED,MAAM,UAAU,SAAS,CAAC,IAAY,EAAE,EAAU;IAChD,OAAO,SAAS,CAAC,GAAG,IAAI,KAAK,EAAE,IAAI,MAAM,EAAE,IAAI,IAAI,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC;AAClE,CAAC;AAED;;;;GAIG;AACH,MAAM,CAAC,KAAK,UAAU,WAAW,CAC/B,QAAgB,EAChB,EAA8C;IAE9C,wEAAwE;IACxE,2EAA2E;IAC3E,MAAM,2BAA2B,CAAC,QAAQ,CAAC,CAAC;IAC5C,IAAI,MAAM,GAAgB,UAAU,CAAC,QAAQ,CAAC,CAAC;IAC/C,MAAM,IAAI,GAAG,SAAS,CAAC,QAAQ,CAAC,CAAC;IACjC,MAAM,OAAO,GAAG,MAAM,UAAU,CAAC,IAAI,CAAC,CAAC;IACvC,MAAM,UAAU,CAAc,IAAI,EAAE,CAAC,OAAO,EAAE,EAAE;QAC9C,4EAA4E;QAC5E,0EAA0E;QAC1E,6EAA6E;QAC7E,IAAI,OAAO,IAAI,CAAC,CAAC,OAAO,IAAI,OAAO,CAAC,OAAO,KAAK,CAAC,IAAI,OAAO,CAAC,KAAK,IAAI,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;YACrF,MAAM,IAAI,KAAK,CAAC,qDAAqD,IAAI,EAAE,CAAC,CAAC;QAC/E,CAAC;QACD,MAAM,IAAI,GACR,OAAO,IAAI,OAAO,CAAC,OAAO,KAAK,CAAC,IAAI,OAAO,CAAC,KAAK,IAAI,OAAO,CAAC,KAAK;YAChE,CAAC,CAAC,OAAO;YACT,CAAC,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC;QAC3B,MAAM,IAAI,GAAG,EAAE,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC;QAC9B,IAAI,CAAC,OAAO,GAAG,CAAC,CAAC;QACjB,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,QAAQ,IAAI,QAAQ,CAAC;QAC1C,IAAI,CAAC,SAAS,GAAG,MAAM,EAAE,CAAC;QAC1B,MAAM,MAAM,GAAG,SAAS,CAAC,IAAI,CAAC,CAAC;QAC/B,MAAM,GAAG,MAAM,CAAC;QAChB,OAAO,MAA8B,CAAC;IACxC,CAAC,CAAC,CAAC;IACH,OAAO,MAAM,CAAC;AAChB,CAAC;AA8BD;oFACoF;AACpF,MAAM,UAAU,gBAAgB,CAAC,MAA0B;IACzD,QAAQ,MAAM,EAAE,CAAC;QACf,KAAK,OAAO;YACV,OAAO,OAAO,CAAC;QACjB,KAAK,SAAS;YACZ,OAAO,SAAS,CAAC;QACnB,KAAK,QAAQ;YACX,OAAO,QAAQ,CAAC;QAClB,KAAK,QAAQ;YACX,OAAO,QAAQ,CAAC;QAClB,KAAK,QAAQ;YACX,OAAO,QAAQ,CAAC;QAClB,KAAK,SAAS;YACZ,OAAO,SAAS,CAAC;QACnB;YACE,OAAO,SAAS,CAAC;IACrB,CAAC;AACH,CAAC;AAED,SAAS,aAAa,CAAC,OAA2B;IAChD,OAAO,OAAO,KAAK,OAAO,IAAI,OAAO,KAAK,MAAM,IAAI,OAAO,KAAK,UAAU,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,QAAQ,CAAC;AAClG,CAAC;AAED,SAAS,YAAY,CAAC,MAA0B;IAC9C,QAAQ,MAAM,EAAE,CAAC;QACf,KAAK,KAAK,CAAC;QACX,KAAK,QAAQ,CAAC;QACd,KAAK,MAAM,CAAC;QACZ,KAAK,OAAO,CAAC;QACb,KAAK,KAAK;YACR,OAAO,MAAM,CAAC;QAChB;YACE,OAAO,SAAS,CAAC;IACrB,CAAC;AACH,CAAC;AAED;qFACqF;AACrF,SAAS,YAAY,CAAC,IAAY,EAAE,EAAU,EAAE,IAAc;IAC5D,OAAO,KAAK,IAAI,KAAK,IAAI,KAAK,EAAE,EAAE,CAAC;AACrC,CAAC;AAED;;;;;;;;;GASG;AACH,MAAM,UAAU,mBAAmB,CAAC,KAAkB,EAAE,OAAsB;IAC5E,MAAM,OAAO,GAAG,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC;IAClE,MAAM,SAAS,GAAG,MAAM,EAAE,CAAC;IAC3B,MAAM,WAAW,GAAG,IAAI,GAAG,EAAU,CAAC;IACtC,MAAM,WAAW,GAAG,IAAI,GAAG,EAAU,CAAC;IAEtC,KAAK,MAAM,QAAQ,IAAI,OAAO,EAAE,CAAC;QAC/B,IAAI,CAAC,QAAQ,IAAI,OAAO,QAAQ,CAAC,EAAE,KAAK,QAAQ,IAAI,CAAC,QAAQ,CAAC,EAAE,EAAE,CAAC;YACjE,SAAS;QACX,CAAC;QACD,WAAW,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;QAC7B,MAAM,KAAK,GAAG,CAAC,QAAQ,CAAC,KAAK,IAAI,QAAQ,CAAC,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;QAC5D,MAAM,MAAM,GAAG,gBAAgB,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;QAEjD,MAAM,eAAe,GAAa,EAAE,CAAC;QACrC,MAAM,IAAI,GAAG,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC;QAC/D,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;YACvB,IAAI,CAAC,GAAG,IAAI,OAAO,GAAG,CAAC,EAAE,KAAK,QAAQ,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC;gBAClD,SAAS;YACX,CAAC;YACD,MAAM,IAAI,GAAa,GAAG,CAAC,IAAI,KAAK,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC;YAC7D,MAAM,MAAM,GAAG,YAAY,CAAC,GAAG,CAAC,EAAE,EAAE,QAAQ,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;YACvD,WAAW,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YACxB,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,EAAE,EAAE,EAAE,MAAM,EAAE,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,EAAE,EAAE,QAAQ,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC;YAC1E,eAAe,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAC/B,CAAC;QAED,MAAM,QAAQ,GAAG,KAAK,CAAC,KAAK,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;QAC1C,MAAM,MAAM,GAAG,YAAY,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;QAC7C,8EAA8E;QAC9E,6EAA6E;QAC7E,MAAM,MAAM,GACV,OAAO,QAAQ,CAAC,MAAM,KAAK,QAAQ,IAAI,QAAQ,CAAC,MAAM,CAAC,IAAI,EAAE;YAC3D,CAAC,CAAC,QAAQ,CAAC,MAAM;YACjB,CAAC,CAAC,QAAQ,EAAE,MAAM,IAAI,KAAK,CAAC;QAChC,KAAK,CAAC,KAAK,CAAC,QAAQ,CAAC,EAAE,CAAC,GAAG;YACzB,EAAE,EAAE,QAAQ,CAAC,EAAE;YACf,KAAK;YACL,MAAM;YACN,OAAO,EAAE,aAAa,CAAC,QAAQ,CAAC,OAAO,CAAC;YACxC,GAAG,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,QAAQ,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YACpD,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YAC7B,MAAM;YACN,GAAG,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,QAAQ,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YACpD,GAAG,CAAC,QAAQ,CAAC,aAAa,CAAC,CAAC,CAAC,EAAE,SAAS,EAAE,EAAE,IAAI,EAAE,QAAQ,CAAC,aAAa,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YAClF,GAAG,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,UAAU,EAAE,QAAQ,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YACnE,IAAI,EAAE,eAAe;YACrB,MAAM,EAAE,QAAQ,EAAE,MAAM,IAAI,SAAS;YACrC,SAAS,EAAE,QAAQ,EAAE,SAAS,IAAI,SAAS;YAC3C,SAAS,EAAE,SAAS;SACrB,CAAC;IACJ,CAAC;IAED,4EAA4E;IAC5E,yCAAyC;IACzC,KAAK,MAAM,EAAE,IAAI,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC;QAC1C,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;YACzB,OAAO,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;QACzB,CAAC;IACH,CAAC;IACD,KAAK,MAAM,EAAE,IAAI,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC;QAC1C,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;YACzB,OAAO,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;QACzB,CAAC;IACH,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED,SAAS,SAAS,CAAC,KAAkB;IACnC,MAAM,KAAK,GAA6B,EAAE,CAAC;IAC3C,KAAK,MAAM,GAAG,IAAI,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC;QAClD,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;QAC9B,IAAI,IAAI,EAAE,CAAC;YACT,KAAK,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC;QACpB,CAAC;IACH,CAAC;IACD,MAAM,KAAK,GAA8B,EAAE,CAAC;IAC5C,KAAK,MAAM,GAAG,IAAI,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC;QAClD,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;QAC9B,IAAI,IAAI,EAAE,CAAC;YACT,KAAK,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC;QACpB,CAAC;IACH,CAAC;IACD,OAAO;QACL,OAAO,EAAE,CAAC;QACV,QAAQ,EAAE,KAAK,CAAC,QAAQ;QACxB,GAAG,CAAC,KAAK,CAAC,mBAAmB,CAAC,CAAC,CAAC,EAAE,mBAAmB,EAAE,KAAK,CAAC,mBAAmB,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QACxF,KAAK;QACL,KAAK;QACL,SAAS,EAAE,KAAK,CAAC,SAAS;KAC3B,CAAC;AACJ,CAAC;AAED,8EAA8E;AAC9E,mDAAmD;AACnD,8EAA8E;AAE9E,MAAM,UAAU,WAAW,CAAC,KAAkB,EAAE,EAAU;IACxD,MAAM,OAAO,GAAa,EAAE,CAAC;IAC7B,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC;QAC9C,IAAI,IAAI,CAAC,EAAE,KAAK,EAAE,IAAI,IAAI,CAAC,IAAI,KAAK,MAAM,EAAE,CAAC;YAC3C,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC1B,CAAC;IACH,CAAC;IACD,OAAO,OAAO,CAAC;AACjB,CAAC;AAED,MAAM,UAAU,WAAW,CAAC,KAAkB,EAAE,EAAU;IACxD,MAAM,OAAO,GAAa,EAAE,CAAC;IAC7B,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC;QAC9C,IAAI,IAAI,CAAC,EAAE,KAAK,EAAE,IAAI,IAAI,CAAC,IAAI,KAAK,MAAM,EAAE,CAAC;YAC3C,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC1B,CAAC;IACH,CAAC;IACD,OAAO,OAAO,CAAC;AACjB,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,YAAY,CAAC,KAAkB,EAAE,EAAU;IACzD,MAAM,OAAO,GAAa,EAAE,CAAC;IAC7B,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC;QAC9C,IAAI,IAAI,CAAC,EAAE,KAAK,EAAE,IAAI,IAAI,CAAC,IAAI,KAAK,OAAO,EAAE,CAAC;YAC5C,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC1B,CAAC;IACH,CAAC;IACD,OAAO,OAAO,CAAC;AACjB,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,UAAU,CAAC,KAAkB,EAAE,EAAU;IACvD,MAAM,GAAG,GAAa,EAAE,CAAC;IACzB,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC;QAC9C,IAAI,IAAI,CAAC,IAAI,KAAK,EAAE,EAAE,CAAC;YACrB,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACpB,CAAC;IACH,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,OAAO,CAAC,KAAkB,EAAE,IAAc;IACxD,IAAI,IAAI,CAAC,MAAM,KAAK,SAAS,EAAE,CAAC;QAC9B,OAAO,KAAK,CAAC;IACf,CAAC;IACD,kFAAkF;IAClF,mFAAmF;IACnF,2DAA2D;IAC3D,MAAM,OAAO,GAAG,WAAW,CAAC,KAAK,EAAE,IAAI,CAAC,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,QAAQ,EAAE,EAAE;QAC7D,MAAM,MAAM,GAAG,KAAK,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;QACrC,OAAO,MAAM,KAAK,SAAS,IAAI,MAAM,CAAC,MAAM,KAAK,QAAQ,CAAC;IAC5D,CAAC,CAAC,CAAC;IACH,IAAI,CAAC,OAAO,EAAE,CAAC;QACb,OAAO,KAAK,CAAC;IACf,CAAC;IACD,OAAO,YAAY,CAAC,KAAK,EAAE,IAAI,CAAC,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,QAAQ,EAAE,EAAE;QACrD,MAAM,MAAM,GAAG,KAAK,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;QACrC,OAAO,MAAM,KAAK,SAAS,IAAI,MAAM,CAAC,MAAM,KAAK,QAAQ,IAAI,MAAM,CAAC,MAAM,KAAK,QAAQ,CAAC;IAC1F,CAAC,CAAC,CAAC;AACL,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,UAAU,CAAC,KAAkB;IAC3C,OAAO,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,OAAO,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC,CAAC;AAC3E,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,QAAQ,CAAC,KAAkB;IACzC,OAAO,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE;QAChD,IAAI,IAAI,CAAC,MAAM,KAAK,QAAQ,EAAE,CAAC;YAC7B,OAAO,KAAK,CAAC;QACf,CAAC;QACD,MAAM,QAAQ,GAAG,UAAU,CAAC,KAAK,EAAE,IAAI,CAAC,EAAE,CAAC,CAAC;QAC5C,OAAO,QAAQ,CAAC,KAAK,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC,OAAO,CAAC,EAAE,MAAM,KAAK,QAAQ,CAAC,CAAC;IAChF,CAAC,CAAC,CAAC;AACL,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,iBAAiB,CAAC,IAAc,EAAE,GAAe;IAC/D,6EAA6E;IAC7E,8EAA8E;IAC9E,4EAA4E;IAC5E,wEAAwE;IACxE,2EAA2E;IAC3E,wEAAwE;IACxE,+EAA+E;IAC/E,8EAA8E;IAC9E,oEAAoE;IACpE,IAAI,IAAI,CAAC,MAAM,KAAK,QAAQ,IAAI,IAAI,CAAC,MAAM,KAAK,SAAS,EAAE,CAAC;QAC1D,OAAO,IAAI,CAAC,MAAM,CAAC;IACrB,CAAC;IACD,IAAI,CAAC,GAAG,EAAE,CAAC;QACT,OAAO,IAAI,CAAC,MAAM,KAAK,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,SAAS,CAAC;IACvD,CAAC;IACD,OAAO,uBAAuB,CAAC,GAAG,CAAC,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;AAC1D,CAAC;AAED,SAAS,uBAAuB,CAAC,SAAoB,EAAE,QAAoB;IACzE,QAAQ,SAAS,EAAE,CAAC;QAClB,KAAK,SAAS,CAAC;QACf,KAAK,SAAS,CAAC;QACf,KAAK,UAAU,CAAC;QAChB,KAAK,WAAW,CAAC;QACjB,KAAK,UAAU;YACb,OAAO,SAAS,CAAC;QACnB,KAAK,WAAW;YACd,OAAO,QAAQ,CAAC;QAClB,KAAK,QAAQ,CAAC;QACd,KAAK,WAAW,CAAC;QACjB,KAAK,UAAU;YACb,OAAO,QAAQ,CAAC;QAClB,oEAAoE;QACpE,0EAA0E;QAC1E,0EAA0E;QAC1E,KAAK,QAAQ;YACX,OAAO,SAAS,CAAC;QACnB,KAAK,QAAQ;YACX,OAAO,QAAQ,CAAC;QAClB,KAAK,gBAAgB;YACnB,OAAO,QAAQ,CAAC;QAClB;YACE,OAAO,QAAQ,CAAC;IACpB,CAAC;AACH,CAAC"}

package/dist/handoff.d.ts

@@ -0,0 +1,110 @@
+export type HandoffBackend = "claude" | "codex" | "opencode";
+export interface HandoffRequest {
+    requestId: string;
+    sessionId: string;
+    backend: HandoffBackend;
+    /** "worker" = isolated jj workspace (mergeable); "here" = the main checkout. */
+    target: "worker" | "here";
+    instruction?: string;
+    title?: string;
+    sourceCwd: string;
+    createdAt: number;
+}
+export interface HandoffArgs {
+    sessionId?: string;
+    backend?: HandoffBackend;
+    instruction: string;
+    here: boolean;
+    list: boolean;
+}
+export interface ConversationCandidate {
+    sessionId: string;
+    title: string;
+    modifiedMs: number;
+    path: string;
+}
+export declare function parseHandoffArgs(args: string[]): HandoffArgs;
+/**
+ * A session id is spliced onto a `claude`/`codex` command line by the dashboard.
+ * Accept only id-shaped strings — the same rule the Rust side enforces on read.
+ */
+export declare function isValidSessionId(value: string): boolean;
+/**
+ * Drop the wrapper blocks Claude Code injects around real user text
+ * (`<system-reminder>…`, slash-command echoes, the local-command caveat) and
+ * collapse what is left onto one line. Mirrors strip_wrapper_blocks in
+ * native/src/handoff.rs.
+ */
+export declare function stripWrapperBlocks(text: string): string;
+/** The conversation's opening user prompt: what a human would call the chat. */
+export declare function firstUserPrompt(raw: string): string | undefined;
+/**
+ * What the listing needs from a transcript, read from its head.
+ *
+ * `interactive` is whether a human talked to a REPL: Claude records its session
+ * mode at start, and the one-shot `claude -p` calls Rudder makes internally (task
+ * titles, completion notes) do not — which is how they stay out of the listing.
+ */
+export declare function scanTranscriptHead(raw: string): {
+    title: string;
+    interactive: boolean;
+} | undefined;
+export declare function claudeProjectsDir(): string;
+/**
+ * Recent Claude conversations recorded for `cwd` and its subdirectories, newest
+ * first. Claude names each project folder after the directory the session ran in,
+ * so a chat started in `src/` lives in a sibling folder — still this repo's.
+ * Rudder's own agent sessions (under `.rudder-workspaces`) are not candidates.
+ */
+export declare function recentClaudeConversations(cwd: string, limit?: number, projects?: string, exclude?: ReadonlySet<string>): ConversationCandidate[];
+export declare function claudeTranscriptPath(cwd: string, sessionId: string, projects?: string): string | undefined;
+/**
+ * The conversation this command is running inside. Claude Code exports its session
+ * id to every process it spawns, which is the whole trick: an agent asked to "hand
+ * this off to rudder" can run the command with no arguments and mean THIS chat.
+ * Falls back to the newest transcript recorded for the directory.
+ */
+export declare function resolveClaudeSessionId(cwd: string, env?: NodeJS.ProcessEnv): string | undefined;
+/**
+ * Newest opencode session for `cwd`. opencode keeps sessions in a database and
+ * ships the query, so Rudder asks it rather than reading a schema it does not own.
+ * Running this from inside an opencode chat resolves to THAT chat: it is the one
+ * that was updated most recently.
+ */
+export declare function resolveOpencodeSessionId(cwd: string): string | undefined;
+export declare function recentOpencodeConversations(cwd: string, limit?: number): ConversationCandidate[];
+export declare function parseOpencodeSessions(raw: string, cwd: string, limit?: number): ConversationCandidate[];
+/** Newest Codex session recorded for `cwd`. Codex sessions live in one global tree. */
+export declare function resolveCodexSessionId(cwd: string, root?: string): string | undefined;
+export declare function codexSessionsDir(): string;
+/**
+ * Recent Codex conversations for `cwd`, newest first. Codex keeps ONE global
+ * rollout tree, so this filters by the recorded cwd BEFORE taking the newest few —
+ * the newest rollouts overall are usually other repositories'. Mirrors
+ * `recent_codex_conversations_in` in native/src/handoff.rs.
+ */
+export declare function recentCodexConversations(cwd: string, limit?: number, root?: string): ConversationCandidate[];
+/**
+ * A Codex rollout's identity: the `session_meta` line carries the id and cwd, and
+ * the title is the first turn whose role is `user` — `developer` turns are the
+ * harness's own context blocks.
+ */
+export declare function parseCodexSessionHead(raw: string): {
+    sessionId: string;
+    cwd: string;
+    title: string;
+} | undefined;
+/** `# AGENTS.md instructions for /path` — the harness talking, not a person. */
+export declare function isInjectedInstructions(text: string): boolean;
+/**
+ * Prompts RUDDER writes itself. A `codex exec` rollout looks exactly like a real
+ * chat in its metadata (`originator: codex-tui`, `source: cli`), so these are
+ * matched by their opening text — which Rudder controls. Mirrors
+ * `is_rudder_generated_prompt` in native/src/handoff.rs.
+ */
+export declare function isRudderGeneratedPrompt(text: string): boolean;
+/** `.rudder/` lives at the dashboard root, never inside an agent's workspace. */
+export declare function dashboardRoot(cwd?: string): string;
+export declare function handoffQueueDir(repoRoot: string): string;
+export declare function writeHandoffRequest(repoRoot: string, request: HandoffRequest): string;
+export declare function runHandoff(args: string[], backendFlag?: string): Promise<void>;