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

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.
Files changed (341) hide show
  1. package/dist/packlets/ingest/orchestrator.js +11 -1
  2. package/dist/packlets/ingest/orchestrator.js.map +1 -1
  3. package/dist/packlets/observe/memoryObservationStore.js +6 -0
  4. package/dist/packlets/observe/memoryObservationStore.js.map +1 -1
  5. package/dist/packlets/observe/observer.js.map +1 -1
  6. package/dist/packlets/store/fileTreeMemoryStore.js +52 -131
  7. package/dist/packlets/store/fileTreeMemoryStore.js.map +1 -1
  8. package/dist/packlets/store/vectorMaintenance.js +251 -0
  9. package/dist/packlets/store/vectorMaintenance.js.map +1 -0
  10. package/dist/packlets/vector/inMemoryCosineIndex.js +81 -18
  11. package/dist/packlets/vector/inMemoryCosineIndex.js.map +1 -1
  12. package/dist/packlets/vector/inMemoryFragmentCosineIndex.js +7 -0
  13. package/dist/packlets/vector/inMemoryFragmentCosineIndex.js.map +1 -1
  14. package/dist/packlets/vector/vectorIndex.js.map +1 -1
  15. package/dist/ts-agent-memory.d.ts +297 -66
  16. package/lib/packlets/ingest/orchestrator.d.ts.map +1 -1
  17. package/lib/packlets/ingest/orchestrator.js +11 -1
  18. package/lib/packlets/ingest/orchestrator.js.map +1 -1
  19. package/lib/packlets/observe/memoryObservationStore.d.ts.map +1 -1
  20. package/lib/packlets/observe/memoryObservationStore.js +6 -0
  21. package/lib/packlets/observe/memoryObservationStore.js.map +1 -1
  22. package/lib/packlets/observe/observer.d.ts +61 -0
  23. package/lib/packlets/observe/observer.d.ts.map +1 -1
  24. package/lib/packlets/observe/observer.js.map +1 -1
  25. package/lib/packlets/store/fileTreeMemoryStore.d.ts +66 -59
  26. package/lib/packlets/store/fileTreeMemoryStore.d.ts.map +1 -1
  27. package/lib/packlets/store/fileTreeMemoryStore.js +52 -131
  28. package/lib/packlets/store/fileTreeMemoryStore.js.map +1 -1
  29. package/lib/packlets/store/vectorMaintenance.d.ts +149 -0
  30. package/lib/packlets/store/vectorMaintenance.d.ts.map +1 -0
  31. package/lib/packlets/store/vectorMaintenance.js +255 -0
  32. package/lib/packlets/store/vectorMaintenance.js.map +1 -0
  33. package/lib/packlets/vector/inMemoryCosineIndex.d.ts +30 -7
  34. package/lib/packlets/vector/inMemoryCosineIndex.d.ts.map +1 -1
  35. package/lib/packlets/vector/inMemoryCosineIndex.js +80 -17
  36. package/lib/packlets/vector/inMemoryCosineIndex.js.map +1 -1
  37. package/lib/packlets/vector/inMemoryFragmentCosineIndex.d.ts +7 -0
  38. package/lib/packlets/vector/inMemoryFragmentCosineIndex.d.ts.map +1 -1
  39. package/lib/packlets/vector/inMemoryFragmentCosineIndex.js +7 -0
  40. package/lib/packlets/vector/inMemoryFragmentCosineIndex.js.map +1 -1
  41. package/lib/packlets/vector/vectorIndex.d.ts +129 -1
  42. package/lib/packlets/vector/vectorIndex.d.ts.map +1 -1
  43. package/lib/packlets/vector/vectorIndex.js.map +1 -1
  44. package/package.json +17 -7
  45. package/.rush/temp/5667e36f1c0cc503a5c20a3ebff76e7b9a702d41.tar.log +0 -468
  46. package/.rush/temp/chunked-rush-logs/ts-agent-memory.build.chunks.jsonl +0 -9
  47. package/.rush/temp/operation/build/all.log +0 -9
  48. package/.rush/temp/operation/build/log-chunks.jsonl +0 -9
  49. package/.rush/temp/operation/build/state.json +0 -3
  50. package/.rush/temp/shrinkwrap-deps.json +0 -689
  51. package/config/api-extractor.json +0 -343
  52. package/config/jest.config.json +0 -14
  53. package/config/rig.json +0 -4
  54. package/dist/test/unit/converters/antagonistRoundTrip.test.js +0 -95
  55. package/dist/test/unit/converters/antagonistRoundTrip.test.js.map +0 -1
  56. package/dist/test/unit/converters/bodyConverterRegistry.test.js +0 -72
  57. package/dist/test/unit/converters/bodyConverterRegistry.test.js.map +0 -1
  58. package/dist/test/unit/converters/envelopeConverter.test.js +0 -313
  59. package/dist/test/unit/converters/envelopeConverter.test.js.map +0 -1
  60. package/dist/test/unit/index/memoryIndex.test.js +0 -214
  61. package/dist/test/unit/index/memoryIndex.test.js.map +0 -1
  62. package/dist/test/unit/ingest/antagonistCycleAndParity.test.js +0 -277
  63. package/dist/test/unit/ingest/antagonistCycleAndParity.test.js.map +0 -1
  64. package/dist/test/unit/ingest/cycleGuard.test.js +0 -81
  65. package/dist/test/unit/ingest/cycleGuard.test.js.map +0 -1
  66. package/dist/test/unit/ingest/dedupScope.test.js +0 -434
  67. package/dist/test/unit/ingest/dedupScope.test.js.map +0 -1
  68. package/dist/test/unit/ingest/orchestrator.test.js +0 -1058
  69. package/dist/test/unit/ingest/orchestrator.test.js.map +0 -1
  70. package/dist/test/unit/observe/memoryObservationStore.test.js +0 -118
  71. package/dist/test/unit/observe/memoryObservationStore.test.js.map +0 -1
  72. package/dist/test/unit/retrieve/fragmentSemanticRetriever.test.js +0 -116
  73. package/dist/test/unit/retrieve/fragmentSemanticRetriever.test.js.map +0 -1
  74. package/dist/test/unit/retrieve/linkTraversalRetriever.test.js +0 -257
  75. package/dist/test/unit/retrieve/linkTraversalRetriever.test.js.map +0 -1
  76. package/dist/test/unit/retrieve/retrievers.test.js +0 -768
  77. package/dist/test/unit/retrieve/retrievers.test.js.map +0 -1
  78. package/dist/test/unit/retrieve/temporalRetrievers.test.js +0 -182
  79. package/dist/test/unit/retrieve/temporalRetrievers.test.js.map +0 -1
  80. package/dist/test/unit/store/antagonistTemporalBoundary.test.js +0 -120
  81. package/dist/test/unit/store/antagonistTemporalBoundary.test.js.map +0 -1
  82. package/dist/test/unit/store/embedOnWrite.test.js +0 -317
  83. package/dist/test/unit/store/embedOnWrite.test.js.map +0 -1
  84. package/dist/test/unit/store/fileTreeMemoryStore.test.js +0 -778
  85. package/dist/test/unit/store/fileTreeMemoryStore.test.js.map +0 -1
  86. package/dist/test/unit/store/fragmentEmbedOnWrite.test.js +0 -255
  87. package/dist/test/unit/store/fragmentEmbedOnWrite.test.js.map +0 -1
  88. package/dist/test/unit/store/indexInjection.test.js +0 -432
  89. package/dist/test/unit/store/indexInjection.test.js.map +0 -1
  90. package/dist/test/unit/store/lenientOpen.test.js +0 -248
  91. package/dist/test/unit/store/lenientOpen.test.js.map +0 -1
  92. package/dist/test/unit/store/listScoped.test.js +0 -109
  93. package/dist/test/unit/store/listScoped.test.js.map +0 -1
  94. package/dist/test/unit/store/observations.test.js +0 -239
  95. package/dist/test/unit/store/observations.test.js.map +0 -1
  96. package/dist/test/unit/store/rankAxis.test.js +0 -254
  97. package/dist/test/unit/store/rankAxis.test.js.map +0 -1
  98. package/dist/test/unit/store/scopeEncoding.test.js +0 -24
  99. package/dist/test/unit/store/scopeEncoding.test.js.map +0 -1
  100. package/dist/test/unit/store/temporalStore.test.js +0 -398
  101. package/dist/test/unit/store/temporalStore.test.js.map +0 -1
  102. package/dist/test/unit/tools/memoryTools.test.js +0 -842
  103. package/dist/test/unit/tools/memoryTools.test.js.map +0 -1
  104. package/dist/test/unit/types/identityCodec.test.js +0 -187
  105. package/dist/test/unit/types/identityCodec.test.js.map +0 -1
  106. package/dist/test/unit/types/ids.test.js +0 -84
  107. package/dist/test/unit/types/ids.test.js.map +0 -1
  108. package/dist/test/unit/types/temporalCodec.test.js +0 -203
  109. package/dist/test/unit/types/temporalCodec.test.js.map +0 -1
  110. package/dist/test/unit/types/temporalPolicy.test.js +0 -83
  111. package/dist/test/unit/types/temporalPolicy.test.js.map +0 -1
  112. package/dist/test/unit/types/writePolicy.test.js +0 -331
  113. package/dist/test/unit/types/writePolicy.test.js.map +0 -1
  114. package/dist/test/unit/vector/fragmentConverters.test.js +0 -58
  115. package/dist/test/unit/vector/fragmentConverters.test.js.map +0 -1
  116. package/dist/test/unit/vector/inMemoryCosineIndex.test.js +0 -252
  117. package/dist/test/unit/vector/inMemoryCosineIndex.test.js.map +0 -1
  118. package/dist/test/unit/vector/inMemoryFragmentCosineIndex.test.js +0 -362
  119. package/dist/test/unit/vector/inMemoryFragmentCosineIndex.test.js.map +0 -1
  120. package/dist/test/unit/vector/vectorIndex.test.js +0 -51
  121. package/dist/test/unit/vector/vectorIndex.test.js.map +0 -1
  122. package/eslint.config.js +0 -15
  123. package/etc/ts-agent-memory.api.md +0 -940
  124. package/lib/test/unit/converters/antagonistRoundTrip.test.d.ts +0 -10
  125. package/lib/test/unit/converters/antagonistRoundTrip.test.d.ts.map +0 -1
  126. package/lib/test/unit/converters/antagonistRoundTrip.test.js +0 -97
  127. package/lib/test/unit/converters/antagonistRoundTrip.test.js.map +0 -1
  128. package/lib/test/unit/converters/bodyConverterRegistry.test.d.ts +0 -2
  129. package/lib/test/unit/converters/bodyConverterRegistry.test.d.ts.map +0 -1
  130. package/lib/test/unit/converters/bodyConverterRegistry.test.js +0 -74
  131. package/lib/test/unit/converters/bodyConverterRegistry.test.js.map +0 -1
  132. package/lib/test/unit/converters/envelopeConverter.test.d.ts +0 -2
  133. package/lib/test/unit/converters/envelopeConverter.test.d.ts.map +0 -1
  134. package/lib/test/unit/converters/envelopeConverter.test.js +0 -315
  135. package/lib/test/unit/converters/envelopeConverter.test.js.map +0 -1
  136. package/lib/test/unit/index/memoryIndex.test.d.ts +0 -2
  137. package/lib/test/unit/index/memoryIndex.test.d.ts.map +0 -1
  138. package/lib/test/unit/index/memoryIndex.test.js +0 -216
  139. package/lib/test/unit/index/memoryIndex.test.js.map +0 -1
  140. package/lib/test/unit/ingest/antagonistCycleAndParity.test.d.ts +0 -9
  141. package/lib/test/unit/ingest/antagonistCycleAndParity.test.d.ts.map +0 -1
  142. package/lib/test/unit/ingest/antagonistCycleAndParity.test.js +0 -279
  143. package/lib/test/unit/ingest/antagonistCycleAndParity.test.js.map +0 -1
  144. package/lib/test/unit/ingest/cycleGuard.test.d.ts +0 -2
  145. package/lib/test/unit/ingest/cycleGuard.test.d.ts.map +0 -1
  146. package/lib/test/unit/ingest/cycleGuard.test.js +0 -83
  147. package/lib/test/unit/ingest/cycleGuard.test.js.map +0 -1
  148. package/lib/test/unit/ingest/dedupScope.test.d.ts +0 -2
  149. package/lib/test/unit/ingest/dedupScope.test.d.ts.map +0 -1
  150. package/lib/test/unit/ingest/dedupScope.test.js +0 -436
  151. package/lib/test/unit/ingest/dedupScope.test.js.map +0 -1
  152. package/lib/test/unit/ingest/orchestrator.test.d.ts +0 -2
  153. package/lib/test/unit/ingest/orchestrator.test.d.ts.map +0 -1
  154. package/lib/test/unit/ingest/orchestrator.test.js +0 -1060
  155. package/lib/test/unit/ingest/orchestrator.test.js.map +0 -1
  156. package/lib/test/unit/observe/memoryObservationStore.test.d.ts +0 -2
  157. package/lib/test/unit/observe/memoryObservationStore.test.d.ts.map +0 -1
  158. package/lib/test/unit/observe/memoryObservationStore.test.js +0 -120
  159. package/lib/test/unit/observe/memoryObservationStore.test.js.map +0 -1
  160. package/lib/test/unit/retrieve/fragmentSemanticRetriever.test.d.ts +0 -2
  161. package/lib/test/unit/retrieve/fragmentSemanticRetriever.test.d.ts.map +0 -1
  162. package/lib/test/unit/retrieve/fragmentSemanticRetriever.test.js +0 -118
  163. package/lib/test/unit/retrieve/fragmentSemanticRetriever.test.js.map +0 -1
  164. package/lib/test/unit/retrieve/linkTraversalRetriever.test.d.ts +0 -2
  165. package/lib/test/unit/retrieve/linkTraversalRetriever.test.d.ts.map +0 -1
  166. package/lib/test/unit/retrieve/linkTraversalRetriever.test.js +0 -259
  167. package/lib/test/unit/retrieve/linkTraversalRetriever.test.js.map +0 -1
  168. package/lib/test/unit/retrieve/retrievers.test.d.ts +0 -2
  169. package/lib/test/unit/retrieve/retrievers.test.d.ts.map +0 -1
  170. package/lib/test/unit/retrieve/retrievers.test.js +0 -770
  171. package/lib/test/unit/retrieve/retrievers.test.js.map +0 -1
  172. package/lib/test/unit/retrieve/temporalRetrievers.test.d.ts +0 -2
  173. package/lib/test/unit/retrieve/temporalRetrievers.test.d.ts.map +0 -1
  174. package/lib/test/unit/retrieve/temporalRetrievers.test.js +0 -184
  175. package/lib/test/unit/retrieve/temporalRetrievers.test.js.map +0 -1
  176. package/lib/test/unit/store/antagonistTemporalBoundary.test.d.ts +0 -9
  177. package/lib/test/unit/store/antagonistTemporalBoundary.test.d.ts.map +0 -1
  178. package/lib/test/unit/store/antagonistTemporalBoundary.test.js +0 -122
  179. package/lib/test/unit/store/antagonistTemporalBoundary.test.js.map +0 -1
  180. package/lib/test/unit/store/embedOnWrite.test.d.ts +0 -2
  181. package/lib/test/unit/store/embedOnWrite.test.d.ts.map +0 -1
  182. package/lib/test/unit/store/embedOnWrite.test.js +0 -319
  183. package/lib/test/unit/store/embedOnWrite.test.js.map +0 -1
  184. package/lib/test/unit/store/fileTreeMemoryStore.test.d.ts +0 -2
  185. package/lib/test/unit/store/fileTreeMemoryStore.test.d.ts.map +0 -1
  186. package/lib/test/unit/store/fileTreeMemoryStore.test.js +0 -780
  187. package/lib/test/unit/store/fileTreeMemoryStore.test.js.map +0 -1
  188. package/lib/test/unit/store/fragmentEmbedOnWrite.test.d.ts +0 -2
  189. package/lib/test/unit/store/fragmentEmbedOnWrite.test.d.ts.map +0 -1
  190. package/lib/test/unit/store/fragmentEmbedOnWrite.test.js +0 -257
  191. package/lib/test/unit/store/fragmentEmbedOnWrite.test.js.map +0 -1
  192. package/lib/test/unit/store/indexInjection.test.d.ts +0 -2
  193. package/lib/test/unit/store/indexInjection.test.d.ts.map +0 -1
  194. package/lib/test/unit/store/indexInjection.test.js +0 -434
  195. package/lib/test/unit/store/indexInjection.test.js.map +0 -1
  196. package/lib/test/unit/store/lenientOpen.test.d.ts +0 -2
  197. package/lib/test/unit/store/lenientOpen.test.d.ts.map +0 -1
  198. package/lib/test/unit/store/lenientOpen.test.js +0 -250
  199. package/lib/test/unit/store/lenientOpen.test.js.map +0 -1
  200. package/lib/test/unit/store/listScoped.test.d.ts +0 -2
  201. package/lib/test/unit/store/listScoped.test.d.ts.map +0 -1
  202. package/lib/test/unit/store/listScoped.test.js +0 -111
  203. package/lib/test/unit/store/listScoped.test.js.map +0 -1
  204. package/lib/test/unit/store/observations.test.d.ts +0 -2
  205. package/lib/test/unit/store/observations.test.d.ts.map +0 -1
  206. package/lib/test/unit/store/observations.test.js +0 -241
  207. package/lib/test/unit/store/observations.test.js.map +0 -1
  208. package/lib/test/unit/store/rankAxis.test.d.ts +0 -2
  209. package/lib/test/unit/store/rankAxis.test.d.ts.map +0 -1
  210. package/lib/test/unit/store/rankAxis.test.js +0 -256
  211. package/lib/test/unit/store/rankAxis.test.js.map +0 -1
  212. package/lib/test/unit/store/scopeEncoding.test.d.ts +0 -2
  213. package/lib/test/unit/store/scopeEncoding.test.d.ts.map +0 -1
  214. package/lib/test/unit/store/scopeEncoding.test.js +0 -26
  215. package/lib/test/unit/store/scopeEncoding.test.js.map +0 -1
  216. package/lib/test/unit/store/temporalStore.test.d.ts +0 -2
  217. package/lib/test/unit/store/temporalStore.test.d.ts.map +0 -1
  218. package/lib/test/unit/store/temporalStore.test.js +0 -400
  219. package/lib/test/unit/store/temporalStore.test.js.map +0 -1
  220. package/lib/test/unit/tools/memoryTools.test.d.ts +0 -2
  221. package/lib/test/unit/tools/memoryTools.test.d.ts.map +0 -1
  222. package/lib/test/unit/tools/memoryTools.test.js +0 -844
  223. package/lib/test/unit/tools/memoryTools.test.js.map +0 -1
  224. package/lib/test/unit/types/identityCodec.test.d.ts +0 -2
  225. package/lib/test/unit/types/identityCodec.test.d.ts.map +0 -1
  226. package/lib/test/unit/types/identityCodec.test.js +0 -189
  227. package/lib/test/unit/types/identityCodec.test.js.map +0 -1
  228. package/lib/test/unit/types/ids.test.d.ts +0 -2
  229. package/lib/test/unit/types/ids.test.d.ts.map +0 -1
  230. package/lib/test/unit/types/ids.test.js +0 -86
  231. package/lib/test/unit/types/ids.test.js.map +0 -1
  232. package/lib/test/unit/types/temporalCodec.test.d.ts +0 -2
  233. package/lib/test/unit/types/temporalCodec.test.d.ts.map +0 -1
  234. package/lib/test/unit/types/temporalCodec.test.js +0 -205
  235. package/lib/test/unit/types/temporalCodec.test.js.map +0 -1
  236. package/lib/test/unit/types/temporalPolicy.test.d.ts +0 -2
  237. package/lib/test/unit/types/temporalPolicy.test.d.ts.map +0 -1
  238. package/lib/test/unit/types/temporalPolicy.test.js +0 -85
  239. package/lib/test/unit/types/temporalPolicy.test.js.map +0 -1
  240. package/lib/test/unit/types/writePolicy.test.d.ts +0 -2
  241. package/lib/test/unit/types/writePolicy.test.d.ts.map +0 -1
  242. package/lib/test/unit/types/writePolicy.test.js +0 -333
  243. package/lib/test/unit/types/writePolicy.test.js.map +0 -1
  244. package/lib/test/unit/vector/fragmentConverters.test.d.ts +0 -2
  245. package/lib/test/unit/vector/fragmentConverters.test.d.ts.map +0 -1
  246. package/lib/test/unit/vector/fragmentConverters.test.js +0 -60
  247. package/lib/test/unit/vector/fragmentConverters.test.js.map +0 -1
  248. package/lib/test/unit/vector/inMemoryCosineIndex.test.d.ts +0 -2
  249. package/lib/test/unit/vector/inMemoryCosineIndex.test.d.ts.map +0 -1
  250. package/lib/test/unit/vector/inMemoryCosineIndex.test.js +0 -254
  251. package/lib/test/unit/vector/inMemoryCosineIndex.test.js.map +0 -1
  252. package/lib/test/unit/vector/inMemoryFragmentCosineIndex.test.d.ts +0 -2
  253. package/lib/test/unit/vector/inMemoryFragmentCosineIndex.test.d.ts.map +0 -1
  254. package/lib/test/unit/vector/inMemoryFragmentCosineIndex.test.js +0 -364
  255. package/lib/test/unit/vector/inMemoryFragmentCosineIndex.test.js.map +0 -1
  256. package/lib/test/unit/vector/vectorIndex.test.d.ts +0 -2
  257. package/lib/test/unit/vector/vectorIndex.test.d.ts.map +0 -1
  258. package/lib/test/unit/vector/vectorIndex.test.js +0 -53
  259. package/lib/test/unit/vector/vectorIndex.test.js.map +0 -1
  260. package/rush-logs/ts-agent-memory.build.cache.log +0 -3
  261. package/rush-logs/ts-agent-memory.build.log +0 -9
  262. package/src/index.ts +0 -14
  263. package/src/packlets/converters/bodyConverterRegistry.ts +0 -105
  264. package/src/packlets/converters/envelopeConverter.ts +0 -233
  265. package/src/packlets/converters/index.ts +0 -7
  266. package/src/packlets/index/index.ts +0 -6
  267. package/src/packlets/index/memoryIndex.ts +0 -332
  268. package/src/packlets/ingest/cycleGuard.ts +0 -153
  269. package/src/packlets/ingest/hostStages.ts +0 -111
  270. package/src/packlets/ingest/index.ts +0 -9
  271. package/src/packlets/ingest/model.ts +0 -195
  272. package/src/packlets/ingest/orchestrator.ts +0 -968
  273. package/src/packlets/observe/index.ts +0 -7
  274. package/src/packlets/observe/memoryObservationStore.ts +0 -153
  275. package/src/packlets/observe/observer.ts +0 -119
  276. package/src/packlets/retrieve/fragmentSemanticRetriever.ts +0 -138
  277. package/src/packlets/retrieve/hybridRetriever.ts +0 -194
  278. package/src/packlets/retrieve/index.ts +0 -14
  279. package/src/packlets/retrieve/linkTraversalRetriever.ts +0 -158
  280. package/src/packlets/retrieve/recencyRetriever.ts +0 -54
  281. package/src/packlets/retrieve/retriever.ts +0 -291
  282. package/src/packlets/retrieve/semanticRetriever.ts +0 -152
  283. package/src/packlets/retrieve/structuredFilterRetriever.ts +0 -58
  284. package/src/packlets/retrieve/tagRetriever.ts +0 -58
  285. package/src/packlets/retrieve/temporalRetrievers.ts +0 -210
  286. package/src/packlets/store/fileTreeMemoryStore.ts +0 -1872
  287. package/src/packlets/store/index.ts +0 -7
  288. package/src/packlets/store/scopeEncoding.ts +0 -36
  289. package/src/packlets/tools/index.ts +0 -6
  290. package/src/packlets/tools/memoryTools.ts +0 -706
  291. package/src/packlets/types/envelope.ts +0 -196
  292. package/src/packlets/types/filenameSafety.ts +0 -57
  293. package/src/packlets/types/identityCodec.ts +0 -447
  294. package/src/packlets/types/ids.ts +0 -124
  295. package/src/packlets/types/index.ts +0 -11
  296. package/src/packlets/types/temporal.ts +0 -96
  297. package/src/packlets/types/writePolicy.ts +0 -612
  298. package/src/packlets/vector/fragmentConverters.ts +0 -55
  299. package/src/packlets/vector/inMemoryCosineIndex.ts +0 -196
  300. package/src/packlets/vector/inMemoryFragmentCosineIndex.ts +0 -289
  301. package/src/packlets/vector/index.ts +0 -9
  302. package/src/packlets/vector/vectorIndex.ts +0 -273
  303. package/src/test/unit/converters/antagonistRoundTrip.test.ts +0 -110
  304. package/src/test/unit/converters/bodyConverterRegistry.test.ts +0 -89
  305. package/src/test/unit/converters/envelopeConverter.test.ts +0 -418
  306. package/src/test/unit/index/memoryIndex.test.ts +0 -272
  307. package/src/test/unit/ingest/antagonistCycleAndParity.test.ts +0 -367
  308. package/src/test/unit/ingest/cycleGuard.test.ts +0 -110
  309. package/src/test/unit/ingest/dedupScope.test.ts +0 -542
  310. package/src/test/unit/ingest/orchestrator.test.ts +0 -1355
  311. package/src/test/unit/observe/memoryObservationStore.test.ts +0 -158
  312. package/src/test/unit/retrieve/fragmentSemanticRetriever.test.ts +0 -163
  313. package/src/test/unit/retrieve/linkTraversalRetriever.test.ts +0 -329
  314. package/src/test/unit/retrieve/retrievers.test.ts +0 -1018
  315. package/src/test/unit/retrieve/temporalRetrievers.test.ts +0 -226
  316. package/src/test/unit/store/antagonistTemporalBoundary.test.ts +0 -158
  317. package/src/test/unit/store/embedOnWrite.test.ts +0 -418
  318. package/src/test/unit/store/fileTreeMemoryStore.test.ts +0 -1041
  319. package/src/test/unit/store/fragmentEmbedOnWrite.test.ts +0 -349
  320. package/src/test/unit/store/indexInjection.test.ts +0 -550
  321. package/src/test/unit/store/lenientOpen.test.ts +0 -292
  322. package/src/test/unit/store/listScoped.test.ts +0 -138
  323. package/src/test/unit/store/observations.test.ts +0 -290
  324. package/src/test/unit/store/rankAxis.test.ts +0 -349
  325. package/src/test/unit/store/scopeEncoding.test.ts +0 -37
  326. package/src/test/unit/store/temporalStore.test.ts +0 -469
  327. package/src/test/unit/tools/memoryTools.test.ts +0 -1121
  328. package/src/test/unit/types/identityCodec.test.ts +0 -266
  329. package/src/test/unit/types/ids.test.ts +0 -94
  330. package/src/test/unit/types/temporalCodec.test.ts +0 -259
  331. package/src/test/unit/types/temporalPolicy.test.ts +0 -124
  332. package/src/test/unit/types/writePolicy.test.ts +0 -446
  333. package/src/test/unit/vector/fragmentConverters.test.ts +0 -80
  334. package/src/test/unit/vector/inMemoryCosineIndex.test.ts +0 -318
  335. package/src/test/unit/vector/inMemoryFragmentCosineIndex.test.ts +0 -477
  336. package/src/test/unit/vector/vectorIndex.test.ts +0 -64
  337. package/temp/build/lint/_eslint-5eVG3S6w.json +0 -306
  338. package/temp/build/typescript/ts_8nwakTlr.json +0 -1
  339. package/temp/ts-agent-memory.api.json +0 -21030
  340. package/temp/ts-agent-memory.api.md +0 -940
  341. package/tsconfig.json +0 -8
@@ -1,1355 +0,0 @@
1
- /*
2
- * Copyright (c) 2026 Erik Fortune
3
- * SPDX-License-Identifier: MIT
4
- */
5
-
6
- import '@fgv/ts-utils-jest';
7
- import { Converters, Logging, Result, fail, succeed } from '@fgv/ts-utils';
8
- import { FileTree } from '@fgv/ts-json-base';
9
- import {
10
- BodyConverterRegistry,
11
- CONTRADICTS_LINK_TYPE,
12
- DEFAULT_SIMILARITY_THRESHOLD,
13
- DEFAULT_SIMILARITY_TOP_K,
14
- DedupScope,
15
- EntityId,
16
- FileTreeMemoryStore,
17
- HOST_INGEST_PROVENANCE_SOURCE,
18
- IBodyConverterRegistry,
19
- ICandidateEdge,
20
- ICandidateRecord,
21
- IEdgeTarget,
22
- IEntityResolutionCandidate,
23
- IEntityResolver,
24
- IFactExtractor,
25
- IIdentityCodec,
26
- IIngestItem,
27
- IIngestItemResult,
28
- InMemoryCosineIndex,
29
- IMemoryClassification,
30
- IMemoryClassifier,
31
- IMemoryEnvelope,
32
- IMemoryRecord,
33
- IMemoryRecordSource,
34
- IMemoryStore,
35
- IProvenance,
36
- IScopedMemoryRecord,
37
- IRelationContext,
38
- IRelationExtractor,
39
- IVectorIndex,
40
- IVectorQueryHit,
41
- IWritePolicy,
42
- Kind,
43
- KnowledgeIdentityCodec,
44
- LinkType,
45
- LtmIdentityCodec,
46
- MemoryEmbedder,
47
- MtmIdentityCodec,
48
- MemoryId,
49
- MemoryIngestOrchestrator,
50
- MemoryScopeKey,
51
- ResolutionVerdict,
52
- Tag,
53
- TemporalIdentityCodec,
54
- TemporalVersionedPolicy,
55
- serializeMemoryFile
56
- } from '../../../index';
57
-
58
- // --- kinds --------------------------------------------------------------------
59
- const noteKind: Kind = 'note' as Kind;
60
- const factKind: Kind = 'fact' as Kind;
61
- const numKind: Kind = 'num' as Kind;
62
- const orphanKind: Kind = 'orphan' as Kind;
63
- const ltmKind: Kind = 'ltm' as Kind;
64
-
65
- // --- shared fixtures ----------------------------------------------------------
66
- let clockValue: number;
67
- const clock = (): number => clockValue;
68
-
69
- function mutableRoot(
70
- files: ReadonlyArray<{ path: string; contents: string }> = []
71
- ): FileTree.IMutableFileTreeDirectoryItem {
72
- const tree = FileTree.inMemory([...files], { mutable: true }).orThrow();
73
- const root = tree.getDirectory('/').orThrow();
74
- if (!FileTree.isMutableDirectoryItem(root)) {
75
- throw new Error('expected a mutable root directory');
76
- }
77
- return root;
78
- }
79
-
80
- function registry(): IBodyConverterRegistry {
81
- const reg = BodyConverterRegistry.create().orThrow();
82
- reg.register(noteKind, Converters.string);
83
- reg.register(factKind, Converters.string);
84
- reg.register(numKind, Converters.number);
85
- reg.register(orphanKind, Converters.string);
86
- reg.register(ltmKind, Converters.string);
87
- return reg;
88
- }
89
-
90
- const codecs: ReadonlyMap<Kind, IIdentityCodec> = new Map<Kind, IIdentityCodec>([
91
- [noteKind, new KnowledgeIdentityCodec()],
92
- [numKind, new KnowledgeIdentityCodec()],
93
- [ltmKind, new LtmIdentityCodec()],
94
- [factKind, TemporalIdentityCodec.create('facts').orThrow()]
95
- ]);
96
-
97
- const policies: ReadonlyMap<Kind, IWritePolicy> = new Map<Kind, IWritePolicy>([
98
- [factKind, TemporalVersionedPolicy.create().orThrow()]
99
- ]);
100
-
101
- // A deterministic embedder keyed by body text (three-dimensional vectors so
102
- // cosine relationships are controllable). Unknown bodies map to a distinct axis.
103
- const VECTORS: ReadonlyMap<string, ReadonlyArray<number>> = new Map<string, ReadonlyArray<number>>([
104
- ['apple pie', [1, 0, 0]],
105
- ['apple tart', [0.99, 0.14, 0]],
106
- ['banana bread', [0, 1, 0]]
107
- ]);
108
- const embed: MemoryEmbedder = (record) => {
109
- if (record.body === 'boom') {
110
- return Promise.resolve(fail('embed boom'));
111
- }
112
- const vec: ReadonlyArray<number> = VECTORS.get(record.body as string) ?? [0, 0, 1];
113
- return Promise.resolve(succeed(Float32Array.from(vec)));
114
- };
115
-
116
- // --- mock host stages ---------------------------------------------------------
117
- function classifier(fn: (item: IIngestItem) => Result<IMemoryClassification>): IMemoryClassifier {
118
- return { classify: (item) => Promise.resolve(fn(item)) };
119
- }
120
- function throwingClassifier(): IMemoryClassifier {
121
- return {
122
- classify: () => {
123
- throw new Error('classifier boom');
124
- }
125
- };
126
- }
127
- function extractor(
128
- fn: (item: IIngestItem, c: IMemoryClassification) => Result<ReadonlyArray<ICandidateRecord>>
129
- ): IFactExtractor {
130
- return { extract: (item, c) => Promise.resolve(fn(item, c)) };
131
- }
132
- function resolver(
133
- fn: (
134
- candidate: ICandidateRecord,
135
- similar: ReadonlyArray<IEntityResolutionCandidate>
136
- ) => Result<ResolutionVerdict>
137
- ): IEntityResolver {
138
- return { resolve: (candidate, similar) => Promise.resolve(fn(candidate, similar)) };
139
- }
140
- function relater(fn: (ctx: IRelationContext) => Result<ReadonlyArray<ICandidateEdge>>): IRelationExtractor {
141
- return { relate: (ctx) => Promise.resolve(fn(ctx)) };
142
- }
143
-
144
- const noEdges: IRelationExtractor = relater(() => succeed([]));
145
- const classifyNote: IMemoryClassifier = classifier(() => succeed({ kind: noteKind, confidence: 0.9 }));
146
-
147
- /** Extractor that emits one note candidate per item, body = item.content, entityId = item.id. */
148
- function oneNoteExtractor(): IFactExtractor {
149
- return extractor((item) => succeed([candidate(noteKind, item.id, item.content as string)]));
150
- }
151
-
152
- function candidate(
153
- kind: Kind,
154
- entityId: string,
155
- body: unknown,
156
- opts: {
157
- readonly tags?: ReadonlyArray<string>;
158
- readonly links?: ICandidateRecord['envelope']['links'];
159
- readonly provenance?: IProvenance;
160
- readonly temporal?: IMemoryEnvelope['temporal'];
161
- } = {}
162
- ): ICandidateRecord {
163
- return {
164
- envelope: {
165
- entityId: entityId as EntityId,
166
- kind,
167
- tags: (opts.tags ?? []) as ReadonlyArray<Tag>,
168
- links: opts.links ?? [],
169
- provenance: opts.provenance ?? { source: 'agent' },
170
- ...(opts.temporal !== undefined ? { temporal: opts.temporal } : {})
171
- },
172
- body
173
- };
174
- }
175
-
176
- /**
177
- * A scope-qualified target, authored as `scope#id` or a bare id defaulting to the
178
- * knowledge scope (where the note/num fixtures live). `kt` is the assertion-side
179
- * spelling of the same helper.
180
- */
181
- function scopedTarget(spec: string): IEdgeTarget {
182
- const hash: number = spec.indexOf('#');
183
- const scope: string = hash >= 0 ? spec.slice(0, hash) : 'knowledge';
184
- const id: string = hash >= 0 ? spec.slice(hash + 1) : spec;
185
- return { scope: scope as MemoryScopeKey, id: id as MemoryId };
186
- }
187
- function kt(id: string, scope: string = 'knowledge'): IEdgeTarget {
188
- return { scope: scope as MemoryScopeKey, id: id as MemoryId };
189
- }
190
-
191
- /** The scope-qualified reference of a candidate about to be written, by its entityId. */
192
- function srcOf(ctx: IRelationContext, entityId: string): IEdgeTarget {
193
- const found = ctx.candidates.find((rc) => rc.candidate.envelope.entityId === (entityId as EntityId));
194
- if (found === undefined) {
195
- throw new Error(`test relater: no candidate with entityId '${entityId}'`);
196
- }
197
- return found.id;
198
- }
199
-
200
- function candEdge(source: string, type: string, target: string, confidence?: number): ICandidateEdge {
201
- return {
202
- source: scopedTarget(source),
203
- edge: {
204
- type: type as LinkType,
205
- target: scopedTarget(target),
206
- ...(confidence !== undefined ? { confidence } : {})
207
- }
208
- };
209
- }
210
-
211
- interface IBuildParams {
212
- readonly files?: ReadonlyArray<{ path: string; contents: string }>;
213
- readonly registry?: IBodyConverterRegistry;
214
- readonly vectorIndex?: IVectorIndex;
215
- readonly embed?: MemoryEmbedder;
216
- }
217
-
218
- function buildStore(params: IBuildParams = {}): FileTreeMemoryStore {
219
- return FileTreeMemoryStore.create({
220
- root: mutableRoot(params.files),
221
- registry: params.registry ?? registry(),
222
- codecs,
223
- writePolicies: policies,
224
- clock,
225
- vectorIndex: params.vectorIndex,
226
- embed: params.embed
227
- }).orThrow();
228
- }
229
-
230
- interface IOrchestratorParams {
231
- readonly store: IMemoryStore;
232
- readonly registry?: IBodyConverterRegistry;
233
- readonly classifier?: IMemoryClassifier;
234
- readonly extractor?: IFactExtractor;
235
- readonly relationExtractor?: IRelationExtractor;
236
- readonly entityResolver?: IEntityResolver;
237
- readonly vectorIndex?: IVectorIndex;
238
- readonly embed?: MemoryEmbedder;
239
- readonly similarityThreshold?: number;
240
- readonly cycleGuard?: 'reject' | 'off';
241
- }
242
-
243
- function buildOrchestrator(params: IOrchestratorParams): MemoryIngestOrchestrator {
244
- return MemoryIngestOrchestrator.create({
245
- store: params.store,
246
- registry: params.registry ?? registry(),
247
- codecs,
248
- classifier: params.classifier ?? classifyNote,
249
- extractor: params.extractor ?? oneNoteExtractor(),
250
- relationExtractor: params.relationExtractor ?? noEdges,
251
- entityResolver: params.entityResolver,
252
- vectorIndex: params.vectorIndex,
253
- embed: params.embed,
254
- similarityThreshold: params.similarityThreshold,
255
- cycleGuard: params.cycleGuard
256
- }).orThrow();
257
- }
258
-
259
- /** A seeded note file with only `source` provenance (the additive-provenance baseline). */
260
- function seedNote(
261
- id: string,
262
- body: string,
263
- provenance: Record<string, unknown> = { source: 'agent' }
264
- ): {
265
- path: string;
266
- contents: string;
267
- } {
268
- const envelope: IMemoryEnvelope = {
269
- id: id as MemoryId,
270
- entityId: id as EntityId,
271
- kind: noteKind,
272
- tags: [],
273
- links: [],
274
- created: 1,
275
- updated: 1,
276
- seq: 4,
277
- contentHash: 'seed',
278
- provenance: provenance as unknown as IProvenance
279
- };
280
- return { path: `knowledge/${id}.md`, contents: serializeMemoryFile(envelope, body).orThrow() };
281
- }
282
-
283
- beforeEach(() => {
284
- clockValue = 1000;
285
- });
286
-
287
- describe('MemoryIngestOrchestrator', () => {
288
- describe('create', () => {
289
- test('constructs via the factory', () => {
290
- expect(
291
- MemoryIngestOrchestrator.create({
292
- store: buildStore(),
293
- registry: registry(),
294
- codecs,
295
- classifier: classifyNote,
296
- extractor: oneNoteExtractor(),
297
- relationExtractor: noEdges
298
- })
299
- ).toSucceed();
300
- });
301
-
302
- test('exposes the documented similarity defaults', () => {
303
- expect(DEFAULT_SIMILARITY_THRESHOLD).toBe(0.85);
304
- expect(DEFAULT_SIMILARITY_TOP_K).toBe(5);
305
- });
306
- });
307
-
308
- describe('single-item ingest (first-class path)', () => {
309
- test('classifies, extracts, and writes one record end-to-end with host-ingest provenance + derivedFrom', async () => {
310
- const store = buildStore();
311
- const orch = buildOrchestrator({ store });
312
- const sourceId: IEdgeTarget = {
313
- scope: 'conversations/c1' as MemoryScopeKey,
314
- id: 'turn-3' as MemoryId
315
- };
316
- const result = await orch.ingestItem({ id: 'doc-1', content: 'the sky is blue', sourceId });
317
- expect(result).toSucceedAndSatisfy((r: IIngestItemResult) => {
318
- expect(r.item.id).toBe('doc-1');
319
- expect(r.records).toHaveLength(1);
320
- const rec = r.records[0];
321
- expect(rec.disposition).toBe('written');
322
- expect(rec.resolution.verdict).toBe('new');
323
- expect(rec.id).toBe('doc-1');
324
- expect(rec.record?.envelope.provenance.source).toBe(HOST_INGEST_PROVENANCE_SOURCE);
325
- expect(rec.record?.envelope.provenance.derivedFrom).toEqual(sourceId);
326
- expect(rec.record?.body).toBe('the sky is blue');
327
- expect(rec.interlock).toBeUndefined();
328
- });
329
- expect(await store.get(noteKind, 'doc-1' as EntityId)).toSucceedAndSatisfy(
330
- (rec: IMemoryRecord<unknown> | undefined) => {
331
- expect(rec?.body).toBe('the sky is blue');
332
- }
333
- );
334
- });
335
-
336
- test('omits derivedFrom when the item carries no sourceId', async () => {
337
- const store = buildStore();
338
- const orch = buildOrchestrator({ store });
339
- const result = await orch.ingestItem({ id: 'doc-1', content: 'a fact' });
340
- expect(result).toSucceedAndSatisfy((r: IIngestItemResult) => {
341
- expect(r.records[0].record?.envelope.provenance.derivedFrom).toBeUndefined();
342
- expect(r.records[0].record?.envelope.provenance.source).toBe(HOST_INGEST_PROVENANCE_SOURCE);
343
- });
344
- });
345
-
346
- test('yields an empty record set when the extractor finds nothing memorable', async () => {
347
- const store = buildStore();
348
- const orch = buildOrchestrator({ store, extractor: extractor(() => succeed([])) });
349
- expect(await orch.ingestItem({ id: 'doc-1', content: 'noise' })).toSucceedAndSatisfy(
350
- (r: IIngestItemResult) => {
351
- expect(r.records).toEqual([]);
352
- }
353
- );
354
- });
355
- });
356
-
357
- describe('host-stage failures abort loudly', () => {
358
- test('classifier failure', async () => {
359
- const orch = buildOrchestrator({
360
- store: buildStore(),
361
- classifier: classifier(() => fail('cannot classify'))
362
- });
363
- expect(await orch.ingestItem({ id: 'doc-1', content: 'x' })).toFailWith(/cannot classify/);
364
- });
365
-
366
- test('classifier throw is captured as a failure', async () => {
367
- const orch = buildOrchestrator({ store: buildStore(), classifier: throwingClassifier() });
368
- expect(await orch.ingestItem({ id: 'doc-1', content: 'x' })).toFailWith(
369
- /classify threw.*classifier boom/
370
- );
371
- });
372
-
373
- test('extractor failure', async () => {
374
- const orch = buildOrchestrator({
375
- store: buildStore(),
376
- extractor: extractor(() => fail('extract error'))
377
- });
378
- expect(await orch.ingestItem({ id: 'doc-1', content: 'x' })).toFailWith(/extract error/);
379
- });
380
-
381
- test('relation-extractor failure', async () => {
382
- const orch = buildOrchestrator({
383
- store: buildStore(),
384
- relationExtractor: relater(() => fail('relate error'))
385
- });
386
- expect(await orch.ingestItem({ id: 'doc-1', content: 'x' })).toFailWith(/relate error/);
387
- });
388
- });
389
-
390
- describe('stage 3b — typed validation boundary', () => {
391
- test('rejects a candidate whose body fails the kind converter', async () => {
392
- const orch = buildOrchestrator({
393
- store: buildStore(),
394
- extractor: extractor(() => succeed([candidate(noteKind, 'doc-1', 42)]))
395
- });
396
- expect(await orch.ingestItem({ id: 'doc-1', content: 'x' })).toFailWith(
397
- /candidate body for kind 'note' is invalid/
398
- );
399
- });
400
-
401
- test('rejects a non-string body even when the converter accepts it', async () => {
402
- const orch = buildOrchestrator({
403
- store: buildStore(),
404
- extractor: extractor(() => succeed([candidate(numKind, 'n-1', 42)]))
405
- });
406
- expect(await orch.ingestItem({ id: 'n-1', content: 'x' })).toFailWith(/must be a string/);
407
- });
408
-
409
- test('fails when no identity codec is registered for the candidate kind', async () => {
410
- const orch = buildOrchestrator({
411
- store: buildStore(),
412
- extractor: extractor(() => succeed([candidate(orphanKind, 'o-1', 'body')]))
413
- });
414
- expect(await orch.ingestItem({ id: 'o-1', content: 'x' })).toFailWith(/no identity codec/);
415
- });
416
-
417
- test('fails loudly when a pre-existing snapshot record cannot be scoped (no codec for its kind)', async () => {
418
- // The store can persist a note (it has the note codec), but the orchestrator
419
- // below is wired WITHOUT a note codec — so when it snapshots the store to run
420
- // the edge path, it cannot resolve the seeded note's scope and fails loudly
421
- // (never silently drops it from the cycle graph). This is the branch the
422
- // scope-qualified edge change added.
423
- const store = buildStore();
424
- await putNote(store, 'legacy', 'anchor');
425
- const orch = MemoryIngestOrchestrator.create({
426
- store,
427
- registry: registry(),
428
- // Deliberately omit the note codec (and any default) that the seeded record needs.
429
- codecs: new Map<Kind, IIdentityCodec>([[numKind, new KnowledgeIdentityCodec()]]),
430
- classifier: classifier(() => succeed({ kind: numKind })),
431
- extractor: extractor(() => succeed([candidate(numKind, 'n-1', 7)])),
432
- relationExtractor: noEdges
433
- }).orThrow();
434
- expect(await orch.ingestItem({ id: 'i', content: 'x' })).toFailWith(
435
- /cannot resolve scope for stored record 'legacy'.*no identity codec registered for kind 'note'/i
436
- );
437
- });
438
- });
439
-
440
- describe('stage 4 — exact dedup (layer 1)', () => {
441
- test('an exact {kind,body} match in scope is duplicate-of (no resolver)', async () => {
442
- const store = buildStore({ files: [seedNote('doc-a', 'hello')] });
443
- const orch = buildOrchestrator({
444
- store,
445
- extractor: extractor(() => succeed([candidate(noteKind, 'doc-b', 'hello')]))
446
- });
447
- expect(await orch.ingestItem({ id: 'i', content: 'x' })).toSucceedAndSatisfy((r: IIngestItemResult) => {
448
- expect(r.records[0].disposition).toBe('deduped');
449
- expect(r.records[0].resolution).toEqual({ verdict: 'duplicate-of', target: kt('doc-a') });
450
- expect(r.records[0].id).toBe('doc-a');
451
- });
452
- // doc-b was never written.
453
- expect(await store.get(noteKind, 'doc-b' as EntityId)).toSucceedWith(undefined);
454
- });
455
-
456
- test('exact dedup takes precedence over the resolver (resolver never called)', async () => {
457
- const vectorIndex = InMemoryCosineIndex.create().orThrow();
458
- const store = buildStore({ files: [seedNote('doc-a', 'hello')] });
459
- const orch = buildOrchestrator({
460
- store,
461
- entityResolver: resolver(() => fail('resolver must not be called')),
462
- vectorIndex,
463
- embed,
464
- extractor: extractor(() => succeed([candidate(noteKind, 'doc-b', 'hello')]))
465
- });
466
- expect(await orch.ingestItem({ id: 'i', content: 'x' })).toSucceedAndSatisfy((r: IIngestItemResult) => {
467
- expect(r.records[0].disposition).toBe('deduped');
468
- });
469
- });
470
-
471
- test('a distinct body is a fresh write (no resolver → exact-only fall-back)', async () => {
472
- const store = buildStore({ files: [seedNote('doc-a', 'hello')] });
473
- const orch = buildOrchestrator({
474
- store,
475
- extractor: extractor(() => succeed([candidate(noteKind, 'doc-b', 'goodbye')]))
476
- });
477
- expect(await orch.ingestItem({ id: 'i', content: 'x' })).toSucceedAndSatisfy((r: IIngestItemResult) => {
478
- expect(r.records[0].disposition).toBe('written');
479
- expect(r.records[0].resolution.verdict).toBe('new');
480
- });
481
- });
482
- });
483
- });
484
-
485
- // --- similarity + resolver fixtures ------------------------------------------
486
- const classifyFact: IMemoryClassifier = classifier(() => succeed({ kind: factKind }));
487
- function oneFactExtractor(): IFactExtractor {
488
- return extractor((item) => succeed([candidate(factKind, item.id, item.content as string)]));
489
- }
490
-
491
- async function putNote(store: FileTreeMemoryStore, id: string, body: string): Promise<void> {
492
- const rec: IMemoryRecord<unknown> = {
493
- envelope: {
494
- id: id as MemoryId,
495
- entityId: id as EntityId,
496
- kind: noteKind,
497
- tags: [],
498
- links: [],
499
- created: 0,
500
- updated: 0,
501
- seq: 0,
502
- contentHash: '',
503
- provenance: { source: 'agent' }
504
- },
505
- body
506
- };
507
- (await store.put(rec)).orThrow();
508
- }
509
-
510
- function mockStore(overrides: Partial<IMemoryStore>): IMemoryStore {
511
- return {
512
- get:
513
- overrides.get ??
514
- ((): Promise<Result<IMemoryRecord<unknown> | undefined>> => Promise.resolve(succeed(undefined))),
515
- getById:
516
- overrides.getById ??
517
- ((): Promise<Result<IMemoryRecord<unknown> | undefined>> => Promise.resolve(succeed(undefined))),
518
- list:
519
- overrides.list ??
520
- ((): Promise<Result<ReadonlyArray<IMemoryRecord<unknown>>>> => Promise.resolve(succeed([]))),
521
- listScoped:
522
- overrides.listScoped ??
523
- ((): Promise<Result<ReadonlyArray<IScopedMemoryRecord>>> => Promise.resolve(succeed([]))),
524
- // Mirrors the store's default policy (KnowledgeLwwPolicy → 'content'), so a
525
- // mock store keeps the pre-accessor layer-1 behavior unless a test overrides it.
526
- dedupScopeFor: overrides.dedupScopeFor ?? ((): DedupScope => 'content'),
527
- asRecordSource:
528
- overrides.asRecordSource ??
529
- ((): IMemoryRecordSource => ({
530
- list: (): Promise<Result<ReadonlyArray<IScopedMemoryRecord>>> => Promise.resolve(succeed([]))
531
- })),
532
- put: overrides.put ?? ((r): Promise<Result<IMemoryRecord<unknown>>> => Promise.resolve(succeed(r))),
533
- delete: overrides.delete ?? ((): Promise<Result<MemoryId>> => Promise.resolve(fail('n/a')))
534
- };
535
- }
536
-
537
- describe('MemoryIngestOrchestrator — stage 4 similarity (layer 2)', () => {
538
- test('resolver verdict new writes the candidate despite a near-duplicate', async () => {
539
- const vectorIndex = InMemoryCosineIndex.create().orThrow();
540
- const store = buildStore({ vectorIndex, embed });
541
- await putNote(store, 'doc-a', 'apple pie');
542
- const orch = buildOrchestrator({
543
- store,
544
- vectorIndex,
545
- embed,
546
- entityResolver: resolver(() => succeed({ verdict: 'new' })),
547
- extractor: extractor(() => succeed([candidate(noteKind, 'doc-b', 'apple tart')]))
548
- });
549
- expect(await orch.ingestItem({ id: 'i', content: 'x' })).toSucceedAndSatisfy((r: IIngestItemResult) => {
550
- expect(r.records[0].disposition).toBe('written');
551
- expect(r.records[0].resolution.verdict).toBe('new');
552
- });
553
- });
554
-
555
- test('resolver verdict duplicate-of dedups against the surfaced neighbor', async () => {
556
- const vectorIndex = InMemoryCosineIndex.create().orThrow();
557
- const store = buildStore({ vectorIndex, embed });
558
- await putNote(store, 'doc-a', 'apple pie');
559
- const orch = buildOrchestrator({
560
- store,
561
- vectorIndex,
562
- embed,
563
- entityResolver: resolver((__c, similar) =>
564
- succeed({ verdict: 'duplicate-of', target: similar[0].target })
565
- ),
566
- extractor: extractor(() => succeed([candidate(noteKind, 'doc-b', 'apple tart')]))
567
- });
568
- expect(await orch.ingestItem({ id: 'i', content: 'x' })).toSucceedAndSatisfy((r: IIngestItemResult) => {
569
- expect(r.records[0].disposition).toBe('deduped');
570
- expect(r.records[0].id).toBe('doc-a');
571
- });
572
- expect(await store.get(noteKind, 'doc-b' as EntityId)).toSucceedWith(undefined);
573
- });
574
-
575
- test('resolver verdict supersede writes the candidate and records the superseded target', async () => {
576
- const vectorIndex = InMemoryCosineIndex.create().orThrow();
577
- const store = buildStore({ vectorIndex, embed });
578
- await putNote(store, 'doc-a', 'apple pie');
579
- const orch = buildOrchestrator({
580
- store,
581
- vectorIndex,
582
- embed,
583
- entityResolver: resolver((__c, similar) =>
584
- succeed({ verdict: 'supersede', target: similar[0].target })
585
- ),
586
- extractor: extractor(() => succeed([candidate(noteKind, 'doc-b', 'apple tart')]))
587
- });
588
- expect(await orch.ingestItem({ id: 'i', content: 'x' })).toSucceedAndSatisfy((r: IIngestItemResult) => {
589
- expect(r.records[0].disposition).toBe('written');
590
- expect(r.records[0].resolution).toEqual({ verdict: 'supersede', target: kt('doc-a') });
591
- expect(r.records[0].id).toBe('doc-b');
592
- });
593
- expect(await store.get(noteKind, 'doc-b' as EntityId)).toSucceedAndSatisfy(
594
- (rec: IMemoryRecord<unknown> | undefined) => expect(rec?.body).toBe('apple tart')
595
- );
596
- });
597
-
598
- test('resolver verdict merge-into re-addresses the write to the target entity', async () => {
599
- const vectorIndex = InMemoryCosineIndex.create().orThrow();
600
- const store = buildStore({ vectorIndex, embed });
601
- await putNote(store, 'doc-a', 'apple pie');
602
- const orch = buildOrchestrator({
603
- store,
604
- vectorIndex,
605
- embed,
606
- entityResolver: resolver((__c, similar) =>
607
- succeed({ verdict: 'merge-into', target: similar[0].target })
608
- ),
609
- extractor: extractor(() => succeed([candidate(noteKind, 'doc-b', 'apple tart')]))
610
- });
611
- expect(await orch.ingestItem({ id: 'i', content: 'x' })).toSucceedAndSatisfy((r: IIngestItemResult) => {
612
- expect(r.records[0].disposition).toBe('merged');
613
- expect(r.records[0].id).toBe('doc-a');
614
- });
615
- // The merge updated doc-a's body (LWW merge patch) and never minted doc-b.
616
- expect(await store.get(noteKind, 'doc-a' as EntityId)).toSucceedAndSatisfy(
617
- (rec: IMemoryRecord<unknown> | undefined) => expect(rec?.body).toBe('apple tart')
618
- );
619
- expect(await store.get(noteKind, 'doc-b' as EntityId)).toSucceedWith(undefined);
620
- });
621
-
622
- test('merge-into with a non-existent target fails loudly', async () => {
623
- const vectorIndex = InMemoryCosineIndex.create().orThrow();
624
- const store = buildStore({ vectorIndex, embed });
625
- await putNote(store, 'doc-a', 'apple pie');
626
- const orch = buildOrchestrator({
627
- store,
628
- vectorIndex,
629
- embed,
630
- entityResolver: resolver(() => succeed({ verdict: 'merge-into', target: kt('ghost') })),
631
- extractor: extractor(() => succeed([candidate(noteKind, 'doc-b', 'apple tart')]))
632
- });
633
- expect(await orch.ingestItem({ id: 'i', content: 'x' })).toFailWith(
634
- /merge-into target 'knowledge\/ghost' does not exist/
635
- );
636
- });
637
-
638
- test('a below-threshold neighbor is not surfaced (resolver not called)', async () => {
639
- const vectorIndex = InMemoryCosineIndex.create().orThrow();
640
- const store = buildStore({ vectorIndex, embed });
641
- await putNote(store, 'doc-a', 'apple pie');
642
- const orch = buildOrchestrator({
643
- store,
644
- vectorIndex,
645
- embed,
646
- entityResolver: resolver(() => fail('resolver must not be called')),
647
- extractor: extractor(() => succeed([candidate(noteKind, 'doc-b', 'banana bread')]))
648
- });
649
- expect(await orch.ingestItem({ id: 'i', content: 'x' })).toSucceedAndSatisfy((r: IIngestItemResult) => {
650
- expect(r.records[0].resolution.verdict).toBe('new');
651
- });
652
- });
653
-
654
- test('the candidate self-hit is excluded from surfaced neighbors', async () => {
655
- const vectorIndex = InMemoryCosineIndex.create().orThrow();
656
- const store = buildStore({ vectorIndex, embed });
657
- await putNote(store, 'doc-a', 'apple pie');
658
- const orch = buildOrchestrator({
659
- store,
660
- vectorIndex,
661
- embed,
662
- entityResolver: resolver(() => fail('resolver must not be called')),
663
- extractor: extractor(() => succeed([candidate(noteKind, 'doc-a', 'apple tart')]))
664
- });
665
- // Re-ingesting the SAME entity: its own prior vector is the only over-threshold
666
- // hit, and it is skipped as the self-hit, so no resolver dispatch occurs.
667
- expect(await orch.ingestItem({ id: 'i', content: 'x' })).toSucceedAndSatisfy((r: IIngestItemResult) => {
668
- expect(r.records[0].resolution.verdict).toBe('new');
669
- expect(r.records[0].disposition).toBe('written');
670
- });
671
- });
672
-
673
- test('a surfaced hit with no backing record is skipped', async () => {
674
- const ghostIndex: IVectorIndex = {
675
- add: (t) => Promise.resolve(succeed(t.id as string)),
676
- remove: (t) => Promise.resolve(succeed(t)),
677
- query: (): Promise<Result<ReadonlyArray<IVectorQueryHit>>> =>
678
- Promise.resolve(succeed([{ target: kt('ghost'), score: 0.99 }]))
679
- };
680
- const orch = buildOrchestrator({
681
- store: buildStore(),
682
- vectorIndex: ghostIndex,
683
- embed,
684
- entityResolver: resolver(() => fail('resolver must not be called')),
685
- extractor: extractor(() => succeed([candidate(noteKind, 'doc-b', 'apple tart')]))
686
- });
687
- expect(await orch.ingestItem({ id: 'i', content: 'x' })).toSucceedAndSatisfy((r: IIngestItemResult) => {
688
- expect(r.records[0].resolution.verdict).toBe('new');
689
- });
690
- });
691
-
692
- test('an embedder failure surfaces loudly', async () => {
693
- const vectorIndex = InMemoryCosineIndex.create().orThrow();
694
- const orch = buildOrchestrator({
695
- store: buildStore(),
696
- vectorIndex,
697
- embed,
698
- entityResolver: resolver(() => succeed({ verdict: 'new' })),
699
- extractor: extractor(() => succeed([candidate(noteKind, 'doc-b', 'boom')]))
700
- });
701
- expect(await orch.ingestItem({ id: 'i', content: 'x' })).toFailWith(/embed boom/);
702
- });
703
-
704
- test('a similarity-query failure surfaces loudly', async () => {
705
- const failingIndex: IVectorIndex = {
706
- add: (t) => Promise.resolve(succeed(t.id as string)),
707
- remove: (t) => Promise.resolve(succeed(t)),
708
- query: (): Promise<Result<ReadonlyArray<IVectorQueryHit>>> => Promise.resolve(fail('query kaput'))
709
- };
710
- const orch = buildOrchestrator({
711
- store: buildStore(),
712
- vectorIndex: failingIndex,
713
- embed,
714
- entityResolver: resolver(() => succeed({ verdict: 'new' })),
715
- extractor: extractor(() => succeed([candidate(noteKind, 'doc-b', 'apple tart')]))
716
- });
717
- expect(await orch.ingestItem({ id: 'i', content: 'x' })).toFailWith(/query kaput/);
718
- });
719
-
720
- test('a custom similarityThreshold gates the resolver dispatch', async () => {
721
- const vectorIndex = InMemoryCosineIndex.create().orThrow();
722
- const store = buildStore({ vectorIndex, embed });
723
- await putNote(store, 'doc-a', 'apple pie');
724
- const orch = buildOrchestrator({
725
- store,
726
- vectorIndex,
727
- embed,
728
- similarityThreshold: 0.999, // 0.99 neighbor now falls below threshold
729
- entityResolver: resolver(() => fail('resolver must not be called')),
730
- extractor: extractor(() => succeed([candidate(noteKind, 'doc-b', 'apple tart')]))
731
- });
732
- expect(await orch.ingestItem({ id: 'i', content: 'x' })).toSucceedAndSatisfy((r: IIngestItemResult) => {
733
- expect(r.records[0].resolution.verdict).toBe('new');
734
- });
735
- });
736
- });
737
-
738
- describe('MemoryIngestOrchestrator — layer-2 wiring gates (exact-only fall-back)', () => {
739
- const failResolver: IEntityResolver = resolver(() => fail('resolver must not be called'));
740
- const almostSimilar = extractor(() => succeed([candidate(noteKind, 'doc-b', 'apple tart')]));
741
-
742
- test('no resolver → exact-only', async () => {
743
- const vectorIndex = InMemoryCosineIndex.create().orThrow();
744
- const store = buildStore({ vectorIndex, embed });
745
- await putNote(store, 'doc-a', 'apple pie');
746
- const orch = buildOrchestrator({ store, vectorIndex, embed, extractor: almostSimilar });
747
- expect(await orch.ingestItem({ id: 'i', content: 'x' })).toSucceedAndSatisfy((r: IIngestItemResult) =>
748
- expect(r.records[0].resolution.verdict).toBe('new')
749
- );
750
- });
751
-
752
- test('resolver + embed but no vector index → exact-only', async () => {
753
- const orch = buildOrchestrator({
754
- store: buildStore(),
755
- embed,
756
- entityResolver: failResolver,
757
- extractor: almostSimilar
758
- });
759
- expect(await orch.ingestItem({ id: 'i', content: 'x' })).toSucceedAndSatisfy((r: IIngestItemResult) =>
760
- expect(r.records[0].resolution.verdict).toBe('new')
761
- );
762
- });
763
-
764
- test('resolver + vector index but no embedder → exact-only', async () => {
765
- const vectorIndex = InMemoryCosineIndex.create().orThrow();
766
- const orch = buildOrchestrator({
767
- store: buildStore(),
768
- vectorIndex,
769
- entityResolver: failResolver,
770
- extractor: almostSimilar
771
- });
772
- expect(await orch.ingestItem({ id: 'i', content: 'x' })).toSucceedAndSatisfy((r: IIngestItemResult) =>
773
- expect(r.records[0].resolution.verdict).toBe('new')
774
- );
775
- });
776
- });
777
-
778
- describe('MemoryIngestOrchestrator — stage 5 relate + cycle guard', () => {
779
- test('attaches a valid edge to an existing record', async () => {
780
- const store = buildStore();
781
- await putNote(store, 'doc-a', 'anchor');
782
- const orch = buildOrchestrator({
783
- store,
784
- extractor: extractor(() => succeed([candidate(noteKind, 'doc-b', 'goodbye')])),
785
- relationExtractor: relater(() => succeed([candEdge('doc-b', 'mentions', 'doc-a', 0.7)]))
786
- });
787
- expect(await orch.ingestItem({ id: 'i', content: 'x' })).toSucceedAndSatisfy((r: IIngestItemResult) => {
788
- expect(r.records[0].edges).toHaveLength(1);
789
- expect(r.records[0].record?.envelope.links).toEqual([
790
- { type: 'mentions', target: kt('doc-a'), confidence: 0.7 }
791
- ]);
792
- });
793
- });
794
-
795
- test('attaches an edge between two sibling candidates', async () => {
796
- const orch = buildOrchestrator({
797
- store: buildStore(),
798
- extractor: extractor(() =>
799
- succeed([candidate(noteKind, 'doc-b', 'first'), candidate(noteKind, 'doc-c', 'second')])
800
- ),
801
- relationExtractor: relater(() => succeed([candEdge('doc-b', 'rel', 'doc-c')]))
802
- });
803
- expect(await orch.ingestItem({ id: 'i', content: 'x' })).toSucceedAndSatisfy((r: IIngestItemResult) => {
804
- expect(r.records).toHaveLength(2);
805
- expect(r.records[0].record?.envelope.links).toEqual([{ type: 'rel', target: kt('doc-c') }]);
806
- expect(r.records[1].edges).toEqual([]);
807
- });
808
- });
809
-
810
- test('rejects an edge whose source is not a candidate being written', async () => {
811
- const orch = buildOrchestrator({
812
- store: buildStore(),
813
- extractor: extractor(() => succeed([candidate(noteKind, 'doc-b', 'x')])),
814
- relationExtractor: relater(() => succeed([candEdge('ghost', 'rel', 'doc-b')]))
815
- });
816
- expect(await orch.ingestItem({ id: 'i', content: 'x' })).toFailWith(
817
- /edge source 'knowledge\/ghost' is not a candidate being written/
818
- );
819
- });
820
-
821
- test('rejects an edge whose target resolves to nothing', async () => {
822
- const orch = buildOrchestrator({
823
- store: buildStore(),
824
- extractor: extractor(() => succeed([candidate(noteKind, 'doc-b', 'x')])),
825
- relationExtractor: relater(() => succeed([candEdge('doc-b', 'rel', 'ghost')]))
826
- });
827
- expect(await orch.ingestItem({ id: 'i', content: 'x' })).toFailWith(
828
- /edge target 'knowledge\/ghost' resolves to neither/
829
- );
830
- });
831
-
832
- test('rejects a cycle-inducing edge (default guard)', async () => {
833
- const orch = buildOrchestrator({
834
- store: buildStore(),
835
- extractor: extractor(() =>
836
- succeed([candidate(noteKind, 'doc-b', 'first'), candidate(noteKind, 'doc-c', 'second')])
837
- ),
838
- relationExtractor: relater(() =>
839
- succeed([candEdge('doc-b', 'rel', 'doc-c'), candEdge('doc-c', 'rel', 'doc-b')])
840
- )
841
- });
842
- expect(await orch.ingestItem({ id: 'i', content: 'x' })).toFailWith(/would create a cycle/);
843
- });
844
-
845
- test('cycleGuard "off" admits an otherwise-cyclic edge set', async () => {
846
- const orch = buildOrchestrator({
847
- store: buildStore(),
848
- cycleGuard: 'off',
849
- extractor: extractor(() =>
850
- succeed([candidate(noteKind, 'doc-b', 'first'), candidate(noteKind, 'doc-c', 'second')])
851
- ),
852
- relationExtractor: relater(() =>
853
- succeed([candEdge('doc-b', 'rel', 'doc-c'), candEdge('doc-c', 'rel', 'doc-b')])
854
- )
855
- });
856
- expect(await orch.ingestItem({ id: 'i', content: 'x' })).toSucceedAndSatisfy((r: IIngestItemResult) => {
857
- expect(r.records[0].record?.envelope.links).toEqual([{ type: 'rel', target: kt('doc-c') }]);
858
- expect(r.records[1].record?.envelope.links).toEqual([{ type: 'rel', target: kt('doc-b') }]);
859
- });
860
- });
861
-
862
- test('a contradicts edge on a NON-temporal kind persists as a plain link (no interlock)', async () => {
863
- const store = buildStore();
864
- await putNote(store, 'doc-a', 'anchor');
865
- const orch = buildOrchestrator({
866
- store,
867
- extractor: extractor(() => succeed([candidate(noteKind, 'doc-b', 'goodbye')])),
868
- relationExtractor: relater(() => succeed([candEdge('doc-b', 'contradicts', 'doc-a')]))
869
- });
870
- expect(await orch.ingestItem({ id: 'i', content: 'x' })).toSucceedAndSatisfy((r: IIngestItemResult) => {
871
- expect(r.records[0].interlock).toBeUndefined();
872
- expect(r.records[0].record?.envelope.links).toEqual([{ type: 'contradicts', target: kt('doc-a') }]);
873
- });
874
- });
875
-
876
- describe('_validateEdges cross-scope target disambiguation', () => {
877
- // Two EXISTING records share the idStem 'turn-3' across two conversations
878
- // (the MTM codec mints per-scope stems). A stage-5 edge target must resolve
879
- // to the CORRECT (scope, id) — with bare-id keying both would alias and a
880
- // wrong-scope target would silently validate. Guards the ingest-validation seam.
881
- const mtmKind: Kind = 'mtm' as Kind;
882
-
883
- function mtmRegistry(): IBodyConverterRegistry {
884
- const reg = registry();
885
- reg.register(mtmKind, Converters.string);
886
- return reg;
887
- }
888
-
889
- const mtmCodecs: ReadonlyMap<Kind, IIdentityCodec> = new Map<Kind, IIdentityCodec>([
890
- [mtmKind, new MtmIdentityCodec()]
891
- ]);
892
-
893
- async function seedTurn(store: FileTreeMemoryStore, entityId: string, body: string): Promise<void> {
894
- const addr = new MtmIdentityCodec().encode(entityId as EntityId).orThrow();
895
- const rec: IMemoryRecord<unknown> = {
896
- envelope: {
897
- id: addr.idStem as MemoryId,
898
- entityId: entityId as EntityId,
899
- kind: mtmKind,
900
- tags: [],
901
- links: [],
902
- created: 0,
903
- updated: 0,
904
- seq: 0,
905
- contentHash: '',
906
- provenance: { source: 'agent' }
907
- },
908
- body
909
- };
910
- (await store.put(rec)).orThrow();
911
- }
912
-
913
- function buildMtmOrchestrator(
914
- store: FileTreeMemoryStore,
915
- relationExtractor: IRelationExtractor
916
- ): MemoryIngestOrchestrator {
917
- return MemoryIngestOrchestrator.create({
918
- store,
919
- registry: mtmRegistry(),
920
- codecs: mtmCodecs,
921
- classifier: classifier(() => succeed({ kind: mtmKind })),
922
- // The candidate is a fresh turn-5 under conv-a (distinct stem from the seeds).
923
- extractor: extractor(() => succeed([candidate(mtmKind, 'conv-a:5', 'a new turn')])),
924
- relationExtractor
925
- }).orThrow();
926
- }
927
-
928
- async function seededStore(): Promise<FileTreeMemoryStore> {
929
- const store = FileTreeMemoryStore.create({
930
- root: mutableRoot(),
931
- registry: mtmRegistry(),
932
- codecs: mtmCodecs,
933
- clock
934
- }).orThrow();
935
- await seedTurn(store, 'conv-a:3', 'anchor in conversation a');
936
- await seedTurn(store, 'conv-b:3', 'anchor in conversation b');
937
- return store;
938
- }
939
-
940
- test('accepts a same-stem edge target that resolves to the correct scope', async () => {
941
- const store = await seededStore();
942
- const orch = buildMtmOrchestrator(
943
- store,
944
- relater((ctx) =>
945
- succeed([
946
- {
947
- source: srcOf(ctx, 'conv-a:5'),
948
- edge: { type: 'rel' as LinkType, target: kt('turn-3', 'conversations/conv-a') }
949
- }
950
- ])
951
- )
952
- );
953
- expect(await orch.ingestItem({ id: 'i', content: 'x' })).toSucceedAndSatisfy((r: IIngestItemResult) => {
954
- expect(r.records[0].record?.envelope.links).toEqual([
955
- { type: 'rel', target: kt('turn-3', 'conversations/conv-a') }
956
- ]);
957
- });
958
- });
959
-
960
- test('rejects a same-stem edge target whose scope has no matching record', async () => {
961
- const store = await seededStore();
962
- const orch = buildMtmOrchestrator(
963
- store,
964
- relater((ctx) =>
965
- succeed([
966
- {
967
- source: srcOf(ctx, 'conv-a:5'),
968
- // turn-3 exists under conv-a and conv-b, but NOT conv-z.
969
- edge: { type: 'rel' as LinkType, target: kt('turn-3', 'conversations/conv-z') }
970
- }
971
- ])
972
- )
973
- );
974
- expect(await orch.ingestItem({ id: 'i', content: 'x' })).toFailWith(
975
- /edge target 'conversations\/conv-z\/turn-3' resolves to neither a sibling candidate nor an existing record/
976
- );
977
- });
978
- });
979
- });
980
-
981
- describe('MemoryIngestOrchestrator — contradicts→temporal interlock', () => {
982
- test('a contradicts edge on a temporal kind invalidates the prior version and writes a new one', async () => {
983
- const store = buildStore();
984
- const firstOrch = buildOrchestrator({
985
- store,
986
- classifier: classifyFact,
987
- extractor: oneFactExtractor()
988
- });
989
- clockValue = 1000;
990
- const first = await firstOrch.ingestItem({ id: 'fact-1', content: 'the sky is blue' });
991
- const v1Id: MemoryId = first.orThrow().records[0].id;
992
- expect(v1Id).toBe('fact-1-v1');
993
-
994
- clockValue = 2000;
995
- const secondOrch = buildOrchestrator({
996
- store,
997
- classifier: classifyFact,
998
- extractor: extractor(() => succeed([candidate(factKind, 'fact-1', 'the sky is grey')])),
999
- relationExtractor: relater((ctx) =>
1000
- succeed([
1001
- {
1002
- source: srcOf(ctx, 'fact-1'),
1003
- edge: { type: CONTRADICTS_LINK_TYPE, target: kt(v1Id, 'facts/entities/fact-1') }
1004
- }
1005
- ])
1006
- )
1007
- });
1008
- expect(await secondOrch.ingestItem({ id: 'fact-1', content: 'the sky is grey' })).toSucceedAndSatisfy(
1009
- (r: IIngestItemResult) => {
1010
- expect(r.records[0].interlock).toBe('temporal-versioned');
1011
- expect(r.records[0].disposition).toBe('written');
1012
- expect(r.records[0].record?.envelope.links).toEqual([
1013
- { type: CONTRADICTS_LINK_TYPE, target: kt(v1Id, 'facts/entities/fact-1') }
1014
- ]);
1015
- }
1016
- );
1017
-
1018
- // The current version is the new (contradicting) one.
1019
- expect(await store.get(factKind, 'fact-1' as EntityId)).toSucceedAndSatisfy(
1020
- (rec: IMemoryRecord<unknown> | undefined) => expect(rec?.body).toBe('the sky is grey')
1021
- );
1022
- // The prior version is invalidated (invalidate-don't-delete).
1023
- expect(await store.list()).toSucceedAndSatisfy((all: ReadonlyArray<IMemoryRecord<unknown>>) => {
1024
- const v1 = all.find((rec) => rec.envelope.id === v1Id);
1025
- expect(v1?.envelope.temporal?.invalid_at).toBe(2000);
1026
- });
1027
- });
1028
-
1029
- test('an invalidated version does not exact-dedup a later candidate that repeats its body', async () => {
1030
- const store = buildStore();
1031
- clockValue = 1000;
1032
- const o1 = buildOrchestrator({ store, classifier: classifyFact, extractor: oneFactExtractor() });
1033
- const first = await o1.ingestItem({ id: 'fact-1', content: 'blue' });
1034
- const v1Id: MemoryId = first.orThrow().records[0].id;
1035
-
1036
- clockValue = 2000;
1037
- const o2 = buildOrchestrator({
1038
- store,
1039
- classifier: classifyFact,
1040
- extractor: extractor(() => succeed([candidate(factKind, 'fact-1', 'grey')])),
1041
- relationExtractor: relater((ctx) =>
1042
- succeed([
1043
- {
1044
- source: srcOf(ctx, 'fact-1'),
1045
- edge: { type: CONTRADICTS_LINK_TYPE, target: kt(v1Id, 'facts/entities/fact-1') }
1046
- }
1047
- ])
1048
- )
1049
- });
1050
- (await o2.ingestItem({ id: 'fact-1', content: 'grey' })).orThrow();
1051
-
1052
- // Re-introduce the ORIGINAL body: the invalidated v1 must be skipped by exact
1053
- // dedup, so this is a NEW version, not a duplicate-of.
1054
- clockValue = 3000;
1055
- const o3 = buildOrchestrator({
1056
- store,
1057
- classifier: classifyFact,
1058
- extractor: extractor(() => succeed([candidate(factKind, 'fact-1', 'blue')]))
1059
- });
1060
- expect(await o3.ingestItem({ id: 'fact-1', content: 'blue' })).toSucceedAndSatisfy(
1061
- (r: IIngestItemResult) => {
1062
- expect(r.records[0].resolution.verdict).toBe('new');
1063
- expect(r.records[0].disposition).toBe('written');
1064
- }
1065
- );
1066
- });
1067
- });
1068
-
1069
- describe('MemoryIngestOrchestrator — additive-provenance non-regression', () => {
1070
- test('a pre-existing record with only source provenance still loads and validates unchanged', async () => {
1071
- const store = buildStore({ files: [seedNote('legacy', 'old note', { source: 'human' })] });
1072
- // Loads at construction time.
1073
- expect(await store.getById('knowledge' as MemoryScopeKey, 'legacy' as MemoryId)).toSucceedAndSatisfy(
1074
- (rec: IMemoryRecord<unknown> | undefined) => {
1075
- expect(rec?.envelope.provenance).toEqual({ source: 'human' });
1076
- expect(rec?.envelope.provenance.by).toBeUndefined();
1077
- expect(rec?.envelope.provenance.derivedFrom).toBeUndefined();
1078
- }
1079
- );
1080
- // An unrelated ingest does not disturb it.
1081
- const orch = buildOrchestrator({ store });
1082
- (await orch.ingestItem({ id: 'fresh', content: 'new content' })).orThrow();
1083
- expect(await store.getById('knowledge' as MemoryScopeKey, 'legacy' as MemoryId)).toSucceedAndSatisfy(
1084
- (rec: IMemoryRecord<unknown> | undefined) => {
1085
- expect(rec?.envelope.provenance).toEqual({ source: 'human' });
1086
- }
1087
- );
1088
- });
1089
- });
1090
-
1091
- describe('MemoryIngestOrchestrator — ingestBatch', () => {
1092
- test('ingests a batch in order', async () => {
1093
- const store = buildStore();
1094
- const orch = buildOrchestrator({ store });
1095
- const result = await orch.ingestBatch([
1096
- { id: 'doc-1', content: 'one' },
1097
- { id: 'doc-2', content: 'two' }
1098
- ]);
1099
- expect(result).toSucceedAndSatisfy((results: ReadonlyArray<IIngestItemResult>) => {
1100
- expect(results).toHaveLength(2);
1101
- expect(results.map((r) => r.item.id)).toEqual(['doc-1', 'doc-2']);
1102
- expect(results.every((r) => r.records[0].disposition === 'written')).toBe(true);
1103
- });
1104
- });
1105
-
1106
- test('aborts the batch on the first item failure', async () => {
1107
- const orch = buildOrchestrator({
1108
- store: buildStore(),
1109
- classifier: classifier((item) =>
1110
- item.id === 'bad' ? fail('classify bad') : succeed({ kind: noteKind })
1111
- )
1112
- });
1113
- expect(
1114
- await orch.ingestBatch([
1115
- { id: 'bad', content: 'one' },
1116
- { id: 'doc-2', content: 'two' }
1117
- ])
1118
- ).toFailWith(/classify bad/);
1119
- });
1120
- });
1121
-
1122
- describe('MemoryIngestOrchestrator — store failure paths', () => {
1123
- test('a store snapshot (list) failure aborts the item', async () => {
1124
- const store = mockStore({ list: () => Promise.resolve(fail('list down')) });
1125
- const orch = buildOrchestrator({ store });
1126
- expect(await orch.ingestItem({ id: 'doc-1', content: 'x' })).toFailWith(
1127
- /failed to snapshot store.*list down/
1128
- );
1129
- });
1130
-
1131
- test('a store put failure surfaces as a write failure', async () => {
1132
- const store = mockStore({ put: () => Promise.resolve(fail('put kaput')) });
1133
- const orch = buildOrchestrator({ store });
1134
- expect(await orch.ingestItem({ id: 'doc-1', content: 'x' })).toFailWith(/write failed.*put kaput/);
1135
- });
1136
- });
1137
-
1138
- describe('MemoryIngestOrchestrator — optional constructor params', () => {
1139
- test('falls back to defaultCodec when no per-kind codec map is supplied', async () => {
1140
- const store = buildStore();
1141
- const orch = MemoryIngestOrchestrator.create({
1142
- store,
1143
- registry: registry(),
1144
- defaultCodec: new KnowledgeIdentityCodec(),
1145
- classifier: classifyNote,
1146
- extractor: oneNoteExtractor(),
1147
- relationExtractor: noEdges
1148
- }).orThrow();
1149
- expect(await orch.ingestItem({ id: 'doc-1', content: 'hello' })).toSucceedAndSatisfy(
1150
- (r: IIngestItemResult) => expect(r.records[0].disposition).toBe('written')
1151
- );
1152
- });
1153
-
1154
- test('honors an explicit similarityTopK and logs a captured host throw to the supplied logger', async () => {
1155
- const logger = new Logging.InMemoryLogger('detail');
1156
- const orch = MemoryIngestOrchestrator.create({
1157
- store: buildStore(),
1158
- registry: registry(),
1159
- codecs,
1160
- classifier: throwingClassifier(),
1161
- extractor: oneNoteExtractor(),
1162
- relationExtractor: noEdges,
1163
- similarityTopK: 3,
1164
- logger
1165
- }).orThrow();
1166
- expect(await orch.ingestItem({ id: 'doc-1', content: 'x' })).toFailWith(/classifier boom/);
1167
- expect(logger.logged.some((m) => /classifier boom/.test(m))).toBe(true);
1168
- });
1169
- });
1170
-
1171
- describe('MemoryIngestOrchestrator — review-punch-list fixes', () => {
1172
- test('a stored record with a non-string body fails the exact-dedup pass loudly', async () => {
1173
- const weird: IMemoryRecord<unknown> = {
1174
- envelope: {
1175
- id: 'weird' as MemoryId,
1176
- entityId: 'weird' as EntityId,
1177
- kind: noteKind,
1178
- tags: [],
1179
- links: [],
1180
- created: 0,
1181
- updated: 0,
1182
- seq: 0,
1183
- contentHash: '',
1184
- provenance: { source: 'agent' }
1185
- },
1186
- body: 42
1187
- };
1188
- const store = mockStore({ list: () => Promise.resolve(succeed([weird])) });
1189
- const orch = buildOrchestrator({ store });
1190
- expect(await orch.ingestItem({ id: 'doc-1', content: 'hello' })).toFailWith(
1191
- /stored record 'weird' has a non-string body/
1192
- );
1193
- });
1194
-
1195
- test('duplicate stage-5 edges are deduped on the written record', async () => {
1196
- const store = buildStore();
1197
- await putNote(store, 'doc-a', 'anchor');
1198
- const orch = buildOrchestrator({
1199
- store,
1200
- extractor: extractor(() => succeed([candidate(noteKind, 'doc-b', 'goodbye')])),
1201
- relationExtractor: relater(() =>
1202
- succeed([candEdge('doc-b', 'rel', 'doc-a'), candEdge('doc-b', 'rel', 'doc-a')])
1203
- )
1204
- });
1205
- expect(await orch.ingestItem({ id: 'i', content: 'x' })).toSucceedAndSatisfy((r: IIngestItemResult) => {
1206
- expect(r.records[0].record?.envelope.links).toEqual([{ type: 'rel', target: kt('doc-a') }]);
1207
- });
1208
- });
1209
-
1210
- test('two candidates merging into the same target do not duplicate a shared edge', async () => {
1211
- const vectorIndex = InMemoryCosineIndex.create().orThrow();
1212
- const store = buildStore({ vectorIndex, embed });
1213
- await putNote(store, 'doc-a', 'apple pie');
1214
- await putNote(store, 'doc-x', 'target');
1215
- const orch = buildOrchestrator({
1216
- store,
1217
- vectorIndex,
1218
- embed,
1219
- entityResolver: resolver((__c, similar) =>
1220
- succeed({ verdict: 'merge-into', target: similar[0].target })
1221
- ),
1222
- extractor: extractor(() =>
1223
- succeed([candidate(noteKind, 'doc-b', 'apple tart'), candidate(noteKind, 'doc-c', 'apple tart')])
1224
- ),
1225
- relationExtractor: relater(() => succeed([candEdge('doc-a', 'rel', 'doc-x')]))
1226
- });
1227
- expect(await orch.ingestItem({ id: 'i', content: 'x' })).toSucceed();
1228
- expect(await store.get(noteKind, 'doc-a' as EntityId)).toSucceedAndSatisfy(
1229
- (rec: IMemoryRecord<unknown> | undefined) => {
1230
- expect(rec?.envelope.links).toEqual([{ type: 'rel', target: kt('doc-x') }]);
1231
- }
1232
- );
1233
- });
1234
- });
1235
-
1236
- describe('MemoryIngestOrchestrator — merge-into safety (second review)', () => {
1237
- // Seed a record with pre-existing tags + links under a flat codec (id === entityId).
1238
- async function putFull(
1239
- store: FileTreeMemoryStore,
1240
- kind: Kind,
1241
- entityId: string,
1242
- body: string,
1243
- opts: { tags?: ReadonlyArray<string>; links?: IMemoryEnvelope['links'] } = {}
1244
- ): Promise<void> {
1245
- const rec: IMemoryRecord<unknown> = {
1246
- envelope: {
1247
- id: entityId as MemoryId,
1248
- entityId: entityId as EntityId,
1249
- kind,
1250
- tags: (opts.tags ?? []) as ReadonlyArray<Tag>,
1251
- links: opts.links ?? [],
1252
- created: 0,
1253
- updated: 0,
1254
- seq: 0,
1255
- contentHash: '',
1256
- provenance: { source: 'agent' }
1257
- },
1258
- body
1259
- };
1260
- (await store.put(rec)).orThrow();
1261
- }
1262
-
1263
- test('merge-into UNIONs the target’s existing tags + links (never overwrites them)', async () => {
1264
- const vectorIndex = InMemoryCosineIndex.create().orThrow();
1265
- const store = buildStore({ vectorIndex, embed });
1266
- await putFull(store, noteKind, 'doc-a', 'apple pie', {
1267
- tags: ['old-tag'],
1268
- links: [{ type: 'existing' as LinkType, target: kt('doc-z') }]
1269
- });
1270
- await putFull(store, noteKind, 'doc-x', 'target of stage-5');
1271
- const orch = buildOrchestrator({
1272
- store,
1273
- vectorIndex,
1274
- embed,
1275
- entityResolver: resolver((__c, similar) =>
1276
- succeed({ verdict: 'merge-into', target: similar[0].target })
1277
- ),
1278
- extractor: extractor(() =>
1279
- succeed([
1280
- candidate(noteKind, 'doc-b', 'apple tart', {
1281
- tags: ['new-tag'],
1282
- links: [{ type: 'candlink' as LinkType, target: kt('doc-z') }]
1283
- })
1284
- ])
1285
- ),
1286
- relationExtractor: relater(() => succeed([candEdge('doc-a', 'stage5', 'doc-x')]))
1287
- });
1288
- expect(await orch.ingestItem({ id: 'i', content: 'x' })).toSucceedAndSatisfy((r: IIngestItemResult) => {
1289
- expect(r.records[0].disposition).toBe('merged');
1290
- });
1291
- expect(await store.get(noteKind, 'doc-a' as EntityId)).toSucceedAndSatisfy(
1292
- (rec: IMemoryRecord<unknown> | undefined) => {
1293
- // Original tag preserved AND the candidate's tag gained, each once.
1294
- expect([...(rec?.envelope.tags ?? [])].sort()).toEqual(['new-tag', 'old-tag']);
1295
- // Original link + candidate link + stage-5 edge, each exactly once.
1296
- expect(rec?.envelope.links).toEqual([
1297
- { type: 'existing', target: kt('doc-z') },
1298
- { type: 'candlink', target: kt('doc-z') },
1299
- { type: 'stage5', target: kt('doc-x') }
1300
- ]);
1301
- }
1302
- );
1303
- });
1304
-
1305
- test('merge-into a different-kind target fails loudly', async () => {
1306
- const vectorIndex = InMemoryCosineIndex.create().orThrow();
1307
- const store = buildStore({ vectorIndex, embed });
1308
- // A DIFFERENT-kind (ltm) record embedded so it surfaces as a neighbor of a note candidate.
1309
- await putFull(store, ltmKind, 'conv-1', 'apple pie');
1310
- const orch = buildOrchestrator({
1311
- store,
1312
- vectorIndex,
1313
- embed,
1314
- entityResolver: resolver((__c, similar) =>
1315
- succeed({ verdict: 'merge-into', target: similar[0].target })
1316
- ),
1317
- extractor: extractor(() => succeed([candidate(noteKind, 'doc-b', 'apple tart')]))
1318
- });
1319
- expect(await orch.ingestItem({ id: 'i', content: 'x' })).toFailWith(
1320
- /merge-into target 'conversations\/conv-1' is kind 'ltm' but the candidate is kind 'note'/
1321
- );
1322
- });
1323
-
1324
- test('supersede with a non-existent target fails loudly', async () => {
1325
- const vectorIndex = InMemoryCosineIndex.create().orThrow();
1326
- const store = buildStore({ vectorIndex, embed });
1327
- await putFull(store, noteKind, 'doc-a', 'apple pie');
1328
- const orch = buildOrchestrator({
1329
- store,
1330
- vectorIndex,
1331
- embed,
1332
- entityResolver: resolver(() => succeed({ verdict: 'supersede', target: kt('ghost') })),
1333
- extractor: extractor(() => succeed([candidate(noteKind, 'doc-b', 'apple tart')]))
1334
- });
1335
- expect(await orch.ingestItem({ id: 'i', content: 'x' })).toFailWith(
1336
- /supersede target 'knowledge\/ghost' does not exist/
1337
- );
1338
- });
1339
-
1340
- test('duplicate-of with a non-existent target fails loudly', async () => {
1341
- const vectorIndex = InMemoryCosineIndex.create().orThrow();
1342
- const store = buildStore({ vectorIndex, embed });
1343
- await putFull(store, noteKind, 'doc-a', 'apple pie');
1344
- const orch = buildOrchestrator({
1345
- store,
1346
- vectorIndex,
1347
- embed,
1348
- entityResolver: resolver(() => succeed({ verdict: 'duplicate-of', target: kt('ghost') })),
1349
- extractor: extractor(() => succeed([candidate(noteKind, 'doc-b', 'apple tart')]))
1350
- });
1351
- expect(await orch.ingestItem({ id: 'i', content: 'x' })).toFailWith(
1352
- /duplicate-of target 'knowledge\/ghost' does not exist/
1353
- );
1354
- });
1355
- });