@vuu-ui/vuu-utils 4.0.0-alpha.8 → 4.0.0-beta.1

package/src/formatting-utils.js

@@ -1,31 +1,51 @@
-import { isDateTimeDataValue, isMappedValueTypeRenderer, isNanoTimestampColumn, isTimeDataValue, isTypeDescriptor } from "./column-utils.js";
-import { dateTimePattern, formatDate } from "./date/index.js";
+import { isMappedValueTypeRenderer, isTypeDescriptor } from "./column-utils.js";
+import { dateTimePattern, defaultPatternsByType } from "./date/dateTimePattern.js";
+import { isStartOfDay } from "./date/time-zone.js";
+import { EpochTimestamp } from "./date/EpochTimestamp.js";
+import { formatTimestamp } from "./date/formatter.js";
+import { getTemporalInfo } from "./date/temporal.js";
 import { roundDecimal, roundScaledDecimal } from "./round-decimal.js";
 import { isNumericType } from "./protocol-message-utils.js";
 const DEFAULT_NUMERIC_FORMAT = {};
 const defaultValueFormatter = (value)=>null == value ? "" : "string" == typeof value ? value : value.toString();
-const dateFormatter = (column)=>{
-    if (isNanoTimestampColumn(column)) {
-        const pattern = dateTimePattern(column.type);
-        const formatter = formatDate(pattern);
-        return (value)=>{
-            if ("string" != typeof value || "" === value) return "";
-            {
-                const bigIntValue = BigInt(value);
-                const dateTimeValue = Number(bigIntValue / 1000000n);
-                const nanoSeconds = (bigIntValue % 1000000n).toString().padStart(9, "0");
-                return `${formatter(new Date(dateTimeValue))}.${nanoSeconds}`;
-            }
-        };
-    }
-    {
-        const pattern = dateTimePattern(column.type);
-        const formatter = formatDate(pattern);
-        return (value)=>{
-            if ("number" == typeof value && 0 !== value) return formatter(new Date(value));
-            return "";
-        };
+const getFractionalSecondDigits = (column, temporalInfo = getTemporalInfo(column))=>{
+    if (void 0 === temporalInfo) return 0;
+    const pattern = dateTimePattern(column.type, temporalInfo.kind);
+    const formatting = isTypeDescriptor(column.type) ? column.type.formatting : void 0;
+    return formatting?.fractionalSecondDigits ?? ("hh:mm:ss.ms" === pattern.time ? 3 : "ns" === temporalInfo.precision && pattern.time ? 9 : 0);
+};
+const temporalFormatter = (column, temporalInfo = getTemporalInfo(column))=>{
+    if (void 0 === temporalInfo) return defaultValueFormatter;
+    const { encoding, kind, timeZone } = temporalInfo;
+    const formatting = isTypeDescriptor(column.type) ? column.type.formatting ?? DEFAULT_NUMERIC_FORMAT : DEFAULT_NUMERIC_FORMAT;
+    const pattern = dateTimePattern(column.type, kind);
+    const fractionalSecondDigits = getFractionalSecondDigits(column, temporalInfo);
+    const formatter = formatTimestamp(pattern, {
+        fractionalSecondDigits,
+        locale: formatting.locale,
+        timeZone
+    });
+    return (value)=>{
+        const timestamp = EpochTimestamp.fromWire(value, encoding);
+        return timestamp ? formatter(timestamp) : "";
+    };
+};
+const timeOfDayPattern = /^\d{2}:\d{2}:\d{2}(\.\d{1,9})?$/;
+const formatTemporalFilterValue = (value, column)=>{
+    const temporalInfo = getTemporalInfo(column);
+    if ("string" == typeof value && timeOfDayPattern.test(value)) return value;
+    if (void 0 === temporalInfo) return defaultValueFormatter(value);
+    const timestamp = EpochTimestamp.fromWire(value, temporalInfo.encoding);
+    if (void 0 === timestamp) return defaultValueFormatter(value);
+    if ("datetime" === temporalInfo.kind && 0 === timestamp.subMilliNanos && isStartOfDay(timestamp.epochMillis, temporalInfo.timeZone)) {
+        const { date = defaultPatternsByType.date } = dateTimePattern(column.type, "date");
+        return formatTimestamp({
+            date
+        }, {
+            timeZone: temporalInfo.timeZone
+        })(timestamp);
     }
+    return temporalFormatter(column, temporalInfo)(value);
 };
 const numericFormatter = ({ align = "right", serverDataType, type })=>{
     if (void 0 === type || "string" == typeof type) return defaultValueFormatter;
@@ -47,7 +67,8 @@ const NumericTypes = [
 ];
 const getValueFormatter = (column)=>{
     const { serverDataType = "string" } = column;
-    if (isDateTimeDataValue(column) || isTimeDataValue(column)) return dateFormatter(column);
+    const temporalInfo = getTemporalInfo(column);
+    if (temporalInfo) return temporalFormatter(column, temporalInfo);
     const { type } = column;
     if (isTypeDescriptor(type) && isMappedValueTypeRenderer(type?.renderer)) return mapFormatter(type.renderer.map);
     if (isNumericType(serverDataType) || isTypeDescriptor(type) && NumericTypes.includes(type.name)) return numericFormatter(column);
@@ -55,4 +76,4 @@ const getValueFormatter = (column)=>{
     return defaultValueFormatter;
 };
 const lowerCase = (str)=>str.toLowerCase();
-export { defaultValueFormatter, getValueFormatter, lowerCase, numericFormatter };
+export { defaultValueFormatter, formatTemporalFilterValue, getFractionalSecondDigits, getValueFormatter, lowerCase, numericFormatter, temporalFormatter };

package/src/html-utils.js

@@ -81,6 +81,40 @@ function getScrollbarSize() {
     }
     return size;
 }
+const DEFAULT_MAX_SCROLL_HEIGHT = 33000000;
+const MAX_PROBE_HEIGHT = 2 ** 26;
+const maxScrollHeightByDevicePixelRatio = new Map();
+function getMaxScrollHeight(doc = globalThis.document) {
+    if (doc?.body === void 0 || null === doc.body) return DEFAULT_MAX_SCROLL_HEIGHT;
+    const devicePixelRatio = doc.defaultView?.devicePixelRatio ?? 1;
+    const cachedValue = maxScrollHeightByDevicePixelRatio.get(devicePixelRatio);
+    if (void 0 !== cachedValue) return cachedValue;
+    const outer = doc.createElement("div");
+    outer.style.cssText = "position:absolute;top:-200px;left:-200px;width:50px;height:50px;overflow:scroll;visibility:hidden;";
+    const inner = doc.createElement("div");
+    inner.style.width = "1px";
+    outer.appendChild(inner);
+    doc.body.appendChild(outer);
+    const isHonoured = (height)=>{
+        inner.style.height = `${height}px`;
+        return outer.scrollHeight >= height - 1;
+    };
+    let lo = 0;
+    let hi = MAX_PROBE_HEIGHT;
+    while(hi - lo > 1){
+        const mid = Math.floor((lo + hi) / 2);
+        if (isHonoured(mid)) lo = mid;
+        else hi = mid;
+    }
+    inner.style.height = `${lo}px`;
+    const maxScrollHeight = Math.min(lo, outer.scrollHeight);
+    outer.remove();
+    if (maxScrollHeight > 0) {
+        maxScrollHeightByDevicePixelRatio.set(devicePixelRatio, maxScrollHeight);
+        return maxScrollHeight;
+    }
+    return DEFAULT_MAX_SCROLL_HEIGHT;
+}
 const dispatchMouseEvent = (el, type)=>{
     const evt = new MouseEvent(type, {
         view: window,
@@ -105,4 +139,4 @@ const dispatchCustomEvent = (el, type)=>{
     });
     el.dispatchEvent(evt);
 };
-export { createEl, dispatchCustomEvent, dispatchKeyboardEvent, dispatchMouseEvent, focusFirstFocusableElement, getClosest, getClosestIndexItem, getElementByDataIndex, getElementDataIndex, getFocusableElement, getScrollbarSize, hasOpenOptionList, isDateInput, isInputElement, isSelectableElement, queryClosest };
+export { DEFAULT_MAX_SCROLL_HEIGHT, createEl, dispatchCustomEvent, dispatchKeyboardEvent, dispatchMouseEvent, focusFirstFocusableElement, getClosest, getClosestIndexItem, getElementByDataIndex, getElementDataIndex, getFocusableElement, getMaxScrollHeight, getScrollbarSize, hasOpenOptionList, isDateInput, isInputElement, isSelectableElement, queryClosest };

package/src/index.js

@@ -14,7 +14,6 @@ export * from "./datasource/datasource-utils.js";
 export * from "./date/index.js";
 export * from "./debug-utils.js";
 export * from "./event-emitter.js";
-export * from "./errors.js";
 export * from "./feature-utils.js";
 export * from "./filters/index.js";
 export * from "./form-utils.js";

package/src/keyset.js

@@ -1,10 +1,14 @@
 const EMPTY = [];
 class KeySet {
     keys = new Map();
+    freeKeys = [];
     nextKeyValue = 0;
     range;
     constructor(range){
-        this.range = range;
+        this.range = {
+            from: range.from,
+            to: range.to
+        };
         this.init(range);
     }
     next(free = EMPTY) {
@@ -13,6 +17,7 @@ class KeySet {
     }
     init({ from, to }) {
         this.keys.clear();
+        this.freeKeys.length = 0;
         this.nextKeyValue = 0;
         for(let rowIndex = from; rowIndex < to; rowIndex++){
             const nextKeyValue = this.next();
@@ -20,23 +25,24 @@ class KeySet {
         }
         return true;
     }
-    reset(range) {
-        const { from, to } = range;
-        const newSize = to - from;
-        const currentSize = this.range.to - this.range.from;
-        this.range = range;
-        if (currentSize > newSize) return this.init(range);
-        const freeKeys = [];
+    reset({ from, to }) {
+        this.range = {
+            from,
+            to
+        };
+        const { freeKeys } = this;
         this.keys.forEach((keyValue, rowIndex)=>{
             if (rowIndex < from || rowIndex >= to) {
                 freeKeys.push(keyValue);
                 this.keys.delete(rowIndex);
             }
         });
+        let freeKeyIndex = 0;
         for(let rowIndex = from; rowIndex < to; rowIndex++)if (!this.keys.has(rowIndex)) {
-            const nextKeyValue = this.next(freeKeys);
+            const nextKeyValue = freeKeyIndex < freeKeys.length ? freeKeys[freeKeyIndex++] : this.nextKeyValue++;
             this.keys.set(rowIndex, nextKeyValue);
         }
+        if (freeKeyIndex > 0) freeKeys.splice(0, freeKeyIndex);
         return false;
     }
     keyFor(rowIndex) {

package/src/react-utils.js

@@ -1,8 +1,14 @@
 import { Children, isValidElement, useEffect, useMemo, useRef } from "react";
 const EMPTY_ARRAY = [];
 const asReactElements = (children)=>{
-    const elements = Children.toArray(children).filter(isValidElement);
-    return 0 === elements.length ? EMPTY_ARRAY : elements;
+    const isArray = Array.isArray(children);
+    const count = isArray ? children.length : Children.count(children);
+    if (isArray && children.every(isValidElement)) return children;
+    if (1 === count && !isArray && isValidElement(children)) return [
+        children
+    ];
+    if (count > 1) return children;
+    return EMPTY_ARRAY;
 };
 const useIsMounted = (id = "")=>{
     const isMountedRef = useRef(false);

package/src/table-schema-utils.js

@@ -1,3 +1,9 @@
+const toSchemaColumn = ({ editable, name, required, serverDataType = "string" })=>({
+        editable,
+        name,
+        required,
+        serverDataType
+    });
 const getVuuTable = (schemaTable)=>{
     if (!schemaTable.session) return schemaTable;
     {
@@ -8,9 +14,4 @@ const getVuuTable = (schemaTable)=>{
         };
     }
 };
-const toSchemaColumn = ({ editable, name, serverDataType = 'string' })=>({
-        editable: true === editable || 'object' == typeof editable,
-        name,
-        serverDataType
-    });
 export { getVuuTable, toSchemaColumn };

package/src/useResizeObserver.js

@@ -29,7 +29,7 @@ const getTargetSize = (element, size, dimension)=>{
             return 0;
     }
 };
-const resizeObserver = new ResizeObserver((entries)=>{
+const resizeObserver = "u" < typeof ResizeObserver ? void 0 : new ResizeObserver((entries)=>{
     for (const entry of entries){
         const { target, borderBoxSize, contentBoxSize } = entry;
         const observedTarget = observedMap.get(target);
@@ -81,7 +81,7 @@ function useResizeObserver(ref, dimensions, onResize, reportInitialSize = false)
             if (observedTarget) {
                 const measurements = measure(target);
                 observedTarget.measurements = measurements;
-                resizeObserver.observe(target);
+                resizeObserver?.observe(target);
                 if (reportInitialSize) onResize(measurements);
             } else console.log("%cuseResizeObserver an target expected to be under observation wa snot found. This warrants investigation", "font-weight:bold; color:red;");
         }
@@ -93,7 +93,7 @@ function useResizeObserver(ref, dimensions, onResize, reportInitialSize = false)
         }
         return ()=>{
             if (target && observedMap.has(target)) {
-                resizeObserver.unobserve(target);
+                resizeObserver?.unobserve(target);
                 observedMap.delete(target);
             }
         };

package/src/vendor/@preact/signals-core/dist/signals-core.js

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

package/src/vendor/@preact/signals-core/dist/signals-core.js.map

@@ -1 +1 @@
-{"version":3,"file":"signals-core.js","sources":["../src/index.ts"],"sourcesContent":["// An named symbol/brand for detecting Signal instances even when they weren't\n// created using the same signals library version.\nconst BRAND_SYMBOL = Symbol.for(\"preact-signals\");\n\n// Flags for Computed and Effect.\nconst RUNNING = 1 << 0;\nconst NOTIFIED = 1 << 1;\nconst OUTDATED = 1 << 2;\nconst DISPOSED = 1 << 3;\nconst HAS_ERROR = 1 << 4;\nconst TRACKING = 1 << 5;\n\n// A linked list node used to track dependencies (sources) and dependents (targets).\n// Also used to remember the source's last version number that the target saw.\ntype Node = {\n\t// A source whose value the target depends on.\n\t_source: Signal;\n\t_prevSource?: Node;\n\t_nextSource?: Node;\n\n\t// A target that depends on the source and should be notified when the source changes.\n\t_target: Computed | Effect;\n\t_prevTarget?: Node;\n\t_nextTarget?: Node;\n\n\t// The version number of the source that target has last seen. We use version numbers\n\t// instead of storing the source value, because source values can take arbitrary amount\n\t// of memory, and computeds could hang on to them forever because they're lazily evaluated.\n\t// Use the special value -1 to mark potentially unused but recyclable nodes.\n\t_version: number;\n\n\t// Used to remember & roll back the source's previous `._node` value when entering &\n\t// exiting a new evaluation context.\n\t_rollbackNode?: Node;\n};\n\nfunction startBatch() {\n\tbatchDepth++;\n}\n\nfunction endBatch() {\n\tif (batchDepth > 1) {\n\t\tbatchDepth--;\n\t\treturn;\n\t}\n\n\tlet error: unknown;\n\tlet hasError = false;\n\treconcileBatchSnapshots();\n\n\twhile (batchedEffect !== undefined) {\n\t\tlet effect: Effect | undefined = batchedEffect;\n\t\tbatchedEffect = undefined;\n\n\t\tbatchIteration++;\n\n\t\twhile (effect !== undefined) {\n\t\t\tconst next: Effect | undefined = effect._nextBatchedEffect;\n\t\t\teffect._nextBatchedEffect = undefined;\n\t\t\teffect._flags &= ~NOTIFIED;\n\n\t\t\tif (!(effect._flags & DISPOSED) && needsToRecompute(effect)) {\n\t\t\t\ttry {\n\t\t\t\t\teffect._callback();\n\t\t\t\t} catch (err) {\n\t\t\t\t\tif (!hasError) {\n\t\t\t\t\t\terror = err;\n\t\t\t\t\t\thasError = true;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\teffect = next;\n\t\t}\n\t}\n\tbatchIteration = 0;\n\tbatchDepth--;\n\n\tif (hasError) {\n\t\tthrow error;\n\t}\n}\n\n/**\n * Combine multiple value updates into one \"commit\" at the end of the provided callback.\n *\n * Batches can be nested and changes are only flushed once the outermost batch callback\n * completes.\n *\n * Accessing a signal that has been modified within a batch will reflect its updated\n * value.\n *\n * @param fn The callback function.\n * @returns The value returned by the callback.\n */\nfunction batch<T>(fn: () => T): T {\n\tif (batchDepth > 0) {\n\t\treturn fn();\n\t}\n\tcurrentBatchSnapshotVersion = ++batchSnapshotVersion;\n\t/*@__INLINE__**/ startBatch();\n\ttry {\n\t\treturn fn();\n\t} finally {\n\t\tendBatch();\n\t}\n}\n\n// Currently evaluated computed or effect.\nlet evalContext: Computed | Effect | undefined = undefined;\n\n// Effects captured while constructing a model instance.\nlet capturedEffects: Effect[] | undefined;\n\n/**\n * Run a callback function that can access signal values without\n * subscribing to the signal updates.\n *\n * When called inside a `createModel` factory, this also suppresses\n * model-owned effect capture. Effects created inside the callback will not\n * be owned by the surrounding model and must be disposed manually. Nested\n * `createModel` calls inside the callback still capture their own effects.\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\tconst prevCapturedEffects = capturedEffects;\n\n\tevalContext = undefined;\n\t// Model effect capture is another kind of ambient tracking. Suppress it in\n\t// untracked callbacks while still allowing nested createModel() calls to\n\t// establish their own capture scope.\n\tcapturedEffects = undefined;\n\ttry {\n\t\treturn fn();\n\t} finally {\n\t\tevalContext = prevContext;\n\t\tcapturedEffects = prevCapturedEffects;\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\tconst source = snapshots._source;\n\t\tif (source._value === snapshots._value) {\n\t\t\t// The value was reverted to its pre-batch state. Version numbers must\n\t\t\t// stay monotonic: a lazy computed may have observed an intermediate\n\t\t\t// version during the batch, and rolling the version back would let a\n\t\t\t// future write re-mint that observed number for a different value,\n\t\t\t// making the computed treat it as unchanged forever. Instead,\n\t\t\t// fast-forward subscribers that last saw the pre-batch version so\n\t\t\t// they skip recomputing for the no-op change.\n\t\t\tfor (\n\t\t\t\tlet node = source._targets;\n\t\t\t\tnode !== undefined;\n\t\t\t\tnode = node._nextTarget\n\t\t\t) {\n\t\t\t\tif (node._version === snapshots._version) {\n\t\t\t\t\tnode._version = source._version;\n\t\t\t\t}\n\t\t\t}\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\tuntracked(() => fn(value));\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\treturn untracked(() => this.value);\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, options);\n\n\tthis._fn = fn;\n\tthis._sources = undefined;\n\tthis._globalVersion = globalVersion - 1;\n\tthis._flags = OUTDATED;\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\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\t// Always establish a fresh capture scope, even when `untracked()` has\n\t// temporarily cleared the parent scope. This lets nested models own their\n\t// effects without promoting them to a suppressed outer scope.\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","_source","_value","node","_targets","_nextTarget","_version","_next","reconcileBatchSnapshots","batchedEffect","effect","batchIteration","next","_nextBatchedEffect","_flags","needsToRecompute","_callback","err","batch","fn","currentBatchSnapshotVersion","batchSnapshotVersion","capturedEffects","evalContext","untracked","prevContext","prevCapturedEffects","globalVersion","addDependency","signal","_node","_target","_prevSource","_sources","_nextSource","_prevTarget","_rollbackNode","_subscribe","Signal","value","options","this","_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","_this4","Object","defineProperty","get","set","Error","recordBatchSnapshot","_notify","target","prepareSources","rollbackNode","cleanupSources","head","Computed","_fn","_globalVersion","OUTDATED","cleanupEffect","cleanup","_cleanup","disposeEffect","endEffect","Effect","push","finish","_start","bind","_dispose","dispose","action","_arguments","arguments","_this5","apply","slice","startCapturingEffects","modelEffects","concat","wrapInAction","key","val","exports","computed","createModel","modelFactory","model","stopCapturingEffects","i","length"],"mappings":"AAEA,IAAMA,EAAeC,OAAU,IAAC,kBAsChC,SAASC,IACR,KAAIC,EAAa,GAAjB,CAKA,IAAIC,EACAC,GAAW,GAoIhB,WACC,IAAIC,EAAYC,EAChBA,OAAiBC,EAEjB,WAAqBA,IAAdF,EAAyB,CAC/B,IAAMG,EAASH,EAAUI,EACzB,GAAID,EAAOE,IAAWL,EAAUK,EAQ/B,IACC,IAAIC,EAAOH,EAAOI,OACTL,IAATI,EACAA,EAAOA,EAAKE,EAEZ,GAAIF,EAAKG,IAAaT,EAAUS,EAC/BH,EAAKG,EAAWN,EAAOM,EAI1BT,EAAYA,EAAUU,CACvB,CACD,CA7JCC,GAEA,WAAyBT,IAAlBU,EAA6B,CACnC,IAAIC,EAA6BD,EACjCA,OAAgBV,EAEhBY,IAEA,WAAkBZ,IAAXW,EAAsB,CAC5B,IAAME,EAA2BF,EAAOG,EACxCH,EAAOG,OAAqBd,EAC5BW,EAAOI,IAAU,EAEjB,KArDc,EAqDRJ,EAAOI,IAAsBC,EAAiBL,GACnD,IACCA,EAAOM,GAMR,CALE,MAAOC,GACR,IAAKrB,EAAU,CACdD,EAAQsB,EACRrB,GAAW,CACZ,CACD,CAEDc,EAASE,CACV,CACD,CACAD,EAAiB,EACjBjB,IAEA,GAAIE,EACH,MAAMD,CAlCP,MAFCD,GAsCF,CAcA,SAASwB,EAASC,GACjB,GAAIzB,EAAa,EAChB,OAAOyB,IAERC,IAAgCC,EA7DhC3B,IA+DA,IACC,OAAOyB,GAGR,CAFC,QACA1B,GACD,CACD,CAGA,IAGI6B,EAHAC,OAA6CxB,EAiBjD,SAASyB,EAAaL,GACrB,IAAMM,EAAcF,EACdG,EAAsBJ,EAE5BC,OAAcxB,EAIduB,OAAkBvB,EAClB,IACC,OAAOoB,GAIR,CAHC,QACAI,EAAcE,EACdH,EAAkBI,CACnB,CACD,CAGA,IAAIjB,OAAoCV,EACpCL,EAAa,EACbiB,EAAiB,EASjBU,EAAuB,EACvBD,EAA8B,EAC9BtB,OAA4CC,EAI5C4B,EAAgB,EA+CpB,SAASC,EAAcC,GACtB,QAAoB9B,IAAhBwB,EAAJ,CAIA,IAAIpB,EAAO0B,EAAOC,EAClB,QAAa/B,IAATI,GAAsBA,EAAK4B,IAAYR,EAAa,CAavDpB,EAAO,CACNG,EAAU,EACVL,EAAS4B,EACTG,EAAaT,EAAYU,EACzBC,OAAanC,EACbgC,EAASR,EACTY,OAAapC,EACbM,OAAaN,EACbqC,EAAejC,GAGhB,QAA6BJ,IAAzBwB,EAAYU,EACfV,EAAYU,EAASC,EAAc/B,EAEpCoB,EAAYU,EAAW9B,EACvB0B,EAAOC,EAAQ3B,EAIf,GA3Oe,GA2OXoB,EAAYT,EACfe,EAAOQ,EAAWlC,GAEnB,OAAOA,CACR,UAA8B,IAAnBA,EAAKG,EAAiB,CAEhCH,EAAKG,EAAW,EAehB,QAAyBP,IAArBI,EAAK+B,EAA2B,CACnC/B,EAAK+B,EAAYF,EAAc7B,EAAK6B,EAEpC,QAAyBjC,IAArBI,EAAK6B,EACR7B,EAAK6B,EAAYE,EAAc/B,EAAK+B,EAGrC/B,EAAK6B,EAAcT,EAAYU,EAC/B9B,EAAK+B,OAAcnC,EAEnBwB,EAAYU,EAAUC,EAAc/B,EACpCoB,EAAYU,EAAW9B,CACxB,CAIA,OAAOA,CACR,CAzEA,CA2ED,CAkFA,SAASmC,EAAqBC,EAAiBC,GAC9CC,KAAKvC,EAASqC,EACdE,KAAKnC,EAAW,EAChBmC,KAAKX,OAAQ/B,EACb0C,KAAKrC,OAAWL,EAChB0C,KAAKC,EAAwB,EAC7BD,KAAKE,EAAkB,MAAPH,OAAO,EAAPA,EAASI,QACzBH,KAAKI,QAAaL,SAAAA,EAASM,UAC3BL,KAAKM,KAAc,MAAPP,OAAO,EAAPA,EAASO,IACtB,CAEAT,EAAOU,UAAUC,MAAQ1D,EAEzB+C,EAAOU,UAAUE,EAAW,WAC3B,OACD,CAAA,EAEAZ,EAAOU,UAAUX,EAAa,SAAUlC,GAAIgD,IAAAA,OACrCC,EAAUX,KAAKrC,EACrB,GAAIgD,IAAYjD,QAA6BJ,IAArBI,EAAKgC,EAA2B,CACvDhC,EAAKE,EAAc+C,EACnBX,KAAKrC,EAAWD,EAEhB,QAAgBJ,IAAZqD,EACHA,EAAQjB,EAAchC,OAEtBqB,EAAU,eAAK6B,EACdA,OAAAA,EAAAF,EAAKR,IAALU,EAAeC,KAAKH,EACrB,EAEF,CACD,EAEAb,EAAOU,UAAUO,EAAe,SAAUpD,OAAIqD,EAAAf,KAE7C,QAAsB1C,IAAlB0C,KAAKrC,EAAwB,CAChC,IAAMqD,EAAOtD,EAAKgC,EACZvB,EAAOT,EAAKE,EAClB,QAAaN,IAAT0D,EAAoB,CACvBA,EAAKpD,EAAcO,EACnBT,EAAKgC,OAAcpC,CACpB,CAEA,QAAaA,IAATa,EAAoB,CACvBA,EAAKuB,EAAcsB,EACnBtD,EAAKE,OAAcN,CACpB,CAEA,GAAII,IAASsC,KAAKrC,EAAU,CAC3BqC,KAAKrC,EAAWQ,EAChB,QAAab,IAATa,EACHY,EAAU,WAAKkC,IAAAA,EACC,OAAfA,EAAAF,EAAKX,IAALa,EAAiBJ,KAAKE,EACvB,EAEF,CACD,CACD,EAEAlB,EAAOU,UAAUW,UAAY,SAAUxC,GAAEyC,IAAAA,OACxC,OAAOlD,EACN,WACC,IAAM6B,EAAQqB,EAAKrB,MACnBf,EAAU,WAAA,OAAML,EAAGoB,EAAM,EAC1B,EACA,CAAEQ,KAAM,OAEV,EAEAT,EAAOU,UAAUa,QAAU,WAC1B,YAAYtB,KACb,EAEAD,EAAOU,UAAUc,SAAW,WAC3B,OAAOrB,KAAKF,MAAQ,EACrB,EAEAD,EAAOU,UAAUe,OAAS,WACzB,OAAWtB,KAACF,KACb,EAEAD,EAAOU,UAAUgB,KAAO,WAAAC,IAAAA,OACvB,OAAOzC,EAAU,WAAA,OAAMyC,EAAK1B,KAAK,EAClC,EAEA2B,OAAOC,eAAe7B,EAAOU,UAAW,QAAS,CAChDoB,IAAG,WACF,IAAMjE,EAAOyB,EAAca,MAC3B,QAAa1C,IAATI,EACHA,EAAKG,EAAWmC,KAAKnC,EAEtB,YAAYJ,CACb,EACAmE,aAAkB9B,GACjB,GAAIA,IAAUE,KAAKvC,EAAQ,CAC1B,GAAIS,EAAiB,IACpB,MAAM,IAAI2D,MAAM,mBA7SpB,SAA6BtE,GAE5B,GAAmB,IAAfN,GAAuC,IAAnBiB,EAIxB,GAAIX,EAAO0C,IAA0BtB,EAA6B,CACjEpB,EAAO0C,EAAwBtB,EAC/BtB,EAAiB,CAChBG,EAASD,EACTE,EAAQF,EAAOE,EACfI,EAAUN,EAAOM,EACjBC,EAAOT,EAET,CACD,CAiSGyE,CAAoB9B,MACpBA,KAAKvC,EAASqC,EACdE,KAAKnC,IACLqB,IAhbFjC,IAmbE,IACC,IACC,IAAIS,EAAOsC,KAAKrC,OACPL,IAATI,EACAA,EAAOA,EAAKE,EAEZF,EAAK4B,EAAQyC,GAIf,CAFC,QACA/E,GACD,CACD,CACD,IAmBD,SAASsB,EAAiB0D,GAIzB,IACC,IAAItE,EAAOsE,EAAOxC,OACTlC,IAATI,EACAA,EAAOA,EAAK+B,EAEZ,GAKC/B,EAAKF,EAAQK,IAAaH,EAAKG,IAG9BH,EAAKF,EAAQiD,KAEd/C,EAAKF,EAAQK,IAAaH,EAAKG,EAE/B,SAKF,OACD,CAAA,CAEA,SAASoE,EAAeD,GAavB,IACC,IAAItE,EAAOsE,EAAOxC,OACTlC,IAATI,EACAA,EAAOA,EAAK+B,EACX,CACD,IAAMyC,EAAexE,EAAKF,EAAQ6B,EAClC,QAAqB/B,IAAjB4E,EACHxE,EAAKiC,EAAgBuC,EAEtBxE,EAAKF,EAAQ6B,EAAQ3B,EACrBA,EAAKG,GAAY,EAEjB,QAAyBP,IAArBI,EAAK+B,EAA2B,CACnCuC,EAAOxC,EAAW9B,EAClB,KACD,CACD,CACD,CAEA,SAASyE,EAAeH,GACvB,IAAItE,EAAOsE,EAAOxC,EACd4C,OAAyB9E,EAO7B,WAAgBA,IAATI,EAAoB,CAC1B,IAAMsD,EAAOtD,EAAK6B,EAUlB,IAAuB,IAAnB7B,EAAKG,EAAiB,CACzBH,EAAKF,EAAQsD,EAAapD,GAE1B,QAAaJ,IAAT0D,EACHA,EAAKvB,EAAc/B,EAAK+B,EAEzB,QAAyBnC,IAArBI,EAAK+B,EACR/B,EAAK+B,EAAYF,EAAcyB,CAEjC,MAWCoB,EAAO1E,EAGRA,EAAKF,EAAQ6B,EAAQ3B,EAAKiC,EAC1B,QAA2BrC,IAAvBI,EAAKiC,EACRjC,EAAKiC,OAAgBrC,EAGtBI,EAAOsD,CACR,CAEAgB,EAAOxC,EAAW4C,CACnB,CAkBA,SAASC,EAAyB3D,EAAmBqB,GACpDF,EAAOgB,KAAKb,UAAM1C,EAAWyC,GAE7BC,KAAKsC,EAAM5D,EACXsB,KAAKR,OAAWlC,EAChB0C,KAAKuC,EAAiBrD,EAAgB,EACtCc,KAAK3B,EAznBW,CA0nBjB,CAEAgE,EAAS9B,UAAY,IAAIV,EAEzBwC,EAAS9B,UAAUE,EAAW,WAC7BT,KAAK3B,IAAU,EAEf,GAnoBe,EAmoBX2B,KAAK3B,EACR,OACD,EAKA,GAroBgB,KAqoBImE,GAAfxC,KAAK3B,GACT,OACD,EACA2B,KAAK3B,IAAU,EAEf,GAAI2B,KAAKuC,IAAmBrD,EAC3B,OACD,EACAc,KAAKuC,EAAiBrD,EAItBc,KAAK3B,GAtpBU,EAupBf,GAAI2B,KAAKnC,EAAW,IAAMS,EAAiB0B,MAAO,CACjDA,KAAK3B,IAAU,EACf,OAAO,CACR,CAEA,IAAMW,EAAcF,EACpB,IACCmD,EAAejC,MACflB,EAAckB,KACd,IAAMF,EAAQE,KAAKsC,IACnB,GA7pBgB,GA8pBftC,KAAK3B,GACL2B,KAAKvC,IAAWqC,GACE,IAAlBE,KAAKnC,EACJ,CACDmC,KAAKvC,EAASqC,EACdE,KAAK3B,IAAU,GACf2B,KAAKnC,GACN,CAKD,CAJE,MAAOW,GACRwB,KAAKvC,EAASe,EACdwB,KAAK3B,GAxqBW,GAyqBhB2B,KAAKnC,GACN,CACAiB,EAAcE,EACdmD,EAAenC,MACfA,KAAK3B,IAAU,EACf,OACD,CAAA,EAEAgE,EAAS9B,UAAUX,EAAa,SAAUlC,GACzC,QAAsBJ,IAAlB0C,KAAKrC,EAAwB,CAChCqC,KAAK3B,GAAUmE,GAIf,IACC,IAAI9E,EAAOsC,KAAKR,OACPlC,IAATI,EACAA,EAAOA,EAAK+B,EAEZ/B,EAAKF,EAAQoC,EAAWlC,EAE1B,CACAmC,EAAOU,UAAUX,EAAWiB,KAAKb,KAAMtC,EACxC,EAEA2E,EAAS9B,UAAUO,EAAe,SAAUpD,GAE3C,QAAsBJ,IAAlB0C,KAAKrC,EAAwB,CAChCkC,EAAOU,UAAUO,EAAaD,KAAKb,KAAMtC,GAIzC,QAAsBJ,IAAlB0C,KAAKrC,EAAwB,CAChCqC,KAAK3B,IAAU,GAEf,IACC,IAAIX,EAAOsC,KAAKR,OACPlC,IAATI,EACAA,EAAOA,EAAK+B,EAEZ/B,EAAKF,EAAQsD,EAAapD,EAE5B,CACD,CACD,EAEA2E,EAAS9B,UAAUwB,EAAU,WAC5B,KA3tBgB,EA2tBV/B,KAAK3B,GAAoB,CAC9B2B,KAAK3B,GAAUmE,EAEf,IACC,IAAI9E,EAAOsC,KAAKrC,OACPL,IAATI,EACAA,EAAOA,EAAKE,EAEZF,EAAK4B,EAAQyC,GAEf,CACD,EAEAN,OAAOC,eAAeW,EAAS9B,UAAW,QAAS,CAClDoB,IAAA,WACC,GA3uBc,EA2uBV3B,KAAK3B,EACR,MAAU,IAAAwD,MAAM,kBAEjB,IAAMnE,EAAOyB,EAAca,MAC3BA,KAAKS,IACL,QAAanD,IAATI,EACHA,EAAKG,EAAWmC,KAAKnC,EAEtB,GA/uBgB,GA+uBZmC,KAAK3B,EACR,WAAWZ,EAEZ,OAAOuC,KAAKvC,CACb,IAqCD,SAASgF,EAAcxE,GACtB,IAAMyE,EAAUzE,EAAO0E,EACvB1E,EAAO0E,OAAWrF,EAElB,GAAuB,mBAAZoF,EAAwB,CAhwBnCzF,IAowBC,IAAM+B,EAAcF,EACpBA,OAAcxB,EACd,IACCoF,GASD,CARE,MAAOlE,GACRP,EAAOI,IAAU,EACjBJ,EAAOI,GAvyBO,EAwyBduE,EAAc3E,GACd,MAAMO,CACP,CAAC,QACAM,EAAcE,EACdhC,GACD,CACD,CACD,CAEA,SAAS4F,EAAc3E,GACtB,IACC,IAAIP,EAAOO,EAAOuB,OACTlC,IAATI,EACAA,EAAOA,EAAK+B,EAEZ/B,EAAKF,EAAQsD,EAAapD,GAE3BO,EAAOqE,OAAMhF,EACbW,EAAOuB,OAAWlC,EAElBmF,EAAcxE,EACf,CAEA,SAAS4E,EAAwB7D,GAChC,GAAIF,IAAgBkB,KACnB,MAAM,IAAI6B,MAAM,uBAEjBM,EAAenC,MACflB,EAAcE,EAEdgB,KAAK3B,IAAU,EACf,GAv0BgB,EAu0BZ2B,KAAK3B,EACRuE,EAAc5C,MAEfhD,GACD,CA0CA,SAAS8F,EAAqBpE,EAAcqB,GAC3CC,KAAKsC,EAAM5D,EACXsB,KAAK2C,OAAWrF,EAChB0C,KAAKR,OAAWlC,EAChB0C,KAAK5B,OAAqBd,EAC1B0C,KAAK3B,EAx3BW,GAy3BhB2B,KAAKM,KAAOP,MAAAA,OAAAA,EAAAA,EAASO,KAErB,GAAIzB,EACHA,EAAgBkE,KAAK/C,KAEvB,CAEA8C,EAAOvC,UAAUhC,EAAY,WAC5B,IAAMyE,EAAShD,KAAKiD,IACpB,IACC,GAr4Be,EAq4BXjD,KAAK3B,EAAmB,OAC5B,QAAiBf,IAAb0C,KAAKsC,EAAmB,OAE5B,IAAMI,EAAU1C,KAAKsC,IACrB,GAAuB,mBAAZI,EACV1C,KAAK2C,EAAWD,CAIlB,CAFC,QACAM,GACD,CACD,EAEAF,EAAOvC,UAAU0C,EAAS,WACzB,GAr5Be,EAq5BXjD,KAAK3B,EACR,UAAUwD,MAAM,kBAEjB7B,KAAK3B,GAx5BU,EAy5Bf2B,KAAK3B,IAAU,EACfoE,EAAczC,MACdiC,EAAejC,MA33Bf/C,IA83BA,IAAM+B,EAAcF,EACpBA,EAAckB,KACd,OAAO6C,EAAUK,KAAKlD,KAAMhB,EAC7B,EAEA8D,EAAOvC,UAAUwB,EAAU,WAC1B,KAn6BgB,EAm6BV/B,KAAK3B,GAAoB,CAC9B2B,KAAK3B,GAp6BU,EAq6Bf2B,KAAK5B,EAAqBJ,EAC1BA,EAAgBgC,IACjB,CACD,EAEA8C,EAAOvC,UAAU4C,EAAW,WAC3BnD,KAAK3B,GAz6BW,EA26BhB,KA96Be,EA86BT2B,KAAK3B,GACVuE,EAAc5C,KAEhB,EAEA8C,EAAOvC,UAAU6C,QAAU,WAC1BpD,KAAKmD,GACN,EAcA,SAASlF,EAAOS,EAAcqB,GAC7B,IAAM9B,EAAS,IAAI6E,EAAOpE,EAAIqB,GAC9B,IACC9B,EAAOM,GAIR,CAHE,MAAOC,GACRP,EAAOkF,IACP,MAAM3E,CACP,CAGA,IAAM4E,EAAUnF,EAAOkF,EAASD,KAAKjF,GACpCmF,EAAgBrG,OAAOqG,SAAWA,EACnC,OAAOA,CACR,CAMA,SAASC,EACR3E,GAEA,OAAO,WAAoD4E,IAAAA,EAAAC,UAAAC,EAC1DxD,KAAA,OAAOvB,EAAM,kBAAMM,EAAU,WAAM,OAAAL,EAAG+E,MAAMD,EAAI,GAAAE,MAAA7C,KAAAyC,GAAO,EAAC,EACzD,CACD,CA+DA,SAASK,IACR,IAAI1E,EAAsBJ,EAI1BA,EAAkB,GAElB,OAAO,WACN,IAAI+E,EAAe/E,EACnB,GAAIA,GAAmBI,EACtBA,EAAsBA,EAAoB4E,OAAOhF,GAGlDA,EAAkBI,EAElB,OAAO2E,CACR,CACD,CAEA,IAAME,EAAe,SAAChE,GACrB,IAAK,IAAMiE,KAAOjE,EAAO,CACxB,IAAMkE,EAAMlE,EAAMiE,GAClB,GAAmB,mBAARC,EACVlE,EAAMiE,GAAOV,EAAOW,QACd,GAAmB,iBAARA,GAA4B,OAARA,KAAkB,UAAWA,GAGlEF,EAAaE,EAEf,CACD,EAoCAC,QAAA5B,SAAAA,EAAA4B,QAAAnB,OAAAA,EAAAmB,QAAApE,OAAAA,EAAAoE,QAAAZ,OAAAA,EAAAY,QAAAxF,MAAAA,EAAAwF,QAAAC,SA5UA,SACCxF,EACAqB,GAEA,OAAO,IAAIsC,EAAS3D,EAAIqB,EACzB,EAuUAkE,QAAAE,YAlCA,SACCC,GAEA,kBACC,IAAIR,EACAS,EAEEC,EAAuBX,IAC7B,IACCU,EAAQD,EAAYX,WAAA,EAAA,GAAAC,MAAA7C,KAAA0C,WASrB,CARE,MAAO/E,GAIRK,OAAkBvB,EAClB,MAAMkB,CACP,CAAC,QACAoF,EAAeU,GAChB,CAEAR,EAAaO,GAEbA,EAAMtH,OAAOqG,SAAWC,EAAO,WAC9B,GAAIO,EACH,IAAK,IAAIW,EAAI,EAAGA,EAAIX,EAAaY,OAAQD,IACxCX,EAAaW,GAAGnB,UAIlBQ,OAAetG,CAChB,GAEA,OAAO+G,CACR,CACD,EAAAJ,QAAAhG,OAAAA,EAAAgG,QAAA7E,gBAnnB0BU,EAAWC,GACpC,OAAO,IAAIF,EAAOC,EAAOC,EAC1B,EAinBAkE,QAAAlF,UAAAA"}
+{"version":3,"file":"signals-core.js","sources":["../src/index.ts"],"sourcesContent":["// An named symbol/brand for detecting Signal instances even when they weren't\n// created using the same signals library version.\nconst BRAND_SYMBOL = Symbol.for(\"preact-signals\");\n\n// Flags for Computed and Effect.\nconst RUNNING = 1 << 0;\nconst NOTIFIED = 1 << 1;\nconst OUTDATED = 1 << 2;\nconst DISPOSED = 1 << 3;\nconst HAS_ERROR = 1 << 4;\nconst TRACKING = 1 << 5;\n\n// A linked list node used to track dependencies (sources) and dependents (targets).\n// Also used to remember the source's last version number that the target saw.\ntype Node = {\n\t// A source whose value the target depends on.\n\t_source: Signal;\n\t_prevSource?: Node;\n\t_nextSource?: Node;\n\n\t// A target that depends on the source and should be notified when the source changes.\n\t_target: Computed | Effect;\n\t_prevTarget?: Node;\n\t_nextTarget?: Node;\n\n\t// The version number of the source that target has last seen. We use version numbers\n\t// instead of storing the source value, because source values can take arbitrary amount\n\t// of memory, and computeds could hang on to them forever because they're lazily evaluated.\n\t// Use the special value -1 to mark potentially unused but recyclable nodes.\n\t_version: number;\n\n\t// Used to remember & roll back the source's previous `._node` value when entering &\n\t// exiting a new evaluation context.\n\t_rollbackNode?: Node;\n};\n\nfunction startBatch() {\n\tbatchDepth++;\n}\n\nfunction endBatch() {\n\tif (batchDepth > 1) {\n\t\tbatchDepth--;\n\t\treturn;\n\t}\n\n\tlet error: unknown;\n\tlet hasError = false;\n\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\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\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 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/**\n * The base class for plain and computed signals.\n */\n// @ts-ignore: \"Cannot redeclare exported variable 'Signal'.\"\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.\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\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\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}\n\n/** @internal */\n// @ts-ignore: \"Cannot redeclare exported variable 'Signal'.\"\n//\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.\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._watched = options?.watched;\n\tthis._unwatched = options?.unwatched;\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\tconst value = this.value;\n\n\t\tconst prevContext = evalContext;\n\t\tevalContext = undefined;\n\t\ttry {\n\t\t\tfn(value);\n\t\t} finally {\n\t\t\tevalContext = prevContext;\n\t\t}\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\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\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\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\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}\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\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\ndeclare class Effect {\n\t_fn?: EffectFn;\n\t_cleanup?: () => void;\n\t_sources?: Node;\n\t_nextBatchedEffect?: Effect;\n\t_flags: number;\n\n\tconstructor(fn: EffectFn);\n\n\t_callback(): void;\n\t_start(): () => void;\n\t_notify(): void;\n\t_dispose(): void;\n\tdispose(): void;\n}\n\nfunction Effect(this: Effect, fn: EffectFn) {\n\tthis._fn = fn;\n\tthis._cleanup = undefined;\n\tthis._sources = undefined;\n\tthis._nextBatchedEffect = undefined;\n\tthis._flags = TRACKING;\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): { (): void; [Symbol.dispose](): void } {\n\tconst effect = new Effect(fn);\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 any;\n}\n\nexport { computed, effect, batch, untracked, Signal, ReadonlySignal };\n"],"names":["BRAND_SYMBOL","Symbol","endBatch","batchDepth","error","hasError","undefined","batchedEffect","effect","batchIteration","next","_nextBatchedEffect","_flags","needsToRecompute","_callback","err","evalContext","untracked","fn","prevContext","globalVersion","addDependency","signal","node","_node","_target","_version","_source","_prevSource","_sources","_nextSource","_prevTarget","_nextTarget","_rollbackNode","_subscribe","Signal","value","options","this","_value","_targets","_watched","watched","_unwatched","unwatched","prototype","brand","_refresh","_this","targets","_this$_watched","call","_unsubscribe","_this2","prev","_this2$_unwatched","subscribe","_this3","valueOf","toString","toJSON","peek","Object","defineProperty","get","set","Error","_notify","target","prepareSources","rollbackNode","cleanupSources","head","Computed","_fn","_globalVersion","OUTDATED","cleanupEffect","cleanup","_cleanup","disposeEffect","endEffect","Effect","finish","_start","bind","_dispose","dispose","exports","batch","computed"],"mappings":"AAEA,IAAMA,EAAeC,WAAW,kBAsChC,SAASC,IACR,KAAIC,EAAa,GAAjB,CAKA,IAAIC,EACAC,GAAW,EAEf,WAAyBC,IAAlBC,EAA6B,CACnC,IAAIC,EAA6BD,EACjCA,OAAgBD,EAEhBG,IAEA,WAAkBH,IAAXE,EAAsB,CAC5B,IAAME,EAA2BF,EAAOG,EACxCH,EAAOG,OAAqBL,EAC5BE,EAAOI,IAAU,EAEjB,KApDc,EAoDRJ,EAAOI,IAAsBC,EAAiBL,GACnD,IACCA,EAAOM,GAMR,CALE,MAAOC,GACR,IAAKV,EAAU,CACdD,EAAQW,EACRV,GAAW,CACZ,CACD,CAEDG,EAASE,CACV,CACD,CACAD,EAAiB,EACjBN,IAEA,GAAIE,EACH,MAAMD,CAjCP,MAFCD,GAqCF,CA2BA,IAAIa,OAA6CV,EASjD,SAASW,EAAaC,GACrB,IAAMC,EAAcH,EACpBA,OAAcV,EACd,IACC,OAAOY,GAGR,CAFC,QACAF,EAAcG,CACf,CACD,CAGA,IAAIZ,OAAoCD,EACpCH,EAAa,EACbM,EAAiB,EAIjBW,EAAgB,EAEpB,SAASC,EAAcC,GACtB,QAAoBhB,IAAhBU,EAAJ,CAIA,IAAIO,EAAOD,EAAOE,EAClB,QAAalB,IAATiB,GAAsBA,EAAKE,IAAYT,EAAa,CAavDO,EAAO,CACNG,EAAU,EACVC,EAASL,EACTM,EAAaZ,EAAYa,EACzBC,OAAaxB,EACbmB,EAAST,EACTe,OAAazB,EACb0B,OAAa1B,EACb2B,EAAeV,GAGhB,QAA6BjB,IAAzBU,EAAYa,EACfb,EAAYa,EAASC,EAAcP,EAEpCP,EAAYa,EAAWN,EACvBD,EAAOE,EAAQD,EAIf,GAlKe,GAkKXP,EAAYJ,EACfU,EAAOY,EAAWX,GAEnB,OAAOA,CACR,MAAO,IAAuB,IAAnBA,EAAKG,EAAiB,CAEhCH,EAAKG,EAAW,EAehB,QAAyBpB,IAArBiB,EAAKO,EAA2B,CACnCP,EAAKO,EAAYF,EAAcL,EAAKK,EAEpC,QAAyBtB,IAArBiB,EAAKK,EACRL,EAAKK,EAAYE,EAAcP,EAAKO,EAGrCP,EAAKK,EAAcZ,EAAYa,EAC/BN,EAAKO,OAAcxB,EAEnBU,EAAYa,EAAUC,EAAcP,EACpCP,EAAYa,EAAWN,CACxB,CAIA,OAAOA,CACR,CAzEA,CA2ED,CA2EA,SAASY,EAAqBC,EAAiBC,GAC9CC,KAAKC,EAASH,EACdE,KAAKZ,EAAW,EAChBY,KAAKd,OAAQlB,EACbgC,KAAKE,OAAWlC,EAChBgC,KAAKG,EAAWJ,MAAAA,OAAAA,EAAAA,EAASK,QACzBJ,KAAKK,EAAoB,MAAPN,OAAO,EAAPA,EAASO,SAC5B,CAEAT,EAAOU,UAAUC,MAAQ9C,EAEzBmC,EAAOU,UAAUE,EAAW,WAC3B,OAAO,CACR,EAEAZ,EAAOU,UAAUX,EAAa,SAAUX,GAAI,IAAAyB,EAC3CV,KAAMW,EAAUX,KAAKE,EACrB,GAAIS,IAAY1B,QAA6BjB,IAArBiB,EAAKQ,EAA2B,CACvDR,EAAKS,EAAciB,EACnBX,KAAKE,EAAWjB,EAEhB,QAAgBjB,IAAZ2C,EACHA,EAAQlB,EAAcR,OAEtBN,EAAU,WAAKiC,IAAAA,EACdA,OAAAA,EAAAF,EAAKP,IAALS,EAAeC,KAAKH,EACrB,EAEF,CACD,EAEAb,EAAOU,UAAUO,EAAe,SAAU7B,OAAI8B,EAAAf,KAE7C,QAAsBhC,IAAlBgC,KAAKE,EAAwB,CAChC,IAAMc,EAAO/B,EAAKQ,EACZrB,EAAOa,EAAKS,EAClB,QAAa1B,IAATgD,EAAoB,CACvBA,EAAKtB,EAActB,EACnBa,EAAKQ,OAAczB,CACpB,CAEA,QAAaA,IAATI,EAAoB,CACvBA,EAAKqB,EAAcuB,EACnB/B,EAAKS,OAAc1B,CACpB,CAEA,GAAIiB,IAASe,KAAKE,EAAU,CAC3BF,KAAKE,EAAW9B,EAChB,QAAaJ,IAATI,EACHO,EAAU,WAAK,IAAAsC,EACC,OAAfA,EAAAF,EAAKV,IAALY,EAAiBJ,KAAKE,EACvB,EAEF,CACD,CACD,EAEAlB,EAAOU,UAAUW,UAAY,SAAUtC,GAAEuC,IAAAA,OACxC,OAAOjD,EAAO,WACb,IAAM4B,EAAQqB,EAAKrB,MAEbjB,EAAcH,EACpBA,OAAcV,EACd,IACCY,EAAGkB,EAGJ,CAFC,QACApB,EAAcG,CACf,CACD,EACD,EAEAgB,EAAOU,UAAUa,QAAU,WAC1B,OAAWpB,KAACF,KACb,EAEAD,EAAOU,UAAUc,SAAW,WAC3B,OAAOrB,KAAKF,MAAQ,EACrB,EAEAD,EAAOU,UAAUe,OAAS,WACzB,OAAOtB,KAAKF,KACb,EAEAD,EAAOU,UAAUgB,KAAO,WACvB,IAAM1C,EAAcH,EACpBA,OAAcV,EACd,IACC,OAAWgC,KAACF,KAGb,CAFC,QACApB,EAAcG,CACf,CACD,EAEA2C,OAAOC,eAAe5B,EAAOU,UAAW,QAAS,CAChDmB,IAAA,WACC,IAAMzC,EAAOF,EAAciB,MAC3B,QAAahC,IAATiB,EACHA,EAAKG,EAAWY,KAAKZ,EAEtB,OAAOY,KAAKC,CACb,EACA0B,IAAG,SAAe7B,GACjB,GAAIA,IAAUE,KAAKC,EAAQ,CAC1B,GAAI9B,EAAiB,IACpB,MAAU,IAAAyD,MAAM,kBAGjB5B,KAAKC,EAASH,EACdE,KAAKZ,IACLN,IAvWFjB,IA0WE,IACC,IACC,IAAIoB,EAAOe,KAAKE,OACPlC,IAATiB,EACAA,EAAOA,EAAKS,EAEZT,EAAKE,EAAQ0C,GAIf,CAFC,QACAjE,GACD,CACD,CACD,IAeD,SAASW,EAAiBuD,GAIzB,IACC,IAAI7C,EAAO6C,EAAOvC,OACTvB,IAATiB,EACAA,EAAOA,EAAKO,EAEZ,GAKCP,EAAKI,EAAQD,IAAaH,EAAKG,IAG9BH,EAAKI,EAAQoB,KAEdxB,EAAKI,EAAQD,IAAaH,EAAKG,EAE/B,OAAO,EAKT,OACD,CAAA,CAEA,SAAS2C,EAAeD,GAavB,IACC,IAAI7C,EAAO6C,EAAOvC,OACTvB,IAATiB,EACAA,EAAOA,EAAKO,EACX,CACD,IAAMwC,EAAe/C,EAAKI,EAAQH,EAClC,QAAqBlB,IAAjBgE,EACH/C,EAAKU,EAAgBqC,EAEtB/C,EAAKI,EAAQH,EAAQD,EACrBA,EAAKG,GAAY,EAEjB,QAAyBpB,IAArBiB,EAAKO,EAA2B,CACnCsC,EAAOvC,EAAWN,EAClB,KACD,CACD,CACD,CAEA,SAASgD,EAAeH,GACvB,IAAI7C,EAAO6C,EAAOvC,EACd2C,OAAyBlE,EAO7B,WAAgBA,IAATiB,EAAoB,CAC1B,IAAM+B,EAAO/B,EAAKK,EAUlB,IAAuB,IAAnBL,EAAKG,EAAiB,CACzBH,EAAKI,EAAQyB,EAAa7B,GAE1B,QAAajB,IAATgD,EACHA,EAAKxB,EAAcP,EAAKO,EAEzB,QAAyBxB,IAArBiB,EAAKO,EACRP,EAAKO,EAAYF,EAAc0B,CAEjC,MAWCkB,EAAOjD,EAGRA,EAAKI,EAAQH,EAAQD,EAAKU,EAC1B,QAA2B3B,IAAvBiB,EAAKU,EACRV,EAAKU,OAAgB3B,EAGtBiB,EAAO+B,CACR,CAEAc,EAAOvC,EAAW2C,CACnB,CAcA,SAASC,EAAyBvD,EAAmBmB,GACpDF,EAAOgB,KAAKb,UAAMhC,GAElBgC,KAAKoC,EAAMxD,EACXoB,KAAKT,OAAWvB,EAChBgC,KAAKqC,EAAiBvD,EAAgB,EACtCkB,KAAK1B,EAxiBW,EAyiBhB0B,KAAKG,EAAkB,MAAPJ,OAAO,EAAPA,EAASK,QACzBJ,KAAKK,EAAoB,MAAPN,OAAO,EAAPA,EAASO,SAC5B,CAEA6B,EAAS5B,UAAY,IAAIV,EAEzBsC,EAAS5B,UAAUE,EAAW,WAC7BT,KAAK1B,IAAU,EAEf,GApjBe,EAojBX0B,KAAK1B,EACR,OACD,EAKA,GAtjBgB,KAsjBIgE,GAAftC,KAAK1B,GACT,SAED0B,KAAK1B,IAAU,EAEf,GAAI0B,KAAKqC,IAAmBvD,EAC3B,OAAO,EAERkB,KAAKqC,EAAiBvD,EAItBkB,KAAK1B,GAvkBU,EAwkBf,GAAI0B,KAAKZ,EAAW,IAAMb,EAAiByB,MAAO,CACjDA,KAAK1B,IAAU,EACf,OAAO,CACR,CAEA,IAAMO,EAAcH,EACpB,IACCqD,EAAe/B,MACftB,EAAcsB,KACd,IAAMF,EAAQE,KAAKoC,IACnB,GA9kBgB,GA+kBfpC,KAAK1B,GACL0B,KAAKC,IAAWH,GACE,IAAlBE,KAAKZ,EACJ,CACDY,KAAKC,EAASH,EACdE,KAAK1B,IAAU,GACf0B,KAAKZ,GACN,CAKD,CAJE,MAAOX,GACRuB,KAAKC,EAASxB,EACduB,KAAK1B,GAzlBW,GA0lBhB0B,KAAKZ,GACN,CACAV,EAAcG,EACdoD,EAAejC,MACfA,KAAK1B,IAAU,EACf,OAAO,CACR,EAEA6D,EAAS5B,UAAUX,EAAa,SAAUX,GACzC,QAAsBjB,IAAlBgC,KAAKE,EAAwB,CAChCF,KAAK1B,GAAUgE,GAIf,IACC,IAAIrD,EAAOe,KAAKT,OACPvB,IAATiB,EACAA,EAAOA,EAAKO,EAEZP,EAAKI,EAAQO,EAAWX,EAE1B,CACAY,EAAOU,UAAUX,EAAWiB,KAAKb,KAAMf,EACxC,EAEAkD,EAAS5B,UAAUO,EAAe,SAAU7B,GAE3C,QAAsBjB,IAAlBgC,KAAKE,EAAwB,CAChCL,EAAOU,UAAUO,EAAaD,KAAKb,KAAMf,GAIzC,QAAsBjB,IAAlBgC,KAAKE,EAAwB,CAChCF,KAAK1B,IAAU,GAEf,IACC,IAAIW,EAAOe,KAAKT,OACPvB,IAATiB,EACAA,EAAOA,EAAKO,EAEZP,EAAKI,EAAQyB,EAAa7B,EAE5B,CACD,CACD,EAEAkD,EAAS5B,UAAUsB,EAAU,WAC5B,KA5oBgB,EA4oBV7B,KAAK1B,GAAoB,CAC9B0B,KAAK1B,GAAUgE,EAEf,IACC,IAAIrD,EAAOe,KAAKE,OACPlC,IAATiB,EACAA,EAAOA,EAAKS,EAEZT,EAAKE,EAAQ0C,GAEf,CACD,EAEAL,OAAOC,eAAeU,EAAS5B,UAAW,QAAS,CAClDmB,eACC,GA5pBc,EA4pBV1B,KAAK1B,EACR,MAAU,IAAAsD,MAAM,kBAEjB,IAAM3C,EAAOF,EAAciB,MAC3BA,KAAKS,IACL,QAAazC,IAATiB,EACHA,EAAKG,EAAWY,KAAKZ,EAEtB,GAhqBgB,GAgqBZY,KAAK1B,EACR,MAAU0B,KAACC,EAEZ,OAAWD,KAACC,CACb,IAiCD,SAASsC,EAAcrE,GACtB,IAAMsE,EAAUtE,EAAOuE,EACvBvE,EAAOuE,OAAWzE,EAElB,GAAuB,mBAAZwE,EAAwB,CA7qBnC3E,IAirBC,IAAMgB,EAAcH,EACpBA,OAAcV,EACd,IACCwE,GASD,CARE,MAAO/D,GACRP,EAAOI,IAAU,EACjBJ,EAAOI,GAptBO,EAqtBdoE,EAAcxE,GACd,MAAMO,CACP,CAAC,QACAC,EAAcG,EACdjB,GACD,CACD,CACD,CAEA,SAAS8E,EAAcxE,GACtB,IACC,IAAIe,EAAOf,EAAOqB,OACTvB,IAATiB,EACAA,EAAOA,EAAKO,EAEZP,EAAKI,EAAQyB,EAAa7B,GAE3Bf,EAAOkE,OAAMpE,EACbE,EAAOqB,OAAWvB,EAElBuE,EAAcrE,EACf,CAEA,SAASyE,EAAwB9D,GAChC,GAAIH,IAAgBsB,KACnB,MAAU,IAAA4B,MAAM,uBAEjBK,EAAejC,MACftB,EAAcG,EAEdmB,KAAK1B,IAAU,EACf,GApvBgB,EAovBZ0B,KAAK1B,EACRoE,EAAc1C,MAEfpC,GACD,CAsBA,SAASgF,EAAqBhE,GAC7BoB,KAAKoC,EAAMxD,EACXoB,KAAKyC,OAAWzE,EAChBgC,KAAKT,OAAWvB,EAChBgC,KAAK3B,OAAqBL,EAC1BgC,KAAK1B,EAjxBW,EAkxBjB,CAEAsE,EAAOrC,UAAU/B,EAAY,WAC5B,IAAMqE,EAAS7C,KAAK8C,IACpB,IACC,GAzxBe,EAyxBX9C,KAAK1B,EAAmB,OAC5B,QAAiBN,IAAbgC,KAAKoC,EAAmB,OAE5B,IAAMI,EAAUxC,KAAKoC,IACrB,GAAuB,mBAAZI,EACVxC,KAAKyC,EAAWD,CAIlB,CAFC,QACAK,GACD,CACD,EAEAD,EAAOrC,UAAUuC,EAAS,WACzB,GAzyBe,EAyyBX9C,KAAK1B,EACR,UAAUsD,MAAM,kBAEjB5B,KAAK1B,GA5yBU,EA6yBf0B,KAAK1B,IAAU,EACfiE,EAAcvC,MACd+B,EAAe/B,MA/wBfnC,IAkxBA,IAAMgB,EAAcH,EACpBA,EAAcsB,KACd,OAAO2C,EAAUI,KAAK/C,KAAMnB,EAC7B,EAEA+D,EAAOrC,UAAUsB,EAAU,WAC1B,KAvzBgB,EAuzBV7B,KAAK1B,GAAoB,CAC9B0B,KAAK1B,GAxzBU,EAyzBf0B,KAAK3B,EAAqBJ,EAC1BA,EAAgB+B,IACjB,CACD,EAEA4C,EAAOrC,UAAUyC,EAAW,WAC3BhD,KAAK1B,GA7zBW,EA+zBhB,KAl0Be,EAk0BT0B,KAAK1B,GACVoE,EAAc1C,KAEhB,EAEA4C,EAAOrC,UAAU0C,QAAU,WAC1BjD,KAAKgD,GACN,EAcA,SAAS9E,EAAOU,GACf,IAAMV,EAAS,IAAI0E,EAAOhE,GAC1B,IACCV,EAAOM,GAIR,CAHE,MAAOC,GACRP,EAAO8E,IACP,MAAMvE,CACP,CAGA,IAAMwE,EAAU/E,EAAO8E,EAASD,KAAK7E,GACpC+E,EAAgBtF,OAAOsF,SAAWA,EACnC,OAAOA,CACR,CAAAC,QAAArD,OAAAA,EAAAqD,QAAAC,MA5wBA,SAAkBvE,GACjB,GAAIf,EAAa,EAChB,OAAOe,IA1DRf,IA6DA,IACC,OAAOe,GAGR,CAFC,QACAhB,GACD,CACD,EAkwBAsF,QAAAE,SAlKA,SACCxE,EACAmB,GAEA,WAAWoC,EAASvD,EAAImB,EACzB,EA6JAmD,QAAAhF,OAAAA,EAAAgF,QAAAlE,OAncgB,SAAUc,EAAWC,GACpC,OAAW,IAAAF,EAAOC,EAAOC,EAC1B,EAicAmD,QAAAvE,UAAAA"}

package/types/ThemeProvider.d.ts

@@ -25,7 +25,7 @@ interface ThemeProviderProps {
     theme?: string;
     themeMode?: ThemeMode;
 }
-export declare function ThemeProvider({ applyThemeClasses, children, theme: themeProp, themeMode: themeModeProp, density: densityProp, }: ThemeProviderProps): import("react").JSX.Element;
+export declare function ThemeProvider({ applyThemeClasses, children, theme: themeProp, themeMode: themeModeProp, density: densityProp, }: ThemeProviderProps): import("react/jsx-runtime").JSX.Element;
 export declare namespace ThemeProvider {
     var displayName: string;
 }

package/types/array-utils.d.ts

@@ -1,11 +1,12 @@
 export type PartitionTest<T> = (value: T, index: number) => boolean;
+export type ItemComparator<T> = (firstItem: T, secondItem: T) => boolean;
 export declare function partition<T>(array: T[], test: PartitionTest<T>, pass?: T[], fail?: T[]): [T[], T[]];
 export declare function itemsChanged<T = unknown>(currentItems: readonly T[], newItems: readonly T[], identityProperty?: string): boolean;
 export declare function itemsOrOrderChanged<T = unknown>(currentItems: readonly T[], newItems: readonly T[], identityProperty?: string): boolean;
 export declare const moveItemDeprecated: <T = unknown>(items: T[], item: T, moveTo: number) => T[];
 export declare const moveItem: <T = unknown>(items: T[], fromIndex: number, toIndex: number) => T[];
-export declare const getAddedItems: <T>(currentItems: undefined | readonly T[], newItems: readonly T[]) => readonly T[];
-export declare const getRemovedItems: <T>(currentItems: readonly T[], newItems: undefined | readonly T[]) => readonly T[];
+export declare const getAddedItems: <T>(currentItems: undefined | readonly T[], newItems: readonly T[], compareItems?: ItemComparator<T>) => readonly T[];
+export declare const getRemovedItems: <T>(currentItems: readonly T[], newItems: undefined | readonly T[], compareItems?: ItemComparator<T>) => readonly T[];
 export declare const containsSubsetOfItems: <T>(allItems: readonly T[], comparedItems: readonly T[]) => boolean;
 export declare const getMissingItems: <T, I>(sourceItems: readonly T[], items: readonly I[], identity: (s: T) => I) => I[];
 /**