devsmind-mcp 2.4.0 → 4.0.0

package/dist/db/index-build.js

@@ -0,0 +1,177 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.extractFilesIntoGraph = extractFilesIntoGraph;
+exports.pendingDescriptionNodes = pendingDescriptionNodes;
+exports.resolveEdgesIncrementally = resolveEdgesIncrementally;
+const indexer_1 = require("./indexer");
+const ast_1 = require("../utils/ast");
+const edges_1 = require("./edges");
+/**
+ * How much of a node's code ships in an indexing batch response. Deliberately tighter than
+ * `describe.ts`'s 2000-char one-shot-LLM budget: the chat model driving in-chat indexing already
+ * has the surrounding conversation as context, so it needs less code per node to write a good
+ * description, and every char here is repeated once per node across a whole repo.
+ */
+const CODE_CHARS_PER_NODE = 1200;
+/** Default per-call extraction budgets — whichever trips first ends the batch. Files are always
+ *  processed to completion once started, so `last_file_indexed` never points mid-file. */
+const DEFAULT_FILE_BUDGET = 40;
+const DEFAULT_NODE_BUDGET = 25;
+const DEFAULT_CHAR_BUDGET = 30000;
+/** Default wall-clock budget for one `resolveEdgesIncrementally` call. */
+const DEFAULT_EDGE_TIME_BUDGET_MS = 25000;
+/**
+ * Extracts structure from `files` deterministically via local AST — no LLM, so nothing is
+ * silently missed or hallucinated the way whole-file-to-an-LLM extraction could be. Writes each
+ * candidate straight to the graph (`upsertNode` + `updateHistory`, deliberately with no
+ * `code_before` — this is an index snapshot, not an edit, so it gets no diff/revert, exactly
+ * like `devsmind index --run`'s own Phase 1 write in `runner.ts:781-802`). Stops once ANY of the
+ * three budgets trips, but always finishes the file it's mid-way through first — the AI's cursor
+ * (`files_done`/`last_file_indexed`) must only ever advance past a FULLY extracted file, or a
+ * later `index_continue` silently skips whatever was left unprocessed in it.
+ *
+ * Node ids use the same `${repoRelPath}#${qualified}` formula as `runner.ts:778-779` and
+ * `staging.ts`'s `resolveEntryId` — required so a node created here is the same node an
+ * `edit_node` on the same symbol later resolves to, not a duplicate.
+ */
+function extractFilesIntoGraph(db, files, opts = {}) {
+    const fileBudget = opts.fileBudget ?? DEFAULT_FILE_BUDGET;
+    const nodeBudget = opts.nodeBudget ?? DEFAULT_NODE_BUDGET;
+    const charBudget = opts.charBudget ?? DEFAULT_CHAR_BUDGET;
+    const codeCharsPerNode = opts.codeCharsPerNode ?? CODE_CHARS_PER_NODE;
+    const filesExtracted = [];
+    const nodes = [];
+    const fileImports = {};
+    let nodesCreated = 0;
+    let charsUsed = 0;
+    let cursor = null;
+    for (const filePath of files) {
+        if (filesExtracted.length > 0 &&
+            (filesExtracted.length >= fileBudget || nodes.length >= nodeBudget || charsUsed >= charBudget)) {
+            break;
+        }
+        // Never throws: returns [] for a non-parseable extension, an unreadable file, or a parse
+        // failure — all three are legitimate "nothing to extract here" outcomes, not batch-aborting
+        // errors. A file that yields nothing still counts as fully processed below.
+        const candidates = (0, ast_1.enumerateFileCandidates)(filePath);
+        const repoRelPath = db.toRepoRelativePath(filePath);
+        for (const c of candidates) {
+            const nodeId = `${repoRelPath}#${c.qualified}`;
+            db.upsertNode({ id: nodeId, name: c.name, type: c.type, file_path: filePath, signature: c.signature });
+            db.updateHistory({
+                node_id: nodeId,
+                code_snapshot: c.codeSnapshot,
+                reasoning: {
+                    what_changed: 'Initial code extraction during in-chat indexing',
+                    why: 'Initial index setup',
+                    goal: 'Establish baseline codebase knowledge graph',
+                    model: 'ast'
+                }
+            });
+            nodesCreated++;
+            const truncated = c.codeSnapshot.length > codeCharsPerNode;
+            const code = truncated ? c.codeSnapshot.slice(0, codeCharsPerNode) : c.codeSnapshot;
+            charsUsed += code.length;
+            nodes.push({
+                node_id: nodeId,
+                name: c.name,
+                type: c.type,
+                signature: c.signature,
+                file_path: filePath,
+                start_line: c.startLine,
+                end_line: c.endLine,
+                exported: c.isExported,
+                code,
+                code_truncated: truncated
+            });
+        }
+        if (candidates.length > 0) {
+            const imports = (0, ast_1.listFileImports)(filePath).map(i => i.moduleSpecifier);
+            if (imports.length > 0)
+                fileImports[repoRelPath] = [...new Set(imports)];
+        }
+        filesExtracted.push(filePath);
+        cursor = filePath;
+    }
+    return { filesExtracted, nodesCreated, nodes, fileImports, cursor };
+}
+/**
+ * Nodes with no description yet, oldest-created first — the same `WHERE description IS NULL`
+ * predicate `describe.ts:67`'s backlog-clearing loop uses. Re-served by `index_continue` ahead of
+ * a fresh batch so a still-undescribed node from an earlier batch is never silently dropped just
+ * because the AI moved on to the next one; it grows the visible backlog instead of losing it.
+ */
+function pendingDescriptionNodes(db, limit) {
+    const pending = db.getAllNodes().filter(n => !n.deprecated && !n.description).slice(0, limit);
+    const nodes = [];
+    for (const n of pending) {
+        const latest = db.getLatestCode(n.id);
+        const full = latest?.code_snapshot ?? '';
+        const truncated = full.length > CODE_CHARS_PER_NODE;
+        nodes.push({
+            node_id: n.id,
+            name: n.name,
+            type: n.type,
+            signature: n.signature ?? null,
+            file_path: n.file_path,
+            code: truncated ? full.slice(0, CODE_CHARS_PER_NODE) : full,
+            code_truncated: truncated
+        });
+    }
+    return nodes;
+}
+/**
+ * Resumable, time-budgeted full-graph connection pass — the same `phase`/`nodes_done`/
+ * `nodes_total` state machine `runner.ts:834-839` and `runner.ts:604-661` already use for the
+ * CLI's Phase 2. A node extracted in an early batch can be the TARGET of a node extracted much
+ * later, so edges are never resolved per-batch during extraction — only here, once, over the
+ * WHOLE graph, exactly as `runner.ts:1223-1231` documents for the same reason.
+ *
+ * Persists `nodes_done` to the scratchpad after every node (not just on return), so a crash mid
+ * -pass loses at most one node's edges, not the whole call. Missing-node fill only runs once the
+ * WHOLE pass completes within a single call — a `resolve` that keeps expiring its time budget
+ * across many `index_complete` calls will still get every edge, just not missing-node fill until
+ * the pass that finally finishes; this is the same characteristic `devsmind index --run` itself
+ * has across a restarted process, not a new limitation introduced here.
+ */
+function resolveEdgesIncrementally(db, devmindPath, pad, opts = {}) {
+    const deadline = Date.now() + (opts.timeBudgetMs ?? DEFAULT_EDGE_TIME_BUDGET_MS);
+    // Alias detection BEFORE the candidate pool is fetched, so this pass's own freshly-attached
+    // aliases (RTK Query generated hook names, etc.) are visible to the resolver below in the SAME
+    // pass rather than needing a second run — mirrors edges.ts's `resolveEdgesForNodes` ordering.
+    (0, edges_1.applyDeterministicAliases)(db, db.listNodes().map(n => n.id));
+    const allNodes = db.listNodes();
+    const allIds = new Set(allNodes.map(n => n.id));
+    if (pad.phase !== 2) {
+        pad.phase = 2;
+        pad.nodes_done = 0;
+        pad.nodes_total = allNodes.length;
+        pad.connections_created = 0;
+    }
+    else {
+        pad.nodes_total = allNodes.length;
+    }
+    const { missing, onMissing } = (0, edges_1.createMissingCollector)();
+    let i = pad.nodes_done;
+    for (; i < allNodes.length; i++) {
+        if (Date.now() > deadline)
+            break;
+        const node = allNodes[i];
+        const latest = db.getLatestCode(node.id);
+        if (latest?.code_snapshot && latest.code_snapshot.trim().length > 0) {
+            for (const targetId of (0, ast_1.resolveConnectionsLocally)(node.id, node.file_path, allNodes, devmindPath, onMissing)) {
+                if (allIds.has(targetId)) {
+                    db.addConnection(node.id, targetId);
+                    pad.connections_created++;
+                }
+            }
+        }
+        pad.nodes_done = i + 1;
+        pad.updated_at = new Date().toISOString();
+        (0, indexer_1.writeScratchpad)(devmindPath, pad);
+    }
+    const done = i >= allNodes.length;
+    const missingFilled = done ? (0, edges_1.finalizeMissingNodes)(devmindPath, db, missing, { writeReport: false, quiet: true }) : 0;
+    return { done, nodesDone: pad.nodes_done, nodesTotal: pad.nodes_total, edgesAdded: pad.connections_created, missingFilled };
+}
+//# sourceMappingURL=index-build.js.map

package/dist/db/index-build.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index-build.js","sourceRoot":"","sources":["../../src/db/index-build.ts"],"names":[],"mappings":";;AAsDA,sDAyEC;AAQD,0DAkBC;AAgBD,8DAkDC;AA1ND,uCAA6D;AAC7D,sCAAmG;AACnG,mCAAkG;AAElG;;;;;GAKG;AACH,MAAM,mBAAmB,GAAG,IAAI,CAAC;AAEjC;0FAC0F;AAC1F,MAAM,mBAAmB,GAAG,EAAE,CAAC;AAC/B,MAAM,mBAAmB,GAAG,EAAE,CAAC;AAC/B,MAAM,mBAAmB,GAAG,KAAK,CAAC;AAElC,0EAA0E;AAC1E,MAAM,2BAA2B,GAAG,KAAK,CAAC;AAoB1C;;;;;;;;;;;;;GAaG;AACH,SAAgB,qBAAqB,CACnC,EAAmB,EACnB,KAAe,EACf,OAAqG,EAAE;IAEvG,MAAM,UAAU,GAAG,IAAI,CAAC,UAAU,IAAI,mBAAmB,CAAC;IAC1D,MAAM,UAAU,GAAG,IAAI,CAAC,UAAU,IAAI,mBAAmB,CAAC;IAC1D,MAAM,UAAU,GAAG,IAAI,CAAC,UAAU,IAAI,mBAAmB,CAAC;IAC1D,MAAM,gBAAgB,GAAG,IAAI,CAAC,gBAAgB,IAAI,mBAAmB,CAAC;IAEtE,MAAM,cAAc,GAAa,EAAE,CAAC;IACpC,MAAM,KAAK,GAAqB,EAAE,CAAC;IACnC,MAAM,WAAW,GAA6B,EAAE,CAAC;IACjD,IAAI,YAAY,GAAG,CAAC,CAAC;IACrB,IAAI,SAAS,GAAG,CAAC,CAAC;IAClB,IAAI,MAAM,GAAkB,IAAI,CAAC;IAEjC,KAAK,MAAM,QAAQ,IAAI,KAAK,EAAE,CAAC;QAC7B,IACE,cAAc,CAAC,MAAM,GAAG,CAAC;YACzB,CAAC,cAAc,CAAC,MAAM,IAAI,UAAU,IAAI,KAAK,CAAC,MAAM,IAAI,UAAU,IAAI,SAAS,IAAI,UAAU,CAAC,EAC9F,CAAC;YACD,MAAM;QACR,CAAC;QAED,yFAAyF;QACzF,4FAA4F;QAC5F,4EAA4E;QAC5E,MAAM,UAAU,GAAG,IAAA,6BAAuB,EAAC,QAAQ,CAAC,CAAC;QACrD,MAAM,WAAW,GAAG,EAAE,CAAC,kBAAkB,CAAC,QAAQ,CAAC,CAAC;QAEpD,KAAK,MAAM,CAAC,IAAI,UAAU,EAAE,CAAC;YAC3B,MAAM,MAAM,GAAG,GAAG,WAAW,IAAI,CAAC,CAAC,SAAS,EAAE,CAAC;YAC/C,EAAE,CAAC,UAAU,CAAC,EAAE,EAAE,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,SAAS,EAAE,QAAQ,EAAE,SAAS,EAAE,CAAC,CAAC,SAAS,EAAE,CAAC,CAAC;YACvG,EAAE,CAAC,aAAa,CAAC;gBACf,OAAO,EAAE,MAAM;gBACf,aAAa,EAAE,CAAC,CAAC,YAAY;gBAC7B,SAAS,EAAE;oBACT,YAAY,EAAE,iDAAiD;oBAC/D,GAAG,EAAE,qBAAqB;oBAC1B,IAAI,EAAE,6CAA6C;oBACnD,KAAK,EAAE,KAAK;iBACb;aACF,CAAC,CAAC;YACH,YAAY,EAAE,CAAC;YAEf,MAAM,SAAS,GAAG,CAAC,CAAC,YAAY,CAAC,MAAM,GAAG,gBAAgB,CAAC;YAC3D,MAAM,IAAI,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,EAAE,gBAAgB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC;YACpF,SAAS,IAAI,IAAI,CAAC,MAAM,CAAC;YACzB,KAAK,CAAC,IAAI,CAAC;gBACT,OAAO,EAAE,MAAM;gBACf,IAAI,EAAE,CAAC,CAAC,IAAI;gBACZ,IAAI,EAAE,CAAC,CAAC,IAAI;gBACZ,SAAS,EAAE,CAAC,CAAC,SAAS;gBACtB,SAAS,EAAE,QAAQ;gBACnB,UAAU,EAAE,CAAC,CAAC,SAAS;gBACvB,QAAQ,EAAE,CAAC,CAAC,OAAO;gBACnB,QAAQ,EAAE,CAAC,CAAC,UAAU;gBACtB,IAAI;gBACJ,cAAc,EAAE,SAAS;aAC1B,CAAC,CAAC;QACL,CAAC;QAED,IAAI,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC1B,MAAM,OAAO,GAAG,IAAA,qBAAe,EAAC,QAAQ,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC;YACtE,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC;gBAAE,WAAW,CAAC,WAAW,CAAC,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC;QAC3E,CAAC;QAED,cAAc,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QAC9B,MAAM,GAAG,QAAQ,CAAC;IACpB,CAAC;IAED,OAAO,EAAE,cAAc,EAAE,YAAY,EAAE,KAAK,EAAE,WAAW,EAAE,MAAM,EAAE,CAAC;AACtE,CAAC;AAED;;;;;GAKG;AACH,SAAgB,uBAAuB,CAAC,EAAmB,EAAE,KAAa;IACxE,MAAM,OAAO,GAAG,EAAE,CAAC,WAAW,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,UAAU,IAAI,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;IAC9F,MAAM,KAAK,GAAqB,EAAE,CAAC;IACnC,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;QACxB,MAAM,MAAM,GAAG,EAAE,CAAC,aAAa,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QACtC,MAAM,IAAI,GAAG,MAAM,EAAE,aAAa,IAAI,EAAE,CAAC;QACzC,MAAM,SAAS,GAAG,IAAI,CAAC,MAAM,GAAG,mBAAmB,CAAC;QACpD,KAAK,CAAC,IAAI,CAAC;YACT,OAAO,EAAE,CAAC,CAAC,EAAE;YACb,IAAI,EAAE,CAAC,CAAC,IAAI;YACZ,IAAI,EAAE,CAAC,CAAC,IAAI;YACZ,SAAS,EAAE,CAAC,CAAC,SAAS,IAAI,IAAI;YAC9B,SAAS,EAAE,CAAC,CAAC,SAAS;YACtB,IAAI,EAAE,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,mBAAmB,CAAC,CAAC,CAAC,CAAC,IAAI;YAC3D,cAAc,EAAE,SAAS;SAC1B,CAAC,CAAC;IACL,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;;;;;;;;;;;GAaG;AACH,SAAgB,yBAAyB,CACvC,EAAmB,EACnB,WAAmB,EACnB,GAAoB,EACpB,OAAkC,EAAE;IAEpC,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,IAAI,CAAC,YAAY,IAAI,2BAA2B,CAAC,CAAC;IAEjF,4FAA4F;IAC5F,+FAA+F;IAC/F,8FAA8F;IAC9F,IAAA,iCAAyB,EAAC,EAAE,EAAE,EAAE,CAAC,SAAS,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC7D,MAAM,QAAQ,GAAG,EAAE,CAAC,SAAS,EAAE,CAAC;IAChC,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAEhD,IAAI,GAAG,CAAC,KAAK,KAAK,CAAC,EAAE,CAAC;QACpB,GAAG,CAAC,KAAK,GAAG,CAAC,CAAC;QACd,GAAG,CAAC,UAAU,GAAG,CAAC,CAAC;QACnB,GAAG,CAAC,WAAW,GAAG,QAAQ,CAAC,MAAM,CAAC;QAClC,GAAG,CAAC,mBAAmB,GAAG,CAAC,CAAC;IAC9B,CAAC;SAAM,CAAC;QACN,GAAG,CAAC,WAAW,GAAG,QAAQ,CAAC,MAAM,CAAC;IACpC,CAAC;IAED,MAAM,EAAE,OAAO,EAAE,SAAS,EAAE,GAAG,IAAA,8BAAsB,GAAE,CAAC;IACxD,IAAI,CAAC,GAAG,GAAG,CAAC,UAAU,CAAC;IAEvB,OAAO,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAChC,IAAI,IAAI,CAAC,GAAG,EAAE,GAAG,QAAQ;YAAE,MAAM;QAEjC,MAAM,IAAI,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;QACzB,MAAM,MAAM,GAAG,EAAE,CAAC,aAAa,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACzC,IAAI,MAAM,EAAE,aAAa,IAAI,MAAM,CAAC,aAAa,CAAC,IAAI,EAAE,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACpE,KAAK,MAAM,QAAQ,IAAI,IAAA,+BAAyB,EAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,SAAS,EAAE,QAAQ,EAAE,WAAW,EAAE,SAAS,CAAC,EAAE,CAAC;gBAC5G,IAAI,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;oBACzB,EAAE,CAAC,aAAa,CAAC,IAAI,CAAC,EAAE,EAAE,QAAQ,CAAC,CAAC;oBACpC,GAAG,CAAC,mBAAmB,EAAE,CAAC;gBAC5B,CAAC;YACH,CAAC;QACH,CAAC;QAED,GAAG,CAAC,UAAU,GAAG,CAAC,GAAG,CAAC,CAAC;QACvB,GAAG,CAAC,UAAU,GAAG,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;QAC1C,IAAA,yBAAe,EAAC,WAAW,EAAE,GAAG,CAAC,CAAC;IACpC,CAAC;IAED,MAAM,IAAI,GAAG,CAAC,IAAI,QAAQ,CAAC,MAAM,CAAC;IAClC,MAAM,aAAa,GAAG,IAAI,CAAC,CAAC,CAAC,IAAA,4BAAoB,EAAC,WAAW,EAAE,EAAE,EAAE,OAAO,EAAE,EAAE,WAAW,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAErH,OAAO,EAAE,IAAI,EAAE,SAAS,EAAE,GAAG,CAAC,UAAU,EAAE,UAAU,EAAE,GAAG,CAAC,WAAW,EAAE,UAAU,EAAE,GAAG,CAAC,mBAAmB,EAAE,aAAa,EAAE,CAAC;AAC9H,CAAC"}

package/dist/db/message-revert.d.ts

@@ -0,0 +1,63 @@
+export interface RevertOutcome {
+    ok: boolean;
+    /** Messages actually flipped to 'reverted' this call, oldest-affected-first. */
+    reverted: string[];
+    /** Set when the cascade stopped before finishing everything requested. */
+    blocked_at?: {
+        message_id: string;
+        reason: string;
+    };
+}
+export interface UnrevertOutcome {
+    ok: boolean;
+    error?: string;
+    message_id?: string;
+}
+/** Outcome of reverting/un-reverting one file's edits within one message. */
+export interface FileRevertOutcome {
+    ok: boolean;
+    error?: string;
+    /** Ids of the edits actually flipped this call. */
+    edit_ids?: string[];
+}
+/** Outcome of reverting/un-reverting exactly one edit. */
+export interface EditRevertOutcome {
+    ok: boolean;
+    error?: string;
+}
+/**
+ * Reverts `messageId` and every message after it that isn't already fully reverted — the stack
+ * model: later messages were built on top of earlier ones, so undoing one partway through the
+ * stack undoes everything above it too, newest first. Stops at the first message that can't be
+ * fully reverted (a drifted edit) and reports which; everything reverted before that point in
+ * this call stays reverted. A `partial` message (touched by an earlier file/edit-level revert)
+ * counts as "not yet fully reverted" and is swept up here too, finishing the job on it.
+ */
+export declare function revertMessage(devmindPath: string, messageId: string): RevertOutcome;
+/**
+ * Re-applies exactly one message: the OLDEST currently-**fully**-reverted one. Un-revert restores
+ * up the stack in the order things came off it — out-of-order restoration would recreate the same
+ * "later edit built on code that isn't there yet" hazard the revert direction guards against, so
+ * it's refused rather than attempted. A `partial` message wasn't produced by that cascade — it was
+ * touched by a surgical file/edit-level revert — so it can be un-reverted independently of the
+ * fully-reverted stack's ordering.
+ */
+export declare function unrevertMessage(devmindPath: string, messageId: string): UnrevertOutcome;
+/**
+ * Reverts just the edits ONE file picked up within ONE message, leaving the message's other
+ * files untouched. Newest-edit-first within that file, atomic (rolls back this operation's own
+ * partial progress on failure, same as the whole-message path) — never leaves this one file
+ * half-reverted, though the message as a whole is expected to end up `partial`.
+ */
+export declare function revertMessageFile(devmindPath: string, messageId: string, filePath: string): FileRevertOutcome;
+/** Symmetric to revertMessageFile: oldest-edit-first, same atomic rollback. */
+export declare function unrevertMessageFile(devmindPath: string, messageId: string, filePath: string): FileRevertOutcome;
+/**
+ * Reverts exactly ONE edit, identified by its stable `id`, regardless of what else in the message
+ * or file is applied. Safe by construction: if a later edit (to the same node, in this message or
+ * a later one) already changed this text further, this edit's `after` string won't be found on
+ * disk anymore and the exact-match guard in applyEdit refuses rather than guessing.
+ */
+export declare function revertMessageEdit(devmindPath: string, messageId: string, editId: string): EditRevertOutcome;
+/** Symmetric to revertMessageEdit. */
+export declare function unrevertMessageEdit(devmindPath: string, messageId: string, editId: string): EditRevertOutcome;

package/dist/db/message-revert.js

@@ -0,0 +1,258 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.revertMessage = revertMessage;
+exports.unrevertMessage = unrevertMessage;
+exports.revertMessageFile = revertMessageFile;
+exports.unrevertMessageFile = unrevertMessageFile;
+exports.revertMessageEdit = revertMessageEdit;
+exports.unrevertMessageEdit = unrevertMessageEdit;
+const activity_1 = require("./activity");
+const edit_1 = require("../utils/edit");
+const ast_1 = require("../utils/ast");
+/** All messages, oldest-created first — the timeline order the stack model operates over. */
+function timeline(devmindPath) {
+    return (0, activity_1.listMessages)(devmindPath).slice().sort((a, b) => a.created_at.localeCompare(b.created_at));
+}
+/**
+ * Applies one edit's `from` -> `to` text via the same exact-match, atomic-write primitive
+ * `edit_node` uses. A failure here means the file has drifted since this edit was recorded — a
+ * hand-edit, a pull, a later message's edit to the same text, anything — and is reported rather
+ * than forced. This exact-match requirement is also what makes file-level and single-edit revert
+ * safe without any separate "is this the newest" bookkeeping: an edit whose recorded text isn't
+ * uniquely present anymore simply can't be applied, whatever the reason.
+ */
+function applyEdit(edit, from, to) {
+    if (from === to)
+        return { ok: true }; // a no-op edit (e.g. before === after) has nothing to write
+    const r = (0, edit_1.replaceTextInFile)(edit.file_path, from, to, false);
+    if (!r.ok)
+        return { ok: false, error: r.error };
+    (0, ast_1.invalidateParsedFile)(edit.file_path);
+    return { ok: true };
+}
+/**
+ * Reverts one message's edits as a single atomic unit: newest edit first (later edits to the same
+ * node were built on earlier ones, so they must come off in reverse), and if any edit can't be
+ * applied, everything from this same message that DID succeed in this attempt is rolled back
+ * immediately — a message is never left half-reverted by THIS call. (It can still end up
+ * `partial` from an earlier, separate file/edit-level revert — this function skips edits already
+ * in the target state rather than re-applying them, so it composes safely with that.)
+ */
+function revertOneMessageAtomically(message) {
+    const newestFirst = message.edits.slice().reverse();
+    const applied = [];
+    for (const edit of newestFirst) {
+        if (edit.reverted)
+            continue; // already reverted via a granular action — nothing to do
+        const r = applyEdit(edit, edit.after, edit.before);
+        if (!r.ok) {
+            // Undo in LIFO order — the most recently reverted edit must come off first. `applied` was
+            // built newest-edit-first, so `applied[0]` was reverted first and must be un-reverted LAST;
+            // reversing the array puts the most recent action first, exactly as a proper undo requires.
+            for (const undo of applied.slice().reverse()) {
+                applyEdit(undo, undo.before, undo.after); // best-effort; started from a known-good state
+                undo.reverted = false;
+            }
+            return { ok: false, error: `${edit.node_id}: ${r.error}` };
+        }
+        edit.reverted = true;
+        applied.push(edit);
+    }
+    return { ok: true };
+}
+/** Symmetric to revertOneMessageAtomically: oldest edit first, same rollback-on-failure guarantee. */
+function unrevertOneMessageAtomically(message) {
+    const oldestFirst = message.edits;
+    const applied = [];
+    for (const edit of oldestFirst) {
+        if (!edit.reverted)
+            continue; // already applied — nothing to restore
+        const r = applyEdit(edit, edit.before, edit.after);
+        if (!r.ok) {
+            for (const undo of applied.slice().reverse()) {
+                applyEdit(undo, undo.after, undo.before);
+                undo.reverted = true;
+            }
+            return { ok: false, error: `${edit.node_id}: ${r.error}` };
+        }
+        edit.reverted = false;
+        applied.push(edit);
+    }
+    return { ok: true };
+}
+/**
+ * Reverts `messageId` and every message after it that isn't already fully reverted — the stack
+ * model: later messages were built on top of earlier ones, so undoing one partway through the
+ * stack undoes everything above it too, newest first. Stops at the first message that can't be
+ * fully reverted (a drifted edit) and reports which; everything reverted before that point in
+ * this call stays reverted. A `partial` message (touched by an earlier file/edit-level revert)
+ * counts as "not yet fully reverted" and is swept up here too, finishing the job on it.
+ */
+function revertMessage(devmindPath, messageId) {
+    const target = (0, activity_1.readMessage)(devmindPath, messageId);
+    if (!target)
+        return { ok: false, reverted: [], blocked_at: { message_id: messageId, reason: 'message not found' } };
+    if (target.status === 'reverted') {
+        return { ok: false, reverted: [], blocked_at: { message_id: messageId, reason: 'already reverted' } };
+    }
+    const all = timeline(devmindPath);
+    const targetIndex = all.findIndex(m => m.id === messageId);
+    // Newest-first: everything from the end of the timeline down to (and including) the target.
+    const candidates = all.slice(targetIndex).filter(m => m.status !== 'reverted').reverse();
+    const reverted = [];
+    for (const message of candidates) {
+        const result = revertOneMessageAtomically(message);
+        if (!result.ok) {
+            message.status = (0, activity_1.deriveStatus)(message.edits);
+            (0, activity_1.saveMessage)(devmindPath, message);
+            return { ok: reverted.length > 0, reverted, blocked_at: { message_id: message.id, reason: result.error } };
+        }
+        message.status = (0, activity_1.deriveStatus)(message.edits);
+        message.updated_at = new Date().toISOString();
+        (0, activity_1.saveMessage)(devmindPath, message);
+        reverted.push(message.id);
+    }
+    return { ok: true, reverted };
+}
+/**
+ * Re-applies exactly one message: the OLDEST currently-**fully**-reverted one. Un-revert restores
+ * up the stack in the order things came off it — out-of-order restoration would recreate the same
+ * "later edit built on code that isn't there yet" hazard the revert direction guards against, so
+ * it's refused rather than attempted. A `partial` message wasn't produced by that cascade — it was
+ * touched by a surgical file/edit-level revert — so it can be un-reverted independently of the
+ * fully-reverted stack's ordering.
+ */
+function unrevertMessage(devmindPath, messageId) {
+    const target = (0, activity_1.readMessage)(devmindPath, messageId);
+    if (!target)
+        return { ok: false, error: 'message not found' };
+    if (target.status === 'applied')
+        return { ok: false, error: 'message is not reverted — nothing to restore' };
+    if (target.status === 'reverted') {
+        const reverted = timeline(devmindPath).filter(m => m.status === 'reverted');
+        const oldest = reverted[0];
+        /* istanbul ignore next -- unreachable: `target.status === 'reverted'` (just checked above) means
+           `target` itself is in `timeline(devmindPath)` with status 'reverted', so `reverted` can never
+           be empty here. Kept as a real guard (not just a comment) in case that invariant ever breaks. */
+        if (!oldest)
+            return { ok: false, error: 'no reverted messages found' };
+        if (oldest.id !== messageId) {
+            return {
+                ok: false,
+                error: `un-revert must restore the oldest reverted message first: "${oldest.summary}" (${oldest.id}). Restore that one before this one.`
+            };
+        }
+    }
+    const result = unrevertOneMessageAtomically(target);
+    if (!result.ok) {
+        target.status = (0, activity_1.deriveStatus)(target.edits);
+        (0, activity_1.saveMessage)(devmindPath, target);
+        return { ok: false, error: result.error };
+    }
+    target.status = (0, activity_1.deriveStatus)(target.edits);
+    target.updated_at = new Date().toISOString();
+    (0, activity_1.saveMessage)(devmindPath, target);
+    return { ok: true, message_id: target.id };
+}
+/**
+ * Reverts just the edits ONE file picked up within ONE message, leaving the message's other
+ * files untouched. Newest-edit-first within that file, atomic (rolls back this operation's own
+ * partial progress on failure, same as the whole-message path) — never leaves this one file
+ * half-reverted, though the message as a whole is expected to end up `partial`.
+ */
+function revertMessageFile(devmindPath, messageId, filePath) {
+    const message = (0, activity_1.readMessage)(devmindPath, messageId);
+    if (!message)
+        return { ok: false, error: 'message not found' };
+    const fileEdits = message.edits.filter(e => e.file_path === filePath && !e.reverted);
+    if (!fileEdits.length)
+        return { ok: false, error: 'no applied edits for this file in this message' };
+    const newestFirst = fileEdits.slice().reverse();
+    const applied = [];
+    for (const edit of newestFirst) {
+        const r = applyEdit(edit, edit.after, edit.before);
+        if (!r.ok) {
+            for (const undo of applied.slice().reverse()) {
+                applyEdit(undo, undo.before, undo.after);
+                undo.reverted = false;
+            }
+            return { ok: false, error: `${edit.node_id}: ${r.error}` };
+        }
+        edit.reverted = true;
+        applied.push(edit);
+    }
+    message.status = (0, activity_1.deriveStatus)(message.edits);
+    message.updated_at = new Date().toISOString();
+    (0, activity_1.saveMessage)(devmindPath, message);
+    return { ok: true, edit_ids: applied.map(e => e.id) };
+}
+/** Symmetric to revertMessageFile: oldest-edit-first, same atomic rollback. */
+function unrevertMessageFile(devmindPath, messageId, filePath) {
+    const message = (0, activity_1.readMessage)(devmindPath, messageId);
+    if (!message)
+        return { ok: false, error: 'message not found' };
+    const fileEdits = message.edits.filter(e => e.file_path === filePath && e.reverted);
+    if (!fileEdits.length)
+        return { ok: false, error: 'no reverted edits for this file in this message' };
+    const applied = [];
+    for (const edit of fileEdits) {
+        const r = applyEdit(edit, edit.before, edit.after);
+        if (!r.ok) {
+            for (const undo of applied.slice().reverse()) {
+                applyEdit(undo, undo.after, undo.before);
+                undo.reverted = true;
+            }
+            return { ok: false, error: `${edit.node_id}: ${r.error}` };
+        }
+        edit.reverted = false;
+        applied.push(edit);
+    }
+    message.status = (0, activity_1.deriveStatus)(message.edits);
+    message.updated_at = new Date().toISOString();
+    (0, activity_1.saveMessage)(devmindPath, message);
+    return { ok: true, edit_ids: applied.map(e => e.id) };
+}
+/**
+ * Reverts exactly ONE edit, identified by its stable `id`, regardless of what else in the message
+ * or file is applied. Safe by construction: if a later edit (to the same node, in this message or
+ * a later one) already changed this text further, this edit's `after` string won't be found on
+ * disk anymore and the exact-match guard in applyEdit refuses rather than guessing.
+ */
+function revertMessageEdit(devmindPath, messageId, editId) {
+    const message = (0, activity_1.readMessage)(devmindPath, messageId);
+    if (!message)
+        return { ok: false, error: 'message not found' };
+    const edit = message.edits.find(e => e.id === editId);
+    if (!edit)
+        return { ok: false, error: 'edit not found in this message' };
+    if (edit.reverted)
+        return { ok: false, error: 'already reverted' };
+    const r = applyEdit(edit, edit.after, edit.before);
+    if (!r.ok)
+        return { ok: false, error: r.error };
+    edit.reverted = true;
+    message.status = (0, activity_1.deriveStatus)(message.edits);
+    message.updated_at = new Date().toISOString();
+    (0, activity_1.saveMessage)(devmindPath, message);
+    return { ok: true };
+}
+/** Symmetric to revertMessageEdit. */
+function unrevertMessageEdit(devmindPath, messageId, editId) {
+    const message = (0, activity_1.readMessage)(devmindPath, messageId);
+    if (!message)
+        return { ok: false, error: 'message not found' };
+    const edit = message.edits.find(e => e.id === editId);
+    if (!edit)
+        return { ok: false, error: 'edit not found in this message' };
+    if (!edit.reverted)
+        return { ok: false, error: 'not reverted' };
+    const r = applyEdit(edit, edit.before, edit.after);
+    if (!r.ok)
+        return { ok: false, error: r.error };
+    edit.reverted = false;
+    message.status = (0, activity_1.deriveStatus)(message.edits);
+    message.updated_at = new Date().toISOString();
+    (0, activity_1.saveMessage)(devmindPath, message);
+    return { ok: true };
+}
+//# sourceMappingURL=message-revert.js.map

package/dist/db/message-revert.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"message-revert.js","sourceRoot":"","sources":["../../src/db/message-revert.ts"],"names":[],"mappings":";;AAiHA,sCA2BC;AAUD,0CA+BC;AAQD,8CAsBC;AAGD,kDAqBC;AAQD,8CAeC;AAGD,kDAeC;AApRD,yCAAgH;AAChH,wCAAkD;AAClD,sCAAoD;AA8BpD,6FAA6F;AAC7F,SAAS,QAAQ,CAAC,WAAmB;IACnC,OAAO,IAAA,uBAAY,EAAC,WAAW,CAAC,CAAC,KAAK,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,aAAa,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC;AACpG,CAAC;AAED;;;;;;;GAOG;AACH,SAAS,SAAS,CAAC,IAAiB,EAAE,IAAY,EAAE,EAAU;IAC5D,IAAI,IAAI,KAAK,EAAE;QAAE,OAAO,EAAE,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC,4DAA4D;IAClG,MAAM,CAAC,GAAG,IAAA,wBAAiB,EAAC,IAAI,CAAC,SAAS,EAAE,IAAI,EAAE,EAAE,EAAE,KAAK,CAAC,CAAC;IAC7D,IAAI,CAAC,CAAC,CAAC,EAAE;QAAE,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,CAAC,KAAK,EAAE,CAAC;IAChD,IAAA,0BAAoB,EAAC,IAAI,CAAC,SAAS,CAAC,CAAC;IACrC,OAAO,EAAE,EAAE,EAAE,IAAI,EAAE,CAAC;AACtB,CAAC;AAED;;;;;;;GAOG;AACH,SAAS,0BAA0B,CAAC,OAAwB;IAC1D,MAAM,WAAW,GAAG,OAAO,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC,OAAO,EAAE,CAAC;IACpD,MAAM,OAAO,GAAkB,EAAE,CAAC;IAElC,KAAK,MAAM,IAAI,IAAI,WAAW,EAAE,CAAC;QAC/B,IAAI,IAAI,CAAC,QAAQ;YAAE,SAAS,CAAC,yDAAyD;QACtF,MAAM,CAAC,GAAG,SAAS,CAAC,IAAI,EAAE,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;QACnD,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC;YACV,0FAA0F;YAC1F,4FAA4F;YAC5F,4FAA4F;YAC5F,KAAK,MAAM,IAAI,IAAI,OAAO,CAAC,KAAK,EAAE,CAAC,OAAO,EAAE,EAAE,CAAC;gBAC7C,SAAS,CAAC,IAAI,EAAE,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,+CAA+C;gBACzF,IAAI,CAAC,QAAQ,GAAG,KAAK,CAAC;YACxB,CAAC;YACD,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,GAAG,IAAI,CAAC,OAAO,KAAK,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC;QAC7D,CAAC;QACD,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC;QACrB,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACrB,CAAC;IACD,OAAO,EAAE,EAAE,EAAE,IAAI,EAAE,CAAC;AACtB,CAAC;AAED,sGAAsG;AACtG,SAAS,4BAA4B,CAAC,OAAwB;IAC5D,MAAM,WAAW,GAAG,OAAO,CAAC,KAAK,CAAC;IAClC,MAAM,OAAO,GAAkB,EAAE,CAAC;IAElC,KAAK,MAAM,IAAI,IAAI,WAAW,EAAE,CAAC;QAC/B,IAAI,CAAC,IAAI,CAAC,QAAQ;YAAE,SAAS,CAAC,uCAAuC;QACrE,MAAM,CAAC,GAAG,SAAS,CAAC,IAAI,EAAE,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;QACnD,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC;YACV,KAAK,MAAM,IAAI,IAAI,OAAO,CAAC,KAAK,EAAE,CAAC,OAAO,EAAE,EAAE,CAAC;gBAC7C,SAAS,CAAC,IAAI,EAAE,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;gBACzC,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC;YACvB,CAAC;YACD,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,GAAG,IAAI,CAAC,OAAO,KAAK,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC;QAC7D,CAAC;QACD,IAAI,CAAC,QAAQ,GAAG,KAAK,CAAC;QACtB,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACrB,CAAC;IACD,OAAO,EAAE,EAAE,EAAE,IAAI,EAAE,CAAC;AACtB,CAAC;AAED;;;;;;;GAOG;AACH,SAAgB,aAAa,CAAC,WAAmB,EAAE,SAAiB;IAClE,MAAM,MAAM,GAAG,IAAA,sBAAW,EAAC,WAAW,EAAE,SAAS,CAAC,CAAC;IACnD,IAAI,CAAC,MAAM;QAAE,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,QAAQ,EAAE,EAAE,EAAE,UAAU,EAAE,EAAE,UAAU,EAAE,SAAS,EAAE,MAAM,EAAE,mBAAmB,EAAE,EAAE,CAAC;IACpH,IAAI,MAAM,CAAC,MAAM,KAAK,UAAU,EAAE,CAAC;QACjC,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,QAAQ,EAAE,EAAE,EAAE,UAAU,EAAE,EAAE,UAAU,EAAE,SAAS,EAAE,MAAM,EAAE,kBAAkB,EAAE,EAAE,CAAC;IACxG,CAAC;IAED,MAAM,GAAG,GAAG,QAAQ,CAAC,WAAW,CAAC,CAAC;IAClC,MAAM,WAAW,GAAG,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,SAAS,CAAC,CAAC;IAC3D,4FAA4F;IAC5F,MAAM,UAAU,GAAG,GAAG,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,UAAU,CAAC,CAAC,OAAO,EAAE,CAAC;IAEzF,MAAM,QAAQ,GAAa,EAAE,CAAC;IAC9B,KAAK,MAAM,OAAO,IAAI,UAAU,EAAE,CAAC;QACjC,MAAM,MAAM,GAAG,0BAA0B,CAAC,OAAO,CAAC,CAAC;QACnD,IAAI,CAAC,MAAM,CAAC,EAAE,EAAE,CAAC;YACf,OAAO,CAAC,MAAM,GAAG,IAAA,uBAAY,EAAC,OAAO,CAAC,KAAK,CAAC,CAAC;YAC7C,IAAA,sBAAW,EAAC,WAAW,EAAE,OAAO,CAAC,CAAC;YAClC,OAAO,EAAE,EAAE,EAAE,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,QAAQ,EAAE,UAAU,EAAE,EAAE,UAAU,EAAE,OAAO,CAAC,EAAE,EAAE,MAAM,EAAE,MAAM,CAAC,KAAM,EAAE,EAAE,CAAC;QAC9G,CAAC;QACD,OAAO,CAAC,MAAM,GAAG,IAAA,uBAAY,EAAC,OAAO,CAAC,KAAK,CAAC,CAAC;QAC7C,OAAO,CAAC,UAAU,GAAG,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;QAC9C,IAAA,sBAAW,EAAC,WAAW,EAAE,OAAO,CAAC,CAAC;QAClC,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;IAC5B,CAAC;IAED,OAAO,EAAE,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE,CAAC;AAChC,CAAC;AAED;;;;;;;GAOG;AACH,SAAgB,eAAe,CAAC,WAAmB,EAAE,SAAiB;IACpE,MAAM,MAAM,GAAG,IAAA,sBAAW,EAAC,WAAW,EAAE,SAAS,CAAC,CAAC;IACnD,IAAI,CAAC,MAAM;QAAE,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,mBAAmB,EAAE,CAAC;IAC9D,IAAI,MAAM,CAAC,MAAM,KAAK,SAAS;QAAE,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,8CAA8C,EAAE,CAAC;IAE7G,IAAI,MAAM,CAAC,MAAM,KAAK,UAAU,EAAE,CAAC;QACjC,MAAM,QAAQ,GAAG,QAAQ,CAAC,WAAW,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,UAAU,CAAC,CAAC;QAC5E,MAAM,MAAM,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;QAC3B;;0GAEkG;QAClG,IAAI,CAAC,MAAM;YAAE,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,4BAA4B,EAAE,CAAC;QACvE,IAAI,MAAM,CAAC,EAAE,KAAK,SAAS,EAAE,CAAC;YAC5B,OAAO;gBACL,EAAE,EAAE,KAAK;gBACT,KAAK,EAAE,8DAA8D,MAAM,CAAC,OAAO,MAAM,MAAM,CAAC,EAAE,sCAAsC;aACzI,CAAC;QACJ,CAAC;IACH,CAAC;IAED,MAAM,MAAM,GAAG,4BAA4B,CAAC,MAAM,CAAC,CAAC;IACpD,IAAI,CAAC,MAAM,CAAC,EAAE,EAAE,CAAC;QACf,MAAM,CAAC,MAAM,GAAG,IAAA,uBAAY,EAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QAC3C,IAAA,sBAAW,EAAC,WAAW,EAAE,MAAM,CAAC,CAAC;QACjC,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,CAAC,KAAK,EAAE,CAAC;IAC5C,CAAC;IAED,MAAM,CAAC,MAAM,GAAG,IAAA,uBAAY,EAAC,MAAM,CAAC,KAAK,CAAC,CAAC;IAC3C,MAAM,CAAC,UAAU,GAAG,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;IAC7C,IAAA,sBAAW,EAAC,WAAW,EAAE,MAAM,CAAC,CAAC;IACjC,OAAO,EAAE,EAAE,EAAE,IAAI,EAAE,UAAU,EAAE,MAAM,CAAC,EAAE,EAAE,CAAC;AAC7C,CAAC;AAED;;;;;GAKG;AACH,SAAgB,iBAAiB,CAAC,WAAmB,EAAE,SAAiB,EAAE,QAAgB;IACxF,MAAM,OAAO,GAAG,IAAA,sBAAW,EAAC,WAAW,EAAE,SAAS,CAAC,CAAC;IACpD,IAAI,CAAC,OAAO;QAAE,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,mBAAmB,EAAE,CAAC;IAC/D,MAAM,SAAS,GAAG,OAAO,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,SAAS,KAAK,QAAQ,IAAI,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC;IACrF,IAAI,CAAC,SAAS,CAAC,MAAM;QAAE,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,gDAAgD,EAAE,CAAC;IAErG,MAAM,WAAW,GAAG,SAAS,CAAC,KAAK,EAAE,CAAC,OAAO,EAAE,CAAC;IAChD,MAAM,OAAO,GAAkB,EAAE,CAAC;IAClC,KAAK,MAAM,IAAI,IAAI,WAAW,EAAE,CAAC;QAC/B,MAAM,CAAC,GAAG,SAAS,CAAC,IAAI,EAAE,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;QACnD,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC;YACV,KAAK,MAAM,IAAI,IAAI,OAAO,CAAC,KAAK,EAAE,CAAC,OAAO,EAAE,EAAE,CAAC;gBAAC,SAAS,CAAC,IAAI,EAAE,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;gBAAC,IAAI,CAAC,QAAQ,GAAG,KAAK,CAAC;YAAC,CAAC;YAClH,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,GAAG,IAAI,CAAC,OAAO,KAAK,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC;QAC7D,CAAC;QACD,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC;QACrB,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACrB,CAAC;IAED,OAAO,CAAC,MAAM,GAAG,IAAA,uBAAY,EAAC,OAAO,CAAC,KAAK,CAAC,CAAC;IAC7C,OAAO,CAAC,UAAU,GAAG,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;IAC9C,IAAA,sBAAW,EAAC,WAAW,EAAE,OAAO,CAAC,CAAC;IAClC,OAAO,EAAE,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC;AACxD,CAAC;AAED,+EAA+E;AAC/E,SAAgB,mBAAmB,CAAC,WAAmB,EAAE,SAAiB,EAAE,QAAgB;IAC1F,MAAM,OAAO,GAAG,IAAA,sBAAW,EAAC,WAAW,EAAE,SAAS,CAAC,CAAC;IACpD,IAAI,CAAC,OAAO;QAAE,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,mBAAmB,EAAE,CAAC;IAC/D,MAAM,SAAS,GAAG,OAAO,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,SAAS,KAAK,QAAQ,IAAI,CAAC,CAAC,QAAQ,CAAC,CAAC;IACpF,IAAI,CAAC,SAAS,CAAC,MAAM;QAAE,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,iDAAiD,EAAE,CAAC;IAEtG,MAAM,OAAO,GAAkB,EAAE,CAAC;IAClC,KAAK,MAAM,IAAI,IAAI,SAAS,EAAE,CAAC;QAC7B,MAAM,CAAC,GAAG,SAAS,CAAC,IAAI,EAAE,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;QACnD,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC;YACV,KAAK,MAAM,IAAI,IAAI,OAAO,CAAC,KAAK,EAAE,CAAC,OAAO,EAAE,EAAE,CAAC;gBAAC,SAAS,CAAC,IAAI,EAAE,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;gBAAC,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC;YAAC,CAAC;YACjH,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,GAAG,IAAI,CAAC,OAAO,KAAK,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC;QAC7D,CAAC;QACD,IAAI,CAAC,QAAQ,GAAG,KAAK,CAAC;QACtB,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACrB,CAAC;IAED,OAAO,CAAC,MAAM,GAAG,IAAA,uBAAY,EAAC,OAAO,CAAC,KAAK,CAAC,CAAC;IAC7C,OAAO,CAAC,UAAU,GAAG,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;IAC9C,IAAA,sBAAW,EAAC,WAAW,EAAE,OAAO,CAAC,CAAC;IAClC,OAAO,EAAE,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC;AACxD,CAAC;AAED;;;;;GAKG;AACH,SAAgB,iBAAiB,CAAC,WAAmB,EAAE,SAAiB,EAAE,MAAc;IACtF,MAAM,OAAO,GAAG,IAAA,sBAAW,EAAC,WAAW,EAAE,SAAS,CAAC,CAAC;IACpD,IAAI,CAAC,OAAO;QAAE,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,mBAAmB,EAAE,CAAC;IAC/D,MAAM,IAAI,GAAG,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,MAAM,CAAC,CAAC;IACtD,IAAI,CAAC,IAAI;QAAE,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,gCAAgC,EAAE,CAAC;IACzE,IAAI,IAAI,CAAC,QAAQ;QAAE,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,kBAAkB,EAAE,CAAC;IAEnE,MAAM,CAAC,GAAG,SAAS,CAAC,IAAI,EAAE,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;IACnD,IAAI,CAAC,CAAC,CAAC,EAAE;QAAE,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,CAAC,KAAK,EAAE,CAAC;IAEhD,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC;IACrB,OAAO,CAAC,MAAM,GAAG,IAAA,uBAAY,EAAC,OAAO,CAAC,KAAK,CAAC,CAAC;IAC7C,OAAO,CAAC,UAAU,GAAG,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;IAC9C,IAAA,sBAAW,EAAC,WAAW,EAAE,OAAO,CAAC,CAAC;IAClC,OAAO,EAAE,EAAE,EAAE,IAAI,EAAE,CAAC;AACtB,CAAC;AAED,sCAAsC;AACtC,SAAgB,mBAAmB,CAAC,WAAmB,EAAE,SAAiB,EAAE,MAAc;IACxF,MAAM,OAAO,GAAG,IAAA,sBAAW,EAAC,WAAW,EAAE,SAAS,CAAC,CAAC;IACpD,IAAI,CAAC,OAAO;QAAE,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,mBAAmB,EAAE,CAAC;IAC/D,MAAM,IAAI,GAAG,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,MAAM,CAAC,CAAC;IACtD,IAAI,CAAC,IAAI;QAAE,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,gCAAgC,EAAE,CAAC;IACzE,IAAI,CAAC,IAAI,CAAC,QAAQ;QAAE,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,cAAc,EAAE,CAAC;IAEhE,MAAM,CAAC,GAAG,SAAS,CAAC,IAAI,EAAE,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;IACnD,IAAI,CAAC,CAAC,CAAC,EAAE;QAAE,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,CAAC,KAAK,EAAE,CAAC;IAEhD,IAAI,CAAC,QAAQ,GAAG,KAAK,CAAC;IACtB,OAAO,CAAC,MAAM,GAAG,IAAA,uBAAY,EAAC,OAAO,CAAC,KAAK,CAAC,CAAC;IAC7C,OAAO,CAAC,UAAU,GAAG,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;IAC9C,IAAA,sBAAW,EAAC,WAAW,EAAE,OAAO,CAAC,CAAC;IAClC,OAAO,EAAE,EAAE,EAAE,IAAI,EAAE,CAAC;AACtB,CAAC"}

package/dist/db/revert.d.ts

@@ -0,0 +1,31 @@
+import { DevMindDatabase } from './database';
+export interface RevertResult {
+    ok: boolean;
+    error?: string;
+    node_id?: string;
+    file_path?: string;
+    /** True when the change was still staged, so there was no recorded history to unwind. */
+    was_staged?: boolean;
+    entry_deleted?: boolean;
+    /** Set when the code was restored but the history entry could not be fully removed. */
+    note?: string;
+}
+/**
+ * Undoes the most recent recorded edit to one entity: restores the file, then erases what was
+ * written about it.
+ *
+ * Only the newest edit is reversible. An older one cannot be undone in isolation — every edit
+ * after it was made against the code it produced, so putting its "before" back would overwrite
+ * work that has nothing to do with it. Git is the tool for that, and it already does it properly.
+ *
+ * `expectedHistoryId`, when given, is the specific entry the caller intended to revert (e.g. the
+ * one a "Revert this change" button was clicked on). It must match the node's actual latest entry
+ * — if it doesn't (a newer entry was recorded since, perhaps from another session), the revert is
+ * refused rather than silently reverting that newer entry instead, which would undo the wrong
+ * change from the caller's point of view.
+ *
+ * The file is restored by swapping the recorded `after` back to the recorded `before`, which
+ * routes through the same exact-match write `edit_node` uses: if that text is no longer uniquely
+ * present, the write is refused rather than guessed at.
+ */
+export declare function revertLastEdit(db: DevMindDatabase, devmindPath: string, nodeId: string, expectedHistoryId?: string): RevertResult;