@shadow-js/core 1.0.1 → 1.0.3
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/CHANGELOG.md +23 -0
- package/dist/dev/action.js +11 -7
- package/dist/dev/action.js.map +1 -1
- package/dist/dev/cache.d.ts +2 -1
- package/dist/dev/cache.js +5 -3
- package/dist/dev/cache.js.map +1 -1
- package/dist/dev/effect.js +17 -33
- package/dist/dev/effect.js.map +1 -1
- package/dist/dev/extend/index.d.ts +7 -6
- package/dist/dev/extend/index.js +7 -7
- package/dist/dev/extend/index.js.map +1 -1
- package/dist/dev/external-store.js +8 -3
- package/dist/dev/external-store.js.map +1 -1
- package/dist/dev/internal/concurrency.js +56 -30
- package/dist/dev/internal/concurrency.js.map +1 -1
- package/dist/dev/internal/diagnostics.js +0 -2
- package/dist/dev/internal/diagnostics.js.map +1 -1
- package/dist/dev/internal/dispose.js +1 -1
- package/dist/dev/internal/dispose.js.map +1 -1
- package/dist/dev/internal/flags.js +1 -3
- package/dist/dev/internal/flags.js.map +1 -1
- package/dist/dev/internal/graph.d.ts +1 -2
- package/dist/dev/internal/graph.js +47 -69
- package/dist/dev/internal/graph.js.map +1 -1
- package/dist/dev/internal/owner.d.ts +9 -6
- package/dist/dev/internal/owner.js +22 -30
- package/dist/dev/internal/owner.js.map +1 -1
- package/dist/dev/internal/scheduler.js +44 -73
- package/dist/dev/internal/scheduler.js.map +1 -1
- package/dist/dev/list.js +4 -12
- package/dist/dev/list.js.map +1 -1
- package/dist/dev/memo.d.ts +2 -1
- package/dist/dev/memo.js +4 -4
- package/dist/dev/memo.js.map +1 -1
- package/dist/dev/ownership.d.ts +4 -2
- package/dist/dev/ownership.js +59 -3
- package/dist/dev/ownership.js.map +1 -1
- package/dist/dev/props.js +18 -11
- package/dist/dev/props.js.map +1 -1
- package/dist/dev/reaction.d.ts +1 -1
- package/dist/dev/reaction.js +5 -1
- package/dist/dev/reaction.js.map +1 -1
- package/dist/dev/reducer.js +1 -1
- package/dist/dev/reducer.js.map +1 -1
- package/dist/dev/resource.js +24 -15
- package/dist/dev/resource.js.map +1 -1
- package/dist/dev/selector.js +1 -5
- package/dist/dev/selector.js.map +1 -1
- package/dist/dev/signal.d.ts +3 -2
- package/dist/dev/signal.js +3 -3
- package/dist/dev/signal.js.map +1 -1
- package/dist/dev/store/nodes.js +10 -4
- package/dist/dev/store/nodes.js.map +1 -1
- package/dist/dev/store/use-store.d.ts +5 -0
- package/dist/dev/store/use-store.js.map +1 -1
- package/dist/dev/transitions.js +1 -1
- package/dist/dev/transitions.js.map +1 -1
- package/dist/prod/action.js +1 -1
- package/dist/prod/action.js.map +1 -1
- package/dist/prod/cache.js +1 -1
- package/dist/prod/cache.js.map +1 -1
- package/dist/prod/effect.js +1 -1
- package/dist/prod/effect.js.map +1 -1
- package/dist/prod/extend/index.js +1 -1
- package/dist/prod/extend/index.js.map +1 -1
- package/dist/prod/external-store.js +1 -1
- package/dist/prod/external-store.js.map +1 -1
- package/dist/prod/internal/concurrency.js +1 -1
- package/dist/prod/internal/concurrency.js.map +1 -1
- package/dist/prod/internal/diagnostics.js +1 -1
- package/dist/prod/internal/diagnostics.js.map +1 -1
- package/dist/prod/internal/dispose.js +1 -1
- package/dist/prod/internal/dispose.js.map +1 -1
- package/dist/prod/internal/flags.js +1 -1
- package/dist/prod/internal/flags.js.map +1 -1
- package/dist/prod/internal/graph.js +1 -1
- package/dist/prod/internal/graph.js.map +1 -1
- package/dist/prod/internal/owner.js +1 -1
- package/dist/prod/internal/owner.js.map +1 -1
- package/dist/prod/internal/scheduler.js +1 -1
- package/dist/prod/internal/scheduler.js.map +1 -1
- package/dist/prod/list.js +1 -1
- package/dist/prod/list.js.map +1 -1
- package/dist/prod/memo.js +1 -1
- package/dist/prod/memo.js.map +1 -1
- package/dist/prod/ownership.js +1 -1
- package/dist/prod/ownership.js.map +1 -1
- package/dist/prod/props.js.map +1 -1
- package/dist/prod/reaction.js +1 -1
- package/dist/prod/reaction.js.map +1 -1
- package/dist/prod/reducer.js +1 -1
- package/dist/prod/reducer.js.map +1 -1
- package/dist/prod/resource.js +1 -1
- package/dist/prod/resource.js.map +1 -1
- package/dist/prod/selector.js +1 -1
- package/dist/prod/selector.js.map +1 -1
- package/dist/prod/signal.js +1 -1
- package/dist/prod/signal.js.map +1 -1
- package/dist/prod/store/nodes.js +1 -1
- package/dist/prod/store/nodes.js.map +1 -1
- package/dist/prod/store/use-store.js.map +1 -1
- package/dist/prod/transitions.js +1 -1
- package/dist/prod/transitions.js.map +1 -1
- package/dist/server/action.js +1 -1
- package/dist/server/action.js.map +1 -1
- package/dist/server/cache.js +1 -1
- package/dist/server/cache.js.map +1 -1
- package/dist/server/effect.js.map +1 -1
- package/dist/server/extend/index.js +1 -1
- package/dist/server/extend/index.js.map +1 -1
- package/dist/server/external-store.js.map +1 -1
- package/dist/server/internal/concurrency.js +1 -1
- package/dist/server/internal/concurrency.js.map +1 -1
- package/dist/server/internal/diagnostics.js +1 -1
- package/dist/server/internal/diagnostics.js.map +1 -1
- package/dist/server/internal/dispose.js +1 -1
- package/dist/server/internal/dispose.js.map +1 -1
- package/dist/server/internal/flags.js +1 -1
- package/dist/server/internal/flags.js.map +1 -1
- package/dist/server/internal/graph.js +1 -1
- package/dist/server/internal/graph.js.map +1 -1
- package/dist/server/internal/owner.js +1 -1
- package/dist/server/internal/owner.js.map +1 -1
- package/dist/server/internal/scheduler.js +1 -1
- package/dist/server/internal/scheduler.js.map +1 -1
- package/dist/server/list.js +1 -1
- package/dist/server/list.js.map +1 -1
- package/dist/server/memo.js +1 -1
- package/dist/server/memo.js.map +1 -1
- package/dist/server/ownership.js +1 -1
- package/dist/server/ownership.js.map +1 -1
- package/dist/server/props.js.map +1 -1
- package/dist/server/reaction.js +1 -1
- package/dist/server/reaction.js.map +1 -1
- package/dist/server/reducer.js +1 -1
- package/dist/server/reducer.js.map +1 -1
- package/dist/server/resource.js +1 -1
- package/dist/server/resource.js.map +1 -1
- package/dist/server/selector.js +1 -1
- package/dist/server/selector.js.map +1 -1
- package/dist/server/signal.js +1 -1
- package/dist/server/signal.js.map +1 -1
- package/dist/server/store/nodes.js +1 -1
- package/dist/server/store/nodes.js.map +1 -1
- package/dist/server/store/use-store.js.map +1 -1
- package/dist/server/transitions.js.map +1 -1
- package/dist/server-dev/action.js +11 -7
- package/dist/server-dev/action.js.map +1 -1
- package/dist/server-dev/cache.js +5 -3
- package/dist/server-dev/cache.js.map +1 -1
- package/dist/server-dev/effect.js.map +1 -1
- package/dist/server-dev/extend/index.js +7 -7
- package/dist/server-dev/extend/index.js.map +1 -1
- package/dist/server-dev/external-store.js.map +1 -1
- package/dist/server-dev/internal/concurrency.js +56 -30
- package/dist/server-dev/internal/concurrency.js.map +1 -1
- package/dist/server-dev/internal/diagnostics.js +0 -2
- package/dist/server-dev/internal/diagnostics.js.map +1 -1
- package/dist/server-dev/internal/dispose.js +1 -1
- package/dist/server-dev/internal/dispose.js.map +1 -1
- package/dist/server-dev/internal/flags.js +1 -3
- package/dist/server-dev/internal/flags.js.map +1 -1
- package/dist/server-dev/internal/graph.js +47 -69
- package/dist/server-dev/internal/graph.js.map +1 -1
- package/dist/server-dev/internal/owner.js +22 -30
- package/dist/server-dev/internal/owner.js.map +1 -1
- package/dist/server-dev/internal/scheduler.js +44 -73
- package/dist/server-dev/internal/scheduler.js.map +1 -1
- package/dist/server-dev/list.js +4 -12
- package/dist/server-dev/list.js.map +1 -1
- package/dist/server-dev/memo.js +4 -4
- package/dist/server-dev/memo.js.map +1 -1
- package/dist/server-dev/ownership.js +59 -3
- package/dist/server-dev/ownership.js.map +1 -1
- package/dist/server-dev/props.js +18 -11
- package/dist/server-dev/props.js.map +1 -1
- package/dist/server-dev/reaction.js +5 -1
- package/dist/server-dev/reaction.js.map +1 -1
- package/dist/server-dev/reducer.js +1 -1
- package/dist/server-dev/reducer.js.map +1 -1
- package/dist/server-dev/resource.js +24 -15
- package/dist/server-dev/resource.js.map +1 -1
- package/dist/server-dev/selector.js +1 -5
- package/dist/server-dev/selector.js.map +1 -1
- package/dist/server-dev/signal.js +3 -3
- package/dist/server-dev/signal.js.map +1 -1
- package/dist/server-dev/store/nodes.js +10 -4
- package/dist/server-dev/store/nodes.js.map +1 -1
- package/dist/server-dev/store/use-store.js.map +1 -1
- package/dist/server-dev/transitions.js.map +1 -1
- package/package.json +2 -1
|
@@ -1,7 +1,7 @@
|
|
|
1
1
|
import { DEVTOOLS_EVENT, report } from "./devtools.js";
|
|
2
2
|
import { ShadowError } from "./diagnostics.js";
|
|
3
3
|
import { nextSequence, rt } from "./state.js";
|
|
4
|
-
import { Owner, addCleanup, disposeChildren, handleError, hasErrorHandler } from "./owner.js";
|
|
4
|
+
import { Owner, addCleanup, disposeChildren, finishDisposal, handleError, hasErrorHandler } from "./owner.js";
|
|
5
5
|
import { enqueue } from "./queue.js";
|
|
6
6
|
// src/internal/graph.ts
|
|
7
7
|
const NO_SOURCES = Object.freeze([]);
|
|
@@ -25,23 +25,11 @@ const DEEP_LIMIT = 128;
|
|
|
25
25
|
var Signal = class {
|
|
26
26
|
/** Always 0, the kind of a signal. */
|
|
27
27
|
kind = 0;
|
|
28
|
-
/**
|
|
29
|
-
* The current value. Assigning it directly notifies no one: use `writeSignal`, or call `notify`
|
|
30
|
-
* after the assignment.
|
|
31
|
-
*/
|
|
32
|
-
value;
|
|
33
|
-
/** Decides whether a write is a change; `false` treats every write as one. */
|
|
34
|
-
equals;
|
|
35
28
|
/** The computations that read this signal in their last run, as pairs (see {@link Source.observers}). */
|
|
36
29
|
observers = null;
|
|
37
30
|
/** Stamp of the last computation run that tracked this signal (dedupes repeated reads). */
|
|
38
31
|
stamp = 0;
|
|
39
32
|
/**
|
|
40
|
-
* Label shown by devtools and diagnostics.
|
|
41
|
-
* @default undefined (the signal is unnamed)
|
|
42
|
-
*/
|
|
43
|
-
name;
|
|
44
|
-
/**
|
|
45
33
|
* Creates a signal. Prefer `createSignalNode`, which takes the same arguments.
|
|
46
34
|
* @param value Initial value.
|
|
47
35
|
* @param equals Equality that decides whether a write is a change.
|
|
@@ -70,18 +58,8 @@ var Signal = class {
|
|
|
70
58
|
* @since 1.0.0
|
|
71
59
|
*/
|
|
72
60
|
var Computation = class extends Owner {
|
|
73
|
-
/** 1 for a memo, 2 for an effect. */
|
|
74
|
-
kind;
|
|
75
|
-
/** How stale the node is: 0 (clean), 1 (a transitive source changed), 2 (a direct source changed). */
|
|
76
|
-
state;
|
|
77
|
-
/** Engine bit flags (queued, running, disposed, render phase, ...). Read-only outside the engine. */
|
|
78
|
-
flags;
|
|
79
|
-
/** A memo's last value; an effect's last computed value when it has an `apply` stage. */
|
|
80
|
-
value;
|
|
81
61
|
/** The error a memo's last run threw, rethrown to its readers; undefined when it succeeded. */
|
|
82
62
|
error = void 0;
|
|
83
|
-
/** A memo's equality: readers are notified only when it says the new value differs. */
|
|
84
|
-
equals;
|
|
85
63
|
/** The function each run calls with the previous value; null once disposed. */
|
|
86
64
|
fn;
|
|
87
65
|
/**
|
|
@@ -100,13 +78,6 @@ var Computation = class extends Owner {
|
|
|
100
78
|
stamp = 0;
|
|
101
79
|
/** During a run: how many leading entries of `sources` were confirmed again (they keep their edges). */
|
|
102
80
|
trackIndex = 0;
|
|
103
|
-
/** Creation order; breaks ties between effects at equal depth (G-16). */
|
|
104
|
-
seq;
|
|
105
|
-
/**
|
|
106
|
-
* Label shown by devtools and diagnostics.
|
|
107
|
-
* @default undefined (the computation is unnamed)
|
|
108
|
-
*/
|
|
109
|
-
name;
|
|
110
81
|
/**
|
|
111
82
|
* Creates a computation that has not run yet. Prefer `createComputation`, which also runs or
|
|
112
83
|
* queues it.
|
|
@@ -129,12 +100,9 @@ var Computation = class extends Owner {
|
|
|
129
100
|
this.seq = nextSequence();
|
|
130
101
|
report(DEVTOOLS_EVENT.COMPUTATION_CREATED, this, parent, kind === 1 ? "memo" : "effect", name, (flags & 16) !== 0);
|
|
131
102
|
}
|
|
132
|
-
reportDisposed() {
|
|
133
|
-
report(DEVTOOLS_EVENT.COMPUTATION_DISPOSED, this);
|
|
134
|
-
}
|
|
135
103
|
release() {
|
|
136
104
|
this.flags |= 4;
|
|
137
|
-
|
|
105
|
+
unlinkFrom(this, 0);
|
|
138
106
|
this.fn = null;
|
|
139
107
|
this.apply = null;
|
|
140
108
|
}
|
|
@@ -156,10 +124,6 @@ function removeObserver(source, at) {
|
|
|
156
124
|
}
|
|
157
125
|
observers.length = last;
|
|
158
126
|
}
|
|
159
|
-
/** Drops every edge from `node` to its sources. */
|
|
160
|
-
function unlinkSources(node) {
|
|
161
|
-
unlinkFrom(node, 0);
|
|
162
|
-
}
|
|
163
127
|
/** Drops the edges from `node` to the sources at index `from` of `node.sources` and later, and truncates the list. */
|
|
164
128
|
function unlinkFrom(node, from) {
|
|
165
129
|
const sources = node.sources;
|
|
@@ -323,10 +287,7 @@ function isFrozen(node) {
|
|
|
323
287
|
*/
|
|
324
288
|
function markObservers(source) {
|
|
325
289
|
staleObservers(source.observers, 2);
|
|
326
|
-
while (markStack.length > 0)
|
|
327
|
-
const node = markStack.pop();
|
|
328
|
-
if (node !== void 0) staleObservers(node.observers, 1);
|
|
329
|
-
}
|
|
290
|
+
while (markStack.length > 0) staleObservers(markStack.pop().observers, 1);
|
|
330
291
|
}
|
|
331
292
|
/** Marks every observer in a list of edge pairs stale at the given level. */
|
|
332
293
|
function staleObservers(observers, next) {
|
|
@@ -353,22 +314,18 @@ function updateIfNecessary(root, eagerSources = false) {
|
|
|
353
314
|
while (frameTop > base) {
|
|
354
315
|
const at = frameTop - 1;
|
|
355
316
|
const node = frameNodes[at];
|
|
356
|
-
if (node === void 0) break;
|
|
357
317
|
if (node.state === 1 || node.state === 2 && eagerSources) {
|
|
358
318
|
const sources = node.sources;
|
|
359
|
-
let cursor = frameIndex[at]
|
|
319
|
+
let cursor = frameIndex[at];
|
|
360
320
|
let descended = false;
|
|
361
321
|
while (cursor < sources.length) {
|
|
362
322
|
const source = sources[cursor];
|
|
363
323
|
cursor += 2;
|
|
364
324
|
if (source.kind === 0) continue;
|
|
365
325
|
const dependency = source;
|
|
366
|
-
if (
|
|
367
|
-
if (isFrozen(dependency)) continue;
|
|
326
|
+
if (!needsUpdate(dependency)) continue;
|
|
368
327
|
if ((dependency.flags & 1) !== 0) throw new ShadowError("CYCLE_DETECTED");
|
|
369
|
-
refreshAncestors(dependency);
|
|
370
|
-
if (dependency.state === 0 || (dependency.flags & 4) !== 0) continue;
|
|
371
|
-
if (isFrozen(dependency)) continue;
|
|
328
|
+
if (!refreshAncestors(dependency)) continue;
|
|
372
329
|
frameIndex[at] = cursor;
|
|
373
330
|
frameNodes[frameTop] = dependency;
|
|
374
331
|
frameIndex[frameTop] = 0;
|
|
@@ -385,30 +342,32 @@ function updateIfNecessary(root, eagerSources = false) {
|
|
|
385
342
|
frameTop -= 1;
|
|
386
343
|
}
|
|
387
344
|
} finally {
|
|
388
|
-
for (let i = base; i < frameTop; i += 1)
|
|
389
|
-
const pending = frameNodes[i];
|
|
390
|
-
if (pending !== void 0) pending.flags &= -129;
|
|
391
|
-
}
|
|
345
|
+
for (let i = base; i < frameTop; i += 1) frameNodes[i].flags &= -129;
|
|
392
346
|
frameNodes.length = base;
|
|
393
347
|
frameIndex.length = base;
|
|
394
348
|
frameTop = base;
|
|
395
349
|
}
|
|
396
350
|
}
|
|
351
|
+
/** True when `node` is stale, alive and not frozen: running it now is both possible and needed. */
|
|
352
|
+
function needsUpdate(node) {
|
|
353
|
+
return node.state !== 0 && (node.flags & 4) === 0 && !isFrozen(node);
|
|
354
|
+
}
|
|
397
355
|
/**
|
|
398
356
|
* Brings stale owners of `node` up to date, topmost first. An owner that is about to re-run will
|
|
399
357
|
* dispose `node`; computing `node` first would run it with state that is already out of date
|
|
400
358
|
* (a zombie, G-17). Iterative: the owner chain depth is user controlled.
|
|
359
|
+
*
|
|
360
|
+
* @returns Whether `node` still needs updating afterward (an owner's run may have cleaned or disposed it).
|
|
401
361
|
*/
|
|
402
362
|
function refreshAncestors(node) {
|
|
363
|
+
if (!needsUpdate(node)) return false;
|
|
403
364
|
const stale = [];
|
|
404
|
-
for (let owner = node.parent; owner !== null; owner = owner.parent)
|
|
405
|
-
if (!(owner instanceof Computation)) continue;
|
|
406
|
-
if (owner.state !== 0 && (owner.flags & 133) === 0 && !isFrozen(owner)) stale.push(owner);
|
|
407
|
-
}
|
|
365
|
+
for (let owner = node.parent; owner !== null; owner = owner.parent) if (owner instanceof Computation && owner.state !== 0 && (owner.flags & 129) === 0) stale.push(owner);
|
|
408
366
|
for (let i = stale.length - 1; i >= 0; i -= 1) {
|
|
409
367
|
const ancestor = stale[i];
|
|
410
|
-
if (
|
|
368
|
+
if (needsUpdate(ancestor)) updateIfNecessary(ancestor);
|
|
411
369
|
}
|
|
370
|
+
return needsUpdate(node);
|
|
412
371
|
}
|
|
413
372
|
/**
|
|
414
373
|
* Reads a signal's value, subscribing the running computation to it when one is listening. The
|
|
@@ -431,10 +390,7 @@ function readSignal(signal) {
|
|
|
431
390
|
/** Reads a memo: refreshes it if stale, tracks it, rethrows its stored error. */
|
|
432
391
|
function readMemo(memo) {
|
|
433
392
|
if ((memo.flags & 1) !== 0) throw new ShadowError("CYCLE_DETECTED");
|
|
434
|
-
if (memo.state !== 0 && (memo
|
|
435
|
-
refreshAncestors(memo);
|
|
436
|
-
if ((memo.flags & 4) === 0) updateIfNecessary(memo, rt.recomputeDepth >= DEEP_LIMIT);
|
|
437
|
-
}
|
|
393
|
+
if (memo.state !== 0 && refreshAncestors(memo)) updateIfNecessary(memo, rt.recomputeDepth >= DEEP_LIMIT);
|
|
438
394
|
if (rt.listener !== null) track(memo);
|
|
439
395
|
if ((memo.flags & 8) !== 0) throw memo.error;
|
|
440
396
|
return memo.value;
|
|
@@ -443,8 +399,13 @@ function readMemo(memo) {
|
|
|
443
399
|
function recompute(node) {
|
|
444
400
|
const fn = node.fn;
|
|
445
401
|
if (fn === null) return;
|
|
446
|
-
|
|
447
|
-
|
|
402
|
+
rt.disposing += 1;
|
|
403
|
+
try {
|
|
404
|
+
disposeChildren(node);
|
|
405
|
+
node.runCleanups();
|
|
406
|
+
} finally {
|
|
407
|
+
rt.disposing -= 1;
|
|
408
|
+
}
|
|
448
409
|
node.trackIndex = 0;
|
|
449
410
|
node.errorHandlers = null;
|
|
450
411
|
node.idCount = 0;
|
|
@@ -474,11 +435,28 @@ function recompute(node) {
|
|
|
474
435
|
rt.running = previousRunning;
|
|
475
436
|
rt.recomputeDepth -= 1;
|
|
476
437
|
node.flags &= -2;
|
|
477
|
-
|
|
438
|
+
unlinkFrom(node, (node.flags & 4) !== 0 ? 0 : node.trackIndex);
|
|
478
439
|
}
|
|
479
|
-
|
|
480
|
-
if (node.kind
|
|
440
|
+
let changed = true;
|
|
441
|
+
if (node.kind === 1) changed = settleMemo(node, result, failed, failure);
|
|
442
|
+
else settleEffect(node, result, failed, failure);
|
|
481
443
|
report(DEVTOOLS_EVENT.COMPUTATION_RUN, node, startedAt, performance.now() - startedAt, changed, sourcesOf(node));
|
|
444
|
+
rt.disposing += 1;
|
|
445
|
+
finishDisposal();
|
|
446
|
+
}
|
|
447
|
+
/**
|
|
448
|
+
* Calls a comparator untracked. It is a user callback: left tracked, the computation that writes (or the
|
|
449
|
+
* reader that pulled the memo, the listener again once the run is over) would subscribe to whatever it
|
|
450
|
+
* reads. Restored in `finally`, so a throwing comparator leaves the register as it found it.
|
|
451
|
+
*/
|
|
452
|
+
function isEqual(equals, prev, next) {
|
|
453
|
+
const listener = rt.listener;
|
|
454
|
+
rt.listener = null;
|
|
455
|
+
try {
|
|
456
|
+
return equals(prev, next);
|
|
457
|
+
} finally {
|
|
458
|
+
rt.listener = listener;
|
|
459
|
+
}
|
|
482
460
|
}
|
|
483
461
|
/** Stores a memo's result; says whether its value changed (observers were told). */
|
|
484
462
|
function settleMemo(node, result, failed, failure) {
|
|
@@ -497,7 +475,7 @@ function settleMemo(node, result, failed, failure) {
|
|
|
497
475
|
node.error = void 0;
|
|
498
476
|
const equals = node.equals;
|
|
499
477
|
try {
|
|
500
|
-
changed = first || hadError || equals === false || !equals
|
|
478
|
+
changed = first || hadError || equals === false || !isEqual(equals, node.value, result);
|
|
501
479
|
if (changed) node.value = result;
|
|
502
480
|
} catch (comparatorError) {
|
|
503
481
|
node.flags |= 8;
|
|
@@ -572,6 +550,6 @@ function settleEffect(node, result, failed, failure) {
|
|
|
572
550
|
if ((node.flags & 4) !== 0) node.runCleanups();
|
|
573
551
|
}
|
|
574
552
|
}
|
|
575
|
-
export { Computation, Signal, hasObservers, isFrozen, markObservers, observersOf, readMemo, readSignal, recompute, sourcesOf, track,
|
|
553
|
+
export { Computation, Signal, hasObservers, isEqual, isFrozen, markObservers, observersOf, readMemo, readSignal, recompute, refreshAncestors, sourcesOf, track, updateIfNecessary };
|
|
576
554
|
|
|
577
555
|
//# sourceMappingURL=graph.js.map
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"graph.js","names":[],"sources":["../../../src/internal/graph.ts"],"sourcesContent":["import { DEVTOOLS_EVENT, report } from \"./devtools\";\nimport { ShadowError } from \"./diagnostics\";\nimport {\n CHECK,\n CLEAN,\n DIRTY,\n FLAG_DEFER,\n FLAG_DISPOSED,\n FLAG_HAS_ERROR,\n FLAG_REFRESHING,\n FLAG_RENDER,\n FLAG_RUNNING,\n FLAG_UNINIT,\n KIND_EFFECT,\n KIND_MEMO,\n KIND_SIGNAL,\n} from \"./flags\";\nimport { addCleanup, disposeChildren, handleError, hasErrorHandler, Owner } from \"./owner\";\nimport { enqueue } from \"./queue\";\nimport { nextSequence, rt } from \"./state\";\nimport type { Cleanup, Equals } from \"./types\";\n\n// Shared and frozen until a computation reads its first source: most effects and memos in a large\n// tree own few edges, and an empty array per node dominates creation cost.\nconst NO_SOURCES: Edges<Source> = Object.freeze([]) as unknown as Edges<Source>;\n\n/** Memo nesting depth after which pulls switch from recursion to the iterative walk. */\nconst DEEP_LIMIT = 128;\n\n/**\n * Anything that can be read reactively and notify observers: a signal, a memo, or a custom source\n * of a primitive. Exported from `@shadow-js/core/extend` as `SourceNode`. Read one with\n * {@link track}; after changing it, call {@link markObservers} and `schedule` (or `notify`).\n * @since 1.0.0\n */\nexport interface Source {\n /**\n * The node kind: 0 for a signal and for any custom source, which have no sources of their own; a\n * computation has its own kind. A refresh walks only the sources whose kind is not 0.\n */\n readonly kind: number;\n /** The current value. */\n value: unknown;\n /**\n * The computations that read this source in their last run, as pairs: an observer, then the index of this source in\n * that observer's `sources`. Null or empty when none. Read it with `observersOf`, which returns the observers alone.\n */\n observers: Edges<Computation> | null;\n /** Stamp of the last computation run that tracked this source (dedupes repeated reads). */\n stamp: number;\n}\n\n/**\n * The edges of one node, stored as pairs in one array: the node on the other side of the edge, then the index of this\n * node's entry in that node's own edge array. One array per side costs half the memory of two parallel ones, and\n * removing an edge stays O(1): the last pair moves into the vacated place and tells its owner where it went.\n */\nexport type Edges<T> = Array<T | number>;\n\n/**\n * The storage of a signal: its value, its equality and the computations that read it. Exported from\n * `@shadow-js/core/extend` as `SignalNode`; create one with `createSignalNode`, read it with\n * {@link readSignal} and write it with `writeSignal`, which notifies its readers. Build a custom\n * primitive on it the way `useSignal` does.\n *\n * @example\n * import { createSignalNode, readSignal, SignalNode, writeSignal } from \"@shadow-js/core/extend\";\n *\n * const count = createSignalNode<number>(0, Object.is, \"count\");\n * writeSignal(count, 1);\n * console.log(readSignal(count), count instanceof SignalNode); // 1 true\n * @see createSignalNode\n * @since 1.0.0\n */\nexport class Signal<T = unknown> implements Source {\n /** Always 0, the kind of a signal. */\n readonly kind: number = KIND_SIGNAL;\n /**\n * The current value. Assigning it directly notifies no one: use `writeSignal`, or call `notify`\n * after the assignment.\n */\n value: T;\n /** Decides whether a write is a change; `false` treats every write as one. */\n equals: Equals<T>;\n /** The computations that read this signal in their last run, as pairs (see {@link Source.observers}). */\n observers: Edges<Computation> | null = null;\n /** Stamp of the last computation run that tracked this signal (dedupes repeated reads). */\n stamp = 0;\n /**\n * Label shown by devtools and diagnostics.\n * @default undefined (the signal is unnamed)\n */\n name: string | undefined;\n\n /**\n * Creates a signal. Prefer `createSignalNode`, which takes the same arguments.\n * @param value Initial value.\n * @param equals Equality that decides whether a write is a change.\n * @param name Devtools label, or undefined for an unnamed signal.\n */\n constructor(value: T, equals: Equals<T>, name: string | undefined) {\n this.value = value;\n this.equals = equals;\n this.name = name;\n if (__DEV__) report(DEVTOOLS_EVENT.SIGNAL_CREATED, this, rt.owner, name, value);\n }\n}\n\n/**\n * A memo or an effect: an owner that reads sources and (for memos) is itself a source. Exported from\n * `@shadow-js/core/extend` as `ComputationNode`; create one with `createComputation` and read a memo\n * with `readComputation`. It owns what its function creates: each run first disposes the children\n * and runs the cleanups of the previous run.\n *\n * @example\n * import { createComputation, createSignalNode, readComputation, readSignal } from \"@shadow-js/core/extend\";\n *\n * const price = createSignalNode(10, Object.is);\n * const total = createComputation({ kind: \"memo\", fn: () => readSignal(price) * 2 });\n * console.log(readComputation<number>(total)); // 20\n * @see createComputation\n * @since 1.0.0\n */\nexport class Computation extends Owner implements Source {\n /** 1 for a memo, 2 for an effect. */\n kind: number;\n /** How stale the node is: 0 (clean), 1 (a transitive source changed), 2 (a direct source changed). */\n state: number;\n /** Engine bit flags (queued, running, disposed, render phase, ...). Read-only outside the engine. */\n flags: number;\n /** A memo's last value; an effect's last computed value when it has an `apply` stage. */\n value: unknown;\n /** The error a memo's last run threw, rethrown to its readers; undefined when it succeeded. */\n error: unknown = undefined;\n /** A memo's equality: readers are notified only when it says the new value differs. */\n equals: Equals<unknown>;\n /** The function each run calls with the previous value; null once disposed. */\n fn: ((previous: never) => unknown) | null;\n /**\n * An effect's second stage, run untracked with the computed value and the previous one; null for\n * none and once disposed.\n */\n apply: ((value: never, previous: never) => unknown) | null = null;\n /**\n * The sources the last run read, in reading order, as pairs: a source, then the index of this computation in that\n * source's `observers`. Read it with `sourcesOf`, which returns the sources alone.\n */\n sources: Edges<Source> = NO_SOURCES;\n /** The computations that read this memo in their last run, as pairs (see {@link Source.observers}). */\n observers: Edges<Computation> | null = null;\n /** Stamp of the current run while it tracks, and of the last run that tracked this memo. */\n stamp = 0;\n /** During a run: how many leading entries of `sources` were confirmed again (they keep their edges). */\n trackIndex = 0;\n /** Creation order; breaks ties between effects at equal depth (G-16). */\n seq: number;\n /**\n * Label shown by devtools and diagnostics.\n * @default undefined (the computation is unnamed)\n */\n name: string | undefined;\n\n /**\n * Creates a computation that has not run yet. Prefer `createComputation`, which also runs or\n * queues it.\n * @param parent The owner to attach to, or null.\n * @param kind 1 for a memo, 2 for an effect.\n * @param flags Initial engine bit flags.\n * @param fn The function each run calls.\n * @param equals A memo's equality; `false` for an effect.\n * @param name Devtools label, or undefined.\n */\n constructor(\n parent: Owner | null,\n kind: number,\n flags: number,\n fn: (previous: never) => unknown,\n equals: Equals<unknown>,\n name: string | undefined,\n ) {\n super(parent);\n this.kind = kind;\n this.flags = flags;\n this.state = DIRTY;\n this.fn = fn;\n this.equals = equals;\n this.name = name;\n this.value = undefined;\n this.seq = nextSequence();\n if (__DEV__) {\n report(\n DEVTOOLS_EVENT.COMPUTATION_CREATED,\n this,\n parent,\n kind === KIND_MEMO ? \"memo\" : \"effect\",\n name,\n (flags & FLAG_RENDER) !== 0,\n );\n }\n }\n\n protected override reportDisposed(): void {\n if (__DEV__) report(DEVTOOLS_EVENT.COMPUTATION_DISPOSED, this);\n }\n\n protected override release(): void {\n this.flags |= FLAG_DISPOSED;\n unlinkSources(this);\n this.fn = null;\n this.apply = null;\n }\n}\n\n/**\n * Removes the pair at `at` from `source.observers` in O(1): the last pair moves into its place, and its observer is told\n * where it went.\n */\nfunction removeObserver(source: Source, at: number): void {\n const observers = source.observers;\n if (observers === null) return;\n const last = observers.length - 2;\n if (at !== last) {\n const moved = observers[last] as Computation;\n const movedAt = observers[last + 1] as number;\n observers[at] = moved;\n observers[at + 1] = movedAt;\n moved.sources[movedAt + 1] = at;\n }\n observers.length = last;\n}\n\n/** Drops every edge from `node` to its sources. */\nexport function unlinkSources(node: Computation): void {\n unlinkFrom(node, 0);\n}\n\n/** Drops the edges from `node` to the sources at index `from` of `node.sources` and later, and truncates the list. */\nfunction unlinkFrom(node: Computation, from: number): void {\n const sources = node.sources;\n if (sources.length <= from) return;\n for (let i = sources.length - 2; i >= from; i -= 2) {\n // The index in the source is read each time: removing an edge may move this node's pair in another source.\n removeObserver(sources[i] as Source, sources[i + 1] as number);\n }\n sources.length = from;\n}\n\n/**\n * The array with the pair `first`, `second` appended: a new array of exactly the right size while short (`new Array(n)`\n * allocates the backing store at that size, where `push` on a short array reserves room for sixteen), the same array\n * grown by `push` from sixteen entries on.\n */\nfunction withEdge<T>(array: Array<T | number>, first: T, second: number): Array<T | number> {\n const length = array.length;\n if (length >= 16) {\n array.push(first, second);\n return array;\n }\n const next = new Array<T | number>(length + 2);\n for (let i = 0; i < length; i += 1) next[i] = array[i] as T | number;\n next[length] = first;\n next[length + 1] = second;\n return next;\n}\n\n/**\n * Records that the running computation read `source`, so a later {@link markObservers} on it marks\n * that computation stale. Call it in the reader of a custom source; {@link readSignal} does it for\n * signals. Does nothing when untracked, and a source read again in the same run is recorded once.\n *\n * @param source The source that was read.\n * @example\n * import { markObservers, schedule, type SourceNode, track } from \"@shadow-js/core/extend\";\n *\n * const clock: SourceNode = { kind: 0, value: Date.now(), observers: null, stamp: 0 };\n * export function now(): number {\n * track(clock);\n * return clock.value as number;\n * }\n * setInterval(() => {\n * clock.value = Date.now();\n * markObservers(clock);\n * schedule();\n * }, 1000);\n * @see readSignal\n * @since 1.0.0\n */\nexport function track(source: Source): void {\n const listener = rt.listener;\n if (listener === null) return;\n if (source.stamp === listener.stamp) return;\n source.stamp = listener.stamp;\n // Same dependency at the same position as last run: keep the edge, touch nothing.\n const position = listener.trackIndex;\n if (position < listener.sources.length) {\n if (listener.sources[position] === source) {\n listener.trackIndex = position + 2;\n return;\n }\n unlinkFrom(listener, position);\n }\n // Edge arrays are small: most nodes have one to three edges. `push` on a short array reserves room for about sixteen\n // entries (200 bytes where an exact array takes 64, measured), and a large list pays it for every row. A short array\n // therefore grows into a new exact one; from sixteen entries on `push` amortizes. Nothing iterates an edge array of\n // a node while it tracks, so replacing the array is safe.\n const observers = source.observers;\n const sources = listener.sources;\n const at = observers === null ? 0 : observers.length;\n const index = sources.length;\n source.observers =\n observers === null\n ? [listener, index]\n : (withEdge(observers, listener, index) as Edges<Computation>);\n listener.sources = withEdge(sources, source, at) as Edges<Source>;\n listener.trackIndex = index + 2;\n}\n\n/**\n * The sources the last run of a computation read, in reading order. Use it to inspect the graph (a debugger, a test);\n * it is a snapshot, so changing the returned array changes no edge.\n *\n * @param node The memo or effect.\n * @returns The signals and memos it reads now.\n * @example\n * import { createComputation, createSignalNode, flushSync, readSignal, sourcesOf } from \"@shadow-js/core/extend\";\n *\n * const count = createSignalNode<number>(1, Object.is, \"count\");\n * const effect = createComputation({ kind: \"effect\", fn: () => void readSignal(count) });\n * flushSync();\n * console.log(sourcesOf(effect).length); // 1\n * @see observersOf\n * @since 1.0.0\n */\nexport function sourcesOf(node: Computation): Source[] {\n return everyOther(node.sources) as Source[];\n}\n\n/**\n * The computations that read a signal or memo in their last run, in the order their edges were made. It is a snapshot,\n * so changing the returned array changes no edge. The node's own `observers` array stores pairs (the observer and an\n * index for the engine), so read it through this function.\n *\n * @param source A signal, a memo or a custom source.\n * @returns The memos and effects that read it now.\n * @example\n * import { createComputation, createSignalNode, flushSync, observersOf, readSignal } from \"@shadow-js/core/extend\";\n *\n * const count = createSignalNode<number>(1, Object.is, \"count\");\n * createComputation({ kind: \"effect\", fn: () => void readSignal(count) });\n * flushSync();\n * console.log(observersOf(count).length); // 1\n * @see sourcesOf\n * @since 1.0.0\n */\nexport function observersOf(source: Source): Computation[] {\n return source.observers === null ? [] : (everyOther(source.observers) as Computation[]);\n}\n\n/** True when at least one computation read `source` in its last run. */\nexport function hasObservers(source: Source): boolean {\n return source.observers !== null && source.observers.length > 0;\n}\n\n/** The first element of every pair of an edge array. */\nfunction everyOther<T>(edges: Edges<T>): T[] {\n const out: T[] = [];\n for (let i = 0; i < edges.length; i += 2) out.push(edges[i] as T);\n return out;\n}\n\n// Scratch stack for markObservers; never holds data across calls.\nconst markStack: Computation[] = [];\n\nfunction stale(observer: Computation, next: number): void {\n const previous = observer.state;\n if (observer.kind === KIND_EFFECT) {\n if (previous < next) observer.state = next;\n if (previous === CLEAN) enqueue(observer);\n else if (!rt.inTransition) rt.hooks?.promote(observer);\n return;\n }\n if (previous >= next) return;\n observer.state = next;\n if (previous !== CLEAN) return;\n if (observer.observers !== null && observer.observers.length > 0) markStack.push(observer);\n}\n\n/**\n * A suspension (a transition read pending data inside a held boundary) keeps the node's value until the\n * boundary releases it. True when `error` was one, and the node was recorded for that wake-up.\n */\nfunction trySuspend(node: Computation, error: unknown): boolean {\n return rt.hooks?.suspend(node, error) === true;\n}\n\n/**\n * A memo or effect frozen by a pause keeps its last value and does not refresh until it resumes.\n * A memo that never computed is not frozen (it has no value to keep).\n */\nexport function isFrozen(node: Computation): boolean {\n return node.pauses > 0 && (node.flags & FLAG_UNINIT) === 0;\n}\n\n/**\n * Marks the direct observers of a changed source DIRTY and everything downstream CHECK, and queues\n * the effects it reaches. It does not request a flush: call `schedule` afterward, or use `notify`,\n * which does both. Iterative: the graph can be 100,000 nodes deep (G-10).\n *\n * @param source The source whose value changed.\n * @example\n * import { markObservers, schedule, type SignalNode } from \"@shadow-js/core/extend\";\n *\n * export function push(list: SignalNode<string[]>, item: string): void {\n * list.value.push(item); // same array: writeSignal would see no change\n * markObservers(list);\n * schedule();\n * }\n * @see track\n * @since 1.0.0\n */\nexport function markObservers(source: Source): void {\n staleObservers(source.observers, DIRTY);\n while (markStack.length > 0) {\n const node = markStack.pop();\n if (node !== undefined) staleObservers(node.observers, CHECK);\n }\n}\n\n/** Marks every observer in a list of edge pairs stale at the given level. */\nfunction staleObservers(observers: Edges<Computation> | null, next: number): void {\n if (observers === null) return;\n for (let i = 0; i < observers.length; i += 2) stale(observers[i] as Computation, next);\n}\n\n// Scratch frames for updateIfNecessary; entries above `frameTop` are dead.\nconst frameNodes: Computation[] = [];\nconst frameIndex: number[] = [];\nlet frameTop = 0;\n\n/**\n * Brings `root` up to date: verifies stale sources oldest-first and recomputes only nodes whose\n * sources really changed (equality cut-off, G-2). Iterative so deep chains cannot overflow (G-10).\n * With `eagerSources`, DIRTY nodes also refresh their previous sources first, which keeps the\n * native stack flat for chains where every node reads both a fresh signal and its predecessor.\n */\nexport function updateIfNecessary(root: Computation, eagerSources = false): void {\n if (root.state === CLEAN) return;\n const base = frameTop;\n frameNodes[frameTop] = root;\n frameIndex[frameTop] = 0;\n frameTop += 1;\n root.flags |= FLAG_REFRESHING;\n try {\n while (frameTop > base) {\n const at = frameTop - 1;\n const node = frameNodes[at];\n if (node === undefined) break;\n if (node.state === CHECK || (node.state === DIRTY && eagerSources)) {\n const sources = node.sources;\n let cursor = frameIndex[at] ?? 0;\n let descended = false;\n while (cursor < sources.length) {\n const source = sources[cursor] as Source;\n cursor += 2;\n if (source.kind === KIND_SIGNAL) continue;\n const dependency = source as Computation;\n if (dependency.state === CLEAN || (dependency.flags & FLAG_DISPOSED) !== 0) continue;\n if (isFrozen(dependency)) continue;\n if ((dependency.flags & FLAG_RUNNING) !== 0) throw new ShadowError(\"CYCLE_DETECTED\");\n // An owner that is about to re-run would dispose this dependency: update it first.\n refreshAncestors(dependency);\n if (dependency.state === CLEAN || (dependency.flags & FLAG_DISPOSED) !== 0) continue;\n if (isFrozen(dependency)) continue;\n frameIndex[at] = cursor;\n frameNodes[frameTop] = dependency;\n frameIndex[frameTop] = 0;\n frameTop += 1;\n dependency.flags |= FLAG_REFRESHING;\n descended = true;\n break;\n }\n if (descended) continue;\n }\n if (node.state === DIRTY) recompute(node);\n else node.state = CLEAN;\n node.flags &= ~FLAG_REFRESHING;\n frameTop -= 1;\n }\n } finally {\n // An exception leaves frames on the stack: they must not stay marked as being refreshed.\n for (let i = base; i < frameTop; i += 1) {\n const pending = frameNodes[i];\n if (pending !== undefined) pending.flags &= ~FLAG_REFRESHING;\n }\n frameNodes.length = base;\n frameIndex.length = base;\n frameTop = base;\n }\n}\n\n/**\n * Brings stale owners of `node` up to date, topmost first. An owner that is about to re-run will\n * dispose `node`; computing `node` first would run it with state that is already out of date\n * (a zombie, G-17). Iterative: the owner chain depth is user controlled.\n */\nfunction refreshAncestors(node: Computation): void {\n const stale: Computation[] = [];\n for (let owner = node.parent; owner !== null; owner = owner.parent) {\n if (!(owner instanceof Computation)) continue;\n if (\n owner.state !== CLEAN &&\n (owner.flags & (FLAG_RUNNING | FLAG_DISPOSED | FLAG_REFRESHING)) === 0 &&\n !isFrozen(owner)\n ) {\n stale.push(owner);\n }\n }\n for (let i = stale.length - 1; i >= 0; i -= 1) {\n const ancestor = stale[i];\n if (ancestor !== undefined && (ancestor.flags & FLAG_DISPOSED) === 0) {\n updateIfNecessary(ancestor);\n }\n }\n}\n\n/**\n * Reads a signal's value, subscribing the running computation to it when one is listening. The\n * reader of a custom primitive built on `createSignalNode`.\n *\n * @param signal The signal to read.\n * @returns The current value.\n * @example\n * import { createSignalNode, readSignal } from \"@shadow-js/core/extend\";\n *\n * const name = createSignalNode(\"Ada\", Object.is);\n * export const getName = (): string => readSignal(name);\n * @see track\n * @since 1.0.0\n */\nexport function readSignal<T>(signal: Signal<T>): T {\n if (rt.listener !== null) track(signal);\n return signal.value;\n}\n\n/** Reads a memo: refreshes it if stale, tracks it, rethrows its stored error. */\nexport function readMemo<T>(memo: Computation): T {\n if ((memo.flags & FLAG_RUNNING) !== 0) throw new ShadowError(\"CYCLE_DETECTED\");\n if (memo.state !== CLEAN && (memo.flags & FLAG_DISPOSED) === 0 && !isFrozen(memo)) {\n refreshAncestors(memo);\n if ((memo.flags & FLAG_DISPOSED) === 0) {\n updateIfNecessary(memo, rt.recomputeDepth >= DEEP_LIMIT);\n }\n }\n if (rt.listener !== null) track(memo);\n if ((memo.flags & FLAG_HAS_ERROR) !== 0) throw memo.error;\n return memo.value as T;\n}\n\n/** Re-runs a memo or effect: disposes the previous run, re-tracks sources, stores the result. */\nexport function recompute(node: Computation): void {\n const fn = node.fn;\n if (fn === null) return;\n disposeChildren(node);\n node.runCleanups();\n // Edges are kept and re-confirmed in order while the function runs (see track()).\n node.trackIndex = 0;\n // Each run starts from a clean slate: handlers, ids and child indices belong to one run.\n node.errorHandlers = null;\n node.idCount = 0;\n node.childCount = 0;\n\n const previousOwner = rt.owner;\n const previousListener = rt.listener;\n const previousRunning = rt.running;\n rt.owner = node;\n rt.listener = node;\n rt.running = node;\n rt.recomputeDepth += 1;\n node.state = CLEAN;\n node.flags |= FLAG_RUNNING;\n node.stamp = nextSequence();\n\n let result: unknown;\n let failed = false;\n let failure: unknown;\n const startedAt = __DEV__ ? performance.now() : 0;\n try {\n result = (fn as (previous: unknown) => unknown)(node.value);\n } catch (error) {\n failed = true;\n failure = error;\n } finally {\n rt.owner = previousOwner;\n rt.listener = previousListener;\n rt.running = previousRunning;\n rt.recomputeDepth -= 1;\n node.flags &= ~FLAG_RUNNING;\n // Sources this run did not read again are no longer dependencies.\n if (node.trackIndex < node.sources.length) unlinkFrom(node, node.trackIndex);\n }\n\n const changed = node.kind === KIND_MEMO ? settleMemo(node, result, failed, failure) : true;\n if (node.kind !== KIND_MEMO) settleEffect(node, result, failed, failure);\n if (__DEV__) {\n report(\n DEVTOOLS_EVENT.COMPUTATION_RUN,\n node,\n startedAt,\n performance.now() - startedAt,\n changed,\n sourcesOf(node),\n );\n }\n}\n\n/** Stores a memo's result; says whether its value changed (observers were told). */\nfunction settleMemo(\n node: Computation,\n result: unknown,\n failed: boolean,\n failure: unknown,\n): boolean {\n // A suspended memo keeps its previous value: its readers see nothing change until it resumes.\n if (failed && trySuspend(node, failure)) return false;\n const first = (node.flags & FLAG_UNINIT) !== 0;\n node.flags &= ~FLAG_UNINIT;\n const hadError = (node.flags & FLAG_HAS_ERROR) !== 0;\n let changed: boolean;\n if (failed && routeToHandler(node, failure)) {\n return false;\n }\n if (failed) {\n node.flags |= FLAG_HAS_ERROR;\n node.error = failure;\n changed = true;\n } else {\n node.flags &= ~FLAG_HAS_ERROR;\n node.error = undefined;\n const equals = node.equals;\n try {\n changed = first || hadError || equals === false || !equals(node.value, result);\n if (changed) node.value = result;\n } catch (comparatorError) {\n // A throwing comparator is a failing memo, not a wedged graph: readers see the error.\n node.flags |= FLAG_HAS_ERROR;\n node.error = comparatorError;\n changed = true;\n }\n }\n if (!changed || first) return changed;\n const observers = node.observers;\n if (observers === null) return changed;\n for (let i = 0; i < observers.length; i += 2) {\n const observer = observers[i] as Computation;\n if (observer.state === CHECK) observer.state = DIRTY;\n }\n return changed;\n}\n\n/**\n * A memo that fails inside a boundary (an ancestor registered catchError()/onError()) reports to it\n * when it fails, and keeps its previous value. Readers then see that value instead of the error:\n * the reader may live outside the boundary (the DOM region that displays the memo's result), where a\n * rethrown error would escape the very boundary meant to catch it. Without a handler the error is\n * stored and rethrown to readers, so it is never silent.\n *\n * The first computation counts too: its value is `undefined`, and it is typically read by a\n * consumer outside the boundary (a DOM region), not by the code that created it.\n */\nfunction routeToHandler(node: Computation, failure: unknown): boolean {\n if (!hasErrorHandler(node)) return false;\n node.flags &= ~FLAG_HAS_ERROR;\n node.error = undefined;\n try {\n handleError(failure, node);\n } catch (unhandled) {\n // The chain ended in a handler that rethrew: readers see it, as for any unhandled failure.\n node.flags |= FLAG_HAS_ERROR;\n node.error = unhandled;\n }\n return true;\n}\n\nfunction settleEffect(node: Computation, result: unknown, failed: boolean, failure: unknown): void {\n if (failed) {\n if (!trySuspend(node, failure)) handleError(failure, node);\n return;\n }\n const apply = node.apply;\n let cleanup: unknown;\n if (apply === null) {\n cleanup = result;\n } else {\n const deferred = (node.flags & FLAG_DEFER) !== 0;\n node.flags &= ~FLAG_DEFER;\n const previousValue = node.value;\n node.value = result;\n if (deferred) return;\n const previousOwner = rt.owner;\n const previousListener = rt.listener;\n const previousRunning = rt.running;\n rt.owner = node;\n rt.listener = null;\n // Writes from an effect's apply are legal even when the effect was created inside a memo.\n rt.running = node;\n try {\n cleanup = (apply as (value: unknown, previous: unknown) => unknown)(result, previousValue);\n } catch (error) {\n if (!trySuspend(node, error)) handleError(error, node);\n return;\n } finally {\n rt.owner = previousOwner;\n rt.listener = previousListener;\n rt.running = previousRunning;\n }\n }\n if (typeof cleanup === \"function\") {\n addCleanup(node, cleanup as Cleanup);\n // The effect disposed its own owner while running: nothing will dispose it again, so run now.\n if ((node.flags & FLAG_DISPOSED) !== 0) node.runCleanups();\n }\n}\n"],"mappings":";;;;;;AAwBA,MAAM,aAA4B,OAAO,OAAO,CAAC,CAAC;;AAGlD,MAAM,aAAa;;;;;;;;;;;;;;;;AA+CnB,IAAa,SAAb,MAAmD;;CAEjD,OAAS;;;;;CAKT;;CAEA;;CAEA,YAAuC;;CAEvC,QAAQ;;;;;CAKR;;;;;;;CAQA,YAAY,OAAU,QAAmB,MAA0B;EACjE,KAAK,QAAQ;EACb,KAAK,SAAS;EACd,KAAK,OAAO;EACC,OAAO,eAAe,gBAAgB,MAAM,GAAG,OAAO,MAAM,KAAK;CAChF;AACF;;;;;;;;;;;;;;;;AAiBA,IAAa,cAAb,cAAiC,MAAwB;;CAEvD;;CAEA;;CAEA;;CAEA;;CAEA,QAAiB,KAAA;;CAEjB;;CAEA;;;;;CAKA,QAA6D;;;;;CAK7D,UAAyB;;CAEzB,YAAuC;;CAEvC,QAAQ;;CAER,aAAa;;CAEb;;;;;CAKA;;;;;;;;;;;CAYA,YACE,QACA,MACA,OACA,IACA,QACA,MACA;EACA,MAAM,MAAM;EACZ,KAAK,OAAO;EACZ,KAAK,QAAQ;EACb,KAAK,QAAA;EACL,KAAK,KAAK;EACV,KAAK,SAAS;EACd,KAAK,OAAO;EACZ,KAAK,QAAQ,KAAA;EACb,KAAK,MAAM,aAAa;EAEtB,OACE,eAAe,qBACf,MACA,QACA,SAAA,IAAqB,SAAS,UAC9B,OACC,QAAA,QAAyB,CAC5B;CAEJ;CAEA,iBAA0C;EAC3B,OAAO,eAAe,sBAAsB,IAAI;CAC/D;CAEA,UAAmC;EACjC,KAAK,SAAA;EACL,cAAc,IAAI;EAClB,KAAK,KAAK;EACV,KAAK,QAAQ;CACf;AACF;;;;;AAMA,SAAS,eAAe,QAAgB,IAAkB;CACxD,MAAM,YAAY,OAAO;CACzB,IAAI,cAAc,MAAM;CACxB,MAAM,OAAO,UAAU,SAAS;CAChC,IAAI,OAAO,MAAM;EACf,MAAM,QAAQ,UAAU;EACxB,MAAM,UAAU,UAAU,OAAO;EACjC,UAAU,MAAM;EAChB,UAAU,KAAK,KAAK;EACpB,MAAM,QAAQ,UAAU,KAAK;CAC/B;CACA,UAAU,SAAS;AACrB;;AAGA,SAAgB,cAAc,MAAyB;CACrD,WAAW,MAAM,CAAC;AACpB;;AAGA,SAAS,WAAW,MAAmB,MAAoB;CACzD,MAAM,UAAU,KAAK;CACrB,IAAI,QAAQ,UAAU,MAAM;CAC5B,KAAK,IAAI,IAAI,QAAQ,SAAS,GAAG,KAAK,MAAM,KAAK,GAE/C,eAAe,QAAQ,IAAc,QAAQ,IAAI,EAAY;CAE/D,QAAQ,SAAS;AACnB;;;;;;AAOA,SAAS,SAAY,OAA0B,OAAU,QAAmC;CAC1F,MAAM,SAAS,MAAM;CACrB,IAAI,UAAU,IAAI;EAChB,MAAM,KAAK,OAAO,MAAM;EACxB,OAAO;CACT;CACA,MAAM,OAAO,IAAI,MAAkB,SAAS,CAAC;CAC7C,KAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,KAAK,GAAG,KAAK,KAAK,MAAM;CACpD,KAAK,UAAU;CACf,KAAK,SAAS,KAAK;CACnB,OAAO;AACT;;;;;;;;;;;;;;;;;;;;;;;AAwBA,SAAgB,MAAM,QAAsB;CAC1C,MAAM,WAAW,GAAG;CACpB,IAAI,aAAa,MAAM;CACvB,IAAI,OAAO,UAAU,SAAS,OAAO;CACrC,OAAO,QAAQ,SAAS;CAExB,MAAM,WAAW,SAAS;CAC1B,IAAI,WAAW,SAAS,QAAQ,QAAQ;EACtC,IAAI,SAAS,QAAQ,cAAc,QAAQ;GACzC,SAAS,aAAa,WAAW;GACjC;EACF;EACA,WAAW,UAAU,QAAQ;CAC/B;CAKA,MAAM,YAAY,OAAO;CACzB,MAAM,UAAU,SAAS;CACzB,MAAM,KAAK,cAAc,OAAO,IAAI,UAAU;CAC9C,MAAM,QAAQ,QAAQ;CACtB,OAAO,YACL,cAAc,OACV,CAAC,UAAU,KAAK,IACf,SAAS,WAAW,UAAU,KAAK;CAC1C,SAAS,UAAU,SAAS,SAAS,QAAQ,EAAE;CAC/C,SAAS,aAAa,QAAQ;AAChC;;;;;;;;;;;;;;;;;AAkBA,SAAgB,UAAU,MAA6B;CACrD,OAAO,WAAW,KAAK,OAAO;AAChC;;;;;;;;;;;;;;;;;;AAmBA,SAAgB,YAAY,QAA+B;CACzD,OAAO,OAAO,cAAc,OAAO,CAAC,IAAK,WAAW,OAAO,SAAS;AACtE;;AAGA,SAAgB,aAAa,QAAyB;CACpD,OAAO,OAAO,cAAc,QAAQ,OAAO,UAAU,SAAS;AAChE;;AAGA,SAAS,WAAc,OAAsB;CAC3C,MAAM,MAAW,CAAC;CAClB,KAAK,IAAI,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK,GAAG,IAAI,KAAK,MAAM,EAAO;CAChE,OAAO;AACT;AAGA,MAAM,YAA2B,CAAC;AAElC,SAAS,MAAM,UAAuB,MAAoB;CACxD,MAAM,WAAW,SAAS;CAC1B,IAAI,SAAS,SAAA,GAAsB;EACjC,IAAI,WAAW,MAAM,SAAS,QAAQ;EACtC,IAAI,aAAA,GAAoB,QAAQ,QAAQ;OACnC,IAAI,CAAC,GAAG,cAAc,GAAG,OAAO,QAAQ,QAAQ;EACrD;CACF;CACA,IAAI,YAAY,MAAM;CACtB,SAAS,QAAQ;CACjB,IAAI,aAAA,GAAoB;CACxB,IAAI,SAAS,cAAc,QAAQ,SAAS,UAAU,SAAS,GAAG,UAAU,KAAK,QAAQ;AAC3F;;;;;AAMA,SAAS,WAAW,MAAmB,OAAyB;CAC9D,OAAO,GAAG,OAAO,QAAQ,MAAM,KAAK,MAAM;AAC5C;;;;;AAMA,SAAgB,SAAS,MAA4B;CACnD,OAAO,KAAK,SAAS,MAAM,KAAK,QAAA,QAAyB;AAC3D;;;;;;;;;;;;;;;;;;AAmBA,SAAgB,cAAc,QAAsB;CAClD,eAAe,OAAO,WAAA,CAAgB;CACtC,OAAO,UAAU,SAAS,GAAG;EAC3B,MAAM,OAAO,UAAU,IAAI;EAC3B,IAAI,SAAS,KAAA,GAAW,eAAe,KAAK,WAAA,CAAgB;CAC9D;AACF;;AAGA,SAAS,eAAe,WAAsC,MAAoB;CAChF,IAAI,cAAc,MAAM;CACxB,KAAK,IAAI,IAAI,GAAG,IAAI,UAAU,QAAQ,KAAK,GAAG,MAAM,UAAU,IAAmB,IAAI;AACvF;AAGA,MAAM,aAA4B,CAAC;AACnC,MAAM,aAAuB,CAAC;AAC9B,IAAI,WAAW;;;;;;;AAQf,SAAgB,kBAAkB,MAAmB,eAAe,OAAa;CAC/E,IAAI,KAAK,UAAA,GAAiB;CAC1B,MAAM,OAAO;CACb,WAAW,YAAY;CACvB,WAAW,YAAY;CACvB,YAAY;CACZ,KAAK,SAAA;CACL,IAAI;EACF,OAAO,WAAW,MAAM;GACtB,MAAM,KAAK,WAAW;GACtB,MAAM,OAAO,WAAW;GACxB,IAAI,SAAS,KAAA,GAAW;GACxB,IAAI,KAAK,UAAA,KAAoB,KAAK,UAAA,KAAmB,cAAe;IAClE,MAAM,UAAU,KAAK;IACrB,IAAI,SAAS,WAAW,OAAO;IAC/B,IAAI,YAAY;IAChB,OAAO,SAAS,QAAQ,QAAQ;KAC9B,MAAM,SAAS,QAAQ;KACvB,UAAU;KACV,IAAI,OAAO,SAAA,GAAsB;KACjC,MAAM,aAAa;KACnB,IAAI,WAAW,UAAA,MAAoB,WAAW,QAAA,OAA2B,GAAG;KAC5E,IAAI,SAAS,UAAU,GAAG;KAC1B,KAAK,WAAW,QAAA,OAA0B,GAAG,MAAM,IAAI,YAAY,gBAAgB;KAEnF,iBAAiB,UAAU;KAC3B,IAAI,WAAW,UAAA,MAAoB,WAAW,QAAA,OAA2B,GAAG;KAC5E,IAAI,SAAS,UAAU,GAAG;KAC1B,WAAW,MAAM;KACjB,WAAW,YAAY;KACvB,WAAW,YAAY;KACvB,YAAY;KACZ,WAAW,SAAA;KACX,YAAY;KACZ;IACF;IACA,IAAI,WAAW;GACjB;GACA,IAAI,KAAK,UAAA,GAAiB,UAAU,IAAI;QACnC,KAAK,QAAA;GACV,KAAK,SAAS;GACd,YAAY;EACd;CACF,UAAU;EAER,KAAK,IAAI,IAAI,MAAM,IAAI,UAAU,KAAK,GAAG;GACvC,MAAM,UAAU,WAAW;GAC3B,IAAI,YAAY,KAAA,GAAW,QAAQ,SAAS;EAC9C;EACA,WAAW,SAAS;EACpB,WAAW,SAAS;EACpB,WAAW;CACb;AACF;;;;;;AAOA,SAAS,iBAAiB,MAAyB;CACjD,MAAM,QAAuB,CAAC;CAC9B,KAAK,IAAI,QAAQ,KAAK,QAAQ,UAAU,MAAM,QAAQ,MAAM,QAAQ;EAClE,IAAI,EAAE,iBAAiB,cAAc;EACrC,IACE,MAAM,UAAA,MACL,MAAM,QAAA,SAA8D,KACrE,CAAC,SAAS,KAAK,GAEf,MAAM,KAAK,KAAK;CAEpB;CACA,KAAK,IAAI,IAAI,MAAM,SAAS,GAAG,KAAK,GAAG,KAAK,GAAG;EAC7C,MAAM,WAAW,MAAM;EACvB,IAAI,aAAa,KAAA,MAAc,SAAS,QAAA,OAA2B,GACjE,kBAAkB,QAAQ;CAE9B;AACF;;;;;;;;;;;;;;;AAgBA,SAAgB,WAAc,QAAsB;CAClD,IAAI,GAAG,aAAa,MAAM,MAAM,MAAM;CACtC,OAAO,OAAO;AAChB;;AAGA,SAAgB,SAAY,MAAsB;CAChD,KAAK,KAAK,QAAA,OAA0B,GAAG,MAAM,IAAI,YAAY,gBAAgB;CAC7E,IAAI,KAAK,UAAA,MAAoB,KAAK,QAAA,OAA2B,KAAK,CAAC,SAAS,IAAI,GAAG;EACjF,iBAAiB,IAAI;EACrB,KAAK,KAAK,QAAA,OAA2B,GACnC,kBAAkB,MAAM,GAAG,kBAAkB,UAAU;CAE3D;CACA,IAAI,GAAG,aAAa,MAAM,MAAM,IAAI;CACpC,KAAK,KAAK,QAAA,OAA4B,GAAG,MAAM,KAAK;CACpD,OAAO,KAAK;AACd;;AAGA,SAAgB,UAAU,MAAyB;CACjD,MAAM,KAAK,KAAK;CAChB,IAAI,OAAO,MAAM;CACjB,gBAAgB,IAAI;CACpB,KAAK,YAAY;CAEjB,KAAK,aAAa;CAElB,KAAK,gBAAgB;CACrB,KAAK,UAAU;CACf,KAAK,aAAa;CAElB,MAAM,gBAAgB,GAAG;CACzB,MAAM,mBAAmB,GAAG;CAC5B,MAAM,kBAAkB,GAAG;CAC3B,GAAG,QAAQ;CACX,GAAG,WAAW;CACd,GAAG,UAAU;CACb,GAAG,kBAAkB;CACrB,KAAK,QAAA;CACL,KAAK,SAAA;CACL,KAAK,QAAQ,aAAa;CAE1B,IAAI;CACJ,IAAI,SAAS;CACb,IAAI;CACJ,MAAM,YAAsB,YAAY,IAAI;CAC5C,IAAI;EACF,SAAU,GAAsC,KAAK,KAAK;CAC5D,SAAS,OAAO;EACd,SAAS;EACT,UAAU;CACZ,UAAU;EACR,GAAG,QAAQ;EACX,GAAG,WAAW;EACd,GAAG,UAAU;EACb,GAAG,kBAAkB;EACrB,KAAK,SAAS;EAEd,IAAI,KAAK,aAAa,KAAK,QAAQ,QAAQ,WAAW,MAAM,KAAK,UAAU;CAC7E;CAEA,MAAM,UAAU,KAAK,SAAA,IAAqB,WAAW,MAAM,QAAQ,QAAQ,OAAO,IAAI;CACtF,IAAI,KAAK,SAAA,GAAoB,aAAa,MAAM,QAAQ,QAAQ,OAAO;CAErE,OACE,eAAe,iBACf,MACA,WACA,YAAY,IAAI,IAAI,WACpB,SACA,UAAU,IAAI,CAChB;AAEJ;;AAGA,SAAS,WACP,MACA,QACA,QACA,SACS;CAET,IAAI,UAAU,WAAW,MAAM,OAAO,GAAG,OAAO;CAChD,MAAM,SAAS,KAAK,QAAA,QAAyB;CAC7C,KAAK,SAAS;CACd,MAAM,YAAY,KAAK,QAAA,OAA4B;CACnD,IAAI;CACJ,IAAI,UAAU,eAAe,MAAM,OAAO,GACxC,OAAO;CAET,IAAI,QAAQ;EACV,KAAK,SAAA;EACL,KAAK,QAAQ;EACb,UAAU;CACZ,OAAO;EACL,KAAK,SAAS;EACd,KAAK,QAAQ,KAAA;EACb,MAAM,SAAS,KAAK;EACpB,IAAI;GACF,UAAU,SAAS,YAAY,WAAW,SAAS,CAAC,OAAO,KAAK,OAAO,MAAM;GAC7E,IAAI,SAAS,KAAK,QAAQ;EAC5B,SAAS,iBAAiB;GAExB,KAAK,SAAA;GACL,KAAK,QAAQ;GACb,UAAU;EACZ;CACF;CACA,IAAI,CAAC,WAAW,OAAO,OAAO;CAC9B,MAAM,YAAY,KAAK;CACvB,IAAI,cAAc,MAAM,OAAO;CAC/B,KAAK,IAAI,IAAI,GAAG,IAAI,UAAU,QAAQ,KAAK,GAAG;EAC5C,MAAM,WAAW,UAAU;EAC3B,IAAI,SAAS,UAAA,GAAiB,SAAS,QAAA;CACzC;CACA,OAAO;AACT;;;;;;;;;;;AAYA,SAAS,eAAe,MAAmB,SAA2B;CACpE,IAAI,CAAC,gBAAgB,IAAI,GAAG,OAAO;CACnC,KAAK,SAAS;CACd,KAAK,QAAQ,KAAA;CACb,IAAI;EACF,YAAY,SAAS,IAAI;CAC3B,SAAS,WAAW;EAElB,KAAK,SAAA;EACL,KAAK,QAAQ;CACf;CACA,OAAO;AACT;AAEA,SAAS,aAAa,MAAmB,QAAiB,QAAiB,SAAwB;CACjG,IAAI,QAAQ;EACV,IAAI,CAAC,WAAW,MAAM,OAAO,GAAG,YAAY,SAAS,IAAI;EACzD;CACF;CACA,MAAM,QAAQ,KAAK;CACnB,IAAI;CACJ,IAAI,UAAU,MACZ,UAAU;MACL;EACL,MAAM,YAAY,KAAK,QAAA,QAAwB;EAC/C,KAAK,SAAS;EACd,MAAM,gBAAgB,KAAK;EAC3B,KAAK,QAAQ;EACb,IAAI,UAAU;EACd,MAAM,gBAAgB,GAAG;EACzB,MAAM,mBAAmB,GAAG;EAC5B,MAAM,kBAAkB,GAAG;EAC3B,GAAG,QAAQ;EACX,GAAG,WAAW;EAEd,GAAG,UAAU;EACb,IAAI;GACF,UAAW,MAAyD,QAAQ,aAAa;EAC3F,SAAS,OAAO;GACd,IAAI,CAAC,WAAW,MAAM,KAAK,GAAG,YAAY,OAAO,IAAI;GACrD;EACF,UAAU;GACR,GAAG,QAAQ;GACX,GAAG,WAAW;GACd,GAAG,UAAU;EACf;CACF;CACA,IAAI,OAAO,YAAY,YAAY;EACjC,WAAW,MAAM,OAAkB;EAEnC,KAAK,KAAK,QAAA,OAA2B,GAAG,KAAK,YAAY;CAC3D;AACF"}
|
|
1
|
+
{"version":3,"file":"graph.js","names":[],"sources":["../../../src/internal/graph.ts"],"sourcesContent":["import { DEVTOOLS_EVENT, report } from \"./devtools\";\nimport { ShadowError } from \"./diagnostics\";\nimport {\n CHECK,\n CLEAN,\n DIRTY,\n FLAG_DEFER,\n FLAG_DISPOSED,\n FLAG_HAS_ERROR,\n FLAG_REFRESHING,\n FLAG_RENDER,\n FLAG_RUNNING,\n FLAG_UNINIT,\n KIND_EFFECT,\n KIND_MEMO,\n KIND_SIGNAL,\n} from \"./flags\";\nimport {\n addCleanup,\n disposeChildren,\n finishDisposal,\n handleError,\n hasErrorHandler,\n Owner,\n} from \"./owner\";\nimport { enqueue } from \"./queue\";\nimport { nextSequence, rt } from \"./state\";\nimport type { Cleanup, Equals } from \"./types\";\n\n// Shared and frozen until a computation reads its first source: most effects and memos in a large\n// tree own few edges, and an empty array per node dominates creation cost.\nconst NO_SOURCES: Edges<Source> = Object.freeze([]) as unknown as Edges<Source>;\n\n/** Memo nesting depth after which pulls switch from recursion to the iterative walk. */\nconst DEEP_LIMIT = 128;\n\n/**\n * Anything that can be read reactively and notify observers: a signal, a memo, or a custom source\n * of a primitive. Exported from `@shadow-js/core/extend` as `SourceNode`. Read one with\n * {@link track}; after changing it, call {@link markObservers} and `schedule` (or `notify`).\n * @since 1.0.0\n */\nexport interface Source {\n /**\n * The node kind: 0 for a signal and for any custom source, which have no sources of their own; a\n * computation has its own kind. A refresh walks only the sources whose kind is not 0.\n */\n readonly kind: number;\n /** The current value. */\n value: unknown;\n /**\n * The computations that read this source in their last run, as pairs: an observer, then the index of this source in\n * that observer's `sources`. Null or empty when none. Read it with `observersOf`, which returns the observers alone.\n */\n observers: Edges<Computation> | null;\n /** Stamp of the last computation run that tracked this source (dedupes repeated reads). */\n stamp: number;\n}\n\n/**\n * The edges of one node, stored as pairs in one array: the node on the other side of the edge, then the index of this\n * node's entry in that node's own edge array. One array per side costs half the memory of two parallel ones, and\n * removing an edge stays O(1): the last pair moves into the vacated place and tells its owner where it went.\n */\nexport type Edges<T> = Array<T | number>;\n\n/**\n * The storage of a signal: its value, its equality and the computations that read it. Exported from\n * `@shadow-js/core/extend` as `SignalNode`; create one with `createSignalNode`, read it with\n * {@link readSignal} and write it with `writeSignal`, which notifies its readers. Build a custom\n * primitive on it the way `useSignal` does.\n *\n * @example\n * import { createSignalNode, readSignal, SignalNode, writeSignal } from \"@shadow-js/core/extend\";\n *\n * const count = createSignalNode<number>(0, Object.is, \"count\");\n * writeSignal(count, 1);\n * console.log(readSignal(count), count instanceof SignalNode); // 1 true\n * @see createSignalNode\n * @since 1.0.0\n */\nexport class Signal<T = unknown> implements Source {\n /** Always 0, the kind of a signal. */\n readonly kind: number = KIND_SIGNAL;\n // Fields the constructor assigns are `declare`d: a plain field would also emit an empty initializer\n // (`parent;`) that every bundle carries.\n /**\n * The current value. Assigning it directly notifies no one: use `writeSignal`, or call `notify`\n * after the assignment.\n */\n declare value: T;\n /** Decides whether a write is a change; `false` treats every write as one. */\n declare equals: Equals<T>;\n /** The computations that read this signal in their last run, as pairs (see {@link Source.observers}). */\n observers: Edges<Computation> | null = null;\n /** Stamp of the last computation run that tracked this signal (dedupes repeated reads). */\n stamp = 0;\n /**\n * Label shown by devtools and diagnostics.\n * @default undefined (the signal is unnamed)\n */\n declare name: string | undefined;\n\n /**\n * Creates a signal. Prefer `createSignalNode`, which takes the same arguments.\n * @param value Initial value.\n * @param equals Equality that decides whether a write is a change.\n * @param name Devtools label, or undefined for an unnamed signal.\n */\n constructor(value: T, equals: Equals<T>, name?: string) {\n this.value = value;\n this.equals = equals;\n this.name = name;\n if (__DEV__) report(DEVTOOLS_EVENT.SIGNAL_CREATED, this, rt.owner, name, value);\n }\n}\n\n/**\n * A memo or an effect: an owner that reads sources and (for memos) is itself a source. Exported from\n * `@shadow-js/core/extend` as `ComputationNode`; create one with `createComputation` and read a memo\n * with `readComputation`. It owns what its function creates: each run first disposes the children\n * and runs the cleanups of the previous run.\n *\n * @example\n * import { createComputation, createSignalNode, readComputation, readSignal } from \"@shadow-js/core/extend\";\n *\n * const price = createSignalNode(10, Object.is);\n * const total = createComputation({ kind: \"memo\", fn: () => readSignal(price) * 2 });\n * console.log(readComputation<number>(total)); // 20\n * @see createComputation\n * @since 1.0.0\n */\nexport class Computation extends Owner implements Source {\n // Fields the constructor assigns are `declare`d: a plain field would also emit an empty initializer\n // (`parent;`) that every bundle carries.\n /** 1 for a memo, 2 for an effect. */\n declare kind: number;\n /** How stale the node is: 0 (clean), 1 (a transitive source changed), 2 (a direct source changed). */\n declare state: number;\n /** Engine bit flags (queued, running, disposed, render phase, ...). Read-only outside the engine. */\n declare flags: number;\n /** A memo's last value; an effect's last computed value when it has an `apply` stage. */\n declare value: unknown;\n /** The error a memo's last run threw, rethrown to its readers; undefined when it succeeded. */\n error: unknown = undefined;\n /** A memo's equality: readers are notified only when it says the new value differs. */\n declare equals: Equals<unknown>;\n /** The function each run calls with the previous value; null once disposed. */\n fn: ((previous: never) => unknown) | null;\n /**\n * An effect's second stage, run untracked with the computed value and the previous one; null for\n * none and once disposed.\n */\n apply: ((value: never, previous: never) => unknown) | null = null;\n /**\n * The sources the last run read, in reading order, as pairs: a source, then the index of this computation in that\n * source's `observers`. Read it with `sourcesOf`, which returns the sources alone.\n */\n sources: Edges<Source> = NO_SOURCES;\n /** The computations that read this memo in their last run, as pairs (see {@link Source.observers}). */\n observers: Edges<Computation> | null = null;\n /** Stamp of the current run while it tracks, and of the last run that tracked this memo. */\n stamp = 0;\n /** During a run: how many leading entries of `sources` were confirmed again (they keep their edges). */\n trackIndex = 0;\n /** Creation order; breaks ties between effects at equal depth (G-16). */\n declare seq: number;\n /**\n * Label shown by devtools and diagnostics.\n * @default undefined (the computation is unnamed)\n */\n declare name: string | undefined;\n\n /**\n * Creates a computation that has not run yet. Prefer `createComputation`, which also runs or\n * queues it.\n * @param parent The owner to attach to, or null.\n * @param kind 1 for a memo, 2 for an effect.\n * @param flags Initial engine bit flags.\n * @param fn The function each run calls.\n * @param equals A memo's equality; `false` for an effect.\n * @param name Devtools label, or undefined.\n */\n constructor(\n parent: Owner | null,\n kind: number,\n flags: number,\n fn: (previous: never) => unknown,\n equals: Equals<unknown>,\n name: string | undefined,\n ) {\n super(parent);\n this.kind = kind;\n this.flags = flags;\n this.state = DIRTY;\n this.fn = fn;\n this.equals = equals;\n this.name = name;\n this.value = undefined;\n this.seq = nextSequence();\n if (__DEV__) {\n report(\n DEVTOOLS_EVENT.COMPUTATION_CREATED,\n this,\n parent,\n kind === KIND_MEMO ? \"memo\" : \"effect\",\n name,\n (flags & FLAG_RENDER) !== 0,\n );\n }\n }\n\n protected override release(): void {\n this.flags |= FLAG_DISPOSED;\n unlinkFrom(this, 0);\n this.fn = null;\n this.apply = null;\n }\n}\n\n/**\n * Removes the pair at `at` from `source.observers` in O(1): the last pair moves into its place, and its observer is told\n * where it went.\n */\nfunction removeObserver(source: Source, at: number): void {\n const observers = source.observers;\n if (observers === null) return;\n const last = observers.length - 2;\n if (at !== last) {\n const moved = observers[last] as Computation;\n const movedAt = observers[last + 1] as number;\n observers[at] = moved;\n observers[at + 1] = movedAt;\n moved.sources[movedAt + 1] = at;\n }\n observers.length = last;\n}\n\n/** Drops every edge from `node` to its sources. */\nexport function unlinkSources(node: Computation): void {\n unlinkFrom(node, 0);\n}\n\n/** Drops the edges from `node` to the sources at index `from` of `node.sources` and later, and truncates the list. */\nfunction unlinkFrom(node: Computation, from: number): void {\n const sources = node.sources;\n if (sources.length <= from) return;\n for (let i = sources.length - 2; i >= from; i -= 2) {\n // The index in the source is read each time: removing an edge may move this node's pair in another source.\n removeObserver(sources[i] as Source, sources[i + 1] as number);\n }\n sources.length = from;\n}\n\n/**\n * The array with the pair `first`, `second` appended: a new array of exactly the right size while short (`new Array(n)`\n * allocates the backing store at that size, where `push` on a short array reserves room for sixteen), the same array\n * grown by `push` from sixteen entries on.\n */\nfunction withEdge<T>(array: Array<T | number>, first: T, second: number): Array<T | number> {\n const length = array.length;\n if (length >= 16) {\n array.push(first, second);\n return array;\n }\n const next = new Array<T | number>(length + 2);\n for (let i = 0; i < length; i += 1) next[i] = array[i] as T | number;\n next[length] = first;\n next[length + 1] = second;\n return next;\n}\n\n/**\n * Records that the running computation read `source`, so a later {@link markObservers} on it marks\n * that computation stale. Call it in the reader of a custom source; {@link readSignal} does it for\n * signals. Does nothing when untracked, and a source read again in the same run is recorded once.\n *\n * @param source The source that was read.\n * @example\n * import { markObservers, schedule, type SourceNode, track } from \"@shadow-js/core/extend\";\n *\n * const clock: SourceNode = { kind: 0, value: Date.now(), observers: null, stamp: 0 };\n * export function now(): number {\n * track(clock);\n * return clock.value as number;\n * }\n * setInterval(() => {\n * clock.value = Date.now();\n * markObservers(clock);\n * schedule();\n * }, 1000);\n * @see readSignal\n * @since 1.0.0\n */\nexport function track(source: Source): void {\n const listener = rt.listener;\n if (listener === null) return;\n if (source.stamp === listener.stamp) return;\n source.stamp = listener.stamp;\n // Same dependency at the same position as last run: keep the edge, touch nothing.\n const position = listener.trackIndex;\n if (position < listener.sources.length) {\n if (listener.sources[position] === source) {\n listener.trackIndex = position + 2;\n return;\n }\n unlinkFrom(listener, position);\n }\n // Edge arrays are small: most nodes have one to three edges. `push` on a short array reserves room for about sixteen\n // entries (200 bytes where an exact array takes 64, measured), and a large list pays it for every row. A short array\n // therefore grows into a new exact one; from sixteen entries on `push` amortizes. Nothing iterates an edge array of\n // a node while it tracks, so replacing the array is safe.\n const observers = source.observers;\n const sources = listener.sources;\n const at = observers === null ? 0 : observers.length;\n const index = sources.length;\n source.observers =\n observers === null\n ? [listener, index]\n : (withEdge(observers, listener, index) as Edges<Computation>);\n listener.sources = withEdge(sources, source, at) as Edges<Source>;\n listener.trackIndex = index + 2;\n}\n\n/**\n * The sources the last run of a computation read, in reading order. Use it to inspect the graph (a debugger, a test);\n * it is a snapshot, so changing the returned array changes no edge.\n *\n * @param node The memo or effect.\n * @returns The signals and memos it reads now.\n * @example\n * import { createComputation, createSignalNode, flushSync, readSignal, sourcesOf } from \"@shadow-js/core/extend\";\n *\n * const count = createSignalNode<number>(1, Object.is, \"count\");\n * const effect = createComputation({ kind: \"effect\", fn: () => void readSignal(count) });\n * flushSync();\n * console.log(sourcesOf(effect).length); // 1\n * @see observersOf\n * @since 1.0.0\n */\nexport function sourcesOf(node: Computation): Source[] {\n return everyOther(node.sources) as Source[];\n}\n\n/**\n * The computations that read a signal or memo in their last run, in the order their edges were made. It is a snapshot,\n * so changing the returned array changes no edge. The node's own `observers` array stores pairs (the observer and an\n * index for the engine), so read it through this function.\n *\n * @param source A signal, a memo or a custom source.\n * @returns The memos and effects that read it now.\n * @example\n * import { createComputation, createSignalNode, flushSync, observersOf, readSignal } from \"@shadow-js/core/extend\";\n *\n * const count = createSignalNode<number>(1, Object.is, \"count\");\n * createComputation({ kind: \"effect\", fn: () => void readSignal(count) });\n * flushSync();\n * console.log(observersOf(count).length); // 1\n * @see sourcesOf\n * @since 1.0.0\n */\nexport function observersOf(source: Source): Computation[] {\n return source.observers === null ? [] : (everyOther(source.observers) as Computation[]);\n}\n\n/** True when at least one computation read `source` in its last run. */\nexport function hasObservers(source: Source): boolean {\n return source.observers !== null && source.observers.length > 0;\n}\n\n/** The first element of every pair of an edge array. */\nfunction everyOther<T>(edges: Edges<T>): T[] {\n const out: T[] = [];\n for (let i = 0; i < edges.length; i += 2) out.push(edges[i] as T);\n return out;\n}\n\n// Scratch stack for markObservers; never holds data across calls.\nconst markStack: Computation[] = [];\n\nfunction stale(observer: Computation, next: number): void {\n const previous = observer.state;\n if (observer.kind === KIND_EFFECT) {\n if (previous < next) observer.state = next;\n if (previous === CLEAN) enqueue(observer);\n else if (!rt.inTransition) rt.hooks?.promote(observer);\n return;\n }\n if (previous >= next) return;\n observer.state = next;\n if (previous !== CLEAN) return;\n if (observer.observers !== null && observer.observers.length > 0) markStack.push(observer);\n}\n\n/**\n * A suspension (a transition read pending data inside a held boundary) keeps the node's value until the\n * boundary releases it. True when `error` was one, and the node was recorded for that wake-up.\n */\nfunction trySuspend(node: Computation, error: unknown): boolean {\n return rt.hooks?.suspend(node, error) === true;\n}\n\n/**\n * A memo or effect frozen by a pause keeps its last value and does not refresh until it resumes.\n * A memo that never computed is not frozen (it has no value to keep).\n */\nexport function isFrozen(node: Computation): boolean {\n return node.pauses > 0 && (node.flags & FLAG_UNINIT) === 0;\n}\n\n/**\n * Marks the direct observers of a changed source DIRTY and everything downstream CHECK, and queues\n * the effects it reaches. It does not request a flush: call `schedule` afterward, or use `notify`,\n * which does both. Iterative: the graph can be 100,000 nodes deep (G-10).\n *\n * @param source The source whose value changed.\n * @example\n * import { markObservers, schedule, type SignalNode } from \"@shadow-js/core/extend\";\n *\n * export function push(list: SignalNode<string[]>, item: string): void {\n * list.value.push(item); // same array: writeSignal would see no change\n * markObservers(list);\n * schedule();\n * }\n * @see track\n * @since 1.0.0\n */\nexport function markObservers(source: Source): void {\n staleObservers(source.observers, DIRTY);\n while (markStack.length > 0) {\n staleObservers((markStack.pop() as Computation).observers, CHECK);\n }\n}\n\n/** Marks every observer in a list of edge pairs stale at the given level. */\nfunction staleObservers(observers: Edges<Computation> | null, next: number): void {\n if (observers === null) return;\n for (let i = 0; i < observers.length; i += 2) stale(observers[i] as Computation, next);\n}\n\n// Scratch frames for updateIfNecessary; entries above `frameTop` are dead.\nconst frameNodes: Computation[] = [];\nconst frameIndex: number[] = [];\nlet frameTop = 0;\n\n/**\n * Brings `root` up to date: verifies stale sources oldest-first and recomputes only nodes whose\n * sources really changed (equality cut-off, G-2). Iterative so deep chains cannot overflow (G-10).\n * With `eagerSources`, DIRTY nodes also refresh their previous sources first, which keeps the\n * native stack flat for chains where every node reads both a fresh signal and its predecessor.\n */\nexport function updateIfNecessary(root: Computation, eagerSources = false): void {\n if (root.state === CLEAN) return;\n const base = frameTop;\n frameNodes[frameTop] = root;\n frameIndex[frameTop] = 0;\n frameTop += 1;\n root.flags |= FLAG_REFRESHING;\n try {\n while (frameTop > base) {\n const at = frameTop - 1;\n const node = frameNodes[at] as Computation;\n if (node.state === CHECK || (node.state === DIRTY && eagerSources)) {\n const sources = node.sources;\n let cursor = frameIndex[at] as number;\n let descended = false;\n while (cursor < sources.length) {\n const source = sources[cursor] as Source;\n cursor += 2;\n if (source.kind === KIND_SIGNAL) continue;\n const dependency = source as Computation;\n if (!needsUpdate(dependency)) continue;\n if ((dependency.flags & FLAG_RUNNING) !== 0) throw new ShadowError(\"CYCLE_DETECTED\");\n // An owner that is about to re-run would dispose this dependency: update it first.\n if (!refreshAncestors(dependency)) continue;\n frameIndex[at] = cursor;\n frameNodes[frameTop] = dependency;\n frameIndex[frameTop] = 0;\n frameTop += 1;\n dependency.flags |= FLAG_REFRESHING;\n descended = true;\n break;\n }\n if (descended) continue;\n }\n if (node.state === DIRTY) recompute(node);\n else node.state = CLEAN;\n node.flags &= ~FLAG_REFRESHING;\n frameTop -= 1;\n }\n } finally {\n // An exception leaves frames on the stack: they must not stay marked as being refreshed.\n for (let i = base; i < frameTop; i += 1) {\n (frameNodes[i] as Computation).flags &= ~FLAG_REFRESHING;\n }\n frameNodes.length = base;\n frameIndex.length = base;\n frameTop = base;\n }\n}\n\n/** True when `node` is stale, alive and not frozen: running it now is both possible and needed. */\nfunction needsUpdate(node: Computation): boolean {\n return node.state !== CLEAN && (node.flags & FLAG_DISPOSED) === 0 && !isFrozen(node);\n}\n\n/**\n * Brings stale owners of `node` up to date, topmost first. An owner that is about to re-run will\n * dispose `node`; computing `node` first would run it with state that is already out of date\n * (a zombie, G-17). Iterative: the owner chain depth is user controlled.\n *\n * @returns Whether `node` still needs updating afterward (an owner's run may have cleaned or disposed it).\n */\nexport function refreshAncestors(node: Computation): boolean {\n if (!needsUpdate(node)) return false;\n const stale: Computation[] = [];\n for (let owner = node.parent; owner !== null; owner = owner.parent) {\n if (\n owner instanceof Computation &&\n owner.state !== CLEAN &&\n (owner.flags & (FLAG_RUNNING | FLAG_REFRESHING)) === 0\n ) {\n stale.push(owner);\n }\n }\n for (let i = stale.length - 1; i >= 0; i -= 1) {\n const ancestor = stale[i] as Computation;\n if (needsUpdate(ancestor)) updateIfNecessary(ancestor);\n }\n return needsUpdate(node);\n}\n\n/**\n * Reads a signal's value, subscribing the running computation to it when one is listening. The\n * reader of a custom primitive built on `createSignalNode`.\n *\n * @param signal The signal to read.\n * @returns The current value.\n * @example\n * import { createSignalNode, readSignal } from \"@shadow-js/core/extend\";\n *\n * const name = createSignalNode(\"Ada\", Object.is);\n * export const getName = (): string => readSignal(name);\n * @see track\n * @since 1.0.0\n */\nexport function readSignal<T>(signal: Signal<T>): T {\n if (rt.listener !== null) track(signal);\n return signal.value;\n}\n\n/** Reads a memo: refreshes it if stale, tracks it, rethrows its stored error. */\nexport function readMemo<T>(memo: Computation): T {\n if ((memo.flags & FLAG_RUNNING) !== 0) throw new ShadowError(\"CYCLE_DETECTED\");\n if (memo.state !== CLEAN && refreshAncestors(memo)) {\n updateIfNecessary(memo, rt.recomputeDepth >= DEEP_LIMIT);\n }\n if (rt.listener !== null) track(memo);\n if ((memo.flags & FLAG_HAS_ERROR) !== 0) throw memo.error;\n return memo.value as T;\n}\n\n/** Re-runs a memo or effect: disposes the previous run, re-tracks sources, stores the result. */\nexport function recompute(node: Computation): void {\n const fn = node.fn;\n if (fn === null) return;\n // One disposal for the children and the cleanups: all of them run even when one throws (the errors\n // are held in rt.uncaught), and the node still re-runs (it would stay dirty otherwise).\n rt.disposing += 1;\n try {\n disposeChildren(node);\n node.runCleanups();\n } finally {\n rt.disposing -= 1;\n }\n // Edges are kept and re-confirmed in order while the function runs (see track()).\n node.trackIndex = 0;\n // Each run starts from a clean slate: handlers, ids and child indices belong to one run.\n node.errorHandlers = null;\n node.idCount = 0;\n node.childCount = 0;\n\n const previousOwner = rt.owner;\n const previousListener = rt.listener;\n const previousRunning = rt.running;\n rt.owner = node;\n rt.listener = node;\n rt.running = node;\n rt.recomputeDepth += 1;\n node.state = CLEAN;\n node.flags |= FLAG_RUNNING;\n node.stamp = nextSequence();\n\n let result: unknown;\n let failed = false;\n let failure: unknown;\n const startedAt = __DEV__ ? performance.now() : 0;\n try {\n result = (fn as (previous: unknown) => unknown)(node.value);\n } catch (error) {\n failed = true;\n failure = error;\n } finally {\n rt.owner = previousOwner;\n rt.listener = previousListener;\n rt.running = previousRunning;\n rt.recomputeDepth -= 1;\n node.flags &= ~FLAG_RUNNING;\n // Sources this run did not read again are no longer dependencies. A node disposed while it ran\n // (it disposed its own owner) keeps none: reads after the disposal must not leave edges that\n // nothing will ever remove.\n unlinkFrom(node, (node.flags & FLAG_DISPOSED) !== 0 ? 0 : node.trackIndex);\n }\n\n let changed = true;\n if (node.kind === KIND_MEMO) changed = settleMemo(node, result, failed, failure);\n else settleEffect(node, result, failed, failure);\n if (__DEV__) {\n report(\n DEVTOOLS_EVENT.COMPUTATION_RUN,\n node,\n startedAt,\n performance.now() - startedAt,\n changed,\n sourcesOf(node),\n );\n }\n // The teardown's errors are thrown once the run is settled (unless a flush or an outer disposal collects them).\n rt.disposing += 1;\n finishDisposal();\n}\n\n/**\n * Calls a comparator untracked. It is a user callback: left tracked, the computation that writes (or the\n * reader that pulled the memo, the listener again once the run is over) would subscribe to whatever it\n * reads. Restored in `finally`, so a throwing comparator leaves the register as it found it.\n */\nexport function isEqual<T>(equals: (prev: T, next: T) => boolean, prev: T, next: T): boolean {\n const listener = rt.listener;\n rt.listener = null;\n try {\n return equals(prev, next);\n } finally {\n rt.listener = listener;\n }\n}\n\n/** Stores a memo's result; says whether its value changed (observers were told). */\nfunction settleMemo(\n node: Computation,\n result: unknown,\n failed: boolean,\n failure: unknown,\n): boolean {\n // A suspended memo keeps its previous value: its readers see nothing change until it resumes.\n if (failed && trySuspend(node, failure)) return false;\n const first = (node.flags & FLAG_UNINIT) !== 0;\n node.flags &= ~FLAG_UNINIT;\n const hadError = (node.flags & FLAG_HAS_ERROR) !== 0;\n let changed: boolean;\n if (failed && routeToHandler(node, failure)) {\n return false;\n }\n if (failed) {\n node.flags |= FLAG_HAS_ERROR;\n node.error = failure;\n changed = true;\n } else {\n node.flags &= ~FLAG_HAS_ERROR;\n node.error = undefined;\n const equals = node.equals;\n try {\n changed = first || hadError || equals === false || !isEqual(equals, node.value, result);\n if (changed) node.value = result;\n } catch (comparatorError) {\n // A throwing comparator is a failing memo, not a wedged graph: readers see the error.\n node.flags |= FLAG_HAS_ERROR;\n node.error = comparatorError;\n changed = true;\n }\n }\n if (!changed || first) return changed;\n const observers = node.observers;\n if (observers === null) return changed;\n for (let i = 0; i < observers.length; i += 2) {\n const observer = observers[i] as Computation;\n if (observer.state === CHECK) observer.state = DIRTY;\n }\n return changed;\n}\n\n/**\n * A memo that fails inside a boundary (an ancestor registered catchError()/onError()) reports to it\n * when it fails, and keeps its previous value. Readers then see that value instead of the error:\n * the reader may live outside the boundary (the DOM region that displays the memo's result), where a\n * rethrown error would escape the very boundary meant to catch it. Without a handler the error is\n * stored and rethrown to readers, so it is never silent.\n *\n * The first computation counts too: its value is `undefined`, and it is typically read by a\n * consumer outside the boundary (a DOM region), not by the code that created it.\n */\nfunction routeToHandler(node: Computation, failure: unknown): boolean {\n if (!hasErrorHandler(node)) return false;\n node.flags &= ~FLAG_HAS_ERROR;\n node.error = undefined;\n try {\n handleError(failure, node);\n } catch (unhandled) {\n // The chain ended in a handler that rethrew: readers see it, as for any unhandled failure.\n node.flags |= FLAG_HAS_ERROR;\n node.error = unhandled;\n }\n return true;\n}\n\nfunction settleEffect(node: Computation, result: unknown, failed: boolean, failure: unknown): void {\n if (failed) {\n if (!trySuspend(node, failure)) handleError(failure, node);\n return;\n }\n const apply = node.apply;\n let cleanup: unknown;\n if (apply === null) {\n cleanup = result;\n } else {\n const deferred = (node.flags & FLAG_DEFER) !== 0;\n node.flags &= ~FLAG_DEFER;\n const previousValue = node.value;\n node.value = result;\n if (deferred) return;\n const previousOwner = rt.owner;\n const previousListener = rt.listener;\n const previousRunning = rt.running;\n rt.owner = node;\n rt.listener = null;\n // Writes from an effect's apply are legal even when the effect was created inside a memo.\n rt.running = node;\n try {\n cleanup = (apply as (value: unknown, previous: unknown) => unknown)(result, previousValue);\n } catch (error) {\n if (!trySuspend(node, error)) handleError(error, node);\n return;\n } finally {\n rt.owner = previousOwner;\n rt.listener = previousListener;\n rt.running = previousRunning;\n }\n }\n if (typeof cleanup === \"function\") {\n addCleanup(node, cleanup as Cleanup);\n // The effect disposed its own owner while running: nothing will dispose it again, so run now.\n if ((node.flags & FLAG_DISPOSED) !== 0) node.runCleanups();\n }\n}\n"],"mappings":";;;;;;AA+BA,MAAM,aAA4B,OAAO,OAAO,CAAC,CAAC;;AAGlD,MAAM,aAAa;;;;;;;;;;;;;;;;AA+CnB,IAAa,SAAb,MAAmD;;CAEjD,OAAS;;CAWT,YAAuC;;CAEvC,QAAQ;;;;;;;CAaR,YAAY,OAAU,QAAmB,MAAe;EACtD,KAAK,QAAQ;EACb,KAAK,SAAS;EACd,KAAK,OAAO;EACC,OAAO,eAAe,gBAAgB,MAAM,GAAG,OAAO,MAAM,KAAK;CAChF;AACF;;;;;;;;;;;;;;;;AAiBA,IAAa,cAAb,cAAiC,MAAwB;;CAYvD,QAAiB,KAAA;;CAIjB;;;;;CAKA,QAA6D;;;;;CAK7D,UAAyB;;CAEzB,YAAuC;;CAEvC,QAAQ;;CAER,aAAa;;;;;;;;;;;CAmBb,YACE,QACA,MACA,OACA,IACA,QACA,MACA;EACA,MAAM,MAAM;EACZ,KAAK,OAAO;EACZ,KAAK,QAAQ;EACb,KAAK,QAAA;EACL,KAAK,KAAK;EACV,KAAK,SAAS;EACd,KAAK,OAAO;EACZ,KAAK,QAAQ,KAAA;EACb,KAAK,MAAM,aAAa;EAEtB,OACE,eAAe,qBACf,MACA,QACA,SAAA,IAAqB,SAAS,UAC9B,OACC,QAAA,QAAyB,CAC5B;CAEJ;CAEA,UAAmC;EACjC,KAAK,SAAA;EACL,WAAW,MAAM,CAAC;EAClB,KAAK,KAAK;EACV,KAAK,QAAQ;CACf;AACF;;;;;AAMA,SAAS,eAAe,QAAgB,IAAkB;CACxD,MAAM,YAAY,OAAO;CACzB,IAAI,cAAc,MAAM;CACxB,MAAM,OAAO,UAAU,SAAS;CAChC,IAAI,OAAO,MAAM;EACf,MAAM,QAAQ,UAAU;EACxB,MAAM,UAAU,UAAU,OAAO;EACjC,UAAU,MAAM;EAChB,UAAU,KAAK,KAAK;EACpB,MAAM,QAAQ,UAAU,KAAK;CAC/B;CACA,UAAU,SAAS;AACrB;;AAQA,SAAS,WAAW,MAAmB,MAAoB;CACzD,MAAM,UAAU,KAAK;CACrB,IAAI,QAAQ,UAAU,MAAM;CAC5B,KAAK,IAAI,IAAI,QAAQ,SAAS,GAAG,KAAK,MAAM,KAAK,GAE/C,eAAe,QAAQ,IAAc,QAAQ,IAAI,EAAY;CAE/D,QAAQ,SAAS;AACnB;;;;;;AAOA,SAAS,SAAY,OAA0B,OAAU,QAAmC;CAC1F,MAAM,SAAS,MAAM;CACrB,IAAI,UAAU,IAAI;EAChB,MAAM,KAAK,OAAO,MAAM;EACxB,OAAO;CACT;CACA,MAAM,OAAO,IAAI,MAAkB,SAAS,CAAC;CAC7C,KAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,KAAK,GAAG,KAAK,KAAK,MAAM;CACpD,KAAK,UAAU;CACf,KAAK,SAAS,KAAK;CACnB,OAAO;AACT;;;;;;;;;;;;;;;;;;;;;;;AAwBA,SAAgB,MAAM,QAAsB;CAC1C,MAAM,WAAW,GAAG;CACpB,IAAI,aAAa,MAAM;CACvB,IAAI,OAAO,UAAU,SAAS,OAAO;CACrC,OAAO,QAAQ,SAAS;CAExB,MAAM,WAAW,SAAS;CAC1B,IAAI,WAAW,SAAS,QAAQ,QAAQ;EACtC,IAAI,SAAS,QAAQ,cAAc,QAAQ;GACzC,SAAS,aAAa,WAAW;GACjC;EACF;EACA,WAAW,UAAU,QAAQ;CAC/B;CAKA,MAAM,YAAY,OAAO;CACzB,MAAM,UAAU,SAAS;CACzB,MAAM,KAAK,cAAc,OAAO,IAAI,UAAU;CAC9C,MAAM,QAAQ,QAAQ;CACtB,OAAO,YACL,cAAc,OACV,CAAC,UAAU,KAAK,IACf,SAAS,WAAW,UAAU,KAAK;CAC1C,SAAS,UAAU,SAAS,SAAS,QAAQ,EAAE;CAC/C,SAAS,aAAa,QAAQ;AAChC;;;;;;;;;;;;;;;;;AAkBA,SAAgB,UAAU,MAA6B;CACrD,OAAO,WAAW,KAAK,OAAO;AAChC;;;;;;;;;;;;;;;;;;AAmBA,SAAgB,YAAY,QAA+B;CACzD,OAAO,OAAO,cAAc,OAAO,CAAC,IAAK,WAAW,OAAO,SAAS;AACtE;;AAGA,SAAgB,aAAa,QAAyB;CACpD,OAAO,OAAO,cAAc,QAAQ,OAAO,UAAU,SAAS;AAChE;;AAGA,SAAS,WAAc,OAAsB;CAC3C,MAAM,MAAW,CAAC;CAClB,KAAK,IAAI,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK,GAAG,IAAI,KAAK,MAAM,EAAO;CAChE,OAAO;AACT;AAGA,MAAM,YAA2B,CAAC;AAElC,SAAS,MAAM,UAAuB,MAAoB;CACxD,MAAM,WAAW,SAAS;CAC1B,IAAI,SAAS,SAAA,GAAsB;EACjC,IAAI,WAAW,MAAM,SAAS,QAAQ;EACtC,IAAI,aAAA,GAAoB,QAAQ,QAAQ;OACnC,IAAI,CAAC,GAAG,cAAc,GAAG,OAAO,QAAQ,QAAQ;EACrD;CACF;CACA,IAAI,YAAY,MAAM;CACtB,SAAS,QAAQ;CACjB,IAAI,aAAA,GAAoB;CACxB,IAAI,SAAS,cAAc,QAAQ,SAAS,UAAU,SAAS,GAAG,UAAU,KAAK,QAAQ;AAC3F;;;;;AAMA,SAAS,WAAW,MAAmB,OAAyB;CAC9D,OAAO,GAAG,OAAO,QAAQ,MAAM,KAAK,MAAM;AAC5C;;;;;AAMA,SAAgB,SAAS,MAA4B;CACnD,OAAO,KAAK,SAAS,MAAM,KAAK,QAAA,QAAyB;AAC3D;;;;;;;;;;;;;;;;;;AAmBA,SAAgB,cAAc,QAAsB;CAClD,eAAe,OAAO,WAAA,CAAgB;CACtC,OAAO,UAAU,SAAS,GACxB,eAAgB,UAAU,IAAI,CAAC,CAAiB,WAAA,CAAgB;AAEpE;;AAGA,SAAS,eAAe,WAAsC,MAAoB;CAChF,IAAI,cAAc,MAAM;CACxB,KAAK,IAAI,IAAI,GAAG,IAAI,UAAU,QAAQ,KAAK,GAAG,MAAM,UAAU,IAAmB,IAAI;AACvF;AAGA,MAAM,aAA4B,CAAC;AACnC,MAAM,aAAuB,CAAC;AAC9B,IAAI,WAAW;;;;;;;AAQf,SAAgB,kBAAkB,MAAmB,eAAe,OAAa;CAC/E,IAAI,KAAK,UAAA,GAAiB;CAC1B,MAAM,OAAO;CACb,WAAW,YAAY;CACvB,WAAW,YAAY;CACvB,YAAY;CACZ,KAAK,SAAA;CACL,IAAI;EACF,OAAO,WAAW,MAAM;GACtB,MAAM,KAAK,WAAW;GACtB,MAAM,OAAO,WAAW;GACxB,IAAI,KAAK,UAAA,KAAoB,KAAK,UAAA,KAAmB,cAAe;IAClE,MAAM,UAAU,KAAK;IACrB,IAAI,SAAS,WAAW;IACxB,IAAI,YAAY;IAChB,OAAO,SAAS,QAAQ,QAAQ;KAC9B,MAAM,SAAS,QAAQ;KACvB,UAAU;KACV,IAAI,OAAO,SAAA,GAAsB;KACjC,MAAM,aAAa;KACnB,IAAI,CAAC,YAAY,UAAU,GAAG;KAC9B,KAAK,WAAW,QAAA,OAA0B,GAAG,MAAM,IAAI,YAAY,gBAAgB;KAEnF,IAAI,CAAC,iBAAiB,UAAU,GAAG;KACnC,WAAW,MAAM;KACjB,WAAW,YAAY;KACvB,WAAW,YAAY;KACvB,YAAY;KACZ,WAAW,SAAA;KACX,YAAY;KACZ;IACF;IACA,IAAI,WAAW;GACjB;GACA,IAAI,KAAK,UAAA,GAAiB,UAAU,IAAI;QACnC,KAAK,QAAA;GACV,KAAK,SAAS;GACd,YAAY;EACd;CACF,UAAU;EAER,KAAK,IAAI,IAAI,MAAM,IAAI,UAAU,KAAK,GACpC,WAAY,EAAE,CAAiB,SAAS;EAE1C,WAAW,SAAS;EACpB,WAAW,SAAS;EACpB,WAAW;CACb;AACF;;AAGA,SAAS,YAAY,MAA4B;CAC/C,OAAO,KAAK,UAAA,MAAoB,KAAK,QAAA,OAA2B,KAAK,CAAC,SAAS,IAAI;AACrF;;;;;;;;AASA,SAAgB,iBAAiB,MAA4B;CAC3D,IAAI,CAAC,YAAY,IAAI,GAAG,OAAO;CAC/B,MAAM,QAAuB,CAAC;CAC9B,KAAK,IAAI,QAAQ,KAAK,QAAQ,UAAU,MAAM,QAAQ,MAAM,QAC1D,IACE,iBAAiB,eACjB,MAAM,UAAA,MACL,MAAM,QAAA,SAA8C,GAErD,MAAM,KAAK,KAAK;CAGpB,KAAK,IAAI,IAAI,MAAM,SAAS,GAAG,KAAK,GAAG,KAAK,GAAG;EAC7C,MAAM,WAAW,MAAM;EACvB,IAAI,YAAY,QAAQ,GAAG,kBAAkB,QAAQ;CACvD;CACA,OAAO,YAAY,IAAI;AACzB;;;;;;;;;;;;;;;AAgBA,SAAgB,WAAc,QAAsB;CAClD,IAAI,GAAG,aAAa,MAAM,MAAM,MAAM;CACtC,OAAO,OAAO;AAChB;;AAGA,SAAgB,SAAY,MAAsB;CAChD,KAAK,KAAK,QAAA,OAA0B,GAAG,MAAM,IAAI,YAAY,gBAAgB;CAC7E,IAAI,KAAK,UAAA,KAAmB,iBAAiB,IAAI,GAC/C,kBAAkB,MAAM,GAAG,kBAAkB,UAAU;CAEzD,IAAI,GAAG,aAAa,MAAM,MAAM,IAAI;CACpC,KAAK,KAAK,QAAA,OAA4B,GAAG,MAAM,KAAK;CACpD,OAAO,KAAK;AACd;;AAGA,SAAgB,UAAU,MAAyB;CACjD,MAAM,KAAK,KAAK;CAChB,IAAI,OAAO,MAAM;CAGjB,GAAG,aAAa;CAChB,IAAI;EACF,gBAAgB,IAAI;EACpB,KAAK,YAAY;CACnB,UAAU;EACR,GAAG,aAAa;CAClB;CAEA,KAAK,aAAa;CAElB,KAAK,gBAAgB;CACrB,KAAK,UAAU;CACf,KAAK,aAAa;CAElB,MAAM,gBAAgB,GAAG;CACzB,MAAM,mBAAmB,GAAG;CAC5B,MAAM,kBAAkB,GAAG;CAC3B,GAAG,QAAQ;CACX,GAAG,WAAW;CACd,GAAG,UAAU;CACb,GAAG,kBAAkB;CACrB,KAAK,QAAA;CACL,KAAK,SAAA;CACL,KAAK,QAAQ,aAAa;CAE1B,IAAI;CACJ,IAAI,SAAS;CACb,IAAI;CACJ,MAAM,YAAsB,YAAY,IAAI;CAC5C,IAAI;EACF,SAAU,GAAsC,KAAK,KAAK;CAC5D,SAAS,OAAO;EACd,SAAS;EACT,UAAU;CACZ,UAAU;EACR,GAAG,QAAQ;EACX,GAAG,WAAW;EACd,GAAG,UAAU;EACb,GAAG,kBAAkB;EACrB,KAAK,SAAS;EAId,WAAW,OAAO,KAAK,QAAA,OAA2B,IAAI,IAAI,KAAK,UAAU;CAC3E;CAEA,IAAI,UAAU;CACd,IAAI,KAAK,SAAA,GAAoB,UAAU,WAAW,MAAM,QAAQ,QAAQ,OAAO;MAC1E,aAAa,MAAM,QAAQ,QAAQ,OAAO;CAE7C,OACE,eAAe,iBACf,MACA,WACA,YAAY,IAAI,IAAI,WACpB,SACA,UAAU,IAAI,CAChB;CAGF,GAAG,aAAa;CAChB,eAAe;AACjB;;;;;;AAOA,SAAgB,QAAW,QAAuC,MAAS,MAAkB;CAC3F,MAAM,WAAW,GAAG;CACpB,GAAG,WAAW;CACd,IAAI;EACF,OAAO,OAAO,MAAM,IAAI;CAC1B,UAAU;EACR,GAAG,WAAW;CAChB;AACF;;AAGA,SAAS,WACP,MACA,QACA,QACA,SACS;CAET,IAAI,UAAU,WAAW,MAAM,OAAO,GAAG,OAAO;CAChD,MAAM,SAAS,KAAK,QAAA,QAAyB;CAC7C,KAAK,SAAS;CACd,MAAM,YAAY,KAAK,QAAA,OAA4B;CACnD,IAAI;CACJ,IAAI,UAAU,eAAe,MAAM,OAAO,GACxC,OAAO;CAET,IAAI,QAAQ;EACV,KAAK,SAAA;EACL,KAAK,QAAQ;EACb,UAAU;CACZ,OAAO;EACL,KAAK,SAAS;EACd,KAAK,QAAQ,KAAA;EACb,MAAM,SAAS,KAAK;EACpB,IAAI;GACF,UAAU,SAAS,YAAY,WAAW,SAAS,CAAC,QAAQ,QAAQ,KAAK,OAAO,MAAM;GACtF,IAAI,SAAS,KAAK,QAAQ;EAC5B,SAAS,iBAAiB;GAExB,KAAK,SAAA;GACL,KAAK,QAAQ;GACb,UAAU;EACZ;CACF;CACA,IAAI,CAAC,WAAW,OAAO,OAAO;CAC9B,MAAM,YAAY,KAAK;CACvB,IAAI,cAAc,MAAM,OAAO;CAC/B,KAAK,IAAI,IAAI,GAAG,IAAI,UAAU,QAAQ,KAAK,GAAG;EAC5C,MAAM,WAAW,UAAU;EAC3B,IAAI,SAAS,UAAA,GAAiB,SAAS,QAAA;CACzC;CACA,OAAO;AACT;;;;;;;;;;;AAYA,SAAS,eAAe,MAAmB,SAA2B;CACpE,IAAI,CAAC,gBAAgB,IAAI,GAAG,OAAO;CACnC,KAAK,SAAS;CACd,KAAK,QAAQ,KAAA;CACb,IAAI;EACF,YAAY,SAAS,IAAI;CAC3B,SAAS,WAAW;EAElB,KAAK,SAAA;EACL,KAAK,QAAQ;CACf;CACA,OAAO;AACT;AAEA,SAAS,aAAa,MAAmB,QAAiB,QAAiB,SAAwB;CACjG,IAAI,QAAQ;EACV,IAAI,CAAC,WAAW,MAAM,OAAO,GAAG,YAAY,SAAS,IAAI;EACzD;CACF;CACA,MAAM,QAAQ,KAAK;CACnB,IAAI;CACJ,IAAI,UAAU,MACZ,UAAU;MACL;EACL,MAAM,YAAY,KAAK,QAAA,QAAwB;EAC/C,KAAK,SAAS;EACd,MAAM,gBAAgB,KAAK;EAC3B,KAAK,QAAQ;EACb,IAAI,UAAU;EACd,MAAM,gBAAgB,GAAG;EACzB,MAAM,mBAAmB,GAAG;EAC5B,MAAM,kBAAkB,GAAG;EAC3B,GAAG,QAAQ;EACX,GAAG,WAAW;EAEd,GAAG,UAAU;EACb,IAAI;GACF,UAAW,MAAyD,QAAQ,aAAa;EAC3F,SAAS,OAAO;GACd,IAAI,CAAC,WAAW,MAAM,KAAK,GAAG,YAAY,OAAO,IAAI;GACrD;EACF,UAAU;GACR,GAAG,QAAQ;GACX,GAAG,WAAW;GACd,GAAG,UAAU;EACf;CACF;CACA,IAAI,OAAO,YAAY,YAAY;EACjC,WAAW,MAAM,OAAkB;EAEnC,KAAK,KAAK,QAAA,OAA2B,GAAG,KAAK,YAAY;CAC3D;AACF"}
|
|
@@ -63,7 +63,8 @@ export declare class Owner {
|
|
|
63
63
|
/**
|
|
64
64
|
* While this returns true, user effects (and `onMount`) created below this owner wait: they do
|
|
65
65
|
* not run until it returns false for the first time. Suspense sets it so the effects of content
|
|
66
|
-
* that is still loading are held back. The read is tracked.
|
|
66
|
+
* that is still loading are held back. The read is tracked. A node starts with the gate of its
|
|
67
|
+
* parent, so the nearest gate is the one on the owner an effect is created under.
|
|
67
68
|
*/
|
|
68
69
|
gate: (() => boolean) | null;
|
|
69
70
|
/**
|
|
@@ -77,17 +78,19 @@ export declare class Owner {
|
|
|
77
78
|
* @param parent The owner to attach to, or null for a root.
|
|
78
79
|
*/
|
|
79
80
|
constructor(parent: Owner | null);
|
|
80
|
-
/**
|
|
81
|
-
|
|
82
|
-
|
|
83
|
-
|
|
81
|
+
/**
|
|
82
|
+
* Hook for subclasses: release graph edges before the node is marked disposed. Declared, not
|
|
83
|
+
* defined: a plain owner holds no graph edges, and an empty method would ship in every bundle.
|
|
84
|
+
*/
|
|
85
|
+
protected release?(): void;
|
|
84
86
|
/**
|
|
85
87
|
* Disposes this node only (children must already be gone).
|
|
86
88
|
* @internal
|
|
87
89
|
*/
|
|
88
90
|
disposeSelf(): void;
|
|
89
91
|
/**
|
|
90
|
-
* Runs own cleanups newest first, untracked, isolating failures
|
|
92
|
+
* Runs own cleanups newest first, untracked, isolating failures: every cleanup runs, and the errors
|
|
93
|
+
* nobody handled are thrown together afterward, unless a flush or an outer disposal collects them.
|
|
91
94
|
* @internal
|
|
92
95
|
*/
|
|
93
96
|
runCleanups(): void;
|
|
@@ -20,8 +20,6 @@ import { rt } from "./state.js";
|
|
|
20
20
|
* @since 1.0.0
|
|
21
21
|
*/
|
|
22
22
|
var Owner = class Owner {
|
|
23
|
-
/** The owner this node was created under, or null for a root. Kept after disposal. */
|
|
24
|
-
parent;
|
|
25
23
|
/** The newest child that is still alive, or null when there is none. */
|
|
26
24
|
lastChild = null;
|
|
27
25
|
/** The next older sibling that is still alive, or null. */
|
|
@@ -33,8 +31,6 @@ var Owner = class Owner {
|
|
|
33
31
|
* array (oldest first) for several. Emptied when they run.
|
|
34
32
|
*/
|
|
35
33
|
cleanups = null;
|
|
36
|
-
/** The context values this node sees: inherited from the parent at creation, null for a root. */
|
|
37
|
-
context;
|
|
38
34
|
/**
|
|
39
35
|
* The handlers registered with `onError` or `catchError`, oldest first (they are tried newest
|
|
40
36
|
* first), or null for none. A computation clears them before each run.
|
|
@@ -44,10 +40,6 @@ var Owner = class Owner {
|
|
|
44
40
|
childCount = 0;
|
|
45
41
|
/** Number of ids useId() has handed out from this owner. */
|
|
46
42
|
idCount = 0;
|
|
47
|
-
/** Position among the parent's children, assigned at creation. */
|
|
48
|
-
index;
|
|
49
|
-
/** Distance from the root: 0 for a root, the parent's depth plus one otherwise. */
|
|
50
|
-
depth;
|
|
51
43
|
/**
|
|
52
44
|
* The hydration-scope prefix of a component's owner, set by the renderer. When present, useId()
|
|
53
45
|
* builds the ids below it from this prefix instead of the owner path.
|
|
@@ -59,7 +51,8 @@ var Owner = class Owner {
|
|
|
59
51
|
/**
|
|
60
52
|
* While this returns true, user effects (and `onMount`) created below this owner wait: they do
|
|
61
53
|
* not run until it returns false for the first time. Suspense sets it so the effects of content
|
|
62
|
-
* that is still loading are held back. The read is tracked.
|
|
54
|
+
* that is still loading are held back. The read is tracked. A node starts with the gate of its
|
|
55
|
+
* parent, so the nearest gate is the one on the owner an effect is created under.
|
|
63
56
|
*/
|
|
64
57
|
gate = null;
|
|
65
58
|
/**
|
|
@@ -74,11 +67,14 @@ var Owner = class Owner {
|
|
|
74
67
|
*/
|
|
75
68
|
constructor(parent) {
|
|
76
69
|
this.parent = parent;
|
|
77
|
-
|
|
78
|
-
|
|
79
|
-
|
|
80
|
-
|
|
81
|
-
|
|
70
|
+
if (parent === null) {
|
|
71
|
+
this.context = null;
|
|
72
|
+
this.depth = this.index = 0;
|
|
73
|
+
} else {
|
|
74
|
+
this.context = parent.context;
|
|
75
|
+
this.depth = parent.depth + 1;
|
|
76
|
+
this.pauses = parent.pauses;
|
|
77
|
+
this.gate = parent.gate;
|
|
82
78
|
this.index = parent.childCount;
|
|
83
79
|
parent.childCount += 1;
|
|
84
80
|
const last = parent.lastChild;
|
|
@@ -88,12 +84,6 @@ var Owner = class Owner {
|
|
|
88
84
|
}
|
|
89
85
|
if (new.target === Owner) report(DEVTOOLS_EVENT.OWNER_CREATED, this, parent, parent === null ? "root" : "owner");
|
|
90
86
|
}
|
|
91
|
-
/** Tells devtools this node is gone. Computations override it with their own event. */
|
|
92
|
-
reportDisposed() {
|
|
93
|
-
report(DEVTOOLS_EVENT.OWNER_DISPOSED, this);
|
|
94
|
-
}
|
|
95
|
-
/** Hook for subclasses: release graph edges before the node is marked disposed. */
|
|
96
|
-
release() {}
|
|
97
87
|
/**
|
|
98
88
|
* Disposes this node only (children must already be gone).
|
|
99
89
|
* @internal
|
|
@@ -111,12 +101,13 @@ var Owner = class Owner {
|
|
|
111
101
|
this.prevSibling = null;
|
|
112
102
|
this.nextSibling = null;
|
|
113
103
|
}
|
|
114
|
-
this.release();
|
|
115
|
-
this.
|
|
104
|
+
this.release?.();
|
|
105
|
+
report("kind" in this ? DEVTOOLS_EVENT.COMPUTATION_DISPOSED : DEVTOOLS_EVENT.OWNER_DISPOSED, this);
|
|
116
106
|
this.runCleanups();
|
|
117
107
|
}
|
|
118
108
|
/**
|
|
119
|
-
* Runs own cleanups newest first, untracked, isolating failures
|
|
109
|
+
* Runs own cleanups newest first, untracked, isolating failures: every cleanup runs, and the errors
|
|
110
|
+
* nobody handled are thrown together afterward, unless a flush or an outer disposal collects them.
|
|
120
111
|
* @internal
|
|
121
112
|
*/
|
|
122
113
|
runCleanups() {
|
|
@@ -127,15 +118,14 @@ var Owner = class Owner {
|
|
|
127
118
|
const previousListener = rt.listener;
|
|
128
119
|
rt.owner = null;
|
|
129
120
|
rt.listener = null;
|
|
121
|
+
rt.disposing += 1;
|
|
130
122
|
try {
|
|
131
123
|
if (typeof cleanups === "function") runCleanup(cleanups, this);
|
|
132
|
-
else for (let i = cleanups.length - 1; i >= 0; i -= 1)
|
|
133
|
-
const cleanup = cleanups[i];
|
|
134
|
-
if (cleanup !== void 0) runCleanup(cleanup, this);
|
|
135
|
-
}
|
|
124
|
+
else for (let i = cleanups.length - 1; i >= 0; i -= 1) runCleanup(cleanups[i], this);
|
|
136
125
|
} finally {
|
|
137
126
|
rt.owner = previousOwner;
|
|
138
127
|
rt.listener = previousListener;
|
|
128
|
+
finishDisposal();
|
|
139
129
|
}
|
|
140
130
|
}
|
|
141
131
|
};
|
|
@@ -184,7 +174,10 @@ function disposeChildren(owner) {
|
|
|
184
174
|
disposeTree(child);
|
|
185
175
|
}
|
|
186
176
|
}
|
|
187
|
-
/**
|
|
177
|
+
/**
|
|
178
|
+
* Rethrows what disposal collected once the outermost disposal is finished.
|
|
179
|
+
* @internal
|
|
180
|
+
*/
|
|
188
181
|
function finishDisposal() {
|
|
189
182
|
rt.disposing -= 1;
|
|
190
183
|
if (rt.disposing > 0 || rt.flushing || rt.uncaught.length === 0) return;
|
|
@@ -245,7 +238,6 @@ function handleError(error, from) {
|
|
|
245
238
|
if (handlers === null) continue;
|
|
246
239
|
for (let i = handlers.length - 1; i >= 0; i -= 1) {
|
|
247
240
|
const handler = handlers[i];
|
|
248
|
-
if (handler === void 0) continue;
|
|
249
241
|
const previousListener = rt.listener;
|
|
250
242
|
try {
|
|
251
243
|
rt.listener = null;
|
|
@@ -284,6 +276,6 @@ function reportUncaught(error) {
|
|
|
284
276
|
if (rt.flushing || rt.disposing > 0) rt.uncaught.push(error);
|
|
285
277
|
else throw error;
|
|
286
278
|
}
|
|
287
|
-
export { Owner, addCleanup, disposeChildren, disposeTree, handleError, hasErrorHandler };
|
|
279
|
+
export { Owner, addCleanup, disposeChildren, disposeTree, finishDisposal, handleError, hasErrorHandler };
|
|
288
280
|
|
|
289
281
|
//# sourceMappingURL=owner.js.map
|