@fgv/ts-agent-memory 5.1.0-41 → 5.1.0-43

package/lib/packlets/vector/inMemoryFragmentCosineIndex.d.ts

@@ -0,0 +1,74 @@
+import { Result } from '@fgv/ts-utils';
+import { IEdgeTarget } from '../types';
+import { FragmentEmbedder, IEmbeddedFragment, IFragmentVectorIndex, IMemoryRecordSource, IVectorQueryHit } from './vectorIndex';
+/**
+ * The brute-force, in-memory cosine {@link IFragmentVectorIndex} — the
+ * fragment-granular sibling of {@link InMemoryCosineIndex}. Stores many
+ * `Float32Array`s per record (one per in-record {@link IFragmentLocator | span})
+ * and answers a query by computing cosine similarity against every stored
+ * fragment, returning the top-k fragment hits by descending score.
+ *
+ * @remarks
+ * Same regime and same non-goals as {@link InMemoryCosineIndex}: no external
+ * dependency, no ANN structure, a linear scan over the stored fragments — the seam
+ * ({@link IFragmentVectorIndex}) stays open for a consumer to swap a persistent /
+ * ANN backend once N grows. `addFragments` is whole-record-replace, so re-authoring
+ * a document never leaves stale fragments behind. The index has a single dimension
+ * established by the first fragment added; every subsequent fragment and every
+ * `query` vector must match it or fail loudly — a mismatched dimension is an
+ * embedder-wiring bug, never a silent zero-similarity result.
+ * {@link InMemoryFragmentCosineIndex.rebuild | rebuild} clears the index (and the
+ * established dimension), so a re-embed with a different model is supported.
+ *
+ * The optional `maxPerRecord` cap on `query` is applied **during selection**, before
+ * the `topK` cut, so one long document with many strong fragments cannot crowd every
+ * other record out of the result.
+ * @public
+ */
+export declare class InMemoryFragmentCosineIndex implements IFragmentVectorIndex {
+    /**
+     * Stored fragments keyed by the canonical {@link edgeTargetKey} of the record's
+     * scope-qualified address, so two records that share a filename stem across
+     * scopes occupy distinct entries and never overwrite each other's fragments.
+     */
+    private readonly _records;
+    /** The dimension of every stored fragment vector; `undefined` until the first `add`. */
+    private _dimension;
+    private constructor();
+    /** The number of records that currently have at least one stored fragment. */
+    get recordCount(): number;
+    /** The total number of fragments currently held across all records. */
+    get fragmentCount(): number;
+    /** Family-convention factory. */
+    static create(): Result<InMemoryFragmentCosineIndex>;
+    /** {@inheritDoc IFragmentVectorIndex.addFragments} */
+    addFragments(target: IEdgeTarget, fragments: ReadonlyArray<IEmbeddedFragment>): Promise<Result<number>>;
+    /** {@inheritDoc IFragmentVectorIndex.remove} */
+    remove(target: IEdgeTarget): Promise<Result<IEdgeTarget>>;
+    /** {@inheritDoc IFragmentVectorIndex.query} */
+    query(vector: Float32Array, topK: number, maxPerRecord?: number): Promise<Result<ReadonlyArray<IVectorQueryHit>>>;
+    /**
+     * Re-embed every record from `source` and rebuild the fragment index from
+     * scratch. Clears the current contents (and the established dimension) first, so
+     * a re-embed with a different model is supported. Returns the total number of
+     * fragments indexed.
+     *
+     * On any failure (list, embed, or add) the index is rolled back to empty rather
+     * than left in a partially-rebuilt state.
+     *
+     * @param source - The scope-qualified record source to re-embed.
+     * @param embed - The fragment embedder applied to each record.
+     */
+    rebuild(source: IMemoryRecordSource, embed: FragmentEmbedder): Promise<Result<number>>;
+    /** Empty the index and forget the established dimension. */
+    private _reset;
+    /** The Euclidean magnitude (L2 norm) of a vector. */
+    private static _magnitude;
+    /**
+     * Cosine similarity between the query (whose magnitude is precomputed once and
+     * reused across the scan) and a stored fragment vector. A zero-magnitude vector
+     * on either side yields `0` rather than `NaN`.
+     */
+    private static _cosine;
+}
+//# sourceMappingURL=inMemoryFragmentCosineIndex.d.ts.map

package/lib/packlets/vector/inMemoryFragmentCosineIndex.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"inMemoryFragmentCosineIndex.d.ts","sourceRoot":"","sources":["../../../src/packlets/vector/inMemoryFragmentCosineIndex.ts"],"names":[],"mappings":"AAKA,OAAO,EAAE,MAAM,EAAiB,MAAM,eAAe,CAAC;AACtD,OAAO,EAAE,WAAW,EAAiB,MAAM,UAAU,CAAC;AACtD,OAAO,EACL,gBAAgB,EAChB,iBAAiB,EAEjB,oBAAoB,EACpB,mBAAmB,EAEnB,eAAe,EAChB,MAAM,eAAe,CAAC;AAoBvB;;;;;;;;;;;;;;;;;;;;;;;GAuBG;AACH,qBAAa,2BAA4B,YAAW,oBAAoB;IACtE;;;;OAIG;IACH,OAAO,CAAC,QAAQ,CAAC,QAAQ,CAAsC;IAC/D,wFAAwF;IACxF,OAAO,CAAC,UAAU,CAAqB;IAEvC,OAAO;IAKP,8EAA8E;IAC9E,IAAW,WAAW,IAAI,MAAM,CAE/B;IAED,uEAAuE;IACvE,IAAW,aAAa,IAAI,MAAM,CAMjC;IAED,iCAAiC;WACnB,MAAM,IAAI,MAAM,CAAC,2BAA2B,CAAC;IAI3D,sDAAsD;IAC/C,YAAY,CACjB,MAAM,EAAE,WAAW,EACnB,SAAS,EAAE,aAAa,CAAC,iBAAiB,CAAC,GAC1C,OAAO,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;IAqC1B,gDAAgD;IACzC,MAAM,CAAC,MAAM,EAAE,WAAW,GAAG,OAAO,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC;IAKhE,+CAA+C;IACxC,KAAK,CACV,MAAM,EAAE,YAAY,EACpB,IAAI,EAAE,MAAM,EACZ,YAAY,CAAC,EAAE,MAAM,GACpB,OAAO,CAAC,MAAM,CAAC,aAAa,CAAC,eAAe,CAAC,CAAC,CAAC;IAkDlD;;;;;;;;;;;OAWG;IACU,OAAO,CAAC,MAAM,EAAE,mBAAmB,EAAE,KAAK,EAAE,gBAAgB,GAAG,OAAO,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;IAuBnG,4DAA4D;IAC5D,OAAO,CAAC,MAAM;IAKd,qDAAqD;IACrD,OAAO,CAAC,MAAM,CAAC,UAAU;IAQzB;;;;OAIG;IACH,OAAO,CAAC,MAAM,CAAC,OAAO;CAWvB"}

package/lib/packlets/vector/inMemoryFragmentCosineIndex.js

@@ -0,0 +1,204 @@
+"use strict";
+/*
+ * Copyright (c) 2026 Erik Fortune
+ * SPDX-License-Identifier: MIT
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.InMemoryFragmentCosineIndex = void 0;
+const ts_utils_1 = require("@fgv/ts-utils");
+const types_1 = require("../types");
+/**
+ * The brute-force, in-memory cosine {@link IFragmentVectorIndex} — the
+ * fragment-granular sibling of {@link InMemoryCosineIndex}. Stores many
+ * `Float32Array`s per record (one per in-record {@link IFragmentLocator | span})
+ * and answers a query by computing cosine similarity against every stored
+ * fragment, returning the top-k fragment hits by descending score.
+ *
+ * @remarks
+ * Same regime and same non-goals as {@link InMemoryCosineIndex}: no external
+ * dependency, no ANN structure, a linear scan over the stored fragments — the seam
+ * ({@link IFragmentVectorIndex}) stays open for a consumer to swap a persistent /
+ * ANN backend once N grows. `addFragments` is whole-record-replace, so re-authoring
+ * a document never leaves stale fragments behind. The index has a single dimension
+ * established by the first fragment added; every subsequent fragment and every
+ * `query` vector must match it or fail loudly — a mismatched dimension is an
+ * embedder-wiring bug, never a silent zero-similarity result.
+ * {@link InMemoryFragmentCosineIndex.rebuild | rebuild} clears the index (and the
+ * established dimension), so a re-embed with a different model is supported.
+ *
+ * The optional `maxPerRecord` cap on `query` is applied **during selection**, before
+ * the `topK` cut, so one long document with many strong fragments cannot crowd every
+ * other record out of the result.
+ * @public
+ */
+class InMemoryFragmentCosineIndex {
+    constructor() {
+        this._records = new Map();
+        this._dimension = undefined;
+    }
+    /** The number of records that currently have at least one stored fragment. */
+    get recordCount() {
+        return this._records.size;
+    }
+    /** The total number of fragments currently held across all records. */
+    get fragmentCount() {
+        let total = 0;
+        for (const record of this._records.values()) {
+            total += record.fragments.length;
+        }
+        return total;
+    }
+    /** Family-convention factory. */
+    static create() {
+        return (0, ts_utils_1.succeed)(new InMemoryFragmentCosineIndex());
+    }
+    /** {@inheritDoc IFragmentVectorIndex.addFragments} */
+    addFragments(target, fragments) {
+        const key = (0, types_1.edgeTargetKey)(target);
+        // Validate every fragment before mutating any state, so a bad fragment never
+        // leaves the record half-replaced OR the index dimension half-established
+        // (whole-record-replace must be all-or-nothing). The effective dimension is the
+        // established one, or — on a still-dimensionless index — the first fragment's
+        // length; it is only committed to `this._dimension` once the whole batch passes.
+        const stored = [];
+        let dimension = this._dimension;
+        for (const fragment of fragments) {
+            if (fragment.vector.length === 0) {
+                return Promise.resolve((0, ts_utils_1.fail)(`fragment index: cannot add '${key}': empty fragment vector`));
+            }
+            if (dimension === undefined) {
+                dimension = fragment.vector.length;
+            }
+            else if (fragment.vector.length !== dimension) {
+                return Promise.resolve((0, ts_utils_1.fail)(`fragment index: cannot add '${key}': fragment dimension ${fragment.vector.length} does not match index dimension ${dimension}`));
+            }
+            // Defensive copy: the caller may reuse or mutate the buffer after `addFragments`.
+            stored.push({ locator: fragment.locator, vector: Float32Array.from(fragment.vector) });
+        }
+        // Whole-record replace: an empty `fragments` array drops the record entirely
+        // rather than leaving an empty shell behind. Commit the (possibly newly-derived)
+        // dimension only alongside a successful, non-empty store.
+        if (stored.length === 0) {
+            this._records.delete(key);
+        }
+        else {
+            this._dimension = dimension;
+            this._records.set(key, { target, fragments: stored });
+        }
+        return Promise.resolve((0, ts_utils_1.succeed)(stored.length));
+    }
+    /** {@inheritDoc IFragmentVectorIndex.remove} */
+    remove(target) {
+        this._records.delete((0, types_1.edgeTargetKey)(target));
+        return Promise.resolve((0, ts_utils_1.succeed)(target));
+    }
+    /** {@inheritDoc IFragmentVectorIndex.query} */
+    query(vector, topK, maxPerRecord) {
+        var _a;
+        if (topK <= 0 || this._records.size === 0) {
+            return Promise.resolve((0, ts_utils_1.succeed)([]));
+        }
+        if (vector.length !== this._dimension) {
+            return Promise.resolve((0, ts_utils_1.fail)(`fragment index: query dimension ${vector.length} does not match index dimension ${this._dimension}`));
+        }
+        const queryMagnitude = InMemoryFragmentCosineIndex._magnitude(vector);
+        const scored = [];
+        for (const record of this._records.values()) {
+            for (const fragment of record.fragments) {
+                scored.push({
+                    key: (0, types_1.edgeTargetKey)(record.target),
+                    hit: {
+                        target: record.target,
+                        score: InMemoryFragmentCosineIndex._cosine(vector, queryMagnitude, fragment.vector),
+                        locator: fragment.locator
+                    }
+                });
+            }
+        }
+        // Descending by score; the caller re-resolves each `(target, locator)` hit.
+        scored.sort((a, b) => b.hit.score - a.hit.score);
+        const hits = [];
+        // Apply the per-record cap during selection (before the topK cut) so a single
+        // long document cannot monopolize the result. `undefined` maxPerRecord means
+        // uncapped; the counter map is always allocated (tiny) so the guard narrows
+        // `maxPerRecord` directly without a non-null assertion.
+        const perRecord = new Map();
+        for (const candidate of scored) {
+            if (hits.length >= topK) {
+                break;
+            }
+            if (maxPerRecord !== undefined) {
+                const used = (_a = perRecord.get(candidate.key)) !== null && _a !== void 0 ? _a : 0;
+                if (used >= maxPerRecord) {
+                    continue;
+                }
+                perRecord.set(candidate.key, used + 1);
+            }
+            hits.push(candidate.hit);
+        }
+        return Promise.resolve((0, ts_utils_1.succeed)(hits));
+    }
+    /**
+     * Re-embed every record from `source` and rebuild the fragment index from
+     * scratch. Clears the current contents (and the established dimension) first, so
+     * a re-embed with a different model is supported. Returns the total number of
+     * fragments indexed.
+     *
+     * On any failure (list, embed, or add) the index is rolled back to empty rather
+     * than left in a partially-rebuilt state.
+     *
+     * @param source - The scope-qualified record source to re-embed.
+     * @param embed - The fragment embedder applied to each record.
+     */
+    async rebuild(source, embed) {
+        this._reset();
+        const listed = await source.list();
+        if (listed.isFailure()) {
+            return (0, ts_utils_1.fail)(`fragment index rebuild: failed to list records: ${listed.message}`);
+        }
+        for (const scoped of listed.value) {
+            const embedded = await embed(scoped.record);
+            if (embedded.isFailure()) {
+                this._reset();
+                return (0, ts_utils_1.fail)(`fragment index rebuild: embedding '${(0, types_1.edgeTargetKey)(scoped.target)}' failed: ${embedded.message}`);
+            }
+            const added = await this.addFragments(scoped.target, embedded.value);
+            if (added.isFailure()) {
+                this._reset();
+                return (0, ts_utils_1.fail)(`fragment index rebuild: ${added.message}`);
+            }
+        }
+        return (0, ts_utils_1.succeed)(this.fragmentCount);
+    }
+    /** Empty the index and forget the established dimension. */
+    _reset() {
+        this._records.clear();
+        this._dimension = undefined;
+    }
+    /** The Euclidean magnitude (L2 norm) of a vector. */
+    static _magnitude(vector) {
+        let sum = 0;
+        for (let i = 0; i < vector.length; i++) {
+            sum += vector[i] * vector[i];
+        }
+        return Math.sqrt(sum);
+    }
+    /**
+     * Cosine similarity between the query (whose magnitude is precomputed once and
+     * reused across the scan) and a stored fragment vector. A zero-magnitude vector
+     * on either side yields `0` rather than `NaN`.
+     */
+    static _cosine(query, queryMagnitude, stored) {
+        const storedMagnitude = InMemoryFragmentCosineIndex._magnitude(stored);
+        if (queryMagnitude === 0 || storedMagnitude === 0) {
+            return 0;
+        }
+        let dot = 0;
+        for (let i = 0; i < query.length; i++) {
+            dot += query[i] * stored[i];
+        }
+        return dot / (queryMagnitude * storedMagnitude);
+    }
+}
+exports.InMemoryFragmentCosineIndex = InMemoryFragmentCosineIndex;
+//# sourceMappingURL=inMemoryFragmentCosineIndex.js.map

package/lib/packlets/vector/inMemoryFragmentCosineIndex.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"inMemoryFragmentCosineIndex.js","sourceRoot":"","sources":["../../../src/packlets/vector/inMemoryFragmentCosineIndex.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;AAEH,4CAAsD;AACtD,oCAAsD;AA6BtD;;;;;;;;;;;;;;;;;;;;;;;GAuBG;AACH,MAAa,2BAA2B;IAUtC;QACE,IAAI,CAAC,QAAQ,GAAG,IAAI,GAAG,EAAkC,CAAC;QAC1D,IAAI,CAAC,UAAU,GAAG,SAAS,CAAC;IAC9B,CAAC;IAED,8EAA8E;IAC9E,IAAW,WAAW;QACpB,OAAO,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC;IAC5B,CAAC;IAED,uEAAuE;IACvE,IAAW,aAAa;QACtB,IAAI,KAAK,GAAW,CAAC,CAAC;QACtB,KAAK,MAAM,MAAM,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,EAAE,CAAC;YAC5C,KAAK,IAAI,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC;QACnC,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAED,iCAAiC;IAC1B,MAAM,CAAC,MAAM;QAClB,OAAO,IAAA,kBAAO,EAAC,IAAI,2BAA2B,EAAE,CAAC,CAAC;IACpD,CAAC;IAED,sDAAsD;IAC/C,YAAY,CACjB,MAAmB,EACnB,SAA2C;QAE3C,MAAM,GAAG,GAAW,IAAA,qBAAa,EAAC,MAAM,CAAC,CAAC;QAC1C,6EAA6E;QAC7E,0EAA0E;QAC1E,gFAAgF;QAChF,8EAA8E;QAC9E,iFAAiF;QACjF,MAAM,MAAM,GAAsB,EAAE,CAAC;QACrC,IAAI,SAAS,GAAuB,IAAI,CAAC,UAAU,CAAC;QACpD,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;YACjC,IAAI,QAAQ,CAAC,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBACjC,OAAO,OAAO,CAAC,OAAO,CAAC,IAAA,eAAI,EAAC,+BAA+B,GAAG,0BAA0B,CAAC,CAAC,CAAC;YAC7F,CAAC;YACD,IAAI,SAAS,KAAK,SAAS,EAAE,CAAC;gBAC5B,SAAS,GAAG,QAAQ,CAAC,MAAM,CAAC,MAAM,CAAC;YACrC,CAAC;iBAAM,IAAI,QAAQ,CAAC,MAAM,CAAC,MAAM,KAAK,SAAS,EAAE,CAAC;gBAChD,OAAO,OAAO,CAAC,OAAO,CACpB,IAAA,eAAI,EACF,+BAA+B,GAAG,yBAAyB,QAAQ,CAAC,MAAM,CAAC,MAAM,mCAAmC,SAAS,EAAE,CAChI,CACF,CAAC;YACJ,CAAC;YACD,kFAAkF;YAClF,MAAM,CAAC,IAAI,CAAC,EAAE,OAAO,EAAE,QAAQ,CAAC,OAAO,EAAE,MAAM,EAAE,YAAY,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QACzF,CAAC;QACD,6EAA6E;QAC7E,iFAAiF;QACjF,0DAA0D;QAC1D,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACxB,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QAC5B,CAAC;aAAM,CAAC;YACN,IAAI,CAAC,UAAU,GAAG,SAAS,CAAC;YAC5B,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,CAAC,CAAC;QACxD,CAAC;QACD,OAAO,OAAO,CAAC,OAAO,CAAC,IAAA,kBAAO,EAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC;IACjD,CAAC;IAED,gDAAgD;IACzC,MAAM,CAAC,MAAmB;QAC/B,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,IAAA,qBAAa,EAAC,MAAM,CAAC,CAAC,CAAC;QAC5C,OAAO,OAAO,CAAC,OAAO,CAAC,IAAA,kBAAO,EAAC,MAAM,CAAC,CAAC,CAAC;IAC1C,CAAC;IAED,+CAA+C;IACxC,KAAK,CACV,MAAoB,EACpB,IAAY,EACZ,YAAqB;;QAErB,IAAI,IAAI,IAAI,CAAC,IAAI,IAAI,CAAC,QAAQ,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;YAC1C,OAAO,OAAO,CAAC,OAAO,CAAC,IAAA,kBAAO,EAAC,EAAE,CAAC,CAAC,CAAC;QACtC,CAAC;QACD,IAAI,MAAM,CAAC,MAAM,KAAK,IAAI,CAAC,UAAU,EAAE,CAAC;YACtC,OAAO,OAAO,CAAC,OAAO,CACpB,IAAA,eAAI,EACF,mCAAmC,MAAM,CAAC,MAAM,mCAAmC,IAAI,CAAC,UAAU,EAAE,CACrG,CACF,CAAC;QACJ,CAAC;QACD,MAAM,cAAc,GAAW,2BAA2B,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;QAC9E,MAAM,MAAM,GAAsB,EAAE,CAAC;QACrC,KAAK,MAAM,MAAM,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,EAAE,CAAC;YAC5C,KAAK,MAAM,QAAQ,IAAI,MAAM,CAAC,SAAS,EAAE,CAAC;gBACxC,MAAM,CAAC,IAAI,CAAC;oBACV,GAAG,EAAE,IAAA,qBAAa,EAAC,MAAM,CAAC,MAAM,CAAC;oBACjC,GAAG,EAAE;wBACH,MAAM,EAAE,MAAM,CAAC,MAAM;wBACrB,KAAK,EAAE,2BAA2B,CAAC,OAAO,CAAC,MAAM,EAAE,cAAc,EAAE,QAAQ,CAAC,MAAM,CAAC;wBACnF,OAAO,EAAE,QAAQ,CAAC,OAAO;qBAC1B;iBACF,CAAC,CAAC;YACL,CAAC;QACH,CAAC;QACD,4EAA4E;QAC5E,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QAEjD,MAAM,IAAI,GAAsB,EAAE,CAAC;QACnC,8EAA8E;QAC9E,6EAA6E;QAC7E,4EAA4E;QAC5E,wDAAwD;QACxD,MAAM,SAAS,GAAwB,IAAI,GAAG,EAAkB,CAAC;QACjE,KAAK,MAAM,SAAS,IAAI,MAAM,EAAE,CAAC;YAC/B,IAAI,IAAI,CAAC,MAAM,IAAI,IAAI,EAAE,CAAC;gBACxB,MAAM;YACR,CAAC;YACD,IAAI,YAAY,KAAK,SAAS,EAAE,CAAC;gBAC/B,MAAM,IAAI,GAAW,MAAA,SAAS,CAAC,GAAG,CAAC,SAAS,CAAC,GAAG,CAAC,mCAAI,CAAC,CAAC;gBACvD,IAAI,IAAI,IAAI,YAAY,EAAE,CAAC;oBACzB,SAAS;gBACX,CAAC;gBACD,SAAS,CAAC,GAAG,CAAC,SAAS,CAAC,GAAG,EAAE,IAAI,GAAG,CAAC,CAAC,CAAC;YACzC,CAAC;YACD,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC;QAC3B,CAAC;QACD,OAAO,OAAO,CAAC,OAAO,CAAC,IAAA,kBAAO,EAAC,IAAI,CAAC,CAAC,CAAC;IACxC,CAAC;IAED;;;;;;;;;;;OAWG;IACI,KAAK,CAAC,OAAO,CAAC,MAA2B,EAAE,KAAuB;QACvE,IAAI,CAAC,MAAM,EAAE,CAAC;QACd,MAAM,MAAM,GAA+C,MAAM,MAAM,CAAC,IAAI,EAAE,CAAC;QAC/E,IAAI,MAAM,CAAC,SAAS,EAAE,EAAE,CAAC;YACvB,OAAO,IAAA,eAAI,EAAC,mDAAmD,MAAM,CAAC,OAAO,EAAE,CAAC,CAAC;QACnF,CAAC;QACD,KAAK,MAAM,MAAM,IAAI,MAAM,CAAC,KAAK,EAAE,CAAC;YAClC,MAAM,QAAQ,GAA6C,MAAM,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;YACtF,IAAI,QAAQ,CAAC,SAAS,EAAE,EAAE,CAAC;gBACzB,IAAI,CAAC,MAAM,EAAE,CAAC;gBACd,OAAO,IAAA,eAAI,EACT,sCAAsC,IAAA,qBAAa,EAAC,MAAM,CAAC,MAAM,CAAC,aAAa,QAAQ,CAAC,OAAO,EAAE,CAClG,CAAC;YACJ,CAAC;YACD,MAAM,KAAK,GAAmB,MAAM,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,MAAM,EAAE,QAAQ,CAAC,KAAK,CAAC,CAAC;YACrF,IAAI,KAAK,CAAC,SAAS,EAAE,EAAE,CAAC;gBACtB,IAAI,CAAC,MAAM,EAAE,CAAC;gBACd,OAAO,IAAA,eAAI,EAAC,2BAA2B,KAAK,CAAC,OAAO,EAAE,CAAC,CAAC;YAC1D,CAAC;QACH,CAAC;QACD,OAAO,IAAA,kBAAO,EAAC,IAAI,CAAC,aAAa,CAAC,CAAC;IACrC,CAAC;IAED,4DAA4D;IACpD,MAAM;QACZ,IAAI,CAAC,QAAQ,CAAC,KAAK,EAAE,CAAC;QACtB,IAAI,CAAC,UAAU,GAAG,SAAS,CAAC;IAC9B,CAAC;IAED,qDAAqD;IAC7C,MAAM,CAAC,UAAU,CAAC,MAAoB;QAC5C,IAAI,GAAG,GAAW,CAAC,CAAC;QACpB,KAAK,IAAI,CAAC,GAAW,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC/C,GAAG,IAAI,MAAM,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;QAC/B,CAAC;QACD,OAAO,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IACxB,CAAC;IAED;;;;OAIG;IACK,MAAM,CAAC,OAAO,CAAC,KAAmB,EAAE,cAAsB,EAAE,MAAoB;QACtF,MAAM,eAAe,GAAW,2BAA2B,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;QAC/E,IAAI,cAAc,KAAK,CAAC,IAAI,eAAe,KAAK,CAAC,EAAE,CAAC;YAClD,OAAO,CAAC,CAAC;QACX,CAAC;QACD,IAAI,GAAG,GAAW,CAAC,CAAC;QACpB,KAAK,IAAI,CAAC,GAAW,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC9C,GAAG,IAAI,KAAK,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;QAC9B,CAAC;QACD,OAAO,GAAG,GAAG,CAAC,cAAc,GAAG,eAAe,CAAC,CAAC;IAClD,CAAC;CACF;AA1MD,kEA0MC","sourcesContent":["/*\n * Copyright (c) 2026 Erik Fortune\n * SPDX-License-Identifier: MIT\n */\n\nimport { Result, fail, succeed } from '@fgv/ts-utils';\nimport { IEdgeTarget, edgeTargetKey } from '../types';\nimport {\n  FragmentEmbedder,\n  IEmbeddedFragment,\n  IFragmentLocator,\n  IFragmentVectorIndex,\n  IMemoryRecordSource,\n  IScopedMemoryRecord,\n  IVectorQueryHit\n} from './vectorIndex';\n\n/** One stored fragment: its in-record locator plus the vector for that span. */\ninterface IStoredFragment {\n  readonly locator: IFragmentLocator;\n  readonly vector: Float32Array;\n}\n\n/** Every stored fragment for one record, tagged with the record's scoped address. */\ninterface IStoredRecordFragments {\n  readonly target: IEdgeTarget;\n  readonly fragments: IStoredFragment[];\n}\n\n/** A candidate hit carried through selection: the fragment's key, hit, and score. */\ninterface IScoredFragment {\n  readonly key: string;\n  readonly hit: IVectorQueryHit;\n}\n\n/**\n * The brute-force, in-memory cosine {@link IFragmentVectorIndex} — the\n * fragment-granular sibling of {@link InMemoryCosineIndex}. Stores many\n * `Float32Array`s per record (one per in-record {@link IFragmentLocator | span})\n * and answers a query by computing cosine similarity against every stored\n * fragment, returning the top-k fragment hits by descending score.\n *\n * @remarks\n * Same regime and same non-goals as {@link InMemoryCosineIndex}: no external\n * dependency, no ANN structure, a linear scan over the stored fragments — the seam\n * ({@link IFragmentVectorIndex}) stays open for a consumer to swap a persistent /\n * ANN backend once N grows. `addFragments` is whole-record-replace, so re-authoring\n * a document never leaves stale fragments behind. The index has a single dimension\n * established by the first fragment added; every subsequent fragment and every\n * `query` vector must match it or fail loudly — a mismatched dimension is an\n * embedder-wiring bug, never a silent zero-similarity result.\n * {@link InMemoryFragmentCosineIndex.rebuild | rebuild} clears the index (and the\n * established dimension), so a re-embed with a different model is supported.\n *\n * The optional `maxPerRecord` cap on `query` is applied **during selection**, before\n * the `topK` cut, so one long document with many strong fragments cannot crowd every\n * other record out of the result.\n * @public\n */\nexport class InMemoryFragmentCosineIndex implements IFragmentVectorIndex {\n  /**\n   * Stored fragments keyed by the canonical {@link edgeTargetKey} of the record's\n   * scope-qualified address, so two records that share a filename stem across\n   * scopes occupy distinct entries and never overwrite each other's fragments.\n   */\n  private readonly _records: Map<string, IStoredRecordFragments>;\n  /** The dimension of every stored fragment vector; `undefined` until the first `add`. */\n  private _dimension: number | undefined;\n\n  private constructor() {\n    this._records = new Map<string, IStoredRecordFragments>();\n    this._dimension = undefined;\n  }\n\n  /** The number of records that currently have at least one stored fragment. */\n  public get recordCount(): number {\n    return this._records.size;\n  }\n\n  /** The total number of fragments currently held across all records. */\n  public get fragmentCount(): number {\n    let total: number = 0;\n    for (const record of this._records.values()) {\n      total += record.fragments.length;\n    }\n    return total;\n  }\n\n  /** Family-convention factory. */\n  public static create(): Result<InMemoryFragmentCosineIndex> {\n    return succeed(new InMemoryFragmentCosineIndex());\n  }\n\n  /** {@inheritDoc IFragmentVectorIndex.addFragments} */\n  public addFragments(\n    target: IEdgeTarget,\n    fragments: ReadonlyArray<IEmbeddedFragment>\n  ): Promise<Result<number>> {\n    const key: string = edgeTargetKey(target);\n    // Validate every fragment before mutating any state, so a bad fragment never\n    // leaves the record half-replaced OR the index dimension half-established\n    // (whole-record-replace must be all-or-nothing). The effective dimension is the\n    // established one, or — on a still-dimensionless index — the first fragment's\n    // length; it is only committed to `this._dimension` once the whole batch passes.\n    const stored: IStoredFragment[] = [];\n    let dimension: number | undefined = this._dimension;\n    for (const fragment of fragments) {\n      if (fragment.vector.length === 0) {\n        return Promise.resolve(fail(`fragment index: cannot add '${key}': empty fragment vector`));\n      }\n      if (dimension === undefined) {\n        dimension = fragment.vector.length;\n      } else if (fragment.vector.length !== dimension) {\n        return Promise.resolve(\n          fail(\n            `fragment index: cannot add '${key}': fragment dimension ${fragment.vector.length} does not match index dimension ${dimension}`\n          )\n        );\n      }\n      // Defensive copy: the caller may reuse or mutate the buffer after `addFragments`.\n      stored.push({ locator: fragment.locator, vector: Float32Array.from(fragment.vector) });\n    }\n    // Whole-record replace: an empty `fragments` array drops the record entirely\n    // rather than leaving an empty shell behind. Commit the (possibly newly-derived)\n    // dimension only alongside a successful, non-empty store.\n    if (stored.length === 0) {\n      this._records.delete(key);\n    } else {\n      this._dimension = dimension;\n      this._records.set(key, { target, fragments: stored });\n    }\n    return Promise.resolve(succeed(stored.length));\n  }\n\n  /** {@inheritDoc IFragmentVectorIndex.remove} */\n  public remove(target: IEdgeTarget): Promise<Result<IEdgeTarget>> {\n    this._records.delete(edgeTargetKey(target));\n    return Promise.resolve(succeed(target));\n  }\n\n  /** {@inheritDoc IFragmentVectorIndex.query} */\n  public query(\n    vector: Float32Array,\n    topK: number,\n    maxPerRecord?: number\n  ): Promise<Result<ReadonlyArray<IVectorQueryHit>>> {\n    if (topK <= 0 || this._records.size === 0) {\n      return Promise.resolve(succeed([]));\n    }\n    if (vector.length !== this._dimension) {\n      return Promise.resolve(\n        fail(\n          `fragment index: query dimension ${vector.length} does not match index dimension ${this._dimension}`\n        )\n      );\n    }\n    const queryMagnitude: number = InMemoryFragmentCosineIndex._magnitude(vector);\n    const scored: IScoredFragment[] = [];\n    for (const record of this._records.values()) {\n      for (const fragment of record.fragments) {\n        scored.push({\n          key: edgeTargetKey(record.target),\n          hit: {\n            target: record.target,\n            score: InMemoryFragmentCosineIndex._cosine(vector, queryMagnitude, fragment.vector),\n            locator: fragment.locator\n          }\n        });\n      }\n    }\n    // Descending by score; the caller re-resolves each `(target, locator)` hit.\n    scored.sort((a, b) => b.hit.score - a.hit.score);\n\n    const hits: IVectorQueryHit[] = [];\n    // Apply the per-record cap during selection (before the topK cut) so a single\n    // long document cannot monopolize the result. `undefined` maxPerRecord means\n    // uncapped; the counter map is always allocated (tiny) so the guard narrows\n    // `maxPerRecord` directly without a non-null assertion.\n    const perRecord: Map<string, number> = new Map<string, number>();\n    for (const candidate of scored) {\n      if (hits.length >= topK) {\n        break;\n      }\n      if (maxPerRecord !== undefined) {\n        const used: number = perRecord.get(candidate.key) ?? 0;\n        if (used >= maxPerRecord) {\n          continue;\n        }\n        perRecord.set(candidate.key, used + 1);\n      }\n      hits.push(candidate.hit);\n    }\n    return Promise.resolve(succeed(hits));\n  }\n\n  /**\n   * Re-embed every record from `source` and rebuild the fragment index from\n   * scratch. Clears the current contents (and the established dimension) first, so\n   * a re-embed with a different model is supported. Returns the total number of\n   * fragments indexed.\n   *\n   * On any failure (list, embed, or add) the index is rolled back to empty rather\n   * than left in a partially-rebuilt state.\n   *\n   * @param source - The scope-qualified record source to re-embed.\n   * @param embed - The fragment embedder applied to each record.\n   */\n  public async rebuild(source: IMemoryRecordSource, embed: FragmentEmbedder): Promise<Result<number>> {\n    this._reset();\n    const listed: Result<ReadonlyArray<IScopedMemoryRecord>> = await source.list();\n    if (listed.isFailure()) {\n      return fail(`fragment index rebuild: failed to list records: ${listed.message}`);\n    }\n    for (const scoped of listed.value) {\n      const embedded: Result<ReadonlyArray<IEmbeddedFragment>> = await embed(scoped.record);\n      if (embedded.isFailure()) {\n        this._reset();\n        return fail(\n          `fragment index rebuild: embedding '${edgeTargetKey(scoped.target)}' failed: ${embedded.message}`\n        );\n      }\n      const added: Result<number> = await this.addFragments(scoped.target, embedded.value);\n      if (added.isFailure()) {\n        this._reset();\n        return fail(`fragment index rebuild: ${added.message}`);\n      }\n    }\n    return succeed(this.fragmentCount);\n  }\n\n  /** Empty the index and forget the established dimension. */\n  private _reset(): void {\n    this._records.clear();\n    this._dimension = undefined;\n  }\n\n  /** The Euclidean magnitude (L2 norm) of a vector. */\n  private static _magnitude(vector: Float32Array): number {\n    let sum: number = 0;\n    for (let i: number = 0; i < vector.length; i++) {\n      sum += vector[i] * vector[i];\n    }\n    return Math.sqrt(sum);\n  }\n\n  /**\n   * Cosine similarity between the query (whose magnitude is precomputed once and\n   * reused across the scan) and a stored fragment vector. A zero-magnitude vector\n   * on either side yields `0` rather than `NaN`.\n   */\n  private static _cosine(query: Float32Array, queryMagnitude: number, stored: Float32Array): number {\n    const storedMagnitude: number = InMemoryFragmentCosineIndex._magnitude(stored);\n    if (queryMagnitude === 0 || storedMagnitude === 0) {\n      return 0;\n    }\n    let dot: number = 0;\n    for (let i: number = 0; i < query.length; i++) {\n      dot += query[i] * stored[i];\n    }\n    return dot / (queryMagnitude * storedMagnitude);\n  }\n}\n"]}

package/lib/packlets/vector/index.d.ts

@@ -1,3 +1,4 @@
 export * from './vectorIndex';
 export * from './inMemoryCosineIndex';
+export * from './inMemoryFragmentCosineIndex';
 //# sourceMappingURL=index.d.ts.map

package/lib/packlets/vector/index.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/packlets/vector/index.ts"],"names":[],"mappings":"AAKA,cAAc,eAAe,CAAC;AAC9B,cAAc,uBAAuB,CAAC"}
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/packlets/vector/index.ts"],"names":[],"mappings":"AAKA,cAAc,eAAe,CAAC;AAC9B,cAAc,uBAAuB,CAAC;AACtC,cAAc,+BAA+B,CAAC"}

package/lib/packlets/vector/index.js

@@ -20,4 +20,5 @@ var __exportStar = (this && this.__exportStar) || function(m, exports) {
 Object.defineProperty(exports, "__esModule", { value: true });
 __exportStar(require("./vectorIndex"), exports);
 __exportStar(require("./inMemoryCosineIndex"), exports);
+__exportStar(require("./inMemoryFragmentCosineIndex"), exports);
 //# sourceMappingURL=index.js.map

package/lib/packlets/vector/index.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/packlets/vector/index.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;;;;;;;;;;;;;;AAEH,gDAA8B;AAC9B,wDAAsC","sourcesContent":["/*\n * Copyright (c) 2026 Erik Fortune\n * SPDX-License-Identifier: MIT\n */\n\nexport * from './vectorIndex';\nexport * from './inMemoryCosineIndex';\n"]}
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/packlets/vector/index.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;;;;;;;;;;;;;;AAEH,gDAA8B;AAC9B,wDAAsC;AACtC,gEAA8C","sourcesContent":["/*\n * Copyright (c) 2026 Erik Fortune\n * SPDX-License-Identifier: MIT\n */\n\nexport * from './vectorIndex';\nexport * from './inMemoryCosineIndex';\nexport * from './inMemoryFragmentCosineIndex';\n"]}

package/lib/packlets/vector/vectorIndex.d.ts

@@ -1,10 +1,25 @@
 import { Result } from '@fgv/ts-utils';
 import { IEdgeTarget, IMemoryRecord } from '../types';
 /**
- * A single hit returned by {@link IVectorIndex.query}: the matched record's
- * scope-qualified {@link IEdgeTarget | address} and the backend's similarity
- * score (higher = more similar; the exact scale is backend-defined). Hits are
- * returned in descending score order.
+ * A half-open `[start, end)` span into a record's body — the in-record locator a
+ * {@link IFragmentVectorIndex} carries on each fragment hit. `start` is inclusive,
+ * `end` exclusive. The unit (character / byte / token offsets) is the consumer's
+ * choice: the index stores the two integers opaquely and never interprets them,
+ * so they line up with whatever locator the consumer's own read side uses.
+ * @public
+ */
+export interface IFragmentLocator {
+    /** Inclusive start offset into the record body. */
+    readonly start: number;
+    /** Exclusive end offset into the record body. */
+    readonly end: number;
+}
+/**
+ * A single hit returned by {@link IVectorIndex.query} (or
+ * {@link IFragmentVectorIndex.query}): the matched record's scope-qualified
+ * {@link IEdgeTarget | address} and the backend's similarity score (higher = more
+ * similar; the exact scale is backend-defined). Hits are returned in descending
+ * score order.
  *
  * @remarks
  * The address is a `(scope, id)` pair, NOT a bare {@link MemoryId} — per-scope
@@ -12,6 +27,10 @@ import { IEdgeTarget, IMemoryRecord } from '../types';
  * stem under different scopes, so a bare id could not disambiguate two records
  * that share a stem. The caller re-resolves the hit against the record index by
  * the same scoped address.
+ *
+ * `locator` is present only on hits from a {@link IFragmentVectorIndex} — it
+ * identifies WHICH fragment of the record matched. Record-granular
+ * {@link IVectorIndex} hits omit it.
  * @public
  */
 export interface IVectorQueryHit {
@@ -19,6 +38,8 @@ export interface IVectorQueryHit {
     readonly target: IEdgeTarget;
     /** Backend similarity score; higher is more similar. */
     readonly score: number;
+    /** The matched fragment's in-record span; present only for fragment-index hits. */
+    readonly locator?: IFragmentLocator;
 }
 /**
  * The vector-index seam an embedding backend implements to make
@@ -55,6 +76,57 @@ export interface IVectorIndex {
      */
     query(vector: Float32Array, topK: number): Promise<Result<ReadonlyArray<IVectorQueryHit>>>;
 }
+/**
+ * One embedded fragment of a record: its in-record {@link IFragmentLocator | span}
+ * and the vector for that span. Produced by a {@link FragmentEmbedder} and stored
+ * via {@link IFragmentVectorIndex.addFragments}.
+ * @public
+ */
+export interface IEmbeddedFragment {
+    /** The fragment's in-record span. */
+    readonly locator: IFragmentLocator;
+    /** The embedding vector for that span. */
+    readonly vector: Float32Array;
+}
+/**
+ * The fragment-granular sibling of {@link IVectorIndex}: instead of one vector per
+ * record it holds many vectors per record, each tagged with an in-record
+ * {@link IFragmentLocator}, and its `query` returns per-fragment hits carrying that
+ * locator. This is the seam behind sub-document semantic search — the "discovery"
+ * half of a search-then-read contract, where a hit's `(target, locator)` tells the
+ * consumer which record AND which span to read.
+ *
+ * @remarks
+ * Deliberately NOT `extends IVectorIndex`: an index keyed by `(target, locator)`
+ * has no well-defined single-vector `add(target, vector)`. It is a parallel
+ * contract with three operations — `addFragments`, `remove`, `query` — reusing
+ * {@link IVectorQueryHit} (whose `locator` is always populated here). Kept distinct
+ * from the record-granular index per the consumer contract: memory recall stays
+ * record-granular; sub-document knowledge uses a separate fragment index.
+ * @public
+ */
+export interface IFragmentVectorIndex {
+    /**
+     * Add (or replace) all fragments for the scope-qualified `target`. Whole-record
+     * semantics: every fragment previously held for `target` is dropped and replaced
+     * by `fragments`, so a re-authored document never leaves stale fragments behind.
+     * Returns the number of fragments now held for the record.
+     */
+    addFragments(target: IEdgeTarget, fragments: ReadonlyArray<IEmbeddedFragment>): Promise<Result<number>>;
+    /**
+     * Remove every fragment for the scope-qualified `target`. Returns the removed
+     * target. Idempotent — removing a target with no fragments still succeeds.
+     */
+    remove(target: IEdgeTarget): Promise<Result<IEdgeTarget>>;
+    /**
+     * Return the `topK` nearest fragments to `vector`, in descending score order,
+     * each hit carrying its record `target` and fragment `locator`. When
+     * `maxPerRecord` is supplied, no more than that many fragments of any single
+     * record appear in the result — the cap is applied during selection (before the
+     * `topK` cut) so one long document cannot crowd out others.
+     */
+    query(vector: Float32Array, topK: number, maxPerRecord?: number): Promise<Result<ReadonlyArray<IVectorQueryHit>>>;
+}
 /**
  * Embeds a complete record into a vector for the store's embed-on-write hook.
  * Async and `Result`-returning, since a real embedder does a network call (cloud
@@ -63,6 +135,15 @@ export interface IVectorIndex {
  * @public
  */
 export type MemoryEmbedder = (record: IMemoryRecord<unknown>) => Promise<Result<Float32Array>>;
+/**
+ * The fragment-granular sibling of {@link MemoryEmbedder}: chunks a record's body
+ * and embeds each chunk, returning one {@link IEmbeddedFragment} per chunk. The
+ * chunking policy (window size, overlap) lives entirely in the consumer's embedder
+ * — the core stays chunking-agnostic, exactly as it stays embedder-agnostic for
+ * the record-granular path. Used by the store's fragment-embed-on-write hook.
+ * @public
+ */
+export type FragmentEmbedder = (record: IMemoryRecord<unknown>) => Promise<Result<ReadonlyArray<IEmbeddedFragment>>>;
 /**
  * A record paired with its scope-qualified {@link IEdgeTarget | address}, as
  * yielded by {@link IMemoryRecordSource.list}. The address is required because

package/lib/packlets/vector/vectorIndex.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"vectorIndex.d.ts","sourceRoot":"","sources":["../../../src/packlets/vector/vectorIndex.ts"],"names":[],"mappings":"AAKA,OAAO,EAAE,MAAM,EAAE,MAAM,eAAe,CAAC;AACvC,OAAO,EAAE,WAAW,EAAE,aAAa,EAAE,MAAM,UAAU,CAAC;AAEtD;;;;;;;;;;;;;GAaG;AACH,MAAM,WAAW,eAAe;IAC9B,yDAAyD;IACzD,QAAQ,CAAC,MAAM,EAAE,WAAW,CAAC;IAC7B,wDAAwD;IACxD,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;CACxB;AAED;;;;;;;;;;;;;;GAcG;AACH,MAAM,WAAW,YAAY;IAC3B;;;;;;OAMG;IACH,GAAG,CAAC,MAAM,EAAE,WAAW,EAAE,MAAM,EAAE,YAAY,GAAG,OAAO,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC;IAExE;;;;OAIG;IACH,MAAM,CAAC,MAAM,EAAE,WAAW,GAAG,OAAO,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC,CAAC;IAE1D;;OAEG;IACH,KAAK,CAAC,MAAM,EAAE,YAAY,EAAE,IAAI,EAAE,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC,aAAa,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;CAC5F;AAED;;;;;;GAMG;AACH,MAAM,MAAM,cAAc,GAAG,CAAC,MAAM,EAAE,aAAa,CAAC,OAAO,CAAC,KAAK,OAAO,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC,CAAC;AAE/F;;;;;;;GAOG;AACH,MAAM,WAAW,mBAAmB;IAClC,0DAA0D;IAC1D,QAAQ,CAAC,MAAM,EAAE,WAAW,CAAC;IAC7B,iDAAiD;IACjD,QAAQ,CAAC,MAAM,EAAE,aAAa,CAAC,OAAO,CAAC,CAAC;CACzC;AAED;;;;;;;;;GASG;AACH,MAAM,WAAW,mBAAmB;IAClC,2EAA2E;IAC3E,IAAI,IAAI,OAAO,CAAC,MAAM,CAAC,aAAa,CAAC,mBAAmB,CAAC,CAAC,CAAC,CAAC;CAC7D"}
+{"version":3,"file":"vectorIndex.d.ts","sourceRoot":"","sources":["../../../src/packlets/vector/vectorIndex.ts"],"names":[],"mappings":"AAKA,OAAO,EAAE,MAAM,EAAE,MAAM,eAAe,CAAC;AACvC,OAAO,EAAE,WAAW,EAAE,aAAa,EAAE,MAAM,UAAU,CAAC;AAEtD;;;;;;;GAOG;AACH,MAAM,WAAW,gBAAgB;IAC/B,mDAAmD;IACnD,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,iDAAiD;IACjD,QAAQ,CAAC,GAAG,EAAE,MAAM,CAAC;CACtB;AAED;;;;;;;;;;;;;;;;;;GAkBG;AACH,MAAM,WAAW,eAAe;IAC9B,yDAAyD;IACzD,QAAQ,CAAC,MAAM,EAAE,WAAW,CAAC;IAC7B,wDAAwD;IACxD,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,mFAAmF;IACnF,QAAQ,CAAC,OAAO,CAAC,EAAE,gBAAgB,CAAC;CACrC;AAED;;;;;;;;;;;;;;GAcG;AACH,MAAM,WAAW,YAAY;IAC3B;;;;;;OAMG;IACH,GAAG,CAAC,MAAM,EAAE,WAAW,EAAE,MAAM,EAAE,YAAY,GAAG,OAAO,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC;IAExE;;;;OAIG;IACH,MAAM,CAAC,MAAM,EAAE,WAAW,GAAG,OAAO,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC,CAAC;IAE1D;;OAEG;IACH,KAAK,CAAC,MAAM,EAAE,YAAY,EAAE,IAAI,EAAE,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC,aAAa,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;CAC5F;AAED;;;;;GAKG;AACH,MAAM,WAAW,iBAAiB;IAChC,qCAAqC;IACrC,QAAQ,CAAC,OAAO,EAAE,gBAAgB,CAAC;IACnC,0CAA0C;IAC1C,QAAQ,CAAC,MAAM,EAAE,YAAY,CAAC;CAC/B;AAED;;;;;;;;;;;;;;;;GAgBG;AACH,MAAM,WAAW,oBAAoB;IACnC;;;;;OAKG;IACH,YAAY,CAAC,MAAM,EAAE,WAAW,EAAE,SAAS,EAAE,aAAa,CAAC,iBAAiB,CAAC,GAAG,OAAO,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC;IAExG;;;OAGG;IACH,MAAM,CAAC,MAAM,EAAE,WAAW,GAAG,OAAO,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC,CAAC;IAE1D;;;;;;OAMG;IACH,KAAK,CACH,MAAM,EAAE,YAAY,EACpB,IAAI,EAAE,MAAM,EACZ,YAAY,CAAC,EAAE,MAAM,GACpB,OAAO,CAAC,MAAM,CAAC,aAAa,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;CACpD;AAED;;;;;;GAMG;AACH,MAAM,MAAM,cAAc,GAAG,CAAC,MAAM,EAAE,aAAa,CAAC,OAAO,CAAC,KAAK,OAAO,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC,CAAC;AAE/F;;;;;;;GAOG;AACH,MAAM,MAAM,gBAAgB,GAAG,CAC7B,MAAM,EAAE,aAAa,CAAC,OAAO,CAAC,KAC3B,OAAO,CAAC,MAAM,CAAC,aAAa,CAAC,iBAAiB,CAAC,CAAC,CAAC,CAAC;AAEvD;;;;;;;GAOG;AACH,MAAM,WAAW,mBAAmB;IAClC,0DAA0D;IAC1D,QAAQ,CAAC,MAAM,EAAE,WAAW,CAAC;IAC7B,iDAAiD;IACjD,QAAQ,CAAC,MAAM,EAAE,aAAa,CAAC,OAAO,CAAC,CAAC;CACzC;AAED;;;;;;;;;GASG;AACH,MAAM,WAAW,mBAAmB;IAClC,2EAA2E;IAC3E,IAAI,IAAI,OAAO,CAAC,MAAM,CAAC,aAAa,CAAC,mBAAmB,CAAC,CAAC,CAAC,CAAC;CAC7D"}

package/lib/packlets/vector/vectorIndex.js.map

@@ -1 +1 @@
-{"version":3,"file":"vectorIndex.js","sourceRoot":"","sources":["../../../src/packlets/vector/vectorIndex.ts"],"names":[],"mappings":";AAAA;;;GAGG","sourcesContent":["/*\n * Copyright (c) 2026 Erik Fortune\n * SPDX-License-Identifier: MIT\n */\n\nimport { Result } from '@fgv/ts-utils';\nimport { IEdgeTarget, IMemoryRecord } from '../types';\n\n/**\n * A single hit returned by {@link IVectorIndex.query}: the matched record's\n * scope-qualified {@link IEdgeTarget | address} and the backend's similarity\n * score (higher = more similar; the exact scale is backend-defined). Hits are\n * returned in descending score order.\n *\n * @remarks\n * The address is a `(scope, id)` pair, NOT a bare {@link MemoryId} — per-scope\n * codecs (e.g. the medium-term codec's `turn-<n>` stems) legally mint the same\n * stem under different scopes, so a bare id could not disambiguate two records\n * that share a stem. The caller re-resolves the hit against the record index by\n * the same scoped address.\n * @public\n */\nexport interface IVectorQueryHit {\n  /** The scope-qualified address of the matched record. */\n  readonly target: IEdgeTarget;\n  /** Backend similarity score; higher is more similar. */\n  readonly score: number;\n}\n\n/**\n * The vector-index seam an embedding backend implements to make\n * {@link SemanticRetriever | semantic recall} operational.\n *\n * @remarks\n * Vectors cross this seam as `Float32Array` (the in-memory representation an\n * embedding model produces); `number[]` is reserved for the JSON-wire edges\n * (e.g. a provider's embedding response). The in-package brute-force cosine\n * implementation is {@link InMemoryCosineIndex}; a consumer can swap an external\n * ANN backend behind the same seam once N grows beyond the in-memory regime.\n *\n * Every operation returns a `Result` (async, since a real backend does I/O) so\n * failure is explicit and never throws across the seam.\n * @public\n */\nexport interface IVectorIndex {\n  /**\n   * Add (or replace) the embedding for the scope-qualified `target`. Returns the\n   * opaque {@link IMemoryEnvelope.embeddingRef | embeddingRef} the store stamps\n   * onto the envelope so a later read knows the record is embedded. Keying on the\n   * `(scope, id)` address (not a bare id) is load-bearing: two records that share\n   * a filename stem across scopes must not clobber each other's embedding.\n   */\n  add(target: IEdgeTarget, vector: Float32Array): Promise<Result<string>>;\n\n  /**\n   * Remove the embedding for the scope-qualified `target`. Returns the removed\n   * target. Idempotent — removing a target with no embedding still succeeds\n   * (returns the target).\n   */\n  remove(target: IEdgeTarget): Promise<Result<IEdgeTarget>>;\n\n  /**\n   * Return the `topK` nearest records to `vector`, in descending score order.\n   */\n  query(vector: Float32Array, topK: number): Promise<Result<ReadonlyArray<IVectorQueryHit>>>;\n}\n\n/**\n * Embeds a complete record into a vector for the store's embed-on-write hook.\n * Async and `Result`-returning, since a real embedder does a network call (cloud\n * provider) or in-process model inference. The consumer wires this — the core\n * package never calls an embedding provider directly, staying embedder-agnostic.\n * @public\n */\nexport type MemoryEmbedder = (record: IMemoryRecord<unknown>) => Promise<Result<Float32Array>>;\n\n/**\n * A record paired with its scope-qualified {@link IEdgeTarget | address}, as\n * yielded by {@link IMemoryRecordSource.list}. The address is required because\n * {@link InMemoryCosineIndex.rebuild} keys each re-embedded entry on the\n * scope-qualified target, not a bare {@link MemoryId} — two records that share a\n * filename stem across scopes must not collide when the whole vault is re-indexed.\n * @public\n */\nexport interface IScopedMemoryRecord {\n  /** The record's scope-qualified `(scope, id)` address. */\n  readonly target: IEdgeTarget;\n  /** The record itself, passed to the embedder. */\n  readonly record: IMemoryRecord<unknown>;\n}\n\n/**\n * The minimal record-source surface {@link InMemoryCosineIndex.rebuild} reads to\n * re-embed an entire vault. Each entry carries the record's scope-qualified\n * address (see {@link IScopedMemoryRecord}) so the rebuild keys the vector index\n * exactly as the incremental embed-on-write path does. A consumer backs this with\n * the store's scoped index — the vector packlet does not import the store packlet\n * (which depends on the vector packlet for {@link IVectorIndex}, so the reverse\n * import would be a cycle).\n * @public\n */\nexport interface IMemoryRecordSource {\n  /** List every record in the vault, each paired with its scoped address. */\n  list(): Promise<Result<ReadonlyArray<IScopedMemoryRecord>>>;\n}\n"]}
+{"version":3,"file":"vectorIndex.js","sourceRoot":"","sources":["../../../src/packlets/vector/vectorIndex.ts"],"names":[],"mappings":";AAAA;;;GAGG","sourcesContent":["/*\n * Copyright (c) 2026 Erik Fortune\n * SPDX-License-Identifier: MIT\n */\n\nimport { Result } from '@fgv/ts-utils';\nimport { IEdgeTarget, IMemoryRecord } from '../types';\n\n/**\n * A half-open `[start, end)` span into a record's body — the in-record locator a\n * {@link IFragmentVectorIndex} carries on each fragment hit. `start` is inclusive,\n * `end` exclusive. The unit (character / byte / token offsets) is the consumer's\n * choice: the index stores the two integers opaquely and never interprets them,\n * so they line up with whatever locator the consumer's own read side uses.\n * @public\n */\nexport interface IFragmentLocator {\n  /** Inclusive start offset into the record body. */\n  readonly start: number;\n  /** Exclusive end offset into the record body. */\n  readonly end: number;\n}\n\n/**\n * A single hit returned by {@link IVectorIndex.query} (or\n * {@link IFragmentVectorIndex.query}): the matched record's scope-qualified\n * {@link IEdgeTarget | address} and the backend's similarity score (higher = more\n * similar; the exact scale is backend-defined). Hits are returned in descending\n * score order.\n *\n * @remarks\n * The address is a `(scope, id)` pair, NOT a bare {@link MemoryId} — per-scope\n * codecs (e.g. the medium-term codec's `turn-<n>` stems) legally mint the same\n * stem under different scopes, so a bare id could not disambiguate two records\n * that share a stem. The caller re-resolves the hit against the record index by\n * the same scoped address.\n *\n * `locator` is present only on hits from a {@link IFragmentVectorIndex} — it\n * identifies WHICH fragment of the record matched. Record-granular\n * {@link IVectorIndex} hits omit it.\n * @public\n */\nexport interface IVectorQueryHit {\n  /** The scope-qualified address of the matched record. */\n  readonly target: IEdgeTarget;\n  /** Backend similarity score; higher is more similar. */\n  readonly score: number;\n  /** The matched fragment's in-record span; present only for fragment-index hits. */\n  readonly locator?: IFragmentLocator;\n}\n\n/**\n * The vector-index seam an embedding backend implements to make\n * {@link SemanticRetriever | semantic recall} operational.\n *\n * @remarks\n * Vectors cross this seam as `Float32Array` (the in-memory representation an\n * embedding model produces); `number[]` is reserved for the JSON-wire edges\n * (e.g. a provider's embedding response). The in-package brute-force cosine\n * implementation is {@link InMemoryCosineIndex}; a consumer can swap an external\n * ANN backend behind the same seam once N grows beyond the in-memory regime.\n *\n * Every operation returns a `Result` (async, since a real backend does I/O) so\n * failure is explicit and never throws across the seam.\n * @public\n */\nexport interface IVectorIndex {\n  /**\n   * Add (or replace) the embedding for the scope-qualified `target`. Returns the\n   * opaque {@link IMemoryEnvelope.embeddingRef | embeddingRef} the store stamps\n   * onto the envelope so a later read knows the record is embedded. Keying on the\n   * `(scope, id)` address (not a bare id) is load-bearing: two records that share\n   * a filename stem across scopes must not clobber each other's embedding.\n   */\n  add(target: IEdgeTarget, vector: Float32Array): Promise<Result<string>>;\n\n  /**\n   * Remove the embedding for the scope-qualified `target`. Returns the removed\n   * target. Idempotent — removing a target with no embedding still succeeds\n   * (returns the target).\n   */\n  remove(target: IEdgeTarget): Promise<Result<IEdgeTarget>>;\n\n  /**\n   * Return the `topK` nearest records to `vector`, in descending score order.\n   */\n  query(vector: Float32Array, topK: number): Promise<Result<ReadonlyArray<IVectorQueryHit>>>;\n}\n\n/**\n * One embedded fragment of a record: its in-record {@link IFragmentLocator | span}\n * and the vector for that span. Produced by a {@link FragmentEmbedder} and stored\n * via {@link IFragmentVectorIndex.addFragments}.\n * @public\n */\nexport interface IEmbeddedFragment {\n  /** The fragment's in-record span. */\n  readonly locator: IFragmentLocator;\n  /** The embedding vector for that span. */\n  readonly vector: Float32Array;\n}\n\n/**\n * The fragment-granular sibling of {@link IVectorIndex}: instead of one vector per\n * record it holds many vectors per record, each tagged with an in-record\n * {@link IFragmentLocator}, and its `query` returns per-fragment hits carrying that\n * locator. This is the seam behind sub-document semantic search — the \"discovery\"\n * half of a search-then-read contract, where a hit's `(target, locator)` tells the\n * consumer which record AND which span to read.\n *\n * @remarks\n * Deliberately NOT `extends IVectorIndex`: an index keyed by `(target, locator)`\n * has no well-defined single-vector `add(target, vector)`. It is a parallel\n * contract with three operations — `addFragments`, `remove`, `query` — reusing\n * {@link IVectorQueryHit} (whose `locator` is always populated here). Kept distinct\n * from the record-granular index per the consumer contract: memory recall stays\n * record-granular; sub-document knowledge uses a separate fragment index.\n * @public\n */\nexport interface IFragmentVectorIndex {\n  /**\n   * Add (or replace) all fragments for the scope-qualified `target`. Whole-record\n   * semantics: every fragment previously held for `target` is dropped and replaced\n   * by `fragments`, so a re-authored document never leaves stale fragments behind.\n   * Returns the number of fragments now held for the record.\n   */\n  addFragments(target: IEdgeTarget, fragments: ReadonlyArray<IEmbeddedFragment>): Promise<Result<number>>;\n\n  /**\n   * Remove every fragment for the scope-qualified `target`. Returns the removed\n   * target. Idempotent — removing a target with no fragments still succeeds.\n   */\n  remove(target: IEdgeTarget): Promise<Result<IEdgeTarget>>;\n\n  /**\n   * Return the `topK` nearest fragments to `vector`, in descending score order,\n   * each hit carrying its record `target` and fragment `locator`. When\n   * `maxPerRecord` is supplied, no more than that many fragments of any single\n   * record appear in the result — the cap is applied during selection (before the\n   * `topK` cut) so one long document cannot crowd out others.\n   */\n  query(\n    vector: Float32Array,\n    topK: number,\n    maxPerRecord?: number\n  ): Promise<Result<ReadonlyArray<IVectorQueryHit>>>;\n}\n\n/**\n * Embeds a complete record into a vector for the store's embed-on-write hook.\n * Async and `Result`-returning, since a real embedder does a network call (cloud\n * provider) or in-process model inference. The consumer wires this — the core\n * package never calls an embedding provider directly, staying embedder-agnostic.\n * @public\n */\nexport type MemoryEmbedder = (record: IMemoryRecord<unknown>) => Promise<Result<Float32Array>>;\n\n/**\n * The fragment-granular sibling of {@link MemoryEmbedder}: chunks a record's body\n * and embeds each chunk, returning one {@link IEmbeddedFragment} per chunk. The\n * chunking policy (window size, overlap) lives entirely in the consumer's embedder\n * — the core stays chunking-agnostic, exactly as it stays embedder-agnostic for\n * the record-granular path. Used by the store's fragment-embed-on-write hook.\n * @public\n */\nexport type FragmentEmbedder = (\n  record: IMemoryRecord<unknown>\n) => Promise<Result<ReadonlyArray<IEmbeddedFragment>>>;\n\n/**\n * A record paired with its scope-qualified {@link IEdgeTarget | address}, as\n * yielded by {@link IMemoryRecordSource.list}. The address is required because\n * {@link InMemoryCosineIndex.rebuild} keys each re-embedded entry on the\n * scope-qualified target, not a bare {@link MemoryId} — two records that share a\n * filename stem across scopes must not collide when the whole vault is re-indexed.\n * @public\n */\nexport interface IScopedMemoryRecord {\n  /** The record's scope-qualified `(scope, id)` address. */\n  readonly target: IEdgeTarget;\n  /** The record itself, passed to the embedder. */\n  readonly record: IMemoryRecord<unknown>;\n}\n\n/**\n * The minimal record-source surface {@link InMemoryCosineIndex.rebuild} reads to\n * re-embed an entire vault. Each entry carries the record's scope-qualified\n * address (see {@link IScopedMemoryRecord}) so the rebuild keys the vector index\n * exactly as the incremental embed-on-write path does. A consumer backs this with\n * the store's scoped index — the vector packlet does not import the store packlet\n * (which depends on the vector packlet for {@link IVectorIndex}, so the reverse\n * import would be a cycle).\n * @public\n */\nexport interface IMemoryRecordSource {\n  /** List every record in the vault, each paired with its scoped address. */\n  list(): Promise<Result<ReadonlyArray<IScopedMemoryRecord>>>;\n}\n"]}

package/lib/test/unit/retrieve/fragmentSemanticRetriever.test.d.ts

@@ -0,0 +1,2 @@
+import '@fgv/ts-utils-jest';
+//# sourceMappingURL=fragmentSemanticRetriever.test.d.ts.map

package/lib/test/unit/retrieve/fragmentSemanticRetriever.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"fragmentSemanticRetriever.test.d.ts","sourceRoot":"","sources":["../../../../src/test/unit/retrieve/fragmentSemanticRetriever.test.ts"],"names":[],"mappings":"AAKA,OAAO,oBAAoB,CAAC"}

package/lib/test/unit/retrieve/fragmentSemanticRetriever.test.js

@@ -0,0 +1,118 @@
+"use strict";
+/*
+ * Copyright (c) 2026 Erik Fortune
+ * SPDX-License-Identifier: MIT
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+require("@fgv/ts-utils-jest");
+const ts_utils_1 = require("@fgv/ts-utils");
+const index_1 = require("../../../index");
+function target(scope, id) {
+    return { scope: scope, id: id };
+}
+function loc(start, end) {
+    return { start, end };
+}
+function hit(scope, id, start, end, score) {
+    return { target: target(scope, id), score, locator: loc(start, end) };
+}
+const okEmbed = () => Promise.resolve((0, ts_utils_1.succeed)(Float32Array.from([0.1, 0.2])));
+/** A scripted fragment index that records the args it was queried with. */
+class FakeFragmentIndex {
+    constructor(hits, shouldFail = false) {
+        this._hits = hits;
+        this._fail = shouldFail;
+    }
+    addFragments(__t, fragments) {
+        return Promise.resolve((0, ts_utils_1.succeed)(fragments.length));
+    }
+    remove(t) {
+        return Promise.resolve((0, ts_utils_1.succeed)(t));
+    }
+    query(__vector, topK, maxPerRecord) {
+        this.lastTopK = topK;
+        this.lastMaxPerRecord = maxPerRecord;
+        return Promise.resolve(this._fail ? (0, ts_utils_1.fail)('fragment backend down') : (0, ts_utils_1.succeed)(this._hits));
+    }
+}
+describe('FragmentSemanticRetriever', () => {
+    test('reports supportsFragmentRecall=false when no backend is wired', () => {
+        const r = index_1.FragmentSemanticRetriever.create({}).orThrow();
+        expect(r.capabilities.supportsFragmentRecall).toBe(false);
+    });
+    test('reports supportsFragmentRecall=true when a backend is wired', () => {
+        const r = index_1.FragmentSemanticRetriever.create({
+            backend: { fragmentIndex: new FakeFragmentIndex([]), embedQuery: okEmbed }
+        }).orThrow();
+        expect(r.capabilities.supportsFragmentRecall).toBe(true);
+    });
+    test('degrades loudly when no backend is wired — never a silent empty', async () => {
+        const r = index_1.FragmentSemanticRetriever.create({}).orThrow();
+        expect(await r.retrieve({ semantic: 'hi' })).toFailWith(index_1.FRAGMENT_SEMANTIC_UNWIRED_MESSAGE);
+    });
+    test('returns the per-fragment hits (target + locator + score) in backend order', async () => {
+        const hits = [hit('knowledge', 'doc-a', 0, 5, 0.9), hit('knowledge', 'doc-a', 20, 25, 0.4)];
+        const r = index_1.FragmentSemanticRetriever.create({
+            backend: { fragmentIndex: new FakeFragmentIndex(hits), embedQuery: okEmbed }
+        }).orThrow();
+        expect(await r.retrieve({ semantic: 'q' })).toSucceedAndSatisfy((result) => {
+            expect(result).toEqual(hits);
+            expect(result[0].locator).toEqual(loc(0, 5));
+            expect(result[1].locator).toEqual(loc(20, 25));
+        });
+    });
+    test('forwards topK and maxPerRecord to the fragment index', async () => {
+        const fragmentIndex = new FakeFragmentIndex([hit('knowledge', 'doc-a', 0, 5, 0.9)]);
+        const r = index_1.FragmentSemanticRetriever.create({
+            backend: { fragmentIndex, embedQuery: okEmbed }
+        }).orThrow();
+        expect(await r.retrieve({ semantic: 'q', topK: 3, maxPerRecord: 1 })).toSucceed();
+        expect(fragmentIndex.lastTopK).toBe(3);
+        expect(fragmentIndex.lastMaxPerRecord).toBe(1);
+    });
+    test('defaults topK to 10 and leaves maxPerRecord undefined when the query omits them', async () => {
+        const fragmentIndex = new FakeFragmentIndex([hit('knowledge', 'doc-a', 0, 5, 0.9)]);
+        const r = index_1.FragmentSemanticRetriever.create({
+            backend: { fragmentIndex, embedQuery: okEmbed }
+        }).orThrow();
+        expect(await r.retrieve({ semantic: 'q' })).toSucceed();
+        expect(fragmentIndex.lastTopK).toBe(10);
+        expect(fragmentIndex.lastMaxPerRecord).toBeUndefined();
+    });
+    test('fails loudly when the embedder fails', async () => {
+        const r = index_1.FragmentSemanticRetriever.create({
+            backend: {
+                fragmentIndex: new FakeFragmentIndex([]),
+                embedQuery: () => Promise.resolve((0, ts_utils_1.fail)('no embed model'))
+            }
+        }).orThrow();
+        expect(await r.retrieve({ semantic: 'q' })).toFailWith(/fragment recall: query embedding failed: no embed model/i);
+    });
+    test('fails loudly when the fragment backend fails', async () => {
+        const r = index_1.FragmentSemanticRetriever.create({
+            backend: { fragmentIndex: new FakeFragmentIndex([], true), embedQuery: okEmbed }
+        }).orThrow();
+        expect(await r.retrieve({ semantic: 'q' })).toFailWith(/fragment recall: fragment query failed: fragment backend down/i);
+    });
+    test('normalizes a rejecting embedder into a Failure (never escapes as a rejection)', async () => {
+        const r = index_1.FragmentSemanticRetriever.create({
+            backend: {
+                fragmentIndex: new FakeFragmentIndex([]),
+                embedQuery: () => Promise.reject(new Error('embedder blew up'))
+            }
+        }).orThrow();
+        expect(await r.retrieve({ semantic: 'q' })).toFailWith(/fragment recall: query embedding failed: .*embedder blew up/i);
+    });
+    test('normalizes a rejecting fragment backend into a Failure', async () => {
+        const rejectingIndex = {
+            addFragments: (__t, f) => Promise.resolve((0, ts_utils_1.succeed)(f.length)),
+            remove: (t) => Promise.resolve((0, ts_utils_1.succeed)(t)),
+            query: () => Promise.reject(new Error('socket hangup'))
+        };
+        const r = index_1.FragmentSemanticRetriever.create({
+            backend: { fragmentIndex: rejectingIndex, embedQuery: okEmbed }
+        }).orThrow();
+        expect(await r.retrieve({ semantic: 'q' })).toFailWith(/fragment recall: fragment query failed: .*socket hangup/i);
+    });
+});
+//# sourceMappingURL=fragmentSemanticRetriever.test.js.map