@loopingai/core 0.1.0

package/dist/db/models/subtasks.js

@@ -0,0 +1,285 @@
+import { and, eq, inArray, lt, max } from "drizzle-orm";
+import { z } from "zod";
+import { subtasks } from "../schema.js";
+const referenceSchema = z.object({
+    role: z.enum(["user", "assistant"]),
+    text: z.string()
+});
+const resultPartSchema = z.object({
+    kind: z.literal("text"),
+    text: z.string()
+});
+const referencesSchema = z.array(referenceSchema);
+const resultPartsSchema = z.array(resultPartSchema);
+const dependsOnSchema = z.array(z.number().int());
+const paramsSchema = z.record(z.string(), z.string());
+/**
+ * Query methods for the `subtasks` table (durable decomposed units of work).
+ *
+ * Bound to a drizzle handle by {@link AgentDB} and reached as `db.subtasks.*`.
+ * durable-sqlite is synchronous; the multi-statement `createDecomposition` runs
+ * inside an explicit `db.transaction` (drizzle maps it to
+ * `storage.transactionSync`), so a mid-create failure rolls back every statement
+ * instead of leaving a partial DAG. Guarded transitions filter on the expected
+ * current `status`, so a disallowed transition matches no row and is a no-op.
+ */
+export function makeSubtasks(db, opts) {
+    const rowToSubtask = (row) => ({
+        id: row.id,
+        taskId: row.taskId,
+        round: row.round,
+        ordinal: row.ordinal,
+        type: row.type,
+        recipeId: row.recipeId,
+        recipeVersion: row.recipeVersion,
+        prompt: row.prompt,
+        references: referencesSchema.parse(JSON.parse(row.referencesJson)),
+        dependsOn: dependsOnSchema.parse(JSON.parse(row.dependsOnJson)),
+        params: paramsSchema.parse(JSON.parse(row.paramsJson)),
+        status: row.status,
+        resultParts: row.resultPartsJson === null
+            ? null
+            : resultPartsSchema.parse(JSON.parse(row.resultPartsJson)),
+        error: row.error,
+        createdAt: row.createdAt,
+        updatedAt: row.updatedAt,
+        completedAt: row.completedAt
+    });
+    const list = (taskId) => db
+        .select()
+        .from(subtasks)
+        .where(eq(subtasks.taskId, taskId))
+        .orderBy(subtasks.ordinal)
+        .all()
+        .map(rowToSubtask);
+    /** Rides `idx_subtasks_task_round` — no full-Task scan to reach one round. */
+    const listRound = (taskId, round) => db
+        .select()
+        .from(subtasks)
+        .where(and(eq(subtasks.taskId, taskId), eq(subtasks.round, round)))
+        .orderBy(subtasks.ordinal)
+        .all()
+        .map(rowToSubtask);
+    /** Guarded status update: applies only from a `from` status, returns whether it did. */
+    const transition = (id, from, set) => {
+        const now = Date.now();
+        const statuses = Array.isArray(from) ? from : [from];
+        const updated = db
+            .update(subtasks)
+            .set({ ...set, updatedAt: now })
+            .where(and(eq(subtasks.id, id), inArray(subtasks.status, statuses)))
+            .returning({ id: subtasks.id })
+            .all();
+        return updated.length > 0;
+    };
+    return {
+        /**
+         * Create one **round's** decomposition atomically: the entire
+         * check-validate-insert sequence runs in one synchronous `db.transaction`, so
+         * a failure anywhere rolls back every statement — no truncated subtask set, no
+         * nodes left with unwritten dependency edges. Idempotent on
+         * `(taskId, round)`: if this round already has Subtasks, returns them
+         * unchanged (a Workflow-step retry must not duplicate work); the unique
+         * `(task_id, ordinal)` index is the schema-level backstop. Enforces the 1..8
+         * per-round bound, unique local keys, and resolvable non-self dependency
+         * edges, then resolves draft-local dependency keys to the SQLite-assigned
+         * {@link SubtaskId}s. Full cycle/edge DAG validation lives in the turn
+         * operation; this is the storage guard.
+         *
+         * `ordinal` continues across rounds (it is the Task-wide position, and what
+         * the unique index is built on), so a later round's rows sort after the
+         * earlier ones in {@link list}. Dependency edges never cross a round: each
+         * round's DAG is self-contained, and the drafts handed here only carry keys
+         * from their own round.
+         */
+        createDecomposition(taskId, round, drafts) {
+            return db.transaction(() => {
+                const existing = listRound(taskId, round);
+                if (existing.length > 0)
+                    return existing;
+                if (drafts.length < 1 || drafts.length > opts.maxSubtasks) {
+                    throw new Error(`decomposition must have 1..${opts.maxSubtasks} subtasks, got ${drafts.length}`);
+                }
+                // Register every local key first, rejecting duplicates. This is its own
+                // pass because the dependency check below reads the complete key set: an
+                // edge may point forward to a draft defined later, so every key must be
+                // known before any edge is validated.
+                const keys = new Set();
+                for (const d of drafts) {
+                    if (keys.has(d.localKey)) {
+                        throw new Error(`duplicate draft local key: ${d.localKey}`);
+                    }
+                    keys.add(d.localKey);
+                }
+                for (const d of drafts) {
+                    for (const dep of d.dependsOn) {
+                        // A subtask cannot depend on itself.
+                        if (dep === d.localKey) {
+                            throw new Error(`subtask ${d.localKey} depends on itself`);
+                        }
+                        // Every edge must resolve to a key in this decomposition.
+                        if (!keys.has(dep)) {
+                            throw new Error(`subtask ${d.localKey} depends on unknown key: ${dep}`);
+                        }
+                    }
+                    // References must match the persisted shape before we serialize them.
+                    referencesSchema.parse(d.references);
+                }
+                const now = Date.now();
+                const keyToId = new Map();
+                // Pass 1: insert nodes (deps empty for now) to assign ids. Ordinals
+                // continue above every earlier round's rows — from the current maximum,
+                // not a row count, so a gap left by {@link cleanup} deleting part of a
+                // Task cannot hand a later round an ordinal that is already taken. Both
+                // read the `(task_id, ordinal)` index; only this one stays monotonic.
+                const highest = db
+                    .select({ max: max(subtasks.ordinal) })
+                    .from(subtasks)
+                    .where(eq(subtasks.taskId, taskId))
+                    .get()?.max ?? null;
+                const firstOrdinal = highest === null ? 0 : highest + 1;
+                drafts.forEach((d, offset) => {
+                    const { id } = db
+                        .insert(subtasks)
+                        .values({
+                        taskId,
+                        round,
+                        ordinal: firstOrdinal + offset,
+                        type: d.type,
+                        recipeId: null,
+                        recipeVersion: null,
+                        prompt: d.prompt,
+                        referencesJson: JSON.stringify(d.references),
+                        dependsOnJson: "[]",
+                        paramsJson: JSON.stringify(d.params ?? {}),
+                        status: "pending",
+                        resultPartsJson: null,
+                        error: null,
+                        createdAt: now,
+                        updatedAt: now,
+                        completedAt: null
+                    })
+                        .returning({ id: subtasks.id })
+                        .get();
+                    keyToId.set(d.localKey, id);
+                });
+                // Pass 2: rewrite dependency edges to real ids.
+                for (const d of drafts) {
+                    if (d.dependsOn.length === 0)
+                        continue;
+                    const ids = d.dependsOn.map((k) => keyToId.get(k));
+                    db.update(subtasks)
+                        .set({ dependsOnJson: JSON.stringify(ids) })
+                        .where(eq(subtasks.id, keyToId.get(d.localKey)))
+                        .run();
+                }
+                return listRound(taskId, round);
+            });
+        },
+        /** Load one Subtask by id. */
+        get(id) {
+            const row = db.select().from(subtasks).where(eq(subtasks.id, id)).get();
+            return row ? rowToSubtask(row) : null;
+        },
+        /** List every round's Subtasks for a Task, in ordinal order. */
+        list(taskId) {
+            return list(taskId);
+        },
+        /**
+         * List one round's Subtasks, in ordinal order — the scheduler's view. Phase 2
+         * drives a single round's DAG at a time, so it must not see a sibling round's
+         * rows; composition, by contrast, reads {@link list} across all rounds.
+         */
+        listRound(taskId, round) {
+            return listRound(taskId, round);
+        },
+        /**
+         * Begin execution: guarded `pending -> running`, recording the resolved
+         * Recipe id/version after-the-fact. Returns false if the Subtask was not
+         * pending (already started, terminal, or unknown).
+         */
+        start(id, recipe) {
+            return transition(id, "pending", {
+                status: "running",
+                recipeId: recipe.recipeId,
+                recipeVersion: recipe.recipeVersion
+            });
+        },
+        /**
+         * Persist a successful terminal result: guarded `running -> completed`.
+         * Requires at least one non-empty text result part (a successful Recipe
+         * output invariant).
+         */
+        complete(id, resultParts) {
+            const parts = resultPartsSchema.parse(resultParts);
+            if (!parts.some((p) => p.text.trim().length > 0)) {
+                throw new Error("completed subtask requires a non-empty text part");
+            }
+            return transition(id, "running", {
+                status: "completed",
+                resultPartsJson: JSON.stringify(parts),
+                completedAt: Date.now()
+            });
+        },
+        /**
+         * Persist a failure from either non-terminal status, with a diagnostic message.
+         *
+         * Both sides are reachable and both must land. A child's failed result arrives
+         * on a `running` row. The Workflow's last resort — `failSubtask`, once
+         * `execute:<id>` has exhausted every retry — can arrive on either:
+         * `executeSubtask` may throw before its `pending -> running` claim (a
+         * dependency-invariant fault) or after it (a transient child fault). Leaving
+         * either behind strands the row: a `pending` node re-enters the next wave
+         * forever, and a `running` node blocks its dependents, which {@link skip} only
+         * propagates past *failed* prerequisites.
+         *
+         * Returns false once the row is terminal — a late loser to the real result.
+         */
+        fail(id, error) {
+            return transition(id, ["running", "pending"], {
+                status: "failed",
+                error,
+                completedAt: Date.now()
+            });
+        },
+        /** Skip a Subtask blocked by a failed/skipped dependency: guarded `pending -> skipped`. */
+        skip(id) {
+            return transition(id, "pending", { status: "skipped" });
+        },
+        /**
+         * Discard a late result after parent cancellation: guarded
+         * `running -> canceled`. The parent calls this when a child returned a
+         * terminal result but the Task was canceled while it ran — the result is
+         * dropped, and this leaves the row in a truthful terminal state instead of a
+         * `running` that never resolves. Returns false if the Subtask was not running.
+         */
+        cancelRunning(id) {
+            return transition(id, "running", {
+                status: "canceled",
+                completedAt: Date.now()
+            });
+        },
+        /**
+         * Cancel every still-pending Subtask of a Task (parent cancellation).
+         * Running Subtasks are left alone here — the parent transitions those with
+         * {@link cancelRunning} once their in-flight result comes back and is
+         * discarded. Returns the number canceled.
+         */
+        cancelPending(taskId) {
+            const now = Date.now();
+            const canceled = db
+                .update(subtasks)
+                .set({ status: "canceled", updatedAt: now })
+                .where(and(eq(subtasks.taskId, taskId), eq(subtasks.status, "pending")))
+                .returning({ id: subtasks.id })
+                .all();
+            return canceled.length;
+        },
+        /** Delete Subtasks older than 30 days (called by the weekly maintenance cron). */
+        cleanup() {
+            const cutoff = Date.now() - 30 * 24 * 60 * 60 * 1000;
+            db.delete(subtasks).where(lt(subtasks.createdAt, cutoff)).run();
+        }
+    };
+}
+//# sourceMappingURL=subtasks.js.map

package/dist/db/models/subtasks.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"subtasks.js","sourceRoot":"","sources":["../../../src/db/models/subtasks.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,GAAG,EAAE,EAAE,EAAE,OAAO,EAAE,EAAE,EAAE,GAAG,EAAE,MAAM,aAAa,CAAC;AACxD,OAAO,EAAE,CAAC,EAAE,MAAM,KAAK,CAAC;AACxB,OAAO,EAAE,QAAQ,EAAE,MAAM,cAAc,CAAC;AAWxC,MAAM,eAAe,GAAG,CAAC,CAAC,MAAM,CAAC;IAC/B,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC;IACnC,IAAI,EAAE,CAAC,CAAC,MAAM,EAAE;CACjB,CAAC,CAAC;AAEH,MAAM,gBAAgB,GAAG,CAAC,CAAC,MAAM,CAAC;IAChC,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,MAAM,CAAC;IACvB,IAAI,EAAE,CAAC,CAAC,MAAM,EAAE;CACjB,CAAC,CAAC;AAEH,MAAM,gBAAgB,GAAG,CAAC,CAAC,KAAK,CAAC,eAAe,CAAC,CAAC;AAClD,MAAM,iBAAiB,GAAG,CAAC,CAAC,KAAK,CAAC,gBAAgB,CAAC,CAAC;AACpD,MAAM,eAAe,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC;AAClD,MAAM,YAAY,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC;AAatD;;;;;;;;;GASG;AACH,MAAM,UAAU,YAAY,CAAC,EAAM,EAAE,IAAyB;IAC5D,MAAM,YAAY,GAAG,CAAC,GAAe,EAAW,EAAE,CAAC,CAAC;QAClD,EAAE,EAAE,GAAG,CAAC,EAAE;QACV,MAAM,EAAE,GAAG,CAAC,MAAM;QAClB,KAAK,EAAE,GAAG,CAAC,KAAK;QAChB,OAAO,EAAE,GAAG,CAAC,OAAO;QACpB,IAAI,EAAE,GAAG,CAAC,IAAI;QACd,QAAQ,EAAE,GAAG,CAAC,QAAQ;QACtB,aAAa,EAAE,GAAG,CAAC,aAAa;QAChC,MAAM,EAAE,GAAG,CAAC,MAAM;QAClB,UAAU,EAAE,gBAAgB,CAAC,KAAK,CAChC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,cAAc,CAAC,CACT;QACvB,SAAS,EAAE,eAAe,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,aAAa,CAAC,CAAC;QAC/D,MAAM,EAAE,YAAY,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;QACtD,MAAM,EAAE,GAAG,CAAC,MAAuB;QACnC,WAAW,EACT,GAAG,CAAC,eAAe,KAAK,IAAI;YAC1B,CAAC,CAAC,IAAI;YACN,CAAC,CAAE,iBAAiB,CAAC,KAAK,CACtB,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,eAAe,CAAC,CACR;QAC/B,KAAK,EAAE,GAAG,CAAC,KAAK;QAChB,SAAS,EAAE,GAAG,CAAC,SAAS;QACxB,SAAS,EAAE,GAAG,CAAC,SAAS;QACxB,WAAW,EAAE,GAAG,CAAC,WAAW;KAC7B,CAAC,CAAC;IAEH,MAAM,IAAI,GAAG,CAAC,MAAc,EAAa,EAAE,CACzC,EAAE;SACC,MAAM,EAAE;SACR,IAAI,CAAC,QAAQ,CAAC;SACd,KAAK,CAAC,EAAE,CAAC,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;SAClC,OAAO,CAAC,QAAQ,CAAC,OAAO,CAAC;SACzB,GAAG,EAAE;SACL,GAAG,CAAC,YAAY,CAAC,CAAC;IAEvB,8EAA8E;IAC9E,MAAM,SAAS,GAAG,CAAC,MAAc,EAAE,KAAa,EAAa,EAAE,CAC7D,EAAE;SACC,MAAM,EAAE;SACR,IAAI,CAAC,QAAQ,CAAC;SACd,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC,EAAE,EAAE,CAAC,QAAQ,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC;SAClE,OAAO,CAAC,QAAQ,CAAC,OAAO,CAAC;SACzB,GAAG,EAAE;SACL,GAAG,CAAC,YAAY,CAAC,CAAC;IAEvB,wFAAwF;IACxF,MAAM,UAAU,GAAG,CACjB,EAAa,EACb,IAAqC,EACrC,GAAwB,EACf,EAAE;QACX,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QACvB,MAAM,QAAQ,GAAG,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QACrD,MAAM,OAAO,GAAG,EAAE;aACf,MAAM,CAAC,QAAQ,CAAC;aAChB,GAAG,CAAC,EAAE,GAAG,GAAG,EAAE,SAAS,EAAE,GAAG,EAAE,CAAC;aAC/B,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,QAAQ,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,OAAO,CAAC,QAAQ,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC,CAAC;aACnE,SAAS,CAAC,EAAE,EAAE,EAAE,QAAQ,CAAC,EAAE,EAAE,CAAC;aAC9B,GAAG,EAAE,CAAC;QACT,OAAO,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC;IAC5B,CAAC,CAAC;IAEF,OAAO;QACL;;;;;;;;;;;;;;;;;;WAkBG;QACH,mBAAmB,CACjB,MAAc,EACd,KAAa,EACb,MAAsB;YAEtB,OAAO,EAAE,CAAC,WAAW,CAAC,GAAG,EAAE;gBACzB,MAAM,QAAQ,GAAG,SAAS,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;gBAC1C,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC;oBAAE,OAAO,QAAQ,CAAC;gBAEzC,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC,IAAI,MAAM,CAAC,MAAM,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;oBAC1D,MAAM,IAAI,KAAK,CACb,8BAA8B,IAAI,CAAC,WAAW,kBAAkB,MAAM,CAAC,MAAM,EAAE,CAChF,CAAC;gBACJ,CAAC;gBAED,wEAAwE;gBACxE,yEAAyE;gBACzE,wEAAwE;gBACxE,sCAAsC;gBACtC,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;gBAC/B,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;oBACvB,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC;wBACzB,MAAM,IAAI,KAAK,CAAC,8BAA8B,CAAC,CAAC,QAAQ,EAAE,CAAC,CAAC;oBAC9D,CAAC;oBACD,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC;gBACvB,CAAC;gBAED,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;oBACvB,KAAK,MAAM,GAAG,IAAI,CAAC,CAAC,SAAS,EAAE,CAAC;wBAC9B,qCAAqC;wBACrC,IAAI,GAAG,KAAK,CAAC,CAAC,QAAQ,EAAE,CAAC;4BACvB,MAAM,IAAI,KAAK,CAAC,WAAW,CAAC,CAAC,QAAQ,oBAAoB,CAAC,CAAC;wBAC7D,CAAC;wBACD,0DAA0D;wBAC1D,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;4BACnB,MAAM,IAAI,KAAK,CACb,WAAW,CAAC,CAAC,QAAQ,4BAA4B,GAAG,EAAE,CACvD,CAAC;wBACJ,CAAC;oBACH,CAAC;oBACD,sEAAsE;oBACtE,gBAAgB,CAAC,KAAK,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC;gBACvC,CAAC;gBAED,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;gBACvB,MAAM,OAAO,GAAG,IAAI,GAAG,EAAqB,CAAC;gBAE7C,oEAAoE;gBACpE,wEAAwE;gBACxE,uEAAuE;gBACvE,wEAAwE;gBACxE,sEAAsE;gBACtE,MAAM,OAAO,GACX,EAAE;qBACC,MAAM,CAAC,EAAE,GAAG,EAAE,GAAG,CAAC,QAAQ,CAAC,OAAO,CAAC,EAAE,CAAC;qBACtC,IAAI,CAAC,QAAQ,CAAC;qBACd,KAAK,CAAC,EAAE,CAAC,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;qBAClC,GAAG,EAAE,EAAE,GAAG,IAAI,IAAI,CAAC;gBACxB,MAAM,YAAY,GAAG,OAAO,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,GAAG,CAAC,CAAC;gBACxD,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE;oBAC3B,MAAM,EAAE,EAAE,EAAE,GAAG,EAAE;yBACd,MAAM,CAAC,QAAQ,CAAC;yBAChB,MAAM,CAAC;wBACN,MAAM;wBACN,KAAK;wBACL,OAAO,EAAE,YAAY,GAAG,MAAM;wBAC9B,IAAI,EAAE,CAAC,CAAC,IAAI;wBACZ,QAAQ,EAAE,IAAI;wBACd,aAAa,EAAE,IAAI;wBACnB,MAAM,EAAE,CAAC,CAAC,MAAM;wBAChB,cAAc,EAAE,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,UAAU,CAAC;wBAC5C,aAAa,EAAE,IAAI;wBACnB,UAAU,EAAE,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,MAAM,IAAI,EAAE,CAAC;wBAC1C,MAAM,EAAE,SAAiC;wBACzC,eAAe,EAAE,IAAI;wBACrB,KAAK,EAAE,IAAI;wBACX,SAAS,EAAE,GAAG;wBACd,SAAS,EAAE,GAAG;wBACd,WAAW,EAAE,IAAI;qBAClB,CAAC;yBACD,SAAS,CAAC,EAAE,EAAE,EAAE,QAAQ,CAAC,EAAE,EAAE,CAAC;yBAC9B,GAAG,EAAE,CAAC;oBACT,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC;gBAC9B,CAAC,CAAC,CAAC;gBAEH,gDAAgD;gBAChD,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;oBACvB,IAAI,CAAC,CAAC,SAAS,CAAC,MAAM,KAAK,CAAC;wBAAE,SAAS;oBACvC,MAAM,GAAG,GAAG,CAAC,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAc,CAAC,CAAC;oBAChE,EAAE,CAAC,MAAM,CAAC,QAAQ,CAAC;yBAChB,GAAG,CAAC,EAAE,aAAa,EAAE,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC;yBAC3C,KAAK,CAAC,EAAE,CAAC,QAAQ,CAAC,EAAE,EAAE,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAc,CAAC,CAAC;yBAC5D,GAAG,EAAE,CAAC;gBACX,CAAC;gBAED,OAAO,SAAS,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;YAClC,CAAC,CAAC,CAAC;QACL,CAAC;QAED,8BAA8B;QAC9B,GAAG,CAAC,EAAa;YACf,MAAM,GAAG,GAAG,EAAE,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC,QAAQ,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC;YACxE,OAAO,GAAG,CAAC,CAAC,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;QACxC,CAAC;QAED,gEAAgE;QAChE,IAAI,CAAC,MAAc;YACjB,OAAO,IAAI,CAAC,MAAM,CAAC,CAAC;QACtB,CAAC;QAED;;;;WAIG;QACH,SAAS,CAAC,MAAc,EAAE,KAAa;YACrC,OAAO,SAAS,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;QAClC,CAAC;QAED;;;;WAIG;QACH,KAAK,CACH,EAAa,EACb,MAAmD;YAEnD,OAAO,UAAU,CAAC,EAAE,EAAE,SAAS,EAAE;gBAC/B,MAAM,EAAE,SAAS;gBACjB,QAAQ,EAAE,MAAM,CAAC,QAAQ;gBACzB,aAAa,EAAE,MAAM,CAAC,aAAa;aACpC,CAAC,CAAC;QACL,CAAC;QAED;;;;WAIG;QACH,QAAQ,CAAC,EAAa,EAAE,WAAgC;YACtD,MAAM,KAAK,GAAG,iBAAiB,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC;YACnD,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,MAAM,GAAG,CAAC,CAAC,EAAE,CAAC;gBACjD,MAAM,IAAI,KAAK,CAAC,kDAAkD,CAAC,CAAC;YACtE,CAAC;YACD,OAAO,UAAU,CAAC,EAAE,EAAE,SAAS,EAAE;gBAC/B,MAAM,EAAE,WAAW;gBACnB,eAAe,EAAE,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC;gBACtC,WAAW,EAAE,IAAI,CAAC,GAAG,EAAE;aACxB,CAAC,CAAC;QACL,CAAC;QAED;;;;;;;;;;;;;WAaG;QACH,IAAI,CAAC,EAAa,EAAE,KAAa;YAC/B,OAAO,UAAU,CAAC,EAAE,EAAE,CAAC,SAAS,EAAE,SAAS,CAAC,EAAE;gBAC5C,MAAM,EAAE,QAAQ;gBAChB,KAAK;gBACL,WAAW,EAAE,IAAI,CAAC,GAAG,EAAE;aACxB,CAAC,CAAC;QACL,CAAC;QAED,2FAA2F;QAC3F,IAAI,CAAC,EAAa;YAChB,OAAO,UAAU,CAAC,EAAE,EAAE,SAAS,EAAE,EAAE,MAAM,EAAE,SAAS,EAAE,CAAC,CAAC;QAC1D,CAAC;QAED;;;;;;WAMG;QACH,aAAa,CAAC,EAAa;YACzB,OAAO,UAAU,CAAC,EAAE,EAAE,SAAS,EAAE;gBAC/B,MAAM,EAAE,UAAU;gBAClB,WAAW,EAAE,IAAI,CAAC,GAAG,EAAE;aACxB,CAAC,CAAC;QACL,CAAC;QAED;;;;;WAKG;QACH,aAAa,CAAC,MAAc;YAC1B,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;YACvB,MAAM,QAAQ,GAAG,EAAE;iBAChB,MAAM,CAAC,QAAQ,CAAC;iBAChB,GAAG,CAAC,EAAE,MAAM,EAAE,UAAU,EAAE,SAAS,EAAE,GAAG,EAAE,CAAC;iBAC3C,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC,EAAE,EAAE,CAAC,QAAQ,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC,CAAC;iBACvE,SAAS,CAAC,EAAE,EAAE,EAAE,QAAQ,CAAC,EAAE,EAAE,CAAC;iBAC9B,GAAG,EAAE,CAAC;YACT,OAAO,QAAQ,CAAC,MAAM,CAAC;QACzB,CAAC;QAED,kFAAkF;QAClF,OAAO;YACL,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,IAAI,CAAC;YACrD,EAAE,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC;QAClE,CAAC;KACF,CAAC;AACJ,CAAC"}

package/dist/db/models/tasks.d.ts

@@ -0,0 +1,92 @@
+import { Task, TaskState } from "@a2a-js/sdk";
+import { type PlainTask } from "../../a2a/task.js";
+import type { DB } from "../db.js";
+/** Filters + paging for {@link makeTasks} `list` (the A2A `ListTasks` method). */
+export interface TaskListQuery {
+    /** A2A context id to filter on; empty/absent means no filter. */
+    contextId?: string;
+    /** Task state to filter on, or `undefined` for any state. */
+    state?: TaskState;
+    /** Only tasks whose status was written at or after this epoch-ms instant. */
+    updatedAfter?: number;
+    /** Drop `artifacts` from the returned tasks (the spec's default). */
+    includeArtifacts: boolean;
+    /** Cap on each task's `history`; `undefined` keeps it whole, `0` drops it. */
+    historyLength?: number;
+    limit: number;
+    offset: number;
+}
+/**
+ * A task's state, tolerating the `status`-less task the SDK's generated type
+ * permits (`TaskStatus | undefined`). Nothing we build omits it, so an
+ * unspecified state means the row came from somewhere unexpected — and it
+ * compares equal to none of the states the callers switch on.
+ */
+export declare function stateOf(task: Task): TaskState;
+/**
+ * Query methods for the `notify_tasks` table (async A2A task state).
+ *
+ * Bound to a drizzle handle by {@link AgentDB} and reached as `db.tasks.*`.
+ * Migrations are owned by `AgentDB`, not this factory — it only issues queries.
+ *
+ * Rows hold the task in its **A2A wire form** (`Task.toJSON`), not the in-memory
+ * protobuf shape the SDK hands us. Those differ under v1.0 — enums are numbers
+ * in memory but `SCREAMING_SNAKE` strings on the wire, and `Part.content` is a
+ * `{ $case, value }` wrapper in memory but a bare named key on the wire — so a
+ * plain `JSON.stringify` would persist a shape that is neither valid A2A JSON
+ * nor stable across SDK versions. Encoding on write and decoding on read keeps
+ * the stored bytes the spec's own format, which is also exactly what
+ * `postNotification` puts on the wire.
+ */
+export declare function makeTasks(db: DB): {
+    /**
+     * Accept a turn: return the `submitted` task for the given `messageId`,
+     * creating it on first sight. Idempotent on `messageId` (the gateway's
+     * dedupe key, stable across dispatch retries).
+     */
+    begin(input: {
+        messageId: string;
+        taskId: string;
+        contextId: string;
+    }): PlainTask;
+    /** Load a task by id (for `GetTask` via the Worker's `DurableTaskStore`). */
+    get(taskId: string): PlainTask | null;
+    /**
+     * A page of this caller's tasks for `ListTasks`, newest first, with the
+     * total matching count so the store can decide whether a next page exists.
+     */
+    list(query: TaskListQuery): {
+        tasks: PlainTask[];
+        totalSize: number;
+    };
+    /**
+     * Upsert a task by id, preserving the `message_id` set by {@link begin}.
+     * Returns whether the write applied.
+     *
+     * Guarded exactly like {@link markWorking}, and for the same reason: a
+     * `canceled` row is terminal, so nothing may write a non-canceled state over
+     * it. That closes the window between a workflow's terminal build and its
+     * callback — the read-check-write is synchronous here, so a `CancelTask`
+     * landing mid-delivery makes this return `false` and the notify never fires.
+     * Writing `canceled` onto a live row stays allowed: that is how the a2a-js
+     * handler's own cancel branch records the cancellation.
+     */
+    save(task: Task): boolean;
+    /**
+     * Move a task to `working` (a turn workflow's first step). Returns
+     * `"canceled"` when the row is already canceled, which is the caller's
+     * signal to stop the turn; every other outcome — unknown task, or a task
+     * already past `submitted` — is a no-op reported as `"ok"`, because a
+     * workflow replay legitimately re-runs this step.
+     */
+    markWorking(taskId: string): "ok" | "canceled";
+    /**
+     * Flip the task to `canceled` and return it. Terminal: once this lands,
+     * {@link save} refuses every non-canceled write, so no completed or failed
+     * callback can be built from this row afterwards.
+     */
+    cancel(taskId: string): PlainTask | null;
+    /** Delete all tasks older than 30 days (called by the maintenance cron). */
+    cleanup(): void;
+};
+//# sourceMappingURL=tasks.d.ts.map

package/dist/db/models/tasks.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"tasks.d.ts","sourceRoot":"","sources":["../../../src/db/models/tasks.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,IAAI,EAAE,SAAS,EAAE,MAAM,aAAa,CAAC;AAE9C,OAAO,EAAkB,KAAK,SAAS,EAAE,MAAM,mBAAmB,CAAC;AAGnE,OAAO,KAAK,EAAE,EAAE,EAAE,MAAM,UAAU,CAAC;AAMnC,kFAAkF;AAClF,MAAM,WAAW,aAAa;IAC5B,iEAAiE;IACjE,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,6DAA6D;IAC7D,KAAK,CAAC,EAAE,SAAS,CAAC;IAClB,6EAA6E;IAC7E,YAAY,CAAC,EAAE,MAAM,CAAC;IACtB,qEAAqE;IACrE,gBAAgB,EAAE,OAAO,CAAC;IAC1B,8EAA8E;IAC9E,aAAa,CAAC,EAAE,MAAM,CAAC;IACvB,KAAK,EAAE,MAAM,CAAC;IACd,MAAM,EAAE,MAAM,CAAC;CAChB;AAED;;;;;GAKG;AACH,wBAAgB,OAAO,CAAC,IAAI,EAAE,IAAI,GAAG,SAAS,CAE7C;AAED;;;;;;;;;;;;;;GAcG;AACH,wBAAgB,SAAS,CAAC,EAAE,EAAE,EAAE;IAiC5B;;;;OAIG;iBACU;QACX,SAAS,EAAE,MAAM,CAAC;QAClB,MAAM,EAAE,MAAM,CAAC;QACf,SAAS,EAAE,MAAM,CAAC;KACnB,GAAG,SAAS;IAwBb,6EAA6E;gBACjE,MAAM,GAAG,SAAS,GAAG,IAAI;IAIrC;;;OAGG;gBACS,aAAa,GAAG;QAAE,KAAK,EAAE,SAAS,EAAE,CAAC;QAAC,SAAS,EAAE,MAAM,CAAA;KAAE;IAiCrE;;;;;;;;;;;OAWG;eACQ,IAAI,GAAG,OAAO;IAazB;;;;;;OAMG;wBACiB,MAAM,GAAG,IAAI,GAAG,UAAU;IAe9C;;;;OAIG;mBACY,MAAM,GAAG,SAAS,GAAG,IAAI;IAaxC,4EAA4E;eACjE,IAAI;EAKlB"}

package/dist/db/models/tasks.js

@@ -0,0 +1,212 @@
+import { Task, TaskState } from "@a2a-js/sdk";
+import { and, count, desc, eq, gte, lt } from "drizzle-orm";
+import { taskStateLabel } from "../../a2a/task.js";
+import { buildSubmittedTask } from "../../a2a/notify.js";
+import { notifyTasks } from "../schema.js";
+function nowIso() {
+    return new Date().toISOString();
+}
+/**
+ * A task's state, tolerating the `status`-less task the SDK's generated type
+ * permits (`TaskStatus | undefined`). Nothing we build omits it, so an
+ * unspecified state means the row came from somewhere unexpected — and it
+ * compares equal to none of the states the callers switch on.
+ */
+export function stateOf(task) {
+    return task.status?.state ?? TaskState.TASK_STATE_UNSPECIFIED;
+}
+/**
+ * Query methods for the `notify_tasks` table (async A2A task state).
+ *
+ * Bound to a drizzle handle by {@link AgentDB} and reached as `db.tasks.*`.
+ * Migrations are owned by `AgentDB`, not this factory — it only issues queries.
+ *
+ * Rows hold the task in its **A2A wire form** (`Task.toJSON`), not the in-memory
+ * protobuf shape the SDK hands us. Those differ under v1.0 — enums are numbers
+ * in memory but `SCREAMING_SNAKE` strings on the wire, and `Part.content` is a
+ * `{ $case, value }` wrapper in memory but a bare named key on the wire — so a
+ * plain `JSON.stringify` would persist a shape that is neither valid A2A JSON
+ * nor stable across SDK versions. Encoding on write and decoding on read keeps
+ * the stored bytes the spec's own format, which is also exactly what
+ * `postNotification` puts on the wire.
+ */
+export function makeTasks(db) {
+    // Every row was written by the builders in `a2a/notify`, which produce exactly
+    // the narrowed {@link PlainTask} shape, so the decode lands back on it.
+    const parse = (row) => Task.fromJSON(JSON.parse(row.taskJson));
+    const serialize = (task) => JSON.stringify(Task.toJSON(task));
+    const readOne = (taskId) => {
+        const row = db
+            .select()
+            .from(notifyTasks)
+            .where(eq(notifyTasks.taskId, taskId))
+            .get();
+        return row ? parse(row) : null;
+    };
+    const upsert = (task) => {
+        const now = Date.now();
+        // Denormalized so `ListTasks` can filter on it without decoding every blob.
+        const columns = {
+            contextId: task.contextId,
+            state: taskStateLabel(stateOf(task)),
+            taskJson: serialize(task),
+            updatedAt: now
+        };
+        db.insert(notifyTasks)
+            .values({ taskId: task.id, messageId: null, createdAt: now, ...columns })
+            .onConflictDoUpdate({ target: notifyTasks.taskId, set: columns })
+            .run();
+    };
+    return {
+        /**
+         * Accept a turn: return the `submitted` task for the given `messageId`,
+         * creating it on first sight. Idempotent on `messageId` (the gateway's
+         * dedupe key, stable across dispatch retries).
+         */
+        begin(input) {
+            const existing = db
+                .select()
+                .from(notifyTasks)
+                .where(eq(notifyTasks.messageId, input.messageId))
+                .get();
+            if (existing)
+                return parse(existing);
+            const task = buildSubmittedTask(input.taskId, input.contextId);
+            const now = Date.now();
+            db.insert(notifyTasks)
+                .values({
+                taskId: task.id,
+                messageId: input.messageId,
+                contextId: task.contextId,
+                state: taskStateLabel(task.status.state),
+                taskJson: serialize(task),
+                createdAt: now,
+                updatedAt: now
+            })
+                .run();
+            return task;
+        },
+        /** Load a task by id (for `GetTask` via the Worker's `DurableTaskStore`). */
+        get(taskId) {
+            return readOne(taskId);
+        },
+        /**
+         * A page of this caller's tasks for `ListTasks`, newest first, with the
+         * total matching count so the store can decide whether a next page exists.
+         */
+        list(query) {
+            const filters = [];
+            if (query.contextId) {
+                filters.push(eq(notifyTasks.contextId, query.contextId));
+            }
+            if (query.state !== undefined) {
+                filters.push(eq(notifyTasks.state, taskStateLabel(query.state)));
+            }
+            if (query.updatedAfter !== undefined) {
+                filters.push(gte(notifyTasks.updatedAt, query.updatedAfter));
+            }
+            const where = filters.length > 0 ? and(...filters) : undefined;
+            const rows = db
+                .select()
+                .from(notifyTasks)
+                .where(where)
+                .orderBy(desc(notifyTasks.createdAt))
+                .limit(query.limit)
+                .offset(query.offset)
+                .all();
+            const total = db
+                .select({ value: count() })
+                .from(notifyTasks)
+                .where(where)
+                .get();
+            return {
+                tasks: rows.map((row) => project(parse(row), query)),
+                totalSize: total?.value ?? 0
+            };
+        },
+        /**
+         * Upsert a task by id, preserving the `message_id` set by {@link begin}.
+         * Returns whether the write applied.
+         *
+         * Guarded exactly like {@link markWorking}, and for the same reason: a
+         * `canceled` row is terminal, so nothing may write a non-canceled state over
+         * it. That closes the window between a workflow's terminal build and its
+         * callback — the read-check-write is synchronous here, so a `CancelTask`
+         * landing mid-delivery makes this return `false` and the notify never fires.
+         * Writing `canceled` onto a live row stays allowed: that is how the a2a-js
+         * handler's own cancel branch records the cancellation.
+         */
+        save(task) {
+            const existing = readOne(task.id);
+            if (existing !== null &&
+                stateOf(existing) === TaskState.TASK_STATE_CANCELED &&
+                stateOf(task) !== TaskState.TASK_STATE_CANCELED) {
+                return false;
+            }
+            upsert(task);
+            return true;
+        },
+        /**
+         * Move a task to `working` (a turn workflow's first step). Returns
+         * `"canceled"` when the row is already canceled, which is the caller's
+         * signal to stop the turn; every other outcome — unknown task, or a task
+         * already past `submitted` — is a no-op reported as `"ok"`, because a
+         * workflow replay legitimately re-runs this step.
+         */
+        markWorking(taskId) {
+            const task = readOne(taskId);
+            if (!task)
+                return "ok";
+            if (stateOf(task) === TaskState.TASK_STATE_CANCELED)
+                return "canceled";
+            if (stateOf(task) !== TaskState.TASK_STATE_SUBMITTED)
+                return "ok";
+            task.status = {
+                ...task.status,
+                state: TaskState.TASK_STATE_WORKING,
+                message: task.status?.message,
+                timestamp: nowIso()
+            };
+            upsert(task);
+            return "ok";
+        },
+        /**
+         * Flip the task to `canceled` and return it. Terminal: once this lands,
+         * {@link save} refuses every non-canceled write, so no completed or failed
+         * callback can be built from this row afterwards.
+         */
+        cancel(taskId) {
+            const task = readOne(taskId);
+            if (!task)
+                return null;
+            task.status = {
+                ...task.status,
+                state: TaskState.TASK_STATE_CANCELED,
+                message: task.status?.message,
+                timestamp: nowIso()
+            };
+            upsert(task);
+            return task;
+        },
+        /** Delete all tasks older than 30 days (called by the maintenance cron). */
+        cleanup() {
+            const cutoff = Date.now() - 30 * 24 * 60 * 60 * 1000;
+            db.delete(notifyTasks).where(lt(notifyTasks.createdAt, cutoff)).run();
+        }
+    };
+}
+/**
+ * Apply the `ListTasks` response-shaping options to one stored task. Rows are
+ * JSON blobs, so the repeated fields are defaulted rather than assumed present.
+ */
+function project(task, query) {
+    const history = task.history ?? [];
+    return {
+        ...task,
+        artifacts: query.includeArtifacts ? (task.artifacts ?? []) : [],
+        history: query.historyLength === undefined
+            ? history
+            : history.slice(Math.max(0, history.length - query.historyLength))
+    };
+}
+//# sourceMappingURL=tasks.js.map

package/dist/db/models/tasks.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"tasks.js","sourceRoot":"","sources":["../../../src/db/models/tasks.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,IAAI,EAAE,SAAS,EAAE,MAAM,aAAa,CAAC;AAC9C,OAAO,EAAE,GAAG,EAAE,KAAK,EAAE,IAAI,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,EAAY,MAAM,aAAa,CAAC;AACtE,OAAO,EAAE,cAAc,EAAkB,MAAM,mBAAmB,CAAC;AACnE,OAAO,EAAE,kBAAkB,EAAE,MAAM,qBAAqB,CAAC;AACzD,OAAO,EAAE,WAAW,EAAE,MAAM,cAAc,CAAC;AAG3C,SAAS,MAAM;IACb,OAAO,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;AAClC,CAAC;AAkBD;;;;;GAKG;AACH,MAAM,UAAU,OAAO,CAAC,IAAU;IAChC,OAAO,IAAI,CAAC,MAAM,EAAE,KAAK,IAAI,SAAS,CAAC,sBAAsB,CAAC;AAChE,CAAC;AAED;;;;;;;;;;;;;;GAcG;AACH,MAAM,UAAU,SAAS,CAAC,EAAM;IAC9B,+EAA+E;IAC/E,wEAAwE;IACxE,MAAM,KAAK,GAAG,CAAC,GAAyB,EAAa,EAAE,CACrD,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAc,CAAC;IAEvD,MAAM,SAAS,GAAG,CAAC,IAAU,EAAU,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC;IAE5E,MAAM,OAAO,GAAG,CAAC,MAAc,EAAoB,EAAE;QACnD,MAAM,GAAG,GAAG,EAAE;aACX,MAAM,EAAE;aACR,IAAI,CAAC,WAAW,CAAC;aACjB,KAAK,CAAC,EAAE,CAAC,WAAW,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;aACrC,GAAG,EAAE,CAAC;QACT,OAAO,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;IACjC,CAAC,CAAC;IAEF,MAAM,MAAM,GAAG,CAAC,IAAU,EAAQ,EAAE;QAClC,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QACvB,4EAA4E;QAC5E,MAAM,OAAO,GAAG;YACd,SAAS,EAAE,IAAI,CAAC,SAAS;YACzB,KAAK,EAAE,cAAc,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;YACpC,QAAQ,EAAE,SAAS,CAAC,IAAI,CAAC;YACzB,SAAS,EAAE,GAAG;SACf,CAAC;QACF,EAAE,CAAC,MAAM,CAAC,WAAW,CAAC;aACnB,MAAM,CAAC,EAAE,MAAM,EAAE,IAAI,CAAC,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,SAAS,EAAE,GAAG,EAAE,GAAG,OAAO,EAAE,CAAC;aACxE,kBAAkB,CAAC,EAAE,MAAM,EAAE,WAAW,CAAC,MAAM,EAAE,GAAG,EAAE,OAAO,EAAE,CAAC;aAChE,GAAG,EAAE,CAAC;IACX,CAAC,CAAC;IAEF,OAAO;QACL;;;;WAIG;QACH,KAAK,CAAC,KAIL;YACC,MAAM,QAAQ,GAAG,EAAE;iBAChB,MAAM,EAAE;iBACR,IAAI,CAAC,WAAW,CAAC;iBACjB,KAAK,CAAC,EAAE,CAAC,WAAW,CAAC,SAAS,EAAE,KAAK,CAAC,SAAS,CAAC,CAAC;iBACjD,GAAG,EAAE,CAAC;YACT,IAAI,QAAQ;gBAAE,OAAO,KAAK,CAAC,QAAQ,CAAC,CAAC;YAErC,MAAM,IAAI,GAAG,kBAAkB,CAAC,KAAK,CAAC,MAAM,EAAE,KAAK,CAAC,SAAS,CAAC,CAAC;YAC/D,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;YACvB,EAAE,CAAC,MAAM,CAAC,WAAW,CAAC;iBACnB,MAAM,CAAC;gBACN,MAAM,EAAE,IAAI,CAAC,EAAE;gBACf,SAAS,EAAE,KAAK,CAAC,SAAS;gBAC1B,SAAS,EAAE,IAAI,CAAC,SAAS;gBACzB,KAAK,EAAE,cAAc,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC;gBACxC,QAAQ,EAAE,SAAS,CAAC,IAAI,CAAC;gBACzB,SAAS,EAAE,GAAG;gBACd,SAAS,EAAE,GAAG;aACf,CAAC;iBACD,GAAG,EAAE,CAAC;YACT,OAAO,IAAI,CAAC;QACd,CAAC;QAED,6EAA6E;QAC7E,GAAG,CAAC,MAAc;YAChB,OAAO,OAAO,CAAC,MAAM,CAAC,CAAC;QACzB,CAAC;QAED;;;WAGG;QACH,IAAI,CAAC,KAAoB;YACvB,MAAM,OAAO,GAAU,EAAE,CAAC;YAC1B,IAAI,KAAK,CAAC,SAAS,EAAE,CAAC;gBACpB,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,WAAW,CAAC,SAAS,EAAE,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC;YAC3D,CAAC;YACD,IAAI,KAAK,CAAC,KAAK,KAAK,SAAS,EAAE,CAAC;gBAC9B,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,WAAW,CAAC,KAAK,EAAE,cAAc,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YACnE,CAAC;YACD,IAAI,KAAK,CAAC,YAAY,KAAK,SAAS,EAAE,CAAC;gBACrC,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,WAAW,CAAC,SAAS,EAAE,KAAK,CAAC,YAAY,CAAC,CAAC,CAAC;YAC/D,CAAC;YACD,MAAM,KAAK,GAAG,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;YAE/D,MAAM,IAAI,GAAG,EAAE;iBACZ,MAAM,EAAE;iBACR,IAAI,CAAC,WAAW,CAAC;iBACjB,KAAK,CAAC,KAAK,CAAC;iBACZ,OAAO,CAAC,IAAI,CAAC,WAAW,CAAC,SAAS,CAAC,CAAC;iBACpC,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC;iBAClB,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC;iBACpB,GAAG,EAAE,CAAC;YACT,MAAM,KAAK,GAAG,EAAE;iBACb,MAAM,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,EAAE,CAAC;iBAC1B,IAAI,CAAC,WAAW,CAAC;iBACjB,KAAK,CAAC,KAAK,CAAC;iBACZ,GAAG,EAAE,CAAC;YAET,OAAO;gBACL,KAAK,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,OAAO,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,KAAK,CAAC,CAAC;gBACpD,SAAS,EAAE,KAAK,EAAE,KAAK,IAAI,CAAC;aAC7B,CAAC;QACJ,CAAC;QAED;;;;;;;;;;;WAWG;QACH,IAAI,CAAC,IAAU;YACb,MAAM,QAAQ,GAAG,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YAClC,IACE,QAAQ,KAAK,IAAI;gBACjB,OAAO,CAAC,QAAQ,CAAC,KAAK,SAAS,CAAC,mBAAmB;gBACnD,OAAO,CAAC,IAAI,CAAC,KAAK,SAAS,CAAC,mBAAmB,EAC/C,CAAC;gBACD,OAAO,KAAK,CAAC;YACf,CAAC;YACD,MAAM,CAAC,IAAI,CAAC,CAAC;YACb,OAAO,IAAI,CAAC;QACd,CAAC;QAED;;;;;;WAMG;QACH,WAAW,CAAC,MAAc;YACxB,MAAM,IAAI,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC;YAC7B,IAAI,CAAC,IAAI;gBAAE,OAAO,IAAI,CAAC;YACvB,IAAI,OAAO,CAAC,IAAI,CAAC,KAAK,SAAS,CAAC,mBAAmB;gBAAE,OAAO,UAAU,CAAC;YACvE,IAAI,OAAO,CAAC,IAAI,CAAC,KAAK,SAAS,CAAC,oBAAoB;gBAAE,OAAO,IAAI,CAAC;YAClE,IAAI,CAAC,MAAM,GAAG;gBACZ,GAAG,IAAI,CAAC,MAAM;gBACd,KAAK,EAAE,SAAS,CAAC,kBAAkB;gBACnC,OAAO,EAAE,IAAI,CAAC,MAAM,EAAE,OAAO;gBAC7B,SAAS,EAAE,MAAM,EAAE;aACpB,CAAC;YACF,MAAM,CAAC,IAAI,CAAC,CAAC;YACb,OAAO,IAAI,CAAC;QACd,CAAC;QAED;;;;WAIG;QACH,MAAM,CAAC,MAAc;YACnB,MAAM,IAAI,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC;YAC7B,IAAI,CAAC,IAAI;gBAAE,OAAO,IAAI,CAAC;YACvB,IAAI,CAAC,MAAM,GAAG;gBACZ,GAAG,IAAI,CAAC,MAAM;gBACd,KAAK,EAAE,SAAS,CAAC,mBAAmB;gBACpC,OAAO,EAAE,IAAI,CAAC,MAAM,EAAE,OAAO;gBAC7B,SAAS,EAAE,MAAM,EAAE;aACpB,CAAC;YACF,MAAM,CAAC,IAAI,CAAC,CAAC;YACb,OAAO,IAAI,CAAC;QACd,CAAC;QAED,4EAA4E;QAC5E,OAAO;YACL,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,IAAI,CAAC;YACrD,EAAE,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC,WAAW,CAAC,SAAS,EAAE,MAAM,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC;QACxE,CAAC;KACF,CAAC;AACJ,CAAC;AAED;;;GAGG;AACH,SAAS,OAAO,CAAC,IAAe,EAAE,KAAoB;IACpD,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,IAAI,EAAE,CAAC;IACnC,OAAO;QACL,GAAG,IAAI;QACP,SAAS,EAAE,KAAK,CAAC,gBAAgB,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE;QAC/D,OAAO,EACL,KAAK,CAAC,aAAa,KAAK,SAAS;YAC/B,CAAC,CAAC,OAAO;YACT,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,OAAO,CAAC,MAAM,GAAG,KAAK,CAAC,aAAa,CAAC,CAAC;KACvE,CAAC;AACJ,CAAC"}