swarm-engine 1.3.0 → 1.38.0

package/dist/runtime/graph-self-evolve.js

@@ -0,0 +1,422 @@
+// ─── Engine ──────────────────────────────────────────────────────────
+/**
+ * Analyzes historical execution traces to propose improved replanning rules,
+ * backtests them against historical data, and evolves scoring weights based
+ * on user feedback.
+ *
+ * Rules are persisted as 'heuristic' nodes in the execution graph with id
+ * prefix 'rule:'. Feedback adjusts confidence: accepted → +0.1, rejected → -0.15.
+ */
+export class RuleEvolver {
+    graph;
+    constructor(graph) {
+        this.graph = graph;
+    }
+    /**
+     * Analyze historical orchestration traces and propose new replanning rules.
+     *
+     * 1. Extract features from all orchestrations via BFS.
+     * 2. Find patterns in failures: low-confidence phases, high token usage, blockers.
+     * 3. Generate candidate rules from observed failure patterns.
+     * 4. Backtest each candidate against all historical traces.
+     * 5. Return proposals sorted by improvement, filtered by confidence > 0.3.
+     */
+    evolveRules(traceCount) {
+        const features = this.extractFeatures(traceCount);
+        if (features.length === 0)
+            return [];
+        const candidates = this.generateCandidateRules(features);
+        const proposals = [];
+        for (const rule of candidates) {
+            const result = this.backtestRule(rule);
+            if (result.appliedCount === 0)
+                continue;
+            const confidence = result.appliedCount >= 5 ? 0.7 : result.appliedCount >= 3 ? 0.5 : 0.3;
+            if (confidence < 0.3)
+                continue;
+            proposals.push({
+                rule,
+                backtestedImprovement: result.improvement,
+                confidence,
+                evidence: this.formatEvidence(rule, result),
+            });
+        }
+        return proposals
+            .filter((p) => p.confidence >= 0.3)
+            .sort((a, b) => b.backtestedImprovement - a.backtestedImprovement);
+    }
+    /**
+     * Backtest a single rule against all historical orchestrations.
+     *
+     * For each orchestration, extracts phase features via BFS. If the rule
+     * condition matches any phase, simulates the action:
+     * - upgradeModel on failed orch → wouldHaveHelped (optimistic)
+     * - upgradeModel on successful orch → wouldHaveHurt (false positive)
+     * - skipPhase on failed orch → wouldHaveHelped (conservative: saves tokens)
+     * - downgradeModel on successful orch → wouldHaveHelped (saves cost)
+     * - downgradeModel on failed orch → wouldHaveHurt
+     */
+    backtestRule(rule) {
+        const features = this.extractFeatures();
+        let appliedCount = 0;
+        let wouldHaveHelped = 0;
+        let wouldHaveHurt = 0;
+        for (const orch of features) {
+            const matches = this.ruleMatchesOrchestration(rule, orch);
+            if (!matches)
+                continue;
+            appliedCount++;
+            const orchFailed = orch.status === 'failed';
+            if (rule.action.upgradeModel) {
+                // Optimistic: upgrading on failed → helped, upgrading on success → hurt (wasted cost)
+                if (orchFailed)
+                    wouldHaveHelped++;
+                else
+                    wouldHaveHurt++;
+            }
+            else if (rule.action.downgradeModel) {
+                // Conservative: downgrading on success → helped (saved cost), downgrading on failed → hurt
+                if (!orchFailed)
+                    wouldHaveHelped++;
+                else
+                    wouldHaveHurt++;
+            }
+            else if (rule.action.skipPhase) {
+                // Conservative: skipping on success → helped (saved tokens), skipping on failed → neutral
+                if (!orchFailed)
+                    wouldHaveHelped++;
+                // Failed orchestrations: skipping is neutral, not counted as hurt
+            }
+            else if (rule.action.addPhase) {
+                // Optimistic: adding a phase on failed → helped, adding on success → hurt (wasted tokens)
+                if (orchFailed)
+                    wouldHaveHelped++;
+                else
+                    wouldHaveHurt++;
+            }
+        }
+        const improvement = appliedCount > 0 ? (wouldHaveHelped - wouldHaveHurt) / appliedCount : 0;
+        const falsePositiveRate = appliedCount > 0 ? wouldHaveHurt / appliedCount : 0;
+        return { improvement, appliedCount, wouldHaveHelped, wouldHaveHurt, falsePositiveRate };
+    }
+    /**
+     * Record user accept/reject of a rule proposal.
+     * Accepted → confidence +0.1 (capped at 1.0)
+     * Rejected → confidence -0.15 (floored at 0.0)
+     */
+    recordFeedback(ruleId, accepted) {
+        const existing = this.graph.getNode(ruleId);
+        if (!existing)
+            return;
+        const props = existing.properties;
+        const currentConfidence = props.confidence ?? 0.5;
+        const delta = accepted ? 0.1 : -0.15;
+        const newConfidence = Math.max(0, Math.min(1, currentConfidence + delta));
+        this.graph.addNode({
+            id: ruleId,
+            type: 'heuristic',
+            label: existing.label,
+            properties: {
+                ...props,
+                confidence: newConfidence,
+                lastFeedback: accepted ? 'accepted' : 'rejected',
+                feedbackCount: (props.feedbackCount ?? 0) + 1,
+            },
+        });
+    }
+    /**
+     * Get all evolved rules currently stored in the graph.
+     * Loads heuristic nodes with id prefix 'rule:' and deserializes them.
+     */
+    getActiveRules() {
+        return this.loadRules();
+    }
+    // ─── Feature Extraction ─────────────────────────────────────────
+    extractFeatures(traceCount) {
+        let orchNodes = this.graph.getNodesByType('orchestration');
+        if (traceCount !== undefined && traceCount > 0) {
+            orchNodes = orchNodes.slice(-traceCount);
+        }
+        const results = [];
+        for (const orch of orchNodes) {
+            const { nodes } = this.graph.bfs(orch.id, 3);
+            const phaseNodes = nodes.filter((n) => n.type === 'phase');
+            const agentNodes = nodes.filter((n) => n.type === 'agent');
+            const phases = [];
+            for (const phase of phaseNodes) {
+                // Find agents belonging to this phase via spawned edges
+                const phaseEdges = this.graph.getEdges(phase.id, 'outgoing');
+                const phaseAgentIds = new Set(phaseEdges.filter((e) => e.type === 'spawned').map((e) => e.target));
+                const phaseAgents = agentNodes.filter((a) => phaseAgentIds.has(a.id));
+                const confidence = this.inferPhaseConfidence(phaseAgents);
+                const totalTokens = this.inferPhaseTokens(phase);
+                const status = phase.properties.status ?? 'unknown';
+                const hasBlockers = phaseAgents.some((a) => a.properties.status === 'error' || a.properties.status === 'timeout');
+                phases.push({
+                    phaseId: phase.id,
+                    label: phase.label,
+                    kind: this.inferPhaseKind(phase.label),
+                    agentCount: phaseAgents.length || phase.properties.agentCount || 0,
+                    confidence,
+                    totalTokens,
+                    status,
+                    hasBlockers,
+                });
+            }
+            results.push({
+                orchId: orch.id,
+                status: orch.properties.status ?? 'unknown',
+                pattern: orch.properties.pattern ?? 'unknown',
+                phases,
+            });
+        }
+        return results;
+    }
+    inferPhaseConfidence(agents) {
+        if (agents.length === 0)
+            return 'medium';
+        const hasError = agents.some((a) => a.properties.status === 'error' || a.properties.status === 'timeout');
+        if (hasError)
+            return 'low';
+        const allIdle = agents.every((a) => a.properties.status === 'idle');
+        if (allIdle)
+            return 'high';
+        return 'medium';
+    }
+    inferPhaseTokens(phase) {
+        const usage = phase.properties.usage;
+        return usage?.totalTokens ?? 0;
+    }
+    inferPhaseKind(label) {
+        const lower = label.toLowerCase();
+        if (lower.includes('research') || lower.includes('explore'))
+            return 'research';
+        if (lower.includes('implement') || lower.includes('build') || lower.includes('code'))
+            return 'implement';
+        if (lower.includes('review') || lower.includes('check'))
+            return 'review';
+        if (lower.includes('test') || lower.includes('verify'))
+            return 'test';
+        if (lower.includes('challenge') || lower.includes('adversar'))
+            return 'challenge';
+        if (lower.includes('integrate') || lower.includes('merge'))
+            return 'integrate';
+        return label;
+    }
+    // ─── Rule Generation ────────────────────────────────────────────
+    generateCandidateRules(features) {
+        const candidates = [];
+        const failed = features.filter((f) => f.status === 'failed');
+        const succeeded = features.filter((f) => f.status === 'completed');
+        // Pattern 1: Low-confidence phases in failures → upgrade model
+        const failedWithLowConf = failed.filter((f) => f.phases.some((p) => p.confidence === 'low'));
+        if (failedWithLowConf.length >= 2) {
+            // Find which phase kinds are most commonly low-confidence in failures
+            const kindCounts = new Map();
+            for (const f of failedWithLowConf) {
+                for (const p of f.phases) {
+                    if (p.confidence === 'low') {
+                        kindCounts.set(p.kind, (kindCounts.get(p.kind) ?? 0) + 1);
+                    }
+                }
+            }
+            for (const [kind, count] of kindCounts) {
+                if (count >= 2) {
+                    candidates.push({
+                        id: `rule:upgrade-on-low-conf-${kind}`,
+                        name: `Upgrade model on low confidence (${kind})`,
+                        description: `When a ${kind} phase has low confidence, upgrade the model for remaining phases`,
+                        condition: { phaseKind: kind, confidenceBelow: 0.4 },
+                        action: { upgradeModel: true },
+                        confidence: 0.5,
+                        evidenceCount: count,
+                        successRate: 0,
+                    });
+                }
+            }
+            // Also add a generic low-confidence rule if enough evidence
+            if (failedWithLowConf.length >= 3) {
+                candidates.push({
+                    id: 'rule:upgrade-on-low-conf',
+                    name: 'Upgrade model on low confidence',
+                    description: 'When any phase has low confidence, upgrade the model for remaining phases',
+                    condition: { confidenceBelow: 0.4 },
+                    action: { upgradeModel: true },
+                    confidence: 0.5,
+                    evidenceCount: failedWithLowConf.length,
+                    successRate: 0,
+                });
+            }
+        }
+        // Pattern 2: Phases with blockers in failures → upgrade model
+        const failedWithBlockers = failed.filter((f) => f.phases.some((p) => p.hasBlockers));
+        if (failedWithBlockers.length >= 2) {
+            candidates.push({
+                id: 'rule:upgrade-on-blockers',
+                name: 'Upgrade model when blockers detected',
+                description: 'When a phase encounters blockers, upgrade the model for remaining phases',
+                condition: { hasBlockers: true },
+                action: { upgradeModel: true },
+                confidence: 0.5,
+                evidenceCount: failedWithBlockers.length,
+                successRate: 0,
+            });
+        }
+        // Pattern 3: High-confidence phases in successes → downgrade model (cost saving)
+        const succeededWithHighConf = succeeded.filter((f) => f.phases.every((p) => p.confidence === 'high'));
+        if (succeededWithHighConf.length >= 3) {
+            candidates.push({
+                id: 'rule:downgrade-on-high-conf',
+                name: 'Downgrade model on high confidence',
+                description: 'When all phases have high confidence, downgrade to save cost',
+                condition: { confidenceAbove: 0.8 },
+                action: { downgradeModel: true },
+                confidence: 0.5,
+                evidenceCount: succeededWithHighConf.length,
+                successRate: 0,
+            });
+        }
+        // Pattern 4: High token usage in failures → downgrade to save budget
+        const avgTokensSucceeded = this.averageTokens(succeeded);
+        if (avgTokensSucceeded > 0) {
+            const failedHighTokens = failed.filter((f) => {
+                const total = f.phases.reduce((s, p) => s + p.totalTokens, 0);
+                return total > avgTokensSucceeded * 2;
+            });
+            if (failedHighTokens.length >= 2) {
+                candidates.push({
+                    id: 'rule:downgrade-on-high-tokens',
+                    name: 'Downgrade model on high token usage',
+                    description: 'When token usage exceeds 2x historical average, downgrade to save budget',
+                    condition: { tokenRatioAbove: 2.0 },
+                    action: { downgradeModel: true },
+                    confidence: 0.4,
+                    evidenceCount: failedHighTokens.length,
+                    successRate: 0,
+                });
+            }
+        }
+        // Pattern 5: Budget exhaustion in failures → downgrade when budget low
+        // (Only generate if we see phases with usage data)
+        const failedLowBudget = failed.filter((f) => f.phases.some((p) => p.totalTokens > 0));
+        if (failedLowBudget.length >= 2) {
+            candidates.push({
+                id: 'rule:downgrade-on-low-budget',
+                name: 'Downgrade model when budget is low',
+                description: 'When remaining budget drops below 30%, downgrade models to stretch budget',
+                condition: { budgetRemainingBelow: 0.3 },
+                action: { downgradeModel: true },
+                confidence: 0.4,
+                evidenceCount: failedLowBudget.length,
+                successRate: 0,
+            });
+        }
+        // Pattern 6: Skip challenge phases in simple successful tasks
+        const simpleSuccesses = succeeded.filter((f) => f.phases.length <= 3 && f.phases.every((p) => p.confidence === 'high'));
+        if (simpleSuccesses.length >= 3) {
+            candidates.push({
+                id: 'rule:skip-challenge-on-simple',
+                name: 'Skip challenge phase on simple tasks',
+                description: 'When task is simple (high confidence, few phases), skip adversarial challenge',
+                condition: { phaseKind: 'challenge', confidenceAbove: 0.8 },
+                action: { skipPhase: true },
+                confidence: 0.4,
+                evidenceCount: simpleSuccesses.length,
+                successRate: 0,
+            });
+        }
+        return candidates;
+    }
+    averageTokens(features) {
+        if (features.length === 0)
+            return 0;
+        const total = features.reduce((s, f) => s + f.phases.reduce((ps, p) => ps + p.totalTokens, 0), 0);
+        return total / features.length;
+    }
+    // ─── Rule Matching ──────────────────────────────────────────────
+    ruleMatchesOrchestration(rule, orch) {
+        const { condition } = rule;
+        for (const phase of orch.phases) {
+            let matches = true;
+            if (condition.phaseKind !== undefined && phase.kind !== condition.phaseKind) {
+                matches = false;
+            }
+            if (condition.confidenceBelow !== undefined) {
+                const confValue = phase.confidence === 'low' ? 0.3 : phase.confidence === 'medium' ? 0.6 : 0.9;
+                if (confValue >= condition.confidenceBelow)
+                    matches = false;
+            }
+            if (condition.confidenceAbove !== undefined) {
+                const confValue = phase.confidence === 'low' ? 0.3 : phase.confidence === 'medium' ? 0.6 : 0.9;
+                if (confValue <= condition.confidenceAbove)
+                    matches = false;
+            }
+            if (condition.hasBlockers !== undefined && phase.hasBlockers !== condition.hasBlockers) {
+                matches = false;
+            }
+            // tokenRatioAbove: match if this orch's total tokens exceed the ratio × average
+            // We can't compute average here per-rule, so we check the ratio against phase tokens
+            // This is a simplified check — backtesting handles the full logic
+            if (condition.tokenRatioAbove !== undefined) {
+                // We'd need historical average; skip this condition in simple matching
+                // The rule still matches based on other conditions
+                if (Object.keys(condition).length === 1)
+                    matches = false; // only tokenRatio, can't match
+            }
+            if (condition.budgetRemainingBelow !== undefined) {
+                // Budget information isn't available at phase level in the graph
+                // Skip this condition in simple matching
+                if (Object.keys(condition).length === 1)
+                    matches = false;
+            }
+            if (matches)
+                return true;
+        }
+        return false;
+    }
+    // ─── Persistence ────────────────────────────────────────────────
+    saveRule(rule) {
+        this.graph.addNode({
+            id: rule.id,
+            type: 'heuristic',
+            label: rule.name,
+            properties: {
+                description: rule.description,
+                condition: rule.condition,
+                action: rule.action,
+                confidence: rule.confidence,
+                evidenceCount: rule.evidenceCount,
+                successRate: rule.successRate,
+            },
+        });
+    }
+    loadRules() {
+        const nodes = this.graph.getNodesByType('heuristic');
+        const rules = [];
+        for (const node of nodes) {
+            if (!node.id.startsWith('rule:'))
+                continue;
+            const props = node.properties;
+            rules.push({
+                id: node.id,
+                name: node.label,
+                description: props.description ?? '',
+                condition: props.condition ?? {},
+                action: props.action ?? {},
+                confidence: props.confidence ?? 0.5,
+                evidenceCount: props.evidenceCount ?? 0,
+                successRate: props.successRate ?? 0,
+            });
+        }
+        return rules;
+    }
+    // ─── Helpers ────────────────────────────────────────────────────
+    formatEvidence(rule, result) {
+        const pct = Math.round(result.improvement * 100);
+        const sign = pct >= 0 ? '+' : '';
+        return (`${rule.name}: ${sign}${pct}% improvement across ${result.appliedCount} historical traces ` +
+            `(helped ${result.wouldHaveHelped}, hurt ${result.wouldHaveHurt}, ` +
+            `false positive rate ${Math.round(result.falsePositiveRate * 100)}%)`);
+    }
+}
+//# sourceMappingURL=graph-self-evolve.js.map

package/dist/runtime/graph-self-evolve.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph-self-evolve.js","sourceRoot":"","sources":["../../src/runtime/graph-self-evolve.ts"],"names":[],"mappings":"AA+DA,wEAAwE;AAExE;;;;;;;GAOG;AACH,MAAM,OAAO,WAAW;IACF;IAApB,YAAoB,KAAqB;QAArB,UAAK,GAAL,KAAK,CAAgB;IAAG,CAAC;IAE7C;;;;;;;;OAQG;IACH,WAAW,CAAC,UAAmB;QAC7B,MAAM,QAAQ,GAAG,IAAI,CAAC,eAAe,CAAC,UAAU,CAAC,CAAC;QAClD,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,EAAE,CAAC;QAErC,MAAM,UAAU,GAAG,IAAI,CAAC,sBAAsB,CAAC,QAAQ,CAAC,CAAC;QACzD,MAAM,SAAS,GAAmB,EAAE,CAAC;QAErC,KAAK,MAAM,IAAI,IAAI,UAAU,EAAE,CAAC;YAC9B,MAAM,MAAM,GAAG,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC;YACvC,IAAI,MAAM,CAAC,YAAY,KAAK,CAAC;gBAAE,SAAS;YAExC,MAAM,UAAU,GAAG,MAAM,CAAC,YAAY,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,YAAY,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC;YACzF,IAAI,UAAU,GAAG,GAAG;gBAAE,SAAS;YAE/B,SAAS,CAAC,IAAI,CAAC;gBACb,IAAI;gBACJ,qBAAqB,EAAE,MAAM,CAAC,WAAW;gBACzC,UAAU;gBACV,QAAQ,EAAE,IAAI,CAAC,cAAc,CAAC,IAAI,EAAE,MAAM,CAAC;aAC5C,CAAC,CAAC;QACL,CAAC;QAED,OAAO,SAAS;aACb,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,IAAI,GAAG,CAAC;aAClC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,qBAAqB,GAAG,CAAC,CAAC,qBAAqB,CAAC,CAAC;IACvE,CAAC;IAED;;;;;;;;;;OAUG;IACH,YAAY,CAAC,IAAiB;QAC5B,MAAM,QAAQ,GAAG,IAAI,CAAC,eAAe,EAAE,CAAC;QACxC,IAAI,YAAY,GAAG,CAAC,CAAC;QACrB,IAAI,eAAe,GAAG,CAAC,CAAC;QACxB,IAAI,aAAa,GAAG,CAAC,CAAC;QAEtB,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;YAC5B,MAAM,OAAO,GAAG,IAAI,CAAC,wBAAwB,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;YAC1D,IAAI,CAAC,OAAO;gBAAE,SAAS;YAEvB,YAAY,EAAE,CAAC;YACf,MAAM,UAAU,GAAG,IAAI,CAAC,MAAM,KAAK,QAAQ,CAAC;YAE5C,IAAI,IAAI,CAAC,MAAM,CAAC,YAAY,EAAE,CAAC;gBAC7B,sFAAsF;gBACtF,IAAI,UAAU;oBAAE,eAAe,EAAE,CAAC;;oBAC7B,aAAa,EAAE,CAAC;YACvB,CAAC;iBAAM,IAAI,IAAI,CAAC,MAAM,CAAC,cAAc,EAAE,CAAC;gBACtC,2FAA2F;gBAC3F,IAAI,CAAC,UAAU;oBAAE,eAAe,EAAE,CAAC;;oBAC9B,aAAa,EAAE,CAAC;YACvB,CAAC;iBAAM,IAAI,IAAI,CAAC,MAAM,CAAC,SAAS,EAAE,CAAC;gBACjC,0FAA0F;gBAC1F,IAAI,CAAC,UAAU;oBAAE,eAAe,EAAE,CAAC;gBACnC,kEAAkE;YACpE,CAAC;iBAAM,IAAI,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAC;gBAChC,0FAA0F;gBAC1F,IAAI,UAAU;oBAAE,eAAe,EAAE,CAAC;;oBAC7B,aAAa,EAAE,CAAC;YACvB,CAAC;QACH,CAAC;QAED,MAAM,WAAW,GAAG,YAAY,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,eAAe,GAAG,aAAa,CAAC,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC;QAC5F,MAAM,iBAAiB,GAAG,YAAY,GAAG,CAAC,CAAC,CAAC,CAAC,aAAa,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC;QAE9E,OAAO,EAAE,WAAW,EAAE,YAAY,EAAE,eAAe,EAAE,aAAa,EAAE,iBAAiB,EAAE,CAAC;IAC1F,CAAC;IAED;;;;OAIG;IACH,cAAc,CAAC,MAAc,EAAE,QAAiB;QAC9C,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;QAC5C,IAAI,CAAC,QAAQ;YAAE,OAAO;QAEtB,MAAM,KAAK,GAAG,QAAQ,CAAC,UAAqC,CAAC;QAC7D,MAAM,iBAAiB,GAAI,KAAK,CAAC,UAAqB,IAAI,GAAG,CAAC;QAC9D,MAAM,KAAK,GAAG,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;QACrC,MAAM,aAAa,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,iBAAiB,GAAG,KAAK,CAAC,CAAC,CAAC;QAE1E,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC;YACjB,EAAE,EAAE,MAAM;YACV,IAAI,EAAE,WAAW;YACjB,KAAK,EAAE,QAAQ,CAAC,KAAK;YACrB,UAAU,EAAE;gBACV,GAAG,KAAK;gBACR,UAAU,EAAE,aAAa;gBACzB,YAAY,EAAE,QAAQ,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,UAAU;gBAChD,aAAa,EAAE,CAAE,KAAK,CAAC,aAAwB,IAAI,CAAC,CAAC,GAAG,CAAC;aAC1D;SACF,CAAC,CAAC;IACL,CAAC;IAED;;;OAGG;IACH,cAAc;QACZ,OAAO,IAAI,CAAC,SAAS,EAAE,CAAC;IAC1B,CAAC;IAED,mEAAmE;IAE3D,eAAe,CAAC,UAAmB;QACzC,IAAI,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,cAAc,CAAC,eAAe,CAAC,CAAC;QAC3D,IAAI,UAAU,KAAK,SAAS,IAAI,UAAU,GAAG,CAAC,EAAE,CAAC;YAC/C,SAAS,GAAG,SAAS,CAAC,KAAK,CAAC,CAAC,UAAU,CAAC,CAAC;QAC3C,CAAC;QAED,MAAM,OAAO,GAAmB,EAAE,CAAC;QAEnC,KAAK,MAAM,IAAI,IAAI,SAAS,EAAE,CAAC;YAC7B,MAAM,EAAE,KAAK,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;YAC7C,MAAM,UAAU,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,OAAO,CAAC,CAAC;YAC3D,MAAM,UAAU,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,OAAO,CAAC,CAAC;YAE3D,MAAM,MAAM,GAAoB,EAAE,CAAC;YACnC,KAAK,MAAM,KAAK,IAAI,UAAU,EAAE,CAAC;gBAC/B,wDAAwD;gBACxD,MAAM,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,EAAE,UAAU,CAAC,CAAC;gBAC7D,MAAM,aAAa,GAAG,IAAI,GAAG,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,SAAS,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC;gBACnG,MAAM,WAAW,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;gBAEtE,MAAM,UAAU,GAAG,IAAI,CAAC,oBAAoB,CAAC,WAAW,CAAC,CAAC;gBAC1D,MAAM,WAAW,GAAG,IAAI,CAAC,gBAAgB,CAAC,KAAK,CAAC,CAAC;gBACjD,MAAM,MAAM,GAAI,KAAK,CAAC,UAAU,CAAC,MAAiB,IAAI,SAAS,CAAC;gBAChE,MAAM,WAAW,GAAG,WAAW,CAAC,IAAI,CAClC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,MAAM,KAAK,OAAO,IAAI,CAAC,CAAC,UAAU,CAAC,MAAM,KAAK,SAAS,CAC5E,CAAC;gBAEF,MAAM,CAAC,IAAI,CAAC;oBACV,OAAO,EAAE,KAAK,CAAC,EAAE;oBACjB,KAAK,EAAE,KAAK,CAAC,KAAK;oBAClB,IAAI,EAAE,IAAI,CAAC,cAAc,CAAC,KAAK,CAAC,KAAK,CAAC;oBACtC,UAAU,EAAE,WAAW,CAAC,MAAM,IAAK,KAAK,CAAC,UAAU,CAAC,UAAqB,IAAI,CAAC;oBAC9E,UAAU;oBACV,WAAW;oBACX,MAAM;oBACN,WAAW;iBACZ,CAAC,CAAC;YACL,CAAC;YAED,OAAO,CAAC,IAAI,CAAC;gBACX,MAAM,EAAE,IAAI,CAAC,EAAE;gBACf,MAAM,EAAG,IAAI,CAAC,UAAU,CAAC,MAAiB,IAAI,SAAS;gBACvD,OAAO,EAAG,IAAI,CAAC,UAAU,CAAC,OAAkB,IAAI,SAAS;gBACzD,MAAM;aACP,CAAC,CAAC;QACL,CAAC;QAED,OAAO,OAAO,CAAC;IACjB,CAAC;IAEO,oBAAoB,CAAC,MAAmB;QAC9C,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,QAAQ,CAAC;QACzC,MAAM,QAAQ,GAAG,MAAM,CAAC,IAAI,CAC1B,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,MAAM,KAAK,OAAO,IAAI,CAAC,CAAC,UAAU,CAAC,MAAM,KAAK,SAAS,CAC5E,CAAC;QACF,IAAI,QAAQ;YAAE,OAAO,KAAK,CAAC;QAC3B,MAAM,OAAO,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,MAAM,KAAK,MAAM,CAAC,CAAC;QACpE,IAAI,OAAO;YAAE,OAAO,MAAM,CAAC;QAC3B,OAAO,QAAQ,CAAC;IAClB,CAAC;IAEO,gBAAgB,CAAC,KAAgB;QACvC,MAAM,KAAK,GAAG,KAAK,CAAC,UAAU,CAAC,KAA6C,CAAC;QAC7E,OAAO,KAAK,EAAE,WAAW,IAAI,CAAC,CAAC;IACjC,CAAC;IAEO,cAAc,CAAC,KAAa;QAClC,MAAM,KAAK,GAAG,KAAK,CAAC,WAAW,EAAE,CAAC;QAClC,IAAI,KAAK,CAAC,QAAQ,CAAC,UAAU,CAAC,IAAI,KAAK,CAAC,QAAQ,CAAC,SAAS,CAAC;YAAE,OAAO,UAAU,CAAC;QAC/E,IAAI,KAAK,CAAC,QAAQ,CAAC,WAAW,CAAC,IAAI,KAAK,CAAC,QAAQ,CAAC,OAAO,CAAC,IAAI,KAAK,CAAC,QAAQ,CAAC,MAAM,CAAC;YAAE,OAAO,WAAW,CAAC;QACzG,IAAI,KAAK,CAAC,QAAQ,CAAC,QAAQ,CAAC,IAAI,KAAK,CAAC,QAAQ,CAAC,OAAO,CAAC;YAAE,OAAO,QAAQ,CAAC;QACzE,IAAI,KAAK,CAAC,QAAQ,CAAC,MAAM,CAAC,IAAI,KAAK,CAAC,QAAQ,CAAC,QAAQ,CAAC;YAAE,OAAO,MAAM,CAAC;QACtE,IAAI,KAAK,CAAC,QAAQ,CAAC,WAAW,CAAC,IAAI,KAAK,CAAC,QAAQ,CAAC,UAAU,CAAC;YAAE,OAAO,WAAW,CAAC;QAClF,IAAI,KAAK,CAAC,QAAQ,CAAC,WAAW,CAAC,IAAI,KAAK,CAAC,QAAQ,CAAC,OAAO,CAAC;YAAE,OAAO,WAAW,CAAC;QAC/E,OAAO,KAAK,CAAC;IACf,CAAC;IAED,mEAAmE;IAE3D,sBAAsB,CAAC,QAAwB;QACrD,MAAM,UAAU,GAAkB,EAAE,CAAC;QACrC,MAAM,MAAM,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,QAAQ,CAAC,CAAC;QAC7D,MAAM,SAAS,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,WAAW,CAAC,CAAC;QAEnE,+DAA+D;QAC/D,MAAM,iBAAiB,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAC5C,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,KAAK,KAAK,CAAC,CAC7C,CAAC;QACF,IAAI,iBAAiB,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;YAClC,sEAAsE;YACtE,MAAM,UAAU,GAAG,IAAI,GAAG,EAAkB,CAAC;YAC7C,KAAK,MAAM,CAAC,IAAI,iBAAiB,EAAE,CAAC;gBAClC,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE,CAAC;oBACzB,IAAI,CAAC,CAAC,UAAU,KAAK,KAAK,EAAE,CAAC;wBAC3B,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;oBAC5D,CAAC;gBACH,CAAC;YACH,CAAC;YAED,KAAK,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,UAAU,EAAE,CAAC;gBACvC,IAAI,KAAK,IAAI,CAAC,EAAE,CAAC;oBACf,UAAU,CAAC,IAAI,CAAC;wBACd,EAAE,EAAE,4BAA4B,IAAI,EAAE;wBACtC,IAAI,EAAE,oCAAoC,IAAI,GAAG;wBACjD,WAAW,EAAE,UAAU,IAAI,mEAAmE;wBAC9F,SAAS,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,eAAe,EAAE,GAAG,EAAE;wBACpD,MAAM,EAAE,EAAE,YAAY,EAAE,IAAI,EAAE;wBAC9B,UAAU,EAAE,GAAG;wBACf,aAAa,EAAE,KAAK;wBACpB,WAAW,EAAE,CAAC;qBACf,CAAC,CAAC;gBACL,CAAC;YACH,CAAC;YAED,4DAA4D;YAC5D,IAAI,iBAAiB,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;gBAClC,UAAU,CAAC,IAAI,CAAC;oBACd,EAAE,EAAE,0BAA0B;oBAC9B,IAAI,EAAE,iCAAiC;oBACvC,WAAW,EAAE,2EAA2E;oBACxF,SAAS,EAAE,EAAE,eAAe,EAAE,GAAG,EAAE;oBACnC,MAAM,EAAE,EAAE,YAAY,EAAE,IAAI,EAAE;oBAC9B,UAAU,EAAE,GAAG;oBACf,aAAa,EAAE,iBAAiB,CAAC,MAAM;oBACvC,WAAW,EAAE,CAAC;iBACf,CAAC,CAAC;YACL,CAAC;QACH,CAAC;QAED,8DAA8D;QAC9D,MAAM,kBAAkB,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAC7C,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,WAAW,CAAC,CACpC,CAAC;QACF,IAAI,kBAAkB,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;YACnC,UAAU,CAAC,IAAI,CAAC;gBACd,EAAE,EAAE,0BAA0B;gBAC9B,IAAI,EAAE,sCAAsC;gBAC5C,WAAW,EAAE,0EAA0E;gBACvF,SAAS,EAAE,EAAE,WAAW,EAAE,IAAI,EAAE;gBAChC,MAAM,EAAE,EAAE,YAAY,EAAE,IAAI,EAAE;gBAC9B,UAAU,EAAE,GAAG;gBACf,aAAa,EAAE,kBAAkB,CAAC,MAAM;gBACxC,WAAW,EAAE,CAAC;aACf,CAAC,CAAC;QACL,CAAC;QAED,iFAAiF;QACjF,MAAM,qBAAqB,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CACnD,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,KAAK,MAAM,CAAC,CAC/C,CAAC;QACF,IAAI,qBAAqB,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;YACtC,UAAU,CAAC,IAAI,CAAC;gBACd,EAAE,EAAE,6BAA6B;gBACjC,IAAI,EAAE,oCAAoC;gBAC1C,WAAW,EAAE,8DAA8D;gBAC3E,SAAS,EAAE,EAAE,eAAe,EAAE,GAAG,EAAE;gBACnC,MAAM,EAAE,EAAE,cAAc,EAAE,IAAI,EAAE;gBAChC,UAAU,EAAE,GAAG;gBACf,aAAa,EAAE,qBAAqB,CAAC,MAAM;gBAC3C,WAAW,EAAE,CAAC;aACf,CAAC,CAAC;QACL,CAAC;QAED,qEAAqE;QACrE,MAAM,kBAAkB,GAAG,IAAI,CAAC,aAAa,CAAC,SAAS,CAAC,CAAC;QACzD,IAAI,kBAAkB,GAAG,CAAC,EAAE,CAAC;YAC3B,MAAM,gBAAgB,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE;gBAC3C,MAAM,KAAK,GAAG,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC;gBAC9D,OAAO,KAAK,GAAG,kBAAkB,GAAG,CAAC,CAAC;YACxC,CAAC,CAAC,CAAC;YACH,IAAI,gBAAgB,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;gBACjC,UAAU,CAAC,IAAI,CAAC;oBACd,EAAE,EAAE,+BAA+B;oBACnC,IAAI,EAAE,qCAAqC;oBAC3C,WAAW,EAAE,0EAA0E;oBACvF,SAAS,EAAE,EAAE,eAAe,EAAE,GAAG,EAAE;oBACnC,MAAM,EAAE,EAAE,cAAc,EAAE,IAAI,EAAE;oBAChC,UAAU,EAAE,GAAG;oBACf,aAAa,EAAE,gBAAgB,CAAC,MAAM;oBACtC,WAAW,EAAE,CAAC;iBACf,CAAC,CAAC;YACL,CAAC;QACH,CAAC;QAED,uEAAuE;QACvE,mDAAmD;QACnD,MAAM,eAAe,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAC1C,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,WAAW,GAAG,CAAC,CAAC,CACxC,CAAC;QACF,IAAI,eAAe,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;YAChC,UAAU,CAAC,IAAI,CAAC;gBACd,EAAE,EAAE,8BAA8B;gBAClC,IAAI,EAAE,oCAAoC;gBAC1C,WAAW,EAAE,2EAA2E;gBACxF,SAAS,EAAE,EAAE,oBAAoB,EAAE,GAAG,EAAE;gBACxC,MAAM,EAAE,EAAE,cAAc,EAAE,IAAI,EAAE;gBAChC,UAAU,EAAE,GAAG;gBACf,aAAa,EAAE,eAAe,CAAC,MAAM;gBACrC,WAAW,EAAE,CAAC;aACf,CAAC,CAAC;QACL,CAAC;QAED,8DAA8D;QAC9D,MAAM,eAAe,GAAG,SAAS,CAAC,MAAM,CACtC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,IAAI,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,KAAK,MAAM,CAAC,CAC9E,CAAC;QACF,IAAI,eAAe,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;YAChC,UAAU,CAAC,IAAI,CAAC;gBACd,EAAE,EAAE,+BAA+B;gBACnC,IAAI,EAAE,sCAAsC;gBAC5C,WAAW,EAAE,+EAA+E;gBAC5F,SAAS,EAAE,EAAE,SAAS,EAAE,WAAW,EAAE,eAAe,EAAE,GAAG,EAAE;gBAC3D,MAAM,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE;gBAC3B,UAAU,EAAE,GAAG;gBACf,aAAa,EAAE,eAAe,CAAC,MAAM;gBACrC,WAAW,EAAE,CAAC;aACf,CAAC,CAAC;QACL,CAAC;QAED,OAAO,UAAU,CAAC;IACpB,CAAC;IAEO,aAAa,CAAC,QAAwB;QAC5C,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,CAAC,CAAC;QACpC,MAAM,KAAK,GAAG,QAAQ,CAAC,MAAM,CAC3B,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC,EAC/D,CAAC,CACF,CAAC;QACF,OAAO,KAAK,GAAG,QAAQ,CAAC,MAAM,CAAC;IACjC,CAAC;IAED,mEAAmE;IAE3D,wBAAwB,CAAC,IAAiB,EAAE,IAAkB;QACpE,MAAM,EAAE,SAAS,EAAE,GAAG,IAAI,CAAC;QAE3B,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;YAChC,IAAI,OAAO,GAAG,IAAI,CAAC;YAEnB,IAAI,SAAS,CAAC,SAAS,KAAK,SAAS,IAAI,KAAK,CAAC,IAAI,KAAK,SAAS,CAAC,SAAS,EAAE,CAAC;gBAC5E,OAAO,GAAG,KAAK,CAAC;YAClB,CAAC;YAED,IAAI,SAAS,CAAC,eAAe,KAAK,SAAS,EAAE,CAAC;gBAC5C,MAAM,SAAS,GAAG,KAAK,CAAC,UAAU,KAAK,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,UAAU,KAAK,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC;gBAC/F,IAAI,SAAS,IAAI,SAAS,CAAC,eAAe;oBAAE,OAAO,GAAG,KAAK,CAAC;YAC9D,CAAC;YAED,IAAI,SAAS,CAAC,eAAe,KAAK,SAAS,EAAE,CAAC;gBAC5C,MAAM,SAAS,GAAG,KAAK,CAAC,UAAU,KAAK,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,UAAU,KAAK,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC;gBAC/F,IAAI,SAAS,IAAI,SAAS,CAAC,eAAe;oBAAE,OAAO,GAAG,KAAK,CAAC;YAC9D,CAAC;YAED,IAAI,SAAS,CAAC,WAAW,KAAK,SAAS,IAAI,KAAK,CAAC,WAAW,KAAK,SAAS,CAAC,WAAW,EAAE,CAAC;gBACvF,OAAO,GAAG,KAAK,CAAC;YAClB,CAAC;YAED,gFAAgF;YAChF,qFAAqF;YACrF,kEAAkE;YAClE,IAAI,SAAS,CAAC,eAAe,KAAK,SAAS,EAAE,CAAC;gBAC5C,uEAAuE;gBACvE,mDAAmD;gBACnD,IAAI,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,MAAM,KAAK,CAAC;oBAAE,OAAO,GAAG,KAAK,CAAC,CAAC,+BAA+B;YAC3F,CAAC;YAED,IAAI,SAAS,CAAC,oBAAoB,KAAK,SAAS,EAAE,CAAC;gBACjD,iEAAiE;gBACjE,yCAAyC;gBACzC,IAAI,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,MAAM,KAAK,CAAC;oBAAE,OAAO,GAAG,KAAK,CAAC;YAC3D,CAAC;YAED,IAAI,OAAO;gBAAE,OAAO,IAAI,CAAC;QAC3B,CAAC;QAED,OAAO,KAAK,CAAC;IACf,CAAC;IAED,mEAAmE;IAE3D,QAAQ,CAAC,IAAiB;QAChC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC;YACjB,EAAE,EAAE,IAAI,CAAC,EAAE;YACX,IAAI,EAAE,WAAW;YACjB,KAAK,EAAE,IAAI,CAAC,IAAI;YAChB,UAAU,EAAE;gBACV,WAAW,EAAE,IAAI,CAAC,WAAW;gBAC7B,SAAS,EAAE,IAAI,CAAC,SAAS;gBACzB,MAAM,EAAE,IAAI,CAAC,MAAM;gBACnB,UAAU,EAAE,IAAI,CAAC,UAAU;gBAC3B,aAAa,EAAE,IAAI,CAAC,aAAa;gBACjC,WAAW,EAAE,IAAI,CAAC,WAAW;aAC9B;SACF,CAAC,CAAC;IACL,CAAC;IAEO,SAAS;QACf,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,cAAc,CAAC,WAAW,CAAC,CAAC;QACrD,MAAM,KAAK,GAAkB,EAAE,CAAC;QAEhC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,UAAU,CAAC,OAAO,CAAC;gBAAE,SAAS;YAE3C,MAAM,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC;YAC9B,KAAK,CAAC,IAAI,CAAC;gBACT,EAAE,EAAE,IAAI,CAAC,EAAE;gBACX,IAAI,EAAE,IAAI,CAAC,KAAK;gBAChB,WAAW,EAAG,KAAK,CAAC,WAAsB,IAAI,EAAE;gBAChD,SAAS,EAAG,KAAK,CAAC,SAAsC,IAAI,EAAE;gBAC9D,MAAM,EAAG,KAAK,CAAC,MAAgC,IAAI,EAAE;gBACrD,UAAU,EAAG,KAAK,CAAC,UAAqB,IAAI,GAAG;gBAC/C,aAAa,EAAG,KAAK,CAAC,aAAwB,IAAI,CAAC;gBACnD,WAAW,EAAG,KAAK,CAAC,WAAsB,IAAI,CAAC;aAChD,CAAC,CAAC;QACL,CAAC;QAED,OAAO,KAAK,CAAC;IACf,CAAC;IAED,mEAAmE;IAE3D,cAAc,CAAC,IAAiB,EAAE,MAAsB;QAC9D,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,WAAW,GAAG,GAAG,CAAC,CAAC;QACjD,MAAM,IAAI,GAAG,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;QACjC,OAAO,CACL,GAAG,IAAI,CAAC,IAAI,KAAK,IAAI,GAAG,GAAG,wBAAwB,MAAM,CAAC,YAAY,qBAAqB;YAC3F,WAAW,MAAM,CAAC,eAAe,UAAU,MAAM,CAAC,aAAa,IAAI;YACnE,uBAAuB,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,iBAAiB,GAAG,GAAG,CAAC,IAAI,CACtE,CAAC;IACJ,CAAC;CACF"}

package/dist/runtime/graph-synthesis.d.ts

@@ -0,0 +1,47 @@
+import type { ExecutionGraph } from './execution-graph.js';
+export interface TopologyInsight {
+    feature: string;
+    successCorrelation: number;
+    sampleSize: number;
+    confidence: 'low' | 'medium' | 'high';
+}
+export interface SynthesizedPattern {
+    name: string;
+    phases: PhaseSpec[];
+    confidence: number;
+    reasoning: string;
+    basedOn: string[];
+}
+export interface PhaseSpec {
+    name: string;
+    kind: string;
+    agentTypes: string[];
+    parallel: boolean;
+    dependsOn?: string[];
+}
+/**
+ * Analyzes structural diffs between successful and failed orchestration
+ * topologies, then generates novel pattern DAGs based on the insights.
+ */
+export declare class PatternSynthesizer {
+    private graph;
+    constructor(graph: ExecutionGraph);
+    /**
+     * Analyze what structural features correlate with success/failure.
+     * Splits orchestrations by status, extracts topology features via BFS,
+     * then computes success rate deltas per feature.
+     */
+    analyzeTopologyDiffs(minSamples?: number): TopologyInsight[];
+    /**
+     * Generate a novel pattern from topology insights.
+     * Starts with a base structure (research → implement → review), then
+     * applies positive insights as additions and negative insights as removals.
+     */
+    synthesizePattern(taskDescription: string, filePatterns?: string[]): SynthesizedPattern | null;
+    /**
+     * Extract topology features from a single orchestration via BFS (depth 3).
+     * Returns a map of boolean features describing the orchestration's structure.
+     */
+    extractTopologyFeatures(orchestrationId: string): Map<string, boolean>;
+}
+//# sourceMappingURL=graph-synthesis.d.ts.map

package/dist/runtime/graph-synthesis.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph-synthesis.d.ts","sourceRoot":"","sources":["../../src/runtime/graph-synthesis.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,sBAAsB,CAAC;AAK3D,MAAM,WAAW,eAAe;IAC9B,OAAO,EAAE,MAAM,CAAC;IAChB,kBAAkB,EAAE,MAAM,CAAC;IAC3B,UAAU,EAAE,MAAM,CAAC;IACnB,UAAU,EAAE,KAAK,GAAG,QAAQ,GAAG,MAAM,CAAC;CACvC;AAED,MAAM,WAAW,kBAAkB;IACjC,IAAI,EAAE,MAAM,CAAC;IACb,MAAM,EAAE,SAAS,EAAE,CAAC;IACpB,UAAU,EAAE,MAAM,CAAC;IACnB,SAAS,EAAE,MAAM,CAAC;IAClB,OAAO,EAAE,MAAM,EAAE,CAAC;CACnB;AAED,MAAM,WAAW,SAAS;IACxB,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,MAAM,CAAC;IACb,UAAU,EAAE,MAAM,EAAE,CAAC;IACrB,QAAQ,EAAE,OAAO,CAAC;IAClB,SAAS,CAAC,EAAE,MAAM,EAAE,CAAC;CACtB;AAID;;;GAGG;AACH,qBAAa,kBAAkB;IACjB,OAAO,CAAC,KAAK;gBAAL,KAAK,EAAE,cAAc;IAEzC;;;;OAIG;IACH,oBAAoB,CAAC,UAAU,SAAI,GAAG,eAAe,EAAE;IAmEvD;;;;OAIG;IACH,iBAAiB,CAAC,eAAe,EAAE,MAAM,EAAE,YAAY,CAAC,EAAE,MAAM,EAAE,GAAG,kBAAkB,GAAG,IAAI;IAiH9F;;;OAGG;IACH,uBAAuB,CAAC,eAAe,EAAE,MAAM,GAAG,GAAG,CAAC,MAAM,EAAE,OAAO,CAAC;CAwEvE"}