@moltzap/client 2026.508.0 → 2026.508.1

package/dist/internal/app-callback-partitioned-dispatcher.d.ts

@@ -1,180 +0,0 @@
-/**
- * Partitioned appCallback dispatcher.
- *
- * Spec: moltzap#356.
- *
- * Replaces the single `Stream.runForEach(handler)` over `appCallbackInboundQueue`
- * (`packages/client/src/ws-client.ts:658-687@f0df363`) with a
- * partition-router that owns a `Ref<HashMap<PartitionKey,
- * PartitionWorker>>`. For each inbound request:
- *
- *   1. The reader fiber calls `dispatcher.offer(request)`.
- *   2. The dispatcher extracts the partition key (pure, no schema decode).
- *   3. If a worker exists for that key, `worker.offer(request)`.
- *   4. Otherwise, allocate a worker (subject to soft cap) and offer.
- *
- * The dispatcher itself does NOT run a long-lived router fiber: routing
- * is synchronous-up-to-effect on the reader's call thread. The only
- * dispatcher-owned fiber is the **idle reaper**, which periodically
- * walks the partition map and finalizes any worker whose
- * `idleSince._tag === "Idle"` exceeds `idlePartitionTtlMs`.
- *
- * Single-producer guarantee: `dispatcher.offer` is only called from
- * the per-connection reader fiber's `Stream.runForEach` loop in
- * `ws-client.ts:1052-1086`. There is no second producer; concurrent
- * `offer` calls within one dispatcher cannot occur. The actual
- * concurrency property a router would otherwise be defending against
- * is route-vs-drain: the route step (one `Ref.modify` against the
- * partition map + a non-blocking `worker.offer`) is wait-free against
- * every running worker fiber's drain loop. No router fiber means no
- * intermediate buffer between the reader and the per-key worker
- * queue, and no scheduling overhead per route decision.
- *
- * Lifetime: `make` returns `Effect<…, never, Scope.Scope>`. The caller
- * (`ws-client.ts` inside `connectEffect`) calls `Scope.make()` to
- * produce a **dedicated dispatcher Scope** that is NOT bound to the
- * socket Scope, then provides that Scope to `makePartitionedDispatcher`.
- * The dispatcher Scope is held in `ConnState`; teardown from
- * `close()` / `disconnectSync()` is
- * `runtime.runFork(Scope.close(dispatcherScope, Exit.void))`, mirroring
- * today's `runFork(Queue.shutdown(appCallbackInboundQueue))` +
- * `runFork(Fiber.interrupt(appCallbackDispatcherFiber))` pair.
- *
- * Why off-Scope from the socket: `close()` is invoked via `runSync` at
- * `packages/openclaw-channel/src/__tests__/reconnection.integration.test.ts:14`;
- * binding the dispatcher to the socket Scope would make `Scope.close`
- * yield through the runtime (queue.shutdown + fiber.interrupt are
- * non-synchronous), breaking the regression gate at
- * `packages/client/src/ws-client.test.ts:1233-1259`.
- * The `runSync(client.close())` contract is load-bearing — see the
- * test commentary there.
- *
- * Worker scopes are forked children of the dispatcher Scope
- * (`getOrCreatePartitionWorker` calls `Scope.fork(dispatcherScope, …)`
- * for each new worker and provides the child scope to
- * `makePartitionWorker`). Closing the dispatcher Scope cascades to
- * every worker; closing one worker's child scope retires only that
- * worker without leaking finalizers onto the dispatcher scope.
- */
-import { Effect, Scope } from "effect";
-import { type OfferRejected } from "./app-callback-dispatcher-errors.js";
-import { type PartitionKey, type PartitionableRequest } from "./app-callback-partition-key.js";
-import { type PartitionHandler } from "./app-callback-partition-worker.js";
-import type { WsClientLogger } from "../ws-client.js";
-/**
- * Tunable knobs. Defaults named in the design doc; downstream picks
- * exact values at the `MoltZapWsClient` constructor edge.
- */
-export interface PartitionedDispatcherConfig {
-    /**
-     * Soft cap on simultaneously-active partitions per connection.
-     * Default 256. Hit → new partitions fail with `PartitionLimitError`
-     * until the idle reaper retires one.
-     */
-    readonly maxPartitions: number;
-    /**
-     * Bounded queue depth per partition. Default 32. Hit → `offer` fails
-     * with `PartitionQueueFullError` for THIS partition only.
-     */
-    readonly partitionQueueCapacity: number;
-    /**
-     * Idle reaper threshold: a worker whose queue has been continuously
-     * empty for at least this many milliseconds is finalized on the next
-     * reaper tick. Default 60_000.
-     */
-    readonly idlePartitionTtlMs: number;
-    /**
-     * Idle reaper tick period. Default 5_000. Lower = tighter reclamation,
-     * higher CPU cost; higher = looser reclamation, lower overhead.
-     */
-    readonly idleReaperIntervalMs: number;
-}
-/** Defaults. Documented as the named knob values for the implementation. */
-export declare const DEFAULT_PARTITIONED_DISPATCHER_CONFIG: PartitionedDispatcherConfig;
-/**
- * Snapshot of dispatcher state for tests + observability. NOT stable
- * across releases; consumers must treat as best-effort instrumentation.
- */
-export interface DispatcherStats {
-    readonly activePartitions: number;
-    readonly totalOffered: number;
-    readonly totalRejected: {
-        readonly partitionLimit: number;
-        readonly partitionQueueFull: number;
-    };
-    readonly partitions: ReadonlyArray<{
-        readonly key: PartitionKey;
-        readonly queueSize: number;
-        readonly idle: boolean;
-    }>;
-}
-/**
- * Public surface used by `ws-client.ts`. Construction is scoped — the
- * caller's `Scope` owns every partition fiber.
- */
-export interface PartitionedDispatcher {
-    /**
-     * Route one inbound request. Non-blocking. Failure modes are
-     * exhaustive in `OfferRejected`; the reader fiber `Effect.match`es
-     * the tag set to pick a wire-error code.
-     *
-     * Per-tuple ordering: two `offer` calls with the same `PartitionKey`
-     * land on the same `PartitionWorker.offer` (FIFO).
-     * Cross-tuple concurrency: two `offer` calls with different keys
-     * produce no ordering relation.
-     */
-    readonly offer: (request: PartitionableRequest) => Effect.Effect<void, OfferRejected>;
-    /**
-     * Best-effort stats snapshot. Not used in the hot path; called by
-     * tests + the optional `client.stats()` debug surface.
-     */
-    readonly stats: Effect.Effect<DispatcherStats>;
-    /**
-     * Explicit shutdown. Equivalent to `Scope.close(dispatcherScope,
-     * Exit.void)`; exists as a typed handle so callsites that already
-     * hold the dispatcher (not the Scope) can tear it down without
-     * threading the Scope through `ConnState`. Idempotent.
-     *
-     * Callsites that invoke this from a `runSync` context (`close()`,
-     * `disconnectSync()`) MUST wrap with `runtime.runFork`. The Effect
-     * itself yields through the runtime (queue shutdown + fiber
-     * interrupt are non-synchronous); calling `runSync` on it would throw
-     * `AsyncFiberException`. See the regression gate at
-     * `packages/client/src/ws-client.test.ts:1233-1259@f0df363`.
-     */
-    readonly shutdown: Effect.Effect<void>;
-}
-/**
- * Construction params. `handle` is the per-request work — passed in so
- * the dispatcher has no direct dependency on the handler-registry
- * `Ref<HashMap<string, ServerRpcHandler>>` (`appCallbackHandlersRef`); the
- * caller (`ws-client.ts`) closes over the registry and supplies a
- * pre-bound function. This preserves the wire-edge schema-decoding
- * boundary already established in `dispatchInboundServerRequest`.
- *
- * `scope` is the `Scope.CloseableScope` that owns every per-partition
- * worker fiber + the idle reaper. The caller (`ws-client.ts`)
- * allocates it via `Scope.make()` outside the per-connect socket
- * Scope so `runSync(client.close())` can `runFork(Scope.close(scope,
- * Exit.void))` without yielding through the runtime.
- */
-export interface MakePartitionedDispatcherParams {
-    readonly handle: PartitionHandler;
-    readonly scope: Scope.CloseableScope;
-    readonly config?: Partial<PartitionedDispatcherConfig>;
-    readonly logger?: WsClientLogger;
-    /** Monotonic clock for tests. Defaults to `Date.now`. */
-    readonly clock?: () => number;
-}
-/**
- * Construct a partitioned dispatcher. The caller-provided
- * `params.scope` owns every per-partition fiber + the idle-reaper
- * fiber; closing it cascades teardown via `Scope` finalizers.
- *
- * Returns `Effect<…, never>` — neither construction nor partition
- * allocation can fail. The Effect itself does not require a `Scope`
- * because every scoped allocation is provided to `params.scope`
- * explicitly via `Scope.extend`.
- */
-export declare function makePartitionedDispatcher(params: MakePartitionedDispatcherParams): Effect.Effect<PartitionedDispatcher, never>;
-//# sourceMappingURL=app-callback-partitioned-dispatcher.d.ts.map

package/dist/internal/app-callback-partitioned-dispatcher.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"app-callback-partitioned-dispatcher.d.ts","sourceRoot":"","sources":["../../src/internal/app-callback-partitioned-dispatcher.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAyDG;AACH,OAAO,EAGL,MAAM,EAQN,KAAK,EACN,MAAM,QAAQ,CAAC;AAEhB,OAAO,EAEL,KAAK,aAAa,EACnB,MAAM,qCAAqC,CAAC;AAC7C,OAAO,EAEL,KAAK,YAAY,EACjB,KAAK,oBAAoB,EAC1B,MAAM,iCAAiC,CAAC;AACzC,OAAO,EAEL,KAAK,gBAAgB,EAEtB,MAAM,oCAAoC,CAAC;AAC5C,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,iBAAiB,CAAC;AAEtD;;;GAGG;AACH,MAAM,WAAW,2BAA2B;IAC1C;;;;OAIG;IACH,QAAQ,CAAC,aAAa,EAAE,MAAM,CAAC;IAC/B;;;OAGG;IACH,QAAQ,CAAC,sBAAsB,EAAE,MAAM,CAAC;IACxC;;;;OAIG;IACH,QAAQ,CAAC,kBAAkB,EAAE,MAAM,CAAC;IACpC;;;OAGG;IACH,QAAQ,CAAC,oBAAoB,EAAE,MAAM,CAAC;CACvC;AAED,4EAA4E;AAC5E,eAAO,MAAM,qCAAqC,EAAE,2BAMjD,CAAC;AAEJ;;;GAGG;AACH,MAAM,WAAW,eAAe;IAC9B,QAAQ,CAAC,gBAAgB,EAAE,MAAM,CAAC;IAClC,QAAQ,CAAC,YAAY,EAAE,MAAM,CAAC;IAC9B,QAAQ,CAAC,aAAa,EAAE;QACtB,QAAQ,CAAC,cAAc,EAAE,MAAM,CAAC;QAChC,QAAQ,CAAC,kBAAkB,EAAE,MAAM,CAAC;KACrC,CAAC;IACF,QAAQ,CAAC,UAAU,EAAE,aAAa,CAAC;QACjC,QAAQ,CAAC,GAAG,EAAE,YAAY,CAAC;QAC3B,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;QAC3B,QAAQ,CAAC,IAAI,EAAE,OAAO,CAAC;KACxB,CAAC,CAAC;CACJ;AAED;;;GAGG;AACH,MAAM,WAAW,qBAAqB;IACpC;;;;;;;;;OASG;IACH,QAAQ,CAAC,KAAK,EAAE,CACd,OAAO,EAAE,oBAAoB,KAC1B,MAAM,CAAC,MAAM,CAAC,IAAI,EAAE,aAAa,CAAC,CAAC;IACxC;;;OAGG;IACH,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC,MAAM,CAAC,eAAe,CAAC,CAAC;IAC/C;;;;;;;;;;;;OAYG;IACH,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;CACxC;AAED;;;;;;;;;;;;;GAaG;AACH,MAAM,WAAW,+BAA+B;IAC9C,QAAQ,CAAC,MAAM,EAAE,gBAAgB,CAAC;IAClC,QAAQ,CAAC,KAAK,EAAE,KAAK,CAAC,cAAc,CAAC;IACrC,QAAQ,CAAC,MAAM,CAAC,EAAE,OAAO,CAAC,2BAA2B,CAAC,CAAC;IACvD,QAAQ,CAAC,MAAM,CAAC,EAAE,cAAc,CAAC;IACjC,yDAAyD;IACzD,QAAQ,CAAC,KAAK,CAAC,EAAE,MAAM,MAAM,CAAC;CAC/B;AAoCD;;;;;;;;;GASG;AACH,wBAAgB,yBAAyB,CACvC,MAAM,EAAE,+BAA+B,GACtC,MAAM,CAAC,MAAM,CAAC,qBAAqB,EAAE,KAAK,CAAC,CAgH7C"}

package/dist/internal/app-callback-partitioned-dispatcher.js

@@ -1,282 +0,0 @@
-/**
- * Partitioned appCallback dispatcher.
- *
- * Spec: moltzap#356.
- *
- * Replaces the single `Stream.runForEach(handler)` over `appCallbackInboundQueue`
- * (`packages/client/src/ws-client.ts:658-687@f0df363`) with a
- * partition-router that owns a `Ref<HashMap<PartitionKey,
- * PartitionWorker>>`. For each inbound request:
- *
- *   1. The reader fiber calls `dispatcher.offer(request)`.
- *   2. The dispatcher extracts the partition key (pure, no schema decode).
- *   3. If a worker exists for that key, `worker.offer(request)`.
- *   4. Otherwise, allocate a worker (subject to soft cap) and offer.
- *
- * The dispatcher itself does NOT run a long-lived router fiber: routing
- * is synchronous-up-to-effect on the reader's call thread. The only
- * dispatcher-owned fiber is the **idle reaper**, which periodically
- * walks the partition map and finalizes any worker whose
- * `idleSince._tag === "Idle"` exceeds `idlePartitionTtlMs`.
- *
- * Single-producer guarantee: `dispatcher.offer` is only called from
- * the per-connection reader fiber's `Stream.runForEach` loop in
- * `ws-client.ts:1052-1086`. There is no second producer; concurrent
- * `offer` calls within one dispatcher cannot occur. The actual
- * concurrency property a router would otherwise be defending against
- * is route-vs-drain: the route step (one `Ref.modify` against the
- * partition map + a non-blocking `worker.offer`) is wait-free against
- * every running worker fiber's drain loop. No router fiber means no
- * intermediate buffer between the reader and the per-key worker
- * queue, and no scheduling overhead per route decision.
- *
- * Lifetime: `make` returns `Effect<…, never, Scope.Scope>`. The caller
- * (`ws-client.ts` inside `connectEffect`) calls `Scope.make()` to
- * produce a **dedicated dispatcher Scope** that is NOT bound to the
- * socket Scope, then provides that Scope to `makePartitionedDispatcher`.
- * The dispatcher Scope is held in `ConnState`; teardown from
- * `close()` / `disconnectSync()` is
- * `runtime.runFork(Scope.close(dispatcherScope, Exit.void))`, mirroring
- * today's `runFork(Queue.shutdown(appCallbackInboundQueue))` +
- * `runFork(Fiber.interrupt(appCallbackDispatcherFiber))` pair.
- *
- * Why off-Scope from the socket: `close()` is invoked via `runSync` at
- * `packages/openclaw-channel/src/__tests__/reconnection.integration.test.ts:14`;
- * binding the dispatcher to the socket Scope would make `Scope.close`
- * yield through the runtime (queue.shutdown + fiber.interrupt are
- * non-synchronous), breaking the regression gate at
- * `packages/client/src/ws-client.test.ts:1233-1259`.
- * The `runSync(client.close())` contract is load-bearing — see the
- * test commentary there.
- *
- * Worker scopes are forked children of the dispatcher Scope
- * (`getOrCreatePartitionWorker` calls `Scope.fork(dispatcherScope, …)`
- * for each new worker and provides the child scope to
- * `makePartitionWorker`). Closing the dispatcher Scope cascades to
- * every worker; closing one worker's child scope retires only that
- * worker without leaking finalizers onto the dispatcher scope.
- */
-import { Cause, Duration, Effect, ExecutionStrategy, Exit, HashMap, MutableRef, Option, Ref, Schedule, Scope, } from "effect";
-import { PartitionLimitError, } from "./app-callback-dispatcher-errors.js";
-import { extractPartitionKey, } from "./app-callback-partition-key.js";
-import { makePartitionWorker, } from "./app-callback-partition-worker.js";
-/** Defaults. Documented as the named knob values for the implementation. */
-export const DEFAULT_PARTITIONED_DISPATCHER_CONFIG = {
-    maxPartitions: 256,
-    partitionQueueCapacity: 32,
-    idlePartitionTtlMs: 60_000,
-    idleReaperIntervalMs: 5_000,
-};
-/**
- * Construct a partitioned dispatcher. The caller-provided
- * `params.scope` owns every per-partition fiber + the idle-reaper
- * fiber; closing it cascades teardown via `Scope` finalizers.
- *
- * Returns `Effect<…, never>` — neither construction nor partition
- * allocation can fail. The Effect itself does not require a `Scope`
- * because every scoped allocation is provided to `params.scope`
- * explicitly via `Scope.extend`.
- */
-export function makePartitionedDispatcher(params) {
-    const config = {
-        ...DEFAULT_PARTITIONED_DISPATCHER_CONFIG,
-        ...params.config,
-    };
-    const clock = params.clock ?? Date.now;
-    return Effect.gen(function* () {
-        const partitionsRef = yield* Ref.make(HashMap.empty());
-        const counters = {
-            totalOffered: yield* Ref.make(0),
-            partitionLimit: yield* Ref.make(0),
-            partitionQueueFull: yield* Ref.make(0),
-        };
-        const dispatcherScope = params.scope;
-        const internal = {
-            partitionsRef,
-            dispatcherScope,
-            config,
-            handle: params.handle,
-            ...(params.logger !== undefined ? { logger: params.logger } : {}),
-            clock,
-            counters,
-        };
-        // Idle-reaper fiber. One fiber per dispatcher (NOT per partition);
-        // walks the map every `idleReaperIntervalMs` and finalizes
-        // partitions whose `idleSince._tag === "Idle"` exceeds the TTL.
-        const reaperEffect = reapIdlePartitions(internal).pipe(Effect.repeat(Schedule.spaced(Duration.millis(config.idleReaperIntervalMs))), Effect.asVoid, Effect.catchAllCause((cause) => Effect.sync(() => params.logger?.warn("appCallback idle reaper exited", Cause.pretty(cause)))));
-        yield* Scope.extend(Effect.forkScoped(reaperEffect), dispatcherScope);
-        const offer = (request) => Effect.gen(function* () {
-            yield* Ref.update(counters.totalOffered, (n) => n + 1);
-            const key = extractPartitionKey(request);
-            const worker = yield* getOrCreatePartitionWorker({
-                key,
-                requestId: request.id,
-                state: internal,
-            }).pipe(Effect.tapError((err) => err instanceof PartitionLimitError
-                ? Ref.update(counters.partitionLimit, (n) => n + 1)
-                : Effect.void));
-            yield* worker
-                .offer(request)
-                .pipe(Effect.tapError(() => Ref.update(counters.partitionQueueFull, (n) => n + 1)));
-        });
-        const stats = Effect.gen(function* () {
-            const map = yield* Ref.get(partitionsRef);
-            const partitions = [];
-            for (const [key, worker] of HashMap.entries(map)) {
-                const queueSize = yield* worker.queueSize;
-                const idle = MutableRef.get(worker.idleSince)._tag === "Idle";
-                partitions.push({ key, queueSize, idle });
-            }
-            const totalOffered = yield* Ref.get(counters.totalOffered);
-            const partitionLimit = yield* Ref.get(counters.partitionLimit);
-            const partitionQueueFull = yield* Ref.get(counters.partitionQueueFull);
-            return {
-                activePartitions: HashMap.size(map),
-                totalOffered,
-                totalRejected: {
-                    partitionLimit,
-                    partitionQueueFull,
-                },
-                partitions,
-            };
-        });
-        const shutdown = Scope.close(dispatcherScope, Exit.void).pipe(Effect.catchAllCause(() => Effect.void));
-        return {
-            offer,
-            stats,
-            shutdown,
-        };
-    });
-}
-// ─── Internal helpers ────────────────────────────────────────────────
-/**
- * Allocate a worker for `key` if absent and return it, or return the
- * existing worker. Returns `PartitionLimitError` if creation would
- * exceed `maxPartitions` AND no idle partition is reclaimable.
- *
- * NOT part of the public surface — the only public entry is `offer`.
- *
- * Race-safety: under concurrent offers for the same new key, exactly
- * one allocation wins. The losing offer's worker is interrupted and
- * the winner is returned. Since worker construction is `Effect`-shaped,
- * we cannot put it inside `Ref.modify`'s synchronous lambda; instead
- * we build outside, then atomic-insert with a check for prior winners
- * inside `modify`. Worst-case overhead under contention: one extra
- * worker built and immediately interrupted. Bounded by partition cap.
- */
-function getOrCreatePartitionWorker(params) {
-    return Effect.gen(function* () {
-        const { key, requestId, state } = params;
-        const existing = yield* Ref.get(state.partitionsRef).pipe(Effect.map((m) => HashMap.get(m, key)));
-        if (Option.isSome(existing)) {
-            return existing.value;
-        }
-        // Soft cap check is best-effort: under concurrent allocation we
-        // may temporarily exceed by 1-2 before the next reaper tick. The
-        // cap exists as a DoS guard, not an exact-cardinality invariant.
-        const sizeBeforeAlloc = yield* Ref.get(state.partitionsRef).pipe(Effect.map((m) => HashMap.size(m)));
-        if (sizeBeforeAlloc >= state.config.maxPartitions) {
-            return yield* Effect.fail(new PartitionLimitError({
-                key,
-                activePartitions: sizeBeforeAlloc,
-                maxPartitions: state.config.maxPartitions,
-                requestId,
-            }));
-        }
-        // Fork a per-worker child scope from the dispatcher scope. Every
-        // finalizer the worker registers (queue.shutdown, drain fiber)
-        // binds to this child scope, so the reaper can close it
-        // independently to retire one worker without orphaning finalizers
-        // on the dispatcher scope. Closing the dispatcher scope still
-        // cascades through every child scope via the fork link.
-        const workerScope = yield* Scope.fork(state.dispatcherScope, ExecutionStrategy.sequential);
-        const built = yield* makePartitionWorker({
-            key,
-            capacity: state.config.partitionQueueCapacity,
-            handle: state.handle,
-            scope: workerScope,
-            ...(state.logger !== undefined ? { logger: state.logger } : {}),
-            clock: state.clock,
-        });
-        // Insert (or recover the racer's winner). Atomic.
-        const inserted = yield* Ref.modify(state.partitionsRef, (m) => {
-            const present = HashMap.get(m, key);
-            if (Option.isSome(present)) {
-                return [{ kind: "lost-race", winner: present.value }, m];
-            }
-            return [{ kind: "won", winner: built }, HashMap.set(m, key, built)];
-        });
-        if (inserted.kind === "lost-race") {
-            // Discard the redundant worker. Closing its scope cascades to
-            // queue.shutdown + the drain fiber's interrupt, releasing every
-            // resource we just allocated.
-            state.logger?.warn(`appCallback partition allocation lost race (key=${key}); discarding redundant worker`);
-            yield* Scope.close(workerScope, Exit.void).pipe(Effect.catchAllCause(() => Effect.void));
-        }
-        return inserted.winner;
-    });
-}
-/**
- * One reaper tick. Walks the partition map, claiming any worker whose
- * `idleSince._tag === "Idle"` AND whose age exceeds
- * `idlePartitionTtlMs`, then closes each claimed worker's per-worker
- * scope so its queue + drain fiber are torn down via Scope finalizers
- * (no orphan finalizers on the dispatcher scope).
- *
- * Race-safety vs. concurrent offers (single-producer reader fiber):
- *
- *   - The claim decision lives inside `Ref.modify(partitionsRef, …)`.
- *     The lambda is synchronous; idle reads go through
- *     `MutableRef.get` and the claim itself is a synchronous
- *     `MutableRef.set(worker.idleSince, Retiring)` inside the same
- *     lambda. From the producer's perspective the partition-map
- *     removal AND the `Retiring` transition happen as one atomic
- *     step.
- *   - The producer's `worker.offer` is the counter-CAS: it does
- *     `MutableRef.updateAndGet(idleSince, current → Retiring ? current
- *     : Busy)` and refuses to enqueue if it observes `Retiring`. Two
- *     interleavings are possible and both are safe:
- *       - Producer wins first: `idleSince` flips Idle→Busy. Reaper
- *         observes `Busy` (≠ Idle); skips. Producer's `Queue.offer`
- *         lands; drain processes it.
- *       - Reaper wins first: `idleSince` flips Idle→Retiring + map
- *         removal. Producer's `MutableRef.updateAndGet` returns
- *         `Retiring`; producer fails with
- *         `PartitionQueueFullError`. Reader-fiber writes a wire
- *         error response. Server's `Deferred.await` resolves on the
- *         error. No hang.
- *   - There is no third interleaving: the JS event loop cannot
- *     interleave inside a synchronous `Ref.modify` lambda or inside
- *     a synchronous `MutableRef.updateAndGet` call.
- */
-function reapIdlePartitions(state) {
-    return Effect.gen(function* () {
-        const now = state.clock();
-        const ttl = state.config.idlePartitionTtlMs;
-        // Atomic claim + remove. The lambda is synchronous; for each
-        // worker we decide to retire we (a) flip `idleSince` to
-        // `Retiring` so any concurrent `worker.offer` refuses to enqueue,
-        // and (b) drop the entry from the map. The `Ref.modify` commit
-        // makes both visible atomically.
-        const reaped = yield* Ref.modify(state.partitionsRef, (current) => {
-            const removed = [];
-            let next = current;
-            for (const [key, worker] of HashMap.entries(current)) {
-                const idle = MutableRef.get(worker.idleSince);
-                if (idle._tag === "Idle" && now - idle.sinceMs >= ttl) {
-                    MutableRef.set(worker.idleSince, { _tag: "Retiring" });
-                    removed.push(worker);
-                    next = HashMap.remove(next, key);
-                }
-            }
-            return [removed, next];
-        });
-        // Close per-worker scopes outside the `Ref.modify` (Scope.close
-        // yields). Cascading finalizers: queue.shutdown → Stream exits →
-        // drain fiber returns. No leak on the dispatcher scope.
-        for (const worker of reaped) {
-            yield* Scope.close(worker.scope, Exit.void).pipe(Effect.catchAllCause(() => Effect.void));
-        }
-    });
-}
-//# sourceMappingURL=app-callback-partitioned-dispatcher.js.map

package/dist/internal/app-callback-partitioned-dispatcher.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"app-callback-partitioned-dispatcher.js","sourceRoot":"","sources":["../../src/internal/app-callback-partitioned-dispatcher.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAyDG;AACH,OAAO,EACL,KAAK,EACL,QAAQ,EACR,MAAM,EACN,iBAAiB,EACjB,IAAI,EACJ,OAAO,EACP,UAAU,EACV,MAAM,EACN,GAAG,EACH,QAAQ,EACR,KAAK,GACN,MAAM,QAAQ,CAAC;AAEhB,OAAO,EACL,mBAAmB,GAEpB,MAAM,qCAAqC,CAAC;AAC7C,OAAO,EACL,mBAAmB,GAGpB,MAAM,iCAAiC,CAAC;AACzC,OAAO,EACL,mBAAmB,GAGpB,MAAM,oCAAoC,CAAC;AAgC5C,4EAA4E;AAC5E,MAAM,CAAC,MAAM,qCAAqC,GAChD;IACE,aAAa,EAAE,GAAG;IAClB,sBAAsB,EAAE,EAAE;IAC1B,kBAAkB,EAAE,MAAM;IAC1B,oBAAoB,EAAE,KAAK;CAC5B,CAAC;AAoHJ;;;;;;;;;GASG;AACH,MAAM,UAAU,yBAAyB,CACvC,MAAuC;IAEvC,MAAM,MAAM,GAAgC;QAC1C,GAAG,qCAAqC;QACxC,GAAG,MAAM,CAAC,MAAM;KACjB,CAAC;IACF,MAAM,KAAK,GAAG,MAAM,CAAC,KAAK,IAAI,IAAI,CAAC,GAAG,CAAC;IACvC,OAAO,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC;QACzB,MAAM,aAAa,GAAG,KAAK,CAAC,CAAC,GAAG,CAAC,IAAI,CAEnC,OAAO,CAAC,KAAK,EAAE,CAAC,CAAC;QAEnB,MAAM,QAAQ,GAAuB;YACnC,YAAY,EAAE,KAAK,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC;YAChC,cAAc,EAAE,KAAK,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC;YAClC,kBAAkB,EAAE,KAAK,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC;SACvC,CAAC;QAEF,MAAM,eAAe,GAAG,MAAM,CAAC,KAAK,CAAC;QAErC,MAAM,QAAQ,GAA4B;YACxC,aAAa;YACb,eAAe;YACf,MAAM;YACN,MAAM,EAAE,MAAM,CAAC,MAAM;YACrB,GAAG,CAAC,MAAM,CAAC,MAAM,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YACjE,KAAK;YACL,QAAQ;SACT,CAAC;QAEF,mEAAmE;QACnE,2DAA2D;QAC3D,gEAAgE;QAChE,MAAM,YAAY,GAA+B,kBAAkB,CACjE,QAAQ,CACT,CAAC,IAAI,CACJ,MAAM,CAAC,MAAM,CACX,QAAQ,CAAC,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,MAAM,CAAC,oBAAoB,CAAC,CAAC,CAC9D,EACD,MAAM,CAAC,MAAM,EACb,MAAM,CAAC,aAAa,CAAC,CAAC,KAAK,EAAE,EAAE,CAC7B,MAAM,CAAC,IAAI,CAAC,GAAG,EAAE,CACf,MAAM,CAAC,MAAM,EAAE,IAAI,CACjB,gCAAgC,EAChC,KAAK,CAAC,MAAM,CAAC,KAAK,CAAC,CACpB,CACF,CACF,CACF,CAAC;QACF,KAAK,CAAC,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,UAAU,CAAC,YAAY,CAAC,EAAE,eAAe,CAAC,CAAC;QAEtE,MAAM,KAAK,GAAG,CACZ,OAA6B,EACO,EAAE,CACtC,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC;YAClB,KAAK,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,QAAQ,CAAC,YAAY,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAEvD,MAAM,GAAG,GAAG,mBAAmB,CAAC,OAAO,CAAC,CAAC;YAEzC,MAAM,MAAM,GAAG,KAAK,CAAC,CAAC,0BAA0B,CAAC;gBAC/C,GAAG;gBACH,SAAS,EAAE,OAAO,CAAC,EAAE;gBACrB,KAAK,EAAE,QAAQ;aAChB,CAAC,CAAC,IAAI,CACL,MAAM,CAAC,QAAQ,CAAC,CAAC,GAAG,EAAE,EAAE,CACtB,GAAG,YAAY,mBAAmB;gBAChC,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,QAAQ,CAAC,cAAc,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC;gBACnD,CAAC,CAAC,MAAM,CAAC,IAAI,CAChB,CACF,CAAC;YAEF,KAAK,CAAC,CAAC,MAAM;iBACV,KAAK,CAAC,OAAO,CAAC;iBACd,IAAI,CACH,MAAM,CAAC,QAAQ,CAAC,GAAG,EAAE,CACnB,GAAG,CAAC,MAAM,CAAC,QAAQ,CAAC,kBAAkB,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CACtD,CACF,CAAC;QACN,CAAC,CAAC,CAAC;QAEL,MAAM,KAAK,GAAmC,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC;YAChE,MAAM,GAAG,GAAG,KAAK,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,aAAa,CAAC,CAAC;YAC1C,MAAM,UAAU,GAAiD,EAAE,CAAC;YACpE,KAAK,MAAM,CAAC,GAAG,EAAE,MAAM,CAAC,IAAI,OAAO,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC;gBACjD,MAAM,SAAS,GAAG,KAAK,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC;gBAC1C,MAAM,IAAI,GAAG,UAAU,CAAC,GAAG,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,IAAI,KAAK,MAAM,CAAC;gBAC9D,UAAU,CAAC,IAAI,CAAC,EAAE,GAAG,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;YAC5C,CAAC;YACD,MAAM,YAAY,GAAG,KAAK,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,QAAQ,CAAC,YAAY,CAAC,CAAC;YAC3D,MAAM,cAAc,GAAG,KAAK,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,QAAQ,CAAC,cAAc,CAAC,CAAC;YAC/D,MAAM,kBAAkB,GAAG,KAAK,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,QAAQ,CAAC,kBAAkB,CAAC,CAAC;YACvE,OAAO;gBACL,gBAAgB,EAAE,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC;gBACnC,YAAY;gBACZ,aAAa,EAAE;oBACb,cAAc;oBACd,kBAAkB;iBACnB;gBACD,UAAU;aACX,CAAC;QACJ,CAAC,CAAC,CAAC;QAEH,MAAM,QAAQ,GAAwB,KAAK,CAAC,KAAK,CAC/C,eAAe,EACf,IAAI,CAAC,IAAI,CACV,CAAC,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC,GAAG,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC;QAEhD,OAAO;YACL,KAAK;YACL,KAAK;YACL,QAAQ;SACuB,CAAC;IACpC,CAAC,CAAC,CAAC;AACL,CAAC;AAED,wEAAwE;AAExE;;;;;;;;;;;;;;GAcG;AACH,SAAS,0BAA0B,CAAC,MAInC;IACC,OAAO,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC;QACzB,MAAM,EAAE,GAAG,EAAE,SAAS,EAAE,KAAK,EAAE,GAAG,MAAM,CAAC;QACzC,MAAM,QAAQ,GAAG,KAAK,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC,IAAI,CACvD,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CACvC,CAAC;QACF,IAAI,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC;YAC5B,OAAO,QAAQ,CAAC,KAAK,CAAC;QACxB,CAAC;QAED,gEAAgE;QAChE,iEAAiE;QACjE,iEAAiE;QACjE,MAAM,eAAe,GAAG,KAAK,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC,IAAI,CAC9D,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CACnC,CAAC;QACF,IAAI,eAAe,IAAI,KAAK,CAAC,MAAM,CAAC,aAAa,EAAE,CAAC;YAClD,OAAO,KAAK,CAAC,CAAC,MAAM,CAAC,IAAI,CACvB,IAAI,mBAAmB,CAAC;gBACtB,GAAG;gBACH,gBAAgB,EAAE,eAAe;gBACjC,aAAa,EAAE,KAAK,CAAC,MAAM,CAAC,aAAa;gBACzC,SAAS;aACV,CAAC,CACH,CAAC;QACJ,CAAC;QAED,iEAAiE;QACjE,+DAA+D;QAC/D,wDAAwD;QACxD,kEAAkE;QAClE,8DAA8D;QAC9D,wDAAwD;QACxD,MAAM,WAAW,GAAG,KAAK,CAAC,CAAC,KAAK,CAAC,IAAI,CACnC,KAAK,CAAC,eAAe,EACrB,iBAAiB,CAAC,UAAU,CAC7B,CAAC;QACF,MAAM,KAAK,GAAG,KAAK,CAAC,CAAC,mBAAmB,CAAC;YACvC,GAAG;YACH,QAAQ,EAAE,KAAK,CAAC,MAAM,CAAC,sBAAsB;YAC7C,MAAM,EAAE,KAAK,CAAC,MAAM;YACpB,KAAK,EAAE,WAAW;YAClB,GAAG,CAAC,KAAK,CAAC,MAAM,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YAC/D,KAAK,EAAE,KAAK,CAAC,KAAK;SACnB,CAAC,CAAC;QAEH,kDAAkD;QAClD,MAAM,QAAQ,GAAG,KAAK,CAAC,CAAC,GAAG,CAAC,MAAM,CAChC,KAAK,CAAC,aAAa,EACnB,CACE,CAAC,EAID,EAAE;YACF,MAAM,OAAO,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;YACpC,IAAI,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,EAAE,CAAC;gBAC3B,OAAO,CAAC,EAAE,IAAI,EAAE,WAAW,EAAE,MAAM,EAAE,OAAO,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,CAAC;YAC3D,CAAC;YACD,OAAO,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,EAAE,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC,CAAC;QACtE,CAAC,CACF,CAAC;QAEF,IAAI,QAAQ,CAAC,IAAI,KAAK,WAAW,EAAE,CAAC;YAClC,8DAA8D;YAC9D,gEAAgE;YAChE,8BAA8B;YAC9B,KAAK,CAAC,MAAM,EAAE,IAAI,CAChB,mDAAmD,GAAG,gCAAgC,CACvF,CAAC;YACF,KAAK,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,WAAW,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC,IAAI,CAC7C,MAAM,CAAC,aAAa,CAAC,GAAG,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,CACxC,CAAC;QACJ,CAAC;QAED,OAAO,QAAQ,CAAC,MAAM,CAAC;IACzB,CAAC,CAAC,CAAC;AACL,CAAC;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAgCG;AACH,SAAS,kBAAkB,CACzB,KAA8B;IAE9B,OAAO,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC;QACzB,MAAM,GAAG,GAAG,KAAK,CAAC,KAAK,EAAE,CAAC;QAC1B,MAAM,GAAG,GAAG,KAAK,CAAC,MAAM,CAAC,kBAAkB,CAAC;QAE5C,6DAA6D;QAC7D,wDAAwD;QACxD,kEAAkE;QAClE,+DAA+D;QAC/D,iCAAiC;QACjC,MAAM,MAAM,GAAG,KAAK,CAAC,CAAC,GAAG,CAAC,MAAM,CAC9B,KAAK,CAAC,aAAa,EACnB,CACE,OAAO,EAIP,EAAE;YACF,MAAM,OAAO,GAAsB,EAAE,CAAC;YACtC,IAAI,IAAI,GAAG,OAAO,CAAC;YACnB,KAAK,MAAM,CAAC,GAAG,EAAE,MAAM,CAAC,IAAI,OAAO,CAAC,OAAO,CAAC,OAAO,CAAC,EAAE,CAAC;gBACrD,MAAM,IAAI,GAAG,UAAU,CAAC,GAAG,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;gBAC9C,IAAI,IAAI,CAAC,IAAI,KAAK,MAAM,IAAI,GAAG,GAAG,IAAI,CAAC,OAAO,IAAI,GAAG,EAAE,CAAC;oBACtD,UAAU,CAAC,GAAG,CAAC,MAAM,CAAC,SAAS,EAAE,EAAE,IAAI,EAAE,UAAU,EAAW,CAAC,CAAC;oBAChE,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;oBACrB,IAAI,GAAG,OAAO,CAAC,MAAM,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;gBACnC,CAAC;YACH,CAAC;YACD,OAAO,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;QACzB,CAAC,CACF,CAAC;QAEF,gEAAgE;QAChE,iEAAiE;QACjE,wDAAwD;QACxD,KAAK,MAAM,MAAM,IAAI,MAAM,EAAE,CAAC;YAC5B,KAAK,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,KAAK,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC,IAAI,CAC9C,MAAM,CAAC,aAAa,CAAC,GAAG,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,CACxC,CAAC;QACJ,CAAC;IACH,CAAC,CAAC,CAAC;AACL,CAAC"}