@fgv/ts-agent-memory 5.1.0-47 → 5.1.0-49
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/dist/packlets/ingest/orchestrator.js +11 -1
- package/dist/packlets/ingest/orchestrator.js.map +1 -1
- package/dist/packlets/observe/memoryObservationStore.js +6 -0
- package/dist/packlets/observe/memoryObservationStore.js.map +1 -1
- package/dist/packlets/observe/observer.js.map +1 -1
- package/dist/packlets/retrieve/linkTraversalRetriever.js +1 -1
- package/dist/packlets/retrieve/linkTraversalRetriever.js.map +1 -1
- package/dist/packlets/retrieve/recencyRetriever.js +1 -1
- package/dist/packlets/retrieve/recencyRetriever.js.map +1 -1
- package/dist/packlets/retrieve/retriever.js +11 -5
- package/dist/packlets/retrieve/retriever.js.map +1 -1
- package/dist/packlets/retrieve/structuredFilterRetriever.js +27 -5
- package/dist/packlets/retrieve/structuredFilterRetriever.js.map +1 -1
- package/dist/packlets/retrieve/tagRetriever.js +1 -1
- package/dist/packlets/retrieve/tagRetriever.js.map +1 -1
- package/dist/packlets/retrieve/temporalRetrievers.js +1 -1
- package/dist/packlets/retrieve/temporalRetrievers.js.map +1 -1
- package/dist/packlets/store/fileTreeMemoryStore.js +152 -132
- package/dist/packlets/store/fileTreeMemoryStore.js.map +1 -1
- package/dist/packlets/store/vectorMaintenance.js +251 -0
- package/dist/packlets/store/vectorMaintenance.js.map +1 -0
- package/dist/packlets/types/envelope.js.map +1 -1
- package/dist/packlets/vector/inMemoryCosineIndex.js +81 -18
- package/dist/packlets/vector/inMemoryCosineIndex.js.map +1 -1
- package/dist/packlets/vector/inMemoryFragmentCosineIndex.js +7 -0
- package/dist/packlets/vector/inMemoryFragmentCosineIndex.js.map +1 -1
- package/dist/packlets/vector/vectorIndex.js.map +1 -1
- package/dist/ts-agent-memory.d.ts +431 -79
- package/lib/packlets/ingest/orchestrator.d.ts.map +1 -1
- package/lib/packlets/ingest/orchestrator.js +11 -1
- package/lib/packlets/ingest/orchestrator.js.map +1 -1
- package/lib/packlets/observe/memoryObservationStore.d.ts.map +1 -1
- package/lib/packlets/observe/memoryObservationStore.js +6 -0
- package/lib/packlets/observe/memoryObservationStore.js.map +1 -1
- package/lib/packlets/observe/observer.d.ts +61 -0
- package/lib/packlets/observe/observer.d.ts.map +1 -1
- package/lib/packlets/observe/observer.js.map +1 -1
- package/lib/packlets/retrieve/linkTraversalRetriever.d.ts +1 -1
- package/lib/packlets/retrieve/linkTraversalRetriever.js +1 -1
- package/lib/packlets/retrieve/linkTraversalRetriever.js.map +1 -1
- package/lib/packlets/retrieve/recencyRetriever.d.ts +1 -1
- package/lib/packlets/retrieve/recencyRetriever.js +1 -1
- package/lib/packlets/retrieve/recencyRetriever.js.map +1 -1
- package/lib/packlets/retrieve/retriever.d.ts +26 -7
- package/lib/packlets/retrieve/retriever.d.ts.map +1 -1
- package/lib/packlets/retrieve/retriever.js +11 -5
- package/lib/packlets/retrieve/retriever.js.map +1 -1
- package/lib/packlets/retrieve/structuredFilterRetriever.d.ts +26 -4
- package/lib/packlets/retrieve/structuredFilterRetriever.d.ts.map +1 -1
- package/lib/packlets/retrieve/structuredFilterRetriever.js +27 -5
- package/lib/packlets/retrieve/structuredFilterRetriever.js.map +1 -1
- package/lib/packlets/retrieve/tagRetriever.d.ts +1 -1
- package/lib/packlets/retrieve/tagRetriever.js +1 -1
- package/lib/packlets/retrieve/tagRetriever.js.map +1 -1
- package/lib/packlets/retrieve/temporalRetrievers.js +1 -1
- package/lib/packlets/retrieve/temporalRetrievers.js.map +1 -1
- package/lib/packlets/store/fileTreeMemoryStore.d.ts +135 -59
- package/lib/packlets/store/fileTreeMemoryStore.d.ts.map +1 -1
- package/lib/packlets/store/fileTreeMemoryStore.js +151 -131
- package/lib/packlets/store/fileTreeMemoryStore.js.map +1 -1
- package/lib/packlets/store/vectorMaintenance.d.ts +149 -0
- package/lib/packlets/store/vectorMaintenance.d.ts.map +1 -0
- package/lib/packlets/store/vectorMaintenance.js +255 -0
- package/lib/packlets/store/vectorMaintenance.js.map +1 -0
- package/lib/packlets/types/envelope.d.ts +11 -0
- package/lib/packlets/types/envelope.d.ts.map +1 -1
- package/lib/packlets/types/envelope.js.map +1 -1
- package/lib/packlets/vector/inMemoryCosineIndex.d.ts +30 -7
- package/lib/packlets/vector/inMemoryCosineIndex.d.ts.map +1 -1
- package/lib/packlets/vector/inMemoryCosineIndex.js +80 -17
- package/lib/packlets/vector/inMemoryCosineIndex.js.map +1 -1
- package/lib/packlets/vector/inMemoryFragmentCosineIndex.d.ts +7 -0
- package/lib/packlets/vector/inMemoryFragmentCosineIndex.d.ts.map +1 -1
- package/lib/packlets/vector/inMemoryFragmentCosineIndex.js +7 -0
- package/lib/packlets/vector/inMemoryFragmentCosineIndex.js.map +1 -1
- package/lib/packlets/vector/vectorIndex.d.ts +129 -1
- package/lib/packlets/vector/vectorIndex.d.ts.map +1 -1
- package/lib/packlets/vector/vectorIndex.js.map +1 -1
- package/package.json +17 -7
- package/.rush/temp/5667e36f1c0cc503a5c20a3ebff76e7b9a702d41.tar.log +0 -468
- package/.rush/temp/chunked-rush-logs/ts-agent-memory.build.chunks.jsonl +0 -9
- package/.rush/temp/operation/build/all.log +0 -9
- package/.rush/temp/operation/build/log-chunks.jsonl +0 -9
- package/.rush/temp/operation/build/state.json +0 -3
- package/.rush/temp/shrinkwrap-deps.json +0 -689
- package/config/api-extractor.json +0 -343
- package/config/jest.config.json +0 -14
- package/config/rig.json +0 -4
- package/dist/test/unit/converters/antagonistRoundTrip.test.js +0 -95
- package/dist/test/unit/converters/antagonistRoundTrip.test.js.map +0 -1
- package/dist/test/unit/converters/bodyConverterRegistry.test.js +0 -72
- package/dist/test/unit/converters/bodyConverterRegistry.test.js.map +0 -1
- package/dist/test/unit/converters/envelopeConverter.test.js +0 -313
- package/dist/test/unit/converters/envelopeConverter.test.js.map +0 -1
- package/dist/test/unit/index/memoryIndex.test.js +0 -214
- package/dist/test/unit/index/memoryIndex.test.js.map +0 -1
- package/dist/test/unit/ingest/antagonistCycleAndParity.test.js +0 -277
- package/dist/test/unit/ingest/antagonistCycleAndParity.test.js.map +0 -1
- package/dist/test/unit/ingest/cycleGuard.test.js +0 -81
- package/dist/test/unit/ingest/cycleGuard.test.js.map +0 -1
- package/dist/test/unit/ingest/dedupScope.test.js +0 -434
- package/dist/test/unit/ingest/dedupScope.test.js.map +0 -1
- package/dist/test/unit/ingest/orchestrator.test.js +0 -1058
- package/dist/test/unit/ingest/orchestrator.test.js.map +0 -1
- package/dist/test/unit/observe/memoryObservationStore.test.js +0 -118
- package/dist/test/unit/observe/memoryObservationStore.test.js.map +0 -1
- package/dist/test/unit/retrieve/fragmentSemanticRetriever.test.js +0 -116
- package/dist/test/unit/retrieve/fragmentSemanticRetriever.test.js.map +0 -1
- package/dist/test/unit/retrieve/linkTraversalRetriever.test.js +0 -257
- package/dist/test/unit/retrieve/linkTraversalRetriever.test.js.map +0 -1
- package/dist/test/unit/retrieve/retrievers.test.js +0 -768
- package/dist/test/unit/retrieve/retrievers.test.js.map +0 -1
- package/dist/test/unit/retrieve/temporalRetrievers.test.js +0 -182
- package/dist/test/unit/retrieve/temporalRetrievers.test.js.map +0 -1
- package/dist/test/unit/store/antagonistTemporalBoundary.test.js +0 -120
- package/dist/test/unit/store/antagonistTemporalBoundary.test.js.map +0 -1
- package/dist/test/unit/store/embedOnWrite.test.js +0 -317
- package/dist/test/unit/store/embedOnWrite.test.js.map +0 -1
- package/dist/test/unit/store/fileTreeMemoryStore.test.js +0 -778
- package/dist/test/unit/store/fileTreeMemoryStore.test.js.map +0 -1
- package/dist/test/unit/store/fragmentEmbedOnWrite.test.js +0 -255
- package/dist/test/unit/store/fragmentEmbedOnWrite.test.js.map +0 -1
- package/dist/test/unit/store/indexInjection.test.js +0 -432
- package/dist/test/unit/store/indexInjection.test.js.map +0 -1
- package/dist/test/unit/store/lenientOpen.test.js +0 -248
- package/dist/test/unit/store/lenientOpen.test.js.map +0 -1
- package/dist/test/unit/store/listScoped.test.js +0 -109
- package/dist/test/unit/store/listScoped.test.js.map +0 -1
- package/dist/test/unit/store/observations.test.js +0 -239
- package/dist/test/unit/store/observations.test.js.map +0 -1
- package/dist/test/unit/store/rankAxis.test.js +0 -254
- package/dist/test/unit/store/rankAxis.test.js.map +0 -1
- package/dist/test/unit/store/scopeEncoding.test.js +0 -24
- package/dist/test/unit/store/scopeEncoding.test.js.map +0 -1
- package/dist/test/unit/store/temporalStore.test.js +0 -398
- package/dist/test/unit/store/temporalStore.test.js.map +0 -1
- package/dist/test/unit/tools/memoryTools.test.js +0 -842
- package/dist/test/unit/tools/memoryTools.test.js.map +0 -1
- package/dist/test/unit/types/identityCodec.test.js +0 -187
- package/dist/test/unit/types/identityCodec.test.js.map +0 -1
- package/dist/test/unit/types/ids.test.js +0 -84
- package/dist/test/unit/types/ids.test.js.map +0 -1
- package/dist/test/unit/types/temporalCodec.test.js +0 -203
- package/dist/test/unit/types/temporalCodec.test.js.map +0 -1
- package/dist/test/unit/types/temporalPolicy.test.js +0 -83
- package/dist/test/unit/types/temporalPolicy.test.js.map +0 -1
- package/dist/test/unit/types/writePolicy.test.js +0 -331
- package/dist/test/unit/types/writePolicy.test.js.map +0 -1
- package/dist/test/unit/vector/fragmentConverters.test.js +0 -58
- package/dist/test/unit/vector/fragmentConverters.test.js.map +0 -1
- package/dist/test/unit/vector/inMemoryCosineIndex.test.js +0 -252
- package/dist/test/unit/vector/inMemoryCosineIndex.test.js.map +0 -1
- package/dist/test/unit/vector/inMemoryFragmentCosineIndex.test.js +0 -362
- package/dist/test/unit/vector/inMemoryFragmentCosineIndex.test.js.map +0 -1
- package/dist/test/unit/vector/vectorIndex.test.js +0 -51
- package/dist/test/unit/vector/vectorIndex.test.js.map +0 -1
- package/eslint.config.js +0 -15
- package/etc/ts-agent-memory.api.md +0 -940
- package/lib/test/unit/converters/antagonistRoundTrip.test.d.ts +0 -10
- package/lib/test/unit/converters/antagonistRoundTrip.test.d.ts.map +0 -1
- package/lib/test/unit/converters/antagonistRoundTrip.test.js +0 -97
- package/lib/test/unit/converters/antagonistRoundTrip.test.js.map +0 -1
- package/lib/test/unit/converters/bodyConverterRegistry.test.d.ts +0 -2
- package/lib/test/unit/converters/bodyConverterRegistry.test.d.ts.map +0 -1
- package/lib/test/unit/converters/bodyConverterRegistry.test.js +0 -74
- package/lib/test/unit/converters/bodyConverterRegistry.test.js.map +0 -1
- package/lib/test/unit/converters/envelopeConverter.test.d.ts +0 -2
- package/lib/test/unit/converters/envelopeConverter.test.d.ts.map +0 -1
- package/lib/test/unit/converters/envelopeConverter.test.js +0 -315
- package/lib/test/unit/converters/envelopeConverter.test.js.map +0 -1
- package/lib/test/unit/index/memoryIndex.test.d.ts +0 -2
- package/lib/test/unit/index/memoryIndex.test.d.ts.map +0 -1
- package/lib/test/unit/index/memoryIndex.test.js +0 -216
- package/lib/test/unit/index/memoryIndex.test.js.map +0 -1
- package/lib/test/unit/ingest/antagonistCycleAndParity.test.d.ts +0 -9
- package/lib/test/unit/ingest/antagonistCycleAndParity.test.d.ts.map +0 -1
- package/lib/test/unit/ingest/antagonistCycleAndParity.test.js +0 -279
- package/lib/test/unit/ingest/antagonistCycleAndParity.test.js.map +0 -1
- package/lib/test/unit/ingest/cycleGuard.test.d.ts +0 -2
- package/lib/test/unit/ingest/cycleGuard.test.d.ts.map +0 -1
- package/lib/test/unit/ingest/cycleGuard.test.js +0 -83
- package/lib/test/unit/ingest/cycleGuard.test.js.map +0 -1
- package/lib/test/unit/ingest/dedupScope.test.d.ts +0 -2
- package/lib/test/unit/ingest/dedupScope.test.d.ts.map +0 -1
- package/lib/test/unit/ingest/dedupScope.test.js +0 -436
- package/lib/test/unit/ingest/dedupScope.test.js.map +0 -1
- package/lib/test/unit/ingest/orchestrator.test.d.ts +0 -2
- package/lib/test/unit/ingest/orchestrator.test.d.ts.map +0 -1
- package/lib/test/unit/ingest/orchestrator.test.js +0 -1060
- package/lib/test/unit/ingest/orchestrator.test.js.map +0 -1
- package/lib/test/unit/observe/memoryObservationStore.test.d.ts +0 -2
- package/lib/test/unit/observe/memoryObservationStore.test.d.ts.map +0 -1
- package/lib/test/unit/observe/memoryObservationStore.test.js +0 -120
- package/lib/test/unit/observe/memoryObservationStore.test.js.map +0 -1
- package/lib/test/unit/retrieve/fragmentSemanticRetriever.test.d.ts +0 -2
- package/lib/test/unit/retrieve/fragmentSemanticRetriever.test.d.ts.map +0 -1
- package/lib/test/unit/retrieve/fragmentSemanticRetriever.test.js +0 -118
- package/lib/test/unit/retrieve/fragmentSemanticRetriever.test.js.map +0 -1
- package/lib/test/unit/retrieve/linkTraversalRetriever.test.d.ts +0 -2
- package/lib/test/unit/retrieve/linkTraversalRetriever.test.d.ts.map +0 -1
- package/lib/test/unit/retrieve/linkTraversalRetriever.test.js +0 -259
- package/lib/test/unit/retrieve/linkTraversalRetriever.test.js.map +0 -1
- package/lib/test/unit/retrieve/retrievers.test.d.ts +0 -2
- package/lib/test/unit/retrieve/retrievers.test.d.ts.map +0 -1
- package/lib/test/unit/retrieve/retrievers.test.js +0 -770
- package/lib/test/unit/retrieve/retrievers.test.js.map +0 -1
- package/lib/test/unit/retrieve/temporalRetrievers.test.d.ts +0 -2
- package/lib/test/unit/retrieve/temporalRetrievers.test.d.ts.map +0 -1
- package/lib/test/unit/retrieve/temporalRetrievers.test.js +0 -184
- package/lib/test/unit/retrieve/temporalRetrievers.test.js.map +0 -1
- package/lib/test/unit/store/antagonistTemporalBoundary.test.d.ts +0 -9
- package/lib/test/unit/store/antagonistTemporalBoundary.test.d.ts.map +0 -1
- package/lib/test/unit/store/antagonistTemporalBoundary.test.js +0 -122
- package/lib/test/unit/store/antagonistTemporalBoundary.test.js.map +0 -1
- package/lib/test/unit/store/embedOnWrite.test.d.ts +0 -2
- package/lib/test/unit/store/embedOnWrite.test.d.ts.map +0 -1
- package/lib/test/unit/store/embedOnWrite.test.js +0 -319
- package/lib/test/unit/store/embedOnWrite.test.js.map +0 -1
- package/lib/test/unit/store/fileTreeMemoryStore.test.d.ts +0 -2
- package/lib/test/unit/store/fileTreeMemoryStore.test.d.ts.map +0 -1
- package/lib/test/unit/store/fileTreeMemoryStore.test.js +0 -780
- package/lib/test/unit/store/fileTreeMemoryStore.test.js.map +0 -1
- package/lib/test/unit/store/fragmentEmbedOnWrite.test.d.ts +0 -2
- package/lib/test/unit/store/fragmentEmbedOnWrite.test.d.ts.map +0 -1
- package/lib/test/unit/store/fragmentEmbedOnWrite.test.js +0 -257
- package/lib/test/unit/store/fragmentEmbedOnWrite.test.js.map +0 -1
- package/lib/test/unit/store/indexInjection.test.d.ts +0 -2
- package/lib/test/unit/store/indexInjection.test.d.ts.map +0 -1
- package/lib/test/unit/store/indexInjection.test.js +0 -434
- package/lib/test/unit/store/indexInjection.test.js.map +0 -1
- package/lib/test/unit/store/lenientOpen.test.d.ts +0 -2
- package/lib/test/unit/store/lenientOpen.test.d.ts.map +0 -1
- package/lib/test/unit/store/lenientOpen.test.js +0 -250
- package/lib/test/unit/store/lenientOpen.test.js.map +0 -1
- package/lib/test/unit/store/listScoped.test.d.ts +0 -2
- package/lib/test/unit/store/listScoped.test.d.ts.map +0 -1
- package/lib/test/unit/store/listScoped.test.js +0 -111
- package/lib/test/unit/store/listScoped.test.js.map +0 -1
- package/lib/test/unit/store/observations.test.d.ts +0 -2
- package/lib/test/unit/store/observations.test.d.ts.map +0 -1
- package/lib/test/unit/store/observations.test.js +0 -241
- package/lib/test/unit/store/observations.test.js.map +0 -1
- package/lib/test/unit/store/rankAxis.test.d.ts +0 -2
- package/lib/test/unit/store/rankAxis.test.d.ts.map +0 -1
- package/lib/test/unit/store/rankAxis.test.js +0 -256
- package/lib/test/unit/store/rankAxis.test.js.map +0 -1
- package/lib/test/unit/store/scopeEncoding.test.d.ts +0 -2
- package/lib/test/unit/store/scopeEncoding.test.d.ts.map +0 -1
- package/lib/test/unit/store/scopeEncoding.test.js +0 -26
- package/lib/test/unit/store/scopeEncoding.test.js.map +0 -1
- package/lib/test/unit/store/temporalStore.test.d.ts +0 -2
- package/lib/test/unit/store/temporalStore.test.d.ts.map +0 -1
- package/lib/test/unit/store/temporalStore.test.js +0 -400
- package/lib/test/unit/store/temporalStore.test.js.map +0 -1
- package/lib/test/unit/tools/memoryTools.test.d.ts +0 -2
- package/lib/test/unit/tools/memoryTools.test.d.ts.map +0 -1
- package/lib/test/unit/tools/memoryTools.test.js +0 -844
- package/lib/test/unit/tools/memoryTools.test.js.map +0 -1
- package/lib/test/unit/types/identityCodec.test.d.ts +0 -2
- package/lib/test/unit/types/identityCodec.test.d.ts.map +0 -1
- package/lib/test/unit/types/identityCodec.test.js +0 -189
- package/lib/test/unit/types/identityCodec.test.js.map +0 -1
- package/lib/test/unit/types/ids.test.d.ts +0 -2
- package/lib/test/unit/types/ids.test.d.ts.map +0 -1
- package/lib/test/unit/types/ids.test.js +0 -86
- package/lib/test/unit/types/ids.test.js.map +0 -1
- package/lib/test/unit/types/temporalCodec.test.d.ts +0 -2
- package/lib/test/unit/types/temporalCodec.test.d.ts.map +0 -1
- package/lib/test/unit/types/temporalCodec.test.js +0 -205
- package/lib/test/unit/types/temporalCodec.test.js.map +0 -1
- package/lib/test/unit/types/temporalPolicy.test.d.ts +0 -2
- package/lib/test/unit/types/temporalPolicy.test.d.ts.map +0 -1
- package/lib/test/unit/types/temporalPolicy.test.js +0 -85
- package/lib/test/unit/types/temporalPolicy.test.js.map +0 -1
- package/lib/test/unit/types/writePolicy.test.d.ts +0 -2
- package/lib/test/unit/types/writePolicy.test.d.ts.map +0 -1
- package/lib/test/unit/types/writePolicy.test.js +0 -333
- package/lib/test/unit/types/writePolicy.test.js.map +0 -1
- package/lib/test/unit/vector/fragmentConverters.test.d.ts +0 -2
- package/lib/test/unit/vector/fragmentConverters.test.d.ts.map +0 -1
- package/lib/test/unit/vector/fragmentConverters.test.js +0 -60
- package/lib/test/unit/vector/fragmentConverters.test.js.map +0 -1
- package/lib/test/unit/vector/inMemoryCosineIndex.test.d.ts +0 -2
- package/lib/test/unit/vector/inMemoryCosineIndex.test.d.ts.map +0 -1
- package/lib/test/unit/vector/inMemoryCosineIndex.test.js +0 -254
- package/lib/test/unit/vector/inMemoryCosineIndex.test.js.map +0 -1
- package/lib/test/unit/vector/inMemoryFragmentCosineIndex.test.d.ts +0 -2
- package/lib/test/unit/vector/inMemoryFragmentCosineIndex.test.d.ts.map +0 -1
- package/lib/test/unit/vector/inMemoryFragmentCosineIndex.test.js +0 -364
- package/lib/test/unit/vector/inMemoryFragmentCosineIndex.test.js.map +0 -1
- package/lib/test/unit/vector/vectorIndex.test.d.ts +0 -2
- package/lib/test/unit/vector/vectorIndex.test.d.ts.map +0 -1
- package/lib/test/unit/vector/vectorIndex.test.js +0 -53
- package/lib/test/unit/vector/vectorIndex.test.js.map +0 -1
- package/rush-logs/ts-agent-memory.build.cache.log +0 -3
- package/rush-logs/ts-agent-memory.build.log +0 -9
- package/src/index.ts +0 -14
- package/src/packlets/converters/bodyConverterRegistry.ts +0 -105
- package/src/packlets/converters/envelopeConverter.ts +0 -233
- package/src/packlets/converters/index.ts +0 -7
- package/src/packlets/index/index.ts +0 -6
- package/src/packlets/index/memoryIndex.ts +0 -332
- package/src/packlets/ingest/cycleGuard.ts +0 -153
- package/src/packlets/ingest/hostStages.ts +0 -111
- package/src/packlets/ingest/index.ts +0 -9
- package/src/packlets/ingest/model.ts +0 -195
- package/src/packlets/ingest/orchestrator.ts +0 -968
- package/src/packlets/observe/index.ts +0 -7
- package/src/packlets/observe/memoryObservationStore.ts +0 -153
- package/src/packlets/observe/observer.ts +0 -119
- package/src/packlets/retrieve/fragmentSemanticRetriever.ts +0 -138
- package/src/packlets/retrieve/hybridRetriever.ts +0 -194
- package/src/packlets/retrieve/index.ts +0 -14
- package/src/packlets/retrieve/linkTraversalRetriever.ts +0 -158
- package/src/packlets/retrieve/recencyRetriever.ts +0 -54
- package/src/packlets/retrieve/retriever.ts +0 -291
- package/src/packlets/retrieve/semanticRetriever.ts +0 -152
- package/src/packlets/retrieve/structuredFilterRetriever.ts +0 -58
- package/src/packlets/retrieve/tagRetriever.ts +0 -58
- package/src/packlets/retrieve/temporalRetrievers.ts +0 -210
- package/src/packlets/store/fileTreeMemoryStore.ts +0 -1872
- package/src/packlets/store/index.ts +0 -7
- package/src/packlets/store/scopeEncoding.ts +0 -36
- package/src/packlets/tools/index.ts +0 -6
- package/src/packlets/tools/memoryTools.ts +0 -706
- package/src/packlets/types/envelope.ts +0 -196
- package/src/packlets/types/filenameSafety.ts +0 -57
- package/src/packlets/types/identityCodec.ts +0 -447
- package/src/packlets/types/ids.ts +0 -124
- package/src/packlets/types/index.ts +0 -11
- package/src/packlets/types/temporal.ts +0 -96
- package/src/packlets/types/writePolicy.ts +0 -612
- package/src/packlets/vector/fragmentConverters.ts +0 -55
- package/src/packlets/vector/inMemoryCosineIndex.ts +0 -196
- package/src/packlets/vector/inMemoryFragmentCosineIndex.ts +0 -289
- package/src/packlets/vector/index.ts +0 -9
- package/src/packlets/vector/vectorIndex.ts +0 -273
- package/src/test/unit/converters/antagonistRoundTrip.test.ts +0 -110
- package/src/test/unit/converters/bodyConverterRegistry.test.ts +0 -89
- package/src/test/unit/converters/envelopeConverter.test.ts +0 -418
- package/src/test/unit/index/memoryIndex.test.ts +0 -272
- package/src/test/unit/ingest/antagonistCycleAndParity.test.ts +0 -367
- package/src/test/unit/ingest/cycleGuard.test.ts +0 -110
- package/src/test/unit/ingest/dedupScope.test.ts +0 -542
- package/src/test/unit/ingest/orchestrator.test.ts +0 -1355
- package/src/test/unit/observe/memoryObservationStore.test.ts +0 -158
- package/src/test/unit/retrieve/fragmentSemanticRetriever.test.ts +0 -163
- package/src/test/unit/retrieve/linkTraversalRetriever.test.ts +0 -329
- package/src/test/unit/retrieve/retrievers.test.ts +0 -1018
- package/src/test/unit/retrieve/temporalRetrievers.test.ts +0 -226
- package/src/test/unit/store/antagonistTemporalBoundary.test.ts +0 -158
- package/src/test/unit/store/embedOnWrite.test.ts +0 -418
- package/src/test/unit/store/fileTreeMemoryStore.test.ts +0 -1041
- package/src/test/unit/store/fragmentEmbedOnWrite.test.ts +0 -349
- package/src/test/unit/store/indexInjection.test.ts +0 -550
- package/src/test/unit/store/lenientOpen.test.ts +0 -292
- package/src/test/unit/store/listScoped.test.ts +0 -138
- package/src/test/unit/store/observations.test.ts +0 -290
- package/src/test/unit/store/rankAxis.test.ts +0 -349
- package/src/test/unit/store/scopeEncoding.test.ts +0 -37
- package/src/test/unit/store/temporalStore.test.ts +0 -469
- package/src/test/unit/tools/memoryTools.test.ts +0 -1121
- package/src/test/unit/types/identityCodec.test.ts +0 -266
- package/src/test/unit/types/ids.test.ts +0 -94
- package/src/test/unit/types/temporalCodec.test.ts +0 -259
- package/src/test/unit/types/temporalPolicy.test.ts +0 -124
- package/src/test/unit/types/writePolicy.test.ts +0 -446
- package/src/test/unit/vector/fragmentConverters.test.ts +0 -80
- package/src/test/unit/vector/inMemoryCosineIndex.test.ts +0 -318
- package/src/test/unit/vector/inMemoryFragmentCosineIndex.test.ts +0 -477
- package/src/test/unit/vector/vectorIndex.test.ts +0 -64
- package/temp/build/lint/_eslint-5eVG3S6w.json +0 -306
- package/temp/build/typescript/ts_8nwakTlr.json +0 -1
- package/temp/ts-agent-memory.api.json +0 -21030
- package/temp/ts-agent-memory.api.md +0 -940
- package/tsconfig.json +0 -8
|
@@ -1,158 +0,0 @@
|
|
|
1
|
-
/*
|
|
2
|
-
* Copyright (c) 2026 Erik Fortune
|
|
3
|
-
* SPDX-License-Identifier: MIT
|
|
4
|
-
*/
|
|
5
|
-
|
|
6
|
-
import '@fgv/ts-utils-jest';
|
|
7
|
-
import {
|
|
8
|
-
IMemoryObservationRecord,
|
|
9
|
-
Kind,
|
|
10
|
-
MemoryId,
|
|
11
|
-
MemoryObservationPhase,
|
|
12
|
-
MemoryObservationStore,
|
|
13
|
-
MemoryScopeKey
|
|
14
|
-
} from '../../../index';
|
|
15
|
-
|
|
16
|
-
interface IObsSpec {
|
|
17
|
-
readonly seq: number;
|
|
18
|
-
readonly timestamp?: number;
|
|
19
|
-
readonly phase?: MemoryObservationPhase;
|
|
20
|
-
readonly scope?: string;
|
|
21
|
-
readonly kind?: string;
|
|
22
|
-
readonly id?: string;
|
|
23
|
-
readonly outcome?: 'success' | 'failure';
|
|
24
|
-
}
|
|
25
|
-
|
|
26
|
-
function obs(spec: IObsSpec): IMemoryObservationRecord {
|
|
27
|
-
return {
|
|
28
|
-
seq: spec.seq,
|
|
29
|
-
timestamp: spec.timestamp ?? spec.seq,
|
|
30
|
-
phase: spec.phase ?? 'write',
|
|
31
|
-
scope: spec.scope === undefined ? undefined : (spec.scope as MemoryScopeKey),
|
|
32
|
-
kind: spec.kind === undefined ? undefined : (spec.kind as Kind),
|
|
33
|
-
id: spec.id === undefined ? undefined : (spec.id as MemoryId),
|
|
34
|
-
outcome: spec.outcome ?? 'success'
|
|
35
|
-
};
|
|
36
|
-
}
|
|
37
|
-
|
|
38
|
-
function seqs(records: ReadonlyArray<IMemoryObservationRecord>): ReadonlyArray<number> {
|
|
39
|
-
return records.map((r) => r.seq);
|
|
40
|
-
}
|
|
41
|
-
|
|
42
|
-
describe('MemoryObservationStore', () => {
|
|
43
|
-
describe('create', () => {
|
|
44
|
-
test('builds with defaults', () => {
|
|
45
|
-
expect(MemoryObservationStore.create()).toSucceedAndSatisfy((store: MemoryObservationStore) => {
|
|
46
|
-
expect(store.size).toBe(0);
|
|
47
|
-
expect(store.lastSeq).toBe(0);
|
|
48
|
-
});
|
|
49
|
-
});
|
|
50
|
-
|
|
51
|
-
test('rejects a non-positive-integer maxRecords', () => {
|
|
52
|
-
expect(MemoryObservationStore.create({ maxRecords: 0 })).toFailWith(/positive integer/i);
|
|
53
|
-
expect(MemoryObservationStore.create({ maxRecords: 2.5 })).toFailWith(/positive integer/i);
|
|
54
|
-
expect(MemoryObservationStore.create({ maxRecords: -1 })).toFailWith(/positive integer/i);
|
|
55
|
-
});
|
|
56
|
-
});
|
|
57
|
-
|
|
58
|
-
describe('observe', () => {
|
|
59
|
-
test('retains records and tracks size + lastSeq', async () => {
|
|
60
|
-
const store = MemoryObservationStore.create().orThrow();
|
|
61
|
-
expect(await store.observe(obs({ seq: 1 }))).toSucceed();
|
|
62
|
-
expect(await store.observe(obs({ seq: 2 }))).toSucceed();
|
|
63
|
-
expect(store.size).toBe(2);
|
|
64
|
-
expect(store.lastSeq).toBe(2);
|
|
65
|
-
});
|
|
66
|
-
|
|
67
|
-
test('evicts the oldest beyond maxRecords, preserving lastSeq', async () => {
|
|
68
|
-
const store = MemoryObservationStore.create({ maxRecords: 2 }).orThrow();
|
|
69
|
-
await store.observe(obs({ seq: 1 }));
|
|
70
|
-
await store.observe(obs({ seq: 2 }));
|
|
71
|
-
await store.observe(obs({ seq: 3 }));
|
|
72
|
-
expect(store.size).toBe(2);
|
|
73
|
-
expect(store.lastSeq).toBe(3);
|
|
74
|
-
expect(seqs(store.query())).toEqual([2, 3]);
|
|
75
|
-
});
|
|
76
|
-
});
|
|
77
|
-
|
|
78
|
-
describe('query', () => {
|
|
79
|
-
let store: MemoryObservationStore;
|
|
80
|
-
|
|
81
|
-
beforeEach(async () => {
|
|
82
|
-
store = MemoryObservationStore.create().orThrow();
|
|
83
|
-
await store.observe(
|
|
84
|
-
obs({
|
|
85
|
-
seq: 1,
|
|
86
|
-
timestamp: 100,
|
|
87
|
-
phase: 'write',
|
|
88
|
-
scope: 'knowledge',
|
|
89
|
-
kind: 'knowledge',
|
|
90
|
-
outcome: 'success'
|
|
91
|
-
})
|
|
92
|
-
);
|
|
93
|
-
await store.observe(
|
|
94
|
-
obs({
|
|
95
|
-
seq: 2,
|
|
96
|
-
timestamp: 200,
|
|
97
|
-
phase: 'read',
|
|
98
|
-
scope: 'knowledge',
|
|
99
|
-
kind: 'knowledge',
|
|
100
|
-
outcome: 'failure'
|
|
101
|
-
})
|
|
102
|
-
);
|
|
103
|
-
await store.observe(
|
|
104
|
-
obs({ seq: 3, timestamp: 300, phase: 'delete', scope: 'other', kind: 'note', outcome: 'success' })
|
|
105
|
-
);
|
|
106
|
-
});
|
|
107
|
-
|
|
108
|
-
test('returns all records oldest-first with no criteria', () => {
|
|
109
|
-
expect(seqs(store.query())).toEqual([1, 2, 3]);
|
|
110
|
-
});
|
|
111
|
-
|
|
112
|
-
test('pages by sinceSeq', () => {
|
|
113
|
-
expect(seqs(store.query({ sinceSeq: 1 }))).toEqual([2, 3]);
|
|
114
|
-
});
|
|
115
|
-
|
|
116
|
-
test('limits to the most-recent N', () => {
|
|
117
|
-
expect(seqs(store.query({ limit: 2 }))).toEqual([2, 3]);
|
|
118
|
-
});
|
|
119
|
-
|
|
120
|
-
test('filters by timestamp window', () => {
|
|
121
|
-
expect(seqs(store.query({ since: 200 }))).toEqual([2, 3]);
|
|
122
|
-
expect(seqs(store.query({ until: 200 }))).toEqual([1, 2]);
|
|
123
|
-
expect(seqs(store.query({ since: 150, until: 250 }))).toEqual([2]);
|
|
124
|
-
});
|
|
125
|
-
|
|
126
|
-
test('filters by scope', () => {
|
|
127
|
-
expect(seqs(store.query({ scope: 'knowledge' as MemoryScopeKey }))).toEqual([1, 2]);
|
|
128
|
-
});
|
|
129
|
-
|
|
130
|
-
test('filters by kind', () => {
|
|
131
|
-
expect(seqs(store.query({ kind: 'note' as Kind }))).toEqual([3]);
|
|
132
|
-
});
|
|
133
|
-
|
|
134
|
-
test('filters by phase', () => {
|
|
135
|
-
expect(seqs(store.query({ phase: 'read' }))).toEqual([2]);
|
|
136
|
-
});
|
|
137
|
-
|
|
138
|
-
test('filters by outcome', () => {
|
|
139
|
-
expect(seqs(store.query({ outcome: 'failure' }))).toEqual([2]);
|
|
140
|
-
});
|
|
141
|
-
|
|
142
|
-
test('combines criteria with AND', () => {
|
|
143
|
-
expect(seqs(store.query({ scope: 'knowledge' as MemoryScopeKey, outcome: 'success' }))).toEqual([1]);
|
|
144
|
-
});
|
|
145
|
-
});
|
|
146
|
-
|
|
147
|
-
describe('clear', () => {
|
|
148
|
-
test('drops records but preserves lastSeq as a cursor floor', async () => {
|
|
149
|
-
const store = MemoryObservationStore.create().orThrow();
|
|
150
|
-
await store.observe(obs({ seq: 1 }));
|
|
151
|
-
await store.observe(obs({ seq: 2 }));
|
|
152
|
-
store.clear();
|
|
153
|
-
expect(store.size).toBe(0);
|
|
154
|
-
expect(store.lastSeq).toBe(2);
|
|
155
|
-
expect(store.query()).toEqual([]);
|
|
156
|
-
});
|
|
157
|
-
});
|
|
158
|
-
});
|
|
@@ -1,163 +0,0 @@
|
|
|
1
|
-
/*
|
|
2
|
-
* Copyright (c) 2026 Erik Fortune
|
|
3
|
-
* SPDX-License-Identifier: MIT
|
|
4
|
-
*/
|
|
5
|
-
|
|
6
|
-
import '@fgv/ts-utils-jest';
|
|
7
|
-
import { Result, fail, succeed } from '@fgv/ts-utils';
|
|
8
|
-
import {
|
|
9
|
-
FRAGMENT_SEMANTIC_UNWIRED_MESSAGE,
|
|
10
|
-
FragmentSemanticRetriever,
|
|
11
|
-
IEdgeTarget,
|
|
12
|
-
IEmbeddedFragment,
|
|
13
|
-
IFragmentLocator,
|
|
14
|
-
IFragmentVectorIndex,
|
|
15
|
-
IVectorQueryHit,
|
|
16
|
-
MemoryId,
|
|
17
|
-
MemoryScopeKey
|
|
18
|
-
} from '../../../index';
|
|
19
|
-
|
|
20
|
-
function target(scope: string, id: string): IEdgeTarget {
|
|
21
|
-
return { scope: scope as MemoryScopeKey, id: id as MemoryId };
|
|
22
|
-
}
|
|
23
|
-
|
|
24
|
-
function loc(start: number, end: number): IFragmentLocator {
|
|
25
|
-
return { start, end };
|
|
26
|
-
}
|
|
27
|
-
|
|
28
|
-
function hit(scope: string, id: string, start: number, end: number, score: number): IVectorQueryHit {
|
|
29
|
-
return { target: target(scope, id), score, locator: loc(start, end) };
|
|
30
|
-
}
|
|
31
|
-
|
|
32
|
-
const okEmbed = (): Promise<Result<Float32Array>> => Promise.resolve(succeed(Float32Array.from([0.1, 0.2])));
|
|
33
|
-
|
|
34
|
-
/** A scripted fragment index that records the args it was queried with. */
|
|
35
|
-
class FakeFragmentIndex implements IFragmentVectorIndex {
|
|
36
|
-
public lastTopK: number | undefined;
|
|
37
|
-
public lastMaxPerRecord: number | undefined;
|
|
38
|
-
private readonly _hits: ReadonlyArray<IVectorQueryHit>;
|
|
39
|
-
private readonly _fail: boolean;
|
|
40
|
-
public constructor(hits: ReadonlyArray<IVectorQueryHit>, shouldFail: boolean = false) {
|
|
41
|
-
this._hits = hits;
|
|
42
|
-
this._fail = shouldFail;
|
|
43
|
-
}
|
|
44
|
-
public addFragments(
|
|
45
|
-
__t: IEdgeTarget,
|
|
46
|
-
fragments: ReadonlyArray<IEmbeddedFragment>
|
|
47
|
-
): Promise<Result<number>> {
|
|
48
|
-
return Promise.resolve(succeed(fragments.length));
|
|
49
|
-
}
|
|
50
|
-
public remove(t: IEdgeTarget): Promise<Result<IEdgeTarget>> {
|
|
51
|
-
return Promise.resolve(succeed(t));
|
|
52
|
-
}
|
|
53
|
-
public query(
|
|
54
|
-
__vector: Float32Array,
|
|
55
|
-
topK: number,
|
|
56
|
-
maxPerRecord?: number
|
|
57
|
-
): Promise<Result<ReadonlyArray<IVectorQueryHit>>> {
|
|
58
|
-
this.lastTopK = topK;
|
|
59
|
-
this.lastMaxPerRecord = maxPerRecord;
|
|
60
|
-
return Promise.resolve(this._fail ? fail('fragment backend down') : succeed(this._hits));
|
|
61
|
-
}
|
|
62
|
-
}
|
|
63
|
-
|
|
64
|
-
describe('FragmentSemanticRetriever', () => {
|
|
65
|
-
test('reports supportsFragmentRecall=false when no backend is wired', () => {
|
|
66
|
-
const r = FragmentSemanticRetriever.create({}).orThrow();
|
|
67
|
-
expect(r.capabilities.supportsFragmentRecall).toBe(false);
|
|
68
|
-
});
|
|
69
|
-
|
|
70
|
-
test('reports supportsFragmentRecall=true when a backend is wired', () => {
|
|
71
|
-
const r = FragmentSemanticRetriever.create({
|
|
72
|
-
backend: { fragmentIndex: new FakeFragmentIndex([]), embedQuery: okEmbed }
|
|
73
|
-
}).orThrow();
|
|
74
|
-
expect(r.capabilities.supportsFragmentRecall).toBe(true);
|
|
75
|
-
});
|
|
76
|
-
|
|
77
|
-
test('degrades loudly when no backend is wired — never a silent empty', async () => {
|
|
78
|
-
const r = FragmentSemanticRetriever.create({}).orThrow();
|
|
79
|
-
expect(await r.retrieve({ semantic: 'hi' })).toFailWith(FRAGMENT_SEMANTIC_UNWIRED_MESSAGE);
|
|
80
|
-
});
|
|
81
|
-
|
|
82
|
-
test('returns the per-fragment hits (target + locator + score) in backend order', async () => {
|
|
83
|
-
const hits = [hit('knowledge', 'doc-a', 0, 5, 0.9), hit('knowledge', 'doc-a', 20, 25, 0.4)];
|
|
84
|
-
const r = FragmentSemanticRetriever.create({
|
|
85
|
-
backend: { fragmentIndex: new FakeFragmentIndex(hits), embedQuery: okEmbed }
|
|
86
|
-
}).orThrow();
|
|
87
|
-
expect(await r.retrieve({ semantic: 'q' })).toSucceedAndSatisfy(
|
|
88
|
-
(result: ReadonlyArray<IVectorQueryHit>) => {
|
|
89
|
-
expect(result).toEqual(hits);
|
|
90
|
-
expect(result[0].locator).toEqual(loc(0, 5));
|
|
91
|
-
expect(result[1].locator).toEqual(loc(20, 25));
|
|
92
|
-
}
|
|
93
|
-
);
|
|
94
|
-
});
|
|
95
|
-
|
|
96
|
-
test('forwards topK and maxPerRecord to the fragment index', async () => {
|
|
97
|
-
const fragmentIndex = new FakeFragmentIndex([hit('knowledge', 'doc-a', 0, 5, 0.9)]);
|
|
98
|
-
const r = FragmentSemanticRetriever.create({
|
|
99
|
-
backend: { fragmentIndex, embedQuery: okEmbed }
|
|
100
|
-
}).orThrow();
|
|
101
|
-
expect(await r.retrieve({ semantic: 'q', topK: 3, maxPerRecord: 1 })).toSucceed();
|
|
102
|
-
expect(fragmentIndex.lastTopK).toBe(3);
|
|
103
|
-
expect(fragmentIndex.lastMaxPerRecord).toBe(1);
|
|
104
|
-
});
|
|
105
|
-
|
|
106
|
-
test('defaults topK to 10 and leaves maxPerRecord undefined when the query omits them', async () => {
|
|
107
|
-
const fragmentIndex = new FakeFragmentIndex([hit('knowledge', 'doc-a', 0, 5, 0.9)]);
|
|
108
|
-
const r = FragmentSemanticRetriever.create({
|
|
109
|
-
backend: { fragmentIndex, embedQuery: okEmbed }
|
|
110
|
-
}).orThrow();
|
|
111
|
-
expect(await r.retrieve({ semantic: 'q' })).toSucceed();
|
|
112
|
-
expect(fragmentIndex.lastTopK).toBe(10);
|
|
113
|
-
expect(fragmentIndex.lastMaxPerRecord).toBeUndefined();
|
|
114
|
-
});
|
|
115
|
-
|
|
116
|
-
test('fails loudly when the embedder fails', async () => {
|
|
117
|
-
const r = FragmentSemanticRetriever.create({
|
|
118
|
-
backend: {
|
|
119
|
-
fragmentIndex: new FakeFragmentIndex([]),
|
|
120
|
-
embedQuery: () => Promise.resolve(fail('no embed model'))
|
|
121
|
-
}
|
|
122
|
-
}).orThrow();
|
|
123
|
-
expect(await r.retrieve({ semantic: 'q' })).toFailWith(
|
|
124
|
-
/fragment recall: query embedding failed: no embed model/i
|
|
125
|
-
);
|
|
126
|
-
});
|
|
127
|
-
|
|
128
|
-
test('fails loudly when the fragment backend fails', async () => {
|
|
129
|
-
const r = FragmentSemanticRetriever.create({
|
|
130
|
-
backend: { fragmentIndex: new FakeFragmentIndex([], true), embedQuery: okEmbed }
|
|
131
|
-
}).orThrow();
|
|
132
|
-
expect(await r.retrieve({ semantic: 'q' })).toFailWith(
|
|
133
|
-
/fragment recall: fragment query failed: fragment backend down/i
|
|
134
|
-
);
|
|
135
|
-
});
|
|
136
|
-
|
|
137
|
-
test('normalizes a rejecting embedder into a Failure (never escapes as a rejection)', async () => {
|
|
138
|
-
const r = FragmentSemanticRetriever.create({
|
|
139
|
-
backend: {
|
|
140
|
-
fragmentIndex: new FakeFragmentIndex([]),
|
|
141
|
-
embedQuery: () => Promise.reject(new Error('embedder blew up'))
|
|
142
|
-
}
|
|
143
|
-
}).orThrow();
|
|
144
|
-
expect(await r.retrieve({ semantic: 'q' })).toFailWith(
|
|
145
|
-
/fragment recall: query embedding failed: .*embedder blew up/i
|
|
146
|
-
);
|
|
147
|
-
});
|
|
148
|
-
|
|
149
|
-
test('normalizes a rejecting fragment backend into a Failure', async () => {
|
|
150
|
-
const rejectingIndex: IFragmentVectorIndex = {
|
|
151
|
-
addFragments: (__t: IEdgeTarget, f: ReadonlyArray<IEmbeddedFragment>) =>
|
|
152
|
-
Promise.resolve(succeed(f.length)),
|
|
153
|
-
remove: (t: IEdgeTarget) => Promise.resolve(succeed(t)),
|
|
154
|
-
query: () => Promise.reject(new Error('socket hangup'))
|
|
155
|
-
};
|
|
156
|
-
const r = FragmentSemanticRetriever.create({
|
|
157
|
-
backend: { fragmentIndex: rejectingIndex, embedQuery: okEmbed }
|
|
158
|
-
}).orThrow();
|
|
159
|
-
expect(await r.retrieve({ semantic: 'q' })).toFailWith(
|
|
160
|
-
/fragment recall: fragment query failed: .*socket hangup/i
|
|
161
|
-
);
|
|
162
|
-
});
|
|
163
|
-
});
|
|
@@ -1,329 +0,0 @@
|
|
|
1
|
-
/*
|
|
2
|
-
* Copyright (c) 2026 Erik Fortune
|
|
3
|
-
* SPDX-License-Identifier: MIT
|
|
4
|
-
*/
|
|
5
|
-
|
|
6
|
-
import '@fgv/ts-utils-jest';
|
|
7
|
-
import {
|
|
8
|
-
IEdgeTarget,
|
|
9
|
-
IIndexedMemoryRecord,
|
|
10
|
-
IMemoryRecord,
|
|
11
|
-
Kind,
|
|
12
|
-
LinkTraversalRetriever,
|
|
13
|
-
LINK_TRAVERSAL_NO_SEED_MESSAGE,
|
|
14
|
-
LINK_TRAVERSAL_UNWIRED_MESSAGE,
|
|
15
|
-
MemoryId,
|
|
16
|
-
MemoryIndex,
|
|
17
|
-
MemoryScopeKey,
|
|
18
|
-
envelopeConverter
|
|
19
|
-
} from '../../../index';
|
|
20
|
-
|
|
21
|
-
const DEFAULT_SCOPE: string = 'experience';
|
|
22
|
-
|
|
23
|
-
/** A link target authored either as a bare id (same-scope) or an explicit `(scope, id)`. */
|
|
24
|
-
type LinkSpec = string | { readonly id: string; readonly scope: string };
|
|
25
|
-
|
|
26
|
-
interface IEntrySpec {
|
|
27
|
-
readonly id: string;
|
|
28
|
-
readonly scope?: string;
|
|
29
|
-
readonly kind?: string;
|
|
30
|
-
readonly tags?: ReadonlyArray<string>;
|
|
31
|
-
readonly updated?: number;
|
|
32
|
-
readonly seq?: number;
|
|
33
|
-
readonly links?: ReadonlyArray<LinkSpec>;
|
|
34
|
-
readonly rank?: number;
|
|
35
|
-
}
|
|
36
|
-
|
|
37
|
-
/** A scope-qualified traversal seed (defaults to the fixture's default scope). */
|
|
38
|
-
function seed(id: string, scope: string = DEFAULT_SCOPE): IEdgeTarget {
|
|
39
|
-
return { scope: scope as MemoryScopeKey, id: id as MemoryId };
|
|
40
|
-
}
|
|
41
|
-
|
|
42
|
-
function makeEntry(spec: IEntrySpec): IIndexedMemoryRecord {
|
|
43
|
-
const scope: string = spec.scope ?? DEFAULT_SCOPE;
|
|
44
|
-
const record: IMemoryRecord<unknown> = {
|
|
45
|
-
envelope: envelopeConverter
|
|
46
|
-
.convert({
|
|
47
|
-
id: spec.id,
|
|
48
|
-
entityId: spec.id,
|
|
49
|
-
kind: spec.kind ?? 'experience',
|
|
50
|
-
tags: spec.tags ?? [],
|
|
51
|
-
// A bare link id defaults its target scope to the source record's own
|
|
52
|
-
// scope (the same-conversation case); an object carries an explicit scope.
|
|
53
|
-
links: (spec.links ?? []).map((l) =>
|
|
54
|
-
typeof l === 'string'
|
|
55
|
-
? { type: 'rel', target: { scope, id: l } }
|
|
56
|
-
: { type: 'rel', target: { scope: l.scope, id: l.id } }
|
|
57
|
-
),
|
|
58
|
-
created: 0,
|
|
59
|
-
updated: spec.updated ?? 0,
|
|
60
|
-
seq: spec.seq ?? 0,
|
|
61
|
-
contentHash: 'h',
|
|
62
|
-
...(spec.rank !== undefined ? { rank: spec.rank } : {}),
|
|
63
|
-
provenance: { source: 'agent' }
|
|
64
|
-
})
|
|
65
|
-
.orThrow(),
|
|
66
|
-
body: `body-${spec.id}`
|
|
67
|
-
};
|
|
68
|
-
return { scope: scope as MemoryScopeKey, record };
|
|
69
|
-
}
|
|
70
|
-
|
|
71
|
-
function buildIndex(specs: ReadonlyArray<IEntrySpec>): MemoryIndex {
|
|
72
|
-
const index = MemoryIndex.create().orThrow();
|
|
73
|
-
index.rebuild(specs.map(makeEntry)).orThrow();
|
|
74
|
-
return index;
|
|
75
|
-
}
|
|
76
|
-
|
|
77
|
-
function ids(records: ReadonlyArray<IMemoryRecord<unknown>>): string[] {
|
|
78
|
-
return records.map((r) => r.envelope.id as string);
|
|
79
|
-
}
|
|
80
|
-
|
|
81
|
-
describe('LinkTraversalRetriever', () => {
|
|
82
|
-
test('reports the link-traversal capability', () => {
|
|
83
|
-
const index = buildIndex([]);
|
|
84
|
-
const retriever = LinkTraversalRetriever.create(index).orThrow();
|
|
85
|
-
expect(retriever.capabilities).toEqual({
|
|
86
|
-
supportsSemanticRecall: false,
|
|
87
|
-
supportsTemporalQuery: false,
|
|
88
|
-
supportsLinkTraversal: true
|
|
89
|
-
});
|
|
90
|
-
});
|
|
91
|
-
|
|
92
|
-
describe('outbound traversal (linkedFrom)', () => {
|
|
93
|
-
test('returns the direct outbound neighbors at the default single hop', async () => {
|
|
94
|
-
const index = buildIndex([
|
|
95
|
-
{ id: 'a', links: ['b', 'c'] },
|
|
96
|
-
{ id: 'b', updated: 20 },
|
|
97
|
-
{ id: 'c', updated: 10 }
|
|
98
|
-
]);
|
|
99
|
-
const retriever = LinkTraversalRetriever.create(index).orThrow();
|
|
100
|
-
expect(await retriever.retrieve({ linkedFrom: seed('a') })).toSucceedAndSatisfy((records) => {
|
|
101
|
-
// Recency-ordered: b (updated 20) before c (updated 10). 'a' (the seed) excluded.
|
|
102
|
-
expect(ids(records)).toEqual(['b', 'c']);
|
|
103
|
-
});
|
|
104
|
-
});
|
|
105
|
-
|
|
106
|
-
test('stops at the default single hop (does not reach 2-hop neighbors)', async () => {
|
|
107
|
-
const index = buildIndex([{ id: 'a', links: ['b'] }, { id: 'b', links: ['c'] }, { id: 'c' }]);
|
|
108
|
-
const retriever = LinkTraversalRetriever.create(index).orThrow();
|
|
109
|
-
expect(await retriever.retrieve({ linkedFrom: seed('a') })).toSucceedAndSatisfy((records) => {
|
|
110
|
-
expect(ids(records)).toEqual(['b']);
|
|
111
|
-
});
|
|
112
|
-
});
|
|
113
|
-
|
|
114
|
-
test('follows multiple hops when hops is raised', async () => {
|
|
115
|
-
const index = buildIndex([{ id: 'a', links: ['b'] }, { id: 'b', links: ['c'] }, { id: 'c' }]);
|
|
116
|
-
const retriever = LinkTraversalRetriever.create(index).orThrow();
|
|
117
|
-
expect(await retriever.retrieve({ linkedFrom: seed('a'), hops: 2 })).toSucceedAndSatisfy((records) => {
|
|
118
|
-
expect(ids(records).sort()).toEqual(['b', 'c']);
|
|
119
|
-
});
|
|
120
|
-
});
|
|
121
|
-
});
|
|
122
|
-
|
|
123
|
-
describe('orderBy axis', () => {
|
|
124
|
-
function seedIndex(): MemoryIndex {
|
|
125
|
-
// Seed 'a' links to three ranked neighbors. `rank` and `updated` are
|
|
126
|
-
// deliberately INVERTED so the rank order (n3,n2,n1) is the exact reverse of
|
|
127
|
-
// the recency order (n1,n2,n3) — proving orderBy actually re-sorts.
|
|
128
|
-
return buildIndex([
|
|
129
|
-
{ id: 'a', links: ['n1', 'n3', 'n2'] },
|
|
130
|
-
{ id: 'n1', rank: 1, updated: 300, seq: 1 },
|
|
131
|
-
{ id: 'n3', rank: 3, updated: 100, seq: 3 },
|
|
132
|
-
{ id: 'n2', rank: 2, updated: 200, seq: 2 }
|
|
133
|
-
]);
|
|
134
|
-
}
|
|
135
|
-
|
|
136
|
-
test("orderBy 'rank' orders reached records by rank descending", async () => {
|
|
137
|
-
const retriever = LinkTraversalRetriever.create(seedIndex()).orThrow();
|
|
138
|
-
expect(await retriever.retrieve({ linkedFrom: seed('a'), orderBy: 'rank' })).toSucceedAndSatisfy(
|
|
139
|
-
(records) => {
|
|
140
|
-
expect(ids(records)).toEqual(['n3', 'n2', 'n1']);
|
|
141
|
-
}
|
|
142
|
-
);
|
|
143
|
-
});
|
|
144
|
-
|
|
145
|
-
test('orderBy absent is unchanged recency order', async () => {
|
|
146
|
-
const retriever = LinkTraversalRetriever.create(seedIndex()).orThrow();
|
|
147
|
-
expect(await retriever.retrieve({ linkedFrom: seed('a') })).toSucceedAndSatisfy((records) => {
|
|
148
|
-
// Recency: most-recently-updated first → n1(300), n2(200), n3(100).
|
|
149
|
-
expect(ids(records)).toEqual(['n1', 'n2', 'n3']);
|
|
150
|
-
});
|
|
151
|
-
});
|
|
152
|
-
|
|
153
|
-
test("orderBy 'rank' composes with { limit, offset }", async () => {
|
|
154
|
-
const retriever = LinkTraversalRetriever.create(seedIndex()).orThrow();
|
|
155
|
-
expect(
|
|
156
|
-
await retriever.retrieve({ linkedFrom: seed('a'), orderBy: 'rank', limit: 1, offset: 1 })
|
|
157
|
-
).toSucceedAndSatisfy((records) => {
|
|
158
|
-
expect(ids(records)).toEqual(['n2']);
|
|
159
|
-
});
|
|
160
|
-
});
|
|
161
|
-
});
|
|
162
|
-
|
|
163
|
-
describe('inbound traversal (linkedTo)', () => {
|
|
164
|
-
test('returns the records whose edges point at the seed (backlinks)', async () => {
|
|
165
|
-
const index = buildIndex([
|
|
166
|
-
{ id: 'a', links: ['target'], updated: 30 },
|
|
167
|
-
{ id: 'b', links: ['target'], updated: 10 },
|
|
168
|
-
{ id: 'target' }
|
|
169
|
-
]);
|
|
170
|
-
const retriever = LinkTraversalRetriever.create(index).orThrow();
|
|
171
|
-
expect(await retriever.retrieve({ linkedTo: seed('target') })).toSucceedAndSatisfy((records) => {
|
|
172
|
-
expect(ids(records)).toEqual(['a', 'b']);
|
|
173
|
-
});
|
|
174
|
-
});
|
|
175
|
-
|
|
176
|
-
test('reaches ONLY the same-scope inbound source when a TARGET stem is reused across scopes', async () => {
|
|
177
|
-
// 'shared' exists in scope a and scope b; src-a@a links {a, shared} and
|
|
178
|
-
// src-b@b links {b, shared}. Seeding linkedTo {a, shared} must reach ONLY
|
|
179
|
-
// src-a — backlinks disambiguate on the target's (scope, id), not a bare id.
|
|
180
|
-
const index = buildIndex([
|
|
181
|
-
{ id: 'src-a', scope: 'a', links: ['shared'], tags: ['src-a'] },
|
|
182
|
-
{ id: 'src-b', scope: 'b', links: ['shared'], tags: ['src-b'] },
|
|
183
|
-
{ id: 'shared', scope: 'a' },
|
|
184
|
-
{ id: 'shared', scope: 'b' }
|
|
185
|
-
]);
|
|
186
|
-
const retriever = LinkTraversalRetriever.create(index).orThrow();
|
|
187
|
-
expect(await retriever.retrieve({ linkedTo: seed('shared', 'a') })).toSucceedAndSatisfy((records) => {
|
|
188
|
-
expect(records).toHaveLength(1);
|
|
189
|
-
expect(records[0].envelope.tags).toEqual(['src-a']);
|
|
190
|
-
});
|
|
191
|
-
// Symmetric: seeding the b-scope target reaches only src-b.
|
|
192
|
-
expect(await retriever.retrieve({ linkedTo: seed('shared', 'b') })).toSucceedAndSatisfy((records) => {
|
|
193
|
-
expect(records).toHaveLength(1);
|
|
194
|
-
expect(records[0].envelope.tags).toEqual(['src-b']);
|
|
195
|
-
});
|
|
196
|
-
});
|
|
197
|
-
});
|
|
198
|
-
|
|
199
|
-
describe('cycle safety', () => {
|
|
200
|
-
test('terminates on a self-loop and excludes the seed', async () => {
|
|
201
|
-
const index = buildIndex([{ id: 'a', links: ['a'] }]);
|
|
202
|
-
const retriever = LinkTraversalRetriever.create(index).orThrow();
|
|
203
|
-
expect(await retriever.retrieve({ linkedFrom: seed('a'), hops: 5 })).toSucceedAndSatisfy((records) => {
|
|
204
|
-
expect(records).toHaveLength(0);
|
|
205
|
-
});
|
|
206
|
-
});
|
|
207
|
-
|
|
208
|
-
test('terminates on a multi-hop cycle without revisiting', async () => {
|
|
209
|
-
const index = buildIndex([
|
|
210
|
-
{ id: 'a', links: ['b'] },
|
|
211
|
-
{ id: 'b', links: ['c'] },
|
|
212
|
-
{ id: 'c', links: ['a'] }
|
|
213
|
-
]);
|
|
214
|
-
const retriever = LinkTraversalRetriever.create(index).orThrow();
|
|
215
|
-
expect(await retriever.retrieve({ linkedFrom: seed('a'), hops: 10 })).toSucceedAndSatisfy((records) => {
|
|
216
|
-
// a→b→c→a: reaches b and c, then the edge back to the seed is pruned.
|
|
217
|
-
expect(ids(records).sort()).toEqual(['b', 'c']);
|
|
218
|
-
});
|
|
219
|
-
});
|
|
220
|
-
});
|
|
221
|
-
|
|
222
|
-
test('traverses a cross-kind edge (experience derivedFrom a knowledge doc)', async () => {
|
|
223
|
-
const index = buildIndex([
|
|
224
|
-
{
|
|
225
|
-
id: 'turn-5',
|
|
226
|
-
scope: 'conversations/conv-1',
|
|
227
|
-
kind: 'summarized-turn',
|
|
228
|
-
links: [{ id: 'doc-1', scope: 'knowledge' }]
|
|
229
|
-
},
|
|
230
|
-
{ id: 'doc-1', scope: 'knowledge', kind: 'knowledge' }
|
|
231
|
-
]);
|
|
232
|
-
const retriever = LinkTraversalRetriever.create(index).orThrow();
|
|
233
|
-
expect(
|
|
234
|
-
await retriever.retrieve({ linkedFrom: seed('turn-5', 'conversations/conv-1') })
|
|
235
|
-
).toSucceedAndSatisfy((records) => {
|
|
236
|
-
expect(ids(records)).toEqual(['doc-1']);
|
|
237
|
-
expect(records[0].envelope.kind).toBe('knowledge');
|
|
238
|
-
});
|
|
239
|
-
});
|
|
240
|
-
|
|
241
|
-
describe('post-filtering and bounds', () => {
|
|
242
|
-
test('applies the kind pre-filter to the reached records', async () => {
|
|
243
|
-
const index = buildIndex([
|
|
244
|
-
{ id: 'a', links: ['b', 'c'] },
|
|
245
|
-
{ id: 'b', kind: 'keep' },
|
|
246
|
-
{ id: 'c', kind: 'drop' }
|
|
247
|
-
]);
|
|
248
|
-
const retriever = LinkTraversalRetriever.create(index).orThrow();
|
|
249
|
-
expect(
|
|
250
|
-
await retriever.retrieve({ linkedFrom: seed('a'), kind: 'keep' as unknown as Kind })
|
|
251
|
-
).toSucceedAndSatisfy((records) => {
|
|
252
|
-
expect(ids(records)).toEqual(['b']);
|
|
253
|
-
});
|
|
254
|
-
});
|
|
255
|
-
|
|
256
|
-
test('applies the limit after ordering', async () => {
|
|
257
|
-
const index = buildIndex([
|
|
258
|
-
{ id: 'a', links: ['b', 'c', 'd'] },
|
|
259
|
-
{ id: 'b', updated: 30 },
|
|
260
|
-
{ id: 'c', updated: 20 },
|
|
261
|
-
{ id: 'd', updated: 10 }
|
|
262
|
-
]);
|
|
263
|
-
const retriever = LinkTraversalRetriever.create(index).orThrow();
|
|
264
|
-
expect(await retriever.retrieve({ linkedFrom: seed('a'), limit: 2 })).toSucceedAndSatisfy((records) => {
|
|
265
|
-
expect(ids(records)).toEqual(['b', 'c']);
|
|
266
|
-
});
|
|
267
|
-
});
|
|
268
|
-
|
|
269
|
-
test('returns empty when the seed is not in the index', async () => {
|
|
270
|
-
const index = buildIndex([{ id: 'a', links: ['b'] }, { id: 'b' }]);
|
|
271
|
-
const retriever = LinkTraversalRetriever.create(index).orThrow();
|
|
272
|
-
expect(await retriever.retrieve({ linkedFrom: seed('missing') })).toSucceedWith([]);
|
|
273
|
-
});
|
|
274
|
-
|
|
275
|
-
test('reaches ONLY the same-scope target when an id is reused across scopes', async () => {
|
|
276
|
-
// 'seed' (scope a) links a bare 'dup' → the edge target is {scope a, id dup}.
|
|
277
|
-
// Two records share the stem 'dup' (scopes a and b); the scoped edge must
|
|
278
|
-
// reach ONLY dup@a, never dup@b — the whole point of scope-qualified targets.
|
|
279
|
-
const index = buildIndex([
|
|
280
|
-
{ id: 'seed', scope: 'a', links: ['dup'] },
|
|
281
|
-
{ id: 'dup', scope: 'a', tags: ['in-a'] },
|
|
282
|
-
{ id: 'dup', scope: 'b', tags: ['in-b'] }
|
|
283
|
-
]);
|
|
284
|
-
const retriever = LinkTraversalRetriever.create(index).orThrow();
|
|
285
|
-
expect(await retriever.retrieve({ linkedFrom: seed('seed', 'a') })).toSucceedAndSatisfy((records) => {
|
|
286
|
-
expect(records).toHaveLength(1);
|
|
287
|
-
expect(records[0].envelope.tags).toEqual(['in-a']);
|
|
288
|
-
});
|
|
289
|
-
});
|
|
290
|
-
|
|
291
|
-
test('an explicit cross-scope edge reaches the other scope', async () => {
|
|
292
|
-
// The same fixture, but the edge names dup@b explicitly → traversal follows
|
|
293
|
-
// it to the b-scope record, proving explicit scope is honored verbatim.
|
|
294
|
-
const index = buildIndex([
|
|
295
|
-
{ id: 'seed', scope: 'a', links: [{ id: 'dup', scope: 'b' }] },
|
|
296
|
-
{ id: 'dup', scope: 'a', tags: ['in-a'] },
|
|
297
|
-
{ id: 'dup', scope: 'b', tags: ['in-b'] }
|
|
298
|
-
]);
|
|
299
|
-
const retriever = LinkTraversalRetriever.create(index).orThrow();
|
|
300
|
-
expect(await retriever.retrieve({ linkedFrom: seed('seed', 'a') })).toSucceedAndSatisfy((records) => {
|
|
301
|
-
expect(records).toHaveLength(1);
|
|
302
|
-
expect(records[0].envelope.tags).toEqual(['in-b']);
|
|
303
|
-
});
|
|
304
|
-
});
|
|
305
|
-
});
|
|
306
|
-
|
|
307
|
-
describe('loud degradation', () => {
|
|
308
|
-
test('fails when no seed (linkedFrom / linkedTo) is supplied', async () => {
|
|
309
|
-
const index = buildIndex([{ id: 'a' }]);
|
|
310
|
-
const retriever = LinkTraversalRetriever.create(index).orThrow();
|
|
311
|
-
expect(await retriever.retrieve({ hops: 2 })).toFailWith(LINK_TRAVERSAL_NO_SEED_MESSAGE);
|
|
312
|
-
});
|
|
313
|
-
});
|
|
314
|
-
});
|
|
315
|
-
|
|
316
|
-
describe('LINK_TRAVERSAL_UNWIRED_MESSAGE constant', () => {
|
|
317
|
-
test('has the stable public message non-link retrievers use to degrade loudly', () => {
|
|
318
|
-
// The link-traversal retriever supports the axis, so it never emits this
|
|
319
|
-
// message; the constant is the shared one the non-link v1 retrievers raise
|
|
320
|
-
// (asserted here to keep the public string stable).
|
|
321
|
-
expect(LINK_TRAVERSAL_UNWIRED_MESSAGE).toMatch(/link traversal requires a backlink index/i);
|
|
322
|
-
});
|
|
323
|
-
|
|
324
|
-
test('a link query against the link-capable retriever still succeeds', async () => {
|
|
325
|
-
const index = buildIndex([{ id: 'a', links: ['b'] }, { id: 'b' }]);
|
|
326
|
-
const retriever = LinkTraversalRetriever.create(index).orThrow();
|
|
327
|
-
expect(await retriever.retrieve({ linkedFrom: seed('a') })).toSucceed();
|
|
328
|
-
});
|
|
329
|
-
});
|