@isograph/react 0.4.3 → 0.5.0

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 (137) hide show
  1. package/.turbo/turbo-compile-libs.log +2 -2
  2. package/dist/core/FragmentReference.d.ts +4 -2
  3. package/dist/core/FragmentReference.d.ts.map +1 -1
  4. package/dist/core/FragmentReference.js +2 -2
  5. package/dist/core/IsographEnvironment.d.ts +19 -11
  6. package/dist/core/IsographEnvironment.d.ts.map +1 -1
  7. package/dist/core/IsographEnvironment.js +27 -2
  8. package/dist/core/PromiseWrapper.d.ts +13 -7
  9. package/dist/core/PromiseWrapper.d.ts.map +1 -1
  10. package/dist/core/brand.d.ts +17 -0
  11. package/dist/core/brand.d.ts.map +1 -1
  12. package/dist/core/cache.d.ts +10 -7
  13. package/dist/core/cache.d.ts.map +1 -1
  14. package/dist/core/cache.js +102 -74
  15. package/dist/core/check.d.ts +8 -4
  16. package/dist/core/check.d.ts.map +1 -1
  17. package/dist/core/check.js +10 -7
  18. package/dist/core/componentCache.d.ts +1 -1
  19. package/dist/core/componentCache.d.ts.map +1 -1
  20. package/dist/core/componentCache.js +6 -4
  21. package/dist/core/entrypoint.d.ts +17 -7
  22. package/dist/core/entrypoint.d.ts.map +1 -1
  23. package/dist/core/garbageCollection.d.ts +8 -2
  24. package/dist/core/garbageCollection.d.ts.map +1 -1
  25. package/dist/core/garbageCollection.js +36 -14
  26. package/dist/core/logging.d.ts +16 -3
  27. package/dist/core/logging.d.ts.map +1 -1
  28. package/dist/core/makeNetworkRequest.d.ts +4 -2
  29. package/dist/core/makeNetworkRequest.d.ts.map +1 -1
  30. package/dist/core/makeNetworkRequest.js +115 -38
  31. package/dist/core/optimisticProxy.d.ts +59 -0
  32. package/dist/core/optimisticProxy.d.ts.map +1 -0
  33. package/dist/core/optimisticProxy.js +399 -0
  34. package/dist/core/read.d.ts +3 -2
  35. package/dist/core/read.d.ts.map +1 -1
  36. package/dist/core/read.js +158 -123
  37. package/dist/core/reader.d.ts +7 -4
  38. package/dist/core/reader.d.ts.map +1 -1
  39. package/dist/core/startUpdate.d.ts +3 -2
  40. package/dist/core/startUpdate.d.ts.map +1 -1
  41. package/dist/core/startUpdate.js +33 -34
  42. package/dist/index.d.ts +2 -2
  43. package/dist/index.d.ts.map +1 -1
  44. package/dist/index.js +2 -1
  45. package/dist/loadable-hooks/useClientSideDefer.d.ts +9 -4
  46. package/dist/loadable-hooks/useClientSideDefer.d.ts.map +1 -1
  47. package/dist/loadable-hooks/useClientSideDefer.js +34 -1
  48. package/dist/loadable-hooks/useConnectionSpecPagination.d.ts +5 -3
  49. package/dist/loadable-hooks/useConnectionSpecPagination.d.ts.map +1 -1
  50. package/dist/loadable-hooks/useConnectionSpecPagination.js +27 -13
  51. package/dist/loadable-hooks/useImperativeLoadableField.d.ts +1 -1
  52. package/dist/loadable-hooks/useImperativeLoadableField.d.ts.map +1 -1
  53. package/dist/loadable-hooks/useSkipLimitPagination.d.ts +1 -1
  54. package/dist/loadable-hooks/useSkipLimitPagination.d.ts.map +1 -1
  55. package/dist/loadable-hooks/useSkipLimitPagination.js +1 -1
  56. package/dist/react/FragmentReader.d.ts +2 -1
  57. package/dist/react/FragmentReader.d.ts.map +1 -1
  58. package/dist/react/FragmentRenderer.d.ts +2 -1
  59. package/dist/react/FragmentRenderer.d.ts.map +1 -1
  60. package/dist/react/LoadableFieldReader.d.ts +9 -3
  61. package/dist/react/LoadableFieldReader.d.ts.map +1 -1
  62. package/dist/react/LoadableFieldReader.js +40 -1
  63. package/dist/react/LoadableFieldRenderer.d.ts +9 -3
  64. package/dist/react/LoadableFieldRenderer.d.ts.map +1 -1
  65. package/dist/react/LoadableFieldRenderer.js +36 -1
  66. package/dist/react/useImperativeReference.d.ts +4 -3
  67. package/dist/react/useImperativeReference.d.ts.map +1 -1
  68. package/dist/react/useImperativeReference.js +3 -5
  69. package/dist/react/useLazyReference.d.ts +2 -1
  70. package/dist/react/useLazyReference.d.ts.map +1 -1
  71. package/dist/react/useReadAndSubscribe.d.ts.map +1 -1
  72. package/dist/react/useReadAndSubscribe.js +1 -3
  73. package/dist/react/useResult.d.ts.map +1 -1
  74. package/dist/react/useResult.js +6 -5
  75. package/package.json +16 -17
  76. package/src/core/FragmentReference.ts +10 -4
  77. package/src/core/IsographEnvironment.ts +59 -13
  78. package/src/core/PromiseWrapper.ts +14 -7
  79. package/src/core/brand.ts +18 -0
  80. package/src/core/cache.ts +186 -91
  81. package/src/core/check.ts +21 -10
  82. package/src/core/componentCache.ts +8 -4
  83. package/src/core/entrypoint.ts +35 -6
  84. package/src/core/garbageCollection.ts +61 -19
  85. package/src/core/logging.ts +15 -3
  86. package/src/core/makeNetworkRequest.ts +307 -74
  87. package/src/core/optimisticProxy.ts +563 -0
  88. package/src/core/read.ts +233 -163
  89. package/src/core/reader.ts +10 -6
  90. package/src/core/startUpdate.ts +45 -30
  91. package/src/index.ts +2 -1
  92. package/src/loadable-hooks/useClientSideDefer.ts +76 -26
  93. package/src/loadable-hooks/useConnectionSpecPagination.ts +34 -17
  94. package/src/loadable-hooks/useImperativeLoadableField.ts +2 -2
  95. package/src/loadable-hooks/useSkipLimitPagination.ts +2 -3
  96. package/src/react/FragmentReader.tsx +3 -1
  97. package/src/react/FragmentRenderer.tsx +8 -1
  98. package/src/react/LoadableFieldReader.tsx +123 -12
  99. package/src/react/LoadableFieldRenderer.tsx +122 -12
  100. package/src/react/useImperativeReference.ts +20 -11
  101. package/src/react/useLazyReference.ts +17 -6
  102. package/src/react/useReadAndSubscribe.ts +1 -8
  103. package/src/react/useResult.ts +9 -11
  104. package/src/tests/__isograph/Node/asEconomist/resolver_reader.ts +1 -1
  105. package/src/tests/__isograph/Query/linkedUpdate/entrypoint.ts +3 -1
  106. package/src/tests/__isograph/Query/linkedUpdate/raw_response_type.ts +13 -0
  107. package/src/tests/__isograph/Query/linkedUpdate/resolver_reader.ts +1 -1
  108. package/src/tests/__isograph/Query/meName/entrypoint.ts +3 -1
  109. package/src/tests/__isograph/Query/meName/raw_response_type.ts +7 -0
  110. package/src/tests/__isograph/Query/meName/resolver_reader.ts +1 -1
  111. package/src/tests/__isograph/Query/meNameSuccessor/entrypoint.ts +3 -1
  112. package/src/tests/__isograph/Query/meNameSuccessor/raw_response_type.ts +14 -0
  113. package/src/tests/__isograph/Query/meNameSuccessor/resolver_reader.ts +1 -1
  114. package/src/tests/__isograph/Query/nodeField/entrypoint.ts +3 -1
  115. package/src/tests/__isograph/Query/nodeField/raw_response_type.ts +7 -0
  116. package/src/tests/__isograph/Query/nodeField/resolver_reader.ts +1 -1
  117. package/src/tests/__isograph/Query/normalizeUndefinedField/entrypoint.ts +33 -0
  118. package/src/tests/__isograph/Query/normalizeUndefinedField/normalization_ast.ts +25 -0
  119. package/src/tests/__isograph/Query/normalizeUndefinedField/output_type.ts +3 -0
  120. package/src/tests/__isograph/Query/normalizeUndefinedField/param_type.ts +9 -0
  121. package/src/tests/__isograph/Query/normalizeUndefinedField/query_text.ts +6 -0
  122. package/src/tests/__isograph/Query/normalizeUndefinedField/raw_response_type.ts +7 -0
  123. package/src/tests/__isograph/Query/normalizeUndefinedField/resolver_reader.ts +38 -0
  124. package/src/tests/__isograph/Query/startUpdate/entrypoint.ts +3 -1
  125. package/src/tests/__isograph/Query/startUpdate/raw_response_type.ts +8 -0
  126. package/src/tests/__isograph/Query/startUpdate/resolver_reader.ts +1 -1
  127. package/src/tests/__isograph/Query/subquery/entrypoint.ts +3 -1
  128. package/src/tests/__isograph/Query/subquery/raw_response_type.ts +9 -0
  129. package/src/tests/__isograph/Query/subquery/resolver_reader.ts +1 -1
  130. package/src/tests/__isograph/iso.ts +11 -1
  131. package/src/tests/garbageCollection.test.ts +8 -5
  132. package/src/tests/meNameSuccessor.ts +6 -3
  133. package/src/tests/nodeQuery.ts +4 -2
  134. package/src/tests/normalizeData.test.ts +89 -15
  135. package/src/tests/optimisticProxy.test.ts +860 -0
  136. package/src/tests/startUpdate.test.ts +7 -5
  137. package/src/tests/__isograph/Economist/__link/output_type.ts +0 -2
@@ -0,0 +1,563 @@
1
+ import {
2
+ callSubscriptions,
3
+ insertEmptySetIfMissing,
4
+ type EncounteredIds,
5
+ } from './cache';
6
+ import type {
7
+ BaseStoreLayerData,
8
+ IsographEnvironment,
9
+ StoreLayerData,
10
+ StoreLink,
11
+ StoreRecord,
12
+ } from './IsographEnvironment';
13
+
14
+ export function getOrInsertRecord(
15
+ dataLayer: StoreLayerData,
16
+ link: StoreLink,
17
+ ): StoreRecord {
18
+ const recordsById = (dataLayer[link.__typename] ??= {});
19
+ return (recordsById[link.__link] ??= {});
20
+ }
21
+
22
+ /**
23
+ * Given the child-most store layer (i.e. environment.store) and a link (identifying a
24
+ * store record), create a proxy object that attempts to read through each successive
25
+ * store layer until a value (i.e. field name) is found. If found, return that value.
26
+ */
27
+ export function getStoreRecordProxy(
28
+ storeLayer: StoreLayer,
29
+ link: StoreLink,
30
+ ): Readonly<StoreRecord> | null | undefined {
31
+ let startNode: StoreLayer | null = storeLayer;
32
+ while (startNode !== null) {
33
+ const storeRecord = startNode.data[link.__typename]?.[link.__link];
34
+ if (storeRecord === null) {
35
+ return null;
36
+ }
37
+ if (storeRecord != null) {
38
+ return getMutableStoreRecordProxy(startNode, link);
39
+ }
40
+ startNode = startNode.parentStoreLayer;
41
+ }
42
+
43
+ return undefined;
44
+ }
45
+
46
+ export function getMutableStoreRecordProxy(
47
+ childMostStoreLayer: StoreLayer,
48
+ link: StoreLink,
49
+ ): StoreRecord {
50
+ return new Proxy<StoreRecord>(
51
+ {},
52
+ {
53
+ get(_, propertyName) {
54
+ let currentStoreLayer: StoreLayer | null = childMostStoreLayer;
55
+ while (currentStoreLayer !== null) {
56
+ const storeRecord =
57
+ currentStoreLayer.data[link.__typename]?.[link.__link];
58
+ if (storeRecord === null) {
59
+ return undefined;
60
+ }
61
+ if (storeRecord != null) {
62
+ const value = Reflect.get(storeRecord, propertyName);
63
+ if (value !== undefined) {
64
+ return value;
65
+ }
66
+ }
67
+ currentStoreLayer = currentStoreLayer.parentStoreLayer;
68
+ }
69
+ },
70
+ has(_, propertyName) {
71
+ let currentStoreLayer: StoreLayer | null = childMostStoreLayer;
72
+ while (currentStoreLayer !== null) {
73
+ const storeRecord =
74
+ currentStoreLayer.data[link.__typename]?.[link.__link];
75
+ if (storeRecord === null) {
76
+ return false;
77
+ }
78
+ if (storeRecord != null) {
79
+ const value = Reflect.has(storeRecord, propertyName);
80
+ if (value !== undefined) {
81
+ return true;
82
+ }
83
+ }
84
+ currentStoreLayer = currentStoreLayer.parentStoreLayer;
85
+ }
86
+ return false;
87
+ },
88
+ set(_, p, newValue) {
89
+ return Reflect.set(
90
+ getOrInsertRecord(childMostStoreLayer.data, link),
91
+ p,
92
+ newValue,
93
+ );
94
+ },
95
+ },
96
+ );
97
+ }
98
+
99
+ export type BaseStoreLayer = {
100
+ readonly kind: 'BaseStoreLayer';
101
+ childStoreLayer: OptimisticStoreLayer | null;
102
+ readonly parentStoreLayer: null;
103
+ readonly data: BaseStoreLayerData;
104
+ };
105
+
106
+ export type NetworkResponseStoreLayer = {
107
+ readonly kind: 'NetworkResponseStoreLayer';
108
+ childStoreLayer: OptimisticStoreLayer | StartUpdateStoreLayer | null;
109
+ parentStoreLayer: OptimisticStoreLayer | StartUpdateStoreLayer;
110
+ readonly data: StoreLayerData;
111
+ };
112
+
113
+ export type DataUpdate<TStoreLayer extends StoreLayer> = (
114
+ storeLayer: TStoreLayer,
115
+ ) => void;
116
+
117
+ export type StartUpdateStoreLayer = {
118
+ readonly kind: 'StartUpdateStoreLayer';
119
+ childStoreLayer: OptimisticStoreLayer | NetworkResponseStoreLayer | null;
120
+ parentStoreLayer: OptimisticStoreLayer | NetworkResponseStoreLayer;
121
+ data: StoreLayerData;
122
+ startUpdate: DataUpdate<StartUpdateStoreLayer | BaseStoreLayer>;
123
+ };
124
+
125
+ export type OptimisticStoreLayer =
126
+ | OptimisticUpdaterStoreLayer
127
+ | OptimisticNetworkResponseStoreLayer;
128
+
129
+ export type OptimisticUpdaterStoreLayer = {
130
+ readonly kind: 'OptimisticUpdaterStoreLayer';
131
+ childStoreLayer:
132
+ | OptimisticStoreLayer
133
+ | StartUpdateStoreLayer
134
+ | NetworkResponseStoreLayer
135
+ | null;
136
+ parentStoreLayer:
137
+ | OptimisticStoreLayer
138
+ | StartUpdateStoreLayer
139
+ | NetworkResponseStoreLayer
140
+ | BaseStoreLayer;
141
+ data: StoreLayerData;
142
+ readonly startUpdate: DataUpdate<OptimisticUpdaterStoreLayer>;
143
+ };
144
+
145
+ export type OptimisticNetworkResponseStoreLayer = {
146
+ readonly kind: 'OptimisticNetworkResponseStoreLayer';
147
+ childStoreLayer:
148
+ | OptimisticStoreLayer
149
+ | StartUpdateStoreLayer
150
+ | NetworkResponseStoreLayer
151
+ | null;
152
+ parentStoreLayer:
153
+ | OptimisticStoreLayer
154
+ | StartUpdateStoreLayer
155
+ | NetworkResponseStoreLayer
156
+ | BaseStoreLayer;
157
+ data: StoreLayerData;
158
+ };
159
+
160
+ export function addNetworkResponseStoreLayer(
161
+ parent: StoreLayer,
162
+ ): StoreLayerWithData {
163
+ switch (parent.kind) {
164
+ case 'NetworkResponseStoreLayer':
165
+ case 'BaseStoreLayer': {
166
+ return parent;
167
+ }
168
+ case 'StartUpdateStoreLayer':
169
+ case 'OptimisticNetworkResponseStoreLayer':
170
+ case 'OptimisticUpdaterStoreLayer': {
171
+ const node: NetworkResponseStoreLayer = {
172
+ kind: 'NetworkResponseStoreLayer',
173
+ parentStoreLayer: parent,
174
+ childStoreLayer: null,
175
+ data: {},
176
+ };
177
+ parent.childStoreLayer = node;
178
+
179
+ return node;
180
+ }
181
+ default: {
182
+ parent satisfies never;
183
+ throw new Error('Unreachable. This is a bug in Isograph.');
184
+ }
185
+ }
186
+ }
187
+
188
+ function mergeDataLayer(target: StoreLayerData, source: StoreLayerData): void {
189
+ for (const [typeName, sourceById] of Object.entries(source)) {
190
+ if (sourceById == null) {
191
+ target[typeName] = sourceById;
192
+ continue;
193
+ }
194
+ const targetRecordById = (target[typeName] ??= {});
195
+ for (const [id, sourceRecord] of Object.entries(sourceById)) {
196
+ if (sourceRecord === null) {
197
+ targetRecordById[id] = null;
198
+ continue;
199
+ }
200
+ const targetRecord = (targetRecordById[id] ??= {});
201
+ Object.assign(targetRecord, sourceRecord);
202
+ }
203
+ }
204
+ }
205
+
206
+ export function addStartUpdateStoreLayer(
207
+ parent: StoreLayer,
208
+ startUpdate: StartUpdateStoreLayer['startUpdate'],
209
+ ): StoreLayer {
210
+ switch (parent.kind) {
211
+ case 'BaseStoreLayer': {
212
+ startUpdate(parent);
213
+ return parent;
214
+ }
215
+ case 'StartUpdateStoreLayer': {
216
+ const node = parent;
217
+
218
+ const prevStartUpdate = node.startUpdate;
219
+ node.startUpdate = () => {
220
+ prevStartUpdate(node);
221
+ startUpdate(node);
222
+ };
223
+
224
+ startUpdate(node);
225
+ return node;
226
+ }
227
+ case 'NetworkResponseStoreLayer':
228
+ case 'OptimisticNetworkResponseStoreLayer':
229
+ case 'OptimisticUpdaterStoreLayer': {
230
+ const node: StartUpdateStoreLayer = {
231
+ kind: 'StartUpdateStoreLayer',
232
+ parentStoreLayer: parent,
233
+ childStoreLayer: null,
234
+ data: {},
235
+ startUpdate: startUpdate,
236
+ };
237
+ parent.childStoreLayer = node;
238
+
239
+ startUpdate(node);
240
+ return node;
241
+ }
242
+ default: {
243
+ parent satisfies never;
244
+ throw new Error('Unreachable. This is a bug in Isograph.');
245
+ }
246
+ }
247
+ }
248
+
249
+ export function addOptimisticUpdaterStoreLayer(
250
+ parent: StoreLayer,
251
+ startUpdate: OptimisticUpdaterStoreLayer['startUpdate'],
252
+ ): OptimisticUpdaterStoreLayer {
253
+ switch (parent.kind) {
254
+ case 'BaseStoreLayer':
255
+ case 'StartUpdateStoreLayer':
256
+ case 'NetworkResponseStoreLayer':
257
+ case 'OptimisticNetworkResponseStoreLayer':
258
+ case 'OptimisticUpdaterStoreLayer': {
259
+ const node: OptimisticUpdaterStoreLayer = {
260
+ kind: 'OptimisticUpdaterStoreLayer',
261
+ parentStoreLayer: parent,
262
+ childStoreLayer: null,
263
+ data: {},
264
+ startUpdate: startUpdate,
265
+ };
266
+
267
+ startUpdate(node);
268
+ parent.childStoreLayer = node;
269
+
270
+ return node;
271
+ }
272
+ default: {
273
+ parent satisfies never;
274
+ throw new Error('Unreachable. This is a bug in Isograph.');
275
+ }
276
+ }
277
+ }
278
+
279
+ export function addOptimisticNetworkResponseStoreLayer(
280
+ parent: StoreLayer,
281
+ ): OptimisticNetworkResponseStoreLayer {
282
+ switch (parent.kind) {
283
+ case 'BaseStoreLayer':
284
+ case 'StartUpdateStoreLayer':
285
+ case 'NetworkResponseStoreLayer':
286
+ case 'OptimisticNetworkResponseStoreLayer':
287
+ case 'OptimisticUpdaterStoreLayer': {
288
+ const node: OptimisticNetworkResponseStoreLayer = {
289
+ kind: 'OptimisticNetworkResponseStoreLayer',
290
+ parentStoreLayer: parent,
291
+ childStoreLayer: null,
292
+ data: {},
293
+ };
294
+
295
+ parent.childStoreLayer = node;
296
+
297
+ return node;
298
+ }
299
+ default: {
300
+ parent satisfies never;
301
+ throw new Error('Unreachable. This is a bug in Isograph.');
302
+ }
303
+ }
304
+ }
305
+
306
+ /**
307
+ * Merge storeLayerToMerge, and its children, into baseStoreLayer.
308
+ * We can merge until we reach a revertible layer (i.e. an optimistic layer).
309
+ * All other layers cannot be reverted, so for housekeeping + perf, we merge
310
+ * them into a single layer.
311
+ *
312
+ * Note that BaseStoreLayer.childStoreLayer has type OptimisticStoreLayer | null.
313
+ * So, the state of the stack is never e.g. base <- network response. Instead,
314
+ * we have a base + a child that we would like to attach to the base. So, we merge
315
+ * (flatten) until we reach an optimistic layer or null, at which point, we can
316
+ * set baseStoreLayer.childStoreLayer = storeLayerToMerge (via setChildOfNode).
317
+ */
318
+ function mergeLayersWithDataIntoBaseLayer(
319
+ environment: IsographEnvironment,
320
+ storeLayerToMerge: StoreLayer | null,
321
+ baseStoreLayer: BaseStoreLayer,
322
+ ) {
323
+ while (
324
+ storeLayerToMerge &&
325
+ storeLayerToMerge.kind !== 'OptimisticUpdaterStoreLayer'
326
+ ) {
327
+ mergeDataLayer(baseStoreLayer.data, storeLayerToMerge.data);
328
+ storeLayerToMerge = storeLayerToMerge.childStoreLayer;
329
+ }
330
+ setChildOfNode(environment, baseStoreLayer, storeLayerToMerge);
331
+ }
332
+
333
+ /**
334
+ * Now that we have replaced the optimistic layer with a network response layer, we need
335
+ * to
336
+ * - re-execute startUpdate and optimistic nodes, in light of the replaced data, and
337
+ * - create two objects containing the old merged data (from the optimistic update layer
338
+ * onward) and the new merged data (from the network response layer onward).
339
+ * - we will compare the new and old merged data in order to determine the changed records
340
+ * and trigger subscriptions.
341
+ *
342
+ * Here, "merged data" means all of the records + fields that were modified, starting at
343
+ * storeLayer, e.g. in BaseLayer <- OptimisticLayer <- StartUpdateLayer, if we
344
+ * are replacing Optimistic, then oldData will contain the records + fields modified by
345
+ * OptimisticLayer + StartUpdateLayer.
346
+ */
347
+ function reexecuteUpdatesAndMergeData(
348
+ storeLayer:
349
+ | OptimisticStoreLayer
350
+ | NetworkResponseStoreLayer
351
+ | StartUpdateStoreLayer
352
+ | null,
353
+ // reflects the (now reverted) optimistic layer
354
+ oldMergedData: StoreLayerData,
355
+ // reflects whatever replaced the optimistic layer
356
+ newMergedData: StoreLayerData,
357
+ ): void {
358
+ while (storeLayer !== null) {
359
+ mergeDataLayer(oldMergedData, storeLayer.data);
360
+ switch (storeLayer.kind) {
361
+ case 'OptimisticNetworkResponseStoreLayer':
362
+ case 'NetworkResponseStoreLayer':
363
+ break;
364
+ case 'StartUpdateStoreLayer': {
365
+ storeLayer.data = {};
366
+ storeLayer.startUpdate(storeLayer);
367
+ break;
368
+ }
369
+ case 'OptimisticUpdaterStoreLayer': {
370
+ storeLayer.data = {};
371
+ storeLayer.startUpdate(storeLayer);
372
+ break;
373
+ }
374
+ default: {
375
+ storeLayer satisfies never;
376
+ throw new Error('Unreachable. This is a bug in Isograph.');
377
+ }
378
+ }
379
+ mergeDataLayer(newMergedData, storeLayer.data);
380
+
381
+ storeLayer = storeLayer.childStoreLayer;
382
+ }
383
+ }
384
+
385
+ /**
386
+ * Set storeLayerToModify's child to a given layer. This may be null!
387
+ * If it is null, set the environment.store to storeLayerToModify.
388
+ * If it is not null, then the existing environment.store value remains
389
+ * valid.
390
+ */
391
+ function setChildOfNode<TStoreLayer extends StoreLayer>(
392
+ environment: IsographEnvironment,
393
+ storeLayerToModify: TStoreLayer,
394
+ newChildStoreLayer: TStoreLayer['childStoreLayer'],
395
+ ) {
396
+ storeLayerToModify.childStoreLayer = newChildStoreLayer;
397
+ if (newChildStoreLayer !== null) {
398
+ newChildStoreLayer.parentStoreLayer = storeLayerToModify;
399
+ } else {
400
+ environment.store = storeLayerToModify;
401
+ }
402
+ }
403
+
404
+ /**
405
+ * Remove an optimistic store layer from the stack, potentially replacing it
406
+ * with a network response.
407
+ *
408
+ * After we do this, we must re-execute all child startUpdate and optimistic
409
+ * layers (since their data may have changed.) We also keep track of changed
410
+ * records, in order to call affected subscriptions.
411
+ */
412
+ export function revertOptimisticStoreLayerAndMaybeReplace(
413
+ environment: IsographEnvironment,
414
+ optimisticNode: OptimisticStoreLayer,
415
+ normalizeData: null | ((storeLayer: StoreLayerWithData) => void),
416
+ ): void {
417
+ // We cannot just replace the optimistic node with the network response node,
418
+ // because (e.g.) the types allow Base <- Opt, but not Base <- NetworkResponse.
419
+ // We also may be removing the optimistic layer without replacing it with
420
+ // anything, which would also be disallowed if the original stack was
421
+ // Base <- Opt <- NetworkResponse.
422
+ //
423
+ // Thus, instead, we will (1) replace the optimistic node's data with an empty object
424
+ // and attach the network response as a child.
425
+ const oldMergedData = optimisticNode.data;
426
+ optimisticNode.data = {};
427
+
428
+ let newMergedData = {};
429
+ let childNode = optimisticNode.childStoreLayer;
430
+ if (normalizeData !== null) {
431
+ const networkResponseStoreLayer: NetworkResponseStoreLayer = {
432
+ kind: 'NetworkResponseStoreLayer',
433
+ data: {},
434
+ parentStoreLayer: optimisticNode,
435
+ childStoreLayer: null,
436
+ };
437
+ normalizeData(networkResponseStoreLayer);
438
+
439
+ if (childNode?.kind === 'NetworkResponseStoreLayer') {
440
+ // (2) if the optimistic layer's child was a network response, and we are
441
+ // replacing it with a network response, we must merge the replacement
442
+ // and the child.
443
+ mergeDataLayer(networkResponseStoreLayer.data, childNode.data);
444
+ mergeDataLayer(oldMergedData, childNode.data);
445
+ childNode = childNode.childStoreLayer;
446
+ }
447
+ newMergedData = structuredClone(networkResponseStoreLayer.data);
448
+ setChildOfNode(environment, networkResponseStoreLayer, childNode);
449
+ optimisticNode.childStoreLayer = networkResponseStoreLayer;
450
+ }
451
+
452
+ // (3) Re-execute all updates, accumulating all changed values into newMergedData.
453
+ // Since we have already written the network response into newMergedData, we
454
+ // can proceed from the child of the (potentially merged) network response layer.
455
+ //
456
+ // Note that it is important that reexecuteUpdatesAndMergeData is called here!
457
+ // That is because we created newMergedData from the network response layer's data,
458
+ // and later, we may merge that network response into the parent layer (if it is
459
+ // a base layer). That merged layer will contain many extraneous records (unless the
460
+ // base layer is empty).
461
+ //
462
+ // This would cause us to re-execute subscriptions unnecessarily, as these records
463
+ // do not represent changes between the optimistic and network response layers.
464
+ reexecuteUpdatesAndMergeData(childNode, oldMergedData, newMergedData);
465
+
466
+ // (4) Now, we can finally remove the optimistic layer, i.e. do
467
+ // optimistic.parent.child = optimistic.child.
468
+ // But the types don't line up, so we handle the cases differently, based on the
469
+ // parent layer type.
470
+ if (optimisticNode.parentStoreLayer.kind === 'BaseStoreLayer') {
471
+ // (4a) If the optimistic parent is the base layer, then we have a problem: base.child
472
+ // must be an optimistic layer or null. So, we merge the optimistic children into the
473
+ // base layer until we reach an optimistic layer.
474
+ mergeLayersWithDataIntoBaseLayer(
475
+ environment,
476
+ optimisticNode.childStoreLayer,
477
+ optimisticNode.parentStoreLayer,
478
+ );
479
+ } else if (
480
+ optimisticNode.parentStoreLayer.kind === 'NetworkResponseStoreLayer' &&
481
+ optimisticNode.childStoreLayer?.kind === 'NetworkResponseStoreLayer'
482
+ ) {
483
+ // (4b) if the parent is a network response layer, simply merge those. (We do not
484
+ // attempt to merge other layers, e.g. startUpdate layers, because there is some
485
+ // optimistic layer between this layer and the base, and the startUpdate will need
486
+ // to be recalculated if the optimistic layer is reverted.)
487
+ mergeDataLayer(
488
+ optimisticNode.parentStoreLayer.data,
489
+ optimisticNode.childStoreLayer.data,
490
+ );
491
+
492
+ setChildOfNode(
493
+ environment,
494
+ optimisticNode.parentStoreLayer,
495
+ optimisticNode.childStoreLayer.childStoreLayer,
496
+ );
497
+ } else {
498
+ // (4c) Otherwise, the parent is an optimistic or start update layer, and we can
499
+ // set optimistic.parent.child = optimistic.child.
500
+ setChildOfNode(
501
+ environment,
502
+ optimisticNode.parentStoreLayer,
503
+ optimisticNode.childStoreLayer,
504
+ );
505
+ }
506
+
507
+ // (5) finally, compare the oldMergedData and newMergedData objects, in order to extract
508
+ // the modified IDs, and re-execute subscriptions.
509
+ let encounteredIds: EncounteredIds = new Map();
510
+ compareData(oldMergedData, newMergedData, encounteredIds);
511
+ callSubscriptions(environment, encounteredIds);
512
+ }
513
+
514
+ export type StoreLayer =
515
+ | OptimisticStoreLayer
516
+ | NetworkResponseStoreLayer
517
+ | StartUpdateStoreLayer
518
+ | BaseStoreLayer;
519
+
520
+ export type StoreLayerWithData =
521
+ | BaseStoreLayer
522
+ | NetworkResponseStoreLayer
523
+ | OptimisticNetworkResponseStoreLayer;
524
+
525
+ function compareData(
526
+ oldData: StoreLayerData,
527
+ newData: StoreLayerData,
528
+ encounteredIds: EncounteredIds,
529
+ ): void {
530
+ const oldDataTypeNames = new Set(Object.keys(oldData));
531
+ const newDataTypeNames = new Set(Object.keys(newData));
532
+
533
+ for (const oldTypeName of oldDataTypeNames.difference(newDataTypeNames)) {
534
+ const set = insertEmptySetIfMissing(encounteredIds, oldTypeName);
535
+ for (const id in oldData[oldTypeName]) {
536
+ set.add(id);
537
+ }
538
+ }
539
+
540
+ for (const [typeName, newRecords] of Object.entries(newData)) {
541
+ if (newRecords == null) {
542
+ continue;
543
+ }
544
+ const oldRecords = oldData[typeName];
545
+ outer: for (const [id, newRecord] of Object.entries(newRecords)) {
546
+ if (newRecord == null) {
547
+ continue;
548
+ }
549
+ const oldRecord = oldRecords?.[id];
550
+
551
+ for (const [recordKey, newRecordValue] of Object.entries(newRecord)) {
552
+ // TODO: compare links, compare arrays
553
+ if (newRecordValue !== oldRecord?.[recordKey]) {
554
+ const set = insertEmptySetIfMissing(encounteredIds, typeName);
555
+ set.add(id);
556
+ continue outer;
557
+ }
558
+ }
559
+
560
+ encounteredIds.get(typeName)?.delete(id);
561
+ }
562
+ }
563
+ }