@statewalker/cellb 0.0.0-stage → 0.1.0

package/dist/bindings/celld-queues.js

@@ -0,0 +1,223 @@
+// @ts-expect-error — vendored JS (scripts/vendor-celld.mjs)
+import { queueService } from "../../vendor/celld/queues.js";
+import { deserialize, serialize } from "../v8/serialize.js";
+/**
+ * Queues exactly as celld implements them: celld's own queue cell, producer binding and
+ * consumer batch (harness.js, vendored unchanged, Apache-2.0) on a cellb host. The
+ * queue cell's SQLite layout (`__queue_messages`, `__queue_stats`, …) is therefore celld's, so
+ * a queue's pending messages move between celld and cellb with its cell.
+ *
+ * What the host supplies, as celld's engine does:
+ * - `__queue_policy`: celld_logic::queue (Rust) ported below — every deadline and lease rule;
+ * - `__queue_dispatch`: runs the consumer's `queue()` with celld's batch object, then posts the
+ *   settlement to the queue cell (`/__qSettle`), after the alarm that leased the batch;
+ * - limits, consumer configuration, lease duration (celld's defaults).
+ */
+/** celld_logic::queue and queue_batching defaults (celld 0.6.2). */
+export const CELLD_QUEUE_LIMITS = {
+    maxMessageBytes: 128_000,
+    maxBatchBytes: 256_000,
+    maxBatchMessages: 100,
+    producerGroupMs: 4,
+    maxConcurrency: 250,
+    maxDelaySeconds: 86_400,
+    retentionMs: 4 * 24 * 60 * 60 * 1000,
+    sweepBatchRows: 256,
+};
+/** admission wait (1 s) + handler budget (300 s) + operation deadline (15 s). */
+const LEASE_DURATION_MS = 1_000 + 300_000 + 15_000;
+const minDefined = (xs) => {
+    const v = xs.filter((x) => typeof x === "number");
+    return v.length ? Math.min(...v) : null;
+};
+const retryAt = (now, explicit, configured) => now + (explicit ?? configured ?? 0) * 1000;
+const exhausted = (attempt, maxRetries) => attempt > maxRetries;
+export function queuePolicy(request) {
+    switch (request.op) {
+        case "rearm": {
+            const d = minDefined([
+                request.batchDeadline,
+                request.earliestVisible,
+                request.earliestLeaseExpiry,
+                request.nextSweep,
+            ]);
+            return d === null ? null : Math.max(d, request.now);
+        }
+        case "capacity":
+            return request.active < request.maximum;
+        case "retries":
+            return request.entries.map((e) => ({
+                at: retryAt(request.now, e.explicitSeconds, e.configuredSeconds),
+                exhausted: exhausted(e.attempt, e.maxRetries),
+            }));
+        case "expiry":
+            return request.entries.map((e) => {
+                const attempt = e.priorFailures + 1;
+                const action = e.purgeOnSettle
+                    ? { kind: "delete-purged" }
+                    : exhausted(attempt, e.maxRetries)
+                        ? { kind: "exhausted" }
+                        : { kind: "retry", at: retryAt(request.now, null, e.configuredSeconds) };
+                return { attempt, action };
+            });
+        case "batch": {
+            const leases = [];
+            const deletePurged = [];
+            for (const row of request.rows) {
+                const live = row.leasedUntil != null && row.leasedUntil > request.now;
+                if (row.purgeOnSettle) {
+                    if (!live)
+                        deletePurged.push(row.seq);
+                    continue;
+                }
+                if (leases.length >= request.maxBatchSize || row.visibleAt > request.now || live)
+                    continue;
+                leases.push({
+                    seq: row.seq,
+                    generation: (BigInt(row.leaseGeneration) + 1n).toString(),
+                    reclaimed: row.leasedUntil != null,
+                });
+            }
+            return { leases, deletePurged };
+        }
+        case "settlement": {
+            const current = request.current;
+            const submitted = request.submitted;
+            if (!current.length || current.length !== submitted.length)
+                return false;
+            if (current.some((m, i) => current.slice(0, i).some((p) => p.messageId === m.messageId)))
+                return false;
+            const matched = current.map(() => false);
+            for (const s of submitted) {
+                const i = current.findIndex((c, j) => !matched[j] &&
+                    c.messageId === s.messageId &&
+                    c.seq === s.seq &&
+                    c.generation === s.generation);
+                if (i < 0)
+                    return false;
+                matched[i] = true;
+            }
+            return true;
+        }
+        case "purge": {
+            const del = [];
+            const mark = [];
+            for (const row of request.rows)
+                (row.leaseIdPresent && row.leasedUntil != null && row.leasedUntil > request.now
+                    ? mark
+                    : del).push(row.seq);
+            return { delete: del, markForSettle: mark };
+        }
+        default:
+            throw new Error(`unknown Queue policy operation ${JSON.stringify(request.op)}`);
+    }
+}
+const b64 = (bytes) => {
+    let s = "";
+    for (let i = 0; i < bytes.length; i += 0x8000)
+        s += String.fromCharCode(...bytes.subarray(i, i + 0x8000));
+    return btoa(s);
+};
+const unb64 = (text) => Uint8Array.from(atob(text), (c) => c.charCodeAt(0));
+export function celldQueues(opts) {
+    const consumers = {};
+    for (const c of opts.consumers)
+        consumers[c.queue] = {
+            script: "default",
+            maxBatchSize: c.max_batch_size ?? 10,
+            maxBatchTimeoutMs: (c.max_batch_timeout ?? 5) * 1000,
+            maxRetries: c.max_retries ?? 3,
+            ...(c.dead_letter_queue ? { deadLetterQueue: c.dead_letter_queue } : {}),
+            ...(c.max_concurrency !== undefined ? { maxConcurrency: c.max_concurrency } : {}),
+            ...(c.retry_delay !== undefined ? { retryDelaySeconds: c.retry_delay } : {}),
+        };
+    const cell = {
+        queueLimits: CELLD_QUEUE_LIMITS,
+        queueConsumers: consumers,
+        queueLeaseDurationMs: LEASE_DURATION_MS,
+        compat: { queueJsonMessages: (opts.compatibilityDate ?? "2024-03-18") >= "2024-03-18" },
+        makeNamespace: () => opts.namespace(),
+    };
+    // biome-ignore lint/style/useConst: assigned after the service exists
+    let service;
+    const deliver = async (queue, batchJson) => {
+        const batch = JSON.parse(batchJson);
+        const incoming = {
+            queue,
+            messages: batch.messages.map((m) => ({
+                id: m.id,
+                timestamp: m.timestampMs,
+                body: unb64(m.bodyBase64),
+                contentType: m.contentType,
+                attempts: m.attempts,
+            })),
+            metrics: batch.metrics ?? {},
+        };
+        const result = await service.dispatchQueue("default", incoming);
+        const settlement = {
+            leaseId: batch.leaseId,
+            leases: batch.leases,
+            outcome: result.outcome,
+            error: result.error,
+            ackAll: result.ackAll,
+            retryBatch: result.retryBatch,
+            explicitAcks: result.explicitAcks,
+            retryMessages: result.retryMessages,
+        };
+        // celld: a refused settlement leaves the lease to expire (and the messages to retry).
+        await opts
+            .namespace()
+            .getByName(queue)
+            .fetch(new Request("https://queue.celld.internal/__qSettle", {
+            method: "POST",
+            headers: { "content-type": "application/json" },
+            body: JSON.stringify(settlement),
+        }));
+    };
+    service = queueService({
+        __cell: cell,
+        __queue_policy: (json) => JSON.stringify(queuePolicy(JSON.parse(json))),
+        // The cell awaits only the hand-off; the consumer runs after its alarm (celld: separate event).
+        __queue_dispatch: async (_script, queue, batchJson) => {
+            const work = new Promise((r) => setTimeout(r, 0)).then(() => deliver(queue, batchJson));
+            if (opts.defer)
+                opts.defer(work);
+            else
+                void work.catch((e) => console.error("Queue delivery failed:", e));
+        },
+        // celld: set the alarm and wait for its wake entry. Here the wake entry is published with
+        // the commit (output gate), so setting the alarm is all; the cell passes its storage's
+        // `_scope`, which the wrapper class below points at the storage itself.
+        __queue_alarm_set_wait: (storage, at) => storage.setAlarm(at),
+        __sc_encode: serialize,
+        __sc_decode: deserialize,
+        __cellSweepBatch: (storage, select, reclaim, limit) => {
+            let processed = 0;
+            storage.transactionSync(() => {
+                const rows = select(limit);
+                if (rows.length > limit)
+                    throw new Error("a cell sweep exceeded its row bound");
+                for (const row of rows) {
+                    reclaim(row);
+                    processed++;
+                }
+            });
+            return processed;
+        },
+        __dispatchEntrypointMethodInCurrentEvent: async (_name, _method, batch) => opts.runConsumer(batch),
+        btoa: (bytes) => b64(bytes),
+    });
+    const Base = service.QueueCell;
+    class QueueCell extends Base {
+        constructor(ctx, env) {
+            Object.defineProperty(ctx.storage, "_scope", { value: ctx.storage, configurable: true });
+            super(ctx, env);
+        }
+    }
+    return {
+        QueueCell,
+        /** The producer binding (celld: `__makeQueue(queue, cellName, deliveryDelay)`). */
+        producer: (queue, deliveryDelay = 0) => service.makeQueue(queue, queue, deliveryDelay),
+    };
+}
+//# sourceMappingURL=celld-queues.js.map

package/dist/bindings/celld-queues.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"celld-queues.js","sourceRoot":"","sources":["../../src/bindings/celld-queues.ts"],"names":[],"mappings":"AAAA,4DAA4D;AAC5D,OAAO,EAAE,YAAY,EAAE,MAAM,8BAA8B,CAAC;AAC5D,OAAO,EAAE,WAAW,EAAE,SAAS,EAAE,MAAM,oBAAoB,CAAC;AAE5D;;;;;;;;;;;GAWG;AAEH,oEAAoE;AACpE,MAAM,CAAC,MAAM,kBAAkB,GAAG;IAChC,eAAe,EAAE,OAAO;IACxB,aAAa,EAAE,OAAO;IACtB,gBAAgB,EAAE,GAAG;IACrB,eAAe,EAAE,CAAC;IAClB,cAAc,EAAE,GAAG;IACnB,eAAe,EAAE,MAAM;IACvB,WAAW,EAAE,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,IAAI;IACpC,cAAc,EAAE,GAAG;CACpB,CAAC;AACF,iFAAiF;AACjF,MAAM,iBAAiB,GAAG,KAAK,GAAG,OAAO,GAAG,MAAM,CAAC;AAcnD,MAAM,UAAU,GAAG,CAAC,EAAiC,EAAE,EAAE;IACvD,MAAM,CAAC,GAAG,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,EAAe,EAAE,CAAC,OAAO,CAAC,KAAK,QAAQ,CAAC,CAAC;IAC/D,OAAO,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;AAC1C,CAAC,CAAC;AACF,MAAM,OAAO,GAAG,CAAC,GAAW,EAAE,QAAwB,EAAE,UAA0B,EAAE,EAAE,CACpF,GAAG,GAAG,CAAC,QAAQ,IAAI,UAAU,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC;AAC7C,MAAM,SAAS,GAAG,CAAC,OAAe,EAAE,UAAkB,EAAE,EAAE,CAAC,OAAO,GAAG,UAAU,CAAC;AAEhF,MAAM,UAAU,WAAW,CAAC,OAAU;IACpC,QAAQ,OAAO,CAAC,EAAE,EAAE,CAAC;QACnB,KAAK,OAAO,EAAE,CAAC;YACb,MAAM,CAAC,GAAG,UAAU,CAAC;gBACnB,OAAO,CAAC,aAAa;gBACrB,OAAO,CAAC,eAAe;gBACvB,OAAO,CAAC,mBAAmB;gBAC3B,OAAO,CAAC,SAAS;aAClB,CAAC,CAAC;YACH,OAAO,CAAC,KAAK,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,OAAO,CAAC,GAAG,CAAC,CAAC;QACtD,CAAC;QACD,KAAK,UAAU;YACb,OAAO,OAAO,CAAC,MAAM,GAAG,OAAO,CAAC,OAAO,CAAC;QAC1C,KAAK,SAAS;YACZ,OAAQ,OAAO,CAAC,OAAe,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;gBAC1C,EAAE,EAAE,OAAO,CAAC,OAAO,CAAC,GAAG,EAAE,CAAC,CAAC,eAAe,EAAE,CAAC,CAAC,iBAAiB,CAAC;gBAChE,SAAS,EAAE,SAAS,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC,UAAU,CAAC;aAC9C,CAAC,CAAC,CAAC;QACN,KAAK,QAAQ;YACX,OAAQ,OAAO,CAAC,OAAe,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE;gBACxC,MAAM,OAAO,GAAG,CAAC,CAAC,aAAa,GAAG,CAAC,CAAC;gBACpC,MAAM,MAAM,GAAG,CAAC,CAAC,aAAa;oBAC5B,CAAC,CAAC,EAAE,IAAI,EAAE,eAAe,EAAE;oBAC3B,CAAC,CAAC,SAAS,CAAC,OAAO,EAAE,CAAC,CAAC,UAAU,CAAC;wBAChC,CAAC,CAAC,EAAE,IAAI,EAAE,WAAW,EAAE;wBACvB,CAAC,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,EAAE,EAAE,OAAO,CAAC,OAAO,CAAC,GAAG,EAAE,IAAI,EAAE,CAAC,CAAC,iBAAiB,CAAC,EAAE,CAAC;gBAC7E,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,CAAC;YAC7B,CAAC,CAAC,CAAC;QACL,KAAK,OAAO,EAAE,CAAC;YACb,MAAM,MAAM,GAAQ,EAAE,CAAC;YACvB,MAAM,YAAY,GAAa,EAAE,CAAC;YAClC,KAAK,MAAM,GAAG,IAAI,OAAO,CAAC,IAAW,EAAE,CAAC;gBACtC,MAAM,IAAI,GAAG,GAAG,CAAC,WAAW,IAAI,IAAI,IAAI,GAAG,CAAC,WAAW,GAAG,OAAO,CAAC,GAAG,CAAC;gBACtE,IAAI,GAAG,CAAC,aAAa,EAAE,CAAC;oBACtB,IAAI,CAAC,IAAI;wBAAE,YAAY,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;oBACtC,SAAS;gBACX,CAAC;gBACD,IAAI,MAAM,CAAC,MAAM,IAAI,OAAO,CAAC,YAAY,IAAI,GAAG,CAAC,SAAS,GAAG,OAAO,CAAC,GAAG,IAAI,IAAI;oBAAE,SAAS;gBAC3F,MAAM,CAAC,IAAI,CAAC;oBACV,GAAG,EAAE,GAAG,CAAC,GAAG;oBACZ,UAAU,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,eAAe,CAAC,GAAG,EAAE,CAAC,CAAC,QAAQ,EAAE;oBACzD,SAAS,EAAE,GAAG,CAAC,WAAW,IAAI,IAAI;iBACnC,CAAC,CAAC;YACL,CAAC;YACD,OAAO,EAAE,MAAM,EAAE,YAAY,EAAE,CAAC;QAClC,CAAC;QACD,KAAK,YAAY,EAAE,CAAC;YAClB,MAAM,OAAO,GAAG,OAAO,CAAC,OAAc,CAAC;YACvC,MAAM,SAAS,GAAG,OAAO,CAAC,SAAgB,CAAC;YAC3C,IAAI,CAAC,OAAO,CAAC,MAAM,IAAI,OAAO,CAAC,MAAM,KAAK,SAAS,CAAC,MAAM;gBAAE,OAAO,KAAK,CAAC;YACzE,IAAI,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,KAAK,CAAC,CAAC,SAAS,CAAC,CAAC;gBACtF,OAAO,KAAK,CAAC;YACf,MAAM,OAAO,GAAG,OAAO,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,KAAK,CAAC,CAAC;YACzC,KAAK,MAAM,CAAC,IAAI,SAAS,EAAE,CAAC;gBAC1B,MAAM,CAAC,GAAG,OAAO,CAAC,SAAS,CACzB,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CACP,CAAC,OAAO,CAAC,CAAC,CAAC;oBACX,CAAC,CAAC,SAAS,KAAK,CAAC,CAAC,SAAS;oBAC3B,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,GAAG;oBACf,CAAC,CAAC,UAAU,KAAK,CAAC,CAAC,UAAU,CAChC,CAAC;gBACF,IAAI,CAAC,GAAG,CAAC;oBAAE,OAAO,KAAK,CAAC;gBACxB,OAAO,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;YACpB,CAAC;YACD,OAAO,IAAI,CAAC;QACd,CAAC;QACD,KAAK,OAAO,EAAE,CAAC;YACb,MAAM,GAAG,GAAa,EAAE,CAAC;YACzB,MAAM,IAAI,GAAa,EAAE,CAAC;YAC1B,KAAK,MAAM,GAAG,IAAI,OAAO,CAAC,IAAW;gBACnC,CAAC,GAAG,CAAC,cAAc,IAAI,GAAG,CAAC,WAAW,IAAI,IAAI,IAAI,GAAG,CAAC,WAAW,GAAG,OAAO,CAAC,GAAG;oBAC7E,CAAC,CAAC,IAAI;oBACN,CAAC,CAAC,GAAG,CACN,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YAClB,OAAO,EAAE,MAAM,EAAE,GAAG,EAAE,aAAa,EAAE,IAAI,EAAE,CAAC;QAC9C,CAAC;QACD;YACE,MAAM,IAAI,KAAK,CAAC,kCAAkC,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;IACpF,CAAC;AACH,CAAC;AAED,MAAM,GAAG,GAAG,CAAC,KAAiB,EAAE,EAAE;IAChC,IAAI,CAAC,GAAG,EAAE,CAAC;IACX,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,IAAI,MAAM;QAC3C,CAAC,IAAI,MAAM,CAAC,YAAY,CAAC,GAAG,KAAK,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC;IAC7D,OAAO,IAAI,CAAC,CAAC,CAAC,CAAC;AACjB,CAAC,CAAC;AACF,MAAM,KAAK,GAAG,CAAC,IAAY,EAAE,EAAE,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;AAEpF,MAAM,UAAU,WAAW,CAAC,IAU3B;IACC,MAAM,SAAS,GAAsB,EAAE,CAAC;IACxC,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,SAAS;QAC5B,SAAS,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG;YACnB,MAAM,EAAE,SAAS;YACjB,YAAY,EAAE,CAAC,CAAC,cAAc,IAAI,EAAE;YACpC,iBAAiB,EAAE,CAAC,CAAC,CAAC,iBAAiB,IAAI,CAAC,CAAC,GAAG,IAAI;YACpD,UAAU,EAAE,CAAC,CAAC,WAAW,IAAI,CAAC;YAC9B,GAAG,CAAC,CAAC,CAAC,iBAAiB,CAAC,CAAC,CAAC,EAAE,eAAe,EAAE,CAAC,CAAC,iBAAiB,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YACxE,GAAG,CAAC,CAAC,CAAC,eAAe,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,cAAc,EAAE,CAAC,CAAC,eAAe,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YACjF,GAAG,CAAC,CAAC,CAAC,WAAW,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,iBAAiB,EAAE,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;SAC7E,CAAC;IACJ,MAAM,IAAI,GAAG;QACX,WAAW,EAAE,kBAAkB;QAC/B,cAAc,EAAE,SAAS;QACzB,oBAAoB,EAAE,iBAAiB;QACvC,MAAM,EAAE,EAAE,iBAAiB,EAAE,CAAC,IAAI,CAAC,iBAAiB,IAAI,YAAY,CAAC,IAAI,YAAY,EAAE;QACvF,aAAa,EAAE,GAAG,EAAE,CAAC,IAAI,CAAC,SAAS,EAAE;KACtC,CAAC;IACF,sEAAsE;IACtE,IAAI,OAIH,CAAC;IACF,MAAM,OAAO,GAAG,KAAK,EAAE,KAAa,EAAE,SAAiB,EAAE,EAAE;QACzD,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,SAAS,CAAM,CAAC;QACzC,MAAM,QAAQ,GAAG;YACf,KAAK;YACL,QAAQ,EAAG,KAAK,CAAC,QAAgB,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;gBAC5C,EAAE,EAAE,CAAC,CAAC,EAAE;gBACR,SAAS,EAAE,CAAC,CAAC,WAAW;gBACxB,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC,UAAU,CAAC;gBACzB,WAAW,EAAE,CAAC,CAAC,WAAW;gBAC1B,QAAQ,EAAE,CAAC,CAAC,QAAQ;aACrB,CAAC,CAAC;YACH,OAAO,EAAE,KAAK,CAAC,OAAO,IAAI,EAAE;SAC7B,CAAC;QACF,MAAM,MAAM,GAAG,MAAM,OAAO,CAAC,aAAa,CAAC,SAAS,EAAE,QAAQ,CAAC,CAAC;QAChE,MAAM,UAAU,GAAG;YACjB,OAAO,EAAE,KAAK,CAAC,OAAO;YACtB,MAAM,EAAE,KAAK,CAAC,MAAM;YACpB,OAAO,EAAE,MAAM,CAAC,OAAO;YACvB,KAAK,EAAE,MAAM,CAAC,KAAK;YACnB,MAAM,EAAE,MAAM,CAAC,MAAM;YACrB,UAAU,EAAE,MAAM,CAAC,UAAU;YAC7B,YAAY,EAAE,MAAM,CAAC,YAAY;YACjC,aAAa,EAAE,MAAM,CAAC,aAAa;SACpC,CAAC;QACF,sFAAsF;QACtF,MAAM,IAAI;aACP,SAAS,EAAE;aACX,SAAS,CAAC,KAAK,CAAC;aAChB,KAAK,CACJ,IAAI,OAAO,CAAC,wCAAwC,EAAE;YACpD,MAAM,EAAE,MAAM;YACd,OAAO,EAAE,EAAE,cAAc,EAAE,kBAAkB,EAAE;YAC/C,IAAI,EAAE,IAAI,CAAC,SAAS,CAAC,UAAU,CAAC;SACjC,CAAC,CACH,CAAC;IACN,CAAC,CAAC;IACF,OAAO,GAAG,YAAY,CAAC;QACrB,MAAM,EAAE,IAAI;QACZ,cAAc,EAAE,CAAC,IAAY,EAAE,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC;QAC/E,gGAAgG;QAChG,gBAAgB,EAAE,KAAK,EAAE,OAAe,EAAE,KAAa,EAAE,SAAiB,EAAE,EAAE;YAC5E,MAAM,IAAI,GAAG,IAAI,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,OAAO,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC,CAAC;YACxF,IAAI,IAAI,CAAC,KAAK;gBAAE,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;;gBAC5B,KAAK,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,KAAK,CAAC,wBAAwB,EAAE,CAAC,CAAC,CAAC,CAAC;QAC1E,CAAC;QACD,0FAA0F;QAC1F,uFAAuF;QACvF,wEAAwE;QACxE,sBAAsB,EAAE,CAAC,OAAgD,EAAE,EAAU,EAAE,EAAE,CACvF,OAAO,CAAC,QAAQ,CAAC,EAAE,CAAC;QACtB,WAAW,EAAE,SAAS;QACtB,WAAW,EAAE,WAAW;QACxB,gBAAgB,EAAE,CAChB,OAAY,EACZ,MAAgC,EAChC,OAA+B,EAC/B,KAAa,EACb,EAAE;YACF,IAAI,SAAS,GAAG,CAAC,CAAC;YAClB,OAAO,CAAC,eAAe,CAAC,GAAG,EAAE;gBAC3B,MAAM,IAAI,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC;gBAC3B,IAAI,IAAI,CAAC,MAAM,GAAG,KAAK;oBAAE,MAAM,IAAI,KAAK,CAAC,qCAAqC,CAAC,CAAC;gBAChF,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;oBACvB,OAAO,CAAC,GAAG,CAAC,CAAC;oBACb,SAAS,EAAE,CAAC;gBACd,CAAC;YACH,CAAC,CAAC,CAAC;YACH,OAAO,SAAS,CAAC;QACnB,CAAC;QACD,wCAAwC,EAAE,KAAK,EAC7C,KAAa,EACb,OAAe,EACf,KAAc,EACd,EAAE,CAAC,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC;QAC5B,IAAI,EAAE,CAAC,KAAiB,EAAE,EAAE,CAAC,GAAG,CAAC,KAAK,CAAC;KACxC,CAAC,CAAC;IACH,MAAM,IAAI,GAAG,OAAO,CAAC,SAA+C,CAAC;IACrE,MAAM,SAAU,SAAQ,IAAI;QAC1B,YAAY,GAAQ,EAAE,GAAQ;YAC5B,MAAM,CAAC,cAAc,CAAC,GAAG,CAAC,OAAO,EAAE,QAAQ,EAAE,EAAE,KAAK,EAAE,GAAG,CAAC,OAAO,EAAE,YAAY,EAAE,IAAI,EAAE,CAAC,CAAC;YACzF,KAAK,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QAClB,CAAC;KACF;IACD,OAAO;QACL,SAAS;QACT,mFAAmF;QACnF,QAAQ,EAAE,CAAC,KAAa,EAAE,aAAa,GAAG,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,SAAS,CAAC,KAAK,EAAE,KAAK,EAAE,aAAa,CAAC;KAC/F,CAAC;AACJ,CAAC","sourcesContent":["// @ts-expect-error — vendored JS (scripts/vendor-celld.mjs)\nimport { queueService } from \"../../vendor/celld/queues.js\";\nimport { deserialize, serialize } from \"../v8/serialize.js\";\n\n/**\n * Queues exactly as celld implements them: celld's own queue cell, producer binding and\n * consumer batch (harness.js, vendored unchanged, Apache-2.0) on a cellb host. The\n * queue cell's SQLite layout (`__queue_messages`, `__queue_stats`, …) is therefore celld's, so\n * a queue's pending messages move between celld and cellb with its cell.\n *\n * What the host supplies, as celld's engine does:\n * - `__queue_policy`: celld_logic::queue (Rust) ported below — every deadline and lease rule;\n * - `__queue_dispatch`: runs the consumer's `queue()` with celld's batch object, then posts the\n *   settlement to the queue cell (`/__qSettle`), after the alarm that leased the batch;\n * - limits, consumer configuration, lease duration (celld's defaults).\n */\n\n/** celld_logic::queue and queue_batching defaults (celld 0.6.2). */\nexport const CELLD_QUEUE_LIMITS = {\n  maxMessageBytes: 128_000,\n  maxBatchBytes: 256_000,\n  maxBatchMessages: 100,\n  producerGroupMs: 4,\n  maxConcurrency: 250,\n  maxDelaySeconds: 86_400,\n  retentionMs: 4 * 24 * 60 * 60 * 1000,\n  sweepBatchRows: 256,\n};\n/** admission wait (1 s) + handler budget (300 s) + operation deadline (15 s). */\nconst LEASE_DURATION_MS = 1_000 + 300_000 + 15_000;\n\nexport interface QueueConsumerConfig {\n  queue: string;\n  max_batch_size?: number;\n  max_batch_timeout?: number;\n  max_retries?: number;\n  dead_letter_queue?: string;\n  max_concurrency?: number;\n  retry_delay?: number;\n}\n\n// ---- celld_logic::queue, ported (logic/queue.rs, celld/queue_policy.rs) ----\ntype J = Record<string, any>;\nconst minDefined = (xs: (number | null | undefined)[]) => {\n  const v = xs.filter((x): x is number => typeof x === \"number\");\n  return v.length ? Math.min(...v) : null;\n};\nconst retryAt = (now: number, explicit?: number | null, configured?: number | null) =>\n  now + (explicit ?? configured ?? 0) * 1000;\nconst exhausted = (attempt: number, maxRetries: number) => attempt > maxRetries;\n\nexport function queuePolicy(request: J): unknown {\n  switch (request.op) {\n    case \"rearm\": {\n      const d = minDefined([\n        request.batchDeadline,\n        request.earliestVisible,\n        request.earliestLeaseExpiry,\n        request.nextSweep,\n      ]);\n      return d === null ? null : Math.max(d, request.now);\n    }\n    case \"capacity\":\n      return request.active < request.maximum;\n    case \"retries\":\n      return (request.entries as J[]).map((e) => ({\n        at: retryAt(request.now, e.explicitSeconds, e.configuredSeconds),\n        exhausted: exhausted(e.attempt, e.maxRetries),\n      }));\n    case \"expiry\":\n      return (request.entries as J[]).map((e) => {\n        const attempt = e.priorFailures + 1;\n        const action = e.purgeOnSettle\n          ? { kind: \"delete-purged\" }\n          : exhausted(attempt, e.maxRetries)\n            ? { kind: \"exhausted\" }\n            : { kind: \"retry\", at: retryAt(request.now, null, e.configuredSeconds) };\n        return { attempt, action };\n      });\n    case \"batch\": {\n      const leases: J[] = [];\n      const deletePurged: number[] = [];\n      for (const row of request.rows as J[]) {\n        const live = row.leasedUntil != null && row.leasedUntil > request.now;\n        if (row.purgeOnSettle) {\n          if (!live) deletePurged.push(row.seq);\n          continue;\n        }\n        if (leases.length >= request.maxBatchSize || row.visibleAt > request.now || live) continue;\n        leases.push({\n          seq: row.seq,\n          generation: (BigInt(row.leaseGeneration) + 1n).toString(),\n          reclaimed: row.leasedUntil != null,\n        });\n      }\n      return { leases, deletePurged };\n    }\n    case \"settlement\": {\n      const current = request.current as J[];\n      const submitted = request.submitted as J[];\n      if (!current.length || current.length !== submitted.length) return false;\n      if (current.some((m, i) => current.slice(0, i).some((p) => p.messageId === m.messageId)))\n        return false;\n      const matched = current.map(() => false);\n      for (const s of submitted) {\n        const i = current.findIndex(\n          (c, j) =>\n            !matched[j] &&\n            c.messageId === s.messageId &&\n            c.seq === s.seq &&\n            c.generation === s.generation,\n        );\n        if (i < 0) return false;\n        matched[i] = true;\n      }\n      return true;\n    }\n    case \"purge\": {\n      const del: string[] = [];\n      const mark: string[] = [];\n      for (const row of request.rows as J[])\n        (row.leaseIdPresent && row.leasedUntil != null && row.leasedUntil > request.now\n          ? mark\n          : del\n        ).push(row.seq);\n      return { delete: del, markForSettle: mark };\n    }\n    default:\n      throw new Error(`unknown Queue policy operation ${JSON.stringify(request.op)}`);\n  }\n}\n\nconst b64 = (bytes: Uint8Array) => {\n  let s = \"\";\n  for (let i = 0; i < bytes.length; i += 0x8000)\n    s += String.fromCharCode(...bytes.subarray(i, i + 0x8000));\n  return btoa(s);\n};\nconst unb64 = (text: string) => Uint8Array.from(atob(text), (c) => c.charCodeAt(0));\n\nexport function celldQueues(opts: {\n  /** The namespace of the `__Queue` cells (celld's fleet-wide namespace). */\n  namespace: () => { getByName(name: string): { fetch(req: Request): Promise<Response> } };\n  consumers: QueueConsumerConfig[];\n  /** Runs the Worker's `queue(batch)` handler (celld: the consumer script's entrypoint). */\n  runConsumer: (batch: unknown) => Promise<void>;\n  /** Wrangler `compatibility_date` decides the default content type (json from 2024-03-18). */\n  compatibilityDate?: string;\n  /** Background work after the leasing alarm (the consumer runs outside the cell's event). */\n  defer?: (work: Promise<unknown>) => void;\n}) {\n  const consumers: Record<string, J> = {};\n  for (const c of opts.consumers)\n    consumers[c.queue] = {\n      script: \"default\",\n      maxBatchSize: c.max_batch_size ?? 10,\n      maxBatchTimeoutMs: (c.max_batch_timeout ?? 5) * 1000,\n      maxRetries: c.max_retries ?? 3,\n      ...(c.dead_letter_queue ? { deadLetterQueue: c.dead_letter_queue } : {}),\n      ...(c.max_concurrency !== undefined ? { maxConcurrency: c.max_concurrency } : {}),\n      ...(c.retry_delay !== undefined ? { retryDelaySeconds: c.retry_delay } : {}),\n    };\n  const cell = {\n    queueLimits: CELLD_QUEUE_LIMITS,\n    queueConsumers: consumers,\n    queueLeaseDurationMs: LEASE_DURATION_MS,\n    compat: { queueJsonMessages: (opts.compatibilityDate ?? \"2024-03-18\") >= \"2024-03-18\" },\n    makeNamespace: () => opts.namespace(),\n  };\n  // biome-ignore lint/style/useConst: assigned after the service exists\n  let service: {\n    QueueCell: unknown;\n    makeQueue: (q: string, cellName: string, delay: number) => unknown;\n    dispatchQueue: (name: string, incoming: J) => Promise<J>;\n  };\n  const deliver = async (queue: string, batchJson: string) => {\n    const batch = JSON.parse(batchJson) as J;\n    const incoming = {\n      queue,\n      messages: (batch.messages as J[]).map((m) => ({\n        id: m.id,\n        timestamp: m.timestampMs,\n        body: unb64(m.bodyBase64),\n        contentType: m.contentType,\n        attempts: m.attempts,\n      })),\n      metrics: batch.metrics ?? {},\n    };\n    const result = await service.dispatchQueue(\"default\", incoming);\n    const settlement = {\n      leaseId: batch.leaseId,\n      leases: batch.leases,\n      outcome: result.outcome,\n      error: result.error,\n      ackAll: result.ackAll,\n      retryBatch: result.retryBatch,\n      explicitAcks: result.explicitAcks,\n      retryMessages: result.retryMessages,\n    };\n    // celld: a refused settlement leaves the lease to expire (and the messages to retry).\n    await opts\n      .namespace()\n      .getByName(queue)\n      .fetch(\n        new Request(\"https://queue.celld.internal/__qSettle\", {\n          method: \"POST\",\n          headers: { \"content-type\": \"application/json\" },\n          body: JSON.stringify(settlement),\n        }),\n      );\n  };\n  service = queueService({\n    __cell: cell,\n    __queue_policy: (json: string) => JSON.stringify(queuePolicy(JSON.parse(json))),\n    // The cell awaits only the hand-off; the consumer runs after its alarm (celld: separate event).\n    __queue_dispatch: async (_script: string, queue: string, batchJson: string) => {\n      const work = new Promise((r) => setTimeout(r, 0)).then(() => deliver(queue, batchJson));\n      if (opts.defer) opts.defer(work);\n      else void work.catch((e) => console.error(\"Queue delivery failed:\", e));\n    },\n    // celld: set the alarm and wait for its wake entry. Here the wake entry is published with\n    // the commit (output gate), so setting the alarm is all; the cell passes its storage's\n    // `_scope`, which the wrapper class below points at the storage itself.\n    __queue_alarm_set_wait: (storage: { setAlarm(at: number): Promise<void> }, at: number) =>\n      storage.setAlarm(at),\n    __sc_encode: serialize,\n    __sc_decode: deserialize,\n    __cellSweepBatch: (\n      storage: any,\n      select: (n: number) => unknown[],\n      reclaim: (row: unknown) => void,\n      limit: number,\n    ) => {\n      let processed = 0;\n      storage.transactionSync(() => {\n        const rows = select(limit);\n        if (rows.length > limit) throw new Error(\"a cell sweep exceeded its row bound\");\n        for (const row of rows) {\n          reclaim(row);\n          processed++;\n        }\n      });\n      return processed;\n    },\n    __dispatchEntrypointMethodInCurrentEvent: async (\n      _name: string,\n      _method: string,\n      batch: unknown,\n    ) => opts.runConsumer(batch),\n    btoa: (bytes: Uint8Array) => b64(bytes),\n  });\n  const Base = service.QueueCell as new (ctx: any, env: any) => object;\n  class QueueCell extends Base {\n    constructor(ctx: any, env: any) {\n      Object.defineProperty(ctx.storage, \"_scope\", { value: ctx.storage, configurable: true });\n      super(ctx, env);\n    }\n  }\n  return {\n    QueueCell,\n    /** The producer binding (celld: `__makeQueue(queue, cellName, deliveryDelay)`). */\n    producer: (queue: string, deliveryDelay = 0) => service.makeQueue(queue, queue, deliveryDelay),\n  };\n}\n"]}

package/dist/bindings/celld-workflows.d.ts

@@ -0,0 +1,22 @@
+/**
+ * Workflows exactly as celld implements them: celld's own instance cell and binding
+ * (harness.js, vendored unchanged, Apache-2.0) on a cellb host. An instance is a cell
+ * `__Workflow.<script>:<id of "<workflow>/<instance>">` whose state is celld's KV records
+ * (`__wf.meta`, `__wf.<generation>.step.<n>.<name>`, V8-serialized) plus its alarm — so a
+ * running or sleeping instance moves between celld and cellb with its cell.
+ */
+export declare function celldWorkflows(opts: {
+    script: string;
+    /** workflow name → exported class name (wrangler `workflows`). */
+    workflows: Record<string, string>;
+    /** The Worker's exports (the workflow classes live there). */
+    exports: () => Record<string, unknown>;
+    env: () => unknown;
+    namespace: () => unknown;
+    waitUntil?: (p: Promise<unknown>) => void;
+}): {
+    className: string;
+    WorkflowCell: any;
+    binding: (workflowName: string) => any;
+    NonRetryableError: any;
+};

package/dist/bindings/celld-workflows.js

@@ -0,0 +1,54 @@
+// @ts-expect-error — vendored JS (scripts/vendor-celld.mjs)
+import { workflowService } from "../../vendor/celld/workflows.js";
+import { serialize } from "../v8/serialize.js";
+/**
+ * Workflows exactly as celld implements them: celld's own instance cell and binding
+ * (harness.js, vendored unchanged, Apache-2.0) on a cellb host. An instance is a cell
+ * `__Workflow.<script>:<id of "<workflow>/<instance>">` whose state is celld's KV records
+ * (`__wf.meta`, `__wf.<generation>.step.<n>.<name>`, V8-serialized) plus its alarm — so a
+ * running or sleeping instance moves between celld and cellb with its cell.
+ */
+export function celldWorkflows(opts) {
+    // Async-context frame of the step being run (celld: a CPED-backed frame). A plain slot here:
+    // it serves celld's check that refuses a step started inside another step's callback.
+    let frame;
+    const service = workflowService({
+        __cell: {
+            get workflows() {
+                return opts.workflows;
+            },
+            get env() {
+                return opts.env();
+            },
+            script: opts.script,
+            makeNamespace: () => opts.namespace(),
+        },
+        __cf: {
+            get exports() {
+                return opts.exports();
+            },
+        },
+        __sc_encode: serialize,
+        __als_get: () => frame,
+        __als_set: (f) => {
+            frame = f;
+        },
+        // Inside the instance's transactionSync: the storage itself is the "scope".
+        __alarm_set: (storage, at) => storage.setAlarmSync(at),
+        __alarm_delete: (storage) => storage.clearAlarmSync(),
+        __registerWaitUntil: (p) => {
+            if (opts.waitUntil)
+                opts.waitUntil(p);
+            else
+                void Promise.resolve(p).catch(() => { });
+        },
+        __ctxRun: (_frame, fn) => fn(),
+    });
+    return {
+        className: `__Workflow.${opts.script}`,
+        WorkflowCell: service.WorkflowCell,
+        binding: (workflowName) => service.makeWorkflow(workflowName),
+        NonRetryableError: service.NonRetryableError,
+    };
+}
+//# sourceMappingURL=celld-workflows.js.map

package/dist/bindings/celld-workflows.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"celld-workflows.js","sourceRoot":"","sources":["../../src/bindings/celld-workflows.ts"],"names":[],"mappings":"AAAA,4DAA4D;AAC5D,OAAO,EAAE,eAAe,EAAE,MAAM,iCAAiC,CAAC;AAClE,OAAO,EAAE,SAAS,EAAE,MAAM,oBAAoB,CAAC;AAE/C;;;;;;GAMG;AACH,MAAM,UAAU,cAAc,CAAC,IAS9B;IACC,6FAA6F;IAC7F,sFAAsF;IACtF,IAAI,KAAc,CAAC;IACnB,MAAM,OAAO,GAAG,eAAe,CAAC;QAC9B,MAAM,EAAE;YACN,IAAI,SAAS;gBACX,OAAO,IAAI,CAAC,SAAS,CAAC;YACxB,CAAC;YACD,IAAI,GAAG;gBACL,OAAO,IAAI,CAAC,GAAG,EAAE,CAAC;YACpB,CAAC;YACD,MAAM,EAAE,IAAI,CAAC,MAAM;YACnB,aAAa,EAAE,GAAG,EAAE,CAAC,IAAI,CAAC,SAAS,EAAE;SACtC;QACD,IAAI,EAAE;YACJ,IAAI,OAAO;gBACT,OAAO,IAAI,CAAC,OAAO,EAAE,CAAC;YACxB,CAAC;SACF;QACD,WAAW,EAAE,SAAS;QACtB,SAAS,EAAE,GAAG,EAAE,CAAC,KAAK;QACtB,SAAS,EAAE,CAAC,CAAU,EAAE,EAAE;YACxB,KAAK,GAAG,CAAC,CAAC;QACZ,CAAC;QACD,4EAA4E;QAC5E,WAAW,EAAE,CAAC,OAA2C,EAAE,EAAU,EAAE,EAAE,CACvE,OAAO,CAAC,YAAY,CAAC,EAAE,CAAC;QAC1B,cAAc,EAAE,CAAC,OAAmC,EAAE,EAAE,CAAC,OAAO,CAAC,cAAc,EAAE;QACjF,mBAAmB,EAAE,CAAC,CAAmB,EAAE,EAAE;YAC3C,IAAI,IAAI,CAAC,SAAS;gBAAE,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;;gBACjC,KAAK,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,EAAE,GAAE,CAAC,CAAC,CAAC;QAC/C,CAAC;QACD,QAAQ,EAAE,CAAC,MAAe,EAAE,EAAiB,EAAE,EAAE,CAAC,EAAE,EAAE;KACvD,CAAC,CAAC;IACH,OAAO;QACL,SAAS,EAAE,cAAc,IAAI,CAAC,MAAM,EAAE;QACtC,YAAY,EAAE,OAAO,CAAC,YAAY;QAClC,OAAO,EAAE,CAAC,YAAoB,EAAE,EAAE,CAAC,OAAO,CAAC,YAAY,CAAC,YAAY,CAAC;QACrE,iBAAiB,EAAE,OAAO,CAAC,iBAAiB;KAC7C,CAAC;AACJ,CAAC","sourcesContent":["// @ts-expect-error — vendored JS (scripts/vendor-celld.mjs)\nimport { workflowService } from \"../../vendor/celld/workflows.js\";\nimport { serialize } from \"../v8/serialize.js\";\n\n/**\n * Workflows exactly as celld implements them: celld's own instance cell and binding\n * (harness.js, vendored unchanged, Apache-2.0) on a cellb host. An instance is a cell\n * `__Workflow.<script>:<id of \"<workflow>/<instance>\">` whose state is celld's KV records\n * (`__wf.meta`, `__wf.<generation>.step.<n>.<name>`, V8-serialized) plus its alarm — so a\n * running or sleeping instance moves between celld and cellb with its cell.\n */\nexport function celldWorkflows(opts: {\n  script: string;\n  /** workflow name → exported class name (wrangler `workflows`). */\n  workflows: Record<string, string>;\n  /** The Worker's exports (the workflow classes live there). */\n  exports: () => Record<string, unknown>;\n  env: () => unknown;\n  namespace: () => unknown;\n  waitUntil?: (p: Promise<unknown>) => void;\n}) {\n  // Async-context frame of the step being run (celld: a CPED-backed frame). A plain slot here:\n  // it serves celld's check that refuses a step started inside another step's callback.\n  let frame: unknown;\n  const service = workflowService({\n    __cell: {\n      get workflows() {\n        return opts.workflows;\n      },\n      get env() {\n        return opts.env();\n      },\n      script: opts.script,\n      makeNamespace: () => opts.namespace(),\n    },\n    __cf: {\n      get exports() {\n        return opts.exports();\n      },\n    },\n    __sc_encode: serialize,\n    __als_get: () => frame,\n    __als_set: (f: unknown) => {\n      frame = f;\n    },\n    // Inside the instance's transactionSync: the storage itself is the \"scope\".\n    __alarm_set: (storage: { setAlarmSync(at: number): void }, at: number) =>\n      storage.setAlarmSync(at),\n    __alarm_delete: (storage: { clearAlarmSync(): void }) => storage.clearAlarmSync(),\n    __registerWaitUntil: (p: Promise<unknown>) => {\n      if (opts.waitUntil) opts.waitUntil(p);\n      else void Promise.resolve(p).catch(() => {});\n    },\n    __ctxRun: (_frame: unknown, fn: () => unknown) => fn(),\n  });\n  return {\n    className: `__Workflow.${opts.script}`,\n    WorkflowCell: service.WorkflowCell,\n    binding: (workflowName: string) => service.makeWorkflow(workflowName),\n    NonRetryableError: service.NonRetryableError,\n  };\n}\n"]}

package/dist/bindings/cron.d.ts

@@ -0,0 +1,27 @@
+export interface CronSchedule {
+    readonly text: string;
+    matches(t: number): boolean;
+    /** First occurrence strictly after `t` (ms), at a whole minute. */
+    next(t: number): number;
+}
+export declare function parseCron(text: string): CronSchedule;
+export interface CronClock {
+    now(): number;
+    setTimeout(fn: () => void, ms: number): unknown;
+    clearTimeout(h: unknown): void;
+}
+/**
+ * Runs the Worker's `scheduled(controller, env, ctx)` for each expression, as celld does:
+ * one invocation at a time with its `waitUntil()` work drained before the next; a throwing
+ * handler retries after 4 s, doubling, until six failures, `controller.noRetry()` or the next
+ * occurrence; `scheduledTime` names the occurrence, not the attempt.
+ */
+/** Where the last fired occurrence of each expression is kept (for the downtime catch-up). */
+export interface CronStateStore {
+    get(expression: string): number | undefined;
+    set(expression: string, scheduledTime: number): void;
+}
+export declare function startCronTriggers(expressions: string[], handler: (controller: unknown, ctx: {
+    waitUntil(p: Promise<unknown>): void;
+    passThroughOnException(): void;
+}) => unknown, clock: CronClock, state?: CronStateStore): () => void;

package/dist/bindings/cron.js

@@ -0,0 +1,232 @@
+/**
+ * Cron Triggers in celld's dialect (docs/services/cron-triggers.md, = Cloudflare's):
+ * five fields — minute, hour, day of month, month, day of week — UTC, one-minute resolution.
+ * `*`, values, `a-b`, `a,b`, `/n`; month and weekday names; weekdays 1–7 from SUNDAY;
+ * day of month `L`, `L-<n>`, `LW`, `L-<n>W`, `<d>W`; day of week `<dow>L`, `<dow>#<n>`.
+ * When both day fields are restricted they form a union. Refused like celld: descending
+ * ranges, lists containing `*`, steps wider than the field.
+ */
+const MONTHS = ["JAN", "FEB", "MAR", "APR", "MAY", "JUN", "JUL", "AUG", "SEP", "OCT", "NOV", "DEC"];
+const DAYS = ["SUN", "MON", "TUE", "WED", "THU", "FRI", "SAT"];
+function parseSimple(text, min, max, names, nameBase = 1) {
+    if (text === "*")
+        return { any: true, values: new Set(range(min, max)) };
+    const parts = text.split(",");
+    if (parts.length > 1 && parts.includes("*"))
+        throw new Error(`cron: a list cannot contain "*": ${text}`);
+    const values = new Set();
+    const value = (v) => {
+        const i = names?.indexOf(v.toUpperCase()) ?? -1;
+        const n = i >= 0 ? i + nameBase : Number(v);
+        if (!Number.isInteger(n) || n < min || n > max)
+            throw new Error(`cron: value out of range: ${v}`);
+        return n;
+    };
+    for (const part of parts) {
+        const [base, stepText] = part.split("/");
+        const step = stepText === undefined ? 1 : Number(stepText);
+        if (!Number.isInteger(step) || step < 1 || step > max - min)
+            throw new Error(`cron: bad step: ${part}`);
+        let lo;
+        let hi;
+        if (base === "*")
+            [lo, hi] = [min, max];
+        else if (base.includes("-")) {
+            const [a, b] = base.split("-");
+            [lo, hi] = [value(a), value(b)];
+            if (lo > hi)
+                throw new Error(`cron: descending range: ${base}`);
+        }
+        else {
+            lo = value(base);
+            hi = stepText === undefined ? lo : max;
+        }
+        for (let v = lo; v <= hi; v += step)
+            values.add(v);
+    }
+    return { any: false, values };
+}
+const range = (a, b) => Array.from({ length: b - a + 1 }, (_, i) => a + i);
+const daysInMonth = (y, m) => new Date(Date.UTC(y, m + 1, 0)).getUTCDate();
+function parseDom(text) {
+    if (text === "*")
+        return { any: true, match: () => true };
+    const rules = [];
+    for (const part of text.split(",")) {
+        const up = part.toUpperCase();
+        const last = /^L(?:-(\d+))?(W?)$/.exec(up);
+        const weekdayOf = /^(\d+)W$/.exec(up);
+        if (last) {
+            const m = last;
+            const back = Number(m[1] ?? 0);
+            const weekday = m[2] === "W";
+            rules.push((y, mo, d) => {
+                const target = daysInMonth(y, mo) - back;
+                return d === (weekday ? nearestWeekday(y, mo, target) : target);
+            });
+        }
+        else if (weekdayOf) {
+            const day = Number(weekdayOf[1]);
+            rules.push((y, mo, d) => d === nearestWeekday(y, mo, Math.min(day, daysInMonth(y, mo))));
+        }
+        else {
+            const f = parseSimple(part, 1, 31);
+            rules.push((_y, _m, d) => f.values.has(d));
+        }
+    }
+    return { any: false, match: (y, mo, d) => rules.some((r) => r(y, mo, d)) };
+}
+function nearestWeekday(y, m, day) {
+    const dow = new Date(Date.UTC(y, m, day)).getUTCDay();
+    if (dow === 6)
+        return day > 1 ? day - 1 : day + 2;
+    if (dow === 0)
+        return day < daysInMonth(y, m) ? day + 1 : day - 2;
+    return day;
+}
+function parseDow(text) {
+    if (text === "*")
+        return { any: true, match: () => true };
+    const rules = [];
+    const dowOf = (v) => {
+        const i = DAYS.indexOf(v.toUpperCase());
+        const n = i >= 0 ? i + 1 : Number(v);
+        if (!Number.isInteger(n) || n < 1 || n > 7)
+            throw new Error(`cron: weekday out of range: ${v}`);
+        return n - 1; // JS getUTCDay(): 0 = Sunday
+    };
+    for (const part of text.split(",")) {
+        const lastOf = /^(\w+)L$/i.exec(part);
+        const nthOf = /^(\w+)#(\d)$/.exec(part);
+        if (lastOf && !/^\d+$/.test(part)) {
+            const dow = dowOf(lastOf[1]);
+            rules.push((y, mo, d) => new Date(Date.UTC(y, mo, d)).getUTCDay() === dow && d + 7 > daysInMonth(y, mo));
+        }
+        else if (nthOf) {
+            const dow = dowOf(nthOf[1]);
+            const nth = Number(nthOf[2]);
+            rules.push((y, mo, d) => new Date(Date.UTC(y, mo, d)).getUTCDay() === dow && Math.ceil(d / 7) === nth);
+        }
+        else {
+            const f = parseSimple(part, 1, 7, DAYS, 1);
+            rules.push((y, mo, d) => f.values.has(new Date(Date.UTC(y, mo, d)).getUTCDay() + 1));
+        }
+    }
+    return { any: false, match: (y, mo, d) => rules.some((r) => r(y, mo, d)) };
+}
+export function parseCron(text) {
+    const fields = text.trim().split(/\s+/);
+    if (fields.length !== 5)
+        throw new Error(`cron: expected 5 fields: ${text}`);
+    const minute = parseSimple(fields[0], 0, 59);
+    const hour = parseSimple(fields[1], 0, 23);
+    const dom = parseDom(fields[2]);
+    const month = parseSimple(fields[3], 1, 12, MONTHS, 1);
+    const dow = parseDow(fields[4]);
+    const dayOk = (y, m, d) => dom.any && dow.any
+        ? true
+        : dom.any
+            ? dow.match(y, m, d)
+            : dow.any
+                ? dom.match(y, m, d)
+                : dom.match(y, m, d) || dow.match(y, m, d);
+    const matches = (t) => {
+        const x = new Date(t);
+        return (minute.values.has(x.getUTCMinutes()) &&
+            hour.values.has(x.getUTCHours()) &&
+            month.values.has(x.getUTCMonth() + 1) &&
+            dayOk(x.getUTCFullYear(), x.getUTCMonth(), x.getUTCDate()));
+    };
+    return {
+        text,
+        matches,
+        next(t) {
+            let c = Math.floor(t / 60_000) * 60_000 + 60_000;
+            const limit = c + 5 * 366 * 86_400_000;
+            while (c < limit) {
+                const x = new Date(c);
+                if (!month.values.has(x.getUTCMonth() + 1) ||
+                    !dayOk(x.getUTCFullYear(), x.getUTCMonth(), x.getUTCDate())) {
+                    c = Date.UTC(x.getUTCFullYear(), x.getUTCMonth(), x.getUTCDate() + 1); // next day, 00:00
+                    continue;
+                }
+                if (matches(c))
+                    return c;
+                c += 60_000;
+            }
+            throw new Error(`cron: no occurrence within 5 years: ${text}`);
+        },
+    };
+}
+export function startCronTriggers(expressions, handler, clock, state) {
+    const schedules = expressions.map(parseCron);
+    const timers = new Set();
+    let chain = Promise.resolve();
+    let stopped = false;
+    const at = (t, fn) => {
+        const h = clock.setTimeout(() => {
+            timers.delete(h);
+            if (!stopped)
+                fn();
+        }, Math.max(0, t - clock.now()));
+        timers.add(h);
+    };
+    const run = (s, scheduledTime, failures, nextOccurrence) => {
+        chain = chain.then(async () => {
+            let retry = true;
+            const pending = [];
+            const controller = {
+                cron: s.text,
+                scheduledTime,
+                type: "scheduled",
+                noRetry: () => {
+                    retry = false;
+                },
+            };
+            try {
+                await handler(controller, {
+                    waitUntil: (p) => pending.push(p),
+                    passThroughOnException() { },
+                });
+                await Promise.allSettled(pending);
+            }
+            catch {
+                await Promise.allSettled(pending);
+                const delay = 4_000 * 2 ** failures;
+                if (retry && failures + 1 < 6 && clock.now() + delay < nextOccurrence)
+                    at(clock.now() + delay, () => run(s, scheduledTime, failures + 1, nextOccurrence));
+            }
+        });
+    };
+    const arm = (s, from) => {
+        const t = s.next(from);
+        at(t, () => {
+            state?.set(s.text, t);
+            run(s, t, 0, s.next(t));
+            arm(s, t);
+        });
+    };
+    // After downtime: run ONE missed occurrence (the latest) and skip the rest, as celld does.
+    for (const s of schedules) {
+        const last = state?.get(s.text);
+        if (last === undefined)
+            continue;
+        let missed;
+        const now = clock.now();
+        for (let t = s.next(last), n = 0; t <= now && n < 600_000; t = s.next(t), n++)
+            missed = t;
+        if (missed !== undefined) {
+            state?.set(s.text, missed);
+            run(s, missed, 0, s.next(missed));
+        }
+    }
+    for (const s of schedules)
+        arm(s, clock.now());
+    return () => {
+        stopped = true;
+        for (const h of timers)
+            clock.clearTimeout(h);
+        timers.clear();
+    };
+}
+//# sourceMappingURL=cron.js.map