autosnippet 3.0.0 → 3.0.2

package/lib/service/knowledge/CodeEntityGraph.js

@@ -85,14 +85,16 @@ export class CodeEntityGraph {
    * @returns {GraphPopulateResult}
    */
   populateFromAst(astSummary) {
-    if (!astSummary) return { entitiesUpserted: 0, edgesCreated: 0, durationMs: 0 };
+    if (!astSummary) {
+      return { entitiesUpserted: 0, edgesCreated: 0, durationMs: 0 };
+    }
     const t0 = Date.now();
     let entities = 0;
     let edges = 0;
 
     const run = this.db.transaction(() => {
       // ── 类 ──
-      for (const cls of (astSummary.classes || [])) {
+      for (const cls of astSummary.classes || []) {
         this.#upsertEntity({
           entityId: cls.name,
           entityType: cls.isCategory ? 'category' : 'class',
@@ -110,7 +112,7 @@ export class CodeEntityGraph {
       }
 
       // ── 协议 ──
-      for (const proto of (astSummary.protocols || [])) {
+      for (const proto of astSummary.protocols || []) {
         this.#upsertEntity({
           entityId: proto.name,
           entityType: 'protocol',
@@ -126,7 +128,7 @@ export class CodeEntityGraph {
       }
 
       // ── Category ──
-      for (const cat of (astSummary.categories || [])) {
+      for (const cat of astSummary.categories || []) {
         const catId = `${cat.className}(${cat.categoryName})`;
         this.#upsertEntity({
           entityId: catId,
@@ -145,7 +147,7 @@ export class CodeEntityGraph {
       }
 
       // ── 继承/遵循/扩展 边 (从 AST inheritanceGraph) ──
-      for (const edge of (astSummary.inheritanceGraph || [])) {
+      for (const edge of astSummary.inheritanceGraph || []) {
         const fromType = this.#inferEntityType(edge.from, astSummary);
         const toType = this.#inferEntityType(edge.to, astSummary);
         this.#addEdge(edge.from, fromType, edge.to, toType, edge.type, {
@@ -187,7 +189,9 @@ export class CodeEntityGraph {
     run();
 
     const result = { entitiesUpserted: entities, edgesCreated: edges, durationMs: Date.now() - t0 };
-    this.log.info(`[CodeEntityGraph] AST populate: ${entities} entities, ${edges} edges (${result.durationMs}ms)`);
+    this.log.info(
+      `[CodeEntityGraph] AST populate: ${entities} entities, ${edges} edges (${result.durationMs}ms)`
+    );
     return result;
   }
 
@@ -201,12 +205,14 @@ export class CodeEntityGraph {
    * @returns {GraphPopulateResult}
    */
   populateFromSpm(depGraphData) {
-    if (!depGraphData) return { entitiesUpserted: 0, edgesCreated: 0, durationMs: 0 };
+    if (!depGraphData) {
+      return { entitiesUpserted: 0, edgesCreated: 0, durationMs: 0 };
+    }
     const t0 = Date.now();
     let entities = 0;
 
     const run = this.db.transaction(() => {
-      for (const node of (depGraphData.nodes || [])) {
+      for (const node of depGraphData.nodes || []) {
         this.#upsertEntity({
           entityId: node.id || node.label || node,
           entityType: 'module',
@@ -222,7 +228,9 @@ export class CodeEntityGraph {
     run();
 
     const result = { entitiesUpserted: entities, edgesCreated: 0, durationMs: Date.now() - t0 };
-    this.log.info(`[CodeEntityGraph] SPM populate: ${entities} module entities (${result.durationMs}ms)`);
+    this.log.info(
+      `[CodeEntityGraph] SPM populate: ${entities} module entities (${result.durationMs}ms)`
+    );
     return result;
   }
 
@@ -233,14 +241,18 @@ export class CodeEntityGraph {
    * @returns {GraphPopulateResult}
    */
   populateFromCandidateRelations(candidates) {
-    if (!candidates?.length) return { entitiesUpserted: 0, edgesCreated: 0, durationMs: 0 };
+    if (!candidates?.length) {
+      return { entitiesUpserted: 0, edgesCreated: 0, durationMs: 0 };
+    }
     const t0 = Date.now();
     let edges = 0;
 
     const run = this.db.transaction(() => {
       for (const candidate of candidates) {
         const title = candidate.title || candidate.id || '';
-        if (!title) continue;
+        if (!title) {
+          continue;
+        }
 
         // 处理 Relations 对象或扁平数组
         let flatRelations;
@@ -252,7 +264,7 @@ export class CodeEntityGraph {
           // 桶结构 → 扁平
           flatRelations = [];
           for (const [type, list] of Object.entries(candidate.relations)) {
-            for (const r of (Array.isArray(list) ? list : [])) {
+            for (const r of Array.isArray(list) ? list : []) {
               flatRelations.push({ type, target: r.target, description: r.description });
             }
           }
@@ -261,7 +273,9 @@ export class CodeEntityGraph {
         }
 
         for (const rel of flatRelations) {
-          if (!rel.target) continue;
+          if (!rel.target) {
+            continue;
+          }
           // 映射关系类型到边类型
           const relation = this.#mapRelationType(rel.type);
           this.#addEdge(title, 'recipe', rel.target, 'recipe', relation, {
@@ -296,9 +310,9 @@ export class CodeEntityGraph {
     if (entityType) {
       row = this.stmts.getEntity.get(entityId, entityType, this.projectRoot);
     } else {
-      row = this.db.prepare(
-        `SELECT * FROM code_entities WHERE entity_id = ? AND project_root = ? LIMIT 1`
-      ).get(entityId, this.projectRoot);
+      row = this.db
+        .prepare(`SELECT * FROM code_entities WHERE entity_id = ? AND project_root = ? LIMIT 1`)
+        .get(entityId, this.projectRoot);
     }
     return row ? this.#mapEntity(row) : null;
   }
@@ -311,7 +325,7 @@ export class CodeEntityGraph {
    */
   listEntities(entityType, limit = 200) {
     const rows = this.stmts.listByType.all(entityType, this.projectRoot, limit);
-    return rows.map(r => this.#mapEntity(r));
+    return rows.map((r) => this.#mapEntity(r));
   }
 
   /**
@@ -332,7 +346,10 @@ export class CodeEntityGraph {
     }
     sql += ` ORDER BY name LIMIT ?`;
     params.push(options.limit || 20);
-    return this.db.prepare(sql).all(...params).map(r => this.#mapEntity(r));
+    return this.db
+      .prepare(sql)
+      .all(...params)
+      .map((r) => this.#mapEntity(r));
   }
 
   /**
@@ -343,16 +360,20 @@ export class CodeEntityGraph {
    * @returns {{ outgoing: EntityEdge[], incoming: EntityEdge[] }}
    */
   getEntityEdges(entityId, entityType, direction = 'both') {
-    const outgoing = (direction === 'both' || direction === 'out')
-      ? this.db.prepare(
-          `SELECT * FROM knowledge_edges WHERE from_id = ? AND from_type = ?`
-        ).all(entityId, entityType).map(this.#mapEdge)
-      : [];
-    const incoming = (direction === 'both' || direction === 'in')
-      ? this.db.prepare(
-          `SELECT * FROM knowledge_edges WHERE to_id = ? AND to_type = ?`
-        ).all(entityId, entityType).map(this.#mapEdge)
-      : [];
+    const outgoing =
+      direction === 'both' || direction === 'out'
+        ? this.db
+            .prepare(`SELECT * FROM knowledge_edges WHERE from_id = ? AND from_type = ?`)
+            .all(entityId, entityType)
+            .map(this.#mapEdge)
+        : [];
+    const incoming =
+      direction === 'both' || direction === 'in'
+        ? this.db
+            .prepare(`SELECT * FROM knowledge_edges WHERE to_id = ? AND to_type = ?`)
+            .all(entityId, entityType)
+            .map(this.#mapEdge)
+        : [];
     return { outgoing, incoming };
   }
 
@@ -366,11 +387,15 @@ export class CodeEntityGraph {
     const chain = [className];
     let current = className;
     for (let i = 0; i < maxDepth; i++) {
-      const parent = this.db.prepare(
-        `SELECT to_id FROM knowledge_edges 
+      const parent = this.db
+        .prepare(
+          `SELECT to_id FROM knowledge_edges 
          WHERE from_id = ? AND from_type = 'class' AND relation = 'inherits' LIMIT 1`
-      ).get(current);
-      if (!parent) break;
+        )
+        .get(current);
+      if (!parent) {
+        break;
+      }
       chain.push(parent.to_id);
       current = parent.to_id;
     }
@@ -390,22 +415,27 @@ export class CodeEntityGraph {
     const queue = [{ id: entityId, type: entityType, depth: 0 }];
 
     // 类的子类/Category + 协议的遵循者
-    const relations = entityType === 'protocol'
-      ? ['conforms', 'inherits']
-      : ['inherits', 'extends'];
+    const relations =
+      entityType === 'protocol' ? ['conforms', 'inherits'] : ['inherits', 'extends'];
 
     while (queue.length > 0) {
       const { id, type, depth } = queue.shift();
-      if (depth >= maxDepth) continue;
+      if (depth >= maxDepth) {
+        continue;
+      }
       const key = `${type}:${id}`;
-      if (visited.has(key)) continue;
+      if (visited.has(key)) {
+        continue;
+      }
       visited.add(key);
 
       for (const rel of relations) {
-        const children = this.db.prepare(
-          `SELECT from_id, from_type FROM knowledge_edges 
+        const children = this.db
+          .prepare(
+            `SELECT from_id, from_type FROM knowledge_edges 
            WHERE to_id = ? AND to_type = ? AND relation = ?`
-        ).all(id, type, rel);
+          )
+          .all(id, type, rel);
 
         for (const child of children) {
           const childKey = `${child.from_type}:${child.from_id}`;
@@ -431,11 +461,13 @@ export class CodeEntityGraph {
    * @returns {string[]}
    */
   getConformances(className) {
-    const rows = this.db.prepare(
-      `SELECT to_id FROM knowledge_edges 
+    const rows = this.db
+      .prepare(
+        `SELECT to_id FROM knowledge_edges 
        WHERE from_id = ? AND from_type IN ('class', 'category') AND relation = 'conforms'`
-    ).all(className);
-    return rows.map(r => r.to_id);
+      )
+      .all(className);
+    return rows.map((r) => r.to_id);
   }
 
   /**
@@ -453,18 +485,28 @@ export class CodeEntityGraph {
 
     while (queue.length > 0) {
       const { id, type, path } = queue.shift();
-      if (path.length >= maxDepth) continue;
+      if (path.length >= maxDepth) {
+        continue;
+      }
 
       const key = `${type}:${id}`;
-      if (visited.has(key)) continue;
+      if (visited.has(key)) {
+        continue;
+      }
       visited.add(key);
 
-      const neighbors = this.db.prepare(
-        `SELECT to_id, to_type, relation, weight FROM knowledge_edges WHERE from_id = ? AND from_type = ?`
-      ).all(id, type);
+      const neighbors = this.db
+        .prepare(
+          `SELECT to_id, to_type, relation, weight FROM knowledge_edges WHERE from_id = ? AND from_type = ?`
+        )
+        .all(id, type);
 
       for (const n of neighbors) {
-        const step = { from: { id, type }, to: { id: n.to_id, type: n.to_type }, relation: n.relation };
+        const step = {
+          from: { id, type },
+          to: { id: n.to_id, type: n.to_type },
+          relation: n.relation,
+        };
         const newPath = [...path, step];
 
         if (n.to_id === toId && n.to_type === toType) {
@@ -491,17 +533,23 @@ export class CodeEntityGraph {
 
     while (queue.length > 0) {
       const { id, type, depth } = queue.shift();
-      if (depth >= maxDepth) continue;
+      if (depth >= maxDepth) {
+        continue;
+      }
 
       const key = `${type}:${id}`;
-      if (visited.has(key)) continue;
+      if (visited.has(key)) {
+        continue;
+      }
       visited.add(key);
 
       // 找出所有"依赖/引用此实体"的上游
-      const dependents = this.db.prepare(
-        `SELECT from_id, from_type, relation FROM knowledge_edges 
+      const dependents = this.db
+        .prepare(
+          `SELECT from_id, from_type, relation FROM knowledge_edges 
          WHERE to_id = ? AND to_type = ?`
-      ).all(id, type);
+        )
+        .all(id, type);
 
       for (const dep of dependents) {
         const depKey = `${dep.from_type}:${dep.from_id}`;
@@ -525,29 +573,33 @@ export class CodeEntityGraph {
    * @returns {object}
    */
   getTopology() {
-    const entityStats = this.db.prepare(
-      `SELECT entity_type, COUNT(*) as count FROM code_entities 
+    const entityStats = this.db
+      .prepare(
+        `SELECT entity_type, COUNT(*) as count FROM code_entities 
        WHERE project_root = ? GROUP BY entity_type`
-    ).all(this.projectRoot);
+      )
+      .all(this.projectRoot);
 
-    const edgeStats = this.db.prepare(
-      `SELECT relation, COUNT(*) as count FROM knowledge_edges GROUP BY relation`
-    ).all();
+    const edgeStats = this.db
+      .prepare(`SELECT relation, COUNT(*) as count FROM knowledge_edges GROUP BY relation`)
+      .all();
 
     // 入度最高的实体 = 被依赖最多
-    const hotNodes = this.db.prepare(
-      `SELECT to_id, to_type, COUNT(*) as in_degree 
+    const hotNodes = this.db
+      .prepare(
+        `SELECT to_id, to_type, COUNT(*) as in_degree 
        FROM knowledge_edges 
        GROUP BY to_id, to_type 
        ORDER BY in_degree DESC LIMIT 15`
-    ).all();
+      )
+      .all();
 
     return {
-      entities: Object.fromEntries(entityStats.map(s => [s.entity_type, s.count])),
-      edges: Object.fromEntries(edgeStats.map(s => [s.relation, s.count])),
+      entities: Object.fromEntries(entityStats.map((s) => [s.entity_type, s.count])),
+      edges: Object.fromEntries(edgeStats.map((s) => [s.relation, s.count])),
       totalEntities: entityStats.reduce((sum, s) => sum + s.count, 0),
       totalEdges: edgeStats.reduce((sum, s) => sum + s.count, 0),
-      hotNodes: hotNodes.map(n => ({ id: n.to_id, type: n.to_type, inDegree: n.in_degree })),
+      hotNodes: hotNodes.map((n) => ({ id: n.to_id, type: n.to_type, inDegree: n.in_degree })),
     };
   }
 
@@ -560,10 +612,12 @@ export class CodeEntityGraph {
    */
   generateContextForAgent(options = {}) {
     const maxEntities = options.maxEntities || 30;
-    const maxEdges = options.maxEdges || 50;
+    const _maxEdges = options.maxEdges || 50;
     const topo = this.getTopology();
 
-    if (topo.totalEntities === 0) return '';
+    if (topo.totalEntities === 0) {
+      return '';
+    }
 
     const lines = [
       '## 代码实体图谱 (Code Entity Graph)',
@@ -602,8 +656,10 @@ export class CodeEntityGraph {
       lines.push('### 协议');
       for (const p of protocols) {
         const conformers = this.getDescendants(p.entityId, 'protocol', 1);
-        const cNames = conformers.map(c => c.id).slice(0, 5);
-        lines.push(`- \`${p.name}\` ← ${cNames.length > 0 ? cNames.map(n => '`' + n + '`').join(', ') : '(无遵循者)'}`);
+        const cNames = conformers.map((c) => c.id).slice(0, 5);
+        lines.push(
+          `- \`${p.name}\` ← ${cNames.length > 0 ? cNames.map((n) => `\`${n}\``).join(', ') : '(无遵循者)'}`
+        );
       }
       lines.push('');
     }
@@ -618,9 +674,11 @@ export class CodeEntityGraph {
     const run = this.db.transaction(() => {
       this.stmts.clearEntities.run(this.projectRoot);
       // 只清除 AST 产出的边 (保留 recipe/module 边)
-      this.db.prepare(
-        `DELETE FROM knowledge_edges WHERE metadata_json LIKE '%ast-bootstrap%' OR metadata_json LIKE '%ast-pattern-detection%'`
-      ).run();
+      this.db
+        .prepare(
+          `DELETE FROM knowledge_edges WHERE metadata_json LIKE '%ast-bootstrap%' OR metadata_json LIKE '%ast-pattern-detection%'`
+        )
+        .run();
     });
     run();
     this.log.info(`[CodeEntityGraph] Cleared entities for project: ${this.projectRoot}`);
@@ -675,9 +733,7 @@ export class CodeEntityGraph {
       listByType: this.db.prepare(
         `SELECT * FROM code_entities WHERE entity_type = ? AND project_root = ? ORDER BY name LIMIT ?`
       ),
-      clearEntities: this.db.prepare(
-        `DELETE FROM code_entities WHERE project_root = ?`
-      ),
+      clearEntities: this.db.prepare(`DELETE FROM code_entities WHERE project_root = ?`),
       addEdge: this.db.prepare(`
         INSERT OR REPLACE INTO knowledge_edges (from_id, from_type, to_id, to_type, relation, weight, metadata_json, created_at, updated_at)
         VALUES (?, ?, ?, ?, ?, ?, ?, ?, ?)
@@ -702,7 +758,7 @@ export class CodeEntityGraph {
       JSON.stringify(entity.protocols || []),
       JSON.stringify(entity.metadata || {}),
       now,
-      now,
+      now
     );
   }
 
@@ -710,10 +766,15 @@ export class CodeEntityGraph {
     const now = Math.floor(Date.now() / 1000);
     try {
       this.stmts.addEdge.run(
-        fromId, fromType, toId, toType, relation,
+        fromId,
+        fromType,
+        toId,
+        toType,
+        relation,
         metadata.weight || 1.0,
         JSON.stringify(metadata),
-        now, now,
+        now,
+        now
       );
     } catch (err) {
       // Ignore duplicate edge errors
@@ -727,8 +788,12 @@ export class CodeEntityGraph {
    * 从 AST 数据推断实体类型
    */
   #inferEntityType(name, astSummary) {
-    if (astSummary.protocols?.some(p => p.name === name)) return 'protocol';
-    if (name.includes('(') && name.includes(')')) return 'category';
+    if (astSummary.protocols?.some((p) => p.name === name)) {
+      return 'protocol';
+    }
+    if (name.includes('(') && name.includes(')')) {
+      return 'category';
+    }
     return 'class';
   }
 

package/lib/service/knowledge/ConfidenceRouter.js

@@ -91,15 +91,15 @@ export class ConfidenceRouter {
     if (this._qualityScorer) {
       try {
         const scorerInput = {
-          title:      entry.title,
-          trigger:    entry.trigger,
-          code:       entry.content?.pattern || entry.content?.markdown || '',
-          language:   entry.language,
-          category:   entry.category,
-          summary:    entry.summaryCn || entry.summaryEn || '',
+          title: entry.title,
+          trigger: entry.trigger,
+          code: entry.content?.pattern || entry.content?.markdown || '',
+          language: entry.language,
+          category: entry.category,
+          summary: entry.summaryCn || entry.summaryEn || '',
           usageGuide: entry.usageGuideCn || entry.usageGuideEn || '',
-          headers:    entry.headers || [],
-          tags:       entry.tags || [],
+          headers: entry.headers || [],
+          tags: entry.tags || [],
         };
         const result = this._qualityScorer.score(scorerInput);
         qualityScore = result.score;
@@ -143,13 +143,15 @@ export class ConfidenceRouter {
    */
   _estimateContentLength(entry) {
     const content = entry.content;
-    if (!content) return 0;
+    if (!content) {
+      return 0;
+    }
 
     const parts = [
       content.pattern,
       content.rationale,
       content.markdown,
-      ...(content.steps || []).map(s => typeof s === 'string' ? s : s?.description || ''),
+      ...(content.steps || []).map((s) => (typeof s === 'string' ? s : s?.description || '')),
     ].filter(Boolean);
 
     return parts.reduce((sum, p) => sum + p.length, 0);