@jackchen_me/open-multi-agent 0.1.0

package/dist/task/queue.js

@@ -0,0 +1,337 @@
+/**
+ * @fileoverview Dependency-aware task queue.
+ *
+ * {@link TaskQueue} owns the mutable lifecycle of every task it holds.
+ * Completing a task automatically unblocks dependents and fires events so
+ * orchestrators can react without polling.
+ */
+import { isTaskReady } from './task.js';
+// ---------------------------------------------------------------------------
+// TaskQueue
+// ---------------------------------------------------------------------------
+/**
+ * Mutable, event-driven queue with topological dependency resolution.
+ *
+ * Tasks enter in `'pending'` state. The queue promotes them to `'blocked'`
+ * when unresolved dependencies exist, and back to `'pending'` (firing
+ * `'task:ready'`) when those dependencies complete. Callers drive execution by
+ * calling {@link next} / {@link nextAvailable} and updating task state via
+ * {@link complete} or {@link fail}.
+ *
+ * @example
+ * ```ts
+ * const queue = new TaskQueue()
+ * queue.on('task:ready', (task) => scheduleExecution(task))
+ * queue.on('all:complete', () => shutdown())
+ *
+ * queue.addBatch(tasks)
+ * ```
+ */
+export class TaskQueue {
+    tasks = new Map();
+    /** Listeners keyed by event type, stored as symbol → handler pairs. */
+    listeners = new Map();
+    // ---------------------------------------------------------------------------
+    // Mutation: add
+    // ---------------------------------------------------------------------------
+    /**
+     * Adds a single task.
+     *
+     * If the task has unresolved dependencies it is immediately promoted to
+     * `'blocked'`; otherwise it stays `'pending'` and `'task:ready'` fires.
+     */
+    add(task) {
+        const resolved = this.resolveInitialStatus(task);
+        this.tasks.set(resolved.id, resolved);
+        if (resolved.status === 'pending') {
+            this.emit('task:ready', resolved);
+        }
+    }
+    /**
+     * Adds multiple tasks at once.
+     *
+     * Processing each task re-evaluates the current map state, so inserting a
+     * batch where some tasks satisfy others' dependencies produces correct initial
+     * statuses when the dependencies appear first in the array. Use
+     * {@link getTaskDependencyOrder} from `task.ts` to pre-sort if needed.
+     */
+    addBatch(tasks) {
+        for (const task of tasks) {
+            this.add(task);
+        }
+    }
+    // ---------------------------------------------------------------------------
+    // Mutation: update / complete / fail
+    // ---------------------------------------------------------------------------
+    /**
+     * Applies a partial update to an existing task.
+     *
+     * Only `status`, `result`, and `assignee` are accepted to keep the update
+     * surface narrow. Use {@link complete} and {@link fail} for terminal states.
+     *
+     * @throws {Error} when `taskId` is not found.
+     */
+    update(taskId, update) {
+        const task = this.requireTask(taskId);
+        const updated = {
+            ...task,
+            ...update,
+            updatedAt: new Date(),
+        };
+        this.tasks.set(taskId, updated);
+        return updated;
+    }
+    /**
+     * Marks `taskId` as `'completed'`, records an optional `result` string, and
+     * unblocks any dependents that are now ready to run.
+     *
+     * Fires `'task:complete'`, then `'task:ready'` for each newly-unblocked task,
+     * then `'all:complete'` when the queue is fully resolved.
+     *
+     * @throws {Error} when `taskId` is not found.
+     */
+    complete(taskId, result) {
+        const completed = this.update(taskId, { status: 'completed', result });
+        this.emit('task:complete', completed);
+        this.unblockDependents(taskId);
+        if (this.isComplete()) {
+            this.emitAllComplete();
+        }
+        return completed;
+    }
+    /**
+     * Marks `taskId` as `'failed'` and records `error` in the `result` field.
+     *
+     * Fires `'task:failed'` for the failed task and for every downstream task
+     * that transitively depended on it (cascade failure). This prevents blocked
+     * tasks from remaining stuck indefinitely when an upstream dependency fails.
+     *
+     * @throws {Error} when `taskId` is not found.
+     */
+    fail(taskId, error) {
+        const failed = this.update(taskId, { status: 'failed', result: error });
+        this.emit('task:failed', failed);
+        this.cascadeFailure(taskId);
+        if (this.isComplete()) {
+            this.emitAllComplete();
+        }
+        return failed;
+    }
+    /**
+     * Recursively marks all tasks that (transitively) depend on `failedTaskId`
+     * as `'failed'` with an informative message, firing `'task:failed'` for each.
+     *
+     * Only tasks in `'blocked'` or `'pending'` state are affected; tasks already
+     * in a terminal state are left untouched.
+     */
+    cascadeFailure(failedTaskId) {
+        for (const task of this.tasks.values()) {
+            if (task.status !== 'blocked' && task.status !== 'pending')
+                continue;
+            if (!task.dependsOn?.includes(failedTaskId))
+                continue;
+            const cascaded = this.update(task.id, {
+                status: 'failed',
+                result: `Cancelled: dependency "${failedTaskId}" failed.`,
+            });
+            this.emit('task:failed', cascaded);
+            // Recurse to handle transitive dependents.
+            this.cascadeFailure(task.id);
+        }
+    }
+    // ---------------------------------------------------------------------------
+    // Queries
+    // ---------------------------------------------------------------------------
+    /**
+     * Returns the next `'pending'` task for `assignee` (matched against
+     * `task.assignee`), or `undefined` if none exists.
+     *
+     * If `assignee` is omitted, behaves like {@link nextAvailable}.
+     */
+    next(assignee) {
+        if (assignee === undefined)
+            return this.nextAvailable();
+        for (const task of this.tasks.values()) {
+            if (task.status === 'pending' && task.assignee === assignee) {
+                return task;
+            }
+        }
+        return undefined;
+    }
+    /**
+     * Returns the next `'pending'` task that has no `assignee` restriction, or
+     * the first `'pending'` task overall when all pending tasks have an assignee.
+     */
+    nextAvailable() {
+        let fallback;
+        for (const task of this.tasks.values()) {
+            if (task.status !== 'pending')
+                continue;
+            if (!task.assignee)
+                return task;
+            if (!fallback)
+                fallback = task;
+        }
+        return fallback;
+    }
+    /** Returns a snapshot array of all tasks (any status). */
+    list() {
+        return Array.from(this.tasks.values());
+    }
+    /** Returns all tasks whose `status` matches `status`. */
+    getByStatus(status) {
+        return this.list().filter((t) => t.status === status);
+    }
+    /**
+     * Returns `true` when every task in the queue has reached a terminal state
+     * (`'completed'` or `'failed'`), **or** the queue is empty.
+     */
+    isComplete() {
+        for (const task of this.tasks.values()) {
+            if (task.status !== 'completed' && task.status !== 'failed')
+                return false;
+        }
+        return true;
+    }
+    /**
+     * Returns a progress snapshot.
+     *
+     * @example
+     * ```ts
+     * const { completed, total } = queue.getProgress()
+     * console.log(`${completed}/${total} tasks done`)
+     * ```
+     */
+    getProgress() {
+        let completed = 0;
+        let failed = 0;
+        let inProgress = 0;
+        let pending = 0;
+        let blocked = 0;
+        for (const task of this.tasks.values()) {
+            switch (task.status) {
+                case 'completed':
+                    completed++;
+                    break;
+                case 'failed':
+                    failed++;
+                    break;
+                case 'in_progress':
+                    inProgress++;
+                    break;
+                case 'pending':
+                    pending++;
+                    break;
+                case 'blocked':
+                    blocked++;
+                    break;
+            }
+        }
+        return {
+            total: this.tasks.size,
+            completed,
+            failed,
+            inProgress,
+            pending,
+            blocked,
+        };
+    }
+    // ---------------------------------------------------------------------------
+    // Events
+    // ---------------------------------------------------------------------------
+    /**
+     * Subscribes to a queue event.
+     *
+     * @returns An unsubscribe function. Calling it is idempotent.
+     *
+     * @example
+     * ```ts
+     * const off = queue.on('task:ready', (task) => execute(task))
+     * // later…
+     * off()
+     * ```
+     */
+    on(event, handler) {
+        let map = this.listeners.get(event);
+        if (!map) {
+            map = new Map();
+            this.listeners.set(event, map);
+        }
+        const id = Symbol();
+        map.set(id, handler);
+        return () => {
+            map.delete(id);
+        };
+    }
+    // ---------------------------------------------------------------------------
+    // Private helpers
+    // ---------------------------------------------------------------------------
+    /**
+     * Evaluates whether `task` should start as `'blocked'` based on the tasks
+     * already registered in the queue.
+     */
+    resolveInitialStatus(task) {
+        if (!task.dependsOn || task.dependsOn.length === 0)
+            return task;
+        const allCurrent = Array.from(this.tasks.values());
+        const ready = isTaskReady(task, allCurrent);
+        if (ready)
+            return task;
+        return { ...task, status: 'blocked', updatedAt: new Date() };
+    }
+    /**
+     * After a task completes, scan all `'blocked'` tasks and promote any that are
+     * now fully satisfied to `'pending'`, firing `'task:ready'` for each.
+     *
+     * The task array and lookup map are built once for the entire scan to keep
+     * the operation O(n) rather than O(n²).
+     */
+    unblockDependents(completedId) {
+        const allTasks = Array.from(this.tasks.values());
+        const taskById = new Map(allTasks.map((t) => [t.id, t]));
+        for (const task of allTasks) {
+            if (task.status !== 'blocked')
+                continue;
+            if (!task.dependsOn?.includes(completedId))
+                continue;
+            // Re-check against the current state of the whole task set.
+            // Pass the pre-built map to avoid rebuilding it for every candidate task.
+            if (isTaskReady(task, allTasks, taskById)) {
+                const unblocked = {
+                    ...task,
+                    status: 'pending',
+                    updatedAt: new Date(),
+                };
+                this.tasks.set(task.id, unblocked);
+                // Update the map so subsequent iterations in the same call see the new status.
+                taskById.set(task.id, unblocked);
+                this.emit('task:ready', unblocked);
+            }
+        }
+    }
+    emit(event, task) {
+        const map = this.listeners.get(event);
+        if (!map)
+            return;
+        for (const handler of map.values()) {
+            ;
+            handler(task);
+        }
+    }
+    emitAllComplete() {
+        const map = this.listeners.get('all:complete');
+        if (!map)
+            return;
+        for (const handler of map.values()) {
+            ;
+            handler();
+        }
+    }
+    requireTask(taskId) {
+        const task = this.tasks.get(taskId);
+        if (!task)
+            throw new Error(`TaskQueue: task "${taskId}" not found.`);
+        return task;
+    }
+}
+//# sourceMappingURL=queue.js.map

package/dist/task/queue.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"queue.js","sourceRoot":"","sources":["../../src/task/queue.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAGH,OAAO,EAAE,WAAW,EAAE,MAAM,WAAW,CAAA;AAsBvC,8EAA8E;AAC9E,YAAY;AACZ,8EAA8E;AAE9E;;;;;;;;;;;;;;;;;GAiBG;AACH,MAAM,OAAO,SAAS;IACH,KAAK,GAAG,IAAI,GAAG,EAAgB,CAAA;IAEhD,uEAAuE;IACtD,SAAS,GAAG,IAAI,GAAG,EAGjC,CAAA;IAEH,8EAA8E;IAC9E,gBAAgB;IAChB,8EAA8E;IAE9E;;;;;OAKG;IACH,GAAG,CAAC,IAAU;QACZ,MAAM,QAAQ,GAAG,IAAI,CAAC,oBAAoB,CAAC,IAAI,CAAC,CAAA;QAChD,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,EAAE,QAAQ,CAAC,CAAA;QACrC,IAAI,QAAQ,CAAC,MAAM,KAAK,SAAS,EAAE,CAAC;YAClC,IAAI,CAAC,IAAI,CAAC,YAAY,EAAE,QAAQ,CAAC,CAAA;QACnC,CAAC;IACH,CAAC;IAED;;;;;;;OAOG;IACH,QAAQ,CAAC,KAAa;QACpB,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;QAChB,CAAC;IACH,CAAC;IAED,8EAA8E;IAC9E,qCAAqC;IACrC,8EAA8E;IAE9E;;;;;;;OAOG;IACH,MAAM,CACJ,MAAc,EACd,MAA6D;QAE7D,MAAM,IAAI,GAAG,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,CAAA;QACrC,MAAM,OAAO,GAAS;YACpB,GAAG,IAAI;YACP,GAAG,MAAM;YACT,SAAS,EAAE,IAAI,IAAI,EAAE;SACtB,CAAA;QACD,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,EAAE,OAAO,CAAC,CAAA;QAC/B,OAAO,OAAO,CAAA;IAChB,CAAC;IAED;;;;;;;;OAQG;IACH,QAAQ,CAAC,MAAc,EAAE,MAAe;QACtC,MAAM,SAAS,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,EAAE,MAAM,EAAE,WAAW,EAAE,MAAM,EAAE,CAAC,CAAA;QACtE,IAAI,CAAC,IAAI,CAAC,eAAe,EAAE,SAAS,CAAC,CAAA;QACrC,IAAI,CAAC,iBAAiB,CAAC,MAAM,CAAC,CAAA;QAC9B,IAAI,IAAI,CAAC,UAAU,EAAE,EAAE,CAAC;YACtB,IAAI,CAAC,eAAe,EAAE,CAAA;QACxB,CAAC;QACD,OAAO,SAAS,CAAA;IAClB,CAAC;IAED;;;;;;;;OAQG;IACH,IAAI,CAAC,MAAc,EAAE,KAAa;QAChC,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,CAAA;QACvE,IAAI,CAAC,IAAI,CAAC,aAAa,EAAE,MAAM,CAAC,CAAA;QAChC,IAAI,CAAC,cAAc,CAAC,MAAM,CAAC,CAAA;QAC3B,IAAI,IAAI,CAAC,UAAU,EAAE,EAAE,CAAC;YACtB,IAAI,CAAC,eAAe,EAAE,CAAA;QACxB,CAAC;QACD,OAAO,MAAM,CAAA;IACf,CAAC;IAED;;;;;;OAMG;IACK,cAAc,CAAC,YAAoB;QACzC,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC;YACvC,IAAI,IAAI,CAAC,MAAM,KAAK,SAAS,IAAI,IAAI,CAAC,MAAM,KAAK,SAAS;gBAAE,SAAQ;YACpE,IAAI,CAAC,IAAI,CAAC,SAAS,EAAE,QAAQ,CAAC,YAAY,CAAC;gBAAE,SAAQ;YAErD,MAAM,QAAQ,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,EAAE;gBACpC,MAAM,EAAE,QAAQ;gBAChB,MAAM,EAAE,0BAA0B,YAAY,WAAW;aAC1D,CAAC,CAAA;YACF,IAAI,CAAC,IAAI,CAAC,aAAa,EAAE,QAAQ,CAAC,CAAA;YAClC,2CAA2C;YAC3C,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;QAC9B,CAAC;IACH,CAAC;IAED,8EAA8E;IAC9E,UAAU;IACV,8EAA8E;IAE9E;;;;;OAKG;IACH,IAAI,CAAC,QAAiB;QACpB,IAAI,QAAQ,KAAK,SAAS;YAAE,OAAO,IAAI,CAAC,aAAa,EAAE,CAAA;QAEvD,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC;YACvC,IAAI,IAAI,CAAC,MAAM,KAAK,SAAS,IAAI,IAAI,CAAC,QAAQ,KAAK,QAAQ,EAAE,CAAC;gBAC5D,OAAO,IAAI,CAAA;YACb,CAAC;QACH,CAAC;QACD,OAAO,SAAS,CAAA;IAClB,CAAC;IAED;;;OAGG;IACH,aAAa;QACX,IAAI,QAA0B,CAAA;QAE9B,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC;YACvC,IAAI,IAAI,CAAC,MAAM,KAAK,SAAS;gBAAE,SAAQ;YACvC,IAAI,CAAC,IAAI,CAAC,QAAQ;gBAAE,OAAO,IAAI,CAAA;YAC/B,IAAI,CAAC,QAAQ;gBAAE,QAAQ,GAAG,IAAI,CAAA;QAChC,CAAC;QAED,OAAO,QAAQ,CAAA;IACjB,CAAC;IAED,0DAA0D;IAC1D,IAAI;QACF,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,CAAA;IACxC,CAAC;IAED,yDAAyD;IACzD,WAAW,CAAC,MAAkB;QAC5B,OAAO,IAAI,CAAC,IAAI,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,MAAM,CAAC,CAAA;IACvD,CAAC;IAED;;;OAGG;IACH,UAAU;QACR,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC;YACvC,IAAI,IAAI,CAAC,MAAM,KAAK,WAAW,IAAI,IAAI,CAAC,MAAM,KAAK,QAAQ;gBAAE,OAAO,KAAK,CAAA;QAC3E,CAAC;QACD,OAAO,IAAI,CAAA;IACb,CAAC;IAED;;;;;;;;OAQG;IACH,WAAW;QAQT,IAAI,SAAS,GAAG,CAAC,CAAA;QACjB,IAAI,MAAM,GAAG,CAAC,CAAA;QACd,IAAI,UAAU,GAAG,CAAC,CAAA;QAClB,IAAI,OAAO,GAAG,CAAC,CAAA;QACf,IAAI,OAAO,GAAG,CAAC,CAAA;QAEf,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC;YACvC,QAAQ,IAAI,CAAC,MAAM,EAAE,CAAC;gBACpB,KAAK,WAAW;oBACd,SAAS,EAAE,CAAA;oBACX,MAAK;gBACP,KAAK,QAAQ;oBACX,MAAM,EAAE,CAAA;oBACR,MAAK;gBACP,KAAK,aAAa;oBAChB,UAAU,EAAE,CAAA;oBACZ,MAAK;gBACP,KAAK,SAAS;oBACZ,OAAO,EAAE,CAAA;oBACT,MAAK;gBACP,KAAK,SAAS;oBACZ,OAAO,EAAE,CAAA;oBACT,MAAK;YACT,CAAC;QACH,CAAC;QAED,OAAO;YACL,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,IAAI;YACtB,SAAS;YACT,MAAM;YACN,UAAU;YACV,OAAO;YACP,OAAO;SACR,CAAA;IACH,CAAC;IAED,8EAA8E;IAC9E,SAAS;IACT,8EAA8E;IAE9E;;;;;;;;;;;OAWG;IACH,EAAE,CACA,KAAQ,EACR,OAAsB;QAEtB,IAAI,GAAG,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,CAAA;QACnC,IAAI,CAAC,GAAG,EAAE,CAAC;YACT,GAAG,GAAG,IAAI,GAAG,EAAE,CAAA;YACf,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,KAAK,EAAE,GAAG,CAAC,CAAA;QAChC,CAAC;QACD,MAAM,EAAE,GAAG,MAAM,EAAE,CAAA;QACnB,GAAG,CAAC,GAAG,CAAC,EAAE,EAAE,OAA2C,CAAC,CAAA;QACxD,OAAO,GAAG,EAAE;YACV,GAAI,CAAC,MAAM,CAAC,EAAE,CAAC,CAAA;QACjB,CAAC,CAAA;IACH,CAAC;IAED,8EAA8E;IAC9E,kBAAkB;IAClB,8EAA8E;IAE9E;;;OAGG;IACK,oBAAoB,CAAC,IAAU;QACrC,IAAI,CAAC,IAAI,CAAC,SAAS,IAAI,IAAI,CAAC,SAAS,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,IAAI,CAAA;QAE/D,MAAM,UAAU,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,CAAA;QAClD,MAAM,KAAK,GAAG,WAAW,CAAC,IAAI,EAAE,UAAU,CAAC,CAAA;QAC3C,IAAI,KAAK;YAAE,OAAO,IAAI,CAAA;QAEtB,OAAO,EAAE,GAAG,IAAI,EAAE,MAAM,EAAE,SAAS,EAAE,SAAS,EAAE,IAAI,IAAI,EAAE,EAAE,CAAA;IAC9D,CAAC;IAED;;;;;;OAMG;IACK,iBAAiB,CAAC,WAAmB;QAC3C,MAAM,QAAQ,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,CAAA;QAChD,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAe,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAA;QAEtE,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;YAC5B,IAAI,IAAI,CAAC,MAAM,KAAK,SAAS;gBAAE,SAAQ;YACvC,IAAI,CAAC,IAAI,CAAC,SAAS,EAAE,QAAQ,CAAC,WAAW,CAAC;gBAAE,SAAQ;YAEpD,4DAA4D;YAC5D,0EAA0E;YAC1E,IAAI,WAAW,CAAC,IAAI,EAAE,QAAQ,EAAE,QAAQ,CAAC,EAAE,CAAC;gBAC1C,MAAM,SAAS,GAAS;oBACtB,GAAG,IAAI;oBACP,MAAM,EAAE,SAAS;oBACjB,SAAS,EAAE,IAAI,IAAI,EAAE;iBACtB,CAAA;gBACD,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,SAAS,CAAC,CAAA;gBAClC,+EAA+E;gBAC/E,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,SAAS,CAAC,CAAA;gBAChC,IAAI,CAAC,IAAI,CAAC,YAAY,EAAE,SAAS,CAAC,CAAA;YACpC,CAAC;QACH,CAAC;IACH,CAAC;IAEO,IAAI,CAAC,KAAqD,EAAE,IAAU;QAC5E,MAAM,GAAG,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,CAAA;QACrC,IAAI,CAAC,GAAG;YAAE,OAAM;QAChB,KAAK,MAAM,OAAO,IAAI,GAAG,CAAC,MAAM,EAAE,EAAE,CAAC;YACnC,CAAC;YAAC,OAAuB,CAAC,IAAI,CAAC,CAAA;QACjC,CAAC;IACH,CAAC;IAEO,eAAe;QACrB,MAAM,GAAG,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,cAAc,CAAC,CAAA;QAC9C,IAAI,CAAC,GAAG;YAAE,OAAM;QAChB,KAAK,MAAM,OAAO,IAAI,GAAG,CAAC,MAAM,EAAE,EAAE,CAAC;YACnC,CAAC;YAAC,OAA8B,EAAE,CAAA;QACpC,CAAC;IACH,CAAC;IAEO,WAAW,CAAC,MAAc;QAChC,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,CAAA;QACnC,IAAI,CAAC,IAAI;YAAE,MAAM,IAAI,KAAK,CAAC,oBAAoB,MAAM,cAAc,CAAC,CAAA;QACpE,OAAO,IAAI,CAAA;IACb,CAAC;CACF"}

package/dist/task/task.d.ts

@@ -0,0 +1,86 @@
+/**
+ * @fileoverview Pure task utility functions.
+ *
+ * These helpers operate on plain {@link Task} values without any mutable
+ * state, making them safe to use in reducers, tests, and reactive pipelines.
+ * Stateful orchestration belongs in {@link TaskQueue}.
+ */
+import type { Task } from '../types.js';
+/**
+ * Creates a new {@link Task} with a generated UUID, `'pending'` status, and
+ * `createdAt`/`updatedAt` timestamps set to the current instant.
+ *
+ * @example
+ * ```ts
+ * const task = createTask({
+ *   title: 'Research competitors',
+ *   description: 'Identify the top 5 competitors and their pricing',
+ *   assignee: 'researcher',
+ * })
+ * ```
+ */
+export declare function createTask(input: {
+    title: string;
+    description: string;
+    assignee?: string;
+    dependsOn?: string[];
+}): Task;
+/**
+ * Returns `true` when `task` can be started immediately.
+ *
+ * A task is considered ready when:
+ * 1. Its status is `'pending'`.
+ * 2. Every task listed in `task.dependsOn` has status `'completed'`.
+ *
+ * Tasks whose dependencies are missing from `allTasks` are treated as
+ * unresolvable and therefore **not** ready.
+ *
+ * @param task      - The task to evaluate.
+ * @param allTasks  - The full collection of tasks in the current queue/plan.
+ * @param taskById  - Optional pre-built id→task map. When provided the function
+ *                    skips rebuilding the map, reducing the complexity of
+ *                    call-sites that invoke `isTaskReady` inside a loop from
+ *                    O(n²) to O(n).
+ */
+export declare function isTaskReady(task: Task, allTasks: Task[], taskById?: Map<string, Task>): boolean;
+/**
+ * Returns `tasks` sorted so that each task appears after all of its
+ * dependencies — a standard topological (Kahn's algorithm) ordering.
+ *
+ * Tasks with no dependencies come first. If the graph contains a cycle the
+ * function returns a partial result containing only the tasks that could be
+ * ordered; use {@link validateTaskDependencies} to detect cycles before calling
+ * this function in production paths.
+ *
+ * @example
+ * ```ts
+ * const ordered = getTaskDependencyOrder(tasks)
+ * for (const task of ordered) {
+ *   await run(task)
+ * }
+ * ```
+ */
+export declare function getTaskDependencyOrder(tasks: Task[]): Task[];
+/**
+ * Validates the dependency graph of a task collection.
+ *
+ * Checks for:
+ * - References to unknown task IDs in `dependsOn`.
+ * - Cycles (a task depending on itself, directly or transitively).
+ * - Self-dependencies (`task.dependsOn` includes its own `id`).
+ *
+ * @returns An object with `valid: true` when no issues were found, or
+ *          `valid: false` with a non-empty `errors` array describing each
+ *          problem.
+ *
+ * @example
+ * ```ts
+ * const { valid, errors } = validateTaskDependencies(tasks)
+ * if (!valid) throw new Error(errors.join('\n'))
+ * ```
+ */
+export declare function validateTaskDependencies(tasks: Task[]): {
+    valid: boolean;
+    errors: string[];
+};
+//# sourceMappingURL=task.d.ts.map

package/dist/task/task.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"task.d.ts","sourceRoot":"","sources":["../../src/task/task.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,OAAO,KAAK,EAAE,IAAI,EAAc,MAAM,aAAa,CAAA;AAMnD;;;;;;;;;;;;GAYG;AACH,wBAAgB,UAAU,CAAC,KAAK,EAAE;IAChC,KAAK,EAAE,MAAM,CAAA;IACb,WAAW,EAAE,MAAM,CAAA;IACnB,QAAQ,CAAC,EAAE,MAAM,CAAA;IACjB,SAAS,CAAC,EAAE,MAAM,EAAE,CAAA;CACrB,GAAG,IAAI,CAaP;AAMD;;;;;;;;;;;;;;;;GAgBG;AACH,wBAAgB,WAAW,CACzB,IAAI,EAAE,IAAI,EACV,QAAQ,EAAE,IAAI,EAAE,EAChB,QAAQ,CAAC,EAAE,GAAG,CAAC,MAAM,EAAE,IAAI,CAAC,GAC3B,OAAO,CAYT;AAMD;;;;;;;;;;;;;;;;GAgBG;AACH,wBAAgB,sBAAsB,CAAC,KAAK,EAAE,IAAI,EAAE,GAAG,IAAI,EAAE,CA6C5D;AAMD;;;;;;;;;;;;;;;;;GAiBG;AACH,wBAAgB,wBAAwB,CAAC,KAAK,EAAE,IAAI,EAAE,GAAG;IACvD,KAAK,EAAE,OAAO,CAAA;IACd,MAAM,EAAE,MAAM,EAAE,CAAA;CACjB,CAoDA"}

package/dist/task/task.js

@@ -0,0 +1,201 @@
+/**
+ * @fileoverview Pure task utility functions.
+ *
+ * These helpers operate on plain {@link Task} values without any mutable
+ * state, making them safe to use in reducers, tests, and reactive pipelines.
+ * Stateful orchestration belongs in {@link TaskQueue}.
+ */
+// ---------------------------------------------------------------------------
+// Factory
+// ---------------------------------------------------------------------------
+/**
+ * Creates a new {@link Task} with a generated UUID, `'pending'` status, and
+ * `createdAt`/`updatedAt` timestamps set to the current instant.
+ *
+ * @example
+ * ```ts
+ * const task = createTask({
+ *   title: 'Research competitors',
+ *   description: 'Identify the top 5 competitors and their pricing',
+ *   assignee: 'researcher',
+ * })
+ * ```
+ */
+export function createTask(input) {
+    const now = new Date();
+    return {
+        id: crypto.randomUUID(),
+        title: input.title,
+        description: input.description,
+        status: 'pending',
+        assignee: input.assignee,
+        dependsOn: input.dependsOn ? [...input.dependsOn] : undefined,
+        result: undefined,
+        createdAt: now,
+        updatedAt: now,
+    };
+}
+// ---------------------------------------------------------------------------
+// Readiness
+// ---------------------------------------------------------------------------
+/**
+ * Returns `true` when `task` can be started immediately.
+ *
+ * A task is considered ready when:
+ * 1. Its status is `'pending'`.
+ * 2. Every task listed in `task.dependsOn` has status `'completed'`.
+ *
+ * Tasks whose dependencies are missing from `allTasks` are treated as
+ * unresolvable and therefore **not** ready.
+ *
+ * @param task      - The task to evaluate.
+ * @param allTasks  - The full collection of tasks in the current queue/plan.
+ * @param taskById  - Optional pre-built id→task map. When provided the function
+ *                    skips rebuilding the map, reducing the complexity of
+ *                    call-sites that invoke `isTaskReady` inside a loop from
+ *                    O(n²) to O(n).
+ */
+export function isTaskReady(task, allTasks, taskById) {
+    if (task.status !== 'pending')
+        return false;
+    if (!task.dependsOn || task.dependsOn.length === 0)
+        return true;
+    const map = taskById ?? new Map(allTasks.map((t) => [t.id, t]));
+    for (const depId of task.dependsOn) {
+        const dep = map.get(depId);
+        if (!dep || dep.status !== 'completed')
+            return false;
+    }
+    return true;
+}
+// ---------------------------------------------------------------------------
+// Topological sort
+// ---------------------------------------------------------------------------
+/**
+ * Returns `tasks` sorted so that each task appears after all of its
+ * dependencies — a standard topological (Kahn's algorithm) ordering.
+ *
+ * Tasks with no dependencies come first. If the graph contains a cycle the
+ * function returns a partial result containing only the tasks that could be
+ * ordered; use {@link validateTaskDependencies} to detect cycles before calling
+ * this function in production paths.
+ *
+ * @example
+ * ```ts
+ * const ordered = getTaskDependencyOrder(tasks)
+ * for (const task of ordered) {
+ *   await run(task)
+ * }
+ * ```
+ */
+export function getTaskDependencyOrder(tasks) {
+    if (tasks.length === 0)
+        return [];
+    const taskById = new Map(tasks.map((t) => [t.id, t]));
+    // Build adjacency: dependsOn edges become "predecessors" for in-degree count.
+    const inDegree = new Map();
+    // successors[id] = list of task IDs that depend on `id`
+    const successors = new Map();
+    for (const task of tasks) {
+        if (!inDegree.has(task.id))
+            inDegree.set(task.id, 0);
+        if (!successors.has(task.id))
+            successors.set(task.id, []);
+        for (const depId of task.dependsOn ?? []) {
+            // Only count dependencies that exist in this task set.
+            if (taskById.has(depId)) {
+                inDegree.set(task.id, (inDegree.get(task.id) ?? 0) + 1);
+                const deps = successors.get(depId) ?? [];
+                deps.push(task.id);
+                successors.set(depId, deps);
+            }
+        }
+    }
+    // Kahn's algorithm: start with all nodes of in-degree 0.
+    const queue = [];
+    for (const [id, degree] of inDegree) {
+        if (degree === 0)
+            queue.push(id);
+    }
+    const ordered = [];
+    while (queue.length > 0) {
+        const id = queue.shift();
+        const task = taskById.get(id);
+        if (task)
+            ordered.push(task);
+        for (const successorId of successors.get(id) ?? []) {
+            const newDegree = (inDegree.get(successorId) ?? 0) - 1;
+            inDegree.set(successorId, newDegree);
+            if (newDegree === 0)
+                queue.push(successorId);
+        }
+    }
+    return ordered;
+}
+// ---------------------------------------------------------------------------
+// Validation
+// ---------------------------------------------------------------------------
+/**
+ * Validates the dependency graph of a task collection.
+ *
+ * Checks for:
+ * - References to unknown task IDs in `dependsOn`.
+ * - Cycles (a task depending on itself, directly or transitively).
+ * - Self-dependencies (`task.dependsOn` includes its own `id`).
+ *
+ * @returns An object with `valid: true` when no issues were found, or
+ *          `valid: false` with a non-empty `errors` array describing each
+ *          problem.
+ *
+ * @example
+ * ```ts
+ * const { valid, errors } = validateTaskDependencies(tasks)
+ * if (!valid) throw new Error(errors.join('\n'))
+ * ```
+ */
+export function validateTaskDependencies(tasks) {
+    const errors = [];
+    const taskById = new Map(tasks.map((t) => [t.id, t]));
+    // Pass 1: check for unknown references and self-dependencies.
+    for (const task of tasks) {
+        for (const depId of task.dependsOn ?? []) {
+            if (depId === task.id) {
+                errors.push(`Task "${task.title}" (${task.id}) depends on itself.`);
+                continue;
+            }
+            if (!taskById.has(depId)) {
+                errors.push(`Task "${task.title}" (${task.id}) references unknown dependency "${depId}".`);
+            }
+        }
+    }
+    // Pass 2: cycle detection via DFS colouring (white=0, grey=1, black=2).
+    const colour = new Map();
+    for (const task of tasks)
+        colour.set(task.id, 0);
+    const visit = (id, path) => {
+        if (colour.get(id) === 2)
+            return; // Already fully explored.
+        if (colour.get(id) === 1) {
+            // Found a back-edge — cycle.
+            const cycleStart = path.indexOf(id);
+            const cycle = path.slice(cycleStart).concat(id);
+            errors.push(`Cyclic dependency detected: ${cycle.join(' -> ')}`);
+            return;
+        }
+        colour.set(id, 1);
+        const task = taskById.get(id);
+        for (const depId of task?.dependsOn ?? []) {
+            if (taskById.has(depId)) {
+                visit(depId, [...path, id]);
+            }
+        }
+        colour.set(id, 2);
+    };
+    for (const task of tasks) {
+        if (colour.get(task.id) === 0) {
+            visit(task.id, []);
+        }
+    }
+    return { valid: errors.length === 0, errors };
+}
+//# sourceMappingURL=task.js.map

package/dist/task/task.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"task.js","sourceRoot":"","sources":["../../src/task/task.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAIH,8EAA8E;AAC9E,UAAU;AACV,8EAA8E;AAE9E;;;;;;;;;;;;GAYG;AACH,MAAM,UAAU,UAAU,CAAC,KAK1B;IACC,MAAM,GAAG,GAAG,IAAI,IAAI,EAAE,CAAA;IACtB,OAAO;QACL,EAAE,EAAE,MAAM,CAAC,UAAU,EAAE;QACvB,KAAK,EAAE,KAAK,CAAC,KAAK;QAClB,WAAW,EAAE,KAAK,CAAC,WAAW;QAC9B,MAAM,EAAE,SAAuB;QAC/B,QAAQ,EAAE,KAAK,CAAC,QAAQ;QACxB,SAAS,EAAE,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,SAAS;QAC7D,MAAM,EAAE,SAAS;QACjB,SAAS,EAAE,GAAG;QACd,SAAS,EAAE,GAAG;KACf,CAAA;AACH,CAAC;AAED,8EAA8E;AAC9E,YAAY;AACZ,8EAA8E;AAE9E;;;;;;;;;;;;;;;;GAgBG;AACH,MAAM,UAAU,WAAW,CACzB,IAAU,EACV,QAAgB,EAChB,QAA4B;IAE5B,IAAI,IAAI,CAAC,MAAM,KAAK,SAAS;QAAE,OAAO,KAAK,CAAA;IAC3C,IAAI,CAAC,IAAI,CAAC,SAAS,IAAI,IAAI,CAAC,SAAS,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,IAAI,CAAA;IAE/D,MAAM,GAAG,GAAG,QAAQ,IAAI,IAAI,GAAG,CAAe,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAA;IAE7E,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;QACnC,MAAM,GAAG,GAAG,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,CAAA;QAC1B,IAAI,CAAC,GAAG,IAAI,GAAG,CAAC,MAAM,KAAK,WAAW;YAAE,OAAO,KAAK,CAAA;IACtD,CAAC;IAED,OAAO,IAAI,CAAA;AACb,CAAC;AAED,8EAA8E;AAC9E,mBAAmB;AACnB,8EAA8E;AAE9E;;;;;;;;;;;;;;;;GAgBG;AACH,MAAM,UAAU,sBAAsB,CAAC,KAAa;IAClD,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAA;IAEjC,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAe,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAA;IAEnE,8EAA8E;IAC9E,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAA;IAC1C,wDAAwD;IACxD,MAAM,UAAU,GAAG,IAAI,GAAG,EAAoB,CAAA;IAE9C,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;YAAE,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC,CAAA;QACpD,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;YAAE,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,CAAA;QAEzD,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,SAAS,IAAI,EAAE,EAAE,CAAC;YACzC,uDAAuD;YACvD,IAAI,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;gBACxB,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAA;gBACvD,MAAM,IAAI,GAAG,UAAU,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,EAAE,CAAA;gBACxC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;gBAClB,UAAU,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,CAAC,CAAA;YAC7B,CAAC;QACH,CAAC;IACH,CAAC;IAED,yDAAyD;IACzD,MAAM,KAAK,GAAa,EAAE,CAAA;IAC1B,KAAK,MAAM,CAAC,EAAE,EAAE,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;QACpC,IAAI,MAAM,KAAK,CAAC;YAAE,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;IAClC,CAAC;IAED,MAAM,OAAO,GAAW,EAAE,CAAA;IAC1B,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,MAAM,EAAE,GAAG,KAAK,CAAC,KAAK,EAAG,CAAA;QACzB,MAAM,IAAI,GAAG,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,CAAA;QAC7B,IAAI,IAAI;YAAE,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;QAE5B,KAAK,MAAM,WAAW,IAAI,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC;YACnD,MAAM,SAAS,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAA;YACtD,QAAQ,CAAC,GAAG,CAAC,WAAW,EAAE,SAAS,CAAC,CAAA;YACpC,IAAI,SAAS,KAAK,CAAC;gBAAE,KAAK,CAAC,IAAI,CAAC,WAAW,CAAC,CAAA;QAC9C,CAAC;IACH,CAAC;IAED,OAAO,OAAO,CAAA;AAChB,CAAC;AAED,8EAA8E;AAC9E,aAAa;AACb,8EAA8E;AAE9E;;;;;;;;;;;;;;;;;GAiBG;AACH,MAAM,UAAU,wBAAwB,CAAC,KAAa;IAIpD,MAAM,MAAM,GAAa,EAAE,CAAA;IAC3B,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAe,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAA;IAEnE,8DAA8D;IAC9D,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,SAAS,IAAI,EAAE,EAAE,CAAC;YACzC,IAAI,KAAK,KAAK,IAAI,CAAC,EAAE,EAAE,CAAC;gBACtB,MAAM,CAAC,IAAI,CACT,SAAS,IAAI,CAAC,KAAK,MAAM,IAAI,CAAC,EAAE,sBAAsB,CACvD,CAAA;gBACD,SAAQ;YACV,CAAC;YACD,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;gBACzB,MAAM,CAAC,IAAI,CACT,SAAS,IAAI,CAAC,KAAK,MAAM,IAAI,CAAC,EAAE,oCAAoC,KAAK,IAAI,CAC9E,CAAA;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAED,wEAAwE;IACxE,MAAM,MAAM,GAAG,IAAI,GAAG,EAAqB,CAAA;IAC3C,KAAK,MAAM,IAAI,IAAI,KAAK;QAAE,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC,CAAA;IAEhD,MAAM,KAAK,GAAG,CAAC,EAAU,EAAE,IAAc,EAAQ,EAAE;QACjD,IAAI,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,KAAK,CAAC;YAAE,OAAM,CAAC,0BAA0B;QAC3D,IAAI,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,KAAK,CAAC,EAAE,CAAC;YACzB,6BAA6B;YAC7B,MAAM,UAAU,GAAG,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC,CAAA;YACnC,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC,CAAA;YAC/C,MAAM,CAAC,IAAI,CAAC,+BAA+B,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,CAAA;YAChE,OAAM;QACR,CAAC;QAED,MAAM,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,CAAA;QACjB,MAAM,IAAI,GAAG,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,CAAA;QAC7B,KAAK,MAAM,KAAK,IAAI,IAAI,EAAE,SAAS,IAAI,EAAE,EAAE,CAAC;YAC1C,IAAI,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;gBACxB,KAAK,CAAC,KAAK,EAAE,CAAC,GAAG,IAAI,EAAE,EAAE,CAAC,CAAC,CAAA;YAC7B,CAAC;QACH,CAAC;QACD,MAAM,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,CAAA;IACnB,CAAC,CAAA;IAED,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,IAAI,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,EAAE,CAAC;YAC9B,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,CAAA;QACpB,CAAC;IACH,CAAC;IAED,OAAO,EAAE,KAAK,EAAE,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,MAAM,EAAE,CAAA;AAC/C,CAAC"}