@fgv/ts-agent-memory 5.1.0-39 → 5.1.0-41
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/.rush/temp/{b82cf6bdece20481260e6bab946179eeec9d7b46.tar.log → cbbdbe09515171b4eba8f2592be2dace1e4e8142.tar.log} +14 -2
- package/.rush/temp/chunked-rush-logs/ts-agent-memory.build.chunks.jsonl +2 -2
- package/.rush/temp/operation/build/all.log +2 -2
- package/.rush/temp/operation/build/log-chunks.jsonl +2 -2
- package/.rush/temp/operation/build/state.json +1 -1
- package/dist/packlets/converters/envelopeConverter.js +17 -3
- package/dist/packlets/converters/envelopeConverter.js.map +1 -1
- package/dist/packlets/index/memoryIndex.js +58 -10
- package/dist/packlets/index/memoryIndex.js.map +1 -1
- package/dist/packlets/ingest/cycleGuard.js +13 -6
- package/dist/packlets/ingest/cycleGuard.js.map +1 -1
- package/dist/packlets/ingest/hostStages.js.map +1 -1
- package/dist/packlets/ingest/model.js.map +1 -1
- package/dist/packlets/ingest/orchestrator.js +94 -49
- package/dist/packlets/ingest/orchestrator.js.map +1 -1
- package/dist/packlets/retrieve/hybridRetriever.js +13 -2
- package/dist/packlets/retrieve/hybridRetriever.js.map +1 -1
- package/dist/packlets/retrieve/linkTraversalRetriever.js +46 -57
- package/dist/packlets/retrieve/linkTraversalRetriever.js.map +1 -1
- package/dist/packlets/retrieve/recencyRetriever.js +3 -3
- package/dist/packlets/retrieve/recencyRetriever.js.map +1 -1
- package/dist/packlets/retrieve/retriever.js +50 -7
- package/dist/packlets/retrieve/retriever.js.map +1 -1
- package/dist/packlets/retrieve/semanticRetriever.js +9 -3
- package/dist/packlets/retrieve/semanticRetriever.js.map +1 -1
- package/dist/packlets/retrieve/structuredFilterRetriever.js +3 -3
- package/dist/packlets/retrieve/structuredFilterRetriever.js.map +1 -1
- package/dist/packlets/retrieve/tagRetriever.js +3 -3
- package/dist/packlets/retrieve/tagRetriever.js.map +1 -1
- package/dist/packlets/retrieve/temporalRetrievers.js +3 -3
- package/dist/packlets/retrieve/temporalRetrievers.js.map +1 -1
- package/dist/packlets/store/fileTreeMemoryStore.js +72 -16
- package/dist/packlets/store/fileTreeMemoryStore.js.map +1 -1
- package/dist/packlets/tools/memoryTools.js +104 -21
- package/dist/packlets/tools/memoryTools.js.map +1 -1
- package/dist/packlets/types/envelope.js +13 -1
- package/dist/packlets/types/envelope.js.map +1 -1
- package/dist/packlets/vector/inMemoryCosineIndex.js +22 -17
- package/dist/packlets/vector/inMemoryCosineIndex.js.map +1 -1
- package/dist/packlets/vector/vectorIndex.js.map +1 -1
- package/dist/test/unit/converters/antagonistRoundTrip.test.js +3 -3
- package/dist/test/unit/converters/antagonistRoundTrip.test.js.map +1 -1
- package/dist/test/unit/converters/envelopeConverter.test.js +125 -8
- package/dist/test/unit/converters/envelopeConverter.test.js.map +1 -1
- package/dist/test/unit/index/memoryIndex.test.js +87 -25
- package/dist/test/unit/index/memoryIndex.test.js.map +1 -1
- package/dist/test/unit/ingest/antagonistCycleAndParity.test.js +20 -16
- package/dist/test/unit/ingest/antagonistCycleAndParity.test.js.map +1 -1
- package/dist/test/unit/ingest/cycleGuard.test.js +28 -1
- package/dist/test/unit/ingest/cycleGuard.test.js.map +1 -1
- package/dist/test/unit/ingest/orchestrator.test.js +187 -45
- package/dist/test/unit/ingest/orchestrator.test.js.map +1 -1
- package/dist/test/unit/retrieve/linkTraversalRetriever.test.js +106 -31
- package/dist/test/unit/retrieve/linkTraversalRetriever.test.js.map +1 -1
- package/dist/test/unit/retrieve/retrievers.test.js +299 -37
- package/dist/test/unit/retrieve/retrievers.test.js.map +1 -1
- package/dist/test/unit/store/embedOnWrite.test.js +69 -12
- package/dist/test/unit/store/embedOnWrite.test.js.map +1 -1
- package/dist/test/unit/store/listScoped.test.js +109 -0
- package/dist/test/unit/store/listScoped.test.js.map +1 -0
- package/dist/test/unit/store/rankAxis.test.js +254 -0
- package/dist/test/unit/store/rankAxis.test.js.map +1 -0
- package/dist/test/unit/tools/memoryTools.test.js +280 -11
- package/dist/test/unit/tools/memoryTools.test.js.map +1 -1
- package/dist/test/unit/types/writePolicy.test.js +9 -2
- package/dist/test/unit/types/writePolicy.test.js.map +1 -1
- package/dist/test/unit/vector/inMemoryCosineIndex.test.js +95 -35
- package/dist/test/unit/vector/inMemoryCosineIndex.test.js.map +1 -1
- package/dist/test/unit/vector/vectorIndex.test.js +24 -15
- package/dist/test/unit/vector/vectorIndex.test.js.map +1 -1
- package/dist/ts-agent-memory.d.ts +384 -97
- package/etc/ts-agent-memory.api.md +64 -22
- package/lib/packlets/converters/envelopeConverter.d.ts +8 -1
- package/lib/packlets/converters/envelopeConverter.d.ts.map +1 -1
- package/lib/packlets/converters/envelopeConverter.js +18 -4
- package/lib/packlets/converters/envelopeConverter.js.map +1 -1
- package/lib/packlets/index/memoryIndex.d.ts +42 -10
- package/lib/packlets/index/memoryIndex.d.ts.map +1 -1
- package/lib/packlets/index/memoryIndex.js +58 -10
- package/lib/packlets/index/memoryIndex.js.map +1 -1
- package/lib/packlets/ingest/cycleGuard.d.ts +5 -5
- package/lib/packlets/ingest/cycleGuard.d.ts.map +1 -1
- package/lib/packlets/ingest/cycleGuard.js +13 -6
- package/lib/packlets/ingest/cycleGuard.js.map +1 -1
- package/lib/packlets/ingest/hostStages.d.ts +3 -3
- package/lib/packlets/ingest/hostStages.d.ts.map +1 -1
- package/lib/packlets/ingest/hostStages.js.map +1 -1
- package/lib/packlets/ingest/model.d.ts +25 -14
- package/lib/packlets/ingest/model.d.ts.map +1 -1
- package/lib/packlets/ingest/model.js.map +1 -1
- package/lib/packlets/ingest/orchestrator.d.ts +18 -4
- package/lib/packlets/ingest/orchestrator.d.ts.map +1 -1
- package/lib/packlets/ingest/orchestrator.js +93 -48
- package/lib/packlets/ingest/orchestrator.js.map +1 -1
- package/lib/packlets/retrieve/hybridRetriever.d.ts.map +1 -1
- package/lib/packlets/retrieve/hybridRetriever.js +12 -1
- package/lib/packlets/retrieve/hybridRetriever.js.map +1 -1
- package/lib/packlets/retrieve/linkTraversalRetriever.d.ts +18 -23
- package/lib/packlets/retrieve/linkTraversalRetriever.d.ts.map +1 -1
- package/lib/packlets/retrieve/linkTraversalRetriever.js +45 -56
- package/lib/packlets/retrieve/linkTraversalRetriever.js.map +1 -1
- package/lib/packlets/retrieve/recencyRetriever.js +2 -2
- package/lib/packlets/retrieve/recencyRetriever.js.map +1 -1
- package/lib/packlets/retrieve/retriever.d.ts +70 -11
- package/lib/packlets/retrieve/retriever.d.ts.map +1 -1
- package/lib/packlets/retrieve/retriever.js +52 -7
- package/lib/packlets/retrieve/retriever.js.map +1 -1
- package/lib/packlets/retrieve/semanticRetriever.d.ts.map +1 -1
- package/lib/packlets/retrieve/semanticRetriever.js +9 -3
- package/lib/packlets/retrieve/semanticRetriever.js.map +1 -1
- package/lib/packlets/retrieve/structuredFilterRetriever.js +2 -2
- package/lib/packlets/retrieve/structuredFilterRetriever.js.map +1 -1
- package/lib/packlets/retrieve/tagRetriever.js +2 -2
- package/lib/packlets/retrieve/tagRetriever.js.map +1 -1
- package/lib/packlets/retrieve/temporalRetrievers.js +3 -3
- package/lib/packlets/retrieve/temporalRetrievers.js.map +1 -1
- package/lib/packlets/store/fileTreeMemoryStore.d.ts +57 -3
- package/lib/packlets/store/fileTreeMemoryStore.d.ts.map +1 -1
- package/lib/packlets/store/fileTreeMemoryStore.js +72 -16
- package/lib/packlets/store/fileTreeMemoryStore.js.map +1 -1
- package/lib/packlets/tools/memoryTools.d.ts +24 -0
- package/lib/packlets/tools/memoryTools.d.ts.map +1 -1
- package/lib/packlets/tools/memoryTools.js +104 -21
- package/lib/packlets/tools/memoryTools.js.map +1 -1
- package/lib/packlets/types/envelope.d.ts +61 -8
- package/lib/packlets/types/envelope.d.ts.map +1 -1
- package/lib/packlets/types/envelope.js +14 -0
- package/lib/packlets/types/envelope.js.map +1 -1
- package/lib/packlets/vector/inMemoryCosineIndex.d.ts +9 -5
- package/lib/packlets/vector/inMemoryCosineIndex.d.ts.map +1 -1
- package/lib/packlets/vector/inMemoryCosineIndex.js +22 -17
- package/lib/packlets/vector/inMemoryCosineIndex.js.map +1 -1
- package/lib/packlets/vector/vectorIndex.d.ts +46 -20
- package/lib/packlets/vector/vectorIndex.d.ts.map +1 -1
- package/lib/packlets/vector/vectorIndex.js.map +1 -1
- package/lib/test/unit/converters/antagonistRoundTrip.test.js +3 -3
- package/lib/test/unit/converters/antagonistRoundTrip.test.js.map +1 -1
- package/lib/test/unit/converters/envelopeConverter.test.js +124 -7
- package/lib/test/unit/converters/envelopeConverter.test.js.map +1 -1
- package/lib/test/unit/index/memoryIndex.test.js +86 -24
- package/lib/test/unit/index/memoryIndex.test.js.map +1 -1
- package/lib/test/unit/ingest/antagonistCycleAndParity.test.js +20 -16
- package/lib/test/unit/ingest/antagonistCycleAndParity.test.js.map +1 -1
- package/lib/test/unit/ingest/cycleGuard.test.js +28 -1
- package/lib/test/unit/ingest/cycleGuard.test.js.map +1 -1
- package/lib/test/unit/ingest/orchestrator.test.js +186 -44
- package/lib/test/unit/ingest/orchestrator.test.js.map +1 -1
- package/lib/test/unit/retrieve/linkTraversalRetriever.test.js +106 -31
- package/lib/test/unit/retrieve/linkTraversalRetriever.test.js.map +1 -1
- package/lib/test/unit/retrieve/retrievers.test.js +298 -36
- package/lib/test/unit/retrieve/retrievers.test.js.map +1 -1
- package/lib/test/unit/store/embedOnWrite.test.js +68 -11
- package/lib/test/unit/store/embedOnWrite.test.js.map +1 -1
- package/lib/test/unit/store/listScoped.test.d.ts +2 -0
- package/lib/test/unit/store/listScoped.test.d.ts.map +1 -0
- package/lib/test/unit/store/listScoped.test.js +111 -0
- package/lib/test/unit/store/listScoped.test.js.map +1 -0
- package/lib/test/unit/store/rankAxis.test.d.ts +2 -0
- package/lib/test/unit/store/rankAxis.test.d.ts.map +1 -0
- package/lib/test/unit/store/rankAxis.test.js +256 -0
- package/lib/test/unit/store/rankAxis.test.js.map +1 -0
- package/lib/test/unit/tools/memoryTools.test.js +280 -11
- package/lib/test/unit/tools/memoryTools.test.js.map +1 -1
- package/lib/test/unit/types/writePolicy.test.js +9 -2
- package/lib/test/unit/types/writePolicy.test.js.map +1 -1
- package/lib/test/unit/vector/inMemoryCosineIndex.test.js +95 -35
- package/lib/test/unit/vector/inMemoryCosineIndex.test.js.map +1 -1
- package/lib/test/unit/vector/vectorIndex.test.js +24 -15
- package/lib/test/unit/vector/vectorIndex.test.js.map +1 -1
- package/package.json +7 -7
- package/rush-logs/ts-agent-memory.build.cache.log +1 -1
- package/rush-logs/ts-agent-memory.build.log +2 -2
- package/src/packlets/converters/envelopeConverter.ts +27 -4
- package/src/packlets/index/memoryIndex.ts +86 -22
- package/src/packlets/ingest/cycleGuard.ts +22 -11
- package/src/packlets/ingest/hostStages.ts +3 -3
- package/src/packlets/ingest/model.ts +25 -14
- package/src/packlets/ingest/orchestrator.ts +143 -67
- package/src/packlets/retrieve/hybridRetriever.ts +14 -1
- package/src/packlets/retrieve/linkTraversalRetriever.ts +51 -62
- package/src/packlets/retrieve/recencyRetriever.ts +3 -3
- package/src/packlets/retrieve/retriever.ts +97 -13
- package/src/packlets/retrieve/semanticRetriever.ts +10 -5
- package/src/packlets/retrieve/structuredFilterRetriever.ts +3 -3
- package/src/packlets/retrieve/tagRetriever.ts +3 -3
- package/src/packlets/retrieve/temporalRetrievers.ts +3 -3
- package/src/packlets/store/fileTreeMemoryStore.ts +117 -12
- package/src/packlets/tools/memoryTools.ts +152 -25
- package/src/packlets/types/envelope.ts +66 -8
- package/src/packlets/vector/inMemoryCosineIndex.ts +45 -22
- package/src/packlets/vector/vectorIndex.ts +47 -20
- package/src/test/unit/converters/antagonistRoundTrip.test.ts +3 -3
- package/src/test/unit/converters/envelopeConverter.test.ts +168 -11
- package/src/test/unit/index/memoryIndex.test.ts +99 -14
- package/src/test/unit/ingest/antagonistCycleAndParity.test.ts +23 -18
- package/src/test/unit/ingest/cycleGuard.test.ts +44 -2
- package/src/test/unit/ingest/orchestrator.test.ts +234 -41
- package/src/test/unit/retrieve/linkTraversalRetriever.test.ts +134 -35
- package/src/test/unit/retrieve/retrievers.test.ts +381 -25
- package/src/test/unit/store/embedOnWrite.test.ts +83 -11
- package/src/test/unit/store/listScoped.test.ts +138 -0
- package/src/test/unit/store/rankAxis.test.ts +349 -0
- package/src/test/unit/tools/memoryTools.test.ts +362 -13
- package/src/test/unit/types/writePolicy.test.ts +11 -2
- package/src/test/unit/vector/inMemoryCosineIndex.test.ts +115 -39
- package/src/test/unit/vector/vectorIndex.test.ts +33 -17
- package/temp/build/lint/_eslint-5eVG3S6w.json +41 -33
- package/temp/build/typescript/ts_8nwakTlr.json +1 -1
- package/temp/ts-agent-memory.api.json +1080 -136
- package/temp/ts-agent-memory.api.md +64 -22
|
@@ -1 +1 @@
|
|
|
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"]}
|
|
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,6DAYsC;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,EAAE,KAAK,EAAE,WAAW,EAAE,EAAE,EAAE,WAAW,EAAE,EAAE,CAAC;IAC7E,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,gEAAgE,EAAE,GAAG,EAAE;QAC1E,MAAM,CACJ,gCAAmB,CAAC,OAAO,CAAC;YAC1B,MAAM,EAAE,aAAa;YACrB,WAAW,EAAE,EAAE,KAAK,EAAE,sBAAsB,EAAE,EAAE,EAAE,QAAQ,EAAE;SAC7D,CAAC,CACH,CAAC,mBAAmB,CAAC,CAAC,CAAC,EAAE,EAAE;YAC1B,MAAM,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,OAAO,CAAC,EAAE,KAAK,EAAE,sBAAsB,EAAE,EAAE,EAAE,QAAQ,EAAE,CAAC,CAAC;QACjF,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,2DAA2D,EAAE,GAAG,EAAE;QACrE,MAAM,CAAC,gCAAmB,CAAC,OAAO,CAAC,EAAE,MAAM,EAAE,aAAa,EAAE,WAAW,EAAE,QAAQ,EAAE,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC;IACjG,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,qCAAqC,EAAE,GAAG,EAAE;QAC/C,MAAM,CAAC,gCAAmB,CAAC,OAAO,CAAC,EAAE,MAAM,EAAE,aAAa,EAAE,WAAW,EAAE,EAAE,EAAE,EAAE,QAAQ,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,CACtG,QAAQ,CACT,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,kCAAkC,EAAE,GAAG,EAAE;QAC5C,MAAM,CACJ,gCAAmB,CAAC,OAAO,CAAC,EAAE,MAAM,EAAE,aAAa,EAAE,WAAW,EAAE,EAAE,KAAK,EAAE,sBAAsB,EAAE,EAAE,CAAC,CACvG,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;IACtB,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,qBAAqB,EAAE,GAAG,EAAE;IACnC,IAAI,CAAC,oCAAoC,EAAE,GAAG,EAAE;QAC9C,MAAM,CAAC,gCAAmB,CAAC,OAAO,CAAC,EAAE,KAAK,EAAE,sBAAsB,EAAE,EAAE,EAAE,QAAQ,EAAE,CAAC,CAAC,CAAC,mBAAmB,CACtG,CAAC,CAAC,EAAE,EAAE;YACJ,MAAM,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE,KAAK,EAAE,sBAAsB,EAAE,EAAE,EAAE,QAAQ,EAAE,CAAC,CAAC;QACrE,CAAC,CACF,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,gCAAgC,EAAE,GAAG,EAAE;QAC1C,MAAM,CAAC,gCAAmB,CAAC,OAAO,CAAC,EAAE,EAAE,EAAE,QAAQ,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC;IAC7E,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,6BAA6B,EAAE,GAAG,EAAE;QACvC,MAAM,CAAC,gCAAmB,CAAC,OAAO,CAAC,EAAE,KAAK,EAAE,sBAAsB,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;IAC3F,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,sDAAsD,EAAE,GAAG,EAAE;QAChE,MAAM,CAAC,gCAAmB,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC;IACzD,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,EAAE,KAAK,EAAE,sBAAsB,EAAE,EAAE,EAAE,QAAQ,EAAE;YACvD,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,OAAO,CAAC,EAAE,KAAK,EAAE,sBAAsB,EAAE,EAAE,EAAE,QAAQ,EAAE,CAAC,CAAC;YAC7E,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,CACJ,0BAAa,CAAC,OAAO,CAAC,EAAE,IAAI,EAAE,SAAS,EAAE,MAAM,EAAE,EAAE,KAAK,EAAE,WAAW,EAAE,EAAE,EAAE,WAAW,EAAE,EAAE,CAAC,CAC5F,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,OAAO,CAAC,EAAE,KAAK,EAAE,WAAW,EAAE,EAAE,EAAE,WAAW,EAAE,CAAC,CAAC;YACrE,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,CACJ,0BAAa,CAAC,OAAO,CAAC,EAAE,IAAI,EAAE,SAAS,EAAE,MAAM,EAAE,EAAE,KAAK,EAAE,WAAW,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,UAAU,EAAE,IAAI,EAAE,CAAC,CACtG,CAAC,mBAAmB,CAAC,CAAC,IAAI,EAAE,EAAE;YAC7B,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,QAAQ,EAAE,CAAC;QACrC,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,oDAAoD,EAAE,GAAG,EAAE;QAC9D,MAAM,CACJ,0BAAa,CAAC,OAAO,CAAC,EAAE,IAAI,EAAE,SAAS,EAAE,MAAM,EAAE,EAAE,KAAK,EAAE,WAAW,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,UAAU,EAAE,MAAM,EAAE,CAAC,CACxG,CAAC,MAAM,EAAE,CAAC;IACb,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;IAEH,IAAI,CAAC,oEAAoE,EAAE,GAAG,EAAE;QAC9E,MAAM,CAAC,0BAAa,CAAC,OAAO,CAAC,EAAE,IAAI,EAAE,SAAS,EAAE,MAAM,EAAE,WAAW,EAAE,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC;IACnF,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,iCAAiC,EAAE,GAAG,EAAE;QAC3C,MAAM,CAAC,8BAAiB,CAAC,OAAO,CAAC,mBAAmB,CAAC,CAAC,CAAC,mBAAmB,CAAC,CAAC,QAAQ,EAAE,EAAE;YACtF,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,aAAa,EAAE,CAAC;QACxC,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,wCAAwC,EAAE,GAAG,EAAE;QAClD,MAAM,CAAC,8BAAiB,CAAC,OAAO,iCAAM,mBAAmB,KAAE,IAAI,EAAE,EAAE,IAAG,CAAC,CAAC,mBAAmB,CACzF,CAAC,QAAQ,EAAE,EAAE;YACX,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACjC,CAAC,CACF,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,sDAAsD,EAAE,GAAG,EAAE;QAChE,MAAM,QAAQ,GAAG,kCAAqB,CAAC,MAAM,EAAE,CAAC,OAAO,EAAE,CAAC;QAC1D,QAAQ,CAAC,QAAQ,CAAC,WAAmB,EAAE,qBAAU,CAAC,MAAM,CAAC,CAAC;QAC1D,MAAM,QAAQ,GAAG,8BAAiB,CAAC,OAAO,iCAAM,mBAAmB,KAAE,IAAI,EAAE,CAAC,IAAG,CAAC,OAAO,EAAE,CAAC;QAC1F,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,mBAAmB,CAAC,CAAC,MAAM,EAAE,EAAE;YACrE,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACvC,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,iCAAiC,EAAE,GAAG,EAAE;QAC3C,MAAM,CAAC,8BAAiB,CAAC,OAAO,iCAAM,mBAAmB,KAAE,IAAI,EAAE,MAAM,IAAG,CAAC,CAAC,MAAM,EAAE,CAAC;IACvF,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,0EAA0E,EAAE,GAAG,EAAE;QACpF,MAAM,QAAQ,GAAG,8BAAiB;aAC/B,OAAO,iCACH,mBAAmB,KACtB,KAAK,EAAE,CAAC,EAAE,IAAI,EAAE,SAAS,EAAE,MAAM,EAAE,EAAE,KAAK,EAAE,sBAAsB,EAAE,EAAE,EAAE,QAAQ,EAAE,EAAE,CAAC,IACrF;aACD,OAAO,EAAE,CAAC;QACb,MAAM,IAAI,GAAG,IAAA,gCAAmB,EAAC,QAAQ,EAAE,MAAM,CAAC,CAAC,OAAO,EAAE,CAAC;QAC7D,4DAA4D;QAC5D,MAAM,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,8BAA8B,CAAC,CAAC;QACrD,MAAM,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,YAAY,CAAC,CAAC;QACnC,MAAM,CAAC,IAAA,4BAAe,EAAC,IAAI,EAAE,QAAQ,CAAC,CAAC,CAAC,mBAAmB,CAAC,CAAC,MAAM,EAAE,EAAE;YACrE,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,OAAO,CAAC;gBACpC,EAAE,IAAI,EAAE,SAAS,EAAE,MAAM,EAAE,EAAE,KAAK,EAAE,sBAAsB,EAAE,EAAE,EAAE,QAAQ,EAAE,EAAE;aAC7E,CAAC,CAAC;YACH,oEAAoE;YACpE,MAAM,CAAC,IAAA,gCAAmB,EAAC,MAAM,CAAC,QAAQ,EAAE,MAAM,CAAC,IAAc,CAAC,CAAC,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC;QAC1F,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,qFAAqF,EAAE,GAAG,EAAE;QAC/F,MAAM,QAAQ,GAAG,8BAAiB;aAC/B,OAAO,iCACH,mBAAmB,KACtB,UAAU,EAAE;gBACV,MAAM,EAAE,aAAa;gBACrB,WAAW,EAAE,EAAE,KAAK,EAAE,sBAAsB,EAAE,EAAE,EAAE,QAAQ,EAAE;aAC7D,IACD;aACD,OAAO,EAAE,CAAC;QACb,MAAM,IAAI,GAAG,IAAA,gCAAmB,EAAC,QAAQ,EAAE,MAAM,CAAC,CAAC,OAAO,EAAE,CAAC;QAC7D,oEAAoE;QACpE,MAAM,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,8BAA8B,CAAC,CAAC;QACrD,MAAM,CAAC,IAAA,4BAAe,EAAC,IAAI,EAAE,QAAQ,CAAC,CAAC,CAAC,mBAAmB,CAAC,CAAC,MAAM,EAAE,EAAE;YACrE,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,UAAU,CAAC,WAAW,CAAC,CAAC,OAAO,CAAC;gBACrD,KAAK,EAAE,sBAAsB;gBAC7B,EAAE,EAAE,QAAQ;aACb,CAAC,CAAC;YACH,MAAM,CAAC,IAAA,gCAAmB,EAAC,MAAM,CAAC,QAAQ,EAAE,MAAM,CAAC,IAAc,CAAC,CAAC,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC;QAC1F,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,6FAA6F,EAAE,GAAG,EAAE;QACvG,0EAA0E;QAC1E,0EAA0E;QAC1E,MAAM,QAAQ,GAAG,CAAC,KAAa,EAAU,EAAE;YACzC,MAAM,QAAQ,GAAG,8BAAiB;iBAC/B,OAAO,iCACH,mBAAmB,KACtB,UAAU,EAAE,EAAE,MAAM,EAAE,aAAa,EAAE,WAAW,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,QAAQ,EAAE,EAAE,IAC3E;iBACD,OAAO,EAAE,CAAC;YACb,OAAO,IAAA,gCAAmB,EAAC,QAAQ,EAAE,MAAM,CAAC,CAAC,OAAO,EAAE,CAAC;QACzD,CAAC,CAAC;QACF,MAAM,KAAK,GAAG,QAAQ,CAAC,sBAAsB,CAAC,CAAC;QAC/C,MAAM,KAAK,GAAG,QAAQ,CAAC,sBAAsB,CAAC,CAAC;QAC/C,MAAM,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC9B,MAAM,CAAC,IAAA,4BAAe,EAAC,KAAK,EAAE,QAAQ,CAAC,CAAC,CAAC,mBAAmB,CAAC,CAAC,MAAM,EAAE,EAAE;YACtE,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,UAAU,CAAC,WAAW,CAAC,CAAC,OAAO,CAAC;gBACrD,KAAK,EAAE,sBAAsB;gBAC7B,EAAE,EAAE,QAAQ;aACb,CAAC,CAAC;QACL,CAAC,CAAC,CAAC;QACH,MAAM,CAAC,IAAA,4BAAe,EAAC,KAAK,EAAE,QAAQ,CAAC,CAAC,CAAC,mBAAmB,CAAC,CAAC,MAAM,EAAE,EAAE;YACtE,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,UAAU,CAAC,WAAW,CAAC,CAAC,OAAO,CAAC;gBACrD,KAAK,EAAE,sBAAsB;gBAC7B,EAAE,EAAE,QAAQ;aACb,CAAC,CAAC;QACL,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 edgeTargetConverter,\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: { scope: 'knowledge', id: '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('validates a scope-qualified derivedFrom (nested { scope, id })', () => {\n expect(\n provenanceConverter.convert({\n source: 'host-ingest',\n derivedFrom: { scope: 'conversations/conv-a', id: 'turn-3' }\n })\n ).toSucceedAndSatisfy((p) => {\n expect(p.derivedFrom).toEqual({ scope: 'conversations/conv-a', id: 'turn-3' });\n });\n });\n\n test('rejects a bare-string derivedFrom (the pre-scoped format)', () => {\n expect(provenanceConverter.convert({ source: 'host-ingest', derivedFrom: 'turn-3' })).toFail();\n });\n\n test('rejects a derivedFrom missing scope', () => {\n expect(provenanceConverter.convert({ source: 'host-ingest', derivedFrom: { id: 'turn-3' } })).toFailWith(\n /scope/i\n );\n });\n\n test('rejects a derivedFrom missing id', () => {\n expect(\n provenanceConverter.convert({ source: 'host-ingest', derivedFrom: { scope: 'conversations/conv-a' } })\n ).toFailWith(/id/i);\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('edgeTargetConverter', () => {\n test('validates a scope-qualified target', () => {\n expect(edgeTargetConverter.convert({ scope: 'conversations/conv-a', id: 'turn-3' })).toSucceedAndSatisfy(\n (t) => {\n expect(t).toEqual({ scope: 'conversations/conv-a', id: 'turn-3' });\n }\n );\n });\n\n test('rejects a target missing scope', () => {\n expect(edgeTargetConverter.convert({ id: 'turn-3' })).toFailWith(/scope/i);\n });\n\n test('rejects a target missing id', () => {\n expect(edgeTargetConverter.convert({ scope: 'conversations/conv-a' })).toFailWith(/id/i);\n });\n\n test('rejects a bare-string target (the pre-scoped format)', () => {\n expect(edgeTargetConverter.convert('turn-3')).toFail();\n });\n});\n\ndescribe('edgeConverter', () => {\n test('validates a full attributed edge', () => {\n expect(\n edgeConverter.convert({\n type: 'mtm-ref',\n target: { scope: 'conversations/conv-a', id: '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).toEqual({ scope: 'conversations/conv-a', id: '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(\n edgeConverter.convert({ type: 'related', target: { scope: 'knowledge', id: 'ownership' } })\n ).toSucceedAndSatisfy((edge) => {\n expect(edge.type).toBe('related');\n expect(edge.target).toEqual({ scope: 'knowledge', id: 'ownership' });\n expect(edge.confidence).toBeUndefined();\n });\n });\n\n test('accepts a null invalid_at (still valid)', () => {\n expect(\n edgeConverter.convert({ type: 'related', target: { scope: 'knowledge', id: 'x' }, invalid_at: null })\n ).toSucceedAndSatisfy((edge) => {\n expect(edge.invalid_at).toBeNull();\n });\n });\n\n test('fails when invalid_at is neither a number nor null', () => {\n expect(\n edgeConverter.convert({ type: 'related', target: { scope: 'knowledge', id: 'x' }, invalid_at: 'soon' })\n ).toFail();\n });\n\n test('fails when target is missing', () => {\n expect(edgeConverter.convert({ type: 'related' })).toFail();\n });\n\n test('fails when target is a bare string (rejects the pre-scoped format)', () => {\n expect(edgeConverter.convert({ type: 'related', target: 'ownership' })).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('rank is absent when not present', () => {\n expect(envelopeConverter.convert(validEnvelopeObject)).toSucceedAndSatisfy((envelope) => {\n expect(envelope.rank).toBeUndefined();\n });\n });\n\n test('validates and preserves a numeric rank', () => {\n expect(envelopeConverter.convert({ ...validEnvelopeObject, rank: 42 })).toSucceedAndSatisfy(\n (envelope) => {\n expect(envelope.rank).toBe(42);\n }\n );\n });\n\n test('serialize/parse round-trips rank through frontmatter', () => {\n const registry = BodyConverterRegistry.create().orThrow();\n registry.register('knowledge' as Kind, Converters.string);\n const envelope = envelopeConverter.convert({ ...validEnvelopeObject, rank: 7 }).orThrow();\n const file = serializeMemoryFile(envelope, 'body').orThrow();\n expect(parseMemoryFile(file, registry)).toSucceedAndSatisfy((record) => {\n expect(record.envelope.rank).toBe(7);\n });\n });\n\n test('fails when rank is not a number', () => {\n expect(envelopeConverter.convert({ ...validEnvelopeObject, rank: 'high' })).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('round-trips a scope-qualified edge target through the frontmatter intact', () => {\n const envelope = envelopeConverter\n .convert({\n ...validEnvelopeObject,\n links: [{ type: 'mtm-ref', target: { scope: 'conversations/conv-a', id: 'turn-3' } }]\n })\n .orThrow();\n const file = serializeMemoryFile(envelope, 'body').orThrow();\n // On-wire the target is a nested object, NOT a bare scalar.\n expect(file).toMatch(/scope: conversations\\/conv-a/);\n expect(file).toMatch(/id: turn-3/);\n expect(parseMemoryFile(file, registry)).toSucceedAndSatisfy((record) => {\n expect(record.envelope.links).toEqual([\n { type: 'mtm-ref', target: { scope: 'conversations/conv-a', id: 'turn-3' } }\n ]);\n // Serializing the reparsed record reproduces byte-identical output.\n expect(serializeMemoryFile(record.envelope, record.body as string)).toSucceedWith(file);\n });\n });\n\n test('round-trips a scope-qualified provenance.derivedFrom through the frontmatter intact', () => {\n const envelope = envelopeConverter\n .convert({\n ...validEnvelopeObject,\n provenance: {\n source: 'host-ingest',\n derivedFrom: { scope: 'conversations/conv-a', id: 'turn-3' }\n }\n })\n .orThrow();\n const file = serializeMemoryFile(envelope, 'body').orThrow();\n // On-wire the back-reference is a nested object, NOT a bare scalar.\n expect(file).toMatch(/scope: conversations\\/conv-a/);\n expect(parseMemoryFile(file, registry)).toSucceedAndSatisfy((record) => {\n expect(record.envelope.provenance.derivedFrom).toEqual({\n scope: 'conversations/conv-a',\n id: 'turn-3'\n });\n expect(serializeMemoryFile(record.envelope, record.body as string)).toSucceedWith(file);\n });\n });\n\n test('two records whose derivedFrom share a stem across scopes round-trip as distinct scoped refs', () => {\n // Same idStem ('turn-3'), different scopes — exactly the ambiguity a bare\n // MemoryId could not disambiguate. Each must round-trip to ITS OWN scope.\n const makeFile = (scope: string): string => {\n const envelope = envelopeConverter\n .convert({\n ...validEnvelopeObject,\n provenance: { source: 'host-ingest', derivedFrom: { scope, id: 'turn-3' } }\n })\n .orThrow();\n return serializeMemoryFile(envelope, 'body').orThrow();\n };\n const fileA = makeFile('conversations/conv-a');\n const fileB = makeFile('conversations/conv-b');\n expect(fileA).not.toBe(fileB);\n expect(parseMemoryFile(fileA, registry)).toSucceedAndSatisfy((record) => {\n expect(record.envelope.provenance.derivedFrom).toEqual({\n scope: 'conversations/conv-a',\n id: 'turn-3'\n });\n });\n expect(parseMemoryFile(fileB, registry)).toSucceedAndSatisfy((record) => {\n expect(record.envelope.provenance.derivedFrom).toEqual({\n scope: 'conversations/conv-b',\n id: 'turn-3'\n });\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"]}
|
|
@@ -6,22 +6,28 @@
|
|
|
6
6
|
Object.defineProperty(exports, "__esModule", { value: true });
|
|
7
7
|
require("@fgv/ts-utils-jest");
|
|
8
8
|
const index_1 = require("../../../index");
|
|
9
|
+
/**
|
|
10
|
+
* The scope every link target in this fixture lives under. Links are authored as
|
|
11
|
+
* bare id strings and resolved to `{ scope: LINK_TARGET_SCOPE, id }`, so the
|
|
12
|
+
* cross-scope source tests can share one target while their sources differ.
|
|
13
|
+
*/
|
|
14
|
+
const LINK_TARGET_SCOPE = 'knowledge';
|
|
15
|
+
/** A scope-qualified backlink-target query for the fixed link-target scope. */
|
|
16
|
+
function bt(id) {
|
|
17
|
+
return { scope: LINK_TARGET_SCOPE, id: id };
|
|
18
|
+
}
|
|
19
|
+
/** Extract the bare ids from a set of scope-qualified targets (backlink results). */
|
|
20
|
+
function targetIds(targets) {
|
|
21
|
+
return targets.map((t) => t.id);
|
|
22
|
+
}
|
|
9
23
|
function makeEntry(spec) {
|
|
10
24
|
var _a, _b, _c, _d, _e, _f;
|
|
11
25
|
const record = {
|
|
12
26
|
envelope: index_1.envelopeConverter
|
|
13
|
-
.convert({
|
|
14
|
-
|
|
15
|
-
|
|
16
|
-
|
|
17
|
-
tags: (_b = spec.tags) !== null && _b !== void 0 ? _b : [],
|
|
18
|
-
links: ((_c = spec.links) !== null && _c !== void 0 ? _c : []).map((target) => ({ type: 'rel', target })),
|
|
19
|
-
created: 0,
|
|
20
|
-
updated: (_d = spec.updated) !== null && _d !== void 0 ? _d : 0,
|
|
21
|
-
seq: (_e = spec.seq) !== null && _e !== void 0 ? _e : 0,
|
|
22
|
-
contentHash: 'h',
|
|
23
|
-
provenance: { source: 'agent' }
|
|
24
|
-
})
|
|
27
|
+
.convert(Object.assign(Object.assign({ 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) => ({
|
|
28
|
+
type: 'rel',
|
|
29
|
+
target: { scope: LINK_TARGET_SCOPE, id: target }
|
|
30
|
+
})), created: 0, updated: (_d = spec.updated) !== null && _d !== void 0 ? _d : 0, seq: (_e = spec.seq) !== null && _e !== void 0 ? _e : 0, contentHash: 'h' }, (spec.rank !== undefined ? { rank: spec.rank } : {})), { provenance: { source: 'agent' } }))
|
|
25
31
|
.orThrow(),
|
|
26
32
|
body: `body-${spec.id}`
|
|
27
33
|
};
|
|
@@ -41,7 +47,7 @@ describe('MemoryIndex', () => {
|
|
|
41
47
|
expect(index.byKind('knowledge')).toHaveLength(0);
|
|
42
48
|
expect(index.byTag('any')).toHaveLength(0);
|
|
43
49
|
expect(index.byRecency()).toHaveLength(0);
|
|
44
|
-
expect(index.backlinks('none')).toHaveLength(0);
|
|
50
|
+
expect(index.backlinks(bt('none'))).toHaveLength(0);
|
|
45
51
|
});
|
|
46
52
|
});
|
|
47
53
|
describe('rebuild', () => {
|
|
@@ -55,7 +61,7 @@ describe('MemoryIndex', () => {
|
|
|
55
61
|
expect([...ids(index.byKind('knowledge'))].sort()).toEqual(['a', 'b']);
|
|
56
62
|
expect([...ids(index.byTag('x'))].sort()).toEqual(['a', 'b']);
|
|
57
63
|
expect(ids(index.byTag('y'))).toEqual(['b']);
|
|
58
|
-
expect(index.backlinks('b')).toEqual(['a']);
|
|
64
|
+
expect(targetIds(index.backlinks(bt('b')))).toEqual(['a']);
|
|
59
65
|
});
|
|
60
66
|
test('clears prior state', () => {
|
|
61
67
|
index.rebuild([makeEntry({ id: 'a', tags: ['x'] })]).orThrow();
|
|
@@ -69,7 +75,7 @@ describe('MemoryIndex', () => {
|
|
|
69
75
|
const entry = makeEntry({ id: 'a', tags: ['x'], links: ['b'] });
|
|
70
76
|
expect(index.patch('put', entry)).toSucceedWith(entry);
|
|
71
77
|
expect(ids(index.byKind('knowledge'))).toEqual(['a']);
|
|
72
|
-
expect(index.backlinks('b')).toEqual(['a']);
|
|
78
|
+
expect(targetIds(index.backlinks(bt('b')))).toEqual(['a']);
|
|
73
79
|
});
|
|
74
80
|
test('put on an existing key replaces stale associations', () => {
|
|
75
81
|
index.patch('put', makeEntry({ id: 'a', kind: 'knowledge', tags: ['old'], links: ['b'] })).orThrow();
|
|
@@ -79,8 +85,8 @@ describe('MemoryIndex', () => {
|
|
|
79
85
|
expect(ids(index.byTag('new'))).toEqual(['a']);
|
|
80
86
|
expect(index.byKind('knowledge')).toHaveLength(0);
|
|
81
87
|
expect(ids(index.byKind('note'))).toEqual(['a']);
|
|
82
|
-
expect(index.backlinks('b')).toHaveLength(0);
|
|
83
|
-
expect(index.backlinks('c')).toEqual(['a']);
|
|
88
|
+
expect(index.backlinks(bt('b'))).toHaveLength(0);
|
|
89
|
+
expect(targetIds(index.backlinks(bt('c')))).toEqual(['a']);
|
|
84
90
|
});
|
|
85
91
|
test('delete removes the entry and its associations', () => {
|
|
86
92
|
const entry = makeEntry({ id: 'a', tags: ['x'], links: ['b'] });
|
|
@@ -88,7 +94,7 @@ describe('MemoryIndex', () => {
|
|
|
88
94
|
expect(index.patch('delete', entry)).toSucceedWith(entry);
|
|
89
95
|
expect(index.entries()).toHaveLength(0);
|
|
90
96
|
expect(index.byTag('x')).toHaveLength(0);
|
|
91
|
-
expect(index.backlinks('b')).toHaveLength(0);
|
|
97
|
+
expect(index.backlinks(bt('b'))).toHaveLength(0);
|
|
92
98
|
});
|
|
93
99
|
test('delete of an absent key is a no-op that still succeeds', () => {
|
|
94
100
|
const entry = makeEntry({ id: 'ghost' });
|
|
@@ -114,18 +120,74 @@ describe('MemoryIndex', () => {
|
|
|
114
120
|
expect(ids(index.byRecency())).toEqual(['newest', 'tie-hi', 'tie-lo', 'old']);
|
|
115
121
|
});
|
|
116
122
|
});
|
|
123
|
+
describe('byRank', () => {
|
|
124
|
+
test('orders by rank descending, absent-rank records last, recency tiebreak', () => {
|
|
125
|
+
index
|
|
126
|
+
.rebuild([
|
|
127
|
+
makeEntry({ id: 'mid', rank: 5, updated: 100, seq: 1 }),
|
|
128
|
+
makeEntry({ id: 'top', rank: 9, updated: 100, seq: 2 }),
|
|
129
|
+
makeEntry({ id: 'tie-lo', rank: 3, updated: 200, seq: 4 }),
|
|
130
|
+
makeEntry({ id: 'tie-hi', rank: 3, updated: 200, seq: 9 }),
|
|
131
|
+
makeEntry({ id: 'unranked-old', updated: 100, seq: 5 }),
|
|
132
|
+
makeEntry({ id: 'unranked-new', updated: 400, seq: 6 })
|
|
133
|
+
])
|
|
134
|
+
.orThrow();
|
|
135
|
+
// ranked (desc): top(9), mid(5), tie-hi(3,seq9), tie-lo(3,seq4);
|
|
136
|
+
// then unranked by recency: unranked-new(updated400), unranked-old(updated100).
|
|
137
|
+
expect(ids(index.byRank())).toEqual(['top', 'mid', 'tie-hi', 'tie-lo', 'unranked-new', 'unranked-old']);
|
|
138
|
+
});
|
|
139
|
+
test('is empty on an empty index', () => {
|
|
140
|
+
expect(index.byRank()).toHaveLength(0);
|
|
141
|
+
});
|
|
142
|
+
test('sorts a ranked record ahead of an earlier-listed absent-rank record', () => {
|
|
143
|
+
// Input lists the absent-rank record first so the sort compares (ranked, absent),
|
|
144
|
+
// exercising the ranked-before-absent direction of the comparator.
|
|
145
|
+
index
|
|
146
|
+
.rebuild([
|
|
147
|
+
makeEntry({ id: 'unranked', updated: 100, seq: 1 }),
|
|
148
|
+
makeEntry({ id: 'ranked', rank: 5, updated: 100, seq: 2 })
|
|
149
|
+
])
|
|
150
|
+
.orThrow();
|
|
151
|
+
expect(ids(index.byRank())).toEqual(['ranked', 'unranked']);
|
|
152
|
+
});
|
|
153
|
+
test('orders two absent-rank records by recency alone', () => {
|
|
154
|
+
index
|
|
155
|
+
.rebuild([makeEntry({ id: 'a', updated: 100, seq: 1 }), makeEntry({ id: 'b', updated: 300, seq: 2 })])
|
|
156
|
+
.orThrow();
|
|
157
|
+
expect(ids(index.byRank())).toEqual(['b', 'a']);
|
|
158
|
+
});
|
|
159
|
+
test("index byRank agrees pairwise with the retrieve packlet's rankCompare", () => {
|
|
160
|
+
// Guard against the two hand-duplicated comparators (index `_compareByRank`
|
|
161
|
+
// and retrieve `rankCompare`) drifting: a future tie-break edit to one that
|
|
162
|
+
// diverges from the other is caught here on a shared mixed fixture.
|
|
163
|
+
const fixture = [
|
|
164
|
+
makeEntry({ id: 'r-top', rank: 9, updated: 100, seq: 1 }),
|
|
165
|
+
makeEntry({ id: 'r-mid', rank: 5, updated: 400, seq: 2 }),
|
|
166
|
+
makeEntry({ id: 'r-tie-a', rank: 3, updated: 200, seq: 3 }),
|
|
167
|
+
makeEntry({ id: 'r-tie-b', rank: 3, updated: 200, seq: 8 }),
|
|
168
|
+
makeEntry({ id: 'absent-old', updated: 100, seq: 4 }),
|
|
169
|
+
makeEntry({ id: 'absent-new', updated: 500, seq: 5 })
|
|
170
|
+
];
|
|
171
|
+
index.rebuild(fixture).orThrow();
|
|
172
|
+
const viaIndex = ids(index.byRank());
|
|
173
|
+
const viaRankCompare = ids(fixture.map((e) => e.record).sort(index_1.rankCompare));
|
|
174
|
+
expect(viaIndex).toEqual(viaRankCompare);
|
|
175
|
+
// And the shared expected ordering is what both must produce.
|
|
176
|
+
expect(viaIndex).toEqual(['r-top', 'r-mid', 'r-tie-b', 'r-tie-a', 'absent-new', 'absent-old']);
|
|
177
|
+
});
|
|
178
|
+
});
|
|
117
179
|
describe('backlinks', () => {
|
|
118
180
|
test('aggregates multiple sources pointing at one target', () => {
|
|
119
181
|
index
|
|
120
182
|
.rebuild([makeEntry({ id: 'a', links: ['target'] }), makeEntry({ id: 'b', links: ['target'] })])
|
|
121
183
|
.orThrow();
|
|
122
|
-
expect(
|
|
184
|
+
expect(targetIds(index.backlinks(bt('target'))).sort()).toEqual(['a', 'b']);
|
|
123
185
|
});
|
|
124
186
|
test('drops the target set once the last source is removed', () => {
|
|
125
187
|
const a = makeEntry({ id: 'a', links: ['target'] });
|
|
126
188
|
index.patch('put', a).orThrow();
|
|
127
189
|
index.patch('delete', a).orThrow();
|
|
128
|
-
expect(index.backlinks('target')).toHaveLength(0);
|
|
190
|
+
expect(index.backlinks(bt('target'))).toHaveLength(0);
|
|
129
191
|
});
|
|
130
192
|
test('tracks same-id sources across scopes independently', () => {
|
|
131
193
|
// Two distinct records that share the id 'a' under different scopes, both
|
|
@@ -134,9 +196,9 @@ describe('MemoryIndex', () => {
|
|
|
134
196
|
const a2 = makeEntry({ id: 'a', scope: 'conversations/c2', links: ['target'] });
|
|
135
197
|
index.patch('put', a1).orThrow();
|
|
136
198
|
index.patch('put', a2).orThrow();
|
|
137
|
-
expect(index.backlinks('target')).toEqual(['a', 'a']);
|
|
199
|
+
expect(targetIds(index.backlinks(bt('target')))).toEqual(['a', 'a']);
|
|
138
200
|
index.patch('delete', a1).orThrow();
|
|
139
|
-
expect(index.backlinks('target')).toEqual(['a']);
|
|
201
|
+
expect(targetIds(index.backlinks(bt('target')))).toEqual(['a']);
|
|
140
202
|
});
|
|
141
203
|
});
|
|
142
204
|
describe('duplicate associations', () => {
|
|
@@ -144,10 +206,10 @@ describe('MemoryIndex', () => {
|
|
|
144
206
|
const entry = makeEntry({ id: 'a', tags: ['dup', 'dup'], links: ['t', 't'] });
|
|
145
207
|
index.patch('put', entry).orThrow();
|
|
146
208
|
expect(ids(index.byTag('dup'))).toEqual(['a']);
|
|
147
|
-
expect(index.backlinks('t')).toEqual(['a']);
|
|
209
|
+
expect(targetIds(index.backlinks(bt('t')))).toEqual(['a']);
|
|
148
210
|
index.patch('delete', entry).orThrow();
|
|
149
211
|
expect(index.byTag('dup')).toHaveLength(0);
|
|
150
|
-
expect(index.backlinks('t')).toHaveLength(0);
|
|
212
|
+
expect(index.backlinks(bt('t'))).toHaveLength(0);
|
|
151
213
|
});
|
|
152
214
|
});
|
|
153
215
|
});
|
|
@@ -1 +1 @@
|
|
|
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"]}
|
|
1
|
+
{"version":3,"file":"memoryIndex.test.js","sourceRoot":"","sources":["../../../../src/test/unit/index/memoryIndex.test.ts"],"names":[],"mappings":";AAAA;;;GAGG;;AAEH,8BAA4B;AAC5B,0CAWwB;AAExB;;;;GAIG;AACH,MAAM,iBAAiB,GAAW,WAAW,CAAC;AAE9C,+EAA+E;AAC/E,SAAS,EAAE,CAAC,EAAU;IACpB,OAAO,EAAE,KAAK,EAAE,iBAAmC,EAAE,EAAE,EAAE,EAAc,EAAE,CAAC;AAC5E,CAAC;AAED,qFAAqF;AACrF,SAAS,SAAS,CAAC,OAAmC;IACpD,OAAO,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAY,CAAC,CAAC;AAC5C,CAAC;AAaD,SAAS,SAAS,CAAC,IAAiB;;IAClC,MAAM,MAAM,GAA2B;QACrC,QAAQ,EAAE,yBAAiB;aACxB,OAAO,+BACN,EAAE,EAAE,IAAI,CAAC,EAAE,EACX,QAAQ,EAAE,IAAI,CAAC,EAAE,EACjB,IAAI,EAAE,MAAA,IAAI,CAAC,IAAI,mCAAI,WAAW,EAC9B,IAAI,EAAE,MAAA,IAAI,CAAC,IAAI,mCAAI,EAAE,EACrB,KAAK,EAAE,CAAC,MAAA,IAAI,CAAC,KAAK,mCAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC;gBACzC,IAAI,EAAE,KAAK;gBACX,MAAM,EAAE,EAAE,KAAK,EAAE,iBAAiB,EAAE,EAAE,EAAE,MAAM,EAAE;aACjD,CAAC,CAAC,EACH,OAAO,EAAE,CAAC,EACV,OAAO,EAAE,MAAA,IAAI,CAAC,OAAO,mCAAI,CAAC,EAC1B,GAAG,EAAE,MAAA,IAAI,CAAC,GAAG,mCAAI,CAAC,EAClB,WAAW,EAAE,GAAG,IACb,CAAC,IAAI,CAAC,IAAI,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,KACvD,UAAU,EAAE,EAAE,MAAM,EAAE,OAAO,EAAE,IAC/B;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,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QACtD,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,SAAS,CAAC,KAAK,CAAC,SAAS,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAC7D,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,SAAS,CAAC,KAAK,CAAC,SAAS,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAC7D,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,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;YACjD,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,SAAS,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAC7D,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,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QACnD,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,QAAQ,EAAE,GAAG,EAAE;QACtB,IAAI,CAAC,uEAAuE,EAAE,GAAG,EAAE;YACjF,KAAK;iBACF,OAAO,CAAC;gBACP,SAAS,CAAC,EAAE,EAAE,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC,EAAE,OAAO,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC;gBACvD,SAAS,CAAC,EAAE,EAAE,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC,EAAE,OAAO,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC;gBACvD,SAAS,CAAC,EAAE,EAAE,EAAE,QAAQ,EAAE,IAAI,EAAE,CAAC,EAAE,OAAO,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC;gBAC1D,SAAS,CAAC,EAAE,EAAE,EAAE,QAAQ,EAAE,IAAI,EAAE,CAAC,EAAE,OAAO,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC;gBAC1D,SAAS,CAAC,EAAE,EAAE,EAAE,cAAc,EAAE,OAAO,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC;gBACvD,SAAS,CAAC,EAAE,EAAE,EAAE,cAAc,EAAE,OAAO,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC;aACxD,CAAC;iBACD,OAAO,EAAE,CAAC;YACb,iEAAiE;YACjE,gFAAgF;YAChF,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,KAAK,EAAE,QAAQ,EAAE,QAAQ,EAAE,cAAc,EAAE,cAAc,CAAC,CAAC,CAAC;QAC1G,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,4BAA4B,EAAE,GAAG,EAAE;YACtC,MAAM,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QACzC,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,qEAAqE,EAAE,GAAG,EAAE;YAC/E,kFAAkF;YAClF,mEAAmE;YACnE,KAAK;iBACF,OAAO,CAAC;gBACP,SAAS,CAAC,EAAE,EAAE,EAAE,UAAU,EAAE,OAAO,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC;gBACnD,SAAS,CAAC,EAAE,EAAE,EAAE,QAAQ,EAAE,IAAI,EAAE,CAAC,EAAE,OAAO,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC;aAC3D,CAAC;iBACD,OAAO,EAAE,CAAC;YACb,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,QAAQ,EAAE,UAAU,CAAC,CAAC,CAAC;QAC9D,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,iDAAiD,EAAE,GAAG,EAAE;YAC3D,KAAK;iBACF,OAAO,CAAC,CAAC,SAAS,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,OAAO,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,SAAS,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,OAAO,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;iBACrG,OAAO,EAAE,CAAC;YACb,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;QAClD,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,sEAAsE,EAAE,GAAG,EAAE;YAChF,4EAA4E;YAC5E,4EAA4E;YAC5E,oEAAoE;YACpE,MAAM,OAAO,GAAG;gBACd,SAAS,CAAC,EAAE,EAAE,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC,EAAE,OAAO,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC;gBACzD,SAAS,CAAC,EAAE,EAAE,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC,EAAE,OAAO,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC;gBACzD,SAAS,CAAC,EAAE,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,EAAE,OAAO,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC;gBAC3D,SAAS,CAAC,EAAE,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,EAAE,OAAO,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC;gBAC3D,SAAS,CAAC,EAAE,EAAE,EAAE,YAAY,EAAE,OAAO,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC;gBACrD,SAAS,CAAC,EAAE,EAAE,EAAE,YAAY,EAAE,OAAO,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC;aACtD,CAAC;YACF,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,OAAO,EAAE,CAAC;YACjC,MAAM,QAAQ,GAAG,GAAG,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC;YACrC,MAAM,cAAc,GAAG,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,mBAAW,CAAC,CAAC,CAAC;YAC3E,MAAM,CAAC,QAAQ,CAAC,CAAC,OAAO,CAAC,cAAc,CAAC,CAAC;YACzC,8DAA8D;YAC9D,MAAM,CAAC,QAAQ,CAAC,CAAC,OAAO,CAAC,CAAC,OAAO,EAAE,OAAO,EAAE,SAAS,EAAE,SAAS,EAAE,YAAY,EAAE,YAAY,CAAC,CAAC,CAAC;QACjG,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,SAAS,CAAC,KAAK,CAAC,SAAS,CAAC,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;QAC9E,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,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QACxD,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,SAAS,CAAC,KAAK,CAAC,SAAS,CAAC,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;YACrE,KAAK,CAAC,KAAK,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC,OAAO,EAAE,CAAC;YACpC,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,SAAS,CAAC,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAClE,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,SAAS,CAAC,KAAK,CAAC,SAAS,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAC3D,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,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QACnD,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 IEdgeTarget,\n IIndexedMemoryRecord,\n IMemoryRecord,\n Kind,\n MemoryId,\n MemoryIndex,\n MemoryScopeKey,\n Tag,\n envelopeConverter,\n rankCompare\n} from '../../../index';\n\n/**\n * The scope every link target in this fixture lives under. Links are authored as\n * bare id strings and resolved to `{ scope: LINK_TARGET_SCOPE, id }`, so the\n * cross-scope source tests can share one target while their sources differ.\n */\nconst LINK_TARGET_SCOPE: string = 'knowledge';\n\n/** A scope-qualified backlink-target query for the fixed link-target scope. */\nfunction bt(id: string): IEdgeTarget {\n return { scope: LINK_TARGET_SCOPE as MemoryScopeKey, id: id as MemoryId };\n}\n\n/** Extract the bare ids from a set of scope-qualified targets (backlink results). */\nfunction targetIds(targets: ReadonlyArray<IEdgeTarget>): string[] {\n return targets.map((t) => t.id as string);\n}\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 readonly rank?: 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) => ({\n type: 'rel',\n target: { scope: LINK_TARGET_SCOPE, id: target }\n })),\n created: 0,\n updated: spec.updated ?? 0,\n seq: spec.seq ?? 0,\n contentHash: 'h',\n ...(spec.rank !== undefined ? { rank: spec.rank } : {}),\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(bt('none'))).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(targetIds(index.backlinks(bt('b')))).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(targetIds(index.backlinks(bt('b')))).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(bt('b'))).toHaveLength(0);\n expect(targetIds(index.backlinks(bt('c')))).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(bt('b'))).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('byRank', () => {\n test('orders by rank descending, absent-rank records last, recency tiebreak', () => {\n index\n .rebuild([\n makeEntry({ id: 'mid', rank: 5, updated: 100, seq: 1 }),\n makeEntry({ id: 'top', rank: 9, updated: 100, seq: 2 }),\n makeEntry({ id: 'tie-lo', rank: 3, updated: 200, seq: 4 }),\n makeEntry({ id: 'tie-hi', rank: 3, updated: 200, seq: 9 }),\n makeEntry({ id: 'unranked-old', updated: 100, seq: 5 }),\n makeEntry({ id: 'unranked-new', updated: 400, seq: 6 })\n ])\n .orThrow();\n // ranked (desc): top(9), mid(5), tie-hi(3,seq9), tie-lo(3,seq4);\n // then unranked by recency: unranked-new(updated400), unranked-old(updated100).\n expect(ids(index.byRank())).toEqual(['top', 'mid', 'tie-hi', 'tie-lo', 'unranked-new', 'unranked-old']);\n });\n\n test('is empty on an empty index', () => {\n expect(index.byRank()).toHaveLength(0);\n });\n\n test('sorts a ranked record ahead of an earlier-listed absent-rank record', () => {\n // Input lists the absent-rank record first so the sort compares (ranked, absent),\n // exercising the ranked-before-absent direction of the comparator.\n index\n .rebuild([\n makeEntry({ id: 'unranked', updated: 100, seq: 1 }),\n makeEntry({ id: 'ranked', rank: 5, updated: 100, seq: 2 })\n ])\n .orThrow();\n expect(ids(index.byRank())).toEqual(['ranked', 'unranked']);\n });\n\n test('orders two absent-rank records by recency alone', () => {\n index\n .rebuild([makeEntry({ id: 'a', updated: 100, seq: 1 }), makeEntry({ id: 'b', updated: 300, seq: 2 })])\n .orThrow();\n expect(ids(index.byRank())).toEqual(['b', 'a']);\n });\n\n test(\"index byRank agrees pairwise with the retrieve packlet's rankCompare\", () => {\n // Guard against the two hand-duplicated comparators (index `_compareByRank`\n // and retrieve `rankCompare`) drifting: a future tie-break edit to one that\n // diverges from the other is caught here on a shared mixed fixture.\n const fixture = [\n makeEntry({ id: 'r-top', rank: 9, updated: 100, seq: 1 }),\n makeEntry({ id: 'r-mid', rank: 5, updated: 400, seq: 2 }),\n makeEntry({ id: 'r-tie-a', rank: 3, updated: 200, seq: 3 }),\n makeEntry({ id: 'r-tie-b', rank: 3, updated: 200, seq: 8 }),\n makeEntry({ id: 'absent-old', updated: 100, seq: 4 }),\n makeEntry({ id: 'absent-new', updated: 500, seq: 5 })\n ];\n index.rebuild(fixture).orThrow();\n const viaIndex = ids(index.byRank());\n const viaRankCompare = ids(fixture.map((e) => e.record).sort(rankCompare));\n expect(viaIndex).toEqual(viaRankCompare);\n // And the shared expected ordering is what both must produce.\n expect(viaIndex).toEqual(['r-top', 'r-mid', 'r-tie-b', 'r-tie-a', 'absent-new', 'absent-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(targetIds(index.backlinks(bt('target'))).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(bt('target'))).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(targetIds(index.backlinks(bt('target')))).toEqual(['a', 'a']);\n index.patch('delete', a1).orThrow();\n expect(targetIds(index.backlinks(bt('target')))).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(targetIds(index.backlinks(bt('t')))).toEqual(['a']);\n index.patch('delete', entry).orThrow();\n expect(index.byTag('dup' as Tag)).toHaveLength(0);\n expect(index.backlinks(bt('t'))).toHaveLength(0);\n });\n });\n});\n"]}
|
|
@@ -16,6 +16,10 @@ const ts_utils_1 = require("@fgv/ts-utils");
|
|
|
16
16
|
const ts_json_base_1 = require("@fgv/ts-json-base");
|
|
17
17
|
const index_1 = require("../../../index");
|
|
18
18
|
const noteKind = 'note';
|
|
19
|
+
/** A scope-qualified target for the note fixtures (all under the knowledge scope). */
|
|
20
|
+
function kt(id) {
|
|
21
|
+
return { scope: 'knowledge', id: id };
|
|
22
|
+
}
|
|
19
23
|
function mutableRoot() {
|
|
20
24
|
const tree = ts_json_base_1.FileTree.inMemory([], { mutable: true }).orThrow();
|
|
21
25
|
const root = tree.getDirectory('/').orThrow();
|
|
@@ -79,7 +83,7 @@ function candidate(entityId, body, links = []) {
|
|
|
79
83
|
};
|
|
80
84
|
}
|
|
81
85
|
function candEdge(source, type, target) {
|
|
82
|
-
return { source: source, edge: { type: type, target: target } };
|
|
86
|
+
return { source: kt(source), edge: { type: type, target: kt(target) } };
|
|
83
87
|
}
|
|
84
88
|
function buildOrchestrator(params) {
|
|
85
89
|
return index_1.MemoryIngestOrchestrator.create({
|
|
@@ -100,7 +104,7 @@ describe('antagonist — cycle guard through EXISTING store edges (integration)'
|
|
|
100
104
|
test('a proposed edge that closes a cycle through a pre-existing on-disk edge is rejected', async () => {
|
|
101
105
|
const store = buildStore();
|
|
102
106
|
// Existing on-disk edge: doc-a -> doc-b (persisted before this ingest runs).
|
|
103
|
-
await putFull(store, 'doc-a', 'anchor-a', [{ type: 'rel', target: 'doc-b' }]);
|
|
107
|
+
await putFull(store, 'doc-a', 'anchor-a', [{ type: 'rel', target: kt('doc-b') }]);
|
|
104
108
|
await putFull(store, 'doc-b', 'anchor-b');
|
|
105
109
|
// This ingest re-writes doc-b (a 'new'-verdict same-id update, since no
|
|
106
110
|
// resolver is wired) and proposes doc-b -> doc-a, which — unioned with the
|
|
@@ -119,9 +123,9 @@ describe('antagonist — cycle guard through EXISTING store edges (integration)'
|
|
|
119
123
|
const store = buildStore();
|
|
120
124
|
// Existing chain: a -> b -> c -> d (four pre-existing on-disk edges spanning
|
|
121
125
|
// three hops), persisted before this ingest.
|
|
122
|
-
await putFull(store, 'chain-a', 'a', [{ type: 'rel', target: 'chain-b' }]);
|
|
123
|
-
await putFull(store, 'chain-b', 'b', [{ type: 'rel', target: 'chain-c' }]);
|
|
124
|
-
await putFull(store, 'chain-c', 'c', [{ type: 'rel', target: 'chain-d' }]);
|
|
126
|
+
await putFull(store, 'chain-a', 'a', [{ type: 'rel', target: kt('chain-b') }]);
|
|
127
|
+
await putFull(store, 'chain-b', 'b', [{ type: 'rel', target: kt('chain-c') }]);
|
|
128
|
+
await putFull(store, 'chain-c', 'c', [{ type: 'rel', target: kt('chain-d') }]);
|
|
125
129
|
await putFull(store, 'chain-d', 'd');
|
|
126
130
|
// Proposed: chain-d -> chain-a, closing the whole loop through the existing chain.
|
|
127
131
|
const orch = buildOrchestrator({
|
|
@@ -133,7 +137,7 @@ describe('antagonist — cycle guard through EXISTING store edges (integration)'
|
|
|
133
137
|
});
|
|
134
138
|
test('cycleGuard "off" admits a cycle that closes through an existing edge', async () => {
|
|
135
139
|
const store = buildStore();
|
|
136
|
-
await putFull(store, 'doc-a', 'anchor-a', [{ type: 'rel', target: 'doc-b' }]);
|
|
140
|
+
await putFull(store, 'doc-a', 'anchor-a', [{ type: 'rel', target: kt('doc-b') }]);
|
|
137
141
|
await putFull(store, 'doc-b', 'anchor-b');
|
|
138
142
|
const orch = index_1.MemoryIngestOrchestrator.create({
|
|
139
143
|
store,
|
|
@@ -146,7 +150,7 @@ describe('antagonist — cycle guard through EXISTING store edges (integration)'
|
|
|
146
150
|
}).orThrow();
|
|
147
151
|
expect(await orch.ingestItem({ id: 'i', content: 'x' })).toSucceedAndSatisfy((r) => {
|
|
148
152
|
var _a;
|
|
149
|
-
expect((_a = r.records[0].record) === null || _a === void 0 ? void 0 : _a.envelope.links).toEqual([{ type: 'rel', target: 'doc-a' }]);
|
|
153
|
+
expect((_a = r.records[0].record) === null || _a === void 0 ? void 0 : _a.envelope.links).toEqual([{ type: 'rel', target: kt('doc-a') }]);
|
|
150
154
|
});
|
|
151
155
|
});
|
|
152
156
|
});
|
|
@@ -166,7 +170,7 @@ describe('antagonist — resolver target need not be a surfaced `similar` candid
|
|
|
166
170
|
const embed = () => Promise.resolve((0, ts_utils_1.succeed)(Float32Array.from([1, 0, 0])));
|
|
167
171
|
// Only doc-a is embedded/indexed; doc-q is never surfaced by similarity —
|
|
168
172
|
// it can only be reached by the resolver's own out-of-band choice.
|
|
169
|
-
(await vectorIndex.add('doc-a', Float32Array.from([1, 0, 0]))).orThrow();
|
|
173
|
+
(await vectorIndex.add(kt('doc-a'), Float32Array.from([1, 0, 0]))).orThrow();
|
|
170
174
|
const orch = index_1.MemoryIngestOrchestrator.create({
|
|
171
175
|
store,
|
|
172
176
|
registry: registry(),
|
|
@@ -176,7 +180,7 @@ describe('antagonist — resolver target need not be a surfaced `similar` candid
|
|
|
176
180
|
relationExtractor: relater(() => (0, ts_utils_1.succeed)([])),
|
|
177
181
|
vectorIndex,
|
|
178
182
|
embed,
|
|
179
|
-
entityResolver: resolver(() => (0, ts_utils_1.succeed)({ verdict, target: 'doc-q' }))
|
|
183
|
+
entityResolver: resolver(() => (0, ts_utils_1.succeed)({ verdict, target: kt('doc-q') }))
|
|
180
184
|
}).orThrow();
|
|
181
185
|
const result = await orch.ingestItem({ id: 'i', content: 'x' });
|
|
182
186
|
if (verdict === 'duplicate-of') {
|
|
@@ -188,7 +192,7 @@ describe('antagonist — resolver target need not be a surfaced `similar` candid
|
|
|
188
192
|
else if (verdict === 'supersede') {
|
|
189
193
|
expect(result).toSucceedAndSatisfy((r) => {
|
|
190
194
|
expect(r.records[0].disposition).toBe('written');
|
|
191
|
-
expect(r.records[0].resolution).toEqual({ verdict: 'supersede', target: 'doc-q' });
|
|
195
|
+
expect(r.records[0].resolution).toEqual({ verdict: 'supersede', target: kt('doc-q') });
|
|
192
196
|
});
|
|
193
197
|
}
|
|
194
198
|
else {
|
|
@@ -221,10 +225,10 @@ describe('antagonist — enum-branch parity: uniform structural rejection across
|
|
|
221
225
|
relationExtractor: relater(() => (0, ts_utils_1.succeed)([])),
|
|
222
226
|
vectorIndex,
|
|
223
227
|
embed,
|
|
224
|
-
entityResolver: resolver(() => (0, ts_utils_1.succeed)({ verdict, target: 'ghost' }))
|
|
228
|
+
entityResolver: resolver(() => (0, ts_utils_1.succeed)({ verdict, target: kt('ghost') }))
|
|
225
229
|
}).orThrow();
|
|
226
|
-
(await vectorIndex.add('doc-a', Float32Array.from([1, 0, 0]))).orThrow();
|
|
227
|
-
expect(await orch.ingestItem({ id: 'i', content: 'x' })).toFailWith(`ingest 'i': ${verdict} target 'ghost' does not exist in the store`);
|
|
230
|
+
(await vectorIndex.add(kt('doc-a'), Float32Array.from([1, 0, 0]))).orThrow();
|
|
231
|
+
expect(await orch.ingestItem({ id: 'i', content: 'x' })).toFailWith(`ingest 'i': ${verdict} target 'knowledge/ghost' does not exist in the store`);
|
|
228
232
|
});
|
|
229
233
|
test.each(verdicts)("verdict '%s' rejects a foreign-kind target with the SAME message shape", async (verdict) => {
|
|
230
234
|
const otherKind = 'other';
|
|
@@ -266,10 +270,10 @@ describe('antagonist — enum-branch parity: uniform structural rejection across
|
|
|
266
270
|
relationExtractor: relater(() => (0, ts_utils_1.succeed)([])),
|
|
267
271
|
vectorIndex,
|
|
268
272
|
embed,
|
|
269
|
-
entityResolver: resolver(() => (0, ts_utils_1.succeed)({ verdict, target: 'foreign-1' }))
|
|
273
|
+
entityResolver: resolver(() => (0, ts_utils_1.succeed)({ verdict, target: kt('foreign-1') }))
|
|
270
274
|
}).orThrow();
|
|
271
|
-
(await vectorIndex.add('foreign-1', Float32Array.from([1, 0, 0]))).orThrow();
|
|
272
|
-
expect(await orch.ingestItem({ id: 'i', content: 'x' })).toFailWith(`ingest 'i': ${verdict} target 'foreign-1' is kind 'other' but the candidate is kind 'note'`);
|
|
275
|
+
(await vectorIndex.add(kt('foreign-1'), Float32Array.from([1, 0, 0]))).orThrow();
|
|
276
|
+
expect(await orch.ingestItem({ id: 'i', content: 'x' })).toFailWith(`ingest 'i': ${verdict} target 'knowledge/foreign-1' is kind 'other' but the candidate is kind 'note'`);
|
|
273
277
|
});
|
|
274
278
|
});
|
|
275
279
|
//# sourceMappingURL=antagonistCycleAndParity.test.js.map
|