@raphy-js/raph 1.0.0-dev.18 → 1.0.1-dev.20

package/dist/debug/reactivity/engine.js

@@ -1,10 +1,10 @@
 var P = Object.defineProperty;
 var B = (c, e, t) => e in c ? P(c, e, { enumerable: !0, configurable: !0, writable: !0, value: t }) : c[e] = t;
-var D = (c, e, t) => B(c, typeof e != "symbol" ? e + "" : e, t);
+var b = (c, e, t) => B(c, typeof e != "symbol" ? e + "" : e, t);
 import { reactiveObject as G } from "./reactive-object.js";
 import { appendScopeChild as z, ScopeNode as M, throwScopeErrors as F, detachScopeChild as K } from "./scope.js";
 import { watchWithReactivity as Y } from "./watch.js";
-const w = 1, d = 2, C = 4, S = 8, T = 16, y = 32, x = 64, W = 128, m = 256, v = 512, E = w | d, R = 16, X = 2;
+const w = 1, p = 2, C = 4, D = 8, T = 16, y = 32, x = 64, W = 128, m = 256, v = 512, E = w | p, R = 16, X = 2;
 function N(c) {
   c.dependencyLookupDebt === void 0 && c.dependencyIndex === void 0 || (c.dependencyIndex = void 0, c.dependencyLookupDebt = void 0, c.dependencyLookupSearches = void 0);
 }
@@ -20,7 +20,7 @@ function q(c, e) {
   c.dependencyIndex = s, c.dependencyLookupDebt = void 0, c.dependencyLookupSearches = void 0;
 }
 function j(c, e, t) {
-  var l;
+  var a;
   const i = c.firstSub;
   if (i === null)
     return;
@@ -31,17 +31,17 @@ function j(c, e, t) {
   if (s.sub === e)
     return c.subSearchCursor = s.nextSub ?? i, s;
   if (t) {
-    const r = (l = e.dependencyIndex) == null ? void 0 : l.get(c);
+    const r = (a = e.dependencyIndex) == null ? void 0 : a.get(c);
     if (r !== void 0)
       return c.subSearchCursor = r.nextSub ?? i, r;
     if (e.dependencyIndex !== void 0)
       return;
   }
-  let a = s.nextSub ?? i;
-  for (; a !== s; ) {
-    if (++n, a.sub === e)
-      return c.subSearchCursor = a.nextSub ?? i, t && q(e, n), a;
-    a = a.nextSub ?? i;
+  let l = s.nextSub ?? i;
+  for (; l !== s; ) {
+    if (++n, l.sub === e)
+      return c.subSearchCursor = l.nextSub ?? i, t && q(e, n), l;
+    l = l.nextSub ?? i;
   }
   t && q(e, n);
 }
@@ -54,41 +54,41 @@ class U {
    */
   constructor(e = {}) {
     // Opt-in стратегия длинного slow path; не добавляет policy field каждой ноде.
-    D(this, "adaptiveDependencyIndex");
+    b(this, "adaptiveDependencyIndex");
     // Потребитель текущего синхронного чтения; null отключает отслеживание.
-    D(this, "activeSub", null);
+    b(this, "activeSub", null);
     // Глубина вложенных синхронных границ группировки.
-    D(this, "batchDepth", 0);
+    b(this, "batchDepth", 0);
     // Индекс следующего элемента внутренней очереди эффектов.
-    D(this, "effectReadIndex", 0);
+    b(this, "effectReadIndex", 0);
     // Позиция добавления элемента в текущем проходе очереди.
-    D(this, "effectWriteIndex", 0);
+    b(this, "effectWriteIndex", 0);
     // Граница активного префикса переиспользуемого стека invalidation.
-    D(this, "invalidationDepth", 0);
+    b(this, "invalidationDepth", 0);
     // Граница активного префикса стека проверки зависимостей.
-    D(this, "dependencyDepth", 0);
+    b(this, "dependencyDepth", 0);
     // Защита внутренней очереди от вложенного повторного прохода.
-    D(this, "flushingEffects", !1);
+    b(this, "flushingEffects", !1);
     // Переиспользуемый буфер очереди; прочитанная ячейка сразу освобождает ссылку.
-    D(this, "effectQueue", new Array(16).fill(void 0));
+    b(this, "effectQueue", new Array(16).fill(void 0));
     // Переиспользуемый стек распространения invalidation; исходный способ выделения сохранён.
-    D(this, "invalidationStack", new Array(512).fill(null));
+    b(this, "invalidationStack", new Array(512).fill(null));
     // Переиспользуемый стек проверки зависимостей с защитой активного вложенного префикса.
-    D(this, "dependencyStack", []);
+    b(this, "dependencyStack", []);
     // Общие адаптеры receiver для handles этого экземпляра.
     // Создаются один раз, чтобы computed не хранил дополнительную ссылку на движок
     // и не выделял отдельные get/peek closures на каждый источник.
-    D(this, "handleReaders", this.createHandleReaders());
+    b(this, "handleReaders", this.createHandleReaders());
     // Выбранная внешняя политика; у синхронного экземпляра отсутствует.
-    D(this, "effectScheduler");
+    b(this, "effectScheduler");
     // Прямой обработчик очереди, выбранный один раз при создании экземпляра.
-    D(this, "flushEffects");
+    b(this, "flushEffects");
     /**
      * Синхронная регистрация эффекта для Runtime и watch независимо от внешней политики.
      * Это связанная ссылка на реализацию effect(), а не делегирующая функция.
      * @internal
      */
-    D(this, "_effectImmediate");
+    b(this, "_effectImmediate");
     this.adaptiveDependencyIndex = e.adaptiveDependencyIndex ?? !1, this.effectScheduler = e.effectScheduler, this._effectImmediate = this.effect.bind(this), this.signal = this.signal.bind(this), this.computed = this.computed.bind(this), this.reactive = this.reactive.bind(this), this.watch = this.watch.bind(this), this.batch = this.batch.bind(this), this.untracked = this.untracked.bind(this), this.scope = this.scope.bind(this), this._signalAccess = this._signalAccess.bind(this), this._computedAccess = this._computedAccess.bind(this), this._ownedSignal = this._ownedSignal.bind(this), this._ownedComputed = this._ownedComputed.bind(this), this._isTracking = this._isTracking.bind(this), this._isFlushingEffects = this._isFlushingEffects.bind(this), this._startBatch = this._startBatch.bind(this), this._endBatch = this._endBatch.bind(this), this.effect = this.effectScheduler === void 0 ? this._effectImmediate : this.createScheduledEffect.bind(this), this.flushEffects = this.effectScheduler === void 0 ? this.flushSyncEffects : this.flushExternalEffects;
   }
   // ---------------------------------------------
@@ -102,21 +102,21 @@ class U {
   signal(e) {
     let t = e, i;
     const s = () => {
-      const a = i;
-      if (a !== void 0)
-        return this.readSignalValue(a);
-      const l = this.activeSub;
-      return l === null || (i = this.materializeSignal(
+      const l = i;
+      if (l !== void 0)
+        return this.readSignalValue(l);
+      const a = this.activeSub;
+      return a === null || (i = this.materializeSignal(
         t,
-        l
+        a
       )), t;
-    }, n = (a) => {
-      const l = i;
-      if (l !== void 0) {
-        this.writeSignalValue(l, a);
+    }, n = (l) => {
+      const a = i;
+      if (a !== void 0) {
+        this.writeSignalValue(a, l);
         return;
       }
-      t !== a && (t = a);
+      t !== l && (t = l);
     };
     return {
       get: s,
@@ -147,7 +147,7 @@ class U {
    * @param onStop Однократная окончательная очистка, независимая от повторных запусков.
    */
   effect(e, t) {
-    const i = this.allocateGraphRecord(void 0, e, d | w | y);
+    const i = this.allocateGraphRecord(void 0, e, p | w | y);
     t !== void 0 && (i.onStop = t);
     const s = this.activeSub;
     s !== null && s.flags & y && z(s, i);
@@ -156,8 +156,8 @@ class U {
     } catch (n) {
       try {
         this.disposeEffect(i);
-      } catch (a) {
-        throw new AggregateError([n, a], "Effect registration and cleanup failed.");
+      } catch (l) {
+        throw new AggregateError([n, l], "Effect registration and cleanup failed.");
       }
       throw n;
     }
@@ -290,43 +290,43 @@ class U {
    * @param onStop Однократная окончательная очистка.
    */
   createScheduledEffect(e, t) {
-    const i = this.allocateGraphRecord(void 0, e, d | w | y);
+    const i = this.allocateGraphRecord(void 0, e, p | w | y);
     let s = !1;
     t !== void 0 && (i.onStop = t);
     const n = this.activeSub;
     n !== null && n.flags & y && z(n, i);
-    const a = () => {
+    const l = () => {
       if (!(!(i.flags & x) || i.evaluate === void 0)) {
         i.flags &= ~x, s = !0;
         try {
           this.executeEffect(i);
-        } catch (l) {
+        } catch (a) {
           if (!this.batchDepth && this.effectReadIndex !== this.effectWriteIndex)
             try {
               this.flushEffects();
             } catch (r) {
               throw new AggregateError(
-                [l, r],
+                [a, r],
                 "Effect execution and queue processing failed."
               );
             }
-          throw l;
+          throw a;
         }
         !this.batchDepth && this.effectReadIndex !== this.effectWriteIndex && this.flushEffects();
       }
     };
     try {
-      const l = this.effectScheduler.bind(a);
-      l.cancelPending = () => i.evaluate === void 0 || !s ? !1 : (this.settleCancelledDependencies(i), i.flags &= ~(x | E | C), !this.batchDepth && this.effectReadIndex !== this.effectWriteIndex && this.flushEffects(), !0), l.rearmPending = () => {
-        i.evaluate !== void 0 && (i.flags |= d | x, l.schedule());
-      }, i.effectTask = l, this.requestEffectTask(i);
-    } catch (l) {
+      const a = this.effectScheduler.bind(l);
+      a.cancelPending = () => i.evaluate === void 0 || !s ? !1 : (this.settleCancelledDependencies(i), i.flags &= ~(x | E | C), !this.batchDepth && this.effectReadIndex !== this.effectWriteIndex && this.flushEffects(), !0), a.rearmPending = () => {
+        i.evaluate !== void 0 && (i.flags |= p | x, a.schedule());
+      }, i.effectTask = a, this.requestEffectTask(i);
+    } catch (a) {
       try {
         this.disposeEffect(i);
       } catch (r) {
-        throw new AggregateError([l, r], "Effect registration and cleanup failed.");
+        throw new AggregateError([a, r], "Effect registration and cleanup failed.");
       }
-      throw l;
+      throw a;
     }
     return !this.batchDepth && this.effectReadIndex !== this.effectWriteIndex && this.flushEffects(), () => this.disposeEffect(i);
   }
@@ -337,7 +337,7 @@ class U {
   readSignalValue(e) {
     const t = this.activeSub;
     let i = null;
-    return t !== null && (i = this.trackDependency(e, t)), e.flags & d && this.commitSignalValue(e, i), e.cachedValue;
+    return t !== null && (i = this.trackDependency(e, t)), e.flags & p && this.commitSignalValue(e, i), e.cachedValue;
   }
   /**
    * Записывает новое значение или откладывает его фиксацию до чтения в batch.
@@ -345,19 +345,19 @@ class U {
    * Без batch и внешней политики очередь эффектов завершается до возврата из set().
    */
   writeSignalValue(e, t) {
-    if (e.flags & d || this.batchDepth) {
-      const s = !!(e.flags & d);
-      if ((e.flags & d ? e.pendingValue : e.cachedValue) === t)
+    if (e.flags & p || this.batchDepth) {
+      const s = !!(e.flags & p);
+      if ((e.flags & p ? e.pendingValue : e.cachedValue) === t)
         return;
       if (e.pendingValue = t, e.cachedValue === t)
-        e.flags &= ~d, e.pendingAuthor = void 0;
+        e.flags &= ~p, e.pendingAuthor = void 0;
       else {
-        e.flags |= d;
-        const l = this.activeSub !== null && this.activeSub.flags & S ? this.activeSub : null;
-        s ? e.pendingAuthor !== l && (e.pendingAuthor = null) : e.pendingAuthor = l;
+        e.flags |= p;
+        const a = this.activeSub !== null && this.activeSub.flags & D ? this.activeSub : null;
+        s ? e.pendingAuthor !== a && (e.pendingAuthor = null) : e.pendingAuthor = a;
       }
-      const a = e.firstSub;
-      a != null && (!s || this.activeSub !== null && this.activeSub.flags & S || e.flags & v) && this.propagateInvalidation(a, !0);
+      const l = e.firstSub;
+      l != null && (!s || this.activeSub !== null && this.activeSub.flags & D || e.flags & v) && this.propagateInvalidation(l, !0);
       return;
     }
     if (e.cachedValue === t)
@@ -377,8 +377,8 @@ class U {
       return s;
     const n = this.activeSub;
     if (n !== null) {
-      const a = n.tailDep;
-      n.flags & W ? (a === null || a.dep !== e) && this.appendInitialDependency(e, n) : this.trackDependency(e, n);
+      const l = n.tailDep;
+      n.flags & W ? (l === null || l.dep !== e) && this.appendInitialDependency(e, n) : this.trackDependency(e, n);
     }
     return s;
   }
@@ -389,12 +389,12 @@ class U {
    */
   evaluateFirstValue(e) {
     const t = e.flags & v, i = e.evaluate;
-    e.flags = t | S | W;
+    e.flags = t | D | W;
     const s = this.activeSub;
     this.activeSub = e;
     try {
       const n = i();
-      return e.evaluate !== i ? (e.cachedValue = void 0, e.flags = 0, n) : (e.cachedValue = n, e.flags = t | (e.flags & C ? d : 0), n);
+      return e.evaluate !== i ? (e.cachedValue = void 0, e.flags = 0, n) : (e.cachedValue = n, e.flags = t | (e.flags & C ? p : 0), n);
     } catch (n) {
       throw e.evaluate !== i ? (e.cachedValue = void 0, e.flags = 0, n) : (e.flags = t | m, s !== null && this.trackDependency(e, s), n);
     } finally {
@@ -407,7 +407,7 @@ class U {
    */
   refreshComputedValue(e, t, i = null) {
     try {
-      if (t & (d | C | m))
+      if (t & (p | C | m))
         return this.recomputeValue(e, i) || (e.flags &= ~E), e.cachedValue;
       const s = e.firstDep;
       return (s === null || !this.refreshDependencies(e, s) || !this.recomputeValue(e, i)) && (e.flags &= ~E), e.cachedValue;
@@ -422,7 +422,7 @@ class U {
    */
   commitSignalValue(e, t) {
     const i = e.cachedValue;
-    e.cachedValue = e.pendingValue, e.flags &= ~d;
+    e.cachedValue = e.pendingValue, e.flags &= ~p;
     const s = e.pendingAuthor;
     return e.pendingAuthor = void 0, i === e.cachedValue ? !1 : (e.firstSub !== null && this.confirmSubUpdates(e.firstSub, t, s ?? null), !0);
   }
@@ -454,21 +454,21 @@ class U {
           return r;
       return s !== null ? (t.tailDep = this.reuseDepLink(s, e), s) : t.tailDep = this.insertDependency(e, t, i);
     }
-    let n = 0, a = s;
-    for (; a !== null && n < R; ) {
-      const r = a;
+    let n = 0, l = s;
+    for (; l !== null && n < R; ) {
+      const r = l;
       if (r.dep === e)
         return this.reorderDependency(t, r, i), t.tailDep = r, r;
-      a = r.nextDep, ++n;
+      l = r.nextDep, ++n;
     }
-    let l = i;
-    for (; l !== null && n < R; ) {
-      const r = l;
+    let a = i;
+    for (; a !== null && n < R; ) {
+      const r = a;
       if (r.dep === e)
         return r;
-      l = r.prevDep, ++n;
+      a = r.prevDep, ++n;
     }
-    if (a !== null || l !== null) {
+    if (l !== null || a !== null) {
       const r = j(e, t, this.adaptiveDependencyIndex);
       if (r !== void 0)
         return this.reorderDependency(t, r, i), t.tailDep = r, r;
@@ -481,7 +481,7 @@ class U {
    * Связь одновременно включается в список потребителей производителя.
    */
   appendInitialDependency(e, t) {
-    var a;
+    var l;
     const i = t.tailDep, s = e.lastSub, n = {
       dep: e,
       sub: t,
@@ -490,14 +490,14 @@ class U {
       prevDep: i,
       nextDep: null
     };
-    return s === null ? e.firstSub = n : s.nextSub = n, e.lastSub = n, i === null ? t.firstDep = n : i.nextDep = n, t.tailDep = n, ++t.depCount, (a = t.dependencyIndex) == null || a.set(e, n), e.flags & v && this.attachDependencyCleanup(n), n;
+    return s === null ? e.firstSub = n : s.nextSub = n, e.lastSub = n, i === null ? t.firstDep = n : i.nextDep = n, t.tailDep = n, ++t.depCount, (l = t.dependencyIndex) == null || l.set(e, n), e.flags & v && this.attachDependencyCleanup(n), n;
   }
   /**
    * Вставляет связь после заданного курсора зависимостей потребителя.
    * Сохраняет ещё не прочитанный хвост списка и увеличивает dependencyCount.
    */
   insertDependency(e, t, i) {
-    var l;
+    var a;
     const s = e.lastSub, n = {
       dep: e,
       sub: t,
@@ -507,8 +507,8 @@ class U {
       nextDep: null
     };
     s === null ? e.firstSub = n : s.nextSub = n, e.lastSub = n;
-    const a = i === null ? t.firstDep : i.nextDep;
-    return n.nextDep = a, a !== null && (a.prevDep = n), i === null ? t.firstDep = n : i.nextDep = n, ++t.depCount, (l = t.dependencyIndex) == null || l.set(e, n), e.flags & v && this.attachDependencyCleanup(n), n;
+    const l = i === null ? t.firstDep : i.nextDep;
+    return n.nextDep = l, l !== null && (l.prevDep = n), i === null ? t.firstDep = n : i.nextDep = n, ++t.depCount, (a = t.dependencyIndex) == null || a.set(e, n), e.flags & v && this.attachDependencyCleanup(n), n;
   }
   /**
    * Переназначает существующую связь другому производителю.
@@ -529,8 +529,8 @@ class U {
       return;
     const s = t.prevDep, n = t.nextDep;
     s === null ? e.firstDep = n : s.nextDep = n, n !== null && (n.prevDep = s);
-    const a = i === null ? e.firstDep : i.nextDep;
-    t.prevDep = i, t.nextDep = a, a !== null && (a.prevDep = t), i === null ? e.firstDep = t : i.nextDep = t;
+    const l = i === null ? e.firstDep : i.nextDep;
+    t.prevDep = i, t.nextDep = l, l !== null && (l.prevDep = t), i === null ? e.firstDep = t : i.nextDep = t;
   }
   /**
    * Удаляет непрочитанный хвост зависимостей завершившегося запуска.
@@ -563,11 +563,11 @@ class U {
   }
   /** Connects Runtime ownership metadata only for edges whose producer opted in. */
   attachDependencyCleanup(e) {
-    var n, a;
+    var n, l;
     const t = e.dep.sourceHooks, i = t == null ? void 0 : t.onDependency;
     if (i === void 0)
       return;
-    const s = ((n = e.sub.sourceHooks) == null ? void 0 : n.dependencyOwner) ?? ((a = e.sub.effectTask) == null ? void 0 : a.dependencyOwner);
+    const s = ((n = e.sub.sourceHooks) == null ? void 0 : n.dependencyOwner) ?? ((l = e.sub.effectTask) == null ? void 0 : l.dependencyOwner);
     s !== void 0 && (e.dependencyCleanup = i(s));
   }
   /**
@@ -581,8 +581,8 @@ class U {
       for (; i != null; ) {
         const s = i.nextSub, n = i.sub;
         this.detachDependencyLink(i), this.detachSubLink(i);
-        const a = n.flags;
-        (a & (E | S)) === w && (n.flags = a & ~w | d, a & y && this.enqueueEffect(n, e)), i = s;
+        const l = n.flags;
+        (l & (E | D)) === w && (n.flags = l & ~w | p, l & y && this.enqueueEffect(n, e)), i = s;
       }
       e.firstSub = e.lastSub = null, e.subSearchCursor = void 0;
       return;
@@ -618,42 +618,42 @@ class U {
    * не выполняет. Непосредственное и потенциальное изменения отмечает разными флагами.
    */
   propagateInvalidation(e, t = !1) {
-    var n, a, l, r, h, b, u, o, I, _, A, O, Q;
+    var n, l, a, r, h, g, u, o, I, _, A, O, Q;
     const i = this.invalidationDepth;
     let s = i;
-    for (let p = e; p !== null; p = p.nextSub) {
-      const f = p.sub, g = f.flags;
+    for (let d = e; d !== null; d = d.nextSub) {
+      const f = d.sub, S = f.flags;
       let k = 0;
-      if (g & (E | S) ? g & S && (k = this.invalidateReadDependency(p, f, g)) : (k = g & ~C | (t ? w : d), f.flags = k), k === 0) {
-        if (g & y && g & x) {
-          const L = p.dep.flags & v ? p.dep.sourceHooks.token : void 0;
-          L !== void 0 && ((a = (n = f.effectTask) == null ? void 0 : n.notify) == null || a.call(n, L));
-        } else f.flags & v && ((r = (l = f.sourceHooks).onInvalidate) == null || r.call(l, f.firstSub !== null), f.firstSub !== null && (this.invalidationStack[s++] = f.firstSub));
+      if (S & (E | D) ? S & D ? k = this.invalidateReadDependency(d, f, S) : !t && !(S & p) && (f.flags = S & ~w | p) : (k = S & ~C | (t ? w : p), f.flags = k), k === 0) {
+        if (S & y && S & x) {
+          const L = d.dep.flags & v ? d.dep.sourceHooks.token : void 0;
+          L !== void 0 && ((l = (n = f.effectTask) == null ? void 0 : n.notify) == null || l.call(n, L));
+        } else f.flags & v && ((r = (a = f.sourceHooks).onInvalidate) == null || r.call(a, f.firstSub !== null), f.firstSub !== null && (this.invalidationStack[s++] = f.firstSub));
         continue;
       }
-      k & y ? (!(k & S) || ((h = f.effectTask) == null ? void 0 : h.allowScheduleDuringRun) === !0) && this.enqueueEffect(f, p.dep) : (!(g & E) && f.flags & v && ((u = (b = f.sourceHooks).onInvalidate) == null || u.call(b, f.firstSub !== null)), f.firstSub !== null && (this.invalidationStack[s++] = f.firstSub));
+      k & y ? (!(k & D) || ((h = f.effectTask) == null ? void 0 : h.allowScheduleDuringRun) === !0) && this.enqueueEffect(f, d.dep) : (!(S & E) && f.flags & v && ((u = (g = f.sourceHooks).onInvalidate) == null || u.call(g, f.firstSub !== null)), f.firstSub !== null && (this.invalidationStack[s++] = f.firstSub));
     }
     for (; s !== i; ) {
-      let p = this.invalidationStack[--s];
+      let d = this.invalidationStack[--s];
       do {
-        const f = p.sub, g = f.flags;
+        const f = d.sub, S = f.flags;
         let k = 0;
-        if (g & (E | S) ? g & S && (k = this.invalidateReadDependency(p, f, g)) : (k = g & ~C | w, f.flags = k), k === 0) {
-          if (g & y && g & x) {
-            const L = p.dep.flags & v ? p.dep.sourceHooks.token : void 0;
+        if (S & (E | D) ? S & D && (k = this.invalidateReadDependency(d, f, S)) : (k = S & ~C | w, f.flags = k), k === 0) {
+          if (S & y && S & x) {
+            const L = d.dep.flags & v ? d.dep.sourceHooks.token : void 0;
             L !== void 0 && ((I = (o = f.effectTask) == null ? void 0 : o.notify) == null || I.call(o, L));
           } else if (f.flags & v && ((A = (_ = f.sourceHooks).onInvalidate) == null || A.call(_, f.firstSub !== null), f.firstSub !== null)) {
-            p.nextSub !== null && (this.invalidationStack[s++] = p.nextSub), p = f.firstSub;
+            d.nextSub !== null && (this.invalidationStack[s++] = d.nextSub), d = f.firstSub;
             continue;
           }
         } else if (k & y)
-          this.enqueueEffect(f, p.dep);
-        else if (!(g & E) && f.flags & v && ((Q = (O = f.sourceHooks).onInvalidate) == null || Q.call(O, f.firstSub !== null)), f.firstSub !== null) {
-          p.nextSub !== null && (this.invalidationStack[s++] = p.nextSub), p = f.firstSub;
+          this.enqueueEffect(f, d.dep);
+        else if (!(S & E) && f.flags & v && ((Q = (O = f.sourceHooks).onInvalidate) == null || Q.call(O, f.firstSub !== null)), f.firstSub !== null) {
+          d.nextSub !== null && (this.invalidationStack[s++] = d.nextSub), d = f.firstSub;
           continue;
         }
-        p = p.nextSub;
-      } while (p !== null);
+        d = d.nextSub;
+      } while (d !== null);
     }
     this.invalidationDepth = i;
   }
@@ -667,8 +667,8 @@ class U {
     if (s === null)
       return 0;
     if (e !== s) {
-      for (let a = e.prevDep; a !== null; a = a.prevDep)
-        if (a === s)
+      for (let l = e.prevDep; l !== null; l = l.prevDep)
+        if (l === s)
           return 0;
     }
     const n = i | C | w;
@@ -681,11 +681,11 @@ class U {
    */
   confirmSubUpdates(e, t, i = null) {
     var s, n;
-    for (let a = e; a !== null; a = a.nextSub) {
-      if (a === t || a.sub === i)
+    for (let l = e; l !== null; l = l.nextSub) {
+      if (l === t || l.sub === i)
         continue;
-      const l = a.sub, r = l.flags;
-      r & d || (l.flags = r & ~w | d, r & y ? this.enqueueEffect(l, a.dep) : r & E || l.flags & v && ((n = (s = l.sourceHooks).onInvalidate) == null || n.call(s, l.firstSub !== null)));
+      const a = l.sub, r = a.flags;
+      r & p || (a.flags = r & ~w | p, r & y ? this.enqueueEffect(a, l.dep) : r & E || a.flags & v && ((n = (s = a.sourceHooks).onInvalidate) == null || n.call(s, a.firstSub !== null)));
     }
   }
   /**
@@ -698,13 +698,13 @@ class U {
   recomputeValue(e, t = null) {
     const i = e.evaluate;
     e.tailDep = null;
-    const s = e.flags & ~C | S;
+    const s = e.flags & ~C | D;
     e.flags = s;
     const n = this.activeSub;
     this.activeSub = e;
-    let a;
+    let l;
     try {
-      a = i();
+      l = i();
     } catch (u) {
       throw e.evaluate !== i ? (e.cachedValue = void 0, e.flags = 0, u) : (this.restoreComputedFailure(e, t), u);
     } finally {
@@ -712,10 +712,10 @@ class U {
     }
     if (e.evaluate !== i)
       return e.cachedValue = void 0, e.flags = 0, !1;
-    const l = e.flags & C, r = s & -268, h = e.tailDep;
+    const a = e.flags & C, r = s & -268, h = e.tailDep;
     (h === null ? e.firstDep : h.nextDep) !== null && this.pruneUnreadDependencies(e);
-    const b = e.cachedValue;
-    return e.cachedValue = a, e.flags = s & v | (l ? d : r), b === a ? !1 : (e.firstSub !== null && this.confirmSubUpdates(e.firstSub, t), !0);
+    const g = e.cachedValue;
+    return e.cachedValue = l, e.flags = s & v | (a ? p : r), g === l ? !1 : (e.firstSub !== null && this.confirmSubUpdates(e.firstSub, t), !0);
   }
   /**
    * Восстанавливает связи и состояния после неудачного getter.
@@ -746,7 +746,7 @@ class U {
   settleCancelledDependencies(e) {
     for (let t = e.firstDep; t !== null; t = t.nextDep) {
       const i = t.dep, s = i.flags;
-      s & (T | E | m) && (i.evaluate === void 0 ? s & d && this.commitSignalValue(i, t) : this.refreshComputedValue(i, s, t));
+      s & (T | E | m) && (i.evaluate === void 0 ? s & p && this.commitSignalValue(i, t) : this.refreshComputedValue(i, s, t));
     }
   }
   /**
@@ -758,18 +758,18 @@ class U {
     const i = this.dependencyDepth;
     let s = i, n = !1;
     e: for (; ; ) {
-      if (e.flags & d)
+      if (e.flags & p)
         n = !0;
       else {
-        const a = t.dep, l = a.flags;
-        if (l & (d | m))
-          this.dependencyDepth = s, n = a.evaluate === void 0 ? this.commitSignalValue(a, t) : this.recomputeValue(a, t);
-        else if (l & w) {
-          if (a.firstDep !== null) {
-            this.dependencyStack[s++] = t, e = a, t = a.firstDep;
+        const l = t.dep, a = l.flags;
+        if (a & (p | m))
+          this.dependencyDepth = s, n = l.evaluate === void 0 ? this.commitSignalValue(l, t) : this.recomputeValue(l, t);
+        else if (a & w) {
+          if (l.firstDep !== null) {
+            this.dependencyStack[s++] = t, e = l, t = l.firstDep;
             continue e;
           }
-          this.dependencyDepth = s, n = this.recomputeValue(a, t);
+          this.dependencyDepth = s, n = this.recomputeValue(l, t);
         } else
           n = !1;
       }
@@ -780,10 +780,10 @@ class U {
       if (n) {
         for (; s !== i; ) {
           this.dependencyDepth = --s;
-          const a = this.dependencyStack[s];
-          if (n = this.recomputeValue(e, a), e = a.sub, !n) {
-            if (a.nextDep !== null) {
-              t = a.nextDep;
+          const l = this.dependencyStack[s];
+          if (n = this.recomputeValue(e, l), e = l.sub, !n) {
+            if (l.nextDep !== null) {
+              t = l.nextDep;
               continue e;
             }
             break;
@@ -794,9 +794,9 @@ class U {
       }
       for (; s !== i; ) {
         this.dependencyDepth = --s;
-        const a = this.dependencyStack[s];
-        if (e.flags &= ~w, e = a.sub, a.nextDep !== null) {
-          t = a.nextDep;
+        const l = this.dependencyStack[s];
+        if (e.flags &= ~w, e = l.sub, l.nextDep !== null) {
+          t = l.nextDep;
           continue e;
         }
       }
@@ -822,15 +822,15 @@ class U {
     const t = e.flags;
     if (!(t & E))
       return;
-    if (!(t & (d | C))) {
+    if (!(t & (p | C))) {
       const h = e.firstDep;
       try {
         if (h === null || !this.refreshDependencies(e, h)) {
           e.flags &= ~E;
           return;
         }
-      } catch (b) {
-        throw e.flags &= -80, b;
+      } catch (g) {
+        throw e.flags &= -80, g;
       }
     }
     const i = e.evaluate;
@@ -862,27 +862,27 @@ class U {
     }
     if (e.evaluate === void 0)
       return;
-    e.tailDep = null, e.flags = e.flags & ~C | S;
-    const a = this.activeSub;
+    e.tailDep = null, e.flags = e.flags & ~C | D;
+    const l = this.activeSub;
     this.activeSub = e;
-    let l;
+    let a;
     try {
-      l = i();
+      a = i();
     } catch (h) {
-      this.activeSub = a, e.flags &= ~S, this.failEffectRun(e, h, s);
+      this.activeSub = l, e.flags &= ~D, this.failEffectRun(e, h, s);
     } finally {
-      this.activeSub = a, e.flags &= ~S;
+      this.activeSub = l, e.flags &= ~D;
     }
     const r = e.tailDep;
-    if ((r === null ? e.firstDep : r.nextDep) !== null && this.pruneUnreadDependencies(e), typeof l == "function")
+    if ((r === null ? e.firstDep : r.nextDep) !== null && this.pruneUnreadDependencies(e), typeof a == "function")
       if (e.evaluate === void 0)
         try {
-          this.untracked(l);
+          this.untracked(a);
         } catch (h) {
           s ?? (s = []), s.push(h);
         }
       else
-        e.cachedValue = l;
+        e.cachedValue = a;
     e.flags & x ? e.flags = e.flags & -7 | w : e.flags &= -8;
   }
   /**
@@ -906,7 +906,7 @@ class U {
    * Путь не проверяет наличие внешней задачи у каждого узла.
    */
   flushSyncEffects() {
-    if (!(this.flushingEffects || this.activeSub !== null && (this.activeSub.flags & (y | S)) === (y | S))) {
+    if (!(this.flushingEffects || this.activeSub !== null && (this.activeSub.flags & (y | D)) === (y | D))) {
       this.flushingEffects = !0;
       try {
         for (; this.effectReadIndex !== this.effectWriteIndex; ) {
@@ -926,7 +926,7 @@ class U {
    * Ошибка одного элемента не оставляет необработанные записи со старым SCHEDULED.
    */
   flushExternalEffects() {
-    if (!(this.flushingEffects || this.activeSub !== null && (this.activeSub.flags & (y | S)) === (y | S))) {
+    if (!(this.flushingEffects || this.activeSub !== null && (this.activeSub.flags & (y | D)) === (y | D))) {
       this.flushingEffects = !0;
       try {
         for (; this.effectReadIndex !== this.effectWriteIndex; ) {
@@ -953,10 +953,10 @@ class U {
       const s = this.effectReadIndex++, n = this.effectQueue[s];
       this.effectQueue[s] = void 0;
       try {
-        const a = t ? n.effectTask : void 0;
-        a !== void 0 && n.evaluate !== void 0 ? this.scheduleEffectTask(n, a) : (n.flags &= ~x, this.executeEffect(n));
-      } catch (a) {
-        i.push(a);
+        const l = t ? n.effectTask : void 0;
+        l !== void 0 && n.evaluate !== void 0 ? this.scheduleEffectTask(n, l) : (n.flags &= ~x, this.executeEffect(n));
+      } catch (l) {
+        i.push(l);
       }
     }
     throw i.length === 1 ? e : new AggregateError(i, "Effect queue processing failed.");
@@ -992,35 +992,35 @@ class U {
     e.evaluate = void 0, e.flags = 0, e.cachedValue = void 0, e.effectTask = void 0, i !== void 0 && (e.onStop = void 0), K(e);
     let n = e.firstDep;
     for (; n !== null; ) {
-      const l = n.nextDep;
-      this.detachSubLink(n), n = l;
+      const a = n.nextDep;
+      this.detachSubLink(n), n = a;
     }
     e.firstDep = e.tailDep = null, e.depCount = 0, N(e);
-    let a;
+    let l;
     if (t !== void 0)
       try {
         t.dispose();
-      } catch (l) {
-        a = [l];
+      } catch (a) {
+        l = [a];
       }
     try {
       this.disposeNestedEffects(e);
-    } catch (l) {
-      a ?? (a = []), a.push(l);
+    } catch (a) {
+      l ?? (l = []), l.push(a);
     }
     if (s !== void 0)
       try {
         this.untracked(s);
-      } catch (l) {
-        a ?? (a = []), a.push(l);
+      } catch (a) {
+        l ?? (l = []), l.push(a);
       }
     if (i !== void 0)
       try {
         this.untracked(i);
-      } catch (l) {
-        a ?? (a = []), a.push(l);
+      } catch (a) {
+        l ?? (l = []), l.push(a);
       }
-    this.invalidationStack.length = this.invalidationDepth, this.dependencyStack.length = this.dependencyDepth, a !== void 0 && F(a, "Effect disposal failed.");
+    this.invalidationStack.length = this.invalidationDepth, this.dependencyStack.length = this.dependencyDepth, l !== void 0 && F(l, "Effect disposal failed.");
   }
   /**
    * Останавливает все вложенные эффекты в обратном порядке регистрации.
@@ -1105,15 +1105,15 @@ class U {
   _signalAccess(e) {
     const t = this;
     let i = e, s;
-    function n(a) {
+    function n(l) {
       if (arguments.length !== 0) {
         const h = s;
-        h !== void 0 ? t.writeSignalValue(h, a) : i !== a && (i = a);
+        h !== void 0 ? t.writeSignalValue(h, l) : i !== l && (i = l);
         return;
       }
-      const l = s;
-      if (l !== void 0)
-        return t.readSignalValue(l);
+      const a = s;
+      if (a !== void 0)
+        return t.readSignalValue(a);
       const r = t.activeSub;
       return r === null || (s = t.materializeSignal(i, r)), i;
     }
@@ -1143,8 +1143,8 @@ class U {
    */
   _ownedSignal(e, t) {
     const i = this;
-    let s = e, n, a = !1;
-    const l = () => {
+    let s = e, n, l = !1;
+    const a = () => {
       const u = n;
       if (u !== void 0)
         return this.readSignalValue(u);
@@ -1164,14 +1164,14 @@ class U {
       var I, _;
       const o = n;
       if (o !== void 0) {
-        const A = o.flags & d ? o.pendingValue : o.cachedValue;
+        const A = o.flags & p ? o.pendingValue : o.cachedValue;
         A !== u && ((I = t.onChange) == null || I.call(t, A, u, o.firstSub !== null)), this.writeSignalValue(o, u);
         return;
       }
       s !== u && ((_ = t.onChange) == null || _.call(t, s, u, !1), s = u);
-    }, b = {
+    }, g = {
       source: {
-        get: l,
+        get: a,
         peek: this.handleReaders.peek,
         set: r
       },
@@ -1180,9 +1180,9 @@ class U {
        */
       dispose() {
         var o;
-        if (a)
+        if (l)
           return !0;
-        a = !0, s = void 0;
+        l = !0, s = void 0;
         let u;
         try {
           (o = t == null ? void 0 : t.onDispose) == null || o.call(t, (n == null ? void 0 : n.firstSub) != null);
@@ -1204,7 +1204,7 @@ class U {
         return !0;
       }
     };
-    return t !== void 0 && (b.hasSubscribers = () => (n == null ? void 0 : n.firstSub) != null), b;
+    return t !== void 0 && (g.hasSubscribers = () => (n == null ? void 0 : n.firstSub) != null), g;
   }
   /**
    * Создаёт ленивый computed с финализатором исходящих и входящих связей.
@@ -1214,7 +1214,7 @@ class U {
   _ownedComputed(e, t) {
     const i = this, s = this.createComputedHandle(e, t);
     let n = !1;
-    const a = {
+    const l = {
       source: s,
       /**
        * Отсоединяет принадлежащий источник и освобождает его ссылки.
@@ -1225,31 +1225,31 @@ class U {
         if (n)
           return !0;
         n = !0, i.activeSub === s && (i.activeSub = null);
-        const l = [];
+        const a = [];
         try {
           (h = t == null ? void 0 : t.onDispose) == null || h.call(t, s.firstSub != null);
-        } catch (b) {
-          l.push(b);
+        } catch (g) {
+          a.push(g);
         }
         if (s.flags !== void 0)
           try {
             i.releaseSourceSubs(s);
-          } catch (b) {
-            l.push(b);
+          } catch (g) {
+            a.push(g);
           }
         let r = s.firstDep;
         for (; r != null; ) {
-          const b = r.nextDep;
-          i.detachSubLink(r), r = b;
+          const g = r.nextDep;
+          i.detachSubLink(r), r = g;
         }
-        if (s.firstDep = s.tailDep = null, s.depCount = 0, N(s), s.evaluate = void 0, s.cachedValue = void 0, s.flags = 0, l.length === 1)
-          throw l[0];
-        if (l.length > 1)
-          throw new AggregateError(l, "Owned computed disposal failed.");
+        if (s.firstDep = s.tailDep = null, s.depCount = 0, N(s), s.evaluate = void 0, s.cachedValue = void 0, s.flags = 0, a.length === 1)
+          throw a[0];
+        if (a.length > 1)
+          throw new AggregateError(a, "Owned computed disposal failed.");
         return !0;
       }
     };
-    return t !== void 0 && (a.hasSubscribers = () => s.firstSub != null), a;
+    return t !== void 0 && (l.hasSubscribers = () => s.firstSub != null), l;
   }
   /**
    * Открывает вложенную синхронную границу группировки.
@@ -1290,16 +1290,16 @@ const te = (c) => V().signal(c), ie = (c) => V().reactive(c);
 function se(c) {
   return V().computed(c);
 }
-const ne = (c, e) => V().effect(c, e), ae = (c, e, t) => V().watch(c, e, t), le = (c) => V().batch(c), re = (c) => V().untracked(c), ce = () => V().scope();
+const ne = (c, e) => V().effect(c, e), le = (c, e, t) => V().watch(c, e, t), ae = (c) => V().batch(c), re = (c) => V().untracked(c), ce = () => V().scope();
 export {
   U as RaphReactivity,
   M as ScopeNode,
-  le as batch,
+  ae as batch,
   se as computed,
   ne as effect,
   ie as reactive,
   ce as scope,
   te as signal,
   re as untracked,
-  ae as watch
+  le as watch
 };