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

package/lib/test/unit/ingest/cycleGuard.test.d.ts.map

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

package/lib/test/unit/ingest/cycleGuard.test.js

@@ -1,83 +0,0 @@
-"use strict";
-/*
- * Copyright (c) 2026 Erik Fortune
- * SPDX-License-Identifier: MIT
- */
-Object.defineProperty(exports, "__esModule", { value: true });
-require("@fgv/ts-utils-jest");
-const index_1 = require("../../../index");
-const rel = 'rel';
-const DEFAULT_SCOPE = 'exp';
-/** A scope-qualified node, `scope#id` or a bare id defaulting to {@link DEFAULT_SCOPE}. */
-function node(spec) {
-    const hash = spec.indexOf('#');
-    const scope = hash >= 0 ? spec.slice(0, hash) : DEFAULT_SCOPE;
-    const id = hash >= 0 ? spec.slice(hash + 1) : spec;
-    return { scope: scope, id: id };
-}
-function edge(source, target, type = rel) {
-    return { source: node(source), target: node(target), type };
-}
-describe('buildCycleKey', () => {
-    test('is deterministic for the same edge', () => {
-        expect((0, index_1.buildCycleKey)(edge('a', 'b'))).toSucceedAndSatisfy((key) => {
-            expect((0, index_1.buildCycleKey)(edge('a', 'b'))).toSucceedWith(key);
-        });
-    });
-    test('differs by direction and type', () => {
-        const forward = (0, index_1.buildCycleKey)(edge('a', 'b')).orThrow();
-        const reverse = (0, index_1.buildCycleKey)(edge('b', 'a')).orThrow();
-        const typed = (0, index_1.buildCycleKey)(edge('a', 'b', 'other')).orThrow();
-        expect(forward).not.toBe(reverse);
-        expect(forward).not.toBe(typed);
-    });
-});
-describe('assertNoCycles', () => {
-    test('accepts an acyclic graph', () => {
-        expect((0, index_1.assertNoCycles)([edge('a', 'b')], [edge('b', 'c'), edge('c', 'd')])).toSucceed();
-    });
-    test('rejects a proposed edge that closes a cycle against existing edges', () => {
-        expect((0, index_1.assertNoCycles)([edge('a', 'b'), edge('b', 'c')], [edge('c', 'a')])).toFailWith(/would create a cycle/);
-    });
-    test('rejects a cycle formed entirely within the proposed batch', () => {
-        expect((0, index_1.assertNoCycles)([], [edge('a', 'b'), edge('b', 'a')])).toFailWith(/would create a cycle/);
-    });
-    test('rejects a self-loop', () => {
-        expect((0, index_1.assertNoCycles)([], [edge('a', 'a')])).toFailWith(/self-loop/);
-    });
-    test('tolerates a duplicate proposed edge (deduped by canonical key)', () => {
-        expect((0, index_1.assertNoCycles)([], [edge('a', 'b'), edge('a', 'b')])).toSucceed();
-    });
-    test('tolerates a duplicate existing edge', () => {
-        expect((0, index_1.assertNoCycles)([edge('a', 'b'), edge('a', 'b')], [edge('b', 'c')])).toSucceed();
-    });
-    test('accepts a diamond (shared descendant is not a cycle)', () => {
-        expect((0, index_1.assertNoCycles)([], [edge('a', 'b'), edge('a', 'c'), edge('b', 'd'), edge('c', 'd')])).toSucceed();
-    });
-    test('reachability tolerates a frontier node reached by two paths (revisit guard)', () => {
-        // Existing graph: a->c, a->b, b->c. A proposed edge z->a runs reachability
-        // from `a`, whose DFS pushes `c` twice before it is visited — exercising the
-        // visited-node skip in the traversal.
-        expect((0, index_1.assertNoCycles)([edge('a', 'c'), edge('a', 'b'), edge('b', 'c')], [edge('z', 'a')])).toSucceed();
-    });
-    describe('scope-qualified nodes', () => {
-        test('does NOT conflate a stem shared across scopes into one node', () => {
-            // ca#x -> cb#y and cb#x -> ca#z reuse the stem `x` across scopes ca/cb.
-            // If the guard keyed on bare id, the two `x` nodes would merge and a false
-            // cycle could appear; with scoped keys they are distinct and the graph is acyclic.
-            expect((0, index_1.assertNoCycles)([], [edge('ca#x', 'cb#y'), edge('cb#x', 'ca#z')])).toSucceed();
-        });
-        test('still rejects a genuine within-scope cycle across the same stems', () => {
-            expect((0, index_1.assertNoCycles)([], [edge('ca#x', 'ca#y'), edge('ca#y', 'ca#x')])).toFailWith(/would create a cycle/);
-        });
-        test('a self-loop is detected on the full scoped identity', () => {
-            expect((0, index_1.assertNoCycles)([], [edge('ca#x', 'ca#x')])).toFailWith(/self-loop/);
-            // Same stem, different scope is NOT a self-loop.
-            expect((0, index_1.assertNoCycles)([], [edge('ca#x', 'cb#x')])).toSucceed();
-        });
-        test('names the scope in the diagnostic', () => {
-            expect((0, index_1.assertNoCycles)([], [edge('ca#x', 'ca#x')])).toFailWith(/ca\/x/);
-        });
-    });
-});
-//# sourceMappingURL=cycleGuard.test.js.map

package/lib/test/unit/ingest/cycleGuard.test.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"cycleGuard.test.js","sourceRoot":"","sources":["../../../../src/test/unit/ingest/cycleGuard.test.ts"],"names":[],"mappings":";AAAA;;;GAGG;;AAEH,8BAA4B;AAC5B,0CAQwB;AAExB,MAAM,GAAG,GAAa,KAAiB,CAAC;AACxC,MAAM,aAAa,GAAW,KAAK,CAAC;AAEpC,2FAA2F;AAC3F,SAAS,IAAI,CAAC,IAAY;IACxB,MAAM,IAAI,GAAW,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;IACvC,MAAM,KAAK,GAAW,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC;IACtE,MAAM,EAAE,GAAW,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;IAC3D,OAAO,EAAE,KAAK,EAAE,KAAuB,EAAE,EAAE,EAAE,EAAc,EAAE,CAAC;AAChE,CAAC;AAED,SAAS,IAAI,CAAC,MAAc,EAAE,MAAc,EAAE,OAAiB,GAAG;IAChE,OAAO,EAAE,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC,EAAE,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC,EAAE,IAAI,EAAE,CAAC;AAC9D,CAAC;AAED,QAAQ,CAAC,eAAe,EAAE,GAAG,EAAE;IAC7B,IAAI,CAAC,oCAAoC,EAAE,GAAG,EAAE;QAC9C,MAAM,CAAC,IAAA,qBAAa,EAAC,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,mBAAmB,CAAC,CAAC,GAAW,EAAE,EAAE;YACxE,MAAM,CAAC,IAAA,qBAAa,EAAC,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC;QAC3D,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,+BAA+B,EAAE,GAAG,EAAE;QACzC,MAAM,OAAO,GAAG,IAAA,qBAAa,EAAC,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;QACxD,MAAM,OAAO,GAAG,IAAA,qBAAa,EAAC,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;QACxD,MAAM,KAAK,GAAG,IAAA,qBAAa,EAAC,IAAI,CAAC,GAAG,EAAE,GAAG,EAAE,OAAmB,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;QAC3E,MAAM,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QAClC,MAAM,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAClC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,QAAQ,CAAC,gBAAgB,EAAE,GAAG,EAAE;IAC9B,IAAI,CAAC,0BAA0B,EAAE,GAAG,EAAE;QACpC,MAAM,CAAC,IAAA,sBAAc,EAAC,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC;IACzF,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,oEAAoE,EAAE,GAAG,EAAE;QAC9E,MAAM,CAAC,IAAA,sBAAc,EAAC,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,UAAU,CACnF,sBAAsB,CACvB,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,2DAA2D,EAAE,GAAG,EAAE;QACrE,MAAM,CAAC,IAAA,sBAAc,EAAC,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,sBAAsB,CAAC,CAAC;IAClG,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,qBAAqB,EAAE,GAAG,EAAE;QAC/B,MAAM,CAAC,IAAA,sBAAc,EAAC,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,WAAW,CAAC,CAAC;IACvE,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,gEAAgE,EAAE,GAAG,EAAE;QAC1E,MAAM,CAAC,IAAA,sBAAc,EAAC,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC;IAC3E,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,qCAAqC,EAAE,GAAG,EAAE;QAC/C,MAAM,CAAC,IAAA,sBAAc,EAAC,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC;IACzF,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,sDAAsD,EAAE,GAAG,EAAE;QAChE,MAAM,CAAC,IAAA,sBAAc,EAAC,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC;IAC3G,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,6EAA6E,EAAE,GAAG,EAAE;QACvF,2EAA2E;QAC3E,6EAA6E;QAC7E,sCAAsC;QACtC,MAAM,CAAC,IAAA,sBAAc,EAAC,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC;IACzG,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,uBAAuB,EAAE,GAAG,EAAE;QACrC,IAAI,CAAC,6DAA6D,EAAE,GAAG,EAAE;YACvE,wEAAwE;YACxE,2EAA2E;YAC3E,mFAAmF;YACnF,MAAM,CAAC,IAAA,sBAAc,EAAC,EAAE,EAAE,CAAC,IAAI,CAAC,MAAM,EAAE,MAAM,CAAC,EAAE,IAAI,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC;QACvF,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,kEAAkE,EAAE,GAAG,EAAE;YAC5E,MAAM,CAAC,IAAA,sBAAc,EAAC,EAAE,EAAE,CAAC,IAAI,CAAC,MAAM,EAAE,MAAM,CAAC,EAAE,IAAI,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,UAAU,CACjF,sBAAsB,CACvB,CAAC;QACJ,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,qDAAqD,EAAE,GAAG,EAAE;YAC/D,MAAM,CAAC,IAAA,sBAAc,EAAC,EAAE,EAAE,CAAC,IAAI,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,WAAW,CAAC,CAAC;YAC3E,iDAAiD;YACjD,MAAM,CAAC,IAAA,sBAAc,EAAC,EAAE,EAAE,CAAC,IAAI,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC;QACjE,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,mCAAmC,EAAE,GAAG,EAAE;YAC7C,MAAM,CAAC,IAAA,sBAAc,EAAC,EAAE,EAAE,CAAC,IAAI,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;QACzE,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC","sourcesContent":["/*\n * Copyright (c) 2026 Erik Fortune\n * SPDX-License-Identifier: MIT\n */\n\nimport '@fgv/ts-utils-jest';\nimport {\n  ICycleGuardEdge,\n  IEdgeTarget,\n  LinkType,\n  MemoryId,\n  MemoryScopeKey,\n  assertNoCycles,\n  buildCycleKey\n} from '../../../index';\n\nconst rel: LinkType = 'rel' as LinkType;\nconst DEFAULT_SCOPE: string = 'exp';\n\n/** A scope-qualified node, `scope#id` or a bare id defaulting to {@link DEFAULT_SCOPE}. */\nfunction node(spec: string): IEdgeTarget {\n  const hash: number = spec.indexOf('#');\n  const scope: string = hash >= 0 ? spec.slice(0, hash) : DEFAULT_SCOPE;\n  const id: string = hash >= 0 ? spec.slice(hash + 1) : spec;\n  return { scope: scope as MemoryScopeKey, id: id as MemoryId };\n}\n\nfunction edge(source: string, target: string, type: LinkType = rel): ICycleGuardEdge {\n  return { source: node(source), target: node(target), type };\n}\n\ndescribe('buildCycleKey', () => {\n  test('is deterministic for the same edge', () => {\n    expect(buildCycleKey(edge('a', 'b'))).toSucceedAndSatisfy((key: string) => {\n      expect(buildCycleKey(edge('a', 'b'))).toSucceedWith(key);\n    });\n  });\n\n  test('differs by direction and type', () => {\n    const forward = buildCycleKey(edge('a', 'b')).orThrow();\n    const reverse = buildCycleKey(edge('b', 'a')).orThrow();\n    const typed = buildCycleKey(edge('a', 'b', 'other' as LinkType)).orThrow();\n    expect(forward).not.toBe(reverse);\n    expect(forward).not.toBe(typed);\n  });\n});\n\ndescribe('assertNoCycles', () => {\n  test('accepts an acyclic graph', () => {\n    expect(assertNoCycles([edge('a', 'b')], [edge('b', 'c'), edge('c', 'd')])).toSucceed();\n  });\n\n  test('rejects a proposed edge that closes a cycle against existing edges', () => {\n    expect(assertNoCycles([edge('a', 'b'), edge('b', 'c')], [edge('c', 'a')])).toFailWith(\n      /would create a cycle/\n    );\n  });\n\n  test('rejects a cycle formed entirely within the proposed batch', () => {\n    expect(assertNoCycles([], [edge('a', 'b'), edge('b', 'a')])).toFailWith(/would create a cycle/);\n  });\n\n  test('rejects a self-loop', () => {\n    expect(assertNoCycles([], [edge('a', 'a')])).toFailWith(/self-loop/);\n  });\n\n  test('tolerates a duplicate proposed edge (deduped by canonical key)', () => {\n    expect(assertNoCycles([], [edge('a', 'b'), edge('a', 'b')])).toSucceed();\n  });\n\n  test('tolerates a duplicate existing edge', () => {\n    expect(assertNoCycles([edge('a', 'b'), edge('a', 'b')], [edge('b', 'c')])).toSucceed();\n  });\n\n  test('accepts a diamond (shared descendant is not a cycle)', () => {\n    expect(assertNoCycles([], [edge('a', 'b'), edge('a', 'c'), edge('b', 'd'), edge('c', 'd')])).toSucceed();\n  });\n\n  test('reachability tolerates a frontier node reached by two paths (revisit guard)', () => {\n    // Existing graph: a->c, a->b, b->c. A proposed edge z->a runs reachability\n    // from `a`, whose DFS pushes `c` twice before it is visited — exercising the\n    // visited-node skip in the traversal.\n    expect(assertNoCycles([edge('a', 'c'), edge('a', 'b'), edge('b', 'c')], [edge('z', 'a')])).toSucceed();\n  });\n\n  describe('scope-qualified nodes', () => {\n    test('does NOT conflate a stem shared across scopes into one node', () => {\n      // ca#x -> cb#y and cb#x -> ca#z reuse the stem `x` across scopes ca/cb.\n      // If the guard keyed on bare id, the two `x` nodes would merge and a false\n      // cycle could appear; with scoped keys they are distinct and the graph is acyclic.\n      expect(assertNoCycles([], [edge('ca#x', 'cb#y'), edge('cb#x', 'ca#z')])).toSucceed();\n    });\n\n    test('still rejects a genuine within-scope cycle across the same stems', () => {\n      expect(assertNoCycles([], [edge('ca#x', 'ca#y'), edge('ca#y', 'ca#x')])).toFailWith(\n        /would create a cycle/\n      );\n    });\n\n    test('a self-loop is detected on the full scoped identity', () => {\n      expect(assertNoCycles([], [edge('ca#x', 'ca#x')])).toFailWith(/self-loop/);\n      // Same stem, different scope is NOT a self-loop.\n      expect(assertNoCycles([], [edge('ca#x', 'cb#x')])).toSucceed();\n    });\n\n    test('names the scope in the diagnostic', () => {\n      expect(assertNoCycles([], [edge('ca#x', 'ca#x')])).toFailWith(/ca\\/x/);\n    });\n  });\n});\n"]}

package/lib/test/unit/ingest/dedupScope.test.d.ts

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

package/lib/test/unit/ingest/dedupScope.test.d.ts.map

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

package/lib/test/unit/ingest/dedupScope.test.js

@@ -1,436 +0,0 @@
-"use strict";
-/*
- * Copyright (c) 2026 Erik Fortune
- * SPDX-License-Identifier: MIT
- */
-Object.defineProperty(exports, "__esModule", { value: true });
-require("@fgv/ts-utils-jest");
-const ts_utils_1 = require("@fgv/ts-utils");
-const ts_json_base_1 = require("@fgv/ts-json-base");
-const index_1 = require("../../../index");
-// --- kinds --------------------------------------------------------------------
-// `mem` is the entity-scoped kind under test: a FLAT (non-versioned) kind whose
-// policy declares `dedupScope: 'entity'`. This is the shape the reporter runs —
-// an experience family — and the one whose ingest-path behavior this stream fixes.
-const memKind = 'mem';
-// `doc` is the content-scoped control: cross-id collapse is CORRECT for it and
-// must keep working exactly as before.
-const docKind = 'doc';
-// `claim` is the sibling candidate whose edge points at a collapsed candidate.
-// It has no registered policy, so it resolves through the store's DEFAULT policy.
-const claimKind = 'claim';
-// `turn` is the reporter's LITERAL shape: an MTM kind whose turns share one
-// conversation scope and differ only by idStem. This is where the bug bit.
-const turnKind = 'turn';
-// `evt` is a TEMPORAL entity-scoped kind. TemporalIdentityCodec gives each entity
-// its own scope (`<base>/entities/<id>`), so distinct temporal entities were
-// already isolated by the scope filter alone — see the test below.
-const evtKind = 'evt';
-const memScope = index_1.LtmIdentityCodec.scope;
-const docScope = index_1.KnowledgeIdentityCodec.scope;
-// --- fixtures -----------------------------------------------------------------
-const clock = () => 1000;
-function mutableRoot() {
-    const tree = ts_json_base_1.FileTree.inMemory([], { mutable: true }).orThrow();
-    const root = tree.getDirectory('/').orThrow();
-    if (!ts_json_base_1.FileTree.isMutableDirectoryItem(root)) {
-        throw new Error('expected a mutable root directory');
-    }
-    return root;
-}
-function registry() {
-    const reg = index_1.BodyConverterRegistry.create().orThrow();
-    reg.register(memKind, ts_utils_1.Converters.string);
-    reg.register(docKind, ts_utils_1.Converters.string);
-    reg.register(claimKind, ts_utils_1.Converters.string);
-    reg.register(turnKind, ts_utils_1.Converters.string);
-    reg.register(evtKind, ts_utils_1.Converters.string);
-    return reg;
-}
-const codecs = new Map([
-    [memKind, new index_1.LtmIdentityCodec()],
-    [docKind, new index_1.KnowledgeIdentityCodec()],
-    [claimKind, new index_1.KnowledgeIdentityCodec()],
-    [turnKind, new index_1.MtmIdentityCodec()],
-    [evtKind, index_1.TemporalIdentityCodec.create('events').orThrow()]
-]);
-/**
- * `mem` declares `'entity'` (the experience family), `doc` declares `'content'`
- * (the knowledge family). `claim` is deliberately absent so it exercises the
- * store's default-policy fallback.
- */
-function policies() {
-    return new Map([
-        [
-            memKind,
-            index_1.MemoryCapCullPolicy.create({
-                mutableFields: ['body', 'tags', 'links', 'provenance']
-            }).orThrow()
-        ],
-        [docKind, index_1.KnowledgeLwwPolicy.create().orThrow()],
-        [
-            turnKind,
-            index_1.MemoryCapCullPolicy.create({
-                mutableFields: ['body', 'tags', 'links', 'provenance']
-            }).orThrow()
-        ],
-        [evtKind, index_1.TemporalVersionedPolicy.create().orThrow()]
-    ]);
-}
-/** A deterministic embedder: identical bodies embed identically (cosine 1.0). */
-const embed = (record) => {
-    const vec = record.body === 'shared body' ? [1, 0, 0] : [0, 1, 0];
-    return Promise.resolve((0, ts_utils_1.succeed)(Float32Array.from(vec)));
-};
-function buildStore(vectorIndex) {
-    return index_1.FileTreeMemoryStore.create({
-        root: mutableRoot(),
-        registry: registry(),
-        codecs,
-        writePolicies: policies(),
-        clock,
-        vectorIndex,
-        embed: vectorIndex !== undefined ? embed : undefined
-    }).orThrow();
-}
-/**
- * Write a record straight through the store (the direct-put path). The envelope
- * `id` is the CODEC-DERIVED stem, which is not always the `entityId` — an MTM
- * entity `conv-1:2` addresses to `conversations/conv-1` + stem `turn-2`.
- */
-async function put(store, kind, entityId, body) {
-    const idStem = codecs
-        .get(kind)
-        .encode(entityId)
-        .orThrow().idStem;
-    return store.put({
-        envelope: {
-            id: idStem,
-            entityId: entityId,
-            kind,
-            tags: [],
-            links: [],
-            created: 0,
-            updated: 0,
-            seq: 0,
-            contentHash: '',
-            provenance: { source: 'agent' }
-        },
-        body
-    });
-}
-function candidate(kind, entityId, body) {
-    return {
-        envelope: {
-            entityId: entityId,
-            kind,
-            tags: [],
-            links: [],
-            provenance: { source: 'agent' }
-        },
-        body
-    };
-}
-function target(scope, id) {
-    return { scope, id: id };
-}
-const classifyMem = {
-    classify: () => Promise.resolve((0, ts_utils_1.succeed)({ kind: memKind }))
-};
-function extractorFor(candidates) {
-    return { extract: () => Promise.resolve((0, ts_utils_1.succeed)(candidates)) };
-}
-function relaterFor(edges) {
-    return { relate: (__ctx) => Promise.resolve((0, ts_utils_1.succeed)(edges)) };
-}
-const noEdges = relaterFor([]);
-function buildOrchestrator(params) {
-    return index_1.MemoryIngestOrchestrator.create({
-        store: params.store,
-        registry: registry(),
-        codecs,
-        classifier: classifyMem,
-        extractor: extractorFor(params.candidates),
-        relationExtractor: params.edges !== undefined ? relaterFor(params.edges) : noEdges,
-        entityResolver: params.entityResolver,
-        vectorIndex: params.vectorIndex,
-        embed: params.vectorIndex !== undefined ? embed : undefined
-    }).orThrow();
-}
-const item = { id: 'item-1', content: 'irrelevant' };
-/** The per-candidate outcome for `entityId`, or `undefined` when absent. */
-function outcomeFor(result, entityId) {
-    return result.records.find((r) => r.candidate.envelope.entityId === entityId);
-}
-describe('dedupScope on the ingest path', () => {
-    describe('IMemoryStore.dedupScopeFor (deliverable 1)', () => {
-        test("reports 'entity' for a kind whose policy declares it", () => {
-            expect(buildStore().dedupScopeFor(memKind)).toBe('entity');
-        });
-        test("reports 'content' for a kind whose policy declares it", () => {
-            expect(buildStore().dedupScopeFor(docKind)).toBe('content');
-        });
-        test("reports 'content' for a kind with NO registered policy (the store's default policy is KnowledgeLwwPolicy)", () => {
-            // Documents the real fallback: the store's default policy is a
-            // KnowledgeLwwPolicy, which DECLARES 'content'. An unpoliced kind therefore
-            // resolves to 'content' and never reaches DEFAULT_DEDUP_SCOPE ('entity').
-            expect(buildStore().dedupScopeFor(claimKind)).toBe('content');
-            expect(buildStore().dedupScopeFor('never-registered')).toBe('content');
-        });
-        test('agrees with what the write path actually does', async () => {
-            // The accessor is not a parallel declaration — it is the same read the
-            // store's own dedup branch performs. An 'entity' kind keeps two identical
-            // bodies; a 'content' kind collapses them.
-            const store = buildStore();
-            const scopes = [store.dedupScopeFor(memKind), store.dedupScopeFor(docKind)];
-            expect(scopes).toEqual(['entity', 'content']);
-        });
-    });
-    describe('direct-put path (unchanged, the parity baseline)', () => {
-        test("an 'entity' kind keeps two distinct entities with byte-identical bodies", async () => {
-            const store = buildStore();
-            expect(await put(store, memKind, 'turn-1', 'shared body')).toSucceed();
-            expect(await put(store, memKind, 'turn-2', 'shared body')).toSucceedAndSatisfy((rec) => {
-                expect(rec.envelope.id).toBe('turn-2');
-            });
-            expect(await store.list({ kind: memKind })).toSucceedAndSatisfy((records) => {
-                expect(records).toHaveLength(2);
-            });
-        });
-        test("a 'content' kind collapses two distinct entities with byte-identical bodies", async () => {
-            const store = buildStore();
-            expect(await put(store, docKind, 'doc-a', 'shared body')).toSucceed();
-            expect(await put(store, docKind, 'doc-b', 'shared body')).toSucceedAndSatisfy((rec) => {
-                // The existing record is returned unchanged — the cross-id collapse.
-                expect(rec.envelope.id).toBe('doc-a');
-            });
-            expect(await store.list({ kind: docKind })).toSucceedAndSatisfy((records) => {
-                expect(records).toHaveLength(1);
-            });
-        });
-    });
-    describe('layer-1 exact match honors dedupScope (deliverable 2)', () => {
-        test("an 'entity' kind does NOT collapse a cross-id body collision (fails against pre-fix code)", async () => {
-            const store = buildStore();
-            expect(await put(store, memKind, 'turn-1', 'shared body')).toSucceed();
-            const orchestrator = buildOrchestrator({
-                store,
-                candidates: [candidate(memKind, 'turn-2', 'shared body')]
-            });
-            expect(await orchestrator.ingestItem(item)).toSucceedAndSatisfy((result) => {
-                const turn2 = outcomeFor(result, 'turn-2');
-                // Pre-fix this was `deduped` against turn-1 — layer-1 ignored the
-                // declaration and always behaved as 'content'.
-                expect(turn2 === null || turn2 === void 0 ? void 0 : turn2.disposition).toBe('written');
-                expect(turn2 === null || turn2 === void 0 ? void 0 : turn2.resolution.verdict).toBe('new');
-                expect(turn2 === null || turn2 === void 0 ? void 0 : turn2.id).toBe('turn-2');
-            });
-            expect(await store.list({ kind: memKind })).toSucceedAndSatisfy((records) => {
-                expect(records).toHaveLength(2);
-            });
-        });
-        test("a 'content' kind still collapses a cross-id body collision", async () => {
-            const store = buildStore();
-            expect(await put(store, docKind, 'doc-a', 'shared body')).toSucceed();
-            const orchestrator = buildOrchestrator({
-                store,
-                candidates: [candidate(docKind, 'doc-b', 'shared body')]
-            });
-            expect(await orchestrator.ingestItem(item)).toSucceedAndSatisfy((result) => {
-                const docB = outcomeFor(result, 'doc-b');
-                expect(docB === null || docB === void 0 ? void 0 : docB.disposition).toBe('deduped');
-                expect(docB === null || docB === void 0 ? void 0 : docB.resolution).toEqual({
-                    verdict: 'duplicate-of',
-                    target: target(docScope, 'doc-a')
-                });
-                expect(docB === null || docB === void 0 ? void 0 : docB.id).toBe('doc-a');
-            });
-            expect(await store.list({ kind: docKind })).toSucceedAndSatisfy((records) => {
-                expect(records).toHaveLength(1);
-            });
-        });
-        test("an 'entity' kind still reports duplicate-of for a SAME-entity identical body (OQ-2)", async () => {
-            const store = buildStore();
-            expect(await put(store, memKind, 'turn-1', 'shared body')).toSucceed();
-            const orchestrator = buildOrchestrator({
-                store,
-                candidates: [candidate(memKind, 'turn-1', 'shared body')]
-            });
-            expect(await orchestrator.ingestItem(item)).toSucceedAndSatisfy((result) => {
-                const turn1 = outcomeFor(result, 'turn-1');
-                // A genuine no-op the store would also collapse. Emitting the verdict
-                // keeps it honest, and it is safe because the redirect (deliverable 3)
-                // keeps the address resolvable for sibling edges.
-                expect(turn1 === null || turn1 === void 0 ? void 0 : turn1.disposition).toBe('deduped');
-                expect(turn1 === null || turn1 === void 0 ? void 0 : turn1.resolution).toEqual({
-                    verdict: 'duplicate-of',
-                    target: target(memScope, 'turn-1')
-                });
-            });
-        });
-        test("the reporter's literal shape: two MTM turns in ONE conversation scope with identical bodies", async () => {
-            // MtmIdentityCodec puts every turn of a conversation in the SAME scope
-            // (`conversations/<id>`), differing only by idStem (`turn-<n>`). That is
-            // exactly where the bug bit: same kind, same scope, different entity, and
-            // a body collision was enough to collapse one turn into the other.
-            const store = buildStore();
-            expect(await put(store, turnKind, 'conv-1:1', 'ok, thanks')).toSucceed();
-            const orchestrator = buildOrchestrator({
-                store,
-                candidates: [candidate(turnKind, 'conv-1:2', 'ok, thanks')]
-            });
-            expect(await orchestrator.ingestItem(item)).toSucceedAndSatisfy((result) => {
-                var _a;
-                expect((_a = outcomeFor(result, 'conv-1:2')) === null || _a === void 0 ? void 0 : _a.disposition).toBe('written');
-            });
-            expect(await store.list({ kind: turnKind })).toSucceedAndSatisfy((records) => {
-                // Both turns persist. Pre-fix, turn 2 was silently swallowed.
-                expect(records).toHaveLength(2);
-            });
-        });
-        test('a TEMPORAL entity kind keeps distinct entities apart (scope isolation, unchanged)', async () => {
-            // TemporalIdentityCodec addresses each entity to its OWN scope
-            // (`events/entities/<id>`), so two distinct temporal entities were never
-            // in one exact-match cohort even before this change — the scope filter
-            // alone separated them. Guarding it so the entity narrowing (which is a
-            // no-op within a single entity's scope, where every version shares the
-            // idStem) is never mistaken for what protects temporal kinds.
-            const store = buildStore();
-            expect(await put(store, evtKind, 'evt-1', 'shared body')).toSucceed();
-            const orchestrator = buildOrchestrator({
-                store,
-                candidates: [candidate(evtKind, 'evt-2', 'shared body')]
-            });
-            expect(await orchestrator.ingestItem(item)).toSucceedAndSatisfy((result) => {
-                var _a;
-                expect((_a = outcomeFor(result, 'evt-2')) === null || _a === void 0 ? void 0 : _a.disposition).toBe('written');
-            });
-        });
-        test("an 'entity' kind does not match across scopes", async () => {
-            // A doc and a mem record can share a body without either seeing the other:
-            // the cohort is scope-filtered before the entity narrowing applies.
-            const store = buildStore();
-            expect(await put(store, docKind, 'doc-a', 'shared body')).toSucceed();
-            const orchestrator = buildOrchestrator({
-                store,
-                candidates: [candidate(memKind, 'turn-1', 'shared body')]
-            });
-            expect(await orchestrator.ingestItem(item)).toSucceedAndSatisfy((result) => {
-                var _a;
-                expect((_a = outcomeFor(result, 'turn-1')) === null || _a === void 0 ? void 0 : _a.disposition).toBe('written');
-            });
-        });
-    });
-    describe("the reporter's scenario end to end", () => {
-        test('a cross-id body collision on an entity kind no longer fails the whole item, and the claim is written', async () => {
-            // Two live records, same kind, same scope, byte-identical bodies, different
-            // entity ids — plus a sibling edge to the second. Pre-fix: turn-2 collapsed
-            // to turn-1, its address vanished from `refIds`, and the edge failed
-            // validation, taking the WHOLE ingest item (claim included) down with it.
-            const store = buildStore();
-            expect(await put(store, memKind, 'turn-1', 'shared body')).toSucceed();
-            const orchestrator = buildOrchestrator({
-                store,
-                candidates: [candidate(memKind, 'turn-2', 'shared body'), candidate(claimKind, 'c-1', 'a claim')],
-                edges: [
-                    {
-                        source: target(docScope, 'c-1'),
-                        edge: { type: 'supports', target: target(memScope, 'turn-2') }
-                    }
-                ]
-            });
-            expect(await orchestrator.ingestItem(item)).toSucceedAndSatisfy((result) => {
-                var _a, _b;
-                expect((_a = outcomeFor(result, 'turn-2')) === null || _a === void 0 ? void 0 : _a.disposition).toBe('written');
-                const claim = outcomeFor(result, 'c-1');
-                expect(claim === null || claim === void 0 ? void 0 : claim.disposition).toBe('written');
-                // The claim's edge survived and still points at turn-2, which was written.
-                expect((_b = claim === null || claim === void 0 ? void 0 : claim.record) === null || _b === void 0 ? void 0 : _b.envelope.links).toEqual([
-                    { type: 'supports', target: target(memScope, 'turn-2') }
-                ]);
-            });
-            expect(await store.list({ kind: memKind })).toSucceedAndSatisfy((records) => {
-                expect(records).toHaveLength(2);
-            });
-        });
-    });
-    describe('duplicate-of edge redirect (deliverable 3)', () => {
-        test("a 'content' kind's collapse redirects a sibling edge to the collapse target", async () => {
-            // The collapse is CORRECT here — doc-b really is doc-a. The ingest must
-            // still not fail: the claim's edge is redirected onto doc-a.
-            const store = buildStore();
-            expect(await put(store, docKind, 'doc-a', 'shared body')).toSucceed();
-            const orchestrator = buildOrchestrator({
-                store,
-                candidates: [candidate(docKind, 'doc-b', 'shared body'), candidate(claimKind, 'c-1', 'a claim')],
-                edges: [
-                    {
-                        source: target(docScope, 'c-1'),
-                        edge: { type: 'supports', target: target(docScope, 'doc-b') }
-                    }
-                ]
-            });
-            expect(await orchestrator.ingestItem(item)).toSucceedAndSatisfy((result) => {
-                var _a, _b;
-                expect((_a = outcomeFor(result, 'doc-b')) === null || _a === void 0 ? void 0 : _a.disposition).toBe('deduped');
-                const claim = outcomeFor(result, 'c-1');
-                expect(claim === null || claim === void 0 ? void 0 : claim.disposition).toBe('written');
-                // Redirected from the collapsed doc-b to the record it collapsed into.
-                expect((_b = claim === null || claim === void 0 ? void 0 : claim.record) === null || _b === void 0 ? void 0 : _b.envelope.links).toEqual([
-                    { type: 'supports', target: target(docScope, 'doc-a') }
-                ]);
-            });
-        });
-        test("an 'entity' kind's resolver-driven duplicate-of redirects a sibling edge", async () => {
-            // Layer-1 no longer collapses cross-id on an entity kind, so the
-            // duplicate-of here comes from the host resolver (layer 2) — the remaining
-            // way an entity-scoped candidate legitimately collapses onto another entity.
-            const vectorIndex = index_1.InMemoryCosineIndex.create().orThrow();
-            const store = buildStore(vectorIndex);
-            expect(await put(store, memKind, 'turn-1', 'shared body')).toSucceed();
-            const entityResolver = {
-                resolve: (__candidate, similar) => Promise.resolve((0, ts_utils_1.succeed)({ verdict: 'duplicate-of', target: similar[0].target }))
-            };
-            const orchestrator = buildOrchestrator({
-                store,
-                candidates: [candidate(memKind, 'turn-2', 'shared body'), candidate(claimKind, 'c-1', 'a claim')],
-                edges: [
-                    {
-                        source: target(docScope, 'c-1'),
-                        edge: { type: 'supports', target: target(memScope, 'turn-2') }
-                    }
-                ],
-                entityResolver,
-                vectorIndex
-            });
-            expect(await orchestrator.ingestItem(item)).toSucceedAndSatisfy((result) => {
-                var _a, _b;
-                expect((_a = outcomeFor(result, 'turn-2')) === null || _a === void 0 ? void 0 : _a.disposition).toBe('deduped');
-                const claim = outcomeFor(result, 'c-1');
-                expect(claim === null || claim === void 0 ? void 0 : claim.disposition).toBe('written');
-                expect((_b = claim === null || claim === void 0 ? void 0 : claim.record) === null || _b === void 0 ? void 0 : _b.envelope.links).toEqual([
-                    { type: 'supports', target: target(memScope, 'turn-1') }
-                ]);
-            });
-        });
-        test('an edge SOURCED at a collapsed candidate is still rejected loudly', async () => {
-            // Sources are the records an edge is written ONTO. A collapsed candidate is
-            // never written, so silently relocating the edge would attribute a link the
-            // host never asked for. The loud failure is the correct outcome here.
-            const store = buildStore();
-            expect(await put(store, docKind, 'doc-a', 'shared body')).toSucceed();
-            const orchestrator = buildOrchestrator({
-                store,
-                candidates: [candidate(docKind, 'doc-b', 'shared body'), candidate(claimKind, 'c-1', 'a claim')],
-                edges: [
-                    {
-                        source: target(docScope, 'doc-b'),
-                        edge: { type: 'supports', target: target(docScope, 'c-1') }
-                    }
-                ]
-            });
-            expect(await orchestrator.ingestItem(item)).toFailWith(/is not a candidate being written/i);
-        });
-    });
-});
-//# sourceMappingURL=dedupScope.test.js.map