@fgv/ts-agent-memory 5.1.0-46 → 5.1.0-48

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/orchestrator.test.d.ts

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

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

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