@solidjs/signals 2.0.0-rc.3 → 2.0.0-rc.5

package/dist/prod/core/effect.js

@@ -1,6 +1,6 @@
-import { REACTIVE_DISPOSED, STATUS_ERROR, EFFECT_USER, CONFIG_AUTO_DISPOSE, CONFIG_CHILDREN_FORBIDDEN, EFFECT_TRACKED, STATUS_PENDING, EFFECT_RENDER } from "./constants.js";
+import { REACTIVE_DISPOSED, STATUS_ERROR, EFFECT_USER, CONFIG_AUTO_DISPOSE, CONFIG_CHILDREN_FORBIDDEN, EFFECT_TRACKED, EFFECT_RENDER, STATUS_PENDING } from "./constants.js";
 
-import { ext, createEffectNode, recompute, computed, staleValues } from "./core.js";
+import { setEffectStatusNotify, ext, createEffectNode, recompute, computed, staleValues } from "./core.js";
 
 import { unwrapStatusError, StatusError } from "./error.js";
 
@@ -10,20 +10,20 @@ import { GlobalQueue, haltReactivity } from "./scheduler.js";
  * Effects are the leaf nodes of our reactive graph. When their sources change, they are
  * automatically added to the queue of effects to re-execute, which will cause them to fetch their
  * sources and recompute
- */ function effect(t, e, E, R) {
-    const r = !!R?.user;
-    const f = createEffectNode(t, e, E, r ? EFFECT_USER : EFFECT_RENDER, notifyEffectStatus, R);
-    recompute(f, true);
-    !R?.defer && (f.Re === EFFECT_USER || R?.schedule ? f.C.enqueue(f.Re, runEffect.bind(null, f)) : runEffect(f));
+ */ function effect(t, e, E, f) {
+    const r = !!f?.user;
+    const R = createEffectNode(t, e, E, r ? EFFECT_USER : EFFECT_RENDER, f);
+    recompute(R, true);
+    !f?.defer && (R.he === EFFECT_USER || f?.schedule ? R.C.enqueue(R.he, runEffect.bind(null, R)) : runEffect(R));
 }
 
 function notifyEffectStatus(t, e) {
     // Use passed values if provided, otherwise read from node
     const E = t !== undefined ? t : this.S;
-    const R = e !== undefined ? e : this.o?._;
+    const f = e !== undefined ? e : this.o?._;
     if (E & STATUS_ERROR) {
         this.C.notify(this, STATUS_PENDING, 0);
-        if (this.Re === EFFECT_USER) {
+        if (this.he === EFFECT_USER) {
             // The error handler is the error arm of the effect phase (#2840 ruling):
             // queue it like the effect function. It runs in the same imperative,
             // writable scope, throws escalate the same way, and a held transition
@@ -34,22 +34,22 @@ function notifyEffectStatus(t, e) {
             // `status` arg without node-state writes) don't queue: the status
             // re-propagates unblocked at commit.
             if (this.S & STATUS_ERROR) {
-                this.Xe = true;
-                this.C.enqueue(this.Re, this.et ??= runEffect.bind(null, this));
+                this.tt = true;
+                this.C.enqueue(this.he, this.nt ??= runEffect.bind(null, this));
             }
             return;
         }
         if (!this.C.notify(this, STATUS_ERROR, STATUS_ERROR)) {
-            haltReactivity(unwrapStatusError(R));
-            throw R;
+            haltReactivity(unwrapStatusError(f));
+            throw f;
         }
-    } else if (this.Re === EFFECT_RENDER) {
-        this.C.notify(this, STATUS_PENDING | STATUS_ERROR, E, R);
+    } else if (this.he === EFFECT_RENDER) {
+        this.C.notify(this, STATUS_PENDING | STATUS_ERROR, E, f);
     }
 }
 
 function runEffect(t) {
-    if (!t.Xe || t.ie & REACTIVE_DISPOSED) return;
+    if (!t.tt || t.ie & REACTIVE_DISPOSED) return;
     // Error arm (#2840), user effects only: a compute-phase error that is still
     // the node's settled state at effect time runs the bundle's error handler in
     // this same imperative, writable scope. Unwrap the StatusError used for
@@ -60,14 +60,14 @@ function runEffect(t) {
     // Render effects bypass: their errors route to boundaries synchronously in
     // notifyEffectStatus, and a runner queued by an earlier valueChanged in the
     // same flush must not be hijacked by a later-arriving error status.
-        if (t.S & STATUS_ERROR && t.Re === EFFECT_USER) {
+        if (t.S & STATUS_ERROR && t.he === EFFECT_USER) {
         const e = unwrapStatusError(t.o?._);
-        t.Tt = t.be;
-        t.Xe = false;
+        t.At = t.be;
+        t.tt = false;
         try {
-            t.St ? t.St(e, () => {
-                const e = t.At;
-                t.At = undefined;
+            t.Ct ? t.Ct(e, () => {
+                const e = t.Rt;
+                t.Rt = undefined;
                 e?.();
             }) : console.error(e);
         } catch (e) {
@@ -78,14 +78,14 @@ function runEffect(t) {
         }
         return;
     }
-    const e = t.At;
-    t.At = undefined;
+    const e = t.Rt;
+    t.Rt = undefined;
     try {
         e?.();
-        const E = t.dt(t.be, t.Tt);
+        const E = t.Ot(t.be, t.At);
         if (false && E !== undefined && typeof E !== "function") ;
         // The final cleanup is invoked by disposeChildren at true disposal.
-                t.At = E;
+                t.Rt = E;
     } catch (e) {
         ext(t)._ = new StatusError(t, e);
         t.S |= STATUS_ERROR;
@@ -94,12 +94,12 @@ function runEffect(t) {
             throw e;
         }
     } finally {
-        t.Tt = t.be;
-        t.Xe = false;
+        t.At = t.be;
+        t.tt = false;
     }
 }
 
-GlobalQueue.tt = runEffect;
+GlobalQueue.it = runEffect;
 
 /**
  * Internal tracked effect - bypasses heap, goes directly to effect queue.
@@ -107,39 +107,36 @@ GlobalQueue.tt = runEffect;
  * Uses stale reads.
  */ function trackedEffect(t, e) {
     const run = () => {
-        if (!E.Xe || E.ie & REACTIVE_DISPOSED) return;
+        if (!E.tt || E.ie & REACTIVE_DISPOSED) return;
         try {
-            E.Xe = false;
+            E.tt = false;
             recompute(E);
         } finally {}
     };
     const E = computed(() => {
-        const e = E.At;
-        E.At = undefined;
+        const e = E.Rt;
+        E.Rt = undefined;
         e?.();
-        const R = staleValues(t);
-        E.At = R;
+        const f = staleValues(t);
+        E.Rt = f;
     }, {
         ...e,
         lazy: true
     });
-    E.At = undefined;
+    E.Rt = undefined;
     E.T = E.T & ~CONFIG_AUTO_DISPOSE | CONFIG_CHILDREN_FORBIDDEN;
-    E.Xe = true;
-    E.Re = EFFECT_TRACKED;
-    ext(E).A = (t, e) => {
-        const R = t !== undefined ? t : E.S;
-        if (R & STATUS_ERROR) {
-            E.C.notify(E, STATUS_PENDING, 0);
-            const t = e !== undefined ? e : E.o?._;
-            if (!E.C.notify(E, STATUS_ERROR, STATUS_ERROR)) {
-                haltReactivity(unwrapStatusError(t));
-                throw t;
-            }
-        }
-    };
-    E.Ut = run;
+    E.tt = true;
+    E.he = EFFECT_TRACKED;
+    // Status dispatch rides the SHARED notifier (statusNotifierOf keys off
+    // _type): its error arm is behavior-identical to the closure that used to
+    // live here, without the per-node NodeExtension allocation.
+        E.yt = run;
     E.C.enqueue(EFFECT_USER, run);
 }
 
+// Install the shared effect status notifier (statusNotifierOf serves it to
+// every effect node) — module-scope: any bundle that creates effects
+// evaluates this module.
+setEffectStatusNotify(notifyEffectStatus);
+
 export { effect, trackedEffect };

package/dist/prod/core/error.js

@@ -53,6 +53,18 @@ class StatusError extends Error {
     return r instanceof StatusError ? r.cause : r;
 }
 
+/**
+ * Rejection value of `until(fn, { timeout })` when the predicate does not turn
+ * truthy within the window. Inside an `action()`, the rejection is thrown back
+ * in at the `yield` point — catchable there, or the action fails and its
+ * optimistic state reverts.
+ */ class TimeoutError extends Error {
+    constructor(r = "Timed out waiting for condition") {
+        super(r);
+        this.name = "TimeoutError";
+    }
+}
+
 class NoOwnerError extends Error {
     constructor() {
         super("");
@@ -65,4 +77,4 @@ class ContextNotFoundError extends Error {
     }
 }
 
-export { ContextNotFoundError, NoOwnerError, NotReadyError, StatusError, unwrapStatusError };
+export { ContextNotFoundError, NoOwnerError, NotReadyError, StatusError, TimeoutError, unwrapStatusError };

package/dist/prod/core/external.js

@@ -46,11 +46,11 @@ function wireExternalSource(e) {
         equals: false,
         ownedWrite: true
     });
-    const r = externalSourceConfig.factory(e.Se, () => {
+    const r = externalSourceConfig.factory(e.oe, () => {
         setSignal(n, undefined);
     });
     cleanup(() => r.dispose());
-    e.Se = e => {
+    e.oe = e => {
         read(n);
         return r.track(e);
     };
@@ -64,8 +64,8 @@ function externalUntrack(e) {
 // removed on reset) so core's null checks stay equivalent to the old
 // `externalSourceConfig` truthiness checks.
 function syncExternalHooks() {
-    GlobalQueue.Rt = externalSourceConfig ? wireExternalSource : null;
-    GlobalQueue.Gt = externalSourceConfig ? externalUntrack : null;
+    GlobalQueue.Pt = externalSourceConfig ? wireExternalSource : null;
+    GlobalQueue.ht = externalSourceConfig ? externalUntrack : null;
 }
 
 function enableExternalSource(e) {

package/dist/prod/core/graph.js

@@ -1,4 +1,4 @@
-import { CONFIG_AUTO_DISPOSE, REACTIVE_ZOMBIE, STATUS_PENDING, REACTIVE_RECOMPUTING_DEPS } from "./constants.js";
+import { CONFIG_AUTO_DISPOSE, STATUS_PENDING, REACTIVE_DISPOSED, REACTIVE_ZOMBIE, REACTIVE_RECOMPUTING_DEPS } from "./constants.js";
 
 import { deleteFromHeap, queueFor } from "./heap.js";
 
@@ -8,36 +8,36 @@ import { bumpNotifyEpoch } from "./scheduler.js";
 
 // https://github.com/stackblitz/alien-signals/blob/v2.0.3/src/system.ts#L100
 function unlinkSubs(e) {
-    const l = e.ut;
-    const n = e.it;
-    const u = e.fe;
-    const s = e.el;
-    if (u !== null) u.el = s; else l.rt = s;
-    if (s !== null) s.fe = u; else {
-        l.u = u;
-        if (u === null) {
-            l.o?.ft?.();
+    const n = e.ot;
+    const l = e.lt;
+    const o = e.ae;
+    const u = e.en;
+    if (o !== null) o.en = u; else n._t = u;
+    if (u !== null) u.ae = o; else {
+        n.u = o;
+        if (o === null) {
+            n.o?.Et?.();
             // No more subscribers; only tear down if CONFIG_AUTO_DISPOSE is set.
             // A pending node is exempt: its in-flight async work (or the
             // transition holding it) is an observer — tearing down would orphan
             // the work and re-execute it on the next read. The settle path runs
             // this same last-one-out check when that observer releases (the
-            // untracked-read dispose in core.ts guards on pending identically).
-                        const e = l;
-            e.Se && e.T & CONFIG_AUTO_DISPOSE && !(e.ie & REACTIVE_ZOMBIE) && !(e.S & STATUS_PENDING) && unobserved(e);
+            // untracked-read dormancy sweep guards on pending identically).
+                        const e = n;
+            e.oe && e.T & CONFIG_AUTO_DISPOSE && !(e.ie & REACTIVE_ZOMBIE) && !(e.S & STATUS_PENDING) && unobserved(e);
         }
     }
-    return n;
+    return l;
 }
 
 function trimStaleDeps(e) {
-    const l = e.Ye;
-    let n = l !== null ? l.it : e.nt;
-    if (n !== null) {
+    const n = e.je;
+    let l = n !== null ? n.lt : e.ut;
+    if (l !== null) {
         do {
-            n = unlinkSubs(n);
-        } while (n !== null);
-        if (l !== null) l.it = null; else e.nt = null;
+            l = unlinkSubs(l);
+        } while (l !== null);
+        if (n !== null) n.lt = null; else e.ut = null;
     }
 }
 
@@ -46,13 +46,13 @@ function trimStaleDeps(e) {
 // and skipping early also avoids adding one (hidden-class churn) via the
 // null-out below.
 function clearDeps(e) {
-    let l = e.nt;
-    if (!l) return;
+    let n = e.ut;
+    if (!n) return;
     do {
-        l = unlinkSubs(l);
-    } while (l !== null);
-    e.nt = null;
-    e.Ye = null;
+        n = unlinkSubs(n);
+    } while (n !== null);
+    e.ut = null;
+    e.je = null;
 }
 
 function unobserved(e) {
@@ -61,27 +61,63 @@ function unobserved(e) {
     disposeChildren(e, true);
 }
 
+/**
+ * Deferred dormancy for never-observed auto-dispose computeds (#3078).
+ *
+ * An untracked top-level read of a subscriber-less observation-lifecycle memo
+ * used to call unobserved() inline at the end of read(). That kept the leak
+ * closed (the compute links the memo into its deps' sub lists — without a
+ * teardown point a never-observed memo is retained by its sources forever;
+ * upstream alien-signals has exactly this retention), but it made reads
+ * destructive: each read disposed the node, the next read revived it with a
+ * full recompute in whatever ambient transition/lane context happened to be
+ * current, so consecutive reads could return different answers with no write
+ * in between.
+ *
+ * Instead, reads queue the node here and the scheduler sweeps at the top of
+ * the next flush (before runHeap, so a same-tick dirtying is reclaimed
+ * instead of recomputed). Reads become idempotent within a tick (the node
+ * stays alive and serves its cache, uniform with observed memos) while
+ * reclamation still happens within one microtask — the enqueue site arms
+ * schedule(), so a flush is guaranteed even when no other work is queued.
+ */ const dormantNodes = new Set;
+
+function sweepDormant() {
+    if (dormantNodes.size === 0) return;
+    for (const e of dormantNodes) {
+        // Re-validate at sweep time: the node may have gained a subscriber (its
+        // lifecycle is the unlinkSubs cascade now), gone pending (in-flight async
+        // is an observer; the settle path re-runs last-one-out), lost its
+        // AUTO_DISPOSE bit (owner teardown strips it, #3024), or already been
+        // torn down.
+        if (!e.u && e.T & CONFIG_AUTO_DISPOSE && !(e.S & STATUS_PENDING) && !(e.ie & (REACTIVE_DISPOSED | REACTIVE_ZOMBIE))) {
+            unobserved(e);
+        }
+    }
+    dormantNodes.clear();
+}
+
 // https://github.com/stackblitz/alien-signals/blob/v2.0.3/src/system.ts#L52
-function link(e, l, n = false) {
+function link(e, n, l = false) {
     // Repeat touches within one pass AND-combine `_pendingObserver`: a probe
     // read (`isPending(() => x())`) beside a value read of the same dep must
     // not relabel the value dependency as probe-only — the value read is what
     // real-error propagation and affects() coverage key off, regardless of
     // read order within the computation.
-    const u = l.Ye;
-    if (u !== null && u.ut === e) {
-        u.me &&= n;
+    const o = n.je;
+    if (o !== null && o.ot === e) {
+        o.ve &&= l;
         return;
     }
-    let s = null;
-    const o = l.ie & REACTIVE_RECOMPUTING_DEPS;
-    if (o) {
-        s = u !== null ? u.it : l.nt;
-        if (s !== null && s.ut === e) {
-            s.ll = l.Ze;
-            l.Ye = s;
+    let u = null;
+    const t = n.ie & REACTIVE_RECOMPUTING_DEPS;
+    if (t) {
+        u = o !== null ? o.lt : n.ut;
+        if (u !== null && u.ot === e) {
+            u.Ft = n.Ke;
+            n.je = u;
             // First touch of this pass: the previous pass's label is stale.
-                        s.me = n;
+                        u.ve = l;
             return;
         }
     }
@@ -90,26 +126,26 @@ function link(e, l, n = false) {
     // [deps.._depsTail] prefix — the O(1) equivalent of scanning the dep list
     // (the old alien-signals `isValidLink` walk, O(n²) when a computation
     // re-reads earlier deps non-consecutively, e.g. store leaf reads).
-        const t = e.rt;
-    if (t !== null && t.ae === l && (!o || t.ll === l.Ze)) {
+        const s = e._t;
+    if (s !== null && s.ce === n && (!t || s.Ft === n.Ke)) {
         // Gen-matched during a recompute = repeat touch this pass (AND); outside
         // a recompute there is no pass boundary, so the latest read labels it.
-        if (o) t.me &&= n; else t.me = n;
+        if (t) s.ve &&= l; else s.ve = l;
         return;
     }
-    const i = l.Ye = e.rt = {
-        ut: e,
-        ae: l,
-        it: s,
-        el: t,
-        fe: null,
-        ll: l.Ze,
-        me: n
+    const r = n.je = e._t = {
+        ot: e,
+        ce: n,
+        lt: u,
+        en: s,
+        ae: null,
+        Ft: n.Ke,
+        ve: l
     };
-    if (u !== null) u.it = i; else l.nt = i;
-    if (t !== null) t.fe = i; else e.u = i;
+    if (o !== null) o.lt = r; else n.ut = r;
+    if (s !== null) s.ae = r; else e.u = r;
     // New subscriber edge: staged-rewrite skips (§12d) must not miss it.
         bumpNotifyEpoch();
 }
 
-export { clearDeps, link, trimStaleDeps, unlinkSubs, unobserved };
+export { clearDeps, dormantNodes, link, sweepDormant, trimStaleDeps, unlinkSubs, unobserved };

package/dist/prod/core/heap.js

@@ -1,6 +1,6 @@
 import "./core.js";
 
-import { REACTIVE_IN_HEAP, REACTIVE_IN_HEAP_HEIGHT, EFFECT_TRACKED, EFFECT_USER, REACTIVE_RECOMPUTING_DEPS, REACTIVE_MANUAL_WRITE, REACTIVE_ZOMBIE, REACTIVE_CHECK, REACTIVE_DIRTY, CONFIG_FW_CHILDREN } from "./constants.js";
+import { REACTIVE_IN_HEAP, REACTIVE_IN_HEAP_HEIGHT, EFFECT_TRACKED, EFFECT_USER, REACTIVE_ZOMBIE, REACTIVE_RECOMPUTING_DEPS, REACTIVE_MANUAL_WRITE, REACTIVE_CHECK, REACTIVE_DIRTY, CONFIG_FW_CHILDREN } from "./constants.js";
 
 import { zombieQueue, dirtyQueue } from "./scheduler.js";
 
@@ -13,29 +13,29 @@ import { zombieQueue, dirtyQueue } from "./scheduler.js";
  * the heap and go directly to their effect queue; everything else is inserted
  * into its own (zombie-flag-routed) heap with the `_min` cursor pulled down.
  */ function enqueueSub(e) {
-    if (e.Re === EFFECT_TRACKED) {
+    if (e.he === EFFECT_TRACKED) {
         const E = e;
-        if (!E.Xe) {
-            E.Xe = true;
-            E.C.enqueue(EFFECT_USER, E.Ut);
+        if (!E.tt) {
+            E.tt = true;
+            E.C.enqueue(EFFECT_USER, E.yt);
         }
         return;
     }
     const E = queueFor(e);
-    if (E.xe > e.Le) E.xe = e.Le;
+    if (E.Qe > e.Me) E.Qe = e.Me;
     insertIntoHeap(e, E);
 }
 
 function actualInsertIntoHeap(e, E) {
-    const t = (e.ve?.Ct ? e.ve.Ot?.Le : e.ve?.Le) ?? -1;
-    if (t >= e.Le) e.Le = t + 1;
-    const n = e.Le;
+    const t = (e.ke?.Gt ? e.ke.Dt?.Me : e.ke?.Me) ?? -1;
+    if (t >= e.Me) e.Me = t + 1;
+    const n = e.Me;
     const I = E.eE[n];
     if (I === undefined) E.eE[n] = e; else {
-        const E = I.st;
-        E.ot = e;
-        e.st = E;
-        I.st = e;
+        const E = I.ct;
+        E.rt = e;
+        e.ct = E;
+        I.ct = e;
     }
     if (n > E.EE) E.EE = n;
 }
@@ -71,23 +71,23 @@ function deleteFromHeap(e, E) {
     const t = e.ie;
     if (!(t & (REACTIVE_IN_HEAP | REACTIVE_IN_HEAP_HEIGHT))) return;
     e.ie = t & -25;
-    const n = e.Le;
-    if (e.st === e) E.eE[n] = undefined; else {
-        const t = e.ot;
+    const n = e.Me;
+    if (e.ct === e) E.eE[n] = undefined; else {
+        const t = e.rt;
         const I = E.eE[n];
         const o = t ?? I;
-        if (e === I) E.eE[n] = t; else e.st.ot = t;
-        o.st = e.st;
+        if (e === I) E.eE[n] = t; else e.ct.rt = t;
+        o.ct = e.ct;
     }
-    e.st = e;
-    e.ot = undefined;
+    e.ct = e;
+    e.rt = undefined;
 }
 
 function markHeap(e) {
     if (e.tE) return;
     e.tE = true;
     for (let E = 0; E <= e.EE; E++) {
-        for (let t = e.eE[E]; t !== undefined; t = t.ot) {
+        for (let t = e.eE[E]; t !== undefined; t = t.rt) {
             if (t.ie & REACTIVE_IN_HEAP) markNode(t);
         }
     }
@@ -97,16 +97,16 @@ function markNode(e, E = REACTIVE_DIRTY) {
     const t = e.ie;
     if ((t & (REACTIVE_CHECK | REACTIVE_DIRTY)) >= E) return;
     e.ie = t & -4 | E;
-    for (let E = e.u; E !== null; E = E.fe) {
-        markNode(E.ae, REACTIVE_CHECK);
+    for (let E = e.u; E !== null; E = E.ae) {
+        markNode(E.ce, REACTIVE_CHECK);
     }
     // Firewall children (projection machinery only): gate the cold-extension
     // deref on the config bit — markNode runs per sub edge per write, and an
     // unconditional _x chase here taxed every propagation (diamond -22%).
         if (e.T & CONFIG_FW_CHILDREN) {
-        for (let E = e.o.l; E !== null; E = E.ce) {
-            for (let e = E.u; e !== null; e = e.fe) {
-                markNode(e.ae, REACTIVE_CHECK);
+        for (let E = e.o.i; E !== null; E = E.Se) {
+            for (let e = E.u; e !== null; e = e.ae) {
+                markNode(e.ce, REACTIVE_CHECK);
             }
         }
     }
@@ -114,11 +114,11 @@ function markNode(e, E = REACTIVE_DIRTY) {
 
 function runHeap(e, E) {
     e.tE = false;
-    for (e.xe = 0; e.xe <= e.EE; e.xe++) {
-        let t = e.eE[e.xe];
+    for (e.Qe = 0; e.Qe <= e.EE; e.Qe++) {
+        let t = e.eE[e.Qe];
         while (t !== undefined) {
             if (t.ie & REACTIVE_IN_HEAP) E(t); else adjustHeight(t, e);
-            t = e.eE[e.xe];
+            t = e.eE[e.Qe];
         }
     }
     e.EE = 0;
@@ -126,21 +126,21 @@ function runHeap(e, E) {
 
 function adjustHeight(e, E) {
     deleteFromHeap(e, E);
-    let t = e.Le;
-    for (let E = e.nt; E; E = E.it) {
-        const e = E.ut;
-        const n = e.lt || e;
-        if (n.Se && n.Le >= t) t = n.Le + 1;
+    let t = e.Me;
+    for (let E = e.ut; E; E = E.lt) {
+        const e = E.ot;
+        const n = e.st || e;
+        if (n.oe && n.Me >= t) t = n.Me + 1;
     }
-    if (e.Le !== t) {
-        e.Le = t;
-        for (let E = e.u; E !== null; E = E.fe) {
+    if (e.Me !== t) {
+        e.Me = t;
+        for (let E = e.u; E !== null; E = E.ae) {
             // Route each subscriber by its own zombie flag, mirroring the
             // post-recompute height-adjust path. Inserting into the running `heap`
             // unconditionally can park a zombie in `dirtyQueue` (or a live node in
             // `zombieQueue`), breaking the flag/queue invariant `deleteFromHeap`
             // relies on — the same corruption class as #2759.
-            insertIntoHeapHeight(E.ae, queueFor(E.ae));
+            insertIntoHeapHeight(E.ce, queueFor(E.ce));
         }
     }
 }