figma-to-code-agent 0.6.0 → 0.8.0

package/dist/agent/DecisionEngine.js

@@ -0,0 +1,414 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.DecisionEngine = void 0;
+/**
+ * 决策引擎
+ * 根据意图和可用工具生成、评估和选择执行策略
+ */
+class DecisionEngine {
+    /**
+     * 生成可能的策略
+     */
+    generateStrategies(intent, availableTools) {
+        const strategies = [];
+        // 根据意图类型生成不同的策略
+        switch (intent.type) {
+            case 'generate_new':
+                strategies.push(...this.generateNewCodeStrategies(intent, availableTools));
+                break;
+            case 'update_existing':
+                strategies.push(...this.generateUpdateStrategies(intent, availableTools));
+                break;
+            case 'optimize':
+                strategies.push(...this.generateOptimizeStrategies(intent, availableTools));
+                break;
+            case 'analyze':
+                strategies.push(...this.generateAnalyzeStrategies(intent, availableTools));
+                break;
+        }
+        return strategies;
+    }
+    /**
+     * 评估策略
+     */
+    evaluateStrategy(strategy, context) {
+        // 评估可行性（基于工具可用性和步骤复杂度）
+        const feasibility = this.calculateFeasibility(strategy);
+        // 评估成本（基于预估的 token 使用和 API 调用）
+        const cost = strategy.estimatedCost;
+        // 评估质量（基于策略的预期质量和用户要求）
+        const quality = this.calculateQuality(strategy, context);
+        // 评估速度（基于预估时间和用户要求）
+        const speed = this.calculateSpeed(strategy, context);
+        // 计算加权总分
+        const weights = this.getWeights(context);
+        const total = feasibility * weights.feasibility +
+            (1 - cost / 10000) * weights.cost + // 归一化成本
+            quality * weights.quality +
+            speed * weights.speed;
+        return {
+            feasibility,
+            cost,
+            quality,
+            speed,
+            total,
+        };
+    }
+    /**
+     * 选择最佳策略
+     */
+    selectBestStrategy(strategies, context) {
+        if (strategies.length === 0) {
+            throw new Error('No strategies available');
+        }
+        // 评估所有策略
+        const scoredStrategies = strategies.map((strategy) => ({
+            strategy,
+            score: this.evaluateStrategy(strategy, context),
+        }));
+        // 按总分排序
+        scoredStrategies.sort((a, b) => b.score.total - a.score.total);
+        return scoredStrategies[0].strategy;
+    }
+    /**
+     * 分析设计复杂度
+     */
+    analyzeComplexity(figmaData) {
+        const nodeCount = this.countNodes(figmaData);
+        const depth = this.calculateDepth(figmaData);
+        let complexity;
+        if (nodeCount < 20) {
+            complexity = 'simple';
+        }
+        else if (nodeCount < 50) {
+            complexity = 'medium';
+        }
+        else {
+            complexity = 'complex';
+        }
+        return { nodeCount, depth, complexity };
+    }
+    // ========== 私有方法 ==========
+    /**
+     * 生成新代码的策略
+     */
+    generateNewCodeStrategies(intent, _availableTools) {
+        const strategies = [];
+        const qualityMode = intent.qualityMode || 'balanced';
+        // 策略 1：快速规则策略（适合简单设计）
+        if (qualityMode === 'fast' || qualityMode === 'balanced') {
+            strategies.push({
+                id: 'fast-rule-based',
+                name: '快速规则策略',
+                description: '使用规则引擎快速生成代码，适合简单设计',
+                steps: this.buildFastRuleSteps(intent),
+                estimatedTime: 30,
+                estimatedCost: 1000,
+                expectedQuality: qualityMode === 'fast' ? 'medium' : 'high',
+            });
+        }
+        // 策略 2：AI 增强策略（适合复杂设计）
+        if (qualityMode === 'balanced' || qualityMode === 'high') {
+            strategies.push({
+                id: 'ai-enhanced',
+                name: 'AI 增强策略',
+                description: '使用 AI 辅助生成高质量代码，适合复杂设计',
+                steps: this.buildAIEnhancedSteps(intent),
+                estimatedTime: 120,
+                estimatedCost: 5000,
+                expectedQuality: 'high',
+            });
+        }
+        return strategies;
+    }
+    /**
+     * 生成更新代码的策略
+     */
+    generateUpdateStrategies(intent, _availableTools) {
+        return [
+            {
+                id: 'incremental-update',
+                name: '增量更新策略',
+                description: '分析差异并选择性更新代码',
+                steps: [
+                    {
+                        tool: 'project-analysis',
+                        action: 'analyze',
+                        inputs: { path: '.' },
+                    },
+                    {
+                        tool: 'figma-extraction',
+                        action: 'extract',
+                        inputs: { figmaInput: intent.figmaInput },
+                    },
+                    {
+                        tool: 'diff-analysis',
+                        action: 'compare',
+                        inputs: {},
+                    },
+                    {
+                        tool: 'code-generation',
+                        action: 'update',
+                        inputs: {
+                            framework: intent.targetFramework,
+                            styleMode: intent.styleMode,
+                            updateMode: 'selective',
+                        },
+                    },
+                ],
+                estimatedTime: 90,
+                estimatedCost: 3000,
+                expectedQuality: 'high',
+            },
+        ];
+    }
+    /**
+     * 生成优化代码的策略
+     */
+    generateOptimizeStrategies(_intent, _availableTools) {
+        return [
+            {
+                id: 'optimization',
+                name: '代码优化策略',
+                description: '分析并优化现有代码',
+                steps: [
+                    {
+                        tool: 'project-analysis',
+                        action: 'analyze',
+                        inputs: { path: '.' },
+                    },
+                    {
+                        tool: 'performance-optimizer',
+                        action: 'optimize',
+                        inputs: {},
+                    },
+                    {
+                        tool: 'accessibility-enhancer',
+                        action: 'enhance',
+                        inputs: {},
+                    },
+                ],
+                estimatedTime: 60,
+                estimatedCost: 2000,
+                expectedQuality: 'high',
+            },
+        ];
+    }
+    /**
+     * 生成分析设计的策略
+     */
+    generateAnalyzeStrategies(intent, _availableTools) {
+        return [
+            {
+                id: 'design-analysis',
+                name: '设计分析策略',
+                description: '分析设计并提供建议',
+                steps: [
+                    {
+                        tool: 'figma-extraction',
+                        action: 'extract',
+                        inputs: { figmaInput: intent.figmaInput },
+                    },
+                    {
+                        tool: 'design-analyzer',
+                        action: 'analyze',
+                        inputs: {},
+                    },
+                ],
+                estimatedTime: 30,
+                estimatedCost: 1500,
+                expectedQuality: 'high',
+            },
+        ];
+    }
+    /**
+     * 构建快速规则策略的步骤
+     */
+    buildFastRuleSteps(intent) {
+        const steps = [
+            {
+                tool: 'figma-extraction',
+                action: 'extract',
+                inputs: { figmaInput: intent.figmaInput },
+                fallbackTool: 'figma-api',
+            },
+            {
+                tool: 'transformation',
+                action: 'transform',
+                inputs: { mode: 'fast' },
+            },
+            {
+                tool: 'code-generation',
+                action: 'generate',
+                inputs: {
+                    framework: intent.targetFramework,
+                    styleMode: intent.styleMode,
+                    typescript: intent.additionalRequirements.includes('typescript'),
+                },
+            },
+        ];
+        return steps;
+    }
+    /**
+     * 构建 AI 增强策略的步骤
+     */
+    buildAIEnhancedSteps(intent) {
+        const steps = [
+            {
+                tool: 'figma-extraction',
+                action: 'extract',
+                inputs: { figmaInput: intent.figmaInput },
+                fallbackTool: 'figma-api',
+            },
+            {
+                tool: 'transformation',
+                action: 'transform',
+                inputs: { mode: 'enhanced' },
+            },
+            {
+                tool: 'semantic-namer',
+                action: 'name',
+                inputs: {},
+            },
+            {
+                tool: 'component-extractor',
+                action: 'extract',
+                inputs: {},
+            },
+            {
+                tool: 'code-generation',
+                action: 'generate',
+                inputs: {
+                    framework: intent.targetFramework,
+                    styleMode: intent.styleMode,
+                    typescript: intent.additionalRequirements.includes('typescript'),
+                },
+            },
+        ];
+        // 添加可选的优化步骤
+        if (intent.qualityMode === 'high') {
+            steps.push({
+                tool: 'accessibility-enhancer',
+                action: 'enhance',
+                inputs: {},
+            }, {
+                tool: 'performance-optimizer',
+                action: 'optimize',
+                inputs: {},
+            });
+        }
+        // 添加响应式支持
+        if (intent.additionalRequirements.includes('responsive')) {
+            steps.push({
+                tool: 'responsive-merger',
+                action: 'merge',
+                inputs: {},
+            });
+        }
+        return steps;
+    }
+    /**
+     * 计算可行性分数
+     */
+    calculateFeasibility(strategy) {
+        // 基于步骤数量和复杂度
+        const stepCount = strategy.steps.length;
+        const hasFallbacks = strategy.steps.some((s) => s.fallbackTool);
+        let score = 1.0;
+        // 步骤越多，可行性略微降低
+        score -= stepCount * 0.02;
+        // 有回退选项增加可行性
+        if (hasFallbacks) {
+            score += 0.1;
+        }
+        return Math.max(0, Math.min(1, score));
+    }
+    /**
+     * 计算质量分数
+     */
+    calculateQuality(strategy, context) {
+        const qualityMap = {
+            low: 0.5,
+            medium: 0.75,
+            high: 1.0,
+        };
+        let score = qualityMap[strategy.expectedQuality];
+        // 如果用户要求高质量，提升高质量策略的分数
+        if (context.intent?.qualityMode === 'high' && strategy.expectedQuality === 'high') {
+            score += 0.1;
+        }
+        return Math.min(1, score);
+    }
+    /**
+     * 计算速度分数
+     */
+    calculateSpeed(strategy, context) {
+        // 时间越短，速度分数越高
+        const maxTime = 180; // 3 分钟
+        let score = 1 - strategy.estimatedTime / maxTime;
+        // 如果用户要求快速，提升快速策略的分数
+        if (context.intent?.qualityMode === 'fast' && strategy.estimatedTime < 60) {
+            score += 0.2;
+        }
+        return Math.max(0, Math.min(1, score));
+    }
+    /**
+     * 获取评分权重
+     */
+    getWeights(context) {
+        const qualityMode = context.intent?.qualityMode || 'balanced';
+        switch (qualityMode) {
+            case 'fast':
+                return {
+                    feasibility: 0.3,
+                    cost: 0.1,
+                    quality: 0.2,
+                    speed: 0.4,
+                };
+            case 'high':
+                return {
+                    feasibility: 0.2,
+                    cost: 0.1,
+                    quality: 0.5,
+                    speed: 0.2,
+                };
+            case 'balanced':
+            default:
+                return {
+                    feasibility: 0.25,
+                    cost: 0.15,
+                    quality: 0.35,
+                    speed: 0.25,
+                };
+        }
+    }
+    /**
+     * 计算节点数量
+     */
+    countNodes(data) {
+        if (!data)
+            return 0;
+        let count = 1;
+        if (data.children && Array.isArray(data.children)) {
+            for (const child of data.children) {
+                count += this.countNodes(child);
+            }
+        }
+        return count;
+    }
+    /**
+     * 计算树深度
+     */
+    calculateDepth(data) {
+        if (!data) {
+            return 0;
+        }
+        if (!data.children || data.children.length === 0) {
+            return 1;
+        }
+        const childDepths = data.children.map((child) => this.calculateDepth(child));
+        return 1 + Math.max(...childDepths);
+    }
+}
+exports.DecisionEngine = DecisionEngine;
+//# sourceMappingURL=DecisionEngine.js.map

package/dist/agent/DecisionEngine.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"DecisionEngine.js","sourceRoot":"","sources":["../../src/agent/DecisionEngine.ts"],"names":[],"mappings":";;;AAGA;;;GAGG;AACH,MAAa,cAAc;IACzB;;OAEG;IACH,kBAAkB,CAAC,MAAc,EAAE,cAAsB;QACvD,MAAM,UAAU,GAAe,EAAE,CAAC;QAElC,gBAAgB;QAChB,QAAQ,MAAM,CAAC,IAAI,EAAE,CAAC;YACpB,KAAK,cAAc;gBACjB,UAAU,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,yBAAyB,CAAC,MAAM,EAAE,cAAc,CAAC,CAAC,CAAC;gBAC3E,MAAM;YACR,KAAK,iBAAiB;gBACpB,UAAU,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,wBAAwB,CAAC,MAAM,EAAE,cAAc,CAAC,CAAC,CAAC;gBAC1E,MAAM;YACR,KAAK,UAAU;gBACb,UAAU,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,0BAA0B,CAAC,MAAM,EAAE,cAAc,CAAC,CAAC,CAAC;gBAC5E,MAAM;YACR,KAAK,SAAS;gBACZ,UAAU,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,yBAAyB,CAAC,MAAM,EAAE,cAAc,CAAC,CAAC,CAAC;gBAC3E,MAAM;QACV,CAAC;QAED,OAAO,UAAU,CAAC;IACpB,CAAC;IAED;;OAEG;IACH,gBAAgB,CAAC,QAAkB,EAAE,OAA4B;QAC/D,uBAAuB;QACvB,MAAM,WAAW,GAAG,IAAI,CAAC,oBAAoB,CAAC,QAAQ,CAAC,CAAC;QAExD,+BAA+B;QAC/B,MAAM,IAAI,GAAG,QAAQ,CAAC,aAAa,CAAC;QAEpC,uBAAuB;QACvB,MAAM,OAAO,GAAG,IAAI,CAAC,gBAAgB,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC;QAEzD,oBAAoB;QACpB,MAAM,KAAK,GAAG,IAAI,CAAC,cAAc,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC;QAErD,SAAS;QACT,MAAM,OAAO,GAAG,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;QACzC,MAAM,KAAK,GACT,WAAW,GAAG,OAAO,CAAC,WAAW;YACjC,CAAC,CAAC,GAAG,IAAI,GAAG,KAAK,CAAC,GAAG,OAAO,CAAC,IAAI,GAAG,QAAQ;YAC5C,OAAO,GAAG,OAAO,CAAC,OAAO;YACzB,KAAK,GAAG,OAAO,CAAC,KAAK,CAAC;QAExB,OAAO;YACL,WAAW;YACX,IAAI;YACJ,OAAO;YACP,KAAK;YACL,KAAK;SACN,CAAC;IACJ,CAAC;IAED;;OAEG;IACH,kBAAkB,CAAC,UAAsB,EAAE,OAA4B;QACrE,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC5B,MAAM,IAAI,KAAK,CAAC,yBAAyB,CAAC,CAAC;QAC7C,CAAC;QAED,SAAS;QACT,MAAM,gBAAgB,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC;YACrD,QAAQ;YACR,KAAK,EAAE,IAAI,CAAC,gBAAgB,CAAC,QAAQ,EAAE,OAAO,CAAC;SAChD,CAAC,CAAC,CAAC;QAEJ,QAAQ;QACR,gBAAgB,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;QAE/D,OAAO,gBAAgB,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC;IACtC,CAAC;IAED;;OAEG;IACH,iBAAiB,CAAC,SAAc;QAK9B,MAAM,SAAS,GAAG,IAAI,CAAC,UAAU,CAAC,SAAS,CAAC,CAAC;QAC7C,MAAM,KAAK,GAAG,IAAI,CAAC,cAAc,CAAC,SAAS,CAAC,CAAC;QAE7C,IAAI,UAA2C,CAAC;QAChD,IAAI,SAAS,GAAG,EAAE,EAAE,CAAC;YACnB,UAAU,GAAG,QAAQ,CAAC;QACxB,CAAC;aAAM,IAAI,SAAS,GAAG,EAAE,EAAE,CAAC;YAC1B,UAAU,GAAG,QAAQ,CAAC;QACxB,CAAC;aAAM,CAAC;YACN,UAAU,GAAG,SAAS,CAAC;QACzB,CAAC;QAED,OAAO,EAAE,SAAS,EAAE,KAAK,EAAE,UAAU,EAAE,CAAC;IAC1C,CAAC;IAED,6BAA6B;IAE7B;;OAEG;IACK,yBAAyB,CAAC,MAAc,EAAE,eAAuB;QACvE,MAAM,UAAU,GAAe,EAAE,CAAC;QAClC,MAAM,WAAW,GAAG,MAAM,CAAC,WAAW,IAAI,UAAU,CAAC;QAErD,sBAAsB;QACtB,IAAI,WAAW,KAAK,MAAM,IAAI,WAAW,KAAK,UAAU,EAAE,CAAC;YACzD,UAAU,CAAC,IAAI,CAAC;gBACd,EAAE,EAAE,iBAAiB;gBACrB,IAAI,EAAE,QAAQ;gBACd,WAAW,EAAE,qBAAqB;gBAClC,KAAK,EAAE,IAAI,CAAC,kBAAkB,CAAC,MAAM,CAAC;gBACtC,aAAa,EAAE,EAAE;gBACjB,aAAa,EAAE,IAAI;gBACnB,eAAe,EAAE,WAAW,KAAK,MAAM,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,MAAM;aAC5D,CAAC,CAAC;QACL,CAAC;QAED,uBAAuB;QACvB,IAAI,WAAW,KAAK,UAAU,IAAI,WAAW,KAAK,MAAM,EAAE,CAAC;YACzD,UAAU,CAAC,IAAI,CAAC;gBACd,EAAE,EAAE,aAAa;gBACjB,IAAI,EAAE,SAAS;gBACf,WAAW,EAAE,wBAAwB;gBACrC,KAAK,EAAE,IAAI,CAAC,oBAAoB,CAAC,MAAM,CAAC;gBACxC,aAAa,EAAE,GAAG;gBAClB,aAAa,EAAE,IAAI;gBACnB,eAAe,EAAE,MAAM;aACxB,CAAC,CAAC;QACL,CAAC;QAED,OAAO,UAAU,CAAC;IACpB,CAAC;IAED;;OAEG;IACK,wBAAwB,CAAC,MAAc,EAAE,eAAuB;QACtE,OAAO;YACL;gBACE,EAAE,EAAE,oBAAoB;gBACxB,IAAI,EAAE,QAAQ;gBACd,WAAW,EAAE,cAAc;gBAC3B,KAAK,EAAE;oBACL;wBACE,IAAI,EAAE,kBAAkB;wBACxB,MAAM,EAAE,SAAS;wBACjB,MAAM,EAAE,EAAE,IAAI,EAAE,GAAG,EAAE;qBACtB;oBACD;wBACE,IAAI,EAAE,kBAAkB;wBACxB,MAAM,EAAE,SAAS;wBACjB,MAAM,EAAE,EAAE,UAAU,EAAE,MAAM,CAAC,UAAU,EAAE;qBAC1C;oBACD;wBACE,IAAI,EAAE,eAAe;wBACrB,MAAM,EAAE,SAAS;wBACjB,MAAM,EAAE,EAAE;qBACX;oBACD;wBACE,IAAI,EAAE,iBAAiB;wBACvB,MAAM,EAAE,QAAQ;wBAChB,MAAM,EAAE;4BACN,SAAS,EAAE,MAAM,CAAC,eAAe;4BACjC,SAAS,EAAE,MAAM,CAAC,SAAS;4BAC3B,UAAU,EAAE,WAAW;yBACxB;qBACF;iBACF;gBACD,aAAa,EAAE,EAAE;gBACjB,aAAa,EAAE,IAAI;gBACnB,eAAe,EAAE,MAAM;aACxB;SACF,CAAC;IACJ,CAAC;IAED;;OAEG;IACK,0BAA0B,CAAC,OAAe,EAAE,eAAuB;QACzE,OAAO;YACL;gBACE,EAAE,EAAE,cAAc;gBAClB,IAAI,EAAE,QAAQ;gBACd,WAAW,EAAE,WAAW;gBACxB,KAAK,EAAE;oBACL;wBACE,IAAI,EAAE,kBAAkB;wBACxB,MAAM,EAAE,SAAS;wBACjB,MAAM,EAAE,EAAE,IAAI,EAAE,GAAG,EAAE;qBACtB;oBACD;wBACE,IAAI,EAAE,uBAAuB;wBAC7B,MAAM,EAAE,UAAU;wBAClB,MAAM,EAAE,EAAE;qBACX;oBACD;wBACE,IAAI,EAAE,wBAAwB;wBAC9B,MAAM,EAAE,SAAS;wBACjB,MAAM,EAAE,EAAE;qBACX;iBACF;gBACD,aAAa,EAAE,EAAE;gBACjB,aAAa,EAAE,IAAI;gBACnB,eAAe,EAAE,MAAM;aACxB;SACF,CAAC;IACJ,CAAC;IAED;;OAEG;IACK,yBAAyB,CAAC,MAAc,EAAE,eAAuB;QACvE,OAAO;YACL;gBACE,EAAE,EAAE,iBAAiB;gBACrB,IAAI,EAAE,QAAQ;gBACd,WAAW,EAAE,WAAW;gBACxB,KAAK,EAAE;oBACL;wBACE,IAAI,EAAE,kBAAkB;wBACxB,MAAM,EAAE,SAAS;wBACjB,MAAM,EAAE,EAAE,UAAU,EAAE,MAAM,CAAC,UAAU,EAAE;qBAC1C;oBACD;wBACE,IAAI,EAAE,iBAAiB;wBACvB,MAAM,EAAE,SAAS;wBACjB,MAAM,EAAE,EAAE;qBACX;iBACF;gBACD,aAAa,EAAE,EAAE;gBACjB,aAAa,EAAE,IAAI;gBACnB,eAAe,EAAE,MAAM;aACxB;SACF,CAAC;IACJ,CAAC;IAED;;OAEG;IACK,kBAAkB,CAAC,MAAc;QACvC,MAAM,KAAK,GAAmB;YAC5B;gBACE,IAAI,EAAE,kBAAkB;gBACxB,MAAM,EAAE,SAAS;gBACjB,MAAM,EAAE,EAAE,UAAU,EAAE,MAAM,CAAC,UAAU,EAAE;gBACzC,YAAY,EAAE,WAAW;aAC1B;YACD;gBACE,IAAI,EAAE,gBAAgB;gBACtB,MAAM,EAAE,WAAW;gBACnB,MAAM,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE;aACzB;YACD;gBACE,IAAI,EAAE,iBAAiB;gBACvB,MAAM,EAAE,UAAU;gBAClB,MAAM,EAAE;oBACN,SAAS,EAAE,MAAM,CAAC,eAAe;oBACjC,SAAS,EAAE,MAAM,CAAC,SAAS;oBAC3B,UAAU,EAAE,MAAM,CAAC,sBAAsB,CAAC,QAAQ,CAAC,YAAY,CAAC;iBACjE;aACF;SACF,CAAC;QAEF,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;OAEG;IACK,oBAAoB,CAAC,MAAc;QACzC,MAAM,KAAK,GAAmB;YAC5B;gBACE,IAAI,EAAE,kBAAkB;gBACxB,MAAM,EAAE,SAAS;gBACjB,MAAM,EAAE,EAAE,UAAU,EAAE,MAAM,CAAC,UAAU,EAAE;gBACzC,YAAY,EAAE,WAAW;aAC1B;YACD;gBACE,IAAI,EAAE,gBAAgB;gBACtB,MAAM,EAAE,WAAW;gBACnB,MAAM,EAAE,EAAE,IAAI,EAAE,UAAU,EAAE;aAC7B;YACD;gBACE,IAAI,EAAE,gBAAgB;gBACtB,MAAM,EAAE,MAAM;gBACd,MAAM,EAAE,EAAE;aACX;YACD;gBACE,IAAI,EAAE,qBAAqB;gBAC3B,MAAM,EAAE,SAAS;gBACjB,MAAM,EAAE,EAAE;aACX;YACD;gBACE,IAAI,EAAE,iBAAiB;gBACvB,MAAM,EAAE,UAAU;gBAClB,MAAM,EAAE;oBACN,SAAS,EAAE,MAAM,CAAC,eAAe;oBACjC,SAAS,EAAE,MAAM,CAAC,SAAS;oBAC3B,UAAU,EAAE,MAAM,CAAC,sBAAsB,CAAC,QAAQ,CAAC,YAAY,CAAC;iBACjE;aACF;SACF,CAAC;QAEF,YAAY;QACZ,IAAI,MAAM,CAAC,WAAW,KAAK,MAAM,EAAE,CAAC;YAClC,KAAK,CAAC,IAAI,CACR;gBACE,IAAI,EAAE,wBAAwB;gBAC9B,MAAM,EAAE,SAAS;gBACjB,MAAM,EAAE,EAAE;aACX,EACD;gBACE,IAAI,EAAE,uBAAuB;gBAC7B,MAAM,EAAE,UAAU;gBAClB,MAAM,EAAE,EAAE;aACX,CACF,CAAC;QACJ,CAAC;QAED,UAAU;QACV,IAAI,MAAM,CAAC,sBAAsB,CAAC,QAAQ,CAAC,YAAY,CAAC,EAAE,CAAC;YACzD,KAAK,CAAC,IAAI,CAAC;gBACT,IAAI,EAAE,mBAAmB;gBACzB,MAAM,EAAE,OAAO;gBACf,MAAM,EAAE,EAAE;aACX,CAAC,CAAC;QACL,CAAC;QAED,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;OAEG;IACK,oBAAoB,CAAC,QAAkB;QAC7C,aAAa;QACb,MAAM,SAAS,GAAG,QAAQ,CAAC,KAAK,CAAC,MAAM,CAAC;QACxC,MAAM,YAAY,GAAG,QAAQ,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC;QAEhE,IAAI,KAAK,GAAG,GAAG,CAAC;QAEhB,eAAe;QACf,KAAK,IAAI,SAAS,GAAG,IAAI,CAAC;QAE1B,aAAa;QACb,IAAI,YAAY,EAAE,CAAC;YACjB,KAAK,IAAI,GAAG,CAAC;QACf,CAAC;QAED,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC;IACzC,CAAC;IAED;;OAEG;IACK,gBAAgB,CAAC,QAAkB,EAAE,OAA4B;QACvE,MAAM,UAAU,GAAG;YACjB,GAAG,EAAE,GAAG;YACR,MAAM,EAAE,IAAI;YACZ,IAAI,EAAE,GAAG;SACV,CAAC;QAEF,IAAI,KAAK,GAAG,UAAU,CAAC,QAAQ,CAAC,eAAe,CAAC,CAAC;QAEjD,uBAAuB;QACvB,IAAI,OAAO,CAAC,MAAM,EAAE,WAAW,KAAK,MAAM,IAAI,QAAQ,CAAC,eAAe,KAAK,MAAM,EAAE,CAAC;YAClF,KAAK,IAAI,GAAG,CAAC;QACf,CAAC;QAED,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;IAC5B,CAAC;IAED;;OAEG;IACK,cAAc,CAAC,QAAkB,EAAE,OAA4B;QACrE,cAAc;QACd,MAAM,OAAO,GAAG,GAAG,CAAC,CAAC,OAAO;QAC5B,IAAI,KAAK,GAAG,CAAC,GAAG,QAAQ,CAAC,aAAa,GAAG,OAAO,CAAC;QAEjD,qBAAqB;QACrB,IAAI,OAAO,CAAC,MAAM,EAAE,WAAW,KAAK,MAAM,IAAI,QAAQ,CAAC,aAAa,GAAG,EAAE,EAAE,CAAC;YAC1E,KAAK,IAAI,GAAG,CAAC;QACf,CAAC;QAED,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC;IACzC,CAAC;IAED;;OAEG;IACK,UAAU,CAAC,OAA4B;QAM7C,MAAM,WAAW,GAAG,OAAO,CAAC,MAAM,EAAE,WAAW,IAAI,UAAU,CAAC;QAE9D,QAAQ,WAAW,EAAE,CAAC;YACpB,KAAK,MAAM;gBACT,OAAO;oBACL,WAAW,EAAE,GAAG;oBAChB,IAAI,EAAE,GAAG;oBACT,OAAO,EAAE,GAAG;oBACZ,KAAK,EAAE,GAAG;iBACX,CAAC;YACJ,KAAK,MAAM;gBACT,OAAO;oBACL,WAAW,EAAE,GAAG;oBAChB,IAAI,EAAE,GAAG;oBACT,OAAO,EAAE,GAAG;oBACZ,KAAK,EAAE,GAAG;iBACX,CAAC;YACJ,KAAK,UAAU,CAAC;YAChB;gBACE,OAAO;oBACL,WAAW,EAAE,IAAI;oBACjB,IAAI,EAAE,IAAI;oBACV,OAAO,EAAE,IAAI;oBACb,KAAK,EAAE,IAAI;iBACZ,CAAC;QACN,CAAC;IACH,CAAC;IAED;;OAEG;IACK,UAAU,CAAC,IAAS;QAC1B,IAAI,CAAC,IAAI;YAAE,OAAO,CAAC,CAAC;QAEpB,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,IAAI,IAAI,CAAC,QAAQ,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC;YAClD,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;gBAClC,KAAK,IAAI,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;YAClC,CAAC;QACH,CAAC;QAED,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;OAEG;IACK,cAAc,CAAC,IAAS;QAC9B,IAAI,CAAC,IAAI,EAAE,CAAC;YACV,OAAO,CAAC,CAAC;QACX,CAAC;QAED,IAAI,CAAC,IAAI,CAAC,QAAQ,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACjD,OAAO,CAAC,CAAC;QACX,CAAC;QAED,MAAM,WAAW,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,KAAU,EAAE,EAAE,CAAC,IAAI,CAAC,cAAc,CAAC,KAAK,CAAC,CAAC,CAAC;QAClF,OAAO,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,WAAW,CAAC,CAAC;IACtC,CAAC;CACF;AA/cD,wCA+cC"}

package/dist/agent/ExecutionOrchestrator.d.ts

@@ -0,0 +1,55 @@
+import type { Strategy, ExecutionResult, ToolResult, ConversationContext } from './types';
+import type { Tool } from '../tools/types';
+/**
+ * 执行编排器
+ * 协调工具调用和处理结果
+ */
+export declare class ExecutionOrchestrator {
+    private tools;
+    private executionStartTime;
+    private totalTokensUsed;
+    private totalApiCalls;
+    private toolsInvoked;
+    constructor(tools: Map<string, Tool>);
+    /**
+     * 执行策略
+     */
+    executeStrategy(strategy: Strategy, context: ConversationContext): Promise<ExecutionResult>;
+    /**
+     * 调用工具（带重试和回退）
+     */
+    private invokeToolWithRetry;
+    /**
+     * 调用回退工具
+     */
+    private invokeFallbackTool;
+    /**
+     * 调用工具
+     */
+    invokeTool(tool: Tool, inputs: Record<string, any>): Promise<ToolResult>;
+    /**
+     * 处理工具失败
+     */
+    handleToolFailure(tool: Tool, error: Error, fallback?: Tool): Promise<ToolResult>;
+    /**
+     * 保存检查点
+     */
+    private saveCheckpoint;
+    /**
+     * 从检查点恢复
+     */
+    restoreFromCheckpoint(context: ConversationContext, checkpointId: string): Promise<boolean>;
+    /**
+     * 分析执行结果并决定下一步
+     */
+    private analyzeResults;
+    /**
+     * 获取执行指标
+     */
+    private getMetrics;
+    /**
+     * 重置指标
+     */
+    resetMetrics(): void;
+}
+//# sourceMappingURL=ExecutionOrchestrator.d.ts.map

package/dist/agent/ExecutionOrchestrator.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"ExecutionOrchestrator.d.ts","sourceRoot":"","sources":["../../src/agent/ExecutionOrchestrator.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EACV,QAAQ,EAER,eAAe,EAGf,UAAU,EACV,mBAAmB,EAGpB,MAAM,SAAS,CAAC;AACjB,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,gBAAgB,CAAC;AAE3C;;;GAGG;AACH,qBAAa,qBAAqB;IAMpB,OAAO,CAAC,KAAK;IALzB,OAAO,CAAC,kBAAkB,CAAa;IACvC,OAAO,CAAC,eAAe,CAAa;IACpC,OAAO,CAAC,aAAa,CAAa;IAClC,OAAO,CAAC,YAAY,CAAgB;gBAEhB,KAAK,EAAE,GAAG,CAAC,MAAM,EAAE,IAAI,CAAC;IAE5C;;OAEG;IACG,eAAe,CACnB,QAAQ,EAAE,QAAQ,EAClB,OAAO,EAAE,mBAAmB,GAC3B,OAAO,CAAC,eAAe,CAAC;IAwH3B;;OAEG;YACW,mBAAmB;IA+DjC;;OAEG;YACW,kBAAkB;IA4ChC;;OAEG;IACG,UAAU,CAAC,IAAI,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC,GAAG,OAAO,CAAC,UAAU,CAAC;IA8B9E;;OAEG;IACG,iBAAiB,CACrB,IAAI,EAAE,IAAI,EACV,KAAK,EAAE,KAAK,EACZ,QAAQ,CAAC,EAAE,IAAI,GACd,OAAO,CAAC,UAAU,CAAC;IAgCtB;;OAEG;IACH,OAAO,CAAC,cAAc;IAetB;;OAEG;IACG,qBAAqB,CACzB,OAAO,EAAE,mBAAmB,EAC5B,YAAY,EAAE,MAAM,GACnB,OAAO,CAAC,OAAO,CAAC;IAgBnB;;OAEG;IACH,OAAO,CAAC,cAAc;IA6BtB;;OAEG;IACH,OAAO,CAAC,UAAU;IASlB;;OAEG;IACH,YAAY,IAAI,IAAI;CAMrB"}