yuangs 5.60.0 → 5.63.0

package/dist/agent/PlanCache.js

@@ -0,0 +1,468 @@
+"use strict";
+var __importDefault = (this && this.__importDefault) || function (mod) {
+    return (mod && mod.__esModule) ? mod : { "default": mod };
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.defaultPlanCache = exports.PlanCache = void 0;
+const crypto_1 = __importDefault(require("crypto"));
+const DEFAULT_CACHE_CONFIG = {
+    maxEntries: 100,
+    ttl: 3600000, // 1 hour
+    enableComplexityAware: true,
+    similarityThreshold: 0.85
+};
+/**
+ * 计划缓存系统
+ *
+ * 功能:
+ * 1. 输入规范化 - 将可变参数替换为占位符
+ * 2. 相似度匹配 - 使用 TF-IDF 计算文本相似度
+ * 3. 复杂度感知 - 根据计划复杂度调整缓存策略
+ * 4. LRU 淘汰 - 最近最少使用优先淘汰
+ * 5. TTL 过期 - 自动清理过期缓存
+ *
+ * 使用场景:
+ * - 用户重复请求相似任务
+ * - 批量操作中的重复计划
+ * - 测试和调试阶段的频繁调用
+ */
+class PlanCache {
+    cache = new Map();
+    config;
+    totalHits = 0;
+    totalMisses = 0;
+    // LRU 优化: 跟踪最旧的条目键，避免 O(N) 遍历
+    lruKeys = new Set();
+    oldestKey;
+    // 停用词列表（用于 TF-IDF）
+    STOP_WORDS = new Set([
+        'the', 'a', 'an', 'is', 'are', 'was', 'were', 'be', 'been', 'being',
+        'have', 'has', 'had', 'do', 'does', 'did', 'will', 'would', 'could',
+        'should', 'may', 'might', 'must', 'shall', 'can', 'need', 'of', 'at',
+        'by', 'for', 'with', 'about', 'against', 'between', 'into', 'through',
+        'during', 'before', 'after', 'above', 'below', 'to', 'from', 'up', 'down',
+        'in', 'out', 'on', 'off', 'over', 'under', 'again', 'further', 'then',
+        'once', 'here', 'there', 'when', 'where', 'why', 'how', 'all', 'each',
+        'few', 'more', 'most', 'other', 'some', 'such', 'no', 'nor', 'not',
+        'only', 'own', 'same', 'so', 'than', 'too', 'very', 'just', 'and',
+        'but', 'if', 'or', 'because', 'as', 'until', 'while', '这', '那',
+        '是', '的', '了', '在', '有', '和', '与', '或', '如果', '那么',
+        '因为', '所以', '但是', '然后', '之后', '之前', '的时候'
+    ]);
+    constructor(config = {}) {
+        this.config = { ...DEFAULT_CACHE_CONFIG, ...config };
+    }
+    /**
+     * 获取或生成计划
+     */
+    async getOrGenerate(input, generator) {
+        const normalized = this.normalizeInput(input);
+        const hash = this.hashInput(normalized);
+        // 1. 尝试精确匹配
+        const exactEntry = this.cache.get(hash);
+        if (exactEntry && this.isValid(exactEntry)) {
+            exactEntry.accessCount++;
+            exactEntry.lastAccessed = Date.now();
+            exactEntry.hitCount++;
+            this.totalHits++;
+            // 更新 LRU 跟踪 (访问后可能改变 oldestKey)
+            this.updateLRUOnAccess(hash);
+            console.log(`[PlanCache] Exact cache hit for: ${input.substring(0, 50)}...`);
+            return { ...exactEntry.plan }; // 返回副本防止修改
+        }
+        // 2. 尝试相似度匹配
+        if (this.config.enableComplexityAware) {
+            const similarEntry = this.findSimilar(normalized);
+            if (similarEntry && this.isValid(similarEntry)) {
+                similarEntry.accessCount++;
+                similarEntry.lastAccessed = Date.now();
+                similarEntry.hitCount++;
+                this.totalHits++;
+                // 更新 LRU 跟踪 (访问后可能改变 oldestKey)
+                const accessedHash = this.getHashByEntry(similarEntry);
+                if (accessedHash) {
+                    this.updateLRUOnAccess(accessedHash);
+                }
+                const similarity = this.calculateSimilarity(normalized, similarEntry.normalizedInput);
+                console.log(`[PlanCache] Similar cache hit (${similarity.toFixed(2)})`);
+                return { ...similarEntry.plan };
+            }
+        }
+        // 3. 缓存未命中，生成新计划
+        this.totalMisses++;
+        console.log(`[PlanCache] Cache miss, generating new plan...`);
+        const plan = await generator();
+        // 4. 缓存新生成的计划
+        this.set(hash, {
+            plan,
+            normalizedInput: normalized,
+            timestamp: Date.now(),
+            accessCount: 1,
+            lastAccessed: Date.now(),
+            hitCount: 0,
+            complexityScore: this.calculateComplexity(plan)
+        });
+        return plan;
+    }
+    /**
+     * 保存计划到缓存
+     */
+    set(hash, entry) {
+        // 如果是新条目且缓存已满，先淘汰
+        if (!this.cache.has(hash) && this.cache.size >= this.config.maxEntries) {
+            this.evictLRU();
+        }
+        this.cache.set(hash, entry);
+        // 更新 LRU 跟踪
+        this.lruKeys.add(hash);
+        // 使用 lastAccessed 而不是 timestamp 来跟踪 LRU
+        if (!this.oldestKey) {
+            this.oldestKey = hash;
+        }
+        else {
+            const oldestEntry = this.cache.get(this.oldestKey);
+            // 如果当前条目的 lastAccessed 早于 oldestKey 的 lastAccessed，更新 oldestKey
+            if (oldestEntry && entry.lastAccessed < oldestEntry.lastAccessed) {
+                this.oldestKey = hash;
+            }
+        }
+    }
+    /**
+     * 访问时更新 LRU 跟踪
+     *
+     * 当条目被访问时，它的 lastAccessed 会被更新，
+     * 如果之前是 oldestKey，需要重新计算。
+     */
+    updateLRUOnAccess(accessedHash) {
+        // 如果访问的是当前的 oldestKey，需要重新计算
+        if (this.oldestKey === accessedHash) {
+            this.updateOldestKey();
+        }
+    }
+    /**
+     * 根据缓存条目获取其哈希值
+     * 用于相似度匹配后更新 LRU
+     */
+    getHashByEntry(targetEntry) {
+        for (const [hash, entry] of this.cache) {
+            if (entry === targetEntry) {
+                return hash;
+            }
+        }
+        return undefined;
+    }
+    /**
+     * 检查缓存条目是否有效
+     */
+    isValid(entry) {
+        const age = Date.now() - entry.timestamp;
+        return age < this.config.ttl;
+    }
+    /**
+     * 查找相似的计划
+     *
+     * 性能说明: 当前使用 O(N) 遍历，对于默认 maxEntries=100 的情况下性能可接受。
+     * 如果未来需要支持更大的缓存，可以考虑使用局部敏感哈希 (LSH) 或近似最近邻搜索。
+     */
+    findSimilar(normalizedInput) {
+        let bestMatch;
+        let bestSimilarity = 0;
+        for (const [hash, entry] of this.cache) {
+            if (!this.isValid(entry))
+                continue;
+            const similarity = this.calculateSimilarity(normalizedInput, entry.normalizedInput);
+            if (similarity > bestSimilarity && similarity >= this.config.similarityThreshold) {
+                bestSimilarity = similarity;
+                bestMatch = entry;
+            }
+        }
+        return bestMatch;
+    }
+    /**
+     * 规范化输入
+     *
+     * 策略:
+     * 1. 转换为小写
+     * 2. 替换数字为 N
+     * 3. 替换引号内容为 ""
+     * 4. 移除多余空格
+     * 5. 移除停用词
+     */
+    normalizeInput(input) {
+        return input
+            .toLowerCase()
+            // 替换数字
+            .replace(/\b\d+\b/g, 'N')
+            // 替换引号内容
+            .replace(/["'][^"']*["']/g, '""')
+            // 替换文件路径
+            .replace(/[\w\-./]+\.(ts|js|py|go|rs|java|json|yaml|yml|md)/g, 'FILE')
+            // 替换 URL
+            .replace(/https?:\/\/[^\s]+/g, 'URL')
+            // 标准化空白字符
+            .replace(/\s+/g, ' ')
+            .trim();
+    }
+    /**
+     * 计算输入哈希
+     */
+    hashInput(input) {
+        return crypto_1.default
+            .createHash('sha256')
+            .update(input)
+            .digest('hex')
+            .substring(0, 16);
+    }
+    /**
+     * 计算文本相似度 (TF 向量 + 余弦相似度)
+     */
+    calculateSimilarity(input1, input2) {
+        const tf1 = this.calculateNormalizedTF(input1);
+        const tf2 = this.calculateNormalizedTF(input2);
+        return this.cosineSimilarity(tf1, tf2);
+    }
+    /**
+     * 计算归一化的词频向量
+     *
+     * 注意: 这个方法只计算 Term Frequency (TF) 并归一化，
+     * 不包含 Inverse Document Frequency (IDF)。
+     * 对于相似度匹配来说，单文档的 TF 已经足够。
+     */
+    calculateNormalizedTF(text) {
+        const words = text.split(/\s+/).filter(w => w.length > 2 && !this.STOP_WORDS.has(w));
+        const tf = new Map();
+        // 计算词频 (TF)
+        for (const word of words) {
+            tf.set(word, (tf.get(word) || 0) + 1);
+        }
+        // 归一化
+        const maxFreq = Math.max(...tf.values());
+        const vector = new Map();
+        for (const [word, freq] of tf) {
+            vector.set(word, freq / maxFreq);
+        }
+        return vector;
+    }
+    /**
+     * 余弦相似度
+     */
+    cosineSimilarity(vec1, vec2) {
+        let dotProduct = 0;
+        let norm1 = 0;
+        let norm2 = 0;
+        const allWords = new Set([...vec1.keys(), ...vec2.keys()]);
+        for (const word of allWords) {
+            const v1 = vec1.get(word) || 0;
+            const v2 = vec2.get(word) || 0;
+            dotProduct += v1 * v2;
+            norm1 += v1 * v1;
+            norm2 += v2 * v2;
+        }
+        const denominator = Math.sqrt(norm1) * Math.sqrt(norm2);
+        return denominator > 0 ? dotProduct / denominator : 0;
+    }
+    /**
+     * 计算计划复杂度
+     */
+    calculateComplexity(plan) {
+        let complexity = 0;
+        // 步骤数量贡献
+        complexity += Math.min(plan.steps.length / 10, 0.4);
+        // 高风险步骤贡献
+        const highRiskCount = plan.steps.filter(s => s.risk_level === 'high').length;
+        complexity += (highRiskCount / plan.steps.length) * 0.3;
+        // 步骤类型多样性
+        const types = new Set(plan.steps.map(s => s.type));
+        complexity += (types.size / 5) * 0.2;
+        // 依赖关系复杂度
+        const totalDeps = plan.steps.reduce((sum, s) => sum + (s.dependencies?.length || 0), 0);
+        complexity += Math.min(totalDeps / plan.steps.length / 2, 0.1);
+        return Math.min(complexity, 1.0);
+    }
+    /**
+     * LRU 淘汰策略 (优化版本)
+     *
+     * 使用 oldestKey 跟踪最近最少使用的条目，将最常见的情况优化为 O(1)。
+     * 仅在 oldestKey 无效时回退到 O(N) 遍历。
+     *
+     * 注意: 这不是标准的 LRU 实现（使用 Map + 双向链表），
+     * 但对于当前用例（maxEntries=100，低频淘汰）已足够高效。
+     */
+    evictLRU() {
+        // 如果 oldestKey 无效，回退到遍历方式
+        if (!this.oldestKey || !this.cache.has(this.oldestKey)) {
+            this.evictLRUFallback();
+            return;
+        }
+        const evicted = this.oldestKey;
+        this.cache.delete(evicted);
+        this.lruKeys.delete(evicted);
+        // 重新计算 oldestKey
+        this.updateOldestKey();
+        console.log(`[PlanCache] Evicted LRU entry: ${evicted.substring(0, 8)}...`);
+    }
+    /**
+     * 更新 oldestKey (在淘汰或删除后调用)
+     *
+     * 注意: 这是一个 O(N) 操作，因为需要遍历所有条目找到最少使用的。
+     * 但这只在淘汰/清理时调用，不是每次访问时调用，所以整体性能仍可接受。
+     */
+    updateOldestKey() {
+        let oldestHash;
+        let oldestAccess = Infinity;
+        for (const [hash, entry] of this.cache) {
+            if (entry.lastAccessed < oldestAccess) {
+                oldestAccess = entry.lastAccessed;
+                oldestHash = hash;
+            }
+        }
+        this.oldestKey = oldestHash;
+    }
+    /**
+     * LRU 淘汰回退方法 (当 oldestKey 无效时使用)
+     */
+    evictLRUFallback() {
+        let oldestHash;
+        let oldestTime = Infinity;
+        for (const [hash, entry] of this.cache) {
+            if (entry.lastAccessed < oldestTime) {
+                oldestTime = entry.lastAccessed;
+                oldestHash = hash;
+            }
+        }
+        if (oldestHash) {
+            this.cache.delete(oldestHash);
+            this.lruKeys.delete(oldestHash);
+            this.oldestKey = undefined;
+            this.updateOldestKey();
+            console.log(`[PlanCache] Evicted LRU entry (fallback): ${oldestHash.substring(0, 8)}...`);
+        }
+    }
+    /**
+     * 清理过期缓存
+     */
+    cleanup() {
+        let cleaned = 0;
+        const now = Date.now();
+        for (const [hash, entry] of this.cache) {
+            if (now - entry.timestamp > this.config.ttl) {
+                this.cache.delete(hash);
+                this.lruKeys.delete(hash);
+                cleaned++;
+            }
+        }
+        if (cleaned > 0) {
+            console.log(`[PlanCache] Cleaned up ${cleaned} expired entries`);
+            // 清理后更新 oldestKey
+            this.updateOldestKey();
+        }
+        return cleaned;
+    }
+    /**
+     * 清空缓存
+     */
+    clear() {
+        this.cache.clear();
+        this.lruKeys.clear();
+        this.oldestKey = undefined;
+        this.totalHits = 0;
+        this.totalMisses = 0;
+    }
+    /**
+     * 获取缓存统计
+     */
+    getStats() {
+        const entries = Array.from(this.cache.values());
+        const totalRequests = this.totalHits + this.totalMisses;
+        // 计算复杂度分布
+        let low = 0, medium = 0, high = 0;
+        for (const entry of entries) {
+            if (entry.complexityScore < 0.3)
+                low++;
+            else if (entry.complexityScore < 0.7)
+                medium++;
+            else
+                high++;
+        }
+        // 计算平均缓存大小: 通过序列化每个 plan 为 JSON 字符串来估算内存占用
+        // 注意: 这只是近似值，实际内存占用会更高（包括对象开销、Map 结构等）
+        const totalSize = entries.reduce((sum, e) => sum + JSON.stringify(e.plan).length, 0);
+        const avgSize = entries.length > 0 ? totalSize / entries.length : 0;
+        return {
+            totalEntries: this.cache.size,
+            totalHits: this.totalHits,
+            totalMisses: this.totalMisses,
+            hitRate: totalRequests > 0 ? this.totalHits / totalRequests : 0,
+            avgCacheSize: avgSize,
+            complexityDistribution: { low, medium, high }
+        };
+    }
+    /**
+     * 获取缓存条目详情
+     */
+    getEntry(hash) {
+        const entry = this.cache.get(hash);
+        return entry && this.isValid(entry) ? entry : undefined;
+    }
+    /**
+     * 预热缓存（批量导入）
+     *
+     * 注意: 如果条目数超过 maxEntries，将使用 LRU 策略淘汰旧条目
+     */
+    warmUp(entries) {
+        for (const { input, plan } of entries) {
+            const normalized = this.normalizeInput(input);
+            // 使用 set 方法以确保所有缓存管理逻辑正确应用
+            this.set(this.hashInput(normalized), {
+                plan: { ...plan }, // 返回副本防止修改原始计划
+                normalizedInput: normalized,
+                timestamp: Date.now(),
+                accessCount: 0,
+                lastAccessed: Date.now(),
+                hitCount: 0,
+                complexityScore: this.calculateComplexity(plan)
+            });
+        }
+        console.log(`[PlanCache] Warmed up with ${entries.length} entries`);
+    }
+    /**
+     * 导出缓存（用于持久化）
+     */
+    export() {
+        const result = [];
+        for (const [hash, entry] of this.cache) {
+            if (this.isValid(entry)) {
+                result.push({ hash, entry });
+            }
+        }
+        return result;
+    }
+    /**
+     * 导入缓存（从持久化恢复）
+     */
+    import(data) {
+        for (const { hash, entry } of data) {
+            if (this.isValid(entry)) {
+                this.cache.set(hash, entry);
+                this.lruKeys.add(hash);
+                // 更新 oldestKey (使用 lastAccessed)
+                if (!this.oldestKey) {
+                    this.oldestKey = hash;
+                }
+                else {
+                    const oldestEntry = this.cache.get(this.oldestKey);
+                    if (oldestEntry && entry.lastAccessed < oldestEntry.lastAccessed) {
+                        this.oldestKey = hash;
+                    }
+                }
+            }
+        }
+        console.log(`[PlanCache] Imported ${data.length} entries`);
+    }
+}
+exports.PlanCache = PlanCache;
+// 注意: 不再导出默认单例，以避免全局状态和测试隔离问题
+// 每个需要 PlanCache 的实例应该创建自己的实例
+// 如果需要共享缓存，请通过依赖注入的方式传递
+exports.defaultPlanCache = new PlanCache();
+//# sourceMappingURL=PlanCache.js.map

package/dist/agent/PlanCache.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"PlanCache.js","sourceRoot":"","sources":["../../src/agent/PlanCache.ts"],"names":[],"mappings":";;;;;;AACA,oDAA4B;AAoC5B,MAAM,oBAAoB,GAAoB;IAC5C,UAAU,EAAE,GAAG;IACf,GAAG,EAAE,OAAO,EAAG,SAAS;IACxB,qBAAqB,EAAE,IAAI;IAC3B,mBAAmB,EAAE,IAAI;CAC1B,CAAC;AAwBF;;;;;;;;;;;;;;GAcG;AACH,MAAa,SAAS;IACZ,KAAK,GAA4B,IAAI,GAAG,EAAE,CAAC;IAC3C,MAAM,CAAkB;IACxB,SAAS,GAAG,CAAC,CAAC;IACd,WAAW,GAAG,CAAC,CAAC;IAExB,8BAA8B;IACtB,OAAO,GAAgB,IAAI,GAAG,EAAE,CAAC;IACjC,SAAS,CAAqB;IAEtC,mBAAmB;IACF,UAAU,GAAG,IAAI,GAAG,CAAC;QACpC,KAAK,EAAE,GAAG,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,OAAO;QACnE,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,OAAO,EAAE,OAAO;QACnE,QAAQ,EAAE,KAAK,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE,IAAI,EAAE,IAAI;QACpE,IAAI,EAAE,KAAK,EAAE,MAAM,EAAE,OAAO,EAAE,SAAS,EAAE,SAAS,EAAE,MAAM,EAAE,SAAS;QACrE,QAAQ,EAAE,QAAQ,EAAE,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM;QACzE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,MAAM,EAAE,OAAO,EAAE,OAAO,EAAE,SAAS,EAAE,MAAM;QACrE,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM;QACrE,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK;QAClE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,KAAK;QACjE,KAAK,EAAE,IAAI,EAAE,IAAI,EAAE,SAAS,EAAE,IAAI,EAAE,OAAO,EAAE,OAAO,EAAE,GAAG,EAAE,GAAG;QAC9D,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,IAAI,EAAE,IAAI;QAClD,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK;KAC1C,CAAC,CAAC;IAEH,YAAY,SAAmC,EAAE;QAC/C,IAAI,CAAC,MAAM,GAAG,EAAE,GAAG,oBAAoB,EAAE,GAAG,MAAM,EAAE,CAAC;IACvD,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,aAAa,CACjB,KAAa,EACb,SAAkC;QAElC,MAAM,UAAU,GAAG,IAAI,CAAC,cAAc,CAAC,KAAK,CAAC,CAAC;QAC9C,MAAM,IAAI,GAAG,IAAI,CAAC,SAAS,CAAC,UAAU,CAAC,CAAC;QAExC,YAAY;QACZ,MAAM,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACxC,IAAI,UAAU,IAAI,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC,EAAE,CAAC;YAC3C,UAAU,CAAC,WAAW,EAAE,CAAC;YACzB,UAAU,CAAC,YAAY,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;YACrC,UAAU,CAAC,QAAQ,EAAE,CAAC;YACtB,IAAI,CAAC,SAAS,EAAE,CAAC;YAEjB,gCAAgC;YAChC,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAC,CAAC;YAE7B,OAAO,CAAC,GAAG,CAAC,oCAAoC,KAAK,CAAC,SAAS,CAAC,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC;YAC7E,OAAO,EAAE,GAAG,UAAU,CAAC,IAAI,EAAE,CAAC,CAAC,WAAW;QAC5C,CAAC;QAED,aAAa;QACb,IAAI,IAAI,CAAC,MAAM,CAAC,qBAAqB,EAAE,CAAC;YACtC,MAAM,YAAY,GAAG,IAAI,CAAC,WAAW,CAAC,UAAU,CAAC,CAAC;YAClD,IAAI,YAAY,IAAI,IAAI,CAAC,OAAO,CAAC,YAAY,CAAC,EAAE,CAAC;gBAC/C,YAAY,CAAC,WAAW,EAAE,CAAC;gBAC3B,YAAY,CAAC,YAAY,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;gBACvC,YAAY,CAAC,QAAQ,EAAE,CAAC;gBACxB,IAAI,CAAC,SAAS,EAAE,CAAC;gBAEjB,gCAAgC;gBAChC,MAAM,YAAY,GAAG,IAAI,CAAC,cAAc,CAAC,YAAY,CAAC,CAAC;gBACvD,IAAI,YAAY,EAAE,CAAC;oBACjB,IAAI,CAAC,iBAAiB,CAAC,YAAY,CAAC,CAAC;gBACvC,CAAC;gBAED,MAAM,UAAU,GAAG,IAAI,CAAC,mBAAmB,CAAC,UAAU,EAAE,YAAY,CAAC,eAAe,CAAC,CAAC;gBACtF,OAAO,CAAC,GAAG,CAAC,kCAAkC,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;gBACxE,OAAO,EAAE,GAAG,YAAY,CAAC,IAAI,EAAE,CAAC;YAClC,CAAC;QACH,CAAC;QAED,iBAAiB;QACjB,IAAI,CAAC,WAAW,EAAE,CAAC;QACnB,OAAO,CAAC,GAAG,CAAC,gDAAgD,CAAC,CAAC;QAE9D,MAAM,IAAI,GAAG,MAAM,SAAS,EAAE,CAAC;QAE/B,cAAc;QACd,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE;YACb,IAAI;YACJ,eAAe,EAAE,UAAU;YAC3B,SAAS,EAAE,IAAI,CAAC,GAAG,EAAE;YACrB,WAAW,EAAE,CAAC;YACd,YAAY,EAAE,IAAI,CAAC,GAAG,EAAE;YACxB,QAAQ,EAAE,CAAC;YACX,eAAe,EAAE,IAAI,CAAC,mBAAmB,CAAC,IAAI,CAAC;SAChD,CAAC,CAAC;QAEH,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;OAEG;IACK,GAAG,CAAC,IAAY,EAAE,KAAiB;QACzC,kBAAkB;QAClB,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,IAAI,IAAI,CAAC,MAAM,CAAC,UAAU,EAAE,CAAC;YACvE,IAAI,CAAC,QAAQ,EAAE,CAAC;QAClB,CAAC;QAED,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;QAE5B,YAAY;QACZ,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACvB,wCAAwC;QACxC,IAAI,CAAC,IAAI,CAAC,SAAS,EAAE,CAAC;YACpB,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC;QACxB,CAAC;aAAM,CAAC;YACN,MAAM,WAAW,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;YACnD,gEAAgE;YAChE,IAAI,WAAW,IAAI,KAAK,CAAC,YAAY,GAAG,WAAW,CAAC,YAAY,EAAE,CAAC;gBACjE,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC;YACxB,CAAC;QACH,CAAC;IACH,CAAC;IAED;;;;;OAKG;IACK,iBAAiB,CAAC,YAAoB;QAC5C,6BAA6B;QAC7B,IAAI,IAAI,CAAC,SAAS,KAAK,YAAY,EAAE,CAAC;YACpC,IAAI,CAAC,eAAe,EAAE,CAAC;QACzB,CAAC;IACH,CAAC;IAED;;;OAGG;IACK,cAAc,CAAC,WAAuB;QAC5C,KAAK,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YACvC,IAAI,KAAK,KAAK,WAAW,EAAE,CAAC;gBAC1B,OAAO,IAAI,CAAC;YACd,CAAC;QACH,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IAED;;OAEG;IACK,OAAO,CAAC,KAAiB;QAC/B,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,KAAK,CAAC,SAAS,CAAC;QACzC,OAAO,GAAG,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC;IAC/B,CAAC;IAED;;;;;OAKG;IACK,WAAW,CAAC,eAAuB;QACzC,IAAI,SAAiC,CAAC;QACtC,IAAI,cAAc,GAAG,CAAC,CAAC;QAEvB,KAAK,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YACvC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC;gBAAE,SAAS;YAEnC,MAAM,UAAU,GAAG,IAAI,CAAC,mBAAmB,CAAC,eAAe,EAAE,KAAK,CAAC,eAAe,CAAC,CAAC;YAEpF,IAAI,UAAU,GAAG,cAAc,IAAI,UAAU,IAAI,IAAI,CAAC,MAAM,CAAC,mBAAmB,EAAE,CAAC;gBACjF,cAAc,GAAG,UAAU,CAAC;gBAC5B,SAAS,GAAG,KAAK,CAAC;YACpB,CAAC;QACH,CAAC;QAED,OAAO,SAAS,CAAC;IACnB,CAAC;IAED;;;;;;;;;OASG;IACK,cAAc,CAAC,KAAa;QAClC,OAAO,KAAK;aACT,WAAW,EAAE;YACd,OAAO;aACN,OAAO,CAAC,UAAU,EAAE,GAAG,CAAC;YACzB,SAAS;aACR,OAAO,CAAC,iBAAiB,EAAE,IAAI,CAAC;YACjC,SAAS;aACR,OAAO,CAAC,oDAAoD,EAAE,MAAM,CAAC;YACtE,SAAS;aACR,OAAO,CAAC,oBAAoB,EAAE,KAAK,CAAC;YACrC,UAAU;aACT,OAAO,CAAC,MAAM,EAAE,GAAG,CAAC;aACpB,IAAI,EAAE,CAAC;IACZ,CAAC;IAED;;OAEG;IACK,SAAS,CAAC,KAAa;QAC7B,OAAO,gBAAM;aACV,UAAU,CAAC,QAAQ,CAAC;aACpB,MAAM,CAAC,KAAK,CAAC;aACb,MAAM,CAAC,KAAK,CAAC;aACb,SAAS,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;IACtB,CAAC;IAED;;OAEG;IACK,mBAAmB,CAAC,MAAc,EAAE,MAAc;QACxD,MAAM,GAAG,GAAG,IAAI,CAAC,qBAAqB,CAAC,MAAM,CAAC,CAAC;QAC/C,MAAM,GAAG,GAAG,IAAI,CAAC,qBAAqB,CAAC,MAAM,CAAC,CAAC;QAE/C,OAAO,IAAI,CAAC,gBAAgB,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;IACzC,CAAC;IAED;;;;;;OAMG;IACK,qBAAqB,CAAC,IAAY;QACxC,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACrF,MAAM,EAAE,GAAG,IAAI,GAAG,EAAkB,CAAC;QAErC,YAAY;QACZ,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,EAAE,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACxC,CAAC;QAED,MAAM;QACN,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,MAAM,EAAE,CAAC,CAAC;QACzC,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAC;QACzC,KAAK,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC;YAC9B,MAAM,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,GAAG,OAAO,CAAC,CAAC;QACnC,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;OAEG;IACK,gBAAgB,CAAC,IAAyB,EAAE,IAAyB;QAC3E,IAAI,UAAU,GAAG,CAAC,CAAC;QACnB,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,IAAI,KAAK,GAAG,CAAC,CAAC;QAEd,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,EAAE,EAAE,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;QAE3D,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;YAC5B,MAAM,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAC/B,MAAM,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAE/B,UAAU,IAAI,EAAE,GAAG,EAAE,CAAC;YACtB,KAAK,IAAI,EAAE,GAAG,EAAE,CAAC;YACjB,KAAK,IAAI,EAAE,GAAG,EAAE,CAAC;QACnB,CAAC;QAED,MAAM,WAAW,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACxD,OAAO,WAAW,GAAG,CAAC,CAAC,CAAC,CAAC,UAAU,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC;IACxD,CAAC;IAED;;OAEG;IACK,mBAAmB,CAAC,IAAc;QACxC,IAAI,UAAU,GAAG,CAAC,CAAC;QAEnB,SAAS;QACT,UAAU,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,EAAE,EAAE,GAAG,CAAC,CAAC;QAEpD,UAAU;QACV,MAAM,aAAa,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,UAAU,KAAK,MAAM,CAAC,CAAC,MAAM,CAAC;QAC7E,UAAU,IAAI,CAAC,aAAa,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,GAAG,CAAC;QAExD,UAAU;QACV,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;QACnD,UAAU,IAAI,CAAC,KAAK,CAAC,IAAI,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC;QAErC,UAAU;QACV,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,YAAY,EAAE,MAAM,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACxF,UAAU,IAAI,IAAI,CAAC,GAAG,CAAC,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC;QAE/D,OAAO,IAAI,CAAC,GAAG,CAAC,UAAU,EAAE,GAAG,CAAC,CAAC;IACnC,CAAC;IAED;;;;;;;;OAQG;IACK,QAAQ;QACd,0BAA0B;QAC1B,IAAI,CAAC,IAAI,CAAC,SAAS,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,EAAE,CAAC;YACvD,IAAI,CAAC,gBAAgB,EAAE,CAAC;YACxB,OAAO;QACT,CAAC;QAED,MAAM,OAAO,GAAG,IAAI,CAAC,SAAS,CAAC;QAC/B,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;QAC3B,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;QAE7B,iBAAiB;QACjB,IAAI,CAAC,eAAe,EAAE,CAAC;QAEvB,OAAO,CAAC,GAAG,CAAC,kCAAkC,OAAO,CAAC,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC;IAC9E,CAAC;IAED;;;;;OAKG;IACK,eAAe;QACrB,IAAI,UAA8B,CAAC;QACnC,IAAI,YAAY,GAAG,QAAQ,CAAC;QAE5B,KAAK,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YACvC,IAAI,KAAK,CAAC,YAAY,GAAG,YAAY,EAAE,CAAC;gBACtC,YAAY,GAAG,KAAK,CAAC,YAAY,CAAC;gBAClC,UAAU,GAAG,IAAI,CAAC;YACpB,CAAC;QACH,CAAC;QAED,IAAI,CAAC,SAAS,GAAG,UAAU,CAAC;IAC9B,CAAC;IAED;;OAEG;IACK,gBAAgB;QACtB,IAAI,UAA8B,CAAC;QACnC,IAAI,UAAU,GAAG,QAAQ,CAAC;QAE1B,KAAK,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YACvC,IAAI,KAAK,CAAC,YAAY,GAAG,UAAU,EAAE,CAAC;gBACpC,UAAU,GAAG,KAAK,CAAC,YAAY,CAAC;gBAChC,UAAU,GAAG,IAAI,CAAC;YACpB,CAAC;QACH,CAAC;QAED,IAAI,UAAU,EAAE,CAAC;YACf,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;YAC9B,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;YAChC,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC;YAC3B,IAAI,CAAC,eAAe,EAAE,CAAC;YACvB,OAAO,CAAC,GAAG,CAAC,6CAA6C,UAAU,CAAC,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC;QAC5F,CAAC;IACH,CAAC;IAED;;OAEG;IACH,OAAO;QACL,IAAI,OAAO,GAAG,CAAC,CAAC;QAChB,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QAEvB,KAAK,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YACvC,IAAI,GAAG,GAAG,KAAK,CAAC,SAAS,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC;gBAC5C,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;gBACxB,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;gBAC1B,OAAO,EAAE,CAAC;YACZ,CAAC;QACH,CAAC;QAED,IAAI,OAAO,GAAG,CAAC,EAAE,CAAC;YAChB,OAAO,CAAC,GAAG,CAAC,0BAA0B,OAAO,kBAAkB,CAAC,CAAC;YACjE,kBAAkB;YAClB,IAAI,CAAC,eAAe,EAAE,CAAC;QACzB,CAAC;QAED,OAAO,OAAO,CAAC;IACjB,CAAC;IAED;;OAEG;IACH,KAAK;QACH,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;QACnB,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,CAAC;QACrB,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC;QAC3B,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC;QACnB,IAAI,CAAC,WAAW,GAAG,CAAC,CAAC;IACvB,CAAC;IAED;;OAEG;IACH,QAAQ;QACN,MAAM,OAAO,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC;QAChD,MAAM,aAAa,GAAG,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,WAAW,CAAC;QAExD,UAAU;QACV,IAAI,GAAG,GAAG,CAAC,EAAE,MAAM,GAAG,CAAC,EAAE,IAAI,GAAG,CAAC,CAAC;QAClC,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;YAC5B,IAAI,KAAK,CAAC,eAAe,GAAG,GAAG;gBAAE,GAAG,EAAE,CAAC;iBAClC,IAAI,KAAK,CAAC,eAAe,GAAG,GAAG;gBAAE,MAAM,EAAE,CAAC;;gBAC1C,IAAI,EAAE,CAAC;QACd,CAAC;QAED,2CAA2C;QAC3C,uCAAuC;QACvC,MAAM,SAAS,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;QACrF,MAAM,OAAO,GAAG,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,SAAS,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;QAEpE,OAAO;YACL,YAAY,EAAE,IAAI,CAAC,KAAK,CAAC,IAAI;YAC7B,SAAS,EAAE,IAAI,CAAC,SAAS;YACzB,WAAW,EAAE,IAAI,CAAC,WAAW;YAC7B,OAAO,EAAE,aAAa,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC;YAC/D,YAAY,EAAE,OAAO;YACrB,sBAAsB,EAAE,EAAE,GAAG,EAAE,MAAM,EAAE,IAAI,EAAE;SAC9C,CAAC;IACJ,CAAC;IAED;;OAEG;IACH,QAAQ,CAAC,IAAY;QACnB,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACnC,OAAO,KAAK,IAAI,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,SAAS,CAAC;IAC1D,CAAC;IAED;;;;OAIG;IACH,MAAM,CAAC,OAAiD;QACtD,KAAK,MAAM,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI,OAAO,EAAE,CAAC;YACtC,MAAM,UAAU,GAAG,IAAI,CAAC,cAAc,CAAC,KAAK,CAAC,CAAC;YAE9C,2BAA2B;YAC3B,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,UAAU,CAAC,EAAE;gBACnC,IAAI,EAAE,EAAE,GAAG,IAAI,EAAE,EAAE,eAAe;gBAClC,eAAe,EAAE,UAAU;gBAC3B,SAAS,EAAE,IAAI,CAAC,GAAG,EAAE;gBACrB,WAAW,EAAE,CAAC;gBACd,YAAY,EAAE,IAAI,CAAC,GAAG,EAAE;gBACxB,QAAQ,EAAE,CAAC;gBACX,eAAe,EAAE,IAAI,CAAC,mBAAmB,CAAC,IAAI,CAAC;aAChD,CAAC,CAAC;QACL,CAAC;QAED,OAAO,CAAC,GAAG,CAAC,8BAA8B,OAAO,CAAC,MAAM,UAAU,CAAC,CAAC;IACtE,CAAC;IAED;;OAEG;IACH,MAAM;QACJ,MAAM,MAAM,GAA+C,EAAE,CAAC;QAE9D,KAAK,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YACvC,IAAI,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;gBACxB,MAAM,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,CAAC;YAC/B,CAAC;QACH,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;OAEG;IACH,MAAM,CAAC,IAAgD;QACrD,KAAK,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,IAAI,EAAE,CAAC;YACnC,IAAI,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;gBACxB,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;gBAC5B,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;gBAEvB,iCAAiC;gBACjC,IAAI,CAAC,IAAI,CAAC,SAAS,EAAE,CAAC;oBACpB,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC;gBACxB,CAAC;qBAAM,CAAC;oBACN,MAAM,WAAW,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;oBACnD,IAAI,WAAW,IAAI,KAAK,CAAC,YAAY,GAAG,WAAW,CAAC,YAAY,EAAE,CAAC;wBACjE,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC;oBACxB,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,CAAC,GAAG,CAAC,wBAAwB,IAAI,CAAC,MAAM,UAAU,CAAC,CAAC;IAC7D,CAAC;CACF;AAvfD,8BAufC;AAED,8BAA8B;AAC9B,8BAA8B;AAC9B,wBAAwB;AACX,QAAA,gBAAgB,GAAG,IAAI,SAAS,EAAE,CAAC"}

package/dist/agent/governance/riskScoring.d.ts

@@ -0,0 +1,118 @@
+import { ProposedAction } from '../state';
+/**
+ * 风险评分配置
+ */
+export interface RiskScoringConfig {
+    /** 是否启用用户信任度 */
+    enableUserTrust: boolean;
+    /** 用户信任度衰减因子 (每天) */
+    trustDecayRate: number;
+    /** 最小信任度 (0-1) */
+    minTrust: number;
+    /** 最大信任度 (0-1) */
+    maxTrust: number;
+}
+/**
+ * 风险因子
+ */
+export interface RiskFactor {
+    /** 因子名称 */
+    name: string;
+    /** 权重 (0-1) */
+    weight: number;
+    /** 计算出的分数 (0-1) */
+    score: number;
+    /** 原因说明 */
+    reason: string;
+}
+/**
+ * 综合风险评估结果
+ */
+export interface RiskAssessment {
+    /** 总风险分数 (0-100) */
+    score: number;
+    /** 风险等级 */
+    level: 'low' | 'medium' | 'high' | 'critical';
+    /** 各维度评分 */
+    factors: RiskFactor[];
+    /** 评分置信度 (0-1) */
+    confidence: number;
+    /** 建议的操作 */
+    suggestedAction: 'auto-allow' | 'human-review' | 'deny';
+    /** 用户信任度 (0-1) */
+    userTrust: number;
+}
+/**
+ * 风险评分计算器
+ *
+ * 算法:
+ * 1. 基础风险: 命令类型和工具风险
+ * 2. 破坏性风险: 检测破坏性模式
+ * 3. 路径敏感性: 目标路径的风险等级
+ * 4. 用户信任度: 历史行为建立的信任
+ * 5. 上下文风险: 执行上下文的额外考虑
+ *
+ * 最终得分 = Σ(weight_i × score_i) - trust_bonus
+ */
+export declare class RiskScoringModel {
+    private config;
+    private userTrustScores;
+    private userLastSeen;
+    constructor(config?: Partial<RiskScoringConfig>);
+    /**
+     * 评估单个动作的风险
+     */
+    assessRisk(action: ProposedAction, userId?: string): RiskAssessment;
+    /**
+     * 基础风险评估
+     */
+    private assessBaseRisk;
+    /**
+     * 破坏性风险评估
+     */
+    private assessDestructiveRisk;
+    /**
+     * 路径敏感性评估
+     */
+    private assessPathSensitivity;
+    /**
+     * 命令复杂度评估
+     */
+    private assessCommandComplexity;
+    /**
+     * 上下文风险评估
+     */
+    private assessContextualRisk;
+    /**
+     * 确定风险等级
+     */
+    private determineLevel;
+    /**
+     * 确定建议操作
+     */
+    private determineAction;
+    /**
+     * 计算置信度
+     */
+    private calculateConfidence;
+    /**
+     * 获取用户信任度
+     */
+    private getUserTrust;
+    /**
+     * 更新用户信任度
+     */
+    updateUserTrust(userId: string, outcome: 'success' | 'failure' | 'abuse', magnitude?: number): void;
+    /**
+     * 重置用户信任度
+     */
+    resetUserTrust(userId?: string): void;
+    /**
+     * 获取信任度统计
+     */
+    getTrustStats(): Map<string, {
+        trust: number;
+        lastSeen: number;
+    }>;
+}
+export declare const defaultRiskScoringModel: RiskScoringModel;