@playfast/reform 0.0.5 → 0.0.7

package/dist/calc/calc.js

@@ -0,0 +1,58 @@
+import { Context, Effect, Layer, MutableRef } from 'effect';
+import { yieldableClass } from '../definition/definition';
+import { sameKey, wireSources, } from '../internal/sources';
+import { resolveScheduler } from '../internal/scheduler';
+import { reuse } from '../internal/reuse';
+import { makeDerivedStore } from '../internal/store';
+import { readTracked } from '../internal/track';
+import {} from '../state/token';
+// Re-exported so `Calc.InputsObject` / `Calc.InvalidateBy` keep their home here
+// even though the reactive plumbing now lives in `internal/sources`.
+export {} from '../internal/sources';
+/**
+ * A derived, memoized value over explicit inputs (state members, other calcs, or
+ * async calcs). The *definition* fixes the inputs and the output schema; the
+ * *implementation* is the pure projection. Recomputes only when an input changes;
+ * `yield* Calc` reads the memoized value.
+ */
+export const make = (name, config) => {
+    const store = Context.GenericTag(`reform/calc/${name}`);
+    const manifest = { kind: 'Calc', name, output: config.output };
+    const read = Effect.flatMap(store, readTracked);
+    return yieldableClass(read, { manifest, store, name, inputs: config.inputs });
+};
+/**
+ * Wire the pure projection for a calc. Recomputes only when its invalidation key
+ * changes (by default every input value; override with `invalidateBy`), memoized
+ * on that key; `yield* Calc` reads the memoized value. The derived store reuses
+ * the shared coalescing scheduler, so a recompute that yields an equal value
+ * wakes no subscriber.
+ */
+export const live = (calc, compute, options = {}) => 
+// Scoped so the source subscriptions are released when the layer's scope
+// closes (each proof/test builds and disposes its own runtime).
+Layer.scoped(calc.store, Effect.gen(function* () {
+    const scheduler = yield* resolveScheduler;
+    const sources = yield* wireSources(calc.inputs, options.invalidateBy);
+    // Memo cell: key and output captured together so reads are always
+    // consistent (no separate output that could lag the key it was computed for).
+    const memo = MutableRef.make(undefined);
+    const recompute = () => {
+        const args = sources.snapshot();
+        const key = sources.keyOf(args);
+        const prev = MutableRef.get(memo);
+        if (prev !== undefined && sameKey(key, prev.key))
+            return prev.output;
+        const fresh = compute(args);
+        // With `reuse`, a recompute that lands value-equal to the previous
+        // output returns the previous reference — the derived store's Equal
+        // gate then wakes no subscriber at all.
+        const output = options.reuse === true && prev !== undefined ? reuse(prev.output, fresh) : fresh;
+        MutableRef.set(memo, { key, output });
+        return output;
+    };
+    const derived = makeDerivedStore(recompute, sources.subscribe, scheduler);
+    yield* Effect.addFinalizer(() => Effect.sync(derived.unsubscribe));
+    return derived.store;
+}));
+//# sourceMappingURL=calc.js.map

package/dist/calc/calc.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"calc.js","sourceRoot":"","sources":["../../src/calc/calc.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,UAAU,EAAe,MAAM,QAAQ,CAAA;AACxE,OAAO,EAAiB,cAAc,EAAE,MAAM,0BAA0B,CAAA;AACxE,OAAO,EAIL,OAAO,EACP,WAAW,GACZ,MAAM,qBAAqB,CAAA;AAC5B,OAAO,EAAE,gBAAgB,EAAE,MAAM,uBAAuB,CAAA;AACxD,OAAO,EAAE,KAAK,EAAE,MAAM,mBAAmB,CAAA;AACzC,OAAO,EAAE,gBAAgB,EAAc,MAAM,mBAAmB,CAAA;AAChE,OAAO,EAAE,WAAW,EAAE,MAAM,mBAAmB,CAAA;AAC/C,OAAO,EAAkB,MAAM,gBAAgB,CAAA;AAE/C,gFAAgF;AAChF,qEAAqE;AACrE,OAAO,EAA0D,MAAM,qBAAqB,CAAA;AA0C5F;;;;;GAKG;AACH,MAAM,CAAC,MAAM,IAAI,GAAG,CAClB,IAAO,EACP,MAA+B,EACJ,EAAE;IAC7B,MAAM,KAAK,GAAG,OAAO,CAAC,UAAU,CAAyB,eAAe,IAAI,EAAE,CAAC,CAAA;IAC/E,MAAM,QAAQ,GAAyB,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,CAAA;IACpF,MAAM,IAAI,GAAG,MAAM,CAAC,OAAO,CAAC,KAAK,EAAE,WAAW,CAAC,CAAA;IAC/C,OAAO,cAAc,CAAC,IAAI,EAAE,EAAE,QAAQ,EAAE,KAAK,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,CAAC,CAAA;AAC/E,CAAC,CAAA;AAED;;;;;;GAMG;AACH,MAAM,CAAC,MAAM,IAAI,GAAG,CAClB,IAA+B,EAC/B,OAA8C,EAC9C,UAA+B,EAAE,EACoB,EAAE;AACvD,yEAAyE;AACzE,gEAAgE;AAChE,KAAK,CAAC,MAAM,CACV,IAAI,CAAC,KAAK,EACV,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC;IAClB,MAAM,SAAS,GAAG,KAAK,CAAC,CAAC,gBAAgB,CAAA;IACzC,MAAM,OAAO,GAAG,KAAK,CAAC,CAAC,WAAW,CAAC,IAAI,CAAC,MAAM,EAAE,OAAO,CAAC,YAAY,CAAC,CAAA;IAErE,kEAAkE;IAClE,8EAA8E;IAC9E,MAAM,IAAI,GAAG,UAAU,CAAC,IAAI,CAE1B,SAAS,CAAC,CAAA;IACZ,MAAM,SAAS,GAAG,GAAQ,EAAE;QAC1B,MAAM,IAAI,GAAG,OAAO,CAAC,QAAQ,EAAE,CAAA;QAC/B,MAAM,GAAG,GAAG,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,CAAA;QAC/B,MAAM,IAAI,GAAG,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;QACjC,IAAI,IAAI,KAAK,SAAS,IAAI,OAAO,CAAC,GAAG,EAAE,IAAI,CAAC,GAAG,CAAC;YAAE,OAAO,IAAI,CAAC,MAAM,CAAA;QACpE,MAAM,KAAK,GAAG,OAAO,CAAC,IAAI,CAAC,CAAA;QAC3B,mEAAmE;QACnE,oEAAoE;QACpE,wCAAwC;QACxC,MAAM,MAAM,GACV,OAAO,CAAC,KAAK,KAAK,IAAI,IAAI,IAAI,KAAK,SAAS,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAA;QAClF,UAAU,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,GAAG,EAAE,MAAM,EAAE,CAAC,CAAA;QACrC,OAAO,MAAM,CAAA;IACf,CAAC,CAAA;IAED,MAAM,OAAO,GAAG,gBAAgB,CAAC,SAAS,EAAE,OAAO,CAAC,SAAS,EAAE,SAAS,CAAC,CAAA;IACzE,KAAK,CAAC,CAAC,MAAM,CAAC,YAAY,CAAC,GAAG,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC,CAAA;IAClE,OAAO,OAAO,CAAC,KAAK,CAAA;AACtB,CAAC,CAAC,CACH,CAAA"}

package/dist/calc/calcFamily.d.ts

@@ -0,0 +1,57 @@
+import { Context, Effect, Layer, type Schema } from 'effect';
+import { type Manifest } from '../definition/definition';
+import { type InputsObject, type InputStores, type InvalidateBy } from '../internal/sources';
+import { type FamilyOptions, type FamilyStore } from '../state/stateFamily';
+import { type AnySource } from '../state/token';
+export interface CalcFamilyManifest<N extends string, K, Out> extends Manifest {
+    readonly kind: 'CalcFamily';
+    readonly name: N;
+    readonly key: Schema.Schema<K, any>;
+    readonly output: Schema.Schema<Out, any>;
+}
+export interface CalcFamilyClass<out N extends string, out Inputs extends ReadonlyArray<AnySource>, in out K, in out Out> {
+    /** Instance carries the key phantom so `Family['Key']` resolves in key types. */
+    new (): {
+        readonly Key: K;
+    };
+    readonly manifest: CalcFamilyManifest<N, K, Out>;
+    readonly store: Context.Tag<FamilyStore<K, Out>, FamilyStore<K, Out>>;
+    /** Marker data read by `CalcFamily.live` and the editor's graph builder. */
+    readonly inputs: Inputs;
+}
+export interface CalcFamilyConfig<Inputs extends ReadonlyArray<AnySource>, K, Out> {
+    readonly key: Schema.Schema<K, any>;
+    readonly inputs: Inputs;
+    readonly output: Schema.Schema<Out, any>;
+}
+/**
+ * Define a keyed derived value: per-key memoized projections over shared
+ * inputs. The *definition* fixes the key/output schemas and the inputs; the
+ * *implementation* (the per-key projection) is supplied by `CalcFamily.live`.
+ */
+export declare const make: <const N extends string, const Inputs extends ReadonlyArray<AnySource>, K, Out>(name: N, config: CalcFamilyConfig<Inputs, K, Out>) => CalcFamilyClass<N, Inputs, K, Out>;
+/**
+ * Read one member by key — `CalcFamily.read(GroupProjection, id)`. Inside a
+ * render it subscribes exactly that member's store (unrelated members never
+ * wake the subtree); elsewhere it just snapshots — the same one-read-API
+ * contract as `StateFamily.read`.
+ */
+export declare const read: <N extends string, Inputs extends ReadonlyArray<AnySource>, K, Out>(family: CalcFamilyClass<N, Inputs, K, Out>, key: K) => Effect.Effect<Out, never, FamilyStore<K, Out>>;
+export interface CalcFamilyLiveOptions<Inputs extends ReadonlyArray<AnySource>> extends FamilyOptions {
+    /**
+     * Family-wide invalidation key over the SHARED inputs (the member key plays
+     * no part — it is fixed per member). Same contract as `Calc`'s.
+     */
+    readonly invalidateBy?: InvalidateBy<Inputs>;
+}
+/**
+ * Wire the per-key projection. `compute` is curried — `(key) => (inputs) =>
+ * Out` — so per-key construction (closing over key-derived constants) runs once
+ * per member while the inner projection runs per recompute. Each member is a
+ * lazy derived store over the shared wired sources: memoized on the family's
+ * invalidation key, notifying only when its own output moves. Unlike a
+ * `StateFamily` entry, a member holds an upstream subscription, so every
+ * removal path (forget / clear / eviction / the layer finalizer) releases it.
+ */
+export declare const live: <N extends string, Inputs extends ReadonlyArray<AnySource>, K, Out>(family: CalcFamilyClass<N, Inputs, K, Out>, compute: (key: K) => (inputs: InputsObject<Inputs>) => Out, options?: CalcFamilyLiveOptions<Inputs>) => Layer.Layer<FamilyStore<K, Out>, never, InputStores<Inputs>>;
+//# sourceMappingURL=calcFamily.d.ts.map

package/dist/calc/calcFamily.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"calcFamily.d.ts","sourceRoot":"","sources":["../../src/calc/calcFamily.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,KAAK,EAAc,KAAK,MAAM,EAAE,MAAM,QAAQ,CAAA;AACxE,OAAO,EAAE,KAAK,QAAQ,EAAmB,MAAM,0BAA0B,CAAA;AACzE,OAAO,EACL,KAAK,YAAY,EACjB,KAAK,WAAW,EAChB,KAAK,YAAY,EAGlB,MAAM,qBAAqB,CAAA;AAI5B,OAAO,EAAE,KAAK,aAAa,EAAE,KAAK,WAAW,EAAE,MAAM,sBAAsB,CAAA;AAC3E,OAAO,EAAE,KAAK,SAAS,EAAE,MAAM,gBAAgB,CAAA;AAW/C,MAAM,WAAW,kBAAkB,CAAC,CAAC,SAAS,MAAM,EAAE,CAAC,EAAE,GAAG,CAAE,SAAQ,QAAQ;IAC5E,QAAQ,CAAC,IAAI,EAAE,YAAY,CAAA;IAC3B,QAAQ,CAAC,IAAI,EAAE,CAAC,CAAA;IAChB,QAAQ,CAAC,GAAG,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,GAAG,CAAC,CAAA;IACnC,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,CAAA;CACzC;AAED,MAAM,WAAW,eAAe,CAC9B,GAAG,CAAC,CAAC,SAAS,MAAM,EACpB,GAAG,CAAC,MAAM,SAAS,aAAa,CAAC,SAAS,CAAC,EAC3C,EAAE,CAAC,GAAG,CAAC,CAAC,EACR,EAAE,CAAC,GAAG,CAAC,GAAG;IAEV,iFAAiF;IACjF,QAAQ;QAAE,QAAQ,CAAC,GAAG,EAAE,CAAC,CAAA;KAAE,CAAA;IAC3B,QAAQ,CAAC,QAAQ,EAAE,kBAAkB,CAAC,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,CAAA;IAChD,QAAQ,CAAC,KAAK,EAAE,OAAO,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,WAAW,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAA;IACrE,4EAA4E;IAC5E,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAA;CACxB;AAED,MAAM,WAAW,gBAAgB,CAAC,MAAM,SAAS,aAAa,CAAC,SAAS,CAAC,EAAE,CAAC,EAAE,GAAG;IAC/E,QAAQ,CAAC,GAAG,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,GAAG,CAAC,CAAA;IACnC,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAA;IACvB,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,CAAA;CACzC;AAED;;;;GAIG;AACH,eAAO,MAAM,IAAI,GAAI,KAAK,CAAC,CAAC,SAAS,MAAM,EAAE,KAAK,CAAC,MAAM,SAAS,aAAa,CAAC,SAAS,CAAC,EAAE,CAAC,EAAE,GAAG,EAChG,MAAM,CAAC,EACP,QAAQ,gBAAgB,CAAC,MAAM,EAAE,CAAC,EAAE,GAAG,CAAC,KACvC,eAAe,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,GAAG,CAenC,CAAA;AAED;;;;;GAKG;AACH,eAAO,MAAM,IAAI,GAAI,CAAC,SAAS,MAAM,EAAE,MAAM,SAAS,aAAa,CAAC,SAAS,CAAC,EAAE,CAAC,EAAE,GAAG,EACpF,QAAQ,eAAe,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,GAAG,CAAC,EAC1C,KAAK,CAAC,KACL,MAAM,CAAC,MAAM,CAAC,GAAG,EAAE,KAAK,EAAE,WAAW,CAAC,CAAC,EAAE,GAAG,CAAC,CACe,CAAA;AAE/D,MAAM,WAAW,qBAAqB,CAAC,MAAM,SAAS,aAAa,CAAC,SAAS,CAAC,CAC5E,SAAQ,aAAa;IACrB;;;OAGG;IACH,QAAQ,CAAC,YAAY,CAAC,EAAE,YAAY,CAAC,MAAM,CAAC,CAAA;CAC7C;AAED;;;;;;;;GAQG;AACH,eAAO,MAAM,IAAI,GAAI,CAAC,SAAS,MAAM,EAAE,MAAM,SAAS,aAAa,CAAC,SAAS,CAAC,EAAE,CAAC,EAAE,GAAG,EACpF,QAAQ,eAAe,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,GAAG,CAAC,EAC1C,SAAS,CAAC,GAAG,EAAE,CAAC,KAAK,CAAC,MAAM,EAAE,YAAY,CAAC,MAAM,CAAC,KAAK,GAAG,EAC1D,UAAS,qBAAqB,CAAC,MAAM,CAAM,KAC1C,KAAK,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,KAAK,EAAE,WAAW,CAAC,MAAM,CAAC,CAmF3D,CAAA"}

package/dist/calc/calcFamily.js

@@ -0,0 +1,124 @@
+import { Context, Effect, Layer, MutableRef } from 'effect';
+import { definitionClass } from '../definition/definition';
+import { sameKey, wireSources, } from '../internal/sources';
+import { resolveScheduler } from '../internal/scheduler';
+import { makeDerivedStore } from '../internal/store';
+import { readTracked } from '../internal/track';
+import {} from '../state/stateFamily';
+import {} from '../state/token';
+/**
+ * Define a keyed derived value: per-key memoized projections over shared
+ * inputs. The *definition* fixes the key/output schemas and the inputs; the
+ * *implementation* (the per-key projection) is supplied by `CalcFamily.live`.
+ */
+export const make = (name, config) => {
+    const store = Context.GenericTag(`reform/calcFamily/${name}`);
+    const manifest = {
+        kind: 'CalcFamily',
+        name,
+        key: config.key,
+        output: config.output,
+    };
+    return definitionClass({
+        manifest,
+        store,
+        inputs: config.inputs,
+    });
+};
+/**
+ * Read one member by key — `CalcFamily.read(GroupProjection, id)`. Inside a
+ * render it subscribes exactly that member's store (unrelated members never
+ * wake the subtree); elsewhere it just snapshots — the same one-read-API
+ * contract as `StateFamily.read`.
+ */
+export const read = (family, key) => Effect.flatMap(family.store, (fs) => readTracked(fs.at(key)));
+/**
+ * Wire the per-key projection. `compute` is curried — `(key) => (inputs) =>
+ * Out` — so per-key construction (closing over key-derived constants) runs once
+ * per member while the inner projection runs per recompute. Each member is a
+ * lazy derived store over the shared wired sources: memoized on the family's
+ * invalidation key, notifying only when its own output moves. Unlike a
+ * `StateFamily` entry, a member holds an upstream subscription, so every
+ * removal path (forget / clear / eviction / the layer finalizer) releases it.
+ */
+export const live = (family, compute, options = {}) => Layer.scoped(family.store, Effect.gen(function* () {
+    const scheduler = yield* resolveScheduler;
+    // Wired ONCE for the whole family — members share the sensing surface.
+    const sources = yield* wireSources(family.inputs, options.invalidateBy);
+    const entries = new Map();
+    const evictWhenUnused = options.evictWhenUnused === true;
+    // Live subscriber count per key — maintained only when eviction is on.
+    const subscribers = new Map();
+    const dropEntry = (key) => {
+        const entry = entries.get(key);
+        if (entry !== undefined)
+            entry.unsubscribe();
+        entries.delete(key);
+        subscribers.delete(key);
+    };
+    // One member: the same memo block as `Calc.live`, with the key closed over.
+    const createMember = (key) => {
+        const body = compute(key);
+        const memo = MutableRef.make(undefined);
+        const recompute = () => {
+            const args = sources.snapshot();
+            const memoKey = sources.keyOf(args);
+            const prev = MutableRef.get(memo);
+            if (prev !== undefined && sameKey(memoKey, prev.key))
+                return prev.output;
+            const output = body(args);
+            MutableRef.set(memo, { key: memoKey, output });
+            return output;
+        };
+        return makeDerivedStore(recompute, sources.subscribe, scheduler);
+    };
+    // The `StateFamily` ref-count idiom: evict on the next microtask once a
+    // key falls idle (a same-commit re-subscribe cancels it) — here eviction
+    // also releases the member's upstream subscription via `dropEntry`.
+    const refCounted = (key, store) => ({
+        ...store,
+        subscribe: (listener) => {
+            subscribers.set(key, (subscribers.get(key) ?? 0) + 1);
+            const off = store.subscribe(listener);
+            const released = { done: false };
+            return () => {
+                if (released.done)
+                    return;
+                released.done = true;
+                off();
+                const remaining = (subscribers.get(key) ?? 1) - 1;
+                if (remaining > 0) {
+                    subscribers.set(key, remaining);
+                    return;
+                }
+                subscribers.delete(key);
+                queueMicrotask(() => {
+                    if ((subscribers.get(key) ?? 0) === 0)
+                        dropEntry(key);
+                });
+            };
+        },
+    });
+    const familyStore = {
+        at: (key) => {
+            const existing = entries.get(key);
+            if (existing !== undefined)
+                return existing.store;
+            const member = createMember(key);
+            const created = evictWhenUnused
+                ? { store: refCounted(key, member.store), unsubscribe: member.unsubscribe }
+                : member;
+            entries.set(key, created);
+            return created.store;
+        },
+        forget: dropEntry,
+        clear: () => {
+            for (const key of [...entries.keys()])
+                dropEntry(key);
+        },
+        size: () => entries.size,
+    };
+    yield* Effect.addFinalizer(() => Effect.sync(() => familyStore.clear()));
+    return familyStore;
+}));
+//# sourceMappingURL=calcFamily.js.map

package/dist/calc/calcFamily.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"calcFamily.js","sourceRoot":"","sources":["../../src/calc/calcFamily.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,UAAU,EAAe,MAAM,QAAQ,CAAA;AACxE,OAAO,EAAiB,eAAe,EAAE,MAAM,0BAA0B,CAAA;AACzE,OAAO,EAIL,OAAO,EACP,WAAW,GACZ,MAAM,qBAAqB,CAAA;AAC5B,OAAO,EAAE,gBAAgB,EAAE,MAAM,uBAAuB,CAAA;AACxD,OAAO,EAAE,gBAAgB,EAAc,MAAM,mBAAmB,CAAA;AAChE,OAAO,EAAE,WAAW,EAAE,MAAM,mBAAmB,CAAA;AAC/C,OAAO,EAAwC,MAAM,sBAAsB,CAAA;AAC3E,OAAO,EAAkB,MAAM,gBAAgB,CAAA;AAsC/C;;;;GAIG;AACH,MAAM,CAAC,MAAM,IAAI,GAAG,CAClB,IAAO,EACP,MAAwC,EACJ,EAAE;IACtC,MAAM,KAAK,GAAG,OAAO,CAAC,UAAU,CAC9B,qBAAqB,IAAI,EAAE,CAC5B,CAAA;IACD,MAAM,QAAQ,GAAkC;QAC9C,IAAI,EAAE,YAAY;QAClB,IAAI;QACJ,GAAG,EAAE,MAAM,CAAC,GAAG;QACf,MAAM,EAAE,MAAM,CAAC,MAAM;KACtB,CAAA;IACD,OAAO,eAAe,CAAqC;QACzD,QAAQ;QACR,KAAK;QACL,MAAM,EAAE,MAAM,CAAC,MAAM;KACtB,CAAC,CAAA;AACJ,CAAC,CAAA;AAED;;;;;GAKG;AACH,MAAM,CAAC,MAAM,IAAI,GAAG,CAClB,MAA0C,EAC1C,GAAM,EAC0C,EAAE,CAClD,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,WAAW,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;AAW/D;;;;;;;;GAQG;AACH,MAAM,CAAC,MAAM,IAAI,GAAG,CAClB,MAA0C,EAC1C,OAA0D,EAC1D,UAAyC,EAAE,EACmB,EAAE,CAChE,KAAK,CAAC,MAAM,CACV,MAAM,CAAC,KAAK,EACZ,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC;IAClB,MAAM,SAAS,GAAG,KAAK,CAAC,CAAC,gBAAgB,CAAA;IACzC,uEAAuE;IACvE,MAAM,OAAO,GAAG,KAAK,CAAC,CAAC,WAAW,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,YAAY,CAAC,CAAA;IACvE,MAAM,OAAO,GAAG,IAAI,GAAG,EAAuE,CAAA;IAC9F,MAAM,eAAe,GAAG,OAAO,CAAC,eAAe,KAAK,IAAI,CAAA;IACxD,uEAAuE;IACvE,MAAM,WAAW,GAAG,IAAI,GAAG,EAAa,CAAA;IAExC,MAAM,SAAS,GAAG,CAAC,GAAM,EAAQ,EAAE;QACjC,MAAM,KAAK,GAAG,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;QAC9B,IAAI,KAAK,KAAK,SAAS;YAAE,KAAK,CAAC,WAAW,EAAE,CAAA;QAC5C,OAAO,CAAC,MAAM,CAAC,GAAG,CAAC,CAAA;QACnB,WAAW,CAAC,MAAM,CAAC,GAAG,CAAC,CAAA;IACzB,CAAC,CAAA;IAED,4EAA4E;IAC5E,MAAM,YAAY,GAAG,CAAC,GAAM,EAAoE,EAAE;QAChG,MAAM,IAAI,GAAG,OAAO,CAAC,GAAG,CAAC,CAAA;QACzB,MAAM,IAAI,GAAG,UAAU,CAAC,IAAI,CAE1B,SAAS,CAAC,CAAA;QACZ,MAAM,SAAS,GAAG,GAAQ,EAAE;YAC1B,MAAM,IAAI,GAAG,OAAO,CAAC,QAAQ,EAAE,CAAA;YAC/B,MAAM,OAAO,GAAG,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,CAAA;YACnC,MAAM,IAAI,GAAG,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;YACjC,IAAI,IAAI,KAAK,SAAS,IAAI,OAAO,CAAC,OAAO,EAAE,IAAI,CAAC,GAAG,CAAC;gBAAE,OAAO,IAAI,CAAC,MAAM,CAAA;YACxE,MAAM,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,CAAA;YACzB,UAAU,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,GAAG,EAAE,OAAO,EAAE,MAAM,EAAE,CAAC,CAAA;YAC9C,OAAO,MAAM,CAAA;QACf,CAAC,CAAA;QACD,OAAO,gBAAgB,CAAC,SAAS,EAAE,OAAO,CAAC,SAAS,EAAE,SAAS,CAAC,CAAA;IAClE,CAAC,CAAA;IAED,wEAAwE;IACxE,yEAAyE;IACzE,oEAAoE;IACpE,MAAM,UAAU,GAAG,CAAC,GAAM,EAAE,KAAiB,EAAc,EAAE,CAAC,CAAC;QAC7D,GAAG,KAAK;QACR,SAAS,EAAE,CAAC,QAAQ,EAAE,EAAE;YACtB,WAAW,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,WAAW,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAA;YACrD,MAAM,GAAG,GAAG,KAAK,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAA;YACrC,MAAM,QAAQ,GAAG,EAAE,IAAI,EAAE,KAAK,EAAE,CAAA;YAChC,OAAO,GAAG,EAAE;gBACV,IAAI,QAAQ,CAAC,IAAI;oBAAE,OAAM;gBACzB,QAAQ,CAAC,IAAI,GAAG,IAAI,CAAA;gBACpB,GAAG,EAAE,CAAA;gBACL,MAAM,SAAS,GAAG,CAAC,WAAW,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAA;gBACjD,IAAI,SAAS,GAAG,CAAC,EAAE,CAAC;oBAClB,WAAW,CAAC,GAAG,CAAC,GAAG,EAAE,SAAS,CAAC,CAAA;oBAC/B,OAAM;gBACR,CAAC;gBACD,WAAW,CAAC,MAAM,CAAC,GAAG,CAAC,CAAA;gBACvB,cAAc,CAAC,GAAG,EAAE;oBAClB,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC;wBAAE,SAAS,CAAC,GAAG,CAAC,CAAA;gBACvD,CAAC,CAAC,CAAA;YACJ,CAAC,CAAA;QACH,CAAC;KACF,CAAC,CAAA;IAEF,MAAM,WAAW,GAAwB;QACvC,EAAE,EAAE,CAAC,GAAG,EAAE,EAAE;YACV,MAAM,QAAQ,GAAG,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;YACjC,IAAI,QAAQ,KAAK,SAAS;gBAAE,OAAO,QAAQ,CAAC,KAAK,CAAA;YACjD,MAAM,MAAM,GAAG,YAAY,CAAC,GAAG,CAAC,CAAA;YAChC,MAAM,OAAO,GAAG,eAAe;gBAC7B,CAAC,CAAC,EAAE,KAAK,EAAE,UAAU,CAAC,GAAG,EAAE,MAAM,CAAC,KAAK,CAAC,EAAE,WAAW,EAAE,MAAM,CAAC,WAAW,EAAE;gBAC3E,CAAC,CAAC,MAAM,CAAA;YACV,OAAO,CAAC,GAAG,CAAC,GAAG,EAAE,OAAO,CAAC,CAAA;YACzB,OAAO,OAAO,CAAC,KAAK,CAAA;QACtB,CAAC;QACD,MAAM,EAAE,SAAS;QACjB,KAAK,EAAE,GAAG,EAAE;YACV,KAAK,MAAM,GAAG,IAAI,CAAC,GAAG,OAAO,CAAC,IAAI,EAAE,CAAC;gBAAE,SAAS,CAAC,GAAG,CAAC,CAAA;QACvD,CAAC;QACD,IAAI,EAAE,GAAG,EAAE,CAAC,OAAO,CAAC,IAAI;KACzB,CAAA;IACD,KAAK,CAAC,CAAC,MAAM,CAAC,YAAY,CAAC,GAAG,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,WAAW,CAAC,KAAK,EAAE,CAAC,CAAC,CAAA;IACxE,OAAO,WAAW,CAAA;AACpB,CAAC,CAAC,CACH,CAAA"}

package/dist/calc/compose.d.ts

@@ -0,0 +1,16 @@
+import { Layer } from 'effect';
+/**
+ * Compose a calc-dependency chain: provide each upstream calc's `.live` layer
+ * into the downstream one, nearest dependency first. The result exposes every
+ * calc store in the chain and requires only the chain's *external* inputs (the
+ * base state stores) — never the intermediate calc stores.
+ *
+ * Order is leaf-first, then its upstreams in dependency order:
+ * `composeCalcs(FilteredLive, AllLive, QueryLive)` ≡
+ * `FilteredLive.pipe(Layer.provideMerge(AllLive), Layer.provideMerge(QueryLive))`.
+ * For chains deeper than three upstreams, nest `composeCalcs`.
+ */
+export declare function composeCalcs<LOut, LErr, LIn, AOut, AErr, AIn>(leaf: Layer.Layer<LOut, LErr, LIn>, upstream: Layer.Layer<AOut, AErr, AIn>): Layer.Layer<LOut | AOut, LErr | AErr, AIn | Exclude<LIn, AOut>>;
+export declare function composeCalcs<LOut, LErr, LIn, AOut, AErr, AIn, BOut, BErr, BIn>(leaf: Layer.Layer<LOut, LErr, LIn>, upstream1: Layer.Layer<AOut, AErr, AIn>, upstream2: Layer.Layer<BOut, BErr, BIn>): Layer.Layer<LOut | AOut | BOut, LErr | AErr | BErr, BIn | Exclude<AIn | Exclude<LIn, AOut>, BOut>>;
+export declare function composeCalcs<LOut, LErr, LIn, AOut, AErr, AIn, BOut, BErr, BIn, COut, CErr, CIn>(leaf: Layer.Layer<LOut, LErr, LIn>, upstream1: Layer.Layer<AOut, AErr, AIn>, upstream2: Layer.Layer<BOut, BErr, BIn>, upstream3: Layer.Layer<COut, CErr, CIn>): Layer.Layer<LOut | AOut | BOut | COut, LErr | AErr | BErr | CErr, CIn | Exclude<BIn | Exclude<AIn | Exclude<LIn, AOut>, BOut>, COut>>;
+//# sourceMappingURL=compose.d.ts.map

package/dist/calc/compose.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"compose.d.ts","sourceRoot":"","sources":["../../src/calc/compose.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,KAAK,EAAE,MAAM,QAAQ,CAAA;AAW9B;;;;;;;;;;GAUG;AACH,wBAAgB,YAAY,CAAC,IAAI,EAAE,IAAI,EAAE,GAAG,EAAE,IAAI,EAAE,IAAI,EAAE,GAAG,EAC3D,IAAI,EAAE,KAAK,CAAC,KAAK,CAAC,IAAI,EAAE,IAAI,EAAE,GAAG,CAAC,EAClC,QAAQ,EAAE,KAAK,CAAC,KAAK,CAAC,IAAI,EAAE,IAAI,EAAE,GAAG,CAAC,GACrC,KAAK,CAAC,KAAK,CAAC,IAAI,GAAG,IAAI,EAAE,IAAI,GAAG,IAAI,EAAE,GAAG,GAAG,OAAO,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC,CAAA;AAClE,wBAAgB,YAAY,CAAC,IAAI,EAAE,IAAI,EAAE,GAAG,EAAE,IAAI,EAAE,IAAI,EAAE,GAAG,EAAE,IAAI,EAAE,IAAI,EAAE,GAAG,EAC5E,IAAI,EAAE,KAAK,CAAC,KAAK,CAAC,IAAI,EAAE,IAAI,EAAE,GAAG,CAAC,EAClC,SAAS,EAAE,KAAK,CAAC,KAAK,CAAC,IAAI,EAAE,IAAI,EAAE,GAAG,CAAC,EACvC,SAAS,EAAE,KAAK,CAAC,KAAK,CAAC,IAAI,EAAE,IAAI,EAAE,GAAG,CAAC,GACtC,KAAK,CAAC,KAAK,CACZ,IAAI,GAAG,IAAI,GAAG,IAAI,EAClB,IAAI,GAAG,IAAI,GAAG,IAAI,EAClB,GAAG,GAAG,OAAO,CAAC,GAAG,GAAG,OAAO,CAAC,GAAG,EAAE,IAAI,CAAC,EAAE,IAAI,CAAC,CAC9C,CAAA;AACD,wBAAgB,YAAY,CAC1B,IAAI,EACJ,IAAI,EACJ,GAAG,EACH,IAAI,EACJ,IAAI,EACJ,GAAG,EACH,IAAI,EACJ,IAAI,EACJ,GAAG,EACH,IAAI,EACJ,IAAI,EACJ,GAAG,EAEH,IAAI,EAAE,KAAK,CAAC,KAAK,CAAC,IAAI,EAAE,IAAI,EAAE,GAAG,CAAC,EAClC,SAAS,EAAE,KAAK,CAAC,KAAK,CAAC,IAAI,EAAE,IAAI,EAAE,GAAG,CAAC,EACvC,SAAS,EAAE,KAAK,CAAC,KAAK,CAAC,IAAI,EAAE,IAAI,EAAE,GAAG,CAAC,EACvC,SAAS,EAAE,KAAK,CAAC,KAAK,CAAC,IAAI,EAAE,IAAI,EAAE,GAAG,CAAC,GACtC,KAAK,CAAC,KAAK,CACZ,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,EACzB,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,EACzB,GAAG,GAAG,OAAO,CAAC,GAAG,GAAG,OAAO,CAAC,GAAG,GAAG,OAAO,CAAC,GAAG,EAAE,IAAI,CAAC,EAAE,IAAI,CAAC,EAAE,IAAI,CAAC,CACnE,CAAA"}

package/dist/calc/compose.js

@@ -0,0 +1,7 @@
+import { Layer } from 'effect';
+export function composeCalcs(leaf, ...upstream) {
+    // Fold leaf-first: each upstream is provided into the accumulated downstream,
+    // so dependency order is exactly the argument order.
+    return upstream.reduce((downstream, up) => Layer.provideMerge(downstream, up), leaf);
+}
+//# sourceMappingURL=compose.js.map

package/dist/calc/compose.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"compose.js","sourceRoot":"","sources":["../../src/calc/compose.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,KAAK,EAAE,MAAM,QAAQ,CAAA;AA0D9B,MAAM,UAAU,YAAY,CAC1B,IAA4C,EAC5C,GAAG,QAA+D;IAElE,8EAA8E;IAC9E,qDAAqD;IACrD,OAAO,QAAQ,CAAC,MAAM,CACpB,CAAC,UAAU,EAAE,EAAE,EAAE,EAAE,CAAC,KAAK,CAAC,YAAY,CAAC,UAAU,EAAE,EAAE,CAAC,EACtD,IAAI,CACL,CAAA;AACH,CAAC"}

package/dist/channel/channel.d.ts

@@ -0,0 +1,115 @@
+import { Context, type Duration, Effect, Layer } from 'effect';
+import { type Manifest } from '../definition/definition';
+import type { Tagged } from '../runtime/bus';
+/**
+ * How a channel schedules the procedure work routed to it. Channels generalize
+ * the old per-procedure `concurrency`: a named lane with one policy, shared by
+ * every procedure that declares it.
+ *
+ * - `merge`     run every routed event concurrently (the default).
+ * - `latest`    a new event cancels the in-flight run (switch).
+ * - `debounce`  collapse a burst, run only after `duration` of quiet.
+ * - `throttle`  rate-limit to `units` per `duration` (shape or enforce).
+ * - `exclusive` one run at a time across the whole channel (mutual exclusion).
+ */
+export type ChannelPolicy = {
+    readonly _tag: 'merge';
+} | {
+    readonly _tag: 'latest';
+} | {
+    readonly _tag: 'debounce';
+    readonly duration: Duration.DurationInput;
+} | {
+    readonly _tag: 'throttle';
+    readonly units: number;
+    readonly duration: Duration.DurationInput;
+    readonly cost?: number;
+    readonly burst?: number;
+    readonly strategy?: 'enforce' | 'shape';
+} | {
+    readonly _tag: 'exclusive';
+};
+/** The reflectable descriptor a channel carries. */
+export interface ChannelManifest extends Manifest {
+    readonly kind: 'Channel';
+}
+export interface ChannelClass {
+    new (): {};
+    readonly manifest: ChannelManifest;
+    readonly policy: ChannelPolicy;
+}
+export interface ChannelConfig {
+    readonly policy: ChannelPolicy;
+}
+/**
+ * A registered procedure body, with its trigger events and the channel it runs
+ * on. `run`'s context (RPC clients, etc.) is already provided at registration
+ * (see `Procedure.live`), so the channel fiber can run it with no R.
+ */
+export interface ProcedureEntry {
+    /** The procedure's name — used only to warn on duplicate registration. */
+    readonly name: string;
+    readonly channelName: string;
+    readonly handles: ReadonlySet<string>;
+    readonly run: (event: Tagged) => Effect.Effect<unknown, unknown, never>;
+}
+/**
+ * Mutable collector procedures register into; channels read it to find their
+ * bodies. `byTag` indexes entries by trigger tag, so a channel routes an event
+ * to O(procedures handling it) rather than scanning every registered procedure.
+ */
+export interface ProcedureRegistry {
+    readonly entries: Array<ProcedureEntry>;
+    readonly byTag: Map<string, Array<ProcedureEntry>>;
+    /**
+     * Distinct channel names per event tag. The drain loop routes through this so
+     * it offers each event to each channel exactly once — not once per matching
+     * procedure, which would re-run every procedure on a shared channel per offer.
+     */
+    readonly channelsByTag: Map<string, Array<string>>;
+    /**
+     * Procedures keyed by (channel, tag), so a channel's `runMatching` is a direct
+     * lookup instead of scanning `byTag` and re-filtering by channel per event.
+     */
+    readonly byChannelTag: Map<string, Map<string, Array<ProcedureEntry>>>;
+    readonly register: (entry: ProcedureEntry) => void;
+    /**
+     * Remove a previously-registered entry — the inverse of `register`, used when a
+     * lazy feature unmounts (scope close) so its procedures stop running and their
+     * index entries are reclaimed. Eager procedures (root scope) never call it.
+     */
+    readonly unregister: (entry: ProcedureEntry) => void;
+}
+declare const ProceduresBase: Context.TagClass<Procedures, 'reform/Procedures', ProcedureRegistry>;
+export declare class Procedures extends ProceduresBase {
+}
+export declare const proceduresLayer: Layer.Layer<Procedures>;
+/** A live channel: the single loop offers events here; the channel drives them. */
+export interface ChannelRuntime {
+    readonly name: string;
+    /** The policy this channel was built with — used to reject a name clash. */
+    readonly policy: ChannelPolicy;
+    readonly offer: (event: Tagged) => void;
+}
+/** Registry of live channels, keyed by name. The single loop routes through it. */
+declare const ChannelsBase: Context.TagClass<Channels, 'reform/Channels', {
+    readonly byName: Map<string, ChannelRuntime>;
+}>;
+export declare class Channels extends ChannelsBase {
+}
+export declare const channelsLayer: Layer.Layer<Channels>;
+/**
+ * A scheduling lane for procedures. The *definition* (`Channel.make`) is a
+ * reflectable name + policy; the *implementation* (`Channel.live`) builds the
+ * queue + fiber that applies the policy. Procedures reference a channel by value
+ * and register into it; `Channel.live` is merged into the app once per channel.
+ */
+export declare const make: (name: string, config: ChannelConfig) => ChannelClass;
+/**
+ * Build and register the live machinery for a channel. Idempotent by name, so
+ * procedures sharing an `exclusive`/`latest` channel share one queue + fiber +
+ * semaphore (and therefore truly serialize / cancel across each other).
+ */
+export declare const live: (channel: ChannelClass) => Layer.Layer<never, never, Channels | Procedures>;
+export {};
+//# sourceMappingURL=channel.d.ts.map

package/dist/channel/channel.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"channel.d.ts","sourceRoot":"","sources":["../../src/channel/channel.ts"],"names":[],"mappings":"AAAA,OAAO,EAAS,OAAO,EAAE,KAAK,QAAQ,EAAE,MAAM,EAAE,KAAK,EAAwB,MAAM,QAAQ,CAAA;AAC3F,OAAO,EAAE,KAAK,QAAQ,EAAmB,MAAM,0BAA0B,CAAA;AAEzE,OAAO,KAAK,EAAE,MAAM,EAAE,MAAM,gBAAgB,CAAA;AAE5C;;;;;;;;;;GAUG;AACH,MAAM,MAAM,aAAa,GACrB;IAAE,QAAQ,CAAC,IAAI,EAAE,OAAO,CAAA;CAAE,GAC1B;IAAE,QAAQ,CAAC,IAAI,EAAE,QAAQ,CAAA;CAAE,GAC3B;IAAE,QAAQ,CAAC,IAAI,EAAE,UAAU,CAAC;IAAC,QAAQ,CAAC,QAAQ,EAAE,QAAQ,CAAC,aAAa,CAAA;CAAE,GACxE;IACE,QAAQ,CAAC,IAAI,EAAE,UAAU,CAAA;IACzB,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAA;IACtB,QAAQ,CAAC,QAAQ,EAAE,QAAQ,CAAC,aAAa,CAAA;IACzC,QAAQ,CAAC,IAAI,CAAC,EAAE,MAAM,CAAA;IACtB,QAAQ,CAAC,KAAK,CAAC,EAAE,MAAM,CAAA;IACvB,QAAQ,CAAC,QAAQ,CAAC,EAAE,SAAS,GAAG,OAAO,CAAA;CACxC,GACD;IAAE,QAAQ,CAAC,IAAI,EAAE,WAAW,CAAA;CAAE,CAAA;AAElC,oDAAoD;AACpD,MAAM,WAAW,eAAgB,SAAQ,QAAQ;IAC/C,QAAQ,CAAC,IAAI,EAAE,SAAS,CAAA;CACzB;AAED,MAAM,WAAW,YAAY;IAC3B,QAAQ,EAAE,CAAA;IACV,QAAQ,CAAC,QAAQ,EAAE,eAAe,CAAA;IAClC,QAAQ,CAAC,MAAM,EAAE,aAAa,CAAA;CAC/B;AAED,MAAM,WAAW,aAAa;IAC5B,QAAQ,CAAC,MAAM,EAAE,aAAa,CAAA;CAC/B;AAED;;;;GAIG;AACH,MAAM,WAAW,cAAc;IAC7B,0EAA0E;IAC1E,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAA;IACrB,QAAQ,CAAC,WAAW,EAAE,MAAM,CAAA;IAC5B,QAAQ,CAAC,OAAO,EAAE,WAAW,CAAC,MAAM,CAAC,CAAA;IACrC,QAAQ,CAAC,GAAG,EAAE,CAAC,KAAK,EAAE,MAAM,KAAK,MAAM,CAAC,MAAM,CAAC,OAAO,EAAE,OAAO,EAAE,KAAK,CAAC,CAAA;CACxE;AAED;;;;GAIG;AACH,MAAM,WAAW,iBAAiB;IAChC,QAAQ,CAAC,OAAO,EAAE,KAAK,CAAC,cAAc,CAAC,CAAA;IACvC,QAAQ,CAAC,KAAK,EAAE,GAAG,CAAC,MAAM,EAAE,KAAK,CAAC,cAAc,CAAC,CAAC,CAAA;IAClD;;;;OAIG;IACH,QAAQ,CAAC,aAAa,EAAE,GAAG,CAAC,MAAM,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC,CAAA;IAClD;;;OAGG;IACH,QAAQ,CAAC,YAAY,EAAE,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,MAAM,EAAE,KAAK,CAAC,cAAc,CAAC,CAAC,CAAC,CAAA;IACtE,QAAQ,CAAC,QAAQ,EAAE,CAAC,KAAK,EAAE,cAAc,KAAK,IAAI,CAAA;IAClD;;;;OAIG;IACH,QAAQ,CAAC,UAAU,EAAE,CAAC,KAAK,EAAE,cAAc,KAAK,IAAI,CAAA;CACrD;AAED,QAAA,MAAM,cAAc,EAAE,OAAO,CAAC,QAAQ,CAAC,UAAU,EAAE,mBAAmB,EAAE,iBAAiB,CACtB,CAAA;AACnE,qBAAa,UAAW,SAAQ,cAAc;CAAG;AA2DjD,eAAO,MAAM,eAAe,EAAE,KAAK,CAAC,KAAK,CAAC,UAAU,CAAiD,CAAA;AAErG,mFAAmF;AACnF,MAAM,WAAW,cAAc;IAC7B,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAA;IACrB,4EAA4E;IAC5E,QAAQ,CAAC,MAAM,EAAE,aAAa,CAAA;IAC9B,QAAQ,CAAC,KAAK,EAAE,CAAC,KAAK,EAAE,MAAM,KAAK,IAAI,CAAA;CACxC;AAED,mFAAmF;AACnF,QAAA,MAAM,YAAY,EAAE,OAAO,CAAC,QAAQ,CAClC,QAAQ,EACR,iBAAiB,EACjB;IAAE,QAAQ,CAAC,MAAM,EAAE,GAAG,CAAC,MAAM,EAAE,cAAc,CAAC,CAAA;CAAE,CAC8C,CAAA;AAChG,qBAAa,QAAS,SAAQ,YAAY;CAAG;AAE7C,eAAO,MAAM,aAAa,EAAE,KAAK,CAAC,KAAK,CAAC,QAAQ,CAAuD,CAAA;AAEvG;;;;;GAKG;AACH,eAAO,MAAM,IAAI,GAAI,MAAM,MAAM,EAAE,QAAQ,aAAa,KAAG,YAIvD,CAAA;AAEJ;;;;GAIG;AACH,eAAO,MAAM,IAAI,GAAI,SAAS,YAAY,KAAG,KAAK,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,EAAE,QAAQ,GAAG,UAAU,CAoFzF,CAAA"}

package/dist/channel/channel.js

@@ -0,0 +1,138 @@
+import { Chunk, Context, Effect, Layer, Match, Queue, Stream } from 'effect';
+import { definitionClass } from '../definition/definition';
+import { DuplicateRegistration } from '../internal/errors';
+const ProceduresBase = Context.Tag('reform/Procedures')();
+export class Procedures extends ProceduresBase {
+}
+/** Get a map entry, creating and inserting it on first access (avoids `let`). */
+const getOrCreate = (map, key, make) => {
+    const existing = map.get(key);
+    if (existing !== undefined)
+        return existing;
+    const created = make();
+    map.set(key, created);
+    return created;
+};
+/** Drop an item from a `Map<K, Array>` bucket, pruning the key when it empties. */
+const dropFrom = (map, key, item) => {
+    const bucket = map.get(key);
+    if (bucket === undefined)
+        return;
+    const next = bucket.filter((value) => value !== item);
+    if (next.length === 0)
+        map.delete(key);
+    else
+        map.set(key, next);
+};
+const makeProcedureRegistry = () => {
+    const entries = [];
+    const byTag = new Map();
+    const channelsByTag = new Map();
+    const byChannelTag = new Map();
+    return {
+        entries,
+        byTag,
+        channelsByTag,
+        byChannelTag,
+        register: (entry) => {
+            entries.push(entry);
+            for (const tag of entry.handles) {
+                getOrCreate(byTag, tag, () => []).push(entry);
+                const channels = getOrCreate(channelsByTag, tag, () => []);
+                if (!channels.includes(entry.channelName))
+                    channels.push(entry.channelName);
+                getOrCreate(getOrCreate(byChannelTag, entry.channelName, () => new Map()), tag, () => []).push(entry);
+            }
+        },
+        unregister: (entry) => {
+            const index = entries.indexOf(entry);
+            if (index >= 0)
+                entries.splice(index, 1);
+            for (const tag of entry.handles) {
+                dropFrom(byTag, tag, entry);
+                const channelMap = byChannelTag.get(entry.channelName);
+                if (channelMap !== undefined) {
+                    dropFrom(channelMap, tag, entry);
+                    // If no procedure on this channel still handles the tag, drop the
+                    // channel from `channelsByTag[tag]` so the loop stops offering to it.
+                    if (channelMap.get(tag) === undefined)
+                        dropFrom(channelsByTag, tag, entry.channelName);
+                    if (channelMap.size === 0)
+                        byChannelTag.delete(entry.channelName);
+                }
+            }
+        },
+    };
+};
+export const proceduresLayer = Layer.sync(Procedures, makeProcedureRegistry);
+/** Registry of live channels, keyed by name. The single loop routes through it. */
+const ChannelsBase = Context.Tag('reform/Channels')();
+export class Channels extends ChannelsBase {
+}
+export const channelsLayer = Layer.sync(Channels, () => ({ byName: new Map() }));
+/**
+ * A scheduling lane for procedures. The *definition* (`Channel.make`) is a
+ * reflectable name + policy; the *implementation* (`Channel.live`) builds the
+ * queue + fiber that applies the policy. Procedures reference a channel by value
+ * and register into it; `Channel.live` is merged into the app once per channel.
+ */
+export const make = (name, config) => definitionClass({
+    manifest: { kind: 'Channel', name },
+    policy: config.policy,
+});
+/**
+ * Build and register the live machinery for a channel. Idempotent by name, so
+ * procedures sharing an `exclusive`/`latest` channel share one queue + fiber +
+ * semaphore (and therefore truly serialize / cancel across each other).
+ */
+export const live = (channel) => Layer.scopedDiscard(Effect.gen(function* () {
+    const name = channel.manifest.name;
+    const channels = yield* Channels;
+    const existing = channels.byName.get(name);
+    if (existing !== undefined) {
+        // Idempotent for the *same* channel `.live`'d through several sub-layers
+        // (shared `exclusive`/`latest` lane). A *different* channel reusing the
+        // name is a silent footgun — the second policy would be dropped — so
+        // reject it loudly instead.
+        if (existing.policy !== channel.policy) {
+            throw new DuplicateRegistration({ kind: 'Channel', name });
+        }
+        return;
+    }
+    const procedures = yield* Procedures;
+    const queue = yield* Queue.unbounded();
+    // Run every procedure on THIS channel that handles the event. Read the live
+    // index each time so procedures registered later are still seen.
+    // A procedure is expected to model expected failures as events; a leaked
+    // defect (a bug in the body) is logged before being isolated, so one
+    // procedure's crash never tears down the channel fiber — but is observable.
+    const runMatching = (event) => Effect.forEach(procedures.byChannelTag.get(name)?.get(event._tag) ?? [], (e) => e.run(event).pipe(Effect.tapErrorCause((cause) => Effect.logError(`reform: procedure on channel '${name}' failed`, cause)), Effect.catchAllCause(() => Effect.void)), { discard: true, concurrency: 'unbounded' });
+    // Map the policy to its scheduling stream. `Match.exhaustive` makes a new
+    // policy variant a compile error, and each arm is a self-contained const.
+    const events = Stream.fromQueue(queue);
+    const driven = Match.value(channel.policy).pipe(Match.tag('merge', () => Stream.mapEffect(events, runMatching, { concurrency: 'unbounded' })), Match.tag('latest', () => Stream.flatMap(events, (e) => Stream.fromEffect(runMatching(e)), { switch: true })), Match.tag('debounce', (policy) => events.pipe(Stream.debounce(policy.duration), Stream.mapEffect(runMatching, { concurrency: 'unbounded' }))), Match.tag('throttle', (policy) => events.pipe(Stream.throttle({
+        cost: (chunk) => Chunk.size(chunk) * (policy.cost ?? 1),
+        units: policy.units,
+        duration: policy.duration,
+        ...(policy.burst !== undefined ? { burst: policy.burst } : {}),
+        strategy: policy.strategy ?? 'shape',
+    }), Stream.mapEffect(runMatching, { concurrency: 'unbounded' }))), 
+    // `concurrency: 1` runs one event at a time AND in offer order — a true
+    // serialized lane. (An unbounded fork racing for a single semaphore permit
+    // would serialize but could reorder under contention.)
+    Match.tag('exclusive', () => Stream.mapEffect(events, runMatching, { concurrency: 1 })), Match.exhaustive);
+    yield* Effect.forkScoped(Stream.runDrain(driven));
+    channels.byName.set(name, {
+        name,
+        policy: channel.policy,
+        offer: (event) => {
+            Queue.unsafeOffer(queue, event);
+        },
+    });
+    // On scope close (a lazy feature unmounting) remove the live channel so the
+    // loop stops routing to it; the drain fiber is already torn down by
+    // `forkScoped`. Eager channels live on the root scope, so this is a no-op
+    // until app dispose.
+    yield* Effect.addFinalizer(() => Effect.sync(() => channels.byName.delete(name)));
+}));
+//# sourceMappingURL=channel.js.map

package/dist/channel/channel.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"channel.js","sourceRoot":"","sources":["../../src/channel/channel.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,KAAK,EAAE,OAAO,EAAiB,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,QAAQ,CAAA;AAC3F,OAAO,EAAiB,eAAe,EAAE,MAAM,0BAA0B,CAAA;AACzE,OAAO,EAAE,qBAAqB,EAAE,MAAM,oBAAoB,CAAA;AAoF1D,MAAM,cAAc,GAClB,OAAO,CAAC,GAAG,CAAC,mBAAmB,CAAC,EAAiC,CAAA;AACnE,MAAM,OAAO,UAAW,SAAQ,cAAc;CAAG;AAEjD,iFAAiF;AACjF,MAAM,WAAW,GAAG,CAAO,GAAc,EAAE,GAAM,EAAE,IAAa,EAAK,EAAE;IACrE,MAAM,QAAQ,GAAG,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;IAC7B,IAAI,QAAQ,KAAK,SAAS;QAAE,OAAO,QAAQ,CAAA;IAC3C,MAAM,OAAO,GAAG,IAAI,EAAE,CAAA;IACtB,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,OAAO,CAAC,CAAA;IACrB,OAAO,OAAO,CAAA;AAChB,CAAC,CAAA;AAED,mFAAmF;AACnF,MAAM,QAAQ,GAAG,CAAO,GAAqB,EAAE,GAAM,EAAE,IAAO,EAAQ,EAAE;IACtE,MAAM,MAAM,GAAG,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;IAC3B,IAAI,MAAM,KAAK,SAAS;QAAE,OAAM;IAChC,MAAM,IAAI,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,KAAK,IAAI,CAAC,CAAA;IACrD,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;QAAE,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAA;;QACjC,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,CAAA;AACzB,CAAC,CAAA;AAED,MAAM,qBAAqB,GAAG,GAAsB,EAAE;IACpD,MAAM,OAAO,GAA0B,EAAE,CAAA;IACzC,MAAM,KAAK,GAAG,IAAI,GAAG,EAAiC,CAAA;IACtD,MAAM,aAAa,GAAG,IAAI,GAAG,EAAyB,CAAA;IACtD,MAAM,YAAY,GAAG,IAAI,GAAG,EAA8C,CAAA;IAC1E,OAAO;QACL,OAAO;QACP,KAAK;QACL,aAAa;QACb,YAAY;QACZ,QAAQ,EAAE,CAAC,KAAK,EAAE,EAAE;YAClB,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;YACnB,KAAK,MAAM,GAAG,IAAI,KAAK,CAAC,OAAO,EAAE,CAAC;gBAChC,WAAW,CAAC,KAAK,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;gBAC7C,MAAM,QAAQ,GAAG,WAAW,CAAC,aAAa,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,CAAA;gBAC1D,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,KAAK,CAAC,WAAW,CAAC;oBAAE,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,CAAA;gBAC3E,WAAW,CAAC,WAAW,CAAC,YAAY,EAAE,KAAK,CAAC,WAAW,EAAE,GAAG,EAAE,CAAC,IAAI,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,IAAI,CAC5F,KAAK,CACN,CAAA;YACH,CAAC;QACH,CAAC;QACD,UAAU,EAAE,CAAC,KAAK,EAAE,EAAE;YACpB,MAAM,KAAK,GAAG,OAAO,CAAC,OAAO,CAAC,KAAK,CAAC,CAAA;YACpC,IAAI,KAAK,IAAI,CAAC;gBAAE,OAAO,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,CAAA;YACxC,KAAK,MAAM,GAAG,IAAI,KAAK,CAAC,OAAO,EAAE,CAAC;gBAChC,QAAQ,CAAC,KAAK,EAAE,GAAG,EAAE,KAAK,CAAC,CAAA;gBAC3B,MAAM,UAAU,GAAG,YAAY,CAAC,GAAG,CAAC,KAAK,CAAC,WAAW,CAAC,CAAA;gBACtD,IAAI,UAAU,KAAK,SAAS,EAAE,CAAC;oBAC7B,QAAQ,CAAC,UAAU,EAAE,GAAG,EAAE,KAAK,CAAC,CAAA;oBAChC,kEAAkE;oBAClE,sEAAsE;oBACtE,IAAI,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,SAAS;wBAAE,QAAQ,CAAC,aAAa,EAAE,GAAG,EAAE,KAAK,CAAC,WAAW,CAAC,CAAA;oBACtF,IAAI,UAAU,CAAC,IAAI,KAAK,CAAC;wBAAE,YAAY,CAAC,MAAM,CAAC,KAAK,CAAC,WAAW,CAAC,CAAA;gBACnE,CAAC;YACH,CAAC;QACH,CAAC;KACF,CAAA;AACH,CAAC,CAAA;AAED,MAAM,CAAC,MAAM,eAAe,GAA4B,KAAK,CAAC,IAAI,CAAC,UAAU,EAAE,qBAAqB,CAAC,CAAA;AAUrG,mFAAmF;AACnF,MAAM,YAAY,GAId,OAAO,CAAC,GAAG,CAAC,iBAAiB,CAAC,EAA8D,CAAA;AAChG,MAAM,OAAO,QAAS,SAAQ,YAAY;CAAG;AAE7C,MAAM,CAAC,MAAM,aAAa,GAA0B,KAAK,CAAC,IAAI,CAAC,QAAQ,EAAE,GAAG,EAAE,CAAC,CAAC,EAAE,MAAM,EAAE,IAAI,GAAG,EAAE,EAAE,CAAC,CAAC,CAAA;AAEvG;;;;;GAKG;AACH,MAAM,CAAC,MAAM,IAAI,GAAG,CAAC,IAAY,EAAE,MAAqB,EAAgB,EAAE,CACxE,eAAe,CAAe;IAC5B,QAAQ,EAAE,EAAE,IAAI,EAAE,SAAkB,EAAE,IAAI,EAA4B;IACtE,MAAM,EAAE,MAAM,CAAC,MAAM;CACtB,CAAC,CAAA;AAEJ;;;;GAIG;AACH,MAAM,CAAC,MAAM,IAAI,GAAG,CAAC,OAAqB,EAAoD,EAAE,CAC9F,KAAK,CAAC,aAAa,CACjB,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC;IAClB,MAAM,IAAI,GAAG,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAA;IAClC,MAAM,QAAQ,GAAG,KAAK,CAAC,CAAC,QAAQ,CAAA;IAChC,MAAM,QAAQ,GAAG,QAAQ,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;IAC1C,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;QAC3B,yEAAyE;QACzE,wEAAwE;QACxE,qEAAqE;QACrE,4BAA4B;QAC5B,IAAI,QAAQ,CAAC,MAAM,KAAK,OAAO,CAAC,MAAM,EAAE,CAAC;YACvC,MAAM,IAAI,qBAAqB,CAAC,EAAE,IAAI,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAA;QAC5D,CAAC;QACD,OAAM;IACR,CAAC;IACD,MAAM,UAAU,GAAG,KAAK,CAAC,CAAC,UAAU,CAAA;IACpC,MAAM,KAAK,GAAG,KAAK,CAAC,CAAC,KAAK,CAAC,SAAS,EAAU,CAAA;IAE9C,4EAA4E;IAC5E,iEAAiE;IACjE,yEAAyE;IACzE,qEAAqE;IACrE,4EAA4E;IAC5E,MAAM,WAAW,GAAG,CAAC,KAAa,EAAuB,EAAE,CACzD,MAAM,CAAC,OAAO,CACZ,UAAU,CAAC,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,EAAE,EACxD,CAAC,CAAC,EAAE,EAAE,CACJ,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,IAAI,CACf,MAAM,CAAC,aAAa,CAAC,CAAC,KAAK,EAAE,EAAE,CAC7B,MAAM,CAAC,QAAQ,CAAC,iCAAiC,IAAI,UAAU,EAAE,KAAK,CAAC,CACxE,EACD,MAAM,CAAC,aAAa,CAAC,GAAG,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,CACxC,EACH,EAAE,OAAO,EAAE,IAAI,EAAE,WAAW,EAAE,WAAW,EAAE,CAC5C,CAAA;IAEH,0EAA0E;IAC1E,0EAA0E;IAC1E,MAAM,MAAM,GAAG,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,CAAA;IACtC,MAAM,MAAM,GAA2B,KAAK,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,IAAI,CACrE,KAAK,CAAC,GAAG,CAAC,OAAO,EAAE,GAAG,EAAE,CAAC,MAAM,CAAC,SAAS,CAAC,MAAM,EAAE,WAAW,EAAE,EAAE,WAAW,EAAE,WAAW,EAAE,CAAC,CAAC,EAC7F,KAAK,CAAC,GAAG,CAAC,QAAQ,EAAE,GAAG,EAAE,CACvB,MAAM,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,UAAU,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC,CACnF,EACD,KAAK,CAAC,GAAG,CAAC,UAAU,EAAE,CAAC,MAAM,EAAE,EAAE,CAC/B,MAAM,CAAC,IAAI,CACT,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,QAAQ,CAAC,EAChC,MAAM,CAAC,SAAS,CAAC,WAAW,EAAE,EAAE,WAAW,EAAE,WAAW,EAAE,CAAC,CAC5D,CACF,EACD,KAAK,CAAC,GAAG,CAAC,UAAU,EAAE,CAAC,MAAM,EAAE,EAAE,CAC/B,MAAM,CAAC,IAAI,CACT,MAAM,CAAC,QAAQ,CAAC;QACd,IAAI,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,IAAI,CAAC,CAAC;QACvD,KAAK,EAAE,MAAM,CAAC,KAAK;QACnB,QAAQ,EAAE,MAAM,CAAC,QAAQ;QACzB,GAAG,CAAC,MAAM,CAAC,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QAC9D,QAAQ,EAAE,MAAM,CAAC,QAAQ,IAAI,OAAO;KACrC,CAAC,EACF,MAAM,CAAC,SAAS,CAAC,WAAW,EAAE,EAAE,WAAW,EAAE,WAAW,EAAE,CAAC,CAC5D,CACF;IACD,wEAAwE;IACxE,2EAA2E;IAC3E,uDAAuD;IACvD,KAAK,CAAC,GAAG,CAAC,WAAW,EAAE,GAAG,EAAE,CAAC,MAAM,CAAC,SAAS,CAAC,MAAM,EAAE,WAAW,EAAE,EAAE,WAAW,EAAE,CAAC,EAAE,CAAC,CAAC,EACvF,KAAK,CAAC,UAAU,CACjB,CAAA;IAED,KAAK,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAA;IACjD,QAAQ,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,EAAE;QACxB,IAAI;QACJ,MAAM,EAAE,OAAO,CAAC,MAAM;QACtB,KAAK,EAAE,CAAC,KAAK,EAAE,EAAE;YACf,KAAK,CAAC,WAAW,CAAC,KAAK,EAAE,KAAK,CAAC,CAAA;QACjC,CAAC;KACF,CAAC,CAAA;IACF,4EAA4E;IAC5E,oEAAoE;IACpE,0EAA0E;IAC1E,qBAAqB;IACrB,KAAK,CAAC,CAAC,MAAM,CAAC,YAAY,CAAC,GAAG,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,QAAQ,CAAC,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;AACnF,CAAC,CAAC,CACH,CAAA"}