@solidjs/signals 2.0.0-beta.9 → 2.0.0-rc.1

package/dist/prod/core/lanes.js

@@ -0,0 +1,140 @@
+import { NOT_PENDING } from "./constants.js";
+
+import { currentTransition, activeTransition } from "./scheduler.js";
+
+// Map from optimistic signal to its lane (reused for multiple writes to same signal)
+const signalLanes = new WeakMap;
+
+// All active lanes (for cleanup on transition completion)
+const activeLanes = new Set;
+
+/**
+ * Get an existing lane for a signal or create a new one.
+ * Reuses lane for multiple writes to the same signal.
+ */ function getOrCreateLane(n) {
+    let e = signalLanes.get(n);
+    if (e) {
+        return findLane(e);
+    }
+    // Detect parent lane: _parentSource chains from pendingSignal → pendingValueComputed → original.
+    // The child lane should not merge with the parent lane.
+        const i = n.nn;
+    const r = i?.Ke ? findLane(i.Ke) : null;
+    e = {
+        en: n,
+        Ae: new Set,
+        rn: [ [], [] ],
+        tn: null,
+        Ne: activeTransition,
+        an: r
+    };
+    signalLanes.set(n, e);
+    activeLanes.add(e);
+    // A companion may have written before the owner's first optimistic write
+    // (affects() as an action's first statement pokes the verdict companion of a
+    // still lane-less node, #2887), leaving its lane parentless. Adopt it now:
+    // parent-child is a property of the nodes, not of write order — otherwise
+    // the owner's write merges the companion's subscribers into this lane and
+    // their effects wait on its async instead of flushing immediately.
+        adoptCompanionLane(n.Oe, e);
+    adoptCompanionLane(n.ge, e);
+    return e;
+}
+
+function adoptCompanionLane(n, e) {
+    if (!n) return;
+    const i = signalLanes.get(n);
+    if (!i) return;
+    const r = findLane(i);
+    // Only the companion's own unmerged root is safely re-parentable: a root
+    // that absorbed other lanes carries work that is not a child of this owner.
+        if (r !== e && r.en === n && !r.an) r.an = e;
+}
+
+/**
+ * Union-find: find the root lane.
+ */ function findLane(n) {
+    while (n.tn) n = n.tn;
+    return n;
+}
+
+/**
+ * Merge two lanes when their dependency graphs overlap.
+ */ function mergeLanes(n, e) {
+    n = findLane(n);
+    e = findLane(e);
+    if (n === e) return n;
+    e.tn = n;
+    // Move (not copy) the merged lane's work: after the merge all routing goes
+    // through findLane() to the root, so anything left behind here is dead —
+    // and anything *added* here later is a routing bug (INV-5).
+        for (const i of e.Ae) n.Ae.add(i);
+    e.Ae.clear();
+    n.rn[0].push(...e.rn[0]);
+    n.rn[1].push(...e.rn[1]);
+    e.rn[0].length = 0;
+    e.rn[1].length = 0;
+    return n;
+}
+
+/**
+ * Resolve a node's lane: follow union-find chain, verify active, clear if stale.
+ */ function resolveLane(n) {
+    const e = n.Ke;
+    if (!e) return undefined;
+    const i = findLane(e);
+    if (activeLanes.has(i)) return i;
+    n.Ke = undefined;
+    return undefined;
+}
+
+function resolveTransition(n) {
+    // An active override answers with its owner, not its lane: lanes are
+    // scheduling affinity and a shared subscriber merges them across
+    // transactions (#2912) — the merged root's _transition would hand this
+    // node's override to whichever action wrote last through the shared
+    // reader. Chase merge chains; a dead owner settled through another path.
+    if (hasActiveOverride(n) && n.sn) {
+        const e = n.sn = currentTransition(n.sn);
+        if (e.fn !== true) return e;
+        n.sn = null;
+    }
+    return resolveLane(n)?.Ne ?? n.Ne;
+}
+
+/**
+ * Check if a node has an active optimistic override.
+ */ function hasActiveOverride(n) {
+    return !!(n.De !== undefined && n.De !== NOT_PENDING);
+}
+
+/**
+ * Assign or merge a lane onto a node. At convergence points (node already has
+ * a different active lane), merge unless the node has an active override.
+ */ function assignOrMergeLane(n, e) {
+    const i = findLane(e);
+    const r = n.Ke;
+    if (r) {
+        // If the subscriber's lane was merged into another lane, it's stale —
+        // replace it with the new source lane instead of following the merge chain
+        // (which would incorrectly merge the new lane into the old group)
+        if (r.tn) {
+            n.Ke = e;
+            return;
+        }
+        const t = findLane(r);
+        if (activeLanes.has(t)) {
+            if (t !== i && !hasActiveOverride(n)) {
+                // Parent-child lanes stay independent so isPending resolves without
+                // waiting for the parent's async. The child keeps ownership.
+                if (i.an && findLane(i.an) === t) {
+                    n.Ke = e;
+                } else if (t.an && findLane(t.an) === i) ; else mergeLanes(i, t);
+            }
+            return;
+        }
+    }
+    n.Ke = e;
+}
+
+export { activeLanes, assignOrMergeLane, findLane, getOrCreateLane, hasActiveOverride, mergeLanes, resolveLane, resolveTransition, signalLanes };

package/dist/prod/core/optimistic.js

@@ -0,0 +1,262 @@
+import { NOT_PENDING, unwrapOverride, STATUS_UNINITIALIZED, OVERRIDE_UNDEFINED, STATUS_PENDING, REACTIVE_MANUAL_WRITE, REACTIVE_OPTIMISTIC_DIRTY, EFFECT_RENDER, EFFECT_USER } from "./constants.js";
+
+import { latestReadActive, currentOptimisticLane, stale } from "./core.js";
+
+import { NotReadyError } from "./error.js";
+
+import "./invariants.js";
+
+import { resolveTransition, getOrCreateLane, hasActiveOverride, activeLanes, signalLanes, findLane, resolveLane, assignOrMergeLane } from "./lanes.js";
+
+import { GlobalQueue, activeTransition, globalQueue, clock, insertSubs, schedule } from "./scheduler.js";
+
+/**
+ * The optimistic write engine, moved out of core.ts/scheduler.ts. Everything
+ * here serves only optimistic overrides — createOptimistic,
+ * createOptimisticStore (and its store-node writes), and the verdict layer's
+ * companions (which are optimistic nodes). Modules that can create optimistic
+ * state call `installOptimisticEngine()` before creating it; apps that never
+ * import one of those APIs never retain any of this.
+ *
+ * Core call sites fire the hooks behind guards on state only this module can
+ * create (`_overrideValue !== undefined`, `currentOptimisticLane !== null`,
+ * `_optimisticNodes.length`, `activeLanes.size`), so `!` invocations are safe
+ * once the gate holds — the same late-binding contract as verdict.ts.
+ */
+/** The optimistic half of setSignal, fired when `_overrideValue !== undefined`. */ function optimisticWrite(e, n) {
+    const t = e.De !== NOT_PENDING;
+    const i = t ? unwrapOverride(e.De) : e.be;
+    if (typeof n === "function") n = n(i);
+    const u = !!(e.S & STATUS_UNINITIALIZED) || !e.Ue || !e.Ue(i, n);
+    if (!u) {
+        // Same-value write with an active override still entangles the current
+        // action's transition — the hold must outlast all overlapping actions.
+        if (t) {
+            const n = resolveTransition(e);
+            if (n && activeTransition !== n) globalQueue.initTransition(n);
+        }
+        return n;
+    }
+    if (t) globalQueue.initTransition(resolveTransition(e));
+    // No revert target is stashed: while the override is active every reader
+    // sees it (A17), so authoritative arrivals commit silently into _value and
+    // reverting is just dropping the override — _value is already correct.
+     else globalQueue.m.Me.push(e);
+    // Stamp ownership on the node (post-merge, so entangled writers share the
+    // joint root). resolveTransition prefers this over the lane's _transition,
+    // which a shared subscriber can merge across transactions (#2912).
+        e.sn = activeTransition;
+    const r = getOrCreateLane(e);
+    e.Ke = r;
+    // Literal undefined must not land raw: the slot doubles as the optimistic
+    // brand, and erasing it makes the write invisible and routes follow-up
+    // writes off the optimistic path into permanent commits (#2898).
+        e.De = n === undefined ? OVERRIDE_UNDEFINED : n;
+    // syncCompanions only pokes _pendingSignal/_latestValueComputed — with
+    // neither companion present the call is a guaranteed no-op.
+        (e.Oe !== undefined || e.ge !== undefined) && GlobalQueue.Pe !== null && GlobalQueue.Pe(e, n);
+    e.de = clock;
+    insertSubs(e, true);
+    schedule();
+    return n;
+}
+
+/**
+ * transitionComplete's override blockage: a settling transition stays open
+ * while one of its optimistic nodes holds an active override that is still
+ * pending on real (non-affects-sentinel) async.
+ */ function transitionBlocked(e) {
+    for (let n = 0; n < e.Me.length; n++) {
+        const t = e.Me[n];
+        if (hasActiveOverride(t) && "S" in t && t.S & STATUS_PENDING && t._ instanceof NotReadyError) {
+            return true;
+        }
+    }
+    return false;
+}
+
+function resolveOptimisticNodes(e) {
+    // Settlement writes below (snapCompanionsToState → updatePendingSignal-style
+    // notifications) may push fresh optimistic nodes; only this batch settles
+    // now, so iterate a fixed window and splice it out at the end.
+    const n = e.length;
+    for (let t = 0; t < n; t++) {
+        const n = e[t];
+        n.Ke = undefined;
+        // Revert is a pure drop: there is no revert target to commit —
+        // override-covered authoritative values hold in _pendingValue and
+        // elevate on their OWN transition's schedule (A18 as re-ruled 2026-07-07).
+                if (!(n.S & STATUS_PENDING)) n.S &= ~STATUS_UNINITIALIZED;
+        const i = n.De;
+        n.De = NOT_PENDING;
+        if (i !== NOT_PENDING && n.be !== unwrapOverride(i)) insertSubs(n, true);
+        n.Ne = null;
+        n.sn = null;
+    }
+    // Settlement checkpoint (#2838): companions caught in this batch (or owned
+    // by a node in it) re-derive from committed state, so verdicts survive the
+    // transition that produced them (A19 — pending is a property of the data).
+        for (let t = 0; t < n; t++) {
+        const n = e[t];
+        if (n.Oe || n.ge) GlobalQueue.un(n);
+        const i = n.nn;
+        if (i && (i.Oe === n || i.ge === n)) GlobalQueue.un(i);
+    }
+    e.splice(0, n);
+}
+
+function runQueue(e, n) {
+    for (let t = 0; t < e.length; t++) e[t](n);
+}
+
+/**
+ * Run effects from all lanes that are ready (no pending async).
+ */ function runLaneEffects(e) {
+    for (const n of activeLanes) {
+        if (n.tn || n.Ae.size > 0) continue;
+        const t = n.rn[e - 1];
+        if (t.length) {
+            n.rn[e - 1] = [];
+            runQueue(t, e);
+        }
+    }
+}
+
+function cleanupCompletedLanes(e) {
+    for (const n of activeLanes) {
+        const t = e ? n.Ne === e : !n.Ne;
+        if (!t) continue;
+        if (!n.tn) {
+            if (n.rn[0].length) runQueue(n.rn[0], EFFECT_RENDER);
+            if (n.rn[1].length) runQueue(n.rn[1], EFFECT_USER);
+        }
+        if (n.en.Ke === n) n.en.Ke = undefined;
+        n.Ae.clear();
+        n.rn[0].length = 0;
+        n.rn[1].length = 0;
+        activeLanes.delete(n);
+        signalLanes.delete(n.en);
+    }
+}
+
+/** read()'s per-lane suspension test (pending-throw path, lane context). */ function laneSuspends(e) {
+    // Per-lane suspension: only throw if in same lane as pending async
+    // AND the node doesn't have an active override (overrides are the visible value,
+    // downstream in the lane should read the override, not throw)
+    const n = e.Ke;
+    if (!n) return false;
+    return findLane(n) === findLane(currentOptimisticLane) && !hasActiveOverride(e);
+}
+
+/**
+ * read()'s entanglement gate: a reader recomputing under an optimistic lane
+ * that reads a pending mid-transition write sees the committed value; the sub
+ * is recorded for replay at commit.
+ */ function gatedRead(e, n, t) {
+    if (latestReadActive || e._e === NOT_PENDING || e.ce || n !== e && !(n.se & REACTIVE_MANUAL_WRITE)) {
+        return false;
+    }
+    activeTransition.ln.add(t);
+    return true;
+}
+
+/**
+ * read()'s value selection under a lane: return the committed `_value` for
+ * optimistic/lane-assigned signals, stale-mode reads, and pending owners.
+ */ function laneReadsCommitted(e, n, t) {
+    if (e.De !== undefined || !!e.Ke || !!(n.S & STATUS_PENDING)) return true;
+    if (n === e && stale && t.nn !== e) {
+        // The committed view can hide a same-tick ambient write (a lane member —
+        // even just an isPending companion flip — puts the reader "under a lane"
+        // against unrelated plain writes). With no transaction the write commits
+        // at THIS flush's end with no re-delivery, so record the reader for
+        // replay at commit — the same contract gatedRead provides when a
+        // transaction is active (#2963). If a transaction forms mid-flush,
+        // initTransition carries the recording over to it.
+        if (e._e !== NOT_PENDING && activeTransition === null) globalQueue.m.ln.add(t);
+        return true;
+    }
+    return false;
+}
+
+/**
+ * recompute()'s lane posture: resolve the node's own lane (own=true), or adopt
+ * a dependency's optimistic lane (own=false — parent-deeper-than-owned-child
+ * can run before its OPT-dirty child propagates).
+ */ function recomputeLane(e, n) {
+    if (n) {
+        const n = resolveLane(e);
+        if (!n) return null;
+        // Wake-only lane demotion (#3009): a plain write to a latest()-tracked
+        // source rides the optimistic channel only to wake verdict companions —
+        // its lane is sourced by the companion shadow (_parentSource set) and owns
+        // no transaction. When such a node is pulled mid-tick by a latest()/
+        // isPending() probe, lane posture would direct-commit _value, leaking the
+        // queued write into committed reads before the flush. Return `false` so
+        // recompute() runs plain: the value stages and commits with the flush.
+        // (el's own override slot excludes companions themselves; a lane merged
+        // into a real optimistic lane resolves to a non-companion source.)
+                if (!globalQueue.cn && !activeTransition && !n.Ne && n.en.nn !== undefined && e.De === undefined) {
+            e.Ke = undefined;
+            return false;
+        }
+        return n;
+    }
+    for (let n = e.tt; n; n = n.nt) {
+        const t = n.it;
+        if (t.se & REACTIVE_OPTIMISTIC_DIRTY) {
+            const n = resolveLane(t);
+            if (n) {
+                e.se |= REACTIVE_OPTIMISTIC_DIRTY;
+                assignOrMergeLane(e, n);
+                return n;
+            }
+        }
+    }
+    return null;
+}
+
+/** recompute()'s catch path: track pending async in the current lane. */ function laneAsyncPending(e) {
+    const n = findLane(currentOptimisticLane);
+    if (n.en !== e) {
+        n.Ae.add(e);
+        e.Ke = n;
+        GlobalQueue.Se !== null && GlobalQueue.Se(n.en);
+    }
+}
+
+/** recompute()'s success path: the node's async settled, clear it from its lane. */ function laneAsyncSettled(e) {
+    const n = resolveLane(e);
+    if (n) {
+        n.Ae.delete(e);
+        GlobalQueue.Se !== null && GlobalQueue.Se(n.en);
+    }
+}
+
+function trackOptimisticStore(e) {
+    // After initTransition, globalQueue._batch IS activeTransition (same reference)
+    globalQueue.m.dn.add(e);
+    schedule();
+}
+
+/**
+ * Installs the engine's hooks. Idempotent; called by every module that can
+ * create optimistic state (verdict.ts at module top level, createOptimistic
+ * and createOptimisticStore at first call) BEFORE any optimistic node exists.
+ */ function installOptimisticEngine() {
+    if (GlobalQueue.Gt !== null) return;
+    GlobalQueue.Gt = optimisticWrite;
+    GlobalQueue.En = resolveOptimisticNodes;
+    GlobalQueue.Tn = transitionBlocked;
+    GlobalQueue.In = cleanupCompletedLanes;
+    GlobalQueue.Nn = runLaneEffects;
+    GlobalQueue.Rt = gatedRead;
+    GlobalQueue.Ot = laneSuspends;
+    GlobalQueue.Dt = laneReadsCommitted;
+    GlobalQueue.je = recomputeLane;
+    GlobalQueue.ze = laneAsyncPending;
+    GlobalQueue.Be = laneAsyncSettled;
+    GlobalQueue.Qn = trackOptimisticStore;
+}
+
+export { installOptimisticEngine };

package/dist/prod/core/owner.js

@@ -0,0 +1,302 @@
+import { REACTIVE_DISPOSED, REACTIVE_IN_HEAP, REACTIVE_IN_HEAP_HEIGHT, REACTIVE_ZOMBIE, CONFIG_TRANSPARENT, defaultContext } from "./constants.js";
+
+import { context, runWithOwner, pendingCheckActive, latestReadActive, tracking } from "./core.js";
+
+import { unlinkSubs } from "./graph.js";
+
+import { deleteFromHeap, queueFor, insertIntoHeap, insertIntoHeapHeight } from "./heap.js";
+
+import { GlobalQueue, zombieQueue, dirtyQueue, globalQueue } from "./scheduler.js";
+
+const PENDING_OWNER = {};
+
+ // Dummy owner to trigger store's read() path
+function markDisposal(e) {
+    let n = e.ke;
+    while (n) {
+        const e = n.se;
+        n.se = e | REACTIVE_ZOMBIE;
+        // migrate height-adjust entries too, not just recompute entries: every
+        // `deleteFromHeap` call site picks the queue from the zombie flag, so a
+        // node left physically linked in `dirtyQueue` after being zombified gets
+        // unlinked from the wrong queue on dispose, corrupting the bucket and
+        // livelocking the next `runHeap` that reaches it (#2759)
+                if (e & (REACTIVE_IN_HEAP | REACTIVE_IN_HEAP_HEIGHT)) {
+            deleteFromHeap(n, e & REACTIVE_ZOMBIE ? zombieQueue : dirtyQueue);
+            if (e & REACTIVE_IN_HEAP) insertIntoHeap(n, zombieQueue); else insertIntoHeapHeight(n, zombieQueue);
+        }
+        markDisposal(n);
+        n = n.He;
+    }
+}
+
+function dispose(e) {
+    // Leave every scheduler heap on disposal (mirrors `unobserved`): a node
+    // still queued here would be recomputed by the next flush, and recompute()
+    // rewriting `_flags` would clear REACTIVE_DISPOSED — resurrecting it (#2983).
+    deleteFromHeap(e, queueFor(e));
+    let n = e.tt;
+    while (n !== null) {
+        n = unlinkSubs(n);
+    }
+    e.tt = null;
+    e.Ye = null;
+    disposeChildren(e, true);
+}
+
+function disposeChildren(e, n = false, t) {
+    const i = e.se;
+    if (i & REACTIVE_DISPOSED) return;
+    if (n) {
+        e.se = i | REACTIVE_DISPOSED;
+        // Companions are created detached and outlive their owner, but a verdict
+        // must not: a disposed source can never settle, so an isPending companion
+        // latched `true` here would hold a spinner forever (INV-9, the PR #2845
+        // edge). Snap runs after the DISPOSED flag is set so the oracle reads
+        // false, and notifies subscribers still watching the companion.
+                const n = e;
+        if (n.Oe || n.ge) GlobalQueue.un(n);
+    }
+    if (n && e.ce) e.Te = null;
+    let l = t ? e.We : e.ke;
+    while (l) {
+        const e = l.He;
+        const n = l;
+        // Heap removal must not be gated on `_deps`: a dependency-free
+        // computation queued by refresh() has a null dep list but still sits in
+        // the dirty heap, and left there the post-disposal flush recomputes it —
+        // recompute() rewriting `_flags` clears REACTIVE_DISPOSED and the node
+        // comes back to life (post-unmount runs, leaked cleanups, #2983).
+                if (n.se & (REACTIVE_IN_HEAP | REACTIVE_IN_HEAP_HEIGHT)) deleteFromHeap(n, queueFor(n));
+        if (n.tt) {
+            let e = n.tt;
+            do {
+                e = unlinkSubs(e);
+            } while (e !== null);
+            n.tt = null;
+            n.Ye = null;
+        }
+        disposeChildren(l, true);
+        l = e;
+    }
+    if (t) {
+        e.We = null;
+    } else {
+        e.ke = null;
+        e.qe = 0;
+    }
+    // O(1) splice out of parent's chain on individual dispose. Skipped during
+    // batch dispose (parent already disposed) and zombie disposal (node sits on
+    // parent's _pendingFirstChild). We leave node._nextSibling intact so outer
+    // walks that already advanced past us still reach later siblings.
+        if (n && !t && !(i & REACTIVE_ZOMBIE) && e.Fe !== null && !(e.Fe.se & REACTIVE_DISPOSED)) {
+        const n = e.ct;
+        const t = e.He;
+        if (n !== null) n.He = t; else e.Fe.ke = t;
+        if (t !== null) t.ct = n;
+        e.ct = null;
+    }
+    runDisposal(e, t);
+    // Final effect-returned cleanup fires at true disposal, after `_disposal`
+    // to mirror rerun ordering (compute-phase teardown first, cleanup last).
+        if (n && e.Nt) {
+        const n = e.Nt;
+        e.Nt = undefined;
+        n();
+    }
+}
+
+function runDisposal(e, n) {
+    let t = n ? e.Qe : e.he;
+    if (!t) return;
+    if (Array.isArray(t)) {
+        for (let e = 0; e < t.length; e++) {
+            const n = t[e];
+            n.call(n);
+        }
+    } else {
+        t.call(t);
+    }
+    n ? e.Qe = null : e.he = null;
+}
+
+function childId(e, n) {
+    let t = e;
+    while (t.T & CONFIG_TRANSPARENT && t.Fe) t = t.Fe;
+    if (t.id != null) return formatId(t.id, n ? t.qe++ : t.qe);
+    throw new Error("");
+}
+
+/**
+ * Allocates and returns the next stable child id for `owner`. Used by
+ * hydration plumbing and `createUniqueId`. Not part of the user-facing API.
+ *
+ * @internal
+ */ function getNextChildId(e) {
+    return childId(e, true);
+}
+
+/**
+ * The id a freshly-created node inherits: an explicit `options.id` wins;
+ * transparent nodes share their parent's id; otherwise the parent's next
+ * child id is consumed (or `undefined` outside an id-carrying tree).
+ */ function inheritId(e, n, t) {
+    return e?.id ?? (n ? t?.id : t?.id != null ? getNextChildId(t) : undefined);
+}
+
+/**
+ * Returns the *next* child id for `owner` without consuming it. Used by
+ * hydration plumbing to peek at the id a future child will receive.
+ *
+ * @internal
+ */ function peekNextChildId(e) {
+    return childId(e, false);
+}
+
+function formatId(e, n) {
+    const t = n.toString(36), i = t.length - 1;
+    return e + (i ? String.fromCharCode(64 + i) : "") + t;
+}
+
+/**
+ * Returns the currently-tracking observer (the computation that subscribes to
+ * reactive reads at this point), or `null` if reads here would be untracked.
+ * Used by reactive primitives that need to know whether they're inside a
+ * tracking scope. App code rarely needs this — see `getOwner()` for the
+ * lifecycle owner instead.
+ *
+ * @example
+ * ```ts
+ * // Library predicate: only register a hot-path subscription when the
+ * // caller is inside a tracking scope (memo / effect compute / JSX).
+ * function trackIfTracked(source: () => unknown) {
+ *   if (getObserver()) source();
+ * }
+ * ```
+ */ function getObserver() {
+    if (pendingCheckActive || latestReadActive) return PENDING_OWNER;
+    return tracking ? context : null;
+}
+
+/**
+ * Returns the current reactive **owner** — the lifecycle node that the next
+ * `cleanup()` / `onCleanup()` / `createSignal()` etc. will be attached to.
+ *
+ * Returns `null` if called outside any owner. Capture the owner with
+ * `getOwner()` and re-enter it later with `runWithOwner(owner, fn)` to attach
+ * disposables created from a callback (event handler, async resolution, etc.)
+ * back to a component's lifecycle.
+ *
+ * @example
+ * ```ts
+ * function defer<T>(fn: () => T) {
+ *   const owner = getOwner();
+ *   queueMicrotask(() => runWithOwner(owner, fn));
+ * }
+ * ```
+ */ function getOwner() {
+    return context;
+}
+
+/**
+ * Low-level: registers `fn` as a disposal callback on the current owner.
+ * Most code should use `onCleanup()` from `solid-js`, which adds dev-mode
+ * checks. `cleanup()` is the unchecked primitive used by internals.
+ */ function cleanup(e) {
+    if (!context) return e;
+    if (!context.he) context.he = e; else if (Array.isArray(context.he)) context.he.push(e); else context.he = [ context.he, e ];
+    return e;
+}
+
+/**
+ * Returns `true` if the owner has been disposed (or marked zombie pending
+ * disposal). Pair with a captured owner to bail out of late callbacks whose
+ * surrounding component already unmounted.
+ *
+ * @example
+ * ```ts
+ * function onSettleSafe(fn: () => void) {
+ *   const owner = getOwner();
+ *   queueMicrotask(() => {
+ *     if (owner && isDisposed(owner)) return; // component unmounted; skip
+ *     runWithOwner(owner, fn);
+ *   });
+ * }
+ * ```
+ */ function isDisposed(e) {
+    return !!(e.se & (REACTIVE_DISPOSED | REACTIVE_ZOMBIE));
+}
+
+function disposeRootSelf(e = true) {
+    disposeChildren(this, e);
+}
+
+/**
+ * Creates a fresh owner attached as a child of the current owner (or as a
+ * detached root if there is none). Used by framework internals to group
+ * cleanups; app code should use `createRoot()` (host a reactive scope outside
+ * a component) or `runWithOwner()` (re-enter a captured owner).
+ *
+ * @internal
+ */ function createOwner(e) {
+    const n = context;
+    const t = e?.transparent ?? false;
+    const i = {
+        id: inheritId(e, t, n),
+        T: t ? CONFIG_TRANSPARENT : 0,
+        Tt: true,
+        It: n?.Tt ? n.It : n,
+        ke: null,
+        He: null,
+        ct: null,
+        he: null,
+        C: n?.C ?? globalQueue,
+        we: n?.we || defaultContext,
+        qe: 0,
+        Qe: null,
+        We: null,
+        Fe: n,
+        dispose: disposeRootSelf
+    };
+    if (n) {
+        const e = n.ke;
+        if (e === null) {
+            n.ke = i;
+        } else {
+            i.He = e;
+            e.ct = i;
+            n.ke = i;
+        }
+    }
+    return i;
+}
+
+/**
+ * Creates a detached reactive root. The callback receives a `dispose()`
+ * function which, when called, tears down every signal, memo, effect, and
+ * `onCleanup` registered inside the root.
+ *
+ * Use this to host long-lived reactive scopes outside of a component (custom
+ * controllers, app bootstrapping, tests). Inside a component, prefer
+ * letting Solid's component lifecycle own things.
+ *
+ * @example
+ * ```ts
+ * const dispose = createRoot(dispose => {
+ *   const [n, setN] = createSignal(0);
+ *   createEffect(() => n(), value => console.log(value));
+ *   setInterval(() => setN(x => x + 1), 1000);
+ *   return dispose;
+ * });
+ *
+ * // Later, to tear everything down:
+ * dispose();
+ * ```
+ *
+ * @description https://docs.solidjs.com/reference/reactive-utilities/create-root
+ */ function createRoot(e, n) {
+    const t = createOwner(n);
+    return runWithOwner(t, () => e(() => t.dispose()));
+}
+
+export { cleanup, createOwner, createRoot, dispose, disposeChildren, getNextChildId, getObserver, getOwner, inheritId, isDisposed, markDisposal, peekNextChildId };