@opentf/web 0.4.0 → 0.5.0

package/dist/node_modules/@preact/signals-core/README.md

@@ -1,258 +0,0 @@
-# Signals
-
-Signals is a performant state management library with two primary goals:
-
-1. Make it as easy as possible to write business logic for small up to complex apps. No matter how complex your logic is, your app updates should stay fast without you needing to think about it. Signals automatically optimize state updates behind the scenes to trigger the fewest updates necessary. They are lazy by default and automatically skip signals that no one listens to.
-2. Integrate into frameworks as if they were native built-in primitives. You don't need any selectors, wrapper functions, or anything else. Signals can be accessed directly and your component will automatically re-render when the signal's value changes.
-
-Read the [announcement post](https://preactjs.com/blog/introducing-signals/) to learn more about which problems signals solves and how it came to be.
-
-- [Installation](#installation)
-- [Guide / API](#guide--api)
-  - [`signal(initialValue)`](#signalinitialvalue)
-    - [`signal.peek()`](#signalpeek)
-  - [`computed(fn)`](#computedfn)
-  - [`effect(fn)`](#effectfn)
-  - [`batch(fn)`](#batchfn)
-  - [`untracked(fn)`](#untrackedfn)
-- [License](#license)
-
-## Installation:
-
-```sh
-npm install @preact/signals-core
-```
-
-## Guide / API
-
-The signals library exposes five functions which are the building blocks to model any business logic you can think of.
-
-### `signal(initialValue)`
-
-The `signal` function creates a new signal. A signal is a container for a value that can change over time. You can read a signal's value or subscribe to value updates by accessing its `.value` property.
-
-```js
-import { signal } from "@preact/signals-core";
-
-const counter = signal(0);
-
-// Read value from signal, logs: 0
-console.log(counter.value);
-
-// Write to a signal
-counter.value = 1;
-```
-
-Writing to a signal is done by setting its `.value` property. Changing a signal's value synchronously updates every [computed](#computedfn) and [effect](#effectfn) that depends on that signal, ensuring your app state is always consistent.
-
-You can also pass options to `signal()` and `computed()` to be notified when the signal gains its first subscriber and loses its last subscriber:
-
-```js
-const counter = signal(0, {
-	name: "counter",
-	watched: function () {
-		console.log("Signal has its first subscriber");
-	},
-	unwatched: function () {
-		console.log("Signal lost its last subscriber");
-	},
-});
-```
-
-These callbacks are useful for managing resources or side effects that should only be active when the signal has subscribers. For example, you might use them to start/stop expensive background operations or subscribe/unsubscribe from external event sources.
-
-The `name` option will be used in the `@preact/signals-debug` package to provide meaningful names for the log output.
-
-#### `signal.peek()`
-
-In the rare instance that you have an effect that should write to another signal based on the previous value, but you _don't_ want the effect to be subscribed to that signal, you can read a signals's previous value via `signal.peek()`.
-
-```js
-const counter = signal(0);
-const effectCount = signal(0);
-
-effect(() => {
-	console.log(counter.value);
-
-	// Whenever this effect is triggered, increase `effectCount`.
-	// But we don't want this signal to react to `effectCount`
-	effectCount.value = effectCount.peek() + 1;
-});
-```
-
-Note that you should only use `signal.peek()` if you really need it. Reading a signal's value via `signal.value` is the preferred way in most scenarios.
-
-### `computed(fn)`
-
-Data is often derived from other pieces of existing data. The `computed` function lets you combine the values of multiple signals into a new signal that can be reacted to, or even used by additional computeds. When the signals accessed from within a computed callback change, the computed callback is re-executed and its new return value becomes the computed signal's value.
-
-```js
-import { signal, computed } from "@preact/signals-core";
-
-const name = signal("Jane");
-const surname = signal("Doe");
-
-const fullName = computed(() => name.value + " " + surname.value);
-
-// Logs: "Jane Doe"
-console.log(fullName.value);
-
-// Updates flow through computed, but only if someone
-// subscribes to it. More on that later.
-name.value = "John";
-// Logs: "John Doe"
-console.log(fullName.value);
-```
-
-Any signal that is accessed inside the `computed`'s callback function will be automatically subscribed to and tracked as a dependency of the computed signal.
-
-### `effect(fn)`
-
-The `effect` function is the last piece that makes everything reactive. When you access a signal inside its callback function, that signal and every dependency of said signal will be activated and subscribed to. In that regard it is very similar to [`computed(fn)`](#computedfn). By default all updates are lazy, so nothing will update until you access a signal inside `effect`.
-
-```js
-import { signal, computed, effect } from "@preact/signals-core";
-
-const name = signal("Jane");
-const surname = signal("Doe");
-const fullName = computed(() => name.value + " " + surname.value);
-
-// Logs: "Jane Doe"
-effect(() => console.log(fullName.value));
-
-// Updating one of its dependencies will automatically trigger
-// the effect above, and will print "John Doe" to the console.
-name.value = "John";
-```
-
-You can destroy an effect and unsubscribe from all signals it was subscribed to, by calling the returned function.
-
-```js
-import { signal, computed, effect } from "@preact/signals-core";
-
-const name = signal("Jane");
-const surname = signal("Doe");
-const fullName = computed(() => name.value + " " + surname.value);
-
-// Logs: "Jane Doe"
-const dispose = effect(() => console.log(fullName.value));
-
-// Destroy effect and subscriptions
-dispose();
-
-// Update does nothing, because no one is subscribed anymore.
-// Even the computed `fullName` signal won't change, because it knows
-// that no one listens to it.
-surname.value = "Doe 2";
-```
-
-Alternatively, you can also declare your effect as a non-arrow function and call `dispose`
-on the `this`.
-
-```js
-effect(function () {
-	this.dispose();
-});
-```
-
-The effect callback may return a cleanup function. The cleanup function gets run once, either when the effect callback is next called _or_ when the effect gets disposed, whichever happens first.
-
-```js
-import { signal, effect } from "@preact/signals-core";
-
-const count = signal(0);
-
-const dispose = effect(() => {
-	const c = count.value;
-	return () => console.log(`cleanup ${c}`);
-});
-
-// Logs: cleanup 0
-count.value = 1;
-
-// Logs: cleanup 1
-dispose();
-```
-
-### `batch(fn)`
-
-The `batch` function allows you to combine multiple signal writes into one single update that is triggered at the end when the callback completes.
-
-```js
-import { signal, computed, effect, batch } from "@preact/signals-core";
-
-const name = signal("Jane");
-const surname = signal("Doe");
-const fullName = computed(() => name.value + " " + surname.value);
-
-// Logs: "Jane Doe"
-effect(() => console.log(fullName.value));
-
-// Combines both signal writes into one update. Once the callback
-// returns the `effect` will trigger and we'll log "Foo Bar"
-batch(() => {
-	name.value = "Foo";
-	surname.value = "Bar";
-});
-```
-
-When you access a signal that you wrote to earlier inside the callback, or access a computed signal that was invalidated by another signal, we'll only update the necessary dependencies to get the current value for the signal you read from. All other invalidated signals will update at the end of the callback function.
-
-```js
-import { signal, computed, effect, batch } from "@preact/signals-core";
-
-const counter = signal(0);
-const double = computed(() => counter.value * 2);
-const triple = computed(() => counter.value * 3);
-
-effect(() => console.log(double.value, triple.value));
-
-batch(() => {
-	counter.value = 1;
-	// Logs: 2, despite being inside batch, but `triple`
-	// will only update once the callback is complete
-	console.log(double.value);
-});
-// Now we reached the end of the batch and call the effect
-```
-
-Batches can be nested and updates will be flushed when the outermost batch call completes.
-
-```js
-import { signal, computed, effect, batch } from "@preact/signals-core";
-
-const counter = signal(0);
-effect(() => console.log(counter.value));
-
-batch(() => {
-	batch(() => {
-		// Signal is invalidated, but update is not flushed because
-		// we're still inside another batch
-		counter.value = 1;
-	});
-
-	// Still not updated...
-});
-// Now the callback completed and we'll trigger the effect.
-```
-
-### `untracked(fn)`
-
-In case when you're receiving a callback that can read some signals, but you don't want to subscribe to them, you can use `untracked` to prevent any subscriptions from happening.
-
-```js
-const counter = signal(0);
-const effectCount = signal(0);
-const fn = () => effectCount.value + 1;
-
-effect(() => {
-	console.log(counter.value);
-
-	// Whenever this effect is triggered, run `fn` that gives new value
-	effectCount.value = untracked(fn);
-});
-```
-
-## License
-
-`MIT`, see the [LICENSE](../../LICENSE) file.

package/dist/node_modules/@preact/signals-core/dist/signals-core.d.ts

@@ -1,149 +0,0 @@
-declare const BRAND_SYMBOL: unique symbol;
-type Node = {
-    _source: Signal;
-    _prevSource?: Node;
-    _nextSource?: Node;
-    _target: Computed | Effect;
-    _prevTarget?: Node;
-    _nextTarget?: Node;
-    _version: number;
-    _rollbackNode?: Node;
-};
-/**
- * Combine multiple value updates into one "commit" at the end of the provided callback.
- *
- * Batches can be nested and changes are only flushed once the outermost batch callback
- * completes.
- *
- * Accessing a signal that has been modified within a batch will reflect its updated
- * value.
- *
- * @param fn The callback function.
- * @returns The value returned by the callback.
- */
-declare function batch<T>(fn: () => T): T;
-/**
- * Run a callback function that can access signal values without
- * subscribing to the signal updates.
- *
- * @param fn The callback function.
- * @returns The value returned by the callback.
- */
-declare function untracked<T>(fn: () => T): T;
-/**
- * The base class for plain and computed signals.
- */
-declare class Signal<T = any> {
-    constructor(value?: T, options?: SignalOptions<T>);
-    subscribe(fn: (value: T) => void): () => void;
-    name?: string;
-    valueOf(): T;
-    toString(): string;
-    toJSON(): T;
-    peek(): T;
-    brand: typeof BRAND_SYMBOL;
-    get value(): T;
-    set value(value: T);
-}
-export interface SignalOptions<T = any> {
-    watched?: (this: Signal<T>) => void;
-    unwatched?: (this: Signal<T>) => void;
-    name?: string;
-}
-/**
- * Create a new plain signal.
- *
- * @param value The initial value for the signal.
- * @returns A new signal.
- */
-export declare function signal<T>(value: T, options?: SignalOptions<T>): Signal<T>;
-export declare function signal<T = undefined>(): Signal<T | undefined>;
-/**
- * The base class for computed signals.
- */
-declare class Computed<T = any> extends Signal<T> {
-    _fn: () => T;
-    _sources?: Node;
-    _globalVersion: number;
-    _flags: number;
-    constructor(fn: () => T, options?: SignalOptions<T>);
-    _notify(): void;
-    get value(): T;
-}
-/**
- * An interface for read-only signals.
- */
-interface ReadonlySignal<T = any> {
-    readonly value: T;
-    peek(): T;
-    subscribe(fn: (value: T) => void): () => void;
-    valueOf(): T;
-    toString(): string;
-    toJSON(): T;
-    brand: typeof BRAND_SYMBOL;
-}
-/**
- * Create a new signal that is computed based on the values of other signals.
- *
- * The returned computed signal is read-only, and its value is automatically
- * updated when any signals accessed from within the callback function change.
- *
- * @param fn The effect callback.
- * @returns A new read-only signal.
- */
-declare function computed<T>(fn: () => T, options?: SignalOptions<T>): ReadonlySignal<T>;
-type EffectFn = ((this: {
-    dispose: () => void;
-}) => void | (() => void)) | (() => void | (() => void));
-type DisposeSymbol = typeof Symbol extends {
-    readonly dispose: infer TDispose;
-} ? TDispose : never;
-type DisposableLike = {
-    [K in DisposeSymbol & PropertyKey]: () => void;
-};
-type DisposeFn = (() => void) & DisposableLike;
-/**
- * The base class for reactive effects.
- */
-declare class Effect {
-    _fn?: EffectFn;
-    _cleanup?: () => void;
-    _sources?: Node;
-    _nextBatchedEffect?: Effect;
-    _flags: number;
-    _debugCallback?: () => void;
-    name?: string;
-    constructor(fn: EffectFn, options?: EffectOptions);
-    _callback(): void;
-    _start(): () => void;
-    _notify(): void;
-    _dispose(): void;
-    dispose(): void;
-}
-export interface EffectOptions {
-    name?: string;
-}
-/**
- * Create an effect to run arbitrary code in response to signal changes.
- *
- * An effect tracks which signals are accessed within the given callback
- * function `fn`, and re-runs the callback when those signals change.
- *
- * The callback may return a cleanup function. The cleanup function gets
- * run once, either when the callback is next called or when the effect
- * gets disposed, whichever happens first.
- *
- * @param fn The effect callback.
- * @returns A function for disposing the effect.
- */
-declare function effect(fn: EffectFn, options?: EffectOptions): DisposeFn;
-declare function action<TArgs extends unknown[], TReturn>(fn: (...args: TArgs) => TReturn): (...args: TArgs) => TReturn;
-/** Models should only contain signals, actions, and nested objects containing only signals and actions. */
-type ValidateModel<TModel> = {
-    [Key in keyof TModel]: TModel[Key] extends ReadonlySignal<unknown> ? TModel[Key] : TModel[Key] extends (...args: any[]) => any ? TModel[Key] : TModel[Key] extends object ? ValidateModel<TModel[Key]> : `Property ${Key extends string ? `'${Key}' ` : ""}is not a Signal, Action, or an object that contains only Signals and Actions.`;
-};
-export type Model<TModel> = ValidateModel<TModel> & DisposableLike;
-export type ModelFactory<TModel, TFactoryArgs extends any[] = []> = (...args: TFactoryArgs) => ValidateModel<TModel>;
-export type ModelConstructor<TModel, TFactoryArgs extends any[] = []> = new (...args: TFactoryArgs) => Model<TModel>;
-declare function createModel<TModel, TFactoryArgs extends any[] = []>(modelFactory: ModelFactory<TModel, TFactoryArgs>): ModelConstructor<TModel, TFactoryArgs>;
-export { computed, effect, batch, untracked, action, createModel, Signal, ReadonlySignal, Effect, Computed, };

package/dist/node_modules/@preact/signals-core/dist/signals-core.js

@@ -1 +0,0 @@
-var i=Symbol.for("preact-signals");function t(){if(!(h>1)){var i,t=!1;!function(){var i=c;c=void 0;while(void 0!==i){if(i.S.v===i.v)i.S.i=i.i;i=i.o}}();while(void 0!==s){var r=s;s=void 0;v++;while(void 0!==r){var n=r.u;r.u=void 0;r.f&=-3;if(!(8&r.f)&&y(r))try{r.c()}catch(r){if(!t){i=r;t=!0}}r=n}}v=0;h--;if(t)throw i}else h--}function r(i){if(h>0)return i();u=++e;h++;try{return i()}finally{t()}}var n=void 0;function o(i){var t=n;n=void 0;try{return i()}finally{n=t}}var f,s=void 0,h=0,v=0,e=0,u=0,c=void 0,d=0;function a(i){if(void 0!==n){var t=i.n;if(void 0===t||t.t!==n){t={i:0,S:i,p:n.s,n:void 0,t:n,e:void 0,x:void 0,r:t};if(void 0!==n.s)n.s.n=t;n.s=t;i.n=t;if(32&n.f)i.S(t);return t}else if(-1===t.i){t.i=0;if(void 0!==t.n){t.n.p=t.p;if(void 0!==t.p)t.p.n=t.n;t.p=n.s;t.n=void 0;n.s.n=t;n.s=t}return t}}}function l(i,t){this.v=i;this.i=0;this.n=void 0;this.t=void 0;this.l=0;this.W=null==t?void 0:t.watched;this.Z=null==t?void 0:t.unwatched;this.name=null==t?void 0:t.name}l.prototype.brand=i;l.prototype.h=function(){return!0};l.prototype.S=function(i){var t=this,r=this.t;if(r!==i&&void 0===i.e){i.x=r;this.t=i;if(void 0!==r)r.e=i;else o(function(){var i;null==(i=t.W)||i.call(t)})}};l.prototype.U=function(i){var t=this;if(void 0!==this.t){var r=i.e,n=i.x;if(void 0!==r){r.x=n;i.e=void 0}if(void 0!==n){n.e=r;i.x=void 0}if(i===this.t){this.t=n;if(void 0===n)o(function(){var i;null==(i=t.Z)||i.call(t)})}}};l.prototype.subscribe=function(i){var t=this;return m(function(){var r=t.value,o=n;n=void 0;try{i(r)}finally{n=o}},{name:"sub"})};l.prototype.valueOf=function(){return this.value};l.prototype.toString=function(){return this.value+""};l.prototype.toJSON=function(){return this.value};l.prototype.peek=function(){var i=n;n=void 0;try{return this.value}finally{n=i}};Object.defineProperty(l.prototype,"value",{get:function(){var i=a(this);if(void 0!==i)i.i=this.i;return this.v},set:function(i){if(i!==this.v){if(v>100)throw new Error("Cycle detected");!function(i){if(0!==h&&0===v)if(i.l!==u){i.l=u;c={S:i,v:i.v,i:i.i,o:c}}}(this);this.v=i;this.i++;d++;h++;try{for(var r=this.t;void 0!==r;r=r.x)r.t.N()}finally{t()}}}});function y(i){for(var t=i.s;void 0!==t;t=t.n)if(t.S.i!==t.i||!t.S.h()||t.S.i!==t.i)return!0;return!1}function w(i){for(var t=i.s;void 0!==t;t=t.n){var r=t.S.n;if(void 0!==r)t.r=r;t.S.n=t;t.i=-1;if(void 0===t.n){i.s=t;break}}}function p(i){var t=i.s,r=void 0;while(void 0!==t){var n=t.p;if(-1===t.i){t.S.U(t);if(void 0!==n)n.n=t.n;if(void 0!==t.n)t.n.p=n}else r=t;t.S.n=t.r;if(void 0!==t.r)t.r=void 0;t=n}i.s=r}function x(i,t){l.call(this,void 0);this.x=i;this.s=void 0;this.g=d-1;this.f=4;this.W=null==t?void 0:t.watched;this.Z=null==t?void 0:t.unwatched;this.name=null==t?void 0:t.name}x.prototype=new l;x.prototype.h=function(){this.f&=-3;if(1&this.f)return!1;if(32==(36&this.f))return!0;this.f&=-5;if(this.g===d)return!0;this.g=d;this.f|=1;if(this.i>0&&!y(this)){this.f&=-2;return!0}var i=n;try{w(this);n=this;var t=this.x();if(16&this.f||this.v!==t||0===this.i){this.v=t;this.f&=-17;this.i++}}catch(i){this.v=i;this.f|=16;this.i++}n=i;p(this);this.f&=-2;return!0};x.prototype.S=function(i){if(void 0===this.t){this.f|=36;for(var t=this.s;void 0!==t;t=t.n)t.S.S(t)}l.prototype.S.call(this,i)};x.prototype.U=function(i){if(void 0!==this.t){l.prototype.U.call(this,i);if(void 0===this.t){this.f&=-33;for(var t=this.s;void 0!==t;t=t.n)t.S.U(t)}}};x.prototype.N=function(){if(!(2&this.f)){this.f|=6;for(var i=this.t;void 0!==i;i=i.x)i.t.N()}};Object.defineProperty(x.prototype,"value",{get:function(){if(1&this.f)throw new Error("Cycle detected");var i=a(this);this.h();if(void 0!==i)i.i=this.i;if(16&this.f)throw this.v;return this.v}});function _(i){var r=i.m;i.m=void 0;if("function"==typeof r){h++;var o=n;n=void 0;try{r()}catch(t){i.f&=-2;i.f|=8;b(i);throw t}finally{n=o;t()}}}function b(i){for(var t=i.s;void 0!==t;t=t.n)t.S.U(t);i.x=void 0;i.s=void 0;_(i)}function g(i){if(n!==this)throw new Error("Out-of-order effect");p(this);n=i;this.f&=-2;if(8&this.f)b(this);t()}function S(i,t){this.x=i;this.m=void 0;this.s=void 0;this.u=void 0;this.f=32;this.name=null==t?void 0:t.name;if(f)f.push(this)}S.prototype.c=function(){var i=this.S();try{if(8&this.f)return;if(void 0===this.x)return;var t=this.x();if("function"==typeof t)this.m=t}finally{i()}};S.prototype.S=function(){if(1&this.f)throw new Error("Cycle detected");this.f|=1;this.f&=-9;_(this);w(this);h++;var i=n;n=this;return g.bind(this,i)};S.prototype.N=function(){if(!(2&this.f)){this.f|=2;this.u=s;s=this}};S.prototype.d=function(){this.f|=8;if(!(1&this.f))b(this)};S.prototype.dispose=function(){this.d()};function m(i,t){var r=new S(i,t);try{r.c()}catch(i){r.d();throw i}var n=r.d.bind(r);n[Symbol.dispose]=n;return n}function E(i){return function(){var t=arguments,n=this;return r(function(){return o(function(){return i.apply(n,[].slice.call(t))})})}}function j(){var i=f;f=[];return function(){var t=f;if(f&&i)i=i.concat(f);f=i;return t}}var C=function(i){for(var t in i){var r=i[t];if("function"==typeof r)i[t]=E(r);else if("object"==typeof r&&null!==r&&!("brand"in r))C(r)}};exports.Computed=x;exports.Effect=S;exports.Signal=l;exports.action=E;exports.batch=r;exports.computed=function(i,t){return new x(i,t)};exports.createModel=function(i){return function(){var t,r,n=j();try{r=i.apply(void 0,[].slice.call(arguments))}catch(i){f=void 0;throw i}finally{t=n()}C(r);r[Symbol.dispose]=E(function(){if(t)for(var i=0;i<t.length;i++)t[i].dispose();t=void 0});return r}};exports.effect=m;exports.signal=function(i,t){return new l(i,t)};exports.untracked=o;//# sourceMappingURL=signals-core.js.map

package/dist/node_modules/@preact/signals-core/dist/signals-core.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"signals-core.js","sources":["../src/index.ts"],"sourcesContent":["// An named symbol/brand for detecting Signal instances even when they weren't\n// created using the same signals library version.\nconst BRAND_SYMBOL = Symbol.for(\"preact-signals\");\n\n// Flags for Computed and Effect.\nconst RUNNING = 1 << 0;\nconst NOTIFIED = 1 << 1;\nconst OUTDATED = 1 << 2;\nconst DISPOSED = 1 << 3;\nconst HAS_ERROR = 1 << 4;\nconst TRACKING = 1 << 5;\n\n// A linked list node used to track dependencies (sources) and dependents (targets).\n// Also used to remember the source's last version number that the target saw.\ntype Node = {\n\t// A source whose value the target depends on.\n\t_source: Signal;\n\t_prevSource?: Node;\n\t_nextSource?: Node;\n\n\t// A target that depends on the source and should be notified when the source changes.\n\t_target: Computed | Effect;\n\t_prevTarget?: Node;\n\t_nextTarget?: Node;\n\n\t// The version number of the source that target has last seen. We use version numbers\n\t// instead of storing the source value, because source values can take arbitrary amount\n\t// of memory, and computeds could hang on to them forever because they're lazily evaluated.\n\t// Use the special value -1 to mark potentially unused but recyclable nodes.\n\t_version: number;\n\n\t// Used to remember & roll back the source's previous `._node` value when entering &\n\t// exiting a new evaluation context.\n\t_rollbackNode?: Node;\n};\n\nfunction startBatch() {\n\tbatchDepth++;\n}\n\nfunction endBatch() {\n\tif (batchDepth > 1) {\n\t\tbatchDepth--;\n\t\treturn;\n\t}\n\n\tlet error: unknown;\n\tlet hasError = false;\n\treconcileBatchSnapshots();\n\n\twhile (batchedEffect !== undefined) {\n\t\tlet effect: Effect | undefined = batchedEffect;\n\t\tbatchedEffect = undefined;\n\n\t\tbatchIteration++;\n\n\t\twhile (effect !== undefined) {\n\t\t\tconst next: Effect | undefined = effect._nextBatchedEffect;\n\t\t\teffect._nextBatchedEffect = undefined;\n\t\t\teffect._flags &= ~NOTIFIED;\n\n\t\t\tif (!(effect._flags & DISPOSED) && needsToRecompute(effect)) {\n\t\t\t\ttry {\n\t\t\t\t\teffect._callback();\n\t\t\t\t} catch (err) {\n\t\t\t\t\tif (!hasError) {\n\t\t\t\t\t\terror = err;\n\t\t\t\t\t\thasError = true;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\teffect = next;\n\t\t}\n\t}\n\tbatchIteration = 0;\n\tbatchDepth--;\n\n\tif (hasError) {\n\t\tthrow error;\n\t}\n}\n\n/**\n * Combine multiple value updates into one \"commit\" at the end of the provided callback.\n *\n * Batches can be nested and changes are only flushed once the outermost batch callback\n * completes.\n *\n * Accessing a signal that has been modified within a batch will reflect its updated\n * value.\n *\n * @param fn The callback function.\n * @returns The value returned by the callback.\n */\nfunction batch<T>(fn: () => T): T {\n\tif (batchDepth > 0) {\n\t\treturn fn();\n\t}\n\tcurrentBatchSnapshotVersion = ++batchSnapshotVersion;\n\t/*@__INLINE__**/ startBatch();\n\ttry {\n\t\treturn fn();\n\t} finally {\n\t\tendBatch();\n\t}\n}\n\n// Currently evaluated computed or effect.\nlet evalContext: Computed | Effect | undefined = undefined;\n\n/**\n * Run a callback function that can access signal values without\n * subscribing to the signal updates.\n *\n * @param fn The callback function.\n * @returns The value returned by the callback.\n */\nfunction untracked<T>(fn: () => T): T {\n\tconst prevContext = evalContext;\n\tevalContext = undefined;\n\ttry {\n\t\treturn fn();\n\t} finally {\n\t\tevalContext = prevContext;\n\t}\n}\n\n// Effects collected into a batch.\nlet batchedEffect: Effect | undefined = undefined;\nlet batchDepth = 0;\nlet batchIteration = 0;\n\ntype BatchSnapshot = {\n\t_source: Signal;\n\t_value: unknown;\n\t_version: number;\n\t_next?: BatchSnapshot;\n};\n\nlet batchSnapshotVersion = 0;\nlet currentBatchSnapshotVersion = 0;\nlet batchSnapshots: BatchSnapshot | undefined = undefined;\n\n// A global version number for signals, used for fast-pathing repeated\n// computed.peek()/computed.value calls when nothing has changed globally.\nlet globalVersion = 0;\n\nfunction recordBatchSnapshot(source: Signal) {\n\t// Only capture writes during the user-visible batch callback, not during effect flush.\n\tif (batchDepth === 0 || batchIteration !== 0) {\n\t\treturn;\n\t}\n\n\tif (source._batchSnapshotVersion !== currentBatchSnapshotVersion) {\n\t\tsource._batchSnapshotVersion = currentBatchSnapshotVersion;\n\t\tbatchSnapshots = {\n\t\t\t_source: source,\n\t\t\t_value: source._value,\n\t\t\t_version: source._version,\n\t\t\t_next: batchSnapshots,\n\t\t};\n\t}\n}\n\nfunction reconcileBatchSnapshots() {\n\tlet snapshots = batchSnapshots;\n\tbatchSnapshots = undefined;\n\n\twhile (snapshots !== undefined) {\n\t\tif (snapshots._source._value === snapshots._value) {\n\t\t\tsnapshots._source._version = snapshots._version;\n\t\t}\n\t\tsnapshots = snapshots._next;\n\t}\n}\n\nfunction addDependency(signal: Signal): Node | undefined {\n\tif (evalContext === undefined) {\n\t\treturn undefined;\n\t}\n\n\tlet node = signal._node;\n\tif (node === undefined || node._target !== evalContext) {\n\t\t/**\n\t\t * `signal` is a new dependency. Create a new dependency node, and set it\n\t\t * as the tail of the current context's dependency list. e.g:\n\t\t *\n\t\t * { A <-> B       }\n\t\t *         ↑     ↑\n\t\t *        tail  node (new)\n\t\t *               ↓\n\t\t * { A <-> B <-> C }\n\t\t *               ↑\n\t\t *              tail (evalContext._sources)\n\t\t */\n\t\tnode = {\n\t\t\t_version: 0,\n\t\t\t_source: signal,\n\t\t\t_prevSource: evalContext._sources,\n\t\t\t_nextSource: undefined,\n\t\t\t_target: evalContext,\n\t\t\t_prevTarget: undefined,\n\t\t\t_nextTarget: undefined,\n\t\t\t_rollbackNode: node,\n\t\t};\n\n\t\tif (evalContext._sources !== undefined) {\n\t\t\tevalContext._sources._nextSource = node;\n\t\t}\n\t\tevalContext._sources = node;\n\t\tsignal._node = node;\n\n\t\t// Subscribe to change notifications from this dependency if we're in an effect\n\t\t// OR evaluating a computed signal that in turn has subscribers.\n\t\tif (evalContext._flags & TRACKING) {\n\t\t\tsignal._subscribe(node);\n\t\t}\n\t\treturn node;\n\t} else if (node._version === -1) {\n\t\t// `signal` is an existing dependency from a previous evaluation. Reuse it.\n\t\tnode._version = 0;\n\n\t\t/**\n\t\t * If `node` is not already the current tail of the dependency list (i.e.\n\t\t * there is a next node in the list), then make the `node` the new tail. e.g:\n\t\t *\n\t\t * { A <-> B <-> C <-> D }\n\t\t *         ↑           ↑\n\t\t *        node   ┌─── tail (evalContext._sources)\n\t\t *         └─────│─────┐\n\t\t *               ↓     ↓\n\t\t * { A <-> C <-> D <-> B }\n\t\t *                     ↑\n\t\t *                    tail (evalContext._sources)\n\t\t */\n\t\tif (node._nextSource !== undefined) {\n\t\t\tnode._nextSource._prevSource = node._prevSource;\n\n\t\t\tif (node._prevSource !== undefined) {\n\t\t\t\tnode._prevSource._nextSource = node._nextSource;\n\t\t\t}\n\n\t\t\tnode._prevSource = evalContext._sources;\n\t\t\tnode._nextSource = undefined;\n\n\t\t\tevalContext._sources!._nextSource = node;\n\t\t\tevalContext._sources = node;\n\t\t}\n\n\t\t// We can assume that the currently evaluated effect / computed signal is already\n\t\t// subscribed to change notifications from `signal` if needed.\n\t\treturn node;\n\t}\n\treturn undefined;\n}\n\n//#region Signal\n\n/**\n * The base class for plain and computed signals.\n */\n//\n// A function with the same name is defined later, so we need to ignore TypeScript's\n// warning about a redeclared variable.\n//\n// The class is declared here, but later implemented with ES5-style prototypes.\n// This enables better control of the transpiled output size.\n// @ts-ignore: \"Cannot redeclare exported variable 'Signal'.\"\ndeclare class Signal<T = any> {\n\t/** @internal */\n\t_value: unknown;\n\n\t/**\n\t * @internal\n\t * Version numbers should always be >= 0, because the special value -1 is used\n\t * by Nodes to signify potentially unused but recyclable nodes.\n\t */\n\t_version: number;\n\n\t/** @internal */\n\t_node?: Node;\n\n\t/** @internal */\n\t_targets?: Node;\n\n\t/** @internal */\n\t_batchSnapshotVersion: number;\n\n\tconstructor(value?: T, options?: SignalOptions<T>);\n\n\t/** @internal */\n\t_refresh(): boolean;\n\n\t/** @internal */\n\t_subscribe(node: Node): void;\n\n\t/** @internal */\n\t_unsubscribe(node: Node): void;\n\n\t/** @internal */\n\t_watched?(this: Signal<T>): void;\n\n\t/** @internal */\n\t_unwatched?(this: Signal<T>): void;\n\n\tsubscribe(fn: (value: T) => void): () => void;\n\n\tname?: string;\n\n\tvalueOf(): T;\n\n\ttoString(): string;\n\n\ttoJSON(): T;\n\n\tpeek(): T;\n\n\tbrand: typeof BRAND_SYMBOL;\n\n\tget value(): T;\n\tset value(value: T);\n}\n\nexport interface SignalOptions<T = any> {\n\twatched?: (this: Signal<T>) => void;\n\tunwatched?: (this: Signal<T>) => void;\n\tname?: string;\n}\n\n/** @internal */\n// A class with the same name has already been declared, so we need to ignore\n// TypeScript's warning about a redeclared variable.\n//\n// The previously declared class is implemented here with ES5-style prototypes.\n// This enables better control of the transpiled output size.\n// @ts-ignore: \"Cannot redeclare exported variable 'Signal'.\"\nfunction Signal(this: Signal, value?: unknown, options?: SignalOptions) {\n\tthis._value = value;\n\tthis._version = 0;\n\tthis._node = undefined;\n\tthis._targets = undefined;\n\tthis._batchSnapshotVersion = 0;\n\tthis._watched = options?.watched;\n\tthis._unwatched = options?.unwatched;\n\tthis.name = options?.name;\n}\n\nSignal.prototype.brand = BRAND_SYMBOL;\n\nSignal.prototype._refresh = function () {\n\treturn true;\n};\n\nSignal.prototype._subscribe = function (node) {\n\tconst targets = this._targets;\n\tif (targets !== node && node._prevTarget === undefined) {\n\t\tnode._nextTarget = targets;\n\t\tthis._targets = node;\n\n\t\tif (targets !== undefined) {\n\t\t\ttargets._prevTarget = node;\n\t\t} else {\n\t\t\tuntracked(() => {\n\t\t\t\tthis._watched?.call(this);\n\t\t\t});\n\t\t}\n\t}\n};\n\nSignal.prototype._unsubscribe = function (node) {\n\t// Only run the unsubscribe step if the signal has any subscribers to begin with.\n\tif (this._targets !== undefined) {\n\t\tconst prev = node._prevTarget;\n\t\tconst next = node._nextTarget;\n\t\tif (prev !== undefined) {\n\t\t\tprev._nextTarget = next;\n\t\t\tnode._prevTarget = undefined;\n\t\t}\n\n\t\tif (next !== undefined) {\n\t\t\tnext._prevTarget = prev;\n\t\t\tnode._nextTarget = undefined;\n\t\t}\n\n\t\tif (node === this._targets) {\n\t\t\tthis._targets = next;\n\t\t\tif (next === undefined) {\n\t\t\t\tuntracked(() => {\n\t\t\t\t\tthis._unwatched?.call(this);\n\t\t\t\t});\n\t\t\t}\n\t\t}\n\t}\n};\n\nSignal.prototype.subscribe = function (fn) {\n\treturn effect(\n\t\t() => {\n\t\t\tconst value = this.value;\n\t\t\tconst prevContext = evalContext;\n\t\t\tevalContext = undefined;\n\t\t\ttry {\n\t\t\t\tfn(value);\n\t\t\t} finally {\n\t\t\t\tevalContext = prevContext;\n\t\t\t}\n\t\t},\n\t\t{ name: \"sub\" }\n\t);\n};\n\nSignal.prototype.valueOf = function () {\n\treturn this.value;\n};\n\nSignal.prototype.toString = function () {\n\treturn this.value + \"\";\n};\n\nSignal.prototype.toJSON = function () {\n\treturn this.value;\n};\n\nSignal.prototype.peek = function () {\n\tconst prevContext = evalContext;\n\tevalContext = undefined;\n\ttry {\n\t\treturn this.value;\n\t} finally {\n\t\tevalContext = prevContext;\n\t}\n};\n\nObject.defineProperty(Signal.prototype, \"value\", {\n\tget(this: Signal) {\n\t\tconst node = addDependency(this);\n\t\tif (node !== undefined) {\n\t\t\tnode._version = this._version;\n\t\t}\n\t\treturn this._value;\n\t},\n\tset(this: Signal, value) {\n\t\tif (value !== this._value) {\n\t\t\tif (batchIteration > 100) {\n\t\t\t\tthrow new Error(\"Cycle detected\");\n\t\t\t}\n\n\t\t\trecordBatchSnapshot(this);\n\t\t\tthis._value = value;\n\t\t\tthis._version++;\n\t\t\tglobalVersion++;\n\n\t\t\t/**@__INLINE__*/ startBatch();\n\t\t\ttry {\n\t\t\t\tfor (\n\t\t\t\t\tlet node = this._targets;\n\t\t\t\t\tnode !== undefined;\n\t\t\t\t\tnode = node._nextTarget\n\t\t\t\t) {\n\t\t\t\t\tnode._target._notify();\n\t\t\t\t}\n\t\t\t} finally {\n\t\t\t\tendBatch();\n\t\t\t}\n\t\t}\n\t},\n});\n\n/**\n * Create a new plain signal.\n *\n * @param value The initial value for the signal.\n * @returns A new signal.\n */\nexport function signal<T>(value: T, options?: SignalOptions<T>): Signal<T>;\nexport function signal<T = undefined>(): Signal<T | undefined>;\nexport function signal<T>(value?: T, options?: SignalOptions<T>): Signal<T> {\n\treturn new Signal(value, options);\n}\n\n//#endregion Signal\n\n//#region Computed\n\nfunction needsToRecompute(target: Computed | Effect): boolean {\n\t// Check the dependencies for changed values. The dependency list is already\n\t// in order of use. Therefore if multiple dependencies have changed values, only\n\t// the first used dependency is re-evaluated at this point.\n\tfor (\n\t\tlet node = target._sources;\n\t\tnode !== undefined;\n\t\tnode = node._nextSource\n\t) {\n\t\tif (\n\t\t\t// If the dependency has definitely been updated since its version number\n\t\t\t// was observed, then we need to recompute. This first check is not strictly\n\t\t\t// necessary for correctness, but allows us to skip the refresh call if the\n\t\t\t// dependency has already been updated.\n\t\t\tnode._source._version !== node._version ||\n\t\t\t// Refresh the dependency. If there's something blocking the refresh (e.g. a\n\t\t\t// dependency cycle), then we need to recompute.\n\t\t\t!node._source._refresh() ||\n\t\t\t// If the dependency got a new version after the refresh, then we need to recompute.\n\t\t\tnode._source._version !== node._version\n\t\t) {\n\t\t\treturn true;\n\t\t}\n\t}\n\t// If none of the dependencies have changed values since last recompute then\n\t// there's no need to recompute.\n\treturn false;\n}\n\nfunction prepareSources(target: Computed | Effect) {\n\t/**\n\t * 1. Mark all current sources as re-usable nodes (version: -1)\n\t * 2. Set a rollback node if the current node is being used in a different context\n\t * 3. Point 'target._sources' to the tail of the doubly-linked list, e.g:\n\t *\n\t *    { undefined <- A <-> B <-> C -> undefined }\n\t *                   ↑           ↑\n\t *                   │           └──────┐\n\t * target._sources = A; (node is head)  │\n\t *                   ↓                  │\n\t * target._sources = C; (node is tail) ─┘\n\t */\n\tfor (\n\t\tlet node = target._sources;\n\t\tnode !== undefined;\n\t\tnode = node._nextSource\n\t) {\n\t\tconst rollbackNode = node._source._node;\n\t\tif (rollbackNode !== undefined) {\n\t\t\tnode._rollbackNode = rollbackNode;\n\t\t}\n\t\tnode._source._node = node;\n\t\tnode._version = -1;\n\n\t\tif (node._nextSource === undefined) {\n\t\t\ttarget._sources = node;\n\t\t\tbreak;\n\t\t}\n\t}\n}\n\nfunction cleanupSources(target: Computed | Effect) {\n\tlet node = target._sources;\n\tlet head: Node | undefined = undefined;\n\n\t/**\n\t * At this point 'target._sources' points to the tail of the doubly-linked list.\n\t * It contains all existing sources + new sources in order of use.\n\t * Iterate backwards until we find the head node while dropping old dependencies.\n\t */\n\twhile (node !== undefined) {\n\t\tconst prev = node._prevSource;\n\n\t\t/**\n\t\t * The node was not re-used, unsubscribe from its change notifications and remove itself\n\t\t * from the doubly-linked list. e.g:\n\t\t *\n\t\t * { A <-> B <-> C }\n\t\t *         ↓\n\t\t *    { A <-> C }\n\t\t */\n\t\tif (node._version === -1) {\n\t\t\tnode._source._unsubscribe(node);\n\n\t\t\tif (prev !== undefined) {\n\t\t\t\tprev._nextSource = node._nextSource;\n\t\t\t}\n\t\t\tif (node._nextSource !== undefined) {\n\t\t\t\tnode._nextSource._prevSource = prev;\n\t\t\t}\n\t\t} else {\n\t\t\t/**\n\t\t\t * The new head is the last node seen which wasn't removed/unsubscribed\n\t\t\t * from the doubly-linked list. e.g:\n\t\t\t *\n\t\t\t * { A <-> B <-> C }\n\t\t\t *   ↑     ↑     ↑\n\t\t\t *   │     │     └ head = node\n\t\t\t *   │     └ head = node\n\t\t\t *   └ head = node\n\t\t\t */\n\t\t\thead = node;\n\t\t}\n\n\t\tnode._source._node = node._rollbackNode;\n\t\tif (node._rollbackNode !== undefined) {\n\t\t\tnode._rollbackNode = undefined;\n\t\t}\n\n\t\tnode = prev;\n\t}\n\n\ttarget._sources = head;\n}\n\n/**\n * The base class for computed signals.\n */\ndeclare class Computed<T = any> extends Signal<T> {\n\t_fn: () => T;\n\t_sources?: Node;\n\t_globalVersion: number;\n\t_flags: number;\n\n\tconstructor(fn: () => T, options?: SignalOptions<T>);\n\n\t_notify(): void;\n\tget value(): T;\n}\n\n/** @internal */\nfunction Computed(this: Computed, fn: () => unknown, options?: SignalOptions) {\n\tSignal.call(this, undefined);\n\n\tthis._fn = fn;\n\tthis._sources = undefined;\n\tthis._globalVersion = globalVersion - 1;\n\tthis._flags = OUTDATED;\n\tthis._watched = options?.watched;\n\tthis._unwatched = options?.unwatched;\n\tthis.name = options?.name;\n}\n\nComputed.prototype = new Signal() as Computed;\n\nComputed.prototype._refresh = function () {\n\tthis._flags &= ~NOTIFIED;\n\n\tif (this._flags & RUNNING) {\n\t\treturn false;\n\t}\n\n\t// If this computed signal has subscribed to updates from its dependencies\n\t// (TRACKING flag set) and none of them have notified about changes (OUTDATED\n\t// flag not set), then the computed value can't have changed.\n\tif ((this._flags & (OUTDATED | TRACKING)) === TRACKING) {\n\t\treturn true;\n\t}\n\tthis._flags &= ~OUTDATED;\n\n\tif (this._globalVersion === globalVersion) {\n\t\treturn true;\n\t}\n\tthis._globalVersion = globalVersion;\n\n\t// Mark this computed signal running before checking the dependencies for value\n\t// changes, so that the RUNNING flag can be used to notice cyclical dependencies.\n\tthis._flags |= RUNNING;\n\tif (this._version > 0 && !needsToRecompute(this)) {\n\t\tthis._flags &= ~RUNNING;\n\t\treturn true;\n\t}\n\n\tconst prevContext = evalContext;\n\ttry {\n\t\tprepareSources(this);\n\t\tevalContext = this;\n\t\tconst value = this._fn();\n\t\tif (\n\t\t\tthis._flags & HAS_ERROR ||\n\t\t\tthis._value !== value ||\n\t\t\tthis._version === 0\n\t\t) {\n\t\t\tthis._value = value;\n\t\t\tthis._flags &= ~HAS_ERROR;\n\t\t\tthis._version++;\n\t\t}\n\t} catch (err) {\n\t\tthis._value = err;\n\t\tthis._flags |= HAS_ERROR;\n\t\tthis._version++;\n\t}\n\tevalContext = prevContext;\n\tcleanupSources(this);\n\tthis._flags &= ~RUNNING;\n\treturn true;\n};\n\nComputed.prototype._subscribe = function (node) {\n\tif (this._targets === undefined) {\n\t\tthis._flags |= OUTDATED | TRACKING;\n\n\t\t// A computed signal subscribes lazily to its dependencies when it\n\t\t// gets its first subscriber.\n\t\tfor (\n\t\t\tlet node = this._sources;\n\t\t\tnode !== undefined;\n\t\t\tnode = node._nextSource\n\t\t) {\n\t\t\tnode._source._subscribe(node);\n\t\t}\n\t}\n\tSignal.prototype._subscribe.call(this, node);\n};\n\nComputed.prototype._unsubscribe = function (node) {\n\t// Only run the unsubscribe step if the computed signal has any subscribers.\n\tif (this._targets !== undefined) {\n\t\tSignal.prototype._unsubscribe.call(this, node);\n\n\t\t// Computed signal unsubscribes from its dependencies when it loses its last subscriber.\n\t\t// This makes it possible for unreferences subgraphs of computed signals to get garbage collected.\n\t\tif (this._targets === undefined) {\n\t\t\tthis._flags &= ~TRACKING;\n\n\t\t\tfor (\n\t\t\t\tlet node = this._sources;\n\t\t\t\tnode !== undefined;\n\t\t\t\tnode = node._nextSource\n\t\t\t) {\n\t\t\t\tnode._source._unsubscribe(node);\n\t\t\t}\n\t\t}\n\t}\n};\n\nComputed.prototype._notify = function () {\n\tif (!(this._flags & NOTIFIED)) {\n\t\tthis._flags |= OUTDATED | NOTIFIED;\n\n\t\tfor (\n\t\t\tlet node = this._targets;\n\t\t\tnode !== undefined;\n\t\t\tnode = node._nextTarget\n\t\t) {\n\t\t\tnode._target._notify();\n\t\t}\n\t}\n};\n\nObject.defineProperty(Computed.prototype, \"value\", {\n\tget(this: Computed) {\n\t\tif (this._flags & RUNNING) {\n\t\t\tthrow new Error(\"Cycle detected\");\n\t\t}\n\t\tconst node = addDependency(this);\n\t\tthis._refresh();\n\t\tif (node !== undefined) {\n\t\t\tnode._version = this._version;\n\t\t}\n\t\tif (this._flags & HAS_ERROR) {\n\t\t\tthrow this._value;\n\t\t}\n\t\treturn this._value;\n\t},\n});\n\n/**\n * An interface for read-only signals.\n */\ninterface ReadonlySignal<T = any> {\n\treadonly value: T;\n\tpeek(): T;\n\n\tsubscribe(fn: (value: T) => void): () => void;\n\tvalueOf(): T;\n\ttoString(): string;\n\ttoJSON(): T;\n\tbrand: typeof BRAND_SYMBOL;\n}\n\n/**\n * Create a new signal that is computed based on the values of other signals.\n *\n * The returned computed signal is read-only, and its value is automatically\n * updated when any signals accessed from within the callback function change.\n *\n * @param fn The effect callback.\n * @returns A new read-only signal.\n */\nfunction computed<T>(\n\tfn: () => T,\n\toptions?: SignalOptions<T>\n): ReadonlySignal<T> {\n\treturn new Computed(fn, options);\n}\n\n//#endregion Computed\n\n//#region Effect\n\nfunction cleanupEffect(effect: Effect) {\n\tconst cleanup = effect._cleanup;\n\teffect._cleanup = undefined;\n\n\tif (typeof cleanup === \"function\") {\n\t\t/*@__INLINE__**/ startBatch();\n\n\t\t// Run cleanup functions always outside of any context.\n\t\tconst prevContext = evalContext;\n\t\tevalContext = undefined;\n\t\ttry {\n\t\t\tcleanup();\n\t\t} catch (err) {\n\t\t\teffect._flags &= ~RUNNING;\n\t\t\teffect._flags |= DISPOSED;\n\t\t\tdisposeEffect(effect);\n\t\t\tthrow err;\n\t\t} finally {\n\t\t\tevalContext = prevContext;\n\t\t\tendBatch();\n\t\t}\n\t}\n}\n\nfunction disposeEffect(effect: Effect) {\n\tfor (\n\t\tlet node = effect._sources;\n\t\tnode !== undefined;\n\t\tnode = node._nextSource\n\t) {\n\t\tnode._source._unsubscribe(node);\n\t}\n\teffect._fn = undefined;\n\teffect._sources = undefined;\n\n\tcleanupEffect(effect);\n}\n\nfunction endEffect(this: Effect, prevContext?: Computed | Effect) {\n\tif (evalContext !== this) {\n\t\tthrow new Error(\"Out-of-order effect\");\n\t}\n\tcleanupSources(this);\n\tevalContext = prevContext;\n\n\tthis._flags &= ~RUNNING;\n\tif (this._flags & DISPOSED) {\n\t\tdisposeEffect(this);\n\t}\n\tendBatch();\n}\n\ntype EffectFn =\n\t| ((this: { dispose: () => void }) => void | (() => void))\n\t| (() => void | (() => void));\n\n// Avoid hard-requiring the ESNext.Disposable lib in consuming tsconfigs.\n// When `Symbol.dispose` is available, this becomes a symbol-keyed disposer type.\ntype DisposeSymbol = typeof Symbol extends { readonly dispose: infer TDispose }\n\t? TDispose\n\t: never;\ntype DisposableLike = {\n\t[K in DisposeSymbol & PropertyKey]: () => void;\n};\ntype DisposeFn = (() => void) & DisposableLike;\n\n/**\n * The base class for reactive effects.\n */\ndeclare class Effect {\n\t_fn?: EffectFn;\n\t_cleanup?: () => void;\n\t_sources?: Node;\n\t_nextBatchedEffect?: Effect;\n\t_flags: number;\n\t_debugCallback?: () => void;\n\tname?: string;\n\n\tconstructor(fn: EffectFn, options?: EffectOptions);\n\n\t_callback(): void;\n\t_start(): () => void;\n\t_notify(): void;\n\t_dispose(): void;\n\tdispose(): void;\n}\n\nexport interface EffectOptions {\n\tname?: string;\n}\n\nlet capturedEffects: Effect[] | undefined;\n\n/** @internal */\nfunction Effect(this: Effect, fn: EffectFn, options?: EffectOptions) {\n\tthis._fn = fn;\n\tthis._cleanup = undefined;\n\tthis._sources = undefined;\n\tthis._nextBatchedEffect = undefined;\n\tthis._flags = TRACKING;\n\tthis.name = options?.name;\n\n\tif (capturedEffects) {\n\t\tcapturedEffects.push(this);\n\t}\n}\n\nEffect.prototype._callback = function () {\n\tconst finish = this._start();\n\ttry {\n\t\tif (this._flags & DISPOSED) return;\n\t\tif (this._fn === undefined) return;\n\n\t\tconst cleanup = this._fn();\n\t\tif (typeof cleanup === \"function\") {\n\t\t\tthis._cleanup = cleanup;\n\t\t}\n\t} finally {\n\t\tfinish();\n\t}\n};\n\nEffect.prototype._start = function () {\n\tif (this._flags & RUNNING) {\n\t\tthrow new Error(\"Cycle detected\");\n\t}\n\tthis._flags |= RUNNING;\n\tthis._flags &= ~DISPOSED;\n\tcleanupEffect(this);\n\tprepareSources(this);\n\n\t/*@__INLINE__**/ startBatch();\n\tconst prevContext = evalContext;\n\tevalContext = this;\n\treturn endEffect.bind(this, prevContext);\n};\n\nEffect.prototype._notify = function () {\n\tif (!(this._flags & NOTIFIED)) {\n\t\tthis._flags |= NOTIFIED;\n\t\tthis._nextBatchedEffect = batchedEffect;\n\t\tbatchedEffect = this;\n\t}\n};\n\nEffect.prototype._dispose = function () {\n\tthis._flags |= DISPOSED;\n\n\tif (!(this._flags & RUNNING)) {\n\t\tdisposeEffect(this);\n\t}\n};\n\nEffect.prototype.dispose = function () {\n\tthis._dispose();\n};\n/**\n * Create an effect to run arbitrary code in response to signal changes.\n *\n * An effect tracks which signals are accessed within the given callback\n * function `fn`, and re-runs the callback when those signals change.\n *\n * The callback may return a cleanup function. The cleanup function gets\n * run once, either when the callback is next called or when the effect\n * gets disposed, whichever happens first.\n *\n * @param fn The effect callback.\n * @returns A function for disposing the effect.\n */\nfunction effect(fn: EffectFn, options?: EffectOptions): DisposeFn {\n\tconst effect = new Effect(fn, options);\n\ttry {\n\t\teffect._callback();\n\t} catch (err) {\n\t\teffect._dispose();\n\t\tthrow err;\n\t}\n\t// Return a bound function instead of a wrapper like `() => effect._dispose()`,\n\t// because bound functions seem to be just as fast and take up a lot less memory.\n\tconst dispose = effect._dispose.bind(effect);\n\t(dispose as any)[Symbol.dispose] = dispose;\n\treturn dispose as DisposeFn;\n}\n\n//#endregion Effect\n\n//#region Action\n\nfunction action<TArgs extends unknown[], TReturn>(\n\tfn: (...args: TArgs) => TReturn\n): (...args: TArgs) => TReturn {\n\treturn function actionWrapper(this: unknown, ...args: TArgs) {\n\t\treturn batch(() => untracked(() => fn.apply(this, args)));\n\t};\n}\n\n//#endregion Action\n\n//#region createModel\n\n/** Models should only contain signals, actions, and nested objects containing only signals and actions. */\ntype ValidateModel<TModel> = {\n\t[Key in keyof TModel]: TModel[Key] extends ReadonlySignal<unknown>\n\t\t? TModel[Key]\n\t\t: TModel[Key] extends (...args: any[]) => any\n\t\t\t? TModel[Key]\n\t\t\t: TModel[Key] extends object\n\t\t\t\t? ValidateModel<TModel[Key]>\n\t\t\t\t: `Property ${Key extends string ? `'${Key}' ` : \"\"}is not a Signal, Action, or an object that contains only Signals and Actions.`;\n};\n\nexport type Model<TModel> = ValidateModel<TModel> & DisposableLike;\n\nexport type ModelFactory<TModel, TFactoryArgs extends any[] = []> = (\n\t...args: TFactoryArgs\n) => ValidateModel<TModel>;\nexport type ModelConstructor<TModel, TFactoryArgs extends any[] = []> = new (\n\t...args: TFactoryArgs\n) => Model<TModel>;\n\n/**\n * The public types for ModelConstructor require using `new` to help\n * disambiguate the function passed into `createModel` and the returned\n * constructor function. It is easier to say that `createModel` accepts\n * a factory and returns a class, then to say it accepts a factory and\n * returns a factory. In other words, this example:\n *\n * ```ts\n * const PersonModel = createModel((name: string) => ({ ... }));\n * const person = new PersonModel(\"John\");\n * ```\n *\n * is easier to understand than this example:\n *\n * ```ts\n * const createPerson = createModel((name: string) => ({ ... }));\n * const person = createPerson(\"John\");\n * ```\n *\n * However, internally we implement `createModel` to return a function\n * that can be called without `new` for simplicity. To bridge the gap\n * between the public types and the internal implementation, we define\n * this internal interface that extends the public interface but also\n * allows calling without `new`.\n *\n * This pattern is used by the Preact & React adapters to make instantiating\n * a model or a function that returns a model easier.\n *\n * @internal\n */\ninterface InternalModelConstructor<\n\tTModel,\n\tTFactoryArgs extends any[],\n> extends ModelConstructor<TModel, TFactoryArgs> {\n\t(...args: TFactoryArgs): Model<TModel>;\n}\n\nfunction startCapturingEffects(): () => Effect[] | undefined {\n\tlet prevCapturedEffects = capturedEffects;\n\tcapturedEffects = [];\n\n\treturn function stopCapturingEffects() {\n\t\tlet modelEffects = capturedEffects;\n\t\tif (capturedEffects && prevCapturedEffects) {\n\t\t\tprevCapturedEffects = prevCapturedEffects.concat(capturedEffects);\n\t\t}\n\n\t\tcapturedEffects = prevCapturedEffects;\n\n\t\treturn modelEffects;\n\t};\n}\n\nconst wrapInAction = (value: Record<string, unknown>) => {\n\tfor (const key in value) {\n\t\tconst val = value[key];\n\t\tif (typeof val === \"function\") {\n\t\t\tvalue[key] = action(val as (...args: unknown[]) => unknown);\n\t\t} else if (typeof val === \"object\" && val !== null && !(\"brand\" in val)) {\n\t\t\t// Recursively wrap nested object properties in actions. This allows users to write\n\t\t\t// nested models without worrying about wrapping their functions in `action`.\n\t\t\twrapInAction(val as Record<string, unknown>);\n\t\t}\n\t}\n};\n\nfunction createModel<TModel, TFactoryArgs extends any[] = []>(\n\tmodelFactory: ModelFactory<TModel, TFactoryArgs>\n): ModelConstructor<TModel, TFactoryArgs> {\n\treturn function SignalModel(...args: TFactoryArgs): Model<TModel> {\n\t\tlet modelEffects: Effect[] | undefined;\n\t\tlet model: Model<TModel>;\n\n\t\tconst stopCapturingEffects = startCapturingEffects();\n\t\ttry {\n\t\t\tmodel = modelFactory(...args) as Model<TModel>;\n\t\t} catch (err) {\n\t\t\t// Drop any captured effects on error. Errors from nested models will bubble\n\t\t\t// up here and recursively reset `capturedEffects` to `undefined` preventing\n\t\t\t// any captured effects from leaking\n\t\t\tcapturedEffects = undefined;\n\t\t\tthrow err;\n\t\t} finally {\n\t\t\tmodelEffects = stopCapturingEffects();\n\t\t}\n\n\t\twrapInAction(model);\n\n\t\tmodel[Symbol.dispose] = action(function disposeModel() {\n\t\t\tif (modelEffects) {\n\t\t\t\tfor (let i = 0; i < modelEffects.length; i++) {\n\t\t\t\t\tmodelEffects[i].dispose();\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tmodelEffects = undefined;\n\t\t});\n\n\t\treturn model;\n\t} as InternalModelConstructor<TModel, TFactoryArgs>;\n}\n\n//#endregion createModel\n\nexport {\n\tcomputed,\n\teffect,\n\tbatch,\n\tuntracked,\n\taction,\n\tcreateModel,\n\tSignal,\n\tReadonlySignal,\n\tEffect,\n\tComputed,\n};\n"],"names":["BRAND_SYMBOL","Symbol","endBatch","batchDepth","error","hasError","snapshots","batchSnapshots","undefined","_source","_value","_version","_next","reconcileBatchSnapshots","batchedEffect","effect","batchIteration","next","_nextBatchedEffect","_flags","needsToRecompute","_callback","err","batch","fn","currentBatchSnapshotVersion","batchSnapshotVersion","evalContext","untracked","prevContext","capturedEffects","globalVersion","addDependency","signal","node","_node","_target","_prevSource","_sources","_nextSource","_prevTarget","_nextTarget","_rollbackNode","_subscribe","Signal","value","options","this","_targets","_batchSnapshotVersion","_watched","watched","_unwatched","unwatched","name","prototype","brand","_refresh","_this","targets","_this$_watched","call","_unsubscribe","_this2","prev","_this2$_unwatched","subscribe","_this3","valueOf","toString","toJSON","peek","Object","defineProperty","get","set","Error","source","recordBatchSnapshot","_notify","target","prepareSources","rollbackNode","cleanupSources","head","Computed","_fn","_globalVersion","OUTDATED","cleanupEffect","cleanup","_cleanup","disposeEffect","endEffect","Effect","push","finish","_start","bind","_dispose","dispose","action","_arguments","arguments","_this4","apply","slice","startCapturingEffects","prevCapturedEffects","modelEffects","concat","wrapInAction","key","val","exports","computed","createModel","modelFactory","model","stopCapturingEffects","i","length"],"mappings":"AAEA,IAAMA,EAAeC,OAAU,IAAC,kBAsChC,SAASC,IACR,KAAIC,EAAa,GAAjB,CAKA,IAAIC,EACAC,GAAW,GAqHhB,WACC,IAAIC,EAAYC,EAChBA,OAAiBC,EAEjB,WAAqBA,IAAdF,EAAyB,CAC/B,GAAIA,EAAUG,EAAQC,IAAWJ,EAAUI,EAC1CJ,EAAUG,EAAQE,EAAWL,EAAUK,EAExCL,EAAYA,EAAUM,CACvB,CACD,CA9HCC,GAEA,WAAyBL,IAAlBM,EAA6B,CACnC,IAAIC,EAA6BD,EACjCA,OAAgBN,EAEhBQ,IAEA,WAAkBR,IAAXO,EAAsB,CAC5B,IAAME,EAA2BF,EAAOG,EACxCH,EAAOG,OAAqBV,EAC5BO,EAAOI,IAAU,EAEjB,KArDc,EAqDRJ,EAAOI,IAAsBC,EAAiBL,GACnD,IACCA,EAAOM,GAMR,CALE,MAAOC,GACR,IAAKjB,EAAU,CACdD,EAAQkB,EACRjB,GAAW,CACZ,CACD,CAEDU,EAASE,CACV,CACD,CACAD,EAAiB,EACjBb,IAEA,GAAIE,EACH,MAAMD,CAlCP,MAFCD,GAsCF,CAcA,SAASoB,EAASC,GACjB,GAAIrB,EAAa,EAChB,OAAOqB,IAERC,IAAgCC,EA7DhCvB,IA+DA,IACC,OAAOqB,GAGR,CAFC,QACAtB,GACD,CACD,CAGA,IAAIyB,OAA6CnB,EASjD,SAASoB,EAAaJ,GACrB,IAAMK,EAAcF,EACpBA,OAAcnB,EACd,IACC,OAAOgB,GAGR,CAFC,QACAG,EAAcE,CACf,CACD,CAGA,IA4uBIC,EA5uBAhB,OAAoCN,EACpCL,EAAa,EACba,EAAiB,EASjBU,EAAuB,EACvBD,EAA8B,EAC9BlB,OAA4CC,EAI5CuB,EAAgB,EA+BpB,SAASC,EAAcC,GACtB,QAAoBzB,IAAhBmB,EAAJ,CAIA,IAAIO,EAAOD,EAAOE,EAClB,QAAa3B,IAAT0B,GAAsBA,EAAKE,IAAYT,EAAa,CAavDO,EAAO,CACNvB,EAAU,EACVF,EAASwB,EACTI,EAAaV,EAAYW,EACzBC,OAAa/B,EACb4B,EAAST,EACTa,OAAahC,EACbiC,OAAajC,EACbkC,EAAeR,GAGhB,QAA6B1B,IAAzBmB,EAAYW,EACfX,EAAYW,EAASC,EAAcL,EAEpCP,EAAYW,EAAWJ,EACvBD,EAAOE,EAAQD,EAIf,GA5Me,GA4MXP,EAAYR,EACfc,EAAOU,EAAWT,GAEnB,OAAOA,CACR,MAAWA,IAAmB,IAAnBA,EAAKvB,EAAiB,CAEhCuB,EAAKvB,EAAW,EAehB,QAAyBH,IAArB0B,EAAKK,EAA2B,CACnCL,EAAKK,EAAYF,EAAcH,EAAKG,EAEpC,QAAyB7B,IAArB0B,EAAKG,EACRH,EAAKG,EAAYE,EAAcL,EAAKK,EAGrCL,EAAKG,EAAcV,EAAYW,EAC/BJ,EAAKK,OAAc/B,EAEnBmB,EAAYW,EAAUC,EAAcL,EACpCP,EAAYW,EAAWJ,CACxB,CAIA,OAAOA,CACR,CAzEA,CA2ED,CAkFA,SAASU,EAAqBC,EAAiBC,GAC9CC,KAAKrC,EAASmC,EACdE,KAAKpC,EAAW,EAChBoC,KAAKZ,OAAQ3B,EACbuC,KAAKC,OAAWxC,EAChBuC,KAAKE,EAAwB,EAC7BF,KAAKG,QAAWJ,SAAAA,EAASK,QACzBJ,KAAKK,EAAoB,MAAPN,OAAO,EAAPA,EAASO,UAC3BN,KAAKO,WAAOR,SAAAA,EAASQ,IACtB,CAEAV,EAAOW,UAAUC,MAAQxD,EAEzB4C,EAAOW,UAAUE,EAAW,WAC3B,OACD,CAAA,EAEAb,EAAOW,UAAUZ,EAAa,SAAUT,GAAI,IAAAwB,EAC3CX,KAAMY,EAAUZ,KAAKC,EACrB,GAAIW,IAAYzB,QAA6B1B,IAArB0B,EAAKM,EAA2B,CACvDN,EAAKO,EAAckB,EACnBZ,KAAKC,EAAWd,EAEhB,QAAgB1B,IAAZmD,EACHA,EAAQnB,EAAcN,OAEtBN,EAAU,WAAK,IAAAgC,EACD,OAAbA,EAAAF,EAAKR,IAALU,EAAeC,KAAKH,EACrB,EAEF,CACD,EAEAd,EAAOW,UAAUO,EAAe,SAAU5B,OAAI6B,EAAAhB,KAE7C,QAAsBvC,IAAlBuC,KAAKC,EAAwB,CAChC,IAAMgB,EAAO9B,EAAKM,EACZvB,EAAOiB,EAAKO,EAClB,QAAajC,IAATwD,EAAoB,CACvBA,EAAKvB,EAAcxB,EACnBiB,EAAKM,OAAchC,CACpB,CAEA,QAAaA,IAATS,EAAoB,CACvBA,EAAKuB,EAAcwB,EACnB9B,EAAKO,OAAcjC,CACpB,CAEA,GAAI0B,IAASa,KAAKC,EAAU,CAC3BD,KAAKC,EAAW/B,EAChB,QAAaT,IAATS,EACHW,EAAU,WAAK,IAAAqC,EACC,OAAfA,EAAAF,EAAKX,IAALa,EAAiBJ,KAAKE,EACvB,EAEF,CACD,CACD,EAEAnB,EAAOW,UAAUW,UAAY,SAAU1C,GAAE,IAAA2C,EACxCpB,KAAA,OAAOhC,EACN,WACC,IAAM8B,EAAQsB,EAAKtB,MACbhB,EAAcF,EACpBA,OAAcnB,EACd,IACCgB,EAAGqB,EAGJ,CAFC,QACAlB,EAAcE,CACf,CACD,EACA,CAAEyB,KAAM,OAEV,EAEAV,EAAOW,UAAUa,QAAU,WAC1B,YAAYvB,KACb,EAEAD,EAAOW,UAAUc,SAAW,WAC3B,OAAOtB,KAAKF,MAAQ,EACrB,EAEAD,EAAOW,UAAUe,OAAS,WACzB,OAAWvB,KAACF,KACb,EAEAD,EAAOW,UAAUgB,KAAO,WACvB,IAAM1C,EAAcF,EACpBA,OAAcnB,EACd,IACC,YAAYqC,KAGb,CAFC,QACAlB,EAAcE,CACf,CACD,EAEA2C,OAAOC,eAAe7B,EAAOW,UAAW,QAAS,CAChDmB,IAAA,WACC,IAAMxC,EAAOF,EAAce,MAC3B,QAAavC,IAAT0B,EACHA,EAAKvB,EAAWoC,KAAKpC,EAEtB,OAAOoC,KAAKrC,CACb,EACAiE,IAAG,SAAe9B,GACjB,GAAIA,IAAUE,KAAKrC,EAAQ,CAC1B,GAAIM,EAAiB,IACpB,MAAU,IAAA4D,MAAM,mBAzSpB,SAA6BC,GAE5B,GAAmB,IAAf1E,GAAuC,IAAnBa,EAIxB,GAAI6D,EAAO5B,IAA0BxB,EAA6B,CACjEoD,EAAO5B,EAAwBxB,EAC/BlB,EAAiB,CAChBE,EAASoE,EACTnE,EAAQmE,EAAOnE,EACfC,EAAUkE,EAAOlE,EACjBC,EAAOL,EAET,CACD,CA6RGuE,CAAoB/B,MACpBA,KAAKrC,EAASmC,EACdE,KAAKpC,IACLoB,IA7ZF5B,IAgaE,IACC,IACC,IAAI+B,EAAOa,KAAKC,OACPxC,IAAT0B,EACAA,EAAOA,EAAKO,EAEZP,EAAKE,EAAQ2C,GAIf,CAFC,QACA7E,GACD,CACD,CACD,IAmBD,SAASkB,EAAiB4D,GAIzB,IACC,IAAI9C,EAAO8C,EAAO1C,OACT9B,IAAT0B,EACAA,EAAOA,EAAKK,EAEZ,GAKCL,EAAKzB,EAAQE,IAAauB,EAAKvB,IAG9BuB,EAAKzB,EAAQgD,KAEdvB,EAAKzB,EAAQE,IAAauB,EAAKvB,EAE/B,OACD,EAID,OAAO,CACR,CAEA,SAASsE,EAAeD,GAavB,IACC,IAAI9C,EAAO8C,EAAO1C,OACT9B,IAAT0B,EACAA,EAAOA,EAAKK,EACX,CACD,IAAM2C,EAAehD,EAAKzB,EAAQ0B,EAClC,QAAqB3B,IAAjB0E,EACHhD,EAAKQ,EAAgBwC,EAEtBhD,EAAKzB,EAAQ0B,EAAQD,EACrBA,EAAKvB,GAAY,EAEjB,QAAyBH,IAArB0B,EAAKK,EAA2B,CACnCyC,EAAO1C,EAAWJ,EAClB,KACD,CACD,CACD,CAEA,SAASiD,EAAeH,GACvB,IAAI9C,EAAO8C,EAAO1C,EACd8C,OAAyB5E,EAO7B,WAAgBA,IAAT0B,EAAoB,CAC1B,IAAM8B,EAAO9B,EAAKG,EAUlB,IAAuB,IAAnBH,EAAKvB,EAAiB,CACzBuB,EAAKzB,EAAQqD,EAAa5B,GAE1B,QAAa1B,IAATwD,EACHA,EAAKzB,EAAcL,EAAKK,EAEzB,QAAyB/B,IAArB0B,EAAKK,EACRL,EAAKK,EAAYF,EAAc2B,CAEjC,MAWCoB,EAAOlD,EAGRA,EAAKzB,EAAQ0B,EAAQD,EAAKQ,EAC1B,QAA2BlC,IAAvB0B,EAAKQ,EACRR,EAAKQ,OAAgBlC,EAGtB0B,EAAO8B,CACR,CAEAgB,EAAO1C,EAAW8C,CACnB,CAkBA,SAASC,EAAyB7D,EAAmBsB,GACpDF,EAAOiB,KAAKd,UAAMvC,GAElBuC,KAAKuC,EAAM9D,EACXuB,KAAKT,OAAW9B,EAChBuC,KAAKwC,EAAiBxD,EAAgB,EACtCgB,KAAK5B,EAtmBW,EAumBhB4B,KAAKG,QAAWJ,SAAAA,EAASK,QACzBJ,KAAKK,EAAaN,MAAAA,OAAAA,EAAAA,EAASO,UAC3BN,KAAKO,KAAc,MAAPR,OAAO,EAAPA,EAASQ,IACtB,CAEA+B,EAAS9B,UAAY,IAAIX,EAEzByC,EAAS9B,UAAUE,EAAW,WAC7BV,KAAK5B,IAAU,EAEf,GAnnBe,EAmnBX4B,KAAK5B,EACR,OAAO,EAMR,GArnBgB,QAqnBX4B,KAAK5B,GACT,OAAO,EAER4B,KAAK5B,IAAU,EAEf,GAAI4B,KAAKwC,IAAmBxD,EAC3B,OAAO,EAERgB,KAAKwC,EAAiBxD,EAItBgB,KAAK5B,GAtoBU,EAuoBf,GAAI4B,KAAKpC,EAAW,IAAMS,EAAiB2B,MAAO,CACjDA,KAAK5B,IAAU,EACf,QACD,CAEA,IAAMU,EAAcF,EACpB,IACCsD,EAAelC,MACfpB,EAAcoB,KACd,IAAMF,EAAQE,KAAKuC,IACnB,GA7oBgB,GA8oBfvC,KAAK5B,GACL4B,KAAKrC,IAAWmC,GACE,IAAlBE,KAAKpC,EACJ,CACDoC,KAAKrC,EAASmC,EACdE,KAAK5B,IAAU,GACf4B,KAAKpC,GACN,CAKD,CAJE,MAAOW,GACRyB,KAAKrC,EAASY,EACdyB,KAAK5B,GAxpBW,GAypBhB4B,KAAKpC,GACN,CACAgB,EAAcE,EACdsD,EAAepC,MACfA,KAAK5B,IAAU,EACf,OACD,CAAA,EAEAkE,EAAS9B,UAAUZ,EAAa,SAAUT,GACzC,QAAsB1B,IAAlBuC,KAAKC,EAAwB,CAChCD,KAAK5B,GAAUqE,GAIf,IACC,IAAItD,EAAOa,KAAKT,OACP9B,IAAT0B,EACAA,EAAOA,EAAKK,EAEZL,EAAKzB,EAAQkC,EAAWT,EAE1B,CACAU,EAAOW,UAAUZ,EAAWkB,KAAKd,KAAMb,EACxC,EAEAmD,EAAS9B,UAAUO,EAAe,SAAU5B,GAE3C,QAAsB1B,IAAlBuC,KAAKC,EAAwB,CAChCJ,EAAOW,UAAUO,EAAaD,KAAKd,KAAMb,GAIzC,QAAsB1B,IAAlBuC,KAAKC,EAAwB,CAChCD,KAAK5B,IAAU,GAEf,IACC,IAAIe,EAAOa,KAAKT,OACP9B,IAAT0B,EACAA,EAAOA,EAAKK,EAEZL,EAAKzB,EAAQqD,EAAa5B,EAE5B,CACD,CACD,EAEAmD,EAAS9B,UAAUwB,EAAU,WAC5B,KA3sBgB,EA2sBVhC,KAAK5B,GAAoB,CAC9B4B,KAAK5B,GAAUqE,EAEf,IACC,IAAItD,EAAOa,KAAKC,OACPxC,IAAT0B,EACAA,EAAOA,EAAKO,EAEZP,EAAKE,EAAQ2C,GAEf,CACD,EAEAP,OAAOC,eAAeY,EAAS9B,UAAW,QAAS,CAClDmB,IAAA,WACC,GA3tBc,EA2tBV3B,KAAK5B,EACR,MAAU,IAAAyD,MAAM,kBAEjB,IAAM1C,EAAOF,EAAce,MAC3BA,KAAKU,IACL,QAAajD,IAAT0B,EACHA,EAAKvB,EAAWoC,KAAKpC,EAEtB,GA/tBgB,GA+tBZoC,KAAK5B,EACR,WAAWT,EAEZ,OAAOqC,KAAKrC,CACb,IAqCD,SAAS+E,EAAc1E,GACtB,IAAM2E,EAAU3E,EAAO4E,EACvB5E,EAAO4E,OAAWnF,EAElB,GAAuB,mBAAZkF,EAAwB,CAhvBnCvF,IAovBC,IAAM0B,EAAcF,EACpBA,OAAcnB,EACd,IACCkF,GASD,CARE,MAAOpE,GACRP,EAAOI,IAAU,EACjBJ,EAAOI,GAvxBO,EAwxBdyE,EAAc7E,GACd,MAAMO,CACP,CAAC,QACAK,EAAcE,EACd3B,GACD,CACD,CACD,CAEA,SAAS0F,EAAc7E,GACtB,IACC,IAAImB,EAAOnB,EAAOuB,OACT9B,IAAT0B,EACAA,EAAOA,EAAKK,EAEZL,EAAKzB,EAAQqD,EAAa5B,GAE3BnB,EAAOuE,OAAM9E,EACbO,EAAOuB,OAAW9B,EAElBiF,EAAc1E,EACf,CAEA,SAAS8E,EAAwBhE,GAChC,GAAIF,IAAgBoB,KACnB,MAAM,IAAI6B,MAAM,uBAEjBO,EAAepC,MACfpB,EAAcE,EAEdkB,KAAK5B,IAAU,EACf,GAvzBgB,EAuzBZ4B,KAAK5B,EACRyE,EAAc7C,MAEf7C,GACD,CA4CA,SAAS4F,EAAqBtE,EAAcsB,GAC3CC,KAAKuC,EAAM9D,EACXuB,KAAK4C,OAAWnF,EAChBuC,KAAKT,OAAW9B,EAChBuC,KAAK7B,OAAqBV,EAC1BuC,KAAK5B,EA12BW,GA22BhB4B,KAAKO,KAAc,MAAPR,OAAO,EAAPA,EAASQ,KAErB,GAAIxB,EACHA,EAAgBiE,KAAKhD,KAEvB,CAEA+C,EAAOvC,UAAUlC,EAAY,WAC5B,IAAM2E,EAASjD,KAAKkD,IACpB,IACC,GAv3Be,EAu3BXlD,KAAK5B,EAAmB,OAC5B,QAAiBX,IAAbuC,KAAKuC,EAAmB,OAE5B,IAAMI,EAAU3C,KAAKuC,IACrB,GAAuB,mBAAZI,EACV3C,KAAK4C,EAAWD,CAIlB,CAFC,QACAM,GACD,CACD,EAEAF,EAAOvC,UAAU0C,EAAS,WACzB,GAv4Be,EAu4BXlD,KAAK5B,EACR,MAAU,IAAAyD,MAAM,kBAEjB7B,KAAK5B,GA14BU,EA24Bf4B,KAAK5B,IAAU,EACfsE,EAAc1C,MACdkC,EAAelC,MA72Bf5C,IAg3BA,IAAM0B,EAAcF,EACpBA,EAAcoB,KACd,OAAO8C,EAAUK,KAAKnD,KAAMlB,EAC7B,EAEAiE,EAAOvC,UAAUwB,EAAU,WAC1B,KAr5BgB,EAq5BVhC,KAAK5B,GAAoB,CAC9B4B,KAAK5B,GAt5BU,EAu5Bf4B,KAAK7B,EAAqBJ,EAC1BA,EAAgBiC,IACjB,CACD,EAEA+C,EAAOvC,UAAU4C,EAAW,WAC3BpD,KAAK5B,GA35BW,EA65BhB,KAh6Be,EAg6BT4B,KAAK5B,GACVyE,EAAc7C,KAEhB,EAEA+C,EAAOvC,UAAU6C,QAAU,WAC1BrD,KAAKoD,GACN,EAcA,SAASpF,EAAOS,EAAcsB,GAC7B,IAAM/B,EAAS,IAAI+E,EAAOtE,EAAIsB,GAC9B,IACC/B,EAAOM,GAIR,CAHE,MAAOC,GACRP,EAAOoF,IACP,MAAM7E,CACP,CAGA,IAAM8E,EAAUrF,EAAOoF,EAASD,KAAKnF,GACpCqF,EAAgBnG,OAAOmG,SAAWA,EACnC,OAAOA,CACR,CAMA,SAASC,EACR7E,GAEA,OAAO,WAAoD8E,IAAAA,EAAAC,UAAAC,EAC1DzD,KAAA,OAAOxB,EAAM,kBAAMK,EAAU,WAAM,OAAAJ,EAAGiF,MAAMD,EAAI,GAAAE,MAAA7C,KAAAyC,GAAO,EAAC,EACzD,CACD,CA+DA,SAASK,IACR,IAAIC,EAAsB9E,EAC1BA,EAAkB,GAElB,OAAO,WACN,IAAI+E,EAAe/E,EACnB,GAAIA,GAAmB8E,EACtBA,EAAsBA,EAAoBE,OAAOhF,GAGlDA,EAAkB8E,EAElB,OAAOC,CACR,CACD,CAEA,IAAME,EAAe,SAAClE,GACrB,IAAK,IAAMmE,KAAOnE,EAAO,CACxB,IAAMoE,EAAMpE,EAAMmE,GAClB,GAAmB,mBAARC,EACVpE,EAAMmE,GAAOX,EAAOY,QACd,GAAmB,iBAARA,GAA4B,OAARA,KAAkB,UAAWA,GAGlEF,EAAaE,EAEf,CACD,EAoCAC,QAAA7B,SAAAA,EAAA6B,QAAApB,OAAAA,EAAAoB,QAAAtE,OAAAA,EAAAsE,QAAAb,OAAAA,EAAAa,QAAA3F,MAAAA,EAAA2F,QAAAC,SA3UA,SACC3F,EACAsB,GAEA,OAAO,IAAIuC,EAAS7D,EAAIsB,EACzB,EAsUAoE,QAAAE,YAlCA,SACCC,GAEA,kBACC,IAAIR,EACAS,EAEEC,EAAuBZ,IAC7B,IACCW,EAAQD,EAAYZ,WAAA,EAAA,GAAAC,MAAA7C,KAAA0C,WASrB,CARE,MAAOjF,GAIRQ,OAAkBtB,EAClB,MAAMc,CACP,CAAC,QACAuF,EAAeU,GAChB,CAEAR,EAAaO,GAEbA,EAAMrH,OAAOmG,SAAWC,EAAO,WAC9B,GAAIQ,EACH,IAAK,IAAIW,EAAI,EAAGA,EAAIX,EAAaY,OAAQD,IACxCX,EAAaW,GAAGpB,UAIlBS,OAAerG,CAChB,GAEA,OAAO8G,CACR,CACD,EAAAJ,QAAAnG,OAAAA,EAAAmG,QAAAjF,OArnBgB,SAAUY,EAAWC,GACpC,WAAWF,EAAOC,EAAOC,EAC1B,EAmnBAoE,QAAAtF,UAAAA"}

package/dist/node_modules/@preact/signals-core/dist/signals-core.min.js

@@ -1 +0,0 @@
-!function(i,t){"object"==typeof exports&&"undefined"!=typeof module?t(exports):"function"==typeof define&&define.amd?define(["exports"],t):t((i||self).preactSignalsCore={})}(this,function(i){var t=Symbol.for("preact-signals");function n(){if(!(v>1)){var i,t=!1;!function(){var i=c;c=void 0;while(void 0!==i){if(i.S.v===i.v)i.S.i=i.i;i=i.o}}();while(void 0!==s){var n=s;s=void 0;e++;while(void 0!==n){var o=n.u;n.u=void 0;n.f&=-3;if(!(8&n.f)&&w(n))try{n.c()}catch(n){if(!t){i=n;t=!0}}n=o}}e=0;v--;if(t)throw i}else v--}function o(i){if(v>0)return i();d=++u;v++;try{return i()}finally{n()}}var r=void 0;function f(i){var t=r;r=void 0;try{return i()}finally{r=t}}var h,s=void 0,v=0,e=0,u=0,d=0,c=void 0,a=0;function l(i){if(void 0!==r){var t=i.n;if(void 0===t||t.t!==r){t={i:0,S:i,p:r.s,n:void 0,t:r,e:void 0,x:void 0,r:t};if(void 0!==r.s)r.s.n=t;r.s=t;i.n=t;if(32&r.f)i.S(t);return t}else if(-1===t.i){t.i=0;if(void 0!==t.n){t.n.p=t.p;if(void 0!==t.p)t.p.n=t.n;t.p=r.s;t.n=void 0;r.s.n=t;r.s=t}return t}}}function y(i,t){this.v=i;this.i=0;this.n=void 0;this.t=void 0;this.l=0;this.W=null==t?void 0:t.watched;this.Z=null==t?void 0:t.unwatched;this.name=null==t?void 0:t.name}y.prototype.brand=t;y.prototype.h=function(){return!0};y.prototype.S=function(i){var t=this,n=this.t;if(n!==i&&void 0===i.e){i.x=n;this.t=i;if(void 0!==n)n.e=i;else f(function(){var i;null==(i=t.W)||i.call(t)})}};y.prototype.U=function(i){var t=this;if(void 0!==this.t){var n=i.e,o=i.x;if(void 0!==n){n.x=o;i.e=void 0}if(void 0!==o){o.e=n;i.x=void 0}if(i===this.t){this.t=o;if(void 0===o)f(function(){var i;null==(i=t.Z)||i.call(t)})}}};y.prototype.subscribe=function(i){var t=this;return j(function(){var n=t.value,o=r;r=void 0;try{i(n)}finally{r=o}},{name:"sub"})};y.prototype.valueOf=function(){return this.value};y.prototype.toString=function(){return this.value+""};y.prototype.toJSON=function(){return this.value};y.prototype.peek=function(){var i=r;r=void 0;try{return this.value}finally{r=i}};Object.defineProperty(y.prototype,"value",{get:function(){var i=l(this);if(void 0!==i)i.i=this.i;return this.v},set:function(i){if(i!==this.v){if(e>100)throw new Error("Cycle detected");!function(i){if(0!==v&&0===e)if(i.l!==d){i.l=d;c={S:i,v:i.v,i:i.i,o:c}}}(this);this.v=i;this.i++;a++;v++;try{for(var t=this.t;void 0!==t;t=t.x)t.t.N()}finally{n()}}}});function w(i){for(var t=i.s;void 0!==t;t=t.n)if(t.S.i!==t.i||!t.S.h()||t.S.i!==t.i)return!0;return!1}function p(i){for(var t=i.s;void 0!==t;t=t.n){var n=t.S.n;if(void 0!==n)t.r=n;t.S.n=t;t.i=-1;if(void 0===t.n){i.s=t;break}}}function b(i){var t=i.s,n=void 0;while(void 0!==t){var o=t.p;if(-1===t.i){t.S.U(t);if(void 0!==o)o.n=t.n;if(void 0!==t.n)t.n.p=o}else n=t;t.S.n=t.r;if(void 0!==t.r)t.r=void 0;t=o}i.s=n}function _(i,t){y.call(this,void 0);this.x=i;this.s=void 0;this.g=a-1;this.f=4;this.W=null==t?void 0:t.watched;this.Z=null==t?void 0:t.unwatched;this.name=null==t?void 0:t.name}_.prototype=new y;_.prototype.h=function(){this.f&=-3;if(1&this.f)return!1;if(32==(36&this.f))return!0;this.f&=-5;if(this.g===a)return!0;this.g=a;this.f|=1;if(this.i>0&&!w(this)){this.f&=-2;return!0}var i=r;try{p(this);r=this;var t=this.x();if(16&this.f||this.v!==t||0===this.i){this.v=t;this.f&=-17;this.i++}}catch(i){this.v=i;this.f|=16;this.i++}r=i;b(this);this.f&=-2;return!0};_.prototype.S=function(i){if(void 0===this.t){this.f|=36;for(var t=this.s;void 0!==t;t=t.n)t.S.S(t)}y.prototype.S.call(this,i)};_.prototype.U=function(i){if(void 0!==this.t){y.prototype.U.call(this,i);if(void 0===this.t){this.f&=-33;for(var t=this.s;void 0!==t;t=t.n)t.S.U(t)}}};_.prototype.N=function(){if(!(2&this.f)){this.f|=6;for(var i=this.t;void 0!==i;i=i.x)i.t.N()}};Object.defineProperty(_.prototype,"value",{get:function(){if(1&this.f)throw new Error("Cycle detected");var i=l(this);this.h();if(void 0!==i)i.i=this.i;if(16&this.f)throw this.v;return this.v}});function g(i){var t=i.m;i.m=void 0;if("function"==typeof t){v++;var o=r;r=void 0;try{t()}catch(t){i.f&=-2;i.f|=8;x(i);throw t}finally{r=o;n()}}}function x(i){for(var t=i.s;void 0!==t;t=t.n)t.S.U(t);i.x=void 0;i.s=void 0;g(i)}function m(i){if(r!==this)throw new Error("Out-of-order effect");b(this);r=i;this.f&=-2;if(8&this.f)x(this);n()}function S(i,t){this.x=i;this.m=void 0;this.s=void 0;this.u=void 0;this.f=32;this.name=null==t?void 0:t.name;if(h)h.push(this)}S.prototype.c=function(){var i=this.S();try{if(8&this.f)return;if(void 0===this.x)return;var t=this.x();if("function"==typeof t)this.m=t}finally{i()}};S.prototype.S=function(){if(1&this.f)throw new Error("Cycle detected");this.f|=1;this.f&=-9;g(this);p(this);v++;var i=r;r=this;return m.bind(this,i)};S.prototype.N=function(){if(!(2&this.f)){this.f|=2;this.u=s;s=this}};S.prototype.d=function(){this.f|=8;if(!(1&this.f))x(this)};S.prototype.dispose=function(){this.d()};function j(i,t){var n=new S(i,t);try{n.c()}catch(i){n.d();throw i}var o=n.d.bind(n);o[Symbol.dispose]=o;return o}function E(i){return function(){var t=arguments,n=this;return o(function(){return f(function(){return i.apply(n,[].slice.call(t))})})}}function T(){var i=h;h=[];return function(){var t=h;if(h&&i)i=i.concat(h);h=i;return t}}var C=function(i){for(var t in i){var n=i[t];if("function"==typeof n)i[t]=E(n);else if("object"==typeof n&&null!==n&&!("brand"in n))C(n)}};i.Computed=_;i.Effect=S;i.Signal=y;i.action=E;i.batch=o;i.computed=function(i,t){return new _(i,t)};i.createModel=function(i){return function(){var t,n,o=T();try{n=i.apply(void 0,[].slice.call(arguments))}catch(i){h=void 0;throw i}finally{t=o()}C(n);n[Symbol.dispose]=E(function(){if(t)for(var i=0;i<t.length;i++)t[i].dispose();t=void 0});return n}};i.effect=j;i.signal=function(i,t){return new y(i,t)};i.untracked=f});//# sourceMappingURL=signals-core.min.js.map

package/dist/node_modules/@preact/signals-core/dist/signals-core.min.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"signals-core.min.js","sources":["../src/index.ts"],"sourcesContent":["// An named symbol/brand for detecting Signal instances even when they weren't\n// created using the same signals library version.\nconst BRAND_SYMBOL = Symbol.for(\"preact-signals\");\n\n// Flags for Computed and Effect.\nconst RUNNING = 1 << 0;\nconst NOTIFIED = 1 << 1;\nconst OUTDATED = 1 << 2;\nconst DISPOSED = 1 << 3;\nconst HAS_ERROR = 1 << 4;\nconst TRACKING = 1 << 5;\n\n// A linked list node used to track dependencies (sources) and dependents (targets).\n// Also used to remember the source's last version number that the target saw.\ntype Node = {\n\t// A source whose value the target depends on.\n\t_source: Signal;\n\t_prevSource?: Node;\n\t_nextSource?: Node;\n\n\t// A target that depends on the source and should be notified when the source changes.\n\t_target: Computed | Effect;\n\t_prevTarget?: Node;\n\t_nextTarget?: Node;\n\n\t// The version number of the source that target has last seen. We use version numbers\n\t// instead of storing the source value, because source values can take arbitrary amount\n\t// of memory, and computeds could hang on to them forever because they're lazily evaluated.\n\t// Use the special value -1 to mark potentially unused but recyclable nodes.\n\t_version: number;\n\n\t// Used to remember & roll back the source's previous `._node` value when entering &\n\t// exiting a new evaluation context.\n\t_rollbackNode?: Node;\n};\n\nfunction startBatch() {\n\tbatchDepth++;\n}\n\nfunction endBatch() {\n\tif (batchDepth > 1) {\n\t\tbatchDepth--;\n\t\treturn;\n\t}\n\n\tlet error: unknown;\n\tlet hasError = false;\n\treconcileBatchSnapshots();\n\n\twhile (batchedEffect !== undefined) {\n\t\tlet effect: Effect | undefined = batchedEffect;\n\t\tbatchedEffect = undefined;\n\n\t\tbatchIteration++;\n\n\t\twhile (effect !== undefined) {\n\t\t\tconst next: Effect | undefined = effect._nextBatchedEffect;\n\t\t\teffect._nextBatchedEffect = undefined;\n\t\t\teffect._flags &= ~NOTIFIED;\n\n\t\t\tif (!(effect._flags & DISPOSED) && needsToRecompute(effect)) {\n\t\t\t\ttry {\n\t\t\t\t\teffect._callback();\n\t\t\t\t} catch (err) {\n\t\t\t\t\tif (!hasError) {\n\t\t\t\t\t\terror = err;\n\t\t\t\t\t\thasError = true;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\teffect = next;\n\t\t}\n\t}\n\tbatchIteration = 0;\n\tbatchDepth--;\n\n\tif (hasError) {\n\t\tthrow error;\n\t}\n}\n\n/**\n * Combine multiple value updates into one \"commit\" at the end of the provided callback.\n *\n * Batches can be nested and changes are only flushed once the outermost batch callback\n * completes.\n *\n * Accessing a signal that has been modified within a batch will reflect its updated\n * value.\n *\n * @param fn The callback function.\n * @returns The value returned by the callback.\n */\nfunction batch<T>(fn: () => T): T {\n\tif (batchDepth > 0) {\n\t\treturn fn();\n\t}\n\tcurrentBatchSnapshotVersion = ++batchSnapshotVersion;\n\t/*@__INLINE__**/ startBatch();\n\ttry {\n\t\treturn fn();\n\t} finally {\n\t\tendBatch();\n\t}\n}\n\n// Currently evaluated computed or effect.\nlet evalContext: Computed | Effect | undefined = undefined;\n\n/**\n * Run a callback function that can access signal values without\n * subscribing to the signal updates.\n *\n * @param fn The callback function.\n * @returns The value returned by the callback.\n */\nfunction untracked<T>(fn: () => T): T {\n\tconst prevContext = evalContext;\n\tevalContext = undefined;\n\ttry {\n\t\treturn fn();\n\t} finally {\n\t\tevalContext = prevContext;\n\t}\n}\n\n// Effects collected into a batch.\nlet batchedEffect: Effect | undefined = undefined;\nlet batchDepth = 0;\nlet batchIteration = 0;\n\ntype BatchSnapshot = {\n\t_source: Signal;\n\t_value: unknown;\n\t_version: number;\n\t_next?: BatchSnapshot;\n};\n\nlet batchSnapshotVersion = 0;\nlet currentBatchSnapshotVersion = 0;\nlet batchSnapshots: BatchSnapshot | undefined = undefined;\n\n// A global version number for signals, used for fast-pathing repeated\n// computed.peek()/computed.value calls when nothing has changed globally.\nlet globalVersion = 0;\n\nfunction recordBatchSnapshot(source: Signal) {\n\t// Only capture writes during the user-visible batch callback, not during effect flush.\n\tif (batchDepth === 0 || batchIteration !== 0) {\n\t\treturn;\n\t}\n\n\tif (source._batchSnapshotVersion !== currentBatchSnapshotVersion) {\n\t\tsource._batchSnapshotVersion = currentBatchSnapshotVersion;\n\t\tbatchSnapshots = {\n\t\t\t_source: source,\n\t\t\t_value: source._value,\n\t\t\t_version: source._version,\n\t\t\t_next: batchSnapshots,\n\t\t};\n\t}\n}\n\nfunction reconcileBatchSnapshots() {\n\tlet snapshots = batchSnapshots;\n\tbatchSnapshots = undefined;\n\n\twhile (snapshots !== undefined) {\n\t\tif (snapshots._source._value === snapshots._value) {\n\t\t\tsnapshots._source._version = snapshots._version;\n\t\t}\n\t\tsnapshots = snapshots._next;\n\t}\n}\n\nfunction addDependency(signal: Signal): Node | undefined {\n\tif (evalContext === undefined) {\n\t\treturn undefined;\n\t}\n\n\tlet node = signal._node;\n\tif (node === undefined || node._target !== evalContext) {\n\t\t/**\n\t\t * `signal` is a new dependency. Create a new dependency node, and set it\n\t\t * as the tail of the current context's dependency list. e.g:\n\t\t *\n\t\t * { A <-> B       }\n\t\t *         ↑     ↑\n\t\t *        tail  node (new)\n\t\t *               ↓\n\t\t * { A <-> B <-> C }\n\t\t *               ↑\n\t\t *              tail (evalContext._sources)\n\t\t */\n\t\tnode = {\n\t\t\t_version: 0,\n\t\t\t_source: signal,\n\t\t\t_prevSource: evalContext._sources,\n\t\t\t_nextSource: undefined,\n\t\t\t_target: evalContext,\n\t\t\t_prevTarget: undefined,\n\t\t\t_nextTarget: undefined,\n\t\t\t_rollbackNode: node,\n\t\t};\n\n\t\tif (evalContext._sources !== undefined) {\n\t\t\tevalContext._sources._nextSource = node;\n\t\t}\n\t\tevalContext._sources = node;\n\t\tsignal._node = node;\n\n\t\t// Subscribe to change notifications from this dependency if we're in an effect\n\t\t// OR evaluating a computed signal that in turn has subscribers.\n\t\tif (evalContext._flags & TRACKING) {\n\t\t\tsignal._subscribe(node);\n\t\t}\n\t\treturn node;\n\t} else if (node._version === -1) {\n\t\t// `signal` is an existing dependency from a previous evaluation. Reuse it.\n\t\tnode._version = 0;\n\n\t\t/**\n\t\t * If `node` is not already the current tail of the dependency list (i.e.\n\t\t * there is a next node in the list), then make the `node` the new tail. e.g:\n\t\t *\n\t\t * { A <-> B <-> C <-> D }\n\t\t *         ↑           ↑\n\t\t *        node   ┌─── tail (evalContext._sources)\n\t\t *         └─────│─────┐\n\t\t *               ↓     ↓\n\t\t * { A <-> C <-> D <-> B }\n\t\t *                     ↑\n\t\t *                    tail (evalContext._sources)\n\t\t */\n\t\tif (node._nextSource !== undefined) {\n\t\t\tnode._nextSource._prevSource = node._prevSource;\n\n\t\t\tif (node._prevSource !== undefined) {\n\t\t\t\tnode._prevSource._nextSource = node._nextSource;\n\t\t\t}\n\n\t\t\tnode._prevSource = evalContext._sources;\n\t\t\tnode._nextSource = undefined;\n\n\t\t\tevalContext._sources!._nextSource = node;\n\t\t\tevalContext._sources = node;\n\t\t}\n\n\t\t// We can assume that the currently evaluated effect / computed signal is already\n\t\t// subscribed to change notifications from `signal` if needed.\n\t\treturn node;\n\t}\n\treturn undefined;\n}\n\n//#region Signal\n\n/**\n * The base class for plain and computed signals.\n */\n//\n// A function with the same name is defined later, so we need to ignore TypeScript's\n// warning about a redeclared variable.\n//\n// The class is declared here, but later implemented with ES5-style prototypes.\n// This enables better control of the transpiled output size.\n// @ts-ignore: \"Cannot redeclare exported variable 'Signal'.\"\ndeclare class Signal<T = any> {\n\t/** @internal */\n\t_value: unknown;\n\n\t/**\n\t * @internal\n\t * Version numbers should always be >= 0, because the special value -1 is used\n\t * by Nodes to signify potentially unused but recyclable nodes.\n\t */\n\t_version: number;\n\n\t/** @internal */\n\t_node?: Node;\n\n\t/** @internal */\n\t_targets?: Node;\n\n\t/** @internal */\n\t_batchSnapshotVersion: number;\n\n\tconstructor(value?: T, options?: SignalOptions<T>);\n\n\t/** @internal */\n\t_refresh(): boolean;\n\n\t/** @internal */\n\t_subscribe(node: Node): void;\n\n\t/** @internal */\n\t_unsubscribe(node: Node): void;\n\n\t/** @internal */\n\t_watched?(this: Signal<T>): void;\n\n\t/** @internal */\n\t_unwatched?(this: Signal<T>): void;\n\n\tsubscribe(fn: (value: T) => void): () => void;\n\n\tname?: string;\n\n\tvalueOf(): T;\n\n\ttoString(): string;\n\n\ttoJSON(): T;\n\n\tpeek(): T;\n\n\tbrand: typeof BRAND_SYMBOL;\n\n\tget value(): T;\n\tset value(value: T);\n}\n\nexport interface SignalOptions<T = any> {\n\twatched?: (this: Signal<T>) => void;\n\tunwatched?: (this: Signal<T>) => void;\n\tname?: string;\n}\n\n/** @internal */\n// A class with the same name has already been declared, so we need to ignore\n// TypeScript's warning about a redeclared variable.\n//\n// The previously declared class is implemented here with ES5-style prototypes.\n// This enables better control of the transpiled output size.\n// @ts-ignore: \"Cannot redeclare exported variable 'Signal'.\"\nfunction Signal(this: Signal, value?: unknown, options?: SignalOptions) {\n\tthis._value = value;\n\tthis._version = 0;\n\tthis._node = undefined;\n\tthis._targets = undefined;\n\tthis._batchSnapshotVersion = 0;\n\tthis._watched = options?.watched;\n\tthis._unwatched = options?.unwatched;\n\tthis.name = options?.name;\n}\n\nSignal.prototype.brand = BRAND_SYMBOL;\n\nSignal.prototype._refresh = function () {\n\treturn true;\n};\n\nSignal.prototype._subscribe = function (node) {\n\tconst targets = this._targets;\n\tif (targets !== node && node._prevTarget === undefined) {\n\t\tnode._nextTarget = targets;\n\t\tthis._targets = node;\n\n\t\tif (targets !== undefined) {\n\t\t\ttargets._prevTarget = node;\n\t\t} else {\n\t\t\tuntracked(() => {\n\t\t\t\tthis._watched?.call(this);\n\t\t\t});\n\t\t}\n\t}\n};\n\nSignal.prototype._unsubscribe = function (node) {\n\t// Only run the unsubscribe step if the signal has any subscribers to begin with.\n\tif (this._targets !== undefined) {\n\t\tconst prev = node._prevTarget;\n\t\tconst next = node._nextTarget;\n\t\tif (prev !== undefined) {\n\t\t\tprev._nextTarget = next;\n\t\t\tnode._prevTarget = undefined;\n\t\t}\n\n\t\tif (next !== undefined) {\n\t\t\tnext._prevTarget = prev;\n\t\t\tnode._nextTarget = undefined;\n\t\t}\n\n\t\tif (node === this._targets) {\n\t\t\tthis._targets = next;\n\t\t\tif (next === undefined) {\n\t\t\t\tuntracked(() => {\n\t\t\t\t\tthis._unwatched?.call(this);\n\t\t\t\t});\n\t\t\t}\n\t\t}\n\t}\n};\n\nSignal.prototype.subscribe = function (fn) {\n\treturn effect(\n\t\t() => {\n\t\t\tconst value = this.value;\n\t\t\tconst prevContext = evalContext;\n\t\t\tevalContext = undefined;\n\t\t\ttry {\n\t\t\t\tfn(value);\n\t\t\t} finally {\n\t\t\t\tevalContext = prevContext;\n\t\t\t}\n\t\t},\n\t\t{ name: \"sub\" }\n\t);\n};\n\nSignal.prototype.valueOf = function () {\n\treturn this.value;\n};\n\nSignal.prototype.toString = function () {\n\treturn this.value + \"\";\n};\n\nSignal.prototype.toJSON = function () {\n\treturn this.value;\n};\n\nSignal.prototype.peek = function () {\n\tconst prevContext = evalContext;\n\tevalContext = undefined;\n\ttry {\n\t\treturn this.value;\n\t} finally {\n\t\tevalContext = prevContext;\n\t}\n};\n\nObject.defineProperty(Signal.prototype, \"value\", {\n\tget(this: Signal) {\n\t\tconst node = addDependency(this);\n\t\tif (node !== undefined) {\n\t\t\tnode._version = this._version;\n\t\t}\n\t\treturn this._value;\n\t},\n\tset(this: Signal, value) {\n\t\tif (value !== this._value) {\n\t\t\tif (batchIteration > 100) {\n\t\t\t\tthrow new Error(\"Cycle detected\");\n\t\t\t}\n\n\t\t\trecordBatchSnapshot(this);\n\t\t\tthis._value = value;\n\t\t\tthis._version++;\n\t\t\tglobalVersion++;\n\n\t\t\t/**@__INLINE__*/ startBatch();\n\t\t\ttry {\n\t\t\t\tfor (\n\t\t\t\t\tlet node = this._targets;\n\t\t\t\t\tnode !== undefined;\n\t\t\t\t\tnode = node._nextTarget\n\t\t\t\t) {\n\t\t\t\t\tnode._target._notify();\n\t\t\t\t}\n\t\t\t} finally {\n\t\t\t\tendBatch();\n\t\t\t}\n\t\t}\n\t},\n});\n\n/**\n * Create a new plain signal.\n *\n * @param value The initial value for the signal.\n * @returns A new signal.\n */\nexport function signal<T>(value: T, options?: SignalOptions<T>): Signal<T>;\nexport function signal<T = undefined>(): Signal<T | undefined>;\nexport function signal<T>(value?: T, options?: SignalOptions<T>): Signal<T> {\n\treturn new Signal(value, options);\n}\n\n//#endregion Signal\n\n//#region Computed\n\nfunction needsToRecompute(target: Computed | Effect): boolean {\n\t// Check the dependencies for changed values. The dependency list is already\n\t// in order of use. Therefore if multiple dependencies have changed values, only\n\t// the first used dependency is re-evaluated at this point.\n\tfor (\n\t\tlet node = target._sources;\n\t\tnode !== undefined;\n\t\tnode = node._nextSource\n\t) {\n\t\tif (\n\t\t\t// If the dependency has definitely been updated since its version number\n\t\t\t// was observed, then we need to recompute. This first check is not strictly\n\t\t\t// necessary for correctness, but allows us to skip the refresh call if the\n\t\t\t// dependency has already been updated.\n\t\t\tnode._source._version !== node._version ||\n\t\t\t// Refresh the dependency. If there's something blocking the refresh (e.g. a\n\t\t\t// dependency cycle), then we need to recompute.\n\t\t\t!node._source._refresh() ||\n\t\t\t// If the dependency got a new version after the refresh, then we need to recompute.\n\t\t\tnode._source._version !== node._version\n\t\t) {\n\t\t\treturn true;\n\t\t}\n\t}\n\t// If none of the dependencies have changed values since last recompute then\n\t// there's no need to recompute.\n\treturn false;\n}\n\nfunction prepareSources(target: Computed | Effect) {\n\t/**\n\t * 1. Mark all current sources as re-usable nodes (version: -1)\n\t * 2. Set a rollback node if the current node is being used in a different context\n\t * 3. Point 'target._sources' to the tail of the doubly-linked list, e.g:\n\t *\n\t *    { undefined <- A <-> B <-> C -> undefined }\n\t *                   ↑           ↑\n\t *                   │           └──────┐\n\t * target._sources = A; (node is head)  │\n\t *                   ↓                  │\n\t * target._sources = C; (node is tail) ─┘\n\t */\n\tfor (\n\t\tlet node = target._sources;\n\t\tnode !== undefined;\n\t\tnode = node._nextSource\n\t) {\n\t\tconst rollbackNode = node._source._node;\n\t\tif (rollbackNode !== undefined) {\n\t\t\tnode._rollbackNode = rollbackNode;\n\t\t}\n\t\tnode._source._node = node;\n\t\tnode._version = -1;\n\n\t\tif (node._nextSource === undefined) {\n\t\t\ttarget._sources = node;\n\t\t\tbreak;\n\t\t}\n\t}\n}\n\nfunction cleanupSources(target: Computed | Effect) {\n\tlet node = target._sources;\n\tlet head: Node | undefined = undefined;\n\n\t/**\n\t * At this point 'target._sources' points to the tail of the doubly-linked list.\n\t * It contains all existing sources + new sources in order of use.\n\t * Iterate backwards until we find the head node while dropping old dependencies.\n\t */\n\twhile (node !== undefined) {\n\t\tconst prev = node._prevSource;\n\n\t\t/**\n\t\t * The node was not re-used, unsubscribe from its change notifications and remove itself\n\t\t * from the doubly-linked list. e.g:\n\t\t *\n\t\t * { A <-> B <-> C }\n\t\t *         ↓\n\t\t *    { A <-> C }\n\t\t */\n\t\tif (node._version === -1) {\n\t\t\tnode._source._unsubscribe(node);\n\n\t\t\tif (prev !== undefined) {\n\t\t\t\tprev._nextSource = node._nextSource;\n\t\t\t}\n\t\t\tif (node._nextSource !== undefined) {\n\t\t\t\tnode._nextSource._prevSource = prev;\n\t\t\t}\n\t\t} else {\n\t\t\t/**\n\t\t\t * The new head is the last node seen which wasn't removed/unsubscribed\n\t\t\t * from the doubly-linked list. e.g:\n\t\t\t *\n\t\t\t * { A <-> B <-> C }\n\t\t\t *   ↑     ↑     ↑\n\t\t\t *   │     │     └ head = node\n\t\t\t *   │     └ head = node\n\t\t\t *   └ head = node\n\t\t\t */\n\t\t\thead = node;\n\t\t}\n\n\t\tnode._source._node = node._rollbackNode;\n\t\tif (node._rollbackNode !== undefined) {\n\t\t\tnode._rollbackNode = undefined;\n\t\t}\n\n\t\tnode = prev;\n\t}\n\n\ttarget._sources = head;\n}\n\n/**\n * The base class for computed signals.\n */\ndeclare class Computed<T = any> extends Signal<T> {\n\t_fn: () => T;\n\t_sources?: Node;\n\t_globalVersion: number;\n\t_flags: number;\n\n\tconstructor(fn: () => T, options?: SignalOptions<T>);\n\n\t_notify(): void;\n\tget value(): T;\n}\n\n/** @internal */\nfunction Computed(this: Computed, fn: () => unknown, options?: SignalOptions) {\n\tSignal.call(this, undefined);\n\n\tthis._fn = fn;\n\tthis._sources = undefined;\n\tthis._globalVersion = globalVersion - 1;\n\tthis._flags = OUTDATED;\n\tthis._watched = options?.watched;\n\tthis._unwatched = options?.unwatched;\n\tthis.name = options?.name;\n}\n\nComputed.prototype = new Signal() as Computed;\n\nComputed.prototype._refresh = function () {\n\tthis._flags &= ~NOTIFIED;\n\n\tif (this._flags & RUNNING) {\n\t\treturn false;\n\t}\n\n\t// If this computed signal has subscribed to updates from its dependencies\n\t// (TRACKING flag set) and none of them have notified about changes (OUTDATED\n\t// flag not set), then the computed value can't have changed.\n\tif ((this._flags & (OUTDATED | TRACKING)) === TRACKING) {\n\t\treturn true;\n\t}\n\tthis._flags &= ~OUTDATED;\n\n\tif (this._globalVersion === globalVersion) {\n\t\treturn true;\n\t}\n\tthis._globalVersion = globalVersion;\n\n\t// Mark this computed signal running before checking the dependencies for value\n\t// changes, so that the RUNNING flag can be used to notice cyclical dependencies.\n\tthis._flags |= RUNNING;\n\tif (this._version > 0 && !needsToRecompute(this)) {\n\t\tthis._flags &= ~RUNNING;\n\t\treturn true;\n\t}\n\n\tconst prevContext = evalContext;\n\ttry {\n\t\tprepareSources(this);\n\t\tevalContext = this;\n\t\tconst value = this._fn();\n\t\tif (\n\t\t\tthis._flags & HAS_ERROR ||\n\t\t\tthis._value !== value ||\n\t\t\tthis._version === 0\n\t\t) {\n\t\t\tthis._value = value;\n\t\t\tthis._flags &= ~HAS_ERROR;\n\t\t\tthis._version++;\n\t\t}\n\t} catch (err) {\n\t\tthis._value = err;\n\t\tthis._flags |= HAS_ERROR;\n\t\tthis._version++;\n\t}\n\tevalContext = prevContext;\n\tcleanupSources(this);\n\tthis._flags &= ~RUNNING;\n\treturn true;\n};\n\nComputed.prototype._subscribe = function (node) {\n\tif (this._targets === undefined) {\n\t\tthis._flags |= OUTDATED | TRACKING;\n\n\t\t// A computed signal subscribes lazily to its dependencies when it\n\t\t// gets its first subscriber.\n\t\tfor (\n\t\t\tlet node = this._sources;\n\t\t\tnode !== undefined;\n\t\t\tnode = node._nextSource\n\t\t) {\n\t\t\tnode._source._subscribe(node);\n\t\t}\n\t}\n\tSignal.prototype._subscribe.call(this, node);\n};\n\nComputed.prototype._unsubscribe = function (node) {\n\t// Only run the unsubscribe step if the computed signal has any subscribers.\n\tif (this._targets !== undefined) {\n\t\tSignal.prototype._unsubscribe.call(this, node);\n\n\t\t// Computed signal unsubscribes from its dependencies when it loses its last subscriber.\n\t\t// This makes it possible for unreferences subgraphs of computed signals to get garbage collected.\n\t\tif (this._targets === undefined) {\n\t\t\tthis._flags &= ~TRACKING;\n\n\t\t\tfor (\n\t\t\t\tlet node = this._sources;\n\t\t\t\tnode !== undefined;\n\t\t\t\tnode = node._nextSource\n\t\t\t) {\n\t\t\t\tnode._source._unsubscribe(node);\n\t\t\t}\n\t\t}\n\t}\n};\n\nComputed.prototype._notify = function () {\n\tif (!(this._flags & NOTIFIED)) {\n\t\tthis._flags |= OUTDATED | NOTIFIED;\n\n\t\tfor (\n\t\t\tlet node = this._targets;\n\t\t\tnode !== undefined;\n\t\t\tnode = node._nextTarget\n\t\t) {\n\t\t\tnode._target._notify();\n\t\t}\n\t}\n};\n\nObject.defineProperty(Computed.prototype, \"value\", {\n\tget(this: Computed) {\n\t\tif (this._flags & RUNNING) {\n\t\t\tthrow new Error(\"Cycle detected\");\n\t\t}\n\t\tconst node = addDependency(this);\n\t\tthis._refresh();\n\t\tif (node !== undefined) {\n\t\t\tnode._version = this._version;\n\t\t}\n\t\tif (this._flags & HAS_ERROR) {\n\t\t\tthrow this._value;\n\t\t}\n\t\treturn this._value;\n\t},\n});\n\n/**\n * An interface for read-only signals.\n */\ninterface ReadonlySignal<T = any> {\n\treadonly value: T;\n\tpeek(): T;\n\n\tsubscribe(fn: (value: T) => void): () => void;\n\tvalueOf(): T;\n\ttoString(): string;\n\ttoJSON(): T;\n\tbrand: typeof BRAND_SYMBOL;\n}\n\n/**\n * Create a new signal that is computed based on the values of other signals.\n *\n * The returned computed signal is read-only, and its value is automatically\n * updated when any signals accessed from within the callback function change.\n *\n * @param fn The effect callback.\n * @returns A new read-only signal.\n */\nfunction computed<T>(\n\tfn: () => T,\n\toptions?: SignalOptions<T>\n): ReadonlySignal<T> {\n\treturn new Computed(fn, options);\n}\n\n//#endregion Computed\n\n//#region Effect\n\nfunction cleanupEffect(effect: Effect) {\n\tconst cleanup = effect._cleanup;\n\teffect._cleanup = undefined;\n\n\tif (typeof cleanup === \"function\") {\n\t\t/*@__INLINE__**/ startBatch();\n\n\t\t// Run cleanup functions always outside of any context.\n\t\tconst prevContext = evalContext;\n\t\tevalContext = undefined;\n\t\ttry {\n\t\t\tcleanup();\n\t\t} catch (err) {\n\t\t\teffect._flags &= ~RUNNING;\n\t\t\teffect._flags |= DISPOSED;\n\t\t\tdisposeEffect(effect);\n\t\t\tthrow err;\n\t\t} finally {\n\t\t\tevalContext = prevContext;\n\t\t\tendBatch();\n\t\t}\n\t}\n}\n\nfunction disposeEffect(effect: Effect) {\n\tfor (\n\t\tlet node = effect._sources;\n\t\tnode !== undefined;\n\t\tnode = node._nextSource\n\t) {\n\t\tnode._source._unsubscribe(node);\n\t}\n\teffect._fn = undefined;\n\teffect._sources = undefined;\n\n\tcleanupEffect(effect);\n}\n\nfunction endEffect(this: Effect, prevContext?: Computed | Effect) {\n\tif (evalContext !== this) {\n\t\tthrow new Error(\"Out-of-order effect\");\n\t}\n\tcleanupSources(this);\n\tevalContext = prevContext;\n\n\tthis._flags &= ~RUNNING;\n\tif (this._flags & DISPOSED) {\n\t\tdisposeEffect(this);\n\t}\n\tendBatch();\n}\n\ntype EffectFn =\n\t| ((this: { dispose: () => void }) => void | (() => void))\n\t| (() => void | (() => void));\n\n// Avoid hard-requiring the ESNext.Disposable lib in consuming tsconfigs.\n// When `Symbol.dispose` is available, this becomes a symbol-keyed disposer type.\ntype DisposeSymbol = typeof Symbol extends { readonly dispose: infer TDispose }\n\t? TDispose\n\t: never;\ntype DisposableLike = {\n\t[K in DisposeSymbol & PropertyKey]: () => void;\n};\ntype DisposeFn = (() => void) & DisposableLike;\n\n/**\n * The base class for reactive effects.\n */\ndeclare class Effect {\n\t_fn?: EffectFn;\n\t_cleanup?: () => void;\n\t_sources?: Node;\n\t_nextBatchedEffect?: Effect;\n\t_flags: number;\n\t_debugCallback?: () => void;\n\tname?: string;\n\n\tconstructor(fn: EffectFn, options?: EffectOptions);\n\n\t_callback(): void;\n\t_start(): () => void;\n\t_notify(): void;\n\t_dispose(): void;\n\tdispose(): void;\n}\n\nexport interface EffectOptions {\n\tname?: string;\n}\n\nlet capturedEffects: Effect[] | undefined;\n\n/** @internal */\nfunction Effect(this: Effect, fn: EffectFn, options?: EffectOptions) {\n\tthis._fn = fn;\n\tthis._cleanup = undefined;\n\tthis._sources = undefined;\n\tthis._nextBatchedEffect = undefined;\n\tthis._flags = TRACKING;\n\tthis.name = options?.name;\n\n\tif (capturedEffects) {\n\t\tcapturedEffects.push(this);\n\t}\n}\n\nEffect.prototype._callback = function () {\n\tconst finish = this._start();\n\ttry {\n\t\tif (this._flags & DISPOSED) return;\n\t\tif (this._fn === undefined) return;\n\n\t\tconst cleanup = this._fn();\n\t\tif (typeof cleanup === \"function\") {\n\t\t\tthis._cleanup = cleanup;\n\t\t}\n\t} finally {\n\t\tfinish();\n\t}\n};\n\nEffect.prototype._start = function () {\n\tif (this._flags & RUNNING) {\n\t\tthrow new Error(\"Cycle detected\");\n\t}\n\tthis._flags |= RUNNING;\n\tthis._flags &= ~DISPOSED;\n\tcleanupEffect(this);\n\tprepareSources(this);\n\n\t/*@__INLINE__**/ startBatch();\n\tconst prevContext = evalContext;\n\tevalContext = this;\n\treturn endEffect.bind(this, prevContext);\n};\n\nEffect.prototype._notify = function () {\n\tif (!(this._flags & NOTIFIED)) {\n\t\tthis._flags |= NOTIFIED;\n\t\tthis._nextBatchedEffect = batchedEffect;\n\t\tbatchedEffect = this;\n\t}\n};\n\nEffect.prototype._dispose = function () {\n\tthis._flags |= DISPOSED;\n\n\tif (!(this._flags & RUNNING)) {\n\t\tdisposeEffect(this);\n\t}\n};\n\nEffect.prototype.dispose = function () {\n\tthis._dispose();\n};\n/**\n * Create an effect to run arbitrary code in response to signal changes.\n *\n * An effect tracks which signals are accessed within the given callback\n * function `fn`, and re-runs the callback when those signals change.\n *\n * The callback may return a cleanup function. The cleanup function gets\n * run once, either when the callback is next called or when the effect\n * gets disposed, whichever happens first.\n *\n * @param fn The effect callback.\n * @returns A function for disposing the effect.\n */\nfunction effect(fn: EffectFn, options?: EffectOptions): DisposeFn {\n\tconst effect = new Effect(fn, options);\n\ttry {\n\t\teffect._callback();\n\t} catch (err) {\n\t\teffect._dispose();\n\t\tthrow err;\n\t}\n\t// Return a bound function instead of a wrapper like `() => effect._dispose()`,\n\t// because bound functions seem to be just as fast and take up a lot less memory.\n\tconst dispose = effect._dispose.bind(effect);\n\t(dispose as any)[Symbol.dispose] = dispose;\n\treturn dispose as DisposeFn;\n}\n\n//#endregion Effect\n\n//#region Action\n\nfunction action<TArgs extends unknown[], TReturn>(\n\tfn: (...args: TArgs) => TReturn\n): (...args: TArgs) => TReturn {\n\treturn function actionWrapper(this: unknown, ...args: TArgs) {\n\t\treturn batch(() => untracked(() => fn.apply(this, args)));\n\t};\n}\n\n//#endregion Action\n\n//#region createModel\n\n/** Models should only contain signals, actions, and nested objects containing only signals and actions. */\ntype ValidateModel<TModel> = {\n\t[Key in keyof TModel]: TModel[Key] extends ReadonlySignal<unknown>\n\t\t? TModel[Key]\n\t\t: TModel[Key] extends (...args: any[]) => any\n\t\t\t? TModel[Key]\n\t\t\t: TModel[Key] extends object\n\t\t\t\t? ValidateModel<TModel[Key]>\n\t\t\t\t: `Property ${Key extends string ? `'${Key}' ` : \"\"}is not a Signal, Action, or an object that contains only Signals and Actions.`;\n};\n\nexport type Model<TModel> = ValidateModel<TModel> & DisposableLike;\n\nexport type ModelFactory<TModel, TFactoryArgs extends any[] = []> = (\n\t...args: TFactoryArgs\n) => ValidateModel<TModel>;\nexport type ModelConstructor<TModel, TFactoryArgs extends any[] = []> = new (\n\t...args: TFactoryArgs\n) => Model<TModel>;\n\n/**\n * The public types for ModelConstructor require using `new` to help\n * disambiguate the function passed into `createModel` and the returned\n * constructor function. It is easier to say that `createModel` accepts\n * a factory and returns a class, then to say it accepts a factory and\n * returns a factory. In other words, this example:\n *\n * ```ts\n * const PersonModel = createModel((name: string) => ({ ... }));\n * const person = new PersonModel(\"John\");\n * ```\n *\n * is easier to understand than this example:\n *\n * ```ts\n * const createPerson = createModel((name: string) => ({ ... }));\n * const person = createPerson(\"John\");\n * ```\n *\n * However, internally we implement `createModel` to return a function\n * that can be called without `new` for simplicity. To bridge the gap\n * between the public types and the internal implementation, we define\n * this internal interface that extends the public interface but also\n * allows calling without `new`.\n *\n * This pattern is used by the Preact & React adapters to make instantiating\n * a model or a function that returns a model easier.\n *\n * @internal\n */\ninterface InternalModelConstructor<\n\tTModel,\n\tTFactoryArgs extends any[],\n> extends ModelConstructor<TModel, TFactoryArgs> {\n\t(...args: TFactoryArgs): Model<TModel>;\n}\n\nfunction startCapturingEffects(): () => Effect[] | undefined {\n\tlet prevCapturedEffects = capturedEffects;\n\tcapturedEffects = [];\n\n\treturn function stopCapturingEffects() {\n\t\tlet modelEffects = capturedEffects;\n\t\tif (capturedEffects && prevCapturedEffects) {\n\t\t\tprevCapturedEffects = prevCapturedEffects.concat(capturedEffects);\n\t\t}\n\n\t\tcapturedEffects = prevCapturedEffects;\n\n\t\treturn modelEffects;\n\t};\n}\n\nconst wrapInAction = (value: Record<string, unknown>) => {\n\tfor (const key in value) {\n\t\tconst val = value[key];\n\t\tif (typeof val === \"function\") {\n\t\t\tvalue[key] = action(val as (...args: unknown[]) => unknown);\n\t\t} else if (typeof val === \"object\" && val !== null && !(\"brand\" in val)) {\n\t\t\t// Recursively wrap nested object properties in actions. This allows users to write\n\t\t\t// nested models without worrying about wrapping their functions in `action`.\n\t\t\twrapInAction(val as Record<string, unknown>);\n\t\t}\n\t}\n};\n\nfunction createModel<TModel, TFactoryArgs extends any[] = []>(\n\tmodelFactory: ModelFactory<TModel, TFactoryArgs>\n): ModelConstructor<TModel, TFactoryArgs> {\n\treturn function SignalModel(...args: TFactoryArgs): Model<TModel> {\n\t\tlet modelEffects: Effect[] | undefined;\n\t\tlet model: Model<TModel>;\n\n\t\tconst stopCapturingEffects = startCapturingEffects();\n\t\ttry {\n\t\t\tmodel = modelFactory(...args) as Model<TModel>;\n\t\t} catch (err) {\n\t\t\t// Drop any captured effects on error. Errors from nested models will bubble\n\t\t\t// up here and recursively reset `capturedEffects` to `undefined` preventing\n\t\t\t// any captured effects from leaking\n\t\t\tcapturedEffects = undefined;\n\t\t\tthrow err;\n\t\t} finally {\n\t\t\tmodelEffects = stopCapturingEffects();\n\t\t}\n\n\t\twrapInAction(model);\n\n\t\tmodel[Symbol.dispose] = action(function disposeModel() {\n\t\t\tif (modelEffects) {\n\t\t\t\tfor (let i = 0; i < modelEffects.length; i++) {\n\t\t\t\t\tmodelEffects[i].dispose();\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tmodelEffects = undefined;\n\t\t});\n\n\t\treturn model;\n\t} as InternalModelConstructor<TModel, TFactoryArgs>;\n}\n\n//#endregion createModel\n\nexport {\n\tcomputed,\n\teffect,\n\tbatch,\n\tuntracked,\n\taction,\n\tcreateModel,\n\tSignal,\n\tReadonlySignal,\n\tEffect,\n\tComputed,\n};\n"],"names":["g","f","exports","module","define","amd","globalThis","self","preactSignalsCore","this","BRAND_SYMBOL","Symbol","endBatch","batchDepth","error","hasError","snapshots","batchSnapshots","undefined","_source","_value","_version","_next","reconcileBatchSnapshots","batchedEffect","effect","batchIteration","next","_nextBatchedEffect","_flags","needsToRecompute","_callback","err","batch","fn","currentBatchSnapshotVersion","batchSnapshotVersion","evalContext","untracked","prevContext","capturedEffects","globalVersion","addDependency","signal","node","_node","_target","_prevSource","_sources","_nextSource","_prevTarget","_nextTarget","_rollbackNode","_subscribe","Signal","value","options","_targets","_batchSnapshotVersion","_watched","watched","_unwatched","unwatched","name","prototype","brand","_refresh","_this","targets","_this$_watched","call","_unsubscribe","_this2","prev","_this2$_unwatched","subscribe","_this3","valueOf","toString","toJSON","peek","Object","defineProperty","get","set","Error","source","recordBatchSnapshot","_notify","target","prepareSources","rollbackNode","cleanupSources","head","Computed","_fn","_globalVersion","OUTDATED","cleanupEffect","cleanup","_cleanup","disposeEffect","endEffect","Effect","push","finish","_start","bind","_dispose","dispose","action","_arguments","arguments","_this4","apply","slice","startCapturingEffects","prevCapturedEffects","modelEffects","concat","wrapInAction","key","val","computed","createModel","modelFactory","model","stopCapturingEffects","i","length"],"mappings":"CAEA,SAAAA,EAAAC,GAAA,iBAAAC,SAAA,oBAAAC,OAAAF,EAAAC,SAAA,mBAAAE,QAAAA,OAAAC,IAAAD,OAAA,CAAA,WAAAH,GAAAA,GAAAD,EAAA,oBAAAM,WAAAA,WAAAN,GAAAO,MAAAC,kBAAA,CAAA,EAAA,CAAA,CAAAC,KAAA,SAAAP,GAAA,IAAMQ,EAAeC,OAAU,IAAC,kBAsChC,SAASC,IACR,KAAIC,EAAa,GAAjB,CAKA,IAAIC,EACAC,GAAW,GAqHhB,WACC,IAAIC,EAAYC,EAChBA,OAAiBC,EAEjB,WAAqBA,IAAdF,EAAyB,CAC/B,GAAIA,EAAUG,EAAQC,IAAWJ,EAAUI,EAC1CJ,EAAUG,EAAQE,EAAWL,EAAUK,EAExCL,EAAYA,EAAUM,CACvB,CACD,CA9HCC,GAEA,WAAyBL,IAAlBM,EAA6B,CACnC,IAAIC,EAA6BD,EACjCA,OAAgBN,EAEhBQ,IAEA,WAAkBR,IAAXO,EAAsB,CAC5B,IAAME,EAA2BF,EAAOG,EACxCH,EAAOG,OAAqBV,EAC5BO,EAAOI,IAAU,EAEjB,KArDc,EAqDRJ,EAAOI,IAAsBC,EAAiBL,GACnD,IACCA,EAAOM,GAMR,CALE,MAAOC,GACR,IAAKjB,EAAU,CACdD,EAAQkB,EACRjB,GAAW,CACZ,CACD,CAEDU,EAASE,CACV,CACD,CACAD,EAAiB,EACjBb,IAEA,GAAIE,EACH,MAAMD,CAlCP,MAFCD,GAsCF,CAcA,SAASoB,EAASC,GACjB,GAAIrB,EAAa,EAChB,OAAOqB,IAERC,IAAgCC,EA7DhCvB,IA+DA,IACC,OAAOqB,GAGR,CAFC,QACAtB,GACD,CACD,CAGA,IAAIyB,OAA6CnB,EASjD,SAASoB,EAAaJ,GACrB,IAAMK,EAAcF,EACpBA,OAAcnB,EACd,IACC,OAAOgB,GAGR,CAFC,QACAG,EAAcE,CACf,CACD,CAGA,IA4uBIC,EA5uBAhB,OAAoCN,EACpCL,EAAa,EACba,EAAiB,EASjBU,EAAuB,EACvBD,EAA8B,EAC9BlB,OAA4CC,EAI5CuB,EAAgB,EA+BpB,SAASC,EAAcC,GACtB,QAAoBzB,IAAhBmB,EAAJ,CAIA,IAAIO,EAAOD,EAAOE,EAClB,QAAa3B,IAAT0B,GAAsBA,EAAKE,IAAYT,EAAa,CAavDO,EAAO,CACNvB,EAAU,EACVF,EAASwB,EACTI,EAAaV,EAAYW,EACzBC,OAAa/B,EACb4B,EAAST,EACTa,OAAahC,EACbiC,OAAajC,EACbkC,EAAeR,GAGhB,QAA6B1B,IAAzBmB,EAAYW,EACfX,EAAYW,EAASC,EAAcL,EAEpCP,EAAYW,EAAWJ,EACvBD,EAAOE,EAAQD,EAIf,GA5Me,GA4MXP,EAAYR,EACfc,EAAOU,EAAWT,GAEnB,OAAOA,CACR,MAAWA,IAAmB,IAAnBA,EAAKvB,EAAiB,CAEhCuB,EAAKvB,EAAW,EAehB,QAAyBH,IAArB0B,EAAKK,EAA2B,CACnCL,EAAKK,EAAYF,EAAcH,EAAKG,EAEpC,QAAyB7B,IAArB0B,EAAKG,EACRH,EAAKG,EAAYE,EAAcL,EAAKK,EAGrCL,EAAKG,EAAcV,EAAYW,EAC/BJ,EAAKK,OAAc/B,EAEnBmB,EAAYW,EAAUC,EAAcL,EACpCP,EAAYW,EAAWJ,CACxB,CAIA,OAAOA,CACR,CAzEA,CA2ED,CAkFA,SAASU,EAAqBC,EAAiBC,GAC9C/C,KAAKW,EAASmC,EACd9C,KAAKY,EAAW,EAChBZ,KAAKoC,OAAQ3B,EACbT,KAAKgD,OAAWvC,EAChBT,KAAKiD,EAAwB,EAC7BjD,KAAKkD,QAAWH,SAAAA,EAASI,QACzBnD,KAAKoD,EAAoB,MAAPL,OAAO,EAAPA,EAASM,UAC3BrD,KAAKsD,WAAOP,SAAAA,EAASO,IACtB,CAEAT,EAAOU,UAAUC,MAAQvD,EAEzB4C,EAAOU,UAAUE,EAAW,WAC3B,OACD,CAAA,EAEAZ,EAAOU,UAAUX,EAAa,SAAUT,GAAI,IAAAuB,EAC3C1D,KAAM2D,EAAU3D,KAAKgD,EACrB,GAAIW,IAAYxB,QAA6B1B,IAArB0B,EAAKM,EAA2B,CACvDN,EAAKO,EAAciB,EACnB3D,KAAKgD,EAAWb,EAEhB,QAAgB1B,IAAZkD,EACHA,EAAQlB,EAAcN,OAEtBN,EAAU,WAAK,IAAA+B,EACD,OAAbA,EAAAF,EAAKR,IAALU,EAAeC,KAAKH,EACrB,EAEF,CACD,EAEAb,EAAOU,UAAUO,EAAe,SAAU3B,OAAI4B,EAAA/D,KAE7C,QAAsBS,IAAlBT,KAAKgD,EAAwB,CAChC,IAAMgB,EAAO7B,EAAKM,EACZvB,EAAOiB,EAAKO,EAClB,QAAajC,IAATuD,EAAoB,CACvBA,EAAKtB,EAAcxB,EACnBiB,EAAKM,OAAchC,CACpB,CAEA,QAAaA,IAATS,EAAoB,CACvBA,EAAKuB,EAAcuB,EACnB7B,EAAKO,OAAcjC,CACpB,CAEA,GAAI0B,IAASnC,KAAKgD,EAAU,CAC3BhD,KAAKgD,EAAW9B,EAChB,QAAaT,IAATS,EACHW,EAAU,WAAK,IAAAoC,EACC,OAAfA,EAAAF,EAAKX,IAALa,EAAiBJ,KAAKE,EACvB,EAEF,CACD,CACD,EAEAlB,EAAOU,UAAUW,UAAY,SAAUzC,GAAE,IAAA0C,EACxCnE,KAAA,OAAOgB,EACN,WACC,IAAM8B,EAAQqB,EAAKrB,MACbhB,EAAcF,EACpBA,OAAcnB,EACd,IACCgB,EAAGqB,EAGJ,CAFC,QACAlB,EAAcE,CACf,CACD,EACA,CAAEwB,KAAM,OAEV,EAEAT,EAAOU,UAAUa,QAAU,WAC1B,YAAYtB,KACb,EAEAD,EAAOU,UAAUc,SAAW,WAC3B,OAAOrE,KAAK8C,MAAQ,EACrB,EAEAD,EAAOU,UAAUe,OAAS,WACzB,OAAWtE,KAAC8C,KACb,EAEAD,EAAOU,UAAUgB,KAAO,WACvB,IAAMzC,EAAcF,EACpBA,OAAcnB,EACd,IACC,YAAYqC,KAGb,CAFC,QACAlB,EAAcE,CACf,CACD,EAEA0C,OAAOC,eAAe5B,EAAOU,UAAW,QAAS,CAChDmB,IAAA,WACC,IAAMvC,EAAOF,EAAcjC,MAC3B,QAAaS,IAAT0B,EACHA,EAAKvB,EAAWZ,KAAKY,EAEtB,OAAOZ,KAAKW,CACb,EACAgE,IAAG,SAAe7B,GACjB,GAAIA,IAAU9C,KAAKW,EAAQ,CAC1B,GAAIM,EAAiB,IACpB,MAAU,IAAA2D,MAAM,mBAzSpB,SAA6BC,GAE5B,GAAmB,IAAfzE,GAAuC,IAAnBa,EAIxB,GAAI4D,EAAO5B,IAA0BvB,EAA6B,CACjEmD,EAAO5B,EAAwBvB,EAC/BlB,EAAiB,CAChBE,EAASmE,EACTlE,EAAQkE,EAAOlE,EACfC,EAAUiE,EAAOjE,EACjBC,EAAOL,EAET,CACD,CA6RGsE,CAAoB9E,MACpBA,KAAKW,EAASmC,EACd9C,KAAKY,IACLoB,IA7ZF5B,IAgaE,IACC,IACC,IAAI+B,EAAOnC,KAAKgD,OACPvC,IAAT0B,EACAA,EAAOA,EAAKO,EAEZP,EAAKE,EAAQ0C,GAIf,CAFC,QACA5E,GACD,CACD,CACD,IAmBD,SAASkB,EAAiB2D,GAIzB,IACC,IAAI7C,EAAO6C,EAAOzC,OACT9B,IAAT0B,EACAA,EAAOA,EAAKK,EAEZ,GAKCL,EAAKzB,EAAQE,IAAauB,EAAKvB,IAG9BuB,EAAKzB,EAAQ+C,KAEdtB,EAAKzB,EAAQE,IAAauB,EAAKvB,EAE/B,OACD,EAID,OAAO,CACR,CAEA,SAASqE,EAAeD,GAavB,IACC,IAAI7C,EAAO6C,EAAOzC,OACT9B,IAAT0B,EACAA,EAAOA,EAAKK,EACX,CACD,IAAM0C,EAAe/C,EAAKzB,EAAQ0B,EAClC,QAAqB3B,IAAjByE,EACH/C,EAAKQ,EAAgBuC,EAEtB/C,EAAKzB,EAAQ0B,EAAQD,EACrBA,EAAKvB,GAAY,EAEjB,QAAyBH,IAArB0B,EAAKK,EAA2B,CACnCwC,EAAOzC,EAAWJ,EAClB,KACD,CACD,CACD,CAEA,SAASgD,EAAeH,GACvB,IAAI7C,EAAO6C,EAAOzC,EACd6C,OAAyB3E,EAO7B,WAAgBA,IAAT0B,EAAoB,CAC1B,IAAM6B,EAAO7B,EAAKG,EAUlB,IAAuB,IAAnBH,EAAKvB,EAAiB,CACzBuB,EAAKzB,EAAQoD,EAAa3B,GAE1B,QAAa1B,IAATuD,EACHA,EAAKxB,EAAcL,EAAKK,EAEzB,QAAyB/B,IAArB0B,EAAKK,EACRL,EAAKK,EAAYF,EAAc0B,CAEjC,MAWCoB,EAAOjD,EAGRA,EAAKzB,EAAQ0B,EAAQD,EAAKQ,EAC1B,QAA2BlC,IAAvB0B,EAAKQ,EACRR,EAAKQ,OAAgBlC,EAGtB0B,EAAO6B,CACR,CAEAgB,EAAOzC,EAAW6C,CACnB,CAkBA,SAASC,EAAyB5D,EAAmBsB,GACpDF,EAAOgB,KAAK7D,UAAMS,GAElBT,KAAKsF,EAAM7D,EACXzB,KAAKuC,OAAW9B,EAChBT,KAAKuF,EAAiBvD,EAAgB,EACtChC,KAAKoB,EAtmBW,EAumBhBpB,KAAKkD,QAAWH,SAAAA,EAASI,QACzBnD,KAAKoD,EAAaL,MAAAA,OAAAA,EAAAA,EAASM,UAC3BrD,KAAKsD,KAAc,MAAPP,OAAO,EAAPA,EAASO,IACtB,CAEA+B,EAAS9B,UAAY,IAAIV,EAEzBwC,EAAS9B,UAAUE,EAAW,WAC7BzD,KAAKoB,IAAU,EAEf,GAnnBe,EAmnBXpB,KAAKoB,EACR,OAAO,EAMR,GArnBgB,QAqnBXpB,KAAKoB,GACT,OAAO,EAERpB,KAAKoB,IAAU,EAEf,GAAIpB,KAAKuF,IAAmBvD,EAC3B,OAAO,EAERhC,KAAKuF,EAAiBvD,EAItBhC,KAAKoB,GAtoBU,EAuoBf,GAAIpB,KAAKY,EAAW,IAAMS,EAAiBrB,MAAO,CACjDA,KAAKoB,IAAU,EACf,QACD,CAEA,IAAMU,EAAcF,EACpB,IACCqD,EAAejF,MACf4B,EAAc5B,KACd,IAAM8C,EAAQ9C,KAAKsF,IACnB,GA7oBgB,GA8oBftF,KAAKoB,GACLpB,KAAKW,IAAWmC,GACE,IAAlB9C,KAAKY,EACJ,CACDZ,KAAKW,EAASmC,EACd9C,KAAKoB,IAAU,GACfpB,KAAKY,GACN,CAKD,CAJE,MAAOW,GACRvB,KAAKW,EAASY,EACdvB,KAAKoB,GAxpBW,GAypBhBpB,KAAKY,GACN,CACAgB,EAAcE,EACdqD,EAAenF,MACfA,KAAKoB,IAAU,EACf,OACD,CAAA,EAEAiE,EAAS9B,UAAUX,EAAa,SAAUT,GACzC,QAAsB1B,IAAlBT,KAAKgD,EAAwB,CAChChD,KAAKoB,GAAUoE,GAIf,IACC,IAAIrD,EAAOnC,KAAKuC,OACP9B,IAAT0B,EACAA,EAAOA,EAAKK,EAEZL,EAAKzB,EAAQkC,EAAWT,EAE1B,CACAU,EAAOU,UAAUX,EAAWiB,KAAK7D,KAAMmC,EACxC,EAEAkD,EAAS9B,UAAUO,EAAe,SAAU3B,GAE3C,QAAsB1B,IAAlBT,KAAKgD,EAAwB,CAChCH,EAAOU,UAAUO,EAAaD,KAAK7D,KAAMmC,GAIzC,QAAsB1B,IAAlBT,KAAKgD,EAAwB,CAChChD,KAAKoB,IAAU,GAEf,IACC,IAAIe,EAAOnC,KAAKuC,OACP9B,IAAT0B,EACAA,EAAOA,EAAKK,EAEZL,EAAKzB,EAAQoD,EAAa3B,EAE5B,CACD,CACD,EAEAkD,EAAS9B,UAAUwB,EAAU,WAC5B,KA3sBgB,EA2sBV/E,KAAKoB,GAAoB,CAC9BpB,KAAKoB,GAAUoE,EAEf,IACC,IAAIrD,EAAOnC,KAAKgD,OACPvC,IAAT0B,EACAA,EAAOA,EAAKO,EAEZP,EAAKE,EAAQ0C,GAEf,CACD,EAEAP,OAAOC,eAAeY,EAAS9B,UAAW,QAAS,CAClDmB,IAAA,WACC,GA3tBc,EA2tBV1E,KAAKoB,EACR,MAAU,IAAAwD,MAAM,kBAEjB,IAAMzC,EAAOF,EAAcjC,MAC3BA,KAAKyD,IACL,QAAahD,IAAT0B,EACHA,EAAKvB,EAAWZ,KAAKY,EAEtB,GA/tBgB,GA+tBZZ,KAAKoB,EACR,WAAWT,EAEZ,OAAOX,KAAKW,CACb,IAqCD,SAAS8E,EAAczE,GACtB,IAAM0E,EAAU1E,EAAO2E,EACvB3E,EAAO2E,OAAWlF,EAElB,GAAuB,mBAAZiF,EAAwB,CAhvBnCtF,IAovBC,IAAM0B,EAAcF,EACpBA,OAAcnB,EACd,IACCiF,GASD,CARE,MAAOnE,GACRP,EAAOI,IAAU,EACjBJ,EAAOI,GAvxBO,EAwxBdwE,EAAc5E,GACd,MAAMO,CACP,CAAC,QACAK,EAAcE,EACd3B,GACD,CACD,CACD,CAEA,SAASyF,EAAc5E,GACtB,IACC,IAAImB,EAAOnB,EAAOuB,OACT9B,IAAT0B,EACAA,EAAOA,EAAKK,EAEZL,EAAKzB,EAAQoD,EAAa3B,GAE3BnB,EAAOsE,OAAM7E,EACbO,EAAOuB,OAAW9B,EAElBgF,EAAczE,EACf,CAEA,SAAS6E,EAAwB/D,GAChC,GAAIF,IAAgB5B,KACnB,MAAM,IAAI4E,MAAM,uBAEjBO,EAAenF,MACf4B,EAAcE,EAEd9B,KAAKoB,IAAU,EACf,GAvzBgB,EAuzBZpB,KAAKoB,EACRwE,EAAc5F,MAEfG,GACD,CA4CA,SAAS2F,EAAqBrE,EAAcsB,GAC3C/C,KAAKsF,EAAM7D,EACXzB,KAAK2F,OAAWlF,EAChBT,KAAKuC,OAAW9B,EAChBT,KAAKmB,OAAqBV,EAC1BT,KAAKoB,EA12BW,GA22BhBpB,KAAKsD,KAAc,MAAPP,OAAO,EAAPA,EAASO,KAErB,GAAIvB,EACHA,EAAgBgE,KAAK/F,KAEvB,CAEA8F,EAAOvC,UAAUjC,EAAY,WAC5B,IAAM0E,EAAShG,KAAKiG,IACpB,IACC,GAv3Be,EAu3BXjG,KAAKoB,EAAmB,OAC5B,QAAiBX,IAAbT,KAAKsF,EAAmB,OAE5B,IAAMI,EAAU1F,KAAKsF,IACrB,GAAuB,mBAAZI,EACV1F,KAAK2F,EAAWD,CAIlB,CAFC,QACAM,GACD,CACD,EAEAF,EAAOvC,UAAU0C,EAAS,WACzB,GAv4Be,EAu4BXjG,KAAKoB,EACR,MAAU,IAAAwD,MAAM,kBAEjB5E,KAAKoB,GA14BU,EA24BfpB,KAAKoB,IAAU,EACfqE,EAAczF,MACdiF,EAAejF,MA72BfI,IAg3BA,IAAM0B,EAAcF,EACpBA,EAAc5B,KACd,OAAO6F,EAAUK,KAAKlG,KAAM8B,EAC7B,EAEAgE,EAAOvC,UAAUwB,EAAU,WAC1B,KAr5BgB,EAq5BV/E,KAAKoB,GAAoB,CAC9BpB,KAAKoB,GAt5BU,EAu5BfpB,KAAKmB,EAAqBJ,EAC1BA,EAAgBf,IACjB,CACD,EAEA8F,EAAOvC,UAAU4C,EAAW,WAC3BnG,KAAKoB,GA35BW,EA65BhB,KAh6Be,EAg6BTpB,KAAKoB,GACVwE,EAAc5F,KAEhB,EAEA8F,EAAOvC,UAAU6C,QAAU,WAC1BpG,KAAKmG,GACN,EAcA,SAASnF,EAAOS,EAAcsB,GAC7B,IAAM/B,EAAS,IAAI8E,EAAOrE,EAAIsB,GAC9B,IACC/B,EAAOM,GAIR,CAHE,MAAOC,GACRP,EAAOmF,IACP,MAAM5E,CACP,CAGA,IAAM6E,EAAUpF,EAAOmF,EAASD,KAAKlF,GACpCoF,EAAgBlG,OAAOkG,SAAWA,EACnC,OAAOA,CACR,CAMA,SAASC,EACR5E,GAEA,OAAO,WAAoD6E,IAAAA,EAAAC,UAAAC,EAC1DxG,KAAA,OAAOwB,EAAM,kBAAMK,EAAU,WAAM,OAAAJ,EAAGgF,MAAMD,EAAI,GAAAE,MAAA7C,KAAAyC,GAAO,EAAC,EACzD,CACD,CA+DA,SAASK,IACR,IAAIC,EAAsB7E,EAC1BA,EAAkB,GAElB,OAAO,WACN,IAAI8E,EAAe9E,EACnB,GAAIA,GAAmB6E,EACtBA,EAAsBA,EAAoBE,OAAO/E,GAGlDA,EAAkB6E,EAElB,OAAOC,CACR,CACD,CAEA,IAAME,EAAe,SAACjE,GACrB,IAAK,IAAMkE,KAAOlE,EAAO,CACxB,IAAMmE,EAAMnE,EAAMkE,GAClB,GAAmB,mBAARC,EACVnE,EAAMkE,GAAOX,EAAOY,QACd,GAAmB,iBAARA,GAA4B,OAARA,KAAkB,UAAWA,GAGlEF,EAAaE,EAEf,CACD,EAoCAxH,EAAA4F,SAAAA,EAAA5F,EAAAqG,OAAAA,EAAArG,EAAAoD,OAAAA,EAAApD,EAAA4G,OAAAA,EAAA5G,EAAA+B,MAAAA,EAAA/B,EAAAyH,SA3UA,SACCzF,EACAsB,GAEA,OAAO,IAAIsC,EAAS5D,EAAIsB,EACzB,EAsUAtD,EAAA0H,YAlCA,SACCC,GAEA,kBACC,IAAIP,EACAQ,EAEEC,EAAuBX,IAC7B,IACCU,EAAQD,EAAYX,WAAA,EAAA,GAAAC,MAAA7C,KAAA0C,WASrB,CARE,MAAOhF,GAIRQ,OAAkBtB,EAClB,MAAMc,CACP,CAAC,QACAsF,EAAeS,GAChB,CAEAP,EAAaM,GAEbA,EAAMnH,OAAOkG,SAAWC,EAAO,WAC9B,GAAIQ,EACH,IAAK,IAAIU,EAAI,EAAGA,EAAIV,EAAaW,OAAQD,IACxCV,EAAaU,GAAGnB,UAIlBS,OAAepG,CAChB,GAEA,OAAO4G,CACR,CACD,EAAA5H,EAAAuB,OAAAA,EAAAvB,EAAAyC,OArnBgB,SAAUY,EAAWC,GACpC,WAAWF,EAAOC,EAAOC,EAC1B,EAmnBAtD,EAAAoC,UAAAA,CAAA"}