@ginkoai/cli 1.6.2 → 1.7.1

package/dist/lib/stale-agent-detector.js

@@ -0,0 +1,156 @@
+/**
+ * @fileType: utility
+ * @status: current
+ * @updated: 2025-12-07
+ * @tags: [agent, stale-detection, epic-004, multi-agent, resilience]
+ * @related: [agent-heartbeat.ts, ../commands/graph/api-client.ts]
+ * @priority: high
+ * @complexity: medium
+ * @dependencies: []
+ */
+/**
+ * Default configuration
+ */
+const DEFAULT_CONFIG = {
+    gracePeriodMinutes: 5,
+    graphId: process.env.GINKO_GRAPH_ID || '',
+};
+/**
+ * Detect stale agents
+ *
+ * Identifies agents that haven't sent a heartbeat within the grace period
+ * and are not already marked as offline.
+ *
+ * @param config - Optional configuration overrides
+ * @returns Array of stale agents with their claimed tasks
+ */
+export async function detectStaleAgents(config) {
+    const finalConfig = { ...DEFAULT_CONFIG, ...config };
+    if (!finalConfig.graphId) {
+        throw new Error('Graph ID not configured. Set GINKO_GRAPH_ID environment variable.');
+    }
+    try {
+        // Import graph API client lazily
+        const { GraphApiClient } = await import('../commands/graph/api-client.js');
+        const client = new GraphApiClient();
+        // Call stale detection API
+        const response = await client.request('GET', `/api/v1/agent/stale?graphId=${finalConfig.graphId}&gracePeriod=${finalConfig.gracePeriodMinutes}`);
+        // Convert to StaleAgent objects
+        return response.staleAgents.map((agent) => ({
+            agentId: agent.agentId,
+            lastHeartbeat: new Date(agent.lastHeartbeat),
+            staleSince: new Date(agent.staleSince),
+            claimedTasks: agent.claimedTasks,
+        }));
+    }
+    catch (error) {
+        const errorMessage = error instanceof Error ? error.message : String(error);
+        console.warn('[StaleAgentDetector] Failed to detect stale agents:', errorMessage);
+        throw error;
+    }
+}
+/**
+ * Release tasks claimed by a stale agent
+ *
+ * Marks agent as offline and releases all tasks it has claimed,
+ * making them available for other agents to claim.
+ *
+ * @param agentId - Agent ID to release tasks for
+ * @param config - Optional configuration overrides
+ * @returns Array of released tasks
+ */
+export async function releaseStaleAgentTasks(agentId, config) {
+    const finalConfig = { ...DEFAULT_CONFIG, ...config };
+    if (!finalConfig.graphId) {
+        throw new Error('Graph ID not configured. Set GINKO_GRAPH_ID environment variable.');
+    }
+    try {
+        // Import graph API client lazily
+        const { GraphApiClient } = await import('../commands/graph/api-client.js');
+        const client = new GraphApiClient();
+        // Call release API
+        const response = await client.request('POST', `/api/v1/agent/stale/release?graphId=${finalConfig.graphId}`, { agentId });
+        if (!response.success) {
+            throw new Error(`Failed to release tasks for agent ${agentId}`);
+        }
+        // Convert to ReleasedTask objects
+        return response.releasedTasks.map((task) => ({
+            taskId: task.taskId,
+            previousAgent: task.previousAgent,
+            releasedAt: new Date(task.releasedAt),
+        }));
+    }
+    catch (error) {
+        const errorMessage = error instanceof Error ? error.message : String(error);
+        console.warn('[StaleAgentDetector] Failed to release stale agent tasks:', errorMessage);
+        throw error;
+    }
+}
+/**
+ * Get last heartbeat timestamp for an agent
+ *
+ * @param agentId - Agent ID to check
+ * @param config - Optional configuration overrides
+ * @returns Last heartbeat timestamp or null if not found
+ */
+export async function getAgentLastHeartbeat(agentId, config) {
+    const finalConfig = { ...DEFAULT_CONFIG, ...config };
+    if (!finalConfig.graphId) {
+        throw new Error('Graph ID not configured. Set GINKO_GRAPH_ID environment variable.');
+    }
+    try {
+        // Import graph API client lazily
+        const { GraphApiClient } = await import('../commands/graph/api-client.js');
+        const client = new GraphApiClient();
+        // Call agent details API
+        const response = await client.request('GET', `/api/v1/agent/${agentId}?graphId=${finalConfig.graphId}`);
+        if (!response.agent.lastHeartbeat) {
+            return null;
+        }
+        return new Date(response.agent.lastHeartbeat);
+    }
+    catch (error) {
+        const errorMessage = error instanceof Error ? error.message : String(error);
+        console.warn('[StaleAgentDetector] Failed to get agent heartbeat:', errorMessage);
+        // If agent not found, return null instead of throwing
+        if (errorMessage.includes('not found') || errorMessage.includes('404')) {
+            return null;
+        }
+        throw error;
+    }
+}
+/**
+ * Detect and release all stale agents
+ *
+ * Convenience method that detects stale agents and releases their tasks.
+ * Typically used in periodic cleanup jobs.
+ *
+ * @param config - Optional configuration overrides
+ * @returns Summary of stale agents and released tasks
+ */
+export async function detectAndReleaseStaleAgents(config) {
+    console.log('[StaleAgentDetector] Starting stale agent detection...');
+    const staleAgents = await detectStaleAgents(config);
+    if (staleAgents.length === 0) {
+        console.log('[StaleAgentDetector] No stale agents detected');
+        return { staleAgents: [], releasedTasks: [] };
+    }
+    console.log(`[StaleAgentDetector] Found ${staleAgents.length} stale agent(s)`);
+    const allReleasedTasks = [];
+    for (const agent of staleAgents) {
+        console.log(`[StaleAgentDetector] Releasing tasks for stale agent ${agent.agentId}...`);
+        try {
+            const releasedTasks = await releaseStaleAgentTasks(agent.agentId, config);
+            allReleasedTasks.push(...releasedTasks);
+            console.log(`[StaleAgentDetector] Released ${releasedTasks.length} task(s) from ${agent.agentId}`);
+        }
+        catch (error) {
+            const errorMessage = error instanceof Error ? error.message : String(error);
+            console.error(`[StaleAgentDetector] Failed to release tasks for ${agent.agentId}:`, errorMessage);
+            // Continue with other agents even if one fails
+        }
+    }
+    console.log(`[StaleAgentDetector] Complete: ${staleAgents.length} stale agent(s), ${allReleasedTasks.length} task(s) released`);
+    return { staleAgents, releasedTasks: allReleasedTasks };
+}
+//# sourceMappingURL=stale-agent-detector.js.map

package/dist/lib/stale-agent-detector.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"stale-agent-detector.js","sourceRoot":"","sources":["../../src/lib/stale-agent-detector.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAuDH;;GAEG;AACH,MAAM,cAAc,GAAmC;IACrD,kBAAkB,EAAE,CAAC;IACrB,OAAO,EAAE,OAAO,CAAC,GAAG,CAAC,cAAc,IAAI,EAAE;CAC1C,CAAC;AAEF;;;;;;;;GAQG;AACH,MAAM,CAAC,KAAK,UAAU,iBAAiB,CACrC,MAA6B;IAE7B,MAAM,WAAW,GAAG,EAAE,GAAG,cAAc,EAAE,GAAG,MAAM,EAAE,CAAC;IAErD,IAAI,CAAC,WAAW,CAAC,OAAO,EAAE,CAAC;QACzB,MAAM,IAAI,KAAK,CAAC,mEAAmE,CAAC,CAAC;IACvF,CAAC;IAED,IAAI,CAAC;QACH,iCAAiC;QACjC,MAAM,EAAE,cAAc,EAAE,GAAG,MAAM,MAAM,CAAC,iCAAiC,CAAC,CAAC;QAC3E,MAAM,MAAM,GAAG,IAAI,cAAc,EAAE,CAAC;QAEpC,2BAA2B;QAC3B,MAAM,QAAQ,GAAG,MAAM,MAAM,CAAC,OAAO,CASnC,KAAK,EACL,+BAA+B,WAAW,CAAC,OAAO,gBAAgB,WAAW,CAAC,kBAAkB,EAAE,CACnG,CAAC;QAEF,gCAAgC;QAChC,OAAO,QAAQ,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;YAC1C,OAAO,EAAE,KAAK,CAAC,OAAO;YACtB,aAAa,EAAE,IAAI,IAAI,CAAC,KAAK,CAAC,aAAa,CAAC;YAC5C,UAAU,EAAE,IAAI,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC;YACtC,YAAY,EAAE,KAAK,CAAC,YAAY;SACjC,CAAC,CAAC,CAAC;IACN,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,MAAM,YAAY,GAAG,KAAK,YAAY,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QAC5E,OAAO,CAAC,IAAI,CAAC,qDAAqD,EAAE,YAAY,CAAC,CAAC;QAClF,MAAM,KAAK,CAAC;IACd,CAAC;AACH,CAAC;AAED;;;;;;;;;GASG;AACH,MAAM,CAAC,KAAK,UAAU,sBAAsB,CAC1C,OAAe,EACf,MAA6B;IAE7B,MAAM,WAAW,GAAG,EAAE,GAAG,cAAc,EAAE,GAAG,MAAM,EAAE,CAAC;IAErD,IAAI,CAAC,WAAW,CAAC,OAAO,EAAE,CAAC;QACzB,MAAM,IAAI,KAAK,CAAC,mEAAmE,CAAC,CAAC;IACvF,CAAC;IAED,IAAI,CAAC;QACH,iCAAiC;QACjC,MAAM,EAAE,cAAc,EAAE,GAAG,MAAM,MAAM,CAAC,iCAAiC,CAAC,CAAC;QAC3E,MAAM,MAAM,GAAG,IAAI,cAAc,EAAE,CAAC;QAEpC,mBAAmB;QACnB,MAAM,QAAQ,GAAG,MAAM,MAAM,CAAC,OAAO,CASnC,MAAM,EACN,uCAAuC,WAAW,CAAC,OAAO,EAAE,EAC5D,EAAE,OAAO,EAAE,CACZ,CAAC;QAEF,IAAI,CAAC,QAAQ,CAAC,OAAO,EAAE,CAAC;YACtB,MAAM,IAAI,KAAK,CAAC,qCAAqC,OAAO,EAAE,CAAC,CAAC;QAClE,CAAC;QAED,kCAAkC;QAClC,OAAO,QAAQ,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;YAC3C,MAAM,EAAE,IAAI,CAAC,MAAM;YACnB,aAAa,EAAE,IAAI,CAAC,aAAa;YACjC,UAAU,EAAE,IAAI,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC;SACtC,CAAC,CAAC,CAAC;IACN,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,MAAM,YAAY,GAAG,KAAK,YAAY,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QAC5E,OAAO,CAAC,IAAI,CAAC,2DAA2D,EAAE,YAAY,CAAC,CAAC;QACxF,MAAM,KAAK,CAAC;IACd,CAAC;AACH,CAAC;AAED;;;;;;GAMG;AACH,MAAM,CAAC,KAAK,UAAU,qBAAqB,CACzC,OAAe,EACf,MAA6B;IAE7B,MAAM,WAAW,GAAG,EAAE,GAAG,cAAc,EAAE,GAAG,MAAM,EAAE,CAAC;IAErD,IAAI,CAAC,WAAW,CAAC,OAAO,EAAE,CAAC;QACzB,MAAM,IAAI,KAAK,CAAC,mEAAmE,CAAC,CAAC;IACvF,CAAC;IAED,IAAI,CAAC;QACH,iCAAiC;QACjC,MAAM,EAAE,cAAc,EAAE,GAAG,MAAM,MAAM,CAAC,iCAAiC,CAAC,CAAC;QAC3E,MAAM,MAAM,GAAG,IAAI,cAAc,EAAE,CAAC;QAEpC,yBAAyB;QACzB,MAAM,QAAQ,GAAG,MAAM,MAAM,CAAC,OAAO,CAOnC,KAAK,EACL,iBAAiB,OAAO,YAAY,WAAW,CAAC,OAAO,EAAE,CAC1D,CAAC;QAEF,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,aAAa,EAAE,CAAC;YAClC,OAAO,IAAI,CAAC;QACd,CAAC;QAED,OAAO,IAAI,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC;IAChD,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,MAAM,YAAY,GAAG,KAAK,YAAY,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QAC5E,OAAO,CAAC,IAAI,CAAC,qDAAqD,EAAE,YAAY,CAAC,CAAC;QAElF,sDAAsD;QACtD,IAAI,YAAY,CAAC,QAAQ,CAAC,WAAW,CAAC,IAAI,YAAY,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC;YACvE,OAAO,IAAI,CAAC;QACd,CAAC;QAED,MAAM,KAAK,CAAC;IACd,CAAC;AACH,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,CAAC,KAAK,UAAU,2BAA2B,CAC/C,MAA6B;IAK7B,OAAO,CAAC,GAAG,CAAC,wDAAwD,CAAC,CAAC;IAEtE,MAAM,WAAW,GAAG,MAAM,iBAAiB,CAAC,MAAM,CAAC,CAAC;IAEpD,IAAI,WAAW,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC7B,OAAO,CAAC,GAAG,CAAC,+CAA+C,CAAC,CAAC;QAC7D,OAAO,EAAE,WAAW,EAAE,EAAE,EAAE,aAAa,EAAE,EAAE,EAAE,CAAC;IAChD,CAAC;IAED,OAAO,CAAC,GAAG,CAAC,8BAA8B,WAAW,CAAC,MAAM,iBAAiB,CAAC,CAAC;IAE/E,MAAM,gBAAgB,GAAmB,EAAE,CAAC;IAE5C,KAAK,MAAM,KAAK,IAAI,WAAW,EAAE,CAAC;QAChC,OAAO,CAAC,GAAG,CAAC,wDAAwD,KAAK,CAAC,OAAO,KAAK,CAAC,CAAC;QAExF,IAAI,CAAC;YACH,MAAM,aAAa,GAAG,MAAM,sBAAsB,CAAC,KAAK,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC;YAC1E,gBAAgB,CAAC,IAAI,CAAC,GAAG,aAAa,CAAC,CAAC;YAExC,OAAO,CAAC,GAAG,CAAC,iCAAiC,aAAa,CAAC,MAAM,iBAAiB,KAAK,CAAC,OAAO,EAAE,CAAC,CAAC;QACrG,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,MAAM,YAAY,GAAG,KAAK,YAAY,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;YAC5E,OAAO,CAAC,KAAK,CAAC,oDAAoD,KAAK,CAAC,OAAO,GAAG,EAAE,YAAY,CAAC,CAAC;YAClG,+CAA+C;QACjD,CAAC;IACH,CAAC;IAED,OAAO,CAAC,GAAG,CAAC,kCAAkC,WAAW,CAAC,MAAM,oBAAoB,gBAAgB,CAAC,MAAM,mBAAmB,CAAC,CAAC;IAEhI,OAAO,EAAE,WAAW,EAAE,aAAa,EAAE,gBAAgB,EAAE,CAAC;AAC1D,CAAC"}

package/dist/lib/task-dependencies.d.ts

@@ -0,0 +1,143 @@
+/**
+ * @fileType: utility
+ * @status: current
+ * @updated: 2025-12-07
+ * @tags: [task, dependencies, topological-sort, orchestration, epic-004, sprint-4]
+ * @related: [sprint-loader.ts, ../commands/orchestrate.ts, ../commands/sprint/deps.ts]
+ * @priority: high
+ * @complexity: medium
+ * @dependencies: []
+ */
+/**
+ * Task Dependencies (EPIC-004 Sprint 4 TASK-6)
+ *
+ * Provides topological ordering and dependency management for tasks:
+ * - Compute execution order in waves (parallel execution within waves)
+ * - Detect circular dependencies
+ * - Find available tasks (dependencies satisfied)
+ * - Validate dependency graph
+ */
+/**
+ * Task with dependency information
+ */
+export interface Task {
+    id: string;
+    dependsOn: string[];
+    status?: 'pending' | 'in_progress' | 'complete' | 'blocked';
+    title?: string;
+    effort?: string;
+    priority?: number;
+}
+/**
+ * Group of tasks that can execute in parallel
+ */
+export interface ExecutionWave {
+    wave: number;
+    tasks: Task[];
+}
+/**
+ * Dependency validation error
+ */
+export interface DependencyError {
+    type: 'missing' | 'self_reference' | 'circular';
+    taskId: string;
+    details: string;
+}
+/**
+ * Dependency graph statistics
+ */
+export interface DependencyStats {
+    totalTasks: number;
+    tasksWithDeps: number;
+    tasksWithoutDeps: number;
+    maxDepth: number;
+    avgDepsPerTask: number;
+}
+/**
+ * Detect circular dependencies using three-color DFS
+ *
+ * Colors:
+ * - white (0): Not visited
+ * - gray (1): Currently in recursion stack (visiting)
+ * - black (2): Fully processed
+ *
+ * A back edge to a gray node indicates a cycle.
+ *
+ * @param tasks - Array of tasks with dependencies
+ * @returns Array of cycles found, e.g., [['TASK-1', 'TASK-2', 'TASK-1']]
+ */
+export declare function detectCircularDependencies(tasks: Task[]): string[][];
+/**
+ * Validate dependencies for common errors
+ *
+ * Checks for:
+ * - Self-referential dependencies (TASK-1 depends on TASK-1)
+ * - Missing dependencies (depends on non-existent task)
+ *
+ * @param tasks - Array of tasks with dependencies
+ * @returns Array of validation errors
+ */
+export declare function validateDependencies(tasks: Task[]): DependencyError[];
+/**
+ * Compute execution order using modified Kahn's algorithm
+ *
+ * Groups tasks into waves where:
+ * - Wave 1: Tasks with no dependencies
+ * - Wave N: Tasks that depend only on tasks in waves 1..N-1
+ *
+ * Tasks within a wave can execute in parallel.
+ *
+ * @param tasks - Array of tasks with dependencies
+ * @returns Array of execution waves
+ * @throws Error if circular dependencies detected
+ */
+export declare function getExecutionOrder(tasks: Task[]): ExecutionWave[];
+/**
+ * Get tasks that are ready to execute
+ *
+ * A task is available if:
+ * - Status is 'pending' or undefined
+ * - All dependencies have status 'complete'
+ *
+ * @param tasks - Array of tasks with dependencies and status
+ * @returns Tasks ready for execution
+ */
+export declare function getAvailableTasks(tasks: Task[]): Task[];
+/**
+ * Get tasks that are blocked (have incomplete dependencies)
+ *
+ * @param tasks - Array of tasks with dependencies and status
+ * @returns Tasks that cannot start due to incomplete dependencies
+ */
+export declare function getBlockedTasks(tasks: Task[]): Task[];
+/**
+ * Compute dependency graph statistics
+ *
+ * @param tasks - Array of tasks with dependencies
+ * @returns Statistics about the dependency graph
+ */
+export declare function getDependencyStats(tasks: Task[]): DependencyStats;
+/**
+ * Build reverse dependency map (who depends on this task)
+ *
+ * @param tasks - Array of tasks with dependencies
+ * @returns Map from task ID to array of dependent task IDs
+ */
+export declare function buildReverseDependencyMap(tasks: Task[]): Map<string, string[]>;
+/**
+ * Get all downstream tasks (tasks that transitively depend on this task)
+ *
+ * @param taskId - Starting task ID
+ * @param tasks - Array of tasks with dependencies
+ * @returns Array of downstream task IDs
+ */
+export declare function getDownstreamTasks(taskId: string, tasks: Task[]): string[];
+/**
+ * Get all upstream tasks (tasks that this task transitively depends on)
+ *
+ * @param taskId - Starting task ID
+ * @param tasks - Array of tasks with dependencies
+ * @returns Array of upstream task IDs
+ */
+export declare function getUpstreamTasks(taskId: string, tasks: Task[]): string[];
+//# sourceMappingURL=task-dependencies.d.ts.map

package/dist/lib/task-dependencies.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"task-dependencies.d.ts","sourceRoot":"","sources":["../../src/lib/task-dependencies.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAEH;;;;;;;;GAQG;AAEH;;GAEG;AACH,MAAM,WAAW,IAAI;IACnB,EAAE,EAAE,MAAM,CAAC;IACX,SAAS,EAAE,MAAM,EAAE,CAAC;IACpB,MAAM,CAAC,EAAE,SAAS,GAAG,aAAa,GAAG,UAAU,GAAG,SAAS,CAAC;IAC5D,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB,QAAQ,CAAC,EAAE,MAAM,CAAC;CACnB;AAED;;GAEG;AACH,MAAM,WAAW,aAAa;IAC5B,IAAI,EAAE,MAAM,CAAC;IACb,KAAK,EAAE,IAAI,EAAE,CAAC;CACf;AAED;;GAEG;AACH,MAAM,WAAW,eAAe;IAC9B,IAAI,EAAE,SAAS,GAAG,gBAAgB,GAAG,UAAU,CAAC;IAChD,MAAM,EAAE,MAAM,CAAC;IACf,OAAO,EAAE,MAAM,CAAC;CACjB;AAED;;GAEG;AACH,MAAM,WAAW,eAAe;IAC9B,UAAU,EAAE,MAAM,CAAC;IACnB,aAAa,EAAE,MAAM,CAAC;IACtB,gBAAgB,EAAE,MAAM,CAAC;IACzB,QAAQ,EAAE,MAAM,CAAC;IACjB,cAAc,EAAE,MAAM,CAAC;CACxB;AAED;;;;;;;;;;;;GAYG;AACH,wBAAgB,0BAA0B,CAAC,KAAK,EAAE,IAAI,EAAE,GAAG,MAAM,EAAE,EAAE,CAiDpE;AAED;;;;;;;;;GASG;AACH,wBAAgB,oBAAoB,CAAC,KAAK,EAAE,IAAI,EAAE,GAAG,eAAe,EAAE,CAsCrE;AAED;;;;;;;;;;;;GAYG;AACH,wBAAgB,iBAAiB,CAAC,KAAK,EAAE,IAAI,EAAE,GAAG,aAAa,EAAE,CA2EhE;AAED;;;;;;;;;GASG;AACH,wBAAgB,iBAAiB,CAAC,KAAK,EAAE,IAAI,EAAE,GAAG,IAAI,EAAE,CAuBvD;AAED;;;;;GAKG;AACH,wBAAgB,eAAe,CAAC,KAAK,EAAE,IAAI,EAAE,GAAG,IAAI,EAAE,CAsBrD;AAED;;;;;GAKG;AACH,wBAAgB,kBAAkB,CAAC,KAAK,EAAE,IAAI,EAAE,GAAG,eAAe,CA+BjE;AAED;;;;;GAKG;AACH,wBAAgB,yBAAyB,CAAC,KAAK,EAAE,IAAI,EAAE,GAAG,GAAG,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,CAmB9E;AAED;;;;;;GAMG;AACH,wBAAgB,kBAAkB,CAAC,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,IAAI,EAAE,GAAG,MAAM,EAAE,CAkB1E;AAED;;;;;;GAMG;AACH,wBAAgB,gBAAgB,CAAC,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,IAAI,EAAE,GAAG,MAAM,EAAE,CAwBxE"}

package/dist/lib/task-dependencies.js

@@ -0,0 +1,357 @@
+/**
+ * @fileType: utility
+ * @status: current
+ * @updated: 2025-12-07
+ * @tags: [task, dependencies, topological-sort, orchestration, epic-004, sprint-4]
+ * @related: [sprint-loader.ts, ../commands/orchestrate.ts, ../commands/sprint/deps.ts]
+ * @priority: high
+ * @complexity: medium
+ * @dependencies: []
+ */
+/**
+ * Detect circular dependencies using three-color DFS
+ *
+ * Colors:
+ * - white (0): Not visited
+ * - gray (1): Currently in recursion stack (visiting)
+ * - black (2): Fully processed
+ *
+ * A back edge to a gray node indicates a cycle.
+ *
+ * @param tasks - Array of tasks with dependencies
+ * @returns Array of cycles found, e.g., [['TASK-1', 'TASK-2', 'TASK-1']]
+ */
+export function detectCircularDependencies(tasks) {
+    const cycles = [];
+    const taskMap = new Map();
+    const color = new Map(); // 0=white, 1=gray, 2=black
+    // Build task map
+    for (const task of tasks) {
+        taskMap.set(task.id, task);
+        color.set(task.id, 0); // white
+    }
+    function dfs(taskId, path) {
+        const task = taskMap.get(taskId);
+        if (!task)
+            return false;
+        color.set(taskId, 1); // gray - visiting
+        path.push(taskId);
+        for (const depId of task.dependsOn) {
+            const depColor = color.get(depId);
+            if (depColor === 1) {
+                // Back edge found - cycle detected
+                const cycleStart = path.indexOf(depId);
+                const cycle = [...path.slice(cycleStart), depId];
+                cycles.push(cycle);
+                return true;
+            }
+            if (depColor === 0) {
+                // White node - recurse
+                dfs(depId, path);
+            }
+            // Black nodes are fully processed, skip
+        }
+        path.pop();
+        color.set(taskId, 2); // black - done
+        return false;
+    }
+    // Run DFS from each unvisited node
+    for (const task of tasks) {
+        if (color.get(task.id) === 0) {
+            dfs(task.id, []);
+        }
+    }
+    return cycles;
+}
+/**
+ * Validate dependencies for common errors
+ *
+ * Checks for:
+ * - Self-referential dependencies (TASK-1 depends on TASK-1)
+ * - Missing dependencies (depends on non-existent task)
+ *
+ * @param tasks - Array of tasks with dependencies
+ * @returns Array of validation errors
+ */
+export function validateDependencies(tasks) {
+    const errors = [];
+    const taskIds = new Set(tasks.map(t => t.id));
+    for (const task of tasks) {
+        for (const depId of task.dependsOn) {
+            // Self-reference check
+            if (depId === task.id) {
+                errors.push({
+                    type: 'self_reference',
+                    taskId: task.id,
+                    details: `Task ${task.id} depends on itself`,
+                });
+                continue;
+            }
+            // Missing dependency check
+            if (!taskIds.has(depId)) {
+                errors.push({
+                    type: 'missing',
+                    taskId: task.id,
+                    details: `Task ${task.id} depends on non-existent task ${depId}`,
+                });
+            }
+        }
+    }
+    // Also check for circular dependencies
+    const cycles = detectCircularDependencies(tasks);
+    for (const cycle of cycles) {
+        errors.push({
+            type: 'circular',
+            taskId: cycle[0],
+            details: `Circular dependency: ${cycle.join(' → ')}`,
+        });
+    }
+    return errors;
+}
+/**
+ * Compute execution order using modified Kahn's algorithm
+ *
+ * Groups tasks into waves where:
+ * - Wave 1: Tasks with no dependencies
+ * - Wave N: Tasks that depend only on tasks in waves 1..N-1
+ *
+ * Tasks within a wave can execute in parallel.
+ *
+ * @param tasks - Array of tasks with dependencies
+ * @returns Array of execution waves
+ * @throws Error if circular dependencies detected
+ */
+export function getExecutionOrder(tasks) {
+    if (tasks.length === 0) {
+        return [];
+    }
+    // Validate first
+    const errors = validateDependencies(tasks);
+    const circularErrors = errors.filter(e => e.type === 'circular');
+    if (circularErrors.length > 0) {
+        throw new Error(`Cannot compute execution order: ${circularErrors[0].details}`);
+    }
+    const taskMap = new Map();
+    const inDegree = new Map();
+    const dependents = new Map(); // task -> tasks that depend on it
+    // Initialize
+    for (const task of tasks) {
+        taskMap.set(task.id, task);
+        inDegree.set(task.id, 0);
+        dependents.set(task.id, []);
+    }
+    // Build in-degree and dependents
+    for (const task of tasks) {
+        let validDeps = 0;
+        for (const depId of task.dependsOn) {
+            if (taskMap.has(depId)) {
+                validDeps++;
+                dependents.get(depId).push(task.id);
+            }
+            // Skip missing dependencies (already warned in validation)
+        }
+        inDegree.set(task.id, validDeps);
+    }
+    const waves = [];
+    const processed = new Set();
+    // Process waves until all tasks are assigned
+    while (processed.size < tasks.length) {
+        // Find all tasks with in-degree 0 that haven't been processed
+        const waveTasks = [];
+        for (const task of tasks) {
+            if (!processed.has(task.id) && inDegree.get(task.id) === 0) {
+                waveTasks.push(task);
+            }
+        }
+        if (waveTasks.length === 0) {
+            // This shouldn't happen if validation passed, but safety check
+            const remaining = tasks.filter(t => !processed.has(t.id));
+            throw new Error(`Cannot assign remaining tasks to waves: ${remaining.map(t => t.id).join(', ')}`);
+        }
+        // Add wave
+        waves.push({
+            wave: waves.length + 1,
+            tasks: waveTasks,
+        });
+        // Mark as processed and update in-degrees
+        for (const task of waveTasks) {
+            processed.add(task.id);
+            // Decrement in-degree of all dependents
+            for (const depId of dependents.get(task.id)) {
+                const currentDegree = inDegree.get(depId);
+                inDegree.set(depId, currentDegree - 1);
+            }
+        }
+    }
+    return waves;
+}
+/**
+ * Get tasks that are ready to execute
+ *
+ * A task is available if:
+ * - Status is 'pending' or undefined
+ * - All dependencies have status 'complete'
+ *
+ * @param tasks - Array of tasks with dependencies and status
+ * @returns Tasks ready for execution
+ */
+export function getAvailableTasks(tasks) {
+    const taskMap = new Map();
+    for (const task of tasks) {
+        taskMap.set(task.id, task);
+    }
+    return tasks.filter(task => {
+        // Must be pending (not started, not complete, not blocked)
+        const status = task.status || 'pending';
+        if (status !== 'pending') {
+            return false;
+        }
+        // All dependencies must be complete
+        for (const depId of task.dependsOn) {
+            const dep = taskMap.get(depId);
+            if (!dep || dep.status !== 'complete') {
+                return false;
+            }
+        }
+        return true;
+    });
+}
+/**
+ * Get tasks that are blocked (have incomplete dependencies)
+ *
+ * @param tasks - Array of tasks with dependencies and status
+ * @returns Tasks that cannot start due to incomplete dependencies
+ */
+export function getBlockedTasks(tasks) {
+    const taskMap = new Map();
+    for (const task of tasks) {
+        taskMap.set(task.id, task);
+    }
+    return tasks.filter(task => {
+        const status = task.status || 'pending';
+        if (status !== 'pending') {
+            return false;
+        }
+        // Check if any dependency is incomplete
+        for (const depId of task.dependsOn) {
+            const dep = taskMap.get(depId);
+            if (!dep || dep.status !== 'complete') {
+                return true; // Blocked
+            }
+        }
+        return false; // All deps complete, not blocked
+    });
+}
+/**
+ * Compute dependency graph statistics
+ *
+ * @param tasks - Array of tasks with dependencies
+ * @returns Statistics about the dependency graph
+ */
+export function getDependencyStats(tasks) {
+    if (tasks.length === 0) {
+        return {
+            totalTasks: 0,
+            tasksWithDeps: 0,
+            tasksWithoutDeps: 0,
+            maxDepth: 0,
+            avgDepsPerTask: 0,
+        };
+    }
+    const tasksWithDeps = tasks.filter(t => t.dependsOn.length > 0).length;
+    const totalDeps = tasks.reduce((sum, t) => sum + t.dependsOn.length, 0);
+    // Compute max depth (longest path in DAG)
+    let maxDepth = 0;
+    try {
+        const waves = getExecutionOrder(tasks);
+        maxDepth = waves.length;
+    }
+    catch {
+        // Circular dependency - can't compute depth
+        maxDepth = -1;
+    }
+    return {
+        totalTasks: tasks.length,
+        tasksWithDeps,
+        tasksWithoutDeps: tasks.length - tasksWithDeps,
+        maxDepth,
+        avgDepsPerTask: totalDeps / tasks.length,
+    };
+}
+/**
+ * Build reverse dependency map (who depends on this task)
+ *
+ * @param tasks - Array of tasks with dependencies
+ * @returns Map from task ID to array of dependent task IDs
+ */
+export function buildReverseDependencyMap(tasks) {
+    const reverseMap = new Map();
+    // Initialize all tasks
+    for (const task of tasks) {
+        reverseMap.set(task.id, []);
+    }
+    // Build reverse relationships
+    for (const task of tasks) {
+        for (const depId of task.dependsOn) {
+            const dependents = reverseMap.get(depId);
+            if (dependents) {
+                dependents.push(task.id);
+            }
+        }
+    }
+    return reverseMap;
+}
+/**
+ * Get all downstream tasks (tasks that transitively depend on this task)
+ *
+ * @param taskId - Starting task ID
+ * @param tasks - Array of tasks with dependencies
+ * @returns Array of downstream task IDs
+ */
+export function getDownstreamTasks(taskId, tasks) {
+    const reverseMap = buildReverseDependencyMap(tasks);
+    const visited = new Set();
+    const result = [];
+    function dfs(id) {
+        const dependents = reverseMap.get(id) || [];
+        for (const depId of dependents) {
+            if (!visited.has(depId)) {
+                visited.add(depId);
+                result.push(depId);
+                dfs(depId);
+            }
+        }
+    }
+    dfs(taskId);
+    return result;
+}
+/**
+ * Get all upstream tasks (tasks that this task transitively depends on)
+ *
+ * @param taskId - Starting task ID
+ * @param tasks - Array of tasks with dependencies
+ * @returns Array of upstream task IDs
+ */
+export function getUpstreamTasks(taskId, tasks) {
+    const taskMap = new Map();
+    for (const task of tasks) {
+        taskMap.set(task.id, task);
+    }
+    const visited = new Set();
+    const result = [];
+    function dfs(id) {
+        const task = taskMap.get(id);
+        if (!task)
+            return;
+        for (const depId of task.dependsOn) {
+            if (!visited.has(depId)) {
+                visited.add(depId);
+                result.push(depId);
+                dfs(depId);
+            }
+        }
+    }
+    dfs(taskId);
+    return result;
+}
+//# sourceMappingURL=task-dependencies.js.map

package/dist/lib/task-dependencies.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"task-dependencies.js","sourceRoot":"","sources":["../../src/lib/task-dependencies.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAoDH;;;;;;;;;;;;GAYG;AACH,MAAM,UAAU,0BAA0B,CAAC,KAAa;IACtD,MAAM,MAAM,GAAe,EAAE,CAAC;IAC9B,MAAM,OAAO,GAAG,IAAI,GAAG,EAAgB,CAAC;IACxC,MAAM,KAAK,GAAG,IAAI,GAAG,EAAkB,CAAC,CAAC,2BAA2B;IAEpE,iBAAiB;IACjB,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;QAC3B,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,QAAQ;IACjC,CAAC;IAED,SAAS,GAAG,CAAC,MAAc,EAAE,IAAc;QACzC,MAAM,IAAI,GAAG,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACjC,IAAI,CAAC,IAAI;YAAE,OAAO,KAAK,CAAC;QAExB,KAAK,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC,kBAAkB;QACxC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAElB,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;YACnC,MAAM,QAAQ,GAAG,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;YAElC,IAAI,QAAQ,KAAK,CAAC,EAAE,CAAC;gBACnB,mCAAmC;gBACnC,MAAM,UAAU,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;gBACvC,MAAM,KAAK,GAAG,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,EAAE,KAAK,CAAC,CAAC;gBACjD,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;gBACnB,OAAO,IAAI,CAAC;YACd,CAAC;YAED,IAAI,QAAQ,KAAK,CAAC,EAAE,CAAC;gBACnB,uBAAuB;gBACvB,GAAG,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;YACnB,CAAC;YACD,wCAAwC;QAC1C,CAAC;QAED,IAAI,CAAC,GAAG,EAAE,CAAC;QACX,KAAK,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC,eAAe;QACrC,OAAO,KAAK,CAAC;IACf,CAAC;IAED,mCAAmC;IACnC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,IAAI,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,EAAE,CAAC;YAC7B,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QACnB,CAAC;IACH,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;;;;;;;;GASG;AACH,MAAM,UAAU,oBAAoB,CAAC,KAAa;IAChD,MAAM,MAAM,GAAsB,EAAE,CAAC;IACrC,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAE9C,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;YACnC,uBAAuB;YACvB,IAAI,KAAK,KAAK,IAAI,CAAC,EAAE,EAAE,CAAC;gBACtB,MAAM,CAAC,IAAI,CAAC;oBACV,IAAI,EAAE,gBAAgB;oBACtB,MAAM,EAAE,IAAI,CAAC,EAAE;oBACf,OAAO,EAAE,QAAQ,IAAI,CAAC,EAAE,oBAAoB;iBAC7C,CAAC,CAAC;gBACH,SAAS;YACX,CAAC;YAED,2BAA2B;YAC3B,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;gBACxB,MAAM,CAAC,IAAI,CAAC;oBACV,IAAI,EAAE,SAAS;oBACf,MAAM,EAAE,IAAI,CAAC,EAAE;oBACf,OAAO,EAAE,QAAQ,IAAI,CAAC,EAAE,iCAAiC,KAAK,EAAE;iBACjE,CAAC,CAAC;YACL,CAAC;QACH,CAAC;IACH,CAAC;IAED,uCAAuC;IACvC,MAAM,MAAM,GAAG,0BAA0B,CAAC,KAAK,CAAC,CAAC;IACjD,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;QAC3B,MAAM,CAAC,IAAI,CAAC;YACV,IAAI,EAAE,UAAU;YAChB,MAAM,EAAE,KAAK,CAAC,CAAC,CAAC;YAChB,OAAO,EAAE,wBAAwB,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE;SACrD,CAAC,CAAC;IACL,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;;;;;;;;;;;GAYG;AACH,MAAM,UAAU,iBAAiB,CAAC,KAAa;IAC7C,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACvB,OAAO,EAAE,CAAC;IACZ,CAAC;IAED,iBAAiB;IACjB,MAAM,MAAM,GAAG,oBAAoB,CAAC,KAAK,CAAC,CAAC;IAC3C,MAAM,cAAc,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,UAAU,CAAC,CAAC;IACjE,IAAI,cAAc,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC9B,MAAM,IAAI,KAAK,CAAC,mCAAmC,cAAc,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC;IAClF,CAAC;IAED,MAAM,OAAO,GAAG,IAAI,GAAG,EAAgB,CAAC;IACxC,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC3C,MAAM,UAAU,GAAG,IAAI,GAAG,EAAoB,CAAC,CAAC,kCAAkC;IAElF,aAAa;IACb,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;QAC3B,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;QACzB,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;IAC9B,CAAC;IAED,iCAAiC;IACjC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,IAAI,SAAS,GAAG,CAAC,CAAC;QAClB,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;YACnC,IAAI,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;gBACvB,SAAS,EAAE,CAAC;gBACZ,UAAU,CAAC,GAAG,CAAC,KAAK,CAAE,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACvC,CAAC;YACD,2DAA2D;QAC7D,CAAC;QACD,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,SAAS,CAAC,CAAC;IACnC,CAAC;IAED,MAAM,KAAK,GAAoB,EAAE,CAAC;IAClC,MAAM,SAAS,GAAG,IAAI,GAAG,EAAU,CAAC;IAEpC,6CAA6C;IAC7C,OAAO,SAAS,CAAC,IAAI,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC;QACrC,8DAA8D;QAC9D,MAAM,SAAS,GAAW,EAAE,CAAC;QAE7B,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,EAAE,CAAC;gBAC3D,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACvB,CAAC;QACH,CAAC;QAED,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC3B,+DAA+D;YAC/D,MAAM,SAAS,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAC1D,MAAM,IAAI,KAAK,CAAC,2CAA2C,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACpG,CAAC;QAED,WAAW;QACX,KAAK,CAAC,IAAI,CAAC;YACT,IAAI,EAAE,KAAK,CAAC,MAAM,GAAG,CAAC;YACtB,KAAK,EAAE,SAAS;SACjB,CAAC,CAAC;QAEH,0CAA0C;QAC1C,KAAK,MAAM,IAAI,IAAI,SAAS,EAAE,CAAC;YAC7B,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YAEvB,wCAAwC;YACxC,KAAK,MAAM,KAAK,IAAI,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAE,EAAE,CAAC;gBAC7C,MAAM,aAAa,GAAG,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAE,CAAC;gBAC3C,QAAQ,CAAC,GAAG,CAAC,KAAK,EAAE,aAAa,GAAG,CAAC,CAAC,CAAC;YACzC,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;;;;;;;GASG;AACH,MAAM,UAAU,iBAAiB,CAAC,KAAa;IAC7C,MAAM,OAAO,GAAG,IAAI,GAAG,EAAgB,CAAC;IACxC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;IAC7B,CAAC;IAED,OAAO,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE;QACzB,2DAA2D;QAC3D,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,IAAI,SAAS,CAAC;QACxC,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;YACzB,OAAO,KAAK,CAAC;QACf,CAAC;QAED,oCAAoC;QACpC,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;YACnC,MAAM,GAAG,GAAG,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;YAC/B,IAAI,CAAC,GAAG,IAAI,GAAG,CAAC,MAAM,KAAK,UAAU,EAAE,CAAC;gBACtC,OAAO,KAAK,CAAC;YACf,CAAC;QACH,CAAC;QAED,OAAO,IAAI,CAAC;IACd,CAAC,CAAC,CAAC;AACL,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,eAAe,CAAC,KAAa;IAC3C,MAAM,OAAO,GAAG,IAAI,GAAG,EAAgB,CAAC;IACxC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;IAC7B,CAAC;IAED,OAAO,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE;QACzB,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,IAAI,SAAS,CAAC;QACxC,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;YACzB,OAAO,KAAK,CAAC;QACf,CAAC;QAED,wCAAwC;QACxC,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;YACnC,MAAM,GAAG,GAAG,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;YAC/B,IAAI,CAAC,GAAG,IAAI,GAAG,CAAC,MAAM,KAAK,UAAU,EAAE,CAAC;gBACtC,OAAO,IAAI,CAAC,CAAC,UAAU;YACzB,CAAC;QACH,CAAC;QAED,OAAO,KAAK,CAAC,CAAC,iCAAiC;IACjD,CAAC,CAAC,CAAC;AACL,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,kBAAkB,CAAC,KAAa;IAC9C,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACvB,OAAO;YACL,UAAU,EAAE,CAAC;YACb,aAAa,EAAE,CAAC;YAChB,gBAAgB,EAAE,CAAC;YACnB,QAAQ,EAAE,CAAC;YACX,cAAc,EAAE,CAAC;SAClB,CAAC;IACJ,CAAC;IAED,MAAM,aAAa,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC;IACvE,MAAM,SAAS,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,SAAS,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;IAExE,0CAA0C;IAC1C,IAAI,QAAQ,GAAG,CAAC,CAAC;IACjB,IAAI,CAAC;QACH,MAAM,KAAK,GAAG,iBAAiB,CAAC,KAAK,CAAC,CAAC;QACvC,QAAQ,GAAG,KAAK,CAAC,MAAM,CAAC;IAC1B,CAAC;IAAC,MAAM,CAAC;QACP,4CAA4C;QAC5C,QAAQ,GAAG,CAAC,CAAC,CAAC;IAChB,CAAC;IAED,OAAO;QACL,UAAU,EAAE,KAAK,CAAC,MAAM;QACxB,aAAa;QACb,gBAAgB,EAAE,KAAK,CAAC,MAAM,GAAG,aAAa;QAC9C,QAAQ;QACR,cAAc,EAAE,SAAS,GAAG,KAAK,CAAC,MAAM;KACzC,CAAC;AACJ,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,yBAAyB,CAAC,KAAa;IACrD,MAAM,UAAU,GAAG,IAAI,GAAG,EAAoB,CAAC;IAE/C,uBAAuB;IACvB,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;IAC9B,CAAC;IAED,8BAA8B;IAC9B,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;YACnC,MAAM,UAAU,GAAG,UAAU,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;YACzC,IAAI,UAAU,EAAE,CAAC;gBACf,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YAC3B,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,UAAU,CAAC;AACpB,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,kBAAkB,CAAC,MAAc,EAAE,KAAa;IAC9D,MAAM,UAAU,GAAG,yBAAyB,CAAC,KAAK,CAAC,CAAC;IACpD,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAClC,MAAM,MAAM,GAAa,EAAE,CAAC;IAE5B,SAAS,GAAG,CAAC,EAAU;QACrB,MAAM,UAAU,GAAG,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC;QAC5C,KAAK,MAAM,KAAK,IAAI,UAAU,EAAE,CAAC;YAC/B,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;gBACxB,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;gBACnB,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;gBACnB,GAAG,CAAC,KAAK,CAAC,CAAC;YACb,CAAC;QACH,CAAC;IACH,CAAC;IAED,GAAG,CAAC,MAAM,CAAC,CAAC;IACZ,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,gBAAgB,CAAC,MAAc,EAAE,KAAa;IAC5D,MAAM,OAAO,GAAG,IAAI,GAAG,EAAgB,CAAC;IACxC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;IAC7B,CAAC;IAED,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAClC,MAAM,MAAM,GAAa,EAAE,CAAC;IAE5B,SAAS,GAAG,CAAC,EAAU;QACrB,MAAM,IAAI,GAAG,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAC7B,IAAI,CAAC,IAAI;YAAE,OAAO;QAElB,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;YACnC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;gBACxB,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;gBACnB,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;gBACnB,GAAG,CAAC,KAAK,CAAC,CAAC;YACb,CAAC;QACH,CAAC;IACH,CAAC;IAED,GAAG,CAAC,MAAM,CAAC,CAAC;IACZ,OAAO,MAAM,CAAC;AAChB,CAAC"}