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

package/src/packlets/vector/inMemoryCosineIndex.ts

@@ -1,196 +0,0 @@
-/*
- * Copyright (c) 2026 Erik Fortune
- * SPDX-License-Identifier: MIT
- */
-
-import { Result, fail, succeed } from '@fgv/ts-utils';
-import { IEdgeTarget, edgeTargetKey } from '../types';
-import {
-  IMemoryRecordSource,
-  IScopedMemoryRecord,
-  IVectorIndex,
-  IVectorQueryHit,
-  MemoryEmbedder
-} from './vectorIndex';
-
-/** One stored embedding: the scope-qualified address plus its vector. */
-interface IStoredVector {
-  readonly target: IEdgeTarget;
-  readonly vector: Float32Array;
-}
-
-/**
- * The brute-force, in-memory cosine {@link IVectorIndex}. Stores one
- * `Float32Array` per record and answers a query by computing cosine similarity
- * against every stored vector, returning the top-k by descending score.
- *
- * @remarks
- * This is the **complete** vector implementation for the fgv regime — large-N is
- * explicitly out of scope (the seam stays open for a consumer to swap an external
- * ANN backend once N grows beyond "thousands of records"). No external dependency
- * and no ANN structure: a linear scan over a few thousand vectors is well within
- * an interactive budget.
- *
- * The index has a single dimension established by the first vector added; every
- * subsequent `add` and every `query` vector must match that dimension or fail
- * loudly — a mismatched dimension is an embedder-wiring bug, never a silent
- * zero-similarity result. {@link InMemoryCosineIndex.rebuild | rebuild} clears
- * the index, so a re-embed with a different model (hence dimension) is supported.
- *
- * Persistence (a JSON sidecar) is deliberately out of scope for this layer — the
- * index is in-memory and rebuilt from the store via `rebuild`; a sidecar is a
- * future nicety.
- * @public
- */
-export class InMemoryCosineIndex implements IVectorIndex {
-  /**
-   * Stored embeddings 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.
-   */
-  private readonly _vectors: Map<string, IStoredVector>;
-  /** The dimension of every stored vector; `undefined` until the first `add`. */
-  private _dimension: number | undefined;
-
-  private constructor() {
-    this._vectors = new Map<string, IStoredVector>();
-    this._dimension = undefined;
-  }
-
-  /** The number of vectors currently held. */
-  public get size(): number {
-    return this._vectors.size;
-  }
-
-  /** Family-convention factory. */
-  public static create(): Result<InMemoryCosineIndex> {
-    return succeed(new InMemoryCosineIndex());
-  }
-
-  /** {@inheritDoc IVectorIndex.add} */
-  public add(target: IEdgeTarget, vector: Float32Array): Promise<Result<string>> {
-    const key: string = edgeTargetKey(target);
-    if (vector.length === 0) {
-      return Promise.resolve(fail(`vector index: cannot add '${key}': empty vector`));
-    }
-    if (this._dimension === undefined) {
-      this._dimension = vector.length;
-    } else if (vector.length !== this._dimension) {
-      return Promise.resolve(
-        fail(
-          `vector index: cannot add '${key}': dimension ${vector.length} does not match index dimension ${this._dimension}`
-        )
-      );
-    }
-    // Defensive copy: the caller may reuse or mutate the buffer after `add`, and
-    // the index must keep serving the embedding it was given.
-    this._vectors.set(key, { target, vector: Float32Array.from(vector) });
-    // The in-memory index keys entries by the canonical scoped-target string, so
-    // that key IS the entry reference.
-    return Promise.resolve(succeed(key));
-  }
-
-  /** {@inheritDoc IVectorIndex.remove} */
-  public remove(target: IEdgeTarget): Promise<Result<IEdgeTarget>> {
-    this._vectors.delete(edgeTargetKey(target));
-    return Promise.resolve(succeed(target));
-  }
-
-  /** {@inheritDoc IVectorIndex.query} */
-  public query(vector: Float32Array, topK: number): Promise<Result<ReadonlyArray<IVectorQueryHit>>> {
-    if (topK <= 0 || this._vectors.size === 0) {
-      return Promise.resolve(succeed([]));
-    }
-    if (vector.length !== this._dimension) {
-      return Promise.resolve(
-        fail(
-          `vector index: query dimension ${vector.length} does not match index dimension ${this._dimension}`
-        )
-      );
-    }
-    const queryMagnitude: number = InMemoryCosineIndex._magnitude(vector);
-    const hits: IVectorQueryHit[] = [];
-    for (const stored of this._vectors.values()) {
-      hits.push({
-        target: stored.target,
-        score: InMemoryCosineIndex._cosine(vector, queryMagnitude, stored.vector)
-      });
-    }
-    // Descending by score; a `seq`-free tiebreak is unnecessary here because the
-    // caller (SemanticRetriever) re-resolves hits against the record index.
-    hits.sort((a, b) => b.score - a.score);
-    return Promise.resolve(succeed(hits.length > topK ? hits.slice(0, topK) : hits));
-  }
-
-  /**
-   * Re-embed every record from `source` and rebuild the index from scratch.
-   * Clears the current contents (and the established dimension) first, so a
-   * re-embed with a different model is supported. Returns the number of vectors
-   * indexed.
-   *
-   * On any failure (list, embed, or add) the index is rolled back to empty
-   * rather than left in a partially-rebuilt state — a caller that retries a query
-   * after a failed rebuild sees a clean empty index, never a half-populated one.
-   *
-   * @param source - The scope-qualified record source to re-embed.
-   * @param embed - The embedder applied to each record.
-   */
-  public async rebuild(source: IMemoryRecordSource, embed: MemoryEmbedder): Promise<Result<number>> {
-    // Reset up front so the "any failure leaves the index empty" contract holds
-    // even when the listing itself fails (no stale vectors survive a failed
-    // rebuild).
-    this._reset();
-    const listed: Result<ReadonlyArray<IScopedMemoryRecord>> = await source.list();
-    if (listed.isFailure()) {
-      return fail(`vector index rebuild: failed to list records: ${listed.message}`);
-    }
-    for (const scoped of listed.value) {
-      const embedded: Result<Float32Array> = await embed(scoped.record);
-      if (embedded.isFailure()) {
-        this._reset();
-        return fail(
-          `vector index rebuild: embedding '${edgeTargetKey(scoped.target)}' failed: ${embedded.message}`
-        );
-      }
-      const added: Result<string> = await this.add(scoped.target, embedded.value);
-      if (added.isFailure()) {
-        this._reset();
-        return fail(`vector index rebuild: ${added.message}`);
-      }
-    }
-    return succeed(this._vectors.size);
-  }
-
-  /** Empty the index and forget the established dimension. */
-  private _reset(): void {
-    this._vectors.clear();
-    this._dimension = undefined;
-  }
-
-  /** The Euclidean magnitude (L2 norm) of a vector. */
-  private static _magnitude(vector: Float32Array): number {
-    let sum: number = 0;
-    for (let i: number = 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 vector. A zero-magnitude vector on
-   * either side yields `0` rather than `NaN` — a degenerate vector is simply
-   * maximally dissimilar, not an error.
-   */
-  private static _cosine(query: Float32Array, queryMagnitude: number, stored: Float32Array): number {
-    const storedMagnitude: number = InMemoryCosineIndex._magnitude(stored);
-    if (queryMagnitude === 0 || storedMagnitude === 0) {
-      return 0;
-    }
-    let dot: number = 0;
-    for (let i: number = 0; i < query.length; i++) {
-      dot += query[i] * stored[i];
-    }
-    return dot / (queryMagnitude * storedMagnitude);
-  }
-}

package/src/packlets/vector/inMemoryFragmentCosineIndex.ts

@@ -1,289 +0,0 @@
-/*
- * Copyright (c) 2026 Erik Fortune
- * SPDX-License-Identifier: MIT
- */
-
-import { Result, fail, succeed } from '@fgv/ts-utils';
-import { IEdgeTarget, edgeTargetKey } from '../types';
-import {
-  FragmentEmbedder,
-  IEmbeddedFragment,
-  IFragmentVectorIndex,
-  IMemoryRecordSource,
-  IScopedMemoryRecord,
-  IVectorQueryHit
-} from './vectorIndex';
-
-/**
- * The identity fields a fragment was added with, already in query-hit shape: a field
- * the fragment did not carry is *absent*, never present-but-`undefined`, so a hit
- * for a fragment added without a `fragmentId` is structurally identical to one
- * produced before `fragmentId` existed.
- */
-type FragmentIdentity = Pick<IVectorQueryHit, 'locator' | 'fragmentId'>;
-
-/** Project an incoming fragment's identity fields, dropping the ones it did not carry. */
-function fragmentIdentity(fragment: IEmbeddedFragment): FragmentIdentity {
-  return {
-    ...(fragment.locator !== undefined ? { locator: fragment.locator } : {}),
-    ...(fragment.fragmentId !== undefined ? { fragmentId: fragment.fragmentId } : {})
-  };
-}
-
-/** One stored fragment: the identity it was added with plus its vector. */
-interface IStoredFragment {
-  readonly identity: FragmentIdentity;
-  readonly vector: Float32Array;
-}
-
-/** Every stored fragment for one record, tagged with the record's scoped address. */
-interface IStoredRecordFragments {
-  readonly target: IEdgeTarget;
-  readonly fragments: IStoredFragment[];
-}
-
-/** A candidate hit carried through selection: the fragment's key, hit, and score. */
-interface IScoredFragment {
-  readonly key: string;
-  readonly hit: IVectorQueryHit;
-}
-
-/**
- * The brute-force, in-memory cosine {@link IFragmentVectorIndex} — the
- * fragment-granular sibling of {@link InMemoryCosineIndex}. Stores many
- * `Float32Array`s per record (one per {@link IEmbeddedFragment | fragment}) and
- * answers a query by computing cosine similarity against every stored fragment,
- * returning the top-k fragment hits by descending score. Each hit carries back
- * whichever of {@link IFragmentLocator | locator} / `fragmentId` its fragment was
- * added with; a fragment must carry at least one of the two.
- *
- * @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 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: Map<string, IStoredRecordFragments>;
-  /** The dimension of every stored fragment vector; `undefined` until the first `add`. */
-  private _dimension: number | undefined;
-
-  private constructor() {
-    this._records = new Map<string, IStoredRecordFragments>();
-    this._dimension = undefined;
-  }
-
-  /** The number of records that currently have at least one stored fragment. */
-  public get recordCount(): number {
-    return this._records.size;
-  }
-
-  /** The total number of fragments currently held across all records. */
-  public get fragmentCount(): number {
-    let total: number = 0;
-    for (const record of this._records.values()) {
-      total += record.fragments.length;
-    }
-    return total;
-  }
-
-  /** Family-convention factory. */
-  public static create(): Result<InMemoryFragmentCosineIndex> {
-    return succeed(new InMemoryFragmentCosineIndex());
-  }
-
-  /** {@inheritDoc IFragmentVectorIndex.addFragments} */
-  public addFragments(
-    target: IEdgeTarget,
-    fragments: ReadonlyArray<IEmbeddedFragment>
-  ): Promise<Result<number>> {
-    const key: string = 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: IStoredFragment[] = [];
-    let dimension: number | undefined = this._dimension;
-    for (const fragment of fragments) {
-      if (fragment.vector.length === 0) {
-        return Promise.resolve(fail(`fragment index: cannot add '${key}': empty fragment vector`));
-      }
-      // A fragment carrying neither identity cannot be resolved back to anything by a
-      // consumer holding the hit — the same invariant `embeddedFragmentConverter`
-      // enforces at the untyped boundary, re-checked here at the index seam.
-      if (fragment.locator === undefined && fragment.fragmentId === undefined) {
-        return Promise.resolve(
-          fail(
-            `fragment index: cannot add '${key}': fragment requires at least one of 'locator' or 'fragmentId'`
-          )
-        );
-      }
-      if (dimension === undefined) {
-        dimension = fragment.vector.length;
-      } else if (fragment.vector.length !== dimension) {
-        return Promise.resolve(
-          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({ identity: fragmentIdentity(fragment), 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(succeed(stored.length));
-  }
-
-  /** {@inheritDoc IFragmentVectorIndex.remove} */
-  public remove(target: IEdgeTarget): Promise<Result<IEdgeTarget>> {
-    this._records.delete(edgeTargetKey(target));
-    return Promise.resolve(succeed(target));
-  }
-
-  /** {@inheritDoc IFragmentVectorIndex.query} */
-  public query(
-    vector: Float32Array,
-    topK: number,
-    maxPerRecord?: number
-  ): Promise<Result<ReadonlyArray<IVectorQueryHit>>> {
-    if (topK <= 0 || this._records.size === 0) {
-      return Promise.resolve(succeed([]));
-    }
-    if (vector.length !== this._dimension) {
-      return Promise.resolve(
-        fail(
-          `fragment index: query dimension ${vector.length} does not match index dimension ${this._dimension}`
-        )
-      );
-    }
-    const queryMagnitude: number = InMemoryFragmentCosineIndex._magnitude(vector);
-    const scored: IScoredFragment[] = [];
-    for (const record of this._records.values()) {
-      for (const fragment of record.fragments) {
-        scored.push({
-          key: edgeTargetKey(record.target),
-          hit: {
-            target: record.target,
-            score: InMemoryFragmentCosineIndex._cosine(vector, queryMagnitude, fragment.vector),
-            ...fragment.identity
-          }
-        });
-      }
-    }
-    // Descending by score; the caller re-resolves each `(target, locator)` hit.
-    scored.sort((a, b) => b.hit.score - a.hit.score);
-
-    const hits: IVectorQueryHit[] = [];
-    // 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: Map<string, number> = new Map<string, number>();
-    for (const candidate of scored) {
-      if (hits.length >= topK) {
-        break;
-      }
-      if (maxPerRecord !== undefined) {
-        const used: number = perRecord.get(candidate.key) ?? 0;
-        if (used >= maxPerRecord) {
-          continue;
-        }
-        perRecord.set(candidate.key, used + 1);
-      }
-      hits.push(candidate.hit);
-    }
-    return Promise.resolve(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.
-   */
-  public async rebuild(source: IMemoryRecordSource, embed: FragmentEmbedder): Promise<Result<number>> {
-    this._reset();
-    const listed: Result<ReadonlyArray<IScopedMemoryRecord>> = await source.list();
-    if (listed.isFailure()) {
-      return fail(`fragment index rebuild: failed to list records: ${listed.message}`);
-    }
-    for (const scoped of listed.value) {
-      const embedded: Result<ReadonlyArray<IEmbeddedFragment>> = await embed(scoped.record);
-      if (embedded.isFailure()) {
-        this._reset();
-        return fail(
-          `fragment index rebuild: embedding '${edgeTargetKey(scoped.target)}' failed: ${embedded.message}`
-        );
-      }
-      const added: Result<number> = await this.addFragments(scoped.target, embedded.value);
-      if (added.isFailure()) {
-        this._reset();
-        return fail(`fragment index rebuild: ${added.message}`);
-      }
-    }
-    return succeed(this.fragmentCount);
-  }
-
-  /** Empty the index and forget the established dimension. */
-  private _reset(): void {
-    this._records.clear();
-    this._dimension = undefined;
-  }
-
-  /** The Euclidean magnitude (L2 norm) of a vector. */
-  private static _magnitude(vector: Float32Array): number {
-    let sum: number = 0;
-    for (let i: number = 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`.
-   */
-  private static _cosine(query: Float32Array, queryMagnitude: number, stored: Float32Array): number {
-    const storedMagnitude: number = InMemoryFragmentCosineIndex._magnitude(stored);
-    if (queryMagnitude === 0 || storedMagnitude === 0) {
-      return 0;
-    }
-    let dot: number = 0;
-    for (let i: number = 0; i < query.length; i++) {
-      dot += query[i] * stored[i];
-    }
-    return dot / (queryMagnitude * storedMagnitude);
-  }
-}

package/src/packlets/vector/index.ts

@@ -1,9 +0,0 @@
-/*
- * Copyright (c) 2026 Erik Fortune
- * SPDX-License-Identifier: MIT
- */
-
-export * from './vectorIndex';
-export * from './fragmentConverters';
-export * from './inMemoryCosineIndex';
-export * from './inMemoryFragmentCosineIndex';