@reckona/mreact-reactive-core 0.0.152 → 0.0.154

package/dist/tracking.js

@@ -9,38 +9,63 @@ 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 (subscribers instanceof Set) {
+        subscribers.add(computation);
     }
-    else if (source.subscribers.size > 1) {
-        source.singleSubscriber = undefined;
+    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();
 }
+export function nextTrackingVersionFor(computation) {
+    const nextTrackingVersion = (computation.trackingVersion ?? 0) + 1;
+    if (Number.isSafeInteger(nextTrackingVersion)) {
+        return nextTrackingVersion;
+    }
+    for (const dep of computation.deps) {
+        if (dep.trackedBy === computation) {
+            dep.trackedVersion = undefined;
+        }
+    }
+    return 1;
+}
 export function trackIncrementalSource(source, computation) {
     const trackingVersion = computation.trackingVersion;
     if (trackingVersion === undefined) {
@@ -57,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;
@@ -90,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) {
@@ -98,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) {
@@ -112,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) {
@@ -120,26 +132,19 @@ 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 (cachedSingleSubscriber.disposed || cachedSingleSubscriber.queued) {
-            return;
-        }
+    if (!(subscribers instanceof Set)) {
         runtimeState.notificationDepth += 1;
         try {
-            cachedSingleSubscriber.markDirty();
+            if (!subscribers.disposed && !subscribers.queued) {
+                subscribers.markDirty();
+            }
         }
         finally {
             runtimeState.notificationDepth -= 1;
@@ -151,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,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,IAAI,sBAAsB,CAAC,QAAQ,IAAI,sBAAsB,CAAC,MAAM,EAAE,CAAC;YACrE,OAAO;QACT,CAAC;QAED,YAAY,CAAC,iBAAiB,IAAI,CAAC,CAAC;QAEpC,IAAI,CAAC;YACH,sBAAsB,CAAC,SAAS,EAAE,CAAC;QACrC,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 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    if (cachedSingleSubscriber.disposed || cachedSingleSubscriber.queued) {\n      return;\n    }\n\n    runtimeState.notificationDepth += 1;\n\n    try {\n      cachedSingleSubscriber.markDirty();\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.152",
+  "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,59 +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,
-          });
-        }
-      }
-      const singleSubscriber = source.singleSubscriber;
-      if (
-        singleSubscriber !== undefined &&
-        (singleSubscriber.disposed || singleSubscriber.queued)
-      ) {
-        return;
-      }
-      notifySubscribers(source);
+      writeCellValue(state, next);
     },
   };
 }

package/src/computed.ts

@@ -5,6 +5,7 @@ import {
   cleanupAddedDeps,
   cleanupDeps,
   cleanupUntrackedDeps,
+  nextTrackingVersionFor,
   notifySubscribers,
   preserveIncrementalTracking,
   trackIncrementalSource,
@@ -28,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 = {
@@ -38,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);
@@ -67,8 +68,10 @@ export function computed<T>(
       }
 
       computation.disposed = true;
+      computation.queued = false;
+      runtimeState.pendingComputed.delete(computation);
       cleanupDeps(computation);
-      source.subscribers.clear();
+      source.subscribers = null;
     },
   };
 
@@ -106,7 +109,7 @@ export function computed<T>(
 
     const previousTracker = runtimeState.activeTracker;
     const previousDepsSize = computation.deps.size;
-    const nextTrackingVersion = (computation.trackingVersion ?? 0) + 1;
+    const nextTrackingVersion = nextTrackingVersionFor(computation);
 
     computation.trackingAddedDeps = [];
     computation.trackingCount = 0;

package/src/effect.ts

@@ -5,6 +5,7 @@ import { runtimeState, type ReactiveComputation } from "./state.js";
 import {
   cleanupDeps,
   cleanupUntrackedDeps,
+  nextTrackingVersionFor,
   trackIncrementalSource,
 } from "./tracking.js";
 
@@ -39,7 +40,7 @@ export function effect(fn: () => void | (() => void)): () => void {
       }
 
       const previousDepsSize = computation.deps.size;
-      const nextTrackingVersion = (computation.trackingVersion ?? 0) + 1;
+      const nextTrackingVersion = nextTrackingVersionFor(computation);
 
       computation.trackingAddedDeps = [];
       computation.trackingCount = 0;
@@ -88,6 +89,8 @@ export function effect(fn: () => void | (() => void)): () => void {
       }
 
       computation.disposed = true;
+      computation.queued = false;
+      runtimeState.pendingComputed.delete(computation);
       cleanupDeps(computation);
 
       if (cleanup !== undefined) {
@@ -104,6 +107,8 @@ export function effect(fn: () => void | (() => void)): () => void {
     computation.run();
   } catch (error) {
     computation.disposed = true;
+    computation.queued = false;
+    runtimeState.pendingComputed.delete(computation);
     cleanupDeps(computation);
 
     if (cleanup !== undefined) {

package/src/scheduler.ts

@@ -1,3 +1,4 @@
+import { invalidateDevtoolsWriteCache } from "./cell.js";
 import { runtimeState, type ReactiveComputation } from "./state.js";
 
 export interface Scheduler {
@@ -32,6 +33,16 @@ export function setScheduler(nextScheduler: Scheduler): () => void {
   };
 }
 
+export function resetSchedulerStateForTesting(): void {
+  for (const computation of queue) {
+    computation.queued = false;
+  }
+
+  clearQueue();
+  scheduled = false;
+  flushing = false;
+}
+
 export function queueComputation(computation: ReactiveComputation): void {
   if (computation.disposed || computation.queued) {
     return;
@@ -76,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/testing.ts

@@ -1,4 +1,4 @@
-import { flushQueuedComputations } from "./scheduler.js";
+import { flushQueuedComputations, resetSchedulerStateForTesting } from "./scheduler.js";
 import { setScheduler, type Scheduler } from "./scheduler.js";
 
 export async function flushMicrotasks(): Promise<void> {
@@ -41,6 +41,7 @@ export function createReactiveTestRuntime(): ReactiveTestRuntime {
       }
       disposed = true;
       scheduled.length = 0;
+      resetSchedulerStateForTesting();
       restore();
     },
     flushAll() {