@opendatalabs/personal-server-ts-core 1.34.1 → 1.35.0

package/dist/replication/coordinator.js

@@ -0,0 +1,499 @@
+import { retryFromError, } from "./outcome.js";
+import { settleReplicaWork, } from "./schedule.js";
+const isPromiseLike = (value) => typeof value === "object" &&
+    value !== null &&
+    typeof value.then === "function";
+/** Continue with `next` now when `value` is plain, after it when a promise. */
+function then(value, next) {
+    return isPromiseLike(value) ? value.then(next) : next(value);
+}
+/** `try`/`catch` over a computation that may or may not be asynchronous. */
+function recover(run, handle) {
+    let value;
+    try {
+        value = run();
+    }
+    catch (error) {
+        return handle(error);
+    }
+    return isPromiseLike(value) ? value.catch(handle) : value;
+}
+/**
+ * Await `start()` unless `signal` aborts first. After abort the caller sees a
+ * rejection at once, so it performs no further effect; the underlying call
+ * may still finish, and its value is dropped.
+ */
+export function abortable(signal, start) {
+    if (signal.aborted)
+        return Promise.reject(signal.reason ?? new DOMException("aborted", "AbortError"));
+    return new Promise((resolve, reject) => {
+        const onAbort = () => reject(signal.reason ?? new DOMException("aborted", "AbortError"));
+        signal.addEventListener("abort", onAbort, { once: true });
+        start().then((value) => {
+            signal.removeEventListener("abort", onAbort);
+            resolve(value);
+        }, (error) => {
+            signal.removeEventListener("abort", onAbort);
+            reject(error);
+        });
+    });
+}
+export const REPLICA_STEP_BYTES = 64 * 1024 * 1024;
+export const REPLICA_REPORT_LIMIT = 256;
+export const REPLICA_ATTEMPT_TIMEOUT_MS = 30_000;
+/** Validate before storage, hints, selection or any other effect. */
+export function validateReplicaStep(context) {
+    if (!context ||
+        typeof context !== "object" ||
+        !context.budget ||
+        typeof context.budget !== "object")
+        throw new RangeError("invalid replica step context");
+    if (!Number.isSafeInteger(context.now) || context.now < 0)
+        throw new RangeError("invalid replica step clock");
+    for (const value of [
+        context.budget.units,
+        context.budget.bytes === undefined
+            ? REPLICA_STEP_BYTES
+            : context.budget.bytes,
+    ])
+        if (!Number.isSafeInteger(value) || value < 1)
+            throw new RangeError("invalid replica step budget");
+}
+export class ReplicaCoordinatorConflict extends Error {
+    constructor() {
+        super("replica coordinator ownership or revision changed");
+        this.name = "ReplicaCoordinatorConflict";
+    }
+}
+/** Thrown when a synchronous port is handed an asynchronous checkpoint. */
+export class ReplicaAsyncCheckpointError extends Error {
+    constructor() {
+        super("asynchronous replica checkpoint under a synchronous state port");
+        this.name = "ReplicaAsyncCheckpointError";
+    }
+}
+const DEFAULT_QUANTUM = 50;
+/** Bound on one hint read when no per-run deadline is configured. */
+const HINT_TIMEOUT_MS = 2_000;
+/**
+ * Selects due work fairly and turns phase verdicts into durable transitions.
+ * The host schedules step(); it never runs another semantic retry loop.
+ */
+export function createReplicaCoordinator(input) {
+    const coordinator = createAsyncReplicaCoordinator(input);
+    return {
+        step: coordinator.step,
+        onDependencyChanged(key, now) {
+            const woken = coordinator.onDependencyChanged(key, now);
+            if (isPromiseLike(woken))
+                throw new ReplicaAsyncCheckpointError();
+            return woken;
+        },
+    };
+}
+/**
+ * The coordinator over handlers and a state port that may answer
+ * asynchronously. Plain values keep the synchronous path, so a synchronous
+ * host (Node) behaves exactly as under `createReplicaCoordinator`. With a
+ * synchronous port, an asynchronous checkpoint is refused inside its
+ * transaction, never committed half-done.
+ */
+export function createAsyncReplicaCoordinator(input) {
+    for (const value of [
+        input.perWriter ?? 1,
+        input.deadlineMs ?? REPLICA_ATTEMPT_TIMEOUT_MS,
+        input.hintRefreshMs ?? 2_000,
+    ])
+        if (value === undefined || !Number.isSafeInteger(value) || value < 1)
+            throw new RangeError("invalid replica coordinator bound");
+    // A zero quantum leaves its phase idle (as on main); it is still finite.
+    for (const value of Object.values(input.quantum ?? {}))
+        if (value === undefined || !Number.isSafeInteger(value) || value < 0)
+            throw new RangeError("invalid replica coordinator bound");
+    // setTimeout clamps larger delays to 1ms on Node; never silently accept that.
+    if ((input.deadlineMs ?? REPLICA_ATTEMPT_TIMEOUT_MS) > 2_147_483_647)
+        throw new RangeError("invalid replica attempt timeout");
+    if (new Set(input.phases.map((phase) => phase.phase)).size !==
+        input.phases.length)
+        throw new RangeError("duplicate replica phase");
+    const quantum = (phase) => input.quantum?.[phase] ?? DEFAULT_QUANTUM;
+    /** Items whose run has not settled. A timed-out run blocks redispatch until it ends. */
+    const inflight = new Set();
+    let state = {
+        owner: "memory",
+        version: 0,
+        writers: {},
+    };
+    let stepping = false;
+    function interleave(phase, items) {
+        const groups = new Map();
+        for (const item of items) {
+            const group = groups.get(item.writer);
+            if (group)
+                group.push(item);
+            else
+                groups.set(item.writer, [item]);
+        }
+        const writers = [...groups.keys()];
+        const last = state.writers[phase];
+        const offset = last === undefined ? 0 : writers.indexOf(last) + 1;
+        const rotated = [...writers.slice(offset), ...writers.slice(0, offset)];
+        const ordered = [];
+        for (let round = 0; ordered.length < items.length; round++)
+            for (const writer of rotated) {
+                const item = groups.get(writer)[round];
+                if (item)
+                    ordered.push(item);
+            }
+        return ordered;
+    }
+    /**
+     * Race `start` against the per-run deadline and the host's signal. On
+     * either, the inner signal aborts and the late result is dropped whole.
+     */
+    async function bounded(start, signal, deadlineMs = input.deadlineMs ?? REPLICA_ATTEMPT_TIMEOUT_MS) {
+        const controller = new AbortController();
+        let timer;
+        let onAbort;
+        const racers = [
+            start(controller.signal).then((value) => ({ value })),
+        ];
+        if (deadlineMs !== undefined)
+            racers.push(new Promise((resolve) => {
+                timer = setTimeout(() => {
+                    controller.abort();
+                    resolve("deadline");
+                }, deadlineMs);
+            }));
+        if (signal)
+            racers.push(new Promise((resolve) => {
+                onAbort = () => {
+                    controller.abort(signal.reason);
+                    resolve("aborted");
+                };
+                if (signal.aborted)
+                    onAbort();
+                else
+                    signal.addEventListener("abort", onAbort, { once: true });
+            }));
+        try {
+            return await Promise.race(racers);
+        }
+        finally {
+            if (timer !== undefined)
+                clearTimeout(timer);
+            if (onAbort)
+                signal?.removeEventListener("abort", onAbort);
+        }
+    }
+    /** `undefined`: the host aborted the step before this run settled. */
+    async function execute(handler, item, signal) {
+        const key = `${handler.phase}\0${item.id}`;
+        inflight.add(key);
+        let running;
+        const result = await bounded((inner) => {
+            running = handler
+                .run(item, inner)
+                .catch((error) => ({
+                outcome: retryFromError(error, "unknown"),
+            }))
+                .finally(() => inflight.delete(key));
+            return running;
+        }, signal);
+        if (result === "aborted") {
+            void running?.then((attempt) => attempt.release?.());
+            return undefined;
+        }
+        if (result === "deadline") {
+            void running?.then((attempt) => attempt.release?.());
+            return { outcome: { tag: "retry", problem: "deadline_exceeded" } };
+        }
+        return result.value;
+    }
+    // ------------------------------------------------------------- hints
+    let head;
+    let hintReadAt = Number.NEGATIVE_INFINITY;
+    let hintInFlight = false;
+    const hintRefreshMs = input.hintRefreshMs ?? 2_000;
+    /**
+     * Refresh the hint at most every hintRefreshMs, bounded by the deadline and
+     * the step signal. A failed, slow or hung read leaves no hint: waits then
+     * poll on their durable schedule. A read still in flight is never awaited
+     * again, so a hung hint cannot stall later steps.
+     */
+    async function refreshHint(now, signal) {
+        const hint = input.hint;
+        if (!hint || hintInFlight || now - hintReadAt < hintRefreshMs)
+            return;
+        hintReadAt = now;
+        hintInFlight = true;
+        const read = await bounded((inner) => hint
+            .head(inner)
+            .then((value) => typeof value === "bigint" && value >= 0n ? value : undefined)
+            .catch(() => undefined)
+            .finally(() => (hintInFlight = false)), signal, 
+        // A hint is optional: it is always bounded, with or without a run deadline.
+        input.deadlineMs ?? HINT_TIMEOUT_MS);
+        head = typeof read === "object" ? read.value : undefined;
+    }
+    const eligibility = (now) => ({
+        now,
+        head,
+        hintRefreshAt: input.hint ? hintReadAt + hintRefreshMs : undefined,
+    });
+    /**
+     * Persist one attempt. If its plan's transaction fails, persist the Retry
+     * that failure means instead (no plan). If even that fails, the step fails:
+     * the report never states an outcome the repository does not hold.
+     */
+    function commit(handler, item, attempt, signal) {
+        const settle = (verdict) => settleReplicaWork(item.state, verdict, input.clock?.() ?? stepNow, {
+            backoff: input.backoff,
+            hints: input.hint !== undefined,
+        });
+        const advance = (value) => {
+            const position = input.phases.indexOf(handler);
+            const next = {
+                nextPhase: input.phases[(position + 1) % input.phases.length]?.phase,
+                writers: { ...state.writers, [handler.phase]: item.writer },
+            };
+            const checkpoint = (context) => {
+                const assertNotAborted = () => {
+                    if (signal?.aborted)
+                        throw signal.reason ?? new DOMException("aborted", "AbortError");
+                };
+                assertNotAborted();
+                return then(handler.commit(item, value, settle, context), (result) => {
+                    // Still inside the durable state port's outer transaction. A plan
+                    // may close the host lifetime; roll back its effects.
+                    assertNotAborted();
+                    return result;
+                });
+            };
+            const port = input.state;
+            if (port && "async" in port && port.async)
+                return port
+                    .commit(state, next, async (context) => checkpoint(context))
+                    .then((committed) => {
+                    state = committed.state;
+                    return committed.result;
+                });
+            if (port) {
+                const committed = port.commit(state, next, () => {
+                    const result = checkpoint(undefined);
+                    if (isPromiseLike(result)) {
+                        // Never leave the refused checkpoint's rejection unobserved.
+                        result.catch(() => undefined);
+                        throw new ReplicaAsyncCheckpointError();
+                    }
+                    return result;
+                });
+                state = committed.state;
+                return committed.result;
+            }
+            return then(checkpoint(undefined), (result) => {
+                state = { ...state, ...next, version: state.version + 1 };
+                return result;
+            });
+        };
+        return recover(() => advance(attempt), (error) => {
+            if (signal?.aborted ||
+                !attempt.plan ||
+                error instanceof ReplicaCoordinatorConflict)
+                throw error;
+            return advance({
+                outcome: retryFromError(error, handler.commitProblem ?? "storage_failed"),
+            });
+        });
+    }
+    let stepNow = 0;
+    function record(report, phase, id, outcome) {
+        if (report.receipts.length +
+            report.waits.length +
+            report.problems.length +
+            report.quarantines.length +
+            report.unsupported.length >=
+            REPLICA_REPORT_LIMIT) {
+            report.diagnosticsTruncated = true;
+            return;
+        }
+        if (outcome.tag === "progress")
+            report.receipts.push(outcome.receipt);
+        else if (outcome.tag === "wait")
+            report.waits.push({
+                id,
+                phase,
+                dependency: outcome.dependency,
+                ...(outcome.dependency.kind === "registration_pending" && {
+                    ageMs: Math.max(0, stepNow - outcome.dependency.since),
+                }),
+            });
+        else if (outcome.tag === "retry")
+            report.problems.push({
+                id,
+                phase,
+                problem: outcome.problem,
+                ...(outcome.cause && { cause: outcome.cause }),
+                nextEligible: outcome.nextEligible,
+            });
+        else if (outcome.tag === "quarantine")
+            report.quarantines.push({ id, phase, proof: outcome.proof });
+        else
+            report.unsupported.push({ id, phase, admission: outcome.admission });
+    }
+    return {
+        async step(context) {
+            validateReplicaStep(context);
+            if (stepping)
+                throw new ReplicaCoordinatorConflict();
+            stepping = true;
+            try {
+                const { now, signal, budget } = context;
+                // No in-memory cursor from a prior instance is authoritative.
+                if (input.state) {
+                    const loaded = input.state.load();
+                    state = isPromiseLike(loaded) ? await loaded : loaded;
+                }
+                const report = {
+                    receipts: [],
+                    waits: [],
+                    problems: [],
+                    quarantines: [],
+                    unsupported: [],
+                    nextWake: undefined,
+                };
+                stepNow = now;
+                let units = budget.units;
+                const stepBytes = budget.bytes ?? REPLICA_STEP_BYTES;
+                let bytes = stepBytes;
+                let deferred = false;
+                const aborted = () => signal?.aborted === true;
+                if (!aborted())
+                    await refreshHint(now, signal);
+                // Selection reads the clock when it selects, so work a phase finished
+                // earlier in this step (settled at a later clock reading) is eligible.
+                const selection = () => eligibility(Math.max(now, input.clock?.() ?? now));
+                const first = Math.max(0, input.phases.findIndex((phase) => phase.phase === state.nextPhase));
+                const phases = [
+                    ...input.phases.slice(first),
+                    ...input.phases.slice(0, first),
+                ];
+                // A finite budget reserves a fair share per phase before any phase may
+                // spend leftovers, so an early phase cannot take every unit.
+                const share = Math.max(1, Math.floor(units / Math.max(1, phases.length)));
+                const spent = new Map();
+                const ran = new Set();
+                const background = new Set(input.background ?? []);
+                const leftovers = [
+                    ...phases.filter((handler) => !background.has(handler.phase)),
+                    ...phases.filter((handler) => background.has(handler.phase)),
+                ];
+                for (const pass of [0, 1]) {
+                    for (const handler of pass === 0 ? phases : leftovers) {
+                        const used = spent.get(handler.phase) ?? 0;
+                        const cap = Math.min(quantum(handler.phase) - used, pass === 0 ? share : units, units);
+                        let count = 0;
+                        // Items deferred for bytes in this phase. Each one widens the next
+                        // due() page by one, so an item that does not fit cannot hide the
+                        // items behind it (another writer's work that fits). Bounded by the
+                        // phase quantum, so a backlog of oversized items stays a bounded scan.
+                        let skipped = 0;
+                        // Refilled rounds: each due() call admits at most perWriter items per
+                        // writer, so one writer's backlog cannot fill a phase's quantum.
+                        while (count < cap && units > 0 && !aborted()) {
+                            const selected = handler.due(selection(), {
+                                total: cap - count + skipped,
+                                perWriter: input.perWriter ?? 1,
+                                after: state.writers[handler.phase],
+                            });
+                            const items = interleave(handler.phase, (isPromiseLike(selected) ? await selected : selected).filter((item) => {
+                                const key = `${handler.phase}\0${item.id}`;
+                                return (!inflight.has(key) &&
+                                    !ran.has(`${key}\0${item.part ?? ""}`));
+                            }));
+                            let admitted = 0;
+                            let deferredHere = 0;
+                            for (const item of items) {
+                                if (count >= cap || units <= 0 || aborted())
+                                    break;
+                                ran.add(`${handler.phase}\0${item.id}\0${item.part ?? ""}`);
+                                if (item.bytes !== undefined &&
+                                    (!Number.isSafeInteger(item.bytes) || item.bytes < 0))
+                                    throw new RangeError("invalid replica item byte estimate");
+                                // Under the omitted (default) budget an item larger than the
+                                // whole step can never fit. It runs when no other item has
+                                // charged bytes in this step, and spends the rest, as the
+                                // unbounded default on main ran it. An explicit budget defers
+                                // it until the host gives a budget it fits.
+                                const alone = budget.bytes === undefined &&
+                                    item.bytes !== undefined &&
+                                    item.bytes > stepBytes &&
+                                    bytes === stepBytes;
+                                if (item.bytes !== undefined && item.bytes > bytes && !alone) {
+                                    deferred = true;
+                                    deferredHere++;
+                                    continue;
+                                }
+                                admitted++;
+                                count++;
+                                units--;
+                                if (alone)
+                                    bytes = 0;
+                                else if (item.bytes !== undefined)
+                                    bytes -= item.bytes;
+                                const attempt = await execute(handler, item, signal);
+                                if (attempt === undefined)
+                                    break;
+                                try {
+                                    // Abort can arrive between the winning run promise and this
+                                    // continuation. Discard/release before entering a checkpoint.
+                                    if (aborted())
+                                        break;
+                                    const outcome = commit(handler, item, attempt, signal);
+                                    record(report, handler.phase, item.id, isPromiseLike(outcome) ? await outcome : outcome);
+                                }
+                                finally {
+                                    attempt.release?.();
+                                }
+                            }
+                            skipped += deferredHere;
+                            if (admitted)
+                                continue;
+                            // Nothing fit: look past the deferred items, within the bound.
+                            if (!deferredHere || skipped > quantum(handler.phase))
+                                break;
+                        }
+                        spent.set(handler.phase, used + count);
+                    }
+                }
+                // The same eligibility as selection, read after this step's commits.
+                const after = eligibility(input.clock?.() ?? now);
+                let wake;
+                for (const handler of input.phases) {
+                    const earliest = handler.earliest(after);
+                    const next = isPromiseLike(earliest) ? await earliest : earliest;
+                    if (next !== undefined && (wake === undefined || next < wake))
+                        wake = next;
+                }
+                // Already due (e.g. the budget ran out) is reported as `now`.
+                report.nextWake = deferred
+                    ? now
+                    : wake === undefined
+                        ? undefined
+                        : Math.max(wake, now);
+                return report;
+            }
+            finally {
+                stepping = false;
+            }
+        },
+        onDependencyChanged(key, now) {
+            const counts = input.phases.map((handler) => handler.wake?.(key, now));
+            const sum = (values) => values.reduce((total, value) => total + (value ?? 0), 0);
+            return counts.some(isPromiseLike)
+                ? Promise.all(counts).then(sum)
+                : sum(counts);
+        },
+    };
+}
+//# sourceMappingURL=coordinator.js.map

package/dist/replication/coordinator.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"coordinator.js","sourceRoot":"","sources":["../../src/replication/coordinator.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,cAAc,GAUf,MAAM,cAAc,CAAC;AACtB,OAAO,EACL,iBAAiB,GAIlB,MAAM,eAAe,CAAC;AAIvB,MAAM,aAAa,GAAG,CAAC,KAAc,EAAiC,EAAE,CACtE,OAAO,KAAK,KAAK,QAAQ;IACzB,KAAK,KAAK,IAAI;IACd,OAAQ,KAA4B,CAAC,IAAI,KAAK,UAAU,CAAC;AAE3D,+EAA+E;AAC/E,SAAS,IAAI,CACX,KAAsB,EACtB,IAAmC;IAEnC,OAAO,aAAa,CAAC,KAAK,CAAC,CAAC,CAAC,CAAE,KAAoB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;AAC/E,CAAC;AAED,4EAA4E;AAC5E,SAAS,OAAO,CACd,GAA0B,EAC1B,MAA2C;IAE3C,IAAI,KAAsB,CAAC;IAC3B,IAAI,CAAC;QACH,KAAK,GAAG,GAAG,EAAE,CAAC;IAChB,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,OAAO,MAAM,CAAC,KAAK,CAAC,CAAC;IACvB,CAAC;IACD,OAAO,aAAa,CAAC,KAAK,CAAC,CAAC,CAAC,CAAE,KAAoB,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;AAC5E,CAAC;AAsID;;;;GAIG;AACH,MAAM,UAAU,SAAS,CACvB,MAAmB,EACnB,KAAuB;IAEvB,IAAI,MAAM,CAAC,OAAO;QAChB,OAAO,OAAO,CAAC,MAAM,CACnB,MAAM,CAAC,MAAM,IAAI,IAAI,YAAY,CAAC,SAAS,EAAE,YAAY,CAAC,CAC3D,CAAC;IACJ,OAAO,IAAI,OAAO,CAAI,CAAC,OAAO,EAAE,MAAM,EAAE,EAAE;QACxC,MAAM,OAAO,GAAG,GAAG,EAAE,CACnB,MAAM,CAAC,MAAM,CAAC,MAAM,IAAI,IAAI,YAAY,CAAC,SAAS,EAAE,YAAY,CAAC,CAAC,CAAC;QACrE,MAAM,CAAC,gBAAgB,CAAC,OAAO,EAAE,OAAO,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC;QAC1D,KAAK,EAAE,CAAC,IAAI,CACV,CAAC,KAAK,EAAE,EAAE;YACR,MAAM,CAAC,mBAAmB,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;YAC7C,OAAO,CAAC,KAAK,CAAC,CAAC;QACjB,CAAC,EACD,CAAC,KAAc,EAAE,EAAE;YACjB,MAAM,CAAC,mBAAmB,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;YAC7C,MAAM,CAAC,KAAK,CAAC,CAAC;QAChB,CAAC,CACF,CAAC;IACJ,CAAC,CAAC,CAAC;AACL,CAAC;AASD,MAAM,CAAC,MAAM,kBAAkB,GAAG,EAAE,GAAG,IAAI,GAAG,IAAI,CAAC;AACnD,MAAM,CAAC,MAAM,oBAAoB,GAAG,GAAG,CAAC;AACxC,MAAM,CAAC,MAAM,0BAA0B,GAAG,MAAM,CAAC;AASjD,qEAAqE;AACrE,MAAM,UAAU,mBAAmB,CAAC,OAAoB;IACtD,IACE,CAAC,OAAO;QACR,OAAO,OAAO,KAAK,QAAQ;QAC3B,CAAC,OAAO,CAAC,MAAM;QACf,OAAO,OAAO,CAAC,MAAM,KAAK,QAAQ;QAElC,MAAM,IAAI,UAAU,CAAC,8BAA8B,CAAC,CAAC;IACvD,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,OAAO,CAAC,GAAG,GAAG,CAAC;QACvD,MAAM,IAAI,UAAU,CAAC,4BAA4B,CAAC,CAAC;IACrD,KAAK,MAAM,KAAK,IAAI;QAClB,OAAO,CAAC,MAAM,CAAC,KAAK;QACpB,OAAO,CAAC,MAAM,CAAC,KAAK,KAAK,SAAS;YAChC,CAAC,CAAC,kBAAkB;YACpB,CAAC,CAAC,OAAO,CAAC,MAAM,CAAC,KAAK;KACzB;QACC,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC,KAAK,CAAC,IAAI,KAAK,GAAG,CAAC;YAC3C,MAAM,IAAI,UAAU,CAAC,6BAA6B,CAAC,CAAC;AAC1D,CAAC;AAeD,MAAM,OAAO,0BAA2B,SAAQ,KAAK;IACnD;QACE,KAAK,CAAC,mDAAmD,CAAC,CAAC;QAC3D,IAAI,CAAC,IAAI,GAAG,4BAA4B,CAAC;IAC3C,CAAC;CACF;AAkCD,2EAA2E;AAC3E,MAAM,OAAO,2BAA4B,SAAQ,KAAK;IACpD;QACE,KAAK,CAAC,gEAAgE,CAAC,CAAC;QACxE,IAAI,CAAC,IAAI,GAAG,6BAA6B,CAAC;IAC5C,CAAC;CACF;AAiCD,MAAM,eAAe,GAAG,EAAE,CAAC;AAC3B,qEAAqE;AACrE,MAAM,eAAe,GAAG,KAAK,CAAC;AAuB9B;;;GAGG;AACH,MAAM,UAAU,wBAAwB,CACtC,KAIC;IAED,MAAM,WAAW,GAAG,6BAA6B,CAC/C,KAGC,CACF,CAAC;IACF,OAAO;QACL,IAAI,EAAE,WAAW,CAAC,IAAI;QACtB,mBAAmB,CAAC,GAAW,EAAE,GAAW;YAC1C,MAAM,KAAK,GAAG,WAAW,CAAC,mBAAmB,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YACxD,IAAI,aAAa,CAAC,KAAK,CAAC;gBAAE,MAAM,IAAI,2BAA2B,EAAE,CAAC;YAClE,OAAO,KAAK,CAAC;QACf,CAAC;KACF,CAAC;AACJ,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,6BAA6B,CAC3C,KAMC;IAED,KAAK,MAAM,KAAK,IAAI;QAClB,KAAK,CAAC,SAAS,IAAI,CAAC;QACpB,KAAK,CAAC,UAAU,IAAI,0BAA0B;QAC9C,KAAK,CAAC,aAAa,IAAI,KAAK;KAC7B;QACC,IAAI,KAAK,KAAK,SAAS,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC,KAAK,CAAC,IAAI,KAAK,GAAG,CAAC;YAClE,MAAM,IAAI,UAAU,CAAC,mCAAmC,CAAC,CAAC;IAC9D,yEAAyE;IACzE,KAAK,MAAM,KAAK,IAAI,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,OAAO,IAAI,EAAE,CAAC;QACpD,IAAI,KAAK,KAAK,SAAS,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC,KAAK,CAAC,IAAI,KAAK,GAAG,CAAC;YAClE,MAAM,IAAI,UAAU,CAAC,mCAAmC,CAAC,CAAC;IAC9D,8EAA8E;IAC9E,IAAI,CAAC,KAAK,CAAC,UAAU,IAAI,0BAA0B,CAAC,GAAG,aAAa;QAClE,MAAM,IAAI,UAAU,CAAC,iCAAiC,CAAC,CAAC;IAC1D,IACE,IAAI,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI;QACtD,KAAK,CAAC,MAAM,CAAC,MAAM;QAEnB,MAAM,IAAI,UAAU,CAAC,yBAAyB,CAAC,CAAC;IAElD,MAAM,OAAO,GAAG,CAAC,KAAmB,EAAE,EAAE,CACtC,KAAK,CAAC,OAAO,EAAE,CAAC,KAAK,CAAC,IAAI,eAAe,CAAC;IAC5C,wFAAwF;IACxF,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAU,CAAC;IACnC,IAAI,KAAK,GAA4B;QACnC,KAAK,EAAE,QAAQ;QACf,OAAO,EAAE,CAAC;QACV,OAAO,EAAE,EAAE;KACZ,CAAC;IACF,IAAI,QAAQ,GAAG,KAAK,CAAC;IAErB,SAAS,UAAU,CACjB,KAAmB,EACnB,KAAU;QAEV,MAAM,MAAM,GAAG,IAAI,GAAG,EAAe,CAAC;QACtC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,MAAM,KAAK,GAAG,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YACtC,IAAI,KAAK;gBAAE,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;;gBACvB,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC;QACvC,CAAC;QACD,MAAM,OAAO,GAAG,CAAC,GAAG,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC;QACnC,MAAM,IAAI,GAAG,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;QAClC,MAAM,MAAM,GAAG,IAAI,KAAK,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAClE,MAAM,OAAO,GAAG,CAAC,GAAG,OAAO,CAAC,KAAK,CAAC,MAAM,CAAC,EAAE,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC;QACxE,MAAM,OAAO,GAAQ,EAAE,CAAC;QACxB,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,OAAO,CAAC,MAAM,GAAG,KAAK,CAAC,MAAM,EAAE,KAAK,EAAE;YACxD,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;gBAC7B,MAAM,IAAI,GAAG,MAAM,CAAC,GAAG,CAAC,MAAM,CAAE,CAAC,KAAK,CAAC,CAAC;gBACxC,IAAI,IAAI;oBAAE,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAC/B,CAAC;QACH,OAAO,OAAO,CAAC;IACjB,CAAC;IAED;;;OAGG;IACH,KAAK,UAAU,OAAO,CACpB,KAA0C,EAC1C,MAA+B,EAC/B,UAAU,GAAG,KAAK,CAAC,UAAU,IAAI,0BAA0B;QAE3D,MAAM,UAAU,GAAG,IAAI,eAAe,EAAE,CAAC;QACzC,IAAI,KAAgD,CAAC;QACrD,IAAI,OAAiC,CAAC;QACtC,MAAM,MAAM,GAAqD;YAC/D,KAAK,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC;SACtD,CAAC;QACF,IAAI,UAAU,KAAK,SAAS;YAC1B,MAAM,CAAC,IAAI,CACT,IAAI,OAAO,CAAC,CAAC,OAAO,EAAE,EAAE;gBACtB,KAAK,GAAG,UAAU,CAAC,GAAG,EAAE;oBACtB,UAAU,CAAC,KAAK,EAAE,CAAC;oBACnB,OAAO,CAAC,UAAU,CAAC,CAAC;gBACtB,CAAC,EAAE,UAAU,CAAC,CAAC;YACjB,CAAC,CAAC,CACH,CAAC;QACJ,IAAI,MAAM;YACR,MAAM,CAAC,IAAI,CACT,IAAI,OAAO,CAAC,CAAC,OAAO,EAAE,EAAE;gBACtB,OAAO,GAAG,GAAG,EAAE;oBACb,UAAU,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;oBAChC,OAAO,CAAC,SAAS,CAAC,CAAC;gBACrB,CAAC,CAAC;gBACF,IAAI,MAAM,CAAC,OAAO;oBAAE,OAAO,EAAE,CAAC;;oBACzB,MAAM,CAAC,gBAAgB,CAAC,OAAO,EAAE,OAAO,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC;YACjE,CAAC,CAAC,CACH,CAAC;QACJ,IAAI,CAAC;YACH,OAAO,MAAM,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACpC,CAAC;gBAAS,CAAC;YACT,IAAI,KAAK,KAAK,SAAS;gBAAE,YAAY,CAAC,KAAK,CAAC,CAAC;YAC7C,IAAI,OAAO;gBAAE,MAAM,EAAE,mBAAmB,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;QAC7D,CAAC;IACH,CAAC;IAED,sEAAsE;IACtE,KAAK,UAAU,OAAO,CACpB,OAAgB,EAChB,IAAqB,EACrB,MAA+B;QAE/B,MAAM,GAAG,GAAG,GAAG,OAAO,CAAC,KAAK,KAAK,IAAI,CAAC,EAAE,EAAE,CAAC;QAC3C,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAClB,IAAI,OAAqD,CAAC;QAC1D,MAAM,MAAM,GAAG,MAAM,OAAO,CAAC,CAAC,KAAK,EAAE,EAAE;YACrC,OAAO,GAAG,OAAO;iBACd,GAAG,CAAC,IAAI,EAAE,KAAK,CAAC;iBAChB,KAAK,CAAC,CAAC,KAAc,EAA2B,EAAE,CAAC,CAAC;gBACnD,OAAO,EAAE,cAAc,CAAC,KAAK,EAAE,SAAS,CAAC;aAC1C,CAAC,CAAC;iBACF,OAAO,CAAC,GAAG,EAAE,CAAC,QAAQ,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC;YACvC,OAAO,OAAO,CAAC;QACjB,CAAC,EAAE,MAAM,CAAC,CAAC;QACX,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;YACzB,KAAK,OAAO,EAAE,IAAI,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,OAAO,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC;YACrD,OAAO,SAAS,CAAC;QACnB,CAAC;QACD,IAAI,MAAM,KAAK,UAAU,EAAE,CAAC;YAC1B,KAAK,OAAO,EAAE,IAAI,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,OAAO,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC;YACrD,OAAO,EAAE,OAAO,EAAE,EAAE,GAAG,EAAE,OAAO,EAAE,OAAO,EAAE,mBAAmB,EAAE,EAAE,CAAC;QACrE,CAAC;QACD,OAAO,MAAM,CAAC,KAAK,CAAC;IACtB,CAAC;IAED,sEAAsE;IACtE,IAAI,IAAwB,CAAC;IAC7B,IAAI,UAAU,GAAG,MAAM,CAAC,iBAAiB,CAAC;IAC1C,IAAI,YAAY,GAAG,KAAK,CAAC;IACzB,MAAM,aAAa,GAAG,KAAK,CAAC,aAAa,IAAI,KAAK,CAAC;IACnD;;;;;OAKG;IACH,KAAK,UAAU,WAAW,CAAC,GAAW,EAAE,MAA+B;QACrE,MAAM,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC;QACxB,IAAI,CAAC,IAAI,IAAI,YAAY,IAAI,GAAG,GAAG,UAAU,GAAG,aAAa;YAAE,OAAO;QACtE,UAAU,GAAG,GAAG,CAAC;QACjB,YAAY,GAAG,IAAI,CAAC;QACpB,MAAM,IAAI,GAAG,MAAM,OAAO,CACxB,CAAC,KAAK,EAAE,EAAE,CACR,IAAI;aACD,IAAI,CAAC,KAAK,CAAC;aACX,IAAI,CAAC,CAAC,KAAK,EAAE,EAAE,CACd,OAAO,KAAK,KAAK,QAAQ,IAAI,KAAK,IAAI,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,SAAS,CAC7D;aACA,KAAK,CAAC,GAAG,EAAE,CAAC,SAAS,CAAC;aACtB,OAAO,CAAC,GAAG,EAAE,CAAC,CAAC,YAAY,GAAG,KAAK,CAAC,CAAC,EAC1C,MAAM;QACN,4EAA4E;QAC5E,KAAK,CAAC,UAAU,IAAI,eAAe,CACpC,CAAC;QACF,IAAI,GAAG,OAAO,IAAI,KAAK,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,SAAS,CAAC;IAC3D,CAAC;IACD,MAAM,WAAW,GAAG,CAAC,GAAW,EAAsB,EAAE,CAAC,CAAC;QACxD,GAAG;QACH,IAAI;QACJ,aAAa,EAAE,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,UAAU,GAAG,aAAa,CAAC,CAAC,CAAC,SAAS;KACnE,CAAC,CAAC;IAEH;;;;OAIG;IACH,SAAS,MAAM,CACb,OAAgB,EAChB,IAAqB,EACrB,OAAgC,EAChC,MAA+B;QAE/B,MAAM,MAAM,GAAkB,CAAC,OAAO,EAAE,EAAE,CACxC,iBAAiB,CAAC,IAAI,CAAC,KAAK,EAAE,OAAO,EAAE,KAAK,CAAC,KAAK,EAAE,EAAE,IAAI,OAAO,EAAE;YACjE,OAAO,EAAE,KAAK,CAAC,OAAO;YACtB,KAAK,EAAE,KAAK,CAAC,IAAI,KAAK,SAAS;SAChC,CAAC,CAAC;QACL,MAAM,OAAO,GAAG,CACd,KAA8B,EACA,EAAE;YAChC,MAAM,QAAQ,GAAG,KAAK,CAAC,MAAM,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;YAC/C,MAAM,IAAI,GAAoB;gBAC5B,SAAS,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,KAAK;gBACpE,OAAO,EAAE,EAAE,GAAG,KAAK,CAAC,OAAO,EAAE,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,IAAI,CAAC,MAAM,EAAE;aAC5D,CAAC;YACF,MAAM,UAAU,GAAG,CAAC,OAAU,EAAE,EAAE;gBAChC,MAAM,gBAAgB,GAAG,GAAG,EAAE;oBAC5B,IAAI,MAAM,EAAE,OAAO;wBACjB,MAAM,MAAM,CAAC,MAAM,IAAI,IAAI,YAAY,CAAC,SAAS,EAAE,YAAY,CAAC,CAAC;gBACrE,CAAC,CAAC;gBACF,gBAAgB,EAAE,CAAC;gBACnB,OAAO,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,IAAI,EAAE,KAAK,EAAE,MAAM,EAAE,OAAO,CAAC,EAAE,CAAC,MAAM,EAAE,EAAE;oBACnE,kEAAkE;oBAClE,sDAAsD;oBACtD,gBAAgB,EAAE,CAAC;oBACnB,OAAO,MAAM,CAAC;gBAChB,CAAC,CAAC,CAAC;YACL,CAAC,CAAC;YACF,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,CAAC;YACzB,IAAI,IAAI,IAAI,OAAO,IAAI,IAAI,IAAI,IAAI,CAAC,KAAK;gBACvC,OAAO,IAAI;qBACR,MAAM,CAAC,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,OAAO,EAAE,EAAE,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;qBAC3D,IAAI,CAAC,CAAC,SAAS,EAAE,EAAE;oBAClB,KAAK,GAAG,SAAS,CAAC,KAAK,CAAC;oBACxB,OAAO,SAAS,CAAC,MAAM,CAAC;gBAC1B,CAAC,CAAC,CAAC;YACP,IAAI,IAAI,EAAE,CAAC;gBACT,MAAM,SAAS,GAAI,IAAoC,CAAC,MAAM,CAC5D,KAAK,EACL,IAAI,EACJ,GAAG,EAAE;oBACH,MAAM,MAAM,GAAG,UAAU,CAAC,SAAc,CAAC,CAAC;oBAC1C,IAAI,aAAa,CAAC,MAAM,CAAC,EAAE,CAAC;wBAC1B,6DAA6D;wBAC5D,MAA2B,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC,SAAS,CAAC,CAAC;wBACpD,MAAM,IAAI,2BAA2B,EAAE,CAAC;oBAC1C,CAAC;oBACD,OAAO,MAAM,CAAC;gBAChB,CAAC,CACF,CAAC;gBACF,KAAK,GAAG,SAAS,CAAC,KAAK,CAAC;gBACxB,OAAO,SAAS,CAAC,MAAM,CAAC;YAC1B,CAAC;YACD,OAAO,IAAI,CAAC,UAAU,CAAC,SAAc,CAAC,EAAE,CAAC,MAAM,EAAE,EAAE;gBACjD,KAAK,GAAG,EAAE,GAAG,KAAK,EAAE,GAAG,IAAI,EAAE,OAAO,EAAE,KAAK,CAAC,OAAO,GAAG,CAAC,EAAE,CAAC;gBAC1D,OAAO,MAAM,CAAC;YAChB,CAAC,CAAC,CAAC;QACL,CAAC,CAAC;QACF,OAAO,OAAO,CACZ,GAAG,EAAE,CAAC,OAAO,CAAC,OAAO,CAAC,EACtB,CAAC,KAAK,EAAE,EAAE;YACR,IACE,MAAM,EAAE,OAAO;gBACf,CAAC,OAAO,CAAC,IAAI;gBACb,KAAK,YAAY,0BAA0B;gBAE3C,MAAM,KAAK,CAAC;YACd,OAAO,OAAO,CAAC;gBACb,OAAO,EAAE,cAAc,CACrB,KAAK,EACL,OAAO,CAAC,aAAa,IAAI,gBAAgB,CAC1C;aACF,CAAC,CAAC;QACL,CAAC,CACF,CAAC;IACJ,CAAC;IACD,IAAI,OAAO,GAAG,CAAC,CAAC;IAEhB,SAAS,MAAM,CACb,MAAsB,EACtB,KAAmB,EACnB,EAAU,EACV,OAAuB;QAEvB,IACE,MAAM,CAAC,QAAQ,CAAC,MAAM;YACpB,MAAM,CAAC,KAAK,CAAC,MAAM;YACnB,MAAM,CAAC,QAAQ,CAAC,MAAM;YACtB,MAAM,CAAC,WAAW,CAAC,MAAM;YACzB,MAAM,CAAC,WAAW,CAAC,MAAM;YAC3B,oBAAoB,EACpB,CAAC;YACD,MAAM,CAAC,oBAAoB,GAAG,IAAI,CAAC;YACnC,OAAO;QACT,CAAC;QACD,IAAI,OAAO,CAAC,GAAG,KAAK,UAAU;YAAE,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;aACjE,IAAI,OAAO,CAAC,GAAG,KAAK,MAAM;YAC7B,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC;gBAChB,EAAE;gBACF,KAAK;gBACL,UAAU,EAAE,OAAO,CAAC,UAAU;gBAC9B,GAAG,CAAC,OAAO,CAAC,UAAU,CAAC,IAAI,KAAK,sBAAsB,IAAI;oBACxD,KAAK,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,OAAO,GAAG,OAAO,CAAC,UAAU,CAAC,KAAK,CAAC;iBACvD,CAAC;aACH,CAAC,CAAC;aACA,IAAI,OAAO,CAAC,GAAG,KAAK,OAAO;YAC9B,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC;gBACnB,EAAE;gBACF,KAAK;gBACL,OAAO,EAAE,OAAO,CAAC,OAAO;gBACxB,GAAG,CAAC,OAAO,CAAC,KAAK,IAAI,EAAE,KAAK,EAAE,OAAO,CAAC,KAAK,EAAE,CAAC;gBAC9C,YAAY,EAAE,OAAO,CAAC,YAAY;aACnC,CAAC,CAAC;aACA,IAAI,OAAO,CAAC,GAAG,KAAK,YAAY;YACnC,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,OAAO,CAAC,KAAK,EAAE,CAAC,CAAC;;YAC1D,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,KAAK,EAAE,SAAS,EAAE,OAAO,CAAC,SAAS,EAAE,CAAC,CAAC;IAC5E,CAAC;IAED,OAAO;QACL,KAAK,CAAC,IAAI,CAAC,OAAoB;YAC7B,mBAAmB,CAAC,OAAO,CAAC,CAAC;YAC7B,IAAI,QAAQ;gBAAE,MAAM,IAAI,0BAA0B,EAAE,CAAC;YACrD,QAAQ,GAAG,IAAI,CAAC;YAChB,IAAI,CAAC;gBACH,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,MAAM,EAAE,GAAG,OAAO,CAAC;gBACxC,8DAA8D;gBAC9D,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;oBAChB,MAAM,MAAM,GAAG,KAAK,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC;oBAClC,KAAK,GAAG,aAAa,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,MAAM,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC;gBACxD,CAAC;gBACD,MAAM,MAAM,GAAmB;oBAC7B,QAAQ,EAAE,EAAE;oBACZ,KAAK,EAAE,EAAE;oBACT,QAAQ,EAAE,EAAE;oBACZ,WAAW,EAAE,EAAE;oBACf,WAAW,EAAE,EAAE;oBACf,QAAQ,EAAE,SAAS;iBACpB,CAAC;gBACF,OAAO,GAAG,GAAG,CAAC;gBACd,IAAI,KAAK,GAAG,MAAM,CAAC,KAAK,CAAC;gBACzB,MAAM,SAAS,GAAG,MAAM,CAAC,KAAK,IAAI,kBAAkB,CAAC;gBACrD,IAAI,KAAK,GAAG,SAAS,CAAC;gBACtB,IAAI,QAAQ,GAAG,KAAK,CAAC;gBACrB,MAAM,OAAO,GAAG,GAAG,EAAE,CAAC,MAAM,EAAE,OAAO,KAAK,IAAI,CAAC;gBAC/C,IAAI,CAAC,OAAO,EAAE;oBAAE,MAAM,WAAW,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC;gBAC/C,sEAAsE;gBACtE,uEAAuE;gBACvE,MAAM,SAAS,GAAG,GAAG,EAAE,CACrB,WAAW,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,KAAK,EAAE,EAAE,IAAI,GAAG,CAAC,CAAC,CAAC;gBACrD,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CACpB,CAAC,EACD,KAAK,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,KAAK,KAAK,KAAK,CAAC,SAAS,CAAC,CACnE,CAAC;gBACF,MAAM,MAAM,GAAG;oBACb,GAAG,KAAK,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC;oBAC5B,GAAG,KAAK,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC;iBAChC,CAAC;gBACF,uEAAuE;gBACvE,6DAA6D;gBAC7D,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CACpB,CAAC,EACD,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC,CAC/C,CAAC;gBACF,MAAM,KAAK,GAAG,IAAI,GAAG,EAAwB,CAAC;gBAC9C,MAAM,GAAG,GAAG,IAAI,GAAG,EAAU,CAAC;gBAC9B,MAAM,UAAU,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,UAAU,IAAI,EAAE,CAAC,CAAC;gBACnD,MAAM,SAAS,GAAG;oBAChB,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC,UAAU,CAAC,GAAG,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;oBAC7D,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,UAAU,CAAC,GAAG,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;iBAC7D,CAAC;gBACF,KAAK,MAAM,IAAI,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC;oBAC1B,KAAK,MAAM,OAAO,IAAI,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC;wBACtD,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;wBAC3C,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAClB,OAAO,CAAC,OAAO,CAAC,KAAK,CAAC,GAAG,IAAI,EAC7B,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,EAC1B,KAAK,CACN,CAAC;wBACF,IAAI,KAAK,GAAG,CAAC,CAAC;wBACd,mEAAmE;wBACnE,kEAAkE;wBAClE,oEAAoE;wBACpE,uEAAuE;wBACvE,IAAI,OAAO,GAAG,CAAC,CAAC;wBAChB,sEAAsE;wBACtE,iEAAiE;wBACjE,OAAO,KAAK,GAAG,GAAG,IAAI,KAAK,GAAG,CAAC,IAAI,CAAC,OAAO,EAAE,EAAE,CAAC;4BAC9C,MAAM,QAAQ,GAAG,OAAO,CAAC,GAAG,CAAC,SAAS,EAAE,EAAE;gCACxC,KAAK,EAAE,GAAG,GAAG,KAAK,GAAG,OAAO;gCAC5B,SAAS,EAAE,KAAK,CAAC,SAAS,IAAI,CAAC;gCAC/B,KAAK,EAAE,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,KAAK,CAAC;6BACpC,CAAC,CAAC;4BACH,MAAM,KAAK,GAAG,UAAU,CACtB,OAAO,CAAC,KAAK,EACb,CAAC,aAAa,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,MAAM,QAAQ,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,MAAM,CAC1D,CAAC,IAAqB,EAAE,EAAE;gCACxB,MAAM,GAAG,GAAG,GAAG,OAAO,CAAC,KAAK,KAAK,IAAI,CAAC,EAAE,EAAE,CAAC;gCAC3C,OAAO,CACL,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC;oCAClB,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,GAAG,KAAK,IAAI,CAAC,IAAI,IAAI,EAAE,EAAE,CAAC,CACvC,CAAC;4BACJ,CAAC,CACF,CACF,CAAC;4BACF,IAAI,QAAQ,GAAG,CAAC,CAAC;4BACjB,IAAI,YAAY,GAAG,CAAC,CAAC;4BACrB,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;gCACzB,IAAI,KAAK,IAAI,GAAG,IAAI,KAAK,IAAI,CAAC,IAAI,OAAO,EAAE;oCAAE,MAAM;gCACnD,GAAG,CAAC,GAAG,CAAC,GAAG,OAAO,CAAC,KAAK,KAAK,IAAI,CAAC,EAAE,KAAK,IAAI,CAAC,IAAI,IAAI,EAAE,EAAE,CAAC,CAAC;gCAC5D,IACE,IAAI,CAAC,KAAK,KAAK,SAAS;oCACxB,CAAC,CAAC,MAAM,CAAC,aAAa,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC;oCAErD,MAAM,IAAI,UAAU,CAAC,oCAAoC,CAAC,CAAC;gCAC7D,6DAA6D;gCAC7D,2DAA2D;gCAC3D,0DAA0D;gCAC1D,8DAA8D;gCAC9D,4CAA4C;gCAC5C,MAAM,KAAK,GACT,MAAM,CAAC,KAAK,KAAK,SAAS;oCAC1B,IAAI,CAAC,KAAK,KAAK,SAAS;oCACxB,IAAI,CAAC,KAAK,GAAG,SAAS;oCACtB,KAAK,KAAK,SAAS,CAAC;gCACtB,IAAI,IAAI,CAAC,KAAK,KAAK,SAAS,IAAI,IAAI,CAAC,KAAK,GAAG,KAAK,IAAI,CAAC,KAAK,EAAE,CAAC;oCAC7D,QAAQ,GAAG,IAAI,CAAC;oCAChB,YAAY,EAAE,CAAC;oCACf,SAAS;gCACX,CAAC;gCACD,QAAQ,EAAE,CAAC;gCACX,KAAK,EAAE,CAAC;gCACR,KAAK,EAAE,CAAC;gCACR,IAAI,KAAK;oCAAE,KAAK,GAAG,CAAC,CAAC;qCAChB,IAAI,IAAI,CAAC,KAAK,KAAK,SAAS;oCAAE,KAAK,IAAI,IAAI,CAAC,KAAK,CAAC;gCACvD,MAAM,OAAO,GAAG,MAAM,OAAO,CAAC,OAAO,EAAE,IAAI,EAAE,MAAM,CAAC,CAAC;gCACrD,IAAI,OAAO,KAAK,SAAS;oCAAE,MAAM;gCACjC,IAAI,CAAC;oCACH,4DAA4D;oCAC5D,8DAA8D;oCAC9D,IAAI,OAAO,EAAE;wCAAE,MAAM;oCACrB,MAAM,OAAO,GAAG,MAAM,CAAC,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,MAAM,CAAC,CAAC;oCACvD,MAAM,CACJ,MAAM,EACN,OAAO,CAAC,KAAK,EACb,IAAI,CAAC,EAAE,EACP,aAAa,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,MAAM,OAAO,CAAC,CAAC,CAAC,OAAO,CACjD,CAAC;gCACJ,CAAC;wCAAS,CAAC;oCACT,OAAO,CAAC,OAAO,EAAE,EAAE,CAAC;gCACtB,CAAC;4BACH,CAAC;4BACD,OAAO,IAAI,YAAY,CAAC;4BACxB,IAAI,QAAQ;gCAAE,SAAS;4BACvB,+DAA+D;4BAC/D,IAAI,CAAC,YAAY,IAAI,OAAO,GAAG,OAAO,CAAC,OAAO,CAAC,KAAK,CAAC;gCAAE,MAAM;wBAC/D,CAAC;wBACD,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,KAAK,EAAE,IAAI,GAAG,KAAK,CAAC,CAAC;oBACzC,CAAC;gBACH,CAAC;gBACD,qEAAqE;gBACrE,MAAM,KAAK,GAAG,WAAW,CAAC,KAAK,CAAC,KAAK,EAAE,EAAE,IAAI,GAAG,CAAC,CAAC;gBAClD,IAAI,IAAwB,CAAC;gBAC7B,KAAK,MAAM,OAAO,IAAI,KAAK,CAAC,MAAM,EAAE,CAAC;oBACnC,MAAM,QAAQ,GAAG,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;oBACzC,MAAM,IAAI,GAAG,aAAa,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,MAAM,QAAQ,CAAC,CAAC,CAAC,QAAQ,CAAC;oBACjE,IAAI,IAAI,KAAK,SAAS,IAAI,CAAC,IAAI,KAAK,SAAS,IAAI,IAAI,GAAG,IAAI,CAAC;wBAC3D,IAAI,GAAG,IAAI,CAAC;gBAChB,CAAC;gBACD,8DAA8D;gBAC9D,MAAM,CAAC,QAAQ,GAAG,QAAQ;oBACxB,CAAC,CAAC,GAAG;oBACL,CAAC,CAAC,IAAI,KAAK,SAAS;wBAClB,CAAC,CAAC,SAAS;wBACX,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;gBAC1B,OAAO,MAAM,CAAC;YAChB,CAAC;oBAAS,CAAC;gBACT,QAAQ,GAAG,KAAK,CAAC;YACnB,CAAC;QACH,CAAC;QACD,mBAAmB,CAAC,GAAW,EAAE,GAAW;YAC1C,MAAM,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;YACvE,MAAM,GAAG,GAAG,CAAC,MAA8B,EAAE,EAAE,CAC7C,MAAM,CAAC,MAAM,CAAS,CAAC,KAAK,EAAE,KAAK,EAAE,EAAE,CAAC,KAAK,GAAG,CAAC,KAAK,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YACnE,OAAO,MAAM,CAAC,IAAI,CAAC,aAAa,CAAC;gBAC/B,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC;gBAC/B,CAAC,CAAC,GAAG,CAAC,MAAgC,CAAC,CAAC;QAC5C,CAAC;KACF,CAAC;AACJ,CAAC"}

package/dist/replication/copies.d.ts

@@ -0,0 +1,126 @@
+import { type ReplicaEnvelope } from "./envelope.js";
+import { type CopyDecision, type CopyDisposition, type FinalizedFact, type Hex } from "./copy-promotion.js";
+import type { Predecessor } from "./transport.js";
+import { type ReplicaEffect, type ReplicaEffectContext } from "./effects.js";
+export declare const REPLICA_COPY_MIGRATION = "\nCREATE TABLE IF NOT EXISTS pdpp_replica_copies (\n  id TEXT NOT NULL,\n  copy_key TEXT NOT NULL,\n  writer_id TEXT NOT NULL,\n  batch_id TEXT NOT NULL,\n  sequence INTEGER NOT NULL,\n  previous_json TEXT,\n  fragment_count INTEGER NOT NULL CHECK (fragment_count >= 1),\n  fragment_commitments_json TEXT NOT NULL,\n  envelope_digest TEXT NOT NULL,\n  envelope_json TEXT NOT NULL,\n  blobs_json TEXT NOT NULL,\n  state TEXT NOT NULL CHECK (state IN ('pending','confirmed','quarantined')),\n  reason TEXT CHECK (reason IS NULL OR reason IN ('copy_conflict','finalized_conflict')),\n  CHECK ((state = 'quarantined') = (reason IS NOT NULL)),\n  PRIMARY KEY (id, copy_key)\n);\nCREATE TABLE IF NOT EXISTS pdpp_replica_copy_envelope_parts (\n  id TEXT NOT NULL, copy_key TEXT NOT NULL, part INTEGER NOT NULL,\n  json TEXT NOT NULL,\n  PRIMARY KEY (id, copy_key, part)\n);\nCREATE TABLE IF NOT EXISTS pdpp_replica_copy_blob_parts (\n  id TEXT NOT NULL, copy_key TEXT NOT NULL, part INTEGER NOT NULL,\n  json TEXT NOT NULL,\n  PRIMARY KEY (id, copy_key, part)\n);\nCREATE TABLE IF NOT EXISTS pdpp_replica_copy_rejects (\n  id TEXT NOT NULL, reject_key TEXT NOT NULL, claimed_copy_key TEXT,\n  reason TEXT NOT NULL, received_at INTEGER NOT NULL,\n  PRIMARY KEY (id, reject_key)\n);\nCREATE TRIGGER IF NOT EXISTS pdpp_copy_rejects_no_update BEFORE UPDATE ON pdpp_replica_copy_rejects BEGIN SELECT RAISE(ABORT, 'copy rejects are append-only'); END;\nCREATE TRIGGER IF NOT EXISTS pdpp_copy_rejects_no_delete BEFORE DELETE ON pdpp_replica_copy_rejects BEGIN SELECT RAISE(ABORT, 'copy rejects are append-only'); END;\nCREATE TABLE IF NOT EXISTS pdpp_replica_finalized_facts (\n  seq INTEGER PRIMARY KEY AUTOINCREMENT,\n  chain_id INTEGER NOT NULL, registry TEXT NOT NULL, owner TEXT NOT NULL,\n  scope TEXT NOT NULL, fragment_index INTEGER NOT NULL, id TEXT NOT NULL,\n  slot_version TEXT NOT NULL DEFAULT '1', current_version TEXT NOT NULL, status TEXT NOT NULL, commitment TEXT NOT NULL,\n  block_number TEXT NOT NULL, block_hash TEXT NOT NULL, eligible INTEGER NOT NULL,\n  observed_at INTEGER NOT NULL\n);\nCREATE INDEX IF NOT EXISTS pdpp_finalized_facts_id ON pdpp_replica_finalized_facts(id, fragment_index, seq);\nCREATE INDEX IF NOT EXISTS pdpp_finalized_facts_scope ON pdpp_replica_finalized_facts(scope, seq);\nCREATE TRIGGER IF NOT EXISTS pdpp_finalized_facts_no_update BEFORE UPDATE ON pdpp_replica_finalized_facts BEGIN SELECT RAISE(ABORT, 'finalized facts are append-only'); END;\nCREATE TRIGGER IF NOT EXISTS pdpp_finalized_facts_no_delete BEFORE DELETE ON pdpp_replica_finalized_facts BEGIN SELECT RAISE(ABORT, 'finalized facts are append-only'); END;\nCREATE TABLE IF NOT EXISTS pdpp_replica_batch_disposition (\n  id TEXT PRIMARY KEY,\n  writer_id TEXT NOT NULL,\n  sequence INTEGER NOT NULL,\n  state TEXT NOT NULL CHECK (state IN ('open','promoted','terminal')),\n  promoted_copy_key TEXT,\n  terminal_reason TEXT,\n  CHECK ((state = 'promoted') = (promoted_copy_key IS NOT NULL)),\n  CHECK ((state = 'terminal') = (terminal_reason IS NOT NULL))\n);\nCREATE INDEX IF NOT EXISTS pdpp_batch_disposition_writer ON pdpp_replica_batch_disposition(writer_id, sequence);\nCREATE TRIGGER IF NOT EXISTS pdpp_batch_disposition_absorbing BEFORE UPDATE ON pdpp_replica_batch_disposition\nWHEN OLD.state = 'terminal' OR (OLD.state = 'promoted' AND NEW.state = 'open')\nBEGIN SELECT RAISE(ABORT, 'batch disposition transitions are absorbing'); END;\nCREATE TABLE IF NOT EXISTS pdpp_replica_promotion_receipts (\n  id TEXT PRIMARY KEY, copy_key TEXT NOT NULL, envelope_digest TEXT NOT NULL\n);\n";
+/** One fragment of a copy, as verified at download (bytes hash to these). */
+export interface CopyFragment {
+    dataHash: string;
+    metadataHash: string;
+}
+export interface StagedCopy {
+    id: string;
+    writer: string;
+    batch: string;
+    sequence: number;
+    previous: Predecessor | null;
+    /** The payload digest every fragment embeds (`sha256:<hex>`). */
+    envelopeDigest: string;
+    envelope: ReplicaEnvelope;
+    fragments: readonly CopyFragment[];
+    /** Verified pending custody the host already holds for (id, blobId). */
+    blobs: readonly {
+        blobId: string;
+        size: number;
+    }[];
+}
+export type CopyPromotion = {
+    kind: "promoted";
+    copyKey: Hex;
+    envelopeDigest: string;
+    replay: boolean;
+} | {
+    kind: "wait_predecessor";
+    predecessor: string;
+} | {
+    kind: "terminal";
+    reason: string;
+};
+/** Precondition failures a caller can act on; never exception text. */
+export declare class ReplicaCopyRefused extends Error {
+    readonly reason: string;
+    readonly code = "replica_copy_refused";
+    constructor(reason: string);
+}
+/** What a host supplies. Each hook is an effect in the caller's transaction. */
+export interface ReplicaCopiesHost<C = ReplicaEffectContext> {
+    owner: string;
+    /** Import an envelope into canonical state (the receiver's import). */
+    importEnvelope(envelope: ReplicaEnvelope, blobs: StagedCopy["blobs"], id: string): ReplicaEffect<void, C>;
+    /** Withdraw a connection from every reader, in the caller's transaction. */
+    quarantineConnection(instance: string): ReplicaEffect<void, C>;
+    /**
+     * The single pending preview of a batch, keyed by id: at most one copy is
+     * ever `pending` (contract B), so the read side keeps its id key.
+     */
+    preview: {
+        show(id: string, envelope: ReplicaEnvelope, blobsJson: string): ReplicaEffect<void, C>;
+        hide(id: string, state: "confirmed" | "quarantined"): ReplicaEffect<void, C>;
+    };
+    /** Drop pending custody bytes no retained copy still needs. */
+    releaseBytes(id: string, blobIds: readonly string[]): ReplicaEffect<void, C>;
+    /**
+     * Run `effect` so that a throw rolls back its writes alone (a savepoint)
+     * and rethrows.
+     */
+    savepoint<T>(effect: ReplicaEffect<T, C>): ReplicaEffect<T, C>;
+    now(): number;
+}
+/**
+ * A copy's envelope. Copies staged before the parts table keep it in
+ * `envelope_json`; later copies leave that empty and keep it in parts.
+ */
+export declare function replicaCopyEnvelope<C extends ReplicaEffectContext>(id: string, copyKey: string): ReplicaEffect<ReplicaEnvelope, C>;
+export declare function replicaCopies<C extends ReplicaEffectContext>(host: ReplicaCopiesHost<C>): {
+    decide: (id: string, refetch: {
+        attempts: number;
+        budget: number;
+    }) => ReplicaEffect<CopyDecision, C>;
+    disposition: (id: string) => ReplicaEffect<CopyDisposition, C>;
+    copies(id: string): Generator<import("./effects.js").ReplicaOp<C>, {
+        copyKey: Hex;
+        state: "confirmed" | "pending" | "quarantined";
+        reason: "finalized_conflict" | "copy_conflict" | null;
+        envelopeDigest: string;
+    }[], unknown>;
+    /**
+     * Retain one valid copy (contract §3 "Stage copy", amendment C), then
+     * decide and apply the quarantine set. Returns the copy key and decision.
+     * An input failing a validity check is recorded as a reject only.
+     */
+    stage(copy: StagedCopy, refetch: {
+        attempts: number;
+        budget: number;
+    }): ReplicaEffect<{
+        copyKey: Hex | undefined;
+        decision: CopyDecision;
+    }, C>;
+    /**
+     * Append a verified finalized fact for one registered slot (F2). A fact
+     * from another owner is refused (a diagnostic, never a fact). Returns
+     * true when it is new.
+     */
+    recordFact(input: {
+        id: string;
+        scope: string;
+        fragmentIndex: number;
+        fact: FinalizedFact;
+    }): ReplicaEffect<boolean, C>;
+    /** Apply a non-promoting decision's durable effects (coordinator step). */
+    apply: (id: string, decision: CopyDecision) => ReplicaEffect<void, C>;
+    terminate: (id: string, reason: string) => ReplicaEffect<void, C>;
+    /**
+     * Promote one copy (contract §3, amendments E and F): re-decide and
+     * re-check the predecessor; import the copy under a savepoint; confirm
+     * it, quarantine the rest, record the disposition and the receipt. A
+     * replay of a completed promotion returns the original receipt and
+     * changes nothing. A bare promote (no key) is refused when more than one
+     * copy is retained.
+     */
+    promote(input: {
+        id: string;
+        copyKey?: string;
+    }): ReplicaEffect<CopyPromotion, C>;
+};
+export type ReplicaCopiesEffects<C extends ReplicaEffectContext> = ReturnType<typeof replicaCopies<C>>;
+//# sourceMappingURL=copies.d.ts.map