@reckona/mreact-reactive-core 0.0.153 → 0.0.154

package/dist/batch.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"batch.d.ts","sourceRoot":"","sources":["../src/batch.ts"],"names":[],"mappings":"AAIA,wBAAgB,KAAK,CAAC,CAAC,EAAE,EAAE,EAAE,MAAM,CAAC,GAAG,CAAC,CAavC;AAED,wBAAsB,UAAU,CAAC,CAAC,EAAE,EAAE,EAAE,MAAM,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAaxE"}
+{"version":3,"file":"batch.d.ts","sourceRoot":"","sources":["../src/batch.ts"],"names":[],"mappings":"AAKA,wBAAgB,KAAK,CAAC,CAAC,EAAE,EAAE,EAAE,MAAM,CAAC,GAAG,CAAC,CAcvC;AAED,wBAAsB,UAAU,CAAC,CAAC,EAAE,EAAE,EAAE,MAAM,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAcxE"}

package/dist/batch.js

@@ -1,7 +1,9 @@
 import { runtimeState } from "./state.js";
+import { invalidateDevtoolsWriteCache } from "./cell.js";
 import { schedulePendingFlush } from "./scheduler.js";
 import { flushPendingComputed } from "./tracking.js";
 export function batch(fn) {
+    invalidateDevtoolsWriteCache();
     runtimeState.batchDepth += 1;
     try {
         return fn();
@@ -15,6 +17,7 @@ export function batch(fn) {
     }
 }
 export async function batchAsync(fn) {
+    invalidateDevtoolsWriteCache();
     runtimeState.batchDepth += 1;
     try {
         return await fn();

package/dist/batch.js.map

@@ -1 +1 @@
-{"version":3,"file":"batch.js","sourceRoot":"","sources":["../src/batch.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,YAAY,EAAE,MAAM,YAAY,CAAC;AAC1C,OAAO,EAAE,oBAAoB,EAAE,MAAM,gBAAgB,CAAC;AACtD,OAAO,EAAE,oBAAoB,EAAE,MAAM,eAAe,CAAC;AAErD,MAAM,UAAU,KAAK,CAAI,EAAW;IAClC,YAAY,CAAC,UAAU,IAAI,CAAC,CAAC;IAE7B,IAAI,CAAC;QACH,OAAO,EAAE,EAAE,CAAC;IACd,CAAC;YAAS,CAAC;QACT,YAAY,CAAC,UAAU,IAAI,CAAC,CAAC;QAE7B,IAAI,YAAY,CAAC,UAAU,KAAK,CAAC,EAAE,CAAC;YAClC,oBAAoB,EAAE,CAAC;YACvB,oBAAoB,EAAE,CAAC;QACzB,CAAC;IACH,CAAC;AACH,CAAC;AAED,MAAM,CAAC,KAAK,UAAU,UAAU,CAAI,EAAwB;IAC1D,YAAY,CAAC,UAAU,IAAI,CAAC,CAAC;IAE7B,IAAI,CAAC;QACH,OAAO,MAAM,EAAE,EAAE,CAAC;IACpB,CAAC;YAAS,CAAC;QACT,YAAY,CAAC,UAAU,IAAI,CAAC,CAAC;QAE7B,IAAI,YAAY,CAAC,UAAU,KAAK,CAAC,EAAE,CAAC;YAClC,oBAAoB,EAAE,CAAC;YACvB,oBAAoB,EAAE,CAAC;QACzB,CAAC;IACH,CAAC;AACH,CAAC","sourcesContent":["import { runtimeState } from \"./state.js\";\nimport { schedulePendingFlush } from \"./scheduler.js\";\nimport { flushPendingComputed } from \"./tracking.js\";\n\nexport function batch<T>(fn: () => T): T {\n  runtimeState.batchDepth += 1;\n\n  try {\n    return fn();\n  } finally {\n    runtimeState.batchDepth -= 1;\n\n    if (runtimeState.batchDepth === 0) {\n      flushPendingComputed();\n      schedulePendingFlush();\n    }\n  }\n}\n\nexport async function batchAsync<T>(fn: () => Promise<T> | T): Promise<T> {\n  runtimeState.batchDepth += 1;\n\n  try {\n    return await fn();\n  } finally {\n    runtimeState.batchDepth -= 1;\n\n    if (runtimeState.batchDepth === 0) {\n      flushPendingComputed();\n      schedulePendingFlush();\n    }\n  }\n}\n"]}
+{"version":3,"file":"batch.js","sourceRoot":"","sources":["../src/batch.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,YAAY,EAAE,MAAM,YAAY,CAAC;AAC1C,OAAO,EAAE,4BAA4B,EAAE,MAAM,WAAW,CAAC;AACzD,OAAO,EAAE,oBAAoB,EAAE,MAAM,gBAAgB,CAAC;AACtD,OAAO,EAAE,oBAAoB,EAAE,MAAM,eAAe,CAAC;AAErD,MAAM,UAAU,KAAK,CAAI,EAAW;IAClC,4BAA4B,EAAE,CAAC;IAC/B,YAAY,CAAC,UAAU,IAAI,CAAC,CAAC;IAE7B,IAAI,CAAC;QACH,OAAO,EAAE,EAAE,CAAC;IACd,CAAC;YAAS,CAAC;QACT,YAAY,CAAC,UAAU,IAAI,CAAC,CAAC;QAE7B,IAAI,YAAY,CAAC,UAAU,KAAK,CAAC,EAAE,CAAC;YAClC,oBAAoB,EAAE,CAAC;YACvB,oBAAoB,EAAE,CAAC;QACzB,CAAC;IACH,CAAC;AACH,CAAC;AAED,MAAM,CAAC,KAAK,UAAU,UAAU,CAAI,EAAwB;IAC1D,4BAA4B,EAAE,CAAC;IAC/B,YAAY,CAAC,UAAU,IAAI,CAAC,CAAC;IAE7B,IAAI,CAAC;QACH,OAAO,MAAM,EAAE,EAAE,CAAC;IACpB,CAAC;YAAS,CAAC;QACT,YAAY,CAAC,UAAU,IAAI,CAAC,CAAC;QAE7B,IAAI,YAAY,CAAC,UAAU,KAAK,CAAC,EAAE,CAAC;YAClC,oBAAoB,EAAE,CAAC;YACvB,oBAAoB,EAAE,CAAC;QACzB,CAAC;IACH,CAAC;AACH,CAAC","sourcesContent":["import { runtimeState } from \"./state.js\";\nimport { invalidateDevtoolsWriteCache } from \"./cell.js\";\nimport { schedulePendingFlush } from \"./scheduler.js\";\nimport { flushPendingComputed } from \"./tracking.js\";\n\nexport function batch<T>(fn: () => T): T {\n  invalidateDevtoolsWriteCache();\n  runtimeState.batchDepth += 1;\n\n  try {\n    return fn();\n  } finally {\n    runtimeState.batchDepth -= 1;\n\n    if (runtimeState.batchDepth === 0) {\n      flushPendingComputed();\n      schedulePendingFlush();\n    }\n  }\n}\n\nexport async function batchAsync<T>(fn: () => Promise<T> | T): Promise<T> {\n  invalidateDevtoolsWriteCache();\n  runtimeState.batchDepth += 1;\n\n  try {\n    return await fn();\n  } finally {\n    runtimeState.batchDepth -= 1;\n\n    if (runtimeState.batchDepth === 0) {\n      flushPendingComputed();\n      schedulePendingFlush();\n    }\n  }\n}\n"]}

package/dist/cell.d.ts

@@ -1,3 +1,4 @@
 import type { Cell } from "./types.js";
+export declare function invalidateDevtoolsWriteCache(): void;
 export declare function cell<T>(initial: T): Cell<T>;
 //# sourceMappingURL=cell.d.ts.map

package/dist/cell.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"cell.d.ts","sourceRoot":"","sources":["../src/cell.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,YAAY,CAAC;AAUvC,wBAAgB,IAAI,CAAC,CAAC,EAAE,OAAO,EAAE,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAgD3C"}
+{"version":3,"file":"cell.d.ts","sourceRoot":"","sources":["../src/cell.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,YAAY,CAAC;AA4BvC,wBAAgB,4BAA4B,IAAI,IAAI,CAInD;AAqED,wBAAgB,IAAI,CAAC,CAAC,EAAE,OAAO,EAAE,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAiB3C"}

package/dist/cell.js

@@ -1,44 +1,83 @@
-import { notifySubscribers, trackSource } from "./tracking.js";
+import { notifySubscribers, sourceSubscriberCount, trackSource } from "./tracking.js";
 const clientDevtoolsDisabled = typeof __MREACT_CLIENT_DEVTOOLS__ !== "undefined" &&
     __MREACT_CLIENT_DEVTOOLS__ === false;
+// Write-path devtools cache: `undefined` = not sampled yet, `null` = sampled
+// and absent, object = sampled and attached. The no-devtools write fast path
+// is a single module-local null comparison instead of a globalThis property
+// walk per write. A late attach is observed at the next batch or flush
+// boundary (see invalidateDevtoolsWriteCache callers); a detach or hook swap
+// is observed on the next write because the emit path revalidates identity.
+let cachedDevtoolsHook = clientDevtoolsDisabled
+    ? null
+    : undefined;
+export function invalidateDevtoolsWriteCache() {
+    if (!clientDevtoolsDisabled) {
+        cachedDevtoolsHook = undefined;
+    }
+}
+function resolveDevtoolsHook() {
+    const hook = globalThis.__mreactDevtools;
+    const resolved = hook !== undefined && typeof hook.emit === "function" ? hook : null;
+    cachedDevtoolsHook = resolved;
+    return resolved;
+}
+function emitCellSetEvent(source, previous, value) {
+    // Cold path: only reached while a devtools hook is (or was) attached, or on
+    // the first write after a cache invalidation. Revalidate against the live
+    // global so a disposed or swapped hook never receives stale events.
+    const live = globalThis.__mreactDevtools;
+    const hook = cachedDevtoolsHook !== undefined && cachedDevtoolsHook === live
+        ? cachedDevtoolsHook
+        : resolveDevtoolsHook();
+    if (hook === null) {
+        return;
+    }
+    const emit = hook.emit;
+    if (typeof emit !== "function") {
+        return;
+    }
+    emit.call(hook, {
+        package: "@reckona/mreact-reactive-core",
+        previous,
+        subscribers: sourceSubscriberCount(source),
+        timestamp: Date.now(),
+        type: "reactive:cell:set",
+        value,
+    });
+}
+// One shared write function keeps the hot store/notify sequence in a single
+// optimizable function instead of a fresh fat closure per cell.
+function writeCellValue(state, next) {
+    const previous = state.value;
+    const resolved = typeof next === "function" ? next(previous) : next;
+    if (Object.is(previous, resolved)) {
+        return;
+    }
+    state.value = resolved;
+    // clientDevtoolsDisabled folds to true under the client build define, which
+    // makes this branch statically dead so bundlers drop the emit path (and its
+    // globalThis.__mreactDevtools references) from production client bundles.
+    if (!clientDevtoolsDisabled && cachedDevtoolsHook !== null) {
+        emitCellSetEvent(state.source, previous, resolved);
+    }
+    if (state.source.subscribers !== null) {
+        notifySubscribers(state.source);
+    }
+}
 export function cell(initial) {
-    let current = initial;
-    const source = {
-        subscribers: new Set(),
+    const state = {
+        source: {
+            subscribers: null,
+        },
+        value: initial,
     };
     return {
         get() {
-            trackSource(source);
-            return current;
+            trackSource(state.source);
+            return state.value;
         },
         set(next) {
-            const resolved = typeof next === "function" ? next(current) : next;
-            if (Object.is(current, resolved)) {
-                return;
-            }
-            if (clientDevtoolsDisabled) {
-                current = resolved;
-            }
-            else {
-                const devtools = globalThis.__mreactDevtools;
-                const emit = devtools?.emit;
-                if (typeof emit !== "function") {
-                    current = resolved;
-                }
-                else {
-                    const previous = current;
-                    current = resolved;
-                    emit.call(devtools, {
-                        package: "@reckona/mreact-reactive-core",
-                        previous,
-                        subscribers: source.subscribers.size,
-                        timestamp: Date.now(),
-                        type: "reactive:cell:set",
-                        value: resolved,
-                    });
-                }
-            }
-            notifySubscribers(source);
+            writeCellValue(state, next);
         },
     };
 }

package/dist/cell.js.map

@@ -1 +1 @@
-{"version":3,"file":"cell.js","sourceRoot":"","sources":["../src/cell.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,iBAAiB,EAAE,WAAW,EAAE,MAAM,eAAe,CAAC;AAI/D,MAAM,sBAAsB,GAC1B,OAAO,0BAA0B,KAAK,WAAW;IACjD,0BAA0B,KAAK,KAAK,CAAC;AAEvC,MAAM,UAAU,IAAI,CAAI,OAAU;IAChC,IAAI,OAAO,GAAG,OAAO,CAAC;IACtB,MAAM,MAAM,GAAW;QACrB,WAAW,EAAE,IAAI,GAAG,EAAE;KACvB,CAAC;IAEF,OAAO;QACL,GAAG;YACD,WAAW,CAAC,MAAM,CAAC,CAAC;YACpB,OAAO,OAAO,CAAC;QACjB,CAAC;QACD,GAAG,CAAC,IAA0B;YAC5B,MAAM,QAAQ,GAAG,OAAO,IAAI,KAAK,UAAU,CAAC,CAAC,CAAE,IAAuB,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;YAEvF,IAAI,MAAM,CAAC,EAAE,CAAC,OAAO,EAAE,QAAQ,CAAC,EAAE,CAAC;gBACjC,OAAO;YACT,CAAC;YAED,IAAI,sBAAsB,EAAE,CAAC;gBAC3B,OAAO,GAAG,QAAQ,CAAC;YACrB,CAAC;iBAAM,CAAC;gBACN,MAAM,QAAQ,GACZ,UAKD,CAAC,gBAAgB,CAAC;gBACnB,MAAM,IAAI,GAAG,QAAQ,EAAE,IAAI,CAAC;gBAE5B,IAAI,OAAO,IAAI,KAAK,UAAU,EAAE,CAAC;oBAC/B,OAAO,GAAG,QAAQ,CAAC;gBACrB,CAAC;qBAAM,CAAC;oBACN,MAAM,QAAQ,GAAG,OAAO,CAAC;oBACzB,OAAO,GAAG,QAAQ,CAAC;oBACnB,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAE;wBAClB,OAAO,EAAE,+BAA+B;wBACxC,QAAQ;wBACR,WAAW,EAAE,MAAM,CAAC,WAAW,CAAC,IAAI;wBACpC,SAAS,EAAE,IAAI,CAAC,GAAG,EAAE;wBACrB,IAAI,EAAE,mBAAmB;wBACzB,KAAK,EAAE,QAAQ;qBAChB,CAAC,CAAC;gBACL,CAAC;YACH,CAAC;YACD,iBAAiB,CAAC,MAAM,CAAC,CAAC;QAC5B,CAAC;KACF,CAAC;AACJ,CAAC","sourcesContent":["import type { Cell } from \"./types.js\";\nimport type { Source } from \"./state.js\";\nimport { notifySubscribers, trackSource } from \"./tracking.js\";\n\ndeclare const __MREACT_CLIENT_DEVTOOLS__: boolean | undefined;\n\nconst clientDevtoolsDisabled =\n  typeof __MREACT_CLIENT_DEVTOOLS__ !== \"undefined\" &&\n  __MREACT_CLIENT_DEVTOOLS__ === false;\n\nexport function cell<T>(initial: T): Cell<T> {\n  let current = initial;\n  const source: Source = {\n    subscribers: new Set(),\n  };\n\n  return {\n    get(): T {\n      trackSource(source);\n      return current;\n    },\n    set(next: T | ((prev: T) => T)): void {\n      const resolved = typeof next === \"function\" ? (next as (prev: T) => T)(current) : next;\n\n      if (Object.is(current, resolved)) {\n        return;\n      }\n\n      if (clientDevtoolsDisabled) {\n        current = resolved;\n      } else {\n        const devtools = (\n          globalThis as typeof globalThis & {\n            __mreactDevtools?:\n              | { emit?: (event: Record<string, unknown>) => void }\n              | undefined;\n          }\n        ).__mreactDevtools;\n        const emit = devtools?.emit;\n\n        if (typeof emit !== \"function\") {\n          current = resolved;\n        } else {\n          const previous = current;\n          current = resolved;\n          emit.call(devtools, {\n            package: \"@reckona/mreact-reactive-core\",\n            previous,\n            subscribers: source.subscribers.size,\n            timestamp: Date.now(),\n            type: \"reactive:cell:set\",\n            value: resolved,\n          });\n        }\n      }\n      notifySubscribers(source);\n    },\n  };\n}\n"]}
+{"version":3,"file":"cell.js","sourceRoot":"","sources":["../src/cell.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,iBAAiB,EAAE,qBAAqB,EAAE,WAAW,EAAE,MAAM,eAAe,CAAC;AAItF,MAAM,sBAAsB,GAC1B,OAAO,0BAA0B,KAAK,WAAW;IACjD,0BAA0B,KAAK,KAAK,CAAC;AAUvC,6EAA6E;AAC7E,6EAA6E;AAC7E,4EAA4E;AAC5E,uEAAuE;AACvE,6EAA6E;AAC7E,4EAA4E;AAC5E,IAAI,kBAAkB,GAAoC,sBAAsB;IAC9E,CAAC,CAAC,IAAI;IACN,CAAC,CAAC,SAAS,CAAC;AAEd,MAAM,UAAU,4BAA4B;IAC1C,IAAI,CAAC,sBAAsB,EAAE,CAAC;QAC5B,kBAAkB,GAAG,SAAS,CAAC;IACjC,CAAC;AACH,CAAC;AAED,SAAS,mBAAmB;IAC1B,MAAM,IAAI,GAAI,UAAiC,CAAC,gBAAgB,CAAC;IACjE,MAAM,QAAQ,GAAG,IAAI,KAAK,SAAS,IAAI,OAAO,IAAI,CAAC,IAAI,KAAK,UAAU,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC;IACrF,kBAAkB,GAAG,QAAQ,CAAC;IAC9B,OAAO,QAAQ,CAAC;AAClB,CAAC;AAED,SAAS,gBAAgB,CAAI,MAAc,EAAE,QAAW,EAAE,KAAQ;IAChE,4EAA4E;IAC5E,0EAA0E;IAC1E,oEAAoE;IACpE,MAAM,IAAI,GAAI,UAAiC,CAAC,gBAAgB,CAAC;IACjE,MAAM,IAAI,GACR,kBAAkB,KAAK,SAAS,IAAI,kBAAkB,KAAK,IAAI;QAC7D,CAAC,CAAC,kBAAkB;QACpB,CAAC,CAAC,mBAAmB,EAAE,CAAC;IAE5B,IAAI,IAAI,KAAK,IAAI,EAAE,CAAC;QAClB,OAAO;IACT,CAAC;IAED,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;IAEvB,IAAI,OAAO,IAAI,KAAK,UAAU,EAAE,CAAC;QAC/B,OAAO;IACT,CAAC;IAED,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE;QACd,OAAO,EAAE,+BAA+B;QACxC,QAAQ;QACR,WAAW,EAAE,qBAAqB,CAAC,MAAM,CAAC;QAC1C,SAAS,EAAE,IAAI,CAAC,GAAG,EAAE;QACrB,IAAI,EAAE,mBAAmB;QACzB,KAAK;KACN,CAAC,CAAC;AACL,CAAC;AAOD,4EAA4E;AAC5E,gEAAgE;AAChE,SAAS,cAAc,CAAI,KAAmB,EAAE,IAA0B;IACxE,MAAM,QAAQ,GAAG,KAAK,CAAC,KAAK,CAAC;IAC7B,MAAM,QAAQ,GACZ,OAAO,IAAI,KAAK,UAAU,CAAC,CAAC,CAAE,IAAuB,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;IAEzE,IAAI,MAAM,CAAC,EAAE,CAAC,QAAQ,EAAE,QAAQ,CAAC,EAAE,CAAC;QAClC,OAAO;IACT,CAAC;IAED,KAAK,CAAC,KAAK,GAAG,QAAQ,CAAC;IAEvB,4EAA4E;IAC5E,4EAA4E;IAC5E,0EAA0E;IAC1E,IAAI,CAAC,sBAAsB,IAAI,kBAAkB,KAAK,IAAI,EAAE,CAAC;QAC3D,gBAAgB,CAAC,KAAK,CAAC,MAAM,EAAE,QAAQ,EAAE,QAAQ,CAAC,CAAC;IACrD,CAAC;IAED,IAAI,KAAK,CAAC,MAAM,CAAC,WAAW,KAAK,IAAI,EAAE,CAAC;QACtC,iBAAiB,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;IAClC,CAAC;AACH,CAAC;AAED,MAAM,UAAU,IAAI,CAAI,OAAU;IAChC,MAAM,KAAK,GAAiB;QAC1B,MAAM,EAAE;YACN,WAAW,EAAE,IAAI;SAClB;QACD,KAAK,EAAE,OAAO;KACf,CAAC;IAEF,OAAO;QACL,GAAG;YACD,WAAW,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;YAC1B,OAAO,KAAK,CAAC,KAAK,CAAC;QACrB,CAAC;QACD,GAAG,CAAC,IAA0B;YAC5B,cAAc,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;QAC9B,CAAC;KACF,CAAC;AACJ,CAAC","sourcesContent":["import type { Cell } from \"./types.js\";\nimport type { Source } from \"./state.js\";\nimport { notifySubscribers, sourceSubscriberCount, trackSource } from \"./tracking.js\";\n\ndeclare const __MREACT_CLIENT_DEVTOOLS__: boolean | undefined;\n\nconst clientDevtoolsDisabled =\n  typeof __MREACT_CLIENT_DEVTOOLS__ !== \"undefined\" &&\n  __MREACT_CLIENT_DEVTOOLS__ === false;\n\ninterface DevtoolsHook {\n  emit?: ((event: Record<string, unknown>) => void) | undefined;\n}\n\ntype GlobalWithDevtools = typeof globalThis & {\n  __mreactDevtools?: DevtoolsHook | undefined;\n};\n\n// Write-path devtools cache: `undefined` = not sampled yet, `null` = sampled\n// and absent, object = sampled and attached. The no-devtools write fast path\n// is a single module-local null comparison instead of a globalThis property\n// walk per write. A late attach is observed at the next batch or flush\n// boundary (see invalidateDevtoolsWriteCache callers); a detach or hook swap\n// is observed on the next write because the emit path revalidates identity.\nlet cachedDevtoolsHook: DevtoolsHook | null | undefined = clientDevtoolsDisabled\n  ? null\n  : undefined;\n\nexport function invalidateDevtoolsWriteCache(): void {\n  if (!clientDevtoolsDisabled) {\n    cachedDevtoolsHook = undefined;\n  }\n}\n\nfunction resolveDevtoolsHook(): DevtoolsHook | null {\n  const hook = (globalThis as GlobalWithDevtools).__mreactDevtools;\n  const resolved = hook !== undefined && typeof hook.emit === \"function\" ? hook : null;\n  cachedDevtoolsHook = resolved;\n  return resolved;\n}\n\nfunction emitCellSetEvent<T>(source: Source, previous: T, value: T): void {\n  // Cold path: only reached while a devtools hook is (or was) attached, or on\n  // the first write after a cache invalidation. Revalidate against the live\n  // global so a disposed or swapped hook never receives stale events.\n  const live = (globalThis as GlobalWithDevtools).__mreactDevtools;\n  const hook =\n    cachedDevtoolsHook !== undefined && cachedDevtoolsHook === live\n      ? cachedDevtoolsHook\n      : resolveDevtoolsHook();\n\n  if (hook === null) {\n    return;\n  }\n\n  const emit = hook.emit;\n\n  if (typeof emit !== \"function\") {\n    return;\n  }\n\n  emit.call(hook, {\n    package: \"@reckona/mreact-reactive-core\",\n    previous,\n    subscribers: sourceSubscriberCount(source),\n    timestamp: Date.now(),\n    type: \"reactive:cell:set\",\n    value,\n  });\n}\n\ninterface CellState<T> {\n  value: T;\n  readonly source: Source;\n}\n\n// One shared write function keeps the hot store/notify sequence in a single\n// optimizable function instead of a fresh fat closure per cell.\nfunction writeCellValue<T>(state: CellState<T>, next: T | ((prev: T) => T)): void {\n  const previous = state.value;\n  const resolved =\n    typeof next === \"function\" ? (next as (prev: T) => T)(previous) : next;\n\n  if (Object.is(previous, resolved)) {\n    return;\n  }\n\n  state.value = resolved;\n\n  // clientDevtoolsDisabled folds to true under the client build define, which\n  // makes this branch statically dead so bundlers drop the emit path (and its\n  // globalThis.__mreactDevtools references) from production client bundles.\n  if (!clientDevtoolsDisabled && cachedDevtoolsHook !== null) {\n    emitCellSetEvent(state.source, previous, resolved);\n  }\n\n  if (state.source.subscribers !== null) {\n    notifySubscribers(state.source);\n  }\n}\n\nexport function cell<T>(initial: T): Cell<T> {\n  const state: CellState<T> = {\n    source: {\n      subscribers: null,\n    },\n    value: initial,\n  };\n\n  return {\n    get(): T {\n      trackSource(state.source);\n      return state.value;\n    },\n    set(next: T | ((prev: T) => T)): void {\n      writeCellValue(state, next);\n    },\n  };\n}\n"]}

package/dist/computed.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"computed.d.ts","sourceRoot":"","sources":["../src/computed.ts"],"names":[],"mappings":"AAaA,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,YAAY,CAAC;AAE/C,MAAM,MAAM,gBAAgB,CAAC,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,KAAK,OAAO,CAAC;AAEpE,MAAM,WAAW,eAAe,CAAC,CAAC;IAChC,MAAM,CAAC,EAAE,gBAAgB,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC;CAC1C;AAED,wBAAgB,QAAQ,CAAC,CAAC,EACxB,EAAE,EAAE,MAAM,CAAC,EACX,OAAO,CAAC,EAAE,eAAe,CAAC,CAAC,CAAC,GAAG,gBAAgB,CAAC,CAAC,CAAC,GACjD,YAAY,CAAC,CAAC,CAAC,CA0IjB"}
+{"version":3,"file":"computed.d.ts","sourceRoot":"","sources":["../src/computed.ts"],"names":[],"mappings":"AAaA,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,YAAY,CAAC;AAE/C,MAAM,MAAM,gBAAgB,CAAC,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,KAAK,OAAO,CAAC;AAEpE,MAAM,WAAW,eAAe,CAAC,CAAC;IAChC,MAAM,CAAC,EAAE,gBAAgB,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC;CAC1C;AAED,wBAAgB,QAAQ,CAAC,CAAC,EACxB,EAAE,EAAE,MAAM,CAAC,EACX,OAAO,CAAC,EAAE,eAAe,CAAC,CAAC,CAAC,GAAG,gBAAgB,CAAC,CAAC,CAAC,GACjD,YAAY,CAAC,CAAC,CAAC,CAyIjB"}

package/dist/computed.js

@@ -7,7 +7,7 @@ export function computed(fn, options) {
     let dirty = true;
     const equals = typeof options === "function" ? options : (options?.equals ?? Object.is);
     const source = {
-        subscribers: new Set(),
+        subscribers: null,
     };
     const computation = {
         id: runtimeState.nextComputationId,
@@ -16,12 +16,12 @@ export function computed(fn, options) {
         queued: false,
         markDirty() {
             if (dirty) {
-                if (source.subscribers.size === 0 || computation.queued) {
+                if (source.subscribers === null || computation.queued) {
                     return;
                 }
             }
             dirty = true;
-            if (source.subscribers.size > 0) {
+            if (source.subscribers !== null) {
                 if (runtimeState.notificationDepth > 0) {
                     computation.queued = true;
                     runtimeState.pendingComputed.add(computation);
@@ -44,8 +44,7 @@ export function computed(fn, options) {
             computation.queued = false;
             runtimeState.pendingComputed.delete(computation);
             cleanupDeps(computation);
-            source.subscribers.clear();
-            source.singleSubscriber = undefined;
+            source.subscribers = null;
         },
     };
     runtimeState.nextComputationId += 1;

package/dist/computed.js.map

@@ -1 +1 @@
-{"version":3,"file":"computed.js","sourceRoot":"","sources":["../src/computed.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,oBAAoB,EAAE,MAAM,gBAAgB,CAAC;AACtD,OAAO,EAAE,YAAY,EAAE,MAAM,YAAY,CAAC;AAC1C,OAAO,EACL,gBAAgB,EAChB,WAAW,EACX,oBAAoB,EACpB,sBAAsB,EACtB,iBAAiB,EACjB,2BAA2B,EAC3B,sBAAsB,EACtB,WAAW,GACZ,MAAM,eAAe,CAAC;AASvB,MAAM,UAAU,QAAQ,CACtB,EAAW,EACX,OAAkD;IAElD,IAAI,QAAQ,GAAG,KAAK,CAAC;IACrB,IAAI,KAAQ,CAAC;IACb,IAAI,KAAK,GAAG,IAAI,CAAC;IACjB,MAAM,MAAM,GAAG,OAAO,OAAO,KAAK,UAAU,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,MAAM,IAAI,MAAM,CAAC,EAAE,CAAC,CAAC;IAExF,MAAM,MAAM,GAAW;QACrB,WAAW,EAAE,IAAI,GAAG,EAAE;KACvB,CAAC;IAEF,MAAM,WAAW,GAAwB;QACvC,EAAE,EAAE,YAAY,CAAC,iBAAiB;QAClC,IAAI,EAAE,IAAI,GAAG,EAAE;QACf,QAAQ,EAAE,KAAK;QACf,MAAM,EAAE,KAAK;QACb,SAAS;YACP,IAAI,KAAK,EAAE,CAAC;gBACV,IAAI,MAAM,CAAC,WAAW,CAAC,IAAI,KAAK,CAAC,IAAI,WAAW,CAAC,MAAM,EAAE,CAAC;oBACxD,OAAO;gBACT,CAAC;YACH,CAAC;YAED,KAAK,GAAG,IAAI,CAAC;YAEb,IAAI,MAAM,CAAC,WAAW,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC;gBAChC,IAAI,YAAY,CAAC,iBAAiB,GAAG,CAAC,EAAE,CAAC;oBACvC,WAAW,CAAC,MAAM,GAAG,IAAI,CAAC;oBAC1B,YAAY,CAAC,eAAe,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;oBAC9C,OAAO;gBACT,CAAC;gBAED,gBAAgB,EAAE,CAAC;YACrB,CAAC;QACH,CAAC;QACD,GAAG;YACD,gBAAgB,EAAE,CAAC;QACrB,CAAC;QACD,WAAW,CAAC,MAAM;YAChB,sBAAsB,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC;QAC9C,CAAC;QACD,OAAO;YACL,IAAI,WAAW,CAAC,QAAQ,EAAE,CAAC;gBACzB,OAAO;YACT,CAAC;YAED,WAAW,CAAC,QAAQ,GAAG,IAAI,CAAC;YAC5B,WAAW,CAAC,MAAM,GAAG,KAAK,CAAC;YAC3B,YAAY,CAAC,eAAe,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC;YACjD,WAAW,CAAC,WAAW,CAAC,CAAC;YACzB,MAAM,CAAC,WAAW,CAAC,KAAK,EAAE,CAAC;YAC3B,MAAM,CAAC,gBAAgB,GAAG,SAAS,CAAC;QACtC,CAAC;KACF,CAAC;IAEF,YAAY,CAAC,iBAAiB,IAAI,CAAC,CAAC;IAEpC,SAAS,gBAAgB;QACvB,MAAM,gBAAgB,GAAG,QAAQ,CAAC;QAClC,MAAM,aAAa,GAAG,KAAK,CAAC;QAE5B,IAAI,CAAC;YACH,MAAM,SAAS,GAAG,SAAS,EAAE,CAAC;YAE9B,IAAI,CAAC,gBAAgB,IAAI,CAAC,MAAM,CAAC,aAAa,EAAE,SAAS,CAAC,EAAE,CAAC;gBAC3D,iBAAiB,CAAC,MAAM,CAAC,CAAC;YAC5B,CAAC;QACH,CAAC;QAAC,MAAM,CAAC;YACP,YAAY,CAAC,UAAU,IAAI,CAAC,CAAC;YAE7B,IAAI,CAAC;gBACH,iBAAiB,CAAC,MAAM,CAAC,CAAC;YAC5B,CAAC;oBAAS,CAAC;gBACT,YAAY,CAAC,UAAU,IAAI,CAAC,CAAC;gBAE7B,IAAI,YAAY,CAAC,UAAU,KAAK,CAAC,EAAE,CAAC;oBAClC,oBAAoB,EAAE,CAAC;gBACzB,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAED,SAAS,SAAS;QAChB,IAAI,CAAC,KAAK,IAAI,QAAQ,EAAE,CAAC;YACvB,OAAO,KAAK,CAAC;QACf,CAAC;QAED,MAAM,eAAe,GAAG,YAAY,CAAC,aAAa,CAAC;QACnD,MAAM,gBAAgB,GAAG,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC;QAC/C,MAAM,mBAAmB,GAAG,sBAAsB,CAAC,WAAW,CAAC,CAAC;QAEhE,WAAW,CAAC,iBAAiB,GAAG,EAAE,CAAC;QACnC,WAAW,CAAC,aAAa,GAAG,CAAC,CAAC;QAC9B,WAAW,CAAC,eAAe,GAAG,mBAAmB,CAAC;QAClD,YAAY,CAAC,aAAa,GAAG,WAAW,CAAC;QAEzC,IAAI,CAAC;YACH,MAAM,SAAS,GAAG,EAAE,EAAE,CAAC;YAEvB,MAAM,SAAS,GAAG,WAAW,CAAC,iBAAiB,CAAC;YAChD,MAAM,YAAY,GAAG,WAAW,CAAC,aAAa,IAAI,CAAC,CAAC;YAEpD,IAAI,YAAY,KAAK,gBAAgB,IAAI,CAAC,SAAS,EAAE,MAAM,IAAI,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC;gBACtE,oBAAoB,CAAC,WAAW,EAAE,mBAAmB,CAAC,CAAC;YACzD,CAAC;YAED,KAAK,GAAG,SAAS,CAAC;YAClB,QAAQ,GAAG,IAAI,CAAC;YAChB,KAAK,GAAG,KAAK,CAAC;YAEd,OAAO,KAAK,CAAC;QACf,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,gBAAgB,CAAC,WAAW,CAAC,CAAC;YAC9B,KAAK,GAAG,IAAI,CAAC;YAEb,MAAM,KAAK,CAAC;QACd,CAAC;gBAAS,CAAC;YACT,WAAW,CAAC,iBAAiB,GAAG,SAAS,CAAC;YAC1C,WAAW,CAAC,aAAa,GAAG,SAAS,CAAC;YACtC,WAAW,CAAC,mBAAmB,GAAG,SAAS,CAAC;YAC5C,YAAY,CAAC,aAAa,GAAG,eAAe,CAAC;QAC/C,CAAC;IACH,CAAC;IAED,OAAO;QACL,GAAG;YACD,WAAW,CAAC,MAAM,CAAC,CAAC;YAEpB,IAAI,KAAK,EAAE,CAAC;gBACV,MAAM,aAAa,GAAG,YAAY,CAAC,aAAa,CAAC;gBAEjD,IAAI,aAAa,KAAK,IAAI,IAAI,aAAa,KAAK,WAAW,EAAE,CAAC;oBAC5D,2BAA2B,CAAC,aAAa,CAAC,CAAC;gBAC7C,CAAC;YACH,CAAC;YAED,OAAO,SAAS,EAAE,CAAC;QACrB,CAAC;KACF,CAAC;AACJ,CAAC","sourcesContent":["import type { ReactiveComputation, Source } from \"./state.js\";\nimport { schedulePendingFlush } from \"./scheduler.js\";\nimport { runtimeState } from \"./state.js\";\nimport {\n  cleanupAddedDeps,\n  cleanupDeps,\n  cleanupUntrackedDeps,\n  nextTrackingVersionFor,\n  notifySubscribers,\n  preserveIncrementalTracking,\n  trackIncrementalSource,\n  trackSource,\n} from \"./tracking.js\";\nimport type { ReadonlyCell } from \"./types.js\";\n\nexport type ComputedEquality<T> = (previous: T, next: T) => boolean;\n\nexport interface ComputedOptions<T> {\n  equals?: ComputedEquality<T> | undefined;\n}\n\nexport function computed<T>(\n  fn: () => T,\n  options?: ComputedOptions<T> | ComputedEquality<T>,\n): ReadonlyCell<T> {\n  let hasValue = false;\n  let value: T;\n  let dirty = true;\n  const equals = typeof options === \"function\" ? options : (options?.equals ?? Object.is);\n\n  const source: Source = {\n    subscribers: new Set(),\n  };\n\n  const computation: ReactiveComputation = {\n    id: runtimeState.nextComputationId,\n    deps: new Set(),\n    disposed: false,\n    queued: false,\n    markDirty() {\n      if (dirty) {\n        if (source.subscribers.size === 0 || computation.queued) {\n          return;\n        }\n      }\n\n      dirty = true;\n\n      if (source.subscribers.size > 0) {\n        if (runtimeState.notificationDepth > 0) {\n          computation.queued = true;\n          runtimeState.pendingComputed.add(computation);\n          return;\n        }\n\n        publishIfChanged();\n      }\n    },\n    run() {\n      publishIfChanged();\n    },\n    trackSource(source) {\n      trackIncrementalSource(source, computation);\n    },\n    dispose() {\n      if (computation.disposed) {\n        return;\n      }\n\n      computation.disposed = true;\n      computation.queued = false;\n      runtimeState.pendingComputed.delete(computation);\n      cleanupDeps(computation);\n      source.subscribers.clear();\n      source.singleSubscriber = undefined;\n    },\n  };\n\n  runtimeState.nextComputationId += 1;\n\n  function publishIfChanged(): void {\n    const previousHasValue = hasValue;\n    const previousValue = value;\n\n    try {\n      const nextValue = recompute();\n\n      if (!previousHasValue || !equals(previousValue, nextValue)) {\n        notifySubscribers(source);\n      }\n    } catch {\n      runtimeState.batchDepth += 1;\n\n      try {\n        notifySubscribers(source);\n      } finally {\n        runtimeState.batchDepth -= 1;\n\n        if (runtimeState.batchDepth === 0) {\n          schedulePendingFlush();\n        }\n      }\n    }\n  }\n\n  function recompute(): T {\n    if (!dirty && hasValue) {\n      return value;\n    }\n\n    const previousTracker = runtimeState.activeTracker;\n    const previousDepsSize = computation.deps.size;\n    const nextTrackingVersion = nextTrackingVersionFor(computation);\n\n    computation.trackingAddedDeps = [];\n    computation.trackingCount = 0;\n    computation.trackingVersion = nextTrackingVersion;\n    runtimeState.activeTracker = computation;\n\n    try {\n      const nextValue = fn();\n\n      const addedDeps = computation.trackingAddedDeps;\n      const trackedCount = computation.trackingCount ?? 0;\n\n      if (trackedCount !== previousDepsSize || (addedDeps?.length ?? 0) > 0) {\n        cleanupUntrackedDeps(computation, nextTrackingVersion);\n      }\n\n      value = nextValue;\n      hasValue = true;\n      dirty = false;\n\n      return value;\n    } catch (error) {\n      cleanupAddedDeps(computation);\n      dirty = true;\n\n      throw error;\n    } finally {\n      computation.trackingAddedDeps = undefined;\n      computation.trackingCount = undefined;\n      computation.trackingTouchedDeps = undefined;\n      runtimeState.activeTracker = previousTracker;\n    }\n  }\n\n  return {\n    get(): T {\n      trackSource(source);\n\n      if (dirty) {\n        const activeTracker = runtimeState.activeTracker;\n\n        if (activeTracker !== null && activeTracker !== computation) {\n          preserveIncrementalTracking(activeTracker);\n        }\n      }\n\n      return recompute();\n    },\n  };\n}\n"]}
+{"version":3,"file":"computed.js","sourceRoot":"","sources":["../src/computed.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,oBAAoB,EAAE,MAAM,gBAAgB,CAAC;AACtD,OAAO,EAAE,YAAY,EAAE,MAAM,YAAY,CAAC;AAC1C,OAAO,EACL,gBAAgB,EAChB,WAAW,EACX,oBAAoB,EACpB,sBAAsB,EACtB,iBAAiB,EACjB,2BAA2B,EAC3B,sBAAsB,EACtB,WAAW,GACZ,MAAM,eAAe,CAAC;AASvB,MAAM,UAAU,QAAQ,CACtB,EAAW,EACX,OAAkD;IAElD,IAAI,QAAQ,GAAG,KAAK,CAAC;IACrB,IAAI,KAAQ,CAAC;IACb,IAAI,KAAK,GAAG,IAAI,CAAC;IACjB,MAAM,MAAM,GAAG,OAAO,OAAO,KAAK,UAAU,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,MAAM,IAAI,MAAM,CAAC,EAAE,CAAC,CAAC;IAExF,MAAM,MAAM,GAAW;QACrB,WAAW,EAAE,IAAI;KAClB,CAAC;IAEF,MAAM,WAAW,GAAwB;QACvC,EAAE,EAAE,YAAY,CAAC,iBAAiB;QAClC,IAAI,EAAE,IAAI,GAAG,EAAE;QACf,QAAQ,EAAE,KAAK;QACf,MAAM,EAAE,KAAK;QACb,SAAS;YACP,IAAI,KAAK,EAAE,CAAC;gBACV,IAAI,MAAM,CAAC,WAAW,KAAK,IAAI,IAAI,WAAW,CAAC,MAAM,EAAE,CAAC;oBACtD,OAAO;gBACT,CAAC;YACH,CAAC;YAED,KAAK,GAAG,IAAI,CAAC;YAEb,IAAI,MAAM,CAAC,WAAW,KAAK,IAAI,EAAE,CAAC;gBAChC,IAAI,YAAY,CAAC,iBAAiB,GAAG,CAAC,EAAE,CAAC;oBACvC,WAAW,CAAC,MAAM,GAAG,IAAI,CAAC;oBAC1B,YAAY,CAAC,eAAe,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;oBAC9C,OAAO;gBACT,CAAC;gBAED,gBAAgB,EAAE,CAAC;YACrB,CAAC;QACH,CAAC;QACD,GAAG;YACD,gBAAgB,EAAE,CAAC;QACrB,CAAC;QACD,WAAW,CAAC,MAAM;YAChB,sBAAsB,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC;QAC9C,CAAC;QACD,OAAO;YACL,IAAI,WAAW,CAAC,QAAQ,EAAE,CAAC;gBACzB,OAAO;YACT,CAAC;YAED,WAAW,CAAC,QAAQ,GAAG,IAAI,CAAC;YAC5B,WAAW,CAAC,MAAM,GAAG,KAAK,CAAC;YAC3B,YAAY,CAAC,eAAe,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC;YACjD,WAAW,CAAC,WAAW,CAAC,CAAC;YACzB,MAAM,CAAC,WAAW,GAAG,IAAI,CAAC;QAC5B,CAAC;KACF,CAAC;IAEF,YAAY,CAAC,iBAAiB,IAAI,CAAC,CAAC;IAEpC,SAAS,gBAAgB;QACvB,MAAM,gBAAgB,GAAG,QAAQ,CAAC;QAClC,MAAM,aAAa,GAAG,KAAK,CAAC;QAE5B,IAAI,CAAC;YACH,MAAM,SAAS,GAAG,SAAS,EAAE,CAAC;YAE9B,IAAI,CAAC,gBAAgB,IAAI,CAAC,MAAM,CAAC,aAAa,EAAE,SAAS,CAAC,EAAE,CAAC;gBAC3D,iBAAiB,CAAC,MAAM,CAAC,CAAC;YAC5B,CAAC;QACH,CAAC;QAAC,MAAM,CAAC;YACP,YAAY,CAAC,UAAU,IAAI,CAAC,CAAC;YAE7B,IAAI,CAAC;gBACH,iBAAiB,CAAC,MAAM,CAAC,CAAC;YAC5B,CAAC;oBAAS,CAAC;gBACT,YAAY,CAAC,UAAU,IAAI,CAAC,CAAC;gBAE7B,IAAI,YAAY,CAAC,UAAU,KAAK,CAAC,EAAE,CAAC;oBAClC,oBAAoB,EAAE,CAAC;gBACzB,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAED,SAAS,SAAS;QAChB,IAAI,CAAC,KAAK,IAAI,QAAQ,EAAE,CAAC;YACvB,OAAO,KAAK,CAAC;QACf,CAAC;QAED,MAAM,eAAe,GAAG,YAAY,CAAC,aAAa,CAAC;QACnD,MAAM,gBAAgB,GAAG,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC;QAC/C,MAAM,mBAAmB,GAAG,sBAAsB,CAAC,WAAW,CAAC,CAAC;QAEhE,WAAW,CAAC,iBAAiB,GAAG,EAAE,CAAC;QACnC,WAAW,CAAC,aAAa,GAAG,CAAC,CAAC;QAC9B,WAAW,CAAC,eAAe,GAAG,mBAAmB,CAAC;QAClD,YAAY,CAAC,aAAa,GAAG,WAAW,CAAC;QAEzC,IAAI,CAAC;YACH,MAAM,SAAS,GAAG,EAAE,EAAE,CAAC;YAEvB,MAAM,SAAS,GAAG,WAAW,CAAC,iBAAiB,CAAC;YAChD,MAAM,YAAY,GAAG,WAAW,CAAC,aAAa,IAAI,CAAC,CAAC;YAEpD,IAAI,YAAY,KAAK,gBAAgB,IAAI,CAAC,SAAS,EAAE,MAAM,IAAI,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC;gBACtE,oBAAoB,CAAC,WAAW,EAAE,mBAAmB,CAAC,CAAC;YACzD,CAAC;YAED,KAAK,GAAG,SAAS,CAAC;YAClB,QAAQ,GAAG,IAAI,CAAC;YAChB,KAAK,GAAG,KAAK,CAAC;YAEd,OAAO,KAAK,CAAC;QACf,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,gBAAgB,CAAC,WAAW,CAAC,CAAC;YAC9B,KAAK,GAAG,IAAI,CAAC;YAEb,MAAM,KAAK,CAAC;QACd,CAAC;gBAAS,CAAC;YACT,WAAW,CAAC,iBAAiB,GAAG,SAAS,CAAC;YAC1C,WAAW,CAAC,aAAa,GAAG,SAAS,CAAC;YACtC,WAAW,CAAC,mBAAmB,GAAG,SAAS,CAAC;YAC5C,YAAY,CAAC,aAAa,GAAG,eAAe,CAAC;QAC/C,CAAC;IACH,CAAC;IAED,OAAO;QACL,GAAG;YACD,WAAW,CAAC,MAAM,CAAC,CAAC;YAEpB,IAAI,KAAK,EAAE,CAAC;gBACV,MAAM,aAAa,GAAG,YAAY,CAAC,aAAa,CAAC;gBAEjD,IAAI,aAAa,KAAK,IAAI,IAAI,aAAa,KAAK,WAAW,EAAE,CAAC;oBAC5D,2BAA2B,CAAC,aAAa,CAAC,CAAC;gBAC7C,CAAC;YACH,CAAC;YAED,OAAO,SAAS,EAAE,CAAC;QACrB,CAAC;KACF,CAAC;AACJ,CAAC","sourcesContent":["import type { ReactiveComputation, Source } from \"./state.js\";\nimport { schedulePendingFlush } from \"./scheduler.js\";\nimport { runtimeState } from \"./state.js\";\nimport {\n  cleanupAddedDeps,\n  cleanupDeps,\n  cleanupUntrackedDeps,\n  nextTrackingVersionFor,\n  notifySubscribers,\n  preserveIncrementalTracking,\n  trackIncrementalSource,\n  trackSource,\n} from \"./tracking.js\";\nimport type { ReadonlyCell } from \"./types.js\";\n\nexport type ComputedEquality<T> = (previous: T, next: T) => boolean;\n\nexport interface ComputedOptions<T> {\n  equals?: ComputedEquality<T> | undefined;\n}\n\nexport function computed<T>(\n  fn: () => T,\n  options?: ComputedOptions<T> | ComputedEquality<T>,\n): ReadonlyCell<T> {\n  let hasValue = false;\n  let value: T;\n  let dirty = true;\n  const equals = typeof options === \"function\" ? options : (options?.equals ?? Object.is);\n\n  const source: Source = {\n    subscribers: null,\n  };\n\n  const computation: ReactiveComputation = {\n    id: runtimeState.nextComputationId,\n    deps: new Set(),\n    disposed: false,\n    queued: false,\n    markDirty() {\n      if (dirty) {\n        if (source.subscribers === null || computation.queued) {\n          return;\n        }\n      }\n\n      dirty = true;\n\n      if (source.subscribers !== null) {\n        if (runtimeState.notificationDepth > 0) {\n          computation.queued = true;\n          runtimeState.pendingComputed.add(computation);\n          return;\n        }\n\n        publishIfChanged();\n      }\n    },\n    run() {\n      publishIfChanged();\n    },\n    trackSource(source) {\n      trackIncrementalSource(source, computation);\n    },\n    dispose() {\n      if (computation.disposed) {\n        return;\n      }\n\n      computation.disposed = true;\n      computation.queued = false;\n      runtimeState.pendingComputed.delete(computation);\n      cleanupDeps(computation);\n      source.subscribers = null;\n    },\n  };\n\n  runtimeState.nextComputationId += 1;\n\n  function publishIfChanged(): void {\n    const previousHasValue = hasValue;\n    const previousValue = value;\n\n    try {\n      const nextValue = recompute();\n\n      if (!previousHasValue || !equals(previousValue, nextValue)) {\n        notifySubscribers(source);\n      }\n    } catch {\n      runtimeState.batchDepth += 1;\n\n      try {\n        notifySubscribers(source);\n      } finally {\n        runtimeState.batchDepth -= 1;\n\n        if (runtimeState.batchDepth === 0) {\n          schedulePendingFlush();\n        }\n      }\n    }\n  }\n\n  function recompute(): T {\n    if (!dirty && hasValue) {\n      return value;\n    }\n\n    const previousTracker = runtimeState.activeTracker;\n    const previousDepsSize = computation.deps.size;\n    const nextTrackingVersion = nextTrackingVersionFor(computation);\n\n    computation.trackingAddedDeps = [];\n    computation.trackingCount = 0;\n    computation.trackingVersion = nextTrackingVersion;\n    runtimeState.activeTracker = computation;\n\n    try {\n      const nextValue = fn();\n\n      const addedDeps = computation.trackingAddedDeps;\n      const trackedCount = computation.trackingCount ?? 0;\n\n      if (trackedCount !== previousDepsSize || (addedDeps?.length ?? 0) > 0) {\n        cleanupUntrackedDeps(computation, nextTrackingVersion);\n      }\n\n      value = nextValue;\n      hasValue = true;\n      dirty = false;\n\n      return value;\n    } catch (error) {\n      cleanupAddedDeps(computation);\n      dirty = true;\n\n      throw error;\n    } finally {\n      computation.trackingAddedDeps = undefined;\n      computation.trackingCount = undefined;\n      computation.trackingTouchedDeps = undefined;\n      runtimeState.activeTracker = previousTracker;\n    }\n  }\n\n  return {\n    get(): T {\n      trackSource(source);\n\n      if (dirty) {\n        const activeTracker = runtimeState.activeTracker;\n\n        if (activeTracker !== null && activeTracker !== computation) {\n          preserveIncrementalTracking(activeTracker);\n        }\n      }\n\n      return recompute();\n    },\n  };\n}\n"]}

package/dist/scheduler.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"scheduler.d.ts","sourceRoot":"","sources":["../src/scheduler.ts"],"names":[],"mappings":"AAAA,OAAO,EAAgB,KAAK,mBAAmB,EAAE,MAAM,YAAY,CAAC;AAEpE,MAAM,WAAW,SAAS;IACxB,QAAQ,CAAC,KAAK,EAAE,MAAM,IAAI,GAAG,IAAI,CAAC;CACnC;AAqBD,wBAAgB,YAAY,CAAC,aAAa,EAAE,SAAS,GAAG,MAAM,IAAI,CAOjE;AAED,wBAAgB,6BAA6B,IAAI,IAAI,CAQpD;AAED,wBAAgB,gBAAgB,CAAC,WAAW,EAAE,mBAAmB,GAAG,IAAI,CAkBvE;AAED,wBAAgB,oBAAoB,IAAI,IAAI,CAiB3C;AAED,wBAAgB,uBAAuB,IAAI,IAAI,CAoC9C"}
+{"version":3,"file":"scheduler.d.ts","sourceRoot":"","sources":["../src/scheduler.ts"],"names":[],"mappings":"AACA,OAAO,EAAgB,KAAK,mBAAmB,EAAE,MAAM,YAAY,CAAC;AAEpE,MAAM,WAAW,SAAS;IACxB,QAAQ,CAAC,KAAK,EAAE,MAAM,IAAI,GAAG,IAAI,CAAC;CACnC;AAqBD,wBAAgB,YAAY,CAAC,aAAa,EAAE,SAAS,GAAG,MAAM,IAAI,CAOjE;AAED,wBAAgB,6BAA6B,IAAI,IAAI,CAQpD;AAED,wBAAgB,gBAAgB,CAAC,WAAW,EAAE,mBAAmB,GAAG,IAAI,CAkBvE;AAED,wBAAgB,oBAAoB,IAAI,IAAI,CAiB3C;AAED,wBAAgB,uBAAuB,IAAI,IAAI,CAqC9C"}

package/dist/scheduler.js

@@ -1,3 +1,4 @@
+import { invalidateDevtoolsWriteCache } from "./cell.js";
 import { runtimeState } from "./state.js";
 const defaultScheduler = {
     schedule(flush) {
@@ -66,6 +67,7 @@ export function flushQueuedComputations() {
     if (flushing) {
         return;
     }
+    invalidateDevtoolsWriteCache();
     scheduled = false;
     flushing = true;
     let firstError;

package/dist/scheduler.js.map

@@ -1 +1 @@
-{"version":3,"file":"scheduler.js","sourceRoot":"","sources":["../src/scheduler.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,YAAY,EAA4B,MAAM,YAAY,CAAC;AAMpE,MAAM,gBAAgB,GAAc;IAClC,QAAQ,CAAC,KAAK;QACZ,IAAI,OAAO,cAAc,KAAK,UAAU,EAAE,CAAC;YACzC,cAAc,CAAC,KAAK,CAAC,CAAC;YACtB,OAAO;QACT,CAAC;QAED,KAAK,OAAO,CAAC,OAAO,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACrC,CAAC;CACF,CAAC;AAEF,IAAI,SAAS,GAAG,gBAAgB,CAAC;AACjC,IAAI,KAAK,GAA0B,EAAE,CAAC;AACtC,IAAI,uBAAuB,GAAG,CAAC,CAAC,CAAC;AACjC,IAAI,iBAAiB,GAAG,KAAK,CAAC;AAC9B,IAAI,SAAS,GAAG,KAAK,CAAC;AACtB,IAAI,QAAQ,GAAG,KAAK,CAAC;AACrB,MAAM,kBAAkB,GAAG,GAAG,CAAC;AAE/B,MAAM,UAAU,YAAY,CAAC,aAAwB;IACnD,MAAM,QAAQ,GAAG,SAAS,CAAC;IAC3B,SAAS,GAAG,aAAa,CAAC;IAE1B,OAAO,GAAG,EAAE;QACV,SAAS,GAAG,QAAQ,CAAC;IACvB,CAAC,CAAC;AACJ,CAAC;AAED,MAAM,UAAU,6BAA6B;IAC3C,KAAK,MAAM,WAAW,IAAI,KAAK,EAAE,CAAC;QAChC,WAAW,CAAC,MAAM,GAAG,KAAK,CAAC;IAC7B,CAAC;IAED,UAAU,EAAE,CAAC;IACb,SAAS,GAAG,KAAK,CAAC;IAClB,QAAQ,GAAG,KAAK,CAAC;AACnB,CAAC;AAED,MAAM,UAAU,gBAAgB,CAAC,WAAgC;IAC/D,IAAI,WAAW,CAAC,QAAQ,IAAI,WAAW,CAAC,MAAM,EAAE,CAAC;QAC/C,OAAO;IACT,CAAC;IAED,IAAI,WAAW,CAAC,EAAE,GAAG,uBAAuB,EAAE,CAAC;QAC7C,iBAAiB,GAAG,IAAI,CAAC;IAC3B,CAAC;IAED,uBAAuB,GAAG,WAAW,CAAC,EAAE,CAAC;IACzC,KAAK,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;IACxB,WAAW,CAAC,MAAM,GAAG,IAAI,CAAC;IAE1B,IAAI,YAAY,CAAC,UAAU,GAAG,CAAC,EAAE,CAAC;QAChC,OAAO;IACT,CAAC;IAED,oBAAoB,EAAE,CAAC;AACzB,CAAC;AAED,MAAM,UAAU,oBAAoB;IAClC,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,IAAI,SAAS,IAAI,QAAQ,EAAE,CAAC;QAChD,OAAO;IACT,CAAC;IAED,SAAS,GAAG,IAAI,CAAC;IAEjB,IAAI,CAAC;QACH,SAAS,CAAC,QAAQ,CAAC,uBAAuB,CAAC,CAAC;IAC9C,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,SAAS,GAAG,KAAK,CAAC;QAClB,KAAK,MAAM,WAAW,IAAI,KAAK,EAAE,CAAC;YAChC,WAAW,CAAC,MAAM,GAAG,KAAK,CAAC;QAC7B,CAAC;QACD,UAAU,EAAE,CAAC;QACb,MAAM,KAAK,CAAC;IACd,CAAC;AACH,CAAC;AAED,MAAM,UAAU,uBAAuB;IACrC,IAAI,QAAQ,EAAE,CAAC;QACb,OAAO;IACT,CAAC;IAED,SAAS,GAAG,KAAK,CAAC;IAClB,QAAQ,GAAG,IAAI,CAAC;IAChB,IAAI,UAAmB,CAAC;IAExB,IAAI,CAAC;QACH,KAAK,IAAI,SAAS,GAAG,CAAC,EAAE,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,SAAS,IAAI,CAAC,EAAE,CAAC;YACzD,IAAI,SAAS,IAAI,kBAAkB,EAAE,CAAC;gBACpC,MAAM,IAAI,KAAK,CAAC,+BAA+B,CAAC,CAAC;YACnD,CAAC;YAED,MAAM,OAAO,GAAG,sBAAsB,EAAE,CAAC;YAEzC,KAAK,MAAM,WAAW,IAAI,OAAO,EAAE,CAAC;gBAClC,WAAW,CAAC,MAAM,GAAG,KAAK,CAAC;gBAE3B,IAAI,CAAC,WAAW,CAAC,QAAQ,EAAE,CAAC;oBAC1B,IAAI,CAAC;wBACH,WAAW,CAAC,GAAG,EAAE,CAAC;oBACpB,CAAC;oBAAC,OAAO,KAAK,EAAE,CAAC;wBACf,UAAU,KAAK,KAAK,CAAC;oBACvB,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QAED,IAAI,UAAU,KAAK,SAAS,EAAE,CAAC;YAC7B,MAAM,UAAU,CAAC;QACnB,CAAC;IACH,CAAC;YAAS,CAAC;QACT,QAAQ,GAAG,KAAK,CAAC;IACnB,CAAC;AACH,CAAC;AAED,SAAS,UAAU;IACjB,KAAK,GAAG,EAAE,CAAC;IACX,uBAAuB,GAAG,CAAC,CAAC,CAAC;IAC7B,iBAAiB,GAAG,KAAK,CAAC;AAC5B,CAAC;AAED,SAAS,sBAAsB;IAC7B,IAAI,iBAAiB,EAAE,CAAC;QACtB,MAAM,OAAO,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC;QAClD,UAAU,EAAE,CAAC;QACb,OAAO,OAAO,CAAC;IACjB,CAAC;IAED,MAAM,OAAO,GAAG,KAAK,CAAC;IACtB,KAAK,GAAG,EAAE,CAAC;IACX,uBAAuB,GAAG,CAAC,CAAC,CAAC;IAC7B,iBAAiB,GAAG,KAAK,CAAC;IAC1B,OAAO,OAAO,CAAC;AACjB,CAAC","sourcesContent":["import { runtimeState, type ReactiveComputation } from \"./state.js\";\n\nexport interface Scheduler {\n  schedule(flush: () => void): void;\n}\n\nconst defaultScheduler: Scheduler = {\n  schedule(flush) {\n    if (typeof queueMicrotask === \"function\") {\n      queueMicrotask(flush);\n      return;\n    }\n\n    void Promise.resolve().then(flush);\n  },\n};\n\nlet scheduler = defaultScheduler;\nlet queue: ReactiveComputation[] = [];\nlet lastQueuedComputationId = -1;\nlet queueRequiresSort = false;\nlet scheduled = false;\nlet flushing = false;\nconst maxFlushIterations = 100;\n\nexport function setScheduler(nextScheduler: Scheduler): () => void {\n  const previous = scheduler;\n  scheduler = nextScheduler;\n\n  return () => {\n    scheduler = previous;\n  };\n}\n\nexport function resetSchedulerStateForTesting(): void {\n  for (const computation of queue) {\n    computation.queued = false;\n  }\n\n  clearQueue();\n  scheduled = false;\n  flushing = false;\n}\n\nexport function queueComputation(computation: ReactiveComputation): void {\n  if (computation.disposed || computation.queued) {\n    return;\n  }\n\n  if (computation.id < lastQueuedComputationId) {\n    queueRequiresSort = true;\n  }\n\n  lastQueuedComputationId = computation.id;\n  queue.push(computation);\n  computation.queued = true;\n\n  if (runtimeState.batchDepth > 0) {\n    return;\n  }\n\n  schedulePendingFlush();\n}\n\nexport function schedulePendingFlush(): void {\n  if (queue.length === 0 || scheduled || flushing) {\n    return;\n  }\n\n  scheduled = true;\n\n  try {\n    scheduler.schedule(flushQueuedComputations);\n  } catch (error) {\n    scheduled = false;\n    for (const computation of queue) {\n      computation.queued = false;\n    }\n    clearQueue();\n    throw error;\n  }\n}\n\nexport function flushQueuedComputations(): void {\n  if (flushing) {\n    return;\n  }\n\n  scheduled = false;\n  flushing = true;\n  let firstError: unknown;\n\n  try {\n    for (let iteration = 0; queue.length > 0; iteration += 1) {\n      if (iteration >= maxFlushIterations) {\n        throw new Error(\"Reactive flush limit exceeded\");\n      }\n\n      const current = takeQueuedComputations();\n\n      for (const computation of current) {\n        computation.queued = false;\n\n        if (!computation.disposed) {\n          try {\n            computation.run();\n          } catch (error) {\n            firstError ??= error;\n          }\n        }\n      }\n    }\n\n    if (firstError !== undefined) {\n      throw firstError;\n    }\n  } finally {\n    flushing = false;\n  }\n}\n\nfunction clearQueue(): void {\n  queue = [];\n  lastQueuedComputationId = -1;\n  queueRequiresSort = false;\n}\n\nfunction takeQueuedComputations(): ReactiveComputation[] {\n  if (queueRequiresSort) {\n    const current = queue.sort((a, b) => a.id - b.id);\n    clearQueue();\n    return current;\n  }\n\n  const current = queue;\n  queue = [];\n  lastQueuedComputationId = -1;\n  queueRequiresSort = false;\n  return current;\n}\n"]}
+{"version":3,"file":"scheduler.js","sourceRoot":"","sources":["../src/scheduler.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,4BAA4B,EAAE,MAAM,WAAW,CAAC;AACzD,OAAO,EAAE,YAAY,EAA4B,MAAM,YAAY,CAAC;AAMpE,MAAM,gBAAgB,GAAc;IAClC,QAAQ,CAAC,KAAK;QACZ,IAAI,OAAO,cAAc,KAAK,UAAU,EAAE,CAAC;YACzC,cAAc,CAAC,KAAK,CAAC,CAAC;YACtB,OAAO;QACT,CAAC;QAED,KAAK,OAAO,CAAC,OAAO,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACrC,CAAC;CACF,CAAC;AAEF,IAAI,SAAS,GAAG,gBAAgB,CAAC;AACjC,IAAI,KAAK,GAA0B,EAAE,CAAC;AACtC,IAAI,uBAAuB,GAAG,CAAC,CAAC,CAAC;AACjC,IAAI,iBAAiB,GAAG,KAAK,CAAC;AAC9B,IAAI,SAAS,GAAG,KAAK,CAAC;AACtB,IAAI,QAAQ,GAAG,KAAK,CAAC;AACrB,MAAM,kBAAkB,GAAG,GAAG,CAAC;AAE/B,MAAM,UAAU,YAAY,CAAC,aAAwB;IACnD,MAAM,QAAQ,GAAG,SAAS,CAAC;IAC3B,SAAS,GAAG,aAAa,CAAC;IAE1B,OAAO,GAAG,EAAE;QACV,SAAS,GAAG,QAAQ,CAAC;IACvB,CAAC,CAAC;AACJ,CAAC;AAED,MAAM,UAAU,6BAA6B;IAC3C,KAAK,MAAM,WAAW,IAAI,KAAK,EAAE,CAAC;QAChC,WAAW,CAAC,MAAM,GAAG,KAAK,CAAC;IAC7B,CAAC;IAED,UAAU,EAAE,CAAC;IACb,SAAS,GAAG,KAAK,CAAC;IAClB,QAAQ,GAAG,KAAK,CAAC;AACnB,CAAC;AAED,MAAM,UAAU,gBAAgB,CAAC,WAAgC;IAC/D,IAAI,WAAW,CAAC,QAAQ,IAAI,WAAW,CAAC,MAAM,EAAE,CAAC;QAC/C,OAAO;IACT,CAAC;IAED,IAAI,WAAW,CAAC,EAAE,GAAG,uBAAuB,EAAE,CAAC;QAC7C,iBAAiB,GAAG,IAAI,CAAC;IAC3B,CAAC;IAED,uBAAuB,GAAG,WAAW,CAAC,EAAE,CAAC;IACzC,KAAK,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;IACxB,WAAW,CAAC,MAAM,GAAG,IAAI,CAAC;IAE1B,IAAI,YAAY,CAAC,UAAU,GAAG,CAAC,EAAE,CAAC;QAChC,OAAO;IACT,CAAC;IAED,oBAAoB,EAAE,CAAC;AACzB,CAAC;AAED,MAAM,UAAU,oBAAoB;IAClC,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,IAAI,SAAS,IAAI,QAAQ,EAAE,CAAC;QAChD,OAAO;IACT,CAAC;IAED,SAAS,GAAG,IAAI,CAAC;IAEjB,IAAI,CAAC;QACH,SAAS,CAAC,QAAQ,CAAC,uBAAuB,CAAC,CAAC;IAC9C,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,SAAS,GAAG,KAAK,CAAC;QAClB,KAAK,MAAM,WAAW,IAAI,KAAK,EAAE,CAAC;YAChC,WAAW,CAAC,MAAM,GAAG,KAAK,CAAC;QAC7B,CAAC;QACD,UAAU,EAAE,CAAC;QACb,MAAM,KAAK,CAAC;IACd,CAAC;AACH,CAAC;AAED,MAAM,UAAU,uBAAuB;IACrC,IAAI,QAAQ,EAAE,CAAC;QACb,OAAO;IACT,CAAC;IAED,4BAA4B,EAAE,CAAC;IAC/B,SAAS,GAAG,KAAK,CAAC;IAClB,QAAQ,GAAG,IAAI,CAAC;IAChB,IAAI,UAAmB,CAAC;IAExB,IAAI,CAAC;QACH,KAAK,IAAI,SAAS,GAAG,CAAC,EAAE,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,SAAS,IAAI,CAAC,EAAE,CAAC;YACzD,IAAI,SAAS,IAAI,kBAAkB,EAAE,CAAC;gBACpC,MAAM,IAAI,KAAK,CAAC,+BAA+B,CAAC,CAAC;YACnD,CAAC;YAED,MAAM,OAAO,GAAG,sBAAsB,EAAE,CAAC;YAEzC,KAAK,MAAM,WAAW,IAAI,OAAO,EAAE,CAAC;gBAClC,WAAW,CAAC,MAAM,GAAG,KAAK,CAAC;gBAE3B,IAAI,CAAC,WAAW,CAAC,QAAQ,EAAE,CAAC;oBAC1B,IAAI,CAAC;wBACH,WAAW,CAAC,GAAG,EAAE,CAAC;oBACpB,CAAC;oBAAC,OAAO,KAAK,EAAE,CAAC;wBACf,UAAU,KAAK,KAAK,CAAC;oBACvB,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QAED,IAAI,UAAU,KAAK,SAAS,EAAE,CAAC;YAC7B,MAAM,UAAU,CAAC;QACnB,CAAC;IACH,CAAC;YAAS,CAAC;QACT,QAAQ,GAAG,KAAK,CAAC;IACnB,CAAC;AACH,CAAC;AAED,SAAS,UAAU;IACjB,KAAK,GAAG,EAAE,CAAC;IACX,uBAAuB,GAAG,CAAC,CAAC,CAAC;IAC7B,iBAAiB,GAAG,KAAK,CAAC;AAC5B,CAAC;AAED,SAAS,sBAAsB;IAC7B,IAAI,iBAAiB,EAAE,CAAC;QACtB,MAAM,OAAO,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC;QAClD,UAAU,EAAE,CAAC;QACb,OAAO,OAAO,CAAC;IACjB,CAAC;IAED,MAAM,OAAO,GAAG,KAAK,CAAC;IACtB,KAAK,GAAG,EAAE,CAAC;IACX,uBAAuB,GAAG,CAAC,CAAC,CAAC;IAC7B,iBAAiB,GAAG,KAAK,CAAC;IAC1B,OAAO,OAAO,CAAC;AACjB,CAAC","sourcesContent":["import { invalidateDevtoolsWriteCache } from \"./cell.js\";\nimport { runtimeState, type ReactiveComputation } from \"./state.js\";\n\nexport interface Scheduler {\n  schedule(flush: () => void): void;\n}\n\nconst defaultScheduler: Scheduler = {\n  schedule(flush) {\n    if (typeof queueMicrotask === \"function\") {\n      queueMicrotask(flush);\n      return;\n    }\n\n    void Promise.resolve().then(flush);\n  },\n};\n\nlet scheduler = defaultScheduler;\nlet queue: ReactiveComputation[] = [];\nlet lastQueuedComputationId = -1;\nlet queueRequiresSort = false;\nlet scheduled = false;\nlet flushing = false;\nconst maxFlushIterations = 100;\n\nexport function setScheduler(nextScheduler: Scheduler): () => void {\n  const previous = scheduler;\n  scheduler = nextScheduler;\n\n  return () => {\n    scheduler = previous;\n  };\n}\n\nexport function resetSchedulerStateForTesting(): void {\n  for (const computation of queue) {\n    computation.queued = false;\n  }\n\n  clearQueue();\n  scheduled = false;\n  flushing = false;\n}\n\nexport function queueComputation(computation: ReactiveComputation): void {\n  if (computation.disposed || computation.queued) {\n    return;\n  }\n\n  if (computation.id < lastQueuedComputationId) {\n    queueRequiresSort = true;\n  }\n\n  lastQueuedComputationId = computation.id;\n  queue.push(computation);\n  computation.queued = true;\n\n  if (runtimeState.batchDepth > 0) {\n    return;\n  }\n\n  schedulePendingFlush();\n}\n\nexport function schedulePendingFlush(): void {\n  if (queue.length === 0 || scheduled || flushing) {\n    return;\n  }\n\n  scheduled = true;\n\n  try {\n    scheduler.schedule(flushQueuedComputations);\n  } catch (error) {\n    scheduled = false;\n    for (const computation of queue) {\n      computation.queued = false;\n    }\n    clearQueue();\n    throw error;\n  }\n}\n\nexport function flushQueuedComputations(): void {\n  if (flushing) {\n    return;\n  }\n\n  invalidateDevtoolsWriteCache();\n  scheduled = false;\n  flushing = true;\n  let firstError: unknown;\n\n  try {\n    for (let iteration = 0; queue.length > 0; iteration += 1) {\n      if (iteration >= maxFlushIterations) {\n        throw new Error(\"Reactive flush limit exceeded\");\n      }\n\n      const current = takeQueuedComputations();\n\n      for (const computation of current) {\n        computation.queued = false;\n\n        if (!computation.disposed) {\n          try {\n            computation.run();\n          } catch (error) {\n            firstError ??= error;\n          }\n        }\n      }\n    }\n\n    if (firstError !== undefined) {\n      throw firstError;\n    }\n  } finally {\n    flushing = false;\n  }\n}\n\nfunction clearQueue(): void {\n  queue = [];\n  lastQueuedComputationId = -1;\n  queueRequiresSort = false;\n}\n\nfunction takeQueuedComputations(): ReactiveComputation[] {\n  if (queueRequiresSort) {\n    const current = queue.sort((a, b) => a.id - b.id);\n    clearQueue();\n    return current;\n  }\n\n  const current = queue;\n  queue = [];\n  lastQueuedComputationId = -1;\n  queueRequiresSort = false;\n  return current;\n}\n"]}

package/dist/state.d.ts

@@ -1,6 +1,5 @@
 export interface Source {
-    singleSubscriber?: ReactiveComputation | undefined;
-    subscribers: Set<ReactiveComputation>;
+    subscribers: ReactiveComputation | Set<ReactiveComputation> | null;
     trackedBy?: ReactiveComputation | undefined;
     trackedVersion?: number | undefined;
 }

package/dist/state.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"state.d.ts","sourceRoot":"","sources":["../src/state.ts"],"names":[],"mappings":"AAOA,MAAM,WAAW,MAAM;IACrB,gBAAgB,CAAC,EAAE,mBAAmB,GAAG,SAAS,CAAC;IACnD,WAAW,EAAE,GAAG,CAAC,mBAAmB,CAAC,CAAC;IACtC,SAAS,CAAC,EAAE,mBAAmB,GAAG,SAAS,CAAC;IAC5C,cAAc,CAAC,EAAE,MAAM,GAAG,SAAS,CAAC;CACrC;AAED,MAAM,WAAW,mBAAmB;IAClC,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,IAAI,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;IAClB,iBAAiB,CAAC,EAAE,MAAM,EAAE,GAAG,SAAS,CAAC;IACzC,aAAa,CAAC,EAAE,MAAM,GAAG,SAAS,CAAC;IACnC,mBAAmB,CAAC,EAAE,MAAM,EAAE,GAAG,SAAS,CAAC;IAC3C,eAAe,CAAC,EAAE,MAAM,GAAG,SAAS,CAAC;IACrC,QAAQ,EAAE,OAAO,CAAC;IAClB,MAAM,EAAE,OAAO,CAAC;IAChB,SAAS,IAAI,IAAI,CAAC;IAClB,GAAG,IAAI,IAAI,CAAC;IACZ,OAAO,IAAI,IAAI,CAAC;IAChB,WAAW,CAAC,CAAC,MAAM,EAAE,MAAM,GAAG,IAAI,CAAC;CACpC;AAED,MAAM,MAAM,OAAO,GAAG,mBAAmB,GAAG,IAAI,CAAC;AAEjD,eAAO,MAAM,YAAY,EAAE;IACzB,aAAa,EAAE,OAAO,CAAC;IACvB,UAAU,EAAE,MAAM,CAAC;IACnB,YAAY,EAAE,CAAC,CAAC,OAAO,EAAE,MAAM,IAAI,KAAK,IAAI,CAAC,GAAG,SAAS,CAAC;IAC1D,gBAAgB,EAAE,OAAO,CAAC;IAC1B,iBAAiB,EAAE,MAAM,CAAC;IAC1B,iBAAiB,EAAE,MAAM,CAAC;IAC1B,eAAe,EAAE,GAAG,CAAC,mBAAmB,CAAC,CAAC;CAS3C,CAAC"}
+{"version":3,"file":"state.d.ts","sourceRoot":"","sources":["../src/state.ts"],"names":[],"mappings":"AAOA,MAAM,WAAW,MAAM;IAKrB,WAAW,EAAE,mBAAmB,GAAG,GAAG,CAAC,mBAAmB,CAAC,GAAG,IAAI,CAAC;IACnE,SAAS,CAAC,EAAE,mBAAmB,GAAG,SAAS,CAAC;IAC5C,cAAc,CAAC,EAAE,MAAM,GAAG,SAAS,CAAC;CACrC;AAED,MAAM,WAAW,mBAAmB;IAClC,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,IAAI,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;IAClB,iBAAiB,CAAC,EAAE,MAAM,EAAE,GAAG,SAAS,CAAC;IACzC,aAAa,CAAC,EAAE,MAAM,GAAG,SAAS,CAAC;IACnC,mBAAmB,CAAC,EAAE,MAAM,EAAE,GAAG,SAAS,CAAC;IAC3C,eAAe,CAAC,EAAE,MAAM,GAAG,SAAS,CAAC;IACrC,QAAQ,EAAE,OAAO,CAAC;IAClB,MAAM,EAAE,OAAO,CAAC;IAChB,SAAS,IAAI,IAAI,CAAC;IAClB,GAAG,IAAI,IAAI,CAAC;IACZ,OAAO,IAAI,IAAI,CAAC;IAChB,WAAW,CAAC,CAAC,MAAM,EAAE,MAAM,GAAG,IAAI,CAAC;CACpC;AAED,MAAM,MAAM,OAAO,GAAG,mBAAmB,GAAG,IAAI,CAAC;AAEjD,eAAO,MAAM,YAAY,EAAE;IACzB,aAAa,EAAE,OAAO,CAAC;IACvB,UAAU,EAAE,MAAM,CAAC;IACnB,YAAY,EAAE,CAAC,CAAC,OAAO,EAAE,MAAM,IAAI,KAAK,IAAI,CAAC,GAAG,SAAS,CAAC;IAC1D,gBAAgB,EAAE,OAAO,CAAC;IAC1B,iBAAiB,EAAE,MAAM,CAAC;IAC1B,iBAAiB,EAAE,MAAM,CAAC;IAC1B,eAAe,EAAE,GAAG,CAAC,mBAAmB,CAAC,CAAC;CAS3C,CAAC"}

package/dist/state.js.map

@@ -1 +1 @@
-{"version":3,"file":"state.js","sourceRoot":"","sources":["../src/state.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,+BAA+B,EAAE,MAAM,sBAAsB,CAAC;AAEvE,wEAAwE;AACxE,6EAA6E;AAC7E,+BAA+B;AAC/B,+BAA+B,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;AA0BjD,MAAM,CAAC,MAAM,YAAY,GAQrB;IACF,aAAa,EAAE,IAAI;IACnB,UAAU,EAAE,CAAC;IACb,YAAY,EAAE,SAAS;IACvB,gBAAgB,EAAE,KAAK;IACvB,iBAAiB,EAAE,CAAC;IACpB,iBAAiB,EAAE,CAAC;IACpB,eAAe,EAAE,IAAI,GAAG,EAAE;CAC3B,CAAC","sourcesContent":["import { warnOnDuplicateReactiveCoreCopy } from \"./duplicate-guard.js\";\n\n// This module holds the per-copy reactive runtime identity, so a second\n// evaluation in the same browser page is exactly the duplication that breaks\n// cross-package cell tracking.\nwarnOnDuplicateReactiveCoreCopy(import.meta.url);\n\nexport interface Source {\n  singleSubscriber?: ReactiveComputation | undefined;\n  subscribers: Set<ReactiveComputation>;\n  trackedBy?: ReactiveComputation | undefined;\n  trackedVersion?: number | undefined;\n}\n\nexport interface ReactiveComputation {\n  readonly id: number;\n  deps: Set<Source>;\n  trackingAddedDeps?: Source[] | undefined;\n  trackingCount?: number | undefined;\n  trackingTouchedDeps?: Source[] | undefined;\n  trackingVersion?: number | undefined;\n  disposed: boolean;\n  queued: boolean;\n  markDirty(): void;\n  run(): void;\n  dispose(): void;\n  trackSource?(source: Source): void;\n}\n\nexport type Tracker = ReactiveComputation | null;\n\nexport const runtimeState: {\n  activeTracker: Tracker;\n  batchDepth: number;\n  cleanupOwner: ((dispose: () => void) => void) | undefined;\n  flushingComputed: boolean;\n  nextComputationId: number;\n  notificationDepth: number;\n  pendingComputed: Set<ReactiveComputation>;\n} = {\n  activeTracker: null,\n  batchDepth: 0,\n  cleanupOwner: undefined,\n  flushingComputed: false,\n  nextComputationId: 0,\n  notificationDepth: 0,\n  pendingComputed: new Set(),\n};\n"]}
+{"version":3,"file":"state.js","sourceRoot":"","sources":["../src/state.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,+BAA+B,EAAE,MAAM,sBAAsB,CAAC;AAEvE,wEAAwE;AACxE,6EAA6E;AAC7E,+BAA+B;AAC/B,+BAA+B,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;AA6BjD,MAAM,CAAC,MAAM,YAAY,GAQrB;IACF,aAAa,EAAE,IAAI;IACnB,UAAU,EAAE,CAAC;IACb,YAAY,EAAE,SAAS;IACvB,gBAAgB,EAAE,KAAK;IACvB,iBAAiB,EAAE,CAAC;IACpB,iBAAiB,EAAE,CAAC;IACpB,eAAe,EAAE,IAAI,GAAG,EAAE;CAC3B,CAAC","sourcesContent":["import { warnOnDuplicateReactiveCoreCopy } from \"./duplicate-guard.js\";\n\n// This module holds the per-copy reactive runtime identity, so a second\n// evaluation in the same browser page is exactly the duplication that breaks\n// cross-package cell tracking.\nwarnOnDuplicateReactiveCoreCopy(import.meta.url);\n\nexport interface Source {\n  // null while nothing subscribes, the computation itself while exactly one\n  // does, and a Set from the second subscriber on (kept as a Set until it\n  // empties back to null). Most sources never allocate a Set at all, and hot\n  // write sites can gate on a null check instead of a Set.size accessor.\n  subscribers: ReactiveComputation | Set<ReactiveComputation> | null;\n  trackedBy?: ReactiveComputation | undefined;\n  trackedVersion?: number | undefined;\n}\n\nexport interface ReactiveComputation {\n  readonly id: number;\n  deps: Set<Source>;\n  trackingAddedDeps?: Source[] | undefined;\n  trackingCount?: number | undefined;\n  trackingTouchedDeps?: Source[] | undefined;\n  trackingVersion?: number | undefined;\n  disposed: boolean;\n  queued: boolean;\n  markDirty(): void;\n  run(): void;\n  dispose(): void;\n  trackSource?(source: Source): void;\n}\n\nexport type Tracker = ReactiveComputation | null;\n\nexport const runtimeState: {\n  activeTracker: Tracker;\n  batchDepth: number;\n  cleanupOwner: ((dispose: () => void) => void) | undefined;\n  flushingComputed: boolean;\n  nextComputationId: number;\n  notificationDepth: number;\n  pendingComputed: Set<ReactiveComputation>;\n} = {\n  activeTracker: null,\n  batchDepth: 0,\n  cleanupOwner: undefined,\n  flushingComputed: false,\n  nextComputationId: 0,\n  notificationDepth: 0,\n  pendingComputed: new Set(),\n};\n"]}

package/dist/tracking.d.ts

@@ -1,5 +1,6 @@
 import { type ReactiveComputation, type Source } from "./state.js";
 export declare function trackSource(source: Source): void;
+export declare function sourceSubscriberCount(source: Source): number;
 export declare function cleanupDeps(computation: ReactiveComputation): void;
 export declare function nextTrackingVersionFor(computation: ReactiveComputation): number;
 export declare function trackIncrementalSource(source: Source, computation: ReactiveComputation): void;

package/dist/tracking.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"tracking.d.ts","sourceRoot":"","sources":["../src/tracking.ts"],"names":[],"mappings":"AAAA,OAAO,EAAgB,KAAK,mBAAmB,EAAE,KAAK,MAAM,EAAE,MAAM,YAAY,CAAC;AAIjF,wBAAgB,WAAW,CAAC,MAAM,EAAE,MAAM,GAAG,IAAI,CA0BhD;AAED,wBAAgB,WAAW,CAAC,WAAW,EAAE,mBAAmB,GAAG,IAAI,CAmBlE;AAED,wBAAgB,sBAAsB,CAAC,WAAW,EAAE,mBAAmB,GAAG,MAAM,CAc/E;AAED,wBAAgB,sBAAsB,CACpC,MAAM,EAAE,MAAM,EACd,WAAW,EAAE,mBAAmB,GAC/B,IAAI,CA+BN;AAED,wBAAgB,2BAA2B,CAAC,WAAW,EAAE,mBAAmB,GAAG,IAAI,CAgBlF;AAED,wBAAgB,oBAAoB,CAClC,WAAW,EAAE,mBAAmB,EAChC,eAAe,EAAE,MAAM,GACtB,IAAI,CA+BN;AAED,wBAAgB,gBAAgB,CAAC,WAAW,EAAE,mBAAmB,GAAG,IAAI,CAyBvE;AAED,wBAAgB,iBAAiB,CAAC,MAAM,EAAE,MAAM,GAAG,IAAI,CAmDtD;AAED,wBAAgB,oBAAoB,IAAI,IAAI,CAmC3C"}
+{"version":3,"file":"tracking.d.ts","sourceRoot":"","sources":["../src/tracking.ts"],"names":[],"mappings":"AAAA,OAAO,EAAgB,KAAK,mBAAmB,EAAE,KAAK,MAAM,EAAE,MAAM,YAAY,CAAC;AAIjF,wBAAgB,WAAW,CAAC,MAAM,EAAE,MAAM,GAAG,IAAI,CAchD;AAgCD,wBAAgB,qBAAqB,CAAC,MAAM,EAAE,MAAM,GAAG,MAAM,CAI5D;AAED,wBAAgB,WAAW,CAAC,WAAW,EAAE,mBAAmB,GAAG,IAAI,CAalE;AAED,wBAAgB,sBAAsB,CAAC,WAAW,EAAE,mBAAmB,GAAG,MAAM,CAc/E;AAED,wBAAgB,sBAAsB,CACpC,MAAM,EAAE,MAAM,EACd,WAAW,EAAE,mBAAmB,GAC/B,IAAI,CAwBN;AAED,wBAAgB,2BAA2B,CAAC,WAAW,EAAE,mBAAmB,GAAG,IAAI,CAgBlF;AAED,wBAAgB,oBAAoB,CAClC,WAAW,EAAE,mBAAmB,EAChC,eAAe,EAAE,MAAM,GACtB,IAAI,CAyBN;AAED,wBAAgB,gBAAgB,CAAC,WAAW,EAAE,mBAAmB,GAAG,IAAI,CAmBvE;AAED,wBAAgB,iBAAiB,CAAC,MAAM,EAAE,MAAM,GAAG,IAAI,CAgDtD;AAED,wBAAgB,oBAAoB,IAAI,IAAI,CAmC3C"}

package/dist/tracking.js

@@ -9,35 +9,48 @@ export function trackSource(source) {
         tracker.trackSource(source);
         return;
     }
-    if (source.singleSubscriber === tracker) {
-        tracker.deps.add(source);
-        return;
-    }
-    const previousSize = source.subscribers.size;
-    source.subscribers.add(tracker);
+    addSourceSubscriber(source, tracker);
     tracker.deps.add(source);
-    if (previousSize === 0) {
-        source.singleSubscriber = tracker;
+}
+function addSourceSubscriber(source, computation) {
+    const subscribers = source.subscribers;
+    if (subscribers === null) {
+        source.subscribers = computation;
     }
-    else if (source.subscribers.size > 1) {
-        source.singleSubscriber = undefined;
+    else if (subscribers instanceof Set) {
+        subscribers.add(computation);
     }
+    else if (subscribers !== computation) {
+        source.subscribers = new Set([subscribers, computation]);
+    }
+}
+function removeSourceSubscriber(source, computation) {
+    const subscribers = source.subscribers;
+    if (subscribers === computation) {
+        source.subscribers = null;
+        return true;
+    }
+    if (subscribers instanceof Set && subscribers.delete(computation)) {
+        if (subscribers.size === 0) {
+            source.subscribers = null;
+        }
+        return true;
+    }
+    return false;
+}
+export function sourceSubscriberCount(source) {
+    const subscribers = source.subscribers;
+    return subscribers === null ? 0 : subscribers instanceof Set ? subscribers.size : 1;
 }
 export function cleanupDeps(computation) {
     for (const dep of computation.deps) {
-        if (!dep.subscribers.delete(computation)) {
+        if (!removeSourceSubscriber(dep, computation)) {
             continue;
         }
         if (dep.trackedBy === computation) {
             dep.trackedBy = undefined;
             dep.trackedVersion = undefined;
         }
-        if (dep.subscribers.size === 0) {
-            dep.singleSubscriber = undefined;
-        }
-        else if (dep.subscribers.size === 1) {
-            dep.singleSubscriber = dep.subscribers.values().next().value;
-        }
     }
     computation.deps.clear();
 }
@@ -69,16 +82,9 @@ export function trackIncrementalSource(source, computation) {
     if (computation.deps.has(source)) {
         return;
     }
-    const previousSize = source.subscribers.size;
-    source.subscribers.add(computation);
+    addSourceSubscriber(source, computation);
     computation.deps.add(source);
     computation.trackingAddedDeps?.push(source);
-    if (previousSize === 0) {
-        source.singleSubscriber = computation;
-    }
-    else if (source.subscribers.size > 1) {
-        source.singleSubscriber = undefined;
-    }
 }
 export function preserveIncrementalTracking(computation) {
     const trackingVersion = computation.trackingVersion;
@@ -102,7 +108,7 @@ export function cleanupUntrackedDeps(computation, trackingVersion) {
             (dep.trackedBy === computation && dep.trackedVersion === trackingVersion)) {
             continue;
         }
-        if (!dep.subscribers.delete(computation)) {
+        if (!removeSourceSubscriber(dep, computation)) {
             continue;
         }
         if (dep.trackedBy === computation) {
@@ -110,12 +116,6 @@ export function cleanupUntrackedDeps(computation, trackingVersion) {
             dep.trackedVersion = undefined;
         }
         computation.deps.delete(dep);
-        if (dep.subscribers.size === 0) {
-            dep.singleSubscriber = undefined;
-        }
-        else if (dep.subscribers.size === 1) {
-            dep.singleSubscriber = dep.subscribers.values().next().value;
-        }
     }
 }
 export function cleanupAddedDeps(computation) {
@@ -124,7 +124,7 @@ export function cleanupAddedDeps(computation) {
         return;
     }
     for (const dep of addedDeps) {
-        if (!dep.subscribers.delete(computation)) {
+        if (!removeSourceSubscriber(dep, computation)) {
             continue;
         }
         if (dep.trackedBy === computation) {
@@ -132,24 +132,18 @@ export function cleanupAddedDeps(computation) {
             dep.trackedVersion = undefined;
         }
         computation.deps.delete(dep);
-        if (dep.subscribers.size === 0) {
-            dep.singleSubscriber = undefined;
-        }
-        else if (dep.subscribers.size === 1) {
-            dep.singleSubscriber = dep.subscribers.values().next().value;
-        }
     }
 }
 export function notifySubscribers(source) {
-    if (source.subscribers.size === 0) {
+    const subscribers = source.subscribers;
+    if (subscribers === null) {
         return;
     }
-    const cachedSingleSubscriber = source.singleSubscriber;
-    if (cachedSingleSubscriber !== undefined) {
+    if (!(subscribers instanceof Set)) {
         runtimeState.notificationDepth += 1;
         try {
-            if (!cachedSingleSubscriber.disposed && !cachedSingleSubscriber.queued) {
-                cachedSingleSubscriber.markDirty();
+            if (!subscribers.disposed && !subscribers.queued) {
+                subscribers.markDirty();
             }
         }
         finally {
@@ -162,17 +156,14 @@ export function notifySubscribers(source) {
     }
     runtimeState.notificationDepth += 1;
     try {
-        const singleSubscriber = source.subscribers.size === 1
-            ? source.subscribers.values().next().value
-            : undefined;
+        const singleSubscriber = subscribers.size === 1 ? subscribers.values().next().value : undefined;
         if (singleSubscriber !== undefined) {
             if (!singleSubscriber.disposed && !singleSubscriber.queued) {
                 singleSubscriber.markDirty();
             }
         }
         else {
-            const subscribers = orderedComputations(source.subscribers);
-            for (const subscriber of subscribers) {
+            for (const subscriber of orderedComputations(subscribers)) {
                 if (!subscriber.disposed && !subscriber.queued) {
                     subscriber.markDirty();
                 }

package/dist/tracking.js.map

@@ -1 +1 @@
-{"version":3,"file":"tracking.js","sourceRoot":"","sources":["../src/tracking.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,YAAY,EAAyC,MAAM,YAAY,CAAC;AAEjF,MAAM,iCAAiC,GAAG,GAAG,CAAC;AAE9C,MAAM,UAAU,WAAW,CAAC,MAAc;IACxC,MAAM,OAAO,GAAG,YAAY,CAAC,aAAa,CAAC;IAE3C,IAAI,OAAO,KAAK,IAAI,IAAI,OAAO,CAAC,QAAQ,EAAE,CAAC;QACzC,OAAO;IACT,CAAC;IAED,IAAI,OAAO,CAAC,WAAW,KAAK,SAAS,EAAE,CAAC;QACtC,OAAO,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;QAC5B,OAAO;IACT,CAAC;IAED,IAAI,MAAM,CAAC,gBAAgB,KAAK,OAAO,EAAE,CAAC;QACxC,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACzB,OAAO;IACT,CAAC;IAED,MAAM,YAAY,GAAG,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC;IAC7C,MAAM,CAAC,WAAW,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;IAChC,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;IAEzB,IAAI,YAAY,KAAK,CAAC,EAAE,CAAC;QACvB,MAAM,CAAC,gBAAgB,GAAG,OAAO,CAAC;IACpC,CAAC;SAAM,IAAI,MAAM,CAAC,WAAW,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC;QACvC,MAAM,CAAC,gBAAgB,GAAG,SAAS,CAAC;IACtC,CAAC;AACH,CAAC;AAED,MAAM,UAAU,WAAW,CAAC,WAAgC;IAC1D,KAAK,MAAM,GAAG,IAAI,WAAW,CAAC,IAAI,EAAE,CAAC;QACnC,IAAI,CAAC,GAAG,CAAC,WAAW,CAAC,MAAM,CAAC,WAAW,CAAC,EAAE,CAAC;YACzC,SAAS;QACX,CAAC;QAED,IAAI,GAAG,CAAC,SAAS,KAAK,WAAW,EAAE,CAAC;YAClC,GAAG,CAAC,SAAS,GAAG,SAAS,CAAC;YAC1B,GAAG,CAAC,cAAc,GAAG,SAAS,CAAC;QACjC,CAAC;QAED,IAAI,GAAG,CAAC,WAAW,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;YAC/B,GAAG,CAAC,gBAAgB,GAAG,SAAS,CAAC;QACnC,CAAC;aAAM,IAAI,GAAG,CAAC,WAAW,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;YACtC,GAAG,CAAC,gBAAgB,GAAG,GAAG,CAAC,WAAW,CAAC,MAAM,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,CAAC;QAC/D,CAAC;IACH,CAAC;IAED,WAAW,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC;AAC3B,CAAC;AAED,MAAM,UAAU,sBAAsB,CAAC,WAAgC;IACrE,MAAM,mBAAmB,GAAG,CAAC,WAAW,CAAC,eAAe,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;IAEnE,IAAI,MAAM,CAAC,aAAa,CAAC,mBAAmB,CAAC,EAAE,CAAC;QAC9C,OAAO,mBAAmB,CAAC;IAC7B,CAAC;IAED,KAAK,MAAM,GAAG,IAAI,WAAW,CAAC,IAAI,EAAE,CAAC;QACnC,IAAI,GAAG,CAAC,SAAS,KAAK,WAAW,EAAE,CAAC;YAClC,GAAG,CAAC,cAAc,GAAG,SAAS,CAAC;QACjC,CAAC;IACH,CAAC;IAED,OAAO,CAAC,CAAC;AACX,CAAC;AAED,MAAM,UAAU,sBAAsB,CACpC,MAAc,EACd,WAAgC;IAEhC,MAAM,eAAe,GAAG,WAAW,CAAC,eAAe,CAAC;IAEpD,IAAI,eAAe,KAAK,SAAS,EAAE,CAAC;QAClC,WAAW,CAAC,MAAM,CAAC,CAAC;QACpB,OAAO;IACT,CAAC;IAED,IAAI,MAAM,CAAC,SAAS,KAAK,WAAW,IAAI,MAAM,CAAC,cAAc,KAAK,eAAe,EAAE,CAAC;QAClF,OAAO;IACT,CAAC;IAED,MAAM,CAAC,SAAS,GAAG,WAAW,CAAC;IAC/B,MAAM,CAAC,cAAc,GAAG,eAAe,CAAC;IACxC,WAAW,CAAC,aAAa,GAAG,CAAC,WAAW,CAAC,aAAa,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;IACjE,WAAW,CAAC,mBAAmB,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;IAE9C,IAAI,WAAW,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;QACjC,OAAO;IACT,CAAC;IAED,MAAM,YAAY,GAAG,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC;IAC7C,MAAM,CAAC,WAAW,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;IACpC,WAAW,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;IAC7B,WAAW,CAAC,iBAAiB,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;IAE5C,IAAI,YAAY,KAAK,CAAC,EAAE,CAAC;QACvB,MAAM,CAAC,gBAAgB,GAAG,WAAW,CAAC;IACxC,CAAC;SAAM,IAAI,MAAM,CAAC,WAAW,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC;QACvC,MAAM,CAAC,gBAAgB,GAAG,SAAS,CAAC;IACtC,CAAC;AACH,CAAC;AAED,MAAM,UAAU,2BAA2B,CAAC,WAAgC;IAC1E,MAAM,eAAe,GAAG,WAAW,CAAC,eAAe,CAAC;IAEpD,IAAI,eAAe,KAAK,SAAS,IAAI,WAAW,CAAC,mBAAmB,KAAK,SAAS,EAAE,CAAC;QACnF,OAAO;IACT,CAAC;IAED,MAAM,WAAW,GAAa,EAAE,CAAC;IAEjC,KAAK,MAAM,GAAG,IAAI,WAAW,CAAC,IAAI,EAAE,CAAC;QACnC,IAAI,GAAG,CAAC,SAAS,KAAK,WAAW,IAAI,GAAG,CAAC,cAAc,KAAK,eAAe,EAAE,CAAC;YAC5E,WAAW,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACxB,CAAC;IACH,CAAC;IAED,WAAW,CAAC,mBAAmB,GAAG,WAAW,CAAC;AAChD,CAAC;AAED,MAAM,UAAU,oBAAoB,CAClC,WAAgC,EAChC,eAAuB;IAEvB,MAAM,WAAW,GACf,WAAW,CAAC,mBAAmB,KAAK,SAAS;QAC3C,CAAC,CAAC,SAAS;QACX,CAAC,CAAC,IAAI,GAAG,CAAC,WAAW,CAAC,mBAAmB,CAAC,CAAC;IAE/C,KAAK,MAAM,GAAG,IAAI,WAAW,CAAC,IAAI,EAAE,CAAC;QACnC,IACE,WAAW,EAAE,GAAG,CAAC,GAAG,CAAC,KAAK,IAAI;YAC9B,CAAC,GAAG,CAAC,SAAS,KAAK,WAAW,IAAI,GAAG,CAAC,cAAc,KAAK,eAAe,CAAC,EACzE,CAAC;YACD,SAAS;QACX,CAAC;QAED,IAAI,CAAC,GAAG,CAAC,WAAW,CAAC,MAAM,CAAC,WAAW,CAAC,EAAE,CAAC;YACzC,SAAS;QACX,CAAC;QAED,IAAI,GAAG,CAAC,SAAS,KAAK,WAAW,EAAE,CAAC;YAClC,GAAG,CAAC,SAAS,GAAG,SAAS,CAAC;YAC1B,GAAG,CAAC,cAAc,GAAG,SAAS,CAAC;QACjC,CAAC;QAED,WAAW,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QAE7B,IAAI,GAAG,CAAC,WAAW,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;YAC/B,GAAG,CAAC,gBAAgB,GAAG,SAAS,CAAC;QACnC,CAAC;aAAM,IAAI,GAAG,CAAC,WAAW,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;YACtC,GAAG,CAAC,gBAAgB,GAAG,GAAG,CAAC,WAAW,CAAC,MAAM,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,CAAC;QAC/D,CAAC;IACH,CAAC;AACH,CAAC;AAED,MAAM,UAAU,gBAAgB,CAAC,WAAgC;IAC/D,MAAM,SAAS,GAAG,WAAW,CAAC,iBAAiB,CAAC;IAEhD,IAAI,SAAS,KAAK,SAAS,EAAE,CAAC;QAC5B,OAAO;IACT,CAAC;IAED,KAAK,MAAM,GAAG,IAAI,SAAS,EAAE,CAAC;QAC5B,IAAI,CAAC,GAAG,CAAC,WAAW,CAAC,MAAM,CAAC,WAAW,CAAC,EAAE,CAAC;YACzC,SAAS;QACX,CAAC;QAED,IAAI,GAAG,CAAC,SAAS,KAAK,WAAW,EAAE,CAAC;YAClC,GAAG,CAAC,SAAS,GAAG,SAAS,CAAC;YAC1B,GAAG,CAAC,cAAc,GAAG,SAAS,CAAC;QACjC,CAAC;QAED,WAAW,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QAE7B,IAAI,GAAG,CAAC,WAAW,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;YAC/B,GAAG,CAAC,gBAAgB,GAAG,SAAS,CAAC;QACnC,CAAC;aAAM,IAAI,GAAG,CAAC,WAAW,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;YACtC,GAAG,CAAC,gBAAgB,GAAG,GAAG,CAAC,WAAW,CAAC,MAAM,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,CAAC;QAC/D,CAAC;IACH,CAAC;AACH,CAAC;AAED,MAAM,UAAU,iBAAiB,CAAC,MAAc;IAC9C,IAAI,MAAM,CAAC,WAAW,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;QAClC,OAAO;IACT,CAAC;IAED,MAAM,sBAAsB,GAAG,MAAM,CAAC,gBAAgB,CAAC;IACvD,IAAI,sBAAsB,KAAK,SAAS,EAAE,CAAC;QACzC,YAAY,CAAC,iBAAiB,IAAI,CAAC,CAAC;QAEpC,IAAI,CAAC;YACH,IAAI,CAAC,sBAAsB,CAAC,QAAQ,IAAI,CAAC,sBAAsB,CAAC,MAAM,EAAE,CAAC;gBACvE,sBAAsB,CAAC,SAAS,EAAE,CAAC;YACrC,CAAC;QACH,CAAC;gBAAS,CAAC;YACT,YAAY,CAAC,iBAAiB,IAAI,CAAC,CAAC;YAEpC,IAAI,YAAY,CAAC,iBAAiB,KAAK,CAAC,IAAI,YAAY,CAAC,UAAU,KAAK,CAAC,EAAE,CAAC;gBAC1E,oBAAoB,EAAE,CAAC;YACzB,CAAC;QACH,CAAC;QACD,OAAO;IACT,CAAC;IAED,YAAY,CAAC,iBAAiB,IAAI,CAAC,CAAC;IAEpC,IAAI,CAAC;QACH,MAAM,gBAAgB,GACpB,MAAM,CAAC,WAAW,CAAC,IAAI,KAAK,CAAC;YAC3B,CAAC,CAAC,MAAM,CAAC,WAAW,CAAC,MAAM,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK;YAC1C,CAAC,CAAC,SAAS,CAAC;QAEhB,IAAI,gBAAgB,KAAK,SAAS,EAAE,CAAC;YACnC,IAAI,CAAC,gBAAgB,CAAC,QAAQ,IAAI,CAAC,gBAAgB,CAAC,MAAM,EAAE,CAAC;gBAC3D,gBAAgB,CAAC,SAAS,EAAE,CAAC;YAC/B,CAAC;QACH,CAAC;aAAM,CAAC;YACN,MAAM,WAAW,GAAG,mBAAmB,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC;YAE5D,KAAK,MAAM,UAAU,IAAI,WAAW,EAAE,CAAC;gBACrC,IAAI,CAAC,UAAU,CAAC,QAAQ,IAAI,CAAC,UAAU,CAAC,MAAM,EAAE,CAAC;oBAC/C,UAAU,CAAC,SAAS,EAAE,CAAC;gBACzB,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;YAAS,CAAC;QACT,YAAY,CAAC,iBAAiB,IAAI,CAAC,CAAC;QAEpC,IAAI,YAAY,CAAC,iBAAiB,KAAK,CAAC,IAAI,YAAY,CAAC,UAAU,KAAK,CAAC,EAAE,CAAC;YAC1E,oBAAoB,EAAE,CAAC;QACzB,CAAC;IACH,CAAC;AACH,CAAC;AAED,MAAM,UAAU,oBAAoB;IAClC,IAAI,YAAY,CAAC,gBAAgB,EAAE,CAAC;QAClC,OAAO;IACT,CAAC;IAED,YAAY,CAAC,gBAAgB,GAAG,IAAI,CAAC;IAErC,IAAI,CAAC;QACH,KACE,IAAI,SAAS,GAAG,CAAC,EACjB,YAAY,CAAC,eAAe,CAAC,IAAI,GAAG,CAAC,EACrC,SAAS,IAAI,CAAC,EACd,CAAC;YACD,IAAI,SAAS,IAAI,iCAAiC,EAAE,CAAC;gBACnD,YAAY,CAAC,eAAe,CAAC,KAAK,EAAE,CAAC;gBACrC,MAAM,IAAI,KAAK,CAAC,wCAAwC,CAAC,CAAC;YAC5D,CAAC;YAED,MAAM,YAAY,GAChB,YAAY,CAAC,eAAe,CAAC,IAAI,KAAK,CAAC;gBACrC,CAAC,CAAC,CAAC,YAAY,CAAC,eAAe,CAAC,MAAM,EAAE,CAAC,IAAI,EAAE,CAAC,KAA4B,CAAC;gBAC7E,CAAC,CAAC,mBAAmB,CAAC,YAAY,CAAC,eAAe,CAAC,CAAC;YACxD,YAAY,CAAC,eAAe,CAAC,KAAK,EAAE,CAAC;YAErC,KAAK,MAAM,WAAW,IAAI,YAAY,EAAE,CAAC;gBACvC,WAAW,CAAC,MAAM,GAAG,KAAK,CAAC;gBAE3B,IAAI,CAAC,WAAW,CAAC,QAAQ,EAAE,CAAC;oBAC1B,WAAW,CAAC,GAAG,EAAE,CAAC;gBACpB,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;YAAS,CAAC;QACT,YAAY,CAAC,gBAAgB,GAAG,KAAK,CAAC;IACxC,CAAC;AACH,CAAC;AAED,SAAS,mBAAmB,CAC1B,YAA8C;IAE9C,MAAM,OAAO,GAA0B,EAAE,CAAC;IAC1C,IAAI,UAAU,GAAG,CAAC,CAAC,CAAC;IACpB,IAAI,SAAS,GAAG,IAAI,CAAC;IAErB,KAAK,MAAM,WAAW,IAAI,YAAY,EAAE,CAAC;QACvC,OAAO,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;QAE1B,IAAI,WAAW,CAAC,EAAE,GAAG,UAAU,EAAE,CAAC;YAChC,SAAS,GAAG,KAAK,CAAC;QACpB,CAAC;QAED,UAAU,GAAG,WAAW,CAAC,EAAE,CAAC;IAC9B,CAAC;IAED,OAAO,SAAS,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC;QACpC,CAAC,CAAC,OAAO;QACT,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC;AAC1C,CAAC","sourcesContent":["import { runtimeState, type ReactiveComputation, type Source } from \"./state.js\";\n\nconst maxPendingComputedFlushIterations = 100;\n\nexport function trackSource(source: Source): void {\n  const tracker = runtimeState.activeTracker;\n\n  if (tracker === null || tracker.disposed) {\n    return;\n  }\n\n  if (tracker.trackSource !== undefined) {\n    tracker.trackSource(source);\n    return;\n  }\n\n  if (source.singleSubscriber === tracker) {\n    tracker.deps.add(source);\n    return;\n  }\n\n  const previousSize = source.subscribers.size;\n  source.subscribers.add(tracker);\n  tracker.deps.add(source);\n\n  if (previousSize === 0) {\n    source.singleSubscriber = tracker;\n  } else if (source.subscribers.size > 1) {\n    source.singleSubscriber = undefined;\n  }\n}\n\nexport function cleanupDeps(computation: ReactiveComputation): void {\n  for (const dep of computation.deps) {\n    if (!dep.subscribers.delete(computation)) {\n      continue;\n    }\n\n    if (dep.trackedBy === computation) {\n      dep.trackedBy = undefined;\n      dep.trackedVersion = undefined;\n    }\n\n    if (dep.subscribers.size === 0) {\n      dep.singleSubscriber = undefined;\n    } else if (dep.subscribers.size === 1) {\n      dep.singleSubscriber = dep.subscribers.values().next().value;\n    }\n  }\n\n  computation.deps.clear();\n}\n\nexport function nextTrackingVersionFor(computation: ReactiveComputation): number {\n  const nextTrackingVersion = (computation.trackingVersion ?? 0) + 1;\n\n  if (Number.isSafeInteger(nextTrackingVersion)) {\n    return nextTrackingVersion;\n  }\n\n  for (const dep of computation.deps) {\n    if (dep.trackedBy === computation) {\n      dep.trackedVersion = undefined;\n    }\n  }\n\n  return 1;\n}\n\nexport function trackIncrementalSource(\n  source: Source,\n  computation: ReactiveComputation,\n): void {\n  const trackingVersion = computation.trackingVersion;\n\n  if (trackingVersion === undefined) {\n    trackSource(source);\n    return;\n  }\n\n  if (source.trackedBy === computation && source.trackedVersion === trackingVersion) {\n    return;\n  }\n\n  source.trackedBy = computation;\n  source.trackedVersion = trackingVersion;\n  computation.trackingCount = (computation.trackingCount ?? 0) + 1;\n  computation.trackingTouchedDeps?.push(source);\n\n  if (computation.deps.has(source)) {\n    return;\n  }\n\n  const previousSize = source.subscribers.size;\n  source.subscribers.add(computation);\n  computation.deps.add(source);\n  computation.trackingAddedDeps?.push(source);\n\n  if (previousSize === 0) {\n    source.singleSubscriber = computation;\n  } else if (source.subscribers.size > 1) {\n    source.singleSubscriber = undefined;\n  }\n}\n\nexport function preserveIncrementalTracking(computation: ReactiveComputation): void {\n  const trackingVersion = computation.trackingVersion;\n\n  if (trackingVersion === undefined || computation.trackingTouchedDeps !== undefined) {\n    return;\n  }\n\n  const touchedDeps: Source[] = [];\n\n  for (const dep of computation.deps) {\n    if (dep.trackedBy === computation && dep.trackedVersion === trackingVersion) {\n      touchedDeps.push(dep);\n    }\n  }\n\n  computation.trackingTouchedDeps = touchedDeps;\n}\n\nexport function cleanupUntrackedDeps(\n  computation: ReactiveComputation,\n  trackingVersion: number,\n): void {\n  const touchedDeps =\n    computation.trackingTouchedDeps === undefined\n      ? undefined\n      : new Set(computation.trackingTouchedDeps);\n\n  for (const dep of computation.deps) {\n    if (\n      touchedDeps?.has(dep) === true ||\n      (dep.trackedBy === computation && dep.trackedVersion === trackingVersion)\n    ) {\n      continue;\n    }\n\n    if (!dep.subscribers.delete(computation)) {\n      continue;\n    }\n\n    if (dep.trackedBy === computation) {\n      dep.trackedBy = undefined;\n      dep.trackedVersion = undefined;\n    }\n\n    computation.deps.delete(dep);\n\n    if (dep.subscribers.size === 0) {\n      dep.singleSubscriber = undefined;\n    } else if (dep.subscribers.size === 1) {\n      dep.singleSubscriber = dep.subscribers.values().next().value;\n    }\n  }\n}\n\nexport function cleanupAddedDeps(computation: ReactiveComputation): void {\n  const addedDeps = computation.trackingAddedDeps;\n\n  if (addedDeps === undefined) {\n    return;\n  }\n\n  for (const dep of addedDeps) {\n    if (!dep.subscribers.delete(computation)) {\n      continue;\n    }\n\n    if (dep.trackedBy === computation) {\n      dep.trackedBy = undefined;\n      dep.trackedVersion = undefined;\n    }\n\n    computation.deps.delete(dep);\n\n    if (dep.subscribers.size === 0) {\n      dep.singleSubscriber = undefined;\n    } else if (dep.subscribers.size === 1) {\n      dep.singleSubscriber = dep.subscribers.values().next().value;\n    }\n  }\n}\n\nexport function notifySubscribers(source: Source): void {\n  if (source.subscribers.size === 0) {\n    return;\n  }\n\n  const cachedSingleSubscriber = source.singleSubscriber;\n  if (cachedSingleSubscriber !== undefined) {\n    runtimeState.notificationDepth += 1;\n\n    try {\n      if (!cachedSingleSubscriber.disposed && !cachedSingleSubscriber.queued) {\n        cachedSingleSubscriber.markDirty();\n      }\n    } finally {\n      runtimeState.notificationDepth -= 1;\n\n      if (runtimeState.notificationDepth === 0 && runtimeState.batchDepth === 0) {\n        flushPendingComputed();\n      }\n    }\n    return;\n  }\n\n  runtimeState.notificationDepth += 1;\n\n  try {\n    const singleSubscriber =\n      source.subscribers.size === 1\n        ? source.subscribers.values().next().value\n        : undefined;\n\n    if (singleSubscriber !== undefined) {\n      if (!singleSubscriber.disposed && !singleSubscriber.queued) {\n        singleSubscriber.markDirty();\n      }\n    } else {\n      const subscribers = orderedComputations(source.subscribers);\n\n      for (const subscriber of subscribers) {\n        if (!subscriber.disposed && !subscriber.queued) {\n          subscriber.markDirty();\n        }\n      }\n    }\n  } finally {\n    runtimeState.notificationDepth -= 1;\n\n    if (runtimeState.notificationDepth === 0 && runtimeState.batchDepth === 0) {\n      flushPendingComputed();\n    }\n  }\n}\n\nexport function flushPendingComputed(): void {\n  if (runtimeState.flushingComputed) {\n    return;\n  }\n\n  runtimeState.flushingComputed = true;\n\n  try {\n    for (\n      let iteration = 0;\n      runtimeState.pendingComputed.size > 0;\n      iteration += 1\n    ) {\n      if (iteration >= maxPendingComputedFlushIterations) {\n        runtimeState.pendingComputed.clear();\n        throw new Error(\"Reactive computed flush limit exceeded\");\n      }\n\n      const computations =\n        runtimeState.pendingComputed.size === 1\n          ? [runtimeState.pendingComputed.values().next().value as ReactiveComputation]\n          : orderedComputations(runtimeState.pendingComputed);\n      runtimeState.pendingComputed.clear();\n\n      for (const computation of computations) {\n        computation.queued = false;\n\n        if (!computation.disposed) {\n          computation.run();\n        }\n      }\n    }\n  } finally {\n    runtimeState.flushingComputed = false;\n  }\n}\n\nfunction orderedComputations(\n  computations: ReadonlySet<ReactiveComputation>,\n): ReactiveComputation[] {\n  const ordered: ReactiveComputation[] = [];\n  let previousId = -1;\n  let monotonic = true;\n\n  for (const computation of computations) {\n    ordered.push(computation);\n\n    if (computation.id < previousId) {\n      monotonic = false;\n    }\n\n    previousId = computation.id;\n  }\n\n  return monotonic || ordered.length < 2\n    ? ordered\n    : ordered.sort((a, b) => a.id - b.id);\n}\n"]}
+{"version":3,"file":"tracking.js","sourceRoot":"","sources":["../src/tracking.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,YAAY,EAAyC,MAAM,YAAY,CAAC;AAEjF,MAAM,iCAAiC,GAAG,GAAG,CAAC;AAE9C,MAAM,UAAU,WAAW,CAAC,MAAc;IACxC,MAAM,OAAO,GAAG,YAAY,CAAC,aAAa,CAAC;IAE3C,IAAI,OAAO,KAAK,IAAI,IAAI,OAAO,CAAC,QAAQ,EAAE,CAAC;QACzC,OAAO;IACT,CAAC;IAED,IAAI,OAAO,CAAC,WAAW,KAAK,SAAS,EAAE,CAAC;QACtC,OAAO,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;QAC5B,OAAO;IACT,CAAC;IAED,mBAAmB,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;IACrC,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;AAC3B,CAAC;AAED,SAAS,mBAAmB,CAAC,MAAc,EAAE,WAAgC;IAC3E,MAAM,WAAW,GAAG,MAAM,CAAC,WAAW,CAAC;IAEvC,IAAI,WAAW,KAAK,IAAI,EAAE,CAAC;QACzB,MAAM,CAAC,WAAW,GAAG,WAAW,CAAC;IACnC,CAAC;SAAM,IAAI,WAAW,YAAY,GAAG,EAAE,CAAC;QACtC,WAAW,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;IAC/B,CAAC;SAAM,IAAI,WAAW,KAAK,WAAW,EAAE,CAAC;QACvC,MAAM,CAAC,WAAW,GAAG,IAAI,GAAG,CAAC,CAAC,WAAW,EAAE,WAAW,CAAC,CAAC,CAAC;IAC3D,CAAC;AACH,CAAC;AAED,SAAS,sBAAsB,CAAC,MAAc,EAAE,WAAgC;IAC9E,MAAM,WAAW,GAAG,MAAM,CAAC,WAAW,CAAC;IAEvC,IAAI,WAAW,KAAK,WAAW,EAAE,CAAC;QAChC,MAAM,CAAC,WAAW,GAAG,IAAI,CAAC;QAC1B,OAAO,IAAI,CAAC;IACd,CAAC;IAED,IAAI,WAAW,YAAY,GAAG,IAAI,WAAW,CAAC,MAAM,CAAC,WAAW,CAAC,EAAE,CAAC;QAClE,IAAI,WAAW,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;YAC3B,MAAM,CAAC,WAAW,GAAG,IAAI,CAAC;QAC5B,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED,OAAO,KAAK,CAAC;AACf,CAAC;AAED,MAAM,UAAU,qBAAqB,CAAC,MAAc;IAClD,MAAM,WAAW,GAAG,MAAM,CAAC,WAAW,CAAC;IAEvC,OAAO,WAAW,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,WAAW,YAAY,GAAG,CAAC,CAAC,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;AACtF,CAAC;AAED,MAAM,UAAU,WAAW,CAAC,WAAgC;IAC1D,KAAK,MAAM,GAAG,IAAI,WAAW,CAAC,IAAI,EAAE,CAAC;QACnC,IAAI,CAAC,sBAAsB,CAAC,GAAG,EAAE,WAAW,CAAC,EAAE,CAAC;YAC9C,SAAS;QACX,CAAC;QAED,IAAI,GAAG,CAAC,SAAS,KAAK,WAAW,EAAE,CAAC;YAClC,GAAG,CAAC,SAAS,GAAG,SAAS,CAAC;YAC1B,GAAG,CAAC,cAAc,GAAG,SAAS,CAAC;QACjC,CAAC;IACH,CAAC;IAED,WAAW,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC;AAC3B,CAAC;AAED,MAAM,UAAU,sBAAsB,CAAC,WAAgC;IACrE,MAAM,mBAAmB,GAAG,CAAC,WAAW,CAAC,eAAe,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;IAEnE,IAAI,MAAM,CAAC,aAAa,CAAC,mBAAmB,CAAC,EAAE,CAAC;QAC9C,OAAO,mBAAmB,CAAC;IAC7B,CAAC;IAED,KAAK,MAAM,GAAG,IAAI,WAAW,CAAC,IAAI,EAAE,CAAC;QACnC,IAAI,GAAG,CAAC,SAAS,KAAK,WAAW,EAAE,CAAC;YAClC,GAAG,CAAC,cAAc,GAAG,SAAS,CAAC;QACjC,CAAC;IACH,CAAC;IAED,OAAO,CAAC,CAAC;AACX,CAAC;AAED,MAAM,UAAU,sBAAsB,CACpC,MAAc,EACd,WAAgC;IAEhC,MAAM,eAAe,GAAG,WAAW,CAAC,eAAe,CAAC;IAEpD,IAAI,eAAe,KAAK,SAAS,EAAE,CAAC;QAClC,WAAW,CAAC,MAAM,CAAC,CAAC;QACpB,OAAO;IACT,CAAC;IAED,IAAI,MAAM,CAAC,SAAS,KAAK,WAAW,IAAI,MAAM,CAAC,cAAc,KAAK,eAAe,EAAE,CAAC;QAClF,OAAO;IACT,CAAC;IAED,MAAM,CAAC,SAAS,GAAG,WAAW,CAAC;IAC/B,MAAM,CAAC,cAAc,GAAG,eAAe,CAAC;IACxC,WAAW,CAAC,aAAa,GAAG,CAAC,WAAW,CAAC,aAAa,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;IACjE,WAAW,CAAC,mBAAmB,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;IAE9C,IAAI,WAAW,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;QACjC,OAAO;IACT,CAAC;IAED,mBAAmB,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC;IACzC,WAAW,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;IAC7B,WAAW,CAAC,iBAAiB,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;AAC9C,CAAC;AAED,MAAM,UAAU,2BAA2B,CAAC,WAAgC;IAC1E,MAAM,eAAe,GAAG,WAAW,CAAC,eAAe,CAAC;IAEpD,IAAI,eAAe,KAAK,SAAS,IAAI,WAAW,CAAC,mBAAmB,KAAK,SAAS,EAAE,CAAC;QACnF,OAAO;IACT,CAAC;IAED,MAAM,WAAW,GAAa,EAAE,CAAC;IAEjC,KAAK,MAAM,GAAG,IAAI,WAAW,CAAC,IAAI,EAAE,CAAC;QACnC,IAAI,GAAG,CAAC,SAAS,KAAK,WAAW,IAAI,GAAG,CAAC,cAAc,KAAK,eAAe,EAAE,CAAC;YAC5E,WAAW,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACxB,CAAC;IACH,CAAC;IAED,WAAW,CAAC,mBAAmB,GAAG,WAAW,CAAC;AAChD,CAAC;AAED,MAAM,UAAU,oBAAoB,CAClC,WAAgC,EAChC,eAAuB;IAEvB,MAAM,WAAW,GACf,WAAW,CAAC,mBAAmB,KAAK,SAAS;QAC3C,CAAC,CAAC,SAAS;QACX,CAAC,CAAC,IAAI,GAAG,CAAC,WAAW,CAAC,mBAAmB,CAAC,CAAC;IAE/C,KAAK,MAAM,GAAG,IAAI,WAAW,CAAC,IAAI,EAAE,CAAC;QACnC,IACE,WAAW,EAAE,GAAG,CAAC,GAAG,CAAC,KAAK,IAAI;YAC9B,CAAC,GAAG,CAAC,SAAS,KAAK,WAAW,IAAI,GAAG,CAAC,cAAc,KAAK,eAAe,CAAC,EACzE,CAAC;YACD,SAAS;QACX,CAAC;QAED,IAAI,CAAC,sBAAsB,CAAC,GAAG,EAAE,WAAW,CAAC,EAAE,CAAC;YAC9C,SAAS;QACX,CAAC;QAED,IAAI,GAAG,CAAC,SAAS,KAAK,WAAW,EAAE,CAAC;YAClC,GAAG,CAAC,SAAS,GAAG,SAAS,CAAC;YAC1B,GAAG,CAAC,cAAc,GAAG,SAAS,CAAC;QACjC,CAAC;QAED,WAAW,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;IAC/B,CAAC;AACH,CAAC;AAED,MAAM,UAAU,gBAAgB,CAAC,WAAgC;IAC/D,MAAM,SAAS,GAAG,WAAW,CAAC,iBAAiB,CAAC;IAEhD,IAAI,SAAS,KAAK,SAAS,EAAE,CAAC;QAC5B,OAAO;IACT,CAAC;IAED,KAAK,MAAM,GAAG,IAAI,SAAS,EAAE,CAAC;QAC5B,IAAI,CAAC,sBAAsB,CAAC,GAAG,EAAE,WAAW,CAAC,EAAE,CAAC;YAC9C,SAAS;QACX,CAAC;QAED,IAAI,GAAG,CAAC,SAAS,KAAK,WAAW,EAAE,CAAC;YAClC,GAAG,CAAC,SAAS,GAAG,SAAS,CAAC;YAC1B,GAAG,CAAC,cAAc,GAAG,SAAS,CAAC;QACjC,CAAC;QAED,WAAW,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;IAC/B,CAAC;AACH,CAAC;AAED,MAAM,UAAU,iBAAiB,CAAC,MAAc;IAC9C,MAAM,WAAW,GAAG,MAAM,CAAC,WAAW,CAAC;IAEvC,IAAI,WAAW,KAAK,IAAI,EAAE,CAAC;QACzB,OAAO;IACT,CAAC;IAED,IAAI,CAAC,CAAC,WAAW,YAAY,GAAG,CAAC,EAAE,CAAC;QAClC,YAAY,CAAC,iBAAiB,IAAI,CAAC,CAAC;QAEpC,IAAI,CAAC;YACH,IAAI,CAAC,WAAW,CAAC,QAAQ,IAAI,CAAC,WAAW,CAAC,MAAM,EAAE,CAAC;gBACjD,WAAW,CAAC,SAAS,EAAE,CAAC;YAC1B,CAAC;QACH,CAAC;gBAAS,CAAC;YACT,YAAY,CAAC,iBAAiB,IAAI,CAAC,CAAC;YAEpC,IAAI,YAAY,CAAC,iBAAiB,KAAK,CAAC,IAAI,YAAY,CAAC,UAAU,KAAK,CAAC,EAAE,CAAC;gBAC1E,oBAAoB,EAAE,CAAC;YACzB,CAAC;QACH,CAAC;QACD,OAAO;IACT,CAAC;IAED,YAAY,CAAC,iBAAiB,IAAI,CAAC,CAAC;IAEpC,IAAI,CAAC;QACH,MAAM,gBAAgB,GACpB,WAAW,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,MAAM,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,SAAS,CAAC;QAEzE,IAAI,gBAAgB,KAAK,SAAS,EAAE,CAAC;YACnC,IAAI,CAAC,gBAAgB,CAAC,QAAQ,IAAI,CAAC,gBAAgB,CAAC,MAAM,EAAE,CAAC;gBAC3D,gBAAgB,CAAC,SAAS,EAAE,CAAC;YAC/B,CAAC;QACH,CAAC;aAAM,CAAC;YACN,KAAK,MAAM,UAAU,IAAI,mBAAmB,CAAC,WAAW,CAAC,EAAE,CAAC;gBAC1D,IAAI,CAAC,UAAU,CAAC,QAAQ,IAAI,CAAC,UAAU,CAAC,MAAM,EAAE,CAAC;oBAC/C,UAAU,CAAC,SAAS,EAAE,CAAC;gBACzB,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;YAAS,CAAC;QACT,YAAY,CAAC,iBAAiB,IAAI,CAAC,CAAC;QAEpC,IAAI,YAAY,CAAC,iBAAiB,KAAK,CAAC,IAAI,YAAY,CAAC,UAAU,KAAK,CAAC,EAAE,CAAC;YAC1E,oBAAoB,EAAE,CAAC;QACzB,CAAC;IACH,CAAC;AACH,CAAC;AAED,MAAM,UAAU,oBAAoB;IAClC,IAAI,YAAY,CAAC,gBAAgB,EAAE,CAAC;QAClC,OAAO;IACT,CAAC;IAED,YAAY,CAAC,gBAAgB,GAAG,IAAI,CAAC;IAErC,IAAI,CAAC;QACH,KACE,IAAI,SAAS,GAAG,CAAC,EACjB,YAAY,CAAC,eAAe,CAAC,IAAI,GAAG,CAAC,EACrC,SAAS,IAAI,CAAC,EACd,CAAC;YACD,IAAI,SAAS,IAAI,iCAAiC,EAAE,CAAC;gBACnD,YAAY,CAAC,eAAe,CAAC,KAAK,EAAE,CAAC;gBACrC,MAAM,IAAI,KAAK,CAAC,wCAAwC,CAAC,CAAC;YAC5D,CAAC;YAED,MAAM,YAAY,GAChB,YAAY,CAAC,eAAe,CAAC,IAAI,KAAK,CAAC;gBACrC,CAAC,CAAC,CAAC,YAAY,CAAC,eAAe,CAAC,MAAM,EAAE,CAAC,IAAI,EAAE,CAAC,KAA4B,CAAC;gBAC7E,CAAC,CAAC,mBAAmB,CAAC,YAAY,CAAC,eAAe,CAAC,CAAC;YACxD,YAAY,CAAC,eAAe,CAAC,KAAK,EAAE,CAAC;YAErC,KAAK,MAAM,WAAW,IAAI,YAAY,EAAE,CAAC;gBACvC,WAAW,CAAC,MAAM,GAAG,KAAK,CAAC;gBAE3B,IAAI,CAAC,WAAW,CAAC,QAAQ,EAAE,CAAC;oBAC1B,WAAW,CAAC,GAAG,EAAE,CAAC;gBACpB,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;YAAS,CAAC;QACT,YAAY,CAAC,gBAAgB,GAAG,KAAK,CAAC;IACxC,CAAC;AACH,CAAC;AAED,SAAS,mBAAmB,CAC1B,YAA8C;IAE9C,MAAM,OAAO,GAA0B,EAAE,CAAC;IAC1C,IAAI,UAAU,GAAG,CAAC,CAAC,CAAC;IACpB,IAAI,SAAS,GAAG,IAAI,CAAC;IAErB,KAAK,MAAM,WAAW,IAAI,YAAY,EAAE,CAAC;QACvC,OAAO,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;QAE1B,IAAI,WAAW,CAAC,EAAE,GAAG,UAAU,EAAE,CAAC;YAChC,SAAS,GAAG,KAAK,CAAC;QACpB,CAAC;QAED,UAAU,GAAG,WAAW,CAAC,EAAE,CAAC;IAC9B,CAAC;IAED,OAAO,SAAS,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC;QACpC,CAAC,CAAC,OAAO;QACT,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC;AAC1C,CAAC","sourcesContent":["import { runtimeState, type ReactiveComputation, type Source } from \"./state.js\";\n\nconst maxPendingComputedFlushIterations = 100;\n\nexport function trackSource(source: Source): void {\n  const tracker = runtimeState.activeTracker;\n\n  if (tracker === null || tracker.disposed) {\n    return;\n  }\n\n  if (tracker.trackSource !== undefined) {\n    tracker.trackSource(source);\n    return;\n  }\n\n  addSourceSubscriber(source, tracker);\n  tracker.deps.add(source);\n}\n\nfunction addSourceSubscriber(source: Source, computation: ReactiveComputation): void {\n  const subscribers = source.subscribers;\n\n  if (subscribers === null) {\n    source.subscribers = computation;\n  } else if (subscribers instanceof Set) {\n    subscribers.add(computation);\n  } else if (subscribers !== computation) {\n    source.subscribers = new Set([subscribers, computation]);\n  }\n}\n\nfunction removeSourceSubscriber(source: Source, computation: ReactiveComputation): boolean {\n  const subscribers = source.subscribers;\n\n  if (subscribers === computation) {\n    source.subscribers = null;\n    return true;\n  }\n\n  if (subscribers instanceof Set && subscribers.delete(computation)) {\n    if (subscribers.size === 0) {\n      source.subscribers = null;\n    }\n    return true;\n  }\n\n  return false;\n}\n\nexport function sourceSubscriberCount(source: Source): number {\n  const subscribers = source.subscribers;\n\n  return subscribers === null ? 0 : subscribers instanceof Set ? subscribers.size : 1;\n}\n\nexport function cleanupDeps(computation: ReactiveComputation): void {\n  for (const dep of computation.deps) {\n    if (!removeSourceSubscriber(dep, computation)) {\n      continue;\n    }\n\n    if (dep.trackedBy === computation) {\n      dep.trackedBy = undefined;\n      dep.trackedVersion = undefined;\n    }\n  }\n\n  computation.deps.clear();\n}\n\nexport function nextTrackingVersionFor(computation: ReactiveComputation): number {\n  const nextTrackingVersion = (computation.trackingVersion ?? 0) + 1;\n\n  if (Number.isSafeInteger(nextTrackingVersion)) {\n    return nextTrackingVersion;\n  }\n\n  for (const dep of computation.deps) {\n    if (dep.trackedBy === computation) {\n      dep.trackedVersion = undefined;\n    }\n  }\n\n  return 1;\n}\n\nexport function trackIncrementalSource(\n  source: Source,\n  computation: ReactiveComputation,\n): void {\n  const trackingVersion = computation.trackingVersion;\n\n  if (trackingVersion === undefined) {\n    trackSource(source);\n    return;\n  }\n\n  if (source.trackedBy === computation && source.trackedVersion === trackingVersion) {\n    return;\n  }\n\n  source.trackedBy = computation;\n  source.trackedVersion = trackingVersion;\n  computation.trackingCount = (computation.trackingCount ?? 0) + 1;\n  computation.trackingTouchedDeps?.push(source);\n\n  if (computation.deps.has(source)) {\n    return;\n  }\n\n  addSourceSubscriber(source, computation);\n  computation.deps.add(source);\n  computation.trackingAddedDeps?.push(source);\n}\n\nexport function preserveIncrementalTracking(computation: ReactiveComputation): void {\n  const trackingVersion = computation.trackingVersion;\n\n  if (trackingVersion === undefined || computation.trackingTouchedDeps !== undefined) {\n    return;\n  }\n\n  const touchedDeps: Source[] = [];\n\n  for (const dep of computation.deps) {\n    if (dep.trackedBy === computation && dep.trackedVersion === trackingVersion) {\n      touchedDeps.push(dep);\n    }\n  }\n\n  computation.trackingTouchedDeps = touchedDeps;\n}\n\nexport function cleanupUntrackedDeps(\n  computation: ReactiveComputation,\n  trackingVersion: number,\n): void {\n  const touchedDeps =\n    computation.trackingTouchedDeps === undefined\n      ? undefined\n      : new Set(computation.trackingTouchedDeps);\n\n  for (const dep of computation.deps) {\n    if (\n      touchedDeps?.has(dep) === true ||\n      (dep.trackedBy === computation && dep.trackedVersion === trackingVersion)\n    ) {\n      continue;\n    }\n\n    if (!removeSourceSubscriber(dep, computation)) {\n      continue;\n    }\n\n    if (dep.trackedBy === computation) {\n      dep.trackedBy = undefined;\n      dep.trackedVersion = undefined;\n    }\n\n    computation.deps.delete(dep);\n  }\n}\n\nexport function cleanupAddedDeps(computation: ReactiveComputation): void {\n  const addedDeps = computation.trackingAddedDeps;\n\n  if (addedDeps === undefined) {\n    return;\n  }\n\n  for (const dep of addedDeps) {\n    if (!removeSourceSubscriber(dep, computation)) {\n      continue;\n    }\n\n    if (dep.trackedBy === computation) {\n      dep.trackedBy = undefined;\n      dep.trackedVersion = undefined;\n    }\n\n    computation.deps.delete(dep);\n  }\n}\n\nexport function notifySubscribers(source: Source): void {\n  const subscribers = source.subscribers;\n\n  if (subscribers === null) {\n    return;\n  }\n\n  if (!(subscribers instanceof Set)) {\n    runtimeState.notificationDepth += 1;\n\n    try {\n      if (!subscribers.disposed && !subscribers.queued) {\n        subscribers.markDirty();\n      }\n    } finally {\n      runtimeState.notificationDepth -= 1;\n\n      if (runtimeState.notificationDepth === 0 && runtimeState.batchDepth === 0) {\n        flushPendingComputed();\n      }\n    }\n    return;\n  }\n\n  runtimeState.notificationDepth += 1;\n\n  try {\n    const singleSubscriber =\n      subscribers.size === 1 ? subscribers.values().next().value : undefined;\n\n    if (singleSubscriber !== undefined) {\n      if (!singleSubscriber.disposed && !singleSubscriber.queued) {\n        singleSubscriber.markDirty();\n      }\n    } else {\n      for (const subscriber of orderedComputations(subscribers)) {\n        if (!subscriber.disposed && !subscriber.queued) {\n          subscriber.markDirty();\n        }\n      }\n    }\n  } finally {\n    runtimeState.notificationDepth -= 1;\n\n    if (runtimeState.notificationDepth === 0 && runtimeState.batchDepth === 0) {\n      flushPendingComputed();\n    }\n  }\n}\n\nexport function flushPendingComputed(): void {\n  if (runtimeState.flushingComputed) {\n    return;\n  }\n\n  runtimeState.flushingComputed = true;\n\n  try {\n    for (\n      let iteration = 0;\n      runtimeState.pendingComputed.size > 0;\n      iteration += 1\n    ) {\n      if (iteration >= maxPendingComputedFlushIterations) {\n        runtimeState.pendingComputed.clear();\n        throw new Error(\"Reactive computed flush limit exceeded\");\n      }\n\n      const computations =\n        runtimeState.pendingComputed.size === 1\n          ? [runtimeState.pendingComputed.values().next().value as ReactiveComputation]\n          : orderedComputations(runtimeState.pendingComputed);\n      runtimeState.pendingComputed.clear();\n\n      for (const computation of computations) {\n        computation.queued = false;\n\n        if (!computation.disposed) {\n          computation.run();\n        }\n      }\n    }\n  } finally {\n    runtimeState.flushingComputed = false;\n  }\n}\n\nfunction orderedComputations(\n  computations: ReadonlySet<ReactiveComputation>,\n): ReactiveComputation[] {\n  const ordered: ReactiveComputation[] = [];\n  let previousId = -1;\n  let monotonic = true;\n\n  for (const computation of computations) {\n    ordered.push(computation);\n\n    if (computation.id < previousId) {\n      monotonic = false;\n    }\n\n    previousId = computation.id;\n  }\n\n  return monotonic || ordered.length < 2\n    ? ordered\n    : ordered.sort((a, b) => a.id - b.id);\n}\n"]}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@reckona/mreact-reactive-core",
-  "version": "0.0.153",
+  "version": "0.0.154",
   "description": "Fine-grained reactive primitives used across mreact.",
   "keywords": [
     "jsx",

package/src/batch.ts

@@ -1,8 +1,10 @@
 import { runtimeState } from "./state.js";
+import { invalidateDevtoolsWriteCache } from "./cell.js";
 import { schedulePendingFlush } from "./scheduler.js";
 import { flushPendingComputed } from "./tracking.js";
 
 export function batch<T>(fn: () => T): T {
+  invalidateDevtoolsWriteCache();
   runtimeState.batchDepth += 1;
 
   try {
@@ -18,6 +20,7 @@ export function batch<T>(fn: () => T): T {
 }
 
 export async function batchAsync<T>(fn: () => Promise<T> | T): Promise<T> {
+  invalidateDevtoolsWriteCache();
   runtimeState.batchDepth += 1;
 
   try {

package/src/cell.ts

@@ -1,6 +1,6 @@
 import type { Cell } from "./types.js";
 import type { Source } from "./state.js";
-import { notifySubscribers, trackSource } from "./tracking.js";
+import { notifySubscribers, sourceSubscriberCount, trackSource } from "./tracking.js";
 
 declare const __MREACT_CLIENT_DEVTOOLS__: boolean | undefined;
 
@@ -8,52 +8,112 @@ const clientDevtoolsDisabled =
   typeof __MREACT_CLIENT_DEVTOOLS__ !== "undefined" &&
   __MREACT_CLIENT_DEVTOOLS__ === false;
 
+interface DevtoolsHook {
+  emit?: ((event: Record<string, unknown>) => void) | undefined;
+}
+
+type GlobalWithDevtools = typeof globalThis & {
+  __mreactDevtools?: DevtoolsHook | undefined;
+};
+
+// Write-path devtools cache: `undefined` = not sampled yet, `null` = sampled
+// and absent, object = sampled and attached. The no-devtools write fast path
+// is a single module-local null comparison instead of a globalThis property
+// walk per write. A late attach is observed at the next batch or flush
+// boundary (see invalidateDevtoolsWriteCache callers); a detach or hook swap
+// is observed on the next write because the emit path revalidates identity.
+let cachedDevtoolsHook: DevtoolsHook | null | undefined = clientDevtoolsDisabled
+  ? null
+  : undefined;
+
+export function invalidateDevtoolsWriteCache(): void {
+  if (!clientDevtoolsDisabled) {
+    cachedDevtoolsHook = undefined;
+  }
+}
+
+function resolveDevtoolsHook(): DevtoolsHook | null {
+  const hook = (globalThis as GlobalWithDevtools).__mreactDevtools;
+  const resolved = hook !== undefined && typeof hook.emit === "function" ? hook : null;
+  cachedDevtoolsHook = resolved;
+  return resolved;
+}
+
+function emitCellSetEvent<T>(source: Source, previous: T, value: T): void {
+  // Cold path: only reached while a devtools hook is (or was) attached, or on
+  // the first write after a cache invalidation. Revalidate against the live
+  // global so a disposed or swapped hook never receives stale events.
+  const live = (globalThis as GlobalWithDevtools).__mreactDevtools;
+  const hook =
+    cachedDevtoolsHook !== undefined && cachedDevtoolsHook === live
+      ? cachedDevtoolsHook
+      : resolveDevtoolsHook();
+
+  if (hook === null) {
+    return;
+  }
+
+  const emit = hook.emit;
+
+  if (typeof emit !== "function") {
+    return;
+  }
+
+  emit.call(hook, {
+    package: "@reckona/mreact-reactive-core",
+    previous,
+    subscribers: sourceSubscriberCount(source),
+    timestamp: Date.now(),
+    type: "reactive:cell:set",
+    value,
+  });
+}
+
+interface CellState<T> {
+  value: T;
+  readonly source: Source;
+}
+
+// One shared write function keeps the hot store/notify sequence in a single
+// optimizable function instead of a fresh fat closure per cell.
+function writeCellValue<T>(state: CellState<T>, next: T | ((prev: T) => T)): void {
+  const previous = state.value;
+  const resolved =
+    typeof next === "function" ? (next as (prev: T) => T)(previous) : next;
+
+  if (Object.is(previous, resolved)) {
+    return;
+  }
+
+  state.value = resolved;
+
+  // clientDevtoolsDisabled folds to true under the client build define, which
+  // makes this branch statically dead so bundlers drop the emit path (and its
+  // globalThis.__mreactDevtools references) from production client bundles.
+  if (!clientDevtoolsDisabled && cachedDevtoolsHook !== null) {
+    emitCellSetEvent(state.source, previous, resolved);
+  }
+
+  if (state.source.subscribers !== null) {
+    notifySubscribers(state.source);
+  }
+}
+
 export function cell<T>(initial: T): Cell<T> {
-  let current = initial;
-  const source: Source = {
-    subscribers: new Set(),
+  const state: CellState<T> = {
+    source: {
+      subscribers: null,
+    },
+    value: initial,
   };
 
   return {
     get(): T {
-      trackSource(source);
-      return current;
+      trackSource(state.source);
+      return state.value;
     },
     set(next: T | ((prev: T) => T)): void {
-      const resolved = typeof next === "function" ? (next as (prev: T) => T)(current) : next;
-
-      if (Object.is(current, resolved)) {
-        return;
-      }
-
-      if (clientDevtoolsDisabled) {
-        current = resolved;
-      } else {
-        const devtools = (
-          globalThis as typeof globalThis & {
-            __mreactDevtools?:
-              | { emit?: (event: Record<string, unknown>) => void }
-              | undefined;
-          }
-        ).__mreactDevtools;
-        const emit = devtools?.emit;
-
-        if (typeof emit !== "function") {
-          current = resolved;
-        } else {
-          const previous = current;
-          current = resolved;
-          emit.call(devtools, {
-            package: "@reckona/mreact-reactive-core",
-            previous,
-            subscribers: source.subscribers.size,
-            timestamp: Date.now(),
-            type: "reactive:cell:set",
-            value: resolved,
-          });
-        }
-      }
-      notifySubscribers(source);
+      writeCellValue(state, next);
     },
   };
 }

package/src/computed.ts

@@ -29,7 +29,7 @@ export function computed<T>(
   const equals = typeof options === "function" ? options : (options?.equals ?? Object.is);
 
   const source: Source = {
-    subscribers: new Set(),
+    subscribers: null,
   };
 
   const computation: ReactiveComputation = {
@@ -39,14 +39,14 @@ export function computed<T>(
     queued: false,
     markDirty() {
       if (dirty) {
-        if (source.subscribers.size === 0 || computation.queued) {
+        if (source.subscribers === null || computation.queued) {
           return;
         }
       }
 
       dirty = true;
 
-      if (source.subscribers.size > 0) {
+      if (source.subscribers !== null) {
         if (runtimeState.notificationDepth > 0) {
           computation.queued = true;
           runtimeState.pendingComputed.add(computation);
@@ -71,8 +71,7 @@ export function computed<T>(
       computation.queued = false;
       runtimeState.pendingComputed.delete(computation);
       cleanupDeps(computation);
-      source.subscribers.clear();
-      source.singleSubscriber = undefined;
+      source.subscribers = null;
     },
   };
 

package/src/scheduler.ts

@@ -1,3 +1,4 @@
+import { invalidateDevtoolsWriteCache } from "./cell.js";
 import { runtimeState, type ReactiveComputation } from "./state.js";
 
 export interface Scheduler {
@@ -86,6 +87,7 @@ export function flushQueuedComputations(): void {
     return;
   }
 
+  invalidateDevtoolsWriteCache();
   scheduled = false;
   flushing = true;
   let firstError: unknown;

package/src/state.ts

@@ -6,8 +6,11 @@ import { warnOnDuplicateReactiveCoreCopy } from "./duplicate-guard.js";
 warnOnDuplicateReactiveCoreCopy(import.meta.url);
 
 export interface Source {
-  singleSubscriber?: ReactiveComputation | undefined;
-  subscribers: Set<ReactiveComputation>;
+  // null while nothing subscribes, the computation itself while exactly one
+  // does, and a Set from the second subscriber on (kept as a Set until it
+  // empties back to null). Most sources never allocate a Set at all, and hot
+  // write sites can gate on a null check instead of a Set.size accessor.
+  subscribers: ReactiveComputation | Set<ReactiveComputation> | null;
   trackedBy?: ReactiveComputation | undefined;
   trackedVersion?: number | undefined;
 }

package/src/tracking.ts

@@ -14,25 +14,49 @@ export function trackSource(source: Source): void {
     return;
   }
 
-  if (source.singleSubscriber === tracker) {
-    tracker.deps.add(source);
-    return;
+  addSourceSubscriber(source, tracker);
+  tracker.deps.add(source);
+}
+
+function addSourceSubscriber(source: Source, computation: ReactiveComputation): void {
+  const subscribers = source.subscribers;
+
+  if (subscribers === null) {
+    source.subscribers = computation;
+  } else if (subscribers instanceof Set) {
+    subscribers.add(computation);
+  } else if (subscribers !== computation) {
+    source.subscribers = new Set([subscribers, computation]);
   }
+}
 
-  const previousSize = source.subscribers.size;
-  source.subscribers.add(tracker);
-  tracker.deps.add(source);
+function removeSourceSubscriber(source: Source, computation: ReactiveComputation): boolean {
+  const subscribers = source.subscribers;
+
+  if (subscribers === computation) {
+    source.subscribers = null;
+    return true;
+  }
 
-  if (previousSize === 0) {
-    source.singleSubscriber = tracker;
-  } else if (source.subscribers.size > 1) {
-    source.singleSubscriber = undefined;
+  if (subscribers instanceof Set && subscribers.delete(computation)) {
+    if (subscribers.size === 0) {
+      source.subscribers = null;
+    }
+    return true;
   }
+
+  return false;
+}
+
+export function sourceSubscriberCount(source: Source): number {
+  const subscribers = source.subscribers;
+
+  return subscribers === null ? 0 : subscribers instanceof Set ? subscribers.size : 1;
 }
 
 export function cleanupDeps(computation: ReactiveComputation): void {
   for (const dep of computation.deps) {
-    if (!dep.subscribers.delete(computation)) {
+    if (!removeSourceSubscriber(dep, computation)) {
       continue;
     }
 
@@ -40,12 +64,6 @@ export function cleanupDeps(computation: ReactiveComputation): void {
       dep.trackedBy = undefined;
       dep.trackedVersion = undefined;
     }
-
-    if (dep.subscribers.size === 0) {
-      dep.singleSubscriber = undefined;
-    } else if (dep.subscribers.size === 1) {
-      dep.singleSubscriber = dep.subscribers.values().next().value;
-    }
   }
 
   computation.deps.clear();
@@ -91,16 +109,9 @@ export function trackIncrementalSource(
     return;
   }
 
-  const previousSize = source.subscribers.size;
-  source.subscribers.add(computation);
+  addSourceSubscriber(source, computation);
   computation.deps.add(source);
   computation.trackingAddedDeps?.push(source);
-
-  if (previousSize === 0) {
-    source.singleSubscriber = computation;
-  } else if (source.subscribers.size > 1) {
-    source.singleSubscriber = undefined;
-  }
 }
 
 export function preserveIncrementalTracking(computation: ReactiveComputation): void {
@@ -138,7 +149,7 @@ export function cleanupUntrackedDeps(
       continue;
     }
 
-    if (!dep.subscribers.delete(computation)) {
+    if (!removeSourceSubscriber(dep, computation)) {
       continue;
     }
 
@@ -148,12 +159,6 @@ export function cleanupUntrackedDeps(
     }
 
     computation.deps.delete(dep);
-
-    if (dep.subscribers.size === 0) {
-      dep.singleSubscriber = undefined;
-    } else if (dep.subscribers.size === 1) {
-      dep.singleSubscriber = dep.subscribers.values().next().value;
-    }
   }
 }
 
@@ -165,7 +170,7 @@ export function cleanupAddedDeps(computation: ReactiveComputation): void {
   }
 
   for (const dep of addedDeps) {
-    if (!dep.subscribers.delete(computation)) {
+    if (!removeSourceSubscriber(dep, computation)) {
       continue;
     }
 
@@ -175,27 +180,22 @@ export function cleanupAddedDeps(computation: ReactiveComputation): void {
     }
 
     computation.deps.delete(dep);
-
-    if (dep.subscribers.size === 0) {
-      dep.singleSubscriber = undefined;
-    } else if (dep.subscribers.size === 1) {
-      dep.singleSubscriber = dep.subscribers.values().next().value;
-    }
   }
 }
 
 export function notifySubscribers(source: Source): void {
-  if (source.subscribers.size === 0) {
+  const subscribers = source.subscribers;
+
+  if (subscribers === null) {
     return;
   }
 
-  const cachedSingleSubscriber = source.singleSubscriber;
-  if (cachedSingleSubscriber !== undefined) {
+  if (!(subscribers instanceof Set)) {
     runtimeState.notificationDepth += 1;
 
     try {
-      if (!cachedSingleSubscriber.disposed && !cachedSingleSubscriber.queued) {
-        cachedSingleSubscriber.markDirty();
+      if (!subscribers.disposed && !subscribers.queued) {
+        subscribers.markDirty();
       }
     } finally {
       runtimeState.notificationDepth -= 1;
@@ -211,18 +211,14 @@ export function notifySubscribers(source: Source): void {
 
   try {
     const singleSubscriber =
-      source.subscribers.size === 1
-        ? source.subscribers.values().next().value
-        : undefined;
+      subscribers.size === 1 ? subscribers.values().next().value : undefined;
 
     if (singleSubscriber !== undefined) {
       if (!singleSubscriber.disposed && !singleSubscriber.queued) {
         singleSubscriber.markDirty();
       }
     } else {
-      const subscribers = orderedComputations(source.subscribers);
-
-      for (const subscriber of subscribers) {
+      for (const subscriber of orderedComputations(subscribers)) {
         if (!subscriber.disposed && !subscriber.queued) {
           subscriber.markDirty();
         }