agentic-qe 3.6.0 → 3.6.2

package/v3/dist/coordination/task-dag/dag.d.ts

@@ -0,0 +1,93 @@
+/**
+ * Agentic QE v3 - Task Dependency DAG
+ * ADR-064 Phase 1E: Core DAG data structure for task dependency tracking
+ *
+ * Directed acyclic graph where nodes are tasks and edges represent
+ * "blocked-by" dependencies. Topological sort via Kahn's algorithm,
+ * cycle detection via DFS coloring, critical path via longest-path DP.
+ */
+import type { DAGTask, AddTaskInput, DAGStats, DAGEventHandler } from './types.js';
+/**
+ * Directed acyclic graph for task dependency management.
+ *
+ * Tasks are nodes with forward edges (blockedBy) and reverse edges (blocks).
+ * Acyclicity is enforced through detection, allowing batch insertions.
+ */
+export declare class TaskDAG {
+    private readonly nodes;
+    private readonly forwardEdges;
+    private readonly reverseEdges;
+    private readonly eventHandlers;
+    /**
+     * Add a task to the DAG. Status is 'ready' if no incomplete blockers,
+     * otherwise 'blocked'. Reverse edges are computed automatically.
+     * @throws Error if a task with the same ID already exists
+     */
+    addTask(input: AddTaskInput): DAGTask;
+    /**
+     * Remove a task, clean up edges, and unblock dependents if appropriate.
+     * @returns true if removed, false if not found
+     */
+    removeTask(taskId: string): boolean;
+    /** Get a task by ID. */
+    getTask(taskId: string): DAGTask | undefined;
+    /** Get all tasks with 'ready' status. */
+    getReady(): DAGTask[];
+    /**
+     * Mark a task as in_progress.
+     * @throws Error if task not found or not in 'ready' status
+     */
+    start(taskId: string, agentId: string): void;
+    /**
+     * Mark a task completed and unblock downstream tasks.
+     * @returns Array of newly unblocked task IDs
+     * @throws Error if task not found or not 'in_progress'
+     */
+    complete(taskId: string, result?: unknown): string[];
+    /**
+     * Mark a task failed and cascade cancellation to dependents.
+     * @throws Error if task not found or not in 'in_progress'/'ready'
+     */
+    fail(taskId: string, error: string): void;
+    /**
+     * Topological sort using Kahn's algorithm.
+     * @throws Error if cycles exist
+     */
+    topologicalSort(): DAGTask[];
+    /**
+     * Detect cycles using DFS with white/gray/black coloring.
+     * @returns Array of cycles, or null if acyclic
+     */
+    detectCycles(): string[][] | null;
+    /**
+     * Find the critical path (longest path through the DAG).
+     * @returns Tasks on the critical path in execution order
+     */
+    getCriticalPath(): DAGTask[];
+    /** Get aggregate statistics about the DAG. */
+    getStats(): DAGStats;
+    /** Remove all tasks from the DAG. */
+    clear(): void;
+    /** Serialize the DAG for debugging. */
+    toJSON(): {
+        tasks: DAGTask[];
+        edges: Array<{
+            from: string;
+            to: string;
+        }>;
+        stats: DAGStats;
+    };
+    /**
+     * Register a handler to receive DAG events.
+     * @returns Unsubscribe function
+     */
+    onEvent(handler: DAGEventHandler): () => void;
+    private requireTask;
+    private computeStatus;
+    private setStatus;
+    private unblockDependents;
+    private cascadeCancellation;
+    private dfsCycles;
+    private emit;
+}
+//# sourceMappingURL=dag.d.ts.map

package/v3/dist/coordination/task-dag/dag.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"dag.d.ts","sourceRoot":"","sources":["../../../src/coordination/task-dag/dag.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH,OAAO,KAAK,EACV,OAAO,EAEP,YAAY,EACZ,QAAQ,EAER,eAAe,EAChB,MAAM,YAAY,CAAC;AAKpB;;;;;GAKG;AACH,qBAAa,OAAO;IAClB,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAmC;IACzD,OAAO,CAAC,QAAQ,CAAC,YAAY,CAAuC;IACpE,OAAO,CAAC,QAAQ,CAAC,YAAY,CAAuC;IACpE,OAAO,CAAC,QAAQ,CAAC,aAAa,CAAyB;IAEvD;;;;OAIG;IACH,OAAO,CAAC,KAAK,EAAE,YAAY,GAAG,OAAO;IAqDrC;;;OAGG;IACH,UAAU,CAAC,MAAM,EAAE,MAAM,GAAG,OAAO;IAmDnC,wBAAwB;IACxB,OAAO,CAAC,MAAM,EAAE,MAAM,GAAG,OAAO,GAAG,SAAS;IAI5C,yCAAyC;IACzC,QAAQ,IAAI,OAAO,EAAE;IAQrB;;;OAGG;IACH,KAAK,CAAC,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,GAAG,IAAI;IAa5C;;;;OAIG;IACH,QAAQ,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE,OAAO,GAAG,MAAM,EAAE;IAgBpD;;;OAGG;IACH,IAAI,CAAC,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,IAAI;IAWzC;;;OAGG;IACH,eAAe,IAAI,OAAO,EAAE;IA2C5B;;;OAGG;IACH,YAAY,IAAI,MAAM,EAAE,EAAE,GAAG,IAAI;IAiBjC;;;OAGG;IACH,eAAe,IAAI,OAAO,EAAE;IAyC5B,8CAA8C;IAC9C,QAAQ,IAAI,QAAQ;IAsBpB,qCAAqC;IACrC,KAAK,IAAI,IAAI;IAMb,uCAAuC;IACvC,MAAM,IAAI;QAAE,KAAK,EAAE,OAAO,EAAE,CAAC;QAAC,KAAK,EAAE,KAAK,CAAC;YAAE,IAAI,EAAE,MAAM,CAAC;YAAC,EAAE,EAAE,MAAM,CAAA;SAAE,CAAC,CAAC;QAAC,KAAK,EAAE,QAAQ,CAAA;KAAE;IAS3F;;;OAGG;IACH,OAAO,CAAC,OAAO,EAAE,eAAe,GAAG,MAAM,IAAI;IAU7C,OAAO,CAAC,WAAW;IAMnB,OAAO,CAAC,aAAa;IASrB,OAAO,CAAC,SAAS;IASjB,OAAO,CAAC,iBAAiB;IAwBzB,OAAO,CAAC,mBAAmB;IAgC3B,OAAO,CAAC,SAAS;IA+BjB,OAAO,CAAC,IAAI;CAKb"}

package/v3/dist/coordination/task-dag/dag.js

@@ -0,0 +1,496 @@
+/**
+ * Agentic QE v3 - Task Dependency DAG
+ * ADR-064 Phase 1E: Core DAG data structure for task dependency tracking
+ *
+ * Directed acyclic graph where nodes are tasks and edges represent
+ * "blocked-by" dependencies. Topological sort via Kahn's algorithm,
+ * cycle detection via DFS coloring, critical path via longest-path DP.
+ */
+/** DFS node coloring for cycle detection */
+var NodeColor;
+(function (NodeColor) {
+    NodeColor[NodeColor["White"] = 0] = "White";
+    NodeColor[NodeColor["Gray"] = 1] = "Gray";
+    NodeColor[NodeColor["Black"] = 2] = "Black";
+})(NodeColor || (NodeColor = {}));
+/**
+ * Directed acyclic graph for task dependency management.
+ *
+ * Tasks are nodes with forward edges (blockedBy) and reverse edges (blocks).
+ * Acyclicity is enforced through detection, allowing batch insertions.
+ */
+export class TaskDAG {
+    nodes = new Map();
+    forwardEdges = new Map();
+    reverseEdges = new Map();
+    eventHandlers = [];
+    /**
+     * Add a task to the DAG. Status is 'ready' if no incomplete blockers,
+     * otherwise 'blocked'. Reverse edges are computed automatically.
+     * @throws Error if a task with the same ID already exists
+     */
+    addTask(input) {
+        if (this.nodes.has(input.id)) {
+            throw new Error(`Task '${input.id}' already exists in the DAG`);
+        }
+        const blockedBy = input.blockedBy ?? [];
+        this.forwardEdges.set(input.id, new Set(blockedBy));
+        if (!this.reverseEdges.has(input.id)) {
+            this.reverseEdges.set(input.id, new Set());
+        }
+        for (const blockerId of blockedBy) {
+            if (!this.reverseEdges.has(blockerId)) {
+                this.reverseEdges.set(blockerId, new Set());
+            }
+            this.reverseEdges.get(blockerId).add(input.id);
+        }
+        // Blocks array: tasks already in graph that depend on this one
+        const blocks = [];
+        const existingDeps = this.reverseEdges.get(input.id);
+        if (existingDeps) {
+            for (const depId of existingDeps)
+                blocks.push(depId);
+        }
+        const status = this.computeStatus(blockedBy);
+        const task = {
+            id: input.id,
+            name: input.name,
+            domain: input.domain,
+            priority: input.priority ?? 'p2',
+            status,
+            blockedBy: [...blockedBy],
+            blocks: [...blocks],
+            metadata: input.metadata,
+            createdAt: Date.now(),
+        };
+        this.nodes.set(input.id, task);
+        // Update blocker tasks' blocks arrays
+        for (const blockerId of blockedBy) {
+            const blocker = this.nodes.get(blockerId);
+            if (blocker && !blocker.blocks.includes(input.id)) {
+                this.nodes.set(blockerId, { ...blocker, blocks: [...blocker.blocks, input.id] });
+            }
+        }
+        if (status === 'ready') {
+            this.emit({ type: 'task-ready', taskId: input.id, timestamp: Date.now() });
+        }
+        return task;
+    }
+    /**
+     * Remove a task, clean up edges, and unblock dependents if appropriate.
+     * @returns true if removed, false if not found
+     */
+    removeTask(taskId) {
+        if (!this.nodes.has(taskId))
+            return false;
+        // Detach from blockers
+        const forward = this.forwardEdges.get(taskId);
+        if (forward) {
+            for (const blockerId of forward) {
+                this.reverseEdges.get(blockerId)?.delete(taskId);
+                const blocker = this.nodes.get(blockerId);
+                if (blocker) {
+                    this.nodes.set(blockerId, {
+                        ...blocker,
+                        blocks: blocker.blocks.filter((id) => id !== taskId),
+                    });
+                }
+            }
+        }
+        // Detach from dependents and check for unblocking
+        const reverse = this.reverseEdges.get(taskId);
+        const unblockedIds = [];
+        if (reverse) {
+            for (const depId of reverse) {
+                this.forwardEdges.get(depId)?.delete(taskId);
+                const dep = this.nodes.get(depId);
+                if (dep) {
+                    this.nodes.set(depId, {
+                        ...dep,
+                        blockedBy: dep.blockedBy.filter((id) => id !== taskId),
+                    });
+                }
+                const updated = this.nodes.get(depId);
+                if (updated && (updated.status === 'blocked' || updated.status === 'pending')) {
+                    if (this.computeStatus(Array.from(this.forwardEdges.get(depId) ?? [])) === 'ready') {
+                        this.setStatus(depId, 'ready');
+                        unblockedIds.push(depId);
+                    }
+                }
+            }
+        }
+        this.forwardEdges.delete(taskId);
+        this.reverseEdges.delete(taskId);
+        this.nodes.delete(taskId);
+        if (unblockedIds.length > 0) {
+            this.emit({ type: 'tasks-unblocked', unblockedTaskIds: unblockedIds, timestamp: Date.now() });
+        }
+        return true;
+    }
+    /** Get a task by ID. */
+    getTask(taskId) {
+        return this.nodes.get(taskId);
+    }
+    /** Get all tasks with 'ready' status. */
+    getReady() {
+        const ready = [];
+        for (const task of this.nodes.values()) {
+            if (task.status === 'ready')
+                ready.push(task);
+        }
+        return ready;
+    }
+    /**
+     * Mark a task as in_progress.
+     * @throws Error if task not found or not in 'ready' status
+     */
+    start(taskId, agentId) {
+        const task = this.requireTask(taskId);
+        if (task.status !== 'ready') {
+            throw new Error(`Cannot start '${taskId}': status '${task.status}', expected 'ready'`);
+        }
+        this.nodes.set(taskId, {
+            ...task,
+            status: 'in_progress',
+            assignedTo: agentId,
+            startedAt: Date.now(),
+        });
+    }
+    /**
+     * Mark a task completed and unblock downstream tasks.
+     * @returns Array of newly unblocked task IDs
+     * @throws Error if task not found or not 'in_progress'
+     */
+    complete(taskId, result) {
+        const task = this.requireTask(taskId);
+        if (task.status !== 'in_progress') {
+            throw new Error(`Cannot complete '${taskId}': status '${task.status}', expected 'in_progress'`);
+        }
+        const now = Date.now();
+        this.nodes.set(taskId, { ...task, status: 'completed', completedAt: now, result });
+        this.emit({ type: 'task-completed', taskId, timestamp: now });
+        const unblockedIds = this.unblockDependents(taskId);
+        if (unblockedIds.length > 0) {
+            this.emit({ type: 'tasks-unblocked', unblockedTaskIds: unblockedIds, timestamp: Date.now() });
+        }
+        return unblockedIds;
+    }
+    /**
+     * Mark a task failed and cascade cancellation to dependents.
+     * @throws Error if task not found or not in 'in_progress'/'ready'
+     */
+    fail(taskId, error) {
+        const task = this.requireTask(taskId);
+        if (task.status !== 'in_progress' && task.status !== 'ready') {
+            throw new Error(`Cannot fail '${taskId}': status '${task.status}', expected 'in_progress' or 'ready'`);
+        }
+        const now = Date.now();
+        this.nodes.set(taskId, { ...task, status: 'failed', completedAt: now, error });
+        this.emit({ type: 'task-failed', taskId, timestamp: now });
+        this.cascadeCancellation(taskId);
+    }
+    /**
+     * Topological sort using Kahn's algorithm.
+     * @throws Error if cycles exist
+     */
+    topologicalSort() {
+        const inDegree = new Map();
+        for (const nodeId of this.nodes.keys()) {
+            let count = 0;
+            const fwd = this.forwardEdges.get(nodeId);
+            if (fwd) {
+                for (const dep of fwd) {
+                    if (this.nodes.has(dep))
+                        count++;
+                }
+            }
+            inDegree.set(nodeId, count);
+        }
+        const queue = [];
+        for (const [id, deg] of inDegree) {
+            if (deg === 0)
+                queue.push(id);
+        }
+        const sorted = [];
+        while (queue.length > 0) {
+            const nodeId = queue.shift();
+            const task = this.nodes.get(nodeId);
+            if (task)
+                sorted.push(task);
+            const dependents = this.reverseEdges.get(nodeId);
+            if (dependents) {
+                for (const depId of dependents) {
+                    if (!this.nodes.has(depId))
+                        continue;
+                    const newDeg = (inDegree.get(depId) ?? 0) - 1;
+                    inDegree.set(depId, newDeg);
+                    if (newDeg === 0)
+                        queue.push(depId);
+                }
+            }
+        }
+        if (sorted.length !== this.nodes.size) {
+            throw new Error(`Cycle detected: sorted ${sorted.length} of ${this.nodes.size} tasks`);
+        }
+        return sorted;
+    }
+    /**
+     * Detect cycles using DFS with white/gray/black coloring.
+     * @returns Array of cycles, or null if acyclic
+     */
+    detectCycles() {
+        const color = new Map();
+        const parent = new Map();
+        const cycles = [];
+        for (const id of this.nodes.keys())
+            color.set(id, NodeColor.White);
+        for (const id of this.nodes.keys()) {
+            if (color.get(id) === NodeColor.White) {
+                this.dfsCycles(id, color, parent, cycles);
+            }
+        }
+        if (cycles.length === 0)
+            return null;
+        this.emit({ type: 'cycle-detected', cycleNodes: cycles.flat(), timestamp: Date.now() });
+        return cycles;
+    }
+    /**
+     * Find the critical path (longest path through the DAG).
+     * @returns Tasks on the critical path in execution order
+     */
+    getCriticalPath() {
+        if (this.nodes.size === 0)
+            return [];
+        let sorted;
+        try {
+            sorted = this.topologicalSort();
+        }
+        catch {
+            return [];
+        }
+        const dist = new Map();
+        const pred = new Map();
+        for (const t of sorted) {
+            dist.set(t.id, 1);
+            pred.set(t.id, null);
+        }
+        for (const task of sorted) {
+            const d = dist.get(task.id);
+            const deps = this.reverseEdges.get(task.id);
+            if (deps) {
+                for (const depId of deps) {
+                    if (!this.nodes.has(depId))
+                        continue;
+                    if (d + 1 > (dist.get(depId) ?? 1)) {
+                        dist.set(depId, d + 1);
+                        pred.set(depId, task.id);
+                    }
+                }
+            }
+        }
+        let maxDist = 0;
+        let endNode = null;
+        for (const [id, d] of dist) {
+            if (d > maxDist) {
+                maxDist = d;
+                endNode = id;
+            }
+        }
+        if (!endNode)
+            return [];
+        const path = [];
+        let cur = endNode;
+        while (cur !== null) {
+            const t = this.nodes.get(cur);
+            if (t)
+                path.unshift(t);
+            cur = pred.get(cur) ?? null;
+        }
+        return path;
+    }
+    /** Get aggregate statistics about the DAG. */
+    getStats() {
+        let pending = 0, ready = 0, inProgress = 0, completed = 0;
+        let failed = 0, blocked = 0, cancelled = 0;
+        for (const task of this.nodes.values()) {
+            switch (task.status) {
+                case 'pending':
+                    pending++;
+                    break;
+                case 'ready':
+                    ready++;
+                    break;
+                case 'in_progress':
+                    inProgress++;
+                    break;
+                case 'completed':
+                    completed++;
+                    break;
+                case 'failed':
+                    failed++;
+                    break;
+                case 'blocked':
+                    blocked++;
+                    break;
+                case 'cancelled':
+                    cancelled++;
+                    break;
+            }
+        }
+        return {
+            totalTasks: this.nodes.size,
+            pending, ready, inProgress, completed, failed, blocked, cancelled,
+            longestPath: this.getCriticalPath().length,
+            hasCycles: this.detectCycles() !== null,
+        };
+    }
+    /** Remove all tasks from the DAG. */
+    clear() {
+        this.nodes.clear();
+        this.forwardEdges.clear();
+        this.reverseEdges.clear();
+    }
+    /** Serialize the DAG for debugging. */
+    toJSON() {
+        const tasks = Array.from(this.nodes.values());
+        const edges = [];
+        for (const [taskId, deps] of this.forwardEdges) {
+            for (const depId of deps)
+                edges.push({ from: depId, to: taskId });
+        }
+        return { tasks, edges, stats: this.getStats() };
+    }
+    /**
+     * Register a handler to receive DAG events.
+     * @returns Unsubscribe function
+     */
+    onEvent(handler) {
+        this.eventHandlers.push(handler);
+        return () => {
+            const idx = this.eventHandlers.indexOf(handler);
+            if (idx >= 0)
+                this.eventHandlers.splice(idx, 1);
+        };
+    }
+    // --- Internal helpers ---
+    requireTask(taskId) {
+        const task = this.nodes.get(taskId);
+        if (!task)
+            throw new Error(`Task '${taskId}' not found in the DAG`);
+        return task;
+    }
+    computeStatus(blockerIds) {
+        if (blockerIds.length === 0)
+            return 'ready';
+        for (const id of blockerIds) {
+            const b = this.nodes.get(id);
+            if (!b || b.status !== 'completed')
+                return 'blocked';
+        }
+        return 'ready';
+    }
+    setStatus(taskId, status) {
+        const task = this.nodes.get(taskId);
+        if (!task)
+            return;
+        this.nodes.set(taskId, { ...task, status });
+        if (status === 'ready') {
+            this.emit({ type: 'task-ready', taskId, timestamp: Date.now() });
+        }
+    }
+    unblockDependents(completedId) {
+        const unblockedIds = [];
+        const deps = this.reverseEdges.get(completedId);
+        if (!deps)
+            return unblockedIds;
+        for (const depId of deps) {
+            const dep = this.nodes.get(depId);
+            if (!dep || dep.status !== 'blocked')
+                continue;
+            const fwd = this.forwardEdges.get(depId);
+            if (!fwd)
+                continue;
+            let allDone = true;
+            for (const bId of fwd) {
+                const b = this.nodes.get(bId);
+                if (!b || b.status !== 'completed') {
+                    allDone = false;
+                    break;
+                }
+            }
+            if (allDone) {
+                this.setStatus(depId, 'ready');
+                unblockedIds.push(depId);
+            }
+        }
+        return unblockedIds;
+    }
+    cascadeCancellation(failedId) {
+        const deps = this.reverseEdges.get(failedId);
+        if (!deps)
+            return;
+        for (const depId of deps) {
+            const dep = this.nodes.get(depId);
+            if (!dep || dep.status === 'completed' || dep.status === 'failed' || dep.status === 'cancelled') {
+                continue;
+            }
+            const fwd = this.forwardEdges.get(depId);
+            if (!fwd)
+                continue;
+            let unsatisfiable = false;
+            for (const bId of fwd) {
+                const b = this.nodes.get(bId);
+                if (b && (b.status === 'failed' || b.status === 'cancelled')) {
+                    unsatisfiable = true;
+                    break;
+                }
+            }
+            if (unsatisfiable) {
+                this.nodes.set(depId, {
+                    ...dep,
+                    status: 'cancelled',
+                    completedAt: Date.now(),
+                    error: `Cancelled: upstream task '${failedId}' failed`,
+                });
+                this.cascadeCancellation(depId);
+            }
+        }
+    }
+    dfsCycles(nodeId, color, parent, cycles) {
+        color.set(nodeId, NodeColor.Gray);
+        const dependencies = this.forwardEdges.get(nodeId);
+        if (dependencies) {
+            for (const depId of dependencies) {
+                if (!this.nodes.has(depId))
+                    continue;
+                const c = color.get(depId);
+                if (c === NodeColor.White) {
+                    parent.set(depId, nodeId);
+                    this.dfsCycles(depId, color, parent, cycles);
+                }
+                else if (c === NodeColor.Gray) {
+                    const cycle = [depId, nodeId];
+                    let cur = nodeId;
+                    while (cur !== depId) {
+                        const p = parent.get(cur);
+                        if (p === null || p === undefined || p === depId)
+                            break;
+                        cycle.push(p);
+                        cur = p;
+                    }
+                    cycles.push(cycle);
+                }
+            }
+        }
+        color.set(nodeId, NodeColor.Black);
+    }
+    emit(event) {
+        for (const handler of this.eventHandlers) {
+            try {
+                handler(event);
+            }
+            catch { /* handler errors are silently ignored */ }
+        }
+    }
+}
+//# sourceMappingURL=dag.js.map

package/v3/dist/coordination/task-dag/dag.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dag.js","sourceRoot":"","sources":["../../../src/coordination/task-dag/dag.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAWH,4CAA4C;AAC5C,IAAW,SAA4C;AAAvD,WAAW,SAAS;IAAG,2CAAS,CAAA;IAAE,yCAAQ,CAAA;IAAE,2CAAS,CAAA;AAAC,CAAC,EAA5C,SAAS,KAAT,SAAS,QAAmC;AAEvD;;;;;GAKG;AACH,MAAM,OAAO,OAAO;IACD,KAAK,GAAyB,IAAI,GAAG,EAAE,CAAC;IACxC,YAAY,GAA6B,IAAI,GAAG,EAAE,CAAC;IACnD,YAAY,GAA6B,IAAI,GAAG,EAAE,CAAC;IACnD,aAAa,GAAsB,EAAE,CAAC;IAEvD;;;;OAIG;IACH,OAAO,CAAC,KAAmB;QACzB,IAAI,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE,CAAC;YAC7B,MAAM,IAAI,KAAK,CAAC,SAAS,KAAK,CAAC,EAAE,6BAA6B,CAAC,CAAC;QAClE,CAAC;QAED,MAAM,SAAS,GAAG,KAAK,CAAC,SAAS,IAAI,EAAE,CAAC;QACxC,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,EAAE,IAAI,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC;QACpD,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE,CAAC;YACrC,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;QAC7C,CAAC;QAED,KAAK,MAAM,SAAS,IAAI,SAAS,EAAE,CAAC;YAClC,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,CAAC;gBACtC,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,SAAS,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;YAC9C,CAAC;YACD,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,SAAS,CAAE,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;QAClD,CAAC;QAED,+DAA+D;QAC/D,MAAM,MAAM,GAAa,EAAE,CAAC;QAC5B,MAAM,YAAY,GAAG,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;QACrD,IAAI,YAAY,EAAE,CAAC;YACjB,KAAK,MAAM,KAAK,IAAI,YAAY;gBAAE,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACvD,CAAC;QAED,MAAM,MAAM,GAAG,IAAI,CAAC,aAAa,CAAC,SAAS,CAAC,CAAC;QAC7C,MAAM,IAAI,GAAY;YACpB,EAAE,EAAE,KAAK,CAAC,EAAE;YACZ,IAAI,EAAE,KAAK,CAAC,IAAI;YAChB,MAAM,EAAE,KAAK,CAAC,MAAM;YACpB,QAAQ,EAAE,KAAK,CAAC,QAAQ,IAAI,IAAI;YAChC,MAAM;YACN,SAAS,EAAE,CAAC,GAAG,SAAS,CAAC;YACzB,MAAM,EAAE,CAAC,GAAG,MAAM,CAAC;YACnB,QAAQ,EAAE,KAAK,CAAC,QAAQ;YACxB,SAAS,EAAE,IAAI,CAAC,GAAG,EAAE;SACtB,CAAC;QACF,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;QAE/B,sCAAsC;QACtC,KAAK,MAAM,SAAS,IAAI,SAAS,EAAE,CAAC;YAClC,MAAM,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;YAC1C,IAAI,OAAO,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE,CAAC;gBAClD,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,SAAS,EAAE,EAAE,GAAG,OAAO,EAAE,MAAM,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,KAAK,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;YACnF,CAAC;QACH,CAAC;QAED,IAAI,MAAM,KAAK,OAAO,EAAE,CAAC;YACvB,IAAI,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,YAAY,EAAE,MAAM,EAAE,KAAK,CAAC,EAAE,EAAE,SAAS,EAAE,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC;QAC7E,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;;OAGG;IACH,UAAU,CAAC,MAAc;QACvB,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC;YAAE,OAAO,KAAK,CAAC;QAE1C,uBAAuB;QACvB,MAAM,OAAO,GAAG,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QAC9C,IAAI,OAAO,EAAE,CAAC;YACZ,KAAK,MAAM,SAAS,IAAI,OAAO,EAAE,CAAC;gBAChC,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC;gBACjD,MAAM,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;gBAC1C,IAAI,OAAO,EAAE,CAAC;oBACZ,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,SAAS,EAAE;wBACxB,GAAG,OAAO;wBACV,MAAM,EAAE,OAAO,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,KAAK,MAAM,CAAC;qBACrD,CAAC,CAAC;gBACL,CAAC;YACH,CAAC;QACH,CAAC;QAED,kDAAkD;QAClD,MAAM,OAAO,GAAG,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QAC9C,MAAM,YAAY,GAAa,EAAE,CAAC;QAClC,IAAI,OAAO,EAAE,CAAC;YACZ,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;gBAC5B,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC;gBAC7C,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;gBAClC,IAAI,GAAG,EAAE,CAAC;oBACR,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,EAAE;wBACpB,GAAG,GAAG;wBACN,SAAS,EAAE,GAAG,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,KAAK,MAAM,CAAC;qBACvD,CAAC,CAAC;gBACL,CAAC;gBACD,MAAM,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;gBACtC,IAAI,OAAO,IAAI,CAAC,OAAO,CAAC,MAAM,KAAK,SAAS,IAAI,OAAO,CAAC,MAAM,KAAK,SAAS,CAAC,EAAE,CAAC;oBAC9E,IAAI,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,KAAK,OAAO,EAAE,CAAC;wBACnF,IAAI,CAAC,SAAS,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;wBAC/B,YAAY,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;oBAC3B,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QAED,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QACjC,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QACjC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QAE1B,IAAI,YAAY,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC5B,IAAI,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,iBAAiB,EAAE,gBAAgB,EAAE,YAAY,EAAE,SAAS,EAAE,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC;QAChG,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED,wBAAwB;IACxB,OAAO,CAAC,MAAc;QACpB,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;IAChC,CAAC;IAED,yCAAyC;IACzC,QAAQ;QACN,MAAM,KAAK,GAAc,EAAE,CAAC;QAC5B,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC;YACvC,IAAI,IAAI,CAAC,MAAM,KAAK,OAAO;gBAAE,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAChD,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;;OAGG;IACH,KAAK,CAAC,MAAc,EAAE,OAAe;QACnC,MAAM,IAAI,GAAG,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;QACtC,IAAI,IAAI,CAAC,MAAM,KAAK,OAAO,EAAE,CAAC;YAC5B,MAAM,IAAI,KAAK,CAAC,iBAAiB,MAAM,cAAc,IAAI,CAAC,MAAM,qBAAqB,CAAC,CAAC;QACzF,CAAC;QACD,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,EAAE;YACrB,GAAG,IAAI;YACP,MAAM,EAAE,aAA8B;YACtC,UAAU,EAAE,OAAO;YACnB,SAAS,EAAE,IAAI,CAAC,GAAG,EAAE;SACtB,CAAC,CAAC;IACL,CAAC;IAED;;;;OAIG;IACH,QAAQ,CAAC,MAAc,EAAE,MAAgB;QACvC,MAAM,IAAI,GAAG,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;QACtC,IAAI,IAAI,CAAC,MAAM,KAAK,aAAa,EAAE,CAAC;YAClC,MAAM,IAAI,KAAK,CAAC,oBAAoB,MAAM,cAAc,IAAI,CAAC,MAAM,2BAA2B,CAAC,CAAC;QAClG,CAAC;QACD,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QACvB,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,EAAE,EAAE,GAAG,IAAI,EAAE,MAAM,EAAE,WAA4B,EAAE,WAAW,EAAE,GAAG,EAAE,MAAM,EAAE,CAAC,CAAC;QACpG,IAAI,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,gBAAgB,EAAE,MAAM,EAAE,SAAS,EAAE,GAAG,EAAE,CAAC,CAAC;QAE9D,MAAM,YAAY,GAAG,IAAI,CAAC,iBAAiB,CAAC,MAAM,CAAC,CAAC;QACpD,IAAI,YAAY,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC5B,IAAI,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,iBAAiB,EAAE,gBAAgB,EAAE,YAAY,EAAE,SAAS,EAAE,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC;QAChG,CAAC;QACD,OAAO,YAAY,CAAC;IACtB,CAAC;IAED;;;OAGG;IACH,IAAI,CAAC,MAAc,EAAE,KAAa;QAChC,MAAM,IAAI,GAAG,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;QACtC,IAAI,IAAI,CAAC,MAAM,KAAK,aAAa,IAAI,IAAI,CAAC,MAAM,KAAK,OAAO,EAAE,CAAC;YAC7D,MAAM,IAAI,KAAK,CAAC,gBAAgB,MAAM,cAAc,IAAI,CAAC,MAAM,sCAAsC,CAAC,CAAC;QACzG,CAAC;QACD,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QACvB,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,EAAE,EAAE,GAAG,IAAI,EAAE,MAAM,EAAE,QAAyB,EAAE,WAAW,EAAE,GAAG,EAAE,KAAK,EAAE,CAAC,CAAC;QAChG,IAAI,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,aAAa,EAAE,MAAM,EAAE,SAAS,EAAE,GAAG,EAAE,CAAC,CAAC;QAC3D,IAAI,CAAC,mBAAmB,CAAC,MAAM,CAAC,CAAC;IACnC,CAAC;IAED;;;OAGG;IACH,eAAe;QACb,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAC;QAC3C,KAAK,MAAM,MAAM,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,EAAE,CAAC;YACvC,IAAI,KAAK,GAAG,CAAC,CAAC;YACd,MAAM,GAAG,GAAG,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YAC1C,IAAI,GAAG,EAAE,CAAC;gBACR,KAAK,MAAM,GAAG,IAAI,GAAG,EAAE,CAAC;oBACtB,IAAI,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC;wBAAE,KAAK,EAAE,CAAC;gBACnC,CAAC;YACH,CAAC;YACD,QAAQ,CAAC,GAAG,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;QAC9B,CAAC;QAED,MAAM,KAAK,GAAa,EAAE,CAAC;QAC3B,KAAK,MAAM,CAAC,EAAE,EAAE,GAAG,CAAC,IAAI,QAAQ,EAAE,CAAC;YACjC,IAAI,GAAG,KAAK,CAAC;gBAAE,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAChC,CAAC;QAED,MAAM,MAAM,GAAc,EAAE,CAAC;QAC7B,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,MAAM,MAAM,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;YAC9B,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YACpC,IAAI,IAAI;gBAAE,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAE5B,MAAM,UAAU,GAAG,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YACjD,IAAI,UAAU,EAAE,CAAC;gBACf,KAAK,MAAM,KAAK,IAAI,UAAU,EAAE,CAAC;oBAC/B,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC;wBAAE,SAAS;oBACrC,MAAM,MAAM,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;oBAC9C,QAAQ,CAAC,GAAG,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;oBAC5B,IAAI,MAAM,KAAK,CAAC;wBAAE,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;gBACtC,CAAC;YACH,CAAC;QACH,CAAC;QAED,IAAI,MAAM,CAAC,MAAM,KAAK,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC;YACtC,MAAM,IAAI,KAAK,CACb,0BAA0B,MAAM,CAAC,MAAM,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,QAAQ,CACtE,CAAC;QACJ,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;;OAGG;IACH,YAAY;QACV,MAAM,KAAK,GAAG,IAAI,GAAG,EAAqB,CAAC;QAC3C,MAAM,MAAM,GAAG,IAAI,GAAG,EAAyB,CAAC;QAChD,MAAM,MAAM,GAAe,EAAE,CAAC;QAE9B,KAAK,MAAM,EAAE,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE;YAAE,KAAK,CAAC,GAAG,CAAC,EAAE,EAAE,SAAS,CAAC,KAAK,CAAC,CAAC;QACnE,KAAK,MAAM,EAAE,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,EAAE,CAAC;YACnC,IAAI,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,KAAK,SAAS,CAAC,KAAK,EAAE,CAAC;gBACtC,IAAI,CAAC,SAAS,CAAC,EAAE,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC;YAC5C,CAAC;QACH,CAAC;QAED,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,IAAI,CAAC;QACrC,IAAI,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,gBAAgB,EAAE,UAAU,EAAE,MAAM,CAAC,IAAI,EAAE,EAAE,SAAS,EAAE,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC;QACxF,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;;OAGG;IACH,eAAe;QACb,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC;YAAE,OAAO,EAAE,CAAC;QAErC,IAAI,MAAiB,CAAC;QACtB,IAAI,CAAC;YAAC,MAAM,GAAG,IAAI,CAAC,eAAe,EAAE,CAAC;QAAC,CAAC;QAAC,MAAM,CAAC;YAAC,OAAO,EAAE,CAAC;QAAC,CAAC;QAE7D,MAAM,IAAI,GAAG,IAAI,GAAG,EAAkB,CAAC;QACvC,MAAM,IAAI,GAAG,IAAI,GAAG,EAAyB,CAAC;QAC9C,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;YAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;YAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;QAAC,CAAC;QAEpE,KAAK,MAAM,IAAI,IAAI,MAAM,EAAE,CAAC;YAC1B,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAE,CAAC;YAC7B,MAAM,IAAI,GAAG,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YAC5C,IAAI,IAAI,EAAE,CAAC;gBACT,KAAK,MAAM,KAAK,IAAI,IAAI,EAAE,CAAC;oBACzB,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC;wBAAE,SAAS;oBACrC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC;wBACnC,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;wBACvB,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,CAAC,EAAE,CAAC,CAAC;oBAC3B,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QAED,IAAI,OAAO,GAAG,CAAC,CAAC;QAChB,IAAI,OAAO,GAAkB,IAAI,CAAC;QAClC,KAAK,MAAM,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,IAAI,EAAE,CAAC;YAC3B,IAAI,CAAC,GAAG,OAAO,EAAE,CAAC;gBAAC,OAAO,GAAG,CAAC,CAAC;gBAAC,OAAO,GAAG,EAAE,CAAC;YAAC,CAAC;QACjD,CAAC;QACD,IAAI,CAAC,OAAO;YAAE,OAAO,EAAE,CAAC;QAExB,MAAM,IAAI,GAAc,EAAE,CAAC;QAC3B,IAAI,GAAG,GAAkB,OAAO,CAAC;QACjC,OAAO,GAAG,KAAK,IAAI,EAAE,CAAC;YACpB,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YAC9B,IAAI,CAAC;gBAAE,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;YACvB,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,IAAI,CAAC;QAC9B,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED,8CAA8C;IAC9C,QAAQ;QACN,IAAI,OAAO,GAAG,CAAC,EAAE,KAAK,GAAG,CAAC,EAAE,UAAU,GAAG,CAAC,EAAE,SAAS,GAAG,CAAC,CAAC;QAC1D,IAAI,MAAM,GAAG,CAAC,EAAE,OAAO,GAAG,CAAC,EAAE,SAAS,GAAG,CAAC,CAAC;QAC3C,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC;YACvC,QAAQ,IAAI,CAAC,MAAM,EAAE,CAAC;gBACpB,KAAK,SAAS;oBAAM,OAAO,EAAE,CAAC;oBAAI,MAAM;gBACxC,KAAK,OAAO;oBAAQ,KAAK,EAAE,CAAC;oBAAM,MAAM;gBACxC,KAAK,aAAa;oBAAE,UAAU,EAAE,CAAC;oBAAC,MAAM;gBACxC,KAAK,WAAW;oBAAI,SAAS,EAAE,CAAC;oBAAE,MAAM;gBACxC,KAAK,QAAQ;oBAAO,MAAM,EAAE,CAAC;oBAAK,MAAM;gBACxC,KAAK,SAAS;oBAAM,OAAO,EAAE,CAAC;oBAAI,MAAM;gBACxC,KAAK,WAAW;oBAAI,SAAS,EAAE,CAAC;oBAAE,MAAM;YAC1C,CAAC;QACH,CAAC;QACD,OAAO;YACL,UAAU,EAAE,IAAI,CAAC,KAAK,CAAC,IAAI;YAC3B,OAAO,EAAE,KAAK,EAAE,UAAU,EAAE,SAAS,EAAE,MAAM,EAAE,OAAO,EAAE,SAAS;YACjE,WAAW,EAAE,IAAI,CAAC,eAAe,EAAE,CAAC,MAAM;YAC1C,SAAS,EAAE,IAAI,CAAC,YAAY,EAAE,KAAK,IAAI;SACxC,CAAC;IACJ,CAAC;IAED,qCAAqC;IACrC,KAAK;QACH,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;QACnB,IAAI,CAAC,YAAY,CAAC,KAAK,EAAE,CAAC;QAC1B,IAAI,CAAC,YAAY,CAAC,KAAK,EAAE,CAAC;IAC5B,CAAC;IAED,uCAAuC;IACvC,MAAM;QACJ,MAAM,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC;QAC9C,MAAM,KAAK,GAAwC,EAAE,CAAC;QACtD,KAAK,MAAM,CAAC,MAAM,EAAE,IAAI,CAAC,IAAI,IAAI,CAAC,YAAY,EAAE,CAAC;YAC/C,KAAK,MAAM,KAAK,IAAI,IAAI;gBAAE,KAAK,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,EAAE,EAAE,MAAM,EAAE,CAAC,CAAC;QACpE,CAAC;QACD,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,CAAC,QAAQ,EAAE,EAAE,CAAC;IAClD,CAAC;IAED;;;OAGG;IACH,OAAO,CAAC,OAAwB;QAC9B,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QACjC,OAAO,GAAG,EAAE;YACV,MAAM,GAAG,GAAG,IAAI,CAAC,aAAa,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;YAChD,IAAI,GAAG,IAAI,CAAC;gBAAE,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;QAClD,CAAC,CAAC;IACJ,CAAC;IAED,2BAA2B;IAEnB,WAAW,CAAC,MAAc;QAChC,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACpC,IAAI,CAAC,IAAI;YAAE,MAAM,IAAI,KAAK,CAAC,SAAS,MAAM,wBAAwB,CAAC,CAAC;QACpE,OAAO,IAAI,CAAC;IACd,CAAC;IAEO,aAAa,CAAC,UAAoB;QACxC,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,OAAO,CAAC;QAC5C,KAAK,MAAM,EAAE,IAAI,UAAU,EAAE,CAAC;YAC5B,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YAC7B,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,MAAM,KAAK,WAAW;gBAAE,OAAO,SAAS,CAAC;QACvD,CAAC;QACD,OAAO,OAAO,CAAC;IACjB,CAAC;IAEO,SAAS,CAAC,MAAc,EAAE,MAAqB;QACrD,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACpC,IAAI,CAAC,IAAI;YAAE,OAAO;QAClB,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,EAAE,EAAE,GAAG,IAAI,EAAE,MAAM,EAAE,CAAC,CAAC;QAC5C,IAAI,MAAM,KAAK,OAAO,EAAE,CAAC;YACvB,IAAI,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,YAAY,EAAE,MAAM,EAAE,SAAS,EAAE,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC;QACnE,CAAC;IACH,CAAC;IAEO,iBAAiB,CAAC,WAAmB;QAC3C,MAAM,YAAY,GAAa,EAAE,CAAC;QAClC,MAAM,IAAI,GAAG,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;QAChD,IAAI,CAAC,IAAI;YAAE,OAAO,YAAY,CAAC;QAE/B,KAAK,MAAM,KAAK,IAAI,IAAI,EAAE,CAAC;YACzB,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;YAClC,IAAI,CAAC,GAAG,IAAI,GAAG,CAAC,MAAM,KAAK,SAAS;gBAAE,SAAS;YAC/C,MAAM,GAAG,GAAG,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;YACzC,IAAI,CAAC,GAAG;gBAAE,SAAS;YAEnB,IAAI,OAAO,GAAG,IAAI,CAAC;YACnB,KAAK,MAAM,GAAG,IAAI,GAAG,EAAE,CAAC;gBACtB,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;gBAC9B,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,MAAM,KAAK,WAAW,EAAE,CAAC;oBAAC,OAAO,GAAG,KAAK,CAAC;oBAAC,MAAM;gBAAC,CAAC;YACjE,CAAC;YACD,IAAI,OAAO,EAAE,CAAC;gBACZ,IAAI,CAAC,SAAS,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;gBAC/B,YAAY,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAC3B,CAAC;QACH,CAAC;QACD,OAAO,YAAY,CAAC;IACtB,CAAC;IAEO,mBAAmB,CAAC,QAAgB;QAC1C,MAAM,IAAI,GAAG,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QAC7C,IAAI,CAAC,IAAI;YAAE,OAAO;QAElB,KAAK,MAAM,KAAK,IAAI,IAAI,EAAE,CAAC;YACzB,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;YAClC,IAAI,CAAC,GAAG,IAAI,GAAG,CAAC,MAAM,KAAK,WAAW,IAAI,GAAG,CAAC,MAAM,KAAK,QAAQ,IAAI,GAAG,CAAC,MAAM,KAAK,WAAW,EAAE,CAAC;gBAChG,SAAS;YACX,CAAC;YACD,MAAM,GAAG,GAAG,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;YACzC,IAAI,CAAC,GAAG;gBAAE,SAAS;YAEnB,IAAI,aAAa,GAAG,KAAK,CAAC;YAC1B,KAAK,MAAM,GAAG,IAAI,GAAG,EAAE,CAAC;gBACtB,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;gBAC9B,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,KAAK,QAAQ,IAAI,CAAC,CAAC,MAAM,KAAK,WAAW,CAAC,EAAE,CAAC;oBAC7D,aAAa,GAAG,IAAI,CAAC;oBACrB,MAAM;gBACR,CAAC;YACH,CAAC;YACD,IAAI,aAAa,EAAE,CAAC;gBAClB,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,EAAE;oBACpB,GAAG,GAAG;oBACN,MAAM,EAAE,WAAW;oBACnB,WAAW,EAAE,IAAI,CAAC,GAAG,EAAE;oBACvB,KAAK,EAAE,6BAA6B,QAAQ,UAAU;iBACvD,CAAC,CAAC;gBACH,IAAI,CAAC,mBAAmB,CAAC,KAAK,CAAC,CAAC;YAClC,CAAC;QACH,CAAC;IACH,CAAC;IAEO,SAAS,CACf,MAAc,EACd,KAA6B,EAC7B,MAAkC,EAClC,MAAkB;QAElB,KAAK,CAAC,GAAG,CAAC,MAAM,EAAE,SAAS,CAAC,IAAI,CAAC,CAAC;QAClC,MAAM,YAAY,GAAG,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACnD,IAAI,YAAY,EAAE,CAAC;YACjB,KAAK,MAAM,KAAK,IAAI,YAAY,EAAE,CAAC;gBACjC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC;oBAAE,SAAS;gBACrC,MAAM,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;gBAC3B,IAAI,CAAC,KAAK,SAAS,CAAC,KAAK,EAAE,CAAC;oBAC1B,MAAM,CAAC,GAAG,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;oBAC1B,IAAI,CAAC,SAAS,CAAC,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC;gBAC/C,CAAC;qBAAM,IAAI,CAAC,KAAK,SAAS,CAAC,IAAI,EAAE,CAAC;oBAChC,MAAM,KAAK,GAAa,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;oBACxC,IAAI,GAAG,GAAG,MAAM,CAAC;oBACjB,OAAO,GAAG,KAAK,KAAK,EAAE,CAAC;wBACrB,MAAM,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;wBAC1B,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,KAAK,SAAS,IAAI,CAAC,KAAK,KAAK;4BAAE,MAAM;wBACxD,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;wBACd,GAAG,GAAG,CAAC,CAAC;oBACV,CAAC;oBACD,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;gBACrB,CAAC;YACH,CAAC;QACH,CAAC;QACD,KAAK,CAAC,GAAG,CAAC,MAAM,EAAE,SAAS,CAAC,KAAK,CAAC,CAAC;IACrC,CAAC;IAEO,IAAI,CAAC,KAAe;QAC1B,KAAK,MAAM,OAAO,IAAI,IAAI,CAAC,aAAa,EAAE,CAAC;YACzC,IAAI,CAAC;gBAAC,OAAO,CAAC,KAAK,CAAC,CAAC;YAAC,CAAC;YAAC,MAAM,CAAC,CAAC,yCAAyC,CAAC,CAAC;QAC7E,CAAC;IACH,CAAC;CACF"}

package/v3/dist/coordination/task-dag/index.d.ts

@@ -0,0 +1,54 @@
+/**
+ * Agentic QE v3 - Task Dependency DAG
+ * ADR-064 Phase 1E: DAG-based task scheduler with dependency tracking
+ *
+ * Provides a directed acyclic graph for managing task dependencies,
+ * with topological sorting, cycle detection, critical path analysis,
+ * and priority-aware scheduling.
+ *
+ * @example
+ * ```typescript
+ * import { createTaskDAG, createDAGScheduler } from './coordination/task-dag';
+ *
+ * const dag = createTaskDAG();
+ * const scheduler = createDAGScheduler(dag, { maxConcurrent: 4 });
+ *
+ * // Build a dependency graph
+ * dag.addTask({ id: 'lint', name: 'Lint', domain: 'ci', priority: 'p2' });
+ * dag.addTask({ id: 'build', name: 'Build', domain: 'ci', priority: 'p1' });
+ * dag.addTask({ id: 'test', name: 'Test', domain: 'ci', priority: 'p0', blockedBy: ['build'] });
+ * dag.addTask({ id: 'deploy', name: 'Deploy', domain: 'ci', priority: 'p0', blockedBy: ['test', 'lint'] });
+ *
+ * // Schedule ready tasks
+ * const batch = scheduler.schedule(); // [build, lint] (ready, sorted by priority)
+ *
+ * // Execute and process completions
+ * dag.start('build', 'agent-1');
+ * dag.start('lint', 'agent-2');
+ * const unblocked = scheduler.onTaskComplete('build'); // test may now be ready
+ *
+ * // Check progress
+ * const progress = scheduler.getProgress(); // { completed: 1, total: 4, percentage: 25 }
+ * ```
+ */
+export type { DAGTaskStatus, DAGTask, AddTaskInput, DAGStats, DAGEventType, DAGEvent, DAGSchedulerConfig, DAGEventHandler, } from './types.js';
+export { TaskDAG } from './dag.js';
+export { DAGScheduler } from './scheduler.js';
+import { TaskDAG } from './dag.js';
+import { DAGScheduler } from './scheduler.js';
+import type { DAGSchedulerConfig } from './types.js';
+/**
+ * Create a new empty TaskDAG instance.
+ *
+ * @returns A fresh TaskDAG with no tasks
+ */
+export declare function createTaskDAG(): TaskDAG;
+/**
+ * Create a new DAGScheduler wrapping a TaskDAG.
+ *
+ * @param dag - The TaskDAG to schedule from
+ * @param config - Optional scheduler configuration
+ * @returns A configured DAGScheduler instance
+ */
+export declare function createDAGScheduler(dag: TaskDAG, config?: Partial<DAGSchedulerConfig>): DAGScheduler;
+//# sourceMappingURL=index.d.ts.map

package/v3/dist/coordination/task-dag/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/coordination/task-dag/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAgCG;AAMH,YAAY,EACV,aAAa,EACb,OAAO,EACP,YAAY,EACZ,QAAQ,EACR,YAAY,EACZ,QAAQ,EACR,kBAAkB,EAClB,eAAe,GAChB,MAAM,YAAY,CAAC;AAMpB,OAAO,EAAE,OAAO,EAAE,MAAM,UAAU,CAAC;AACnC,OAAO,EAAE,YAAY,EAAE,MAAM,gBAAgB,CAAC;AAM9C,OAAO,EAAE,OAAO,EAAE,MAAM,UAAU,CAAC;AACnC,OAAO,EAAE,YAAY,EAAE,MAAM,gBAAgB,CAAC;AAC9C,OAAO,KAAK,EAAE,kBAAkB,EAAE,MAAM,YAAY,CAAC;AAErD;;;;GAIG;AACH,wBAAgB,aAAa,IAAI,OAAO,CAEvC;AAED;;;;;;GAMG;AACH,wBAAgB,kBAAkB,CAChC,GAAG,EAAE,OAAO,EACZ,MAAM,CAAC,EAAE,OAAO,CAAC,kBAAkB,CAAC,GACnC,YAAY,CAEd"}