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

package/dist/store/internal/backend-search.js

@@ -1,68 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.searchViaBackend = searchViaBackend;
-const errors_1 = require("../../shared/errors/errors");
-const get_1 = require("../actions/get");
-const keys_1 = require("./keys");
-const score_direction_1 = require("./score-direction");
-const search_filter_1 = require("./search-filter");
-/**
- * Warn when a backend's own ordering disagrees with its scores. A backend
- * returning a raw distance still hands back nearest-first, so the order looks
- * right while every score means the opposite of what {@link VectorMatch.score}
- * promises — ascending scores are that exact signature. Results are never
- * reordered on this basis: a correctly-scored backend's order is authoritative.
- */
-function warnOnNonDescendingScores(context, matches, namespacePrefix) {
-    const descending = matches.every((match, position) => position === 0 || matches[position - 1].score >= match.score);
-    if (descending)
-        return;
-    context.logger.warn('search: vectorBackend returned ascending scores; VectorMatch.score must be a relevance ' +
-        '(higher is better), not a distance — results are forwarded in the order the backend gave', { namespacePrefix });
-}
-/**
- * Read the canonical item a backend match points at, or `undefined` when the
- * match is unusable. `getItem` validates, so a backend returning a namespace
- * element containing the reserved separator would otherwise turn the whole
- * search into a ValidationError instead of dropping the one bad match.
- */
-async function fetchMatch(context, match) {
-    try {
-        return await (0, get_1.getItem)(context, match.namespace, match.key);
-    }
-    catch (error) {
-        context.logger.warn('search: skipped an unusable vectorBackend match', {
-            namespace: match.namespace,
-            key: match.key,
-            reason: error.name,
-        });
-        return null;
-    }
-}
-async function searchViaBackend(context, backend, index, op, offset, limit) {
-    const queryVector = await index.embeddings.embedQuery(op.query);
-    const need = offset + limit;
-    if (need > context.maxSearchCandidates) {
-        throw new errors_1.ValidationError(`Requested page (offset ${offset} + limit ${limit} = ${need}) exceeds maxSearchCandidates ` +
-            `(${context.maxSearchCandidates}); narrow the page or raise maxSearchCandidates`, 'maxSearchCandidates');
-    }
-    let topK = Math.min(need, context.maxSearchCandidates);
-    let results;
-    for (;;) {
-        const matches = (0, score_direction_1.toRelevanceScores)(await backend.query(op.namespacePrefix, queryVector, topK), context.vectorScoreDirection);
-        warnOnNonDescendingScores(context, matches, op.namespacePrefix);
-        results = [];
-        for (const match of matches) {
-            if (!(0, keys_1.namespaceMatchesPrefix)(match.namespace, op.namespacePrefix))
-                continue;
-            const item = await fetchMatch(context, match);
-            if (item && (0, search_filter_1.passesFilter)(item, op))
-                results.push({ ...item, score: match.score });
-        }
-        if (results.length >= need || matches.length < topK || topK >= context.maxSearchCandidates)
-            break;
-        topK = Math.min(topK * 2, context.maxSearchCandidates);
-    }
-    return results;
-}
-//# sourceMappingURL=backend-search.js.map

package/dist/store/internal/backend-search.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"backend-search.js","sourceRoot":"","sources":["../../../src/store/internal/backend-search.ts"],"names":[],"mappings":";;;AAOA,uDAA6D;AAC7D,wCAAyC;AAEzC,iCAAgD;AAChD,uDAAsD;AACtD,mDAA+C;AAG/C;;;;;;GAMG;AACH,SAAS,yBAAyB,CAChC,OAAqB,EACrB,OAAsB,EACtB,eAAyB;IAEzB,MAAM,UAAU,GAAG,OAAO,CAAC,KAAK,CAC9B,CAAC,KAAK,EAAE,QAAQ,EAAE,EAAE,CAAC,QAAQ,KAAK,CAAC,IAAI,OAAO,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC,KAAK,IAAI,KAAK,CAAC,KAAK,CAClF,CAAC;IACF,IAAI,UAAU;QAAE,OAAO;IACvB,OAAO,CAAC,MAAM,CAAC,IAAI,CACjB,yFAAyF;QACvF,0FAA0F,EAC5F,EAAE,eAAe,EAAE,CACpB,CAAC;AACJ,CAAC;AAED;;;;;GAKG;AACH,KAAK,UAAU,UAAU,CAAC,OAAqB,EAAE,KAAkB;IACjE,IAAI,CAAC;QACH,OAAO,MAAM,IAAA,aAAO,EAAC,OAAO,EAAE,KAAK,CAAC,SAAS,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC;IAC5D,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,iDAAiD,EAAE;YACrE,SAAS,EAAE,KAAK,CAAC,SAAS;YAC1B,GAAG,EAAE,KAAK,CAAC,GAAG;YACd,MAAM,EAAG,KAAe,CAAC,IAAI;SAC9B,CAAC,CAAC;QACH,OAAO,IAAI,CAAC;IACd,CAAC;AACH,CAAC;AAEM,KAAK,2BACV,OAAqB,EACrB,OAAsB,EACtB,KAAkB,EAClB,EAAmB,EACnB,MAAc,EACd,KAAa;IAEb,MAAM,WAAW,GAAG,MAAM,KAAK,CAAC,UAAU,CAAC,UAAU,CAAC,EAAE,CAAC,KAAe,CAAC,CAAC;IAC1E,MAAM,IAAI,GAAG,MAAM,GAAG,KAAK,CAAC;IAC5B,IAAI,IAAI,GAAG,OAAO,CAAC,mBAAmB,EAAE,CAAC;QACvC,MAAM,IAAI,wBAAe,CACvB,0BAA0B,MAAM,YAAY,KAAK,MAAM,IAAI,gCAAgC;YACzF,IAAI,OAAO,CAAC,mBAAmB,iDAAiD,EAClF,qBAAqB,CACtB,CAAC;IACJ,CAAC;IACD,IAAI,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,OAAO,CAAC,mBAAmB,CAAC,CAAC;IACvD,IAAI,OAAqB,CAAC;IAC1B,SAAS,CAAC;QACR,MAAM,OAAO,GAAG,IAAA,mCAAiB,EAC/B,MAAM,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC,eAAe,EAAE,WAAW,EAAE,IAAI,CAAC,EAC1D,OAAO,CAAC,oBAAoB,CAC7B,CAAC;QACF,yBAAyB,CAAC,OAAO,EAAE,OAAO,EAAE,EAAE,CAAC,eAAe,CAAC,CAAC;QAChE,OAAO,GAAG,EAAE,CAAC;QACb,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;YAC5B,IAAI,CAAC,IAAA,6BAAsB,EAAC,KAAK,CAAC,SAAS,EAAE,EAAE,CAAC,eAAe,CAAC;gBAAE,SAAS;YAC3E,MAAM,IAAI,GAAG,MAAM,UAAU,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC;YAC9C,IAAI,IAAI,IAAI,IAAA,4BAAY,EAAC,IAAI,EAAE,EAAE,CAAC;gBAAE,OAAO,CAAC,IAAI,CAAC,EAAE,GAAG,IAAI,EAAE,KAAK,EAAE,KAAK,CAAC,KAAK,EAAE,CAAC,CAAC;QACpF,CAAC;QACD,IAAI,OAAO,CAAC,MAAM,IAAI,IAAI,IAAI,OAAO,CAAC,MAAM,GAAG,IAAI,IAAI,IAAI,IAAI,OAAO,CAAC,mBAAmB;YACxF,MAAM;QACR,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,GAAG,CAAC,EAAE,OAAO,CAAC,mBAAmB,CAAC,CAAC;IACzD,CAAC;IACD,OAAO,OAAO,CAAC;AACjB,CAAC"}

package/dist/store/internal/filter.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"filter.d.ts","sourceRoot":"","sources":["../../../src/store/internal/filter.ts"],"names":[],"mappings":"AAEA,8DAA8D;AAC9D,MAAM,MAAM,SAAS,GACnB,MAAM,GAAG,MAAM,GAAG,OAAO,GAAG,IAAI,GAAG,SAAS,EAAE,GAAG;IAAE,CAAC,GAAG,EAAE,MAAM,GAAG,SAAS,CAAA;CAAE,CAAC;AAyFhF;;;GAGG;AACH,wBAAgB,kBAAkB,CAChC,KAAK,EAAE,MAAM,CAAC,MAAM,EAAE,SAAS,CAAC,EAChC,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,SAAS,CAAC,GAChC,OAAO,CAMT"}

package/dist/store/internal/filter.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"filter.js","sourceRoot":"","sources":["../../../src/store/internal/filter.ts"],"names":[],"mappings":";;;AAAA,yCAA8C;AAM9C;;;;;;GAMG;AACH,SAAS,OAAO,CAA4B,MAAS,EAAE,QAAW;IAChE,IAAI,MAAM,GAAG,QAAQ;QAAE,OAAO,CAAC,CAAC,CAAC;IACjC,IAAI,MAAM,GAAG,QAAQ;QAAE,OAAO,CAAC,CAAC;IAChC,OAAO,MAAM,KAAK,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;AAC7C,CAAC;AAED,yEAAyE;AACzE,SAAS,SAAS,CAAC,KAAyB,EAAE,IAAgC;IAC5E,OAAO,KAAK,KAAK,SAAS,IAAI,IAAI,CAAC,KAAK,CAAC,CAAC;AAC5C,CAAC;AAED;;;;;;;;;;GAUG;AACH,SAAS,cAAc,CACrB,MAAmB,EACnB,QAAmB,EACnB,IAAgC;IAEhC,IAAI,OAAO,MAAM,KAAK,QAAQ,IAAI,OAAO,QAAQ,KAAK,QAAQ,EAAE,CAAC;QAC/D,OAAO,SAAS,CAAC,OAAO,CAAC,MAAM,EAAE,QAAQ,CAAC,EAAE,IAAI,CAAC,CAAC;IACpD,CAAC;IACD,IAAI,OAAO,MAAM,KAAK,QAAQ,IAAI,OAAO,QAAQ,KAAK,QAAQ,EAAE,CAAC;QAC/D,OAAO,SAAS,CAAC,OAAO,CAAC,MAAM,EAAE,QAAQ,CAAC,EAAE,IAAI,CAAC,CAAC;IACpD,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAKD,MAAM,WAAW,GAA0E;IACzF,GAAG,EAAE,CAAC,MAAM,EAAE,QAAQ,EAAE,EAAE,CAAC,IAAA,6BAAiB,EAAC,MAAM,EAAE,QAAQ,CAAC;IAC9D,GAAG,EAAE,CAAC,MAAM,EAAE,QAAQ,EAAE,EAAE,CAAC,CAAC,IAAA,6BAAiB,EAAC,MAAM,EAAE,QAAQ,CAAC;IAC/D,GAAG,EAAE,CAAC,MAAM,EAAE,QAAQ,EAAE,EAAE,CAAC,cAAc,CAAC,MAAM,EAAE,QAAQ,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,GAAG,CAAC,CAAC;IACjF,IAAI,EAAE,CAAC,MAAM,EAAE,QAAQ,EAAE,EAAE,CAAC,cAAc,CAAC,MAAM,EAAE,QAAQ,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,IAAI,CAAC,CAAC;IACnF,GAAG,EAAE,CAAC,MAAM,EAAE,QAAQ,EAAE,EAAE,CAAC,cAAc,CAAC,MAAM,EAAE,QAAQ,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,GAAG,CAAC,CAAC;IACjF,IAAI,EAAE,CAAC,MAAM,EAAE,QAAQ,EAAE,EAAE,CAAC,cAAc,CAAC,MAAM,EAAE,QAAQ,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,IAAI,CAAC,CAAC;IACnF,GAAG,EAAE,CAAC,MAAM,EAAE,QAAQ,EAAE,EAAE,CACxB,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC;QACrB,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,IAAA,6BAAiB,EAAC,MAAM,EAAE,SAAS,CAAC,CAAC;QACpE,CAAC,CAAC,KAAK;IACX,IAAI,EAAE,CAAC,MAAM,EAAE,QAAQ,EAAE,EAAE,CACzB,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC;QACrB,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,IAAA,6BAAiB,EAAC,MAAM,EAAE,SAAS,CAAC,CAAC;QACrE,CAAC,CAAC,IAAI;CACX,CAAC;AAEF;;;;;;GAMG;AACH,SAAS,gBAAgB,CAAC,SAAoB;IAC5C,OAAO,CACL,OAAO,SAAS,KAAK,QAAQ;QAC7B,SAAS,KAAK,IAAI;QAClB,CAAC,KAAK,CAAC,OAAO,CAAC,SAAS,CAAC;QACzB,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,MAAM,GAAG,CAAC;QACjC,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,KAAK,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,MAAM,CAAC,SAAS,CAAC,cAAc,CAAC,IAAI,CAAC,WAAW,EAAE,GAAG,CAAC,CAAC,CAC9F,CAAC;AACJ,CAAC;AAED,SAAS,gBAAgB,CAAC,MAAmB,EAAE,SAAoB;IACjE,IAAI,CAAC,gBAAgB,CAAC,SAAS,CAAC;QAAE,OAAO,IAAA,6BAAiB,EAAC,MAAM,EAAE,SAAS,CAAC,CAAC;IAC9E,OAAO,MAAM,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,QAAQ,EAAE,QAAQ,CAAC,EAAE,EAAE,CAC9D,WAAW,CAAC,QAAQ,CAAC,CAAC,MAAM,EAAE,QAAQ,CAAC,CACxC,CAAC;AACJ,CAAC;AAED;;;GAGG;AACH,4BACE,KAAgC,EAChC,MAAiC;IAEjC,OAAO,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,EAAE,SAAS,CAAC,EAAE,EAAE;IACzD;qEACiE;IACjE,gBAAgB,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS,EAAE,SAAS,CAAC,CACpF,CAAC;AACJ,CAAC"}

package/dist/store/internal/index-reconcile.d.ts

@@ -1,22 +0,0 @@
-import type { VectorBackend, VectorRef } from '../vector-backend';
-import type { StoreContext } from './setup';
-/** A canonical item's location plus the embedding recomputed for it. */
-export interface ReconcileTarget {
-    namespace: string[];
-    key: string;
-    embedding: number[] | undefined;
-}
-/**
- * Enumerate canonical items under `prefix`, recomputing each embedding. A failed
- * embedding rejects the whole reconcile by design: silently skipping an item
- * would drop it from the live set, after which {@link selectOrphans} would prune
- * its still-valid backend vector. Fail-fast keeps the backend from losing data.
- */
-export declare function collectReconcileTargets(context: StoreContext, prefix: string[]): Promise<ReconcileTarget[]>;
-/** Re-push every live embedding to the backend; returns the upsert count. */
-export declare function pushEmbeddings(backend: VectorBackend, targets: ReconcileTarget[]): Promise<number>;
-/** Refs present in the backend but absent from `live` — orphans to prune. */
-export declare function selectOrphans(backendRefs: VectorRef[], live: ReconcileTarget[]): VectorRef[];
-/** Delete backend vectors with no canonical item; returns the prune count. */
-export declare function pruneOrphans(context: StoreContext, backend: VectorBackend, prefix: string[], live: ReconcileTarget[]): Promise<number>;
-//# sourceMappingURL=index-reconcile.d.ts.map

package/dist/store/internal/index-reconcile.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"index-reconcile.d.ts","sourceRoot":"","sources":["../../../src/store/internal/index-reconcile.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAE,aAAa,EAAE,SAAS,EAAE,MAAM,mBAAmB,CAAC;AAMlE,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,SAAS,CAAC;AAG5C,wEAAwE;AACxE,MAAM,WAAW,eAAe;IAC9B,SAAS,EAAE,MAAM,EAAE,CAAC;IACpB,GAAG,EAAE,MAAM,CAAC;IACZ,SAAS,EAAE,MAAM,EAAE,GAAG,SAAS,CAAC;CACjC;AAOD;;;;;GAKG;AACH,wBAAsB,uBAAuB,CAC3C,OAAO,EAAE,YAAY,EACrB,MAAM,EAAE,MAAM,EAAE,GACf,OAAO,CAAC,eAAe,EAAE,CAAC,CAqB5B;AAED,6EAA6E;AAC7E,wBAAsB,cAAc,CAClC,OAAO,EAAE,aAAa,EACtB,OAAO,EAAE,eAAe,EAAE,GACzB,OAAO,CAAC,MAAM,CAAC,CAQjB;AAED,6EAA6E;AAC7E,wBAAgB,aAAa,CAAC,WAAW,EAAE,SAAS,EAAE,EAAE,IAAI,EAAE,eAAe,EAAE,GAAG,SAAS,EAAE,CAO5F;AAeD,8EAA8E;AAC9E,wBAAsB,YAAY,CAChC,OAAO,EAAE,YAAY,EACrB,OAAO,EAAE,aAAa,EACtB,MAAM,EAAE,MAAM,EAAE,EAChB,IAAI,EAAE,eAAe,EAAE,GACtB,OAAO,CAAC,MAAM,CAAC,CA6BjB"}

package/dist/store/internal/index-reconcile.js

@@ -1,105 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.collectReconcileTargets = collectReconcileTargets;
-exports.pushEmbeddings = pushEmbeddings;
-exports.selectOrphans = selectOrphans;
-exports.pruneOrphans = pruneOrphans;
-const paginate_1 = require("../../shared/dynamodb/paginate");
-const item_mapper_1 = require("./item-mapper");
-const keys_1 = require("./keys");
-const query_1 = require("./query");
-const semantic_search_1 = require("./semantic-search");
-const write_verify_1 = require("./write-verify");
-/** Stable, collision-free identity for a (namespace, key) pair. */
-function refIdentity(namespace, key) {
-    return JSON.stringify([...namespace, key]);
-}
-/**
- * Enumerate canonical items under `prefix`, recomputing each embedding. A failed
- * embedding rejects the whole reconcile by design: silently skipping an item
- * would drop it from the live set, after which {@link selectOrphans} would prune
- * its still-valid backend vector. Fail-fast keeps the backend from losing data.
- */
-async function collectReconcileTargets(context, prefix) {
-    const targets = [];
-    const source = (0, paginate_1.paginateQuery)({
-        client: context.client,
-        params: (0, query_1.scopedQuery)(context.tableName, prefix),
-        maxItems: context.maxScanItems,
-    });
-    for await (const raw of source) {
-        const record = (0, item_mapper_1.narrowStoreRecord)(raw);
-        if (!record) {
-            context.logger.warn('reconcileVectorIndex: skipped a row that is not a store item', {
-                sortKey: raw.SK,
-            });
-            continue;
-        }
-        if (!(0, keys_1.namespaceMatchesPrefix)(record.namespace, prefix))
-            continue;
-        const item = await (0, item_mapper_1.readStoreItem)(context, record);
-        const embedding = await (0, semantic_search_1.embedValue)(context, item.value);
-        targets.push({ namespace: record.namespace, key: record.key, embedding });
-    }
-    return targets;
-}
-/** Re-push every live embedding to the backend; returns the upsert count. */
-async function pushEmbeddings(backend, targets) {
-    let upserted = 0;
-    for (const target of targets) {
-        if (!target.embedding)
-            continue;
-        await backend.upsert(target.namespace, target.key, target.embedding);
-        upserted += 1;
-    }
-    return upserted;
-}
-/** Refs present in the backend but absent from `live` — orphans to prune. */
-function selectOrphans(backendRefs, live) {
-    const liveKeys = new Set(live
-        .filter((target) => target.embedding !== undefined)
-        .map((target) => refIdentity(target.namespace, target.key)));
-    return backendRefs.filter((ref) => !liveKeys.has(refIdentity(ref.namespace, ref.key)));
-}
-/**
- * True when a candidate's canonical item is confirmed absent right now. The
- * live-set snapshot and this read are not one point in time, so an item
- * written between them looks orphaned even though it is live — and deleting
- * its vector would silently drop a just-written item out of semantic search.
- */
-async function confirmedGone(context, ref) {
-    return (0, write_verify_1.rowIsAbsent)(context, {
-        PK: (0, keys_1.partitionKey)(ref.namespace),
-        SK: (0, keys_1.sortKey)(ref.namespace, ref.key),
-    });
-}
-/** Delete backend vectors with no canonical item; returns the prune count. */
-async function pruneOrphans(context, backend, prefix, live) {
-    if (!backend.listKeys) {
-        context.logger.info('reconcileVectorIndex prune skipped: backend has no listKeys', { prefix });
-        return 0;
-    }
-    const candidates = selectOrphans(await backend.listKeys(prefix), live);
-    /**
-     * Every item the snapshot actually saw, embedded or not. A candidate in here
-     * is prunable on the evidence already gathered — its item exists but yields
-     * no embedding (its indexable text became empty), so its vector really is
-     * stale. Only a candidate the snapshot never saw at all is ambiguous.
-     */
-    const observed = new Set(live.map((target) => refIdentity(target.namespace, target.key)));
-    let pruned = 0;
-    for (const ref of candidates) {
-        if (!observed.has(refIdentity(ref.namespace, ref.key)) &&
-            !(await confirmedGone(context, ref))) {
-            context.logger.info('reconcileVectorIndex: kept a vector whose item reappeared', {
-                namespace: ref.namespace,
-                key: ref.key,
-            });
-            continue;
-        }
-        await backend.delete(ref.namespace, ref.key);
-        pruned += 1;
-    }
-    return pruned;
-}
-//# sourceMappingURL=index-reconcile.js.map

package/dist/store/internal/index-reconcile.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index-reconcile.js","sourceRoot":"","sources":["../../../src/store/internal/index-reconcile.ts"],"names":[],"mappings":";;;;;;AAAA,6DAA+D;AAG/D,+CAAiE;AACjE,iCAAuE;AACvE,mCAAsC;AACtC,uDAA+C;AAE/C,iDAA6C;AAS7C,mEAAmE;AACnE,SAAS,WAAW,CAAC,SAAmB,EAAE,GAAW;IACnD,OAAO,IAAI,CAAC,SAAS,CAAC,CAAC,GAAG,SAAS,EAAE,GAAG,CAAC,CAAC,CAAC;AAC7C,CAAC;AAED;;;;;GAKG;AACI,KAAK,kCACV,OAAqB,EACrB,MAAgB;IAEhB,MAAM,OAAO,GAAsB,EAAE,CAAC;IACtC,MAAM,MAAM,GAAG,IAAA,wBAAa,EAAC;QAC3B,MAAM,EAAE,OAAO,CAAC,MAAM;QACtB,MAAM,EAAE,IAAA,mBAAW,EAAC,OAAO,CAAC,SAAS,EAAE,MAAM,CAAC;QAC9C,QAAQ,EAAE,OAAO,CAAC,YAAY;KAC/B,CAAC,CAAC;IACH,IAAI,KAAK,EAAE,MAAM,GAAG,IAAI,MAAM,EAAE,CAAC;QAC/B,MAAM,MAAM,GAAG,IAAA,+BAAiB,EAAC,GAAG,CAAC,CAAC;QACtC,IAAI,CAAC,MAAM,EAAE,CAAC;YACZ,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,8DAA8D,EAAE;gBAClF,OAAO,EAAE,GAAG,CAAC,EAAY;aAC1B,CAAC,CAAC;YACH,SAAS;QACX,CAAC;QACD,IAAI,CAAC,IAAA,6BAAsB,EAAC,MAAM,CAAC,SAAS,EAAE,MAAM,CAAC;YAAE,SAAS;QAChE,MAAM,IAAI,GAAG,MAAM,IAAA,2BAAa,EAAC,OAAO,EAAE,MAAM,CAAC,CAAC;QAClD,MAAM,SAAS,GAAG,MAAM,IAAA,4BAAU,EAAC,OAAO,EAAE,IAAI,CAAC,KAAkC,CAAC,CAAC;QACrF,OAAO,CAAC,IAAI,CAAC,EAAE,SAAS,EAAE,MAAM,CAAC,SAAS,EAAE,GAAG,EAAE,MAAM,CAAC,GAAG,EAAE,SAAS,EAAE,CAAC,CAAC;IAC5E,CAAC;IACD,OAAO,OAAO,CAAC;AACjB,CAAC;AAED,6EAA6E;AACtE,KAAK,yBACV,OAAsB,EACtB,OAA0B;IAE1B,IAAI,QAAQ,GAAG,CAAC,CAAC;IACjB,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;QAC7B,IAAI,CAAC,MAAM,CAAC,SAAS;YAAE,SAAS;QAChC,MAAM,OAAO,CAAC,MAAM,CAAC,MAAM,CAAC,SAAS,EAAE,MAAM,CAAC,GAAG,EAAE,MAAM,CAAC,SAAS,CAAC,CAAC;QACrE,QAAQ,IAAI,CAAC,CAAC;IAChB,CAAC;IACD,OAAO,QAAQ,CAAC;AAClB,CAAC;AAED,6EAA6E;AAC7E,uBAA8B,WAAwB,EAAE,IAAuB;IAC7E,MAAM,QAAQ,GAAG,IAAI,GAAG,CACtB,IAAI;SACD,MAAM,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,MAAM,CAAC,SAAS,KAAK,SAAS,CAAC;SAClD,GAAG,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,WAAW,CAAC,MAAM,CAAC,SAAS,EAAE,MAAM,CAAC,GAAG,CAAC,CAAC,CAC9D,CAAC;IACF,OAAO,WAAW,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,WAAW,CAAC,GAAG,CAAC,SAAS,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;AACzF,CAAC;AAED;;;;;GAKG;AACH,KAAK,UAAU,aAAa,CAAC,OAAqB,EAAE,GAAc;IAChE,OAAO,IAAA,0BAAW,EAAC,OAAO,EAAE;QAC1B,EAAE,EAAE,IAAA,mBAAY,EAAC,GAAG,CAAC,SAAS,CAAC;QAC/B,EAAE,EAAE,IAAA,cAAO,EAAC,GAAG,CAAC,SAAS,EAAE,GAAG,CAAC,GAAG,CAAC;KACpC,CAAC,CAAC;AACL,CAAC;AAED,8EAA8E;AACvE,KAAK,uBACV,OAAqB,EACrB,OAAsB,EACtB,MAAgB,EAChB,IAAuB;IAEvB,IAAI,CAAC,OAAO,CAAC,QAAQ,EAAE,CAAC;QACtB,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,6DAA6D,EAAE,EAAE,MAAM,EAAE,CAAC,CAAC;QAC/F,OAAO,CAAC,CAAC;IACX,CAAC;IACD,MAAM,UAAU,GAAG,aAAa,CAAC,MAAM,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAC,EAAE,IAAI,CAAC,CAAC;IACvE;;;;;OAKG;IACH,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,WAAW,CAAC,MAAM,CAAC,SAAS,EAAE,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IAC1F,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,KAAK,MAAM,GAAG,IAAI,UAAU,EAAE,CAAC;QAC7B,IACE,CAAC,QAAQ,CAAC,GAAG,CAAC,WAAW,CAAC,GAAG,CAAC,SAAS,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC;YAClD,CAAC,CAAC,MAAM,aAAa,CAAC,OAAO,EAAE,GAAG,CAAC,CAAC,EACpC,CAAC;YACD,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,2DAA2D,EAAE;gBAC/E,SAAS,EAAE,GAAG,CAAC,SAAS;gBACxB,GAAG,EAAE,GAAG,CAAC,GAAG;aACb,CAAC,CAAC;YACH,SAAS;QACX,CAAC;QACD,MAAM,OAAO,CAAC,MAAM,CAAC,GAAG,CAAC,SAAS,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC;QAC7C,MAAM,IAAI,CAAC,CAAC;IACd,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC"}

package/dist/store/internal/index-sync.d.ts

@@ -1,11 +0,0 @@
-import type { Logger } from '../../shared/logging/logger';
-import type { VectorBackend } from '../vector-backend';
-/**
- * Best-effort sync of one item's embedding to the vector backend after the
- * canonical DynamoDB write has already succeeded. A present embedding upserts;
- * its absence deletes any stale vector. Failures are logged at `warn` and
- * swallowed — the canonical item stands and `reconcileVectorIndex` repairs any
- * drift — so a backend hiccup never fails an otherwise-successful put.
- */
-export declare function syncVectorIndex(backend: VectorBackend, namespace: string[], key: string, embedding: number[] | undefined, logger: Logger): Promise<void>;
-//# sourceMappingURL=index-sync.d.ts.map

package/dist/store/internal/index-sync.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"index-sync.d.ts","sourceRoot":"","sources":["../../../src/store/internal/index-sync.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,MAAM,EAAE,MAAM,6BAA6B,CAAC;AAC1D,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,mBAAmB,CAAC;AAEvD;;;;;;GAMG;AACH,wBAAsB,eAAe,CACnC,OAAO,EAAE,aAAa,EACtB,SAAS,EAAE,MAAM,EAAE,EACnB,GAAG,EAAE,MAAM,EACX,SAAS,EAAE,MAAM,EAAE,GAAG,SAAS,EAC/B,MAAM,EAAE,MAAM,GACb,OAAO,CAAC,IAAI,CAAC,CAWf"}

package/dist/store/internal/index-sync.js

@@ -1,26 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.syncVectorIndex = syncVectorIndex;
-/**
- * Best-effort sync of one item's embedding to the vector backend after the
- * canonical DynamoDB write has already succeeded. A present embedding upserts;
- * its absence deletes any stale vector. Failures are logged at `warn` and
- * swallowed — the canonical item stands and `reconcileVectorIndex` repairs any
- * drift — so a backend hiccup never fails an otherwise-successful put.
- */
-async function syncVectorIndex(backend, namespace, key, embedding, logger) {
-    try {
-        if (embedding)
-            await backend.upsert(namespace, key, embedding);
-        else
-            await backend.delete(namespace, key);
-    }
-    catch (error) {
-        logger.warn('store.put vector-index sync failed; reconcileVectorIndex will repair', {
-            namespace,
-            key,
-            message: error.message,
-        });
-    }
-}
-//# sourceMappingURL=index-sync.js.map

package/dist/store/internal/index-sync.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index-sync.js","sourceRoot":"","sources":["../../../src/store/internal/index-sync.ts"],"names":[],"mappings":";;;AAGA;;;;;;GAMG;AACI,KAAK,0BACV,OAAsB,EACtB,SAAmB,EACnB,GAAW,EACX,SAA+B,EAC/B,MAAc;IAEd,IAAI,CAAC;QACH,IAAI,SAAS;YAAE,MAAM,OAAO,CAAC,MAAM,CAAC,SAAS,EAAE,GAAG,EAAE,SAAS,CAAC,CAAC;;YAC1D,MAAM,OAAO,CAAC,MAAM,CAAC,SAAS,EAAE,GAAG,CAAC,CAAC;IAC5C,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,MAAM,CAAC,IAAI,CAAC,sEAAsE,EAAE;YAClF,SAAS;YACT,GAAG;YACH,OAAO,EAAG,KAAe,CAAC,OAAO;SAClC,CAAC,CAAC;IACL,CAAC;AACH,CAAC"}

package/dist/store/internal/item-mapper.d.ts

@@ -1,25 +0,0 @@
-import type { Item } from '@langchain/langgraph-checkpoint';
-import type { DocItem } from '../../shared/dynamodb/types';
-import type { StoreItemRecord } from '../types';
-import type { JsonValue } from './filter';
-import type { StoreContext } from './setup';
-/**
- * Narrow a raw scanned row to a {@link StoreItemRecord}, or `undefined` for a
- * foreign row on a shared table (no `namespace`). Replaces an unchecked cast at
- * the scan boundary, the one place rows are not written by this library.
- */
-export declare function narrowStoreRecord(raw: DocItem): StoreItemRecord | undefined;
-/** Fields controlling a stored item's timestamps, embedding, ttl, and S3 key nonce. */
-export interface BuildItemOptions {
-    createdAt: string;
-    updatedAt: string;
-    embedding?: number[];
-    ttlTimestamp?: number;
-    /** Per-call nonce: uniquifies the S3 key and becomes the row's revision token. */
-    nonce?: string;
-}
-/** Encode a value into the DynamoDB record for a stored item. */
-export declare function buildStoreItem(context: StoreContext, namespace: string[], key: string, value: Record<string, JsonValue>, options: BuildItemOptions): Promise<StoreItemRecord>;
-/** Decode a DynamoDB record back into a store {@link Item}. */
-export declare function readStoreItem(context: StoreContext, record: StoreItemRecord): Promise<Item>;
-//# sourceMappingURL=item-mapper.d.ts.map

package/dist/store/internal/item-mapper.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"item-mapper.d.ts","sourceRoot":"","sources":["../../../src/store/internal/item-mapper.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,iCAAiC,CAAC;AAG5D,OAAO,KAAK,EAAE,OAAO,EAAE,MAAM,6BAA6B,CAAC;AAC3D,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,UAAU,CAAC;AAChD,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,UAAU,CAAC;AAE1C,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,SAAS,CAAC;AAE5C;;;;GAIG;AACH,wBAAgB,iBAAiB,CAAC,GAAG,EAAE,OAAO,GAAG,eAAe,GAAG,SAAS,CAE3E;AAOD,uFAAuF;AACvF,MAAM,WAAW,gBAAgB;IAC/B,SAAS,EAAE,MAAM,CAAC;IAClB,SAAS,EAAE,MAAM,CAAC;IAClB,SAAS,CAAC,EAAE,MAAM,EAAE,CAAC;IACrB,YAAY,CAAC,EAAE,MAAM,CAAC;IACtB,kFAAkF;IAClF,KAAK,CAAC,EAAE,MAAM,CAAC;CAChB;AAED,iEAAiE;AACjE,wBAAsB,cAAc,CAClC,OAAO,EAAE,YAAY,EACrB,SAAS,EAAE,MAAM,EAAE,EACnB,GAAG,EAAE,MAAM,EACX,KAAK,EAAE,MAAM,CAAC,MAAM,EAAE,SAAS,CAAC,EAChC,OAAO,EAAE,gBAAgB,GACxB,OAAO,CAAC,eAAe,CAAC,CAkB1B;AAED,+DAA+D;AAC/D,wBAAsB,aAAa,CAAC,OAAO,EAAE,YAAY,EAAE,MAAM,EAAE,eAAe,GAAG,OAAO,CAAC,IAAI,CAAC,CAYjG"}

package/dist/store/internal/item-mapper.js

@@ -1,53 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.narrowStoreRecord = narrowStoreRecord;
-exports.buildStoreItem = buildStoreItem;
-exports.readStoreItem = readStoreItem;
-const codec_1 = require("../../shared/codec/codec");
-const keys_1 = require("./keys");
-/**
- * Narrow a raw scanned row to a {@link StoreItemRecord}, or `undefined` for a
- * foreign row on a shared table (no `namespace`). Replaces an unchecked cast at
- * the scan boundary, the one place rows are not written by this library.
- */
-function narrowStoreRecord(raw) {
-    return Array.isArray(raw.namespace) ? raw : undefined;
-}
-/** Map a store context to the codec collaborators. */
-function storeCodecDeps(context) {
-    return { serde: context.serde, compression: context.compression, offloader: context.offloader };
-}
-/** Encode a value into the DynamoDB record for a stored item. */
-async function buildStoreItem(context, namespace, key, value, options) {
-    const descriptor = await (0, codec_1.encodePayload)(value, storeCodecDeps(context), {
-        keyParts: options.nonce === undefined ? [...namespace, key] : [...namespace, key, options.nonce],
-    });
-    const record = {
-        PK: (0, keys_1.partitionKey)(namespace),
-        SK: (0, keys_1.sortKey)(namespace, key),
-        namespace,
-        key,
-        value: descriptor,
-        createdAt: options.createdAt,
-        updatedAt: options.updatedAt,
-    };
-    if (options.embedding)
-        record.embedding = options.embedding;
-    if (options.ttlTimestamp !== undefined)
-        record.ttl = options.ttlTimestamp;
-    if (options.nonce !== undefined)
-        record.rev = options.nonce;
-    return record;
-}
-/** Decode a DynamoDB record back into a store {@link Item}. */
-async function readStoreItem(context, record) {
-    const value = await (0, codec_1.decodePayload)(record.value, storeCodecDeps(context));
-    return {
-        namespace: record.namespace,
-        key: record.key,
-        value,
-        createdAt: new Date(record.createdAt),
-        updatedAt: new Date(record.updatedAt),
-    };
-}
-//# sourceMappingURL=item-mapper.js.map

package/dist/store/internal/item-mapper.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"item-mapper.js","sourceRoot":"","sources":["../../../src/store/internal/item-mapper.ts"],"names":[],"mappings":";;;;;AAEA,oDAAwF;AAIxF,iCAA+C;AAG/C;;;;GAIG;AACH,2BAAkC,GAAY;IAC5C,OAAO,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,CAAE,GAAuB,CAAC,CAAC,CAAC,SAAS,CAAC;AAC7E,CAAC;AAED,sDAAsD;AACtD,SAAS,cAAc,CAAC,OAAqB;IAC3C,OAAO,EAAE,KAAK,EAAE,OAAO,CAAC,KAAK,EAAE,WAAW,EAAE,OAAO,CAAC,WAAW,EAAE,SAAS,EAAE,OAAO,CAAC,SAAS,EAAE,CAAC;AAClG,CAAC;AAYD,iEAAiE;AAC1D,KAAK,yBACV,OAAqB,EACrB,SAAmB,EACnB,GAAW,EACX,KAAgC,EAChC,OAAyB;IAEzB,MAAM,UAAU,GAAG,MAAM,IAAA,qBAAa,EAAC,KAAK,EAAE,cAAc,CAAC,OAAO,CAAC,EAAE;QACrE,QAAQ,EACN,OAAO,CAAC,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,CAAC,GAAG,SAAS,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,SAAS,EAAE,GAAG,EAAE,OAAO,CAAC,KAAK,CAAC;KACzF,CAAC,CAAC;IACH,MAAM,MAAM,GAAoB;QAC9B,EAAE,EAAE,IAAA,mBAAY,EAAC,SAAS,CAAC;QAC3B,EAAE,EAAE,IAAA,cAAO,EAAC,SAAS,EAAE,GAAG,CAAC;QAC3B,SAAS;QACT,GAAG;QACH,KAAK,EAAE,UAAU;QACjB,SAAS,EAAE,OAAO,CAAC,SAAS;QAC5B,SAAS,EAAE,OAAO,CAAC,SAAS;KAC7B,CAAC;IACF,IAAI,OAAO,CAAC,SAAS;QAAE,MAAM,CAAC,SAAS,GAAG,OAAO,CAAC,SAAS,CAAC;IAC5D,IAAI,OAAO,CAAC,YAAY,KAAK,SAAS;QAAE,MAAM,CAAC,GAAG,GAAG,OAAO,CAAC,YAAY,CAAC;IAC1E,IAAI,OAAO,CAAC,KAAK,KAAK,SAAS;QAAE,MAAM,CAAC,GAAG,GAAG,OAAO,CAAC,KAAK,CAAC;IAC5D,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,+DAA+D;AACxD,KAAK,wBAAwB,OAAqB,EAAE,MAAuB;IAChF,MAAM,KAAK,GAAG,MAAM,IAAA,qBAAa,EAC/B,MAAM,CAAC,KAAK,EACZ,cAAc,CAAC,OAAO,CAAC,CACxB,CAAC;IACF,OAAO;QACL,SAAS,EAAE,MAAM,CAAC,SAAS;QAC3B,GAAG,EAAE,MAAM,CAAC,GAAG;QACf,KAAK;QACL,SAAS,EAAE,IAAI,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC;QACrC,SAAS,EAAE,IAAI,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC;KACtC,CAAC;AACJ,CAAC"}

package/dist/store/internal/keys.d.ts

@@ -1,18 +0,0 @@
-/** Separator joining namespace elements (and the trailing key) in the sort key. */
-export declare const NAMESPACE_SEPARATOR = "#";
-/** Partition key for an item: the adapter tag plus the scope-root element. */
-export declare function partitionKey(namespace: string[]): string;
-/** Sort key: the rest of the namespace plus the key, separator-joined. */
-export declare function sortKey(namespace: string[], key: string): string;
-/**
- * `begins_with` prefix selecting a scoped subtree within `prefix[0]`'s
- * partition. Terminated with the separator so `['users','u1']` does not match a
- * sibling like `u10`. An empty rest yields '' (matches the whole partition).
- */
-export declare function sortKeyPrefix(prefix: string[]): string;
-/**
- * True when `namespace` starts with `prefix`, compared element-by-element (not
- * as a string prefix, so ["userspace"] does not match prefix ["users"]).
- */
-export declare function namespaceMatchesPrefix(namespace: string[], prefix: string[]): boolean;
-//# sourceMappingURL=keys.d.ts.map

package/dist/store/internal/keys.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"keys.d.ts","sourceRoot":"","sources":["../../../src/store/internal/keys.ts"],"names":[],"mappings":"AAAA,mFAAmF;AACnF,eAAO,MAAM,mBAAmB,MAAM,CAAC;AASvC,8EAA8E;AAC9E,wBAAgB,YAAY,CAAC,SAAS,EAAE,MAAM,EAAE,GAAG,MAAM,CAExD;AAED,0EAA0E;AAC1E,wBAAgB,OAAO,CAAC,SAAS,EAAE,MAAM,EAAE,EAAE,GAAG,EAAE,MAAM,GAAG,MAAM,CAEhE;AAED;;;;GAIG;AACH,wBAAgB,aAAa,CAAC,MAAM,EAAE,MAAM,EAAE,GAAG,MAAM,CAGtD;AAED;;;GAGG;AACH,wBAAgB,sBAAsB,CAAC,SAAS,EAAE,MAAM,EAAE,EAAE,MAAM,EAAE,MAAM,EAAE,GAAG,OAAO,CAGrF"}

package/dist/store/internal/keys.js

@@ -1,42 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.NAMESPACE_SEPARATOR = void 0;
-exports.partitionKey = partitionKey;
-exports.sortKey = sortKey;
-exports.sortKeyPrefix = sortKeyPrefix;
-exports.namespaceMatchesPrefix = namespaceMatchesPrefix;
-/** Separator joining namespace elements (and the trailing key) in the sort key. */
-exports.NAMESPACE_SEPARATOR = '#';
-/**
- * Adapter tag prefixed to every store partition key — see the equivalent in
- * checkpointer/internal/keys.ts for why the three adapters' partitions must
- * not overlap on a shared table.
- */
-const ADAPTER_PARTITION_PREFIX = `STORE${exports.NAMESPACE_SEPARATOR}`;
-/** Partition key for an item: the adapter tag plus the scope-root element. */
-function partitionKey(namespace) {
-    return `${ADAPTER_PARTITION_PREFIX}${namespace[0]}`;
-}
-/** Sort key: the rest of the namespace plus the key, separator-joined. */
-function sortKey(namespace, key) {
-    return [...namespace.slice(1), key].join(exports.NAMESPACE_SEPARATOR);
-}
-/**
- * `begins_with` prefix selecting a scoped subtree within `prefix[0]`'s
- * partition. Terminated with the separator so `['users','u1']` does not match a
- * sibling like `u10`. An empty rest yields '' (matches the whole partition).
- */
-function sortKeyPrefix(prefix) {
-    const rest = prefix.slice(1);
-    return rest.length === 0 ? '' : `${rest.join(exports.NAMESPACE_SEPARATOR)}${exports.NAMESPACE_SEPARATOR}`;
-}
-/**
- * True when `namespace` starts with `prefix`, compared element-by-element (not
- * as a string prefix, so ["userspace"] does not match prefix ["users"]).
- */
-function namespaceMatchesPrefix(namespace, prefix) {
-    if (prefix.length > namespace.length)
-        return false;
-    return prefix.every((element, index) => namespace[index] === element);
-}
-//# sourceMappingURL=keys.js.map

package/dist/store/internal/keys.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"keys.js","sourceRoot":"","sources":["../../../src/store/internal/keys.ts"],"names":[],"mappings":";;;;;;;AAAA,mFAAmF;AACtE,QAAA,mBAAmB,GAAG,GAAG,CAAC;AAEvC;;;;GAIG;AACH,MAAM,wBAAwB,GAAG,QAAQ,QAAA,mBAAmB,EAAE,CAAC;AAE/D,8EAA8E;AAC9E,sBAA6B,SAAmB;IAC9C,OAAO,GAAG,wBAAwB,GAAG,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC;AACtD,CAAC;AAED,0EAA0E;AAC1E,iBAAwB,SAAmB,EAAE,GAAW;IACtD,OAAO,CAAC,GAAG,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,IAAI,CAAC,QAAA,mBAAmB,CAAC,CAAC;AAChE,CAAC;AAED;;;;GAIG;AACH,uBAA8B,MAAgB;IAC5C,MAAM,IAAI,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAC7B,OAAO,IAAI,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,QAAA,mBAAmB,CAAC,GAAG,QAAA,mBAAmB,EAAE,CAAC;AAC5F,CAAC;AAED;;;GAGG;AACH,gCAAuC,SAAmB,EAAE,MAAgB;IAC1E,IAAI,MAAM,CAAC,MAAM,GAAG,SAAS,CAAC,MAAM;QAAE,OAAO,KAAK,CAAC;IACnD,OAAO,MAAM,CAAC,KAAK,CAAC,CAAC,OAAO,EAAE,KAAK,EAAE,EAAE,CAAC,SAAS,CAAC,KAAK,CAAC,KAAK,OAAO,CAAC,CAAC;AACxE,CAAC"}

package/dist/store/internal/namespace-match.d.ts

@@ -1,12 +0,0 @@
-import type { MatchCondition } from '@langchain/langgraph-checkpoint';
-/** True when `namespace` satisfies a prefix/suffix match condition (with `*`). */
-export declare function matchNamespace(namespace: string[], condition: MatchCondition): boolean;
-/** Cap a namespace to at most `maxDepth` elements (no-op when undefined). */
-export declare function truncateDepth(namespace: string[], maxDepth?: number): string[];
-/**
- * Leading concrete (non-wildcard) elements of the first prefix condition. An
- * empty result means the listing cannot be scoped to a single partition and
- * must fall back to a Scan.
- */
-export declare function prefixRoot(conditions?: MatchCondition[]): string[];
-//# sourceMappingURL=namespace-match.d.ts.map

package/dist/store/internal/namespace-match.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"namespace-match.d.ts","sourceRoot":"","sources":["../../../src/store/internal/namespace-match.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,iCAAiC,CAAC;AAQtE,kFAAkF;AAClF,wBAAgB,cAAc,CAAC,SAAS,EAAE,MAAM,EAAE,EAAE,SAAS,EAAE,cAAc,GAAG,OAAO,CAQtF;AAED,6EAA6E;AAC7E,wBAAgB,aAAa,CAAC,SAAS,EAAE,MAAM,EAAE,EAAE,QAAQ,CAAC,EAAE,MAAM,GAAG,MAAM,EAAE,CAE9E;AAED;;;;GAIG;AACH,wBAAgB,UAAU,CAAC,UAAU,CAAC,EAAE,cAAc,EAAE,GAAG,MAAM,EAAE,CASlE"}

package/dist/store/internal/namespace-match.js

@@ -1,41 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.matchNamespace = matchNamespace;
-exports.truncateDepth = truncateDepth;
-exports.prefixRoot = prefixRoot;
-const WILDCARD = '*';
-function segmentMatches(actual, path) {
-    return path.every((element, index) => element === WILDCARD || element === actual[index]);
-}
-/** True when `namespace` satisfies a prefix/suffix match condition (with `*`). */
-function matchNamespace(namespace, condition) {
-    const { matchType, path } = condition;
-    if (path.length > namespace.length)
-        return false;
-    const slice = matchType === 'prefix'
-        ? namespace.slice(0, path.length)
-        : namespace.slice(namespace.length - path.length);
-    return segmentMatches(slice, path);
-}
-/** Cap a namespace to at most `maxDepth` elements (no-op when undefined). */
-function truncateDepth(namespace, maxDepth) {
-    return maxDepth === undefined ? namespace : namespace.slice(0, maxDepth);
-}
-/**
- * Leading concrete (non-wildcard) elements of the first prefix condition. An
- * empty result means the listing cannot be scoped to a single partition and
- * must fall back to a Scan.
- */
-function prefixRoot(conditions) {
-    const prefixCondition = conditions?.find((condition) => condition.matchType === 'prefix');
-    if (!prefixCondition)
-        return [];
-    const root = [];
-    for (const element of prefixCondition.path) {
-        if (element === WILDCARD)
-            break;
-        root.push(element);
-    }
-    return root;
-}
-//# sourceMappingURL=namespace-match.js.map

package/dist/store/internal/namespace-match.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"namespace-match.js","sourceRoot":"","sources":["../../../src/store/internal/namespace-match.ts"],"names":[],"mappings":";;;;;AAEA,MAAM,QAAQ,GAAG,GAAG,CAAC;AAErB,SAAS,cAAc,CAAC,MAAgB,EAAE,IAAsB;IAC9D,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,OAAO,EAAE,KAAK,EAAE,EAAE,CAAC,OAAO,KAAK,QAAQ,IAAI,OAAO,KAAK,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC;AAC3F,CAAC;AAED,kFAAkF;AAClF,wBAA+B,SAAmB,EAAE,SAAyB;IAC3E,MAAM,EAAE,SAAS,EAAE,IAAI,EAAE,GAAG,SAAS,CAAC;IACtC,IAAI,IAAI,CAAC,MAAM,GAAG,SAAS,CAAC,MAAM;QAAE,OAAO,KAAK,CAAC;IACjD,MAAM,KAAK,GACT,SAAS,KAAK,QAAQ;QACpB,CAAC,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC;QACjC,CAAC,CAAC,SAAS,CAAC,KAAK,CAAC,SAAS,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC;IACtD,OAAO,cAAc,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;AACrC,CAAC;AAED,6EAA6E;AAC7E,uBAA8B,SAAmB,EAAE,QAAiB;IAClE,OAAO,QAAQ,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC;AAC3E,CAAC;AAED;;;;GAIG;AACH,oBAA2B,UAA6B;IACtD,MAAM,eAAe,GAAG,UAAU,EAAE,IAAI,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,SAAS,CAAC,SAAS,KAAK,QAAQ,CAAC,CAAC;IAC1F,IAAI,CAAC,eAAe;QAAE,OAAO,EAAE,CAAC;IAChC,MAAM,IAAI,GAAa,EAAE,CAAC;IAC1B,KAAK,MAAM,OAAO,IAAI,eAAe,CAAC,IAAI,EAAE,CAAC;QAC3C,IAAI,OAAO,KAAK,QAAQ;YAAE,MAAM;QAChC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IACrB,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC"}

package/dist/store/internal/overwrite-swap.d.ts

@@ -1,33 +0,0 @@
-import type { StoreItemRecord } from '../types';
-import { type ExistingRecordMeta } from './read-existing';
-import type { StoreContext } from './setup';
-/**
- * Commit `record`, re-reading and retrying while another writer holds the row,
- * and return the state this write actually superseded — the only descriptor
- * safe to delete afterwards.
- *
- * Without the swap both racers read the same previous descriptor, both commit,
- * and both delete it, orphaning the loser's own upload. Retrying against the
- * *re-read* state is what makes each writer supersede exactly one payload.
- *
- * A rejection is not proof a competitor won: `withDynamoDBRetry` retries
- * transient errors, so an attempt can commit server-side, its response can be
- * lost, and the retried put can hit the row it just wrote and fail the same
- * guard — indistinguishable from a competitor's win by the rejection alone.
- * Each attempt's pinned observation is captured in `attempted` before the
- * put, so that when a re-read finds the row already holding *this call's
- * own* `rev`, the swap returns whatever `attempted` held — never this
- * record's own just-committed value, which would strand the live row
- * pointing at a deleted object. That comparison is guarded on `rev` being
- * set: `rev` is optional on the record type, and an unnonced record against a
- * pre-0.9.0 revision-less row would otherwise match `undefined === undefined`
- * and claim a race it never entered.
- *
- * On exhaustion the write proceeds unconditionally and warns. That is
- * deliberate: the fallback is precisely the pre-0.9.0 behaviour — one possible
- * orphan, reclaimed by a lifecycle rule — so pathological contention degrades
- * instead of turning a working put into an error. `createdAt` is refreshed from
- * each re-read so a row created by whoever won keeps its true creation time.
- */
-export declare function putWithRevisionSwap(context: StoreContext, record: StoreItemRecord, existing: ExistingRecordMeta): Promise<ExistingRecordMeta>;
-//# sourceMappingURL=overwrite-swap.d.ts.map

package/dist/store/internal/overwrite-swap.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"overwrite-swap.d.ts","sourceRoot":"","sources":["../../../src/store/internal/overwrite-swap.ts"],"names":[],"mappings":"AAOA,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,UAAU,CAAC;AAChD,OAAO,EAAE,KAAK,kBAAkB,EAAgB,MAAM,iBAAiB,CAAC;AACxE,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,SAAS,CAAC;AAc5C;;;;;;;;;;;;;;;;;;;;;;;;;;;GA2BG;AACH,wBAAsB,mBAAmB,CACvC,OAAO,EAAE,YAAY,EACrB,MAAM,EAAE,eAAe,EACvB,QAAQ,EAAE,kBAAkB,GAC3B,OAAO,CAAC,kBAAkB,CAAC,CAqB7B"}

package/dist/store/internal/overwrite-swap.js

@@ -1,62 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.putWithRevisionSwap = putWithRevisionSwap;
-const conditional_put_1 = require("../../shared/dynamodb/conditional-put");
-const retry_1 = require("../../shared/dynamodb/retry");
-const read_existing_1 = require("./read-existing");
-/** Put the record, optionally pinned to the revision the caller observed. */
-async function put(context, record, observed) {
-    const guard = observed ? (0, conditional_put_1.revisionGuard)(conditional_put_1.REVISION_ATTRIBUTE, observed) : {};
-    await (0, retry_1.withDynamoDBRetry)(() => context.client.put({ TableName: context.tableName, Item: record, ...guard }));
-}
-/**
- * Commit `record`, re-reading and retrying while another writer holds the row,
- * and return the state this write actually superseded — the only descriptor
- * safe to delete afterwards.
- *
- * Without the swap both racers read the same previous descriptor, both commit,
- * and both delete it, orphaning the loser's own upload. Retrying against the
- * *re-read* state is what makes each writer supersede exactly one payload.
- *
- * A rejection is not proof a competitor won: `withDynamoDBRetry` retries
- * transient errors, so an attempt can commit server-side, its response can be
- * lost, and the retried put can hit the row it just wrote and fail the same
- * guard — indistinguishable from a competitor's win by the rejection alone.
- * Each attempt's pinned observation is captured in `attempted` before the
- * put, so that when a re-read finds the row already holding *this call's
- * own* `rev`, the swap returns whatever `attempted` held — never this
- * record's own just-committed value, which would strand the live row
- * pointing at a deleted object. That comparison is guarded on `rev` being
- * set: `rev` is optional on the record type, and an unnonced record against a
- * pre-0.9.0 revision-less row would otherwise match `undefined === undefined`
- * and claim a race it never entered.
- *
- * On exhaustion the write proceeds unconditionally and warns. That is
- * deliberate: the fallback is precisely the pre-0.9.0 behaviour — one possible
- * orphan, reclaimed by a lifecycle rule — so pathological contention degrades
- * instead of turning a working put into an error. `createdAt` is refreshed from
- * each re-read so a row created by whoever won keeps its true creation time.
- */
-async function putWithRevisionSwap(context, record, existing) {
-    let observed = existing;
-    for (let attempt = 1; attempt <= conditional_put_1.OVERWRITE_CAS_MAX_ATTEMPTS; attempt++) {
-        const attempted = observed;
-        try {
-            await put(context, record, attempted);
-            return attempted;
-        }
-        catch (error) {
-            if (!(0, conditional_put_1.isConditionalCheckFailed)(error))
-                throw error;
-            observed = await (0, read_existing_1.readExisting)(context, record.PK, record.SK);
-            if (record.rev !== undefined && observed.revision === record.rev)
-                return attempted;
-            record.createdAt = observed.createdAt ?? record.createdAt;
-        }
-    }
-    context.logger.warn('store.put: compare-and-swap exhausted; overwriting unconditionally, which can orphan one ' +
-        'S3 object under a concurrent put (reclaimed by ensureS3LifecycleRule)', { namespace: record.namespace, key: record.key, attempts: conditional_put_1.OVERWRITE_CAS_MAX_ATTEMPTS });
-    await put(context, record);
-    return observed;
-}
-//# sourceMappingURL=overwrite-swap.js.map

package/dist/store/internal/overwrite-swap.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"overwrite-swap.js","sourceRoot":"","sources":["../../../src/store/internal/overwrite-swap.ts"],"names":[],"mappings":";;;AAAA,2EAK+C;AAC/C,uDAAgE;AAEhE,mDAAwE;AAGxE,6EAA6E;AAC7E,KAAK,UAAU,GAAG,CAChB,OAAqB,EACrB,MAAuB,EACvB,QAA6B;IAE7B,MAAM,KAAK,GAAG,QAAQ,CAAC,CAAC,CAAC,IAAA,+BAAa,EAAC,oCAAkB,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;IAC1E,MAAM,IAAA,yBAAiB,EAAC,GAAG,EAAE,CAC3B,OAAO,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,SAAS,EAAE,OAAO,CAAC,SAAS,EAAE,IAAI,EAAE,MAAM,EAAE,GAAG,KAAK,EAAE,CAAC,CAC7E,CAAC;AACJ,CAAC;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;GA2BG;AACI,KAAK,8BACV,OAAqB,EACrB,MAAuB,EACvB,QAA4B;IAE5B,IAAI,QAAQ,GAAG,QAAQ,CAAC;IACxB,KAAK,IAAI,OAAO,GAAG,CAAC,EAAE,OAAO,IAAI,4CAA0B,EAAE,OAAO,EAAE,EAAE,CAAC;QACvE,MAAM,SAAS,GAAG,QAAQ,CAAC;QAC3B,IAAI,CAAC;YACH,MAAM,GAAG,CAAC,OAAO,EAAE,MAAM,EAAE,SAAS,CAAC,CAAC;YACtC,OAAO,SAAS,CAAC;QACnB,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,IAAI,CAAC,IAAA,0CAAwB,EAAC,KAA0B,CAAC;gBAAE,MAAM,KAAK,CAAC;YACvE,QAAQ,GAAG,MAAM,IAAA,4BAAY,EAAC,OAAO,EAAE,MAAM,CAAC,EAAE,EAAE,MAAM,CAAC,EAAE,CAAC,CAAC;YAC7D,IAAI,MAAM,CAAC,GAAG,KAAK,SAAS,IAAI,QAAQ,CAAC,QAAQ,KAAK,MAAM,CAAC,GAAG;gBAAE,OAAO,SAAS,CAAC;YACnF,MAAM,CAAC,SAAS,GAAG,QAAQ,CAAC,SAAS,IAAI,MAAM,CAAC,SAAS,CAAC;QAC5D,CAAC;IACH,CAAC;IACD,OAAO,CAAC,MAAM,CAAC,IAAI,CACjB,2FAA2F;QACzF,uEAAuE,EACzE,EAAE,SAAS,EAAE,MAAM,CAAC,SAAS,EAAE,GAAG,EAAE,MAAM,CAAC,GAAG,EAAE,QAAQ,EAAE,4CAA0B,EAAE,CACvF,CAAC;IACF,MAAM,GAAG,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC;IAC3B,OAAO,QAAQ,CAAC;AAClB,CAAC"}