@theokit/sdk 5.0.0-next.2 → 5.0.0-next.3

package/CHANGELOG.md

@@ -1,5 +1,38 @@
 # Changelog
 
+## 5.0.0-next.3
+
+### Minor Changes
+
+- ae2a720: `THEO.md` now works at the project root, the way `AGENTS.md`, `GEMINI.md` and `CLAUDE.md` already
+  do — found from the root, and reachable by walking up from any subdirectory.
+  
+  Before this, `THEO.md` was the only context file this SDK knows about that had to live inside
+  `.theokit/` and could not be found from a subdirectory. The miss was silent: a well-formed
+  `THEO.md` at the project root was simply never read, with no warning that it had been ignored.
+  
+  ```
+  project/
+  ├── THEO.md              ← now read, walking up from any subdirectory
+  └── .theokit/
+      └── THEO.md           ← still works exactly as before
+  ```
+  
+  A new `DEFAULT_DISCOVERY_SPECS` entry (`THEO.md.root`, priority 55) is added alongside the
+  existing one — nothing about `.theokit/THEO.md` changes, so a project already using it keeps
+  working unchanged. When both exist, `.theokit/THEO.md` is the later, winning source on conflict —
+  the precedence usetheokit/theokit-sdk#531 asked for.
+  
+  The new entry sets `followImports: true`, unlike `.theokit/THEO.md` (`false`) and unlike
+  `AGENTS.md`. This is deliberate, not an inconsistency: a root-level `THEO.md` is edited by the same
+  people, in the same place, as `CLAUDE.md`/`GEMINI.md` — the two other root-level files, both
+  `followImports: true` — so it belongs in their category rather than `AGENTS.md`'s vendor-neutral,
+  import-free one. Flagged as an open decision in the issue; resolved here because adding a new spec
+  rather than reusing the existing one meant it could be decided on its own merits, with zero
+  behaviour change for existing `.theokit/THEO.md` files either way.
+  
+  Closes usetheokit/theokit-sdk#531.
+
 ## 5.0.0-next.2
 
 ### Minor Changes

package/dist/{agent-Y24I5JBM.js → agent-2KJ3IGRA.js}

@@ -1,14 +1,14 @@
-export { Agent } from './chunk-KDR53EO7.js';
+export { Agent } from './chunk-GO5QW4YL.js';
 import './chunk-K2VMFZQ5.js';
 import './chunk-AWINL3ZC.js';
 import './chunk-K2BQQ445.js';
-import './chunk-2ZLVT7H3.js';
+import './chunk-CYKKYNOT.js';
 import './chunk-XJZEBGXD.js';
 import './chunk-2SFBB54R.js';
 import './chunk-55GB6JYQ.js';
 import './chunk-H73MEMQB.js';
 import './chunk-OR6XIWLB.js';
-import './chunk-UNK4HNJH.js';
+import './chunk-J2SH3PNH.js';
 import './chunk-AAEZSPTC.js';
 import './chunk-K3NH62DG.js';
 import './chunk-UBR5PWD7.js';
@@ -17,7 +17,7 @@ import './chunk-XB4GI5RZ.js';
 import './chunk-24MGQDK3.js';
 import './chunk-2WXHA33T.js';
 import './chunk-HKCKOAIO.js';
-import './chunk-ILGZ2ZZV.js';
+import './chunk-N6OOOYFZ.js';
 import './chunk-KVNWIAO4.js';
 import './chunk-SVQIW5RJ.js';
 import './chunk-FD2UT76F.js';
@@ -27,7 +27,7 @@ import './chunk-NAF4L3T6.js';
 import './chunk-6WAKKTBO.js';
 import './chunk-6X6ID4MO.js';
 import './chunk-XDANGA2C.js';
-import './chunk-WFC26L6Y.js';
+import './chunk-2XRAWOZZ.js';
 import './chunk-SAGRF4IB.js';
 import './chunk-EH6XD3FY.js';
 import './chunk-UKMBRMGT.js';
@@ -54,5 +54,5 @@ import './chunk-V22DZIXO.js';
 import './chunk-NJWYQWDL.js';
 import './chunk-ALUN2B4W.js';
 import './chunk-CZJ6Q7CW.js';
-//# sourceMappingURL=agent-Y24I5JBM.js.map
-//# sourceMappingURL=agent-Y24I5JBM.js.map
+//# sourceMappingURL=agent-2KJ3IGRA.js.map
+//# sourceMappingURL=agent-2KJ3IGRA.js.map

package/dist/{agent-Y24I5JBM.js.map → agent-2KJ3IGRA.js.map}

@@ -1 +1 @@
-{"version":3,"sources":[],"names":[],"mappings":"","file":"agent-Y24I5JBM.js"}
+{"version":3,"sources":[],"names":[],"mappings":"","file":"agent-2KJ3IGRA.js"}

package/dist/{agent-GPV2JWZG.cjs → agent-V6YLX3W6.cjs}

@@ -1,16 +1,16 @@
 'use strict';
 
-var chunkQUAEOKDW_cjs = require('./chunk-QUAEOKDW.cjs');
+var chunkK6VDRJ6I_cjs = require('./chunk-K6VDRJ6I.cjs');
 require('./chunk-KVSAY6NZ.cjs');
 require('./chunk-Y2KYR2ED.cjs');
 require('./chunk-BUUUWQMB.cjs');
-require('./chunk-2NE7DTOK.cjs');
+require('./chunk-KBXADFBJ.cjs');
 require('./chunk-H6YM3PV6.cjs');
 require('./chunk-BV2MWEMV.cjs');
 require('./chunk-D6POWE7E.cjs');
 require('./chunk-GHX4P3V2.cjs');
 require('./chunk-TMKTSYDS.cjs');
-require('./chunk-LHSWHYF3.cjs');
+require('./chunk-RXZSVNDG.cjs');
 require('./chunk-7FDKWDA2.cjs');
 require('./chunk-2HPNT6HH.cjs');
 require('./chunk-FUSDYC2B.cjs');
@@ -19,7 +19,7 @@ require('./chunk-24SYBZPL.cjs');
 require('./chunk-QOGNZMHD.cjs');
 require('./chunk-YIFFF23U.cjs');
 require('./chunk-2ZPEDVLM.cjs');
-require('./chunk-RHZ6HP23.cjs');
+require('./chunk-IU5N5224.cjs');
 require('./chunk-KRD3GQAA.cjs');
 require('./chunk-RQMCOFAI.cjs');
 require('./chunk-MUUQ2WFJ.cjs');
@@ -29,7 +29,7 @@ require('./chunk-FRITRLZQ.cjs');
 require('./chunk-QME6FDFG.cjs');
 require('./chunk-NINIJCHU.cjs');
 require('./chunk-UGRS7ZA7.cjs');
-require('./chunk-LKFET5A3.cjs');
+require('./chunk-LOHMT36V.cjs');
 require('./chunk-IJ7M6GOG.cjs');
 require('./chunk-7A6535RA.cjs');
 require('./chunk-SA6K24NB.cjs');
@@ -61,7 +61,7 @@ require('./chunk-6LHQPOMI.cjs');
 
 Object.defineProperty(exports, "Agent", {
   enumerable: true,
-  get: function () { return chunkQUAEOKDW_cjs.Agent; }
+  get: function () { return chunkK6VDRJ6I_cjs.Agent; }
 });
-//# sourceMappingURL=agent-GPV2JWZG.cjs.map
-//# sourceMappingURL=agent-GPV2JWZG.cjs.map
+//# sourceMappingURL=agent-V6YLX3W6.cjs.map
+//# sourceMappingURL=agent-V6YLX3W6.cjs.map

package/dist/{agent-GPV2JWZG.cjs.map → agent-V6YLX3W6.cjs.map}

@@ -1 +1 @@
-{"version":3,"sources":[],"names":[],"mappings":"","file":"agent-GPV2JWZG.cjs"}
+{"version":3,"sources":[],"names":[],"mappings":"","file":"agent-V6YLX3W6.cjs"}

package/dist/{chunk-WFC26L6Y.js → chunk-2XRAWOZZ.js}

@@ -73,6 +73,29 @@ var DEFAULT_DISCOVERY_SPECS = [
     followImports: false,
     priority: 50
   },
+  {
+    // usetheokit/theokit-sdk#531 — THEO.md was the only context file that could not live at the
+    // project root: every sibling here is `git-root-walk`, and this one was `cwd-only` pointed
+    // at `.theokit/THEO.md` specifically, with no warning that a root THEO.md was inert.
+    //
+    // ADDED rather than moving the existing entry below: a project already using
+    // `.theokit/THEO.md` keeps working unchanged. 55 sits between `theokit-context` (50) and the
+    // existing `THEO.md` (60), leaving room on both sides — the numbering discipline
+    // `claude-rules` (47) already established for this array.
+    //
+    // `followImports: true`, unlike the existing entry (`false`) and unlike `AGENTS.md`. This is
+    // a DELIBERATE divergence between the two THEO.md specs, not an inconsistency: a root-level
+    // file is edited by the same people, in the same place, as CLAUDE.md/GEMINI.md — the two
+    // other root-level, human-facing files that both carry `followImports: true` — so it belongs
+    // in their category rather than AGENTS.md's vendor-neutral, import-free one. Because this is a
+    // NEW spec, choosing `true` here changes nothing for `.theokit/THEO.md`, which keeps `false`.
+    id: "THEO.md.root",
+    pattern: "THEO.md",
+    scope: "git-root-walk",
+    parser: "plain-markdown",
+    followImports: true,
+    priority: 55
+  },
   {
     id: "THEO.md",
     pattern: ".theokit/THEO.md",
@@ -145,5 +168,5 @@ async function walkUpForGlob(cwd, pattern) {
 }
 
 export { DEFAULT_DISCOVERY_SPECS, findGitRoot, isSafePattern, walkUpForFile, walkUpForGlob };
-//# sourceMappingURL=chunk-WFC26L6Y.js.map
-//# sourceMappingURL=chunk-WFC26L6Y.js.map
+//# sourceMappingURL=chunk-2XRAWOZZ.js.map
+//# sourceMappingURL=chunk-2XRAWOZZ.js.map

package/dist/chunk-2XRAWOZZ.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/internal/runtime/context/context-discovery.ts"],"names":[],"mappings":";;;;;AAsFO,IAAM,uBAAA,GAAwD;AAAA,EACnE;AAAA,IACE,EAAA,EAAI,WAAA;AAAA,IACJ,OAAA,EAAS,WAAA;AAAA,IACT,KAAA,EAAO,eAAA;AAAA,IACP,MAAA,EAAQ,gBAAA;AAAA,IACR,aAAA,EAAe,KAAA;AAAA,IACf,QAAA,EAAU;AAAA,GACZ;AAAA,EACA;AAAA,IACE,EAAA,EAAI,WAAA;AAAA,IACJ,OAAA,EAAS,WAAA;AAAA,IACT,KAAA,EAAO,eAAA;AAAA,IACP,MAAA,EAAQ,gBAAA;AAAA,IACR,aAAA,EAAe,IAAA;AAAA,IACf,QAAA,EAAU;AAAA,GACZ;AAAA,EACA;AAAA,IACE,EAAA,EAAI,WAAA;AAAA,IACJ,OAAA,EAAS,WAAA;AAAA,IACT,KAAA,EAAO,eAAA;AAAA,IACP,MAAA,EAAQ,gBAAA;AAAA,IACR,aAAA,EAAe,IAAA;AAAA,IACf,QAAA,EAAU;AAAA,GACZ;AAAA,EACA;AAAA,IACE,EAAA,EAAI,cAAA;AAAA,IACJ,OAAA,EAAS,qBAAA;AAAA,IACT,KAAA,EAAO,SAAA;AAAA,IACP,MAAA,EAAQ,KAAA;AAAA,IACR,aAAA,EAAe,KAAA;AAAA,IACf,QAAA,EAAU;AAAA,GACZ;AAAA,EACA;AAAA,IACE,EAAA,EAAI,eAAA;AAAA,IACJ,OAAA,EAAS,qBAAA;AAAA,IACT,KAAA,EAAO,SAAA;AAAA,IACP,MAAA,EAAQ,mBAAA;AAAA,IACR,aAAA,EAAe,KAAA;AAAA,IACf,QAAA,EAAU;AAAA,GACZ;AAAA,EACA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAcE,EAAA,EAAI,cAAA;AAAA,IACJ,OAAA,EAAS,oBAAA;AAAA,IACT,KAAA,EAAO,SAAA;AAAA,IACP,MAAA,EAAQ,mBAAA;AAAA,IACR,aAAA,EAAe,KAAA;AAAA,IACf,QAAA,EAAU;AAAA,GACZ;AAAA,EACA;AAAA,IACE,EAAA,EAAI,iBAAA;AAAA,IACJ,OAAA,EAAS,uBAAA;AAAA,IACT,KAAA,EAAO,SAAA;AAAA,IACP,MAAA,EAAQ,iBAAA;AAAA,IACR,aAAA,EAAe,KAAA;AAAA,IACf,QAAA,EAAU;AAAA,GACZ;AAAA,EACA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAgBE,EAAA,EAAI,cAAA;AAAA,IACJ,OAAA,EAAS,SAAA;AAAA,IACT,KAAA,EAAO,eAAA;AAAA,IACP,MAAA,EAAQ,gBAAA;AAAA,IACR,aAAA,EAAe,IAAA;AAAA,IACf,QAAA,EAAU;AAAA,GACZ;AAAA,EACA;AAAA,IACE,EAAA,EAAI,SAAA;AAAA,IACJ,OAAA,EAAS,kBAAA;AAAA,IACT,KAAA,EAAO,UAAA;AAAA,IACP,MAAA,EAAQ,gBAAA;AAAA,IACR,aAAA,EAAe,KAAA;AAAA,IACf,QAAA,EAAU;AAAA;AAEd;AAEA,IAAM,aAAA,GAAgB,sBAAA;AACtB,IAAM,YAAA,GAAe,kBAAA;AAQd,SAAS,cAAc,OAAA,EAA0B;AACtD,EAAA,IAAI,OAAO,OAAA,KAAY,QAAA,IAAY,OAAA,CAAQ,MAAA,KAAW,GAAG,OAAO,KAAA;AAChE,EAAA,IAAI,YAAA,CAAa,IAAA,CAAK,OAAO,CAAA,EAAG,OAAO,KAAA;AACvC,EAAA,IAAI,UAAA,CAAW,OAAO,CAAA,EAAG,OAAO,KAAA;AAChC,EAAA,OAAO,aAAA,CAAc,KAAK,OAAO,CAAA;AACnC;AAUO,SAAS,YAAY,GAAA,EAAiC;AAC3D,EAAA,IAAI,OAAO,GAAA,KAAQ,QAAA,IAAY,GAAA,CAAI,MAAA,KAAW,GAAG,OAAO,MAAA;AACxD,EAAA,IAAI,OAAA,GAAU,QAAQ,GAAG,CAAA;AAEzB,EAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,EAAA,EAAI,KAAK,CAAA,EAAG;AAC9B,IAAA,IAAI,WAAW,IAAA,CAAK,OAAA,EAAS,MAAM,CAAC,GAAG,OAAO,OAAA;AAC9C,IAAA,MAAM,MAAA,GAAS,QAAQ,OAAO,CAAA;AAC9B,IAAA,IAAI,MAAA,KAAW,SAAS,OAAO,MAAA;AAC/B,IAAA,OAAA,GAAU,MAAA;AAAA,EACZ;AACA,EAAA,OAAO,MAAA;AACT;AAcO,SAAS,aAAA,CACd,GAAA,EACA,QAAA,EACA,OAAA,EACU;AACV,EAAA,IAAI,CAAC,aAAA,CAAc,QAAQ,CAAA,EAAG;AAC5B,IAAA,OAAO,EAAC;AAAA,EACV;AACA,EAAA,MAAM,KAAA,GAAQ,QAAQ,GAAG,CAAA;AACzB,EAAA,MAAM,IAAA,GAAO,OAAA,KAAY,MAAA,GAAY,OAAA,CAAQ,OAAO,CAAA,GAAI,MAAA;AACxD,EAAA,MAAM,QAAkB,EAAC;AACzB,EAAA,MAAM,QAAA,uBAAe,GAAA,EAAY;AACjC,EAAA,IAAI,OAAA,GAAU,KAAA;AAEd,EAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,EAAA,EAAI,KAAK,CAAA,EAAG;AAC9B,IAAA,MAAM,SAAA,GAAY,IAAA,CAAK,OAAA,EAAS,QAAQ,CAAA;AACxC,IAAA,IAAI,UAAA,CAAW,SAAS,CAAA,EAAG;AACzB,MAAA,IAAI,IAAA;AACJ,MAAA,IAAI;AACF,QAAA,IAAA,GAAO,aAAa,SAAS,CAAA;AAAA,MAC/B,CAAA,CAAA,MAAQ;AAEN,QAAA,IAAA,GAAO,SAAA;AAAA,MACT;AACA,MAAA,IAAI,CAAC,QAAA,CAAS,GAAA,CAAI,IAAI,CAAA,EAAG;AACvB,QAAA,QAAA,CAAS,IAAI,IAAI,CAAA;AACjB,QAAA,KAAA,CAAM,KAAK,IAAI,CAAA;AAAA,MACjB;AAAA,IACF;AACA,IAAA,IAAI,IAAA,KAAS,MAAA,IAAa,OAAA,KAAY,IAAA,EAAM;AAC5C,IAAA,MAAM,MAAA,GAAS,QAAQ,OAAO,CAAA;AAC9B,IAAA,IAAI,WAAW,OAAA,EAAS;AACxB,IAAA,OAAA,GAAU,MAAA;AAAA,EACZ;AACA,EAAA,OAAO,KAAA;AACT;AAoCA,eAAsB,aAAA,CAAc,KAAa,OAAA,EAAoC;AACnF,EAAA,IAAI,CAAC,aAAA,CAAc,OAAO,CAAA,SAAU,EAAC;AACrC,EAAA,MAAM,QAAkB,EAAC;AACzB,EAAA,IAAI;AACF,IAAA,WAAA,MAAiB,SAAS,IAAA,CAAK,OAAA,EAAS,EAAE,GAAA,EAAK,CAAA,EAAG;AAChD,MAAA,KAAA,CAAM,IAAA,CAAK,OAAA,CAAQ,GAAA,EAAK,KAAK,CAAC,CAAA;AAAA,IAChC;AAAA,EACF,CAAA,CAAA,MAAQ;AAGN,IAAA,OAAO,EAAC;AAAA,EACV;AAQA,EAAA,OAAO,KAAA,CAAM,IAAA,CAAK,CAAC,CAAA,EAAG,CAAA,KAAO,CAAA,GAAI,CAAA,GAAI,EAAA,GAAK,CAAA,GAAI,CAAA,GAAI,CAAA,GAAI,CAAE,CAAA;AAC1D","file":"chunk-2XRAWOZZ.js","sourcesContent":["/**\n * Context file discovery (T1.1, ADRs D150 / D151).\n *\n * Discovers context files via three scopes:\n *  - `cwd-only` — single dir, single path lookup\n *  - `git-root-walk` — walk cwd → git-root, collect every directory's match\n *    (nearest-first ordering)\n *  - `globbed` — glob pattern relative to cwd (e.g. `.cursor/rules/*.mdc`)\n *\n * Pure `existsSync` checks — **no `.gitignore` parsing** (EC-A, KISS) and\n * **no invented `.theokitignore`** (EC-B). Paths normalized via\n * `realpath` to dedup symlink chains pointing to the same physical file\n * (EC-F). Git worktrees work transparently because `.git` exists as a\n * file in that case (EC-N).\n *\n * @internal\n */\n\nimport { existsSync, realpathSync } from \"node:fs\";\nimport { glob } from \"node:fs/promises\";\nimport { dirname, isAbsolute, join, resolve } from \"node:path\";\n\n/** Single filename (\"AGENTS.md\") or relative glob (\".cursor/rules/*.mdc\"). */\nexport type DiscoveryScope = \"cwd-only\" | \"git-root-walk\" | \"globbed\";\n\n/** Parser to apply once file is read. */\nexport type DiscoveryParser = \"plain-markdown\" | \"mdc\" | \"frontmatter-zod\" | \"rules-frontmatter\";\n\n/**\n * One kind of context file the runner knows how to find and read. The shipped registry is\n * `DEFAULT_DISCOVERY_SPECS`; a caller supplies its own array to change the set.\n *\n * `scope` decides how `pattern` is used and how many files a single spec can yield:\n * `cwd-only` looks for one path and stops, `git-root-walk` collects a match in every directory\n * from `cwd` up to the git root (nearest first), and `globbed` expands `pattern` as a glob\n * relative to `cwd`. So `pattern` is a filename for the first two and a glob for the third —\n * putting a glob on a walk scope silently finds nothing.\n *\n * `priority` orders the merged prompt, ascending, and is a plain number rather than an index, so\n * a new spec can be slotted between two existing ones. Lower means earlier and therefore more\n * general; later content wins on conflict.\n *\n * `parser` must match the file format — `plain-markdown` reads the whole file, `mdc` and\n * `rules-frontmatter` parse frontmatter and can DECLINE the file when its activation conditions\n * do not hold, and `frontmatter-zod` is the legacy path the runner currently skips entirely.\n *\n * `followImports` is honored only by `plain-markdown`, and turns `@path` directives in the body\n * into inlined content bounded by the import root. Setting it on a frontmatter parser does\n * nothing.\n *\n * `id` names the source in `<source name=\"\">` and in telemetry. When one spec matches files in\n * several directories, the runner suffixes it with the path relative to the git root to keep them\n * apart.\n *\n * @public — re-exported from `@theokit/sdk/context`, and therefore under semver.\n */\nexport interface DiscoverySpec {\n  /** Stable identifier — used as `<source name=\"\">` and telemetry key. */\n  readonly id: string;\n  /** Priority for merge (lower = earlier in prompt). */\n  readonly priority: number;\n  /** Filename (cwd-only/git-root-walk) or glob (globbed). */\n  readonly pattern: string;\n  readonly scope: DiscoveryScope;\n  readonly parser: DiscoveryParser;\n  /** Whether to follow `@path` import directives (CLAUDE.md / GEMINI.md). */\n  readonly followImports: boolean;\n}\n\n/**\n * The context files theokit looks for out of the box, in the order they are concatenated.\n *\n * Two things follow from the ordering. `AGENTS.md` comes first at priority 10 and `THEO.md` last,\n * so theokit-specific instruction wins over the vendor-neutral file on conflict. And the array is\n * consumed in the order written — the runner does not re-sort it — so a caller passing its own\n * array is responsible for keeping `priority` and array position consistent.\n *\n * `CLAUDE.md` and `GEMINI.md` are the only two entries with `followImports: true`, which means\n * they are the only files whose `@path` directives pull other files into the prompt. Those\n * imports cannot escape the import root.\n *\n * Frozen only by type: `ReadonlyArray` is a compile-time constraint, and the array and its\n * elements are not deep-frozen at runtime. Build a new array rather than mutating this one.\n *\n * @public — re-exported from `@theokit/sdk/context`, and therefore under semver.\n */\nexport const DEFAULT_DISCOVERY_SPECS: ReadonlyArray<DiscoverySpec> = [\n  {\n    id: \"AGENTS.md\",\n    pattern: \"AGENTS.md\",\n    scope: \"git-root-walk\",\n    parser: \"plain-markdown\",\n    followImports: false,\n    priority: 10,\n  },\n  {\n    id: \"GEMINI.md\",\n    pattern: \"GEMINI.md\",\n    scope: \"git-root-walk\",\n    parser: \"plain-markdown\",\n    followImports: true,\n    priority: 20,\n  },\n  {\n    id: \"CLAUDE.md\",\n    pattern: \"CLAUDE.md\",\n    scope: \"git-root-walk\",\n    parser: \"plain-markdown\",\n    followImports: true,\n    priority: 30,\n  },\n  {\n    id: \"cursor-rules\",\n    pattern: \".cursor/rules/*.mdc\",\n    scope: \"globbed\",\n    parser: \"mdc\",\n    followImports: false,\n    priority: 40,\n  },\n  {\n    id: \"theokit-rules\",\n    pattern: \".theokit/rules/*.md\",\n    scope: \"globbed\",\n    parser: \"rules-frontmatter\",\n    followImports: false,\n    priority: 45,\n  },\n  {\n    // Rules written for the Claude Code CLI. Measured 2026-08-26 over this repository's 32 rule\n    // files: none carries frontmatter, and `rules-frontmatter` already reads a file without it as\n    // `alwaysApply: true` — the format needed nothing, only a spec pointing at the directory.\n    //\n    // 47, not 46. Specs sort ascending and a context budget drops the tail first, so it must land\n    // AFTER `.theokit/rules` (45) — the explicit namespace should survive a squeeze the borrowed one\n    // does not. It must also leave a slot on BOTH sides: B-127 makes these numbers a public contract\n    // precisely so a consumer can place its own source between two defaults, and 46 would have left\n    // no room between 45 and itself. 47 keeps 46 free below and 48–49 free above.\n    //\n    // The reckoning B-127's docblock asks for: no published priority MOVES, so a consumer that chose\n    // 46, 48 or 49 is unaffected. A consumer that had chosen 47 now collides — that is the cost of\n    // an eighth default, paid once and recorded here rather than discovered later.\n    id: \"claude-rules\",\n    pattern: \".claude/rules/*.md\",\n    scope: \"globbed\",\n    parser: \"rules-frontmatter\",\n    followImports: false,\n    priority: 47,\n  },\n  {\n    id: \"theokit-context\",\n    pattern: \".theokit/context/*.md\",\n    scope: \"globbed\",\n    parser: \"frontmatter-zod\",\n    followImports: false,\n    priority: 50,\n  },\n  {\n    // usetheokit/theokit-sdk#531 — THEO.md was the only context file that could not live at the\n    // project root: every sibling here is `git-root-walk`, and this one was `cwd-only` pointed\n    // at `.theokit/THEO.md` specifically, with no warning that a root THEO.md was inert.\n    //\n    // ADDED rather than moving the existing entry below: a project already using\n    // `.theokit/THEO.md` keeps working unchanged. 55 sits between `theokit-context` (50) and the\n    // existing `THEO.md` (60), leaving room on both sides — the numbering discipline\n    // `claude-rules` (47) already established for this array.\n    //\n    // `followImports: true`, unlike the existing entry (`false`) and unlike `AGENTS.md`. This is\n    // a DELIBERATE divergence between the two THEO.md specs, not an inconsistency: a root-level\n    // file is edited by the same people, in the same place, as CLAUDE.md/GEMINI.md — the two\n    // other root-level, human-facing files that both carry `followImports: true` — so it belongs\n    // in their category rather than AGENTS.md's vendor-neutral, import-free one. Because this is a\n    // NEW spec, choosing `true` here changes nothing for `.theokit/THEO.md`, which keeps `false`.\n    id: \"THEO.md.root\",\n    pattern: \"THEO.md\",\n    scope: \"git-root-walk\",\n    parser: \"plain-markdown\",\n    followImports: true,\n    priority: 55,\n  },\n  {\n    id: \"THEO.md\",\n    pattern: \".theokit/THEO.md\",\n    scope: \"cwd-only\",\n    parser: \"plain-markdown\",\n    followImports: false,\n    priority: 60,\n  },\n];\n\nconst SAFE_FILENAME = /^[a-zA-Z0-9_.\\-/*]+$/;\nconst TRAVERSAL_RE = /(^|\\/)\\.\\.(\\/|$)/;\n\n/**\n * Reject patterns that contain path traversal (`..`) or non-allowed\n * characters (D81 parity, EC-4).\n *\n * @internal\n */\nexport function isSafePattern(pattern: string): boolean {\n  if (typeof pattern !== \"string\" || pattern.length === 0) return false;\n  if (TRAVERSAL_RE.test(pattern)) return false;\n  if (isAbsolute(pattern)) return false;\n  return SAFE_FILENAME.test(pattern);\n}\n\n/**\n * Walk upward from `cwd` looking for the closest directory containing\n * a `.git` entry (file OR directory — worktrees use a `.git` FILE,\n * EC-N). Returns the absolute path of that directory, or `undefined`\n * when no git root exists at or above `cwd`.\n *\n * @internal\n */\nexport function findGitRoot(cwd: string): string | undefined {\n  if (typeof cwd !== \"string\" || cwd.length === 0) return undefined;\n  let current = resolve(cwd);\n  // Guard against infinite loops on weird filesystems.\n  for (let i = 0; i < 64; i += 1) {\n    if (existsSync(join(current, \".git\"))) return current;\n    const parent = dirname(current);\n    if (parent === current) return undefined;\n    current = parent;\n  }\n  return undefined;\n}\n\n/**\n * Walk `cwd` upward to `stopDir` (inclusive) collecting every existing\n * occurrence of `filename`. Returns absolute, realpath-deduped paths in\n * nearest-first order (innermost dir first).\n *\n * No `.gitignore` parsing (EC-A). Realpath collapses symlink chains\n * pointing to the same physical file (EC-F). Filesystem races (file\n * deleted mid-walk) are skipped silently (EC-5).\n *\n * @internal\n */\n// biome-ignore lint/complexity/noExcessiveCognitiveComplexity: walk-up loop combines validation + realpath dedup + FS-race handling + stopDir guard in a single bounded loop; splitting fragments the dedup invariant.\nexport function walkUpForFile(\n  cwd: string,\n  filename: string,\n  stopDir: string | undefined,\n): string[] {\n  if (!isSafePattern(filename)) {\n    return [];\n  }\n  const start = resolve(cwd);\n  const stop = stopDir !== undefined ? resolve(stopDir) : undefined;\n  const found: string[] = [];\n  const seenReal = new Set<string>();\n  let current = start;\n  // 64-level depth cap.\n  for (let i = 0; i < 64; i += 1) {\n    const candidate = join(current, filename);\n    if (existsSync(candidate)) {\n      let real: string;\n      try {\n        real = realpathSync(candidate);\n      } catch {\n        // FS race (deleted mid-walk) — skip.\n        real = candidate;\n      }\n      if (!seenReal.has(real)) {\n        seenReal.add(real);\n        found.push(real);\n      }\n    }\n    if (stop !== undefined && current === stop) break;\n    const parent = dirname(current);\n    if (parent === current) break;\n    current = parent;\n  }\n  return found;\n}\n\n/**\n * Glob-style discovery under `cwd` (e.g. `.cursor/rules/*.mdc`, `.theokit/rules/**\\/*.md`).\n * Returns absolute, lex-sorted paths.\n *\n * `*` matches within one path segment and `**` spans any depth, including zero — so\n * `.theokit/rules/**\\/*.md` finds `rules/top.md` as well as `rules/deep/nested/inner.md`, while\n * `.theokit/rules/*.md` keeps its flat meaning and finds only the first. That distinction is the\n * compatibility contract: every existing spec uses a single `*`, and widening it would silently\n * start absorbing nested files nobody chose to expose.\n *\n * ## Why this used to be flat, and what changed (B-119)\n *\n * The previous implementation split the pattern at its LAST `/`, treated the prefix as a literal\n * directory and did one `readdir` — documented as \"nested directories deferred to v2\" (EC-R). The\n * deferral was deliberate; what made it a defect was measured from a consumer. TheoCode's own rule\n * loader descends recursively, so migrating it onto the `theokit-rules` spec would have silently\n * dropped every nested rule — on the path that decides whether a repository's hooks execute. And a\n * pattern written to say so, `.theokit/rules/**\\/*.md`, resolved its directory part to a literal\n * `**` and matched NOTHING, not even the top-level file it matched before the globstar was added.\n *\n * ## Why the stdlib rather than a walker\n *\n * `fs.promises.glob` (Node ≥ 22, and this package requires ≥ 22.12) implements exactly these\n * semantics, verified against a fixture before adoption: `**\\/*.md` returns all three depths,\n * `*.md` returns one, and it emits no experimental warning. Writing a recursive walker here would\n * have been a third implementation of matching inside one package — the same duplication that let\n * the enumerator and the compiler in `context-glob.ts` disagree in the first place. `globToRegex`\n * stays where it belongs: deciding whether a rule APPLIES to a set of paths, which is a different\n * question from which files exist.\n *\n * `isSafePattern` still runs first and is unchanged, so `..` is refused before any I/O.\n *\n * @internal\n */\nexport async function walkUpForGlob(cwd: string, pattern: string): Promise<string[]> {\n  if (!isSafePattern(pattern)) return [];\n  const found: string[] = [];\n  try {\n    for await (const entry of glob(pattern, { cwd })) {\n      found.push(resolve(cwd, entry));\n    }\n  } catch {\n    // A pattern whose directory does not exist is the ordinary case — most projects have no\n    // `.cursor/rules/`. Same outcome as matching nothing.\n    return [];\n  }\n  // Sorted, because discovery order becomes prompt order and must not vary with the filesystem.\n  //\n  // The comparator is explicit and deliberately NOT `localeCompare`, which is the usual suggestion\n  // for a bare `.sort()`. `localeCompare` orders by the machine's locale, so the same tree would\n  // assemble a different prompt on a differently-configured machine — trading one source of\n  // non-determinism for a subtler one. Code-unit ordering is what a bare `.sort()` already does for\n  // strings; writing it out states the intent and keeps the result machine-independent.\n  return found.sort((a, b) => (a < b ? -1 : a > b ? 1 : 0));\n}\n"]}

package/dist/{chunk-2ZLVT7H3.js → chunk-CYKKYNOT.js}

@@ -1,5 +1,5 @@
 import { LruEmbeddingCache } from './chunk-H73MEMQB.js';
-import { resolveMemoryRoot, defaultIndexPath, projectMemoryDir, openMemoryDb, truncateSnippet, resolveWeights, blendScores, LanceIndex, collectMarkdownFiles, sha256 } from './chunk-UNK4HNJH.js';
+import { resolveMemoryRoot, defaultIndexPath, projectMemoryDir, openMemoryDb, truncateSnippet, resolveWeights, blendScores, LanceIndex, collectMarkdownFiles, sha256 } from './chunk-J2SH3PNH.js';
 import { sanitizeFts5Query, containsCjk } from './chunk-WE22OXQA.js';
 import { ConfigurationError } from './chunk-ALUN2B4W.js';
 import { diag } from './chunk-CZJ6Q7CW.js';
@@ -589,5 +589,5 @@ var IndexManager = class _IndexManager {
 };
 
 export { IndexManager };
-//# sourceMappingURL=chunk-2ZLVT7H3.js.map
-//# sourceMappingURL=chunk-2ZLVT7H3.js.map
+//# sourceMappingURL=chunk-CYKKYNOT.js.map
+//# sourceMappingURL=chunk-CYKKYNOT.js.map

package/dist/{chunk-2ZLVT7H3.js.map → chunk-CYKKYNOT.js.map}

@@ -1 +1 @@
-{"version":3,"sources":["../src/internal/memory/storage/chunk-markdown.ts","../src/internal/memory/corpus-sync.ts","../src/internal/memory/escape-like-pattern.ts","../src/internal/memory/memory-index.ts","../src/internal/memory/lance-memory-adapter.ts","../src/internal/memory/index-manager-dispatch.ts","../src/internal/memory/index-repository.ts","../src/internal/memory/sqlite-vec-loader.ts","../src/internal/memory/vec-index.ts","../src/internal/memory/index-manager.ts"],"names":["createHash"],"mappings":";;;;;;;;AA6BA,IAAM,UAAA,GAAa,uBAAA;AASZ,SAAS,aAAA,CAAc,IAAA,EAAc,OAAA,GAAgC,EAAC,EAAkB;AAC7F,EAAA,MAAM,QAAA,GAAW,QAAQ,QAAA,IAAY,GAAA;AACrC,EAAA,IAAI,IAAA,CAAK,MAAA,KAAW,CAAA,EAAG,OAAO,EAAC;AAC/B,EAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,KAAA,CAAM,IAAI,CAAA;AAC7B,EAAA,MAAM,GAAA,GAAwB,EAAE,MAAA,EAAQ,EAAC,EAAG,KAAA,EAAO,EAAC,EAAG,KAAA,EAAO,CAAA,EAAG,OAAA,EAAS,MAAA,EAAU;AACpF,EAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,KAAA,CAAM,QAAQ,CAAA,EAAA,EAAK;AACrC,IAAA,MAAM,IAAA,GAAO,KAAA,CAAM,CAAC,CAAA,IAAK,EAAA;AACzB,IAAA,MAAM,aAAa,CAAA,GAAI,CAAA;AACvB,IAAA,WAAA,CAAY,GAAA,EAAK,IAAA,EAAM,UAAA,EAAY,QAAQ,CAAA;AAAA,EAC7C;AACA,EAAA,gBAAA,CAAiB,GAAA,EAAK,KAAA,CAAM,MAAA,EAAQ,QAAQ,CAAA;AAC5C,EAAA,OAAO,GAAA,CAAI,MAAA;AACb;AAEA,SAAS,WAAA,CACP,GAAA,EACA,IAAA,EACA,UAAA,EACA,QAAA,EACM;AACN,EAAA,MAAM,YAAA,GAAe,UAAA,CAAW,IAAA,CAAK,IAAI,CAAA;AACzC,EAAA,MAAM,OAAA,GAAU,IAAA,CAAK,IAAA,EAAK,CAAE,MAAA,KAAW,CAAA;AACvC,EAAA,IAAI,YAAA,KAAiB,IAAA,IAAQ,GAAA,CAAI,KAAA,CAAM,SAAS,CAAA,EAAG;AACjD,IAAA,gBAAA,CAAiB,GAAA,EAAK,UAAA,GAAa,CAAA,EAAG,QAAQ,CAAA;AAAA,EAChD;AACA,EAAA,IAAI,YAAA,KAAiB,IAAA,EAAM,GAAA,CAAI,OAAA,GAAU,aAAa,CAAC,CAAA;AACvD,EAAA,GAAA,CAAI,KAAA,CAAM,KAAK,IAAI,CAAA;AACnB,EAAA,IAAI,OAAA,IAAW,GAAA,CAAI,KAAA,CAAM,MAAA,GAAS,CAAA,EAAG;AACnC,IAAA,MAAM,MAAA,GAAS,GAAA,CAAI,KAAA,CAAM,IAAA,CAAK,IAAI,CAAA;AAClC,IAAA,IAAI,MAAA,CAAO,MAAK,CAAE,MAAA,GAAS,GAAG,gBAAA,CAAiB,GAAA,EAAK,YAAY,QAAQ,CAAA;AAAA,EAC1E;AACF;AAEA,SAAS,gBAAA,CAAiB,GAAA,EAAuB,gBAAA,EAA0B,QAAA,EAAwB;AACjG,EAAA,IAAI,GAAA,CAAI,KAAA,CAAM,MAAA,KAAW,CAAA,EAAG;AAC5B,EAAA,MAAM,SAAA,GAAY,GAAA,CAAI,KAAA,CAAM,IAAA,CAAK,IAAI,CAAA;AACrC,EAAA,IAAI,SAAA,CAAU,IAAA,EAAK,CAAE,MAAA,KAAW,CAAA,EAAG;AACjC,IAAA,GAAA,CAAI,QAAQ,EAAC;AACb,IAAA,GAAA,CAAI,QAAQ,gBAAA,GAAmB,CAAA;AAC/B,IAAA;AAAA,EACF;AACA,EAAA,IAAI,SAAA,CAAU,SAAS,QAAA,EAAU;AAC/B,IAAA,mBAAA,CAAoB,IAAI,MAAA,EAAQ,SAAA,EAAW,IAAI,KAAA,EAAO,GAAA,CAAI,SAAS,QAAQ,CAAA;AAAA,EAC7E,CAAA,MAAO;AACL,IAAA,GAAA,CAAI,MAAA,CAAO,KAAK,UAAA,CAAW,SAAA,EAAW,IAAI,KAAA,EAAO,gBAAA,EAAkB,GAAA,CAAI,OAAO,CAAC,CAAA;AAAA,EACjF;AACA,EAAA,GAAA,CAAI,QAAQ,EAAC;AACb,EAAA,GAAA,CAAI,QAAQ,gBAAA,GAAmB,CAAA;AACjC;AAEA,SAAS,UAAA,CACP,IAAA,EACA,SAAA,EACA,OAAA,EACA,OAAA,EACa;AACb,EAAA,OAAO;AAAA,IACL,SAAA;AAAA,IACA,OAAA;AAAA,IACA,IAAA;AAAA,IACA,IAAA,EAAM,WAAW,QAAQ,CAAA,CAAE,OAAO,IAAI,CAAA,CAAE,OAAO,KAAK,CAAA;AAAA,IACpD,GAAI,OAAA,KAAY,MAAA,GAAY,EAAE,OAAA,KAAY;AAAC,GAC7C;AACF;AAEA,SAAS,mBAAA,CACP,MAAA,EACA,IAAA,EACA,SAAA,EACA,SACA,QAAA,EACM;AACN,EAAA,IAAI,SAAA,GAAY,IAAA;AAChB,EAAA,IAAI,UAAA,GAAa,SAAA;AACjB,EAAA,OAAO,SAAA,CAAU,SAAS,QAAA,EAAU;AAClC,IAAA,MAAM,OAAA,GAAU,qBAAA,CAAsB,SAAA,EAAW,QAAQ,CAAA;AACzD,IAAA,MAAM,KAAA,GAAQ,SAAA,CAAU,KAAA,CAAM,CAAA,EAAG,OAAO,CAAA;AACxC,IAAA,MAAM,UAAA,GAAa,KAAA,CAAM,KAAA,CAAM,IAAI,CAAA,CAAE,MAAA;AACrC,IAAA,MAAA,CAAO,IAAA,CAAK,WAAW,KAAA,EAAO,UAAA,EAAY,aAAa,UAAA,GAAa,CAAA,EAAG,OAAO,CAAC,CAAA;AAC/E,IAAA,SAAA,GAAY,UAAU,KAAA,CAAM,OAAO,CAAA,CAAE,OAAA,CAAQ,QAAQ,EAAE,CAAA;AACvD,IAAA,UAAA,IAAc,UAAA,GAAa,CAAA;AAAA,EAC7B;AACA,EAAA,IAAI,SAAA,CAAU,SAAS,CAAA,EAAG;AACxB,IAAA,MAAM,UAAA,GAAa,SAAA,CAAU,KAAA,CAAM,IAAI,CAAA,CAAE,MAAA;AACzC,IAAA,MAAA,CAAO,IAAA,CAAK,WAAW,SAAA,EAAW,UAAA,EAAY,aAAa,UAAA,GAAa,CAAA,EAAG,OAAO,CAAC,CAAA;AAAA,EACrF;AACF;AAOA,SAAS,qBAAA,CAAsB,MAAc,QAAA,EAA0B;AACrE,EAAA,IAAI,IAAA,CAAK,MAAA,IAAU,QAAA,EAAU,OAAO,IAAA,CAAK,MAAA;AAEzC,EAAA,KAAA,IAAS,CAAA,GAAI,UAAU,CAAA,GAAI,IAAA,CAAK,IAAI,CAAA,EAAG,QAAA,GAAW,GAAG,CAAA,EAAG,CAAA,EAAA,EAAK;AAC3D,IAAA,IAAI,KAAK,IAAA,CAAK,IAAA,CAAK,CAAC,CAAA,IAAK,GAAG,GAAG,OAAO,CAAA;AAAA,EACxC;AAEA,EAAA,OAAO,QAAA;AACT;;;AC/GA,eAAsB,UAAA,CACpB,MACA,UAAA,EAC2B;AAC3B,EAAA,MAAM,KAAA,GAAQ,MAAM,oBAAA,CAAqB,UAAU,CAAA;AACnD,EAAA,MAAM,cAAA,GAAiB,KAAK,WAAA,EAAY;AACxC,EAAA,IAAI,YAAA,GAAe,CAAA;AACnB,EAAA,IAAI,aAAA,GAAgB,CAAA;AAEpB,EAAA,KAAA,MAAW,SAAS,KAAA,EAAO;AACzB,IAAA,MAAM,GAAA,GAAM,MAAM,QAAA,CAAS,KAAA,CAAM,cAAc,MAAM,CAAA;AACrD,IAAA,MAAM,IAAA,GAAO,OAAO,GAAG,CAAA;AACvB,IAAA,IAAI,eAAe,GAAA,CAAI,KAAA,CAAM,YAAY,CAAA,EAAG,SAAS,IAAA,EAAM;AAE3D,IAAA,MAAM,KAAA,GAAQ,MAAM,IAAA,CAAK,KAAA,CAAM,YAAY,CAAA;AAC3C,IAAA,MAAM,MAAA,GAAS,KAAK,UAAA,CAAW;AAAA,MAC7B,SAAS,KAAA,CAAM,YAAA;AAAA,MACf,SAAS,KAAA,CAAM,OAAA;AAAA,MACf,IAAA;AAAA,MACA,SAAS,KAAA,CAAM,OAAA;AAAA,MACf,QAAQ,KAAA,CAAM;AAAA,KACf,CAAA;AACD,IAAA,IAAA,CAAK,oBAAoB,MAAM,CAAA;AAC/B,IAAA,MAAM,MAAA,GAAS,cAAc,GAAG,CAAA;AAChC,IAAA,KAAA,MAAW,KAAA,IAAS,QAAQ,IAAA,CAAK,WAAA,CAAY,EAAE,MAAA,EAAQ,GAAG,OAAO,CAAA;AAEjE,IAAA,YAAA,IAAgB,CAAA;AAChB,IAAA,aAAA,IAAiB,MAAA,CAAO,MAAA;AAAA,EAC1B;AAEA,EAAA,OAAO,EAAE,YAAA,EAAc,KAAA,CAAM,MAAA,EAAQ,cAAc,aAAA,EAAc;AACnE;;;ACtCO,SAAS,kBAAkB,KAAA,EAAuB;AACvD,EAAA,OAAO,CAAA,CAAA,EAAI,KAAA,CAAM,OAAA,CAAQ,KAAA,EAAO,MAAM,CAAA,CAAE,OAAA,CAAQ,IAAA,EAAM,KAAK,CAAA,CAAE,OAAA,CAAQ,IAAA,EAAM,KAAK,CAAC,CAAA,CAAA,CAAA;AACnF;;;AC4BO,SAAS,kBAAA,CAAmB,OAAA,GAAyB,EAAC,EAG3D;AACA,EAAA,OAAO;AAAA,IACL,YAAY,IAAA,CAAK,GAAA,CAAI,CAAA,EAAG,OAAA,CAAQ,cAAc,EAAE,CAAA;AAAA,IAChD,QAAA,EAAU,QAAQ,QAAA,IAAY;AAAA,GAChC;AACF;;;ACbA,IAAM,iBAAA,GAAoB,SAAA;AAW1B,IAAM,uBAAA,GAAsC,OAAO,MAAA,CAAO;AAAA,EACxD,YAAA,EAAc,CAAA;AAAA,EACd,YAAA,EAAc,CAAA;AAAA,EACd,aAAA,EAAe,CAAA;AAAA,EACf,cAAA,EAAgB,CAAA;AAAA,EAChB,SAAA,EAAW;AACb,CAAC,CAAA;AAEM,IAAM,qBAAN,MAAgD;AAAA,EACrD,YAA6B,KAAA,EAAmB;AAAnB,IAAA,IAAA,CAAA,KAAA,GAAA,KAAA;AAAA,EAAoB;AAAA,EAApB,KAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAM7B,MAAM,IAAA,GAA4B;AAChC,IAAA,OAAO,uBAAA;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKA,MAAM,MAAA,CAAO,KAAA,EAAe,OAAA,GAAyB,EAAC,EAA+B;AACnF,IAAA,IAAI,MAAM,IAAA,EAAK,CAAE,MAAA,KAAW,CAAA,SAAU,EAAC;AACvC,IAAA,MAAM,EAAE,UAAA,EAAY,QAAA,EAAS,GAAI,mBAAmB,OAAO,CAAA;AAE3D,IAAA,MAAM,SAAA,GAAY,MAAM,IAAA,CAAK,KAAA,CAAM,OAAO,KAAA,EAAO;AAAA,MAC/C,SAAA,EAAW,iBAAA;AAAA,MACX,OAAO,UAAA,GAAa,CAAA;AAAA,MACpB,GAAI,QAAQ,OAAA,KAAY,MAAA,GAAY,EAAE,OAAA,EAAS,OAAA,CAAQ,OAAA,EAAQ,GAAI;AAAC,KACrE,CAAA;AACD,IAAA,OAAO,SAAA,CACJ,OAAO,CAAC,CAAA,KAAM,EAAE,KAAA,IAAS,QAAQ,EACjC,KAAA,CAAM,CAAA,EAAG,UAAU,CAAA,CACnB,GAAA,CAAI,CAAC,CAAA,KAAM,iBAAA,CAAkB,GAAG,KAAA,EAAO,cAAA,CAAe,OAAO,CAAC,CAAC,CAAA;AAAA,EACpE;AAAA,EAEA,MAAA,GAAsB;AAYpB,IAAA,OAAO;AAAA,MACL,OAAA,EAAS,QAAA;AAAA,MACT,YAAA,EAAc,CAAA;AAAA,MACd,aAAA,EAAe,CAAA;AAAA,MACf,WAAA,EAAa;AAAA,KACf;AAAA,EACF;AAAA,EAEA,MAAM,KAAA,GAAuB;AAC3B,IAAA,MAAM,IAAA,CAAK,MAAM,KAAA,EAAM;AAAA,EACzB;AACF,CAAA;AAcA,SAAS,iBAAA,CACP,GAAA,EACA,KAAA,EACA,OAAA,EACiB;AACjB,EAAA,MAAM,YAAY,KAAA,KAAU,MAAA,GAAY,wBAAwB,KAAA,EAAO,GAAA,CAAI,IAAI,CAAA,GAAI,CAAA;AACnF,EAAA,MAAM,cAAc,GAAA,CAAI,KAAA;AAOxB,EAAA,MAAM,YACH,WAAA,GAAc,OAAA,CAAQ,eAAe,SAAA,GAAY,OAAA,CAAQ,cAAc,OAAA,CAAQ,KAAA;AAClF,EAAA,OAAO;AAAA,IACL,MAAM,GAAA,CAAI,EAAA;AAAA,IACV,SAAA,EAAW,CAAA;AAAA,IACX,OAAA,EAAS,CAAA;AAAA,IACT,KAAA,EAAO,QAAA;AAAA,IACP,SAAA;AAAA,IACA,WAAA;AAAA,IACA,OAAA,EAAS,GAAA,CAAI,IAAA,CAAK,KAAA,CAAM,GAAG,GAAG,CAAA;AAAA,IAC9B,QAAQ,GAAA,CAAI,MAAA;AAAA,IACZ,UAAU,GAAA,CAAI;AAAA,GAChB;AACF;AAQA,SAAS,uBAAA,CAAwB,OAAe,IAAA,EAAsB;AACpE,EAAA,MAAM,UAAA,GAAa,KAAA,CAChB,WAAA,EAAY,CACZ,KAAA,CAAM,KAAK,CAAA,CACX,MAAA,CAAO,CAAC,CAAA,KAAM,CAAA,CAAE,MAAA,GAAS,CAAC,CAAA;AAC7B,EAAA,IAAI,UAAA,CAAW,MAAA,KAAW,CAAA,EAAG,OAAO,CAAA;AACpC,EAAA,MAAM,SAAA,GAAY,KAAK,WAAA,EAAY;AACnC,EAAA,MAAM,OAAA,GAAU,WAAW,MAAA,CAAO,CAAC,SAAS,SAAA,CAAU,QAAA,CAAS,IAAI,CAAC,CAAA,CAAE,MAAA;AACtE,EAAA,OAAO,UAAU,UAAA,CAAW,MAAA;AAC9B;;;AChKO,IAAM,cAAA,GAA2C,CAAC,YAAA,EAAc,OAAO,CAAA;AAOvE,SAAS,mBAAmB,OAAA,EAAmD;AACpF,EAAA,IAAI,CAAC,cAAA,CAAe,QAAA,CAAS,OAAwB,CAAA,EAAG;AACtD,IAAA,MAAM,IAAI,kBAAA;AAAA,MACR,2BAA2B,OAAO,CAAA,iBAAA,EAAoB,cAAA,CAAe,IAAA,CAAK,IAAI,CAAC,CAAA,CAAA,CAAA;AAAA,MAC/E,EAAE,MAAM,wBAAA;AAAyB,KACnC;AAAA,EACF;AACF;AAQA,eAAsB,eAAe,IAAA,EAA8C;AACjF,EAAA,IAAI,IAAA,CAAK,cAAc,MAAA,EAAW;AAChC,IAAA,MAAM,IAAI,kBAAA;AAAA,MACR,gKAAA;AAAA,MACA,EAAE,MAAM,0BAAA;AAA2B,KACrC;AAAA,EACF;AACA,EAAA,MAAM,KAAA,GAAQ,MAAM,UAAA,CAAW,IAAA,CAAK;AAAA,IAClC,KAAK,IAAA,CAAK,GAAA;AAAA,IACV,WAAW,IAAA,CAAK,SAAA;AAAA,IAChB,GAAI,KAAK,QAAA,KAAa,MAAA,GAAY,EAAE,WAAA,EAAa,IAAA,CAAK,QAAA,EAAS,GAAI;AAAC,GACrE,CAAA;AACD,EAAA,OAAO,IAAI,mBAAmB,KAAK,CAAA;AACrC;;;ACvBO,IAAM,wBAAN,MAA4B;AAAA,EACjC,YAA6B,EAAA,EAAc;AAAd,IAAA,IAAA,CAAA,EAAA,GAAA,EAAA;AAAA,EAAe;AAAA,EAAf,EAAA;AAAA,EAE7B,MAAA,GAA4C;AAC1C,IAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,EAAA,CAAG,OAAA,CAAQ,iCAAiC,EAAE,GAAA,EAAI,IAAK,EAAE,CAAA,EAAG,CAAA,EAAE;AACjF,IAAA,MAAM,MAAA,GAAS,IAAA,CAAK,EAAA,CAAG,OAAA,CAAQ,kCAAkC,EAAE,GAAA,EAAI,IAAK,EAAE,CAAA,EAAG,CAAA,EAAE;AACnF,IAAA,OAAO,EAAE,KAAA,EAAO,MAAA,CAAO,KAAA,CAAM,CAAA,IAAK,CAAC,CAAA,EAAG,MAAA,EAAQ,MAAA,CAAO,MAAA,CAAO,CAAA,IAAK,CAAC,CAAA,EAAE;AAAA,EACtE;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,OAAA,CAAQ,gBAAwB,KAAA,EAA+C;AAC7E,IAAA,OAAO,KAAK,EAAA,CACT,OAAA;AAAA,MACC,CAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,gBAAA;AAAA,KASF,CACC,GAAA,CAAI,cAAA,EAAgB,KAAK,CAAA;AAAA,EAC9B;AAAA;AAAA,EAGA,QAAA,CAAS,gBAAwB,KAAA,EAA+C;AAC9E,IAAA,OAAO,KAAK,EAAA,CACT,OAAA;AAAA,MACC,CAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,gBAAA;AAAA,KAOF,CACC,GAAA,CAAI,cAAA,EAAgB,KAAK,CAAA;AAAA,EAC9B;AAAA;AAAA,EAGA,eAAe,GAAA,EAA4D;AACzE,IAAA,IAAI,GAAA,CAAI,MAAA,KAAW,CAAA,EAAG,OAAO,EAAC;AAC9B,IAAA,MAAM,eAAe,GAAA,CAAI,GAAA,CAAI,MAAM,GAAG,CAAA,CAAE,KAAK,GAAG,CAAA;AAChD,IAAA,OAAO,KAAK,EAAA,CACT,OAAA;AAAA,MACC,CAAA;AAAA;AAAA;AAAA;AAAA,6BAAA,EAIuB,YAAY,CAAA,CAAA;AAAA,KACrC,CACC,GAAA,CAAI,GAAG,GAAG,CAAA;AAAA,EACf;AAAA;AAAA,EAGA,WAAA,GAAoC;AAClC,IAAA,MAAM,OAAO,IAAA,CAAK,EAAA,CAAG,OAAA,CAAQ,kCAAkC,EAAE,GAAA,EAAI;AAKrE,IAAA,OAAO,IAAI,GAAA,CAAI,IAAA,CAAK,IAAI,CAAC,GAAA,KAAQ,CAAC,GAAA,CAAI,IAAA,EAAM,EAAE,EAAA,EAAI,IAAI,EAAA,EAAI,IAAA,EAAM,IAAI,IAAA,EAAM,CAAC,CAAC,CAAA;AAAA,EAC9E;AAAA,EAEA,WAAW,IAAA,EAMA;AACT,IAAA,MAAM,GAAA,GAAM,KAAK,EAAA,CACd,OAAA;AAAA,MACC,CAAA;AAAA;AAAA,qBAAA;AAAA,KAGF,CACC,GAAA,CAAI,IAAA,CAAK,OAAA,EAAS,KAAK,OAAA,EAAS,IAAA,CAAK,KAAA,CAAM,IAAA,CAAK,OAAO,CAAA,EAAG,IAAA,CAAK,IAAA,EAAM,KAAK,MAAM,CAAA;AAGnF,IAAA,OAAO,GAAA,CAAI,EAAA;AAAA,EACb;AAAA,EAEA,oBAAoB,MAAA,EAAsB;AACxC,IAAA,IAAA,CAAK,EAAA,CAAG,OAAA,CAAQ,sCAAsC,CAAA,CAAE,IAAI,MAAM,CAAA;AAAA,EACpE;AAAA,EAEA,YAAY,KAAA,EAMH;AACP,IAAA,IAAA,CAAK,EAAA,CACF,OAAA;AAAA,MACC;AAAA,KACF,CACC,GAAA,CAAI,KAAA,CAAM,MAAA,EAAQ,KAAA,CAAM,SAAA,EAAW,KAAA,CAAM,OAAA,EAAS,KAAA,CAAM,IAAA,EAAM,KAAA,CAAM,IAAI,CAAA;AAAA,EAC7E;AAAA,EAEA,KAAA,GAAc;AACZ,IAAA,IAAA,CAAK,GAAG,KAAA,EAAM;AAAA,EAChB;AACF,CAAA;;;AC5HA,eAAsB,uBAAuB,EAAA,EAA6B;AACxE,EAAA,IAAI;AACF,IAAA,MAAM,GAAA,GAAM,MAAM,OAAO,YAAY,CAAA;AACrC,IAAA,MAAM,SAAU,GAAA,CAAyC,IAAA;AACzD,IAAA,IAAI,OAAO,WAAW,UAAA,EAAY;AAChC,MAAA,MAAM,IAAI,MAAM,4CAA4C,CAAA;AAAA,IAC9D;AACA,IAAA,MAAA,CAAO,EAAE,CAAA;AAAA,EACX,SAAS,KAAA,EAAO;AACd,IAAA,MAAM,UAAU,KAAA,YAAiB,KAAA,GAAQ,KAAA,CAAM,OAAA,GAAU,OAAO,KAAK,CAAA;AACrE,IAAA,MAAM,IAAI,kBAAA;AAAA,MACR,wHAAwH,OAAO,CAAA,CAAA;AAAA,MAC/H,EAAE,IAAA,EAAM,wBAAA,EAA0B,KAAA;AAAM,KAC1C;AAAA,EACF;AACF;;;ACbO,IAAM,oBAAA,GAAuB,sBAAA;AAC7B,IAAM,cAAA,GAAiB,iBAAA;AACvB,IAAM,kBAAA,GAAqB,qBAAA;AAQ3B,SAAS,sBAAsB,EAAA,EAA6C;AACjF,EAAA,MAAM,GAAA,GAAM,CAAC,GAAA,KAAoC;AAC/C,IAAA,MAAM,MAAM,EAAA,CAAG,OAAA,CAAQ,sCAAsC,CAAA,CAAE,IAAI,GAAG,CAAA;AACtE,IAAA,OAAO,GAAA,KAAQ,MAAA,GAAY,MAAA,CAAO,GAAA,CAAI,KAAK,CAAA,GAAI,MAAA;AAAA,EACjD,CAAA;AACA,EAAA,MAAM,UAAA,GAAa,IAAI,oBAAoB,CAAA;AAC3C,EAAA,MAAM,KAAA,GAAQ,IAAI,cAAc,CAAA;AAChC,EAAA,MAAM,MAAA,GAAS,IAAI,kBAAkB,CAAA;AACrC,EAAA,IAAI,eAAe,MAAA,IAAa,KAAA,KAAU,MAAA,IAAa,MAAA,KAAW,QAAW,OAAO,MAAA;AACpF,EAAA,MAAM,SAAA,GAAY,OAAO,MAAM,CAAA;AAC/B,EAAA,IAAI,CAAC,MAAA,CAAO,QAAA,CAAS,SAAS,CAAA,IAAK,SAAA,IAAa,GAAG,OAAO,MAAA;AAC1D,EAAA,OAAO,EAAE,UAAA,EAAY,KAAA,EAAO,SAAA,EAAU;AACxC;AAEO,SAAS,sBAAA,CAAuB,IAAc,QAAA,EAAmC;AACtF,EAAA,MAAM,OAAO,EAAA,CAAG,OAAA;AAAA,IACd;AAAA,GACF;AACA,EAAA,IAAA,CAAK,GAAA,CAAI,oBAAA,EAAsB,QAAA,CAAS,UAAU,CAAA;AAClD,EAAA,IAAA,CAAK,GAAA,CAAI,cAAA,EAAgB,QAAA,CAAS,KAAK,CAAA;AACvC,EAAA,IAAA,CAAK,GAAA,CAAI,kBAAA,EAAoB,MAAA,CAAO,QAAA,CAAS,SAAS,CAAC,CAAA;AACzD;AAEO,SAAS,eAAA,CAAgB,GAAsB,CAAA,EAA+B;AACnF,EAAA,OAAO,CAAA,CAAE,UAAA,KAAe,CAAA,CAAE,UAAA,IAAc,CAAA,CAAE,UAAU,CAAA,CAAE,KAAA,IAAS,CAAA,CAAE,SAAA,KAAc,CAAA,CAAE,SAAA;AACnF;AAEO,SAAS,gBAAgB,EAAA,EAAoB;AAClD,EAAA,EAAA,CAAG,KAAK,iCAAiC,CAAA;AAC3C;AAEO,SAAS,iBAAA,CAAkB,IAAc,SAAA,EAAyB;AACvE,EAAA,EAAA,CAAG,IAAA,CAAK,CAAA;AAAA;AAAA,cAAA,EAEM,SAAS,CAAA;AAAA,GAAA,CACrB,CAAA;AACJ;AAGO,SAAS,WAAW,GAAA,EAAoC;AAC7D,EAAA,MAAM,GAAA,GAAM,IAAI,YAAA,CAAa,GAAA,CAAI,MAAM,CAAA;AACvC,EAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,GAAA,CAAI,MAAA,EAAQ,CAAA,EAAA,EAAK,GAAA,CAAI,CAAC,CAAA,GAAI,GAAA,CAAI,CAAC,CAAA,IAAK,CAAA;AACxD,EAAA,OAAO,MAAA,CAAO,IAAA,CAAK,GAAA,CAAI,MAAM,CAAA;AAC/B;AAEO,SAAS,eAAA,CAAgB,EAAA,EAAc,OAAA,EAAiB,GAAA,EAAkC;AAI/F,EAAA,MAAM,EAAA,GAAK,OAAO,OAAO,CAAA;AACzB,EAAA,EAAA,CAAG,OAAA,CAAQ,2CAA2C,CAAA,CAAE,GAAA,CAAI,EAAE,CAAA;AAC9D,EAAA,EAAA,CAAG,QAAQ,sDAAsD,CAAA,CAAE,IAAI,EAAA,EAAI,UAAA,CAAW,GAAG,CAAC,CAAA;AAC5F;AAOO,SAAS,YAAA,CACd,EAAA,EACA,KAAA,EACA,CAAA,EACgB;AAGhB,EAAA,MAAM,OAAO,EAAA,CACV,OAAA;AAAA,IACC,CAAA;AAAA;AAAA,wBAAA;AAAA,IAID,GAAA,CAAI,UAAA,CAAW,KAAK,CAAA,EAAG,MAAA,CAAO,CAAC,CAAC,CAAA;AACnC,EAAA,OAAO,IAAA,CAAK,GAAA,CAAI,CAAC,GAAA,MAAS,EAAE,QAAA,EAAU,MAAA,CAAO,GAAA,CAAI,QAAQ,GAAG,QAAA,EAAU,MAAA,CAAO,GAAA,CAAI,QAAQ,GAAE,CAAE,CAAA;AAC/F;AAQA,eAAsB,mBAAmB,IAAA,EAAqC;AAC5E,EAAA,MAAM,IAAA,GAAO,KAAK,EAAA,CACf,OAAA;AAAA,IACC,CAAA;AAAA;AAAA;AAAA,wCAAA;AAAA,IAKD,GAAA,EAAI;AACP,EAAA,IAAI,IAAA,CAAK,MAAA,KAAW,CAAA,EAAG,OAAO,CAAA;AAC9B,EAAA,MAAM,aAAa,IAAA,CAAK,GAAA,CAAI,CAAC,GAAA,MAAS,EAAE,EAAA,EAAI,MAAA,CAAO,GAAA,CAAI,EAAE,GAAG,IAAA,EAAM,MAAA,CAAO,IAAI,IAAA,IAAQ,EAAE,GAAE,CAAE,CAAA;AAC3F,EAAA,MAAM,OAAA,GAAU,MAAM,IAAA,CAAK,OAAA,CAAQ,KAAA,CAAM,UAAA,CAAW,GAAA,CAAI,CAAC,CAAA,KAAM,CAAA,CAAE,IAAI,CAAC,CAAA;AACtE,EAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,UAAA,CAAW,QAAQ,CAAA,EAAA,EAAK;AAC1C,IAAA,MAAM,GAAA,GAAM,WAAW,CAAC,CAAA;AACxB,IAAA,MAAM,MAAA,GAAS,QAAQ,CAAC,CAAA;AACxB,IAAA,IAAI,GAAA,KAAQ,MAAA,IAAa,MAAA,KAAW,MAAA,EAAW;AAC/C,IAAA,eAAA,CAAgB,IAAA,CAAK,EAAA,EAAI,GAAA,CAAI,EAAA,EAAI,MAAM,CAAA;AAAA,EACzC;AACA,EAAA,OAAO,UAAA,CAAW,MAAA;AACpB;;;ACzGA,IAAM,gBAAA,GAAmB,IAAI,iBAAA,CAAkB,GAAI,CAAA;AA2C5C,IAAM,YAAA,GAAN,MAAM,aAAA,CAAoC;AAAA,EAOvC,WAAA,CACW,UAAA,EACA,EAAA,EACA,SAAA,EACjB;AAHiB,IAAA,IAAA,CAAA,UAAA,GAAA,UAAA;AACA,IAAA,IAAA,CAAA,EAAA,GAAA,EAAA;AACA,IAAA,IAAA,CAAA,SAAA,GAAA,SAAA;AAEjB,IAAA,IAAA,CAAK,IAAA,GAAO,IAAI,qBAAA,CAAsB,EAAE,CAAA;AAAA,EAC1C;AAAA,EALmB,UAAA;AAAA,EACA,EAAA;AAAA,EACA,SAAA;AAAA,EATX,UAAA;AAAA,EACA,WAAA,GAAc,KAAA;AAAA;AAAA,EAGL,IAAA;AAAA,EAmBjB,aAAa,KAAK,IAAA,EAA8C;AAC9D,IAAA,MAAM,OAAA,GAAU,KAAK,OAAA,IAAW,YAAA;AAChC,IAAA,kBAAA,CAAmB,OAAO,CAAA;AAC1B,IAAA,IAAI,OAAA,KAAY,OAAA,EAAS,OAAO,MAAM,eAAe,IAAI,CAAA;AACzD,IAAA,OAAO,MAAM,aAAA,CAAa,kBAAA,CAAmB,IAAI,CAAA;AAAA,EACnD;AAAA;AAAA,EAGA,aAAqB,mBAAmB,IAAA,EAA+C;AACrF,IAAA,MAAM,UAAA,GAAa,IAAA,CAAK,UAAA,IAAc,iBAAA,CAAkB,KAAK,GAAG,CAAA;AAMhE,IAAA,MAAM,WAAW,IAAA,CAAK,QAAA,IAAY,iBAAiB,gBAAA,CAAiB,IAAA,CAAK,GAAG,CAAC,CAAA;AAC7E,IAAA,MAAM,EAAA,GAAK,MAAM,YAAA,CAAa,EAAE,UAAU,CAAA;AAC1C,IAAA,MAAM,UAAU,IAAI,aAAA,CAAa,UAAA,EAAY,EAAA,EAAI,KAAK,SAAS,CAAA;AAC/D,IAAA,IAAI,KAAK,SAAA,KAAc,MAAA,QAAiB,OAAA,CAAQ,iBAAA,CAAkB,KAAK,SAAS,CAAA;AAChF,IAAA,OAAO,OAAA;AAAA,EACT;AAAA,EAEA,MAAc,kBAAkB,OAAA,EAA0C;AACxE,IAAA,MAAM,sBAAA,CAAuB,KAAK,EAAE,CAAA;AACpC,IAAA,MAAM,eAAA,GAAkB;AAAA,MACtB,YAAY,OAAA,CAAQ,EAAA;AAAA,MACpB,OAAO,OAAA,CAAQ,KAAA;AAAA,MACf,WAAW,OAAA,CAAQ;AAAA,KACrB;AACA,IAAA,MAAM,SAAA,GAAY,qBAAA,CAAsB,IAAA,CAAK,EAAE,CAAA;AAC/C,IAAA,IAAI,cAAc,MAAA,IAAa,CAAC,eAAA,CAAgB,SAAA,EAAW,eAAe,CAAA,EAAG;AAG3E,MAAA,eAAA,CAAgB,KAAK,EAAE,CAAA;AAAA,IACzB;AACA,IAAA,iBAAA,CAAkB,IAAA,CAAK,EAAA,EAAI,OAAA,CAAQ,SAAS,CAAA;AAC5C,IAAA,sBAAA,CAAuB,IAAA,CAAK,IAAI,eAAe,CAAA;AAC/C,IAAA,IAAA,CAAK,WAAA,GAAc,IAAA;AAAA,EACrB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,MAAM,IAAA,GAA4B;AAChC,IAAA,MAAM,SAAS,MAAM,UAAA,CAAW,IAAA,CAAK,IAAA,EAAM,KAAK,UAAU,CAAA;AAC1D,IAAA,IAAI,cAAA,GAAiB,CAAA;AACrB,IAAA,IAAI,IAAA,CAAK,WAAA,IAAe,IAAA,CAAK,SAAA,KAAc,MAAA,EAAW;AACpD,MAAA,cAAA,GAAiB,MAAM,mBAAmB,EAAE,EAAA,EAAI,KAAK,EAAA,EAAI,OAAA,EAAS,IAAA,CAAK,SAAA,EAAW,CAAA;AAAA,IACpF;AACA,IAAA,IAAA,CAAK,UAAA,GAAa,KAAK,GAAA,EAAI;AAG3B,IAAA,OAAO,EAAE,GAAG,MAAA,EAAQ,cAAA,EAAgB,WAAW,IAAA,EAAK;AAAA,EACtD;AAAA,EAEA,MAAM,MAAA,CAAO,KAAA,EAAe,OAAA,GAAyB,EAAC,EAA+B;AACnF,IAAA,IAAI,MAAM,IAAA,EAAK,CAAE,MAAA,KAAW,CAAA,SAAU,EAAC;AACvC,IAAA,MAAM,EAAE,UAAA,EAAY,QAAA,EAAS,GAAI,mBAAmB,OAAO,CAAA;AAC3D,IAAA,MAAM,QAAA,GAAW,IAAA,CAAK,SAAA,CAAU,KAAA,EAAO,aAAa,CAAC,CAAA;AACrD,IAAA,MAAM,iBAAiB,MAAM,IAAA,CAAK,gBAAA,CAAiB,KAAA,EAAO,aAAa,CAAC,CAAA;AACxE,IAAA,MAAM,QAAA,GAAW,IAAA,CAAK,mBAAA,CAAoB,QAAA,EAAU,gBAAgB,OAAO,CAAA;AAC3E,IAAA,OAAO,QAAA,CACJ,OAAO,CAAC,CAAA,KAAM,EAAE,KAAA,IAAS,QAAQ,CAAA,CACjC,MAAA,CAAO,CAAC,CAAA,KAAM,QAAQ,OAAA,KAAY,MAAA,IAAa,OAAA,CAAQ,OAAA,CAAQ,QAAA,CAAS,CAAA,CAAE,MAAM,CAAC,CAAA,CACjF,KAAA,CAAM,CAAA,EAAG,UAAU,CAAA;AAAA,EACxB;AAAA,EAEA,MAAA,GAAsB;AACpB,IAAA,MAAM,EAAE,KAAA,EAAO,MAAA,EAAO,GAAI,IAAA,CAAK,KAAK,MAAA,EAAO;AAC3C,IAAA,MAAM,MAAA,GAAsB;AAAA,MAC1B,OAAA,EAAS,IAAA,CAAK,WAAA,GAAc,QAAA,GAAW,UAAA;AAAA,MACvC,YAAA,EAAc,KAAA;AAAA,MACd,aAAA,EAAe,MAAA;AAAA;AAAA,MAEf,WAAA,EAAa;AAAA,KACf;AACA,IAAA,IAAI,IAAA,CAAK,UAAA,KAAe,MAAA,EAAW,MAAA,CAAO,aAAa,IAAA,CAAK,UAAA;AAC5D,IAAA,OAAO,MAAA;AAAA,EACT;AAAA;AAAA,EAIQ,SAAA,CAAU,OAAe,KAAA,EAA6D;AAG5F,IAAA,MAAM,SAAA,GAAY,kBAAkB,KAAK,CAAA;AACzC,IAAA,IAAI,SAAA,CAAU,MAAA,KAAW,CAAA,EAAG,OAAO,EAAC;AACpC,IAAA,IAAI,OAAuC,EAAC;AAC5C,IAAA,IAAI;AACF,MAAA,IAAA,GAAO,IAAA,CAAK,IAAA,CAAK,OAAA,CAAQ,SAAA,EAAW,KAAK,CAAA;AAAA,IAC3C,SAAS,GAAA,EAAK;AAWZ,MAAA,IAAI,CAAC,WAAA,CAAY,KAAK,CAAA,EAAG;AACvB,QAAA,IAAA;AAAA,UACE,kJAEI,GAAA,YAAe,KAAA,GAAQ,IAAI,OAAA,GAAU,MAAA,CAAO,GAAG,CACjD,CAAA;AAAA,SACJ;AAAA,MACF;AACA,MAAA,OAAO,IAAA,CAAK,kBAAA,CAAmB,KAAA,EAAO,KAAK,CAAA;AAAA,IAC7C;AACA,IAAA,OAAO,IAAA,CAAK,GAAA,CAAI,CAAC,GAAA,KAAQ;AACvB,MAAA,MAAM,IAAA,GAAO,MAAA,CAAO,GAAA,CAAI,UAAA,IAAc,CAAC,CAAA;AACvC,MAAA,MAAM,SAAA,GAAY,IAAA,GAAO,CAAA,GAAI,CAAA,IAAK,CAAA,GAAI,KAAK,GAAA,CAAI,IAAI,CAAA,CAAA,GAAK,CAAA,IAAK,CAAA,GAAI,IAAA,CAAA;AACjE,MAAA,MAAM,SAAA,GAAY,MAAA,CAAO,GAAA,CAAI,UAAA,IAAc,CAAC,CAAA;AAC5C,MAAA,MAAM,OAAA,GAAU,MAAA,CAAO,GAAA,CAAI,QAAA,IAAY,CAAC,CAAA;AACxC,MAAA,MAAM,IAAA,GAAO,MAAA,CAAO,GAAA,CAAI,QAAQ,CAAA;AAChC,MAAA,OAAO;AAAA,QACL,IAAA;AAAA,QACA,SAAA;AAAA,QACA,OAAA;AAAA,QACA,KAAA,EAAO,SAAA;AAAA,QACP,SAAA;AAAA,QACA,SAAS,eAAA,CAAgB,MAAA,CAAO,GAAA,CAAI,IAAA,IAAQ,EAAE,CAAC,CAAA;AAAA,QAC/C,MAAA,EAAQ,MAAA,CAAO,GAAA,CAAI,MAAM,CAAA;AAAA,QACzB,UAAU,CAAA,EAAG,IAAI,CAAA,CAAA,EAAI,SAAS,IAAI,OAAO,CAAA,CAAA;AAAA;AAAA;AAAA,QAGzC,OAAA,EAAS,MAAA,CAAO,GAAA,CAAI,EAAE;AAAA,OACxB;AAAA,IACF,CAAC,CAAA;AAAA,EACH;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQQ,kBAAA,CACN,OACA,KAAA,EAC8C;AAC9C,IAAA,MAAM,OAAO,IAAA,CAAK,IAAA,CAAK,SAAS,iBAAA,CAAkB,KAAK,GAAG,KAAK,CAAA;AAC/D,IAAA,OAAO,IAAA,CAAK,GAAA,CAAI,CAAC,GAAA,KAAQ;AACvB,MAAA,MAAM,IAAA,GAAO,MAAA,CAAO,GAAA,CAAI,QAAA,IAAY,EAAE,CAAA;AACtC,MAAA,MAAM,SAAA,GAAY,MAAA,CAAO,GAAA,CAAI,UAAA,IAAc,CAAC,CAAA;AAC5C,MAAA,MAAM,OAAA,GAAU,MAAA,CAAO,GAAA,CAAI,QAAA,IAAY,CAAC,CAAA;AACxC,MAAA,OAAO;AAAA,QACL,IAAA;AAAA,QACA,SAAA;AAAA,QACA,OAAA;AAAA,QACA,KAAA,EAAO,GAAA;AAAA;AAAA,QACP,SAAA,EAAW,GAAA;AAAA,QACX,SAAS,eAAA,CAAgB,MAAA,CAAO,GAAA,CAAI,IAAA,IAAQ,EAAE,CAAC,CAAA;AAAA,QAC/C,MAAA,EAAQ,MAAA,CAAO,GAAA,CAAI,MAAM,CAAA;AAAA,QACzB,UAAU,CAAA,EAAG,IAAI,CAAA,CAAA,EAAI,SAAS,IAAI,OAAO,CAAA,CAAA;AAAA,QACzC,OAAA,EAAS,MAAA,CAAO,GAAA,CAAI,EAAE;AAAA,OACxB;AAAA,IACF,CAAC,CAAA;AAAA,EACH;AAAA,EAEA,MAAc,gBAAA,CACZ,KAAA,EACA,KAAA,EACiE;AACjE,IAAA,IAAI,CAAC,KAAK,WAAA,IAAe,IAAA,CAAK,cAAc,MAAA,EAAW,2BAAW,GAAA,EAAI;AAMtE,IAAA,MAAM,QAAA,GAAWA,WAAW,QAAQ,CAAA,CAAE,OAAO,KAAK,CAAA,CAAE,OAAO,KAAK,CAAA;AAChE,IAAA,MAAM,MAAA,GAAS,gBAAA,CAAiB,GAAA,CAAI,QAAQ,CAAA;AAC5C,IAAA,MAAM,QAAA,GAAW,MAAA,IAAA,CAAW,MAAM,IAAA,CAAK,SAAA,CAAU,MAAM,CAAC,KAAK,CAAC,CAAA,EAAG,CAAC,CAAA;AAClE,IAAA,IAAI,QAAA,KAAa,MAAA,EAAW,uBAAO,IAAI,GAAA,EAAI;AAC3C,IAAA,IAAI,MAAA,KAAW,MAAA,EAAW,gBAAA,CAAiB,GAAA,CAAI,UAAU,QAAQ,CAAA;AACjE,IAAA,MAAM,IAAA,GAAO,YAAA,CAAa,IAAA,CAAK,EAAA,EAAI,UAAU,KAAK,CAAA;AAElD,IAAA,MAAM,GAAA,uBAAU,GAAA,EAAqC;AACrD,IAAA,KAAA,MAAW,OAAO,IAAA,EAAM;AACtB,MAAA,MAAM,QAAQ,CAAA,IAAK,CAAA,GAAI,KAAK,GAAA,CAAI,CAAA,EAAG,IAAI,QAAQ,CAAA,CAAA;AAC/C,MAAA,GAAA,CAAI,IAAI,GAAA,CAAI,QAAA,EAAU,EAAE,WAAA,EAAa,OAAO,CAAA;AAAA,IAC9C;AACA,IAAA,OAAO,GAAA;AAAA,EACT;AAAA,EAEQ,mBAAA,CACN,QAAA,EACA,cAAA,EACA,OAAA,EACmB;AACnB,IAAA,MAAM,OAAA,GAAU,eAAe,OAAO,CAAA;AACtC,IAAA,MAAM,MAAA,GAAS,IAAA,CAAK,SAAA,CAAU,QAAA,EAAU,cAAc,CAAA;AACtD,IAAA,MAAM,WAAW,CAAC,GAAG,MAAA,CAAO,MAAA,EAAQ,CAAA,CAAE,GAAA;AAAA,MAAI,CAAC,GAAA,KACzC,WAAA,CAAY,GAAA,EAAK,cAAA,CAAe,GAAA,CAAI,GAAA,CAAI,OAAO,CAAA,EAAG,WAAA,IAAe,CAAA,EAAG,OAAO;AAAA,KAC7E;AACA,IAAA,OAAO,QAAA,CAAS,KAAK,CAAC,CAAA,EAAG,MAAM,CAAA,CAAE,KAAA,GAAQ,EAAE,KAAK,CAAA;AAAA,EAClD;AAAA,EAEQ,SAAA,CACN,UACA,cAAA,EACoD;AACpD,IAAA,MAAM,MAAA,uBAAa,GAAA,EAAmD;AACtE,IAAA,KAAA,MAAW,OAAO,QAAA,EAAU,MAAA,CAAO,GAAA,CAAI,GAAA,CAAI,SAAS,GAAG,CAAA;AACvD,IAAA,MAAM,UAAA,GAAa,CAAC,GAAG,cAAA,CAAe,MAAM,CAAA,CAAE,MAAA,CAAO,CAAC,EAAA,KAAO,CAAC,MAAA,CAAO,GAAA,CAAI,EAAE,CAAC,CAAA;AAC5E,IAAA,IAAI,UAAA,CAAW,SAAS,CAAA,EAAG;AACzB,MAAA,KAAA,MAAW,GAAA,IAAO,IAAA,CAAK,gBAAA,CAAiB,UAAU,CAAA,EAAG;AACnD,QAAA,MAAA,CAAO,GAAA,CAAI,GAAA,CAAI,OAAA,EAAS,EAAE,GAAG,KAAK,KAAA,EAAO,CAAA,EAAG,SAAA,EAAW,CAAA,EAAG,CAAA;AAAA,MAC5D;AAAA,IACF;AACA,IAAA,OAAO,MAAA;AAAA,EACT;AAAA,EAEQ,iBACN,GAAA,EAC8C;AAC9C,IAAA,MAAM,IAAA,GAAO,IAAA,CAAK,IAAA,CAAK,cAAA,CAAe,GAAG,CAAA;AACzC,IAAA,OAAO,IAAA,CAAK,GAAA,CAAI,CAAC,GAAA,KAAQ;AACvB,MAAA,MAAM,SAAA,GAAY,MAAA,CAAO,GAAA,CAAI,UAAA,IAAc,CAAC,CAAA;AAC5C,MAAA,MAAM,OAAA,GAAU,MAAA,CAAO,GAAA,CAAI,QAAA,IAAY,CAAC,CAAA;AACxC,MAAA,MAAM,IAAA,GAAO,MAAA,CAAO,GAAA,CAAI,QAAQ,CAAA;AAChC,MAAA,OAAO;AAAA,QACL,OAAA,EAAS,MAAA,CAAO,GAAA,CAAI,EAAE,CAAA;AAAA,QACtB,IAAA;AAAA,QACA,SAAA;AAAA,QACA,OAAA;AAAA,QACA,KAAA,EAAO,CAAA;AAAA,QACP,SAAA,EAAW,CAAA;AAAA,QACX,SAAS,eAAA,CAAgB,MAAA,CAAO,GAAA,CAAI,IAAA,IAAQ,EAAE,CAAC,CAAA;AAAA,QAC/C,MAAA,EAAQ,MAAA,CAAO,GAAA,CAAI,MAAM,CAAA;AAAA,QACzB,UAAU,CAAA,EAAG,IAAI,CAAA,CAAA,EAAI,SAAS,IAAI,OAAO,CAAA;AAAA,OAC3C;AAAA,IACF,CAAC,CAAA;AAAA,EACH;AAAA,EAEA,KAAA,GAAc;AACZ,IAAA,IAAA,CAAK,KAAK,KAAA,EAAM;AAAA,EAClB;AACF","file":"chunk-2ZLVT7H3.js","sourcesContent":["import { createHash } from \"node:crypto\";\n\nimport type { MemoryChunk } from \"../types.js\";\n\n/**\n * Split a markdown document into semantically meaningful chunks (ADR D1 of\n * memory-system-peer-project-parity).\n *\n * Algorithm:\n *   1. Walk lines tracking the current heading (latest `^#+ ` line).\n *   2. Split chunks at the next heading boundary AND on blank-line paragraph\n *      boundaries.\n *   3. If a single paragraph exceeds `maxChars`, split it at the nearest\n *      whitespace ≤ maxChars (word-aligned per edge-case review EC-6) —\n *      never mid-word.\n *\n * Mirrors peer-project's `chunkMarkdown` from\n * `packages/memory-host-sdk/src/host/chunk-markdown.ts`.\n *\n * @internal\n */\n\nexport interface ChunkMarkdownOptions {\n  /** Maximum chars per chunk. Default 800. */\n  maxChars?: number;\n  /** Minimum chars per chunk (avoids splintering tiny lines). Default 80. */\n  minChars?: number;\n}\n\nconst HEADING_RE = /^(#{1,6})\\s+(.+?)\\s*$/;\n\ninterface ChunkAccumulator {\n  chunks: MemoryChunk[];\n  lines: string[];\n  start: number;\n  heading: string | undefined;\n}\n\nexport function chunkMarkdown(text: string, options: ChunkMarkdownOptions = {}): MemoryChunk[] {\n  const maxChars = options.maxChars ?? 800;\n  if (text.length === 0) return [];\n  const lines = text.split(\"\\n\");\n  const acc: ChunkAccumulator = { chunks: [], lines: [], start: 1, heading: undefined };\n  for (let i = 0; i < lines.length; i++) {\n    const line = lines[i] ?? \"\";\n    const lineNumber = i + 1;\n    processLine(acc, line, lineNumber, maxChars);\n  }\n  flushAccumulator(acc, lines.length, maxChars);\n  return acc.chunks;\n}\n\nfunction processLine(\n  acc: ChunkAccumulator,\n  line: string,\n  lineNumber: number,\n  maxChars: number,\n): void {\n  const headingMatch = HEADING_RE.exec(line);\n  const isBlank = line.trim().length === 0;\n  if (headingMatch !== null && acc.lines.length > 0) {\n    flushAccumulator(acc, lineNumber - 1, maxChars);\n  }\n  if (headingMatch !== null) acc.heading = headingMatch[2];\n  acc.lines.push(line);\n  if (isBlank && acc.lines.length > 1) {\n    const joined = acc.lines.join(\"\\n\");\n    if (joined.trim().length > 0) flushAccumulator(acc, lineNumber, maxChars);\n  }\n}\n\nfunction flushAccumulator(acc: ChunkAccumulator, endLineExclusive: number, maxChars: number): void {\n  if (acc.lines.length === 0) return;\n  const chunkText = acc.lines.join(\"\\n\");\n  if (chunkText.trim().length === 0) {\n    acc.lines = [];\n    acc.start = endLineExclusive + 1;\n    return;\n  }\n  if (chunkText.length > maxChars) {\n    pushOversizedSlices(acc.chunks, chunkText, acc.start, acc.heading, maxChars);\n  } else {\n    acc.chunks.push(buildChunk(chunkText, acc.start, endLineExclusive, acc.heading));\n  }\n  acc.lines = [];\n  acc.start = endLineExclusive + 1;\n}\n\nfunction buildChunk(\n  text: string,\n  startLine: number,\n  endLine: number,\n  heading: string | undefined,\n): MemoryChunk {\n  return {\n    startLine,\n    endLine,\n    text,\n    hash: createHash(\"sha256\").update(text).digest(\"hex\"),\n    ...(heading !== undefined ? { heading } : {}),\n  };\n}\n\nfunction pushOversizedSlices(\n  chunks: MemoryChunk[],\n  text: string,\n  startLine: number,\n  heading: string | undefined,\n  maxChars: number,\n): void {\n  let remaining = text;\n  let lineCursor = startLine;\n  while (remaining.length > maxChars) {\n    const splitAt = findWordBoundarySplit(remaining, maxChars);\n    const slice = remaining.slice(0, splitAt);\n    const sliceLines = slice.split(\"\\n\").length;\n    chunks.push(buildChunk(slice, lineCursor, lineCursor + sliceLines - 1, heading));\n    remaining = remaining.slice(splitAt).replace(/^\\s+/, \"\");\n    lineCursor += sliceLines - 1;\n  }\n  if (remaining.length > 0) {\n    const sliceLines = remaining.split(\"\\n\").length;\n    chunks.push(buildChunk(remaining, lineCursor, lineCursor + sliceLines - 1, heading));\n  }\n}\n\n/**\n * Find a split point ≤ maxChars that lands on a whitespace boundary so we\n * don't slice a word in half. Falls back to maxChars if no whitespace is\n * within range (very rare — a single token > maxChars).\n */\nfunction findWordBoundarySplit(text: string, maxChars: number): number {\n  if (text.length <= maxChars) return text.length;\n  // Walk backward from maxChars looking for whitespace.\n  for (let i = maxChars; i > Math.max(0, maxChars - 200); i--) {\n    if (/\\s/.test(text[i] ?? \"x\")) return i;\n  }\n  // No whitespace within 200 chars of the cap — accept a hard split.\n  return maxChars;\n}\n","/**\n * The corpus walk: read every markdown file under the memory root, and re-chunk the ones that\n * changed.\n *\n * One of the four concerns that shared `IndexManager`, and the one with the most distinct reason to\n * change — \"which files are in the corpus and when is one stale\" is a question about the filesystem,\n * not about search or about the schema. It takes a {@link MemoryIndexRepository} rather than a\n * database, so it cannot reach past it into SQL.\n *\n * The staleness test is the content hash, NOT the mtime. mtime is written into `files` for\n * observability; a file touched without being edited must not cost a re-chunk, and a file restored\n * from a backup with an older mtime must not be skipped.\n *\n * @internal\n */\n\nimport { readFile, stat } from \"node:fs/promises\";\nimport { collectMarkdownFiles, sha256 } from \"./index-manager-helpers.js\";\nimport type { MemoryIndexRepository } from \"./index-repository.js\";\nimport { chunkMarkdown } from \"./storage/chunk-markdown.js\";\nimport type { MemoryRoot } from \"./storage/memory-root.js\";\n\nexport interface CorpusSyncCounts {\n  readonly filesScanned: number;\n  readonly filesUpdated: number;\n  readonly chunksWritten: number;\n}\n\nexport async function syncCorpus(\n  repo: MemoryIndexRepository,\n  memoryRoot: MemoryRoot,\n): Promise<CorpusSyncCounts> {\n  const files = await collectMarkdownFiles(memoryRoot);\n  const existingByPath = repo.filesByPath();\n  let filesUpdated = 0;\n  let chunksWritten = 0;\n\n  for (const entry of files) {\n    const raw = await readFile(entry.absolutePath, \"utf8\");\n    const hash = sha256(raw);\n    if (existingByPath.get(entry.absolutePath)?.hash === hash) continue;\n\n    const stats = await stat(entry.absolutePath);\n    const fileId = repo.upsertFile({\n      absPath: entry.absolutePath,\n      relPath: entry.relPath,\n      hash,\n      mtimeMs: stats.mtimeMs,\n      source: entry.source,\n    });\n    repo.deleteChunksForFile(fileId);\n    const chunks = chunkMarkdown(raw);\n    for (const chunk of chunks) repo.insertChunk({ fileId, ...chunk });\n\n    filesUpdated += 1;\n    chunksWritten += chunks.length;\n  }\n\n  return { filesScanned: files.length, filesUpdated, chunksWritten };\n}\n","/**\n * Escapes a user query for a SQL `LIKE ... ESCAPE '\\'` clause.\n *\n * The order of the three replacements is the whole correctness argument, so it is its own\n * function rather than a chain inline at the call site.\n *\n * The previous version escaped `%` and `_` but not the escape character itself, which is the\n * defect CodeQL reports as `js/incomplete-sanitization` (alerts #14, #15). Two things went wrong,\n * and the second is the one that matters:\n *\n *   \"back\\slash\"  ->  \"%back\\slash%\"    the `\\s` is an escape of `s`, which LIKE does not define\n *   \"x\\%y\"        ->  \"%x\\\\%y%\"         the inserted `\\` is consumed escaping the user's `\\`,\n *                                       leaving `%` UNESCAPED — a wildcard the caller did not\n *                                       write, matching anything between `x\\` and `y`\n *\n * The second is wildcard injection: a search for a literal string silently becomes a scan. In a\n * memory index that is both a wrong answer and a way to pull back rows the query never asked for.\n *\n * Escaping the backslash FIRST is what fixes it — afterwards every `\\` in the string is one this\n * function put there, so the later replacements cannot collide with a user-supplied one.\n */\nexport function escapeLikePattern(query: string): string {\n  return `%${query.replace(/\\\\/g, \"\\\\\\\\\").replace(/%/g, \"\\\\%\").replace(/_/g, \"\\\\_\")}%`;\n}\n","/**\n * Common `MemoryIndex` interface shared between the SQLite-backed\n * `IndexManager` (default) and the Lance-backed adapter (ADR D43, shipped\n * v1.4.0 via lancedb-backend-ship-v1-1 plan).\n *\n * Consumers (`local-agent-memory.ts`, `active-memory.ts`, `tools.ts`,\n * `runActiveMemory`) only ever call `sync()`, `search()`, `status()`,\n * `close()` — the union of those four methods is the portable surface.\n *\n * Why a separate file (vs declaring inline in `index-manager.ts`)? D43\n * promised \"extract an abstract `MemoryIndex` interface in\n * `internal/memory/index-interface.ts`\". Keeping the contract physically\n * separated from one of its implementations preserves OCP — future\n * backends (Qdrant, PGVector) can land without touching IndexManager.\n *\n * @internal\n */\n\nimport type { IndexStatus, MemorySearchHit, SearchOptions } from \"./index-manager-contract.js\";\n\n// Re-export consumer-facing shapes for stable internal import paths.\nexport type { IndexStatus, MemorySearchHit, SearchOptions };\n\nexport interface SyncResult {\n  filesScanned: number;\n  filesUpdated: number;\n  chunksWritten: number;\n  chunksEmbedded: number;\n  /**\n   * Whether this backend actually walked a corpus.\n   *\n   * REQUIRED, not optional, and that is the point. `MemoryIndex` has two implementers and consumers\n   * hold the interface: `IndexManager` walks files, and `LanceMemoryAdapter` has no corpus to walk —\n   * it is a vector store fed by explicit `addFacts`. The adapter used to answer with a frozen\n   * all-zeros result, which a caller cannot tell apart from a real sync that found nothing to do.\n   * The comment above it stated that as the intention (\"so callers' existing logging does not\n   * break\"), which is the substitution defect written down as a feature.\n   *\n   * A required boolean forces every implementer to say which case it is in, and forces the compiler\n   * to notice a new implementer that forgot. An optional flag would have let the next backend\n   * reproduce the silence.\n   */\n  supported: boolean;\n}\n\n/**\n * Common search-options parser used by both `IndexManager.search` and\n * `LanceMemoryAdapter.search`. Returns the normalized cap + minimum-score\n * floor — eliminates jscpd duplication while keeping per-backend search\n * logic distinct.\n */\nexport function parseSearchOptions(options: SearchOptions = {}): {\n  maxResults: number;\n  minScore: number;\n} {\n  return {\n    maxResults: Math.max(1, options.maxResults ?? 10),\n    minScore: options.minScore ?? 0,\n  };\n}\n\nexport interface MemoryIndex {\n  /**\n   * Walk the memory corpus + reindex changed files. Lance backend has no\n   * markdown corpus to walk — its adapter returns zero counts (no-op) and\n   * relies on explicit `addFact` calls instead.\n   */\n  sync(): Promise<SyncResult>;\n\n  /**\n   * Semantic + textual search over the indexed corpus. Both backends\n   * return the same `MemorySearchHit[]` shape; Lance leaves `textScore`\n   * undefined (vector-only — no FTS5 layer).\n   */\n  search(query: string, options?: SearchOptions): Promise<MemorySearchHit[]>;\n\n  /** Snapshot of the index health (backend type + counts). */\n  status(): IndexStatus;\n\n  /** Release native handles. Idempotent. */\n  close(): Promise<void> | void;\n}\n","/**\n * `LanceMemoryAdapter` — wraps `LanceIndex` to expose the common\n * `MemoryIndex` interface (sync/search/status/close) so consumers of\n * `IndexManager.open({ backend: \"lance\" })` get a drop-in replacement\n * for the SQLite-backed `IndexManager`.\n *\n * Semantic deltas vs SQLite (documented so callers know what to expect):\n *\n *  - `sync()` is a NO-OP. Lance is a pure vector store — there is no\n *    markdown corpus to crawl. It returns zero counts with `supported: false`\n *    so the result is not mistaken for a sync that found nothing. Consumers\n *    writing facts hold a `LanceIndex` and call `addFacts` on it; the adapter\n *    does not hand its adaptee out.\n *  - `search()` is HYBRID, not vector-only. Lance supplies the vector distance\n *    and `translateLanceHit` adds a client-side term-overlap ratio (T4.5), so\n *    `textScore` is a real number in 0..1 and `score` is `0.7 * vectorScore +\n *    0.3 * textScore` — never `=== vectorScore`. This block said the opposite\n *    for as long as T4.5 has been shipped, while the docblock 90 lines below\n *    described the change correctly, so the two halves of one file disagreed\n *    and the header is the half a caller reads.\n *  - `status()` reports `backend: \"hybrid\"` only when an embedding runtime\n *    is wired (always the case for Lance — embedding is required at open).\n *    Both counts are 0 with `countsExact: false`: the port declares `status()`\n *    synchronous and Lance's row count is async, so nothing can be measured\n *    here. The zeros are placeholders and the flag says which.\n *\n * Ships with the lancedb-backend-ship-v1-1 plan (close D12, supersede via\n * D43). v1.4.0 of `@theokit/sdk`.\n *\n * @internal\n */\n\nimport type { IndexStatus, MemorySearchHit, SearchOptions } from \"./index-manager-contract.js\";\nimport { type HybridWeights, resolveWeights } from \"./index-manager-helpers.js\";\nimport type { LanceIndex } from \"./lance-index.js\";\nimport { type MemoryIndex, parseSearchOptions, type SyncResult } from \"./memory-index.js\";\n\n/**\n * Default namespace used when consumers call `search()` without specifying\n * one. The SQLite `IndexManager` does not surface namespace in its public\n * `search()` signature either — both backends therefore behave consistently\n * under the \"single-workspace, single-namespace\" assumption that v1.4 ships.\n *\n * v1.5 candidate: surface `namespace` in `SearchOptions` (additive — no\n * breaking change) so multi-tenant Lance consumers can scope queries.\n */\nconst DEFAULT_NAMESPACE = \"default\";\n\n/**\n * Lance has no corpus to walk, and the result now SAYS so.\n *\n * The counts stay zero — inventing numbers would trade one false claim for another. What changed is\n * `supported: false`: an all-zeros result was previously indistinguishable from a real sync that\n * found nothing to reindex, and the comment above this constant used to present that as the goal\n * (\"so callers' existing logging does not break\"). A caller can now tell \"nothing to do\" from\n * \"this backend does not do this\".\n */\nconst UNSUPPORTED_SYNC_RESULT: SyncResult = Object.freeze({\n  filesScanned: 0,\n  filesUpdated: 0,\n  chunksWritten: 0,\n  chunksEmbedded: 0,\n  supported: false,\n});\n\nexport class LanceMemoryAdapter implements MemoryIndex {\n  constructor(private readonly inner: LanceIndex) {}\n\n  /**\n   * Not applicable to Lance — see file header. Returns zero counts with `supported: false` so a\n   * caller can distinguish this from a real sync that found nothing.\n   */\n  async sync(): Promise<SyncResult> {\n    return UNSUPPORTED_SYNC_RESULT;\n  }\n\n  // jscpd:ignore-start — search signature + early-out is idiomatic\n  // overlap with IndexManager.search; further factoring would hurt\n  // readability (the bodies diverge sharply right after).\n  async search(query: string, options: SearchOptions = {}): Promise<MemorySearchHit[]> {\n    if (query.trim().length === 0) return [];\n    const { maxResults, minScore } = parseSearchOptions(options);\n    // jscpd:ignore-end\n    const lanceHits = await this.inner.search(query, {\n      namespace: DEFAULT_NAMESPACE,\n      limit: maxResults * 2,\n      ...(options.sources !== undefined ? { sources: options.sources } : {}),\n    });\n    return lanceHits\n      .filter((h) => h.score >= minScore)\n      .slice(0, maxResults)\n      .map((h) => translateLanceHit(h, query, resolveWeights(options)));\n  }\n\n  status(): IndexStatus {\n    // The Lance API is async and `status()` is not, so no count can be taken here. The zeros are\n    // placeholders and `countsExact: false` says so — previously they were indistinguishable from a\n    // measured empty index, so a caller testing `chunksIndexed > 0` got a false negative on every\n    // run regardless of how many rows the table held.\n    //\n    // There is deliberately no escape hatch. This class used to carry `unwrap(): LanceIndex`,\n    // documented as being for \"the migration tool, benchmark script\" — measured 2026-09-01, it had\n    // ZERO callers anywhere in the monorepo, including those two, which hold a `LanceIndex`\n    // directly and never open the adapter. What it did have was this comment pointing at it, which\n    // made the leak read as the supported way to work around the limitation. A caller that needs\n    // the real count needs `LanceIndex`, and the honest way to get one is to open one.\n    return {\n      backend: \"hybrid\",\n      filesIndexed: 0,\n      chunksIndexed: 0,\n      countsExact: false,\n    };\n  }\n\n  async close(): Promise<void> {\n    await this.inner.close();\n  }\n}\n\n/**\n * Translate `LanceSearchHit` to `MemorySearchHit`. Field mapping:\n *\n *   - `id` → `path` (Lance has no file-system provenance; use opaque id)\n *   - `text` → `snippet` (truncated to 200 chars matching IndexManager convention)\n *   - `score` → combined (0.7 × vectorScore + 0.3 × textScore)\n *   - `vectorScore` → from Lance's distance metric\n *   - `textScore` → T4.5 client-side term-overlap ratio (removes ADR D43 vector-only caveat)\n *   - `source` → `source`\n *   - synthetic `startLine: 0, endLine: 0` (Lance has no line info)\n *   - synthetic `citation: id` (no path:line citation available)\n */\nfunction translateLanceHit(\n  hit: { id: string; text: string; source: \"memory\" | \"sessions\" | \"wiki\"; score: number },\n  query: string | undefined,\n  weights: HybridWeights,\n): MemorySearchHit {\n  const textScore = query !== undefined ? computeTermOverlapScore(query, hit.text) : 0;\n  const vectorScore = hit.score;\n  // The CALLER's weights, through the same `resolveWeights` the SQLite path uses. These were the\n  // literals 0.7 and 0.3, so a caller that tuned `vectorWeight` / `textWeight` had its tuning applied\n  // on one backend and silently dropped on the other — the shape of failure that makes a swap-in\n  // backend untrustworthy. The defaults differ between the two (0.6/0.4 from resolveWeights, versus\n  // the 0.7/0.3 written here), so unweighted results move slightly; that is the point, since one of\n  // the two numbers was not the contract's.\n  const combined =\n    (vectorScore * weights.vectorWeight + textScore * weights.textWeight) / weights.total;\n  return {\n    path: hit.id,\n    startLine: 0,\n    endLine: 0,\n    score: combined,\n    textScore,\n    vectorScore,\n    snippet: hit.text.slice(0, 200),\n    source: hit.source,\n    citation: hit.id,\n  };\n}\n\n/**\n * T4.5 — Client-side term-overlap score for Lance hybrid search.\n * Counts what fraction of query terms appear in the text (case-insensitive).\n * Simple but effective for re-ranking vector hits by lexical relevance.\n * Returns 0..1 where 1 = all query terms present.\n */\nfunction computeTermOverlapScore(query: string, text: string): number {\n  const queryTerms = query\n    .toLowerCase()\n    .split(/\\s+/)\n    .filter((t) => t.length > 1);\n  if (queryTerms.length === 0) return 0;\n  const textLower = text.toLowerCase();\n  const matched = queryTerms.filter((term) => textLower.includes(term)).length;\n  return matched / queryTerms.length;\n}\n","/**\n * Dispatch helpers for `IndexManager.open`. Extracted to keep\n * `index-manager.ts` under the G8 400-LoC budget (lancedb-backend-ship-v1-1).\n *\n * @internal\n */\n\nimport { ConfigurationError } from \"../../errors.js\";\nimport type { MemoryBackend, OpenIndexOptions } from \"./index-manager-contract.js\";\nimport { LanceIndex } from \"./lance-index.js\";\nimport { LanceMemoryAdapter } from \"./lance-memory-adapter.js\";\nimport type { MemoryIndex } from \"./memory-index.js\";\n\n/** Valid backend identifiers — runtime guard against TS-narrowing escapes (EC-1). */\nexport const VALID_BACKENDS: readonly MemoryBackend[] = [\"sqlite-vec\", \"lance\"];\n\n/**\n * EC-1: runtime guard for `opts.backend`. TS union is compile-time only;\n * consumers passing JS `as any` typos must hit a typed error, not silent\n * SQLite fallback.\n */\nexport function assertValidBackend(backend: string): asserts backend is MemoryBackend {\n  if (!VALID_BACKENDS.includes(backend as MemoryBackend)) {\n    throw new ConfigurationError(\n      `Invalid memory backend \"${backend}\". Valid values: ${VALID_BACKENDS.join(\", \")}.`,\n      { code: \"invalid_memory_backend\" },\n    );\n  }\n}\n\n/**\n * Lance-path open. Throws `lance_requires_embedding` when no embedding\n * runtime is provided (Lance is vector-only — no FTS fallback).\n * Surfaces `lance_backend_unavailable` from LanceIndex.open when peer\n * dep is absent.\n */\nexport async function openLanceIndex(opts: OpenIndexOptions): Promise<MemoryIndex> {\n  if (opts.embedding === undefined) {\n    throw new ConfigurationError(\n      \"Lance backend requires an embedding runtime. Pass `embedding: { provider, model, apiKey }` in Memory.create options (or omit `backend` to use SQLite default).\",\n      { code: \"lance_requires_embedding\" },\n    );\n  }\n  const lance = await LanceIndex.open({\n    cwd: opts.cwd,\n    embedding: opts.embedding,\n    ...(opts.filePath !== undefined ? { storagePath: opts.filePath } : {}),\n  });\n  return new LanceMemoryAdapter(lance);\n}\n","/**\n * Every SQL string the memory index runs, in one place.\n *\n * `IndexManager` answered four questions with four independent reasons to change: the corpus walk,\n * the BM25-to-score normalisation, the vector-cache strategy, and the schema. This is the fourth.\n * Changing a column, an index or a join is now a change to THIS file, and the caller above it reads\n * as search logic rather than as SQL with scoring in between.\n *\n * The row-to-`MemorySearchHit` mapping deliberately stays with the caller: turning a row into a hit\n * involves a score, a snippet and a citation, none of which the schema knows about. Keeping it here\n * would move the normalisation into the repository and re-create the same mixture one layer down.\n *\n * Rows come back as `Record<string, unknown>` for the same reason: the repository knows what it\n * SELECTed, not what the caller will make of it.\n *\n * @internal\n */\n\nimport type { MemoryDb } from \"./index-db.js\";\n\n/** What `files` holds for one path — the pair the corpus walk compares against disk. */\nexport interface FileRow {\n  readonly id: number;\n  readonly hash: string;\n}\n\nexport class MemoryIndexRepository {\n  constructor(private readonly db: MemoryDb) {}\n\n  counts(): { files: number; chunks: number } {\n    const files = this.db.prepare(\"SELECT COUNT(*) as n FROM files\").get() ?? { n: 0 };\n    const chunks = this.db.prepare(\"SELECT COUNT(*) as n FROM chunks\").get() ?? { n: 0 };\n    return { files: Number(files.n ?? 0), chunks: Number(chunks.n ?? 0) };\n  }\n\n  /**\n   * FTS5 match, ordered by bm25. THROWS on an FTS5 error rather than swallowing it — whether that\n   * error means \"CJK input the default tokenizer cannot segment\" or \"the table is missing\" is a\n   * judgement the caller makes, and it makes it differently for each.\n   */\n  ftsRows(sanitizedQuery: string, limit: number): Array<Record<string, unknown>> {\n    return this.db\n      .prepare(\n        `SELECT chunks.id as id, files.rel_path as rel_path, files.source as source,\n                chunks.start_line as start_line, chunks.end_line as end_line,\n                chunks.text as text, bm25(chunks_fts) as bm25_score\n         FROM chunks_fts\n         JOIN chunks ON chunks_fts.rowid = chunks.id\n         JOIN files  ON chunks.file_id = files.id\n         WHERE chunks_fts MATCH ?\n         ORDER BY bm25_score\n         LIMIT ?`,\n      )\n      .all(sanitizedQuery, limit);\n  }\n\n  /** Substring scan — the CJK fallback. No relevance score exists here; the caller supplies one. */\n  likeRows(escapedPattern: string, limit: number): Array<Record<string, unknown>> {\n    return this.db\n      .prepare(\n        `SELECT chunks.id as id, files.rel_path as rel_path, files.source as source,\n                chunks.start_line as start_line, chunks.end_line as end_line,\n                chunks.text as text\n         FROM chunks\n         JOIN files ON chunks.file_id = files.id\n         WHERE chunks.text LIKE ? ESCAPE '\\\\'\n         LIMIT ?`,\n      )\n      .all(escapedPattern, limit) as Array<Record<string, unknown>>;\n  }\n\n  /** Hydrate the chunks a vector search returned by id. Empty in, empty out — no query runs. */\n  chunkRowsByIds(ids: ReadonlyArray<number>): Array<Record<string, unknown>> {\n    if (ids.length === 0) return [];\n    const placeholders = ids.map(() => \"?\").join(\",\");\n    return this.db\n      .prepare(\n        `SELECT chunks.id as id, files.rel_path as rel_path, files.source as source,\n                chunks.start_line as start_line, chunks.end_line as end_line,\n                chunks.text as text\n         FROM chunks JOIN files ON chunks.file_id = files.id\n         WHERE chunks.id IN (${placeholders})`,\n      )\n      .all(...ids);\n  }\n\n  /** Absolute path → its row, for the corpus walk to compare hashes against disk. */\n  filesByPath(): Map<string, FileRow> {\n    const rows = this.db.prepare(\"SELECT id, path, hash FROM files\").all() as Array<{\n      id: number;\n      path: string;\n      hash: string;\n    }>;\n    return new Map(rows.map((row) => [row.path, { id: row.id, hash: row.hash }]));\n  }\n\n  upsertFile(file: {\n    absPath: string;\n    relPath: string;\n    hash: string;\n    mtimeMs: number;\n    source: \"memory\" | \"wiki\" | \"sessions\";\n  }): number {\n    const row = this.db\n      .prepare(\n        `INSERT INTO files (path, rel_path, mtime, hash, source) VALUES (?, ?, ?, ?, ?)\n         ON CONFLICT(path) DO UPDATE SET hash = excluded.hash, mtime = excluded.mtime, source = excluded.source\n         RETURNING id`,\n      )\n      .get(file.absPath, file.relPath, Math.floor(file.mtimeMs), file.hash, file.source) as {\n      id: number;\n    };\n    return row.id;\n  }\n\n  deleteChunksForFile(fileId: number): void {\n    this.db.prepare(\"DELETE FROM chunks WHERE file_id = ?\").run(fileId);\n  }\n\n  insertChunk(chunk: {\n    fileId: number;\n    startLine: number;\n    endLine: number;\n    text: string;\n    hash: string;\n  }): void {\n    this.db\n      .prepare(\n        \"INSERT INTO chunks (file_id, start_line, end_line, text, hash) VALUES (?, ?, ?, ?, ?)\",\n      )\n      .run(chunk.fileId, chunk.startLine, chunk.endLine, chunk.text, chunk.hash);\n  }\n\n  close(): void {\n    this.db.close();\n  }\n}\n","import { ConfigurationError } from \"../../errors.js\";\nimport type { MemoryDb } from \"./index-db.js\";\n\n/**\n * Load the `sqlite-vec` extension into an opened SQLite connection.\n *\n * Wraps the native `load(db)` call from the `sqlite-vec` npm package with a\n * typed error path (EC-8 of the edge-case review) so callers see a\n * `sqlite_vec_unavailable` ConfigurationError instead of a raw native error.\n *\n * @internal\n */\nexport async function loadSqliteVecExtension(db: MemoryDb): Promise<void> {\n  try {\n    const mod = await import(\"sqlite-vec\");\n    const loadFn = (mod as { load?: (db: unknown) => void }).load;\n    if (typeof loadFn !== \"function\") {\n      throw new Error(\"sqlite-vec module exposes no `load` export\");\n    }\n    loadFn(db);\n  } catch (cause) {\n    const message = cause instanceof Error ? cause.message : String(cause);\n    throw new ConfigurationError(\n      `sqlite-vec extension unavailable. Install \\`sqlite-vec\\` and ensure the native binary matches your Node + OS. Cause: ${message}`,\n      { code: \"sqlite_vec_unavailable\", cause },\n    );\n  }\n}\n","import type { EmbeddingRuntime } from \"./embedding-adapter.js\";\nimport type { MemoryDb } from \"./index-db.js\";\n\n/**\n * Vector index helpers (ADR D2 + D4 of memory-system-peer-project-parity).\n *\n * Embeddings live in `embeddings(chunk_id, vec)` — a `vec0` virtual table\n * provided by the sqlite-vec extension. Embedding identity (providerId +\n * model + dimension) lives in the `meta` table; mismatches force a full\n * re-embed sweep (EC-1).\n *\n * @internal\n */\n\nexport const META_KEY_PROVIDER_ID = \"embedding.providerId\";\nexport const META_KEY_MODEL = \"embedding.model\";\nexport const META_KEY_DIMENSION = \"embedding.dimension\";\n\nexport interface EmbeddingIdentity {\n  providerId: string;\n  model: string;\n  dimension: number;\n}\n\nexport function readEmbeddingIdentity(db: MemoryDb): EmbeddingIdentity | undefined {\n  const get = (key: string): string | undefined => {\n    const row = db.prepare(\"SELECT value FROM meta WHERE key = ?\").get(key);\n    return row !== undefined ? String(row.value) : undefined;\n  };\n  const providerId = get(META_KEY_PROVIDER_ID);\n  const model = get(META_KEY_MODEL);\n  const dimRaw = get(META_KEY_DIMENSION);\n  if (providerId === undefined || model === undefined || dimRaw === undefined) return undefined;\n  const dimension = Number(dimRaw);\n  if (!Number.isFinite(dimension) || dimension <= 0) return undefined;\n  return { providerId, model, dimension };\n}\n\nexport function writeEmbeddingIdentity(db: MemoryDb, identity: EmbeddingIdentity): void {\n  const stmt = db.prepare(\n    \"INSERT INTO meta (key, value) VALUES (?, ?) ON CONFLICT(key) DO UPDATE SET value = excluded.value\",\n  );\n  stmt.run(META_KEY_PROVIDER_ID, identity.providerId);\n  stmt.run(META_KEY_MODEL, identity.model);\n  stmt.run(META_KEY_DIMENSION, String(identity.dimension));\n}\n\nexport function identityMatches(a: EmbeddingIdentity, b: EmbeddingIdentity): boolean {\n  return a.providerId === b.providerId && a.model === b.model && a.dimension === b.dimension;\n}\n\nexport function dropVectorIndex(db: MemoryDb): void {\n  db.exec(\"DROP TABLE IF EXISTS embeddings\");\n}\n\nexport function createVectorIndex(db: MemoryDb, dimension: number): void {\n  db.exec(`CREATE VIRTUAL TABLE IF NOT EXISTS embeddings USING vec0(\n    chunk_id INTEGER PRIMARY KEY,\n    vec FLOAT[${dimension}]\n  )`);\n}\n\n/** Pack a Float32Array into a Buffer suitable for sqlite-vec BLOB binding. */\nexport function packVector(vec: ReadonlyArray<number>): Buffer {\n  const f32 = new Float32Array(vec.length);\n  for (let i = 0; i < vec.length; i++) f32[i] = vec[i] ?? 0;\n  return Buffer.from(f32.buffer);\n}\n\nexport function upsertEmbedding(db: MemoryDb, chunkId: number, vec: ReadonlyArray<number>): void {\n  // sqlite-vec vec0 virtual tables don't support UPSERT — emulate via\n  // DELETE-then-INSERT. vec0 REJECTS JS Number for chunk_id columns; it\n  // requires BigInt binding. Verified via repro against vec0 v0.1.9.\n  const id = BigInt(chunkId);\n  db.prepare(\"DELETE FROM embeddings WHERE chunk_id = ?\").run(id);\n  db.prepare(\"INSERT INTO embeddings (chunk_id, vec) VALUES (?, ?)\").run(id, packVector(vec));\n}\n\nexport interface VectorHitRow {\n  chunk_id: number;\n  distance: number;\n}\n\nexport function vectorSearch(\n  db: MemoryDb,\n  query: ReadonlyArray<number>,\n  k: number,\n): VectorHitRow[] {\n  // sqlite-vec returns distance (lower = closer). Use KNN syntax. k needs\n  // a BigInt-typed binding too.\n  const rows = db\n    .prepare(\n      `SELECT chunk_id, distance FROM embeddings\n       WHERE vec MATCH ? AND k = ?\n       ORDER BY distance`,\n    )\n    .all(packVector(query), BigInt(k));\n  return rows.map((row) => ({ chunk_id: Number(row.chunk_id), distance: Number(row.distance) }));\n}\n\nexport interface EmbedAllArgs {\n  db: MemoryDb;\n  runtime: EmbeddingRuntime;\n}\n\n/** Embed every chunk that doesn't yet have a vector. */\nexport async function embedMissingChunks(args: EmbedAllArgs): Promise<number> {\n  const rows = args.db\n    .prepare(\n      `SELECT chunks.id as id, chunks.text as text\n       FROM chunks\n       LEFT JOIN embeddings ON embeddings.chunk_id = chunks.id\n       WHERE embeddings.chunk_id IS NULL`,\n    )\n    .all();\n  if (rows.length === 0) return 0;\n  const normalized = rows.map((row) => ({ id: Number(row.id), text: String(row.text ?? \"\") }));\n  const vectors = await args.runtime.embed(normalized.map((r) => r.text));\n  for (let i = 0; i < normalized.length; i++) {\n    const row = normalized[i];\n    const vector = vectors[i];\n    if (row === undefined || vector === undefined) continue;\n    upsertEmbedding(args.db, row.id, vector);\n  }\n  return normalized.length;\n}\n","import { createHash } from \"node:crypto\";\nimport { diag } from \"../diagnostics.js\";\nimport { containsCjk, sanitizeFts5Query } from \"../persistence/fts5-sanitize.js\";\nimport { syncCorpus } from \"./corpus-sync.js\";\nimport type { EmbeddingRuntime } from \"./embedding-adapter.js\";\nimport { LruEmbeddingCache } from \"./embedding-cache.js\";\nimport { escapeLikePattern } from \"./escape-like-pattern.js\";\nimport { defaultIndexPath, type MemoryDb, openMemoryDb } from \"./index-db.js\";\nimport { assertValidBackend, openLanceIndex } from \"./index-manager-dispatch.js\";\nimport { blendScores, resolveWeights, truncateSnippet } from \"./index-manager-helpers.js\";\nimport { MemoryIndexRepository } from \"./index-repository.js\";\nimport type { SyncResult } from \"./memory-index.js\";\nimport { type MemoryIndex, parseSearchOptions } from \"./memory-index.js\";\nimport { loadSqliteVecExtension } from \"./sqlite-vec-loader.js\";\nimport { type MemoryRoot, projectMemoryDir, resolveMemoryRoot } from \"./storage/memory-root.js\";\n\n// T4.1 — query-vector LRU cache (DR4 finding #1). Keyed by\n// sha256(query); caches the embedding vector so repeated search\n// queries skip the HTTP round-trip (p99 1.5-3s → ~0ms on hit).\n// Process-wide singleton with bounded capacity (default 2000 queries).\nconst queryVectorCache = new LruEmbeddingCache(2000);\n\nimport {\n  createVectorIndex,\n  dropVectorIndex,\n  embedMissingChunks,\n  identityMatches,\n  readEmbeddingIdentity,\n  vectorSearch,\n  writeEmbeddingIdentity,\n} from \"./vec-index.js\";\n\n/**\n * Memory index manager (ADR D2). FTS5-only at Phase 3; vector index lands in\n * Phase 5.\n *\n * Lifecycle:\n *   const idx = await IndexManager.open({ cwd });\n *   await idx.sync();\n *   const hits = await idx.search(\"query\");\n *   idx.close();\n *\n * @internal\n */\n\n// T2.1 / ADR D433 — these types now live in `index-manager-contract.ts`\n// to break the 3-cycle memory cluster. Re-exported here for back-compat\n// with downstream importers that historically pulled from this file.\nexport type {\n  IndexStatus,\n  MemoryBackend,\n  MemorySearchHit,\n  OpenIndexOptions,\n  SearchOptions,\n} from \"./index-manager-contract.js\";\n\nimport type {\n  IndexStatus,\n  MemorySearchHit,\n  OpenIndexOptions,\n  SearchOptions,\n} from \"./index-manager-contract.js\";\n\nexport class IndexManager implements MemoryIndex {\n  private lastSyncMs: number | undefined;\n  private vectorReady = false;\n\n  /** Every SQL string this class used to hold. See `index-repository.ts` for why it moved. */\n  private readonly repo: MemoryIndexRepository;\n\n  private constructor(\n    private readonly memoryRoot: MemoryRoot,\n    private readonly db: MemoryDb,\n    private readonly embedding: EmbeddingRuntime | undefined,\n  ) {\n    this.repo = new MemoryIndexRepository(db);\n  }\n\n  /**\n   * Open a memory index. Dispatches to SQLite (default) or Lance (opt-in\n   * via `backend: \"lance\"`). See `openLanceInternal` for Lance-specific\n   * preconditions + typed errors.\n   */\n  static async open(opts: OpenIndexOptions & { backend: \"lance\" }): Promise<MemoryIndex>;\n  static async open(\n    opts: Omit<OpenIndexOptions, \"backend\"> | (OpenIndexOptions & { backend?: \"sqlite-vec\" }),\n  ): Promise<IndexManager>;\n  static async open(opts: OpenIndexOptions): Promise<MemoryIndex> {\n    const backend = opts.backend ?? \"sqlite-vec\";\n    assertValidBackend(backend);\n    if (backend === \"lance\") return await openLanceIndex(opts);\n    return await IndexManager.openSqliteInternal(opts);\n  }\n\n  /** Internal SQLite-path open. Renamed from previous public `open`. */\n  private static async openSqliteInternal(opts: OpenIndexOptions): Promise<IndexManager> {\n    const memoryRoot = opts.memoryRoot ?? resolveMemoryRoot(opts.cwd);\n    // What gets INDEXED and where the DATABASE lives are two decisions, and they diverge on\n    // purpose. The corpus is the configured root; the database stays in the project store, because\n    // `memory.directory` may name the directory the Claude Code CLI manages and that CLI has no\n    // index format (`docs/memory-decisions.md` § 1). Collapsing them writes a binary the partner\n    // does not understand into a directory it owns.\n    const filePath = opts.filePath ?? defaultIndexPath(projectMemoryDir(opts.cwd));\n    const db = await openMemoryDb({ filePath });\n    const manager = new IndexManager(memoryRoot, db, opts.embedding);\n    if (opts.embedding !== undefined) await manager.initVectorBackend(opts.embedding);\n    return manager;\n  }\n\n  private async initVectorBackend(runtime: EmbeddingRuntime): Promise<void> {\n    await loadSqliteVecExtension(this.db);\n    const currentIdentity = {\n      providerId: runtime.id,\n      model: runtime.model,\n      dimension: runtime.dimension,\n    };\n    const persisted = readEmbeddingIdentity(this.db);\n    if (persisted !== undefined && !identityMatches(persisted, currentIdentity)) {\n      // EC-1: dimension/model/provider changed — drop the vector index and\n      // force a full re-embed on next sync.\n      dropVectorIndex(this.db);\n    }\n    createVectorIndex(this.db, runtime.dimension);\n    writeEmbeddingIdentity(this.db, currentIdentity);\n    this.vectorReady = true;\n  }\n\n  /** Walk the memory corpus + (re)index changed files. */\n  // Declares `Promise<SyncResult>` rather than repeating the shape inline. The inline version was a\n  // structural copy of the interface it implements, so widening `SyncResult` with `supported` left\n  // this method silently no longer assignable to `MemoryIndex` — the compiler caught it, which is\n  // the argument for naming the type instead of restating it.\n  async sync(): Promise<SyncResult> {\n    const counts = await syncCorpus(this.repo, this.memoryRoot);\n    let chunksEmbedded = 0;\n    if (this.vectorReady && this.embedding !== undefined) {\n      chunksEmbedded = await embedMissingChunks({ db: this.db, runtime: this.embedding });\n    }\n    this.lastSyncMs = Date.now();\n    // `supported: true` — this implementer genuinely walks the corpus, so its counts are a\n    // measurement rather than a placeholder. See SyncResult.supported.\n    return { ...counts, chunksEmbedded, supported: true };\n  }\n\n  async search(query: string, options: SearchOptions = {}): Promise<MemorySearchHit[]> {\n    if (query.trim().length === 0) return [];\n    const { maxResults, minScore } = parseSearchOptions(options);\n    const textHits = this.ftsSearch(query, maxResults * 2);\n    const vectorHitsById = await this.vectorSearchById(query, maxResults * 2);\n    const combined = this.combineHybridScores(textHits, vectorHitsById, options);\n    return combined\n      .filter((h) => h.score >= minScore)\n      .filter((h) => options.sources === undefined || options.sources.includes(h.source))\n      .slice(0, maxResults);\n  }\n\n  status(): IndexStatus {\n    const { files, chunks } = this.repo.counts();\n    const status: IndexStatus = {\n      backend: this.vectorReady ? \"hybrid\" : \"fts-only\",\n      filesIndexed: files,\n      chunksIndexed: chunks,\n      // Counted with SELECT COUNT(*) just above — these are measurements, not placeholders.\n      countsExact: true,\n    };\n    if (this.lastSyncMs !== undefined) status.lastSyncMs = this.lastSyncMs;\n    return status;\n  }\n\n  // ───── search internals ──────────────────────────────────────────────\n\n  private ftsSearch(query: string, limit: number): Array<MemorySearchHit & { chunkId: number }> {\n    // EC-3: short-circuit when sanitizer reduces input to empty string.\n    // Calling `MATCH ''` would error inside FTS5 on some SQLite versions.\n    const sanitized = sanitizeFts5Query(query);\n    if (sanitized.length === 0) return [];\n    let rows: Array<Record<string, unknown>> = [];\n    try {\n      rows = this.repo.ftsRows(sanitized, limit);\n    } catch (err) {\n      // T4.8 — CJK fallback: FTS5's default tokenizer chokes on CJK characters (no word boundaries).\n      // Instead of returning empty, fall back to a LIKE search, which handles CJK correctly (slower\n      // but correct). ADR D64 documents the trigram-routing deferral.\n      //\n      // GATED on the condition it was written for, and reported otherwise. The catch used to be\n      // unconditional, so a corrupt database, a missing `chunks_fts` table (which happens when FTS5\n      // is unavailable at open) and a disk error all became a LIKE scan over the whole table\n      // returning plausible hits at a hardcoded 0.5 — degraded relevance with no signal that\n      // anything had failed. The fallback still runs, because returning nothing would be worse; what\n      // changes is that the operator learns the query is not being answered by the index.\n      if (!containsCjk(query)) {\n        diag(\n          `memory FTS query failed for a non-CJK query and fell back to a LIKE scan — relevance is ` +\n            `degraded and the index may be missing or corrupt: ${\n              err instanceof Error ? err.message : String(err)\n            }`,\n        );\n      }\n      return this.likeSearchFallback(query, limit);\n    }\n    return rows.map((row) => {\n      const bm25 = Number(row.bm25_score ?? 0);\n      const textScore = bm25 < 0 ? 1 / (1 + Math.abs(bm25)) : 1 / (1 + bm25);\n      const startLine = Number(row.start_line ?? 0);\n      const endLine = Number(row.end_line ?? 0);\n      const path = String(row.rel_path);\n      return {\n        path,\n        startLine,\n        endLine,\n        score: textScore,\n        textScore,\n        snippet: truncateSnippet(String(row.text ?? \"\")),\n        source: String(row.source) as \"memory\" | \"sessions\" | \"wiki\",\n        citation: `${path}:${startLine}-${endLine}`,\n        // sneak the chunk id through for the hybrid join below\n        // (cast away later)\n        chunkId: Number(row.id),\n      } as MemorySearchHit & { chunkId: number };\n    });\n  }\n\n  /**\n   * T4.8 — LIKE-based fallback for CJK and other scripts that FTS5's\n   * default tokenizer cannot segment. Slower than FTS5 (full table scan)\n   * but correct for any Unicode input. Returns the same shape as\n   * `ftsSearch` so callers are unaware of the fallback.\n   */\n  private likeSearchFallback(\n    query: string,\n    limit: number,\n  ): Array<MemorySearchHit & { chunkId: number }> {\n    const rows = this.repo.likeRows(escapeLikePattern(query), limit);\n    return rows.map((row) => {\n      const path = String(row.rel_path ?? \"\");\n      const startLine = Number(row.start_line ?? 0);\n      const endLine = Number(row.end_line ?? 0);\n      return {\n        path,\n        startLine,\n        endLine,\n        score: 0.5, // LIKE has no relevance score — use a neutral midpoint\n        textScore: 0.5,\n        snippet: truncateSnippet(String(row.text ?? \"\")),\n        source: String(row.source) as \"memory\" | \"sessions\" | \"wiki\",\n        citation: `${path}:${startLine}-${endLine}`,\n        chunkId: Number(row.id),\n      } as MemorySearchHit & { chunkId: number };\n    });\n  }\n\n  private async vectorSearchById(\n    query: string,\n    limit: number,\n  ): Promise<Map<number, { vectorScore: number; snippet?: string }>> {\n    if (!this.vectorReady || this.embedding === undefined) return new Map();\n    // T4.1 — query-vector LRU cache. The embed call is the p99 hottest\n    // path (1.5-3s per hit). Cache by sha256(query) so repeated queries\n    // skip the HTTP round-trip entirely. The embedding cache (T4.4\n    // globalEmbeddingCache) catches text-level dedup; this catches the\n    // query-level search-result dedup on top.\n    const cacheKey = createHash(\"sha256\").update(query).digest(\"hex\");\n    const cached = queryVectorCache.get(cacheKey);\n    const queryVec = cached ?? (await this.embedding.embed([query]))[0];\n    if (queryVec === undefined) return new Map();\n    if (cached === undefined) queryVectorCache.set(cacheKey, queryVec);\n    const rows = vectorSearch(this.db, queryVec, limit);\n    // sqlite-vec distance: lower = closer. Normalize to 0..1 with higher = better.\n    const out = new Map<number, { vectorScore: number }>();\n    for (const row of rows) {\n      const score = 1 / (1 + Math.max(0, row.distance));\n      out.set(row.chunk_id, { vectorScore: score });\n    }\n    return out;\n  }\n\n  private combineHybridScores(\n    textHits: Array<MemorySearchHit & { chunkId: number }>,\n    vectorHitsById: Map<number, { vectorScore: number }>,\n    options: SearchOptions,\n  ): MemorySearchHit[] {\n    const weights = resolveWeights(options);\n    const merged = this.mergeHits(textHits, vectorHitsById);\n    const combined = [...merged.values()].map((hit) =>\n      blendScores(hit, vectorHitsById.get(hit.chunkId)?.vectorScore ?? 0, weights),\n    );\n    return combined.sort((a, b) => b.score - a.score);\n  }\n\n  private mergeHits(\n    textHits: Array<MemorySearchHit & { chunkId: number }>,\n    vectorHitsById: Map<number, { vectorScore: number }>,\n  ): Map<number, MemorySearchHit & { chunkId: number }> {\n    const merged = new Map<number, MemorySearchHit & { chunkId: number }>();\n    for (const hit of textHits) merged.set(hit.chunkId, hit);\n    const missingIds = [...vectorHitsById.keys()].filter((id) => !merged.has(id));\n    if (missingIds.length > 0) {\n      for (const hit of this.fetchChunksByIds(missingIds)) {\n        merged.set(hit.chunkId, { ...hit, score: 0, textScore: 0 });\n      }\n    }\n    return merged;\n  }\n\n  private fetchChunksByIds(\n    ids: ReadonlyArray<number>,\n  ): Array<MemorySearchHit & { chunkId: number }> {\n    const rows = this.repo.chunkRowsByIds(ids);\n    return rows.map((row) => {\n      const startLine = Number(row.start_line ?? 0);\n      const endLine = Number(row.end_line ?? 0);\n      const path = String(row.rel_path);\n      return {\n        chunkId: Number(row.id),\n        path,\n        startLine,\n        endLine,\n        score: 0,\n        textScore: 0,\n        snippet: truncateSnippet(String(row.text ?? \"\")),\n        source: String(row.source) as \"memory\" | \"sessions\" | \"wiki\",\n        citation: `${path}:${startLine}-${endLine}`,\n      };\n    });\n  }\n\n  close(): void {\n    this.repo.close();\n  }\n}\n\n// Replaced by `sanitizeFts5Query` from `internal/persistence/fts5-sanitize.ts`\n// (T5.2, ADR D64). The new sanitizer is the 6-step port of Hermes'\n// `_sanitize_fts5_query` and handles hyphens/dots/underscores correctly\n// without quoting every token.\n"]}
+{"version":3,"sources":["../src/internal/memory/storage/chunk-markdown.ts","../src/internal/memory/corpus-sync.ts","../src/internal/memory/escape-like-pattern.ts","../src/internal/memory/memory-index.ts","../src/internal/memory/lance-memory-adapter.ts","../src/internal/memory/index-manager-dispatch.ts","../src/internal/memory/index-repository.ts","../src/internal/memory/sqlite-vec-loader.ts","../src/internal/memory/vec-index.ts","../src/internal/memory/index-manager.ts"],"names":["createHash"],"mappings":";;;;;;;;AA6BA,IAAM,UAAA,GAAa,uBAAA;AASZ,SAAS,aAAA,CAAc,IAAA,EAAc,OAAA,GAAgC,EAAC,EAAkB;AAC7F,EAAA,MAAM,QAAA,GAAW,QAAQ,QAAA,IAAY,GAAA;AACrC,EAAA,IAAI,IAAA,CAAK,MAAA,KAAW,CAAA,EAAG,OAAO,EAAC;AAC/B,EAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,KAAA,CAAM,IAAI,CAAA;AAC7B,EAAA,MAAM,GAAA,GAAwB,EAAE,MAAA,EAAQ,EAAC,EAAG,KAAA,EAAO,EAAC,EAAG,KAAA,EAAO,CAAA,EAAG,OAAA,EAAS,MAAA,EAAU;AACpF,EAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,KAAA,CAAM,QAAQ,CAAA,EAAA,EAAK;AACrC,IAAA,MAAM,IAAA,GAAO,KAAA,CAAM,CAAC,CAAA,IAAK,EAAA;AACzB,IAAA,MAAM,aAAa,CAAA,GAAI,CAAA;AACvB,IAAA,WAAA,CAAY,GAAA,EAAK,IAAA,EAAM,UAAA,EAAY,QAAQ,CAAA;AAAA,EAC7C;AACA,EAAA,gBAAA,CAAiB,GAAA,EAAK,KAAA,CAAM,MAAA,EAAQ,QAAQ,CAAA;AAC5C,EAAA,OAAO,GAAA,CAAI,MAAA;AACb;AAEA,SAAS,WAAA,CACP,GAAA,EACA,IAAA,EACA,UAAA,EACA,QAAA,EACM;AACN,EAAA,MAAM,YAAA,GAAe,UAAA,CAAW,IAAA,CAAK,IAAI,CAAA;AACzC,EAAA,MAAM,OAAA,GAAU,IAAA,CAAK,IAAA,EAAK,CAAE,MAAA,KAAW,CAAA;AACvC,EAAA,IAAI,YAAA,KAAiB,IAAA,IAAQ,GAAA,CAAI,KAAA,CAAM,SAAS,CAAA,EAAG;AACjD,IAAA,gBAAA,CAAiB,GAAA,EAAK,UAAA,GAAa,CAAA,EAAG,QAAQ,CAAA;AAAA,EAChD;AACA,EAAA,IAAI,YAAA,KAAiB,IAAA,EAAM,GAAA,CAAI,OAAA,GAAU,aAAa,CAAC,CAAA;AACvD,EAAA,GAAA,CAAI,KAAA,CAAM,KAAK,IAAI,CAAA;AACnB,EAAA,IAAI,OAAA,IAAW,GAAA,CAAI,KAAA,CAAM,MAAA,GAAS,CAAA,EAAG;AACnC,IAAA,MAAM,MAAA,GAAS,GAAA,CAAI,KAAA,CAAM,IAAA,CAAK,IAAI,CAAA;AAClC,IAAA,IAAI,MAAA,CAAO,MAAK,CAAE,MAAA,GAAS,GAAG,gBAAA,CAAiB,GAAA,EAAK,YAAY,QAAQ,CAAA;AAAA,EAC1E;AACF;AAEA,SAAS,gBAAA,CAAiB,GAAA,EAAuB,gBAAA,EAA0B,QAAA,EAAwB;AACjG,EAAA,IAAI,GAAA,CAAI,KAAA,CAAM,MAAA,KAAW,CAAA,EAAG;AAC5B,EAAA,MAAM,SAAA,GAAY,GAAA,CAAI,KAAA,CAAM,IAAA,CAAK,IAAI,CAAA;AACrC,EAAA,IAAI,SAAA,CAAU,IAAA,EAAK,CAAE,MAAA,KAAW,CAAA,EAAG;AACjC,IAAA,GAAA,CAAI,QAAQ,EAAC;AACb,IAAA,GAAA,CAAI,QAAQ,gBAAA,GAAmB,CAAA;AAC/B,IAAA;AAAA,EACF;AACA,EAAA,IAAI,SAAA,CAAU,SAAS,QAAA,EAAU;AAC/B,IAAA,mBAAA,CAAoB,IAAI,MAAA,EAAQ,SAAA,EAAW,IAAI,KAAA,EAAO,GAAA,CAAI,SAAS,QAAQ,CAAA;AAAA,EAC7E,CAAA,MAAO;AACL,IAAA,GAAA,CAAI,MAAA,CAAO,KAAK,UAAA,CAAW,SAAA,EAAW,IAAI,KAAA,EAAO,gBAAA,EAAkB,GAAA,CAAI,OAAO,CAAC,CAAA;AAAA,EACjF;AACA,EAAA,GAAA,CAAI,QAAQ,EAAC;AACb,EAAA,GAAA,CAAI,QAAQ,gBAAA,GAAmB,CAAA;AACjC;AAEA,SAAS,UAAA,CACP,IAAA,EACA,SAAA,EACA,OAAA,EACA,OAAA,EACa;AACb,EAAA,OAAO;AAAA,IACL,SAAA;AAAA,IACA,OAAA;AAAA,IACA,IAAA;AAAA,IACA,IAAA,EAAM,WAAW,QAAQ,CAAA,CAAE,OAAO,IAAI,CAAA,CAAE,OAAO,KAAK,CAAA;AAAA,IACpD,GAAI,OAAA,KAAY,MAAA,GAAY,EAAE,OAAA,KAAY;AAAC,GAC7C;AACF;AAEA,SAAS,mBAAA,CACP,MAAA,EACA,IAAA,EACA,SAAA,EACA,SACA,QAAA,EACM;AACN,EAAA,IAAI,SAAA,GAAY,IAAA;AAChB,EAAA,IAAI,UAAA,GAAa,SAAA;AACjB,EAAA,OAAO,SAAA,CAAU,SAAS,QAAA,EAAU;AAClC,IAAA,MAAM,OAAA,GAAU,qBAAA,CAAsB,SAAA,EAAW,QAAQ,CAAA;AACzD,IAAA,MAAM,KAAA,GAAQ,SAAA,CAAU,KAAA,CAAM,CAAA,EAAG,OAAO,CAAA;AACxC,IAAA,MAAM,UAAA,GAAa,KAAA,CAAM,KAAA,CAAM,IAAI,CAAA,CAAE,MAAA;AACrC,IAAA,MAAA,CAAO,IAAA,CAAK,WAAW,KAAA,EAAO,UAAA,EAAY,aAAa,UAAA,GAAa,CAAA,EAAG,OAAO,CAAC,CAAA;AAC/E,IAAA,SAAA,GAAY,UAAU,KAAA,CAAM,OAAO,CAAA,CAAE,OAAA,CAAQ,QAAQ,EAAE,CAAA;AACvD,IAAA,UAAA,IAAc,UAAA,GAAa,CAAA;AAAA,EAC7B;AACA,EAAA,IAAI,SAAA,CAAU,SAAS,CAAA,EAAG;AACxB,IAAA,MAAM,UAAA,GAAa,SAAA,CAAU,KAAA,CAAM,IAAI,CAAA,CAAE,MAAA;AACzC,IAAA,MAAA,CAAO,IAAA,CAAK,WAAW,SAAA,EAAW,UAAA,EAAY,aAAa,UAAA,GAAa,CAAA,EAAG,OAAO,CAAC,CAAA;AAAA,EACrF;AACF;AAOA,SAAS,qBAAA,CAAsB,MAAc,QAAA,EAA0B;AACrE,EAAA,IAAI,IAAA,CAAK,MAAA,IAAU,QAAA,EAAU,OAAO,IAAA,CAAK,MAAA;AAEzC,EAAA,KAAA,IAAS,CAAA,GAAI,UAAU,CAAA,GAAI,IAAA,CAAK,IAAI,CAAA,EAAG,QAAA,GAAW,GAAG,CAAA,EAAG,CAAA,EAAA,EAAK;AAC3D,IAAA,IAAI,KAAK,IAAA,CAAK,IAAA,CAAK,CAAC,CAAA,IAAK,GAAG,GAAG,OAAO,CAAA;AAAA,EACxC;AAEA,EAAA,OAAO,QAAA;AACT;;;AC/GA,eAAsB,UAAA,CACpB,MACA,UAAA,EAC2B;AAC3B,EAAA,MAAM,KAAA,GAAQ,MAAM,oBAAA,CAAqB,UAAU,CAAA;AACnD,EAAA,MAAM,cAAA,GAAiB,KAAK,WAAA,EAAY;AACxC,EAAA,IAAI,YAAA,GAAe,CAAA;AACnB,EAAA,IAAI,aAAA,GAAgB,CAAA;AAEpB,EAAA,KAAA,MAAW,SAAS,KAAA,EAAO;AACzB,IAAA,MAAM,GAAA,GAAM,MAAM,QAAA,CAAS,KAAA,CAAM,cAAc,MAAM,CAAA;AACrD,IAAA,MAAM,IAAA,GAAO,OAAO,GAAG,CAAA;AACvB,IAAA,IAAI,eAAe,GAAA,CAAI,KAAA,CAAM,YAAY,CAAA,EAAG,SAAS,IAAA,EAAM;AAE3D,IAAA,MAAM,KAAA,GAAQ,MAAM,IAAA,CAAK,KAAA,CAAM,YAAY,CAAA;AAC3C,IAAA,MAAM,MAAA,GAAS,KAAK,UAAA,CAAW;AAAA,MAC7B,SAAS,KAAA,CAAM,YAAA;AAAA,MACf,SAAS,KAAA,CAAM,OAAA;AAAA,MACf,IAAA;AAAA,MACA,SAAS,KAAA,CAAM,OAAA;AAAA,MACf,QAAQ,KAAA,CAAM;AAAA,KACf,CAAA;AACD,IAAA,IAAA,CAAK,oBAAoB,MAAM,CAAA;AAC/B,IAAA,MAAM,MAAA,GAAS,cAAc,GAAG,CAAA;AAChC,IAAA,KAAA,MAAW,KAAA,IAAS,QAAQ,IAAA,CAAK,WAAA,CAAY,EAAE,MAAA,EAAQ,GAAG,OAAO,CAAA;AAEjE,IAAA,YAAA,IAAgB,CAAA;AAChB,IAAA,aAAA,IAAiB,MAAA,CAAO,MAAA;AAAA,EAC1B;AAEA,EAAA,OAAO,EAAE,YAAA,EAAc,KAAA,CAAM,MAAA,EAAQ,cAAc,aAAA,EAAc;AACnE;;;ACtCO,SAAS,kBAAkB,KAAA,EAAuB;AACvD,EAAA,OAAO,CAAA,CAAA,EAAI,KAAA,CAAM,OAAA,CAAQ,KAAA,EAAO,MAAM,CAAA,CAAE,OAAA,CAAQ,IAAA,EAAM,KAAK,CAAA,CAAE,OAAA,CAAQ,IAAA,EAAM,KAAK,CAAC,CAAA,CAAA,CAAA;AACnF;;;AC4BO,SAAS,kBAAA,CAAmB,OAAA,GAAyB,EAAC,EAG3D;AACA,EAAA,OAAO;AAAA,IACL,YAAY,IAAA,CAAK,GAAA,CAAI,CAAA,EAAG,OAAA,CAAQ,cAAc,EAAE,CAAA;AAAA,IAChD,QAAA,EAAU,QAAQ,QAAA,IAAY;AAAA,GAChC;AACF;;;ACbA,IAAM,iBAAA,GAAoB,SAAA;AAW1B,IAAM,uBAAA,GAAsC,OAAO,MAAA,CAAO;AAAA,EACxD,YAAA,EAAc,CAAA;AAAA,EACd,YAAA,EAAc,CAAA;AAAA,EACd,aAAA,EAAe,CAAA;AAAA,EACf,cAAA,EAAgB,CAAA;AAAA,EAChB,SAAA,EAAW;AACb,CAAC,CAAA;AAEM,IAAM,qBAAN,MAAgD;AAAA,EACrD,YAA6B,KAAA,EAAmB;AAAnB,IAAA,IAAA,CAAA,KAAA,GAAA,KAAA;AAAA,EAAoB;AAAA,EAApB,KAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAM7B,MAAM,IAAA,GAA4B;AAChC,IAAA,OAAO,uBAAA;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKA,MAAM,MAAA,CAAO,KAAA,EAAe,OAAA,GAAyB,EAAC,EAA+B;AACnF,IAAA,IAAI,MAAM,IAAA,EAAK,CAAE,MAAA,KAAW,CAAA,SAAU,EAAC;AACvC,IAAA,MAAM,EAAE,UAAA,EAAY,QAAA,EAAS,GAAI,mBAAmB,OAAO,CAAA;AAE3D,IAAA,MAAM,SAAA,GAAY,MAAM,IAAA,CAAK,KAAA,CAAM,OAAO,KAAA,EAAO;AAAA,MAC/C,SAAA,EAAW,iBAAA;AAAA,MACX,OAAO,UAAA,GAAa,CAAA;AAAA,MACpB,GAAI,QAAQ,OAAA,KAAY,MAAA,GAAY,EAAE,OAAA,EAAS,OAAA,CAAQ,OAAA,EAAQ,GAAI;AAAC,KACrE,CAAA;AACD,IAAA,OAAO,SAAA,CACJ,OAAO,CAAC,CAAA,KAAM,EAAE,KAAA,IAAS,QAAQ,EACjC,KAAA,CAAM,CAAA,EAAG,UAAU,CAAA,CACnB,GAAA,CAAI,CAAC,CAAA,KAAM,iBAAA,CAAkB,GAAG,KAAA,EAAO,cAAA,CAAe,OAAO,CAAC,CAAC,CAAA;AAAA,EACpE;AAAA,EAEA,MAAA,GAAsB;AAYpB,IAAA,OAAO;AAAA,MACL,OAAA,EAAS,QAAA;AAAA,MACT,YAAA,EAAc,CAAA;AAAA,MACd,aAAA,EAAe,CAAA;AAAA,MACf,WAAA,EAAa;AAAA,KACf;AAAA,EACF;AAAA,EAEA,MAAM,KAAA,GAAuB;AAC3B,IAAA,MAAM,IAAA,CAAK,MAAM,KAAA,EAAM;AAAA,EACzB;AACF,CAAA;AAcA,SAAS,iBAAA,CACP,GAAA,EACA,KAAA,EACA,OAAA,EACiB;AACjB,EAAA,MAAM,YAAY,KAAA,KAAU,MAAA,GAAY,wBAAwB,KAAA,EAAO,GAAA,CAAI,IAAI,CAAA,GAAI,CAAA;AACnF,EAAA,MAAM,cAAc,GAAA,CAAI,KAAA;AAOxB,EAAA,MAAM,YACH,WAAA,GAAc,OAAA,CAAQ,eAAe,SAAA,GAAY,OAAA,CAAQ,cAAc,OAAA,CAAQ,KAAA;AAClF,EAAA,OAAO;AAAA,IACL,MAAM,GAAA,CAAI,EAAA;AAAA,IACV,SAAA,EAAW,CAAA;AAAA,IACX,OAAA,EAAS,CAAA;AAAA,IACT,KAAA,EAAO,QAAA;AAAA,IACP,SAAA;AAAA,IACA,WAAA;AAAA,IACA,OAAA,EAAS,GAAA,CAAI,IAAA,CAAK,KAAA,CAAM,GAAG,GAAG,CAAA;AAAA,IAC9B,QAAQ,GAAA,CAAI,MAAA;AAAA,IACZ,UAAU,GAAA,CAAI;AAAA,GAChB;AACF;AAQA,SAAS,uBAAA,CAAwB,OAAe,IAAA,EAAsB;AACpE,EAAA,MAAM,UAAA,GAAa,KAAA,CAChB,WAAA,EAAY,CACZ,KAAA,CAAM,KAAK,CAAA,CACX,MAAA,CAAO,CAAC,CAAA,KAAM,CAAA,CAAE,MAAA,GAAS,CAAC,CAAA;AAC7B,EAAA,IAAI,UAAA,CAAW,MAAA,KAAW,CAAA,EAAG,OAAO,CAAA;AACpC,EAAA,MAAM,SAAA,GAAY,KAAK,WAAA,EAAY;AACnC,EAAA,MAAM,OAAA,GAAU,WAAW,MAAA,CAAO,CAAC,SAAS,SAAA,CAAU,QAAA,CAAS,IAAI,CAAC,CAAA,CAAE,MAAA;AACtE,EAAA,OAAO,UAAU,UAAA,CAAW,MAAA;AAC9B;;;AChKO,IAAM,cAAA,GAA2C,CAAC,YAAA,EAAc,OAAO,CAAA;AAOvE,SAAS,mBAAmB,OAAA,EAAmD;AACpF,EAAA,IAAI,CAAC,cAAA,CAAe,QAAA,CAAS,OAAwB,CAAA,EAAG;AACtD,IAAA,MAAM,IAAI,kBAAA;AAAA,MACR,2BAA2B,OAAO,CAAA,iBAAA,EAAoB,cAAA,CAAe,IAAA,CAAK,IAAI,CAAC,CAAA,CAAA,CAAA;AAAA,MAC/E,EAAE,MAAM,wBAAA;AAAyB,KACnC;AAAA,EACF;AACF;AAQA,eAAsB,eAAe,IAAA,EAA8C;AACjF,EAAA,IAAI,IAAA,CAAK,cAAc,MAAA,EAAW;AAChC,IAAA,MAAM,IAAI,kBAAA;AAAA,MACR,gKAAA;AAAA,MACA,EAAE,MAAM,0BAAA;AAA2B,KACrC;AAAA,EACF;AACA,EAAA,MAAM,KAAA,GAAQ,MAAM,UAAA,CAAW,IAAA,CAAK;AAAA,IAClC,KAAK,IAAA,CAAK,GAAA;AAAA,IACV,WAAW,IAAA,CAAK,SAAA;AAAA,IAChB,GAAI,KAAK,QAAA,KAAa,MAAA,GAAY,EAAE,WAAA,EAAa,IAAA,CAAK,QAAA,EAAS,GAAI;AAAC,GACrE,CAAA;AACD,EAAA,OAAO,IAAI,mBAAmB,KAAK,CAAA;AACrC;;;ACvBO,IAAM,wBAAN,MAA4B;AAAA,EACjC,YAA6B,EAAA,EAAc;AAAd,IAAA,IAAA,CAAA,EAAA,GAAA,EAAA;AAAA,EAAe;AAAA,EAAf,EAAA;AAAA,EAE7B,MAAA,GAA4C;AAC1C,IAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,EAAA,CAAG,OAAA,CAAQ,iCAAiC,EAAE,GAAA,EAAI,IAAK,EAAE,CAAA,EAAG,CAAA,EAAE;AACjF,IAAA,MAAM,MAAA,GAAS,IAAA,CAAK,EAAA,CAAG,OAAA,CAAQ,kCAAkC,EAAE,GAAA,EAAI,IAAK,EAAE,CAAA,EAAG,CAAA,EAAE;AACnF,IAAA,OAAO,EAAE,KAAA,EAAO,MAAA,CAAO,KAAA,CAAM,CAAA,IAAK,CAAC,CAAA,EAAG,MAAA,EAAQ,MAAA,CAAO,MAAA,CAAO,CAAA,IAAK,CAAC,CAAA,EAAE;AAAA,EACtE;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,OAAA,CAAQ,gBAAwB,KAAA,EAA+C;AAC7E,IAAA,OAAO,KAAK,EAAA,CACT,OAAA;AAAA,MACC,CAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,gBAAA;AAAA,KASF,CACC,GAAA,CAAI,cAAA,EAAgB,KAAK,CAAA;AAAA,EAC9B;AAAA;AAAA,EAGA,QAAA,CAAS,gBAAwB,KAAA,EAA+C;AAC9E,IAAA,OAAO,KAAK,EAAA,CACT,OAAA;AAAA,MACC,CAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,gBAAA;AAAA,KAOF,CACC,GAAA,CAAI,cAAA,EAAgB,KAAK,CAAA;AAAA,EAC9B;AAAA;AAAA,EAGA,eAAe,GAAA,EAA4D;AACzE,IAAA,IAAI,GAAA,CAAI,MAAA,KAAW,CAAA,EAAG,OAAO,EAAC;AAC9B,IAAA,MAAM,eAAe,GAAA,CAAI,GAAA,CAAI,MAAM,GAAG,CAAA,CAAE,KAAK,GAAG,CAAA;AAChD,IAAA,OAAO,KAAK,EAAA,CACT,OAAA;AAAA,MACC,CAAA;AAAA;AAAA;AAAA;AAAA,6BAAA,EAIuB,YAAY,CAAA,CAAA;AAAA,KACrC,CACC,GAAA,CAAI,GAAG,GAAG,CAAA;AAAA,EACf;AAAA;AAAA,EAGA,WAAA,GAAoC;AAClC,IAAA,MAAM,OAAO,IAAA,CAAK,EAAA,CAAG,OAAA,CAAQ,kCAAkC,EAAE,GAAA,EAAI;AAKrE,IAAA,OAAO,IAAI,GAAA,CAAI,IAAA,CAAK,IAAI,CAAC,GAAA,KAAQ,CAAC,GAAA,CAAI,IAAA,EAAM,EAAE,EAAA,EAAI,IAAI,EAAA,EAAI,IAAA,EAAM,IAAI,IAAA,EAAM,CAAC,CAAC,CAAA;AAAA,EAC9E;AAAA,EAEA,WAAW,IAAA,EAMA;AACT,IAAA,MAAM,GAAA,GAAM,KAAK,EAAA,CACd,OAAA;AAAA,MACC,CAAA;AAAA;AAAA,qBAAA;AAAA,KAGF,CACC,GAAA,CAAI,IAAA,CAAK,OAAA,EAAS,KAAK,OAAA,EAAS,IAAA,CAAK,KAAA,CAAM,IAAA,CAAK,OAAO,CAAA,EAAG,IAAA,CAAK,IAAA,EAAM,KAAK,MAAM,CAAA;AAGnF,IAAA,OAAO,GAAA,CAAI,EAAA;AAAA,EACb;AAAA,EAEA,oBAAoB,MAAA,EAAsB;AACxC,IAAA,IAAA,CAAK,EAAA,CAAG,OAAA,CAAQ,sCAAsC,CAAA,CAAE,IAAI,MAAM,CAAA;AAAA,EACpE;AAAA,EAEA,YAAY,KAAA,EAMH;AACP,IAAA,IAAA,CAAK,EAAA,CACF,OAAA;AAAA,MACC;AAAA,KACF,CACC,GAAA,CAAI,KAAA,CAAM,MAAA,EAAQ,KAAA,CAAM,SAAA,EAAW,KAAA,CAAM,OAAA,EAAS,KAAA,CAAM,IAAA,EAAM,KAAA,CAAM,IAAI,CAAA;AAAA,EAC7E;AAAA,EAEA,KAAA,GAAc;AACZ,IAAA,IAAA,CAAK,GAAG,KAAA,EAAM;AAAA,EAChB;AACF,CAAA;;;AC5HA,eAAsB,uBAAuB,EAAA,EAA6B;AACxE,EAAA,IAAI;AACF,IAAA,MAAM,GAAA,GAAM,MAAM,OAAO,YAAY,CAAA;AACrC,IAAA,MAAM,SAAU,GAAA,CAAyC,IAAA;AACzD,IAAA,IAAI,OAAO,WAAW,UAAA,EAAY;AAChC,MAAA,MAAM,IAAI,MAAM,4CAA4C,CAAA;AAAA,IAC9D;AACA,IAAA,MAAA,CAAO,EAAE,CAAA;AAAA,EACX,SAAS,KAAA,EAAO;AACd,IAAA,MAAM,UAAU,KAAA,YAAiB,KAAA,GAAQ,KAAA,CAAM,OAAA,GAAU,OAAO,KAAK,CAAA;AACrE,IAAA,MAAM,IAAI,kBAAA;AAAA,MACR,wHAAwH,OAAO,CAAA,CAAA;AAAA,MAC/H,EAAE,IAAA,EAAM,wBAAA,EAA0B,KAAA;AAAM,KAC1C;AAAA,EACF;AACF;;;ACbO,IAAM,oBAAA,GAAuB,sBAAA;AAC7B,IAAM,cAAA,GAAiB,iBAAA;AACvB,IAAM,kBAAA,GAAqB,qBAAA;AAQ3B,SAAS,sBAAsB,EAAA,EAA6C;AACjF,EAAA,MAAM,GAAA,GAAM,CAAC,GAAA,KAAoC;AAC/C,IAAA,MAAM,MAAM,EAAA,CAAG,OAAA,CAAQ,sCAAsC,CAAA,CAAE,IAAI,GAAG,CAAA;AACtE,IAAA,OAAO,GAAA,KAAQ,MAAA,GAAY,MAAA,CAAO,GAAA,CAAI,KAAK,CAAA,GAAI,MAAA;AAAA,EACjD,CAAA;AACA,EAAA,MAAM,UAAA,GAAa,IAAI,oBAAoB,CAAA;AAC3C,EAAA,MAAM,KAAA,GAAQ,IAAI,cAAc,CAAA;AAChC,EAAA,MAAM,MAAA,GAAS,IAAI,kBAAkB,CAAA;AACrC,EAAA,IAAI,eAAe,MAAA,IAAa,KAAA,KAAU,MAAA,IAAa,MAAA,KAAW,QAAW,OAAO,MAAA;AACpF,EAAA,MAAM,SAAA,GAAY,OAAO,MAAM,CAAA;AAC/B,EAAA,IAAI,CAAC,MAAA,CAAO,QAAA,CAAS,SAAS,CAAA,IAAK,SAAA,IAAa,GAAG,OAAO,MAAA;AAC1D,EAAA,OAAO,EAAE,UAAA,EAAY,KAAA,EAAO,SAAA,EAAU;AACxC;AAEO,SAAS,sBAAA,CAAuB,IAAc,QAAA,EAAmC;AACtF,EAAA,MAAM,OAAO,EAAA,CAAG,OAAA;AAAA,IACd;AAAA,GACF;AACA,EAAA,IAAA,CAAK,GAAA,CAAI,oBAAA,EAAsB,QAAA,CAAS,UAAU,CAAA;AAClD,EAAA,IAAA,CAAK,GAAA,CAAI,cAAA,EAAgB,QAAA,CAAS,KAAK,CAAA;AACvC,EAAA,IAAA,CAAK,GAAA,CAAI,kBAAA,EAAoB,MAAA,CAAO,QAAA,CAAS,SAAS,CAAC,CAAA;AACzD;AAEO,SAAS,eAAA,CAAgB,GAAsB,CAAA,EAA+B;AACnF,EAAA,OAAO,CAAA,CAAE,UAAA,KAAe,CAAA,CAAE,UAAA,IAAc,CAAA,CAAE,UAAU,CAAA,CAAE,KAAA,IAAS,CAAA,CAAE,SAAA,KAAc,CAAA,CAAE,SAAA;AACnF;AAEO,SAAS,gBAAgB,EAAA,EAAoB;AAClD,EAAA,EAAA,CAAG,KAAK,iCAAiC,CAAA;AAC3C;AAEO,SAAS,iBAAA,CAAkB,IAAc,SAAA,EAAyB;AACvE,EAAA,EAAA,CAAG,IAAA,CAAK,CAAA;AAAA;AAAA,cAAA,EAEM,SAAS,CAAA;AAAA,GAAA,CACrB,CAAA;AACJ;AAGO,SAAS,WAAW,GAAA,EAAoC;AAC7D,EAAA,MAAM,GAAA,GAAM,IAAI,YAAA,CAAa,GAAA,CAAI,MAAM,CAAA;AACvC,EAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,GAAA,CAAI,MAAA,EAAQ,CAAA,EAAA,EAAK,GAAA,CAAI,CAAC,CAAA,GAAI,GAAA,CAAI,CAAC,CAAA,IAAK,CAAA;AACxD,EAAA,OAAO,MAAA,CAAO,IAAA,CAAK,GAAA,CAAI,MAAM,CAAA;AAC/B;AAEO,SAAS,eAAA,CAAgB,EAAA,EAAc,OAAA,EAAiB,GAAA,EAAkC;AAI/F,EAAA,MAAM,EAAA,GAAK,OAAO,OAAO,CAAA;AACzB,EAAA,EAAA,CAAG,OAAA,CAAQ,2CAA2C,CAAA,CAAE,GAAA,CAAI,EAAE,CAAA;AAC9D,EAAA,EAAA,CAAG,QAAQ,sDAAsD,CAAA,CAAE,IAAI,EAAA,EAAI,UAAA,CAAW,GAAG,CAAC,CAAA;AAC5F;AAOO,SAAS,YAAA,CACd,EAAA,EACA,KAAA,EACA,CAAA,EACgB;AAGhB,EAAA,MAAM,OAAO,EAAA,CACV,OAAA;AAAA,IACC,CAAA;AAAA;AAAA,wBAAA;AAAA,IAID,GAAA,CAAI,UAAA,CAAW,KAAK,CAAA,EAAG,MAAA,CAAO,CAAC,CAAC,CAAA;AACnC,EAAA,OAAO,IAAA,CAAK,GAAA,CAAI,CAAC,GAAA,MAAS,EAAE,QAAA,EAAU,MAAA,CAAO,GAAA,CAAI,QAAQ,GAAG,QAAA,EAAU,MAAA,CAAO,GAAA,CAAI,QAAQ,GAAE,CAAE,CAAA;AAC/F;AAQA,eAAsB,mBAAmB,IAAA,EAAqC;AAC5E,EAAA,MAAM,IAAA,GAAO,KAAK,EAAA,CACf,OAAA;AAAA,IACC,CAAA;AAAA;AAAA;AAAA,wCAAA;AAAA,IAKD,GAAA,EAAI;AACP,EAAA,IAAI,IAAA,CAAK,MAAA,KAAW,CAAA,EAAG,OAAO,CAAA;AAC9B,EAAA,MAAM,aAAa,IAAA,CAAK,GAAA,CAAI,CAAC,GAAA,MAAS,EAAE,EAAA,EAAI,MAAA,CAAO,GAAA,CAAI,EAAE,GAAG,IAAA,EAAM,MAAA,CAAO,IAAI,IAAA,IAAQ,EAAE,GAAE,CAAE,CAAA;AAC3F,EAAA,MAAM,OAAA,GAAU,MAAM,IAAA,CAAK,OAAA,CAAQ,KAAA,CAAM,UAAA,CAAW,GAAA,CAAI,CAAC,CAAA,KAAM,CAAA,CAAE,IAAI,CAAC,CAAA;AACtE,EAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,UAAA,CAAW,QAAQ,CAAA,EAAA,EAAK;AAC1C,IAAA,MAAM,GAAA,GAAM,WAAW,CAAC,CAAA;AACxB,IAAA,MAAM,MAAA,GAAS,QAAQ,CAAC,CAAA;AACxB,IAAA,IAAI,GAAA,KAAQ,MAAA,IAAa,MAAA,KAAW,MAAA,EAAW;AAC/C,IAAA,eAAA,CAAgB,IAAA,CAAK,EAAA,EAAI,GAAA,CAAI,EAAA,EAAI,MAAM,CAAA;AAAA,EACzC;AACA,EAAA,OAAO,UAAA,CAAW,MAAA;AACpB;;;ACzGA,IAAM,gBAAA,GAAmB,IAAI,iBAAA,CAAkB,GAAI,CAAA;AA2C5C,IAAM,YAAA,GAAN,MAAM,aAAA,CAAoC;AAAA,EAOvC,WAAA,CACW,UAAA,EACA,EAAA,EACA,SAAA,EACjB;AAHiB,IAAA,IAAA,CAAA,UAAA,GAAA,UAAA;AACA,IAAA,IAAA,CAAA,EAAA,GAAA,EAAA;AACA,IAAA,IAAA,CAAA,SAAA,GAAA,SAAA;AAEjB,IAAA,IAAA,CAAK,IAAA,GAAO,IAAI,qBAAA,CAAsB,EAAE,CAAA;AAAA,EAC1C;AAAA,EALmB,UAAA;AAAA,EACA,EAAA;AAAA,EACA,SAAA;AAAA,EATX,UAAA;AAAA,EACA,WAAA,GAAc,KAAA;AAAA;AAAA,EAGL,IAAA;AAAA,EAmBjB,aAAa,KAAK,IAAA,EAA8C;AAC9D,IAAA,MAAM,OAAA,GAAU,KAAK,OAAA,IAAW,YAAA;AAChC,IAAA,kBAAA,CAAmB,OAAO,CAAA;AAC1B,IAAA,IAAI,OAAA,KAAY,OAAA,EAAS,OAAO,MAAM,eAAe,IAAI,CAAA;AACzD,IAAA,OAAO,MAAM,aAAA,CAAa,kBAAA,CAAmB,IAAI,CAAA;AAAA,EACnD;AAAA;AAAA,EAGA,aAAqB,mBAAmB,IAAA,EAA+C;AACrF,IAAA,MAAM,UAAA,GAAa,IAAA,CAAK,UAAA,IAAc,iBAAA,CAAkB,KAAK,GAAG,CAAA;AAMhE,IAAA,MAAM,WAAW,IAAA,CAAK,QAAA,IAAY,iBAAiB,gBAAA,CAAiB,IAAA,CAAK,GAAG,CAAC,CAAA;AAC7E,IAAA,MAAM,EAAA,GAAK,MAAM,YAAA,CAAa,EAAE,UAAU,CAAA;AAC1C,IAAA,MAAM,UAAU,IAAI,aAAA,CAAa,UAAA,EAAY,EAAA,EAAI,KAAK,SAAS,CAAA;AAC/D,IAAA,IAAI,KAAK,SAAA,KAAc,MAAA,QAAiB,OAAA,CAAQ,iBAAA,CAAkB,KAAK,SAAS,CAAA;AAChF,IAAA,OAAO,OAAA;AAAA,EACT;AAAA,EAEA,MAAc,kBAAkB,OAAA,EAA0C;AACxE,IAAA,MAAM,sBAAA,CAAuB,KAAK,EAAE,CAAA;AACpC,IAAA,MAAM,eAAA,GAAkB;AAAA,MACtB,YAAY,OAAA,CAAQ,EAAA;AAAA,MACpB,OAAO,OAAA,CAAQ,KAAA;AAAA,MACf,WAAW,OAAA,CAAQ;AAAA,KACrB;AACA,IAAA,MAAM,SAAA,GAAY,qBAAA,CAAsB,IAAA,CAAK,EAAE,CAAA;AAC/C,IAAA,IAAI,cAAc,MAAA,IAAa,CAAC,eAAA,CAAgB,SAAA,EAAW,eAAe,CAAA,EAAG;AAG3E,MAAA,eAAA,CAAgB,KAAK,EAAE,CAAA;AAAA,IACzB;AACA,IAAA,iBAAA,CAAkB,IAAA,CAAK,EAAA,EAAI,OAAA,CAAQ,SAAS,CAAA;AAC5C,IAAA,sBAAA,CAAuB,IAAA,CAAK,IAAI,eAAe,CAAA;AAC/C,IAAA,IAAA,CAAK,WAAA,GAAc,IAAA;AAAA,EACrB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,MAAM,IAAA,GAA4B;AAChC,IAAA,MAAM,SAAS,MAAM,UAAA,CAAW,IAAA,CAAK,IAAA,EAAM,KAAK,UAAU,CAAA;AAC1D,IAAA,IAAI,cAAA,GAAiB,CAAA;AACrB,IAAA,IAAI,IAAA,CAAK,WAAA,IAAe,IAAA,CAAK,SAAA,KAAc,MAAA,EAAW;AACpD,MAAA,cAAA,GAAiB,MAAM,mBAAmB,EAAE,EAAA,EAAI,KAAK,EAAA,EAAI,OAAA,EAAS,IAAA,CAAK,SAAA,EAAW,CAAA;AAAA,IACpF;AACA,IAAA,IAAA,CAAK,UAAA,GAAa,KAAK,GAAA,EAAI;AAG3B,IAAA,OAAO,EAAE,GAAG,MAAA,EAAQ,cAAA,EAAgB,WAAW,IAAA,EAAK;AAAA,EACtD;AAAA,EAEA,MAAM,MAAA,CAAO,KAAA,EAAe,OAAA,GAAyB,EAAC,EAA+B;AACnF,IAAA,IAAI,MAAM,IAAA,EAAK,CAAE,MAAA,KAAW,CAAA,SAAU,EAAC;AACvC,IAAA,MAAM,EAAE,UAAA,EAAY,QAAA,EAAS,GAAI,mBAAmB,OAAO,CAAA;AAC3D,IAAA,MAAM,QAAA,GAAW,IAAA,CAAK,SAAA,CAAU,KAAA,EAAO,aAAa,CAAC,CAAA;AACrD,IAAA,MAAM,iBAAiB,MAAM,IAAA,CAAK,gBAAA,CAAiB,KAAA,EAAO,aAAa,CAAC,CAAA;AACxE,IAAA,MAAM,QAAA,GAAW,IAAA,CAAK,mBAAA,CAAoB,QAAA,EAAU,gBAAgB,OAAO,CAAA;AAC3E,IAAA,OAAO,QAAA,CACJ,OAAO,CAAC,CAAA,KAAM,EAAE,KAAA,IAAS,QAAQ,CAAA,CACjC,MAAA,CAAO,CAAC,CAAA,KAAM,QAAQ,OAAA,KAAY,MAAA,IAAa,OAAA,CAAQ,OAAA,CAAQ,QAAA,CAAS,CAAA,CAAE,MAAM,CAAC,CAAA,CACjF,KAAA,CAAM,CAAA,EAAG,UAAU,CAAA;AAAA,EACxB;AAAA,EAEA,MAAA,GAAsB;AACpB,IAAA,MAAM,EAAE,KAAA,EAAO,MAAA,EAAO,GAAI,IAAA,CAAK,KAAK,MAAA,EAAO;AAC3C,IAAA,MAAM,MAAA,GAAsB;AAAA,MAC1B,OAAA,EAAS,IAAA,CAAK,WAAA,GAAc,QAAA,GAAW,UAAA;AAAA,MACvC,YAAA,EAAc,KAAA;AAAA,MACd,aAAA,EAAe,MAAA;AAAA;AAAA,MAEf,WAAA,EAAa;AAAA,KACf;AACA,IAAA,IAAI,IAAA,CAAK,UAAA,KAAe,MAAA,EAAW,MAAA,CAAO,aAAa,IAAA,CAAK,UAAA;AAC5D,IAAA,OAAO,MAAA;AAAA,EACT;AAAA;AAAA,EAIQ,SAAA,CAAU,OAAe,KAAA,EAA6D;AAG5F,IAAA,MAAM,SAAA,GAAY,kBAAkB,KAAK,CAAA;AACzC,IAAA,IAAI,SAAA,CAAU,MAAA,KAAW,CAAA,EAAG,OAAO,EAAC;AACpC,IAAA,IAAI,OAAuC,EAAC;AAC5C,IAAA,IAAI;AACF,MAAA,IAAA,GAAO,IAAA,CAAK,IAAA,CAAK,OAAA,CAAQ,SAAA,EAAW,KAAK,CAAA;AAAA,IAC3C,SAAS,GAAA,EAAK;AAWZ,MAAA,IAAI,CAAC,WAAA,CAAY,KAAK,CAAA,EAAG;AACvB,QAAA,IAAA;AAAA,UACE,kJAEI,GAAA,YAAe,KAAA,GAAQ,IAAI,OAAA,GAAU,MAAA,CAAO,GAAG,CACjD,CAAA;AAAA,SACJ;AAAA,MACF;AACA,MAAA,OAAO,IAAA,CAAK,kBAAA,CAAmB,KAAA,EAAO,KAAK,CAAA;AAAA,IAC7C;AACA,IAAA,OAAO,IAAA,CAAK,GAAA,CAAI,CAAC,GAAA,KAAQ;AACvB,MAAA,MAAM,IAAA,GAAO,MAAA,CAAO,GAAA,CAAI,UAAA,IAAc,CAAC,CAAA;AACvC,MAAA,MAAM,SAAA,GAAY,IAAA,GAAO,CAAA,GAAI,CAAA,IAAK,CAAA,GAAI,KAAK,GAAA,CAAI,IAAI,CAAA,CAAA,GAAK,CAAA,IAAK,CAAA,GAAI,IAAA,CAAA;AACjE,MAAA,MAAM,SAAA,GAAY,MAAA,CAAO,GAAA,CAAI,UAAA,IAAc,CAAC,CAAA;AAC5C,MAAA,MAAM,OAAA,GAAU,MAAA,CAAO,GAAA,CAAI,QAAA,IAAY,CAAC,CAAA;AACxC,MAAA,MAAM,IAAA,GAAO,MAAA,CAAO,GAAA,CAAI,QAAQ,CAAA;AAChC,MAAA,OAAO;AAAA,QACL,IAAA;AAAA,QACA,SAAA;AAAA,QACA,OAAA;AAAA,QACA,KAAA,EAAO,SAAA;AAAA,QACP,SAAA;AAAA,QACA,SAAS,eAAA,CAAgB,MAAA,CAAO,GAAA,CAAI,IAAA,IAAQ,EAAE,CAAC,CAAA;AAAA,QAC/C,MAAA,EAAQ,MAAA,CAAO,GAAA,CAAI,MAAM,CAAA;AAAA,QACzB,UAAU,CAAA,EAAG,IAAI,CAAA,CAAA,EAAI,SAAS,IAAI,OAAO,CAAA,CAAA;AAAA;AAAA;AAAA,QAGzC,OAAA,EAAS,MAAA,CAAO,GAAA,CAAI,EAAE;AAAA,OACxB;AAAA,IACF,CAAC,CAAA;AAAA,EACH;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQQ,kBAAA,CACN,OACA,KAAA,EAC8C;AAC9C,IAAA,MAAM,OAAO,IAAA,CAAK,IAAA,CAAK,SAAS,iBAAA,CAAkB,KAAK,GAAG,KAAK,CAAA;AAC/D,IAAA,OAAO,IAAA,CAAK,GAAA,CAAI,CAAC,GAAA,KAAQ;AACvB,MAAA,MAAM,IAAA,GAAO,MAAA,CAAO,GAAA,CAAI,QAAA,IAAY,EAAE,CAAA;AACtC,MAAA,MAAM,SAAA,GAAY,MAAA,CAAO,GAAA,CAAI,UAAA,IAAc,CAAC,CAAA;AAC5C,MAAA,MAAM,OAAA,GAAU,MAAA,CAAO,GAAA,CAAI,QAAA,IAAY,CAAC,CAAA;AACxC,MAAA,OAAO;AAAA,QACL,IAAA;AAAA,QACA,SAAA;AAAA,QACA,OAAA;AAAA,QACA,KAAA,EAAO,GAAA;AAAA;AAAA,QACP,SAAA,EAAW,GAAA;AAAA,QACX,SAAS,eAAA,CAAgB,MAAA,CAAO,GAAA,CAAI,IAAA,IAAQ,EAAE,CAAC,CAAA;AAAA,QAC/C,MAAA,EAAQ,MAAA,CAAO,GAAA,CAAI,MAAM,CAAA;AAAA,QACzB,UAAU,CAAA,EAAG,IAAI,CAAA,CAAA,EAAI,SAAS,IAAI,OAAO,CAAA,CAAA;AAAA,QACzC,OAAA,EAAS,MAAA,CAAO,GAAA,CAAI,EAAE;AAAA,OACxB;AAAA,IACF,CAAC,CAAA;AAAA,EACH;AAAA,EAEA,MAAc,gBAAA,CACZ,KAAA,EACA,KAAA,EACiE;AACjE,IAAA,IAAI,CAAC,KAAK,WAAA,IAAe,IAAA,CAAK,cAAc,MAAA,EAAW,2BAAW,GAAA,EAAI;AAMtE,IAAA,MAAM,QAAA,GAAWA,WAAW,QAAQ,CAAA,CAAE,OAAO,KAAK,CAAA,CAAE,OAAO,KAAK,CAAA;AAChE,IAAA,MAAM,MAAA,GAAS,gBAAA,CAAiB,GAAA,CAAI,QAAQ,CAAA;AAC5C,IAAA,MAAM,QAAA,GAAW,MAAA,IAAA,CAAW,MAAM,IAAA,CAAK,SAAA,CAAU,MAAM,CAAC,KAAK,CAAC,CAAA,EAAG,CAAC,CAAA;AAClE,IAAA,IAAI,QAAA,KAAa,MAAA,EAAW,uBAAO,IAAI,GAAA,EAAI;AAC3C,IAAA,IAAI,MAAA,KAAW,MAAA,EAAW,gBAAA,CAAiB,GAAA,CAAI,UAAU,QAAQ,CAAA;AACjE,IAAA,MAAM,IAAA,GAAO,YAAA,CAAa,IAAA,CAAK,EAAA,EAAI,UAAU,KAAK,CAAA;AAElD,IAAA,MAAM,GAAA,uBAAU,GAAA,EAAqC;AACrD,IAAA,KAAA,MAAW,OAAO,IAAA,EAAM;AACtB,MAAA,MAAM,QAAQ,CAAA,IAAK,CAAA,GAAI,KAAK,GAAA,CAAI,CAAA,EAAG,IAAI,QAAQ,CAAA,CAAA;AAC/C,MAAA,GAAA,CAAI,IAAI,GAAA,CAAI,QAAA,EAAU,EAAE,WAAA,EAAa,OAAO,CAAA;AAAA,IAC9C;AACA,IAAA,OAAO,GAAA;AAAA,EACT;AAAA,EAEQ,mBAAA,CACN,QAAA,EACA,cAAA,EACA,OAAA,EACmB;AACnB,IAAA,MAAM,OAAA,GAAU,eAAe,OAAO,CAAA;AACtC,IAAA,MAAM,MAAA,GAAS,IAAA,CAAK,SAAA,CAAU,QAAA,EAAU,cAAc,CAAA;AACtD,IAAA,MAAM,WAAW,CAAC,GAAG,MAAA,CAAO,MAAA,EAAQ,CAAA,CAAE,GAAA;AAAA,MAAI,CAAC,GAAA,KACzC,WAAA,CAAY,GAAA,EAAK,cAAA,CAAe,GAAA,CAAI,GAAA,CAAI,OAAO,CAAA,EAAG,WAAA,IAAe,CAAA,EAAG,OAAO;AAAA,KAC7E;AACA,IAAA,OAAO,QAAA,CAAS,KAAK,CAAC,CAAA,EAAG,MAAM,CAAA,CAAE,KAAA,GAAQ,EAAE,KAAK,CAAA;AAAA,EAClD;AAAA,EAEQ,SAAA,CACN,UACA,cAAA,EACoD;AACpD,IAAA,MAAM,MAAA,uBAAa,GAAA,EAAmD;AACtE,IAAA,KAAA,MAAW,OAAO,QAAA,EAAU,MAAA,CAAO,GAAA,CAAI,GAAA,CAAI,SAAS,GAAG,CAAA;AACvD,IAAA,MAAM,UAAA,GAAa,CAAC,GAAG,cAAA,CAAe,MAAM,CAAA,CAAE,MAAA,CAAO,CAAC,EAAA,KAAO,CAAC,MAAA,CAAO,GAAA,CAAI,EAAE,CAAC,CAAA;AAC5E,IAAA,IAAI,UAAA,CAAW,SAAS,CAAA,EAAG;AACzB,MAAA,KAAA,MAAW,GAAA,IAAO,IAAA,CAAK,gBAAA,CAAiB,UAAU,CAAA,EAAG;AACnD,QAAA,MAAA,CAAO,GAAA,CAAI,GAAA,CAAI,OAAA,EAAS,EAAE,GAAG,KAAK,KAAA,EAAO,CAAA,EAAG,SAAA,EAAW,CAAA,EAAG,CAAA;AAAA,MAC5D;AAAA,IACF;AACA,IAAA,OAAO,MAAA;AAAA,EACT;AAAA,EAEQ,iBACN,GAAA,EAC8C;AAC9C,IAAA,MAAM,IAAA,GAAO,IAAA,CAAK,IAAA,CAAK,cAAA,CAAe,GAAG,CAAA;AACzC,IAAA,OAAO,IAAA,CAAK,GAAA,CAAI,CAAC,GAAA,KAAQ;AACvB,MAAA,MAAM,SAAA,GAAY,MAAA,CAAO,GAAA,CAAI,UAAA,IAAc,CAAC,CAAA;AAC5C,MAAA,MAAM,OAAA,GAAU,MAAA,CAAO,GAAA,CAAI,QAAA,IAAY,CAAC,CAAA;AACxC,MAAA,MAAM,IAAA,GAAO,MAAA,CAAO,GAAA,CAAI,QAAQ,CAAA;AAChC,MAAA,OAAO;AAAA,QACL,OAAA,EAAS,MAAA,CAAO,GAAA,CAAI,EAAE,CAAA;AAAA,QACtB,IAAA;AAAA,QACA,SAAA;AAAA,QACA,OAAA;AAAA,QACA,KAAA,EAAO,CAAA;AAAA,QACP,SAAA,EAAW,CAAA;AAAA,QACX,SAAS,eAAA,CAAgB,MAAA,CAAO,GAAA,CAAI,IAAA,IAAQ,EAAE,CAAC,CAAA;AAAA,QAC/C,MAAA,EAAQ,MAAA,CAAO,GAAA,CAAI,MAAM,CAAA;AAAA,QACzB,UAAU,CAAA,EAAG,IAAI,CAAA,CAAA,EAAI,SAAS,IAAI,OAAO,CAAA;AAAA,OAC3C;AAAA,IACF,CAAC,CAAA;AAAA,EACH;AAAA,EAEA,KAAA,GAAc;AACZ,IAAA,IAAA,CAAK,KAAK,KAAA,EAAM;AAAA,EAClB;AACF","file":"chunk-CYKKYNOT.js","sourcesContent":["import { createHash } from \"node:crypto\";\n\nimport type { MemoryChunk } from \"../types.js\";\n\n/**\n * Split a markdown document into semantically meaningful chunks (ADR D1 of\n * memory-system-peer-project-parity).\n *\n * Algorithm:\n *   1. Walk lines tracking the current heading (latest `^#+ ` line).\n *   2. Split chunks at the next heading boundary AND on blank-line paragraph\n *      boundaries.\n *   3. If a single paragraph exceeds `maxChars`, split it at the nearest\n *      whitespace ≤ maxChars (word-aligned per edge-case review EC-6) —\n *      never mid-word.\n *\n * Mirrors peer-project's `chunkMarkdown` from\n * `packages/memory-host-sdk/src/host/chunk-markdown.ts`.\n *\n * @internal\n */\n\nexport interface ChunkMarkdownOptions {\n  /** Maximum chars per chunk. Default 800. */\n  maxChars?: number;\n  /** Minimum chars per chunk (avoids splintering tiny lines). Default 80. */\n  minChars?: number;\n}\n\nconst HEADING_RE = /^(#{1,6})\\s+(.+?)\\s*$/;\n\ninterface ChunkAccumulator {\n  chunks: MemoryChunk[];\n  lines: string[];\n  start: number;\n  heading: string | undefined;\n}\n\nexport function chunkMarkdown(text: string, options: ChunkMarkdownOptions = {}): MemoryChunk[] {\n  const maxChars = options.maxChars ?? 800;\n  if (text.length === 0) return [];\n  const lines = text.split(\"\\n\");\n  const acc: ChunkAccumulator = { chunks: [], lines: [], start: 1, heading: undefined };\n  for (let i = 0; i < lines.length; i++) {\n    const line = lines[i] ?? \"\";\n    const lineNumber = i + 1;\n    processLine(acc, line, lineNumber, maxChars);\n  }\n  flushAccumulator(acc, lines.length, maxChars);\n  return acc.chunks;\n}\n\nfunction processLine(\n  acc: ChunkAccumulator,\n  line: string,\n  lineNumber: number,\n  maxChars: number,\n): void {\n  const headingMatch = HEADING_RE.exec(line);\n  const isBlank = line.trim().length === 0;\n  if (headingMatch !== null && acc.lines.length > 0) {\n    flushAccumulator(acc, lineNumber - 1, maxChars);\n  }\n  if (headingMatch !== null) acc.heading = headingMatch[2];\n  acc.lines.push(line);\n  if (isBlank && acc.lines.length > 1) {\n    const joined = acc.lines.join(\"\\n\");\n    if (joined.trim().length > 0) flushAccumulator(acc, lineNumber, maxChars);\n  }\n}\n\nfunction flushAccumulator(acc: ChunkAccumulator, endLineExclusive: number, maxChars: number): void {\n  if (acc.lines.length === 0) return;\n  const chunkText = acc.lines.join(\"\\n\");\n  if (chunkText.trim().length === 0) {\n    acc.lines = [];\n    acc.start = endLineExclusive + 1;\n    return;\n  }\n  if (chunkText.length > maxChars) {\n    pushOversizedSlices(acc.chunks, chunkText, acc.start, acc.heading, maxChars);\n  } else {\n    acc.chunks.push(buildChunk(chunkText, acc.start, endLineExclusive, acc.heading));\n  }\n  acc.lines = [];\n  acc.start = endLineExclusive + 1;\n}\n\nfunction buildChunk(\n  text: string,\n  startLine: number,\n  endLine: number,\n  heading: string | undefined,\n): MemoryChunk {\n  return {\n    startLine,\n    endLine,\n    text,\n    hash: createHash(\"sha256\").update(text).digest(\"hex\"),\n    ...(heading !== undefined ? { heading } : {}),\n  };\n}\n\nfunction pushOversizedSlices(\n  chunks: MemoryChunk[],\n  text: string,\n  startLine: number,\n  heading: string | undefined,\n  maxChars: number,\n): void {\n  let remaining = text;\n  let lineCursor = startLine;\n  while (remaining.length > maxChars) {\n    const splitAt = findWordBoundarySplit(remaining, maxChars);\n    const slice = remaining.slice(0, splitAt);\n    const sliceLines = slice.split(\"\\n\").length;\n    chunks.push(buildChunk(slice, lineCursor, lineCursor + sliceLines - 1, heading));\n    remaining = remaining.slice(splitAt).replace(/^\\s+/, \"\");\n    lineCursor += sliceLines - 1;\n  }\n  if (remaining.length > 0) {\n    const sliceLines = remaining.split(\"\\n\").length;\n    chunks.push(buildChunk(remaining, lineCursor, lineCursor + sliceLines - 1, heading));\n  }\n}\n\n/**\n * Find a split point ≤ maxChars that lands on a whitespace boundary so we\n * don't slice a word in half. Falls back to maxChars if no whitespace is\n * within range (very rare — a single token > maxChars).\n */\nfunction findWordBoundarySplit(text: string, maxChars: number): number {\n  if (text.length <= maxChars) return text.length;\n  // Walk backward from maxChars looking for whitespace.\n  for (let i = maxChars; i > Math.max(0, maxChars - 200); i--) {\n    if (/\\s/.test(text[i] ?? \"x\")) return i;\n  }\n  // No whitespace within 200 chars of the cap — accept a hard split.\n  return maxChars;\n}\n","/**\n * The corpus walk: read every markdown file under the memory root, and re-chunk the ones that\n * changed.\n *\n * One of the four concerns that shared `IndexManager`, and the one with the most distinct reason to\n * change — \"which files are in the corpus and when is one stale\" is a question about the filesystem,\n * not about search or about the schema. It takes a {@link MemoryIndexRepository} rather than a\n * database, so it cannot reach past it into SQL.\n *\n * The staleness test is the content hash, NOT the mtime. mtime is written into `files` for\n * observability; a file touched without being edited must not cost a re-chunk, and a file restored\n * from a backup with an older mtime must not be skipped.\n *\n * @internal\n */\n\nimport { readFile, stat } from \"node:fs/promises\";\nimport { collectMarkdownFiles, sha256 } from \"./index-manager-helpers.js\";\nimport type { MemoryIndexRepository } from \"./index-repository.js\";\nimport { chunkMarkdown } from \"./storage/chunk-markdown.js\";\nimport type { MemoryRoot } from \"./storage/memory-root.js\";\n\nexport interface CorpusSyncCounts {\n  readonly filesScanned: number;\n  readonly filesUpdated: number;\n  readonly chunksWritten: number;\n}\n\nexport async function syncCorpus(\n  repo: MemoryIndexRepository,\n  memoryRoot: MemoryRoot,\n): Promise<CorpusSyncCounts> {\n  const files = await collectMarkdownFiles(memoryRoot);\n  const existingByPath = repo.filesByPath();\n  let filesUpdated = 0;\n  let chunksWritten = 0;\n\n  for (const entry of files) {\n    const raw = await readFile(entry.absolutePath, \"utf8\");\n    const hash = sha256(raw);\n    if (existingByPath.get(entry.absolutePath)?.hash === hash) continue;\n\n    const stats = await stat(entry.absolutePath);\n    const fileId = repo.upsertFile({\n      absPath: entry.absolutePath,\n      relPath: entry.relPath,\n      hash,\n      mtimeMs: stats.mtimeMs,\n      source: entry.source,\n    });\n    repo.deleteChunksForFile(fileId);\n    const chunks = chunkMarkdown(raw);\n    for (const chunk of chunks) repo.insertChunk({ fileId, ...chunk });\n\n    filesUpdated += 1;\n    chunksWritten += chunks.length;\n  }\n\n  return { filesScanned: files.length, filesUpdated, chunksWritten };\n}\n","/**\n * Escapes a user query for a SQL `LIKE ... ESCAPE '\\'` clause.\n *\n * The order of the three replacements is the whole correctness argument, so it is its own\n * function rather than a chain inline at the call site.\n *\n * The previous version escaped `%` and `_` but not the escape character itself, which is the\n * defect CodeQL reports as `js/incomplete-sanitization` (alerts #14, #15). Two things went wrong,\n * and the second is the one that matters:\n *\n *   \"back\\slash\"  ->  \"%back\\slash%\"    the `\\s` is an escape of `s`, which LIKE does not define\n *   \"x\\%y\"        ->  \"%x\\\\%y%\"         the inserted `\\` is consumed escaping the user's `\\`,\n *                                       leaving `%` UNESCAPED — a wildcard the caller did not\n *                                       write, matching anything between `x\\` and `y`\n *\n * The second is wildcard injection: a search for a literal string silently becomes a scan. In a\n * memory index that is both a wrong answer and a way to pull back rows the query never asked for.\n *\n * Escaping the backslash FIRST is what fixes it — afterwards every `\\` in the string is one this\n * function put there, so the later replacements cannot collide with a user-supplied one.\n */\nexport function escapeLikePattern(query: string): string {\n  return `%${query.replace(/\\\\/g, \"\\\\\\\\\").replace(/%/g, \"\\\\%\").replace(/_/g, \"\\\\_\")}%`;\n}\n","/**\n * Common `MemoryIndex` interface shared between the SQLite-backed\n * `IndexManager` (default) and the Lance-backed adapter (ADR D43, shipped\n * v1.4.0 via lancedb-backend-ship-v1-1 plan).\n *\n * Consumers (`local-agent-memory.ts`, `active-memory.ts`, `tools.ts`,\n * `runActiveMemory`) only ever call `sync()`, `search()`, `status()`,\n * `close()` — the union of those four methods is the portable surface.\n *\n * Why a separate file (vs declaring inline in `index-manager.ts`)? D43\n * promised \"extract an abstract `MemoryIndex` interface in\n * `internal/memory/index-interface.ts`\". Keeping the contract physically\n * separated from one of its implementations preserves OCP — future\n * backends (Qdrant, PGVector) can land without touching IndexManager.\n *\n * @internal\n */\n\nimport type { IndexStatus, MemorySearchHit, SearchOptions } from \"./index-manager-contract.js\";\n\n// Re-export consumer-facing shapes for stable internal import paths.\nexport type { IndexStatus, MemorySearchHit, SearchOptions };\n\nexport interface SyncResult {\n  filesScanned: number;\n  filesUpdated: number;\n  chunksWritten: number;\n  chunksEmbedded: number;\n  /**\n   * Whether this backend actually walked a corpus.\n   *\n   * REQUIRED, not optional, and that is the point. `MemoryIndex` has two implementers and consumers\n   * hold the interface: `IndexManager` walks files, and `LanceMemoryAdapter` has no corpus to walk —\n   * it is a vector store fed by explicit `addFacts`. The adapter used to answer with a frozen\n   * all-zeros result, which a caller cannot tell apart from a real sync that found nothing to do.\n   * The comment above it stated that as the intention (\"so callers' existing logging does not\n   * break\"), which is the substitution defect written down as a feature.\n   *\n   * A required boolean forces every implementer to say which case it is in, and forces the compiler\n   * to notice a new implementer that forgot. An optional flag would have let the next backend\n   * reproduce the silence.\n   */\n  supported: boolean;\n}\n\n/**\n * Common search-options parser used by both `IndexManager.search` and\n * `LanceMemoryAdapter.search`. Returns the normalized cap + minimum-score\n * floor — eliminates jscpd duplication while keeping per-backend search\n * logic distinct.\n */\nexport function parseSearchOptions(options: SearchOptions = {}): {\n  maxResults: number;\n  minScore: number;\n} {\n  return {\n    maxResults: Math.max(1, options.maxResults ?? 10),\n    minScore: options.minScore ?? 0,\n  };\n}\n\nexport interface MemoryIndex {\n  /**\n   * Walk the memory corpus + reindex changed files. Lance backend has no\n   * markdown corpus to walk — its adapter returns zero counts (no-op) and\n   * relies on explicit `addFact` calls instead.\n   */\n  sync(): Promise<SyncResult>;\n\n  /**\n   * Semantic + textual search over the indexed corpus. Both backends\n   * return the same `MemorySearchHit[]` shape; Lance leaves `textScore`\n   * undefined (vector-only — no FTS5 layer).\n   */\n  search(query: string, options?: SearchOptions): Promise<MemorySearchHit[]>;\n\n  /** Snapshot of the index health (backend type + counts). */\n  status(): IndexStatus;\n\n  /** Release native handles. Idempotent. */\n  close(): Promise<void> | void;\n}\n","/**\n * `LanceMemoryAdapter` — wraps `LanceIndex` to expose the common\n * `MemoryIndex` interface (sync/search/status/close) so consumers of\n * `IndexManager.open({ backend: \"lance\" })` get a drop-in replacement\n * for the SQLite-backed `IndexManager`.\n *\n * Semantic deltas vs SQLite (documented so callers know what to expect):\n *\n *  - `sync()` is a NO-OP. Lance is a pure vector store — there is no\n *    markdown corpus to crawl. It returns zero counts with `supported: false`\n *    so the result is not mistaken for a sync that found nothing. Consumers\n *    writing facts hold a `LanceIndex` and call `addFacts` on it; the adapter\n *    does not hand its adaptee out.\n *  - `search()` is HYBRID, not vector-only. Lance supplies the vector distance\n *    and `translateLanceHit` adds a client-side term-overlap ratio (T4.5), so\n *    `textScore` is a real number in 0..1 and `score` is `0.7 * vectorScore +\n *    0.3 * textScore` — never `=== vectorScore`. This block said the opposite\n *    for as long as T4.5 has been shipped, while the docblock 90 lines below\n *    described the change correctly, so the two halves of one file disagreed\n *    and the header is the half a caller reads.\n *  - `status()` reports `backend: \"hybrid\"` only when an embedding runtime\n *    is wired (always the case for Lance — embedding is required at open).\n *    Both counts are 0 with `countsExact: false`: the port declares `status()`\n *    synchronous and Lance's row count is async, so nothing can be measured\n *    here. The zeros are placeholders and the flag says which.\n *\n * Ships with the lancedb-backend-ship-v1-1 plan (close D12, supersede via\n * D43). v1.4.0 of `@theokit/sdk`.\n *\n * @internal\n */\n\nimport type { IndexStatus, MemorySearchHit, SearchOptions } from \"./index-manager-contract.js\";\nimport { type HybridWeights, resolveWeights } from \"./index-manager-helpers.js\";\nimport type { LanceIndex } from \"./lance-index.js\";\nimport { type MemoryIndex, parseSearchOptions, type SyncResult } from \"./memory-index.js\";\n\n/**\n * Default namespace used when consumers call `search()` without specifying\n * one. The SQLite `IndexManager` does not surface namespace in its public\n * `search()` signature either — both backends therefore behave consistently\n * under the \"single-workspace, single-namespace\" assumption that v1.4 ships.\n *\n * v1.5 candidate: surface `namespace` in `SearchOptions` (additive — no\n * breaking change) so multi-tenant Lance consumers can scope queries.\n */\nconst DEFAULT_NAMESPACE = \"default\";\n\n/**\n * Lance has no corpus to walk, and the result now SAYS so.\n *\n * The counts stay zero — inventing numbers would trade one false claim for another. What changed is\n * `supported: false`: an all-zeros result was previously indistinguishable from a real sync that\n * found nothing to reindex, and the comment above this constant used to present that as the goal\n * (\"so callers' existing logging does not break\"). A caller can now tell \"nothing to do\" from\n * \"this backend does not do this\".\n */\nconst UNSUPPORTED_SYNC_RESULT: SyncResult = Object.freeze({\n  filesScanned: 0,\n  filesUpdated: 0,\n  chunksWritten: 0,\n  chunksEmbedded: 0,\n  supported: false,\n});\n\nexport class LanceMemoryAdapter implements MemoryIndex {\n  constructor(private readonly inner: LanceIndex) {}\n\n  /**\n   * Not applicable to Lance — see file header. Returns zero counts with `supported: false` so a\n   * caller can distinguish this from a real sync that found nothing.\n   */\n  async sync(): Promise<SyncResult> {\n    return UNSUPPORTED_SYNC_RESULT;\n  }\n\n  // jscpd:ignore-start — search signature + early-out is idiomatic\n  // overlap with IndexManager.search; further factoring would hurt\n  // readability (the bodies diverge sharply right after).\n  async search(query: string, options: SearchOptions = {}): Promise<MemorySearchHit[]> {\n    if (query.trim().length === 0) return [];\n    const { maxResults, minScore } = parseSearchOptions(options);\n    // jscpd:ignore-end\n    const lanceHits = await this.inner.search(query, {\n      namespace: DEFAULT_NAMESPACE,\n      limit: maxResults * 2,\n      ...(options.sources !== undefined ? { sources: options.sources } : {}),\n    });\n    return lanceHits\n      .filter((h) => h.score >= minScore)\n      .slice(0, maxResults)\n      .map((h) => translateLanceHit(h, query, resolveWeights(options)));\n  }\n\n  status(): IndexStatus {\n    // The Lance API is async and `status()` is not, so no count can be taken here. The zeros are\n    // placeholders and `countsExact: false` says so — previously they were indistinguishable from a\n    // measured empty index, so a caller testing `chunksIndexed > 0` got a false negative on every\n    // run regardless of how many rows the table held.\n    //\n    // There is deliberately no escape hatch. This class used to carry `unwrap(): LanceIndex`,\n    // documented as being for \"the migration tool, benchmark script\" — measured 2026-09-01, it had\n    // ZERO callers anywhere in the monorepo, including those two, which hold a `LanceIndex`\n    // directly and never open the adapter. What it did have was this comment pointing at it, which\n    // made the leak read as the supported way to work around the limitation. A caller that needs\n    // the real count needs `LanceIndex`, and the honest way to get one is to open one.\n    return {\n      backend: \"hybrid\",\n      filesIndexed: 0,\n      chunksIndexed: 0,\n      countsExact: false,\n    };\n  }\n\n  async close(): Promise<void> {\n    await this.inner.close();\n  }\n}\n\n/**\n * Translate `LanceSearchHit` to `MemorySearchHit`. Field mapping:\n *\n *   - `id` → `path` (Lance has no file-system provenance; use opaque id)\n *   - `text` → `snippet` (truncated to 200 chars matching IndexManager convention)\n *   - `score` → combined (0.7 × vectorScore + 0.3 × textScore)\n *   - `vectorScore` → from Lance's distance metric\n *   - `textScore` → T4.5 client-side term-overlap ratio (removes ADR D43 vector-only caveat)\n *   - `source` → `source`\n *   - synthetic `startLine: 0, endLine: 0` (Lance has no line info)\n *   - synthetic `citation: id` (no path:line citation available)\n */\nfunction translateLanceHit(\n  hit: { id: string; text: string; source: \"memory\" | \"sessions\" | \"wiki\"; score: number },\n  query: string | undefined,\n  weights: HybridWeights,\n): MemorySearchHit {\n  const textScore = query !== undefined ? computeTermOverlapScore(query, hit.text) : 0;\n  const vectorScore = hit.score;\n  // The CALLER's weights, through the same `resolveWeights` the SQLite path uses. These were the\n  // literals 0.7 and 0.3, so a caller that tuned `vectorWeight` / `textWeight` had its tuning applied\n  // on one backend and silently dropped on the other — the shape of failure that makes a swap-in\n  // backend untrustworthy. The defaults differ between the two (0.6/0.4 from resolveWeights, versus\n  // the 0.7/0.3 written here), so unweighted results move slightly; that is the point, since one of\n  // the two numbers was not the contract's.\n  const combined =\n    (vectorScore * weights.vectorWeight + textScore * weights.textWeight) / weights.total;\n  return {\n    path: hit.id,\n    startLine: 0,\n    endLine: 0,\n    score: combined,\n    textScore,\n    vectorScore,\n    snippet: hit.text.slice(0, 200),\n    source: hit.source,\n    citation: hit.id,\n  };\n}\n\n/**\n * T4.5 — Client-side term-overlap score for Lance hybrid search.\n * Counts what fraction of query terms appear in the text (case-insensitive).\n * Simple but effective for re-ranking vector hits by lexical relevance.\n * Returns 0..1 where 1 = all query terms present.\n */\nfunction computeTermOverlapScore(query: string, text: string): number {\n  const queryTerms = query\n    .toLowerCase()\n    .split(/\\s+/)\n    .filter((t) => t.length > 1);\n  if (queryTerms.length === 0) return 0;\n  const textLower = text.toLowerCase();\n  const matched = queryTerms.filter((term) => textLower.includes(term)).length;\n  return matched / queryTerms.length;\n}\n","/**\n * Dispatch helpers for `IndexManager.open`. Extracted to keep\n * `index-manager.ts` under the G8 400-LoC budget (lancedb-backend-ship-v1-1).\n *\n * @internal\n */\n\nimport { ConfigurationError } from \"../../errors.js\";\nimport type { MemoryBackend, OpenIndexOptions } from \"./index-manager-contract.js\";\nimport { LanceIndex } from \"./lance-index.js\";\nimport { LanceMemoryAdapter } from \"./lance-memory-adapter.js\";\nimport type { MemoryIndex } from \"./memory-index.js\";\n\n/** Valid backend identifiers — runtime guard against TS-narrowing escapes (EC-1). */\nexport const VALID_BACKENDS: readonly MemoryBackend[] = [\"sqlite-vec\", \"lance\"];\n\n/**\n * EC-1: runtime guard for `opts.backend`. TS union is compile-time only;\n * consumers passing JS `as any` typos must hit a typed error, not silent\n * SQLite fallback.\n */\nexport function assertValidBackend(backend: string): asserts backend is MemoryBackend {\n  if (!VALID_BACKENDS.includes(backend as MemoryBackend)) {\n    throw new ConfigurationError(\n      `Invalid memory backend \"${backend}\". Valid values: ${VALID_BACKENDS.join(\", \")}.`,\n      { code: \"invalid_memory_backend\" },\n    );\n  }\n}\n\n/**\n * Lance-path open. Throws `lance_requires_embedding` when no embedding\n * runtime is provided (Lance is vector-only — no FTS fallback).\n * Surfaces `lance_backend_unavailable` from LanceIndex.open when peer\n * dep is absent.\n */\nexport async function openLanceIndex(opts: OpenIndexOptions): Promise<MemoryIndex> {\n  if (opts.embedding === undefined) {\n    throw new ConfigurationError(\n      \"Lance backend requires an embedding runtime. Pass `embedding: { provider, model, apiKey }` in Memory.create options (or omit `backend` to use SQLite default).\",\n      { code: \"lance_requires_embedding\" },\n    );\n  }\n  const lance = await LanceIndex.open({\n    cwd: opts.cwd,\n    embedding: opts.embedding,\n    ...(opts.filePath !== undefined ? { storagePath: opts.filePath } : {}),\n  });\n  return new LanceMemoryAdapter(lance);\n}\n","/**\n * Every SQL string the memory index runs, in one place.\n *\n * `IndexManager` answered four questions with four independent reasons to change: the corpus walk,\n * the BM25-to-score normalisation, the vector-cache strategy, and the schema. This is the fourth.\n * Changing a column, an index or a join is now a change to THIS file, and the caller above it reads\n * as search logic rather than as SQL with scoring in between.\n *\n * The row-to-`MemorySearchHit` mapping deliberately stays with the caller: turning a row into a hit\n * involves a score, a snippet and a citation, none of which the schema knows about. Keeping it here\n * would move the normalisation into the repository and re-create the same mixture one layer down.\n *\n * Rows come back as `Record<string, unknown>` for the same reason: the repository knows what it\n * SELECTed, not what the caller will make of it.\n *\n * @internal\n */\n\nimport type { MemoryDb } from \"./index-db.js\";\n\n/** What `files` holds for one path — the pair the corpus walk compares against disk. */\nexport interface FileRow {\n  readonly id: number;\n  readonly hash: string;\n}\n\nexport class MemoryIndexRepository {\n  constructor(private readonly db: MemoryDb) {}\n\n  counts(): { files: number; chunks: number } {\n    const files = this.db.prepare(\"SELECT COUNT(*) as n FROM files\").get() ?? { n: 0 };\n    const chunks = this.db.prepare(\"SELECT COUNT(*) as n FROM chunks\").get() ?? { n: 0 };\n    return { files: Number(files.n ?? 0), chunks: Number(chunks.n ?? 0) };\n  }\n\n  /**\n   * FTS5 match, ordered by bm25. THROWS on an FTS5 error rather than swallowing it — whether that\n   * error means \"CJK input the default tokenizer cannot segment\" or \"the table is missing\" is a\n   * judgement the caller makes, and it makes it differently for each.\n   */\n  ftsRows(sanitizedQuery: string, limit: number): Array<Record<string, unknown>> {\n    return this.db\n      .prepare(\n        `SELECT chunks.id as id, files.rel_path as rel_path, files.source as source,\n                chunks.start_line as start_line, chunks.end_line as end_line,\n                chunks.text as text, bm25(chunks_fts) as bm25_score\n         FROM chunks_fts\n         JOIN chunks ON chunks_fts.rowid = chunks.id\n         JOIN files  ON chunks.file_id = files.id\n         WHERE chunks_fts MATCH ?\n         ORDER BY bm25_score\n         LIMIT ?`,\n      )\n      .all(sanitizedQuery, limit);\n  }\n\n  /** Substring scan — the CJK fallback. No relevance score exists here; the caller supplies one. */\n  likeRows(escapedPattern: string, limit: number): Array<Record<string, unknown>> {\n    return this.db\n      .prepare(\n        `SELECT chunks.id as id, files.rel_path as rel_path, files.source as source,\n                chunks.start_line as start_line, chunks.end_line as end_line,\n                chunks.text as text\n         FROM chunks\n         JOIN files ON chunks.file_id = files.id\n         WHERE chunks.text LIKE ? ESCAPE '\\\\'\n         LIMIT ?`,\n      )\n      .all(escapedPattern, limit) as Array<Record<string, unknown>>;\n  }\n\n  /** Hydrate the chunks a vector search returned by id. Empty in, empty out — no query runs. */\n  chunkRowsByIds(ids: ReadonlyArray<number>): Array<Record<string, unknown>> {\n    if (ids.length === 0) return [];\n    const placeholders = ids.map(() => \"?\").join(\",\");\n    return this.db\n      .prepare(\n        `SELECT chunks.id as id, files.rel_path as rel_path, files.source as source,\n                chunks.start_line as start_line, chunks.end_line as end_line,\n                chunks.text as text\n         FROM chunks JOIN files ON chunks.file_id = files.id\n         WHERE chunks.id IN (${placeholders})`,\n      )\n      .all(...ids);\n  }\n\n  /** Absolute path → its row, for the corpus walk to compare hashes against disk. */\n  filesByPath(): Map<string, FileRow> {\n    const rows = this.db.prepare(\"SELECT id, path, hash FROM files\").all() as Array<{\n      id: number;\n      path: string;\n      hash: string;\n    }>;\n    return new Map(rows.map((row) => [row.path, { id: row.id, hash: row.hash }]));\n  }\n\n  upsertFile(file: {\n    absPath: string;\n    relPath: string;\n    hash: string;\n    mtimeMs: number;\n    source: \"memory\" | \"wiki\" | \"sessions\";\n  }): number {\n    const row = this.db\n      .prepare(\n        `INSERT INTO files (path, rel_path, mtime, hash, source) VALUES (?, ?, ?, ?, ?)\n         ON CONFLICT(path) DO UPDATE SET hash = excluded.hash, mtime = excluded.mtime, source = excluded.source\n         RETURNING id`,\n      )\n      .get(file.absPath, file.relPath, Math.floor(file.mtimeMs), file.hash, file.source) as {\n      id: number;\n    };\n    return row.id;\n  }\n\n  deleteChunksForFile(fileId: number): void {\n    this.db.prepare(\"DELETE FROM chunks WHERE file_id = ?\").run(fileId);\n  }\n\n  insertChunk(chunk: {\n    fileId: number;\n    startLine: number;\n    endLine: number;\n    text: string;\n    hash: string;\n  }): void {\n    this.db\n      .prepare(\n        \"INSERT INTO chunks (file_id, start_line, end_line, text, hash) VALUES (?, ?, ?, ?, ?)\",\n      )\n      .run(chunk.fileId, chunk.startLine, chunk.endLine, chunk.text, chunk.hash);\n  }\n\n  close(): void {\n    this.db.close();\n  }\n}\n","import { ConfigurationError } from \"../../errors.js\";\nimport type { MemoryDb } from \"./index-db.js\";\n\n/**\n * Load the `sqlite-vec` extension into an opened SQLite connection.\n *\n * Wraps the native `load(db)` call from the `sqlite-vec` npm package with a\n * typed error path (EC-8 of the edge-case review) so callers see a\n * `sqlite_vec_unavailable` ConfigurationError instead of a raw native error.\n *\n * @internal\n */\nexport async function loadSqliteVecExtension(db: MemoryDb): Promise<void> {\n  try {\n    const mod = await import(\"sqlite-vec\");\n    const loadFn = (mod as { load?: (db: unknown) => void }).load;\n    if (typeof loadFn !== \"function\") {\n      throw new Error(\"sqlite-vec module exposes no `load` export\");\n    }\n    loadFn(db);\n  } catch (cause) {\n    const message = cause instanceof Error ? cause.message : String(cause);\n    throw new ConfigurationError(\n      `sqlite-vec extension unavailable. Install \\`sqlite-vec\\` and ensure the native binary matches your Node + OS. Cause: ${message}`,\n      { code: \"sqlite_vec_unavailable\", cause },\n    );\n  }\n}\n","import type { EmbeddingRuntime } from \"./embedding-adapter.js\";\nimport type { MemoryDb } from \"./index-db.js\";\n\n/**\n * Vector index helpers (ADR D2 + D4 of memory-system-peer-project-parity).\n *\n * Embeddings live in `embeddings(chunk_id, vec)` — a `vec0` virtual table\n * provided by the sqlite-vec extension. Embedding identity (providerId +\n * model + dimension) lives in the `meta` table; mismatches force a full\n * re-embed sweep (EC-1).\n *\n * @internal\n */\n\nexport const META_KEY_PROVIDER_ID = \"embedding.providerId\";\nexport const META_KEY_MODEL = \"embedding.model\";\nexport const META_KEY_DIMENSION = \"embedding.dimension\";\n\nexport interface EmbeddingIdentity {\n  providerId: string;\n  model: string;\n  dimension: number;\n}\n\nexport function readEmbeddingIdentity(db: MemoryDb): EmbeddingIdentity | undefined {\n  const get = (key: string): string | undefined => {\n    const row = db.prepare(\"SELECT value FROM meta WHERE key = ?\").get(key);\n    return row !== undefined ? String(row.value) : undefined;\n  };\n  const providerId = get(META_KEY_PROVIDER_ID);\n  const model = get(META_KEY_MODEL);\n  const dimRaw = get(META_KEY_DIMENSION);\n  if (providerId === undefined || model === undefined || dimRaw === undefined) return undefined;\n  const dimension = Number(dimRaw);\n  if (!Number.isFinite(dimension) || dimension <= 0) return undefined;\n  return { providerId, model, dimension };\n}\n\nexport function writeEmbeddingIdentity(db: MemoryDb, identity: EmbeddingIdentity): void {\n  const stmt = db.prepare(\n    \"INSERT INTO meta (key, value) VALUES (?, ?) ON CONFLICT(key) DO UPDATE SET value = excluded.value\",\n  );\n  stmt.run(META_KEY_PROVIDER_ID, identity.providerId);\n  stmt.run(META_KEY_MODEL, identity.model);\n  stmt.run(META_KEY_DIMENSION, String(identity.dimension));\n}\n\nexport function identityMatches(a: EmbeddingIdentity, b: EmbeddingIdentity): boolean {\n  return a.providerId === b.providerId && a.model === b.model && a.dimension === b.dimension;\n}\n\nexport function dropVectorIndex(db: MemoryDb): void {\n  db.exec(\"DROP TABLE IF EXISTS embeddings\");\n}\n\nexport function createVectorIndex(db: MemoryDb, dimension: number): void {\n  db.exec(`CREATE VIRTUAL TABLE IF NOT EXISTS embeddings USING vec0(\n    chunk_id INTEGER PRIMARY KEY,\n    vec FLOAT[${dimension}]\n  )`);\n}\n\n/** Pack a Float32Array into a Buffer suitable for sqlite-vec BLOB binding. */\nexport function packVector(vec: ReadonlyArray<number>): Buffer {\n  const f32 = new Float32Array(vec.length);\n  for (let i = 0; i < vec.length; i++) f32[i] = vec[i] ?? 0;\n  return Buffer.from(f32.buffer);\n}\n\nexport function upsertEmbedding(db: MemoryDb, chunkId: number, vec: ReadonlyArray<number>): void {\n  // sqlite-vec vec0 virtual tables don't support UPSERT — emulate via\n  // DELETE-then-INSERT. vec0 REJECTS JS Number for chunk_id columns; it\n  // requires BigInt binding. Verified via repro against vec0 v0.1.9.\n  const id = BigInt(chunkId);\n  db.prepare(\"DELETE FROM embeddings WHERE chunk_id = ?\").run(id);\n  db.prepare(\"INSERT INTO embeddings (chunk_id, vec) VALUES (?, ?)\").run(id, packVector(vec));\n}\n\nexport interface VectorHitRow {\n  chunk_id: number;\n  distance: number;\n}\n\nexport function vectorSearch(\n  db: MemoryDb,\n  query: ReadonlyArray<number>,\n  k: number,\n): VectorHitRow[] {\n  // sqlite-vec returns distance (lower = closer). Use KNN syntax. k needs\n  // a BigInt-typed binding too.\n  const rows = db\n    .prepare(\n      `SELECT chunk_id, distance FROM embeddings\n       WHERE vec MATCH ? AND k = ?\n       ORDER BY distance`,\n    )\n    .all(packVector(query), BigInt(k));\n  return rows.map((row) => ({ chunk_id: Number(row.chunk_id), distance: Number(row.distance) }));\n}\n\nexport interface EmbedAllArgs {\n  db: MemoryDb;\n  runtime: EmbeddingRuntime;\n}\n\n/** Embed every chunk that doesn't yet have a vector. */\nexport async function embedMissingChunks(args: EmbedAllArgs): Promise<number> {\n  const rows = args.db\n    .prepare(\n      `SELECT chunks.id as id, chunks.text as text\n       FROM chunks\n       LEFT JOIN embeddings ON embeddings.chunk_id = chunks.id\n       WHERE embeddings.chunk_id IS NULL`,\n    )\n    .all();\n  if (rows.length === 0) return 0;\n  const normalized = rows.map((row) => ({ id: Number(row.id), text: String(row.text ?? \"\") }));\n  const vectors = await args.runtime.embed(normalized.map((r) => r.text));\n  for (let i = 0; i < normalized.length; i++) {\n    const row = normalized[i];\n    const vector = vectors[i];\n    if (row === undefined || vector === undefined) continue;\n    upsertEmbedding(args.db, row.id, vector);\n  }\n  return normalized.length;\n}\n","import { createHash } from \"node:crypto\";\nimport { diag } from \"../diagnostics.js\";\nimport { containsCjk, sanitizeFts5Query } from \"../persistence/fts5-sanitize.js\";\nimport { syncCorpus } from \"./corpus-sync.js\";\nimport type { EmbeddingRuntime } from \"./embedding-adapter.js\";\nimport { LruEmbeddingCache } from \"./embedding-cache.js\";\nimport { escapeLikePattern } from \"./escape-like-pattern.js\";\nimport { defaultIndexPath, type MemoryDb, openMemoryDb } from \"./index-db.js\";\nimport { assertValidBackend, openLanceIndex } from \"./index-manager-dispatch.js\";\nimport { blendScores, resolveWeights, truncateSnippet } from \"./index-manager-helpers.js\";\nimport { MemoryIndexRepository } from \"./index-repository.js\";\nimport type { SyncResult } from \"./memory-index.js\";\nimport { type MemoryIndex, parseSearchOptions } from \"./memory-index.js\";\nimport { loadSqliteVecExtension } from \"./sqlite-vec-loader.js\";\nimport { type MemoryRoot, projectMemoryDir, resolveMemoryRoot } from \"./storage/memory-root.js\";\n\n// T4.1 — query-vector LRU cache (DR4 finding #1). Keyed by\n// sha256(query); caches the embedding vector so repeated search\n// queries skip the HTTP round-trip (p99 1.5-3s → ~0ms on hit).\n// Process-wide singleton with bounded capacity (default 2000 queries).\nconst queryVectorCache = new LruEmbeddingCache(2000);\n\nimport {\n  createVectorIndex,\n  dropVectorIndex,\n  embedMissingChunks,\n  identityMatches,\n  readEmbeddingIdentity,\n  vectorSearch,\n  writeEmbeddingIdentity,\n} from \"./vec-index.js\";\n\n/**\n * Memory index manager (ADR D2). FTS5-only at Phase 3; vector index lands in\n * Phase 5.\n *\n * Lifecycle:\n *   const idx = await IndexManager.open({ cwd });\n *   await idx.sync();\n *   const hits = await idx.search(\"query\");\n *   idx.close();\n *\n * @internal\n */\n\n// T2.1 / ADR D433 — these types now live in `index-manager-contract.ts`\n// to break the 3-cycle memory cluster. Re-exported here for back-compat\n// with downstream importers that historically pulled from this file.\nexport type {\n  IndexStatus,\n  MemoryBackend,\n  MemorySearchHit,\n  OpenIndexOptions,\n  SearchOptions,\n} from \"./index-manager-contract.js\";\n\nimport type {\n  IndexStatus,\n  MemorySearchHit,\n  OpenIndexOptions,\n  SearchOptions,\n} from \"./index-manager-contract.js\";\n\nexport class IndexManager implements MemoryIndex {\n  private lastSyncMs: number | undefined;\n  private vectorReady = false;\n\n  /** Every SQL string this class used to hold. See `index-repository.ts` for why it moved. */\n  private readonly repo: MemoryIndexRepository;\n\n  private constructor(\n    private readonly memoryRoot: MemoryRoot,\n    private readonly db: MemoryDb,\n    private readonly embedding: EmbeddingRuntime | undefined,\n  ) {\n    this.repo = new MemoryIndexRepository(db);\n  }\n\n  /**\n   * Open a memory index. Dispatches to SQLite (default) or Lance (opt-in\n   * via `backend: \"lance\"`). See `openLanceInternal` for Lance-specific\n   * preconditions + typed errors.\n   */\n  static async open(opts: OpenIndexOptions & { backend: \"lance\" }): Promise<MemoryIndex>;\n  static async open(\n    opts: Omit<OpenIndexOptions, \"backend\"> | (OpenIndexOptions & { backend?: \"sqlite-vec\" }),\n  ): Promise<IndexManager>;\n  static async open(opts: OpenIndexOptions): Promise<MemoryIndex> {\n    const backend = opts.backend ?? \"sqlite-vec\";\n    assertValidBackend(backend);\n    if (backend === \"lance\") return await openLanceIndex(opts);\n    return await IndexManager.openSqliteInternal(opts);\n  }\n\n  /** Internal SQLite-path open. Renamed from previous public `open`. */\n  private static async openSqliteInternal(opts: OpenIndexOptions): Promise<IndexManager> {\n    const memoryRoot = opts.memoryRoot ?? resolveMemoryRoot(opts.cwd);\n    // What gets INDEXED and where the DATABASE lives are two decisions, and they diverge on\n    // purpose. The corpus is the configured root; the database stays in the project store, because\n    // `memory.directory` may name the directory the Claude Code CLI manages and that CLI has no\n    // index format (`docs/memory-decisions.md` § 1). Collapsing them writes a binary the partner\n    // does not understand into a directory it owns.\n    const filePath = opts.filePath ?? defaultIndexPath(projectMemoryDir(opts.cwd));\n    const db = await openMemoryDb({ filePath });\n    const manager = new IndexManager(memoryRoot, db, opts.embedding);\n    if (opts.embedding !== undefined) await manager.initVectorBackend(opts.embedding);\n    return manager;\n  }\n\n  private async initVectorBackend(runtime: EmbeddingRuntime): Promise<void> {\n    await loadSqliteVecExtension(this.db);\n    const currentIdentity = {\n      providerId: runtime.id,\n      model: runtime.model,\n      dimension: runtime.dimension,\n    };\n    const persisted = readEmbeddingIdentity(this.db);\n    if (persisted !== undefined && !identityMatches(persisted, currentIdentity)) {\n      // EC-1: dimension/model/provider changed — drop the vector index and\n      // force a full re-embed on next sync.\n      dropVectorIndex(this.db);\n    }\n    createVectorIndex(this.db, runtime.dimension);\n    writeEmbeddingIdentity(this.db, currentIdentity);\n    this.vectorReady = true;\n  }\n\n  /** Walk the memory corpus + (re)index changed files. */\n  // Declares `Promise<SyncResult>` rather than repeating the shape inline. The inline version was a\n  // structural copy of the interface it implements, so widening `SyncResult` with `supported` left\n  // this method silently no longer assignable to `MemoryIndex` — the compiler caught it, which is\n  // the argument for naming the type instead of restating it.\n  async sync(): Promise<SyncResult> {\n    const counts = await syncCorpus(this.repo, this.memoryRoot);\n    let chunksEmbedded = 0;\n    if (this.vectorReady && this.embedding !== undefined) {\n      chunksEmbedded = await embedMissingChunks({ db: this.db, runtime: this.embedding });\n    }\n    this.lastSyncMs = Date.now();\n    // `supported: true` — this implementer genuinely walks the corpus, so its counts are a\n    // measurement rather than a placeholder. See SyncResult.supported.\n    return { ...counts, chunksEmbedded, supported: true };\n  }\n\n  async search(query: string, options: SearchOptions = {}): Promise<MemorySearchHit[]> {\n    if (query.trim().length === 0) return [];\n    const { maxResults, minScore } = parseSearchOptions(options);\n    const textHits = this.ftsSearch(query, maxResults * 2);\n    const vectorHitsById = await this.vectorSearchById(query, maxResults * 2);\n    const combined = this.combineHybridScores(textHits, vectorHitsById, options);\n    return combined\n      .filter((h) => h.score >= minScore)\n      .filter((h) => options.sources === undefined || options.sources.includes(h.source))\n      .slice(0, maxResults);\n  }\n\n  status(): IndexStatus {\n    const { files, chunks } = this.repo.counts();\n    const status: IndexStatus = {\n      backend: this.vectorReady ? \"hybrid\" : \"fts-only\",\n      filesIndexed: files,\n      chunksIndexed: chunks,\n      // Counted with SELECT COUNT(*) just above — these are measurements, not placeholders.\n      countsExact: true,\n    };\n    if (this.lastSyncMs !== undefined) status.lastSyncMs = this.lastSyncMs;\n    return status;\n  }\n\n  // ───── search internals ──────────────────────────────────────────────\n\n  private ftsSearch(query: string, limit: number): Array<MemorySearchHit & { chunkId: number }> {\n    // EC-3: short-circuit when sanitizer reduces input to empty string.\n    // Calling `MATCH ''` would error inside FTS5 on some SQLite versions.\n    const sanitized = sanitizeFts5Query(query);\n    if (sanitized.length === 0) return [];\n    let rows: Array<Record<string, unknown>> = [];\n    try {\n      rows = this.repo.ftsRows(sanitized, limit);\n    } catch (err) {\n      // T4.8 — CJK fallback: FTS5's default tokenizer chokes on CJK characters (no word boundaries).\n      // Instead of returning empty, fall back to a LIKE search, which handles CJK correctly (slower\n      // but correct). ADR D64 documents the trigram-routing deferral.\n      //\n      // GATED on the condition it was written for, and reported otherwise. The catch used to be\n      // unconditional, so a corrupt database, a missing `chunks_fts` table (which happens when FTS5\n      // is unavailable at open) and a disk error all became a LIKE scan over the whole table\n      // returning plausible hits at a hardcoded 0.5 — degraded relevance with no signal that\n      // anything had failed. The fallback still runs, because returning nothing would be worse; what\n      // changes is that the operator learns the query is not being answered by the index.\n      if (!containsCjk(query)) {\n        diag(\n          `memory FTS query failed for a non-CJK query and fell back to a LIKE scan — relevance is ` +\n            `degraded and the index may be missing or corrupt: ${\n              err instanceof Error ? err.message : String(err)\n            }`,\n        );\n      }\n      return this.likeSearchFallback(query, limit);\n    }\n    return rows.map((row) => {\n      const bm25 = Number(row.bm25_score ?? 0);\n      const textScore = bm25 < 0 ? 1 / (1 + Math.abs(bm25)) : 1 / (1 + bm25);\n      const startLine = Number(row.start_line ?? 0);\n      const endLine = Number(row.end_line ?? 0);\n      const path = String(row.rel_path);\n      return {\n        path,\n        startLine,\n        endLine,\n        score: textScore,\n        textScore,\n        snippet: truncateSnippet(String(row.text ?? \"\")),\n        source: String(row.source) as \"memory\" | \"sessions\" | \"wiki\",\n        citation: `${path}:${startLine}-${endLine}`,\n        // sneak the chunk id through for the hybrid join below\n        // (cast away later)\n        chunkId: Number(row.id),\n      } as MemorySearchHit & { chunkId: number };\n    });\n  }\n\n  /**\n   * T4.8 — LIKE-based fallback for CJK and other scripts that FTS5's\n   * default tokenizer cannot segment. Slower than FTS5 (full table scan)\n   * but correct for any Unicode input. Returns the same shape as\n   * `ftsSearch` so callers are unaware of the fallback.\n   */\n  private likeSearchFallback(\n    query: string,\n    limit: number,\n  ): Array<MemorySearchHit & { chunkId: number }> {\n    const rows = this.repo.likeRows(escapeLikePattern(query), limit);\n    return rows.map((row) => {\n      const path = String(row.rel_path ?? \"\");\n      const startLine = Number(row.start_line ?? 0);\n      const endLine = Number(row.end_line ?? 0);\n      return {\n        path,\n        startLine,\n        endLine,\n        score: 0.5, // LIKE has no relevance score — use a neutral midpoint\n        textScore: 0.5,\n        snippet: truncateSnippet(String(row.text ?? \"\")),\n        source: String(row.source) as \"memory\" | \"sessions\" | \"wiki\",\n        citation: `${path}:${startLine}-${endLine}`,\n        chunkId: Number(row.id),\n      } as MemorySearchHit & { chunkId: number };\n    });\n  }\n\n  private async vectorSearchById(\n    query: string,\n    limit: number,\n  ): Promise<Map<number, { vectorScore: number; snippet?: string }>> {\n    if (!this.vectorReady || this.embedding === undefined) return new Map();\n    // T4.1 — query-vector LRU cache. The embed call is the p99 hottest\n    // path (1.5-3s per hit). Cache by sha256(query) so repeated queries\n    // skip the HTTP round-trip entirely. The embedding cache (T4.4\n    // globalEmbeddingCache) catches text-level dedup; this catches the\n    // query-level search-result dedup on top.\n    const cacheKey = createHash(\"sha256\").update(query).digest(\"hex\");\n    const cached = queryVectorCache.get(cacheKey);\n    const queryVec = cached ?? (await this.embedding.embed([query]))[0];\n    if (queryVec === undefined) return new Map();\n    if (cached === undefined) queryVectorCache.set(cacheKey, queryVec);\n    const rows = vectorSearch(this.db, queryVec, limit);\n    // sqlite-vec distance: lower = closer. Normalize to 0..1 with higher = better.\n    const out = new Map<number, { vectorScore: number }>();\n    for (const row of rows) {\n      const score = 1 / (1 + Math.max(0, row.distance));\n      out.set(row.chunk_id, { vectorScore: score });\n    }\n    return out;\n  }\n\n  private combineHybridScores(\n    textHits: Array<MemorySearchHit & { chunkId: number }>,\n    vectorHitsById: Map<number, { vectorScore: number }>,\n    options: SearchOptions,\n  ): MemorySearchHit[] {\n    const weights = resolveWeights(options);\n    const merged = this.mergeHits(textHits, vectorHitsById);\n    const combined = [...merged.values()].map((hit) =>\n      blendScores(hit, vectorHitsById.get(hit.chunkId)?.vectorScore ?? 0, weights),\n    );\n    return combined.sort((a, b) => b.score - a.score);\n  }\n\n  private mergeHits(\n    textHits: Array<MemorySearchHit & { chunkId: number }>,\n    vectorHitsById: Map<number, { vectorScore: number }>,\n  ): Map<number, MemorySearchHit & { chunkId: number }> {\n    const merged = new Map<number, MemorySearchHit & { chunkId: number }>();\n    for (const hit of textHits) merged.set(hit.chunkId, hit);\n    const missingIds = [...vectorHitsById.keys()].filter((id) => !merged.has(id));\n    if (missingIds.length > 0) {\n      for (const hit of this.fetchChunksByIds(missingIds)) {\n        merged.set(hit.chunkId, { ...hit, score: 0, textScore: 0 });\n      }\n    }\n    return merged;\n  }\n\n  private fetchChunksByIds(\n    ids: ReadonlyArray<number>,\n  ): Array<MemorySearchHit & { chunkId: number }> {\n    const rows = this.repo.chunkRowsByIds(ids);\n    return rows.map((row) => {\n      const startLine = Number(row.start_line ?? 0);\n      const endLine = Number(row.end_line ?? 0);\n      const path = String(row.rel_path);\n      return {\n        chunkId: Number(row.id),\n        path,\n        startLine,\n        endLine,\n        score: 0,\n        textScore: 0,\n        snippet: truncateSnippet(String(row.text ?? \"\")),\n        source: String(row.source) as \"memory\" | \"sessions\" | \"wiki\",\n        citation: `${path}:${startLine}-${endLine}`,\n      };\n    });\n  }\n\n  close(): void {\n    this.repo.close();\n  }\n}\n\n// Replaced by `sanitizeFts5Query` from `internal/persistence/fts5-sanitize.ts`\n// (T5.2, ADR D64). The new sanitizer is the 6-step port of Hermes'\n// `_sanitize_fts5_query` and handles hyphens/dots/underscores correctly\n// without quoting every token.\n"]}

package/dist/{chunk-WJXOICRC.js → chunk-DX4RUWOK.js}

@@ -1,4 +1,4 @@
-import { defaultIndexPath, openMemoryDb, resolveMemoryRoot, lanceStoragePath, LanceIndex } from './chunk-UNK4HNJH.js';
+import { defaultIndexPath, openMemoryDb, resolveMemoryRoot, lanceStoragePath, LanceIndex } from './chunk-J2SH3PNH.js';
 import { replaceFileAtomic } from './chunk-3JHIFQ4I.js';
 import { ConfigurationError } from './chunk-ALUN2B4W.js';
 import { redactSecrets } from './chunk-CZJ6Q7CW.js';
@@ -200,5 +200,5 @@ async function migrateSqliteToLance(opts) {
 }
 
 export { appendDiaryEntry, diaryPath, entryHash, migrateSqliteToLance, readAllSqliteFacts, renderDiaryEntry };
-//# sourceMappingURL=chunk-WJXOICRC.js.map
-//# sourceMappingURL=chunk-WJXOICRC.js.map
+//# sourceMappingURL=chunk-DX4RUWOK.js.map
+//# sourceMappingURL=chunk-DX4RUWOK.js.map