@moxxy/plugin-memory 0.27.0

package/dist/store/io.js

@@ -0,0 +1,124 @@
+import { promises as fs } from 'node:fs';
+import * as path from 'node:path';
+import { writeFileAtomic } from '@moxxy/sdk/server';
+import { parseMdFile } from '../parse.js';
+import { memoryFrontmatterSchema, } from './types.js';
+export async function safeRead(filePath) {
+    try {
+        const raw = await fs.readFile(filePath, 'utf8');
+        const parsed = parseMdFile(raw);
+        const result = memoryFrontmatterSchema.safeParse(parsed.frontmatter);
+        if (!result.success)
+            return null;
+        // Trim the body so safeRead agrees with readEntry/listEntries on the same
+        // file — they both `.trim()`. safeRead's only caller (writeEntry) reads just
+        // createdAt and discards the body, so this is behavior-preserving today; it
+        // removes the latent trap where a future body consumer would see different
+        // whitespace depending on which read path it used.
+        return { frontmatter: result.data, body: parsed.body.trim() };
+    }
+    catch {
+        return null;
+    }
+}
+export function isEnoent(err) {
+    return err instanceof Error && 'code' in err && err.code === 'ENOENT';
+}
+/**
+ * Cap on simultaneously-open file descriptors when reading a memory dir. The
+ * soft cap on entry count is warn-only, so a long-lived dir can hold thousands
+ * of files; an unbounded `Promise.all(readFile)` over all of them would open
+ * thousands of fds at once and can hit the OS limit (EMFILE) — failing every
+ * list/recall. Batching keeps the common case fast but bounds fd pressure.
+ */
+const READ_CONCURRENCY = 32;
+export async function listEntries(dir, filterType) {
+    let names;
+    try {
+        names = await fs.readdir(dir, { withFileTypes: true });
+    }
+    catch (err) {
+        if (isEnoent(err))
+            return [];
+        throw err;
+    }
+    // recall() and rows() both call this on the hot path; with up to
+    // DEFAULT_MAX_MEMORIES (500) entries, reading+parsing each file serially is
+    // 500 strictly-ordered disk round-trips. The reads are independent, so fan
+    // them out concurrently (bounded by READ_CONCURRENCY) and preserve dirent
+    // order in the result.
+    const candidates = names.filter((d) => d.isFile() && d.name.endsWith('.md') && d.name !== 'MEMORY.md');
+    const readOne = async (dirent) => {
+        const filePath = path.join(dir, dirent.name);
+        let raw;
+        try {
+            raw = await fs.readFile(filePath, 'utf8');
+        }
+        catch (err) {
+            // One unreadable file (deleted between readdir and readFile, transient
+            // permission error) must not fail the whole list. Drop it, surface
+            // non-ENOENT causes for diagnosis.
+            if (!isEnoent(err)) {
+                console.warn(`[plugin-memory] skipping unreadable memory file ${filePath}: ${String(err)}`);
+            }
+            return null;
+        }
+        const md = parseMdFile(raw);
+        const result = memoryFrontmatterSchema.safeParse(md.frontmatter);
+        if (!result.success) {
+            // A malformed entry silently vanishing from recall/index is a data-loss
+            // surprise; leave a breadcrumb so it's diagnosable.
+            console.warn(`[plugin-memory] ignoring memory file with invalid frontmatter: ${filePath}`);
+            return null;
+        }
+        if (filterType && result.data.type !== filterType)
+            return null;
+        return {
+            frontmatter: result.data,
+            body: md.body.trim(),
+            path: filePath,
+        };
+    };
+    const parsed = [];
+    for (let i = 0; i < candidates.length; i += READ_CONCURRENCY) {
+        const batch = candidates.slice(i, i + READ_CONCURRENCY);
+        parsed.push(...(await Promise.all(batch.map(readOne))));
+    }
+    return parsed.filter((e) => e !== null);
+}
+export async function readEntry(filePath) {
+    try {
+        const raw = await fs.readFile(filePath, 'utf8');
+        const parsed = parseMdFile(raw);
+        const result = memoryFrontmatterSchema.safeParse(parsed.frontmatter);
+        if (!result.success)
+            return null;
+        return { frontmatter: result.data, body: parsed.body.trim(), path: filePath };
+    }
+    catch (err) {
+        if (isEnoent(err))
+            return null;
+        throw err;
+    }
+}
+export async function writeIndex(dir, entries) {
+    const lines = ['# Memory index', ''];
+    const byType = new Map();
+    for (const e of entries) {
+        const list = byType.get(e.frontmatter.type) ?? [];
+        list.push(e);
+        byType.set(e.frontmatter.type, list);
+    }
+    for (const t of ['fact', 'preference', 'project', 'reference']) {
+        const items = byType.get(t);
+        if (!items || items.length === 0)
+            continue;
+        lines.push(`## ${t}`);
+        for (const item of items) {
+            lines.push(`- [${item.frontmatter.name}](${path.basename(item.path)}) — ${item.frontmatter.description}`);
+        }
+        lines.push('');
+    }
+    await writeFileAtomic(path.join(dir, 'MEMORY.md'), lines.join('\n'));
+}
+//# sourceMappingURL=io.js.map

package/dist/store/io.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"io.js","sourceRoot":"","sources":["../../src/store/io.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,IAAI,EAAE,EAAE,MAAM,SAAS,CAAC;AACzC,OAAO,KAAK,IAAI,MAAM,WAAW,CAAC;AAClC,OAAO,EAAE,eAAe,EAAE,MAAM,mBAAmB,CAAC;AACpD,OAAO,EAAE,WAAW,EAAE,MAAM,aAAa,CAAC;AAC1C,OAAO,EACL,uBAAuB,GAIxB,MAAM,YAAY,CAAC;AAEpB,MAAM,CAAC,KAAK,UAAU,QAAQ,CAC5B,QAAgB;IAEhB,IAAI,CAAC;QACH,MAAM,GAAG,GAAG,MAAM,EAAE,CAAC,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC;QAChD,MAAM,MAAM,GAAG,WAAW,CAAC,GAAG,CAAC,CAAC;QAChC,MAAM,MAAM,GAAG,uBAAuB,CAAC,SAAS,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC;QACrE,IAAI,CAAC,MAAM,CAAC,OAAO;YAAE,OAAO,IAAI,CAAC;QACjC,0EAA0E;QAC1E,6EAA6E;QAC7E,4EAA4E;QAC5E,2EAA2E;QAC3E,mDAAmD;QACnD,OAAO,EAAE,WAAW,EAAE,MAAM,CAAC,IAAI,EAAE,IAAI,EAAE,MAAM,CAAC,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC;IAChE,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,IAAI,CAAC;IACd,CAAC;AACH,CAAC;AAED,MAAM,UAAU,QAAQ,CAAC,GAAY;IACnC,OAAO,GAAG,YAAY,KAAK,IAAI,MAAM,IAAI,GAAG,IAAK,GAA6B,CAAC,IAAI,KAAK,QAAQ,CAAC;AACnG,CAAC;AAED;;;;;;GAMG;AACH,MAAM,gBAAgB,GAAG,EAAE,CAAC;AAE5B,MAAM,CAAC,KAAK,UAAU,WAAW,CAC/B,GAAW,EACX,UAAuB;IAEvB,IAAI,KAAiC,CAAC;IACtC,IAAI,CAAC;QACH,KAAK,GAAG,MAAM,EAAE,CAAC,OAAO,CAAC,GAAG,EAAE,EAAE,aAAa,EAAE,IAAI,EAAE,CAAC,CAAC;IACzD,CAAC;IAAC,OAAO,GAAG,EAAE,CAAC;QACb,IAAI,QAAQ,CAAC,GAAG,CAAC;YAAE,OAAO,EAAE,CAAC;QAC7B,MAAM,GAAG,CAAC;IACZ,CAAC;IACD,iEAAiE;IACjE,4EAA4E;IAC5E,2EAA2E;IAC3E,0EAA0E;IAC1E,uBAAuB;IACvB,MAAM,UAAU,GAAG,KAAK,CAAC,MAAM,CAC7B,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,KAAK,WAAW,CACtE,CAAC;IACF,MAAM,OAAO,GAAG,KAAK,EAAE,MAAgC,EAA+B,EAAE;QACtF,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE,MAAM,CAAC,IAAI,CAAC,CAAC;QAC7C,IAAI,GAAW,CAAC;QAChB,IAAI,CAAC;YACH,GAAG,GAAG,MAAM,EAAE,CAAC,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC;QAC5C,CAAC;QAAC,OAAO,GAAG,EAAE,CAAC;YACb,uEAAuE;YACvE,mEAAmE;YACnE,mCAAmC;YACnC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC;gBACnB,OAAO,CAAC,IAAI,CAAC,mDAAmD,QAAQ,KAAK,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YAC9F,CAAC;YACD,OAAO,IAAI,CAAC;QACd,CAAC;QACD,MAAM,EAAE,GAAG,WAAW,CAAC,GAAG,CAAC,CAAC;QAC5B,MAAM,MAAM,GAAG,uBAAuB,CAAC,SAAS,CAAC,EAAE,CAAC,WAAW,CAAC,CAAC;QACjE,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC;YACpB,wEAAwE;YACxE,oDAAoD;YACpD,OAAO,CAAC,IAAI,CAAC,kEAAkE,QAAQ,EAAE,CAAC,CAAC;YAC3F,OAAO,IAAI,CAAC;QACd,CAAC;QACD,IAAI,UAAU,IAAI,MAAM,CAAC,IAAI,CAAC,IAAI,KAAK,UAAU;YAAE,OAAO,IAAI,CAAC;QAC/D,OAAO;YACL,WAAW,EAAE,MAAM,CAAC,IAAI;YACxB,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,EAAE;YACpB,IAAI,EAAE,QAAQ;SACO,CAAC;IAC1B,CAAC,CAAC;IACF,MAAM,MAAM,GAA8B,EAAE,CAAC;IAC7C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC,IAAI,gBAAgB,EAAE,CAAC;QAC7D,MAAM,KAAK,GAAG,UAAU,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,gBAAgB,CAAC,CAAC;QACxD,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;IAC1D,CAAC;IACD,OAAO,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAoB,EAAE,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC;AAC5D,CAAC;AAED,MAAM,CAAC,KAAK,UAAU,SAAS,CAAC,QAAgB;IAC9C,IAAI,CAAC;QACH,MAAM,GAAG,GAAG,MAAM,EAAE,CAAC,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC;QAChD,MAAM,MAAM,GAAG,WAAW,CAAC,GAAG,CAAC,CAAC;QAChC,MAAM,MAAM,GAAG,uBAAuB,CAAC,SAAS,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC;QACrE,IAAI,CAAC,MAAM,CAAC,OAAO;YAAE,OAAO,IAAI,CAAC;QACjC,OAAO,EAAE,WAAW,EAAE,MAAM,CAAC,IAAI,EAAE,IAAI,EAAE,MAAM,CAAC,IAAI,CAAC,IAAI,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE,CAAC;IAChF,CAAC;IAAC,OAAO,GAAG,EAAE,CAAC;QACb,IAAI,QAAQ,CAAC,GAAG,CAAC;YAAE,OAAO,IAAI,CAAC;QAC/B,MAAM,GAAG,CAAC;IACZ,CAAC;AACH,CAAC;AAMD,MAAM,CAAC,KAAK,UAAU,UAAU,CAC9B,GAAW,EACX,OAAgC;IAEhC,MAAM,KAAK,GAAG,CAAC,gBAAgB,EAAE,EAAE,CAAC,CAAC;IACrC,MAAM,MAAM,GAAG,IAAI,GAAG,EAA0B,CAAC;IACjD,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;QACxB,MAAM,IAAI,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,WAAW,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;QAClD,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACb,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,WAAW,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;IACvC,CAAC;IACD,KAAK,MAAM,CAAC,IAAI,CAAC,MAAM,EAAE,YAAY,EAAE,SAAS,EAAE,WAAW,CAAU,EAAE,CAAC;QACxE,MAAM,KAAK,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAC5B,IAAI,CAAC,KAAK,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;YAAE,SAAS;QAC3C,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QACtB,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,KAAK,CAAC,IAAI,CAAC,MAAM,IAAI,CAAC,WAAW,CAAC,IAAI,KAAK,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,IAAI,CAAC,WAAW,CAAC,WAAW,EAAE,CAAC,CAAC;QAC5G,CAAC;QACD,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACjB,CAAC;IACD,MAAM,eAAe,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE,WAAW,CAAC,EAAE,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;AACvE,CAAC"}

package/dist/store/search.d.ts

@@ -0,0 +1,10 @@
+import type { EmbeddingProvider, Mutex } from '@moxxy/sdk';
+import type { EmbeddingIndex } from '../embedding-cache.js';
+import type { MemoryEntry } from './types.js';
+export interface RankedMemory {
+    readonly entry: MemoryEntry;
+    readonly score: number;
+}
+export declare function recallVector(all: ReadonlyArray<MemoryEntry>, query: string, limit: number, embedder: EmbeddingProvider, index: EmbeddingIndex | null, mutex: Mutex): Promise<ReadonlyArray<RankedMemory>>;
+export declare function rankByKeywords(all: ReadonlyArray<MemoryEntry>, query: string, limit: number): ReadonlyArray<RankedMemory>;
+//# sourceMappingURL=search.d.ts.map

package/dist/store/search.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"search.d.ts","sourceRoot":"","sources":["../../src/store/search.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,iBAAiB,EAAE,KAAK,EAAE,MAAM,YAAY,CAAC;AAE3D,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,uBAAuB,CAAC;AAC5D,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,YAAY,CAAC;AAE9C,MAAM,WAAW,YAAY;IAC3B,QAAQ,CAAC,KAAK,EAAE,WAAW,CAAC;IAC5B,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;CACxB;AAED,wBAAsB,YAAY,CAChC,GAAG,EAAE,aAAa,CAAC,WAAW,CAAC,EAC/B,KAAK,EAAE,MAAM,EACb,KAAK,EAAE,MAAM,EACb,QAAQ,EAAE,iBAAiB,EAC3B,KAAK,EAAE,cAAc,GAAG,IAAI,EAC5B,KAAK,EAAE,KAAK,GACX,OAAO,CAAC,aAAa,CAAC,YAAY,CAAC,CAAC,CA4DtC;AAqBD,wBAAgB,cAAc,CAC5B,GAAG,EAAE,aAAa,CAAC,WAAW,CAAC,EAC/B,KAAK,EAAE,MAAM,EACb,KAAK,EAAE,MAAM,GACZ,aAAa,CAAC,YAAY,CAAC,CAO7B"}

package/dist/store/search.js

@@ -0,0 +1,160 @@
+import { TfIdfEmbedder, cosineSimilarity, tokenize } from '../tfidf.js';
+export async function recallVector(all, query, limit, embedder, index, mutex) {
+    const corpus = all.map((e) => entryForEmbedding(e));
+    // TF-IDF special-cases the persistent cache (vocab is corpus-wide).
+    if (embedder instanceof TfIdfEmbedder) {
+        embedder.fit([...corpus, query]);
+        return rankAllFresh(all, corpus, query, limit, embedder);
+    }
+    // Neural embedders: consult the persistent cache, only embed misses + query.
+    if (index) {
+        // The index load->lookup->set->prune->flush cycle mutates the shared
+        // on-disk cache, so it must run under the store's write mutex — otherwise
+        // two concurrent recalls (or a recall racing forget()'s rebuildIndex)
+        // read the same snapshot and clobber each other's writes. Only the cache
+        // bookkeeping is serialized; the pure cosine ranking stays outside.
+        const { vectors, queryVec } = await mutex.run(async () => {
+            await index.load();
+            const cached = [];
+            const misses = [];
+            for (let i = 0; i < all.length; i++) {
+                const hit = index.lookup(all[i].frontmatter.name, corpus[i]);
+                cached.push(hit);
+                if (!hit)
+                    misses.push({ index: i, text: corpus[i] });
+            }
+            const queryIdx = misses.length;
+            const toEmbed = [...misses.map((m) => m.text), query];
+            const fresh = await embedder.embed(toEmbed);
+            const qVec = fresh[queryIdx];
+            // Map each missed corpus index to its freshly-embedded vector so the
+            // stitch loop below stays O(1) per entry instead of scanning `misses`.
+            // A misbehaving embedder may under-return; only valid vectors get mapped,
+            // and missing ones stay absent so rankCosine drops them (never crashes).
+            const freshByEntryIndex = new Map();
+            for (const [j, m] of misses.entries()) {
+                const v = fresh[j];
+                if (Array.isArray(v))
+                    freshByEntryIndex.set(m.index, v);
+            }
+            // Stitch results: cached + freshly-embedded. Holes (undefined) survive to
+            // rankCosine, which skips them rather than throwing.
+            const vecs = [];
+            for (let i = 0; i < all.length; i++) {
+                vecs.push(cached[i] ?? freshByEntryIndex.get(i));
+            }
+            // Persist ONLY valid fresh vectors — never write an `undefined`/non-array
+            // vector to the on-disk cache, which would poison it permanently (every
+            // future recall would read back a corrupt entry).
+            for (const [j, m] of misses.entries()) {
+                const v = fresh[j];
+                if (Array.isArray(v))
+                    index.set(all[m.index].frontmatter.name, m.text, v);
+            }
+            index.prune(all.map((e) => e.frontmatter.name));
+            await index.flush();
+            return { vectors: vecs, queryVec: qVec };
+        });
+        return rankCosine(all, vectors, queryVec, limit);
+    }
+    // No cache configured — embed everything every time.
+    return rankAllFresh(all, corpus, query, limit, embedder);
+}
+// Embed `[...corpus, query]` in one batch, then cosine-rank the corpus against
+// the (last) query vector. Shared by the TF-IDF and no-cache branches.
+async function rankAllFresh(all, corpus, query, limit, embedder) {
+    const vectors = await embedder.embed([...corpus, query]);
+    // The query is embedded at index `corpus.length`. Address it by that fixed
+    // position (not `vectors.length - 1`): if the embedder under-returns and drops
+    // the query, `length - 1` would silently grab the last CORPUS vector and use
+    // it as the query. `vectors[corpus.length]` is `undefined` in that case, which
+    // rankCosine handles by returning an empty result — degrade, never mislead.
+    const queryVec = vectors[corpus.length];
+    return rankCosine(all, vectors.slice(0, all.length), queryVec, limit);
+}
+export function rankByKeywords(all, query, limit) {
+    const tokens = tokenize(query);
+    return all
+        .map((entry) => ({ entry, score: scoreEntry(entry, tokens) }))
+        .filter((r) => r.score > 0)
+        .sort((a, b) => b.score - a.score)
+        .slice(0, limit);
+}
+function rankCosine(entries, vectors, query, limit) {
+    // A misbehaving/hostile embedder can return fewer vectors than requested (or
+    // a non-array element) — the EmbeddingProvider.embed contract promises order
+    // but not count. Without this guard `query.length`/`vec.length` throws an
+    // opaque TypeError and recall crashes instead of degrading. A bad embedder
+    // must yield an empty/partial result set, never crash memory_recall.
+    if (!Array.isArray(query) || query.length === 0) {
+        console.warn('[plugin-memory] embedder returned no usable query vector; skipping vector recall');
+        return [];
+    }
+    const ranked = [];
+    for (let i = 0; i < entries.length; i++) {
+        const vec = vectors[i];
+        // cosineSimilarity silently truncates to the shorter vector, so a stale
+        // cached vector or a provider quirk of the wrong dimensionality would
+        // produce a plausible-but-wrong score (invisible corruption). A missing
+        // vector (embedder under-returned) is the same hazard. Skip the entry
+        // loudly instead of ranking it on a mismatched or absent basis.
+        if (!Array.isArray(vec) || vec.length !== query.length) {
+            console.warn(`[plugin-memory] skipping '${entries[i].frontmatter.name}' in recall: ` +
+                `vector dim ${Array.isArray(vec) ? vec.length : 'missing'} != query dim ${query.length} (cache/embedder drift)`);
+            continue;
+        }
+        const score = cosineSimilarity(vec, query);
+        if (score > 0)
+            ranked.push({ entry: entries[i], score });
+    }
+    ranked.sort((a, b) => b.score - a.score);
+    return ranked.slice(0, limit);
+}
+// Count non-overlapping occurrences of `needle` in `haystack` without
+// allocating the intermediate array `haystack.split(needle)` would build.
+// Identical result to `split(needle).length - 1` for the non-empty tokens
+// `tokenize` yields. Tokens are `[a-z0-9_-]+`, so there are no overlap or
+// empty-needle edge cases to worry about.
+function countOccurrences(haystack, needle) {
+    let n = 0;
+    let i = haystack.indexOf(needle);
+    while (i !== -1) {
+        n += 1;
+        i = haystack.indexOf(needle, i + needle.length);
+    }
+    return n;
+}
+function entryForEmbedding(entry) {
+    return [
+        entry.frontmatter.name,
+        entry.frontmatter.description,
+        (entry.frontmatter.tags ?? []).join(' '),
+        entry.body,
+    ].join('\n');
+}
+function scoreEntry(entry, tokens) {
+    if (tokens.length === 0)
+        return 1;
+    const haystack = (entry.frontmatter.name +
+        ' ' +
+        entry.frontmatter.description +
+        ' ' +
+        (entry.frontmatter.tags ?? []).join(' ') +
+        ' ' +
+        entry.body).toLowerCase();
+    let score = 0;
+    for (const t of tokens) {
+        if (!t)
+            continue;
+        const matches = countOccurrences(haystack, t);
+        if (matches > 0) {
+            score += matches;
+            if (entry.frontmatter.name.toLowerCase().includes(t))
+                score += 3;
+            if (entry.frontmatter.description.toLowerCase().includes(t))
+                score += 2;
+        }
+    }
+    return score;
+}
+//# sourceMappingURL=search.js.map

package/dist/store/search.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"search.js","sourceRoot":"","sources":["../../src/store/search.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,aAAa,EAAE,gBAAgB,EAAE,QAAQ,EAAE,MAAM,aAAa,CAAC;AASxE,MAAM,CAAC,KAAK,UAAU,YAAY,CAChC,GAA+B,EAC/B,KAAa,EACb,KAAa,EACb,QAA2B,EAC3B,KAA4B,EAC5B,KAAY;IAEZ,MAAM,MAAM,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,iBAAiB,CAAC,CAAC,CAAC,CAAC,CAAC;IAEpD,oEAAoE;IACpE,IAAI,QAAQ,YAAY,aAAa,EAAE,CAAC;QACtC,QAAQ,CAAC,GAAG,CAAC,CAAC,GAAG,MAAM,EAAE,KAAK,CAAC,CAAC,CAAC;QACjC,OAAO,YAAY,CAAC,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,QAAQ,CAAC,CAAC;IAC3D,CAAC;IAED,6EAA6E;IAC7E,IAAI,KAAK,EAAE,CAAC;QACV,qEAAqE;QACrE,0EAA0E;QAC1E,sEAAsE;QACtE,yEAAyE;QACzE,oEAAoE;QACpE,MAAM,EAAE,OAAO,EAAE,QAAQ,EAAE,GAAG,MAAM,KAAK,CAAC,GAAG,CAAC,KAAK,IAAI,EAAE;YACvD,MAAM,KAAK,CAAC,IAAI,EAAE,CAAC;YACnB,MAAM,MAAM,GAAwC,EAAE,CAAC;YACvD,MAAM,MAAM,GAAsC,EAAE,CAAC;YACrD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACpC,MAAM,GAAG,GAAG,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC,WAAW,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC,CAAE,CAAC,CAAC;gBAC/D,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;gBACjB,IAAI,CAAC,GAAG;oBAAE,MAAM,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,CAAC,CAAC,CAAE,EAAE,CAAC,CAAC;YACxD,CAAC;YACD,MAAM,QAAQ,GAAG,MAAM,CAAC,MAAM,CAAC;YAC/B,MAAM,OAAO,GAAG,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,KAAK,CAAC,CAAC;YACtD,MAAM,KAAK,GAAG,MAAM,QAAQ,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;YAC5C,MAAM,IAAI,GAAG,KAAK,CAAC,QAAQ,CAAC,CAAC;YAC7B,qEAAqE;YACrE,uEAAuE;YACvE,0EAA0E;YAC1E,yEAAyE;YACzE,MAAM,iBAAiB,GAAG,IAAI,GAAG,EAAiC,CAAC;YACnE,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,MAAM,CAAC,OAAO,EAAE,EAAE,CAAC;gBACtC,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;gBACnB,IAAI,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC;oBAAE,iBAAiB,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;YAC1D,CAAC;YACD,0EAA0E;YAC1E,qDAAqD;YACrD,MAAM,IAAI,GAA6C,EAAE,CAAC;YAC1D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACpC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,iBAAiB,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YACnD,CAAC;YACD,0EAA0E;YAC1E,wEAAwE;YACxE,kDAAkD;YAClD,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,MAAM,CAAC,OAAO,EAAE,EAAE,CAAC;gBACtC,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;gBACnB,IAAI,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC;oBAAE,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAE,CAAC,WAAW,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;YAC7E,CAAC;YACD,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC;YAChD,MAAM,KAAK,CAAC,KAAK,EAAE,CAAC;YACpB,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,CAAC;QAC3C,CAAC,CAAC,CAAC;QACH,OAAO,UAAU,CAAC,GAAG,EAAE,OAAO,EAAE,QAAQ,EAAE,KAAK,CAAC,CAAC;IACnD,CAAC;IAED,qDAAqD;IACrD,OAAO,YAAY,CAAC,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,QAAQ,CAAC,CAAC;AAC3D,CAAC;AAED,+EAA+E;AAC/E,uEAAuE;AACvE,KAAK,UAAU,YAAY,CACzB,GAA+B,EAC/B,MAA6B,EAC7B,KAAa,EACb,KAAa,EACb,QAA2B;IAE3B,MAAM,OAAO,GAAG,MAAM,QAAQ,CAAC,KAAK,CAAC,CAAC,GAAG,MAAM,EAAE,KAAK,CAAC,CAAC,CAAC;IACzD,2EAA2E;IAC3E,+EAA+E;IAC/E,6EAA6E;IAC7E,+EAA+E;IAC/E,4EAA4E;IAC5E,MAAM,QAAQ,GAAG,OAAO,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;IACxC,OAAO,UAAU,CAAC,GAAG,EAAE,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,MAAM,CAAC,EAAE,QAAQ,EAAE,KAAK,CAAC,CAAC;AACxE,CAAC;AAED,MAAM,UAAU,cAAc,CAC5B,GAA+B,EAC/B,KAAa,EACb,KAAa;IAEb,MAAM,MAAM,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC;IAC/B,OAAO,GAAG;SACP,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,UAAU,CAAC,KAAK,EAAE,MAAM,CAAC,EAAE,CAAC,CAAC;SAC7D,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC;SAC1B,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC;SACjC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;AACrB,CAAC;AAED,SAAS,UAAU,CACjB,OAAmC,EACnC,OAAyD,EACzD,KAAwC,EACxC,KAAa;IAEb,6EAA6E;IAC7E,6EAA6E;IAC7E,0EAA0E;IAC1E,2EAA2E;IAC3E,qEAAqE;IACrE,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAChD,OAAO,CAAC,IAAI,CACV,kFAAkF,CACnF,CAAC;QACF,OAAO,EAAE,CAAC;IACZ,CAAC;IACD,MAAM,MAAM,GAAmB,EAAE,CAAC;IAClC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACxC,MAAM,GAAG,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;QACvB,wEAAwE;QACxE,sEAAsE;QACtE,wEAAwE;QACxE,sEAAsE;QACtE,gEAAgE;QAChE,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,GAAG,CAAC,MAAM,KAAK,KAAK,CAAC,MAAM,EAAE,CAAC;YACvD,OAAO,CAAC,IAAI,CACV,6BAA6B,OAAO,CAAC,CAAC,CAAE,CAAC,WAAW,CAAC,IAAI,eAAe;gBACtE,cAAc,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,SAAS,iBAAiB,KAAK,CAAC,MAAM,yBAAyB,CAClH,CAAC;YACF,SAAS;QACX,CAAC;QACD,MAAM,KAAK,GAAG,gBAAgB,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;QAC3C,IAAI,KAAK,GAAG,CAAC;YAAE,MAAM,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC,CAAE,EAAE,KAAK,EAAE,CAAC,CAAC;IAC5D,CAAC;IACD,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;IACzC,OAAO,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;AAChC,CAAC;AAED,sEAAsE;AACtE,0EAA0E;AAC1E,0EAA0E;AAC1E,0EAA0E;AAC1E,0CAA0C;AAC1C,SAAS,gBAAgB,CAAC,QAAgB,EAAE,MAAc;IACxD,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,IAAI,CAAC,GAAG,QAAQ,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;IACjC,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC;QAChB,CAAC,IAAI,CAAC,CAAC;QACP,CAAC,GAAG,QAAQ,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC;IAClD,CAAC;IACD,OAAO,CAAC,CAAC;AACX,CAAC;AAED,SAAS,iBAAiB,CAAC,KAAkB;IAC3C,OAAO;QACL,KAAK,CAAC,WAAW,CAAC,IAAI;QACtB,KAAK,CAAC,WAAW,CAAC,WAAW;QAC7B,CAAC,KAAK,CAAC,WAAW,CAAC,IAAI,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC;QACxC,KAAK,CAAC,IAAI;KACX,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AACf,CAAC;AAED,SAAS,UAAU,CAAC,KAAkB,EAAE,MAA6B;IACnE,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IAClC,MAAM,QAAQ,GAAG,CACf,KAAK,CAAC,WAAW,CAAC,IAAI;QACtB,GAAG;QACH,KAAK,CAAC,WAAW,CAAC,WAAW;QAC7B,GAAG;QACH,CAAC,KAAK,CAAC,WAAW,CAAC,IAAI,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC;QACxC,GAAG;QACH,KAAK,CAAC,IAAI,CACX,CAAC,WAAW,EAAE,CAAC;IAChB,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;QACvB,IAAI,CAAC,CAAC;YAAE,SAAS;QACjB,MAAM,OAAO,GAAG,gBAAgB,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC;QAC9C,IAAI,OAAO,GAAG,CAAC,EAAE,CAAC;YAChB,KAAK,IAAI,OAAO,CAAC;YACjB,IAAI,KAAK,CAAC,WAAW,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC;gBAAE,KAAK,IAAI,CAAC,CAAC;YACjE,IAAI,KAAK,CAAC,WAAW,CAAC,WAAW,CAAC,WAAW,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC;gBAAE,KAAK,IAAI,CAAC,CAAC;QAC1E,CAAC;IACH,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC"}

package/dist/store/types.d.ts

@@ -0,0 +1,33 @@
+import { z } from 'zod';
+export declare const memoryTypeSchema: z.ZodEnum<["fact", "preference", "project", "reference"]>;
+export type MemoryType = z.infer<typeof memoryTypeSchema>;
+export declare const memoryFrontmatterSchema: z.ZodObject<{
+    name: z.ZodString;
+    type: z.ZodEnum<["fact", "preference", "project", "reference"]>;
+    description: z.ZodString;
+    tags: z.ZodOptional<z.ZodArray<z.ZodString, "many">>;
+    createdAt: z.ZodOptional<z.ZodString>;
+    updatedAt: z.ZodOptional<z.ZodString>;
+}, "strip", z.ZodTypeAny, {
+    name: string;
+    type: "fact" | "preference" | "project" | "reference";
+    description: string;
+    tags?: string[] | undefined;
+    createdAt?: string | undefined;
+    updatedAt?: string | undefined;
+}, {
+    name: string;
+    type: "fact" | "preference" | "project" | "reference";
+    description: string;
+    tags?: string[] | undefined;
+    createdAt?: string | undefined;
+    updatedAt?: string | undefined;
+}>;
+export type MemoryFrontmatter = z.infer<typeof memoryFrontmatterSchema>;
+export interface MemoryEntry {
+    readonly frontmatter: MemoryFrontmatter;
+    readonly body: string;
+    readonly path: string;
+}
+export type RecallMode = 'auto' | 'vector' | 'keyword';
+//# sourceMappingURL=types.d.ts.map

package/dist/store/types.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../../src/store/types.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,CAAC,EAAE,MAAM,KAAK,CAAC;AAExB,eAAO,MAAM,gBAAgB,2DAAyD,CAAC;AACvF,MAAM,MAAM,UAAU,GAAG,CAAC,CAAC,KAAK,CAAC,OAAO,gBAAgB,CAAC,CAAC;AAE1D,eAAO,MAAM,uBAAuB;;;;;;;;;;;;;;;;;;;;;EAOlC,CAAC;AAEH,MAAM,MAAM,iBAAiB,GAAG,CAAC,CAAC,KAAK,CAAC,OAAO,uBAAuB,CAAC,CAAC;AAExE,MAAM,WAAW,WAAW;IAC1B,QAAQ,CAAC,WAAW,EAAE,iBAAiB,CAAC;IACxC,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;CACvB;AAED,MAAM,MAAM,UAAU,GAAG,MAAM,GAAG,QAAQ,GAAG,SAAS,CAAC"}

package/dist/store/types.js

@@ -0,0 +1,11 @@
+import { z } from 'zod';
+export const memoryTypeSchema = z.enum(['fact', 'preference', 'project', 'reference']);
+export const memoryFrontmatterSchema = z.object({
+    name: z.string().min(1).max(120).regex(/^[a-z0-9][a-z0-9-]*$/, 'name must be slug-like'),
+    type: memoryTypeSchema,
+    description: z.string().min(1).max(280),
+    tags: z.array(z.string().min(1)).optional(),
+    createdAt: z.string().optional(),
+    updatedAt: z.string().optional(),
+});
+//# sourceMappingURL=types.js.map

package/dist/store/types.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.js","sourceRoot":"","sources":["../../src/store/types.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,CAAC,EAAE,MAAM,KAAK,CAAC;AAExB,MAAM,CAAC,MAAM,gBAAgB,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE,YAAY,EAAE,SAAS,EAAE,WAAW,CAAC,CAAC,CAAC;AAGvF,MAAM,CAAC,MAAM,uBAAuB,GAAG,CAAC,CAAC,MAAM,CAAC;IAC9C,IAAI,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,sBAAsB,EAAE,wBAAwB,CAAC;IACxF,IAAI,EAAE,gBAAgB;IACtB,WAAW,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC;IACvC,IAAI,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,EAAE;IAC3C,SAAS,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,EAAE;IAChC,SAAS,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,EAAE;CACjC,CAAC,CAAC"}

package/dist/store.d.ts

@@ -0,0 +1,95 @@
+import { type EmbeddingProvider } from '@moxxy/sdk';
+import { type MemoryEntry, type MemoryFrontmatter, type MemoryType, type RecallMode } from './store/types.js';
+import { type RankedMemory } from './store/search.js';
+export { memoryTypeSchema, memoryFrontmatterSchema, type MemoryEntry, type MemoryFrontmatter, type MemoryType, type RecallMode, } from './store/types.js';
+export type { RankedMemory } from './store/search.js';
+export interface MemoryStoreOptions {
+    readonly dir?: string;
+    /**
+     * Optional embedding provider. When supplied, `recall()` uses cosine
+     * similarity over dense vectors. When omitted, the built-in TF-IDF
+     * embedder is used. Pass `embedder: null` to force keyword-only recall.
+     *
+     * May also be a lazy resolver `() => EmbeddingProvider | null`, resolved once
+     * on first recall — so the host can wire the registry-selected embedder
+     * (`() => session.embedders.tryGetActive()`) that isn't known until plugins
+     * have loaded, without forcing the store to be built after the session.
+     */
+    readonly embedder?: EmbeddingProvider | null | (() => EmbeddingProvider | null);
+    /**
+     * Cache computed embeddings on disk (`<dir>/.embeddings.json`) so unchanged
+     * memories aren't re-embedded on every recall. Defaults to true for all
+     * embedders EXCEPT TF-IDF (which derives vocab from the whole corpus, so
+     * per-entry caching doesn't help).
+     */
+    readonly persistEmbeddings?: boolean;
+    /**
+     * Soft cap on the number of stored memories. WARN-ONLY by design: memories
+     * are deliberately-saved user knowledge consumed both via `recall` and via
+     * the MEMORY.md index agents read directly, so silent oldest-eviction would
+     * be silent data loss. When a save pushes the store past this cap, the save
+     * still succeeds but a warning is logged and surfaced through
+     * {@link MemoryStore.capStatus} (the `memory_save` tool relays it to the
+     * model so it can consolidate or `memory_forget` stale entries).
+     */
+    readonly maxMemories?: number;
+}
+/** Default soft cap — see {@link MemoryStoreOptions.maxMemories}. */
+export declare const DEFAULT_MAX_MEMORIES = 500;
+export declare function defaultMemoryDir(): string;
+export declare class MemoryStore {
+    readonly dir: string;
+    private readonly resolveEmbedder;
+    private readonly persistOpt;
+    private embedderCache;
+    private indexCache;
+    private readonly mutex;
+    private readonly maxMemories;
+    private indexRows;
+    constructor(opts?: MemoryStoreOptions);
+    private getEmbedder;
+    private getIndex;
+    get embedderName(): string;
+    list(filterType?: MemoryType): Promise<ReadonlyArray<MemoryEntry>>;
+    get(name: string): Promise<MemoryEntry | null>;
+    save(input: Omit<MemoryFrontmatter, 'createdAt' | 'updatedAt'> & {
+        body: string;
+    }): Promise<MemoryEntry>;
+    update(name: string, patch: {
+        body?: string;
+        description?: string;
+        tags?: ReadonlyArray<string>;
+    }): Promise<MemoryEntry | null>;
+    forget(name: string): Promise<boolean>;
+    /**
+     * Soft-cap status (see {@link MemoryStoreOptions.maxMemories}). `over` means
+     * the store holds more entries than the cap; nothing is ever evicted.
+     */
+    capStatus(): Promise<{
+        count: number;
+        max: number;
+        over: boolean;
+    }>;
+    /** The actual entry write. NOT serialized — callers hold the mutex. */
+    private writeEntry;
+    /**
+     * Search memories by a free-text query. Uses vector cosine similarity when
+     * an EmbeddingProvider is configured (the default is the built-in TF-IDF
+     * embedder); falls back to keyword scoring when `mode: 'keyword'` or when
+     * no embedder is wired.
+     */
+    recall(query: string, opts?: {
+        limit?: number;
+        type?: MemoryType;
+        mode?: RecallMode;
+    }): Promise<ReadonlyArray<RankedMemory>>;
+    private fileFor;
+    /** Hydrate the index-row cache from disk once, then serve it from memory.
+     *  Callers that mutate it hold the store mutex (writeEntry/forget). */
+    private rows;
+    /** Render MEMORY.md from the cached rows, name-sorted so the output is
+     *  deterministic (readdir order, which the old full rebuild inherited,
+     *  was platform-dependent anyway). */
+    private writeIndexFromRows;
+}
+//# sourceMappingURL=store.d.ts.map

package/dist/store.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"store.d.ts","sourceRoot":"","sources":["../src/store.ts"],"names":[],"mappings":"AAEA,OAAO,EAAe,KAAK,iBAAiB,EAAc,MAAM,YAAY,CAAC;AAK7E,OAAO,EAEL,KAAK,WAAW,EAChB,KAAK,iBAAiB,EACtB,KAAK,UAAU,EACf,KAAK,UAAU,EAChB,MAAM,kBAAkB,CAAC;AAE1B,OAAO,EAAgC,KAAK,YAAY,EAAE,MAAM,mBAAmB,CAAC;AAEpF,OAAO,EACL,gBAAgB,EAChB,uBAAuB,EACvB,KAAK,WAAW,EAChB,KAAK,iBAAiB,EACtB,KAAK,UAAU,EACf,KAAK,UAAU,GAChB,MAAM,kBAAkB,CAAC;AAC1B,YAAY,EAAE,YAAY,EAAE,MAAM,mBAAmB,CAAC;AAEtD,MAAM,WAAW,kBAAkB;IACjC,QAAQ,CAAC,GAAG,CAAC,EAAE,MAAM,CAAC;IACtB;;;;;;;;;OASG;IACH,QAAQ,CAAC,QAAQ,CAAC,EAAE,iBAAiB,GAAG,IAAI,GAAG,CAAC,MAAM,iBAAiB,GAAG,IAAI,CAAC,CAAC;IAChF;;;;;OAKG;IACH,QAAQ,CAAC,iBAAiB,CAAC,EAAE,OAAO,CAAC;IACrC;;;;;;;;OAQG;IACH,QAAQ,CAAC,WAAW,CAAC,EAAE,MAAM,CAAC;CAC/B;AAED,qEAAqE;AACrE,eAAO,MAAM,oBAAoB,MAAM,CAAC;AAExC,wBAAgB,gBAAgB,IAAI,MAAM,CAEzC;AAED,qBAAa,WAAW;IACtB,QAAQ,CAAC,GAAG,EAAE,MAAM,CAAC;IACrB,OAAO,CAAC,QAAQ,CAAC,eAAe,CAAiC;IACjE,OAAO,CAAC,QAAQ,CAAC,UAAU,CAAsB;IAIjD,OAAO,CAAC,aAAa,CAAuC;IAC5D,OAAO,CAAC,UAAU,CAAoC;IAItD,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAwB;IAC9C,OAAO,CAAC,QAAQ,CAAC,WAAW,CAAS;IAQrC,OAAO,CAAC,SAAS,CAAsC;gBAE3C,IAAI,GAAE,kBAAuB;IAiBzC,OAAO,CAAC,WAAW;IAKnB,OAAO,CAAC,QAAQ;IAahB,IAAI,YAAY,IAAI,MAAM,CAEzB;IAED,IAAI,CAAC,UAAU,CAAC,EAAE,UAAU,GAAG,OAAO,CAAC,aAAa,CAAC,WAAW,CAAC,CAAC;IAIlE,GAAG,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO,CAAC,WAAW,GAAG,IAAI,CAAC;IAa9C,IAAI,CACF,KAAK,EAAE,IAAI,CAAC,iBAAiB,EAAE,WAAW,GAAG,WAAW,CAAC,GAAG;QAAE,IAAI,EAAE,MAAM,CAAA;KAAE,GAC3E,OAAO,CAAC,WAAW,CAAC;IAIvB,MAAM,CACJ,IAAI,EAAE,MAAM,EACZ,KAAK,EAAE;QAAE,IAAI,CAAC,EAAE,MAAM,CAAC;QAAC,WAAW,CAAC,EAAE,MAAM,CAAC;QAAC,IAAI,CAAC,EAAE,aAAa,CAAC,MAAM,CAAC,CAAA;KAAE,GAC3E,OAAO,CAAC,WAAW,GAAG,IAAI,CAAC;IAiB9B,MAAM,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO,CAAC,OAAO,CAAC;IAgBtC;;;OAGG;IACG,SAAS,IAAI,OAAO,CAAC;QAAE,KAAK,EAAE,MAAM,CAAC;QAAC,GAAG,EAAE,MAAM,CAAC;QAAC,IAAI,EAAE,OAAO,CAAA;KAAE,CAAC;IAQzE,uEAAuE;YACzD,UAAU;IAiCxB;;;;;OAKG;IACG,MAAM,CACV,KAAK,EAAE,MAAM,EACb,IAAI,GAAE;QAAE,KAAK,CAAC,EAAE,MAAM,CAAC;QAAC,IAAI,CAAC,EAAE,UAAU,CAAC;QAAC,IAAI,CAAC,EAAE,UAAU,CAAA;KAAO,GAClE,OAAO,CAAC,aAAa,CAAC,YAAY,CAAC,CAAC;IAcvC,OAAO,CAAC,OAAO;IAcf;2EACuE;YACzD,IAAI;IAUlB;;0CAEsC;IACtC,OAAO,CAAC,kBAAkB;CAM3B"}