@solidjs/signals 2.0.0-rc.15 → 2.0.0-rc.16

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 (89) hide show
  1. package/dist/dev-shared.js +785 -367
  2. package/dist/dev.attribution.js +75 -52
  3. package/dist/dev.js +1120 -567
  4. package/dist/observe/affects-marks.js +86 -0
  5. package/dist/observe/affects.js +22 -73
  6. package/dist/observe/boundaries.js +191 -189
  7. package/dist/observe/core/async.js +175 -131
  8. package/dist/observe/core/attribution-queries.js +1 -1
  9. package/dist/observe/core/attribution.js +176 -159
  10. package/dist/observe/core/constants.js +17 -3
  11. package/dist/observe/core/context.js +3 -3
  12. package/dist/observe/core/core.js +503 -363
  13. package/dist/observe/core/dev.js +66 -38
  14. package/dist/observe/core/effect.js +48 -48
  15. package/dist/observe/core/error.js +5 -3
  16. package/dist/observe/core/external.js +5 -6
  17. package/dist/observe/core/graph.js +57 -43
  18. package/dist/observe/core/heap.js +33 -33
  19. package/dist/observe/core/identities.js +62 -0
  20. package/dist/observe/core/lanes.js +226 -259
  21. package/dist/observe/core/owner.js +62 -50
  22. package/dist/observe/core/scheduler.js +319 -171
  23. package/dist/observe/core/truth.js +45 -0
  24. package/dist/observe/core/verdict.js +88 -50
  25. package/dist/observe/deferred.js +184 -0
  26. package/dist/observe/index.js +7 -1
  27. package/dist/observe/map.js +345 -260
  28. package/dist/observe/reveal.js +76 -76
  29. package/dist/observe/signals.js +41 -30
  30. package/dist/observe/store/affects.js +6 -6
  31. package/dist/observe/store/edges.js +39 -0
  32. package/dist/observe/store/optimistic.js +41 -36
  33. package/dist/observe/store/projection.js +68 -55
  34. package/dist/observe/store/store.js +157 -104
  35. package/dist/prod/affects-marks.js +86 -0
  36. package/dist/prod/affects.js +23 -72
  37. package/dist/prod/boundaries.js +155 -153
  38. package/dist/prod/core/async.js +171 -127
  39. package/dist/prod/core/constants.js +17 -3
  40. package/dist/prod/core/context.js +3 -3
  41. package/dist/prod/core/core.js +478 -342
  42. package/dist/prod/core/effect.js +68 -68
  43. package/dist/prod/core/error.js +5 -3
  44. package/dist/prod/core/external.js +5 -6
  45. package/dist/prod/core/graph.js +57 -43
  46. package/dist/prod/core/heap.js +38 -38
  47. package/dist/prod/core/identities.js +62 -0
  48. package/dist/prod/core/lanes.js +217 -250
  49. package/dist/prod/core/owner.js +62 -51
  50. package/dist/prod/core/scheduler.js +310 -162
  51. package/dist/prod/core/truth.js +45 -0
  52. package/dist/prod/core/verdict.js +87 -49
  53. package/dist/prod/deferred.js +182 -0
  54. package/dist/prod/index.js +7 -1
  55. package/dist/prod/map.js +360 -275
  56. package/dist/prod/reveal.js +76 -76
  57. package/dist/prod/signals.js +41 -30
  58. package/dist/prod/store/affects.js +6 -6
  59. package/dist/prod/store/edges.js +39 -0
  60. package/dist/prod/store/optimistic.js +37 -33
  61. package/dist/prod/store/projection.js +25 -19
  62. package/dist/prod/store/store.js +142 -96
  63. package/dist/types/affects-marks.d.ts +14 -0
  64. package/dist/types/boundaries.d.ts +1 -1
  65. package/dist/types/core/async.d.ts +10 -0
  66. package/dist/types/core/constants.d.ts +13 -1
  67. package/dist/types/core/core.d.ts +44 -2
  68. package/dist/types/core/dev.d.ts +43 -13
  69. package/dist/types/core/graph.d.ts +11 -0
  70. package/dist/types/core/identities.d.ts +17 -0
  71. package/dist/types/core/index.d.ts +2 -1
  72. package/dist/types/core/lanes.d.ts +2 -14
  73. package/dist/types/core/owner.d.ts +5 -3
  74. package/dist/types/core/scheduler.d.ts +47 -28
  75. package/dist/types/core/truth.d.ts +16 -0
  76. package/dist/types/core/types.d.ts +21 -0
  77. package/dist/types/core/verdict.d.ts +32 -0
  78. package/dist/types/deferred.d.ts +28 -0
  79. package/dist/types/index.d.ts +6 -0
  80. package/dist/types/map.d.ts +2 -2
  81. package/dist/types/signals.d.ts +28 -7
  82. package/dist/types/store/edges.d.ts +9 -0
  83. package/dist/types/store/index.d.ts +10 -3
  84. package/dist/types/store/optimistic.d.ts +3 -2
  85. package/dist/types/store/projection.d.ts +4 -3
  86. package/dist/types/store/store.d.ts +1 -1
  87. package/dist/types/store/target.d.ts +16 -8
  88. package/dist/types/store/types.d.ts +14 -0
  89. package/package.json +1 -1
@@ -1,16 +1,16 @@
1
- import { STATUS_UNINITIALIZED, STATUS_ERROR, STATUS_PENDING, CONFIG_GUESS, CONFIG_AUTO_DISPOSE, REACTIVE_DIRTY, NOT_PENDING, REACTIVE_DISPOSED, CONFIG_REDERIVE, CONFIG_VERDICT, CONFIG_HELD, CONFIG_OVERRIDE, REACTIVE_ZOMBIE } from "./constants.js";
1
+ import { STATUS_ERROR, STATUS_PENDING, STATUS_UNINITIALIZED, CONFIG_GUESS, CONFIG_HELD, REACTIVE_STAGED_READ, CONFIG_STAGED, CONFIG_STAGED_ERROR, CONFIG_AUTO_DISPOSE, REACTIVE_ZOMBIE, REACTIVE_DIRTY, NOT_PENDING, REACTIVE_DISPOSED, CONFIG_REDERIVE, CONFIG_VERDICT, CONFIG_OVERRIDE } from "./constants.js";
2
2
 
3
- import { untrack, ext, context, statusNotifierOf, setSignal } from "./core.js";
3
+ import { ext, statusNotifierOf, untrack, context, setSignal } from "./core.js";
4
4
 
5
- import { NotReadyError, StatusError } from "./error.js";
5
+ import { StatusError, NotReadyError } from "./error.js";
6
6
 
7
- import { trimStaleDeps, unobserved } from "./graph.js";
7
+ import { unobserved, trimStaleDeps } from "./graph.js";
8
8
 
9
9
  import { enqueueSub } from "./heap.js";
10
10
 
11
11
  import { cleanup } from "./owner.js";
12
12
 
13
- import { question, MAINLINE_QUESTION, passLane, joinFuture, clock, schedule, flush, globalQueue, txOf, GlobalQueue, queuePendingNode } from "./scheduler.js";
13
+ import { passLane, joinFuture, question, MAINLINE_QUESTION, globalQueue, schedule, clock, flush, freshHook, txOf, laneStageHook, queuePendingNode } from "./scheduler.js";
14
14
 
15
15
  // The lazily-created Set is the ONE container for pending sources. Its
16
16
  // predecessor — a singular slot promoted to a Set on the second source —
@@ -18,22 +18,22 @@ import { question, MAINLINE_QUESTION, passLane, joinFuture, clock, schedule, flu
18
18
  // overlapping source landed beside the Set and removePendingSource refused
19
19
  // to clear it, stranding the Set members' pending forever (#2893).
20
20
  function addPendingSource(e, t) {
21
- if (e.m?.Se?.has(t)) return false;
22
- (ext(e).Se ??= new Set).add(t);
21
+ if (e.T?.fe?.has(t)) return false;
22
+ (ext(e).fe ??= new Set).add(t);
23
23
  return true;
24
24
  }
25
25
 
26
26
  function removePendingSource(e, t) {
27
- const n = e.m?.Se;
27
+ const n = e.T?.fe;
28
28
  if (!n?.delete(t)) return false;
29
- if (!n.size) e.m.Se = undefined;
29
+ if (!n.size) e.T.fe = undefined;
30
30
  return true;
31
31
  }
32
32
 
33
33
  function clearPendingSources(e) {
34
34
  // This set is node-owned and never shared; dropping the sole reference
35
35
  // releases the set and every entry without a redundant clear() walk.
36
- if (e.m !== null) e.m.Se = undefined;
36
+ if (e.T !== null) e.T.fe = undefined;
37
37
  }
38
38
 
39
39
  // A rejection-pending only resolves through the settle sweep over the
@@ -42,9 +42,9 @@ function clearPendingSources(e) {
42
42
  // (pending sources propagate the origin node, so this covers any depth).
43
43
  // Also guards branch-local recovery: another dependency may still need the source.
44
44
  function retryReaches(e, t) {
45
- for (let n = e.p; n; n = n._) {
46
- const e = n.I;
47
- if (e === t || e.m?.Se?.has(t)) return true;
45
+ for (let n = e.C; n; n = n.G) {
46
+ const e = n.S;
47
+ if (e === t || e.T?.fe?.has(t)) return true;
48
48
  }
49
49
  return false;
50
50
  }
@@ -56,32 +56,32 @@ function retryReaches(e, t) {
56
56
  * with NO read-visible pending status and no downstream propagation. Commit
57
57
  * #0 keeps serving.
58
58
  */ function parkLoadingWindow(e, t) {
59
- ext(e).de = true;
59
+ ext(e).ue = true;
60
60
  if (t.source) addPendingSource(e, t.source);
61
61
  // A settled error is the node's answer ("the error stays the answer until
62
62
  // this retry can actually run") — the park must not replace it: reads
63
63
  // throw `_error` while STATUS_ERROR is set, and overwriting it here leaks
64
64
  // a pending-class NotReadyError from a read-invisible park (#2989).
65
- if (!(e.S & STATUS_ERROR)) setPendingError(e, t.source, t);
65
+ if (!(e.m & STATUS_ERROR)) setPendingError(e, t.source, t);
66
66
  }
67
67
 
68
68
  function setPendingError(e, t, n) {
69
69
  if (!t) {
70
- if (e.m !== null) e.m.F = null;
70
+ if (e.T !== null) e.T.F = null;
71
71
  return;
72
72
  }
73
73
  if (n instanceof NotReadyError && n.source === t) {
74
74
  ext(e).F = n;
75
75
  return;
76
76
  }
77
- const r = e.m?.F;
77
+ const r = e.T?.F;
78
78
  if (!(r instanceof NotReadyError) || r.source !== t) {
79
79
  ext(e).F = new NotReadyError(t);
80
80
  }
81
81
  }
82
82
 
83
83
  function forEachDependent(e, t) {
84
- for (let n = e.t; n !== null; n = n.o) t(n.l, n);
84
+ for (let n = e.o; n !== null; n = n.t) t(n.u, n);
85
85
  }
86
86
 
87
87
  // Queue a node to re-run on the next flush (used both when a pending source
@@ -95,7 +95,7 @@ function forEachDependent(e, t) {
95
95
  // callbacks handle their own release (settleAutodispose in handleAsync); this
96
96
  // covers derivatively-pending dependents, which have no callbacks of their own.
97
97
  function releaseIfSettledUnobserved(e) {
98
- e.ee && e.i & CONFIG_AUTO_DISPOSE && !e.t && !(e.R & REACTIVE_ZOMBIE) && !(e.S & STATUS_PENDING) && unobserved(e);
98
+ e.X && e.l & CONFIG_AUTO_DISPOSE && !e.o && !(e.R & REACTIVE_ZOMBIE) && !(e.m & STATUS_PENDING) && unobserved(e);
99
99
  }
100
100
 
101
101
  // Error-path sweep: notifyStatus(STATUS_ERROR) clears dependents' pending
@@ -108,7 +108,7 @@ function releaseSettledDependents(e) {
108
108
  const visit = e => {
109
109
  if (n.has(e)) return;
110
110
  n.add(e);
111
- if (!e.t && e.i & CONFIG_AUTO_DISPOSE) (t ??= []).push(e);
111
+ if (!e.o && e.l & CONFIG_AUTO_DISPOSE) (t ??= []).push(e);
112
112
  forEachDependent(e, visit);
113
113
  };
114
114
  forEachDependent(e, visit);
@@ -130,13 +130,42 @@ function releaseSettledDependents(e) {
130
130
  // (releaseSettledDependents shape): identity holders can sit below an
131
131
  // intermediate whose own error state has since been scrubbed or replaced
132
132
  // (e.g. an error boundary's tree node).
133
+ /** D-41: an error a pass of a held node found is an answer of
134
+ * that frame — it ends the wait like a value and shows when a value would.
135
+ * Staged like one: `_pendingValue` carries it (CONFIG_STAGED_ERROR), readers
136
+ * in the hold derive from it (`serve` throws it), and the commit publishes
137
+ * it through the ordinary error path (`commitPendingNode` → `notifyStatus`),
138
+ * dependents included. Not for a lane pass, nor a node with no shown value
139
+ * (born held — its error has no frame to wait behind): those publish now,
140
+ * as before. Returns whether the error was staged. */ function stageError(e, t, n) {
141
+ // Held, or — for a pass's own throw — derived from a staging of a flush
142
+ // (REACTIVE_STAGED_READ is this pass's; a landing after the pass cannot
143
+ // read it, the flush it read a staging of has committed or parked since).
144
+ // Staged whether or not the flush has joined a hold yet: a pass that runs
145
+ // before its async sibling joins is the seam's to decide, like a value
146
+ // (#4109). A flush that parks nothing publishes it at its commit (S-38).
147
+ if (!(e.l & CONFIG_HELD || n && e.R & REACTIVE_STAGED_READ && globalQueue.q) || passLane) return false;
148
+ // The node answered (an error ends the wait — no longer pending, nor
149
+ // blocked); a shown error stays its display until the commit.
150
+ clearPendingSources(e);
151
+ if (e.T) e.T.ue = false;
152
+ if (!((e.m &= STATUS_ERROR | STATUS_UNINITIALIZED) & STATUS_ERROR)) setPendingError(e);
153
+ e.se = t instanceof StatusError ? t : new StatusError(e, t);
154
+ e.l |= CONFIG_STAGED | CONFIG_STAGED_ERROR;
155
+ // Readers parked on the flight re-run and derive from the staging; the
156
+ // verdict readers the walk wakes need a flush (#4106).
157
+ settlePendingSource(e);
158
+ schedule();
159
+ return true;
160
+ }
161
+
133
162
  function settleErroredDependents(e, t) {
134
163
  let n = false;
135
164
  const r = new Set;
136
165
  const visit = e => {
137
166
  if (r.has(e)) return;
138
167
  r.add(e);
139
- if (e.m?.F === t) {
168
+ if (e.T?.F === t) {
140
169
  enqueueSub(e);
141
170
  n = true;
142
171
  }
@@ -171,35 +200,35 @@ function settlePendingSource(e, t = e) {
171
200
  // when the source went pending, `propagateStatus`), and a landing
172
201
  // equal to the committed value notifies nobody — the source settling
173
202
  // is its verdict changing: it runs again.
174
- return f.i & CONFIG_VERDICT && enqueueSub(f);
203
+ return f.l & CONFIG_VERDICT && enqueueSub(f);
175
204
  o.add(f);
176
- f.Ie = clock;
177
- const u = f.m?.Se?.values().next().value;
205
+ f.ie = clock;
206
+ const u = f.T?.fe?.values().next().value;
178
207
  // STATUS_ERROR + pending sources only coexist via an errored loading
179
208
  // window's park (notifyStatus(STATUS_ERROR) clears pending sources
180
209
  // otherwise): the settled error stays the answer through the settle —
181
210
  // nulling it here would have reads throw `null` until the re-enqueued
182
211
  // retry lands, or lose it entirely if that retry parks again (#2989).
183
- const i = f.S & STATUS_ERROR;
212
+ const s = f.m & STATUS_ERROR;
184
213
  if (u) {
185
- if (!i) setPendingError(f, u);
214
+ if (!s) setPendingError(f, u);
186
215
  } else {
187
- f.S &= ~STATUS_PENDING;
188
- if (!i) setPendingError(f);
216
+ f.m &= ~STATUS_PENDING;
217
+ if (!s) setPendingError(f);
189
218
  // L2: a landing resumes the transaction waiting on it (maintainer: "it
190
219
  // resumes the sync frame") — a held reader's re-pass over the landed
191
220
  // value is that transaction's work, and the flush that carries it
192
221
  // parks into it.
193
- if (f.i & CONFIG_HELD) joinFuture(txOf(f));
194
- if (f.m?.de) {
222
+ if (f.l & CONFIG_HELD) joinFuture(txOf(f));
223
+ if (f.T?.ue) {
195
224
  enqueueSub(f);
196
225
  n = true;
197
226
  }
198
- if (f.m !== null) f.m.de = false;
227
+ if (f.T !== null) f.T.ue = false;
199
228
  // Fully settled with nobody watching: release candidate (#2934). Checked
200
229
  // again at release time — deferred so unobserved() can't unlink subs
201
230
  // lists this walk is still iterating.
202
- if (!f.t && f.i & CONFIG_AUTO_DISPOSE) (r ??= []).push(f);
231
+ if (!f.o && f.l & CONFIG_AUTO_DISPOSE) (r ??= []).push(f);
203
232
  }
204
233
  forEachDependent(f, settle);
205
234
  };
@@ -216,9 +245,9 @@ function isThenable(e) {
216
245
  }
217
246
 
218
247
  /** Fire and clear a node's iterator-flight cancellation hook (#3122). */ function releaseFlightTeardown(e) {
219
- const t = e.m?.Ne;
248
+ const t = e.T?.ae;
220
249
  if (t != null) {
221
- e.m.Ne = null;
250
+ e.T.ae = null;
222
251
  t();
223
252
  }
224
253
  }
@@ -238,9 +267,9 @@ r) {
238
267
  });
239
268
  }
240
269
  if (!f && !o) {
241
- if (e.m !== null) e.m.Te = null;
270
+ if (e.T !== null) e.T.Se = null;
242
271
  // A sync landing is the first real answer for a loadingValue node.
243
- e.De = false;
272
+ e.ce = false;
244
273
  return t;
245
274
  }
246
275
  // Flight replacement relies on recompute's supersede release for iterator
@@ -248,51 +277,54 @@ r) {
248
277
  // self-registration — runs during a recompute of `el`, which has already
249
278
  // fired _flightTeardown. A future non-recompute registration path must
250
279
  // release it here before overwriting _inFlight.
251
- ext(e).Te = t;
280
+ ext(e).Se = t;
252
281
  // The question this flight answers (A18 provenance, lanes.ts): the action
253
282
  // whose slice asked it; mainline is always the current question.
254
- e.m._e = question || MAINLINE_QUESTION;
283
+ e.T.Ee = question || MAINLINE_QUESTION;
255
284
  // The run that asked this flight read every input without throwing: an
256
285
  // input still in flight was masked for it (an active override, A17), so
257
286
  // pending state those inputs propagated onto the node earlier does not
258
287
  // describe this answer. Drop it — the flight is the node's pending now.
259
288
  // The landing retires only the flight's own entry (landStatus, #3373), so
260
289
  // an entry that survived here would hold the node past its own answer.
261
- e.m.Se = undefined;
290
+ e.T.fe = undefined;
262
291
  let u;
263
- const handleError = n => {
264
- if (e.m?.Te !== t) return;
292
+ const handleError = o => {
293
+ if (e.T?.Se !== t) return;
265
294
  // NotReadyError from rejected promises should be treated as pending, not error
266
- let o = n instanceof NotReadyError;
267
- if (o && e.De) {
295
+ let f = o instanceof NotReadyError;
296
+ if (f && e.ce) {
268
297
  // Loading window: the flight died waiting on an unready source. Keep
269
298
  // serving commit #0 — same parking as recompute's catch for sync
270
299
  // dependency throws. The dead flight is released so the clock-gated
271
300
  // error-retry pull (updateIfNecessary) can also re-ask.
272
- if (e.m !== null) e.m.Te = null;
273
- parkLoadingWindow(e, n);
274
- e.Ie = clock;
301
+ if (e.T !== null) e.T.Se = null;
302
+ parkLoadingWindow(e, o);
303
+ e.ie = clock;
275
304
  return;
276
305
  }
277
- notifyStatus(e, o ? STATUS_PENDING : STATUS_ERROR, n);
306
+ // D-41: a held node's error is staged (`stageError`). A derived store's
307
+ // readers learn its error through the family, not the derive's
308
+ // dependents: it publishes now.
309
+ if (f || n || !stageError(e, o)) notifyStatus(e, f ? STATUS_PENDING : STATUS_ERROR, o);
278
310
  // A NotReady rejection is a landing into another pending source. The
279
311
  // rejected flight will never settle its self entry, so transfer ownership
280
312
  // after notifyStatus has propagated the replacement source.
281
- if (o) settlePendingSource(e);
282
- e.Ie = clock;
313
+ if (f) settlePendingSource(e);
314
+ e.ie = clock;
283
315
  // A real error settles derivatively-pending dependents (notifyStatus
284
316
  // cleared their pending sources), so stranded lazy ones release here —
285
317
  // the error twin of settlePendingSource's release (#2934).
286
- if (!o) releaseSettledDependents(e);
287
- r?.(n, o);
318
+ if (!f) releaseSettledDependents(e);
319
+ r?.(o, f);
288
320
  };
289
321
  const asyncWrite = (r, o) => {
290
- if (e.m?.Te !== t) return;
322
+ if (e.T?.Se !== t) return;
291
323
  // If the node was dirtied by a newer write (optimistic override or regular),
292
324
  // skip this stale async result — the upcoming flush will recompute the node
293
325
  // with the new value, creating a fresh Promise that supersedes this one.
294
326
  if (e.R & REACTIVE_DIRTY) return;
295
- const f = !!(e.S & STATUS_UNINITIALIZED);
327
+ const f = e.m & STATUS_UNINITIALIZED;
296
328
  landStatus(e);
297
329
  if (n) {
298
330
  try {
@@ -301,27 +333,25 @@ r) {
301
333
  handleError(e);
302
334
  return;
303
335
  }
336
+ // A store derive's landing commits through its setter: unheld, the
337
+ // shown error leaves now; held, at the derive's commit.
338
+ if (!(e.l & CONFIG_HELD)) e.T.de = undefined;
304
339
  if (f) landStatus(e, true);
305
340
  } else {
306
341
  // CARVE 2: the override-covered landing (hold + A18 supersession) and the
307
342
  // lane-routed landing (derived override, lane effect queue) went with
308
343
  // the optimistic engine; every landing is the plain setSignal. A node
309
- // already held stages its answer into that hold (`setSignal`).
310
- try {
311
- setSignal(e, () => r);
312
- } catch (t) {
313
- // Same containment as above: setSignal's comparator throw is the only
314
- // pre-commit failure here, and there is no user callsite to throw to.
315
- notifyStatus(e, STATUS_ERROR, t);
316
- }
344
+ // already held stages its answer into that hold (`setSignal`). Its
345
+ // comparator throw is contained there (`isSame`, A3).
346
+ setSignal(e, () => r);
317
347
  }
318
348
  // First real answer landing: the window closes when the answer becomes
319
349
  // OBSERVABLE. A direct commit is observable now; a staged write
320
350
  // (`_pendingValue` set inside setSignal) is not — commitPendingNode closes
321
351
  // the window when the flush commits it, so no one-frame pulse can leak to
322
352
  // observers between the landing and its commit (#2990).
323
- if (e.Oe === NOT_PENDING) {
324
- e.De = false;
353
+ if (e.se === NOT_PENDING) {
354
+ e.ce = false;
325
355
  // The landing published: the dependency tail the flight's pass left
326
356
  // linked goes now (A30, #3410). A staged landing has not replaced the
327
357
  // committed frame yet; `commitPendingNode` trims it.
@@ -340,7 +370,7 @@ r) {
340
370
  // Returns whether the node released, so the iterator branch can stop
341
371
  // pulling values instead of pumping an unobserved stream forever (#2935).
342
372
  const settleAutodispose = () => {
343
- if (e.i & CONFIG_AUTO_DISPOSE && !e.t && !(e.S & STATUS_PENDING)) {
373
+ if (e.l & CONFIG_AUTO_DISPOSE && !e.o && !(e.m & STATUS_PENDING)) {
344
374
  unobserved(e);
345
375
  return true;
346
376
  }
@@ -353,44 +383,50 @@ r) {
353
383
  // close registration uses the ambient owner; and DEFERRED (the flattening
354
384
  // path — a thenable resolved to an iterable in a later microtask), where
355
385
  // there is no caller to serve and no ambient owner: sync-settled steps
356
- // write through asyncWrite, and close registration goes through the slot
357
- // the thenable branch pre-registered while it still owned the context.
358
- // Returns whether a sync answer landed (first yield or empty completion) —
359
- // meaningful only in the live posture.
386
+ // write through asyncWrite, and close registration targets `owner` (el
387
+ // itself) directly. Returns whether a sync answer landed (first yield or
388
+ // empty completion) — meaningful only in the live posture.
360
389
  const consumeIterator = (n, r) => {
361
390
  const o = n[Symbol.asyncIterator]();
362
391
  let f = false;
363
- let i = false;
364
- let s = !r;
392
+ let s = false;
393
+ let i = !r;
365
394
  const close = () => {
366
- if (i) return;
367
- i = true;
395
+ if (s) return;
396
+ s = true;
368
397
  try {
369
398
  const e = o.return?.();
370
399
  if (isThenable(e)) e.then(undefined, () => {});
371
400
  } catch {}
372
401
  };
373
- r ? r(close) : cleanup(close);
402
+ cleanup(close, r);
374
403
  // Flight-identity cancellation (#3122): the registration above is the
375
404
  // owner-death backstop; the teardown slot fires at the _inFlight release
376
405
  // sites so supersede stops this stream immediately.
377
- ext(e).Ne = close;
406
+ ext(e).ae = close;
378
407
  // Release check before each next pull: an unobserved lazy node must tear
379
408
  // down (its close above runs via disposal, closing the iterator) instead
380
409
  // of pumping the stream forever with zero subscribers (#2935).
410
+ // Later pulls run from an async continuation with no compute catch above
411
+ // them: a throw invoking the protocol (next(), the step's then) settles
412
+ // as this flight's error instead of escaping as a rejection (#4112).
381
413
  const iterateOrRelease = () => {
382
- if (!settleAutodispose()) iterate();
414
+ try {
415
+ if (!settleAutodispose()) iterate();
416
+ } catch (e) {
417
+ handleError(e);
418
+ }
383
419
  };
384
420
  const iterate = () => {
385
- let n, r, l = false, a = false, c = true;
421
+ let n, r, l = false, a = false, S = true;
386
422
  // Protocol tolerance, matching `for await`: `await` unwraps whatever
387
423
  // next() returns — a thenable OR a bare IteratorResult. Real producers
388
424
  // use the bare form as a promise-free fast path when a value is already
389
425
  // buffered (seroval's deserialized streams do), so a bare result is
390
426
  // assimilated as an already-settled step instead of crashing on `.then`.
391
- const S = o.next();
392
- const E = isThenable(S) ? S : {
393
- then: e => void e(S)
427
+ const c = o.next();
428
+ const E = isThenable(c) ? c : {
429
+ then: e => void e(c)
394
430
  };
395
431
  E.then(r => {
396
432
  // The sync stash only serves the INITIAL drain (handleAsync's caller
@@ -400,17 +436,17 @@ r) {
400
436
  // stash: it must write through the async path or the value is
401
437
  // silently dropped. (The deferred posture never has a caller, so
402
438
  // initialRead starts false there and everything writes through.)
403
- if (c && s) {
439
+ if (S && i) {
404
440
  n = r;
405
441
  l = true;
406
- if (r.done) i = true;
407
- } else if (e.m?.Te !== t) {
442
+ if (r.done) s = true;
443
+ } else if (e.T?.Se !== t) {
408
444
  return;
409
445
  } else if (!r.done) {
410
446
  f = true;
411
447
  asyncWrite(r.value, iterateOrRelease);
412
448
  } else {
413
- i = true;
449
+ s = true;
414
450
  if (f) {
415
451
  schedule();
416
452
  flush();
@@ -421,21 +457,21 @@ r) {
421
457
  settleAutodispose();
422
458
  }
423
459
  }, n => {
424
- if (c && s) {
460
+ if (S && i) {
425
461
  r = n;
426
462
  a = true;
427
- } else if (e.m?.Te === t) {
428
- i = true;
463
+ } else if (e.T?.Se === t) {
464
+ s = true;
429
465
  handleError(n);
430
466
  settleAutodispose();
431
467
  }
432
468
  });
433
- c = false;
469
+ S = false;
434
470
  if (a) {
435
471
  // Match the promise branch, but only rethrow during the initial read.
436
- i = true;
472
+ s = true;
437
473
  handleError(r);
438
- if (s) throw r;
474
+ if (i) throw r;
439
475
  return true;
440
476
  }
441
477
  if (l && !n.done) {
@@ -447,13 +483,13 @@ r) {
447
483
  };
448
484
  const l = iterate();
449
485
  // Later iterate() calls run from asyncWrite, where rethrowing would be unhandled.
450
- s = false;
486
+ i = false;
451
487
  return f || l;
452
488
  };
453
489
  // Landed-synchronously verdict for a LIVE iterator drain; null when no live
454
490
  // drain ran (plain promise flight, or a deferred flatten). Drives the
455
491
  // shared NotReady/loading tail below.
456
- let i = null;
492
+ let s = null;
457
493
  // Flatten one async level: a thenable that RESOLVES to an AsyncIterable —
458
494
  // the shape every async stub returning a stream produces — consumes as the
459
495
  // stream itself rather than settling on the iterable object. One level
@@ -467,27 +503,33 @@ r) {
467
503
  });
468
504
  }
469
505
  if (!n) return false;
506
+ u = undefined;
470
507
  const r = consumeIterator(e, t);
471
- if (!t) i = r;
508
+ if (!t) s = r;
472
509
  return true;
473
510
  };
474
511
  if (f) {
475
512
  let n = false, r = false, o, f = true;
476
- // Close registration for the flattening path. Consumption starts in a
477
- // microtask where the ambient owner is gone (or worse, someone else's),
478
- // so `cleanup()` can't be used — the close targets el's disposal list
479
- // directly, exactly where a live cleanup() during this recompute would
480
- // have put it. Only a flight that actually flattens becomes
481
- // disposal-bearing.
482
- const registerDeferredClose = t => {
483
- if (!e.Re) e.Re = t; else if (Array.isArray(e.Re)) e.Re.push(t); else e.Re = [ e.Re, t ];
484
- };
485
513
  t.then(r => {
486
514
  if (f) {
487
515
  u = r;
488
516
  n = true;
489
- } else if (e.m?.Te === t && !(e.R & REACTIVE_DISPOSED) && flattenIfIterable(r, registerDeferredClose)) ; else {
490
- asyncWrite(r);
517
+ } else {
518
+ // Flattening consumes the stream as the value: each yield lands
519
+ // through asyncWrite under this flight's identity; the first one
520
+ // clears pending exactly like a plain promise resolution would.
521
+ // Disposed nodes never start a pump (their disposal list already
522
+ // ran, so nothing could close the iterator). Consumption starts in
523
+ // a microtask where the ambient owner is gone, so the close
524
+ // registers on el's own disposal list. Iterator setup here has no
525
+ // compute catch above it: a protocol throw settles as this
526
+ // flight's error (#4112).
527
+ try {
528
+ if (e.T?.Se === t && !(e.R & REACTIVE_DISPOSED) && flattenIfIterable(r, e)) return;
529
+ asyncWrite(r);
530
+ } catch (e) {
531
+ handleError(e);
532
+ }
491
533
  settleAutodispose();
492
534
  }
493
535
  }, e => {
@@ -511,35 +553,35 @@ r) {
511
553
  // work on a loadingValue node is loading-class (invisible to
512
554
  // boundaries); the flight itself is already registered in _inFlight and
513
555
  // lands through asyncWrite.
514
- if (e.De) return e.Ae;
556
+ if (e.ce) return e.Ie;
515
557
  throw new NotReadyError(context);
516
558
  } else if (!flattenIfIterable(u)) {
517
559
  // Synchronously-resolved promise: the first real answer landed.
518
- e.De = false;
560
+ e.ce = false;
519
561
  }
520
562
  // A sync-resolved promise holding an AsyncIterable flattened LIVE (we
521
563
  // are still inside the synchronous read): full initial-drain semantics
522
564
  // apply and the shared tail below settles the verdict.
523
565
  }
524
566
  if (o) flattenIfIterable(t);
525
- if (i !== null) {
526
- if (!i) {
567
+ if (s !== null) {
568
+ if (!s) {
527
569
  // Loading window: serve commit #0 (see the promise branch above).
528
- if (e.De) return e.Ae;
570
+ if (e.ce) return e.Ie;
529
571
  throw new NotReadyError(context);
530
572
  }
531
573
  // A sync first yield (or immediate empty completion) is the first real
532
574
  // answer; async yields clear inside asyncWrite.
533
- e.De = false;
575
+ e.ce = false;
534
576
  }
535
577
  return u;
536
578
  }
537
579
 
538
580
  function clearStatus(e, t = false) {
539
- if (e.m?.Se) clearPendingSources(e);
540
- if (e.m?.de) if (e.m !== null) e.m.de = false;
541
- e.S = t ? 0 : e.S & STATUS_UNINITIALIZED;
542
- if (e.m?.F) setPendingError(e);
581
+ if (e.T?.fe) clearPendingSources(e);
582
+ if (e.T?.ue) if (e.T !== null) e.T.ue = false;
583
+ e.m = t ? 0 : e.m & STATUS_UNINITIALIZED;
584
+ if (e.T?.F) setPendingError(e);
543
585
  const n = statusNotifierOf(e);
544
586
  if (n) n.call(e);
545
587
  }
@@ -569,11 +611,11 @@ function clearStatus(e, t = false) {
569
611
  * reader thrown NotReady(self) would park on a retired entry. Companions
570
612
  * keep their verdict (pending before and after; the write re-syncs them).
571
613
  */ function landStatus(e, t = false) {
572
- const n = e.m?.Se;
614
+ const n = e.T?.fe;
573
615
  // (The full clear below drops the set whether or not self was retired first.)
574
616
  if (n && (n.delete(e), n.size)) {
575
- e.m.de = false;
576
- if (t) e.S = STATUS_PENDING;
617
+ e.T.ue = false;
618
+ if (t) e.m = STATUS_PENDING;
577
619
  setPendingError(e, n.values().next().value);
578
620
  } else clearStatus(e, t);
579
621
  }
@@ -585,14 +627,16 @@ function notifyStatus(e, t, n, r) {
585
627
  // (CARVE 2: the lane assignment went with the engine.)
586
628
  {
587
629
  if (t === STATUS_PENDING && o) {
630
+ // D-41: a re-ask of a shown error keeps it the display (`_shownError`).
631
+ if (e.m & STATUS_ERROR) e.T.de = e.T.F;
588
632
  addPendingSource(e, o);
589
- e.S = STATUS_PENDING | e.S & STATUS_UNINITIALIZED;
633
+ e.m = STATUS_PENDING | e.m & STATUS_UNINITIALIZED;
590
634
  // Preserve the current source on this propagation so readers park on
591
635
  // the distinct pending source.
592
636
  setPendingError(e, o, n);
593
637
  } else {
594
638
  clearPendingSources(e);
595
- e.S = t | (t !== STATUS_ERROR ? e.S & STATUS_UNINITIALIZED : 0);
639
+ e.m = t | (t !== STATUS_ERROR ? e.m & STATUS_UNINITIALIZED : 0);
596
640
  ext(e).F = n;
597
641
  }
598
642
  }
@@ -602,7 +646,7 @@ function notifyStatus(e, t, n, r) {
602
646
  // transition's to wait on — the frame it was asked in holds (A17: "a
603
647
  // transition whose optimistic node is still pending on its own fetch is
604
648
  // not complete"), through the node itself (`blocked`).
605
- if (t === STATUS_PENDING && e.i & CONFIG_GUESS) {
649
+ if (t === STATUS_PENDING && e.l & CONFIG_GUESS) {
606
650
  if (passLane === null) joinFuture(null);
607
651
  return;
608
652
  }
@@ -623,7 +667,7 @@ function notifyStatus(e, t, n, r) {
623
667
  * (store/projection.ts `wakeFamily`), exactly as a memo's would reach its. */ function propagateStatus(e, t, n, r) {
624
668
  const o = t === STATUS_PENDING && n instanceof NotReadyError ? n.source : undefined;
625
669
  forEachDependent(e, (r, f) => {
626
- r.Ie = clock;
670
+ r.ie = clock;
627
671
  // A pending mark on a kept-tail link re-derives the subscriber instead of
628
672
  // marking it (A30, #3494 review; fuzzer latest-1 #2141; #3519 review).
629
673
  // Past `_depsTail` lie the committed frame's deps, kept by A30 because
@@ -643,7 +687,7 @@ function notifyStatus(e, t, n, r) {
643
687
  // Inheriting the error would make a probe's reader errored. A boundary's
644
688
  // output (CONFIG_REDERIVE, boundaries.ts) the same: content or fallback
645
689
  // is its pass's call.
646
- if (r.i & (CONFIG_REDERIVE | CONFIG_VERDICT) || t === STATUS_PENDING && f.Pe !== r.pe) {
690
+ if (r.l & (CONFIG_REDERIVE | CONFIG_VERDICT) || t === STATUS_PENDING && f.Te !== r.Ne) {
647
691
  enqueueSub(r);
648
692
  schedule();
649
693
  return;
@@ -655,25 +699,25 @@ function notifyStatus(e, t, n, r) {
655
699
  // frame still passes through — its pass is the frame's (#3372, compiled
656
700
  // shape: the unmount it stages makes the observer a zombie whose say is
657
701
  // moot for this transaction, A15 #3463).
658
- if (t === STATUS_PENDING && o && r.m?.Se?.has(o)) {
659
- if (passLane === null && (r.i & (CONFIG_HELD | CONFIG_OVERRIDE)) === CONFIG_HELD && globalQueue.X) joinFuture(txOf(r));
702
+ if (t === STATUS_PENDING && o && r.T?.fe?.has(o)) {
703
+ if (passLane === null && (r.l & (CONFIG_HELD | CONFIG_OVERRIDE)) === CONFIG_HELD && globalQueue.q && !freshHook?.(r, o.ie === clock)) joinFuture(txOf(r));
660
704
  return;
661
705
  }
662
- if (t === STATUS_PENDING && o || t !== STATUS_PENDING && (r.m?.F !== n || r.m?.Se)) {
706
+ if (t === STATUS_PENDING && o || t !== STATUS_PENDING && (r.T?.F !== n || r.T?.fe)) {
663
707
  // The marked subscriber is queued for the commit sweep so its status
664
708
  // bookkeeping (loading window, uninitialized clear) runs with the flush
665
709
  // — with the lane, when the pass propagating is the lane's work and
666
710
  // the dependent's pending is the lane's own flight (`laneStage`).
667
711
  {
668
712
  // (No answer: a pending propagation leaves a written guess a guess.)
669
- if (passLane !== null) GlobalQueue.W(r, passLane, true, e); else {
713
+ if (laneStageHook && passLane !== null) laneStageHook(r, passLane, true, e); else {
670
714
  queuePendingNode(r);
671
715
  // A15 (#3443): pending propagates onto a held memo without
672
716
  // recomputing it, and the propagation itself enters the memo's
673
717
  // transaction — the flight flows into a memo that transaction
674
718
  // holds, so the write that started it is held with it. A render
675
719
  // effect's membership is its pass's (`notify`), never sticky.
676
- if (t === STATUS_PENDING && (r.i & (CONFIG_HELD | CONFIG_OVERRIDE)) === CONFIG_HELD && !r.u) joinFuture(txOf(r));
720
+ if (t === STATUS_PENDING && (r.l & (CONFIG_HELD | CONFIG_OVERRIDE)) === CONFIG_HELD && !r.i) joinFuture(txOf(r));
677
721
  }
678
722
  }
679
723
  notifyStatus(r, t, n);
@@ -681,4 +725,4 @@ function notifyStatus(e, t, n, r) {
681
725
  });
682
726
  }
683
727
 
684
- export { addPendingSource, clearStatus, forEachDependent, handleAsync, isThenable, notifyStatus, parkLoadingWindow, propagateStatus, releaseFlightTeardown, releaseSettledDependents, setPendingError, settleErroredDependents, settlePendingSource };
728
+ export { addPendingSource, clearStatus, forEachDependent, handleAsync, isThenable, notifyStatus, parkLoadingWindow, propagateStatus, releaseFlightTeardown, releaseIfSettledUnobserved, releaseSettledDependents, setPendingError, settleErroredDependents, settlePendingSource, stageError };