@toyako/hive 1.0.0

package/dist/learning/ExecutionEpisodeStore.d.ts

@@ -0,0 +1,64 @@
+/**
+ * ExecutionEpisodeStore — Learning Loop Module 1
+ *
+ * 存储结构化 execution history（不是日志）
+ *
+ * 支持：
+ * - 按 task type 查询
+ * - 按 failure type 查询
+ * - 持久化（memory + optional disk）
+ */
+export interface NodeExecution {
+    nodeId: string;
+    agent: string;
+    status: "completed" | "failed" | "retrying";
+    duration: number;
+    error?: string;
+    failureType?: string;
+}
+export interface ExecutionEpisode {
+    id: string;
+    timestamp: number;
+    task: string;
+    dag: {
+        nodes: string[];
+        edges: string[];
+    };
+    executionTrace: NodeExecution[];
+    outcome: {
+        status: "SUCCESS" | "FAILED" | "PARTIAL";
+        duration: number;
+    };
+}
+export declare class ExecutionEpisodeStore {
+    private episodes;
+    /**
+     * 存储 episode
+     */
+    store(episode: ExecutionEpisode): void;
+    /**
+     * 获取 episode
+     */
+    get(id: string): ExecutionEpisode | undefined;
+    /**
+     * 按 task type 查询
+     */
+    queryByTask(task: string): ExecutionEpisode[];
+    /**
+     * 按 failure type 查询
+     */
+    queryByFailureType(failureType: string): ExecutionEpisode[];
+    /**
+     * 获取所有 episodes
+     */
+    getAll(): ExecutionEpisode[];
+    /**
+     * 获取最近 N 个 episodes
+     */
+    getRecent(n: number): ExecutionEpisode[];
+    /**
+     * 清空
+     */
+    clear(): void;
+}
+//# sourceMappingURL=ExecutionEpisodeStore.d.ts.map

package/dist/learning/ExecutionEpisodeStore.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"ExecutionEpisodeStore.d.ts","sourceRoot":"","sources":["../../src/learning/ExecutionEpisodeStore.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAGH,MAAM,WAAW,aAAa;IAC5B,MAAM,EAAE,MAAM,CAAC;IACf,KAAK,EAAE,MAAM,CAAC;IACd,MAAM,EAAE,WAAW,GAAG,QAAQ,GAAG,UAAU,CAAC;IAC5C,QAAQ,EAAE,MAAM,CAAC;IACjB,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,WAAW,CAAC,EAAE,MAAM,CAAC;CACtB;AAGD,MAAM,WAAW,gBAAgB;IAC/B,EAAE,EAAE,MAAM,CAAC;IACX,SAAS,EAAE,MAAM,CAAC;IAClB,IAAI,EAAE,MAAM,CAAC;IACb,GAAG,EAAE;QACH,KAAK,EAAE,MAAM,EAAE,CAAC;QAChB,KAAK,EAAE,MAAM,EAAE,CAAC;KACjB,CAAC;IACF,cAAc,EAAE,aAAa,EAAE,CAAC;IAChC,OAAO,EAAE;QACP,MAAM,EAAE,SAAS,GAAG,QAAQ,GAAG,SAAS,CAAC;QACzC,QAAQ,EAAE,MAAM,CAAC;KAClB,CAAC;CACH;AAED,qBAAa,qBAAqB;IAChC,OAAO,CAAC,QAAQ,CAA4C;IAE5D;;OAEG;IACH,KAAK,CAAC,OAAO,EAAE,gBAAgB,GAAG,IAAI;IAItC;;OAEG;IACH,GAAG,CAAC,EAAE,EAAE,MAAM,GAAG,gBAAgB,GAAG,SAAS;IAI7C;;OAEG;IACH,WAAW,CAAC,IAAI,EAAE,MAAM,GAAG,gBAAgB,EAAE;IAM7C;;OAEG;IACH,kBAAkB,CAAC,WAAW,EAAE,MAAM,GAAG,gBAAgB,EAAE;IAM3D;;OAEG;IACH,MAAM,IAAI,gBAAgB,EAAE;IAI5B;;OAEG;IACH,SAAS,CAAC,CAAC,EAAE,MAAM,GAAG,gBAAgB,EAAE;IAMxC;;OAEG;IACH,KAAK,IAAI,IAAI;CAGd"}

package/dist/learning/ExecutionEpisodeStore.js

@@ -0,0 +1,62 @@
+"use strict";
+/**
+ * ExecutionEpisodeStore — Learning Loop Module 1
+ *
+ * 存储结构化 execution history（不是日志）
+ *
+ * 支持：
+ * - 按 task type 查询
+ * - 按 failure type 查询
+ * - 持久化（memory + optional disk）
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.ExecutionEpisodeStore = void 0;
+class ExecutionEpisodeStore {
+    episodes = new Map();
+    /**
+     * 存储 episode
+     */
+    store(episode) {
+        this.episodes.set(episode.id, episode);
+    }
+    /**
+     * 获取 episode
+     */
+    get(id) {
+        return this.episodes.get(id);
+    }
+    /**
+     * 按 task type 查询
+     */
+    queryByTask(task) {
+        return Array.from(this.episodes.values()).filter(e => e.task.toLowerCase().includes(task.toLowerCase()));
+    }
+    /**
+     * 按 failure type 查询
+     */
+    queryByFailureType(failureType) {
+        return Array.from(this.episodes.values()).filter(e => e.executionTrace.some(t => t.failureType === failureType));
+    }
+    /**
+     * 获取所有 episodes
+     */
+    getAll() {
+        return Array.from(this.episodes.values());
+    }
+    /**
+     * 获取最近 N 个 episodes
+     */
+    getRecent(n) {
+        return this.getAll()
+            .sort((a, b) => b.timestamp - a.timestamp)
+            .slice(0, n);
+    }
+    /**
+     * 清空
+     */
+    clear() {
+        this.episodes.clear();
+    }
+}
+exports.ExecutionEpisodeStore = ExecutionEpisodeStore;
+//# sourceMappingURL=ExecutionEpisodeStore.js.map

package/dist/learning/ExecutionEpisodeStore.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"ExecutionEpisodeStore.js","sourceRoot":"","sources":["../../src/learning/ExecutionEpisodeStore.ts"],"names":[],"mappings":";AAAA;;;;;;;;;GASG;;;AA4BH,MAAa,qBAAqB;IACxB,QAAQ,GAAkC,IAAI,GAAG,EAAE,CAAC;IAE5D;;OAEG;IACH,KAAK,CAAC,OAAyB;QAC7B,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,EAAE,OAAO,CAAC,CAAC;IACzC,CAAC;IAED;;OAEG;IACH,GAAG,CAAC,EAAU;QACZ,OAAO,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IAC/B,CAAC;IAED;;OAEG;IACH,WAAW,CAAC,IAAY;QACtB,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CACnD,CAAC,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC,QAAQ,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC,CAClD,CAAC;IACJ,CAAC;IAED;;OAEG;IACH,kBAAkB,CAAC,WAAmB;QACpC,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CACnD,CAAC,CAAC,cAAc,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,WAAW,KAAK,WAAW,CAAC,CAC1D,CAAC;IACJ,CAAC;IAED;;OAEG;IACH,MAAM;QACJ,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,CAAC;IAC5C,CAAC;IAED;;OAEG;IACH,SAAS,CAAC,CAAS;QACjB,OAAO,IAAI,CAAC,MAAM,EAAE;aACjB,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,GAAG,CAAC,CAAC,SAAS,CAAC;aACzC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACjB,CAAC;IAED;;OAEG;IACH,KAAK;QACH,IAAI,CAAC,QAAQ,CAAC,KAAK,EAAE,CAAC;IACxB,CAAC;CACF;AAzDD,sDAyDC"}

package/dist/learning/InsightEngine.d.ts

@@ -0,0 +1,31 @@
+/**
+ * InsightEngine — Learning Loop Module 2
+ *
+ * 从 execution episode 中提取"可学习信息"
+ *
+ * 规则：
+ * 1. root cause detection: FAILED node with longest latency = root candidate
+ * 2. bottleneck scoring: node_time / total_time
+ * 3. recovery effectiveness: retry_success ? 1 : 0
+ */
+import { ExecutionEpisode } from "./ExecutionEpisodeStore";
+export interface ExecutionInsight {
+    rootCause: string;
+    failureType: "NETWORK" | "TOOL" | "MODEL" | "PLANNER" | "UNKNOWN";
+    criticalNode?: string;
+    retryEffectiveness: number;
+    recoveryRequired: boolean;
+    bottleneckScore: number;
+    confidence: number;
+}
+export declare class InsightEngine {
+    /**
+     * 从 episode 生成 insight
+     */
+    analyze(episode: ExecutionEpisode): ExecutionInsight;
+    /**
+     * 分类失败类型
+     */
+    private classifyFailure;
+}
+//# sourceMappingURL=InsightEngine.d.ts.map

package/dist/learning/InsightEngine.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"InsightEngine.d.ts","sourceRoot":"","sources":["../../src/learning/InsightEngine.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAEH,OAAO,EAAE,gBAAgB,EAAiB,MAAM,yBAAyB,CAAC;AAG1E,MAAM,WAAW,gBAAgB;IAC/B,SAAS,EAAE,MAAM,CAAC;IAClB,WAAW,EAAE,SAAS,GAAG,MAAM,GAAG,OAAO,GAAG,SAAS,GAAG,SAAS,CAAC;IAClE,YAAY,CAAC,EAAE,MAAM,CAAC;IACtB,kBAAkB,EAAE,MAAM,CAAC;IAC3B,gBAAgB,EAAE,OAAO,CAAC;IAC1B,eAAe,EAAE,MAAM,CAAC;IACxB,UAAU,EAAE,MAAM,CAAC;CACpB;AAED,qBAAa,aAAa;IACxB;;OAEG;IACH,OAAO,CAAC,OAAO,EAAE,gBAAgB,GAAG,gBAAgB;IAkCpD;;OAEG;IACH,OAAO,CAAC,eAAe;CAYxB"}

package/dist/learning/InsightEngine.js

@@ -0,0 +1,63 @@
+"use strict";
+/**
+ * InsightEngine — Learning Loop Module 2
+ *
+ * 从 execution episode 中提取"可学习信息"
+ *
+ * 规则：
+ * 1. root cause detection: FAILED node with longest latency = root candidate
+ * 2. bottleneck scoring: node_time / total_time
+ * 3. recovery effectiveness: retry_success ? 1 : 0
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.InsightEngine = void 0;
+class InsightEngine {
+    /**
+     * 从 episode 生成 insight
+     */
+    analyze(episode) {
+        const failedNodes = episode.executionTrace.filter(t => t.status === "failed");
+        const retriedNodes = episode.executionTrace.filter(t => t.status === "retrying");
+        // Root cause: FAILED node with longest latency
+        const rootCauseNode = failedNodes.reduce((max, node) => node.duration > max.duration ? node : max, failedNodes[0]);
+        // Bottleneck scoring: node_time / total_time
+        const totalDuration = episode.outcome.duration;
+        const bottleneckScore = rootCauseNode
+            ? rootCauseNode.duration / totalDuration
+            : 0;
+        // Recovery effectiveness: retry_success ? 1 : 0
+        const retryEffectiveness = retriedNodes.length > 0
+            ? (retriedNodes.some(n => n.status === "completed") ? 1 : 0)
+            : 0;
+        // Failure type
+        const failureType = this.classifyFailure(rootCauseNode);
+        return {
+            rootCause: rootCauseNode?.error || "Unknown",
+            failureType,
+            criticalNode: rootCauseNode?.nodeId,
+            retryEffectiveness,
+            recoveryRequired: failedNodes.length > 0,
+            bottleneckScore,
+            confidence: failedNodes.length > 0 ? 0.8 : 0.5
+        };
+    }
+    /**
+     * 分类失败类型
+     */
+    classifyFailure(node) {
+        if (!node?.error)
+            return "UNKNOWN";
+        const error = node.error.toLowerCase();
+        if (error.includes("network") || error.includes("timeout"))
+            return "NETWORK";
+        if (error.includes("tool"))
+            return "TOOL";
+        if (error.includes("model") || error.includes("llm"))
+            return "MODEL";
+        if (error.includes("planner"))
+            return "PLANNER";
+        return "UNKNOWN";
+    }
+}
+exports.InsightEngine = InsightEngine;
+//# sourceMappingURL=InsightEngine.js.map

package/dist/learning/InsightEngine.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"InsightEngine.js","sourceRoot":"","sources":["../../src/learning/InsightEngine.ts"],"names":[],"mappings":";AAAA;;;;;;;;;GASG;;;AAeH,MAAa,aAAa;IACxB;;OAEG;IACH,OAAO,CAAC,OAAyB;QAC/B,MAAM,WAAW,GAAG,OAAO,CAAC,cAAc,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,QAAQ,CAAC,CAAC;QAC9E,MAAM,YAAY,GAAG,OAAO,CAAC,cAAc,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,UAAU,CAAC,CAAC;QAEjF,+CAA+C;QAC/C,MAAM,aAAa,GAAG,WAAW,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,IAAI,EAAE,EAAE,CACrD,IAAI,CAAC,QAAQ,GAAG,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,EACzC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC;QAElB,6CAA6C;QAC7C,MAAM,aAAa,GAAG,OAAO,CAAC,OAAO,CAAC,QAAQ,CAAC;QAC/C,MAAM,eAAe,GAAG,aAAa;YACnC,CAAC,CAAC,aAAa,CAAC,QAAQ,GAAG,aAAa;YACxC,CAAC,CAAC,CAAC,CAAC;QAEN,gDAAgD;QAChD,MAAM,kBAAkB,GAAG,YAAY,CAAC,MAAM,GAAG,CAAC;YAChD,CAAC,CAAC,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAC5D,CAAC,CAAC,CAAC,CAAC;QAEN,eAAe;QACf,MAAM,WAAW,GAAG,IAAI,CAAC,eAAe,CAAC,aAAa,CAAC,CAAC;QAExD,OAAO;YACL,SAAS,EAAE,aAAa,EAAE,KAAK,IAAI,SAAS;YAC5C,WAAW;YACX,YAAY,EAAE,aAAa,EAAE,MAAM;YACnC,kBAAkB;YAClB,gBAAgB,EAAE,WAAW,CAAC,MAAM,GAAG,CAAC;YACxC,eAAe;YACf,UAAU,EAAE,WAAW,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG;SAC/C,CAAC;IACJ,CAAC;IAED;;OAEG;IACK,eAAe,CAAC,IAAoB;QAC1C,IAAI,CAAC,IAAI,EAAE,KAAK;YAAE,OAAO,SAAS,CAAC;QAEnC,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,WAAW,EAAE,CAAC;QAEvC,IAAI,KAAK,CAAC,QAAQ,CAAC,SAAS,CAAC,IAAI,KAAK,CAAC,QAAQ,CAAC,SAAS,CAAC;YAAE,OAAO,SAAS,CAAC;QAC7E,IAAI,KAAK,CAAC,QAAQ,CAAC,MAAM,CAAC;YAAE,OAAO,MAAM,CAAC;QAC1C,IAAI,KAAK,CAAC,QAAQ,CAAC,OAAO,CAAC,IAAI,KAAK,CAAC,QAAQ,CAAC,KAAK,CAAC;YAAE,OAAO,OAAO,CAAC;QACrE,IAAI,KAAK,CAAC,QAAQ,CAAC,SAAS,CAAC;YAAE,OAAO,SAAS,CAAC;QAEhD,OAAO,SAAS,CAAC;IACnB,CAAC;CACF;AArDD,sCAqDC"}

package/dist/learning/LearningLoopEngine.d.ts

@@ -0,0 +1,48 @@
+/**
+ * LearningLoopEngine — Learning Loop v1
+ *
+ * 从 Self-Healing Execution Runtime 升级为 Self-Improving Execution Runtime
+ *
+ * 执行流程：
+ * 1. Store ExecutionEpisode
+ * 2. Generate ExecutionInsight
+ * 3. Compress memory patterns
+ * 4. Optimize policy
+ * 5. Update PolicyStore
+ * 6. Attach policy to next execution
+ */
+import { ExecutionEpisode } from "./ExecutionEpisodeStore";
+import { ExecutionInsight } from "./InsightEngine";
+import { ExecutionPolicy } from "./PolicyStore";
+import { LearnedPattern } from "./MemoryCompressor";
+export interface LearningResult {
+    insight: ExecutionInsight;
+    patterns: LearnedPattern[];
+    policyUpdated: boolean;
+    policyVersion: number;
+}
+export declare class LearningLoopEngine {
+    private episodeStore;
+    private insightEngine;
+    private policyStore;
+    private policyOptimizer;
+    private memoryCompressor;
+    constructor();
+    /**
+     * 处理执行结果（Learning Loop）
+     */
+    processExecution(episode: ExecutionEpisode): LearningResult;
+    /**
+     * 获取当前策略
+     */
+    getPolicy(): ExecutionPolicy;
+    /**
+     * 获取所有 episodes
+     */
+    getEpisodes(): ExecutionEpisode[];
+    /**
+     * 获取所有 patterns
+     */
+    getPatterns(): LearnedPattern[];
+}
+//# sourceMappingURL=LearningLoopEngine.d.ts.map

package/dist/learning/LearningLoopEngine.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"LearningLoopEngine.d.ts","sourceRoot":"","sources":["../../src/learning/LearningLoopEngine.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAEH,OAAO,EAAyB,gBAAgB,EAAE,MAAM,yBAAyB,CAAC;AAClF,OAAO,EAAiB,gBAAgB,EAAE,MAAM,iBAAiB,CAAC;AAClE,OAAO,EAAe,eAAe,EAAE,MAAM,eAAe,CAAC;AAE7D,OAAO,EAAoB,cAAc,EAAE,MAAM,oBAAoB,CAAC;AAGtE,MAAM,WAAW,cAAc;IAC7B,OAAO,EAAE,gBAAgB,CAAC;IAC1B,QAAQ,EAAE,cAAc,EAAE,CAAC;IAC3B,aAAa,EAAE,OAAO,CAAC;IACvB,aAAa,EAAE,MAAM,CAAC;CACvB;AAED,qBAAa,kBAAkB;IAC7B,OAAO,CAAC,YAAY,CAAwB;IAC5C,OAAO,CAAC,aAAa,CAAgB;IACrC,OAAO,CAAC,WAAW,CAAc;IACjC,OAAO,CAAC,eAAe,CAAkB;IACzC,OAAO,CAAC,gBAAgB,CAAmB;;IAU3C;;OAEG;IACH,gBAAgB,CAAC,OAAO,EAAE,gBAAgB,GAAG,cAAc;IA8B3D;;OAEG;IACH,SAAS,IAAI,eAAe;IAI5B;;OAEG;IACH,WAAW,IAAI,gBAAgB,EAAE;IAIjC;;OAEG;IACH,WAAW,IAAI,cAAc,EAAE;CAGhC"}

package/dist/learning/LearningLoopEngine.js

@@ -0,0 +1,82 @@
+"use strict";
+/**
+ * LearningLoopEngine — Learning Loop v1
+ *
+ * 从 Self-Healing Execution Runtime 升级为 Self-Improving Execution Runtime
+ *
+ * 执行流程：
+ * 1. Store ExecutionEpisode
+ * 2. Generate ExecutionInsight
+ * 3. Compress memory patterns
+ * 4. Optimize policy
+ * 5. Update PolicyStore
+ * 6. Attach policy to next execution
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.LearningLoopEngine = void 0;
+const ExecutionEpisodeStore_1 = require("./ExecutionEpisodeStore");
+const InsightEngine_1 = require("./InsightEngine");
+const PolicyStore_1 = require("./PolicyStore");
+const PolicyOptimizer_1 = require("./PolicyOptimizer");
+const MemoryCompressor_1 = require("./MemoryCompressor");
+class LearningLoopEngine {
+    episodeStore;
+    insightEngine;
+    policyStore;
+    policyOptimizer;
+    memoryCompressor;
+    constructor() {
+        this.episodeStore = new ExecutionEpisodeStore_1.ExecutionEpisodeStore();
+        this.insightEngine = new InsightEngine_1.InsightEngine();
+        this.policyStore = new PolicyStore_1.PolicyStore();
+        this.policyOptimizer = new PolicyOptimizer_1.PolicyOptimizer(this.policyStore);
+        this.memoryCompressor = new MemoryCompressor_1.MemoryCompressor();
+    }
+    /**
+     * 处理执行结果（Learning Loop）
+     */
+    processExecution(episode) {
+        // 1. Store ExecutionEpisode
+        this.episodeStore.store(episode);
+        // 2. Generate ExecutionInsight
+        const insight = this.insightEngine.analyze(episode);
+        // 3. Compress memory patterns
+        const patterns = this.memoryCompressor.compress(this.episodeStore.getAll());
+        // 4. Optimize policy
+        let policyUpdated = false;
+        if (insight.recoveryRequired) {
+            policyUpdated = this.policyOptimizer.optimize(insight);
+        }
+        // 5. 检测振荡
+        if (this.policyOptimizer.detectOscillation()) {
+            this.policyStore.rollback();
+            policyUpdated = false;
+        }
+        return {
+            insight,
+            patterns,
+            policyUpdated,
+            policyVersion: this.policyStore.getVersion()
+        };
+    }
+    /**
+     * 获取当前策略
+     */
+    getPolicy() {
+        return this.policyStore.getCurrent();
+    }
+    /**
+     * 获取所有 episodes
+     */
+    getEpisodes() {
+        return this.episodeStore.getAll();
+    }
+    /**
+     * 获取所有 patterns
+     */
+    getPatterns() {
+        return this.memoryCompressor.compress(this.episodeStore.getAll());
+    }
+}
+exports.LearningLoopEngine = LearningLoopEngine;
+//# sourceMappingURL=LearningLoopEngine.js.map

package/dist/learning/LearningLoopEngine.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"LearningLoopEngine.js","sourceRoot":"","sources":["../../src/learning/LearningLoopEngine.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;;;GAYG;;;AAEH,mEAAkF;AAClF,mDAAkE;AAClE,+CAA6D;AAC7D,uDAAoD;AACpD,yDAAsE;AAUtE,MAAa,kBAAkB;IACrB,YAAY,CAAwB;IACpC,aAAa,CAAgB;IAC7B,WAAW,CAAc;IACzB,eAAe,CAAkB;IACjC,gBAAgB,CAAmB;IAE3C;QACE,IAAI,CAAC,YAAY,GAAG,IAAI,6CAAqB,EAAE,CAAC;QAChD,IAAI,CAAC,aAAa,GAAG,IAAI,6BAAa,EAAE,CAAC;QACzC,IAAI,CAAC,WAAW,GAAG,IAAI,yBAAW,EAAE,CAAC;QACrC,IAAI,CAAC,eAAe,GAAG,IAAI,iCAAe,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;QAC7D,IAAI,CAAC,gBAAgB,GAAG,IAAI,mCAAgB,EAAE,CAAC;IACjD,CAAC;IAED;;OAEG;IACH,gBAAgB,CAAC,OAAyB;QACxC,4BAA4B;QAC5B,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;QAEjC,+BAA+B;QAC/B,MAAM,OAAO,GAAG,IAAI,CAAC,aAAa,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;QAEpD,8BAA8B;QAC9B,MAAM,QAAQ,GAAG,IAAI,CAAC,gBAAgB,CAAC,QAAQ,CAAC,IAAI,CAAC,YAAY,CAAC,MAAM,EAAE,CAAC,CAAC;QAE5E,qBAAqB;QACrB,IAAI,aAAa,GAAG,KAAK,CAAC;QAC1B,IAAI,OAAO,CAAC,gBAAgB,EAAE,CAAC;YAC7B,aAAa,GAAG,IAAI,CAAC,eAAe,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC;QACzD,CAAC;QAED,UAAU;QACV,IAAI,IAAI,CAAC,eAAe,CAAC,iBAAiB,EAAE,EAAE,CAAC;YAC7C,IAAI,CAAC,WAAW,CAAC,QAAQ,EAAE,CAAC;YAC5B,aAAa,GAAG,KAAK,CAAC;QACxB,CAAC;QAED,OAAO;YACL,OAAO;YACP,QAAQ;YACR,aAAa;YACb,aAAa,EAAE,IAAI,CAAC,WAAW,CAAC,UAAU,EAAE;SAC7C,CAAC;IACJ,CAAC;IAED;;OAEG;IACH,SAAS;QACP,OAAO,IAAI,CAAC,WAAW,CAAC,UAAU,EAAE,CAAC;IACvC,CAAC;IAED;;OAEG;IACH,WAAW;QACT,OAAO,IAAI,CAAC,YAAY,CAAC,MAAM,EAAE,CAAC;IACpC,CAAC;IAED;;OAEG;IACH,WAAW;QACT,OAAO,IAAI,CAAC,gBAAgB,CAAC,QAAQ,CAAC,IAAI,CAAC,YAAY,CAAC,MAAM,EAAE,CAAC,CAAC;IACpE,CAAC;CACF;AApED,gDAoEC"}

package/dist/learning/MemoryCompressor.d.ts

@@ -0,0 +1,31 @@
+/**
+ * MemoryCompressor — Learning Loop Module 5
+ *
+ * 将 execution history 压缩为 pattern
+ *
+ * 输出类型：
+ * - FAILURE_CLUSTER
+ * - SUCCESS_PATTERN
+ */
+import { ExecutionEpisode } from "./ExecutionEpisodeStore";
+export interface LearnedPattern {
+    patternType: "FAILURE_CLUSTER" | "SUCCESS_PATTERN";
+    description: string;
+    frequency: number;
+    suggestedPolicyChange: string;
+}
+export declare class MemoryCompressor {
+    /**
+     * 压缩 episodes 为 patterns
+     */
+    compress(episodes: ExecutionEpisode[]): LearnedPattern[];
+    /**
+     * 分析失败集群
+     */
+    private analyzeFailureClusters;
+    /**
+     * 分析成功模式
+     */
+    private analyzeSuccessPatterns;
+}
+//# sourceMappingURL=MemoryCompressor.d.ts.map

package/dist/learning/MemoryCompressor.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"MemoryCompressor.d.ts","sourceRoot":"","sources":["../../src/learning/MemoryCompressor.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAEH,OAAO,EAAE,gBAAgB,EAAE,MAAM,yBAAyB,CAAC;AAG3D,MAAM,WAAW,cAAc;IAC7B,WAAW,EAAE,iBAAiB,GAAG,iBAAiB,CAAC;IACnD,WAAW,EAAE,MAAM,CAAC;IACpB,SAAS,EAAE,MAAM,CAAC;IAClB,qBAAqB,EAAE,MAAM,CAAC;CAC/B;AAED,qBAAa,gBAAgB;IAC3B;;OAEG;IACH,QAAQ,CAAC,QAAQ,EAAE,gBAAgB,EAAE,GAAG,cAAc,EAAE;IAcxD;;OAEG;IACH,OAAO,CAAC,sBAAsB;IA8B9B;;OAEG;IACH,OAAO,CAAC,sBAAsB;CAmB/B"}

package/dist/learning/MemoryCompressor.js

@@ -0,0 +1,76 @@
+"use strict";
+/**
+ * MemoryCompressor — Learning Loop Module 5
+ *
+ * 将 execution history 压缩为 pattern
+ *
+ * 输出类型：
+ * - FAILURE_CLUSTER
+ * - SUCCESS_PATTERN
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.MemoryCompressor = void 0;
+class MemoryCompressor {
+    /**
+     * 压缩 episodes 为 patterns
+     */
+    compress(episodes) {
+        const patterns = [];
+        // 分析失败模式
+        const failureClusters = this.analyzeFailureClusters(episodes);
+        patterns.push(...failureClusters);
+        // 分析成功模式
+        const successPatterns = this.analyzeSuccessPatterns(episodes);
+        patterns.push(...successPatterns);
+        return patterns;
+    }
+    /**
+     * 分析失败集群
+     */
+    analyzeFailureClusters(episodes) {
+        const clusters = new Map();
+        for (const episode of episodes) {
+            if (episode.outcome.status === "FAILED") {
+                const failedNodes = episode.executionTrace.filter(t => t.status === "failed");
+                for (const node of failedNodes) {
+                    const key = `${node.failureType || "UNKNOWN"}_${node.agent}`;
+                    clusters.set(key, (clusters.get(key) || 0) + 1);
+                }
+            }
+        }
+        const patterns = [];
+        for (const [key, count] of clusters) {
+            if (count >= 2) {
+                const [failureType, agent] = key.split("_");
+                patterns.push({
+                    patternType: "FAILURE_CLUSTER",
+                    description: `${failureType} failure in ${agent} (${count} times)`,
+                    frequency: count,
+                    suggestedPolicyChange: `Increase retry for ${failureType} or switch from ${agent}`
+                });
+            }
+        }
+        return patterns;
+    }
+    /**
+     * 分析成功模式
+     */
+    analyzeSuccessPatterns(episodes) {
+        const successCount = episodes.filter(e => e.outcome.status === "SUCCESS").length;
+        const totalCount = episodes.length;
+        if (totalCount === 0)
+            return [];
+        const successRate = successCount / totalCount;
+        if (successRate > 0.8) {
+            return [{
+                    patternType: "SUCCESS_PATTERN",
+                    description: `High success rate (${(successRate * 100).toFixed(1)}%)`,
+                    frequency: successCount,
+                    suggestedPolicyChange: "Current policy is effective"
+                }];
+        }
+        return [];
+    }
+}
+exports.MemoryCompressor = MemoryCompressor;
+//# sourceMappingURL=MemoryCompressor.js.map

package/dist/learning/MemoryCompressor.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"MemoryCompressor.js","sourceRoot":"","sources":["../../src/learning/MemoryCompressor.ts"],"names":[],"mappings":";AAAA;;;;;;;;GAQG;;;AAYH,MAAa,gBAAgB;IAC3B;;OAEG;IACH,QAAQ,CAAC,QAA4B;QACnC,MAAM,QAAQ,GAAqB,EAAE,CAAC;QAEtC,SAAS;QACT,MAAM,eAAe,GAAG,IAAI,CAAC,sBAAsB,CAAC,QAAQ,CAAC,CAAC;QAC9D,QAAQ,CAAC,IAAI,CAAC,GAAG,eAAe,CAAC,CAAC;QAElC,SAAS;QACT,MAAM,eAAe,GAAG,IAAI,CAAC,sBAAsB,CAAC,QAAQ,CAAC,CAAC;QAC9D,QAAQ,CAAC,IAAI,CAAC,GAAG,eAAe,CAAC,CAAC;QAElC,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED;;OAEG;IACK,sBAAsB,CAAC,QAA4B;QACzD,MAAM,QAAQ,GAAwB,IAAI,GAAG,EAAE,CAAC;QAEhD,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE,CAAC;YAC/B,IAAI,OAAO,CAAC,OAAO,CAAC,MAAM,KAAK,QAAQ,EAAE,CAAC;gBACxC,MAAM,WAAW,GAAG,OAAO,CAAC,cAAc,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,QAAQ,CAAC,CAAC;gBAE9E,KAAK,MAAM,IAAI,IAAI,WAAW,EAAE,CAAC;oBAC/B,MAAM,GAAG,GAAG,GAAG,IAAI,CAAC,WAAW,IAAI,SAAS,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;oBAC7D,QAAQ,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;gBAClD,CAAC;YACH,CAAC;QACH,CAAC;QAED,MAAM,QAAQ,GAAqB,EAAE,CAAC;QACtC,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,QAAQ,EAAE,CAAC;YACpC,IAAI,KAAK,IAAI,CAAC,EAAE,CAAC;gBACf,MAAM,CAAC,WAAW,EAAE,KAAK,CAAC,GAAG,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;gBAC5C,QAAQ,CAAC,IAAI,CAAC;oBACZ,WAAW,EAAE,iBAAiB;oBAC9B,WAAW,EAAE,GAAG,WAAW,eAAe,KAAK,KAAK,KAAK,SAAS;oBAClE,SAAS,EAAE,KAAK;oBAChB,qBAAqB,EAAE,sBAAsB,WAAW,mBAAmB,KAAK,EAAE;iBACnF,CAAC,CAAC;YACL,CAAC;QACH,CAAC;QAED,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED;;OAEG;IACK,sBAAsB,CAAC,QAA4B;QACzD,MAAM,YAAY,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,MAAM,KAAK,SAAS,CAAC,CAAC,MAAM,CAAC;QACjF,MAAM,UAAU,GAAG,QAAQ,CAAC,MAAM,CAAC;QAEnC,IAAI,UAAU,KAAK,CAAC;YAAE,OAAO,EAAE,CAAC;QAEhC,MAAM,WAAW,GAAG,YAAY,GAAG,UAAU,CAAC;QAE9C,IAAI,WAAW,GAAG,GAAG,EAAE,CAAC;YACtB,OAAO,CAAC;oBACN,WAAW,EAAE,iBAAiB;oBAC9B,WAAW,EAAE,sBAAsB,CAAC,WAAW,GAAG,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI;oBACrE,SAAS,EAAE,YAAY;oBACvB,qBAAqB,EAAE,6BAA6B;iBACrD,CAAC,CAAC;QACL,CAAC;QAED,OAAO,EAAE,CAAC;IACZ,CAAC;CACF;AAzED,4CAyEC"}

package/dist/learning/PolicyOptimizer.d.ts

@@ -0,0 +1,26 @@
+/**
+ * PolicyOptimizer — Learning Loop Module 4
+ *
+ * 根据 Insight 更新 Policy
+ *
+ * 更新规则：
+ * 1. TOOL failure 高频 → increase retry count → enable tool fallback
+ * 2. NETWORK failure → increase backoff multiplier
+ * 3. bottleneck node repeatedly appears → mark routing preference away
+ * 4. low recovery effectiveness → reduce retry attempts → switch to REPLAN
+ */
+import { ExecutionInsight } from "./InsightEngine";
+import { PolicyStore } from "./PolicyStore";
+export declare class PolicyOptimizer {
+    private policyStore;
+    constructor(policyStore: PolicyStore);
+    /**
+     * 根据 insight 优化策略
+     */
+    optimize(insight: ExecutionInsight): boolean;
+    /**
+     * 检测振荡（policy flip）
+     */
+    detectOscillation(): boolean;
+}
+//# sourceMappingURL=PolicyOptimizer.d.ts.map

package/dist/learning/PolicyOptimizer.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"PolicyOptimizer.d.ts","sourceRoot":"","sources":["../../src/learning/PolicyOptimizer.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAEH,OAAO,EAAE,gBAAgB,EAAE,MAAM,iBAAiB,CAAC;AACnD,OAAO,EAAmB,WAAW,EAAE,MAAM,eAAe,CAAC;AAK7D,qBAAa,eAAe;IAC1B,OAAO,CAAC,WAAW,CAAc;gBAErB,WAAW,EAAE,WAAW;IAIpC;;OAEG;IACH,QAAQ,CAAC,OAAO,EAAE,gBAAgB,GAAG,OAAO;IA4D5C;;OAEG;IACH,iBAAiB,IAAI,OAAO;CAU7B"}

package/dist/learning/PolicyOptimizer.js

@@ -0,0 +1,91 @@
+"use strict";
+/**
+ * PolicyOptimizer — Learning Loop Module 4
+ *
+ * 根据 Insight 更新 Policy
+ *
+ * 更新规则：
+ * 1. TOOL failure 高频 → increase retry count → enable tool fallback
+ * 2. NETWORK failure → increase backoff multiplier
+ * 3. bottleneck node repeatedly appears → mark routing preference away
+ * 4. low recovery effectiveness → reduce retry attempts → switch to REPLAN
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.PolicyOptimizer = void 0;
+// Safety Guard
+const MIN_CONFIDENCE = 0.6;
+class PolicyOptimizer {
+    policyStore;
+    constructor(policyStore) {
+        this.policyStore = policyStore;
+    }
+    /**
+     * 根据 insight 优化策略
+     */
+    optimize(insight) {
+        // Safety Guard: 检查置信度
+        if (insight.confidence < MIN_CONFIDENCE) {
+            return false;
+        }
+        const current = this.policyStore.getCurrent();
+        const updates = {};
+        // 规则 1: TOOL failure 高频 → increase retry count
+        if (insight.failureType === "TOOL" && insight.bottleneckScore > 0.5) {
+            updates.retryStrategy = {
+                ...current.retryStrategy,
+                maxRetries: Math.min(current.retryStrategy.maxRetries + 1, 5)
+            };
+            updates.failureMappings = {
+                ...current.failureMappings,
+                TOOL: "SWITCH_TOOL"
+            };
+        }
+        // 规则 2: NETWORK failure → increase backoff
+        if (insight.failureType === "NETWORK") {
+            updates.retryStrategy = {
+                ...current.retryStrategy,
+                backoff: "exponential"
+            };
+        }
+        // 规则 3: bottleneck node → routing preference
+        if (insight.criticalNode && insight.bottleneckScore > 0.7) {
+            updates.routingRules = {
+                ...current.routingRules,
+                [insight.criticalNode]: "AVOID"
+            };
+        }
+        // 规则 4: low recovery effectiveness → switch to REPLAN
+        if (insight.retryEffectiveness < 0.5) {
+            updates.retryStrategy = {
+                ...current.retryStrategy,
+                maxRetries: Math.max(current.retryStrategy.maxRetries - 1, 1)
+            };
+            if (insight.failureType !== "UNKNOWN") {
+                updates.failureMappings = {
+                    ...current.failureMappings,
+                    [insight.failureType]: "REPLAN"
+                };
+            }
+        }
+        // 应用更新
+        if (Object.keys(updates).length > 0) {
+            this.policyStore.update(updates);
+            return true;
+        }
+        return false;
+    }
+    /**
+     * 检测振荡（policy flip）
+     */
+    detectOscillation() {
+        const history = this.policyStore.getHistory();
+        if (history.length < 3)
+            return false;
+        const recent = history.slice(-3);
+        const versions = recent.map(p => p.version);
+        // 简单振荡检测：版本号跳跃
+        return versions[2] - versions[0] > 2;
+    }
+}
+exports.PolicyOptimizer = PolicyOptimizer;
+//# sourceMappingURL=PolicyOptimizer.js.map

package/dist/learning/PolicyOptimizer.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"PolicyOptimizer.js","sourceRoot":"","sources":["../../src/learning/PolicyOptimizer.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;GAUG;;;AAKH,eAAe;AACf,MAAM,cAAc,GAAG,GAAG,CAAC;AAE3B,MAAa,eAAe;IAClB,WAAW,CAAc;IAEjC,YAAY,WAAwB;QAClC,IAAI,CAAC,WAAW,GAAG,WAAW,CAAC;IACjC,CAAC;IAED;;OAEG;IACH,QAAQ,CAAC,OAAyB;QAChC,sBAAsB;QACtB,IAAI,OAAO,CAAC,UAAU,GAAG,cAAc,EAAE,CAAC;YACxC,OAAO,KAAK,CAAC;QACf,CAAC;QAED,MAAM,OAAO,GAAG,IAAI,CAAC,WAAW,CAAC,UAAU,EAAE,CAAC;QAC9C,MAAM,OAAO,GAA6B,EAAE,CAAC;QAE7C,+CAA+C;QAC/C,IAAI,OAAO,CAAC,WAAW,KAAK,MAAM,IAAI,OAAO,CAAC,eAAe,GAAG,GAAG,EAAE,CAAC;YACpE,OAAO,CAAC,aAAa,GAAG;gBACtB,GAAG,OAAO,CAAC,aAAa;gBACxB,UAAU,EAAE,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,aAAa,CAAC,UAAU,GAAG,CAAC,EAAE,CAAC,CAAC;aAC9D,CAAC;YACF,OAAO,CAAC,eAAe,GAAG;gBACxB,GAAG,OAAO,CAAC,eAAe;gBAC1B,IAAI,EAAE,aAAa;aACpB,CAAC;QACJ,CAAC;QAED,2CAA2C;QAC3C,IAAI,OAAO,CAAC,WAAW,KAAK,SAAS,EAAE,CAAC;YACtC,OAAO,CAAC,aAAa,GAAG;gBACtB,GAAG,OAAO,CAAC,aAAa;gBACxB,OAAO,EAAE,aAAa;aACvB,CAAC;QACJ,CAAC;QAED,6CAA6C;QAC7C,IAAI,OAAO,CAAC,YAAY,IAAI,OAAO,CAAC,eAAe,GAAG,GAAG,EAAE,CAAC;YAC1D,OAAO,CAAC,YAAY,GAAG;gBACrB,GAAG,OAAO,CAAC,YAAY;gBACvB,CAAC,OAAO,CAAC,YAAY,CAAC,EAAE,OAAO;aAChC,CAAC;QACJ,CAAC;QAED,sDAAsD;QACtD,IAAI,OAAO,CAAC,kBAAkB,GAAG,GAAG,EAAE,CAAC;YACrC,OAAO,CAAC,aAAa,GAAG;gBACtB,GAAG,OAAO,CAAC,aAAa;gBACxB,UAAU,EAAE,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,aAAa,CAAC,UAAU,GAAG,CAAC,EAAE,CAAC,CAAC;aAC9D,CAAC;YACF,IAAI,OAAO,CAAC,WAAW,KAAK,SAAS,EAAE,CAAC;gBACtC,OAAO,CAAC,eAAe,GAAG;oBACxB,GAAG,OAAO,CAAC,eAAe;oBAC1B,CAAC,OAAO,CAAC,WAAW,CAAC,EAAE,QAAQ;iBAChC,CAAC;YACJ,CAAC;QACH,CAAC;QAED,OAAO;QACP,IAAI,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACpC,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;YACjC,OAAO,IAAI,CAAC;QACd,CAAC;QAED,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;OAEG;IACH,iBAAiB;QACf,MAAM,OAAO,GAAG,IAAI,CAAC,WAAW,CAAC,UAAU,EAAE,CAAC;QAC9C,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC;YAAE,OAAO,KAAK,CAAC;QAErC,MAAM,MAAM,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;QACjC,MAAM,QAAQ,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC;QAE5C,eAAe;QACf,OAAO,QAAQ,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IACvC,CAAC;CACF;AAnFD,0CAmFC"}