cursedbelt 5.87.1 → 5.90.0

package/dist/react/optimistic/revert.d.ts

@@ -0,0 +1,47 @@
+/**
+ * The rollback half of an optimistic change, DERIVED from the change itself.
+ *
+ * A caller writes only the forward edit (`rows => rows.filter(r => r.id !== id)`); this works out
+ * what that edit touched by comparing the state before and after it, and returns an inverse that
+ * undoes exactly that — applied to whatever the state is when the request fails, not to a
+ * snapshot. That difference is the whole reason this file exists:
+ *
+ *   delete A, delete B, A fails → restoring the snapshot taken before A would bring back B too
+ *   (or, taken before B, drop a rename made since). The inverse instead puts A back where it
+ *   was and leaves B gone and the rename standing.
+ *
+ * The rules, by shape (recursing through plain objects and arrays, so a patch three levels down
+ * reverts three levels down):
+ *
+ * | shape | the change | its inverse, against the current state |
+ * |---|---|---|
+ * | array of records (`id`) or primitives | item removed | put back after its nearest surviving neighbor, unless it is back already |
+ * | | item added | taken out by id |
+ * | | item changed | recurse into it by id (only fields still holding the optimistic value revert) |
+ * | | reordered | the old order back, only if the current order is still the optimistic one |
+ * | plain object | key changed / added / removed | per key, recursing |
+ * | `Set` / `Map` | member added / removed | the member out / back |
+ * | anything else | replaced | the old value back only if the current one is still the optimistic one |
+ *
+ * "Only if it still holds the optimistic value" is what lets two edits race: rename to "B", then
+ * to "C" — if the first request fails, the title is "C" by now, so it stays "C".
+ *
+ * Returns the current state UNCHANGED (same reference) when nothing needs reverting, so a React
+ * setter given the inverse does not re-render.
+ */
+/** How an array item is identified. Records by `id` (or `key`), primitives by value. */
+export type IdOf = (item: unknown) => unknown;
+export declare const defaultIdOf: IdOf;
+/**
+ * The inverse of the change `before → after`, as a function of the state at revert time.
+ * `idOf` names array items; the default reads `id`, then `key`, and uses a primitive's value.
+ */
+export declare function inverseOf<S>(before: S, after: S, idOf?: IdOf): (current: S) => S;
+/**
+ * A counter's inverse: give back the difference the change made, whatever has happened since.
+ * The whole-value rule is wrong for a count — two deletes take a total 10 → 9 → 8, and when the
+ * first fails the total is 8, not 9, so "revert only if still optimistic" would never fire. Pass
+ * it as a target's `revert`: `{ set: setTotal, apply: (n) => n - 1, revert: counterRevert }`.
+ */
+export declare const counterRevert: (current: number, before: number, after: number) => number;
+//# sourceMappingURL=revert.d.ts.map

package/dist/react/optimistic/revert.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"revert.d.ts","sourceRoot":"","sources":["../../../src/react/optimistic/revert.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA8BG;AAEH,wFAAwF;AACxF,MAAM,MAAM,IAAI,GAAG,CAAC,IAAI,EAAE,OAAO,KAAK,OAAO,CAAC;AAI9C,eAAO,MAAM,WAAW,EAAE,IAMzB,CAAC;AAQF;;;GAGG;AACH,wBAAgB,SAAS,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,IAAI,GAAE,IAAkB,GAAG,CAAC,OAAO,EAAE,CAAC,KAAK,CAAC,CAE7F;AA6KD;;;;;GAKG;AACH,eAAO,MAAM,aAAa,GAAI,SAAS,MAAM,EAAE,QAAQ,MAAM,EAAE,OAAO,MAAM,KAAG,MACnD,CAAC"}

package/dist/react/optimistic/revert.js

@@ -0,0 +1,235 @@
+/**
+ * The rollback half of an optimistic change, DERIVED from the change itself.
+ *
+ * A caller writes only the forward edit (`rows => rows.filter(r => r.id !== id)`); this works out
+ * what that edit touched by comparing the state before and after it, and returns an inverse that
+ * undoes exactly that — applied to whatever the state is when the request fails, not to a
+ * snapshot. That difference is the whole reason this file exists:
+ *
+ *   delete A, delete B, A fails → restoring the snapshot taken before A would bring back B too
+ *   (or, taken before B, drop a rename made since). The inverse instead puts A back where it
+ *   was and leaves B gone and the rename standing.
+ *
+ * The rules, by shape (recursing through plain objects and arrays, so a patch three levels down
+ * reverts three levels down):
+ *
+ * | shape | the change | its inverse, against the current state |
+ * |---|---|---|
+ * | array of records (`id`) or primitives | item removed | put back after its nearest surviving neighbor, unless it is back already |
+ * | | item added | taken out by id |
+ * | | item changed | recurse into it by id (only fields still holding the optimistic value revert) |
+ * | | reordered | the old order back, only if the current order is still the optimistic one |
+ * | plain object | key changed / added / removed | per key, recursing |
+ * | `Set` / `Map` | member added / removed | the member out / back |
+ * | anything else | replaced | the old value back only if the current one is still the optimistic one |
+ *
+ * "Only if it still holds the optimistic value" is what lets two edits race: rename to "B", then
+ * to "C" — if the first request fails, the title is "C" by now, so it stays "C".
+ *
+ * Returns the current state UNCHANGED (same reference) when nothing needs reverting, so a React
+ * setter given the inverse does not re-render.
+ */
+const NO_ID = Symbol('no-id');
+export const defaultIdOf = (item) => {
+    if (item === null || typeof item !== 'object')
+        return item;
+    const record = item;
+    if (record.id !== undefined)
+        return record.id;
+    if (record.key !== undefined)
+        return record.key;
+    return NO_ID;
+};
+const isPlainObject = (value) => {
+    if (value === null || typeof value !== 'object')
+        return false;
+    const proto = Object.getPrototypeOf(value);
+    return proto === Object.prototype || proto === null;
+};
+/**
+ * The inverse of the change `before → after`, as a function of the state at revert time.
+ * `idOf` names array items; the default reads `id`, then `key`, and uses a primitive's value.
+ */
+export function inverseOf(before, after, idOf = defaultIdOf) {
+    return (current) => revertValue(before, after, current, idOf);
+}
+function revertValue(before, after, current, idOf) {
+    if (Object.is(before, after))
+        return current;
+    if (Array.isArray(before) && Array.isArray(after) && Array.isArray(current)) {
+        const reverted = revertArray(before, after, current, idOf);
+        if (reverted !== undefined)
+            return reverted;
+    }
+    if (before instanceof Set && after instanceof Set && current instanceof Set) {
+        return revertSet(before, after, current);
+    }
+    if (before instanceof Map && after instanceof Map && current instanceof Map) {
+        return revertMap(before, after, current, idOf);
+    }
+    if (isPlainObject(before) && isPlainObject(after) && isPlainObject(current)) {
+        return revertObject(before, after, current, idOf);
+    }
+    return Object.is(current, after) ? before : current;
+}
+function revertObject(before, after, current, idOf) {
+    let out;
+    const write = (key, value, remove = false) => {
+        out ??= { ...current };
+        if (remove)
+            delete out[key];
+        else
+            out[key] = value;
+    };
+    for (const key of new Set([...Object.keys(before), ...Object.keys(after)])) {
+        const had = Object.hasOwn(before, key);
+        const has = Object.hasOwn(after, key);
+        if (had && has) {
+            if (Object.is(before[key], after[key]))
+                continue;
+            if (!Object.hasOwn(current, key))
+                continue; // removed since — not ours to bring back
+            const next = revertValue(before[key], after[key], current[key], idOf);
+            if (!Object.is(next, current[key]))
+                write(key, next);
+        }
+        else if (has) {
+            // Added by the change: take it out if it is still what the change put there.
+            if (Object.hasOwn(current, key) && Object.is(current[key], after[key]))
+                write(key, undefined, true);
+        }
+        else if (!Object.hasOwn(current, key)) {
+            write(key, before[key]); // removed by the change, and still gone
+        }
+    }
+    return out ?? current;
+}
+/** `undefined` when the items cannot be identified — the caller falls back to whole-value. */
+function revertArray(before, after, current, idOf) {
+    const ids = (list) => list.map(idOf);
+    const beforeIds = ids(before);
+    const afterIds = ids(after);
+    const unique = (list) => !list.includes(NO_ID) && new Set(list).size === list.length;
+    if (!unique(beforeIds) || !unique(afterIds))
+        return undefined;
+    const beforeById = new Map(beforeIds.map((id, i) => [id, before[i]]));
+    const afterById = new Map(afterIds.map((id, i) => [id, after[i]]));
+    let out = current;
+    let touched = false;
+    const edit = () => {
+        if (!touched) {
+            out = [...current];
+            touched = true;
+        }
+    };
+    // 1 · Items the change ADDED go, if they are still there.
+    const added = afterIds.filter((id) => !beforeById.has(id));
+    if (added.length > 0) {
+        const drop = new Set(added);
+        const kept = out.filter((item) => !drop.has(idOf(item)));
+        if (kept.length !== out.length) {
+            out = kept;
+            touched = true;
+        }
+    }
+    // 2 · Items the change CHANGED revert field by field.
+    for (const [id, was] of beforeById) {
+        const now = afterById.get(id);
+        if (now === undefined || Object.is(was, now))
+            continue;
+        const at = out.findIndex((item) => Object.is(idOf(item), id));
+        if (at < 0)
+            continue;
+        const next = revertValue(was, now, out[at], idOf);
+        if (!Object.is(next, out[at])) {
+            edit();
+            out[at] = next;
+        }
+    }
+    // 3 · Items the change REMOVED come back beside the neighbor they had.
+    const removed = beforeIds.flatMap((id, index) => (afterById.has(id) ? [] : [{ id, index }]));
+    for (const { id, index } of removed) {
+        if (out.some((item) => Object.is(idOf(item), id)))
+            continue;
+        edit();
+        let at = 0;
+        for (let i = index - 1; i >= 0; i--) {
+            const neighbor = out.findIndex((item) => Object.is(idOf(item), beforeIds[i]));
+            if (neighbor >= 0) {
+                at = neighbor + 1;
+                break;
+            }
+        }
+        out.splice(at, 0, beforeById.get(id));
+    }
+    // 4 · A REORDER: the old order back, only where the optimistic order still stands.
+    const kept = beforeIds.filter((id) => afterById.has(id));
+    const keptAfter = afterIds.filter((id) => beforeById.has(id));
+    if (kept.some((id, i) => !Object.is(id, keptAfter[i]))) {
+        const keep = new Set(kept);
+        const positions = [];
+        out.forEach((item, i) => {
+            if (keep.has(idOf(item)))
+                positions.push(i);
+        });
+        const nowOrder = positions.map((i) => idOf(out[i]));
+        if (nowOrder.length === keptAfter.length && nowOrder.every((id, i) => Object.is(id, keptAfter[i]))) {
+            const byId = new Map(positions.map((i) => [idOf(out[i]), out[i]]));
+            edit();
+            positions.forEach((slot, i) => {
+                out[slot] = byId.get(kept[i]);
+            });
+        }
+    }
+    return touched ? out : current;
+}
+function revertSet(before, after, current) {
+    let out;
+    const copy = () => {
+        out ??= new Set(current);
+        return out;
+    };
+    for (const member of after) {
+        if (!before.has(member) && current.has(member))
+            copy().delete(member);
+    }
+    for (const member of before) {
+        if (!after.has(member) && !current.has(member))
+            copy().add(member);
+    }
+    return out ?? current;
+}
+function revertMap(before, after, current, idOf) {
+    let out;
+    const copy = () => {
+        out ??= new Map(current);
+        return out;
+    };
+    for (const key of new Set([...before.keys(), ...after.keys()])) {
+        const had = before.has(key);
+        const has = after.has(key);
+        if (had && has) {
+            if (Object.is(before.get(key), after.get(key)) || !current.has(key))
+                continue;
+            const next = revertValue(before.get(key), after.get(key), current.get(key), idOf);
+            if (!Object.is(next, current.get(key)))
+                copy().set(key, next);
+        }
+        else if (has) {
+            if (current.has(key) && Object.is(current.get(key), after.get(key)))
+                copy().delete(key);
+        }
+        else if (!current.has(key)) {
+            copy().set(key, before.get(key));
+        }
+    }
+    return out ?? current;
+}
+/**
+ * A counter's inverse: give back the difference the change made, whatever has happened since.
+ * The whole-value rule is wrong for a count — two deletes take a total 10 → 9 → 8, and when the
+ * first fails the total is 8, not 9, so "revert only if still optimistic" would never fire. Pass
+ * it as a target's `revert`: `{ set: setTotal, apply: (n) => n - 1, revert: counterRevert }`.
+ */
+export const counterRevert = (current, before, after) => current + (before - after);
+//# sourceMappingURL=revert.js.map

package/dist/react/optimistic/revert.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"revert.js","sourceRoot":"","sources":["../../../src/react/optimistic/revert.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA8BG;AAKH,MAAM,KAAK,GAAG,MAAM,CAAC,OAAO,CAAC,CAAC;AAE9B,MAAM,CAAC,MAAM,WAAW,GAAS,CAAC,IAAI,EAAE,EAAE;IACxC,IAAI,IAAI,KAAK,IAAI,IAAI,OAAO,IAAI,KAAK,QAAQ;QAAE,OAAO,IAAI,CAAC;IAC3D,MAAM,MAAM,GAAG,IAAuC,CAAC;IACvD,IAAI,MAAM,CAAC,EAAE,KAAK,SAAS;QAAE,OAAO,MAAM,CAAC,EAAE,CAAC;IAC9C,IAAI,MAAM,CAAC,GAAG,KAAK,SAAS;QAAE,OAAO,MAAM,CAAC,GAAG,CAAC;IAChD,OAAO,KAAK,CAAC;AACf,CAAC,CAAC;AAEF,MAAM,aAAa,GAAG,CAAC,KAAc,EAAoC,EAAE;IACzE,IAAI,KAAK,KAAK,IAAI,IAAI,OAAO,KAAK,KAAK,QAAQ;QAAE,OAAO,KAAK,CAAC;IAC9D,MAAM,KAAK,GAAG,MAAM,CAAC,cAAc,CAAC,KAAK,CAAC,CAAC;IAC3C,OAAO,KAAK,KAAK,MAAM,CAAC,SAAS,IAAI,KAAK,KAAK,IAAI,CAAC;AACtD,CAAC,CAAC;AAEF;;;GAGG;AACH,MAAM,UAAU,SAAS,CAAI,MAAS,EAAE,KAAQ,EAAE,OAAa,WAAW;IACxE,OAAO,CAAC,OAAO,EAAE,EAAE,CAAC,WAAW,CAAC,MAAM,EAAE,KAAK,EAAE,OAAO,EAAE,IAAI,CAAM,CAAC;AACrE,CAAC;AAED,SAAS,WAAW,CAAC,MAAe,EAAE,KAAc,EAAE,OAAgB,EAAE,IAAU;IAChF,IAAI,MAAM,CAAC,EAAE,CAAC,MAAM,EAAE,KAAK,CAAC;QAAE,OAAO,OAAO,CAAC;IAC7C,IAAI,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,EAAE,CAAC;QAC5E,MAAM,QAAQ,GAAG,WAAW,CAAC,MAAM,EAAE,KAAK,EAAE,OAAO,EAAE,IAAI,CAAC,CAAC;QAC3D,IAAI,QAAQ,KAAK,SAAS;YAAE,OAAO,QAAQ,CAAC;IAC9C,CAAC;IACD,IAAI,MAAM,YAAY,GAAG,IAAI,KAAK,YAAY,GAAG,IAAI,OAAO,YAAY,GAAG,EAAE,CAAC;QAC5E,OAAO,SAAS,CAAC,MAAM,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC;IAC3C,CAAC;IACD,IAAI,MAAM,YAAY,GAAG,IAAI,KAAK,YAAY,GAAG,IAAI,OAAO,YAAY,GAAG,EAAE,CAAC;QAC5E,OAAO,SAAS,CAAC,MAAM,EAAE,KAAK,EAAE,OAAO,EAAE,IAAI,CAAC,CAAC;IACjD,CAAC;IACD,IAAI,aAAa,CAAC,MAAM,CAAC,IAAI,aAAa,CAAC,KAAK,CAAC,IAAI,aAAa,CAAC,OAAO,CAAC,EAAE,CAAC;QAC5E,OAAO,YAAY,CAAC,MAAM,EAAE,KAAK,EAAE,OAAO,EAAE,IAAI,CAAC,CAAC;IACpD,CAAC;IACD,OAAO,MAAM,CAAC,EAAE,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC;AACtD,CAAC;AAED,SAAS,YAAY,CACnB,MAA+B,EAC/B,KAA8B,EAC9B,OAAgC,EAChC,IAAU;IAEV,IAAI,GAAwC,CAAC;IAC7C,MAAM,KAAK,GAAG,CAAC,GAAW,EAAE,KAAc,EAAE,MAAM,GAAG,KAAK,EAAE,EAAE;QAC5D,GAAG,KAAK,EAAE,GAAG,OAAO,EAAE,CAAC;QACvB,IAAI,MAAM;YAAE,OAAO,GAAG,CAAC,GAAG,CAAC,CAAC;;YACvB,GAAG,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC;IACxB,CAAC,CAAC;IACF,KAAK,MAAM,GAAG,IAAI,IAAI,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,GAAG,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC;QAC3E,MAAM,GAAG,GAAG,MAAM,CAAC,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;QACvC,MAAM,GAAG,GAAG,MAAM,CAAC,MAAM,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;QACtC,IAAI,GAAG,IAAI,GAAG,EAAE,CAAC;YACf,IAAI,MAAM,CAAC,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC;gBAAE,SAAS;YACjD,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,OAAO,EAAE,GAAG,CAAC;gBAAE,SAAS,CAAC,yCAAyC;YACrF,MAAM,IAAI,GAAG,WAAW,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,KAAK,CAAC,GAAG,CAAC,EAAE,OAAO,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC,CAAC;YACtE,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,IAAI,EAAE,OAAO,CAAC,GAAG,CAAC,CAAC;gBAAE,KAAK,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;QACvD,CAAC;aAAM,IAAI,GAAG,EAAE,CAAC;YACf,6EAA6E;YAC7E,IAAI,MAAM,CAAC,MAAM,CAAC,OAAO,EAAE,GAAG,CAAC,IAAI,MAAM,CAAC,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC;gBAAE,KAAK,CAAC,GAAG,EAAE,SAAS,EAAE,IAAI,CAAC,CAAC;QACtG,CAAC;aAAM,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,OAAO,EAAE,GAAG,CAAC,EAAE,CAAC;YACxC,KAAK,CAAC,GAAG,EAAE,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,wCAAwC;QACnE,CAAC;IACH,CAAC;IACD,OAAO,GAAG,IAAI,OAAO,CAAC;AACxB,CAAC;AAED,8FAA8F;AAC9F,SAAS,WAAW,CAAC,MAAiB,EAAE,KAAgB,EAAE,OAAkB,EAAE,IAAU;IACtF,MAAM,GAAG,GAAG,CAAC,IAAe,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IAChD,MAAM,SAAS,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC;IAC9B,MAAM,QAAQ,GAAG,GAAG,CAAC,KAAK,CAAC,CAAC;IAC5B,MAAM,MAAM,GAAG,CAAC,IAAe,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,IAAI,GAAG,CAAC,IAAI,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,MAAM,CAAC;IAChG,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC;QAAE,OAAO,SAAS,CAAC;IAE9D,MAAM,UAAU,GAAG,IAAI,GAAG,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACtE,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACnE,IAAI,GAAG,GAAG,OAAO,CAAC;IAClB,IAAI,OAAO,GAAG,KAAK,CAAC;IACpB,MAAM,IAAI,GAAG,GAAG,EAAE;QAChB,IAAI,CAAC,OAAO,EAAE,CAAC;YACb,GAAG,GAAG,CAAC,GAAG,OAAO,CAAC,CAAC;YACnB,OAAO,GAAG,IAAI,CAAC;QACjB,CAAC;IACH,CAAC,CAAC;IAEF,0DAA0D;IAC1D,MAAM,KAAK,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;IAC3D,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACrB,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,CAAC;QAC5B,MAAM,IAAI,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACzD,IAAI,IAAI,CAAC,MAAM,KAAK,GAAG,CAAC,MAAM,EAAE,CAAC;YAC/B,GAAG,GAAG,IAAI,CAAC;YACX,OAAO,GAAG,IAAI,CAAC;QACjB,CAAC;IACH,CAAC;IAED,sDAAsD;IACtD,KAAK,MAAM,CAAC,EAAE,EAAE,GAAG,CAAC,IAAI,UAAU,EAAE,CAAC;QACnC,MAAM,GAAG,GAAG,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAC9B,IAAI,GAAG,KAAK,SAAS,IAAI,MAAM,CAAC,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC;YAAE,SAAS;QACvD,MAAM,EAAE,GAAG,GAAG,CAAC,SAAS,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,MAAM,CAAC,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;QAC9D,IAAI,EAAE,GAAG,CAAC;YAAE,SAAS;QACrB,MAAM,IAAI,GAAG,WAAW,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC;QAClD,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,IAAI,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC;YAC9B,IAAI,EAAE,CAAC;YACP,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC;QACjB,CAAC;IACH,CAAC;IAED,uEAAuE;IACvE,MAAM,OAAO,GAAG,SAAS,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,KAAK,EAAE,EAAE,CAAC,CAAC,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC;IAC7F,KAAK,MAAM,EAAE,EAAE,EAAE,KAAK,EAAE,IAAI,OAAO,EAAE,CAAC;QACpC,IAAI,GAAG,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,MAAM,CAAC,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC;YAAE,SAAS;QAC5D,IAAI,EAAE,CAAC;QACP,IAAI,EAAE,GAAG,CAAC,CAAC;QACX,KAAK,IAAI,CAAC,GAAG,KAAK,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YACpC,MAAM,QAAQ,GAAG,GAAG,CAAC,SAAS,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,MAAM,CAAC,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAC9E,IAAI,QAAQ,IAAI,CAAC,EAAE,CAAC;gBAClB,EAAE,GAAG,QAAQ,GAAG,CAAC,CAAC;gBAClB,MAAM;YACR,CAAC;QACH,CAAC;QACD,GAAG,CAAC,MAAM,CAAC,EAAE,EAAE,CAAC,EAAE,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;IACxC,CAAC;IAED,mFAAmF;IACnF,MAAM,IAAI,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;IACzD,MAAM,SAAS,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;IAC9D,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,EAAE,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;QACvD,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,CAAC;QAC3B,MAAM,SAAS,GAAa,EAAE,CAAC;QAC/B,GAAG,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE;YACtB,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBAAE,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC9C,CAAC,CAAC,CAAC;QACH,MAAM,QAAQ,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACpD,IAAI,QAAQ,CAAC,MAAM,KAAK,SAAS,CAAC,MAAM,IAAI,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,EAAE,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;YACnG,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YACnE,IAAI,EAAE,CAAC;YACP,SAAS,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE;gBAC5B,GAAG,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;YAChC,CAAC,CAAC,CAAC;QACL,CAAC;IACH,CAAC;IAED,OAAO,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,OAAO,CAAC;AACjC,CAAC;AAED,SAAS,SAAS,CAAC,MAAoB,EAAE,KAAmB,EAAE,OAAqB;IACjF,IAAI,GAA6B,CAAC;IAClC,MAAM,IAAI,GAAG,GAAG,EAAE;QAChB,GAAG,KAAK,IAAI,GAAG,CAAC,OAAO,CAAC,CAAC;QACzB,OAAO,GAAG,CAAC;IACb,CAAC,CAAC;IACF,KAAK,MAAM,MAAM,IAAI,KAAK,EAAE,CAAC;QAC3B,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC;YAAE,IAAI,EAAE,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;IACxE,CAAC;IACD,KAAK,MAAM,MAAM,IAAI,MAAM,EAAE,CAAC;QAC5B,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC;YAAE,IAAI,EAAE,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;IACrE,CAAC;IACD,OAAO,GAAG,IAAI,OAAO,CAAC;AACxB,CAAC;AAED,SAAS,SAAS,CAChB,MAA6B,EAC7B,KAA4B,EAC5B,OAA8B,EAC9B,IAAU;IAEV,IAAI,GAAsC,CAAC;IAC3C,MAAM,IAAI,GAAG,GAAG,EAAE;QAChB,GAAG,KAAK,IAAI,GAAG,CAAC,OAAO,CAAC,CAAC;QACzB,OAAO,GAAG,CAAC;IACb,CAAC,CAAC;IACF,KAAK,MAAM,GAAG,IAAI,IAAI,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,IAAI,EAAE,EAAE,GAAG,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC;QAC/D,MAAM,GAAG,GAAG,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAC5B,MAAM,GAAG,GAAG,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAC3B,IAAI,GAAG,IAAI,GAAG,EAAE,CAAC;YACf,IAAI,MAAM,CAAC,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC;gBAAE,SAAS;YAC9E,MAAM,IAAI,GAAG,WAAW,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC,CAAC;YAClF,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,IAAI,EAAE,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;gBAAE,IAAI,EAAE,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;QAChE,CAAC;aAAM,IAAI,GAAG,EAAE,CAAC;YACf,IAAI,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,MAAM,CAAC,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;gBAAE,IAAI,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QAC1F,CAAC;aAAM,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;YAC7B,IAAI,EAAE,CAAC,GAAG,CAAC,GAAG,EAAE,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;QACnC,CAAC;IACH,CAAC;IACD,OAAO,GAAG,IAAI,OAAO,CAAC;AACxB,CAAC;AAED;;;;;GAKG;AACH,MAAM,CAAC,MAAM,aAAa,GAAG,CAAC,OAAe,EAAE,MAAc,EAAE,KAAa,EAAU,EAAE,CACtF,OAAO,GAAG,CAAC,MAAM,GAAG,KAAK,CAAC,CAAC"}

package/package.json

@@ -1,6 +1,6 @@
 {
 	"name": "cursedbelt",
-	"version": "5.87.1",
+	"version": "5.90.0",
 	"license": "ISC",
 	"type": "module",
 	"description": "The React design system of the cursedbelt split — components, styles, theme. cursedbelt-core below it; server tier in cursedbelt-server.",

package/scripts/styleAreas.ts

@@ -122,11 +122,14 @@ export const AREAS: readonly Area[] = [
 			'authSignal.ts',
 			'sessionAuth.ts',
 			'createApiHooks.ts',
+			// Draws nothing; `createApiHooks` imports it, and every app's changes go through it (STA-10).
+			'optimistic',
 			'usePagedList.ts',
 			'lazy',
 			'confirm.tsx',
 			'prompt.tsx',
 			'Toast.tsx',
+			'LazyToaster.tsx',
 			'colorScheme',
 			// The look store and its picker: the sibling of colorScheme, installed at boot beside it.
 			'look',

package/src/react/LazyToaster.spec.tsx

@@ -0,0 +1,18 @@
+import { describe, expect, test } from 'bun:test';
+import { act, render } from '@testing-library/react';
+import { LazyToaster } from './LazyToaster.js';
+import { toast } from './Toast.js';
+
+describe('LazyToaster', () => {
+  test('mounts the stack once its chunk lands, and a toast shows in it', async () => {
+    const { container } = render(<LazyToaster />);
+    await act(async () => {
+      await new Promise((resolve) => setTimeout(resolve, 20));
+    });
+    await act(async () => {
+      toast('Saved');
+      await new Promise((resolve) => setTimeout(resolve, 20));
+    });
+    expect(container.ownerDocument.body.textContent).toContain('Saved');
+  });
+});

package/src/react/LazyToaster.tsx

@@ -0,0 +1,26 @@
+/**
+ * `<LazyToaster />` — the toast stack, mounted without putting sonner on the entry chunk.
+ *
+ * Rollup colors a module into the chunk of its static importers, so an app that mounts `Toaster`
+ * from its root pays for the whole stack (~15 kB gzip, measured in family, forge task 2900) on
+ * first paint, however lazily its toasts are CALLED (`Button`, `optimistic()`). family solved it
+ * by hand with a lazy wrapper of its own; flix, roms and station mounted `Toaster` statically the
+ * day they first needed a toast (forge task 3583) and their entries grew by it. This is that
+ * wrapper, once: the stack's chunk loads after first paint, and a toast raised before it lands
+ * waits for it (sonner queues calls made before its Toaster mounts).
+ *
+ * Takes `Toaster`'s props. Mount it once, at the app's root, in place of `Toaster`.
+ */
+import { Suspense } from 'react';
+import { lazyWithReload } from './lazy/staleChunk.js';
+import type { ToasterProps } from './Toast.js';
+
+const Stack = lazyWithReload(() => import('./Toast.js').then((m) => ({ default: m.Toaster })));
+
+export function LazyToaster(props: ToasterProps) {
+  return (
+    <Suspense fallback={null}>
+      <Stack {...props} />
+    </Suspense>
+  );
+}

package/src/react/components/sharing/ShareEditor.spec.tsx

@@ -20,6 +20,21 @@ const groupGrant: ShareGrantRow = {
 };
 
 describe('ShareEditor', () => {
+  test('the picker placeholder and the list heading can name what this editor is for', () => {
+    const { getByPlaceholderText, getByText, queryByText } = render(
+      <ShareEditor
+        resource={RESOURCE}
+        loadRecipients={loadRecipients}
+        onAdd={() => {}}
+        placeholder='Add a group…'
+        listLabel='Groups with access'
+      />,
+    );
+    expect(getByPlaceholderText('Add a group…')).toBeTruthy();
+    expect(getByText('Groups with access')).toBeTruthy();
+    expect(queryByText('Shared with')).toBeNull();
+  });
+
   test('a person known only by email is named by the address, once — not "Someone" above it', () => {
     const { getAllByText, queryByText } = render(
       <ShareEditor

package/src/react/components/sharing/ShareEditor.tsx

@@ -35,6 +35,10 @@ export interface ShareEditorProps {
   /** Revoke a grant (a confirm step fires first). */
   onRevoke?: (grantId: string) => void;
   emptyMessage?: string;
+  /** The picker's placeholder — name what it adds ("Add a group…"). Default `'Add people or groups…'`. */
+  placeholder?: string;
+  /** The heading over the current grants. Default `'Shared with'`. */
+  listLabel?: string;
   className?: string;
 }
 
@@ -152,6 +156,8 @@ export function ShareEditor({
   onChangeLevel,
   onRevoke,
   emptyMessage = 'Not shared with anyone yet.',
+  placeholder,
+  listLabel = 'Shared with',
   className,
   // Named so it stays off the root `<div>`: the handlers already carry the resource.
   resource: _resource,
@@ -166,10 +172,15 @@ export function ShareEditor({
 
   return (
     <div {...rest} className={cn('space-y-4', className)}>
-      <RecipientPicker loadRecipients={loadRecipients} onPick={onAdd} excludeIds={excludeIds} />
+      <RecipientPicker
+        loadRecipients={loadRecipients}
+        onPick={onAdd}
+        excludeIds={excludeIds}
+        {...(placeholder ? { placeholder } : {})}
+      />
 
       <div>
-        <p className='mb-1 text-xs font-semibold text-muted-foreground'>Shared with</p>
+        <p className='mb-1 text-xs font-semibold text-muted-foreground'>{listLabel}</p>
         {isLoading ? (
           <div className='flex justify-center py-4'>
             <Spinner />

package/src/react/createApiHooks.spec.tsx

@@ -0,0 +1,77 @@
+import { afterEach, beforeEach, describe, expect, type Mock, spyOn, test } from 'bun:test';
+import { QueryClient, QueryClientProvider } from '@tanstack/react-query';
+import { act, renderHook } from '@testing-library/react';
+import type { ReactNode } from 'react';
+import { createApiHooks, OptimisticFailure } from './createApiHooks.js';
+import { toast } from './Toast.js';
+
+type Rom = { id: string; favorite: boolean };
+
+let toastError: Mock<typeof toast.error>;
+beforeEach(() => {
+  toastError = spyOn(toast, 'error').mockImplementation(() => 0);
+});
+afterEach(() => toastError.mockRestore());
+
+const setup = (request: (rom: Rom) => Promise<void>) => {
+  const queryClient = new QueryClient({ defaultOptions: { queries: { retry: false } } });
+  queryClient.setQueryData<Rom[]>(['roms'], [{ id: 'r1', favorite: false }]);
+  const appToaster = { success: () => undefined, error: () => undefined };
+  const errorSpy = spyOn(appToaster, 'error');
+  const { useApiMutation } = createApiHooks({ useClient: () => null, useToaster: () => appToaster });
+  const wrapper = ({ children }: { children: ReactNode }) => (
+    <QueryClientProvider client={queryClient}>{children}</QueryClientProvider>
+  );
+  const { result } = renderHook(
+    () =>
+      useApiMutation<Rom, void>({
+        mutationFn: (_client, rom) => request(rom),
+        optimistic: {
+          label: (rom) => `favorite ${rom.id}`,
+          edits: (rom) => [
+            {
+              queryKey: ['roms'],
+              apply: (roms: Rom[]) => roms.map((r) => (r.id === rom.id ? { ...r, favorite: !r.favorite } : r)),
+            },
+          ],
+        },
+      }),
+    { wrapper },
+  );
+  return { queryClient, result, errorSpy };
+};
+
+describe('useApiMutation — optimistic', () => {
+  test('the cache changes before the request settles', async () => {
+    let finish!: () => void;
+    const { queryClient, result } = setup(() => new Promise<void>((resolve) => (finish = resolve)));
+    let done!: Promise<void>;
+    act(() => {
+      done = result.current.mutateAsync({ id: 'r1', favorite: false });
+    });
+    await act(async () => {
+      await Promise.resolve();
+      await Promise.resolve();
+    });
+    expect(queryClient.getQueryData<Rom[]>(['roms'])?.[0]?.favorite).toBe(true);
+    await act(async () => {
+      finish();
+      await done;
+    });
+  });
+
+  test('a refusal reverts the cache, shows ONE Retry toast, and rejects with the cause', async () => {
+    const { queryClient, result, errorSpy } = setup(() => Promise.reject(new Error('nope')));
+    let caught: unknown;
+    await act(async () => {
+      await result.current.mutateAsync({ id: 'r1', favorite: false }).catch((e: unknown) => {
+        caught = e;
+      });
+    });
+    expect(queryClient.getQueryData<Rom[]>(['roms'])?.[0]?.favorite).toBe(false);
+    expect(caught).toBeInstanceOf(OptimisticFailure);
+    expect((caught as Error).cause).toBeInstanceOf(Error);
+    expect(toastError).toHaveBeenCalledTimes(1);
+    expect(errorSpy).not.toHaveBeenCalled();
+  });
+});

package/src/react/createApiHooks.ts

@@ -6,6 +6,8 @@ import {
   useQueryClient,
 } from '@tanstack/react-query';
 import type { ReactNode } from 'react';
+import { type OptimisticQueryClient, optimistic as runOptimistic, queryTarget } from './optimistic/optimistic.js';
+import type { IdOf } from './optimistic/revert.js';
 
 // IMPORTANT: this factory's PUBLIC surface is deliberately free of @tanstack's
 // class-shaped types (UseQueryResult/UseQueryOptions/QueryClient). Those carry
@@ -121,6 +123,32 @@ export interface ApiMutationConfig<Client, TArgs, TData> {
   onSuccess?: (data: TData, args: TArgs) => void;
   /** Extra error handling, in addition to the automatic error toast. */
   onError?: (error: unknown, args: TArgs) => void;
+  /**
+   * Show the change before the server answers (STA-10). Each edit is a cache entry and the
+   * forward change to its data; the rollback is derived, and a refusal reverts only what this
+   * call touched and toasts "Couldn't <label>" with Retry — in place of the plain error toast.
+   * Every edited key is refetched once the request settles.
+   *
+   *   optimistic: {
+   *     label: (rom) => `favorite “${rom.title}”`,
+   *     edits: (rom) => [{ queryKey: ['roms'], apply: (roms: Rom[]) => roms.map(...) }],
+   *   }
+   */
+  optimistic?: ApiOptimistic<TArgs>;
+}
+
+export interface ApiOptimistic<TArgs> {
+  /** The verb phrase the failure toast completes: "Couldn't " + label. */
+  label: string | ((args: TArgs) => string);
+  /** The cache entries to change at once, each with its forward edit. */
+  edits: (args: TArgs) => ReadonlyArray<{
+    queryKey: QueryKey;
+    apply: (data: any) => any;
+    /** How the entry's array items are told apart when they carry neither `id` nor `key`. */
+    idOf?: IdOf;
+  }>;
+  /** Serialize requests that share a key — e.g. the record's id. */
+  key?: (args: TArgs) => string;
 }
 
 export interface ApiHooks<Client> {
@@ -130,6 +158,14 @@ export interface ApiHooks<Client> {
   ) => ApiMutationResult<TArgs, TData>;
 }
 
+/** The rejection an optimistic mutation's `mutateAsync` gives: the server's own error is `cause`. */
+export class OptimisticFailure extends Error {
+  constructor(cause: unknown) {
+    super(cause instanceof Error ? cause.message : String(cause), { cause });
+    this.name = 'OptimisticFailure';
+  }
+}
+
 /**
  * Build a pair of TanStack-Query hooks bound to your app's request client + toaster.
  * Standardizes the data-fetching boilerplate every app reinvents: apply a fallback
@@ -182,12 +218,28 @@ export const createApiHooks = <Client>({
     invalidate,
     onSuccess,
     onError,
+    optimistic,
   }: ApiMutationConfig<Client, TArgs, TData>): ApiMutationResult<TArgs, TData> => {
     const client = useClient();
     const queryClient = useQueryClient();
     const toaster = useToaster?.();
     return useMutation<TData, unknown, TArgs>({
-      mutationFn: (args) => mutationFn(client, args),
+      mutationFn: optimistic
+        ? async (args) => {
+            const outcome = await runOptimistic({
+              label: typeof optimistic.label === 'function' ? optimistic.label(args) : optimistic.label,
+              key: optimistic.key?.(args),
+              targets: optimistic.edits(args).map(({ queryKey, apply, idOf }) => ({
+                ...queryTarget(queryClient as unknown as OptimisticQueryClient, queryKey),
+                apply,
+                ...(idOf ? { idOf } : {}),
+              })),
+              request: () => mutationFn(client, args),
+            });
+            if (!outcome.ok) throw new OptimisticFailure(outcome.error);
+            return outcome.value;
+          }
+        : (args) => mutationFn(client, args),
       onSuccess: (data, args) => {
         if (successToast && toaster) {
           toaster.success(
@@ -201,6 +253,11 @@ export const createApiHooks = <Client>({
         onSuccess?.(data, args);
       },
       onError: (error, args) => {
+        // An optimistic call has already reverted and shown its own Retry toast.
+        if (error instanceof OptimisticFailure) {
+          onError?.(error.cause, args);
+          return;
+        }
         toaster?.error(error);
         onError?.(error, args);
       },

package/src/react/icons.tsx

@@ -603,6 +603,13 @@ export const IconCode = handDrawnIcon(() => <><path d="m9 8-5 4 5 4" /><path d="
  */
 export const IconSplitRow = handDrawnIcon(() => <><rect x="3" y="4" width="18" height="16" rx="2" /><path d="M12 4v16" /></>);
 export const IconSplitColumn = handDrawnIcon(() => <><rect x="3" y="4" width="18" height="16" rx="2" /><path d="M3 12h18" /></>);
+/**
+ * A spreadsheet's Merge Cells and Unmerge Cells (forge task 3569), Lucide's `table-cells-merge`
+ * and `table-cells-split`: a three-row table whose middle row has lost its divider, and one whose
+ * middle row has it back.
+ */
+export const IconMergeCells = handDrawnIcon(() => <><rect x="3" y="3" width="18" height="18" rx="2" /><path d="M3 9h18" /><path d="M3 15h18" /><path d="M12 3v6" /><path d="M12 15v6" /></>);
+export const IconUnmergeCells = handDrawnIcon(() => <><rect x="3" y="3" width="18" height="18" rx="2" /><path d="M3 9h18" /><path d="M3 15h18" /><path d="M12 9v6" /></>);
 /** A pane closing: the frame, with the corner taken out of it. */
 export const IconPaneClose = handDrawnIcon(() => <><rect x="3" y="4" width="18" height="16" rx="2" /><path d="m9.5 10.5 5 5" /><path d="m14.5 10.5-5 5" /></>);
 /**

package/src/react/index.ts

@@ -757,6 +757,7 @@ export { Wizard } from './components/Wizard/Wizard.js';
 export * from './confirm.js';
 export { VIEWPORT_META } from './constants/viewport.js';
 export * from './createApiHooks.js';
+export * from './optimistic/index.js';
 export {
   EmojiAutocomplete,
   type EmojiAutocompleteProps,
@@ -960,6 +961,7 @@ export * from './nav/index.js';
 export * from './palette/index.js';
 export * from './prompt.js';
 export { sessionAuthHeaders } from './sessionAuth.js';
+export { LazyToaster } from './LazyToaster.js';
 export { Toaster, type ToasterProps, toast } from './Toast.js';
 export { TestReportViewer, type TestReportViewerProps } from './testReport/index.js';
 export { UiScaleControl, type UiScaleControlProps } from './uiScale/UiScaleControl.js';