@wrongstack/core 0.284.1 → 0.285.0

package/dist/storage/input-history-store.d.ts

@@ -0,0 +1,56 @@
+import type { SecretScrubber } from '../types/secret-scrubber.js';
+export declare const INPUT_HISTORY_DEFAULT_MAX = 100;
+/**
+ * Per-project TUI prompt input history.
+ *
+ * Backed by a single JSON file at `~/.wrongstack/projects/<slug>/input-
+ * history.json`. Entries are newest-first, capped at `maxEntries`. Before
+ * any entry is written to disk it is passed through a `SecretScrubber` and
+ * dropped if it still contains a redacted marker — leaking a pasted API
+ * key into a history file would be a real incident, so the scrubber is
+ * mandatory, not optional.
+ *
+ * The store is intentionally small and synchronous-ish (load once at TUI
+ * boot, save debounced on change). It mirrors PromptUsageStore's shape so
+ * the two read as a family.
+ */
+export declare class InputHistoryStore {
+    private readonly file;
+    private readonly scrubber;
+    private readonly maxEntries;
+    /**
+     * @param file Absolute path to the per-project input-history.json.
+     * @param scrubber SecretScrubber used to filter secrets before write.
+     * @param maxEntries Cap on the number of entries persisted. Default 100.
+     */
+    constructor(file: string, scrubber: SecretScrubber, maxEntries?: number);
+    /**
+     * Load the persisted entries. Missing or corrupt file → empty list
+     * (never throws — history is best-effort).
+     */
+    load(): Promise<string[]>;
+    /**
+     * Persist `entries` to disk after scrubbing each one. Entries that still
+     * contain a redaction marker AFTER scrubbing are dropped — a half-scrubbed
+     * prompt like "export API_KEY=***REDACTED***" is useless as history and
+     * keeping it risks confusing the agent. Dedup is the caller's job (the
+     * reducer already dedups); this method only scrubs, caps, and writes.
+     */
+    save(entries: string[]): Promise<void>;
+    /** Truncate the file to an empty entry list (used by /clear). */
+    clear(): Promise<void>;
+    /**
+     * Run each entry through the scrubber and drop any that still contain a
+     * redaction marker. Internal so the test suite can pin the policy.
+     */
+    private scrubAndFilter;
+    /**
+     * Heuristic: did the scrubber actually redact anything? DefaultSecretScrubber
+     * replaces matches with "***REDACTED***", so a residual marker means a secret
+     * was detected. Subclasses of SecretScrubber that use a different sentinel
+     * can be accommodated by widening this check in the future; for now the
+     * marker check covers the shipped scrubber.
+     */
+    private looksRedacted;
+}
+//# sourceMappingURL=input-history-store.d.ts.map

package/dist/storage/input-history-store.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"input-history-store.d.ts","sourceRoot":"","sources":["../../src/storage/input-history-store.ts"],"names":[],"mappings":"AAGA,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,6BAA6B,CAAC;AAYlE,eAAO,MAAM,yBAAyB,MAAM,CAAC;AAE7C;;;;;;;;;;;;;GAaG;AACH,qBAAa,iBAAiB;IAO1B,OAAO,CAAC,QAAQ,CAAC,IAAI;IACrB,OAAO,CAAC,QAAQ,CAAC,QAAQ;IACzB,OAAO,CAAC,QAAQ,CAAC,UAAU;IAR7B;;;;OAIG;IACH,YACmB,IAAI,EAAE,MAAM,EACZ,QAAQ,EAAE,cAAc,EACxB,UAAU,GAAE,MAAkC,EAC7D;IAEJ;;;OAGG;IACG,IAAI,IAAI,OAAO,CAAC,MAAM,EAAE,CAAC,CAe9B;IAED;;;;;;OAMG;IACG,IAAI,CAAC,OAAO,EAAE,MAAM,EAAE,GAAG,OAAO,CAAC,IAAI,CAAC,CAS3C;IAED,iEAAiE;IAC3D,KAAK,IAAI,OAAO,CAAC,IAAI,CAAC,CAI3B;IAED;;;OAGG;IACH,OAAO,CAAC,cAAc;IAUtB;;;;;;OAMG;IACH,OAAO,CAAC,aAAa;CAGtB"}

package/dist/storage/memory-backend.d.ts

@@ -0,0 +1,66 @@
+import type { MemoryEntry, MemoryScope } from '../types/memory.js';
+import type { WstackPaths } from '../utils/wstack-paths.js';
+export interface MemoryBackend {
+    readonly kind: string;
+    remember(scope: MemoryScope, entry: MemoryEntry, filePath: string): Promise<void>;
+    forget(scope: MemoryScope, query: string, filePath: string): Promise<number>;
+    readAll(scope: MemoryScope, filePath: string): Promise<string>;
+    list(scope: MemoryScope, filePath: string, limit?: number | undefined): Promise<MemoryEntry[]>;
+    search(scope: MemoryScope, query: string, filePath: string, limit?: number | undefined): Promise<MemoryEntry[]>;
+    /** Find memories related to the given text via graph traversal. Optional — falls back to search. */
+    findRelated?(scope: MemoryScope, filePath: string, text: string, limit: number): Promise<MemoryEntry[]>;
+    clear(scope: MemoryScope, filePath: string): Promise<void>;
+    consolidate(scope: MemoryScope, filePath: string): Promise<number>;
+}
+interface IndexedEntry {
+    entry: MemoryEntry;
+    /** Lower-cased words extracted from text. */
+    words: string[];
+    /** Lower-cased tags. */
+    tags: string[];
+}
+interface InvertedIndex {
+    /** word -> entry indices */
+    wordMap: Map<string, number[]>;
+    /** tag -> entry indices */
+    tagMap: Map<string, number[]>;
+    entries: IndexedEntry[];
+    /** Last known file mtime for cache invalidation. */
+    mtimeMs: number;
+}
+export declare function buildInvertedIndex(entries: MemoryEntry[]): InvertedIndex;
+export declare function searchIndex(index: InvertedIndex, query: string, limit?: number): MemoryEntry[];
+export interface FileMemoryBackendOptions {
+    paths: WstackPaths;
+}
+export declare class FileMemoryBackend implements MemoryBackend {
+    readonly kind = "file";
+    private readonly files;
+    /** Cache of parsed entries per file path. */
+    private readonly entryCache;
+    /** Inverted index per file path. */
+    private readonly indexCache;
+    /** File mtime cache for invalidation. */
+    private readonly mtimeCache;
+    constructor(opts: FileMemoryBackendOptions);
+    private resolveFile;
+    private getMtime;
+    private invalidateCache;
+    /**
+     * Load (and cache) the parsed entries for a file. Callers that have already
+     * stat'd the file this tick (e.g. `getIndex`) can pass the known `mtime` to
+     * avoid a redundant `fs.stat` — otherwise it's fetched here.
+     */
+    private loadEntries;
+    private getIndex;
+    remember(scope: MemoryScope, entry: MemoryEntry, filePath: string): Promise<void>;
+    forget(scope: MemoryScope, query: string, filePath: string): Promise<number>;
+    readAll(scope: MemoryScope, filePath: string): Promise<string>;
+    list(scope: MemoryScope, filePath: string, limit?: number): Promise<MemoryEntry[]>;
+    search(scope: MemoryScope, query: string, filePath: string, limit?: number): Promise<MemoryEntry[]>;
+    clear(scope: MemoryScope, filePath: string): Promise<void>;
+    consolidate(scope: MemoryScope, filePath: string): Promise<number>;
+}
+export declare function parseEntries(raw: string, scope?: MemoryScope): MemoryEntry[];
+export {};
+//# sourceMappingURL=memory-backend.d.ts.map

package/dist/storage/memory-backend.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"memory-backend.d.ts","sourceRoot":"","sources":["../../src/storage/memory-backend.ts"],"names":[],"mappings":"AAGA,OAAO,KAAK,EAAE,WAAW,EAAE,WAAW,EAAE,MAAM,oBAAoB,CAAC;AAGnE,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,0BAA0B,CAAC;AAI5D,MAAM,WAAW,aAAa;IAC5B,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,QAAQ,CAAC,KAAK,EAAE,WAAW,EAAE,KAAK,EAAE,WAAW,EAAE,QAAQ,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC;IAClF,MAAM,CAAC,KAAK,EAAE,WAAW,EAAE,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC;IAC7E,OAAO,CAAC,KAAK,EAAE,WAAW,EAAE,QAAQ,EAAE,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC;IAC/D,IAAI,CAAC,KAAK,EAAE,WAAW,EAAE,QAAQ,EAAE,MAAM,EAAE,KAAK,CAAC,EAAE,MAAM,GAAG,SAAS,GAAG,OAAO,CAAC,WAAW,EAAE,CAAC,CAAC;IAC/F,MAAM,CAAC,KAAK,EAAE,WAAW,EAAE,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,EAAE,KAAK,CAAC,EAAE,MAAM,GAAG,SAAS,GAAG,OAAO,CAAC,WAAW,EAAE,CAAC,CAAC;IAChH,oGAAoG;IACpG,WAAW,CAAC,CAAC,KAAK,EAAE,WAAW,EAAE,QAAQ,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,OAAO,CAAC,WAAW,EAAE,CAAC,CAAC;IACxG,KAAK,CAAC,KAAK,EAAE,WAAW,EAAE,QAAQ,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC;IAC3D,WAAW,CAAC,KAAK,EAAE,WAAW,EAAE,QAAQ,EAAE,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC;CACpE;AAsGD,UAAU,YAAY;IACpB,KAAK,EAAE,WAAW,CAAC;IACnB,6CAA6C;IAC7C,KAAK,EAAE,MAAM,EAAE,CAAC;IAChB,wBAAwB;IACxB,IAAI,EAAE,MAAM,EAAE,CAAC;CAChB;AAED,UAAU,aAAa;IACrB,4BAA4B;IAC5B,OAAO,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,CAAC;IAC/B,2BAA2B;IAC3B,MAAM,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,CAAC;IAC9B,OAAO,EAAE,YAAY,EAAE,CAAC;IACxB,oDAAoD;IACpD,OAAO,EAAE,MAAM,CAAC;CACjB;AAKD,wBAAgB,kBAAkB,CAAC,OAAO,EAAE,WAAW,EAAE,GAAG,aAAa,CAwBxE;AAYD,wBAAgB,WAAW,CACzB,KAAK,EAAE,aAAa,EACpB,KAAK,EAAE,MAAM,EACb,KAAK,CAAC,EAAE,MAAM,GACb,WAAW,EAAE,CAuDf;AAID,MAAM,WAAW,wBAAwB;IACvC,KAAK,EAAE,WAAW,CAAC;CACpB;AAED,qBAAa,iBAAkB,YAAW,aAAa;IACrD,QAAQ,CAAC,IAAI,UAAU;IACvB,OAAO,CAAC,QAAQ,CAAC,KAAK,CAA8B;IACpD,6CAA6C;IAC7C,OAAO,CAAC,QAAQ,CAAC,UAAU,CAAoC;IAC/D,oCAAoC;IACpC,OAAO,CAAC,QAAQ,CAAC,UAAU,CAAoC;IAC/D,yCAAyC;IACzC,OAAO,CAAC,QAAQ,CAAC,UAAU,CAA6B;IAExD,YAAY,IAAI,EAAE,wBAAwB,EAMzC;IAED,OAAO,CAAC,WAAW;YAIL,QAAQ;IAStB,OAAO,CAAC,eAAe;IAMvB;;;;OAIG;YACW,WAAW;YAwBX,QAAQ;IAehB,QAAQ,CAAC,KAAK,EAAE,WAAW,EAAE,KAAK,EAAE,WAAW,EAAE,QAAQ,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC,CActF;IAEK,MAAM,CAAC,KAAK,EAAE,WAAW,EAAE,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC,CA6BjF;IAEK,OAAO,CAAC,KAAK,EAAE,WAAW,EAAE,QAAQ,EAAE,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC,CAGnE;IAEK,IAAI,CAAC,KAAK,EAAE,WAAW,EAAE,QAAQ,EAAE,MAAM,EAAE,KAAK,CAAC,EAAE,MAAM,GAAG,OAAO,CAAC,WAAW,EAAE,CAAC,CAIvF;IAEK,MAAM,CAAC,KAAK,EAAE,WAAW,EAAE,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,EAAE,KAAK,CAAC,EAAE,MAAM,GAAG,OAAO,CAAC,WAAW,EAAE,CAAC,CAIxG;IAEK,KAAK,CAAC,KAAK,EAAE,WAAW,EAAE,QAAQ,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC,CAI/D;IAEK,WAAW,CAAC,KAAK,EAAE,WAAW,EAAE,QAAQ,EAAE,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC,CAiCvE;CACF;AAwBD,wBAAgB,YAAY,CAAC,GAAG,EAAE,MAAM,EAAE,KAAK,GAAE,WAA8B,GAAG,WAAW,EAAE,CAO9F"}

package/dist/storage/memory-consolidator.d.ts

@@ -0,0 +1,50 @@
+import type { AfterRunHook, AgentExtension } from '../extension/extension-points.js';
+import type { MemoryStore } from '../types/memory.js';
+import type { Provider } from '../types/provider.js';
+export interface ConsolidationOp {
+    action: 'add' | 'edit' | 'delete';
+    /** For add: the fact to remember. For edit: the new text replacing the old. */
+    text?: string | undefined;
+    /** For edit/delete: the query to match existing entries. */
+    query?: string | undefined;
+    /** Memory type for categorization. */
+    type?: string | undefined;
+    /** Tags for grouping. */
+    tags?: string[] | undefined;
+    /** Priority level. */
+    priority?: string | undefined;
+}
+export interface MemoryConsolidatorOptions {
+    memoryStore: MemoryStore;
+    /**
+     * Provider used for the consolidation LLM call. Uses the session's
+     * provider by default.
+     */
+    provider?: Provider | undefined;
+    /**
+     * Model override for the consolidation call. Uses the session's model
+     * by default. A smaller/faster model is recommended (e.g. haiku, flash).
+     */
+    model?: string | undefined;
+    /**
+     * Minimum session iterations before consolidation fires.
+     * Sessions shorter than this are skipped (default 2).
+     */
+    minIterations?: number | undefined;
+    /**
+     * Maximum memory entries to include in the prompt as context.
+     */
+    maxExistingEntries?: number | undefined;
+}
+export declare class SessionMemoryConsolidator implements AgentExtension {
+    name: string;
+    owner: string;
+    private readonly memoryStore;
+    private readonly provider?;
+    private readonly model?;
+    private readonly minIterations;
+    private readonly maxExistingEntries;
+    constructor(opts: MemoryConsolidatorOptions);
+    afterRun: AfterRunHook;
+}
+//# sourceMappingURL=memory-consolidator.d.ts.map

package/dist/storage/memory-consolidator.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"memory-consolidator.d.ts","sourceRoot":"","sources":["../../src/storage/memory-consolidator.ts"],"names":[],"mappings":"AAEA,OAAO,KAAK,EAAE,YAAY,EAAE,cAAc,EAAE,MAAM,kCAAkC,CAAC;AACrF,OAAO,KAAK,EAAe,WAAW,EAAE,MAAM,oBAAoB,CAAC;AACnE,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,sBAAsB,CAAC;AAQrD,MAAM,WAAW,eAAe;IAC9B,MAAM,EAAE,KAAK,GAAG,MAAM,GAAG,QAAQ,CAAC;IAClC,+EAA+E;IAC/E,IAAI,CAAC,EAAE,MAAM,GAAG,SAAS,CAAC;IAC1B,4DAA4D;IAC5D,KAAK,CAAC,EAAE,MAAM,GAAG,SAAS,CAAC;IAC3B,sCAAsC;IACtC,IAAI,CAAC,EAAE,MAAM,GAAG,SAAS,CAAC;IAC1B,yBAAyB;IACzB,IAAI,CAAC,EAAE,MAAM,EAAE,GAAG,SAAS,CAAC;IAC5B,sBAAsB;IACtB,QAAQ,CAAC,EAAE,MAAM,GAAG,SAAS,CAAC;CAC/B;AAOD,MAAM,WAAW,yBAAyB;IACxC,WAAW,EAAE,WAAW,CAAC;IACzB;;;OAGG;IACH,QAAQ,CAAC,EAAE,QAAQ,GAAG,SAAS,CAAC;IAChC;;;OAGG;IACH,KAAK,CAAC,EAAE,MAAM,GAAG,SAAS,CAAC;IAC3B;;;OAGG;IACH,aAAa,CAAC,EAAE,MAAM,GAAG,SAAS,CAAC;IACnC;;OAEG;IACH,kBAAkB,CAAC,EAAE,MAAM,GAAG,SAAS,CAAC;CACzC;AAyBD,qBAAa,yBAA0B,YAAW,cAAc;IAC9D,IAAI,SAAiC;IACrC,KAAK,SAAU;IAEf,OAAO,CAAC,QAAQ,CAAC,WAAW,CAAc;IAC1C,OAAO,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAuB;IACjD,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAqB;IAC5C,OAAO,CAAC,QAAQ,CAAC,aAAa,CAAS;IACvC,OAAO,CAAC,QAAQ,CAAC,kBAAkB,CAAS;IAE5C,YAAY,IAAI,EAAE,yBAAyB,EAM1C;IAED,QAAQ,EAAE,YAAY,CA2GpB;CACH"}

package/dist/storage/memory-graph-backend.d.ts

@@ -0,0 +1,117 @@
+import type { MemoryEntry, MemoryScope } from '../types/memory.js';
+import { type FileMemoryBackendOptions } from './memory-backend.js';
+import type { MemoryBackend } from './memory-backend.js';
+interface GraphNode {
+    id: string;
+    entry: MemoryEntry;
+    firstSeen: string;
+    count: number;
+    /** Extracted metadata for fast lookup. */
+    type?: MemoryEntry['type'] | undefined;
+    tags?: string[] | undefined;
+    priority?: MemoryEntry['priority'] | undefined;
+}
+interface GraphEdge {
+    from: string;
+    to: string;
+    /** Why these nodes are related. */
+    relation: 'co_occurring' | 'similar' | 'same_turn' | 'explicit';
+    weight: number;
+    ts: string;
+}
+export interface GraphMemoryBackendOptions extends FileMemoryBackendOptions {
+    /**
+     * Path to the graph metadata file (edges + node metadata).
+     * Defaults to `<projectDir>/memory-graph.json`.
+     */
+    graphPath?: string | undefined;
+}
+/**
+ * Graph-based memory backend that tracks relationships between entries.
+ * Builds on top of FileMemoryBackend — entries are still persisted as
+ * markdown bullets, but the graph layer adds:
+ *
+ *   - Co-occurrence edges (entries from the same remember() batch)
+ *   - Content similarity edges (simple Jaccard on word overlap)
+ *   - Turn-based edges (entries created in the same LLM turn)
+ *   - Graph traversal queries (find related memories)
+ *
+ * The graph metadata persists to `<projectDir>/memory-graph.json`.
+ */
+export declare class GraphMemoryBackend implements MemoryBackend {
+    readonly kind = "graph";
+    private readonly file;
+    private readonly graphFile;
+    private nodes;
+    private edges;
+    private loadedScope;
+    private loaded;
+    /**
+     * Inverted index for O(1) term → node lookup during search.
+     * Built incrementally on remember/forget, rebuilt on loadGraph if absent.
+     * Maps lowercase term (min 3 chars) → Set of node IDs containing that term.
+     */
+    private invertedIndex;
+    /** Minimum term length to index — avoids noise from 1-2 char fragments. */
+    private static readonly MIN_TERM_LEN;
+    /**
+     * Promise that resolves when the current in-flight _saveGraph completes.
+     * Tests call flush() to await this before deleting the backend or its temp dir.
+     * Each save operation chains onto the previous one so concurrent saves are serialised.
+     */
+    private _saveDone;
+    constructor(opts: GraphMemoryBackendOptions);
+    remember(scope: MemoryScope, entry: MemoryEntry, filePath: string): Promise<void>;
+    forget(scope: MemoryScope, query: string, filePath: string): Promise<number>;
+    readAll(scope: MemoryScope, filePath: string): Promise<string>;
+    list(scope: MemoryScope, filePath: string, limit?: number): Promise<MemoryEntry[]>;
+    search(scope: MemoryScope, query: string, _filePath: string, limit?: number): Promise<MemoryEntry[]>;
+    clear(scope: MemoryScope, filePath: string): Promise<void>;
+    consolidate(scope: MemoryScope, filePath: string): Promise<number>;
+    /**
+     * Find memories related to the given entry, ordered by edge weight.
+     */
+    findRelated(scope: MemoryScope, _filePath: string, entryText: string, limit?: number): Promise<MemoryEntry[]>;
+    /**
+     * Get all edges for visualization or traversal.
+     */
+    getGraph(): {
+        nodes: GraphNode[];
+        edges: GraphEdge[];
+    };
+    private nodeId;
+    private loadGraph;
+    /** Fire-and-forget graph persistence. Named _saveGraph to signal it must not be awaited. */
+    private _saveGraph;
+    /**
+     * Wait for all in-flight _saveGraph operations to complete.
+     * Call this before deleting the backend or its temp directory.
+     */
+    flush(): Promise<void>;
+    /**
+     * Build the inverted index from all currently loaded nodes.
+     * Called on loadGraph() to reconstruct the index after loading from disk.
+     */
+    private buildInvertedIndex;
+    /**
+     * Index a node in the inverted index. Adds the node's ID to all term entries.
+     */
+    private indexNode;
+    /**
+     * Remove a node's terms from the inverted index before deleting it.
+     * Used in forget() and when updating existing nodes.
+     */
+    private removeNodeFromIndex;
+    /**
+     * Update an existing node's entries in the inverted index.
+     * Removes old terms and adds new ones.
+     */
+    private updateNodeIndex;
+    /**
+     * Extract searchable terms from a memory entry.
+     * Returns lowercase words from text (min length) and full tag strings.
+     */
+    private extractTerms;
+}
+export {};
+//# sourceMappingURL=memory-graph-backend.d.ts.map

package/dist/storage/memory-graph-backend.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"memory-graph-backend.d.ts","sourceRoot":"","sources":["../../src/storage/memory-graph-backend.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAE,WAAW,EAAE,WAAW,EAAE,MAAM,oBAAoB,CAAC;AACnE,OAAO,EAAE,KAAK,wBAAwB,EAAqB,MAAM,qBAAqB,CAAC;AACvF,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,qBAAqB,CAAC;AAIzD,UAAU,SAAS;IACjB,EAAE,EAAE,MAAM,CAAC;IACX,KAAK,EAAE,WAAW,CAAC;IACnB,SAAS,EAAE,MAAM,CAAC;IAClB,KAAK,EAAE,MAAM,CAAC;IACd,0CAA0C;IAC1C,IAAI,CAAC,EAAE,WAAW,CAAC,MAAM,CAAC,GAAG,SAAS,CAAC;IACvC,IAAI,CAAC,EAAE,MAAM,EAAE,GAAG,SAAS,CAAC;IAC5B,QAAQ,CAAC,EAAE,WAAW,CAAC,UAAU,CAAC,GAAG,SAAS,CAAC;CAChD;AAED,UAAU,SAAS;IACjB,IAAI,EAAE,MAAM,CAAC;IACb,EAAE,EAAE,MAAM,CAAC;IACX,mCAAmC;IACnC,QAAQ,EAAE,cAAc,GAAG,SAAS,GAAG,WAAW,GAAG,UAAU,CAAC;IAChE,MAAM,EAAE,MAAM,CAAC;IACf,EAAE,EAAE,MAAM,CAAC;CACZ;AAID,MAAM,WAAW,yBAA0B,SAAQ,wBAAwB;IACzE;;;OAGG;IACH,SAAS,CAAC,EAAE,MAAM,GAAG,SAAS,CAAC;CAChC;AAED;;;;;;;;;;;GAWG;AACH,qBAAa,kBAAmB,YAAW,aAAa;IACtD,QAAQ,CAAC,IAAI,WAAW;IAExB,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAoB;IACzC,OAAO,CAAC,QAAQ,CAAC,SAAS,CAAS;IAGnC,OAAO,CAAC,KAAK,CAAgC;IAC7C,OAAO,CAAC,KAAK,CAAmB;IAChC,OAAO,CAAC,WAAW,CAA4B;IAC/C,OAAO,CAAC,MAAM,CAAS;IAEvB;;;;OAIG;IACH,OAAO,CAAC,aAAa,CAAkC;IAEvD,2EAA2E;IAC3E,OAAO,CAAC,MAAM,CAAC,QAAQ,CAAC,YAAY,CAAK;IAEzC;;;;OAIG;IACH,OAAO,CAAC,SAAS,CAAoC;IAErD,YAAY,IAAI,EAAE,yBAAyB,EAG1C;IAIK,QAAQ,CAAC,KAAK,EAAE,WAAW,EAAE,KAAK,EAAE,WAAW,EAAE,QAAQ,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC,CAwDtF;IAEK,MAAM,CAAC,KAAK,EAAE,WAAW,EAAE,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC,CAsBjF;IAEK,OAAO,CAAC,KAAK,EAAE,WAAW,EAAE,QAAQ,EAAE,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC,CAEnE;IAEK,IAAI,CAAC,KAAK,EAAE,WAAW,EAAE,QAAQ,EAAE,MAAM,EAAE,KAAK,CAAC,EAAE,MAAM,GAAG,OAAO,CAAC,WAAW,EAAE,CAAC,CA+BvF;IAEK,MAAM,CAAC,KAAK,EAAE,WAAW,EAAE,KAAK,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,KAAK,CAAC,EAAE,MAAM,GAAG,OAAO,CAAC,WAAW,EAAE,CAAC,CAiDzG;IAEK,KAAK,CAAC,KAAK,EAAE,WAAW,EAAE,QAAQ,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC,CAS/D;IAEK,WAAW,CAAC,KAAK,EAAE,WAAW,EAAE,QAAQ,EAAE,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC,CAEvE;IAID;;OAEG;IACG,WAAW,CAAC,KAAK,EAAE,WAAW,EAAE,SAAS,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,KAAK,SAAI,GAAG,OAAO,CAAC,WAAW,EAAE,CAAC,CAe7G;IAED;;OAEG;IACH,QAAQ,IAAI;QAAE,KAAK,EAAE,SAAS,EAAE,CAAC;QAAC,KAAK,EAAE,SAAS,EAAE,CAAA;KAAE,CAKrD;IAID,OAAO,CAAC,MAAM;YAMA,SAAS;IAiBvB,4FAA4F;YAC9E,UAAU;IAmBxB;;;OAGG;IACG,KAAK,IAAI,OAAO,CAAC,IAAI,CAAC,CAE3B;IAID;;;OAGG;IACH,OAAO,CAAC,kBAAkB;IAc1B;;OAEG;IACH,OAAO,CAAC,SAAS;IAWjB;;;OAGG;IACH,OAAO,CAAC,mBAAmB;IAa3B;;;OAGG;IACH,OAAO,CAAC,eAAe;IAUvB;;;OAGG;IACH,OAAO,CAAC,YAAY;CAoBrB"}

package/dist/storage/memory-store.d.ts

@@ -0,0 +1,119 @@
+import type { MemoryEntry, MemoryRelevanceContext, MemoryScope, MemoryStore, ScoredEntry } from '../types/memory.js';
+import type { EventBus } from '../kernel/events.js';
+import type { WstackPaths } from '../utils/wstack-paths.js';
+import { type MemoryBackend } from './memory-backend.js';
+export interface MemoryStoreOptions {
+    paths: WstackPaths;
+    /**
+     * Optional event bus — when provided, mutations emit events so plugins
+     * and other subsystems can react to memory changes.
+     */
+    events?: EventBus | undefined;
+    /**
+     * Storage backend. Defaults to FileMemoryBackend when omitted.
+     * Plugins can register a custom backend (graph, semantic, vector)
+     * via the DI container to override storage behavior.
+     */
+    backend?: MemoryBackend | undefined;
+}
+/**
+ * Three scopes:
+ *   project-agents → <project>/.wrongstack/AGENTS.md     (committed)
+ *   project-memory → ~/.wrongstack/projects/<hash>/memory.md   (per-project agent notes)
+ *   user-memory    → ~/.wrongstack/memory.md             (global personal memory)
+ */
+export declare class DefaultMemoryStore implements MemoryStore {
+    private readonly files;
+    private readonly events?;
+    private traceId?;
+    private readonly backend;
+    /**
+     * Per-scope serialization queue. `remember` / `forget` / `consolidate` /
+     * `clear` are read-modify-write against a single file; without a lock,
+     * two concurrent calls on the same scope can read the same baseline and
+     * the later write silently drops the earlier entry. We chain each
+     * mutation onto the prior promise for the same scope so they run in
+     * issue order. Different scopes still proceed in parallel.
+     *
+     * The chain tracks only the last pending write. If a write fails, its
+     * error is caught and swallowed so the chain stays alive for subsequent
+     * calls. The error is stored in `writeErrors` so callers can learn about
+     * it on the next read operation.
+     */
+    private readonly writeChain;
+    /** Last write error per scope — surfaced as warnings on the next readAll(). */
+    private readonly writeErrors;
+    /**
+     * When the global root is a temporary directory (opencode, CI sandboxes),
+     * memory files are also mirrored to the project tree so they survive
+     * session cleanup. The primary path stays in the temp root for isolation;
+     * this backup ensures memory is never lost.
+     */
+    private readonly persistBackup;
+    private readonly backupDir;
+    /**
+     * Per-scope tracked byte sizes — incremented on `remember()`, decremented on
+     * `forget()`, recalculated after `consolidate()`. Eliminates the redundant
+     * readAll() call that previously checked the file size after every write.
+     */
+    private readonly _trackedByteSizes;
+    /** Result cache for scoreRelevant() — keyed by scope + context hash, TTL 30s. */
+    private readonly _scoreCache;
+    /**
+     * Per-entry cached lowercase strings — lazily allocated once and reused
+     * across scoreRelevant() calls so repeated scoring of the same entries skips
+     * re-lowercasing. Keyed by entry object identity; cleared (set to null) on
+     * every mutation (remember/forget/consolidate/clear) via invalidateScoreCaches().
+     */
+    private _cachedLower;
+    constructor(opts: MemoryStoreOptions);
+    /** Expose the backend for plugin introspection and advanced queries. */
+    getBackend(): MemoryBackend;
+    private runSerialized;
+    /**
+     * Recalculate the tracked byte size for a scope by re-reading the file and
+     * summing the serialized byte length of each line. Called after consolidate()
+     * (which modifies the file) to keep the tracker accurate.
+     */
+    private _recalcTrackedByteSize;
+    readAll(): Promise<string>;
+    read(scope: MemoryScope): Promise<string>;
+    /**
+     * List entries from a scope, newest first. Delegates to the backend
+     * so graph/semantic backends can return enriched or filtered results.
+     */
+    list(scope?: MemoryScope, limit?: number): Promise<MemoryEntry[]>;
+    /**
+     * Find memories related to the given text via graph traversal.
+     * Falls back to content search when no graph backend is available.
+     */
+    findRelated(text: string, scope?: MemoryScope, limit?: number): Promise<MemoryEntry[]>;
+    search(query: string, scope?: MemoryScope, limit?: number): Promise<MemoryEntry[]>;
+    remember(text: string, scope?: MemoryScope, metadata?: Omit<Partial<MemoryEntry>, 'scope' | 'text' | 'ts'>): Promise<void>;
+    /**
+     * Drop the relevance caches after a mutation. Both the per-context score
+     * cache and the per-entry lowercase cache are keyed on entry objects that a
+     * mutation invalidates, so they must be cleared together when entries change.
+     */
+    private invalidateScoreCaches;
+    /**
+     * Score and rank memories by relevance to the current context.
+     * Returns entries with score >= MIN_RELEVANCE_SCORE, sorted highest first.
+     */
+    scoreRelevant(ctx: MemoryRelevanceContext, scope?: MemoryScope, limit?: number): Promise<ScoredEntry[]>;
+    forget(query: string, scope?: MemoryScope): Promise<number>;
+    consolidate(scope: MemoryScope): Promise<void>;
+    clear(scope?: MemoryScope): Promise<void>;
+    /**
+     * Return a new MemoryStore proxy that carries `traceId` on every storage
+     * event. The original store is left unchanged — callers that need a
+     * trace-decorated view (e.g. session-run tools) receive the proxy while
+     * the singleton remains trace-free for boot-time use.
+     *
+     * The proxy implements the full `MemoryStore` interface; all other
+     * properties (backend, etc.) are delegated to the original store.
+     */
+    withTraceId(traceId: string): MemoryStore;
+    private mirrorBackup;
+}
+//# sourceMappingURL=memory-store.d.ts.map

package/dist/storage/memory-store.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"memory-store.d.ts","sourceRoot":"","sources":["../../src/storage/memory-store.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAGV,WAAW,EAEX,sBAAsB,EAEtB,WAAW,EACX,WAAW,EACX,WAAW,EACZ,MAAM,oBAAoB,CAAC;AAC5B,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,qBAAqB,CAAC;AACpD,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,0BAA0B,CAAC;AAE5D,OAAO,EAAE,KAAK,aAAa,EAAqB,MAAM,qBAAqB,CAAC;AAI5E,MAAM,WAAW,kBAAkB;IACjC,KAAK,EAAE,WAAW,CAAC;IACnB;;;OAGG;IACH,MAAM,CAAC,EAAE,QAAQ,GAAG,SAAS,CAAC;IAC9B;;;;OAIG;IACH,OAAO,CAAC,EAAE,aAAa,GAAG,SAAS,CAAC;CACrC;AAED;;;;;GAKG;AACH,qBAAa,kBAAmB,YAAW,WAAW;IACpD,OAAO,CAAC,QAAQ,CAAC,KAAK,CAA8B;IACpD,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAuB;IAC/C,OAAO,CAAC,OAAO,CAAC,CAAqB;IACrC,OAAO,CAAC,QAAQ,CAAC,OAAO,CAAgB;IAExC;;;;;;;;;;;;OAYG;IACH,OAAO,CAAC,QAAQ,CAAC,UAAU,CAA4C;IACvE,+EAA+E;IAC/E,OAAO,CAAC,QAAQ,CAAC,WAAW,CAAiC;IAE7D;;;;;OAKG;IACH,OAAO,CAAC,QAAQ,CAAC,aAAa,CAAU;IACxC,OAAO,CAAC,QAAQ,CAAC,SAAS,CAAS;IACnC;;;;OAIG;IACH,OAAO,CAAC,QAAQ,CAAC,iBAAiB,CAA4C;IAE9E,iFAAiF;IACjF,OAAO,CAAC,QAAQ,CAAC,WAAW,CAA2F;IAEvH;;;;;OAKG;IACH,OAAO,CAAC,YAAY,CAAiF;IAErG,YAAY,IAAI,EAAE,kBAAkB,EAgBnC;IAED,wEAAwE;IACxE,UAAU,IAAI,aAAa,CAE1B;YAEa,aAAa;IAqB3B;;;;OAIG;YACW,sBAAsB;IAU9B,OAAO,IAAI,OAAO,CAAC,MAAM,CAAC,CAsC/B;IAEK,IAAI,CAAC,KAAK,EAAE,WAAW,GAAG,OAAO,CAAC,MAAM,CAAC,CA8B9C;IAED;;;OAGG;IACG,IAAI,CAAC,KAAK,GAAE,WAA8B,EAAE,KAAK,CAAC,EAAE,MAAM,GAAG,OAAO,CAAC,WAAW,EAAE,CAAC,CAExF;IAED;;;OAGG;IACG,WAAW,CAAC,IAAI,EAAE,MAAM,EAAE,KAAK,GAAE,WAA8B,EAAE,KAAK,SAAI,GAAG,OAAO,CAAC,WAAW,EAAE,CAAC,CAKxG;IAEK,MAAM,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,GAAE,WAA8B,EAAE,KAAK,CAAC,EAAE,MAAM,GAAG,OAAO,CAAC,WAAW,EAAE,CAAC,CAEzG;IAEK,QAAQ,CACZ,IAAI,EAAE,MAAM,EACZ,KAAK,GAAE,WAA8B,EACrC,QAAQ,CAAC,EAAE,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,EAAE,OAAO,GAAG,MAAM,GAAG,IAAI,CAAC,GAC7D,OAAO,CAAC,IAAI,CAAC,CAsEf;IAED;;;;OAIG;IACH,OAAO,CAAC,qBAAqB;IAK7B;;;OAGG;IACG,aAAa,CACjB,GAAG,EAAE,sBAAsB,EAC3B,KAAK,GAAE,WAA8B,EACrC,KAAK,SAAI,GACR,OAAO,CAAC,WAAW,EAAE,CAAC,CAiIxB;IAEK,MAAM,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,GAAE,WAA8B,GAAG,OAAO,CAAC,MAAM,CAAC,CA4ClF;IAEK,WAAW,CAAC,KAAK,EAAE,WAAW,GAAG,OAAO,CAAC,IAAI,CAAC,CA0CnD;IAEK,KAAK,CAAC,KAAK,CAAC,EAAE,WAAW,GAAG,OAAO,CAAC,IAAI,CAAC,CA6E9C;IAED;;;;;;;;OAQG;IACH,WAAW,CAAC,OAAO,EAAE,MAAM,GAAG,WAAW,CAMxC;YACa,YAAY;CAW3B"}

package/dist/storage/plan-store.d.ts

@@ -0,0 +1,78 @@
+import type { EventBus } from '../kernel/events.js';
+import type { ConversationState } from '../core/conversation-state.js';
+/**
+ * Plan items are the strategic counterpart to todos. Where `ctx.todos`
+ * is the moment-to-moment task board the LLM mutates per-turn, a plan
+ * captures the higher-level approach — the steps the user (or LLM)
+ * laid out before any work began.
+ *
+ * Plans persist by default (per session) so a resumed session can show
+ * "you were on step 3 of 5". Todos are derived/transient. Both can
+ * coexist: think roadmap (plan) vs. sprint board (todos).
+ */
+export interface PlanItem {
+    id: string;
+    title: string;
+    /** Optional longer-form context or rationale. */
+    details?: string | undefined;
+    status: 'open' | 'in_progress' | 'done';
+    createdAt: string;
+    updatedAt: string;
+}
+export interface PlanFile {
+    version: 1;
+    sessionId: string;
+    title?: string | undefined;
+    updatedAt: string;
+    items: PlanItem[];
+}
+export declare function loadPlan(filePath: string, events?: EventBus): Promise<PlanFile | null>;
+/**
+ * Persist a plan. Returns `true` on success, `false` if the write failed
+ * (still emits `storage.error` + warns — it does NOT throw, so callers that
+ * treat a lost plan-save as non-fatal keep working). `mutatePlan` inspects the
+ * result and throws so the plan TOOL can report `ok:false` instead of falsely
+ * claiming the plan was persisted.
+ */
+export declare function savePlan(filePath: string, plan: PlanFile, events?: EventBus): Promise<boolean>;
+/** Create a new PlanFile when none exists on disk. */
+export declare function emptyPlan(sessionId: string, title?: string): PlanFile;
+export declare function addPlanItem(plan: PlanFile, title: string, details?: string | undefined): {
+    plan: PlanFile;
+    item: PlanItem;
+};
+export declare function removePlanItem(plan: PlanFile, idOrIndex: string): PlanFile;
+export declare function setPlanItemStatus(plan: PlanFile, idOrIndex: string, status: PlanItem['status']): PlanFile;
+export declare function clearPlan(plan: PlanFile): PlanFile;
+/** Render the plan as a short markdown-ish string suitable for slash output. */
+export declare function formatPlan(plan: PlanFile): string;
+/**
+ * Promote a plan item to a set of todo items.
+ * The plan item is marked 'in_progress' (if not already done) and its
+ * title + details become the first todo; additional subtasks are appended.
+ * Returns the derived todo list so the caller can pass it to `todoTool`
+ * or `ctx.state.replaceTodos()`.
+ */
+export declare function deriveTodosFromPlanItem(plan: PlanFile, idOrIndex: string, subtasks?: string[] | undefined): {
+    plan: PlanFile;
+    todos: Array<{
+        id: string;
+        content: string;
+        status: 'pending' | 'in_progress' | 'completed';
+        activeForm?: string | undefined;
+        promotedFromPlan?: string | undefined;
+    }>;
+} | null;
+/**
+ * Load, modify, and save the plan file under a file-level lock.
+ * Prevents races from parallel tool invocations (e.g. batch_tool_use).
+ */
+export declare function mutatePlan(filePath: string, sessionId: string, fn: (plan: PlanFile) => PlanFile | Promise<PlanFile>): Promise<PlanFile>;
+/**
+ * Optional: attach a state-listener so meta operations (storing a plan
+ * id on ctx.meta) trigger a save. Currently a stub — plans don't live
+ * on Context, but this keeps the API surface symmetric with the todos
+ * checkpoint so future refactors can flip plans into Context if needed.
+ */
+export declare function attachPlanCheckpoint(_state: ConversationState, _filePath: string, _sessionId: string): () => void;
+//# sourceMappingURL=plan-store.d.ts.map

package/dist/storage/plan-store.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"plan-store.d.ts","sourceRoot":"","sources":["../../src/storage/plan-store.ts"],"names":[],"mappings":"AAEA,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,qBAAqB,CAAC;AACpD,OAAO,KAAK,EAAE,iBAAiB,EAAE,MAAM,+BAA+B,CAAC;AAKvE;;;;;;;;;GASG;AACH,MAAM,WAAW,QAAQ;IACvB,EAAE,EAAE,MAAM,CAAC;IACX,KAAK,EAAE,MAAM,CAAC;IACd,iDAAiD;IACjD,OAAO,CAAC,EAAE,MAAM,GAAG,SAAS,CAAC;IAC7B,MAAM,EAAE,MAAM,GAAG,aAAa,GAAG,MAAM,CAAC;IACxC,SAAS,EAAE,MAAM,CAAC;IAClB,SAAS,EAAE,MAAM,CAAC;CACnB;AAED,MAAM,WAAW,QAAQ;IACvB,OAAO,EAAE,CAAC,CAAC;IACX,SAAS,EAAE,MAAM,CAAC;IAClB,KAAK,CAAC,EAAE,MAAM,GAAG,SAAS,CAAC;IAC3B,SAAS,EAAE,MAAM,CAAC;IAClB,KAAK,EAAE,QAAQ,EAAE,CAAC;CACnB;AAED,wBAAsB,QAAQ,CAAC,QAAQ,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE,QAAQ,GAAG,OAAO,CAAC,QAAQ,GAAG,IAAI,CAAC,CAmD5F;AAED;;;;;;GAMG;AACH,wBAAsB,QAAQ,CAAC,QAAQ,EAAE,MAAM,EAAE,IAAI,EAAE,QAAQ,EAAE,MAAM,CAAC,EAAE,QAAQ,GAAG,OAAO,CAAC,OAAO,CAAC,CA4BpG;AAED,sDAAsD;AACtD,wBAAgB,SAAS,CAAC,SAAS,EAAE,MAAM,EAAE,KAAK,CAAC,EAAE,MAAM,GAAG,QAAQ,CAQrE;AAED,wBAAgB,WAAW,CACzB,IAAI,EAAE,QAAQ,EACd,KAAK,EAAE,MAAM,EACb,OAAO,CAAC,EAAE,MAAM,GAAG,SAAS,GAC3B;IAAE,IAAI,EAAE,QAAQ,CAAC;IAAC,IAAI,EAAE,QAAQ,CAAA;CAAE,CAcpC;AAED,wBAAgB,cAAc,CAAC,IAAI,EAAE,QAAQ,EAAE,SAAS,EAAE,MAAM,GAAG,QAAQ,CAQ1E;AAED,wBAAgB,iBAAiB,CAC/B,IAAI,EAAE,QAAQ,EACd,SAAS,EAAE,MAAM,EACjB,MAAM,EAAE,QAAQ,CAAC,QAAQ,CAAC,GACzB,QAAQ,CAQV;AAED,wBAAgB,SAAS,CAAC,IAAI,EAAE,QAAQ,GAAG,QAAQ,CAElD;AAED,gFAAgF;AAChF,wBAAgB,UAAU,CAAC,IAAI,EAAE,QAAQ,GAAG,MAAM,CAYjD;AAWD;;;;;;GAMG;AACH,wBAAgB,uBAAuB,CACrC,IAAI,EAAE,QAAQ,EACd,SAAS,EAAE,MAAM,EACjB,QAAQ,CAAC,EAAE,MAAM,EAAE,GAAG,SAAS,GAC9B;IAAE,IAAI,EAAE,QAAQ,CAAC;IAAC,KAAK,EAAE,KAAK,CAAC;QAAE,EAAE,EAAE,MAAM,CAAC;QAAC,OAAO,EAAE,MAAM,CAAC;QAAC,MAAM,EAAE,SAAS,GAAG,aAAa,GAAG,WAAW,CAAC;QAAC,UAAU,CAAC,EAAE,MAAM,GAAG,SAAS,CAAC;QAAC,gBAAgB,CAAC,EAAE,MAAM,GAAG,SAAS,CAAA;KAAE,CAAC,CAAA;CAAE,GAAG,IAAI,CAsCnM;AAED;;;GAGG;AACH,wBAAsB,UAAU,CAC9B,QAAQ,EAAE,MAAM,EAChB,SAAS,EAAE,MAAM,EACjB,EAAE,EAAE,CAAC,IAAI,EAAE,QAAQ,KAAK,QAAQ,GAAG,OAAO,CAAC,QAAQ,CAAC,GACnD,OAAO,CAAC,QAAQ,CAAC,CAenB;AAED;;;;;GAKG;AACH,wBAAgB,oBAAoB,CAClC,MAAM,EAAE,iBAAiB,EACzB,SAAS,EAAE,MAAM,EACjB,UAAU,EAAE,MAAM,GACjB,MAAM,IAAI,CAEZ"}

package/dist/storage/plan-templates.d.ts

@@ -0,0 +1,21 @@
+/**
+ * Plan templates — pre-defined plan skeletons for common workflows.
+ *
+ * Templates are stored in-memory (no disk I/O). Users instantiate them
+ * via `/plan template use <name>` or `planTool(action: 'template_use')`.
+ * Each template is a function that returns an array of item titles, so
+ * dynamic content (dates, project names) can be injected later.
+ */
+export interface PlanTemplate {
+    name: string;
+    description: string;
+    category: 'development' | 'release' | 'maintenance' | 'infrastructure';
+    items: Array<{
+        title: string;
+        details?: string | undefined;
+    }>;
+}
+export declare function listPlanTemplates(): PlanTemplate[];
+export declare function getPlanTemplate(name: string): PlanTemplate | undefined;
+export declare function formatPlanTemplates(): string;
+//# sourceMappingURL=plan-templates.d.ts.map

package/dist/storage/plan-templates.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"plan-templates.d.ts","sourceRoot":"","sources":["../../src/storage/plan-templates.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH,MAAM,WAAW,YAAY;IAC3B,IAAI,EAAE,MAAM,CAAC;IACb,WAAW,EAAE,MAAM,CAAC;IACpB,QAAQ,EAAE,aAAa,GAAG,SAAS,GAAG,aAAa,GAAG,gBAAgB,CAAC;IACvE,KAAK,EAAE,KAAK,CAAC;QACX,KAAK,EAAE,MAAM,CAAC;QACd,OAAO,CAAC,EAAE,MAAM,GAAG,SAAS,CAAC;KAC9B,CAAC,CAAC;CACJ;AA2FD,wBAAgB,iBAAiB,IAAI,YAAY,EAAE,CAElD;AAED,wBAAgB,eAAe,CAAC,IAAI,EAAE,MAAM,GAAG,YAAY,GAAG,SAAS,CAEtE;AAED,wBAAgB,mBAAmB,IAAI,MAAM,CAgB5C"}

package/dist/storage/prompt-store.d.ts

@@ -0,0 +1,37 @@
+import type { PromptEntry } from '../types/prompt.js';
+import type { WstackPaths } from '../utils/wstack-paths.js';
+export type { PromptEntry, PromptSource, PromptVariable } from '../types/prompt.js';
+export interface PromptStore {
+    list(): Promise<PromptEntry[]>;
+    get(id: string): Promise<PromptEntry | null>;
+    save(entry: PromptEntry): Promise<void>;
+    delete(id: string): Promise<boolean>;
+    find(query: string): Promise<PromptEntry[]>;
+}
+/** sha256 of a prompt's content — used for builtin/synced integrity checks. */
+export declare function promptChecksum(content: string): string;
+/**
+ * Upgrade any persisted prompt record (v1 or v2) to a fully-populated v2
+ * `PromptEntry`. Pure — does not touch disk. v1 records (only
+ * `id/title/content/tags/createdAt/updatedAt`) get sensible defaults:
+ * slug from title, empty description, `uncategorized` category, `user` source.
+ */
+export declare function migratePromptEntry(raw: unknown): PromptEntry | null;
+/**
+ * DefaultPromptStore — file-per-prompt JSON in a single directory (the global
+ * `~/.wrongstack/prompts` by default, or a layer dir the loader passes in).
+ * Reads tolerate legacy v1 files via `migratePromptEntry`; writes always emit
+ * the current v2 schema.
+ */
+export declare class DefaultPromptStore implements PromptStore {
+    private readonly dir;
+    constructor(pathsOrDir: WstackPaths | string);
+    list(): Promise<PromptEntry[]>;
+    get(id: string): Promise<PromptEntry | null>;
+    save(entry: PromptEntry): Promise<void>;
+    delete(id: string): Promise<boolean>;
+    find(query: string): Promise<PromptEntry[]>;
+    /** Create a new v2 entry and return it. Does NOT persist — call save() afterwards. */
+    createNew(title: string, content: string, tags?: string[], extra?: Partial<Omit<PromptEntry, 'id' | 'title' | 'content' | 'tags' | 'createdAt' | 'updatedAt'>>): PromptEntry;
+}
+//# sourceMappingURL=prompt-store.d.ts.map

package/dist/storage/prompt-store.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"prompt-store.d.ts","sourceRoot":"","sources":["../../src/storage/prompt-store.ts"],"names":[],"mappings":"AAGA,OAAO,KAAK,EAAE,WAAW,EAAkB,MAAM,oBAAoB,CAAC;AAItE,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,0BAA0B,CAAC;AAE5D,YAAY,EAAE,WAAW,EAAE,YAAY,EAAE,cAAc,EAAE,MAAM,oBAAoB,CAAC;AAEpF,MAAM,WAAW,WAAW;IAC1B,IAAI,IAAI,OAAO,CAAC,WAAW,EAAE,CAAC,CAAC;IAC/B,GAAG,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO,CAAC,WAAW,GAAG,IAAI,CAAC,CAAC;IAC7C,IAAI,CAAC,KAAK,EAAE,WAAW,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC;IACxC,MAAM,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO,CAAC,OAAO,CAAC,CAAC;IACrC,IAAI,CAAC,KAAK,EAAE,MAAM,GAAG,OAAO,CAAC,WAAW,EAAE,CAAC,CAAC;CAC7C;AAUD,+EAA+E;AAC/E,wBAAgB,cAAc,CAAC,OAAO,EAAE,MAAM,GAAG,MAAM,CAEtD;AAED;;;;;GAKG;AACH,wBAAgB,kBAAkB,CAAC,GAAG,EAAE,OAAO,GAAG,WAAW,GAAG,IAAI,CAkCnE;AAiCD;;;;;GAKG;AACH,qBAAa,kBAAmB,YAAW,WAAW;IACpD,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAS;IAE7B,YAAY,UAAU,EAAE,WAAW,GAAG,MAAM,EAE3C;IAEK,IAAI,IAAI,OAAO,CAAC,WAAW,EAAE,CAAC,CAuBnC;IAEK,GAAG,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO,CAAC,WAAW,GAAG,IAAI,CAAC,CAQjD;IAEK,IAAI,CAAC,KAAK,EAAE,WAAW,GAAG,OAAO,CAAC,IAAI,CAAC,CAK5C;IAEK,MAAM,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO,CAAC,OAAO,CAAC,CAQzC;IAEK,IAAI,CAAC,KAAK,EAAE,MAAM,GAAG,OAAO,CAAC,WAAW,EAAE,CAAC,CAWhD;IAED,sFAAsF;IACtF,SAAS,CACP,KAAK,EAAE,MAAM,EACb,OAAO,EAAE,MAAM,EACf,IAAI,GAAE,MAAM,EAAO,EACnB,KAAK,GAAE,OAAO,CACZ,IAAI,CAAC,WAAW,EAAE,IAAI,GAAG,OAAO,GAAG,SAAS,GAAG,MAAM,GAAG,WAAW,GAAG,WAAW,CAAC,CAC9E,GACL,WAAW,CAqBb;CACF"}

package/dist/storage/prompt-usage-store.d.ts

@@ -0,0 +1,29 @@
+export interface PromptUsage {
+    count: number;
+    lastUsedAt: string;
+}
+/**
+ * Tracks how often each prompt is inserted, keyed by slug, in a single JSON
+ * file (`~/.wrongstack/prompt-usage.json`). Kept SEPARATE from the prompt
+ * entries so usage can be recorded for read-only builtin prompts without
+ * copy-on-writing them into the user layer. Surfaces "recent / most-used"
+ * views and a gentle search-ranking boost.
+ */
+export declare class PromptUsageStore {
+    private readonly file;
+    constructor(file: string);
+    load(): Promise<Record<string, PromptUsage>>;
+    record(slug: string, at?: string): Promise<PromptUsage>;
+    get(slug: string): Promise<PromptUsage | undefined>;
+    /** Slugs ordered by most-recently-used (then by count), capped at `limit`. */
+    recent(limit?: number): Promise<{
+        slug: string;
+        usage: PromptUsage;
+    }[]>;
+    /** Slugs ordered by usage count (then recency), capped at `limit`. */
+    top(limit?: number): Promise<{
+        slug: string;
+        usage: PromptUsage;
+    }[]>;
+}
+//# sourceMappingURL=prompt-usage-store.d.ts.map

package/dist/storage/prompt-usage-store.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"prompt-usage-store.d.ts","sourceRoot":"","sources":["../../src/storage/prompt-usage-store.ts"],"names":[],"mappings":"AAIA,MAAM,WAAW,WAAW;IAC1B,KAAK,EAAE,MAAM,CAAC;IACd,UAAU,EAAE,MAAM,CAAC;CACpB;AAOD;;;;;;GAMG;AACH,qBAAa,gBAAgB;IACf,OAAO,CAAC,QAAQ,CAAC,IAAI;IAAjC,YAA6B,IAAI,EAAE,MAAM,EAAI;IAEvC,IAAI,IAAI,OAAO,CAAC,MAAM,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC,CAUjD;IAEK,MAAM,CAAC,IAAI,EAAE,MAAM,EAAE,EAAE,GAAE,MAAiC,GAAG,OAAO,CAAC,WAAW,CAAC,CAQtF;IAEK,GAAG,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO,CAAC,WAAW,GAAG,SAAS,CAAC,CAExD;IAED,8EAA8E;IACxE,MAAM,CAAC,KAAK,SAAK,GAAG,OAAO,CAAC;QAAE,IAAI,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,WAAW,CAAA;KAAE,EAAE,CAAC,CAUxE;IAED,sEAAsE;IAChE,GAAG,CAAC,KAAK,SAAK,GAAG,OAAO,CAAC;QAAE,IAAI,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,WAAW,CAAA;KAAE,EAAE,CAAC,CAUrE;CACF"}