attocode 0.2.3 → 0.2.5

package/dist/src/integrations/tasks/task-splitter.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"task-splitter.d.ts","sourceRoot":"","sources":["../../../../src/integrations/tasks/task-splitter.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,OAAO,KAAK,EAEV,gBAAgB,EAChB,kBAAkB,EAClB,wBAAwB,EACzB,MAAM,uBAAuB,CAAC;AAM/B,MAAM,WAAW,6BAA6B;IAC5C,KAAK,EAAE,OAAO,CAAC;IACf,MAAM,EAAE,MAAM,EAAE,CAAC;IACjB,QAAQ,EAAE,MAAM,EAAE,CAAC;CACpB;AAED;;;;;;;GAOG;AACH,wBAAgB,qBAAqB,CAAC,MAAM,EAAE,wBAAwB,GAAG,6BAA6B,CA+DrG;AAMD;;GAEG;AACH,wBAAgB,yBAAyB,CACvC,IAAI,EAAE,MAAM,EACZ,OAAO,EAAE,gBAAgB,GACxB,MAAM,CAmCR;AAiDD;;;;;;;GAOG;AACH,wBAAgB,UAAU,CAAC,OAAO,EAAE,MAAM,GAAG,MAAM,CA0BlD;AAMD;;;;;;;GAOG;AACH,wBAAgB,kCAAkC,CAAC,QAAQ,EAAE,MAAM,GAAG,kBAAkB,GAAG,IAAI,CAoD9F;AAkKD;;;;;;;;;GASG;AACH,wBAAgB,0BAA0B,CAAC,QAAQ,EAAE,MAAM,GAAG,kBAAkB,CA+F/E"}

package/dist/src/integrations/tasks/task-splitter.js

@@ -0,0 +1,537 @@
+/**
+ * Task Splitter — LLM-driven splitting logic for task decomposition.
+ *
+ * Extracted from smart-decomposer.ts (Phase 3e).
+ * Contains: prompt building, response parsing, JSON repair,
+ * natural language extraction, and decomposition validation.
+ */
+/**
+ * F5: Validate a decomposition result for structural correctness, feasibility, and granularity.
+ *
+ * Checks:
+ * 1. Structural: no cycles, valid dependency refs, each subtask has description
+ * 2. Feasibility: referenced files exist (warning only)
+ * 3. Granularity: no subtask complexity > 7 (should split further)
+ */
+export function validateDecomposition(result) {
+    const issues = [];
+    const warnings = [];
+    const taskIds = new Set(result.subtasks.map(s => s.id));
+    // 1. Structural checks
+    // Cycle detection
+    if (result.dependencyGraph.cycles.length > 0) {
+        for (const cycle of result.dependencyGraph.cycles) {
+            issues.push(`Dependency cycle detected: ${cycle.join(' \u2192 ')}`);
+        }
+    }
+    // Valid dependency references
+    for (const subtask of result.subtasks) {
+        for (const dep of subtask.dependencies) {
+            if (!taskIds.has(dep)) {
+                issues.push(`Task ${subtask.id} references non-existent dependency: ${dep}`);
+            }
+            if (dep === subtask.id) {
+                issues.push(`Task ${subtask.id} depends on itself`);
+            }
+        }
+        // Each subtask must have a meaningful description
+        if (!subtask.description || subtask.description.trim().length < 5) {
+            issues.push(`Task ${subtask.id} has empty or trivial description`);
+        }
+    }
+    // 2. Feasibility: check if referenced files exist (warnings only — files may be created by earlier tasks)
+    for (const subtask of result.subtasks) {
+        if (subtask.relevantFiles) {
+            for (const file of subtask.relevantFiles) {
+                try {
+                    const fs = require('node:fs');
+                    const path = require('node:path');
+                    if (!fs.existsSync(path.resolve(file))) {
+                        warnings.push(`Task ${subtask.id} references non-existent file: ${file}`);
+                    }
+                }
+                catch {
+                    // Can't check — skip
+                }
+            }
+        }
+    }
+    // 3. Granularity: flag overly complex subtasks
+    for (const subtask of result.subtasks) {
+        if (subtask.complexity > 7) {
+            warnings.push(`Task ${subtask.id} has complexity ${subtask.complexity} (>7) — consider splitting further`);
+        }
+    }
+    // Additional structural check: at least 2 subtasks
+    if (result.subtasks.length < 2) {
+        issues.push(`Decomposition produced only ${result.subtasks.length} subtask(s) — too few for swarm mode`);
+    }
+    return {
+        valid: issues.length === 0,
+        issues,
+        warnings,
+    };
+}
+// =============================================================================
+// PROMPT BUILDING
+// =============================================================================
+/**
+ * Create an LLM prompt for task decomposition.
+ */
+export function createDecompositionPrompt(task, context) {
+    const parts = [
+        'You are a task decomposition expert. Break down the following task into subtasks.',
+        '',
+        `Task: ${task}`,
+        '',
+    ];
+    if (context.repoMap) {
+        parts.push('Codebase context:');
+        parts.push(`- ${context.repoMap.chunks.size} files`);
+        parts.push(`- Entry points: ${context.repoMap.entryPoints.slice(0, 3).join(', ')}`);
+        parts.push('');
+    }
+    if (context.hints && context.hints.length > 0) {
+        parts.push('Hints:');
+        for (const hint of context.hints) {
+            parts.push(`- ${hint}`);
+        }
+        parts.push('');
+    }
+    parts.push('For each subtask, provide:');
+    parts.push('1. Description');
+    parts.push('2. Type (research, analysis, design, implement, test, refactor, review, document, integrate, deploy, merge)');
+    parts.push('3. Complexity (1-10)');
+    parts.push('4. Dependencies (which other subtasks must complete first)');
+    parts.push('5. Whether it can run in parallel with other tasks');
+    parts.push('');
+    parts.push('Also suggest an overall strategy: sequential, parallel, hierarchical, adaptive, or pipeline.');
+    parts.push('');
+    parts.push('Respond in JSON format.');
+    return parts.join('\n');
+}
+// =============================================================================
+// JSON REPAIR
+// =============================================================================
+/**
+ * Normalize a raw subtask object from JSON into a consistent shape.
+ */
+function normalizeSubtask(s) {
+    return {
+        description: s.description || s.desc || s.title || s.name || '',
+        type: s.type || s.task_type || s.category || 'implement',
+        complexity: s.complexity || s.difficulty || 3,
+        dependencies: s.dependencies || s.deps || s.depends_on || [],
+        parallelizable: s.parallelizable ?? s.parallel ?? true,
+        relevantFiles: s.relevantFiles || s.relevant_files || s.files,
+        suggestedRole: s.suggestedRole || s.suggested_role || s.role,
+    };
+}
+/**
+ * Try to extract subtasks from a parsed JSON object/array.
+ * Returns null if the structure doesn't contain usable subtask data.
+ */
+function extractSubtasksFromParsed(parsed) {
+    // Handle array-at-root: some models return [{...}, {...}] instead of {"subtasks": [...]}
+    if (Array.isArray(parsed)) {
+        parsed = { subtasks: parsed, strategy: 'adaptive', reasoning: '(array-at-root)' };
+    }
+    // Normalize alternative key names: tasks, steps, task_list -> subtasks
+    const subtasksArray = parsed.subtasks
+        ?? parsed.tasks
+        ?? parsed.steps
+        ?? parsed.task_list
+        ?? parsed.decomposition;
+    if (!subtasksArray || !Array.isArray(subtasksArray) || subtasksArray.length === 0) {
+        return null;
+    }
+    return {
+        subtasks: subtasksArray.map(normalizeSubtask),
+        strategy: parsed.strategy || 'adaptive',
+        reasoning: parsed.reasoning || '',
+    };
+}
+/**
+ * Layer 1: Lenient JSON repair.
+ * Fixes common LLM JSON mistakes before parsing:
+ * - Trailing commas before ] and }
+ * - JS-style comments (// and block comments)
+ * - Single-quoted strings -> double-quoted
+ * - Unquoted object keys
+ */
+export function repairJSON(jsonStr) {
+    let s = jsonStr;
+    // Strip JS-style line comments (// ...) outside strings
+    s = s.replace(/("(?:[^"\\]|\\.)*")|\/\/[^\n]*/g, (_match, str) => str ?? '');
+    // Strip JS-style block comments outside strings
+    s = s.replace(/("(?:[^"\\]|\\.)*")|\/\*[\s\S]*?\*\//g, (_match, str) => str ?? '');
+    // Replace single-quoted strings with double-quoted (outside existing double-quoted strings)
+    s = s.replace(/("(?:[^"\\]|\\.)*")|'((?:[^'\\]|\\.)*)'/g, (_match, dq, sq) => {
+        if (dq)
+            return dq; // Already double-quoted, keep as-is
+        const escaped = sq.replace(/(?<!\\)"/g, '\\"');
+        return `"${escaped}"`;
+    });
+    // Fix unquoted object keys: { key: "value" } -> { "key": "value" }
+    s = s.replace(/("(?:[^"\\]|\\.)*")|\b([a-zA-Z_][a-zA-Z0-9_]*)\s*:/g, (match, str, key) => {
+        if (str)
+            return match; // Inside a string, keep as-is
+        return `"${key}":`;
+    });
+    // Strip trailing commas before ] and }
+    s = s.replace(/,\s*([}\]])/g, '$1');
+    return s;
+}
+// =============================================================================
+// NATURAL LANGUAGE EXTRACTION
+// =============================================================================
+/**
+ * Layer 2: Extract subtasks from natural language (numbered/bulleted lists).
+ * Handles formats like:
+ * - "1. Description" / "1) Description"
+ * - "- Description" / "* Description"
+ * - "Task 1: Description" / "Step 1: Description"
+ * - "- [ ] Description" / "- [x] Description" (markdown task lists)
+ */
+export function extractSubtasksFromNaturalLanguage(response) {
+    const items = [];
+    // Try markdown task lists first: - [ ] Task / - [x] Task
+    const taskListPattern = /^[ \t]*[-*]\s*\[[ x]\]\s+(.+)$/gm;
+    let match;
+    while ((match = taskListPattern.exec(response)) !== null) {
+        const desc = match[1].trim();
+        if (desc.length > 5)
+            items.push(desc);
+    }
+    if (items.length >= 2)
+        return buildSubtasksFromList(items);
+    // Try numbered lists: 1. Desc / 1) Desc / 1: Desc
+    items.length = 0;
+    const numberedPattern = /^[ \t]*\d+[.):\-]\s+(.+)$/gm;
+    while ((match = numberedPattern.exec(response)) !== null) {
+        const desc = match[1].trim();
+        if (desc.length > 5)
+            items.push(desc);
+    }
+    if (items.length >= 2)
+        return buildSubtasksFromList(items);
+    // Try bulleted lists: - Desc / * Desc (but not markdown task lists already tried)
+    items.length = 0;
+    const bulletPattern = /^[ \t]*[-*]\s+(?!\[[ x]\])(.+)$/gm;
+    while ((match = bulletPattern.exec(response)) !== null) {
+        const desc = match[1].trim();
+        if (desc.length > 5)
+            items.push(desc);
+    }
+    if (items.length >= 2)
+        return buildSubtasksFromList(items);
+    // Try "Task N:" / "Step N:" / "Subtask N:" style headers
+    items.length = 0;
+    const headerPattern = /^[ \t]*(?:task|step|subtask|phase)\s*\d+[:.]\s*(.+)$/gim;
+    while ((match = headerPattern.exec(response)) !== null) {
+        const desc = match[1].trim();
+        if (desc.length > 5)
+            items.push(desc);
+    }
+    if (items.length >= 2)
+        return buildSubtasksFromList(items);
+    // Try markdown headers: ## Subtask 1 / ### Step: Description
+    items.length = 0;
+    const mdHeaderPattern = /^#{2,4}\s+(?:(?:subtask|step|task|phase)\s*\d*[:.]*\s*)?(.+)$/gim;
+    while ((match = mdHeaderPattern.exec(response)) !== null) {
+        const desc = match[1].trim();
+        // Skip generic headers like "Summary", "Strategy", "Overview"
+        if (desc.length > 5 && !/^(summary|strategy|overview|reasoning|conclusion|notes?)$/i.test(desc)) {
+            items.push(desc);
+        }
+    }
+    if (items.length >= 2)
+        return buildSubtasksFromList(items);
+    return null;
+}
+/**
+ * Build an LLMDecomposeResult from a flat list of description strings.
+ * Assigns sequential dependencies and infers task type from keywords.
+ */
+function buildSubtasksFromList(items) {
+    const TYPE_KEYWORDS = {
+        research: ['research', 'investigate', 'explore', 'analyze', 'understand', 'study', 'review existing'],
+        design: ['design', 'plan', 'architect', 'schema', 'structure'],
+        test: ['test', 'verify', 'validate', 'assert', 'check'],
+        refactor: ['refactor', 'clean up', 'reorganize', 'simplify'],
+        document: ['document', 'readme', 'docs', 'comment'],
+        integrate: ['integrate', 'wire', 'connect', 'combine', 'merge'],
+        deploy: ['deploy', 'release', 'publish', 'ship'],
+    };
+    return {
+        subtasks: items.map((desc, i) => {
+            const lower = desc.toLowerCase();
+            let type = 'implement';
+            for (const [t, keywords] of Object.entries(TYPE_KEYWORDS)) {
+                if (keywords.some(k => lower.includes(k))) {
+                    type = t;
+                    break;
+                }
+            }
+            return {
+                description: desc,
+                type,
+                complexity: 3,
+                dependencies: i > 0 ? [String(i - 1)] : [],
+                parallelizable: i === 0 || type === 'research' || type === 'test',
+            };
+        }),
+        strategy: 'sequential',
+        reasoning: '(extracted from natural language list)',
+    };
+}
+// =============================================================================
+// TRUNCATED JSON RECOVERY
+// =============================================================================
+/**
+ * Layer 3: Last-ditch single mega-task extraction.
+ * If there's meaningful text but no structure could be found,
+ * wrap the response as a single "implement" subtask so the swarm
+ * has something to work with rather than aborting entirely.
+ */
+function extractMegaTask(response) {
+    // Strip code blocks, JSON fragments, and whitespace to get prose content
+    const prose = response
+        .replace(/```[\s\S]*?```/g, '')
+        .replace(/\{[\s\S]*?\}/g, '')
+        .replace(/\[[\s\S]*?\]/g, '')
+        .trim();
+    // Only create mega-task if there's substantial text (not just JSON garbage)
+    if (prose.length < 20)
+        return null;
+    const desc = prose.length > 200
+        ? prose.slice(0, 200).replace(/\s+\S*$/, '') + '...'
+        : prose;
+    return {
+        subtasks: [{
+                description: desc,
+                type: 'implement',
+                complexity: 5,
+                dependencies: [],
+                parallelizable: false,
+            }],
+        strategy: 'adaptive',
+        reasoning: '(single mega-task — parser could not extract structured subtasks)',
+    };
+}
+/**
+ * Attempt to recover a truncated JSON response by trimming incomplete trailing
+ * content and adding missing closing brackets/braces.
+ *
+ * Works for the common case where the LLM output was cut off mid-JSON-array,
+ * e.g.: `{"subtasks": [ {...}, {...}, {"desc` -> trim last incomplete object -> close array & object.
+ */
+function tryRecoverTruncatedJSON(response) {
+    // Extract JSON portion (from code block or raw)
+    let jsonStr;
+    const codeBlockMatch = response.match(/```(?:json)?\s*\n?([\s\S]*)/);
+    if (codeBlockMatch) {
+        // No closing ``` required — that's the truncation
+        jsonStr = codeBlockMatch[1].replace(/```\s*$/, '').trim();
+    }
+    if (!jsonStr) {
+        const jsonMatch = response.match(/\{[\s\S]*/);
+        if (jsonMatch)
+            jsonStr = jsonMatch[0].trim();
+    }
+    if (!jsonStr)
+        return null;
+    // Find the last complete JSON object in the subtasks array.
+    // Strategy: find last `}` that closes a complete array element, trim there, close brackets.
+    // We search backwards for `},` or `}\n` patterns that likely end a complete subtask object.
+    let lastGoodPos = -1;
+    let braceDepth = 0;
+    let bracketDepth = 0;
+    let inString = false;
+    let escape = false;
+    for (let i = 0; i < jsonStr.length; i++) {
+        const ch = jsonStr[i];
+        if (escape) {
+            escape = false;
+            continue;
+        }
+        if (ch === '\\' && inString) {
+            escape = true;
+            continue;
+        }
+        if (ch === '"') {
+            inString = !inString;
+            continue;
+        }
+        if (inString)
+            continue;
+        if (ch === '{')
+            braceDepth++;
+        else if (ch === '}') {
+            braceDepth--;
+            // When we close an object at brace depth 1 (inside the top-level object),
+            // this is likely a complete subtask object inside the array
+            if (braceDepth === 1 && bracketDepth === 1) {
+                lastGoodPos = i;
+            }
+        }
+        else if (ch === '[')
+            bracketDepth++;
+        else if (ch === ']')
+            bracketDepth--;
+    }
+    if (lastGoodPos === -1)
+        return null;
+    // Trim to last complete subtask object, then close the JSON structure
+    let trimmed = jsonStr.slice(0, lastGoodPos + 1);
+    // Remove trailing comma if present
+    trimmed = trimmed.replace(/,\s*$/, '');
+    // Close open brackets: we need to close the subtasks array and the root object
+    // Count what's still open
+    let openBraces = 0;
+    let openBrackets = 0;
+    inString = false;
+    escape = false;
+    for (let i = 0; i < trimmed.length; i++) {
+        const ch = trimmed[i];
+        if (escape) {
+            escape = false;
+            continue;
+        }
+        if (ch === '\\' && inString) {
+            escape = true;
+            continue;
+        }
+        if (ch === '"') {
+            inString = !inString;
+            continue;
+        }
+        if (inString)
+            continue;
+        if (ch === '{')
+            openBraces++;
+        else if (ch === '}')
+            openBraces--;
+        else if (ch === '[')
+            openBrackets++;
+        else if (ch === ']')
+            openBrackets--;
+    }
+    // Close remaining open structures
+    for (let i = 0; i < openBrackets; i++)
+        trimmed += ']';
+    for (let i = 0; i < openBraces; i++)
+        trimmed += '}';
+    return trimmed;
+}
+// =============================================================================
+// MAIN PARSE FUNCTION
+// =============================================================================
+/**
+ * Parse LLM response into decomposition result.
+ *
+ * Uses progressive fallback layers to handle messy LLM output:
+ * 1. Standard JSON extraction (code blocks, raw JSON)
+ * 2. Lenient JSON repair (trailing commas, comments, single quotes, unquoted keys)
+ * 3. Truncated JSON recovery (missing closing brackets)
+ * 4. Natural language extraction (numbered/bulleted lists, markdown task lists)
+ * 5. Single mega-task fallback (wrap prose as one subtask)
+ */
+export function parseDecompositionResponse(response) {
+    if (!response || response.trim().length === 0) {
+        return {
+            subtasks: [],
+            strategy: 'adaptive',
+            reasoning: '',
+            parseError: 'Empty response from LLM',
+        };
+    }
+    // -- Step 1: Extract JSON string (code block or raw) --
+    let jsonStr;
+    const codeBlockMatch = response.match(/```(?:json)?\s*\n?([\s\S]*?)```/);
+    if (codeBlockMatch) {
+        jsonStr = codeBlockMatch[1].trim();
+    }
+    if (!jsonStr) {
+        // If the response starts with `[`, try array regex first to avoid
+        // \{[\s\S]*\} greedily matching across multiple objects in the array
+        const trimmed = response.trim();
+        const jsonMatch = trimmed.startsWith('[')
+            ? (response.match(/\[[\s\S]*\]/) || response.match(/\{[\s\S]*\}/))
+            : (response.match(/\{[\s\S]*\}/) || response.match(/\[[\s\S]*\]/));
+        if (jsonMatch)
+            jsonStr = jsonMatch[0];
+    }
+    // -- Step 2: Try strict JSON parse --
+    if (jsonStr) {
+        try {
+            const parsed = JSON.parse(jsonStr);
+            const result = extractSubtasksFromParsed(parsed);
+            if (result)
+                return result;
+        }
+        catch {
+            // Strict parse failed — continue to lenient repair
+        }
+        // -- Step 3: Lenient JSON repair + parse --
+        try {
+            const repaired = repairJSON(jsonStr);
+            const parsed = JSON.parse(repaired);
+            const result = extractSubtasksFromParsed(parsed);
+            if (result) {
+                result.reasoning = result.reasoning
+                    ? result.reasoning + ' (repaired JSON)'
+                    : '(repaired JSON)';
+                return result;
+            }
+        }
+        catch {
+            // Repaired parse also failed — continue to truncation recovery
+        }
+    }
+    // -- Step 4: Truncated JSON recovery --
+    const recovered = tryRecoverTruncatedJSON(response);
+    if (recovered) {
+        try {
+            const parsed = JSON.parse(recovered);
+            const result = extractSubtasksFromParsed(parsed);
+            if (result) {
+                result.reasoning = result.reasoning
+                    ? result.reasoning + ' (recovered from truncated response)'
+                    : '(recovered from truncated response)';
+                return result;
+            }
+        }
+        catch {
+            // Truncation recovery also failed — try repaired version
+            try {
+                const repairedRecovered = repairJSON(recovered);
+                const parsed = JSON.parse(repairedRecovered);
+                const result = extractSubtasksFromParsed(parsed);
+                if (result) {
+                    result.reasoning = '(recovered from truncated + repaired JSON)';
+                    return result;
+                }
+            }
+            catch {
+                // All JSON approaches exhausted
+            }
+        }
+    }
+    // -- Step 5: Natural language extraction --
+    const nlResult = extractSubtasksFromNaturalLanguage(response);
+    if (nlResult)
+        return nlResult;
+    // -- Step 6: Single mega-task fallback --
+    const megaResult = extractMegaTask(response);
+    if (megaResult)
+        return megaResult;
+    // -- Truly nothing worked --
+    return {
+        subtasks: [],
+        strategy: 'adaptive',
+        reasoning: '',
+        parseError: `All parse strategies failed. First 200 chars: ${response.slice(0, 200)}`,
+    };
+}
+//# sourceMappingURL=task-splitter.js.map

package/dist/src/integrations/tasks/task-splitter.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"task-splitter.js","sourceRoot":"","sources":["../../../../src/integrations/tasks/task-splitter.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAmBH;;;;;;;GAOG;AACH,MAAM,UAAU,qBAAqB,CAAC,MAAgC;IACpE,MAAM,MAAM,GAAa,EAAE,CAAC;IAC5B,MAAM,QAAQ,GAAa,EAAE,CAAC;IAC9B,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAExD,uBAAuB;IACvB,kBAAkB;IAClB,IAAI,MAAM,CAAC,eAAe,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC7C,KAAK,MAAM,KAAK,IAAI,MAAM,CAAC,eAAe,CAAC,MAAM,EAAE,CAAC;YAClD,MAAM,CAAC,IAAI,CAAC,8BAA8B,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC;QACtE,CAAC;IACH,CAAC;IAED,8BAA8B;IAC9B,KAAK,MAAM,OAAO,IAAI,MAAM,CAAC,QAAQ,EAAE,CAAC;QACtC,KAAK,MAAM,GAAG,IAAI,OAAO,CAAC,YAAY,EAAE,CAAC;YACvC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;gBACtB,MAAM,CAAC,IAAI,CAAC,QAAQ,OAAO,CAAC,EAAE,wCAAwC,GAAG,EAAE,CAAC,CAAC;YAC/E,CAAC;YACD,IAAI,GAAG,KAAK,OAAO,CAAC,EAAE,EAAE,CAAC;gBACvB,MAAM,CAAC,IAAI,CAAC,QAAQ,OAAO,CAAC,EAAE,oBAAoB,CAAC,CAAC;YACtD,CAAC;QACH,CAAC;QACD,kDAAkD;QAClD,IAAI,CAAC,OAAO,CAAC,WAAW,IAAI,OAAO,CAAC,WAAW,CAAC,IAAI,EAAE,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAClE,MAAM,CAAC,IAAI,CAAC,QAAQ,OAAO,CAAC,EAAE,mCAAmC,CAAC,CAAC;QACrE,CAAC;IACH,CAAC;IAED,0GAA0G;IAC1G,KAAK,MAAM,OAAO,IAAI,MAAM,CAAC,QAAQ,EAAE,CAAC;QACtC,IAAI,OAAO,CAAC,aAAa,EAAE,CAAC;YAC1B,KAAK,MAAM,IAAI,IAAI,OAAO,CAAC,aAAa,EAAE,CAAC;gBACzC,IAAI,CAAC;oBACH,MAAM,EAAE,GAAG,OAAO,CAAC,SAAS,CAAC,CAAC;oBAC9B,MAAM,IAAI,GAAG,OAAO,CAAC,WAAW,CAAC,CAAC;oBAClC,IAAI,CAAC,EAAE,CAAC,UAAU,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC;wBACvC,QAAQ,CAAC,IAAI,CAAC,QAAQ,OAAO,CAAC,EAAE,kCAAkC,IAAI,EAAE,CAAC,CAAC;oBAC5E,CAAC;gBACH,CAAC;gBAAC,MAAM,CAAC;oBACP,qBAAqB;gBACvB,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAED,+CAA+C;IAC/C,KAAK,MAAM,OAAO,IAAI,MAAM,CAAC,QAAQ,EAAE,CAAC;QACtC,IAAI,OAAO,CAAC,UAAU,GAAG,CAAC,EAAE,CAAC;YAC3B,QAAQ,CAAC,IAAI,CAAC,QAAQ,OAAO,CAAC,EAAE,mBAAmB,OAAO,CAAC,UAAU,oCAAoC,CAAC,CAAC;QAC7G,CAAC;IACH,CAAC;IAED,mDAAmD;IACnD,IAAI,MAAM,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC/B,MAAM,CAAC,IAAI,CAAC,+BAA+B,MAAM,CAAC,QAAQ,CAAC,MAAM,sCAAsC,CAAC,CAAC;IAC3G,CAAC;IAED,OAAO;QACL,KAAK,EAAE,MAAM,CAAC,MAAM,KAAK,CAAC;QAC1B,MAAM;QACN,QAAQ;KACT,CAAC;AACJ,CAAC;AAED,gFAAgF;AAChF,kBAAkB;AAClB,gFAAgF;AAEhF;;GAEG;AACH,MAAM,UAAU,yBAAyB,CACvC,IAAY,EACZ,OAAyB;IAEzB,MAAM,KAAK,GAAG;QACZ,mFAAmF;QACnF,EAAE;QACF,SAAS,IAAI,EAAE;QACf,EAAE;KACH,CAAC;IAEF,IAAI,OAAO,CAAC,OAAO,EAAE,CAAC;QACpB,KAAK,CAAC,IAAI,CAAC,mBAAmB,CAAC,CAAC;QAChC,KAAK,CAAC,IAAI,CAAC,KAAK,OAAO,CAAC,OAAO,CAAC,MAAM,CAAC,IAAI,QAAQ,CAAC,CAAC;QACrD,KAAK,CAAC,IAAI,CAAC,mBAAmB,OAAO,CAAC,OAAO,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACpF,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACjB,CAAC;IAED,IAAI,OAAO,CAAC,KAAK,IAAI,OAAO,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC9C,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QACrB,KAAK,MAAM,IAAI,IAAI,OAAO,CAAC,KAAK,EAAE,CAAC;YACjC,KAAK,CAAC,IAAI,CAAC,KAAK,IAAI,EAAE,CAAC,CAAC;QAC1B,CAAC;QACD,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACjB,CAAC;IAED,KAAK,CAAC,IAAI,CAAC,4BAA4B,CAAC,CAAC;IACzC,KAAK,CAAC,IAAI,CAAC,gBAAgB,CAAC,CAAC;IAC7B,KAAK,CAAC,IAAI,CAAC,6GAA6G,CAAC,CAAC;IAC1H,KAAK,CAAC,IAAI,CAAC,sBAAsB,CAAC,CAAC;IACnC,KAAK,CAAC,IAAI,CAAC,4DAA4D,CAAC,CAAC;IACzE,KAAK,CAAC,IAAI,CAAC,oDAAoD,CAAC,CAAC;IACjE,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACf,KAAK,CAAC,IAAI,CAAC,8FAA8F,CAAC,CAAC;IAC3G,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACf,KAAK,CAAC,IAAI,CAAC,yBAAyB,CAAC,CAAC;IAEtC,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AAC1B,CAAC;AAED,gFAAgF;AAChF,cAAc;AACd,gFAAgF;AAEhF;;GAEG;AACH,SAAS,gBAAgB,CAAC,CAAM;IAC9B,OAAO;QACL,WAAW,EAAE,CAAC,CAAC,WAAW,IAAI,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,IAAI,IAAI,EAAE;QAC/D,IAAI,EAAE,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,SAAS,IAAI,CAAC,CAAC,QAAQ,IAAI,WAAW;QACxD,UAAU,EAAE,CAAC,CAAC,UAAU,IAAI,CAAC,CAAC,UAAU,IAAI,CAAC;QAC7C,YAAY,EAAE,CAAC,CAAC,YAAY,IAAI,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,UAAU,IAAI,EAAE;QAC5D,cAAc,EAAE,CAAC,CAAC,cAAc,IAAI,CAAC,CAAC,QAAQ,IAAI,IAAI;QACtD,aAAa,EAAE,CAAC,CAAC,aAAa,IAAI,CAAC,CAAC,cAAc,IAAI,CAAC,CAAC,KAAK;QAC7D,aAAa,EAAE,CAAC,CAAC,aAAa,IAAI,CAAC,CAAC,cAAc,IAAI,CAAC,CAAC,IAAI;KAC7D,CAAC;AACJ,CAAC;AAED;;;GAGG;AACH,SAAS,yBAAyB,CAAC,MAAW;IAC5C,yFAAyF;IACzF,IAAI,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC;QAC1B,MAAM,GAAG,EAAE,QAAQ,EAAE,MAAM,EAAE,QAAQ,EAAE,UAAU,EAAE,SAAS,EAAE,iBAAiB,EAAE,CAAC;IACpF,CAAC;IAED,uEAAuE;IACvE,MAAM,aAAa,GAAG,MAAM,CAAC,QAAQ;WAChC,MAAM,CAAC,KAAK;WACZ,MAAM,CAAC,KAAK;WACZ,MAAM,CAAC,SAAS;WAChB,MAAM,CAAC,aAAa,CAAC;IAE1B,IAAI,CAAC,aAAa,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,aAAa,CAAC,IAAI,aAAa,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAClF,OAAO,IAAI,CAAC;IACd,CAAC;IAED,OAAO;QACL,QAAQ,EAAE,aAAa,CAAC,GAAG,CAAC,gBAAgB,CAAC;QAC7C,QAAQ,EAAE,MAAM,CAAC,QAAQ,IAAI,UAAU;QACvC,SAAS,EAAE,MAAM,CAAC,SAAS,IAAI,EAAE;KAClC,CAAC;AACJ,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,UAAU,CAAC,OAAe;IACxC,IAAI,CAAC,GAAG,OAAO,CAAC;IAEhB,wDAAwD;IACxD,CAAC,GAAG,CAAC,CAAC,OAAO,CAAC,iCAAiC,EAAE,CAAC,MAAM,EAAE,GAAG,EAAE,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,CAAC;IAE7E,gDAAgD;IAChD,CAAC,GAAG,CAAC,CAAC,OAAO,CAAC,uCAAuC,EAAE,CAAC,MAAM,EAAE,GAAG,EAAE,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,CAAC;IAEnF,4FAA4F;IAC5F,CAAC,GAAG,CAAC,CAAC,OAAO,CAAC,0CAA0C,EAAE,CAAC,MAAM,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE;QAC3E,IAAI,EAAE;YAAE,OAAO,EAAE,CAAC,CAAC,oCAAoC;QACvD,MAAM,OAAO,GAAG,EAAE,CAAC,OAAO,CAAC,WAAW,EAAE,KAAK,CAAC,CAAC;QAC/C,OAAO,IAAI,OAAO,GAAG,CAAC;IACxB,CAAC,CAAC,CAAC;IAEH,mEAAmE;IACnE,CAAC,GAAG,CAAC,CAAC,OAAO,CAAC,qDAAqD,EAAE,CAAC,KAAK,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE;QACvF,IAAI,GAAG;YAAE,OAAO,KAAK,CAAC,CAAC,8BAA8B;QACrD,OAAO,IAAI,GAAG,IAAI,CAAC;IACrB,CAAC,CAAC,CAAC;IAEH,uCAAuC;IACvC,CAAC,GAAG,CAAC,CAAC,OAAO,CAAC,cAAc,EAAE,IAAI,CAAC,CAAC;IAEpC,OAAO,CAAC,CAAC;AACX,CAAC;AAED,gFAAgF;AAChF,8BAA8B;AAC9B,gFAAgF;AAEhF;;;;;;;GAOG;AACH,MAAM,UAAU,kCAAkC,CAAC,QAAgB;IACjE,MAAM,KAAK,GAAa,EAAE,CAAC;IAE3B,yDAAyD;IACzD,MAAM,eAAe,GAAG,kCAAkC,CAAC;IAC3D,IAAI,KAAK,CAAC;IACV,OAAO,CAAC,KAAK,GAAG,eAAe,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,KAAK,IAAI,EAAE,CAAC;QACzD,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;QAC7B,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC;YAAE,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACxC,CAAC;IACD,IAAI,KAAK,CAAC,MAAM,IAAI,CAAC;QAAE,OAAO,qBAAqB,CAAC,KAAK,CAAC,CAAC;IAE3D,kDAAkD;IAClD,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;IACjB,MAAM,eAAe,GAAG,6BAA6B,CAAC;IACtD,OAAO,CAAC,KAAK,GAAG,eAAe,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,KAAK,IAAI,EAAE,CAAC;QACzD,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;QAC7B,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC;YAAE,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACxC,CAAC;IACD,IAAI,KAAK,CAAC,MAAM,IAAI,CAAC;QAAE,OAAO,qBAAqB,CAAC,KAAK,CAAC,CAAC;IAE3D,kFAAkF;IAClF,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;IACjB,MAAM,aAAa,GAAG,mCAAmC,CAAC;IAC1D,OAAO,CAAC,KAAK,GAAG,aAAa,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,KAAK,IAAI,EAAE,CAAC;QACvD,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;QAC7B,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC;YAAE,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACxC,CAAC;IACD,IAAI,KAAK,CAAC,MAAM,IAAI,CAAC;QAAE,OAAO,qBAAqB,CAAC,KAAK,CAAC,CAAC;IAE3D,yDAAyD;IACzD,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;IACjB,MAAM,aAAa,GAAG,yDAAyD,CAAC;IAChF,OAAO,CAAC,KAAK,GAAG,aAAa,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,KAAK,IAAI,EAAE,CAAC;QACvD,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;QAC7B,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC;YAAE,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACxC,CAAC;IACD,IAAI,KAAK,CAAC,MAAM,IAAI,CAAC;QAAE,OAAO,qBAAqB,CAAC,KAAK,CAAC,CAAC;IAE3D,6DAA6D;IAC7D,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;IACjB,MAAM,eAAe,GAAG,kEAAkE,CAAC;IAC3F,OAAO,CAAC,KAAK,GAAG,eAAe,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,KAAK,IAAI,EAAE,CAAC;QACzD,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;QAC7B,8DAA8D;QAC9D,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,4DAA4D,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;YAChG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACnB,CAAC;IACH,CAAC;IACD,IAAI,KAAK,CAAC,MAAM,IAAI,CAAC;QAAE,OAAO,qBAAqB,CAAC,KAAK,CAAC,CAAC;IAE3D,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;GAGG;AACH,SAAS,qBAAqB,CAAC,KAAe;IAC5C,MAAM,aAAa,GAA6B;QAC9C,QAAQ,EAAE,CAAC,UAAU,EAAE,aAAa,EAAE,SAAS,EAAE,SAAS,EAAE,YAAY,EAAE,OAAO,EAAE,iBAAiB,CAAC;QACrG,MAAM,EAAE,CAAC,QAAQ,EAAE,MAAM,EAAE,WAAW,EAAE,QAAQ,EAAE,WAAW,CAAC;QAC9D,IAAI,EAAE,CAAC,MAAM,EAAE,QAAQ,EAAE,UAAU,EAAE,QAAQ,EAAE,OAAO,CAAC;QACvD,QAAQ,EAAE,CAAC,UAAU,EAAE,UAAU,EAAE,YAAY,EAAE,UAAU,CAAC;QAC5D,QAAQ,EAAE,CAAC,UAAU,EAAE,QAAQ,EAAE,MAAM,EAAE,SAAS,CAAC;QACnD,SAAS,EAAE,CAAC,WAAW,EAAE,MAAM,EAAE,SAAS,EAAE,SAAS,EAAE,OAAO,CAAC;QAC/D,MAAM,EAAE,CAAC,QAAQ,EAAE,SAAS,EAAE,SAAS,EAAE,MAAM,CAAC;KACjD,CAAC;IAEF,OAAO;QACL,QAAQ,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE;YAC9B,MAAM,KAAK,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;YACjC,IAAI,IAAI,GAAgB,WAAW,CAAC;YACpC,KAAK,MAAM,CAAC,CAAC,EAAE,QAAQ,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,aAAa,CAAC,EAAE,CAAC;gBAC1D,IAAI,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;oBAC1C,IAAI,GAAG,CAAgB,CAAC;oBACxB,MAAM;gBACR,CAAC;YACH,CAAC;YACD,OAAO;gBACL,WAAW,EAAE,IAAI;gBACjB,IAAI;gBACJ,UAAU,EAAE,CAAC;gBACb,YAAY,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE;gBAC1C,cAAc,EAAE,CAAC,KAAK,CAAC,IAAI,IAAI,KAAK,UAAU,IAAI,IAAI,KAAK,MAAM;aAClE,CAAC;QACJ,CAAC,CAAC;QACF,QAAQ,EAAE,YAAY;QACtB,SAAS,EAAE,wCAAwC;KACpD,CAAC;AACJ,CAAC;AAED,gFAAgF;AAChF,0BAA0B;AAC1B,gFAAgF;AAEhF;;;;;GAKG;AACH,SAAS,eAAe,CAAC,QAAgB;IACvC,yEAAyE;IACzE,MAAM,KAAK,GAAG,QAAQ;SACnB,OAAO,CAAC,iBAAiB,EAAE,EAAE,CAAC;SAC9B,OAAO,CAAC,eAAe,EAAE,EAAE,CAAC;SAC5B,OAAO,CAAC,eAAe,EAAE,EAAE,CAAC;SAC5B,IAAI,EAAE,CAAC;IAEV,4EAA4E;IAC5E,IAAI,KAAK,CAAC,MAAM,GAAG,EAAE;QAAE,OAAO,IAAI,CAAC;IAEnC,MAAM,IAAI,GAAG,KAAK,CAAC,MAAM,GAAG,GAAG;QAC7B,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,OAAO,CAAC,SAAS,EAAE,EAAE,CAAC,GAAG,KAAK;QACpD,CAAC,CAAC,KAAK,CAAC;IAEV,OAAO;QACL,QAAQ,EAAE,CAAC;gBACT,WAAW,EAAE,IAAI;gBACjB,IAAI,EAAE,WAAW;gBACjB,UAAU,EAAE,CAAC;gBACb,YAAY,EAAE,EAAE;gBAChB,cAAc,EAAE,KAAK;aACtB,CAAC;QACF,QAAQ,EAAE,UAAU;QACpB,SAAS,EAAE,mEAAmE;KAC/E,CAAC;AACJ,CAAC;AAED;;;;;;GAMG;AACH,SAAS,uBAAuB,CAAC,QAAgB;IAC/C,gDAAgD;IAChD,IAAI,OAA2B,CAAC;IAChC,MAAM,cAAc,GAAG,QAAQ,CAAC,KAAK,CAAC,6BAA6B,CAAC,CAAC;IACrE,IAAI,cAAc,EAAE,CAAC;QACnB,kDAAkD;QAClD,OAAO,GAAG,cAAc,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,SAAS,EAAE,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC;IAC5D,CAAC;IACD,IAAI,CAAC,OAAO,EAAE,CAAC;QACb,MAAM,SAAS,GAAG,QAAQ,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC;QAC9C,IAAI,SAAS;YAAE,OAAO,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;IAC/C,CAAC;IACD,IAAI,CAAC,OAAO;QAAE,OAAO,IAAI,CAAC;IAE1B,4DAA4D;IAC5D,4FAA4F;IAC5F,4FAA4F;IAC5F,IAAI,WAAW,GAAG,CAAC,CAAC,CAAC;IACrB,IAAI,UAAU,GAAG,CAAC,CAAC;IACnB,IAAI,YAAY,GAAG,CAAC,CAAC;IACrB,IAAI,QAAQ,GAAG,KAAK,CAAC;IACrB,IAAI,MAAM,GAAG,KAAK,CAAC;IAEnB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACxC,MAAM,EAAE,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;QACtB,IAAI,MAAM,EAAE,CAAC;YAAC,MAAM,GAAG,KAAK,CAAC;YAAC,SAAS;QAAC,CAAC;QACzC,IAAI,EAAE,KAAK,IAAI,IAAI,QAAQ,EAAE,CAAC;YAAC,MAAM,GAAG,IAAI,CAAC;YAAC,SAAS;QAAC,CAAC;QACzD,IAAI,EAAE,KAAK,GAAG,EAAE,CAAC;YAAC,QAAQ,GAAG,CAAC,QAAQ,CAAC;YAAC,SAAS;QAAC,CAAC;QACnD,IAAI,QAAQ;YAAE,SAAS;QAEvB,IAAI,EAAE,KAAK,GAAG;YAAE,UAAU,EAAE,CAAC;aACxB,IAAI,EAAE,KAAK,GAAG,EAAE,CAAC;YACpB,UAAU,EAAE,CAAC;YACb,0EAA0E;YAC1E,4DAA4D;YAC5D,IAAI,UAAU,KAAK,CAAC,IAAI,YAAY,KAAK,CAAC,EAAE,CAAC;gBAC3C,WAAW,GAAG,CAAC,CAAC;YAClB,CAAC;QACH,CAAC;aAAM,IAAI,EAAE,KAAK,GAAG;YAAE,YAAY,EAAE,CAAC;aACjC,IAAI,EAAE,KAAK,GAAG;YAAE,YAAY,EAAE,CAAC;IACtC,CAAC;IAED,IAAI,WAAW,KAAK,CAAC,CAAC;QAAE,OAAO,IAAI,CAAC;IAEpC,sEAAsE;IACtE,IAAI,OAAO,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,WAAW,GAAG,CAAC,CAAC,CAAC;IAChD,mCAAmC;IACnC,OAAO,GAAG,OAAO,CAAC,OAAO,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC;IACvC,+EAA+E;IAC/E,0BAA0B;IAC1B,IAAI,UAAU,GAAG,CAAC,CAAC;IACnB,IAAI,YAAY,GAAG,CAAC,CAAC;IACrB,QAAQ,GAAG,KAAK,CAAC;IACjB,MAAM,GAAG,KAAK,CAAC;IACf,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACxC,MAAM,EAAE,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;QACtB,IAAI,MAAM,EAAE,CAAC;YAAC,MAAM,GAAG,KAAK,CAAC;YAAC,SAAS;QAAC,CAAC;QACzC,IAAI,EAAE,KAAK,IAAI,IAAI,QAAQ,EAAE,CAAC;YAAC,MAAM,GAAG,IAAI,CAAC;YAAC,SAAS;QAAC,CAAC;QACzD,IAAI,EAAE,KAAK,GAAG,EAAE,CAAC;YAAC,QAAQ,GAAG,CAAC,QAAQ,CAAC;YAAC,SAAS;QAAC,CAAC;QACnD,IAAI,QAAQ;YAAE,SAAS;QACvB,IAAI,EAAE,KAAK,GAAG;YAAE,UAAU,EAAE,CAAC;aACxB,IAAI,EAAE,KAAK,GAAG;YAAE,UAAU,EAAE,CAAC;aAC7B,IAAI,EAAE,KAAK,GAAG;YAAE,YAAY,EAAE,CAAC;aAC/B,IAAI,EAAE,KAAK,GAAG;YAAE,YAAY,EAAE,CAAC;IACtC,CAAC;IAED,kCAAkC;IAClC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,YAAY,EAAE,CAAC,EAAE;QAAE,OAAO,IAAI,GAAG,CAAC;IACtD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,EAAE,CAAC,EAAE;QAAE,OAAO,IAAI,GAAG,CAAC;IAEpD,OAAO,OAAO,CAAC;AACjB,CAAC;AAED,gFAAgF;AAChF,sBAAsB;AACtB,gFAAgF;AAEhF;;;;;;;;;GASG;AACH,MAAM,UAAU,0BAA0B,CAAC,QAAgB;IACzD,IAAI,CAAC,QAAQ,IAAI,QAAQ,CAAC,IAAI,EAAE,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC9C,OAAO;YACL,QAAQ,EAAE,EAAE;YACZ,QAAQ,EAAE,UAAU;YACpB,SAAS,EAAE,EAAE;YACb,UAAU,EAAE,yBAAyB;SACtC,CAAC;IACJ,CAAC;IAED,wDAAwD;IACxD,IAAI,OAA2B,CAAC;IAChC,MAAM,cAAc,GAAG,QAAQ,CAAC,KAAK,CAAC,iCAAiC,CAAC,CAAC;IACzE,IAAI,cAAc,EAAE,CAAC;QACnB,OAAO,GAAG,cAAc,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;IACrC,CAAC;IACD,IAAI,CAAC,OAAO,EAAE,CAAC;QACb,kEAAkE;QAClE,qEAAqE;QACrE,MAAM,OAAO,GAAG,QAAQ,CAAC,IAAI,EAAE,CAAC;QAChC,MAAM,SAAS,GAAG,OAAO,CAAC,UAAU,CAAC,GAAG,CAAC;YACvC,CAAC,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,aAAa,CAAC,IAAI,QAAQ,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC;YAClE,CAAC,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,aAAa,CAAC,IAAI,QAAQ,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC,CAAC;QACrE,IAAI,SAAS;YAAE,OAAO,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;IACxC,CAAC;IAED,sCAAsC;IACtC,IAAI,OAAO,EAAE,CAAC;QACZ,IAAI,CAAC;YACH,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;YACnC,MAAM,MAAM,GAAG,yBAAyB,CAAC,MAAM,CAAC,CAAC;YACjD,IAAI,MAAM;gBAAE,OAAO,MAAM,CAAC;QAC5B,CAAC;QAAC,MAAM,CAAC;YACP,mDAAmD;QACrD,CAAC;QAED,4CAA4C;QAC5C,IAAI,CAAC;YACH,MAAM,QAAQ,GAAG,UAAU,CAAC,OAAO,CAAC,CAAC;YACrC,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;YACpC,MAAM,MAAM,GAAG,yBAAyB,CAAC,MAAM,CAAC,CAAC;YACjD,IAAI,MAAM,EAAE,CAAC;gBACX,MAAM,CAAC,SAAS,GAAG,MAAM,CAAC,SAAS;oBACjC,CAAC,CAAC,MAAM,CAAC,SAAS,GAAG,kBAAkB;oBACvC,CAAC,CAAC,iBAAiB,CAAC;gBACtB,OAAO,MAAM,CAAC;YAChB,CAAC;QACH,CAAC;QAAC,MAAM,CAAC;YACP,+DAA+D;QACjE,CAAC;IACH,CAAC;IAED,wCAAwC;IACxC,MAAM,SAAS,GAAG,uBAAuB,CAAC,QAAQ,CAAC,CAAC;IACpD,IAAI,SAAS,EAAE,CAAC;QACd,IAAI,CAAC;YACH,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC;YACrC,MAAM,MAAM,GAAG,yBAAyB,CAAC,MAAM,CAAC,CAAC;YACjD,IAAI,MAAM,EAAE,CAAC;gBACX,MAAM,CAAC,SAAS,GAAG,MAAM,CAAC,SAAS;oBACjC,CAAC,CAAC,MAAM,CAAC,SAAS,GAAG,sCAAsC;oBAC3D,CAAC,CAAC,qCAAqC,CAAC;gBAC1C,OAAO,MAAM,CAAC;YAChB,CAAC;QACH,CAAC;QAAC,MAAM,CAAC;YACP,yDAAyD;YACzD,IAAI,CAAC;gBACH,MAAM,iBAAiB,GAAG,UAAU,CAAC,SAAS,CAAC,CAAC;gBAChD,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,iBAAiB,CAAC,CAAC;gBAC7C,MAAM,MAAM,GAAG,yBAAyB,CAAC,MAAM,CAAC,CAAC;gBACjD,IAAI,MAAM,EAAE,CAAC;oBACX,MAAM,CAAC,SAAS,GAAG,4CAA4C,CAAC;oBAChE,OAAO,MAAM,CAAC;gBAChB,CAAC;YACH,CAAC;YAAC,MAAM,CAAC;gBACP,gCAAgC;YAClC,CAAC;QACH,CAAC;IACH,CAAC;IAED,4CAA4C;IAC5C,MAAM,QAAQ,GAAG,kCAAkC,CAAC,QAAQ,CAAC,CAAC;IAC9D,IAAI,QAAQ;QAAE,OAAO,QAAQ,CAAC;IAE9B,0CAA0C;IAC1C,MAAM,UAAU,GAAG,eAAe,CAAC,QAAQ,CAAC,CAAC;IAC7C,IAAI,UAAU;QAAE,OAAO,UAAU,CAAC;IAElC,6BAA6B;IAC7B,OAAO;QACL,QAAQ,EAAE,EAAE;QACZ,QAAQ,EAAE,UAAU;QACpB,SAAS,EAAE,EAAE;QACb,UAAU,EAAE,iDAAiD,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE;KACtF,CAAC;AACJ,CAAC"}

package/dist/src/integrations/tasks/verification-gate.d.ts

@@ -0,0 +1,103 @@
+/**
+ * Verification Gate - Opt-in Completion Verification
+ *
+ * Prevents premature completion by checking if required verification
+ * steps (like running tests) have been performed before allowing
+ * the agent to stop.
+ *
+ * Configuration:
+ * - TUI mode: off by default
+ * - Eval mode: auto-configured from FAIL_TO_PASS tests
+ * - Swarm mode: set by orchestrator per worker
+ */
+export interface VerificationCriteria {
+    /** Tests that must be run (e.g., pytest test paths) */
+    requiredTests?: string[];
+    /** Must have edited at least one file */
+    requireFileChanges?: boolean;
+    /** Max nudges before giving up and allowing completion */
+    maxAttempts?: number;
+    /** Require TypeScript compilation to pass before completion */
+    requireCompilation?: boolean;
+    /** Max compilation-specific nudges before giving up (default: 8) */
+    compilationMaxAttempts?: number;
+}
+export interface VerificationState {
+    /** Tests that have been detected as run */
+    testsRun: Set<string>;
+    /** Whether any test passed */
+    anyTestPassed: boolean;
+    /** Whether file changes were made */
+    hasFileChanges: boolean;
+    /** Number of verification nudges already sent */
+    nudgeCount: number;
+    /** Whether TypeScript compilation passed */
+    compilationPassed: boolean;
+    /** Number of TypeScript compilation errors */
+    compilationErrorCount: number;
+    /** Number of compilation-specific nudges sent */
+    compilationNudgeCount: number;
+}
+export interface VerificationCheckResult {
+    /** Whether verification criteria are satisfied */
+    satisfied: boolean;
+    /** If not satisfied, a nudge message to inject */
+    nudge?: string;
+    /** If max attempts exceeded, allow anyway */
+    forceAllow: boolean;
+    /** What's still missing */
+    missing: string[];
+}
+export declare class VerificationGate {
+    private criteria;
+    private state;
+    constructor(criteria: VerificationCriteria);
+    /**
+     * Record that a bash command was executed.
+     * Detects test execution from command patterns and output.
+     */
+    recordBashExecution(command: string, output: string, exitCode: number | null): void;
+    /**
+     * Record that a file was modified.
+     */
+    recordFileChange(): void;
+    /**
+     * Record the result of a TypeScript compilation check.
+     */
+    recordCompilationResult(passed: boolean, errorCount: number): void;
+    /**
+     * Increment the compilation nudge counter.
+     * Called from the TSC gate in the execution loop (which uses `continue`
+     * and therefore never reaches verificationGate.check()).
+     */
+    incrementCompilationNudge(): void;
+    /**
+     * Check if the agent can complete.
+     * Returns satisfied=true if criteria are met, or a nudge message if not.
+     */
+    check(): VerificationCheckResult;
+    /**
+     * Get the current verification state.
+     */
+    getState(): {
+        testsRun: number;
+        anyTestPassed: boolean;
+        hasFileChanges: boolean;
+        nudgeCount: number;
+        maxAttempts: number;
+        compilationPassed: boolean;
+        compilationErrorCount: number;
+        compilationNudgeCount: number;
+    };
+    /**
+     * Reset the gate state (for reuse).
+     */
+    reset(): void;
+    private buildNudge;
+}
+/**
+ * Create a verification gate from criteria.
+ * Returns null if no criteria provided (gate disabled).
+ */
+export declare function createVerificationGate(criteria?: VerificationCriteria | null): VerificationGate | null;
+//# sourceMappingURL=verification-gate.d.ts.map

package/dist/src/integrations/tasks/verification-gate.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"verification-gate.d.ts","sourceRoot":"","sources":["../../../../src/integrations/tasks/verification-gate.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAMH,MAAM,WAAW,oBAAoB;IACnC,uDAAuD;IACvD,aAAa,CAAC,EAAE,MAAM,EAAE,CAAC;IACzB,yCAAyC;IACzC,kBAAkB,CAAC,EAAE,OAAO,CAAC;IAC7B,0DAA0D;IAC1D,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,+DAA+D;IAC/D,kBAAkB,CAAC,EAAE,OAAO,CAAC;IAC7B,oEAAoE;IACpE,sBAAsB,CAAC,EAAE,MAAM,CAAC;CACjC;AAED,MAAM,WAAW,iBAAiB;IAChC,2CAA2C;IAC3C,QAAQ,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;IACtB,8BAA8B;IAC9B,aAAa,EAAE,OAAO,CAAC;IACvB,qCAAqC;IACrC,cAAc,EAAE,OAAO,CAAC;IACxB,iDAAiD;IACjD,UAAU,EAAE,MAAM,CAAC;IACnB,4CAA4C;IAC5C,iBAAiB,EAAE,OAAO,CAAC;IAC3B,8CAA8C;IAC9C,qBAAqB,EAAE,MAAM,CAAC;IAC9B,iDAAiD;IACjD,qBAAqB,EAAE,MAAM,CAAC;CAC/B;AAED,MAAM,WAAW,uBAAuB;IACtC,kDAAkD;IAClD,SAAS,EAAE,OAAO,CAAC;IACnB,kDAAkD;IAClD,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,6CAA6C;IAC7C,UAAU,EAAE,OAAO,CAAC;IACpB,2BAA2B;IAC3B,OAAO,EAAE,MAAM,EAAE,CAAC;CACnB;AAMD,qBAAa,gBAAgB;IAC3B,OAAO,CAAC,QAAQ,CAAuB;IACvC,OAAO,CAAC,KAAK,CAAoB;gBAErB,QAAQ,EAAE,oBAAoB;IAoB1C;;;OAGG;IACH,mBAAmB,CAAC,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,GAAG,IAAI,GAAG,IAAI;IAoBnF;;OAEG;IACH,gBAAgB,IAAI,IAAI;IAIxB;;OAEG;IACH,uBAAuB,CAAC,MAAM,EAAE,OAAO,EAAE,UAAU,EAAE,MAAM,GAAG,IAAI;IAKlE;;;;OAIG;IACH,yBAAyB,IAAI,IAAI;IAIjC;;;OAGG;IACH,KAAK,IAAI,uBAAuB;IAyDhC;;OAEG;IACH,QAAQ,IAAI;QACV,QAAQ,EAAE,MAAM,CAAC;QACjB,aAAa,EAAE,OAAO,CAAC;QACvB,cAAc,EAAE,OAAO,CAAC;QACxB,UAAU,EAAE,MAAM,CAAC;QACnB,WAAW,EAAE,MAAM,CAAC;QACpB,iBAAiB,EAAE,OAAO,CAAC;QAC3B,qBAAqB,EAAE,MAAM,CAAC;QAC9B,qBAAqB,EAAE,MAAM,CAAC;KAC/B;IAaD;;OAEG;IACH,KAAK,IAAI,IAAI;IAgBb,OAAO,CAAC,UAAU;CAkBnB;AAMD;;;GAGG;AACH,wBAAgB,sBAAsB,CACpC,QAAQ,CAAC,EAAE,oBAAoB,GAAG,IAAI,GACrC,gBAAgB,GAAG,IAAI,CAKzB"}