@theglitchking/semantic-memory 1.6.0 → 1.7.0

package/dist/chunk-R6GNP7DS.js

@@ -0,0 +1,87 @@
+import {
+  redact
+} from "./chunk-H2BES6FU.js";
+
+// src/core/skill-evidence.ts
+import { appendFileSync, existsSync, mkdirSync, readFileSync, renameSync, statSync } from "fs";
+import { dirname, join } from "path";
+var FILES = { usage: "skill-usage.jsonl", failures: "failures.jsonl", corrections: "corrections.jsonl" };
+var stateDir = (repoRoot2) => join(repoRoot2, ".claude", ".semantic-memory");
+var evidencePath = (repoRoot2, kind) => join(stateDir(repoRoot2), FILES[kind]);
+function repoRoot(cwd) {
+  for (let d = cwd; ; d = dirname(d)) {
+    if (existsSync(join(d, ".git"))) return d;
+    if (dirname(d) === d) return cwd;
+  }
+}
+var TEXT_FIELDS = ["command", "error", "excerpt", "prompt"];
+var maxBytes = (env = process.env) => (Number(env.SEMANTIC_MEMORY_SKILL_LOOP_EVIDENCE_MB) || 5) * 1024 * 1024;
+function appendEvidence(root, kind, record, env = process.env) {
+  const path = evidencePath(root, kind);
+  mkdirSync(dirname(path), { recursive: true });
+  try {
+    if (statSync(path).size > maxBytes(env)) renameSync(path, `${path}.1`);
+  } catch {
+  }
+  const out = { ts: (/* @__PURE__ */ new Date()).toISOString(), ...record };
+  for (const k of TEXT_FIELDS) if (typeof out[k] === "string") out[k] = redact(out[k], "broad").text;
+  appendFileSync(path, JSON.stringify(out) + "\n");
+}
+function readEvidence(root, kind) {
+  const out = [];
+  for (const p of [`${evidencePath(root, kind)}.1`, evidencePath(root, kind)]) {
+    let raw = "";
+    try {
+      raw = readFileSync(p, "utf8");
+    } catch {
+      continue;
+    }
+    for (const line of raw.split("\n")) {
+      if (!line.trim()) continue;
+      try {
+        out.push(JSON.parse(line));
+      } catch {
+      }
+    }
+  }
+  return out;
+}
+var cap = (s, n) => String(s ?? "").slice(0, n);
+var failureRecord = (input) => ({
+  session_id: input.session_id ?? null,
+  id: input.tool_use_id ?? null,
+  tool: input.tool_name ?? null,
+  command: cap(typeof input.tool_input?.command === "string" ? input.tool_input.command : JSON.stringify(input.tool_input ?? {}), 500),
+  error: cap(input.error, 1e3)
+});
+var CORRECTION_CUES = [
+  ["no", /^\s*(no|nope|nah)\s*([,.!:;]|-|$)/i],
+  ["wrong", /^\s*(wrong|incorrect)\b|\bthat'?s (wrong|not right|incorrect|not what)\b/i],
+  ["not-what-i", /\bnot what i (asked|meant|wanted|said)\b/i],
+  ["instead", /\b(use|do|run|try|call)\b[^.?!]{0,40}\binstead\b|^\s*instead\b/i],
+  ["dont", /^\s*don'?t\b|\bdon'?t (do|use|run|touch|change|add|delete|remove|edit|call|push|commit)\b/i],
+  ["you-broke", /\byou (broke|forgot|missed|skipped|ignored)\b/i],
+  ["stop", /^\s*stop\b/i]
+];
+var stripQuoted = (p) => p.replace(/```[\s\S]*?```/g, " ").replace(/`[^`]*`/g, " ").replace(/^>.*$/gm, " ");
+function detectCorrection(prompt) {
+  const text = stripQuoted(prompt);
+  for (const [cue, re] of CORRECTION_CUES) if (re.test(text)) return cue;
+  return null;
+}
+function slashSkill(prompt) {
+  const m = prompt.match(/^\s*\/([a-z0-9][a-z0-9-]*)(\s|$)/);
+  return m ? m[1] : null;
+}
+
+export {
+  stateDir,
+  evidencePath,
+  repoRoot,
+  appendEvidence,
+  readEvidence,
+  failureRecord,
+  detectCorrection,
+  slashSkill
+};
+//# sourceMappingURL=chunk-R6GNP7DS.js.map

package/dist/chunk-R6GNP7DS.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/core/skill-evidence.ts"],"sourcesContent":["/**\n * The skill loop's evidence (v1.7): what the between-session review learns from. Hooks append one line\n * per event when the skill loop is on; nothing here decides anything.\n *\n *   .claude/.semantic-memory/skill-usage.jsonl   {ts, session_id, skill, via: \"tool\" | \"slash\"}\n *   .claude/.semantic-memory/failures.jsonl      {ts, session_id, id, tool, command, error}\n *   .claude/.semantic-memory/corrections.jsonl   {ts, session_id, cue, excerpt}\n *\n * The free-text fields (command, error, excerpt) are redacted (broad: these are logs) before anything is\n * written — ids and names are left alone so records still join up. Each record is capped in size, and each file is\n * rotated to `<file>.1` past SEMANTIC_MEMORY_SKILL_LOOP_EVIDENCE_MB (default 5). Standalone for hooks.\n */\nimport { appendFileSync, existsSync, mkdirSync, readFileSync, renameSync, statSync } from \"node:fs\";\nimport { dirname, join } from \"node:path\";\nimport { redact } from \"./redact.js\";\n\nexport type EvidenceKind = \"usage\" | \"failures\" | \"corrections\";\nconst FILES: Record<EvidenceKind, string> = { usage: \"skill-usage.jsonl\", failures: \"failures.jsonl\", corrections: \"corrections.jsonl\" };\n\nexport const stateDir = (repoRoot: string) => join(repoRoot, \".claude\", \".semantic-memory\");\nexport const evidencePath = (repoRoot: string, kind: EvidenceKind) => join(stateDir(repoRoot), FILES[kind]);\n\n/** The repo a hook's cwd belongs to: the nearest ancestor holding .git, else the cwd itself. */\nexport function repoRoot(cwd: string): string {\n  for (let d = cwd; ; d = dirname(d)) {\n    if (existsSync(join(d, \".git\"))) return d;\n    if (dirname(d) === d) return cwd;\n  }\n}\n\n// broad redaction would also mask session and tool-use ids (long mixed tokens): only free text is redacted\nconst TEXT_FIELDS = [\"command\", \"error\", \"excerpt\", \"prompt\"];\nconst maxBytes = (env = process.env) => (Number(env.SEMANTIC_MEMORY_SKILL_LOOP_EVIDENCE_MB) || 5) * 1024 * 1024;\n\nexport function appendEvidence(root: string, kind: EvidenceKind, record: Record<string, unknown>, env = process.env): void {\n  const path = evidencePath(root, kind);\n  mkdirSync(dirname(path), { recursive: true });\n  try {\n    if (statSync(path).size > maxBytes(env)) renameSync(path, `${path}.1`);\n  } catch {}\n  const out: Record<string, unknown> = { ts: new Date().toISOString(), ...record };\n  for (const k of TEXT_FIELDS) if (typeof out[k] === \"string\") out[k] = redact(out[k] as string, \"broad\").text;\n  appendFileSync(path, JSON.stringify(out) + \"\\n\");\n}\n\nexport function readEvidence<T = Record<string, any>>(root: string, kind: EvidenceKind): T[] {\n  const out: T[] = [];\n  for (const p of [`${evidencePath(root, kind)}.1`, evidencePath(root, kind)]) {\n    let raw = \"\";\n    try {\n      raw = readFileSync(p, \"utf8\");\n    } catch {\n      continue;\n    }\n    for (const line of raw.split(\"\\n\")) {\n      if (!line.trim()) continue;\n      try {\n        out.push(JSON.parse(line));\n      } catch {}\n    }\n  }\n  return out;\n}\n\nconst cap = (s: unknown, n: number) => String(s ?? \"\").slice(0, n);\n\nexport const failureRecord = (input: { session_id?: string; tool_use_id?: string; tool_name?: string; tool_input?: any; error?: string }) => ({\n  session_id: input.session_id ?? null,\n  id: input.tool_use_id ?? null,\n  tool: input.tool_name ?? null,\n  command: cap(typeof input.tool_input?.command === \"string\" ? input.tool_input.command : JSON.stringify(input.tool_input ?? {}), 500),\n  error: cap(input.error, 1000),\n});\n\n// A correction: the user telling the agent it got something wrong. Only these cues, so ordinary\n// prompts (\"I don't know why…\", \"no rush\") do not count.\nconst CORRECTION_CUES: [string, RegExp][] = [\n  [\"no\", /^\\s*(no|nope|nah)\\s*([,.!:;]|-|$)/i],\n  [\"wrong\", /^\\s*(wrong|incorrect)\\b|\\bthat'?s (wrong|not right|incorrect|not what)\\b/i],\n  [\"not-what-i\", /\\bnot what i (asked|meant|wanted|said)\\b/i],\n  [\"instead\", /\\b(use|do|run|try|call)\\b[^.?!]{0,40}\\binstead\\b|^\\s*instead\\b/i],\n  [\"dont\", /^\\s*don'?t\\b|\\bdon'?t (do|use|run|touch|change|add|delete|remove|edit|call|push|commit)\\b/i],\n  [\"you-broke\", /\\byou (broke|forgot|missed|skipped|ignored)\\b/i],\n  [\"stop\", /^\\s*stop\\b/i],\n];\n\n/** Fenced code, inline code and quoted lines are machinery, not the user talking. */\nconst stripQuoted = (p: string) => p.replace(/```[\\s\\S]*?```/g, \" \").replace(/`[^`]*`/g, \" \").replace(/^>.*$/gm, \" \");\n\nexport function detectCorrection(prompt: string): string | null {\n  const text = stripQuoted(prompt);\n  for (const [cue, re] of CORRECTION_CUES) if (re.test(text)) return cue;\n  return null;\n}\n\n/** `/name …` typed by the user: Claude Code runs the skill without a Skill tool call, so PostToolUse never sees it. */\nexport function slashSkill(prompt: string): string | null {\n  const m = prompt.match(/^\\s*\\/([a-z0-9][a-z0-9-]*)(\\s|$)/);\n  return m ? m[1] : null;\n}\n"],"mappings":";;;;;AAYA,SAAS,gBAAgB,YAAY,WAAW,cAAc,YAAY,gBAAgB;AAC1F,SAAS,SAAS,YAAY;AAI9B,IAAM,QAAsC,EAAE,OAAO,qBAAqB,UAAU,kBAAkB,aAAa,oBAAoB;AAEhI,IAAM,WAAW,CAACA,cAAqB,KAAKA,WAAU,WAAW,kBAAkB;AACnF,IAAM,eAAe,CAACA,WAAkB,SAAuB,KAAK,SAASA,SAAQ,GAAG,MAAM,IAAI,CAAC;AAGnG,SAAS,SAAS,KAAqB;AAC5C,WAAS,IAAI,OAAO,IAAI,QAAQ,CAAC,GAAG;AAClC,QAAI,WAAW,KAAK,GAAG,MAAM,CAAC,EAAG,QAAO;AACxC,QAAI,QAAQ,CAAC,MAAM,EAAG,QAAO;AAAA,EAC/B;AACF;AAGA,IAAM,cAAc,CAAC,WAAW,SAAS,WAAW,QAAQ;AAC5D,IAAM,WAAW,CAAC,MAAM,QAAQ,SAAS,OAAO,IAAI,sCAAsC,KAAK,KAAK,OAAO;AAEpG,SAAS,eAAe,MAAc,MAAoB,QAAiC,MAAM,QAAQ,KAAW;AACzH,QAAM,OAAO,aAAa,MAAM,IAAI;AACpC,YAAU,QAAQ,IAAI,GAAG,EAAE,WAAW,KAAK,CAAC;AAC5C,MAAI;AACF,QAAI,SAAS,IAAI,EAAE,OAAO,SAAS,GAAG,EAAG,YAAW,MAAM,GAAG,IAAI,IAAI;AAAA,EACvE,QAAQ;AAAA,EAAC;AACT,QAAM,MAA+B,EAAE,KAAI,oBAAI,KAAK,GAAE,YAAY,GAAG,GAAG,OAAO;AAC/E,aAAW,KAAK,YAAa,KAAI,OAAO,IAAI,CAAC,MAAM,SAAU,KAAI,CAAC,IAAI,OAAO,IAAI,CAAC,GAAa,OAAO,EAAE;AACxG,iBAAe,MAAM,KAAK,UAAU,GAAG,IAAI,IAAI;AACjD;AAEO,SAAS,aAAsC,MAAc,MAAyB;AAC3F,QAAM,MAAW,CAAC;AAClB,aAAW,KAAK,CAAC,GAAG,aAAa,MAAM,IAAI,CAAC,MAAM,aAAa,MAAM,IAAI,CAAC,GAAG;AAC3E,QAAI,MAAM;AACV,QAAI;AACF,YAAM,aAAa,GAAG,MAAM;AAAA,IAC9B,QAAQ;AACN;AAAA,IACF;AACA,eAAW,QAAQ,IAAI,MAAM,IAAI,GAAG;AAClC,UAAI,CAAC,KAAK,KAAK,EAAG;AAClB,UAAI;AACF,YAAI,KAAK,KAAK,MAAM,IAAI,CAAC;AAAA,MAC3B,QAAQ;AAAA,MAAC;AAAA,IACX;AAAA,EACF;AACA,SAAO;AACT;AAEA,IAAM,MAAM,CAAC,GAAY,MAAc,OAAO,KAAK,EAAE,EAAE,MAAM,GAAG,CAAC;AAE1D,IAAM,gBAAgB,CAAC,WAAgH;AAAA,EAC5I,YAAY,MAAM,cAAc;AAAA,EAChC,IAAI,MAAM,eAAe;AAAA,EACzB,MAAM,MAAM,aAAa;AAAA,EACzB,SAAS,IAAI,OAAO,MAAM,YAAY,YAAY,WAAW,MAAM,WAAW,UAAU,KAAK,UAAU,MAAM,cAAc,CAAC,CAAC,GAAG,GAAG;AAAA,EACnI,OAAO,IAAI,MAAM,OAAO,GAAI;AAC9B;AAIA,IAAM,kBAAsC;AAAA,EAC1C,CAAC,MAAM,oCAAoC;AAAA,EAC3C,CAAC,SAAS,2EAA2E;AAAA,EACrF,CAAC,cAAc,2CAA2C;AAAA,EAC1D,CAAC,WAAW,iEAAiE;AAAA,EAC7E,CAAC,QAAQ,4FAA4F;AAAA,EACrG,CAAC,aAAa,gDAAgD;AAAA,EAC9D,CAAC,QAAQ,aAAa;AACxB;AAGA,IAAM,cAAc,CAAC,MAAc,EAAE,QAAQ,mBAAmB,GAAG,EAAE,QAAQ,YAAY,GAAG,EAAE,QAAQ,WAAW,GAAG;AAE7G,SAAS,iBAAiB,QAA+B;AAC9D,QAAM,OAAO,YAAY,MAAM;AAC/B,aAAW,CAAC,KAAK,EAAE,KAAK,gBAAiB,KAAI,GAAG,KAAK,IAAI,EAAG,QAAO;AACnE,SAAO;AACT;AAGO,SAAS,WAAW,QAA+B;AACxD,QAAM,IAAI,OAAO,MAAM,kCAAkC;AACzD,SAAO,IAAI,EAAE,CAAC,IAAI;AACpB;","names":["repoRoot"]}

package/dist/{chunk-44BQDRXD.js → chunk-SHSOCFJH.js}

@@ -73,6 +73,9 @@ var Embedder = class {
     this.ort = ort;
     this.runtimeLabel = label;
     let useQuantized = this.quantized;
+    if (useQuantized && !existsSync(join(modelDir, "model_quantized.onnx")) && existsSync(join(modelDir, "model.onnx"))) {
+      useQuantized = false;
+    }
     const modelFileName = useQuantized ? "model_quantized.onnx" : "model.onnx";
     this.modelPath = join(modelDir, modelFileName);
     const modelPath = this.modelPath;
@@ -648,4 +651,4 @@ export {
   VectorIndex,
   TextSearch
 };
-//# sourceMappingURL=chunk-44BQDRXD.js.map
+//# sourceMappingURL=chunk-SHSOCFJH.js.map

package/dist/chunk-SHSOCFJH.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/core/embedder.ts","../src/core/graph.ts","../src/core/vector.ts","../src/core/search-text.ts"],"sourcesContent":["import { AutoTokenizer } from \"@huggingface/transformers\";\nimport { readFile, writeFile, mkdir, rename, unlink } from \"node:fs/promises\";\nimport { join, dirname } from \"node:path\";\nimport { existsSync, createWriteStream } from \"node:fs\";\nimport { homedir } from \"node:os\";\nimport { Readable } from \"node:stream\";\nimport { pipeline as streamPipeline } from \"node:stream/promises\";\nimport { Worker } from \"node:worker_threads\";\nimport { fileURLToPath } from \"node:url\";\n\n// MiniLM-L6-v2 is the default: ~3 min to index 2,853 chunks on CPU vs ~16 min for nomic.\n// nomic-embed-text-v1.5 gives higher quality embeddings but is much slower on CPU.\nconst DEFAULT_MODEL = \"sentence-transformers/all-MiniLM-L6-v2\";\nconst CACHE_DIR = join(homedir(), \".semantic-sidekick\", \"models\");\n// Default to 1 worker (serial). Worker threads only help on memory-rich machines\n// (each worker loads its own ONNX session). On typical dev machines\n// with <4 GB free RAM, parallel workers cause swap thrashing and are slower.\n// Enable with --workers N when you have sufficient RAM.\nconst DEFAULT_WORKERS = 1;\n// batch=16 is optimal for MiniLM on CPU (short sequences, low padding waste).\n// For larger models (nomic 768d), batch=1 is faster due to padding overhead.\nconst DEFAULT_BATCH_SIZE = 16;\n// Quantized ONNX: faster on CPU but not all models have a quantized variant.\n// MiniLM fp32 is already fast enough; nomic benefits from quantized.\n// Falls back to fp32 automatically if quantized file is not available.\nconst DEFAULT_QUANTIZED = false;\n\n// Full-precision ONNX model subpaths\nconst ONNX_MODEL_PATHS: Record<string, string> = {\n  \"nomic-ai/nomic-embed-text-v1.5\": \"onnx/model.onnx\",\n  \"sentence-transformers/all-MiniLM-L6-v2\": \"onnx/model.onnx\",\n};\n\n// Quantized (int8) ONNX model subpaths — faster on CPU, ~same quality\nconst ONNX_QUANTIZED_MODEL_PATHS: Record<string, string> = {\n  \"nomic-ai/nomic-embed-text-v1.5\": \"onnx/model_quantized.onnx\",\n  \"sentence-transformers/all-MiniLM-L6-v2\": \"onnx/model_quantized.onnx\",\n};\n\ninterface OrtSession {\n  run(feeds: Record<string, unknown>): Promise<Record<string, { data: Float32Array; dims: number[] }>>;\n  inputNames: string[];\n  outputNames: string[];\n}\n\ninterface OrtModule {\n  InferenceSession: {\n    create(path: string, options?: Record<string, unknown>): Promise<OrtSession>;\n  };\n  Tensor: new (type: string, data: ArrayLike<number | bigint>, dims: number[]) => unknown;\n}\n\ntype RuntimeLabel = \"native\" | \"wasm\";\n\nasync function resolveOnnxRuntime(): Promise<{ ort: OrtModule; label: RuntimeLabel }> {\n  try {\n    const ort = await import(\"onnxruntime-node\");\n    return { ort: ort as unknown as OrtModule, label: \"native\" };\n  } catch {\n    const ort = await import(\"onnxruntime-web\");\n    return { ort: ort as unknown as OrtModule, label: \"wasm\" };\n  }\n}\n\n// Download to a process-unique temp file, then atomically rename onto the\n// final path. Two concurrent downloaders won't corrupt each other's partial\n// writes — the worst case is one wasted download (rename is last-writer-wins\n// but each rename installs a complete, valid file). Without this, multiple\n// processes calling Embedder.init() against the same cache (e.g. parallel\n// vitest workers, or multiple semantic-sidekick servers on a fresh install) race\n// on a single shared writeStream and produce a corrupt ONNX file that fails\n// Protobuf parsing on load.\nasync function downloadFile(url: string, destPath: string): Promise<void> {\n  const response = await fetch(url);\n  if (!response.ok) throw new Error(`Download failed (${response.status}): ${url}`);\n  if (!response.body) throw new Error(`No response body: ${url}`);\n  const tempPath = `${destPath}.${process.pid}.${Date.now()}.tmp`;\n  try {\n    const fileStream = createWriteStream(tempPath);\n    await streamPipeline(Readable.fromWeb(response.body as never), fileStream);\n    await rename(tempPath, destPath);\n  } catch (err) {\n    try { await unlink(tempPath); } catch { /* temp may not exist */ }\n    throw err;\n  }\n}\n\nexport class Embedder {\n  private model: string;\n  private session: OrtSession | null = null;\n  private tokenizer: Awaited<ReturnType<typeof AutoTokenizer.from_pretrained>> | null = null;\n  private ort: OrtModule | null = null;\n  private dimensions = 0;\n  private runtimeLabel: RuntimeLabel = \"wasm\";\n  private initialized = false;\n  private numWorkers: number;\n  private batchSize: number;\n  private quantized: boolean;\n  private modelPath = \"\";\n\n  constructor(\n    model: string = DEFAULT_MODEL,\n    numWorkers: number = DEFAULT_WORKERS,\n    batchSize: number = DEFAULT_BATCH_SIZE,\n    quantized: boolean = DEFAULT_QUANTIZED\n  ) {\n    this.model = model;\n    this.numWorkers = numWorkers;\n    this.batchSize = batchSize;\n    this.quantized = quantized;\n  }\n\n  async init(): Promise<void> {\n    if (this.initialized) return;\n\n    const modelDir = join(CACHE_DIR, this.model.replace(/\\//g, \"--\"));\n    await mkdir(modelDir, { recursive: true });\n\n    // Resolve ONNX runtime (native C++ or WASM fallback)\n    const { ort, label } = await resolveOnnxRuntime();\n    this.ort = ort;\n    this.runtimeLabel = label;\n\n    // Download ONNX model if not cached. Tries quantized first if requested,\n    // falls back to fp32 if the quantized file is not available for this model.\n    let useQuantized = this.quantized;\n    // a model without a quantized file (MiniLM) leaves only model.onnx cached: use it, or every start re-downloads it (and fails offline)\n    if (useQuantized && !existsSync(join(modelDir, \"model_quantized.onnx\")) && existsSync(join(modelDir, \"model.onnx\"))) {\n      useQuantized = false;\n    }\n    const modelFileName = useQuantized ? \"model_quantized.onnx\" : \"model.onnx\";\n    this.modelPath = join(modelDir, modelFileName);\n    const modelPath = this.modelPath;\n    if (!existsSync(modelPath)) {\n      const pathMap = useQuantized ? ONNX_QUANTIZED_MODEL_PATHS : ONNX_MODEL_PATHS;\n      const onnxSubpath = pathMap[this.model] ?? (useQuantized ? \"onnx/model_quantized.onnx\" : \"onnx/model.onnx\");\n      const url = `https://huggingface.co/${this.model}/resolve/main/${onnxSubpath}`;\n      process.stderr.write(`Downloading ONNX model: ${this.model} (${useQuantized ? \"quantized\" : \"fp32\"})...\\n`);\n      try {\n        await downloadFile(url, modelPath);\n      } catch (err: any) {\n        if (useQuantized && err?.message?.includes(\"404\")) {\n          // Quantized not available for this model — fall back to fp32\n          process.stderr.write(`Quantized model not available, falling back to fp32\\n`);\n          useQuantized = false;\n          this.modelPath = join(modelDir, \"model.onnx\");\n          const fp32Subpath = ONNX_MODEL_PATHS[this.model] ?? \"onnx/model.onnx\";\n          const fp32Url = `https://huggingface.co/${this.model}/resolve/main/${fp32Subpath}`;\n          process.stderr.write(`Downloading ONNX model: ${this.model} (fp32)...\\n`);\n          await downloadFile(fp32Url, this.modelPath);\n        } else {\n          throw err;\n        }\n      }\n      process.stderr.write(`Model downloaded to ${modelDir}\\n`);\n    }\n    // Load tokenizer (uses HF transformers tokenizer infrastructure)\n    this.tokenizer = await AutoTokenizer.from_pretrained(this.model, {\n      cache_dir: CACHE_DIR,\n    });\n\n    // Create ONNX inference session (use this.modelPath — may have been updated by fallback)\n    this.session = await ort.InferenceSession.create(this.modelPath, {\n      executionProviders: [label === \"native\" ? \"cpu\" : \"wasm\"],\n    });\n\n    // Determine dimensions from a test embedding\n    const test = await this.embed(\"test\");\n    this.dimensions = test.length;\n    this.initialized = true;\n\n    const modelShort = this.model.split(\"/\").pop() ?? this.model;\n    process.stderr.write(`Embedder ready (${modelShort}, ${label}, ${this.dimensions}d, batch=${this.batchSize})\\n`);\n  }\n\n  async embed(text: string): Promise<Float32Array> {\n    if (!this.session || !this.tokenizer || !this.ort)\n      throw new Error(\"Embedder not initialized. Call init() first.\");\n\n    // Tokenize\n    const encoded = await this.tokenizer(text, {\n      padding: true,\n      truncation: true,\n      max_length: 512,\n      return_tensor: false,\n    });\n\n    const inputIdsRaw: number[] = Array.from(encoded.input_ids);\n    const attentionMaskRaw: number[] = Array.from(encoded.attention_mask);\n    const seqLen = inputIdsRaw.length;\n\n    // Build ONNX input tensors (most models expect int64)\n    const inputIds = new this.ort.Tensor(\n      \"int64\",\n      BigInt64Array.from(inputIdsRaw.map(BigInt)),\n      [1, seqLen]\n    );\n    const attentionMask = new this.ort.Tensor(\n      \"int64\",\n      BigInt64Array.from(attentionMaskRaw.map(BigInt)),\n      [1, seqLen]\n    );\n\n    const feeds: Record<string, unknown> = { input_ids: inputIds, attention_mask: attentionMask };\n\n    // Some models need token_type_ids\n    if (this.session.inputNames.includes(\"token_type_ids\")) {\n      feeds.token_type_ids = new this.ort.Tensor(\n        \"int64\",\n        new BigInt64Array(seqLen),\n        [1, seqLen]\n      );\n    }\n\n    // Run inference\n    const output = await this.session.run(feeds);\n    const outputTensor = output[this.session.outputNames[0]];\n    const hiddenSize = outputTensor.dims[outputTensor.dims.length - 1];\n\n    // Mean pooling with attention mask + L2 normalization\n    return this.meanPoolAndNormalize(outputTensor.data, attentionMaskRaw, seqLen, hiddenSize);\n  }\n\n  private meanPoolAndNormalize(\n    embeddings: Float32Array,\n    attentionMask: number[],\n    seqLen: number,\n    hiddenSize: number\n  ): Float32Array {\n    const result = new Float32Array(hiddenSize);\n    let maskSum = 0;\n\n    for (let t = 0; t < seqLen; t++) {\n      const mask = attentionMask[t];\n      maskSum += mask;\n      const offset = t * hiddenSize;\n      for (let d = 0; d < hiddenSize; d++) {\n        result[d] += embeddings[offset + d] * mask;\n      }\n    }\n\n    if (maskSum > 0) {\n      for (let d = 0; d < hiddenSize; d++) result[d] /= maskSum;\n    }\n\n    // L2 normalize\n    let norm = 0;\n    for (let d = 0; d < hiddenSize; d++) norm += result[d] * result[d];\n    norm = Math.sqrt(norm);\n    if (norm > 0) {\n      for (let d = 0; d < hiddenSize; d++) result[d] /= norm;\n    }\n\n    return result;\n  }\n\n  // Mean pool + L2 normalize the output of a batched ONNX forward pass.\n  // outputData: flat Float32Array of shape [batchSize, seqLen, hiddenSize]\n  // maskData:   flat number[] of shape [batchSize, seqLen]\n  private meanPoolAndNormalizeMany(\n    outputData: Float32Array,\n    maskData: number[],\n    batchSize: number,\n    seqLen: number,\n    hiddenSize: number\n  ): Float32Array[] {\n    const results: Float32Array[] = [];\n    for (let b = 0; b < batchSize; b++) {\n      const result = new Float32Array(hiddenSize);\n      let maskSum = 0;\n      for (let t = 0; t < seqLen; t++) {\n        const mask = maskData[b * seqLen + t];\n        maskSum += mask;\n        const offset = (b * seqLen + t) * hiddenSize;\n        for (let d = 0; d < hiddenSize; d++) {\n          result[d] += outputData[offset + d] * mask;\n        }\n      }\n      if (maskSum > 0) {\n        for (let d = 0; d < hiddenSize; d++) result[d] /= maskSum;\n      }\n      // L2 normalize\n      let norm = 0;\n      for (let d = 0; d < hiddenSize; d++) norm += result[d] * result[d];\n      norm = Math.sqrt(norm);\n      if (norm > 0) {\n        for (let d = 0; d < hiddenSize; d++) result[d] /= norm;\n      }\n      results.push(result);\n    }\n    return results;\n  }\n\n  // Embed a sub-batch of texts (length <= batchSize) in a single ONNX forward pass.\n  //\n  // Tokenizes each text individually (well-defined output format for all HF versions),\n  // then manually pads to the longest sequence in the batch and builds a [n, seqLen]\n  // tensor for one ONNX call. The speedup is from batching the ONNX inference —\n  // individual tokenization is negligible (<1ms each).\n  private async embedSubBatch(texts: string[]): Promise<Float32Array[]> {\n    if (!this.session || !this.tokenizer || !this.ort)\n      throw new Error(\"Embedder not initialized. Call init() first.\");\n\n    const n = texts.length;\n\n    // Tokenize each text individually — avoids ambiguous batch tokenizer output format\n    const encodings = await Promise.all(\n      texts.map((text) =>\n        this.tokenizer!(text, {\n          padding: false,\n          truncation: true,\n          max_length: 512,\n          return_tensor: false,\n        })\n      )\n    );\n\n    // Extract flat token arrays and find max sequence length for this batch\n    const tokenized = encodings.map((enc) => ({\n      ids: Array.from(enc.input_ids) as number[],\n      mask: Array.from(enc.attention_mask) as number[],\n    }));\n    const seqLen = Math.max(...tokenized.map((t) => t.ids.length));\n\n    // Build flat padded tensors [n * seqLen] — pad with 0 (PAD token, zero attention)\n    const flatIds = new BigInt64Array(n * seqLen);\n    const flatMask = new BigInt64Array(n * seqLen);\n    const flatMaskNums = new Array<number>(n * seqLen).fill(0);\n\n    for (let i = 0; i < n; i++) {\n      const { ids, mask } = tokenized[i];\n      for (let j = 0; j < ids.length; j++) {\n        flatIds[i * seqLen + j] = BigInt(ids[j]);\n        flatMask[i * seqLen + j] = BigInt(mask[j]);\n        flatMaskNums[i * seqLen + j] = mask[j];\n      }\n      // Positions beyond ids.length remain 0 (padding)\n    }\n\n    // Build batched ONNX tensors [n, seqLen]\n    const inputIds = new this.ort.Tensor(\"int64\", flatIds, [n, seqLen]);\n    const attentionMask = new this.ort.Tensor(\"int64\", flatMask, [n, seqLen]);\n\n    const feeds: Record<string, unknown> = { input_ids: inputIds, attention_mask: attentionMask };\n\n    if (this.session.inputNames.includes(\"token_type_ids\")) {\n      feeds.token_type_ids = new this.ort.Tensor(\n        \"int64\",\n        new BigInt64Array(n * seqLen),\n        [n, seqLen]\n      );\n    }\n\n    // Single forward pass → output shape [n, seqLen, hiddenSize]\n    const output = await this.session.run(feeds);\n    const outputTensor = output[this.session.outputNames[0]];\n    const hiddenSize = outputTensor.dims[outputTensor.dims.length - 1];\n\n    return this.meanPoolAndNormalizeMany(\n      outputTensor.data,\n      flatMaskNums,\n      n,\n      seqLen,\n      hiddenSize\n    );\n  }\n\n  async embedBatch(\n    texts: string[],\n    onProgress?: (embedded: number, total: number, subBatch?: Float32Array[]) => Promise<void> | void\n  ): Promise<Float32Array[]> {\n    // Workers path (disabled by default; kept for --workers N users)\n    if (this.numWorkers > 1 && texts.length >= this.numWorkers * 2) {\n      return this.embedBatchParallel(texts, onProgress);\n    }\n\n    // True batched inference: slice into sub-batches and run one ONNX call each\n    const results: Float32Array[] = [];\n    for (let i = 0; i < texts.length; i += this.batchSize) {\n      const subBatch = texts.slice(i, i + this.batchSize);\n      const embeddings = await this.embedSubBatch(subBatch);\n      results.push(...embeddings);\n      await onProgress?.(Math.min(i + subBatch.length, texts.length), texts.length, embeddings);\n    }\n    return results;\n  }\n\n  private async embedBatchParallel(\n    texts: string[],\n    onProgress?: (embedded: number, total: number, subBatch?: Float32Array[]) => Promise<void> | void\n  ): Promise<Float32Array[]> {\n    // Resolve worker script path. With tsup splitting, embedder code may land\n    // in a top-level chunk (dist/chunk-*.js) rather than dist/core/index.js,\n    // so we try two locations: adjacent to this chunk, and dist/core/ relative\n    // to the package root (two levels up from a dist/ chunk file).\n    const thisDir = dirname(fileURLToPath(import.meta.url));\n    let workerPath = join(thisDir, \"embed-worker.js\");\n    if (!existsSync(workerPath)) {\n      // Chunk file at dist/ level — worker is in dist/core/\n      workerPath = join(thisDir, \"core\", \"embed-worker.js\");\n    }\n\n    if (!existsSync(workerPath)) {\n      // Fallback to serial batched if worker script not found\n      process.stderr.write(\"Worker script not found, falling back to batched embedding\\n\");\n      return this.embedBatch(texts, onProgress);\n    }\n\n    // Split texts into chunks for each worker\n    const chunkSize = Math.ceil(texts.length / this.numWorkers);\n    const chunks: { texts: string[]; startIndex: number }[] = [];\n    for (let i = 0; i < texts.length; i += chunkSize) {\n      chunks.push({ texts: texts.slice(i, i + chunkSize), startIndex: i });\n    }\n\n    const allResults = new Array<Float32Array>(texts.length);\n    let totalDone = 0;\n\n    const workerPromises = chunks.map((chunk) => {\n      return new Promise<void>((resolve, reject) => {\n        const worker = new Worker(workerPath, {\n          workerData: {\n            modelPath: this.modelPath,\n            modelName: this.model,\n            cacheDir: CACHE_DIR,\n            runtimeLabel: this.runtimeLabel,\n            batchSize: this.batchSize,\n          },\n        });\n\n        worker.on(\"message\", (msg: any) => {\n          if (msg.type === \"ready\") {\n            worker.postMessage({ type: \"embed\", texts: chunk.texts, startIndex: chunk.startIndex });\n          } else if (msg.type === \"progress\") {\n            totalDone++;\n            onProgress?.(totalDone, texts.length);\n          } else if (msg.type === \"result\") {\n            for (let i = 0; i < msg.embeddings.length; i++) {\n              allResults[chunk.startIndex + i] = new Float32Array(msg.embeddings[i]);\n            }\n            worker.terminate();\n            resolve();\n          } else if (msg.type === \"error\") {\n            worker.terminate();\n            reject(new Error(msg.error));\n          }\n        });\n\n        worker.on(\"error\", (err) => {\n          worker.terminate();\n          reject(err);\n        });\n      });\n    });\n\n    await Promise.all(workerPromises);\n    return allResults;\n  }\n\n  getDimensions(): number {\n    return this.dimensions;\n  }\n\n  getModel(): string {\n    return this.model;\n  }\n\n  getRuntime(): RuntimeLabel {\n    return this.runtimeLabel;\n  }\n\n  async saveEmbeddings(\n    embeddings: Map<string, Float32Array>,\n    indexPath: string\n  ): Promise<void> {\n    const entries: Array<{ key: string; data: number[] }> = [];\n    for (const [key, vec] of embeddings) {\n      entries.push({ key, data: Array.from(vec) });\n    }\n    await writeFile(join(indexPath, \"embeddings.json\"), JSON.stringify(entries));\n  }\n\n  async loadEmbeddings(\n    indexPath: string\n  ): Promise<Map<string, Float32Array>> {\n    const filePath = join(indexPath, \"embeddings.json\");\n    if (!existsSync(filePath)) return new Map();\n\n    const raw = await readFile(filePath, \"utf-8\");\n    const entries: Array<{ key: string; data: number[] }> = JSON.parse(raw);\n    const map = new Map<string, Float32Array>();\n    for (const entry of entries) {\n      map.set(entry.key, new Float32Array(entry.data));\n    }\n    return map;\n  }\n}\n","import Graph from \"graphology\";\nimport { bfsFromNode } from \"graphology-traversal\";\nimport { bidirectional } from \"graphology-shortest-path\";\nimport type { IndexedDocument, GraphNode, GraphEdge, GraphStats } from \"./types.js\";\nimport { readFile, writeFile } from \"node:fs/promises\";\nimport { join } from \"node:path\";\nimport { existsSync } from \"node:fs\";\n\n/**\n * Tags shared by more than this many docs are too generic to be meaningful\n * graph edges (e.g. \"api\", \"testing\"). Only specific/rare tags create edges.\n * Docs without frontmatter are unaffected — their inline #tags still participate\n * but only if those tags are specific enough to pass this threshold.\n */\nconst TAG_EDGE_MAX_DOCS = 15;\n\nexport class GraphBuilder {\n  private graph: Graph;\n\n  constructor() {\n    this.graph = new Graph({ type: \"directed\", multi: false });\n  }\n\n  buildFromDocuments(documents: IndexedDocument[]): void {\n    this.graph.clear();\n\n    // Add nodes — store optional metadata fields when present\n    for (const doc of documents) {\n      this.graph.addNode(doc.path, {\n        title: doc.title,\n        tags: doc.tags,\n        ...(doc.status !== undefined && { status: doc.status }),\n        ...(doc.loadPriority !== undefined && { loadPriority: doc.loadPriority }),\n      });\n    }\n\n    const pathLookup = new Map<string, string>();\n    for (const doc of documents) {\n      const nameNoExt = doc.path.replace(/\\.md$/, \"\");\n      const basename = nameNoExt.split(\"/\").pop()!;\n      pathLookup.set(basename.toLowerCase(), doc.path);\n      pathLookup.set(nameNoExt.toLowerCase(), doc.path);\n    }\n\n    // Add wikilink edges (weight 1.0)\n    for (const doc of documents) {\n      for (const link of doc.wikilinks) {\n        const target = pathLookup.get(link.toLowerCase());\n        if (target && target !== doc.path && !this.graph.hasEdge(doc.path, target)) {\n          this.graph.addEdge(doc.path, target, { type: \"wikilink\", weight: 1.0 });\n        }\n      }\n    }\n\n    // Add related_docs edges (weight 1.0) — only present when frontmatter has related_docs\n    // Falls back gracefully: docs without this field are simply skipped\n    for (const doc of documents) {\n      if (!doc.relatedDocs?.length) continue;\n      for (const ref of doc.relatedDocs) {\n        // Try full normalized path first, then basename — same strategy as wikilinks\n        const normalized = ref.replace(/\\.md$/, \"\").toLowerCase();\n        const base = normalized.split(\"/\").pop()!;\n        const target = pathLookup.get(normalized) ?? pathLookup.get(base);\n        if (target && target !== doc.path && !this.graph.hasEdge(doc.path, target)) {\n          this.graph.addEdge(doc.path, target, { type: \"related\", weight: 1.0 });\n        }\n      }\n    }\n\n    // Add tag-based edges (weight 0.5) — capped at TAG_EDGE_MAX_DOCS per tag.\n    // Generic tags shared by many docs (e.g. \"api\", \"testing\") create noise;\n    // only specific tags (e.g. \"qdrant\", \"celery\") create meaningful connections.\n    const tagToNotes = new Map<string, string[]>();\n    for (const doc of documents) {\n      for (const tag of doc.tags) {\n        const notes = tagToNotes.get(tag) ?? [];\n        notes.push(doc.path);\n        tagToNotes.set(tag, notes);\n      }\n    }\n\n    for (const [, notes] of tagToNotes) {\n      if (notes.length >= TAG_EDGE_MAX_DOCS) continue; // too generic — skip\n      for (let i = 0; i < notes.length; i++) {\n        for (let j = i + 1; j < notes.length; j++) {\n          if (!this.graph.hasEdge(notes[i], notes[j])) {\n            this.graph.addEdge(notes[i], notes[j], { type: \"tag\", weight: 0.5 });\n          }\n          if (!this.graph.hasEdge(notes[j], notes[i])) {\n            this.graph.addEdge(notes[j], notes[i], { type: \"tag\", weight: 0.5 });\n          }\n        }\n      }\n    }\n  }\n\n  backlinks(notePath: string): GraphNode[] {\n    if (!this.graph.hasNode(notePath)) return [];\n    return this.graph.inNeighbors(notePath).map((n) => this.nodeToGraphNode(n));\n  }\n\n  forwardlinks(notePath: string): GraphNode[] {\n    if (!this.graph.hasNode(notePath)) return [];\n    return this.graph.outNeighbors(notePath).map((n) => this.nodeToGraphNode(n));\n  }\n\n  findPath(from: string, to: string): string[] | null {\n    if (!this.graph.hasNode(from) || !this.graph.hasNode(to)) return null;\n    const path = bidirectional(this.graph, from, to);\n    return path;\n  }\n\n  searchGraph(concept: string, maxDepth = 2, limit = 20): GraphNode[] {\n    const lc = concept.toLowerCase();\n\n    const directMatches = new Set<string>(\n      this.graph.nodes().filter((n) => {\n        const attrs = this.graph.getNodeAttributes(n);\n        const title = typeof attrs.title === \"string\" ? attrs.title : String(attrs.title ?? \"\");\n        return (\n          n.toLowerCase().includes(lc) ||\n          title.toLowerCase().includes(lc) ||\n          (attrs.tags as string[] | undefined)?.some((t) => t.toLowerCase().includes(lc))\n        );\n      })\n    );\n\n    const visited = new Set<string>();\n    for (const start of directMatches) {\n      bfsFromNode(this.graph, start, (_node, _attr, depth) => {\n        if (visited.size >= limit * 3) return true; // gather 3x limit before ranking\n        visited.add(_node);\n        return depth >= maxDepth;\n      });\n    }\n\n    // Sort: direct matches first, then by loadPriority desc, then by degree desc\n    // deprecated/archived nodes sort to the end\n    const ranked = [...visited].sort((a, b) => {\n      const aAttrs = this.graph.getNodeAttributes(a);\n      const bAttrs = this.graph.getNodeAttributes(b);\n      const aDeprecated = aAttrs.status === \"deprecated\" || aAttrs.status === \"archived\" ? 1 : 0;\n      const bDeprecated = bAttrs.status === \"deprecated\" || bAttrs.status === \"archived\" ? 1 : 0;\n      if (aDeprecated !== bDeprecated) return aDeprecated - bDeprecated;\n      const aDirect = directMatches.has(a) ? 0 : 1;\n      const bDirect = directMatches.has(b) ? 0 : 1;\n      if (aDirect !== bDirect) return aDirect - bDirect;\n      const aPriority = (aAttrs.loadPriority as number | undefined) ?? 5;\n      const bPriority = (bAttrs.loadPriority as number | undefined) ?? 5;\n      if (aPriority !== bPriority) return bPriority - aPriority;\n      return this.graph.degree(b) - this.graph.degree(a);\n    });\n\n    return ranked.slice(0, limit).map((n) => this.nodeToGraphNode(n));\n  }\n\n  statistics(): GraphStats {\n    const nodes = this.graph.order;\n    const edges = this.graph.size;\n    const orphans = this.graph.nodes().filter(\n      (n) => this.graph.degree(n) === 0\n    );\n\n    const connections = this.graph.nodes().map((n) => ({\n      path: n,\n      connections: this.graph.degree(n),\n    }));\n    connections.sort((a, b) => b.connections - a.connections);\n\n    const maxPossibleEdges = nodes * (nodes - 1);\n    const density = maxPossibleEdges > 0 ? edges / maxPossibleEdges : 0;\n\n    return {\n      totalNodes: nodes,\n      totalEdges: edges,\n      orphanCount: orphans.length,\n      mostConnected: connections.slice(0, 10),\n      density,\n    };\n  }\n\n  private nodeToGraphNode(nodePath: string): GraphNode {\n    const attrs = this.graph.getNodeAttributes(nodePath);\n    return {\n      path: nodePath,\n      title: typeof attrs.title === \"string\" ? attrs.title : nodePath,\n      tags: (attrs.tags as string[]) || [],\n      linkCount: this.graph.outDegree(nodePath),\n      backlinkCount: this.graph.inDegree(nodePath),\n      ...(attrs.loadPriority !== undefined && { loadPriority: attrs.loadPriority as number }),\n      ...(attrs.status !== undefined && { status: attrs.status as string }),\n    };\n  }\n\n  async save(indexPath: string): Promise<void> {\n    const data = this.graph.export();\n    await writeFile(join(indexPath, \"graph.json\"), JSON.stringify(data));\n  }\n\n  async load(indexPath: string): Promise<boolean> {\n    const filePath = join(indexPath, \"graph.json\");\n    if (!existsSync(filePath)) return false;\n\n    const raw = await readFile(filePath, \"utf-8\");\n    const data = JSON.parse(raw);\n    this.graph.import(data);\n    return true;\n  }\n\n  getGraph(): Graph {\n    return this.graph;\n  }\n}\n","import hnswlib from \"hnswlib-node\";\nconst { HierarchicalNSW } = hnswlib;\nimport { readFile, writeFile } from \"node:fs/promises\";\nimport { join } from \"node:path\";\nimport { existsSync } from \"node:fs\";\nimport type { SearchResult } from \"./types.js\";\n\ninterface ChunkMeta {\n  docPath: string;\n  chunkIndex: number;\n  text: string;\n}\n\nexport class VectorIndex {\n  private index: InstanceType<typeof HierarchicalNSW> | null = null;\n  private dimensions: number;\n  private chunkMeta: ChunkMeta[] = [];\n\n  constructor(dimensions: number) {\n    this.dimensions = dimensions;\n  }\n\n  build(\n    embeddings: Float32Array[],\n    meta: ChunkMeta[]\n  ): void {\n    if (embeddings.length === 0) {\n      this.index = null;\n      this.chunkMeta = [];\n      return;\n    }\n\n    this.index = new HierarchicalNSW(\"cosine\", this.dimensions);\n    this.index.initIndex(embeddings.length);\n\n    for (let i = 0; i < embeddings.length; i++) {\n      this.index.addPoint(Array.from(embeddings[i]), i);\n    }\n\n    this.chunkMeta = meta;\n  }\n\n  search(queryEmbedding: Float32Array, k: number = 10): SearchResult[] {\n    if (!this.index || this.chunkMeta.length === 0) return [];\n\n    const numResults = Math.min(k, this.chunkMeta.length);\n    const result = this.index.searchKnn(Array.from(queryEmbedding), numResults);\n\n    const seen = new Set<string>();\n    const results: SearchResult[] = [];\n\n    for (let i = 0; i < result.neighbors.length; i++) {\n      const idx = result.neighbors[i];\n      const meta = this.chunkMeta[idx];\n      if (!meta || seen.has(meta.docPath)) continue;\n      seen.add(meta.docPath);\n\n      results.push({\n        path: meta.docPath,\n        title: meta.docPath,\n        score: 1 - result.distances[i],\n        snippet: meta.text.slice(0, 200),\n        matchedChunk: meta.text,\n      });\n    }\n\n    return results;\n  }\n\n  async save(indexPath: string): Promise<void> {\n    if (!this.index) return;\n\n    this.index.writeIndexSync(join(indexPath, \"hnsw.bin\"));\n    await writeFile(\n      join(indexPath, \"hnsw-meta.json\"),\n      JSON.stringify(this.chunkMeta)\n    );\n  }\n\n  async load(indexPath: string): Promise<boolean> {\n    const hnswPath = join(indexPath, \"hnsw.bin\");\n    const metaPath = join(indexPath, \"hnsw-meta.json\");\n\n    if (!existsSync(hnswPath) || !existsSync(metaPath)) return false;\n\n    const raw = await readFile(metaPath, \"utf-8\");\n    this.chunkMeta = JSON.parse(raw);\n\n    this.index = new HierarchicalNSW(\"cosine\", this.dimensions);\n    this.index.initIndex(this.chunkMeta.length);\n    this.index.readIndexSync(hnswPath);\n\n    return true;\n  }\n\n  getChunkMeta(): ChunkMeta[] {\n    return this.chunkMeta;\n  }\n}\n","import type { IndexedDocument, SearchResult, SearchTextOptions } from \"./types.js\";\nimport { minimatch } from \"minimatch\";\n\nexport class TextSearch {\n  private documents: IndexedDocument[] = [];\n\n  setDocuments(documents: IndexedDocument[]): void {\n    this.documents = documents;\n  }\n\n  search(options: SearchTextOptions): SearchResult[] {\n    const { pattern, regex, caseSensitive, pathGlob, tagFilter, limit = 20 } = options;\n\n    let matcher: (text: string) => { matched: boolean; index: number };\n\n    if (regex) {\n      const flags = caseSensitive ? \"g\" : \"gi\";\n      const re = new RegExp(pattern, flags);\n      matcher = (text) => {\n        re.lastIndex = 0;\n        const m = re.exec(text);\n        return { matched: !!m, index: m?.index ?? -1 };\n      };\n    } else {\n      const needle = caseSensitive ? pattern : pattern.toLowerCase();\n      matcher = (text) => {\n        const haystack = caseSensitive ? text : text.toLowerCase();\n        const idx = haystack.indexOf(needle);\n        return { matched: idx >= 0, index: idx };\n      };\n    }\n\n    const results: SearchResult[] = [];\n\n    for (const doc of this.documents) {\n      // Path filter\n      if (pathGlob && !minimatch(doc.path, pathGlob)) continue;\n\n      // Tag filter\n      if (tagFilter?.length) {\n        const hasTag = tagFilter.some((t) => doc.tags.includes(t));\n        if (!hasTag) continue;\n      }\n\n      const { matched, index } = matcher(doc.content);\n      if (!matched) continue;\n\n      const snippetStart = Math.max(0, index - 80);\n      const snippetEnd = Math.min(doc.content.length, index + 120);\n      const snippet = doc.content.slice(snippetStart, snippetEnd).trim();\n\n      results.push({\n        path: doc.path,\n        title: doc.title,\n        score: 1.0,\n        snippet: (snippetStart > 0 ? \"...\" : \"\") + snippet + (snippetEnd < doc.content.length ? \"...\" : \"\"),\n      });\n\n      if (results.length >= limit) break;\n    }\n\n    return results;\n  }\n}\n"],"mappings":";AAAA,SAAS,qBAAqB;AAC9B,SAAS,UAAU,WAAW,OAAO,QAAQ,cAAc;AAC3D,SAAS,MAAM,eAAe;AAC9B,SAAS,YAAY,yBAAyB;AAC9C,SAAS,eAAe;AACxB,SAAS,gBAAgB;AACzB,SAAS,YAAY,sBAAsB;AAC3C,SAAS,cAAc;AACvB,SAAS,qBAAqB;AAI9B,IAAM,gBAAgB;AACtB,IAAM,YAAY,KAAK,QAAQ,GAAG,sBAAsB,QAAQ;AAKhE,IAAM,kBAAkB;AAGxB,IAAM,qBAAqB;AAI3B,IAAM,oBAAoB;AAG1B,IAAM,mBAA2C;AAAA,EAC/C,kCAAkC;AAAA,EAClC,0CAA0C;AAC5C;AAGA,IAAM,6BAAqD;AAAA,EACzD,kCAAkC;AAAA,EAClC,0CAA0C;AAC5C;AAiBA,eAAe,qBAAuE;AACpF,MAAI;AACF,UAAM,MAAM,MAAM,OAAO,kBAAkB;AAC3C,WAAO,EAAE,KAAkC,OAAO,SAAS;AAAA,EAC7D,QAAQ;AACN,UAAM,MAAM,MAAM,OAAO,iBAAiB;AAC1C,WAAO,EAAE,KAAkC,OAAO,OAAO;AAAA,EAC3D;AACF;AAUA,eAAe,aAAa,KAAa,UAAiC;AACxE,QAAM,WAAW,MAAM,MAAM,GAAG;AAChC,MAAI,CAAC,SAAS,GAAI,OAAM,IAAI,MAAM,oBAAoB,SAAS,MAAM,MAAM,GAAG,EAAE;AAChF,MAAI,CAAC,SAAS,KAAM,OAAM,IAAI,MAAM,qBAAqB,GAAG,EAAE;AAC9D,QAAM,WAAW,GAAG,QAAQ,IAAI,QAAQ,GAAG,IAAI,KAAK,IAAI,CAAC;AACzD,MAAI;AACF,UAAM,aAAa,kBAAkB,QAAQ;AAC7C,UAAM,eAAe,SAAS,QAAQ,SAAS,IAAa,GAAG,UAAU;AACzE,UAAM,OAAO,UAAU,QAAQ;AAAA,EACjC,SAAS,KAAK;AACZ,QAAI;AAAE,YAAM,OAAO,QAAQ;AAAA,IAAG,QAAQ;AAAA,IAA2B;AACjE,UAAM;AAAA,EACR;AACF;AAEO,IAAM,WAAN,MAAe;AAAA,EACZ;AAAA,EACA,UAA6B;AAAA,EAC7B,YAA8E;AAAA,EAC9E,MAAwB;AAAA,EACxB,aAAa;AAAA,EACb,eAA6B;AAAA,EAC7B,cAAc;AAAA,EACd;AAAA,EACA;AAAA,EACA;AAAA,EACA,YAAY;AAAA,EAEpB,YACE,QAAgB,eAChB,aAAqB,iBACrB,YAAoB,oBACpB,YAAqB,mBACrB;AACA,SAAK,QAAQ;AACb,SAAK,aAAa;AAClB,SAAK,YAAY;AACjB,SAAK,YAAY;AAAA,EACnB;AAAA,EAEA,MAAM,OAAsB;AAC1B,QAAI,KAAK,YAAa;AAEtB,UAAM,WAAW,KAAK,WAAW,KAAK,MAAM,QAAQ,OAAO,IAAI,CAAC;AAChE,UAAM,MAAM,UAAU,EAAE,WAAW,KAAK,CAAC;AAGzC,UAAM,EAAE,KAAK,MAAM,IAAI,MAAM,mBAAmB;AAChD,SAAK,MAAM;AACX,SAAK,eAAe;AAIpB,QAAI,eAAe,KAAK;AAExB,QAAI,gBAAgB,CAAC,WAAW,KAAK,UAAU,sBAAsB,CAAC,KAAK,WAAW,KAAK,UAAU,YAAY,CAAC,GAAG;AACnH,qBAAe;AAAA,IACjB;AACA,UAAM,gBAAgB,eAAe,yBAAyB;AAC9D,SAAK,YAAY,KAAK,UAAU,aAAa;AAC7C,UAAM,YAAY,KAAK;AACvB,QAAI,CAAC,WAAW,SAAS,GAAG;AAC1B,YAAM,UAAU,eAAe,6BAA6B;AAC5D,YAAM,cAAc,QAAQ,KAAK,KAAK,MAAM,eAAe,8BAA8B;AACzF,YAAM,MAAM,0BAA0B,KAAK,KAAK,iBAAiB,WAAW;AAC5E,cAAQ,OAAO,MAAM,2BAA2B,KAAK,KAAK,KAAK,eAAe,cAAc,MAAM;AAAA,CAAQ;AAC1G,UAAI;AACF,cAAM,aAAa,KAAK,SAAS;AAAA,MACnC,SAAS,KAAU;AACjB,YAAI,gBAAgB,KAAK,SAAS,SAAS,KAAK,GAAG;AAEjD,kBAAQ,OAAO,MAAM;AAAA,CAAuD;AAC5E,yBAAe;AACf,eAAK,YAAY,KAAK,UAAU,YAAY;AAC5C,gBAAM,cAAc,iBAAiB,KAAK,KAAK,KAAK;AACpD,gBAAM,UAAU,0BAA0B,KAAK,KAAK,iBAAiB,WAAW;AAChF,kBAAQ,OAAO,MAAM,2BAA2B,KAAK,KAAK;AAAA,CAAc;AACxE,gBAAM,aAAa,SAAS,KAAK,SAAS;AAAA,QAC5C,OAAO;AACL,gBAAM;AAAA,QACR;AAAA,MACF;AACA,cAAQ,OAAO,MAAM,uBAAuB,QAAQ;AAAA,CAAI;AAAA,IAC1D;AAEA,SAAK,YAAY,MAAM,cAAc,gBAAgB,KAAK,OAAO;AAAA,MAC/D,WAAW;AAAA,IACb,CAAC;AAGD,SAAK,UAAU,MAAM,IAAI,iBAAiB,OAAO,KAAK,WAAW;AAAA,MAC/D,oBAAoB,CAAC,UAAU,WAAW,QAAQ,MAAM;AAAA,IAC1D,CAAC;AAGD,UAAM,OAAO,MAAM,KAAK,MAAM,MAAM;AACpC,SAAK,aAAa,KAAK;AACvB,SAAK,cAAc;AAEnB,UAAM,aAAa,KAAK,MAAM,MAAM,GAAG,EAAE,IAAI,KAAK,KAAK;AACvD,YAAQ,OAAO,MAAM,mBAAmB,UAAU,KAAK,KAAK,KAAK,KAAK,UAAU,YAAY,KAAK,SAAS;AAAA,CAAK;AAAA,EACjH;AAAA,EAEA,MAAM,MAAM,MAAqC;AAC/C,QAAI,CAAC,KAAK,WAAW,CAAC,KAAK,aAAa,CAAC,KAAK;AAC5C,YAAM,IAAI,MAAM,8CAA8C;AAGhE,UAAM,UAAU,MAAM,KAAK,UAAU,MAAM;AAAA,MACzC,SAAS;AAAA,MACT,YAAY;AAAA,MACZ,YAAY;AAAA,MACZ,eAAe;AAAA,IACjB,CAAC;AAED,UAAM,cAAwB,MAAM,KAAK,QAAQ,SAAS;AAC1D,UAAM,mBAA6B,MAAM,KAAK,QAAQ,cAAc;AACpE,UAAM,SAAS,YAAY;AAG3B,UAAM,WAAW,IAAI,KAAK,IAAI;AAAA,MAC5B;AAAA,MACA,cAAc,KAAK,YAAY,IAAI,MAAM,CAAC;AAAA,MAC1C,CAAC,GAAG,MAAM;AAAA,IACZ;AACA,UAAM,gBAAgB,IAAI,KAAK,IAAI;AAAA,MACjC;AAAA,MACA,cAAc,KAAK,iBAAiB,IAAI,MAAM,CAAC;AAAA,MAC/C,CAAC,GAAG,MAAM;AAAA,IACZ;AAEA,UAAM,QAAiC,EAAE,WAAW,UAAU,gBAAgB,cAAc;AAG5F,QAAI,KAAK,QAAQ,WAAW,SAAS,gBAAgB,GAAG;AACtD,YAAM,iBAAiB,IAAI,KAAK,IAAI;AAAA,QAClC;AAAA,QACA,IAAI,cAAc,MAAM;AAAA,QACxB,CAAC,GAAG,MAAM;AAAA,MACZ;AAAA,IACF;AAGA,UAAM,SAAS,MAAM,KAAK,QAAQ,IAAI,KAAK;AAC3C,UAAM,eAAe,OAAO,KAAK,QAAQ,YAAY,CAAC,CAAC;AACvD,UAAM,aAAa,aAAa,KAAK,aAAa,KAAK,SAAS,CAAC;AAGjE,WAAO,KAAK,qBAAqB,aAAa,MAAM,kBAAkB,QAAQ,UAAU;AAAA,EAC1F;AAAA,EAEQ,qBACN,YACA,eACA,QACA,YACc;AACd,UAAM,SAAS,IAAI,aAAa,UAAU;AAC1C,QAAI,UAAU;AAEd,aAAS,IAAI,GAAG,IAAI,QAAQ,KAAK;AAC/B,YAAM,OAAO,cAAc,CAAC;AAC5B,iBAAW;AACX,YAAM,SAAS,IAAI;AACnB,eAAS,IAAI,GAAG,IAAI,YAAY,KAAK;AACnC,eAAO,CAAC,KAAK,WAAW,SAAS,CAAC,IAAI;AAAA,MACxC;AAAA,IACF;AAEA,QAAI,UAAU,GAAG;AACf,eAAS,IAAI,GAAG,IAAI,YAAY,IAAK,QAAO,CAAC,KAAK;AAAA,IACpD;AAGA,QAAI,OAAO;AACX,aAAS,IAAI,GAAG,IAAI,YAAY,IAAK,SAAQ,OAAO,CAAC,IAAI,OAAO,CAAC;AACjE,WAAO,KAAK,KAAK,IAAI;AACrB,QAAI,OAAO,GAAG;AACZ,eAAS,IAAI,GAAG,IAAI,YAAY,IAAK,QAAO,CAAC,KAAK;AAAA,IACpD;AAEA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKQ,yBACN,YACA,UACA,WACA,QACA,YACgB;AAChB,UAAM,UAA0B,CAAC;AACjC,aAAS,IAAI,GAAG,IAAI,WAAW,KAAK;AAClC,YAAM,SAAS,IAAI,aAAa,UAAU;AAC1C,UAAI,UAAU;AACd,eAAS,IAAI,GAAG,IAAI,QAAQ,KAAK;AAC/B,cAAM,OAAO,SAAS,IAAI,SAAS,CAAC;AACpC,mBAAW;AACX,cAAM,UAAU,IAAI,SAAS,KAAK;AAClC,iBAAS,IAAI,GAAG,IAAI,YAAY,KAAK;AACnC,iBAAO,CAAC,KAAK,WAAW,SAAS,CAAC,IAAI;AAAA,QACxC;AAAA,MACF;AACA,UAAI,UAAU,GAAG;AACf,iBAAS,IAAI,GAAG,IAAI,YAAY,IAAK,QAAO,CAAC,KAAK;AAAA,MACpD;AAEA,UAAI,OAAO;AACX,eAAS,IAAI,GAAG,IAAI,YAAY,IAAK,SAAQ,OAAO,CAAC,IAAI,OAAO,CAAC;AACjE,aAAO,KAAK,KAAK,IAAI;AACrB,UAAI,OAAO,GAAG;AACZ,iBAAS,IAAI,GAAG,IAAI,YAAY,IAAK,QAAO,CAAC,KAAK;AAAA,MACpD;AACA,cAAQ,KAAK,MAAM;AAAA,IACrB;AACA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,MAAc,cAAc,OAA0C;AACpE,QAAI,CAAC,KAAK,WAAW,CAAC,KAAK,aAAa,CAAC,KAAK;AAC5C,YAAM,IAAI,MAAM,8CAA8C;AAEhE,UAAM,IAAI,MAAM;AAGhB,UAAM,YAAY,MAAM,QAAQ;AAAA,MAC9B,MAAM;AAAA,QAAI,CAAC,SACT,KAAK,UAAW,MAAM;AAAA,UACpB,SAAS;AAAA,UACT,YAAY;AAAA,UACZ,YAAY;AAAA,UACZ,eAAe;AAAA,QACjB,CAAC;AAAA,MACH;AAAA,IACF;AAGA,UAAM,YAAY,UAAU,IAAI,CAAC,SAAS;AAAA,MACxC,KAAK,MAAM,KAAK,IAAI,SAAS;AAAA,MAC7B,MAAM,MAAM,KAAK,IAAI,cAAc;AAAA,IACrC,EAAE;AACF,UAAM,SAAS,KAAK,IAAI,GAAG,UAAU,IAAI,CAAC,MAAM,EAAE,IAAI,MAAM,CAAC;AAG7D,UAAM,UAAU,IAAI,cAAc,IAAI,MAAM;AAC5C,UAAM,WAAW,IAAI,cAAc,IAAI,MAAM;AAC7C,UAAM,eAAe,IAAI,MAAc,IAAI,MAAM,EAAE,KAAK,CAAC;AAEzD,aAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,YAAM,EAAE,KAAK,KAAK,IAAI,UAAU,CAAC;AACjC,eAAS,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK;AACnC,gBAAQ,IAAI,SAAS,CAAC,IAAI,OAAO,IAAI,CAAC,CAAC;AACvC,iBAAS,IAAI,SAAS,CAAC,IAAI,OAAO,KAAK,CAAC,CAAC;AACzC,qBAAa,IAAI,SAAS,CAAC,IAAI,KAAK,CAAC;AAAA,MACvC;AAAA,IAEF;AAGA,UAAM,WAAW,IAAI,KAAK,IAAI,OAAO,SAAS,SAAS,CAAC,GAAG,MAAM,CAAC;AAClE,UAAM,gBAAgB,IAAI,KAAK,IAAI,OAAO,SAAS,UAAU,CAAC,GAAG,MAAM,CAAC;AAExE,UAAM,QAAiC,EAAE,WAAW,UAAU,gBAAgB,cAAc;AAE5F,QAAI,KAAK,QAAQ,WAAW,SAAS,gBAAgB,GAAG;AACtD,YAAM,iBAAiB,IAAI,KAAK,IAAI;AAAA,QAClC;AAAA,QACA,IAAI,cAAc,IAAI,MAAM;AAAA,QAC5B,CAAC,GAAG,MAAM;AAAA,MACZ;AAAA,IACF;AAGA,UAAM,SAAS,MAAM,KAAK,QAAQ,IAAI,KAAK;AAC3C,UAAM,eAAe,OAAO,KAAK,QAAQ,YAAY,CAAC,CAAC;AACvD,UAAM,aAAa,aAAa,KAAK,aAAa,KAAK,SAAS,CAAC;AAEjE,WAAO,KAAK;AAAA,MACV,aAAa;AAAA,MACb;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACF;AAAA,EACF;AAAA,EAEA,MAAM,WACJ,OACA,YACyB;AAEzB,QAAI,KAAK,aAAa,KAAK,MAAM,UAAU,KAAK,aAAa,GAAG;AAC9D,aAAO,KAAK,mBAAmB,OAAO,UAAU;AAAA,IAClD;AAGA,UAAM,UAA0B,CAAC;AACjC,aAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK,KAAK,WAAW;AACrD,YAAM,WAAW,MAAM,MAAM,GAAG,IAAI,KAAK,SAAS;AAClD,YAAM,aAAa,MAAM,KAAK,cAAc,QAAQ;AACpD,cAAQ,KAAK,GAAG,UAAU;AAC1B,YAAM,aAAa,KAAK,IAAI,IAAI,SAAS,QAAQ,MAAM,MAAM,GAAG,MAAM,QAAQ,UAAU;AAAA,IAC1F;AACA,WAAO;AAAA,EACT;AAAA,EAEA,MAAc,mBACZ,OACA,YACyB;AAKzB,UAAM,UAAU,QAAQ,cAAc,YAAY,GAAG,CAAC;AACtD,QAAI,aAAa,KAAK,SAAS,iBAAiB;AAChD,QAAI,CAAC,WAAW,UAAU,GAAG;AAE3B,mBAAa,KAAK,SAAS,QAAQ,iBAAiB;AAAA,IACtD;AAEA,QAAI,CAAC,WAAW,UAAU,GAAG;AAE3B,cAAQ,OAAO,MAAM,8DAA8D;AACnF,aAAO,KAAK,WAAW,OAAO,UAAU;AAAA,IAC1C;AAGA,UAAM,YAAY,KAAK,KAAK,MAAM,SAAS,KAAK,UAAU;AAC1D,UAAM,SAAoD,CAAC;AAC3D,aAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK,WAAW;AAChD,aAAO,KAAK,EAAE,OAAO,MAAM,MAAM,GAAG,IAAI,SAAS,GAAG,YAAY,EAAE,CAAC;AAAA,IACrE;AAEA,UAAM,aAAa,IAAI,MAAoB,MAAM,MAAM;AACvD,QAAI,YAAY;AAEhB,UAAM,iBAAiB,OAAO,IAAI,CAAC,UAAU;AAC3C,aAAO,IAAI,QAAc,CAAC,SAAS,WAAW;AAC5C,cAAM,SAAS,IAAI,OAAO,YAAY;AAAA,UACpC,YAAY;AAAA,YACV,WAAW,KAAK;AAAA,YAChB,WAAW,KAAK;AAAA,YAChB,UAAU;AAAA,YACV,cAAc,KAAK;AAAA,YACnB,WAAW,KAAK;AAAA,UAClB;AAAA,QACF,CAAC;AAED,eAAO,GAAG,WAAW,CAAC,QAAa;AACjC,cAAI,IAAI,SAAS,SAAS;AACxB,mBAAO,YAAY,EAAE,MAAM,SAAS,OAAO,MAAM,OAAO,YAAY,MAAM,WAAW,CAAC;AAAA,UACxF,WAAW,IAAI,SAAS,YAAY;AAClC;AACA,yBAAa,WAAW,MAAM,MAAM;AAAA,UACtC,WAAW,IAAI,SAAS,UAAU;AAChC,qBAAS,IAAI,GAAG,IAAI,IAAI,WAAW,QAAQ,KAAK;AAC9C,yBAAW,MAAM,aAAa,CAAC,IAAI,IAAI,aAAa,IAAI,WAAW,CAAC,CAAC;AAAA,YACvE;AACA,mBAAO,UAAU;AACjB,oBAAQ;AAAA,UACV,WAAW,IAAI,SAAS,SAAS;AAC/B,mBAAO,UAAU;AACjB,mBAAO,IAAI,MAAM,IAAI,KAAK,CAAC;AAAA,UAC7B;AAAA,QACF,CAAC;AAED,eAAO,GAAG,SAAS,CAAC,QAAQ;AAC1B,iBAAO,UAAU;AACjB,iBAAO,GAAG;AAAA,QACZ,CAAC;AAAA,MACH,CAAC;AAAA,IACH,CAAC;AAED,UAAM,QAAQ,IAAI,cAAc;AAChC,WAAO;AAAA,EACT;AAAA,EAEA,gBAAwB;AACtB,WAAO,KAAK;AAAA,EACd;AAAA,EAEA,WAAmB;AACjB,WAAO,KAAK;AAAA,EACd;AAAA,EAEA,aAA2B;AACzB,WAAO,KAAK;AAAA,EACd;AAAA,EAEA,MAAM,eACJ,YACA,WACe;AACf,UAAM,UAAkD,CAAC;AACzD,eAAW,CAAC,KAAK,GAAG,KAAK,YAAY;AACnC,cAAQ,KAAK,EAAE,KAAK,MAAM,MAAM,KAAK,GAAG,EAAE,CAAC;AAAA,IAC7C;AACA,UAAM,UAAU,KAAK,WAAW,iBAAiB,GAAG,KAAK,UAAU,OAAO,CAAC;AAAA,EAC7E;AAAA,EAEA,MAAM,eACJ,WACoC;AACpC,UAAM,WAAW,KAAK,WAAW,iBAAiB;AAClD,QAAI,CAAC,WAAW,QAAQ,EAAG,QAAO,oBAAI,IAAI;AAE1C,UAAM,MAAM,MAAM,SAAS,UAAU,OAAO;AAC5C,UAAM,UAAkD,KAAK,MAAM,GAAG;AACtE,UAAM,MAAM,oBAAI,IAA0B;AAC1C,eAAW,SAAS,SAAS;AAC3B,UAAI,IAAI,MAAM,KAAK,IAAI,aAAa,MAAM,IAAI,CAAC;AAAA,IACjD;AACA,WAAO;AAAA,EACT;AACF;;;AChfA,OAAO,WAAW;AAClB,SAAS,mBAAmB;AAC5B,SAAS,qBAAqB;AAE9B,SAAS,YAAAA,WAAU,aAAAC,kBAAiB;AACpC,SAAS,QAAAC,aAAY;AACrB,SAAS,cAAAC,mBAAkB;AAQ3B,IAAM,oBAAoB;AAEnB,IAAM,eAAN,MAAmB;AAAA,EAChB;AAAA,EAER,cAAc;AACZ,SAAK,QAAQ,IAAI,MAAM,EAAE,MAAM,YAAY,OAAO,MAAM,CAAC;AAAA,EAC3D;AAAA,EAEA,mBAAmB,WAAoC;AACrD,SAAK,MAAM,MAAM;AAGjB,eAAW,OAAO,WAAW;AAC3B,WAAK,MAAM,QAAQ,IAAI,MAAM;AAAA,QAC3B,OAAO,IAAI;AAAA,QACX,MAAM,IAAI;AAAA,QACV,GAAI,IAAI,WAAW,UAAa,EAAE,QAAQ,IAAI,OAAO;AAAA,QACrD,GAAI,IAAI,iBAAiB,UAAa,EAAE,cAAc,IAAI,aAAa;AAAA,MACzE,CAAC;AAAA,IACH;AAEA,UAAM,aAAa,oBAAI,IAAoB;AAC3C,eAAW,OAAO,WAAW;AAC3B,YAAM,YAAY,IAAI,KAAK,QAAQ,SAAS,EAAE;AAC9C,YAAM,WAAW,UAAU,MAAM,GAAG,EAAE,IAAI;AAC1C,iBAAW,IAAI,SAAS,YAAY,GAAG,IAAI,IAAI;AAC/C,iBAAW,IAAI,UAAU,YAAY,GAAG,IAAI,IAAI;AAAA,IAClD;AAGA,eAAW,OAAO,WAAW;AAC3B,iBAAW,QAAQ,IAAI,WAAW;AAChC,cAAM,SAAS,WAAW,IAAI,KAAK,YAAY,CAAC;AAChD,YAAI,UAAU,WAAW,IAAI,QAAQ,CAAC,KAAK,MAAM,QAAQ,IAAI,MAAM,MAAM,GAAG;AAC1E,eAAK,MAAM,QAAQ,IAAI,MAAM,QAAQ,EAAE,MAAM,YAAY,QAAQ,EAAI,CAAC;AAAA,QACxE;AAAA,MACF;AAAA,IACF;AAIA,eAAW,OAAO,WAAW;AAC3B,UAAI,CAAC,IAAI,aAAa,OAAQ;AAC9B,iBAAW,OAAO,IAAI,aAAa;AAEjC,cAAM,aAAa,IAAI,QAAQ,SAAS,EAAE,EAAE,YAAY;AACxD,cAAM,OAAO,WAAW,MAAM,GAAG,EAAE,IAAI;AACvC,cAAM,SAAS,WAAW,IAAI,UAAU,KAAK,WAAW,IAAI,IAAI;AAChE,YAAI,UAAU,WAAW,IAAI,QAAQ,CAAC,KAAK,MAAM,QAAQ,IAAI,MAAM,MAAM,GAAG;AAC1E,eAAK,MAAM,QAAQ,IAAI,MAAM,QAAQ,EAAE,MAAM,WAAW,QAAQ,EAAI,CAAC;AAAA,QACvE;AAAA,MACF;AAAA,IACF;AAKA,UAAM,aAAa,oBAAI,IAAsB;AAC7C,eAAW,OAAO,WAAW;AAC3B,iBAAW,OAAO,IAAI,MAAM;AAC1B,cAAM,QAAQ,WAAW,IAAI,GAAG,KAAK,CAAC;AACtC,cAAM,KAAK,IAAI,IAAI;AACnB,mBAAW,IAAI,KAAK,KAAK;AAAA,MAC3B;AAAA,IACF;AAEA,eAAW,CAAC,EAAE,KAAK,KAAK,YAAY;AAClC,UAAI,MAAM,UAAU,kBAAmB;AACvC,eAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;AACrC,iBAAS,IAAI,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;AACzC,cAAI,CAAC,KAAK,MAAM,QAAQ,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC,GAAG;AAC3C,iBAAK,MAAM,QAAQ,MAAM,CAAC,GAAG,MAAM,CAAC,GAAG,EAAE,MAAM,OAAO,QAAQ,IAAI,CAAC;AAAA,UACrE;AACA,cAAI,CAAC,KAAK,MAAM,QAAQ,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC,GAAG;AAC3C,iBAAK,MAAM,QAAQ,MAAM,CAAC,GAAG,MAAM,CAAC,GAAG,EAAE,MAAM,OAAO,QAAQ,IAAI,CAAC;AAAA,UACrE;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAAA,EAEA,UAAU,UAA+B;AACvC,QAAI,CAAC,KAAK,MAAM,QAAQ,QAAQ,EAAG,QAAO,CAAC;AAC3C,WAAO,KAAK,MAAM,YAAY,QAAQ,EAAE,IAAI,CAAC,MAAM,KAAK,gBAAgB,CAAC,CAAC;AAAA,EAC5E;AAAA,EAEA,aAAa,UAA+B;AAC1C,QAAI,CAAC,KAAK,MAAM,QAAQ,QAAQ,EAAG,QAAO,CAAC;AAC3C,WAAO,KAAK,MAAM,aAAa,QAAQ,EAAE,IAAI,CAAC,MAAM,KAAK,gBAAgB,CAAC,CAAC;AAAA,EAC7E;AAAA,EAEA,SAAS,MAAc,IAA6B;AAClD,QAAI,CAAC,KAAK,MAAM,QAAQ,IAAI,KAAK,CAAC,KAAK,MAAM,QAAQ,EAAE,EAAG,QAAO;AACjE,UAAM,OAAO,cAAc,KAAK,OAAO,MAAM,EAAE;AAC/C,WAAO;AAAA,EACT;AAAA,EAEA,YAAY,SAAiB,WAAW,GAAG,QAAQ,IAAiB;AAClE,UAAM,KAAK,QAAQ,YAAY;AAE/B,UAAM,gBAAgB,IAAI;AAAA,MACxB,KAAK,MAAM,MAAM,EAAE,OAAO,CAAC,MAAM;AAC/B,cAAM,QAAQ,KAAK,MAAM,kBAAkB,CAAC;AAC5C,cAAM,QAAQ,OAAO,MAAM,UAAU,WAAW,MAAM,QAAQ,OAAO,MAAM,SAAS,EAAE;AACtF,eACE,EAAE,YAAY,EAAE,SAAS,EAAE,KAC3B,MAAM,YAAY,EAAE,SAAS,EAAE,KAC9B,MAAM,MAA+B,KAAK,CAAC,MAAM,EAAE,YAAY,EAAE,SAAS,EAAE,CAAC;AAAA,MAElF,CAAC;AAAA,IACH;AAEA,UAAM,UAAU,oBAAI,IAAY;AAChC,eAAW,SAAS,eAAe;AACjC,kBAAY,KAAK,OAAO,OAAO,CAAC,OAAO,OAAO,UAAU;AACtD,YAAI,QAAQ,QAAQ,QAAQ,EAAG,QAAO;AACtC,gBAAQ,IAAI,KAAK;AACjB,eAAO,SAAS;AAAA,MAClB,CAAC;AAAA,IACH;AAIA,UAAM,SAAS,CAAC,GAAG,OAAO,EAAE,KAAK,CAAC,GAAG,MAAM;AACzC,YAAM,SAAS,KAAK,MAAM,kBAAkB,CAAC;AAC7C,YAAM,SAAS,KAAK,MAAM,kBAAkB,CAAC;AAC7C,YAAM,cAAc,OAAO,WAAW,gBAAgB,OAAO,WAAW,aAAa,IAAI;AACzF,YAAM,cAAc,OAAO,WAAW,gBAAgB,OAAO,WAAW,aAAa,IAAI;AACzF,UAAI,gBAAgB,YAAa,QAAO,cAAc;AACtD,YAAM,UAAU,cAAc,IAAI,CAAC,IAAI,IAAI;AAC3C,YAAM,UAAU,cAAc,IAAI,CAAC,IAAI,IAAI;AAC3C,UAAI,YAAY,QAAS,QAAO,UAAU;AAC1C,YAAM,YAAa,OAAO,gBAAuC;AACjE,YAAM,YAAa,OAAO,gBAAuC;AACjE,UAAI,cAAc,UAAW,QAAO,YAAY;AAChD,aAAO,KAAK,MAAM,OAAO,CAAC,IAAI,KAAK,MAAM,OAAO,CAAC;AAAA,IACnD,CAAC;AAED,WAAO,OAAO,MAAM,GAAG,KAAK,EAAE,IAAI,CAAC,MAAM,KAAK,gBAAgB,CAAC,CAAC;AAAA,EAClE;AAAA,EAEA,aAAyB;AACvB,UAAM,QAAQ,KAAK,MAAM;AACzB,UAAM,QAAQ,KAAK,MAAM;AACzB,UAAM,UAAU,KAAK,MAAM,MAAM,EAAE;AAAA,MACjC,CAAC,MAAM,KAAK,MAAM,OAAO,CAAC,MAAM;AAAA,IAClC;AAEA,UAAM,cAAc,KAAK,MAAM,MAAM,EAAE,IAAI,CAAC,OAAO;AAAA,MACjD,MAAM;AAAA,MACN,aAAa,KAAK,MAAM,OAAO,CAAC;AAAA,IAClC,EAAE;AACF,gBAAY,KAAK,CAAC,GAAG,MAAM,EAAE,cAAc,EAAE,WAAW;AAExD,UAAM,mBAAmB,SAAS,QAAQ;AAC1C,UAAM,UAAU,mBAAmB,IAAI,QAAQ,mBAAmB;AAElE,WAAO;AAAA,MACL,YAAY;AAAA,MACZ,YAAY;AAAA,MACZ,aAAa,QAAQ;AAAA,MACrB,eAAe,YAAY,MAAM,GAAG,EAAE;AAAA,MACtC;AAAA,IACF;AAAA,EACF;AAAA,EAEQ,gBAAgB,UAA6B;AACnD,UAAM,QAAQ,KAAK,MAAM,kBAAkB,QAAQ;AACnD,WAAO;AAAA,MACL,MAAM;AAAA,MACN,OAAO,OAAO,MAAM,UAAU,WAAW,MAAM,QAAQ;AAAA,MACvD,MAAO,MAAM,QAAqB,CAAC;AAAA,MACnC,WAAW,KAAK,MAAM,UAAU,QAAQ;AAAA,MACxC,eAAe,KAAK,MAAM,SAAS,QAAQ;AAAA,MAC3C,GAAI,MAAM,iBAAiB,UAAa,EAAE,cAAc,MAAM,aAAuB;AAAA,MACrF,GAAI,MAAM,WAAW,UAAa,EAAE,QAAQ,MAAM,OAAiB;AAAA,IACrE;AAAA,EACF;AAAA,EAEA,MAAM,KAAK,WAAkC;AAC3C,UAAM,OAAO,KAAK,MAAM,OAAO;AAC/B,UAAMF,WAAUC,MAAK,WAAW,YAAY,GAAG,KAAK,UAAU,IAAI,CAAC;AAAA,EACrE;AAAA,EAEA,MAAM,KAAK,WAAqC;AAC9C,UAAM,WAAWA,MAAK,WAAW,YAAY;AAC7C,QAAI,CAACC,YAAW,QAAQ,EAAG,QAAO;AAElC,UAAM,MAAM,MAAMH,UAAS,UAAU,OAAO;AAC5C,UAAM,OAAO,KAAK,MAAM,GAAG;AAC3B,SAAK,MAAM,OAAO,IAAI;AACtB,WAAO;AAAA,EACT;AAAA,EAEA,WAAkB;AAChB,WAAO,KAAK;AAAA,EACd;AACF;;;ACpNA,OAAO,aAAa;AAEpB,SAAS,YAAAI,WAAU,aAAAC,kBAAiB;AACpC,SAAS,QAAAC,aAAY;AACrB,SAAS,cAAAC,mBAAkB;AAH3B,IAAM,EAAE,gBAAgB,IAAI;AAYrB,IAAM,cAAN,MAAkB;AAAA,EACf,QAAqD;AAAA,EACrD;AAAA,EACA,YAAyB,CAAC;AAAA,EAElC,YAAY,YAAoB;AAC9B,SAAK,aAAa;AAAA,EACpB;AAAA,EAEA,MACE,YACA,MACM;AACN,QAAI,WAAW,WAAW,GAAG;AAC3B,WAAK,QAAQ;AACb,WAAK,YAAY,CAAC;AAClB;AAAA,IACF;AAEA,SAAK,QAAQ,IAAI,gBAAgB,UAAU,KAAK,UAAU;AAC1D,SAAK,MAAM,UAAU,WAAW,MAAM;AAEtC,aAAS,IAAI,GAAG,IAAI,WAAW,QAAQ,KAAK;AAC1C,WAAK,MAAM,SAAS,MAAM,KAAK,WAAW,CAAC,CAAC,GAAG,CAAC;AAAA,IAClD;AAEA,SAAK,YAAY;AAAA,EACnB;AAAA,EAEA,OAAO,gBAA8B,IAAY,IAAoB;AACnE,QAAI,CAAC,KAAK,SAAS,KAAK,UAAU,WAAW,EAAG,QAAO,CAAC;AAExD,UAAM,aAAa,KAAK,IAAI,GAAG,KAAK,UAAU,MAAM;AACpD,UAAM,SAAS,KAAK,MAAM,UAAU,MAAM,KAAK,cAAc,GAAG,UAAU;AAE1E,UAAM,OAAO,oBAAI,IAAY;AAC7B,UAAM,UAA0B,CAAC;AAEjC,aAAS,IAAI,GAAG,IAAI,OAAO,UAAU,QAAQ,KAAK;AAChD,YAAM,MAAM,OAAO,UAAU,CAAC;AAC9B,YAAM,OAAO,KAAK,UAAU,GAAG;AAC/B,UAAI,CAAC,QAAQ,KAAK,IAAI,KAAK,OAAO,EAAG;AACrC,WAAK,IAAI,KAAK,OAAO;AAErB,cAAQ,KAAK;AAAA,QACX,MAAM,KAAK;AAAA,QACX,OAAO,KAAK;AAAA,QACZ,OAAO,IAAI,OAAO,UAAU,CAAC;AAAA,QAC7B,SAAS,KAAK,KAAK,MAAM,GAAG,GAAG;AAAA,QAC/B,cAAc,KAAK;AAAA,MACrB,CAAC;AAAA,IACH;AAEA,WAAO;AAAA,EACT;AAAA,EAEA,MAAM,KAAK,WAAkC;AAC3C,QAAI,CAAC,KAAK,MAAO;AAEjB,SAAK,MAAM,eAAeD,MAAK,WAAW,UAAU,CAAC;AACrD,UAAMD;AAAA,MACJC,MAAK,WAAW,gBAAgB;AAAA,MAChC,KAAK,UAAU,KAAK,SAAS;AAAA,IAC/B;AAAA,EACF;AAAA,EAEA,MAAM,KAAK,WAAqC;AAC9C,UAAM,WAAWA,MAAK,WAAW,UAAU;AAC3C,UAAM,WAAWA,MAAK,WAAW,gBAAgB;AAEjD,QAAI,CAACC,YAAW,QAAQ,KAAK,CAACA,YAAW,QAAQ,EAAG,QAAO;AAE3D,UAAM,MAAM,MAAMH,UAAS,UAAU,OAAO;AAC5C,SAAK,YAAY,KAAK,MAAM,GAAG;AAE/B,SAAK,QAAQ,IAAI,gBAAgB,UAAU,KAAK,UAAU;AAC1D,SAAK,MAAM,UAAU,KAAK,UAAU,MAAM;AAC1C,SAAK,MAAM,cAAc,QAAQ;AAEjC,WAAO;AAAA,EACT;AAAA,EAEA,eAA4B;AAC1B,WAAO,KAAK;AAAA,EACd;AACF;;;ACjGA,SAAS,iBAAiB;AAEnB,IAAM,aAAN,MAAiB;AAAA,EACd,YAA+B,CAAC;AAAA,EAExC,aAAa,WAAoC;AAC/C,SAAK,YAAY;AAAA,EACnB;AAAA,EAEA,OAAO,SAA4C;AACjD,UAAM,EAAE,SAAS,OAAO,eAAe,UAAU,WAAW,QAAQ,GAAG,IAAI;AAE3E,QAAI;AAEJ,QAAI,OAAO;AACT,YAAM,QAAQ,gBAAgB,MAAM;AACpC,YAAM,KAAK,IAAI,OAAO,SAAS,KAAK;AACpC,gBAAU,CAAC,SAAS;AAClB,WAAG,YAAY;AACf,cAAM,IAAI,GAAG,KAAK,IAAI;AACtB,eAAO,EAAE,SAAS,CAAC,CAAC,GAAG,OAAO,GAAG,SAAS,GAAG;AAAA,MAC/C;AAAA,IACF,OAAO;AACL,YAAM,SAAS,gBAAgB,UAAU,QAAQ,YAAY;AAC7D,gBAAU,CAAC,SAAS;AAClB,cAAM,WAAW,gBAAgB,OAAO,KAAK,YAAY;AACzD,cAAM,MAAM,SAAS,QAAQ,MAAM;AACnC,eAAO,EAAE,SAAS,OAAO,GAAG,OAAO,IAAI;AAAA,MACzC;AAAA,IACF;AAEA,UAAM,UAA0B,CAAC;AAEjC,eAAW,OAAO,KAAK,WAAW;AAEhC,UAAI,YAAY,CAAC,UAAU,IAAI,MAAM,QAAQ,EAAG;AAGhD,UAAI,WAAW,QAAQ;AACrB,cAAM,SAAS,UAAU,KAAK,CAAC,MAAM,IAAI,KAAK,SAAS,CAAC,CAAC;AACzD,YAAI,CAAC,OAAQ;AAAA,MACf;AAEA,YAAM,EAAE,SAAS,MAAM,IAAI,QAAQ,IAAI,OAAO;AAC9C,UAAI,CAAC,QAAS;AAEd,YAAM,eAAe,KAAK,IAAI,GAAG,QAAQ,EAAE;AAC3C,YAAM,aAAa,KAAK,IAAI,IAAI,QAAQ,QAAQ,QAAQ,GAAG;AAC3D,YAAM,UAAU,IAAI,QAAQ,MAAM,cAAc,UAAU,EAAE,KAAK;AAEjE,cAAQ,KAAK;AAAA,QACX,MAAM,IAAI;AAAA,QACV,OAAO,IAAI;AAAA,QACX,OAAO;AAAA,QACP,UAAU,eAAe,IAAI,QAAQ,MAAM,WAAW,aAAa,IAAI,QAAQ,SAAS,QAAQ;AAAA,MAClG,CAAC;AAED,UAAI,QAAQ,UAAU,MAAO;AAAA,IAC/B;AAEA,WAAO;AAAA,EACT;AACF;","names":["readFile","writeFile","join","existsSync","readFile","writeFile","join","existsSync"]}

package/dist/chunk-TKHWVISV.js

@@ -0,0 +1,71 @@
+import {
+  stateDir
+} from "./chunk-R6GNP7DS.js";
+
+// src/core/skill-ledger.ts
+import { createHash, randomBytes } from "crypto";
+import { appendFileSync, existsSync, mkdirSync, readFileSync, rmdirSync, unlinkSync, writeFileSync } from "fs";
+import { dirname, join } from "path";
+var ledgerPath = (repo) => join(stateDir(repo), "skill-ledger.jsonl");
+var blobDir = (repo) => join(stateDir(repo), "skill-ledger-blobs");
+var archiveDir = (repo) => join(stateDir(repo), "skills-archive");
+var sha256 = (b) => createHash("sha256").update(b).digest("hex");
+function putBlob(repo, bytes) {
+  const h = sha256(bytes);
+  const p = join(blobDir(repo), h);
+  if (!existsSync(p)) {
+    mkdirSync(blobDir(repo), { recursive: true });
+    writeFileSync(p, bytes);
+  }
+  return h;
+}
+var snapshot = (repo, path) => existsSync(path) ? putBlob(repo, readFileSync(path)) : null;
+function applyChange(repo, meta, ops) {
+  const files = [];
+  for (const op of ops) {
+    const before = snapshot(repo, op.path);
+    if (op.content === null) {
+      if (before) {
+        unlinkSync(op.path);
+        try {
+          rmdirSync(dirname(op.path));
+        } catch {
+        }
+      }
+    } else {
+      mkdirSync(dirname(op.path), { recursive: true });
+      writeFileSync(op.path, op.content);
+    }
+    files.push({ path: op.path, before, after: snapshot(repo, op.path) });
+  }
+  const entry = { id: `${Date.now().toString(36)}-${randomBytes(3).toString("hex")}`, ts: (/* @__PURE__ */ new Date()).toISOString(), ...meta, files };
+  mkdirSync(stateDir(repo), { recursive: true });
+  appendFileSync(ledgerPath(repo), JSON.stringify(entry) + "\n");
+  return entry;
+}
+function readLedger(repo) {
+  try {
+    return readFileSync(ledgerPath(repo), "utf8").split("\n").filter(Boolean).map((l) => JSON.parse(l));
+  } catch {
+    return [];
+  }
+}
+function rollback(repo, id) {
+  const entry = readLedger(repo).find((e) => e.id === id);
+  if (!entry) throw new Error(`no ledger entry ${id}`);
+  for (const f of entry.files) {
+    const now = existsSync(f.path) ? sha256(readFileSync(f.path)) : null;
+    if (now !== f.after) throw new Error(`${f.path} changed since ${id}: roll back the later change first`);
+  }
+  const ops = entry.files.map((f) => ({ path: f.path, content: f.before ? readFileSync(join(blobDir(repo), f.before)) : null }));
+  return applyChange(repo, { action: "rollback", actor: "user", skill: entry.skill, why: `rollback of ${entry.action} ${id}`, reverts: id }, ops);
+}
+
+export {
+  ledgerPath,
+  archiveDir,
+  applyChange,
+  readLedger,
+  rollback
+};
+//# sourceMappingURL=chunk-TKHWVISV.js.map

package/dist/chunk-TKHWVISV.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/core/skill-ledger.ts"],"sourcesContent":["/**\n * The skill loop's ledger (v1.7): every change the loop or a person makes to a learned skill — land, patch,\n * stale, archive, restore, promote, merge, reject — as one line with who, why, and each file's bytes before\n * and after (stored once by sha256 in skill-ledger-blobs/). That is what makes a single change reversible:\n * `rollback <id>` puts every file it touched back exactly as it was. Nothing is lost: a file the loop removes\n * (an archive moves a skill out of .claude/skills/) keeps its bytes in the blob store first.\n */\nimport { createHash, randomBytes } from \"node:crypto\";\nimport { appendFileSync, existsSync, mkdirSync, readFileSync, rmdirSync, unlinkSync, writeFileSync } from \"node:fs\";\nimport { dirname, join } from \"node:path\";\nimport { stateDir } from \"./skill-evidence.js\";\n\nexport type LedgerAction = \"land\" | \"patch\" | \"stale\" | \"archive\" | \"restore\" | \"promote\" | \"merge\" | \"reject\" | \"rollback\";\n\nexport interface FileChange {\n  path: string;\n  /** sha256 of the bytes before (null: the file did not exist) */\n  before: string | null;\n  after: string | null;\n}\n\nexport interface LedgerEntry {\n  id: string;\n  ts: string;\n  action: LedgerAction;\n  actor: \"user\" | \"curator\" | \"reviewer\";\n  skill: string;\n  why: string;\n  files: FileChange[];\n  /** rollback: the entry it reversed */\n  reverts?: string;\n}\n\nexport const ledgerPath = (repo: string) => join(stateDir(repo), \"skill-ledger.jsonl\");\nconst blobDir = (repo: string) => join(stateDir(repo), \"skill-ledger-blobs\");\nexport const archiveDir = (repo: string) => join(stateDir(repo), \"skills-archive\");\nconst sha256 = (b: Buffer | string) => createHash(\"sha256\").update(b).digest(\"hex\");\n\nfunction putBlob(repo: string, bytes: Buffer): string {\n  const h = sha256(bytes);\n  const p = join(blobDir(repo), h);\n  if (!existsSync(p)) {\n    mkdirSync(blobDir(repo), { recursive: true });\n    writeFileSync(p, bytes);\n  }\n  return h;\n}\n\nconst snapshot = (repo: string, path: string): string | null => (existsSync(path) ? putBlob(repo, readFileSync(path)) : null);\n\n/**\n * Apply file writes and removals as one ledgered change. `ops`: write `content` to `path`; null content removes\n * the file (its bytes are in the blob store already, so rollback restores them) and its folder if now empty.\n */\nexport function applyChange(\n  repo: string,\n  meta: { action: LedgerAction; actor: LedgerEntry[\"actor\"]; skill: string; why: string; reverts?: string },\n  ops: { path: string; content: string | Buffer | null }[],\n): LedgerEntry {\n  const files: FileChange[] = [];\n  for (const op of ops) {\n    const before = snapshot(repo, op.path);\n    if (op.content === null) {\n      if (before) {\n        unlinkSync(op.path);\n        try {\n          rmdirSync(dirname(op.path)); // only when empty: a skill folder with nothing left would still be listed\n        } catch {}\n      }\n    } else {\n      mkdirSync(dirname(op.path), { recursive: true });\n      writeFileSync(op.path, op.content);\n    }\n    files.push({ path: op.path, before, after: snapshot(repo, op.path) });\n  }\n  const entry: LedgerEntry = { id: `${Date.now().toString(36)}-${randomBytes(3).toString(\"hex\")}`, ts: new Date().toISOString(), ...meta, files };\n  mkdirSync(stateDir(repo), { recursive: true });\n  appendFileSync(ledgerPath(repo), JSON.stringify(entry) + \"\\n\");\n  return entry;\n}\n\nexport function readLedger(repo: string): LedgerEntry[] {\n  try {\n    return readFileSync(ledgerPath(repo), \"utf8\").split(\"\\n\").filter(Boolean).map((l) => JSON.parse(l));\n  } catch {\n    return [];\n  }\n}\n\n/** Undo one entry: every file it touched goes back to its exact bytes before (or aside, if it did not exist). */\nexport function rollback(repo: string, id: string): LedgerEntry {\n  const entry = readLedger(repo).find((e) => e.id === id);\n  if (!entry) throw new Error(`no ledger entry ${id}`);\n  for (const f of entry.files) {\n    const now = existsSync(f.path) ? sha256(readFileSync(f.path)) : null;\n    if (now !== f.after) throw new Error(`${f.path} changed since ${id}: roll back the later change first`);\n  }\n  const ops = entry.files.map((f) => ({ path: f.path, content: f.before ? readFileSync(join(blobDir(repo), f.before)) : null }));\n  return applyChange(repo, { action: \"rollback\", actor: \"user\", skill: entry.skill, why: `rollback of ${entry.action} ${id}`, reverts: id }, ops);\n}\n"],"mappings":";;;;;AAOA,SAAS,YAAY,mBAAmB;AACxC,SAAS,gBAAgB,YAAY,WAAW,cAAc,WAAW,YAAY,qBAAqB;AAC1G,SAAS,SAAS,YAAY;AAwBvB,IAAM,aAAa,CAAC,SAAiB,KAAK,SAAS,IAAI,GAAG,oBAAoB;AACrF,IAAM,UAAU,CAAC,SAAiB,KAAK,SAAS,IAAI,GAAG,oBAAoB;AACpE,IAAM,aAAa,CAAC,SAAiB,KAAK,SAAS,IAAI,GAAG,gBAAgB;AACjF,IAAM,SAAS,CAAC,MAAuB,WAAW,QAAQ,EAAE,OAAO,CAAC,EAAE,OAAO,KAAK;AAElF,SAAS,QAAQ,MAAc,OAAuB;AACpD,QAAM,IAAI,OAAO,KAAK;AACtB,QAAM,IAAI,KAAK,QAAQ,IAAI,GAAG,CAAC;AAC/B,MAAI,CAAC,WAAW,CAAC,GAAG;AAClB,cAAU,QAAQ,IAAI,GAAG,EAAE,WAAW,KAAK,CAAC;AAC5C,kBAAc,GAAG,KAAK;AAAA,EACxB;AACA,SAAO;AACT;AAEA,IAAM,WAAW,CAAC,MAAc,SAAiC,WAAW,IAAI,IAAI,QAAQ,MAAM,aAAa,IAAI,CAAC,IAAI;AAMjH,SAAS,YACd,MACA,MACA,KACa;AACb,QAAM,QAAsB,CAAC;AAC7B,aAAW,MAAM,KAAK;AACpB,UAAM,SAAS,SAAS,MAAM,GAAG,IAAI;AACrC,QAAI,GAAG,YAAY,MAAM;AACvB,UAAI,QAAQ;AACV,mBAAW,GAAG,IAAI;AAClB,YAAI;AACF,oBAAU,QAAQ,GAAG,IAAI,CAAC;AAAA,QAC5B,QAAQ;AAAA,QAAC;AAAA,MACX;AAAA,IACF,OAAO;AACL,gBAAU,QAAQ,GAAG,IAAI,GAAG,EAAE,WAAW,KAAK,CAAC;AAC/C,oBAAc,GAAG,MAAM,GAAG,OAAO;AAAA,IACnC;AACA,UAAM,KAAK,EAAE,MAAM,GAAG,MAAM,QAAQ,OAAO,SAAS,MAAM,GAAG,IAAI,EAAE,CAAC;AAAA,EACtE;AACA,QAAM,QAAqB,EAAE,IAAI,GAAG,KAAK,IAAI,EAAE,SAAS,EAAE,CAAC,IAAI,YAAY,CAAC,EAAE,SAAS,KAAK,CAAC,IAAI,KAAI,oBAAI,KAAK,GAAE,YAAY,GAAG,GAAG,MAAM,MAAM;AAC9I,YAAU,SAAS,IAAI,GAAG,EAAE,WAAW,KAAK,CAAC;AAC7C,iBAAe,WAAW,IAAI,GAAG,KAAK,UAAU,KAAK,IAAI,IAAI;AAC7D,SAAO;AACT;AAEO,SAAS,WAAW,MAA6B;AACtD,MAAI;AACF,WAAO,aAAa,WAAW,IAAI,GAAG,MAAM,EAAE,MAAM,IAAI,EAAE,OAAO,OAAO,EAAE,IAAI,CAAC,MAAM,KAAK,MAAM,CAAC,CAAC;AAAA,EACpG,QAAQ;AACN,WAAO,CAAC;AAAA,EACV;AACF;AAGO,SAAS,SAAS,MAAc,IAAyB;AAC9D,QAAM,QAAQ,WAAW,IAAI,EAAE,KAAK,CAAC,MAAM,EAAE,OAAO,EAAE;AACtD,MAAI,CAAC,MAAO,OAAM,IAAI,MAAM,mBAAmB,EAAE,EAAE;AACnD,aAAW,KAAK,MAAM,OAAO;AAC3B,UAAM,MAAM,WAAW,EAAE,IAAI,IAAI,OAAO,aAAa,EAAE,IAAI,CAAC,IAAI;AAChE,QAAI,QAAQ,EAAE,MAAO,OAAM,IAAI,MAAM,GAAG,EAAE,IAAI,kBAAkB,EAAE,oCAAoC;AAAA,EACxG;AACA,QAAM,MAAM,MAAM,MAAM,IAAI,CAAC,OAAO,EAAE,MAAM,EAAE,MAAM,SAAS,EAAE,SAAS,aAAa,KAAK,QAAQ,IAAI,GAAG,EAAE,MAAM,CAAC,IAAI,KAAK,EAAE;AAC7H,SAAO,YAAY,MAAM,EAAE,QAAQ,YAAY,OAAO,QAAQ,OAAO,MAAM,OAAO,KAAK,eAAe,MAAM,MAAM,IAAI,EAAE,IAAI,SAAS,GAAG,GAAG,GAAG;AAChJ;","names":[]}

package/dist/{chunk-CAX46XLY.js → chunk-VBLCUWT4.js}

@@ -1,7 +1,7 @@
 import {
   loadSchema,
   validateNote
-} from "./chunk-FURCIJBO.js";
+} from "./chunk-Y7H76Q7F.js";
 import {
   computeDecay,
   loadDecayConfig,
@@ -9,24 +9,26 @@ import {
 } from "./chunk-5ZKNO6ZD.js";
 import {
   readSelectionLog
-} from "./chunk-NBY4TRP7.js";
+} from "./chunk-7M34JDTH.js";
 import {
   compileLexicon,
   findAliasConflicts
-} from "./chunk-FTRXH2WC.js";
+} from "./chunk-7UAVDOI6.js";
 import {
   deriveProjectRoot
-} from "./chunk-LGQPP5FQ.js";
+} from "./chunk-EYVFC745.js";
+import {
+  matter_default
+} from "./chunk-J7LYDRML.js";
 import {
   findSecrets
-} from "./chunk-OEF5U5GV.js";
+} from "./chunk-H2BES6FU.js";
 
 // src/core/lint.ts
 import { readFile } from "fs/promises";
 import { existsSync } from "fs";
-import { basename, join } from "path";
+import { basename, dirname, join, relative } from "path";
 import { glob } from "glob";
-import matter from "gray-matter";
 async function lintVault(notesPath, opts = {}) {
   const schema = opts.schemaOverride ?? await loadSchema(notesPath);
   const files = await glob(opts.pathGlob ?? "**/*.md", {
@@ -76,6 +78,14 @@ async function lintVault(notesPath, opts = {}) {
   if (opts.checkDecoys) {
     findings.push(...await findDecoys(notesPath, rawByPath));
   }
+  if (opts.checkSkills) {
+    const { lintSkills } = await import("./skill-schema-RVB3EHEF.js");
+    const derived = deriveProjectRoot(notesPath);
+    const root = opts.projectRoot ?? (basename(derived) === ".documentation" ? dirname(derived) : derived);
+    for (const f of lintSkills(root).findings) {
+      findings.push({ path: relative(root, f.path), rule: "skills", severity: f.severity, message: `${f.rule}: ${f.message}` });
+    }
+  }
   const byRule = {
     schema_violations: findings.filter((f) => f.rule === "schema_violations"),
     missing_provenance: findings.filter((f) => f.rule === "missing_provenance"),
@@ -85,7 +95,8 @@ async function lintVault(notesPath, opts = {}) {
     decay_candidates: findings.filter((f) => f.rule === "decay_candidates"),
     alias_conflicts: findings.filter((f) => f.rule === "alias_conflicts"),
     decoys: findings.filter((f) => f.rule === "decoys"),
-    ...opts.checkSecrets ? { secrets: findings.filter((f) => f.rule === "secrets") } : {}
+    ...opts.checkSecrets ? { secrets: findings.filter((f) => f.rule === "secrets") } : {},
+    ...opts.checkSkills ? { skills: findings.filter((f) => f.rule === "skills") } : {}
   };
   const errors = findings.filter((f) => f.severity === "error").length;
   const warnings = findings.filter((f) => f.severity === "warn").length;
@@ -97,7 +108,7 @@ async function lintVault(notesPath, opts = {}) {
   };
 }
 function findBrokenLinks(relPath, rawFileContent, knownNames) {
-  const { content } = matter(rawFileContent);
+  const { content } = matter_default(rawFileContent);
   const findings = [];
   const stripped = content.replace(/```[\s\S]*?```/g, "").replace(/`[^`]+`/g, "");
   const re = /\[\[([^\]\|]+)(?:\|[^\]]+)?\]\]/g;
@@ -159,7 +170,7 @@ function resolveCodeRoot(root) {
   return markers.some((m) => existsSync(join(root, m))) ? root : null;
 }
 function findCodeSymbolDrift(relPath, rawFileContent, codeRoot) {
-  const { content } = matter(rawFileContent);
+  const { content } = matter_default(rawFileContent);
   const withoutFences = content.replace(/```[\s\S]*?```/g, "");
   const findings = [];
   const seen = /* @__PURE__ */ new Set();
@@ -216,7 +227,7 @@ async function findDecayCandidates(notesPath, rawByPath, todayIso) {
   for (const [rel, count] of retrieved) {
     const raw = rawByPath.get(rel);
     if (!raw) continue;
-    const { data: fm } = matter(raw);
+    const { data: fm } = matter_default(raw);
     const decay = computeDecay({
       type: typeof fm.type === "string" ? fm.type : void 0,
       last_verified: normalizeVerifiedDate(fm.last_verified),
@@ -283,4 +294,4 @@ export {
   lintVault,
   formatLintReport
 };
-//# sourceMappingURL=chunk-CAX46XLY.js.map
+//# sourceMappingURL=chunk-VBLCUWT4.js.map

package/dist/chunk-VBLCUWT4.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/core/lint.ts"],"sourcesContent":["import { readFile } from \"node:fs/promises\";\nimport { existsSync } from \"node:fs\";\nimport { basename, dirname, join, relative } from \"node:path\";\nimport { glob } from \"glob\";\nimport matter from \"./matter.js\";\nimport { loadSchema, validateNote, type LintFinding, type VaultSchema } from \"./schema.js\";\nimport { deriveProjectRoot } from \"./session.js\";\nimport { computeDecay, loadDecayConfig, normalizeVerifiedDate } from \"./decay.js\";\nimport { readSelectionLog } from \"./telemetry.js\";\nimport { compileLexicon, findAliasConflicts } from \"./lexicon.js\";\nimport { findSecrets } from \"./redact.js\";\n\nexport interface LintReport {\n  schemaPath: string;\n  findings: LintFinding[];\n  byRule: {\n    schema_violations: LintFinding[];\n    missing_provenance: LintFinding[];\n    stale: LintFinding[];\n    broken_links: LintFinding[];\n    code_symbols: LintFinding[];\n    decay_candidates: LintFinding[];\n    alias_conflicts: LintFinding[];\n    decoys: LintFinding[];\n    /** only present when the opt-in secrets check ran */\n    secrets?: LintFinding[];\n    /** only present when the opt-in skills check ran */\n    skills?: LintFinding[];\n  };\n  counts: {\n    errors: number;\n    warnings: number;\n    filesLinted: number;\n  };\n}\n\nexport async function lintVault(\n  notesPath: string,\n  opts: {\n    pathGlob?: string;\n    schemaOverride?: VaultSchema;\n    todayIso?: string;\n    /**\n     * When true, run the code-symbol drift check: flag inline-code file-path\n     * references in notes that no longer exist under the project root. Opt-in\n     * (off by default) so the standard report and the healthcheck slow tier stay\n     * quiet and byte-stable. Fails open when the project root is not a code repo.\n     */\n    checkCodeSymbols?: boolean;\n    /** Override the project root for code-symbol resolution (default: derived from notesPath). */\n    projectRoot?: string;\n    /**\n     * When true, run the decay-candidates check: cross-reference the selection\n     * log (notes that appeared in recent search results) against each note's\n     * current decay multiplier, and flag notes that are frequently retrieved yet\n     * heavily decayed (\"relevant but going stale — verify or revise\"). Opt-in;\n     * a silent no-op when no selection log exists.\n     */\n    checkDecayCandidates?: boolean;\n    /**\n     * When true, run the alias-conflict check: flag lexicon phrases that map to\n     * more than one canonical target (a wrong binding misroutes queries). Opt-in;\n     * no-op when the vault has no lexicon.\n     */\n    checkAliasConflicts?: boolean;\n    /**\n     * When true, run the decoys check: flag notes that were retrieved often (per\n     * the selection log) but NEVER cited in an answer. Surfaced for a human to\n     * judge — a decoy might be genuine noise OR a note the answers were wrong to\n     * skip; usage-feedback ranking (v1.5) never auto-down-ranks on this ambiguous\n     * signal (decision Q5). Opt-in; a no-op with no selection log.\n     */\n    checkDecoys?: boolean;\n    /**\n     * When true, run the secrets check (v1.5.3): flag notes that contain a secret\n     * (API key, token, password, private key — the redactor's precise set). Reports\n     * path, line and kind, never the value; nothing is rewritten. Opt-in, so the\n     * default report stays byte-stable. A real secret must be rotated: it is in\n     * git history if the note was ever committed.\n     */\n    checkSecrets?: boolean;\n    /** When true, lint the skill loop's learned skills this repo loads (v1.7): format, evidence, cites, clashes. Opt-in. */\n    checkSkills?: boolean;\n  } = {}\n): Promise<LintReport> {\n  const schema = opts.schemaOverride ?? (await loadSchema(notesPath));\n  const files = await glob(opts.pathGlob ?? \"**/*.md\", {\n    cwd: notesPath,\n    ignore: [\"node_modules/**\", \".semantic-sidekick-index/**\", \"vault.schema.yml\"],\n  });\n\n  const findings: LintFinding[] = [];\n  // Build known-note set first, to make broken-link detection O(1) per link.\n  const knownNames = new Set<string>();\n  const rawByPath = new Map<string, string>();\n  for (const rel of files) {\n    try {\n      const raw = await readFile(join(notesPath, rel), \"utf-8\");\n      rawByPath.set(rel, raw);\n      // Wikilink names match on basename-without-ext (obsidian-style)\n      knownNames.add(basename(rel).replace(/\\.md$/, \"\"));\n    } catch {\n      /* skip */\n    }\n  }\n\n  // Code-symbol drift is opt-in and only meaningful against a real code repo.\n  const codeRoot = opts.checkCodeSymbols\n    ? resolveCodeRoot(opts.projectRoot ?? deriveProjectRoot(notesPath))\n    : null;\n\n  for (const [rel, raw] of rawByPath) {\n    findings.push(...validateNote(rel, raw, schema, { todayIso: opts.todayIso }));\n    findings.push(...findBrokenLinks(rel, raw, knownNames));\n    if (codeRoot) findings.push(...findCodeSymbolDrift(rel, raw, codeRoot));\n    if (opts.checkSecrets) {\n      for (const s of findSecrets(raw)) {\n        findings.push({\n          path: rel,\n          rule: \"secrets\",\n          severity: \"error\",\n          message: `line ${s.line}: ${s.kind} — rotate it if it is real, then remove it from the note (redaction does not rewrite git history)`,\n        });\n      }\n    }\n  }\n\n  if (opts.checkDecayCandidates) {\n    findings.push(...(await findDecayCandidates(notesPath, rawByPath, opts.todayIso)));\n  }\n\n  if (opts.checkAliasConflicts) {\n    for (const c of findAliasConflicts(await compileLexicon(notesPath))) {\n      findings.push({\n        path: \"lexicon\",\n        rule: \"alias_conflicts\",\n        severity: \"warn\",\n        message: `phrase \"${c.phrase}\" maps to ${c.canonicals.length} targets: ${c.canonicals.join(\", \")} — pick one`,\n      });\n    }\n  }\n\n  if (opts.checkDecoys) {\n    findings.push(...(await findDecoys(notesPath, rawByPath)));\n  }\n\n  if (opts.checkSkills) {\n    const { lintSkills } = await import(\"./skill-schema.js\");\n    // .claude/.vault → the repo; a docs corpus (.documentation) sits at the repo root too\n    const derived = deriveProjectRoot(notesPath);\n    const root = opts.projectRoot ?? (basename(derived) === \".documentation\" ? dirname(derived) : derived);\n    for (const f of lintSkills(root).findings) {\n      findings.push({ path: relative(root, f.path), rule: \"skills\", severity: f.severity, message: `${f.rule}: ${f.message}` });\n    }\n  }\n\n  const byRule = {\n    schema_violations: findings.filter((f) => f.rule === \"schema_violations\"),\n    missing_provenance: findings.filter((f) => f.rule === \"missing_provenance\"),\n    stale: findings.filter((f) => f.rule === \"stale\"),\n    broken_links: findings.filter((f) => f.rule === \"broken_links\"),\n    code_symbols: findings.filter((f) => f.rule === \"code_symbols\"),\n    decay_candidates: findings.filter((f) => f.rule === \"decay_candidates\"),\n    alias_conflicts: findings.filter((f) => f.rule === \"alias_conflicts\"),\n    decoys: findings.filter((f) => f.rule === \"decoys\"),\n    ...(opts.checkSecrets ? { secrets: findings.filter((f) => f.rule === \"secrets\") } : {}),\n    ...(opts.checkSkills ? { skills: findings.filter((f) => f.rule === \"skills\") } : {}),\n  };\n  const errors = findings.filter((f) => f.severity === \"error\").length;\n  const warnings = findings.filter((f) => f.severity === \"warn\").length;\n\n  return {\n    schemaPath: join(notesPath, \"vault.schema.yml\"),\n    findings,\n    byRule,\n    counts: { errors, warnings, filesLinted: files.length },\n  };\n}\n\nfunction findBrokenLinks(\n  relPath: string,\n  rawFileContent: string,\n  knownNames: Set<string>\n): LintFinding[] {\n  const { content } = matter(rawFileContent);\n  const findings: LintFinding[] = [];\n  // Match [[target]] and [[target|alias]] — skip fenced code and inline code.\n  const stripped = content\n    .replace(/```[\\s\\S]*?```/g, \"\")\n    .replace(/`[^`]+`/g, \"\");\n  const re = /\\[\\[([^\\]\\|]+)(?:\\|[^\\]]+)?\\]\\]/g;\n  const seen = new Set<string>();\n  let m: RegExpExecArray | null;\n  while ((m = re.exec(stripped)) !== null) {\n    const target = m[1].trim().split(\"#\")[0].split(\"/\").pop()!.replace(/\\.md$/, \"\");\n    if (seen.has(target)) continue;\n    seen.add(target);\n    if (!knownNames.has(target)) {\n      findings.push({\n        path: relPath,\n        rule: \"broken_links\",\n        severity: \"warn\",\n        message: `wikilink [[${target}]] has no matching note`,\n      });\n    }\n  }\n  return findings;\n}\n\n/** File extensions we treat as \"this looks like a source/doc file reference\". */\nconst CODE_EXTENSIONS = new Set([\n  \"ts\", \"tsx\", \"js\", \"jsx\", \"mjs\", \"cjs\", \"py\", \"rb\", \"go\", \"rs\", \"java\", \"kt\",\n  \"c\", \"h\", \"cpp\", \"hpp\", \"cs\", \"php\", \"swift\", \"scala\", \"sh\", \"bash\", \"sql\",\n  \"json\", \"yaml\", \"yml\", \"toml\", \"css\", \"scss\", \"html\", \"vue\", \"svelte\", \"md\",\n]);\n\n/**\n * Decide whether `root` is a real code repository worth checking paths against.\n * Fails open (returns null) for non-code roots so the check is a silent no-op\n * outside a project — e.g. a standalone vault, or when babel-fish isn't present.\n */\nfunction resolveCodeRoot(root: string): string | null {\n  if (!root || !existsSync(root)) return null;\n  const markers = [\"package.json\", \".git\", \"src\", \"lib\", \"pyproject.toml\", \"go.mod\", \"Cargo.toml\"];\n  return markers.some((m) => existsSync(join(root, m))) ? root : null;\n}\n\n/**\n * Code-symbol drift: scan a note's inline-code spans for repo-relative file-path\n * references and flag ones whose first path segment IS a real directory in the repo\n * but whose full path no longer exists — i.e. a stale reference to a moved/deleted\n * file. Anchoring on an existing first segment keeps false positives low: paths\n * belonging to other repos (whose top-level dir isn't present here) are skipped.\n *\n * Scope note: this validates *path* references. Fine-grained symbol-name checking\n * (function/class identifiers) needs a real symbol index and is planned for the\n * v1.4 lexicon arc, which will extend this same `code_symbols` rule.\n */\nfunction findCodeSymbolDrift(relPath: string, rawFileContent: string, codeRoot: string): LintFinding[] {\n  const { content } = matter(rawFileContent);\n  // Inline-code spans only (single backtick). Fenced blocks are illustrative and\n  // over-match. Strip fenced blocks first so their backticks don't confuse the span regex.\n  const withoutFences = content.replace(/```[\\s\\S]*?```/g, \"\");\n  const findings: LintFinding[] = [];\n  const seen = new Set<string>();\n  const re = /`([^`\\n]+)`/g;\n  let m: RegExpExecArray | null;\n  while ((m = re.exec(withoutFences)) !== null) {\n    let token = m[1].trim();\n    if (!looksLikeRepoPath(token)) continue;\n    token = token.replace(/^\\.\\//, \"\");\n    if (seen.has(token)) continue;\n    seen.add(token);\n    const firstSeg = token.split(\"/\")[0];\n    // Only judge paths anchored in a directory that actually exists in this repo.\n    if (!existsSync(join(codeRoot, firstSeg))) continue;\n    if (!existsSync(join(codeRoot, token))) {\n      findings.push({\n        path: relPath,\n        rule: \"code_symbols\",\n        severity: \"warn\",\n        message: `inline code path \\`${token}\\` does not exist under the project root (stale reference?)`,\n      });\n    }\n  }\n  return findings;\n}\n\nfunction looksLikeRepoPath(token: string): boolean {\n  if (!token.includes(\"/\")) return false;\n  if (/\\s/.test(token)) return false; // commands, prose\n  if (token.includes(\"://\")) return false; // URLs\n  if (/[*?\\[\\]{}()<>|]/.test(token)) return false; // globs / shell / placeholders\n  if (token.startsWith(\"/\") || token.startsWith(\"~\")) return false; // absolute / home\n  const normalized = token.replace(/^\\.\\//, \"\");\n  if (normalized.startsWith(\"..\")) return false; // escapes the repo\n  const last = normalized.split(\"/\").pop() ?? \"\";\n  const dot = last.lastIndexOf(\".\");\n  if (dot <= 0) return false; // no extension → likely a dir or a symbol like a/b\n  const ext = last.slice(dot + 1).toLowerCase();\n  return CODE_EXTENSIONS.has(ext);\n}\n\n/** Multiplier at or below which a frequently-retrieved note is worth surfacing. */\nconst DECAY_CANDIDATE_THRESHOLD = 0.5;\n\n/**\n * Decay-candidates: notes that keep showing up in search results but have decayed.\n * Reads the selection log (search events record the paths each query returned),\n * computes each retrieved note's current decay multiplier from its frontmatter,\n * and flags those at/below the threshold — \"this keeps being relevant but is\n * going stale; verify or revise.\" Index-free (no embedder); a no-op when there's\n * no selection log yet.\n */\nasync function findDecayCandidates(\n  notesPath: string,\n  rawByPath: Map<string, string>,\n  todayIso?: string\n): Promise<LintFinding[]> {\n  const events = await readSelectionLog(notesPath);\n  if (events.length === 0) return [];\n\n  // Count how often each path was retrieved (appeared in a search's results).\n  const retrieved = new Map<string, number>();\n  for (const e of events) {\n    if (e.kind === \"search\") {\n      for (const r of e.results) retrieved.set(r.path, (retrieved.get(r.path) ?? 0) + 1);\n    }\n  }\n  if (retrieved.size === 0) return [];\n\n  const config = loadDecayConfig(notesPath);\n  if (!config.enabled) return [];\n  const nowMs = todayIso ? Date.parse(todayIso) : undefined;\n\n  const findings: LintFinding[] = [];\n  for (const [rel, count] of retrieved) {\n    const raw = rawByPath.get(rel);\n    if (!raw) continue; // retrieved path no longer in the vault — skip\n    const { data: fm } = matter(raw);\n    const decay = computeDecay({\n      type: typeof fm.type === \"string\" ? fm.type : undefined,\n      last_verified: normalizeVerifiedDate(fm.last_verified),\n      evergreen: fm.evergreen === true,\n      config,\n      nowMs,\n    });\n    if (decay.multiplier <= DECAY_CANDIDATE_THRESHOLD) {\n      findings.push({\n        path: rel,\n        rule: \"decay_candidates\",\n        severity: \"warn\",\n        message: `retrieved ${count}× recently but decayed to ${decay.multiplier.toFixed(2)} (age ${Math.round(decay.age_days)}d) — verify_note or revise`,\n      });\n    }\n  }\n  // Most-retrieved first — the ones worth re-verifying soonest.\n  findings.sort((a, b) => (retrieved.get(b.path) ?? 0) - (retrieved.get(a.path) ?? 0));\n  return findings;\n}\n\n/** A note must be retrieved at least this many times before \"never cited\" is signal. */\nconst DECOY_MIN_RETRIEVALS = 3;\n\n/**\n * Decoys (v1.5 Phase 9): notes retrieved ≥ DECOY_MIN_RETRIEVALS times that were\n * NEVER cited. Surfaced only — usage-feedback ranking never auto-down-ranks on\n * this ambiguous signal (a decoy might be genuine noise, or a note the answers\n * were wrong to skip). A human decides; the lint just points.\n */\nasync function findDecoys(notesPath: string, rawByPath: Map<string, string>): Promise<LintFinding[]> {\n  const events = await readSelectionLog(notesPath);\n  if (events.length === 0) return [];\n\n  const retrieved = new Map<string, number>();\n  const cited = new Set<string>();\n  for (const e of events) {\n    if (e.kind === \"search\") {\n      for (const r of e.results) retrieved.set(r.path, (retrieved.get(r.path) ?? 0) + 1);\n    } else if (e.kind === \"selection\") {\n      cited.add(e.note_path);\n    }\n  }\n\n  const findings: LintFinding[] = [];\n  for (const [rel, count] of retrieved) {\n    if (count < DECOY_MIN_RETRIEVALS) continue;\n    if (cited.has(rel)) continue;\n    if (!rawByPath.has(rel)) continue; // retrieved path no longer in the vault — skip\n    findings.push({\n      path: rel,\n      rule: \"decoys\",\n      severity: \"warn\",\n      message: `retrieved ${count}× but never cited — decoy noise, or a note answers wrongly skip? (surfaced, not auto-down-ranked)`,\n    });\n  }\n  findings.sort((a, b) => (retrieved.get(b.path) ?? 0) - (retrieved.get(a.path) ?? 0));\n  return findings;\n}\n\nexport function formatLintReport(report: LintReport, opts: { rule?: keyof LintReport[\"byRule\"] } = {}): string {\n  const target = (opts.rule ? report.byRule[opts.rule] : report.findings) ?? [];\n  if (target.length === 0) {\n    return `clean: 0 findings across ${report.counts.filesLinted} files`;\n  }\n  const lines = [\n    `${target.length} finding${target.length === 1 ? \"\" : \"s\"} (errors=${report.counts.errors}, warnings=${report.counts.warnings}, files=${report.counts.filesLinted})`,\n    \"\",\n  ];\n  for (const f of target) {\n    lines.push(`[${f.severity}] ${f.rule}: ${f.path} — ${f.message}`);\n  }\n  return lines.join(\"\\n\");\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;AAAA,SAAS,gBAAgB;AACzB,SAAS,kBAAkB;AAC3B,SAAS,UAAU,SAAS,MAAM,gBAAgB;AAClD,SAAS,YAAY;AAiCrB,eAAsB,UACpB,WACA,OA6CI,CAAC,GACgB;AACrB,QAAM,SAAS,KAAK,kBAAmB,MAAM,WAAW,SAAS;AACjE,QAAM,QAAQ,MAAM,KAAK,KAAK,YAAY,WAAW;AAAA,IACnD,KAAK;AAAA,IACL,QAAQ,CAAC,mBAAmB,+BAA+B,kBAAkB;AAAA,EAC/E,CAAC;AAED,QAAM,WAA0B,CAAC;AAEjC,QAAM,aAAa,oBAAI,IAAY;AACnC,QAAM,YAAY,oBAAI,IAAoB;AAC1C,aAAW,OAAO,OAAO;AACvB,QAAI;AACF,YAAM,MAAM,MAAM,SAAS,KAAK,WAAW,GAAG,GAAG,OAAO;AACxD,gBAAU,IAAI,KAAK,GAAG;AAEtB,iBAAW,IAAI,SAAS,GAAG,EAAE,QAAQ,SAAS,EAAE,CAAC;AAAA,IACnD,QAAQ;AAAA,IAER;AAAA,EACF;AAGA,QAAM,WAAW,KAAK,mBAClB,gBAAgB,KAAK,eAAe,kBAAkB,SAAS,CAAC,IAChE;AAEJ,aAAW,CAAC,KAAK,GAAG,KAAK,WAAW;AAClC,aAAS,KAAK,GAAG,aAAa,KAAK,KAAK,QAAQ,EAAE,UAAU,KAAK,SAAS,CAAC,CAAC;AAC5E,aAAS,KAAK,GAAG,gBAAgB,KAAK,KAAK,UAAU,CAAC;AACtD,QAAI,SAAU,UAAS,KAAK,GAAG,oBAAoB,KAAK,KAAK,QAAQ,CAAC;AACtE,QAAI,KAAK,cAAc;AACrB,iBAAW,KAAK,YAAY,GAAG,GAAG;AAChC,iBAAS,KAAK;AAAA,UACZ,MAAM;AAAA,UACN,MAAM;AAAA,UACN,UAAU;AAAA,UACV,SAAS,QAAQ,EAAE,IAAI,KAAK,EAAE,IAAI;AAAA,QACpC,CAAC;AAAA,MACH;AAAA,IACF;AAAA,EACF;AAEA,MAAI,KAAK,sBAAsB;AAC7B,aAAS,KAAK,GAAI,MAAM,oBAAoB,WAAW,WAAW,KAAK,QAAQ,CAAE;AAAA,EACnF;AAEA,MAAI,KAAK,qBAAqB;AAC5B,eAAW,KAAK,mBAAmB,MAAM,eAAe,SAAS,CAAC,GAAG;AACnE,eAAS,KAAK;AAAA,QACZ,MAAM;AAAA,QACN,MAAM;AAAA,QACN,UAAU;AAAA,QACV,SAAS,WAAW,EAAE,MAAM,aAAa,EAAE,WAAW,MAAM,aAAa,EAAE,WAAW,KAAK,IAAI,CAAC;AAAA,MAClG,CAAC;AAAA,IACH;AAAA,EACF;AAEA,MAAI,KAAK,aAAa;AACpB,aAAS,KAAK,GAAI,MAAM,WAAW,WAAW,SAAS,CAAE;AAAA,EAC3D;AAEA,MAAI,KAAK,aAAa;AACpB,UAAM,EAAE,WAAW,IAAI,MAAM,OAAO,4BAAmB;AAEvD,UAAM,UAAU,kBAAkB,SAAS;AAC3C,UAAM,OAAO,KAAK,gBAAgB,SAAS,OAAO,MAAM,mBAAmB,QAAQ,OAAO,IAAI;AAC9F,eAAW,KAAK,WAAW,IAAI,EAAE,UAAU;AACzC,eAAS,KAAK,EAAE,MAAM,SAAS,MAAM,EAAE,IAAI,GAAG,MAAM,UAAU,UAAU,EAAE,UAAU,SAAS,GAAG,EAAE,IAAI,KAAK,EAAE,OAAO,GAAG,CAAC;AAAA,IAC1H;AAAA,EACF;AAEA,QAAM,SAAS;AAAA,IACb,mBAAmB,SAAS,OAAO,CAAC,MAAM,EAAE,SAAS,mBAAmB;AAAA,IACxE,oBAAoB,SAAS,OAAO,CAAC,MAAM,EAAE,SAAS,oBAAoB;AAAA,IAC1E,OAAO,SAAS,OAAO,CAAC,MAAM,EAAE,SAAS,OAAO;AAAA,IAChD,cAAc,SAAS,OAAO,CAAC,MAAM,EAAE,SAAS,cAAc;AAAA,IAC9D,cAAc,SAAS,OAAO,CAAC,MAAM,EAAE,SAAS,cAAc;AAAA,IAC9D,kBAAkB,SAAS,OAAO,CAAC,MAAM,EAAE,SAAS,kBAAkB;AAAA,IACtE,iBAAiB,SAAS,OAAO,CAAC,MAAM,EAAE,SAAS,iBAAiB;AAAA,IACpE,QAAQ,SAAS,OAAO,CAAC,MAAM,EAAE,SAAS,QAAQ;AAAA,IAClD,GAAI,KAAK,eAAe,EAAE,SAAS,SAAS,OAAO,CAAC,MAAM,EAAE,SAAS,SAAS,EAAE,IAAI,CAAC;AAAA,IACrF,GAAI,KAAK,cAAc,EAAE,QAAQ,SAAS,OAAO,CAAC,MAAM,EAAE,SAAS,QAAQ,EAAE,IAAI,CAAC;AAAA,EACpF;AACA,QAAM,SAAS,SAAS,OAAO,CAAC,MAAM,EAAE,aAAa,OAAO,EAAE;AAC9D,QAAM,WAAW,SAAS,OAAO,CAAC,MAAM,EAAE,aAAa,MAAM,EAAE;AAE/D,SAAO;AAAA,IACL,YAAY,KAAK,WAAW,kBAAkB;AAAA,IAC9C;AAAA,IACA;AAAA,IACA,QAAQ,EAAE,QAAQ,UAAU,aAAa,MAAM,OAAO;AAAA,EACxD;AACF;AAEA,SAAS,gBACP,SACA,gBACA,YACe;AACf,QAAM,EAAE,QAAQ,IAAI,eAAO,cAAc;AACzC,QAAM,WAA0B,CAAC;AAEjC,QAAM,WAAW,QACd,QAAQ,mBAAmB,EAAE,EAC7B,QAAQ,YAAY,EAAE;AACzB,QAAM,KAAK;AACX,QAAM,OAAO,oBAAI,IAAY;AAC7B,MAAI;AACJ,UAAQ,IAAI,GAAG,KAAK,QAAQ,OAAO,MAAM;AACvC,UAAM,SAAS,EAAE,CAAC,EAAE,KAAK,EAAE,MAAM,GAAG,EAAE,CAAC,EAAE,MAAM,GAAG,EAAE,IAAI,EAAG,QAAQ,SAAS,EAAE;AAC9E,QAAI,KAAK,IAAI,MAAM,EAAG;AACtB,SAAK,IAAI,MAAM;AACf,QAAI,CAAC,WAAW,IAAI,MAAM,GAAG;AAC3B,eAAS,KAAK;AAAA,QACZ,MAAM;AAAA,QACN,MAAM;AAAA,QACN,UAAU;AAAA,QACV,SAAS,cAAc,MAAM;AAAA,MAC/B,CAAC;AAAA,IACH;AAAA,EACF;AACA,SAAO;AACT;AAGA,IAAM,kBAAkB,oBAAI,IAAI;AAAA,EAC9B;AAAA,EAAM;AAAA,EAAO;AAAA,EAAM;AAAA,EAAO;AAAA,EAAO;AAAA,EAAO;AAAA,EAAM;AAAA,EAAM;AAAA,EAAM;AAAA,EAAM;AAAA,EAAQ;AAAA,EACxE;AAAA,EAAK;AAAA,EAAK;AAAA,EAAO;AAAA,EAAO;AAAA,EAAM;AAAA,EAAO;AAAA,EAAS;AAAA,EAAS;AAAA,EAAM;AAAA,EAAQ;AAAA,EACrE;AAAA,EAAQ;AAAA,EAAQ;AAAA,EAAO;AAAA,EAAQ;AAAA,EAAO;AAAA,EAAQ;AAAA,EAAQ;AAAA,EAAO;AAAA,EAAU;AACzE,CAAC;AAOD,SAAS,gBAAgB,MAA6B;AACpD,MAAI,CAAC,QAAQ,CAAC,WAAW,IAAI,EAAG,QAAO;AACvC,QAAM,UAAU,CAAC,gBAAgB,QAAQ,OAAO,OAAO,kBAAkB,UAAU,YAAY;AAC/F,SAAO,QAAQ,KAAK,CAAC,MAAM,WAAW,KAAK,MAAM,CAAC,CAAC,CAAC,IAAI,OAAO;AACjE;AAaA,SAAS,oBAAoB,SAAiB,gBAAwB,UAAiC;AACrG,QAAM,EAAE,QAAQ,IAAI,eAAO,cAAc;AAGzC,QAAM,gBAAgB,QAAQ,QAAQ,mBAAmB,EAAE;AAC3D,QAAM,WAA0B,CAAC;AACjC,QAAM,OAAO,oBAAI,IAAY;AAC7B,QAAM,KAAK;AACX,MAAI;AACJ,UAAQ,IAAI,GAAG,KAAK,aAAa,OAAO,MAAM;AAC5C,QAAI,QAAQ,EAAE,CAAC,EAAE,KAAK;AACtB,QAAI,CAAC,kBAAkB,KAAK,EAAG;AAC/B,YAAQ,MAAM,QAAQ,SAAS,EAAE;AACjC,QAAI,KAAK,IAAI,KAAK,EAAG;AACrB,SAAK,IAAI,KAAK;AACd,UAAM,WAAW,MAAM,MAAM,GAAG,EAAE,CAAC;AAEnC,QAAI,CAAC,WAAW,KAAK,UAAU,QAAQ,CAAC,EAAG;AAC3C,QAAI,CAAC,WAAW,KAAK,UAAU,KAAK,CAAC,GAAG;AACtC,eAAS,KAAK;AAAA,QACZ,MAAM;AAAA,QACN,MAAM;AAAA,QACN,UAAU;AAAA,QACV,SAAS,sBAAsB,KAAK;AAAA,MACtC,CAAC;AAAA,IACH;AAAA,EACF;AACA,SAAO;AACT;AAEA,SAAS,kBAAkB,OAAwB;AACjD,MAAI,CAAC,MAAM,SAAS,GAAG,EAAG,QAAO;AACjC,MAAI,KAAK,KAAK,KAAK,EAAG,QAAO;AAC7B,MAAI,MAAM,SAAS,KAAK,EAAG,QAAO;AAClC,MAAI,kBAAkB,KAAK,KAAK,EAAG,QAAO;AAC1C,MAAI,MAAM,WAAW,GAAG,KAAK,MAAM,WAAW,GAAG,EAAG,QAAO;AAC3D,QAAM,aAAa,MAAM,QAAQ,SAAS,EAAE;AAC5C,MAAI,WAAW,WAAW,IAAI,EAAG,QAAO;AACxC,QAAM,OAAO,WAAW,MAAM,GAAG,EAAE,IAAI,KAAK;AAC5C,QAAM,MAAM,KAAK,YAAY,GAAG;AAChC,MAAI,OAAO,EAAG,QAAO;AACrB,QAAM,MAAM,KAAK,MAAM,MAAM,CAAC,EAAE,YAAY;AAC5C,SAAO,gBAAgB,IAAI,GAAG;AAChC;AAGA,IAAM,4BAA4B;AAUlC,eAAe,oBACb,WACA,WACA,UACwB;AACxB,QAAM,SAAS,MAAM,iBAAiB,SAAS;AAC/C,MAAI,OAAO,WAAW,EAAG,QAAO,CAAC;AAGjC,QAAM,YAAY,oBAAI,IAAoB;AAC1C,aAAW,KAAK,QAAQ;AACtB,QAAI,EAAE,SAAS,UAAU;AACvB,iBAAW,KAAK,EAAE,QAAS,WAAU,IAAI,EAAE,OAAO,UAAU,IAAI,EAAE,IAAI,KAAK,KAAK,CAAC;AAAA,IACnF;AAAA,EACF;AACA,MAAI,UAAU,SAAS,EAAG,QAAO,CAAC;AAElC,QAAM,SAAS,gBAAgB,SAAS;AACxC,MAAI,CAAC,OAAO,QAAS,QAAO,CAAC;AAC7B,QAAM,QAAQ,WAAW,KAAK,MAAM,QAAQ,IAAI;AAEhD,QAAM,WAA0B,CAAC;AACjC,aAAW,CAAC,KAAK,KAAK,KAAK,WAAW;AACpC,UAAM,MAAM,UAAU,IAAI,GAAG;AAC7B,QAAI,CAAC,IAAK;AACV,UAAM,EAAE,MAAM,GAAG,IAAI,eAAO,GAAG;AAC/B,UAAM,QAAQ,aAAa;AAAA,MACzB,MAAM,OAAO,GAAG,SAAS,WAAW,GAAG,OAAO;AAAA,MAC9C,eAAe,sBAAsB,GAAG,aAAa;AAAA,MACrD,WAAW,GAAG,cAAc;AAAA,MAC5B;AAAA,MACA;AAAA,IACF,CAAC;AACD,QAAI,MAAM,cAAc,2BAA2B;AACjD,eAAS,KAAK;AAAA,QACZ,MAAM;AAAA,QACN,MAAM;AAAA,QACN,UAAU;AAAA,QACV,SAAS,aAAa,KAAK,gCAA6B,MAAM,WAAW,QAAQ,CAAC,CAAC,SAAS,KAAK,MAAM,MAAM,QAAQ,CAAC;AAAA,MACxH,CAAC;AAAA,IACH;AAAA,EACF;AAEA,WAAS,KAAK,CAAC,GAAG,OAAO,UAAU,IAAI,EAAE,IAAI,KAAK,MAAM,UAAU,IAAI,EAAE,IAAI,KAAK,EAAE;AACnF,SAAO;AACT;AAGA,IAAM,uBAAuB;AAQ7B,eAAe,WAAW,WAAmB,WAAwD;AACnG,QAAM,SAAS,MAAM,iBAAiB,SAAS;AAC/C,MAAI,OAAO,WAAW,EAAG,QAAO,CAAC;AAEjC,QAAM,YAAY,oBAAI,IAAoB;AAC1C,QAAM,QAAQ,oBAAI,IAAY;AAC9B,aAAW,KAAK,QAAQ;AACtB,QAAI,EAAE,SAAS,UAAU;AACvB,iBAAW,KAAK,EAAE,QAAS,WAAU,IAAI,EAAE,OAAO,UAAU,IAAI,EAAE,IAAI,KAAK,KAAK,CAAC;AAAA,IACnF,WAAW,EAAE,SAAS,aAAa;AACjC,YAAM,IAAI,EAAE,SAAS;AAAA,IACvB;AAAA,EACF;AAEA,QAAM,WAA0B,CAAC;AACjC,aAAW,CAAC,KAAK,KAAK,KAAK,WAAW;AACpC,QAAI,QAAQ,qBAAsB;AAClC,QAAI,MAAM,IAAI,GAAG,EAAG;AACpB,QAAI,CAAC,UAAU,IAAI,GAAG,EAAG;AACzB,aAAS,KAAK;AAAA,MACZ,MAAM;AAAA,MACN,MAAM;AAAA,MACN,UAAU;AAAA,MACV,SAAS,aAAa,KAAK;AAAA,IAC7B,CAAC;AAAA,EACH;AACA,WAAS,KAAK,CAAC,GAAG,OAAO,UAAU,IAAI,EAAE,IAAI,KAAK,MAAM,UAAU,IAAI,EAAE,IAAI,KAAK,EAAE;AACnF,SAAO;AACT;AAEO,SAAS,iBAAiB,QAAoB,OAA8C,CAAC,GAAW;AAC7G,QAAM,UAAU,KAAK,OAAO,OAAO,OAAO,KAAK,IAAI,IAAI,OAAO,aAAa,CAAC;AAC5E,MAAI,OAAO,WAAW,GAAG;AACvB,WAAO,4BAA4B,OAAO,OAAO,WAAW;AAAA,EAC9D;AACA,QAAM,QAAQ;AAAA,IACZ,GAAG,OAAO,MAAM,WAAW,OAAO,WAAW,IAAI,KAAK,GAAG,YAAY,OAAO,OAAO,MAAM,cAAc,OAAO,OAAO,QAAQ,WAAW,OAAO,OAAO,WAAW;AAAA,IACjK;AAAA,EACF;AACA,aAAW,KAAK,QAAQ;AACtB,UAAM,KAAK,IAAI,EAAE,QAAQ,KAAK,EAAE,IAAI,KAAK,EAAE,IAAI,WAAM,EAAE,OAAO,EAAE;AAAA,EAClE;AACA,SAAO,MAAM,KAAK,IAAI;AACxB;","names":[]}

package/dist/chunk-VQCNWRTL.js

@@ -0,0 +1,121 @@
+// src/core/features.ts
+import { existsSync, readFileSync, writeFileSync, mkdirSync, copyFileSync } from "fs";
+import { homedir } from "os";
+import { join, dirname, delimiter } from "path";
+import YAML from "yaml";
+var ENV = { skill_loop: "SEMANTIC_MEMORY_SKILL_LOOP", jev: "SEMANTIC_MEMORY_JEV" };
+var truthy = (v) => v === true || v === 1 || typeof v === "string" && /^(1|on|true|yes)$/i.test(v.trim());
+var falsy = (v) => v === false || v === 0 || typeof v === "string" && /^(0|off|false|no)$/i.test(v.trim());
+var repoConfigPath = (projectRoot) => join(projectRoot, ".claude", ".semantic-memory", "config");
+function readRepoConfig(projectRoot) {
+  try {
+    const data = YAML.parse(readFileSync(repoConfigPath(projectRoot), "utf8"));
+    return data && typeof data === "object" ? data : {};
+  } catch {
+    return {};
+  }
+}
+var jevLoopDir = (env = process.env) => env.JEV_LOOP_DIR || join(env.HOME || homedir(), ".claude", "jev-loop");
+var claudeSettingsPath = (env = process.env) => env.SEMANTIC_MEMORY_CLAUDE_SETTINGS || join(env.HOME || homedir(), ".claude", "settings.json");
+function onPath(bin, env = process.env) {
+  return (env.PATH || "").split(delimiter).some((d) => d && existsSync(join(d, bin)));
+}
+function jevAvailable(env = process.env) {
+  const dir = jevLoopDir(env);
+  if (!existsSync(join(dir, "router.py"))) return { available: false, reason: `jev-loop not found at ${dir} (router.py missing; set JEV_LOOP_DIR)` };
+  if (!env.TYPESAFE_API_KEY) {
+    let inSettings = false;
+    try {
+      inSettings = Boolean(JSON.parse(readFileSync(claudeSettingsPath(env), "utf8"))?.env?.TYPESAFE_API_KEY);
+    } catch {
+    }
+    if (!inSettings) return { available: false, reason: "TYPESAFE_API_KEY is not set (env or ~/.claude/settings.json env)" };
+  }
+  if (!onPath("python3", env)) return { available: false, reason: "python3 not found on PATH" };
+  return { available: true };
+}
+function featureState(feature, projectRoot, env = process.env) {
+  let on = false;
+  let why = "default";
+  const raw = env[ENV[feature]];
+  if (raw !== void 0 && raw !== "") {
+    on = truthy(raw);
+    why = "env";
+  }
+  if (feature === "skill_loop" && projectRoot) {
+    const repo = readRepoConfig(projectRoot).skill_loop;
+    if (truthy(repo) || falsy(repo)) {
+      on = truthy(repo);
+      why = "repo";
+    }
+  }
+  if (feature === "jev" && on) {
+    const a = jevAvailable(env);
+    return { feature, on, why, ...a };
+  }
+  return { feature, on, why, available: true };
+}
+var featureOn = (feature, projectRoot, env = process.env) => {
+  const s = featureState(feature, projectRoot, env);
+  return s.on && s.available;
+};
+function setSettingsEnv(key, value, env = process.env) {
+  const path = claudeSettingsPath(env);
+  let data = {};
+  let raw;
+  if (existsSync(path)) {
+    raw = readFileSync(path, "utf8");
+    try {
+      data = raw.trim() ? JSON.parse(raw) : {};
+    } catch (e) {
+      throw new Error(`${path} is not valid JSON (${e.message}); not changed`);
+    }
+    if (!data || typeof data !== "object" || Array.isArray(data)) throw new Error(`${path} is not a JSON object; not changed`);
+  }
+  if (data.env !== void 0 && (typeof data.env !== "object" || data.env === null || Array.isArray(data.env))) {
+    throw new Error(`${path}: "env" is not an object; not changed`);
+  }
+  const nextEnv = { ...data.env ?? {} };
+  if (value === void 0) delete nextEnv[key];
+  else nextEnv[key] = value;
+  data.env = nextEnv;
+  mkdirSync(dirname(path), { recursive: true });
+  let backup;
+  if (raw !== void 0) {
+    backup = `${path}.bak`;
+    copyFileSync(path, backup);
+  }
+  const indent = raw?.match(/^[{\[]\s*\n([ \t]+)/)?.[1] ?? "  ";
+  writeFileSync(path, JSON.stringify(data, null, indent) + "\n");
+  return { path, backup };
+}
+function setRepoConfig(projectRoot, key, value) {
+  const path = repoConfigPath(projectRoot);
+  const data = readRepoConfig(projectRoot);
+  if (value === void 0) delete data[key];
+  else data[key] = value;
+  mkdirSync(dirname(path), { recursive: true });
+  writeFileSync(path, Object.keys(data).length ? YAML.stringify(data) : "");
+  return path;
+}
+function describeFeature(s) {
+  const name = s.feature === "skill_loop" ? "skill loop" : "jev mode";
+  const src = s.why === "default" ? "default" : s.why === "env" ? `env ${ENV[s.feature]}` : "repo override in .claude/.semantic-memory/config";
+  if (s.on && !s.available) return `${name}: on but unavailable (${s.reason}) [${src}]`;
+  return `${name}: ${s.on ? "on" : "off"} [${src}]`;
+}
+
+export {
+  ENV,
+  repoConfigPath,
+  readRepoConfig,
+  jevLoopDir,
+  claudeSettingsPath,
+  jevAvailable,
+  featureState,
+  featureOn,
+  setSettingsEnv,
+  setRepoConfig,
+  describeFeature
+};
+//# sourceMappingURL=chunk-VQCNWRTL.js.map