thincoder 0.12.62 → 0.12.63

package/src/memory/docs.mjs

@@ -1,419 +0,0 @@
-/**
- * memory/docs.mjs — doc index sync, retrieval, agent tool generation
- */
-
-import { readFile, stat } from "node:fs/promises"
-import { isAbsolute, join } from "node:path"
-import { embed, cosine, toBlob, fromBlob } from "../embedding.mjs"
-import { scanVectors, createTopK } from "./scan.mjs"
-import { commitAndPush } from "../git/gitmem.mjs"
-import { MAX_DOC_FILE_BYTES } from "./schema.mjs"
-import { buildFtsQuery, put, search, putMarkdown, clearPersonal, EMBED_TEXT_MAX_LEN } from "./core.mjs"
-import { deleteByUid, matchMemoryRows, deleteWhere } from "./delete.mjs"
-import { _upsertDocFile, yieldTick } from "./code-index.mjs"
-import { markIndexedCommit, listProjectFiles, indexExtensions } from "./code-sync.mjs"
-import { logEvent } from "../log.mjs"
-
-const DOC_EMBED_BATCH = 64
-
-/**
- * Sync doc index: scan all .md/.mdc/.txt/.rst/.adoc under dir → chunk → upsert into doc_chunks.
- * Incremental by mtime.
- */
-export async function docSync(memory, dir, { onProgress } = {}) {
-  const { entries, unlisted } = await listProjectFiles(dir, indexExtensions(dir).doc)
-  const files = [] // { abs, rel, mtimeMs }
-  let overSizeSkipped = 0
-  for (const { abs, rel } of entries) {
-    let st
-    try { st = await stat(abs) } catch { continue }
-    if (st.size > MAX_DOC_FILE_BYTES) { overSizeSkipped++; continue }
-    files.push({ abs, rel, mtimeMs: Math.floor(st.mtimeMs) })
-  }
-
-  const indexed = new Map(
-    memory.db.prepare(`SELECT path, mtime_ms FROM doc_chunks WHERE origin = ?`).all(dir).map((r) => [r.path, r.mtime_ms])
-  )
-  const seen = new Set()
-
-  onProgress?.({ phase: "scan", total: files.length, overSizeSkipped })
-
-  let updated = 0, removed = 0, skipped = 0, failed = 0
-  const errors = []
-  for (let i = 0; i < files.length; i++) {
-    const { abs, rel, mtimeMs } = files[i]
-    seen.add(rel)
-
-    if (indexed.get(rel) === mtimeMs) {
-      skipped++
-      continue
-    }
-
-    try {
-      const text = await readFile(abs, "utf8")
-      const lines = text.split("\n")
-      _upsertDocFile(memory, dir, rel, lines, mtimeMs)
-      updated++
-    } catch (e) {
-      failed++
-      if (errors.length < 5) errors.push(`${rel}: ${e.message}`)
-    }
-    await yieldTick()
-
-    if (onProgress && i % 10 === 0) {
-      onProgress({ phase: "index", current: i + 1, total: files.length, updated, removed, skipped, failed })
-    }
-  }
-
-  for (const stale of indexed.keys()) {
-    if (!seen.has(stale)) {
-      memory.db.prepare(`DELETE FROM doc_chunks WHERE origin = ? AND path = ?`).run(dir, stale)
-      removed++
-    }
-  }
-
-  onProgress?.({ phase: "done", total: files.length, updated, removed, skipped, failed, overSizeSkipped })
-  markIndexedCommit(memory, dir)
-  if (unlisted.count > 0) {
-    logEvent("index:unlisted", { dir, kind: "doc", count: unlisted.count, exts: unlisted.exts.map((e) => e.ext) })
-  }
-  return { updated, removed, skipped, failed, errors, total: files.length, overSizeSkipped, unlistedExts: unlisted }
-}
-
-/**
- * Doc search: FTS5(BM25) + optional vector cosine, RRF merged.
- * Falls back to pure FTS when no embedder; falls back to pure vector when ftsQuery is empty and embedder is present.
- */
-export async function docSearch(memory, query, { limit = 5 } = {}) {
-  const ftsQuery = buildFtsQuery(query)
-  if (!ftsQuery && !memory.embedder) return []
-
-  const ftsOriginFilter = memory.codeOrigin ? `AND d.origin = ?` : ""
-  const vecOriginFilter = memory.codeOrigin ? `AND origin = ?` : ""
-  const originParams = memory.codeOrigin ? [memory.codeOrigin] : []
-
-  const ftsList = ftsQuery ? memory.db.prepare(`
-    SELECT d.rowid, d.path, d.language, d.heading, d.content, d.line_start, d.line_end, bm25(doc_chunks_fts) AS rank
-    FROM doc_chunks_fts JOIN doc_chunks d ON d.rowid = doc_chunks_fts.rowid
-    WHERE doc_chunks_fts MATCH ? ${ftsOriginFilter}
-    ORDER BY rank LIMIT ?
-  `).all(ftsQuery, ...originParams, Math.max(limit * 4, 20)) : []
-
-  if (!memory.embedder) return ftsList.slice(0, limit)
-
-  try { await ensureDocEmbeddings(memory) } catch (e) {
-    console.error(`[docs] embedding ensure failed, falling back to FTS-only: ${e.message}`)
-    return ftsList.slice(0, limit)
-  }
-  let qvec
-  try { [qvec] = await embed(memory.embedder, [query]) } catch (e) {
-    console.error(`[docs] query embedding failed, falling back to FTS-only: ${e.message}`)
-    return ftsList.slice(0, limit)
-  }
-  // TUI-OOM-ROOTCAUSE（MEMORY.md §10.3）：分块扫描 + 有界 top-K（原全表 .all()——峰值 = 块 + K）
-  const top = createTopK(Math.max(limit * 4, 20))
-  scanVectors(memory.db, `SELECT rowid, embedding FROM doc_chunks WHERE embedding IS NOT NULL ${vecOriginFilter}`, originParams, {
-    onRow: (r) => top.push({ id: r.rowid, rowid: r.rowid, score: cosine(qvec, fromBlob(r.embedding)) }),
-  })
-  const vecList = top.list().map((c) => ({ rowid: c.id, score: c.score }))
-
-  const K = 60
-  const scores = new Map()
-  ftsList.forEach((r, i) => scores.set(r.rowid, (scores.get(r.rowid) ?? 0) + 1 / (K + i + 1)))
-  vecList.forEach((r, i) => scores.set(r.rowid, (scores.get(r.rowid) ?? 0) + 1 / (K + i + 1)))
-
-  const fetchChunk = memory.db.prepare(`
-    SELECT path, language, heading, content, line_start, line_end FROM doc_chunks WHERE rowid = ?
-  `)
-  const sorted = [...scores.entries()]
-    .sort((a, b) => b[1] - a[1])
-    .slice(0, limit)
-  return sorted
-    .map(([rowid, score]) => {
-      const chunk = fetchChunk.get(rowid)
-      if (!chunk) return null
-      chunk._score = Math.round(score * 100) / 100
-      return chunk
-    })
-    .filter(Boolean)
-}
-
-/** Lazily backfill missing vectors for doc_chunks. Guarded against concurrent calls. */
-let _docEmbedLock = null
-export function ensureDocEmbeddings(memory) {
-  if (_docEmbedLock) return _docEmbedLock
-  _docEmbedLock = _runEnsureDocEmbeddings(memory).finally(() => { _docEmbedLock = null })
-  return _docEmbedLock
-}
-
-async function _runEnsureDocEmbeddings(memory) {
-  if (!memory.embedder) return
-  const modelKey = memory.embedder.model
-  const stored = memory.db.prepare(`SELECT value FROM meta WHERE key = 'doc_embedding_model'`).get()?.value
-  if (stored !== modelKey) {
-    memory.db.prepare(`UPDATE doc_chunks SET embedding = NULL`).run()
-    memory.db.prepare(`INSERT INTO meta (key, value) VALUES ('doc_embedding_model', ?)
-      ON CONFLICT (key) DO UPDATE SET value = excluded.value`).run(modelKey)
-  }
-
-  const pending = memory.db.prepare(`SELECT rowid, path, heading, content FROM doc_chunks WHERE embedding IS NULL LIMIT ${DOC_EMBED_BATCH}`).all()
-  if (pending.length === 0) return
-
-  const texts = pending.map((r) => `${r.heading || r.path}\n${r.content.slice(0, EMBED_TEXT_MAX_LEN)}`)
-  const vecs = await embed(memory.embedder, texts)
-
-  const update = memory.db.prepare(`UPDATE doc_chunks SET embedding = ? WHERE rowid = ?`)
-  pending.forEach((r, i) => update.run(toBlob(vecs[i]), r.rowid))
-}
-
-/** Generate the doc_search tool (read-only). */
-export function docSearchTool(memory) {
-  return {
-    name: "doc_search",
-    description:
-      "Search the project's documentation (README, design docs, guides, markdown files) for relevant information. Use this to find design decisions, coding conventions, architecture docs, or project rules. Prefer this over code_search when you need to understand the project's intended design rather than existing implementation. " +
-      "Returns matching doc chunks: path, heading, line range, relevance score, content excerpt. " +
-      "For what was said in sessions (conversation/chat history — decisions, rulings), use read_history.",
-    parameters: {
-      type: "object",
-      properties: {
-        query: { type: "string", description: "Natural language search query" },
-        limit: { type: "number", description: "Max results (default 5)" },
-      },
-      required: ["query"],
-    },
-    readonly: true,
-    async execute(args) {
-      const results = await docSearch(memory, args.query, { limit: args.limit ?? 5 })
-      if (results.length === 0) return "(no matching documentation)"
-      return results.map((r) =>
-        `${r.path}${r.heading ? ` > ${r.heading}` : ""} (L${r.line_start}-L${r.line_end}, relevance ${r._score?.toFixed(2) ?? "?"}):\n${r.content.slice(0, 2000)}`
-      ).join("\n\n---\n\n")
-    },
-  }
-}
-
-// ---------------------------------------------------------------- agent tools
-
-/** §6 shared tool surface — action enum / parameter shapes / descriptions byte-identical
- *  with thincoder-vscode/src/memory.mjs (MEMORY.md §6 D-M1/F-M6); layer VALUES per end
- *  (VS Code has no team layer and rejects it with CLI guidance). */
-const MEMORY_ACTIONS = ["search", "put", "list", "delete", "clear"]
-const MEMORY_LAYERS = ["personal", "project", "team"]
-const MEMORY_TOOL_DESCRIPTION =
-  "Manage long-term memory in ONE tool — the action parameter picks the operation:\n" +
-  "- search — find knowledge saved in previous sessions (query, optional layer/limit); result rows start with a [layer] tag and carry the entry id (id prefix = the layer)\n" +
-  "- put — save a piece of knowledge for future sessions (type: rule = coding standards, knowledge = project facts, decision = architecture decisions, pattern = debugging/workflow patterns; title/content/tags; layer defaults to personal)\n" +
-  "- list — inventory what memory holds (optional layer/type/keyword filters, limit default 50); one row per entry: [layer] id [type] title (date); a truncated list notes the full count\n" +
-  "- delete — SINGLE: {id, layer} removes the entry shown in put/search/list output — layer is optional: when passed it is validated against the id prefix (a mismatch is refused — guards against deleting the wrong entry); when omitted the id prefix routes the delete, so any id search/list returned is directly deletable. BATCH (no id): {layer, type and/or keyword} removes every matching entry in that layer — layer and at least one of type/keyword are required, plus confirm:true (without confirm it returns the count plus a preview); layer-wide wipes without filters are refused on every layer\n" +
-  "- clear — {layer: \"personal\", confirm: true} wipes ALL personal memory entries. clear is personal-only: a missing layer or a project/team layer is refused (use delete batch filters on shared layers)\n" +
-  "Layer is the memory tier: personal (private), project (shared via this repo's .thincoder/memory/), team (CLI only, git-synced). The [layer] tag on search/list result rows, the row's id prefix, and the layer parameter are the same concept — pass a result row's [layer] as layer, or omit it on a single delete to auto-route by the id prefix.\n" +
-  "Deleting project/team (CLI) entries removes the local markdown file and its index row — team deletion is local only and a later team sync may resurrect the file while the remote still has it.\n" +
-  "Save bugs, conventions, and preferences here — they persist across sessions.\n" +
-  "Session message history (what was said in this or past sessions) is NOT in memory — search session messages with read_history."
-
-function validateTypeFilter(type) {
-  if (type === undefined || type === null || type === "") return null
-  const t = String(type)
-  if (!["rule", "knowledge", "decision", "pattern"].includes(t)) throw new Error(`Invalid memory type "${t}"; expected one of: rule, knowledge, decision, pattern`)
-  return t
-}
-
-function normalizeLimit(limit, dflt) {
-  const n = Number(limit)
-  return Number.isFinite(n) && n > 0 ? Math.floor(n) : dflt
-}
-
-function fmtDate(ts) {
-  return ts ? new Date(ts).toISOString().slice(0, 10) : "?"
-}
-
-const listRowLine = (r) => `[${r.layer}] ${r.id} [${r.type}] ${r.title}（${fmtDate(r.ts)}）`
-
-/**
- * Generate the memory agent tool — ONE `memory` tool with five actions (MEMORY.md §6 D-M1).
- * search/list are read-only actions (planMode pass / no permission ask — dispatch classifies
- * them action-level, same as subagent check/status); put keeps its side-effect permission
- * gate; batch delete/clear gate on confirm:true + layer inside the tool (direct-delete
- * ruling — the confirm parameter IS the gate) and stay non-readonly like the retired tools.
- * opts: { cwd, projectDir, author, team: { dir, name } | null }
- */
-export function memoryTools(memory, opts = {}) {
-  const projectDir = opts.projectDir ? (isAbsolute(opts.projectDir) ? opts.projectDir : join(opts.cwd ?? process.cwd(), opts.projectDir)) : null
-  const dirs = { project: projectDir, team: opts.team?.dir ?? null }
-  return [
-    {
-      name: "memory",
-      description: MEMORY_TOOL_DESCRIPTION,
-      parameters: {
-        type: "object",
-        properties: {
-          action: { type: "string", enum: MEMORY_ACTIONS, description: "Operation to run (required)" },
-          layer: { type: "string", enum: MEMORY_LAYERS, description: "The memory layer: personal (private), project (shared via this repo's .thincoder/memory/), team (CLI only). Same concept as the [layer] tag and the id prefix on search/list result rows. put/search/list: optional (put defaults to personal; search/list omit = all layers). single delete: optional (omit = route by id prefix). batch delete/clear: required" },
-          type: { type: "string", enum: ["rule", "knowledge", "decision", "pattern"], description: "Entry type: put = what to save; list/delete batch = filter by type" },
-          title: { type: "string", description: "put: short title" },
-          content: { type: "string", description: "put: full content to remember" },
-          tags: { type: "string", description: "put: space-separated tags" },
-          query: { type: "string", description: "search: natural-language query" },
-          keyword: { type: "string", description: "list/delete batch: filter matching title/content" },
-          id: { type: "string", description: "delete single: the entry id from put/search/list output" },
-          limit: { type: "number", description: "Max rows: list 50 by default, search 5 by default" },
-          confirm: { type: "boolean", description: "delete batch/clear: must be true — without it the tool refuses" },
-        },
-        required: ["action"],
-      },
-      readonly: false,
-      async execute(args) {
-        const action = String(args?.action ?? "")
-        if (!MEMORY_ACTIONS.includes(action)) {
-          throw new Error(`memory: unknown action "${action}" — expected one of: ${MEMORY_ACTIONS.join("/")}`)
-        }
-        switch (action) {
-          case "search": return execSearch(memory, args)
-          case "put": return execPut(memory, args, opts, dirs)
-          case "list": return execList(memory, args, dirs)
-          case "delete": return execDelete(memory, args, dirs)
-          case "clear": return execClear(memory, args)
-        }
-      },
-    },
-  ]
-}
-
-/** action search — the retired search tool surface (read-only, same output contract). */
-async function execSearch(memory, args) {
-  const layer = args.layer
-  if (layer !== undefined && layer !== null && !MEMORY_LAYERS.includes(String(layer))) {
-    throw new Error(`memory search: invalid layer "${layer}"`)
-  }
-  const query = String(args.query ?? "").trim()
-  if (!query) return "(no matching memories)" // 空 query 短路——两端同语义（评审 code review #4）
-  const limit = normalizeLimit(args.limit, 5)
-  let results
-  if (!layer) {
-    results = await search(memory, query, { limit })
-  } else {
-    // layer filter: oversample then slice the requested layer (results keep global rank order).
-    // 窗口 = max(limit*4, 20) 是召回上限——大库 + 高 limit 时该层结果可能不足 limit（接受的取舍——评审 code review #3）
-    const wide = await search(memory, query, { limit: Math.max(limit * 4, 20) })
-    results = wide.filter((r) => r.layer === String(layer)).slice(0, limit)
-  }
-  if (results.length === 0) return "(no matching memories)"
-  return results.map((r) => `[${r.layer}][${r.type}] ${r.title} (id=${r.id})\n${r.content}`).join("\n\n")
-}
-
-/** action put — the retired put tool surface (side-effect gate, unchanged semantics). */
-async function execPut(memory, args, opts, dirs) {
-  const layer = String(args.layer ?? "personal")
-  if (!MEMORY_LAYERS.includes(layer)) throw new Error(`memory put: invalid layer "${layer}"`)
-  if (layer === "personal") {
-    const id = await put(memory, { type: args.type, title: args.title, content: args.content, tags: args.tags ?? "" })
-    return `Saved to personal memory (id=personal:${id}): [${args.type}] ${args.title}`
-  }
-  if (layer === "project") {
-    if (!dirs.project) throw new Error("project layer unavailable: no project directory configured")
-    const filename = await putMarkdown(memory, {
-      layer: "project",
-      dir: dirs.project,
-      type: args.type,
-      title: args.title,
-      content: args.content,
-      tags: (args.tags ?? "").split(/\s+/).filter(Boolean),
-      author: opts.author ?? "unknown",
-    })
-    return `Saved to project memory (id=project:${dirs.project}:${filename}): [${args.type}] ${args.title}`
-  }
-  if (!dirs.team) {
-    throw new Error("team layer not configured: set memory.team in ~/.thincoder/config.json")
-  }
-  const filename = await putMarkdown(memory, {
-    layer: "team",
-    dir: dirs.team,
-    type: args.type,
-    title: args.title,
-    content: args.content,
-    tags: (args.tags ?? "").split(/\s+/).filter(Boolean),
-    author: opts.author ?? "unknown",
-  })
-  await commitAndPush(dirs.team, filename, `memory: [${args.type}] ${args.title}`)
-  return `Saved to team memory and pushed (id=team:${dirs.team}:${filename}): [${args.type}] ${args.title}`
-}
-
-/** action list — new inventory action (read-only): layer/type/keyword filters + limit truncation note. */
-async function execList(memory, args, dirs) {
-  const layer = args.layer ?? null
-  if (layer && !MEMORY_LAYERS.includes(String(layer))) throw new Error(`memory list: invalid layer "${layer}"`)
-  const rows = await matchMemoryRows(memory, {
-    layer: layer ? String(layer) : null,
-    type: validateTypeFilter(args.type),
-    keyword: args.keyword ? String(args.keyword).trim() : null,
-    projectDir: dirs.project,
-    teamDir: dirs.team,
-  })
-  if (rows.length === 0) return "0 条匹配"
-  const limit = normalizeLimit(args.limit, 50)
-  const shown = rows.slice(0, limit)
-  const lines = shown.map(listRowLine)
-  if (rows.length > shown.length) lines.unshift(`${shown.length} 条——截断前 ${rows.length}`)
-  return lines.join("\n")
-}
-
-/** action delete — single ({ id, layer? } — MEMORY.md §6.2: layer OPTIONAL, validated when
- *  passed, else the id prefix routes the delete) + batch (layer + type/keyword + confirm). */
-async function execDelete(memory, args, dirs) {
-  const hasId = args.id !== undefined && args.id !== null && String(args.id) !== ""
-  if (hasId) return execDeleteSingle(memory, args, dirs)
-  // batch form
-  const layer = args.layer
-  if (!layer) throw new Error("batch delete requires layer plus type and/or keyword filter")
-  if (!MEMORY_LAYERS.includes(String(layer))) throw new Error(`memory delete: invalid layer "${layer}"`)
-  const type = validateTypeFilter(args.type)
-  const keyword = args.keyword ? String(args.keyword).trim() : null
-  if (!type && !keyword) {
-    throw new Error("batch delete requires type and/or keyword filter — a layer-wide wipe without filters is refused (personal full wipe is the clear action)")
-  }
-  if (layer === "project" && !dirs.project) throw new Error("project layer unavailable: no project directory configured")
-  if (layer === "team" && !dirs.team) throw new Error("team layer not configured: set memory.team in ~/.thincoder/config.json")
-  const filters = { layer: String(layer), type, keyword }
-  const rows = await matchMemoryRows(memory, { ...filters, projectDir: dirs.project, teamDir: dirs.team })
-  if (rows.length === 0) return "0 条匹配"
-  if (args.confirm !== true) {
-    const lines = [rows.length > 5 ? `将删 ${rows.length} 条：前 5 条预览` : `将删 ${rows.length} 条`]
-    lines.push(...rows.slice(0, 5).map(listRowLine))
-    if (rows.length > 5) lines.push(`5 条——截断前 ${rows.length}`)
-    lines.push("confirm:true required — re-send with it to execute the deletion")
-    return lines.join("\n")
-  }
-  const n = await deleteWhere(memory, filters, { dirs })
-  return `Deleted ${n} entries in layer ${layer}`
-}
-
-/** Single-entry delete — MEMORY.md §6.2: layer is OPTIONAL. When passed it is validated
- *  against the id prefix (mismatch refused — guards against deleting the wrong entry); when
- *  omitted the delete routes by the id prefix alone, so any id search/list returned is
- *  directly deletable (deleteByUid already resolves the layer from the uid prefix). */
-async function execDeleteSingle(memory, args, dirs) {
-  const uid = String(args.id)
-  const prefix = uid.split(":")[0]
-  const uidLayer = prefix === "personal" || prefix === "project" || prefix === "team" ? prefix : /^\d+$/.test(prefix) ? "personal" : null
-  if (!uidLayer) throw new Error(`invalid memory id: ${uid}`)
-  const layer = args.layer
-  if (layer !== undefined && layer !== null && String(layer) !== uidLayer) {
-    throw new Error(`id prefix ${prefix}: 与 layer ${layer} 不匹配`)
-  }
-  const entry = await deleteByUid(memory, uid, { dirs })
-  return `Deleted ${entry.id}: ${entry.title}\n${(entry.content ?? "").slice(0, 500)}`
-}
-
-/** action clear — personal-only full wipe (layer + confirm:true gates; project/team refused). */
-function execClear(memory, args) {
-  const layer = args.layer
-  if (!layer) throw new Error('clear requires layer "personal" — pass layer: "personal" plus confirm: true')
-  if (String(layer) !== "personal") {
-    if (!MEMORY_LAYERS.includes(String(layer))) throw new Error(`memory clear: invalid layer "${layer}"`)
-    throw new Error("shared layers don't support clear — use delete with type/keyword batch filters instead")
-  }
-  if (args.confirm !== true) throw new Error("clear requires confirm:true — this wipes ALL personal memory")
-  const n = clearPersonal(memory)
-  return `Cleared personal memory (${n} entries deleted)`
-}

package/src/memory/file-walk.mjs

@@ -1,109 +0,0 @@
-/**
- * memory/file-walk.mjs — filesystem walk fallback + the shared file-listing predicates.
- *
- * Why this module (PORTABILITY FR15 / P8): the index was built from `git ls-files`
- * only — on a project that is not a git repository the code and doc indexes came
- * back EMPTY, silently (the reviewer/agent then "searched" an empty index). The
- * fallback traverses the filesystem instead, and the skip predicate lives here so
- * the git path, the walk and the single-file reindex cannot drift apart against
- * each other (they were three copies before).
- */
-import { readdir } from "node:fs/promises"
-import { join } from "node:path"
-import { SKIP_DIRS } from "./schema.mjs"
-
-/** Upper guard for the walk: stop after this many matched files (runaway trees). */
-export const MAX_WALK_FILES = 20000
-
-/**
- * Shared skip predicate for project-relative paths: any SKIP_DIRS basename, or any
- * dot-prefixed segment (`.git`, `.cache`, `.thincoder`…). Accepts both separators.
- */
-export function isSkippedRelPath(rel) {
-  return String(rel ?? "")
-    .replace(/\\/g, "/")
-    .split("/")
-    .some((seg) => seg !== "" && (seg.startsWith(".") || SKIP_DIRS.has(seg)))
-}
-
-/** Lower-cased ".ext" of a path, or "" when it has no extension. */
-export function extensionOf(p) {
-  const s = String(p ?? "")
-  const base = s.slice(Math.max(s.lastIndexOf("/"), s.lastIndexOf("\\")) + 1)
-  const i = base.lastIndexOf(".")
-  return i > 0 ? base.slice(i).toLowerCase() : ""
-}
-
-/**
- * Unlisted-extension tally (PORTABILITY PO-9 — visibility): counts files the index
- * will NOT pick up because their extension is in no list, so "my .xyz files are not
- * searchable" stops being invisible. `exts` is a capped sample (the count is the
- * signal; the list is the hint).
- * @param {Set<string>} knownExts — every extension that IS indexed (code ∪ doc ∪ declared)
- */
-export function createUnlistedTally(knownExts) {
-  const counts = new Map()
-  let count = 0
-  return {
-    note(rel) {
-      const ext = extensionOf(rel)
-      if (!ext || knownExts.has(ext)) return
-      count++
-      counts.set(ext, (counts.get(ext) ?? 0) + 1)
-    },
-    result(limit = 12) {
-      const exts = [...counts.entries()]
-        .sort((a, b) => b[1] - a[1])
-        .slice(0, limit)
-        .map(([ext, n]) => ({ ext, count: n }))
-      return { count, exts }
-    },
-  }
-}
-
-/**
- * Recursive project walk — the no-git listing source. Symlinks are never followed
- * (loop/escape guard); skipped directories are pruned; only files whose extension
- * is in `exts` are returned. Hitting maxFiles is reported as `truncated`, never
- * silently dropped.
- * @param {string} dir — project root
- * @param {Set<string>} exts — extensions to keep (lower-case, leading dot)
- * @param {{maxFiles?: number, knownExts?: Set<string>|null}} [opts]
- *   knownExts → also tally files whose extension is in NO index list
- * @returns {Promise<{files: {abs: string, rel: string}[], truncated: boolean,
- *   unlisted: {count: number, exts: {ext: string, count: number}[]}}>}
- */
-export async function walkProjectFiles(dir, exts, { maxFiles = MAX_WALK_FILES, knownExts = null } = {}) {
-  const files = []
-  const tally = knownExts ? createUnlistedTally(knownExts) : null
-  let truncated = false
-  const stack = [{ abs: dir, rel: "" }]
-  while (stack.length > 0) {
-    const cur = stack.pop()
-    let entries
-    try {
-      entries = await readdir(cur.abs, { withFileTypes: true })
-    } catch { continue /* unreadable dir — skip, the walk must not fail the sync */ }
-    for (const ent of entries) {
-      const rel = cur.rel ? `${cur.rel}/${ent.name}` : ent.name
-      if (ent.isSymbolicLink()) continue // never follow symlinks
-      if (ent.isDirectory()) {
-        if (!isSkippedRelPath(rel)) stack.push({ abs: join(cur.abs, ent.name), rel })
-        continue
-      }
-      if (!ent.isFile() || isSkippedRelPath(rel)) continue
-      const ext = extensionOf(ent.name)
-      if (!ext || !exts.has(ext)) {
-        tally?.note(rel)
-        continue
-      }
-      if (files.length >= maxFiles) {
-        truncated = true
-        break
-      }
-      files.push({ abs: join(cur.abs, ent.name), rel })
-    }
-    if (truncated) break
-  }
-  return { files, truncated, unlisted: tally ? tally.result() : { count: 0, exts: [] } }
-}

package/src/memory/scan.mjs

@@ -1,95 +0,0 @@
-/**
- * memory/scan.mjs — 检索向量通道的分块扫描 + 有界 top-K（TUI-OOM-ROOTCAUSE 批——MEMORY.md §10）。
- *
- * 病灶（§10.1）：三张表的向量通道全表 `.all()` 物化后逐行 cosine + 全量排序——无 SQL LIMIT、
- * 无分块（本机 memory.db ~736MB，embedding BLOB 为体量主源）。本模块把扫描改为
- * **rowid 游标分块**（块 `SCAN_CHUNK_ROWS`）+ **有界 top-K**（升序小顶堆——候选集
- * ≤ max(limit×4, 20) 既有口径）：峰值 = 块 + K；召回语义不变（仍全表评分，D-M1/D-M4）。
- *
- * 对外结构不变：调用方拿到的仍是 `[{id, score}]` 降序候选（RRF 融合输入）——并列分数按
- * 既有排序稳定性规则（先到先留——与「全量稳定 sort + slice(0,K)」等价）。
- *
- * 可测缝（N-M1）：`scanVectors` 接受注入的 `runChunkedQuery`（默认真实 DB 实现——
- * `AND rowid > ? ORDER BY rowid LIMIT ?`）；测试以假数据源直测块大小/top-K/等价性
- * （不建真实大表）。
- */
-
-/** 单块行数（单源——三处共用；D-M2：块内存量级 KB~MB，随维度有界）。 */
-export const SCAN_CHUNK_ROWS = 2_000
-
-/**
- * 有界 top-K（升序小顶堆）：`push({id, score})` 摊销 O(log K)；`list()` 返回降序
- * `[{id, score}]`。并列分数先到先留（与全量稳定排序一致）。
- */
-export function createTopK(k) {
-  const cap = Math.max(1, k)
-  const heap = [] // 升序小顶堆（堆顶 = 当前最差）
-  let seq = 0
-
-  /** a 比 b 更差？（分低者差；同分 → 迟到者差（seq 大）——堆顶恒为最差） */
-  const worse = (a, b) => a.score < b.score || (a.score === b.score && a.seq > b.seq)
-  /** a 严格优于 b？（同分不互优——先到先留） */
-  const strictlyBetter = (a, b) => a.score > b.score || (a.score === b.score && a.seq < b.seq)
-  const siftUp = (i) => {
-    while (i > 0) {
-      const p = (i - 1) >> 1
-      if (worse(heap[i], heap[p])) { const t = heap[i]; heap[i] = heap[p]; heap[p] = t; i = p; continue }
-      break
-    }
-  }
-  const siftDown = (i) => {
-    for (;;) {
-      const l = i * 2 + 1
-      const r = l + 1
-      let worst = i
-      if (l < heap.length && worse(heap[l], heap[worst])) worst = l
-      if (r < heap.length && worse(heap[r], heap[worst])) worst = r
-      if (worst === i) break
-      const t = heap[i]; heap[i] = heap[worst]; heap[worst] = t
-      i = worst
-    }
-  }
-
-  return {
-    get size() { return heap.length },
-    push(item) {
-      const node = { id: item.id, score: item.score, seq: seq++ }
-      if (heap.length < cap) { heap.push(node); siftUp(heap.length - 1); return true }
-      if (!strictlyBetter(node, heap[0])) return false // 不优于当前最差（含同分迟到）→ 丢弃（先到先留）
-      heap[0] = node
-      siftDown(0)
-      return true
-    },
-    /** 降序 [{id, score}]（K 上限——与「全量 sort desc + slice(0,K)」逐条等价）。 */
-    list() {
-      return [...heap]
-        .sort((a, b) => (b.score - a.score) || (a.seq - b.seq))
-        .map((n) => ({ id: n.id, score: n.score }))
-    },
-  }
-}
-
-/**
- * 分块扫描（rowid 游标）：逐块物化 → 逐行 `onRow` → 块内存随迭代释放。
- * @param {object} db  sqlite 句柄（`.prepare(sql).all(...params)`）
- * @param {string} sql 单表查询（须含 `rowid` 列；不含 LIMIT）
- * @param {Array}  params 绑定参数（`?` 占位——顺序与 SQL 一致）
- * @param {object} opts `{ chunk = SCAN_CHUNK_ROWS, onRow, runChunkedQuery }`
- * @returns {number} 扫描到的行数
- */
-export function scanVectors(db, sql, params = [], { chunk = SCAN_CHUNK_ROWS, onRow = null, runChunkedQuery = null } = {}) {
-  const run = runChunkedQuery ?? ((after, take) =>
-    db.prepare(`${sql} AND rowid > ? ORDER BY rowid LIMIT ?`).all(...params, after, take))
-  let after = 0
-  let total = 0
-  for (;;) {
-    const rows = run(after, chunk) ?? []
-    if (rows.length === 0) break
-    for (const r of rows) { total++; onRow?.(r) }
-    const next = rows[rows.length - 1]?.rowid
-    if (next === undefined || next === null || !(next > after)) break // 防御：游标不前进即止（不空转）
-    after = next
-    if (rows.length < chunk) break // 尾块
-  }
-  return total
-}