@farukada/aws-langgraph-dynamodb-ts 1.0.0-rc.1 → 1.0.0

package/dist/esm/store/internal/semantic-search.js

@@ -0,0 +1,200 @@
+import { validationError } from '../../shared/errors/errors.js';
+const EMBED_BATCH_SIZE = 100;
+export function cosineSimilarity(a, b) {
+    if (a.length !== b.length)
+        return 0;
+    let dot = 0;
+    let normA = 0;
+    let normB = 0;
+    for (let i = 0; i < a.length; i++) {
+        dot += a[i] * b[i];
+        normA += a[i] * a[i];
+        normB += b[i] * b[i];
+    }
+    if (normA === 0 || normB === 0)
+        return 0;
+    return dot / (Math.sqrt(normA) * Math.sqrt(normB));
+}
+export function extractTexts(value, fields) {
+    return fields.flatMap((field) => getTextAtPath(value, field)).filter((text) => text.length > 0);
+}
+export function extractText(value, fields) {
+    return extractTexts(value, fields).join(' ');
+}
+export function assertVectorDims(index, vector, what) {
+    const dims = index.dims;
+    if (!Number.isInteger(dims) || dims <= 0 || vector.length === dims)
+        return;
+    throw validationError(`index.embeddings returned a ${vector.length}-dimensional ${what} vector but index.dims ` +
+        `is ${dims}; the embeddings model does not match the configured index`, 'index.dims');
+}
+export async function embedValues(context, values, fieldsOverride) {
+    const index = context.index;
+    if (!index)
+        return values.map(() => undefined);
+    const fields = fieldsOverride ?? index.fields ?? ['$'];
+    const pending = [];
+    values.forEach((value, position) => {
+        const text = extractText(value, fields);
+        if (text.length > 0)
+            pending.push({ text, position });
+    });
+    const vectors = values.map(() => undefined);
+    for (let start = 0; start < pending.length; start += EMBED_BATCH_SIZE) {
+        const batch = pending.slice(start, start + EMBED_BATCH_SIZE);
+        const embedded = await index.embeddings.embedDocuments(batch.map((entry) => entry.text));
+        batch.forEach((entry, i) => {
+            assertVectorDims(index, embedded[i], 'document');
+            vectors[entry.position] = embedded[i];
+        });
+    }
+    return vectors;
+}
+export async function embedValue(context, value, fieldsOverride) {
+    return (await embedValues(context, [value], fieldsOverride))[0];
+}
+export async function embedPassages(context, value, fieldsOverride) {
+    const index = context.index;
+    if (!index)
+        return undefined;
+    const texts = extractTexts(value, fieldsOverride ?? index.fields ?? ['$']);
+    if (texts.length === 0)
+        return undefined;
+    const vectors = [];
+    for (let start = 0; start < texts.length; start += EMBED_BATCH_SIZE) {
+        const embedded = await index.embeddings.embedDocuments(texts.slice(start, start + EMBED_BATCH_SIZE));
+        for (const vector of embedded) {
+            assertVectorDims(index, vector, 'document');
+            vectors.push(vector);
+        }
+    }
+    return vectors;
+}
+function prettyText(value) {
+    let text;
+    try {
+        text = JSON.stringify(value, null, 2);
+    }
+    catch {
+        return [];
+    }
+    return text === undefined ? [] : [text];
+}
+function isScalar(value) {
+    return typeof value === 'string' || typeof value === 'number' || typeof value === 'boolean';
+}
+function leafText(value) {
+    if (isScalar(value))
+        return [String(value)];
+    if (value === null)
+        return [];
+    return prettyText(value);
+}
+function scanGroup(path, start, open, close) {
+    let depth = 1;
+    let i = start;
+    while (i < path.length && depth > 0) {
+        if (path[i] === open)
+            depth += 1;
+        else if (path[i] === close)
+            depth -= 1;
+        i += 1;
+    }
+    return i;
+}
+export function tokenizePath(path) {
+    const tokens = [];
+    let current = '';
+    const flush = () => {
+        if (current.length > 0)
+            tokens.push(current);
+        current = '';
+    };
+    let i = 0;
+    while (i < path.length) {
+        const char = path[i];
+        if (char === '[' || char === '{') {
+            flush();
+            const end = scanGroup(path, i + 1, char, char === '[' ? ']' : '}');
+            tokens.push(path.slice(i, end));
+            i = end;
+            continue;
+        }
+        if (char === '.')
+            flush();
+        else
+            current += char;
+        i += 1;
+    }
+    flush();
+    return tokens;
+}
+function groupFieldText(value, field) {
+    let current = value;
+    for (const token of tokenizePath(field)) {
+        if (current !== null && typeof current === 'object' && token in current) {
+            current = current[token];
+        }
+        else {
+            return [];
+        }
+    }
+    return isScalar(current) ? [String(current)] : prettyText(current);
+}
+function indexText(value, token, tokens, pos) {
+    if (!Array.isArray(value))
+        return [];
+    const index = token.slice(1, -1);
+    if (index === '*')
+        return value.flatMap((item) => extract(item, tokens, pos + 1));
+    let idx = Number.parseInt(index, 10);
+    if (Number.isNaN(idx))
+        return [];
+    if (idx < 0)
+        idx = value.length + idx;
+    return idx >= 0 && idx < value.length ? extract(value[idx], tokens, pos + 1) : [];
+}
+function groupText(value, token) {
+    if (typeof value !== 'object' || value === null)
+        return [];
+    const results = [];
+    for (const field of token.slice(1, -1).split(',')) {
+        const trimmed = field.trim();
+        if (tokenizePath(trimmed).length > 0)
+            results.push(...groupFieldText(value, trimmed));
+    }
+    return results;
+}
+function wildcardText(value, tokens, pos) {
+    if (Array.isArray(value))
+        return value.flatMap((item) => extract(item, tokens, pos + 1));
+    if (typeof value === 'object' && value !== null) {
+        return Object.values(value).flatMap((item) => extract(item, tokens, pos + 1));
+    }
+    return [];
+}
+function memberText(value, token, tokens, pos) {
+    if (typeof value !== 'object' || value === null || !(token in value))
+        return [];
+    return extract(value[token], tokens, pos + 1);
+}
+function extract(value, tokens, pos) {
+    if (pos >= tokens.length)
+        return leafText(value);
+    const token = tokens[pos];
+    if (token.startsWith('[') && token.endsWith(']'))
+        return indexText(value, token, tokens, pos);
+    const results = pos === 0 && token === '$' ? prettyText(value) : [];
+    if (token.startsWith('{') && token.endsWith('}'))
+        results.push(...groupText(value, token));
+    else if (token === '*')
+        results.push(...wildcardText(value, tokens, pos));
+    else
+        results.push(...memberText(value, token, tokens, pos));
+    return results;
+}
+export function getTextAtPath(value, path) {
+    if (path === '' || path === '$')
+        return prettyText(value);
+    return extract(value, tokenizePath(path), 0);
+}

package/dist/esm/store/internal/setup.d.ts

@@ -0,0 +1,96 @@
+/**
+ * Hides which options the store and its methods accept, and how the store is
+ * assembled from them.
+ *
+ * The exhaustive key list of every option bag — the constructor's, `search`'s,
+ * `listNamespaces`' — lives here, compiler-checked against its type. The
+ * store's own options are checked after the shared ones — the in-memory caps,
+ * that a vector backend comes with an index, that the index can embed, the
+ * score direction — and the context every operation receives is built with its
+ * defaults filled in.
+ */
+import type { IndexConfig, SerializerProtocol } from '@langchain/langgraph-checkpoint';
+import { type AdapterCore, type AdapterShell } from '../../shared/adapter.js';
+import type { DynamoDBStoreOptions } from '../types.js';
+import { type VectorBackend, type VectorScoreDirection } from '../vector-backend.js';
+/** Default cap on candidates the in-DB semantic ranker will score. */
+export declare const DEFAULT_MAX_SEARCH_CANDIDATES = 1000;
+/**
+ * Largest `maxSearchCandidates` an adapter accepts: this many decoded
+ * candidates are held and re-ranked in memory by one `search()` call, so an
+ * unbounded value lets a typo or hostile config hold an unbounded working set.
+ */
+export declare const MAX_SEARCH_CANDIDATES = 100000;
+/**
+ * Largest `maxScanItems` an adapter accepts: this many raw rows are collected
+ * into memory across one paginated scan/query before it errors, so — like
+ * {@link MAX_SEARCH_CANDIDATES} — an unbounded value lets a typo or hostile
+ * config hold an unbounded working set.
+ */
+export declare const MAX_SCAN_ITEMS = 1000000;
+/** Resolved collaborators shared by every store action. */
+export interface StoreContext extends AdapterCore {
+    serde: SerializerProtocol;
+    index?: IndexConfig;
+    vectorBackend?: VectorBackend;
+    vectorScoreDirection: VectorScoreDirection;
+    maxSearchCandidates: number;
+    maxScanItems: number;
+    maxIterations: number;
+}
+/** Result of wiring up a store from its options. */
+export interface StoreSetup {
+    context: StoreContext;
+    shell: AdapterShell;
+}
+/**
+ * Validate the options, then resolve the client, offloader, serializer and index.
+ *
+ * Accepts: `options` — validated first, so no half-built store exists when one
+ * is wrong. Everything optional has a default here and nowhere else, which is
+ * what lets every action read `context.x` without re-deciding what absent means.
+ *
+ * Returns: the context every action shares, and the shell that releases what
+ * it holds — a client the caller passed in is never destroyed by `destroy()`.
+ *
+ * Throws: `VALIDATION` for any invalid option, naming the option.
+ *
+ * Guarantees: constructing a store performs no I/O. The stacked-retry check is
+ * deliberately not awaited: it is a warning about a caller-supplied client, not
+ * a precondition.
+ */
+export declare function setUpStore(options: DynamoDBStoreOptions): StoreSetup;
+/**
+ * The keys of the store's constructor options, exhaustive in both directions:
+ * `allKeysOf<T>` makes omitting or inventing one a compile error, so the list
+ * cannot rot away from the type it guards. It lives with the feature because
+ * the type it is checked against does; `shared/` knows no feature. `search`'s
+ * and `listNamespaces`' options have no list: LangGraph defines them, so a key
+ * it adds is ignored rather than refused (decision record 28).
+ */
+export declare const STORE_KEYS: readonly string[];
+/**
+ * Validate the store's own options at construction; the shared ones are
+ * `openAdapter`'s, which checks them before these.
+ *
+ * A `vectorBackend` without an `index` is rejected outright rather than
+ * silently degrading: with no embeddings configured, every `put` would compute
+ * no vector and instruct the backend to *delete* the item's entry instead of
+ * indexing it, and `search()` would fall through to an unranked scan-order
+ * listing with no `.score` field and no error — a semantic query returning a
+ * normal-looking but meaningless response. `reconcileVectorIndex` already
+ * refused this exact misconfiguration.
+ *
+ * Accepts: every option the store takes. The types describe the intended
+ * shapes; this runs for the JavaScript caller the types never see, and for the
+ * combinations no type can express — a backend without an index, an `index`
+ * key `IndexConfig` does not declare, an `embeddings` object missing a method,
+ * a direction outside its union.
+ *
+ * Returns: nothing: the value is kept under its declared type, and this
+ * checks it.
+ *
+ * Throws: `VALIDATION` naming the offending option. Every failure is raised
+ * at construction, where the fix is, rather than at the first put or search.
+ */
+export declare function assertStoreOptions(options: DynamoDBStoreOptions): void;

package/dist/esm/store/internal/setup.js

@@ -0,0 +1,98 @@
+import { openAdapter } from '../../shared/adapter.js';
+import { JSON_SERDE } from '../../shared/codec/json-serde.js';
+import { MAX_LOOP_ITERATIONS, MAX_TOTAL_ROWS_IN_MEMORY } from '../../shared/dynamodb/paginate.js';
+import { validationError } from '../../shared/errors/errors.js';
+import { assertMembers, EMBEDDINGS_MEMBERS, VECTOR_BACKEND_MEMBERS, } from '../../shared/validation/collaborators.js';
+import { allKeysOf, assertShape } from '../../shared/validation/option-shape.js';
+import { assertInteger, assertStringArray } from '../../shared/validation/primitives.js';
+import { VECTOR_SCORE_DIRECTIONS, } from '../vector-backend.js';
+export const DEFAULT_MAX_SEARCH_CANDIDATES = 1000;
+export const MAX_SEARCH_CANDIDATES = 100_000;
+export const MAX_SCAN_ITEMS = 1_000_000;
+export function setUpStore(options) {
+    assertShape(options, STORE_KEYS, 'options');
+    const shell = openAdapter(options, 'store', {
+        options: () => assertStoreOptions(options),
+        collaborators: () => {
+            if (options.vectorBackend !== undefined) {
+                assertMembers(options.vectorBackend, VECTOR_BACKEND_MEMBERS, 'vectorBackend');
+            }
+        },
+    });
+    return {
+        shell,
+        context: {
+            ...shell.core,
+            serde: options.serde ?? JSON_SERDE,
+            index: options.index,
+            vectorBackend: options.vectorBackend,
+            vectorScoreDirection: options.vectorScoreDirection ?? 'relevance',
+            maxSearchCandidates: options.maxSearchCandidates ?? DEFAULT_MAX_SEARCH_CANDIDATES,
+            maxScanItems: options.maxScanItems ?? MAX_TOTAL_ROWS_IN_MEMORY,
+            maxIterations: options.maxIterations ?? MAX_LOOP_ITERATIONS,
+        },
+    };
+}
+export const STORE_KEYS = allKeysOf({
+    tableName: 'tableName',
+    client: 'client',
+    clientConfig: 'clientConfig',
+    createClient: 'createClient',
+    ttl: 'ttl',
+    logger: 'logger',
+    retry: 'retry',
+    readConcurrency: 'readConcurrency',
+    compression: 'compression',
+    s3: 's3',
+    serde: 'serde',
+    index: 'index',
+    vectorBackend: 'vectorBackend',
+    maxSearchCandidates: 'maxSearchCandidates',
+    maxScanItems: 'maxScanItems',
+    maxIterations: 'maxIterations',
+    vectorScoreDirection: 'vectorScoreDirection',
+});
+const INDEX_KEYS = allKeysOf({
+    dims: 'dims',
+    embeddings: 'embeddings',
+    fields: 'fields',
+});
+function assertUsableIndex(index) {
+    if (index === undefined)
+        return;
+    assertShape(index, INDEX_KEYS, 'index');
+    assertMembers(index.embeddings, EMBEDDINGS_MEMBERS, 'index.embeddings');
+    if (index.fields !== undefined)
+        assertStringArray(index.fields, 'index.fields');
+}
+function assertScoreDirection(direction) {
+    if (direction === undefined || VECTOR_SCORE_DIRECTIONS.includes(direction))
+        return;
+    throw validationError(`vectorScoreDirection must be one of ${VECTOR_SCORE_DIRECTIONS.join(' | ')}; received ` +
+        `${JSON.stringify(direction)}, which would be left in the backend's own direction and ` +
+        'could rank a distance backend backwards', 'vectorScoreDirection');
+}
+function assertLimits(options) {
+    if (options.maxScanItems !== undefined) {
+        assertInteger(options.maxScanItems, 'maxScanItems', { min: 1, max: MAX_SCAN_ITEMS });
+    }
+    if (options.maxSearchCandidates !== undefined) {
+        assertInteger(options.maxSearchCandidates, 'maxSearchCandidates', {
+            min: 1,
+            max: MAX_SEARCH_CANDIDATES,
+        });
+    }
+    if (options.maxIterations !== undefined && options.maxIterations !== Infinity) {
+        assertInteger(options.maxIterations, 'maxIterations', { min: 1 });
+    }
+}
+export function assertStoreOptions(options) {
+    assertLimits(options);
+    if (options.vectorBackend && !options.index) {
+        throw validationError('vectorBackend requires a configured `index` (embeddings); without one no embedding ' +
+            'is computed, every put would clear the item vector, and search would silently return ' +
+            'unranked, score-less results', 'vectorBackend');
+    }
+    assertUsableIndex(options.index);
+    assertScoreDirection(options.vectorScoreDirection);
+}

package/dist/esm/store/internal/table-search.d.ts

@@ -0,0 +1,100 @@
+/**
+ * Hides how a search is served from the table alone.
+ *
+ * Without a vector backend, a search reads the rows under its prefix within
+ * `maxScanItems`, decodes them a batch at a time, keeps the ones its filter
+ * passes, and — for a semantic query — ranks them in memory by cosine
+ * similarity within `maxSearchCandidates`, an item without an embedding sorting
+ * last. How far the read goes before it can stop is decided here.
+ */
+import type { Item, SearchItem } from '@langchain/langgraph-checkpoint';
+import type { ParsedSearch } from './parse.js';
+import type { StoreContext } from './setup.js';
+/**
+ * How far a collection must go. A plain page is complete once `need`
+ * (`offset + limit`) matching items are in hand, so rows past it are never
+ * read or decoded; a semantic ranking needs every candidate but is refused as
+ * soon as more than `cap` rows exist, before a single decode or embedding.
+ */
+export type CollectBound = {
+    kind: 'page';
+    need: number;
+} | {
+    kind: 'semantic';
+    cap: number;
+};
+/**
+ * Collect the live rows under the prefix and decode them within `bound`.
+ *
+ * Accepts: `search.namespacePrefix` — a non-empty prefix is a Query on one
+ * partition; an empty one spans every partition and is the Scan this adapter
+ * reserves for exactly that (`test/static/guards/scan-sites.ts`). `bound` — a
+ * page stops as soon as
+ * `need` matching items are in hand; a semantic collection needs every
+ * candidate and is refused past `cap`. `search.filter` — applied after decoding,
+ * since the filter reads the value.
+ *
+ * Returns: the matching candidates with the vectors their rows carry, in the
+ * order read: sort-key order within a partition, unspecified across partitions.
+ * A page therefore pages stably within a namespace, and only there.
+ *
+ * Throws: `VALIDATION` naming `maxSearchCandidates` before any decode when a
+ * semantic collection exceeds `cap`; `RESULT_TRUNCATED` when
+ * `maxScanItems` or `maxIterations` is reached while rows remain — a search
+ * never silently answers from part of the table; `ABORTED` when the signal
+ * fires between pages; whatever a decode throws for a corrupt or unreadable row.
+ *
+ * Guarantees: a page closes the paginator as soon as it is full, so a namespace
+ * far larger than the page costs neither a full decode nor a truncation error.
+ * The bound is tested after a row is in hand, not before one is asked for, so
+ * a `need` of 0 would still cost one request; `searchItems` answers that case
+ * ahead of this call rather than letting it be paid here.
+ * Expired rows, rows of other adapters, rows carrying none of the timestamps a
+ * decoded item reports, and rows whose own `namespace` does not match the
+ * prefix are all skipped — the last matters because a Scan has no key condition
+ * at all, so the prefix is enforced here rather than by DynamoDB, and the one
+ * before it because a single such row must not cost a search its other results.
+ */
+export declare function collectCandidates(context: StoreContext, search: ParsedSearch, bound: CollectBound, signal?: AbortSignal): Promise<RankCandidate[]>;
+/** A decoded item plus its stored vectors, awaiting ranking. */
+export interface RankCandidate {
+    item: Item;
+    /**
+     * One vector per extracted path. A row written before the store embedded
+     * per path carries a single vector and arrives here as a one-element list,
+     * which scores identically to how it always did.
+     */
+    embeddings?: number[][];
+}
+/**
+ * Rank candidates by cosine similarity to `queryVector`, descending. Throws a
+ * `VALIDATION` when the candidate count exceeds `maxCandidates`
+ * (steer large corpora to an external VectorBackend).
+ *
+ * An item is scored by its best-matching vector, as the reference store scores
+ * its per-path embeddings. A stored vector whose length differs from the query
+ * vector's cannot be scored — it was written by a different embeddings model —
+ * and an item with no comparable vector at all is ranked last with an
+ * undefined score. `onDimensionMismatch` is invoked once with how many
+ * candidates that affected, so the caller can say so instead of silently
+ * returning a ranking that quietly omits them.
+ *
+ * Accepts: `candidates` — in any order; empty ranks to empty. A candidate with
+ * no `embeddings` was never indexed (indexing off at write time, or no
+ * indexable text) and one with an empty list is the same thing. `queryVector` —
+ * the embedded query; one of a different length than everything stored means
+ * the query and the corpus were embedded by different models, and nothing
+ * scores.
+ *
+ * Returns: every candidate, scored and sorted best-first. Nothing is dropped:
+ * an unscorable item still belongs to the namespace the caller searched, and
+ * dropping it would turn a model mismatch into a silently empty result.
+ *
+ * Throws: `VALIDATION` naming `maxSearchCandidates` when more candidates
+ * arrive than may be ranked in memory — a bound on this process's memory, not
+ * on the corpus, which is what a `vectorBackend` is for.
+ *
+ * Guarantees: ranking reads the vectors only; no item is decoded or fetched
+ * again, and `onDimensionMismatch` fires at most once per call.
+ */
+export declare function rankInMemory(candidates: RankCandidate[], queryVector: number[], maxCandidates: number, onDimensionMismatch?: (count: number) => void): SearchItem[];

package/dist/esm/store/internal/table-search.js

@@ -0,0 +1,119 @@
+import { nowSeconds } from '../../shared/clock.js';
+import { DEFAULT_READ_CONCURRENCY, mapWithConcurrency } from '../../shared/concurrency.js';
+import { paginateQuery, paginateScan } from '../../shared/dynamodb/paginate.js';
+import { retryFor } from '../../shared/dynamodb/retry.js';
+import { isExpiredRow, withoutExpired } from '../../shared/dynamodb/table-schema.js';
+import { validationError } from '../../shared/errors/errors.js';
+import { passesFilter } from './filter.js';
+import { readCandidate } from './get-item.js';
+import { parseWholeStoreRow, namespaceMatchesPrefix, scopedQuery, storeScan, } from './rows.js';
+import { cosineSimilarity } from './semantic-search.js';
+function storedVectors(record) {
+    if (record.embeddings)
+        return record.embeddings;
+    return record.embedding ? [record.embedding] : undefined;
+}
+function candidateSource(context, search, signal, now) {
+    return search.namespacePrefix.length > 0
+        ? paginateQuery({
+            retry: retryFor(context, signal),
+            signal,
+            client: context.client,
+            params: withoutExpired(scopedQuery(context.tableName, search.namespacePrefix), now),
+            maxItems: context.maxScanItems,
+            maxIterations: context.maxIterations,
+        })
+        : paginateScan({
+            retry: retryFor(context, signal),
+            signal,
+            client: context.client,
+            params: withoutExpired(storeScan(context.tableName), now),
+            maxItems: context.maxScanItems,
+            maxIterations: context.maxIterations,
+        });
+}
+function liveRow(raw, search, now) {
+    const record = parseWholeStoreRow(raw);
+    if (!record || isExpiredRow(record, now))
+        return undefined;
+    return namespaceMatchesPrefix(record.namespace, search.namespacePrefix) ? record : undefined;
+}
+async function flush(context, search, state, signal) {
+    if (state.pending.length === 0)
+        return;
+    const batch = state.pending;
+    state.pending = [];
+    const reads = await mapWithConcurrency(batch, context.readConcurrency ?? DEFAULT_READ_CONCURRENCY, (record) => readCandidate(context, record, signal));
+    for (const read of reads) {
+        if (read !== undefined && passesFilter(read.item, search.filter)) {
+            state.collected.push({ item: read.item, embeddings: storedVectors(read.row) });
+        }
+    }
+}
+function batchSize(search, need, collected, limit) {
+    return search.filter === undefined ? Math.min(limit, need - collected) : limit;
+}
+function tooManyCandidates(count, cap) {
+    return validationError(`Semantic search candidate set (${count}) exceeds maxSearchCandidates (${cap}); ` +
+        'use a dedicated VectorBackend for large corpora', 'maxSearchCandidates');
+}
+export async function collectCandidates(context, search, bound, signal) {
+    const now = nowSeconds();
+    const limit = context.readConcurrency ?? DEFAULT_READ_CONCURRENCY;
+    const state = { pending: [], collected: [] };
+    for await (const raw of candidateSource(context, search, signal, now)) {
+        const record = liveRow(raw, search, now);
+        if (!record)
+            continue;
+        state.pending.push(record);
+        if (bound.kind === 'semantic') {
+            if (state.pending.length > bound.cap)
+                throw tooManyCandidates(state.pending.length, bound.cap);
+            continue;
+        }
+        if (state.pending.length < batchSize(search, bound.need, state.collected.length, limit)) {
+            continue;
+        }
+        await flush(context, search, state, signal);
+        if (state.collected.length >= bound.need)
+            return state.collected;
+    }
+    await flush(context, search, state, signal);
+    return state.collected;
+}
+const UNSCORED_RANK = -2;
+function bestScore(vectors, queryVector) {
+    let best;
+    for (const vector of vectors) {
+        if (vector.length !== queryVector.length)
+            continue;
+        const score = cosineSimilarity(queryVector, vector);
+        if (best === undefined || score > best)
+            best = score;
+    }
+    return best;
+}
+function isDimensionMismatch(candidate, queryVector) {
+    const vectors = candidate.embeddings;
+    return (vectors !== undefined &&
+        vectors.length > 0 &&
+        vectors.every((vector) => vector.length !== queryVector.length));
+}
+export function rankInMemory(candidates, queryVector, maxCandidates, onDimensionMismatch) {
+    if (candidates.length > maxCandidates) {
+        throw validationError(`Semantic search candidate set (${candidates.length}) exceeds maxSearchCandidates ` +
+            `(${maxCandidates}); use a dedicated VectorBackend for large corpora`, 'maxSearchCandidates');
+    }
+    const mismatched = candidates.filter((candidate) => isDimensionMismatch(candidate, queryVector)).length;
+    if (mismatched > 0)
+        onDimensionMismatch?.(mismatched);
+    return candidates
+        .map(({ item, embeddings }) => ({
+        ...item,
+        score: embeddings ? bestScore(embeddings, queryVector) : undefined,
+    }))
+        .sort((a, b) => rankValue(b) - rankValue(a));
+}
+function rankValue(item) {
+    return item.score ?? UNSCORED_RANK;
+}