@vibesdotdev/workers 0.0.0-stage → 1.0.0-rc.2

package/dist/graph/stream.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"stream.js","sourceRoot":"","sources":["../../src/graph/stream.ts"],"names":[],"mappings":"AAAA,qGAAqG;AAErG,OAAO,EAAE,MAAM,EAAsB,MAAM,qBAAqB,CAAC;AAGjE;;;GAGG;AACH,MAAM,CAAC,KAAK,SAAS,CAAC,CAAC,sBAAsB,CAC5C,OAAwB,EACxB,KAA0F;IAE1F,MAAM,OAAO,GAAG,IAAI,eAAe,EAAE,CAAC;IACtC,MAAM,QAAQ,GAAG,GAAS,EAAE,CAAC,OAAO,CAAC,KAAK,EAAE,CAAC;IAC7C,OAAO,CAAC,MAAM,EAAE,gBAAgB,CAAC,OAAO,EAAE,QAAQ,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC;IACpE,IAAI,OAAO,CAAC,MAAM,EAAE,OAAO;QAAE,OAAO,CAAC,KAAK,EAAE,CAAC;IAC7C,MAAM,OAAO,GAAiB,EAAE,CAAC;IACjC,IAAI,IAA8B,CAAC;IACnC,IAAI,OAAkC,CAAC;IACvC,IAAI,IAAI,GAAG,KAAK,CAAC;IACjB,MAAM,MAAM,GAAG,GAAS,EAAE;QACzB,MAAM,MAAM,GAAG,IAAI,CAAC;QACpB,IAAI,GAAG,SAAS,CAAC;QACjB,MAAM,EAAE,EAAE,CAAC;IACZ,CAAC,CAAC;IACF,MAAM,OAAO,GAAG,MAAM,CAAC,GAAG,EAAE,CAAC,KAAK,CAAC,CAAC,KAAK,EAAE,EAAE;QAC5C,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACpB,MAAM,EAAE,CAAC;IACV,CAAC,EAAE,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,OAAO,EAAE,EAAE;QACpC,IAAI,CAAC,OAAO,CAAC,EAAE;YAAE,OAAO,GAAG,OAAO,CAAC,KAAK,CAAC;QACzC,IAAI,GAAG,IAAI,CAAC;QACZ,MAAM,EAAE,CAAC;IACV,CAAC,CAAC,CAAC;IACH,IAAI,CAAC;QACJ,OAAO,CAAC,IAAI,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACpC,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,EAAE,CAAC;YAC9B,IAAI,KAAK,EAAE,CAAC;gBACX,MAAM,KAAK,CAAC;gBACZ,SAAS;YACV,CAAC;YACD,MAAM,IAAI,OAAO,CAAO,CAAC,OAAO,EAAE,EAAE;gBACnC,IAAI,GAAG,OAAO,CAAC;YAChB,CAAC,CAAC,CAAC;QACJ,CAAC;QACD,IAAI,OAAO;YAAE,MAAM,OAAO,CAAC;IAC5B,CAAC;YAAS,CAAC;QACV,OAAO,CAAC,MAAM,EAAE,mBAAmB,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAC;QACvD,IAAI,CAAC,IAAI;YAAE,OAAO,CAAC,KAAK,EAAE,CAAC;QAC3B,MAAM,OAAO,CAAC;IACf,CAAC;AACF,CAAC"}

package/dist/graph/validate.d.ts

@@ -0,0 +1,4 @@
+/** Graph admission: parse, resolve node ids, refuse unknown references and cycles. */
+import { type GraphDefinitionInput, type ResolvedGraph } from './schemas.ts';
+export declare function validateGraph(input: GraphDefinitionInput): ResolvedGraph;
+//# sourceMappingURL=validate.d.ts.map

package/dist/graph/validate.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"validate.d.ts","sourceRoot":"","sources":["../../src/graph/validate.ts"],"names":[],"mappings":"AAAA,sFAAsF;AAGtF,OAAO,EAA+C,KAAK,oBAAoB,EAAE,KAAK,aAAa,EAAqB,MAAM,cAAc,CAAC;AAM7I,wBAAgB,aAAa,CAAC,KAAK,EAAE,oBAAoB,GAAG,aAAa,CA6CxE"}

package/dist/graph/validate.js

@@ -0,0 +1,96 @@
+/** Graph admission: parse, resolve node ids, refuse unknown references and cycles. */
+import { CapabilityError } from '@vibesdotdev/kernel';
+import { GraphDefinitionSchema } from "./schemas.js";
+function refuse(message, reason, details) {
+    throw new CapabilityError(message, 'INVALID_INPUT', { reason, retryable: false, details });
+}
+export function validateGraph(input) {
+    const parsed = GraphDefinitionSchema.safeParse(input);
+    if (!parsed.success) {
+        return refuse('Invalid job graph definition.', 'graph-invalid', { issues: parsed.error.message });
+    }
+    const definition = parsed.data;
+    const nodes = [];
+    const ids = new Set();
+    for (const node of definition.nodes) {
+        const id = node.id ?? node.job;
+        if (ids.has(id)) {
+            return refuse(`Job graph '${definition.id}' repeats node id '${id}'.`, 'graph-duplicate-node', { graphId: definition.id, nodeId: id });
+        }
+        ids.add(id);
+        const resolved = { id, job: node.job, input: node.input };
+        if (node.metadata !== undefined)
+            resolved.metadata = node.metadata;
+        if (node.jobId !== undefined)
+            resolved.jobId = node.jobId;
+        if (node.completion !== undefined)
+            resolved.completion = node.completion;
+        if (node.dependencyOutcomesInput !== undefined)
+            resolved.dependencyOutcomesInput = node.dependencyOutcomesInput;
+        if (node.attemptFeedbackInput !== undefined)
+            resolved.attemptFeedbackInput = node.attemptFeedbackInput;
+        if (node.attempts !== undefined)
+            resolved.attempts = node.attempts;
+        nodes.push(resolved);
+    }
+    const grouped = new Set();
+    for (const cohort of definition.cohorts) {
+        for (const id of cohort) {
+            if (!ids.has(id) || grouped.has(id))
+                return refuse('A graph cohort names an unknown or repeated node.', 'graph-cohort-invalid', { graphId: definition.id, nodeId: id });
+            grouped.add(id);
+        }
+    }
+    for (const edge of definition.edges) {
+        for (const end of [edge.from, edge.to]) {
+            if (!ids.has(end)) {
+                return refuse(`Job graph '${definition.id}' has an edge naming unknown node '${end}'.`, 'graph-unknown-node', { graphId: definition.id, nodeId: end });
+            }
+        }
+        if (edge.output !== undefined && edge.input === undefined) {
+            return refuse(`Job graph '${definition.id}' edge ${edge.from} -> ${edge.to} names an output but no target input.`, 'graph-edge-output-without-input', { graphId: definition.id, from: edge.from, to: edge.to });
+        }
+    }
+    const cycle = findCycle([...ids], definition.edges);
+    if (cycle) {
+        return refuse(`Job graph '${definition.id}' has a cycle: ${cycle.join(' -> ')}.`, 'graph-cycle', { graphId: definition.id, cycle });
+    }
+    return { definition, nodes, edges: definition.edges };
+}
+/** Kahn's algorithm: nodes left over when no zero-indegree node remains sit on or behind a cycle. */
+function findCycle(ids, edges) {
+    const indegree = new Map(ids.map((id) => [id, 0]));
+    const next = new Map(ids.map((id) => [id, []]));
+    for (const edge of edges) {
+        indegree.set(edge.to, (indegree.get(edge.to) ?? 0) + 1);
+        next.get(edge.from)?.push(edge.to);
+    }
+    const ready = ids.filter((id) => indegree.get(id) === 0);
+    let seen = 0;
+    while (ready.length > 0) {
+        const id = ready.pop();
+        if (id === undefined)
+            break;
+        seen += 1;
+        for (const to of next.get(id) ?? []) {
+            const left = (indegree.get(to) ?? 0) - 1;
+            indegree.set(to, left);
+            if (left === 0)
+                ready.push(to);
+        }
+    }
+    if (seen === ids.length)
+        return undefined;
+    const remaining = new Set(ids.filter((id) => (indegree.get(id) ?? 0) > 0));
+    // Walk forward inside the remaining set until a node repeats: that loop is the cycle.
+    const path = [];
+    let at = [...remaining][0];
+    while (at !== undefined && !path.includes(at)) {
+        path.push(at);
+        at = (next.get(at) ?? []).find((to) => remaining.has(to));
+    }
+    if (at === undefined)
+        return [...remaining];
+    return [...path.slice(path.indexOf(at)), at];
+}
+//# sourceMappingURL=validate.js.map

package/dist/graph/validate.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"validate.js","sourceRoot":"","sources":["../../src/graph/validate.ts"],"names":[],"mappings":"AAAA,sFAAsF;AAEtF,OAAO,EAAE,eAAe,EAAE,MAAM,qBAAqB,CAAC;AACtD,OAAO,EAAE,qBAAqB,EAA0F,MAAM,cAAc,CAAC;AAE7I,SAAS,MAAM,CAAC,OAAe,EAAE,MAAc,EAAE,OAA0C;IAC1F,MAAM,IAAI,eAAe,CAAC,OAAO,EAAE,eAAe,EAAE,EAAE,MAAM,EAAE,SAAS,EAAE,KAAK,EAAE,OAAO,EAAE,CAAC,CAAC;AAC5F,CAAC;AAED,MAAM,UAAU,aAAa,CAAC,KAA2B;IACxD,MAAM,MAAM,GAAG,qBAAqB,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;IACtD,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC;QACrB,OAAO,MAAM,CAAC,+BAA+B,EAAE,eAAe,EAAE,EAAE,MAAM,EAAE,MAAM,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC,CAAC;IACnG,CAAC;IACD,MAAM,UAAU,GAAG,MAAM,CAAC,IAAI,CAAC;IAC/B,MAAM,KAAK,GAAmB,EAAE,CAAC;IACjC,MAAM,GAAG,GAAG,IAAI,GAAG,EAAU,CAAC;IAC9B,KAAK,MAAM,IAAI,IAAI,UAAU,CAAC,KAAK,EAAE,CAAC;QACrC,MAAM,EAAE,GAAG,IAAI,CAAC,EAAE,IAAI,IAAI,CAAC,GAAG,CAAC;QAC/B,IAAI,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;YACjB,OAAO,MAAM,CAAC,cAAc,UAAU,CAAC,EAAE,sBAAsB,EAAE,IAAI,EAAE,sBAAsB,EAAE,EAAE,OAAO,EAAE,UAAU,CAAC,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,CAAC,CAAC;QACxI,CAAC;QACD,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACZ,MAAM,QAAQ,GAAiB,EAAE,EAAE,EAAE,GAAG,EAAE,IAAI,CAAC,GAAG,EAAE,KAAK,EAAE,IAAI,CAAC,KAAK,EAAE,CAAC;QACxE,IAAI,IAAI,CAAC,QAAQ,KAAK,SAAS;YAAE,QAAQ,CAAC,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC;QACnE,IAAI,IAAI,CAAC,KAAK,KAAK,SAAS;YAAE,QAAQ,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC;QAC1D,IAAI,IAAI,CAAC,UAAU,KAAK,SAAS;YAAE,QAAQ,CAAC,UAAU,GAAG,IAAI,CAAC,UAAU,CAAC;QACzE,IAAI,IAAI,CAAC,uBAAuB,KAAK,SAAS;YAAE,QAAQ,CAAC,uBAAuB,GAAG,IAAI,CAAC,uBAAuB,CAAC;QAChH,IAAI,IAAI,CAAC,oBAAoB,KAAK,SAAS;YAAE,QAAQ,CAAC,oBAAoB,GAAG,IAAI,CAAC,oBAAoB,CAAC;QACvG,IAAI,IAAI,CAAC,QAAQ,KAAK,SAAS;YAAE,QAAQ,CAAC,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC;QACnE,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;IACtB,CAAC;IACD,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAClC,KAAK,MAAM,MAAM,IAAI,UAAU,CAAC,OAAO,EAAE,CAAC;QACzC,KAAK,MAAM,EAAE,IAAI,MAAM,EAAE,CAAC;YACzB,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC;gBAAE,OAAO,MAAM,CAAC,mDAAmD,EAAE,sBAAsB,EAAE,EAAE,OAAO,EAAE,UAAU,CAAC,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,CAAC,CAAC;YACxK,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACjB,CAAC;IACF,CAAC;IACD,KAAK,MAAM,IAAI,IAAI,UAAU,CAAC,KAAK,EAAE,CAAC;QACrC,KAAK,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;YACxC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;gBACnB,OAAO,MAAM,CAAC,cAAc,UAAU,CAAC,EAAE,sCAAsC,GAAG,IAAI,EAAE,oBAAoB,EAAE,EAAE,OAAO,EAAE,UAAU,CAAC,EAAE,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC;YACxJ,CAAC;QACF,CAAC;QACD,IAAI,IAAI,CAAC,MAAM,KAAK,SAAS,IAAI,IAAI,CAAC,KAAK,KAAK,SAAS,EAAE,CAAC;YAC3D,OAAO,MAAM,CAAC,cAAc,UAAU,CAAC,EAAE,UAAU,IAAI,CAAC,IAAI,OAAO,IAAI,CAAC,EAAE,uCAAuC,EAAE,iCAAiC,EAAE,EAAE,OAAO,EAAE,UAAU,CAAC,EAAE,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,EAAE,EAAE,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC;QACjN,CAAC;IACF,CAAC;IACD,MAAM,KAAK,GAAG,SAAS,CAAC,CAAC,GAAG,GAAG,CAAC,EAAE,UAAU,CAAC,KAAK,CAAC,CAAC;IACpD,IAAI,KAAK,EAAE,CAAC;QACX,OAAO,MAAM,CAAC,cAAc,UAAU,CAAC,EAAE,kBAAkB,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,EAAE,aAAa,EAAE,EAAE,OAAO,EAAE,UAAU,CAAC,EAAE,EAAE,KAAK,EAAE,CAAC,CAAC;IACrI,CAAC;IACD,OAAO,EAAE,UAAU,EAAE,KAAK,EAAE,KAAK,EAAE,UAAU,CAAC,KAAK,EAAE,CAAC;AACvD,CAAC;AAED,qGAAqG;AACrG,SAAS,SAAS,CAAC,GAAa,EAAE,KAA+B;IAChE,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IACnD,MAAM,IAAI,GAAG,IAAI,GAAG,CAAmB,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;IAClE,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QAC1B,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACxD,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACpC,CAAC;IACD,MAAM,KAAK,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC;IACzD,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACzB,MAAM,EAAE,GAAG,KAAK,CAAC,GAAG,EAAE,CAAC;QACvB,IAAI,EAAE,KAAK,SAAS;YAAE,MAAM;QAC5B,IAAI,IAAI,CAAC,CAAC;QACV,KAAK,MAAM,EAAE,IAAI,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC;YACrC,MAAM,IAAI,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;YACzC,QAAQ,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;YACvB,IAAI,IAAI,KAAK,CAAC;gBAAE,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAChC,CAAC;IACF,CAAC;IACD,IAAI,IAAI,KAAK,GAAG,CAAC,MAAM;QAAE,OAAO,SAAS,CAAC;IAC1C,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IAC3E,sFAAsF;IACtF,MAAM,IAAI,GAAa,EAAE,CAAC;IAC1B,IAAI,EAAE,GAAuB,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;IAC/C,OAAO,EAAE,KAAK,SAAS,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC,EAAE,CAAC;QAC/C,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACd,EAAE,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;IAC3D,CAAC;IACD,IAAI,EAAE,KAAK,SAAS;QAAE,OAAO,CAAC,GAAG,SAAS,CAAC,CAAC;IAC5C,OAAO,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;AAC9C,CAAC"}

package/dist/helpers/testing/index.d.ts

@@ -0,0 +1,4 @@
+export { WorkerTestHarness, createJobTestHarness, } from './worker-test-utils.ts';
+export { assertQueueListContract, type QueueListContractQueue } from './queue-list-contract.ts';
+export { assertKeyedAdmissionContract, type KeyedAdmissionContractQueue } from './keyed-admission-contract.ts';
+//# sourceMappingURL=index.d.ts.map

package/dist/helpers/testing/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/helpers/testing/index.ts"],"names":[],"mappings":"AAAA,OAAO,EACN,iBAAiB,EACjB,oBAAoB,GACpB,MAAM,wBAAwB,CAAC;AAChC,OAAO,EAAE,uBAAuB,EAAE,KAAK,sBAAsB,EAAE,MAAM,0BAA0B,CAAC;AAChG,OAAO,EAAE,4BAA4B,EAAE,KAAK,2BAA2B,EAAE,MAAM,+BAA+B,CAAC"}

package/dist/helpers/testing/index.js

@@ -0,0 +1,4 @@
+export { WorkerTestHarness, createJobTestHarness, } from "./worker-test-utils.js";
+export { assertQueueListContract } from "./queue-list-contract.js";
+export { assertKeyedAdmissionContract } from "./keyed-admission-contract.js";
+//# sourceMappingURL=index.js.map

package/dist/helpers/testing/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/helpers/testing/index.ts"],"names":[],"mappings":"AAAA,OAAO,EACN,iBAAiB,EACjB,oBAAoB,GACpB,MAAM,wBAAwB,CAAC;AAChC,OAAO,EAAE,uBAAuB,EAA+B,MAAM,0BAA0B,CAAC;AAChG,OAAO,EAAE,4BAA4B,EAAoC,MAAM,+BAA+B,CAAC"}

package/dist/helpers/testing/keyed-admission-contract.d.ts

@@ -0,0 +1,17 @@
+/**
+ * The caller-id admission contract every adapter keeps (`keepsCallerAdmission`):
+ * an enqueue under an id whose job is pending, processing or completed leaves
+ * that job as it is, so a resumed caller reattaches to it and reads its result;
+ * an id whose job failed or was cancelled is admitted again with the new input.
+ * Under `resume` (a keyed child of an executing job) the child's outcome stands
+ * for the resuming run: a failure until its parent retried, a user cancellation
+ * always; a cancellation by shutdown is an interruption and admits it again.
+ * Adapter tests call it on a live queue holding no other ready job, since it
+ * dequeues to drive its jobs through processing.
+ */
+import type { QueueAdapter } from '../../core/queue-adapter.ts';
+/** The members of a queue the contract drives. */
+export type KeyedAdmissionContractQueue = Pick<QueueAdapter, 'enqueue' | 'dequeue' | 'getJob' | 'updateJob' | 'releaseExecution' | 'cancelJob'>;
+/** Drive keyed jobs through each status on `queue` and prove its caller-id admission; throws on the first breach. */
+export declare function assertKeyedAdmissionContract(queue: KeyedAdmissionContractQueue): Promise<void>;
+//# sourceMappingURL=keyed-admission-contract.d.ts.map

package/dist/helpers/testing/keyed-admission-contract.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"keyed-admission-contract.d.ts","sourceRoot":"","sources":["../../../src/helpers/testing/keyed-admission-contract.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AACH,OAAO,KAAK,EAAO,YAAY,EAAE,MAAM,6BAA6B,CAAC;AAIrE,kDAAkD;AAClD,MAAM,MAAM,2BAA2B,GAAG,IAAI,CAAC,YAAY,EAAE,SAAS,GAAG,SAAS,GAAG,QAAQ,GAAG,WAAW,GAAG,kBAAkB,GAAG,WAAW,CAAC,CAAC;AAsChJ,qHAAqH;AACrH,wBAAsB,4BAA4B,CAAC,KAAK,EAAE,2BAA2B,GAAG,OAAO,CAAC,IAAI,CAAC,CAyDpG"}

package/dist/helpers/testing/keyed-admission-contract.js

@@ -0,0 +1,102 @@
+import { jobWriteGuard } from "../../core/queue-adapter.js";
+import { ADMITTED_BY_METADATA_KEY } from "../../core/schemas/resume.js";
+function fail(message) {
+    throw new Error(`QueueAdapter keyed admission contract: ${message}`);
+}
+async function jobOf(queue, jobId) {
+    return (await queue.getJob(jobId)) ?? fail(`job ${jobId} is absent`);
+}
+function expectJob(job, status, data, what) {
+    if (job.status !== status)
+        fail(`${what}: expected status ${status}, got ${job.status}`);
+    if (JSON.stringify(job.data) !== JSON.stringify(data))
+        fail(`${what}: expected data ${JSON.stringify(data)}, got ${JSON.stringify(job.data)}`);
+}
+/** Enqueue under `jobId` (as a keyed child of `resume`'s job when given) and prove the adapter answered with that id. */
+async function enqueueKeyed(queue, jobId, data, resume) {
+    const options = { jobId };
+    if (resume) {
+        options.resume = resume;
+        options.metadata = { [ADMITTED_BY_METADATA_KEY]: resume };
+    }
+    const admitted = await queue.enqueue(data, options);
+    if (admitted !== jobId)
+        fail(`an enqueue under ${jobId} answered ${admitted}`);
+}
+/** Dequeue the key's job and end its execution with `update`. */
+async function settleKeyed(queue, jobId, update) {
+    const claimed = await queue.dequeue();
+    if (!claimed || claimed.id !== jobId)
+        fail(`dequeue answered ${claimed?.id ?? 'nothing'}, not ${jobId}`);
+    if (claimed.executionClaim.state !== 'held')
+        fail(`dequeued ${jobId} without a held execution claim`);
+    await queue.updateJob(jobId, update, jobWriteGuard(claimed));
+    await queue.releaseExecution(jobId, claimed.executionClaim.identity);
+}
+/** Drive keyed jobs through each status on `queue` and prove its caller-id admission; throws on the first breach. */
+export async function assertKeyedAdmissionContract(queue) {
+    const run = crypto.randomUUID();
+    const pending = `${run}:pending`;
+    await enqueueKeyed(queue, pending, { input: 'first' });
+    await enqueueKeyed(queue, pending, { input: 'second' });
+    expectJob(await jobOf(queue, pending), 'pending', { input: 'first' }, 'a pending job under a repeated id');
+    const claimed = await queue.dequeue();
+    if (!claimed || claimed.id !== pending)
+        fail(`dequeue answered ${claimed?.id ?? 'nothing'}, not ${pending}`);
+    await enqueueKeyed(queue, pending, { input: 'third' });
+    expectJob(await jobOf(queue, pending), 'processing', { input: 'first' }, 'a processing job under a repeated id');
+    if (claimed.executionClaim.state !== 'held')
+        fail(`dequeued ${pending} without a held execution claim`);
+    await queue.updateJob(pending, { status: 'completed', result: { answer: 'stored' } }, jobWriteGuard(claimed));
+    await queue.releaseExecution(pending, claimed.executionClaim.identity);
+    await enqueueKeyed(queue, pending, { input: 'fourth' });
+    const completed = await jobOf(queue, pending);
+    expectJob(completed, 'completed', { input: 'first' }, 'a completed job under a repeated id');
+    if (JSON.stringify(completed.result) !== JSON.stringify({ answer: 'stored' }))
+        fail(`a completed job's result changed to ${JSON.stringify(completed.result)}`);
+    const failed = `${run}:failed`;
+    await enqueueKeyed(queue, failed, { input: 'first' });
+    await settleKeyed(queue, failed, { status: 'failed', error: 'contract failure' });
+    await enqueueKeyed(queue, failed, { input: 'fresh' });
+    expectJob(await jobOf(queue, failed), 'pending', { input: 'fresh' }, 'a failed job under a repeated id');
+    const cancelled = `${run}:cancelled`;
+    await enqueueKeyed(queue, cancelled, { input: 'first' });
+    await queue.dequeue();
+    if (!(await queue.cancelJob(cancelled, { by: 'system', source: 'disposal', reason: 'keyed admission contract' })))
+        fail(`cancelJob refused ${cancelled}`);
+    await settleCancelled(queue, cancelled);
+    await enqueueKeyed(queue, cancelled, { input: 'fresh' });
+    expectJob(await jobOf(queue, cancelled), 'pending', { input: 'fresh' }, 'a cancelled job under a repeated id');
+    await settleKeyed(queue, cancelled, { status: 'completed', result: null });
+    // A keyed child of an executing job (`resume`): its outcome stands for the run that is resuming.
+    const resume = { parentJobId: `${run}:parent`, parentAttempt: 1 };
+    const failedChild = `${run}:resume-failed`;
+    await enqueueKeyed(queue, failedChild, { input: 'first' }, resume);
+    await settleKeyed(queue, failedChild, { status: 'failed', error: 'contract failure' });
+    await enqueueKeyed(queue, failedChild, { input: 'resumed' }, resume);
+    expectJob(await jobOf(queue, failedChild), 'failed', { input: 'first' }, 'a failed keyed child on a resumed run');
+    await enqueueKeyed(queue, failedChild, { input: 'retried' }, { ...resume, parentAttempt: 2 });
+    expectJob(await jobOf(queue, failedChild), 'pending', { input: 'retried' }, 'a failed keyed child once its parent retried');
+    await settleKeyed(queue, failedChild, { status: 'completed', result: null });
+    const userCancelled = `${run}:resume-user-cancelled`;
+    await enqueueKeyed(queue, userCancelled, { input: 'first' }, resume);
+    if (!(await queue.cancelJob(userCancelled, { by: 'invocation', actor: { harness: 'keyed-admission-contract' }, reason: 'keyed admission contract' })))
+        fail(`cancelJob refused ${userCancelled}`);
+    await enqueueKeyed(queue, userCancelled, { input: 'resumed' }, resume);
+    expectJob(await jobOf(queue, userCancelled), 'cancelled', { input: 'first' }, 'a user-cancelled keyed child on a resumed run');
+    const interrupted = `${run}:resume-interrupted`;
+    await enqueueKeyed(queue, interrupted, { input: 'first' }, resume);
+    if (!(await queue.cancelJob(interrupted, { by: 'system', source: 'disposal', reason: 'keyed admission contract' })))
+        fail(`cancelJob refused ${interrupted}`);
+    await enqueueKeyed(queue, interrupted, { input: 'resumed' }, resume);
+    expectJob(await jobOf(queue, interrupted), 'pending', { input: 'resumed' }, 'a keyed child cancelled by shutdown on a resumed run');
+}
+/** A cancelled job stays cancelled until its execution is released. */
+async function settleCancelled(queue, jobId) {
+    const job = await jobOf(queue, jobId);
+    if (job.status !== 'cancelled')
+        fail(`a cancelled job reads ${job.status}`);
+    if (job.executionClaim.state === 'held')
+        await queue.releaseExecution(jobId, job.executionClaim.identity);
+}
+//# sourceMappingURL=keyed-admission-contract.js.map

package/dist/helpers/testing/keyed-admission-contract.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"keyed-admission-contract.js","sourceRoot":"","sources":["../../../src/helpers/testing/keyed-admission-contract.ts"],"names":[],"mappings":"AAYA,OAAO,EAAE,aAAa,EAAE,MAAM,6BAA6B,CAAC;AAC5D,OAAO,EAAE,wBAAwB,EAAwB,MAAM,8BAA8B,CAAC;AAK9F,SAAS,IAAI,CAAC,OAAe;IAC5B,MAAM,IAAI,KAAK,CAAC,0CAA0C,OAAO,EAAE,CAAC,CAAC;AACtE,CAAC;AAED,KAAK,UAAU,KAAK,CAAC,KAAkC,EAAE,KAAa;IACrE,OAAO,CAAC,MAAM,KAAK,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,IAAI,IAAI,CAAC,OAAO,KAAK,YAAY,CAAC,CAAC;AACtE,CAAC;AAKD,SAAS,SAAS,CAAC,GAAQ,EAAE,MAAqB,EAAE,IAAqB,EAAE,IAAY;IACtF,IAAI,GAAG,CAAC,MAAM,KAAK,MAAM;QAAE,IAAI,CAAC,GAAG,IAAI,qBAAqB,MAAM,SAAS,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC;IACzF,IAAI,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC;QAAE,IAAI,CAAC,GAAG,IAAI,mBAAmB,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,SAAS,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;AAChJ,CAAC;AAED,yHAAyH;AACzH,KAAK,UAAU,YAAY,CAAC,KAAkC,EAAE,KAAa,EAAE,IAAqB,EAAE,MAAwB;IAC7H,MAAM,OAAO,GAA2C,EAAE,KAAK,EAAE,CAAC;IAClE,IAAI,MAAM,EAAE,CAAC;QACZ,OAAO,CAAC,MAAM,GAAG,MAAM,CAAC;QACxB,OAAO,CAAC,QAAQ,GAAG,EAAE,CAAC,wBAAwB,CAAC,EAAE,MAAM,EAAE,CAAC;IAC3D,CAAC;IACD,MAAM,QAAQ,GAAG,MAAM,KAAK,CAAC,OAAO,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;IACpD,IAAI,QAAQ,KAAK,KAAK;QAAE,IAAI,CAAC,oBAAoB,KAAK,aAAa,QAAQ,EAAE,CAAC,CAAC;AAChF,CAAC;AAED,iEAAiE;AACjE,KAAK,UAAU,WAAW,CAAC,KAAkC,EAAE,KAAa,EAAE,MAAgD;IAC7H,MAAM,OAAO,GAAG,MAAM,KAAK,CAAC,OAAO,EAAE,CAAC;IACtC,IAAI,CAAC,OAAO,IAAI,OAAO,CAAC,EAAE,KAAK,KAAK;QAAE,IAAI,CAAC,oBAAoB,OAAO,EAAE,EAAE,IAAI,SAAS,SAAS,KAAK,EAAE,CAAC,CAAC;IACzG,IAAI,OAAO,CAAC,cAAc,CAAC,KAAK,KAAK,MAAM;QAAE,IAAI,CAAC,YAAY,KAAK,iCAAiC,CAAC,CAAC;IACtG,MAAM,KAAK,CAAC,SAAS,CAAC,KAAK,EAAE,MAAM,EAAE,aAAa,CAAC,OAAO,CAAC,CAAC,CAAC;IAC7D,MAAM,KAAK,CAAC,gBAAgB,CAAC,KAAK,EAAE,OAAO,CAAC,cAAc,CAAC,QAAQ,CAAC,CAAC;AACtE,CAAC;AAED,qHAAqH;AACrH,MAAM,CAAC,KAAK,UAAU,4BAA4B,CAAC,KAAkC;IACpF,MAAM,GAAG,GAAG,MAAM,CAAC,UAAU,EAAE,CAAC;IAEhC,MAAM,OAAO,GAAG,GAAG,GAAG,UAAU,CAAC;IACjC,MAAM,YAAY,CAAC,KAAK,EAAE,OAAO,EAAE,EAAE,KAAK,EAAE,OAAO,EAAE,CAAC,CAAC;IACvD,MAAM,YAAY,CAAC,KAAK,EAAE,OAAO,EAAE,EAAE,KAAK,EAAE,QAAQ,EAAE,CAAC,CAAC;IACxD,SAAS,CAAC,MAAM,KAAK,CAAC,KAAK,EAAE,OAAO,CAAC,EAAE,SAAS,EAAE,EAAE,KAAK,EAAE,OAAO,EAAE,EAAE,mCAAmC,CAAC,CAAC;IAE3G,MAAM,OAAO,GAAG,MAAM,KAAK,CAAC,OAAO,EAAE,CAAC;IACtC,IAAI,CAAC,OAAO,IAAI,OAAO,CAAC,EAAE,KAAK,OAAO;QAAE,IAAI,CAAC,oBAAoB,OAAO,EAAE,EAAE,IAAI,SAAS,SAAS,OAAO,EAAE,CAAC,CAAC;IAC7G,MAAM,YAAY,CAAC,KAAK,EAAE,OAAO,EAAE,EAAE,KAAK,EAAE,OAAO,EAAE,CAAC,CAAC;IACvD,SAAS,CAAC,MAAM,KAAK,CAAC,KAAK,EAAE,OAAO,CAAC,EAAE,YAAY,EAAE,EAAE,KAAK,EAAE,OAAO,EAAE,EAAE,sCAAsC,CAAC,CAAC;IACjH,IAAI,OAAO,CAAC,cAAc,CAAC,KAAK,KAAK,MAAM;QAAE,IAAI,CAAC,YAAY,OAAO,iCAAiC,CAAC,CAAC;IACxG,MAAM,KAAK,CAAC,SAAS,CAAC,OAAO,EAAE,EAAE,MAAM,EAAE,WAAW,EAAE,MAAM,EAAE,EAAE,MAAM,EAAE,QAAQ,EAAE,EAAE,EAAE,aAAa,CAAC,OAAO,CAAC,CAAC,CAAC;IAC9G,MAAM,KAAK,CAAC,gBAAgB,CAAC,OAAO,EAAE,OAAO,CAAC,cAAc,CAAC,QAAQ,CAAC,CAAC;IACvE,MAAM,YAAY,CAAC,KAAK,EAAE,OAAO,EAAE,EAAE,KAAK,EAAE,QAAQ,EAAE,CAAC,CAAC;IACxD,MAAM,SAAS,GAAG,MAAM,KAAK,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;IAC9C,SAAS,CAAC,SAAS,EAAE,WAAW,EAAE,EAAE,KAAK,EAAE,OAAO,EAAE,EAAE,qCAAqC,CAAC,CAAC;IAC7F,IAAI,IAAI,CAAC,SAAS,CAAC,SAAS,CAAC,MAAM,CAAC,KAAK,IAAI,CAAC,SAAS,CAAC,EAAE,MAAM,EAAE,QAAQ,EAAE,CAAC;QAAE,IAAI,CAAC,uCAAuC,IAAI,CAAC,SAAS,CAAC,SAAS,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;IAE/J,MAAM,MAAM,GAAG,GAAG,GAAG,SAAS,CAAC;IAC/B,MAAM,YAAY,CAAC,KAAK,EAAE,MAAM,EAAE,EAAE,KAAK,EAAE,OAAO,EAAE,CAAC,CAAC;IACtD,MAAM,WAAW,CAAC,KAAK,EAAE,MAAM,EAAE,EAAE,MAAM,EAAE,QAAQ,EAAE,KAAK,EAAE,kBAAkB,EAAE,CAAC,CAAC;IAClF,MAAM,YAAY,CAAC,KAAK,EAAE,MAAM,EAAE,EAAE,KAAK,EAAE,OAAO,EAAE,CAAC,CAAC;IACtD,SAAS,CAAC,MAAM,KAAK,CAAC,KAAK,EAAE,MAAM,CAAC,EAAE,SAAS,EAAE,EAAE,KAAK,EAAE,OAAO,EAAE,EAAE,kCAAkC,CAAC,CAAC;IAEzG,MAAM,SAAS,GAAG,GAAG,GAAG,YAAY,CAAC;IACrC,MAAM,YAAY,CAAC,KAAK,EAAE,SAAS,EAAE,EAAE,KAAK,EAAE,OAAO,EAAE,CAAC,CAAC;IACzD,MAAM,KAAK,CAAC,OAAO,EAAE,CAAC;IACtB,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,SAAS,CAAC,SAAS,EAAE,EAAE,EAAE,EAAE,QAAQ,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,EAAE,0BAA0B,EAAE,CAAC,CAAC;QAAE,IAAI,CAAC,qBAAqB,SAAS,EAAE,CAAC,CAAC;IAC1J,MAAM,eAAe,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC;IACxC,MAAM,YAAY,CAAC,KAAK,EAAE,SAAS,EAAE,EAAE,KAAK,EAAE,OAAO,EAAE,CAAC,CAAC;IACzD,SAAS,CAAC,MAAM,KAAK,CAAC,KAAK,EAAE,SAAS,CAAC,EAAE,SAAS,EAAE,EAAE,KAAK,EAAE,OAAO,EAAE,EAAE,qCAAqC,CAAC,CAAC;IAC/G,MAAM,WAAW,CAAC,KAAK,EAAE,SAAS,EAAE,EAAE,MAAM,EAAE,WAAW,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC,CAAC;IAE3E,iGAAiG;IACjG,MAAM,MAAM,GAAoB,EAAE,WAAW,EAAE,GAAG,GAAG,SAAS,EAAE,aAAa,EAAE,CAAC,EAAE,CAAC;IACnF,MAAM,WAAW,GAAG,GAAG,GAAG,gBAAgB,CAAC;IAC3C,MAAM,YAAY,CAAC,KAAK,EAAE,WAAW,EAAE,EAAE,KAAK,EAAE,OAAO,EAAE,EAAE,MAAM,CAAC,CAAC;IACnE,MAAM,WAAW,CAAC,KAAK,EAAE,WAAW,EAAE,EAAE,MAAM,EAAE,QAAQ,EAAE,KAAK,EAAE,kBAAkB,EAAE,CAAC,CAAC;IACvF,MAAM,YAAY,CAAC,KAAK,EAAE,WAAW,EAAE,EAAE,KAAK,EAAE,SAAS,EAAE,EAAE,MAAM,CAAC,CAAC;IACrE,SAAS,CAAC,MAAM,KAAK,CAAC,KAAK,EAAE,WAAW,CAAC,EAAE,QAAQ,EAAE,EAAE,KAAK,EAAE,OAAO,EAAE,EAAE,uCAAuC,CAAC,CAAC;IAClH,MAAM,YAAY,CAAC,KAAK,EAAE,WAAW,EAAE,EAAE,KAAK,EAAE,SAAS,EAAE,EAAE,EAAE,GAAG,MAAM,EAAE,aAAa,EAAE,CAAC,EAAE,CAAC,CAAC;IAC9F,SAAS,CAAC,MAAM,KAAK,CAAC,KAAK,EAAE,WAAW,CAAC,EAAE,SAAS,EAAE,EAAE,KAAK,EAAE,SAAS,EAAE,EAAE,8CAA8C,CAAC,CAAC;IAC5H,MAAM,WAAW,CAAC,KAAK,EAAE,WAAW,EAAE,EAAE,MAAM,EAAE,WAAW,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC,CAAC;IAE7E,MAAM,aAAa,GAAG,GAAG,GAAG,wBAAwB,CAAC;IACrD,MAAM,YAAY,CAAC,KAAK,EAAE,aAAa,EAAE,EAAE,KAAK,EAAE,OAAO,EAAE,EAAE,MAAM,CAAC,CAAC;IACrE,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,SAAS,CAAC,aAAa,EAAE,EAAE,EAAE,EAAE,YAAY,EAAE,KAAK,EAAE,EAAE,OAAO,EAAE,0BAA0B,EAAE,EAAE,MAAM,EAAE,0BAA0B,EAAE,CAAC,CAAC;QAAE,IAAI,CAAC,qBAAqB,aAAa,EAAE,CAAC,CAAC;IAClM,MAAM,YAAY,CAAC,KAAK,EAAE,aAAa,EAAE,EAAE,KAAK,EAAE,SAAS,EAAE,EAAE,MAAM,CAAC,CAAC;IACvE,SAAS,CAAC,MAAM,KAAK,CAAC,KAAK,EAAE,aAAa,CAAC,EAAE,WAAW,EAAE,EAAE,KAAK,EAAE,OAAO,EAAE,EAAE,+CAA+C,CAAC,CAAC;IAE/H,MAAM,WAAW,GAAG,GAAG,GAAG,qBAAqB,CAAC;IAChD,MAAM,YAAY,CAAC,KAAK,EAAE,WAAW,EAAE,EAAE,KAAK,EAAE,OAAO,EAAE,EAAE,MAAM,CAAC,CAAC;IACnE,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,SAAS,CAAC,WAAW,EAAE,EAAE,EAAE,EAAE,QAAQ,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,EAAE,0BAA0B,EAAE,CAAC,CAAC;QAAE,IAAI,CAAC,qBAAqB,WAAW,EAAE,CAAC,CAAC;IAC9J,MAAM,YAAY,CAAC,KAAK,EAAE,WAAW,EAAE,EAAE,KAAK,EAAE,SAAS,EAAE,EAAE,MAAM,CAAC,CAAC;IACrE,SAAS,CAAC,MAAM,KAAK,CAAC,KAAK,EAAE,WAAW,CAAC,EAAE,SAAS,EAAE,EAAE,KAAK,EAAE,SAAS,EAAE,EAAE,sDAAsD,CAAC,CAAC;AACrI,CAAC;AAED,uEAAuE;AACvE,KAAK,UAAU,eAAe,CAAC,KAAkC,EAAE,KAAa;IAC/E,MAAM,GAAG,GAAG,MAAM,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;IACtC,IAAI,GAAG,CAAC,MAAM,KAAK,WAAW;QAAE,IAAI,CAAC,yBAAyB,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC;IAC5E,IAAI,GAAG,CAAC,cAAc,CAAC,KAAK,KAAK,MAAM;QAAE,MAAM,KAAK,CAAC,gBAAgB,CAAC,KAAK,EAAE,GAAG,CAAC,cAAc,CAAC,QAAQ,CAAC,CAAC;AAC3G,CAAC"}

package/dist/helpers/testing/queue-list-contract.d.ts

@@ -0,0 +1,14 @@
+/**
+ * The `QueueAdapter.listJobs` contract every adapter keeps: newest first
+ * (`createdAt` descending, then `id` descending), offset pages that neither
+ * skip nor repeat a job, and `dataEquals` selecting before the page is cut.
+ * Adapter tests in this package and in the integrations call it on a live
+ * queue; it enqueues its own jobs under a fresh run id, so a queue that
+ * already holds jobs is fine.
+ */
+import { type QueueAdapter } from '../../core/queue-adapter.ts';
+/** The members of a queue the contract drives. */
+export type QueueListContractQueue = Pick<QueueAdapter, 'enqueue' | 'listJobs'>;
+/** Enqueue a run's worth of jobs on `queue` and prove its `listJobs` keeps the contract; throws on the first breach. */
+export declare function assertQueueListContract(queue: QueueListContractQueue): Promise<void>;
+//# sourceMappingURL=queue-list-contract.d.ts.map

package/dist/helpers/testing/queue-list-contract.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"queue-list-contract.d.ts","sourceRoot":"","sources":["../../../src/helpers/testing/queue-list-contract.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AACH,OAAO,EAAyD,KAAK,YAAY,EAAE,MAAM,6BAA6B,CAAC;AAEvH,kDAAkD;AAClD,MAAM,MAAM,sBAAsB,GAAG,IAAI,CAAC,YAAY,EAAE,SAAS,GAAG,UAAU,CAAC,CAAC;AAmChF,wHAAwH;AACxH,wBAAsB,uBAAuB,CAAC,KAAK,EAAE,sBAAsB,GAAG,OAAO,CAAC,IAAI,CAAC,CAuC1F"}

package/dist/helpers/testing/queue-list-contract.js

@@ -0,0 +1,79 @@
+/**
+ * The `QueueAdapter.listJobs` contract every adapter keeps: newest first
+ * (`createdAt` descending, then `id` descending), offset pages that neither
+ * skip nor repeat a job, and `dataEquals` selecting before the page is cut.
+ * Adapter tests in this package and in the integrations call it on a live
+ * queue; it enqueues its own jobs under a fresh run id, so a queue that
+ * already holds jobs is fine.
+ */
+import { compareJobsNewestFirst } from "../../core/queue-adapter.js";
+/** Rows a whole-queue read asks for; the contract's queue holds far fewer. */
+const WHOLE_QUEUE = 100;
+function fail(message) {
+    throw new Error(`QueueAdapter.listJobs contract: ${message}`);
+}
+function ids(jobs) {
+    return jobs.map((job) => job.id);
+}
+function expectSameIds(actual, expected, what) {
+    const got = ids(actual).join(',');
+    const want = ids(expected).join(',');
+    if (got !== want)
+        fail(`${what}: expected [${want}], got [${got}]`);
+}
+async function readPages(queue, pageSize, dataEquals) {
+    const jobs = [];
+    for (let offset = 0;; offset += pageSize) {
+        const options = { limit: pageSize, offset };
+        if (dataEquals)
+            options.dataEquals = dataEquals;
+        const page = await queue.listJobs(undefined, options);
+        if (page.length > pageSize)
+            fail(`a page of ${pageSize} answered ${page.length} jobs`);
+        jobs.push(...page);
+        if (page.length < pageSize)
+            return { jobs, lastPageRows: page.length };
+    }
+}
+/** Enqueue a run's worth of jobs on `queue` and prove its `listJobs` keeps the contract; throws on the first breach. */
+export async function assertQueueListContract(queue) {
+    const run = `run-${crypto.randomUUID()}`;
+    const other = `run-${crypto.randomUUID()}`;
+    const members = [];
+    const tagged = [];
+    // Enqueued back to back, so several share a createdAt instant and only the id orders them.
+    for (let n = 0; n < 7; n++) {
+        const tag = n % 2 === 0 ? 'even' : 'odd';
+        const id = await queue.enqueue({ rootRunId: run, tag, n });
+        members.push(id);
+        if (tag === 'odd')
+            tagged.push(id);
+        await queue.enqueue({ rootRunId: other, tag, n });
+    }
+    // Data that names the run but must never match it.
+    for (const data of [run, null, [run], { rootRunId: [run] }, { nested: { rootRunId: run } }])
+        await queue.enqueue(data);
+    const whole = await queue.listJobs(undefined, { limit: WHOLE_QUEUE });
+    for (let i = 1; i < whole.length; i++) {
+        if (compareJobsNewestFirst(whole[i - 1], whole[i]) > 0) {
+            fail(`jobs ${whole[i - 1].id} and ${whole[i].id} are out of newest-first order`);
+        }
+    }
+    const paged = await readPages(queue, 3);
+    expectSameIds(paged.jobs, whole, 'offset pages of 3 against one whole read');
+    const runJobs = whole.filter((job) => members.includes(job.id));
+    if (runJobs.length !== members.length)
+        fail(`a whole read holds ${runJobs.length} of the run's ${members.length} jobs`);
+    const selected = await readPages(queue, 2, { rootRunId: run });
+    expectSameIds(selected.jobs, runJobs, 'dataEquals { rootRunId } paged by 2');
+    if (selected.lastPageRows !== members.length % 2)
+        fail('dataEquals did not select before the page was cut');
+    const bothFields = await queue.listJobs(undefined, { limit: WHOLE_QUEUE, dataEquals: { rootRunId: run, tag: 'odd' } });
+    expectSameIds(bothFields, runJobs.filter((job) => tagged.includes(job.id)), 'dataEquals on two fields');
+    const skipped = await queue.listJobs(undefined, { limit: 2, offset: 5, dataEquals: { rootRunId: run } });
+    expectSameIds(skipped, runJobs.slice(5, 7), 'dataEquals with an offset');
+    const none = await queue.listJobs(undefined, { limit: WHOLE_QUEUE, dataEquals: { rootRunId: `run-${crypto.randomUUID()}` } });
+    if (none.length !== 0)
+        fail(`dataEquals on an unknown run answered ${none.length} jobs`);
+}
+//# sourceMappingURL=queue-list-contract.js.map

package/dist/helpers/testing/queue-list-contract.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"queue-list-contract.js","sourceRoot":"","sources":["../../../src/helpers/testing/queue-list-contract.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AACH,OAAO,EAAE,sBAAsB,EAAoD,MAAM,6BAA6B,CAAC;AAKvH,8EAA8E;AAC9E,MAAM,WAAW,GAAG,GAAG,CAAC;AAExB,SAAS,IAAI,CAAC,OAAe;IAC5B,MAAM,IAAI,KAAK,CAAC,mCAAmC,OAAO,EAAE,CAAC,CAAC;AAC/D,CAAC;AAED,SAAS,GAAG,CAAC,IAAgC;IAC5C,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;AAClC,CAAC;AAED,SAAS,aAAa,CAAC,MAAkC,EAAE,QAAoC,EAAE,IAAY;IAC5G,MAAM,GAAG,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAClC,MAAM,IAAI,GAAG,GAAG,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IACrC,IAAI,GAAG,KAAK,IAAI;QAAE,IAAI,CAAC,GAAG,IAAI,eAAe,IAAI,WAAW,GAAG,GAAG,CAAC,CAAC;AACrE,CAAC;AAED,KAAK,UAAU,SAAS,CACvB,KAA6B,EAC7B,QAAgB,EAChB,UAAmC;IAEnC,MAAM,IAAI,GAAU,EAAE,CAAC;IACvB,KAAK,IAAI,MAAM,GAAG,CAAC,GAAI,MAAM,IAAI,QAAQ,EAAE,CAAC;QAC3C,MAAM,OAAO,GAAmB,EAAE,KAAK,EAAE,QAAQ,EAAE,MAAM,EAAE,CAAC;QAC5D,IAAI,UAAU;YAAE,OAAO,CAAC,UAAU,GAAG,UAAU,CAAC;QAChD,MAAM,IAAI,GAAG,MAAM,KAAK,CAAC,QAAQ,CAAC,SAAS,EAAE,OAAO,CAAC,CAAC;QACtD,IAAI,IAAI,CAAC,MAAM,GAAG,QAAQ;YAAE,IAAI,CAAC,aAAa,QAAQ,aAAa,IAAI,CAAC,MAAM,OAAO,CAAC,CAAC;QACvF,IAAI,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,CAAC;QACnB,IAAI,IAAI,CAAC,MAAM,GAAG,QAAQ;YAAE,OAAO,EAAE,IAAI,EAAE,YAAY,EAAE,IAAI,CAAC,MAAM,EAAE,CAAC;IACxE,CAAC;AACF,CAAC;AAED,wHAAwH;AACxH,MAAM,CAAC,KAAK,UAAU,uBAAuB,CAAC,KAA6B;IAC1E,MAAM,GAAG,GAAG,OAAO,MAAM,CAAC,UAAU,EAAE,EAAE,CAAC;IACzC,MAAM,KAAK,GAAG,OAAO,MAAM,CAAC,UAAU,EAAE,EAAE,CAAC;IAC3C,MAAM,OAAO,GAAa,EAAE,CAAC;IAC7B,MAAM,MAAM,GAAa,EAAE,CAAC;IAC5B,2FAA2F;IAC3F,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC5B,MAAM,GAAG,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC;QACzC,MAAM,EAAE,GAAG,MAAM,KAAK,CAAC,OAAO,CAAC,EAAE,SAAS,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC;QAC3D,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACjB,IAAI,GAAG,KAAK,KAAK;YAAE,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACnC,MAAM,KAAK,CAAC,OAAO,CAAC,EAAE,SAAS,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC;IACnD,CAAC;IACD,mDAAmD;IACnD,KAAK,MAAM,IAAI,IAAI,CAAC,GAAG,EAAE,IAAI,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,SAAS,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,SAAS,EAAE,GAAG,EAAE,EAAE,CAAC;QAAE,MAAM,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;IAEvH,MAAM,KAAK,GAAG,MAAM,KAAK,CAAC,QAAQ,CAAC,SAAS,EAAE,EAAE,KAAK,EAAE,WAAW,EAAE,CAAC,CAAC;IACtE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACvC,IAAI,sBAAsB,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAE,EAAE,KAAK,CAAC,CAAC,CAAE,CAAC,GAAG,CAAC,EAAE,CAAC;YAC1D,IAAI,CAAC,QAAQ,KAAK,CAAC,CAAC,GAAG,CAAC,CAAE,CAAC,EAAE,QAAQ,KAAK,CAAC,CAAC,CAAE,CAAC,EAAE,gCAAgC,CAAC,CAAC;QACpF,CAAC;IACF,CAAC;IACD,MAAM,KAAK,GAAG,MAAM,SAAS,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;IACxC,aAAa,CAAC,KAAK,CAAC,IAAI,EAAE,KAAK,EAAE,0CAA0C,CAAC,CAAC;IAE7E,MAAM,OAAO,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;IAChE,IAAI,OAAO,CAAC,MAAM,KAAK,OAAO,CAAC,MAAM;QAAE,IAAI,CAAC,sBAAsB,OAAO,CAAC,MAAM,iBAAiB,OAAO,CAAC,MAAM,OAAO,CAAC,CAAC;IACxH,MAAM,QAAQ,GAAG,MAAM,SAAS,CAAC,KAAK,EAAE,CAAC,EAAE,EAAE,SAAS,EAAE,GAAG,EAAE,CAAC,CAAC;IAC/D,aAAa,CAAC,QAAQ,CAAC,IAAI,EAAE,OAAO,EAAE,qCAAqC,CAAC,CAAC;IAC7E,IAAI,QAAQ,CAAC,YAAY,KAAK,OAAO,CAAC,MAAM,GAAG,CAAC;QAAE,IAAI,CAAC,mDAAmD,CAAC,CAAC;IAE5G,MAAM,UAAU,GAAG,MAAM,KAAK,CAAC,QAAQ,CAAC,SAAS,EAAE,EAAE,KAAK,EAAE,WAAW,EAAE,UAAU,EAAE,EAAE,SAAS,EAAE,GAAG,EAAE,GAAG,EAAE,KAAK,EAAE,EAAE,CAAC,CAAC;IACvH,aAAa,CAAC,UAAU,EAAE,OAAO,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,EAAE,0BAA0B,CAAC,CAAC;IAExG,MAAM,OAAO,GAAG,MAAM,KAAK,CAAC,QAAQ,CAAC,SAAS,EAAE,EAAE,KAAK,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,UAAU,EAAE,EAAE,SAAS,EAAE,GAAG,EAAE,EAAE,CAAC,CAAC;IACzG,aAAa,CAAC,OAAO,EAAE,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,2BAA2B,CAAC,CAAC;IAEzE,MAAM,IAAI,GAAG,MAAM,KAAK,CAAC,QAAQ,CAAC,SAAS,EAAE,EAAE,KAAK,EAAE,WAAW,EAAE,UAAU,EAAE,EAAE,SAAS,EAAE,OAAO,MAAM,CAAC,UAAU,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;IAC9H,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;QAAE,IAAI,CAAC,yCAAyC,IAAI,CAAC,MAAM,OAAO,CAAC,CAAC;AAC1F,CAAC"}

package/dist/helpers/testing/worker-test-utils.d.ts

@@ -0,0 +1,94 @@
+/**
+ * Worker Testing Utilities
+ *
+ * Test harness for easy worker testing with in-memory provider
+ */
+import * as z from 'zod/v4';
+import type { Worker } from '../../core/worker.ts';
+import { type Job } from '../../core/queue-adapter.ts';
+import type { EnqueueOptionsExtended } from '../../core/schemas/index.ts';
+import type { RuntimeRef } from '@vibesdotdev/kernel';
+export type JobEnqueueOptions = EnqueueOptionsExtended;
+export declare const ProgressPayloadSchema: z.ZodRecord<z.ZodString, z.ZodUnknown>;
+export type ProgressPayload = z.infer<typeof ProgressPayloadSchema>;
+export declare const EventPayloadSchema: z.ZodRecord<z.ZodString, z.ZodUnknown>;
+export type EventPayload = z.infer<typeof EventPayloadSchema>;
+export declare const EventMetadataSchema: z.ZodRecord<z.ZodString, z.ZodUnknown>;
+export type EventMetadata = z.infer<typeof EventMetadataSchema>;
+interface TestWorkerProcessor<TJob, TResult> {
+    process(job: Job<TJob>, events: ReturnType<WorkerTestHarness<TJob, TResult>['createMockEvents']>): Promise<TResult>;
+}
+export declare class WorkerTestHarness<TJob, TResult> {
+    private worker;
+    private provider;
+    constructor(worker: Worker & Partial<TestWorkerProcessor<TJob, TResult>>, runtime: RuntimeRef);
+    /**
+     * Submit a job to the queue
+     */
+    submitJob(data: TJob, options?: JobEnqueueOptions): Promise<string>;
+    /**
+     * Submit multiple jobs
+     */
+    submitJobs(jobs: TJob[]): Promise<string[]>;
+    /**
+     * Process next job in queue
+     */
+    processNextJob(): Promise<TResult>;
+    /**
+     * Process all jobs in queue
+     */
+    processAllJobs(): Promise<TResult[]>;
+    /**
+     * Process job and expect failure
+     */
+    processJobExpectingFailure(errorMatcher?: string | RegExp): Promise<Error>;
+    /**
+     * Get job by ID
+     */
+    getJob(jobId: string): Promise<Job<TJob> | null>;
+    /**
+     * Get all jobs
+     */
+    getAllJobs(): Job<TJob>[];
+    /**
+     * Get queue metrics
+     */
+    getMetrics(): Promise<import("../../core/queue-adapter.ts").QueueMetrics>;
+    /**
+     * Wait for job to complete
+     */
+    waitForJob(jobId: string, options?: {
+        timeout?: number;
+        interval?: number;
+    }): Promise<Job<TJob>>;
+    /**
+     * Clear all jobs
+     */
+    clear(): void;
+    /**
+     * Create mock event emitter for testing
+     */
+    private createMockEvents;
+    /**
+     * Assert job status
+     */
+    assertJobStatus(jobId: string, expectedStatus: string): Promise<void>;
+    /**
+     * Assert metrics
+     */
+    assertMetrics(expected: Partial<{
+        waiting: number;
+        active: number;
+        completed: number;
+        failed: number;
+    }>): Promise<void>;
+}
+/**
+ * Create an in-memory **job-queue** test harness for abstract workers/jobs.
+ *
+ * NOT Cloudflare Wrangler. For production Worker integration tests use:
+ * `import { createTestHarness } from 'wrangler'` (see docs/runbooks/worker-integration-test-harness.md).
+ */
+export declare function createJobTestHarness<TJob, TResult>(worker: Worker, runtime: RuntimeRef): WorkerTestHarness<TJob, TResult>;
+export {};
+//# sourceMappingURL=worker-test-utils.d.ts.map

package/dist/helpers/testing/worker-test-utils.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"worker-test-utils.d.ts","sourceRoot":"","sources":["../../../src/helpers/testing/worker-test-utils.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,KAAK,CAAC,MAAM,QAAQ,CAAC;AAE5B,OAAO,KAAK,EAAE,MAAM,EAAE,MAAM,sBAAsB,CAAC;AACnD,OAAO,EAAiB,KAAK,GAAG,EAAE,MAAM,6BAA6B,CAAC;AACtE,OAAO,KAAK,EAAE,sBAAsB,EAAE,MAAM,6BAA6B,CAAC;AAE1E,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,qBAAqB,CAAC;AAEtD,MAAM,MAAM,iBAAiB,GAAG,sBAAsB,CAAC;AAEvD,eAAO,MAAM,qBAAqB,wCAAoC,CAAC;AACvE,MAAM,MAAM,eAAe,GAAG,CAAC,CAAC,KAAK,CAAC,OAAO,qBAAqB,CAAC,CAAC;AAEpE,eAAO,MAAM,kBAAkB,wCAAoC,CAAC;AACpE,MAAM,MAAM,YAAY,GAAG,CAAC,CAAC,KAAK,CAAC,OAAO,kBAAkB,CAAC,CAAC;AAE9D,eAAO,MAAM,mBAAmB,wCAAoC,CAAC;AACrE,MAAM,MAAM,aAAa,GAAG,CAAC,CAAC,KAAK,CAAC,OAAO,mBAAmB,CAAC,CAAC;AAEhE,UAAU,mBAAmB,CAAC,IAAI,EAAE,OAAO;IAC1C,OAAO,CACN,GAAG,EAAE,GAAG,CAAC,IAAI,CAAC,EACd,MAAM,EAAE,UAAU,CAAC,iBAAiB,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC,kBAAkB,CAAC,CAAC,GACtE,OAAO,CAAC,OAAO,CAAC,CAAC;CACpB;AAED,qBAAa,iBAAiB,CAAC,IAAI,EAAE,OAAO;IAG/B,OAAO,CAAC,MAAM;IAF1B,OAAO,CAAC,QAAQ,CAAiC;gBAE7B,MAAM,EAAE,MAAM,GAAG,OAAO,CAAC,mBAAmB,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC,EAAE,OAAO,EAAE,UAAU;IAIrG;;OAEG;IACG,SAAS,CAAC,IAAI,EAAE,IAAI,EAAE,OAAO,CAAC,EAAE,iBAAiB,GAAG,OAAO,CAAC,MAAM,CAAC;IAIzE;;OAEG;IACG,UAAU,CAAC,IAAI,EAAE,IAAI,EAAE,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC;IAQjD;;OAEG;IACG,cAAc,IAAI,OAAO,CAAC,OAAO,CAAC;IAsBxC;;OAEG;IACG,cAAc,IAAI,OAAO,CAAC,OAAO,EAAE,CAAC;IAe1C;;OAEG;IACG,0BAA0B,CAAC,YAAY,CAAC,EAAE,MAAM,GAAG,MAAM,GAAG,OAAO,CAAC,KAAK,CAAC;IAwBhF;;OAEG;IACG,MAAM,CAAC,KAAK,EAAE,MAAM,GAAG,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC;IAItD;;OAEG;IACH,UAAU,IAAI,GAAG,CAAC,IAAI,CAAC,EAAE;IAIzB;;OAEG;IACG,UAAU;IAIhB;;OAEG;IACG,UAAU,CACf,KAAK,EAAE,MAAM,EACb,OAAO,GAAE;QAAE,OAAO,CAAC,EAAE,MAAM,CAAC;QAAC,QAAQ,CAAC,EAAE,MAAM,CAAA;KAAO,GACnD,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IAerB;;OAEG;IACH,KAAK,IAAI,IAAI;IAIb;;OAEG;IACH,OAAO,CAAC,gBAAgB;IAqBxB;;OAEG;IACG,eAAe,CAAC,KAAK,EAAE,MAAM,EAAE,cAAc,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC;IAY3E;;OAEG;IACG,aAAa,CAClB,QAAQ,EAAE,OAAO,CAAC;QAAE,OAAO,EAAE,MAAM,CAAC;QAAC,MAAM,EAAE,MAAM,CAAC;QAAC,SAAS,EAAE,MAAM,CAAC;QAAC,MAAM,EAAE,MAAM,CAAA;KAAE,CAAC;CAc1F;AAED;;;;;GAKG;AACH,wBAAgB,oBAAoB,CAAC,IAAI,EAAE,OAAO,EACjD,MAAM,EAAE,MAAM,EACd,OAAO,EAAE,UAAU,GACjB,iBAAiB,CAAC,IAAI,EAAE,OAAO,CAAC,CAElC"}