deeper-cli 1.2.5 → 1.3.1

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "deeper-cli",
-  "version": "1.2.5",
+  "version": "1.3.1",
   "description": "DeeperCode - 一句话生成完整项目的 AI Agentic CLI 工具",
   "type": "module",
   "bin": {

package/src/memory/xmemory.ts

@@ -7,14 +7,14 @@ export interface MemoryEntry {
   type: 'working' | 'episodic' | 'semantic' | 'procedural';
   content: string;
   tags: string[];
-  importance: number;     // 0-10
-  accuracy: number;       // 0-10, 自评置信度
+  importance: number;
+  accuracy: number;
   createdAt: number;
   accessedAt: number;
   accessCount: number;
   sessionId: string;
-  source: string;         // 'user' | 'agent' | 'tool' | 'system'
-  references: string[];   // 关联条目 ID
+  source: string;
+  references: string[];
 }
 
 interface XMemStats {
@@ -22,13 +22,17 @@ interface XMemStats {
   byType: Record<string, number>;
   totalTokens: number;
   lastCleanup: number;
+  lastConsolidate: number;
 }
 
 const MEM_DIR = join(DEEPER_HOME, 'xmemory');
 const STATS_FILE = join(MEM_DIR, 'stats.json');
-const MAX_WORKING_MEM = 50;
-const MAX_TOTAL_MEM = 2000;
-const CLEANUP_THRESHOLD = 1500;
+const MAX_WORKING_MEM = 100;
+const MAX_TOTAL_MEM = 3000;
+const CLEANUP_THRESHOLD = 2000;
+const DEDUP_SIMILARITY_THRESHOLD = 0.85;
+const CONSOLIDATE_THRESHOLD = 5;
+const SAVE_DEBOUNCE_MS = 3000;
 
 let currentSessionId = '';
 
@@ -41,30 +45,87 @@ function uid(): string {
 function ensureDir(): void {
   if (!existsSync(MEM_DIR)) mkdirSync(MEM_DIR, { recursive: true });
   if (!existsSync(STATS_FILE)) {
-    writeFileSync(STATS_FILE, JSON.stringify({ totalEntries: 0, byType: {}, totalTokens: 0, lastCleanup: Date.now() }), 'utf-8');
+    writeFileSync(STATS_FILE, JSON.stringify({ totalEntries: 0, byType: {}, totalTokens: 0, lastCleanup: Date.now(), lastConsolidate: Date.now() }, null, 2), 'utf-8');
   }
 }
 
 function loadStats(): XMemStats {
   try {
     return JSON.parse(readFileSync(STATS_FILE, 'utf-8')) as XMemStats;
-  } catch { return { totalEntries: 0, byType: {}, totalTokens: 0, lastCleanup: 0 }; }
+  } catch { return { totalEntries: 0, byType: {}, totalTokens: 0, lastCleanup: 0, lastConsolidate: 0 }; }
 }
 
 function saveStats(s: XMemStats): void {
   writeFileSync(STATS_FILE, JSON.stringify(s, null, 2), 'utf-8');
 }
 
+function tokenize(text: string): string[] {
+  const lower = text.toLowerCase();
+  const words = lower.split(/[\s\p{P}\p{S}]+/).filter(w => w.length >= 2);
+  const bigrams: string[] = [];
+  for (let i = 0; i < words.length - 1; i++) bigrams.push(words[i] + '_' + words[i + 1]);
+  return [...new Set([...words, ...bigrams])];
+}
+
+function similarity(a: string, b: string): number {
+  if (a === b) return 1;
+  if (!a || !b) return 0;
+  const ta = tokenize(a);
+  const tb = tokenize(b);
+  if (ta.length === 0 || tb.length === 0) return 0;
+  const sa = new Set(ta);
+  const sb = new Set(tb);
+  let intersection = 0;
+  for (const t of sa) if (sb.has(t)) intersection++;
+  const union = Math.max(sa.size, sb.size);
+  return union > 0 ? intersection / union : 0;
+}
+
+class TFIDFIndexer {
+  private docFreq: Map<string, number> = new Map();
+  private numDocs = 0;
+
+  build(entries: Iterable<MemoryEntry>): void {
+    this.docFreq.clear();
+    this.numDocs = 0;
+    for (const entry of entries) {
+      this.numDocs++;
+      const tokens = new Set(tokenize(entry.content));
+      for (const t of tokens) this.docFreq.set(t, (this.docFreq.get(t) || 0) + 1);
+    }
+  }
+
+  idf(term: string): number {
+    const df = this.docFreq.get(term) || 0;
+    if (df === 0 || df >= this.numDocs) return 0;
+    return Math.log((this.numDocs + 0.5) / (df + 0.5)) + 1;
+  }
+
+  tfidfScore(content: string, queryTerms: string[]): number {
+    const tokens = tokenize(content);
+    const tfMap = new Map<string, number>();
+    for (const t of tokens) tfMap.set(t, (tfMap.get(t) || 0) + 1);
+    const maxTf = Math.max(...tfMap.values(), 1);
+    let score = 0;
+    for (const qt of queryTerms) {
+      const tf = ((tfMap.get(qt) || 0) / maxTf) * (1 + Math.log(tokens.length));
+      score += tf * this.idf(qt);
+    }
+    return score;
+  }
+}
+
 export class XMemory {
   private working: MemoryEntry[] = [];
   private index: Map<string, MemoryEntry> = new Map();
   private dirty = false;
+  private saveTimer: ReturnType<typeof setTimeout> | null = null;
+  private tfidf: TFIDFIndexer = new TFIDFIndexer();
 
   constructor() {
     ensureDir();
   }
 
-  // ============ 写入 ============
   store(
     type: MemoryEntry['type'],
     content: string,
@@ -74,9 +135,12 @@ export class XMemory {
     source: MemoryEntry['source'] = 'agent',
     references: string[] = [],
   ): string {
+    const deduped = this.deduplicate(type, content, importance);
+    if (deduped !== null) return deduped;
+
     const id = uid();
     const entry: MemoryEntry = {
-      id, type, content: content.slice(0, 2000), tags,
+      id, type, content: content.slice(0, 4000), tags,
       importance: Math.min(10, Math.max(0, importance)),
       accuracy: Math.min(10, Math.max(0, accuracy)),
       createdAt: Date.now(), accessedAt: Date.now(),
@@ -86,13 +150,12 @@ export class XMemory {
 
     if (type === 'working') {
       this.working.push(entry);
-      if (this.working.length > MAX_WORKING_MEM) {
-        this.working.shift();
-      }
+      this.evictWorking();
     }
 
     this.index.set(id, entry);
     this.dirty = true;
+    this.scheduleSave();
 
     if (this.index.size > CLEANUP_THRESHOLD) {
       this.autoCleanup();
@@ -117,38 +180,54 @@ export class XMemory {
     return this.store('working', content, tags, 3, 5, 'agent');
   }
 
-  // ============ 检索 ============
   recall(query: string, limit = 5, minImportance = 0): MemoryEntry[] {
-    const keywords = query.toLowerCase().split(/[\s,，。]+/).filter(w => w.length > 1);
+    const keywords = tokenize(query).filter(w => w.length >= 2);
     if (keywords.length === 0) return [];
 
-    const scored: Array<{ entry: MemoryEntry; score: number }> = [];
+    this.tfidf.build(this.index.values());
     const now = Date.now();
+    const scored: Array<{ entry: MemoryEntry; score: number }> = [];
 
     for (const entry of this.index.values()) {
       if (entry.importance < minImportance) continue;
-      let score = 0;
-      const c = (entry.content || '').toLowerCase();
+
+      const c = entry.content.toLowerCase();
       const t = entry.tags.join(' ').toLowerCase();
 
+      let keywordScore = 0;
+      let exactMatchBonus = 0;
       for (const kw of keywords) {
-        if (c.includes(kw)) score += 3;
-        if (t.includes(kw)) score += 2;
-        if (entry.type === 'procedural' && c.includes(kw)) score += 1;
+        if (c.includes(kw)) { keywordScore += 3; exactMatchBonus += 1; }
+        if (t.includes(kw)) keywordScore += 2;
+        if (entry.type === 'procedural' && c.includes(kw)) keywordScore += 1;
+        if (entry.type === 'semantic' && c.includes(kw)) keywordScore += 1.5;
       }
 
-      // 衰减: 重要度高 + 最近访问 权重高
-      const age = (now - entry.accessedAt) / (1000 * 60 * 60);
-      score += entry.importance * 0.5;
-      score -= Math.min(age / 24, 5); // 每 24 小时衰减 max 5
+      const tfidfScore = this.tfidf.tfidfScore(entry.content, keywords);
+
+      const recencyBoost = Math.max(0, 3 - (now - entry.accessedAt) / (1000 * 60 * 30));
+      const frequencyBoost = Math.min(entry.accessCount * 0.3, 4);
+      const importanceWeight = entry.importance * 0.6;
+      const ageHours = (now - entry.createdAt) / (1000 * 60 * 60);
+      const ageDecay = Math.min(ageHours / 48, 6);
 
-      if (score > 0) scored.push({ entry, score });
+      const totalScore =
+        keywordScore * 1.0 +
+        tfidfScore * 2.0 +
+        importanceWeight +
+        recencyBoost +
+        frequencyBoost -
+        ageDecay +
+        (exactMatchBonus >= 3 ? 3 : 0);
+
+      if (totalScore > 0) scored.push({ entry, score: totalScore });
     }
 
     scored.sort((a, b) => b.score - a.score);
     return scored.slice(0, limit).map(s => {
       s.entry.accessedAt = now;
       s.entry.accessCount++;
+      s.entry.importance = Math.min(10, s.entry.importance + 0.1);
       return s.entry;
     });
   }
@@ -158,20 +237,23 @@ export class XMemory {
     for (const entry of this.index.values()) {
       if (entry.type === type) res.push(entry);
     }
-    res.sort((a, b) => b.createdAt - a.createdAt);
+    res.sort((a, b) => (b.importance * 2 + b.accessCount) - (a.importance * 2 + a.accessCount));
     return res.slice(0, limit);
   }
 
   getWorking(): MemoryEntry[] {
-    return this.working;
+    return this.working.sort((a, b) =>
+      (b.importance * 2 + b.accessCount) - (a.importance * 2 + a.accessCount)
+    );
   }
 
-  getWorkingContext(maxTokens = 2000): string {
+  getWorkingContext(maxTokens = 4000): string {
     if (this.working.length === 0) return '';
-    const lines = this.working.map(e => `[工作记忆] ${e.content.slice(0, 300)}`);
+    const sorted = this.getWorking();
+    const lines = sorted.map(e => `[${e.source}] ${e.content.slice(0, 500)}`);
     let result = '';
     for (const line of lines) {
-      if ((result + line).length > maxTokens * 4) break;
+      if ((result + line).length > maxTokens * 3) break;
       result += line + '\n';
     }
     return result;
@@ -181,28 +263,51 @@ export class XMemory {
     const recalled = this.recall(task, limit, 3);
     const proc = recalled.filter(r => r.type === 'procedural' || r.type === 'semantic');
     if (proc.length === 0) return '';
-    return '[记忆提示]\n' + proc.map(p => `- ${p.content.slice(0, 250)}`).join('\n');
+    return '[记忆提示]\n' + proc.map(p => `- [${p.type === 'procedural' ? '技能' : '知识'}] ${p.content.slice(0, 350)}`).join('\n');
   }
 
   getSessionSummary(): string {
     const entries = [...this.index.values()].filter(e => e.sessionId === currentSessionId);
     if (entries.length === 0) return '';
-    const key = entries
-      .filter(e => e.importance >= 5)
+
+    const byType: Record<string, MemoryEntry[]> = { semantic: [], procedural: [], episodic: [], working: [] };
+    for (const e of entries) {
+      if (byType[e.type]) byType[e.type].push(e);
+    }
+
+    const parts: string[] = [];
+
+    const keySemantic = byType.semantic
+      .sort((a, b) => b.importance - a.importance)
+      .slice(0, 5);
+    if (keySemantic.length > 0) {
+      parts.push(`[知识记忆·${keySemantic.length}条]\n` +
+        keySemantic.map(e => `• ${e.content.slice(0, 250)}`).join('\n'));
+    }
+
+    const keyProcedural = byType.procedural
+      .sort((a, b) => b.importance - a.importance)
+      .slice(0, 5);
+    if (keyProcedural.length > 0) {
+      parts.push(`[技能记忆·${keyProcedural.length}条]\n` +
+        keyProcedural.map(e => `• ${e.content.slice(0, 250)}`).join('\n'));
+    }
+
+    const keyEpisodic = byType.episodic
       .sort((a, b) => b.importance - a.importance)
-      .slice(0, 8);
-    return `[XMemory·本会话]\n` + key.map(e => {
-      const t = e.type === 'semantic' ? '知识' : e.type === 'procedural' ? '技能' : e.type === 'episodic' ? '经历' : '工作';
-      return `[${t}] ${e.content.slice(0, 200)}`;
-    }).join('\n');
+      .slice(0, 3);
+    if (keyEpisodic.length > 0) {
+      parts.push(`[经历记忆·${keyEpisodic.length}条]\n` +
+        keyEpisodic.map(e => `→ ${e.content.slice(0, 150)}`).join('\n'));
+    }
+
+    return `[XMemory·本会话 ${entries.length}条]\n${parts.join('\n')}`;
   }
 
-  // ============ 持久化 ============
   async save(): Promise<void> {
     if (!this.dirty) return;
     ensureDir();
 
-    // 分批写入：每个 type 一个文件
     const byType: Record<string, MemoryEntry[]> = {};
     for (const entry of this.index.values()) {
       if (!byType[entry.type]) byType[entry.type] = [];
@@ -211,7 +316,7 @@ export class XMemory {
 
     for (const [type, entries] of Object.entries(byType)) {
       const file = join(MEM_DIR, `${type}.json`);
-      writeFileSync(file, JSON.stringify(entries.slice(-500)), 'utf-8'); // 每个类型最多 500 条
+      writeFileSync(file, JSON.stringify(entries.slice(-800)), 'utf-8');
     }
 
     const stats = loadStats();
@@ -241,24 +346,125 @@ export class XMemory {
           if (entry.type === 'working') this.working.push(entry);
           total++;
         }
-      } catch { /* skip corrupt files */ }
+      } catch {}
     }
 
     if (this.working.length > MAX_WORKING_MEM) {
       this.working = this.working.slice(-MAX_WORKING_MEM);
     }
+
+    this.consolidateIfNeeded();
+  }
+
+  private scheduleSave(): void {
+    if (this.saveTimer) return;
+    this.saveTimer = setTimeout(() => {
+      this.saveTimer = null;
+      this.save().catch(() => {});
+    }, SAVE_DEBOUNCE_MS);
+  }
+
+  private deduplicate(type: MemoryEntry['type'], content: string, importance: number): string | null {
+    const threshold = type === 'working' ? 0.95 : type === 'episodic' ? 0.85 : DEDUP_SIMILARITY_THRESHOLD;
+    const shortContent = content.slice(0, 500);
+
+    for (const entry of this.index.values()) {
+      if (entry.type !== type) continue;
+      const sim = similarity(shortContent, entry.content.slice(0, 500));
+      if (sim >= threshold) {
+        entry.accessedAt = Date.now();
+        entry.accessCount++;
+        entry.importance = Math.min(10, Math.max(entry.importance, importance));
+        if (content.length > entry.content.length && content.length <= 4000) {
+          entry.content = content;
+          this.dirty = true;
+        }
+        return entry.id;
+      }
+    }
+    return null;
+  }
+
+  private evictWorking(): void {
+    while (this.working.length > MAX_WORKING_MEM) {
+      let worstIdx = 0;
+      let worstScore = Infinity;
+      for (let i = 0; i < this.working.length; i++) {
+        const e = this.working[i];
+        const score = e.importance + e.accessCount * 0.3 - (Date.now() - e.accessedAt) / (1000 * 60 * 15);
+        if (score < worstScore) { worstScore = score; worstIdx = i; }
+      }
+      this.working.splice(worstIdx, 1);
+    }
+  }
+
+  private consolidateIfNeeded(): void {
+    const stats = loadStats();
+    const now = Date.now();
+    if (now - stats.lastConsolidate < 24 * 60 * 60 * 1000) return;
+
+    const candidates: Map<string, MemoryEntry[]> = new Map();
+    for (const entry of this.index.values()) {
+      if (entry.type === 'episodic' && entry.accessCount >= CONSOLIDATE_THRESHOLD) {
+        const key = entry.tags.slice(0, 3).sort().join('|') || '_default_';
+        if (!candidates.has(key)) candidates.set(key, []);
+        candidates.get(key)!.push(entry);
+      }
+    }
+
+    let consolidated = 0;
+    for (const [, group] of candidates) {
+      if (group.length < 2) continue;
+      group.sort((a, b) => b.accessCount - a.accessCount);
+      const best = group[0];
+
+      const allContent = group.map(g => g.content).join('\n');
+      const summary = `[ consolidated from ${group.length} memories ]\n${allContent.slice(0, 2000)}`;
+
+      const newType = best.accessCount >= 10 ? 'procedural' : 'semantic';
+      const existing = this.findSimilar(newType, best.content);
+      if (existing) {
+        existing.content = summary.slice(0, 4000);
+        existing.accessCount += Math.floor(group.reduce((s, g) => s + g.accessCount, 0) / group.length);
+        existing.importance = Math.min(10, existing.importance + 1);
+      } else {
+        this.store(newType, summary, best.tags, Math.min(10, best.importance + 2), 9, 'system');
+        consolidated++;
+      }
+
+      for (const old of group) {
+        if (old.id !== best.id) this.index.delete(old.id);
+      }
+    }
+
+    if (consolidated > 0 || candidates.size > 0) {
+      stats.lastConsolidate = now;
+      saveStats(stats);
+      this.dirty = true;
+    }
+  }
+
+  private findSimilar(type: MemoryEntry['type'], content: string): MemoryEntry | null {
+    const threshold = 0.75;
+    let best: MemoryEntry | null = null;
+    let bestSim = 0;
+    for (const entry of this.index.values()) {
+      if (entry.type !== type) continue;
+      const sim = similarity(content.slice(0, 300), entry.content.slice(0, 300));
+      if (sim > bestSim) { bestSim = sim; best = entry; }
+    }
+    return bestSim >= threshold ? best : null;
   }
 
-  // ============ 维护 ============
   private autoCleanup(): void {
     const entries = [...this.index.values()];
     entries.sort((a, b) => {
-      const scoreA = a.importance * 2 + a.accessCount - (Date.now() - a.accessedAt) / (1000 * 60 * 60 * 24);
-      const scoreB = b.importance * 2 + b.accessCount - (Date.now() - b.accessedAt) / (1000 * 60 * 60 * 24);
+      const scoreA = a.importance * 2 + a.accessCount + (a.type === 'semantic' ? 3 : a.type === 'procedural' ? 2 : 0) - (Date.now() - a.accessedAt) / (1000 * 60 * 60 * 24);
+      const scoreB = b.importance * 2 + b.accessCount + (b.type === 'semantic' ? 3 : b.type === 'procedural' ? 2 : 0) - (Date.now() - b.accessedAt) / (1000 * 60 * 60 * 24);
       return scoreA - scoreB;
     });
 
-    const toKeep = entries.slice(-500);
+    const toKeep = entries.slice(-800);
     this.index.clear();
     this.working = [];
     for (const entry of toKeep) {

package/src/model/DeepSeekClient.ts

@@ -240,7 +240,13 @@ export class DeepSeekClient {
       body.tool_choice = 'auto';
     }
 
-    return JSON.stringify(body);
+    return JSON.stringify({
+      ...body,
+      messages: (body.messages as Array<Record<string, unknown>>).map(m => {
+        if (m.role === 'tool' && !m.name) m.name = 'tool';
+        return m;
+      }),
+    });
   }
 
   private async makeRequest(config: DeepSeekConfig, body: string): Promise<Response> {

package/chinese_chess_ai/README.md

@@ -1,62 +0,0 @@
-# Chinese Chess AI - 中国象棋智能体
-
-基于 Alpha-Beta 搜索 + 自博弈学习的轻量级中国象棋 AI 引擎
-
-## 特性
-- ✅ 完整的中国象棋规则实现
-- ✅ Alpha-Beta 剪枝搜索算法
-- ✅ 高级优化：置换表、迭代加深、历史启发、杀手步法
-- ✅ 自博弈强化学习系统（CPU友好）
-- ✅ 轻量级设计，无需GPU
-- ✅ 智能评估函数（棋子价值+位置价值+机动性）
-- ✅ 命令行交互界面
-
-## 安装依赖
-```bash
-pip install -r requirements.txt
-```
-
-## 使用方法
-
-### 人机对战
-```bash
-python main.py --mode vs
-```
-
-### AI自训练
-```bash
-python main.py --mode train --epochs 100
-```
-
-### AI对弈（观看两AI对战）
-```bash
-python main.py --mode watch
-```
-
-## 项目结构
-```
-chinese_chess_ai/
-├── core/                  # 核心引擎
-│   ├── board.py          # 棋盘状态管理
-│   ├── pieces.py         # 棋子定义与规则
-│   ├── move_generator.py # 走法生成器
-│   └── evaluator.py      # 局面评估器
-├── search/                # 搜索算法
-│   ├── alphabeta.py      # Alpha-Beta搜索
-│   └── optimizations.py  # 搜索优化技术
-├── learning/              # 学习系统
-│   ├── trainer.py        # 自博弈训练器
-│   └── experience.py     # 经验回放缓冲区
-├── ui/                    # 用户界面
-│   └── cli.py            # 命令行界面
-├── utils/                 # 工具函数
-│   └── helpers.py        # 辅助函数
-├── main.py               # 主入口
-└── config.py             # 配置参数
-```
-
-## 技术栈
-- Python 3.8+
-- 纯NumPy计算（无深度学习框架依赖）
-- 经典游戏树搜索算法
-- 轻量级强化学习

package/chinese_chess_ai/config.py

@@ -1,63 +0,0 @@
-# -*- coding: utf-8 -*-
-"""
-中国象棋AI - 配置参数
-"""
-
-# 搜索配置
-SEARCH_CONFIG = {
-    'max_depth': 4,              # 最大搜索深度（默认4层，平衡速度与智能）
-    'iterative_deepening': True,  # 启用迭代加深
-    'use_transposition_table': True,  # 使用置换表
-    'use_killer_moves': True,     # 使用杀手步法
-    'use_history_heuristic': True,  # 使用历史启发
-    'null_move_pruning': True,    # 空步裁剪
-    'null_move_reduction': 2,     # 空步减少深度
-    'aspiration_window': 50,      # 渴望窗口大小
-    'time_limit': 3.0,            # 时间限制（秒）
-}
-
-# 评估函数配置
-EVALUATOR_CONFIG = {
-    # 棋子基础价值（分）
-    'piece_values': {
-        'KING': 10000,        # 将/帅
-        'ADVISOR': 200,       # 士/仕
-        'ELEPHANT': 200,      # 象/相
-        'HORSE': 400,         # 马
-        'CHARIOT': 900,       # 车
-        'CANNON': 450,        # 炮
-        'PAWN': 100,          # 兵/卒
-    },
-    
-    # 位置价值表权重
-    'position_weight': 0.6,
-    
-    # 机动性权重
-    'mobility_weight': 0.15,
-    
-    # 保护与威胁权重
-    'protection_weight': 0.1,
-    
-    # 中心控制权重
-    'center_control_weight': 0.15,
-}
-
-# 训练配置
-TRAINING_CONFIG = {
-    'learning_rate': 0.01,
-    'epochs': 100,
-    'games_per_epoch': 10,
-    'experience_replay_size': 10000,
-    'batch_size': 32,
-    'exploration_rate': 0.3,      # 初始探索率
-    'exploration_decay': 0.995,   # 探索率衰减
-    'min_exploration_rate': 0.05, # 最小探索率
-    'discount_factor': 0.95,      # 折扣因子
-}
-
-# 棋盘配置
-BOARD_CONFIG = {
-    'rows': 10,
-    'cols': 9,
-    'red_side': 'bottom',        # 红方在下方
-}

package/chinese_chess_ai/requirements.txt

@@ -1 +0,0 @@
-numpy>=1.21.0