autosnippet 3.2.9 → 3.2.11

package/dist/lib/service/search/CoarseRanker.js

@@ -0,0 +1,114 @@
+/**
+ * CoarseRanker — 粗排器
+ * 基于 E-E-A-T 标准的 5 维加权排序（BM25 + Semantic + Quality + Freshness + Popularity）
+ */
+export class CoarseRanker {
+    #weights;
+    constructor(options = {}) {
+        this.#weights = {
+            bm25: options.bm25Weight ?? 0.3,
+            semantic: options.semanticWeight ?? 0.3,
+            quality: options.qualityWeight ?? 0.2,
+            freshness: options.freshnessWeight ?? 0.1,
+            popularity: options.popularityWeight ?? 0.1,
+        };
+    }
+    /**
+     * 粗排
+     * @param {Array} candidates 需有 bm25Score、semanticScore 等字段
+     * @returns {Array} - sorted with coarseScore
+     */
+    rank(candidates) {
+        if (!candidates || candidates.length === 0) {
+            return [];
+        }
+        // 动态权重调整：semantic 不可用时将其权重按比例重分配给其他维度
+        const hasSemanticScores = candidates.some((c) => (c.semanticScore || 0) > 0);
+        const effectiveWeights = { ...this.#weights };
+        if (!hasSemanticScores && effectiveWeights.semantic > 0) {
+            const semWeight = effectiveWeights.semantic;
+            const otherTotal = 1 - semWeight;
+            if (otherTotal > 0) {
+                for (const key of Object.keys(effectiveWeights)) {
+                    if (key !== 'semantic') {
+                        effectiveWeights[key] +=
+                            (effectiveWeights[key] / otherTotal) * semWeight;
+                    }
+                }
+            }
+            effectiveWeights.semantic = 0;
+        }
+        // BM25 分数 max-based 归一化（保留相对排序，避免 clamp 截断高分差异）
+        const maxBm25 = candidates.reduce((m, c) => Math.max(m, c.bm25Score || c.score || 0), 0) || 1;
+        return candidates
+            .map((c) => {
+            const bm25 = Math.min((c.bm25Score || c.score || 0) / maxBm25, 1.0);
+            const semantic = this.#normalize(c.semanticScore || 0);
+            const quality = this.#computeQuality(c);
+            const freshness = this.#computeFreshness(c);
+            const popularity = this.#computePopularity(c);
+            const coarseScore = bm25 * effectiveWeights.bm25 +
+                semantic * effectiveWeights.semantic +
+                quality * effectiveWeights.quality +
+                freshness * effectiveWeights.freshness +
+                popularity * effectiveWeights.popularity;
+            return {
+                ...c,
+                coarseScore,
+                coarseSignals: { bm25, semantic, quality, freshness, popularity },
+            };
+        })
+            .sort((a, b) => b.coarseScore - a.coarseScore);
+    }
+    /**
+     * E-E-A-T 质量评分
+     * - 内容完整性 40%: 有 title + code + description
+     * - 结构质量 30%: 有 category + language + tags
+     * - 代码可读性 30%: 合理长度、有注释
+     */
+    #computeQuality(candidate) {
+        let score = 0;
+        // 内容完整性 (40%)
+        const hasTitle = !!candidate.title;
+        const hasCode = !!(candidate.code || candidate.content);
+        const hasDesc = !!(candidate.description || candidate.summary);
+        score += (hasTitle ? 0.15 : 0) + (hasCode ? 0.15 : 0) + (hasDesc ? 0.1 : 0);
+        // 结构质量 (30%)
+        const hasCat = !!candidate.category;
+        const hasLang = !!candidate.language;
+        const hasTags = Array.isArray(candidate.tags) && candidate.tags.length > 0;
+        score += (hasCat ? 0.1 : 0) + (hasLang ? 0.1 : 0) + (hasTags ? 0.1 : 0);
+        // 代码可读性 (30%)
+        const code = candidate.code || candidate.content || '';
+        const lines = code.split('\n').length;
+        const hasComments = /\/\/|\/\*|#/.test(code);
+        const reasonableLength = lines >= 3 && lines <= 500;
+        score += (hasComments ? 0.15 : 0) + (reasonableLength ? 0.15 : 0);
+        return Math.min(score, 1.0);
+    }
+    #computeFreshness(candidate) {
+        const updated = candidate.updatedAt || candidate.lastModified || candidate.createdAt;
+        if (!updated) {
+            return 0.5;
+        }
+        // 自动识别秒级/毫秒级 Unix 时间戳 (秒级 ≤ 9999999999 即 2286 年)
+        const ts = typeof updated === 'number' && updated > 0 && updated <= 9999999999
+            ? updated * 1000
+            : typeof updated === 'number'
+                ? updated
+                : new Date(updated).getTime();
+        const ageDays = (Date.now() - ts) / 86400000;
+        if (ageDays < 0) {
+            return 1.0; // 未来时间戳视为最新
+        }
+        return Math.exp((-Math.LN2 * ageDays) / 180); // 半衰期 180 天
+    }
+    #computePopularity(candidate) {
+        const usage = candidate.usageCount || 0;
+        return usage > 0 ? Math.min(Math.log10(usage + 1) / 3, 1.0) : 0;
+    }
+    #normalize(value) {
+        return Math.min(Math.max(value, 0), 1.0);
+    }
+}
+//# sourceMappingURL=CoarseRanker.js.map

package/dist/lib/service/search/CoarseRanker.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"CoarseRanker.js","sourceRoot":"","sources":["../../../../lib/service/search/CoarseRanker.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAqBH,MAAM,OAAO,YAAY;IACvB,QAAQ,CAAC;IAET,YACE,UAMI,EAAE;QAEN,IAAI,CAAC,QAAQ,GAAG;YACd,IAAI,EAAE,OAAO,CAAC,UAAU,IAAI,GAAG;YAC/B,QAAQ,EAAE,OAAO,CAAC,cAAc,IAAI,GAAG;YACvC,OAAO,EAAE,OAAO,CAAC,aAAa,IAAI,GAAG;YACrC,SAAS,EAAE,OAAO,CAAC,eAAe,IAAI,GAAG;YACzC,UAAU,EAAE,OAAO,CAAC,gBAAgB,IAAI,GAAG;SAC5C,CAAC;IACJ,CAAC;IAED;;;;OAIG;IACH,IAAI,CAAC,UAA6B;QAChC,IAAI,CAAC,UAAU,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC3C,OAAO,EAAE,CAAC;QACZ,CAAC;QAED,sCAAsC;QACtC,MAAM,iBAAiB,GAAG,UAAU,CAAC,IAAI,CAAC,CAAC,CAAkB,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,aAAa,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAC9F,MAAM,gBAAgB,GAAG,EAAE,GAAG,IAAI,CAAC,QAAQ,EAAE,CAAC;QAC9C,IAAI,CAAC,iBAAiB,IAAI,gBAAgB,CAAC,QAAQ,GAAG,CAAC,EAAE,CAAC;YACxD,MAAM,SAAS,GAAG,gBAAgB,CAAC,QAAQ,CAAC;YAC5C,MAAM,UAAU,GAAG,CAAC,GAAG,SAAS,CAAC;YACjC,IAAI,UAAU,GAAG,CAAC,EAAE,CAAC;gBACnB,KAAK,MAAM,GAAG,IAAI,MAAM,CAAC,IAAI,CAAC,gBAAgB,CAAC,EAAE,CAAC;oBAChD,IAAI,GAAG,KAAK,UAAU,EAAE,CAAC;wBACtB,gBAA2C,CAAC,GAAG,CAAC;4BAC/C,CAAE,gBAA2C,CAAC,GAAG,CAAC,GAAG,UAAU,CAAC,GAAG,SAAS,CAAC;oBACjF,CAAC;gBACH,CAAC;YACH,CAAC;YACD,gBAAgB,CAAC,QAAQ,GAAG,CAAC,CAAC;QAChC,CAAC;QAED,gDAAgD;QAChD,MAAM,OAAO,GACX,UAAU,CAAC,MAAM,CACf,CAAC,CAAS,EAAE,CAAkB,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,SAAS,IAAI,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,EAC3E,CAAC,CACF,IAAI,CAAC,CAAC;QAET,OAAO,UAAU;aACd,GAAG,CAAC,CAAC,CAAkB,EAAE,EAAE;YAC1B,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,SAAS,IAAI,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,GAAG,OAAO,EAAE,GAAG,CAAC,CAAC;YACpE,MAAM,QAAQ,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,aAAa,IAAI,CAAC,CAAC,CAAC;YACvD,MAAM,OAAO,GAAG,IAAI,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;YACxC,MAAM,SAAS,GAAG,IAAI,CAAC,iBAAiB,CAAC,CAAC,CAAC,CAAC;YAC5C,MAAM,UAAU,GAAG,IAAI,CAAC,kBAAkB,CAAC,CAAC,CAAC,CAAC;YAE9C,MAAM,WAAW,GACf,IAAI,GAAG,gBAAgB,CAAC,IAAI;gBAC5B,QAAQ,GAAG,gBAAgB,CAAC,QAAQ;gBACpC,OAAO,GAAG,gBAAgB,CAAC,OAAO;gBAClC,SAAS,GAAG,gBAAgB,CAAC,SAAS;gBACtC,UAAU,GAAG,gBAAgB,CAAC,UAAU,CAAC;YAE3C,OAAO;gBACL,GAAG,CAAC;gBACJ,WAAW;gBACX,aAAa,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE,OAAO,EAAE,SAAS,EAAE,UAAU,EAAE;aAClE,CAAC;QACJ,CAAC,CAAC;aACD,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,WAAW,GAAG,CAAC,CAAC,WAAW,CAAC,CAAC;IACnD,CAAC;IAED;;;;;OAKG;IACH,eAAe,CAAC,SAA0B;QACxC,IAAI,KAAK,GAAG,CAAC,CAAC;QAEd,cAAc;QACd,MAAM,QAAQ,GAAG,CAAC,CAAC,SAAS,CAAC,KAAK,CAAC;QACnC,MAAM,OAAO,GAAG,CAAC,CAAC,CAAC,SAAS,CAAC,IAAI,IAAI,SAAS,CAAC,OAAO,CAAC,CAAC;QACxD,MAAM,OAAO,GAAG,CAAC,CAAC,CAAC,SAAS,CAAC,WAAW,IAAI,SAAS,CAAC,OAAO,CAAC,CAAC;QAC/D,KAAK,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAE5E,aAAa;QACb,MAAM,MAAM,GAAG,CAAC,CAAC,SAAS,CAAC,QAAQ,CAAC;QACpC,MAAM,OAAO,GAAG,CAAC,CAAC,SAAS,CAAC,QAAQ,CAAC;QACrC,MAAM,OAAO,GAAG,KAAK,CAAC,OAAO,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,SAAS,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;QAC3E,KAAK,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAExE,cAAc;QACd,MAAM,IAAI,GAAG,SAAS,CAAC,IAAI,IAAI,SAAS,CAAC,OAAO,IAAI,EAAE,CAAC;QACvD,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC;QACtC,MAAM,WAAW,GAAG,aAAa,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC7C,MAAM,gBAAgB,GAAG,KAAK,IAAI,CAAC,IAAI,KAAK,IAAI,GAAG,CAAC;QACpD,KAAK,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,gBAAgB,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAElE,OAAO,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;IAC9B,CAAC;IAED,iBAAiB,CAAC,SAA0B;QAC1C,MAAM,OAAO,GAAG,SAAS,CAAC,SAAS,IAAI,SAAS,CAAC,YAAY,IAAI,SAAS,CAAC,SAAS,CAAC;QACrF,IAAI,CAAC,OAAO,EAAE,CAAC;YACb,OAAO,GAAG,CAAC;QACb,CAAC;QACD,iDAAiD;QACjD,MAAM,EAAE,GACN,OAAO,OAAO,KAAK,QAAQ,IAAI,OAAO,GAAG,CAAC,IAAI,OAAO,IAAI,UAAU;YACjE,CAAC,CAAC,OAAO,GAAG,IAAI;YAChB,CAAC,CAAC,OAAO,OAAO,KAAK,QAAQ;gBAC3B,CAAC,CAAC,OAAO;gBACT,CAAC,CAAC,IAAI,IAAI,CAAC,OAAO,CAAC,CAAC,OAAO,EAAE,CAAC;QACpC,MAAM,OAAO,GAAG,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC,GAAG,QAAQ,CAAC;QAC7C,IAAI,OAAO,GAAG,CAAC,EAAE,CAAC;YAChB,OAAO,GAAG,CAAC,CAAC,YAAY;QAC1B,CAAC;QACD,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,GAAG,OAAO,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,YAAY;IAC5D,CAAC;IAED,kBAAkB,CAAC,SAA0B;QAC3C,MAAM,KAAK,GAAG,SAAS,CAAC,UAAU,IAAI,CAAC,CAAC;QACxC,OAAO,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAClE,CAAC;IAED,UAAU,CAAC,KAAa;QACtB,OAAO,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;IAC3C,CAAC;CACF"}

package/dist/lib/service/search/CrossEncoderReranker.d.ts

@@ -0,0 +1,60 @@
+/**
+ * CrossEncoderReranker — AI 驱动的语义重排器
+ *
+ * 替代 Jaccard 相似度，使用 LLM 对 (query, document) 对进行语义相关性评分。
+ *
+ * 策略:
+ *   1. 将候选文档与 query 组成 pairs，批量送入 AI 评分
+ *   2. AI 返回每个 pair 的 relevance score (0.0-1.0)
+ *   3. 按 score 降序排列
+ *
+ * 优化:
+ *   - 单次 API 调用批量评分（减少延迟和成本）
+ *   - 文档截断至 MAX_DOC_LEN 控制 token 消耗
+ *   - 候选上限 MAX_CANDIDATES，超出部分保留原始顺序
+ *   - AI 不可用时自动降级到 Jaccard
+ */
+interface RerankCandidate {
+    title?: string;
+    trigger?: string;
+    description?: string;
+    summary?: string;
+    code?: string;
+    content?: string;
+    semanticScore?: number;
+    [key: string]: unknown;
+}
+export declare class CrossEncoderReranker {
+    #private;
+    /**
+     * @param {object} opts
+     * @param {import('../../external/ai/AiProvider.js').AiProvider} opts.aiProvider
+     * @param {object} [opts.logger]
+     */
+    constructor(opts?: {
+        aiProvider?: {
+            chatWithStructuredOutput: (prompt: string, opts: Record<string, unknown>) => Promise<unknown>;
+        } | null;
+        logger?: {
+            warn?: (...args: unknown[]) => void;
+        };
+    });
+    /**
+     * 对候选列表进行语义重排
+     *
+     * @param {string} query 用户查询
+     * @param {Array<object>} candidates - Layer 1 输出的候选列表
+     * @returns {Promise<Array<object>>} 附带 semanticScore 的候选列表（降序）
+     */
+    rerank(query: string, candidates: RerankCandidate[]): Promise<RerankCandidate[] | {
+        semanticScore: any;
+        title?: string;
+        trigger?: string;
+        description?: string;
+        summary?: string;
+        code?: string;
+        content?: string;
+    }[]>;
+}
+export {};
+//# sourceMappingURL=CrossEncoderReranker.d.ts.map

package/dist/lib/service/search/CrossEncoderReranker.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"CrossEncoderReranker.d.ts","sourceRoot":"","sources":["../../../../lib/service/search/CrossEncoderReranker.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;GAeG;AAKH,UAAU,eAAe;IACvB,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,aAAa,CAAC,EAAE,MAAM,CAAC;IACvB,CAAC,GAAG,EAAE,MAAM,GAAG,OAAO,CAAC;CACxB;AAKD,qBAAa,oBAAoB;;IAI/B;;;;OAIG;gBAED,IAAI,GAAE;QACJ,UAAU,CAAC,EAAE;YACX,wBAAwB,EAAE,CACxB,MAAM,EAAE,MAAM,EACd,IAAI,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,KAC1B,OAAO,CAAC,OAAO,CAAC,CAAC;SACvB,GAAG,IAAI,CAAC;QACT,MAAM,CAAC,EAAE;YAAE,IAAI,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,OAAO,EAAE,KAAK,IAAI,CAAA;SAAE,CAAC;KAC7C;IAMR;;;;;;OAMG;IACG,MAAM,CAAC,KAAK,EAAE,MAAM,EAAE,UAAU,EAAE,eAAe,EAAE;;gBA5CjD,MAAM;kBACJ,MAAM;sBACF,MAAM;kBACV,MAAM;eACT,MAAM;kBACH,MAAM;;CA+KjB"}

package/dist/lib/service/search/CrossEncoderReranker.js

@@ -0,0 +1,158 @@
+/**
+ * CrossEncoderReranker — AI 驱动的语义重排器
+ *
+ * 替代 Jaccard 相似度，使用 LLM 对 (query, document) 对进行语义相关性评分。
+ *
+ * 策略:
+ *   1. 将候选文档与 query 组成 pairs，批量送入 AI 评分
+ *   2. AI 返回每个 pair 的 relevance score (0.0-1.0)
+ *   3. 按 score 降序排列
+ *
+ * 优化:
+ *   - 单次 API 调用批量评分（减少延迟和成本）
+ *   - 文档截断至 MAX_DOC_LEN 控制 token 消耗
+ *   - 候选上限 MAX_CANDIDATES，超出部分保留原始顺序
+ *   - AI 不可用时自动降级到 Jaccard
+ */
+import { jaccardSimilarity } from '../../shared/similarity.js';
+import { tokenize } from './InvertedIndex.js';
+const MAX_CANDIDATES = 40; // 超过此数量截断（控制 prompt 大小）
+const MAX_DOC_LEN = 300; // 每个文档最大字符数
+export class CrossEncoderReranker {
+    #aiProvider;
+    #logger;
+    /**
+     * @param {object} opts
+     * @param {import('../../external/ai/AiProvider.js').AiProvider} opts.aiProvider
+     * @param {object} [opts.logger]
+     */
+    constructor(opts = {}) {
+        this.#aiProvider = opts.aiProvider || null;
+        this.#logger = opts.logger || console;
+    }
+    /**
+     * 对候选列表进行语义重排
+     *
+     * @param {string} query 用户查询
+     * @param {Array<object>} candidates - Layer 1 输出的候选列表
+     * @returns {Promise<Array<object>>} 附带 semanticScore 的候选列表（降序）
+     */
+    async rerank(query, candidates) {
+        if (!candidates || candidates.length === 0) {
+            return [];
+        }
+        if (!query) {
+            return candidates;
+        }
+        // 如果 AI Provider 不可用，降级到 Jaccard
+        if (!this.#aiProvider || typeof this.#aiProvider.chatWithStructuredOutput !== 'function') {
+            return this.#jaccardFallback(query, candidates);
+        }
+        // 截取前 MAX_CANDIDATES 个候选，剩余保持原始顺序
+        const head = candidates.slice(0, MAX_CANDIDATES);
+        const tail = candidates.slice(MAX_CANDIDATES);
+        try {
+            const scored = await this.#batchScore(query, head);
+            // tail 部分给一个递减的低分以保持稳定排序
+            const minScore = scored.length > 0
+                ? Math.min(...scored.map((s) => s.semanticScore || 0)) * 0.5
+                : 0;
+            const tailScored = tail.map((c, i) => ({
+                ...c,
+                semanticScore: Math.max(minScore - (i + 1) * 0.001, 0),
+            }));
+            return [...scored, ...tailScored];
+        }
+        catch (err) {
+            this.#logger.warn?.(`[CrossEncoderReranker] AI scoring failed, falling back to Jaccard: ${err.message}`);
+            return this.#jaccardFallback(query, candidates);
+        }
+    }
+    /**
+     * 批量 AI 评分 — 单次 chatWithStructuredOutput 调用
+     */
+    async #batchScore(query, candidates) {
+        const pairs = candidates.map((c, i) => {
+            const doc = this.#extractDocText(c);
+            return `[${i}] ${doc.substring(0, MAX_DOC_LEN)}`;
+        });
+        const prompt = `# Task
+Score the relevance of each document to the query. Return ONLY a JSON array.
+
+# Query
+${query}
+
+# Documents
+${pairs.join('\n')}
+
+# Output Format
+Return a JSON array of objects: [{"i": 0, "s": 0.85}, {"i": 1, "s": 0.3}, ...]
+- "i": document index (integer)
+- "s": relevance score (float 0.0-1.0, where 1.0 = perfectly relevant)
+
+Score guidelines:
+- 1.0: exact match or directly answers the query
+- 0.7-0.9: highly relevant, covers the main topic
+- 0.4-0.6: partially relevant, related topic
+- 0.1-0.3: tangentially related
+- 0.0: completely irrelevant
+
+Return ONLY a JSON array, no markdown or explanation.`;
+        const result = await this.#aiProvider.chatWithStructuredOutput(prompt, {
+            openChar: '[',
+            closeChar: ']',
+            temperature: 0.1,
+            maxTokens: 2048,
+        });
+        if (!Array.isArray(result)) {
+            throw new Error('AI returned non-array result');
+        }
+        // 构建 index → score 映射
+        const scoreMap = new Map();
+        for (const item of result) {
+            const idx = item.i ?? item.index;
+            const score = item.s ?? item.score ?? 0;
+            if (typeof idx === 'number' && idx >= 0 && idx < candidates.length) {
+                scoreMap.set(idx, Math.max(0, Math.min(1, score)));
+            }
+        }
+        // 合并分数，未评分的给 0
+        return candidates
+            .map((c, i) => ({
+            ...c,
+            semanticScore: scoreMap.get(i) ?? 0,
+        }))
+            .sort((a, b) => b.semanticScore - a.semanticScore);
+    }
+    /**
+     * 从候选对象提取用于评分的文本表示
+     */
+    #extractDocText(candidate) {
+        const parts = [
+            candidate.title,
+            candidate.trigger,
+            candidate.description || candidate.summary,
+            candidate.code,
+            candidate.content,
+        ].filter(Boolean);
+        return parts.join(' | ');
+    }
+    /**
+     * Jaccard 降级 — 当 AI 不可用时使用
+     */
+    #jaccardFallback(query, candidates) {
+        const queryTokens = new Set(tokenize(query));
+        if (queryTokens.size === 0) {
+            return candidates;
+        }
+        return candidates
+            .map((candidate) => {
+            const text = this.#extractDocText(candidate);
+            const docTokens = new Set(tokenize(text));
+            const score = jaccardSimilarity(queryTokens, docTokens);
+            return { ...candidate, semanticScore: score };
+        })
+            .sort((a, b) => b.semanticScore - a.semanticScore);
+    }
+}
+//# sourceMappingURL=CrossEncoderReranker.js.map

package/dist/lib/service/search/CrossEncoderReranker.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"CrossEncoderReranker.js","sourceRoot":"","sources":["../../../../lib/service/search/CrossEncoderReranker.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;GAeG;AAEH,OAAO,EAAE,iBAAiB,EAAE,MAAM,4BAA4B,CAAC;AAC/D,OAAO,EAAE,QAAQ,EAAE,MAAM,oBAAoB,CAAC;AAa9C,MAAM,cAAc,GAAG,EAAE,CAAC,CAAC,wBAAwB;AACnD,MAAM,WAAW,GAAG,GAAG,CAAC,CAAC,YAAY;AAErC,MAAM,OAAO,oBAAoB;IAC/B,WAAW,CAAC;IACZ,OAAO,CAAC;IAER;;;;OAIG;IACH,YACE,OAQI,EAAE;QAEN,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,UAAU,IAAI,IAAI,CAAC;QAC3C,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,MAAM,IAAI,OAAO,CAAC;IACxC,CAAC;IAED;;;;;;OAMG;IACH,KAAK,CAAC,MAAM,CAAC,KAAa,EAAE,UAA6B;QACvD,IAAI,CAAC,UAAU,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC3C,OAAO,EAAE,CAAC;QACZ,CAAC;QACD,IAAI,CAAC,KAAK,EAAE,CAAC;YACX,OAAO,UAAU,CAAC;QACpB,CAAC;QAED,iCAAiC;QACjC,IAAI,CAAC,IAAI,CAAC,WAAW,IAAI,OAAO,IAAI,CAAC,WAAW,CAAC,wBAAwB,KAAK,UAAU,EAAE,CAAC;YACzF,OAAO,IAAI,CAAC,gBAAgB,CAAC,KAAK,EAAE,UAAU,CAAC,CAAC;QAClD,CAAC;QAED,kCAAkC;QAClC,MAAM,IAAI,GAAG,UAAU,CAAC,KAAK,CAAC,CAAC,EAAE,cAAc,CAAC,CAAC;QACjD,MAAM,IAAI,GAAG,UAAU,CAAC,KAAK,CAAC,cAAc,CAAC,CAAC;QAE9C,IAAI,CAAC;YACH,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,WAAW,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;YACnD,yBAAyB;YACzB,MAAM,QAAQ,GACZ,MAAM,CAAC,MAAM,GAAG,CAAC;gBACf,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAkB,EAAE,EAAE,CAAC,CAAC,CAAC,aAAa,IAAI,CAAC,CAAC,CAAC,GAAG,GAAG;gBAC7E,CAAC,CAAC,CAAC,CAAC;YACR,MAAM,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAkB,EAAE,CAAS,EAAE,EAAE,CAAC,CAAC;gBAC9D,GAAG,CAAC;gBACJ,aAAa,EAAE,IAAI,CAAC,GAAG,CAAC,QAAQ,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,KAAK,EAAE,CAAC,CAAC;aACvD,CAAC,CAAC,CAAC;YACJ,OAAO,CAAC,GAAG,MAAM,EAAE,GAAG,UAAU,CAAC,CAAC;QACpC,CAAC;QAAC,OAAO,GAAY,EAAE,CAAC;YACtB,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,CACjB,sEAAuE,GAAa,CAAC,OAAO,EAAE,CAC/F,CAAC;YACF,OAAO,IAAI,CAAC,gBAAgB,CAAC,KAAK,EAAE,UAAU,CAAC,CAAC;QAClD,CAAC;IACH,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,WAAW,CAAC,KAAa,EAAE,UAA6B;QAC5D,MAAM,KAAK,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,CAAkB,EAAE,CAAS,EAAE,EAAE;YAC7D,MAAM,GAAG,GAAG,IAAI,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;YACpC,OAAO,IAAI,CAAC,KAAK,GAAG,CAAC,SAAS,CAAC,CAAC,EAAE,WAAW,CAAC,EAAE,CAAC;QACnD,CAAC,CAAC,CAAC;QAEH,MAAM,MAAM,GAAG;;;;EAIjB,KAAK;;;EAGL,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC;;;;;;;;;;;;;;sDAcoC,CAAC;QAEnD,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,WAAY,CAAC,wBAAwB,CAAC,MAAM,EAAE;YACtE,QAAQ,EAAE,GAAG;YACb,SAAS,EAAE,GAAG;YACd,WAAW,EAAE,GAAG;YAChB,SAAS,EAAE,IAAI;SAChB,CAAC,CAAC;QAEH,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC;YAC3B,MAAM,IAAI,KAAK,CAAC,8BAA8B,CAAC,CAAC;QAClD,CAAC;QAED,sBAAsB;QACtB,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAE,CAAC;QAC3B,KAAK,MAAM,IAAI,IAAI,MAAM,EAAE,CAAC;YAC1B,MAAM,GAAG,GAAG,IAAI,CAAC,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC;YACjC,MAAM,KAAK,GAAG,IAAI,CAAC,CAAC,IAAI,IAAI,CAAC,KAAK,IAAI,CAAC,CAAC;YACxC,IAAI,OAAO,GAAG,KAAK,QAAQ,IAAI,GAAG,IAAI,CAAC,IAAI,GAAG,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC;gBACnE,QAAQ,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC;YACrD,CAAC;QACH,CAAC;QAED,eAAe;QACf,OAAO,UAAU;aACd,GAAG,CAAC,CAAC,CAAkB,EAAE,CAAS,EAAE,EAAE,CAAC,CAAC;YACvC,GAAG,CAAC;YACJ,aAAa,EAAE,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC;SACpC,CAAC,CAAC;aACF,IAAI,CACH,CACE,CAA8C,EAC9C,CAA8C,EAC9C,EAAE,CAAC,CAAC,CAAC,aAAa,GAAG,CAAC,CAAC,aAAa,CACvC,CAAC;IACN,CAAC;IAED;;OAEG;IACH,eAAe,CAAC,SAA0B;QACxC,MAAM,KAAK,GAAG;YACZ,SAAS,CAAC,KAAK;YACf,SAAS,CAAC,OAAO;YACjB,SAAS,CAAC,WAAW,IAAI,SAAS,CAAC,OAAO;YAC1C,SAAS,CAAC,IAAI;YACd,SAAS,CAAC,OAAO;SAClB,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;QAClB,OAAO,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC3B,CAAC;IAED;;OAEG;IACH,gBAAgB,CAAC,KAAa,EAAE,UAA6B;QAC3D,MAAM,WAAW,GAAG,IAAI,GAAG,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC;QAC7C,IAAI,WAAW,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;YAC3B,OAAO,UAAU,CAAC;QACpB,CAAC;QAED,OAAO,UAAU;aACd,GAAG,CAAC,CAAC,SAA0B,EAAE,EAAE;YAClC,MAAM,IAAI,GAAG,IAAI,CAAC,eAAe,CAAC,SAAS,CAAC,CAAC;YAC7C,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC;YAC1C,MAAM,KAAK,GAAG,iBAAiB,CAAC,WAAW,EAAE,SAAS,CAAC,CAAC;YACxD,OAAO,EAAE,GAAG,SAAS,EAAE,aAAa,EAAE,KAAK,EAAE,CAAC;QAChD,CAAC,CAAC;aACD,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,aAAa,GAAG,CAAC,CAAC,aAAa,CAAC,CAAC;IACvD,CAAC;CACF"}

package/dist/lib/service/search/HybridRetriever.d.ts

@@ -0,0 +1,80 @@
+/**
+ * HybridRetriever — 统一混合检索 (RRF 融合)
+ *
+ * 使用 Reciprocal Rank Fusion (RRF) 融合 Dense + Sparse 搜索:
+ *   score = Σ 1/(k + rank_i)
+ *
+ * RRF 优势:
+ * - 不需要分数归一化 (不同检索器分数尺度无关)
+ * - 对异常高分 (outlier) 不敏感
+ * - 数学性质稳定 (有界, 单调)
+ * - 已被 Elasticsearch, Weaviate, Qdrant 采用为默认融合策略
+ *
+ * @module service/search/HybridRetriever
+ */
+interface RetrievalResult {
+    id?: string;
+    item?: {
+        id?: string;
+    };
+    score?: number;
+    [key: string]: unknown;
+}
+export declare class HybridRetriever {
+    #private;
+    /**
+     * @param {object} options
+     * @param {import('../../infrastructure/vector/VectorStore.js').VectorStore} options.vectorStore
+     * @param {number} [options.rrfK=60] - RRF 常数 (k), 值越大越平滑
+     * @param {number} [options.alpha=0.5] - Dense 权重 (1-alpha = Sparse 权重)
+     */
+    constructor(options?: {
+        vectorStore?: {
+            searchVector: (vector: number[], opts: {
+                topK: number;
+                filter?: unknown;
+            }) => Promise<RetrievalResult[]>;
+        } | null;
+        rrfK?: number;
+        alpha?: number;
+    });
+    /**
+     * RRF 融合搜索
+     *
+     * Dense: vectorStore 向量搜索 (HNSW or brute-force)
+     * Sparse: BM25 关键词搜索 (由外部传入结果)
+     *
+     * @param {object} params
+     * @param {Array<{ id: string, score: number, [key: string]: unknown }>} params.denseResults - 向量搜索结果
+     * @param {Array<{ id: string, score: number, [key: string]: unknown }>} params.sparseResults - 关键词搜索结果
+     * @param {number} [params.topK=10]
+     * @param {number} [params.alpha=0.5] - Dense 权重
+     * @returns {Array<{ id: string, score: number, rrfScore: number, denseRank: number, sparseRank: number, data: object }>}
+     */
+    fuse({ denseResults, sparseResults, topK, alpha, }: {
+        denseResults?: RetrievalResult[] | undefined;
+        sparseResults?: RetrievalResult[] | undefined;
+        topK?: number | undefined;
+        alpha?: number | undefined;
+    }): any[];
+    /**
+     * 完整搜索: 同时执行 Dense + Sparse 并融合
+     *
+     * @param {string} query - 查询文本
+     * @param {number[]} queryVector - 查询向量
+     * @param {object} [options]
+     * @param {number} [options.topK=10]
+     * @param {number} [options.alpha=0.5]
+     * @param {object} [options.filter]
+     * @param {function} [options.sparseSearchFn] - 外部 sparse 搜索函数 (query, limit) => results[]
+     * @returns {Promise<Array>}
+     */
+    search(query: string, queryVector: number[] | null, options?: {
+        topK?: number;
+        alpha?: number;
+        filter?: unknown;
+        sparseSearchFn?: ((query: string, limit: number) => RetrievalResult[]) | null;
+    }): Promise<any[]>;
+}
+export {};
+//# sourceMappingURL=HybridRetriever.d.ts.map

package/dist/lib/service/search/HybridRetriever.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"HybridRetriever.d.ts","sourceRoot":"","sources":["../../../../lib/service/search/HybridRetriever.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AAEH,UAAU,eAAe;IACvB,EAAE,CAAC,EAAE,MAAM,CAAC;IACZ,IAAI,CAAC,EAAE;QAAE,EAAE,CAAC,EAAE,MAAM,CAAA;KAAE,CAAC;IACvB,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,CAAC,GAAG,EAAE,MAAM,GAAG,OAAO,CAAC;CACxB;AAED,qBAAa,eAAe;;IAK1B;;;;;OAKG;gBAED,OAAO,GAAE;QACP,WAAW,CAAC,EAAE;YACZ,YAAY,EAAE,CACZ,MAAM,EAAE,MAAM,EAAE,EAChB,IAAI,EAAE;gBAAE,IAAI,EAAE,MAAM,CAAC;gBAAC,MAAM,CAAC,EAAE,OAAO,CAAA;aAAE,KACrC,OAAO,CAAC,eAAe,EAAE,CAAC,CAAC;SACjC,GAAG,IAAI,CAAC;QACT,IAAI,CAAC,EAAE,MAAM,CAAC;QACd,KAAK,CAAC,EAAE,MAAM,CAAC;KACX;IAOR;;;;;;;;;;;;OAYG;IACH,IAAI,CAAC,EACH,YAAsC,EACtC,aAAuC,EACvC,IAAS,EACT,KAAW,GACZ;;;;;KAAA;IAwDD;;;;;;;;;;;OAWG;IACG,MAAM,CACV,KAAK,EAAE,MAAM,EACb,WAAW,EAAE,MAAM,EAAE,GAAG,IAAI,EAC5B,OAAO,GAAE;QACP,IAAI,CAAC,EAAE,MAAM,CAAC;QACd,KAAK,CAAC,EAAE,MAAM,CAAC;QACf,MAAM,CAAC,EAAE,OAAO,CAAC;QACjB,cAAc,CAAC,EAAE,CAAC,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,KAAK,eAAe,EAAE,CAAC,GAAG,IAAI,CAAC;KAC1E;CAoBT"}

package/dist/lib/service/search/HybridRetriever.js

@@ -0,0 +1,123 @@
+/**
+ * HybridRetriever — 统一混合检索 (RRF 融合)
+ *
+ * 使用 Reciprocal Rank Fusion (RRF) 融合 Dense + Sparse 搜索:
+ *   score = Σ 1/(k + rank_i)
+ *
+ * RRF 优势:
+ * - 不需要分数归一化 (不同检索器分数尺度无关)
+ * - 对异常高分 (outlier) 不敏感
+ * - 数学性质稳定 (有界, 单调)
+ * - 已被 Elasticsearch, Weaviate, Qdrant 采用为默认融合策略
+ *
+ * @module service/search/HybridRetriever
+ */
+export class HybridRetriever {
+    #vectorStore;
+    #rrfK;
+    #defaultAlpha;
+    /**
+     * @param {object} options
+     * @param {import('../../infrastructure/vector/VectorStore.js').VectorStore} options.vectorStore
+     * @param {number} [options.rrfK=60] - RRF 常数 (k), 值越大越平滑
+     * @param {number} [options.alpha=0.5] - Dense 权重 (1-alpha = Sparse 权重)
+     */
+    constructor(options = {}) {
+        this.#vectorStore = options.vectorStore || null;
+        this.#rrfK = options.rrfK || 60;
+        this.#defaultAlpha = options.alpha ?? 0.5;
+    }
+    /**
+     * RRF 融合搜索
+     *
+     * Dense: vectorStore 向量搜索 (HNSW or brute-force)
+     * Sparse: BM25 关键词搜索 (由外部传入结果)
+     *
+     * @param {object} params
+     * @param {Array<{ id: string, score: number, [key: string]: unknown }>} params.denseResults - 向量搜索结果
+     * @param {Array<{ id: string, score: number, [key: string]: unknown }>} params.sparseResults - 关键词搜索结果
+     * @param {number} [params.topK=10]
+     * @param {number} [params.alpha=0.5] - Dense 权重
+     * @returns {Array<{ id: string, score: number, rrfScore: number, denseRank: number, sparseRank: number, data: object }>}
+     */
+    fuse({ denseResults = [], sparseResults = [], topK = 10, alpha = 0.5, }) {
+        const k = this.#rrfK;
+        const scores = new Map();
+        // Dense RRF 分数
+        denseResults.forEach((result, rank) => {
+            const id = result.item?.id || result.id;
+            if (!id) {
+                return;
+            }
+            const existing = scores.get(id) || {
+                id,
+                denseRank: Infinity,
+                sparseRank: Infinity,
+                rrfScore: 0,
+                data: result,
+            };
+            existing.denseRank = rank + 1;
+            existing.rrfScore += alpha * (1 / (k + rank + 1));
+            existing.data = result;
+            scores.set(id, existing);
+        });
+        // Sparse RRF 分数
+        sparseResults.forEach((result, rank) => {
+            const id = result.id;
+            if (!id) {
+                return;
+            }
+            const existing = scores.get(id) || {
+                id,
+                denseRank: Infinity,
+                sparseRank: Infinity,
+                rrfScore: 0,
+                data: result,
+            };
+            existing.sparseRank = rank + 1;
+            existing.rrfScore += (1 - alpha) * (1 / (k + rank + 1));
+            if (!existing.data || !existing.data.item) {
+                existing.data = result;
+            }
+            scores.set(id, existing);
+        });
+        // 按 RRF 分数降序排列
+        const fused = [...scores.values()].sort((a, b) => b.rrfScore - a.rrfScore).slice(0, topK);
+        // 归一化 score 到 [0, 1] 方便下游使用
+        const maxRrf = fused.length > 0 ? fused[0].rrfScore : 1;
+        for (const item of fused) {
+            item.score = maxRrf > 0 ? item.rrfScore / maxRrf : 0;
+        }
+        return fused;
+    }
+    /**
+     * 完整搜索: 同时执行 Dense + Sparse 并融合
+     *
+     * @param {string} query - 查询文本
+     * @param {number[]} queryVector - 查询向量
+     * @param {object} [options]
+     * @param {number} [options.topK=10]
+     * @param {number} [options.alpha=0.5]
+     * @param {object} [options.filter]
+     * @param {function} [options.sparseSearchFn] - 外部 sparse 搜索函数 (query, limit) => results[]
+     * @returns {Promise<Array>}
+     */
+    async search(query, queryVector, options = {}) {
+        const { topK = 10, alpha = this.#defaultAlpha, filter = null, sparseSearchFn = null } = options;
+        const expandedK = topK * 3; // 每路召回更多候选以提高融合质量
+        // 并行执行 Dense + Sparse
+        const [denseResults, sparseResults] = await Promise.all([
+            queryVector?.length && this.#vectorStore
+                ? this.#vectorStore.searchVector(queryVector, { topK: expandedK, filter })
+                : Promise.resolve([]),
+            sparseSearchFn ? Promise.resolve(sparseSearchFn(query, expandedK)) : Promise.resolve([]),
+        ]);
+        return this.fuse({
+            denseResults,
+            sparseResults,
+            topK,
+            alpha,
+        });
+    }
+}
+//# sourceMappingURL=HybridRetriever.js.map

package/dist/lib/service/search/HybridRetriever.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"HybridRetriever.js","sourceRoot":"","sources":["../../../../lib/service/search/HybridRetriever.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AASH,MAAM,OAAO,eAAe;IAC1B,YAAY,CAAC;IACb,KAAK,CAAC;IACN,aAAa,CAAC;IAEd;;;;;OAKG;IACH,YACE,UASI,EAAE;QAEN,IAAI,CAAC,YAAY,GAAG,OAAO,CAAC,WAAW,IAAI,IAAI,CAAC;QAChD,IAAI,CAAC,KAAK,GAAG,OAAO,CAAC,IAAI,IAAI,EAAE,CAAC;QAChC,IAAI,CAAC,aAAa,GAAG,OAAO,CAAC,KAAK,IAAI,GAAG,CAAC;IAC5C,CAAC;IAED;;;;;;;;;;;;OAYG;IACH,IAAI,CAAC,EACH,YAAY,GAAG,EAAuB,EACtC,aAAa,GAAG,EAAuB,EACvC,IAAI,GAAG,EAAE,EACT,KAAK,GAAG,GAAG,GACZ;QACC,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC;QACrB,MAAM,MAAM,GAAG,IAAI,GAAG,EAAE,CAAC;QAEzB,eAAe;QACf,YAAY,CAAC,OAAO,CAAC,CAAC,MAAM,EAAE,IAAI,EAAE,EAAE;YACpC,MAAM,EAAE,GAAG,MAAM,CAAC,IAAI,EAAE,EAAE,IAAI,MAAM,CAAC,EAAE,CAAC;YACxC,IAAI,CAAC,EAAE,EAAE,CAAC;gBACR,OAAO;YACT,CAAC;YACD,MAAM,QAAQ,GAAG,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI;gBACjC,EAAE;gBACF,SAAS,EAAE,QAAQ;gBACnB,UAAU,EAAE,QAAQ;gBACpB,QAAQ,EAAE,CAAC;gBACX,IAAI,EAAE,MAAM;aACb,CAAC;YACF,QAAQ,CAAC,SAAS,GAAG,IAAI,GAAG,CAAC,CAAC;YAC9B,QAAQ,CAAC,QAAQ,IAAI,KAAK,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC;YAClD,QAAQ,CAAC,IAAI,GAAG,MAAM,CAAC;YACvB,MAAM,CAAC,GAAG,CAAC,EAAE,EAAE,QAAQ,CAAC,CAAC;QAC3B,CAAC,CAAC,CAAC;QAEH,gBAAgB;QAChB,aAAa,CAAC,OAAO,CAAC,CAAC,MAAM,EAAE,IAAI,EAAE,EAAE;YACrC,MAAM,EAAE,GAAG,MAAM,CAAC,EAAE,CAAC;YACrB,IAAI,CAAC,EAAE,EAAE,CAAC;gBACR,OAAO;YACT,CAAC;YACD,MAAM,QAAQ,GAAG,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI;gBACjC,EAAE;gBACF,SAAS,EAAE,QAAQ;gBACnB,UAAU,EAAE,QAAQ;gBACpB,QAAQ,EAAE,CAAC;gBACX,IAAI,EAAE,MAAM;aACb,CAAC;YACF,QAAQ,CAAC,UAAU,GAAG,IAAI,GAAG,CAAC,CAAC;YAC/B,QAAQ,CAAC,QAAQ,IAAI,CAAC,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC;YACxD,IAAI,CAAC,QAAQ,CAAC,IAAI,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;gBAC1C,QAAQ,CAAC,IAAI,GAAG,MAAM,CAAC;YACzB,CAAC;YACD,MAAM,CAAC,GAAG,CAAC,EAAE,EAAE,QAAQ,CAAC,CAAC;QAC3B,CAAC,CAAC,CAAC;QAEH,eAAe;QACf,MAAM,KAAK,GAAG,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;QAE1F,4BAA4B;QAC5B,MAAM,MAAM,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;QACxD,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,IAAI,CAAC,KAAK,GAAG,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;QACvD,CAAC;QAED,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;;;;;;;;;;OAWG;IACH,KAAK,CAAC,MAAM,CACV,KAAa,EACb,WAA4B,EAC5B,UAKI,EAAE;QAEN,MAAM,EAAE,IAAI,GAAG,EAAE,EAAE,KAAK,GAAG,IAAI,CAAC,aAAa,EAAE,MAAM,GAAG,IAAI,EAAE,cAAc,GAAG,IAAI,EAAE,GAAG,OAAO,CAAC;QAChG,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,kBAAkB;QAE9C,sBAAsB;QACtB,MAAM,CAAC,YAAY,EAAE,aAAa,CAAC,GAAG,MAAM,OAAO,CAAC,GAAG,CAAC;YACtD,WAAW,EAAE,MAAM,IAAI,IAAI,CAAC,YAAY;gBACtC,CAAC,CAAC,IAAI,CAAC,YAAY,CAAC,YAAY,CAAC,WAAW,EAAE,EAAE,IAAI,EAAE,SAAS,EAAE,MAAM,EAAE,CAAC;gBAC1E,CAAC,CAAC,OAAO,CAAC,OAAO,CAAC,EAAE,CAAC;YACvB,cAAc,CAAC,CAAC,CAAC,OAAO,CAAC,OAAO,CAAC,cAAc,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,OAAO,CAAC,EAAE,CAAC;SACzF,CAAC,CAAC;QAEH,OAAO,IAAI,CAAC,IAAI,CAAC;YACf,YAAY;YACZ,aAAa;YACb,IAAI;YACJ,KAAK;SACN,CAAC,CAAC;IACL,CAAC;CACF"}

package/dist/lib/service/search/InvertedIndex.d.ts

@@ -0,0 +1,34 @@
+/**
+ * InvertedIndex — 倒排索引
+ * 构建和查询 token → docIndex 映射
+ */
+import { tokenize } from './SearchEngine.js';
+export { tokenize };
+/**
+ * 构建倒排索引
+ * @param {Array<{ id: string, content: string }>} documents
+ * @returns {Map<string, Set<number>>}
+ */
+export declare function buildInvertedIndex(documents: Array<{
+    id?: string;
+    title?: string;
+    trigger?: string;
+    content?: string;
+    code?: string;
+    description?: string;
+}>): Map<any, any>;
+/**
+ * 查询倒排索引（OR 语义 — 匹配任一 token）
+ * @param {Map<string, Set<number>>} invertedIndex
+ * @param {string} query
+ * @returns {number[]} - document indices
+ */
+export declare function lookup(invertedIndex: Map<string, Set<number>>, query: string): unknown[];
+/**
+ * 查询倒排索引（AND 语义 — 匹配所有 token）
+ * @param {Map<string, Set<number>>} invertedIndex
+ * @param {string} query
+ * @returns {number[]}
+ */
+export declare function lookupAll(invertedIndex: Map<string, Set<number>>, query: string): number[];
+//# sourceMappingURL=InvertedIndex.d.ts.map

package/dist/lib/service/search/InvertedIndex.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"InvertedIndex.d.ts","sourceRoot":"","sources":["../../../../lib/service/search/InvertedIndex.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAIH,OAAO,EAAE,QAAQ,EAAE,MAAM,mBAAmB,CAAC;AAC7C,OAAO,EAAE,QAAQ,EAAE,CAAC;AAEpB;;;;GAIG;AACH,wBAAgB,kBAAkB,CAChC,SAAS,EAAE,KAAK,CAAC;IACf,EAAE,CAAC,EAAE,MAAM,CAAC;IACZ,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,WAAW,CAAC,EAAE,MAAM,CAAC;CACtB,CAAC,iBAoBH;AAED;;;;;GAKG;AACH,wBAAgB,MAAM,CAAC,aAAa,EAAE,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC,EAAE,KAAK,EAAE,MAAM,aAiB5E;AAED;;;;;GAKG;AACH,wBAAgB,SAAS,CAAC,aAAa,EAAE,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC,EAAE,KAAK,EAAE,MAAM,YAwB/E"}