@hivelore/embeddings 0.42.1 → 0.44.0

package/dist/index.js

@@ -9,6 +9,8 @@ async function loadPipeline(model) {
   const { pipeline, env } = await import("@xenova/transformers");
   env.allowLocalModels = true;
   env.allowRemoteModels = true;
+  const configuredCache = process.env["HIVELORE_MODEL_CACHE"]?.trim();
+  if (configuredCache) env.cacheDir = configuredCache;
   const pipe = await pipeline("feature-extraction", model);
   cachedPipeline = pipe;
   cachedModel = model;

package/dist/index.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../src/embedder.ts","../src/index-cache.ts","../src/indexer.ts","../src/search.ts","../src/code-index-cache.ts","../src/code-indexer.ts","../src/code-search.ts"],"sourcesContent":["export const DEFAULT_MODEL = \"Xenova/bge-small-en-v1.5\";\nexport const DEFAULT_DIMENSION = 384;\n\nexport interface EmbedderLike {\n  readonly model: string;\n  readonly dimension: number;\n  encode(text: string): Promise<Float32Array>;\n}\n\ninterface FeatureExtractionPipeline {\n  (text: string | string[], options: { pooling: \"mean\"; normalize: boolean }): Promise<{\n    data: Float32Array | number[];\n    dims: number[];\n  }>;\n}\n\nlet cachedPipeline: FeatureExtractionPipeline | null = null;\nlet cachedModel: string | null = null;\nconst cachedEmbedders = new Map<string, Embedder>();\n\nasync function loadPipeline(model: string): Promise<FeatureExtractionPipeline> {\n  if (cachedPipeline && cachedModel === model) return cachedPipeline;\n  const { pipeline, env } = await import(\"@xenova/transformers\");\n  // Allow remote model download by default; users can pre-cache for offline use.\n  env.allowLocalModels = true;\n  env.allowRemoteModels = true;\n  const pipe = (await pipeline(\"feature-extraction\", model)) as unknown as FeatureExtractionPipeline;\n  cachedPipeline = pipe;\n  cachedModel = model;\n  return pipe;\n}\n\nexport class Embedder implements EmbedderLike {\n  private constructor(\n    private readonly pipe: FeatureExtractionPipeline,\n    public readonly model: string,\n    public readonly dimension: number,\n  ) {}\n\n  static async create(model: string = DEFAULT_MODEL): Promise<Embedder> {\n    // Reuse the fully-initialized embedder per model: the pipeline is already cached, but each\n    // create() otherwise runs a \"dimension probe\" inference — wasteful when an agent issues several\n    // code_search / semantic-search calls in one session. Caching the instance makes calls 2..N free.\n    const cached = cachedEmbedders.get(model);\n    if (cached) return cached;\n    const pipe = await loadPipeline(model);\n    const probe = await pipe(\"dimension probe\", { pooling: \"mean\", normalize: true });\n    const dim = probe.data instanceof Float32Array ? probe.data.length : probe.data.length;\n    const embedder = new Embedder(pipe, model, dim);\n    cachedEmbedders.set(model, embedder);\n    return embedder;\n  }\n\n  async encode(text: string): Promise<Float32Array> {\n    const result = await this.pipe(text, { pooling: \"mean\", normalize: true });\n    return result.data instanceof Float32Array\n      ? result.data\n      : Float32Array.from(result.data);\n  }\n\n  async encodeMany(texts: string[]): Promise<Float32Array[]> {\n    const out: Float32Array[] = [];\n    for (const t of texts) {\n      out.push(await this.encode(t));\n    }\n    return out;\n  }\n}\n\nexport function cosine(a: Float32Array | number[], b: Float32Array | number[]): number {\n  if (a.length !== b.length) {\n    throw new Error(`vector dimension mismatch: ${a.length} vs ${b.length}`);\n  }\n  let dot = 0;\n  let na = 0;\n  let nb = 0;\n  for (let i = 0; i < a.length; i++) {\n    const av = a[i] as number;\n    const bv = b[i] as number;\n    dot += av * bv;\n    na += av * av;\n    nb += bv * bv;\n  }\n  if (na === 0 || nb === 0) return 0;\n  return dot / (Math.sqrt(na) * Math.sqrt(nb));\n}\n","import { createHash } from \"node:crypto\";\nimport { mkdir, readFile, stat, writeFile } from \"node:fs/promises\";\nimport { existsSync } from \"node:fs\";\nimport path from \"node:path\";\nimport type { HaivePaths } from \"@hivelore/core\";\nimport { DEFAULT_DIMENSION, DEFAULT_MODEL } from \"./embedder.js\";\n\nexport const INDEX_FILE = \"embeddings-index.json\";\n\nexport interface EmbeddingEntry {\n  id: string;\n  file_path: string;\n  hash: string;\n  vector: number[];\n}\n\nexport interface EmbeddingIndex {\n  model: string;\n  dimension: number;\n  updated_at: string;\n  entries: EmbeddingEntry[];\n}\n\nexport function cacheDir(paths: HaivePaths): string {\n  return path.join(paths.haiveDir, \".cache\", \"embeddings\");\n}\n\nexport function indexPath(paths: HaivePaths): string {\n  return path.join(cacheDir(paths), INDEX_FILE);\n}\n\nexport function hashContent(text: string): string {\n  return createHash(\"sha256\").update(text).digest(\"hex\");\n}\n\nexport function emptyIndex(model = DEFAULT_MODEL, dimension = DEFAULT_DIMENSION): EmbeddingIndex {\n  return {\n    model,\n    dimension,\n    updated_at: new Date().toISOString(),\n    entries: [],\n  };\n}\n\nexport async function loadIndex(paths: HaivePaths): Promise<EmbeddingIndex | null> {\n  const file = indexPath(paths);\n  if (!existsSync(file)) return null;\n  const raw = await readFile(file, \"utf8\");\n  return JSON.parse(raw) as EmbeddingIndex;\n}\n\nexport async function saveIndex(paths: HaivePaths, index: EmbeddingIndex): Promise<void> {\n  const dir = cacheDir(paths);\n  await mkdir(dir, { recursive: true });\n  index.updated_at = new Date().toISOString();\n  await writeFile(indexPath(paths), JSON.stringify(index, null, 2), \"utf8\");\n}\n\nexport async function indexStat(paths: HaivePaths): Promise<{\n  exists: boolean;\n  count: number;\n  model: string | null;\n  updatedAt: string | null;\n  sizeBytes: number;\n}> {\n  const file = indexPath(paths);\n  if (!existsSync(file)) {\n    return { exists: false, count: 0, model: null, updatedAt: null, sizeBytes: 0 };\n  }\n  const idx = await loadIndex(paths);\n  const st = await stat(file);\n  return {\n    exists: true,\n    count: idx?.entries.length ?? 0,\n    model: idx?.model ?? null,\n    updatedAt: idx?.updated_at ?? null,\n    sizeBytes: st.size,\n  };\n}\n\nexport function buildEntryText(id: string, tags: string[], body: string): string {\n  // Concatenate id + tags + body so search works on metadata too.\n  // Tags are weighted by repetition so they contribute more to the embedding.\n  const tagPart = tags.length ? `${tags.join(\" \")} ${tags.join(\" \")} ` : \"\";\n  return `${id} ${tagPart}${body}`;\n}\n","import { loadMemoriesFromDir, type HaivePaths } from \"@hivelore/core\";\nimport type { EmbedderLike } from \"./embedder.js\";\nimport {\n  buildEntryText,\n  emptyIndex,\n  hashContent,\n  loadIndex,\n  saveIndex,\n  type EmbeddingEntry,\n  type EmbeddingIndex,\n} from \"./index-cache.js\";\n\nexport interface IndexUpdateReport {\n  total: number;\n  added: number;\n  updated: number;\n  unchanged: number;\n  removed: number;\n}\n\nexport async function rebuildIndex(\n  paths: HaivePaths,\n  embedder: EmbedderLike,\n): Promise<{ index: EmbeddingIndex; report: IndexUpdateReport }> {\n  const existing = (await loadIndex(paths)) ?? emptyIndex(embedder.model, embedder.dimension);\n  // If model changed, reset.\n  if (existing.model !== embedder.model || existing.dimension !== embedder.dimension) {\n    existing.entries = [];\n    existing.model = embedder.model;\n    existing.dimension = embedder.dimension;\n  }\n\n  const memories = await loadMemoriesFromDir(paths.memoriesDir);\n  const byId = new Map(existing.entries.map((e) => [e.id, e]));\n  const seenIds = new Set<string>();\n\n  let added = 0;\n  let updated = 0;\n  let unchanged = 0;\n\n  const nextEntries: EmbeddingEntry[] = [];\n\n  for (const { memory, filePath } of memories) {\n    const id = memory.frontmatter.id;\n    seenIds.add(id);\n    const text = buildEntryText(id, memory.frontmatter.tags, memory.body);\n    const hash = hashContent(text);\n    const prior = byId.get(id);\n\n    if (prior && prior.hash === hash) {\n      nextEntries.push({ ...prior, file_path: filePath });\n      unchanged++;\n      continue;\n    }\n\n    const vector = Array.from(await embedder.encode(text));\n    nextEntries.push({ id, file_path: filePath, hash, vector });\n    if (prior) {\n      updated++;\n    } else {\n      added++;\n    }\n  }\n\n  const removed = existing.entries.filter((e) => !seenIds.has(e.id)).length;\n  existing.entries = nextEntries;\n  await saveIndex(paths, existing);\n\n  return {\n    index: existing,\n    report: {\n      total: nextEntries.length,\n      added,\n      updated,\n      unchanged,\n      removed,\n    },\n  };\n}\n","import type { HaivePaths } from \"@hivelore/core\";\nimport { cosine, Embedder, type EmbedderLike } from \"./embedder.js\";\nimport { loadIndex, type EmbeddingIndex } from \"./index-cache.js\";\n\nexport interface SemanticHit {\n  id: string;\n  file_path: string;\n  score: number;\n}\n\nexport async function semanticSearch(\n  paths: HaivePaths,\n  query: string,\n  options: {\n    limit?: number;\n    minScore?: number;\n    embedder?: EmbedderLike;\n    index?: EmbeddingIndex;\n  } = {},\n): Promise<{ hits: SemanticHit[]; index: EmbeddingIndex } | null> {\n  const index = options.index ?? (await loadIndex(paths));\n  if (!index || index.entries.length === 0) return null;\n\n  const embedder = options.embedder ?? (await Embedder.create(index.model));\n  if (embedder.dimension !== index.dimension) {\n    throw new Error(\n      `Embedder dimension (${embedder.dimension}) differs from index (${index.dimension}). Re-run \\`hivelore embeddings index\\`.`,\n    );\n  }\n\n  const queryVec = await embedder.encode(query);\n  const minScore = options.minScore ?? 0;\n  const limit = options.limit ?? 10;\n\n  const scored = index.entries\n    .map((e) => ({ id: e.id, file_path: e.file_path, score: cosine(queryVec, e.vector) }))\n    .filter((h) => h.score >= minScore)\n    .sort((a, b) => b.score - a.score)\n    .slice(0, limit);\n\n  return { hits: scored, index };\n}\n","import { mkdir, readFile, writeFile } from \"node:fs/promises\";\nimport { existsSync } from \"node:fs\";\nimport path from \"node:path\";\nimport type { HaivePaths } from \"@hivelore/core\";\nimport { DEFAULT_DIMENSION, DEFAULT_MODEL } from \"./embedder.js\";\nimport { cacheDir } from \"./index-cache.js\";\n\nexport const CODE_INDEX_FILE = \"code-embeddings-index.json\";\n\nexport interface CodeEmbeddingEntry {\n  /** stable id: `${file}#${name}` */\n  id: string;\n  file: string;\n  name: string;\n  kind: string;\n  line: number;\n  description?: string;\n  hash: string;\n  vector: number[];\n}\n\nexport interface CodeEmbeddingIndex {\n  model: string;\n  dimension: number;\n  updated_at: string;\n  source_generated_at: string;\n  entries: CodeEmbeddingEntry[];\n}\n\nexport function codeIndexPath(paths: HaivePaths): string {\n  return path.join(cacheDir(paths), CODE_INDEX_FILE);\n}\n\n/**\n * Is the code-search embeddings index stale relative to the current code-map?\n * The indexer stamps `source_generated_at` with the code-map's `generated_at` it was built from,\n * so a mismatch means the code-map was rebuilt afterwards and the index may miss or mislocate symbols.\n * Unknown timestamps (empty strings) are treated as not-stale to avoid false alarms.\n */\nexport function isCodeIndexStale(indexSourceGeneratedAt: string, codeMapGeneratedAt: string): boolean {\n  if (!indexSourceGeneratedAt || !codeMapGeneratedAt) return false;\n  return indexSourceGeneratedAt !== codeMapGeneratedAt;\n}\n\nexport function emptyCodeIndex(\n  model = DEFAULT_MODEL,\n  dimension = DEFAULT_DIMENSION,\n  sourceGeneratedAt = \"\",\n): CodeEmbeddingIndex {\n  return {\n    model,\n    dimension,\n    updated_at: new Date().toISOString(),\n    source_generated_at: sourceGeneratedAt,\n    entries: [],\n  };\n}\n\nexport async function loadCodeIndex(paths: HaivePaths): Promise<CodeEmbeddingIndex | null> {\n  const file = codeIndexPath(paths);\n  if (!existsSync(file)) return null;\n  return JSON.parse(await readFile(file, \"utf8\")) as CodeEmbeddingIndex;\n}\n\nexport async function saveCodeIndex(paths: HaivePaths, index: CodeEmbeddingIndex): Promise<void> {\n  const dir = cacheDir(paths);\n  await mkdir(dir, { recursive: true });\n  index.updated_at = new Date().toISOString();\n  await writeFile(codeIndexPath(paths), JSON.stringify(index, null, 2), \"utf8\");\n}\n\nexport function buildCodeEntryText(file: string, name: string, kind: string, description?: string): string {\n  // The embedded text is what we search against — keep it tight and signal-dense.\n  // Filename tokens often carry intent (e.g. \"auth.controller.ts\" → \"auth controller\").\n  const filenameHints = file\n    .split(\"/\")\n    .pop()\n    ?.replace(/\\.[^.]+$/, \"\")\n    .replace(/[._-]+/g, \" \") ?? \"\";\n  return `${name} ${kind} ${filenameHints} ${description ?? \"\"}`.trim();\n}\n","import { loadCodeMap, type HaivePaths } from \"@hivelore/core\";\nimport { createHash } from \"node:crypto\";\nimport type { EmbedderLike } from \"./embedder.js\";\nimport {\n  buildCodeEntryText,\n  emptyCodeIndex,\n  loadCodeIndex,\n  saveCodeIndex,\n  type CodeEmbeddingEntry,\n  type CodeEmbeddingIndex,\n} from \"./code-index-cache.js\";\n\nexport interface CodeIndexUpdateReport {\n  total: number;\n  added: number;\n  updated: number;\n  unchanged: number;\n  removed: number;\n}\n\nfunction hashEntry(text: string): string {\n  return createHash(\"sha256\").update(text).digest(\"hex\").slice(0, 32);\n}\n\n/**\n * Build (or refresh) the code semantic-search index from the code-map.\n * Each exported symbol becomes one embedding entry — granularity stays at the\n * symbol level so search returns a precise file:line:name target.\n *\n * Re-uses entries whose embedded text is unchanged (hash check) so subsequent\n * builds only embed the diff.\n */\nexport async function rebuildCodeIndex(\n  paths: HaivePaths,\n  embedder: EmbedderLike,\n): Promise<{ index: CodeEmbeddingIndex; report: CodeIndexUpdateReport }> {\n  const codeMap = await loadCodeMap(paths);\n  if (!codeMap) {\n    throw new Error(\n      \"No code-map found. Run `hivelore index code` to generate `.ai/code-map.json` first.\",\n    );\n  }\n\n  const existing =\n    (await loadCodeIndex(paths)) ??\n    emptyCodeIndex(embedder.model, embedder.dimension, codeMap.generated_at);\n\n  if (existing.model !== embedder.model || existing.dimension !== embedder.dimension) {\n    existing.entries = [];\n    existing.model = embedder.model;\n    existing.dimension = embedder.dimension;\n  }\n\n  const byId = new Map(existing.entries.map((e) => [e.id, e]));\n  const nextEntries: CodeEmbeddingEntry[] = [];\n  const seenIds = new Set<string>();\n  let added = 0;\n  let updated = 0;\n  let unchanged = 0;\n\n  for (const [filePath, fileEntry] of Object.entries(codeMap.files)) {\n    for (const exp of fileEntry.exports) {\n      const id = `${filePath}#${exp.name}`;\n      seenIds.add(id);\n      const text = buildCodeEntryText(filePath, exp.name, exp.kind, exp.description);\n      const hash = hashEntry(text);\n      const prior = byId.get(id);\n\n      if (prior && prior.hash === hash && prior.line === exp.line) {\n        nextEntries.push({ ...prior, file: filePath, name: exp.name, kind: exp.kind, line: exp.line, ...(exp.description ? { description: exp.description } : {}) });\n        unchanged++;\n        continue;\n      }\n\n      const vector = Array.from(await embedder.encode(text));\n      nextEntries.push({\n        id,\n        file: filePath,\n        name: exp.name,\n        kind: exp.kind,\n        line: exp.line,\n        ...(exp.description ? { description: exp.description } : {}),\n        hash,\n        vector,\n      });\n      if (prior) updated++;\n      else added++;\n    }\n  }\n\n  const removed = existing.entries.filter((e) => !seenIds.has(e.id)).length;\n  existing.entries = nextEntries;\n  existing.source_generated_at = codeMap.generated_at;\n  await saveCodeIndex(paths, existing);\n\n  return {\n    index: existing,\n    report: {\n      total: nextEntries.length,\n      added,\n      updated,\n      unchanged,\n      removed,\n    },\n  };\n}\n","import type { HaivePaths } from \"@hivelore/core\";\nimport { cosine, Embedder, type EmbedderLike } from \"./embedder.js\";\nimport { loadCodeIndex, type CodeEmbeddingIndex } from \"./code-index-cache.js\";\n\nexport interface CodeSearchHit {\n  file: string;\n  name: string;\n  kind: string;\n  line: number;\n  description?: string;\n  score: number;\n}\n\nexport async function codeSemanticSearch(\n  paths: HaivePaths,\n  query: string,\n  options: {\n    limit?: number;\n    minScore?: number;\n    embedder?: EmbedderLike;\n    index?: CodeEmbeddingIndex;\n  } = {},\n): Promise<{ hits: CodeSearchHit[]; index: CodeEmbeddingIndex } | null> {\n  const index = options.index ?? (await loadCodeIndex(paths));\n  if (!index || index.entries.length === 0) return null;\n\n  const embedder = options.embedder ?? (await Embedder.create(index.model));\n  if (embedder.dimension !== index.dimension) {\n    throw new Error(\n      `Embedder dimension (${embedder.dimension}) differs from code index (${index.dimension}). Re-run \\`hivelore index code-search\\`.`,\n    );\n  }\n\n  const queryVec = await embedder.encode(query);\n  const minScore = options.minScore ?? 0;\n  const limit = options.limit ?? 5;\n\n  const queryTokens = tokenize(query);\n  const normalizedQuery = query.trim().toLowerCase();\n\n  const scored = index.entries\n    .map((e) => {\n      const semantic = cosine(queryVec, e.vector);\n      const boost = lexicalBoost(queryTokens, normalizedQuery, e.name, e.file);\n      return {\n        file: e.file,\n        name: e.name,\n        kind: e.kind,\n        line: e.line,\n        ...(e.description ? { description: e.description } : {}),\n        // Hybrid score: semantic cosine is the base, a small deterministic lexical bonus\n        // promotes exact/partial symbol-name and filename matches above merely-similar neighbours.\n        score: Math.min(1, semantic + boost),\n        semantic,\n      };\n    })\n    // Keep min_score a pure-semantic noise floor (its documented meaning) so the lexical bonus\n    // re-ranks the relevant set without letting incidental filename tokens leak noise past the gate.\n    .filter((h) => h.semantic >= minScore)\n    .sort((a, b) => b.score - a.score || b.semantic - a.semantic || a.file.localeCompare(b.file) || a.line - b.line)\n    .slice(0, limit)\n    .map(({ semantic: _semantic, ...hit }) => hit);\n\n  return { hits: scored, index };\n}\n\n/** Split a query or symbol name into lowercase tokens, breaking on camelCase and any non-alphanumeric run. */\nfunction tokenize(text: string): string[] {\n  return text\n    .replace(/([a-z0-9])([A-Z])/g, \"$1 $2\")\n    .split(/[^a-zA-Z0-9]+/)\n    .map((t) => t.toLowerCase())\n    .filter((t) => t.length >= 2);\n}\n\n/**\n * Small additive bonus (≤ 0.30) layered on top of the semantic cosine so that exact symbol-name\n * matches outrank distant-but-similar code. Reuses only data already in the index entry — no new\n * index, model, or dependency.\n */\nfunction lexicalBoost(queryTokens: string[], normalizedQuery: string, name: string, file: string): number {\n  if (queryTokens.length === 0) return 0;\n\n  let nameComponent: number;\n  if (normalizedQuery === name.toLowerCase()) {\n    nameComponent = 0.3; // exact symbol name typed verbatim\n  } else {\n    const nameTokens = new Set(tokenize(name));\n    const matched = queryTokens.filter((t) => nameTokens.has(t)).length;\n    nameComponent = (matched / queryTokens.length) * 0.2; // proportional partial-name match\n  }\n\n  const fileTokens = new Set(tokenize(file.split(\"/\").pop() ?? \"\"));\n  const pathComponent = queryTokens.some((t) => fileTokens.has(t)) ? 0.05 : 0;\n\n  return Math.min(0.3, nameComponent + pathComponent);\n}\n"],"mappings":";AAAO,IAAM,gBAAgB;AACtB,IAAM,oBAAoB;AAejC,IAAI,iBAAmD;AACvD,IAAI,cAA6B;AACjC,IAAM,kBAAkB,oBAAI,IAAsB;AAElD,eAAe,aAAa,OAAmD;AAC7E,MAAI,kBAAkB,gBAAgB,MAAO,QAAO;AACpD,QAAM,EAAE,UAAU,IAAI,IAAI,MAAM,OAAO,sBAAsB;AAE7D,MAAI,mBAAmB;AACvB,MAAI,oBAAoB;AACxB,QAAM,OAAQ,MAAM,SAAS,sBAAsB,KAAK;AACxD,mBAAiB;AACjB,gBAAc;AACd,SAAO;AACT;AAEO,IAAM,WAAN,MAAM,UAAiC;AAAA,EACpC,YACW,MACD,OACA,WAChB;AAHiB;AACD;AACA;AAAA,EACf;AAAA,EAHgB;AAAA,EACD;AAAA,EACA;AAAA,EAGlB,aAAa,OAAO,QAAgB,eAAkC;AAIpE,UAAM,SAAS,gBAAgB,IAAI,KAAK;AACxC,QAAI,OAAQ,QAAO;AACnB,UAAM,OAAO,MAAM,aAAa,KAAK;AACrC,UAAM,QAAQ,MAAM,KAAK,mBAAmB,EAAE,SAAS,QAAQ,WAAW,KAAK,CAAC;AAChF,UAAM,MAAM,MAAM,gBAAgB,eAAe,MAAM,KAAK,SAAS,MAAM,KAAK;AAChF,UAAM,WAAW,IAAI,UAAS,MAAM,OAAO,GAAG;AAC9C,oBAAgB,IAAI,OAAO,QAAQ;AACnC,WAAO;AAAA,EACT;AAAA,EAEA,MAAM,OAAO,MAAqC;AAChD,UAAM,SAAS,MAAM,KAAK,KAAK,MAAM,EAAE,SAAS,QAAQ,WAAW,KAAK,CAAC;AACzE,WAAO,OAAO,gBAAgB,eAC1B,OAAO,OACP,aAAa,KAAK,OAAO,IAAI;AAAA,EACnC;AAAA,EAEA,MAAM,WAAW,OAA0C;AACzD,UAAM,MAAsB,CAAC;AAC7B,eAAW,KAAK,OAAO;AACrB,UAAI,KAAK,MAAM,KAAK,OAAO,CAAC,CAAC;AAAA,IAC/B;AACA,WAAO;AAAA,EACT;AACF;AAEO,SAAS,OAAO,GAA4B,GAAoC;AACrF,MAAI,EAAE,WAAW,EAAE,QAAQ;AACzB,UAAM,IAAI,MAAM,8BAA8B,EAAE,MAAM,OAAO,EAAE,MAAM,EAAE;AAAA,EACzE;AACA,MAAI,MAAM;AACV,MAAI,KAAK;AACT,MAAI,KAAK;AACT,WAAS,IAAI,GAAG,IAAI,EAAE,QAAQ,KAAK;AACjC,UAAM,KAAK,EAAE,CAAC;AACd,UAAM,KAAK,EAAE,CAAC;AACd,WAAO,KAAK;AACZ,UAAM,KAAK;AACX,UAAM,KAAK;AAAA,EACb;AACA,MAAI,OAAO,KAAK,OAAO,EAAG,QAAO;AACjC,SAAO,OAAO,KAAK,KAAK,EAAE,IAAI,KAAK,KAAK,EAAE;AAC5C;;;ACrFA,SAAS,kBAAkB;AAC3B,SAAS,OAAO,UAAU,MAAM,iBAAiB;AACjD,SAAS,kBAAkB;AAC3B,OAAO,UAAU;AAIV,IAAM,aAAa;AAgBnB,SAAS,SAAS,OAA2B;AAClD,SAAO,KAAK,KAAK,MAAM,UAAU,UAAU,YAAY;AACzD;AAEO,SAAS,UAAU,OAA2B;AACnD,SAAO,KAAK,KAAK,SAAS,KAAK,GAAG,UAAU;AAC9C;AAEO,SAAS,YAAY,MAAsB;AAChD,SAAO,WAAW,QAAQ,EAAE,OAAO,IAAI,EAAE,OAAO,KAAK;AACvD;AAEO,SAAS,WAAW,QAAQ,eAAe,YAAY,mBAAmC;AAC/F,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA,aAAY,oBAAI,KAAK,GAAE,YAAY;AAAA,IACnC,SAAS,CAAC;AAAA,EACZ;AACF;AAEA,eAAsB,UAAU,OAAmD;AACjF,QAAM,OAAO,UAAU,KAAK;AAC5B,MAAI,CAAC,WAAW,IAAI,EAAG,QAAO;AAC9B,QAAM,MAAM,MAAM,SAAS,MAAM,MAAM;AACvC,SAAO,KAAK,MAAM,GAAG;AACvB;AAEA,eAAsB,UAAU,OAAmB,OAAsC;AACvF,QAAM,MAAM,SAAS,KAAK;AAC1B,QAAM,MAAM,KAAK,EAAE,WAAW,KAAK,CAAC;AACpC,QAAM,cAAa,oBAAI,KAAK,GAAE,YAAY;AAC1C,QAAM,UAAU,UAAU,KAAK,GAAG,KAAK,UAAU,OAAO,MAAM,CAAC,GAAG,MAAM;AAC1E;AAEA,eAAsB,UAAU,OAM7B;AACD,QAAM,OAAO,UAAU,KAAK;AAC5B,MAAI,CAAC,WAAW,IAAI,GAAG;AACrB,WAAO,EAAE,QAAQ,OAAO,OAAO,GAAG,OAAO,MAAM,WAAW,MAAM,WAAW,EAAE;AAAA,EAC/E;AACA,QAAM,MAAM,MAAM,UAAU,KAAK;AACjC,QAAM,KAAK,MAAM,KAAK,IAAI;AAC1B,SAAO;AAAA,IACL,QAAQ;AAAA,IACR,OAAO,KAAK,QAAQ,UAAU;AAAA,IAC9B,OAAO,KAAK,SAAS;AAAA,IACrB,WAAW,KAAK,cAAc;AAAA,IAC9B,WAAW,GAAG;AAAA,EAChB;AACF;AAEO,SAAS,eAAe,IAAY,MAAgB,MAAsB;AAG/E,QAAM,UAAU,KAAK,SAAS,GAAG,KAAK,KAAK,GAAG,CAAC,IAAI,KAAK,KAAK,GAAG,CAAC,MAAM;AACvE,SAAO,GAAG,EAAE,IAAI,OAAO,GAAG,IAAI;AAChC;;;ACrFA,SAAS,2BAA4C;AAoBrD,eAAsB,aACpB,OACA,UAC+D;AAC/D,QAAM,WAAY,MAAM,UAAU,KAAK,KAAM,WAAW,SAAS,OAAO,SAAS,SAAS;AAE1F,MAAI,SAAS,UAAU,SAAS,SAAS,SAAS,cAAc,SAAS,WAAW;AAClF,aAAS,UAAU,CAAC;AACpB,aAAS,QAAQ,SAAS;AAC1B,aAAS,YAAY,SAAS;AAAA,EAChC;AAEA,QAAM,WAAW,MAAM,oBAAoB,MAAM,WAAW;AAC5D,QAAM,OAAO,IAAI,IAAI,SAAS,QAAQ,IAAI,CAAC,MAAM,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC;AAC3D,QAAM,UAAU,oBAAI,IAAY;AAEhC,MAAI,QAAQ;AACZ,MAAI,UAAU;AACd,MAAI,YAAY;AAEhB,QAAM,cAAgC,CAAC;AAEvC,aAAW,EAAE,QAAQ,SAAS,KAAK,UAAU;AAC3C,UAAM,KAAK,OAAO,YAAY;AAC9B,YAAQ,IAAI,EAAE;AACd,UAAM,OAAO,eAAe,IAAI,OAAO,YAAY,MAAM,OAAO,IAAI;AACpE,UAAM,OAAO,YAAY,IAAI;AAC7B,UAAM,QAAQ,KAAK,IAAI,EAAE;AAEzB,QAAI,SAAS,MAAM,SAAS,MAAM;AAChC,kBAAY,KAAK,EAAE,GAAG,OAAO,WAAW,SAAS,CAAC;AAClD;AACA;AAAA,IACF;AAEA,UAAM,SAAS,MAAM,KAAK,MAAM,SAAS,OAAO,IAAI,CAAC;AACrD,gBAAY,KAAK,EAAE,IAAI,WAAW,UAAU,MAAM,OAAO,CAAC;AAC1D,QAAI,OAAO;AACT;AAAA,IACF,OAAO;AACL;AAAA,IACF;AAAA,EACF;AAEA,QAAM,UAAU,SAAS,QAAQ,OAAO,CAAC,MAAM,CAAC,QAAQ,IAAI,EAAE,EAAE,CAAC,EAAE;AACnE,WAAS,UAAU;AACnB,QAAM,UAAU,OAAO,QAAQ;AAE/B,SAAO;AAAA,IACL,OAAO;AAAA,IACP,QAAQ;AAAA,MACN,OAAO,YAAY;AAAA,MACnB;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACF;AAAA,EACF;AACF;;;ACpEA,eAAsB,eACpB,OACA,OACA,UAKI,CAAC,GAC2D;AAChE,QAAM,QAAQ,QAAQ,SAAU,MAAM,UAAU,KAAK;AACrD,MAAI,CAAC,SAAS,MAAM,QAAQ,WAAW,EAAG,QAAO;AAEjD,QAAM,WAAW,QAAQ,YAAa,MAAM,SAAS,OAAO,MAAM,KAAK;AACvE,MAAI,SAAS,cAAc,MAAM,WAAW;AAC1C,UAAM,IAAI;AAAA,MACR,uBAAuB,SAAS,SAAS,yBAAyB,MAAM,SAAS;AAAA,IACnF;AAAA,EACF;AAEA,QAAM,WAAW,MAAM,SAAS,OAAO,KAAK;AAC5C,QAAM,WAAW,QAAQ,YAAY;AACrC,QAAM,QAAQ,QAAQ,SAAS;AAE/B,QAAM,SAAS,MAAM,QAClB,IAAI,CAAC,OAAO,EAAE,IAAI,EAAE,IAAI,WAAW,EAAE,WAAW,OAAO,OAAO,UAAU,EAAE,MAAM,EAAE,EAAE,EACpF,OAAO,CAAC,MAAM,EAAE,SAAS,QAAQ,EACjC,KAAK,CAAC,GAAG,MAAM,EAAE,QAAQ,EAAE,KAAK,EAChC,MAAM,GAAG,KAAK;AAEjB,SAAO,EAAE,MAAM,QAAQ,MAAM;AAC/B;;;ACzCA,SAAS,SAAAA,QAAO,YAAAC,WAAU,aAAAC,kBAAiB;AAC3C,SAAS,cAAAC,mBAAkB;AAC3B,OAAOC,WAAU;AAKV,IAAM,kBAAkB;AAsBxB,SAAS,cAAc,OAA2B;AACvD,SAAOC,MAAK,KAAK,SAAS,KAAK,GAAG,eAAe;AACnD;AAQO,SAAS,iBAAiB,wBAAgC,oBAAqC;AACpG,MAAI,CAAC,0BAA0B,CAAC,mBAAoB,QAAO;AAC3D,SAAO,2BAA2B;AACpC;AAEO,SAAS,eACd,QAAQ,eACR,YAAY,mBACZ,oBAAoB,IACA;AACpB,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA,aAAY,oBAAI,KAAK,GAAE,YAAY;AAAA,IACnC,qBAAqB;AAAA,IACrB,SAAS,CAAC;AAAA,EACZ;AACF;AAEA,eAAsB,cAAc,OAAuD;AACzF,QAAM,OAAO,cAAc,KAAK;AAChC,MAAI,CAACC,YAAW,IAAI,EAAG,QAAO;AAC9B,SAAO,KAAK,MAAM,MAAMC,UAAS,MAAM,MAAM,CAAC;AAChD;AAEA,eAAsB,cAAc,OAAmB,OAA0C;AAC/F,QAAM,MAAM,SAAS,KAAK;AAC1B,QAAMC,OAAM,KAAK,EAAE,WAAW,KAAK,CAAC;AACpC,QAAM,cAAa,oBAAI,KAAK,GAAE,YAAY;AAC1C,QAAMC,WAAU,cAAc,KAAK,GAAG,KAAK,UAAU,OAAO,MAAM,CAAC,GAAG,MAAM;AAC9E;AAEO,SAAS,mBAAmB,MAAc,MAAc,MAAc,aAA8B;AAGzG,QAAM,gBAAgB,KACnB,MAAM,GAAG,EACT,IAAI,GACH,QAAQ,YAAY,EAAE,EACvB,QAAQ,WAAW,GAAG,KAAK;AAC9B,SAAO,GAAG,IAAI,IAAI,IAAI,IAAI,aAAa,IAAI,eAAe,EAAE,GAAG,KAAK;AACtE;;;AChFA,SAAS,mBAAoC;AAC7C,SAAS,cAAAC,mBAAkB;AAmB3B,SAAS,UAAU,MAAsB;AACvC,SAAOC,YAAW,QAAQ,EAAE,OAAO,IAAI,EAAE,OAAO,KAAK,EAAE,MAAM,GAAG,EAAE;AACpE;AAUA,eAAsB,iBACpB,OACA,UACuE;AACvE,QAAM,UAAU,MAAM,YAAY,KAAK;AACvC,MAAI,CAAC,SAAS;AACZ,UAAM,IAAI;AAAA,MACR;AAAA,IACF;AAAA,EACF;AAEA,QAAM,WACH,MAAM,cAAc,KAAK,KAC1B,eAAe,SAAS,OAAO,SAAS,WAAW,QAAQ,YAAY;AAEzE,MAAI,SAAS,UAAU,SAAS,SAAS,SAAS,cAAc,SAAS,WAAW;AAClF,aAAS,UAAU,CAAC;AACpB,aAAS,QAAQ,SAAS;AAC1B,aAAS,YAAY,SAAS;AAAA,EAChC;AAEA,QAAM,OAAO,IAAI,IAAI,SAAS,QAAQ,IAAI,CAAC,MAAM,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC;AAC3D,QAAM,cAAoC,CAAC;AAC3C,QAAM,UAAU,oBAAI,IAAY;AAChC,MAAI,QAAQ;AACZ,MAAI,UAAU;AACd,MAAI,YAAY;AAEhB,aAAW,CAAC,UAAU,SAAS,KAAK,OAAO,QAAQ,QAAQ,KAAK,GAAG;AACjE,eAAW,OAAO,UAAU,SAAS;AACnC,YAAM,KAAK,GAAG,QAAQ,IAAI,IAAI,IAAI;AAClC,cAAQ,IAAI,EAAE;AACd,YAAM,OAAO,mBAAmB,UAAU,IAAI,MAAM,IAAI,MAAM,IAAI,WAAW;AAC7E,YAAM,OAAO,UAAU,IAAI;AAC3B,YAAM,QAAQ,KAAK,IAAI,EAAE;AAEzB,UAAI,SAAS,MAAM,SAAS,QAAQ,MAAM,SAAS,IAAI,MAAM;AAC3D,oBAAY,KAAK,EAAE,GAAG,OAAO,MAAM,UAAU,MAAM,IAAI,MAAM,MAAM,IAAI,MAAM,MAAM,IAAI,MAAM,GAAI,IAAI,cAAc,EAAE,aAAa,IAAI,YAAY,IAAI,CAAC,EAAG,CAAC;AAC3J;AACA;AAAA,MACF;AAEA,YAAM,SAAS,MAAM,KAAK,MAAM,SAAS,OAAO,IAAI,CAAC;AACrD,kBAAY,KAAK;AAAA,QACf;AAAA,QACA,MAAM;AAAA,QACN,MAAM,IAAI;AAAA,QACV,MAAM,IAAI;AAAA,QACV,MAAM,IAAI;AAAA,QACV,GAAI,IAAI,cAAc,EAAE,aAAa,IAAI,YAAY,IAAI,CAAC;AAAA,QAC1D;AAAA,QACA;AAAA,MACF,CAAC;AACD,UAAI,MAAO;AAAA,UACN;AAAA,IACP;AAAA,EACF;AAEA,QAAM,UAAU,SAAS,QAAQ,OAAO,CAAC,MAAM,CAAC,QAAQ,IAAI,EAAE,EAAE,CAAC,EAAE;AACnE,WAAS,UAAU;AACnB,WAAS,sBAAsB,QAAQ;AACvC,QAAM,cAAc,OAAO,QAAQ;AAEnC,SAAO;AAAA,IACL,OAAO;AAAA,IACP,QAAQ;AAAA,MACN,OAAO,YAAY;AAAA,MACnB;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACF;AAAA,EACF;AACF;;;AC5FA,eAAsB,mBACpB,OACA,OACA,UAKI,CAAC,GACiE;AACtE,QAAM,QAAQ,QAAQ,SAAU,MAAM,cAAc,KAAK;AACzD,MAAI,CAAC,SAAS,MAAM,QAAQ,WAAW,EAAG,QAAO;AAEjD,QAAM,WAAW,QAAQ,YAAa,MAAM,SAAS,OAAO,MAAM,KAAK;AACvE,MAAI,SAAS,cAAc,MAAM,WAAW;AAC1C,UAAM,IAAI;AAAA,MACR,uBAAuB,SAAS,SAAS,8BAA8B,MAAM,SAAS;AAAA,IACxF;AAAA,EACF;AAEA,QAAM,WAAW,MAAM,SAAS,OAAO,KAAK;AAC5C,QAAM,WAAW,QAAQ,YAAY;AACrC,QAAM,QAAQ,QAAQ,SAAS;AAE/B,QAAM,cAAc,SAAS,KAAK;AAClC,QAAM,kBAAkB,MAAM,KAAK,EAAE,YAAY;AAEjD,QAAM,SAAS,MAAM,QAClB,IAAI,CAAC,MAAM;AACV,UAAM,WAAW,OAAO,UAAU,EAAE,MAAM;AAC1C,UAAM,QAAQ,aAAa,aAAa,iBAAiB,EAAE,MAAM,EAAE,IAAI;AACvE,WAAO;AAAA,MACL,MAAM,EAAE;AAAA,MACR,MAAM,EAAE;AAAA,MACR,MAAM,EAAE;AAAA,MACR,MAAM,EAAE;AAAA,MACR,GAAI,EAAE,cAAc,EAAE,aAAa,EAAE,YAAY,IAAI,CAAC;AAAA;AAAA;AAAA,MAGtD,OAAO,KAAK,IAAI,GAAG,WAAW,KAAK;AAAA,MACnC;AAAA,IACF;AAAA,EACF,CAAC,EAGA,OAAO,CAAC,MAAM,EAAE,YAAY,QAAQ,EACpC,KAAK,CAAC,GAAG,MAAM,EAAE,QAAQ,EAAE,SAAS,EAAE,WAAW,EAAE,YAAY,EAAE,KAAK,cAAc,EAAE,IAAI,KAAK,EAAE,OAAO,EAAE,IAAI,EAC9G,MAAM,GAAG,KAAK,EACd,IAAI,CAAC,EAAE,UAAU,WAAW,GAAG,IAAI,MAAM,GAAG;AAE/C,SAAO,EAAE,MAAM,QAAQ,MAAM;AAC/B;AAGA,SAAS,SAAS,MAAwB;AACxC,SAAO,KACJ,QAAQ,sBAAsB,OAAO,EACrC,MAAM,eAAe,EACrB,IAAI,CAAC,MAAM,EAAE,YAAY,CAAC,EAC1B,OAAO,CAAC,MAAM,EAAE,UAAU,CAAC;AAChC;AAOA,SAAS,aAAa,aAAuB,iBAAyB,MAAc,MAAsB;AACxG,MAAI,YAAY,WAAW,EAAG,QAAO;AAErC,MAAI;AACJ,MAAI,oBAAoB,KAAK,YAAY,GAAG;AAC1C,oBAAgB;AAAA,EAClB,OAAO;AACL,UAAM,aAAa,IAAI,IAAI,SAAS,IAAI,CAAC;AACzC,UAAM,UAAU,YAAY,OAAO,CAAC,MAAM,WAAW,IAAI,CAAC,CAAC,EAAE;AAC7D,oBAAiB,UAAU,YAAY,SAAU;AAAA,EACnD;AAEA,QAAM,aAAa,IAAI,IAAI,SAAS,KAAK,MAAM,GAAG,EAAE,IAAI,KAAK,EAAE,CAAC;AAChE,QAAM,gBAAgB,YAAY,KAAK,CAAC,MAAM,WAAW,IAAI,CAAC,CAAC,IAAI,OAAO;AAE1E,SAAO,KAAK,IAAI,KAAK,gBAAgB,aAAa;AACpD;","names":["mkdir","readFile","writeFile","existsSync","path","path","existsSync","readFile","mkdir","writeFile","createHash","createHash"]}
+{"version":3,"sources":["../src/embedder.ts","../src/index-cache.ts","../src/indexer.ts","../src/search.ts","../src/code-index-cache.ts","../src/code-indexer.ts","../src/code-search.ts"],"sourcesContent":["export const DEFAULT_MODEL = \"Xenova/bge-small-en-v1.5\";\nexport const DEFAULT_DIMENSION = 384;\n\nexport interface EmbedderLike {\n  readonly model: string;\n  readonly dimension: number;\n  encode(text: string): Promise<Float32Array>;\n}\n\ninterface FeatureExtractionPipeline {\n  (text: string | string[], options: { pooling: \"mean\"; normalize: boolean }): Promise<{\n    data: Float32Array | number[];\n    dims: number[];\n  }>;\n}\n\nlet cachedPipeline: FeatureExtractionPipeline | null = null;\nlet cachedModel: string | null = null;\nconst cachedEmbedders = new Map<string, Embedder>();\n\nasync function loadPipeline(model: string): Promise<FeatureExtractionPipeline> {\n  if (cachedPipeline && cachedModel === model) return cachedPipeline;\n  const { pipeline, env } = await import(\"@xenova/transformers\");\n  // Allow remote model download by default; users can pre-cache for offline use.\n  env.allowLocalModels = true;\n  env.allowRemoteModels = true;\n  const configuredCache = process.env[\"HIVELORE_MODEL_CACHE\"]?.trim();\n  if (configuredCache) env.cacheDir = configuredCache;\n  const pipe = (await pipeline(\"feature-extraction\", model)) as unknown as FeatureExtractionPipeline;\n  cachedPipeline = pipe;\n  cachedModel = model;\n  return pipe;\n}\n\nexport class Embedder implements EmbedderLike {\n  private constructor(\n    private readonly pipe: FeatureExtractionPipeline,\n    public readonly model: string,\n    public readonly dimension: number,\n  ) {}\n\n  static async create(model: string = DEFAULT_MODEL): Promise<Embedder> {\n    // Reuse the fully-initialized embedder per model: the pipeline is already cached, but each\n    // create() otherwise runs a \"dimension probe\" inference — wasteful when an agent issues several\n    // code_search / semantic-search calls in one session. Caching the instance makes calls 2..N free.\n    const cached = cachedEmbedders.get(model);\n    if (cached) return cached;\n    const pipe = await loadPipeline(model);\n    const probe = await pipe(\"dimension probe\", { pooling: \"mean\", normalize: true });\n    const dim = probe.data instanceof Float32Array ? probe.data.length : probe.data.length;\n    const embedder = new Embedder(pipe, model, dim);\n    cachedEmbedders.set(model, embedder);\n    return embedder;\n  }\n\n  async encode(text: string): Promise<Float32Array> {\n    const result = await this.pipe(text, { pooling: \"mean\", normalize: true });\n    return result.data instanceof Float32Array\n      ? result.data\n      : Float32Array.from(result.data);\n  }\n\n  async encodeMany(texts: string[]): Promise<Float32Array[]> {\n    const out: Float32Array[] = [];\n    for (const t of texts) {\n      out.push(await this.encode(t));\n    }\n    return out;\n  }\n}\n\nexport function cosine(a: Float32Array | number[], b: Float32Array | number[]): number {\n  if (a.length !== b.length) {\n    throw new Error(`vector dimension mismatch: ${a.length} vs ${b.length}`);\n  }\n  let dot = 0;\n  let na = 0;\n  let nb = 0;\n  for (let i = 0; i < a.length; i++) {\n    const av = a[i] as number;\n    const bv = b[i] as number;\n    dot += av * bv;\n    na += av * av;\n    nb += bv * bv;\n  }\n  if (na === 0 || nb === 0) return 0;\n  return dot / (Math.sqrt(na) * Math.sqrt(nb));\n}\n","import { createHash } from \"node:crypto\";\nimport { mkdir, readFile, stat, writeFile } from \"node:fs/promises\";\nimport { existsSync } from \"node:fs\";\nimport path from \"node:path\";\nimport type { HaivePaths } from \"@hivelore/core\";\nimport { DEFAULT_DIMENSION, DEFAULT_MODEL } from \"./embedder.js\";\n\nexport const INDEX_FILE = \"embeddings-index.json\";\n\nexport interface EmbeddingEntry {\n  id: string;\n  file_path: string;\n  hash: string;\n  vector: number[];\n}\n\nexport interface EmbeddingIndex {\n  model: string;\n  dimension: number;\n  updated_at: string;\n  entries: EmbeddingEntry[];\n}\n\nexport function cacheDir(paths: HaivePaths): string {\n  return path.join(paths.haiveDir, \".cache\", \"embeddings\");\n}\n\nexport function indexPath(paths: HaivePaths): string {\n  return path.join(cacheDir(paths), INDEX_FILE);\n}\n\nexport function hashContent(text: string): string {\n  return createHash(\"sha256\").update(text).digest(\"hex\");\n}\n\nexport function emptyIndex(model = DEFAULT_MODEL, dimension = DEFAULT_DIMENSION): EmbeddingIndex {\n  return {\n    model,\n    dimension,\n    updated_at: new Date().toISOString(),\n    entries: [],\n  };\n}\n\nexport async function loadIndex(paths: HaivePaths): Promise<EmbeddingIndex | null> {\n  const file = indexPath(paths);\n  if (!existsSync(file)) return null;\n  const raw = await readFile(file, \"utf8\");\n  return JSON.parse(raw) as EmbeddingIndex;\n}\n\nexport async function saveIndex(paths: HaivePaths, index: EmbeddingIndex): Promise<void> {\n  const dir = cacheDir(paths);\n  await mkdir(dir, { recursive: true });\n  index.updated_at = new Date().toISOString();\n  await writeFile(indexPath(paths), JSON.stringify(index, null, 2), \"utf8\");\n}\n\nexport async function indexStat(paths: HaivePaths): Promise<{\n  exists: boolean;\n  count: number;\n  model: string | null;\n  updatedAt: string | null;\n  sizeBytes: number;\n}> {\n  const file = indexPath(paths);\n  if (!existsSync(file)) {\n    return { exists: false, count: 0, model: null, updatedAt: null, sizeBytes: 0 };\n  }\n  const idx = await loadIndex(paths);\n  const st = await stat(file);\n  return {\n    exists: true,\n    count: idx?.entries.length ?? 0,\n    model: idx?.model ?? null,\n    updatedAt: idx?.updated_at ?? null,\n    sizeBytes: st.size,\n  };\n}\n\nexport function buildEntryText(id: string, tags: string[], body: string): string {\n  // Concatenate id + tags + body so search works on metadata too.\n  // Tags are weighted by repetition so they contribute more to the embedding.\n  const tagPart = tags.length ? `${tags.join(\" \")} ${tags.join(\" \")} ` : \"\";\n  return `${id} ${tagPart}${body}`;\n}\n","import { loadMemoriesFromDir, type HaivePaths } from \"@hivelore/core\";\nimport type { EmbedderLike } from \"./embedder.js\";\nimport {\n  buildEntryText,\n  emptyIndex,\n  hashContent,\n  loadIndex,\n  saveIndex,\n  type EmbeddingEntry,\n  type EmbeddingIndex,\n} from \"./index-cache.js\";\n\nexport interface IndexUpdateReport {\n  total: number;\n  added: number;\n  updated: number;\n  unchanged: number;\n  removed: number;\n}\n\nexport async function rebuildIndex(\n  paths: HaivePaths,\n  embedder: EmbedderLike,\n): Promise<{ index: EmbeddingIndex; report: IndexUpdateReport }> {\n  const existing = (await loadIndex(paths)) ?? emptyIndex(embedder.model, embedder.dimension);\n  // If model changed, reset.\n  if (existing.model !== embedder.model || existing.dimension !== embedder.dimension) {\n    existing.entries = [];\n    existing.model = embedder.model;\n    existing.dimension = embedder.dimension;\n  }\n\n  const memories = await loadMemoriesFromDir(paths.memoriesDir);\n  const byId = new Map(existing.entries.map((e) => [e.id, e]));\n  const seenIds = new Set<string>();\n\n  let added = 0;\n  let updated = 0;\n  let unchanged = 0;\n\n  const nextEntries: EmbeddingEntry[] = [];\n\n  for (const { memory, filePath } of memories) {\n    const id = memory.frontmatter.id;\n    seenIds.add(id);\n    const text = buildEntryText(id, memory.frontmatter.tags, memory.body);\n    const hash = hashContent(text);\n    const prior = byId.get(id);\n\n    if (prior && prior.hash === hash) {\n      nextEntries.push({ ...prior, file_path: filePath });\n      unchanged++;\n      continue;\n    }\n\n    const vector = Array.from(await embedder.encode(text));\n    nextEntries.push({ id, file_path: filePath, hash, vector });\n    if (prior) {\n      updated++;\n    } else {\n      added++;\n    }\n  }\n\n  const removed = existing.entries.filter((e) => !seenIds.has(e.id)).length;\n  existing.entries = nextEntries;\n  await saveIndex(paths, existing);\n\n  return {\n    index: existing,\n    report: {\n      total: nextEntries.length,\n      added,\n      updated,\n      unchanged,\n      removed,\n    },\n  };\n}\n","import type { HaivePaths } from \"@hivelore/core\";\nimport { cosine, Embedder, type EmbedderLike } from \"./embedder.js\";\nimport { loadIndex, type EmbeddingIndex } from \"./index-cache.js\";\n\nexport interface SemanticHit {\n  id: string;\n  file_path: string;\n  score: number;\n}\n\nexport async function semanticSearch(\n  paths: HaivePaths,\n  query: string,\n  options: {\n    limit?: number;\n    minScore?: number;\n    embedder?: EmbedderLike;\n    index?: EmbeddingIndex;\n  } = {},\n): Promise<{ hits: SemanticHit[]; index: EmbeddingIndex } | null> {\n  const index = options.index ?? (await loadIndex(paths));\n  if (!index || index.entries.length === 0) return null;\n\n  const embedder = options.embedder ?? (await Embedder.create(index.model));\n  if (embedder.dimension !== index.dimension) {\n    throw new Error(\n      `Embedder dimension (${embedder.dimension}) differs from index (${index.dimension}). Re-run \\`hivelore embeddings index\\`.`,\n    );\n  }\n\n  const queryVec = await embedder.encode(query);\n  const minScore = options.minScore ?? 0;\n  const limit = options.limit ?? 10;\n\n  const scored = index.entries\n    .map((e) => ({ id: e.id, file_path: e.file_path, score: cosine(queryVec, e.vector) }))\n    .filter((h) => h.score >= minScore)\n    .sort((a, b) => b.score - a.score)\n    .slice(0, limit);\n\n  return { hits: scored, index };\n}\n","import { mkdir, readFile, writeFile } from \"node:fs/promises\";\nimport { existsSync } from \"node:fs\";\nimport path from \"node:path\";\nimport type { HaivePaths } from \"@hivelore/core\";\nimport { DEFAULT_DIMENSION, DEFAULT_MODEL } from \"./embedder.js\";\nimport { cacheDir } from \"./index-cache.js\";\n\nexport const CODE_INDEX_FILE = \"code-embeddings-index.json\";\n\nexport interface CodeEmbeddingEntry {\n  /** stable id: `${file}#${name}` */\n  id: string;\n  file: string;\n  name: string;\n  kind: string;\n  line: number;\n  description?: string;\n  hash: string;\n  vector: number[];\n}\n\nexport interface CodeEmbeddingIndex {\n  model: string;\n  dimension: number;\n  updated_at: string;\n  source_generated_at: string;\n  entries: CodeEmbeddingEntry[];\n}\n\nexport function codeIndexPath(paths: HaivePaths): string {\n  return path.join(cacheDir(paths), CODE_INDEX_FILE);\n}\n\n/**\n * Is the code-search embeddings index stale relative to the current code-map?\n * The indexer stamps `source_generated_at` with the code-map's `generated_at` it was built from,\n * so a mismatch means the code-map was rebuilt afterwards and the index may miss or mislocate symbols.\n * Unknown timestamps (empty strings) are treated as not-stale to avoid false alarms.\n */\nexport function isCodeIndexStale(indexSourceGeneratedAt: string, codeMapGeneratedAt: string): boolean {\n  if (!indexSourceGeneratedAt || !codeMapGeneratedAt) return false;\n  return indexSourceGeneratedAt !== codeMapGeneratedAt;\n}\n\nexport function emptyCodeIndex(\n  model = DEFAULT_MODEL,\n  dimension = DEFAULT_DIMENSION,\n  sourceGeneratedAt = \"\",\n): CodeEmbeddingIndex {\n  return {\n    model,\n    dimension,\n    updated_at: new Date().toISOString(),\n    source_generated_at: sourceGeneratedAt,\n    entries: [],\n  };\n}\n\nexport async function loadCodeIndex(paths: HaivePaths): Promise<CodeEmbeddingIndex | null> {\n  const file = codeIndexPath(paths);\n  if (!existsSync(file)) return null;\n  return JSON.parse(await readFile(file, \"utf8\")) as CodeEmbeddingIndex;\n}\n\nexport async function saveCodeIndex(paths: HaivePaths, index: CodeEmbeddingIndex): Promise<void> {\n  const dir = cacheDir(paths);\n  await mkdir(dir, { recursive: true });\n  index.updated_at = new Date().toISOString();\n  await writeFile(codeIndexPath(paths), JSON.stringify(index, null, 2), \"utf8\");\n}\n\nexport function buildCodeEntryText(file: string, name: string, kind: string, description?: string): string {\n  // The embedded text is what we search against — keep it tight and signal-dense.\n  // Filename tokens often carry intent (e.g. \"auth.controller.ts\" → \"auth controller\").\n  const filenameHints = file\n    .split(\"/\")\n    .pop()\n    ?.replace(/\\.[^.]+$/, \"\")\n    .replace(/[._-]+/g, \" \") ?? \"\";\n  return `${name} ${kind} ${filenameHints} ${description ?? \"\"}`.trim();\n}\n","import { loadCodeMap, type HaivePaths } from \"@hivelore/core\";\nimport { createHash } from \"node:crypto\";\nimport type { EmbedderLike } from \"./embedder.js\";\nimport {\n  buildCodeEntryText,\n  emptyCodeIndex,\n  loadCodeIndex,\n  saveCodeIndex,\n  type CodeEmbeddingEntry,\n  type CodeEmbeddingIndex,\n} from \"./code-index-cache.js\";\n\nexport interface CodeIndexUpdateReport {\n  total: number;\n  added: number;\n  updated: number;\n  unchanged: number;\n  removed: number;\n}\n\nfunction hashEntry(text: string): string {\n  return createHash(\"sha256\").update(text).digest(\"hex\").slice(0, 32);\n}\n\n/**\n * Build (or refresh) the code semantic-search index from the code-map.\n * Each exported symbol becomes one embedding entry — granularity stays at the\n * symbol level so search returns a precise file:line:name target.\n *\n * Re-uses entries whose embedded text is unchanged (hash check) so subsequent\n * builds only embed the diff.\n */\nexport async function rebuildCodeIndex(\n  paths: HaivePaths,\n  embedder: EmbedderLike,\n): Promise<{ index: CodeEmbeddingIndex; report: CodeIndexUpdateReport }> {\n  const codeMap = await loadCodeMap(paths);\n  if (!codeMap) {\n    throw new Error(\n      \"No code-map found. Run `hivelore index code` to generate `.ai/code-map.json` first.\",\n    );\n  }\n\n  const existing =\n    (await loadCodeIndex(paths)) ??\n    emptyCodeIndex(embedder.model, embedder.dimension, codeMap.generated_at);\n\n  if (existing.model !== embedder.model || existing.dimension !== embedder.dimension) {\n    existing.entries = [];\n    existing.model = embedder.model;\n    existing.dimension = embedder.dimension;\n  }\n\n  const byId = new Map(existing.entries.map((e) => [e.id, e]));\n  const nextEntries: CodeEmbeddingEntry[] = [];\n  const seenIds = new Set<string>();\n  let added = 0;\n  let updated = 0;\n  let unchanged = 0;\n\n  for (const [filePath, fileEntry] of Object.entries(codeMap.files)) {\n    for (const exp of fileEntry.exports) {\n      const id = `${filePath}#${exp.name}`;\n      seenIds.add(id);\n      const text = buildCodeEntryText(filePath, exp.name, exp.kind, exp.description);\n      const hash = hashEntry(text);\n      const prior = byId.get(id);\n\n      if (prior && prior.hash === hash && prior.line === exp.line) {\n        nextEntries.push({ ...prior, file: filePath, name: exp.name, kind: exp.kind, line: exp.line, ...(exp.description ? { description: exp.description } : {}) });\n        unchanged++;\n        continue;\n      }\n\n      const vector = Array.from(await embedder.encode(text));\n      nextEntries.push({\n        id,\n        file: filePath,\n        name: exp.name,\n        kind: exp.kind,\n        line: exp.line,\n        ...(exp.description ? { description: exp.description } : {}),\n        hash,\n        vector,\n      });\n      if (prior) updated++;\n      else added++;\n    }\n  }\n\n  const removed = existing.entries.filter((e) => !seenIds.has(e.id)).length;\n  existing.entries = nextEntries;\n  existing.source_generated_at = codeMap.generated_at;\n  await saveCodeIndex(paths, existing);\n\n  return {\n    index: existing,\n    report: {\n      total: nextEntries.length,\n      added,\n      updated,\n      unchanged,\n      removed,\n    },\n  };\n}\n","import type { HaivePaths } from \"@hivelore/core\";\nimport { cosine, Embedder, type EmbedderLike } from \"./embedder.js\";\nimport { loadCodeIndex, type CodeEmbeddingIndex } from \"./code-index-cache.js\";\n\nexport interface CodeSearchHit {\n  file: string;\n  name: string;\n  kind: string;\n  line: number;\n  description?: string;\n  score: number;\n}\n\nexport async function codeSemanticSearch(\n  paths: HaivePaths,\n  query: string,\n  options: {\n    limit?: number;\n    minScore?: number;\n    embedder?: EmbedderLike;\n    index?: CodeEmbeddingIndex;\n  } = {},\n): Promise<{ hits: CodeSearchHit[]; index: CodeEmbeddingIndex } | null> {\n  const index = options.index ?? (await loadCodeIndex(paths));\n  if (!index || index.entries.length === 0) return null;\n\n  const embedder = options.embedder ?? (await Embedder.create(index.model));\n  if (embedder.dimension !== index.dimension) {\n    throw new Error(\n      `Embedder dimension (${embedder.dimension}) differs from code index (${index.dimension}). Re-run \\`hivelore index code-search\\`.`,\n    );\n  }\n\n  const queryVec = await embedder.encode(query);\n  const minScore = options.minScore ?? 0;\n  const limit = options.limit ?? 5;\n\n  const queryTokens = tokenize(query);\n  const normalizedQuery = query.trim().toLowerCase();\n\n  const scored = index.entries\n    .map((e) => {\n      const semantic = cosine(queryVec, e.vector);\n      const boost = lexicalBoost(queryTokens, normalizedQuery, e.name, e.file);\n      return {\n        file: e.file,\n        name: e.name,\n        kind: e.kind,\n        line: e.line,\n        ...(e.description ? { description: e.description } : {}),\n        // Hybrid score: semantic cosine is the base, a small deterministic lexical bonus\n        // promotes exact/partial symbol-name and filename matches above merely-similar neighbours.\n        score: Math.min(1, semantic + boost),\n        semantic,\n      };\n    })\n    // Keep min_score a pure-semantic noise floor (its documented meaning) so the lexical bonus\n    // re-ranks the relevant set without letting incidental filename tokens leak noise past the gate.\n    .filter((h) => h.semantic >= minScore)\n    .sort((a, b) => b.score - a.score || b.semantic - a.semantic || a.file.localeCompare(b.file) || a.line - b.line)\n    .slice(0, limit)\n    .map(({ semantic: _semantic, ...hit }) => hit);\n\n  return { hits: scored, index };\n}\n\n/** Split a query or symbol name into lowercase tokens, breaking on camelCase and any non-alphanumeric run. */\nfunction tokenize(text: string): string[] {\n  return text\n    .replace(/([a-z0-9])([A-Z])/g, \"$1 $2\")\n    .split(/[^a-zA-Z0-9]+/)\n    .map((t) => t.toLowerCase())\n    .filter((t) => t.length >= 2);\n}\n\n/**\n * Small additive bonus (≤ 0.30) layered on top of the semantic cosine so that exact symbol-name\n * matches outrank distant-but-similar code. Reuses only data already in the index entry — no new\n * index, model, or dependency.\n */\nfunction lexicalBoost(queryTokens: string[], normalizedQuery: string, name: string, file: string): number {\n  if (queryTokens.length === 0) return 0;\n\n  let nameComponent: number;\n  if (normalizedQuery === name.toLowerCase()) {\n    nameComponent = 0.3; // exact symbol name typed verbatim\n  } else {\n    const nameTokens = new Set(tokenize(name));\n    const matched = queryTokens.filter((t) => nameTokens.has(t)).length;\n    nameComponent = (matched / queryTokens.length) * 0.2; // proportional partial-name match\n  }\n\n  const fileTokens = new Set(tokenize(file.split(\"/\").pop() ?? \"\"));\n  const pathComponent = queryTokens.some((t) => fileTokens.has(t)) ? 0.05 : 0;\n\n  return Math.min(0.3, nameComponent + pathComponent);\n}\n"],"mappings":";AAAO,IAAM,gBAAgB;AACtB,IAAM,oBAAoB;AAejC,IAAI,iBAAmD;AACvD,IAAI,cAA6B;AACjC,IAAM,kBAAkB,oBAAI,IAAsB;AAElD,eAAe,aAAa,OAAmD;AAC7E,MAAI,kBAAkB,gBAAgB,MAAO,QAAO;AACpD,QAAM,EAAE,UAAU,IAAI,IAAI,MAAM,OAAO,sBAAsB;AAE7D,MAAI,mBAAmB;AACvB,MAAI,oBAAoB;AACxB,QAAM,kBAAkB,QAAQ,IAAI,sBAAsB,GAAG,KAAK;AAClE,MAAI,gBAAiB,KAAI,WAAW;AACpC,QAAM,OAAQ,MAAM,SAAS,sBAAsB,KAAK;AACxD,mBAAiB;AACjB,gBAAc;AACd,SAAO;AACT;AAEO,IAAM,WAAN,MAAM,UAAiC;AAAA,EACpC,YACW,MACD,OACA,WAChB;AAHiB;AACD;AACA;AAAA,EACf;AAAA,EAHgB;AAAA,EACD;AAAA,EACA;AAAA,EAGlB,aAAa,OAAO,QAAgB,eAAkC;AAIpE,UAAM,SAAS,gBAAgB,IAAI,KAAK;AACxC,QAAI,OAAQ,QAAO;AACnB,UAAM,OAAO,MAAM,aAAa,KAAK;AACrC,UAAM,QAAQ,MAAM,KAAK,mBAAmB,EAAE,SAAS,QAAQ,WAAW,KAAK,CAAC;AAChF,UAAM,MAAM,MAAM,gBAAgB,eAAe,MAAM,KAAK,SAAS,MAAM,KAAK;AAChF,UAAM,WAAW,IAAI,UAAS,MAAM,OAAO,GAAG;AAC9C,oBAAgB,IAAI,OAAO,QAAQ;AACnC,WAAO;AAAA,EACT;AAAA,EAEA,MAAM,OAAO,MAAqC;AAChD,UAAM,SAAS,MAAM,KAAK,KAAK,MAAM,EAAE,SAAS,QAAQ,WAAW,KAAK,CAAC;AACzE,WAAO,OAAO,gBAAgB,eAC1B,OAAO,OACP,aAAa,KAAK,OAAO,IAAI;AAAA,EACnC;AAAA,EAEA,MAAM,WAAW,OAA0C;AACzD,UAAM,MAAsB,CAAC;AAC7B,eAAW,KAAK,OAAO;AACrB,UAAI,KAAK,MAAM,KAAK,OAAO,CAAC,CAAC;AAAA,IAC/B;AACA,WAAO;AAAA,EACT;AACF;AAEO,SAAS,OAAO,GAA4B,GAAoC;AACrF,MAAI,EAAE,WAAW,EAAE,QAAQ;AACzB,UAAM,IAAI,MAAM,8BAA8B,EAAE,MAAM,OAAO,EAAE,MAAM,EAAE;AAAA,EACzE;AACA,MAAI,MAAM;AACV,MAAI,KAAK;AACT,MAAI,KAAK;AACT,WAAS,IAAI,GAAG,IAAI,EAAE,QAAQ,KAAK;AACjC,UAAM,KAAK,EAAE,CAAC;AACd,UAAM,KAAK,EAAE,CAAC;AACd,WAAO,KAAK;AACZ,UAAM,KAAK;AACX,UAAM,KAAK;AAAA,EACb;AACA,MAAI,OAAO,KAAK,OAAO,EAAG,QAAO;AACjC,SAAO,OAAO,KAAK,KAAK,EAAE,IAAI,KAAK,KAAK,EAAE;AAC5C;;;ACvFA,SAAS,kBAAkB;AAC3B,SAAS,OAAO,UAAU,MAAM,iBAAiB;AACjD,SAAS,kBAAkB;AAC3B,OAAO,UAAU;AAIV,IAAM,aAAa;AAgBnB,SAAS,SAAS,OAA2B;AAClD,SAAO,KAAK,KAAK,MAAM,UAAU,UAAU,YAAY;AACzD;AAEO,SAAS,UAAU,OAA2B;AACnD,SAAO,KAAK,KAAK,SAAS,KAAK,GAAG,UAAU;AAC9C;AAEO,SAAS,YAAY,MAAsB;AAChD,SAAO,WAAW,QAAQ,EAAE,OAAO,IAAI,EAAE,OAAO,KAAK;AACvD;AAEO,SAAS,WAAW,QAAQ,eAAe,YAAY,mBAAmC;AAC/F,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA,aAAY,oBAAI,KAAK,GAAE,YAAY;AAAA,IACnC,SAAS,CAAC;AAAA,EACZ;AACF;AAEA,eAAsB,UAAU,OAAmD;AACjF,QAAM,OAAO,UAAU,KAAK;AAC5B,MAAI,CAAC,WAAW,IAAI,EAAG,QAAO;AAC9B,QAAM,MAAM,MAAM,SAAS,MAAM,MAAM;AACvC,SAAO,KAAK,MAAM,GAAG;AACvB;AAEA,eAAsB,UAAU,OAAmB,OAAsC;AACvF,QAAM,MAAM,SAAS,KAAK;AAC1B,QAAM,MAAM,KAAK,EAAE,WAAW,KAAK,CAAC;AACpC,QAAM,cAAa,oBAAI,KAAK,GAAE,YAAY;AAC1C,QAAM,UAAU,UAAU,KAAK,GAAG,KAAK,UAAU,OAAO,MAAM,CAAC,GAAG,MAAM;AAC1E;AAEA,eAAsB,UAAU,OAM7B;AACD,QAAM,OAAO,UAAU,KAAK;AAC5B,MAAI,CAAC,WAAW,IAAI,GAAG;AACrB,WAAO,EAAE,QAAQ,OAAO,OAAO,GAAG,OAAO,MAAM,WAAW,MAAM,WAAW,EAAE;AAAA,EAC/E;AACA,QAAM,MAAM,MAAM,UAAU,KAAK;AACjC,QAAM,KAAK,MAAM,KAAK,IAAI;AAC1B,SAAO;AAAA,IACL,QAAQ;AAAA,IACR,OAAO,KAAK,QAAQ,UAAU;AAAA,IAC9B,OAAO,KAAK,SAAS;AAAA,IACrB,WAAW,KAAK,cAAc;AAAA,IAC9B,WAAW,GAAG;AAAA,EAChB;AACF;AAEO,SAAS,eAAe,IAAY,MAAgB,MAAsB;AAG/E,QAAM,UAAU,KAAK,SAAS,GAAG,KAAK,KAAK,GAAG,CAAC,IAAI,KAAK,KAAK,GAAG,CAAC,MAAM;AACvE,SAAO,GAAG,EAAE,IAAI,OAAO,GAAG,IAAI;AAChC;;;ACrFA,SAAS,2BAA4C;AAoBrD,eAAsB,aACpB,OACA,UAC+D;AAC/D,QAAM,WAAY,MAAM,UAAU,KAAK,KAAM,WAAW,SAAS,OAAO,SAAS,SAAS;AAE1F,MAAI,SAAS,UAAU,SAAS,SAAS,SAAS,cAAc,SAAS,WAAW;AAClF,aAAS,UAAU,CAAC;AACpB,aAAS,QAAQ,SAAS;AAC1B,aAAS,YAAY,SAAS;AAAA,EAChC;AAEA,QAAM,WAAW,MAAM,oBAAoB,MAAM,WAAW;AAC5D,QAAM,OAAO,IAAI,IAAI,SAAS,QAAQ,IAAI,CAAC,MAAM,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC;AAC3D,QAAM,UAAU,oBAAI,IAAY;AAEhC,MAAI,QAAQ;AACZ,MAAI,UAAU;AACd,MAAI,YAAY;AAEhB,QAAM,cAAgC,CAAC;AAEvC,aAAW,EAAE,QAAQ,SAAS,KAAK,UAAU;AAC3C,UAAM,KAAK,OAAO,YAAY;AAC9B,YAAQ,IAAI,EAAE;AACd,UAAM,OAAO,eAAe,IAAI,OAAO,YAAY,MAAM,OAAO,IAAI;AACpE,UAAM,OAAO,YAAY,IAAI;AAC7B,UAAM,QAAQ,KAAK,IAAI,EAAE;AAEzB,QAAI,SAAS,MAAM,SAAS,MAAM;AAChC,kBAAY,KAAK,EAAE,GAAG,OAAO,WAAW,SAAS,CAAC;AAClD;AACA;AAAA,IACF;AAEA,UAAM,SAAS,MAAM,KAAK,MAAM,SAAS,OAAO,IAAI,CAAC;AACrD,gBAAY,KAAK,EAAE,IAAI,WAAW,UAAU,MAAM,OAAO,CAAC;AAC1D,QAAI,OAAO;AACT;AAAA,IACF,OAAO;AACL;AAAA,IACF;AAAA,EACF;AAEA,QAAM,UAAU,SAAS,QAAQ,OAAO,CAAC,MAAM,CAAC,QAAQ,IAAI,EAAE,EAAE,CAAC,EAAE;AACnE,WAAS,UAAU;AACnB,QAAM,UAAU,OAAO,QAAQ;AAE/B,SAAO;AAAA,IACL,OAAO;AAAA,IACP,QAAQ;AAAA,MACN,OAAO,YAAY;AAAA,MACnB;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACF;AAAA,EACF;AACF;;;ACpEA,eAAsB,eACpB,OACA,OACA,UAKI,CAAC,GAC2D;AAChE,QAAM,QAAQ,QAAQ,SAAU,MAAM,UAAU,KAAK;AACrD,MAAI,CAAC,SAAS,MAAM,QAAQ,WAAW,EAAG,QAAO;AAEjD,QAAM,WAAW,QAAQ,YAAa,MAAM,SAAS,OAAO,MAAM,KAAK;AACvE,MAAI,SAAS,cAAc,MAAM,WAAW;AAC1C,UAAM,IAAI;AAAA,MACR,uBAAuB,SAAS,SAAS,yBAAyB,MAAM,SAAS;AAAA,IACnF;AAAA,EACF;AAEA,QAAM,WAAW,MAAM,SAAS,OAAO,KAAK;AAC5C,QAAM,WAAW,QAAQ,YAAY;AACrC,QAAM,QAAQ,QAAQ,SAAS;AAE/B,QAAM,SAAS,MAAM,QAClB,IAAI,CAAC,OAAO,EAAE,IAAI,EAAE,IAAI,WAAW,EAAE,WAAW,OAAO,OAAO,UAAU,EAAE,MAAM,EAAE,EAAE,EACpF,OAAO,CAAC,MAAM,EAAE,SAAS,QAAQ,EACjC,KAAK,CAAC,GAAG,MAAM,EAAE,QAAQ,EAAE,KAAK,EAChC,MAAM,GAAG,KAAK;AAEjB,SAAO,EAAE,MAAM,QAAQ,MAAM;AAC/B;;;ACzCA,SAAS,SAAAA,QAAO,YAAAC,WAAU,aAAAC,kBAAiB;AAC3C,SAAS,cAAAC,mBAAkB;AAC3B,OAAOC,WAAU;AAKV,IAAM,kBAAkB;AAsBxB,SAAS,cAAc,OAA2B;AACvD,SAAOC,MAAK,KAAK,SAAS,KAAK,GAAG,eAAe;AACnD;AAQO,SAAS,iBAAiB,wBAAgC,oBAAqC;AACpG,MAAI,CAAC,0BAA0B,CAAC,mBAAoB,QAAO;AAC3D,SAAO,2BAA2B;AACpC;AAEO,SAAS,eACd,QAAQ,eACR,YAAY,mBACZ,oBAAoB,IACA;AACpB,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA,aAAY,oBAAI,KAAK,GAAE,YAAY;AAAA,IACnC,qBAAqB;AAAA,IACrB,SAAS,CAAC;AAAA,EACZ;AACF;AAEA,eAAsB,cAAc,OAAuD;AACzF,QAAM,OAAO,cAAc,KAAK;AAChC,MAAI,CAACC,YAAW,IAAI,EAAG,QAAO;AAC9B,SAAO,KAAK,MAAM,MAAMC,UAAS,MAAM,MAAM,CAAC;AAChD;AAEA,eAAsB,cAAc,OAAmB,OAA0C;AAC/F,QAAM,MAAM,SAAS,KAAK;AAC1B,QAAMC,OAAM,KAAK,EAAE,WAAW,KAAK,CAAC;AACpC,QAAM,cAAa,oBAAI,KAAK,GAAE,YAAY;AAC1C,QAAMC,WAAU,cAAc,KAAK,GAAG,KAAK,UAAU,OAAO,MAAM,CAAC,GAAG,MAAM;AAC9E;AAEO,SAAS,mBAAmB,MAAc,MAAc,MAAc,aAA8B;AAGzG,QAAM,gBAAgB,KACnB,MAAM,GAAG,EACT,IAAI,GACH,QAAQ,YAAY,EAAE,EACvB,QAAQ,WAAW,GAAG,KAAK;AAC9B,SAAO,GAAG,IAAI,IAAI,IAAI,IAAI,aAAa,IAAI,eAAe,EAAE,GAAG,KAAK;AACtE;;;AChFA,SAAS,mBAAoC;AAC7C,SAAS,cAAAC,mBAAkB;AAmB3B,SAAS,UAAU,MAAsB;AACvC,SAAOC,YAAW,QAAQ,EAAE,OAAO,IAAI,EAAE,OAAO,KAAK,EAAE,MAAM,GAAG,EAAE;AACpE;AAUA,eAAsB,iBACpB,OACA,UACuE;AACvE,QAAM,UAAU,MAAM,YAAY,KAAK;AACvC,MAAI,CAAC,SAAS;AACZ,UAAM,IAAI;AAAA,MACR;AAAA,IACF;AAAA,EACF;AAEA,QAAM,WACH,MAAM,cAAc,KAAK,KAC1B,eAAe,SAAS,OAAO,SAAS,WAAW,QAAQ,YAAY;AAEzE,MAAI,SAAS,UAAU,SAAS,SAAS,SAAS,cAAc,SAAS,WAAW;AAClF,aAAS,UAAU,CAAC;AACpB,aAAS,QAAQ,SAAS;AAC1B,aAAS,YAAY,SAAS;AAAA,EAChC;AAEA,QAAM,OAAO,IAAI,IAAI,SAAS,QAAQ,IAAI,CAAC,MAAM,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC;AAC3D,QAAM,cAAoC,CAAC;AAC3C,QAAM,UAAU,oBAAI,IAAY;AAChC,MAAI,QAAQ;AACZ,MAAI,UAAU;AACd,MAAI,YAAY;AAEhB,aAAW,CAAC,UAAU,SAAS,KAAK,OAAO,QAAQ,QAAQ,KAAK,GAAG;AACjE,eAAW,OAAO,UAAU,SAAS;AACnC,YAAM,KAAK,GAAG,QAAQ,IAAI,IAAI,IAAI;AAClC,cAAQ,IAAI,EAAE;AACd,YAAM,OAAO,mBAAmB,UAAU,IAAI,MAAM,IAAI,MAAM,IAAI,WAAW;AAC7E,YAAM,OAAO,UAAU,IAAI;AAC3B,YAAM,QAAQ,KAAK,IAAI,EAAE;AAEzB,UAAI,SAAS,MAAM,SAAS,QAAQ,MAAM,SAAS,IAAI,MAAM;AAC3D,oBAAY,KAAK,EAAE,GAAG,OAAO,MAAM,UAAU,MAAM,IAAI,MAAM,MAAM,IAAI,MAAM,MAAM,IAAI,MAAM,GAAI,IAAI,cAAc,EAAE,aAAa,IAAI,YAAY,IAAI,CAAC,EAAG,CAAC;AAC3J;AACA;AAAA,MACF;AAEA,YAAM,SAAS,MAAM,KAAK,MAAM,SAAS,OAAO,IAAI,CAAC;AACrD,kBAAY,KAAK;AAAA,QACf;AAAA,QACA,MAAM;AAAA,QACN,MAAM,IAAI;AAAA,QACV,MAAM,IAAI;AAAA,QACV,MAAM,IAAI;AAAA,QACV,GAAI,IAAI,cAAc,EAAE,aAAa,IAAI,YAAY,IAAI,CAAC;AAAA,QAC1D;AAAA,QACA;AAAA,MACF,CAAC;AACD,UAAI,MAAO;AAAA,UACN;AAAA,IACP;AAAA,EACF;AAEA,QAAM,UAAU,SAAS,QAAQ,OAAO,CAAC,MAAM,CAAC,QAAQ,IAAI,EAAE,EAAE,CAAC,EAAE;AACnE,WAAS,UAAU;AACnB,WAAS,sBAAsB,QAAQ;AACvC,QAAM,cAAc,OAAO,QAAQ;AAEnC,SAAO;AAAA,IACL,OAAO;AAAA,IACP,QAAQ;AAAA,MACN,OAAO,YAAY;AAAA,MACnB;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACF;AAAA,EACF;AACF;;;AC5FA,eAAsB,mBACpB,OACA,OACA,UAKI,CAAC,GACiE;AACtE,QAAM,QAAQ,QAAQ,SAAU,MAAM,cAAc,KAAK;AACzD,MAAI,CAAC,SAAS,MAAM,QAAQ,WAAW,EAAG,QAAO;AAEjD,QAAM,WAAW,QAAQ,YAAa,MAAM,SAAS,OAAO,MAAM,KAAK;AACvE,MAAI,SAAS,cAAc,MAAM,WAAW;AAC1C,UAAM,IAAI;AAAA,MACR,uBAAuB,SAAS,SAAS,8BAA8B,MAAM,SAAS;AAAA,IACxF;AAAA,EACF;AAEA,QAAM,WAAW,MAAM,SAAS,OAAO,KAAK;AAC5C,QAAM,WAAW,QAAQ,YAAY;AACrC,QAAM,QAAQ,QAAQ,SAAS;AAE/B,QAAM,cAAc,SAAS,KAAK;AAClC,QAAM,kBAAkB,MAAM,KAAK,EAAE,YAAY;AAEjD,QAAM,SAAS,MAAM,QAClB,IAAI,CAAC,MAAM;AACV,UAAM,WAAW,OAAO,UAAU,EAAE,MAAM;AAC1C,UAAM,QAAQ,aAAa,aAAa,iBAAiB,EAAE,MAAM,EAAE,IAAI;AACvE,WAAO;AAAA,MACL,MAAM,EAAE;AAAA,MACR,MAAM,EAAE;AAAA,MACR,MAAM,EAAE;AAAA,MACR,MAAM,EAAE;AAAA,MACR,GAAI,EAAE,cAAc,EAAE,aAAa,EAAE,YAAY,IAAI,CAAC;AAAA;AAAA;AAAA,MAGtD,OAAO,KAAK,IAAI,GAAG,WAAW,KAAK;AAAA,MACnC;AAAA,IACF;AAAA,EACF,CAAC,EAGA,OAAO,CAAC,MAAM,EAAE,YAAY,QAAQ,EACpC,KAAK,CAAC,GAAG,MAAM,EAAE,QAAQ,EAAE,SAAS,EAAE,WAAW,EAAE,YAAY,EAAE,KAAK,cAAc,EAAE,IAAI,KAAK,EAAE,OAAO,EAAE,IAAI,EAC9G,MAAM,GAAG,KAAK,EACd,IAAI,CAAC,EAAE,UAAU,WAAW,GAAG,IAAI,MAAM,GAAG;AAE/C,SAAO,EAAE,MAAM,QAAQ,MAAM;AAC/B;AAGA,SAAS,SAAS,MAAwB;AACxC,SAAO,KACJ,QAAQ,sBAAsB,OAAO,EACrC,MAAM,eAAe,EACrB,IAAI,CAAC,MAAM,EAAE,YAAY,CAAC,EAC1B,OAAO,CAAC,MAAM,EAAE,UAAU,CAAC;AAChC;AAOA,SAAS,aAAa,aAAuB,iBAAyB,MAAc,MAAsB;AACxG,MAAI,YAAY,WAAW,EAAG,QAAO;AAErC,MAAI;AACJ,MAAI,oBAAoB,KAAK,YAAY,GAAG;AAC1C,oBAAgB;AAAA,EAClB,OAAO;AACL,UAAM,aAAa,IAAI,IAAI,SAAS,IAAI,CAAC;AACzC,UAAM,UAAU,YAAY,OAAO,CAAC,MAAM,WAAW,IAAI,CAAC,CAAC,EAAE;AAC7D,oBAAiB,UAAU,YAAY,SAAU;AAAA,EACnD;AAEA,QAAM,aAAa,IAAI,IAAI,SAAS,KAAK,MAAM,GAAG,EAAE,IAAI,KAAK,EAAE,CAAC;AAChE,QAAM,gBAAgB,YAAY,KAAK,CAAC,MAAM,WAAW,IAAI,CAAC,CAAC,IAAI,OAAO;AAE1E,SAAO,KAAK,IAAI,KAAK,gBAAgB,aAAa;AACpD;","names":["mkdir","readFile","writeFile","existsSync","path","path","existsSync","readFile","mkdir","writeFile","createHash","createHash"]}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@hivelore/embeddings",
-  "version": "0.42.1",
+  "version": "0.44.0",
   "description": "Hivelore embeddings - local semantic ranking for agent briefings and code search",
   "license": "Apache-2.0",
   "repository": {
@@ -22,6 +22,9 @@
     "haive"
   ],
   "type": "module",
+  "engines": {
+    "node": ">=20"
+  },
   "main": "./dist/index.js",
   "types": "./dist/index.d.ts",
   "exports": {
@@ -36,7 +39,7 @@
   ],
   "dependencies": {
     "@xenova/transformers": "^2.17.2",
-    "@hivelore/core": "0.42.1"
+    "@hivelore/core": "0.44.0"
   },
   "overrides": {
     "protobufjs": "^7.5.5"