@fgv/ts-agent-memory 5.1.0-36

package/lib/test/unit/converters/envelopeConverter.test.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"envelopeConverter.test.js","sourceRoot":"","sources":["../../../../src/test/unit/converters/envelopeConverter.test.ts"],"names":[],"mappings":";AAAA;;;GAGG;;AAEH,8BAA4B;AAC5B,4CAA2C;AAC3C,6DAWsC;AAGtC,MAAM,mBAAmB,GAA4B;IACnD,EAAE,EAAE,eAAe;IACnB,QAAQ,EAAE,eAAe;IACzB,IAAI,EAAE,WAAW;IACjB,IAAI,EAAE,CAAC,MAAM,EAAE,SAAS,CAAC;IACzB,KAAK,EAAE,CAAC,EAAE,IAAI,EAAE,SAAS,EAAE,MAAM,EAAE,WAAW,EAAE,CAAC;IACjD,OAAO,EAAE,IAAI;IACb,OAAO,EAAE,IAAI;IACb,GAAG,EAAE,CAAC;IACN,WAAW,EAAE,SAAS;IACtB,UAAU,EAAE,EAAE,MAAM,EAAE,OAAO,EAAE,EAAE,EAAE,SAAS,EAAE;CAC/C,CAAC;AAEF,QAAQ,CAAC,qBAAqB,EAAE,GAAG,EAAE;IACnC,IAAI,CAAC,4BAA4B,EAAE,GAAG,EAAE;QACtC,MAAM,CACJ,gCAAmB,CAAC,OAAO,CAAC,EAAE,MAAM,EAAE,OAAO,EAAE,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,UAAU,EAAE,GAAG,EAAE,CAAC,CAC5F,CAAC,aAAa,CAAC,EAAE,MAAM,EAAE,OAAO,EAAE,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,UAAU,EAAE,GAAG,EAAE,CAAC,CAAC;IAClF,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,0CAA0C,EAAE,GAAG,EAAE;QACpD,MAAM,CACJ,gCAAmB,CAAC,OAAO,CAAC,EAAE,MAAM,EAAE,OAAO,EAAE,SAAS,EAAE,EAAE,KAAK,EAAE,GAAG,EAAE,EAAE,SAAS,EAAE,QAAQ,EAAE,CAAC,CACjG,CAAC,mBAAmB,CAAC,CAAC,CAAC,EAAE,EAAE;YAC1B,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YAC/B,MAAM,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,OAAO,CAAC,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC,CAAC;YAC5C,MAAM,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QACrC,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,sDAAsD,EAAE,GAAG,EAAE;QAChE,MAAM,CAAC,gCAAmB,CAAC,OAAO,CAAC,EAAE,MAAM,EAAE,aAAa,EAAE,CAAC,CAAC,CAAC,aAAa,CAAC,EAAE,MAAM,EAAE,aAAa,EAAE,CAAC,CAAC;IAC1G,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,8BAA8B,EAAE,GAAG,EAAE;QACxC,MAAM,CAAC,gCAAmB,CAAC,OAAO,CAAC,EAAE,EAAE,EAAE,MAAM,EAAE,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC;IAC/D,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,uBAAuB,EAAE,GAAG,EAAE;QACjC,MAAM,CAAC,gCAAmB,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC;IACvD,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,QAAQ,CAAC,eAAe,EAAE,GAAG,EAAE;IAC7B,IAAI,CAAC,kCAAkC,EAAE,GAAG,EAAE;QAC5C,MAAM,CACJ,0BAAa,CAAC,OAAO,CAAC;YACpB,IAAI,EAAE,SAAS;YACf,MAAM,EAAE,QAAQ;YAChB,UAAU,EAAE,GAAG;YACf,UAAU,EAAE,EAAE,MAAM,EAAE,OAAO,EAAE;YAC/B,QAAQ,EAAE,GAAG;YACb,UAAU,EAAE,GAAG;SAChB,CAAC,CACH,CAAC,mBAAmB,CAAC,CAAC,IAAI,EAAE,EAAE;YAC7B,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;YAClC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YACnC,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YAClC,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,OAAO,CAAC,EAAE,MAAM,EAAE,OAAO,EAAE,CAAC,CAAC;YACrD,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YAChC,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACpC,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,0BAA0B,EAAE,GAAG,EAAE;QACpC,MAAM,CAAC,0BAAa,CAAC,OAAO,CAAC,EAAE,IAAI,EAAE,SAAS,EAAE,MAAM,EAAE,WAAW,EAAE,CAAC,CAAC,CAAC,mBAAmB,CAAC,CAAC,IAAI,EAAE,EAAE;YACnG,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;YAClC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;YACtC,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,aAAa,EAAE,CAAC;QAC1C,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,yCAAyC,EAAE,GAAG,EAAE;QACnD,MAAM,CAAC,0BAAa,CAAC,OAAO,CAAC,EAAE,IAAI,EAAE,SAAS,EAAE,MAAM,EAAE,GAAG,EAAE,UAAU,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,mBAAmB,CACnG,CAAC,IAAI,EAAE,EAAE;YACP,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,QAAQ,EAAE,CAAC;QACrC,CAAC,CACF,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,oDAAoD,EAAE,GAAG,EAAE;QAC9D,MAAM,CAAC,0BAAa,CAAC,OAAO,CAAC,EAAE,IAAI,EAAE,SAAS,EAAE,MAAM,EAAE,GAAG,EAAE,UAAU,EAAE,MAAM,EAAE,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC;IAC/F,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,8BAA8B,EAAE,GAAG,EAAE;QACxC,MAAM,CAAC,0BAAa,CAAC,OAAO,CAAC,EAAE,IAAI,EAAE,SAAS,EAAE,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC;IAC9D,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,QAAQ,CAAC,mBAAmB,EAAE,GAAG,EAAE;IACjC,IAAI,CAAC,4BAA4B,EAAE,GAAG,EAAE;QACtC,MAAM,CAAC,8BAAiB,CAAC,OAAO,CAAC,EAAE,QAAQ,EAAE,CAAC,EAAE,UAAU,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,aAAa,CAAC;YACjF,QAAQ,EAAE,CAAC;YACX,UAAU,EAAE,IAAI;SACjB,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,mCAAmC,EAAE,GAAG,EAAE;QAC7C,MAAM,CAAC,8BAAiB,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC,CAAC,aAAa,CAAC,EAAE,CAAC,CAAC;IAC1D,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,QAAQ,CAAC,mBAAmB,EAAE,GAAG,EAAE;IACjC,IAAI,CAAC,mDAAmD,EAAE,GAAG,EAAE;QAC7D,MAAM,CAAC,8BAAiB,CAAC,OAAO,CAAC,mBAAmB,CAAC,CAAC,CAAC,mBAAmB,CAAC,CAAC,QAAQ,EAAE,EAAE;YACtF,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC;YAC1C,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC,CAAC;YACnD,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;YACvC,MAAM,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC,aAAa,EAAE,CAAC;YAC1C,MAAM,CAAC,QAAQ,CAAC,YAAY,CAAC,CAAC,aAAa,EAAE,CAAC;QAChD,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,0DAA0D,EAAE,GAAG,EAAE;QACpE,MAAM,CACJ,8BAAiB,CAAC,OAAO,iCACpB,mBAAmB,KACtB,QAAQ,EAAE,EAAE,QAAQ,EAAE,EAAE,EAAE,EAC1B,YAAY,EAAE,OAAO,IACrB,CACH,CAAC,mBAAmB,CAAC,CAAC,QAAQ,EAAE,EAAE;YACjC,MAAM,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC,OAAO,CAAC,EAAE,QAAQ,EAAE,EAAE,EAAE,CAAC,CAAC;YACpD,MAAM,CAAC,QAAQ,CAAC,YAAY,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QAC9C,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,4CAA4C,EAAE,GAAG,EAAE;QACtD,MAAM,CAAC,8BAAiB,CAAC,OAAO,iCAAM,mBAAmB,KAAE,YAAY,EAAE,IAAI,IAAG,CAAC,CAAC,mBAAmB,CACnG,CAAC,QAAQ,EAAE,EAAE;YACX,MAAM,CAAC,QAAQ,CAAC,YAAY,CAAC,CAAC,QAAQ,EAAE,CAAC;QAC3C,CAAC,CACF,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,sDAAsD,EAAE,GAAG,EAAE;QAChE,MAAM,CAAC,8BAAiB,CAAC,OAAO,iCAAM,mBAAmB,KAAE,YAAY,EAAE,EAAE,IAAG,CAAC,CAAC,MAAM,EAAE,CAAC;IAC3F,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,wCAAwC,EAAE,GAAG,EAAE;QAClD,MAAM,OAAO,qBAAiC,mBAAmB,CAAE,CAAC;QACpE,OAAO,OAAO,CAAC,WAAW,CAAC;QAC3B,MAAM,CAAC,8BAAiB,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC;IACtD,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,QAAQ,CAAC,uBAAuB,EAAE,GAAG,EAAE;IACrC,IAAI,CAAC,uCAAuC,EAAE,GAAG,EAAE;QACjD,MAAM,IAAI,GAAG,IAAA,gCAAmB,EAC9B,8BAAiB,CAAC,OAAO,CAAC,mBAAmB,CAAC,CAAC,OAAO,EAAE,EACxD,WAAW,CACZ,CAAC,OAAO,EAAE,CAAC;QACZ,MAAM,WAAW,GAAG,IAAA,6BAAgB,EAAC,IAAI,CAAC,CAAC,OAAO,EAAE,CAAC,WAAW,CAAC;QACjE,MAAM,CAAC,kCAAqB,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC,CAAC,mBAAmB,CAAC,CAAC,QAAQ,EAAE,EAAE;YAClF,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC;QAC5C,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,8CAA8C,EAAE,GAAG,EAAE;QACxD,MAAM,CAAC,kCAAqB,CAAC,OAAO,CAAC,eAAe,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC;IAClE,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,QAAQ,CAAC,oCAAoC,EAAE,GAAG,EAAE;IAClD,IAAI,CAAC,kCAAkC,EAAE,GAAG,EAAE;QAC5C,MAAM,GAAG,GAAG,2DAA2D,CAAC;QACxE,MAAM,CAAC,IAAA,6BAAgB,EAAC,GAAG,CAAC,CAAC,CAAC,aAAa,CAAC;YAC1C,WAAW,EAAE,wBAAwB;YACrC,IAAI,EAAE,yBAAyB;SAChC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,mEAAmE,EAAE,GAAG,EAAE;QAC7E,MAAM,GAAG,GAAG,qEAAqE,CAAC;QAClF,MAAM,CAAC,IAAA,6BAAgB,EAAC,GAAG,CAAC,CAAC,CAAC,aAAa,CAAC;YAC1C,WAAW,EAAE,wBAAwB;YACrC,IAAI,EAAE,yBAAyB;SAChC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,6CAA6C,EAAE,GAAG,EAAE;QACvD,MAAM,CAAC,IAAA,6BAAgB,EAAC,qBAAqB,CAAC,CAAC,CAAC,UAAU,CAAC,wCAAwC,CAAC,CAAC;IACvG,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,6CAA6C,EAAE,GAAG,EAAE;QACvD,MAAM,CAAC,IAAA,6BAAgB,EAAC,yBAAyB,CAAC,CAAC,CAAC,UAAU,CAAC,wCAAwC,CAAC,CAAC;IAC3G,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,6DAA6D,EAAE,GAAG,EAAE;QACvE,MAAM,CAAC,IAAA,4BAAe,EAAC,OAAO,EAAE,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,uBAAuB,CAAC,CAAC;IACzE,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,wDAAwD,EAAE,GAAG,EAAE;QAClE,MAAM,CAAC,IAAA,4BAAe,EAAC,SAAS,EAAE,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,uBAAuB,CAAC,CAAC;IAC3E,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,2BAA2B,EAAE,GAAG,EAAE;QACrC,MAAM,GAAG,GAAG,+BAA+B,CAAC;QAC5C,MAAM,KAAK,GAAG,IAAA,6BAAgB,EAAC,GAAG,CAAC,CAAC,OAAO,EAAE,CAAC;QAC9C,MAAM,CAAC,IAAA,4BAAe,EAAC,KAAK,CAAC,WAAW,EAAE,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IACnE,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,QAAQ,CAAC,uCAAuC,EAAE,GAAG,EAAE;IACrD,IAAI,QAA+B,CAAC;IACpC,MAAM,aAAa,GAAS,WAAmB,CAAC;IAEhD,UAAU,CAAC,GAAG,EAAE;QACd,QAAQ,GAAG,kCAAqB,CAAC,MAAM,EAAE,CAAC,OAAO,EAAE,CAAC;QACpD,QAAQ,CAAC,QAAQ,CAAC,aAAa,EAAE,qBAAU,CAAC,MAAM,CAAC,CAAC;IACtD,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,4CAA4C,EAAE,GAAG,EAAE;QACtD,MAAM,QAAQ,GAAG,8BAAiB,CAAC,OAAO,CAAC,mBAAmB,CAAC,CAAC,OAAO,EAAE,CAAC;QAC1E,MAAM,IAAI,GAAG,IAAA,gCAAmB,EAAC,QAAQ,EAAE,qBAAqB,CAAC,CAAC,OAAO,EAAE,CAAC;QAC5E,MAAM,CAAC,IAAA,4BAAe,EAAC,IAAI,EAAE,QAAQ,CAAC,CAAC,CAAC,mBAAmB,CAAC,CAAC,MAAM,EAAE,EAAE;YACrE,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC;YACjD,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,qBAAqB,CAAC,CAAC;QAClD,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,4CAA4C,EAAE,GAAG,EAAE;QACtD,MAAM,CAAC,IAAA,4BAAe,EAAC,eAAe,EAAE,QAAQ,CAAC,CAAC,CAAC,UAAU,CAAC,wCAAwC,CAAC,CAAC;IAC1G,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,0DAA0D,EAAE,GAAG,EAAE;QACpE,MAAM,IAAI,GAAG,uBAAuB,CAAC;QACrC,MAAM,CAAC,IAAA,4BAAe,EAAC,IAAI,EAAE,QAAQ,CAAC,CAAC,CAAC,UAAU,CAAC,mBAAmB,CAAC,CAAC;IAC1E,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,sEAAsE,EAAE,GAAG,EAAE;QAChF,MAAM,QAAQ,GAAG,8BAAiB,CAAC,OAAO,iCAAM,mBAAmB,KAAE,IAAI,EAAE,cAAc,IAAG,CAAC,OAAO,EAAE,CAAC;QACvG,MAAM,IAAI,GAAG,IAAA,gCAAmB,EAAC,QAAQ,EAAE,MAAM,CAAC,CAAC,OAAO,EAAE,CAAC;QAC7D,MAAM,CAAC,IAAA,4BAAe,EAAC,IAAI,EAAE,QAAQ,CAAC,CAAC,CAAC,UAAU,CAAC,wCAAwC,CAAC,CAAC;IAC/F,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,8EAA8E,EAAE,GAAG,EAAE;QACxF,MAAM,cAAc,GAAG,gCAAK,mBAAmB,KAAE,KAAK,EAAE,MAAM,CAAC,EAAE,CAAC,GAAgC,CAAC;QACnG,MAAM,CAAC,IAAA,gCAAmB,EAAC,cAAc,EAAE,MAAM,CAAC,CAAC,CAAC,UAAU,CAAC,+BAA+B,CAAC,CAAC;IAClG,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 { Converters } from '@fgv/ts-utils';\nimport {\n  BodyConverterRegistry,\n  edgeConverter,\n  envelopeConverter,\n  envelopeYamlConverter,\n  joinFrontmatter,\n  parseMemoryFile,\n  provenanceConverter,\n  serializeMemoryFile,\n  splitFrontmatter,\n  temporalConverter\n} from '../../../packlets/converters';\nimport { IMemoryEnvelope, Kind } from '../../../packlets/types';\n\nconst validEnvelopeObject: Record<string, unknown> = {\n  id: 'intro-to-rust',\n  entityId: 'intro-to-rust',\n  kind: 'knowledge',\n  tags: ['rust', 'systems'],\n  links: [{ type: 'related', target: 'ownership' }],\n  created: 1000,\n  updated: 2000,\n  seq: 5,\n  contentHash: 'crc-abc',\n  provenance: { source: 'agent', by: 'curator' }\n};\n\ndescribe('provenanceConverter', () => {\n  test('validates the known fields', () => {\n    expect(\n      provenanceConverter.convert({ source: 'human', by: 'erik', model: 'gpt', confidence: 0.9 })\n    ).toSucceedWith({ source: 'human', by: 'erik', model: 'gpt', confidence: 0.9 });\n  });\n\n  test('preserves opaque extension keys verbatim', () => {\n    expect(\n      provenanceConverter.convert({ source: 'agent', sentiment: { score: 0.5 }, epistemic: 'belief' })\n    ).toSucceedAndSatisfy((p) => {\n      expect(p.source).toBe('agent');\n      expect(p.sentiment).toEqual({ score: 0.5 });\n      expect(p.epistemic).toBe('belief');\n    });\n  });\n\n  test('accepts an arbitrary source string (open vocabulary)', () => {\n    expect(provenanceConverter.convert({ source: 'host-ingest' })).toSucceedWith({ source: 'host-ingest' });\n  });\n\n  test('fails when source is missing', () => {\n    expect(provenanceConverter.convert({ by: 'erik' })).toFail();\n  });\n\n  test('fails on a non-object', () => {\n    expect(provenanceConverter.convert('nope')).toFail();\n  });\n});\n\ndescribe('edgeConverter', () => {\n  test('validates a full attributed edge', () => {\n    expect(\n      edgeConverter.convert({\n        type: 'mtm-ref',\n        target: 'turn-3',\n        confidence: 0.8,\n        provenance: { source: 'agent' },\n        valid_at: 100,\n        invalid_at: 200\n      })\n    ).toSucceedAndSatisfy((edge) => {\n      expect(edge.type).toBe('mtm-ref');\n      expect(edge.target).toBe('turn-3');\n      expect(edge.confidence).toBe(0.8);\n      expect(edge.provenance).toEqual({ source: 'agent' });\n      expect(edge.valid_at).toBe(100);\n      expect(edge.invalid_at).toBe(200);\n    });\n  });\n\n  test('validates a minimal edge', () => {\n    expect(edgeConverter.convert({ type: 'related', target: 'ownership' })).toSucceedAndSatisfy((edge) => {\n      expect(edge.type).toBe('related');\n      expect(edge.target).toBe('ownership');\n      expect(edge.confidence).toBeUndefined();\n    });\n  });\n\n  test('accepts a null invalid_at (still valid)', () => {\n    expect(edgeConverter.convert({ type: 'related', target: 'x', invalid_at: null })).toSucceedAndSatisfy(\n      (edge) => {\n        expect(edge.invalid_at).toBeNull();\n      }\n    );\n  });\n\n  test('fails when invalid_at is neither a number nor null', () => {\n    expect(edgeConverter.convert({ type: 'related', target: 'x', invalid_at: 'soon' })).toFail();\n  });\n\n  test('fails when target is missing', () => {\n    expect(edgeConverter.convert({ type: 'related' })).toFail();\n  });\n});\n\ndescribe('temporalConverter', () => {\n  test('validates a temporal block', () => {\n    expect(temporalConverter.convert({ valid_at: 1, invalid_at: null })).toSucceedWith({\n      valid_at: 1,\n      invalid_at: null\n    });\n  });\n\n  test('validates an empty temporal block', () => {\n    expect(temporalConverter.convert({})).toSucceedWith({});\n  });\n});\n\ndescribe('envelopeConverter', () => {\n  test('validates a full envelope without optional blocks', () => {\n    expect(envelopeConverter.convert(validEnvelopeObject)).toSucceedAndSatisfy((envelope) => {\n      expect(envelope.id).toBe('intro-to-rust');\n      expect(envelope.tags).toEqual(['rust', 'systems']);\n      expect(envelope.links).toHaveLength(1);\n      expect(envelope.temporal).toBeUndefined();\n      expect(envelope.embeddingRef).toBeUndefined();\n    });\n  });\n\n  test('validates a temporal envelope with a string embeddingRef', () => {\n    expect(\n      envelopeConverter.convert({\n        ...validEnvelopeObject,\n        temporal: { valid_at: 10 },\n        embeddingRef: 'vec-1'\n      })\n    ).toSucceedAndSatisfy((envelope) => {\n      expect(envelope.temporal).toEqual({ valid_at: 10 });\n      expect(envelope.embeddingRef).toBe('vec-1');\n    });\n  });\n\n  test('accepts a null embeddingRef (not embedded)', () => {\n    expect(envelopeConverter.convert({ ...validEnvelopeObject, embeddingRef: null })).toSucceedAndSatisfy(\n      (envelope) => {\n        expect(envelope.embeddingRef).toBeNull();\n      }\n    );\n  });\n\n  test('fails when embeddingRef is neither a string nor null', () => {\n    expect(envelopeConverter.convert({ ...validEnvelopeObject, embeddingRef: 42 })).toFail();\n  });\n\n  test('fails when a required field is missing', () => {\n    const missing: Record<string, unknown> = { ...validEnvelopeObject };\n    delete missing.contentHash;\n    expect(envelopeConverter.convert(missing)).toFail();\n  });\n});\n\ndescribe('envelopeYamlConverter', () => {\n  test('parses an envelope from a YAML string', () => {\n    const yaml = serializeMemoryFile(\n      envelopeConverter.convert(validEnvelopeObject).orThrow(),\n      'body text'\n    ).orThrow();\n    const frontmatter = splitFrontmatter(yaml).orThrow().frontmatter;\n    expect(envelopeYamlConverter.convert(frontmatter)).toSucceedAndSatisfy((envelope) => {\n      expect(envelope.id).toBe('intro-to-rust');\n    });\n  });\n\n  test('fails on a YAML string that is not an object', () => {\n    expect(envelopeYamlConverter.convert('just a scalar')).toFail();\n  });\n});\n\ndescribe('splitFrontmatter / joinFrontmatter', () => {\n  test('splits a well-formed memory file', () => {\n    const raw = '---\\nid: x\\nkind: knowledge\\n---\\nThe body.\\nSecond line.';\n    expect(splitFrontmatter(raw)).toSucceedWith({\n      frontmatter: 'id: x\\nkind: knowledge',\n      body: 'The body.\\nSecond line.'\n    });\n  });\n\n  test('strips trailing CR so CRLF-authored files parse identically to LF', () => {\n    const raw = '---\\r\\nid: x\\r\\nkind: knowledge\\r\\n---\\r\\nThe body.\\r\\nSecond line.';\n    expect(splitFrontmatter(raw)).toSucceedWith({\n      frontmatter: 'id: x\\nkind: knowledge',\n      body: 'The body.\\nSecond line.'\n    });\n  });\n\n  test('fails when the opening delimiter is missing', () => {\n    expect(splitFrontmatter('no frontmatter here')).toFailWith(/missing opening frontmatter delimiter/i);\n  });\n\n  test('fails when the closing delimiter is missing', () => {\n    expect(splitFrontmatter('---\\nid: x\\nstill going')).toFailWith(/missing closing frontmatter delimiter/i);\n  });\n\n  test('join adds a trailing newline to the frontmatter when absent', () => {\n    expect(joinFrontmatter('id: x', 'body')).toBe('---\\nid: x\\n---\\nbody');\n  });\n\n  test('join does not double the trailing newline when present', () => {\n    expect(joinFrontmatter('id: x\\n', 'body')).toBe('---\\nid: x\\n---\\nbody');\n  });\n\n  test('split and join round-trip', () => {\n    const raw = '---\\nid: x\\n---\\nbody content';\n    const parts = splitFrontmatter(raw).orThrow();\n    expect(joinFrontmatter(parts.frontmatter, parts.body)).toBe(raw);\n  });\n});\n\ndescribe('parseMemoryFile / serializeMemoryFile', () => {\n  let registry: BodyConverterRegistry;\n  const knowledgeKind: Kind = 'knowledge' as Kind;\n\n  beforeEach(() => {\n    registry = BodyConverterRegistry.create().orThrow();\n    registry.register(knowledgeKind, Converters.string);\n  });\n\n  test('serializes then parses a record round-trip', () => {\n    const envelope = envelopeConverter.convert(validEnvelopeObject).orThrow();\n    const file = serializeMemoryFile(envelope, 'The knowledge body.').orThrow();\n    expect(parseMemoryFile(file, registry)).toSucceedAndSatisfy((record) => {\n      expect(record.envelope.id).toBe('intro-to-rust');\n      expect(record.body).toBe('The knowledge body.');\n    });\n  });\n\n  test('fails when the frontmatter cannot be split', () => {\n    expect(parseMemoryFile('no delimiters', registry)).toFailWith(/missing opening frontmatter delimiter/i);\n  });\n\n  test('fails with envelope context when the envelope is invalid', () => {\n    const file = '---\\nid: x\\n---\\nbody';\n    expect(parseMemoryFile(file, registry)).toFailWith(/invalid envelope/i);\n  });\n\n  test('fails with body context when the body fails the registered converter', () => {\n    const envelope = envelopeConverter.convert({ ...validEnvelopeObject, kind: 'unregistered' }).orThrow();\n    const file = serializeMemoryFile(envelope, 'body').orThrow();\n    expect(parseMemoryFile(file, registry)).toFailWith(/invalid body.*no converter registered/i);\n  });\n\n  test('serialize fails (with id context) when the envelope cannot be dumped to YAML', () => {\n    const unserializable = { ...validEnvelopeObject, weird: BigInt(10) } as unknown as IMemoryEnvelope;\n    expect(serializeMemoryFile(unserializable, 'body')).toFailWith(/failed to serialize envelope/i);\n  });\n});\n"]}

package/lib/test/unit/index/memoryIndex.test.d.ts

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

package/lib/test/unit/index/memoryIndex.test.d.ts.map

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

package/lib/test/unit/index/memoryIndex.test.js

@@ -0,0 +1,154 @@
+"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");
+function makeEntry(spec) {
+    var _a, _b, _c, _d, _e, _f;
+    const record = {
+        envelope: index_1.envelopeConverter
+            .convert({
+            id: spec.id,
+            entityId: spec.id,
+            kind: (_a = spec.kind) !== null && _a !== void 0 ? _a : 'knowledge',
+            tags: (_b = spec.tags) !== null && _b !== void 0 ? _b : [],
+            links: ((_c = spec.links) !== null && _c !== void 0 ? _c : []).map((target) => ({ type: 'rel', target })),
+            created: 0,
+            updated: (_d = spec.updated) !== null && _d !== void 0 ? _d : 0,
+            seq: (_e = spec.seq) !== null && _e !== void 0 ? _e : 0,
+            contentHash: 'h',
+            provenance: { source: 'agent' }
+        })
+            .orThrow(),
+        body: `body-${spec.id}`
+    };
+    return { scope: ((_f = spec.scope) !== null && _f !== void 0 ? _f : 'knowledge'), record };
+}
+function ids(records) {
+    return records.map((r) => r.envelope.id);
+}
+describe('MemoryIndex', () => {
+    let index;
+    beforeEach(() => {
+        index = index_1.MemoryIndex.create().orThrow();
+    });
+    describe('create', () => {
+        test('starts empty', () => {
+            expect(index.entries()).toHaveLength(0);
+            expect(index.byKind('knowledge')).toHaveLength(0);
+            expect(index.byTag('any')).toHaveLength(0);
+            expect(index.byRecency()).toHaveLength(0);
+            expect(index.backlinks('none')).toHaveLength(0);
+        });
+    });
+    describe('rebuild', () => {
+        test('indexes every entry and reports the count', () => {
+            const entries = [
+                makeEntry({ id: 'a', tags: ['x'], links: ['b'] }),
+                makeEntry({ id: 'b', tags: ['x', 'y'] })
+            ];
+            expect(index.rebuild(entries)).toSucceedWith(2);
+            expect(index.entries()).toHaveLength(2);
+            expect([...ids(index.byKind('knowledge'))].sort()).toEqual(['a', 'b']);
+            expect([...ids(index.byTag('x'))].sort()).toEqual(['a', 'b']);
+            expect(ids(index.byTag('y'))).toEqual(['b']);
+            expect(index.backlinks('b')).toEqual(['a']);
+        });
+        test('clears prior state', () => {
+            index.rebuild([makeEntry({ id: 'a', tags: ['x'] })]).orThrow();
+            expect(index.rebuild([makeEntry({ id: 'c', tags: ['z'] })])).toSucceedWith(1);
+            expect(ids(index.entries().map((e) => e.record))).toEqual(['c']);
+            expect(index.byTag('x')).toHaveLength(0);
+        });
+    });
+    describe('patch', () => {
+        test('put inserts a new entry and returns it', () => {
+            const entry = makeEntry({ id: 'a', tags: ['x'], links: ['b'] });
+            expect(index.patch('put', entry)).toSucceedWith(entry);
+            expect(ids(index.byKind('knowledge'))).toEqual(['a']);
+            expect(index.backlinks('b')).toEqual(['a']);
+        });
+        test('put on an existing key replaces stale associations', () => {
+            index.patch('put', makeEntry({ id: 'a', kind: 'knowledge', tags: ['old'], links: ['b'] })).orThrow();
+            index.patch('put', makeEntry({ id: 'a', kind: 'note', tags: ['new'], links: ['c'] })).orThrow();
+            expect(index.entries()).toHaveLength(1);
+            expect(index.byTag('old')).toHaveLength(0);
+            expect(ids(index.byTag('new'))).toEqual(['a']);
+            expect(index.byKind('knowledge')).toHaveLength(0);
+            expect(ids(index.byKind('note'))).toEqual(['a']);
+            expect(index.backlinks('b')).toHaveLength(0);
+            expect(index.backlinks('c')).toEqual(['a']);
+        });
+        test('delete removes the entry and its associations', () => {
+            const entry = makeEntry({ id: 'a', tags: ['x'], links: ['b'] });
+            index.patch('put', entry).orThrow();
+            expect(index.patch('delete', entry)).toSucceedWith(entry);
+            expect(index.entries()).toHaveLength(0);
+            expect(index.byTag('x')).toHaveLength(0);
+            expect(index.backlinks('b')).toHaveLength(0);
+        });
+        test('delete of an absent key is a no-op that still succeeds', () => {
+            const entry = makeEntry({ id: 'ghost' });
+            expect(index.patch('delete', entry)).toSucceedWith(entry);
+            expect(index.entries()).toHaveLength(0);
+        });
+        test('distinguishes entries with the same id across scopes', () => {
+            index.patch('put', makeEntry({ id: 'turn-0', scope: 'conversations/c1' })).orThrow();
+            index.patch('put', makeEntry({ id: 'turn-0', scope: 'conversations/c2' })).orThrow();
+            expect(index.entries()).toHaveLength(2);
+        });
+    });
+    describe('byRecency', () => {
+        test('orders most-recently-updated first, breaking ties by seq', () => {
+            index
+                .rebuild([
+                makeEntry({ id: 'old', updated: 100, seq: 1 }),
+                makeEntry({ id: 'newest', updated: 300, seq: 3 }),
+                makeEntry({ id: 'tie-lo', updated: 200, seq: 4 }),
+                makeEntry({ id: 'tie-hi', updated: 200, seq: 9 })
+            ])
+                .orThrow();
+            expect(ids(index.byRecency())).toEqual(['newest', 'tie-hi', 'tie-lo', 'old']);
+        });
+    });
+    describe('backlinks', () => {
+        test('aggregates multiple sources pointing at one target', () => {
+            index
+                .rebuild([makeEntry({ id: 'a', links: ['target'] }), makeEntry({ id: 'b', links: ['target'] })])
+                .orThrow();
+            expect([...index.backlinks('target')].sort()).toEqual(['a', 'b']);
+        });
+        test('drops the target set once the last source is removed', () => {
+            const a = makeEntry({ id: 'a', links: ['target'] });
+            index.patch('put', a).orThrow();
+            index.patch('delete', a).orThrow();
+            expect(index.backlinks('target')).toHaveLength(0);
+        });
+        test('tracks same-id sources across scopes independently', () => {
+            // Two distinct records that share the id 'a' under different scopes, both
+            // linking 'target'. Removing one must NOT drop the other's inbound edge.
+            const a1 = makeEntry({ id: 'a', scope: 'conversations/c1', links: ['target'] });
+            const a2 = makeEntry({ id: 'a', scope: 'conversations/c2', links: ['target'] });
+            index.patch('put', a1).orThrow();
+            index.patch('put', a2).orThrow();
+            expect(index.backlinks('target')).toEqual(['a', 'a']);
+            index.patch('delete', a1).orThrow();
+            expect(index.backlinks('target')).toEqual(['a']);
+        });
+    });
+    describe('duplicate associations', () => {
+        test('a record with duplicate tags and links is cleaned up exactly once on delete', () => {
+            const entry = makeEntry({ id: 'a', tags: ['dup', 'dup'], links: ['t', 't'] });
+            index.patch('put', entry).orThrow();
+            expect(ids(index.byTag('dup'))).toEqual(['a']);
+            expect(index.backlinks('t')).toEqual(['a']);
+            index.patch('delete', entry).orThrow();
+            expect(index.byTag('dup')).toHaveLength(0);
+            expect(index.backlinks('t')).toHaveLength(0);
+        });
+    });
+});
+//# sourceMappingURL=memoryIndex.test.js.map

package/lib/test/unit/index/memoryIndex.test.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"memoryIndex.test.js","sourceRoot":"","sources":["../../../../src/test/unit/index/memoryIndex.test.ts"],"names":[],"mappings":";AAAA;;;GAGG;;AAEH,8BAA4B;AAC5B,0CASwB;AAYxB,SAAS,SAAS,CAAC,IAAiB;;IAClC,MAAM,MAAM,GAA2B;QACrC,QAAQ,EAAE,yBAAiB;aACxB,OAAO,CAAC;YACP,EAAE,EAAE,IAAI,CAAC,EAAE;YACX,QAAQ,EAAE,IAAI,CAAC,EAAE;YACjB,IAAI,EAAE,MAAA,IAAI,CAAC,IAAI,mCAAI,WAAW;YAC9B,IAAI,EAAE,MAAA,IAAI,CAAC,IAAI,mCAAI,EAAE;YACrB,KAAK,EAAE,CAAC,MAAA,IAAI,CAAC,KAAK,mCAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC,CAAC;YACpE,OAAO,EAAE,CAAC;YACV,OAAO,EAAE,MAAA,IAAI,CAAC,OAAO,mCAAI,CAAC;YAC1B,GAAG,EAAE,MAAA,IAAI,CAAC,GAAG,mCAAI,CAAC;YAClB,WAAW,EAAE,GAAG;YAChB,UAAU,EAAE,EAAE,MAAM,EAAE,OAAO,EAAE;SAChC,CAAC;aACD,OAAO,EAAE;QACZ,IAAI,EAAE,QAAQ,IAAI,CAAC,EAAE,EAAE;KACxB,CAAC;IACF,OAAO,EAAE,KAAK,EAAE,CAAC,MAAA,IAAI,CAAC,KAAK,mCAAI,WAAW,CAAmB,EAAE,MAAM,EAAE,CAAC;AAC1E,CAAC;AAED,SAAS,GAAG,CAAC,OAA8C;IACzD,OAAO,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAY,CAAC,CAAC;AACrD,CAAC;AAED,QAAQ,CAAC,aAAa,EAAE,GAAG,EAAE;IAC3B,IAAI,KAAkB,CAAC;IAEvB,UAAU,CAAC,GAAG,EAAE;QACd,KAAK,GAAG,mBAAW,CAAC,MAAM,EAAE,CAAC,OAAO,EAAE,CAAC;IACzC,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,QAAQ,EAAE,GAAG,EAAE;QACtB,IAAI,CAAC,cAAc,EAAE,GAAG,EAAE;YACxB,MAAM,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;YACxC,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,WAAmB,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;YAC1D,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,KAAY,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;YAClD,MAAM,CAAC,KAAK,CAAC,SAAS,EAAE,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;YAC1C,MAAM,CAAC,KAAK,CAAC,SAAS,CAAC,MAAkB,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QAC9D,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,SAAS,EAAE,GAAG,EAAE;QACvB,IAAI,CAAC,2CAA2C,EAAE,GAAG,EAAE;YACrD,MAAM,OAAO,GAAG;gBACd,SAAS,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC,GAAG,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC;gBACjD,SAAS,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC;aACzC,CAAC;YACF,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC;YAChD,MAAM,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;YACxC,MAAM,CAAC,CAAC,GAAG,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC,WAAmB,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;YAC/E,MAAM,CAAC,CAAC,GAAG,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC,GAAU,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;YACrE,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC,GAAU,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YACpD,MAAM,CAAC,KAAK,CAAC,SAAS,CAAC,GAAe,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAC1D,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,oBAAoB,EAAE,GAAG,EAAE;YAC9B,KAAK,CAAC,OAAO,CAAC,CAAC,SAAS,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;YAC/D,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,SAAS,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC;YAC9E,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YACjE,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,GAAU,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QAClD,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,OAAO,EAAE,GAAG,EAAE;QACrB,IAAI,CAAC,wCAAwC,EAAE,GAAG,EAAE;YAClD,MAAM,KAAK,GAAG,SAAS,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC,GAAG,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YAChE,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC;YACvD,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC,WAAmB,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAC9D,MAAM,CAAC,KAAK,CAAC,SAAS,CAAC,GAAe,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAC1D,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,oDAAoD,EAAE,GAAG,EAAE;YAC9D,KAAK,CAAC,KAAK,CAAC,KAAK,EAAE,SAAS,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,IAAI,EAAE,WAAW,EAAE,IAAI,EAAE,CAAC,KAAK,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;YACrG,KAAK,CAAC,KAAK,CAAC,KAAK,EAAE,SAAS,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC,KAAK,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;YAChG,MAAM,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;YACxC,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,KAAY,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;YAClD,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC,KAAY,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YACtD,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,WAAmB,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;YAC1D,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC,MAAc,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YACzD,MAAM,CAAC,KAAK,CAAC,SAAS,CAAC,GAAe,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;YACzD,MAAM,CAAC,KAAK,CAAC,SAAS,CAAC,GAAe,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAC1D,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,+CAA+C,EAAE,GAAG,EAAE;YACzD,MAAM,KAAK,GAAG,SAAS,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC,GAAG,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YAChE,KAAK,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC,OAAO,EAAE,CAAC;YACpC,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC;YAC1D,MAAM,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;YACxC,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,GAAU,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;YAChD,MAAM,CAAC,KAAK,CAAC,SAAS,CAAC,GAAe,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QAC3D,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,wDAAwD,EAAE,GAAG,EAAE;YAClE,MAAM,KAAK,GAAG,SAAS,CAAC,EAAE,EAAE,EAAE,OAAO,EAAE,CAAC,CAAC;YACzC,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC;YAC1D,MAAM,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QAC1C,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,sDAAsD,EAAE,GAAG,EAAE;YAChE,KAAK,CAAC,KAAK,CAAC,KAAK,EAAE,SAAS,CAAC,EAAE,EAAE,EAAE,QAAQ,EAAE,KAAK,EAAE,kBAAkB,EAAE,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;YACrF,KAAK,CAAC,KAAK,CAAC,KAAK,EAAE,SAAS,CAAC,EAAE,EAAE,EAAE,QAAQ,EAAE,KAAK,EAAE,kBAAkB,EAAE,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;YACrF,MAAM,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QAC1C,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,WAAW,EAAE,GAAG,EAAE;QACzB,IAAI,CAAC,0DAA0D,EAAE,GAAG,EAAE;YACpE,KAAK;iBACF,OAAO,CAAC;gBACP,SAAS,CAAC,EAAE,EAAE,EAAE,KAAK,EAAE,OAAO,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC;gBAC9C,SAAS,CAAC,EAAE,EAAE,EAAE,QAAQ,EAAE,OAAO,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC;gBACjD,SAAS,CAAC,EAAE,EAAE,EAAE,QAAQ,EAAE,OAAO,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC;gBACjD,SAAS,CAAC,EAAE,EAAE,EAAE,QAAQ,EAAE,OAAO,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC;aAClD,CAAC;iBACD,OAAO,EAAE,CAAC;YACb,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,QAAQ,EAAE,QAAQ,EAAE,QAAQ,EAAE,KAAK,CAAC,CAAC,CAAC;QAChF,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,WAAW,EAAE,GAAG,EAAE;QACzB,IAAI,CAAC,oDAAoD,EAAE,GAAG,EAAE;YAC9D,KAAK;iBACF,OAAO,CAAC,CAAC,SAAS,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,KAAK,EAAE,CAAC,QAAQ,CAAC,EAAE,CAAC,EAAE,SAAS,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,KAAK,EAAE,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC;iBAC/F,OAAO,EAAE,CAAC;YACb,MAAM,CAAC,CAAC,GAAG,KAAK,CAAC,SAAS,CAAC,QAAoB,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;QAChF,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,sDAAsD,EAAE,GAAG,EAAE;YAChE,MAAM,CAAC,GAAG,SAAS,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,KAAK,EAAE,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;YACpD,KAAK,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;YAChC,KAAK,CAAC,KAAK,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;YACnC,MAAM,CAAC,KAAK,CAAC,SAAS,CAAC,QAAoB,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QAChE,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,oDAAoD,EAAE,GAAG,EAAE;YAC9D,0EAA0E;YAC1E,yEAAyE;YACzE,MAAM,EAAE,GAAG,SAAS,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,KAAK,EAAE,kBAAkB,EAAE,KAAK,EAAE,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;YAChF,MAAM,EAAE,GAAG,SAAS,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,KAAK,EAAE,kBAAkB,EAAE,KAAK,EAAE,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;YAChF,KAAK,CAAC,KAAK,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,OAAO,EAAE,CAAC;YACjC,KAAK,CAAC,KAAK,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,OAAO,EAAE,CAAC;YACjC,MAAM,CAAC,KAAK,CAAC,SAAS,CAAC,QAAoB,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;YAClE,KAAK,CAAC,KAAK,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC,OAAO,EAAE,CAAC;YACpC,MAAM,CAAC,KAAK,CAAC,SAAS,CAAC,QAAoB,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAC/D,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,wBAAwB,EAAE,GAAG,EAAE;QACtC,IAAI,CAAC,6EAA6E,EAAE,GAAG,EAAE;YACvF,MAAM,KAAK,GAAG,SAAS,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC,KAAK,EAAE,KAAK,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC;YAC9E,KAAK,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC,OAAO,EAAE,CAAC;YACpC,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC,KAAY,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YACtD,MAAM,CAAC,KAAK,CAAC,SAAS,CAAC,GAAe,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YACxD,KAAK,CAAC,KAAK,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC,OAAO,EAAE,CAAC;YACvC,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,KAAY,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;YAClD,MAAM,CAAC,KAAK,CAAC,SAAS,CAAC,GAAe,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QAC3D,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  IIndexedMemoryRecord,\n  IMemoryRecord,\n  Kind,\n  MemoryId,\n  MemoryIndex,\n  MemoryScopeKey,\n  Tag,\n  envelopeConverter\n} from '../../../index';\n\ninterface IRecordSpec {\n  readonly id: string;\n  readonly scope?: string;\n  readonly kind?: string;\n  readonly tags?: ReadonlyArray<string>;\n  readonly links?: ReadonlyArray<string>;\n  readonly updated?: number;\n  readonly seq?: number;\n}\n\nfunction makeEntry(spec: IRecordSpec): IIndexedMemoryRecord {\n  const record: IMemoryRecord<unknown> = {\n    envelope: envelopeConverter\n      .convert({\n        id: spec.id,\n        entityId: spec.id,\n        kind: spec.kind ?? 'knowledge',\n        tags: spec.tags ?? [],\n        links: (spec.links ?? []).map((target) => ({ type: 'rel', target })),\n        created: 0,\n        updated: spec.updated ?? 0,\n        seq: spec.seq ?? 0,\n        contentHash: 'h',\n        provenance: { source: 'agent' }\n      })\n      .orThrow(),\n    body: `body-${spec.id}`\n  };\n  return { scope: (spec.scope ?? 'knowledge') as MemoryScopeKey, record };\n}\n\nfunction ids(records: ReadonlyArray<IMemoryRecord<unknown>>): ReadonlyArray<string> {\n  return records.map((r) => r.envelope.id as string);\n}\n\ndescribe('MemoryIndex', () => {\n  let index: MemoryIndex;\n\n  beforeEach(() => {\n    index = MemoryIndex.create().orThrow();\n  });\n\n  describe('create', () => {\n    test('starts empty', () => {\n      expect(index.entries()).toHaveLength(0);\n      expect(index.byKind('knowledge' as Kind)).toHaveLength(0);\n      expect(index.byTag('any' as Tag)).toHaveLength(0);\n      expect(index.byRecency()).toHaveLength(0);\n      expect(index.backlinks('none' as MemoryId)).toHaveLength(0);\n    });\n  });\n\n  describe('rebuild', () => {\n    test('indexes every entry and reports the count', () => {\n      const entries = [\n        makeEntry({ id: 'a', tags: ['x'], links: ['b'] }),\n        makeEntry({ id: 'b', tags: ['x', 'y'] })\n      ];\n      expect(index.rebuild(entries)).toSucceedWith(2);\n      expect(index.entries()).toHaveLength(2);\n      expect([...ids(index.byKind('knowledge' as Kind))].sort()).toEqual(['a', 'b']);\n      expect([...ids(index.byTag('x' as Tag))].sort()).toEqual(['a', 'b']);\n      expect(ids(index.byTag('y' as Tag))).toEqual(['b']);\n      expect(index.backlinks('b' as MemoryId)).toEqual(['a']);\n    });\n\n    test('clears prior state', () => {\n      index.rebuild([makeEntry({ id: 'a', tags: ['x'] })]).orThrow();\n      expect(index.rebuild([makeEntry({ id: 'c', tags: ['z'] })])).toSucceedWith(1);\n      expect(ids(index.entries().map((e) => e.record))).toEqual(['c']);\n      expect(index.byTag('x' as Tag)).toHaveLength(0);\n    });\n  });\n\n  describe('patch', () => {\n    test('put inserts a new entry and returns it', () => {\n      const entry = makeEntry({ id: 'a', tags: ['x'], links: ['b'] });\n      expect(index.patch('put', entry)).toSucceedWith(entry);\n      expect(ids(index.byKind('knowledge' as Kind))).toEqual(['a']);\n      expect(index.backlinks('b' as MemoryId)).toEqual(['a']);\n    });\n\n    test('put on an existing key replaces stale associations', () => {\n      index.patch('put', makeEntry({ id: 'a', kind: 'knowledge', tags: ['old'], links: ['b'] })).orThrow();\n      index.patch('put', makeEntry({ id: 'a', kind: 'note', tags: ['new'], links: ['c'] })).orThrow();\n      expect(index.entries()).toHaveLength(1);\n      expect(index.byTag('old' as Tag)).toHaveLength(0);\n      expect(ids(index.byTag('new' as Tag))).toEqual(['a']);\n      expect(index.byKind('knowledge' as Kind)).toHaveLength(0);\n      expect(ids(index.byKind('note' as Kind))).toEqual(['a']);\n      expect(index.backlinks('b' as MemoryId)).toHaveLength(0);\n      expect(index.backlinks('c' as MemoryId)).toEqual(['a']);\n    });\n\n    test('delete removes the entry and its associations', () => {\n      const entry = makeEntry({ id: 'a', tags: ['x'], links: ['b'] });\n      index.patch('put', entry).orThrow();\n      expect(index.patch('delete', entry)).toSucceedWith(entry);\n      expect(index.entries()).toHaveLength(0);\n      expect(index.byTag('x' as Tag)).toHaveLength(0);\n      expect(index.backlinks('b' as MemoryId)).toHaveLength(0);\n    });\n\n    test('delete of an absent key is a no-op that still succeeds', () => {\n      const entry = makeEntry({ id: 'ghost' });\n      expect(index.patch('delete', entry)).toSucceedWith(entry);\n      expect(index.entries()).toHaveLength(0);\n    });\n\n    test('distinguishes entries with the same id across scopes', () => {\n      index.patch('put', makeEntry({ id: 'turn-0', scope: 'conversations/c1' })).orThrow();\n      index.patch('put', makeEntry({ id: 'turn-0', scope: 'conversations/c2' })).orThrow();\n      expect(index.entries()).toHaveLength(2);\n    });\n  });\n\n  describe('byRecency', () => {\n    test('orders most-recently-updated first, breaking ties by seq', () => {\n      index\n        .rebuild([\n          makeEntry({ id: 'old', updated: 100, seq: 1 }),\n          makeEntry({ id: 'newest', updated: 300, seq: 3 }),\n          makeEntry({ id: 'tie-lo', updated: 200, seq: 4 }),\n          makeEntry({ id: 'tie-hi', updated: 200, seq: 9 })\n        ])\n        .orThrow();\n      expect(ids(index.byRecency())).toEqual(['newest', 'tie-hi', 'tie-lo', 'old']);\n    });\n  });\n\n  describe('backlinks', () => {\n    test('aggregates multiple sources pointing at one target', () => {\n      index\n        .rebuild([makeEntry({ id: 'a', links: ['target'] }), makeEntry({ id: 'b', links: ['target'] })])\n        .orThrow();\n      expect([...index.backlinks('target' as MemoryId)].sort()).toEqual(['a', 'b']);\n    });\n\n    test('drops the target set once the last source is removed', () => {\n      const a = makeEntry({ id: 'a', links: ['target'] });\n      index.patch('put', a).orThrow();\n      index.patch('delete', a).orThrow();\n      expect(index.backlinks('target' as MemoryId)).toHaveLength(0);\n    });\n\n    test('tracks same-id sources across scopes independently', () => {\n      // Two distinct records that share the id 'a' under different scopes, both\n      // linking 'target'. Removing one must NOT drop the other's inbound edge.\n      const a1 = makeEntry({ id: 'a', scope: 'conversations/c1', links: ['target'] });\n      const a2 = makeEntry({ id: 'a', scope: 'conversations/c2', links: ['target'] });\n      index.patch('put', a1).orThrow();\n      index.patch('put', a2).orThrow();\n      expect(index.backlinks('target' as MemoryId)).toEqual(['a', 'a']);\n      index.patch('delete', a1).orThrow();\n      expect(index.backlinks('target' as MemoryId)).toEqual(['a']);\n    });\n  });\n\n  describe('duplicate associations', () => {\n    test('a record with duplicate tags and links is cleaned up exactly once on delete', () => {\n      const entry = makeEntry({ id: 'a', tags: ['dup', 'dup'], links: ['t', 't'] });\n      index.patch('put', entry).orThrow();\n      expect(ids(index.byTag('dup' as Tag))).toEqual(['a']);\n      expect(index.backlinks('t' as MemoryId)).toEqual(['a']);\n      index.patch('delete', entry).orThrow();\n      expect(index.byTag('dup' as Tag)).toHaveLength(0);\n      expect(index.backlinks('t' as MemoryId)).toHaveLength(0);\n    });\n  });\n});\n"]}

package/lib/test/unit/observe/memoryObservationStore.test.d.ts

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

package/lib/test/unit/observe/memoryObservationStore.test.d.ts.map

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

package/lib/test/unit/observe/memoryObservationStore.test.js

@@ -0,0 +1,120 @@
+"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");
+function obs(spec) {
+    var _a, _b, _c;
+    return {
+        seq: spec.seq,
+        timestamp: (_a = spec.timestamp) !== null && _a !== void 0 ? _a : spec.seq,
+        phase: (_b = spec.phase) !== null && _b !== void 0 ? _b : 'write',
+        scope: spec.scope === undefined ? undefined : spec.scope,
+        kind: spec.kind === undefined ? undefined : spec.kind,
+        id: spec.id === undefined ? undefined : spec.id,
+        outcome: (_c = spec.outcome) !== null && _c !== void 0 ? _c : 'success'
+    };
+}
+function seqs(records) {
+    return records.map((r) => r.seq);
+}
+describe('MemoryObservationStore', () => {
+    describe('create', () => {
+        test('builds with defaults', () => {
+            expect(index_1.MemoryObservationStore.create()).toSucceedAndSatisfy((store) => {
+                expect(store.size).toBe(0);
+                expect(store.lastSeq).toBe(0);
+            });
+        });
+        test('rejects a non-positive-integer maxRecords', () => {
+            expect(index_1.MemoryObservationStore.create({ maxRecords: 0 })).toFailWith(/positive integer/i);
+            expect(index_1.MemoryObservationStore.create({ maxRecords: 2.5 })).toFailWith(/positive integer/i);
+            expect(index_1.MemoryObservationStore.create({ maxRecords: -1 })).toFailWith(/positive integer/i);
+        });
+    });
+    describe('observe', () => {
+        test('retains records and tracks size + lastSeq', async () => {
+            const store = index_1.MemoryObservationStore.create().orThrow();
+            expect(await store.observe(obs({ seq: 1 }))).toSucceed();
+            expect(await store.observe(obs({ seq: 2 }))).toSucceed();
+            expect(store.size).toBe(2);
+            expect(store.lastSeq).toBe(2);
+        });
+        test('evicts the oldest beyond maxRecords, preserving lastSeq', async () => {
+            const store = index_1.MemoryObservationStore.create({ maxRecords: 2 }).orThrow();
+            await store.observe(obs({ seq: 1 }));
+            await store.observe(obs({ seq: 2 }));
+            await store.observe(obs({ seq: 3 }));
+            expect(store.size).toBe(2);
+            expect(store.lastSeq).toBe(3);
+            expect(seqs(store.query())).toEqual([2, 3]);
+        });
+    });
+    describe('query', () => {
+        let store;
+        beforeEach(async () => {
+            store = index_1.MemoryObservationStore.create().orThrow();
+            await store.observe(obs({
+                seq: 1,
+                timestamp: 100,
+                phase: 'write',
+                scope: 'knowledge',
+                kind: 'knowledge',
+                outcome: 'success'
+            }));
+            await store.observe(obs({
+                seq: 2,
+                timestamp: 200,
+                phase: 'read',
+                scope: 'knowledge',
+                kind: 'knowledge',
+                outcome: 'failure'
+            }));
+            await store.observe(obs({ seq: 3, timestamp: 300, phase: 'delete', scope: 'other', kind: 'note', outcome: 'success' }));
+        });
+        test('returns all records oldest-first with no criteria', () => {
+            expect(seqs(store.query())).toEqual([1, 2, 3]);
+        });
+        test('pages by sinceSeq', () => {
+            expect(seqs(store.query({ sinceSeq: 1 }))).toEqual([2, 3]);
+        });
+        test('limits to the most-recent N', () => {
+            expect(seqs(store.query({ limit: 2 }))).toEqual([2, 3]);
+        });
+        test('filters by timestamp window', () => {
+            expect(seqs(store.query({ since: 200 }))).toEqual([2, 3]);
+            expect(seqs(store.query({ until: 200 }))).toEqual([1, 2]);
+            expect(seqs(store.query({ since: 150, until: 250 }))).toEqual([2]);
+        });
+        test('filters by scope', () => {
+            expect(seqs(store.query({ scope: 'knowledge' }))).toEqual([1, 2]);
+        });
+        test('filters by kind', () => {
+            expect(seqs(store.query({ kind: 'note' }))).toEqual([3]);
+        });
+        test('filters by phase', () => {
+            expect(seqs(store.query({ phase: 'read' }))).toEqual([2]);
+        });
+        test('filters by outcome', () => {
+            expect(seqs(store.query({ outcome: 'failure' }))).toEqual([2]);
+        });
+        test('combines criteria with AND', () => {
+            expect(seqs(store.query({ scope: 'knowledge', outcome: 'success' }))).toEqual([1]);
+        });
+    });
+    describe('clear', () => {
+        test('drops records but preserves lastSeq as a cursor floor', async () => {
+            const store = index_1.MemoryObservationStore.create().orThrow();
+            await store.observe(obs({ seq: 1 }));
+            await store.observe(obs({ seq: 2 }));
+            store.clear();
+            expect(store.size).toBe(0);
+            expect(store.lastSeq).toBe(2);
+            expect(store.query()).toEqual([]);
+        });
+    });
+});
+//# sourceMappingURL=memoryObservationStore.test.js.map

package/lib/test/unit/observe/memoryObservationStore.test.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"memoryObservationStore.test.js","sourceRoot":"","sources":["../../../../src/test/unit/observe/memoryObservationStore.test.ts"],"names":[],"mappings":";AAAA;;;GAGG;;AAEH,8BAA4B;AAC5B,0CAOwB;AAYxB,SAAS,GAAG,CAAC,IAAc;;IACzB,OAAO;QACL,GAAG,EAAE,IAAI,CAAC,GAAG;QACb,SAAS,EAAE,MAAA,IAAI,CAAC,SAAS,mCAAI,IAAI,CAAC,GAAG;QACrC,KAAK,EAAE,MAAA,IAAI,CAAC,KAAK,mCAAI,OAAO;QAC5B,KAAK,EAAE,IAAI,CAAC,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAE,IAAI,CAAC,KAAwB;QAC5E,IAAI,EAAE,IAAI,CAAC,IAAI,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAE,IAAI,CAAC,IAAa;QAC/D,EAAE,EAAE,IAAI,CAAC,EAAE,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAE,IAAI,CAAC,EAAe;QAC7D,OAAO,EAAE,MAAA,IAAI,CAAC,OAAO,mCAAI,SAAS;KACnC,CAAC;AACJ,CAAC;AAED,SAAS,IAAI,CAAC,OAAgD;IAC5D,OAAO,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;AACnC,CAAC;AAED,QAAQ,CAAC,wBAAwB,EAAE,GAAG,EAAE;IACtC,QAAQ,CAAC,QAAQ,EAAE,GAAG,EAAE;QACtB,IAAI,CAAC,sBAAsB,EAAE,GAAG,EAAE;YAChC,MAAM,CAAC,8BAAsB,CAAC,MAAM,EAAE,CAAC,CAAC,mBAAmB,CAAC,CAAC,KAA6B,EAAE,EAAE;gBAC5F,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gBAC3B,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAChC,CAAC,CAAC,CAAC;QACL,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,2CAA2C,EAAE,GAAG,EAAE;YACrD,MAAM,CAAC,8BAAsB,CAAC,MAAM,CAAC,EAAE,UAAU,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,mBAAmB,CAAC,CAAC;YACzF,MAAM,CAAC,8BAAsB,CAAC,MAAM,CAAC,EAAE,UAAU,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,mBAAmB,CAAC,CAAC;YAC3F,MAAM,CAAC,8BAAsB,CAAC,MAAM,CAAC,EAAE,UAAU,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,mBAAmB,CAAC,CAAC;QAC5F,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,SAAS,EAAE,GAAG,EAAE;QACvB,IAAI,CAAC,2CAA2C,EAAE,KAAK,IAAI,EAAE;YAC3D,MAAM,KAAK,GAAG,8BAAsB,CAAC,MAAM,EAAE,CAAC,OAAO,EAAE,CAAC;YACxD,MAAM,CAAC,MAAM,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC;YACzD,MAAM,CAAC,MAAM,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC;YACzD,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAC3B,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAChC,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,yDAAyD,EAAE,KAAK,IAAI,EAAE;YACzE,MAAM,KAAK,GAAG,8BAAsB,CAAC,MAAM,CAAC,EAAE,UAAU,EAAE,CAAC,EAAE,CAAC,CAAC,OAAO,EAAE,CAAC;YACzE,MAAM,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YACrC,MAAM,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YACrC,MAAM,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YACrC,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAC3B,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAC9B,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAC9C,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,OAAO,EAAE,GAAG,EAAE;QACrB,IAAI,KAA6B,CAAC;QAElC,UAAU,CAAC,KAAK,IAAI,EAAE;YACpB,KAAK,GAAG,8BAAsB,CAAC,MAAM,EAAE,CAAC,OAAO,EAAE,CAAC;YAClD,MAAM,KAAK,CAAC,OAAO,CACjB,GAAG,CAAC;gBACF,GAAG,EAAE,CAAC;gBACN,SAAS,EAAE,GAAG;gBACd,KAAK,EAAE,OAAO;gBACd,KAAK,EAAE,WAAW;gBAClB,IAAI,EAAE,WAAW;gBACjB,OAAO,EAAE,SAAS;aACnB,CAAC,CACH,CAAC;YACF,MAAM,KAAK,CAAC,OAAO,CACjB,GAAG,CAAC;gBACF,GAAG,EAAE,CAAC;gBACN,SAAS,EAAE,GAAG;gBACd,KAAK,EAAE,MAAM;gBACb,KAAK,EAAE,WAAW;gBAClB,IAAI,EAAE,WAAW;gBACjB,OAAO,EAAE,SAAS;aACnB,CAAC,CACH,CAAC;YACF,MAAM,KAAK,CAAC,OAAO,CACjB,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,SAAS,EAAE,GAAG,EAAE,KAAK,EAAE,QAAQ,EAAE,KAAK,EAAE,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,OAAO,EAAE,SAAS,EAAE,CAAC,CACnG,CAAC;QACJ,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,mDAAmD,EAAE,GAAG,EAAE;YAC7D,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QACjD,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,mBAAmB,EAAE,GAAG,EAAE;YAC7B,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,QAAQ,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAC7D,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,6BAA6B,EAAE,GAAG,EAAE;YACvC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAC1D,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,6BAA6B,EAAE,GAAG,EAAE;YACvC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YAC1D,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YAC1D,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,KAAK,EAAE,GAAG,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACrE,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,kBAAkB,EAAE,GAAG,EAAE;YAC5B,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,KAAK,EAAE,WAA6B,EAAE,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QACtF,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,iBAAiB,EAAE,GAAG,EAAE;YAC3B,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,IAAI,EAAE,MAAc,EAAE,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACnE,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,kBAAkB,EAAE,GAAG,EAAE;YAC5B,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC5D,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,oBAAoB,EAAE,GAAG,EAAE;YAC9B,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,OAAO,EAAE,SAAS,EAAE,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACjE,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,4BAA4B,EAAE,GAAG,EAAE;YACtC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,KAAK,EAAE,WAA6B,EAAE,OAAO,EAAE,SAAS,EAAE,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACvG,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,OAAO,EAAE,GAAG,EAAE;QACrB,IAAI,CAAC,uDAAuD,EAAE,KAAK,IAAI,EAAE;YACvE,MAAM,KAAK,GAAG,8BAAsB,CAAC,MAAM,EAAE,CAAC,OAAO,EAAE,CAAC;YACxD,MAAM,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YACrC,MAAM,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YACrC,KAAK,CAAC,KAAK,EAAE,CAAC;YACd,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAC3B,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAC9B,MAAM,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;QACpC,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  IMemoryObservationRecord,\n  Kind,\n  MemoryId,\n  MemoryObservationPhase,\n  MemoryObservationStore,\n  MemoryScopeKey\n} from '../../../index';\n\ninterface IObsSpec {\n  readonly seq: number;\n  readonly timestamp?: number;\n  readonly phase?: MemoryObservationPhase;\n  readonly scope?: string;\n  readonly kind?: string;\n  readonly id?: string;\n  readonly outcome?: 'success' | 'failure';\n}\n\nfunction obs(spec: IObsSpec): IMemoryObservationRecord {\n  return {\n    seq: spec.seq,\n    timestamp: spec.timestamp ?? spec.seq,\n    phase: spec.phase ?? 'write',\n    scope: spec.scope === undefined ? undefined : (spec.scope as MemoryScopeKey),\n    kind: spec.kind === undefined ? undefined : (spec.kind as Kind),\n    id: spec.id === undefined ? undefined : (spec.id as MemoryId),\n    outcome: spec.outcome ?? 'success'\n  };\n}\n\nfunction seqs(records: ReadonlyArray<IMemoryObservationRecord>): ReadonlyArray<number> {\n  return records.map((r) => r.seq);\n}\n\ndescribe('MemoryObservationStore', () => {\n  describe('create', () => {\n    test('builds with defaults', () => {\n      expect(MemoryObservationStore.create()).toSucceedAndSatisfy((store: MemoryObservationStore) => {\n        expect(store.size).toBe(0);\n        expect(store.lastSeq).toBe(0);\n      });\n    });\n\n    test('rejects a non-positive-integer maxRecords', () => {\n      expect(MemoryObservationStore.create({ maxRecords: 0 })).toFailWith(/positive integer/i);\n      expect(MemoryObservationStore.create({ maxRecords: 2.5 })).toFailWith(/positive integer/i);\n      expect(MemoryObservationStore.create({ maxRecords: -1 })).toFailWith(/positive integer/i);\n    });\n  });\n\n  describe('observe', () => {\n    test('retains records and tracks size + lastSeq', async () => {\n      const store = MemoryObservationStore.create().orThrow();\n      expect(await store.observe(obs({ seq: 1 }))).toSucceed();\n      expect(await store.observe(obs({ seq: 2 }))).toSucceed();\n      expect(store.size).toBe(2);\n      expect(store.lastSeq).toBe(2);\n    });\n\n    test('evicts the oldest beyond maxRecords, preserving lastSeq', async () => {\n      const store = MemoryObservationStore.create({ maxRecords: 2 }).orThrow();\n      await store.observe(obs({ seq: 1 }));\n      await store.observe(obs({ seq: 2 }));\n      await store.observe(obs({ seq: 3 }));\n      expect(store.size).toBe(2);\n      expect(store.lastSeq).toBe(3);\n      expect(seqs(store.query())).toEqual([2, 3]);\n    });\n  });\n\n  describe('query', () => {\n    let store: MemoryObservationStore;\n\n    beforeEach(async () => {\n      store = MemoryObservationStore.create().orThrow();\n      await store.observe(\n        obs({\n          seq: 1,\n          timestamp: 100,\n          phase: 'write',\n          scope: 'knowledge',\n          kind: 'knowledge',\n          outcome: 'success'\n        })\n      );\n      await store.observe(\n        obs({\n          seq: 2,\n          timestamp: 200,\n          phase: 'read',\n          scope: 'knowledge',\n          kind: 'knowledge',\n          outcome: 'failure'\n        })\n      );\n      await store.observe(\n        obs({ seq: 3, timestamp: 300, phase: 'delete', scope: 'other', kind: 'note', outcome: 'success' })\n      );\n    });\n\n    test('returns all records oldest-first with no criteria', () => {\n      expect(seqs(store.query())).toEqual([1, 2, 3]);\n    });\n\n    test('pages by sinceSeq', () => {\n      expect(seqs(store.query({ sinceSeq: 1 }))).toEqual([2, 3]);\n    });\n\n    test('limits to the most-recent N', () => {\n      expect(seqs(store.query({ limit: 2 }))).toEqual([2, 3]);\n    });\n\n    test('filters by timestamp window', () => {\n      expect(seqs(store.query({ since: 200 }))).toEqual([2, 3]);\n      expect(seqs(store.query({ until: 200 }))).toEqual([1, 2]);\n      expect(seqs(store.query({ since: 150, until: 250 }))).toEqual([2]);\n    });\n\n    test('filters by scope', () => {\n      expect(seqs(store.query({ scope: 'knowledge' as MemoryScopeKey }))).toEqual([1, 2]);\n    });\n\n    test('filters by kind', () => {\n      expect(seqs(store.query({ kind: 'note' as Kind }))).toEqual([3]);\n    });\n\n    test('filters by phase', () => {\n      expect(seqs(store.query({ phase: 'read' }))).toEqual([2]);\n    });\n\n    test('filters by outcome', () => {\n      expect(seqs(store.query({ outcome: 'failure' }))).toEqual([2]);\n    });\n\n    test('combines criteria with AND', () => {\n      expect(seqs(store.query({ scope: 'knowledge' as MemoryScopeKey, outcome: 'success' }))).toEqual([1]);\n    });\n  });\n\n  describe('clear', () => {\n    test('drops records but preserves lastSeq as a cursor floor', async () => {\n      const store = MemoryObservationStore.create().orThrow();\n      await store.observe(obs({ seq: 1 }));\n      await store.observe(obs({ seq: 2 }));\n      store.clear();\n      expect(store.size).toBe(0);\n      expect(store.lastSeq).toBe(2);\n      expect(store.query()).toEqual([]);\n    });\n  });\n});\n"]}

package/lib/test/unit/retrieve/linkTraversalRetriever.test.d.ts

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

package/lib/test/unit/retrieve/linkTraversalRetriever.test.d.ts.map

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

package/lib/test/unit/retrieve/linkTraversalRetriever.test.js

@@ -0,0 +1,184 @@
+"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");
+function makeEntry(spec) {
+    var _a, _b, _c, _d, _e, _f;
+    const record = {
+        envelope: index_1.envelopeConverter
+            .convert({
+            id: spec.id,
+            entityId: spec.id,
+            kind: (_a = spec.kind) !== null && _a !== void 0 ? _a : 'experience',
+            tags: (_b = spec.tags) !== null && _b !== void 0 ? _b : [],
+            links: ((_c = spec.links) !== null && _c !== void 0 ? _c : []).map((target) => ({ type: 'rel', target })),
+            created: 0,
+            updated: (_d = spec.updated) !== null && _d !== void 0 ? _d : 0,
+            seq: (_e = spec.seq) !== null && _e !== void 0 ? _e : 0,
+            contentHash: 'h',
+            provenance: { source: 'agent' }
+        })
+            .orThrow(),
+        body: `body-${spec.id}`
+    };
+    return { scope: ((_f = spec.scope) !== null && _f !== void 0 ? _f : 'experience'), record };
+}
+function buildIndex(specs) {
+    const index = index_1.MemoryIndex.create().orThrow();
+    index.rebuild(specs.map(makeEntry)).orThrow();
+    return index;
+}
+function ids(records) {
+    return records.map((r) => r.envelope.id);
+}
+describe('LinkTraversalRetriever', () => {
+    test('reports the link-traversal capability', () => {
+        const index = buildIndex([]);
+        const retriever = index_1.LinkTraversalRetriever.create(index).orThrow();
+        expect(retriever.capabilities).toEqual({
+            supportsSemanticRecall: false,
+            supportsTemporalQuery: false,
+            supportsLinkTraversal: true
+        });
+    });
+    describe('outbound traversal (linkedFrom)', () => {
+        test('returns the direct outbound neighbors at the default single hop', async () => {
+            const index = buildIndex([
+                { id: 'a', links: ['b', 'c'] },
+                { id: 'b', updated: 20 },
+                { id: 'c', updated: 10 }
+            ]);
+            const retriever = index_1.LinkTraversalRetriever.create(index).orThrow();
+            expect(await retriever.retrieve({ linkedFrom: 'a' })).toSucceedAndSatisfy((records) => {
+                // Recency-ordered: b (updated 20) before c (updated 10). 'a' (the seed) excluded.
+                expect(ids(records)).toEqual(['b', 'c']);
+            });
+        });
+        test('stops at the default single hop (does not reach 2-hop neighbors)', async () => {
+            const index = buildIndex([{ id: 'a', links: ['b'] }, { id: 'b', links: ['c'] }, { id: 'c' }]);
+            const retriever = index_1.LinkTraversalRetriever.create(index).orThrow();
+            expect(await retriever.retrieve({ linkedFrom: 'a' })).toSucceedAndSatisfy((records) => {
+                expect(ids(records)).toEqual(['b']);
+            });
+        });
+        test('follows multiple hops when hops is raised', async () => {
+            const index = buildIndex([{ id: 'a', links: ['b'] }, { id: 'b', links: ['c'] }, { id: 'c' }]);
+            const retriever = index_1.LinkTraversalRetriever.create(index).orThrow();
+            expect(await retriever.retrieve({ linkedFrom: 'a', hops: 2 })).toSucceedAndSatisfy((records) => {
+                expect(ids(records).sort()).toEqual(['b', 'c']);
+            });
+        });
+    });
+    describe('inbound traversal (linkedTo)', () => {
+        test('returns the records whose edges point at the seed (backlinks)', async () => {
+            const index = buildIndex([
+                { id: 'a', links: ['target'], updated: 30 },
+                { id: 'b', links: ['target'], updated: 10 },
+                { id: 'target' }
+            ]);
+            const retriever = index_1.LinkTraversalRetriever.create(index).orThrow();
+            expect(await retriever.retrieve({ linkedTo: 'target' })).toSucceedAndSatisfy((records) => {
+                expect(ids(records)).toEqual(['a', 'b']);
+            });
+        });
+    });
+    describe('cycle safety', () => {
+        test('terminates on a self-loop and excludes the seed', async () => {
+            const index = buildIndex([{ id: 'a', links: ['a'] }]);
+            const retriever = index_1.LinkTraversalRetriever.create(index).orThrow();
+            expect(await retriever.retrieve({ linkedFrom: 'a', hops: 5 })).toSucceedAndSatisfy((records) => {
+                expect(records).toHaveLength(0);
+            });
+        });
+        test('terminates on a multi-hop cycle without revisiting', async () => {
+            const index = buildIndex([
+                { id: 'a', links: ['b'] },
+                { id: 'b', links: ['c'] },
+                { id: 'c', links: ['a'] }
+            ]);
+            const retriever = index_1.LinkTraversalRetriever.create(index).orThrow();
+            expect(await retriever.retrieve({ linkedFrom: 'a', hops: 10 })).toSucceedAndSatisfy((records) => {
+                // a→b→c→a: reaches b and c, then the edge back to the seed is pruned.
+                expect(ids(records).sort()).toEqual(['b', 'c']);
+            });
+        });
+    });
+    test('traverses a cross-kind edge (experience derivedFrom a knowledge doc)', async () => {
+        const index = buildIndex([
+            { id: 'turn-5', scope: 'conversations/conv-1', kind: 'summarized-turn', links: ['doc-1'] },
+            { id: 'doc-1', scope: 'knowledge', kind: 'knowledge' }
+        ]);
+        const retriever = index_1.LinkTraversalRetriever.create(index).orThrow();
+        expect(await retriever.retrieve({ linkedFrom: 'turn-5' })).toSucceedAndSatisfy((records) => {
+            expect(ids(records)).toEqual(['doc-1']);
+            expect(records[0].envelope.kind).toBe('knowledge');
+        });
+    });
+    describe('post-filtering and bounds', () => {
+        test('applies the kind pre-filter to the reached records', async () => {
+            const index = buildIndex([
+                { id: 'a', links: ['b', 'c'] },
+                { id: 'b', kind: 'keep' },
+                { id: 'c', kind: 'drop' }
+            ]);
+            const retriever = index_1.LinkTraversalRetriever.create(index).orThrow();
+            expect(await retriever.retrieve({ linkedFrom: 'a', kind: 'keep' })).toSucceedAndSatisfy((records) => {
+                expect(ids(records)).toEqual(['b']);
+            });
+        });
+        test('applies the limit after ordering', async () => {
+            const index = buildIndex([
+                { id: 'a', links: ['b', 'c', 'd'] },
+                { id: 'b', updated: 30 },
+                { id: 'c', updated: 20 },
+                { id: 'd', updated: 10 }
+            ]);
+            const retriever = index_1.LinkTraversalRetriever.create(index).orThrow();
+            expect(await retriever.retrieve({ linkedFrom: 'a', limit: 2 })).toSucceedAndSatisfy((records) => {
+                expect(ids(records)).toEqual(['b', 'c']);
+            });
+        });
+        test('returns empty when the seed is not in the index', async () => {
+            const index = buildIndex([{ id: 'a', links: ['b'] }, { id: 'b' }]);
+            const retriever = index_1.LinkTraversalRetriever.create(index).orThrow();
+            expect(await retriever.retrieve({ linkedFrom: 'missing' })).toSucceedWith([]);
+        });
+        test('resolves every record sharing a reached id (cross-scope id reuse)', async () => {
+            const index = buildIndex([
+                { id: 'seed', scope: 'a', links: ['dup'] },
+                { id: 'dup', scope: 'a' },
+                { id: 'dup', scope: 'b' }
+            ]);
+            const retriever = index_1.LinkTraversalRetriever.create(index).orThrow();
+            expect(await retriever.retrieve({ linkedFrom: 'seed' })).toSucceedAndSatisfy((records) => {
+                expect(records).toHaveLength(2);
+                expect(ids(records)).toEqual(['dup', 'dup']);
+            });
+        });
+    });
+    describe('loud degradation', () => {
+        test('fails when no seed (linkedFrom / linkedTo) is supplied', async () => {
+            const index = buildIndex([{ id: 'a' }]);
+            const retriever = index_1.LinkTraversalRetriever.create(index).orThrow();
+            expect(await retriever.retrieve({ hops: 2 })).toFailWith(index_1.LINK_TRAVERSAL_NO_SEED_MESSAGE);
+        });
+    });
+});
+describe('LINK_TRAVERSAL_UNWIRED_MESSAGE constant', () => {
+    test('has the stable public message non-link retrievers use to degrade loudly', () => {
+        // The link-traversal retriever supports the axis, so it never emits this
+        // message; the constant is the shared one the non-link v1 retrievers raise
+        // (asserted here to keep the public string stable).
+        expect(index_1.LINK_TRAVERSAL_UNWIRED_MESSAGE).toMatch(/link traversal requires a backlink index/i);
+    });
+    test('a link query against the link-capable retriever still succeeds', async () => {
+        const index = buildIndex([{ id: 'a', links: ['b'] }, { id: 'b' }]);
+        const retriever = index_1.LinkTraversalRetriever.create(index).orThrow();
+        expect(await retriever.retrieve({ linkedFrom: 'a' })).toSucceed();
+    });
+});
+//# sourceMappingURL=linkTraversalRetriever.test.js.map