@loomwork/event-runtime 0.0.0-stage → 0.1.0

package/dist/ProfilingEventStore.d.ts

@@ -0,0 +1,75 @@
+import type { EventEnvelope } from "@loomwork/core";
+import type { EventStore } from "./types";
+/** Store-side timings, in milliseconds unless stated otherwise. */
+export interface WriteProfile {
+    /** Envelopes durably appended (counting each envelope of a batch). */
+    envelopes: number;
+    /** Calls to `append` plus calls to `appendBatch` — i.e. round-trips. */
+    roundTrips: number;
+    /** Summed wall time inside the store's write calls. */
+    totalWriteMs: number;
+    /** Longest single write call. */
+    maxWriteMs: number;
+    /** Greatest number of write calls in flight at once — the queue the log is absorbing. */
+    peakConcurrentWrites: number;
+    /** Wall time from the first write starting to the last one finishing. */
+    spanMs: number;
+    /** Envelopes per second over `spanMs`. 0 before anything is written. */
+    envelopesPerSec: number;
+}
+/**
+ * Measures what the durable write path actually costs, so a workload can be *profiled*
+ * rather than reasoned about.
+ *
+ * This exists for [ADR 0065](../../../docs/adr/0065-group-commit-deferred-evidence-gate.md)
+ * gate 1, which asks for a real workload where **event-write throughput — not effect
+ * latency, not fold cost — is the measured bottleneck**, and is explicit that a profile is
+ * required rather than intuition. The gate is deliberately hard to satisfy: `ExecutionJournal`
+ * already decouples the interpreter from write latency by queueing appends on a serial
+ * tail, so a workload can write a great deal without writes ever being the constraint.
+ *
+ * Point this at your own application, alongside `effectTimingMiddleware` from
+ * `@loomwork/middleware`, and compare: if effect time dwarfs write time, batching cannot help
+ * you, whatever the raw event rate looks like.
+ *
+ * Zero-cost when unwired — it is a decorator, so a store that is not wrapped is unaffected.
+ */
+export declare class ProfilingEventStore implements EventStore {
+    private readonly inner;
+    readonly head?: NonNullable<EventStore["head"]>;
+    readonly readRange?: NonNullable<EventStore["readRange"]>;
+    readonly acquireFence?: NonNullable<EventStore["acquireFence"]>;
+    readonly acquireFenceIf?: NonNullable<EventStore["acquireFenceIf"]>;
+    readonly appendIfUnchanged?: NonNullable<EventStore["appendIfUnchanged"]>;
+    readonly storeNow?: NonNullable<EventStore["storeNow"]>;
+    readonly sealingCapability?: NonNullable<EventStore["sealingCapability"]>;
+    readonly readAtRest?: NonNullable<EventStore["readAtRest"]>;
+    readonly copyPrefix?: NonNullable<EventStore["copyPrefix"]>;
+    readonly deleteExecution?: NonNullable<EventStore["deleteExecution"]>;
+    readonly deleteThrough?: NonNullable<EventStore["deleteThrough"]>;
+    readonly truncatePrefix?: NonNullable<EventStore["truncatePrefix"]>;
+    readonly truncatePrefixKeeping?: NonNullable<EventStore["truncatePrefixKeeping"]>;
+    readonly listExecutions?: NonNullable<EventStore["listExecutions"]>;
+    readonly listExecutionsPage?: NonNullable<EventStore["listExecutionsPage"]>;
+    readonly appendBatch?: NonNullable<EventStore["appendBatch"]>;
+    private envelopes;
+    private roundTrips;
+    private totalWriteMs;
+    private maxWriteMs;
+    private inFlight;
+    private peakConcurrentWrites;
+    private firstStart;
+    private lastEnd;
+    constructor(inner: EventStore);
+    private timed;
+    append(envelope: EventEnvelope): Promise<void>;
+    /** Snapshot of the write profile so far. */
+    writeProfile(): WriteProfile;
+    /** Discard measurements (e.g. after a warmup phase). */
+    resetProfile(): void;
+    read(executionId: string): Promise<EventEnvelope[]>;
+    readFrom(executionId: string, fromSequence: number): Promise<EventEnvelope[]>;
+    subscribe(executionId: string, handler: (event: EventEnvelope) => void): Promise<() => void>;
+    close(): Promise<void>;
+}
+//# sourceMappingURL=ProfilingEventStore.d.ts.map

package/dist/ProfilingEventStore.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"ProfilingEventStore.d.ts","sourceRoot":"","sources":["../src/ProfilingEventStore.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,gBAAgB,CAAC;AAEpD,OAAO,KAAK,EAAE,UAAU,EAA4B,MAAM,SAAS,CAAC;AAEpE,mEAAmE;AACnE,MAAM,WAAW,YAAY;IAC3B,sEAAsE;IACtE,SAAS,EAAE,MAAM,CAAC;IAClB,wEAAwE;IACxE,UAAU,EAAE,MAAM,CAAC;IACnB,uDAAuD;IACvD,YAAY,EAAE,MAAM,CAAC;IACrB,iCAAiC;IACjC,UAAU,EAAE,MAAM,CAAC;IACnB,yFAAyF;IACzF,oBAAoB,EAAE,MAAM,CAAC;IAC7B,yEAAyE;IACzE,MAAM,EAAE,MAAM,CAAC;IACf,wEAAwE;IACxE,eAAe,EAAE,MAAM,CAAC;CACzB;AAED;;;;;;;;;;;;;;;;GAgBG;AACH,qBAAa,mBAAoB,YAAW,UAAU;IA2BxC,OAAO,CAAC,QAAQ,CAAC,KAAK;IA1BlC,QAAQ,CAAC,IAAI,CAAC,EAAE,WAAW,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC;IAChD,QAAQ,CAAC,SAAS,CAAC,EAAE,WAAW,CAAC,UAAU,CAAC,WAAW,CAAC,CAAC,CAAC;IAC1D,QAAQ,CAAC,YAAY,CAAC,EAAE,WAAW,CAAC,UAAU,CAAC,cAAc,CAAC,CAAC,CAAC;IAChE,QAAQ,CAAC,cAAc,CAAC,EAAE,WAAW,CAAC,UAAU,CAAC,gBAAgB,CAAC,CAAC,CAAC;IACpE,QAAQ,CAAC,iBAAiB,CAAC,EAAE,WAAW,CAAC,UAAU,CAAC,mBAAmB,CAAC,CAAC,CAAC;IAC1E,QAAQ,CAAC,QAAQ,CAAC,EAAE,WAAW,CAAC,UAAU,CAAC,UAAU,CAAC,CAAC,CAAC;IACxD,QAAQ,CAAC,iBAAiB,CAAC,EAAE,WAAW,CAAC,UAAU,CAAC,mBAAmB,CAAC,CAAC,CAAC;IAC1E,QAAQ,CAAC,UAAU,CAAC,EAAE,WAAW,CAAC,UAAU,CAAC,YAAY,CAAC,CAAC,CAAC;IAC5D,QAAQ,CAAC,UAAU,CAAC,EAAE,WAAW,CAAC,UAAU,CAAC,YAAY,CAAC,CAAC,CAAC;IAC5D,QAAQ,CAAC,eAAe,CAAC,EAAE,WAAW,CAAC,UAAU,CAAC,iBAAiB,CAAC,CAAC,CAAC;IACtE,QAAQ,CAAC,aAAa,CAAC,EAAE,WAAW,CAAC,UAAU,CAAC,eAAe,CAAC,CAAC,CAAC;IAClE,QAAQ,CAAC,cAAc,CAAC,EAAE,WAAW,CAAC,UAAU,CAAC,gBAAgB,CAAC,CAAC,CAAC;IACpE,QAAQ,CAAC,qBAAqB,CAAC,EAAE,WAAW,CAAC,UAAU,CAAC,uBAAuB,CAAC,CAAC,CAAC;IAClF,QAAQ,CAAC,cAAc,CAAC,EAAE,WAAW,CAAC,UAAU,CAAC,gBAAgB,CAAC,CAAC,CAAC;IACpE,QAAQ,CAAC,kBAAkB,CAAC,EAAE,WAAW,CAAC,UAAU,CAAC,oBAAoB,CAAC,CAAC,CAAC;IAC5E,QAAQ,CAAC,WAAW,CAAC,EAAE,WAAW,CAAC,UAAU,CAAC,aAAa,CAAC,CAAC,CAAC;IAE9D,OAAO,CAAC,SAAS,CAAK;IACtB,OAAO,CAAC,UAAU,CAAK;IACvB,OAAO,CAAC,YAAY,CAAK;IACzB,OAAO,CAAC,UAAU,CAAK;IACvB,OAAO,CAAC,QAAQ,CAAK;IACrB,OAAO,CAAC,oBAAoB,CAAK;IACjC,OAAO,CAAC,UAAU,CAAqB;IACvC,OAAO,CAAC,OAAO,CAAK;gBAES,KAAK,EAAE,UAAU;YAwBhC,KAAK;IAkBnB,MAAM,CAAC,QAAQ,EAAE,aAAa,GAAG,OAAO,CAAC,IAAI,CAAC;IAI9C,4CAA4C;IAC5C,YAAY,IAAI,YAAY;IAa5B,wDAAwD;IACxD,YAAY,IAAI,IAAI;IAUpB,IAAI,CAAC,WAAW,EAAE,MAAM,GAAG,OAAO,CAAC,aAAa,EAAE,CAAC;IAInD,QAAQ,CAAC,WAAW,EAAE,MAAM,EAAE,YAAY,EAAE,MAAM,GAAG,OAAO,CAAC,aAAa,EAAE,CAAC;IAI7E,SAAS,CAAC,WAAW,EAAE,MAAM,EAAE,OAAO,EAAE,CAAC,KAAK,EAAE,aAAa,KAAK,IAAI,GAAG,OAAO,CAAC,MAAM,IAAI,CAAC;IAI5F,KAAK,IAAI,OAAO,CAAC,IAAI,CAAC;CAGvB"}

package/dist/ProfilingEventStore.js

@@ -0,0 +1,133 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.ProfilingEventStore = void 0;
+const installOptional_1 = require("./installOptional");
+/**
+ * Measures what the durable write path actually costs, so a workload can be *profiled*
+ * rather than reasoned about.
+ *
+ * This exists for [ADR 0065](../../../docs/adr/0065-group-commit-deferred-evidence-gate.md)
+ * gate 1, which asks for a real workload where **event-write throughput — not effect
+ * latency, not fold cost — is the measured bottleneck**, and is explicit that a profile is
+ * required rather than intuition. The gate is deliberately hard to satisfy: `ExecutionJournal`
+ * already decouples the interpreter from write latency by queueing appends on a serial
+ * tail, so a workload can write a great deal without writes ever being the constraint.
+ *
+ * Point this at your own application, alongside `effectTimingMiddleware` from
+ * `@loomwork/middleware`, and compare: if effect time dwarfs write time, batching cannot help
+ * you, whatever the raw event rate looks like.
+ *
+ * Zero-cost when unwired — it is a decorator, so a store that is not wrapped is unaffected.
+ */
+class ProfilingEventStore {
+    inner;
+    head;
+    readRange;
+    acquireFence;
+    acquireFenceIf;
+    appendIfUnchanged;
+    storeNow;
+    sealingCapability;
+    readAtRest;
+    copyPrefix;
+    deleteExecution;
+    deleteThrough;
+    truncatePrefix;
+    truncatePrefixKeeping;
+    listExecutions;
+    listExecutionsPage;
+    appendBatch;
+    envelopes = 0;
+    roundTrips = 0;
+    totalWriteMs = 0;
+    maxWriteMs = 0;
+    inFlight = 0;
+    peakConcurrentWrites = 0;
+    firstStart;
+    lastEnd = 0;
+    constructor(inner) {
+        this.inner = inner;
+        // Only advertise what the inner store has (installOptional's rule), so wrapping never
+        // changes which path a caller takes. Batches are timed like single appends.
+        const plan = {
+            appendBatch: (envelopes) => this.timed(envelopes.length, () => inner.appendBatch(envelopes)),
+            head: "forward",
+            readRange: "forward",
+            acquireFence: "forward",
+            acquireFenceIf: "forward",
+            appendIfUnchanged: "forward",
+            storeNow: "forward",
+            sealingCapability: "forward",
+            readAtRest: "forward",
+            copyPrefix: "forward",
+            deleteExecution: "forward",
+            deleteThrough: "forward",
+            truncatePrefix: "forward",
+            truncatePrefixKeeping: "forward",
+            listExecutions: "forward",
+            listExecutionsPage: "forward",
+        };
+        (0, installOptional_1.installOptional)(this, inner, plan);
+    }
+    async timed(envelopes, run) {
+        const started = performance.now();
+        if (this.firstStart === undefined)
+            this.firstStart = started;
+        this.inFlight++;
+        if (this.inFlight > this.peakConcurrentWrites)
+            this.peakConcurrentWrites = this.inFlight;
+        try {
+            await run();
+        }
+        finally {
+            const elapsed = performance.now() - started;
+            this.inFlight--;
+            this.roundTrips++;
+            this.envelopes += envelopes;
+            this.totalWriteMs += elapsed;
+            if (elapsed > this.maxWriteMs)
+                this.maxWriteMs = elapsed;
+            this.lastEnd = performance.now();
+        }
+    }
+    append(envelope) {
+        return this.timed(1, () => this.inner.append(envelope));
+    }
+    /** Snapshot of the write profile so far. */
+    writeProfile() {
+        const spanMs = this.firstStart === undefined ? 0 : this.lastEnd - this.firstStart;
+        return {
+            envelopes: this.envelopes,
+            roundTrips: this.roundTrips,
+            totalWriteMs: this.totalWriteMs,
+            maxWriteMs: this.maxWriteMs,
+            peakConcurrentWrites: this.peakConcurrentWrites,
+            spanMs,
+            envelopesPerSec: spanMs > 0 ? (this.envelopes / spanMs) * 1000 : 0,
+        };
+    }
+    /** Discard measurements (e.g. after a warmup phase). */
+    resetProfile() {
+        this.envelopes = 0;
+        this.roundTrips = 0;
+        this.totalWriteMs = 0;
+        this.maxWriteMs = 0;
+        this.peakConcurrentWrites = 0;
+        this.firstStart = undefined;
+        this.lastEnd = 0;
+    }
+    read(executionId) {
+        return this.inner.read(executionId);
+    }
+    readFrom(executionId, fromSequence) {
+        return this.inner.readFrom(executionId, fromSequence);
+    }
+    subscribe(executionId, handler) {
+        return this.inner.subscribe(executionId, handler);
+    }
+    close() {
+        return this.inner.close();
+    }
+}
+exports.ProfilingEventStore = ProfilingEventStore;
+//# sourceMappingURL=ProfilingEventStore.js.map

package/dist/ProfilingEventStore.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"ProfilingEventStore.js","sourceRoot":"","sources":["../src/ProfilingEventStore.ts"],"names":[],"mappings":";;;AACA,uDAAwE;AAqBxE;;;;;;;;;;;;;;;;GAgBG;AACH,MAAa,mBAAmB;IA2BD;IA1BpB,IAAI,CAAmC;IACvC,SAAS,CAAwC;IACjD,YAAY,CAA2C;IACvD,cAAc,CAA6C;IAC3D,iBAAiB,CAAgD;IACjE,QAAQ,CAAuC;IAC/C,iBAAiB,CAAgD;IACjE,UAAU,CAAyC;IACnD,UAAU,CAAyC;IACnD,eAAe,CAA8C;IAC7D,aAAa,CAA4C;IACzD,cAAc,CAA6C;IAC3D,qBAAqB,CAAoD;IACzE,cAAc,CAA6C;IAC3D,kBAAkB,CAAiD;IACnE,WAAW,CAA0C;IAEtD,SAAS,GAAG,CAAC,CAAC;IACd,UAAU,GAAG,CAAC,CAAC;IACf,YAAY,GAAG,CAAC,CAAC;IACjB,UAAU,GAAG,CAAC,CAAC;IACf,QAAQ,GAAG,CAAC,CAAC;IACb,oBAAoB,GAAG,CAAC,CAAC;IACzB,UAAU,CAAqB;IAC/B,OAAO,GAAG,CAAC,CAAC;IAEpB,YAA6B,KAAiB;QAAjB,UAAK,GAAL,KAAK,CAAY;QAC5C,sFAAsF;QACtF,4EAA4E;QAC5E,MAAM,IAAI,GAAG;YACX,WAAW,EAAE,CAAC,SAAS,EAAE,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,MAAM,EAAE,GAAG,EAAE,CAAC,KAAK,CAAC,WAAY,CAAC,SAAS,CAAC,CAAC;YAC7F,IAAI,EAAE,SAAS;YACf,SAAS,EAAE,SAAS;YACpB,YAAY,EAAE,SAAS;YACvB,cAAc,EAAE,SAAS;YACzB,iBAAiB,EAAE,SAAS;YAC5B,QAAQ,EAAE,SAAS;YACnB,iBAAiB,EAAE,SAAS;YAC5B,UAAU,EAAE,SAAS;YACrB,UAAU,EAAE,SAAS;YACrB,eAAe,EAAE,SAAS;YAC1B,aAAa,EAAE,SAAS;YACxB,cAAc,EAAE,SAAS;YACzB,qBAAqB,EAAE,SAAS;YAChC,cAAc,EAAE,SAAS;YACzB,kBAAkB,EAAE,SAAS;SACgC,CAAC;QAChE,IAAA,iCAAe,EAAuC,IAAI,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC;IAC3E,CAAC;IAEO,KAAK,CAAC,KAAK,CAAC,SAAiB,EAAE,GAAwB;QAC7D,MAAM,OAAO,GAAG,WAAW,CAAC,GAAG,EAAE,CAAC;QAClC,IAAI,IAAI,CAAC,UAAU,KAAK,SAAS;YAAE,IAAI,CAAC,UAAU,GAAG,OAAO,CAAC;QAC7D,IAAI,CAAC,QAAQ,EAAE,CAAC;QAChB,IAAI,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,oBAAoB;YAAE,IAAI,CAAC,oBAAoB,GAAG,IAAI,CAAC,QAAQ,CAAC;QACzF,IAAI,CAAC;YACH,MAAM,GAAG,EAAE,CAAC;QACd,CAAC;gBAAS,CAAC;YACT,MAAM,OAAO,GAAG,WAAW,CAAC,GAAG,EAAE,GAAG,OAAO,CAAC;YAC5C,IAAI,CAAC,QAAQ,EAAE,CAAC;YAChB,IAAI,CAAC,UAAU,EAAE,CAAC;YAClB,IAAI,CAAC,SAAS,IAAI,SAAS,CAAC;YAC5B,IAAI,CAAC,YAAY,IAAI,OAAO,CAAC;YAC7B,IAAI,OAAO,GAAG,IAAI,CAAC,UAAU;gBAAE,IAAI,CAAC,UAAU,GAAG,OAAO,CAAC;YACzD,IAAI,CAAC,OAAO,GAAG,WAAW,CAAC,GAAG,EAAE,CAAC;QACnC,CAAC;IACH,CAAC;IAED,MAAM,CAAC,QAAuB;QAC5B,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC;IAC1D,CAAC;IAED,4CAA4C;IAC5C,YAAY;QACV,MAAM,MAAM,GAAG,IAAI,CAAC,UAAU,KAAK,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,UAAU,CAAC;QAClF,OAAO;YACL,SAAS,EAAE,IAAI,CAAC,SAAS;YACzB,UAAU,EAAE,IAAI,CAAC,UAAU;YAC3B,YAAY,EAAE,IAAI,CAAC,YAAY;YAC/B,UAAU,EAAE,IAAI,CAAC,UAAU;YAC3B,oBAAoB,EAAE,IAAI,CAAC,oBAAoB;YAC/C,MAAM;YACN,eAAe,EAAE,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,GAAG,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;SACnE,CAAC;IACJ,CAAC;IAED,wDAAwD;IACxD,YAAY;QACV,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC;QACnB,IAAI,CAAC,UAAU,GAAG,CAAC,CAAC;QACpB,IAAI,CAAC,YAAY,GAAG,CAAC,CAAC;QACtB,IAAI,CAAC,UAAU,GAAG,CAAC,CAAC;QACpB,IAAI,CAAC,oBAAoB,GAAG,CAAC,CAAC;QAC9B,IAAI,CAAC,UAAU,GAAG,SAAS,CAAC;QAC5B,IAAI,CAAC,OAAO,GAAG,CAAC,CAAC;IACnB,CAAC;IAED,IAAI,CAAC,WAAmB;QACtB,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;IACtC,CAAC;IAED,QAAQ,CAAC,WAAmB,EAAE,YAAoB;QAChD,OAAO,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,WAAW,EAAE,YAAY,CAAC,CAAC;IACxD,CAAC;IAED,SAAS,CAAC,WAAmB,EAAE,OAAuC;QACpE,OAAO,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,WAAW,EAAE,OAAO,CAAC,CAAC;IACpD,CAAC;IAED,KAAK;QACH,OAAO,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;IAC5B,CAAC;CACF;AAjHD,kDAiHC"}

package/dist/ShardPlan.d.ts

@@ -0,0 +1,87 @@
+/**
+ * Where a bucket's executions live.
+ *
+ * `migrating` is the whole point of the plan: a bucket can be *in the process of* moving
+ * without anything being blocked or copied, because the store resolves per execution which
+ * side actually holds it.
+ */
+export type ShardPlacement = {
+    readonly kind: "settled";
+    readonly shard: number;
+} | {
+    readonly kind: "migrating";
+    readonly from: number;
+    readonly to: number;
+};
+/** Serialized form. Every node sharing a log MUST load the same plan. */
+export interface ShardPlanJSON {
+    readonly version: 1;
+    readonly shardCount: number;
+    readonly placements: ReadonlyArray<{
+        shard: number;
+    } | {
+        from: number;
+        to: number;
+    }>;
+}
+/** Default virtual-bucket count. Power of two, comfortably above any realistic shard count. */
+export declare const DEFAULT_BUCKETS = 4096;
+/**
+ * An explicit, persistable map from virtual bucket to shard — the thing that makes a
+ * sharded log **rebalanceable** (ADR 0075).
+ *
+ * Without it, routing is `hash(executionId) % shardCount`, and changing the shard count
+ * re-routes almost every execution at once: reads land on a shard that has never seen the
+ * data. That is not a rebalance, it is data loss with extra steps.
+ *
+ * Two things fix that, and this class is both:
+ *
+ * 1. **Virtual buckets.** Executions hash to one of `buckets` (default 4096), and buckets
+ *    are assigned to shards by an explicit table. Growing from N to N+1 shards moves
+ *    roughly `1/(N+1)` of the buckets instead of nearly all of them.
+ * 2. **A `migrating` state per bucket.** A bucket being moved names both sides, so the
+ *    store can keep serving reads and writes for executions that still live on the source
+ *    while new ones start on the destination.
+ *
+ * The plan is **immutable** — every mutation returns a new plan. It is a value that
+ * multiple nodes must agree on, so it wants to be compared, persisted, and shipped around,
+ * not mutated in place.
+ */
+export declare class ShardPlan {
+    readonly shardCount: number;
+    private readonly placements;
+    private constructor();
+    /** Buckets spread round-robin over `shardCount` shards, all settled. */
+    static uniform(shardCount: number, buckets?: number): ShardPlan;
+    static fromJSON(json: ShardPlanJSON): ShardPlan;
+    toJSON(): ShardPlanJSON;
+    get buckets(): number;
+    /** No bucket is mid-move. */
+    get isStable(): boolean;
+    bucketFor(executionId: string): number;
+    placementAt(bucket: number): ShardPlacement;
+    placementFor(executionId: string): ShardPlacement;
+    /** Buckets currently mid-move, in ascending order. */
+    migratingBuckets(): number[];
+    /**
+     * Re-spread buckets over `shardCount` shards, marking every bucket whose owner changes as
+     * `migrating(old → new)`. Nothing is copied — the returned plan is only a routing
+     * decision. Executions already on the source keep being served there; new ones start on
+     * the destination. See {@link ShardedEventStore.migrateExecution} to actually move data,
+     * and {@link settled} to finish a bucket.
+     *
+     * Refuses to re-plan while a migration is outstanding: layering a second move over an
+     * unfinished one would produce a bucket whose executions are spread over three shards,
+     * which nothing here can resolve. Settle first.
+     */
+    rebalanced(shardCount: number, options?: {
+        allowShrink?: boolean;
+    }): ShardPlan;
+    /** Mark a migrating bucket as finished, owned by its destination. */
+    settled(bucket: number): ShardPlan;
+    /** Mark every migrating bucket settled. Only safe once their data has actually moved. */
+    settledAll(): ShardPlan;
+    /** Every shard index the plan can route to — used to validate against a store's shards. */
+    private assertValid;
+}
+//# sourceMappingURL=ShardPlan.d.ts.map

package/dist/ShardPlan.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"ShardPlan.d.ts","sourceRoot":"","sources":["../src/ShardPlan.ts"],"names":[],"mappings":"AAEA;;;;;;GAMG;AACH,MAAM,MAAM,cAAc,GACtB;IAAE,QAAQ,CAAC,IAAI,EAAE,SAAS,CAAC;IAAC,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAA;CAAE,GACpD;IAAE,QAAQ,CAAC,IAAI,EAAE,WAAW,CAAC;IAAC,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IAAC,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAA;CAAE,CAAC;AAE/E,yEAAyE;AACzE,MAAM,WAAW,aAAa;IAC5B,QAAQ,CAAC,OAAO,EAAE,CAAC,CAAC;IACpB,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;IAC5B,QAAQ,CAAC,UAAU,EAAE,aAAa,CAAC;QAAE,KAAK,EAAE,MAAM,CAAA;KAAE,GAAG;QAAE,IAAI,EAAE,MAAM,CAAC;QAAC,EAAE,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC;CACtF;AAED,+FAA+F;AAC/F,eAAO,MAAM,eAAe,OAAO,CAAC;AAEpC;;;;;;;;;;;;;;;;;;;;GAoBG;AACH,qBAAa,SAAS;IAElB,QAAQ,CAAC,UAAU,EAAE,MAAM;IAC3B,OAAO,CAAC,QAAQ,CAAC,UAAU;IAF7B,OAAO;IAKP,wEAAwE;IACxE,MAAM,CAAC,OAAO,CAAC,UAAU,EAAE,MAAM,EAAE,OAAO,GAAE,MAAwB,GAAG,SAAS;IAahF,MAAM,CAAC,QAAQ,CAAC,IAAI,EAAE,aAAa,GAAG,SAAS;IAa/C,MAAM,IAAI,aAAa;IAUvB,IAAI,OAAO,IAAI,MAAM,CAEpB;IAED,6BAA6B;IAC7B,IAAI,QAAQ,IAAI,OAAO,CAEtB;IAED,SAAS,CAAC,WAAW,EAAE,MAAM,GAAG,MAAM;IAItC,WAAW,CAAC,MAAM,EAAE,MAAM,GAAG,cAAc;IAM3C,YAAY,CAAC,WAAW,EAAE,MAAM,GAAG,cAAc;IAIjD,sDAAsD;IACtD,gBAAgB,IAAI,MAAM,EAAE;IAQ5B;;;;;;;;;;OAUG;IACH,UAAU,CAAC,UAAU,EAAE,MAAM,EAAE,OAAO,GAAE;QAAE,WAAW,CAAC,EAAE,OAAO,CAAA;KAAO,GAAG,SAAS;IAwElF,qEAAqE;IACrE,OAAO,CAAC,MAAM,EAAE,MAAM,GAAG,SAAS;IAQlC,yFAAyF;IACzF,UAAU,IAAI,SAAS;IAQvB,2FAA2F;IAC3F,OAAO,CAAC,WAAW;CAapB"}

package/dist/ShardPlan.js

@@ -0,0 +1,193 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.ShardPlan = exports.DEFAULT_BUCKETS = void 0;
+const SubscriberRegistry_1 = require("./SubscriberRegistry");
+/** Default virtual-bucket count. Power of two, comfortably above any realistic shard count. */
+exports.DEFAULT_BUCKETS = 4096;
+/**
+ * An explicit, persistable map from virtual bucket to shard — the thing that makes a
+ * sharded log **rebalanceable** (ADR 0075).
+ *
+ * Without it, routing is `hash(executionId) % shardCount`, and changing the shard count
+ * re-routes almost every execution at once: reads land on a shard that has never seen the
+ * data. That is not a rebalance, it is data loss with extra steps.
+ *
+ * Two things fix that, and this class is both:
+ *
+ * 1. **Virtual buckets.** Executions hash to one of `buckets` (default 4096), and buckets
+ *    are assigned to shards by an explicit table. Growing from N to N+1 shards moves
+ *    roughly `1/(N+1)` of the buckets instead of nearly all of them.
+ * 2. **A `migrating` state per bucket.** A bucket being moved names both sides, so the
+ *    store can keep serving reads and writes for executions that still live on the source
+ *    while new ones start on the destination.
+ *
+ * The plan is **immutable** — every mutation returns a new plan. It is a value that
+ * multiple nodes must agree on, so it wants to be compared, persisted, and shipped around,
+ * not mutated in place.
+ */
+class ShardPlan {
+    shardCount;
+    placements;
+    constructor(shardCount, placements) {
+        this.shardCount = shardCount;
+        this.placements = placements;
+    }
+    /** Buckets spread round-robin over `shardCount` shards, all settled. */
+    static uniform(shardCount, buckets = exports.DEFAULT_BUCKETS) {
+        if (shardCount < 1)
+            throw new Error("ShardPlan requires at least one shard");
+        if (buckets < shardCount) {
+            throw new Error(`ShardPlan needs at least as many buckets as shards (buckets=${buckets}, shards=${shardCount})`);
+        }
+        return new ShardPlan(shardCount, Array.from({ length: buckets }, (_, b) => ({ kind: "settled", shard: b % shardCount })));
+    }
+    static fromJSON(json) {
+        if (json.version !== 1)
+            throw new Error(`unsupported ShardPlan version ${json.version}`);
+        const placements = json.placements.map((p) => "shard" in p
+            ? { kind: "settled", shard: p.shard }
+            : { kind: "migrating", from: p.from, to: p.to });
+        const plan = new ShardPlan(json.shardCount, placements);
+        plan.assertValid();
+        return plan;
+    }
+    toJSON() {
+        return {
+            version: 1,
+            shardCount: this.shardCount,
+            placements: this.placements.map((p) => p.kind === "settled" ? { shard: p.shard } : { from: p.from, to: p.to }),
+        };
+    }
+    get buckets() {
+        return this.placements.length;
+    }
+    /** No bucket is mid-move. */
+    get isStable() {
+        return this.placements.every((p) => p.kind === "settled");
+    }
+    bucketFor(executionId) {
+        return (0, SubscriberRegistry_1.bucketOf)(executionId, this.placements.length);
+    }
+    placementAt(bucket) {
+        const placement = this.placements[bucket];
+        if (placement === undefined)
+            throw new Error(`bucket ${bucket} is out of range`);
+        return placement;
+    }
+    placementFor(executionId) {
+        return this.placementAt(this.bucketFor(executionId));
+    }
+    /** Buckets currently mid-move, in ascending order. */
+    migratingBuckets() {
+        const out = [];
+        for (let b = 0; b < this.placements.length; b++) {
+            if (this.placements[b].kind === "migrating")
+                out.push(b);
+        }
+        return out;
+    }
+    /**
+     * Re-spread buckets over `shardCount` shards, marking every bucket whose owner changes as
+     * `migrating(old → new)`. Nothing is copied — the returned plan is only a routing
+     * decision. Executions already on the source keep being served there; new ones start on
+     * the destination. See {@link ShardedEventStore.migrateExecution} to actually move data,
+     * and {@link settled} to finish a bucket.
+     *
+     * Refuses to re-plan while a migration is outstanding: layering a second move over an
+     * unfinished one would produce a bucket whose executions are spread over three shards,
+     * which nothing here can resolve. Settle first.
+     */
+    rebalanced(shardCount, options = {}) {
+        if (shardCount < 1)
+            throw new Error("ShardPlan requires at least one shard");
+        if (!this.isStable) {
+            throw new Error(`cannot rebalance while ${this.migratingBuckets().length} bucket(s) are still migrating — settle them first`);
+        }
+        if (shardCount < this.shardCount && options.allowShrink !== true) {
+            throw new Error(`rebalancing ${this.shardCount} → ${shardCount} shards removes capacity; pass { allowShrink: true } if that is intended`);
+        }
+        if (this.placements.length < shardCount) {
+            throw new Error(`ShardPlan needs at least as many buckets as shards (buckets=${this.placements.length}, shards=${shardCount})`);
+        }
+        // MINIMAL MOVEMENT. The naive assignment — `bucket % shardCount` — throws away the
+        // existing layout and rehashes everything: measured, growing 4→5 shards moves 80% of
+        // buckets and 8→9 moves 89%, which is barely better than the `hash % shardCount`
+        // routing virtual buckets exist to escape.
+        //
+        // Instead: keep every bucket where it is, and move only the EXCESS from shards that now
+        // hold more than their fair share onto shards that hold less. That moves ~1/newCount of
+        // buckets, which is the theoretical minimum for a uniform target.
+        const total = this.placements.length;
+        const base = Math.floor(total / shardCount);
+        const remainder = total % shardCount;
+        // The first `remainder` shards carry one extra bucket, so the targets sum to `total`.
+        const targetFor = (shard) => base + (shard < remainder ? 1 : 0);
+        const heldBy = new Map();
+        for (const [bucket, placement] of this.placements.entries()) {
+            const shard = placement.shard;
+            const list = heldBy.get(shard);
+            if (list === undefined)
+                heldBy.set(shard, [bucket]);
+            else
+                list.push(bucket);
+        }
+        const owner = this.placements.map((p) => p.shard);
+        const orphans = [];
+        const kept = new Map();
+        for (const [shard, list] of heldBy) {
+            if (shard >= shardCount) {
+                // The shard is going away entirely (a shrink); everything it holds must move.
+                orphans.push(...list);
+                continue;
+            }
+            const target = targetFor(shard);
+            kept.set(shard, Math.min(list.length, target));
+            if (list.length > target)
+                orphans.push(...list.slice(target));
+        }
+        // Vacancies, in shard order, so the assignment is deterministic across nodes.
+        const vacancies = [];
+        for (let shard = 0; shard < shardCount; shard++) {
+            const have = kept.get(shard) ?? 0;
+            for (let i = have; i < targetFor(shard); i++)
+                vacancies.push(shard);
+        }
+        for (const [i, bucket] of orphans.entries()) {
+            owner[bucket] = vacancies[i];
+        }
+        const next = this.placements.map((current, bucket) => {
+            const from = current.shard;
+            const to = owner[bucket];
+            return from === to ? { kind: "settled", shard: to } : { kind: "migrating", from, to };
+        });
+        return new ShardPlan(shardCount, next);
+    }
+    /** Mark a migrating bucket as finished, owned by its destination. */
+    settled(bucket) {
+        const placement = this.placementAt(bucket);
+        if (placement.kind === "settled")
+            return this;
+        const next = [...this.placements];
+        next[bucket] = { kind: "settled", shard: placement.to };
+        return new ShardPlan(this.shardCount, next);
+    }
+    /** Mark every migrating bucket settled. Only safe once their data has actually moved. */
+    settledAll() {
+        if (this.isStable)
+            return this;
+        return new ShardPlan(this.shardCount, this.placements.map((p) => (p.kind === "settled" ? p : { kind: "settled", shard: p.to })));
+    }
+    /** Every shard index the plan can route to — used to validate against a store's shards. */
+    assertValid() {
+        for (const [bucket, placement] of this.placements.entries()) {
+            const refs = placement.kind === "settled" ? [placement.shard] : [placement.from, placement.to];
+            for (const shard of refs) {
+                if (!Number.isInteger(shard) || shard < 0 || shard >= this.shardCount) {
+                    throw new Error(`ShardPlan bucket ${bucket} references shard ${shard}, outside 0..${this.shardCount - 1}`);
+                }
+            }
+        }
+    }
+}
+exports.ShardPlan = ShardPlan;
+//# sourceMappingURL=ShardPlan.js.map

package/dist/ShardPlan.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"ShardPlan.js","sourceRoot":"","sources":["../src/ShardPlan.ts"],"names":[],"mappings":";;;AAAA,6DAAgD;AAoBhD,+FAA+F;AAClF,QAAA,eAAe,GAAG,IAAI,CAAC;AAEpC;;;;;;;;;;;;;;;;;;;;GAoBG;AACH,MAAa,SAAS;IAET;IACQ;IAFnB,YACW,UAAkB,EACV,UAAqC;QAD7C,eAAU,GAAV,UAAU,CAAQ;QACV,eAAU,GAAV,UAAU,CAA2B;IACrD,CAAC;IAEJ,wEAAwE;IACxE,MAAM,CAAC,OAAO,CAAC,UAAkB,EAAE,UAAkB,uBAAe;QAClE,IAAI,UAAU,GAAG,CAAC;YAAE,MAAM,IAAI,KAAK,CAAC,uCAAuC,CAAC,CAAC;QAC7E,IAAI,OAAO,GAAG,UAAU,EAAE,CAAC;YACzB,MAAM,IAAI,KAAK,CACb,+DAA+D,OAAO,YAAY,UAAU,GAAG,CAChG,CAAC;QACJ,CAAC;QACD,OAAO,IAAI,SAAS,CAClB,UAAU,EACV,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,OAAO,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,SAAS,EAAE,KAAK,EAAE,CAAC,GAAG,UAAU,EAAE,CAAC,CAAC,CACxF,CAAC;IACJ,CAAC;IAED,MAAM,CAAC,QAAQ,CAAC,IAAmB;QACjC,IAAI,IAAI,CAAC,OAAO,KAAK,CAAC;YAAE,MAAM,IAAI,KAAK,CAAC,iCAAiC,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC;QACzF,MAAM,UAAU,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,CACpC,CAAC,CAAC,EAAkB,EAAE,CACpB,OAAO,IAAI,CAAC;YACV,CAAC,CAAC,EAAE,IAAI,EAAE,SAAS,EAAE,KAAK,EAAE,CAAC,CAAC,KAAK,EAAE;YACrC,CAAC,CAAC,EAAE,IAAI,EAAE,WAAW,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,CACpD,CAAC;QACF,MAAM,IAAI,GAAG,IAAI,SAAS,CAAC,IAAI,CAAC,UAAU,EAAE,UAAU,CAAC,CAAC;QACxD,IAAI,CAAC,WAAW,EAAE,CAAC;QACnB,OAAO,IAAI,CAAC;IACd,CAAC;IAED,MAAM;QACJ,OAAO;YACL,OAAO,EAAE,CAAC;YACV,UAAU,EAAE,IAAI,CAAC,UAAU;YAC3B,UAAU,EAAE,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CACpC,CAAC,CAAC,IAAI,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,CACvE;SACF,CAAC;IACJ,CAAC;IAED,IAAI,OAAO;QACT,OAAO,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC;IAChC,CAAC;IAED,6BAA6B;IAC7B,IAAI,QAAQ;QACV,OAAO,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,SAAS,CAAC,CAAC;IAC5D,CAAC;IAED,SAAS,CAAC,WAAmB;QAC3B,OAAO,IAAA,6BAAQ,EAAC,WAAW,EAAE,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;IACvD,CAAC;IAED,WAAW,CAAC,MAAc;QACxB,MAAM,SAAS,GAAG,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;QAC1C,IAAI,SAAS,KAAK,SAAS;YAAE,MAAM,IAAI,KAAK,CAAC,UAAU,MAAM,kBAAkB,CAAC,CAAC;QACjF,OAAO,SAAS,CAAC;IACnB,CAAC;IAED,YAAY,CAAC,WAAmB;QAC9B,OAAO,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,SAAS,CAAC,WAAW,CAAC,CAAC,CAAC;IACvD,CAAC;IAED,sDAAsD;IACtD,gBAAgB;QACd,MAAM,GAAG,GAAa,EAAE,CAAC;QACzB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAChD,IAAK,IAAI,CAAC,UAAU,CAAC,CAAC,CAAoB,CAAC,IAAI,KAAK,WAAW;gBAAE,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC/E,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IAED;;;;;;;;;;OAUG;IACH,UAAU,CAAC,UAAkB,EAAE,UAAqC,EAAE;QACpE,IAAI,UAAU,GAAG,CAAC;YAAE,MAAM,IAAI,KAAK,CAAC,uCAAuC,CAAC,CAAC;QAC7E,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC;YACnB,MAAM,IAAI,KAAK,CACb,0BAA0B,IAAI,CAAC,gBAAgB,EAAE,CAAC,MAAM,oDAAoD,CAC7G,CAAC;QACJ,CAAC;QACD,IAAI,UAAU,GAAG,IAAI,CAAC,UAAU,IAAI,OAAO,CAAC,WAAW,KAAK,IAAI,EAAE,CAAC;YACjE,MAAM,IAAI,KAAK,CACb,eAAe,IAAI,CAAC,UAAU,MAAM,UAAU,0EAA0E,CACzH,CAAC;QACJ,CAAC;QACD,IAAI,IAAI,CAAC,UAAU,CAAC,MAAM,GAAG,UAAU,EAAE,CAAC;YACxC,MAAM,IAAI,KAAK,CACb,+DAA+D,IAAI,CAAC,UAAU,CAAC,MAAM,YAAY,UAAU,GAAG,CAC/G,CAAC;QACJ,CAAC;QAED,mFAAmF;QACnF,qFAAqF;QACrF,iFAAiF;QACjF,2CAA2C;QAC3C,EAAE;QACF,wFAAwF;QACxF,wFAAwF;QACxF,kEAAkE;QAClE,MAAM,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC;QACrC,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,UAAU,CAAC,CAAC;QAC5C,MAAM,SAAS,GAAG,KAAK,GAAG,UAAU,CAAC;QACrC,sFAAsF;QACtF,MAAM,SAAS,GAAG,CAAC,KAAa,EAAU,EAAE,CAAC,IAAI,GAAG,CAAC,KAAK,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAEhF,MAAM,MAAM,GAAG,IAAI,GAAG,EAAoB,CAAC;QAC3C,KAAK,MAAM,CAAC,MAAM,EAAE,SAAS,CAAC,IAAI,IAAI,CAAC,UAAU,CAAC,OAAO,EAAE,EAAE,CAAC;YAC5D,MAAM,KAAK,GAAI,SAA+B,CAAC,KAAK,CAAC;YACrD,MAAM,IAAI,GAAG,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;YAC/B,IAAI,IAAI,KAAK,SAAS;gBAAE,MAAM,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC;;gBAC/C,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACzB,CAAC;QAED,MAAM,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAE,CAAuB,CAAC,KAAK,CAAC,CAAC;QACzE,MAAM,OAAO,GAAa,EAAE,CAAC;QAC7B,MAAM,IAAI,GAAG,IAAI,GAAG,EAAkB,CAAC;QACvC,KAAK,MAAM,CAAC,KAAK,EAAE,IAAI,CAAC,IAAI,MAAM,EAAE,CAAC;YACnC,IAAI,KAAK,IAAI,UAAU,EAAE,CAAC;gBACxB,8EAA8E;gBAC9E,OAAO,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,CAAC;gBACtB,SAAS;YACX,CAAC;YACD,MAAM,MAAM,GAAG,SAAS,CAAC,KAAK,CAAC,CAAC;YAChC,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC;YAC/C,IAAI,IAAI,CAAC,MAAM,GAAG,MAAM;gBAAE,OAAO,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC;QAChE,CAAC;QAED,8EAA8E;QAC9E,MAAM,SAAS,GAAa,EAAE,CAAC;QAC/B,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,UAAU,EAAE,KAAK,EAAE,EAAE,CAAC;YAChD,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;YAClC,KAAK,IAAI,CAAC,GAAG,IAAI,EAAE,CAAC,GAAG,SAAS,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE;gBAAE,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACtE,CAAC;QACD,KAAK,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,IAAI,OAAO,CAAC,OAAO,EAAE,EAAE,CAAC;YAC5C,KAAK,CAAC,MAAM,CAAC,GAAG,SAAS,CAAC,CAAC,CAAW,CAAC;QACzC,CAAC;QAED,MAAM,IAAI,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,OAAO,EAAE,MAAM,EAAkB,EAAE;YACnE,MAAM,IAAI,GAAI,OAA6B,CAAC,KAAK,CAAC;YAClD,MAAM,EAAE,GAAG,KAAK,CAAC,MAAM,CAAW,CAAC;YACnC,OAAO,IAAI,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,SAAS,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,WAAW,EAAE,IAAI,EAAE,EAAE,EAAE,CAAC;QACxF,CAAC,CAAC,CAAC;QACH,OAAO,IAAI,SAAS,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC;IACzC,CAAC;IAED,qEAAqE;IACrE,OAAO,CAAC,MAAc;QACpB,MAAM,SAAS,GAAG,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;QAC3C,IAAI,SAAS,CAAC,IAAI,KAAK,SAAS;YAAE,OAAO,IAAI,CAAC;QAC9C,MAAM,IAAI,GAAG,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC;QAClC,IAAI,CAAC,MAAM,CAAC,GAAG,EAAE,IAAI,EAAE,SAAS,EAAE,KAAK,EAAE,SAAS,CAAC,EAAE,EAAE,CAAC;QACxD,OAAO,IAAI,SAAS,CAAC,IAAI,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC;IAC9C,CAAC;IAED,yFAAyF;IACzF,UAAU;QACR,IAAI,IAAI,CAAC,QAAQ;YAAE,OAAO,IAAI,CAAC;QAC/B,OAAO,IAAI,SAAS,CAClB,IAAI,CAAC,UAAU,EACf,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,KAAK,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,SAAS,EAAE,KAAK,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAC1F,CAAC;IACJ,CAAC;IAED,2FAA2F;IACnF,WAAW;QACjB,KAAK,MAAM,CAAC,MAAM,EAAE,SAAS,CAAC,IAAI,IAAI,CAAC,UAAU,CAAC,OAAO,EAAE,EAAE,CAAC;YAC5D,MAAM,IAAI,GACR,SAAS,CAAC,IAAI,KAAK,SAAS,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,IAAI,EAAE,SAAS,CAAC,EAAE,CAAC,CAAC;YACpF,KAAK,MAAM,KAAK,IAAI,IAAI,EAAE,CAAC;gBACzB,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,IAAI,KAAK,GAAG,CAAC,IAAI,KAAK,IAAI,IAAI,CAAC,UAAU,EAAE,CAAC;oBACtE,MAAM,IAAI,KAAK,CACb,oBAAoB,MAAM,qBAAqB,KAAK,gBAAgB,IAAI,CAAC,UAAU,GAAG,CAAC,EAAE,CAC1F,CAAC;gBACJ,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;CACF;AA9LD,8BA8LC"}