@nicia-ai/typegraph 0.43.0 → 0.45.0

package/dist/{chunk-FY4VY5EV.cjs → chunk-VVQM4CZD.cjs}

@@ -1,10 +1,10 @@
 'use strict';
 
-var chunkF2KVJ6FF_cjs = require('./chunk-F2KVJ6FF.cjs');
-var chunkFFQGI67R_cjs = require('./chunk-FFQGI67R.cjs');
-var chunkOMQ2NBOR_cjs = require('./chunk-OMQ2NBOR.cjs');
-var chunkECU53PMN_cjs = require('./chunk-ECU53PMN.cjs');
-var chunkKTBTSHU6_cjs = require('./chunk-KTBTSHU6.cjs');
+var chunkP7GTYOLB_cjs = require('./chunk-P7GTYOLB.cjs');
+var chunkNAAMUYMS_cjs = require('./chunk-NAAMUYMS.cjs');
+var chunkZ3WO6MND_cjs = require('./chunk-Z3WO6MND.cjs');
+var chunkEKFUG4G7_cjs = require('./chunk-EKFUG4G7.cjs');
+var chunkC4F7VJ5D_cjs = require('./chunk-C4F7VJ5D.cjs');
 var module$1 = require('module');
 var Database = require('better-sqlite3');
 var betterSqlite3 = require('drizzle-orm/better-sqlite3');
@@ -25,7 +25,7 @@ var DEFAULT_LOCAL_SQLITE_PRAGMAS = {
 };
 
 // src/backend/sqlite/local.ts
-var nodeRequire = module$1.createRequire((typeof document === 'undefined' ? require('u' + 'rl').pathToFileURL(__filename).href : (_documentCurrentScript && _documentCurrentScript.tagName.toUpperCase() === 'SCRIPT' && _documentCurrentScript.src || new URL('chunk-FY4VY5EV.cjs', document.baseURI).href)));
+var nodeRequire = module$1.createRequire((typeof document === 'undefined' ? require('u' + 'rl').pathToFileURL(__filename).href : (_documentCurrentScript && _documentCurrentScript.tagName.toUpperCase() === 'SCRIPT' && _documentCurrentScript.src || new URL('chunk-VVQM4CZD.cjs', document.baseURI).href)));
 function getUnknownErrorMessage(error) {
   if (error instanceof Error) return error.message;
   return String(error);
@@ -47,7 +47,7 @@ function createDatabase(path) {
     const message = getUnknownErrorMessage(error);
     const mismatch = parseNodeModuleVersionMismatchMessage(message);
     if (!mismatch) throw error;
-    throw new chunkKTBTSHU6_cjs.ConfigurationError(
+    throw new chunkC4F7VJ5D_cjs.ConfigurationError(
       [
         "Failed to load better-sqlite3 native addon.",
         `It was compiled for NODE_MODULE_VERSION ${mismatch.compiled}, but this Node.js runtime requires ${mismatch.required}.`,
@@ -86,37 +86,37 @@ function applyConnectionPragmas(sqlite, pragmas) {
     ...pragmas
   };
   if (!LOCAL_SQLITE_JOURNAL_MODES.includes(resolved.journalMode)) {
-    throw new chunkKTBTSHU6_cjs.ConfigurationError(
+    throw new chunkC4F7VJ5D_cjs.ConfigurationError(
       `Invalid journalMode pragma: ${resolved.journalMode}. Expected one of: ${LOCAL_SQLITE_JOURNAL_MODES.join(", ")}.`,
       { journalMode: resolved.journalMode }
     );
   }
   if (!LOCAL_SQLITE_SYNCHRONOUS_MODES.includes(resolved.synchronous)) {
-    throw new chunkKTBTSHU6_cjs.ConfigurationError(
+    throw new chunkC4F7VJ5D_cjs.ConfigurationError(
       `Invalid synchronous pragma: ${resolved.synchronous}. Expected one of: ${LOCAL_SQLITE_SYNCHRONOUS_MODES.join(", ")}.`,
       { synchronous: resolved.synchronous }
     );
   }
   if (!Number.isSafeInteger(resolved.busyTimeoutMs) || resolved.busyTimeoutMs < 0) {
-    throw new chunkKTBTSHU6_cjs.ConfigurationError(
+    throw new chunkC4F7VJ5D_cjs.ConfigurationError(
       `Invalid busyTimeoutMs pragma: ${String(resolved.busyTimeoutMs)}. Expected a non-negative integer number of milliseconds.`,
       { busyTimeoutMs: resolved.busyTimeoutMs }
     );
   }
   if (resolved.cacheSizeKib !== void 0 && (!Number.isSafeInteger(resolved.cacheSizeKib) || resolved.cacheSizeKib >= 0)) {
-    throw new chunkKTBTSHU6_cjs.ConfigurationError(
+    throw new chunkC4F7VJ5D_cjs.ConfigurationError(
       `Invalid cacheSizeKib pragma: ${String(resolved.cacheSizeKib)}. Expected a negative safe integer \u2014 SQLite's own cache_size pragma interprets a positive value as a page count, not KiB, so a caller who passes e.g. 131072 meaning "131072 KiB" silently gets 131072 pages (~512MiB at the default 4KiB page size) instead.`,
       { cacheSizeKib: resolved.cacheSizeKib }
     );
   }
   if (resolved.mmapSizeBytes !== void 0 && (!Number.isSafeInteger(resolved.mmapSizeBytes) || resolved.mmapSizeBytes < 0)) {
-    throw new chunkKTBTSHU6_cjs.ConfigurationError(
+    throw new chunkC4F7VJ5D_cjs.ConfigurationError(
       `Invalid mmapSizeBytes pragma: ${String(resolved.mmapSizeBytes)}. Expected a non-negative safe integer number of bytes.`,
       { mmapSizeBytes: resolved.mmapSizeBytes }
     );
   }
   if (resolved.walAutocheckpointPages !== void 0 && (!Number.isSafeInteger(resolved.walAutocheckpointPages) || resolved.walAutocheckpointPages < 0 || resolved.walAutocheckpointPages > SQLITE_MAX_WAL_AUTOCHECKPOINT_PAGES)) {
-    throw new chunkKTBTSHU6_cjs.ConfigurationError(
+    throw new chunkC4F7VJ5D_cjs.ConfigurationError(
       `Invalid walAutocheckpointPages pragma: ${String(resolved.walAutocheckpointPages)}. Expected an integer between 0 and ${SQLITE_MAX_WAL_AUTOCHECKPOINT_PAGES} WAL pages (0 disables automatic checkpointing entirely).`,
       { walAutocheckpointPages: resolved.walAutocheckpointPages }
     );
@@ -136,22 +136,22 @@ function applyConnectionPragmas(sqlite, pragmas) {
 }
 function createLocalSqliteBackend(options = {}) {
   const path = options.path ?? ":memory:";
-  const tables2 = options.tables ?? chunkOMQ2NBOR_cjs.tables2;
+  const tables2 = options.tables ?? chunkZ3WO6MND_cjs.tables2;
   const sqlite = createDatabase(path);
   try {
     applyConnectionPragmas(sqlite, options.pragmas);
     const hasSqliteVec = tryLoadSqliteVec(sqlite);
     const db = betterSqlite3.drizzle(sqlite);
-    const ddlStatements = chunkOMQ2NBOR_cjs.generateSqliteDDL(tables2);
+    const ddlStatements = chunkZ3WO6MND_cjs.generateSqliteDDL(tables2);
     for (const statement of ddlStatements) {
       sqlite.exec(statement);
     }
-    const backend = chunkF2KVJ6FF_cjs.createSqliteBackend(db, {
+    const backend = chunkP7GTYOLB_cjs.createSqliteBackend(db, {
       executionProfile: {
         isSync: true
       },
       tables: tables2,
-      ...hasSqliteVec ? { vector: chunkFFQGI67R_cjs.sqliteVecStrategy } : {},
+      ...hasSqliteVec ? { vector: chunkNAAMUYMS_cjs.sqliteVecStrategy } : {},
       capabilities: {
         ...options.capabilities,
         graphAnalytics: {
@@ -160,7 +160,7 @@ function createLocalSqliteBackend(options = {}) {
         }
       }
     });
-    const managedBackend = chunkECU53PMN_cjs.wrapWithManagedClose(backend, () => {
+    const managedBackend = chunkEKFUG4G7_cjs.wrapWithManagedClose(backend, () => {
       sqlite.close();
     });
     return { backend: managedBackend, db };
@@ -187,5 +187,5 @@ function tryLoadSqliteVec(sqlite) {
 
 exports.DEFAULT_LOCAL_SQLITE_PRAGMAS = DEFAULT_LOCAL_SQLITE_PRAGMAS;
 exports.createLocalSqliteBackend = createLocalSqliteBackend;
-//# sourceMappingURL=chunk-FY4VY5EV.cjs.map
-//# sourceMappingURL=chunk-FY4VY5EV.cjs.map
+//# sourceMappingURL=chunk-VVQM4CZD.cjs.map
+//# sourceMappingURL=chunk-VVQM4CZD.cjs.map

package/dist/chunk-VVQM4CZD.cjs.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/backend/sqlite/local-options.ts","../src/backend/sqlite/local.ts"],"names":["createRequire","Database","ConfigurationError","tables","drizzle","generateSqliteDDL","createSqliteBackend","sqliteVecStrategy","wrapWithManagedClose"],"mappings":";;;;;;;;;;;;;;;;;AA8BO,IAAM,4BAAA,GACX;AAAA,EACE,WAAA,EAAa,KAAA;AAAA,EACb,WAAA,EAAa,QAAA;AAAA,EACb,aAAA,EAAe,GAAA;AAAA,EACf,YAAA,EAAc,MAAA;AAAA,EACd,aAAA,EAAe,MAAA;AAAA,EACf,sBAAA,EAAwB;AAC1B;;;AC6BF,IAAM,WAAA,GAAcA,sBAAA,CAAc,oQAAe,CAAA;AAWjD,SAAS,uBAAuB,KAAA,EAAwB;AACtD,EAAA,IAAI,KAAA,YAAiB,KAAA,EAAO,OAAO,KAAA,CAAM,OAAA;AACzC,EAAA,OAAO,OAAO,KAAK,CAAA;AACrB;AAEA,SAAS,sCACP,OAAA,EACuC;AACvC,EAAA,MAAM,MAAA,GACJ,kFAAA;AACF,EAAA,MAAM,KAAA,GAAQ,MAAA,CAAO,IAAA,CAAK,OAAO,CAAA;AACjC,EAAA,IAAI,CAAC,KAAA,EAAO,MAAA,EAAQ,OAAO,MAAA;AAE3B,EAAA,MAAM,QAAA,GAAW,MAAA,CAAO,KAAA,CAAM,MAAA,CAAO,UAAU,CAAC,CAAA;AAChD,EAAA,MAAM,QAAA,GAAW,MAAA,CAAO,KAAA,CAAM,MAAA,CAAO,UAAU,CAAC,CAAA;AAEhD,EAAA,IAAI,CAAC,OAAO,QAAA,CAAS,QAAQ,KAAK,CAAC,MAAA,CAAO,SAAS,QAAQ,CAAA;AACzD,IAAA,OAAO,MAAA;AAET,EAAA,OAAO,EAAE,UAAU,QAAA,EAAS;AAC9B;AAEA,SAAS,eAAe,IAAA,EAAiC;AACvD,EAAA,IAAI;AACF,IAAA,OAAO,IAAIC,0BAAS,IAAI,CAAA;AAAA,EAC1B,SAAS,KAAA,EAAO;AACd,IAAA,MAAM,OAAA,GAAU,uBAAuB,KAAK,CAAA;AAC5C,IAAA,MAAM,QAAA,GAAW,sCAAsC,OAAO,CAAA;AAC9D,IAAA,IAAI,CAAC,UAAU,MAAM,KAAA;AAErB,IAAA,MAAM,IAAIC,oCAAA;AAAA,MACR;AAAA,QACE,6CAAA;AAAA,QACA,CAAA,wCAAA,EAA2C,QAAA,CAAS,QAAQ,CAAA,oCAAA,EAAuC,SAAS,QAAQ,CAAA,CAAA,CAAA;AAAA,QACpH,4FAAA;AAAA,QACA;AAAA,OACF,CAAE,KAAK,GAAG,CAAA;AAAA,MACV;AAAA,QACE,aAAa,OAAA,CAAQ,OAAA;AAAA,QACrB,iBAAA,EAAmB,QAAQ,QAAA,CAAS,OAAA;AAAA,QACpC,2BAA2B,QAAA,CAAS,QAAA;AAAA,QACpC,2BAA2B,QAAA,CAAS;AAAA,OACtC;AAAA,MACA,EAAE,OAAO,KAAA;AAAM,KACjB;AAAA,EACF;AACF;AAMA,IAAM,0BAAA,GAAgE;AAAA,EACpE,KAAA;AAAA,EACA,QAAA;AAAA,EACA,UAAA;AAAA,EACA,SAAA;AAAA,EACA,QAAA;AAAA,EACA;AACF,CAAA;AAEA,IAAM,8BAAA,GAAwE;AAAA,EAC5E,KAAA;AAAA,EACA,QAAA;AAAA,EACA,MAAA;AAAA,EACA;AACF,CAAA;AAEA,IAAM,mCAAA,GAAsC,UAAA;AAE5C,SAAS,sBAAA,CACP,QACA,OAAA,EACM;AACN,EAAA,IAAI,YAAY,KAAA,EAAO;AACvB,EAAA,MAAM,QAAA,GAA+C;AAAA,IACnD,GAAG,4BAAA;AAAA,IACH,GAAG;AAAA,GACL;AAKA,EAAA,IAAI,CAAC,0BAAA,CAA2B,QAAA,CAAS,QAAA,CAAS,WAAW,CAAA,EAAG;AAC9D,IAAA,MAAM,IAAIA,oCAAA;AAAA,MACR,+BAA+B,QAAA,CAAS,WAAW,sBAC7B,0BAAA,CAA2B,IAAA,CAAK,IAAI,CAAC,CAAA,CAAA,CAAA;AAAA,MAC3D,EAAE,WAAA,EAAa,QAAA,CAAS,WAAA;AAAY,KACtC;AAAA,EACF;AACA,EAAA,IAAI,CAAC,8BAAA,CAA+B,QAAA,CAAS,QAAA,CAAS,WAAW,CAAA,EAAG;AAClE,IAAA,MAAM,IAAIA,oCAAA;AAAA,MACR,+BAA+B,QAAA,CAAS,WAAW,sBAC7B,8BAAA,CAA+B,IAAA,CAAK,IAAI,CAAC,CAAA,CAAA,CAAA;AAAA,MAC/D,EAAE,WAAA,EAAa,QAAA,CAAS,WAAA;AAAY,KACtC;AAAA,EACF;AACA,EAAA,IACE,CAAC,OAAO,aAAA,CAAc,QAAA,CAAS,aAAa,CAAA,IAC5C,QAAA,CAAS,gBAAgB,CAAA,EACzB;AACA,IAAA,MAAM,IAAIA,oCAAA;AAAA,MACR,CAAA,8BAAA,EAAiC,MAAA,CAAO,QAAA,CAAS,aAAa,CAAC,CAAA,yDAAA,CAAA;AAAA,MAE/D,EAAE,aAAA,EAAe,QAAA,CAAS,aAAA;AAAc,KAC1C;AAAA,EACF;AACA,EAAA,IACE,QAAA,CAAS,YAAA,KAAiB,MAAA,KACzB,CAAC,MAAA,CAAO,aAAA,CAAc,QAAA,CAAS,YAAY,CAAA,IAAK,QAAA,CAAS,YAAA,IAAgB,CAAA,CAAA,EAC1E;AACA,IAAA,MAAM,IAAIA,oCAAA;AAAA,MACR,CAAA,6BAAA,EAAgC,MAAA,CAAO,QAAA,CAAS,YAAY,CAAC,CAAA,kQAAA,CAAA;AAAA,MAK7D,EAAE,YAAA,EAAc,QAAA,CAAS,YAAA;AAAa,KACxC;AAAA,EACF;AACA,EAAA,IACE,QAAA,CAAS,aAAA,KAAkB,MAAA,KAC1B,CAAC,MAAA,CAAO,aAAA,CAAc,QAAA,CAAS,aAAa,CAAA,IAC3C,QAAA,CAAS,aAAA,GAAgB,CAAA,CAAA,EAC3B;AACA,IAAA,MAAM,IAAIA,oCAAA;AAAA,MACR,CAAA,8BAAA,EAAiC,MAAA,CAAO,QAAA,CAAS,aAAa,CAAC,CAAA,uDAAA,CAAA;AAAA,MAE/D,EAAE,aAAA,EAAe,QAAA,CAAS,aAAA;AAAc,KAC1C;AAAA,EACF;AACA,EAAA,IACE,QAAA,CAAS,sBAAA,KAA2B,MAAA,KACnC,CAAC,OAAO,aAAA,CAAc,QAAA,CAAS,sBAAsB,CAAA,IACpD,QAAA,CAAS,sBAAA,GAAyB,CAAA,IAClC,QAAA,CAAS,yBAAyB,mCAAA,CAAA,EACpC;AACA,IAAA,MAAM,IAAIA,oCAAA;AAAA,MACR,0CAA0C,MAAA,CAAO,QAAA,CAAS,sBAAsB,CAAC,uCAC1C,mCAAmC,CAAA,yDAAA,CAAA;AAAA,MAE1E,EAAE,sBAAA,EAAwB,QAAA,CAAS,sBAAA;AAAuB,KAC5D;AAAA,EACF;AAIA,EAAA,MAAA,CAAO,MAAA,CAAO,CAAA,eAAA,EAAkB,QAAA,CAAS,WAAW,CAAA,CAAE,CAAA;AACtD,EAAA,MAAA,CAAO,MAAA,CAAO,CAAA,cAAA,EAAiB,QAAA,CAAS,WAAW,CAAA,CAAE,CAAA;AACrD,EAAA,MAAA,CAAO,MAAA,CAAO,CAAA,eAAA,EAAkB,QAAA,CAAS,aAAa,CAAA,CAAE,CAAA;AACxD,EAAA,IAAI,QAAA,CAAS,iBAAiB,MAAA,EAAW;AACvC,IAAA,MAAA,CAAO,MAAA,CAAO,CAAA,aAAA,EAAgB,QAAA,CAAS,YAAY,CAAA,CAAE,CAAA;AAAA,EACvD;AACA,EAAA,IAAI,QAAA,CAAS,kBAAkB,MAAA,EAAW;AACxC,IAAA,MAAA,CAAO,MAAA,CAAO,CAAA,YAAA,EAAe,QAAA,CAAS,aAAa,CAAA,CAAE,CAAA;AAAA,EACvD;AACA,EAAA,IAAI,QAAA,CAAS,2BAA2B,MAAA,EAAW;AACjD,IAAA,MAAA,CAAO,MAAA,CAAO,CAAA,qBAAA,EAAwB,QAAA,CAAS,sBAAsB,CAAA,CAAE,CAAA;AAAA,EACzE;AACF;AAuFO,SAAS,wBAAA,CACd,OAAA,GAAqC,EAAC,EACZ;AAC1B,EAAA,MAAM,IAAA,GAAO,QAAQ,IAAA,IAAQ,UAAA;AAC7B,EAAA,MAAMC,OAAAA,GAAS,QAAQ,MAAA,IAAUA,yBAAA;AAEjC,EAAA,MAAM,MAAA,GAAS,eAAe,IAAI,CAAA;AAClC,EAAA,IAAI;AACF,IAAA,sBAAA,CAAuB,MAAA,EAAQ,QAAQ,OAAO,CAAA;AAO9C,IAAA,MAAM,YAAA,GAAe,iBAAiB,MAAM,CAAA;AAE5C,IAAA,MAAM,EAAA,GAAKC,sBAAQ,MAAM,CAAA;AAGzB,IAAA,MAAM,aAAA,GAAgBC,oCAAkBF,OAAM,CAAA;AAC9C,IAAA,KAAA,MAAW,aAAa,aAAA,EAAe;AACrC,MAAA,MAAA,CAAO,KAAK,SAAS,CAAA;AAAA,IACvB;AAEA,IAAA,MAAM,OAAA,GAAUG,sCAAoB,EAAA,EAAI;AAAA,MACtC,gBAAA,EAAkB;AAAA,QAChB,MAAA,EAAQ;AAAA,OACV;AAAA,MACA,MAAA,EAAAH,OAAAA;AAAA,MACA,GAAI,YAAA,GAAe,EAAE,MAAA,EAAQI,mCAAA,KAAsB,EAAC;AAAA,MACpD,YAAA,EAAc;AAAA,QACZ,GAAG,OAAA,CAAQ,YAAA;AAAA,QACX,cAAA,EAAgB;AAAA,UACd,WACE,OAAA,CAAQ,YAAA,EAAc,gBAAgB,SAAA,IACtC,OAAA,CAAQ,cAAc,YAAA,KAAiB,KAAA;AAAA,UACzC,aAAA,EACE,OAAA,CAAQ,YAAA,EAAc,cAAA,EAAgB,aAAA,IAAiB;AAAA;AAC3D;AACF,KACD,CAAA;AACD,IAAA,MAAM,cAAA,GAAiBC,sCAAA,CAAqB,OAAA,EAAS,MAAM;AACzD,MAAA,MAAA,CAAO,KAAA,EAAM;AAAA,IACf,CAAC,CAAA;AAED,IAAA,OAAO,EAAE,OAAA,EAAS,cAAA,EAAgB,EAAA,EAAG;AAAA,EACvC,SAAS,KAAA,EAAO;AACd,IAAA,IAAI;AACF,MAAA,MAAA,CAAO,KAAA,EAAM;AAAA,IACf,CAAA,CAAA,MAAQ;AAAA,IAER;AACA,IAAA,MAAM,KAAA;AAAA,EACR;AACF;AAEA,SAAS,iBAAiB,MAAA,EAAoC;AAC5D,EAAA,IAAI;AAIF,IAAA,MAAM,OAAA,GAAmB,YAAY,YAAY,CAAA;AACjD,IAAA,IACE,OAAO,OAAA,KAAY,QAAA,IACnB,OAAA,KAAY,IAAA,IACZ,UAAU,OAAA,IACV,OAAO,OAAA,CAAQ,IAAA,KAAS,UAAA,EACxB;AACA,MAAC,OAAA,CAAsD,KAAK,MAAM,CAAA;AAClE,MAAA,OAAO,IAAA;AAAA,IACT;AACA,IAAA,OAAO,KAAA;AAAA,EACT,CAAA,CAAA,MAAQ;AACN,IAAA,OAAO,KAAA;AAAA,EACT;AACF","file":"chunk-VVQM4CZD.cjs","sourcesContent":["/** Journal modes accepted by local SQLite connections. */\nexport type LocalSqliteJournalMode =\n  \"wal\" | \"delete\" | \"truncate\" | \"persist\" | \"memory\" | \"off\";\n\n/** Synchronous levels accepted by local SQLite connections. */\nexport type LocalSqliteSynchronousMode = \"off\" | \"normal\" | \"full\" | \"extra\";\n\n/** Connection pragmas applied when TypeGraph opens a local SQLite database. */\nexport type LocalSqlitePragmaOptions = Readonly<{\n  /** `PRAGMA journal_mode`. Default: `\"wal\"` (no-op on `\":memory:\"`). */\n  journalMode?: LocalSqliteJournalMode;\n  /** `PRAGMA synchronous`. Default: `\"normal\"`. */\n  synchronous?: LocalSqliteSynchronousMode;\n  /** `PRAGMA busy_timeout`, in milliseconds. Default: `5000`. */\n  busyTimeoutMs?: number;\n  /**\n   * `PRAGMA cache_size`, expressed as a negative KiB value. Positive values\n   * mean pages in SQLite and are rejected to prevent accidental oversizing.\n   */\n  cacheSizeKib?: number | undefined;\n  /** `PRAGMA mmap_size`, in non-negative bytes. */\n  mmapSizeBytes?: number | undefined;\n  /**\n   * `PRAGMA wal_autocheckpoint`, in WAL pages. Use `0` to disable automatic\n   * checkpoints and run them explicitly after controlled bulk loads.\n   */\n  walAutocheckpointPages?: number | undefined;\n}>;\n\n/** Defaults for TypeGraph-owned local SQLite connections. */\nexport const DEFAULT_LOCAL_SQLITE_PRAGMAS: Required<LocalSqlitePragmaOptions> =\n  {\n    journalMode: \"wal\",\n    synchronous: \"normal\",\n    busyTimeoutMs: 5000,\n    cacheSizeKib: undefined,\n    mmapSizeBytes: undefined,\n    walAutocheckpointPages: undefined,\n  };\n","/**\n * Local SQLite backend using better-sqlite3.\n *\n * This module depends on the `better-sqlite3` native addon and should only\n * be imported in Node.js environments. For bundler-friendly SQLite DDL\n * generation and Drizzle backend creation, import from `@nicia-ai/typegraph/adapters/drizzle/sqlite`.\n *\n * @example In-memory database (default)\n * ```typescript\n * import { createLocalSqliteBackend } from \"@nicia-ai/typegraph/adapters/drizzle/sqlite/local\";\n *\n * const { backend, db } = createLocalSqliteBackend();\n * const store = createStore(graph, backend);\n * ```\n *\n * @example File-based database for persistent local development\n * ```typescript\n * import { createLocalSqliteBackend } from \"@nicia-ai/typegraph/adapters/drizzle/sqlite/local\";\n *\n * const { backend, db } = createLocalSqliteBackend({ path: \"./dev.db\" });\n * const store = createStore(graph, backend);\n * ```\n */\nimport { createRequire } from \"node:module\";\n\nimport Database from \"better-sqlite3\";\nimport {\n  type BetterSQLite3Database,\n  drizzle,\n} from \"drizzle-orm/better-sqlite3\";\n\nimport { ConfigurationError } from \"../../errors\";\nimport { sqliteVecStrategy } from \"../../query/dialect/vector/sqlite-vec-strategy\";\nimport { generateSqliteDDL } from \"../drizzle/ddl\";\nimport { type AnySqliteDatabase } from \"../drizzle/execution\";\nexport type { AnySqliteDatabase } from \"../drizzle/execution\";\nimport {\n  createSqliteBackend,\n  type SqliteTables,\n  tables as defaultTables,\n} from \"../drizzle/sqlite\";\nimport {\n  DEFAULT_LOCAL_SQLITE_PRAGMAS,\n  type LocalSqliteJournalMode,\n  type LocalSqlitePragmaOptions,\n  type LocalSqliteSynchronousMode,\n} from \"./local-options\";\n\nexport {\n  DEFAULT_LOCAL_SQLITE_PRAGMAS,\n  type LocalSqliteJournalMode,\n  type LocalSqlitePragmaOptions,\n  type LocalSqliteSynchronousMode,\n} from \"./local-options\";\nimport {\n  type AdapterBackend,\n  type BackendCapabilities,\n  wrapWithManagedClose,\n} from \"../types\";\n\nexport type {\n  ContributionDiagnostic,\n  ContributionDiagnosticState,\n  ContributionRepairEntry,\n  ContributionRepairResult,\n} from \"../types\";\n\nconst nodeRequire = createRequire(import.meta.url);\n\n// ============================================================\n// Native Addon Helpers\n// ============================================================\n\ntype NodeModuleVersionMismatch = Readonly<{\n  compiled: number;\n  required: number;\n}>;\n\nfunction getUnknownErrorMessage(error: unknown): string {\n  if (error instanceof Error) return error.message;\n  return String(error);\n}\n\nfunction parseNodeModuleVersionMismatchMessage(\n  message: string,\n): NodeModuleVersionMismatch | undefined {\n  const regexp =\n    /NODE_MODULE_VERSION (?<compiled>\\d+)[\\s\\S]*?NODE_MODULE_VERSION (?<required>\\d+)/;\n  const match = regexp.exec(message);\n  if (!match?.groups) return undefined;\n\n  const compiled = Number(match.groups[\"compiled\"]);\n  const required = Number(match.groups[\"required\"]);\n\n  if (!Number.isFinite(compiled) || !Number.isFinite(required))\n    return undefined;\n\n  return { compiled, required };\n}\n\nfunction createDatabase(path: string): Database.Database {\n  try {\n    return new Database(path);\n  } catch (error) {\n    const message = getUnknownErrorMessage(error);\n    const mismatch = parseNodeModuleVersionMismatchMessage(message);\n    if (!mismatch) throw error;\n\n    throw new ConfigurationError(\n      [\n        \"Failed to load better-sqlite3 native addon.\",\n        `It was compiled for NODE_MODULE_VERSION ${mismatch.compiled}, but this Node.js runtime requires ${mismatch.required}.`,\n        \"This usually happens after switching Node versions without rebuilding native dependencies.\",\n        \"Rebuild with: pnpm rebuild better-sqlite3 (or npm rebuild better-sqlite3).\",\n      ].join(\" \"),\n      {\n        nodeVersion: process.version,\n        nodeModuleVersion: process.versions.modules,\n        compiledNodeModuleVersion: mismatch.compiled,\n        requiredNodeModuleVersion: mismatch.required,\n      },\n      { cause: error },\n    );\n  }\n}\n\n// ============================================================\n// Types\n// ============================================================\n\nconst LOCAL_SQLITE_JOURNAL_MODES: readonly LocalSqliteJournalMode[] = [\n  \"wal\",\n  \"delete\",\n  \"truncate\",\n  \"persist\",\n  \"memory\",\n  \"off\",\n];\n\nconst LOCAL_SQLITE_SYNCHRONOUS_MODES: readonly LocalSqliteSynchronousMode[] = [\n  \"off\",\n  \"normal\",\n  \"full\",\n  \"extra\",\n];\n\nconst SQLITE_MAX_WAL_AUTOCHECKPOINT_PAGES = 2_147_483_647;\n\nfunction applyConnectionPragmas(\n  sqlite: Database.Database,\n  pragmas: LocalSqlitePragmaOptions | false | undefined,\n): void {\n  if (pragmas === false) return;\n  const resolved: Required<LocalSqlitePragmaOptions> = {\n    ...DEFAULT_LOCAL_SQLITE_PRAGMAS,\n    ...pragmas,\n  };\n\n  // Runtime guards mirror the compile-time unions: pragma values are spliced\n  // into pragma statements, so reject anything outside the allowlists rather\n  // than forwarding it to SQLite.\n  if (!LOCAL_SQLITE_JOURNAL_MODES.includes(resolved.journalMode)) {\n    throw new ConfigurationError(\n      `Invalid journalMode pragma: ${resolved.journalMode}. ` +\n        `Expected one of: ${LOCAL_SQLITE_JOURNAL_MODES.join(\", \")}.`,\n      { journalMode: resolved.journalMode },\n    );\n  }\n  if (!LOCAL_SQLITE_SYNCHRONOUS_MODES.includes(resolved.synchronous)) {\n    throw new ConfigurationError(\n      `Invalid synchronous pragma: ${resolved.synchronous}. ` +\n        `Expected one of: ${LOCAL_SQLITE_SYNCHRONOUS_MODES.join(\", \")}.`,\n      { synchronous: resolved.synchronous },\n    );\n  }\n  if (\n    !Number.isSafeInteger(resolved.busyTimeoutMs) ||\n    resolved.busyTimeoutMs < 0\n  ) {\n    throw new ConfigurationError(\n      `Invalid busyTimeoutMs pragma: ${String(resolved.busyTimeoutMs)}. ` +\n        \"Expected a non-negative integer number of milliseconds.\",\n      { busyTimeoutMs: resolved.busyTimeoutMs },\n    );\n  }\n  if (\n    resolved.cacheSizeKib !== undefined &&\n    (!Number.isSafeInteger(resolved.cacheSizeKib) || resolved.cacheSizeKib >= 0)\n  ) {\n    throw new ConfigurationError(\n      `Invalid cacheSizeKib pragma: ${String(resolved.cacheSizeKib)}. ` +\n        \"Expected a negative safe integer — SQLite's own cache_size pragma \" +\n        \"interprets a positive value as a page count, not KiB, so a caller \" +\n        'who passes e.g. 131072 meaning \"131072 KiB\" silently gets ' +\n        \"131072 pages (~512MiB at the default 4KiB page size) instead.\",\n      { cacheSizeKib: resolved.cacheSizeKib },\n    );\n  }\n  if (\n    resolved.mmapSizeBytes !== undefined &&\n    (!Number.isSafeInteger(resolved.mmapSizeBytes) ||\n      resolved.mmapSizeBytes < 0)\n  ) {\n    throw new ConfigurationError(\n      `Invalid mmapSizeBytes pragma: ${String(resolved.mmapSizeBytes)}. ` +\n        \"Expected a non-negative safe integer number of bytes.\",\n      { mmapSizeBytes: resolved.mmapSizeBytes },\n    );\n  }\n  if (\n    resolved.walAutocheckpointPages !== undefined &&\n    (!Number.isSafeInteger(resolved.walAutocheckpointPages) ||\n      resolved.walAutocheckpointPages < 0 ||\n      resolved.walAutocheckpointPages > SQLITE_MAX_WAL_AUTOCHECKPOINT_PAGES)\n  ) {\n    throw new ConfigurationError(\n      `Invalid walAutocheckpointPages pragma: ${String(resolved.walAutocheckpointPages)}. ` +\n        `Expected an integer between 0 and ${SQLITE_MAX_WAL_AUTOCHECKPOINT_PAGES} ` +\n        \"WAL pages (0 disables automatic checkpointing entirely).\",\n      { walAutocheckpointPages: resolved.walAutocheckpointPages },\n    );\n  }\n\n  // \":memory:\" databases always journal in memory; SQLite answers the WAL\n  // request with \"memory\" instead of erroring, so no special-casing needed.\n  sqlite.pragma(`journal_mode = ${resolved.journalMode}`);\n  sqlite.pragma(`synchronous = ${resolved.synchronous}`);\n  sqlite.pragma(`busy_timeout = ${resolved.busyTimeoutMs}`);\n  if (resolved.cacheSizeKib !== undefined) {\n    sqlite.pragma(`cache_size = ${resolved.cacheSizeKib}`);\n  }\n  if (resolved.mmapSizeBytes !== undefined) {\n    sqlite.pragma(`mmap_size = ${resolved.mmapSizeBytes}`);\n  }\n  if (resolved.walAutocheckpointPages !== undefined) {\n    sqlite.pragma(`wal_autocheckpoint = ${resolved.walAutocheckpointPages}`);\n  }\n}\n\n/**\n * Options for creating a local SQLite backend.\n */\nexport type LocalSqliteBackendOptions = Readonly<{\n  /**\n   * Path to the SQLite database file.\n   * Defaults to \":memory:\" for an in-memory database.\n   */\n  path?: string;\n\n  /**\n   * Connection pragmas applied at open. Defaults to\n   * {@link DEFAULT_LOCAL_SQLITE_PRAGMAS} (WAL, `synchronous=NORMAL`, 5s busy\n   * timeout, and SQLite's own tiny built-in page cache / disabled mmap\n   * left untouched). Individual values merge over the defaults; pass\n   * `false` to skip pragma configuration entirely and keep the driver\n   * defaults (rollback journal, `synchronous=FULL`, and better-sqlite3's\n   * own 5s busy timeout from its `timeout` constructor option). Set\n   * `cacheSizeKib`/`mmapSizeBytes` explicitly once a database's working\n   * set is known to exceed SQLite's 2MiB default cache — otherwise every\n   * query pays a fresh disk read per page past that tiny working set. Set\n   * `walAutocheckpointPages` explicitly for a bulk-insert-heavy workload —\n   * SQLite's own default checkpoints every ~4MiB of WAL growth, which gets\n   * more expensive as the database file grows over a large load.\n   */\n  pragmas?: LocalSqlitePragmaOptions | false;\n\n  /**\n   * Custom table definitions.\n   * Defaults to standard TypeGraph table names.\n   */\n  tables?: SqliteTables;\n\n  /**\n   * Override specific backend capabilities — e.g. to simulate an engine-level\n   * gap like missing SQL window functions in tests. Forwarded to\n   * createSqliteBackend.\n   */\n  capabilities?: Partial<BackendCapabilities>;\n}>;\n\n/**\n * Result of creating a local SQLite backend.\n */\nexport type LocalSqliteBackendResult = Readonly<{\n  /**\n   * The GraphBackend instance for use with createStore.\n   */\n  backend: AdapterBackend<AnySqliteDatabase>;\n\n  /**\n   * The underlying Drizzle database instance.\n   * Useful for direct SQL access or cleanup.\n   */\n  db: BetterSQLite3Database;\n}>;\n\n// ============================================================\n// Factory Function\n// ============================================================\n\n/**\n * Creates a SQLite backend with minimal configuration.\n *\n * This is a convenience function for local development and testing.\n * It handles database creation, schema migration, and backend setup.\n *\n * For production deployments or custom configurations, use createSqliteBackend\n * directly with your own Drizzle database instance.\n *\n * @param options - Configuration options\n * @returns Backend and database instances\n *\n * @example In-memory database (default)\n * ```typescript\n * const { backend } = createLocalSqliteBackend();\n * const store = createStore(graph, backend);\n * ```\n *\n * @example File-based database\n * ```typescript\n * const { backend, db } = createLocalSqliteBackend({ path: \"./data.db\" });\n * const store = createStore(graph, backend);\n * ```\n */\nexport function createLocalSqliteBackend(\n  options: LocalSqliteBackendOptions = {},\n): LocalSqliteBackendResult {\n  const path = options.path ?? \":memory:\";\n  const tables = options.tables ?? defaultTables;\n\n  const sqlite = createDatabase(path);\n  try {\n    applyConnectionPragmas(sqlite, options.pragmas);\n\n    // Best-effort: load sqlite-vec so embedding fields are persisted to\n    // per-`(kind, field)` `vec0` storage. Without it, nodes with\n    // `embedding()` fields validate and insert but their vectors are silently\n    // dropped. When the user has installed sqlite-vec as a peer dep we load\n    // it and wire the strategy; otherwise we proceed without vector support.\n    const hasSqliteVec = tryLoadSqliteVec(sqlite);\n\n    const db = drizzle(sqlite);\n\n    // Generate and execute DDL from schema\n    const ddlStatements = generateSqliteDDL(tables);\n    for (const statement of ddlStatements) {\n      sqlite.exec(statement);\n    }\n\n    const backend = createSqliteBackend(db, {\n      executionProfile: {\n        isSync: true,\n      },\n      tables,\n      ...(hasSqliteVec ? { vector: sqliteVecStrategy } : {}),\n      capabilities: {\n        ...options.capabilities,\n        graphAnalytics: {\n          supported:\n            options.capabilities?.graphAnalytics?.supported ??\n            options.capabilities?.transactions !== false,\n          mathFunctions:\n            options.capabilities?.graphAnalytics?.mathFunctions ?? true,\n        },\n      },\n    });\n    const managedBackend = wrapWithManagedClose(backend, () => {\n      sqlite.close();\n    });\n\n    return { backend: managedBackend, db };\n  } catch (error) {\n    try {\n      sqlite.close();\n    } catch {\n      // Preserve the provisioning error; a cleanup failure is secondary.\n    }\n    throw error;\n  }\n}\n\nfunction tryLoadSqliteVec(sqlite: Database.Database): boolean {\n  try {\n    // `sqlite-vec` is an optional peer dep; resolved via createRequire so\n    // bundlers don't mark it as a hard import. Node resolves the package\n    // only when it's actually installed.\n    const module_: unknown = nodeRequire(\"sqlite-vec\");\n    if (\n      typeof module_ === \"object\" &&\n      module_ !== null &&\n      \"load\" in module_ &&\n      typeof module_.load === \"function\"\n    ) {\n      (module_ as { load: (db: Database.Database) => void }).load(sqlite);\n      return true;\n    }\n    return false;\n  } catch {\n    return false;\n  }\n}\n"]}

package/dist/{chunk-LDCWO5B6.js → chunk-WDAVPX46.js}

@@ -1,4 +1,4 @@
-import { KindRegistry, validateImpliesEndpointCompatibility } from './chunk-RAWG2FEU.js';
+import { KindRegistry, validateImpliesEndpointCompatibility } from './chunk-FQ7ZPOTZ.js';
 
 // src/schema/deserializer.ts
 function deserializeSchema(schema) {
@@ -77,5 +77,5 @@ function simpleRecordToMap(record) {
 }
 
 export { deserializeSchema };
-//# sourceMappingURL=chunk-LDCWO5B6.js.map
-//# sourceMappingURL=chunk-LDCWO5B6.js.map
+//# sourceMappingURL=chunk-WDAVPX46.js.map
+//# sourceMappingURL=chunk-WDAVPX46.js.map

package/dist/{chunk-LDCWO5B6.js.map → chunk-WDAVPX46.js.map}

@@ -1 +1 @@
-{"version":3,"sources":["../src/schema/deserializer.ts"],"names":[],"mappings":";;;AAiFO,SAAS,kBACd,MAAA,EACoB;AACpB,EAAA,MAAM,SAAA,GAAY,MAAA,CAAO,IAAA,CAAK,MAAA,CAAO,KAAK,CAAA;AAC1C,EAAA,MAAM,SAAA,GAAY,MAAA,CAAO,IAAA,CAAK,MAAA,CAAO,KAAK,CAAA;AAC1C,EAAA,MAAM,aAAA,GAAgB,MAAA,CAAO,IAAA,CAAK,MAAA,CAAO,SAAS,SAAS,CAAA;AAE3D,EAAA,OAAO;AAAA,IACL,SAAS,MAAA,CAAO,OAAA;AAAA,IAChB,SAAS,MAAA,CAAO,OAAA;AAAA,IAChB,aAAa,MAAA,CAAO,WAAA;AAAA,IAEpB,OAAA,EAAS,CAAC,IAAA,KAAS,MAAA,CAAO,MAAM,IAAI,CAAA;AAAA,IACpC,cAAc,MAAM,SAAA;AAAA,IAEpB,OAAA,EAAS,CAAC,IAAA,KAAS,MAAA,CAAO,MAAM,IAAI,CAAA;AAAA,IACpC,cAAc,MAAM,SAAA;AAAA,IAEpB,aAAa,CAAC,IAAA,KAAS,MAAA,CAAO,QAAA,CAAS,UAAU,IAAI,CAAA;AAAA,IACrD,kBAAkB,MAAM,aAAA;AAAA,IAExB,YAAA,EAAc,MAAM,MAAA,CAAO,QAAA,CAAS,SAAA;AAAA,IACpC,WAAA,EAAa,MAAM,MAAA,CAAO,QAAA,CAAS,QAAA;AAAA,IAEnC,WAAA,EAAa,MAAM,MAAA,CAAO,QAAA;AAAA,IAC1B,QAAQ,MAAM,MAAA;AAAA,IAEd,aAAA,EAAe,MAAM,yBAAA,CAA0B,MAAM;AAAA,GACvD;AACF;AAWA,SAAS,0BAA0B,MAAA,EAAwC;AACzE,EAAA,MAAM,EAAE,QAAA,EAAS,GAAI,MAAA,CAAO,QAAA;AAG5B,EAAA,MAAM,iBAAA,GAAoB,WAAA,CAAY,QAAA,CAAS,iBAAiB,CAAA;AAChE,EAAA,MAAM,mBAAA,GAAsB,WAAA,CAAY,QAAA,CAAS,mBAAmB,CAAA;AACpE,EAAA,MAAM,cAAA,GAAiB,WAAA,CAAY,QAAA,CAAS,cAAc,CAAA;AAC1D,EAAA,MAAM,eAAA,GAAkB,WAAA,CAAY,QAAA,CAAS,eAAe,CAAA;AAC5D,EAAA,MAAM,eAAA,GAAkB,WAAA,CAAY,QAAA,CAAS,eAAe,CAAA;AAC5D,EAAA,MAAM,aAAA,GAAgB,WAAA,CAAY,QAAA,CAAS,aAAa,CAAA;AACxD,EAAA,MAAM,cAAA,GAAiB,WAAA,CAAY,QAAA,CAAS,cAAc,CAAA;AAC1D,EAAA,MAAM,SAAA,GAAY,iBAAA,CAAkB,QAAA,CAAS,SAAS,CAAA;AACtD,EAAA,MAAM,aAAA,GAAgB,IAAI,GAAA,CAAI,QAAA,CAAS,aAAa,CAAA;AACpD,EAAA,MAAM,YAAA,GAAe,iBAAA,CAAkB,QAAA,CAAS,YAAY,CAAA;AAC5D,EAAA,MAAM,uBAAA,GAA0B,WAAA,CAAY,QAAA,CAAS,uBAAuB,CAAA;AAC5E,EAAA,MAAM,mBAAA,GAAsB,WAAA,CAAY,QAAA,CAAS,mBAAmB,CAAA;AAGpE,EAAA,MAAM,SAAA,uBAAgB,GAAA,EAAI;AAC1B,EAAA,MAAM,SAAA,uBAAgB,GAAA,EAAI;AAE1B,EAAA,MAAM,QAAA,GAAW,IAAI,YAAA,CAAa,SAAA,EAAW,SAAA,EAAW;AAAA,IACtD,iBAAA;AAAA,IACA,mBAAA;AAAA,IACA,cAAA;AAAA,IACA,eAAA;AAAA,IACA,eAAA;AAAA,IACA,SAAA;AAAA,IACA,aAAA;AAAA,IACA,aAAA;AAAA,IACA,cAAA;AAAA,IACA,YAAA;AAAA,IACA,uBAAA;AAAA,IACA;AAAA,GACD,CAAA;AAED,EAAA,oCAAA;AAAA,IACE,sBAAA,CAAuB,OAAO,KAAK,CAAA;AAAA,IACnC;AAAA,GACF;AAEA,EAAA,OAAO,QAAA;AACT;AASA,SAAS,uBACP,KAAA,EACwC;AACxC,EAAA,MAAM,MAAA,uBAAa,GAAA,EAA+B;AAClD,EAAA,KAAA,MAAW,CAAC,IAAA,EAAM,GAAG,KAAK,MAAA,CAAO,OAAA,CAAQ,KAAK,CAAA,EAAG;AAC/C,IAAA,MAAA,CAAO,GAAA,CAAI,MAAM,EAAE,IAAA,EAAM,IAAI,SAAA,EAAW,EAAA,EAAI,GAAA,CAAI,OAAA,EAAS,CAAA;AAAA,EAC3D;AACA,EAAA,OAAO,MAAA;AACT;AAKA,SAAS,YACP,MAAA,EAC0C;AAC1C,EAAA,MAAM,MAAA,uBAAa,GAAA,EAAyB;AAC5C,EAAA,KAAA,MAAW,CAAC,GAAA,EAAK,MAAM,KAAK,MAAA,CAAO,OAAA,CAAQ,MAAM,CAAA,EAAG;AAClD,IAAA,MAAA,CAAO,GAAA,CAAI,GAAA,EAAK,IAAI,GAAA,CAAI,MAAM,CAAC,CAAA;AAAA,EACjC;AACA,EAAA,OAAO,MAAA;AACT;AAKA,SAAS,kBACP,MAAA,EAC6B;AAC7B,EAAA,OAAO,IAAI,GAAA,CAAI,MAAA,CAAO,OAAA,CAAQ,MAAM,CAAC,CAAA;AACvC","file":"chunk-LDCWO5B6.js","sourcesContent":["/**\n * Schema deserializer for loading stored schemas.\n *\n * Reconstructs runtime objects from SerializedSchema.\n * Note: Zod schemas cannot be fully reconstructed from JSON Schema,\n * so this provides access to the serialized data for introspection.\n */\nimport { KindRegistry } from \"../registry/kind-registry\";\nimport {\n  type EdgeEndpointKinds,\n  validateImpliesEndpointCompatibility,\n} from \"../registry/validate-implies\";\nimport {\n  type SerializedClosures,\n  type SerializedEdgeDef,\n  type SerializedMetaEdge,\n  type SerializedNodeDef,\n  type SerializedOntologyRelation,\n  type SerializedSchema,\n} from \"./types\";\n\n// ============================================================\n// Deserialized Schema\n// ============================================================\n\n/**\n * A deserialized schema provides read-only access to schema metadata.\n *\n * Note: Unlike the original GraphDef, this does not include Zod schemas\n * since those cannot be reconstructed from JSON Schema. Use this for\n * introspection and metadata access only.\n */\nexport type DeserializedSchema = Readonly<{\n  graphId: string;\n  version: number;\n  generatedAt: string;\n\n  /** Get node definition by name */\n  getNode: (name: string) => SerializedNodeDef | undefined;\n\n  /** Get all node names */\n  getNodeNames: () => readonly string[];\n\n  /** Get edge definition by name */\n  getEdge: (name: string) => SerializedEdgeDef | undefined;\n\n  /** Get all edge names */\n  getEdgeNames: () => readonly string[];\n\n  /** Get meta-edge definition by name */\n  getMetaEdge: (name: string) => SerializedMetaEdge | undefined;\n\n  /** Get all meta-edge names */\n  getMetaEdgeNames: () => readonly string[];\n\n  /** Get all ontology relations */\n  getRelations: () => readonly SerializedOntologyRelation[];\n\n  /** Get precomputed closures */\n  getClosures: () => SerializedClosures;\n\n  /** Get graph defaults */\n  getDefaults: () => SerializedSchema[\"defaults\"];\n\n  /** Get the raw serialized schema */\n  getRaw: () => SerializedSchema;\n\n  /** Build a KindRegistry from the closures */\n  buildRegistry: () => KindRegistry;\n}>;\n\n// ============================================================\n// Deserialization\n// ============================================================\n\n/**\n * Deserializes a SerializedSchema into a DeserializedSchema.\n *\n * @param schema - The serialized schema to deserialize\n * @returns A deserialized schema with accessor methods\n */\nexport function deserializeSchema(\n  schema: SerializedSchema,\n): DeserializedSchema {\n  const nodeNames = Object.keys(schema.nodes);\n  const edgeNames = Object.keys(schema.edges);\n  const metaEdgeNames = Object.keys(schema.ontology.metaEdges);\n\n  return {\n    graphId: schema.graphId,\n    version: schema.version,\n    generatedAt: schema.generatedAt,\n\n    getNode: (name) => schema.nodes[name],\n    getNodeNames: () => nodeNames,\n\n    getEdge: (name) => schema.edges[name],\n    getEdgeNames: () => edgeNames,\n\n    getMetaEdge: (name) => schema.ontology.metaEdges[name],\n    getMetaEdgeNames: () => metaEdgeNames,\n\n    getRelations: () => schema.ontology.relations,\n    getClosures: () => schema.ontology.closures,\n\n    getDefaults: () => schema.defaults,\n    getRaw: () => schema,\n\n    buildRegistry: () => buildRegistryFromClosures(schema),\n  };\n}\n\n// ============================================================\n// Registry Building\n// ============================================================\n\n/**\n * Builds a KindRegistry from serialized closures.\n *\n * This allows query execution without recomputing closures.\n */\nfunction buildRegistryFromClosures(schema: SerializedSchema): KindRegistry {\n  const { closures } = schema.ontology;\n\n  // Convert Record<string, string[]> back to Map<string, Set<string>>\n  const subClassAncestors = recordToMap(closures.subClassAncestors);\n  const subClassDescendants = recordToMap(closures.subClassDescendants);\n  const broaderClosure = recordToMap(closures.broaderClosure);\n  const narrowerClosure = recordToMap(closures.narrowerClosure);\n  const equivalenceSets = recordToMap(closures.equivalenceSets);\n  const partOfClosure = recordToMap(closures.partOfClosure);\n  const hasPartClosure = recordToMap(closures.hasPartClosure);\n  const iriToKind = simpleRecordToMap(closures.iriToKind);\n  const disjointPairs = new Set(closures.disjointPairs);\n  const edgeInverses = simpleRecordToMap(closures.edgeInverses);\n  const edgeImplicationsClosure = recordToMap(closures.edgeImplicationsClosure);\n  const edgeImplyingClosure = recordToMap(closures.edgeImplyingClosure);\n\n  // Build empty node/edge kind maps (we don't have the actual Zod schemas)\n  const nodeKinds = new Map();\n  const edgeKinds = new Map();\n\n  const registry = new KindRegistry(nodeKinds, edgeKinds, {\n    subClassAncestors,\n    subClassDescendants,\n    broaderClosure,\n    narrowerClosure,\n    equivalenceSets,\n    iriToKind,\n    disjointPairs,\n    partOfClosure,\n    hasPartClosure,\n    edgeInverses,\n    edgeImplicationsClosure,\n    edgeImplyingClosure,\n  });\n\n  validateImpliesEndpointCompatibility(\n    buildEdgeEndpointKinds(schema.edges),\n    registry,\n  );\n\n  return registry;\n}\n\n/**\n * Maps each edge kind's serialized definition to its domain/range kind\n * names, for `validateImpliesEndpointCompatibility`. A `Map` (rather than\n * the plain `schema.edges` object) so a lookup for an edge kind literally\n * named \"toString\" or another `Object.prototype` member can't resolve to\n * an inherited member instead of `undefined`.\n */\nfunction buildEdgeEndpointKinds(\n  edges: Record<string, SerializedEdgeDef>,\n): ReadonlyMap<string, EdgeEndpointKinds> {\n  const result = new Map<string, EdgeEndpointKinds>();\n  for (const [kind, def] of Object.entries(edges)) {\n    result.set(kind, { from: def.fromKinds, to: def.toKinds });\n  }\n  return result;\n}\n\n/**\n * Converts Record<string, string[]> to Map<string, Set<string>>.\n */\nfunction recordToMap(\n  record: Record<string, readonly string[]>,\n): ReadonlyMap<string, ReadonlySet<string>> {\n  const result = new Map<string, Set<string>>();\n  for (const [key, values] of Object.entries(record)) {\n    result.set(key, new Set(values));\n  }\n  return result;\n}\n\n/**\n * Converts Record<string, string> to Map<string, string>.\n */\nfunction simpleRecordToMap(\n  record: Record<string, string>,\n): ReadonlyMap<string, string> {\n  return new Map(Object.entries(record));\n}\n"]}
+{"version":3,"sources":["../src/schema/deserializer.ts"],"names":[],"mappings":";;;AAiFO,SAAS,kBACd,MAAA,EACoB;AACpB,EAAA,MAAM,SAAA,GAAY,MAAA,CAAO,IAAA,CAAK,MAAA,CAAO,KAAK,CAAA;AAC1C,EAAA,MAAM,SAAA,GAAY,MAAA,CAAO,IAAA,CAAK,MAAA,CAAO,KAAK,CAAA;AAC1C,EAAA,MAAM,aAAA,GAAgB,MAAA,CAAO,IAAA,CAAK,MAAA,CAAO,SAAS,SAAS,CAAA;AAE3D,EAAA,OAAO;AAAA,IACL,SAAS,MAAA,CAAO,OAAA;AAAA,IAChB,SAAS,MAAA,CAAO,OAAA;AAAA,IAChB,aAAa,MAAA,CAAO,WAAA;AAAA,IAEpB,OAAA,EAAS,CAAC,IAAA,KAAS,MAAA,CAAO,MAAM,IAAI,CAAA;AAAA,IACpC,cAAc,MAAM,SAAA;AAAA,IAEpB,OAAA,EAAS,CAAC,IAAA,KAAS,MAAA,CAAO,MAAM,IAAI,CAAA;AAAA,IACpC,cAAc,MAAM,SAAA;AAAA,IAEpB,aAAa,CAAC,IAAA,KAAS,MAAA,CAAO,QAAA,CAAS,UAAU,IAAI,CAAA;AAAA,IACrD,kBAAkB,MAAM,aAAA;AAAA,IAExB,YAAA,EAAc,MAAM,MAAA,CAAO,QAAA,CAAS,SAAA;AAAA,IACpC,WAAA,EAAa,MAAM,MAAA,CAAO,QAAA,CAAS,QAAA;AAAA,IAEnC,WAAA,EAAa,MAAM,MAAA,CAAO,QAAA;AAAA,IAC1B,QAAQ,MAAM,MAAA;AAAA,IAEd,aAAA,EAAe,MAAM,yBAAA,CAA0B,MAAM;AAAA,GACvD;AACF;AAWA,SAAS,0BAA0B,MAAA,EAAwC;AACzE,EAAA,MAAM,EAAE,QAAA,EAAS,GAAI,MAAA,CAAO,QAAA;AAG5B,EAAA,MAAM,iBAAA,GAAoB,WAAA,CAAY,QAAA,CAAS,iBAAiB,CAAA;AAChE,EAAA,MAAM,mBAAA,GAAsB,WAAA,CAAY,QAAA,CAAS,mBAAmB,CAAA;AACpE,EAAA,MAAM,cAAA,GAAiB,WAAA,CAAY,QAAA,CAAS,cAAc,CAAA;AAC1D,EAAA,MAAM,eAAA,GAAkB,WAAA,CAAY,QAAA,CAAS,eAAe,CAAA;AAC5D,EAAA,MAAM,eAAA,GAAkB,WAAA,CAAY,QAAA,CAAS,eAAe,CAAA;AAC5D,EAAA,MAAM,aAAA,GAAgB,WAAA,CAAY,QAAA,CAAS,aAAa,CAAA;AACxD,EAAA,MAAM,cAAA,GAAiB,WAAA,CAAY,QAAA,CAAS,cAAc,CAAA;AAC1D,EAAA,MAAM,SAAA,GAAY,iBAAA,CAAkB,QAAA,CAAS,SAAS,CAAA;AACtD,EAAA,MAAM,aAAA,GAAgB,IAAI,GAAA,CAAI,QAAA,CAAS,aAAa,CAAA;AACpD,EAAA,MAAM,YAAA,GAAe,iBAAA,CAAkB,QAAA,CAAS,YAAY,CAAA;AAC5D,EAAA,MAAM,uBAAA,GAA0B,WAAA,CAAY,QAAA,CAAS,uBAAuB,CAAA;AAC5E,EAAA,MAAM,mBAAA,GAAsB,WAAA,CAAY,QAAA,CAAS,mBAAmB,CAAA;AAGpE,EAAA,MAAM,SAAA,uBAAgB,GAAA,EAAI;AAC1B,EAAA,MAAM,SAAA,uBAAgB,GAAA,EAAI;AAE1B,EAAA,MAAM,QAAA,GAAW,IAAI,YAAA,CAAa,SAAA,EAAW,SAAA,EAAW;AAAA,IACtD,iBAAA;AAAA,IACA,mBAAA;AAAA,IACA,cAAA;AAAA,IACA,eAAA;AAAA,IACA,eAAA;AAAA,IACA,SAAA;AAAA,IACA,aAAA;AAAA,IACA,aAAA;AAAA,IACA,cAAA;AAAA,IACA,YAAA;AAAA,IACA,uBAAA;AAAA,IACA;AAAA,GACD,CAAA;AAED,EAAA,oCAAA;AAAA,IACE,sBAAA,CAAuB,OAAO,KAAK,CAAA;AAAA,IACnC;AAAA,GACF;AAEA,EAAA,OAAO,QAAA;AACT;AASA,SAAS,uBACP,KAAA,EACwC;AACxC,EAAA,MAAM,MAAA,uBAAa,GAAA,EAA+B;AAClD,EAAA,KAAA,MAAW,CAAC,IAAA,EAAM,GAAG,KAAK,MAAA,CAAO,OAAA,CAAQ,KAAK,CAAA,EAAG;AAC/C,IAAA,MAAA,CAAO,GAAA,CAAI,MAAM,EAAE,IAAA,EAAM,IAAI,SAAA,EAAW,EAAA,EAAI,GAAA,CAAI,OAAA,EAAS,CAAA;AAAA,EAC3D;AACA,EAAA,OAAO,MAAA;AACT;AAKA,SAAS,YACP,MAAA,EAC0C;AAC1C,EAAA,MAAM,MAAA,uBAAa,GAAA,EAAyB;AAC5C,EAAA,KAAA,MAAW,CAAC,GAAA,EAAK,MAAM,KAAK,MAAA,CAAO,OAAA,CAAQ,MAAM,CAAA,EAAG;AAClD,IAAA,MAAA,CAAO,GAAA,CAAI,GAAA,EAAK,IAAI,GAAA,CAAI,MAAM,CAAC,CAAA;AAAA,EACjC;AACA,EAAA,OAAO,MAAA;AACT;AAKA,SAAS,kBACP,MAAA,EAC6B;AAC7B,EAAA,OAAO,IAAI,GAAA,CAAI,MAAA,CAAO,OAAA,CAAQ,MAAM,CAAC,CAAA;AACvC","file":"chunk-WDAVPX46.js","sourcesContent":["/**\n * Schema deserializer for loading stored schemas.\n *\n * Reconstructs runtime objects from SerializedSchema.\n * Note: Zod schemas cannot be fully reconstructed from JSON Schema,\n * so this provides access to the serialized data for introspection.\n */\nimport { KindRegistry } from \"../registry/kind-registry\";\nimport {\n  type EdgeEndpointKinds,\n  validateImpliesEndpointCompatibility,\n} from \"../registry/validate-implies\";\nimport {\n  type SerializedClosures,\n  type SerializedEdgeDef,\n  type SerializedMetaEdge,\n  type SerializedNodeDef,\n  type SerializedOntologyRelation,\n  type SerializedSchema,\n} from \"./types\";\n\n// ============================================================\n// Deserialized Schema\n// ============================================================\n\n/**\n * A deserialized schema provides read-only access to schema metadata.\n *\n * Note: Unlike the original GraphDef, this does not include Zod schemas\n * since those cannot be reconstructed from JSON Schema. Use this for\n * introspection and metadata access only.\n */\nexport type DeserializedSchema = Readonly<{\n  graphId: string;\n  version: number;\n  generatedAt: string;\n\n  /** Get node definition by name */\n  getNode: (name: string) => SerializedNodeDef | undefined;\n\n  /** Get all node names */\n  getNodeNames: () => readonly string[];\n\n  /** Get edge definition by name */\n  getEdge: (name: string) => SerializedEdgeDef | undefined;\n\n  /** Get all edge names */\n  getEdgeNames: () => readonly string[];\n\n  /** Get meta-edge definition by name */\n  getMetaEdge: (name: string) => SerializedMetaEdge | undefined;\n\n  /** Get all meta-edge names */\n  getMetaEdgeNames: () => readonly string[];\n\n  /** Get all ontology relations */\n  getRelations: () => readonly SerializedOntologyRelation[];\n\n  /** Get precomputed closures */\n  getClosures: () => SerializedClosures;\n\n  /** Get graph defaults */\n  getDefaults: () => SerializedSchema[\"defaults\"];\n\n  /** Get the raw serialized schema */\n  getRaw: () => SerializedSchema;\n\n  /** Build a KindRegistry from the closures */\n  buildRegistry: () => KindRegistry;\n}>;\n\n// ============================================================\n// Deserialization\n// ============================================================\n\n/**\n * Deserializes a SerializedSchema into a DeserializedSchema.\n *\n * @param schema - The serialized schema to deserialize\n * @returns A deserialized schema with accessor methods\n */\nexport function deserializeSchema(\n  schema: SerializedSchema,\n): DeserializedSchema {\n  const nodeNames = Object.keys(schema.nodes);\n  const edgeNames = Object.keys(schema.edges);\n  const metaEdgeNames = Object.keys(schema.ontology.metaEdges);\n\n  return {\n    graphId: schema.graphId,\n    version: schema.version,\n    generatedAt: schema.generatedAt,\n\n    getNode: (name) => schema.nodes[name],\n    getNodeNames: () => nodeNames,\n\n    getEdge: (name) => schema.edges[name],\n    getEdgeNames: () => edgeNames,\n\n    getMetaEdge: (name) => schema.ontology.metaEdges[name],\n    getMetaEdgeNames: () => metaEdgeNames,\n\n    getRelations: () => schema.ontology.relations,\n    getClosures: () => schema.ontology.closures,\n\n    getDefaults: () => schema.defaults,\n    getRaw: () => schema,\n\n    buildRegistry: () => buildRegistryFromClosures(schema),\n  };\n}\n\n// ============================================================\n// Registry Building\n// ============================================================\n\n/**\n * Builds a KindRegistry from serialized closures.\n *\n * This allows query execution without recomputing closures.\n */\nfunction buildRegistryFromClosures(schema: SerializedSchema): KindRegistry {\n  const { closures } = schema.ontology;\n\n  // Convert Record<string, string[]> back to Map<string, Set<string>>\n  const subClassAncestors = recordToMap(closures.subClassAncestors);\n  const subClassDescendants = recordToMap(closures.subClassDescendants);\n  const broaderClosure = recordToMap(closures.broaderClosure);\n  const narrowerClosure = recordToMap(closures.narrowerClosure);\n  const equivalenceSets = recordToMap(closures.equivalenceSets);\n  const partOfClosure = recordToMap(closures.partOfClosure);\n  const hasPartClosure = recordToMap(closures.hasPartClosure);\n  const iriToKind = simpleRecordToMap(closures.iriToKind);\n  const disjointPairs = new Set(closures.disjointPairs);\n  const edgeInverses = simpleRecordToMap(closures.edgeInverses);\n  const edgeImplicationsClosure = recordToMap(closures.edgeImplicationsClosure);\n  const edgeImplyingClosure = recordToMap(closures.edgeImplyingClosure);\n\n  // Build empty node/edge kind maps (we don't have the actual Zod schemas)\n  const nodeKinds = new Map();\n  const edgeKinds = new Map();\n\n  const registry = new KindRegistry(nodeKinds, edgeKinds, {\n    subClassAncestors,\n    subClassDescendants,\n    broaderClosure,\n    narrowerClosure,\n    equivalenceSets,\n    iriToKind,\n    disjointPairs,\n    partOfClosure,\n    hasPartClosure,\n    edgeInverses,\n    edgeImplicationsClosure,\n    edgeImplyingClosure,\n  });\n\n  validateImpliesEndpointCompatibility(\n    buildEdgeEndpointKinds(schema.edges),\n    registry,\n  );\n\n  return registry;\n}\n\n/**\n * Maps each edge kind's serialized definition to its domain/range kind\n * names, for `validateImpliesEndpointCompatibility`. A `Map` (rather than\n * the plain `schema.edges` object) so a lookup for an edge kind literally\n * named \"toString\" or another `Object.prototype` member can't resolve to\n * an inherited member instead of `undefined`.\n */\nfunction buildEdgeEndpointKinds(\n  edges: Record<string, SerializedEdgeDef>,\n): ReadonlyMap<string, EdgeEndpointKinds> {\n  const result = new Map<string, EdgeEndpointKinds>();\n  for (const [kind, def] of Object.entries(edges)) {\n    result.set(kind, { from: def.fromKinds, to: def.toKinds });\n  }\n  return result;\n}\n\n/**\n * Converts Record<string, string[]> to Map<string, Set<string>>.\n */\nfunction recordToMap(\n  record: Record<string, readonly string[]>,\n): ReadonlyMap<string, ReadonlySet<string>> {\n  const result = new Map<string, Set<string>>();\n  for (const [key, values] of Object.entries(record)) {\n    result.set(key, new Set(values));\n  }\n  return result;\n}\n\n/**\n * Converts Record<string, string> to Map<string, string>.\n */\nfunction simpleRecordToMap(\n  record: Record<string, string>,\n): ReadonlyMap<string, string> {\n  return new Map(Object.entries(record));\n}\n"]}

package/dist/{chunk-5GV4JQNA.cjs → chunk-WDBXJOU5.cjs}

@@ -1,8 +1,8 @@
 'use strict';
 
-var chunkVGMNGWBR_cjs = require('./chunk-VGMNGWBR.cjs');
-var chunkUTTW2Q3M_cjs = require('./chunk-UTTW2Q3M.cjs');
-var chunkX2XOQZT3_cjs = require('./chunk-X2XOQZT3.cjs');
+var chunk4SZ6XPTG_cjs = require('./chunk-4SZ6XPTG.cjs');
+var chunkJXUTCSXX_cjs = require('./chunk-JXUTCSXX.cjs');
+var chunkU5W4LKZV_cjs = require('./chunk-U5W4LKZV.cjs');
 
 // src/query/dialect/vector/libsql-strategy.ts
 var TABLE_PREFIX = "tg_vec";
@@ -47,17 +47,17 @@ function libsqlMetricToken(metric) {
   }
 }
 function vector32Literal(embedding, name) {
-  chunkUTTW2Q3M_cjs.assertFiniteEmbedding(embedding, name);
-  return chunkX2XOQZT3_cjs.sql`vector32(${`[${embedding.join(",")}]`})`;
+  chunkJXUTCSXX_cjs.assertFiniteEmbedding(embedding, name);
+  return chunkU5W4LKZV_cjs.sql`vector32(${`[${embedding.join(",")}]`})`;
 }
 function distanceExpression(embeddingColumn, queryEmbedding, metric) {
   const query = vector32Literal(queryEmbedding, "queryEmbedding");
   switch (metric) {
     case "cosine": {
-      return chunkX2XOQZT3_cjs.sql`vector_distance_cos(${embeddingColumn}, ${query})`;
+      return chunkU5W4LKZV_cjs.sql`vector_distance_cos(${embeddingColumn}, ${query})`;
     }
     case "l2": {
-      return chunkX2XOQZT3_cjs.sql`vector_distance_l2(${embeddingColumn}, ${query})`;
+      return chunkU5W4LKZV_cjs.sql`vector_distance_l2(${embeddingColumn}, ${query})`;
     }
     case "inner_product": {
       throw new Error(
@@ -71,7 +71,7 @@ function distanceExpression(embeddingColumn, queryEmbedding, metric) {
   }
 }
 function tableName(graphId, nodeKind, fieldPath) {
-  return chunkUTTW2Q3M_cjs.vectorPhysicalName(TABLE_PREFIX, graphId, nodeKind, fieldPath);
+  return chunkJXUTCSXX_cjs.vectorPhysicalName(TABLE_PREFIX, graphId, nodeKind, fieldPath);
 }
 var libsqlVectorStrategy = {
   name: "libsql-native",
@@ -79,7 +79,7 @@ var libsqlVectorStrategy = {
   tableName,
   ownedTables(slot) {
     const table = tableName(slot.graphId, slot.nodeKind, slot.fieldPath);
-    const name = chunkUTTW2Q3M_cjs.quoteIdentifier(table);
+    const name = chunkJXUTCSXX_cjs.quoteIdentifier(table);
     const createDdl = [
       `CREATE TABLE IF NOT EXISTS ${name} (
   "graph_id" TEXT NOT NULL,
@@ -95,7 +95,7 @@ var libsqlVectorStrategy = {
     }
     return [
       {
-        logicalName: `${chunkUTTW2Q3M_cjs.VECTOR_CONTRIBUTION_PREFIX}:${slot.nodeKind}.${slot.fieldPath}`,
+        logicalName: `${chunkJXUTCSXX_cjs.VECTOR_CONTRIBUTION_PREFIX}:${slot.nodeKind}.${slot.fieldPath}`,
         owner: "libsql-native",
         tableName: table,
         createDdl,
@@ -104,12 +104,12 @@ var libsqlVectorStrategy = {
     ];
   },
   buildUpsert(slot, params, timestamp) {
-    const table = chunkX2XOQZT3_cjs.sql.identifier(
+    const table = chunkU5W4LKZV_cjs.sql.identifier(
       tableName(slot.graphId, slot.nodeKind, slot.fieldPath)
     );
     const value = vector32Literal(params.embedding, "embedding");
     return [
-      chunkX2XOQZT3_cjs.sql`
+      chunkU5W4LKZV_cjs.sql`
         INSERT INTO ${table} ("graph_id", "node_id", "embedding", "created_at", "updated_at")
         VALUES (${params.graphId}, ${params.nodeId}, ${value}, ${timestamp}, ${timestamp})
         ON CONFLICT ("graph_id", "node_id")
@@ -118,17 +118,17 @@ var libsqlVectorStrategy = {
     ];
   },
   buildUpsertBatch(slot, params, timestamp) {
-    const table = chunkX2XOQZT3_cjs.sql.identifier(
+    const table = chunkU5W4LKZV_cjs.sql.identifier(
       tableName(slot.graphId, slot.nodeKind, slot.fieldPath)
     );
-    const valueRows = chunkX2XOQZT3_cjs.sql.join(
+    const valueRows = chunkU5W4LKZV_cjs.sql.join(
       params.rows.map(
-        (row) => chunkX2XOQZT3_cjs.sql`(${params.graphId}, ${row.nodeId}, ${vector32Literal(row.embedding, "embedding")}, ${timestamp}, ${timestamp})`
+        (row) => chunkU5W4LKZV_cjs.sql`(${params.graphId}, ${row.nodeId}, ${vector32Literal(row.embedding, "embedding")}, ${timestamp}, ${timestamp})`
       ),
-      chunkX2XOQZT3_cjs.sql`, `
+      chunkU5W4LKZV_cjs.sql`, `
     );
     return [
-      chunkX2XOQZT3_cjs.sql`
+      chunkU5W4LKZV_cjs.sql`
         INSERT INTO ${table} ("graph_id", "node_id", "embedding", "created_at", "updated_at")
         VALUES ${valueRows}
         ON CONFLICT ("graph_id", "node_id")
@@ -137,68 +137,80 @@ var libsqlVectorStrategy = {
     ];
   },
   buildDelete(slot, params) {
-    const table = chunkX2XOQZT3_cjs.sql.identifier(
+    const table = chunkU5W4LKZV_cjs.sql.identifier(
       tableName(slot.graphId, slot.nodeKind, slot.fieldPath)
     );
     return [
-      chunkX2XOQZT3_cjs.sql`
+      chunkU5W4LKZV_cjs.sql`
         DELETE FROM ${table}
         WHERE "graph_id" = ${params.graphId} AND "node_id" = ${params.nodeId}
       `
     ];
   },
+  buildDeleteBatch(slot, params) {
+    if (params.nodeIds.length === 0) return [];
+    const table = chunkU5W4LKZV_cjs.sql.identifier(
+      tableName(slot.graphId, slot.nodeKind, slot.fieldPath)
+    );
+    return [
+      chunkU5W4LKZV_cjs.sql`DELETE FROM ${table} WHERE "graph_id" = ${params.graphId} AND "node_id" IN (${chunkU5W4LKZV_cjs.sql.join(
+        params.nodeIds.map((nodeId) => chunkU5W4LKZV_cjs.sql`${nodeId}`),
+        chunkU5W4LKZV_cjs.sql`, `
+      )})`
+    ];
+  },
   buildSearch(slot, params, candidates) {
     const table = tableName(slot.graphId, slot.nodeKind, slot.fieldPath);
-    const quoted = chunkX2XOQZT3_cjs.sql.identifier(table);
-    const embeddingColumn = chunkX2XOQZT3_cjs.sql`${quoted}."embedding"`;
+    const quoted = chunkU5W4LKZV_cjs.sql.identifier(table);
+    const embeddingColumn = chunkU5W4LKZV_cjs.sql`${quoted}."embedding"`;
     const distance = distanceExpression(
       embeddingColumn,
       params.queryEmbedding,
       params.metric
     );
-    const score = chunkUTTW2Q3M_cjs.vectorScoreExpression(distance, params.metric);
+    const score = chunkJXUTCSXX_cjs.vectorScoreExpression(distance, params.metric);
     if (usesAnnIndex(slot)) {
       const indexName = libsqlIndexName(slot);
       const query = vector32Literal(params.queryEmbedding, "queryEmbedding");
       const conditions2 = [
-        chunkX2XOQZT3_cjs.sql`${quoted}."graph_id" = ${params.graphId}`
+        chunkU5W4LKZV_cjs.sql`${quoted}."graph_id" = ${params.graphId}`
       ];
       if (params.minScore !== void 0) {
         conditions2.push(
-          chunkUTTW2Q3M_cjs.vectorMinScoreCondition(distance, params.metric, params.minScore)
+          chunkJXUTCSXX_cjs.vectorMinScoreCondition(distance, params.metric, params.minScore)
         );
       }
       if (candidates !== void 0) {
-        conditions2.push(chunkX2XOQZT3_cjs.sql`${quoted}."node_id" IN (${candidates})`);
+        conditions2.push(chunkU5W4LKZV_cjs.sql`${quoted}."node_id" IN (${candidates})`);
       }
       const pageK = params.limit + (params.offset ?? 0);
       const annK = candidates === void 0 ? pageK : pageK * CANDIDATE_FILTER_OVERFETCH;
-      const pageClause2 = chunkVGMNGWBR_cjs.vectorPageClause(params.limit, params.offset);
-      return chunkX2XOQZT3_cjs.sql`
+      const pageClause2 = chunk4SZ6XPTG_cjs.vectorPageClause(params.limit, params.offset);
+      return chunkU5W4LKZV_cjs.sql`
         SELECT ${quoted}."node_id" AS node_id, ${score} AS score
         FROM vector_top_k(${indexName}, ${query}, ${annK})
         JOIN ${quoted} ON ${quoted}.rowid = id
-        WHERE ${chunkX2XOQZT3_cjs.sql.join(conditions2, chunkX2XOQZT3_cjs.sql` AND `)}
+        WHERE ${chunkU5W4LKZV_cjs.sql.join(conditions2, chunkU5W4LKZV_cjs.sql` AND `)}
         ORDER BY ${distance} ASC
         ${pageClause2}
       `;
     }
     const conditions = [
-      chunkX2XOQZT3_cjs.sql`${quoted}."graph_id" = ${params.graphId}`
+      chunkU5W4LKZV_cjs.sql`${quoted}."graph_id" = ${params.graphId}`
     ];
     if (candidates !== void 0) {
-      conditions.push(chunkX2XOQZT3_cjs.sql`${quoted}."node_id" IN (${candidates})`);
+      conditions.push(chunkU5W4LKZV_cjs.sql`${quoted}."node_id" IN (${candidates})`);
     }
     if (params.minScore !== void 0) {
       conditions.push(
-        chunkUTTW2Q3M_cjs.vectorMinScoreCondition(distance, params.metric, params.minScore)
+        chunkJXUTCSXX_cjs.vectorMinScoreCondition(distance, params.metric, params.minScore)
       );
     }
-    const pageClause = chunkVGMNGWBR_cjs.vectorPageClause(params.limit, params.offset);
-    return chunkX2XOQZT3_cjs.sql`
+    const pageClause = chunk4SZ6XPTG_cjs.vectorPageClause(params.limit, params.offset);
+    return chunkU5W4LKZV_cjs.sql`
       SELECT ${quoted}."node_id" AS node_id, ${score} AS score
       FROM ${quoted}
-      WHERE ${chunkX2XOQZT3_cjs.sql.join(conditions, chunkX2XOQZT3_cjs.sql` AND `)}
+      WHERE ${chunkU5W4LKZV_cjs.sql.join(conditions, chunkU5W4LKZV_cjs.sql` AND `)}
       ORDER BY ${distance} ASC
       ${pageClause}
     `;
@@ -208,7 +220,7 @@ var libsqlVectorStrategy = {
   },
   buildCreateIndex(slot) {
     if (!usesAnnIndex(slot)) return void 0;
-    return chunkX2XOQZT3_cjs.sql.raw(
+    return chunkU5W4LKZV_cjs.sql.raw(
       libsqlVectorIndexDdl(
         tableName(slot.graphId, slot.nodeKind, slot.fieldPath),
         slot
@@ -218,16 +230,16 @@ var libsqlVectorStrategy = {
   buildDropIndex(slot) {
     if (!usesAnnIndex(slot)) return void 0;
     const indexName = libsqlIndexName(slot);
-    return chunkX2XOQZT3_cjs.sql.raw(`DROP INDEX IF EXISTS ${chunkUTTW2Q3M_cjs.quoteIdentifier(indexName)}`);
+    return chunkU5W4LKZV_cjs.sql.raw(`DROP INDEX IF EXISTS ${chunkJXUTCSXX_cjs.quoteIdentifier(indexName)}`);
   },
   buildDropStorage(slot) {
-    const table = chunkUTTW2Q3M_cjs.quoteIdentifier(
+    const table = chunkJXUTCSXX_cjs.quoteIdentifier(
       tableName(slot.graphId, slot.nodeKind, slot.fieldPath)
     );
     const statements = [];
     if (usesAnnIndex(slot)) {
       statements.push(
-        `DROP INDEX IF EXISTS ${chunkUTTW2Q3M_cjs.quoteIdentifier(libsqlIndexName(slot))}`
+        `DROP INDEX IF EXISTS ${chunkJXUTCSXX_cjs.quoteIdentifier(libsqlIndexName(slot))}`
       );
     }
     statements.push(`DROP TABLE IF EXISTS ${table}`);
@@ -236,7 +248,7 @@ var libsqlVectorStrategy = {
 };
 var CANDIDATE_FILTER_OVERFETCH = 4;
 function libsqlIndexName(slot) {
-  return chunkUTTW2Q3M_cjs.vectorPhysicalName(
+  return chunkJXUTCSXX_cjs.vectorPhysicalName(
     INDEX_PREFIX,
     slot.graphId,
     slot.nodeKind,
@@ -244,11 +256,11 @@ function libsqlIndexName(slot) {
   );
 }
 function libsqlVectorIndexDdl(table, slot) {
-  const indexName = chunkUTTW2Q3M_cjs.quoteIdentifier(libsqlIndexName(slot));
+  const indexName = chunkJXUTCSXX_cjs.quoteIdentifier(libsqlIndexName(slot));
   const metric = libsqlMetricToken(slot.metric);
-  return `CREATE INDEX IF NOT EXISTS ${indexName} ON ${chunkUTTW2Q3M_cjs.quoteIdentifier(table)}(libsql_vector_idx("embedding", 'metric=${metric}'));`;
+  return `CREATE INDEX IF NOT EXISTS ${indexName} ON ${chunkJXUTCSXX_cjs.quoteIdentifier(table)}(libsql_vector_idx("embedding", 'metric=${metric}'));`;
 }
 
 exports.libsqlVectorStrategy = libsqlVectorStrategy;
-//# sourceMappingURL=chunk-5GV4JQNA.cjs.map
-//# sourceMappingURL=chunk-5GV4JQNA.cjs.map
+//# sourceMappingURL=chunk-WDBXJOU5.cjs.map
+//# sourceMappingURL=chunk-WDBXJOU5.cjs.map

package/dist/chunk-WDBXJOU5.cjs.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/query/dialect/vector/libsql-strategy.ts"],"names":["assertFiniteEmbedding","sql","vectorPhysicalName","quoteIdentifier","VECTOR_CONTRIBUTION_PREFIX","vectorScoreExpression","conditions","vectorMinScoreCondition","pageClause","vectorPageClause"],"mappings":";;;;;;;AA2CA,IAAM,YAAA,GAAe,QAAA;AACrB,IAAM,YAAA,GAAe,WAAA;AAKrB,IAAM,qBAAA,GAAwB,KAAA;AAE9B,IAAM,mBAAA,GAA0C;AAAA,EAC9C,SAAA,EAAW,IAAA;AAAA,EACX,OAAA,EAAS,CAAC,QAAA,EAAU,IAAI,CAAA;AAAA;AAAA,EAExB,UAAA,EAAY,CAAC,MAAA,EAAQ,MAAM,CAAA;AAAA,EAC3B,aAAA,EAAe,qBAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMf,yBAAA,EAA2B;AAAA,IACzB,IAAA,EAAM,aAAA;AAAA,IACN,kBAAA,EAAoB;AAAA;AAExB,CAAA;AAGA,SAAS,aAAa,IAAA,EAA2B;AAC/C,EAAA,OAAO,KAAK,SAAA,KAAc,MAAA;AAC5B;AAGA,SAAS,kBAAkB,MAAA,EAA8B;AACvD,EAAA,QAAQ,MAAA;AAAQ,IACd,KAAK,QAAA,EAAU;AACb,MAAA,OAAO,QAAA;AAAA,IACT;AAAA,IACA,KAAK,IAAA,EAAM;AACT,MAAA,OAAO,IAAA;AAAA,IACT;AAAA,IACA,KAAK,eAAA,EAAiB;AACpB,MAAA,MAAM,IAAI,KAAA;AAAA,QACR;AAAA,OACF;AAAA,IACF;AAAA,IACA,SAAS;AACP,MAAA,MAAM,WAAA,GAAqB,MAAA;AAC3B,MAAA,MAAM,IAAI,KAAA,CAAM,CAAA,2BAAA,EAA8B,MAAA,CAAO,WAAW,CAAC,CAAA,CAAE,CAAA;AAAA,IACrE;AAAA;AAEJ;AAOA,SAAS,eAAA,CACP,WACA,IAAA,EACa;AACb,EAAAA,uCAAA,CAAsB,WAAW,IAAI,CAAA;AACrC,EAAA,OAAOC,iCAAe,CAAA,CAAA,EAAI,SAAA,CAAU,IAAA,CAAK,GAAG,CAAC,CAAA,CAAA,CAAG,CAAA,CAAA,CAAA;AAClD;AAEA,SAAS,kBAAA,CACP,eAAA,EACA,cAAA,EACA,MAAA,EACa;AACb,EAAA,MAAM,KAAA,GAAQ,eAAA,CAAgB,cAAA,EAAgB,gBAAgB,CAAA;AAC9D,EAAA,QAAQ,MAAA;AAAQ,IACd,KAAK,QAAA,EAAU;AACb,MAAA,OAAOA,qBAAA,CAAA,oBAAA,EAA0B,eAAe,CAAA,EAAA,EAAK,KAAK,CAAA,CAAA,CAAA;AAAA,IAC5D;AAAA,IACA,KAAK,IAAA,EAAM;AACT,MAAA,OAAOA,qBAAA,CAAA,mBAAA,EAAyB,eAAe,CAAA,EAAA,EAAK,KAAK,CAAA,CAAA,CAAA;AAAA,IAC3D;AAAA,IACA,KAAK,eAAA,EAAiB;AACpB,MAAA,MAAM,IAAI,KAAA;AAAA,QACR;AAAA,OACF;AAAA,IACF;AAAA,IACA,SAAS;AACP,MAAA,MAAM,WAAA,GAAqB,MAAA;AAC3B,MAAA,MAAM,IAAI,KAAA,CAAM,CAAA,2BAAA,EAA8B,MAAA,CAAO,WAAW,CAAC,CAAA,CAAE,CAAA;AAAA,IACrE;AAAA;AAEJ;AAEA,SAAS,SAAA,CACP,OAAA,EACA,QAAA,EACA,SAAA,EACQ;AACR,EAAA,OAAOC,oCAAA,CAAmB,YAAA,EAAc,OAAA,EAAS,QAAA,EAAU,SAAS,CAAA;AACtE;AAEO,IAAM,oBAAA,GAAuC;AAAA,EAClD,IAAA,EAAM,eAAA;AAAA,EACN,YAAA,EAAc,mBAAA;AAAA,EAEd,SAAA;AAAA,EAEA,YAAY,IAAA,EAA4C;AACtD,IAAA,MAAM,QAAQ,SAAA,CAAU,IAAA,CAAK,SAAS,IAAA,CAAK,QAAA,EAAU,KAAK,SAAS,CAAA;AACnE,IAAA,MAAM,IAAA,GAAOC,kCAAgB,KAAK,CAAA;AAKlC,IAAA,MAAM,SAAA,GAAY;AAAA,MAChB,8BAA8B,IAAI,CAAA;AAAA;AAAA;AAAA,uBAAA,EAGf,KAAK,UAAU,CAAA;AAAA;AAAA;AAAA;AAAA,EAAA;AAAA,KAKpC;AAEA,IAAA,IAAI,YAAA,CAAa,IAAI,CAAA,EAAG;AAGtB,MAAA,SAAA,CAAU,IAAA,CAAK,oBAAA,CAAqB,KAAA,EAAO,IAAI,CAAC,CAAA;AAAA,IAClD;AAEA,IAAA,OAAO;AAAA,MACL;AAAA,QACE,WAAA,EAAa,GAAGC,4CAA0B,CAAA,CAAA,EAAI,KAAK,QAAQ,CAAA,CAAA,EAAI,KAAK,SAAS,CAAA,CAAA;AAAA,QAC7E,KAAA,EAAO,eAAA;AAAA,QACP,SAAA,EAAW,KAAA;AAAA,QACX,SAAA;AAAA,QACA,aAAA,EAAe;AAAA;AACjB,KACF;AAAA,EACF,CAAA;AAAA,EAEA,WAAA,CACE,IAAA,EACA,MAAA,EACA,SAAA,EACwB;AACxB,IAAA,MAAM,QAAQH,qBAAA,CAAI,UAAA;AAAA,MAChB,UAAU,IAAA,CAAK,OAAA,EAAS,IAAA,CAAK,QAAA,EAAU,KAAK,SAAS;AAAA,KACvD;AACA,IAAA,MAAM,KAAA,GAAQ,eAAA,CAAgB,MAAA,CAAO,SAAA,EAAW,WAAW,CAAA;AAC3D,IAAA,OAAO;AAAA,MACLA,qBAAA;AAAA,oBAAA,EACgB,KAAK,CAAA;AAAA,gBAAA,EACT,MAAA,CAAO,OAAO,CAAA,EAAA,EAAK,MAAA,CAAO,MAAM,KAAK,KAAK,CAAA,EAAA,EAAK,SAAS,CAAA,EAAA,EAAK,SAAS,CAAA;AAAA;AAAA,oCAAA,EAElD,KAAK,oBAAoB,SAAS;AAAA,MAAA;AAAA,KAEpE;AAAA,EACF,CAAA;AAAA,EAEA,gBAAA,CACE,IAAA,EACA,MAAA,EACA,SAAA,EACwB;AACxB,IAAA,MAAM,QAAQA,qBAAA,CAAI,UAAA;AAAA,MAChB,UAAU,IAAA,CAAK,OAAA,EAAS,IAAA,CAAK,QAAA,EAAU,KAAK,SAAS;AAAA,KACvD;AACA,IAAA,MAAM,YAAYA,qBAAA,CAAI,IAAA;AAAA,MACpB,OAAO,IAAA,CAAK,GAAA;AAAA,QACV,CAAC,GAAA,KACCA,qBAAA,CAAA,CAAA,EAAO,MAAA,CAAO,OAAO,KAAK,GAAA,CAAI,MAAM,CAAA,EAAA,EAAK,eAAA,CAAgB,IAAI,SAAA,EAAW,WAAW,CAAC,CAAA,EAAA,EAAK,SAAS,KAAK,SAAS,CAAA,CAAA;AAAA,OACpH;AAAA,MACAA,qBAAA,CAAA,EAAA;AAAA,KACF;AAIA,IAAA,OAAO;AAAA,MACLA,qBAAA;AAAA,oBAAA,EACgB,KAAK,CAAA;AAAA,eAAA,EACV,SAAS;AAAA;AAAA;AAAA,MAAA;AAAA,KAItB;AAAA,EACF,CAAA;AAAA,EAEA,WAAA,CAAY,MAAM,MAAA,EAAuD;AACvE,IAAA,MAAM,QAAQA,qBAAA,CAAI,UAAA;AAAA,MAChB,UAAU,IAAA,CAAK,OAAA,EAAS,IAAA,CAAK,QAAA,EAAU,KAAK,SAAS;AAAA,KACvD;AACA,IAAA,OAAO;AAAA,MACLA,qBAAA;AAAA,oBAAA,EACgB,KAAK;AAAA,2BAAA,EACE,MAAA,CAAO,OAAO,CAAA,iBAAA,EAAoB,MAAA,CAAO,MAAM;AAAA,MAAA;AAAA,KAExE;AAAA,EACF,CAAA;AAAA,EAEA,gBAAA,CACE,MACA,MAAA,EAEwB;AACxB,IAAA,IAAI,MAAA,CAAO,OAAA,CAAQ,MAAA,KAAW,CAAA,SAAU,EAAC;AACzC,IAAA,MAAM,QAAQA,qBAAA,CAAI,UAAA;AAAA,MAChB,UAAU,IAAA,CAAK,OAAA,EAAS,IAAA,CAAK,QAAA,EAAU,KAAK,SAAS;AAAA,KACvD;AACA,IAAA,OAAO;AAAA,MACLA,oCAAkB,KAAK,CAAA,oBAAA,EAAuB,MAAA,CAAO,OAAO,sBAAsBA,qBAAA,CAAI,IAAA;AAAA,QACpF,OAAO,OAAA,CAAQ,GAAA,CAAI,CAAC,MAAA,KAAWA,qBAAA,CAAA,EAAM,MAAM,CAAA,CAAE,CAAA;AAAA,QAC7CA,qBAAA,CAAA,EAAA;AAAA,OACD,CAAA,CAAA;AAAA,KACH;AAAA,EACF,CAAA;AAAA,EAEA,WAAA,CACE,IAAA,EACA,MAAA,EACA,UAAA,EACa;AACb,IAAA,MAAM,QAAQ,SAAA,CAAU,IAAA,CAAK,SAAS,IAAA,CAAK,QAAA,EAAU,KAAK,SAAS,CAAA;AACnE,IAAA,MAAM,MAAA,GAASA,qBAAA,CAAI,UAAA,CAAW,KAAK,CAAA;AACnC,IAAA,MAAM,eAAA,GAAkBA,wBAAM,MAAM,CAAA,YAAA,CAAA;AACpC,IAAA,MAAM,QAAA,GAAW,kBAAA;AAAA,MACf,eAAA;AAAA,MACA,MAAA,CAAO,cAAA;AAAA,MACP,MAAA,CAAO;AAAA,KACT;AACA,IAAA,MAAM,KAAA,GAAQI,uCAAA,CAAsB,QAAA,EAAU,MAAA,CAAO,MAAM,CAAA;AAE3D,IAAA,IAAI,YAAA,CAAa,IAAI,CAAA,EAAG;AAKtB,MAAA,MAAM,SAAA,GAAY,gBAAgB,IAAI,CAAA;AACtC,MAAA,MAAM,KAAA,GAAQ,eAAA,CAAgB,MAAA,CAAO,cAAA,EAAgB,gBAAgB,CAAA;AACrE,MAAA,MAAMC,WAAAA,GAA4B;AAAA,QAChCL,qBAAA,CAAA,EAAM,MAAM,CAAA,cAAA,EAAiB,MAAA,CAAO,OAAO,CAAA;AAAA,OAC7C;AACA,MAAA,IAAI,MAAA,CAAO,aAAa,MAAA,EAAW;AACjC,QAAAK,WAAAA,CAAW,IAAA;AAAA,UACTC,yCAAA,CAAwB,QAAA,EAAU,MAAA,CAAO,MAAA,EAAQ,OAAO,QAAQ;AAAA,SAClE;AAAA,MACF;AAOA,MAAA,IAAI,eAAe,MAAA,EAAW;AAC5B,QAAAD,YAAW,IAAA,CAAKL,qBAAA,CAAA,EAAM,MAAM,CAAA,eAAA,EAAkB,UAAU,CAAA,CAAA,CAAG,CAAA;AAAA,MAC7D;AAGA,MAAA,MAAM,KAAA,GAAQ,MAAA,CAAO,KAAA,IAAS,MAAA,CAAO,MAAA,IAAU,CAAA,CAAA;AAC/C,MAAA,MAAM,IAAA,GACJ,UAAA,KAAe,MAAA,GAAY,KAAA,GAAQ,KAAA,GAAQ,0BAAA;AAC7C,MAAA,MAAMO,WAAAA,GAAaC,kCAAA,CAAiB,MAAA,CAAO,KAAA,EAAO,OAAO,MAAM,CAAA;AAC/D,MAAA,OAAOR,qBAAA;AAAA,eAAA,EACI,MAAM,0BAA0B,KAAK,CAAA;AAAA,0BAAA,EAC1B,SAAS,CAAA,EAAA,EAAK,KAAK,CAAA,EAAA,EAAK,IAAI,CAAA;AAAA,aAAA,EACzC,MAAM,OAAO,MAAM,CAAA;AAAA,cAAA,EAClBA,qBAAA,CAAI,IAAA,CAAKK,WAAAA,EAAYL,qBAAA,CAAA,KAAA,CAAU,CAAC;AAAA,iBAAA,EAC7B,QAAQ,CAAA;AAAA,QAAA,EACjBO,WAAU;AAAA,MAAA,CAAA;AAAA,IAEhB;AAGA,IAAA,MAAM,UAAA,GAA4B;AAAA,MAChCP,qBAAA,CAAA,EAAM,MAAM,CAAA,cAAA,EAAiB,MAAA,CAAO,OAAO,CAAA;AAAA,KAC7C;AACA,IAAA,IAAI,eAAe,MAAA,EAAW;AAC5B,MAAA,UAAA,CAAW,IAAA,CAAKA,qBAAA,CAAA,EAAM,MAAM,CAAA,eAAA,EAAkB,UAAU,CAAA,CAAA,CAAG,CAAA;AAAA,IAC7D;AACA,IAAA,IAAI,MAAA,CAAO,aAAa,MAAA,EAAW;AACjC,MAAA,UAAA,CAAW,IAAA;AAAA,QACTM,yCAAA,CAAwB,QAAA,EAAU,MAAA,CAAO,MAAA,EAAQ,OAAO,QAAQ;AAAA,OAClE;AAAA,IACF;AACA,IAAA,MAAM,UAAA,GAAaE,kCAAA,CAAiB,MAAA,CAAO,KAAA,EAAO,OAAO,MAAM,CAAA;AAC/D,IAAA,OAAOR,qBAAA;AAAA,aAAA,EACI,MAAM,0BAA0B,KAAK,CAAA;AAAA,WAAA,EACvC,MAAM;AAAA,YAAA,EACLA,qBAAA,CAAI,IAAA,CAAK,UAAA,EAAYA,qBAAA,CAAA,KAAA,CAAU,CAAC;AAAA,eAAA,EAC7B,QAAQ,CAAA;AAAA,MAAA,EACjB,UAAU;AAAA,IAAA,CAAA;AAAA,EAEhB,CAAA;AAAA,EAEA,kBAAA,CAAmB,eAAA,EAAiB,cAAA,EAAgB,MAAA,EAAQ;AAC1D,IAAA,OAAO,kBAAA,CAAmB,eAAA,EAAiB,cAAA,EAAgB,MAAM,CAAA;AAAA,EACnE,CAAA;AAAA,EAEA,iBAAiB,IAAA,EAA+B;AAC9C,IAAA,IAAI,CAAC,YAAA,CAAa,IAAI,CAAA,EAAG,OAAO,MAAA;AAChC,IAAA,OAAOA,qBAAA,CAAI,GAAA;AAAA,MACT,oBAAA;AAAA,QACE,UAAU,IAAA,CAAK,OAAA,EAAS,IAAA,CAAK,QAAA,EAAU,KAAK,SAAS,CAAA;AAAA,QACrD;AAAA;AACF,KACF;AAAA,EACF,CAAA;AAAA,EAEA,eAAe,IAAA,EAA+B;AAC5C,IAAA,IAAI,CAAC,YAAA,CAAa,IAAI,CAAA,EAAG,OAAO,MAAA;AAChC,IAAA,MAAM,SAAA,GAAY,gBAAgB,IAAI,CAAA;AACtC,IAAA,OAAOA,sBAAI,GAAA,CAAI,CAAA,qBAAA,EAAwBE,iCAAA,CAAgB,SAAS,CAAC,CAAA,CAAE,CAAA;AAAA,EACrE,CAAA;AAAA,EAEA,iBAAiB,IAAA,EAAyB;AACxC,IAAA,MAAM,KAAA,GAAQA,iCAAA;AAAA,MACZ,UAAU,IAAA,CAAK,OAAA,EAAS,IAAA,CAAK,QAAA,EAAU,KAAK,SAAS;AAAA,KACvD;AACA,IAAA,MAAM,aAAuB,EAAC;AAG9B,IAAA,IAAI,YAAA,CAAa,IAAI,CAAA,EAAG;AACtB,MAAA,UAAA,CAAW,IAAA;AAAA,QACT,CAAA,qBAAA,EAAwBA,iCAAA,CAAgB,eAAA,CAAgB,IAAI,CAAC,CAAC,CAAA;AAAA,OAChE;AAAA,IACF;AACA,IAAA,UAAA,CAAW,IAAA,CAAK,CAAA,qBAAA,EAAwB,KAAK,CAAA,CAAE,CAAA;AAC/C,IAAA,OAAO,UAAA;AAAA,EACT;AACF;AAUA,IAAM,0BAAA,GAA6B,CAAA;AAEnC,SAAS,gBAAgB,IAAA,EAA0B;AACjD,EAAA,OAAOD,oCAAA;AAAA,IACL,YAAA;AAAA,IACA,IAAA,CAAK,OAAA;AAAA,IACL,IAAA,CAAK,QAAA;AAAA,IACL,IAAA,CAAK;AAAA,GACP;AACF;AAEA,SAAS,oBAAA,CAAqB,OAAe,IAAA,EAA0B;AACrE,EAAA,MAAM,SAAA,GAAYC,iCAAA,CAAgB,eAAA,CAAgB,IAAI,CAAC,CAAA;AACvD,EAAA,MAAM,MAAA,GAAS,iBAAA,CAAkB,IAAA,CAAK,MAAM,CAAA;AAC5C,EAAA,OAAO,8BAA8B,SAAS,CAAA,IAAA,EAAOA,kCAAgB,KAAK,CAAC,2CAA2C,MAAM,CAAA,IAAA,CAAA;AAC9H","file":"chunk-WDBXJOU5.cjs","sourcesContent":["/**\n * libSQL native vector strategy.\n *\n * libSQL ships vector search in core — no extension to load — so this\n * strategy is wired unconditionally by `createLibsqlBackend`. It backs each\n * `(nodeKind, fieldPath)` with its own `F32_BLOB(N)` table (the spike proved\n * the dimension MUST live in the column type for `libsql_vector_idx` to\n * build), brute-forces with `vector_distance_cos` / `vector_distance_l2`, and\n * accelerates with DiskANN (`libsql_vector_idx` + `vector_top_k`) when the\n * slot declares an approximate index.\n *\n * Metric support is `cosine` + `l2` (no `inner_product`), matching sqlite-vec\n * and advertised as data on `capabilities`. The generic `\"hnsw\"` index intent\n * (the portable \"give me an ANN index\" signal that `embedding()` defaults to)\n * is realized here as libSQL's DiskANN index; `\"ivfflat\"` is not supported and\n * a slot declaring it is materialized brute-force-only.\n *\n * The `pgvectorStrategy` and `sqliteVecStrategy` siblings follow the same\n * `VectorStrategy` contract for their engines.\n */\nimport { type StrategyTableContribution } from \"../../../backend/table-contribution\";\nimport {\n  type DeleteEmbeddingParams,\n  type UpsertEmbeddingBatchParams,\n  type UpsertEmbeddingParams,\n  type VectorCapabilities,\n  type VectorMetric,\n  type VectorSearchParams,\n} from \"../../../backend/types\";\nimport { sql, type SqlFragment } from \"../../sql-fragment\";\nimport {\n  assertFiniteEmbedding,\n  quoteIdentifier,\n  VECTOR_CONTRIBUTION_PREFIX,\n  vectorMinScoreCondition,\n  vectorPhysicalName,\n  vectorScoreExpression,\n  type VectorSlot,\n  type VectorStrategy,\n} from \"../vector-strategy\";\nimport { vectorPageClause } from \"./pagination\";\n\n/** Physical-name prefixes for the per-field table and its DiskANN index. */\nconst TABLE_PREFIX = \"tg_vec\";\nconst INDEX_PREFIX = \"tg_vecidx\";\n\n/**\n * libSQL `F32_BLOB` caps at 65,536 dimensions (per Turso docs / spike §2).\n */\nconst LIBSQL_MAX_DIMENSIONS = 65_536;\n\nconst LIBSQL_CAPABILITIES: VectorCapabilities = {\n  supported: true,\n  metrics: [\"cosine\", \"l2\"],\n  // \"hnsw\" = portable ANN intent, realized as DiskANN. \"none\" = brute-force.\n  indexTypes: [\"hnsw\", \"none\"],\n  maxDimensions: LIBSQL_MAX_DIMENSIONS,\n  // `vector_top_k` is a table function: no filter pushdown, no way to re-enter\n  // the index. A filtered DiskANN search over-fetches by\n  // CANDIDATE_FILTER_OVERFETCH and filters afterwards, so it under-fills once\n  // more than the headroom is filtered out. Unlike sqlite-vec (pushdown) and\n  // pgvector >= 0.8 (iterative scan), libSQL has no recovery at all.\n  filteredApproximateSearch: {\n    mode: \"post-filter\",\n    guaranteesFullPage: false,\n  },\n};\n\n/** Whether a slot's declared index type maps to a real libSQL ANN index. */\nfunction usesAnnIndex(slot: VectorSlot): boolean {\n  return slot.indexType === \"hnsw\";\n}\n\n/** libSQL metric token accepted by `libsql_vector_idx(col, 'metric=…')`. */\nfunction libsqlMetricToken(metric: VectorMetric): string {\n  switch (metric) {\n    case \"cosine\": {\n      return \"cosine\";\n    }\n    case \"l2\": {\n      return \"l2\";\n    }\n    case \"inner_product\": {\n      throw new Error(\n        \"libSQL vector search does not support inner_product. Use 'cosine' or 'l2'.\",\n      );\n    }\n    default: {\n      const _exhaustive: never = metric;\n      throw new Error(`Unsupported vector metric: ${String(_exhaustive)}`);\n    }\n  }\n}\n\n/**\n * Formats an embedding as the text argument to `vector32(...)`. The value is\n * bound as a parameter (not interpolated) — `vector32` parses it into the\n * F32 blob. Finiteness is validated first so a NaN names its index.\n */\nfunction vector32Literal(\n  embedding: readonly number[],\n  name: string,\n): SqlFragment {\n  assertFiniteEmbedding(embedding, name);\n  return sql`vector32(${`[${embedding.join(\",\")}]`})`;\n}\n\nfunction distanceExpression(\n  embeddingColumn: SqlFragment,\n  queryEmbedding: readonly number[],\n  metric: VectorMetric,\n): SqlFragment {\n  const query = vector32Literal(queryEmbedding, \"queryEmbedding\");\n  switch (metric) {\n    case \"cosine\": {\n      return sql`vector_distance_cos(${embeddingColumn}, ${query})`;\n    }\n    case \"l2\": {\n      return sql`vector_distance_l2(${embeddingColumn}, ${query})`;\n    }\n    case \"inner_product\": {\n      throw new Error(\n        \"libSQL vector search does not support inner_product. Use 'cosine' or 'l2'.\",\n      );\n    }\n    default: {\n      const _exhaustive: never = metric;\n      throw new Error(`Unsupported vector metric: ${String(_exhaustive)}`);\n    }\n  }\n}\n\nfunction tableName(\n  graphId: string,\n  nodeKind: string,\n  fieldPath: string,\n): string {\n  return vectorPhysicalName(TABLE_PREFIX, graphId, nodeKind, fieldPath);\n}\n\nexport const libsqlVectorStrategy: VectorStrategy = {\n  name: \"libsql-native\",\n  capabilities: LIBSQL_CAPABILITIES,\n\n  tableName,\n\n  ownedTables(slot): readonly StrategyTableContribution[] {\n    const table = tableName(slot.graphId, slot.nodeKind, slot.fieldPath);\n    const name = quoteIdentifier(table);\n\n    // No standalone graph_id index: the PRIMARY KEY (graph_id, node_id) already\n    // covers `WHERE graph_id = ?` via its leading column, so a separate index\n    // would be pure write amplification.\n    const createDdl = [\n      `CREATE TABLE IF NOT EXISTS ${name} (\n  \"graph_id\" TEXT NOT NULL,\n  \"node_id\" TEXT NOT NULL,\n  \"embedding\" F32_BLOB(${slot.dimensions}) NOT NULL,\n  \"created_at\" TEXT NOT NULL,\n  \"updated_at\" TEXT NOT NULL,\n  PRIMARY KEY (\"graph_id\", \"node_id\")\n);`,\n    ];\n\n    if (usesAnnIndex(slot)) {\n      // The DiskANN index DDL is deterministic raw SQL; fold it into the\n      // contribution so materialization creates table + index together.\n      createDdl.push(libsqlVectorIndexDdl(table, slot));\n    }\n\n    return [\n      {\n        logicalName: `${VECTOR_CONTRIBUTION_PREFIX}:${slot.nodeKind}.${slot.fieldPath}`,\n        owner: \"libsql-native\",\n        tableName: table,\n        createDdl,\n        runtimeEnsure: true,\n      },\n    ];\n  },\n\n  buildUpsert(\n    slot,\n    params: UpsertEmbeddingParams,\n    timestamp,\n  ): readonly SqlFragment[] {\n    const table = sql.identifier(\n      tableName(slot.graphId, slot.nodeKind, slot.fieldPath),\n    );\n    const value = vector32Literal(params.embedding, \"embedding\");\n    return [\n      sql`\n        INSERT INTO ${table} (\"graph_id\", \"node_id\", \"embedding\", \"created_at\", \"updated_at\")\n        VALUES (${params.graphId}, ${params.nodeId}, ${value}, ${timestamp}, ${timestamp})\n        ON CONFLICT (\"graph_id\", \"node_id\")\n        DO UPDATE SET \"embedding\" = ${value}, \"updated_at\" = ${timestamp}\n      `,\n    ];\n  },\n\n  buildUpsertBatch(\n    slot,\n    params: UpsertEmbeddingBatchParams,\n    timestamp,\n  ): readonly SqlFragment[] {\n    const table = sql.identifier(\n      tableName(slot.graphId, slot.nodeKind, slot.fieldPath),\n    );\n    const valueRows = sql.join(\n      params.rows.map(\n        (row) =>\n          sql`(${params.graphId}, ${row.nodeId}, ${vector32Literal(row.embedding, \"embedding\")}, ${timestamp}, ${timestamp})`,\n      ),\n      sql`, `,\n    );\n    // `excluded.\"embedding\"` reuses the row's already-converted F32_BLOB\n    // value, so the multi-row form needs no per-row conversion in the\n    // update arm (unlike buildUpsert's single bound value).\n    return [\n      sql`\n        INSERT INTO ${table} (\"graph_id\", \"node_id\", \"embedding\", \"created_at\", \"updated_at\")\n        VALUES ${valueRows}\n        ON CONFLICT (\"graph_id\", \"node_id\")\n        DO UPDATE SET \"embedding\" = excluded.\"embedding\", \"updated_at\" = excluded.\"updated_at\"\n      `,\n    ];\n  },\n\n  buildDelete(slot, params: DeleteEmbeddingParams): readonly SqlFragment[] {\n    const table = sql.identifier(\n      tableName(slot.graphId, slot.nodeKind, slot.fieldPath),\n    );\n    return [\n      sql`\n        DELETE FROM ${table}\n        WHERE \"graph_id\" = ${params.graphId} AND \"node_id\" = ${params.nodeId}\n      `,\n    ];\n  },\n\n  buildDeleteBatch(\n    slot,\n    params: Omit<DeleteEmbeddingParams, \"nodeId\"> &\n      Readonly<{ nodeIds: readonly string[] }>,\n  ): readonly SqlFragment[] {\n    if (params.nodeIds.length === 0) return [];\n    const table = sql.identifier(\n      tableName(slot.graphId, slot.nodeKind, slot.fieldPath),\n    );\n    return [\n      sql`DELETE FROM ${table} WHERE \"graph_id\" = ${params.graphId} AND \"node_id\" IN (${sql.join(\n        params.nodeIds.map((nodeId) => sql`${nodeId}`),\n        sql`, `,\n      )})`,\n    ];\n  },\n\n  buildSearch(\n    slot,\n    params: VectorSearchParams,\n    candidates?: SqlFragment,\n  ): SqlFragment {\n    const table = tableName(slot.graphId, slot.nodeKind, slot.fieldPath);\n    const quoted = sql.identifier(table);\n    const embeddingColumn = sql`${quoted}.\"embedding\"`;\n    const distance = distanceExpression(\n      embeddingColumn,\n      params.queryEmbedding,\n      params.metric,\n    );\n    const score = vectorScoreExpression(distance, params.metric);\n\n    if (usesAnnIndex(slot)) {\n      // DiskANN: vector_top_k returns rowids from the per-field table; join\n      // back, then scope by graph and compute the real distance/score.\n      // `vector_top_k` is table-global, so single-graph deployments are exact;\n      // multi-graph recall is bounded by the over-fetched k (documented).\n      const indexName = libsqlIndexName(slot);\n      const query = vector32Literal(params.queryEmbedding, \"queryEmbedding\");\n      const conditions: SqlFragment[] = [\n        sql`${quoted}.\"graph_id\" = ${params.graphId}`,\n      ];\n      if (params.minScore !== undefined) {\n        conditions.push(\n          vectorMinScoreCondition(distance, params.metric, params.minScore),\n        );\n      }\n      // `vector_top_k` is a table function with no filter pushdown, so a\n      // candidate filter can only be applied AFTER the ANN retrieval.\n      // Over-fetch the DiskANN k to leave headroom for filtered-out rows;\n      // recall is bounded by the over-fetch, and the page under-fills once\n      // more than the headroom is filtered out. Declared, not merely noted:\n      // `capabilities.filteredApproximateSearch.mode === \"post-filter\"`.\n      if (candidates !== undefined) {\n        conditions.push(sql`${quoted}.\"node_id\" IN (${candidates})`);\n      }\n      // `pageK` covers the requested page (`limit + offset`); the\n      // candidate-filter over-fetch multiplies on top of it.\n      const pageK = params.limit + (params.offset ?? 0);\n      const annK =\n        candidates === undefined ? pageK : pageK * CANDIDATE_FILTER_OVERFETCH;\n      const pageClause = vectorPageClause(params.limit, params.offset);\n      return sql`\n        SELECT ${quoted}.\"node_id\" AS node_id, ${score} AS score\n        FROM vector_top_k(${indexName}, ${query}, ${annK})\n        JOIN ${quoted} ON ${quoted}.rowid = id\n        WHERE ${sql.join(conditions, sql` AND `)}\n        ORDER BY ${distance} ASC\n        ${pageClause}\n      `;\n    }\n\n    // Brute-force scan.\n    const conditions: SqlFragment[] = [\n      sql`${quoted}.\"graph_id\" = ${params.graphId}`,\n    ];\n    if (candidates !== undefined) {\n      conditions.push(sql`${quoted}.\"node_id\" IN (${candidates})`);\n    }\n    if (params.minScore !== undefined) {\n      conditions.push(\n        vectorMinScoreCondition(distance, params.metric, params.minScore),\n      );\n    }\n    const pageClause = vectorPageClause(params.limit, params.offset);\n    return sql`\n      SELECT ${quoted}.\"node_id\" AS node_id, ${score} AS score\n      FROM ${quoted}\n      WHERE ${sql.join(conditions, sql` AND `)}\n      ORDER BY ${distance} ASC\n      ${pageClause}\n    `;\n  },\n\n  distanceExpression(embeddingColumn, queryEmbedding, metric) {\n    return distanceExpression(embeddingColumn, queryEmbedding, metric);\n  },\n\n  buildCreateIndex(slot): SqlFragment | undefined {\n    if (!usesAnnIndex(slot)) return undefined;\n    return sql.raw(\n      libsqlVectorIndexDdl(\n        tableName(slot.graphId, slot.nodeKind, slot.fieldPath),\n        slot,\n      ),\n    );\n  },\n\n  buildDropIndex(slot): SqlFragment | undefined {\n    if (!usesAnnIndex(slot)) return undefined;\n    const indexName = libsqlIndexName(slot);\n    return sql.raw(`DROP INDEX IF EXISTS ${quoteIdentifier(indexName)}`);\n  },\n\n  buildDropStorage(slot): readonly string[] {\n    const table = quoteIdentifier(\n      tableName(slot.graphId, slot.nodeKind, slot.fieldPath),\n    );\n    const statements: string[] = [];\n    // Drop the DiskANN index first so libSQL reclaims its shadow tables,\n    // then the table itself.\n    if (usesAnnIndex(slot)) {\n      statements.push(\n        `DROP INDEX IF EXISTS ${quoteIdentifier(libsqlIndexName(slot))}`,\n      );\n    }\n    statements.push(`DROP TABLE IF EXISTS ${table}`);\n    return statements;\n  },\n};\n\n/**\n * DiskANN over-fetch multiplier applied when a candidate filter is present:\n * `vector_top_k` cannot pre-filter, so fetch `4k` neighbors and filter after.\n * Mirrors the hybrid facade's 4x over-fetch. Recall for the filtered search\n * is bounded by this headroom — if more than `3k` of the top `4k` neighbors\n * are filtered out, fewer than `k` rows return. That is the observable\n * meaning of `capabilities.filteredApproximateSearch.guaranteesFullPage`.\n */\nconst CANDIDATE_FILTER_OVERFETCH = 4;\n\nfunction libsqlIndexName(slot: VectorSlot): string {\n  return vectorPhysicalName(\n    INDEX_PREFIX,\n    slot.graphId,\n    slot.nodeKind,\n    slot.fieldPath,\n  );\n}\n\nfunction libsqlVectorIndexDdl(table: string, slot: VectorSlot): string {\n  const indexName = quoteIdentifier(libsqlIndexName(slot));\n  const metric = libsqlMetricToken(slot.metric);\n  return `CREATE INDEX IF NOT EXISTS ${indexName} ON ${quoteIdentifier(table)}(libsql_vector_idx(\"embedding\", 'metric=${metric}'));`;\n}\n"]}

package/dist/{chunk-FMPZPOUD.js → chunk-WUFASQUO.js}

@@ -1,4 +1,4 @@
-import { unwrap, validateGraphExtension } from './chunk-EQOQOT55.js';
+import { unwrap, validateGraphExtension } from './chunk-4GUBTVPV.js';
 
 // src/graph-extension/define-graph-extension.ts
 function defineGraphExtension(input) {
@@ -6,5 +6,5 @@ function defineGraphExtension(input) {
 }
 
 export { defineGraphExtension };
-//# sourceMappingURL=chunk-FMPZPOUD.js.map
-//# sourceMappingURL=chunk-FMPZPOUD.js.map
+//# sourceMappingURL=chunk-WUFASQUO.js.map
+//# sourceMappingURL=chunk-WUFASQUO.js.map

package/dist/{chunk-FMPZPOUD.js.map → chunk-WUFASQUO.js.map}

@@ -1 +1 @@
-{"version":3,"sources":["../src/graph-extension/define-graph-extension.ts"],"names":[],"mappings":";;;AAyDO,SAAS,qBAAqB,KAAA,EAAuC;AAC1E,EAAA,OAAO,OAAO,sBAAA,CAAuB,KAAA,EAAO,EAAE,MAAA,EAAQ,IAAA,EAAM,CAAC,CAAA;AAC/D","file":"chunk-FMPZPOUD.js","sourcesContent":["/**\n * Public entry for declaring a graph extension.\n *\n * Pure value: validates the input, deeply freezes the result, and returns\n * a `GraphExtension`. Invalid documents throw\n * `GraphExtensionValidationError` carrying every issue with a\n * JSON-pointer `path` to the offending field.\n */\nimport { unwrap } from \"../utils/result\";\nimport { type GraphExtension } from \"./extension-types\";\nimport { validateGraphExtension } from \"./validation\";\n\n/**\n * Validates and freezes a graph-extension document.\n *\n * Authoring entry point — runs validation in **strict** mode: unknown\n * top-level keys (e.g. `node` instead of `nodes`) and unsupported\n * string formats (e.g. `\"date-time\"` with a hyphen instead of\n * `\"datetime\"`) fail loudly with `UNKNOWN_DOCUMENT_KEY` /\n * `UNSUPPORTED_STRING_FORMAT`. The persistence-load path leaves both\n * checks off so a document committed by a future v1.x writer with\n * additive fields still parses on an older v1 reader. Callers\n * accepting raw JSON from an untyped source (e.g. an LLM proposal)\n * should validate first via `validateGraphExtension` and surface\n * the structured issues, then pass the validated document here.\n *\n * @param input - Document describing additional node kinds, edge\n *   kinds, and ontology relations. Must satisfy the v1 property-type\n *   subset documented in `ExtensionPropertyType`.\n *\n * @returns The same document, deeply frozen and shape-checked.\n *\n * @throws {GraphExtensionValidationError} when the document violates\n *   the v1 property-type subset, references undeclared kinds, contains\n *   ontology cycles, etc. The thrown error's `details.issues` array\n *   carries every failure with a JSON-pointer path.\n * @throws {GraphExtensionVersionUnsupportedError} when the document\n *   declares a future major version this library cannot safely decode.\n *\n * @example\n * ```typescript\n * const extension = defineGraphExtension({\n *   nodes: {\n *     Paper: {\n *       properties: {\n *         doi:   { type: \"string\" },\n *         title: { type: \"string\", searchable: { language: \"english\" } },\n *       },\n *       unique: [{ name: \"paper_doi\", fields: [\"doi\"] }],\n *     },\n *   },\n * });\n *\n * const evolved = await store.evolve(extension);\n * const papers = evolved.getNodeCollectionOrThrow(\"Paper\");\n * ```\n */\nexport function defineGraphExtension(input: GraphExtension): GraphExtension {\n  return unwrap(validateGraphExtension(input, { strict: true }));\n}\n"]}
+{"version":3,"sources":["../src/graph-extension/define-graph-extension.ts"],"names":[],"mappings":";;;AAyDO,SAAS,qBAAqB,KAAA,EAAuC;AAC1E,EAAA,OAAO,OAAO,sBAAA,CAAuB,KAAA,EAAO,EAAE,MAAA,EAAQ,IAAA,EAAM,CAAC,CAAA;AAC/D","file":"chunk-WUFASQUO.js","sourcesContent":["/**\n * Public entry for declaring a graph extension.\n *\n * Pure value: validates the input, deeply freezes the result, and returns\n * a `GraphExtension`. Invalid documents throw\n * `GraphExtensionValidationError` carrying every issue with a\n * JSON-pointer `path` to the offending field.\n */\nimport { unwrap } from \"../utils/result\";\nimport { type GraphExtension } from \"./extension-types\";\nimport { validateGraphExtension } from \"./validation\";\n\n/**\n * Validates and freezes a graph-extension document.\n *\n * Authoring entry point — runs validation in **strict** mode: unknown\n * top-level keys (e.g. `node` instead of `nodes`) and unsupported\n * string formats (e.g. `\"date-time\"` with a hyphen instead of\n * `\"datetime\"`) fail loudly with `UNKNOWN_DOCUMENT_KEY` /\n * `UNSUPPORTED_STRING_FORMAT`. The persistence-load path leaves both\n * checks off so a document committed by a future v1.x writer with\n * additive fields still parses on an older v1 reader. Callers\n * accepting raw JSON from an untyped source (e.g. an LLM proposal)\n * should validate first via `validateGraphExtension` and surface\n * the structured issues, then pass the validated document here.\n *\n * @param input - Document describing additional node kinds, edge\n *   kinds, and ontology relations. Must satisfy the v1 property-type\n *   subset documented in `ExtensionPropertyType`.\n *\n * @returns The same document, deeply frozen and shape-checked.\n *\n * @throws {GraphExtensionValidationError} when the document violates\n *   the v1 property-type subset, references undeclared kinds, contains\n *   ontology cycles, etc. The thrown error's `details.issues` array\n *   carries every failure with a JSON-pointer path.\n * @throws {GraphExtensionVersionUnsupportedError} when the document\n *   declares a future major version this library cannot safely decode.\n *\n * @example\n * ```typescript\n * const extension = defineGraphExtension({\n *   nodes: {\n *     Paper: {\n *       properties: {\n *         doi:   { type: \"string\" },\n *         title: { type: \"string\", searchable: { language: \"english\" } },\n *       },\n *       unique: [{ name: \"paper_doi\", fields: [\"doi\"] }],\n *     },\n *   },\n * });\n *\n * const evolved = await store.evolve(extension);\n * const papers = evolved.getNodeCollectionOrThrow(\"Paper\");\n * ```\n */\nexport function defineGraphExtension(input: GraphExtension): GraphExtension {\n  return unwrap(validateGraphExtension(input, { strict: true }));\n}\n"]}