@playfast/reform 0.0.7 → 0.0.8

package/dist/internal/queryDriver.js

@@ -1,134 +0,0 @@
-import { Brand, Cause, Chunk, Effect, MutableRef, Option, Queue, Schema, Stream, } from 'effect';
-import { AsyncData } from '../calc/asyncData';
-import { reuse } from './reuse';
-import { resolveScheduler } from './scheduler';
-import { sameKey, wireSources, } from './sources';
-import { makeStore } from './store';
-import {} from '../state/token';
-/** The runtime gated flag for an `alwaysOn` config, typed as its `Gated` literal. */
-export const gatedFlag = (alwaysOn) => (alwaysOn !== true);
-export const Revision = Brand.nominal();
-export const RevisionSchema = Schema.Number.pipe(Schema.brand('reform/Revision'));
-export const revisionZero = Revision(0);
-export const bumpRevision = (r) => Revision(r + 1);
-/**
- * Build the driver: store + subscription + request queue + run fiber, all owned
- * by the ambient scope (callers run this under `Layer.scoped`). A change to an
- * input re-runs the query latest-wins (a new run cancels the in-flight one; or,
- * with `coalesce: 'trailing'`, lets it finish and runs one trailing refetch);
- * while a re-run is in flight the last `Success`/`Error` is kept with
- * `refetching: true`.
- */
-export const makeQueryDriver = (options) => Effect.gen(function* () {
-    const scheduler = yield* resolveScheduler;
-    const sources = yield* wireSources(options.inputs, options.invalidateBy);
-    const extraKey = options.extraKey;
-    const keyOf = (args) => extraKey === undefined ? sources.keyOf(args) : [...sources.keyOf(args), extraKey.read()];
-    const subscribeAll = (listener) => {
-        const offSources = sources.subscribe(listener);
-        const offExtra = extraKey?.subscribe(listener);
-        return () => {
-            offSources();
-            offExtra?.();
-        };
-    };
-    const disabledNow = (args = sources.snapshot()) => options.gated && options.disabled !== undefined ? options.disabled(args) : false;
-    const store = makeStore(disabledNow() ? AsyncData.idle : AsyncData.loading, scheduler);
-    // The last requested key, so a change that doesn't move it (or only churns
-    // an input `invalidateBy` ignores) doesn't re-fetch.
-    const lastKey = MutableRef.make(undefined);
-    // The run-generation counter: bumped when a run is REQUESTED (enqueued), so
-    // `requested()` names the newest run that could possibly be in flight.
-    const generation = MutableRef.make(0);
-    const nextGeneration = () => {
-        MutableRef.update(generation, (n) => n + 1);
-        return MutableRef.get(generation);
-    };
-    // Mark a re-fetch in flight without dropping the visible value (SWR).
-    const markRefetching = () => {
-        const prev = store.get();
-        if (prev._tag === 'Success')
-            store.set(AsyncData.success(prev.value, true));
-        else if (prev._tag === 'Error')
-            store.set(AsyncData.error(prev.error, true));
-        else
-            store.set(AsyncData.loading);
-    };
-    // One run of the query, folded into the store. A failure becomes `Error`; an
-    // interrupt (latest-wins cancel) leaves the state untouched; a defect (a bug
-    // in the body) is logged and isolated — the driver keeps running. A `Success`
-    // additionally reports its generation through `onSettled`, after the write,
-    // so settle-driven consequences observe the converged value.
-    const runQuery = (request) => options.query(request.args).pipe(Effect.tapDefect((defect) => Effect.logError(`reform: ${options.label} '${options.name}' query defect`, defect)), Effect.matchCause({
-        onSuccess: (value) => {
-            if (!disabledNow()) {
-                // `reuse`: share unchanged subtrees with the previous Success
-                // value, so a refetch that barely moved keeps identities stable.
-                const prev = store.get();
-                const shared = options.reuse === true && prev._tag === 'Success'
-                    ? reuse(prev.value, value)
-                    : value;
-                store.set(AsyncData.success(shared, false));
-                options.onSettled?.(request.generation);
-            }
-        },
-        onFailure: (cause) => {
-            const failure = Cause.failureOption(cause);
-            if (Option.isSome(failure) && !disabledNow()) {
-                store.set(AsyncData.error(failure.value, false));
-            }
-        },
-    }));
-    // The driver. `'switch'` (default): each new request cancels the in-flight
-    // run — the same latest-wins semantics a `latest` channel gives procedures.
-    // `'trailing'`: a strictly sequential consumer that, on wake, drains every
-    // request that piled up during the flight and runs the LATEST one —
-    // "exactly one trailing run after settle" by construction. The trailing
-    // run's generation is the max drained (the latest request's), so it
-    // vouches for every request it conflated.
-    const trailing = options.coalesce === 'trailing';
-    const requests = yield* Queue.unbounded();
-    yield* Effect.forkScoped(trailing
-        ? Effect.forever(Effect.gen(function* () {
-            const first = yield* Queue.take(requests);
-            const queued = yield* Queue.takeAll(requests);
-            const request = Option.getOrElse(Chunk.last(queued), () => first);
-            // A disable that landed while the request waited: skip the run.
-            if (!disabledNow())
-                yield* runQuery(request);
-            // The settle may have written a stale-key result with
-            // `refetching: false`; if a newer request is already waiting,
-            // restore the syncing flag before the next take — both writes
-            // coalesce into one scheduler flush for subscribers.
-            const pending = yield* Queue.size(requests);
-            if (pending > 0 && !disabledNow())
-                yield* Effect.sync(markRefetching);
-        }))
-        : Stream.fromQueue(requests).pipe(Stream.flatMap((request) => Stream.fromEffect(runQuery(request)), { switch: true }), Stream.runDrain));
-    const trigger = () => {
-        const args = sources.snapshot();
-        if (disabledNow(args)) {
-            // Switched off: show Idle and forget the key so re-enabling always re-runs.
-            MutableRef.set(lastKey, undefined);
-            store.set(AsyncData.idle);
-            return;
-        }
-        const key = keyOf(args);
-        const previous = MutableRef.get(lastKey);
-        if (previous !== undefined && sameKey(key, previous))
-            return;
-        MutableRef.set(lastKey, key);
-        markRefetching();
-        Queue.unsafeOffer(requests, { args, generation: nextGeneration() });
-    };
-    const unsubscribe = subscribeAll(trigger);
-    yield* Effect.addFinalizer(() => Effect.sync(unsubscribe));
-    // Kick off the first fetch unless the query starts disabled.
-    const initial = sources.snapshot();
-    if (!disabledNow(initial)) {
-        MutableRef.set(lastKey, keyOf(initial));
-        Queue.unsafeOffer(requests, { args: initial, generation: nextGeneration() });
-    }
-    return { store, requested: () => MutableRef.get(generation) };
-});
-//# sourceMappingURL=queryDriver.js.map

package/dist/internal/queryDriver.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"queryDriver.js","sourceRoot":"","sources":["../../src/internal/queryDriver.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,KAAK,EACL,KAAK,EACL,KAAK,EACL,MAAM,EACN,UAAU,EACV,MAAM,EACN,KAAK,EACL,MAAM,EAEN,MAAM,GACP,MAAM,QAAQ,CAAA;AACf,OAAO,EAAqB,SAAS,EAAE,MAAM,mBAAmB,CAAA;AAChE,OAAO,EAAE,KAAK,EAAE,MAAM,SAAS,CAAA;AAC/B,OAAO,EAAE,gBAAgB,EAAE,MAAM,aAAa,CAAA;AAC9C,OAAO,EAIL,OAAO,EACP,WAAW,GACZ,MAAM,WAAW,CAAA;AAClB,OAAO,EAAE,SAAS,EAAc,MAAM,SAAS,CAAA;AAC/C,OAAO,EAAkB,MAAM,gBAAgB,CAAA;AAW/C,qFAAqF;AACrF,MAAM,CAAC,MAAM,SAAS,GAAG,CAA2B,QAA8B,EAAqB,EAAE,CACvG,CAAC,QAAQ,KAAK,IAAI,CAAsB,CAAA;AAU1C,MAAM,CAAC,MAAM,QAAQ,GAAsC,KAAK,CAAC,OAAO,EAAY,CAAA;AACpF,MAAM,CAAC,MAAM,cAAc,GAAoC,MAAM,CAAC,MAAM,CAAC,IAAI,CAC/E,MAAM,CAAC,KAAK,CAAC,iBAAiB,CAAC,CAChC,CAAA;AACD,MAAM,CAAC,MAAM,YAAY,GAAa,QAAQ,CAAC,CAAC,CAAC,CAAA;AACjD,MAAM,CAAC,MAAM,YAAY,GAAG,CAAC,CAAW,EAAY,EAAE,CAAC,QAAQ,CAAC,CAAC,GAAG,CAAC,CAAC,CAAA;AA+CtE;;;;;;;GAOG;AACH,MAAM,CAAC,MAAM,eAAe,GAAG,CAC7B,OAA4C,EACoC,EAAE,CAClF,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC;IAClB,MAAM,SAAS,GAAG,KAAK,CAAC,CAAC,gBAAgB,CAAA;IACzC,MAAM,OAAO,GAAG,KAAK,CAAC,CAAC,WAAW,CAAC,OAAO,CAAC,MAAM,EAAE,OAAO,CAAC,YAAY,CAAC,CAAA;IACxE,MAAM,QAAQ,GAAG,OAAO,CAAC,QAAQ,CAAA;IAEjC,MAAM,KAAK,GAAG,CAAC,IAA0B,EAA0B,EAAE,CACnE,QAAQ,KAAK,SAAS,CAAC,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,QAAQ,CAAC,IAAI,EAAE,CAAC,CAAA;IAC1F,MAAM,YAAY,GAAG,CAAC,QAAoB,EAAgB,EAAE;QAC1D,MAAM,UAAU,GAAG,OAAO,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAA;QAC9C,MAAM,QAAQ,GAAG,QAAQ,EAAE,SAAS,CAAC,QAAQ,CAAC,CAAA;QAC9C,OAAO,GAAG,EAAE;YACV,UAAU,EAAE,CAAA;YACZ,QAAQ,EAAE,EAAE,CAAA;QACd,CAAC,CAAA;IACH,CAAC,CAAA;IACD,MAAM,WAAW,GAAG,CAAC,OAA6B,OAAO,CAAC,QAAQ,EAAE,EAAW,EAAE,CAC/E,OAAO,CAAC,KAAK,IAAI,OAAO,CAAC,QAAQ,KAAK,SAAS,CAAC,CAAC,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,CAAA;IAElF,MAAM,KAAK,GAAG,SAAS,CACrB,WAAW,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,OAAO,EAClD,SAAS,CACV,CAAA;IACD,2EAA2E;IAC3E,qDAAqD;IACrD,MAAM,OAAO,GAAG,UAAU,CAAC,IAAI,CAAqC,SAAS,CAAC,CAAA;IAC9E,4EAA4E;IAC5E,uEAAuE;IACvE,MAAM,UAAU,GAAG,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;IACrC,MAAM,cAAc,GAAG,GAAW,EAAE;QAClC,UAAU,CAAC,MAAM,CAAC,UAAU,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAA;QAC3C,OAAO,UAAU,CAAC,GAAG,CAAC,UAAU,CAAC,CAAA;IACnC,CAAC,CAAA;IAED,sEAAsE;IACtE,MAAM,cAAc,GAAG,GAAG,EAAE;QAC1B,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,EAAE,CAAA;QACxB,IAAI,IAAI,CAAC,IAAI,KAAK,SAAS;YAAE,KAAK,CAAC,GAAG,CAAC,SAAS,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC,CAAA;aACtE,IAAI,IAAI,CAAC,IAAI,KAAK,OAAO;YAAE,KAAK,CAAC,GAAG,CAAC,SAAS,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC,CAAA;;YACvE,KAAK,CAAC,GAAG,CAAC,SAAS,CAAC,OAAO,CAAC,CAAA;IACnC,CAAC,CAAA;IAED,6EAA6E;IAC7E,6EAA6E;IAC7E,8EAA8E;IAC9E,4EAA4E;IAC5E,6DAA6D;IAC7D,MAAM,QAAQ,GAAG,CAAC,OAAgB,EAAiC,EAAE,CACnE,OAAO,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,IAAI,CAC9B,MAAM,CAAC,SAAS,CAAC,CAAC,MAAM,EAAE,EAAE,CAC1B,MAAM,CAAC,QAAQ,CAAC,WAAW,OAAO,CAAC,KAAK,KAAK,OAAO,CAAC,IAAI,gBAAgB,EAAE,MAAM,CAAC,CACnF,EACD,MAAM,CAAC,UAAU,CAAC;QAChB,SAAS,EAAE,CAAC,KAAK,EAAE,EAAE;YACnB,IAAI,CAAC,WAAW,EAAE,EAAE,CAAC;gBACnB,8DAA8D;gBAC9D,iEAAiE;gBACjE,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,EAAE,CAAA;gBACxB,MAAM,MAAM,GACV,OAAO,CAAC,KAAK,KAAK,IAAI,IAAI,IAAI,CAAC,IAAI,KAAK,SAAS;oBAC/C,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,EAAE,KAAK,CAAC;oBAC1B,CAAC,CAAC,KAAK,CAAA;gBACX,KAAK,CAAC,GAAG,CAAC,SAAS,CAAC,OAAO,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC,CAAA;gBAC3C,OAAO,CAAC,SAAS,EAAE,CAAC,OAAO,CAAC,UAAU,CAAC,CAAA;YACzC,CAAC;QACH,CAAC;QACD,SAAS,EAAE,CAAC,KAAK,EAAE,EAAE;YACnB,MAAM,OAAO,GAAG,KAAK,CAAC,aAAa,CAAC,KAAK,CAAC,CAAA;YAC1C,IAAI,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,WAAW,EAAE,EAAE,CAAC;gBAC7C,KAAK,CAAC,GAAG,CAAC,SAAS,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC,CAAA;YAClD,CAAC;QACH,CAAC;KACF,CAAC,CACH,CAAA;IAOH,2EAA2E;IAC3E,4EAA4E;IAC5E,2EAA2E;IAC3E,oEAAoE;IACpE,wEAAwE;IACxE,oEAAoE;IACpE,0CAA0C;IAC1C,MAAM,QAAQ,GAAG,OAAO,CAAC,QAAQ,KAAK,UAAU,CAAA;IAChD,MAAM,QAAQ,GAAG,KAAK,CAAC,CAAC,KAAK,CAAC,SAAS,EAAW,CAAA;IAClD,KAAK,CAAC,CAAC,MAAM,CAAC,UAAU,CACtB,QAAQ;QACN,CAAC,CAAC,MAAM,CAAC,OAAO,CACZ,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC;YAClB,MAAM,KAAK,GAAG,KAAK,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAA;YACzC,MAAM,MAAM,GAAG,KAAK,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAA;YAC7C,MAAM,OAAO,GAAG,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,GAAG,EAAE,CAAC,KAAK,CAAC,CAAA;YACjE,gEAAgE;YAChE,IAAI,CAAC,WAAW,EAAE;gBAAE,KAAK,CAAC,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAA;YAC5C,sDAAsD;YACtD,8DAA8D;YAC9D,8DAA8D;YAC9D,qDAAqD;YACrD,MAAM,OAAO,GAAG,KAAK,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAA;YAC3C,IAAI,OAAO,GAAG,CAAC,IAAI,CAAC,WAAW,EAAE;gBAAE,KAAK,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,cAAc,CAAC,CAAA;QACvE,CAAC,CAAC,CACH;QACH,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC,IAAI,CAC7B,MAAM,CAAC,OAAO,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,MAAM,CAAC,UAAU,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC,EACnF,MAAM,CAAC,QAAQ,CAChB,CACN,CAAA;IAED,MAAM,OAAO,GAAG,GAAG,EAAE;QACnB,MAAM,IAAI,GAAG,OAAO,CAAC,QAAQ,EAAE,CAAA;QAC/B,IAAI,WAAW,CAAC,IAAI,CAAC,EAAE,CAAC;YACtB,4EAA4E;YAC5E,UAAU,CAAC,GAAG,CAAC,OAAO,EAAE,SAAS,CAAC,CAAA;YAClC,KAAK,CAAC,GAAG,CAAC,SAAS,CAAC,IAAI,CAAC,CAAA;YACzB,OAAM;QACR,CAAC;QACD,MAAM,GAAG,GAAG,KAAK,CAAC,IAAI,CAAC,CAAA;QACvB,MAAM,QAAQ,GAAG,UAAU,CAAC,GAAG,CAAC,OAAO,CAAC,CAAA;QACxC,IAAI,QAAQ,KAAK,SAAS,IAAI,OAAO,CAAC,GAAG,EAAE,QAAQ,CAAC;YAAE,OAAM;QAC5D,UAAU,CAAC,GAAG,CAAC,OAAO,EAAE,GAAG,CAAC,CAAA;QAC5B,cAAc,EAAE,CAAA;QAChB,KAAK,CAAC,WAAW,CAAC,QAAQ,EAAE,EAAE,IAAI,EAAE,UAAU,EAAE,cAAc,EAAE,EAAE,CAAC,CAAA;IACrE,CAAC,CAAA;IACD,MAAM,WAAW,GAAG,YAAY,CAAC,OAAO,CAAC,CAAA;IACzC,KAAK,CAAC,CAAC,MAAM,CAAC,YAAY,CAAC,GAAG,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAA;IAE1D,6DAA6D;IAC7D,MAAM,OAAO,GAAG,OAAO,CAAC,QAAQ,EAAE,CAAA;IAClC,IAAI,CAAC,WAAW,CAAC,OAAO,CAAC,EAAE,CAAC;QAC1B,UAAU,CAAC,GAAG,CAAC,OAAO,EAAE,KAAK,CAAC,OAAO,CAAC,CAAC,CAAA;QACvC,KAAK,CAAC,WAAW,CAAC,QAAQ,EAAE,EAAE,IAAI,EAAE,OAAO,EAAE,UAAU,EAAE,cAAc,EAAE,EAAE,CAAC,CAAA;IAC9E,CAAC;IAED,OAAO,EAAE,KAAK,EAAE,SAAS,EAAE,GAAG,EAAE,CAAC,UAAU,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,CAAA;AAC/D,CAAC,CAAC,CAAA"}

package/dist/internal/reuse.d.ts

@@ -1,10 +0,0 @@
-/**
- * Substitute `previous` nodes into `next` wherever they are value-equal. The
- * walker only ever returns `previous`, `next`, or a key/index-wise
- * reconstruction of `next` whose every leaf came from one of them, so the
- * result is value-equal to `next` and the type is preserved by construction —
- * the single cast below is that argument, in the style of `wireSources` /
- * `narrowStore`.
- */
-export declare const reuse: <A>(previous: A, next: A) => A;
-//# sourceMappingURL=reuse.d.ts.map

package/dist/internal/reuse.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"reuse.d.ts","sourceRoot":"","sources":["../../src/internal/reuse.ts"],"names":[],"mappings":"AAgEA;;;;;;;GAOG;AACH,eAAO,MAAM,KAAK,GAAI,CAAC,EAAE,UAAU,CAAC,EAAE,MAAM,CAAC,KAAG,CAAsC,CAAA"}

package/dist/internal/reuse.js

@@ -1,68 +0,0 @@
-import { Equal } from 'effect';
-// Structural sharing for recomputed calc outputs: reconcile a fresh output
-// against the previous one, substituting previous nodes wherever value equality
-// holds, so identities only move where values moved. Downstream memo boundaries
-// (React subtrees keyed on object identity) then skip everything that didn't
-// change. Referentially transparent: the result is value-equal to `next` — only
-// identities shift toward `previous` — and neither argument is mutated, so the
-// pass composes with the framework's Equal-based invalidation untouched.
-// Bounds the walk; calc outputs are shallow plain data by framework convention.
-const maxDepth = 16;
-const isPlainRecord = (v) => typeof v === 'object' &&
-    v !== null &&
-    (Object.getPrototypeOf(v) === Object.prototype || Object.getPrototypeOf(v) === null);
-const go = (prev, next, depth) => {
-    if (Object.is(prev, next))
-        return prev;
-    // Data/Schema classes implement Equal+Hash: substitute wholesale on value
-    // equality. Plain objects/arrays fall through (their Equal is referential).
-    if (Equal.equals(prev, next))
-        return prev;
-    if (depth <= 0)
-        return next;
-    if (Array.isArray(prev) && Array.isArray(next)) {
-        const out = next.map((item, i) => (i < prev.length ? go(prev[i], item, depth - 1) : item));
-        return prev.length === next.length && out.every((v, i) => Object.is(v, prev[i]))
-            ? prev
-            : out;
-    }
-    if (isPlainRecord(prev) && isPlainRecord(next)) {
-        const keys = Object.keys(next);
-        const out = {};
-        for (const key of keys)
-            out[key] = key in prev ? go(prev[key], next[key], depth - 1) : next[key];
-        const allPrev = keys.length === Object.keys(prev).length &&
-            keys.every((key) => key in prev && Object.is(out[key], prev[key]));
-        return allPrev ? prev : out;
-    }
-    // Data/Schema class instances that DIFFER still get walked: their Equal is
-    // fieldwise over own enumerable fields, so a reconstruction over reconciled
-    // fields (same prototype; the constructor is bypassed, but every leaf is a
-    // validated value out of `prev` or `next`) stays value-equal to `next` while
-    // unchanged children — e.g. one untouched element inside a class-typed
-    // container — keep their `prev` identity.
-    if (Equal.isEqual(prev) &&
-        Equal.isEqual(next) &&
-        Object.getPrototypeOf(prev) === Object.getPrototypeOf(next)) {
-        const prevFields = Object.fromEntries(Object.entries(prev));
-        const nextFields = Object.entries(next);
-        const out = {};
-        for (const [key, value] of nextFields)
-            out[key] = key in prevFields ? go(prevFields[key], value, depth - 1) : value;
-        const allPrev = nextFields.length === Object.keys(prevFields).length &&
-            nextFields.every(([key]) => key in prevFields && Object.is(out[key], prevFields[key]));
-        return allPrev ? prev : Object.assign(Object.create(Object.getPrototypeOf(next)), out);
-    }
-    // Class instances without Equal (Date, Map, …) are opaque leaves.
-    return next;
-};
-/**
- * Substitute `previous` nodes into `next` wherever they are value-equal. The
- * walker only ever returns `previous`, `next`, or a key/index-wise
- * reconstruction of `next` whose every leaf came from one of them, so the
- * result is value-equal to `next` and the type is preserved by construction —
- * the single cast below is that argument, in the style of `wireSources` /
- * `narrowStore`.
- */
-export const reuse = (previous, next) => go(previous, next, maxDepth);
-//# sourceMappingURL=reuse.js.map

package/dist/internal/reuse.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"reuse.js","sourceRoot":"","sources":["../../src/internal/reuse.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,KAAK,EAAE,MAAM,QAAQ,CAAA;AAE9B,2EAA2E;AAC3E,gFAAgF;AAChF,gFAAgF;AAChF,6EAA6E;AAC7E,gFAAgF;AAChF,+EAA+E;AAC/E,yEAAyE;AAEzE,gFAAgF;AAChF,MAAM,QAAQ,GAAG,EAAE,CAAA;AAEnB,MAAM,aAAa,GAAG,CAAC,CAAU,EAAgC,EAAE,CACjE,OAAO,CAAC,KAAK,QAAQ;IACrB,CAAC,KAAK,IAAI;IACV,CAAC,MAAM,CAAC,cAAc,CAAC,CAAC,CAAC,KAAK,MAAM,CAAC,SAAS,IAAI,MAAM,CAAC,cAAc,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,CAAA;AAEtF,MAAM,EAAE,GAAG,CAAC,IAAa,EAAE,IAAa,EAAE,KAAa,EAAW,EAAE;IAClE,IAAI,MAAM,CAAC,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC;QAAE,OAAO,IAAI,CAAA;IACtC,0EAA0E;IAC1E,4EAA4E;IAC5E,IAAI,KAAK,CAAC,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC;QAAE,OAAO,IAAI,CAAA;IACzC,IAAI,KAAK,IAAI,CAAC;QAAE,OAAO,IAAI,CAAA;IAC3B,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC;QAC/C,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAA;QAC1F,OAAO,IAAI,CAAC,MAAM,KAAK,IAAI,CAAC,MAAM,IAAI,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;YAC9E,CAAC,CAAC,IAAI;YACN,CAAC,CAAC,GAAG,CAAA;IACT,CAAC;IACD,IAAI,aAAa,CAAC,IAAI,CAAC,IAAI,aAAa,CAAC,IAAI,CAAC,EAAE,CAAC;QAC/C,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;QAC9B,MAAM,GAAG,GAA4B,EAAE,CAAA;QACvC,KAAK,MAAM,GAAG,IAAI,IAAI;YAAE,GAAG,CAAC,GAAG,CAAC,GAAG,GAAG,IAAI,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;QAChG,MAAM,OAAO,GACX,IAAI,CAAC,MAAM,KAAK,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,MAAM;YACxC,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,IAAI,IAAI,IAAI,MAAM,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;QACpE,OAAO,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAA;IAC7B,CAAC;IACD,2EAA2E;IAC3E,4EAA4E;IAC5E,2EAA2E;IAC3E,6EAA6E;IAC7E,uEAAuE;IACvE,0CAA0C;IAC1C,IACE,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC;QACnB,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC;QACnB,MAAM,CAAC,cAAc,CAAC,IAAI,CAAC,KAAK,MAAM,CAAC,cAAc,CAAC,IAAI,CAAC,EAC3D,CAAC;QACD,MAAM,UAAU,GAAG,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAA;QAC3D,MAAM,UAAU,GAAG,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,CAAA;QACvC,MAAM,GAAG,GAA4B,EAAE,CAAA;QACvC,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,UAAU;YACnC,GAAG,CAAC,GAAG,CAAC,GAAG,GAAG,IAAI,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,UAAU,CAAC,GAAG,CAAC,EAAE,KAAK,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAA;QAC9E,MAAM,OAAO,GACX,UAAU,CAAC,MAAM,KAAK,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,MAAM;YACpD,UAAU,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,GAAG,IAAI,UAAU,IAAI,MAAM,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;QACxF,OAAO,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,cAAc,CAAC,IAAI,CAAC,CAAC,EAAE,GAAG,CAAC,CAAA;IACxF,CAAC;IACD,kEAAkE;IAClE,OAAO,IAAI,CAAA;AACb,CAAC,CAAA;AAED;;;;;;;GAOG;AACH,MAAM,CAAC,MAAM,KAAK,GAAG,CAAI,QAAW,EAAE,IAAO,EAAK,EAAE,CAAC,EAAE,CAAC,QAAQ,EAAE,IAAI,EAAE,QAAQ,CAAM,CAAA"}

package/dist/internal/scheduler.d.ts

@@ -1,47 +0,0 @@
-import { Context, Effect, Layer } from 'effect';
-/**
- * Coalesces store notifications into a single microtask flush so a batch of
- * writes wakes each subscriber at most once (RESEARCH #3). React owns frame
- * timing; we only collapse the notifications.
- *
- * One scheduler is shared by every store in a runtime, so writes across
- * different stores in the same tick batch into one flush. The instance is
- * resolved per store at creation: `Notifications` when a runtime provides it
- * (per-runtime isolation — see `resolveScheduler`), else the process-wide
- * `defaultScheduler`.
- */
-export interface Scheduler {
-    readonly schedule: (listeners: Iterable<() => void>) => void;
-}
-export declare const makeScheduler: () => Scheduler;
-/**
- * The process-wide scheduler, used by any store created outside a runtime that
- * provides its own `Notifications`. Fine for a single client app (microtask
- * ordering is global anyway); a runtime that needs isolation — concurrent SSR,
- * multiple mounted roots — provides `Notifications` upstream of its stores.
- */
-export declare const defaultScheduler: Scheduler;
-/**
- * Optional per-runtime scheduler. When a runtime provides it upstream of its
- * state/calc layers, those stores coalesce on it instead of the global default,
- * isolating their notification timing from other runtimes in the same process.
- */
-declare const NotificationsBase: Context.TagClass<Notifications, 'reform/Notifications', Scheduler>;
-export declare class Notifications extends NotificationsBase {
-}
-/**
- * A fresh per-runtime scheduler. Merged into `Engine`, so a runtime that wires
- * its state/calc layers *downstream* of `Engine` gets isolated notification
- * timing; the common sibling wiring falls back to `defaultScheduler` (still
- * correct, just process-shared).
- */
-export declare const notificationsLayer: Layer.Layer<Notifications>;
-/**
- * Resolve the scheduler a store should use: the runtime's `Notifications` if one
- * is in context, else the global default. Uses `serviceOption` so it imposes no
- * hard requirement — a store layer wired as a sibling of the runtime (the common
- * pattern) simply falls back to the default.
- */
-export declare const resolveScheduler: Effect.Effect<Scheduler>;
-export {};
-//# sourceMappingURL=scheduler.d.ts.map

package/dist/internal/scheduler.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"scheduler.d.ts","sourceRoot":"","sources":["../../src/internal/scheduler.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,KAAK,EAAsB,MAAM,QAAQ,CAAA;AAEnE;;;;;;;;;;GAUG;AACH,MAAM,WAAW,SAAS;IACxB,QAAQ,CAAC,QAAQ,EAAE,CAAC,SAAS,EAAE,QAAQ,CAAC,MAAM,IAAI,CAAC,KAAK,IAAI,CAAA;CAC7D;AAED,eAAO,MAAM,aAAa,QAAO,SAuChC,CAAA;AAED;;;;;GAKG;AACH,eAAO,MAAM,gBAAgB,EAAE,SAA2B,CAAA;AAE1D;;;;GAIG;AACH,QAAA,MAAM,iBAAiB,EAAE,OAAO,CAAC,QAAQ,CAAC,aAAa,EAAE,sBAAsB,EAAE,SAAS,CACzB,CAAA;AACjE,qBAAa,aAAc,SAAQ,iBAAiB;CAAG;AAEvD;;;;;GAKG;AACH,eAAO,MAAM,kBAAkB,EAAE,KAAK,CAAC,KAAK,CAAC,aAAa,CAA4C,CAAA;AAEtG;;;;;GAKG;AACH,eAAO,MAAM,gBAAgB,EAAE,MAAM,CAAC,MAAM,CAAC,SAAS,CAGrD,CAAA"}

package/dist/internal/scheduler.js

@@ -1,70 +0,0 @@
-import { Context, Effect, Layer, MutableRef, Option } from 'effect';
-export const makeScheduler = () => {
-    const pending = new Set();
-    const armed = MutableRef.make(false);
-    const flush = () => {
-        MutableRef.set(armed, false);
-        // Drain to a fixpoint within ONE microtask. A derived store's `onChange`
-        // re-schedules during the pass (it is itself a listener of its upstream), so
-        // resolving the whole dependency graph here — instead of re-arming a fresh
-        // microtask per layer — collapses a depth-N propagation into a single flush
-        // and wakes each leaf subscriber once at its final value. Converges because
-        // a derived store schedules only when its output actually moves (Equal).
-        while (pending.size > 0) {
-            const due = [...pending];
-            pending.clear();
-            for (const listener of due) {
-                // One listener's throw (a defect in a user calc body) must not abandon
-                // the rest of the flush; surface it to the host's global handler on a
-                // fresh microtask instead of unwinding this loop.
-                try {
-                    listener();
-                }
-                catch (error) {
-                    queueMicrotask(() => {
-                        throw error;
-                    });
-                }
-            }
-        }
-    };
-    const schedule = (listeners) => {
-        for (const listener of listeners)
-            pending.add(listener);
-        if (pending.size > 0 && !MutableRef.get(armed)) {
-            MutableRef.set(armed, true);
-            queueMicrotask(flush);
-        }
-    };
-    return { schedule };
-};
-/**
- * The process-wide scheduler, used by any store created outside a runtime that
- * provides its own `Notifications`. Fine for a single client app (microtask
- * ordering is global anyway); a runtime that needs isolation — concurrent SSR,
- * multiple mounted roots — provides `Notifications` upstream of its stores.
- */
-export const defaultScheduler = makeScheduler();
-/**
- * Optional per-runtime scheduler. When a runtime provides it upstream of its
- * state/calc layers, those stores coalesce on it instead of the global default,
- * isolating their notification timing from other runtimes in the same process.
- */
-const NotificationsBase = Context.Tag('reform/Notifications')();
-export class Notifications extends NotificationsBase {
-}
-/**
- * A fresh per-runtime scheduler. Merged into `Engine`, so a runtime that wires
- * its state/calc layers *downstream* of `Engine` gets isolated notification
- * timing; the common sibling wiring falls back to `defaultScheduler` (still
- * correct, just process-shared).
- */
-export const notificationsLayer = Layer.sync(Notifications, makeScheduler);
-/**
- * Resolve the scheduler a store should use: the runtime's `Notifications` if one
- * is in context, else the global default. Uses `serviceOption` so it imposes no
- * hard requirement — a store layer wired as a sibling of the runtime (the common
- * pattern) simply falls back to the default.
- */
-export const resolveScheduler = Effect.map(Effect.serviceOption(Notifications), Option.getOrElse(() => defaultScheduler));
-//# sourceMappingURL=scheduler.js.map

package/dist/internal/scheduler.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"scheduler.js","sourceRoot":"","sources":["../../src/internal/scheduler.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,UAAU,EAAE,MAAM,EAAE,MAAM,QAAQ,CAAA;AAiBnE,MAAM,CAAC,MAAM,aAAa,GAAG,GAAc,EAAE;IAC3C,MAAM,OAAO,GAAG,IAAI,GAAG,EAAc,CAAA;IACrC,MAAM,KAAK,GAAG,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;IAEpC,MAAM,KAAK,GAAG,GAAG,EAAE;QACjB,UAAU,CAAC,GAAG,CAAC,KAAK,EAAE,KAAK,CAAC,CAAA;QAC5B,yEAAyE;QACzE,6EAA6E;QAC7E,2EAA2E;QAC3E,4EAA4E;QAC5E,4EAA4E;QAC5E,yEAAyE;QACzE,OAAO,OAAO,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC;YACxB,MAAM,GAAG,GAAG,CAAC,GAAG,OAAO,CAAC,CAAA;YACxB,OAAO,CAAC,KAAK,EAAE,CAAA;YACf,KAAK,MAAM,QAAQ,IAAI,GAAG,EAAE,CAAC;gBAC3B,uEAAuE;gBACvE,sEAAsE;gBACtE,kDAAkD;gBAClD,IAAI,CAAC;oBACH,QAAQ,EAAE,CAAA;gBACZ,CAAC;gBAAC,OAAO,KAAK,EAAE,CAAC;oBACf,cAAc,CAAC,GAAG,EAAE;wBAClB,MAAM,KAAK,CAAA;oBACb,CAAC,CAAC,CAAA;gBACJ,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC,CAAA;IAED,MAAM,QAAQ,GAAG,CAAC,SAA+B,EAAE,EAAE;QACnD,KAAK,MAAM,QAAQ,IAAI,SAAS;YAAE,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAA;QACvD,IAAI,OAAO,CAAC,IAAI,GAAG,CAAC,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;YAC/C,UAAU,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,CAAC,CAAA;YAC3B,cAAc,CAAC,KAAK,CAAC,CAAA;QACvB,CAAC;IACH,CAAC,CAAA;IAED,OAAO,EAAE,QAAQ,EAAE,CAAA;AACrB,CAAC,CAAA;AAED;;;;;GAKG;AACH,MAAM,CAAC,MAAM,gBAAgB,GAAc,aAAa,EAAE,CAAA;AAE1D;;;;GAIG;AACH,MAAM,iBAAiB,GACrB,OAAO,CAAC,GAAG,CAAC,sBAAsB,CAAC,EAA4B,CAAA;AACjE,MAAM,OAAO,aAAc,SAAQ,iBAAiB;CAAG;AAEvD;;;;;GAKG;AACH,MAAM,CAAC,MAAM,kBAAkB,GAA+B,KAAK,CAAC,IAAI,CAAC,aAAa,EAAE,aAAa,CAAC,CAAA;AAEtG;;;;;GAKG;AACH,MAAM,CAAC,MAAM,gBAAgB,GAA6B,MAAM,CAAC,GAAG,CAClE,MAAM,CAAC,aAAa,CAAC,aAAa,CAAC,EACnC,MAAM,CAAC,SAAS,CAAC,GAAG,EAAE,CAAC,gBAAgB,CAAC,CACzC,CAAA"}

package/dist/internal/seeds.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"seeds.d.ts","sourceRoot":"","sources":["../../src/internal/seeds.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAe,MAAM,QAAQ,CAAA;AAE9C;;;;;;;;;;;;;GAaG;AACH,eAAO,MAAM,oBAAoB,EAAE,QAAQ,CAAC,QAAQ,CAAC,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC,CAGnF,CAAA"}

package/dist/internal/seeds.js

@@ -1,17 +0,0 @@
-import { FiberRef, GlobalValue } from 'effect';
-/**
- * The sanctioned tooling/test seam for seeding CLOSED scenes. A scene's layers
- * are pre-composed (each state group seeds its own live store), so an outer
- * layer cannot override an inner store — but a FiberRef set via
- * `Layer.locally(ref, value)(layer)` IS visible inside the construction effects
- * of nested layers. `State.live` consults this ref at store-construction time:
- * if the state's member name is present, the (schema-validated) value replaces
- * the authored seed; otherwise the authored seed wins.
- *
- * Empty by default — production wiring never touches it. The dev-tool inspector
- * (`Scene.seedScene`) and proofs are the only intended writers. `globalValue`
- * keeps a single ref instance even if the module is loaded twice (duplicated
- * bundles, HMR), so the writer and the reader always agree.
- */
-export const CurrentSeedOverrides = GlobalValue.globalValue(Symbol.for('reform/CurrentSeedOverrides'), () => FiberRef.unsafeMake({}));
-//# sourceMappingURL=seeds.js.map

package/dist/internal/seeds.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"seeds.js","sourceRoot":"","sources":["../../src/internal/seeds.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,WAAW,EAAE,MAAM,QAAQ,CAAA;AAE9C;;;;;;;;;;;;;GAaG;AACH,MAAM,CAAC,MAAM,oBAAoB,GAC/B,WAAW,CAAC,WAAW,CAAC,MAAM,CAAC,GAAG,CAAC,6BAA6B,CAAC,EAAE,GAAG,EAAE,CACtE,QAAQ,CAAC,UAAU,CAAoC,EAAE,CAAC,CAC3D,CAAA"}

package/dist/internal/sources.d.ts

@@ -1,39 +0,0 @@
-import { type Context, Effect } from 'effect';
-import { type AnySource, type SourceName, type SourceValue } from '../state/token';
-/** The decoded inputs handed to a calc body, keyed by each source's name. */
-export type InputsObject<Inputs extends ReadonlyArray<AnySource>> = {
-    readonly [S in Inputs[number] as SourceName<S>]: SourceValue<S>;
-};
-/**
- * The store services a list of store-carriers requires, as a *union of distinct*
- * stores (each carrier has its own backing tag), not a single store of a union.
- * Structural over the `store` tag, so it serves both calc inputs (`Source`s) and
- * state-group members (`StateClass`es) — anything carrying a `store` tag.
- */
-export type StoresOf<Items extends ReadonlyArray<unknown>> = {
-    [I in keyof Items]: Items[I] extends {
-        readonly store: Context.Tag<infer Svc, any>;
-    } ? Svc : never;
-}[number];
-/** The store requirement a calc's inputs impose. */
-export type InputStores<Inputs extends ReadonlyArray<AnySource>> = StoresOf<Inputs>;
-/** Project inputs into a comparable key; the calc reacts only when it moves. */
-export type InvalidateBy<Inputs extends ReadonlyArray<AnySource>> = (inputs: InputsObject<Inputs>) => ReadonlyArray<unknown>;
-/** Element-wise value equality of two invalidation keys. */
-export declare const sameKey: (a: ReadonlyArray<unknown>, b: ReadonlyArray<unknown>) => boolean;
-/** The sensing surface both `Calc.live` and `AsyncCalc.live` build on. */
-export interface WiredSources<Inputs extends ReadonlyArray<AnySource>> {
-    /** Snapshot every input by name — the decoded inputs object a calc body sees. */
-    readonly snapshot: () => InputsObject<Inputs>;
-    /** The invalidation key for an inputs object: the projection, or all input values. */
-    readonly keyOf: (inputs: InputsObject<Inputs>) => ReadonlyArray<unknown>;
-    /** Subscribe to every source at once; the returned thunk unsubscribes from all. */
-    readonly subscribe: (listener: () => void) => () => void;
-}
-/**
- * Read each input's backing store and return the shared sensing surface. The
- * caller owns lifecycle: register the `subscribe` result's unsubscribe as a
- * scope finalizer (both live bodies run under `Layer.scoped`).
- */
-export declare const wireSources: <Inputs extends ReadonlyArray<AnySource>>(inputs: Inputs, invalidateBy?: InvalidateBy<Inputs>) => Effect.Effect<WiredSources<Inputs>, never, InputStores<Inputs>>;
-//# sourceMappingURL=sources.d.ts.map

package/dist/internal/sources.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"sources.d.ts","sourceRoot":"","sources":["../../src/internal/sources.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,KAAK,OAAO,EAAE,MAAM,EAAoB,MAAM,QAAQ,CAAA;AAC/D,OAAO,EAAE,KAAK,SAAS,EAAE,KAAK,UAAU,EAAE,KAAK,WAAW,EAAE,MAAM,gBAAgB,CAAA;AAQlF,6EAA6E;AAC7E,MAAM,MAAM,YAAY,CAAC,MAAM,SAAS,aAAa,CAAC,SAAS,CAAC,IAAI;IAClE,QAAQ,EAAE,CAAC,IAAI,MAAM,CAAC,MAAM,CAAC,IAAI,UAAU,CAAC,CAAC,CAAC,GAAG,WAAW,CAAC,CAAC,CAAC;CAChE,CAAA;AAED;;;;;GAKG;AACH,MAAM,MAAM,QAAQ,CAAC,KAAK,SAAS,aAAa,CAAC,OAAO,CAAC,IAAI;KAC1D,CAAC,IAAI,MAAM,KAAK,GAAG,KAAK,CAAC,CAAC,CAAC,SAAS;QAAE,QAAQ,CAAC,KAAK,EAAE,OAAO,CAAC,GAAG,CAAC,MAAM,GAAG,EAAE,GAAG,CAAC,CAAA;KAAE,GAAG,GAAG,GAAG,KAAK;CACnG,CAAC,MAAM,CAAC,CAAA;AAET,oDAAoD;AACpD,MAAM,MAAM,WAAW,CAAC,MAAM,SAAS,aAAa,CAAC,SAAS,CAAC,IAAI,QAAQ,CAAC,MAAM,CAAC,CAAA;AAEnF,gFAAgF;AAChF,MAAM,MAAM,YAAY,CAAC,MAAM,SAAS,aAAa,CAAC,SAAS,CAAC,IAAI,CAClE,MAAM,EAAE,YAAY,CAAC,MAAM,CAAC,KACzB,aAAa,CAAC,OAAO,CAAC,CAAA;AAuB3B,4DAA4D;AAC5D,eAAO,MAAM,OAAO,GAAI,GAAG,aAAa,CAAC,OAAO,CAAC,EAAE,GAAG,aAAa,CAAC,OAAO,CAAC,KAAG,OACJ,CAAA;AAE3E,0EAA0E;AAC1E,MAAM,WAAW,YAAY,CAAC,MAAM,SAAS,aAAa,CAAC,SAAS,CAAC;IACnE,iFAAiF;IACjF,QAAQ,CAAC,QAAQ,EAAE,MAAM,YAAY,CAAC,MAAM,CAAC,CAAA;IAC7C,sFAAsF;IACtF,QAAQ,CAAC,KAAK,EAAE,CAAC,MAAM,EAAE,YAAY,CAAC,MAAM,CAAC,KAAK,aAAa,CAAC,OAAO,CAAC,CAAA;IACxE,mFAAmF;IACnF,QAAQ,CAAC,SAAS,EAAE,CAAC,QAAQ,EAAE,MAAM,IAAI,KAAK,MAAM,IAAI,CAAA;CACzD;AAED;;;;GAIG;AACH,eAAO,MAAM,WAAW,GAAI,MAAM,SAAS,aAAa,CAAC,SAAS,CAAC,EACjE,QAAQ,MAAM,EACd,eAAe,YAAY,CAAC,MAAM,CAAC,KAClC,MAAM,CAAC,MAAM,CAAC,YAAY,CAAC,MAAM,CAAC,EAAE,KAAK,EAAE,WAAW,CAAC,MAAM,CAAC,CA4BM,CAAA"}

package/dist/internal/sources.js

@@ -1,59 +0,0 @@
-import { Effect, Equal, Predicate } from 'effect';
-import {} from '../state/token';
-import {} from './store';
-/**
- * The runtime key an input contributes to the inputs object. Prefer the
- * explicit `manifest.name` — the string handed to `make` — over the structural
- * `name`: a `Calc`/`AsyncCalc` *class* satisfies `Source` through its static
- * `name`, and a user subclass declaration (`class Feed extends Calc.make(…)`)
- * defines its OWN `name` from the class binding, shadowing the explicit one.
- * That binding is what minifiers rename, so keying the snapshot by `input.name`
- * made every subclassed calc input `undefined` in production builds (and would
- * silently mis-key in dev whenever the binding differs from the `make` name —
- * the type-level key, `SourceName<S>`, is always the `make` string). The
- * manifest is inherited through the static prototype chain and never shadowed.
- * `StateToken`s carry no manifest; their `name` is an instance field holding
- * the explicit member key, so the fallback is always the declared string.
- */
-const inputKey = (input) => Predicate.hasProperty(input, 'manifest') &&
-    Predicate.isRecord(input.manifest) &&
-    Predicate.isString(input.manifest['name'])
-    ? input.manifest['name']
-    : input.name;
-/** Element-wise value equality of two invalidation keys. */
-export const sameKey = (a, b) => a.length === b.length && a.every((value, i) => Equal.equals(value, b[i]));
-/**
- * Read each input's backing store and return the shared sensing surface. The
- * caller owns lifecycle: register the `subscribe` result's unsubscribe as a
- * scope finalizer (both live bodies run under `Layer.scoped`).
- */
-export const wireSources = (inputs, invalidateBy) => Effect.gen(function* () {
-    const sources = [];
-    for (const input of inputs)
-        sources.push(yield* input.store);
-    const snapshot = () => {
-        const args = {};
-        inputs.forEach((input, i) => {
-            // `noUncheckedIndexedAccess`: `sources` is built 1:1 with `inputs`, but
-            // guard the index so the read is honestly total.
-            const source = sources[i];
-            if (source !== undefined)
-                args[inputKey(input)] = source.getSnapshot();
-        });
-        return args;
-    };
-    const keyOf = (args) => invalidateBy ? invalidateBy(args) : Object.values(args);
-    const subscribe = (listener) => {
-        const unsubscribes = sources.map((source) => source.subscribe(listener));
-        return () => {
-            for (const unsubscribe of unsubscribes)
-                unsubscribe();
-        };
-    };
-    return { snapshot, keyOf, subscribe };
-    // Yielding each `input.store` (a `Context.Tag<Store<unknown>>`) widens the
-    // inferred requirement to `Store<unknown>`; restate the precise per-input
-    // `InputStores<Inputs>` union the signature promises. This is the single
-    // place that cast lives — `Calc.live`/`AsyncCalc.live` inherit it.
-});
-//# sourceMappingURL=sources.js.map

package/dist/internal/sources.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"sources.js","sourceRoot":"","sources":["../../src/internal/sources.ts"],"names":[],"mappings":"AAAA,OAAO,EAAgB,MAAM,EAAE,KAAK,EAAE,SAAS,EAAE,MAAM,QAAQ,CAAA;AAC/D,OAAO,EAAqD,MAAM,gBAAgB,CAAA;AAClF,OAAO,EAAc,MAAM,SAAS,CAAA;AA8BpC;;;;;;;;;;;;;GAaG;AACH,MAAM,QAAQ,GAAG,CAAC,KAAgB,EAAU,EAAE,CAC5C,SAAS,CAAC,WAAW,CAAC,KAAK,EAAE,UAAU,CAAC;IACxC,SAAS,CAAC,QAAQ,CAAC,KAAK,CAAC,QAAQ,CAAC;IAClC,SAAS,CAAC,QAAQ,CAAC,KAAK,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;IACxC,CAAC,CAAC,KAAK,CAAC,QAAQ,CAAC,MAAM,CAAC;IACxB,CAAC,CAAC,KAAK,CAAC,IAAI,CAAA;AAEhB,4DAA4D;AAC5D,MAAM,CAAC,MAAM,OAAO,GAAG,CAAC,CAAyB,EAAE,CAAyB,EAAW,EAAE,CACvF,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC,KAAK,CAAC,CAAC,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;AAY3E;;;;GAIG;AACH,MAAM,CAAC,MAAM,WAAW,GAAG,CACzB,MAAc,EACd,YAAmC,EAC8B,EAAE,CACnE,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC;IAClB,MAAM,OAAO,GAA0B,EAAE,CAAA;IACzC,KAAK,MAAM,KAAK,IAAI,MAAM;QAAE,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,CAAA;IAE5D,MAAM,QAAQ,GAAG,GAAyB,EAAE;QAC1C,MAAM,IAAI,GAA4B,EAAE,CAAA;QACxC,MAAM,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,CAAC,EAAE,EAAE;YAC1B,wEAAwE;YACxE,iDAAiD;YACjD,MAAM,MAAM,GAAG,OAAO,CAAC,CAAC,CAAC,CAAA;YACzB,IAAI,MAAM,KAAK,SAAS;gBAAE,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,GAAG,MAAM,CAAC,WAAW,EAAE,CAAA;QACxE,CAAC,CAAC,CAAA;QACF,OAAO,IAA4B,CAAA;IACrC,CAAC,CAAA;IACD,MAAM,KAAK,GAAG,CAAC,IAA0B,EAA0B,EAAE,CACnE,YAAY,CAAC,CAAC,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;IACzD,MAAM,SAAS,GAAG,CAAC,QAAoB,EAAgB,EAAE;QACvD,MAAM,YAAY,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,MAAM,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC,CAAA;QACxE,OAAO,GAAG,EAAE;YACV,KAAK,MAAM,WAAW,IAAI,YAAY;gBAAE,WAAW,EAAE,CAAA;QACvD,CAAC,CAAA;IACH,CAAC,CAAA;IACD,OAAO,EAAE,QAAQ,EAAE,KAAK,EAAE,SAAS,EAAE,CAAA;IACrC,2EAA2E;IAC3E,0EAA0E;IAC1E,yEAAyE;IACzE,mEAAmE;AACrE,CAAC,CAAoE,CAAA"}

package/dist/internal/stateRegistry.d.ts

@@ -1,2 +0,0 @@
-export declare const claimStateTag: (identifier: string) => void;
-//# sourceMappingURL=stateRegistry.d.ts.map

package/dist/internal/stateRegistry.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"stateRegistry.d.ts","sourceRoot":"","sources":["../../src/internal/stateRegistry.ts"],"names":[],"mappings":"AAmBA,eAAO,MAAM,aAAa,GAAI,YAAY,MAAM,KAAG,IAYlD,CAAA"}

package/dist/internal/stateRegistry.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"stateRegistry.js","sourceRoot":"","sources":["../../src/internal/stateRegistry.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,MAAM,EAAE,MAAM,QAAQ,CAAA;AAE/B;;;;;;;;;;;;;GAaG;AACH,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAA;AACjC,MAAM,MAAM,GAAG,IAAI,GAAG,EAAU,CAAA;AAEhC,MAAM,CAAC,MAAM,aAAa,GAAG,CAAC,UAAkB,EAAQ,EAAE;IACxD,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,CAAC;QAC7B,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC,CAAA;QACvB,OAAM;IACR,CAAC;IACD,IAAI,MAAM,CAAC,GAAG,CAAC,UAAU,CAAC;QAAE,OAAM;IAClC,MAAM,CAAC,GAAG,CAAC,UAAU,CAAC,CAAA;IACtB,MAAM,CAAC,OAAO,CACZ,MAAM,CAAC,UAAU,CACf,gCAAgC,UAAU,sFAAsF,CACjI,CACF,CAAA;AACH,CAAC,CAAA"}

package/dist/internal/store.d.ts

@@ -1,47 +0,0 @@
-import { type Inspectable } from './inspect';
-import { type Scheduler } from './scheduler';
-/**
- * A reactive cell living outside Effect. The single source of truth for one
- * slice of state. `set` is internal: only the reduce loop ever holds a Store
- * (reducers return values, the loop writes them), which is how "state changes
- * only in the reduce loop" is enforced structurally — there is no public writer.
- *
- * This is the synchronous, React-facing analog of Effect's `SubscriptionRef`
- * (a `Ref` + `PubSub` + a `changes` `Stream`). We don't use `SubscriptionRef`
- * directly because `useSyncExternalStore` requires a *synchronous* `getSnapshot`
- * and a *synchronous* `subscribe` returning an unsubscribe thunk, whereas
- * `SubscriptionRef.get` is an `Effect` and its `changes` is a `Stream` (a fiber
- * per subscription). Mutable state is held in a `MutableRef` (Effect's mutable
- * cell), so there is no reassigned binding.
- *
- * `getSnapshot` + `subscribe` are the stable pair the React bridge binds to;
- * `getSnapshot` returns the same reference until the value actually changes.
- * `getVersion` returns a monotonic counter bumped on every real change — the
- * host sums it across a render's tracked stores for a `useSyncExternalStore`
- * snapshot, which closes the tear/dropped-update window a value snapshot can't.
- */
-export interface Store<in out A> extends Inspectable {
-    get(): A;
-    set(value: A): void;
-    getSnapshot(): A;
-    getVersion(): number;
-    subscribe(listener: () => void): () => void;
-}
-export declare const makeStore: <A>(initial: A, scheduler?: Scheduler) => Store<A>;
-/**
- * A read-only `Store` whose value is computed from upstream sources.
- *
- * Reads are pull-fresh: `get`/`getSnapshot` call `compute` directly, so a
- * headless snapshot always reflects the current source state without waiting for
- * a notification (`compute` must memoize so an unchanged read returns a stable
- * reference — `useSyncExternalStore` requires it). *Notifications*, by contrast,
- * run through the same coalescing scheduler as `makeStore`: an upstream change
- * recomputes once and wakes subscribers only when the output actually moves (by
- * `Equal.equals`), so every store kind shares one notification timing. `set` is
- * a no-op — the only writer is the upstream subscription.
- */
-export declare const makeDerivedStore: <A>(compute: () => A, subscribeUpstream: (onChange: () => void) => () => void, scheduler?: Scheduler) => {
-    readonly store: Store<A>;
-    readonly unsubscribe: () => void;
-};
-//# sourceMappingURL=store.d.ts.map

package/dist/internal/store.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"store.d.ts","sourceRoot":"","sources":["../../src/internal/store.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,KAAK,WAAW,EAAe,MAAM,WAAW,CAAA;AACzD,OAAO,EAAoB,KAAK,SAAS,EAAE,MAAM,aAAa,CAAA;AAE9D;;;;;;;;;;;;;;;;;;;GAmBG;AACH,MAAM,WAAW,KAAK,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAE,SAAQ,WAAW;IAClD,GAAG,IAAI,CAAC,CAAA;IACR,GAAG,CAAC,KAAK,EAAE,CAAC,GAAG,IAAI,CAAA;IACnB,WAAW,IAAI,CAAC,CAAA;IAChB,UAAU,IAAI,MAAM,CAAA;IACpB,SAAS,CAAC,QAAQ,EAAE,MAAM,IAAI,GAAG,MAAM,IAAI,CAAA;CAC5C;AAED,eAAO,MAAM,SAAS,GAAI,CAAC,EAAE,SAAS,CAAC,EAAE,YAAW,SAA4B,KAAG,KAAK,CAAC,CAAC,CAwBzF,CAAA;AAED;;;;;;;;;;;GAWG;AACH,eAAO,MAAM,gBAAgB,GAAI,CAAC,EAChC,SAAS,MAAM,CAAC,EAChB,mBAAmB,CAAC,QAAQ,EAAE,MAAM,IAAI,KAAK,MAAM,IAAI,EACvD,YAAW,SAA4B,KACtC;IAAE,QAAQ,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC;IAAC,QAAQ,CAAC,WAAW,EAAE,MAAM,IAAI,CAAA;CA8B9D,CAAA"}