@sempdev/semp 0.4.3

package/dist/delivery/scheduler.d.ts

@@ -0,0 +1,156 @@
+/**
+ * Sending-side delivery scheduler per DELIVERY.md §2.3 + §2.5 + §2.7.
+ *
+ * Drives the §4.5 delivery queue by consuming the §2.3 retry helpers
+ * and the §2.5 queue-state record against an injectable
+ * {@link DeliverFunc}. Operators call {@link Scheduler.tick} on a
+ * timer (every few seconds). Each tick:
+ *
+ *   - Pulls due records from the {@link SchedulerStore}.
+ *   - Runs {@link DeliverFunc} against each.
+ *   - Updates state per the per-attempt outcome:
+ *     - `delivered` → state = `delivered`, emit event.
+ *     - `rejected` (non-recoverable) → state = `rejected`, emit event.
+ *     - `rejected` (recoverable) / `silent` / transport failure →
+ *       schedule next attempt via `nextAttemptAt`.
+ *     - Effective deadline reached → state = `expired`, emit event.
+ *
+ * @module
+ */
+import { type RetryConfig } from "./retry.js";
+import { type QueueState } from "./queue.js";
+import type { CancelResult } from "./cancel.js";
+import { type SubmissionEvent } from "./submission.js";
+/** Outcome of a single delivery attempt. */
+export interface AttemptResult {
+    status: "delivered" | "rejected" | "silent";
+    reasonCode?: string;
+    reason?: string;
+}
+/** Performs a single delivery attempt against `(envelopeId, recipient)`. */
+export type DeliverFunc = (envelopeId: string, recipient: string) => Promise<AttemptResult>;
+/** Consumes terminal-state delivery events per §6.5. */
+export type EventSink = (ev: SubmissionEvent) => void;
+/** Persistence interface for queue records. */
+export interface SchedulerStore {
+    /** Insert or update a record. */
+    put(q: QueueState): Promise<void>;
+    /** Fetch a record by `(envelope_id, recipient)`, or `null`. */
+    get(envelopeId: string, recipient: string): Promise<QueueState | null>;
+    /**
+     * Every non-terminal record whose `next_attempt_at` is at or
+     * before `now`, ordered ascending by `next_attempt_at` with ties
+     * broken by `envelope_id`.
+     */
+    dueRecords(now: Date): Promise<QueueState[]>;
+    /**
+     * Terminal records whose `terminal_at` is at or before `cutoff`.
+     * Used by the retention prune.
+     */
+    listTerminalOlderThan(cutoff: Date): Promise<QueueState[]>;
+    /** Remove a record. */
+    delete(envelopeId: string, recipient: string): Promise<void>;
+}
+/** Inputs to {@link Scheduler}. */
+export interface SchedulerConfig {
+    store: SchedulerStore;
+    deliver: DeliverFunc;
+    /** Backoff policy. Defaults applied via {@link sanitizeRetry}. */
+    retry?: RetryConfig;
+    /**
+     * Operator-configured retry horizon per §2.4. Defaults to
+     * 72 hours; values above 7 days are clamped down.
+     */
+    maxRetryHorizonMs?: number;
+    /** Optional terminal-event sink. */
+    eventSink?: EventSink;
+    /** Wall-clock hook. Defaults to `() => new Date()`. */
+    now?: () => Date;
+}
+/** Sentinel error: a tick is already in progress. */
+export declare class TickInProgressError extends Error {
+    readonly name = "TickInProgressError";
+    constructor();
+}
+/** Sentinel error: no queue record for the requested key. */
+export declare class UnknownRecordError extends Error {
+    readonly name = "UnknownRecordError";
+    constructor(envelopeId: string, recipient: string);
+}
+/**
+ * Sending-side delivery scheduler. Single-process; the JS
+ * run-to-completion model gives effectively-atomic Tick semantics.
+ * `tickInFlight` is enforced by a software latch so concurrent
+ * calls return {@link TickInProgressError}.
+ */
+export declare class Scheduler {
+    private readonly store;
+    private readonly deliver;
+    private readonly retry;
+    private readonly horizonMs;
+    private readonly eventSink;
+    private readonly nowFn;
+    private tickInFlight;
+    constructor(cfg: SchedulerConfig);
+    /**
+     * Insert a new queue record for `(envelopeId, recipient)`. State
+     * starts at `queued`; `next_attempt_at = now` (deliver on next
+     * tick); `deadline = effectiveDeadline(postmarkExpires, now,
+     * horizon)`.
+     *
+     * Throws when a record for the same `(envelopeId, recipient)`
+     * already exists.
+     */
+    enqueue(envelopeId: string, recipient: string, postmarkExpires: Date): Promise<void>;
+    /**
+     * Pull every record whose `next_attempt_at` has passed and
+     * process it. Returns the number of records advanced (terminal
+     * or otherwise) and, on partial failure, the first error
+     * encountered (per-record errors do not abort the tick).
+     *
+     * Throws {@link TickInProgressError} if a concurrent tick is
+     * already running.
+     */
+    tick(): Promise<{
+        advanced: number;
+        firstError?: Error;
+    }>;
+    /**
+     * Transition `(envelopeId, recipient)` to the `canceled` terminal
+     * state per §2.7. Returns the resulting {@link CancelResult}.
+     * Idempotent: cancellation of a record already in a terminal
+     * state is a no-op that returns the prior state.
+     */
+    cancel(envelopeId: string, recipient: string): Promise<CancelResult>;
+    /**
+     * Cancel every still-non-terminal record for `envelopeId` across
+     * all recipients. Returns one {@link CancelResult} per record
+     * observed.
+     */
+    cancelEnvelope(envelopeId: string): Promise<CancelResult[]>;
+    /**
+     * Evict terminal records whose `terminal_at` is at or before
+     * `now - retentionMs` per §2.5 retention. Returns the count
+     * pruned.
+     */
+    pruneTerminal(retentionMs: number): Promise<number>;
+    private runAttempt;
+    private transitionTerminal;
+    private transitionExpired;
+    private emit;
+}
+/**
+ * Reference in-memory {@link SchedulerStore}. Tests / single-process
+ * demos only — production deployments back the queue with durable
+ * storage per DELIVERY.md §2.1.
+ */
+export declare class InMemorySchedulerStore implements SchedulerStore {
+    private readonly records;
+    private static keyOf;
+    put(q: QueueState): Promise<void>;
+    get(envelopeId: string, recipient: string): Promise<QueueState | null>;
+    dueRecords(now: Date): Promise<QueueState[]>;
+    listTerminalOlderThan(cutoff: Date): Promise<QueueState[]>;
+    delete(envelopeId: string, recipient: string): Promise<void>;
+}
+//# sourceMappingURL=scheduler.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"scheduler.d.ts","sourceRoot":"","sources":["../../src/delivery/scheduler.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;GAkBG;AAIH,OAAO,EACL,KAAK,WAAW,EAKjB,MAAM,YAAY,CAAC;AACpB,OAAO,EAEL,KAAK,UAAU,EAGhB,MAAM,YAAY,CAAC;AACpB,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,aAAa,CAAC;AAChD,OAAO,EACL,KAAK,eAAe,EAErB,MAAM,iBAAiB,CAAC;AAEzB,4CAA4C;AAC5C,MAAM,WAAW,aAAa;IAC5B,MAAM,EAAE,WAAW,GAAG,UAAU,GAAG,QAAQ,CAAC;IAC5C,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,MAAM,CAAC,EAAE,MAAM,CAAC;CACjB;AAED,4EAA4E;AAC5E,MAAM,MAAM,WAAW,GAAG,CACxB,UAAU,EAAE,MAAM,EAClB,SAAS,EAAE,MAAM,KACd,OAAO,CAAC,aAAa,CAAC,CAAC;AAE5B,wDAAwD;AACxD,MAAM,MAAM,SAAS,GAAG,CAAC,EAAE,EAAE,eAAe,KAAK,IAAI,CAAC;AAEtD,+CAA+C;AAC/C,MAAM,WAAW,cAAc;IAC7B,iCAAiC;IACjC,GAAG,CAAC,CAAC,EAAE,UAAU,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC;IAClC,+DAA+D;IAC/D,GAAG,CACD,UAAU,EAAE,MAAM,EAClB,SAAS,EAAE,MAAM,GAChB,OAAO,CAAC,UAAU,GAAG,IAAI,CAAC,CAAC;IAC9B;;;;OAIG;IACH,UAAU,CAAC,GAAG,EAAE,IAAI,GAAG,OAAO,CAAC,UAAU,EAAE,CAAC,CAAC;IAC7C;;;OAGG;IACH,qBAAqB,CAAC,MAAM,EAAE,IAAI,GAAG,OAAO,CAAC,UAAU,EAAE,CAAC,CAAC;IAC3D,uBAAuB;IACvB,MAAM,CAAC,UAAU,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC;CAC9D;AAED,mCAAmC;AACnC,MAAM,WAAW,eAAe;IAC9B,KAAK,EAAE,cAAc,CAAC;IACtB,OAAO,EAAE,WAAW,CAAC;IACrB,kEAAkE;IAClE,KAAK,CAAC,EAAE,WAAW,CAAC;IACpB;;;OAGG;IACH,iBAAiB,CAAC,EAAE,MAAM,CAAC;IAC3B,oCAAoC;IACpC,SAAS,CAAC,EAAE,SAAS,CAAC;IACtB,uDAAuD;IACvD,GAAG,CAAC,EAAE,MAAM,IAAI,CAAC;CAClB;AAED,qDAAqD;AACrD,qBAAa,mBAAoB,SAAQ,KAAK;IAC5C,SAAkB,IAAI,yBAAyB;;CAIhD;AAED,6DAA6D;AAC7D,qBAAa,kBAAmB,SAAQ,KAAK;IAC3C,SAAkB,IAAI,wBAAwB;gBAClC,UAAU,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM;CAKlD;AAED;;;;;GAKG;AACH,qBAAa,SAAS;IACpB,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAiB;IACvC,OAAO,CAAC,QAAQ,CAAC,OAAO,CAAc;IACtC,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAc;IACpC,OAAO,CAAC,QAAQ,CAAC,SAAS,CAAS;IACnC,OAAO,CAAC,QAAQ,CAAC,SAAS,CAAmB;IAC7C,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAa;IACnC,OAAO,CAAC,YAAY,CAAS;gBAEjB,GAAG,EAAE,eAAe;IAehC;;;;;;;;OAQG;IACG,OAAO,CACX,UAAU,EAAE,MAAM,EAClB,SAAS,EAAE,MAAM,EACjB,eAAe,EAAE,IAAI,GACpB,OAAO,CAAC,IAAI,CAAC;IAiChB;;;;;;;;OAQG;IACG,IAAI,IAAI,OAAO,CAAC;QAAE,QAAQ,EAAE,MAAM,CAAC;QAAC,UAAU,CAAC,EAAE,KAAK,CAAA;KAAE,CAAC;IAyC/D;;;;;OAKG;IACG,MAAM,CACV,UAAU,EAAE,MAAM,EAClB,SAAS,EAAE,MAAM,GAChB,OAAO,CAAC,YAAY,CAAC;IAmBxB;;;;OAIG;IACG,cAAc,CAAC,UAAU,EAAE,MAAM,GAAG,OAAO,CAAC,YAAY,EAAE,CAAC;IA6BjE;;;;OAIG;IACG,aAAa,CAAC,WAAW,EAAE,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC;YAa3C,UAAU;IAqCxB,OAAO,CAAC,kBAAkB;IAa1B,OAAO,CAAC,iBAAiB;IAQzB,OAAO,CAAC,IAAI;CA4Bb;AAED;;;;GAIG;AACH,qBAAa,sBAAuB,YAAW,cAAc;IAC3D,OAAO,CAAC,QAAQ,CAAC,OAAO,CAAiC;IAEzD,OAAO,CAAC,MAAM,CAAC,KAAK;IAId,GAAG,CAAC,CAAC,EAAE,UAAU,GAAG,OAAO,CAAC,IAAI,CAAC;IAMjC,GAAG,CACP,UAAU,EAAE,MAAM,EAClB,SAAS,EAAE,MAAM,GAChB,OAAO,CAAC,UAAU,GAAG,IAAI,CAAC;IAOvB,UAAU,CAAC,GAAG,EAAE,IAAI,GAAG,OAAO,CAAC,UAAU,EAAE,CAAC;IAwB5C,qBAAqB,CAAC,MAAM,EAAE,IAAI,GAAG,OAAO,CAAC,UAAU,EAAE,CAAC;IAc1D,MAAM,CAAC,UAAU,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC;CAGnE"}

package/dist/delivery/scheduler.js

@@ -0,0 +1,349 @@
+/**
+ * Sending-side delivery scheduler per DELIVERY.md §2.3 + §2.5 + §2.7.
+ *
+ * Drives the §4.5 delivery queue by consuming the §2.3 retry helpers
+ * and the §2.5 queue-state record against an injectable
+ * {@link DeliverFunc}. Operators call {@link Scheduler.tick} on a
+ * timer (every few seconds). Each tick:
+ *
+ *   - Pulls due records from the {@link SchedulerStore}.
+ *   - Runs {@link DeliverFunc} against each.
+ *   - Updates state per the per-attempt outcome:
+ *     - `delivered` → state = `delivered`, emit event.
+ *     - `rejected` (non-recoverable) → state = `rejected`, emit event.
+ *     - `rejected` (recoverable) / `silent` / transport failure →
+ *       schedule next attempt via `nextAttemptAt`.
+ *     - Effective deadline reached → state = `expired`, emit event.
+ *
+ * @module
+ */
+import { effectiveDeadline, isRecoverableReason, nextAttemptAt, sanitizeRetry, } from "./retry.js";
+import { isTerminalState, setTerminal, } from "./queue.js";
+import { newSubmissionEvent, } from "./submission.js";
+/** Sentinel error: a tick is already in progress. */
+export class TickInProgressError extends Error {
+    name = "TickInProgressError";
+    constructor() {
+        super("delivery: scheduler tick already in progress");
+    }
+}
+/** Sentinel error: no queue record for the requested key. */
+export class UnknownRecordError extends Error {
+    name = "UnknownRecordError";
+    constructor(envelopeId, recipient) {
+        super(`delivery: no queue record for envelope_id=${JSON.stringify(envelopeId)} recipient=${JSON.stringify(recipient)}`);
+    }
+}
+/**
+ * Sending-side delivery scheduler. Single-process; the JS
+ * run-to-completion model gives effectively-atomic Tick semantics.
+ * `tickInFlight` is enforced by a software latch so concurrent
+ * calls return {@link TickInProgressError}.
+ */
+export class Scheduler {
+    store;
+    deliver;
+    retry;
+    horizonMs;
+    eventSink;
+    nowFn;
+    tickInFlight = false;
+    constructor(cfg) {
+        if (cfg.store === undefined) {
+            throw new Error("delivery: scheduler requires a store");
+        }
+        if (cfg.deliver === undefined) {
+            throw new Error("delivery: scheduler requires a deliver");
+        }
+        this.store = cfg.store;
+        this.deliver = cfg.deliver;
+        this.retry = sanitizeRetry(cfg.retry ?? {});
+        this.horizonMs = cfg.maxRetryHorizonMs ?? 72 * 3_600_000;
+        this.eventSink = cfg.eventSink ?? null;
+        this.nowFn = cfg.now ?? (() => new Date());
+    }
+    /**
+     * Insert a new queue record for `(envelopeId, recipient)`. State
+     * starts at `queued`; `next_attempt_at = now` (deliver on next
+     * tick); `deadline = effectiveDeadline(postmarkExpires, now,
+     * horizon)`.
+     *
+     * Throws when a record for the same `(envelopeId, recipient)`
+     * already exists.
+     */
+    async enqueue(envelopeId, recipient, postmarkExpires) {
+        if (envelopeId === "") {
+            throw new Error("delivery: enqueue empty envelope_id");
+        }
+        if (recipient === "") {
+            throw new Error("delivery: enqueue empty recipient");
+        }
+        const now = this.nowFn();
+        const existing = await this.store.get(envelopeId, recipient);
+        if (existing !== null) {
+            throw new Error(`delivery: queue record already exists for (${envelopeId}, ${recipient})`);
+        }
+        const deadline = effectiveDeadline(postmarkExpires, now, this.horizonMs);
+        const q = {
+            envelope_id: envelopeId,
+            recipient,
+            state: "queued",
+            attempts: 0,
+            last_attempt_at: null,
+            last_outcome: null,
+            last_reason_code: null,
+            next_attempt_at: isoSecond(now),
+            deadline: isoSecond(deadline),
+        };
+        await this.store.put(q);
+    }
+    /**
+     * Pull every record whose `next_attempt_at` has passed and
+     * process it. Returns the number of records advanced (terminal
+     * or otherwise) and, on partial failure, the first error
+     * encountered (per-record errors do not abort the tick).
+     *
+     * Throws {@link TickInProgressError} if a concurrent tick is
+     * already running.
+     */
+    async tick() {
+        if (this.tickInFlight) {
+            throw new TickInProgressError();
+        }
+        this.tickInFlight = true;
+        try {
+            const now = this.nowFn();
+            const due = await this.store.dueRecords(now);
+            let advanced = 0;
+            let firstError;
+            for (const q of due) {
+                try {
+                    if (isTerminalState(q.state)) {
+                        continue;
+                    }
+                    if (now.getTime() >= Date.parse(q.deadline)) {
+                        this.transitionExpired(q, now);
+                        await this.store.put(q);
+                        advanced += 1;
+                        continue;
+                    }
+                    await this.runAttempt(q, now);
+                    await this.store.put(q);
+                    advanced += 1;
+                }
+                catch (err) {
+                    if (firstError === undefined) {
+                        firstError =
+                            err instanceof Error
+                                ? err
+                                : new Error(`tick error: ${String(err)}`);
+                    }
+                }
+            }
+            return firstError === undefined
+                ? { advanced }
+                : { advanced, firstError };
+        }
+        finally {
+            this.tickInFlight = false;
+        }
+    }
+    /**
+     * Transition `(envelopeId, recipient)` to the `canceled` terminal
+     * state per §2.7. Returns the resulting {@link CancelResult}.
+     * Idempotent: cancellation of a record already in a terminal
+     * state is a no-op that returns the prior state.
+     */
+    async cancel(envelopeId, recipient) {
+        const now = this.nowFn();
+        const q = await this.store.get(envelopeId, recipient);
+        if (q === null) {
+            throw new UnknownRecordError(envelopeId, recipient);
+        }
+        if (isTerminalState(q.state)) {
+            return {
+                recipient,
+                state: q.state,
+                reason: `already ${q.state}; cancellation is a no-op per §2.7.4`,
+            };
+        }
+        setTerminal(q, "canceled", now);
+        await this.store.put(q);
+        this.emit(q, "client-initiated cancellation");
+        return { recipient, state: "canceled" };
+    }
+    /**
+     * Cancel every still-non-terminal record for `envelopeId` across
+     * all recipients. Returns one {@link CancelResult} per record
+     * observed.
+     */
+    async cancelEnvelope(envelopeId) {
+        if (envelopeId === "") {
+            throw new Error("delivery: cancelEnvelope empty envelope_id");
+        }
+        const now = this.nowFn();
+        // dueRecords returns non-terminal records ordered by NextAttempt;
+        // pulling with a far-future cap is the simplest way to enumerate.
+        const all = await this.store.dueRecords(new Date(now.getTime() + this.horizonMs * 2));
+        const matches = all.filter((q) => q.envelope_id === envelopeId);
+        const out = [];
+        for (const q of matches) {
+            if (isTerminalState(q.state)) {
+                out.push({
+                    recipient: q.recipient,
+                    state: q.state,
+                    reason: `already ${q.state}; cancellation is a no-op per §2.7.4`,
+                });
+                continue;
+            }
+            setTerminal(q, "canceled", now);
+            await this.store.put(q);
+            this.emit(q, "client-initiated whole-envelope cancellation");
+            out.push({ recipient: q.recipient, state: "canceled" });
+        }
+        return out;
+    }
+    /**
+     * Evict terminal records whose `terminal_at` is at or before
+     * `now - retentionMs` per §2.5 retention. Returns the count
+     * pruned.
+     */
+    async pruneTerminal(retentionMs) {
+        const cutoff = new Date(this.nowFn().getTime() - retentionMs);
+        const stale = await this.store.listTerminalOlderThan(cutoff);
+        let n = 0;
+        for (const q of stale) {
+            await this.store.delete(q.envelope_id, q.recipient);
+            n += 1;
+        }
+        return n;
+    }
+    // ---------------------------------------------------------------------------
+    async runAttempt(q, now) {
+        const res = await this.deliver(q.envelope_id, q.recipient);
+        q.attempts += 1;
+        q.last_attempt_at = isoSecond(now);
+        q.last_outcome = res.status;
+        q.last_reason_code =
+            res.reasonCode !== undefined && res.reasonCode !== ""
+                ? res.reasonCode
+                : null;
+        if (res.status === "delivered") {
+            this.transitionTerminal(q, "delivered", now, res.reason);
+            return;
+        }
+        if (res.status === "rejected" &&
+            !isRecoverableReason(res.reasonCode ?? "")) {
+            this.transitionTerminal(q, "rejected", now, res.reason);
+            return;
+        }
+        // Recoverable rejection or silent → schedule next attempt.
+        let next;
+        try {
+            next = nextAttemptAt(this.retry, now, q.attempts - 1);
+        }
+        catch {
+            // Pathological: schedule a conservative fallback.
+            next = new Date(now.getTime() + 1_000);
+        }
+        if (next.getTime() > Date.parse(q.deadline)) {
+            // Next attempt would land past deadline → expire instead.
+            this.transitionExpired(q, now);
+            return;
+        }
+        q.next_attempt_at = isoSecond(next);
+    }
+    transitionTerminal(q, state, now, reason) {
+        if (isTerminalState(q.state)) {
+            return;
+        }
+        setTerminal(q, state, now);
+        this.emit(q, reason);
+    }
+    transitionExpired(q, now) {
+        if (isTerminalState(q.state)) {
+            return;
+        }
+        setTerminal(q, "expired", now);
+        this.emit(q, undefined);
+    }
+    emit(q, reason) {
+        if (this.eventSink === null) {
+            return;
+        }
+        const status = q.state === "delivered" ? "delivered" : "rejected";
+        const opts = {};
+        if (q.last_reason_code !== null) {
+            opts.reasonCode = q.last_reason_code;
+        }
+        if (reason !== undefined && reason !== "") {
+            opts.reason = reason;
+        }
+        if (q.terminal_at !== undefined && q.terminal_at !== "") {
+            opts.nowFn = () => new Date(q.terminal_at);
+        }
+        const ev = newSubmissionEvent(q.envelope_id, q.recipient, status, opts);
+        this.eventSink(ev);
+    }
+}
+/**
+ * Reference in-memory {@link SchedulerStore}. Tests / single-process
+ * demos only — production deployments back the queue with durable
+ * storage per DELIVERY.md §2.1.
+ */
+export class InMemorySchedulerStore {
+    records = new Map();
+    static keyOf(envelopeId, recipient) {
+        return `${envelopeId}\x00${recipient}`;
+    }
+    async put(q) {
+        this.records.set(InMemorySchedulerStore.keyOf(q.envelope_id, q.recipient), {
+            ...q,
+        });
+    }
+    async get(envelopeId, recipient) {
+        const r = this.records.get(InMemorySchedulerStore.keyOf(envelopeId, recipient));
+        return r === undefined ? null : { ...r };
+    }
+    async dueRecords(now) {
+        const out = [];
+        for (const q of this.records.values()) {
+            if (isTerminalState(q.state)) {
+                continue;
+            }
+            if (q.next_attempt_at === null) {
+                continue;
+            }
+            if (Date.parse(q.next_attempt_at) <= now.getTime()) {
+                out.push({ ...q });
+            }
+        }
+        out.sort((a, b) => {
+            const at = a.next_attempt_at !== null ? Date.parse(a.next_attempt_at) : 0;
+            const bt = b.next_attempt_at !== null ? Date.parse(b.next_attempt_at) : 0;
+            if (at !== bt) {
+                return at - bt;
+            }
+            return a.envelope_id < b.envelope_id ? -1 : 1;
+        });
+        return out;
+    }
+    async listTerminalOlderThan(cutoff) {
+        const out = [];
+        for (const q of this.records.values()) {
+            if (isTerminalState(q.state) &&
+                q.terminal_at !== undefined &&
+                Date.parse(q.terminal_at) <= cutoff.getTime()) {
+                out.push({ ...q });
+            }
+        }
+        return out;
+    }
+    async delete(envelopeId, recipient) {
+        this.records.delete(InMemorySchedulerStore.keyOf(envelopeId, recipient));
+    }
+}
+function isoSecond(d) {
+    return d.toISOString().replace(/\.\d{3}Z$/, "Z");
+}
+//# sourceMappingURL=scheduler.js.map

package/dist/delivery/scheduler.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"scheduler.js","sourceRoot":"","sources":["../../src/delivery/scheduler.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;GAkBG;AAIH,OAAO,EAEL,iBAAiB,EACjB,mBAAmB,EACnB,aAAa,EACb,aAAa,GACd,MAAM,YAAY,CAAC;AACpB,OAAO,EAGL,eAAe,EACf,WAAW,GACZ,MAAM,YAAY,CAAC;AAEpB,OAAO,EAEL,kBAAkB,GACnB,MAAM,iBAAiB,CAAC;AA2DzB,qDAAqD;AACrD,MAAM,OAAO,mBAAoB,SAAQ,KAAK;IAC1B,IAAI,GAAG,qBAAqB,CAAC;IAC/C;QACE,KAAK,CAAC,8CAA8C,CAAC,CAAC;IACxD,CAAC;CACF;AAED,6DAA6D;AAC7D,MAAM,OAAO,kBAAmB,SAAQ,KAAK;IACzB,IAAI,GAAG,oBAAoB,CAAC;IAC9C,YAAY,UAAkB,EAAE,SAAiB;QAC/C,KAAK,CACH,6CAA6C,IAAI,CAAC,SAAS,CAAC,UAAU,CAAC,cAAc,IAAI,CAAC,SAAS,CAAC,SAAS,CAAC,EAAE,CACjH,CAAC;IACJ,CAAC;CACF;AAED;;;;;GAKG;AACH,MAAM,OAAO,SAAS;IACH,KAAK,CAAiB;IACtB,OAAO,CAAc;IACrB,KAAK,CAAc;IACnB,SAAS,CAAS;IAClB,SAAS,CAAmB;IAC5B,KAAK,CAAa;IAC3B,YAAY,GAAG,KAAK,CAAC;IAE7B,YAAY,GAAoB;QAC9B,IAAI,GAAG,CAAC,KAAK,KAAK,SAAS,EAAE,CAAC;YAC5B,MAAM,IAAI,KAAK,CAAC,sCAAsC,CAAC,CAAC;QAC1D,CAAC;QACD,IAAI,GAAG,CAAC,OAAO,KAAK,SAAS,EAAE,CAAC;YAC9B,MAAM,IAAI,KAAK,CAAC,wCAAwC,CAAC,CAAC;QAC5D,CAAC;QACD,IAAI,CAAC,KAAK,GAAG,GAAG,CAAC,KAAK,CAAC;QACvB,IAAI,CAAC,OAAO,GAAG,GAAG,CAAC,OAAO,CAAC;QAC3B,IAAI,CAAC,KAAK,GAAG,aAAa,CAAC,GAAG,CAAC,KAAK,IAAI,EAAE,CAAC,CAAC;QAC5C,IAAI,CAAC,SAAS,GAAG,GAAG,CAAC,iBAAiB,IAAI,EAAE,GAAG,SAAS,CAAC;QACzD,IAAI,CAAC,SAAS,GAAG,GAAG,CAAC,SAAS,IAAI,IAAI,CAAC;QACvC,IAAI,CAAC,KAAK,GAAG,GAAG,CAAC,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC,IAAI,IAAI,EAAE,CAAC,CAAC;IAC7C,CAAC;IAED;;;;;;;;OAQG;IACH,KAAK,CAAC,OAAO,CACX,UAAkB,EAClB,SAAiB,EACjB,eAAqB;QAErB,IAAI,UAAU,KAAK,EAAE,EAAE,CAAC;YACtB,MAAM,IAAI,KAAK,CAAC,qCAAqC,CAAC,CAAC;QACzD,CAAC;QACD,IAAI,SAAS,KAAK,EAAE,EAAE,CAAC;YACrB,MAAM,IAAI,KAAK,CAAC,mCAAmC,CAAC,CAAC;QACvD,CAAC;QACD,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC;QACzB,MAAM,QAAQ,GAAG,MAAM,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,UAAU,EAAE,SAAS,CAAC,CAAC;QAC7D,IAAI,QAAQ,KAAK,IAAI,EAAE,CAAC;YACtB,MAAM,IAAI,KAAK,CACb,8CAA8C,UAAU,KAAK,SAAS,GAAG,CAC1E,CAAC;QACJ,CAAC;QACD,MAAM,QAAQ,GAAG,iBAAiB,CAChC,eAAe,EACf,GAAG,EACH,IAAI,CAAC,SAAS,CACf,CAAC;QACF,MAAM,CAAC,GAAe;YACpB,WAAW,EAAE,UAAU;YACvB,SAAS;YACT,KAAK,EAAE,QAAQ;YACf,QAAQ,EAAE,CAAC;YACX,eAAe,EAAE,IAAI;YACrB,YAAY,EAAE,IAAI;YAClB,gBAAgB,EAAE,IAAI;YACtB,eAAe,EAAE,SAAS,CAAC,GAAG,CAAC;YAC/B,QAAQ,EAAE,SAAS,CAAC,QAAQ,CAAC;SAC9B,CAAC;QACF,MAAM,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IAC1B,CAAC;IAED;;;;;;;;OAQG;IACH,KAAK,CAAC,IAAI;QACR,IAAI,IAAI,CAAC,YAAY,EAAE,CAAC;YACtB,MAAM,IAAI,mBAAmB,EAAE,CAAC;QAClC,CAAC;QACD,IAAI,CAAC,YAAY,GAAG,IAAI,CAAC;QACzB,IAAI,CAAC;YACH,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC;YACzB,MAAM,GAAG,GAAG,MAAM,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC;YAC7C,IAAI,QAAQ,GAAG,CAAC,CAAC;YACjB,IAAI,UAA6B,CAAC;YAClC,KAAK,MAAM,CAAC,IAAI,GAAG,EAAE,CAAC;gBACpB,IAAI,CAAC;oBACH,IAAI,eAAe,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC;wBAC7B,SAAS;oBACX,CAAC;oBACD,IAAI,GAAG,CAAC,OAAO,EAAE,IAAI,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC;wBAC5C,IAAI,CAAC,iBAAiB,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;wBAC/B,MAAM,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;wBACxB,QAAQ,IAAI,CAAC,CAAC;wBACd,SAAS;oBACX,CAAC;oBACD,MAAM,IAAI,CAAC,UAAU,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;oBAC9B,MAAM,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;oBACxB,QAAQ,IAAI,CAAC,CAAC;gBAChB,CAAC;gBAAC,OAAO,GAAG,EAAE,CAAC;oBACb,IAAI,UAAU,KAAK,SAAS,EAAE,CAAC;wBAC7B,UAAU;4BACR,GAAG,YAAY,KAAK;gCAClB,CAAC,CAAC,GAAG;gCACL,CAAC,CAAC,IAAI,KAAK,CAAC,eAAe,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;oBAChD,CAAC;gBACH,CAAC;YACH,CAAC;YACD,OAAO,UAAU,KAAK,SAAS;gBAC7B,CAAC,CAAC,EAAE,QAAQ,EAAE;gBACd,CAAC,CAAC,EAAE,QAAQ,EAAE,UAAU,EAAE,CAAC;QAC/B,CAAC;gBAAS,CAAC;YACT,IAAI,CAAC,YAAY,GAAG,KAAK,CAAC;QAC5B,CAAC;IACH,CAAC;IAED;;;;;OAKG;IACH,KAAK,CAAC,MAAM,CACV,UAAkB,EAClB,SAAiB;QAEjB,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC;QACzB,MAAM,CAAC,GAAG,MAAM,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,UAAU,EAAE,SAAS,CAAC,CAAC;QACtD,IAAI,CAAC,KAAK,IAAI,EAAE,CAAC;YACf,MAAM,IAAI,kBAAkB,CAAC,UAAU,EAAE,SAAS,CAAC,CAAC;QACtD,CAAC;QACD,IAAI,eAAe,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC;YAC7B,OAAO;gBACL,SAAS;gBACT,KAAK,EAAE,CAAC,CAAC,KAAK;gBACd,MAAM,EAAE,WAAW,CAAC,CAAC,KAAK,sCAAsC;aACjE,CAAC;QACJ,CAAC;QACD,WAAW,CAAC,CAAC,EAAE,UAAU,EAAE,GAAG,CAAC,CAAC;QAChC,MAAM,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACxB,IAAI,CAAC,IAAI,CAAC,CAAC,EAAE,+BAA+B,CAAC,CAAC;QAC9C,OAAO,EAAE,SAAS,EAAE,KAAK,EAAE,UAAU,EAAE,CAAC;IAC1C,CAAC;IAED;;;;OAIG;IACH,KAAK,CAAC,cAAc,CAAC,UAAkB;QACrC,IAAI,UAAU,KAAK,EAAE,EAAE,CAAC;YACtB,MAAM,IAAI,KAAK,CAAC,4CAA4C,CAAC,CAAC;QAChE,CAAC;QACD,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC;QACzB,kEAAkE;QAClE,kEAAkE;QAClE,MAAM,GAAG,GAAG,MAAM,IAAI,CAAC,KAAK,CAAC,UAAU,CACrC,IAAI,IAAI,CAAC,GAAG,CAAC,OAAO,EAAE,GAAG,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC,CAC7C,CAAC;QACF,MAAM,OAAO,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,WAAW,KAAK,UAAU,CAAC,CAAC;QAChE,MAAM,GAAG,GAAmB,EAAE,CAAC;QAC/B,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;YACxB,IAAI,eAAe,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC;gBAC7B,GAAG,CAAC,IAAI,CAAC;oBACP,SAAS,EAAE,CAAC,CAAC,SAAS;oBACtB,KAAK,EAAE,CAAC,CAAC,KAAK;oBACd,MAAM,EAAE,WAAW,CAAC,CAAC,KAAK,sCAAsC;iBACjE,CAAC,CAAC;gBACH,SAAS;YACX,CAAC;YACD,WAAW,CAAC,CAAC,EAAE,UAAU,EAAE,GAAG,CAAC,CAAC;YAChC,MAAM,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YACxB,IAAI,CAAC,IAAI,CAAC,CAAC,EAAE,8CAA8C,CAAC,CAAC;YAC7D,GAAG,CAAC,IAAI,CAAC,EAAE,SAAS,EAAE,CAAC,CAAC,SAAS,EAAE,KAAK,EAAE,UAAU,EAAE,CAAC,CAAC;QAC1D,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IAED;;;;OAIG;IACH,KAAK,CAAC,aAAa,CAAC,WAAmB;QACrC,MAAM,MAAM,GAAG,IAAI,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,OAAO,EAAE,GAAG,WAAW,CAAC,CAAC;QAC9D,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,KAAK,CAAC,qBAAqB,CAAC,MAAM,CAAC,CAAC;QAC7D,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;YACtB,MAAM,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC,SAAS,CAAC,CAAC;YACpD,CAAC,IAAI,CAAC,CAAC;QACT,CAAC;QACD,OAAO,CAAC,CAAC;IACX,CAAC;IAED,8EAA8E;IAEtE,KAAK,CAAC,UAAU,CAAC,CAAa,EAAE,GAAS;QAC/C,MAAM,GAAG,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC,SAAS,CAAC,CAAC;QAC3D,CAAC,CAAC,QAAQ,IAAI,CAAC,CAAC;QAChB,CAAC,CAAC,eAAe,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC;QACnC,CAAC,CAAC,YAAY,GAAG,GAAG,CAAC,MAAM,CAAC;QAC5B,CAAC,CAAC,gBAAgB;YAChB,GAAG,CAAC,UAAU,KAAK,SAAS,IAAI,GAAG,CAAC,UAAU,KAAK,EAAE;gBACnD,CAAC,CAAE,GAAG,CAAC,UAAyB;gBAChC,CAAC,CAAC,IAAI,CAAC;QAEX,IAAI,GAAG,CAAC,MAAM,KAAK,WAAW,EAAE,CAAC;YAC/B,IAAI,CAAC,kBAAkB,CAAC,CAAC,EAAE,WAAW,EAAE,GAAG,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;YACzD,OAAO;QACT,CAAC;QACD,IACE,GAAG,CAAC,MAAM,KAAK,UAAU;YACzB,CAAC,mBAAmB,CAAC,GAAG,CAAC,UAAU,IAAI,EAAE,CAAC,EAC1C,CAAC;YACD,IAAI,CAAC,kBAAkB,CAAC,CAAC,EAAE,UAAU,EAAE,GAAG,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;YACxD,OAAO;QACT,CAAC;QACD,2DAA2D;QAC3D,IAAI,IAAU,CAAC;QACf,IAAI,CAAC;YACH,IAAI,GAAG,aAAa,CAAC,IAAI,CAAC,KAAK,EAAE,GAAG,EAAE,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC;QACxD,CAAC;QAAC,MAAM,CAAC;YACP,kDAAkD;YAClD,IAAI,GAAG,IAAI,IAAI,CAAC,GAAG,CAAC,OAAO,EAAE,GAAG,KAAK,CAAC,CAAC;QACzC,CAAC;QACD,IAAI,IAAI,CAAC,OAAO,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC;YAC5C,0DAA0D;YAC1D,IAAI,CAAC,iBAAiB,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;YAC/B,OAAO;QACT,CAAC;QACD,CAAC,CAAC,eAAe,GAAG,SAAS,CAAC,IAAI,CAAC,CAAC;IACtC,CAAC;IAEO,kBAAkB,CACxB,CAAa,EACb,KAAuB,EACvB,GAAS,EACT,MAA0B;QAE1B,IAAI,eAAe,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC;YAC7B,OAAO;QACT,CAAC;QACD,WAAW,CAAC,CAAC,EAAE,KAAK,EAAE,GAAG,CAAC,CAAC;QAC3B,IAAI,CAAC,IAAI,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;IACvB,CAAC;IAEO,iBAAiB,CAAC,CAAa,EAAE,GAAS;QAChD,IAAI,eAAe,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC;YAC7B,OAAO;QACT,CAAC;QACD,WAAW,CAAC,CAAC,EAAE,SAAS,EAAE,GAAG,CAAC,CAAC;QAC/B,IAAI,CAAC,IAAI,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC;IAC1B,CAAC;IAEO,IAAI,CAAC,CAAa,EAAE,MAA0B;QACpD,IAAI,IAAI,CAAC,SAAS,KAAK,IAAI,EAAE,CAAC;YAC5B,OAAO;QACT,CAAC;QACD,MAAM,MAAM,GACV,CAAC,CAAC,KAAK,KAAK,WAAW,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,UAAU,CAAC;QACrD,MAAM,IAAI,GAIN,EAAE,CAAC;QACP,IAAI,CAAC,CAAC,gBAAgB,KAAK,IAAI,EAAE,CAAC;YAChC,IAAI,CAAC,UAAU,GAAG,CAAC,CAAC,gBAAgB,CAAC;QACvC,CAAC;QACD,IAAI,MAAM,KAAK,SAAS,IAAI,MAAM,KAAK,EAAE,EAAE,CAAC;YAC1C,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;QACvB,CAAC;QACD,IAAI,CAAC,CAAC,WAAW,KAAK,SAAS,IAAI,CAAC,CAAC,WAAW,KAAK,EAAE,EAAE,CAAC;YACxD,IAAI,CAAC,KAAK,GAAG,GAAG,EAAE,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,WAAY,CAAC,CAAC;QAC9C,CAAC;QACD,MAAM,EAAE,GAAG,kBAAkB,CAC3B,CAAC,CAAC,WAAW,EACb,CAAC,CAAC,SAAS,EACX,MAAM,EACN,IAAI,CACL,CAAC;QACF,IAAI,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC;IACrB,CAAC;CACF;AAED;;;;GAIG;AACH,MAAM,OAAO,sBAAsB;IAChB,OAAO,GAAG,IAAI,GAAG,EAAsB,CAAC;IAEjD,MAAM,CAAC,KAAK,CAAC,UAAkB,EAAE,SAAiB;QACxD,OAAO,GAAG,UAAU,OAAO,SAAS,EAAE,CAAC;IACzC,CAAC;IAED,KAAK,CAAC,GAAG,CAAC,CAAa;QACrB,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,sBAAsB,CAAC,KAAK,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC,SAAS,CAAC,EAAE;YACzE,GAAG,CAAC;SACL,CAAC,CAAC;IACL,CAAC;IAED,KAAK,CAAC,GAAG,CACP,UAAkB,EAClB,SAAiB;QAEjB,MAAM,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CACxB,sBAAsB,CAAC,KAAK,CAAC,UAAU,EAAE,SAAS,CAAC,CACpD,CAAC;QACF,OAAO,CAAC,KAAK,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,CAAC;IAC3C,CAAC;IAED,KAAK,CAAC,UAAU,CAAC,GAAS;QACxB,MAAM,GAAG,GAAiB,EAAE,CAAC;QAC7B,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,EAAE,CAAC;YACtC,IAAI,eAAe,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC;gBAC7B,SAAS;YACX,CAAC;YACD,IAAI,CAAC,CAAC,eAAe,KAAK,IAAI,EAAE,CAAC;gBAC/B,SAAS;YACX,CAAC;YACD,IAAI,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,eAAe,CAAC,IAAI,GAAG,CAAC,OAAO,EAAE,EAAE,CAAC;gBACnD,GAAG,CAAC,IAAI,CAAC,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC;YACrB,CAAC;QACH,CAAC;QACD,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;YAChB,MAAM,EAAE,GAAG,CAAC,CAAC,eAAe,KAAK,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAC1E,MAAM,EAAE,GAAG,CAAC,CAAC,eAAe,KAAK,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAC1E,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC;gBACd,OAAO,EAAE,GAAG,EAAE,CAAC;YACjB,CAAC;YACD,OAAO,CAAC,CAAC,WAAW,GAAG,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAChD,CAAC,CAAC,CAAC;QACH,OAAO,GAAG,CAAC;IACb,CAAC;IAED,KAAK,CAAC,qBAAqB,CAAC,MAAY;QACtC,MAAM,GAAG,GAAiB,EAAE,CAAC;QAC7B,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,EAAE,CAAC;YACtC,IACE,eAAe,CAAC,CAAC,CAAC,KAAK,CAAC;gBACxB,CAAC,CAAC,WAAW,KAAK,SAAS;gBAC3B,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,WAAW,CAAC,IAAI,MAAM,CAAC,OAAO,EAAE,EAC7C,CAAC;gBACD,GAAG,CAAC,IAAI,CAAC,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC;YACrB,CAAC;QACH,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IAED,KAAK,CAAC,MAAM,CAAC,UAAkB,EAAE,SAAiB;QAChD,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,sBAAsB,CAAC,KAAK,CAAC,UAAU,EAAE,SAAS,CAAC,CAAC,CAAC;IAC3E,CAAC;CACF;AAED,SAAS,SAAS,CAAC,CAAO;IACxB,OAAO,CAAC,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,WAAW,EAAE,GAAG,CAAC,CAAC;AACnD,CAAC"}

package/dist/delivery/stage_partition.d.ts

@@ -0,0 +1,87 @@
+/**
+ * Staged-delivery partition computation per DELIVERY.md §3.2.1.
+ *
+ * Given a user's device directory, the per-device scoped
+ * certificates, the set of device public keys for which an inbound
+ * envelope's seal carries an enclosure-recipient wrap, and the
+ * sender address, returns the slice of {@link StagedHeldStage}
+ * values the staging runner feeds into the held-envelope queue.
+ *
+ * @module
+ */
+import type { AddressIdentity } from "../keys/device_certificate.js";
+import type { DeviceCertificate } from "../keys/device_certificate.js";
+import type { DeviceDirectory } from "../keys/device_records.js";
+import type { StagedHeldStage } from "./disposition.js";
+/**
+ * Lookup hook the partition routine calls for each delegated
+ * device's scoped certificate. Returning `null` is treated as "no
+ * current cert"; the device is excluded from the partition (the
+ * spec's effect of certificate revocation per §10.3.7.3 step 3:
+ * "stop delivering inbound envelopes to device_id").
+ */
+export type CertificateProvider = (deviceId: string) => DeviceCertificate | null;
+/** Inputs to {@link partitionStages}. */
+export interface PartitionInput {
+    /**
+     * The user's current device directory. {@link partitionStages}
+     * iterates `directory.devices` to enumerate the account's
+     * devices.
+     */
+    directory: DeviceDirectory;
+    /**
+     * Supplies the scoped certificate for each delegated device.
+     * Called for every device whose role is `delegated`; full-access
+     * devices have no certificate.
+     */
+    certificateProvider: CertificateProvider;
+    /**
+     * Set of device public keys for which the envelope's seal carries
+     * an enclosure-recipient wrap. Only devices whose `device_public_key`
+     * is in this set are eligible for delivery. Pubkeys are compared
+     * verbatim against `DeviceDirectoryEntry.device_public_key` (the
+     * same base64 form the directory uses).
+     */
+    enclosureRecipients: Set<string>;
+    /**
+     * The `brief.from` address the receive matcher evaluates against
+     * per §10.3.4 "for receive, a peer is the sender address of an
+     * inbound envelope after the home server has decrypted the brief".
+     */
+    senderAddress: AddressIdentity;
+}
+/**
+ * Compute the §3.2.1 stage partition for an inbound envelope.
+ *
+ * Algorithm:
+ *
+ *  1. Walk the directory; for each device whose pubkey is in
+ *     `enclosureRecipients`:
+ *     - Full-access devices are deferred (their stage is computed
+ *       implicitly per §10.3.3.1: `max(delegated_stages) + 1`).
+ *     - Delegated devices are evaluated against their scoped cert:
+ *       fetch the cert, run `scope.receive` against `senderAddress`.
+ *       Devices whose receive matcher rejects the envelope (mode,
+ *       allow/deny, or rate limit at the matcher level) are
+ *       excluded from the partition entirely.
+ *  2. Compute the implicit full-access stage as
+ *     `max(delegated_stages_with_mode_not_none) + 1`, taken across
+ *     ALL delegates with `receive.mode !== "none"` — not just those
+ *     that allowed THIS envelope. Matches §10.3.3.1's "the maximum
+ *     is taken over all delegated devices of the account that have
+ *     a receive matcher whose mode is not none". When no such
+ *     delegate exists, full-access devices are at stage 1 and
+ *     staging is a no-op.
+ *  3. Group eligible devices by stage and emit a sorted, monotonic
+ *     `StagedHeldStage[]`. Stages with no devices are pruned.
+ *
+ * Does NOT consult §10.3.3.3 rate-limit counters; rate-limit gating
+ * is the caller's concern. The matcher mode and allow/deny ARE
+ * checked.
+ *
+ * Returns an empty array when no eligible devices remain (the
+ * envelope is undeliverable to any device of the account; the
+ * caller surfaces this as silent or rejected per its own policy).
+ */
+export declare function partitionStages(input: PartitionInput): StagedHeldStage[];
+//# sourceMappingURL=stage_partition.d.ts.map

package/dist/delivery/stage_partition.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"stage_partition.d.ts","sourceRoot":"","sources":["../../src/delivery/stage_partition.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAEH,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,+BAA+B,CAAC;AACrE,OAAO,KAAK,EAAE,iBAAiB,EAAE,MAAM,+BAA+B,CAAC;AACvE,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,2BAA2B,CAAC;AAGjE,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,kBAAkB,CAAC;AAExD;;;;;;GAMG;AACH,MAAM,MAAM,mBAAmB,GAAG,CAAC,QAAQ,EAAE,MAAM,KAAK,iBAAiB,GAAG,IAAI,CAAC;AAEjF,yCAAyC;AACzC,MAAM,WAAW,cAAc;IAC7B;;;;OAIG;IACH,SAAS,EAAE,eAAe,CAAC;IAC3B;;;;OAIG;IACH,mBAAmB,EAAE,mBAAmB,CAAC;IACzC;;;;;;OAMG;IACH,mBAAmB,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;IACjC;;;;OAIG;IACH,aAAa,EAAE,eAAe,CAAC;CAChC;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAgCG;AACH,wBAAgB,eAAe,CAAC,KAAK,EAAE,cAAc,GAAG,eAAe,EAAE,CAiFxE"}