@fgv/ts-agent-memory 5.1.0-49 → 5.1.0-50

package/lib/packlets/store/fileTreeMemoryStore.js

@@ -10,8 +10,12 @@ const ts_json_base_1 = require("@fgv/ts-json-base");
 const types_1 = require("../types");
 const converters_1 = require("../converters");
 const vectorMaintenance_1 = require("./vectorMaintenance");
+const storeCoverage_1 = require("./storeCoverage");
+const storeReconcile_1 = require("./storeReconcile");
 const index_1 = require("../index");
 const scopeEncoding_1 = require("./scopeEncoding");
+const listSelection_1 = require("./listSelection");
+const vectorRecordSource_1 = require("./vectorRecordSource");
 /** The on-disk extension for a memory record file. */
 const MEMORY_FILE_EXTENSION = '.md';
 /**
@@ -127,7 +131,7 @@ class FileTreeMemoryStore {
                 // version whose `invalid_at` is null/absent) from the entity subtree,
                 // read off the derived index. `asOf` resolution is via `list({ asOf })`
                 // and the temporal retrievers.
-                return (0, ts_utils_1.succeed)(this._readVersionedCurrent(addr.scope));
+                return this._readVersionedCurrent(addr.scope);
             }
             return this._readRecord(addr.scope, addr.idStem);
         }));
@@ -143,50 +147,130 @@ class FileTreeMemoryStore {
         return this._readRecord(scope, id);
     }
     /** {@inheritDoc IMemoryStore.list} */
-    async list(filter) {
-        const matches = this._index
-            .entries()
-            .filter((entry) => {
-            if ((filter === null || filter === void 0 ? void 0 : filter.scope) !== undefined && entry.scope !== filter.scope) {
+    async list(selection) {
+        // Deliberately NOT annotated `: boolean`. An explicit annotation discards the
+        // type predicate, and TypeScript's aliased-condition narrowing is what lets
+        // the ternary below see `selection` as a filter on the false branch. With the
+        // annotation this line compiles and the next one does not.
+        const scan = (0, listSelection_1.isWholeVaultScan)(selection);
+        const filter = scan ? {} : selection;
+        if (!scan && filter.scope === undefined && filter.kind === undefined && filter.tag === undefined) {
+            // `asOf` alone does not narrow — it collapses versions, it does not exclude
+            // entities — so a selection carrying only `asOf` lands here too.
+            return (0, ts_utils_1.fail)('memory list: a selection must narrow by scope, kind or tag; ' +
+                'pass scanEveryRecord() to read every record in the vault deliberately');
+        }
+        // Select over envelopes, project temporally, and materialize LAST — so a
+        // narrowed list reads only the files it is going to return.
+        const selected = this._index.entries().filter((entry) => {
+            if (filter.scope !== undefined && entry.scope !== filter.scope) {
                 return false;
             }
-            if ((filter === null || filter === void 0 ? void 0 : filter.kind) !== undefined && entry.record.envelope.kind !== filter.kind) {
+            if (filter.kind !== undefined && entry.envelope.kind !== filter.kind) {
                 return false;
             }
-            if ((filter === null || filter === void 0 ? void 0 : filter.tag) !== undefined && !entry.record.envelope.tags.includes(filter.tag)) {
+            if (filter.tag !== undefined && !entry.envelope.tags.includes(filter.tag)) {
                 return false;
             }
             return true;
-        })
-            .map((entry) => entry.record);
-        if ((filter === null || filter === void 0 ? void 0 : filter.asOf) === undefined) {
-            // No temporal projection requested: byte-identical to the pre-temporal
-            // behavior (the flat-path guarantee — every version is returned).
-            return (0, ts_utils_1.succeed)(matches);
-        }
-        return (0, ts_utils_1.succeed)(FileTreeMemoryStore._projectAsOf(matches, filter.asOf));
+        });
+        const projected = selection.asOf === undefined
+            ? // No temporal projection requested: the flat-path guarantee — every
+                // version is returned.
+                selected
+            : FileTreeMemoryStore._projectAsOf(selected, selection.asOf);
+        return this._materialize(projected);
+    }
+    /** {@inheritDoc IMemoryStore.coverage} */
+    coverage() {
+        return Promise.resolve((0, storeCoverage_1.computeCoverage)({
+            entries: this._index.entries(),
+            hasRankProjector: (kind) => this._rankProjectors.has(kind),
+            anyRankProjector: this._rankProjectors.size > 0,
+            embedsKind: (kind) => this.embedsKind(kind),
+            vectorIndex: this._vectors.vectorIndex,
+            fragmentIndex: this._vectors.fragmentIndex
+        }));
+    }
+    /** {@inheritDoc IMemoryStore.listEntries} */
+    async listEntries() {
+        return (0, ts_utils_1.succeed)(this._index.entries());
     }
     /** {@inheritDoc IMemoryStore.listScoped} */
     async listScoped() {
-        // The derived index already carries each record's scope
-        // ({@link IIndexedMemoryRecord.scope}), so the scoped projection is a direct
-        // map — the record's `(scope, id)` is exactly the address the vector index
-        // keys on. No filter/temporal projection: the seam re-embeds the whole vault.
-        return (0, ts_utils_1.succeed)(this._index.entries().map((entry) => ({
-            target: { scope: entry.scope, id: entry.record.envelope.id },
-            record: entry.record
-        })));
+        // The derived index already carries each record's scope, so the scoped
+        // projection keys straight off it — `(scope, id)` is exactly the address the
+        // vector index uses. Bodies ARE materialized here: this seam feeds an
+        // embedder, which is the one consumer that genuinely needs every body. No
+        // filter/temporal projection — it re-embeds the whole vault by contract.
+        //
+        // **Complete or failed — never quietly short.** This call is the sole feed
+        // for `asRecordSource()`, and therefore for `IVectorIndex.rebuild`'s coverage
+        // report. A record dropped here would land in none of `records` / `excluded`
+        // / `indexed` / `declined` / `skipped`, so a caller computing coverage would
+        // undercount *in the direction of looking healthier* — which is precisely the
+        // failure `vectorRecordSource`'s own tally exists to prevent, reintroduced one
+        // layer down. A loud failure is recoverable; a silent undercount is not.
+        //
+        // Two consequences worth stating rather than discovering. Before the index
+        // was projected this method read nothing and could not fail, because the
+        // index held the records themselves; it now costs a full-vault read and is
+        // fallible. And it is NOT write-locked, so a concurrent `put` whose cap-cull
+        // physically evicts a record between the snapshot and the read will fail it.
+        // That window is real and is tracked in `docs/FUTURE.md` — the answer is to
+        // make the loss *countable*, not to swallow it.
+        return (0, ts_utils_1.mapResults)(this._index.entries().map((entry) => {
+            const target = { scope: entry.scope, id: entry.envelope.id };
+            return this._resolveRequired(entry).onSuccess((record) => (0, ts_utils_1.succeed)({ target, record }));
+        }));
+    }
+    /** {@inheritDoc IMemoryRecordResolver.resolveRecord} */
+    resolveRecord(scope, id) {
+        return this._readRecord(scope, id);
+    }
+    /**
+     * Materialize a selected set of entries into records, dropping any that have
+     * vanished since selection.
+     *
+     * @remarks
+     * A miss is not a failure. Selection reads the in-memory index and
+     * materialization reads storage, so a record deleted in between is a legitimate
+     * race and yields a shorter list rather than an error. A read that FAILS is a
+     * real fault and propagates.
+     */
+    _materialize(entries) {
+        return (0, ts_utils_1.mapResults)(entries.map((entry) => this._readRecord(entry.scope, entry.envelope.id))).onSuccess((records) => (0, ts_utils_1.succeed)(records.filter((r) => r !== undefined)));
+    }
+    /**
+     * Materialize one entry, treating "gone" as a fault rather than a miss.
+     *
+     * @remarks
+     * For paths where a vanished record really does mean the index and the vault
+     * disagree, rather than that something legitimately removed it in between.
+     *
+     * Three of the four callers hold the write lock, so nothing can have removed
+     * the record since the entry was read. `get()`'s versioned path does not, and
+     * is safe only because temporal kinds never physically delete a version — they
+     * invalidate in place, and cap-cull does not apply to them. **If eviction is
+     * ever added to the temporal path, that caller must change**, or it
+     * reintroduces the race this method exists to detect.
+     *
+     * `listScoped` also does not hold the lock, and uses this deliberately anyway:
+     * it feeds a coverage report, so a silent drop there is worse than a loud
+     * failure. See its comment, and `docs/FUTURE.md` for the eviction window.
+     *
+     * The drop-tolerant counterpart is {@link FileTreeMemoryStore._materialize},
+     * for readers where a record that vanished between selection and
+     * materialization is a miss rather than a fault.
+     */
+    _resolveRequired(entry) {
+        return this._readRecord(entry.scope, entry.envelope.id).onSuccess((record) => record === undefined
+            ? (0, ts_utils_1.fail)(`memory: index entry '${entry.scope}/${entry.envelope.id}' has no record in the vault`)
+            : (0, ts_utils_1.succeed)(record));
     }
     /** {@inheritDoc IMemoryStore.asRecordSource} */
     asRecordSource() {
-        return {
-            // Filtered to the kinds that participate in the record vector index. This
-            // source exists to drive `IVectorIndex` rebuilds, so a kind excluded from the
-            // index has no business being re-embedded on open — which is where the cost
-            // is worst, since a rebuild embeds the whole vault serially. With no
-            // `embedKinds` declaration every kind passes and this is the identity filter.
-            list: async () => (await this.listScoped()).onSuccess((scoped) => (0, ts_utils_1.succeed)(scoped.filter((s) => this.embedsKind(s.record.envelope.kind))))
-        };
+        return (0, vectorRecordSource_1.vectorRecordSource)(this);
     }
     /**
      * Collapse temporal records to the single version valid at `asOf` per entity;
@@ -195,21 +279,21 @@ class FileTreeMemoryStore {
      * filtering is deferred — OQ-9). An entity with no version valid at `asOf`
      * contributes nothing.
      */
-    static _projectAsOf(records, asOf) {
+    static _projectAsOf(entries, asOf) {
         const passthrough = [];
         const groups = new Map();
-        for (const record of records) {
-            if (!(0, types_1.isTemporalRecord)(record)) {
-                passthrough.push(record);
+        for (const entry of entries) {
+            if (!(0, types_1.isTemporalRecord)(entry)) {
+                passthrough.push(entry);
                 continue;
             }
-            const key = `${record.envelope.kind}\0${record.envelope.entityId}`;
+            const key = `${entry.envelope.kind}\0${entry.envelope.entityId}`;
             const existing = groups.get(key);
             if (existing === undefined) {
-                groups.set(key, [record]);
+                groups.set(key, [entry]);
             }
             else {
-                existing.push(record);
+                existing.push(entry);
             }
         }
         const result = [...passthrough];
@@ -221,9 +305,9 @@ class FileTreeMemoryStore {
         }
         return result;
     }
-    /** {@inheritDoc IMemoryStore.reconcileRank} */
-    async reconcileRank(kind) {
-        return this._enqueue(() => this._reconcileRankLocked(kind));
+    /** {@inheritDoc IMemoryStore.reconcile} */
+    async reconcile(kind, artifact) {
+        return this._enqueue(() => this._reconcileLocked(kind, artifact));
     }
     /** {@inheritDoc IMemoryStore.put} */
     async put(record) {
@@ -394,8 +478,11 @@ class FileTreeMemoryStore {
             // mutableFields) actually applies. Content-dedup must never shadow LWW for
             // the same entity.
             const duplicate = this._findByContentHash(scope, hash, record.envelope.id);
-            if (duplicate !== undefined) {
-                return (0, ts_utils_1.succeed)({ record: duplicate, evicted: [] });
+            if (duplicate.isFailure()) {
+                return (0, ts_utils_1.fail)(duplicate.message);
+            }
+            if (duplicate.value !== undefined) {
+                return (0, ts_utils_1.succeed)({ record: duplicate.value, evicted: [] });
             }
         }
         return this._readRecord(scope, idStem).thenOnSuccess((existing) => {
@@ -416,9 +503,8 @@ class FileTreeMemoryStore {
             // (a replace, not a grow). The same-id `existing` record is threaded
             // separately into `_buildRecord` for the merge-patch. Knowledge LWW ignores
             // this argument, so its behavior is unchanged by the wider cohort.
-            const cohort = this._admissionCohort(scope, record.envelope.kind, idStem);
-            return policy
-                .admit(record, cohort)
+            return this._admissionCohort(scope, record.envelope.kind, idStem)
+                .onSuccess((cohort) => policy.admit(record, cohort))
                 .thenOnSuccess((decision) => this._admitWrite(record, body, scope, idStem, hash, policy, existing, decision));
         });
     }
@@ -568,7 +654,16 @@ class FileTreeMemoryStore {
      * written, or fully invalidated / soft-deleted).
      */
     _readVersionedCurrent(scope) {
-        return (0, types_1.selectCurrentVersion)(this._versionsForEntity(scope));
+        // Select over ENVELOPES, then materialize the one winner — which is what
+        // `IMemoryStore.get`'s docstring promises and what `selectCurrentVersion`
+        // being generic over `IEnvelopeCarrier` exists for. Materializing every
+        // version first (as this did) cost N file reads and N body validations to
+        // return one record, and made that docstring false.
+        const current = (0, types_1.selectCurrentVersion)(this._index.entries().filter((entry) => entry.scope === scope));
+        if (current === undefined) {
+            return (0, ts_utils_1.succeed)(undefined);
+        }
+        return this._resolveRequired(current);
     }
     /**
      * Every persisted version of the entity whose subtree is `scope`. All version
@@ -576,10 +671,13 @@ class FileTreeMemoryStore {
      * entityId), so a scope filter over the index isolates one entity's versions.
      */
     _versionsForEntity(scope) {
-        return this._index
+        // Selected on the envelope (scope), materialized after — so a versioned write
+        // reads only that entity's versions, never the vault. Bounded by the entity's
+        // version count.
+        return (0, ts_utils_1.mapResults)(this._index
             .entries()
             .filter((entry) => entry.scope === scope)
-            .map((entry) => entry.record);
+            .map((entry) => this._resolveRequired(entry)));
     }
     /**
      * Versioned write (invalidate-don't-delete). Builds the new version's content
@@ -601,7 +699,11 @@ class FileTreeMemoryStore {
         // still-current version at snapshot time — normally one, but two-or-more if a
         // prior invalidation partially failed; invalidating all of them lets the write
         // self-heal a stuck state (P2-7).
-        const versions = this._versionsForEntity(scope);
+        const snapshot = this._versionsForEntity(scope);
+        if (snapshot.isFailure()) {
+            return (0, ts_utils_1.fail)(snapshot.message);
+        }
+        const versions = snapshot.value;
         const priorCurrents = versions.filter(types_1.isVersionCurrent);
         const current = (0, types_1.selectCurrentVersion)(versions);
         const policy = this._policyFor(kind);
@@ -727,7 +829,11 @@ class FileTreeMemoryStore {
      * builds on it), so a hard delete would defeat the purpose.
      */
     async _deleteVersioned(entityId, scope) {
-        const versions = this._versionsForEntity(scope);
+        const snapshot = this._versionsForEntity(scope);
+        if (snapshot.isFailure()) {
+            return (0, ts_utils_1.fail)(snapshot.message);
+        }
+        const versions = snapshot.value;
         const currents = versions.filter(types_1.isVersionCurrent);
         const current = (0, types_1.selectCurrentVersion)(versions);
         if (current === undefined) {
@@ -774,10 +880,12 @@ class FileTreeMemoryStore {
      * across first-writes and updates.
      */
     _admissionCohort(scope, kind, idStem) {
-        return this._index
+        // Envelope-only selection; the cohort is per-(scope, kind) and bounded by the
+        // cull cap, so materializing it is small by construction.
+        return (0, ts_utils_1.mapResults)(this._index
             .entries()
-            .filter((entry) => entry.scope === scope && entry.record.envelope.kind === kind && entry.record.envelope.id !== idStem)
-            .map((entry) => entry.record);
+            .filter((entry) => entry.scope === scope && entry.envelope.kind === kind && entry.envelope.id !== idStem)
+            .map((entry) => this._resolveRequired(entry)));
     }
     /**
      * Find a record in `scope` whose `contentHash` equals `hash`, if any,
@@ -785,12 +893,13 @@ class FileTreeMemoryStore {
      * dedup skip the same-id record so it does not shadow the LWW update path.
      */
     _findByContentHash(scope, hash, excludeId) {
+        // The clearest win of the projection: the hash lives on the envelope, so this
+        // scans envelopes and reads exactly ONE file — the match — where it used to
+        // hold every body in the scope to look at one field.
         const match = this._index
             .entries()
-            .find((entry) => entry.scope === scope &&
-            entry.record.envelope.contentHash === hash &&
-            entry.record.envelope.id !== excludeId);
-        return match === null || match === void 0 ? void 0 : match.record;
+            .find((entry) => entry.scope === scope && entry.envelope.contentHash === hash && entry.envelope.id !== excludeId);
+        return match === undefined ? (0, ts_utils_1.succeed)(undefined) : this._resolveRequired(match);
     }
     /**
      * True when `incoming`'s caller-authored mutable metadata (`tags` / `provenance`)
@@ -816,7 +925,7 @@ class FileTreeMemoryStore {
         return this._hasher.computeHash({ kind, body, links });
     }
     /**
-     * The locked body of {@link FileTreeMemoryStore.reconcileRank}.
+     * The rank branch of {@link FileTreeMemoryStore.reconcile}, under the write lock.
      *
      * @remarks
      * Re-reads each record's file rather than trusting the in-memory index, for
@@ -845,31 +954,54 @@ class FileTreeMemoryStore {
      * another on a reconcile. `_stampRank` itself is reused verbatim, which also
      * inherits its throw semantics (logged at `warn`, `rank` cleared).
      */
-    async _reconcileRankLocked(kind) {
-        if (!this._rankProjectors.has(kind)) {
-            return (0, ts_utils_1.fail)(`memory reconcileRank '${kind}': no rank projector is registered for this kind`);
-        }
+    async _reconcileLocked(kind, artifact) {
+        // Envelope-only selection: the walk needs `(scope, id)` and the kind, and
+        // each branch materializes only the records it decides to repair.
         const targets = this._index
             .entries()
-            .filter((entry) => entry.record.envelope.kind === kind);
-        let restamped = 0;
+            .filter((entry) => entry.envelope.kind === kind);
+        if (artifact === 'rank') {
+            return this._reconcileRankLocked(kind, targets);
+        }
+        return (0, storeReconcile_1.reconcileVectors)({
+            kind,
+            artifact,
+            targets,
+            maintenance: this._vectors,
+            embedsKind: (k) => this.embedsKind(k),
+            resolve: (scope, id) => this._readRecord(scope, id),
+            stampRef: (scope, id, ref) => this._rewriteEnvelope(scope, id, (r) => r.envelope.embeddingRef === ref
+                ? undefined
+                : { envelope: Object.assign(Object.assign({}, r.envelope), { embeddingRef: ref }), body: r.body })
+        });
+    }
+    /** The rank branch of {@link FileTreeMemoryStore._reconcileLocked}. */
+    async _reconcileRankLocked(kind, targets) {
+        if (!this._rankProjectors.has(kind)) {
+            return (0, ts_utils_1.fail)(`memory reconcile '${kind}' rank: no rank projector is registered for this kind`);
+        }
+        // No materialization at all: `_rewriteEnvelope` re-reads each record itself.
+        let repaired = 0;
         for (const target of targets) {
-            const applied = this._restampOne(target.scope, target.record.envelope.id);
+            const applied = this._rewriteEnvelope(target.scope, target.envelope.id, (r) => {
+                const stamped = this._stampRank(r);
+                return stamped.envelope.rank === r.envelope.rank ? undefined : stamped;
+            });
             if (applied.isFailure()) {
-                return (0, ts_utils_1.fail)(`memory reconcileRank '${kind}': ${applied.message}`);
+                return (0, ts_utils_1.fail)(`memory reconcile '${kind}' rank: ${applied.message}`);
             }
             if (applied.value) {
-                restamped++;
+                repaired++;
             }
         }
-        return (0, ts_utils_1.succeed)(restamped);
+        return (0, ts_utils_1.succeed)({ artifact: 'rank', kind, examined: targets.length, repaired, failed: [] });
     }
     /**
      * Re-apply the rank projector to one record on disk. Returns whether `rank`
      * actually changed — an unchanged rank writes nothing, so a reconcile over an
      * already-consistent store touches no files.
      */
-    _restampOne(scope, id) {
+    _rewriteEnvelope(scope, id, mutate) {
         return this._resolveScopeDir(scope).onSuccess((scopeDir) => {
             /* c8 ignore next 3 - defensive: the scope dir exists for any indexed record */
             if (scopeDir === undefined) {
@@ -897,12 +1029,16 @@ class FileTreeMemoryStore {
                     .onSuccess((parsed) => (0, converters_1.splitFrontmatter)(raw)
                     .withErrorFormat((msg) => `'${id}': ${msg}`)
                     .onSuccess((parts) => {
-                    const before = parsed.envelope.rank;
-                    const stamped = this._stampRank({
+                    // The mutator says "nothing to change" with `undefined` rather
+                    // than by returning an equal record: persisting unconditionally
+                    // would bump `updated` on every record of the kind, trading a
+                    // wrong value for a wrong timestamp, and a deep comparison here
+                    // would have to know which fields each caller touches.
+                    const stamped = mutate({
                         envelope: parsed.envelope,
                         body: parts.body
                     });
-                    if (stamped.envelope.rank === before) {
+                    if (stamped === undefined) {
                         return (0, ts_utils_1.succeed)(false);
                     }
                     return this._persist(stamped, scope, id).onSuccess(() => (0, ts_utils_1.succeed)(true));
@@ -1098,8 +1234,8 @@ class FileTreeMemoryStore {
     _initialIndex(onRecordError) {
         return this._collectEntries(this._root, [], onRecordError).onSuccess((entries) => this._index.rebuild(entries).onSuccess(() => {
             for (const entry of entries) {
-                if (entry.record.envelope.seq > this._seq) {
-                    this._seq = entry.record.envelope.seq;
+                if (entry.envelope.seq > this._seq) {
+                    this._seq = entry.envelope.seq;
                 }
             }
             return (0, ts_utils_1.succeed)(true);
@@ -1140,11 +1276,17 @@ class FileTreeMemoryStore {
      * failure passes through untouched so the historical error is byte-identical.
      */
     _loadRecordFile(scope, child, onRecordError) {
-        return child
+        return (child
             .getRawContents()
             .onSuccess((raw) => (0, converters_1.parseMemoryFile)(raw, this._registry))
             .onSuccess((parsedRecord) => this._verifyLoaded(scope, child, parsedRecord))
-            .onSuccess((verified) => (0, ts_utils_1.succeed)([{ scope, record: verified }]))
+            // Parse → validate → PROJECT → discard, per file. The body is read and
+            // fully validated (which is what gives `onRecordError` its meaning), then
+            // dropped here rather than carried into the index. Peak body residency
+            // across the whole open is therefore ONE record, not N — which is the
+            // resident-memory moment this whole surface exists to fix, and it is why
+            // the projection had to reach `rebuild` and not just the read methods.
+            .onSuccess((verified) => (0, ts_utils_1.succeed)([{ scope, envelope: verified.envelope }]))
             .onFailure((message) => {
             if (onRecordError === 'skip') {
                 const path = `${scope}/${child.name}`;
@@ -1153,7 +1295,7 @@ class FileTreeMemoryStore {
                 this._warnSwallowed(error);
             }
             return (0, ts_utils_1.fail)(message);
-        });
+        }));
     }
 }
 exports.FileTreeMemoryStore = FileTreeMemoryStore;