sensemaking 0.18.2 → 0.18.4

package/dist/esm/store/sqlite/vectors.d.ts

@@ -1,8 +1,4 @@
 import type { Connection, VectorCandidate, VectorSimilar, VectorWriteRow } from '../types.js';
-export declare function pendingRows(conn: Connection): Promise<Array<{
-    path: string;
-    chunk: number;
-}>>;
 export declare function writeVectorBatch(conn: Connection, rows: VectorWriteRow[]): Promise<void>;
 export declare function scanCandidates(conn: Connection, qv: Float32Array, storeDims: number, fetch: number, allowed?: Set<string>): Promise<VectorCandidate[]>;
 export declare function scanSimilar(conn: Connection, path: string, opts: {
@@ -10,4 +6,3 @@ export declare function scanSimilar(conn: Connection, path: string, opts: {
     allowed?: Set<string>;
     k: number;
 }): Promise<VectorSimilar[]>;
-export declare function hasVectorRow(conn: Connection, path: string): Promise<boolean>;

package/dist/esm/store/sqlite/vectors.js

@@ -1,14 +1,4 @@
-// Seed chunks that participate in a `related` scan; see similar() for the measurement.
-const TARGET_CHUNK_CAP = 16;
-// Dequantised int8 dot products land a little either side of a true cosine, so an identical
-// pair prints 1.001 and undermines a column whose whole job is being a bounded number.
-function asCosine(score) {
-    return Math.round(Math.min(1, Math.max(-1, score)) * 1000) / 1000;
-}
-export async function pendingRows(conn) {
-    const stmt = await conn.prepare('SELECT "path", chunk FROM embeddings WHERE vector IS NULL ORDER BY "path", chunk');
-    return await stmt.all();
-}
+import { asCosine, sampleEvenly } from '../vectors.js';
 // One runBatch call per provider batch: the caller (embed/query.ts) already batches by the
 // provider's batchCap, so this is one crossing per batch, never per row.
 export async function writeVectorBatch(conn, rows) {
@@ -49,13 +39,10 @@ export async function scanCandidates(conn, qv, storeDims, fetch, allowed) {
 // Note-to-note similarity is the max cosine over (target chunk, other chunk) pairs, one linear
 // scan of stored vectors.
 export async function scanSimilar(conn, path, opts) {
-    // Cost is target_chunks x stored_chunks, so a heading-dense seed multiplies a full-corpus
-    // scan (12.7s at 201 chunks/note). Sample evenly, so late sections still get a vote.
     const targetStmt = await conn.prepare('SELECT scale, vector FROM embeddings WHERE "path" = ? AND vector IS NOT NULL ORDER BY chunk');
     const targetRows = await targetStmt.all(path);
     if (targetRows.length === 0) return [];
-    const step = Math.max(1, Math.ceil(targetRows.length / TARGET_CHUNK_CAP));
-    const target = targetRows.filter((_, i)=>i % step === 0).map((row)=>({
+    const target = sampleEvenly(targetRows).map((row)=>({
             v: new Int8Array(row.vector.buffer, row.vector.byteOffset, row.vector.byteLength),
             scale: row.scale
         }));
@@ -81,10 +68,3 @@ export async function scanSimilar(conn, path, opts) {
             similarity: asCosine(score)
         }));
 }
-// Whether a note has any chunk with a vector. Distinguishes "nothing is near this note" from
-// "this note has no text", which look the same in an empty result.
-export async function hasVectorRow(conn, path) {
-    const stmt = await conn.prepare('SELECT 1 AS ok FROM embeddings WHERE "path" = ? AND vector IS NOT NULL LIMIT 1');
-    const row = await stmt.get(path);
-    return row !== undefined;
-}

package/dist/esm/store/sqlite/vectors.js.map

@@ -1 +1 @@
-{"version":3,"sources":["/Users/kevin/Dev/OpenSource/ai/sensemaking/src/store/sqlite/vectors.ts"],"sourcesContent":["import type { Connection, VectorCandidate, VectorSimilar, VectorWriteRow } from '../types.ts';\n\n// Seed chunks that participate in a `related` scan; see similar() for the measurement.\nconst TARGET_CHUNK_CAP = 16;\n\n// Dequantised int8 dot products land a little either side of a true cosine, so an identical\n// pair prints 1.001 and undermines a column whose whole job is being a bounded number.\nfunction asCosine(score: number): number {\n  return Math.round(Math.min(1, Math.max(-1, score)) * 1000) / 1000;\n}\n\nexport async function pendingRows(conn: Connection): Promise<Array<{ path: string; chunk: number }>> {\n  const stmt = await conn.prepare('SELECT \"path\", chunk FROM embeddings WHERE vector IS NULL ORDER BY \"path\", chunk');\n  return (await stmt.all()) as Array<{ path: string; chunk: number }>;\n}\n\n// One runBatch call per provider batch: the caller (embed/query.ts) already batches by the\n// provider's batchCap, so this is one crossing per batch, never per row.\nexport async function writeVectorBatch(conn: Connection, rows: VectorWriteRow[]): Promise<void> {\n  if (rows.length === 0) return;\n  await conn.runBatch(\n    'UPDATE embeddings SET scale = ?, vector = ? WHERE \"path\" = ? AND chunk = ?',\n    rows.map((row) => [row.scale, row.vector, row.path, row.chunk])\n  );\n}\n\n// Best chunk per file by cosine, its line range riding along: the JS loop over stored int8\n// BLOBs this store's scan strategy is (a native store scans differently, same contract).\nexport async function scanCandidates(conn: Connection, qv: Float32Array, storeDims: number, fetch: number, allowed?: Set<string>): Promise<VectorCandidate[]> {\n  const stmt = await conn.prepare('SELECT \"path\", start_line, end_line, scale, vector FROM embeddings WHERE vector IS NOT NULL');\n  const rows = (await stmt.all()) as Array<{\n    path: string;\n    start_line: number;\n    end_line: number;\n    scale: number;\n    vector: Uint8Array;\n  }>;\n\n  const best = new Map<string, { score: number; lines: string }>();\n  for (const row of rows) {\n    if (allowed && !allowed.has(row.path)) continue;\n    const q = new Int8Array(row.vector.buffer, row.vector.byteOffset, Math.min(storeDims, row.vector.byteLength));\n    let dot = 0;\n    for (let d = 0; d < q.length; d++) dot += q[d] * qv[d];\n    const score = dot * row.scale;\n    const existing = best.get(row.path);\n    if (!existing || score > existing.score) best.set(row.path, { score, lines: `L${row.start_line}-${row.end_line}` });\n  }\n  return [...best.entries()]\n    .sort((a, b) => b[1].score - a[1].score)\n    .slice(0, fetch)\n    .map(([path, b]) => ({ path, lines: b.lines, similarity: asCosine(b.score) }));\n}\n\n// Note-to-note similarity is the max cosine over (target chunk, other chunk) pairs, one linear\n// scan of stored vectors.\nexport async function scanSimilar(conn: Connection, path: string, opts: { exclude: Set<string>; allowed?: Set<string>; k: number }): Promise<VectorSimilar[]> {\n  // Cost is target_chunks x stored_chunks, so a heading-dense seed multiplies a full-corpus\n  // scan (12.7s at 201 chunks/note). Sample evenly, so late sections still get a vote.\n  const targetStmt = await conn.prepare('SELECT scale, vector FROM embeddings WHERE \"path\" = ? AND vector IS NOT NULL ORDER BY chunk');\n  const targetRows = (await targetStmt.all(path)) as Array<{ scale: number; vector: Uint8Array }>;\n  if (targetRows.length === 0) return [];\n  const step = Math.max(1, Math.ceil(targetRows.length / TARGET_CHUNK_CAP));\n  const target = targetRows.filter((_, i) => i % step === 0).map((row) => ({ v: new Int8Array(row.vector.buffer, row.vector.byteOffset, row.vector.byteLength), scale: row.scale }));\n\n  const stmt = await conn.prepare('SELECT \"path\", scale, vector FROM embeddings WHERE vector IS NOT NULL');\n  const rows = (await stmt.all()) as Array<{ path: string; scale: number; vector: Uint8Array }>;\n  const best = new Map<string, number>();\n  for (const row of rows) {\n    if (row.path === path || opts.exclude.has(row.path) || (opts.allowed && !opts.allowed.has(row.path))) continue;\n    const other = new Int8Array(row.vector.buffer, row.vector.byteOffset, row.vector.byteLength);\n    for (const t of target) {\n      let dot = 0;\n      const len = Math.min(t.v.length, other.length);\n      for (let d = 0; d < len; d++) dot += t.v[d] * other[d];\n      const score = dot * t.scale * row.scale;\n      const existing = best.get(row.path);\n      if (existing === undefined || score > existing) best.set(row.path, score);\n    }\n  }\n\n  return [...best.entries()]\n    .sort((a, b) => b[1] - a[1])\n    .slice(0, opts.k)\n    .map(([p, score]) => ({ path: p, similarity: asCosine(score) }));\n}\n\n// Whether a note has any chunk with a vector. Distinguishes \"nothing is near this note\" from\n// \"this note has no text\", which look the same in an empty result.\nexport async function hasVectorRow(conn: Connection, path: string): Promise<boolean> {\n  const stmt = await conn.prepare('SELECT 1 AS ok FROM embeddings WHERE \"path\" = ? AND vector IS NOT NULL LIMIT 1');\n  const row = (await stmt.get(path)) as { ok: number } | undefined;\n  return row !== undefined;\n}\n"],"names":["TARGET_CHUNK_CAP","asCosine","score","Math","round","min","max","pendingRows","conn","stmt","prepare","all","writeVectorBatch","rows","length","runBatch","map","row","scale","vector","path","chunk","scanCandidates","qv","storeDims","fetch","allowed","best","Map","has","q","Int8Array","buffer","byteOffset","byteLength","dot","d","existing","get","set","lines","start_line","end_line","entries","sort","a","b","slice","similarity","scanSimilar","opts","targetStmt","targetRows","step","ceil","target","filter","_","i","v","exclude","other","t","len","undefined","k","p","hasVectorRow"],"mappings":"AAEA,uFAAuF;AACvF,MAAMA,mBAAmB;AAEzB,4FAA4F;AAC5F,uFAAuF;AACvF,SAASC,SAASC,KAAa;IAC7B,OAAOC,KAAKC,KAAK,CAACD,KAAKE,GAAG,CAAC,GAAGF,KAAKG,GAAG,CAAC,CAAC,GAAGJ,UAAU,QAAQ;AAC/D;AAEA,OAAO,eAAeK,YAAYC,IAAgB;IAChD,MAAMC,OAAO,MAAMD,KAAKE,OAAO,CAAC;IAChC,OAAQ,MAAMD,KAAKE,GAAG;AACxB;AAEA,2FAA2F;AAC3F,yEAAyE;AACzE,OAAO,eAAeC,iBAAiBJ,IAAgB,EAAEK,IAAsB;IAC7E,IAAIA,KAAKC,MAAM,KAAK,GAAG;IACvB,MAAMN,KAAKO,QAAQ,CACjB,8EACAF,KAAKG,GAAG,CAAC,CAACC,MAAQ;YAACA,IAAIC,KAAK;YAAED,IAAIE,MAAM;YAAEF,IAAIG,IAAI;YAAEH,IAAII,KAAK;SAAC;AAElE;AAEA,2FAA2F;AAC3F,yFAAyF;AACzF,OAAO,eAAeC,eAAed,IAAgB,EAAEe,EAAgB,EAAEC,SAAiB,EAAEC,KAAa,EAAEC,OAAqB;IAC9H,MAAMjB,OAAO,MAAMD,KAAKE,OAAO,CAAC;IAChC,MAAMG,OAAQ,MAAMJ,KAAKE,GAAG;IAQ5B,MAAMgB,OAAO,IAAIC;IACjB,KAAK,MAAMX,OAAOJ,KAAM;QACtB,IAAIa,WAAW,CAACA,QAAQG,GAAG,CAACZ,IAAIG,IAAI,GAAG;QACvC,MAAMU,IAAI,IAAIC,UAAUd,IAAIE,MAAM,CAACa,MAAM,EAAEf,IAAIE,MAAM,CAACc,UAAU,EAAE9B,KAAKE,GAAG,CAACmB,WAAWP,IAAIE,MAAM,CAACe,UAAU;QAC3G,IAAIC,MAAM;QACV,IAAK,IAAIC,IAAI,GAAGA,IAAIN,EAAEhB,MAAM,EAAEsB,IAAKD,OAAOL,CAAC,CAACM,EAAE,GAAGb,EAAE,CAACa,EAAE;QACtD,MAAMlC,QAAQiC,MAAMlB,IAAIC,KAAK;QAC7B,MAAMmB,WAAWV,KAAKW,GAAG,CAACrB,IAAIG,IAAI;QAClC,IAAI,CAACiB,YAAYnC,QAAQmC,SAASnC,KAAK,EAAEyB,KAAKY,GAAG,CAACtB,IAAIG,IAAI,EAAE;YAAElB;YAAOsC,OAAO,CAAC,CAAC,EAAEvB,IAAIwB,UAAU,CAAC,CAAC,EAAExB,IAAIyB,QAAQ,EAAE;QAAC;IACnH;IACA,OAAO;WAAIf,KAAKgB,OAAO;KAAG,CACvBC,IAAI,CAAC,CAACC,GAAGC,IAAMA,CAAC,CAAC,EAAE,CAAC5C,KAAK,GAAG2C,CAAC,CAAC,EAAE,CAAC3C,KAAK,EACtC6C,KAAK,CAAC,GAAGtB,OACTT,GAAG,CAAC,CAAC,CAACI,MAAM0B,EAAE,GAAM,CAAA;YAAE1B;YAAMoB,OAAOM,EAAEN,KAAK;YAAEQ,YAAY/C,SAAS6C,EAAE5C,KAAK;QAAE,CAAA;AAC/E;AAEA,+FAA+F;AAC/F,0BAA0B;AAC1B,OAAO,eAAe+C,YAAYzC,IAAgB,EAAEY,IAAY,EAAE8B,IAAgE;IAChI,0FAA0F;IAC1F,qFAAqF;IACrF,MAAMC,aAAa,MAAM3C,KAAKE,OAAO,CAAC;IACtC,MAAM0C,aAAc,MAAMD,WAAWxC,GAAG,CAACS;IACzC,IAAIgC,WAAWtC,MAAM,KAAK,GAAG,OAAO,EAAE;IACtC,MAAMuC,OAAOlD,KAAKG,GAAG,CAAC,GAAGH,KAAKmD,IAAI,CAACF,WAAWtC,MAAM,GAAGd;IACvD,MAAMuD,SAASH,WAAWI,MAAM,CAAC,CAACC,GAAGC,IAAMA,IAAIL,SAAS,GAAGrC,GAAG,CAAC,CAACC,MAAS,CAAA;YAAE0C,GAAG,IAAI5B,UAAUd,IAAIE,MAAM,CAACa,MAAM,EAAEf,IAAIE,MAAM,CAACc,UAAU,EAAEhB,IAAIE,MAAM,CAACe,UAAU;YAAGhB,OAAOD,IAAIC,KAAK;QAAC,CAAA;IAE/K,MAAMT,OAAO,MAAMD,KAAKE,OAAO,CAAC;IAChC,MAAMG,OAAQ,MAAMJ,KAAKE,GAAG;IAC5B,MAAMgB,OAAO,IAAIC;IACjB,KAAK,MAAMX,OAAOJ,KAAM;QACtB,IAAII,IAAIG,IAAI,KAAKA,QAAQ8B,KAAKU,OAAO,CAAC/B,GAAG,CAACZ,IAAIG,IAAI,KAAM8B,KAAKxB,OAAO,IAAI,CAACwB,KAAKxB,OAAO,CAACG,GAAG,CAACZ,IAAIG,IAAI,GAAI;QACtG,MAAMyC,QAAQ,IAAI9B,UAAUd,IAAIE,MAAM,CAACa,MAAM,EAAEf,IAAIE,MAAM,CAACc,UAAU,EAAEhB,IAAIE,MAAM,CAACe,UAAU;QAC3F,KAAK,MAAM4B,KAAKP,OAAQ;YACtB,IAAIpB,MAAM;YACV,MAAM4B,MAAM5D,KAAKE,GAAG,CAACyD,EAAEH,CAAC,CAAC7C,MAAM,EAAE+C,MAAM/C,MAAM;YAC7C,IAAK,IAAIsB,IAAI,GAAGA,IAAI2B,KAAK3B,IAAKD,OAAO2B,EAAEH,CAAC,CAACvB,EAAE,GAAGyB,KAAK,CAACzB,EAAE;YACtD,MAAMlC,QAAQiC,MAAM2B,EAAE5C,KAAK,GAAGD,IAAIC,KAAK;YACvC,MAAMmB,WAAWV,KAAKW,GAAG,CAACrB,IAAIG,IAAI;YAClC,IAAIiB,aAAa2B,aAAa9D,QAAQmC,UAAUV,KAAKY,GAAG,CAACtB,IAAIG,IAAI,EAAElB;QACrE;IACF;IAEA,OAAO;WAAIyB,KAAKgB,OAAO;KAAG,CACvBC,IAAI,CAAC,CAACC,GAAGC,IAAMA,CAAC,CAAC,EAAE,GAAGD,CAAC,CAAC,EAAE,EAC1BE,KAAK,CAAC,GAAGG,KAAKe,CAAC,EACfjD,GAAG,CAAC,CAAC,CAACkD,GAAGhE,MAAM,GAAM,CAAA;YAAEkB,MAAM8C;YAAGlB,YAAY/C,SAASC;QAAO,CAAA;AACjE;AAEA,6FAA6F;AAC7F,mEAAmE;AACnE,OAAO,eAAeiE,aAAa3D,IAAgB,EAAEY,IAAY;IAC/D,MAAMX,OAAO,MAAMD,KAAKE,OAAO,CAAC;IAChC,MAAMO,MAAO,MAAMR,KAAK6B,GAAG,CAAClB;IAC5B,OAAOH,QAAQ+C;AACjB"}
+{"version":3,"sources":["/Users/kevin/Dev/OpenSource/ai/sensemaking/src/store/sqlite/vectors.ts"],"sourcesContent":["import type { Connection, VectorCandidate, VectorSimilar, VectorWriteRow } from '../types.ts';\nimport { asCosine, sampleEvenly } from '../vectors.ts';\n\n// One runBatch call per provider batch: the caller (embed/query.ts) already batches by the\n// provider's batchCap, so this is one crossing per batch, never per row.\nexport async function writeVectorBatch(conn: Connection, rows: VectorWriteRow[]): Promise<void> {\n  if (rows.length === 0) return;\n  await conn.runBatch(\n    'UPDATE embeddings SET scale = ?, vector = ? WHERE \"path\" = ? AND chunk = ?',\n    rows.map((row) => [row.scale, row.vector, row.path, row.chunk])\n  );\n}\n\n// Best chunk per file by cosine, its line range riding along: the JS loop over stored int8\n// BLOBs this store's scan strategy is (a native store scans differently, same contract).\nexport async function scanCandidates(conn: Connection, qv: Float32Array, storeDims: number, fetch: number, allowed?: Set<string>): Promise<VectorCandidate[]> {\n  const stmt = await conn.prepare('SELECT \"path\", start_line, end_line, scale, vector FROM embeddings WHERE vector IS NOT NULL');\n  const rows = (await stmt.all()) as Array<{\n    path: string;\n    start_line: number;\n    end_line: number;\n    scale: number;\n    vector: Uint8Array;\n  }>;\n\n  const best = new Map<string, { score: number; lines: string }>();\n  for (const row of rows) {\n    if (allowed && !allowed.has(row.path)) continue;\n    const q = new Int8Array(row.vector.buffer, row.vector.byteOffset, Math.min(storeDims, row.vector.byteLength));\n    let dot = 0;\n    for (let d = 0; d < q.length; d++) dot += q[d] * qv[d];\n    const score = dot * row.scale;\n    const existing = best.get(row.path);\n    if (!existing || score > existing.score) best.set(row.path, { score, lines: `L${row.start_line}-${row.end_line}` });\n  }\n  return [...best.entries()]\n    .sort((a, b) => b[1].score - a[1].score)\n    .slice(0, fetch)\n    .map(([path, b]) => ({ path, lines: b.lines, similarity: asCosine(b.score) }));\n}\n\n// Note-to-note similarity is the max cosine over (target chunk, other chunk) pairs, one linear\n// scan of stored vectors.\nexport async function scanSimilar(conn: Connection, path: string, opts: { exclude: Set<string>; allowed?: Set<string>; k: number }): Promise<VectorSimilar[]> {\n  const targetStmt = await conn.prepare('SELECT scale, vector FROM embeddings WHERE \"path\" = ? AND vector IS NOT NULL ORDER BY chunk');\n  const targetRows = (await targetStmt.all(path)) as Array<{ scale: number; vector: Uint8Array }>;\n  if (targetRows.length === 0) return [];\n  const target = sampleEvenly(targetRows).map((row) => ({ v: new Int8Array(row.vector.buffer, row.vector.byteOffset, row.vector.byteLength), scale: row.scale }));\n\n  const stmt = await conn.prepare('SELECT \"path\", scale, vector FROM embeddings WHERE vector IS NOT NULL');\n  const rows = (await stmt.all()) as Array<{ path: string; scale: number; vector: Uint8Array }>;\n  const best = new Map<string, number>();\n  for (const row of rows) {\n    if (row.path === path || opts.exclude.has(row.path) || (opts.allowed && !opts.allowed.has(row.path))) continue;\n    const other = new Int8Array(row.vector.buffer, row.vector.byteOffset, row.vector.byteLength);\n    for (const t of target) {\n      let dot = 0;\n      const len = Math.min(t.v.length, other.length);\n      for (let d = 0; d < len; d++) dot += t.v[d] * other[d];\n      const score = dot * t.scale * row.scale;\n      const existing = best.get(row.path);\n      if (existing === undefined || score > existing) best.set(row.path, score);\n    }\n  }\n\n  return [...best.entries()]\n    .sort((a, b) => b[1] - a[1])\n    .slice(0, opts.k)\n    .map(([p, score]) => ({ path: p, similarity: asCosine(score) }));\n}\n"],"names":["asCosine","sampleEvenly","writeVectorBatch","conn","rows","length","runBatch","map","row","scale","vector","path","chunk","scanCandidates","qv","storeDims","fetch","allowed","stmt","prepare","all","best","Map","has","q","Int8Array","buffer","byteOffset","Math","min","byteLength","dot","d","score","existing","get","set","lines","start_line","end_line","entries","sort","a","b","slice","similarity","scanSimilar","opts","targetStmt","targetRows","target","v","exclude","other","t","len","undefined","k","p"],"mappings":"AACA,SAASA,QAAQ,EAAEC,YAAY,QAAQ,gBAAgB;AAEvD,2FAA2F;AAC3F,yEAAyE;AACzE,OAAO,eAAeC,iBAAiBC,IAAgB,EAAEC,IAAsB;IAC7E,IAAIA,KAAKC,MAAM,KAAK,GAAG;IACvB,MAAMF,KAAKG,QAAQ,CACjB,8EACAF,KAAKG,GAAG,CAAC,CAACC,MAAQ;YAACA,IAAIC,KAAK;YAAED,IAAIE,MAAM;YAAEF,IAAIG,IAAI;YAAEH,IAAII,KAAK;SAAC;AAElE;AAEA,2FAA2F;AAC3F,yFAAyF;AACzF,OAAO,eAAeC,eAAeV,IAAgB,EAAEW,EAAgB,EAAEC,SAAiB,EAAEC,KAAa,EAAEC,OAAqB;IAC9H,MAAMC,OAAO,MAAMf,KAAKgB,OAAO,CAAC;IAChC,MAAMf,OAAQ,MAAMc,KAAKE,GAAG;IAQ5B,MAAMC,OAAO,IAAIC;IACjB,KAAK,MAAMd,OAAOJ,KAAM;QACtB,IAAIa,WAAW,CAACA,QAAQM,GAAG,CAACf,IAAIG,IAAI,GAAG;QACvC,MAAMa,IAAI,IAAIC,UAAUjB,IAAIE,MAAM,CAACgB,MAAM,EAAElB,IAAIE,MAAM,CAACiB,UAAU,EAAEC,KAAKC,GAAG,CAACd,WAAWP,IAAIE,MAAM,CAACoB,UAAU;QAC3G,IAAIC,MAAM;QACV,IAAK,IAAIC,IAAI,GAAGA,IAAIR,EAAEnB,MAAM,EAAE2B,IAAKD,OAAOP,CAAC,CAACQ,EAAE,GAAGlB,EAAE,CAACkB,EAAE;QACtD,MAAMC,QAAQF,MAAMvB,IAAIC,KAAK;QAC7B,MAAMyB,WAAWb,KAAKc,GAAG,CAAC3B,IAAIG,IAAI;QAClC,IAAI,CAACuB,YAAYD,QAAQC,SAASD,KAAK,EAAEZ,KAAKe,GAAG,CAAC5B,IAAIG,IAAI,EAAE;YAAEsB;YAAOI,OAAO,CAAC,CAAC,EAAE7B,IAAI8B,UAAU,CAAC,CAAC,EAAE9B,IAAI+B,QAAQ,EAAE;QAAC;IACnH;IACA,OAAO;WAAIlB,KAAKmB,OAAO;KAAG,CACvBC,IAAI,CAAC,CAACC,GAAGC,IAAMA,CAAC,CAAC,EAAE,CAACV,KAAK,GAAGS,CAAC,CAAC,EAAE,CAACT,KAAK,EACtCW,KAAK,CAAC,GAAG5B,OACTT,GAAG,CAAC,CAAC,CAACI,MAAMgC,EAAE,GAAM,CAAA;YAAEhC;YAAM0B,OAAOM,EAAEN,KAAK;YAAEQ,YAAY7C,SAAS2C,EAAEV,KAAK;QAAE,CAAA;AAC/E;AAEA,+FAA+F;AAC/F,0BAA0B;AAC1B,OAAO,eAAea,YAAY3C,IAAgB,EAAEQ,IAAY,EAAEoC,IAAgE;IAChI,MAAMC,aAAa,MAAM7C,KAAKgB,OAAO,CAAC;IACtC,MAAM8B,aAAc,MAAMD,WAAW5B,GAAG,CAACT;IACzC,IAAIsC,WAAW5C,MAAM,KAAK,GAAG,OAAO,EAAE;IACtC,MAAM6C,SAASjD,aAAagD,YAAY1C,GAAG,CAAC,CAACC,MAAS,CAAA;YAAE2C,GAAG,IAAI1B,UAAUjB,IAAIE,MAAM,CAACgB,MAAM,EAAElB,IAAIE,MAAM,CAACiB,UAAU,EAAEnB,IAAIE,MAAM,CAACoB,UAAU;YAAGrB,OAAOD,IAAIC,KAAK;QAAC,CAAA;IAE5J,MAAMS,OAAO,MAAMf,KAAKgB,OAAO,CAAC;IAChC,MAAMf,OAAQ,MAAMc,KAAKE,GAAG;IAC5B,MAAMC,OAAO,IAAIC;IACjB,KAAK,MAAMd,OAAOJ,KAAM;QACtB,IAAII,IAAIG,IAAI,KAAKA,QAAQoC,KAAKK,OAAO,CAAC7B,GAAG,CAACf,IAAIG,IAAI,KAAMoC,KAAK9B,OAAO,IAAI,CAAC8B,KAAK9B,OAAO,CAACM,GAAG,CAACf,IAAIG,IAAI,GAAI;QACtG,MAAM0C,QAAQ,IAAI5B,UAAUjB,IAAIE,MAAM,CAACgB,MAAM,EAAElB,IAAIE,MAAM,CAACiB,UAAU,EAAEnB,IAAIE,MAAM,CAACoB,UAAU;QAC3F,KAAK,MAAMwB,KAAKJ,OAAQ;YACtB,IAAInB,MAAM;YACV,MAAMwB,MAAM3B,KAAKC,GAAG,CAACyB,EAAEH,CAAC,CAAC9C,MAAM,EAAEgD,MAAMhD,MAAM;YAC7C,IAAK,IAAI2B,IAAI,GAAGA,IAAIuB,KAAKvB,IAAKD,OAAOuB,EAAEH,CAAC,CAACnB,EAAE,GAAGqB,KAAK,CAACrB,EAAE;YACtD,MAAMC,QAAQF,MAAMuB,EAAE7C,KAAK,GAAGD,IAAIC,KAAK;YACvC,MAAMyB,WAAWb,KAAKc,GAAG,CAAC3B,IAAIG,IAAI;YAClC,IAAIuB,aAAasB,aAAavB,QAAQC,UAAUb,KAAKe,GAAG,CAAC5B,IAAIG,IAAI,EAAEsB;QACrE;IACF;IAEA,OAAO;WAAIZ,KAAKmB,OAAO;KAAG,CACvBC,IAAI,CAAC,CAACC,GAAGC,IAAMA,CAAC,CAAC,EAAE,GAAGD,CAAC,CAAC,EAAE,EAC1BE,KAAK,CAAC,GAAGG,KAAKU,CAAC,EACflD,GAAG,CAAC,CAAC,CAACmD,GAAGzB,MAAM,GAAM,CAAA;YAAEtB,MAAM+C;YAAGb,YAAY7C,SAASiC;QAAO,CAAA;AACjE"}

package/dist/esm/store/turso/connection.d.ts

@@ -0,0 +1,3 @@
+import type { Database } from '@tursodatabase/database';
+import type { Connection } from '../types.js';
+export declare function createConnection(db: Database): Connection;

package/dist/esm/store/turso/connection.js

@@ -0,0 +1,52 @@
+import { withTransaction } from '../transaction.js';
+// Turso's client is async end to end (no synchronous escape hatch like node:sqlite's), so this
+// wraps it in the same Connection/Statement shape 1:1, no sync-over-async and no worker bridge.
+let TursoStatementWrapper = class TursoStatementWrapper {
+    async run(...params) {
+        return this.stmt.run(...params);
+    }
+    async get(...params) {
+        return this.stmt.get(...params);
+    }
+    async all(...params) {
+        return this.stmt.all(...params);
+    }
+    async *iterate(...params) {
+        yield* this.stmt.iterate(...params);
+    }
+    columns() {
+        return this.stmt.columns();
+    }
+    setReadBigInts(enabled) {
+        this.stmt.safeIntegers(enabled);
+    }
+    constructor(stmt){
+        this.stmt = stmt;
+    }
+};
+export function createConnection(db) {
+    const conn = {
+        async exec (sql) {
+            await db.exec(sql);
+        },
+        async prepare (sql) {
+            return new TursoStatementWrapper(await db.prepare(sql));
+        },
+        // db.batch() is the engine's own bulk idiom: one crossing, N rows, each row its own
+        // statement (no 32k bind-variable ceiling to chunk around, unlike a single giant statement).
+        // Spike-confirmed: batch() joins an already-open exec-level BEGIN rather than erroring, and a
+        // literal nested BEGIN hard-errors ("cannot start a transaction within a transaction"), so
+        // the shared withTransaction join-not-savepoint helper is what makes this safe to call both
+        // standalone and inside reconcile's own transaction.
+        async runBatch (sql, paramRows) {
+            if (paramRows.length === 0) return;
+            await withTransaction(conn, async ()=>{
+                await db.batch(paramRows.map((args)=>({
+                        sql,
+                        args
+                    })));
+            });
+        }
+    };
+    return conn;
+}

package/dist/esm/store/turso/connection.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["/Users/kevin/Dev/OpenSource/ai/sensemaking/src/store/turso/connection.ts"],"sourcesContent":["import type { Database } from '@tursodatabase/database';\nimport { withTransaction } from '../transaction.ts';\nimport type { Connection, RunResult, Statement } from '../types.ts';\n\n// The client's own Statement class isn't re-exported by name from '@tursodatabase/database'\n// (it lives on @tursodatabase/database-common, a transitive dependency), so its type is derived\n// structurally from Database.prepare()'s return type rather than imported by name.\ntype TursoStatement = Awaited<ReturnType<Database['prepare']>>;\n\n// Turso's client is async end to end (no synchronous escape hatch like node:sqlite's), so this\n// wraps it in the same Connection/Statement shape 1:1, no sync-over-async and no worker bridge.\nclass TursoStatementWrapper implements Statement {\n  private stmt: TursoStatement;\n\n  constructor(stmt: TursoStatement) {\n    this.stmt = stmt;\n  }\n\n  async run(...params: unknown[]): Promise<RunResult> {\n    return this.stmt.run(...params);\n  }\n\n  async get(...params: unknown[]): Promise<unknown> {\n    return this.stmt.get(...params);\n  }\n\n  async all(...params: unknown[]): Promise<unknown[]> {\n    return this.stmt.all(...params);\n  }\n\n  async *iterate(...params: unknown[]): AsyncIterable<unknown> {\n    yield* this.stmt.iterate(...params);\n  }\n\n  columns(): Array<{ name: string }> {\n    return this.stmt.columns();\n  }\n\n  setReadBigInts(enabled: boolean): void {\n    this.stmt.safeIntegers(enabled);\n  }\n}\n\nexport function createConnection(db: Database): Connection {\n  const conn: Connection = {\n    async exec(sql: string): Promise<void> {\n      await db.exec(sql);\n    },\n    async prepare(sql: string): Promise<Statement> {\n      return new TursoStatementWrapper(await db.prepare(sql));\n    },\n    // db.batch() is the engine's own bulk idiom: one crossing, N rows, each row its own\n    // statement (no 32k bind-variable ceiling to chunk around, unlike a single giant statement).\n    // Spike-confirmed: batch() joins an already-open exec-level BEGIN rather than erroring, and a\n    // literal nested BEGIN hard-errors (\"cannot start a transaction within a transaction\"), so\n    // the shared withTransaction join-not-savepoint helper is what makes this safe to call both\n    // standalone and inside reconcile's own transaction.\n    async runBatch(sql: string, paramRows: unknown[][]): Promise<void> {\n      if (paramRows.length === 0) return;\n      await withTransaction(conn, async () => {\n        await db.batch(paramRows.map((args) => ({ sql, args })));\n      });\n    },\n  };\n  return conn;\n}\n"],"names":["withTransaction","TursoStatementWrapper","run","params","stmt","get","all","iterate","columns","setReadBigInts","enabled","safeIntegers","createConnection","db","conn","exec","sql","prepare","runBatch","paramRows","length","batch","map","args"],"mappings":"AACA,SAASA,eAAe,QAAQ,oBAAoB;AAQpD,+FAA+F;AAC/F,gGAAgG;AAChG,IAAA,AAAMC,wBAAN,MAAMA;IAOJ,MAAMC,IAAI,GAAGC,MAAiB,EAAsB;QAClD,OAAO,IAAI,CAACC,IAAI,CAACF,GAAG,IAAIC;IAC1B;IAEA,MAAME,IAAI,GAAGF,MAAiB,EAAoB;QAChD,OAAO,IAAI,CAACC,IAAI,CAACC,GAAG,IAAIF;IAC1B;IAEA,MAAMG,IAAI,GAAGH,MAAiB,EAAsB;QAClD,OAAO,IAAI,CAACC,IAAI,CAACE,GAAG,IAAIH;IAC1B;IAEA,OAAOI,QAAQ,GAAGJ,MAAiB,EAA0B;QAC3D,OAAO,IAAI,CAACC,IAAI,CAACG,OAAO,IAAIJ;IAC9B;IAEAK,UAAmC;QACjC,OAAO,IAAI,CAACJ,IAAI,CAACI,OAAO;IAC1B;IAEAC,eAAeC,OAAgB,EAAQ;QACrC,IAAI,CAACN,IAAI,CAACO,YAAY,CAACD;IACzB;IA1BA,YAAYN,IAAoB,CAAE;QAChC,IAAI,CAACA,IAAI,GAAGA;IACd;AAyBF;AAEA,OAAO,SAASQ,iBAAiBC,EAAY;IAC3C,MAAMC,OAAmB;QACvB,MAAMC,MAAKC,GAAW;YACpB,MAAMH,GAAGE,IAAI,CAACC;QAChB;QACA,MAAMC,SAAQD,GAAW;YACvB,OAAO,IAAIf,sBAAsB,MAAMY,GAAGI,OAAO,CAACD;QACpD;QACA,oFAAoF;QACpF,6FAA6F;QAC7F,8FAA8F;QAC9F,2FAA2F;QAC3F,4FAA4F;QAC5F,qDAAqD;QACrD,MAAME,UAASF,GAAW,EAAEG,SAAsB;YAChD,IAAIA,UAAUC,MAAM,KAAK,GAAG;YAC5B,MAAMpB,gBAAgBc,MAAM;gBAC1B,MAAMD,GAAGQ,KAAK,CAACF,UAAUG,GAAG,CAAC,CAACC,OAAU,CAAA;wBAAEP;wBAAKO;oBAAK,CAAA;YACtD;QACF;IACF;IACA,OAAOT;AACT"}

package/dist/esm/store/turso/fieldStats.d.ts

@@ -0,0 +1,2 @@
+import type { Connection, FieldStat } from '../types.js';
+export declare function fieldStats(conn: Connection, columns: string[], scopeWhere: string): Promise<FieldStat[]>;

package/dist/esm/store/turso/fieldStats.js

@@ -0,0 +1,24 @@
+import { quoteIdent } from '../shared.js';
+// Fork of sqlite/fieldStats.ts (house precedent: each store owns its engine-specific SQL, see
+// turso/reconcile.ts). Turso is SQLite dialect (spike-verified: typeof(), GROUP_CONCAT, and
+// FILTER (WHERE ...) all behave identically to node:sqlite for the bigint/number/string/null
+// shapes mapValue() produces), so the SQL text is identical to sqlite's -- only the Connection
+// it runs against differs.
+export async function fieldStats(conn, columns, scopeWhere) {
+    const exprs = columns.map((name, i)=>{
+        const quoted = quoteIdent(name);
+        return `COUNT(${quoted}) AS n${i}, GROUP_CONCAT(DISTINCT typeof(${quoted})) FILTER (WHERE ${quoted} IS NOT NULL) AS t${i}`;
+    });
+    const stmt = await conn.prepare(`SELECT ${exprs.join(', ')} FROM frontmatter ${scopeWhere}`);
+    const row = await stmt.get();
+    return columns.map((name, i)=>{
+        var _row_, _row_1;
+        return {
+            field: name,
+            coverage: Number((_row_ = row[`n${i}`]) !== null && _row_ !== void 0 ? _row_ : 0),
+            type: [
+                ...new Set(((_row_1 = row[`t${i}`]) !== null && _row_1 !== void 0 ? _row_1 : '').split(',').filter(Boolean))
+            ].sort().join(',')
+        };
+    });
+}

package/dist/esm/store/turso/fieldStats.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["/Users/kevin/Dev/OpenSource/ai/sensemaking/src/store/turso/fieldStats.ts"],"sourcesContent":["import { quoteIdent } from '../shared.ts';\nimport type { Connection, FieldStat } from '../types.ts';\n\n// Fork of sqlite/fieldStats.ts (house precedent: each store owns its engine-specific SQL, see\n// turso/reconcile.ts). Turso is SQLite dialect (spike-verified: typeof(), GROUP_CONCAT, and\n// FILTER (WHERE ...) all behave identically to node:sqlite for the bigint/number/string/null\n// shapes mapValue() produces), so the SQL text is identical to sqlite's -- only the Connection\n// it runs against differs.\nexport async function fieldStats(conn: Connection, columns: string[], scopeWhere: string): Promise<FieldStat[]> {\n  const exprs = columns.map((name, i) => {\n    const quoted = quoteIdent(name);\n    return `COUNT(${quoted}) AS n${i}, GROUP_CONCAT(DISTINCT typeof(${quoted})) FILTER (WHERE ${quoted} IS NOT NULL) AS t${i}`;\n  });\n  const stmt = await conn.prepare(`SELECT ${exprs.join(', ')} FROM frontmatter ${scopeWhere}`);\n  const row = (await stmt.get()) as Record<string, number | string | null>;\n  return columns.map((name, i) => ({\n    field: name,\n    coverage: Number(row[`n${i}`] ?? 0),\n    type: [...new Set(((row[`t${i}`] as string) ?? '').split(',').filter(Boolean))].sort().join(','),\n  }));\n}\n"],"names":["quoteIdent","fieldStats","conn","columns","scopeWhere","exprs","map","name","i","quoted","stmt","prepare","join","row","get","field","coverage","Number","type","Set","split","filter","Boolean","sort"],"mappings":"AAAA,SAASA,UAAU,QAAQ,eAAe;AAG1C,8FAA8F;AAC9F,4FAA4F;AAC5F,6FAA6F;AAC7F,+FAA+F;AAC/F,2BAA2B;AAC3B,OAAO,eAAeC,WAAWC,IAAgB,EAAEC,OAAiB,EAAEC,UAAkB;IACtF,MAAMC,QAAQF,QAAQG,GAAG,CAAC,CAACC,MAAMC;QAC/B,MAAMC,SAAST,WAAWO;QAC1B,OAAO,CAAC,MAAM,EAAEE,OAAO,MAAM,EAAED,EAAE,+BAA+B,EAAEC,OAAO,iBAAiB,EAAEA,OAAO,kBAAkB,EAAED,GAAG;IAC5H;IACA,MAAME,OAAO,MAAMR,KAAKS,OAAO,CAAC,CAAC,OAAO,EAAEN,MAAMO,IAAI,CAAC,MAAM,kBAAkB,EAAER,YAAY;IAC3F,MAAMS,MAAO,MAAMH,KAAKI,GAAG;IAC3B,OAAOX,QAAQG,GAAG,CAAC,CAACC,MAAMC;YAEPK,OACGA;eAHW;YAC/BE,OAAOR;YACPS,UAAUC,QAAOJ,QAAAA,GAAG,CAAC,CAAC,CAAC,EAAEL,GAAG,CAAC,cAAZK,mBAAAA,QAAgB;YACjCK,MAAM;mBAAI,IAAIC,IAAI,EAAEN,SAAAA,GAAG,CAAC,CAAC,CAAC,EAAEL,GAAG,CAAC,cAAZK,oBAAAA,SAA2B,IAAIO,KAAK,CAAC,KAAKC,MAAM,CAACC;aAAU,CAACC,IAAI,GAAGX,IAAI,CAAC;QAC9F;;AACF"}

package/dist/esm/store/turso/native.d.ts

@@ -0,0 +1,2 @@
+export declare const TURSO_PACKAGE = "@tursodatabase/database";
+export declare function tursoApi(): Promise<typeof import('@tursodatabase/database')>;

package/dist/esm/store/turso/native.js

@@ -0,0 +1,19 @@
+import { loadOrInstall, packageNodeModules } from '../native.js';
+export const TURSO_PACKAGE = '@tursodatabase/database';
+const TURSO = {
+    store: 'turso',
+    pkg: TURSO_PACKAGE,
+    sizeHint: '~16MB'
+};
+let tursoApiPromise;
+// The one accessor every consumer of @tursodatabase/database (open.ts) must go through, rather
+// than each doing its own `import('@tursodatabase/database')`: once a fresh install has happened
+// in this process, Node keeps returning that pre-install "not found" miss to any NEW
+// bare-specifier lookup of the same path, so a second independent import elsewhere in the
+// process fails even though the package is now genuinely on disk (the same stale-cache problem
+// loadOrInstall works around for its own retry). Caching the resolved module here means only the
+// first caller ever resolves the bare specifier at all.
+export function tursoApi() {
+    if (!tursoApiPromise) tursoApiPromise = loadOrInstall(TURSO, packageNodeModules());
+    return tursoApiPromise;
+}

package/dist/esm/store/turso/native.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["/Users/kevin/Dev/OpenSource/ai/sensemaking/src/store/turso/native.ts"],"sourcesContent":["import { loadOrInstall, type NativeDescriptor, packageNodeModules } from '../native.ts';\n\nexport const TURSO_PACKAGE = '@tursodatabase/database';\n\nconst TURSO: NativeDescriptor = { store: 'turso', pkg: TURSO_PACKAGE, sizeHint: '~16MB' };\n\nlet tursoApiPromise: Promise<typeof import('@tursodatabase/database')> | undefined;\n\n// The one accessor every consumer of @tursodatabase/database (open.ts) must go through, rather\n// than each doing its own `import('@tursodatabase/database')`: once a fresh install has happened\n// in this process, Node keeps returning that pre-install \"not found\" miss to any NEW\n// bare-specifier lookup of the same path, so a second independent import elsewhere in the\n// process fails even though the package is now genuinely on disk (the same stale-cache problem\n// loadOrInstall works around for its own retry). Caching the resolved module here means only the\n// first caller ever resolves the bare specifier at all.\nexport function tursoApi(): Promise<typeof import('@tursodatabase/database')> {\n  if (!tursoApiPromise) tursoApiPromise = loadOrInstall<typeof import('@tursodatabase/database')>(TURSO, packageNodeModules());\n  return tursoApiPromise;\n}\n"],"names":["loadOrInstall","packageNodeModules","TURSO_PACKAGE","TURSO","store","pkg","sizeHint","tursoApiPromise","tursoApi"],"mappings":"AAAA,SAASA,aAAa,EAAyBC,kBAAkB,QAAQ,eAAe;AAExF,OAAO,MAAMC,gBAAgB,0BAA0B;AAEvD,MAAMC,QAA0B;IAAEC,OAAO;IAASC,KAAKH;IAAeI,UAAU;AAAQ;AAExF,IAAIC;AAEJ,+FAA+F;AAC/F,iGAAiG;AACjG,qFAAqF;AACrF,0FAA0F;AAC1F,+FAA+F;AAC/F,iGAAiG;AACjG,wDAAwD;AACxD,OAAO,SAASC;IACd,IAAI,CAACD,iBAAiBA,kBAAkBP,cAAwDG,OAAOF;IACvG,OAAOM;AACT"}

package/dist/esm/store/turso/open.d.ts

@@ -0,0 +1,12 @@
+import type { ResolvedConfig } from '../../config/index.js';
+import type { Store } from '../types.js';
+export declare const DB_FILENAME = "cache.turso.db";
+export declare const SCHEMA_VERSION = "1";
+export interface OpenResult {
+    store: Store;
+    cfg: ResolvedConfig;
+    dbPath: string;
+    parsed: number;
+    warnings: string[];
+}
+export declare function openTurso(cfg: ResolvedConfig): Promise<OpenResult>;

package/dist/esm/store/turso/open.js

@@ -0,0 +1,113 @@
+import { mkdirSync } from 'node:fs';
+import { join } from 'node:path';
+import { featureSignature, STATE_DIR } from '../../config/index.js';
+import { SenseError } from '../../errors.js';
+import { activeFeatures, FEATURES } from '../../features/index.js';
+import { getMeta, setMeta } from '../shared.js';
+import { clearCache } from '../sqlite/open.js';
+import { createConnection } from './connection.js';
+import { TURSO_PACKAGE, tursoApi } from './native.js';
+import { reconcile } from './reconcile.js';
+import { createStore } from './store.js';
+export const DB_FILENAME = 'cache.turso.db';
+// Independent of sqlite's SCHEMA_VERSION and duckdb's -- each store's cache shape evolves
+// separately, and the store name already joins the feature signature (see featureSignature), so
+// a config's `store` key switching cleanly rebuilds rather than reusing another engine's cache.
+export const SCHEMA_VERSION = '1';
+// content is a plain table (not FTS-virtual): phase 1 creates no FTS index at all -- that is
+// phase 2's job (see the plan). Untyped ALTER TABLE ADD COLUMN, like sqlite -- turso's dialect
+// accepts it with no declared type (spike-confirmed), unlike duckdb which requires VARIANT.
+async function ensureSchema(conn, cfg) {
+    await conn.exec(`CREATE TABLE IF NOT EXISTS frontmatter ("path" TEXT PRIMARY KEY, "_mtime" REAL, "_ctime" REAL, "_size" INTEGER, "_parse_error" TEXT)`);
+    await conn.exec(`CREATE TABLE IF NOT EXISTS content ("path" TEXT PRIMARY KEY, title TEXT, summary TEXT, text TEXT)`);
+    await conn.exec(`CREATE TABLE IF NOT EXISTS preset_files ("path" TEXT, preset TEXT, PRIMARY KEY ("path", preset))`);
+    await conn.exec('CREATE INDEX IF NOT EXISTS preset_files_preset ON preset_files(preset)');
+    for (const feature of activeFeatures(cfg))await feature.schema(conn);
+    if (await getMeta(conn, 'schema_version') === null) await setMeta(conn, 'schema_version', SCHEMA_VERSION);
+    if (await getMeta(conn, 'features') === null) await setMeta(conn, 'features', featureSignature(cfg, FEATURES));
+}
+async function connect(cfg) {
+    const stateDir = join(cfg.baseDir, STATE_DIR);
+    mkdirSync(stateDir, {
+        recursive: true
+    });
+    const dbPath = join(stateDir, DB_FILENAME);
+    // Dynamic, not a top-level import: a sqlite or duckdb tree must never even attempt to resolve
+    // this optional dependency, so nothing in this store's module graph imports it as a value until
+    // a turso tree is actually opened (type-only imports elsewhere are erased and cost nothing
+    // either way). Installed on first use if missing (see native.ts's tursoApi).
+    let turso;
+    try {
+        turso = await tursoApi();
+    } catch (err) {
+        if (err instanceof SenseError) throw err;
+        throw new SenseError('STORE_DEPENDENCY_MISSING', `store "turso" needs the ${TURSO_PACKAGE} package (${err.message})`);
+    }
+    let db;
+    try {
+        // Floored at the same 30s sqlite opens with. `timeout` is a connect-time option in this
+        // client (no synchronous PRAGMA-at-open-time escape hatch), so the real derived value --
+        // which depends on this cache's own recorded reconcile_max_ms, readable only once connected
+        // -- is installed via a runtime PRAGMA below, right before the open-time reconcile, the same
+        // lever sqlite's open() uses (spike-confirmed: raw PRAGMA busy_timeout works as a setter too).
+        db = await turso.connect(dbPath, {
+            timeout: 30000
+        });
+    } catch (err) {
+        throw new SenseError('STORE_DEPENDENCY_MISSING', `store "turso" failed to open ${dbPath}: ${err.message}`);
+    }
+    // A throw below (schema, reconcile's COLUMN_LIMIT) must release this handle, or the leaked WAL
+    // makes the db file undeletable on Windows. closed marks the rebuild branch that closes and
+    // recurses, so the catch never double-closes.
+    let closed = false;
+    try {
+        var _ref;
+        const conn = createConnection(db);
+        await conn.exec('CREATE TABLE IF NOT EXISTS meta (key TEXT PRIMARY KEY, value TEXT)');
+        const version = await getMeta(conn, 'schema_version');
+        const features = await getMeta(conn, 'features');
+        const wantFeatures = featureSignature(cfg, FEATURES);
+        if (version !== null && version !== SCHEMA_VERSION || features !== null && features !== wantFeatures) {
+            // Reconcile only reparses changed files, so a stale cache can't be patched incrementally --
+            // rebuild instead, same as sqlite's and duckdb's open() (see their comments for why this is
+            // announced). No tokenize-only or embed-identity-adopted partial path (sqlite's grace for
+            // those): turso has no content.tokenize knob to special-case, and the grace is an
+            // optimization, not a correctness requirement -- any mismatch rebuilds, duckdb's shape.
+            const reason = version !== null && version !== SCHEMA_VERSION ? 'cache format changed (new sensemaking version)' : 'config change (features, tokenizer, or presets)';
+            console.error(`sense: ${reason}; rebuilding the index`);
+            closed = true;
+            await db.close();
+            clearCache(cfg);
+            return connect(cfg);
+        }
+        await ensureSchema(conn, cfg);
+        // 3x the largest reconcile this cache has recorded, floored at 30s and capped at 10min.
+        // Installed before reconcile() -- that call is the one that races a watcher's transaction.
+        const recordedMaxMs = Number((_ref = await getMeta(conn, 'reconcile_max_ms')) !== null && _ref !== void 0 ? _ref : '0');
+        await conn.exec(`PRAGMA busy_timeout = ${Math.min(Math.max(30000, 3 * recordedMaxMs), 600000)}`);
+        const { parsed, warnings } = await reconcile(conn, cfg, cfg.baseDir);
+        return {
+            db,
+            conn,
+            cfg,
+            dbPath,
+            parsed,
+            warnings
+        };
+    } catch (err) {
+        if (!closed) await db.close();
+        throw err;
+    }
+}
+// The turso store's open: connects (fully async, see connect() above), then wraps the resulting
+// connection in the Store interface.
+export async function openTurso(cfg) {
+    const { db, conn, cfg: resolvedCfg, dbPath, parsed, warnings } = await connect(cfg);
+    return {
+        store: createStore(db, conn, resolvedCfg, resolvedCfg.baseDir),
+        cfg: resolvedCfg,
+        dbPath,
+        parsed,
+        warnings
+    };
+}

package/dist/esm/store/turso/open.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["/Users/kevin/Dev/OpenSource/ai/sensemaking/src/store/turso/open.ts"],"sourcesContent":["import { mkdirSync } from 'node:fs';\nimport { join } from 'node:path';\nimport type { Database } from '@tursodatabase/database';\nimport type { Config, ResolvedConfig } from '../../config/index.ts';\nimport { featureSignature, STATE_DIR } from '../../config/index.ts';\nimport { SenseError } from '../../errors.ts';\nimport { activeFeatures, FEATURES } from '../../features/index.ts';\nimport { getMeta, setMeta } from '../shared.ts';\nimport { clearCache } from '../sqlite/open.ts';\nimport type { Connection, Store } from '../types.ts';\nimport { createConnection } from './connection.ts';\nimport { TURSO_PACKAGE, tursoApi } from './native.ts';\nimport { reconcile } from './reconcile.ts';\nimport { createStore } from './store.ts';\n\nexport const DB_FILENAME = 'cache.turso.db';\n// Independent of sqlite's SCHEMA_VERSION and duckdb's -- each store's cache shape evolves\n// separately, and the store name already joins the feature signature (see featureSignature), so\n// a config's `store` key switching cleanly rebuilds rather than reusing another engine's cache.\nexport const SCHEMA_VERSION = '1';\n\nexport interface OpenResult {\n  store: Store;\n  cfg: ResolvedConfig;\n  dbPath: string;\n  parsed: number;\n  warnings: string[];\n}\n\n// content is a plain table (not FTS-virtual): phase 1 creates no FTS index at all -- that is\n// phase 2's job (see the plan). Untyped ALTER TABLE ADD COLUMN, like sqlite -- turso's dialect\n// accepts it with no declared type (spike-confirmed), unlike duckdb which requires VARIANT.\nasync function ensureSchema(conn: Connection, cfg: Config): Promise<void> {\n  await conn.exec(`CREATE TABLE IF NOT EXISTS frontmatter (\"path\" TEXT PRIMARY KEY, \"_mtime\" REAL, \"_ctime\" REAL, \"_size\" INTEGER, \"_parse_error\" TEXT)`);\n  await conn.exec(`CREATE TABLE IF NOT EXISTS content (\"path\" TEXT PRIMARY KEY, title TEXT, summary TEXT, text TEXT)`);\n  await conn.exec(`CREATE TABLE IF NOT EXISTS preset_files (\"path\" TEXT, preset TEXT, PRIMARY KEY (\"path\", preset))`);\n  await conn.exec('CREATE INDEX IF NOT EXISTS preset_files_preset ON preset_files(preset)');\n  for (const feature of activeFeatures(cfg)) await feature.schema(conn);\n  if ((await getMeta(conn, 'schema_version')) === null) await setMeta(conn, 'schema_version', SCHEMA_VERSION);\n  if ((await getMeta(conn, 'features')) === null) await setMeta(conn, 'features', featureSignature(cfg, FEATURES));\n}\n\ninterface ConnectResult {\n  db: Database;\n  conn: Connection;\n  cfg: ResolvedConfig;\n  dbPath: string;\n  parsed: number;\n  warnings: string[];\n}\n\nasync function connect(cfg: ResolvedConfig): Promise<ConnectResult> {\n  const stateDir = join(cfg.baseDir, STATE_DIR);\n  mkdirSync(stateDir, { recursive: true });\n  const dbPath = join(stateDir, DB_FILENAME);\n\n  // Dynamic, not a top-level import: a sqlite or duckdb tree must never even attempt to resolve\n  // this optional dependency, so nothing in this store's module graph imports it as a value until\n  // a turso tree is actually opened (type-only imports elsewhere are erased and cost nothing\n  // either way). Installed on first use if missing (see native.ts's tursoApi).\n  let turso: Awaited<ReturnType<typeof tursoApi>>;\n  try {\n    turso = await tursoApi();\n  } catch (err) {\n    if (err instanceof SenseError) throw err;\n    throw new SenseError('STORE_DEPENDENCY_MISSING', `store \"turso\" needs the ${TURSO_PACKAGE} package (${(err as Error).message})`);\n  }\n\n  let db: Database;\n  try {\n    // Floored at the same 30s sqlite opens with. `timeout` is a connect-time option in this\n    // client (no synchronous PRAGMA-at-open-time escape hatch), so the real derived value --\n    // which depends on this cache's own recorded reconcile_max_ms, readable only once connected\n    // -- is installed via a runtime PRAGMA below, right before the open-time reconcile, the same\n    // lever sqlite's open() uses (spike-confirmed: raw PRAGMA busy_timeout works as a setter too).\n    db = await turso.connect(dbPath, { timeout: 30_000 });\n  } catch (err) {\n    throw new SenseError('STORE_DEPENDENCY_MISSING', `store \"turso\" failed to open ${dbPath}: ${(err as Error).message}`);\n  }\n  // A throw below (schema, reconcile's COLUMN_LIMIT) must release this handle, or the leaked WAL\n  // makes the db file undeletable on Windows. closed marks the rebuild branch that closes and\n  // recurses, so the catch never double-closes.\n  let closed = false;\n  try {\n    const conn = createConnection(db);\n\n    await conn.exec('CREATE TABLE IF NOT EXISTS meta (key TEXT PRIMARY KEY, value TEXT)');\n\n    const version = await getMeta(conn, 'schema_version');\n    const features = await getMeta(conn, 'features');\n    const wantFeatures = featureSignature(cfg, FEATURES);\n    if ((version !== null && version !== SCHEMA_VERSION) || (features !== null && features !== wantFeatures)) {\n      // Reconcile only reparses changed files, so a stale cache can't be patched incrementally --\n      // rebuild instead, same as sqlite's and duckdb's open() (see their comments for why this is\n      // announced). No tokenize-only or embed-identity-adopted partial path (sqlite's grace for\n      // those): turso has no content.tokenize knob to special-case, and the grace is an\n      // optimization, not a correctness requirement -- any mismatch rebuilds, duckdb's shape.\n      const reason = version !== null && version !== SCHEMA_VERSION ? 'cache format changed (new sensemaking version)' : 'config change (features, tokenizer, or presets)';\n      console.error(`sense: ${reason}; rebuilding the index`);\n      closed = true;\n      await db.close();\n      clearCache(cfg);\n      return connect(cfg);\n    }\n\n    await ensureSchema(conn, cfg);\n\n    // 3x the largest reconcile this cache has recorded, floored at 30s and capped at 10min.\n    // Installed before reconcile() -- that call is the one that races a watcher's transaction.\n    const recordedMaxMs = Number((await getMeta(conn, 'reconcile_max_ms')) ?? '0');\n    await conn.exec(`PRAGMA busy_timeout = ${Math.min(Math.max(30000, 3 * recordedMaxMs), 600_000)}`);\n\n    const { parsed, warnings } = await reconcile(conn, cfg, cfg.baseDir);\n\n    return { db, conn, cfg, dbPath, parsed, warnings };\n  } catch (err) {\n    if (!closed) await db.close();\n    throw err;\n  }\n}\n\n// The turso store's open: connects (fully async, see connect() above), then wraps the resulting\n// connection in the Store interface.\nexport async function openTurso(cfg: ResolvedConfig): Promise<OpenResult> {\n  const { db, conn, cfg: resolvedCfg, dbPath, parsed, warnings } = await connect(cfg);\n  return { store: createStore(db, conn, resolvedCfg, resolvedCfg.baseDir), cfg: resolvedCfg, dbPath, parsed, warnings };\n}\n"],"names":["mkdirSync","join","featureSignature","STATE_DIR","SenseError","activeFeatures","FEATURES","getMeta","setMeta","clearCache","createConnection","TURSO_PACKAGE","tursoApi","reconcile","createStore","DB_FILENAME","SCHEMA_VERSION","ensureSchema","conn","cfg","exec","feature","schema","connect","stateDir","baseDir","recursive","dbPath","turso","err","message","db","timeout","closed","version","features","wantFeatures","reason","console","error","close","recordedMaxMs","Number","Math","min","max","parsed","warnings","openTurso","resolvedCfg","store"],"mappings":"AAAA,SAASA,SAAS,QAAQ,UAAU;AACpC,SAASC,IAAI,QAAQ,YAAY;AAGjC,SAASC,gBAAgB,EAAEC,SAAS,QAAQ,wBAAwB;AACpE,SAASC,UAAU,QAAQ,kBAAkB;AAC7C,SAASC,cAAc,EAAEC,QAAQ,QAAQ,0BAA0B;AACnE,SAASC,OAAO,EAAEC,OAAO,QAAQ,eAAe;AAChD,SAASC,UAAU,QAAQ,oBAAoB;AAE/C,SAASC,gBAAgB,QAAQ,kBAAkB;AACnD,SAASC,aAAa,EAAEC,QAAQ,QAAQ,cAAc;AACtD,SAASC,SAAS,QAAQ,iBAAiB;AAC3C,SAASC,WAAW,QAAQ,aAAa;AAEzC,OAAO,MAAMC,cAAc,iBAAiB;AAC5C,0FAA0F;AAC1F,gGAAgG;AAChG,gGAAgG;AAChG,OAAO,MAAMC,iBAAiB,IAAI;AAUlC,6FAA6F;AAC7F,+FAA+F;AAC/F,4FAA4F;AAC5F,eAAeC,aAAaC,IAAgB,EAAEC,GAAW;IACvD,MAAMD,KAAKE,IAAI,CAAC,CAAC,oIAAoI,CAAC;IACtJ,MAAMF,KAAKE,IAAI,CAAC,CAAC,iGAAiG,CAAC;IACnH,MAAMF,KAAKE,IAAI,CAAC,CAAC,gGAAgG,CAAC;IAClH,MAAMF,KAAKE,IAAI,CAAC;IAChB,KAAK,MAAMC,WAAWhB,eAAec,KAAM,MAAME,QAAQC,MAAM,CAACJ;IAChE,IAAI,AAAC,MAAMX,QAAQW,MAAM,sBAAuB,MAAM,MAAMV,QAAQU,MAAM,kBAAkBF;IAC5F,IAAI,AAAC,MAAMT,QAAQW,MAAM,gBAAiB,MAAM,MAAMV,QAAQU,MAAM,YAAYhB,iBAAiBiB,KAAKb;AACxG;AAWA,eAAeiB,QAAQJ,GAAmB;IACxC,MAAMK,WAAWvB,KAAKkB,IAAIM,OAAO,EAAEtB;IACnCH,UAAUwB,UAAU;QAAEE,WAAW;IAAK;IACtC,MAAMC,SAAS1B,KAAKuB,UAAUT;IAE9B,8FAA8F;IAC9F,gGAAgG;IAChG,2FAA2F;IAC3F,6EAA6E;IAC7E,IAAIa;IACJ,IAAI;QACFA,QAAQ,MAAMhB;IAChB,EAAE,OAAOiB,KAAK;QACZ,IAAIA,eAAezB,YAAY,MAAMyB;QACrC,MAAM,IAAIzB,WAAW,4BAA4B,CAAC,wBAAwB,EAAEO,cAAc,UAAU,EAAE,AAACkB,IAAcC,OAAO,CAAC,CAAC,CAAC;IACjI;IAEA,IAAIC;IACJ,IAAI;QACF,wFAAwF;QACxF,yFAAyF;QACzF,4FAA4F;QAC5F,6FAA6F;QAC7F,+FAA+F;QAC/FA,KAAK,MAAMH,MAAML,OAAO,CAACI,QAAQ;YAAEK,SAAS;QAAO;IACrD,EAAE,OAAOH,KAAK;QACZ,MAAM,IAAIzB,WAAW,4BAA4B,CAAC,6BAA6B,EAAEuB,OAAO,EAAE,EAAE,AAACE,IAAcC,OAAO,EAAE;IACtH;IACA,+FAA+F;IAC/F,4FAA4F;IAC5F,8CAA8C;IAC9C,IAAIG,SAAS;IACb,IAAI;YA0B4B;QAzB9B,MAAMf,OAAOR,iBAAiBqB;QAE9B,MAAMb,KAAKE,IAAI,CAAC;QAEhB,MAAMc,UAAU,MAAM3B,QAAQW,MAAM;QACpC,MAAMiB,WAAW,MAAM5B,QAAQW,MAAM;QACrC,MAAMkB,eAAelC,iBAAiBiB,KAAKb;QAC3C,IAAI,AAAC4B,YAAY,QAAQA,YAAYlB,kBAAoBmB,aAAa,QAAQA,aAAaC,cAAe;YACxG,4FAA4F;YAC5F,4FAA4F;YAC5F,0FAA0F;YAC1F,kFAAkF;YAClF,wFAAwF;YACxF,MAAMC,SAASH,YAAY,QAAQA,YAAYlB,iBAAiB,mDAAmD;YACnHsB,QAAQC,KAAK,CAAC,CAAC,OAAO,EAAEF,OAAO,sBAAsB,CAAC;YACtDJ,SAAS;YACT,MAAMF,GAAGS,KAAK;YACd/B,WAAWU;YACX,OAAOI,QAAQJ;QACjB;QAEA,MAAMF,aAAaC,MAAMC;QAEzB,wFAAwF;QACxF,2FAA2F;QAC3F,MAAMsB,gBAAgBC,QAAQ,OAAA,MAAMnC,QAAQW,MAAM,iCAApB,kBAAA,OAA4C;QAC1E,MAAMA,KAAKE,IAAI,CAAC,CAAC,sBAAsB,EAAEuB,KAAKC,GAAG,CAACD,KAAKE,GAAG,CAAC,OAAO,IAAIJ,gBAAgB,SAAU;QAEhG,MAAM,EAAEK,MAAM,EAAEC,QAAQ,EAAE,GAAG,MAAMlC,UAAUK,MAAMC,KAAKA,IAAIM,OAAO;QAEnE,OAAO;YAAEM;YAAIb;YAAMC;YAAKQ;YAAQmB;YAAQC;QAAS;IACnD,EAAE,OAAOlB,KAAK;QACZ,IAAI,CAACI,QAAQ,MAAMF,GAAGS,KAAK;QAC3B,MAAMX;IACR;AACF;AAEA,gGAAgG;AAChG,qCAAqC;AACrC,OAAO,eAAemB,UAAU7B,GAAmB;IACjD,MAAM,EAAEY,EAAE,EAAEb,IAAI,EAAEC,KAAK8B,WAAW,EAAEtB,MAAM,EAAEmB,MAAM,EAAEC,QAAQ,EAAE,GAAG,MAAMxB,QAAQJ;IAC/E,OAAO;QAAE+B,OAAOpC,YAAYiB,IAAIb,MAAM+B,aAAaA,YAAYxB,OAAO;QAAGN,KAAK8B;QAAatB;QAAQmB;QAAQC;IAAS;AACtH"}

package/dist/esm/store/turso/reconcile.d.ts

@@ -0,0 +1,6 @@
+import type { Config } from '../../config/index.js';
+import type { Connection } from '../types.js';
+export declare function reconcile(conn: Connection, cfg: Config, baseDir: string): Promise<{
+    parsed: number;
+    warnings: string[];
+}>;

package/dist/esm/store/turso/reconcile.js

@@ -0,0 +1,158 @@
+import { SenseError } from '../../errors.js';
+import { activeFeatures } from '../../features/index.js';
+import { progress } from '../../output/progress.js';
+import { listFiles, RESERVED_COLUMNS } from '../../scan/index.js';
+import { reparseFiles } from '../../scan/reparse.js';
+import { getColumns, getMeta, quoteIdent, setMeta } from '../shared.js';
+import { withTransaction } from '../transaction.js';
+// Fork of sqlite/reconcile.ts (house precedent: each store owns its engine-specific SQL), not
+// duckdb's, even though duckdb's content handling is the structurally closer of the two. duckdb
+// dropped sqlite's reconcile_max_ms bookkeeping entirely, and this store's busy timeout (open.ts)
+// is derived from exactly that recorded value -- forking duckdb's file would lose it silently.
+// content itself follows duckdb's shape instead: a plain table, no rowid coupling, no FTS index
+// (phase 2's job, not reconcile's), and no `_seg` sidecars (turso's unspaced-script path is not
+// FTS5-shaped).
+const CORE_FRONTMATTER_COLUMNS = new Set([
+    'path',
+    '_mtime',
+    '_ctime',
+    '_size',
+    '_parse_error'
+]);
+// Not a compile-time cap on ALTER TABLE ADD COLUMN (spike-measured: turso accepts 10,000 with no
+// error). The real fence is a SELECT projecting more than this many result columns, which fails
+// to prepare (spike-measured, both `SELECT *` and an explicit list), so a wide frontmatter table
+// would pass every write silently and only break the first time something selects across it.
+// Enforced here, before ALTER, the same shape as sqlite's compile-time fence.
+const MAX_FRONTMATTER_COLUMNS = 2000;
+// No rowid coupling (unlike sqlite's FTS5 content): `path` is content's own primary key.
+const INSERT_CONTENT_SQL = `INSERT INTO content ("path", title, summary, text) VALUES (?, ?, ?, ?)`;
+function contentRow(doc) {
+    return [
+        doc.relPath,
+        doc.search.title,
+        doc.search.summary,
+        doc.search.text
+    ];
+}
+export async function reconcile(conn, cfg, baseDir) {
+    const files = listFiles(cfg, baseDir);
+    const currentSet = new Set(files.map((f)=>f.relPath));
+    const existingStmt = await conn.prepare('SELECT "path", "_mtime", "_size" FROM frontmatter');
+    const existingRows = await existingStmt.all();
+    const existing = new Map(existingRows.map((r)=>[
+            r.path,
+            r
+        ]));
+    const vanished = existingRows.filter((r)=>!currentSet.has(r.path)).map((r)=>r.path);
+    const toReparse = files.filter((f)=>{
+        const row = existing.get(f.relPath);
+        return !row || row._mtime !== f.mtimeMs || row._size !== f.size;
+    });
+    if (vanished.length === 0 && toReparse.length === 0) return {
+        parsed: 0,
+        warnings: []
+    };
+    const features = activeFeatures(cfg);
+    const seenColumns = await getColumns(conn);
+    // Bulk reparses (a sync, a cold build) are the long silences a query can hit; short
+    // reconciles stay silent (progress() has a threshold).
+    const report = progress('reparsing files', toReparse.length);
+    const { docs: parsedDocs, warnings, newColumns } = await reparseFiles(toReparse, features, cfg, seenColumns, report.tick);
+    report.finish();
+    for (const col of newColumns)seenColumns.add(col);
+    const allColumns = [
+        ...seenColumns
+    ];
+    if (allColumns.length > MAX_FRONTMATTER_COLUMNS) {
+        throw new SenseError('COLUMN_LIMIT', `frontmatter would need ${allColumns.length} columns, crossing turso's SELECT result-set column limit (${MAX_FRONTMATTER_COLUMNS}; ALTER TABLE ADD COLUMN itself accepts far more, but a query projecting past this many columns fails to prepare). Narrow the presets' include globs so fewer/other files are indexed, or fix whatever is generating unbounded frontmatter keys.`);
+    }
+    // Columns the frontmatter upsert actually writes: core + parsed frontmatter keys, never a
+    // feature-owned reserved column (see CORE_FRONTMATTER_COLUMNS above).
+    const writableColumns = allColumns.filter((c)=>CORE_FRONTMATTER_COLUMNS.has(c) || !RESERVED_COLUMNS.has(c));
+    // ON CONFLICT UPDATE (not OR REPLACE) keeps the row's identity stable across reparses.
+    const insertSql = `INSERT INTO frontmatter (${writableColumns.map(quoteIdent).join(', ')}) VALUES (${writableColumns.map(()=>'?').join(', ')}) ON CONFLICT("path") DO UPDATE SET ${writableColumns.filter((c)=>c !== 'path').map((c)=>`${quoteIdent(c)} = excluded.${quoteIdent(c)}`).join(', ')}`;
+    const added = toReparse.filter((f)=>!existing.has(f.relPath)).map((f)=>f.relPath);
+    const delta = {
+        files,
+        reparsed: parsedDocs.map((d)=>d.relPath),
+        added,
+        vanished
+    };
+    const addedSet = new Set(added);
+    const reparsedExisting = parsedDocs.map((d)=>d.relPath).filter((p)=>!addedSet.has(p));
+    const txStart = Date.now();
+    await withTransaction(conn, async ()=>{
+        var _feature_remove, _feature_afterReconcile;
+        for (const col of newColumns)await conn.exec(`ALTER TABLE frontmatter ADD COLUMN ${quoteIdent(col)}`);
+        if (parsedDocs.length > 0) {
+            const rows = parsedDocs.map((doc)=>writableColumns.map((col)=>{
+                    var _doc_data_col;
+                    if (col === 'path') return doc.relPath;
+                    if (col === '_mtime') return doc.mtimeMs;
+                    if (col === '_ctime') return doc.ctimeMs;
+                    if (col === '_size') return doc.size;
+                    // Written per parse, unlike _rank, which a feature pass owns and the upsert skips.
+                    if (col === '_parse_error') return doc.parseError;
+                    return (_doc_data_col = doc.data[col]) !== null && _doc_data_col !== void 0 ? _doc_data_col : null;
+                }));
+            await conn.runBatch(insertSql, rows);
+        }
+        // content is a plain table keyed by its own path (no rowid subquery, unlike sqlite's FTS5
+        // content), so vanished and reparsed docs delete in one pass.
+        const contentTouched = [
+            ...vanished,
+            ...reparsedExisting
+        ];
+        if (contentTouched.length > 0) await conn.runBatch('DELETE FROM content WHERE "path" = ?', contentTouched.map((p)=>[
+                p
+            ]));
+        if (parsedDocs.length > 0) await conn.runBatch(INSERT_CONTENT_SQL, parsedDocs.map(contentRow));
+        if (vanished.length > 0) await conn.runBatch('DELETE FROM frontmatter WHERE "path" = ?', vanished.map((p)=>[
+                p
+            ]));
+        // A preset edit forces a full rebuild, so an unchanged doc's coverage is already correct;
+        // new docs have nothing to clear, which keeps cold builds linear.
+        const presetTouched = [
+            ...vanished,
+            ...reparsedExisting
+        ];
+        if (presetTouched.length > 0) await conn.runBatch('DELETE FROM preset_files WHERE "path" = ?', presetTouched.map((p)=>[
+                p
+            ]));
+        const presetRows = [];
+        for (const doc of parsedDocs)for (const presetName of doc.presets)presetRows.push([
+            doc.relPath,
+            presetName
+        ]);
+        if (presetRows.length > 0) await conn.runBatch('INSERT INTO preset_files ("path", preset) VALUES (?, ?)', presetRows);
+        const removedPaths = [
+            ...vanished,
+            ...reparsedExisting
+        ];
+        if (removedPaths.length > 0) for (const feature of features)await ((_feature_remove = feature.remove) === null || _feature_remove === void 0 ? void 0 : _feature_remove.call(feature, conn, removedPaths, delta));
+        for (const feature of features){
+            var _feature_store;
+            const docsForFeature = parsedDocs.map((doc)=>({
+                    path: doc.relPath,
+                    extracted: doc.extracted[feature.name]
+                }));
+            await ((_feature_store = feature.store) === null || _feature_store === void 0 ? void 0 : _feature_store.call(feature, conn, docsForFeature, delta));
+        }
+        for (const feature of features)await ((_feature_afterReconcile = feature.afterReconcile) === null || _feature_afterReconcile === void 0 ? void 0 : _feature_afterReconcile.call(feature, conn, delta));
+    });
+    // Reconcile's own write-transaction duration, for open()'s derived busy_timeout: keep the
+    // observed max so a big watcher reconcile's lock hold is what the next open bounds its wait
+    // against (the same mechanism sqlite's reconcile records, and the one this store's busy
+    // timeout is derived from).
+    const durationMs = Date.now() - txStart;
+    const prevRaw = await getMeta(conn, 'reconcile_max_ms');
+    // -1, not 0, so a genuinely 0ms first reconcile (sub-millisecond, common on a tiny tree)
+    // still gets recorded instead of losing to the "nothing recorded yet" default.
+    const prevMax = prevRaw === null ? -1 : Number(prevRaw);
+    if (durationMs > prevMax) await setMeta(conn, 'reconcile_max_ms', String(durationMs));
+    return {
+        parsed: parsedDocs.length,
+        warnings
+    };
+}

package/dist/esm/store/turso/reconcile.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["/Users/kevin/Dev/OpenSource/ai/sensemaking/src/store/turso/reconcile.ts"],"sourcesContent":["import type { Config } from '../../config/index.ts';\nimport { SenseError } from '../../errors.ts';\nimport { activeFeatures } from '../../features/index.ts';\nimport type { ExtractedDoc, ReconcileDelta } from '../../features/types.ts';\nimport { progress } from '../../output/progress.ts';\nimport type { ParsedDoc } from '../../scan/index.ts';\nimport { listFiles, RESERVED_COLUMNS } from '../../scan/index.ts';\nimport { reparseFiles } from '../../scan/reparse.ts';\nimport { getColumns, getMeta, quoteIdent, setMeta } from '../shared.ts';\nimport { withTransaction } from '../transaction.ts';\nimport type { Connection } from '../types.ts';\n\n// Fork of sqlite/reconcile.ts (house precedent: each store owns its engine-specific SQL), not\n// duckdb's, even though duckdb's content handling is the structurally closer of the two. duckdb\n// dropped sqlite's reconcile_max_ms bookkeeping entirely, and this store's busy timeout (open.ts)\n// is derived from exactly that recorded value -- forking duckdb's file would lose it silently.\n// content itself follows duckdb's shape instead: a plain table, no rowid coupling, no FTS index\n// (phase 2's job, not reconcile's), and no `_seg` sidecars (turso's unspaced-script path is not\n// FTS5-shaped).\nconst CORE_FRONTMATTER_COLUMNS = new Set(['path', '_mtime', '_ctime', '_size', '_parse_error']);\n\n// Not a compile-time cap on ALTER TABLE ADD COLUMN (spike-measured: turso accepts 10,000 with no\n// error). The real fence is a SELECT projecting more than this many result columns, which fails\n// to prepare (spike-measured, both `SELECT *` and an explicit list), so a wide frontmatter table\n// would pass every write silently and only break the first time something selects across it.\n// Enforced here, before ALTER, the same shape as sqlite's compile-time fence.\nconst MAX_FRONTMATTER_COLUMNS = 2000;\n\n// No rowid coupling (unlike sqlite's FTS5 content): `path` is content's own primary key.\nconst INSERT_CONTENT_SQL = `INSERT INTO content (\"path\", title, summary, text) VALUES (?, ?, ?, ?)`;\n\nfunction contentRow(doc: ParsedDoc): unknown[] {\n  return [doc.relPath, doc.search.title, doc.search.summary, doc.search.text];\n}\n\nexport async function reconcile(conn: Connection, cfg: Config, baseDir: string): Promise<{ parsed: number; warnings: string[] }> {\n  const files = listFiles(cfg, baseDir);\n  const currentSet = new Set(files.map((f) => f.relPath));\n\n  const existingStmt = await conn.prepare('SELECT \"path\", \"_mtime\", \"_size\" FROM frontmatter');\n  const existingRows = (await existingStmt.all()) as Array<{ path: string; _mtime: number; _size: number }>;\n  const existing = new Map(existingRows.map((r) => [r.path, r]));\n  const vanished = existingRows.filter((r) => !currentSet.has(r.path)).map((r) => r.path);\n\n  const toReparse = files.filter((f) => {\n    const row = existing.get(f.relPath);\n    return !row || row._mtime !== f.mtimeMs || row._size !== f.size;\n  });\n\n  if (vanished.length === 0 && toReparse.length === 0) return { parsed: 0, warnings: [] };\n\n  const features = activeFeatures(cfg);\n  const seenColumns = await getColumns(conn);\n\n  // Bulk reparses (a sync, a cold build) are the long silences a query can hit; short\n  // reconciles stay silent (progress() has a threshold).\n  const report = progress('reparsing files', toReparse.length);\n  const { docs: parsedDocs, warnings, newColumns } = await reparseFiles(toReparse, features, cfg, seenColumns, report.tick);\n  report.finish();\n  for (const col of newColumns) seenColumns.add(col);\n\n  const allColumns = [...seenColumns];\n  if (allColumns.length > MAX_FRONTMATTER_COLUMNS) {\n    throw new SenseError(\n      'COLUMN_LIMIT',\n      `frontmatter would need ${allColumns.length} columns, crossing turso's SELECT result-set column limit (${MAX_FRONTMATTER_COLUMNS}; ALTER TABLE ADD COLUMN itself accepts far more, but a query projecting past this many columns fails to prepare). Narrow the presets' include globs so fewer/other files are indexed, or fix whatever is generating unbounded frontmatter keys.`\n    );\n  }\n  // Columns the frontmatter upsert actually writes: core + parsed frontmatter keys, never a\n  // feature-owned reserved column (see CORE_FRONTMATTER_COLUMNS above).\n  const writableColumns = allColumns.filter((c) => CORE_FRONTMATTER_COLUMNS.has(c) || !RESERVED_COLUMNS.has(c));\n  // ON CONFLICT UPDATE (not OR REPLACE) keeps the row's identity stable across reparses.\n  const insertSql = `INSERT INTO frontmatter (${writableColumns.map(quoteIdent).join(', ')}) VALUES (${writableColumns.map(() => '?').join(', ')}) ON CONFLICT(\"path\") DO UPDATE SET ${writableColumns\n    .filter((c) => c !== 'path')\n    .map((c) => `${quoteIdent(c)} = excluded.${quoteIdent(c)}`)\n    .join(', ')}`;\n\n  const added = toReparse.filter((f) => !existing.has(f.relPath)).map((f) => f.relPath);\n  const delta: ReconcileDelta = { files, reparsed: parsedDocs.map((d) => d.relPath), added, vanished };\n  const addedSet = new Set(added);\n  const reparsedExisting = parsedDocs.map((d) => d.relPath).filter((p) => !addedSet.has(p));\n\n  const txStart = Date.now();\n  await withTransaction(conn, async () => {\n    for (const col of newColumns) await conn.exec(`ALTER TABLE frontmatter ADD COLUMN ${quoteIdent(col)}`);\n\n    if (parsedDocs.length > 0) {\n      const rows = parsedDocs.map((doc) =>\n        writableColumns.map((col) => {\n          if (col === 'path') return doc.relPath;\n          if (col === '_mtime') return doc.mtimeMs;\n          if (col === '_ctime') return doc.ctimeMs;\n          if (col === '_size') return doc.size;\n          // Written per parse, unlike _rank, which a feature pass owns and the upsert skips.\n          if (col === '_parse_error') return doc.parseError;\n          return doc.data[col] ?? null;\n        })\n      );\n      await conn.runBatch(insertSql, rows);\n    }\n\n    // content is a plain table keyed by its own path (no rowid subquery, unlike sqlite's FTS5\n    // content), so vanished and reparsed docs delete in one pass.\n    const contentTouched = [...vanished, ...reparsedExisting];\n    if (contentTouched.length > 0)\n      await conn.runBatch(\n        'DELETE FROM content WHERE \"path\" = ?',\n        contentTouched.map((p) => [p])\n      );\n    if (parsedDocs.length > 0) await conn.runBatch(INSERT_CONTENT_SQL, parsedDocs.map(contentRow));\n\n    if (vanished.length > 0)\n      await conn.runBatch(\n        'DELETE FROM frontmatter WHERE \"path\" = ?',\n        vanished.map((p) => [p])\n      );\n\n    // A preset edit forces a full rebuild, so an unchanged doc's coverage is already correct;\n    // new docs have nothing to clear, which keeps cold builds linear.\n    const presetTouched = [...vanished, ...reparsedExisting];\n    if (presetTouched.length > 0)\n      await conn.runBatch(\n        'DELETE FROM preset_files WHERE \"path\" = ?',\n        presetTouched.map((p) => [p])\n      );\n    const presetRows: unknown[][] = [];\n    for (const doc of parsedDocs) for (const presetName of doc.presets) presetRows.push([doc.relPath, presetName]);\n    if (presetRows.length > 0) await conn.runBatch('INSERT INTO preset_files (\"path\", preset) VALUES (?, ?)', presetRows);\n\n    const removedPaths = [...vanished, ...reparsedExisting];\n    if (removedPaths.length > 0) for (const feature of features) await feature.remove?.(conn, removedPaths, delta);\n    for (const feature of features) {\n      const docsForFeature: ExtractedDoc[] = parsedDocs.map((doc) => ({ path: doc.relPath, extracted: doc.extracted[feature.name] }));\n      await feature.store?.(conn, docsForFeature, delta);\n    }\n    for (const feature of features) await feature.afterReconcile?.(conn, delta);\n  });\n\n  // Reconcile's own write-transaction duration, for open()'s derived busy_timeout: keep the\n  // observed max so a big watcher reconcile's lock hold is what the next open bounds its wait\n  // against (the same mechanism sqlite's reconcile records, and the one this store's busy\n  // timeout is derived from).\n  const durationMs = Date.now() - txStart;\n  const prevRaw = await getMeta(conn, 'reconcile_max_ms');\n  // -1, not 0, so a genuinely 0ms first reconcile (sub-millisecond, common on a tiny tree)\n  // still gets recorded instead of losing to the \"nothing recorded yet\" default.\n  const prevMax = prevRaw === null ? -1 : Number(prevRaw);\n  if (durationMs > prevMax) await setMeta(conn, 'reconcile_max_ms', String(durationMs));\n\n  return { parsed: parsedDocs.length, warnings };\n}\n"],"names":["SenseError","activeFeatures","progress","listFiles","RESERVED_COLUMNS","reparseFiles","getColumns","getMeta","quoteIdent","setMeta","withTransaction","CORE_FRONTMATTER_COLUMNS","Set","MAX_FRONTMATTER_COLUMNS","INSERT_CONTENT_SQL","contentRow","doc","relPath","search","title","summary","text","reconcile","conn","cfg","baseDir","files","currentSet","map","f","existingStmt","prepare","existingRows","all","existing","Map","r","path","vanished","filter","has","toReparse","row","get","_mtime","mtimeMs","_size","size","length","parsed","warnings","features","seenColumns","report","docs","parsedDocs","newColumns","tick","finish","col","add","allColumns","writableColumns","c","insertSql","join","added","delta","reparsed","d","addedSet","reparsedExisting","p","txStart","Date","now","feature","exec","rows","ctimeMs","parseError","data","runBatch","contentTouched","presetTouched","presetRows","presetName","presets","push","removedPaths","remove","docsForFeature","extracted","name","store","afterReconcile","durationMs","prevRaw","prevMax","Number","String"],"mappings":"AACA,SAASA,UAAU,QAAQ,kBAAkB;AAC7C,SAASC,cAAc,QAAQ,0BAA0B;AAEzD,SAASC,QAAQ,QAAQ,2BAA2B;AAEpD,SAASC,SAAS,EAAEC,gBAAgB,QAAQ,sBAAsB;AAClE,SAASC,YAAY,QAAQ,wBAAwB;AACrD,SAASC,UAAU,EAAEC,OAAO,EAAEC,UAAU,EAAEC,OAAO,QAAQ,eAAe;AACxE,SAASC,eAAe,QAAQ,oBAAoB;AAGpD,8FAA8F;AAC9F,gGAAgG;AAChG,kGAAkG;AAClG,+FAA+F;AAC/F,gGAAgG;AAChG,gGAAgG;AAChG,gBAAgB;AAChB,MAAMC,2BAA2B,IAAIC,IAAI;IAAC;IAAQ;IAAU;IAAU;IAAS;CAAe;AAE9F,iGAAiG;AACjG,gGAAgG;AAChG,iGAAiG;AACjG,6FAA6F;AAC7F,8EAA8E;AAC9E,MAAMC,0BAA0B;AAEhC,yFAAyF;AACzF,MAAMC,qBAAqB,CAAC,sEAAsE,CAAC;AAEnG,SAASC,WAAWC,GAAc;IAChC,OAAO;QAACA,IAAIC,OAAO;QAAED,IAAIE,MAAM,CAACC,KAAK;QAAEH,IAAIE,MAAM,CAACE,OAAO;QAAEJ,IAAIE,MAAM,CAACG,IAAI;KAAC;AAC7E;AAEA,OAAO,eAAeC,UAAUC,IAAgB,EAAEC,GAAW,EAAEC,OAAe;IAC5E,MAAMC,QAAQvB,UAAUqB,KAAKC;IAC7B,MAAME,aAAa,IAAIf,IAAIc,MAAME,GAAG,CAAC,CAACC,IAAMA,EAAEZ,OAAO;IAErD,MAAMa,eAAe,MAAMP,KAAKQ,OAAO,CAAC;IACxC,MAAMC,eAAgB,MAAMF,aAAaG,GAAG;IAC5C,MAAMC,WAAW,IAAIC,IAAIH,aAAaJ,GAAG,CAAC,CAACQ,IAAM;YAACA,EAAEC,IAAI;YAAED;SAAE;IAC5D,MAAME,WAAWN,aAAaO,MAAM,CAAC,CAACH,IAAM,CAACT,WAAWa,GAAG,CAACJ,EAAEC,IAAI,GAAGT,GAAG,CAAC,CAACQ,IAAMA,EAAEC,IAAI;IAEtF,MAAMI,YAAYf,MAAMa,MAAM,CAAC,CAACV;QAC9B,MAAMa,MAAMR,SAASS,GAAG,CAACd,EAAEZ,OAAO;QAClC,OAAO,CAACyB,OAAOA,IAAIE,MAAM,KAAKf,EAAEgB,OAAO,IAAIH,IAAII,KAAK,KAAKjB,EAAEkB,IAAI;IACjE;IAEA,IAAIT,SAASU,MAAM,KAAK,KAAKP,UAAUO,MAAM,KAAK,GAAG,OAAO;QAAEC,QAAQ;QAAGC,UAAU,EAAE;IAAC;IAEtF,MAAMC,WAAWlD,eAAeuB;IAChC,MAAM4B,cAAc,MAAM9C,WAAWiB;IAErC,oFAAoF;IACpF,uDAAuD;IACvD,MAAM8B,SAASnD,SAAS,mBAAmBuC,UAAUO,MAAM;IAC3D,MAAM,EAAEM,MAAMC,UAAU,EAAEL,QAAQ,EAAEM,UAAU,EAAE,GAAG,MAAMnD,aAAaoC,WAAWU,UAAU3B,KAAK4B,aAAaC,OAAOI,IAAI;IACxHJ,OAAOK,MAAM;IACb,KAAK,MAAMC,OAAOH,WAAYJ,YAAYQ,GAAG,CAACD;IAE9C,MAAME,aAAa;WAAIT;KAAY;IACnC,IAAIS,WAAWb,MAAM,GAAGnC,yBAAyB;QAC/C,MAAM,IAAIb,WACR,gBACA,CAAC,uBAAuB,EAAE6D,WAAWb,MAAM,CAAC,2DAA2D,EAAEnC,wBAAwB,gPAAgP,CAAC;IAEtX;IACA,0FAA0F;IAC1F,sEAAsE;IACtE,MAAMiD,kBAAkBD,WAAWtB,MAAM,CAAC,CAACwB,IAAMpD,yBAAyB6B,GAAG,CAACuB,MAAM,CAAC3D,iBAAiBoC,GAAG,CAACuB;IAC1G,uFAAuF;IACvF,MAAMC,YAAY,CAAC,yBAAyB,EAAEF,gBAAgBlC,GAAG,CAACpB,YAAYyD,IAAI,CAAC,MAAM,UAAU,EAAEH,gBAAgBlC,GAAG,CAAC,IAAM,KAAKqC,IAAI,CAAC,MAAM,oCAAoC,EAAEH,gBAClLvB,MAAM,CAAC,CAACwB,IAAMA,MAAM,QACpBnC,GAAG,CAAC,CAACmC,IAAM,GAAGvD,WAAWuD,GAAG,YAAY,EAAEvD,WAAWuD,IAAI,EACzDE,IAAI,CAAC,OAAO;IAEf,MAAMC,QAAQzB,UAAUF,MAAM,CAAC,CAACV,IAAM,CAACK,SAASM,GAAG,CAACX,EAAEZ,OAAO,GAAGW,GAAG,CAAC,CAACC,IAAMA,EAAEZ,OAAO;IACpF,MAAMkD,QAAwB;QAAEzC;QAAO0C,UAAUb,WAAW3B,GAAG,CAAC,CAACyC,IAAMA,EAAEpD,OAAO;QAAGiD;QAAO5B;IAAS;IACnG,MAAMgC,WAAW,IAAI1D,IAAIsD;IACzB,MAAMK,mBAAmBhB,WAAW3B,GAAG,CAAC,CAACyC,IAAMA,EAAEpD,OAAO,EAAEsB,MAAM,CAAC,CAACiC,IAAM,CAACF,SAAS9B,GAAG,CAACgC;IAEtF,MAAMC,UAAUC,KAAKC,GAAG;IACxB,MAAMjE,gBAAgBa,MAAM;YA+CyCqD,iBAK7BA;QAnDtC,KAAK,MAAMjB,OAAOH,WAAY,MAAMjC,KAAKsD,IAAI,CAAC,CAAC,mCAAmC,EAAErE,WAAWmD,MAAM;QAErG,IAAIJ,WAAWP,MAAM,GAAG,GAAG;YACzB,MAAM8B,OAAOvB,WAAW3B,GAAG,CAAC,CAACZ,MAC3B8C,gBAAgBlC,GAAG,CAAC,CAAC+B;wBAOZ3C;oBANP,IAAI2C,QAAQ,QAAQ,OAAO3C,IAAIC,OAAO;oBACtC,IAAI0C,QAAQ,UAAU,OAAO3C,IAAI6B,OAAO;oBACxC,IAAIc,QAAQ,UAAU,OAAO3C,IAAI+D,OAAO;oBACxC,IAAIpB,QAAQ,SAAS,OAAO3C,IAAI+B,IAAI;oBACpC,mFAAmF;oBACnF,IAAIY,QAAQ,gBAAgB,OAAO3C,IAAIgE,UAAU;oBACjD,QAAOhE,gBAAAA,IAAIiE,IAAI,CAACtB,IAAI,cAAb3C,2BAAAA,gBAAiB;gBAC1B;YAEF,MAAMO,KAAK2D,QAAQ,CAAClB,WAAWc;QACjC;QAEA,0FAA0F;QAC1F,8DAA8D;QAC9D,MAAMK,iBAAiB;eAAI7C;eAAaiC;SAAiB;QACzD,IAAIY,eAAenC,MAAM,GAAG,GAC1B,MAAMzB,KAAK2D,QAAQ,CACjB,wCACAC,eAAevD,GAAG,CAAC,CAAC4C,IAAM;gBAACA;aAAE;QAEjC,IAAIjB,WAAWP,MAAM,GAAG,GAAG,MAAMzB,KAAK2D,QAAQ,CAACpE,oBAAoByC,WAAW3B,GAAG,CAACb;QAElF,IAAIuB,SAASU,MAAM,GAAG,GACpB,MAAMzB,KAAK2D,QAAQ,CACjB,4CACA5C,SAASV,GAAG,CAAC,CAAC4C,IAAM;gBAACA;aAAE;QAG3B,0FAA0F;QAC1F,kEAAkE;QAClE,MAAMY,gBAAgB;eAAI9C;eAAaiC;SAAiB;QACxD,IAAIa,cAAcpC,MAAM,GAAG,GACzB,MAAMzB,KAAK2D,QAAQ,CACjB,6CACAE,cAAcxD,GAAG,CAAC,CAAC4C,IAAM;gBAACA;aAAE;QAEhC,MAAMa,aAA0B,EAAE;QAClC,KAAK,MAAMrE,OAAOuC,WAAY,KAAK,MAAM+B,cAActE,IAAIuE,OAAO,CAAEF,WAAWG,IAAI,CAAC;YAACxE,IAAIC,OAAO;YAAEqE;SAAW;QAC7G,IAAID,WAAWrC,MAAM,GAAG,GAAG,MAAMzB,KAAK2D,QAAQ,CAAC,2DAA2DG;QAE1G,MAAMI,eAAe;eAAInD;eAAaiC;SAAiB;QACvD,IAAIkB,aAAazC,MAAM,GAAG,GAAG,KAAK,MAAM4B,WAAWzB,SAAU,QAAMyB,kBAAAA,QAAQc,MAAM,cAAdd,sCAAAA,qBAAAA,SAAiBrD,MAAMkE,cAActB;QACxG,KAAK,MAAMS,WAAWzB,SAAU;gBAExByB;YADN,MAAMe,iBAAiCpC,WAAW3B,GAAG,CAAC,CAACZ,MAAS,CAAA;oBAAEqB,MAAMrB,IAAIC,OAAO;oBAAE2E,WAAW5E,IAAI4E,SAAS,CAAChB,QAAQiB,IAAI,CAAC;gBAAC,CAAA;YAC5H,QAAMjB,iBAAAA,QAAQkB,KAAK,cAAblB,qCAAAA,oBAAAA,SAAgBrD,MAAMoE,gBAAgBxB;QAC9C;QACA,KAAK,MAAMS,WAAWzB,SAAU,QAAMyB,0BAAAA,QAAQmB,cAAc,cAAtBnB,8CAAAA,6BAAAA,SAAyBrD,MAAM4C;IACvE;IAEA,0FAA0F;IAC1F,4FAA4F;IAC5F,wFAAwF;IACxF,4BAA4B;IAC5B,MAAM6B,aAAatB,KAAKC,GAAG,KAAKF;IAChC,MAAMwB,UAAU,MAAM1F,QAAQgB,MAAM;IACpC,yFAAyF;IACzF,+EAA+E;IAC/E,MAAM2E,UAAUD,YAAY,OAAO,CAAC,IAAIE,OAAOF;IAC/C,IAAID,aAAaE,SAAS,MAAMzF,QAAQc,MAAM,oBAAoB6E,OAAOJ;IAEzE,OAAO;QAAE/C,QAAQM,WAAWP,MAAM;QAAEE;IAAS;AAC/C"}

package/dist/esm/store/turso/store.d.ts

@@ -0,0 +1,5 @@
+import type { Database } from '@tursodatabase/database';
+import type { Config } from '../../config/index.js';
+import type { Capability, Connection, Store } from '../types.js';
+export declare const CAPABILITIES: ReadonlySet<Capability>;
+export declare function createStore(db: Database, conn: Connection, cfg: Config, baseDir: string): Store;