@opentf/web 0.1.0 → 0.2.0

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

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

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

@@ -0,0 +1 @@
+{"version":3,"file":"signals-core.mjs","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","for","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","targets","_this$_watched","call","_unsubscribe","prev","_this$_unwatched","subscribe","valueOf","toString","toJSON","peek","Object","defineProperty","get","set","Error","source","recordBatchSnapshot","_notify","target","prepareSources","rollbackNode","cleanupSources","head","Computed","_fn","_globalVersion","OUTDATED","computed","cleanupEffect","cleanup","_cleanup","disposeEffect","endEffect","Effect","push","finish","_start","bind","_dispose","dispose","action","args","apply","wrapInAction","key","val","createModel","modelFactory","modelEffects","model","stopCapturingEffects","prevCapturedEffects","concat","startCapturingEffects","i","length"],"mappings":"AAEA,MAAMA,EAAeC,OAAOC,IAAI,kBAsChC,SAASC,IACR,GAAIC,EAAa,EAAG,CACnBA,IACA,MACD,CAEA,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,MAAME,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,CAER,CAcA,SAASmB,EAASC,GACjB,GAAIrB,EAAa,EAChB,OAAOqB,IAERC,IAAgCC,EA7DhCvB,IA+DA,IACC,OAAOqB,GAGR,CAFC,QACAtB,GACD,CACD,CAGA,IAAIyB,EAoBAb,EAXJ,SAASc,EAAaJ,GACrB,MAAMK,EAAcF,EACpBA,OAAcnB,EACd,IACC,OAAOgB,GAGR,CAFC,QACAG,EAAcE,CACf,CACD,CAIA,IAYItB,EA+tBAuB,EA3uBA3B,EAAa,EACba,EAAiB,EASjBU,EAAuB,EACvBD,EAA8B,EAK9BM,EAAgB,EA+BpB,SAASC,EAAcC,GACtB,QAAoBzB,IAAhBmB,EACH,OAGD,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,MAAO,IAAuB,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,CAED,CAkFA,SAASU,EAAqBC,EAAiBC,GAC9CC,KAAKrC,EAASmC,EACdE,KAAKpC,EAAW,EAChBoC,KAAKZ,OAAQ3B,EACbuC,KAAKC,OAAWxC,EAChBuC,KAAKE,EAAwB,EAC7BF,KAAKG,EAAWJ,MAAAA,OAAAA,EAAAA,EAASK,QACzBJ,KAAKK,EAAoB,MAAPN,OAAO,EAAPA,EAASO,UAC3BN,KAAKO,WAAOR,SAAAA,EAASQ,IACtB,CAEAV,EAAOW,UAAUC,MAAQzD,EAEzB6C,EAAOW,UAAUE,EAAW,WAC3B,OAAO,CACR,EAEAb,EAAOW,UAAUZ,EAAa,SAAUT,GACvC,MAAMwB,EAAUX,KAAKC,EACrB,GAAIU,IAAYxB,QAA6B1B,IAArB0B,EAAKM,EAA2B,CACvDN,EAAKO,EAAciB,EACnBX,KAAKC,EAAWd,EAEhB,QAAgB1B,IAAZkD,EACHA,EAAQlB,EAAcN,OAEtBN,EAAU,SAAK+B,SACdA,EAAAZ,KAAKG,IAALS,EAAeC,KAAKb,KACrB,EAEF,CACD,EAEAH,EAAOW,UAAUM,EAAe,SAAU3B,GAEzC,QAAsB1B,IAAlBuC,KAAKC,EAAwB,CAChC,MAAMc,EAAO5B,EAAKM,EACZvB,EAAOiB,EAAKO,EAClB,QAAajC,IAATsD,EAAoB,CACvBA,EAAKrB,EAAcxB,EACnBiB,EAAKM,OAAchC,CACpB,CAEA,QAAaA,IAATS,EAAoB,CACvBA,EAAKuB,EAAcsB,EACnB5B,EAAKO,OAAcjC,CACpB,CAEA,GAAI0B,IAASa,KAAKC,EAAU,CAC3BD,KAAKC,EAAW/B,EAChB,QAAaT,IAATS,EACHW,EAAU,KAAK,IAAAmC,EACC,OAAfA,EAAIhB,KAACK,IAALW,EAAiBH,KAAKb,KACvB,EAEF,CACD,CACD,EAEAH,EAAOW,UAAUS,UAAY,SAAUxC,GACtC,OAAOT,EACN,KACC,MAAM8B,EAAQE,KAAKF,MACbhB,EAAcF,EACpBA,OAAcnB,EACd,IACCgB,EAAGqB,EAGJ,CAFC,QACAlB,EAAcE,CACf,GAED,CAAEyB,KAAM,OAEV,EAEAV,EAAOW,UAAUU,QAAU,WAC1B,OAAWlB,KAACF,KACb,EAEAD,EAAOW,UAAUW,SAAW,WAC3B,OAAWnB,KAACF,MAAQ,EACrB,EAEAD,EAAOW,UAAUY,OAAS,WACzB,OAAOpB,KAAKF,KACb,EAEAD,EAAOW,UAAUa,KAAO,WACvB,MAAMvC,EAAcF,EACpBA,OAAcnB,EACd,IACC,OAAOuC,KAAKF,KAGb,CAFC,QACAlB,EAAcE,CACf,CACD,EAEAwC,OAAOC,eAAe1B,EAAOW,UAAW,QAAS,CAChDgB,MACC,MAAMrC,EAAOF,EAAce,MAC3B,QAAavC,IAAT0B,EACHA,EAAKvB,EAAWoC,KAAKpC,EAEtB,OAAOoC,KAAKrC,CACb,EACA8D,IAAkB3B,GACjB,GAAIA,IAAUE,KAAKrC,EAAQ,CAC1B,GAAIM,EAAiB,IACpB,MAAU,IAAAyD,MAAM,mBAzSpB,SAA6BC,GAE5B,GAAmB,IAAfvE,GAAuC,IAAnBa,EAIxB,GAAI0D,EAAOzB,IAA0BxB,EAA6B,CACjEiD,EAAOzB,EAAwBxB,EAC/BlB,EAAiB,CAChBE,EAASiE,EACThE,EAAQgE,EAAOhE,EACfC,EAAU+D,EAAO/D,EACjBC,EAAOL,EAET,CACD,CA6RGoE,CAAoB5B,MACpBA,KAAKrC,EAASmC,EACdE,KAAKpC,IACLoB,IA7ZF5B,IAgaE,IACC,IACC,IAAI+B,EAAOa,KAAKC,OACPxC,IAAT0B,EACAA,EAAOA,EAAKO,EAEZP,EAAKE,EAAQwC,GAIf,CAFC,QACA1E,GACD,CACD,CACD,aAWe+B,EAAUY,EAAWC,GACpC,OAAW,IAAAF,EAAOC,EAAOC,EAC1B,CAMA,SAAS1B,EAAiByD,GAIzB,IACC,IAAI3C,EAAO2C,EAAOvC,OACT9B,IAAT0B,EACAA,EAAOA,EAAKK,EAEZ,GAKCL,EAAKzB,EAAQE,IAAauB,EAAKvB,IAG9BuB,EAAKzB,EAAQgD,KAEdvB,EAAKzB,EAAQE,IAAauB,EAAKvB,EAE/B,SAKF,OAAO,CACR,CAEA,SAASmE,EAAeD,GAavB,IACC,IAAI3C,EAAO2C,EAAOvC,OACT9B,IAAT0B,EACAA,EAAOA,EAAKK,EACX,CACD,MAAMwC,EAAe7C,EAAKzB,EAAQ0B,EAClC,QAAqB3B,IAAjBuE,EACH7C,EAAKQ,EAAgBqC,EAEtB7C,EAAKzB,EAAQ0B,EAAQD,EACrBA,EAAKvB,GAAY,EAEjB,QAAyBH,IAArB0B,EAAKK,EAA2B,CACnCsC,EAAOvC,EAAWJ,EAClB,KACD,CACD,CACD,CAEA,SAAS8C,EAAeH,GACvB,IACII,EADA/C,EAAO2C,EAAOvC,EAQlB,WAAgB9B,IAAT0B,EAAoB,CAC1B,MAAM4B,EAAO5B,EAAKG,EAUlB,IAAuB,IAAnBH,EAAKvB,EAAiB,CACzBuB,EAAKzB,EAAQoD,EAAa3B,GAE1B,QAAa1B,IAATsD,EACHA,EAAKvB,EAAcL,EAAKK,EAEzB,QAAyB/B,IAArB0B,EAAKK,EACRL,EAAKK,EAAYF,EAAcyB,CAEjC,MAWCmB,EAAO/C,EAGRA,EAAKzB,EAAQ0B,EAAQD,EAAKQ,EAC1B,QAA2BlC,IAAvB0B,EAAKQ,EACRR,EAAKQ,OAAgBlC,EAGtB0B,EAAO4B,CACR,CAEAe,EAAOvC,EAAW2C,CACnB,CAkBA,SAASC,EAAyB1D,EAAmBsB,GACpDF,EAAOgB,KAAKb,UAAMvC,GAElBuC,KAAKoC,EAAM3D,EACXuB,KAAKT,OAAW9B,EAChBuC,KAAKqC,EAAiBrD,EAAgB,EACtCgB,KAAK5B,EAtmBW,EAumBhB4B,KAAKG,EAAkB,MAAPJ,OAAO,EAAPA,EAASK,QACzBJ,KAAKK,QAAaN,SAAAA,EAASO,UAC3BN,KAAKO,KAAc,MAAPR,OAAO,EAAPA,EAASQ,IACtB,CAEA4B,EAAS3B,UAAY,IAAIX,EAEzBsC,EAAS3B,UAAUE,EAAW,WAC7BV,KAAK5B,IAAU,EAEf,GAnnBe,EAmnBX4B,KAAK5B,EACR,OACD,EAKA,GArnBgB,KAqnBA,GAAX4B,KAAK5B,GACT,OACD,EACA4B,KAAK5B,IAAU,EAEf,GAAI4B,KAAKqC,IAAmBrD,EAC3B,OAAO,EAERgB,KAAKqC,EAAiBrD,EAItBgB,KAAK5B,GAtoBU,EAuoBf,GAAI4B,KAAKpC,EAAW,IAAMS,EAAiB2B,MAAO,CACjDA,KAAK5B,IAAU,EACf,QACD,CAEA,MAAMU,EAAcF,EACpB,IACCmD,EAAe/B,MACfpB,EAAcoB,KACd,MAAMF,EAAQE,KAAKoC,IACnB,GA7oBgB,GA8oBfpC,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,EACdmD,EAAejC,MACfA,KAAK5B,IAAU,EACf,QACD,EAEA+D,EAAS3B,UAAUZ,EAAa,SAAUT,GACzC,QAAsB1B,IAAlBuC,KAAKC,EAAwB,CAChCD,KAAK5B,GAAUkE,GAIf,IACC,IAAInD,EAAOa,KAAKT,OACP9B,IAAT0B,EACAA,EAAOA,EAAKK,EAEZL,EAAKzB,EAAQkC,EAAWT,EAE1B,CACAU,EAAOW,UAAUZ,EAAWiB,KAAKb,KAAMb,EACxC,EAEAgD,EAAS3B,UAAUM,EAAe,SAAU3B,GAE3C,QAAsB1B,IAAlBuC,KAAKC,EAAwB,CAChCJ,EAAOW,UAAUM,EAAaD,KAAKb,KAAMb,GAIzC,QAAsB1B,IAAlBuC,KAAKC,EAAwB,CAChCD,KAAK5B,IAAU,GAEf,IACC,IAAIe,EAAOa,KAAKT,OACP9B,IAAT0B,EACAA,EAAOA,EAAKK,EAEZL,EAAKzB,EAAQoD,EAAa3B,EAE5B,CACD,CACD,EAEAgD,EAAS3B,UAAUqB,EAAU,WAC5B,KA3sBgB,EA2sBV7B,KAAK5B,GAAoB,CAC9B4B,KAAK5B,GAAUkE,EAEf,IACC,IAAInD,EAAOa,KAAKC,OACPxC,IAAT0B,EACAA,EAAOA,EAAKO,EAEZP,EAAKE,EAAQwC,GAEf,CACD,EAEAP,OAAOC,eAAeY,EAAS3B,UAAW,QAAS,CAClDgB,MACC,GA3tBc,EA2tBVxB,KAAK5B,EACR,UAAUsD,MAAM,kBAEjB,MAAMvC,EAAOF,EAAce,MAC3BA,KAAKU,IACL,QAAajD,IAAT0B,EACHA,EAAKvB,EAAWoC,KAAKpC,EAEtB,GA/tBgB,GA+tBZoC,KAAK5B,EACR,MAAM4B,KAAKrC,EAEZ,OAAWqC,KAACrC,CACb,IA0BD,SAAS4E,EACR9D,EACAsB,GAEA,OAAW,IAAAoC,EAAS1D,EAAIsB,EACzB,CAMA,SAASyC,EAAcxE,GACtB,MAAMyE,EAAUzE,EAAO0E,EACvB1E,EAAO0E,OAAWjF,EAElB,GAAuB,mBAAZgF,EAAwB,CAhvBnCrF,IAovBC,MAAM0B,EAAcF,EACpBA,OAAcnB,EACd,IACCgF,GASD,CARE,MAAOlE,GACRP,EAAOI,IAAU,EACjBJ,EAAOI,GAvxBO,EAwxBduE,EAAc3E,GACd,MAAMO,CACP,CAAC,QACAK,EAAcE,EACd3B,GACD,CACD,CACD,CAEA,SAASwF,EAAc3E,GACtB,IACC,IAAImB,EAAOnB,EAAOuB,OACT9B,IAAT0B,EACAA,EAAOA,EAAKK,EAEZL,EAAKzB,EAAQoD,EAAa3B,GAE3BnB,EAAOoE,OAAM3E,EACbO,EAAOuB,OAAW9B,EAElB+E,EAAcxE,EACf,CAEA,SAAS4E,EAAwB9D,GAChC,GAAIF,IAAgBoB,KACnB,UAAU0B,MAAM,uBAEjBO,EAAejC,MACfpB,EAAcE,EAEdkB,KAAK5B,IAAU,EACf,GAvzBgB,EAuzBZ4B,KAAK5B,EACRuE,EAAc3C,MAEf7C,GACD,CA4CA,SAAS0F,EAAqBpE,EAAcsB,GAC3CC,KAAKoC,EAAM3D,EACXuB,KAAK0C,OAAWjF,EAChBuC,KAAKT,OAAW9B,EAChBuC,KAAK7B,OAAqBV,EAC1BuC,KAAK5B,EA12BW,GA22BhB4B,KAAKO,KAAc,MAAPR,OAAO,EAAPA,EAASQ,KAErB,GAAIxB,EACHA,EAAgB+D,KAAK9C,KAEvB,CAEA6C,EAAOrC,UAAUlC,EAAY,WAC5B,MAAMyE,EAAS/C,KAAKgD,IACpB,IACC,GAv3Be,EAu3BXhD,KAAK5B,EAAmB,OAC5B,QAAiBX,IAAbuC,KAAKoC,EAAmB,OAE5B,MAAMK,EAAUzC,KAAKoC,IACrB,GAAuB,mBAAZK,EACVzC,KAAK0C,EAAWD,CAIlB,CAFC,QACAM,GACD,CACD,EAEAF,EAAOrC,UAAUwC,EAAS,WACzB,GAv4Be,EAu4BXhD,KAAK5B,EACR,MAAU,IAAAsD,MAAM,kBAEjB1B,KAAK5B,GA14BU,EA24Bf4B,KAAK5B,IAAU,EACfoE,EAAcxC,MACd+B,EAAe/B,MA72Bf5C,IAg3BA,MAAM0B,EAAcF,EACpBA,EAAcoB,KACd,OAAO4C,EAAUK,KAAKjD,KAAMlB,EAC7B,EAEA+D,EAAOrC,UAAUqB,EAAU,WAC1B,KAr5BgB,EAq5BV7B,KAAK5B,GAAoB,CAC9B4B,KAAK5B,GAt5BU,EAu5Bf4B,KAAK7B,EAAqBJ,EAC1BA,EAAgBiC,IACjB,CACD,EAEA6C,EAAOrC,UAAU0C,EAAW,WAC3BlD,KAAK5B,GA35BW,EA65BhB,KAh6Be,EAg6BT4B,KAAK5B,GACVuE,EAAc3C,KAEhB,EAEA6C,EAAOrC,UAAU2C,QAAU,WAC1BnD,KAAKkD,GACN,EAcA,SAASlF,EAAOS,EAAcsB,GAC7B,MAAM/B,EAAS,IAAI6E,EAAOpE,EAAIsB,GAC9B,IACC/B,EAAOM,GAIR,CAHE,MAAOC,GACRP,EAAOkF,IACP,MAAM3E,CACP,CAGA,MAAM4E,EAAUnF,EAAOkF,EAASD,KAAKjF,GACpCmF,EAAgBlG,OAAOkG,SAAWA,EACnC,OAAOA,CACR,CAMA,SAASC,EACR3E,GAEA,mBAAgD4E,GAC/C,OAAO7E,EAAM,IAAMK,EAAU,IAAMJ,EAAG6E,MAAMtD,KAAMqD,IACnD,CACD,CA+EA,MAAME,EAAgBzD,IACrB,IAAK,MAAM0D,KAAO1D,EAAO,CACxB,MAAM2D,EAAM3D,EAAM0D,GAClB,GAAmB,mBAARC,EACV3D,EAAM0D,GAAOJ,EAAOK,QACV,GAAe,iBAARA,GAA4B,OAARA,KAAkB,UAAWA,GAGlEF,EAAaE,EAEf,GAGD,SAASC,EACRC,GAEA,OAAO,YAAwBN,GAC9B,IAAIO,EACAC,EAEJ,MAAMC,EApCR,WACC,IAAIC,EAAsBhF,EAC1BA,EAAkB,GAElB,OAAO,WACN,IAAI6E,EAAe7E,EACnB,GAAIA,GAAmBgF,EACtBA,EAAsBA,EAAoBC,OAAOjF,GAGlDA,EAAkBgF,EAElB,OAAOH,CACR,CACD,CAsB+BK,GAC7B,IACCJ,EAAQF,KAAgBN,EASzB,CARE,MAAO9E,GAIRQ,OAAkBtB,EAClB,MAAMc,CACP,CAAC,QACAqF,EAAeE,GAChB,CAEAP,EAAaM,GAEbA,EAAM5G,OAAOkG,SAAWC,EAAO,WAC9B,GAAIQ,EACH,IAAK,IAAIM,EAAI,EAAGA,EAAIN,EAAaO,OAAQD,IACxCN,EAAaM,GAAGf,UAIlBS,OAAenG,CAChB,GAEA,OAAOoG,CACR,CACD,QAAA1B,cAAAU,YAAAhD,YAAAuD,YAAA5E,WAAA+D,cAAAmB,iBAAA1F,YAAAkB,YAAAL"}

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

@@ -0,0 +1 @@
+var i=Symbol.for("preact-signals");function t(){if(!(s>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!==h){var n=h;h=void 0;v++;while(void 0!==n){var r=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=r}}v=0;s--;if(t)throw i}else s--}function n(i){if(s>0)return i();e=++u;s++;try{return i()}finally{t()}}var r=void 0;function o(i){var t=r;r=void 0;try{return i()}finally{r=t}}var f,h=void 0,s=0,v=0,u=0,e=0,c=void 0,d=0;function a(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 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,n=this.t;if(n!==i&&void 0===i.e){i.x=n;this.t=i;if(void 0!==n)n.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 n=i.e,r=i.x;if(void 0!==n){n.x=r;i.e=void 0}if(void 0!==r){r.e=n;i.x=void 0}if(i===this.t){this.t=r;if(void 0===r)o(function(){var i;null==(i=t.Z)||i.call(t)})}}};l.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"})};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=r;r=void 0;try{return this.value}finally{r=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!==s&&0===v)if(i.l!==e){i.l=e;c={S:i,v:i.v,i:i.i,o:c}}}(this);this.v=i;this.i++;d++;s++;try{for(var n=this.t;void 0!==n;n=n.x)n.t.N()}finally{t()}}}});function y(i,t){return new l(i,t)}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 _(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 r=t.p;if(-1===t.i){t.S.U(t);if(void 0!==r)r.n=t.n;if(void 0!==t.n)t.n.p=r}else n=t;t.S.n=t.r;if(void 0!==t.r)t.r=void 0;t=r}i.s=n}function p(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}p.prototype=new l;p.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&&!w(this)){this.f&=-2;return!0}var i=r;try{_(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};p.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)};p.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)}}};p.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(p.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 g(i,t){return new p(i,t)}function S(i){var n=i.m;i.m=void 0;if("function"==typeof n){s++;var o=r;r=void 0;try{n()}catch(t){i.f&=-2;i.f|=8;m(i);throw t}finally{r=o;t()}}}function m(i){for(var t=i.s;void 0!==t;t=t.n)t.S.U(t);i.x=void 0;i.s=void 0;S(i)}function x(i){if(r!==this)throw new Error("Out-of-order effect");b(this);r=i;this.f&=-2;if(8&this.f)m(this);t()}function E(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)}E.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()}};E.prototype.S=function(){if(1&this.f)throw new Error("Cycle detected");this.f|=1;this.f&=-9;S(this);_(this);s++;var i=r;r=this;return x.bind(this,i)};E.prototype.N=function(){if(!(2&this.f)){this.f|=2;this.u=h;h=this}};E.prototype.d=function(){this.f|=8;if(!(1&this.f))m(this)};E.prototype.dispose=function(){this.d()};function j(i,t){var n=new E(i,t);try{n.c()}catch(i){n.d();throw i}var r=n.d.bind(n);r[Symbol.dispose]=r;return r}function C(i){return function(){var t=arguments,r=this;return n(function(){return o(function(){return i.apply(r,[].slice.call(t))})})}}function O(){var i=f;f=[];return function(){var t=f;if(f&&i)i=i.concat(f);f=i;return t}}var k=function(i){for(var t in i){var n=i[t];if("function"==typeof n)i[t]=C(n);else if("object"==typeof n&&null!==n&&!("brand"in n))k(n)}};function T(i){return function(){var t,n,r=O();try{n=i.apply(void 0,[].slice.call(arguments))}catch(i){f=void 0;throw i}finally{t=r()}k(n);n[Symbol.dispose]=C(function(){if(t)for(var i=0;i<t.length;i++)t[i].dispose();t=void 0});return n}}export{p as Computed,E as Effect,l as Signal,C as action,n as batch,g as computed,T as createModel,j as effect,y as signal,o as untracked};//# sourceMappingURL=signals-core.module.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"signals-core.module.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","computed","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","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,IAWe,SAAA+B,EAAUY,EAAWC,GACpC,WAAWF,EAAOC,EAAOC,EAC1B,CAMA,SAAS1B,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,IA0BD,SAAS+E,EACRjE,EACAsB,GAEA,OAAO,IAAIuC,EAAS7D,EAAIsB,EACzB,CAMA,SAAS4C,EAAc3E,GACtB,IAAM4E,EAAU5E,EAAO6E,EACvB7E,EAAO6E,OAAWpF,EAElB,GAAuB,mBAAZmF,EAAwB,CAhvBnCxF,IAovBC,IAAM0B,EAAcF,EACpBA,OAAcnB,EACd,IACCmF,GASD,CARE,MAAOrE,GACRP,EAAOI,IAAU,EACjBJ,EAAOI,GAvxBO,EAwxBd0E,EAAc9E,GACd,MAAMO,CACP,CAAC,QACAK,EAAcE,EACd3B,GACD,CACD,CACD,CAEA,SAAS2F,EAAc9E,GACtB,IACC,IAAImB,EAAOnB,EAAOuB,OACT9B,IAAT0B,EACAA,EAAOA,EAAKK,EAEZL,EAAKzB,EAAQqD,EAAa5B,GAE3BnB,EAAOuE,OAAM9E,EACbO,EAAOuB,OAAW9B,EAElBkF,EAAc3E,EACf,CAEA,SAAS+E,EAAwBjE,GAChC,GAAIF,IAAgBoB,KACnB,MAAM,IAAI6B,MAAM,uBAEjBO,EAAepC,MACfpB,EAAcE,EAEdkB,KAAK5B,IAAU,EACf,GAvzBgB,EAuzBZ4B,KAAK5B,EACR0E,EAAc9C,MAEf7C,GACD,CA4CA,SAAS6F,EAAqBvE,EAAcsB,GAC3CC,KAAKuC,EAAM9D,EACXuB,KAAK6C,OAAWpF,EAChBuC,KAAKT,OAAW9B,EAChBuC,KAAK7B,OAAqBV,EAC1BuC,KAAK5B,EA12BW,GA22BhB4B,KAAKO,KAAc,MAAPR,OAAO,EAAPA,EAASQ,KAErB,GAAIxB,EACHA,EAAgBkE,KAAKjD,KAEvB,CAEAgD,EAAOxC,UAAUlC,EAAY,WAC5B,IAAM4E,EAASlD,KAAKmD,IACpB,IACC,GAv3Be,EAu3BXnD,KAAK5B,EAAmB,OAC5B,QAAiBX,IAAbuC,KAAKuC,EAAmB,OAE5B,IAAMK,EAAU5C,KAAKuC,IACrB,GAAuB,mBAAZK,EACV5C,KAAK6C,EAAWD,CAIlB,CAFC,QACAM,GACD,CACD,EAEAF,EAAOxC,UAAU2C,EAAS,WACzB,GAv4Be,EAu4BXnD,KAAK5B,EACR,MAAU,IAAAyD,MAAM,kBAEjB7B,KAAK5B,GA14BU,EA24Bf4B,KAAK5B,IAAU,EACfuE,EAAc3C,MACdkC,EAAelC,MA72Bf5C,IAg3BA,IAAM0B,EAAcF,EACpBA,EAAcoB,KACd,OAAO+C,EAAUK,KAAKpD,KAAMlB,EAC7B,EAEAkE,EAAOxC,UAAUwB,EAAU,WAC1B,KAr5BgB,EAq5BVhC,KAAK5B,GAAoB,CAC9B4B,KAAK5B,GAt5BU,EAu5Bf4B,KAAK7B,EAAqBJ,EAC1BA,EAAgBiC,IACjB,CACD,EAEAgD,EAAOxC,UAAU6C,EAAW,WAC3BrD,KAAK5B,GA35BW,EA65BhB,KAh6Be,EAg6BT4B,KAAK5B,GACV0E,EAAc9C,KAEhB,EAEAgD,EAAOxC,UAAU8C,QAAU,WAC1BtD,KAAKqD,GACN,EAcA,SAASrF,EAAOS,EAAcsB,GAC7B,IAAM/B,EAAS,IAAIgF,EAAOvE,EAAIsB,GAC9B,IACC/B,EAAOM,GAIR,CAHE,MAAOC,GACRP,EAAOqF,IACP,MAAM9E,CACP,CAGA,IAAM+E,EAAUtF,EAAOqF,EAASD,KAAKpF,GACpCsF,EAAgBpG,OAAOoG,SAAWA,EACnC,OAAOA,CACR,CAMA,SAASC,EACR9E,GAEA,OAAO,WAAoD+E,IAAAA,EAAAC,UAAAC,EAC1D1D,KAAA,OAAOxB,EAAM,kBAAMK,EAAU,WAAM,OAAAJ,EAAGkF,MAAMD,EAAI,GAAAE,MAAA9C,KAAA0C,GAAO,EAAC,EACzD,CACD,CA+DA,SAASK,IACR,IAAIC,EAAsB/E,EAC1BA,EAAkB,GAElB,OAAO,WACN,IAAIgF,EAAehF,EACnB,GAAIA,GAAmB+E,EACtBA,EAAsBA,EAAoBE,OAAOjF,GAGlDA,EAAkB+E,EAElB,OAAOC,CACR,CACD,CAEA,IAAME,EAAe,SAACnE,GACrB,IAAK,IAAMoE,KAAOpE,EAAO,CACxB,IAAMqE,EAAMrE,EAAMoE,GAClB,GAAmB,mBAARC,EACVrE,EAAMoE,GAAOX,EAAOY,QACd,GAAmB,iBAARA,GAA4B,OAARA,KAAkB,UAAWA,GAGlEF,EAAaE,EAEf,CACD,EAEA,SAASC,EACRC,GAEA,kBACC,IAAIN,EACAO,EAEEC,EAAuBV,IAC7B,IACCS,EAAQD,EAAYV,WAAA,EAAA,GAAAC,MAAA9C,KAAA2C,WASrB,CARE,MAAOlF,GAIRQ,OAAkBtB,EAClB,MAAMc,CACP,CAAC,QACAwF,EAAeQ,GAChB,CAEAN,EAAaK,GAEbA,EAAMpH,OAAOoG,SAAWC,EAAO,WAC9B,GAAIQ,EACH,IAAK,IAAIS,EAAI,EAAGA,EAAIT,EAAaU,OAAQD,IACxCT,EAAaS,GAAGlB,UAIlBS,OAAetG,CAChB,GAEA,OAAO6G,CACR,CACD,QAAAhC,cAAAU,YAAAnD,YAAA0D,YAAA/E,WAAAkE,cAAA0B,iBAAApG,YAAAkB,YAAAL"}

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

@@ -0,0 +1,48 @@
+{
+  "name": "@preact/signals-core",
+  "version": "1.14.1",
+  "license": "MIT",
+  "description": "Manage state with style in every framework",
+  "keywords": [],
+  "authors": [
+    "The Preact Authors (https://github.com/preactjs/signals/contributors)"
+  ],
+  "repository": {
+    "type": "git",
+    "url": "https://github.com/preactjs/signals"
+  },
+  "bugs": "https://github.com/preactjs/signals/issues",
+  "homepage": "https://preactjs.com",
+  "funding": {
+    "type": "opencollective",
+    "url": "https://opencollective.com/preact"
+  },
+  "amdName": "preactSignalsCore",
+  "main": "dist/signals-core.js",
+  "module": "dist/signals-core.module.js",
+  "unpkg": "dist/signals-core.min.js",
+  "types": "dist/signals-core.d.ts",
+  "source": "src/index.ts",
+  "sideEffects": false,
+  "exports": {
+    ".": {
+      "types": "./dist/signals-core.d.ts",
+      "browser": "./dist/signals-core.module.js",
+      "import": "./dist/signals-core.mjs",
+      "require": "./dist/signals-core.js"
+    }
+  },
+  "mangle": "../../mangle.json",
+  "files": [
+    "src",
+    "dist",
+    "CHANGELOG.md",
+    "LICENSE",
+    "README.md"
+  ],
+  "publishConfig": {
+    "access": "public",
+    "provenance": true
+  },
+  "scripts": {}
+}