autosnippet 3.3.0 → 3.3.3

package/dist/lib/service/panorama/CouplingAnalyzer.js

@@ -0,0 +1,192 @@
+/**
+ * CouplingAnalyzer — 模块耦合分析
+ *
+ * 三边融合 (import + call + dataFlow) 构建加权依赖图，
+ * 使用 Tarjan SCC 检测循环依赖，计算 fanIn/fanOut。
+ *
+ * @module CouplingAnalyzer
+ */
+/* ═══ Edge Weights ════════════════════════════════════════ */
+const EDGE_WEIGHTS = {
+    depends_on: 0.5,
+    calls: 1.0,
+    data_flow: 0.8,
+};
+/* ═══ CouplingAnalyzer Class ══════════════════════════════ */
+export class CouplingAnalyzer {
+    #db;
+    #projectRoot;
+    constructor(db, projectRoot) {
+        this.#db = db;
+        this.#projectRoot = projectRoot;
+    }
+    /**
+     * 分析模块间耦合关系
+     * @param moduleFiles - Map<moduleName, filePaths[]>
+     */
+    analyze(moduleFiles) {
+        // 1. 构建 file → module 反向索引
+        const fileToModule = new Map();
+        for (const [mod, files] of moduleFiles) {
+            for (const f of files) {
+                fileToModule.set(f, mod);
+            }
+        }
+        // 2. 从 knowledge_edges 聚合模块间边
+        const edges = this.#buildModuleEdges(moduleFiles, fileToModule);
+        // 3. 建图
+        const adjacency = new Map();
+        const allModules = new Set(moduleFiles.keys());
+        for (const edge of edges) {
+            allModules.add(edge.from);
+            allModules.add(edge.to);
+            if (!adjacency.has(edge.from)) {
+                adjacency.set(edge.from, new Map());
+            }
+            const existing = adjacency.get(edge.from).get(edge.to) ?? 0;
+            adjacency.get(edge.from).set(edge.to, existing + edge.weight);
+        }
+        // 4. Tarjan SCC
+        const cycles = this.#tarjanSCC(adjacency, allModules);
+        // 5. fanIn / fanOut
+        const metrics = new Map();
+        for (const mod of allModules) {
+            metrics.set(mod, { fanIn: 0, fanOut: 0 });
+        }
+        for (const edge of edges) {
+            if (edge.from === edge.to) {
+                continue;
+            }
+            const fromM = metrics.get(edge.from);
+            const toM = metrics.get(edge.to);
+            if (fromM) {
+                fromM.fanOut++;
+            }
+            if (toM) {
+                toM.fanIn++;
+            }
+        }
+        // 去重边 (同 from→to 聚合)
+        const dedupEdges = this.#deduplicateEdges(edges);
+        return { cycles, metrics, edges: dedupEdges };
+    }
+    /* ─── Internal helpers ──────────────────────────── */
+    #buildModuleEdges(moduleFiles, fileToModule) {
+        const edges = [];
+        const relations = ['depends_on', 'calls', 'data_flow'];
+        for (const relation of relations) {
+            const weight = EDGE_WEIGHTS[relation] ?? 0.5;
+            // 查询该类型的边（仅限当前项目：至少 from 侧实体属于本项目）
+            const rows = this.#db
+                .prepare(`SELECT ke.from_id, ke.from_type, ke.to_id, ke.to_type
+           FROM knowledge_edges ke
+           WHERE ke.relation = ?
+           AND (
+             ke.from_type = 'module'
+             OR EXISTS (
+               SELECT 1 FROM code_entities ce
+               WHERE ce.entity_id = ke.from_id AND ce.project_root = ?
+             )
+           )`)
+                .all(relation, this.#projectRoot);
+            for (const row of rows) {
+                const fromId = row.from_id;
+                const toId = row.to_id;
+                const fromType = row.from_type;
+                const toType = row.to_type;
+                // module-to-module 直接边 (depends_on)
+                if (fromType === 'module' && toType === 'module') {
+                    if (fromId !== toId && moduleFiles.has(fromId) && moduleFiles.has(toId)) {
+                        edges.push({ from: fromId, to: toId, weight, relation });
+                    }
+                    continue;
+                }
+                // entity-to-entity 边 → 解析 file → module
+                const fromModule = this.#resolveEntityModule(fromId, fromType, fileToModule);
+                const toModule = this.#resolveEntityModule(toId, toType, fileToModule);
+                if (fromModule && toModule && fromModule !== toModule) {
+                    edges.push({ from: fromModule, to: toModule, weight, relation });
+                }
+            }
+        }
+        return edges;
+    }
+    #resolveEntityModule(entityId, _entityType, fileToModule) {
+        // 先查实体所在文件
+        const row = this.#db
+            .prepare(`SELECT file_path FROM code_entities
+         WHERE entity_id = ? AND project_root = ? LIMIT 1`)
+            .get(entityId, this.#projectRoot);
+        if (!row?.file_path) {
+            return null;
+        }
+        return fileToModule.get(row.file_path) ?? null;
+    }
+    /**
+     * Tarjan 强连通分量算法
+     */
+    #tarjanSCC(adjacency, allNodes) {
+        let index = 0;
+        const stack = [];
+        const onStack = new Set();
+        const indices = new Map();
+        const lowlinks = new Map();
+        const sccs = [];
+        const strongConnect = (v) => {
+            indices.set(v, index);
+            lowlinks.set(v, index);
+            index++;
+            stack.push(v);
+            onStack.add(v);
+            const neighbors = adjacency.get(v);
+            if (neighbors) {
+                for (const w of neighbors.keys()) {
+                    if (!indices.has(w)) {
+                        strongConnect(w);
+                        lowlinks.set(v, Math.min(lowlinks.get(v), lowlinks.get(w)));
+                    }
+                    else if (onStack.has(w)) {
+                        lowlinks.set(v, Math.min(lowlinks.get(v), indices.get(w)));
+                    }
+                }
+            }
+            if (lowlinks.get(v) === indices.get(v)) {
+                const scc = [];
+                let w;
+                do {
+                    w = stack.pop();
+                    onStack.delete(w);
+                    scc.push(w);
+                } while (w !== v);
+                sccs.push(scc);
+            }
+        };
+        for (const node of allNodes) {
+            if (!indices.has(node)) {
+                strongConnect(node);
+            }
+        }
+        // 过滤出 size > 1 的 SCC (即循环依赖)
+        return sccs
+            .filter((scc) => scc.length > 1)
+            .map((cycle) => ({
+            cycle: cycle.reverse(),
+            severity: cycle.length > 3 ? 'error' : 'warning',
+        }));
+    }
+    #deduplicateEdges(edges) {
+        const key = (e) => `${e.from}→${e.to}`;
+        const map = new Map();
+        for (const e of edges) {
+            const k = key(e);
+            const existing = map.get(k);
+            if (existing) {
+                existing.weight = Math.max(existing.weight, e.weight);
+            }
+            else {
+                map.set(k, { ...e });
+            }
+        }
+        return [...map.values()];
+    }
+}

package/dist/lib/service/panorama/DimensionAnalyzer.d.ts

@@ -0,0 +1,28 @@
+/**
+ * DimensionAnalyzer — 多维度知识健康分析
+ *
+ * 灵感来源:
+ *   - ISO/IEC 25010 质量模型 (8 大特性: 可靠性、安全性、可维护性…)
+ *   - ThoughtWorks Tech Radar (Adopt/Trial/Assess/Hold 四环)
+ *   - 雷达图/蛛网图可视化模型
+ *
+ * 核心思路: 不再按「模块 × 文件数」衡量覆盖，
+ * 而是按「知识维度」衡量项目在各工程方向上的规范成熟度。
+ * 某维度 Recipe 为 0 → 该方向完全空白，标示为 gap。
+ *
+ * @module DimensionAnalyzer
+ */
+import type { CeDbLike, HealthRadar, KnowledgeGap } from './PanoramaTypes.js';
+export declare class DimensionAnalyzer {
+    #private;
+    constructor(db: CeDbLike);
+    /**
+     * 分析项目知识健康雷达
+     *
+     * @param moduleRoles — 项目中存在的模块角色 (用于 gap 优先级推断)
+     */
+    analyze(moduleRoles: string[]): {
+        radar: HealthRadar;
+        gaps: KnowledgeGap[];
+    };
+}

package/dist/lib/service/panorama/DimensionAnalyzer.js

@@ -0,0 +1,320 @@
+/**
+ * DimensionAnalyzer — 多维度知识健康分析
+ *
+ * 灵感来源:
+ *   - ISO/IEC 25010 质量模型 (8 大特性: 可靠性、安全性、可维护性…)
+ *   - ThoughtWorks Tech Radar (Adopt/Trial/Assess/Hold 四环)
+ *   - 雷达图/蛛网图可视化模型
+ *
+ * 核心思路: 不再按「模块 × 文件数」衡量覆盖，
+ * 而是按「知识维度」衡量项目在各工程方向上的规范成熟度。
+ * 某维度 Recipe 为 0 → 该方向完全空白，标示为 gap。
+ *
+ * @module DimensionAnalyzer
+ */
+/**
+ * 标准维度列表
+ *
+ * 覆盖主流软件工程关切方向，任何项目都应有所涉猎。
+ * `topics` 与 `categories` 匹配 knowledge_entries 的字段。
+ */
+const DIMENSION_DEFS = [
+    {
+        id: 'architecture',
+        name: '架构设计',
+        description: '模块结构、分层策略、依赖管理、设计模式',
+        topics: ['architecture', 'scaffold', 'workflow'],
+        categories: ['architecture', 'project-profile'],
+        weight: 1.0,
+        suggestedTopics: ['module-boundary', 'dependency-rule', 'layer-strategy'],
+        relatedRoles: ['core', 'foundation', 'app'],
+    },
+    {
+        id: 'coding-standards',
+        name: '编码规范',
+        description: '命名约定、代码风格、文档注释、import 顺序',
+        topics: ['conventions'],
+        categories: ['code-standard'],
+        weight: 0.8,
+        suggestedTopics: ['naming-convention', 'code-style', 'documentation'],
+        relatedRoles: [],
+    },
+    {
+        id: 'error-handling',
+        name: '错误处理',
+        description: '异常模式、错误恢复、输入验证、防御性编程',
+        topics: ['error-handling', 'constraints'],
+        categories: [],
+        weight: 1.0,
+        suggestedTopics: ['exception-pattern', 'error-recovery', 'input-validation'],
+        relatedRoles: ['service', 'networking', 'core'],
+    },
+    {
+        id: 'concurrency',
+        name: '并发与线程',
+        description: '线程安全、异步模式、竞态条件防护、锁策略',
+        topics: ['concurrency', 'async'],
+        categories: [],
+        weight: 0.9,
+        suggestedTopics: ['thread-safety', 'async-pattern', 'race-condition'],
+        relatedRoles: ['service', 'networking', 'storage'],
+    },
+    {
+        id: 'data-management',
+        name: '数据管理',
+        description: '持久化、缓存、序列化、数据流向完整性',
+        topics: ['data', 'data-flow', 'memory'],
+        categories: ['event-and-data-flow'],
+        weight: 0.8,
+        suggestedTopics: ['persistence', 'caching', 'serialization', 'data-integrity'],
+        relatedRoles: ['storage', 'model'],
+    },
+    {
+        id: 'networking',
+        name: '网络通信',
+        description: 'API 契约、请求模式、重试策略、实时通信',
+        topics: ['networking', 'real-time'],
+        categories: [],
+        weight: 0.7,
+        suggestedTopics: ['api-contract', 'retry-strategy', 'request-pattern'],
+        relatedRoles: ['networking'],
+    },
+    {
+        id: 'ui-patterns',
+        name: '界面模式',
+        description: 'UI 组件规范、生命周期、导航、数据绑定',
+        topics: ['ui', 'binding', 'pagination'],
+        categories: [],
+        weight: 0.7,
+        suggestedTopics: ['component-pattern', 'lifecycle', 'navigation'],
+        relatedRoles: ['ui', 'feature'],
+    },
+    {
+        id: 'testing',
+        name: '测试策略',
+        description: '测试模式、Mock 策略、CI/CD 流程',
+        topics: ['testing', 'test'],
+        categories: [],
+        weight: 0.9,
+        suggestedTopics: ['unit-test', 'mock-strategy', 'ci-cd'],
+        relatedRoles: [],
+    },
+    {
+        id: 'security',
+        name: '安全',
+        description: '认证授权、输入校验、加密、权限控制',
+        topics: ['security', 'auth'],
+        categories: [],
+        weight: 1.0,
+        suggestedTopics: ['authentication', 'authorization', 'encryption'],
+        relatedRoles: ['networking', 'service'],
+    },
+    {
+        id: 'performance',
+        name: '性能优化',
+        description: '内存管理、懒加载、缓存策略、渲染优化',
+        topics: ['performance', 'optimization'],
+        categories: [],
+        weight: 0.8,
+        suggestedTopics: ['memory-management', 'lazy-loading', 'rendering'],
+        relatedRoles: ['ui', 'storage'],
+    },
+    {
+        id: 'observability',
+        name: '可观测性',
+        description: '日志规范、事件追踪、监控诊断',
+        topics: ['logging', 'event', 'monitoring'],
+        categories: [],
+        weight: 0.7,
+        suggestedTopics: ['logging-standard', 'event-tracking', 'diagnostics'],
+        relatedRoles: ['service', 'core'],
+    },
+];
+/* ═══ DimensionAnalyzer Class ═════════════════════════════ */
+export class DimensionAnalyzer {
+    #db;
+    constructor(db) {
+        this.#db = db;
+    }
+    /**
+     * 分析项目知识健康雷达
+     *
+     * @param moduleRoles — 项目中存在的模块角色 (用于 gap 优先级推断)
+     */
+    analyze(moduleRoles) {
+        // 1. 从 DB 获取所有活跃 recipe 的维度分类信息
+        const recipes = this.#fetchRecipeMetadata();
+        // 2. 将每条 recipe 映射到维度
+        const dimensionCounts = new Map();
+        for (const def of DIMENSION_DEFS) {
+            dimensionCounts.set(def.id, { count: 0, titles: [] });
+        }
+        let totalRecipes = 0;
+        for (const recipe of recipes) {
+            totalRecipes++;
+            const dimId = this.#classifyRecipe(recipe);
+            if (dimId) {
+                const entry = dimensionCounts.get(dimId);
+                entry.count++;
+                if (entry.titles.length < 3) {
+                    entry.titles.push(recipe.title);
+                }
+            }
+        }
+        // 3. 计算各维度得分与状态
+        const dimensions = DIMENSION_DEFS.map((def) => {
+            const entry = dimensionCounts.get(def.id);
+            return this.#scoreDimension(def, entry.count, entry.titles);
+        });
+        // 4. 加权平均健康分
+        let weightedSum = 0;
+        let weightTotal = 0;
+        for (let i = 0; i < DIMENSION_DEFS.length; i++) {
+            weightedSum += dimensions[i].score * DIMENSION_DEFS[i].weight;
+            weightTotal += DIMENSION_DEFS[i].weight;
+        }
+        const overallScore = weightTotal > 0 ? Math.round(weightedSum / weightTotal) : 0;
+        // 5. 统计覆盖
+        const coveredDimensions = dimensions.filter((d) => d.recipeCount > 0).length;
+        const totalDimensions = dimensions.length;
+        const radar = {
+            dimensions,
+            overallScore,
+            totalRecipes,
+            coveredDimensions,
+            totalDimensions,
+            dimensionCoverage: totalDimensions > 0 ? coveredDimensions / totalDimensions : 0,
+        };
+        // 6. 生成维度空白 (gaps)
+        const roleSet = new Set(moduleRoles);
+        const gaps = this.#detectDimensionGaps(dimensions, roleSet);
+        return { radar, gaps };
+    }
+    /* ─── 从 DB 获取 recipe 元数据 ─────────────────── */
+    #fetchRecipeMetadata() {
+        try {
+            const rows = this.#db
+                .prepare(`SELECT title, category, topicHint, kind
+           FROM knowledge_entries
+           WHERE lifecycle IN ('active', 'pending')`)
+                .all();
+            return rows.map((r) => ({
+                title: String(r.title ?? ''),
+                category: String(r.category ?? ''),
+                topicHint: String(r.topicHint ?? ''),
+                kind: String(r.kind ?? ''),
+            }));
+        }
+        catch {
+            return [];
+        }
+    }
+    /* ─── Recipe → 维度分类 ────────────────────────── */
+    /**
+     * 将 recipe 分类到最匹配的维度
+     *
+     * 优先级: topicHint 精确匹配 → category 匹配 → null
+     */
+    #classifyRecipe(recipe) {
+        // 1. topicHint 精确匹配
+        if (recipe.topicHint) {
+            for (const def of DIMENSION_DEFS) {
+                if (def.topics.includes(recipe.topicHint)) {
+                    return def.id;
+                }
+            }
+        }
+        // 2. category 匹配
+        if (recipe.category) {
+            for (const def of DIMENSION_DEFS) {
+                if (def.categories.includes(recipe.category)) {
+                    return def.id;
+                }
+            }
+        }
+        return null;
+    }
+    /* ─── 维度评分 ─────────────────────────────────── */
+    #scoreDimension(def, recipeCount, titles) {
+        // 得分: 每条 recipe 贡献 20 分, 上限 100
+        const score = Math.min(100, recipeCount * 20);
+        // 状态阈值
+        let status;
+        if (recipeCount === 0) {
+            status = 'missing';
+        }
+        else if (recipeCount === 1) {
+            status = 'weak';
+        }
+        else if (recipeCount <= 4) {
+            status = 'adequate';
+        }
+        else {
+            status = 'strong';
+        }
+        // 雷达环级 (对应 Tech Radar)
+        let level;
+        if (score >= 80) {
+            level = 'adopt';
+        }
+        else if (score >= 40) {
+            level = 'trial';
+        }
+        else if (score > 0) {
+            level = 'assess';
+        }
+        else {
+            level = 'hold';
+        }
+        return {
+            id: def.id,
+            name: def.name,
+            description: def.description,
+            recipeCount,
+            score,
+            status,
+            level,
+            topRecipes: titles,
+        };
+    }
+    /* ─── 维度空白检测 ─────────────────────────────── */
+    #detectDimensionGaps(dimensions, moduleRoles) {
+        const gaps = [];
+        for (let i = 0; i < dimensions.length; i++) {
+            const dim = dimensions[i];
+            const def = DIMENSION_DEFS[i];
+            if (dim.status !== 'missing' && dim.status !== 'weak') {
+                continue;
+            }
+            // 优先级推断: 维度权重 × 是否有关联模块角色
+            const hasRelatedModules = def.relatedRoles.length === 0 || def.relatedRoles.some((r) => moduleRoles.has(r));
+            let priority;
+            if (dim.status === 'missing' && def.weight >= 0.9) {
+                priority = 'high';
+            }
+            else if (dim.status === 'missing' && hasRelatedModules) {
+                priority = 'high';
+            }
+            else if (dim.status === 'missing') {
+                priority = 'medium';
+            }
+            else {
+                // weak
+                priority = hasRelatedModules && def.weight >= 0.9 ? 'medium' : 'low';
+            }
+            const affectedRoles = def.relatedRoles.filter((r) => moduleRoles.has(r));
+            gaps.push({
+                dimension: def.id,
+                dimensionName: def.name,
+                recipeCount: dim.recipeCount,
+                status: dim.status,
+                priority,
+                suggestedTopics: def.suggestedTopics,
+                affectedRoles,
+            });
+        }
+        // 按优先级排序
+        const priorityOrder = { high: 0, medium: 1, low: 2 };
+        return gaps.sort((a, b) => priorityOrder[a.priority] - priorityOrder[b.priority]);
+    }
+}

package/dist/lib/service/panorama/LayerInferrer.d.ts

@@ -0,0 +1,19 @@
+/**
+ * LayerInferrer — 拓扑排序层级推断
+ *
+ * 基于模块依赖图，通过去环 + 拓扑排序 + 最长路径法推断架构层级 (L0-Ln)。
+ * 底层 (L0) = Foundation/Core，顶层 = App/UI。
+ *
+ * @module LayerInferrer
+ */
+import type { CyclicDependency, Edge, LayerHierarchy } from './PanoramaTypes.js';
+export declare class LayerInferrer {
+    #private;
+    /**
+     * 从模块依赖边推断架构层级
+     * @param edges - 模块间依赖边 (from depends_on/calls/data_flow to)
+     * @param modules - 所有模块名
+     * @param cycles - 已检测到的循环依赖
+     */
+    infer(edges: Edge[], modules: string[], cycles: CyclicDependency[]): LayerHierarchy;
+}