@n-dx/core 0.1.0

package/packages/hench/dist/agent/analysis/workflow.js

@@ -0,0 +1,359 @@
+/**
+ * Workflow analysis engine — analyzes historical run data to identify
+ * bottlenecks, failure patterns, and optimization opportunities.
+ *
+ * Pure functions operating on RunRecord arrays. No I/O or side effects.
+ */
+// ── Helpers ──────────────────────────────────────────────────────────
+const FAILURE_STATUSES = new Set(["failed", "timeout", "budget_exceeded"]);
+function runDurationMs(run) {
+    if (!run.finishedAt)
+        return 0;
+    return new Date(run.finishedAt).getTime() - new Date(run.startedAt).getTime();
+}
+function totalTokens(run) {
+    return (run.tokenUsage.input ?? 0) + (run.tokenUsage.output ?? 0);
+}
+function median(values) {
+    if (values.length === 0)
+        return 0;
+    const sorted = [...values].sort((a, b) => a - b);
+    const mid = Math.floor(sorted.length / 2);
+    return sorted.length % 2 === 0
+        ? (sorted[mid - 1] + sorted[mid]) / 2
+        : sorted[mid];
+}
+let idCounter = 0;
+function nextId(category) {
+    return `${category}-${++idCounter}`;
+}
+/** Reset ID counter — only for testing. */
+export function _resetIdCounter() {
+    idCounter = 0;
+}
+// ── Stats computation ────────────────────────────────────────────────
+export function computeStats(runs, config) {
+    if (runs.length === 0) {
+        return {
+            successRate: 0,
+            avgTurns: 0,
+            avgTokensPerRun: 0,
+            avgDurationMs: 0,
+            failuresByStatus: {},
+            troubleTaskIds: [],
+            turnLimitHits: 0,
+            budgetExceededCount: 0,
+        };
+    }
+    const completedCount = runs.filter((r) => r.status === "completed").length;
+    const finishedRuns = runs.filter((r) => r.status !== "running");
+    const successRate = finishedRuns.length > 0 ? completedCount / finishedRuns.length : 0;
+    const totalTurns = runs.reduce((sum, r) => sum + r.turns, 0);
+    const avgTurns = totalTurns / runs.length;
+    const tokenSums = runs.map(totalTokens);
+    const avgTokensPerRun = tokenSums.reduce((a, b) => a + b, 0) / runs.length;
+    const durations = runs.map(runDurationMs).filter((d) => d > 0);
+    const avgDurationMs = durations.length > 0
+        ? durations.reduce((a, b) => a + b, 0) / durations.length
+        : 0;
+    // Failures by status
+    const failuresByStatus = {};
+    for (const run of runs) {
+        if (FAILURE_STATUSES.has(run.status)) {
+            failuresByStatus[run.status] = (failuresByStatus[run.status] ?? 0) + 1;
+        }
+    }
+    // Tasks with the most failures
+    const taskFailures = new Map();
+    for (const run of runs) {
+        if (FAILURE_STATUSES.has(run.status)) {
+            taskFailures.set(run.taskId, (taskFailures.get(run.taskId) ?? 0) + 1);
+        }
+    }
+    const troubleTaskIds = [...taskFailures.entries()]
+        .filter(([, count]) => count >= 2)
+        .sort((a, b) => b[1] - a[1])
+        .map(([id]) => id);
+    // Detect runs that hit limits
+    const maxTurns = config?.maxTurns ?? 50;
+    const turnLimitHits = runs.filter((r) => r.turns >= maxTurns).length;
+    const budgetExceededCount = runs.filter((r) => r.status === "budget_exceeded").length;
+    return {
+        successRate,
+        avgTurns,
+        avgTokensPerRun,
+        avgDurationMs,
+        failuresByStatus,
+        troubleTaskIds,
+        turnLimitHits,
+        budgetExceededCount,
+    };
+}
+// ── Suggestion generators ────────────────────────────────────────────
+function suggestTokenEfficiency(runs, stats, config) {
+    const suggestions = [];
+    // High token usage with low success rate
+    if (stats.avgTokensPerRun > 100000 && stats.successRate < 0.5) {
+        suggestions.push({
+            id: nextId("token-efficiency"),
+            category: "token-efficiency",
+            priority: "high",
+            title: "High token consumption with low success rate",
+            description: "Runs are consuming significant tokens but failing frequently. Consider reducing token budget to fail faster on hard tasks.",
+            rationale: `Average ${Math.round(stats.avgTokensPerRun).toLocaleString()} tokens/run with only ${Math.round(stats.successRate * 100)}% success rate.`,
+            impact: "Reduces wasted tokens on tasks that are unlikely to succeed.",
+            configChanges: config?.tokenBudget === 0
+                ? { tokenBudget: Math.round(stats.avgTokensPerRun * 0.7) }
+                : undefined,
+            autoApplicable: config?.tokenBudget === 0 || false,
+        });
+    }
+    // Runs that complete quickly could use a lower budget
+    const completedRuns = runs.filter((r) => r.status === "completed");
+    if (completedRuns.length >= 3) {
+        const completedTokens = completedRuns.map(totalTokens);
+        const medianTokens = median(completedTokens);
+        const currentBudget = config?.tokenBudget ?? 0;
+        if (currentBudget === 0 && medianTokens > 0) {
+            // No budget set — suggest one based on median usage with headroom
+            const suggestedBudget = Math.round(medianTokens * 2);
+            suggestions.push({
+                id: nextId("token-efficiency"),
+                category: "token-efficiency",
+                priority: "low",
+                title: "Set a token budget based on historical usage",
+                description: `Successful runs use a median of ${medianTokens.toLocaleString()} tokens. A budget would cap runaway costs.`,
+                rationale: `${completedRuns.length} completed runs analyzed. Median: ${medianTokens.toLocaleString()} tokens.`,
+                impact: `Budget of ${suggestedBudget.toLocaleString()} (2x median) protects against unbounded runs.`,
+                configChanges: { tokenBudget: suggestedBudget },
+                autoApplicable: true,
+            });
+        }
+    }
+    return suggestions;
+}
+function suggestFailurePrevention(runs, stats) {
+    const suggestions = [];
+    // Recurring timeout pattern
+    if ((stats.failuresByStatus["timeout"] ?? 0) >= 2) {
+        const timeoutCount = stats.failuresByStatus["timeout"];
+        suggestions.push({
+            id: nextId("failure-prevention"),
+            category: "failure-prevention",
+            priority: "high",
+            title: "Recurring timeout failures",
+            description: `${timeoutCount} runs have timed out. Tasks may be too large or the turn limit too low for the work required.`,
+            rationale: `${timeoutCount} timeout failures out of ${runs.length} total runs.`,
+            impact: "Increasing max turns or splitting tasks may improve completion rate.",
+            configChanges: { maxTurns: 80 },
+            autoApplicable: true,
+        });
+    }
+    // Recurring general failures
+    if ((stats.failuresByStatus["failed"] ?? 0) >= 3) {
+        const failedCount = stats.failuresByStatus["failed"];
+        suggestions.push({
+            id: nextId("failure-prevention"),
+            category: "failure-prevention",
+            priority: "medium",
+            title: "Frequent task failures",
+            description: `${failedCount} runs have failed. Reviewing error patterns may reveal systemic issues.`,
+            rationale: `${failedCount} failures across ${runs.length} runs (${Math.round((failedCount / runs.length) * 100)}% failure rate).`,
+            impact: "Identifying root causes can prevent repeated failed attempts.",
+            affectedTaskIds: stats.troubleTaskIds.slice(0, 5),
+            autoApplicable: false,
+        });
+    }
+    // Tasks with concentrated failures
+    for (const taskId of stats.troubleTaskIds.slice(0, 3)) {
+        const taskRuns = runs.filter((r) => r.taskId === taskId);
+        const taskFailures = taskRuns.filter((r) => FAILURE_STATUSES.has(r.status));
+        const taskErrors = taskRuns
+            .filter((r) => r.error)
+            .map((r) => r.error)
+            .slice(0, 3);
+        if (taskFailures.length >= 3) {
+            suggestions.push({
+                id: nextId("failure-prevention"),
+                category: "failure-prevention",
+                priority: "high",
+                title: `Task "${taskRuns[0]?.taskTitle ?? taskId}" is stuck`,
+                description: `This task has failed ${taskFailures.length} times out of ${taskRuns.length} attempts.${taskErrors.length > 0 ? ` Recent errors: ${taskErrors[0]?.slice(0, 100)}` : ""}`,
+                rationale: `${taskFailures.length} failures suggest the task may need manual review, splitting, or scope reduction.`,
+                impact: "Prevents further wasted runs on a blocked task.",
+                affectedTaskIds: [taskId],
+                autoApplicable: false,
+            });
+        }
+    }
+    return suggestions;
+}
+function suggestTurnOptimization(runs, stats, config) {
+    const suggestions = [];
+    const maxTurns = config?.maxTurns ?? 50;
+    // Many runs hitting the turn limit
+    if (stats.turnLimitHits >= 2 && runs.length >= 3) {
+        const hitRate = stats.turnLimitHits / runs.length;
+        if (hitRate > 0.3) {
+            suggestions.push({
+                id: nextId("turn-optimization"),
+                category: "turn-optimization",
+                priority: "high",
+                title: "Turn limit reached frequently",
+                description: `${stats.turnLimitHits} of ${runs.length} runs (${Math.round(hitRate * 100)}%) hit the ${maxTurns}-turn limit. Tasks may need more room to complete.`,
+                rationale: `Turn limit hit rate is ${Math.round(hitRate * 100)}%. Runs that hit the limit are often incomplete.`,
+                impact: `Increasing maxTurns to ${Math.min(maxTurns * 2, 100)} gives tasks more room to finish.`,
+                configChanges: { maxTurns: Math.min(maxTurns * 2, 100) },
+                autoApplicable: true,
+            });
+        }
+    }
+    // Runs completing well under the turn limit — suggest lowering for cost savings
+    const completedRuns = runs.filter((r) => r.status === "completed");
+    if (completedRuns.length >= 5) {
+        const turnUsages = completedRuns.map((r) => r.turns);
+        const medianTurns = median(turnUsages);
+        const p90Turns = turnUsages.sort((a, b) => a - b)[Math.floor(turnUsages.length * 0.9)];
+        if (p90Turns !== undefined && p90Turns < maxTurns * 0.5 && maxTurns > 20) {
+            suggestions.push({
+                id: nextId("turn-optimization"),
+                category: "turn-optimization",
+                priority: "low",
+                title: "Turn limit is much higher than needed",
+                description: `Successful runs use a median of ${medianTurns} turns, but the limit is ${maxTurns}. Lowering the limit saves tokens on runaway runs.`,
+                rationale: `P90 turn usage is ${p90Turns}, well below the ${maxTurns} limit.`,
+                impact: `Setting maxTurns to ${Math.max(Math.round(p90Turns * 1.5), 20)} covers 90% of successful runs with headroom.`,
+                configChanges: { maxTurns: Math.max(Math.round(p90Turns * 1.5), 20) },
+                autoApplicable: true,
+            });
+        }
+    }
+    return suggestions;
+}
+function suggestConfigTuning(runs, _stats, config) {
+    const suggestions = [];
+    // Check retry config against transient error frequency
+    const transientErrors = runs.filter((r) => r.status === "error_transient");
+    const retriedRuns = runs.filter((r) => (r.retryAttempts ?? 0) > 0);
+    const maxRetries = config?.retry?.maxRetries ?? 3;
+    if (transientErrors.length >= 3 && maxRetries < 5) {
+        suggestions.push({
+            id: nextId("config-tuning"),
+            category: "config-tuning",
+            priority: "medium",
+            title: "Increase retry count for transient errors",
+            description: `${transientErrors.length} runs ended with transient errors. Higher retry count may recover more.`,
+            rationale: `Current max retries: ${maxRetries}. ${transientErrors.length} transient errors suggest API instability.`,
+            impact: "More retries can recover from temporary API issues without manual intervention.",
+            configChanges: { "retry.maxRetries": 5 },
+            autoApplicable: true,
+        });
+    }
+    // Check stuck threshold
+    const stuckThreshold = config?.maxFailedAttempts ?? 3;
+    if (stuckThreshold > 3) {
+        // Count tasks that exhausted all attempts without recovering
+        const taskRuns = new Map();
+        for (const run of runs) {
+            const existing = taskRuns.get(run.taskId) ?? [];
+            existing.push(run);
+            taskRuns.set(run.taskId, existing);
+        }
+        const neverRecovered = [...taskRuns.values()].filter((taskRunList) => {
+            const sorted = [...taskRunList].sort((a, b) => b.startedAt.localeCompare(a.startedAt));
+            let failures = 0;
+            for (const r of sorted) {
+                if (FAILURE_STATUSES.has(r.status))
+                    failures++;
+                else
+                    break;
+            }
+            return failures >= stuckThreshold;
+        });
+        if (neverRecovered.length >= 2) {
+            suggestions.push({
+                id: nextId("config-tuning"),
+                category: "config-tuning",
+                priority: "medium",
+                title: "Lower stuck threshold to skip failing tasks sooner",
+                description: `${neverRecovered.length} tasks exhausted all ${stuckThreshold} attempts without recovery. A lower threshold saves resources.`,
+                rationale: `Stuck threshold is ${stuckThreshold}, but tasks that fail 3 times rarely recover.`,
+                impact: `Setting maxFailedAttempts to 3 stops wasting runs on deeply stuck tasks.`,
+                configChanges: { maxFailedAttempts: 3 },
+                autoApplicable: true,
+            });
+        }
+    }
+    return suggestions;
+}
+function suggestTaskHealth(runs, _stats) {
+    const suggestions = [];
+    // Find tasks that are being re-run excessively
+    const taskRunCounts = new Map();
+    for (const run of runs) {
+        const entry = taskRunCounts.get(run.taskId) ?? { count: 0, title: run.taskTitle };
+        entry.count++;
+        taskRunCounts.set(run.taskId, entry);
+    }
+    const excessiveRuns = [...taskRunCounts.entries()]
+        .filter(([, info]) => info.count >= 5)
+        .sort((a, b) => b[1].count - a[1].count);
+    for (const [taskId, info] of excessiveRuns.slice(0, 3)) {
+        suggestions.push({
+            id: nextId("task-health"),
+            category: "task-health",
+            priority: "medium",
+            title: `Task "${info.title}" has been run ${info.count} times`,
+            description: `This task has been attempted ${info.count} times. It may need to be broken into smaller subtasks or have its requirements clarified.`,
+            rationale: `${info.count} runs for a single task indicates scope or complexity issues.`,
+            impact: "Splitting or clarifying the task will improve success rate.",
+            affectedTaskIds: [taskId],
+            autoApplicable: false,
+        });
+    }
+    return suggestions;
+}
+// ── Main analysis function ───────────────────────────────────────────
+/**
+ * Analyze workflow run history and produce optimization suggestions.
+ *
+ * @param runs  Run records sorted by startedAt descending (newest first)
+ * @param config  Optional current hench config for context-aware suggestions
+ */
+export function analyzeWorkflow(runs, config) {
+    // Reset ID counter for deterministic IDs per analysis call
+    _resetIdCounter();
+    if (runs.length === 0) {
+        return {
+            totalRuns: 0,
+            timeRange: null,
+            stats: computeStats([]),
+            suggestions: [],
+        };
+    }
+    const stats = computeStats(runs, config);
+    // Compute time range
+    const sorted = [...runs].sort((a, b) => a.startedAt.localeCompare(b.startedAt));
+    const timeRange = {
+        earliest: sorted[0].startedAt,
+        latest: sorted[sorted.length - 1].startedAt,
+    };
+    // Collect all suggestions
+    const allSuggestions = [
+        ...suggestTokenEfficiency(runs, stats, config),
+        ...suggestFailurePrevention(runs, stats),
+        ...suggestTurnOptimization(runs, stats, config),
+        ...suggestConfigTuning(runs, stats, config),
+        ...suggestTaskHealth(runs, stats),
+    ];
+    // Sort by priority: high → medium → low
+    const priorityOrder = { high: 0, medium: 1, low: 2 };
+    allSuggestions.sort((a, b) => (priorityOrder[a.priority] ?? 2) - (priorityOrder[b.priority] ?? 2));
+    return {
+        totalRuns: runs.length,
+        timeRange,
+        stats,
+        suggestions: allSuggestions,
+    };
+}
+//# sourceMappingURL=workflow.js.map

package/packages/hench/dist/agent/analysis/workflow.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"workflow.js","sourceRoot":"","sources":["../../../src/agent/analysis/workflow.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAwDH,wEAAwE;AAExE,MAAM,gBAAgB,GAAmB,IAAI,GAAG,CAAC,CAAC,QAAQ,EAAE,SAAS,EAAE,iBAAiB,CAAC,CAAC,CAAC;AAE3F,SAAS,aAAa,CAAC,GAAc;IACnC,IAAI,CAAC,GAAG,CAAC,UAAU;QAAE,OAAO,CAAC,CAAC;IAC9B,OAAO,IAAI,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC,OAAO,EAAE,GAAG,IAAI,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,OAAO,EAAE,CAAC;AAChF,CAAC;AAED,SAAS,WAAW,CAAC,GAAc;IACjC,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC,KAAK,IAAI,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,UAAU,CAAC,MAAM,IAAI,CAAC,CAAC,CAAC;AACpE,CAAC;AAED,SAAS,MAAM,CAAC,MAAgB;IAC9B,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IAClC,MAAM,MAAM,GAAG,CAAC,GAAG,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IACjD,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAC1C,OAAO,MAAM,CAAC,MAAM,GAAG,CAAC,KAAK,CAAC;QAC5B,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC;QACrC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;AAClB,CAAC;AAED,IAAI,SAAS,GAAG,CAAC,CAAC;AAClB,SAAS,MAAM,CAAC,QAA4B;IAC1C,OAAO,GAAG,QAAQ,IAAI,EAAE,SAAS,EAAE,CAAC;AACtC,CAAC;AAED,2CAA2C;AAC3C,MAAM,UAAU,eAAe;IAC7B,SAAS,GAAG,CAAC,CAAC;AAChB,CAAC;AAED,wEAAwE;AAExE,MAAM,UAAU,YAAY,CAAC,IAAiB,EAAE,MAAoB;IAClE,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACtB,OAAO;YACL,WAAW,EAAE,CAAC;YACd,QAAQ,EAAE,CAAC;YACX,eAAe,EAAE,CAAC;YAClB,aAAa,EAAE,CAAC;YAChB,gBAAgB,EAAE,EAAE;YACpB,cAAc,EAAE,EAAE;YAClB,aAAa,EAAE,CAAC;YAChB,mBAAmB,EAAE,CAAC;SACvB,CAAC;IACJ,CAAC;IAED,MAAM,cAAc,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,WAAW,CAAC,CAAC,MAAM,CAAC;IAC3E,MAAM,YAAY,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,SAAS,CAAC,CAAC;IAChE,MAAM,WAAW,GAAG,YAAY,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,cAAc,GAAG,YAAY,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;IAEvF,MAAM,UAAU,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;IAC7D,MAAM,QAAQ,GAAG,UAAU,GAAG,IAAI,CAAC,MAAM,CAAC;IAE1C,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;IACxC,MAAM,eAAe,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;IAE3E,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,aAAa,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAC/D,MAAM,aAAa,GAAG,SAAS,CAAC,MAAM,GAAG,CAAC;QACxC,CAAC,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,SAAS,CAAC,MAAM;QACzD,CAAC,CAAC,CAAC,CAAC;IAEN,qBAAqB;IACrB,MAAM,gBAAgB,GAA2B,EAAE,CAAC;IACpD,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;QACvB,IAAI,gBAAgB,CAAC,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;YACrC,gBAAgB,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,gBAAgB,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;QACzE,CAAC;IACH,CAAC;IAED,+BAA+B;IAC/B,MAAM,YAAY,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC/C,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;QACvB,IAAI,gBAAgB,CAAC,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;YACrC,YAAY,CAAC,GAAG,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,YAAY,CAAC,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACxE,CAAC;IACH,CAAC;IACD,MAAM,cAAc,GAAG,CAAC,GAAG,YAAY,CAAC,OAAO,EAAE,CAAC;SAC/C,MAAM,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,EAAE,EAAE,CAAC,KAAK,IAAI,CAAC,CAAC;SACjC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;SAC3B,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC;IAErB,8BAA8B;IAC9B,MAAM,QAAQ,GAAG,MAAM,EAAE,QAAQ,IAAI,EAAE,CAAC;IACxC,MAAM,aAAa,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,IAAI,QAAQ,CAAC,CAAC,MAAM,CAAC;IACrE,MAAM,mBAAmB,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,iBAAiB,CAAC,CAAC,MAAM,CAAC;IAEtF,OAAO;QACL,WAAW;QACX,QAAQ;QACR,eAAe;QACf,aAAa;QACb,gBAAgB;QAChB,cAAc;QACd,aAAa;QACb,mBAAmB;KACpB,CAAC;AACJ,CAAC;AAED,wEAAwE;AAExE,SAAS,sBAAsB,CAC7B,IAAiB,EACjB,KAAoB,EACpB,MAAoB;IAEpB,MAAM,WAAW,GAAyB,EAAE,CAAC;IAE7C,yCAAyC;IACzC,IAAI,KAAK,CAAC,eAAe,GAAG,MAAM,IAAI,KAAK,CAAC,WAAW,GAAG,GAAG,EAAE,CAAC;QAC9D,WAAW,CAAC,IAAI,CAAC;YACf,EAAE,EAAE,MAAM,CAAC,kBAAkB,CAAC;YAC9B,QAAQ,EAAE,kBAAkB;YAC5B,QAAQ,EAAE,MAAM;YAChB,KAAK,EAAE,8CAA8C;YACrD,WAAW,EAAE,4HAA4H;YACzI,SAAS,EAAE,WAAW,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,eAAe,CAAC,CAAC,cAAc,EAAE,yBAAyB,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,WAAW,GAAG,GAAG,CAAC,iBAAiB;YACrJ,MAAM,EAAE,8DAA8D;YACtE,aAAa,EAAE,MAAM,EAAE,WAAW,KAAK,CAAC;gBACtC,CAAC,CAAC,EAAE,WAAW,EAAE,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,eAAe,GAAG,GAAG,CAAC,EAAE;gBAC1D,CAAC,CAAC,SAAS;YACb,cAAc,EAAE,MAAM,EAAE,WAAW,KAAK,CAAC,IAAI,KAAK;SACnD,CAAC,CAAC;IACL,CAAC;IAED,sDAAsD;IACtD,MAAM,aAAa,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,WAAW,CAAC,CAAC;IACnE,IAAI,aAAa,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;QAC9B,MAAM,eAAe,GAAG,aAAa,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;QACvD,MAAM,YAAY,GAAG,MAAM,CAAC,eAAe,CAAC,CAAC;QAC7C,MAAM,aAAa,GAAG,MAAM,EAAE,WAAW,IAAI,CAAC,CAAC;QAE/C,IAAI,aAAa,KAAK,CAAC,IAAI,YAAY,GAAG,CAAC,EAAE,CAAC;YAC5C,kEAAkE;YAClE,MAAM,eAAe,GAAG,IAAI,CAAC,KAAK,CAAC,YAAY,GAAG,CAAC,CAAC,CAAC;YACrD,WAAW,CAAC,IAAI,CAAC;gBACf,EAAE,EAAE,MAAM,CAAC,kBAAkB,CAAC;gBAC9B,QAAQ,EAAE,kBAAkB;gBAC5B,QAAQ,EAAE,KAAK;gBACf,KAAK,EAAE,8CAA8C;gBACrD,WAAW,EAAE,mCAAmC,YAAY,CAAC,cAAc,EAAE,4CAA4C;gBACzH,SAAS,EAAE,GAAG,aAAa,CAAC,MAAM,qCAAqC,YAAY,CAAC,cAAc,EAAE,UAAU;gBAC9G,MAAM,EAAE,aAAa,eAAe,CAAC,cAAc,EAAE,+CAA+C;gBACpG,aAAa,EAAE,EAAE,WAAW,EAAE,eAAe,EAAE;gBAC/C,cAAc,EAAE,IAAI;aACrB,CAAC,CAAC;QACL,CAAC;IACH,CAAC;IAED,OAAO,WAAW,CAAC;AACrB,CAAC;AAED,SAAS,wBAAwB,CAC/B,IAAiB,EACjB,KAAoB;IAEpB,MAAM,WAAW,GAAyB,EAAE,CAAC;IAE7C,4BAA4B;IAC5B,IAAI,CAAC,KAAK,CAAC,gBAAgB,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC;QAClD,MAAM,YAAY,GAAG,KAAK,CAAC,gBAAgB,CAAC,SAAS,CAAC,CAAC;QACvD,WAAW,CAAC,IAAI,CAAC;YACf,EAAE,EAAE,MAAM,CAAC,oBAAoB,CAAC;YAChC,QAAQ,EAAE,oBAAoB;YAC9B,QAAQ,EAAE,MAAM;YAChB,KAAK,EAAE,4BAA4B;YACnC,WAAW,EAAE,GAAG,YAAY,+FAA+F;YAC3H,SAAS,EAAE,GAAG,YAAY,4BAA4B,IAAI,CAAC,MAAM,cAAc;YAC/E,MAAM,EAAE,sEAAsE;YAC9E,aAAa,EAAE,EAAE,QAAQ,EAAE,EAAE,EAAE;YAC/B,cAAc,EAAE,IAAI;SACrB,CAAC,CAAC;IACL,CAAC;IAED,6BAA6B;IAC7B,IAAI,CAAC,KAAK,CAAC,gBAAgB,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC;QACjD,MAAM,WAAW,GAAG,KAAK,CAAC,gBAAgB,CAAC,QAAQ,CAAC,CAAC;QACrD,WAAW,CAAC,IAAI,CAAC;YACf,EAAE,EAAE,MAAM,CAAC,oBAAoB,CAAC;YAChC,QAAQ,EAAE,oBAAoB;YAC9B,QAAQ,EAAE,QAAQ;YAClB,KAAK,EAAE,wBAAwB;YAC/B,WAAW,EAAE,GAAG,WAAW,yEAAyE;YACpG,SAAS,EAAE,GAAG,WAAW,oBAAoB,IAAI,CAAC,MAAM,UAAU,IAAI,CAAC,KAAK,CAAC,CAAC,WAAW,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,GAAG,CAAC,kBAAkB;YACjI,MAAM,EAAE,+DAA+D;YACvE,eAAe,EAAE,KAAK,CAAC,cAAc,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC;YACjD,cAAc,EAAE,KAAK;SACtB,CAAC,CAAC;IACL,CAAC;IAED,mCAAmC;IACnC,KAAK,MAAM,MAAM,IAAI,KAAK,CAAC,cAAc,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC;QACtD,MAAM,QAAQ,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,MAAM,CAAC,CAAC;QACzD,MAAM,YAAY,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,gBAAgB,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC;QAC5E,MAAM,UAAU,GAAG,QAAQ;aACxB,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC;aACtB,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAM,CAAC;aACpB,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAEf,IAAI,YAAY,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;YAC7B,WAAW,CAAC,IAAI,CAAC;gBACf,EAAE,EAAE,MAAM,CAAC,oBAAoB,CAAC;gBAChC,QAAQ,EAAE,oBAAoB;gBAC9B,QAAQ,EAAE,MAAM;gBAChB,KAAK,EAAE,SAAS,QAAQ,CAAC,CAAC,CAAC,EAAE,SAAS,IAAI,MAAM,YAAY;gBAC5D,WAAW,EAAE,wBAAwB,YAAY,CAAC,MAAM,iBAAiB,QAAQ,CAAC,MAAM,aAAa,UAAU,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,mBAAmB,UAAU,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE;gBACrL,SAAS,EAAE,GAAG,YAAY,CAAC,MAAM,mFAAmF;gBACpH,MAAM,EAAE,iDAAiD;gBACzD,eAAe,EAAE,CAAC,MAAM,CAAC;gBACzB,cAAc,EAAE,KAAK;aACtB,CAAC,CAAC;QACL,CAAC;IACH,CAAC;IAED,OAAO,WAAW,CAAC;AACrB,CAAC;AAED,SAAS,uBAAuB,CAC9B,IAAiB,EACjB,KAAoB,EACpB,MAAoB;IAEpB,MAAM,WAAW,GAAyB,EAAE,CAAC;IAC7C,MAAM,QAAQ,GAAG,MAAM,EAAE,QAAQ,IAAI,EAAE,CAAC;IAExC,mCAAmC;IACnC,IAAI,KAAK,CAAC,aAAa,IAAI,CAAC,IAAI,IAAI,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;QACjD,MAAM,OAAO,GAAG,KAAK,CAAC,aAAa,GAAG,IAAI,CAAC,MAAM,CAAC;QAClD,IAAI,OAAO,GAAG,GAAG,EAAE,CAAC;YAClB,WAAW,CAAC,IAAI,CAAC;gBACf,EAAE,EAAE,MAAM,CAAC,mBAAmB,CAAC;gBAC/B,QAAQ,EAAE,mBAAmB;gBAC7B,QAAQ,EAAE,MAAM;gBAChB,KAAK,EAAE,+BAA+B;gBACtC,WAAW,EAAE,GAAG,KAAK,CAAC,aAAa,OAAO,IAAI,CAAC,MAAM,UAAU,IAAI,CAAC,KAAK,CAAC,OAAO,GAAG,GAAG,CAAC,cAAc,QAAQ,oDAAoD;gBAClK,SAAS,EAAE,0BAA0B,IAAI,CAAC,KAAK,CAAC,OAAO,GAAG,GAAG,CAAC,kDAAkD;gBAChH,MAAM,EAAE,0BAA0B,IAAI,CAAC,GAAG,CAAC,QAAQ,GAAG,CAAC,EAAE,GAAG,CAAC,mCAAmC;gBAChG,aAAa,EAAE,EAAE,QAAQ,EAAE,IAAI,CAAC,GAAG,CAAC,QAAQ,GAAG,CAAC,EAAE,GAAG,CAAC,EAAE;gBACxD,cAAc,EAAE,IAAI;aACrB,CAAC,CAAC;QACL,CAAC;IACH,CAAC;IAED,gFAAgF;IAChF,MAAM,aAAa,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,WAAW,CAAC,CAAC;IACnE,IAAI,aAAa,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;QAC9B,MAAM,UAAU,GAAG,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;QACrD,MAAM,WAAW,GAAG,MAAM,CAAC,UAAU,CAAC,CAAC;QACvC,MAAM,QAAQ,GAAG,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC;QAEvF,IAAI,QAAQ,KAAK,SAAS,IAAI,QAAQ,GAAG,QAAQ,GAAG,GAAG,IAAI,QAAQ,GAAG,EAAE,EAAE,CAAC;YACzE,WAAW,CAAC,IAAI,CAAC;gBACf,EAAE,EAAE,MAAM,CAAC,mBAAmB,CAAC;gBAC/B,QAAQ,EAAE,mBAAmB;gBAC7B,QAAQ,EAAE,KAAK;gBACf,KAAK,EAAE,uCAAuC;gBAC9C,WAAW,EAAE,mCAAmC,WAAW,4BAA4B,QAAQ,oDAAoD;gBACnJ,SAAS,EAAE,qBAAqB,QAAQ,oBAAoB,QAAQ,SAAS;gBAC7E,MAAM,EAAE,uBAAuB,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,QAAQ,GAAG,GAAG,CAAC,EAAE,EAAE,CAAC,+CAA+C;gBACtH,aAAa,EAAE,EAAE,QAAQ,EAAE,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,QAAQ,GAAG,GAAG,CAAC,EAAE,EAAE,CAAC,EAAE;gBACrE,cAAc,EAAE,IAAI;aACrB,CAAC,CAAC;QACL,CAAC;IACH,CAAC;IAED,OAAO,WAAW,CAAC;AACrB,CAAC;AAED,SAAS,mBAAmB,CAC1B,IAAiB,EACjB,MAAqB,EACrB,MAAoB;IAEpB,MAAM,WAAW,GAAyB,EAAE,CAAC;IAE7C,uDAAuD;IACvD,MAAM,eAAe,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,iBAAiB,CAAC,CAAC;IAC3E,MAAM,WAAW,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,aAAa,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IACnE,MAAM,UAAU,GAAG,MAAM,EAAE,KAAK,EAAE,UAAU,IAAI,CAAC,CAAC;IAElD,IAAI,eAAe,CAAC,MAAM,IAAI,CAAC,IAAI,UAAU,GAAG,CAAC,EAAE,CAAC;QAClD,WAAW,CAAC,IAAI,CAAC;YACf,EAAE,EAAE,MAAM,CAAC,eAAe,CAAC;YAC3B,QAAQ,EAAE,eAAe;YACzB,QAAQ,EAAE,QAAQ;YAClB,KAAK,EAAE,2CAA2C;YAClD,WAAW,EAAE,GAAG,eAAe,CAAC,MAAM,yEAAyE;YAC/G,SAAS,EAAE,wBAAwB,UAAU,KAAK,eAAe,CAAC,MAAM,4CAA4C;YACpH,MAAM,EAAE,iFAAiF;YACzF,aAAa,EAAE,EAAE,kBAAkB,EAAE,CAAC,EAAE;YACxC,cAAc,EAAE,IAAI;SACrB,CAAC,CAAC;IACL,CAAC;IAED,wBAAwB;IACxB,MAAM,cAAc,GAAG,MAAM,EAAE,iBAAiB,IAAI,CAAC,CAAC;IACtD,IAAI,cAAc,GAAG,CAAC,EAAE,CAAC;QACvB,6DAA6D;QAC7D,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAuB,CAAC;QAChD,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;YACvB,MAAM,QAAQ,GAAG,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;YAChD,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YACnB,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;QACrC,CAAC;QAED,MAAM,cAAc,GAAG,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,WAAW,EAAE,EAAE;YACnE,MAAM,MAAM,GAAG,CAAC,GAAG,WAAW,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,aAAa,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC;YACvF,IAAI,QAAQ,GAAG,CAAC,CAAC;YACjB,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;gBACvB,IAAI,gBAAgB,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC;oBAAE,QAAQ,EAAE,CAAC;;oBAC1C,MAAM;YACb,CAAC;YACD,OAAO,QAAQ,IAAI,cAAc,CAAC;QACpC,CAAC,CAAC,CAAC;QAEH,IAAI,cAAc,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;YAC/B,WAAW,CAAC,IAAI,CAAC;gBACf,EAAE,EAAE,MAAM,CAAC,eAAe,CAAC;gBAC3B,QAAQ,EAAE,eAAe;gBACzB,QAAQ,EAAE,QAAQ;gBAClB,KAAK,EAAE,oDAAoD;gBAC3D,WAAW,EAAE,GAAG,cAAc,CAAC,MAAM,wBAAwB,cAAc,gEAAgE;gBAC3I,SAAS,EAAE,sBAAsB,cAAc,+CAA+C;gBAC9F,MAAM,EAAE,0EAA0E;gBAClF,aAAa,EAAE,EAAE,iBAAiB,EAAE,CAAC,EAAE;gBACvC,cAAc,EAAE,IAAI;aACrB,CAAC,CAAC;QACL,CAAC;IACH,CAAC;IAED,OAAO,WAAW,CAAC;AACrB,CAAC;AAED,SAAS,iBAAiB,CACxB,IAAiB,EACjB,MAAqB;IAErB,MAAM,WAAW,GAAyB,EAAE,CAAC;IAE7C,+CAA+C;IAC/C,MAAM,aAAa,GAAG,IAAI,GAAG,EAA4C,CAAC;IAC1E,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;QACvB,MAAM,KAAK,GAAG,aAAa,CAAC,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,GAAG,CAAC,SAAS,EAAE,CAAC;QAClF,KAAK,CAAC,KAAK,EAAE,CAAC;QACd,aAAa,CAAC,GAAG,CAAC,GAAG,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;IACvC,CAAC;IAED,MAAM,aAAa,GAAG,CAAC,GAAG,aAAa,CAAC,OAAO,EAAE,CAAC;SAC/C,MAAM,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,KAAK,IAAI,CAAC,CAAC;SACrC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;IAE3C,KAAK,MAAM,CAAC,MAAM,EAAE,IAAI,CAAC,IAAI,aAAa,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC;QACvD,WAAW,CAAC,IAAI,CAAC;YACf,EAAE,EAAE,MAAM,CAAC,aAAa,CAAC;YACzB,QAAQ,EAAE,aAAa;YACvB,QAAQ,EAAE,QAAQ;YAClB,KAAK,EAAE,SAAS,IAAI,CAAC,KAAK,kBAAkB,IAAI,CAAC,KAAK,QAAQ;YAC9D,WAAW,EAAE,gCAAgC,IAAI,CAAC,KAAK,4FAA4F;YACnJ,SAAS,EAAE,GAAG,IAAI,CAAC,KAAK,+DAA+D;YACvF,MAAM,EAAE,6DAA6D;YACrE,eAAe,EAAE,CAAC,MAAM,CAAC;YACzB,cAAc,EAAE,KAAK;SACtB,CAAC,CAAC;IACL,CAAC;IAED,OAAO,WAAW,CAAC;AACrB,CAAC;AAED,wEAAwE;AAExE;;;;;GAKG;AACH,MAAM,UAAU,eAAe,CAC7B,IAAiB,EACjB,MAAoB;IAEpB,2DAA2D;IAC3D,eAAe,EAAE,CAAC;IAElB,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACtB,OAAO;YACL,SAAS,EAAE,CAAC;YACZ,SAAS,EAAE,IAAI;YACf,KAAK,EAAE,YAAY,CAAC,EAAE,CAAC;YACvB,WAAW,EAAE,EAAE;SAChB,CAAC;IACJ,CAAC;IAED,MAAM,KAAK,GAAG,YAAY,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;IAEzC,qBAAqB;IACrB,MAAM,MAAM,GAAG,CAAC,GAAG,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,aAAa,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC;IAChF,MAAM,SAAS,GAAG;QAChB,QAAQ,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,SAAS;QAC7B,MAAM,EAAE,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,SAAS;KAC5C,CAAC;IAEF,0BAA0B;IAC1B,MAAM,cAAc,GAAyB;QAC3C,GAAG,sBAAsB,CAAC,IAAI,EAAE,KAAK,EAAE,MAAM,CAAC;QAC9C,GAAG,wBAAwB,CAAC,IAAI,EAAE,KAAK,CAAC;QACxC,GAAG,uBAAuB,CAAC,IAAI,EAAE,KAAK,EAAE,MAAM,CAAC;QAC/C,GAAG,mBAAmB,CAAC,IAAI,EAAE,KAAK,EAAE,MAAM,CAAC;QAC3C,GAAG,iBAAiB,CAAC,IAAI,EAAE,KAAK,CAAC;KAClC,CAAC;IAEF,wCAAwC;IACxC,MAAM,aAAa,GAA2B,EAAE,IAAI,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC;IAC7E,cAAc,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAC3B,CAAC,aAAa,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,aAAa,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CACpE,CAAC;IAEF,OAAO;QACL,SAAS,EAAE,IAAI,CAAC,MAAM;QACtB,SAAS;QACT,KAAK;QACL,WAAW,EAAE,cAAc;KAC5B,CAAC;AACJ,CAAC"}

package/packages/hench/dist/agent/brief.d.ts

@@ -0,0 +1,33 @@
+import type { PRDStore, PRDItem } from "rex";
+import type { TaskBrief } from "../schema/index.js";
+export interface AssembleBriefOptions {
+    /** Task IDs to skip during autoselection (e.g. stuck tasks). */
+    excludeTaskIds?: Set<string>;
+    /** Restrict task selection to this epic (ID). */
+    epicId?: string;
+}
+/**
+ * Collect all task/subtask IDs that belong to a specific epic.
+ * Includes all descendants of the epic at task or subtask level.
+ */
+export declare function collectEpicTaskIds(items: PRDItem[], epicId: string): Set<string>;
+/** Thrown when an explicitly-selected task cannot be worked on. */
+export declare class TaskNotActionableError extends Error {
+    readonly taskId: string;
+    readonly status: string;
+    readonly suggestion: string;
+    constructor(taskId: string, status: string, suggestion: string, title?: string);
+}
+export declare function assembleTaskBrief(store: PRDStore, taskId?: string, options?: AssembleBriefOptions): Promise<{
+    brief: TaskBrief;
+    taskId: string;
+}>;
+export interface ActionableTask {
+    id: string;
+    title: string;
+    level: string;
+    priority: string;
+    parentChain: string;
+}
+export declare function getActionableTasks(store: PRDStore, limit?: number): Promise<ActionableTask[]>;
+export declare function formatTaskBrief(brief: TaskBrief): string;

package/packages/hench/dist/agent/brief.js

@@ -0,0 +1,235 @@
+import { findNextTask, findActionableTasks, collectCompletedIds, findItem, walkTree, } from "rex";
+// ---------------------------------------------------------------------------
+// Epic task collection
+// ---------------------------------------------------------------------------
+/**
+ * Collect all task/subtask IDs that belong to a specific epic.
+ * Includes all descendants of the epic at task or subtask level.
+ */
+export function collectEpicTaskIds(items, epicId) {
+    const ids = new Set();
+    for (const { item, parents } of walkTree(items)) {
+        // Check if this item is inside the target epic
+        const isInEpic = item.id === epicId ||
+            parents.some((p) => p.id === epicId);
+        if (isInEpic && (item.level === "task" || item.level === "subtask")) {
+            ids.add(item.id);
+        }
+    }
+    return ids;
+}
+// ---------------------------------------------------------------------------
+// Task status validation
+// ---------------------------------------------------------------------------
+/** Statuses that cannot be worked on. */
+const NON_ACTIONABLE_STATUSES = new Set(["completed", "deferred", "blocked"]);
+/** Thrown when an explicitly-selected task cannot be worked on. */
+export class TaskNotActionableError extends Error {
+    taskId;
+    status;
+    suggestion;
+    constructor(taskId, status, suggestion, title) {
+        const label = title ? `"${title}" (${taskId})` : taskId;
+        super(`Task ${label} is ${status} and cannot be worked on.`);
+        this.name = "TaskNotActionableError";
+        this.taskId = taskId;
+        this.status = status;
+        this.suggestion = suggestion;
+    }
+}
+function buildSuggestion(status, taskId) {
+    if (status === "completed") {
+        return ("This task is already complete. Run 'n-dx status' to see remaining work,\n" +
+            "or pick a different task with 'n-dx work --task=<ID>'.");
+    }
+    if (status === "blocked") {
+        return (`This task is blocked and cannot proceed until its dependencies are resolved.\n` +
+            `To unblock it, run:\n` +
+            `  rex update ${taskId} --status=pending\n` +
+            "Then run 'n-dx work' again.");
+    }
+    // deferred
+    return (`This task has been deferred. To reactivate it, run:\n` +
+        `  rex update ${taskId} --status=pending\n` +
+        "Then run 'n-dx work' again.");
+}
+function itemToTaskBrief(item) {
+    return {
+        id: item.id,
+        title: item.title,
+        level: item.level,
+        status: item.status,
+        description: item.description,
+        acceptanceCriteria: item.acceptanceCriteria,
+        priority: item.priority,
+        tags: item.tags,
+        blockedBy: item.blockedBy,
+    };
+}
+function itemToParent(item) {
+    return {
+        id: item.id,
+        title: item.title,
+        level: item.level,
+        description: item.description,
+    };
+}
+function getSiblings(entry, doc) {
+    // Get the parent's children (or root items if no parent)
+    const parent = entry.parents[entry.parents.length - 1];
+    const siblingList = parent?.children ?? doc.items;
+    return siblingList
+        .filter((s) => s.id !== entry.item.id)
+        .map((s) => ({
+        id: s.id,
+        title: s.title,
+        status: s.status,
+    }));
+}
+export async function assembleTaskBrief(store, taskId, options) {
+    const doc = await store.loadDocument();
+    const config = await store.loadConfig();
+    const excludeIds = options?.excludeTaskIds;
+    let entry;
+    if (taskId) {
+        entry = findItem(doc.items, taskId);
+        if (!entry) {
+            throw new Error(`Task not found: ${taskId}`);
+        }
+        if (NON_ACTIONABLE_STATUSES.has(entry.item.status)) {
+            throw new TaskNotActionableError(taskId, entry.item.status, buildSuggestion(entry.item.status, taskId), entry.item.title);
+        }
+    }
+    else {
+        const completedIds = collectCompletedIds(doc.items);
+        // When excluding stuck tasks, treat them as completed so findNextTask skips them
+        const skipIds = excludeIds
+            ? new Set([...completedIds, ...excludeIds])
+            : completedIds;
+        const epicId = options?.epicId;
+        if (epicId) {
+            // Epic filter active: get all actionable tasks and filter to epic
+            const epicTaskIds = collectEpicTaskIds(doc.items, epicId);
+            const allActionable = findActionableTasks(doc.items, skipIds, Infinity);
+            // Filter to tasks within the epic and not in excludeIds
+            const epicActionable = allActionable.filter((e) => epicTaskIds.has(e.item.id) && !excludeIds?.has(e.item.id));
+            if (epicActionable.length === 0) {
+                throw new Error("No actionable tasks found in epic");
+            }
+            // findActionableTasks already sorts by priority, so first is best
+            entry = epicActionable[0];
+        }
+        else {
+            // No epic filter: use standard findNextTask
+            entry = findNextTask(doc.items, skipIds);
+            if (!entry) {
+                throw new Error("No actionable tasks found in PRD");
+            }
+        }
+    }
+    let workflow = "";
+    try {
+        workflow = await store.loadWorkflow();
+    }
+    catch {
+        // No workflow file
+    }
+    const recentLog = await store.readLog(20);
+    const project = {
+        name: config.project,
+        validateCommand: config.validate,
+        testCommand: config.test,
+    };
+    const brief = {
+        task: itemToTaskBrief(entry.item),
+        parentChain: entry.parents.map(itemToParent),
+        siblings: getSiblings(entry, doc),
+        project,
+        workflow,
+        recentLog: recentLog.map((e) => ({
+            timestamp: e.timestamp,
+            event: e.event,
+            detail: e.detail,
+        })),
+    };
+    return { brief, taskId: entry.item.id };
+}
+export async function getActionableTasks(store, limit = 20) {
+    const doc = await store.loadDocument();
+    const completedIds = collectCompletedIds(doc.items);
+    const entries = findActionableTasks(doc.items, completedIds, limit);
+    return entries.map((e) => ({
+        id: e.item.id,
+        title: e.item.title,
+        level: e.item.level,
+        priority: e.item.priority ?? "medium",
+        parentChain: e.parents.map((p) => p.title).join(" > "),
+    }));
+}
+export function formatTaskBrief(brief) {
+    const sections = [];
+    // Task
+    sections.push("## Current Task");
+    sections.push(`**${brief.task.title}** (${brief.task.level})`);
+    sections.push(`ID: ${brief.task.id}`);
+    sections.push(`Status: ${brief.task.status}`);
+    if (brief.task.priority)
+        sections.push(`Priority: ${brief.task.priority}`);
+    if (brief.task.blockedBy?.length) {
+        sections.push(`Blocked by: ${brief.task.blockedBy.join(", ")}`);
+    }
+    if (brief.task.description)
+        sections.push(`\nDescription:\n${brief.task.description}`);
+    if (brief.task.acceptanceCriteria?.length) {
+        sections.push("\nAcceptance Criteria:");
+        for (const c of brief.task.acceptanceCriteria) {
+            sections.push(`- ${c}`);
+        }
+    }
+    if (brief.task.tags?.length) {
+        sections.push(`Tags: ${brief.task.tags.join(", ")}`);
+    }
+    // Parent chain
+    if (brief.parentChain.length > 0) {
+        sections.push("\n## Context (Parent Chain)");
+        for (const p of brief.parentChain) {
+            sections.push(`- **${p.title}** (${p.level})`);
+            if (p.description)
+                sections.push(`  ${p.description}`);
+        }
+    }
+    // Siblings
+    if (brief.siblings.length > 0) {
+        sections.push("\n## Sibling Tasks");
+        for (const s of brief.siblings) {
+            const marker = s.status === "completed" ? "[x]" : "[ ]";
+            sections.push(`- ${marker} ${s.title} (${s.status})`);
+        }
+    }
+    // Project
+    sections.push("\n## Project");
+    sections.push(`Name: ${brief.project.name}`);
+    if (brief.project.validateCommand) {
+        sections.push(`Validate: \`${brief.project.validateCommand}\``);
+    }
+    if (brief.project.testCommand) {
+        sections.push(`Test: \`${brief.project.testCommand}\``);
+    }
+    // Workflow
+    if (brief.workflow) {
+        sections.push("\n## Workflow");
+        sections.push(brief.workflow);
+    }
+    // Recent log
+    if (brief.recentLog.length > 0) {
+        sections.push("\n## Recent Activity");
+        for (const entry of brief.recentLog.slice(-10)) {
+            const line = entry.detail
+                ? `- [${entry.timestamp}] ${entry.event}: ${entry.detail}`
+                : `- [${entry.timestamp}] ${entry.event}`;
+            sections.push(line);
+        }
+    }
+    return sections.join("\n");
+}
+//# sourceMappingURL=brief.js.map