@abide/abide 0.58.0 → 0.101.0

package/src/lib/ui/runtime/createDoc.ts

@@ -1,334 +0,0 @@
-import { applyPatchToTree } from './applyPatchToTree.ts'
-import { batch } from './batch.ts'
-import { createComputedNode } from './createComputedNode.ts'
-import { createSignalNode } from './createSignalNode.ts'
-import { pathSegments } from './pathSegments.ts'
-import { readNode } from './readNode.ts'
-import { trigger } from './trigger.ts'
-import type { Cell } from './types/Cell.ts'
-import type { Doc } from './types/Doc.ts'
-import type { Patch } from './types/Patch.ts'
-import type { ReactiveNode } from './types/ReactiveNode.ts'
-import { walkPath } from './walkPath.ts'
-import { writeNode } from './writeNode.ts'
-
-/* `path` minus its last segment — the parent container's path, '' at the root.
-   The same string `segments.slice(0, -1).join('/')` rebuilds, by one slice. */
-function parentPathOf(path: string): string {
-    const lastSlash = path.lastIndexOf('/')
-    return lastSlash === -1 ? '' : path.slice(0, lastSlash)
-}
-
-/*
-Builds a reactive document over `initial`. Each path read for the first time
-mints a signal node; the node is the notification token, the (mutable) tree is
-the source of truth. A patch mutates the tree in place — O(depth), not O(width) —
-then wakes from the patch's **change root** with shape-only reactivity:
-
-  - a value change at a path (an object key replaced with a new value) wakes only
-    that path and, if it became a container, its descendants — NOT its ancestors.
-    Reading a container subscribes to its own shape, so a deep field change never
-    re-runs a reader of the array/object above it (the reason a single list-item
-    edit doesn't reconcile the whole `each`).
-  - a structural change (add/remove anywhere, or replacing an array element by
-    index) changes the *parent container's* shape, so the parent is the change
-    root: it is force-notified (its identity is unchanged after in-place mutation)
-    and its descendants are re-read to pick up index shifts.
-
-Reads of exactly the changed path are gated by `Object.is`, so an equal write
-wakes nobody. Change is addressed, not diffed, and the address is as shallow as
-the change.
-*/
-export function createDoc(initial: unknown): Doc {
-    let tree = initial
-    const nodes = new Map<string, ReactiveNode>()
-    /* Prefix index: every path → the set of its DIRECT children that lie on a route
-       to some minted node (a trie over the minted paths' ancestor chains). A
-       structural descend walks this from the change root through actual descendants
-       only, replacing the old O(all live cells) `startsWith` scan over the whole
-       `nodes` map. The links span INTERMEDIATE paths that have no node of their own
-       (e.g. `byId` and `byId/<key>` exist as links even when only `byId/<key>/n` was
-       read), so a descend from any ancestor reaches the leaf. Maintained in lockstep
-       with `nodes`: a node's whole ancestor chain is linked when `nodeFor` mints it,
-       unlinked from the leaf up when `wakeSubtree` evicts it. Membership of a path in
-       `nodes` (does it carry a signal?) is independent of its membership here (is it
-       on a route to one?). */
-    const childKeys = new Map<string, Set<string>>()
-    /* Computed slots: a path whose value is a function of other paths, not stored
-       truth. Held apart from `nodes` so the structural wake/eviction never touches
-       them; their dirtiness is driven entirely by the deps they read (the signal
-       graph), not by tree mutations. They are not in `tree`, so `snapshot` omits
-       them, and they never pass through `apply` — a recompute is a downstream reaction
-       of the signal graph, not a tree change. */
-    const computed = new Map<string, ReactiveNode>()
-
-    /* Links `path` into the trie under its parent and continues up the ancestor chain.
-       Stops at the first ancestor whose parent set already lists it — that link, and
-       everything above it, is already present (some sibling minted the upper chain). */
-    function linkPath(path: string): void {
-        let child = path
-        for (;;) {
-            const parentPath = parentPathOf(child)
-            const siblings = childKeys.get(parentPath)
-            if (siblings === undefined) {
-                childKeys.set(parentPath, new Set([child]))
-            } else if (siblings.has(child)) {
-                return
-            } else {
-                siblings.add(child)
-            }
-            if (parentPath === '') {
-                return
-            }
-            child = parentPath
-        }
-    }
-
-    function nodeFor(path: string): ReactiveNode {
-        let node = nodes.get(path)
-        if (node === undefined) {
-            node = createSignalNode(walkPath(tree, path).value)
-            nodes.set(path, node)
-            linkPath(path)
-        }
-        return node
-    }
-
-    /* Drops a node and unlinks it from the trie, pruning each emptied ancestor link up
-       the chain — the eviction half of the lockstep with `nodeFor`. A link is removed
-       only once its child set empties, so an intermediate path with other live
-       descendants keeps its place. */
-    function evict(path: string): void {
-        nodes.delete(path)
-        let child = path
-        for (;;) {
-            const parentPath = parentPathOf(child)
-            const siblings = childKeys.get(parentPath)
-            if (siblings === undefined) {
-                return
-            }
-            siblings.delete(child)
-            /* A parent still listing other children, or still carrying its own node,
-               stays — only a fully empty, node-less link is pruned and walked past. */
-            if (siblings.size > 0) {
-                return
-            }
-            childKeys.delete(parentPath)
-            if (parentPath === '' || nodes.has(parentPath)) {
-                return
-            }
-            child = parentPath
-        }
-    }
-
-    function read<T>(path: string): T {
-        /* Size-gated so a doc with no computed slots pays nothing on the stored hot
-           path — only one `.size` check, not a `.get` per read. */
-        if (computed.size > 0) {
-            const computedNode = computed.get(path)
-            if (computedNode !== undefined) {
-                return readNode(computedNode) as T
-            }
-        }
-        return readNode(nodeFor(path)) as T
-    }
-
-    /* Registers a computed slot at `path` and returns a string-free reader bound to
-       its node — the hoisted accessor the compiler would emit (the `computed` form),
-       so a hot read skips the path lookup. Reading the compute subscribes it to
-       whatever doc paths it touches; those deps then drive its recomputation. */
-    function derive<T>(path: string, compute: () => T): () => T {
-        const node = createComputedNode(compute as () => unknown)
-        computed.set(path, node)
-        return () => readNode(node) as T
-    }
-
-    /*
-    Wakes readers from `rootPath`. `force` notifies the root unconditionally (a
-    structural change keeps the container's identity, so there is no new value to
-    compare); otherwise the root is written through the `Object.is` gate. When
-    `descend`, a container root also re-reads its existing descendant nodes (gated)
-    to catch nested and index-shifted values. `descend` is skipped for a change
-    that leaves every existing descendant path addressing the same value (an
-    end-append or an object-key add), so those updates stay O(depth) instead of
-    paying a scan over every minted node.
-    */
-    function wakeSubtree(rootPath: string, force: boolean, descend: boolean): void {
-        const rootValue = walkPath(tree, rootPath).value
-        const rootNode = nodes.get(rootPath)
-        if (rootNode !== undefined) {
-            if (force) {
-                trigger(rootNode)
-            } else {
-                writeNode(rootNode, rootValue)
-            }
-        }
-        if (!descend || rootValue === null || typeof rootValue !== 'object') {
-            return
-        }
-        const prefix = rootPath === '' ? '' : `${rootPath}/`
-        /* Walk the prefix index from `rootPath` over its real descendants only — a
-           BFS over the parent→children adjacency map — instead of scanning every live
-           node. `pending` holds parent-paths whose direct children are yet to visit;
-           each visited child that is itself a container is enqueued. The total work is
-           the size of the changed subtree, not the whole doc. */
-        const pending: string[] = [rootPath]
-        while (pending.length > 0) {
-            const parentPath = pending.pop() as string
-            const siblings = childKeys.get(parentPath)
-            if (siblings === undefined) {
-                continue
-            }
-            /* Snapshot the set before iterating: eviction below mutates it, and a
-               deleted child must not skip its successor (Set iteration is order-
-               sensitive to in-place deletes). */
-            for (const candidate of [...siblings]) {
-                /* Walk from the already-resolved container (`rootValue`) using only the
-                   path SUFFIX past the shared prefix, instead of re-walking every
-                   candidate's full path from the tree root — the prefix is walked once
-                   per wake, not once per descendant. */
-                const walk = walkPath(rootValue, candidate.slice(prefix.length))
-                /* An INTERMEDIATE link (a path on a route to a node but carrying none of
-                   its own — e.g. `byId/<key>` when only `byId/<key>/n` was read) has no
-                   signal to wake; it exists only to be descended through. So the
-                   wake/evict touches a node only when one is present, while the descend
-                   decision below is independent of node existence. */
-                const node = nodes.get(candidate)
-                if (walk.exists) {
-                    if (node !== undefined) {
-                        writeNode(node, walk.value)
-                    }
-                    /* Descend into a container child to reach its own descendants. */
-                    if (walk.value !== null && typeof walk.value === 'object') {
-                        pending.push(candidate)
-                    }
-                } else {
-                    /* A descendant whose path the mutation removed — a deleted key, an
-                       out-of-range index after a shrink — is woken to undefined, then
-                       dropped from the registry. The woken reader re-mints a fresh node
-                       on its flush if the path ever returns. A removed container's own
-                       descendants are still enqueued (whether or not THIS path held a
-                       node) so they too are woken/evicted. */
-                    if (node !== undefined) {
-                        writeNode(node, undefined)
-                        evict(candidate)
-                    }
-                    pending.push(candidate)
-                }
-            }
-        }
-    }
-
-    function apply(patch: Patch): void {
-        /* Segments index the tree, so they carry the REAL keys (unescaped); the path
-           strings (parentPath, node-map keys) stay escaped, re-walked through walkPath. */
-        const segments = patch.path === '' ? [] : pathSegments(patch.path)
-        tree = applyPatchToTree(tree, patch, segments)
-        const parentPath = parentPathOf(patch.path)
-        const parentValue = walkPath(tree, parentPath).value
-        const leafKey = segments[segments.length - 1] as string | undefined
-        /* A structural change (add/remove, or an array element replaced by index)
-           reshapes the parent; a plain value replace reshapes only its own path. */
-        const parentIsArray = Array.isArray(parentValue)
-        const structural = patch.op !== 'replace' || parentIsArray
-        const arrayLength = parentIsArray ? (parentValue as unknown[]).length : 0
-        /* An add that introduces a new path without shifting any existing sibling —
-           an object-key add or an array append at the end — changes only the added
-           slot's subtree plus (for an array) its `length` node, never the existing
-           element nodes. Waking exactly those two avoids re-reading every descendant
-           of a large container. Every other structural change (any remove, a
-           mid-array insert, an array element replace) shifts indices or replaces a
-           subtree, so all descendants must be re-read. */
-        const nonShiftingAdd =
-            patch.op === 'add' &&
-            (!parentIsArray || leafKey === '-' || Number(leafKey) === arrayLength - 1)
-        batch(() => {
-            if (segments.length === 0) {
-                wakeSubtree('', true, true)
-            } else if (!structural) {
-                wakeSubtree(patch.path, false, true)
-            } else if (nonShiftingAdd) {
-                wakeSubtree(parentPath, true, false)
-                /* The appended slot resolves to its real index when keyed by `-`. */
-                const addedPath =
-                    parentIsArray && leafKey === '-'
-                        ? `${parentPath}/${arrayLength - 1}`
-                        : patch.path
-                wakeSubtree(addedPath, false, true)
-                const lengthNode = parentIsArray ? nodes.get(`${parentPath}/length`) : undefined
-                if (lengthNode !== undefined) {
-                    writeNode(lengthNode, arrayLength)
-                }
-            } else {
-                wakeSubtree(parentPath, true, true)
-            }
-        })
-    }
-
-    /*
-    A stable accessor bound to one scalar leaf — what the compiler emits so a hot
-    loop has zero string work: the node, the parent container, and the leaf key
-    are resolved once. `set` mutates the parent directly and writes the node
-    through the gate; no ancestor walk, because a scalar leaf change is shape-only
-    (it never reshapes its container). Valid while ancestors keep their identity
-    (the scalar-field case); a wholesale ancestor replace re-binds the cell.
-    */
-    function cell<T>(path: string): Cell<T> {
-        const node = nodeFor(path)
-        const segments = pathSegments(path)
-        const leafKey = segments[segments.length - 1] as string
-        const ancestors = segments.slice(0, -1)
-        /* The resolved parent container, cached after the first write. `get` never needs
-           it (it reads through `node`), so it is not computed at cell creation. */
-        let parent: Record<string, unknown> | undefined
-        /* Auto-vivify missing ancestor objects so a `set` on a nested path bound over a
-           doc booted shallow (e.g. `state({})`) writes into the LIVE tree (snapshot/persist
-           see it) rather than crashing. Done LAZILY on the first write, NOT at cell
-           creation: `hoistCells` lifts a cell to component-mount scope, so vivifying eagerly
-           would fabricate container structure for a path only ever written behind a branch /
-           in a handler that never runs. Mirrors applyPatchToTree's container assumption,
-           but the intermediates may not exist yet since this walk is compiler-emitted. */
-        const resolveParent = (): Record<string, unknown> => {
-            let current = tree as Record<string, unknown>
-            for (let index = 0; index < ancestors.length; index += 1) {
-                const segment = ancestors[index] as string
-                let next = current[segment]
-                if (next === null || typeof next !== 'object') {
-                    /* Create an array when the NEXT segment addresses an array element (a
-                       numeric index or the `-` push slot), else a plain object — otherwise a
-                       bound path like `items/0/name` on a shallow doc fabricates `items` as an
-                       object keyed by "0", which a later `add("items/-", …)` can't push into. */
-                    const childKey = (ancestors[index + 1] ?? leafKey) as string
-                    next = childKey === '-' || /^\d+$/.test(childKey) ? [] : {}
-                    current[segment] = next
-                }
-                current = next as Record<string, unknown>
-            }
-            return current
-        }
-        return {
-            get: () => readNode(node) as T,
-            set: (value: T) => {
-                parent ??= resolveParent()
-                parent[leafKey] = value
-                writeNode(node, value)
-                return value
-            },
-        }
-    }
-
-    const self: Doc = {
-        read,
-        cell,
-        derive,
-        apply,
-        replace: (path, value) => {
-            apply({ op: 'replace', path, value })
-            return value
-        },
-        add: (path, value) => apply({ op: 'add', path, value }),
-        remove: (path) => apply({ op: 'remove', path }),
-        snapshot: () => tree,
-    }
-    return self
-}

package/src/lib/ui/runtime/createEffectNode.ts

@@ -1,81 +0,0 @@
-import { boundaryFor } from './boundaryFor.ts'
-import { CURRENT_BOUNDARY } from './CURRENT_BOUNDARY.ts'
-import { CURRENT_SCOPE } from './CURRENT_SCOPE.ts'
-import { inScope } from './inScope.ts'
-import { NODE_STATE } from './NODE_STATE.ts'
-import { OWNER } from './OWNER.ts'
-import { runNode } from './runNode.ts'
-import { toTeardown } from './toTeardown.ts'
-import type { EffectResult } from './types/EffectResult.ts'
-import type { ReactiveNode } from './types/ReactiveNode.ts'
-import type { Teardown } from './types/Teardown.ts'
-import { unlinkDeps } from './unlinkDeps.ts'
-
-/*
-Creates an effect: a side-effecting node that runs once immediately (capturing
-its dependencies) and again whenever any of them change. The body may return a
-teardown — run before each re-run and on dispose — and may be async (its teardown
-then runs once the promise settles, never awaited). Returns a dispose that runs
-the final teardown and unlinks the node from the graph, so a torn-down effect
-leaves no back-links and no live resource — the open-on-first-read /
-close-on-last-reader lifecycle. When created inside a `scope()` build, the
-disposer is also registered with the owner so the whole component tears down
-together.
-*/
-export function createEffectNode(fn: () => EffectResult): () => void {
-    /* The body's teardown, replaced each run. Held in this closure rather than on
-       ReactiveNode so signals and computeds — which share the node shape and the
-       read/write hot path — pay nothing for a feature only effects use. */
-    let cleanup: Teardown | undefined
-    /* The teardown fires deferred (before a re-run, on dispose) when the ambient scope
-       has moved on; pin the one current at creation so an ambient `scope()` inside it
-       resolves the owning component, matching how `attach` pins its teardown. */
-    const captured = CURRENT_SCOPE.current
-    /* Runs the previous run's teardown before re-running and on dispose, exactly
-       once each. */
-    const runCleanup = (): void => {
-        if (cleanup !== undefined) {
-            const teardown = cleanup
-            cleanup = undefined
-            inScope(captured, teardown)
-        }
-    }
-    const node: ReactiveNode = {
-        value: undefined,
-        compute: () => {
-            runCleanup()
-            cleanup = toTeardown(fn())
-        },
-        depsHead: undefined,
-        depsTail: undefined,
-        subsHead: undefined,
-        subsTail: undefined,
-        /* Born DIRTY; the immediate `runNode` below captures deps and settles it CLEAN. */
-        status: NODE_STATE.DIRTY,
-        thrown: undefined,
-        isEffect: true,
-    }
-    runNode(node)
-    const dispose = () => {
-        runCleanup()
-        unlinkDeps(node)
-        /* Clearing compute makes runNode a no-op: an effect disposed mid-flush (by an
-           earlier effect in the same batch) is still in the queue flushEffects is
-           draining, so without this it would re-run its body and re-link into the graph
-           — a disposed effect resurrected. This alone neutralizes it; the queue is a
-           plain array (no O(1) delete) and a settled no-op iteration is cheaper than an
-           O(n) splice, so the stale entry is left to be skipped on its flush. */
-        node.compute = undefined
-    }
-    if (OWNER.current !== undefined) {
-        OWNER.current.push(dispose)
-    }
-    /* Effects built inside a reactive `{#try}` associate with its boundary so a LATER re-run
-       throw (an async cell that rejects post-mount, read via a throwing peek) routes there
-       rather than the collect-and-rethrow fallback. Populated only under a boundary — the
-       node shape stays untouched, the lookup is cold (only on the throw path). */
-    if (CURRENT_BOUNDARY.current !== undefined) {
-        boundaryFor.set(node, CURRENT_BOUNDARY.current)
-    }
-    return dispose
-}

package/src/lib/ui/runtime/createSignalNode.ts

@@ -1,19 +0,0 @@
-import { NODE_STATE } from './NODE_STATE.ts'
-import type { ReactiveNode } from './types/ReactiveNode.ts'
-
-/* Creates a writable leaf node holding `value` with no compute — the source a
-   document path or a `state()` cell is backed by. Always CLEAN: a signal has no
-   dependencies to settle; its value is whatever was last written. */
-export function createSignalNode(value: unknown): ReactiveNode {
-    return {
-        value,
-        compute: undefined,
-        depsHead: undefined,
-        depsTail: undefined,
-        subsHead: undefined,
-        subsTail: undefined,
-        status: NODE_STATE.CLEAN,
-        thrown: undefined,
-        isEffect: false,
-    }
-}

package/src/lib/ui/runtime/currentAbortSignal.ts

@@ -1,26 +0,0 @@
-import { cacheManagedSlot } from '../../shared/cacheManagedSlot.ts'
-import { REACTIVE_CONTEXT } from './REACTIVE_CONTEXT.ts'
-import { reactiveAbortState } from './reactiveAbortState.ts'
-
-/*
-The AbortSignal bound to the currently-running reactive computation (effect or
-computed), its controller created lazily on first use. An RPC invoked inside a
-reactive read passes this to fetch, so the request aborts when that computation
-re-runs (superseded) or its scope disposes (navigated away). Returns undefined —
-leaving the fetch unbound by scope — in two cases: there is no reactive owner to
-bind to (an event-handler call), or the call is cache-managed (the cache owns the
-shared flight's lifetime; binding it to one reader would abort it for the others).
-*/
-export function currentAbortSignal(): AbortSignal | undefined {
-    const node = REACTIVE_CONTEXT.observer
-    if (node === undefined || cacheManagedSlot.active) {
-        return undefined
-    }
-    let controller = reactiveAbortState.controllers.get(node)
-    if (controller === undefined) {
-        controller = new AbortController()
-        reactiveAbortState.controllers.set(node, controller)
-        reactiveAbortState.armed = true
-    }
-    return controller.signal
-}

package/src/lib/ui/runtime/detachLink.ts

@@ -1,21 +0,0 @@
-import type { ReactiveLink } from './types/ReactiveLink.ts'
-
-/*
-Removes an edge from its source's subscriber list — the `*Sub` splice of an O(1)
-unlink. Used when a recompute drops a dependency it no longer reads (`runNode`'s
-trim) and when a node tears down entirely (`unlinkDeps`). Leaves the edge's `*Dep`
-pointers alone; the caller owns the observer-side list it is walking.
-*/
-export function detachLink(link: ReactiveLink): void {
-    const { dep, prevSub, nextSub } = link
-    if (prevSub !== undefined) {
-        prevSub.nextSub = nextSub
-    } else {
-        dep.subsHead = nextSub
-    }
-    if (nextSub !== undefined) {
-        nextSub.prevSub = prevSub
-    } else {
-        dep.subsTail = prevSub
-    }
-}

package/src/lib/ui/runtime/endTracking.ts

@@ -1,24 +0,0 @@
-import { detachLink } from './detachLink.ts'
-import type { ReactiveNode } from './types/ReactiveNode.ts'
-
-/*
-Closes a dependency-capture pass: every edge trailing the recompute cursor
-(`depsTail`) is a dependency last run read but this run didn't, so unlink it from
-its source and truncate the list at the cursor. `track` advanced the cursor past
-each reused edge during compute, so the cursor is the new tail. A node that read
-nothing leaves the cursor at the start (`undefined`), dropping every edge.
-*/
-export function endTracking(node: ReactiveNode): void {
-    const cursor = node.depsTail
-    let stale = cursor === undefined ? node.depsHead : cursor.nextDep
-    while (stale !== undefined) {
-        const next = stale.nextDep
-        detachLink(stale)
-        stale = next
-    }
-    if (cursor !== undefined) {
-        cursor.nextDep = undefined
-    } else {
-        node.depsHead = undefined
-    }
-}

package/src/lib/ui/runtime/enterRenderPass.ts

@@ -1,13 +0,0 @@
-import { RENDER } from './RENDER.ts'
-
-/* Marks entry into a render/mount. The OUTERMOST one (depth 0) clears the per-path
-   block-id counters so every render pass starts each path at 0 (a re-navigation to the
-   same route must not continue a prior pass's counter); a child component's render/mount
-   runs at depth > 0 and continues the same map. Pair with `exitRenderPass`. */
-// @documentation plumbing
-export function enterRenderPass(): void {
-    if (RENDER.depth === 0) {
-        RENDER.blockCounters.clear()
-    }
-    RENDER.depth += 1
-}

package/src/lib/ui/runtime/escapeKey.ts

@@ -1,19 +0,0 @@
-/*
-Escapes one object key into a JSON Pointer reference token (RFC 6901): `~`→`~0`,
-`/`→`~1`, so a key that itself contains `/` (a URL id, a date, a composite key)
-survives a `/`-joined path instead of being mis-split into segments. `~` is
-escaped first so a `/`→`~1` substitution isn't re-escaped. The common key (a
-plain identifier) contains neither char, so the scan returns it untouched.
-
-Coerces first: lowerDocAccess wraps every dynamic path segment in this call, and a
-segment is often a number (an array index `lines[i]`) — String() mirrors the `+`
-join that built the path before, leaving numerics as their decimal text.
-*/
-// @documentation plumbing
-export function escapeKey(key: string | number): string {
-    const segment = String(key)
-    if (!segment.includes('~') && !segment.includes('/')) {
-        return segment
-    }
-    return segment.replace(/~/g, '~0').replace(/\//g, '~1')
-}

package/src/lib/ui/runtime/exitRenderPass.ts

@@ -1,7 +0,0 @@
-import { RENDER } from './RENDER.ts'
-
-/* Marks exit from a render/mount, unwinding the depth `enterRenderPass` raised. */
-// @documentation plumbing
-export function exitRenderPass(): void {
-    RENDER.depth -= 1
-}

package/src/lib/ui/runtime/flushEffects.ts

@@ -1,91 +0,0 @@
-import { boundaryFor } from './boundaryFor.ts'
-import { NODE_STATE } from './NODE_STATE.ts'
-import { REACTIVE_CONTEXT } from './REACTIVE_CONTEXT.ts'
-import { SuspenseSignal } from './SuspenseSignal.ts'
-import type { ReactiveNode } from './types/ReactiveNode.ts'
-import { updateIfNecessary } from './updateIfNecessary.ts'
-
-/*
-Drains queued effects synchronously. Each is queued when it first leaves CLEAN, but
-runs only if `updateIfNecessary` finds a dependency that truly changed — a CHECK
-effect whose deps all memoised back to equal values settles to CLEAN without
-running its body. Double-buffers the queue each pass — swaps in a fresh array and
-drains the captured one — so an effect that dirties further effects re-queues them
-for the next pass rather than mutating the array mid-iteration; loops until the
-graph settles. The swap reuses the drained array as the next spare, so a steady
-flush allocates nothing.
-
-Raises `batchDepth` for the whole drain so a write inside an effect body queues
-rather than re-entering the flush: `trigger` gates its flush on `batchDepth === 0`,
-and re-entry would run a just-dirtied effect nested — ahead of effects already in
-this pass and on a JS stack that grows with the write chain. Suppressed, the
-newly-dirtied effect falls to the `do…while` and runs in queue (creation) order.
-*/
-export function flushEffects(): void {
-    /* Empty-queue fast path allocates nothing — only the length check, matching the
-       old `Set.size` guard. Hot: a write with no subscribed effect (e.g. a reconcile's
-       index-cell write nobody reads) still calls here at batch-exit, thousands of times
-       per list op; the spare array below must not be born on that path. */
-    if (REACTIVE_CONTEXT.pendingEffects.length === 0) {
-        return
-    }
-    /* Always entered at depth 0 (trigger/batch-exit gate on it); the bump makes the
-       drain non-reentrant, restored in `finally` so a throwing effect body can't strand
-       the graph batched. */
-    REACTIVE_CONTEXT.batchDepth += 1
-    try {
-        drain()
-    } finally {
-        REACTIVE_CONTEXT.batchDepth -= 1
-    }
-}
-
-function drain(): void {
-    let spare: ReactiveNode[] = []
-    let errors: unknown[] | undefined
-    do {
-        const batch = REACTIVE_CONTEXT.pendingEffects
-        REACTIVE_CONTEXT.pendingEffects = spare
-        for (let index = 0; index < batch.length; index += 1) {
-            const node = batch[index] as ReactiveNode
-            try {
-                updateIfNecessary(node)
-            } catch (error) {
-                /* A `SuspenseSignal` is "no value yet", not an error, and must NEVER route to a
-                   reactive `{#try}` (that would flash the author's `{:catch}` during loading,
-                   ADR-0042 D3). Every reading region catches its own suspend locally and re-runs on
-                   settle (the throwing read subscribed its cell), so a `SuspenseSignal` reaches here
-                   only if it escaped an unguarded read — surface it via the error collector below
-                   rather than leaking it to a boundary. A normal error routes to the node's nearest
-                   `{#try}` boundary: swap the guarded content to the catch branch instead of the
-                   rethrow fallback — the "later re-run throw" the sync boundary could not catch.
-                   Reset it CLEAN either way so a later write to its deps can re-queue it (otherwise
-                   `mark`'s CLEAN→dirty gate leaves it permanently inert). */
-                if (!(error instanceof SuspenseSignal)) {
-                    const boundary = boundaryFor.get(node)
-                    if (boundary !== undefined) {
-                        boundary.handle(error)
-                        node.status = NODE_STATE.CLEAN
-                        continue
-                    }
-                }
-                /* No boundary — one effect throwing must not strand the effects queued behind
-                   it (they live in this same `batch`, unreachable once we swap
-                   `pendingEffects`); keep draining and surface the error(s) once the graph has
-                   settled rather than swallowing them. */
-                node.status = NODE_STATE.CLEAN
-                if (errors === undefined) {
-                    errors = []
-                }
-                errors.push(error)
-            }
-        }
-        batch.length = 0
-        spare = batch
-    } while (REACTIVE_CONTEXT.pendingEffects.length > 0)
-    if (errors !== undefined) {
-        throw errors.length === 1
-            ? errors[0]
-            : new AggregateError(errors, 'abide: effects threw during flush')
-    }
-}