@chiway/contextweaver 1.4.0 → 1.5.1

package/dist/{SearchService-OS7CYHNJ.js → SearchService-WVD6THR3.js}

@@ -1,21 +1,32 @@
 import {
-  ChunkContentLoader,
+  createSearchConfigFingerprint
+} from "./chunk-IZ6IUHNN.js";
+import {
   bootstrap,
   getGraphExpander,
   getIndexer,
   scoreChunkTokenOverlap
-} from "./chunk-AB24E3Z7.js";
+} from "./chunk-XMZZZKG7.js";
+import "./chunk-LB42CZEB.js";
+import {
+  ChunkContentLoader
+} from "./chunk-XFIM2T6S.js";
 import {
   getVectorStore
-} from "./chunk-ZOMGPIU6.js";
+} from "./chunk-3BNHQV5W.js";
 import {
+  DEFAULT_CONFIG
+} from "./chunk-BFCIZ52F.js";
+import {
+  getIndexVersion,
+  incrementStat,
   initDb,
   isChunksFtsInitialized,
   isFtsInitialized,
   searchChunksFts,
   searchFilesFts,
   segmentQuery
-} from "./chunk-RGJSXUFS.js";
+} from "./chunk-PPLFJGO3.js";
 import {
   isDebugEnabled,
   logger
@@ -161,10 +172,8 @@ function sleep(ms) {
 
 // src/search/ContextPacker.ts
 var ContextPacker = class {
-  projectId;
   config;
-  constructor(projectId, config) {
-    this.projectId = projectId;
+  constructor(_projectId, config) {
     this.config = config;
   }
   /**
@@ -270,73 +279,63 @@ var ContextPacker = class {
   }
 };
 
-// src/search/config.ts
-var DEFAULT_CONFIG = {
-  // ── Recall (向量 + 词法召回) ──
-  vectorTopK: 80,
-  // Vector ANN candidates before dedup. Range: 40–200. Higher = better recall, more compute.
-  vectorTopM: 60,
-  // Vectors kept after dedup. Range: 30–100.
-  ftsTopKFiles: 20,
-  // Max files returned by FTS5 full-text search. Range: 10–50.
-  lexChunksPerFile: 2,
-  // Chunks to pull per FTS-matched file. Range: 1–5. Low keeps diversity across files.
-  lexTotalChunks: 40,
-  // Hard cap on total lexical chunks. Range: 20–80.
-  // ── RRF Fusion (向量 + 词法分数融合) ──
-  rrfK0: 20,
-  // RRF smoothing constant. Range: 10–60. Lower amplifies top ranks.
-  wVec: 0.6,
-  // Vector weight in fused score. Range: 0.3–0.8. Semantic relevance emphasis.
-  wLex: 0.4,
-  // Lexical weight in fused score. wVec + wLex should equal 1.0.
-  fusedTopM: 60,
-  // Candidates after fusion, fed into reranker. Range: 30–100.
-  // ── Rerank (精排) ──
-  rerankTopN: 10,
-  // Final top-N results after reranking. Range: 5–20.
-  maxRerankChars: 1e3,
-  // Max chars per chunk sent to reranker. Truncated beyond this. Range: 500–2000.
-  maxBreadcrumbChars: 250,
-  // Max chars for breadcrumb context in rerank input. Range: 100–500.
-  headRatio: 0.67,
-  // Ratio of head vs tail when truncating chunks. Range: 0.5–0.8.
-  // ── Expansion (上下文扩展: E1 邻居 / E2 面包屑 / E3 跨文件导入) ──
-  neighborHops: 2,
-  // E1: How many sibling chunks to expand in each direction. Range: 1–3.
-  breadcrumbExpandLimit: 3,
-  // E2: Max ancestor breadcrumbs (class/function scope). Range: 1–5.
-  importFilesPerSeed: 3,
-  // E3: Cross-file import files to resolve per seed chunk. Range: 0–5. Set to 3 to enable import-graph expansion for better cross-file context.
-  chunksPerImportFile: 3,
-  // E3: Chunks to pull from each resolved import file. Range: 1–5. Set to 3 for balanced coverage of imported symbols.
-  decayNeighbor: 0.8,
-  // Score decay per E1 hop. Range: 0.5–0.9. Higher = neighbors stay relevant longer.
-  decayBreadcrumb: 0.7,
-  // Score decay per E2 level. Range: 0.4–0.8.
-  decayImport: 0.6,
-  // Score decay for E3 import chunks. Range: 0.3–0.7. Lower than E1/E2 since cross-file is less certain.
-  decayDepth: 0.7,
-  // General depth decay multiplier. Range: 0.5–0.9.
-  // ── ContextPacker (上下文打包) ──
-  maxSegmentsPerFile: 3,
-  // Max non-contiguous segments per file in output. Range: 1–5. Prevents excessive fragmentation.
-  maxTotalChars: 48e3,
-  // Token budget expressed as chars (~12k tokens). Range: 20000–80000.
-  // ── Smart TopK (动态结果数量) ──
-  enableSmartTopK: true,
-  // Dynamically adjust result count based on score distribution.
-  smartTopScoreRatio: 0.5,
-  // Min score as ratio of top-1 score to remain included. Range: 0.3–0.7.
-  smartTopScoreDeltaAbs: 0.25,
-  // Max absolute score drop from top-1 before cutting off. Range: 0.1–0.4.
-  smartMinScore: 0.25,
-  // Hard floor: chunks below this score are always excluded. Range: 0.1–0.4.
-  smartMinK: 2,
-  // Minimum results to return regardless of scores. Range: 1–3.
-  smartMaxK: 8
-  // Maximum results when smart topK is active. Range: 5–15.
+// src/search/QueryCache.ts
+import crypto from "crypto";
+var MAX_CACHE_ENTRIES = 50;
+var LruCache = class {
+  constructor(maxSize) {
+    this.maxSize = maxSize;
+  }
+  entries = /* @__PURE__ */ new Map();
+  get(key) {
+    const value = this.entries.get(key);
+    if (value === void 0) return void 0;
+    this.entries.delete(key);
+    this.entries.set(key, value);
+    return value;
+  }
+  set(key, value) {
+    if (this.entries.has(key)) {
+      this.entries.delete(key);
+    }
+    this.entries.set(key, value);
+    if (this.entries.size > this.maxSize) {
+      const oldestKey = this.entries.keys().next().value;
+      if (oldestKey !== void 0) {
+        this.entries.delete(oldestKey);
+      }
+    }
+  }
 };
+var projectCaches = /* @__PURE__ */ new Map();
+function normalizeQuery(query) {
+  return query.trim().replace(/\s+/g, " ").toLowerCase();
+}
+function getProjectCache(projectId) {
+  let cache = projectCaches.get(projectId);
+  if (!cache) {
+    cache = new LruCache(MAX_CACHE_ENTRIES);
+    projectCaches.set(projectId, cache);
+  }
+  return cache;
+}
+function buildQueryCacheKey(input) {
+  const normalizedQuery = normalizeQuery(input.query);
+  return crypto.createHash("sha256").update(
+    JSON.stringify({
+      query: normalizedQuery,
+      projectId: input.projectId,
+      indexVersion: input.indexVersion,
+      configFingerprint: input.configFingerprint
+    })
+  ).digest("hex");
+}
+function getCachedContextPack(projectId, key) {
+  return getProjectCache(projectId).get(key);
+}
+function setCachedContextPack(projectId, key, pack) {
+  getProjectCache(projectId).set(key, pack);
+}
 
 // src/search/SearchService.ts
 var SearchService = class {
@@ -345,9 +344,11 @@ var SearchService = class {
   vectorStore = null;
   db = null;
   config;
+  configFingerprint;
   constructor(projectId, _projectPath, config) {
     this.projectId = projectId;
     this.config = { ...DEFAULT_CONFIG, ...config };
+    this.configFingerprint = createSearchConfigFingerprint(this.config);
   }
   async init() {
     const embeddingConfig = getEmbeddingConfig();
@@ -366,6 +367,18 @@ var SearchService = class {
    * 构建上下文包（用于问答/生成）
    */
   async buildContextPack(query) {
+    const db = this.db;
+    const cacheKey = buildQueryCacheKey({
+      query,
+      projectId: this.projectId,
+      indexVersion: getIndexVersion(db),
+      configFingerprint: this.configFingerprint
+    });
+    const cached = getCachedContextPack(this.projectId, cacheKey);
+    if (cached) {
+      this.recordSearchStats(db, { cacheHit: true });
+      return cached;
+    }
     const timingMs = {};
     let t0 = Date.now();
     const candidates = await this.hybridRetrieve(query);
@@ -385,7 +398,7 @@ var SearchService = class {
     const packer = new ContextPacker(this.projectId, this.config);
     const files = await packer.pack([...seeds, ...expanded], this.db);
     timingMs.pack = Date.now() - t0;
-    return {
+    const pack = {
       query,
       seeds,
       expanded,
@@ -396,6 +409,35 @@ var SearchService = class {
         timingMs
       }
     };
+    setCachedContextPack(this.projectId, cacheKey, pack);
+    this.recordSearchStats(db, { cacheHit: false, timingMs, seedCount: seeds.length });
+    return pack;
+  }
+  /**
+   * 记录搜索统计埋点（静默吞错，不影响搜索主流程）
+   *
+   * 多个计数器用事务包裹，保证一次查询要么全写要么全不写。
+   */
+  recordSearchStats(db, args) {
+    try {
+      const tx = db.transaction(() => {
+        incrementStat(db, "stats.search.total_queries");
+        if (args.cacheHit) {
+          incrementStat(db, "stats.search.cache_hits");
+          return;
+        }
+        incrementStat(db, "stats.search.compute_runs");
+        const t = args.timingMs ?? {};
+        incrementStat(db, "stats.search.sum_retrieve_ms", Math.round(t.retrieve ?? 0));
+        incrementStat(db, "stats.search.sum_rerank_ms", Math.round(t.rerank ?? 0));
+        incrementStat(db, "stats.search.sum_expand_ms", Math.round(t.expand ?? 0));
+        incrementStat(db, "stats.search.sum_pack_ms", Math.round(t.pack ?? 0));
+        incrementStat(db, "stats.search.sum_seed_count", args.seedCount ?? 0);
+      });
+      tx();
+    } catch (err) {
+      logger.debug({ error: err.message }, "\u641C\u7D22\u7EDF\u8BA1\u57CB\u70B9\u5931\u8D25");
+    }
   }
   // 召回方法
   /**

package/dist/chunk-2EVCLNYN.js

@@ -0,0 +1,223 @@
+import {
+  commonPrefixLength
+} from "./chunk-LB42CZEB.js";
+import {
+  ChunkContentLoader
+} from "./chunk-XFIM2T6S.js";
+import {
+  getVectorStore
+} from "./chunk-3BNHQV5W.js";
+import {
+  ensureIndexed,
+  formatTextResponse
+} from "./chunk-H4MGLXXF.js";
+import {
+  generateProjectId,
+  initDb,
+  searchChunksFts
+} from "./chunk-PPLFJGO3.js";
+import {
+  logger
+} from "./chunk-JVKVSTQ3.js";
+
+// src/mcp/tools/getSymbolDefinition.ts
+import { z } from "zod";
+var getSymbolDefinitionSchema = z.object({
+  repo_path: z.string().describe(
+    "The absolute file system path to the repository root. (e.g., '/Users/dev/my-project')"
+  ),
+  symbol: z.string().min(1).describe("The exact symbol name to resolve."),
+  hint_path: z.string().optional().describe("Optional preferred path used to disambiguate same-name definitions."),
+  max_results: z.number().int().positive().max(20).optional().describe("Maximum number of definitions to return. Defaults to 3.")
+});
+var LANGUAGE_DEFINITION_PATTERNS = {
+  typescript: [
+    "function\\s+{symbol}\\b",
+    "class\\s+{symbol}\\b",
+    "(?:const|let|var)\\s+{symbol}\\b",
+    "interface\\s+{symbol}\\b",
+    "type\\s+{symbol}\\b",
+    "enum\\s+{symbol}\\b"
+  ],
+  javascript: [
+    "function\\s+{symbol}\\b",
+    "class\\s+{symbol}\\b",
+    "(?:const|let|var)\\s+{symbol}\\b"
+  ],
+  python: ["def\\s+{symbol}\\b", "class\\s+{symbol}\\b"],
+  go: ["func\\s+{symbol}\\b", "type\\s+{symbol}\\b", "const\\s+{symbol}\\b", "var\\s+{symbol}\\b"],
+  rust: [
+    "fn\\s+{symbol}\\b",
+    "struct\\s+{symbol}\\b",
+    "enum\\s+{symbol}\\b",
+    "const\\s+{symbol}\\b"
+  ],
+  java: [
+    "class\\s+{symbol}\\b",
+    "interface\\s+{symbol}\\b",
+    "enum\\s+{symbol}\\b",
+    "\\b{symbol}\\s*\\("
+  ],
+  csharp: [
+    "class\\s+{symbol}\\b",
+    "interface\\s+{symbol}\\b",
+    "enum\\s+{symbol}\\b",
+    "\\b{symbol}\\s*\\("
+  ],
+  cpp: ["class\\s+{symbol}\\b", "struct\\s+{symbol}\\b", "\\b{symbol}\\s*\\("],
+  c: ["\\b{symbol}\\s*\\("]
+};
+function escapeRegex(text) {
+  return text.replace(/[.*+?^${}()|[\]\\]/g, "\\$&");
+}
+function breadcrumbTail(breadcrumb) {
+  return breadcrumb.split(">").pop()?.trim() ?? "";
+}
+function countLinesBefore(content, index) {
+  let line = 1;
+  for (let i = 0; i < index && i < content.length; i++) {
+    if (content[i] === "\n") {
+      line += 1;
+    }
+  }
+  return line;
+}
+function computeEndLine(startLine, code) {
+  const normalized = code.replace(/\n+$/u, "");
+  if (!normalized) {
+    return startLine;
+  }
+  return startLine + normalized.split("\n").length - 1;
+}
+function detectLanguage(filePath) {
+  const ext = filePath.split(".").pop()?.toLowerCase() || "";
+  const langMap = {
+    ts: "typescript",
+    tsx: "typescript",
+    js: "javascript",
+    jsx: "javascript",
+    py: "python",
+    rs: "rust",
+    go: "go",
+    java: "java",
+    c: "c",
+    cpp: "cpp",
+    h: "c",
+    hpp: "cpp",
+    cs: "csharp",
+    md: "markdown",
+    json: "json"
+  };
+  return langMap[ext] || ext || "plaintext";
+}
+function formatDefinition(candidate) {
+  const header = `## ${candidate.chunk.file_path} (L${candidate.startLine}-L${candidate.endLine})`;
+  const breadcrumb = candidate.chunk.breadcrumb ? `> ${candidate.chunk.breadcrumb}` : "";
+  const code = `\`\`\`${detectLanguage(candidate.chunk.file_path)}
+${candidate.code}
+\`\`\``;
+  return [header, breadcrumb, code].filter(Boolean).join("\n");
+}
+function hasDefinitionPattern(language, code, symbol) {
+  const patterns = LANGUAGE_DEFINITION_PATTERNS[language] ?? LANGUAGE_DEFINITION_PATTERNS.typescript;
+  return patterns.some((pattern) => {
+    const source = pattern.replaceAll("{symbol}", escapeRegex(symbol));
+    return new RegExp(source, "u").test(code);
+  });
+}
+function rankCandidates(a, b) {
+  if (a.breadcrumbExact !== b.breadcrumbExact) {
+    return a.breadcrumbExact ? -1 : 1;
+  }
+  if (a.prefixScore !== b.prefixScore) {
+    return b.prefixScore - a.prefixScore;
+  }
+  if (a.score !== b.score) {
+    return b.score - a.score;
+  }
+  return a.chunk.file_path.localeCompare(b.chunk.file_path);
+}
+async function handleGetSymbolDefinition(args, onProgress) {
+  const { repo_path, symbol, hint_path, max_results = 3 } = args;
+  const projectId = generateProjectId(repo_path);
+  logger.info({ repo_path, symbol, hint_path, max_results }, "MCP get-symbol-definition \u8C03\u7528\u5F00\u59CB");
+  await ensureIndexed(repo_path, projectId, { onProgress });
+  const db = initDb(projectId);
+  try {
+    const hits = searchChunksFts(db, symbol, Math.max(max_results * 5, 20));
+    const uniquePaths = Array.from(new Set(hits.map((hit) => hit.filePath)));
+    const vectorStore = await getVectorStore(projectId);
+    const chunkMap = await vectorStore.getFilesChunks(uniquePaths);
+    const chunkByKey = /* @__PURE__ */ new Map();
+    for (const [filePath, chunks] of chunkMap) {
+      for (const chunk of chunks) {
+        chunkByKey.set(`${filePath}#${chunk.chunk_index}`, chunk);
+      }
+    }
+    const slices = Array.from(chunkByKey.values()).map((chunk) => ({
+      filePath: chunk.file_path,
+      start_index: chunk.start_index,
+      end_index: chunk.end_index
+    }));
+    const loader = new ChunkContentLoader(db);
+    const codeMap = loader.loadMany(slices);
+    const fileContentStmt = db.prepare("SELECT content FROM files WHERE path = ?");
+    const fullFileCache = /* @__PURE__ */ new Map();
+    const candidates = /* @__PURE__ */ new Map();
+    for (const hit of hits) {
+      const chunk = chunkByKey.get(`${hit.filePath}#${hit.chunkIndex}`);
+      if (!chunk) {
+        continue;
+      }
+      const codeKey = ChunkContentLoader.key({
+        filePath: chunk.file_path,
+        start_index: chunk.start_index,
+        end_index: chunk.end_index
+      });
+      const code = codeMap.get(codeKey) ?? "";
+      if (!code) {
+        continue;
+      }
+      const breadcrumbExact = breadcrumbTail(chunk.breadcrumb) === symbol;
+      const definitionPattern = hasDefinitionPattern(chunk.language, code, symbol);
+      if (!breadcrumbExact && !definitionPattern) {
+        continue;
+      }
+      let fullContent = fullFileCache.get(chunk.file_path);
+      if (fullContent === void 0) {
+        const row = fileContentStmt.get(chunk.file_path);
+        fullContent = row?.content ?? "";
+        fullFileCache.set(chunk.file_path, fullContent);
+      }
+      const startLine = countLinesBefore(fullContent, chunk.start_index);
+      const candidate = {
+        chunk,
+        code,
+        score: hit.score,
+        breadcrumbExact,
+        prefixScore: hint_path ? commonPrefixLength(hint_path, chunk.file_path) : 0,
+        startLine,
+        endLine: computeEndLine(startLine, code)
+      };
+      const key = `${chunk.file_path}#${chunk.chunk_index}`;
+      const existing = candidates.get(key);
+      if (!existing || rankCandidates(candidate, existing) < 0) {
+        candidates.set(key, candidate);
+      }
+    }
+    const ranked = Array.from(candidates.values()).sort(rankCandidates).slice(0, max_results);
+    const body = ranked.length > 0 ? ranked.map((candidate) => formatDefinition(candidate)).join("\n\n---\n\n") : "No likely symbol definitions found.";
+    return formatTextResponse(
+      `Found ${ranked.length} symbol definitions for "${symbol}"
+
+${body}`
+    );
+  } finally {
+    db.close();
+  }
+}
+
+export {
+  getSymbolDefinitionSchema,
+  handleGetSymbolDefinition
+};

package/dist/{chunk-ZOMGPIU6.js → chunk-3BNHQV5W.js}

@@ -35,11 +35,9 @@ function sampleCheckDisplayCode(oldRows, getContent, options = {}) {
 var VectorStore = class {
   db = null;
   table = null;
-  projectId;
   dbPath;
   vectorDim;
   constructor(projectId, vectorDim = 1024, dbPathOverride) {
-    this.projectId = projectId;
     this.dbPath = dbPathOverride ?? path.join(BASE_DIR, projectId, "vectors.lance");
     this.vectorDim = vectorDim;
   }
@@ -185,9 +183,7 @@ var VectorStore = class {
         continue;
       }
       if (this.table && batch.length > 0) {
-        await this.deleteFilesByHash(
-          batch.map((f) => ({ path: f.path, hash: f.hash }))
-        );
+        await this.deleteFilesByHash(batch.map((f) => ({ path: f.path, hash: f.hash })));
       }
       if (!this.table) {
         await this.ensureTable(batchRecords);

package/dist/chunk-BFCIZ52F.js

@@ -0,0 +1,102 @@
+// src/search/config.ts
+var SEARCH_CONFIG_BOUNDS = {
+  vectorTopK: { min: 40, max: 200, integer: true },
+  vectorTopM: { min: 30, max: 100, integer: true },
+  ftsTopKFiles: { min: 10, max: 50, integer: true },
+  lexChunksPerFile: { min: 1, max: 5, integer: true },
+  lexTotalChunks: { min: 20, max: 80, integer: true },
+  rrfK0: { min: 10, max: 60, integer: true },
+  wVec: { min: 0, max: 1, integer: false },
+  wLex: { min: 0, max: 1, integer: false },
+  fusedTopM: { min: 30, max: 100, integer: true },
+  rerankTopN: { min: 5, max: 20, integer: true },
+  maxRerankChars: { min: 500, max: 2e3, integer: true },
+  maxBreadcrumbChars: { min: 100, max: 500, integer: true },
+  headRatio: { min: 0.5, max: 0.8, integer: false },
+  neighborHops: { min: 1, max: 3, integer: true },
+  breadcrumbExpandLimit: { min: 1, max: 5, integer: true },
+  importFilesPerSeed: { min: 0, max: 5, integer: true },
+  chunksPerImportFile: { min: 1, max: 5, integer: true },
+  decayNeighbor: { min: 0.5, max: 0.9, integer: false },
+  decayBreadcrumb: { min: 0.4, max: 0.8, integer: false },
+  decayImport: { min: 0.3, max: 0.7, integer: false },
+  decayDepth: { min: 0.5, max: 0.9, integer: false },
+  maxSegmentsPerFile: { min: 1, max: 5, integer: true },
+  maxTotalChars: { min: 2e4, max: 8e4, integer: true },
+  smartTopScoreRatio: { min: 0.3, max: 0.7, integer: false },
+  smartTopScoreDeltaAbs: { min: 0.1, max: 0.4, integer: false },
+  smartMinScore: { min: 0.1, max: 0.4, integer: false },
+  smartMinK: { min: 1, max: 3, integer: true },
+  smartMaxK: { min: 5, max: 15, integer: true }
+};
+var DEFAULT_CONFIG = {
+  // ── Recall (向量 + 词法召回) ──
+  vectorTopK: 80,
+  // Vector ANN candidates before dedup. Range: 40–200. Higher = better recall, more compute.
+  vectorTopM: 60,
+  // Vectors kept after dedup. Range: 30–100.
+  ftsTopKFiles: 20,
+  // Max files returned by FTS5 full-text search. Range: 10–50.
+  lexChunksPerFile: 2,
+  // Chunks to pull per FTS-matched file. Range: 1–5. Low keeps diversity across files.
+  lexTotalChunks: 40,
+  // Hard cap on total lexical chunks. Range: 20–80.
+  // ── RRF Fusion (向量 + 词法分数融合) ──
+  rrfK0: 20,
+  // RRF smoothing constant. Range: 10–60. Lower amplifies top ranks.
+  wVec: 0.6,
+  // Vector weight in fused score. Range: 0.3–0.8. Semantic relevance emphasis.
+  wLex: 0.4,
+  // Lexical weight in fused score. wVec + wLex should equal 1.0.
+  fusedTopM: 60,
+  // Candidates after fusion, fed into reranker. Range: 30–100.
+  // ── Rerank (精排) ──
+  rerankTopN: 10,
+  // Final top-N results after reranking. Range: 5–20.
+  maxRerankChars: 1e3,
+  // Max chars per chunk sent to reranker. Truncated beyond this. Range: 500–2000.
+  maxBreadcrumbChars: 250,
+  // Max chars for breadcrumb context in rerank input. Range: 100–500.
+  headRatio: 0.67,
+  // Ratio of head vs tail when truncating chunks. Range: 0.5–0.8.
+  // ── Expansion (上下文扩展: E1 邻居 / E2 面包屑 / E3 跨文件导入) ──
+  neighborHops: 2,
+  // E1: How many sibling chunks to expand in each direction. Range: 1–3.
+  breadcrumbExpandLimit: 3,
+  // E2: Max ancestor breadcrumbs (class/function scope). Range: 1–5.
+  importFilesPerSeed: 3,
+  // E3: Cross-file import files to resolve per seed chunk. Range: 0–5. Set to 3 to enable import-graph expansion for better cross-file context.
+  chunksPerImportFile: 3,
+  // E3: Chunks to pull from each resolved import file. Range: 1–5. Set to 3 for balanced coverage of imported symbols.
+  decayNeighbor: 0.8,
+  // Score decay per E1 hop. Range: 0.5–0.9. Higher = neighbors stay relevant longer.
+  decayBreadcrumb: 0.7,
+  // Score decay per E2 level. Range: 0.4–0.8.
+  decayImport: 0.6,
+  // Score decay for E3 import chunks. Range: 0.3–0.7. Lower than E1/E2 since cross-file is less certain.
+  decayDepth: 0.7,
+  // General depth decay multiplier. Range: 0.5–0.9.
+  // ── ContextPacker (上下文打包) ──
+  maxSegmentsPerFile: 3,
+  // Max non-contiguous segments per file in output. Range: 1–5. Prevents excessive fragmentation.
+  maxTotalChars: 48e3,
+  // Token budget expressed as chars (~12k tokens). Range: 20000–80000.
+  // ── Smart TopK (动态结果数量) ──
+  enableSmartTopK: true,
+  // Dynamically adjust result count based on score distribution.
+  smartTopScoreRatio: 0.5,
+  // Min score as ratio of top-1 score to remain included. Range: 0.3–0.7.
+  smartTopScoreDeltaAbs: 0.25,
+  // Max absolute score drop from top-1 before cutting off. Range: 0.1–0.4.
+  smartMinScore: 0.25,
+  // Hard floor: chunks below this score are always excluded. Range: 0.1–0.4.
+  smartMinK: 2,
+  // Minimum results to return regardless of scores. Range: 1–3.
+  smartMaxK: 8
+  // Maximum results when smart topK is active. Range: 5–15.
+};
+
+export {
+  SEARCH_CONFIG_BOUNDS,
+  DEFAULT_CONFIG
+};