@solidjs/signals 2.0.0-rc.16 → 2.0.0-rc.18

package/dist/prod/from.js

@@ -0,0 +1,248 @@
+import { isThenable, onSupersede } from "./core/async.js";
+
+import { CONFIG_CHILDREN_FORBIDDEN } from "./core/constants.js";
+
+import { cleanup, getOwner } from "./core/owner.js";
+
+// `from` — a push source (callback subscription, Observable, AsyncIterable)
+// as an AsyncIterable a computation can return or `for await` over:
+//   const value = createMemo(() => from(source));
+// A subscription keeps the latest value: values that arrive between pulls
+// coalesce. An AsyncIterable streams through unchanged. Either way the source
+// opens when the result is iterated and closes on return(), on supersede (the
+// owning computation re-runs) and on owner disposal, whichever comes first.
+function toSubscribe(e) {
+    if (typeof e === "function") return e;
+    // TC39 / RxJS interop: `Symbol.observable` (or "@@observable") returns the observable.
+    // Read per call, not at module scope, so the module stays side-effect free.
+        const n = Symbol.observable;
+    const r = (n && e?.[n]) ?? e?.["@@observable"];
+    const t = typeof r === "function" ? r.call(e) : e;
+    if (t && typeof t.subscribe === "function") return (e, n, r) => t.subscribe({
+        next: e,
+        error: n,
+        complete: r
+    });
+    return null;
+}
+
+const DONE = {
+    value: undefined,
+    done: true
+};
+
+/**
+ * Ties an iterator's `finish` to the computation iterating it. Solid reaches
+ * an iterator's return() only when the compute returns the iterable directly.
+ * Inside an async generator the generator's own return() is queued behind its
+ * pending `await`, and owner cleanups wait for the replacing pass to commit,
+ * so close on supersede, with owner disposal as the backstop. No owner (an
+ * async compute iterating it after its first `await`, or plain iteration):
+ * no registration and no diagnostic, so only return() closes it. Scopes that
+ * forbid cleanups rely on supersede and return().
+ */ function bindToOwner(e) {
+    const n = getOwner();
+    if (!n) return;
+    onSupersede(e);
+    if (!(n.l & CONFIG_CHILDREN_FORBIDDEN)) cleanup(e);
+}
+
+/**
+ * An AsyncIterable as a stream bound to the iterating computation: every
+ * value passes through (no coalescing). `finish` calls the inner return()
+ * once and settles pending pulls as done, so a `for await` over it exits as
+ * soon as the computation re-runs — even when the inner iterator is an async
+ * generator whose own return() the language queues behind its pending
+ * `await`.
+ */ function wrapIterable(e) {
+    return {
+        [Symbol.asyncIterator]() {
+            const n = e[Symbol.asyncIterator]();
+            let r = false;
+            const t = new Set;
+            const finish = () => {
+                if (r) return DONE;
+                r = true;
+                for (const e of t) e(DONE);
+                t.clear();
+                try {
+                    const e = n.return?.();
+                    if (isThenable(e)) e.then(undefined, () => {});
+                } catch {}
+                return DONE;
+            };
+            bindToOwner(finish);
+            return {
+                next(...e) {
+                    if (r) return Promise.resolve(DONE);
+                    const o = n.next(...e);
+                    // A bare result (the producer's buffered fast path) passes through.
+                                        if (!isThenable(o)) return o;
+                    return new Promise((e, n) => {
+                        t.add(e);
+                        o.then(n => t.delete(e) && e(n), r => t.delete(e) && n(r));
+                    });
+                },
+                return() {
+                    return Promise.resolve(finish());
+                }
+            };
+        }
+    };
+}
+
+const toCleanup = e => typeof e === "function" ? e : e && typeof e.unsubscribe === "function" ? () => e.unsubscribe() : () => {};
+
+/**
+ * Converts a callback subscription, an Observable or an AsyncIterable into an
+ * AsyncIterable for a Solid computation. A subscription keeps only the latest
+ * value, and a value the source emits during `subscribe` is served without a
+ * loading frame; an AsyncIterable streams every value through.
+ *
+ * The source closes on supersede — the owning computation re-running — and
+ * on owner disposal. Inside an async generator memo that holds for a
+ * `for await` that starts before the first `await`; one that starts after it
+ * has no owner to bind to, so its source closes only when the loop ends.
+ * Prefer returning `from(...)` from its own memo, with awaited inputs read
+ * from upstream memos and transforms done in a downstream memo.
+ *
+ * Iterate the result with `for await` or return it from a computation: its
+ * `next()` returns an already-buffered value as a bare result, not a promise.
+ *
+ * @example
+ * ```ts
+ * const position = createMemo(() =>
+ *   from<Position>((next, error) => {
+ *     const id = navigator.geolocation.watchPosition(next, error);
+ *     return () => navigator.geolocation.clearWatch(id);
+ *   })
+ * );
+ * const ticks = createMemo(() => from(interval$(rate())));
+ * ```
+ */ function from(e) {
+    const n = toSubscribe(e);
+    if (!n) {
+        if (e && typeof e[Symbol.asyncIterator] === "function") return wrapIterable(e);
+        throw new TypeError("from(): expected a subscribe function, an Observable or an AsyncIterable");
+    }
+    return {
+        [Symbol.asyncIterator]() {
+            let e;
+            let r = false;
+            let t = false;
+            let o = false;
+            let u;
+            let f = null;
+            let l = null;
+            let s = false;
+            const close = () => {
+                if (s) return;
+                s = true;
+                t = true;
+                const e = l;
+                l = null;
+                // A throwing unsubscribe must not escape: at supersede this runs
+                // inside flush(), ahead of the replacing pass (the returned-iterator
+                // path swallows it the same way).
+                                try {
+                    e?.();
+                } catch {}
+            };
+            const settle = () => {
+                if (!f) return;
+                const n = f;
+                if (r) {
+                    f = null;
+                    r = false;
+                    n.resolve({
+                        value: e,
+                        done: false
+                    });
+                } else if (o) {
+                    f = null;
+                    o = false;
+                    n.reject(u);
+                } else if (t) {
+                    f = null;
+                    n.resolve({
+                        value: undefined,
+                        done: true
+                    });
+                }
+            };
+            const i = n(n => {
+                if (t) return;
+                e = n;
+                r = true;
+                settle();
+            }, e => {
+                if (t) return;
+                o = true;
+                u = e;
+                t = true;
+                settle();
+                close();
+            }, () => {
+                if (t) return;
+                t = true;
+                settle();
+                close();
+            });
+            l = toCleanup(i);
+            // Completed or errored during subscribe: release what it just returned.
+                        if (s) {
+                const e = l;
+                l = null;
+                try {
+                    e();
+                } catch {}
+            }
+            // Idempotent: return(), supersede and disposal may all reach it.
+                        const finish = () => {
+                close();
+                r = false;
+                if (f) {
+                    const e = f;
+                    f = null;
+                    e.resolve(DONE);
+                }
+                return DONE;
+            };
+            bindToOwner(finish);
+            return {
+                next() {
+                    // A buffered value is returned as a bare result, not a promise: the
+                    // iterator consumer lands it in the same pass, so a source that
+                    // emits during subscribe (BehaviorSubject-style) shows its value
+                    // with no loading frame. `for await` accepts either form.
+                    if (r) {
+                        r = false;
+                        return {
+                            value: e,
+                            done: false
+                        };
+                    }
+                    if (o) {
+                        o = false;
+                        return Promise.reject(u);
+                    }
+                    if (t) return Promise.resolve({
+                        value: undefined,
+                        done: true
+                    });
+                    return new Promise((e, n) => {
+                        f = {
+                            resolve: e,
+                            reject: n
+                        };
+                    });
+                },
+                return() {
+                    return Promise.resolve(finish());
+                }
+            };
+        }
+    };
+}
+
+export { from };

package/dist/prod/index.js

@@ -36,6 +36,8 @@ export { affects } from "./affects.js";
 
 export { createDeferred } from "./deferred.js";
 
+export { from } from "./from.js";
+
 export { flatten } from "./flatten.js";
 
 export { createErrorBoundary, createLoadingBoundary } from "./boundaries.js";

package/dist/prod/map.js

@@ -301,7 +301,7 @@ function updateKeyedMap() {
                 this.ct && (this.ct = []);
                 this.lt && (this.lt = []);
             }
-            if (this.H && !this.ht[0]) {
+            if (this.H && !this.ht.length) {
                 // an aborted fallback attempt leaves an owner without a mapping;
                 // dispose it before re-creating
                 this.tn[0]?.dispose();
@@ -539,7 +539,7 @@ function updateRepeat() {
                 // Reset offset to match the cleared data (#2767, repro 2).
                                 this.dt = 0;
             }
-            if (this.H && !this.ht[0]) {
+            if (this.H && !this.ht.length) {
                 // an aborted fallback attempt leaves an owner without a mapping;
                 // dispose it before re-creating
                 this.tn[0]?.dispose();

package/dist/prod/signals.js

@@ -292,7 +292,12 @@ function createMemo(e, t) {
             o = undefined;
         }
         runWithOwner(n, () => {
-            effect(() => (c(), o = getOwner()), t => {
+            effect(() => {
+                const e = getOwner();
+                o = e;
+                c();
+                return e;
+            }, t => {
                 o = undefined;
                 r?.();
                 const n = (e.effect || e)?.();
@@ -334,14 +339,14 @@ function createMemo(e, t) {
     // or an already-displayed guess would satisfy it in a later slice. (REDERIVE
     // after: the first pass's own error is the promise's rejection.)
         computed(() => {
-        let i, u = false;
+        let u, i = false;
         try {
-            i = e();
+            u = e();
         } catch (e) {
             if (e instanceof NotReadyError) throw e;
             // An error is an answer (D-41): delivered by the same frame rule.
-                        i = unwrapStatusError(e);
-            u = true;
+                        u = unwrapStatusError(e);
+            i = true;
         }
         const s = getOwner();
         // A truth reader waits out a `createDeferred` flight its value derives
@@ -354,9 +359,9 @@ function createMemo(e, t) {
             staleReader(s, resolveTx(a));
             return;
         }
-        if (u) return void queueMicrotask(() => r(i));
-        o?.(i);
-        queueMicrotask(() => t(i));
+        if (i) return void queueMicrotask(() => r(u));
+        o?.(u);
+        queueMicrotask(() => t(u));
     }, {
         Le: n
     }).l |= CONFIG_REDERIVE;
@@ -516,14 +521,14 @@ function createMemo(e, t) {
         // (`saving=true` beside the confirmed `version=1` is a tear no timeline
         // contains). Updates that do not flip the predicate reveal freely.
                 const c = flushTransaction;
-        createRoot(i => {
-            let u;
+        createRoot(u => {
+            let i;
             let s;
             const settle = e => {
-                if (u !== undefined) clearTimeout(u);
+                if (i !== undefined) clearTimeout(i);
                 if (s !== undefined) o.removeEventListener("abort", s);
                 e();
-                i();
+                u();
             };
             // Authoritative: the predicate sees the truth, never the action's own
             // optimistic guess — a guess cannot satisfy the wait for its own
@@ -538,7 +543,7 @@ function createMemo(e, t) {
                 // revealed with the action.
                 if (e && c !== null && globalQueue.q && resolveTx(c).tt !== 0) joinFuture(c);
             });
-            if (t?.timeout !== undefined) u = setTimeout(() => settle(() => n(new TimeoutError)), t.timeout);
+            if (t?.timeout !== undefined) i = setTimeout(() => settle(() => n(new TimeoutError)), t.timeout);
             if (o !== undefined) {
                 s = () => settle(() => n(o.reason));
                 o.addEventListener("abort", s, {

package/dist/prod/store/optimistic.js

@@ -1,12 +1,12 @@
-import { CONFIG_OVERRIDE, CONFIG_AUTO_DISPOSE, NOT_PENDING } from "../core/constants.js";
+import { CONFIG_OVERRIDE, CONFIG_GUESS, EFFECT_RENDER, CONFIG_CHILDREN_FORBIDDEN, NOT_PENDING, CONFIG_SLOT_NODE, CONFIG_AUTO_DISPOSE } from "../core/constants.js";
 
-import { computed, ext, untrack, read, isEqual } from "../core/core.js";
+import { computed, joinPassAt, ext, untrack, read, isEqual } from "../core/core.js";
 
 import { pendingGuessOf, optimisticWrite } from "../core/lanes.js";
 
 import { getOwner } from "../core/owner.js";
 
-import { GlobalQueue, txOf, list, insertSubs, laneDirty, notifyEpoch, schedule } from "../core/scheduler.js";
+import { GlobalQueue, txOf, insertSubs, joinFuture, resolveTx, passLane, list, laneDirty, notifyEpoch, schedule } from "../core/scheduler.js";
 
 import { runProjectionComputed } from "./projection.js";
 
@@ -93,16 +93,16 @@ function notifyOptimisticWrites(e, n) {
         // A chained draft holds the inner store's raws; a raw is the inner slot it
         // resolves to (as a read of it serves) — the row a held write staged is
         // the same row, not a guess over the slot (#3796).
-                const a = n[t];
-        const f = unwrapValue(o && a ? resolveChainedRaw(e, t, a) : a);
+                const u = n[t];
+        const f = unwrapValue(o && u ? resolveChainedRaw(e, t, u) : u);
         if (!(t in i)) {
             guess(getNode(e, t), t, false, f);
             guess(getHasNode(e, t), t, true, true);
             s = true;
         } else {
             const n = i[t];
-            const a = unwrapValue(o && n ? resolveChainedRaw(e, t, n) : n);
-            if (!isEqual(a, f) && !targetsEqual(a, f)) {
+            const u = unwrapValue(o && n ? resolveChainedRaw(e, t, n) : n);
+            if (!isEqual(u, f) && !targetsEqual(u, f)) {
                 guess(getNode(e, t), t, false, f);
                 if (r) s = true;
             }
@@ -122,29 +122,31 @@ function notifyOptimisticWrites(e, n) {
     if (s) {
         const o = r ? n.map(unwrapValue) : shallowKeys(n);
         // The rows the setter removed from the view it saw, by key: a later
-        // re-base over another action's truth must not bring them back.
+        // re-base over another action's truth must not bring them back. A set
+        // (empty or not) marks a keyed arrangement guess (`fold`).
                 let s = null;
-        const a = e.fam.key;
-        if (r && a !== null && a !== undefined) {
+        const u = e.fam.key;
+        if (r && u !== null && u !== undefined) {
+            s = new Set;
             const e = new Set;
             for (let n = 0; n < o.length; n++) {
-                const t = isWrappable(o[n]) ? a(o[n]) : undefined;
+                const t = isWrappable(o[n]) ? u(o[n]) : undefined;
                 if (t !== undefined) e.add(t);
             }
             for (let n = 0; n < i.length; n++) {
                 const t = unwrapValue(i[n]);
-                const r = isWrappable(t) ? a(t) : undefined;
-                if (r !== undefined && !e.has(r)) (s ??= new Set).add(r);
+                const r = isWrappable(t) ? u(t) : undefined;
+                if (r !== undefined && !e.has(r)) s.add(r);
             }
         }
         optimisticWrite(getContainerNode(e), new LaneView(o, t, s));
     }
     if (e.dk !== null) optimisticWrite(e.dk, {});
     markOverlaid(e);
-    const a = optStaged.get(e);
-    if (a === undefined) return null;
+    const u = optStaged.get(e);
+    if (u === undefined) return null;
     optStaged.delete(e);
-    return a;
+    return u;
 }
 
 /** The container comparator's lane arm (store.ts `containerEquals`): an
@@ -228,18 +230,18 @@ function arrangementEqual(e, n, t) {
             }
         }
         for (let s = 0; s < n.length; s++) {
-            const a = n[s];
+            const u = n[s];
             let f;
-            if (isWrappable(a)) {
+            if (isWrappable(u)) {
                 if (o !== null) {
-                    const e = t(a);
+                    const e = t(u);
                     if (e !== undefined) f = o.get(e);
                 } else if (s < i && isWrappable(unwrapValue(r[s]))) f = r[s];
             }
             if (f !== undefined) {
-                if (unwrapValue(f) !== a) reconcileDraft(f, a, t);
+                if (unwrapValue(f) !== u) reconcileDraft(f, u, t);
                 if (e[s] !== f) e[s] = f;
-            } else if (unwrapValue(e[s]) !== a) e[s] = a;
+            } else if (unwrapValue(e[s]) !== u) e[s] = u;
         }
         if (e.length !== n.length) e.length = n.length;
         return;
@@ -268,66 +270,105 @@ function arrangementEqual(e, n, t) {
  * node is born for it as the lane's derivation), on `length` only when the
  * committed length differs, and as the `LaneView`'s base for structural
  * reads. Unkeyed families compose
- * positionally — the guess stands as written (the documented residue). */ GlobalQueue.an = (e, n) => {
-    const t = e.O;
-    if (t === undefined || e.ze !== $TRACK) return;
-    const i = e.T.v;
-    if (!(i instanceof LaneView)) return;
-    if (!Array.isArray(n) || !Array.isArray(i.rows)) {
-        i.base = n;
+ * positionally — the guess stands as written (the documented residue). */ GlobalQueue.an = (e, n, t) => {
+    if (!t) return fold(e, n);
+    const i = e.O;
+    if (i === undefined || e.ze !== $TRACK) return;
+    const r = e.T.v;
+    if (!(r instanceof LaneView)) return;
+    if (!Array.isArray(n) || !Array.isArray(r.rows)) {
+        r.base = n;
         return;
     }
-    const r = t.fam?.key ?? null;
-    if (r === null) return;
-    const o = new Map;
+    const o = i.fam?.key ?? null;
+    if (o === null) return;
+    const s = new Map;
     for (let e = 0; e < n.length; e++) {
         const t = n[e];
-        const i = isWrappable(t) ? r(t) : undefined;
-        if (i !== undefined && !o.has(i)) o.set(i, t);
+        const i = isWrappable(t) ? o(t) : undefined;
+        if (i !== undefined && !s.has(i)) s.set(i, t);
     }
-    const s = new Set;
-    const a = [];
-    const f = i.rows;
-    for (let e = 0; e < f.length; e++) {
-        const n = f[e];
-        const t = isWrappable(n) ? r(n) : undefined;
-        const i = t !== undefined ? o.get(t) : undefined;
+    const u = new Set;
+    const f = [];
+    const a = r.rows;
+    for (let e = 0; e < a.length; e++) {
+        const n = a[e];
+        const t = isWrappable(n) ? o(n) : undefined;
+        const i = t !== undefined ? s.get(t) : undefined;
         if (i !== undefined) {
-            a.push(i);
-            s.add(t);
-        } else a.push(n);
+            f.push(i);
+            u.add(t);
+        } else f.push(n);
     }
-    const u = i.removed;
+    const l = r.removed;
     for (let e = 0; e < n.length; e++) {
         const t = n[e];
-        const i = isWrappable(t) ? r(t) : undefined;
-        if (i !== undefined && !s.has(i) && (u === null || !u.has(i))) a.push(t);
+        const i = isWrappable(t) ? o(t) : undefined;
+        if (i !== undefined && !u.has(i) && (l === null || !l.has(i))) f.push(t);
     }
-    i.rows = a;
-    i.base = a;
-    const l = txOf(e);
-    const c = committed(t);
-    const d = t.n;
-    for (let e = 0; e < a.length; e++) {
-        const n = d?.[e];
+    r.rows = f;
+    r.base = f;
+    const c = txOf(e);
+    const d = committed(i);
+    const p = i.n;
+    for (let e = 0; e < f.length; e++) {
+        const n = p?.[e];
         // A slot the lane does not own shows the committed row: it becomes the
         // lane's only where the composed row is another row (by key — the same
         // key's new object is the same row, its target adopted it).
                 if (n === undefined) {
-            if (!sameRow(c[e], a[e], r)) laneSet(getNode(t, e), a[e], l);
-        } else if (!sameRow(n.l & CONFIG_OVERRIDE ? n.T.v : c[e], a[e], r)) laneSet(n, a[e], l);
+            if (!sameRow(d[e], f[e], o)) laneSet(getNode(i, e), f[e], c);
+        } else if (!sameRow(n.l & CONFIG_OVERRIDE ? n.T.v : d[e], f[e], o)) laneSet(n, f[e], c);
     }
-    if (d !== null) {
-        for (let e = a.length; ;e++) {
-            const n = d[e];
+    if (p !== null) {
+        for (let e = f.length; ;e++) {
+            const n = p[e];
             if (n === undefined) break;
-            laneSet(n, undefined, l);
+            laneSet(n, undefined, c);
         }
-        const e = d.length;
-        if (e !== undefined && (e.l & CONFIG_OVERRIDE || c.length !== a.length)) laneSet(e, a.length, l);
+        const e = p.length;
+        if (e !== undefined && (e.l & CONFIG_OVERRIDE || d.length !== f.length)) laneSet(e, f.length, c);
     }
 };
 
+/** D-34 for a keyed arrangement guess: rows by key, not positions. A
+ * current truth that differs folds into the hold beneath it instead of
+ * voiding the lane: the guess stays the lane's value and the screen's until
+ * the hold commits, where rows match by key, and the graph outside the lane
+ * re-derives from the truth now (`foldedRead`). A confirmation is silent
+ * (A17): only truth readers are told. True: the lane stages the truth
+ * beneath (`laneWrite`). */ function fold(e, n) {
+    const t = e.O?.k;
+    const i = txOf(e);
+    // A guess the screen never showed is void at the correction (D-34); a
+    // keyed arrangement guess's view carries its removed-keys set.
+        if (!i.ke || !(t?.l & CONFIG_OVERRIDE) || !t.T.v?.removed) return false;
+    const r = e.T.v;
+    if ((!e.xe || !e.xe(r, n)) && !GlobalQueue.nn(r, n)) {
+        i.folded = foldedRead;
+        insertSubs(e);
+    } else GlobalQueue.sn?.(i);
+    joinFuture(resolveTx(i._parent ?? i));
+    return true;
+}
+
+/** A folded lane's guess read by a deriving pass outside the lane, tracked
+ * or not (`untrack` is about dependencies, not about which world a pass
+ * derives from), or by `latest()` (`c` null): the hold's world — the truth
+ * staged beneath the guess, else the value it covered — and the pass joins
+ * the hold. Lane passes and the screen keep the guess: held truth is masked
+ * from lane passes only (#3164). The store's own derive reconciles its
+ * landings against the arrangement the guesses made: it is the author, not
+ * a reader. */ function foldedRead(e, n) {
+    if (e !== null) {
+        if (!(n.l & CONFIG_GUESS) || passLane !== null || e.i === EFFECT_RENDER || e.l & CONFIG_CHILDREN_FORBIDDEN || n.O?.fam?.node === e) return NOT_PENDING;
+        const t = txOf(n);
+        joinPassAt(e, resolveTx(t._parent ?? t));
+    }
+    if (n.ue !== NOT_PENDING) return n.ue;
+    return n.l & CONFIG_SLOT_NODE ? GlobalQueue.fn(n) : n.Ie;
+}
+
 function sameRow(e, n, t) {
     if (e === n) return true;
     if (!isWrappable(e) || !isWrappable(n)) return false;
@@ -521,11 +562,11 @@ i = false) {
     if (s !== null) {
         for (const e of Reflect.ownKeys(s)) {
             const o = s[e];
-            let a;
-            if (o.l & CONFIG_OVERRIDE) a = t(o); else if (!i || (a = pendingGuessOf(o)) === NOT_PENDING) continue;
-            const f = !!a;
-            const u = r ?? n;
-            if (!f && e in u) delete ensure()[e];
+            let u;
+            if (o.l & CONFIG_OVERRIDE) u = t(o); else if (!i || (u = pendingGuessOf(o)) === NOT_PENDING) continue;
+            const f = !!u;
+            const a = r ?? n;
+            if (!f && e in a) delete ensure()[e];
         }
     }
     return r ?? n;
@@ -538,7 +579,7 @@ function createOptimisticStore(e, n, t) {
     // createProjectionInternal).
         const o = i ? n || {} : e;
     const s = r?.key === undefined ? "id" : r.key;
-    const a = {
+    const u = {
         map: new WeakMap,
         node: null,
         live: new Set,
@@ -546,8 +587,8 @@ function createOptimisticStore(e, n, t) {
         opt: true,
         key: typeof s === "function" ? s : s === null ? null : e => isWrappable(e) ? e[s] : undefined
     };
-    const f = wrap(o, null, null, a);
-    if (a.shallow) {
+    const f = wrap(o, null, null, u);
+    if (u.shallow) {
         f[$TARGET].s = true;
         markRawIngest(o);
     }
@@ -558,11 +599,11 @@ function createOptimisticStore(e, n, t) {
             loadingValue: undefined
         };
         const i = computed(() => {
-            if (!a.node) a.node = getOwner();
+            if (!u.node) u.node = getOwner();
             runProjectionComputed(f, n, s);
         }, t);
         i.l &= ~CONFIG_AUTO_DISPOSE;
-        a.node = i;
+        u.node = i;
     }
     return [ f, e => storeSetter(f, e) ];
 }