@fgv/ts-agent-memory 5.1.0-39 → 5.1.0-41

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (210) hide show
  1. package/.rush/temp/{b82cf6bdece20481260e6bab946179eeec9d7b46.tar.log → cbbdbe09515171b4eba8f2592be2dace1e4e8142.tar.log} +14 -2
  2. package/.rush/temp/chunked-rush-logs/ts-agent-memory.build.chunks.jsonl +2 -2
  3. package/.rush/temp/operation/build/all.log +2 -2
  4. package/.rush/temp/operation/build/log-chunks.jsonl +2 -2
  5. package/.rush/temp/operation/build/state.json +1 -1
  6. package/dist/packlets/converters/envelopeConverter.js +17 -3
  7. package/dist/packlets/converters/envelopeConverter.js.map +1 -1
  8. package/dist/packlets/index/memoryIndex.js +58 -10
  9. package/dist/packlets/index/memoryIndex.js.map +1 -1
  10. package/dist/packlets/ingest/cycleGuard.js +13 -6
  11. package/dist/packlets/ingest/cycleGuard.js.map +1 -1
  12. package/dist/packlets/ingest/hostStages.js.map +1 -1
  13. package/dist/packlets/ingest/model.js.map +1 -1
  14. package/dist/packlets/ingest/orchestrator.js +94 -49
  15. package/dist/packlets/ingest/orchestrator.js.map +1 -1
  16. package/dist/packlets/retrieve/hybridRetriever.js +13 -2
  17. package/dist/packlets/retrieve/hybridRetriever.js.map +1 -1
  18. package/dist/packlets/retrieve/linkTraversalRetriever.js +46 -57
  19. package/dist/packlets/retrieve/linkTraversalRetriever.js.map +1 -1
  20. package/dist/packlets/retrieve/recencyRetriever.js +3 -3
  21. package/dist/packlets/retrieve/recencyRetriever.js.map +1 -1
  22. package/dist/packlets/retrieve/retriever.js +50 -7
  23. package/dist/packlets/retrieve/retriever.js.map +1 -1
  24. package/dist/packlets/retrieve/semanticRetriever.js +9 -3
  25. package/dist/packlets/retrieve/semanticRetriever.js.map +1 -1
  26. package/dist/packlets/retrieve/structuredFilterRetriever.js +3 -3
  27. package/dist/packlets/retrieve/structuredFilterRetriever.js.map +1 -1
  28. package/dist/packlets/retrieve/tagRetriever.js +3 -3
  29. package/dist/packlets/retrieve/tagRetriever.js.map +1 -1
  30. package/dist/packlets/retrieve/temporalRetrievers.js +3 -3
  31. package/dist/packlets/retrieve/temporalRetrievers.js.map +1 -1
  32. package/dist/packlets/store/fileTreeMemoryStore.js +72 -16
  33. package/dist/packlets/store/fileTreeMemoryStore.js.map +1 -1
  34. package/dist/packlets/tools/memoryTools.js +104 -21
  35. package/dist/packlets/tools/memoryTools.js.map +1 -1
  36. package/dist/packlets/types/envelope.js +13 -1
  37. package/dist/packlets/types/envelope.js.map +1 -1
  38. package/dist/packlets/vector/inMemoryCosineIndex.js +22 -17
  39. package/dist/packlets/vector/inMemoryCosineIndex.js.map +1 -1
  40. package/dist/packlets/vector/vectorIndex.js.map +1 -1
  41. package/dist/test/unit/converters/antagonistRoundTrip.test.js +3 -3
  42. package/dist/test/unit/converters/antagonistRoundTrip.test.js.map +1 -1
  43. package/dist/test/unit/converters/envelopeConverter.test.js +125 -8
  44. package/dist/test/unit/converters/envelopeConverter.test.js.map +1 -1
  45. package/dist/test/unit/index/memoryIndex.test.js +87 -25
  46. package/dist/test/unit/index/memoryIndex.test.js.map +1 -1
  47. package/dist/test/unit/ingest/antagonistCycleAndParity.test.js +20 -16
  48. package/dist/test/unit/ingest/antagonistCycleAndParity.test.js.map +1 -1
  49. package/dist/test/unit/ingest/cycleGuard.test.js +28 -1
  50. package/dist/test/unit/ingest/cycleGuard.test.js.map +1 -1
  51. package/dist/test/unit/ingest/orchestrator.test.js +187 -45
  52. package/dist/test/unit/ingest/orchestrator.test.js.map +1 -1
  53. package/dist/test/unit/retrieve/linkTraversalRetriever.test.js +106 -31
  54. package/dist/test/unit/retrieve/linkTraversalRetriever.test.js.map +1 -1
  55. package/dist/test/unit/retrieve/retrievers.test.js +299 -37
  56. package/dist/test/unit/retrieve/retrievers.test.js.map +1 -1
  57. package/dist/test/unit/store/embedOnWrite.test.js +69 -12
  58. package/dist/test/unit/store/embedOnWrite.test.js.map +1 -1
  59. package/dist/test/unit/store/listScoped.test.js +109 -0
  60. package/dist/test/unit/store/listScoped.test.js.map +1 -0
  61. package/dist/test/unit/store/rankAxis.test.js +254 -0
  62. package/dist/test/unit/store/rankAxis.test.js.map +1 -0
  63. package/dist/test/unit/tools/memoryTools.test.js +280 -11
  64. package/dist/test/unit/tools/memoryTools.test.js.map +1 -1
  65. package/dist/test/unit/types/writePolicy.test.js +9 -2
  66. package/dist/test/unit/types/writePolicy.test.js.map +1 -1
  67. package/dist/test/unit/vector/inMemoryCosineIndex.test.js +95 -35
  68. package/dist/test/unit/vector/inMemoryCosineIndex.test.js.map +1 -1
  69. package/dist/test/unit/vector/vectorIndex.test.js +24 -15
  70. package/dist/test/unit/vector/vectorIndex.test.js.map +1 -1
  71. package/dist/ts-agent-memory.d.ts +384 -97
  72. package/etc/ts-agent-memory.api.md +64 -22
  73. package/lib/packlets/converters/envelopeConverter.d.ts +8 -1
  74. package/lib/packlets/converters/envelopeConverter.d.ts.map +1 -1
  75. package/lib/packlets/converters/envelopeConverter.js +18 -4
  76. package/lib/packlets/converters/envelopeConverter.js.map +1 -1
  77. package/lib/packlets/index/memoryIndex.d.ts +42 -10
  78. package/lib/packlets/index/memoryIndex.d.ts.map +1 -1
  79. package/lib/packlets/index/memoryIndex.js +58 -10
  80. package/lib/packlets/index/memoryIndex.js.map +1 -1
  81. package/lib/packlets/ingest/cycleGuard.d.ts +5 -5
  82. package/lib/packlets/ingest/cycleGuard.d.ts.map +1 -1
  83. package/lib/packlets/ingest/cycleGuard.js +13 -6
  84. package/lib/packlets/ingest/cycleGuard.js.map +1 -1
  85. package/lib/packlets/ingest/hostStages.d.ts +3 -3
  86. package/lib/packlets/ingest/hostStages.d.ts.map +1 -1
  87. package/lib/packlets/ingest/hostStages.js.map +1 -1
  88. package/lib/packlets/ingest/model.d.ts +25 -14
  89. package/lib/packlets/ingest/model.d.ts.map +1 -1
  90. package/lib/packlets/ingest/model.js.map +1 -1
  91. package/lib/packlets/ingest/orchestrator.d.ts +18 -4
  92. package/lib/packlets/ingest/orchestrator.d.ts.map +1 -1
  93. package/lib/packlets/ingest/orchestrator.js +93 -48
  94. package/lib/packlets/ingest/orchestrator.js.map +1 -1
  95. package/lib/packlets/retrieve/hybridRetriever.d.ts.map +1 -1
  96. package/lib/packlets/retrieve/hybridRetriever.js +12 -1
  97. package/lib/packlets/retrieve/hybridRetriever.js.map +1 -1
  98. package/lib/packlets/retrieve/linkTraversalRetriever.d.ts +18 -23
  99. package/lib/packlets/retrieve/linkTraversalRetriever.d.ts.map +1 -1
  100. package/lib/packlets/retrieve/linkTraversalRetriever.js +45 -56
  101. package/lib/packlets/retrieve/linkTraversalRetriever.js.map +1 -1
  102. package/lib/packlets/retrieve/recencyRetriever.js +2 -2
  103. package/lib/packlets/retrieve/recencyRetriever.js.map +1 -1
  104. package/lib/packlets/retrieve/retriever.d.ts +70 -11
  105. package/lib/packlets/retrieve/retriever.d.ts.map +1 -1
  106. package/lib/packlets/retrieve/retriever.js +52 -7
  107. package/lib/packlets/retrieve/retriever.js.map +1 -1
  108. package/lib/packlets/retrieve/semanticRetriever.d.ts.map +1 -1
  109. package/lib/packlets/retrieve/semanticRetriever.js +9 -3
  110. package/lib/packlets/retrieve/semanticRetriever.js.map +1 -1
  111. package/lib/packlets/retrieve/structuredFilterRetriever.js +2 -2
  112. package/lib/packlets/retrieve/structuredFilterRetriever.js.map +1 -1
  113. package/lib/packlets/retrieve/tagRetriever.js +2 -2
  114. package/lib/packlets/retrieve/tagRetriever.js.map +1 -1
  115. package/lib/packlets/retrieve/temporalRetrievers.js +3 -3
  116. package/lib/packlets/retrieve/temporalRetrievers.js.map +1 -1
  117. package/lib/packlets/store/fileTreeMemoryStore.d.ts +57 -3
  118. package/lib/packlets/store/fileTreeMemoryStore.d.ts.map +1 -1
  119. package/lib/packlets/store/fileTreeMemoryStore.js +72 -16
  120. package/lib/packlets/store/fileTreeMemoryStore.js.map +1 -1
  121. package/lib/packlets/tools/memoryTools.d.ts +24 -0
  122. package/lib/packlets/tools/memoryTools.d.ts.map +1 -1
  123. package/lib/packlets/tools/memoryTools.js +104 -21
  124. package/lib/packlets/tools/memoryTools.js.map +1 -1
  125. package/lib/packlets/types/envelope.d.ts +61 -8
  126. package/lib/packlets/types/envelope.d.ts.map +1 -1
  127. package/lib/packlets/types/envelope.js +14 -0
  128. package/lib/packlets/types/envelope.js.map +1 -1
  129. package/lib/packlets/vector/inMemoryCosineIndex.d.ts +9 -5
  130. package/lib/packlets/vector/inMemoryCosineIndex.d.ts.map +1 -1
  131. package/lib/packlets/vector/inMemoryCosineIndex.js +22 -17
  132. package/lib/packlets/vector/inMemoryCosineIndex.js.map +1 -1
  133. package/lib/packlets/vector/vectorIndex.d.ts +46 -20
  134. package/lib/packlets/vector/vectorIndex.d.ts.map +1 -1
  135. package/lib/packlets/vector/vectorIndex.js.map +1 -1
  136. package/lib/test/unit/converters/antagonistRoundTrip.test.js +3 -3
  137. package/lib/test/unit/converters/antagonistRoundTrip.test.js.map +1 -1
  138. package/lib/test/unit/converters/envelopeConverter.test.js +124 -7
  139. package/lib/test/unit/converters/envelopeConverter.test.js.map +1 -1
  140. package/lib/test/unit/index/memoryIndex.test.js +86 -24
  141. package/lib/test/unit/index/memoryIndex.test.js.map +1 -1
  142. package/lib/test/unit/ingest/antagonistCycleAndParity.test.js +20 -16
  143. package/lib/test/unit/ingest/antagonistCycleAndParity.test.js.map +1 -1
  144. package/lib/test/unit/ingest/cycleGuard.test.js +28 -1
  145. package/lib/test/unit/ingest/cycleGuard.test.js.map +1 -1
  146. package/lib/test/unit/ingest/orchestrator.test.js +186 -44
  147. package/lib/test/unit/ingest/orchestrator.test.js.map +1 -1
  148. package/lib/test/unit/retrieve/linkTraversalRetriever.test.js +106 -31
  149. package/lib/test/unit/retrieve/linkTraversalRetriever.test.js.map +1 -1
  150. package/lib/test/unit/retrieve/retrievers.test.js +298 -36
  151. package/lib/test/unit/retrieve/retrievers.test.js.map +1 -1
  152. package/lib/test/unit/store/embedOnWrite.test.js +68 -11
  153. package/lib/test/unit/store/embedOnWrite.test.js.map +1 -1
  154. package/lib/test/unit/store/listScoped.test.d.ts +2 -0
  155. package/lib/test/unit/store/listScoped.test.d.ts.map +1 -0
  156. package/lib/test/unit/store/listScoped.test.js +111 -0
  157. package/lib/test/unit/store/listScoped.test.js.map +1 -0
  158. package/lib/test/unit/store/rankAxis.test.d.ts +2 -0
  159. package/lib/test/unit/store/rankAxis.test.d.ts.map +1 -0
  160. package/lib/test/unit/store/rankAxis.test.js +256 -0
  161. package/lib/test/unit/store/rankAxis.test.js.map +1 -0
  162. package/lib/test/unit/tools/memoryTools.test.js +280 -11
  163. package/lib/test/unit/tools/memoryTools.test.js.map +1 -1
  164. package/lib/test/unit/types/writePolicy.test.js +9 -2
  165. package/lib/test/unit/types/writePolicy.test.js.map +1 -1
  166. package/lib/test/unit/vector/inMemoryCosineIndex.test.js +95 -35
  167. package/lib/test/unit/vector/inMemoryCosineIndex.test.js.map +1 -1
  168. package/lib/test/unit/vector/vectorIndex.test.js +24 -15
  169. package/lib/test/unit/vector/vectorIndex.test.js.map +1 -1
  170. package/package.json +7 -7
  171. package/rush-logs/ts-agent-memory.build.cache.log +1 -1
  172. package/rush-logs/ts-agent-memory.build.log +2 -2
  173. package/src/packlets/converters/envelopeConverter.ts +27 -4
  174. package/src/packlets/index/memoryIndex.ts +86 -22
  175. package/src/packlets/ingest/cycleGuard.ts +22 -11
  176. package/src/packlets/ingest/hostStages.ts +3 -3
  177. package/src/packlets/ingest/model.ts +25 -14
  178. package/src/packlets/ingest/orchestrator.ts +143 -67
  179. package/src/packlets/retrieve/hybridRetriever.ts +14 -1
  180. package/src/packlets/retrieve/linkTraversalRetriever.ts +51 -62
  181. package/src/packlets/retrieve/recencyRetriever.ts +3 -3
  182. package/src/packlets/retrieve/retriever.ts +97 -13
  183. package/src/packlets/retrieve/semanticRetriever.ts +10 -5
  184. package/src/packlets/retrieve/structuredFilterRetriever.ts +3 -3
  185. package/src/packlets/retrieve/tagRetriever.ts +3 -3
  186. package/src/packlets/retrieve/temporalRetrievers.ts +3 -3
  187. package/src/packlets/store/fileTreeMemoryStore.ts +117 -12
  188. package/src/packlets/tools/memoryTools.ts +152 -25
  189. package/src/packlets/types/envelope.ts +66 -8
  190. package/src/packlets/vector/inMemoryCosineIndex.ts +45 -22
  191. package/src/packlets/vector/vectorIndex.ts +47 -20
  192. package/src/test/unit/converters/antagonistRoundTrip.test.ts +3 -3
  193. package/src/test/unit/converters/envelopeConverter.test.ts +168 -11
  194. package/src/test/unit/index/memoryIndex.test.ts +99 -14
  195. package/src/test/unit/ingest/antagonistCycleAndParity.test.ts +23 -18
  196. package/src/test/unit/ingest/cycleGuard.test.ts +44 -2
  197. package/src/test/unit/ingest/orchestrator.test.ts +234 -41
  198. package/src/test/unit/retrieve/linkTraversalRetriever.test.ts +134 -35
  199. package/src/test/unit/retrieve/retrievers.test.ts +381 -25
  200. package/src/test/unit/store/embedOnWrite.test.ts +83 -11
  201. package/src/test/unit/store/listScoped.test.ts +138 -0
  202. package/src/test/unit/store/rankAxis.test.ts +349 -0
  203. package/src/test/unit/tools/memoryTools.test.ts +362 -13
  204. package/src/test/unit/types/writePolicy.test.ts +11 -2
  205. package/src/test/unit/vector/inMemoryCosineIndex.test.ts +115 -39
  206. package/src/test/unit/vector/vectorIndex.test.ts +33 -17
  207. package/temp/build/lint/_eslint-5eVG3S6w.json +41 -33
  208. package/temp/build/typescript/ts_8nwakTlr.json +1 -1
  209. package/temp/ts-agent-memory.api.json +1080 -136
  210. package/temp/ts-agent-memory.api.md +64 -22
@@ -7,6 +7,10 @@ Object.defineProperty(exports, "__esModule", { value: true });
7
7
  require("@fgv/ts-utils-jest");
8
8
  const ts_utils_1 = require("@fgv/ts-utils");
9
9
  const index_1 = require("../../../index");
10
+ /** A scope-qualified target from a `(scope, id)` pair. */
11
+ function target(scope, id) {
12
+ return { scope: scope, id: id };
13
+ }
10
14
  /** A trivial record carrying just the id + a marker body, for rebuild tests. */
11
15
  function record(id, body = `body-${id}`) {
12
16
  return {
@@ -15,6 +19,10 @@ function record(id, body = `body-${id}`) {
15
19
  body
16
20
  };
17
21
  }
22
+ /** A scope-qualified record entry for a rebuild source. */
23
+ function scoped(scope, id, body) {
24
+ return { target: target(scope, id), record: record(id, body) };
25
+ }
18
26
  /** A scripted record source for `rebuild`. */
19
27
  class FakeSource {
20
28
  constructor(result) {
@@ -26,30 +34,51 @@ class FakeSource {
26
34
  }
27
35
  describe('InMemoryCosineIndex', () => {
28
36
  describe('add', () => {
29
- test('returns the id as the embedding ref and tracks size', async () => {
37
+ test('returns the scoped-target key as the embedding ref and tracks size', async () => {
30
38
  const index = index_1.InMemoryCosineIndex.create().orThrow();
31
39
  expect(index.size).toBe(0);
32
- expect(await index.add('a', Float32Array.from([1, 0]))).toSucceedWith('a');
40
+ const t = target('conv-a', 'turn-1');
41
+ expect(await index.add(t, Float32Array.from([1, 0]))).toSucceedWith(`conv-a\0turn-1`);
33
42
  expect(index.size).toBe(1);
34
43
  });
35
- test('replaces the vector on a same-id add', async () => {
44
+ test('replaces the vector on a same-target add', async () => {
36
45
  const index = index_1.InMemoryCosineIndex.create().orThrow();
37
- expect(await index.add('a', Float32Array.from([1, 0]))).toSucceed();
38
- expect(await index.add('a', Float32Array.from([0, 1]))).toSucceed();
46
+ const t = target('conv-a', 'turn-1');
47
+ expect(await index.add(t, Float32Array.from([1, 0]))).toSucceed();
48
+ expect(await index.add(t, Float32Array.from([0, 1]))).toSucceed();
39
49
  expect(index.size).toBe(1);
40
50
  // The query now matches the replacement vector ([0,1]) not the original.
41
51
  expect(await index.query(Float32Array.from([0, 1]), 1)).toSucceedAndSatisfy((hits) => {
42
52
  expect(hits[0].score).toBeCloseTo(1);
43
53
  });
44
54
  });
55
+ test('same stem in different scopes are distinct entries — the second add does NOT clobber the first', async () => {
56
+ const index = index_1.InMemoryCosineIndex.create().orThrow();
57
+ const a = target('conv-a', 'turn-3');
58
+ const b = target('conv-b', 'turn-3');
59
+ // Two records with the identical stem, orthogonal embeddings.
60
+ expect(await index.add(a, Float32Array.from([1, 0]))).toSucceed();
61
+ expect(await index.add(b, Float32Array.from([0, 1]))).toSucceed();
62
+ // The bug: a bare-id index would have collapsed these to one entry.
63
+ expect(index.size).toBe(2);
64
+ // A query surfaces BOTH as distinct hits carrying distinct scoped targets.
65
+ expect(await index.query(Float32Array.from([1, 1]), 5)).toSucceedAndSatisfy((hits) => {
66
+ expect(hits).toHaveLength(2);
67
+ expect(hits.map((h) => h.target)).toEqual(expect.arrayContaining([a, b]));
68
+ // Each retains its OWN embedding: a matches [1,0], b matches [0,1].
69
+ const byScope = new Map(hits.map((h) => [h.target.scope, h.score]));
70
+ expect(byScope.get('conv-a')).toBeCloseTo(1 / Math.sqrt(2));
71
+ expect(byScope.get('conv-b')).toBeCloseTo(1 / Math.sqrt(2));
72
+ });
73
+ });
45
74
  test('fails loudly on an empty vector', async () => {
46
75
  const index = index_1.InMemoryCosineIndex.create().orThrow();
47
- expect(await index.add('a', new Float32Array(0))).toFailWith(/empty vector/i);
76
+ expect(await index.add(target('conv-a', 'turn-1'), new Float32Array(0))).toFailWith(/empty vector/i);
48
77
  });
49
78
  test('stores a defensive copy — mutating the caller buffer after add does not corrupt the index', async () => {
50
79
  const index = index_1.InMemoryCosineIndex.create().orThrow();
51
80
  const buffer = Float32Array.from([1, 0]);
52
- (await index.add('a', buffer)).orThrow();
81
+ (await index.add(target('conv-a', 'turn-1'), buffer)).orThrow();
53
82
  // Mutate the caller's buffer after the add; the stored vector must be unaffected.
54
83
  buffer[0] = 0;
55
84
  buffer[1] = 1;
@@ -60,22 +89,22 @@ describe('InMemoryCosineIndex', () => {
60
89
  });
61
90
  test('fails loudly on a dimension mismatch against the established dimension', async () => {
62
91
  const index = index_1.InMemoryCosineIndex.create().orThrow();
63
- expect(await index.add('a', Float32Array.from([1, 0]))).toSucceed();
64
- expect(await index.add('b', Float32Array.from([1, 0, 0]))).toFailWith(/dimension 3 does not match index dimension 2/i);
92
+ expect(await index.add(target('conv-a', 'a'), Float32Array.from([1, 0]))).toSucceed();
93
+ expect(await index.add(target('conv-a', 'b'), Float32Array.from([1, 0, 0]))).toFailWith(/dimension 3 does not match index dimension 2/i);
65
94
  });
66
95
  });
67
96
  describe('query', () => {
68
97
  async function seeded() {
69
98
  const index = index_1.InMemoryCosineIndex.create().orThrow();
70
- (await index.add('a', Float32Array.from([1, 0]))).orThrow();
71
- (await index.add('b', Float32Array.from([0, 1]))).orThrow();
72
- (await index.add('c', Float32Array.from([1, 1]))).orThrow();
99
+ (await index.add(target('s', 'a'), Float32Array.from([1, 0]))).orThrow();
100
+ (await index.add(target('s', 'b'), Float32Array.from([0, 1]))).orThrow();
101
+ (await index.add(target('s', 'c'), Float32Array.from([1, 1]))).orThrow();
73
102
  return index;
74
103
  }
75
104
  test('returns hits in descending cosine-similarity order', async () => {
76
105
  const index = await seeded();
77
106
  expect(await index.query(Float32Array.from([1, 0]), 3)).toSucceedAndSatisfy((hits) => {
78
- expect(hits.map((h) => h.id)).toEqual(['a', 'c', 'b']);
107
+ expect(hits.map((h) => h.target.id)).toEqual(['a', 'c', 'b']);
79
108
  expect(hits[0].score).toBeCloseTo(1);
80
109
  expect(hits[1].score).toBeCloseTo(1 / Math.sqrt(2));
81
110
  expect(hits[2].score).toBeCloseTo(0);
@@ -84,7 +113,7 @@ describe('InMemoryCosineIndex', () => {
84
113
  test('truncates to topK', async () => {
85
114
  const index = await seeded();
86
115
  expect(await index.query(Float32Array.from([1, 0]), 2)).toSucceedAndSatisfy((hits) => {
87
- expect(hits.map((h) => h.id)).toEqual(['a', 'c']);
116
+ expect(hits.map((h) => h.target.id)).toEqual(['a', 'c']);
88
117
  });
89
118
  });
90
119
  test('returns empty for a non-positive topK', async () => {
@@ -102,16 +131,16 @@ describe('InMemoryCosineIndex', () => {
102
131
  });
103
132
  test('scores a degenerate (zero-magnitude) stored vector as 0 rather than NaN', async () => {
104
133
  const index = index_1.InMemoryCosineIndex.create().orThrow();
105
- (await index.add('zero', Float32Array.from([0, 0]))).orThrow();
106
- (await index.add('unit', Float32Array.from([1, 0]))).orThrow();
134
+ (await index.add(target('s', 'zero'), Float32Array.from([0, 0]))).orThrow();
135
+ (await index.add(target('s', 'unit'), Float32Array.from([1, 0]))).orThrow();
107
136
  expect(await index.query(Float32Array.from([1, 0]), 2)).toSucceedAndSatisfy((hits) => {
108
- expect(hits.map((h) => h.id)).toEqual(['unit', 'zero']);
137
+ expect(hits.map((h) => h.target.id)).toEqual(['unit', 'zero']);
109
138
  expect(hits[1].score).toBe(0);
110
139
  });
111
140
  });
112
141
  test('scores against a degenerate (zero-magnitude) query as 0 rather than NaN', async () => {
113
142
  const index = index_1.InMemoryCosineIndex.create().orThrow();
114
- (await index.add('unit', Float32Array.from([1, 0]))).orThrow();
143
+ (await index.add(target('s', 'unit'), Float32Array.from([1, 0]))).orThrow();
115
144
  expect(await index.query(Float32Array.from([0, 0]), 1)).toSucceedAndSatisfy((hits) => {
116
145
  expect(hits[0].score).toBe(0);
117
146
  });
@@ -120,17 +149,35 @@ describe('InMemoryCosineIndex', () => {
120
149
  describe('remove', () => {
121
150
  test('removes a vector and is reflected in subsequent queries', async () => {
122
151
  const index = index_1.InMemoryCosineIndex.create().orThrow();
123
- (await index.add('a', Float32Array.from([1, 0]))).orThrow();
124
- (await index.add('b', Float32Array.from([0, 1]))).orThrow();
125
- expect(await index.remove('a')).toSucceedWith('a');
152
+ const a = target('s', 'a');
153
+ const b = target('s', 'b');
154
+ (await index.add(a, Float32Array.from([1, 0]))).orThrow();
155
+ (await index.add(b, Float32Array.from([0, 1]))).orThrow();
156
+ expect(await index.remove(a)).toSucceedWith(a);
126
157
  expect(index.size).toBe(1);
127
158
  expect(await index.query(Float32Array.from([1, 0]), 5)).toSucceedAndSatisfy((hits) => {
128
- expect(hits.map((h) => h.id)).toEqual(['b']);
159
+ expect(hits.map((h) => h.target.id)).toEqual(['b']);
160
+ });
161
+ });
162
+ test('removes only the scoped target — a same-stem record in another scope is left intact', async () => {
163
+ const index = index_1.InMemoryCosineIndex.create().orThrow();
164
+ const a = target('conv-a', 'turn-3');
165
+ const b = target('conv-b', 'turn-3');
166
+ (await index.add(a, Float32Array.from([1, 0]))).orThrow();
167
+ (await index.add(b, Float32Array.from([0, 1]))).orThrow();
168
+ expect(await index.remove(a)).toSucceedWith(a);
169
+ expect(index.size).toBe(1);
170
+ // conv-b's embedding survives untouched.
171
+ expect(await index.query(Float32Array.from([0, 1]), 5)).toSucceedAndSatisfy((hits) => {
172
+ expect(hits).toHaveLength(1);
173
+ expect(hits[0].target).toEqual(b);
174
+ expect(hits[0].score).toBeCloseTo(1);
129
175
  });
130
176
  });
131
- test('is idempotent — removing an absent id still succeeds', async () => {
177
+ test('is idempotent — removing an absent target still succeeds', async () => {
132
178
  const index = index_1.InMemoryCosineIndex.create().orThrow();
133
- expect(await index.remove('missing')).toSucceedWith('missing');
179
+ const t = target('s', 'missing');
180
+ expect(await index.remove(t)).toSucceedWith(t);
134
181
  });
135
182
  });
136
183
  describe('rebuild', () => {
@@ -139,21 +186,33 @@ describe('InMemoryCosineIndex', () => {
139
186
  const code = r.envelope.id.charCodeAt(0);
140
187
  return Promise.resolve((0, ts_utils_1.succeed)(Float32Array.from([code, 1])));
141
188
  };
142
- test('re-embeds every record from the source and reports the count', async () => {
189
+ test('re-embeds every scoped record from the source and reports the count', async () => {
143
190
  const index = index_1.InMemoryCosineIndex.create().orThrow();
144
- const source = new FakeSource((0, ts_utils_1.succeed)([record('a'), record('b'), record('c')]));
191
+ const source = new FakeSource((0, ts_utils_1.succeed)([scoped('s', 'a'), scoped('s', 'b'), scoped('s', 'c')]));
145
192
  expect(await index.rebuild(source, embed)).toSucceedWith(3);
146
193
  expect(index.size).toBe(3);
147
194
  expect(await index.query(Float32Array.from([99, 1]), 1)).toSucceedAndSatisfy((hits) => {
148
195
  // 'c' = char code 99, the closest to the query vector.
149
- expect(hits[0].id).toBe('c');
196
+ expect(hits[0].target.id).toBe('c');
197
+ });
198
+ });
199
+ test('keeps same-stem records under different scopes distinct across a rebuild', async () => {
200
+ const index = index_1.InMemoryCosineIndex.create().orThrow();
201
+ const source = new FakeSource((0, ts_utils_1.succeed)([scoped('conv-a', 'turn-3'), scoped('conv-b', 'turn-3')]));
202
+ // The embedder keys only off the (shared) id, so a bare-id rebuild would
203
+ // index just one entry; the scoped rebuild indexes both.
204
+ expect(await index.rebuild(source, embed)).toSucceedWith(2);
205
+ expect(index.size).toBe(2);
206
+ expect(await index.query(Float32Array.from([116, 1]), 5)).toSucceedAndSatisfy((hits) => {
207
+ expect(hits).toHaveLength(2);
208
+ expect(hits.map((h) => h.target.scope).sort()).toEqual(['conv-a', 'conv-b']);
150
209
  });
151
210
  });
152
211
  test('clears prior contents and re-establishes the dimension', async () => {
153
212
  const index = index_1.InMemoryCosineIndex.create().orThrow();
154
213
  // Seed a 3-dim vector, then rebuild with a 2-dim embedder.
155
- (await index.add('old', Float32Array.from([1, 2, 3]))).orThrow();
156
- const source = new FakeSource((0, ts_utils_1.succeed)([record('a')]));
214
+ (await index.add(target('s', 'old'), Float32Array.from([1, 2, 3]))).orThrow();
215
+ const source = new FakeSource((0, ts_utils_1.succeed)([scoped('s', 'a')]));
157
216
  expect(await index.rebuild(source, embed)).toSucceedWith(1);
158
217
  expect(index.size).toBe(1);
159
218
  // The 2-dim query now succeeds (dimension was reset by rebuild).
@@ -162,7 +221,7 @@ describe('InMemoryCosineIndex', () => {
162
221
  test('fails loudly when the source list fails', async () => {
163
222
  const index = index_1.InMemoryCosineIndex.create().orThrow();
164
223
  // Seed an entry so the reset-before-list rollback is observable, not just "stayed empty".
165
- (await index.add('seed', Float32Array.from([1, 1]))).orThrow();
224
+ (await index.add(target('s', 'seed'), Float32Array.from([1, 1]))).orThrow();
166
225
  const source = new FakeSource((0, ts_utils_1.fail)('disk gone'));
167
226
  expect(await index.rebuild(source, embed)).toFailWith(/failed to list records: disk gone/i);
168
227
  expect(index.size).toBe(0);
@@ -170,21 +229,22 @@ describe('InMemoryCosineIndex', () => {
170
229
  test('fails loudly and rolls back to empty when an embedding fails mid-rebuild', async () => {
171
230
  const index = index_1.InMemoryCosineIndex.create().orThrow();
172
231
  // Seed an existing entry so the rollback (not merely "stayed empty") is observable.
173
- (await index.add('seed', Float32Array.from([1, 1]))).orThrow();
232
+ (await index.add(target('s', 'seed'), Float32Array.from([1, 1]))).orThrow();
174
233
  // First record embeds fine, the second fails — so a naive impl would leave
175
234
  // record 'a' indexed; the rollback must clear it.
176
235
  let calls = 0;
177
- const flakyEmbed = (r) => {
236
+ const flakyEmbed = () => {
178
237
  calls += 1;
179
238
  return Promise.resolve(calls === 1 ? (0, ts_utils_1.succeed)(Float32Array.from([1, 1])) : (0, ts_utils_1.fail)('no model'));
180
239
  };
181
- const source = new FakeSource((0, ts_utils_1.succeed)([record('a'), record('b')]));
182
- expect(await index.rebuild(source, flakyEmbed)).toFailWith(/embedding 'b' failed: no model/i);
240
+ const source = new FakeSource((0, ts_utils_1.succeed)([scoped('conv-a', 'turn-1'), scoped('conv-b', 'turn-1')]));
241
+ // The failing record's error names its scope-qualified key.
242
+ expect(await index.rebuild(source, flakyEmbed)).toFailWith(/embedding 'conv-b\0turn-1' failed: no model/i);
183
243
  expect(index.size).toBe(0);
184
244
  });
185
245
  test('fails loudly and rolls back to empty when adding an embedded vector fails', async () => {
186
246
  const index = index_1.InMemoryCosineIndex.create().orThrow();
187
- const source = new FakeSource((0, ts_utils_1.succeed)([record('a')]));
247
+ const source = new FakeSource((0, ts_utils_1.succeed)([scoped('s', 'a')]));
188
248
  const emptyEmbed = () => Promise.resolve((0, ts_utils_1.succeed)(new Float32Array(0)));
189
249
  expect(await index.rebuild(source, emptyEmbed)).toFailWith(/empty vector/i);
190
250
  expect(index.size).toBe(0);
@@ -1 +1 @@
1
- {"version":3,"file":"inMemoryCosineIndex.test.js","sourceRoot":"","sources":["../../../../src/test/unit/vector/inMemoryCosineIndex.test.ts"],"names":[],"mappings":";AAAA;;;GAGG;;AAEH,8BAA4B;AAC5B,4CAAsD;AACtD,0CAMwB;AAExB,gFAAgF;AAChF,SAAS,MAAM,CAAC,EAAU,EAAE,OAAe,QAAQ,EAAE,EAAE;IACrD,OAAO;QACL,0EAA0E;QAC1E,QAAQ,EAAE,EAAE,EAAE,EAAE,EAAc,EAAwC;QACtE,IAAI;KACL,CAAC;AACJ,CAAC;AAED,8CAA8C;AAC9C,MAAM,UAAU;IAEd,YAAmB,MAAqD;QACtE,IAAI,CAAC,OAAO,GAAG,MAAM,CAAC;IACxB,CAAC;IACM,IAAI;QACT,OAAO,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IACvC,CAAC;CACF;AAED,QAAQ,CAAC,qBAAqB,EAAE,GAAG,EAAE;IACnC,QAAQ,CAAC,KAAK,EAAE,GAAG,EAAE;QACnB,IAAI,CAAC,qDAAqD,EAAE,KAAK,IAAI,EAAE;YACrE,MAAM,KAAK,GAAG,2BAAmB,CAAC,MAAM,EAAE,CAAC,OAAO,EAAE,CAAC;YACrD,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAC3B,MAAM,CAAC,MAAM,KAAK,CAAC,GAAG,CAAC,GAAe,EAAE,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC;YACvF,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC7B,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,sCAAsC,EAAE,KAAK,IAAI,EAAE;YACtD,MAAM,KAAK,GAAG,2BAAmB,CAAC,MAAM,EAAE,CAAC,OAAO,EAAE,CAAC;YACrD,MAAM,CAAC,MAAM,KAAK,CAAC,GAAG,CAAC,GAAe,EAAE,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC;YAChF,MAAM,CAAC,MAAM,KAAK,CAAC,GAAG,CAAC,GAAe,EAAE,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC;YAChF,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAC3B,yEAAyE;YACzE,MAAM,CAAC,MAAM,KAAK,CAAC,KAAK,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,mBAAmB,CACzE,CAAC,IAAoC,EAAE,EAAE;gBACvC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;YACvC,CAAC,CACF,CAAC;QACJ,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,iCAAiC,EAAE,KAAK,IAAI,EAAE;YACjD,MAAM,KAAK,GAAG,2BAAmB,CAAC,MAAM,EAAE,CAAC,OAAO,EAAE,CAAC;YACrD,MAAM,CAAC,MAAM,KAAK,CAAC,GAAG,CAAC,GAAe,EAAE,IAAI,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,eAAe,CAAC,CAAC;QAC5F,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,2FAA2F,EAAE,KAAK,IAAI,EAAE;YAC3G,MAAM,KAAK,GAAG,2BAAmB,CAAC,MAAM,EAAE,CAAC,OAAO,EAAE,CAAC;YACrD,MAAM,MAAM,GAAG,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YACzC,CAAC,MAAM,KAAK,CAAC,GAAG,CAAC,GAAe,EAAE,MAAM,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;YACrD,kFAAkF;YAClF,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;YACd,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;YACd,MAAM,CAAC,MAAM,KAAK,CAAC,KAAK,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,mBAAmB,CACzE,CAAC,IAAoC,EAAE,EAAE;gBACvC,yEAAyE;gBACzE,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;YACvC,CAAC,CACF,CAAC;QACJ,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,wEAAwE,EAAE,KAAK,IAAI,EAAE;YACxF,MAAM,KAAK,GAAG,2BAAmB,CAAC,MAAM,EAAE,CAAC,OAAO,EAAE,CAAC;YACrD,MAAM,CAAC,MAAM,KAAK,CAAC,GAAG,CAAC,GAAe,EAAE,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC;YAChF,MAAM,CAAC,MAAM,KAAK,CAAC,GAAG,CAAC,GAAe,EAAE,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,UAAU,CAC/E,+CAA+C,CAChD,CAAC;QACJ,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,OAAO,EAAE,GAAG,EAAE;QACrB,KAAK,UAAU,MAAM;YACnB,MAAM,KAAK,GAAG,2BAAmB,CAAC,MAAM,EAAE,CAAC,OAAO,EAAE,CAAC;YACrD,CAAC,MAAM,KAAK,CAAC,GAAG,CAAC,GAAe,EAAE,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;YACxE,CAAC,MAAM,KAAK,CAAC,GAAG,CAAC,GAAe,EAAE,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;YACxE,CAAC,MAAM,KAAK,CAAC,GAAG,CAAC,GAAe,EAAE,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;YACxE,OAAO,KAAK,CAAC;QACf,CAAC;QAED,IAAI,CAAC,oDAAoD,EAAE,KAAK,IAAI,EAAE;YACpE,MAAM,KAAK,GAAG,MAAM,MAAM,EAAE,CAAC;YAC7B,MAAM,CAAC,MAAM,KAAK,CAAC,KAAK,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,mBAAmB,CACzE,CAAC,IAAoC,EAAE,EAAE;gBACvC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;gBACvD,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;gBACrC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,WAAW,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;gBACpD,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;YACvC,CAAC,CACF,CAAC;QACJ,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,mBAAmB,EAAE,KAAK,IAAI,EAAE;YACnC,MAAM,KAAK,GAAG,MAAM,MAAM,EAAE,CAAC;YAC7B,MAAM,CAAC,MAAM,KAAK,CAAC,KAAK,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,mBAAmB,CACzE,CAAC,IAAoC,EAAE,EAAE;gBACvC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;YACpD,CAAC,CACF,CAAC;QACJ,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,uCAAuC,EAAE,KAAK,IAAI,EAAE;YACvD,MAAM,KAAK,GAAG,MAAM,MAAM,EAAE,CAAC;YAC7B,MAAM,CAAC,MAAM,KAAK,CAAC,KAAK,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,EAAE,CAAC,CAAC;YAC1E,MAAM,CAAC,MAAM,KAAK,CAAC,KAAK,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,EAAE,CAAC,CAAC;QAC7E,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,4DAA4D,EAAE,KAAK,IAAI,EAAE;YAC5E,MAAM,KAAK,GAAG,2BAAmB,CAAC,MAAM,EAAE,CAAC,OAAO,EAAE,CAAC;YACrD,MAAM,CAAC,MAAM,KAAK,CAAC,KAAK,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,EAAE,CAAC,CAAC;QAClF,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,4CAA4C,EAAE,KAAK,IAAI,EAAE;YAC5D,MAAM,KAAK,GAAG,MAAM,MAAM,EAAE,CAAC;YAC7B,MAAM,CAAC,MAAM,KAAK,CAAC,KAAK,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,UAAU,CACnE,qDAAqD,CACtD,CAAC;QACJ,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,yEAAyE,EAAE,KAAK,IAAI,EAAE;YACzF,MAAM,KAAK,GAAG,2BAAmB,CAAC,MAAM,EAAE,CAAC,OAAO,EAAE,CAAC;YACrD,CAAC,MAAM,KAAK,CAAC,GAAG,CAAC,MAAkB,EAAE,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;YAC3E,CAAC,MAAM,KAAK,CAAC,GAAG,CAAC,MAAkB,EAAE,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;YAC3E,MAAM,CAAC,MAAM,KAAK,CAAC,KAAK,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,mBAAmB,CACzE,CAAC,IAAoC,EAAE,EAAE;gBACvC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC;gBACxD,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAChC,CAAC,CACF,CAAC;QACJ,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,yEAAyE,EAAE,KAAK,IAAI,EAAE;YACzF,MAAM,KAAK,GAAG,2BAAmB,CAAC,MAAM,EAAE,CAAC,OAAO,EAAE,CAAC;YACrD,CAAC,MAAM,KAAK,CAAC,GAAG,CAAC,MAAkB,EAAE,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;YAC3E,MAAM,CAAC,MAAM,KAAK,CAAC,KAAK,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,mBAAmB,CACzE,CAAC,IAAoC,EAAE,EAAE;gBACvC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAChC,CAAC,CACF,CAAC;QACJ,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,QAAQ,EAAE,GAAG,EAAE;QACtB,IAAI,CAAC,yDAAyD,EAAE,KAAK,IAAI,EAAE;YACzE,MAAM,KAAK,GAAG,2BAAmB,CAAC,MAAM,EAAE,CAAC,OAAO,EAAE,CAAC;YACrD,CAAC,MAAM,KAAK,CAAC,GAAG,CAAC,GAAe,EAAE,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;YACxE,CAAC,MAAM,KAAK,CAAC,GAAG,CAAC,GAAe,EAAE,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;YACxE,MAAM,CAAC,MAAM,KAAK,CAAC,MAAM,CAAC,GAAe,CAAC,CAAC,CAAC,aAAa,CAAC,GAAe,CAAC,CAAC;YAC3E,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAC3B,MAAM,CAAC,MAAM,KAAK,CAAC,KAAK,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,mBAAmB,CACzE,CAAC,IAAoC,EAAE,EAAE;gBACvC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAC/C,CAAC,CACF,CAAC;QACJ,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,sDAAsD,EAAE,KAAK,IAAI,EAAE;YACtE,MAAM,KAAK,GAAG,2BAAmB,CAAC,MAAM,EAAE,CAAC,OAAO,EAAE,CAAC;YACrD,MAAM,CAAC,MAAM,KAAK,CAAC,MAAM,CAAC,SAAqB,CAAC,CAAC,CAAC,aAAa,CAAC,SAAqB,CAAC,CAAC;QACzF,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,SAAS,EAAE,GAAG,EAAE;QACvB,MAAM,KAAK,GAAG,CAAC,CAAyB,EAAiC,EAAE;YACzE,kEAAkE;YAClE,MAAM,IAAI,GAAY,CAAC,CAAC,QAAQ,CAAC,EAAa,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;YAC7D,OAAO,OAAO,CAAC,OAAO,CAAC,IAAA,kBAAO,EAAC,YAAY,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAChE,CAAC,CAAC;QAEF,IAAI,CAAC,8DAA8D,EAAE,KAAK,IAAI,EAAE;YAC9E,MAAM,KAAK,GAAG,2BAAmB,CAAC,MAAM,EAAE,CAAC,OAAO,EAAE,CAAC;YACrD,MAAM,MAAM,GAAG,IAAI,UAAU,CAAC,IAAA,kBAAO,EAAC,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,MAAM,CAAC,GAAG,CAAC,EAAE,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YAChF,MAAM,CAAC,MAAM,KAAK,CAAC,OAAO,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC;YAC5D,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAC3B,MAAM,CAAC,MAAM,KAAK,CAAC,KAAK,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,mBAAmB,CAC1E,CAAC,IAAoC,EAAE,EAAE;gBACvC,uDAAuD;gBACvD,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YAC/B,CAAC,CACF,CAAC;QACJ,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,wDAAwD,EAAE,KAAK,IAAI,EAAE;YACxE,MAAM,KAAK,GAAG,2BAAmB,CAAC,MAAM,EAAE,CAAC,OAAO,EAAE,CAAC;YACrD,2DAA2D;YAC3D,CAAC,MAAM,KAAK,CAAC,GAAG,CAAC,KAAiB,EAAE,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;YAC7E,MAAM,MAAM,GAAG,IAAI,UAAU,CAAC,IAAA,kBAAO,EAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YACtD,MAAM,CAAC,MAAM,KAAK,CAAC,OAAO,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC;YAC5D,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAC3B,iEAAiE;YACjE,MAAM,CAAC,MAAM,KAAK,CAAC,KAAK,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC;QACvE,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,yCAAyC,EAAE,KAAK,IAAI,EAAE;YACzD,MAAM,KAAK,GAAG,2BAAmB,CAAC,MAAM,EAAE,CAAC,OAAO,EAAE,CAAC;YACrD,0FAA0F;YAC1F,CAAC,MAAM,KAAK,CAAC,GAAG,CAAC,MAAkB,EAAE,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;YAC3E,MAAM,MAAM,GAAG,IAAI,UAAU,CAAC,IAAA,eAAI,EAAC,WAAW,CAAC,CAAC,CAAC;YACjD,MAAM,CAAC,MAAM,KAAK,CAAC,OAAO,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC,CAAC,UAAU,CAAC,oCAAoC,CAAC,CAAC;YAC5F,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC7B,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,0EAA0E,EAAE,KAAK,IAAI,EAAE;YAC1F,MAAM,KAAK,GAAG,2BAAmB,CAAC,MAAM,EAAE,CAAC,OAAO,EAAE,CAAC;YACrD,oFAAoF;YACpF,CAAC,MAAM,KAAK,CAAC,GAAG,CAAC,MAAkB,EAAE,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;YAC3E,2EAA2E;YAC3E,kDAAkD;YAClD,IAAI,KAAK,GAAW,CAAC,CAAC;YACtB,MAAM,UAAU,GAAG,CAAC,CAAyB,EAAiC,EAAE;gBAC9E,KAAK,IAAI,CAAC,CAAC;gBACX,OAAO,OAAO,CAAC,OAAO,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,IAAA,kBAAO,EAAC,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAA,eAAI,EAAC,UAAU,CAAC,CAAC,CAAC;YAC9F,CAAC,CAAC;YACF,MAAM,MAAM,GAAG,IAAI,UAAU,CAAC,IAAA,kBAAO,EAAC,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YACnE,MAAM,CAAC,MAAM,KAAK,CAAC,OAAO,CAAC,MAAM,EAAE,UAAU,CAAC,CAAC,CAAC,UAAU,CAAC,iCAAiC,CAAC,CAAC;YAC9F,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC7B,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,2EAA2E,EAAE,KAAK,IAAI,EAAE;YAC3F,MAAM,KAAK,GAAG,2BAAmB,CAAC,MAAM,EAAE,CAAC,OAAO,EAAE,CAAC;YACrD,MAAM,MAAM,GAAG,IAAI,UAAU,CAAC,IAAA,kBAAO,EAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YACtD,MAAM,UAAU,GAAG,GAAkC,EAAE,CAAC,OAAO,CAAC,OAAO,CAAC,IAAA,kBAAO,EAAC,IAAI,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YACtG,MAAM,CAAC,MAAM,KAAK,CAAC,OAAO,CAAC,MAAM,EAAE,UAAU,CAAC,CAAC,CAAC,UAAU,CAAC,eAAe,CAAC,CAAC;YAC5E,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC7B,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC","sourcesContent":["/*\n * Copyright (c) 2026 Erik Fortune\n * SPDX-License-Identifier: MIT\n */\n\nimport '@fgv/ts-utils-jest';\nimport { Result, fail, succeed } from '@fgv/ts-utils';\nimport {\n IMemoryRecord,\n IMemoryRecordSource,\n IVectorQueryHit,\n InMemoryCosineIndex,\n MemoryId\n} from '../../../index';\n\n/** A trivial record carrying just the id + a marker body, for rebuild tests. */\nfunction record(id: string, body: string = `body-${id}`): IMemoryRecord<unknown> {\n return {\n // The cosine index only reads `envelope.id`; a minimal envelope suffices.\n envelope: { id: id as MemoryId } as IMemoryRecord<unknown>['envelope'],\n body\n };\n}\n\n/** A scripted record source for `rebuild`. */\nclass FakeSource implements IMemoryRecordSource {\n private readonly _result: Result<ReadonlyArray<IMemoryRecord<unknown>>>;\n public constructor(result: Result<ReadonlyArray<IMemoryRecord<unknown>>>) {\n this._result = result;\n }\n public list(): Promise<Result<ReadonlyArray<IMemoryRecord<unknown>>>> {\n return Promise.resolve(this._result);\n }\n}\n\ndescribe('InMemoryCosineIndex', () => {\n describe('add', () => {\n test('returns the id as the embedding ref and tracks size', async () => {\n const index = InMemoryCosineIndex.create().orThrow();\n expect(index.size).toBe(0);\n expect(await index.add('a' as MemoryId, Float32Array.from([1, 0]))).toSucceedWith('a');\n expect(index.size).toBe(1);\n });\n\n test('replaces the vector on a same-id add', async () => {\n const index = InMemoryCosineIndex.create().orThrow();\n expect(await index.add('a' as MemoryId, Float32Array.from([1, 0]))).toSucceed();\n expect(await index.add('a' as MemoryId, Float32Array.from([0, 1]))).toSucceed();\n expect(index.size).toBe(1);\n // The query now matches the replacement vector ([0,1]) not the original.\n expect(await index.query(Float32Array.from([0, 1]), 1)).toSucceedAndSatisfy(\n (hits: ReadonlyArray<IVectorQueryHit>) => {\n expect(hits[0].score).toBeCloseTo(1);\n }\n );\n });\n\n test('fails loudly on an empty vector', async () => {\n const index = InMemoryCosineIndex.create().orThrow();\n expect(await index.add('a' as MemoryId, new Float32Array(0))).toFailWith(/empty vector/i);\n });\n\n test('stores a defensive copy — mutating the caller buffer after add does not corrupt the index', async () => {\n const index = InMemoryCosineIndex.create().orThrow();\n const buffer = Float32Array.from([1, 0]);\n (await index.add('a' as MemoryId, buffer)).orThrow();\n // Mutate the caller's buffer after the add; the stored vector must be unaffected.\n buffer[0] = 0;\n buffer[1] = 1;\n expect(await index.query(Float32Array.from([1, 0]), 1)).toSucceedAndSatisfy(\n (hits: ReadonlyArray<IVectorQueryHit>) => {\n // Still maximally similar to [1,0] — proves the index kept its own copy.\n expect(hits[0].score).toBeCloseTo(1);\n }\n );\n });\n\n test('fails loudly on a dimension mismatch against the established dimension', async () => {\n const index = InMemoryCosineIndex.create().orThrow();\n expect(await index.add('a' as MemoryId, Float32Array.from([1, 0]))).toSucceed();\n expect(await index.add('b' as MemoryId, Float32Array.from([1, 0, 0]))).toFailWith(\n /dimension 3 does not match index dimension 2/i\n );\n });\n });\n\n describe('query', () => {\n async function seeded(): Promise<InMemoryCosineIndex> {\n const index = InMemoryCosineIndex.create().orThrow();\n (await index.add('a' as MemoryId, Float32Array.from([1, 0]))).orThrow();\n (await index.add('b' as MemoryId, Float32Array.from([0, 1]))).orThrow();\n (await index.add('c' as MemoryId, Float32Array.from([1, 1]))).orThrow();\n return index;\n }\n\n test('returns hits in descending cosine-similarity order', async () => {\n const index = await seeded();\n expect(await index.query(Float32Array.from([1, 0]), 3)).toSucceedAndSatisfy(\n (hits: ReadonlyArray<IVectorQueryHit>) => {\n expect(hits.map((h) => h.id)).toEqual(['a', 'c', 'b']);\n expect(hits[0].score).toBeCloseTo(1);\n expect(hits[1].score).toBeCloseTo(1 / Math.sqrt(2));\n expect(hits[2].score).toBeCloseTo(0);\n }\n );\n });\n\n test('truncates to topK', async () => {\n const index = await seeded();\n expect(await index.query(Float32Array.from([1, 0]), 2)).toSucceedAndSatisfy(\n (hits: ReadonlyArray<IVectorQueryHit>) => {\n expect(hits.map((h) => h.id)).toEqual(['a', 'c']);\n }\n );\n });\n\n test('returns empty for a non-positive topK', async () => {\n const index = await seeded();\n expect(await index.query(Float32Array.from([1, 0]), 0)).toSucceedWith([]);\n expect(await index.query(Float32Array.from([1, 0]), -1)).toSucceedWith([]);\n });\n\n test('returns empty when the index is empty (no dimension check)', async () => {\n const index = InMemoryCosineIndex.create().orThrow();\n expect(await index.query(Float32Array.from([1, 2, 3, 4]), 5)).toSucceedWith([]);\n });\n\n test('fails loudly on a query-dimension mismatch', async () => {\n const index = await seeded();\n expect(await index.query(Float32Array.from([1, 0, 0]), 3)).toFailWith(\n /query dimension 3 does not match index dimension 2/i\n );\n });\n\n test('scores a degenerate (zero-magnitude) stored vector as 0 rather than NaN', async () => {\n const index = InMemoryCosineIndex.create().orThrow();\n (await index.add('zero' as MemoryId, Float32Array.from([0, 0]))).orThrow();\n (await index.add('unit' as MemoryId, Float32Array.from([1, 0]))).orThrow();\n expect(await index.query(Float32Array.from([1, 0]), 2)).toSucceedAndSatisfy(\n (hits: ReadonlyArray<IVectorQueryHit>) => {\n expect(hits.map((h) => h.id)).toEqual(['unit', 'zero']);\n expect(hits[1].score).toBe(0);\n }\n );\n });\n\n test('scores against a degenerate (zero-magnitude) query as 0 rather than NaN', async () => {\n const index = InMemoryCosineIndex.create().orThrow();\n (await index.add('unit' as MemoryId, Float32Array.from([1, 0]))).orThrow();\n expect(await index.query(Float32Array.from([0, 0]), 1)).toSucceedAndSatisfy(\n (hits: ReadonlyArray<IVectorQueryHit>) => {\n expect(hits[0].score).toBe(0);\n }\n );\n });\n });\n\n describe('remove', () => {\n test('removes a vector and is reflected in subsequent queries', async () => {\n const index = InMemoryCosineIndex.create().orThrow();\n (await index.add('a' as MemoryId, Float32Array.from([1, 0]))).orThrow();\n (await index.add('b' as MemoryId, Float32Array.from([0, 1]))).orThrow();\n expect(await index.remove('a' as MemoryId)).toSucceedWith('a' as MemoryId);\n expect(index.size).toBe(1);\n expect(await index.query(Float32Array.from([1, 0]), 5)).toSucceedAndSatisfy(\n (hits: ReadonlyArray<IVectorQueryHit>) => {\n expect(hits.map((h) => h.id)).toEqual(['b']);\n }\n );\n });\n\n test('is idempotent — removing an absent id still succeeds', async () => {\n const index = InMemoryCosineIndex.create().orThrow();\n expect(await index.remove('missing' as MemoryId)).toSucceedWith('missing' as MemoryId);\n });\n });\n\n describe('rebuild', () => {\n const embed = (r: IMemoryRecord<unknown>): Promise<Result<Float32Array>> => {\n // Deterministic: encode the id's first char code into a 2-vector.\n const code: number = (r.envelope.id as string).charCodeAt(0);\n return Promise.resolve(succeed(Float32Array.from([code, 1])));\n };\n\n test('re-embeds every record from the source and reports the count', async () => {\n const index = InMemoryCosineIndex.create().orThrow();\n const source = new FakeSource(succeed([record('a'), record('b'), record('c')]));\n expect(await index.rebuild(source, embed)).toSucceedWith(3);\n expect(index.size).toBe(3);\n expect(await index.query(Float32Array.from([99, 1]), 1)).toSucceedAndSatisfy(\n (hits: ReadonlyArray<IVectorQueryHit>) => {\n // 'c' = char code 99, the closest to the query vector.\n expect(hits[0].id).toBe('c');\n }\n );\n });\n\n test('clears prior contents and re-establishes the dimension', async () => {\n const index = InMemoryCosineIndex.create().orThrow();\n // Seed a 3-dim vector, then rebuild with a 2-dim embedder.\n (await index.add('old' as MemoryId, Float32Array.from([1, 2, 3]))).orThrow();\n const source = new FakeSource(succeed([record('a')]));\n expect(await index.rebuild(source, embed)).toSucceedWith(1);\n expect(index.size).toBe(1);\n // The 2-dim query now succeeds (dimension was reset by rebuild).\n expect(await index.query(Float32Array.from([97, 1]), 1)).toSucceed();\n });\n\n test('fails loudly when the source list fails', async () => {\n const index = InMemoryCosineIndex.create().orThrow();\n // Seed an entry so the reset-before-list rollback is observable, not just \"stayed empty\".\n (await index.add('seed' as MemoryId, Float32Array.from([1, 1]))).orThrow();\n const source = new FakeSource(fail('disk gone'));\n expect(await index.rebuild(source, embed)).toFailWith(/failed to list records: disk gone/i);\n expect(index.size).toBe(0);\n });\n\n test('fails loudly and rolls back to empty when an embedding fails mid-rebuild', async () => {\n const index = InMemoryCosineIndex.create().orThrow();\n // Seed an existing entry so the rollback (not merely \"stayed empty\") is observable.\n (await index.add('seed' as MemoryId, Float32Array.from([1, 1]))).orThrow();\n // First record embeds fine, the second fails — so a naive impl would leave\n // record 'a' indexed; the rollback must clear it.\n let calls: number = 0;\n const flakyEmbed = (r: IMemoryRecord<unknown>): Promise<Result<Float32Array>> => {\n calls += 1;\n return Promise.resolve(calls === 1 ? succeed(Float32Array.from([1, 1])) : fail('no model'));\n };\n const source = new FakeSource(succeed([record('a'), record('b')]));\n expect(await index.rebuild(source, flakyEmbed)).toFailWith(/embedding 'b' failed: no model/i);\n expect(index.size).toBe(0);\n });\n\n test('fails loudly and rolls back to empty when adding an embedded vector fails', async () => {\n const index = InMemoryCosineIndex.create().orThrow();\n const source = new FakeSource(succeed([record('a')]));\n const emptyEmbed = (): Promise<Result<Float32Array>> => Promise.resolve(succeed(new Float32Array(0)));\n expect(await index.rebuild(source, emptyEmbed)).toFailWith(/empty vector/i);\n expect(index.size).toBe(0);\n });\n });\n});\n"]}
1
+ {"version":3,"file":"inMemoryCosineIndex.test.js","sourceRoot":"","sources":["../../../../src/test/unit/vector/inMemoryCosineIndex.test.ts"],"names":[],"mappings":";AAAA;;;GAGG;;AAEH,8BAA4B;AAC5B,4CAAsD;AACtD,0CASwB;AAExB,0DAA0D;AAC1D,SAAS,MAAM,CAAC,KAAa,EAAE,EAAU;IACvC,OAAO,EAAE,KAAK,EAAE,KAAuB,EAAE,EAAE,EAAE,EAAc,EAAE,CAAC;AAChE,CAAC;AAED,gFAAgF;AAChF,SAAS,MAAM,CAAC,EAAU,EAAE,OAAe,QAAQ,EAAE,EAAE;IACrD,OAAO;QACL,0EAA0E;QAC1E,QAAQ,EAAE,EAAE,EAAE,EAAE,EAAc,EAAwC;QACtE,IAAI;KACL,CAAC;AACJ,CAAC;AAED,2DAA2D;AAC3D,SAAS,MAAM,CAAC,KAAa,EAAE,EAAU,EAAE,IAAa;IACtD,OAAO,EAAE,MAAM,EAAE,MAAM,CAAC,KAAK,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE,EAAE,IAAI,CAAC,EAAE,CAAC;AACjE,CAAC;AAED,8CAA8C;AAC9C,MAAM,UAAU;IAEd,YAAmB,MAAkD;QACnE,IAAI,CAAC,OAAO,GAAG,MAAM,CAAC;IACxB,CAAC;IACM,IAAI;QACT,OAAO,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IACvC,CAAC;CACF;AAED,QAAQ,CAAC,qBAAqB,EAAE,GAAG,EAAE;IACnC,QAAQ,CAAC,KAAK,EAAE,GAAG,EAAE;QACnB,IAAI,CAAC,oEAAoE,EAAE,KAAK,IAAI,EAAE;YACpF,MAAM,KAAK,GAAG,2BAAmB,CAAC,MAAM,EAAE,CAAC,OAAO,EAAE,CAAC;YACrD,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAC3B,MAAM,CAAC,GAAG,MAAM,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;YACrC,MAAM,CAAC,MAAM,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,gBAAgB,CAAC,CAAC;YACtF,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC7B,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,0CAA0C,EAAE,KAAK,IAAI,EAAE;YAC1D,MAAM,KAAK,GAAG,2BAAmB,CAAC,MAAM,EAAE,CAAC,OAAO,EAAE,CAAC;YACrD,MAAM,CAAC,GAAG,MAAM,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;YACrC,MAAM,CAAC,MAAM,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC;YAClE,MAAM,CAAC,MAAM,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC;YAClE,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAC3B,yEAAyE;YACzE,MAAM,CAAC,MAAM,KAAK,CAAC,KAAK,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,mBAAmB,CACzE,CAAC,IAAoC,EAAE,EAAE;gBACvC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;YACvC,CAAC,CACF,CAAC;QACJ,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,gGAAgG,EAAE,KAAK,IAAI,EAAE;YAChH,MAAM,KAAK,GAAG,2BAAmB,CAAC,MAAM,EAAE,CAAC,OAAO,EAAE,CAAC;YACrD,MAAM,CAAC,GAAG,MAAM,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;YACrC,MAAM,CAAC,GAAG,MAAM,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;YACrC,8DAA8D;YAC9D,MAAM,CAAC,MAAM,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC;YAClE,MAAM,CAAC,MAAM,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC;YAClE,oEAAoE;YACpE,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAC3B,2EAA2E;YAC3E,MAAM,CAAC,MAAM,KAAK,CAAC,KAAK,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,mBAAmB,CACzE,CAAC,IAAoC,EAAE,EAAE;gBACvC,MAAM,CAAC,IAAI,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;gBAC7B,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,MAAM,CAAC,eAAe,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC1E,oEAAoE;gBACpE,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;gBACpE,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,QAA0B,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC9E,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,QAA0B,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;YAChF,CAAC,CACF,CAAC;QACJ,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,iCAAiC,EAAE,KAAK,IAAI,EAAE;YACjD,MAAM,KAAK,GAAG,2BAAmB,CAAC,MAAM,EAAE,CAAC,OAAO,EAAE,CAAC;YACrD,MAAM,CAAC,MAAM,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,QAAQ,EAAE,QAAQ,CAAC,EAAE,IAAI,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,eAAe,CAAC,CAAC;QACvG,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,2FAA2F,EAAE,KAAK,IAAI,EAAE;YAC3G,MAAM,KAAK,GAAG,2BAAmB,CAAC,MAAM,EAAE,CAAC,OAAO,EAAE,CAAC;YACrD,MAAM,MAAM,GAAG,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YACzC,CAAC,MAAM,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,QAAQ,EAAE,QAAQ,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;YAChE,kFAAkF;YAClF,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;YACd,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;YACd,MAAM,CAAC,MAAM,KAAK,CAAC,KAAK,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,mBAAmB,CACzE,CAAC,IAAoC,EAAE,EAAE;gBACvC,yEAAyE;gBACzE,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;YACvC,CAAC,CACF,CAAC;QACJ,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,wEAAwE,EAAE,KAAK,IAAI,EAAE;YACxF,MAAM,KAAK,GAAG,2BAAmB,CAAC,MAAM,EAAE,CAAC,OAAO,EAAE,CAAC;YACrD,MAAM,CAAC,MAAM,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,QAAQ,EAAE,GAAG,CAAC,EAAE,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC;YACtF,MAAM,CAAC,MAAM,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,QAAQ,EAAE,GAAG,CAAC,EAAE,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,UAAU,CACrF,+CAA+C,CAChD,CAAC;QACJ,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,OAAO,EAAE,GAAG,EAAE;QACrB,KAAK,UAAU,MAAM;YACnB,MAAM,KAAK,GAAG,2BAAmB,CAAC,MAAM,EAAE,CAAC,OAAO,EAAE,CAAC;YACrD,CAAC,MAAM,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;YACzE,CAAC,MAAM,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;YACzE,CAAC,MAAM,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;YACzE,OAAO,KAAK,CAAC;QACf,CAAC;QAED,IAAI,CAAC,oDAAoD,EAAE,KAAK,IAAI,EAAE;YACpE,MAAM,KAAK,GAAG,MAAM,MAAM,EAAE,CAAC;YAC7B,MAAM,CAAC,MAAM,KAAK,CAAC,KAAK,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,mBAAmB,CACzE,CAAC,IAAoC,EAAE,EAAE;gBACvC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;gBAC9D,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;gBACrC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,WAAW,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;gBACpD,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;YACvC,CAAC,CACF,CAAC;QACJ,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,mBAAmB,EAAE,KAAK,IAAI,EAAE;YACnC,MAAM,KAAK,GAAG,MAAM,MAAM,EAAE,CAAC;YAC7B,MAAM,CAAC,MAAM,KAAK,CAAC,KAAK,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,mBAAmB,CACzE,CAAC,IAAoC,EAAE,EAAE;gBACvC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;YAC3D,CAAC,CACF,CAAC;QACJ,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,uCAAuC,EAAE,KAAK,IAAI,EAAE;YACvD,MAAM,KAAK,GAAG,MAAM,MAAM,EAAE,CAAC;YAC7B,MAAM,CAAC,MAAM,KAAK,CAAC,KAAK,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,EAAE,CAAC,CAAC;YAC1E,MAAM,CAAC,MAAM,KAAK,CAAC,KAAK,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,EAAE,CAAC,CAAC;QAC7E,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,4DAA4D,EAAE,KAAK,IAAI,EAAE;YAC5E,MAAM,KAAK,GAAG,2BAAmB,CAAC,MAAM,EAAE,CAAC,OAAO,EAAE,CAAC;YACrD,MAAM,CAAC,MAAM,KAAK,CAAC,KAAK,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,EAAE,CAAC,CAAC;QAClF,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,4CAA4C,EAAE,KAAK,IAAI,EAAE;YAC5D,MAAM,KAAK,GAAG,MAAM,MAAM,EAAE,CAAC;YAC7B,MAAM,CAAC,MAAM,KAAK,CAAC,KAAK,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,UAAU,CACnE,qDAAqD,CACtD,CAAC;QACJ,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,yEAAyE,EAAE,KAAK,IAAI,EAAE;YACzF,MAAM,KAAK,GAAG,2BAAmB,CAAC,MAAM,EAAE,CAAC,OAAO,EAAE,CAAC;YACrD,CAAC,MAAM,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,EAAE,MAAM,CAAC,EAAE,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;YAC5E,CAAC,MAAM,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,EAAE,MAAM,CAAC,EAAE,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;YAC5E,MAAM,CAAC,MAAM,KAAK,CAAC,KAAK,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,mBAAmB,CACzE,CAAC,IAAoC,EAAE,EAAE;gBACvC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC;gBAC/D,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAChC,CAAC,CACF,CAAC;QACJ,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,yEAAyE,EAAE,KAAK,IAAI,EAAE;YACzF,MAAM,KAAK,GAAG,2BAAmB,CAAC,MAAM,EAAE,CAAC,OAAO,EAAE,CAAC;YACrD,CAAC,MAAM,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,EAAE,MAAM,CAAC,EAAE,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;YAC5E,MAAM,CAAC,MAAM,KAAK,CAAC,KAAK,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,mBAAmB,CACzE,CAAC,IAAoC,EAAE,EAAE;gBACvC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAChC,CAAC,CACF,CAAC;QACJ,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,QAAQ,EAAE,GAAG,EAAE;QACtB,IAAI,CAAC,yDAAyD,EAAE,KAAK,IAAI,EAAE;YACzE,MAAM,KAAK,GAAG,2BAAmB,CAAC,MAAM,EAAE,CAAC,OAAO,EAAE,CAAC;YACrD,MAAM,CAAC,GAAG,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YAC3B,MAAM,CAAC,GAAG,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YAC3B,CAAC,MAAM,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;YAC1D,CAAC,MAAM,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;YAC1D,MAAM,CAAC,MAAM,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC;YAC/C,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAC3B,MAAM,CAAC,MAAM,KAAK,CAAC,KAAK,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,mBAAmB,CACzE,CAAC,IAAoC,EAAE,EAAE;gBACvC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YACtD,CAAC,CACF,CAAC;QACJ,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,qFAAqF,EAAE,KAAK,IAAI,EAAE;YACrG,MAAM,KAAK,GAAG,2BAAmB,CAAC,MAAM,EAAE,CAAC,OAAO,EAAE,CAAC;YACrD,MAAM,CAAC,GAAG,MAAM,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;YACrC,MAAM,CAAC,GAAG,MAAM,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;YACrC,CAAC,MAAM,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;YAC1D,CAAC,MAAM,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;YAC1D,MAAM,CAAC,MAAM,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC;YAC/C,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAC3B,yCAAyC;YACzC,MAAM,CAAC,MAAM,KAAK,CAAC,KAAK,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,mBAAmB,CACzE,CAAC,IAAoC,EAAE,EAAE;gBACvC,MAAM,CAAC,IAAI,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;gBAC7B,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;gBAClC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;YACvC,CAAC,CACF,CAAC;QACJ,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,0DAA0D,EAAE,KAAK,IAAI,EAAE;YAC1E,MAAM,KAAK,GAAG,2BAAmB,CAAC,MAAM,EAAE,CAAC,OAAO,EAAE,CAAC;YACrD,MAAM,CAAC,GAAG,MAAM,CAAC,GAAG,EAAE,SAAS,CAAC,CAAC;YACjC,MAAM,CAAC,MAAM,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC;QACjD,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,SAAS,EAAE,GAAG,EAAE;QACvB,MAAM,KAAK,GAAG,CAAC,CAAyB,EAAiC,EAAE;YACzE,kEAAkE;YAClE,MAAM,IAAI,GAAY,CAAC,CAAC,QAAQ,CAAC,EAAa,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;YAC7D,OAAO,OAAO,CAAC,OAAO,CAAC,IAAA,kBAAO,EAAC,YAAY,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAChE,CAAC,CAAC;QAEF,IAAI,CAAC,qEAAqE,EAAE,KAAK,IAAI,EAAE;YACrF,MAAM,KAAK,GAAG,2BAAmB,CAAC,MAAM,EAAE,CAAC,OAAO,EAAE,CAAC;YACrD,MAAM,MAAM,GAAG,IAAI,UAAU,CAAC,IAAA,kBAAO,EAAC,CAAC,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YAC/F,MAAM,CAAC,MAAM,KAAK,CAAC,OAAO,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC;YAC5D,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAC3B,MAAM,CAAC,MAAM,KAAK,CAAC,KAAK,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,mBAAmB,CAC1E,CAAC,IAAoC,EAAE,EAAE;gBACvC,uDAAuD;gBACvD,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YACtC,CAAC,CACF,CAAC;QACJ,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,0EAA0E,EAAE,KAAK,IAAI,EAAE;YAC1F,MAAM,KAAK,GAAG,2BAAmB,CAAC,MAAM,EAAE,CAAC,OAAO,EAAE,CAAC;YACrD,MAAM,MAAM,GAAG,IAAI,UAAU,CAAC,IAAA,kBAAO,EAAC,CAAC,MAAM,CAAC,QAAQ,EAAE,QAAQ,CAAC,EAAE,MAAM,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;YACjG,yEAAyE;YACzE,yDAAyD;YACzD,MAAM,CAAC,MAAM,KAAK,CAAC,OAAO,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC;YAC5D,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAC3B,MAAM,CAAC,MAAM,KAAK,CAAC,KAAK,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,mBAAmB,CAC3E,CAAC,IAAoC,EAAE,EAAE;gBACvC,MAAM,CAAC,IAAI,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;gBAC7B,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC,CAAC;YAC/E,CAAC,CACF,CAAC;QACJ,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,wDAAwD,EAAE,KAAK,IAAI,EAAE;YACxE,MAAM,KAAK,GAAG,2BAAmB,CAAC,MAAM,EAAE,CAAC,OAAO,EAAE,CAAC;YACrD,2DAA2D;YAC3D,CAAC,MAAM,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,EAAE,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;YAC9E,MAAM,MAAM,GAAG,IAAI,UAAU,CAAC,IAAA,kBAAO,EAAC,CAAC,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YAC3D,MAAM,CAAC,MAAM,KAAK,CAAC,OAAO,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC;YAC5D,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAC3B,iEAAiE;YACjE,MAAM,CAAC,MAAM,KAAK,CAAC,KAAK,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC;QACvE,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,yCAAyC,EAAE,KAAK,IAAI,EAAE;YACzD,MAAM,KAAK,GAAG,2BAAmB,CAAC,MAAM,EAAE,CAAC,OAAO,EAAE,CAAC;YACrD,0FAA0F;YAC1F,CAAC,MAAM,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,EAAE,MAAM,CAAC,EAAE,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;YAC5E,MAAM,MAAM,GAAG,IAAI,UAAU,CAAC,IAAA,eAAI,EAAC,WAAW,CAAC,CAAC,CAAC;YACjD,MAAM,CAAC,MAAM,KAAK,CAAC,OAAO,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC,CAAC,UAAU,CAAC,oCAAoC,CAAC,CAAC;YAC5F,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC7B,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,0EAA0E,EAAE,KAAK,IAAI,EAAE;YAC1F,MAAM,KAAK,GAAG,2BAAmB,CAAC,MAAM,EAAE,CAAC,OAAO,EAAE,CAAC;YACrD,oFAAoF;YACpF,CAAC,MAAM,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,EAAE,MAAM,CAAC,EAAE,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;YAC5E,2EAA2E;YAC3E,kDAAkD;YAClD,IAAI,KAAK,GAAW,CAAC,CAAC;YACtB,MAAM,UAAU,GAAG,GAAkC,EAAE;gBACrD,KAAK,IAAI,CAAC,CAAC;gBACX,OAAO,OAAO,CAAC,OAAO,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,IAAA,kBAAO,EAAC,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAA,eAAI,EAAC,UAAU,CAAC,CAAC,CAAC;YAC9F,CAAC,CAAC;YACF,MAAM,MAAM,GAAG,IAAI,UAAU,CAAC,IAAA,kBAAO,EAAC,CAAC,MAAM,CAAC,QAAQ,EAAE,QAAQ,CAAC,EAAE,MAAM,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;YACjG,4DAA4D;YAC5D,MAAM,CAAC,MAAM,KAAK,CAAC,OAAO,CAAC,MAAM,EAAE,UAAU,CAAC,CAAC,CAAC,UAAU,CACxD,8CAA8C,CAC/C,CAAC;YACF,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC7B,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,2EAA2E,EAAE,KAAK,IAAI,EAAE;YAC3F,MAAM,KAAK,GAAG,2BAAmB,CAAC,MAAM,EAAE,CAAC,OAAO,EAAE,CAAC;YACrD,MAAM,MAAM,GAAG,IAAI,UAAU,CAAC,IAAA,kBAAO,EAAC,CAAC,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YAC3D,MAAM,UAAU,GAAG,GAAkC,EAAE,CAAC,OAAO,CAAC,OAAO,CAAC,IAAA,kBAAO,EAAC,IAAI,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YACtG,MAAM,CAAC,MAAM,KAAK,CAAC,OAAO,CAAC,MAAM,EAAE,UAAU,CAAC,CAAC,CAAC,UAAU,CAAC,eAAe,CAAC,CAAC;YAC5E,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC7B,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC","sourcesContent":["/*\n * Copyright (c) 2026 Erik Fortune\n * SPDX-License-Identifier: MIT\n */\n\nimport '@fgv/ts-utils-jest';\nimport { Result, fail, succeed } from '@fgv/ts-utils';\nimport {\n IEdgeTarget,\n IMemoryRecord,\n IMemoryRecordSource,\n IScopedMemoryRecord,\n IVectorQueryHit,\n InMemoryCosineIndex,\n MemoryId,\n MemoryScopeKey\n} from '../../../index';\n\n/** A scope-qualified target from a `(scope, id)` pair. */\nfunction target(scope: string, id: string): IEdgeTarget {\n return { scope: scope as MemoryScopeKey, id: id as MemoryId };\n}\n\n/** A trivial record carrying just the id + a marker body, for rebuild tests. */\nfunction record(id: string, body: string = `body-${id}`): IMemoryRecord<unknown> {\n return {\n // The cosine index only reads `envelope.id`; a minimal envelope suffices.\n envelope: { id: id as MemoryId } as IMemoryRecord<unknown>['envelope'],\n body\n };\n}\n\n/** A scope-qualified record entry for a rebuild source. */\nfunction scoped(scope: string, id: string, body?: string): IScopedMemoryRecord {\n return { target: target(scope, id), record: record(id, body) };\n}\n\n/** A scripted record source for `rebuild`. */\nclass FakeSource implements IMemoryRecordSource {\n private readonly _result: Result<ReadonlyArray<IScopedMemoryRecord>>;\n public constructor(result: Result<ReadonlyArray<IScopedMemoryRecord>>) {\n this._result = result;\n }\n public list(): Promise<Result<ReadonlyArray<IScopedMemoryRecord>>> {\n return Promise.resolve(this._result);\n }\n}\n\ndescribe('InMemoryCosineIndex', () => {\n describe('add', () => {\n test('returns the scoped-target key as the embedding ref and tracks size', async () => {\n const index = InMemoryCosineIndex.create().orThrow();\n expect(index.size).toBe(0);\n const t = target('conv-a', 'turn-1');\n expect(await index.add(t, Float32Array.from([1, 0]))).toSucceedWith(`conv-a\\0turn-1`);\n expect(index.size).toBe(1);\n });\n\n test('replaces the vector on a same-target add', async () => {\n const index = InMemoryCosineIndex.create().orThrow();\n const t = target('conv-a', 'turn-1');\n expect(await index.add(t, Float32Array.from([1, 0]))).toSucceed();\n expect(await index.add(t, Float32Array.from([0, 1]))).toSucceed();\n expect(index.size).toBe(1);\n // The query now matches the replacement vector ([0,1]) not the original.\n expect(await index.query(Float32Array.from([0, 1]), 1)).toSucceedAndSatisfy(\n (hits: ReadonlyArray<IVectorQueryHit>) => {\n expect(hits[0].score).toBeCloseTo(1);\n }\n );\n });\n\n test('same stem in different scopes are distinct entries — the second add does NOT clobber the first', async () => {\n const index = InMemoryCosineIndex.create().orThrow();\n const a = target('conv-a', 'turn-3');\n const b = target('conv-b', 'turn-3');\n // Two records with the identical stem, orthogonal embeddings.\n expect(await index.add(a, Float32Array.from([1, 0]))).toSucceed();\n expect(await index.add(b, Float32Array.from([0, 1]))).toSucceed();\n // The bug: a bare-id index would have collapsed these to one entry.\n expect(index.size).toBe(2);\n // A query surfaces BOTH as distinct hits carrying distinct scoped targets.\n expect(await index.query(Float32Array.from([1, 1]), 5)).toSucceedAndSatisfy(\n (hits: ReadonlyArray<IVectorQueryHit>) => {\n expect(hits).toHaveLength(2);\n expect(hits.map((h) => h.target)).toEqual(expect.arrayContaining([a, b]));\n // Each retains its OWN embedding: a matches [1,0], b matches [0,1].\n const byScope = new Map(hits.map((h) => [h.target.scope, h.score]));\n expect(byScope.get('conv-a' as MemoryScopeKey)).toBeCloseTo(1 / Math.sqrt(2));\n expect(byScope.get('conv-b' as MemoryScopeKey)).toBeCloseTo(1 / Math.sqrt(2));\n }\n );\n });\n\n test('fails loudly on an empty vector', async () => {\n const index = InMemoryCosineIndex.create().orThrow();\n expect(await index.add(target('conv-a', 'turn-1'), new Float32Array(0))).toFailWith(/empty vector/i);\n });\n\n test('stores a defensive copy — mutating the caller buffer after add does not corrupt the index', async () => {\n const index = InMemoryCosineIndex.create().orThrow();\n const buffer = Float32Array.from([1, 0]);\n (await index.add(target('conv-a', 'turn-1'), buffer)).orThrow();\n // Mutate the caller's buffer after the add; the stored vector must be unaffected.\n buffer[0] = 0;\n buffer[1] = 1;\n expect(await index.query(Float32Array.from([1, 0]), 1)).toSucceedAndSatisfy(\n (hits: ReadonlyArray<IVectorQueryHit>) => {\n // Still maximally similar to [1,0] — proves the index kept its own copy.\n expect(hits[0].score).toBeCloseTo(1);\n }\n );\n });\n\n test('fails loudly on a dimension mismatch against the established dimension', async () => {\n const index = InMemoryCosineIndex.create().orThrow();\n expect(await index.add(target('conv-a', 'a'), Float32Array.from([1, 0]))).toSucceed();\n expect(await index.add(target('conv-a', 'b'), Float32Array.from([1, 0, 0]))).toFailWith(\n /dimension 3 does not match index dimension 2/i\n );\n });\n });\n\n describe('query', () => {\n async function seeded(): Promise<InMemoryCosineIndex> {\n const index = InMemoryCosineIndex.create().orThrow();\n (await index.add(target('s', 'a'), Float32Array.from([1, 0]))).orThrow();\n (await index.add(target('s', 'b'), Float32Array.from([0, 1]))).orThrow();\n (await index.add(target('s', 'c'), Float32Array.from([1, 1]))).orThrow();\n return index;\n }\n\n test('returns hits in descending cosine-similarity order', async () => {\n const index = await seeded();\n expect(await index.query(Float32Array.from([1, 0]), 3)).toSucceedAndSatisfy(\n (hits: ReadonlyArray<IVectorQueryHit>) => {\n expect(hits.map((h) => h.target.id)).toEqual(['a', 'c', 'b']);\n expect(hits[0].score).toBeCloseTo(1);\n expect(hits[1].score).toBeCloseTo(1 / Math.sqrt(2));\n expect(hits[2].score).toBeCloseTo(0);\n }\n );\n });\n\n test('truncates to topK', async () => {\n const index = await seeded();\n expect(await index.query(Float32Array.from([1, 0]), 2)).toSucceedAndSatisfy(\n (hits: ReadonlyArray<IVectorQueryHit>) => {\n expect(hits.map((h) => h.target.id)).toEqual(['a', 'c']);\n }\n );\n });\n\n test('returns empty for a non-positive topK', async () => {\n const index = await seeded();\n expect(await index.query(Float32Array.from([1, 0]), 0)).toSucceedWith([]);\n expect(await index.query(Float32Array.from([1, 0]), -1)).toSucceedWith([]);\n });\n\n test('returns empty when the index is empty (no dimension check)', async () => {\n const index = InMemoryCosineIndex.create().orThrow();\n expect(await index.query(Float32Array.from([1, 2, 3, 4]), 5)).toSucceedWith([]);\n });\n\n test('fails loudly on a query-dimension mismatch', async () => {\n const index = await seeded();\n expect(await index.query(Float32Array.from([1, 0, 0]), 3)).toFailWith(\n /query dimension 3 does not match index dimension 2/i\n );\n });\n\n test('scores a degenerate (zero-magnitude) stored vector as 0 rather than NaN', async () => {\n const index = InMemoryCosineIndex.create().orThrow();\n (await index.add(target('s', 'zero'), Float32Array.from([0, 0]))).orThrow();\n (await index.add(target('s', 'unit'), Float32Array.from([1, 0]))).orThrow();\n expect(await index.query(Float32Array.from([1, 0]), 2)).toSucceedAndSatisfy(\n (hits: ReadonlyArray<IVectorQueryHit>) => {\n expect(hits.map((h) => h.target.id)).toEqual(['unit', 'zero']);\n expect(hits[1].score).toBe(0);\n }\n );\n });\n\n test('scores against a degenerate (zero-magnitude) query as 0 rather than NaN', async () => {\n const index = InMemoryCosineIndex.create().orThrow();\n (await index.add(target('s', 'unit'), Float32Array.from([1, 0]))).orThrow();\n expect(await index.query(Float32Array.from([0, 0]), 1)).toSucceedAndSatisfy(\n (hits: ReadonlyArray<IVectorQueryHit>) => {\n expect(hits[0].score).toBe(0);\n }\n );\n });\n });\n\n describe('remove', () => {\n test('removes a vector and is reflected in subsequent queries', async () => {\n const index = InMemoryCosineIndex.create().orThrow();\n const a = target('s', 'a');\n const b = target('s', 'b');\n (await index.add(a, Float32Array.from([1, 0]))).orThrow();\n (await index.add(b, Float32Array.from([0, 1]))).orThrow();\n expect(await index.remove(a)).toSucceedWith(a);\n expect(index.size).toBe(1);\n expect(await index.query(Float32Array.from([1, 0]), 5)).toSucceedAndSatisfy(\n (hits: ReadonlyArray<IVectorQueryHit>) => {\n expect(hits.map((h) => h.target.id)).toEqual(['b']);\n }\n );\n });\n\n test('removes only the scoped target — a same-stem record in another scope is left intact', async () => {\n const index = InMemoryCosineIndex.create().orThrow();\n const a = target('conv-a', 'turn-3');\n const b = target('conv-b', 'turn-3');\n (await index.add(a, Float32Array.from([1, 0]))).orThrow();\n (await index.add(b, Float32Array.from([0, 1]))).orThrow();\n expect(await index.remove(a)).toSucceedWith(a);\n expect(index.size).toBe(1);\n // conv-b's embedding survives untouched.\n expect(await index.query(Float32Array.from([0, 1]), 5)).toSucceedAndSatisfy(\n (hits: ReadonlyArray<IVectorQueryHit>) => {\n expect(hits).toHaveLength(1);\n expect(hits[0].target).toEqual(b);\n expect(hits[0].score).toBeCloseTo(1);\n }\n );\n });\n\n test('is idempotent — removing an absent target still succeeds', async () => {\n const index = InMemoryCosineIndex.create().orThrow();\n const t = target('s', 'missing');\n expect(await index.remove(t)).toSucceedWith(t);\n });\n });\n\n describe('rebuild', () => {\n const embed = (r: IMemoryRecord<unknown>): Promise<Result<Float32Array>> => {\n // Deterministic: encode the id's first char code into a 2-vector.\n const code: number = (r.envelope.id as string).charCodeAt(0);\n return Promise.resolve(succeed(Float32Array.from([code, 1])));\n };\n\n test('re-embeds every scoped record from the source and reports the count', async () => {\n const index = InMemoryCosineIndex.create().orThrow();\n const source = new FakeSource(succeed([scoped('s', 'a'), scoped('s', 'b'), scoped('s', 'c')]));\n expect(await index.rebuild(source, embed)).toSucceedWith(3);\n expect(index.size).toBe(3);\n expect(await index.query(Float32Array.from([99, 1]), 1)).toSucceedAndSatisfy(\n (hits: ReadonlyArray<IVectorQueryHit>) => {\n // 'c' = char code 99, the closest to the query vector.\n expect(hits[0].target.id).toBe('c');\n }\n );\n });\n\n test('keeps same-stem records under different scopes distinct across a rebuild', async () => {\n const index = InMemoryCosineIndex.create().orThrow();\n const source = new FakeSource(succeed([scoped('conv-a', 'turn-3'), scoped('conv-b', 'turn-3')]));\n // The embedder keys only off the (shared) id, so a bare-id rebuild would\n // index just one entry; the scoped rebuild indexes both.\n expect(await index.rebuild(source, embed)).toSucceedWith(2);\n expect(index.size).toBe(2);\n expect(await index.query(Float32Array.from([116, 1]), 5)).toSucceedAndSatisfy(\n (hits: ReadonlyArray<IVectorQueryHit>) => {\n expect(hits).toHaveLength(2);\n expect(hits.map((h) => h.target.scope).sort()).toEqual(['conv-a', 'conv-b']);\n }\n );\n });\n\n test('clears prior contents and re-establishes the dimension', async () => {\n const index = InMemoryCosineIndex.create().orThrow();\n // Seed a 3-dim vector, then rebuild with a 2-dim embedder.\n (await index.add(target('s', 'old'), Float32Array.from([1, 2, 3]))).orThrow();\n const source = new FakeSource(succeed([scoped('s', 'a')]));\n expect(await index.rebuild(source, embed)).toSucceedWith(1);\n expect(index.size).toBe(1);\n // The 2-dim query now succeeds (dimension was reset by rebuild).\n expect(await index.query(Float32Array.from([97, 1]), 1)).toSucceed();\n });\n\n test('fails loudly when the source list fails', async () => {\n const index = InMemoryCosineIndex.create().orThrow();\n // Seed an entry so the reset-before-list rollback is observable, not just \"stayed empty\".\n (await index.add(target('s', 'seed'), Float32Array.from([1, 1]))).orThrow();\n const source = new FakeSource(fail('disk gone'));\n expect(await index.rebuild(source, embed)).toFailWith(/failed to list records: disk gone/i);\n expect(index.size).toBe(0);\n });\n\n test('fails loudly and rolls back to empty when an embedding fails mid-rebuild', async () => {\n const index = InMemoryCosineIndex.create().orThrow();\n // Seed an existing entry so the rollback (not merely \"stayed empty\") is observable.\n (await index.add(target('s', 'seed'), Float32Array.from([1, 1]))).orThrow();\n // First record embeds fine, the second fails — so a naive impl would leave\n // record 'a' indexed; the rollback must clear it.\n let calls: number = 0;\n const flakyEmbed = (): Promise<Result<Float32Array>> => {\n calls += 1;\n return Promise.resolve(calls === 1 ? succeed(Float32Array.from([1, 1])) : fail('no model'));\n };\n const source = new FakeSource(succeed([scoped('conv-a', 'turn-1'), scoped('conv-b', 'turn-1')]));\n // The failing record's error names its scope-qualified key.\n expect(await index.rebuild(source, flakyEmbed)).toFailWith(\n /embedding 'conv-b\\0turn-1' failed: no model/i\n );\n expect(index.size).toBe(0);\n });\n\n test('fails loudly and rolls back to empty when adding an embedded vector fails', async () => {\n const index = InMemoryCosineIndex.create().orThrow();\n const source = new FakeSource(succeed([scoped('s', 'a')]));\n const emptyEmbed = (): Promise<Result<Float32Array>> => Promise.resolve(succeed(new Float32Array(0)));\n expect(await index.rebuild(source, emptyEmbed)).toFailWith(/empty vector/i);\n expect(index.size).toBe(0);\n });\n });\n});\n"]}
@@ -6,39 +6,48 @@
6
6
  Object.defineProperty(exports, "__esModule", { value: true });
7
7
  require("@fgv/ts-utils-jest");
8
8
  const ts_utils_1 = require("@fgv/ts-utils");
9
+ const index_1 = require("../../../index");
10
+ function target(scope, id) {
11
+ return { scope: scope, id: id };
12
+ }
9
13
  /**
10
14
  * A trivial conforming implementation, present to verify the {@link IVectorIndex}
11
- * seam is usable end-to-end (the in-package cosine impl is a post-v1 fast-follow).
15
+ * seam is usable end-to-end with scope-qualified targets.
12
16
  */
13
17
  class StubVectorIndex {
14
18
  constructor() {
15
19
  this._vectors = new Map();
16
20
  }
17
- add(id, vector) {
18
- this._vectors.set(id, vector);
19
- return Promise.resolve((0, ts_utils_1.succeed)(`ref-${id}`));
21
+ add(t, vector) {
22
+ const key = (0, index_1.edgeTargetKey)(t);
23
+ this._vectors.set(key, t);
24
+ return Promise.resolve((0, ts_utils_1.succeed)(`ref-${key}`));
20
25
  }
21
- remove(id) {
22
- this._vectors.delete(id);
23
- return Promise.resolve((0, ts_utils_1.succeed)(id));
26
+ remove(t) {
27
+ this._vectors.delete((0, index_1.edgeTargetKey)(t));
28
+ return Promise.resolve((0, ts_utils_1.succeed)(t));
24
29
  }
25
30
  query(vector, topK) {
26
- const hits = Array.from(this._vectors.keys())
27
- .map((id) => ({ id, score: vector.length }))
31
+ const hits = Array.from(this._vectors.values())
32
+ .map((t) => ({ target: t, score: vector.length }))
28
33
  .slice(0, topK);
29
34
  return Promise.resolve((0, ts_utils_1.succeed)(hits));
30
35
  }
31
36
  }
32
37
  describe('IVectorIndex seam', () => {
33
- test('a conforming implementation supports add / query / remove', async () => {
38
+ test('a conforming implementation supports add / query / remove on scoped targets', async () => {
34
39
  const index = new StubVectorIndex();
35
- expect(await index.add('a', Float32Array.from([1, 2, 3]))).toSucceedWith('ref-a');
36
- expect(await index.add('b', Float32Array.from([4, 5, 6]))).toSucceedWith('ref-b');
37
- expect(await index.query(Float32Array.from([0.1, 0.2]), 1)).toSucceedAndSatisfy((hits) => {
38
- expect(hits).toHaveLength(1);
40
+ const a = target('conv-a', 'turn-3');
41
+ const b = target('conv-b', 'turn-3');
42
+ expect(await index.add(a, Float32Array.from([1, 2, 3]))).toSucceedWith(`ref-${(0, index_1.edgeTargetKey)(a)}`);
43
+ expect(await index.add(b, Float32Array.from([4, 5, 6]))).toSucceedWith(`ref-${(0, index_1.edgeTargetKey)(b)}`);
44
+ expect(await index.query(Float32Array.from([0.1, 0.2]), 2)).toSucceedAndSatisfy((hits) => {
45
+ // Both same-stem-different-scope targets are distinct entries.
46
+ expect(hits).toHaveLength(2);
47
+ expect(hits.map((h) => h.target)).toEqual(expect.arrayContaining([a, b]));
39
48
  expect(hits[0].score).toBe(2);
40
49
  });
41
- expect(await index.remove('a')).toSucceedWith('a');
50
+ expect(await index.remove(a)).toSucceedWith(a);
42
51
  });
43
52
  });
44
53
  //# sourceMappingURL=vectorIndex.test.js.map
@@ -1 +1 @@
1
- {"version":3,"file":"vectorIndex.test.js","sourceRoot":"","sources":["../../../../src/test/unit/vector/vectorIndex.test.ts"],"names":[],"mappings":";AAAA;;;GAGG;;AAEH,8BAA4B;AAC5B,4CAAgD;AAGhD;;;GAGG;AACH,MAAM,eAAe;IAArB;QACmB,aAAQ,GAAgC,IAAI,GAAG,EAAE,CAAC;IAkBrE,CAAC;IAhBQ,GAAG,CAAC,EAAY,EAAE,MAAoB;QAC3C,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,EAAE,MAAM,CAAC,CAAC;QAC9B,OAAO,OAAO,CAAC,OAAO,CAAC,IAAA,kBAAO,EAAC,OAAO,EAAE,EAAE,CAAC,CAAC,CAAC;IAC/C,CAAC;IAEM,MAAM,CAAC,EAAY;QACxB,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QACzB,OAAO,OAAO,CAAC,OAAO,CAAC,IAAA,kBAAO,EAAC,EAAE,CAAC,CAAC,CAAC;IACtC,CAAC;IAEM,KAAK,CAAC,MAAoB,EAAE,IAAY;QAC7C,MAAM,IAAI,GAAsB,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAC;aAC7D,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,KAAK,EAAE,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC;aAC3C,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;QAClB,OAAO,OAAO,CAAC,OAAO,CAAC,IAAA,kBAAO,EAAC,IAAI,CAAC,CAAC,CAAC;IACxC,CAAC;CACF;AAED,QAAQ,CAAC,mBAAmB,EAAE,GAAG,EAAE;IACjC,IAAI,CAAC,2DAA2D,EAAE,KAAK,IAAI,EAAE;QAC3E,MAAM,KAAK,GAAG,IAAI,eAAe,EAAE,CAAC;QACpC,MAAM,CAAC,MAAM,KAAK,CAAC,GAAG,CAAC,GAAe,EAAE,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC;QAC9F,MAAM,CAAC,MAAM,KAAK,CAAC,GAAG,CAAC,GAAe,EAAE,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC;QAC9F,MAAM,CAAC,MAAM,KAAK,CAAC,KAAK,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,mBAAmB,CAC7E,CAAC,IAAoC,EAAE,EAAE;YACvC,MAAM,CAAC,IAAI,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;YAC7B,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAChC,CAAC,CACF,CAAC;QACF,MAAM,CAAC,MAAM,KAAK,CAAC,MAAM,CAAC,GAAe,CAAC,CAAC,CAAC,aAAa,CAAC,GAAe,CAAC,CAAC;IAC7E,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC","sourcesContent":["/*\n * Copyright (c) 2026 Erik Fortune\n * SPDX-License-Identifier: MIT\n */\n\nimport '@fgv/ts-utils-jest';\nimport { Result, succeed } from '@fgv/ts-utils';\nimport { IVectorIndex, IVectorQueryHit, MemoryId } from '../../../index';\n\n/**\n * A trivial conforming implementation, present to verify the {@link IVectorIndex}\n * seam is usable end-to-end (the in-package cosine impl is a post-v1 fast-follow).\n */\nclass StubVectorIndex implements IVectorIndex {\n private readonly _vectors: Map<MemoryId, Float32Array> = new Map();\n\n public add(id: MemoryId, vector: Float32Array): Promise<Result<string>> {\n this._vectors.set(id, vector);\n return Promise.resolve(succeed(`ref-${id}`));\n }\n\n public remove(id: MemoryId): Promise<Result<MemoryId>> {\n this._vectors.delete(id);\n return Promise.resolve(succeed(id));\n }\n\n public query(vector: Float32Array, topK: number): Promise<Result<ReadonlyArray<IVectorQueryHit>>> {\n const hits: IVectorQueryHit[] = Array.from(this._vectors.keys())\n .map((id) => ({ id, score: vector.length }))\n .slice(0, topK);\n return Promise.resolve(succeed(hits));\n }\n}\n\ndescribe('IVectorIndex seam', () => {\n test('a conforming implementation supports add / query / remove', async () => {\n const index = new StubVectorIndex();\n expect(await index.add('a' as MemoryId, Float32Array.from([1, 2, 3]))).toSucceedWith('ref-a');\n expect(await index.add('b' as MemoryId, Float32Array.from([4, 5, 6]))).toSucceedWith('ref-b');\n expect(await index.query(Float32Array.from([0.1, 0.2]), 1)).toSucceedAndSatisfy(\n (hits: ReadonlyArray<IVectorQueryHit>) => {\n expect(hits).toHaveLength(1);\n expect(hits[0].score).toBe(2);\n }\n );\n expect(await index.remove('a' as MemoryId)).toSucceedWith('a' as MemoryId);\n });\n});\n"]}
1
+ {"version":3,"file":"vectorIndex.test.js","sourceRoot":"","sources":["../../../../src/test/unit/vector/vectorIndex.test.ts"],"names":[],"mappings":";AAAA;;;GAGG;;AAEH,8BAA4B;AAC5B,4CAAgD;AAChD,0CAOwB;AAExB,SAAS,MAAM,CAAC,KAAa,EAAE,EAAU;IACvC,OAAO,EAAE,KAAK,EAAE,KAAuB,EAAE,EAAE,EAAE,EAAc,EAAE,CAAC;AAChE,CAAC;AAED;;;GAGG;AACH,MAAM,eAAe;IAArB;QACmB,aAAQ,GAA6B,IAAI,GAAG,EAAE,CAAC;IAmBlE,CAAC;IAjBQ,GAAG,CAAC,CAAc,EAAE,MAAoB;QAC7C,MAAM,GAAG,GAAW,IAAA,qBAAa,EAAC,CAAC,CAAC,CAAC;QACrC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;QAC1B,OAAO,OAAO,CAAC,OAAO,CAAC,IAAA,kBAAO,EAAC,OAAO,GAAG,EAAE,CAAC,CAAC,CAAC;IAChD,CAAC;IAEM,MAAM,CAAC,CAAc;QAC1B,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,IAAA,qBAAa,EAAC,CAAC,CAAC,CAAC,CAAC;QACvC,OAAO,OAAO,CAAC,OAAO,CAAC,IAAA,kBAAO,EAAC,CAAC,CAAC,CAAC,CAAC;IACrC,CAAC;IAEM,KAAK,CAAC,MAAoB,EAAE,IAAY;QAC7C,MAAM,IAAI,GAAsB,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC;aAC/D,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,KAAK,EAAE,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC;aACjD,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;QAClB,OAAO,OAAO,CAAC,OAAO,CAAC,IAAA,kBAAO,EAAC,IAAI,CAAC,CAAC,CAAC;IACxC,CAAC;CACF;AAED,QAAQ,CAAC,mBAAmB,EAAE,GAAG,EAAE;IACjC,IAAI,CAAC,6EAA6E,EAAE,KAAK,IAAI,EAAE;QAC7F,MAAM,KAAK,GAAG,IAAI,eAAe,EAAE,CAAC;QACpC,MAAM,CAAC,GAAG,MAAM,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;QACrC,MAAM,CAAC,GAAG,MAAM,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;QACrC,MAAM,CAAC,MAAM,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,OAAO,IAAA,qBAAa,EAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QAClG,MAAM,CAAC,MAAM,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,OAAO,IAAA,qBAAa,EAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QAClG,MAAM,CAAC,MAAM,KAAK,CAAC,KAAK,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,mBAAmB,CAC7E,CAAC,IAAoC,EAAE,EAAE;YACvC,+DAA+D;YAC/D,MAAM,CAAC,IAAI,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;YAC7B,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,MAAM,CAAC,eAAe,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;YAC1E,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAChC,CAAC,CACF,CAAC;QACF,MAAM,CAAC,MAAM,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC;IACjD,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC","sourcesContent":["/*\n * Copyright (c) 2026 Erik Fortune\n * SPDX-License-Identifier: MIT\n */\n\nimport '@fgv/ts-utils-jest';\nimport { Result, succeed } from '@fgv/ts-utils';\nimport {\n IEdgeTarget,\n IVectorIndex,\n IVectorQueryHit,\n MemoryId,\n MemoryScopeKey,\n edgeTargetKey\n} from '../../../index';\n\nfunction target(scope: string, id: string): IEdgeTarget {\n return { scope: scope as MemoryScopeKey, id: id as MemoryId };\n}\n\n/**\n * A trivial conforming implementation, present to verify the {@link IVectorIndex}\n * seam is usable end-to-end with scope-qualified targets.\n */\nclass StubVectorIndex implements IVectorIndex {\n private readonly _vectors: Map<string, IEdgeTarget> = new Map();\n\n public add(t: IEdgeTarget, vector: Float32Array): Promise<Result<string>> {\n const key: string = edgeTargetKey(t);\n this._vectors.set(key, t);\n return Promise.resolve(succeed(`ref-${key}`));\n }\n\n public remove(t: IEdgeTarget): Promise<Result<IEdgeTarget>> {\n this._vectors.delete(edgeTargetKey(t));\n return Promise.resolve(succeed(t));\n }\n\n public query(vector: Float32Array, topK: number): Promise<Result<ReadonlyArray<IVectorQueryHit>>> {\n const hits: IVectorQueryHit[] = Array.from(this._vectors.values())\n .map((t) => ({ target: t, score: vector.length }))\n .slice(0, topK);\n return Promise.resolve(succeed(hits));\n }\n}\n\ndescribe('IVectorIndex seam', () => {\n test('a conforming implementation supports add / query / remove on scoped targets', async () => {\n const index = new StubVectorIndex();\n const a = target('conv-a', 'turn-3');\n const b = target('conv-b', 'turn-3');\n expect(await index.add(a, Float32Array.from([1, 2, 3]))).toSucceedWith(`ref-${edgeTargetKey(a)}`);\n expect(await index.add(b, Float32Array.from([4, 5, 6]))).toSucceedWith(`ref-${edgeTargetKey(b)}`);\n expect(await index.query(Float32Array.from([0.1, 0.2]), 2)).toSucceedAndSatisfy(\n (hits: ReadonlyArray<IVectorQueryHit>) => {\n // Both same-stem-different-scope targets are distinct entries.\n expect(hits).toHaveLength(2);\n expect(hits.map((h) => h.target)).toEqual(expect.arrayContaining([a, b]));\n expect(hits[0].score).toBe(2);\n }\n );\n expect(await index.remove(a)).toSucceedWith(a);\n });\n});\n"]}
package/package.json CHANGED
@@ -1,6 +1,6 @@
1
1
  {
2
2
  "name": "@fgv/ts-agent-memory",
3
- "version": "5.1.0-39",
3
+ "version": "5.1.0-41",
4
4
  "description": "FileTree-backed storage and retrieval substrate for agent memory and knowledge",
5
5
  "main": "lib/index.js",
6
6
  "types": "dist/ts-agent-memory.d.ts",
@@ -35,10 +35,10 @@
35
35
  },
36
36
  "dependencies": {
37
37
  "tslib": "^2.8.1",
38
- "@fgv/ts-extras": "5.1.0-39",
39
- "@fgv/ts-json": "5.1.0-39",
40
- "@fgv/ts-json-base": "5.1.0-39",
41
- "@fgv/ts-utils": "5.1.0-39"
38
+ "@fgv/ts-extras": "5.1.0-41",
39
+ "@fgv/ts-json": "5.1.0-41",
40
+ "@fgv/ts-json-base": "5.1.0-41",
41
+ "@fgv/ts-utils": "5.1.0-41"
42
42
  },
43
43
  "devDependencies": {
44
44
  "@microsoft/api-extractor": "^7.55.2",
@@ -65,8 +65,8 @@
65
65
  "@rushstack/heft-node-rig": "2.11.27",
66
66
  "@types/heft-jest": "1.0.6",
67
67
  "eslint-plugin-tsdoc": "~0.5.2",
68
- "@fgv/heft-dual-rig": "5.1.0-39",
69
- "@fgv/ts-utils-jest": "5.1.0-39"
68
+ "@fgv/ts-utils-jest": "5.1.0-41",
69
+ "@fgv/heft-dual-rig": "5.1.0-41"
70
70
  },
71
71
  "scripts": {
72
72
  "build": "heft build --clean",
@@ -1,3 +1,3 @@
1
1
  Caching build output folders: dist, lib, temp, .rush/temp/operation/build
2
2
  Successfully set cache entry.
3
- Cache key: b82cf6bdece20481260e6bab946179eeec9d7b46
3
+ Cache key: cbbdbe09515171b4eba8f2592be2dace1e4e8142
@@ -5,5 +5,5 @@ Invoking: heft build --clean
5
5
  [build:lint] Using ESLint version 9.39.5
6
6
  [build:api-extractor] Using API Extractor version 7.58.9
7
7
  [build:api-extractor] Analysis will use the bundled TypeScript version 5.9.3
8
- ---- build finished (27.335s) ----
9
- -------------------- Finished (27.352s) --------------------
8
+ ---- build finished (26.015s) ----
9
+ -------------------- Finished (26.02s) --------------------
@@ -5,7 +5,15 @@
5
5
 
6
6
  import { Converter, Converters, Result, fail, succeed } from '@fgv/ts-utils';
7
7
  import { Yaml } from '@fgv/ts-extras';
8
- import { Convert, IEdge, IMemoryEnvelope, IMemoryRecord, IProvenance, ITemporalBlock } from '../types';
8
+ import {
9
+ Convert,
10
+ IEdge,
11
+ IEdgeTarget,
12
+ IMemoryEnvelope,
13
+ IMemoryRecord,
14
+ IProvenance,
15
+ ITemporalBlock
16
+ } from '../types';
9
17
  import { IBodyConverterRegistry } from './bodyConverterRegistry';
10
18
 
11
19
  /** Matches exactly the JSON `null` literal. */
@@ -28,9 +36,23 @@ const stringOrNull: Converter<string | null> = Converters.oneOf<string | null>([
28
36
  nullConverter
29
37
  ]);
30
38
 
39
+ /**
40
+ * Converter for a scope-qualified {@link IEdgeTarget}. Both `scope` and `id`
41
+ * are required — the whole point of the scoped target is that a bare id is
42
+ * ambiguous across scopes.
43
+ * @public
44
+ */
45
+ export const edgeTargetConverter: Converter<IEdgeTarget> = Converters.object<IEdgeTarget>({
46
+ scope: Convert.scopeKey,
47
+ id: Convert.memoryId
48
+ });
49
+
31
50
  /**
32
51
  * Converter for the known {@link IProvenance} fields. The full
33
52
  * {@link provenanceConverter} layers extension-key preservation on top.
53
+ * `derivedFrom` is serialized as the nested `{ scope, id }` object (mirroring
54
+ * {@link edgeConverter | edge}'s scope-qualified `target`) so the provenance
55
+ * back-reference is unambiguous across scopes.
34
56
  */
35
57
  const knownProvenanceConverter: Converter<IProvenance> = Converters.object<IProvenance>(
36
58
  {
@@ -38,7 +60,7 @@ const knownProvenanceConverter: Converter<IProvenance> = Converters.object<IProv
38
60
  by: Converters.string.optional(),
39
61
  model: Converters.string.optional(),
40
62
  confidence: Converters.number.optional(),
41
- derivedFrom: Convert.memoryId.optional()
63
+ derivedFrom: edgeTargetConverter.optional()
42
64
  },
43
65
  { optionalFields: ['by', 'model', 'confidence', 'derivedFrom'] }
44
66
  );
@@ -68,7 +90,7 @@ export const provenanceConverter: Converter<IProvenance> = Converters.generic<IP
68
90
  export const edgeConverter: Converter<IEdge> = Converters.object<IEdge>(
69
91
  {
70
92
  type: Convert.linkType,
71
- target: Convert.memoryId,
93
+ target: edgeTargetConverter,
72
94
  confidence: Converters.number.optional(),
73
95
  provenance: provenanceConverter.optional(),
74
96
  valid_at: Converters.number.optional(),
@@ -105,11 +127,12 @@ export const envelopeConverter: Converter<IMemoryEnvelope> = Converters.object<I
105
127
  updated: Converters.number,
106
128
  seq: Converters.number,
107
129
  contentHash: Converters.string,
130
+ rank: Converters.number.optional(),
108
131
  provenance: provenanceConverter,
109
132
  temporal: temporalConverter.optional(),
110
133
  embeddingRef: stringOrNull.optional()
111
134
  },
112
- { optionalFields: ['temporal', 'embeddingRef'] }
135
+ { optionalFields: ['rank', 'temporal', 'embeddingRef'] }
113
136
  );
114
137
 
115
138
  /**