@shadow-js/core 1.0.3 → 1.0.5
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 +14 -0
- package/README.md +1 -2
- package/dist/dev/action.js +1 -1
- package/dist/dev/cache.js +1 -1
- package/dist/dev/context.js +2 -2
- package/dist/dev/effect.js +9 -12
- package/dist/dev/effect.js.map +1 -1
- package/dist/dev/extend/index.d.ts +4 -4
- package/dist/dev/extend/index.js +5 -5
- package/dist/dev/external-store.js +2 -2
- package/dist/dev/index.d.ts +6 -6
- package/dist/dev/index.js +9 -9
- package/dist/dev/internal/concurrency.js +5 -5
- package/dist/dev/internal/dispose.js +3 -9
- package/dist/dev/internal/dispose.js.map +1 -1
- package/dist/dev/internal/graph.d.ts +1 -1
- package/dist/dev/internal/graph.js +8 -4
- package/dist/dev/internal/graph.js.map +1 -1
- package/dist/dev/internal/scheduler.js +26 -17
- package/dist/dev/internal/scheduler.js.map +1 -1
- package/dist/dev/internal/state.d.ts +1 -1
- package/dist/dev/internal/state.js +11 -3
- package/dist/dev/internal/state.js.map +1 -1
- package/dist/dev/list.js +2 -2
- package/dist/dev/optimistic.js +1 -1
- package/dist/dev/ownership.js +6 -1
- package/dist/dev/ownership.js.map +1 -1
- package/dist/dev/props.js +1 -1
- package/dist/dev/reaction.js +2 -2
- package/dist/dev/resource.js +4 -4
- package/dist/dev/selector.js +1 -1
- package/dist/dev/signal.js +1 -1
- package/dist/dev/store/index.d.ts +1 -1
- package/dist/dev/store/nodes.js +7 -3
- package/dist/dev/store/nodes.js.map +1 -1
- package/dist/dev/store/reconcile.js +1 -1
- package/dist/dev/store/reconcile.js.map +1 -1
- package/dist/dev/store/use-store.js +9 -5
- package/dist/dev/store/use-store.js.map +1 -1
- package/dist/dev/transitions.js +2 -2
- package/dist/prod/action.js +1 -1
- package/dist/prod/cache.js +1 -1
- package/dist/prod/context.js +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/external-store.js +1 -1
- package/dist/prod/index.js +1 -1
- package/dist/prod/internal/concurrency.js +1 -1
- package/dist/prod/internal/concurrency.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/graph.js +1 -1
- package/dist/prod/internal/graph.js.map +1 -1
- package/dist/prod/internal/scheduler.js +1 -1
- package/dist/prod/internal/scheduler.js.map +1 -1
- package/dist/prod/internal/state.js +1 -1
- package/dist/prod/internal/state.js.map +1 -1
- package/dist/prod/list.js +1 -1
- package/dist/prod/optimistic.js +1 -1
- package/dist/prod/ownership.js +1 -1
- package/dist/prod/ownership.js.map +1 -1
- package/dist/prod/props.js +1 -1
- package/dist/prod/reaction.js +1 -1
- package/dist/prod/resource.js +1 -1
- package/dist/prod/selector.js +1 -1
- package/dist/prod/signal.js +1 -1
- package/dist/prod/store/nodes.js +1 -1
- package/dist/prod/store/nodes.js.map +1 -1
- package/dist/prod/store/reconcile.js +1 -1
- package/dist/prod/store/reconcile.js.map +1 -1
- package/dist/prod/store/use-store.js +1 -1
- package/dist/prod/store/use-store.js.map +1 -1
- package/dist/prod/transitions.js +1 -1
- package/dist/server/action.js +1 -1
- package/dist/server/cache.js +1 -1
- package/dist/server/context.js +1 -1
- package/dist/server/effect.js.map +1 -1
- package/dist/server/extend/index.js +1 -1
- package/dist/server/index.js +1 -1
- package/dist/server/internal/concurrency.js +1 -1
- package/dist/server/internal/concurrency.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/graph.js +1 -1
- package/dist/server/internal/graph.js.map +1 -1
- package/dist/server/internal/scheduler.js +1 -1
- package/dist/server/internal/scheduler.js.map +1 -1
- package/dist/server/internal/state.js +1 -1
- package/dist/server/internal/state.js.map +1 -1
- package/dist/server/list.js +1 -1
- package/dist/server/optimistic.js +1 -1
- package/dist/server/ownership.js +1 -1
- package/dist/server/ownership.js.map +1 -1
- package/dist/server/props.js +1 -1
- package/dist/server/reaction.js +1 -1
- package/dist/server/resource.js +1 -1
- package/dist/server/selector.js +1 -1
- package/dist/server/signal.js +1 -1
- package/dist/server/store/nodes.js +1 -1
- package/dist/server/store/nodes.js.map +1 -1
- package/dist/server/store/reconcile.js +1 -1
- package/dist/server/store/reconcile.js.map +1 -1
- package/dist/server/store/use-store.js +1 -1
- package/dist/server/store/use-store.js.map +1 -1
- package/dist/server/transitions.js +1 -1
- package/dist/server-dev/action.js +1 -1
- package/dist/server-dev/cache.js +1 -1
- package/dist/server-dev/context.js +1 -1
- package/dist/server-dev/effect.js.map +1 -1
- package/dist/server-dev/extend/index.js +5 -5
- package/dist/server-dev/index.js +9 -9
- package/dist/server-dev/internal/concurrency.js +5 -5
- package/dist/server-dev/internal/dispose.js +3 -9
- package/dist/server-dev/internal/dispose.js.map +1 -1
- package/dist/server-dev/internal/graph.js +8 -4
- package/dist/server-dev/internal/graph.js.map +1 -1
- package/dist/server-dev/internal/scheduler.js +26 -17
- package/dist/server-dev/internal/scheduler.js.map +1 -1
- package/dist/server-dev/internal/state.js +11 -3
- package/dist/server-dev/internal/state.js.map +1 -1
- package/dist/server-dev/list.js +2 -2
- package/dist/server-dev/optimistic.js +1 -1
- package/dist/server-dev/ownership.js +6 -1
- package/dist/server-dev/ownership.js.map +1 -1
- package/dist/server-dev/props.js +1 -1
- package/dist/server-dev/reaction.js +2 -2
- package/dist/server-dev/resource.js +3 -3
- package/dist/server-dev/selector.js +1 -1
- package/dist/server-dev/signal.js +1 -1
- package/dist/server-dev/store/nodes.js +7 -3
- package/dist/server-dev/store/nodes.js.map +1 -1
- package/dist/server-dev/store/reconcile.js +1 -1
- package/dist/server-dev/store/reconcile.js.map +1 -1
- package/dist/server-dev/store/use-store.js +9 -5
- package/dist/server-dev/store/use-store.js.map +1 -1
- package/dist/server-dev/transitions.js +1 -1
- package/package.json +2 -2
|
@@ -1,10 +1,10 @@
|
|
|
1
1
|
import { DEVTOOLS_EVENT, report } from "./devtools.js";
|
|
2
2
|
import { ShadowError, warn } from "./diagnostics.js";
|
|
3
3
|
import { FLAG_PARKED, FLAG_TRANSITION } from "./flags.js";
|
|
4
|
-
import {
|
|
4
|
+
import { recompute, refreshAncestors, updateIfNecessary } from "./graph.js";
|
|
5
5
|
import { handleError } from "./owner.js";
|
|
6
6
|
import { clearQueues, hasPending, renderQueue, userQueue } from "./queue.js";
|
|
7
|
-
import {
|
|
7
|
+
import { rt } from "./state.js";
|
|
8
8
|
// src/internal/scheduler.ts
|
|
9
9
|
/**
|
|
10
10
|
* Flush passes allowed before the loop guard aborts (R-CODE-12).
|
|
@@ -89,7 +89,8 @@ function flush() {
|
|
|
89
89
|
rt.uncaught.push(new ShadowError("INFINITE_LOOP"));
|
|
90
90
|
break;
|
|
91
91
|
}
|
|
92
|
-
|
|
92
|
+
const ran = drain(renderQueue.length > 0 ? renderQueue : userQueue);
|
|
93
|
+
runs += ran;
|
|
93
94
|
}
|
|
94
95
|
} finally {
|
|
95
96
|
rt.flushing = false;
|
|
@@ -136,7 +137,7 @@ function runScheduled() {
|
|
|
136
137
|
* @since 1.0.0
|
|
137
138
|
*/
|
|
138
139
|
function schedule() {
|
|
139
|
-
if (rt.inTransition || rt.
|
|
140
|
+
if (rt.inTransition || rt.batches > 0 || rt.flushing || microtaskScheduled) return;
|
|
140
141
|
microtaskScheduled = true;
|
|
141
142
|
queueMicrotask(runScheduled);
|
|
142
143
|
}
|
|
@@ -162,13 +163,27 @@ function schedule() {
|
|
|
162
163
|
* @since 1.0.0
|
|
163
164
|
*/
|
|
164
165
|
function group(fn) {
|
|
165
|
-
rt.
|
|
166
|
+
rt.batches += 1;
|
|
166
167
|
try {
|
|
167
168
|
return fn();
|
|
168
169
|
} finally {
|
|
169
|
-
rt.
|
|
170
|
-
if (rt.
|
|
170
|
+
rt.batches -= 1;
|
|
171
|
+
if (rt.batches === 0 && hasPending()) schedule();
|
|
172
|
+
}
|
|
173
|
+
}
|
|
174
|
+
/**
|
|
175
|
+
* Flushes when `wanted`, then rethrows `failure` when `failed`. A failing flush is thrown on its own, or
|
|
176
|
+
* together with `failure` (an `AggregateError` with `message`) when both threw.
|
|
177
|
+
* @internal
|
|
178
|
+
*/
|
|
179
|
+
function flushThenThrow(wanted, failed, failure, message) {
|
|
180
|
+
if (wanted) try {
|
|
181
|
+
flush();
|
|
182
|
+
} catch (error) {
|
|
183
|
+
if (!failed) throw error;
|
|
184
|
+
throw new AggregateError([failure, error], message);
|
|
171
185
|
}
|
|
186
|
+
if (failed) throw failure;
|
|
172
187
|
}
|
|
173
188
|
/**
|
|
174
189
|
* The body `batch` and `flushSync` share: runs `fn` with the effects deferred, then flushes (always when
|
|
@@ -176,7 +191,7 @@ function group(fn) {
|
|
|
176
191
|
* the flush has run, and thrown with the flush's own error as an `AggregateError` when both threw.
|
|
177
192
|
*/
|
|
178
193
|
function runBatched(fn, sync) {
|
|
179
|
-
rt.
|
|
194
|
+
rt.batches += 1;
|
|
180
195
|
let result;
|
|
181
196
|
let failure;
|
|
182
197
|
let failed = false;
|
|
@@ -186,15 +201,9 @@ function runBatched(fn, sync) {
|
|
|
186
201
|
failed = true;
|
|
187
202
|
failure = error;
|
|
188
203
|
} finally {
|
|
189
|
-
rt.
|
|
204
|
+
rt.batches -= 1;
|
|
190
205
|
}
|
|
191
|
-
|
|
192
|
-
flush();
|
|
193
|
-
} catch (error) {
|
|
194
|
-
if (failed) throw new AggregateError([failure, error], "Both the callback and the flush threw.");
|
|
195
|
-
throw error;
|
|
196
|
-
}
|
|
197
|
-
if (failed) throw failure;
|
|
206
|
+
flushThenThrow(sync || rt.batches === 0 && !rt.flushing && hasPending(), failed, failure, "Both the callback and the flush threw.");
|
|
198
207
|
return result;
|
|
199
208
|
}
|
|
200
209
|
/**
|
|
@@ -252,6 +261,6 @@ function flushSync(fn) {
|
|
|
252
261
|
}
|
|
253
262
|
return runBatched(fn, true);
|
|
254
263
|
}
|
|
255
|
-
export { MAX_FLUSH_PASSES, batch, byCreation, flush, flushSync, group, reportUncaught, runQueued, schedule };
|
|
264
|
+
export { MAX_FLUSH_PASSES, batch, byCreation, flush, flushSync, flushThenThrow, group, reportUncaught, runQueued, schedule };
|
|
256
265
|
|
|
257
266
|
//# sourceMappingURL=scheduler.js.map
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"scheduler.js","names":[],"sources":["../../../src/internal/scheduler.ts"],"sourcesContent":["import { DEVTOOLS_EVENT, report } from \"./devtools\";\nimport { ShadowError, warn } from \"./diagnostics\";\nimport { DIRTY, FLAG_DISPOSED, FLAG_PARKED, FLAG_QUEUED, FLAG_TRANSITION } from \"./flags\";\nimport type { Computation } from \"./graph\";\nimport { recompute, refreshAncestors, updateIfNecessary } from \"./graph\";\nimport { handleError } from \"./owner\";\nimport { clearQueues, hasPending, renderQueue, userQueue } from \"./queue\";\nimport { rt } from \"./state\";\n\n/**\n * Flush passes allowed before the loop guard aborts (R-CODE-12).\n * @internal\n */\nexport const MAX_FLUSH_PASSES = 1000;\n\nlet microtaskScheduled = false;\n\n/**\n * Sort order of queued effects: parents before children (by depth), siblings by creation (G-16).\n * @internal\n */\nexport function byCreation(a: Computation, b: Computation): number {\n return a.depth - b.depth || a.seq - b.seq;\n}\n\n/**\n * Runs one queued effect. Its stale owners come first: an owner that is about to re-run disposes the\n * effect, and running it before (a zombie, G-17) would read state that is already out of date.\n * @internal\n */\nexport function runQueued(effect: Computation): void {\n try {\n if (!refreshAncestors(effect)) return;\n // A directly dirtied effect needs no source verification: skip the frame machinery.\n if (effect.state === DIRTY) recompute(effect);\n else updateIfNecessary(effect);\n } catch (error) {\n handleError(error, effect);\n }\n}\n\n/** Runs every queued effect of one phase, parents before children, siblings by creation. */\nfunction drain(queue: Computation[]): number {\n const batch = queue.splice(0, queue.length);\n // Effects mostly arrive in creation order already: the sort then finds one ascending run and is O(n).\n batch.sort(byCreation);\n for (const effect of batch) {\n effect.flags &= ~FLAG_QUEUED;\n if ((effect.flags & FLAG_DISPOSED) !== 0) continue;\n if (effect.pauses > 0) {\n // Paused after it was queued: wait (unqueued) until the owner resumes.\n effect.flags = (effect.flags & ~FLAG_TRANSITION) | FLAG_PARKED;\n continue;\n }\n runQueued(effect);\n }\n return batch.length;\n}\n\nfunction raise(errors: unknown[]): void {\n const [first] = errors;\n if (errors.length === 1) throw first;\n throw new AggregateError(\n errors,\n __DEV__ ? \"Several errors were thrown while flushing effects.\" : \"SHADOW_FLUSH_ERRORS\",\n );\n}\n\n/**\n * Runs every pending effect now: what the scheduled microtask does. Drains the queues until nothing\n * is pending; render effects always run before user effects, parents before children, siblings by\n * creation, and effects woken by a write in the flush run in a following pass. Errors nobody handled\n * are collected and thrown once the queues are empty, so one failing effect never wedges the rest.\n * Does nothing when a flush is already running. Transition-lane effects are not run here: they wait\n * for the lane. Prefer {@link flushSync} in application code.\n *\n * @throws The error of an effect that no error handler caught; several are thrown together as an\n * `AggregateError`.\n * @throws ShadowError `INFINITE_LOOP` when effects keep waking each other for more than 1000 passes:\n * the queued effects are dropped and the flush stops.\n * @example\n * import { flush, writeSignal, type SignalNode } from \"@shadow-js/core/extend\";\n *\n * export function setNow(signal: SignalNode<number>, value: number): void {\n * writeSignal(signal, value);\n * flush(); // the effects that read the signal have run\n * }\n * @see flushSync\n * @since 1.0.0\n */\nexport function flush(): void {\n if (rt.flushing) return;\n rt.flushing = true;\n let passes = 0;\n let runs = 0;\n if (__DEV__) report(DEVTOOLS_EVENT.FLUSH_START, renderQueue.length, userQueue.length);\n try {\n while (hasPending()) {\n // Render effects first, and until none is left; render passes count too: a render effect that\n // keeps writing its own source must abort.\n passes += 1;\n if (passes > MAX_FLUSH_PASSES) {\n clearQueues();\n rt.uncaught.push(new ShadowError(\"INFINITE_LOOP\"));\n break;\n }\n runs += drain(renderQueue.length > 0 ? renderQueue : userQueue);\n }\n } finally {\n rt.flushing = false;\n if (__DEV__) report(DEVTOOLS_EVENT.FLUSH_END, runs);\n }\n const errors = rt.uncaught;\n if (errors.length > 0) {\n rt.uncaught = [];\n raise(errors);\n }\n}\n\n/**\n * Surfaces an error from the microtask flush where nothing can catch it.\n * @internal\n */\nexport function reportUncaught(error: unknown): void {\n if (typeof reportError === \"function\") reportError(error);\n else queueMicrotask(() => Promise.reject(error));\n}\n\nfunction runScheduled(): void {\n microtaskScheduled = false;\n if (!hasPending()) return;\n try {\n flush();\n } catch (error) {\n reportUncaught(error);\n }\n}\n\n/**\n * Requests a flush in a microtask: call it after marking observers stale by hand, as\n * {@link markObservers} does not. Does nothing when a microtask flush is already due, inside a\n * batch or group (which flushes or schedules on exit), during a flush (which picks the work up), or\n * during a transition (its effects wait for the lane). An error thrown by that flush has no caller\n * to reach: it goes to the global `reportError`, or becomes an unhandled promise rejection.\n *\n * @example\n * import { markObservers, schedule, type SourceNode } from \"@shadow-js/core/extend\";\n *\n * export function touch(source: SourceNode): void {\n * markObservers(source);\n * schedule(); // the effects that read `source` run in a microtask\n * }\n * @see notify\n * @since 1.0.0\n */\nexport function schedule(): void {\n // A transition write waits for the lane (scheduled when the effect is queued), never for a microtask.\n if (rt.inTransition || rt.batchDepth > 0 || rt.flushing || microtaskScheduled) return;\n microtaskScheduled = true;\n queueMicrotask(runScheduled);\n}\n\n/**\n * Groups writes like {@link batch} but never flushes synchronously: when the outermost group ends,\n * the effects wait for the microtask (or an enclosing batch / `flushSync`), exactly as after a\n * single signal write. Store setters use it so that one `setStore(...)` behaves like one `set()`;\n * use it for a primitive whose one call makes several writes.\n *\n * @param fn The writes to group. Its throw is rethrown after the group ends.\n * @returns What `fn` returns.\n * @example\n * import { useSignal } from \"@shadow-js/core\";\n * import { group } from \"@shadow-js/core/extend\";\n *\n * const [first, setFirst] = useSignal(\"Ada\");\n * const [last, setLast] = useSignal(\"Lovelace\");\n * group(() => {\n * setFirst(\"Grace\");\n * setLast(\"Hopper\");\n * }); // effects reading both run once, in the next microtask\n * @see batch\n * @since 1.0.0\n */\nexport function group<T>(fn: () => T): T {\n rt.batchDepth += 1;\n try {\n return fn();\n } finally {\n rt.batchDepth -= 1;\n if (rt.batchDepth === 0 && hasPending()) schedule();\n }\n}\n\n/**\n * The body `batch` and `flushSync` share: runs `fn` with the effects deferred, then flushes (always when\n * `sync`, else when this was the outermost batch and no flush is running). A throw of `fn` is held until\n * the flush has run, and thrown with the flush's own error as an `AggregateError` when both threw.\n */\nfunction runBatched<T>(fn: (() => T) | undefined, sync: boolean): T {\n rt.batchDepth += 1;\n let result: T | undefined;\n let failure: unknown;\n let failed = false;\n try {\n result = fn === undefined ? undefined : fn();\n } catch (error) {\n failed = true;\n failure = error;\n } finally {\n rt.batchDepth -= 1;\n }\n if (sync || (rt.batchDepth === 0 && !rt.flushing && hasPending())) {\n try {\n flush();\n } catch (error) {\n if (failed) {\n throw new AggregateError(\n [failure, error],\n __DEV__ ? \"Both the callback and the flush threw.\" : \"SHADOW_BATCH_ERRORS\",\n );\n }\n throw error;\n }\n }\n if (failed) throw failure;\n return result as T;\n}\n\n/**\n * Runs `fn` with effects deferred until the outermost batch ends, then runs them synchronously, so\n * several writes wake each effect once. Reads inside the batch always see fresh values (G-6). Inside\n * a running flush the effects are left to that flush.\n *\n * @param fn The writes to batch.\n * @returns What `fn` returns.\n * @throws What `fn` throws, after the flush. An error of the flush is thrown as {@link flush} throws\n * it (including ShadowError `INFINITE_LOOP`); when `fn` threw as well, both are thrown together as an\n * `AggregateError`.\n * @example\n * import { batch, useSignal } from \"@shadow-js/core\";\n *\n * const [first, setFirst] = useSignal(\"Ada\");\n * const [last, setLast] = useSignal(\"Lovelace\");\n * batch(() => {\n * setFirst(\"Grace\");\n * setLast(\"Hopper\");\n * }); // effects reading both have run once, here\n * @see flushSync\n * @since 1.0.0\n */\nexport function batch<T>(fn: () => T): T {\n return runBatched(fn, false);\n}\n\n/**\n * Runs `fn` (optional) in a batch and runs every pending effect before returning, so the DOM and\n * other effects are up to date on the next line. Use it in tests and before reading layout. Called\n * while a flush is running (from inside an effect), it only runs `fn` and leaves the effects to that\n * flush; development builds warn `FLUSH_IN_EFFECT`.\n *\n * @param fn The writes to make first. Undefined only flushes.\n * @returns What `fn` returns, or undefined without `fn`.\n * @throws What `fn` throws, after the flush. An error of the flush is thrown as {@link flush} throws\n * it (including ShadowError `INFINITE_LOOP`); when `fn` threw as well, both are thrown together as an\n * `AggregateError`.\n * @example\n * import { createRoot, flushSync, useEffect, useSignal } from \"@shadow-js/core\";\n *\n * createRoot(() => {\n * const [count, setCount] = useSignal(0);\n * useEffect(() => console.log(count()));\n * flushSync(); // logs 0\n * flushSync(() => setCount(1)); // logs 1 before this line ends\n * });\n * @see batch\n * @since 1.0.0\n */\nexport function flushSync<T = void>(fn?: () => T): T {\n if (rt.flushing) {\n warn(\"FLUSH_IN_EFFECT\");\n return (fn === undefined ? undefined : fn()) as T;\n }\n return runBatched(fn, true);\n}\n"],"mappings":";;;;;;;;;;;;AAaA,MAAa,mBAAmB;AAEhC,IAAI,qBAAqB;;;;;AAMzB,SAAgB,WAAW,GAAgB,GAAwB;CACjE,OAAO,EAAE,QAAQ,EAAE,SAAS,EAAE,MAAM,EAAE;AACxC;;;;;;AAOA,SAAgB,UAAU,QAA2B;CACnD,IAAI;EACF,IAAI,CAAC,iBAAiB,MAAM,GAAG;EAE/B,IAAI,OAAO,UAAA,GAAiB,UAAU,MAAM;OACvC,kBAAkB,MAAM;CAC/B,SAAS,OAAO;EACd,YAAY,OAAO,MAAM;CAC3B;AACF;;AAGA,SAAS,MAAM,OAA8B;CAC3C,MAAM,QAAQ,MAAM,OAAO,GAAG,MAAM,MAAM;CAE1C,MAAM,KAAK,UAAU;CACrB,KAAK,MAAM,UAAU,OAAO;EAC1B,OAAO,SAAS;EAChB,KAAK,OAAO,QAAA,OAA2B,GAAG;EAC1C,IAAI,OAAO,SAAS,GAAG;GAErB,OAAO,QAAS,OAAO,QAAQ,CAAC,kBAAmB;GACnD;EACF;EACA,UAAU,MAAM;CAClB;CACA,OAAO,MAAM;AACf;AAEA,SAAS,MAAM,QAAyB;CACtC,MAAM,CAAC,SAAS;CAChB,IAAI,OAAO,WAAW,GAAG,MAAM;CAC/B,MAAM,IAAI,eACR,QACU,oDACZ;AACF;;;;;;;;;;;;;;;;;;;;;;;AAwBA,SAAgB,QAAc;CAC5B,IAAI,GAAG,UAAU;CACjB,GAAG,WAAW;CACd,IAAI,SAAS;CACb,IAAI,OAAO;CACE,OAAO,eAAe,aAAa,YAAY,QAAQ,UAAU,MAAM;CACpF,IAAI;EACF,OAAO,WAAW,GAAG;GAGnB,UAAU;GACV,IAAI,SAAA,KAA2B;IAC7B,YAAY;IACZ,GAAG,SAAS,KAAK,IAAI,YAAY,eAAe,CAAC;IACjD;GACF;GACA,QAAQ,MAAM,YAAY,SAAS,IAAI,cAAc,SAAS;EAChE;CACF,UAAU;EACR,GAAG,WAAW;EACD,OAAO,eAAe,WAAW,IAAI;CACpD;CACA,MAAM,SAAS,GAAG;CAClB,IAAI,OAAO,SAAS,GAAG;EACrB,GAAG,WAAW,CAAC;EACf,MAAM,MAAM;CACd;AACF;;;;;AAMA,SAAgB,eAAe,OAAsB;CACnD,IAAI,OAAO,gBAAgB,YAAY,YAAY,KAAK;MACnD,qBAAqB,QAAQ,OAAO,KAAK,CAAC;AACjD;AAEA,SAAS,eAAqB;CAC5B,qBAAqB;CACrB,IAAI,CAAC,WAAW,GAAG;CACnB,IAAI;EACF,MAAM;CACR,SAAS,OAAO;EACd,eAAe,KAAK;CACtB;AACF;;;;;;;;;;;;;;;;;;AAmBA,SAAgB,WAAiB;CAE/B,IAAI,GAAG,gBAAgB,GAAG,aAAa,KAAK,GAAG,YAAY,oBAAoB;CAC/E,qBAAqB;CACrB,eAAe,YAAY;AAC7B;;;;;;;;;;;;;;;;;;;;;;AAuBA,SAAgB,MAAS,IAAgB;CACvC,GAAG,cAAc;CACjB,IAAI;EACF,OAAO,GAAG;CACZ,UAAU;EACR,GAAG,cAAc;EACjB,IAAI,GAAG,eAAe,KAAK,WAAW,GAAG,SAAS;CACpD;AACF;;;;;;AAOA,SAAS,WAAc,IAA2B,MAAkB;CAClE,GAAG,cAAc;CACjB,IAAI;CACJ,IAAI;CACJ,IAAI,SAAS;CACb,IAAI;EACF,SAAS,OAAO,KAAA,IAAY,KAAA,IAAY,GAAG;CAC7C,SAAS,OAAO;EACd,SAAS;EACT,UAAU;CACZ,UAAU;EACR,GAAG,cAAc;CACnB;CACA,IAAI,QAAS,GAAG,eAAe,KAAK,CAAC,GAAG,YAAY,WAAW,GAC7D,IAAI;EACF,MAAM;CACR,SAAS,OAAO;EACd,IAAI,QACF,MAAM,IAAI,eACR,CAAC,SAAS,KAAK,GACL,wCACZ;EAEF,MAAM;CACR;CAEF,IAAI,QAAQ,MAAM;CAClB,OAAO;AACT;;;;;;;;;;;;;;;;;;;;;;;AAwBA,SAAgB,MAAS,IAAgB;CACvC,OAAO,WAAW,IAAI,KAAK;AAC7B;;;;;;;;;;;;;;;;;;;;;;;;AAyBA,SAAgB,UAAoB,IAAiB;CACnD,IAAI,GAAG,UAAU;EACf,KAAK,iBAAiB;EACtB,OAAQ,OAAO,KAAA,IAAY,KAAA,IAAY,GAAG;CAC5C;CACA,OAAO,WAAW,IAAI,IAAI;AAC5B"}
|
|
1
|
+
{"version":3,"file":"scheduler.js","names":[],"sources":["../../../src/internal/scheduler.ts"],"sourcesContent":["import { DEVTOOLS_EVENT, report } from \"./devtools\";\nimport { ShadowError, warn } from \"./diagnostics\";\nimport { DIRTY, FLAG_DISPOSED, FLAG_PARKED, FLAG_QUEUED, FLAG_TRANSITION } from \"./flags\";\nimport type { Computation } from \"./graph\";\nimport { recompute, refreshAncestors, updateIfNecessary } from \"./graph\";\nimport { handleError } from \"./owner\";\nimport { clearQueues, hasPending, renderQueue, userQueue } from \"./queue\";\nimport { rt } from \"./state\";\n\n/**\n * Flush passes allowed before the loop guard aborts (R-CODE-12).\n * @internal\n */\nexport const MAX_FLUSH_PASSES = 1000;\n\nlet microtaskScheduled = false;\n\n/**\n * Sort order of queued effects: parents before children (by depth), siblings by creation (G-16).\n * @internal\n */\nexport function byCreation(a: Computation, b: Computation): number {\n return a.depth - b.depth || a.seq - b.seq;\n}\n\n/**\n * Runs one queued effect. Its stale owners come first: an owner that is about to re-run disposes the\n * effect, and running it before (a zombie, G-17) would read state that is already out of date.\n * @internal\n */\nexport function runQueued(effect: Computation): void {\n try {\n if (!refreshAncestors(effect)) return;\n // A directly dirtied effect needs no source verification: skip the frame machinery.\n if (effect.state === DIRTY) recompute(effect);\n else updateIfNecessary(effect);\n } catch (error) {\n handleError(error, effect);\n }\n}\n\n/** Runs every queued effect of one phase, parents before children, siblings by creation. */\nfunction drain(queue: Computation[]): number {\n const batch = queue.splice(0, queue.length);\n // Effects mostly arrive in creation order already: the sort then finds one ascending run and is O(n).\n batch.sort(byCreation);\n for (const effect of batch) {\n effect.flags &= ~FLAG_QUEUED;\n if ((effect.flags & FLAG_DISPOSED) !== 0) continue;\n if (effect.pauses > 0) {\n // Paused after it was queued: wait (unqueued) until the owner resumes.\n effect.flags = (effect.flags & ~FLAG_TRANSITION) | FLAG_PARKED;\n continue;\n }\n runQueued(effect);\n }\n return batch.length;\n}\n\nfunction raise(errors: unknown[]): void {\n const [first] = errors;\n if (errors.length === 1) throw first;\n throw new AggregateError(\n errors,\n __DEV__ ? \"Several errors were thrown while flushing effects.\" : \"SHADOW_FLUSH_ERRORS\",\n );\n}\n\n/**\n * Runs every pending effect now: what the scheduled microtask does. Drains the queues until nothing\n * is pending; render effects always run before user effects, parents before children, siblings by\n * creation, and effects woken by a write in the flush run in a following pass. Errors nobody handled\n * are collected and thrown once the queues are empty, so one failing effect never wedges the rest.\n * Does nothing when a flush is already running. Transition-lane effects are not run here: they wait\n * for the lane. Prefer {@link flushSync} in application code.\n *\n * @throws The error of an effect that no error handler caught; several are thrown together as an\n * `AggregateError`.\n * @throws ShadowError `INFINITE_LOOP` when effects keep waking each other for more than 1000 passes:\n * the queued effects are dropped and the flush stops.\n * @example\n * import { flush, writeSignal, type SignalNode } from \"@shadow-js/core/extend\";\n *\n * export function setNow(signal: SignalNode<number>, value: number): void {\n * writeSignal(signal, value);\n * flush(); // the effects that read the signal have run\n * }\n * @see flushSync\n * @since 1.0.0\n */\nexport function flush(): void {\n if (rt.flushing) return;\n rt.flushing = true;\n let passes = 0;\n let runs = 0;\n if (__DEV__) report(DEVTOOLS_EVENT.FLUSH_START, renderQueue.length, userQueue.length);\n try {\n while (hasPending()) {\n // Render effects first, and until none is left; render passes count too: a render effect that\n // keeps writing its own source must abort.\n passes += 1;\n if (passes > MAX_FLUSH_PASSES) {\n clearQueues();\n rt.uncaught.push(new ShadowError(\"INFINITE_LOOP\"));\n break;\n }\n const ran = drain(renderQueue.length > 0 ? renderQueue : userQueue);\n if (__DEV__) runs += ran;\n }\n } finally {\n rt.flushing = false;\n if (__DEV__) report(DEVTOOLS_EVENT.FLUSH_END, runs);\n }\n const errors = rt.uncaught;\n if (errors.length > 0) {\n rt.uncaught = [];\n raise(errors);\n }\n}\n\n/**\n * Surfaces an error from the microtask flush where nothing can catch it.\n * @internal\n */\nexport function reportUncaught(error: unknown): void {\n if (typeof reportError === \"function\") reportError(error);\n else queueMicrotask(() => Promise.reject(error));\n}\n\nfunction runScheduled(): void {\n microtaskScheduled = false;\n if (!hasPending()) return;\n try {\n flush();\n } catch (error) {\n reportUncaught(error);\n }\n}\n\n/**\n * Requests a flush in a microtask: call it after marking observers stale by hand, as\n * {@link markObservers} does not. Does nothing when a microtask flush is already due, inside a\n * batch or group (which flushes or schedules on exit), during a flush (which picks the work up), or\n * during a transition (its effects wait for the lane). An error thrown by that flush has no caller\n * to reach: it goes to the global `reportError`, or becomes an unhandled promise rejection.\n *\n * @example\n * import { markObservers, schedule, type SourceNode } from \"@shadow-js/core/extend\";\n *\n * export function touch(source: SourceNode): void {\n * markObservers(source);\n * schedule(); // the effects that read `source` run in a microtask\n * }\n * @see notify\n * @since 1.0.0\n */\nexport function schedule(): void {\n // A transition write waits for the lane (scheduled when the effect is queued), never for a microtask.\n if (rt.inTransition || rt.batches > 0 || rt.flushing || microtaskScheduled) return;\n microtaskScheduled = true;\n queueMicrotask(runScheduled);\n}\n\n/**\n * Groups writes like {@link batch} but never flushes synchronously: when the outermost group ends,\n * the effects wait for the microtask (or an enclosing batch / `flushSync`), exactly as after a\n * single signal write. Store setters use it so that one `setStore(...)` behaves like one `set()`;\n * use it for a primitive whose one call makes several writes.\n *\n * @param fn The writes to group. Its throw is rethrown after the group ends.\n * @returns What `fn` returns.\n * @example\n * import { useSignal } from \"@shadow-js/core\";\n * import { group } from \"@shadow-js/core/extend\";\n *\n * const [first, setFirst] = useSignal(\"Ada\");\n * const [last, setLast] = useSignal(\"Lovelace\");\n * group(() => {\n * setFirst(\"Grace\");\n * setLast(\"Hopper\");\n * }); // effects reading both run once, in the next microtask\n * @see batch\n * @since 1.0.0\n */\nexport function group<T>(fn: () => T): T {\n rt.batches += 1;\n try {\n return fn();\n } finally {\n rt.batches -= 1;\n if (rt.batches === 0 && hasPending()) schedule();\n }\n}\n\n/**\n * Flushes when `wanted`, then rethrows `failure` when `failed`. A failing flush is thrown on its own, or\n * together with `failure` (an `AggregateError` with `message`) when both threw.\n * @internal\n */\nexport function flushThenThrow(\n wanted: boolean,\n failed: boolean,\n failure: unknown,\n message: string,\n): void {\n if (wanted) {\n try {\n flush();\n } catch (error) {\n if (!failed) throw error;\n throw new AggregateError([failure, error], message);\n }\n }\n if (failed) throw failure;\n}\n\n/**\n * The body `batch` and `flushSync` share: runs `fn` with the effects deferred, then flushes (always when\n * `sync`, else when this was the outermost batch and no flush is running). A throw of `fn` is held until\n * the flush has run, and thrown with the flush's own error as an `AggregateError` when both threw.\n */\nfunction runBatched<T>(fn: (() => T) | undefined, sync: boolean): T {\n rt.batches += 1;\n let result: T | undefined;\n let failure: unknown;\n let failed = false;\n try {\n result = fn === undefined ? undefined : fn();\n } catch (error) {\n failed = true;\n failure = error;\n } finally {\n rt.batches -= 1;\n }\n flushThenThrow(\n sync || (rt.batches === 0 && !rt.flushing && hasPending()),\n failed,\n failure,\n __DEV__ ? \"Both the callback and the flush threw.\" : \"SHADOW_BATCH_ERRORS\",\n );\n return result as T;\n}\n\n/**\n * Runs `fn` with effects deferred until the outermost batch ends, then runs them synchronously, so\n * several writes wake each effect once. Reads inside the batch always see fresh values (G-6). Inside\n * a running flush the effects are left to that flush.\n *\n * @param fn The writes to batch.\n * @returns What `fn` returns.\n * @throws What `fn` throws, after the flush. An error of the flush is thrown as {@link flush} throws\n * it (including ShadowError `INFINITE_LOOP`); when `fn` threw as well, both are thrown together as an\n * `AggregateError`.\n * @example\n * import { batch, useSignal } from \"@shadow-js/core\";\n *\n * const [first, setFirst] = useSignal(\"Ada\");\n * const [last, setLast] = useSignal(\"Lovelace\");\n * batch(() => {\n * setFirst(\"Grace\");\n * setLast(\"Hopper\");\n * }); // effects reading both have run once, here\n * @see flushSync\n * @since 1.0.0\n */\nexport function batch<T>(fn: () => T): T {\n return runBatched(fn, false);\n}\n\n/**\n * Runs `fn` (optional) in a batch and runs every pending effect before returning, so the DOM and\n * other effects are up to date on the next line. Use it in tests and before reading layout. Called\n * while a flush is running (from inside an effect), it only runs `fn` and leaves the effects to that\n * flush; development builds warn `FLUSH_IN_EFFECT`.\n *\n * @param fn The writes to make first. Undefined only flushes.\n * @returns What `fn` returns, or undefined without `fn`.\n * @throws What `fn` throws, after the flush. An error of the flush is thrown as {@link flush} throws\n * it (including ShadowError `INFINITE_LOOP`); when `fn` threw as well, both are thrown together as an\n * `AggregateError`.\n * @example\n * import { createRoot, flushSync, useEffect, useSignal } from \"@shadow-js/core\";\n *\n * createRoot(() => {\n * const [count, setCount] = useSignal(0);\n * useEffect(() => console.log(count()));\n * flushSync(); // logs 0\n * flushSync(() => setCount(1)); // logs 1 before this line ends\n * });\n * @see batch\n * @since 1.0.0\n */\nexport function flushSync<T = void>(fn?: () => T): T {\n if (rt.flushing) {\n warn(\"FLUSH_IN_EFFECT\");\n return (fn === undefined ? undefined : fn()) as T;\n }\n return runBatched(fn, true);\n}\n"],"mappings":";;;;;;;;;;;;AAaA,MAAa,mBAAmB;AAEhC,IAAI,qBAAqB;;;;;AAMzB,SAAgB,WAAW,GAAgB,GAAwB;CACjE,OAAO,EAAE,QAAQ,EAAE,SAAS,EAAE,MAAM,EAAE;AACxC;;;;;;AAOA,SAAgB,UAAU,QAA2B;CACnD,IAAI;EACF,IAAI,CAAC,iBAAiB,MAAM,GAAG;EAE/B,IAAI,OAAO,UAAA,GAAiB,UAAU,MAAM;OACvC,kBAAkB,MAAM;CAC/B,SAAS,OAAO;EACd,YAAY,OAAO,MAAM;CAC3B;AACF;;AAGA,SAAS,MAAM,OAA8B;CAC3C,MAAM,QAAQ,MAAM,OAAO,GAAG,MAAM,MAAM;CAE1C,MAAM,KAAK,UAAU;CACrB,KAAK,MAAM,UAAU,OAAO;EAC1B,OAAO,SAAS;EAChB,KAAK,OAAO,QAAA,OAA2B,GAAG;EAC1C,IAAI,OAAO,SAAS,GAAG;GAErB,OAAO,QAAS,OAAO,QAAQ,CAAC,kBAAmB;GACnD;EACF;EACA,UAAU,MAAM;CAClB;CACA,OAAO,MAAM;AACf;AAEA,SAAS,MAAM,QAAyB;CACtC,MAAM,CAAC,SAAS;CAChB,IAAI,OAAO,WAAW,GAAG,MAAM;CAC/B,MAAM,IAAI,eACR,QACU,oDACZ;AACF;;;;;;;;;;;;;;;;;;;;;;;AAwBA,SAAgB,QAAc;CAC5B,IAAI,GAAG,UAAU;CACjB,GAAG,WAAW;CACd,IAAI,SAAS;CACb,IAAI,OAAO;CACE,OAAO,eAAe,aAAa,YAAY,QAAQ,UAAU,MAAM;CACpF,IAAI;EACF,OAAO,WAAW,GAAG;GAGnB,UAAU;GACV,IAAI,SAAA,KAA2B;IAC7B,YAAY;IACZ,GAAG,SAAS,KAAK,IAAI,YAAY,eAAe,CAAC;IACjD;GACF;GACA,MAAM,MAAM,MAAM,YAAY,SAAS,IAAI,cAAc,SAAS;GACrD,QAAQ;EACvB;CACF,UAAU;EACR,GAAG,WAAW;EACD,OAAO,eAAe,WAAW,IAAI;CACpD;CACA,MAAM,SAAS,GAAG;CAClB,IAAI,OAAO,SAAS,GAAG;EACrB,GAAG,WAAW,CAAC;EACf,MAAM,MAAM;CACd;AACF;;;;;AAMA,SAAgB,eAAe,OAAsB;CACnD,IAAI,OAAO,gBAAgB,YAAY,YAAY,KAAK;MACnD,qBAAqB,QAAQ,OAAO,KAAK,CAAC;AACjD;AAEA,SAAS,eAAqB;CAC5B,qBAAqB;CACrB,IAAI,CAAC,WAAW,GAAG;CACnB,IAAI;EACF,MAAM;CACR,SAAS,OAAO;EACd,eAAe,KAAK;CACtB;AACF;;;;;;;;;;;;;;;;;;AAmBA,SAAgB,WAAiB;CAE/B,IAAI,GAAG,gBAAgB,GAAG,UAAU,KAAK,GAAG,YAAY,oBAAoB;CAC5E,qBAAqB;CACrB,eAAe,YAAY;AAC7B;;;;;;;;;;;;;;;;;;;;;;AAuBA,SAAgB,MAAS,IAAgB;CACvC,GAAG,WAAW;CACd,IAAI;EACF,OAAO,GAAG;CACZ,UAAU;EACR,GAAG,WAAW;EACd,IAAI,GAAG,YAAY,KAAK,WAAW,GAAG,SAAS;CACjD;AACF;;;;;;AAOA,SAAgB,eACd,QACA,QACA,SACA,SACM;CACN,IAAI,QACF,IAAI;EACF,MAAM;CACR,SAAS,OAAO;EACd,IAAI,CAAC,QAAQ,MAAM;EACnB,MAAM,IAAI,eAAe,CAAC,SAAS,KAAK,GAAG,OAAO;CACpD;CAEF,IAAI,QAAQ,MAAM;AACpB;;;;;;AAOA,SAAS,WAAc,IAA2B,MAAkB;CAClE,GAAG,WAAW;CACd,IAAI;CACJ,IAAI;CACJ,IAAI,SAAS;CACb,IAAI;EACF,SAAS,OAAO,KAAA,IAAY,KAAA,IAAY,GAAG;CAC7C,SAAS,OAAO;EACd,SAAS;EACT,UAAU;CACZ,UAAU;EACR,GAAG,WAAW;CAChB;CACA,eACE,QAAS,GAAG,YAAY,KAAK,CAAC,GAAG,YAAY,WAAW,GACxD,QACA,SACU,wCACZ;CACA,OAAO;AACT;;;;;;;;;;;;;;;;;;;;;;;AAwBA,SAAgB,MAAS,IAAgB;CACvC,OAAO,WAAW,IAAI,KAAK;AAC7B;;;;;;;;;;;;;;;;;;;;;;;;AAyBA,SAAgB,UAAoB,IAAiB;CACnD,IAAI,GAAG,UAAU;EACf,KAAK,iBAAiB;EACtB,OAAQ,OAAO,KAAA,IAAY,KAAA,IAAY,GAAG;CAC5C;CACA,OAAO,WAAW,IAAI,IAAI;AAC5B"}
|
|
@@ -1,5 +1,5 @@
|
|
|
1
|
-
import { Owner } from "./owner.js";
|
|
2
1
|
import { Computation } from "./graph.js";
|
|
2
|
+
import { Owner } from "./owner.js";
|
|
3
3
|
/**
|
|
4
4
|
* A hold for a value a transition builds while its reads wait for data (a `Show` branch built during a
|
|
5
5
|
* transition): the reads that wait count against this hold, not against the Suspense boundary around
|
|
@@ -2,14 +2,18 @@
|
|
|
2
2
|
/**
|
|
3
3
|
* The runtime registers (R-CODE-4): the only module-level mutable state of core besides
|
|
4
4
|
* monotonic counters. Every write is paired with a `finally` restore (R-CODE-5).
|
|
5
|
+
*
|
|
6
|
+
* Not a public symbol: `core/extend` re-exports only the types of this module, and the registers stay
|
|
7
|
+
* behind the extension functions (`currentOwner`, `untrack` and friends) so a plugin cannot leave one set.
|
|
8
|
+
* @internal
|
|
5
9
|
*/
|
|
6
10
|
const rt = {
|
|
7
11
|
owner: null,
|
|
8
12
|
listener: null,
|
|
9
13
|
running: null,
|
|
10
|
-
|
|
14
|
+
batches: 0,
|
|
11
15
|
flushing: false,
|
|
12
|
-
|
|
16
|
+
nesting: 0,
|
|
13
17
|
disposing: 0,
|
|
14
18
|
uncaught: [],
|
|
15
19
|
inTransition: false,
|
|
@@ -17,7 +21,11 @@ const rt = {
|
|
|
17
21
|
hooks: null
|
|
18
22
|
};
|
|
19
23
|
let counter = 0;
|
|
20
|
-
/**
|
|
24
|
+
/**
|
|
25
|
+
* Monotonic creation sequence; orders sibling effects (G-16). Not a public symbol: only the engine
|
|
26
|
+
* stamps nodes with it.
|
|
27
|
+
* @internal
|
|
28
|
+
*/
|
|
21
29
|
function nextSequence() {
|
|
22
30
|
counter += 1;
|
|
23
31
|
return counter;
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"state.js","names":[],"sources":["../../../src/internal/state.ts"],"sourcesContent":["import type { Computation } from \"./graph\";\nimport type { Owner } from \"./owner\";\n\n/**\n * A hold for a value a transition builds while its reads wait for data (a `Show` branch built during a\n * transition): the reads that wait count against this hold, not against the Suspense boundary around\n * the value, so the shown value stays until the hold settles. Created by `createTransitionHold`.\n * @since 1.0.0\n */\nexport interface TransitionHold {\n /** Runs `fn` with this hold as the Suspense boundary of the reads inside it. */\n run<T>(fn: () => T): T;\n /** Reads still waiting for data. */\n count(): number;\n /** True once a read in the hold was held (the value is then pending, not ready). */\n engaged(): boolean;\n /** Ends the hold without waking anything (the value is being dropped). */\n drop(): void;\n}\n\n/**\n * The choice a branch slot (Show, Switch) shows: its index, and what decides a rebuild. Renderers\n * extend it with what they need to build the branch.\n * @since 1.0.0\n */\nexport interface SlotChoice {\n /** Which branch is chosen: its position among the slot's branches, or the renderer's fallback index. */\n readonly index: number;\n /** True when the branch is rebuilt whenever `when` changes identity; false when only `index` counts. */\n readonly keyed: boolean;\n /** The condition value that selected the branch. */\n readonly when: unknown;\n}\n\n/**\n * The record of a branch's owner that its accessors read: the value and whether it is being torn down.\n * @since 1.0.0\n */\nexport interface SlotOwned {\n /** The index of the branch this record belongs to (see {@link SlotChoice.index}). */\n index: number;\n /** The latest condition value while the branch is shown; what its accessor returns during teardown. */\n value: unknown;\n /** True while the branch is torn down: its accessor then returns `value` instead of throwing. */\n disposing: boolean;\n}\n\n/**\n * A branch a slot shows, or builds during a transition. A branch without `dispose` is torn down by its memo.\n * @since 1.0.0\n */\nexport interface SlotBranch<C extends SlotChoice> {\n /** The choice the branch was built for. */\n readonly choice: C;\n /** The record its accessors read. */\n readonly owned: SlotOwned;\n /** What the branch produced: the value the slot's output returns while the branch is shown. */\n readonly result: unknown;\n /**\n * Tears the branch down. Set for the branches a transition built: they live under the holder, not\n * under the memo.\n * @default undefined (the slot's memo tears the branch down)\n */\n readonly dispose?: () => void;\n /**\n * The hold a transition built the branch under; null when none of its reads was held.\n * @default undefined (a memo-owned branch has no hold)\n */\n readonly hold?: TransitionHold | null;\n}\n\n/**\n * What a slot's output memo keeps: the branch on screen (its result is the value the output returns).\n * @since 1.0.0\n */\nexport interface SlotState<C extends SlotChoice> {\n /** The branch on screen, or undefined before the first build and while the memo rebuilds it. */\n live: SlotBranch<C> | undefined;\n}\n\n/**\n * The transition layer of one slot, from `transitionHooks()?.slotSwap(...)`: it keeps the shown\n * branch while a transition builds the next one (see `slotSwap` in concurrency.ts).\n * @since 1.0.0\n */\nexport interface SlotSwap<C extends SlotChoice> {\n /**\n * Runs one pass of the slot's memo for `choice`. True when a transition keeps the shown value. False\n * when the usual path follows: the branch on screen has been retired and `state.live` is cleared.\n */\n step(choice: C): boolean;\n}\n\n/**\n * The hold of one Suspense boundary: engaged by a transition read, released when its data arrived.\n * From `transitionHooks()?.boundaryHold()`.\n * @since 1.0.0\n */\nexport interface BoundaryHold {\n /** Engages the hold (a second call changes nothing) so the boundary keeps its content; returns true. */\n engage(): boolean;\n /** When engaged: wakes the readers that waited, then ends the hold. Otherwise does nothing. */\n release(): void;\n /** True while the hold is engaged. */\n holding(): boolean;\n}\n\n/**\n * The transition machinery the engine calls through `rt.hooks`: transition lanes, pauses (Activity)\n * and suspensions (Suspense holds). It is created by the first call of an API that needs it (see\n * concurrency.ts), so an application that never calls one of those APIs carries none of their code.\n * Renderers reach it through `transitionHooks()`.\n * @since 1.0.0\n */\nexport interface Hooks {\n /** The transition layer of one branch slot (see `slotSwap` in concurrency.ts). */\n slotSwap<C extends SlotChoice>(\n state: SlotState<C>,\n build: (choice: C, owned: SlotOwned, eager: boolean) => unknown,\n same: (a: C, b: C) => boolean,\n parent: Owner | null,\n ): SlotSwap<C>;\n /** A Suspense boundary's hold (see `boundaryHold` in concurrency.ts). */\n boundaryHold(): BoundaryHold;\n /** Queues an effect that is due in the transition lane, or parks it while its owner is paused. */\n place(effect: Computation, inLane: boolean): void;\n /** An urgent write reached an effect that waits in the lane or is parked: it moves to the urgent queue. */\n promote(effect: Computation): void;\n /** Forgets the lane queues (the flush loop guard). */\n clear(): void;\n /** Keeps `node` for a transition when `error` is a suspension; returns false for any other error. */\n suspend(node: Computation, error: unknown): boolean;\n /** The engine side of `holdReader`: throws the suspension sentinel when `tracker.hold()` is true. */\n holdReader(tracker: { hold?(): boolean }): void;\n /** The engine side of `startTransition` in the browser. */\n startTransition(fn: () => void): Promise<void>;\n /** The engine side of `beginHold`: counts one more Suspense hold. */\n beginHold(): void;\n /** The engine side of `endHold`: counts one hold less and settles the lane. */\n endHold(): void;\n /** The engine side of `wakeSuspended`. */\n wakeSuspended(): void;\n /** The engine side of `pauseOwner`. */\n pause(owner: Owner): void;\n /** The engine side of `resumeOwner`. */\n resume(owner: Owner): void;\n /** The engine side of `createTransitionHold`. */\n createHold(onSettled: () => void): TransitionHold;\n}\n\n/**\n * The runtime registers (R-CODE-4): the only module-level mutable state of core besides\n * monotonic counters. Every write is paired with a `finally` restore (R-CODE-5).\n */\nexport const rt: {\n /** Owner that adopts newly created nodes. */\n owner: Owner | null;\n /** Computation that records the signals it reads; null while untracked. */\n listener: Computation | null;\n /** Computation currently executing, tracked or not (used by the write-in-memo guard). */\n running: Computation | null;\n /** Nesting depth of batch()/flushSync() calls. */\n
|
|
1
|
+
{"version":3,"file":"state.js","names":[],"sources":["../../../src/internal/state.ts"],"sourcesContent":["import type { Computation } from \"./graph\";\nimport type { Owner } from \"./owner\";\n\n/**\n * A hold for a value a transition builds while its reads wait for data (a `Show` branch built during a\n * transition): the reads that wait count against this hold, not against the Suspense boundary around\n * the value, so the shown value stays until the hold settles. Created by `createTransitionHold`.\n * @since 1.0.0\n */\nexport interface TransitionHold {\n /** Runs `fn` with this hold as the Suspense boundary of the reads inside it. */\n run<T>(fn: () => T): T;\n /** Reads still waiting for data. */\n count(): number;\n /** True once a read in the hold was held (the value is then pending, not ready). */\n engaged(): boolean;\n /** Ends the hold without waking anything (the value is being dropped). */\n drop(): void;\n}\n\n/**\n * The choice a branch slot (Show, Switch) shows: its index, and what decides a rebuild. Renderers\n * extend it with what they need to build the branch.\n * @since 1.0.0\n */\nexport interface SlotChoice {\n /** Which branch is chosen: its position among the slot's branches, or the renderer's fallback index. */\n readonly index: number;\n /** True when the branch is rebuilt whenever `when` changes identity; false when only `index` counts. */\n readonly keyed: boolean;\n /** The condition value that selected the branch. */\n readonly when: unknown;\n}\n\n/**\n * The record of a branch's owner that its accessors read: the value and whether it is being torn down.\n * @since 1.0.0\n */\nexport interface SlotOwned {\n /** The index of the branch this record belongs to (see {@link SlotChoice.index}). */\n index: number;\n /** The latest condition value while the branch is shown; what its accessor returns during teardown. */\n value: unknown;\n /** True while the branch is torn down: its accessor then returns `value` instead of throwing. */\n disposing: boolean;\n}\n\n/**\n * A branch a slot shows, or builds during a transition. A branch without `dispose` is torn down by its memo.\n * @since 1.0.0\n */\nexport interface SlotBranch<C extends SlotChoice> {\n /** The choice the branch was built for. */\n readonly choice: C;\n /** The record its accessors read. */\n readonly owned: SlotOwned;\n /** What the branch produced: the value the slot's output returns while the branch is shown. */\n readonly result: unknown;\n /**\n * Tears the branch down. Set for the branches a transition built: they live under the holder, not\n * under the memo.\n * @default undefined (the slot's memo tears the branch down)\n */\n readonly dispose?: () => void;\n /**\n * The hold a transition built the branch under; null when none of its reads was held.\n * @default undefined (a memo-owned branch has no hold)\n */\n readonly hold?: TransitionHold | null;\n}\n\n/**\n * What a slot's output memo keeps: the branch on screen (its result is the value the output returns).\n * @since 1.0.0\n */\nexport interface SlotState<C extends SlotChoice> {\n /** The branch on screen, or undefined before the first build and while the memo rebuilds it. */\n live: SlotBranch<C> | undefined;\n}\n\n/**\n * The transition layer of one slot, from `transitionHooks()?.slotSwap(...)`: it keeps the shown\n * branch while a transition builds the next one (see `slotSwap` in concurrency.ts).\n * @since 1.0.0\n */\nexport interface SlotSwap<C extends SlotChoice> {\n /**\n * Runs one pass of the slot's memo for `choice`. True when a transition keeps the shown value. False\n * when the usual path follows: the branch on screen has been retired and `state.live` is cleared.\n */\n step(choice: C): boolean;\n}\n\n/**\n * The hold of one Suspense boundary: engaged by a transition read, released when its data arrived.\n * From `transitionHooks()?.boundaryHold()`.\n * @since 1.0.0\n */\nexport interface BoundaryHold {\n /** Engages the hold (a second call changes nothing) so the boundary keeps its content; returns true. */\n engage(): boolean;\n /** When engaged: wakes the readers that waited, then ends the hold. Otherwise does nothing. */\n release(): void;\n /** True while the hold is engaged. */\n holding(): boolean;\n}\n\n/**\n * The transition machinery the engine calls through `rt.hooks`: transition lanes, pauses (Activity)\n * and suspensions (Suspense holds). It is created by the first call of an API that needs it (see\n * concurrency.ts), so an application that never calls one of those APIs carries none of their code.\n * Renderers reach it through `transitionHooks()`.\n * @since 1.0.0\n */\nexport interface Hooks {\n /** The transition layer of one branch slot (see `slotSwap` in concurrency.ts). */\n slotSwap<C extends SlotChoice>(\n state: SlotState<C>,\n build: (choice: C, owned: SlotOwned, eager: boolean) => unknown,\n same: (a: C, b: C) => boolean,\n parent: Owner | null,\n ): SlotSwap<C>;\n /** A Suspense boundary's hold (see `boundaryHold` in concurrency.ts). */\n boundaryHold(): BoundaryHold;\n /** Queues an effect that is due in the transition lane, or parks it while its owner is paused. */\n place(effect: Computation, inLane: boolean): void;\n /** An urgent write reached an effect that waits in the lane or is parked: it moves to the urgent queue. */\n promote(effect: Computation): void;\n /** Forgets the lane queues (the flush loop guard). */\n clear(): void;\n /** Keeps `node` for a transition when `error` is a suspension; returns false for any other error. */\n suspend(node: Computation, error: unknown): boolean;\n /** The engine side of `holdReader`: throws the suspension sentinel when `tracker.hold()` is true. */\n holdReader(tracker: { hold?(): boolean }): void;\n /** The engine side of `startTransition` in the browser. */\n startTransition(fn: () => void): Promise<void>;\n /** The engine side of `beginHold`: counts one more Suspense hold. */\n beginHold(): void;\n /** The engine side of `endHold`: counts one hold less and settles the lane. */\n endHold(): void;\n /** The engine side of `wakeSuspended`. */\n wakeSuspended(): void;\n /** The engine side of `pauseOwner`. */\n pause(owner: Owner): void;\n /** The engine side of `resumeOwner`. */\n resume(owner: Owner): void;\n /** The engine side of `createTransitionHold`. */\n createHold(onSettled: () => void): TransitionHold;\n}\n\n/**\n * The runtime registers (R-CODE-4): the only module-level mutable state of core besides\n * monotonic counters. Every write is paired with a `finally` restore (R-CODE-5).\n *\n * Not a public symbol: `core/extend` re-exports only the types of this module, and the registers stay\n * behind the extension functions (`currentOwner`, `untrack` and friends) so a plugin cannot leave one set.\n * @internal\n */\nexport const rt: {\n /** Owner that adopts newly created nodes. */\n owner: Owner | null;\n /** Computation that records the signals it reads; null while untracked. */\n listener: Computation | null;\n /** Computation currently executing, tracked or not (used by the write-in-memo guard). */\n running: Computation | null;\n /** Nesting depth of batch()/flushSync() calls. */\n batches: number;\n /** True while the flush loop is draining the effect queues. */\n flushing: boolean;\n /** Nesting depth of memo recomputation, used to switch to iterative pulls. */\n nesting: number;\n /** Nesting depth of disposals in progress; errors raised meanwhile are collected, not thrown. */\n disposing: number;\n /** Errors nobody handled during the current flush or disposal; rethrown once it completes. */\n uncaught: unknown[];\n /** True while a transition callback or a transition-lane run is active: writes made now join the lane. */\n inTransition: boolean;\n /** True while `hydrate()` claims server markup (useExternalStore reads its server snapshot). */\n hydrating: boolean;\n /** The transition machinery, or null until an API that needs it is first called. */\n hooks: Hooks | null;\n} = {\n owner: null,\n listener: null,\n running: null,\n batches: 0,\n flushing: false,\n nesting: 0,\n disposing: 0,\n uncaught: [],\n inTransition: false,\n hydrating: false,\n hooks: null,\n};\n\nlet counter = 0;\n/**\n * Monotonic creation sequence; orders sibling effects (G-16). Not a public symbol: only the engine\n * stamps nodes with it.\n * @internal\n */\nexport function nextSequence(): number {\n counter += 1;\n return counter;\n}\n"],"mappings":";;;;;;;;;AA8JA,MAAa,KAuBT;CACF,OAAO;CACP,UAAU;CACV,SAAS;CACT,SAAS;CACT,UAAU;CACV,SAAS;CACT,WAAW;CACX,UAAU,CAAC;CACX,cAAc;CACd,WAAW;CACX,OAAO;AACT;AAEA,IAAI,UAAU;;;;;;AAMd,SAAgB,eAAuB;CACrC,WAAW;CACX,OAAO;AACT"}
|
package/dist/dev/list.js
CHANGED
|
@@ -1,10 +1,10 @@
|
|
|
1
1
|
import { warn } from "./internal/diagnostics.js";
|
|
2
2
|
import { Owner } from "./internal/owner.js";
|
|
3
3
|
import { Signal, readSignal } from "./internal/graph.js";
|
|
4
|
-
import { createRoot, getOwner, onCleanup, runWithOwner, untrack } from "./ownership.js";
|
|
5
|
-
import { disposeTree } from "./internal/dispose.js";
|
|
6
4
|
import { writeSignal } from "./extend/index.js";
|
|
5
|
+
import { disposeTree } from "./internal/dispose.js";
|
|
7
6
|
import { useMemo } from "./memo.js";
|
|
7
|
+
import { createRoot, getOwner, onCleanup, runWithOwner, untrack } from "./ownership.js";
|
|
8
8
|
// src/list.ts
|
|
9
9
|
/**
|
|
10
10
|
* One mapped row: its own root, its mapped value, and the signals behind `item()` and `index()`. The signals are created
|
package/dist/dev/optimistic.js
CHANGED
package/dist/dev/ownership.js
CHANGED
|
@@ -109,10 +109,15 @@ function createRoot(fn, options) {
|
|
|
109
109
|
if (detached) root.context = current === null ? null : current.context;
|
|
110
110
|
listRoot(root);
|
|
111
111
|
try {
|
|
112
|
-
|
|
112
|
+
const result = runInScope({
|
|
113
113
|
owner: root,
|
|
114
114
|
listener: null
|
|
115
115
|
}, () => fn(() => disposeTree(root)));
|
|
116
|
+
if (root.disposed) {
|
|
117
|
+
disposeTree(root);
|
|
118
|
+
root.runCleanups();
|
|
119
|
+
}
|
|
120
|
+
return result;
|
|
116
121
|
} catch (error) {
|
|
117
122
|
try {
|
|
118
123
|
disposeTree(root);
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"ownership.js","names":["disposeOwner"],"sources":["../../src/ownership.ts"],"sourcesContent":["import {\n addCleanup,\n type Cleanup,\n currentOwner,\n disposeOwner,\n type ErrorHandler,\n handleError,\n Owner,\n runInScope,\n ShadowError,\n warn,\n} from \"./extend\";\n\nexport type { Owner };\n\n/** Where the copies of core list themselves; `Symbol.for` makes the key the same in every copy. */\nconst REGISTRY_KEY = \"shadow-js.core.instances\";\n\n/**\n * The most copies the registry lists. Real programs have one, a misconfigured one two or three; the\n * limit keeps a program that loads core in a loop (a hot-reload bug) from growing the shared map.\n */\nconst MAX_LISTED_COPIES = 8;\n\n/**\n * The identity of this copy of the module (every evaluation of the module makes its own) and the build it is:\n * the server build and the client build are different files by design, and tests that render on the server\n * and hydrate in one process load one of each, so only copies of the same build count as duplicates.\n */\nconst COPY: { readonly server: boolean } = { server: __SERVER__ };\n\n/** The registry of the copies of core and how many roots each has alive, or undefined before any root exists. */\nfunction copyRegistry(): Map<{ readonly server: boolean }, number> | undefined {\n const found = (globalThis as { [key: symbol]: unknown })[Symbol.for(REGISTRY_KEY)];\n return found instanceof Map ? found : undefined;\n}\n\n/** Development only. Counts a disposed root out of this copy's entry; the entry goes with its last root. */\nfunction releaseRoot(): void {\n const registry = copyRegistry();\n const live = registry?.get(COPY);\n if (registry === undefined || live === undefined) return;\n if (live > 1) registry.set(COPY, live - 1);\n else registry.delete(COPY);\n}\n\n/**\n * Development only. Lists a new root under this copy of core in a registry on `globalThis`, which counts the\n * live roots of every copy, and warns `DUPLICATE_CORE` (once per copy) when another copy of the same build has\n * live roots: two copies cannot see each other's signals. A copy leaves the registry when its last root is disposed, so copies\n * that never run at the same time (separate test files, a reload) do not warn. Called from `createRoot` only\n * behind `__DEV__`, and only when a root is created, never when the module is imported. The release is one\n * shared function, so a root costs no closure: rows of a list make a root each.\n */\nfunction listRoot(root: Owner): void {\n let registry = copyRegistry();\n if (registry === undefined) {\n registry = new Map();\n (globalThis as { [key: symbol]: unknown })[Symbol.for(REGISTRY_KEY)] = registry;\n }\n const listed = registry.has(COPY);\n for (const copy of registry.keys()) {\n if (copy !== COPY && copy.server === COPY.server) {\n warn(\"DUPLICATE_CORE\");\n break;\n }\n }\n // A copy past the limit is not listed; the warning above has been given by then.\n if (!listed && registry.size >= MAX_LISTED_COPIES) return;\n registry.set(COPY, (registry.get(COPY) ?? 0) + 1);\n addCleanup(root, releaseRoot);\n}\n\n/**\n * Runs `fn` without subscribing the running computation to anything `fn` reads. Use it inside an\n * effect or a memo to read a value without re-running when that value changes. The current owner\n * is kept, so effects and cleanups created inside `fn` are still owned.\n *\n * @param fn The function to run untracked.\n * @returns Whatever `fn` returns. An error thrown by `fn` propagates unchanged.\n * @example\n * import { untrack, useEffect, useSignal } from \"@shadow-js/core\";\n *\n * const [count, setCount] = useSignal(0);\n * const [unit] = useSignal(\"clicks\");\n * useEffect(() => {\n * // Re-runs when `count` changes, never when `unit` changes.\n * console.log(`${count()} ${untrack(unit)}`);\n * });\n * setCount(1);\n * @see useEvent\n * @since 1.0.0\n */\nexport function untrack<T>(fn: () => T): T {\n return runInScope({ listener: null }, fn);\n}\n\n/**\n * Options of {@link createRoot}.\n * @since 1.0.0\n */\nexport interface RootOptions {\n /**\n * When true, the root is not attached to the current owner: it outlives that owner and is\n * disposed only through the `dispose` function passed to the body. It still sees the context\n * values provided above the current owner.\n * @default false (the root is a child of the current owner and is disposed with it)\n */\n detached?: boolean;\n}\n\n/**\n * Creates an ownership scope. Everything created inside (effects, memos, cleanups, children) is\n * disposed together when `dispose` is called or, for attached roots, when the parent disposes. Use\n * it for code that runs outside a component, such as an app entry point, a test or a module that\n * owns long-lived effects. Development builds also use the root to find a second copy of core: a root\n * created while a root of another copy is alive warns `DUPLICATE_CORE` once.\n *\n * @param fn Body; receives the `dispose` function. Runs untracked, with the new root as owner.\n * @param options `detached` keeps the root out of the current owner. Undefined uses the default\n * (attached).\n * @returns Whatever `fn` returns.\n * @throws Rethrows any error thrown by `fn`, after the root and everything created in it are\n * disposed. When a cleanup of the root throws as well, both errors are thrown together as an\n * `AggregateError` (the body's first), so the body's error is never replaced.\n * @example\n * import { createRoot, useEffect, useSignal } from \"@shadow-js/core\";\n *\n * const [count, setCount] = useSignal(0);\n * const dispose = createRoot((dispose) => {\n * useEffect(() => console.log(count()));\n * return dispose;\n * });\n * setCount(1);\n * dispose(); // the effect stops and its cleanups run\n * @see getOwner\n * @since 1.0.0\n */\nexport function createRoot<T>(fn: (dispose: () => void) => T, options?: RootOptions): T {\n const detached = options?.detached === true;\n const current = currentOwner();\n const root = new Owner(detached ? null : current);\n if (detached) root.context = current === null ? null : current.context;\n if (__DEV__) listRoot(root);\n try {\n return runInScope({ owner: root, listener: null }, () => fn(() => disposeOwner(root)));\n } catch (error) {\n try {\n disposeOwner(root);\n } catch (cleanupError) {\n // The body's error says what went wrong; a cleanup error must not replace it.\n throw new AggregateError(\n [error, cleanupError],\n __DEV__ ? \"The root body threw and so did its disposal.\" : \"SHADOW_ROOT_ERRORS\",\n );\n }\n throw error;\n }\n}\n\n/**\n * Returns the owner that currently adopts new effects, memos and cleanups. Capture it while a\n * component or root runs, then hand it to {@link runWithOwner} from code that runs later.\n *\n * @returns The current owner, or `null` outside any owner (at module scope, or in a callback that\n * runs after an `await` or a timer).\n * @example\n * import { getOwner, onCleanup, runWithOwner } from \"@shadow-js/core\";\n *\n * function Poller() {\n * const owner = getOwner();\n * setTimeout(() => {\n * runWithOwner(owner, () => onCleanup(() => console.log(\"poller disposed\")));\n * }, 1000);\n * return null;\n * }\n * @see runWithOwner\n * @since 1.0.0\n */\nexport function getOwner(): Owner | null {\n return currentOwner();\n}\n\n/**\n * Runs `fn` with `owner` as the current owner, untracked. Use it to restore ownership after an\n * `await` or inside callbacks that outlive the synchronous run, so that effects, cleanups and\n * context reads inside `fn` attach to that owner. A disposed owner is ignored: `fn` then runs\n * without an owner, and development builds warn `RUN_WITH_DISPOSED_OWNER`.\n *\n * @param owner The owner to make current, usually captured with {@link getOwner}. `null` runs `fn`\n * without an owner.\n * @param fn The function to run.\n * @returns Whatever `fn` returns. An error thrown by `fn` propagates unchanged.\n * @example\n * import { createContext, getOwner, runWithOwner, useContext } from \"@shadow-js/core\";\n *\n * const Locale = createContext(\"en\");\n *\n * function Clock() {\n * const owner = getOwner();\n * queueMicrotask(() => {\n * const locale = runWithOwner(owner, () => useContext(Locale));\n * console.log(new Date().toLocaleTimeString(locale));\n * });\n * return null;\n * }\n * @see getOwner\n * @since 1.0.0\n */\nexport function runWithOwner<T>(owner: Owner | null, fn: () => T): T {\n let target = owner;\n if (target?.disposed) {\n warn(\"RUN_WITH_DISPOSED_OWNER\");\n target = null;\n }\n return runInScope({ owner: target, listener: null }, fn);\n}\n\n/**\n * Registers `fn` to run when the current owner is disposed or, for an effect or memo, before it\n * re-runs. Cleanups run newest first and untracked; one that throws does not stop the others, and\n * its error goes to the nearest error handler ({@link onError}, {@link catchError}). Outside any owner the call does nothing, because\n * nothing would ever run the cleanup; development builds warn `NO_OWNER_CLEANUP`.\n *\n * @param fn The cleanup to register.\n * @example\n * import { onCleanup } from \"@shadow-js/core\";\n *\n * function Ticker() {\n * const timer = setInterval(() => console.log(\"tick\"), 1000);\n * onCleanup(() => clearInterval(timer));\n * return null;\n * }\n * @see onMount\n * @since 1.0.0\n */\nexport function onCleanup(fn: Cleanup): void {\n const owner = currentOwner();\n if (owner === null) {\n warn(\"NO_OWNER_CLEANUP\");\n return;\n }\n addCleanup(owner, fn);\n}\n\n/**\n * Registers an error handler on the current owner. It receives errors thrown in this owner's scope\n * (its effects, memos, cleanups and child owners) that no closer handler took. Handlers on the same\n * owner are tried newest first; a handler that throws passes its own error to the next handler up.\n * Outside any owner the call does nothing; development builds warn `NO_OWNER_ERROR`.\n *\n * @param handler Receives the error, untracked. Throw from it to pass an error on to the next handler.\n * @example\n * import { onError, useEffect } from \"@shadow-js/core\";\n *\n * function Dashboard() {\n * onError((error) => console.error(\"dashboard failed:\", error));\n * useEffect(() => {\n * throw new Error(\"widget crashed\"); // reaches the handler above\n * });\n * return null;\n * }\n * @see catchError\n * @since 1.0.0\n */\nexport function onError(handler: ErrorHandler): void {\n const owner = currentOwner();\n if (owner === null) {\n warn(\"NO_OWNER_ERROR\");\n return;\n }\n if (owner.errorHandlers === null) owner.errorHandlers = [handler];\n else owner.errorHandlers.push(handler);\n}\n\n/**\n * Runs `fn` inside a new child scope whose errors go to `handler`: errors thrown synchronously by\n * `fn`, and later errors of the effects, memos and cleanups it created. The scope is disposed with\n * the current owner. Use it to contain the failures of one part of a component tree.\n *\n * @param fn The function to run; it runs untracked, with the new scope as owner.\n * @param handler Receives each error, untracked. Throw from it to pass the error on to the next handler up.\n * @returns Whatever `fn` returns, or `undefined` when `fn` threw and `handler` took the error.\n * @throws Rethrows the error `handler` throws when no handler above takes it (outside a flush).\n * @example\n * import { catchError, useEffect } from \"@shadow-js/core\";\n *\n * function Widget() {\n * return catchError(\n * () => {\n * useEffect(() => {\n * throw new Error(\"network down\");\n * });\n * return \"ready\";\n * },\n * (error) => console.error(\"widget failed:\", error),\n * );\n * }\n * @see onError\n * @since 1.0.0\n */\nexport function catchError<T>(fn: () => T, handler: ErrorHandler): T | undefined {\n const scope = new Owner(currentOwner());\n scope.errorHandlers = [handler];\n try {\n return runWithOwner(scope, fn);\n } catch (error) {\n return void handleError(error, scope);\n }\n}\n\n/**\n * Returns an id that is identical on server and client for the same position in the owner tree.\n * The id uses only letters, digits, `-` and `_`, so it is valid in `id`, `for`, `aria-*` references\n * and in `querySelector(\"#\" + id)` without escaping. Use it to link a label to its input, or an\n * element to its `aria-describedby` target, in markup that is rendered on the server and hydrated.\n *\n * @returns A new id, unique within the root; each call on the same owner returns the next one.\n * @throws ShadowError `NO_OWNER_ID` when called outside any owner, because no stable id exists\n * there.\n * @example\n * import { useId } from \"@shadow-js/core\";\n *\n * function EmailField() {\n * const id = useId();\n * return (\n * <>\n * <label for={id}>Email</label>\n * <input id={id} type=\"email\" />\n * </>\n * );\n * }\n * @since 1.0.0\n */\nexport function useId(): string {\n const owner = currentOwner();\n if (owner === null) throw new ShadowError(\"NO_OWNER_ID\");\n // An owner with an id prefix (a component the renderer put in a hydration scope) hosts the ids of\n // everything below it: the prefix already encodes where the component is, and the owners between\n // here and there (effects exist in the browser, not on the server) must not leak into the id.\n for (let host: Owner | null = owner; host !== null; host = host.parent) {\n if (host.idPrefix === undefined) continue;\n const hosted = host.idCount;\n host.idCount += 1;\n return `s${host.idPrefix}${hosted}`;\n }\n const path: number[] = [];\n for (let node: Owner | null = owner; node !== null; node = node.parent) path.push(node.index);\n path.reverse();\n const sequence = owner.idCount;\n owner.idCount += 1;\n return `s${path.join(\"-\")}_${sequence}`;\n}\n"],"mappings":";;;;;;AAgBA,MAAM,eAAe;;;;;AAMrB,MAAM,oBAAoB;;;;;;AAO1B,MAAM,OAAqC,EAAE,QAAA,MAAmB;;AAGhE,SAAS,eAAsE;CAC7E,MAAM,QAAS,WAA0C,OAAO,IAAI,YAAY;CAChF,OAAO,iBAAiB,MAAM,QAAQ,KAAA;AACxC;;AAGA,SAAS,cAAoB;CAC3B,MAAM,WAAW,aAAa;CAC9B,MAAM,OAAO,UAAU,IAAI,IAAI;CAC/B,IAAI,aAAa,KAAA,KAAa,SAAS,KAAA,GAAW;CAClD,IAAI,OAAO,GAAG,SAAS,IAAI,MAAM,OAAO,CAAC;MACpC,SAAS,OAAO,IAAI;AAC3B;;;;;;;;;AAUA,SAAS,SAAS,MAAmB;CACnC,IAAI,WAAW,aAAa;CAC5B,IAAI,aAAa,KAAA,GAAW;EAC1B,2BAAW,IAAI,IAAI;EACnB,WAA2C,OAAO,IAAI,YAAY,KAAK;CACzE;CACA,MAAM,SAAS,SAAS,IAAI,IAAI;CAChC,KAAK,MAAM,QAAQ,SAAS,KAAK,GAC/B,IAAI,SAAS,QAAQ,KAAK,WAAW,KAAK,QAAQ;EAChD,KAAK,gBAAgB;EACrB;CACF;CAGF,IAAI,CAAC,UAAU,SAAS,QAAQ,mBAAmB;CACnD,SAAS,IAAI,OAAO,SAAS,IAAI,IAAI,KAAK,KAAK,CAAC;CAChD,WAAW,MAAM,WAAW;AAC9B;;;;;;;;;;;;;;;;;;;;;AAsBA,SAAgB,QAAW,IAAgB;CACzC,OAAO,WAAW,EAAE,UAAU,KAAK,GAAG,EAAE;AAC1C;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA2CA,SAAgB,WAAc,IAAgC,SAA0B;CACtF,MAAM,WAAW,SAAS,aAAa;CACvC,MAAM,UAAU,aAAa;CAC7B,MAAM,OAAO,IAAI,MAAM,WAAW,OAAO,OAAO;CAChD,IAAI,UAAU,KAAK,UAAU,YAAY,OAAO,OAAO,QAAQ;CAClD,SAAS,IAAI;CAC1B,IAAI;EACF,OAAO,WAAW;GAAE,OAAO;GAAM,UAAU;EAAK,SAAS,SAASA,YAAa,IAAI,CAAC,CAAC;CACvF,SAAS,OAAO;EACd,IAAI;GACF,YAAa,IAAI;EACnB,SAAS,cAAc;GAErB,MAAM,IAAI,eACR,CAAC,OAAO,YAAY,GACV,8CACZ;EACF;EACA,MAAM;CACR;AACF;;;;;;;;;;;;;;;;;;;;AAqBA,SAAgB,WAAyB;CACvC,OAAO,aAAa;AACtB;;;;;;;;;;;;;;;;;;;;;;;;;;;AA4BA,SAAgB,aAAgB,OAAqB,IAAgB;CACnE,IAAI,SAAS;CACb,IAAI,QAAQ,UAAU;EACpB,KAAK,yBAAyB;EAC9B,SAAS;CACX;CACA,OAAO,WAAW;EAAE,OAAO;EAAQ,UAAU;CAAK,GAAG,EAAE;AACzD;;;;;;;;;;;;;;;;;;;AAoBA,SAAgB,UAAU,IAAmB;CAC3C,MAAM,QAAQ,aAAa;CAC3B,IAAI,UAAU,MAAM;EAClB,KAAK,kBAAkB;EACvB;CACF;CACA,WAAW,OAAO,EAAE;AACtB;;;;;;;;;;;;;;;;;;;;;AAsBA,SAAgB,QAAQ,SAA6B;CACnD,MAAM,QAAQ,aAAa;CAC3B,IAAI,UAAU,MAAM;EAClB,KAAK,gBAAgB;EACrB;CACF;CACA,IAAI,MAAM,kBAAkB,MAAM,MAAM,gBAAgB,CAAC,OAAO;MAC3D,MAAM,cAAc,KAAK,OAAO;AACvC;;;;;;;;;;;;;;;;;;;;;;;;;;;AA4BA,SAAgB,WAAc,IAAa,SAAsC;CAC/E,MAAM,QAAQ,IAAI,MAAM,aAAa,CAAC;CACtC,MAAM,gBAAgB,CAAC,OAAO;CAC9B,IAAI;EACF,OAAO,aAAa,OAAO,EAAE;CAC/B,SAAS,OAAO;EACP,YAAiB,OAAO,KAAK;EAApC;CACF;AACF;;;;;;;;;;;;;;;;;;;;;;;;AAyBA,SAAgB,QAAgB;CAC9B,MAAM,QAAQ,aAAa;CAC3B,IAAI,UAAU,MAAM,MAAM,IAAI,YAAY,aAAa;CAIvD,KAAK,IAAI,OAAqB,OAAO,SAAS,MAAM,OAAO,KAAK,QAAQ;EACtE,IAAI,KAAK,aAAa,KAAA,GAAW;EACjC,MAAM,SAAS,KAAK;EACpB,KAAK,WAAW;EAChB,OAAO,IAAI,KAAK,WAAW;CAC7B;CACA,MAAM,OAAiB,CAAC;CACxB,KAAK,IAAI,OAAqB,OAAO,SAAS,MAAM,OAAO,KAAK,QAAQ,KAAK,KAAK,KAAK,KAAK;CAC5F,KAAK,QAAQ;CACb,MAAM,WAAW,MAAM;CACvB,MAAM,WAAW;CACjB,OAAO,IAAI,KAAK,KAAK,GAAG,EAAE,GAAG;AAC/B"}
|
|
1
|
+
{"version":3,"file":"ownership.js","names":["disposeOwner"],"sources":["../../src/ownership.ts"],"sourcesContent":["import {\n addCleanup,\n type Cleanup,\n currentOwner,\n disposeOwner,\n type ErrorHandler,\n handleError,\n Owner,\n runInScope,\n ShadowError,\n warn,\n} from \"./extend\";\n\nexport type { Owner };\n\n/** Where the copies of core list themselves; `Symbol.for` makes the key the same in every copy. */\nconst REGISTRY_KEY = \"shadow-js.core.instances\";\n\n/**\n * The most copies the registry lists. Real programs have one, a misconfigured one two or three; the\n * limit keeps a program that loads core in a loop (a hot-reload bug) from growing the shared map.\n */\nconst MAX_LISTED_COPIES = 8;\n\n/**\n * The identity of this copy of the module (every evaluation of the module makes its own) and the build it is:\n * the server build and the client build are different files by design, and tests that render on the server\n * and hydrate in one process load one of each, so only copies of the same build count as duplicates.\n */\nconst COPY: { readonly server: boolean } = { server: __SERVER__ };\n\n/** The registry of the copies of core and how many roots each has alive, or undefined before any root exists. */\nfunction copyRegistry(): Map<{ readonly server: boolean }, number> | undefined {\n const found = (globalThis as { [key: symbol]: unknown })[Symbol.for(REGISTRY_KEY)];\n return found instanceof Map ? found : undefined;\n}\n\n/** Development only. Counts a disposed root out of this copy's entry; the entry goes with its last root. */\nfunction releaseRoot(): void {\n const registry = copyRegistry();\n const live = registry?.get(COPY);\n if (registry === undefined || live === undefined) return;\n if (live > 1) registry.set(COPY, live - 1);\n else registry.delete(COPY);\n}\n\n/**\n * Development only. Lists a new root under this copy of core in a registry on `globalThis`, which counts the\n * live roots of every copy, and warns `DUPLICATE_CORE` (once per copy) when another copy of the same build has\n * live roots: two copies cannot see each other's signals. A copy leaves the registry when its last root is disposed, so copies\n * that never run at the same time (separate test files, a reload) do not warn. Called from `createRoot` only\n * behind `__DEV__`, and only when a root is created, never when the module is imported. The release is one\n * shared function, so a root costs no closure: rows of a list make a root each.\n */\nfunction listRoot(root: Owner): void {\n let registry = copyRegistry();\n if (registry === undefined) {\n registry = new Map();\n (globalThis as { [key: symbol]: unknown })[Symbol.for(REGISTRY_KEY)] = registry;\n }\n const listed = registry.has(COPY);\n for (const copy of registry.keys()) {\n if (copy !== COPY && copy.server === COPY.server) {\n warn(\"DUPLICATE_CORE\");\n break;\n }\n }\n // A copy past the limit is not listed; the warning above has been given by then.\n if (!listed && registry.size >= MAX_LISTED_COPIES) return;\n registry.set(COPY, (registry.get(COPY) ?? 0) + 1);\n addCleanup(root, releaseRoot);\n}\n\n/**\n * Runs `fn` without subscribing the running computation to anything `fn` reads. Use it inside an\n * effect or a memo to read a value without re-running when that value changes. The current owner\n * is kept, so effects and cleanups created inside `fn` are still owned.\n *\n * @param fn The function to run untracked.\n * @returns Whatever `fn` returns. An error thrown by `fn` propagates unchanged.\n * @example\n * import { untrack, useEffect, useSignal } from \"@shadow-js/core\";\n *\n * const [count, setCount] = useSignal(0);\n * const [unit] = useSignal(\"clicks\");\n * useEffect(() => {\n * // Re-runs when `count` changes, never when `unit` changes.\n * console.log(`${count()} ${untrack(unit)}`);\n * });\n * setCount(1);\n * @see useEvent\n * @since 1.0.0\n */\nexport function untrack<T>(fn: () => T): T {\n return runInScope({ listener: null }, fn);\n}\n\n/**\n * Options of {@link createRoot}.\n * @since 1.0.0\n */\nexport interface RootOptions {\n /**\n * When true, the root is not attached to the current owner: it outlives that owner and is\n * disposed only through the `dispose` function passed to the body. It still sees the context\n * values provided above the current owner.\n * @default false (the root is a child of the current owner and is disposed with it)\n */\n detached?: boolean;\n}\n\n/**\n * Creates an ownership scope. Everything created inside (effects, memos, cleanups, children) is\n * disposed together when `dispose` is called or, for attached roots, when the parent disposes. Use\n * it for code that runs outside a component, such as an app entry point, a test or a module that\n * owns long-lived effects. Development builds also use the root to find a second copy of core: a root\n * created while a root of another copy is alive warns `DUPLICATE_CORE` once.\n *\n * @param fn Body; receives the `dispose` function. Runs untracked, with the new root as owner.\n * @param options `detached` keeps the root out of the current owner. Undefined uses the default\n * (attached).\n * @returns Whatever `fn` returns.\n * @throws Rethrows any error thrown by `fn`, after the root and everything created in it are\n * disposed. When a cleanup of the root throws as well, both errors are thrown together as an\n * `AggregateError` (the body's first), so the body's error is never replaced.\n * @example\n * import { createRoot, useEffect, useSignal } from \"@shadow-js/core\";\n *\n * const [count, setCount] = useSignal(0);\n * const dispose = createRoot((dispose) => {\n * useEffect(() => console.log(count()));\n * return dispose;\n * });\n * setCount(1);\n * dispose(); // the effect stops and its cleanups run\n * @see getOwner\n * @since 1.0.0\n */\nexport function createRoot<T>(fn: (dispose: () => void) => T, options?: RootOptions): T {\n const detached = options?.detached === true;\n const current = currentOwner();\n const root = new Owner(detached ? null : current);\n if (detached) root.context = current === null ? null : current.context;\n if (__DEV__) listRoot(root);\n try {\n const result = runInScope({ owner: root, listener: null }, () => fn(() => disposeOwner(root)));\n // The body disposed its own root and kept going: what it created after that has no owner left to dispose it.\n if (root.disposed) {\n disposeOwner(root);\n root.runCleanups();\n }\n return result;\n } catch (error) {\n try {\n disposeOwner(root);\n } catch (cleanupError) {\n // The body's error says what went wrong; a cleanup error must not replace it.\n throw new AggregateError(\n [error, cleanupError],\n __DEV__ ? \"The root body threw and so did its disposal.\" : \"SHADOW_ROOT_ERRORS\",\n );\n }\n throw error;\n }\n}\n\n/**\n * Returns the owner that currently adopts new effects, memos and cleanups. Capture it while a\n * component or root runs, then hand it to {@link runWithOwner} from code that runs later.\n *\n * @returns The current owner, or `null` outside any owner (at module scope, or in a callback that\n * runs after an `await` or a timer).\n * @example\n * import { getOwner, onCleanup, runWithOwner } from \"@shadow-js/core\";\n *\n * function Poller() {\n * const owner = getOwner();\n * setTimeout(() => {\n * runWithOwner(owner, () => onCleanup(() => console.log(\"poller disposed\")));\n * }, 1000);\n * return null;\n * }\n * @see runWithOwner\n * @since 1.0.0\n */\nexport function getOwner(): Owner | null {\n return currentOwner();\n}\n\n/**\n * Runs `fn` with `owner` as the current owner, untracked. Use it to restore ownership after an\n * `await` or inside callbacks that outlive the synchronous run, so that effects, cleanups and\n * context reads inside `fn` attach to that owner. A disposed owner is ignored: `fn` then runs\n * without an owner, and development builds warn `RUN_WITH_DISPOSED_OWNER`.\n *\n * @param owner The owner to make current, usually captured with {@link getOwner}. `null` runs `fn`\n * without an owner.\n * @param fn The function to run.\n * @returns Whatever `fn` returns. An error thrown by `fn` propagates unchanged.\n * @example\n * import { createContext, getOwner, runWithOwner, useContext } from \"@shadow-js/core\";\n *\n * const Locale = createContext(\"en\");\n *\n * function Clock() {\n * const owner = getOwner();\n * queueMicrotask(() => {\n * const locale = runWithOwner(owner, () => useContext(Locale));\n * console.log(new Date().toLocaleTimeString(locale));\n * });\n * return null;\n * }\n * @see getOwner\n * @since 1.0.0\n */\nexport function runWithOwner<T>(owner: Owner | null, fn: () => T): T {\n let target = owner;\n if (target?.disposed) {\n warn(\"RUN_WITH_DISPOSED_OWNER\");\n target = null;\n }\n return runInScope({ owner: target, listener: null }, fn);\n}\n\n/**\n * Registers `fn` to run when the current owner is disposed or, for an effect or memo, before it\n * re-runs. Cleanups run newest first and untracked; one that throws does not stop the others, and\n * its error goes to the nearest error handler ({@link onError}, {@link catchError}). Outside any owner the call does nothing, because\n * nothing would ever run the cleanup; development builds warn `NO_OWNER_CLEANUP`.\n *\n * @param fn The cleanup to register.\n * @example\n * import { onCleanup } from \"@shadow-js/core\";\n *\n * function Ticker() {\n * const timer = setInterval(() => console.log(\"tick\"), 1000);\n * onCleanup(() => clearInterval(timer));\n * return null;\n * }\n * @see onMount\n * @since 1.0.0\n */\nexport function onCleanup(fn: Cleanup): void {\n const owner = currentOwner();\n if (owner === null) {\n warn(\"NO_OWNER_CLEANUP\");\n return;\n }\n addCleanup(owner, fn);\n}\n\n/**\n * Registers an error handler on the current owner. It receives errors thrown in this owner's scope\n * (its effects, memos, cleanups and child owners) that no closer handler took. Handlers on the same\n * owner are tried newest first; a handler that throws passes its own error to the next handler up.\n * Outside any owner the call does nothing; development builds warn `NO_OWNER_ERROR`.\n *\n * @param handler Receives the error, untracked. Throw from it to pass an error on to the next handler.\n * @example\n * import { onError, useEffect } from \"@shadow-js/core\";\n *\n * function Dashboard() {\n * onError((error) => console.error(\"dashboard failed:\", error));\n * useEffect(() => {\n * throw new Error(\"widget crashed\"); // reaches the handler above\n * });\n * return null;\n * }\n * @see catchError\n * @since 1.0.0\n */\nexport function onError(handler: ErrorHandler): void {\n const owner = currentOwner();\n if (owner === null) {\n warn(\"NO_OWNER_ERROR\");\n return;\n }\n if (owner.errorHandlers === null) owner.errorHandlers = [handler];\n else owner.errorHandlers.push(handler);\n}\n\n/**\n * Runs `fn` inside a new child scope whose errors go to `handler`: errors thrown synchronously by\n * `fn`, and later errors of the effects, memos and cleanups it created. The scope is disposed with\n * the current owner. Use it to contain the failures of one part of a component tree.\n *\n * @param fn The function to run; it runs untracked, with the new scope as owner.\n * @param handler Receives each error, untracked. Throw from it to pass the error on to the next handler up.\n * @returns Whatever `fn` returns, or `undefined` when `fn` threw and `handler` took the error.\n * @throws Rethrows the error `handler` throws when no handler above takes it (outside a flush).\n * @example\n * import { catchError, useEffect } from \"@shadow-js/core\";\n *\n * function Widget() {\n * return catchError(\n * () => {\n * useEffect(() => {\n * throw new Error(\"network down\");\n * });\n * return \"ready\";\n * },\n * (error) => console.error(\"widget failed:\", error),\n * );\n * }\n * @see onError\n * @since 1.0.0\n */\nexport function catchError<T>(fn: () => T, handler: ErrorHandler): T | undefined {\n const scope = new Owner(currentOwner());\n scope.errorHandlers = [handler];\n try {\n return runWithOwner(scope, fn);\n } catch (error) {\n return void handleError(error, scope);\n }\n}\n\n/**\n * Returns an id that is identical on server and client for the same position in the owner tree.\n * The id uses only letters, digits, `-` and `_`, so it is valid in `id`, `for`, `aria-*` references\n * and in `querySelector(\"#\" + id)` without escaping. Use it to link a label to its input, or an\n * element to its `aria-describedby` target, in markup that is rendered on the server and hydrated.\n *\n * @returns A new id, unique within the root; each call on the same owner returns the next one.\n * @throws ShadowError `NO_OWNER_ID` when called outside any owner, because no stable id exists\n * there.\n * @example\n * import { useId } from \"@shadow-js/core\";\n *\n * function EmailField() {\n * const id = useId();\n * return (\n * <>\n * <label for={id}>Email</label>\n * <input id={id} type=\"email\" />\n * </>\n * );\n * }\n * @since 1.0.0\n */\nexport function useId(): string {\n const owner = currentOwner();\n if (owner === null) throw new ShadowError(\"NO_OWNER_ID\");\n // An owner with an id prefix (a component the renderer put in a hydration scope) hosts the ids of\n // everything below it: the prefix already encodes where the component is, and the owners between\n // here and there (effects exist in the browser, not on the server) must not leak into the id.\n for (let host: Owner | null = owner; host !== null; host = host.parent) {\n if (host.idPrefix === undefined) continue;\n const hosted = host.idCount;\n host.idCount += 1;\n return `s${host.idPrefix}${hosted}`;\n }\n const path: number[] = [];\n for (let node: Owner | null = owner; node !== null; node = node.parent) path.push(node.index);\n path.reverse();\n const sequence = owner.idCount;\n owner.idCount += 1;\n return `s${path.join(\"-\")}_${sequence}`;\n}\n"],"mappings":";;;;;;AAgBA,MAAM,eAAe;;;;;AAMrB,MAAM,oBAAoB;;;;;;AAO1B,MAAM,OAAqC,EAAE,QAAA,MAAmB;;AAGhE,SAAS,eAAsE;CAC7E,MAAM,QAAS,WAA0C,OAAO,IAAI,YAAY;CAChF,OAAO,iBAAiB,MAAM,QAAQ,KAAA;AACxC;;AAGA,SAAS,cAAoB;CAC3B,MAAM,WAAW,aAAa;CAC9B,MAAM,OAAO,UAAU,IAAI,IAAI;CAC/B,IAAI,aAAa,KAAA,KAAa,SAAS,KAAA,GAAW;CAClD,IAAI,OAAO,GAAG,SAAS,IAAI,MAAM,OAAO,CAAC;MACpC,SAAS,OAAO,IAAI;AAC3B;;;;;;;;;AAUA,SAAS,SAAS,MAAmB;CACnC,IAAI,WAAW,aAAa;CAC5B,IAAI,aAAa,KAAA,GAAW;EAC1B,2BAAW,IAAI,IAAI;EACnB,WAA2C,OAAO,IAAI,YAAY,KAAK;CACzE;CACA,MAAM,SAAS,SAAS,IAAI,IAAI;CAChC,KAAK,MAAM,QAAQ,SAAS,KAAK,GAC/B,IAAI,SAAS,QAAQ,KAAK,WAAW,KAAK,QAAQ;EAChD,KAAK,gBAAgB;EACrB;CACF;CAGF,IAAI,CAAC,UAAU,SAAS,QAAQ,mBAAmB;CACnD,SAAS,IAAI,OAAO,SAAS,IAAI,IAAI,KAAK,KAAK,CAAC;CAChD,WAAW,MAAM,WAAW;AAC9B;;;;;;;;;;;;;;;;;;;;;AAsBA,SAAgB,QAAW,IAAgB;CACzC,OAAO,WAAW,EAAE,UAAU,KAAK,GAAG,EAAE;AAC1C;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA2CA,SAAgB,WAAc,IAAgC,SAA0B;CACtF,MAAM,WAAW,SAAS,aAAa;CACvC,MAAM,UAAU,aAAa;CAC7B,MAAM,OAAO,IAAI,MAAM,WAAW,OAAO,OAAO;CAChD,IAAI,UAAU,KAAK,UAAU,YAAY,OAAO,OAAO,QAAQ;CAClD,SAAS,IAAI;CAC1B,IAAI;EACF,MAAM,SAAS,WAAW;GAAE,OAAO;GAAM,UAAU;EAAK,SAAS,SAASA,YAAa,IAAI,CAAC,CAAC;EAE7F,IAAI,KAAK,UAAU;GACjB,YAAa,IAAI;GACjB,KAAK,YAAY;EACnB;EACA,OAAO;CACT,SAAS,OAAO;EACd,IAAI;GACF,YAAa,IAAI;EACnB,SAAS,cAAc;GAErB,MAAM,IAAI,eACR,CAAC,OAAO,YAAY,GACV,8CACZ;EACF;EACA,MAAM;CACR;AACF;;;;;;;;;;;;;;;;;;;;AAqBA,SAAgB,WAAyB;CACvC,OAAO,aAAa;AACtB;;;;;;;;;;;;;;;;;;;;;;;;;;;AA4BA,SAAgB,aAAgB,OAAqB,IAAgB;CACnE,IAAI,SAAS;CACb,IAAI,QAAQ,UAAU;EACpB,KAAK,yBAAyB;EAC9B,SAAS;CACX;CACA,OAAO,WAAW;EAAE,OAAO;EAAQ,UAAU;CAAK,GAAG,EAAE;AACzD;;;;;;;;;;;;;;;;;;;AAoBA,SAAgB,UAAU,IAAmB;CAC3C,MAAM,QAAQ,aAAa;CAC3B,IAAI,UAAU,MAAM;EAClB,KAAK,kBAAkB;EACvB;CACF;CACA,WAAW,OAAO,EAAE;AACtB;;;;;;;;;;;;;;;;;;;;;AAsBA,SAAgB,QAAQ,SAA6B;CACnD,MAAM,QAAQ,aAAa;CAC3B,IAAI,UAAU,MAAM;EAClB,KAAK,gBAAgB;EACrB;CACF;CACA,IAAI,MAAM,kBAAkB,MAAM,MAAM,gBAAgB,CAAC,OAAO;MAC3D,MAAM,cAAc,KAAK,OAAO;AACvC;;;;;;;;;;;;;;;;;;;;;;;;;;;AA4BA,SAAgB,WAAc,IAAa,SAAsC;CAC/E,MAAM,QAAQ,IAAI,MAAM,aAAa,CAAC;CACtC,MAAM,gBAAgB,CAAC,OAAO;CAC9B,IAAI;EACF,OAAO,aAAa,OAAO,EAAE;CAC/B,SAAS,OAAO;EACP,YAAiB,OAAO,KAAK;EAApC;CACF;AACF;;;;;;;;;;;;;;;;;;;;;;;;AAyBA,SAAgB,QAAgB;CAC9B,MAAM,QAAQ,aAAa;CAC3B,IAAI,UAAU,MAAM,MAAM,IAAI,YAAY,aAAa;CAIvD,KAAK,IAAI,OAAqB,OAAO,SAAS,MAAM,OAAO,KAAK,QAAQ;EACtE,IAAI,KAAK,aAAa,KAAA,GAAW;EACjC,MAAM,SAAS,KAAK;EACpB,KAAK,WAAW;EAChB,OAAO,IAAI,KAAK,WAAW;CAC7B;CACA,MAAM,OAAiB,CAAC;CACxB,KAAK,IAAI,OAAqB,OAAO,SAAS,MAAM,OAAO,KAAK,QAAQ,KAAK,KAAK,KAAK,KAAK;CAC5F,KAAK,QAAQ;CACb,MAAM,WAAW,MAAM;CACvB,MAAM,WAAW;CACjB,OAAO,IAAI,KAAK,KAAK,GAAG,EAAE,GAAG;AAC/B"}
|
package/dist/dev/props.js
CHANGED
package/dist/dev/reaction.js
CHANGED
|
@@ -1,6 +1,6 @@
|
|
|
1
|
-
import { untrack } from "./ownership.js";
|
|
2
|
-
import { disposeTree } from "./internal/dispose.js";
|
|
3
1
|
import { createComputation, createOwner, currentOwner, runInScope } from "./extend/index.js";
|
|
2
|
+
import { disposeTree } from "./internal/dispose.js";
|
|
3
|
+
import { untrack } from "./ownership.js";
|
|
4
4
|
// src/reaction.ts
|
|
5
5
|
/**
|
|
6
6
|
* Creates a tracker that reports the first change of what it reads. `useReaction(onInvalidate)`
|
package/dist/dev/resource.js
CHANGED
|
@@ -1,12 +1,12 @@
|
|
|
1
1
|
import { DEVTOOLS_EVENT, report } from "./internal/devtools.js";
|
|
2
2
|
import { Signal, readSignal } from "./internal/graph.js";
|
|
3
3
|
import { batch } from "./internal/scheduler.js";
|
|
4
|
-
import { onCleanup, untrack } from "./ownership.js";
|
|
5
|
-
import { useRenderEffect } from "./effect.js";
|
|
6
4
|
import { useContext } from "./context.js";
|
|
7
|
-
import {
|
|
8
|
-
import { holdReader, inTransition } from "./internal/concurrency.js";
|
|
5
|
+
import { useRenderEffect } from "./effect.js";
|
|
9
6
|
import { currentListener, currentOwner, writeSignal } from "./extend/index.js";
|
|
7
|
+
import { onCleanup, untrack } from "./ownership.js";
|
|
8
|
+
import { holdReader, inTransition } from "./internal/concurrency.js";
|
|
9
|
+
import { ResourceCacheContext, SuspenseContext } from "./suspense.js";
|
|
10
10
|
// src/resource.ts
|
|
11
11
|
/**
|
|
12
12
|
* A signal cell whose writes are allowed everywhere (see {@link createSignalNode}). `distinct`
|
package/dist/dev/selector.js
CHANGED
|
@@ -1,7 +1,7 @@
|
|
|
1
1
|
import { track } from "./internal/graph.js";
|
|
2
|
-
import { onCleanup, untrack } from "./ownership.js";
|
|
3
2
|
import { useRenderEffect } from "./effect.js";
|
|
4
3
|
import { isTracking, notify } from "./extend/index.js";
|
|
4
|
+
import { onCleanup, untrack } from "./ownership.js";
|
|
5
5
|
// src/selector.ts
|
|
6
6
|
/**
|
|
7
7
|
* The boolean for one key, shared by every reader that asked about that key. It is a reactive source itself (the
|
package/dist/dev/signal.js
CHANGED
|
@@ -1,6 +1,6 @@
|
|
|
1
1
|
import { Signal, readSignal } from "./internal/graph.js";
|
|
2
|
-
import { untrack } from "./ownership.js";
|
|
3
2
|
import { writeSignal } from "./extend/index.js";
|
|
3
|
+
import { untrack } from "./ownership.js";
|
|
4
4
|
// src/signal.ts
|
|
5
5
|
/**
|
|
6
6
|
* Creates a reactive cell holding one value: the low-level primitive `useStore` builds on. Reads
|
|
@@ -1,5 +1,5 @@
|
|
|
1
|
-
import { Mutable, Reconciler, SetStore, Store, StoreResult } from "./types.js";
|
|
2
1
|
import { snapshot, unwrap } from "./read.js";
|
|
3
2
|
import { ReconcileOptions, produce, reconcile } from "./reconcile.js";
|
|
3
|
+
import { Mutable, Reconciler, SetStore, Store, StoreResult } from "./types.js";
|
|
4
4
|
import { StoreOptions, useStore } from "./use-store.js";
|
|
5
5
|
export { type Mutable, type ReconcileOptions, type Reconciler, type SetStore, type Store, type StoreOptions, type StoreResult, produce, reconcile, snapshot, unwrap, useStore };
|
package/dist/dev/store/nodes.js
CHANGED
|
@@ -181,9 +181,13 @@ function writeRaw(target, key, value) {
|
|
|
181
181
|
}
|
|
182
182
|
return true;
|
|
183
183
|
}
|
|
184
|
-
/**
|
|
185
|
-
|
|
186
|
-
|
|
184
|
+
/**
|
|
185
|
+
* Deletes one own property of a raw object and notifies its signal and the key set. A reserved key is
|
|
186
|
+
* refused unless `cleanup` is set: removing an own data property named `__proto__` (it arrived in parsed
|
|
187
|
+
* JSON) cannot reach a prototype, and `reconcile` must be able to clear it like any other stale key.
|
|
188
|
+
*/
|
|
189
|
+
function deleteRaw(target, key, cleanup = false) {
|
|
190
|
+
if (!cleanup && isReservedKey(key)) throw new TypeError(`ShadowStore: "${key}" cannot be deleted; it is a reserved key`);
|
|
187
191
|
if (!Object.hasOwn(target, key)) return true;
|
|
188
192
|
if (!Reflect.deleteProperty(target, key)) throw new TypeError(`ShadowStore: property "${key}" cannot be deleted`);
|
|
189
193
|
const node = NODES.get(target);
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"nodes.js","names":["SignalNode"],"sources":["../../../src/store/nodes.ts"],"sourcesContent":["import { isTracking, notify as notifySource, SignalNode, track } from \"../extend\";\n\n/** Keys that could reach `Object.prototype` if written; they are never stored as own properties. */\nconst RESERVED_KEYS: ReadonlySet<string> = new Set([\"__proto__\", \"constructor\", \"prototype\"]);\n\n/**\n * Tracking state of one plain object or array. Signals are created lazily, on the first read made\n * inside a tracked computation, so untracked data costs one small record per object.\n */\nexport interface NodeState {\n /**\n * One signal per property read in a tracked context, keyed by property name. A signal is only a\n * notifier (it holds no value), so one that nothing observes any more is dropped by a sweep (see\n * `signalFor`) and a later read simply makes a new one.\n */\n signals: Map<string, SignalNode<number>> | null;\n /** Notified when a property is added or removed, or an array changes length. */\n keys: SignalNode<number> | null;\n /** The read-only proxy for this object, created on first read. */\n proxy: object | null;\n}\n\n/** Raw object -> its tracking state. Keys are the raw data, so nothing is stamped on user objects. */\nexport const NODES: WeakMap<object, NodeState> = new WeakMap();\n\n/** Any store proxy (read-only or draft) -> the raw object it wraps. */\nexport const RAW: WeakMap<object, object> = new WeakMap();\n\n/** True for the keys that must never be written as own properties. */\nexport function isReservedKey(key: string): boolean {\n return RESERVED_KEYS.has(key);\n}\n\n/** True for the values the store wraps: plain objects (null or Object.prototype) and arrays. */\nexport function isWrappable(value: unknown): value is object {\n if (typeof value !== \"object\" || value === null) return false;\n if (Array.isArray(value)) return true;\n if (value === Object.prototype) return false;\n const prototype: unknown = Object.getPrototypeOf(value);\n return prototype === Object.prototype || prototype === null;\n}\n\n/** Replaces a store proxy by the raw object it wraps; any other value is returned as is. */\nexport function unwrapValue(value: unknown): unknown {\n if (typeof value !== \"object\" || value === null) return value;\n return RAW.get(value) ?? value;\n}\n\n/** True when a store proxy (draft or read-only view) sits anywhere inside the plain data `root`. */\nfunction containsProxy(root: object): boolean {\n const seen = new Set<object>([root]);\n const stack: object[] = [root];\n while (stack.length > 0) {\n const container = stack.pop() as object;\n for (const key of Object.keys(container)) {\n const member: unknown = Reflect.get(container, key);\n if (typeof member !== \"object\" || member === null) continue;\n if (RAW.has(member)) return true;\n if (isWrappable(member) && !seen.has(member)) {\n seen.add(member);\n stack.push(member);\n }\n }\n }\n return false;\n}\n\n/**\n * Like {@link unwrapValue}, and also for proxies hidden inside plain data: `draft.todos =\n * draft.todos.filter(...)` assigns an array whose members are drafts, and a draft stored in the\n * data would throw on its next use. Data without proxies is returned as is; otherwise a copy with\n * every proxy replaced by its raw object. Iterative, so nesting depth is not limited by the stack.\n */\nexport function unwrapDeep(value: unknown): unknown {\n const first = unwrapValue(value);\n if (first !== value || !isWrappable(first) || !containsProxy(first)) return first;\n const copies = new Map<object, object>();\n const copyOf = (source: object): object => {\n const existing = copies.get(source);\n if (existing !== undefined) return existing;\n const made: object = Array.isArray(source) ? [] : Object.create(Object.getPrototypeOf(source));\n copies.set(source, made);\n return made;\n };\n const rootCopy = copyOf(first);\n const queue: object[] = [first];\n for (let head = 0; head < queue.length; head += 1) {\n const source = queue[head] as object;\n const target = copies.get(source) as object;\n for (const key of Object.keys(source)) {\n let member: unknown = Reflect.get(source, key);\n if (typeof member === \"object\" && member !== null) {\n const raw = RAW.get(member);\n if (raw !== undefined) member = raw;\n else if (isWrappable(member)) {\n const known = copies.has(member);\n member = copyOf(member);\n if (!known) queue.push(Reflect.get(source, key) as object);\n }\n }\n Object.defineProperty(target, key, {\n value: member,\n enumerable: true,\n writable: true,\n configurable: true,\n });\n }\n }\n return rootCopy;\n}\n\n/** Reads an own or inherited property without tracking and without invoking proxies. */\nexport function readRaw(target: object, key: string): unknown {\n return Reflect.get(target, key);\n}\n\n/** Returns the tracking state of `raw`, creating an empty one on first use. */\nexport function nodeOf(raw: object): NodeState {\n let node = NODES.get(raw);\n if (node === undefined) {\n node = { signals: null, keys: null, proxy: null };\n NODES.set(raw, node);\n }\n return node;\n}\n\n/** The map size at which the first sweep of unobserved key signals runs. */\nconst SWEEP_AT = 256;\n\nfunction signalFor(node: NodeState, key: string): SignalNode<number> {\n let signals = node.signals;\n if (signals === null) {\n signals = new Map();\n node.signals = signals;\n }\n let signal = signals.get(key);\n if (signal === undefined) {\n // Reading many transient keys (`store.byId[id]` with churning ids) would keep one signal per key\n // for the life of the store. The sweep runs when the map reaches a power of two from SWEEP_AT on,\n // so its cost is amortized O(1) per new key, and the map stays within about twice the number of\n // keys that are observed at that moment (plus SWEEP_AT).\n const size = signals.size;\n if (size >= SWEEP_AT && (size & (size - 1)) === 0) {\n // Safe at any time: a signal carries no value, and the next read of its key makes a fresh one.\n for (const [other, node] of signals) {\n if ((node.observers?.length ?? 0) === 0) signals.delete(other);\n }\n }\n signal = new SignalNode(0, false);\n signals.set(key, signal);\n }\n return signal;\n}\n\n/** Subscribes the running computation (if any) to one property of the object. */\nexport function trackProperty(node: NodeState, key: string): void {\n if (!isTracking()) return;\n track(signalFor(node, key));\n}\n\n/** Subscribes the running computation (if any) to the key set of the object. */\nexport function trackKeys(node: NodeState): void {\n if (!isTracking()) return;\n if (node.keys === null) node.keys = new SignalNode(0, false);\n track(node.keys);\n}\n\n/**\n * Notifies the observers of one signal. The same engine steps as a signal write: mark the\n * observers dirty, then request a flush (which the surrounding batch defers).\n */\nfunction notify(signal: SignalNode<number> | null | undefined): void {\n if (signal === undefined || signal === null) return;\n notifySource(signal);\n}\n\nfunction isIndexKey(key: string): boolean {\n const index = Number(key);\n return Number.isInteger(index) && index >= 0 && String(index) === key;\n}\n\n/** Notifies the index signals of an array at or beyond `from` (used when the array shrinks). */\nfunction notifyIndicesFrom(node: NodeState, from: number): void {\n const signals = node.signals;\n if (signals === null) return;\n for (const [key, signal] of signals) {\n if (isIndexKey(key) && Number(key) >= from) notify(signal);\n }\n}\n\n/**\n * Writes one property of a raw object and notifies exactly what changed: the property's signal,\n * the key set when a property appears, and the length when an array's length moves. An equal\n * value (Object.is) writes nothing. Returns whether anything changed.\n */\nexport function writeRaw(target: object, key: string, value: unknown): boolean {\n if (isReservedKey(key)) {\n throw new TypeError(\n __DEV__\n ? `ShadowStore: \"${key}\" cannot be written; it is a reserved key`\n : \"SHADOW_STORE_RESERVED_KEY\",\n );\n }\n value = unwrapDeep(value);\n const array = Array.isArray(target);\n const had = Object.hasOwn(target, key);\n if (had && Object.is(readRaw(target, key), value)) return false;\n const before = array ? (target as unknown[]).length : 0;\n if (!Reflect.set(target, key, value)) {\n throw new TypeError(\n __DEV__\n ? `ShadowStore: property \"${key}\" is read-only and cannot be written`\n : \"SHADOW_STORE_PROP_READ_ONLY\",\n );\n }\n const node = NODES.get(target);\n if (node === undefined) return true;\n notify(node.signals?.get(key));\n if (!had) notify(node.keys);\n if (array) {\n const after = (target as unknown[]).length;\n if (after !== before) {\n notify(node.signals?.get(\"length\"));\n notify(node.keys);\n if (after < before) notifyIndicesFrom(node, after);\n }\n }\n return true;\n}\n\n/** Deletes one own property of a raw object and notifies its signal and the key set. */\nexport function deleteRaw(target: object, key: string): boolean {\n if (isReservedKey(key)) {\n throw new TypeError(\n __DEV__\n ? `ShadowStore: \"${key}\" cannot be deleted; it is a reserved key`\n : \"SHADOW_STORE_RESERVED_DELETE\",\n );\n }\n if (!Object.hasOwn(target, key)) return true;\n if (!Reflect.deleteProperty(target, key)) {\n throw new TypeError(\n __DEV__ ? `ShadowStore: property \"${key}\" cannot be deleted` : \"SHADOW_STORE_DELETE\",\n );\n }\n const node = NODES.get(target);\n if (node === undefined) return true;\n notify(node.signals?.get(key));\n notify(node.keys);\n return true;\n}\n"],"mappings":";;;;AAGA,MAAM,gCAAqC,IAAI,IAAI;CAAC;CAAa;CAAe;AAAW,CAAC;;AAoB5F,MAAa,wBAAoC,IAAI,QAAQ;;AAG7D,MAAa,sBAA+B,IAAI,QAAQ;;AAGxD,SAAgB,cAAc,KAAsB;CAClD,OAAO,cAAc,IAAI,GAAG;AAC9B;;AAGA,SAAgB,YAAY,OAAiC;CAC3D,IAAI,OAAO,UAAU,YAAY,UAAU,MAAM,OAAO;CACxD,IAAI,MAAM,QAAQ,KAAK,GAAG,OAAO;CACjC,IAAI,UAAU,OAAO,WAAW,OAAO;CACvC,MAAM,YAAqB,OAAO,eAAe,KAAK;CACtD,OAAO,cAAc,OAAO,aAAa,cAAc;AACzD;;AAGA,SAAgB,YAAY,OAAyB;CACnD,IAAI,OAAO,UAAU,YAAY,UAAU,MAAM,OAAO;CACxD,OAAO,IAAI,IAAI,KAAK,KAAK;AAC3B;;AAGA,SAAS,cAAc,MAAuB;CAC5C,MAAM,uBAAO,IAAI,IAAY,CAAC,IAAI,CAAC;CACnC,MAAM,QAAkB,CAAC,IAAI;CAC7B,OAAO,MAAM,SAAS,GAAG;EACvB,MAAM,YAAY,MAAM,IAAI;EAC5B,KAAK,MAAM,OAAO,OAAO,KAAK,SAAS,GAAG;GACxC,MAAM,SAAkB,QAAQ,IAAI,WAAW,GAAG;GAClD,IAAI,OAAO,WAAW,YAAY,WAAW,MAAM;GACnD,IAAI,IAAI,IAAI,MAAM,GAAG,OAAO;GAC5B,IAAI,YAAY,MAAM,KAAK,CAAC,KAAK,IAAI,MAAM,GAAG;IAC5C,KAAK,IAAI,MAAM;IACf,MAAM,KAAK,MAAM;GACnB;EACF;CACF;CACA,OAAO;AACT;;;;;;;AAQA,SAAgB,WAAW,OAAyB;CAClD,MAAM,QAAQ,YAAY,KAAK;CAC/B,IAAI,UAAU,SAAS,CAAC,YAAY,KAAK,KAAK,CAAC,cAAc,KAAK,GAAG,OAAO;CAC5E,MAAM,yBAAS,IAAI,IAAoB;CACvC,MAAM,UAAU,WAA2B;EACzC,MAAM,WAAW,OAAO,IAAI,MAAM;EAClC,IAAI,aAAa,KAAA,GAAW,OAAO;EACnC,MAAM,OAAe,MAAM,QAAQ,MAAM,IAAI,CAAC,IAAI,OAAO,OAAO,OAAO,eAAe,MAAM,CAAC;EAC7F,OAAO,IAAI,QAAQ,IAAI;EACvB,OAAO;CACT;CACA,MAAM,WAAW,OAAO,KAAK;CAC7B,MAAM,QAAkB,CAAC,KAAK;CAC9B,KAAK,IAAI,OAAO,GAAG,OAAO,MAAM,QAAQ,QAAQ,GAAG;EACjD,MAAM,SAAS,MAAM;EACrB,MAAM,SAAS,OAAO,IAAI,MAAM;EAChC,KAAK,MAAM,OAAO,OAAO,KAAK,MAAM,GAAG;GACrC,IAAI,SAAkB,QAAQ,IAAI,QAAQ,GAAG;GAC7C,IAAI,OAAO,WAAW,YAAY,WAAW,MAAM;IACjD,MAAM,MAAM,IAAI,IAAI,MAAM;IAC1B,IAAI,QAAQ,KAAA,GAAW,SAAS;SAC3B,IAAI,YAAY,MAAM,GAAG;KAC5B,MAAM,QAAQ,OAAO,IAAI,MAAM;KAC/B,SAAS,OAAO,MAAM;KACtB,IAAI,CAAC,OAAO,MAAM,KAAK,QAAQ,IAAI,QAAQ,GAAG,CAAW;IAC3D;GACF;GACA,OAAO,eAAe,QAAQ,KAAK;IACjC,OAAO;IACP,YAAY;IACZ,UAAU;IACV,cAAc;GAChB,CAAC;EACH;CACF;CACA,OAAO;AACT;;AAGA,SAAgB,QAAQ,QAAgB,KAAsB;CAC5D,OAAO,QAAQ,IAAI,QAAQ,GAAG;AAChC;;AAGA,SAAgB,OAAO,KAAwB;CAC7C,IAAI,OAAO,MAAM,IAAI,GAAG;CACxB,IAAI,SAAS,KAAA,GAAW;EACtB,OAAO;GAAE,SAAS;GAAM,MAAM;GAAM,OAAO;EAAK;EAChD,MAAM,IAAI,KAAK,IAAI;CACrB;CACA,OAAO;AACT;;AAGA,MAAM,WAAW;AAEjB,SAAS,UAAU,MAAiB,KAAiC;CACnE,IAAI,UAAU,KAAK;CACnB,IAAI,YAAY,MAAM;EACpB,0BAAU,IAAI,IAAI;EAClB,KAAK,UAAU;CACjB;CACA,IAAI,SAAS,QAAQ,IAAI,GAAG;CAC5B,IAAI,WAAW,KAAA,GAAW;EAKxB,MAAM,OAAO,QAAQ;EACrB,IAAI,QAAQ,aAAa,OAAQ,OAAO,OAAQ,GAEzC;QAAA,MAAM,CAAC,OAAO,SAAS,SAC1B,KAAK,KAAK,WAAW,UAAU,OAAO,GAAG,QAAQ,OAAO,KAAK;EAAA;EAGjE,SAAS,IAAIA,OAAW,GAAG,KAAK;EAChC,QAAQ,IAAI,KAAK,MAAM;CACzB;CACA,OAAO;AACT;;AAGA,SAAgB,cAAc,MAAiB,KAAmB;CAChE,IAAI,CAAC,WAAW,GAAG;CACnB,MAAM,UAAU,MAAM,GAAG,CAAC;AAC5B;;AAGA,SAAgB,UAAU,MAAuB;CAC/C,IAAI,CAAC,WAAW,GAAG;CACnB,IAAI,KAAK,SAAS,MAAM,KAAK,OAAO,IAAIA,OAAW,GAAG,KAAK;CAC3D,MAAM,KAAK,IAAI;AACjB;;;;;AAMA,SAAS,OAAO,QAAqD;CACnE,IAAI,WAAW,KAAA,KAAa,WAAW,MAAM;CAC7C,SAAa,MAAM;AACrB;AAEA,SAAS,WAAW,KAAsB;CACxC,MAAM,QAAQ,OAAO,GAAG;CACxB,OAAO,OAAO,UAAU,KAAK,KAAK,SAAS,KAAK,OAAO,KAAK,MAAM;AACpE;;AAGA,SAAS,kBAAkB,MAAiB,MAAoB;CAC9D,MAAM,UAAU,KAAK;CACrB,IAAI,YAAY,MAAM;CACtB,KAAK,MAAM,CAAC,KAAK,WAAW,SAC1B,IAAI,WAAW,GAAG,KAAK,OAAO,GAAG,KAAK,MAAM,OAAO,MAAM;AAE7D;;;;;;AAOA,SAAgB,SAAS,QAAgB,KAAa,OAAyB;CAC7E,IAAI,cAAc,GAAG,GACnB,MAAM,IAAI,UAEJ,iBAAiB,IAAI,0CAE3B;CAEF,QAAQ,WAAW,KAAK;CACxB,MAAM,QAAQ,MAAM,QAAQ,MAAM;CAClC,MAAM,MAAM,OAAO,OAAO,QAAQ,GAAG;CACrC,IAAI,OAAO,OAAO,GAAG,QAAQ,QAAQ,GAAG,GAAG,KAAK,GAAG,OAAO;CAC1D,MAAM,SAAS,QAAS,OAAqB,SAAS;CACtD,IAAI,CAAC,QAAQ,IAAI,QAAQ,KAAK,KAAK,GACjC,MAAM,IAAI,UAEJ,0BAA0B,IAAI,qCAEpC;CAEF,MAAM,OAAO,MAAM,IAAI,MAAM;CAC7B,IAAI,SAAS,KAAA,GAAW,OAAO;CAC/B,OAAO,KAAK,SAAS,IAAI,GAAG,CAAC;CAC7B,IAAI,CAAC,KAAK,OAAO,KAAK,IAAI;CAC1B,IAAI,OAAO;EACT,MAAM,QAAS,OAAqB;EACpC,IAAI,UAAU,QAAQ;GACpB,OAAO,KAAK,SAAS,IAAI,QAAQ,CAAC;GAClC,OAAO,KAAK,IAAI;GAChB,IAAI,QAAQ,QAAQ,kBAAkB,MAAM,KAAK;EACnD;CACF;CACA,OAAO;AACT;;AAGA,SAAgB,UAAU,QAAgB,KAAsB;CAC9D,IAAI,cAAc,GAAG,GACnB,MAAM,IAAI,UAEJ,iBAAiB,IAAI,0CAE3B;CAEF,IAAI,CAAC,OAAO,OAAO,QAAQ,GAAG,GAAG,OAAO;CACxC,IAAI,CAAC,QAAQ,eAAe,QAAQ,GAAG,GACrC,MAAM,IAAI,UACE,0BAA0B,IAAI,oBAC1C;CAEF,MAAM,OAAO,MAAM,IAAI,MAAM;CAC7B,IAAI,SAAS,KAAA,GAAW,OAAO;CAC/B,OAAO,KAAK,SAAS,IAAI,GAAG,CAAC;CAC7B,OAAO,KAAK,IAAI;CAChB,OAAO;AACT"}
|
|
1
|
+
{"version":3,"file":"nodes.js","names":["SignalNode"],"sources":["../../../src/store/nodes.ts"],"sourcesContent":["import { isTracking, notify as notifySource, SignalNode, track } from \"../extend\";\n\n/** Keys that could reach `Object.prototype` if written; they are never stored as own properties. */\nconst RESERVED_KEYS: ReadonlySet<string> = new Set([\"__proto__\", \"constructor\", \"prototype\"]);\n\n/**\n * Tracking state of one plain object or array. Signals are created lazily, on the first read made\n * inside a tracked computation, so untracked data costs one small record per object.\n */\nexport interface NodeState {\n /**\n * One signal per property read in a tracked context, keyed by property name. A signal is only a\n * notifier (it holds no value), so one that nothing observes any more is dropped by a sweep (see\n * `signalFor`) and a later read simply makes a new one.\n */\n signals: Map<string, SignalNode<number>> | null;\n /** Notified when a property is added or removed, or an array changes length. */\n keys: SignalNode<number> | null;\n /** The read-only proxy for this object, created on first read. */\n proxy: object | null;\n}\n\n/** Raw object -> its tracking state. Keys are the raw data, so nothing is stamped on user objects. */\nexport const NODES: WeakMap<object, NodeState> = new WeakMap();\n\n/** Any store proxy (read-only or draft) -> the raw object it wraps. */\nexport const RAW: WeakMap<object, object> = new WeakMap();\n\n/** True for the keys that must never be written as own properties. */\nexport function isReservedKey(key: string): boolean {\n return RESERVED_KEYS.has(key);\n}\n\n/** True for the values the store wraps: plain objects (null or Object.prototype) and arrays. */\nexport function isWrappable(value: unknown): value is object {\n if (typeof value !== \"object\" || value === null) return false;\n if (Array.isArray(value)) return true;\n if (value === Object.prototype) return false;\n const prototype: unknown = Object.getPrototypeOf(value);\n return prototype === Object.prototype || prototype === null;\n}\n\n/** Replaces a store proxy by the raw object it wraps; any other value is returned as is. */\nexport function unwrapValue(value: unknown): unknown {\n if (typeof value !== \"object\" || value === null) return value;\n return RAW.get(value) ?? value;\n}\n\n/** True when a store proxy (draft or read-only view) sits anywhere inside the plain data `root`. */\nfunction containsProxy(root: object): boolean {\n const seen = new Set<object>([root]);\n const stack: object[] = [root];\n while (stack.length > 0) {\n const container = stack.pop() as object;\n for (const key of Object.keys(container)) {\n const member: unknown = Reflect.get(container, key);\n if (typeof member !== \"object\" || member === null) continue;\n if (RAW.has(member)) return true;\n if (isWrappable(member) && !seen.has(member)) {\n seen.add(member);\n stack.push(member);\n }\n }\n }\n return false;\n}\n\n/**\n * Like {@link unwrapValue}, and also for proxies hidden inside plain data: `draft.todos =\n * draft.todos.filter(...)` assigns an array whose members are drafts, and a draft stored in the\n * data would throw on its next use. Data without proxies is returned as is; otherwise a copy with\n * every proxy replaced by its raw object. Iterative, so nesting depth is not limited by the stack.\n */\nexport function unwrapDeep(value: unknown): unknown {\n const first = unwrapValue(value);\n if (first !== value || !isWrappable(first) || !containsProxy(first)) return first;\n const copies = new Map<object, object>();\n const copyOf = (source: object): object => {\n const existing = copies.get(source);\n if (existing !== undefined) return existing;\n const made: object = Array.isArray(source) ? [] : Object.create(Object.getPrototypeOf(source));\n copies.set(source, made);\n return made;\n };\n const rootCopy = copyOf(first);\n const queue: object[] = [first];\n for (let head = 0; head < queue.length; head += 1) {\n const source = queue[head] as object;\n const target = copies.get(source) as object;\n for (const key of Object.keys(source)) {\n let member: unknown = Reflect.get(source, key);\n if (typeof member === \"object\" && member !== null) {\n const raw = RAW.get(member);\n if (raw !== undefined) member = raw;\n else if (isWrappable(member)) {\n const known = copies.has(member);\n member = copyOf(member);\n if (!known) queue.push(Reflect.get(source, key) as object);\n }\n }\n Object.defineProperty(target, key, {\n value: member,\n enumerable: true,\n writable: true,\n configurable: true,\n });\n }\n }\n return rootCopy;\n}\n\n/** Reads an own or inherited property without tracking and without invoking proxies. */\nexport function readRaw(target: object, key: string): unknown {\n return Reflect.get(target, key);\n}\n\n/** Returns the tracking state of `raw`, creating an empty one on first use. */\nexport function nodeOf(raw: object): NodeState {\n let node = NODES.get(raw);\n if (node === undefined) {\n node = { signals: null, keys: null, proxy: null };\n NODES.set(raw, node);\n }\n return node;\n}\n\n/** The map size at which the first sweep of unobserved key signals runs. */\nconst SWEEP_AT = 256;\n\nfunction signalFor(node: NodeState, key: string): SignalNode<number> {\n let signals = node.signals;\n if (signals === null) {\n signals = new Map();\n node.signals = signals;\n }\n let signal = signals.get(key);\n if (signal === undefined) {\n // Reading many transient keys (`store.byId[id]` with churning ids) would keep one signal per key\n // for the life of the store. The sweep runs when the map reaches a power of two from SWEEP_AT on,\n // so its cost is amortized O(1) per new key, and the map stays within about twice the number of\n // keys that are observed at that moment (plus SWEEP_AT).\n const size = signals.size;\n if (size >= SWEEP_AT && (size & (size - 1)) === 0) {\n // Safe at any time: a signal carries no value, and the next read of its key makes a fresh one.\n for (const [other, node] of signals) {\n if ((node.observers?.length ?? 0) === 0) signals.delete(other);\n }\n }\n signal = new SignalNode(0, false);\n signals.set(key, signal);\n }\n return signal;\n}\n\n/** Subscribes the running computation (if any) to one property of the object. */\nexport function trackProperty(node: NodeState, key: string): void {\n if (!isTracking()) return;\n track(signalFor(node, key));\n}\n\n/** Subscribes the running computation (if any) to the key set of the object. */\nexport function trackKeys(node: NodeState): void {\n if (!isTracking()) return;\n if (node.keys === null) node.keys = new SignalNode(0, false);\n track(node.keys);\n}\n\n/**\n * Notifies the observers of one signal. The same engine steps as a signal write: mark the\n * observers dirty, then request a flush (which the surrounding batch defers).\n */\nfunction notify(signal: SignalNode<number> | null | undefined): void {\n if (signal === undefined || signal === null) return;\n notifySource(signal);\n}\n\nfunction isIndexKey(key: string): boolean {\n const index = Number(key);\n return Number.isInteger(index) && index >= 0 && String(index) === key;\n}\n\n/** Notifies the index signals of an array at or beyond `from` (used when the array shrinks). */\nfunction notifyIndicesFrom(node: NodeState, from: number): void {\n const signals = node.signals;\n if (signals === null) return;\n for (const [key, signal] of signals) {\n if (isIndexKey(key) && Number(key) >= from) notify(signal);\n }\n}\n\n/**\n * Writes one property of a raw object and notifies exactly what changed: the property's signal,\n * the key set when a property appears, and the length when an array's length moves. An equal\n * value (Object.is) writes nothing. Returns whether anything changed.\n */\nexport function writeRaw(target: object, key: string, value: unknown): boolean {\n if (isReservedKey(key)) {\n throw new TypeError(\n __DEV__\n ? `ShadowStore: \"${key}\" cannot be written; it is a reserved key`\n : \"SHADOW_STORE_RESERVED_KEY\",\n );\n }\n value = unwrapDeep(value);\n const array = Array.isArray(target);\n const had = Object.hasOwn(target, key);\n if (had && Object.is(readRaw(target, key), value)) return false;\n const before = array ? (target as unknown[]).length : 0;\n if (!Reflect.set(target, key, value)) {\n throw new TypeError(\n __DEV__\n ? `ShadowStore: property \"${key}\" is read-only and cannot be written`\n : \"SHADOW_STORE_PROP_READ_ONLY\",\n );\n }\n const node = NODES.get(target);\n if (node === undefined) return true;\n notify(node.signals?.get(key));\n if (!had) notify(node.keys);\n if (array) {\n const after = (target as unknown[]).length;\n if (after !== before) {\n notify(node.signals?.get(\"length\"));\n notify(node.keys);\n if (after < before) notifyIndicesFrom(node, after);\n }\n }\n return true;\n}\n\n/**\n * Deletes one own property of a raw object and notifies its signal and the key set. A reserved key is\n * refused unless `cleanup` is set: removing an own data property named `__proto__` (it arrived in parsed\n * JSON) cannot reach a prototype, and `reconcile` must be able to clear it like any other stale key.\n */\nexport function deleteRaw(target: object, key: string, cleanup = false): boolean {\n if (!cleanup && isReservedKey(key)) {\n throw new TypeError(\n __DEV__\n ? `ShadowStore: \"${key}\" cannot be deleted; it is a reserved key`\n : \"SHADOW_STORE_RESERVED_DELETE\",\n );\n }\n if (!Object.hasOwn(target, key)) return true;\n if (!Reflect.deleteProperty(target, key)) {\n throw new TypeError(\n __DEV__ ? `ShadowStore: property \"${key}\" cannot be deleted` : \"SHADOW_STORE_DELETE\",\n );\n }\n const node = NODES.get(target);\n if (node === undefined) return true;\n notify(node.signals?.get(key));\n notify(node.keys);\n return true;\n}\n"],"mappings":";;;;AAGA,MAAM,gCAAqC,IAAI,IAAI;CAAC;CAAa;CAAe;AAAW,CAAC;;AAoB5F,MAAa,wBAAoC,IAAI,QAAQ;;AAG7D,MAAa,sBAA+B,IAAI,QAAQ;;AAGxD,SAAgB,cAAc,KAAsB;CAClD,OAAO,cAAc,IAAI,GAAG;AAC9B;;AAGA,SAAgB,YAAY,OAAiC;CAC3D,IAAI,OAAO,UAAU,YAAY,UAAU,MAAM,OAAO;CACxD,IAAI,MAAM,QAAQ,KAAK,GAAG,OAAO;CACjC,IAAI,UAAU,OAAO,WAAW,OAAO;CACvC,MAAM,YAAqB,OAAO,eAAe,KAAK;CACtD,OAAO,cAAc,OAAO,aAAa,cAAc;AACzD;;AAGA,SAAgB,YAAY,OAAyB;CACnD,IAAI,OAAO,UAAU,YAAY,UAAU,MAAM,OAAO;CACxD,OAAO,IAAI,IAAI,KAAK,KAAK;AAC3B;;AAGA,SAAS,cAAc,MAAuB;CAC5C,MAAM,uBAAO,IAAI,IAAY,CAAC,IAAI,CAAC;CACnC,MAAM,QAAkB,CAAC,IAAI;CAC7B,OAAO,MAAM,SAAS,GAAG;EACvB,MAAM,YAAY,MAAM,IAAI;EAC5B,KAAK,MAAM,OAAO,OAAO,KAAK,SAAS,GAAG;GACxC,MAAM,SAAkB,QAAQ,IAAI,WAAW,GAAG;GAClD,IAAI,OAAO,WAAW,YAAY,WAAW,MAAM;GACnD,IAAI,IAAI,IAAI,MAAM,GAAG,OAAO;GAC5B,IAAI,YAAY,MAAM,KAAK,CAAC,KAAK,IAAI,MAAM,GAAG;IAC5C,KAAK,IAAI,MAAM;IACf,MAAM,KAAK,MAAM;GACnB;EACF;CACF;CACA,OAAO;AACT;;;;;;;AAQA,SAAgB,WAAW,OAAyB;CAClD,MAAM,QAAQ,YAAY,KAAK;CAC/B,IAAI,UAAU,SAAS,CAAC,YAAY,KAAK,KAAK,CAAC,cAAc,KAAK,GAAG,OAAO;CAC5E,MAAM,yBAAS,IAAI,IAAoB;CACvC,MAAM,UAAU,WAA2B;EACzC,MAAM,WAAW,OAAO,IAAI,MAAM;EAClC,IAAI,aAAa,KAAA,GAAW,OAAO;EACnC,MAAM,OAAe,MAAM,QAAQ,MAAM,IAAI,CAAC,IAAI,OAAO,OAAO,OAAO,eAAe,MAAM,CAAC;EAC7F,OAAO,IAAI,QAAQ,IAAI;EACvB,OAAO;CACT;CACA,MAAM,WAAW,OAAO,KAAK;CAC7B,MAAM,QAAkB,CAAC,KAAK;CAC9B,KAAK,IAAI,OAAO,GAAG,OAAO,MAAM,QAAQ,QAAQ,GAAG;EACjD,MAAM,SAAS,MAAM;EACrB,MAAM,SAAS,OAAO,IAAI,MAAM;EAChC,KAAK,MAAM,OAAO,OAAO,KAAK,MAAM,GAAG;GACrC,IAAI,SAAkB,QAAQ,IAAI,QAAQ,GAAG;GAC7C,IAAI,OAAO,WAAW,YAAY,WAAW,MAAM;IACjD,MAAM,MAAM,IAAI,IAAI,MAAM;IAC1B,IAAI,QAAQ,KAAA,GAAW,SAAS;SAC3B,IAAI,YAAY,MAAM,GAAG;KAC5B,MAAM,QAAQ,OAAO,IAAI,MAAM;KAC/B,SAAS,OAAO,MAAM;KACtB,IAAI,CAAC,OAAO,MAAM,KAAK,QAAQ,IAAI,QAAQ,GAAG,CAAW;IAC3D;GACF;GACA,OAAO,eAAe,QAAQ,KAAK;IACjC,OAAO;IACP,YAAY;IACZ,UAAU;IACV,cAAc;GAChB,CAAC;EACH;CACF;CACA,OAAO;AACT;;AAGA,SAAgB,QAAQ,QAAgB,KAAsB;CAC5D,OAAO,QAAQ,IAAI,QAAQ,GAAG;AAChC;;AAGA,SAAgB,OAAO,KAAwB;CAC7C,IAAI,OAAO,MAAM,IAAI,GAAG;CACxB,IAAI,SAAS,KAAA,GAAW;EACtB,OAAO;GAAE,SAAS;GAAM,MAAM;GAAM,OAAO;EAAK;EAChD,MAAM,IAAI,KAAK,IAAI;CACrB;CACA,OAAO;AACT;;AAGA,MAAM,WAAW;AAEjB,SAAS,UAAU,MAAiB,KAAiC;CACnE,IAAI,UAAU,KAAK;CACnB,IAAI,YAAY,MAAM;EACpB,0BAAU,IAAI,IAAI;EAClB,KAAK,UAAU;CACjB;CACA,IAAI,SAAS,QAAQ,IAAI,GAAG;CAC5B,IAAI,WAAW,KAAA,GAAW;EAKxB,MAAM,OAAO,QAAQ;EACrB,IAAI,QAAQ,aAAa,OAAQ,OAAO,OAAQ,GAEzC;QAAA,MAAM,CAAC,OAAO,SAAS,SAC1B,KAAK,KAAK,WAAW,UAAU,OAAO,GAAG,QAAQ,OAAO,KAAK;EAAA;EAGjE,SAAS,IAAIA,OAAW,GAAG,KAAK;EAChC,QAAQ,IAAI,KAAK,MAAM;CACzB;CACA,OAAO;AACT;;AAGA,SAAgB,cAAc,MAAiB,KAAmB;CAChE,IAAI,CAAC,WAAW,GAAG;CACnB,MAAM,UAAU,MAAM,GAAG,CAAC;AAC5B;;AAGA,SAAgB,UAAU,MAAuB;CAC/C,IAAI,CAAC,WAAW,GAAG;CACnB,IAAI,KAAK,SAAS,MAAM,KAAK,OAAO,IAAIA,OAAW,GAAG,KAAK;CAC3D,MAAM,KAAK,IAAI;AACjB;;;;;AAMA,SAAS,OAAO,QAAqD;CACnE,IAAI,WAAW,KAAA,KAAa,WAAW,MAAM;CAC7C,SAAa,MAAM;AACrB;AAEA,SAAS,WAAW,KAAsB;CACxC,MAAM,QAAQ,OAAO,GAAG;CACxB,OAAO,OAAO,UAAU,KAAK,KAAK,SAAS,KAAK,OAAO,KAAK,MAAM;AACpE;;AAGA,SAAS,kBAAkB,MAAiB,MAAoB;CAC9D,MAAM,UAAU,KAAK;CACrB,IAAI,YAAY,MAAM;CACtB,KAAK,MAAM,CAAC,KAAK,WAAW,SAC1B,IAAI,WAAW,GAAG,KAAK,OAAO,GAAG,KAAK,MAAM,OAAO,MAAM;AAE7D;;;;;;AAOA,SAAgB,SAAS,QAAgB,KAAa,OAAyB;CAC7E,IAAI,cAAc,GAAG,GACnB,MAAM,IAAI,UAEJ,iBAAiB,IAAI,0CAE3B;CAEF,QAAQ,WAAW,KAAK;CACxB,MAAM,QAAQ,MAAM,QAAQ,MAAM;CAClC,MAAM,MAAM,OAAO,OAAO,QAAQ,GAAG;CACrC,IAAI,OAAO,OAAO,GAAG,QAAQ,QAAQ,GAAG,GAAG,KAAK,GAAG,OAAO;CAC1D,MAAM,SAAS,QAAS,OAAqB,SAAS;CACtD,IAAI,CAAC,QAAQ,IAAI,QAAQ,KAAK,KAAK,GACjC,MAAM,IAAI,UAEJ,0BAA0B,IAAI,qCAEpC;CAEF,MAAM,OAAO,MAAM,IAAI,MAAM;CAC7B,IAAI,SAAS,KAAA,GAAW,OAAO;CAC/B,OAAO,KAAK,SAAS,IAAI,GAAG,CAAC;CAC7B,IAAI,CAAC,KAAK,OAAO,KAAK,IAAI;CAC1B,IAAI,OAAO;EACT,MAAM,QAAS,OAAqB;EACpC,IAAI,UAAU,QAAQ;GACpB,OAAO,KAAK,SAAS,IAAI,QAAQ,CAAC;GAClC,OAAO,KAAK,IAAI;GAChB,IAAI,QAAQ,QAAQ,kBAAkB,MAAM,KAAK;EACnD;CACF;CACA,OAAO;AACT;;;;;;AAOA,SAAgB,UAAU,QAAgB,KAAa,UAAU,OAAgB;CAC/E,IAAI,CAAC,WAAW,cAAc,GAAG,GAC/B,MAAM,IAAI,UAEJ,iBAAiB,IAAI,0CAE3B;CAEF,IAAI,CAAC,OAAO,OAAO,QAAQ,GAAG,GAAG,OAAO;CACxC,IAAI,CAAC,QAAQ,eAAe,QAAQ,GAAG,GACrC,MAAM,IAAI,UACE,0BAA0B,IAAI,oBAC1C;CAEF,MAAM,OAAO,MAAM,IAAI,MAAM;CAC7B,IAAI,SAAS,KAAA,GAAW,OAAO;CAC/B,OAAO,KAAK,SAAS,IAAI,GAAG,CAAC;CAC7B,OAAO,KAAK,IAAI;CAChB,OAAO;AACT"}
|
|
@@ -111,7 +111,7 @@ function mergeObject(target, source, spec, enqueue) {
|
|
|
111
111
|
writeRaw(target, key, value);
|
|
112
112
|
}
|
|
113
113
|
if (spec.merge) return;
|
|
114
|
-
for (const key of Object.keys(target)) if (!Object.hasOwn(source, key)) deleteRaw(target, key);
|
|
114
|
+
for (const key of Object.keys(target)) if (!Object.hasOwn(source, key)) deleteRaw(target, key, true);
|
|
115
115
|
}
|
|
116
116
|
function mergeArray(target, source, spec, enqueue) {
|
|
117
117
|
const list = target;
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"reconcile.js","names":[],"sources":["../../../src/store/reconcile.ts"],"sourcesContent":["import { deleteRaw, isReservedKey, isWrappable, unwrapValue, writeRaw } from \"./nodes\";\nimport type { Reconciler } from \"./types\";\n\n/**\n * Options of {@link reconcile}.\n * @since 1.0.0\n */\nexport interface ReconcileOptions {\n /**\n * Identity of array items: the name of a field (`\"id\"`) or a function returning the identity.\n * Items without an identity (not an object, or the field is absent, or the function returns\n * `undefined`) are matched by position.\n * @default \"id\"\n */\n key?: string | ((item: unknown) => unknown);\n /**\n * Keep keys, and array items, that `next` does not contain. When false, keys missing from `next`\n * are deleted and arrays are truncated to its length; when true, unmatched old array items are\n * kept after the new ones.\n * @default false\n */\n merge?: boolean;\n}\n\n/**\n * What a reconciler carries from `reconcile()` to `setStore`. Not re-exported by any entry: only\n * the store setter reads it.\n * @internal\n */\nexport interface ReconcileSpec {\n /** The desired data, as passed to `reconcile()` (it may still be a store proxy). */\n readonly next: unknown;\n /** Identity of array items, resolved from {@link ReconcileOptions.key}. */\n readonly key: string | ((item: unknown) => unknown);\n /** Whether keys and items absent from `next` are kept, from {@link ReconcileOptions.merge}. */\n readonly merge: boolean;\n}\n\n/** Each reconciler function maps to its spec. Keys are the reconciler functions themselves. */\nconst SPECS: WeakMap<object, ReconcileSpec> = new WeakMap();\n\n/**\n * Looks up the spec of a reconciler created by {@link reconcile}. Not re-exported by any entry: the\n * store setter uses it to tell a reconciler from a draft updater.\n *\n * @param update Any function or object passed to `setStore`.\n * @returns The spec, or `undefined` when `update` is not a `reconcile()` result.\n * @internal\n */\nexport function specOf(update: object): ReconcileSpec | undefined {\n return SPECS.get(update);\n}\n\n/**\n * Describes a new value for a store. Passed to `setStore`, it changes only what differs from the\n * current state: objects are merged key by key, arrays are matched by `key` so retained items keep\n * their identity, and unchanged leaves are not written. Nothing is applied until `setStore` runs.\n * Use it to apply fresh server data to a store without re-rendering what did not change.\n *\n * @param next The desired data. Store proxies are accepted and unwrapped.\n * @param options Item identity (`key`) and whether to keep absent keys (`merge`). Undefined uses\n * the defaults (`key: \"id\"`, `merge: false`).\n * @returns A reconciler to pass to `setStore`, alone or as the last argument of a path.\n * @throws TypeError (production message `SHADOW_STORE_RECONCILE`) when the returned reconciler is\n * called directly instead of being passed to `setStore`. `setStore` throws TypeError\n * (`SHADOW_STORE_RECONCILE_SHAPE`) when `next` is not the same kind of container (object or\n * array) as the value it reconciles.\n * @example\n * import { reconcile, useStore } from \"@shadow-js/core\";\n *\n * interface Todo { id: number; title: string; done: boolean }\n * const [todos, setTodos] = useStore({ items: [] as Todo[] });\n *\n * async function refresh(): Promise<void> {\n * const response = await fetch(\"/api/todos\");\n * setTodos(\"items\", reconcile((await response.json()) as Todo[], { key: \"id\" }));\n * }\n * @see useStore\n * @since 1.0.0\n */\nexport function reconcile<T>(next: T, options?: ReconcileOptions): Reconciler<T> {\n const spec: ReconcileSpec = {\n next,\n key: options?.key ?? \"id\",\n merge: options?.merge === true,\n };\n const reconciler: Reconciler<T> = () => {\n throw new TypeError(\n __DEV__\n ? \"ShadowStore: a reconcile() result must be passed to setStore()\"\n : \"SHADOW_STORE_RECONCILE\",\n );\n };\n SPECS.set(reconciler, spec);\n return reconciler;\n}\n\ninterface Frame {\n readonly target: object;\n readonly source: object;\n}\n\n/** Field name or function giving an item's identity; `undefined` means the item has none. */\nfunction identityOf(item: unknown, key: string | ((item: unknown) => unknown)): unknown {\n if (!isWrappable(item)) return undefined;\n if (typeof key === \"function\") return key(item);\n return Object.hasOwn(item, key) ? Reflect.get(item, key) : undefined;\n}\n\n/** Same container kind: both arrays or both objects. */\nfunction sameKind(a: object, b: object): boolean {\n return Array.isArray(a) === Array.isArray(b);\n}\n\n/**\n * Applies a reconciler to the store root. The diff is iterative: pending (target, source) pairs\n * live on an explicit stack, so data nested thousands of levels deep cannot overflow the call\n * stack. Each pair is visited once, which also terminates on cyclic input. Not re-exported by any\n * entry: only the store setter calls it, inside its transaction.\n *\n * @param root The raw (unwrapped) object or array to update in place.\n * @param spec The reconciler's spec, from {@link specOf}.\n * @param label The store label for messages (` (name)`, or an empty string).\n * @throws TypeError (production message `SHADOW_STORE_RECONCILE_SHAPE`) when `spec.next` is not the\n * same kind of container as `root`.\n * @internal\n */\nexport function applyReconcile(root: object, spec: ReconcileSpec, label: string): void {\n const next = unwrapValue(spec.next);\n if (!isWrappable(next) || !sameKind(root, next)) {\n throw new TypeError(\n __DEV__\n ? `ShadowStore${label}: reconcile() needs data of the same shape as the store root (an object or an array)`\n : \"SHADOW_STORE_RECONCILE_SHAPE\",\n );\n }\n const stack: Frame[] = [];\n const seen = new Map<object, Set<object>>();\n const enqueue = (target: object, source: object): void => {\n let targets = seen.get(source);\n if (targets === undefined) {\n targets = new Set();\n seen.set(source, targets);\n }\n if (targets.has(target)) return;\n targets.add(target);\n stack.push({ target, source });\n };\n\n enqueue(root, next);\n for (let frame = stack.pop(); frame !== undefined; frame = stack.pop()) {\n if (Array.isArray(frame.source)) mergeArray(frame.target, frame.source, spec, enqueue);\n else mergeObject(frame.target, frame.source, spec, enqueue);\n }\n}\n\nfunction mergeObject(\n target: object,\n source: object,\n spec: ReconcileSpec,\n enqueue: (target: object, source: object) => void,\n): void {\n for (const key of Object.keys(source)) {\n if (isReservedKey(key)) continue;\n const value = unwrapValue(Reflect.get(source, key));\n const had = Object.hasOwn(target, key);\n const current: unknown = had ? Reflect.get(target, key) : undefined;\n if (had && Object.is(current, value)) continue;\n if (had && isWrappable(current) && isWrappable(value) && sameKind(current, value)) {\n enqueue(current, value);\n continue;\n }\n writeRaw(target, key, value);\n }\n if (spec.merge) return;\n for (const key of Object.keys(target)) {\n if (!Object.hasOwn(source, key)) deleteRaw(target, key);\n }\n}\n\nfunction mergeArray(\n target: object,\n source: object,\n spec: ReconcileSpec,\n enqueue: (target: object, source: object) => void,\n): void {\n const list = target as unknown[];\n const incoming = source as unknown[];\n // Copy first: matching reads the old positions, while the writes below move items.\n const original = list.slice();\n const identities = original.map((item) => identityOf(item, spec.key));\n const byIdentity = new Map<unknown, number>();\n for (let index = 0; index < original.length; index += 1) {\n const identity = identities[index];\n if (identity !== undefined && !byIdentity.has(identity)) byIdentity.set(identity, index);\n }\n\n const used: boolean[] = new Array<boolean>(original.length).fill(false);\n const matches: number[] = [];\n for (let position = 0; position < incoming.length; position += 1) {\n const item = unwrapValue(incoming[position]);\n const identity = identityOf(item, spec.key);\n let match = -1;\n if (identity !== undefined) {\n const found = byIdentity.get(identity);\n if (found !== undefined && used[found] !== true) match = found;\n } else if (position < original.length && identities[position] === undefined) {\n if (used[position] !== true) match = position;\n }\n if (match !== -1) used[match] = true;\n matches.push(match);\n }\n\n const values: unknown[] = [];\n for (let position = 0; position < incoming.length; position += 1) {\n const item = unwrapValue(incoming[position]);\n const match = matches[position] ?? -1;\n if (match === -1) {\n values.push(item);\n continue;\n }\n const previous = original[match];\n if (isWrappable(previous) && isWrappable(item) && sameKind(previous, item)) {\n if (previous !== item) enqueue(previous, item);\n values.push(previous);\n } else {\n values.push(item);\n }\n }\n if (spec.merge) {\n for (let index = 0; index < original.length; index += 1) {\n if (used[index] !== true) values.push(original[index]);\n }\n }\n\n for (let position = 0; position < values.length; position += 1) {\n writeRaw(target, String(position), values[position]);\n }\n if (list.length > values.length) writeRaw(target, \"length\", values.length);\n}\n\n/**\n * Marks a draft updater. It is the function itself (`setStore(produce((d) => { d.n += 1 }))` is\n * `setStore((d) => { d.n += 1 })`); it exists so code written for other libraries migrates as is.\n *\n * @param update The draft updater: it mutates the draft it receives.\n * @returns `update`, unchanged.\n * @example\n * import { produce, useStore } from \"@shadow-js/core\";\n *\n * const [cart, setCart] = useStore({ items: [] as string[], count: 0 });\n * setCart(\n * produce((draft) => {\n * draft.items.push(\"apple\");\n * draft.count += 1;\n * }),\n * );\n * console.log(cart.count); // 1\n * @see useStore\n * @since 1.0.0\n */\nexport function produce<T>(update: (draft: T) => void): (draft: T) => void {\n return update;\n}\n"],"mappings":";;;AAuCA,MAAM,wBAAwC,IAAI,QAAQ;;;;;;;;;AAU1D,SAAgB,OAAO,QAA2C;CAChE,OAAO,MAAM,IAAI,MAAM;AACzB;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA6BA,SAAgB,UAAa,MAAS,SAA2C;CAC/E,MAAM,OAAsB;EAC1B;EACA,KAAK,SAAS,OAAO;EACrB,OAAO,SAAS,UAAU;CAC5B;CACA,MAAM,mBAAkC;EACtC,MAAM,IAAI,UAEJ,gEAEN;CACF;CACA,MAAM,IAAI,YAAY,IAAI;CAC1B,OAAO;AACT;;AAQA,SAAS,WAAW,MAAe,KAAqD;CACtF,IAAI,CAAC,YAAY,IAAI,GAAG,OAAO,KAAA;CAC/B,IAAI,OAAO,QAAQ,YAAY,OAAO,IAAI,IAAI;CAC9C,OAAO,OAAO,OAAO,MAAM,GAAG,IAAI,QAAQ,IAAI,MAAM,GAAG,IAAI,KAAA;AAC7D;;AAGA,SAAS,SAAS,GAAW,GAAoB;CAC/C,OAAO,MAAM,QAAQ,CAAC,MAAM,MAAM,QAAQ,CAAC;AAC7C;;;;;;;;;;;;;;AAeA,SAAgB,eAAe,MAAc,MAAqB,OAAqB;CACrF,MAAM,OAAO,YAAY,KAAK,IAAI;CAClC,IAAI,CAAC,YAAY,IAAI,KAAK,CAAC,SAAS,MAAM,IAAI,GAC5C,MAAM,IAAI,UAEJ,cAAc,MAAM,qFAE1B;CAEF,MAAM,QAAiB,CAAC;CACxB,MAAM,uBAAO,IAAI,IAAyB;CAC1C,MAAM,WAAW,QAAgB,WAAyB;EACxD,IAAI,UAAU,KAAK,IAAI,MAAM;EAC7B,IAAI,YAAY,KAAA,GAAW;GACzB,0BAAU,IAAI,IAAI;GAClB,KAAK,IAAI,QAAQ,OAAO;EAC1B;EACA,IAAI,QAAQ,IAAI,MAAM,GAAG;EACzB,QAAQ,IAAI,MAAM;EAClB,MAAM,KAAK;GAAE;GAAQ;EAAO,CAAC;CAC/B;CAEA,QAAQ,MAAM,IAAI;CAClB,KAAK,IAAI,QAAQ,MAAM,IAAI,GAAG,UAAU,KAAA,GAAW,QAAQ,MAAM,IAAI,GACnE,IAAI,MAAM,QAAQ,MAAM,MAAM,GAAG,WAAW,MAAM,QAAQ,MAAM,QAAQ,MAAM,OAAO;MAChF,YAAY,MAAM,QAAQ,MAAM,QAAQ,MAAM,OAAO;AAE9D;AAEA,SAAS,YACP,QACA,QACA,MACA,SACM;CACN,KAAK,MAAM,OAAO,OAAO,KAAK,MAAM,GAAG;EACrC,IAAI,cAAc,GAAG,GAAG;EACxB,MAAM,QAAQ,YAAY,QAAQ,IAAI,QAAQ,GAAG,CAAC;EAClD,MAAM,MAAM,OAAO,OAAO,QAAQ,GAAG;EACrC,MAAM,UAAmB,MAAM,QAAQ,IAAI,QAAQ,GAAG,IAAI,KAAA;EAC1D,IAAI,OAAO,OAAO,GAAG,SAAS,KAAK,GAAG;EACtC,IAAI,OAAO,YAAY,OAAO,KAAK,YAAY,KAAK,KAAK,SAAS,SAAS,KAAK,GAAG;GACjF,QAAQ,SAAS,KAAK;GACtB;EACF;EACA,SAAS,QAAQ,KAAK,KAAK;CAC7B;CACA,IAAI,KAAK,OAAO;CAChB,KAAK,MAAM,OAAO,OAAO,KAAK,MAAM,GAClC,IAAI,CAAC,OAAO,OAAO,QAAQ,GAAG,GAAG,UAAU,QAAQ,GAAG;AAE1D;AAEA,SAAS,WACP,QACA,QACA,MACA,SACM;CACN,MAAM,OAAO;CACb,MAAM,WAAW;CAEjB,MAAM,WAAW,KAAK,MAAM;CAC5B,MAAM,aAAa,SAAS,KAAK,SAAS,WAAW,MAAM,KAAK,GAAG,CAAC;CACpE,MAAM,6BAAa,IAAI,IAAqB;CAC5C,KAAK,IAAI,QAAQ,GAAG,QAAQ,SAAS,QAAQ,SAAS,GAAG;EACvD,MAAM,WAAW,WAAW;EAC5B,IAAI,aAAa,KAAA,KAAa,CAAC,WAAW,IAAI,QAAQ,GAAG,WAAW,IAAI,UAAU,KAAK;CACzF;CAEA,MAAM,OAAkB,IAAI,MAAe,SAAS,MAAM,CAAC,CAAC,KAAK,KAAK;CACtE,MAAM,UAAoB,CAAC;CAC3B,KAAK,IAAI,WAAW,GAAG,WAAW,SAAS,QAAQ,YAAY,GAAG;EAEhE,MAAM,WAAW,WADJ,YAAY,SAAS,SACH,GAAG,KAAK,GAAG;EAC1C,IAAI,QAAQ;EACZ,IAAI,aAAa,KAAA,GAAW;GAC1B,MAAM,QAAQ,WAAW,IAAI,QAAQ;GACrC,IAAI,UAAU,KAAA,KAAa,KAAK,WAAW,MAAM,QAAQ;EAC3D,OAAO,IAAI,WAAW,SAAS,UAAU,WAAW,cAAc,KAAA,GAC5D;OAAA,KAAK,cAAc,MAAM,QAAQ;EAAA;EAEvC,IAAI,UAAU,IAAI,KAAK,SAAS;EAChC,QAAQ,KAAK,KAAK;CACpB;CAEA,MAAM,SAAoB,CAAC;CAC3B,KAAK,IAAI,WAAW,GAAG,WAAW,SAAS,QAAQ,YAAY,GAAG;EAChE,MAAM,OAAO,YAAY,SAAS,SAAS;EAC3C,MAAM,QAAQ,QAAQ,aAAa;EACnC,IAAI,UAAU,IAAI;GAChB,OAAO,KAAK,IAAI;GAChB;EACF;EACA,MAAM,WAAW,SAAS;EAC1B,IAAI,YAAY,QAAQ,KAAK,YAAY,IAAI,KAAK,SAAS,UAAU,IAAI,GAAG;GAC1E,IAAI,aAAa,MAAM,QAAQ,UAAU,IAAI;GAC7C,OAAO,KAAK,QAAQ;EACtB,OACE,OAAO,KAAK,IAAI;CAEpB;CACA,IAAI,KAAK,OACF;OAAA,IAAI,QAAQ,GAAG,QAAQ,SAAS,QAAQ,SAAS,GACpD,IAAI,KAAK,WAAW,MAAM,OAAO,KAAK,SAAS,MAAM;CAAA;CAIzD,KAAK,IAAI,WAAW,GAAG,WAAW,OAAO,QAAQ,YAAY,GAC3D,SAAS,QAAQ,OAAO,QAAQ,GAAG,OAAO,SAAS;CAErD,IAAI,KAAK,SAAS,OAAO,QAAQ,SAAS,QAAQ,UAAU,OAAO,MAAM;AAC3E;;;;;;;;;;;;;;;;;;;;;AAsBA,SAAgB,QAAW,QAAgD;CACzE,OAAO;AACT"}
|
|
1
|
+
{"version":3,"file":"reconcile.js","names":[],"sources":["../../../src/store/reconcile.ts"],"sourcesContent":["import { deleteRaw, isReservedKey, isWrappable, unwrapValue, writeRaw } from \"./nodes\";\nimport type { Reconciler } from \"./types\";\n\n/**\n * Options of {@link reconcile}.\n * @since 1.0.0\n */\nexport interface ReconcileOptions {\n /**\n * Identity of array items: the name of a field (`\"id\"`) or a function returning the identity.\n * Items without an identity (not an object, or the field is absent, or the function returns\n * `undefined`) are matched by position.\n * @default \"id\"\n */\n key?: string | ((item: unknown) => unknown);\n /**\n * Keep keys, and array items, that `next` does not contain. When false, keys missing from `next`\n * are deleted and arrays are truncated to its length; when true, unmatched old array items are\n * kept after the new ones.\n * @default false\n */\n merge?: boolean;\n}\n\n/**\n * What a reconciler carries from `reconcile()` to `setStore`. Not re-exported by any entry: only\n * the store setter reads it.\n * @internal\n */\nexport interface ReconcileSpec {\n /** The desired data, as passed to `reconcile()` (it may still be a store proxy). */\n readonly next: unknown;\n /** Identity of array items, resolved from {@link ReconcileOptions.key}. */\n readonly key: string | ((item: unknown) => unknown);\n /** Whether keys and items absent from `next` are kept, from {@link ReconcileOptions.merge}. */\n readonly merge: boolean;\n}\n\n/** Each reconciler function maps to its spec. Keys are the reconciler functions themselves. */\nconst SPECS: WeakMap<object, ReconcileSpec> = new WeakMap();\n\n/**\n * Looks up the spec of a reconciler created by {@link reconcile}. Not re-exported by any entry: the\n * store setter uses it to tell a reconciler from a draft updater.\n *\n * @param update Any function or object passed to `setStore`.\n * @returns The spec, or `undefined` when `update` is not a `reconcile()` result.\n * @internal\n */\nexport function specOf(update: object): ReconcileSpec | undefined {\n return SPECS.get(update);\n}\n\n/**\n * Describes a new value for a store. Passed to `setStore`, it changes only what differs from the\n * current state: objects are merged key by key, arrays are matched by `key` so retained items keep\n * their identity, and unchanged leaves are not written. Nothing is applied until `setStore` runs.\n * Use it to apply fresh server data to a store without re-rendering what did not change.\n *\n * @param next The desired data. Store proxies are accepted and unwrapped.\n * @param options Item identity (`key`) and whether to keep absent keys (`merge`). Undefined uses\n * the defaults (`key: \"id\"`, `merge: false`).\n * @returns A reconciler to pass to `setStore`, alone or as the last argument of a path.\n * @throws TypeError (production message `SHADOW_STORE_RECONCILE`) when the returned reconciler is\n * called directly instead of being passed to `setStore`. `setStore` throws TypeError\n * (`SHADOW_STORE_RECONCILE_SHAPE`) when `next` is not the same kind of container (object or\n * array) as the value it reconciles.\n * @example\n * import { reconcile, useStore } from \"@shadow-js/core\";\n *\n * interface Todo { id: number; title: string; done: boolean }\n * const [todos, setTodos] = useStore({ items: [] as Todo[] });\n *\n * async function refresh(): Promise<void> {\n * const response = await fetch(\"/api/todos\");\n * setTodos(\"items\", reconcile((await response.json()) as Todo[], { key: \"id\" }));\n * }\n * @see useStore\n * @since 1.0.0\n */\nexport function reconcile<T>(next: T, options?: ReconcileOptions): Reconciler<T> {\n const spec: ReconcileSpec = {\n next,\n key: options?.key ?? \"id\",\n merge: options?.merge === true,\n };\n const reconciler: Reconciler<T> = () => {\n throw new TypeError(\n __DEV__\n ? \"ShadowStore: a reconcile() result must be passed to setStore()\"\n : \"SHADOW_STORE_RECONCILE\",\n );\n };\n SPECS.set(reconciler, spec);\n return reconciler;\n}\n\ninterface Frame {\n readonly target: object;\n readonly source: object;\n}\n\n/** Field name or function giving an item's identity; `undefined` means the item has none. */\nfunction identityOf(item: unknown, key: string | ((item: unknown) => unknown)): unknown {\n if (!isWrappable(item)) return undefined;\n if (typeof key === \"function\") return key(item);\n return Object.hasOwn(item, key) ? Reflect.get(item, key) : undefined;\n}\n\n/** Same container kind: both arrays or both objects. */\nfunction sameKind(a: object, b: object): boolean {\n return Array.isArray(a) === Array.isArray(b);\n}\n\n/**\n * Applies a reconciler to the store root. The diff is iterative: pending (target, source) pairs\n * live on an explicit stack, so data nested thousands of levels deep cannot overflow the call\n * stack. Each pair is visited once, which also terminates on cyclic input. Not re-exported by any\n * entry: only the store setter calls it, inside its transaction.\n *\n * @param root The raw (unwrapped) object or array to update in place.\n * @param spec The reconciler's spec, from {@link specOf}.\n * @param label The store label for messages (` (name)`, or an empty string).\n * @throws TypeError (production message `SHADOW_STORE_RECONCILE_SHAPE`) when `spec.next` is not the\n * same kind of container as `root`.\n * @internal\n */\nexport function applyReconcile(root: object, spec: ReconcileSpec, label: string): void {\n const next = unwrapValue(spec.next);\n if (!isWrappable(next) || !sameKind(root, next)) {\n throw new TypeError(\n __DEV__\n ? `ShadowStore${label}: reconcile() needs data of the same shape as the store root (an object or an array)`\n : \"SHADOW_STORE_RECONCILE_SHAPE\",\n );\n }\n const stack: Frame[] = [];\n const seen = new Map<object, Set<object>>();\n const enqueue = (target: object, source: object): void => {\n let targets = seen.get(source);\n if (targets === undefined) {\n targets = new Set();\n seen.set(source, targets);\n }\n if (targets.has(target)) return;\n targets.add(target);\n stack.push({ target, source });\n };\n\n enqueue(root, next);\n for (let frame = stack.pop(); frame !== undefined; frame = stack.pop()) {\n if (Array.isArray(frame.source)) mergeArray(frame.target, frame.source, spec, enqueue);\n else mergeObject(frame.target, frame.source, spec, enqueue);\n }\n}\n\nfunction mergeObject(\n target: object,\n source: object,\n spec: ReconcileSpec,\n enqueue: (target: object, source: object) => void,\n): void {\n for (const key of Object.keys(source)) {\n if (isReservedKey(key)) continue;\n const value = unwrapValue(Reflect.get(source, key));\n const had = Object.hasOwn(target, key);\n const current: unknown = had ? Reflect.get(target, key) : undefined;\n if (had && Object.is(current, value)) continue;\n if (had && isWrappable(current) && isWrappable(value) && sameKind(current, value)) {\n enqueue(current, value);\n continue;\n }\n writeRaw(target, key, value);\n }\n if (spec.merge) return;\n for (const key of Object.keys(target)) {\n if (!Object.hasOwn(source, key)) deleteRaw(target, key, true);\n }\n}\n\nfunction mergeArray(\n target: object,\n source: object,\n spec: ReconcileSpec,\n enqueue: (target: object, source: object) => void,\n): void {\n const list = target as unknown[];\n const incoming = source as unknown[];\n // Copy first: matching reads the old positions, while the writes below move items.\n const original = list.slice();\n const identities = original.map((item) => identityOf(item, spec.key));\n const byIdentity = new Map<unknown, number>();\n for (let index = 0; index < original.length; index += 1) {\n const identity = identities[index];\n if (identity !== undefined && !byIdentity.has(identity)) byIdentity.set(identity, index);\n }\n\n const used: boolean[] = new Array<boolean>(original.length).fill(false);\n const matches: number[] = [];\n for (let position = 0; position < incoming.length; position += 1) {\n const item = unwrapValue(incoming[position]);\n const identity = identityOf(item, spec.key);\n let match = -1;\n if (identity !== undefined) {\n const found = byIdentity.get(identity);\n if (found !== undefined && used[found] !== true) match = found;\n } else if (position < original.length && identities[position] === undefined) {\n if (used[position] !== true) match = position;\n }\n if (match !== -1) used[match] = true;\n matches.push(match);\n }\n\n const values: unknown[] = [];\n for (let position = 0; position < incoming.length; position += 1) {\n const item = unwrapValue(incoming[position]);\n const match = matches[position] ?? -1;\n if (match === -1) {\n values.push(item);\n continue;\n }\n const previous = original[match];\n if (isWrappable(previous) && isWrappable(item) && sameKind(previous, item)) {\n if (previous !== item) enqueue(previous, item);\n values.push(previous);\n } else {\n values.push(item);\n }\n }\n if (spec.merge) {\n for (let index = 0; index < original.length; index += 1) {\n if (used[index] !== true) values.push(original[index]);\n }\n }\n\n for (let position = 0; position < values.length; position += 1) {\n writeRaw(target, String(position), values[position]);\n }\n if (list.length > values.length) writeRaw(target, \"length\", values.length);\n}\n\n/**\n * Marks a draft updater. It is the function itself (`setStore(produce((d) => { d.n += 1 }))` is\n * `setStore((d) => { d.n += 1 })`); it exists so code written for other libraries migrates as is.\n *\n * @param update The draft updater: it mutates the draft it receives.\n * @returns `update`, unchanged.\n * @example\n * import { produce, useStore } from \"@shadow-js/core\";\n *\n * const [cart, setCart] = useStore({ items: [] as string[], count: 0 });\n * setCart(\n * produce((draft) => {\n * draft.items.push(\"apple\");\n * draft.count += 1;\n * }),\n * );\n * console.log(cart.count); // 1\n * @see useStore\n * @since 1.0.0\n */\nexport function produce<T>(update: (draft: T) => void): (draft: T) => void {\n return update;\n}\n"],"mappings":";;;AAuCA,MAAM,wBAAwC,IAAI,QAAQ;;;;;;;;;AAU1D,SAAgB,OAAO,QAA2C;CAChE,OAAO,MAAM,IAAI,MAAM;AACzB;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA6BA,SAAgB,UAAa,MAAS,SAA2C;CAC/E,MAAM,OAAsB;EAC1B;EACA,KAAK,SAAS,OAAO;EACrB,OAAO,SAAS,UAAU;CAC5B;CACA,MAAM,mBAAkC;EACtC,MAAM,IAAI,UAEJ,gEAEN;CACF;CACA,MAAM,IAAI,YAAY,IAAI;CAC1B,OAAO;AACT;;AAQA,SAAS,WAAW,MAAe,KAAqD;CACtF,IAAI,CAAC,YAAY,IAAI,GAAG,OAAO,KAAA;CAC/B,IAAI,OAAO,QAAQ,YAAY,OAAO,IAAI,IAAI;CAC9C,OAAO,OAAO,OAAO,MAAM,GAAG,IAAI,QAAQ,IAAI,MAAM,GAAG,IAAI,KAAA;AAC7D;;AAGA,SAAS,SAAS,GAAW,GAAoB;CAC/C,OAAO,MAAM,QAAQ,CAAC,MAAM,MAAM,QAAQ,CAAC;AAC7C;;;;;;;;;;;;;;AAeA,SAAgB,eAAe,MAAc,MAAqB,OAAqB;CACrF,MAAM,OAAO,YAAY,KAAK,IAAI;CAClC,IAAI,CAAC,YAAY,IAAI,KAAK,CAAC,SAAS,MAAM,IAAI,GAC5C,MAAM,IAAI,UAEJ,cAAc,MAAM,qFAE1B;CAEF,MAAM,QAAiB,CAAC;CACxB,MAAM,uBAAO,IAAI,IAAyB;CAC1C,MAAM,WAAW,QAAgB,WAAyB;EACxD,IAAI,UAAU,KAAK,IAAI,MAAM;EAC7B,IAAI,YAAY,KAAA,GAAW;GACzB,0BAAU,IAAI,IAAI;GAClB,KAAK,IAAI,QAAQ,OAAO;EAC1B;EACA,IAAI,QAAQ,IAAI,MAAM,GAAG;EACzB,QAAQ,IAAI,MAAM;EAClB,MAAM,KAAK;GAAE;GAAQ;EAAO,CAAC;CAC/B;CAEA,QAAQ,MAAM,IAAI;CAClB,KAAK,IAAI,QAAQ,MAAM,IAAI,GAAG,UAAU,KAAA,GAAW,QAAQ,MAAM,IAAI,GACnE,IAAI,MAAM,QAAQ,MAAM,MAAM,GAAG,WAAW,MAAM,QAAQ,MAAM,QAAQ,MAAM,OAAO;MAChF,YAAY,MAAM,QAAQ,MAAM,QAAQ,MAAM,OAAO;AAE9D;AAEA,SAAS,YACP,QACA,QACA,MACA,SACM;CACN,KAAK,MAAM,OAAO,OAAO,KAAK,MAAM,GAAG;EACrC,IAAI,cAAc,GAAG,GAAG;EACxB,MAAM,QAAQ,YAAY,QAAQ,IAAI,QAAQ,GAAG,CAAC;EAClD,MAAM,MAAM,OAAO,OAAO,QAAQ,GAAG;EACrC,MAAM,UAAmB,MAAM,QAAQ,IAAI,QAAQ,GAAG,IAAI,KAAA;EAC1D,IAAI,OAAO,OAAO,GAAG,SAAS,KAAK,GAAG;EACtC,IAAI,OAAO,YAAY,OAAO,KAAK,YAAY,KAAK,KAAK,SAAS,SAAS,KAAK,GAAG;GACjF,QAAQ,SAAS,KAAK;GACtB;EACF;EACA,SAAS,QAAQ,KAAK,KAAK;CAC7B;CACA,IAAI,KAAK,OAAO;CAChB,KAAK,MAAM,OAAO,OAAO,KAAK,MAAM,GAClC,IAAI,CAAC,OAAO,OAAO,QAAQ,GAAG,GAAG,UAAU,QAAQ,KAAK,IAAI;AAEhE;AAEA,SAAS,WACP,QACA,QACA,MACA,SACM;CACN,MAAM,OAAO;CACb,MAAM,WAAW;CAEjB,MAAM,WAAW,KAAK,MAAM;CAC5B,MAAM,aAAa,SAAS,KAAK,SAAS,WAAW,MAAM,KAAK,GAAG,CAAC;CACpE,MAAM,6BAAa,IAAI,IAAqB;CAC5C,KAAK,IAAI,QAAQ,GAAG,QAAQ,SAAS,QAAQ,SAAS,GAAG;EACvD,MAAM,WAAW,WAAW;EAC5B,IAAI,aAAa,KAAA,KAAa,CAAC,WAAW,IAAI,QAAQ,GAAG,WAAW,IAAI,UAAU,KAAK;CACzF;CAEA,MAAM,OAAkB,IAAI,MAAe,SAAS,MAAM,CAAC,CAAC,KAAK,KAAK;CACtE,MAAM,UAAoB,CAAC;CAC3B,KAAK,IAAI,WAAW,GAAG,WAAW,SAAS,QAAQ,YAAY,GAAG;EAEhE,MAAM,WAAW,WADJ,YAAY,SAAS,SACH,GAAG,KAAK,GAAG;EAC1C,IAAI,QAAQ;EACZ,IAAI,aAAa,KAAA,GAAW;GAC1B,MAAM,QAAQ,WAAW,IAAI,QAAQ;GACrC,IAAI,UAAU,KAAA,KAAa,KAAK,WAAW,MAAM,QAAQ;EAC3D,OAAO,IAAI,WAAW,SAAS,UAAU,WAAW,cAAc,KAAA,GAC5D;OAAA,KAAK,cAAc,MAAM,QAAQ;EAAA;EAEvC,IAAI,UAAU,IAAI,KAAK,SAAS;EAChC,QAAQ,KAAK,KAAK;CACpB;CAEA,MAAM,SAAoB,CAAC;CAC3B,KAAK,IAAI,WAAW,GAAG,WAAW,SAAS,QAAQ,YAAY,GAAG;EAChE,MAAM,OAAO,YAAY,SAAS,SAAS;EAC3C,MAAM,QAAQ,QAAQ,aAAa;EACnC,IAAI,UAAU,IAAI;GAChB,OAAO,KAAK,IAAI;GAChB;EACF;EACA,MAAM,WAAW,SAAS;EAC1B,IAAI,YAAY,QAAQ,KAAK,YAAY,IAAI,KAAK,SAAS,UAAU,IAAI,GAAG;GAC1E,IAAI,aAAa,MAAM,QAAQ,UAAU,IAAI;GAC7C,OAAO,KAAK,QAAQ;EACtB,OACE,OAAO,KAAK,IAAI;CAEpB;CACA,IAAI,KAAK,OACF;OAAA,IAAI,QAAQ,GAAG,QAAQ,SAAS,QAAQ,SAAS,GACpD,IAAI,KAAK,WAAW,MAAM,OAAO,KAAK,SAAS,MAAM;CAAA;CAIzD,KAAK,IAAI,WAAW,GAAG,WAAW,OAAO,QAAQ,YAAY,GAC3D,SAAS,QAAQ,OAAO,QAAQ,GAAG,OAAO,SAAS;CAErD,IAAI,KAAK,SAAS,OAAO,QAAQ,SAAS,QAAQ,UAAU,OAAO,MAAM;AAC3E;;;;;;;;;;;;;;;;;;;;;AAsBA,SAAgB,QAAW,QAAgD;CACzE,OAAO;AACT"}
|