@nicia-ai/typegraph 0.45.0 → 0.46.1

package/dist/{chunk-D56XG4EI.cjs → chunk-MXJDTH5B.cjs}

@@ -1,8 +1,8 @@
 'use strict';
 
-var chunk4SZ6XPTG_cjs = require('./chunk-4SZ6XPTG.cjs');
-var chunkJXUTCSXX_cjs = require('./chunk-JXUTCSXX.cjs');
-var chunkU5W4LKZV_cjs = require('./chunk-U5W4LKZV.cjs');
+var chunkA4OC4DVN_cjs = require('./chunk-A4OC4DVN.cjs');
+var chunk4UGOKMI5_cjs = require('./chunk-4UGOKMI5.cjs');
+var chunkVCRRKBLN_cjs = require('./chunk-VCRRKBLN.cjs');
 
 // src/query/dialect/vector/pgvector-strategy.ts
 var TABLE_PREFIX = "tg_vec";
@@ -40,6 +40,17 @@ var PGVECTOR_CAPABILITIES = {
   filteredApproximateSearch: {
     mode: "iterative-scan",
     guaranteesFullPage: false
+  },
+  // The one bundled engine with a real per-search frontier: `hnsw.ef_search`
+  // sizes the HNSW candidate list. IVFFlat has no equivalent (`ivfflat.probes`
+  // is a different structure's knob and is not what `efSearch` means), and the
+  // GUC is applied with `SET LOCAL` inside the search's own transaction so
+  // concurrent searches cannot inherit each other's override.
+  searchFrontierTuning: {
+    tunable: true,
+    parameter: "hnsw.ef_search",
+    indexType: "hnsw",
+    requiresTransactionScope: true
   }
 };
 function usesAnnIndex(slot) {
@@ -63,20 +74,20 @@ function operatorClass(metric) {
   }
 }
 function vectorLiteral(embedding, name) {
-  chunkJXUTCSXX_cjs.assertFiniteEmbedding(embedding, name);
-  return chunkU5W4LKZV_cjs.sql`${`[${embedding.join(",")}]`}::vector`;
+  chunk4UGOKMI5_cjs.assertFiniteEmbedding(embedding, name);
+  return chunkVCRRKBLN_cjs.sql`${`[${embedding.join(",")}]`}::vector`;
 }
 function distanceExpression(embeddingColumn, queryEmbedding, metric) {
   const query = vectorLiteral(queryEmbedding, "queryEmbedding");
   switch (metric) {
     case "cosine": {
-      return chunkU5W4LKZV_cjs.sql`(${embeddingColumn} <=> ${query})`;
+      return chunkVCRRKBLN_cjs.sql`(${embeddingColumn} <=> ${query})`;
     }
     case "l2": {
-      return chunkU5W4LKZV_cjs.sql`(${embeddingColumn} <-> ${query})`;
+      return chunkVCRRKBLN_cjs.sql`(${embeddingColumn} <-> ${query})`;
     }
     case "inner_product": {
-      return chunkU5W4LKZV_cjs.sql`(${embeddingColumn} <#> ${query})`;
+      return chunkVCRRKBLN_cjs.sql`(${embeddingColumn} <#> ${query})`;
     }
     default: {
       const _exhaustive = metric;
@@ -85,7 +96,7 @@ function distanceExpression(embeddingColumn, queryEmbedding, metric) {
   }
 }
 function tableName(graphId, nodeKind, fieldPath) {
-  return chunkJXUTCSXX_cjs.vectorPhysicalName(TABLE_PREFIX, graphId, nodeKind, fieldPath);
+  return chunk4UGOKMI5_cjs.vectorPhysicalName(TABLE_PREFIX, graphId, nodeKind, fieldPath);
 }
 var pgvectorStrategy = {
   name: "pgvector",
@@ -93,7 +104,7 @@ var pgvectorStrategy = {
   tableName,
   ownedTables(slot) {
     const table = tableName(slot.graphId, slot.nodeKind, slot.fieldPath);
-    const name = chunkJXUTCSXX_cjs.quoteIdentifier(table);
+    const name = chunk4UGOKMI5_cjs.quoteIdentifier(table);
     const createDdl = [
       `CREATE TABLE IF NOT EXISTS ${name} (
   "graph_id" TEXT NOT NULL,
@@ -106,7 +117,7 @@ var pgvectorStrategy = {
     ];
     return [
       {
-        logicalName: `${chunkJXUTCSXX_cjs.VECTOR_CONTRIBUTION_PREFIX}:${slot.nodeKind}.${slot.fieldPath}`,
+        logicalName: `${chunk4UGOKMI5_cjs.VECTOR_CONTRIBUTION_PREFIX}:${slot.nodeKind}.${slot.fieldPath}`,
         owner: "pgvector",
         tableName: table,
         createDdl,
@@ -115,12 +126,12 @@ var pgvectorStrategy = {
     ];
   },
   buildUpsert(slot, params, timestamp) {
-    const table = chunkU5W4LKZV_cjs.sql.identifier(
+    const table = chunkVCRRKBLN_cjs.sql.identifier(
       tableName(slot.graphId, slot.nodeKind, slot.fieldPath)
     );
     const value = vectorLiteral(params.embedding, "embedding");
     return [
-      chunkU5W4LKZV_cjs.sql`
+      chunkVCRRKBLN_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")
@@ -129,17 +140,17 @@ var pgvectorStrategy = {
     ];
   },
   buildUpsertBatch(slot, params, timestamp) {
-    const table = chunkU5W4LKZV_cjs.sql.identifier(
+    const table = chunkVCRRKBLN_cjs.sql.identifier(
       tableName(slot.graphId, slot.nodeKind, slot.fieldPath)
     );
-    const valueRows = chunkU5W4LKZV_cjs.sql.join(
+    const valueRows = chunkVCRRKBLN_cjs.sql.join(
       params.rows.map(
-        (row) => chunkU5W4LKZV_cjs.sql`(${params.graphId}, ${row.nodeId}, ${vectorLiteral(row.embedding, "embedding")}, ${timestamp}, ${timestamp})`
+        (row) => chunkVCRRKBLN_cjs.sql`(${params.graphId}, ${row.nodeId}, ${vectorLiteral(row.embedding, "embedding")}, ${timestamp}, ${timestamp})`
       ),
-      chunkU5W4LKZV_cjs.sql`, `
+      chunkVCRRKBLN_cjs.sql`, `
     );
     return [
-      chunkU5W4LKZV_cjs.sql`
+      chunkVCRRKBLN_cjs.sql`
         INSERT INTO ${table} ("graph_id", "node_id", "embedding", "created_at", "updated_at")
         VALUES ${valueRows}
         ON CONFLICT ("graph_id", "node_id")
@@ -148,11 +159,11 @@ var pgvectorStrategy = {
     ];
   },
   buildDelete(slot, params) {
-    const table = chunkU5W4LKZV_cjs.sql.identifier(
+    const table = chunkVCRRKBLN_cjs.sql.identifier(
       tableName(slot.graphId, slot.nodeKind, slot.fieldPath)
     );
     return [
-      chunkU5W4LKZV_cjs.sql`
+      chunkVCRRKBLN_cjs.sql`
         DELETE FROM ${table}
         WHERE "graph_id" = ${params.graphId} AND "node_id" = ${params.nodeId}
       `
@@ -160,60 +171,60 @@ var pgvectorStrategy = {
   },
   buildDeleteBatch(slot, params) {
     if (params.nodeIds.length === 0) return [];
-    const table = chunkU5W4LKZV_cjs.sql.identifier(
+    const table = chunkVCRRKBLN_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`, `
+      chunkVCRRKBLN_cjs.sql`DELETE FROM ${table} WHERE "graph_id" = ${params.graphId} AND "node_id" IN (${chunkVCRRKBLN_cjs.sql.join(
+        params.nodeIds.map((nodeId) => chunkVCRRKBLN_cjs.sql`${nodeId}`),
+        chunkVCRRKBLN_cjs.sql`, `
       )})`
     ];
   },
   buildSearch(slot, params, candidates) {
-    const table = chunkU5W4LKZV_cjs.sql.identifier(
+    const table = chunkVCRRKBLN_cjs.sql.identifier(
       tableName(slot.graphId, slot.nodeKind, slot.fieldPath)
     );
-    const embeddingColumn = chunkU5W4LKZV_cjs.sql`${table}."embedding"`;
+    const embeddingColumn = chunkVCRRKBLN_cjs.sql`${table}."embedding"`;
     const distance = distanceExpression(
       embeddingColumn,
       params.queryEmbedding,
       params.metric
     );
-    const score = chunkJXUTCSXX_cjs.vectorScoreExpression(distance, params.metric);
+    const score = chunk4UGOKMI5_cjs.vectorScoreExpression(distance, params.metric);
     const conditions = [
-      chunkU5W4LKZV_cjs.sql`${table}."graph_id" = ${params.graphId}`
+      chunkVCRRKBLN_cjs.sql`${table}."graph_id" = ${params.graphId}`
     ];
     if (params.minScore !== void 0) {
       conditions.push(
-        chunkJXUTCSXX_cjs.vectorMinScoreCondition(distance, params.metric, params.minScore)
+        chunk4UGOKMI5_cjs.vectorMinScoreCondition(distance, params.metric, params.minScore)
       );
     }
     if (candidates !== void 0) {
-      conditions.push(chunkU5W4LKZV_cjs.sql`${table}."node_id" IN (${candidates})`);
+      conditions.push(chunkVCRRKBLN_cjs.sql`${table}."node_id" IN (${candidates})`);
     }
     const pageOffset = params.offset ?? 0;
-    const pageClause = chunk4SZ6XPTG_cjs.vectorPageClause(params.limit, params.offset);
+    const pageClause = chunkA4OC4DVN_cjs.vectorPageClause(params.limit, params.offset);
     if (slot.indexType === "ivfflat") {
-      const direction = params.metric === "cosine" ? chunkU5W4LKZV_cjs.sql.raw("DESC") : chunkU5W4LKZV_cjs.sql.raw("ASC");
-      const relaxedBody = chunkU5W4LKZV_cjs.sql`
+      const direction = params.metric === "cosine" ? chunkVCRRKBLN_cjs.sql.raw("DESC") : chunkVCRRKBLN_cjs.sql.raw("ASC");
+      const relaxedBody = chunkVCRRKBLN_cjs.sql`
         SELECT ${table}."node_id" AS node_id, ${score} AS score
         FROM ${table}
-        WHERE ${chunkU5W4LKZV_cjs.sql.join(conditions, chunkU5W4LKZV_cjs.sql` AND `)}
+        WHERE ${chunkVCRRKBLN_cjs.sql.join(conditions, chunkVCRRKBLN_cjs.sql` AND `)}
         ORDER BY ${distance} ASC
         LIMIT ${params.limit + pageOffset}
       `;
-      return chunkU5W4LKZV_cjs.sql`
+      return chunkVCRRKBLN_cjs.sql`
         WITH tg_vec_relaxed AS MATERIALIZED (${relaxedBody})
         SELECT node_id, score FROM tg_vec_relaxed
         ORDER BY score ${direction}, node_id ASC
         ${pageClause}
       `;
     }
-    return chunkU5W4LKZV_cjs.sql`
+    return chunkVCRRKBLN_cjs.sql`
       SELECT ${table}."node_id" AS node_id, ${score} AS score
       FROM ${table}
-      WHERE ${chunkU5W4LKZV_cjs.sql.join(conditions, chunkU5W4LKZV_cjs.sql` AND `)}
+      WHERE ${chunkVCRRKBLN_cjs.sql.join(conditions, chunkVCRRKBLN_cjs.sql` AND `)}
       ORDER BY ${distance} ASC
       ${pageClause}
     `;
@@ -223,7 +234,7 @@ var pgvectorStrategy = {
   },
   buildCreateIndex(slot, options) {
     if (!usesAnnIndex(slot)) return void 0;
-    return chunkU5W4LKZV_cjs.sql.raw(
+    return chunkVCRRKBLN_cjs.sql.raw(
       pgvectorIndexDdl(
         tableName(slot.graphId, slot.nodeKind, slot.fieldPath),
         slot,
@@ -234,17 +245,17 @@ var pgvectorStrategy = {
   buildDropIndex(slot) {
     if (!usesAnnIndex(slot)) return void 0;
     const indexName = pgvectorIndexName(slot);
-    return chunkU5W4LKZV_cjs.sql.raw(`DROP INDEX IF EXISTS ${chunkJXUTCSXX_cjs.quoteIdentifier(indexName)}`);
+    return chunkVCRRKBLN_cjs.sql.raw(`DROP INDEX IF EXISTS ${chunk4UGOKMI5_cjs.quoteIdentifier(indexName)}`);
   },
   buildDropStorage(slot) {
-    const table = chunkJXUTCSXX_cjs.quoteIdentifier(
+    const table = chunk4UGOKMI5_cjs.quoteIdentifier(
       tableName(slot.graphId, slot.nodeKind, slot.fieldPath)
     );
     return [`DROP TABLE IF EXISTS ${table} CASCADE`];
   }
 };
 function pgvectorIndexName(slot) {
-  return chunkJXUTCSXX_cjs.vectorPhysicalName(
+  return chunk4UGOKMI5_cjs.vectorPhysicalName(
     INDEX_PREFIX,
     slot.graphId,
     slot.nodeKind,
@@ -252,8 +263,8 @@ function pgvectorIndexName(slot) {
   );
 }
 function pgvectorIndexDdl(table, slot, concurrent) {
-  const indexName = chunkJXUTCSXX_cjs.quoteIdentifier(pgvectorIndexName(slot));
-  const quotedTable = chunkJXUTCSXX_cjs.quoteIdentifier(table);
+  const indexName = chunk4UGOKMI5_cjs.quoteIdentifier(pgvectorIndexName(slot));
+  const quotedTable = chunk4UGOKMI5_cjs.quoteIdentifier(table);
   const opClass = operatorClass(slot.metric);
   const m = slot.indexParams?.m ?? DEFAULT_HNSW_M;
   const efConstruction = slot.indexParams?.efConstruction ?? DEFAULT_HNSW_EF_CONSTRUCTION;
@@ -280,5 +291,5 @@ function pgvectorIndexDdl(table, slot, concurrent) {
 
 exports.assertPgvectorEfSearch = assertPgvectorEfSearch;
 exports.pgvectorStrategy = pgvectorStrategy;
-//# sourceMappingURL=chunk-D56XG4EI.cjs.map
-//# sourceMappingURL=chunk-D56XG4EI.cjs.map
+//# sourceMappingURL=chunk-MXJDTH5B.cjs.map
+//# sourceMappingURL=chunk-MXJDTH5B.cjs.map

package/dist/chunk-MXJDTH5B.cjs.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/query/dialect/vector/pgvector-strategy.ts"],"names":["assertFiniteEmbedding","sql","vectorPhysicalName","quoteIdentifier","VECTOR_CONTRIBUTION_PREFIX","vectorScoreExpression","vectorMinScoreCondition","vectorPageClause"],"mappings":";;;;;;;AA8CA,IAAM,YAAA,GAAe,QAAA;AACrB,IAAM,YAAA,GAAe,WAAA;AASd,IAAM,kBAAA,GAAqB,GAAA;AAM3B,SAAS,uBAAuB,QAAA,EAAyB;AAC9D,EAAA,IAAI,aAAa,MAAA,EAAW;AAC5B,EAAA,IAAI,CAAC,MAAA,CAAO,SAAA,CAAU,QAAQ,CAAA,IAAK,YAAY,CAAA,EAAG;AAChD,IAAA,MAAM,IAAI,KAAA,CAAM,CAAA,0CAAA,EAA6C,QAAQ,CAAA,CAAE,CAAA;AAAA,EACzE;AACA,EAAA,IAAI,WAAW,kBAAA,EAAoB;AACjC,IAAA,MAAM,IAAI,UAAA;AAAA,MACR,CAAA,wBAAA,EAAsB,kBAAkB,CAAA,8CAAA,EACjB,kBAAkB,WAAW,QAAQ,CAAA;AAAA,KAC9D;AAAA,EACF;AACF;AAQA,IAAM,uBAAA,GAA0B,IAAA;AAGhC,IAAM,cAAA,GAAiB,EAAA;AAEvB,IAAM,4BAAA,GAA+B,EAAA;AAErC,IAAM,qBAAA,GAAwB,GAAA;AAE9B,IAAM,qBAAA,GAA4C;AAAA,EAChD,SAAA,EAAW,IAAA;AAAA,EACX,OAAA,EAAS,CAAC,QAAA,EAAU,IAAA,EAAM,eAAe,CAAA;AAAA,EACzC,UAAA,EAAY,CAAC,MAAA,EAAQ,SAAA,EAAW,MAAM,CAAA;AAAA,EACtC,aAAA,EAAe,uBAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUf,yBAAA,EAA2B;AAAA,IACzB,IAAA,EAAM,gBAAA;AAAA,IACN,kBAAA,EAAoB;AAAA,GACtB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,oBAAA,EAAsB;AAAA,IACpB,OAAA,EAAS,IAAA;AAAA,IACT,SAAA,EAAW,gBAAA;AAAA,IACX,SAAA,EAAW,MAAA;AAAA,IACX,wBAAA,EAA0B;AAAA;AAE9B,CAAA;AAGA,SAAS,aAAa,IAAA,EAA2B;AAC/C,EAAA,OAAO,IAAA,CAAK,SAAA,KAAc,MAAA,IAAU,IAAA,CAAK,SAAA,KAAc,SAAA;AACzD;AAOA,SAAS,cAAc,MAAA,EAA8B;AACnD,EAAA,QAAQ,MAAA;AAAQ,IACd,KAAK,QAAA,EAAU;AACb,MAAA,OAAO,mBAAA;AAAA,IACT;AAAA,IACA,KAAK,IAAA,EAAM;AACT,MAAA,OAAO,eAAA;AAAA,IACT;AAAA,IACA,KAAK,eAAA,EAAiB;AACpB,MAAA,OAAO,eAAA;AAAA,IACT;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,aAAA,CACP,WACA,IAAA,EACa;AACb,EAAAA,uCAAA,CAAsB,WAAW,IAAI,CAAA;AACrC,EAAA,OAAOC,wBAAM,CAAA,CAAA,EAAI,SAAA,CAAU,IAAA,CAAK,GAAG,CAAC,CAAA,CAAA,CAAG,CAAA,QAAA,CAAA;AACzC;AAEA,SAAS,kBAAA,CACP,eAAA,EACA,cAAA,EACA,MAAA,EACa;AACb,EAAA,MAAM,KAAA,GAAQ,aAAA,CAAc,cAAA,EAAgB,gBAAgB,CAAA;AAC5D,EAAA,QAAQ,MAAA;AAAQ,IACd,KAAK,QAAA,EAAU;AACb,MAAA,OAAOA,qBAAA,CAAA,CAAA,EAAO,eAAe,CAAA,KAAA,EAAQ,KAAK,CAAA,CAAA,CAAA;AAAA,IAC5C;AAAA,IACA,KAAK,IAAA,EAAM;AACT,MAAA,OAAOA,qBAAA,CAAA,CAAA,EAAO,eAAe,CAAA,KAAA,EAAQ,KAAK,CAAA,CAAA,CAAA;AAAA,IAC5C;AAAA,IACA,KAAK,eAAA,EAAiB;AACpB,MAAA,OAAOA,qBAAA,CAAA,CAAA,EAAO,eAAe,CAAA,KAAA,EAAQ,KAAK,CAAA,CAAA,CAAA;AAAA,IAC5C;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,gBAAA,GAAmC;AAAA,EAC9C,IAAA,EAAM,UAAA;AAAA,EACN,YAAA,EAAc,qBAAA;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,qBAAA,EAGjB,KAAK,UAAU,CAAA;AAAA;AAAA;AAAA;AAAA,EAAA;AAAA,KAKlC;AAWA,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,UAAA;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,aAAA,CAAc,MAAA,CAAO,SAAA,EAAW,WAAW,CAAA;AACzD,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;AAAA,MAAA;AAAA,KAIpF;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,aAAA,CAAc,IAAI,SAAA,EAAW,WAAW,CAAC,CAAA,EAAA,EAAK,SAAS,KAAK,SAAS,CAAA,CAAA;AAAA,OAClH;AAAA,MACAA,qBAAA,CAAA,EAAA;AAAA,KACF;AACA,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,QAAQA,qBAAA,CAAI,UAAA;AAAA,MAChB,UAAU,IAAA,CAAK,OAAA,EAAS,IAAA,CAAK,QAAA,EAAU,KAAK,SAAS;AAAA,KACvD;AACA,IAAA,MAAM,eAAA,GAAkBA,wBAAM,KAAK,CAAA,YAAA,CAAA;AACnC,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;AAK3D,IAAA,MAAM,UAAA,GAA4B;AAAA,MAChCJ,qBAAA,CAAA,EAAM,KAAK,CAAA,cAAA,EAAiB,MAAA,CAAO,OAAO,CAAA;AAAA,KAC5C;AACA,IAAA,IAAI,MAAA,CAAO,aAAa,MAAA,EAAW;AACjC,MAAA,UAAA,CAAW,IAAA;AAAA,QACTK,yCAAA,CAAwB,QAAA,EAAU,MAAA,CAAO,MAAA,EAAQ,OAAO,QAAQ;AAAA,OAClE;AAAA,IACF;AAaA,IAAA,IAAI,eAAe,MAAA,EAAW;AAC5B,MAAA,UAAA,CAAW,IAAA,CAAKL,qBAAA,CAAA,EAAM,KAAK,CAAA,eAAA,EAAkB,UAAU,CAAA,CAAA,CAAG,CAAA;AAAA,IAC5D;AAGA,IAAA,MAAM,UAAA,GAAa,OAAO,MAAA,IAAU,CAAA;AACpC,IAAA,MAAM,UAAA,GAAaM,kCAAA,CAAiB,MAAA,CAAO,KAAA,EAAO,OAAO,MAAM,CAAA;AAU/D,IAAA,IAAI,IAAA,CAAK,cAAc,SAAA,EAAW;AAChC,MAAA,MAAM,SAAA,GACJ,MAAA,CAAO,MAAA,KAAW,QAAA,GAAWN,qBAAA,CAAI,IAAI,MAAM,CAAA,GAAIA,qBAAA,CAAI,GAAA,CAAI,KAAK,CAAA;AAC9D,MAAA,MAAM,WAAA,GAAcA,qBAAA;AAAA,eAAA,EACT,KAAK,0BAA0B,KAAK,CAAA;AAAA,aAAA,EACtC,KAAK;AAAA,cAAA,EACJA,qBAAA,CAAI,IAAA,CAAK,UAAA,EAAYA,qBAAA,CAAA,KAAA,CAAU,CAAC;AAAA,iBAAA,EAC7B,QAAQ,CAAA;AAAA,cAAA,EACX,MAAA,CAAO,QAAQ,UAAU;AAAA,MAAA,CAAA;AAEnC,MAAA,OAAOA,qBAAA;AAAA,6CAAA,EACkC,WAAW,CAAA;AAAA;AAAA,uBAAA,EAEjC,SAAS,CAAA;AAAA,QAAA,EACxB,UAAU;AAAA,MAAA,CAAA;AAAA,IAEhB;AACA,IAAA,OAAOA,qBAAA;AAAA,aAAA,EACI,KAAK,0BAA0B,KAAK,CAAA;AAAA,WAAA,EACtC,KAAK;AAAA,YAAA,EACJA,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,gBAAA,CAAiB,MAAM,OAAA,EAAkC;AACvD,IAAA,IAAI,CAAC,YAAA,CAAa,IAAI,CAAA,EAAG,OAAO,MAAA;AAChC,IAAA,OAAOA,qBAAA,CAAI,GAAA;AAAA,MACT,gBAAA;AAAA,QACE,UAAU,IAAA,CAAK,OAAA,EAAS,IAAA,CAAK,QAAA,EAAU,KAAK,SAAS,CAAA;AAAA,QACrD,IAAA;AAAA,QACA,SAAS,UAAA,KAAe;AAAA;AAC1B,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,kBAAkB,IAAI,CAAA;AACxC,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;AAEA,IAAA,OAAO,CAAC,CAAA,qBAAA,EAAwB,KAAK,CAAA,QAAA,CAAU,CAAA;AAAA,EACjD;AACF;AAEA,SAAS,kBAAkB,IAAA,EAA0B;AACnD,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,gBAAA,CACP,KAAA,EACA,IAAA,EACA,UAAA,EACQ;AACR,EAAA,MAAM,SAAA,GAAYC,iCAAA,CAAgB,iBAAA,CAAkB,IAAI,CAAC,CAAA;AACzD,EAAA,MAAM,WAAA,GAAcA,kCAAgB,KAAK,CAAA;AACzC,EAAA,MAAM,OAAA,GAAU,aAAA,CAAc,IAAA,CAAK,MAAM,CAAA;AAEzC,EAAA,MAAM,CAAA,GAAI,IAAA,CAAK,WAAA,EAAa,CAAA,IAAK,cAAA;AACjC,EAAA,MAAM,cAAA,GACJ,IAAA,CAAK,WAAA,EAAa,cAAA,IAAkB,4BAAA;AACtC,EAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,WAAA,EAAa,KAAA,IAAS,qBAAA;AAGzC,EAAA,MAAM,MAAA,GAAS,CAAA,YAAA,EAAe,UAAA,GAAa,eAAA,GAAkB,EAAE,CAAA,cAAA,CAAA;AAE/D,EAAA,QAAQ,KAAK,SAAA;AAAW,IACtB,KAAK,MAAA,EAAQ;AACX,MAAA,OAAO,CAAA,EAAG,MAAM,CAAA,CAAA,EAAI,SAAS,CAAA,IAAA,EAAO,WAAW,CAAA,yBAAA,EAA4B,OAAO,CAAA,YAAA,EAAe,CAAC,CAAA,oBAAA,EAAuB,cAAc,CAAA,EAAA,CAAA;AAAA,IACzI;AAAA,IACA,KAAK,SAAA,EAAW;AACd,MAAA,OAAO,CAAA,EAAG,MAAM,CAAA,CAAA,EAAI,SAAS,OAAO,WAAW,CAAA,4BAAA,EAA+B,OAAO,CAAA,gBAAA,EAAmB,KAAK,CAAA,EAAA,CAAA;AAAA,IAC/G;AAAA,IACA,KAAK,MAAA,EAAQ;AACX,MAAA,MAAM,IAAI,KAAA;AAAA,QACR;AAAA,OACF;AAAA,IACF;AAAA,IACA,SAAS;AACP,MAAA,MAAM,cAAqB,IAAA,CAAK,SAAA;AAChC,MAAA,MAAM,IAAI,KAAA,CAAM,CAAA,+BAAA,EAAkC,MAAA,CAAO,WAAW,CAAC,CAAA,CAAE,CAAA;AAAA,IACzE;AAAA;AAEJ","file":"chunk-MXJDTH5B.cjs","sourcesContent":["/**\n * pgvector strategy.\n *\n * Postgres' pgvector extension is the one engine where the *same* SQL serves\n * brute-force and ANN: `ORDER BY embedding <=> q LIMIT k` scans sequentially\n * with no index and is rewritten to an HNSW/IVFFlat scan the moment a matching\n * index exists — the planner picks it up automatically. So `buildSearch` never\n * branches on `slot.indexType`; it emits one relevance scan and lets Postgres\n * decide. (Contrast libSQL/sqlite-vec, whose ANN needs distinct syntax.)\n *\n * Storage is per-`(nodeKind, fieldPath)`: a `vector(N)` column carrying the\n * field's fixed dimension `N`, with the operator-class-typed ANN index folded\n * into the same table contribution so materialization builds table + index\n * together. The typed column means the index does not need the legacy\n * `::vector(N)` cast-in-index escape hatch the old shared table relied on.\n *\n * Metric support is the full pgvector set — `cosine`, `l2`, `inner_product` —\n * advertised as data on `capabilities`, mirroring `vector_cosine_ops` /\n * `vector_l2_ops` / `vector_ip_ops` and the `<=>` / `<->` / `<#>` operators.\n *\n * Mirrors the `libsqlVectorStrategy` / `sqliteVecStrategy` structure while\n * letting Postgres' planner pick the ANN index when one exists.\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 ANN index. */\nconst TABLE_PREFIX = \"tg_vec\";\nconst INDEX_PREFIX = \"tg_vecidx\";\n\n/**\n * pgvector defines `hnsw.ef_search` as an integer GUC with a valid range\n * of 1..1000; `SET hnsw.ef_search = 1001` errors at the server. The\n * backend validates a per-search `efSearch` against this ceiling before\n * inlining it into `SET LOCAL`, surfacing a clear message instead of a raw\n * pgvector error.\n */\nexport const MAX_HNSW_EF_SEARCH = 1000;\n\n/**\n * Validates a per-search `efSearch` override against pgvector's\n * `hnsw.ef_search` valid range. `undefined` (no override) is accepted.\n */\nexport function assertPgvectorEfSearch(efSearch?: number): void {\n  if (efSearch === undefined) return;\n  if (!Number.isInteger(efSearch) || efSearch <= 0) {\n    throw new Error(`efSearch must be a positive integer, got: ${efSearch}`);\n  }\n  if (efSearch > MAX_HNSW_EF_SEARCH) {\n    throw new RangeError(\n      `efSearch must be ≤ ${MAX_HNSW_EF_SEARCH} (pgvector's hnsw.ef_search ` +\n        `valid range is 1..${MAX_HNSW_EF_SEARCH}), got: ${efSearch}`,\n    );\n  }\n}\n\n/**\n * pgvector's `vector` type caps at 16,000 dimensions for a stored column\n * (2,000 for an indexed column, but the column-type ceiling is what governs\n * storage; recall degradation beyond 2,000 is a tuning concern, not a hard\n * limit advertised here).\n */\nconst PGVECTOR_MAX_DIMENSIONS = 16_000;\n\n/** Default HNSW `m` (max connections per layer) — pgvector's own default. */\nconst DEFAULT_HNSW_M = 16;\n/** Default HNSW `ef_construction` (build candidate list) — pgvector's own default. */\nconst DEFAULT_HNSW_EF_CONSTRUCTION = 64;\n/** Default IVFFlat `lists` (inverted lists) — pgvector's own default. */\nconst DEFAULT_IVFFLAT_LISTS = 100;\n\nconst PGVECTOR_CAPABILITIES: VectorCapabilities = {\n  supported: true,\n  metrics: [\"cosine\", \"l2\", \"inner_product\"],\n  indexTypes: [\"hnsw\", \"ivfflat\", \"none\"],\n  maxDimensions: PGVECTOR_MAX_DIMENSIONS,\n  // The backend probes `pg_extension.extversion` once and turns on\n  // `hnsw.iterative_scan` / `ivfflat.iterative_scan` when pgvector >= 0.8, so a\n  // filtered scan re-enters the index for more candidates.\n  //\n  // NOT a full-page guarantee, on either axis. The iterative scan stops at\n  // `hnsw.max_scan_tuples` / `ivfflat.max_probes`; and on pgvector < 0.8 there\n  // is no iterative scan at all, so the search stays `ef_search`-bounded and\n  // behaves like a post-filter. A statically-declared mode cannot express\n  // either, which is why the guarantee is its own field.\n  filteredApproximateSearch: {\n    mode: \"iterative-scan\",\n    guaranteesFullPage: false,\n  },\n  // The one bundled engine with a real per-search frontier: `hnsw.ef_search`\n  // sizes the HNSW candidate list. IVFFlat has no equivalent (`ivfflat.probes`\n  // is a different structure's knob and is not what `efSearch` means), and the\n  // GUC is applied with `SET LOCAL` inside the search's own transaction so\n  // concurrent searches cannot inherit each other's override.\n  searchFrontierTuning: {\n    tunable: true,\n    parameter: \"hnsw.ef_search\",\n    indexType: \"hnsw\",\n    requiresTransactionScope: true,\n  },\n};\n\n/** Whether a slot's declared index type materializes a real pgvector ANN index. */\nfunction usesAnnIndex(slot: VectorSlot): boolean {\n  return slot.indexType === \"hnsw\" || slot.indexType === \"ivfflat\";\n}\n\n/**\n * pgvector operator class for a metric's ANN index — `vector_cosine_ops` /\n * `vector_l2_ops` / `vector_ip_ops`, mirroring the `<=>` / `<->` / `<#>`\n * distance operators this strategy emits.\n */\nfunction operatorClass(metric: VectorMetric): string {\n  switch (metric) {\n    case \"cosine\": {\n      return \"vector_cosine_ops\";\n    }\n    case \"l2\": {\n      return \"vector_l2_ops\";\n    }\n    case \"inner_product\": {\n      return \"vector_ip_ops\";\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 a `::vector` literal. The value is bound as a\n * parameter (not interpolated) — Postgres parses the `[a,b,c]` text and the\n * cast types it. Finiteness is validated first so a NaN names its index.\n */\nfunction vectorLiteral(\n  embedding: readonly number[],\n  name: string,\n): SqlFragment {\n  assertFiniteEmbedding(embedding, name);\n  return sql`${`[${embedding.join(\",\")}]`}::vector`;\n}\n\nfunction distanceExpression(\n  embeddingColumn: SqlFragment,\n  queryEmbedding: readonly number[],\n  metric: VectorMetric,\n): SqlFragment {\n  const query = vectorLiteral(queryEmbedding, \"queryEmbedding\");\n  switch (metric) {\n    case \"cosine\": {\n      return sql`(${embeddingColumn} <=> ${query})`;\n    }\n    case \"l2\": {\n      return sql`(${embeddingColumn} <-> ${query})`;\n    }\n    case \"inner_product\": {\n      return sql`(${embeddingColumn} <#> ${query})`;\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 pgvectorStrategy: VectorStrategy = {\n  name: \"pgvector\",\n  capabilities: PGVECTOR_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\" vector(${slot.dimensions}) NOT NULL,\n  \"created_at\" TIMESTAMPTZ NOT NULL,\n  \"updated_at\" TIMESTAMPTZ NOT NULL,\n  PRIMARY KEY (\"graph_id\", \"node_id\")\n);`,\n    ];\n\n    // The HNSW/IVFFlat index is intentionally NOT created here. pgvector\n    // similarity SQL is planner-driven (`ORDER BY embedding <=> q LIMIT k`\n    // uses the index when present, sequential-scans when not), so the index\n    // is a pure materialization concern: `buildCreateIndex` builds it through\n    // `materializeIndexes()` with the field's declared `m`/`ef_construction`/\n    // `lists`. Building it eagerly here would bake in default tuning (the\n    // write-ensure slot has no `indexParams`) and `CREATE INDEX IF NOT EXISTS`\n    // would then mask the tuned index materialization would emit.\n\n    return [\n      {\n        logicalName: `${VECTOR_CONTRIBUTION_PREFIX}:${slot.nodeKind}.${slot.fieldPath}`,\n        owner: \"pgvector\",\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 = vectorLiteral(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\" = EXCLUDED.\"embedding\", \"updated_at\" = EXCLUDED.\"updated_at\"\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}, ${vectorLiteral(row.embedding, \"embedding\")}, ${timestamp}, ${timestamp})`,\n      ),\n      sql`, `,\n    );\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 = sql.identifier(\n      tableName(slot.graphId, slot.nodeKind, slot.fieldPath),\n    );\n    const embeddingColumn = sql`${table}.\"embedding\"`;\n    const distance = distanceExpression(\n      embeddingColumn,\n      params.queryEmbedding,\n      params.metric,\n    );\n    const score = vectorScoreExpression(distance, params.metric);\n\n    // Same SQL for brute-force and ANN: with a matching HNSW/IVFFlat index the\n    // Postgres planner rewrites this `ORDER BY distance LIMIT k` into an index\n    // scan automatically, so the strategy never branches on `slot.indexType`.\n    const conditions: SqlFragment[] = [\n      sql`${table}.\"graph_id\" = ${params.graphId}`,\n    ];\n    if (params.minScore !== undefined) {\n      conditions.push(\n        vectorMinScoreCondition(distance, params.metric, params.minScore),\n      );\n    }\n    // Candidate pushdown keeps the HNSW scan (verified plan: HNSW Index Scan\n    // -> Nested Loop probe of the nodes pkey -> Limit). Exact under\n    // `hnsw.iterative_scan` (pgvector >= 0.8, applied by the backend);\n    // bounded by `ef_search` on older pgvector — still strictly better than\n    // ranking tombstones into top-k and dropping them post-hoc.\n    //\n    // Plain `IN (subquery)`: with fresh statistics the planner hashes it\n    // (brute-force scans) or drives per-row probes of the nodes pkey\n    // under the ordered HNSW scan — the plan-verified shape the liveness\n    // pushdown was built on. Stale statistics degrade any membership\n    // form; the answer is `store.refreshStatistics()` after bulk loads,\n    // not a cleverer SQL shape.\n    if (candidates !== undefined) {\n      conditions.push(sql`${table}.\"node_id\" IN (${candidates})`);\n    }\n    // Pagination is rank-relative: the scan fetches `limit + offset`\n    // ordered candidates and OFFSET discards the leading page.\n    const pageOffset = params.offset ?? 0;\n    const pageClause = vectorPageClause(params.limit, params.offset);\n    // IVFFlat's iterative scan only offers `relaxed_order` (no\n    // strict_order mode), so under the backend-applied\n    // `ivfflat.iterative_scan` the index may emit the candidate set\n    // slightly out of distance order. Re-sort the bounded set inside a\n    // MATERIALIZED wrapper — the fence stops the planner from collapsing\n    // the sort back into the index scan's claimed ordering — and page in\n    // the wrapper: an OFFSET inside the relaxed scan could discard the\n    // wrong rows. Score is monotone in distance, so ordering by score per\n    // the metric's direction restores exact ranking.\n    if (slot.indexType === \"ivfflat\") {\n      const direction =\n        params.metric === \"cosine\" ? sql.raw(\"DESC\") : sql.raw(\"ASC\");\n      const relaxedBody = sql`\n        SELECT ${table}.\"node_id\" AS node_id, ${score} AS score\n        FROM ${table}\n        WHERE ${sql.join(conditions, sql` AND `)}\n        ORDER BY ${distance} ASC\n        LIMIT ${params.limit + pageOffset}\n      `;\n      return sql`\n        WITH tg_vec_relaxed AS MATERIALIZED (${relaxedBody})\n        SELECT node_id, score FROM tg_vec_relaxed\n        ORDER BY score ${direction}, node_id ASC\n        ${pageClause}\n      `;\n    }\n    return sql`\n      SELECT ${table}.\"node_id\" AS node_id, ${score} AS score\n      FROM ${table}\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, options): SqlFragment | undefined {\n    if (!usesAnnIndex(slot)) return undefined;\n    return sql.raw(\n      pgvectorIndexDdl(\n        tableName(slot.graphId, slot.nodeKind, slot.fieldPath),\n        slot,\n        options?.concurrent === true,\n      ),\n    );\n  },\n\n  buildDropIndex(slot): SqlFragment | undefined {\n    if (!usesAnnIndex(slot)) return undefined;\n    const indexName = pgvectorIndexName(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    // CASCADE drops the ANN index along with the table.\n    return [`DROP TABLE IF EXISTS ${table} CASCADE`];\n  },\n};\n\nfunction pgvectorIndexName(slot: VectorSlot): string {\n  return vectorPhysicalName(\n    INDEX_PREFIX,\n    slot.graphId,\n    slot.nodeKind,\n    slot.fieldPath,\n  );\n}\n\nfunction pgvectorIndexDdl(\n  table: string,\n  slot: VectorSlot,\n  concurrent: boolean,\n): string {\n  const indexName = quoteIdentifier(pgvectorIndexName(slot));\n  const quotedTable = quoteIdentifier(table);\n  const opClass = operatorClass(slot.metric);\n  // Honor the field's declared tuning; fall back to pgvector defaults.\n  const m = slot.indexParams?.m ?? DEFAULT_HNSW_M;\n  const efConstruction =\n    slot.indexParams?.efConstruction ?? DEFAULT_HNSW_EF_CONSTRUCTION;\n  const lists = slot.indexParams?.lists ?? DEFAULT_IVFFLAT_LISTS;\n  // CONCURRENTLY builds without taking a write-blocking lock on the live table\n  // (materializeIndexes passes concurrent on Postgres). Run outside a tx.\n  const create = `CREATE INDEX${concurrent ? \" CONCURRENTLY\" : \"\"} IF NOT EXISTS`;\n\n  switch (slot.indexType) {\n    case \"hnsw\": {\n      return `${create} ${indexName} ON ${quotedTable} USING hnsw (\"embedding\" ${opClass}) WITH (m = ${m}, ef_construction = ${efConstruction});`;\n    }\n    case \"ivfflat\": {\n      return `${create} ${indexName} ON ${quotedTable} USING ivfflat (\"embedding\" ${opClass}) WITH (lists = ${lists});`;\n    }\n    case \"none\": {\n      throw new Error(\n        \"pgvectorIndexDdl called for a brute-force-only slot (indexType 'none').\",\n      );\n    }\n    default: {\n      const _exhaustive: never = slot.indexType;\n      throw new Error(`Unsupported vector index type: ${String(_exhaustive)}`);\n    }\n  }\n}\n"]}

package/dist/{chunk-5EKPX6QU.js → chunk-MZLPX2R7.js}

@@ -1,10 +1,9 @@
-import { createSqliteTables, sqliteContributions, createPostgresTables, postgresContributions } from './chunk-BGYJW37L.js';
-import { createSqlSchema } from './chunk-MIJKEVV7.js';
-import { asRecordedInstant, createRecordedInstant, RECORDED_MAX_REVISION } from './chunk-2L54C2C2.js';
-import { canonicalizeDatabaseTimestamp } from './chunk-KCO5EFJU.js';
-import { shortHash } from './chunk-PVUI6KGR.js';
-import { asCompiledRowsSql, sql, asCompiledStatementSql } from './chunk-6DCB664D.js';
-import { ConfigurationError, ValidationError } from './chunk-4MB3AQAQ.js';
+import { createSqliteTables, sqliteContributions, createPostgresTables, postgresContributions } from './chunk-5UVRGXD3.js';
+import { createSqlSchema } from './chunk-MSY7FSX4.js';
+import { asRecordedInstant, createRecordedInstant, canonicalizeDatabaseTimestamp, RECORDED_MAX_REVISION } from './chunk-XL7SLCXS.js';
+import { shortHash } from './chunk-YDFDBE6D.js';
+import { asCompiledRowsSql, sql, asCompiledStatementSql } from './chunk-PQBQG7IM.js';
+import { ConfigurationError, ValidationError } from './chunk-J3WZ3FA2.js';
 
 // src/backend/migrate-recorded-time.ts
 var LEGACY_RECORDED_MAX = "9999-12-31T23:59:59.999Z";
@@ -597,5 +596,5 @@ async function deleteLegacyRecordedAnchorMap(options) {
 }
 
 export { deleteLegacyRecordedAnchorMap, migrateLegacyRecordedTime, migrateRecordedAnchor };
-//# sourceMappingURL=chunk-5EKPX6QU.js.map
-//# sourceMappingURL=chunk-5EKPX6QU.js.map
+//# sourceMappingURL=chunk-MZLPX2R7.js.map
+//# sourceMappingURL=chunk-MZLPX2R7.js.map

package/dist/chunk-MZLPX2R7.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/backend/migrate-recorded-time.ts"],"names":["temporaryTables","finalTables"],"mappings":";;;;;;;;AA0BA,IAAM,mBAAA,GAAsB,0BAAA;AAC5B,IAAM,gBAAA,GAAmB,yBAAA;AAEzB,IAAM,qBAAA,GAAwB;AAAA,EAC5B,YAAA;AAAA,EACA,UAAA;AAAA,EACA,MAAA;AAAA,EACA,IAAA;AAAA,EACA,OAAA;AAAA,EACA,SAAA;AAAA,EACA,YAAA;AAAA,EACA,UAAA;AAAA,EACA,YAAA;AAAA,EACA,YAAA;AAAA,EACA,YAAA;AAAA,EACA,eAAA;AAAA,EACA,aAAA;AAAA,EACA,IAAA;AAAA,EACA,gBAAA;AAAA,EACA,OAAA;AAAA,EACA;AACF,CAAA;AAEA,IAAM,qBAAA,GAAwB;AAAA,EAC5B,YAAA;AAAA,EACA,UAAA;AAAA,EACA,IAAA;AAAA,EACA,MAAA;AAAA,EACA,WAAA;AAAA,EACA,SAAA;AAAA,EACA,SAAA;AAAA,EACA,OAAA;AAAA,EACA,OAAA;AAAA,EACA,YAAA;AAAA,EACA,UAAA;AAAA,EACA,YAAA;AAAA,EACA,YAAA;AAAA,EACA,YAAA;AAAA,EACA,eAAA;AAAA,EACA,aAAA;AAAA,EACA,IAAA;AAAA,EACA,gBAAA;AAAA,EACA,OAAA;AAAA,EACA;AACF,CAAA;AA0DA,SAAS,kBAAA,CACP,SACA,QAAA,EACuB;AACvB,EAAA,OAAO,gBAAgB,QAAA,IAAY,OAAA,CAAQ,UAAA,IAAc,EAAE,CAAA,CAAE,MAAA;AAC/D;AAEA,SAAS,oBAAoB,KAAA,EAAuB;AAClD,EAAA,IAAI,KAAA,CAAM,MAAA,IAAU,EAAA,EAAI,OAAO,KAAA;AAC/B,EAAA,OAAO,CAAA,EAAG,MAAM,KAAA,CAAM,CAAA,EAAG,EAAE,CAAC,CAAA,CAAA,EAAI,SAAA,CAAU,KAAK,CAAC,CAAA,CAAA;AAClD;AAEA,SAAS,gBAAA,CACP,QACA,QAAA,EACQ;AACR,EAAA,MAAM,YAAY,QAAA,IAAY,CAAA,EAAG,MAAA,CAAO,aAAa,IAAI,gBAAgB,CAAA,CAAA;AACzE,EAAA,OAAO,eAAA,CAAgB;AAAA,IACrB,aAAA,EAAe,oBAAoB,SAAS;AAAA,GAC7C,EAAE,MAAA,CAAO,aAAA;AACZ;AAEA,SAAS,kBAAA,CAAmB,WAAmB,IAAA,EAAsB;AACnE,EAAA,OAAO,oBAAoB,CAAA,KAAA,EAAQ,IAAI,IAAI,SAAA,CAAU,SAAS,CAAC,CAAA,CAAE,CAAA;AACnE;AAEA,SAAS,kBACP,MAAA,EACqD;AACrD,EAAA,IAAI,MAAA,CAAO,qBAAqB,MAAA,EAAW;AACzC,IAAA,MAAM,IAAI,kBAAA;AAAA,MACR,4DAAA;AAAA,MACA,EAAE,OAAA,EAAS,MAAA,CAAO,OAAA,EAAQ;AAAA,MAC1B,EAAE,YAAY,8CAAA;AAA+C,KAC/D;AAAA,EACF;AACA,EAAA,OAAO,MAAA,CAAO,gBAAA;AAChB;AAEA,eAAe,gBAAA,CACb,QACA,SAAA,EACe;AACf,EAAA,MAAM,iBAAA,CAAkB,MAAM,CAAA,CAAE,sBAAA,CAAuB,SAAS,CAAC,CAAA;AACnE;AAEA,eAAe,UAAA,CACb,QACA,GAAA,EACe;AACf,EAAA,MAAM,gBAAA,CAAiB,MAAA,EAAQ,GAAA,CAAI,GAAA,CAAI,GAAG,CAAC,CAAA;AAC7C;AAEA,SAAS,uBAAuB,KAAA,EAAwB;AACtD,EAAA,MAAM,SAAA,GAAY,8BAA8B,KAAK,CAAA;AACrD,EAAA,IAAI,cAAc,MAAA,EAAW;AAC3B,IAAA,MAAM,IAAI,kBAAA;AAAA,MACR,+DAAA;AAAA,MACA,EAAE,KAAA;AAAM,KACV;AAAA,EACF;AACA,EAAA,OAAO,SAAA;AACT;AAEA,SAAS,aAAa,KAAA,EAAwB;AAC5C,EAAA,MAAM,WACJ,OAAO,KAAA,KAAU,QAAA,GAAW,MAAA,CAAO,KAAK,CAAA,GACtC,OAAO,KAAA,KAAU,QAAA,IAAY,QAAQ,IAAA,CAAK,KAAK,CAAA,GAAI,MAAA,CAAO,KAAK,CAAA,GAC/D,KAAA;AACJ,EAAA,IACE,OAAO,QAAA,KAAa,QAAA,IACpB,CAAC,MAAA,CAAO,aAAA,CAAc,QAAQ,CAAA,IAC9B,QAAA,GAAW,CAAA,IACX,QAAA,IAAY,qBAAA,EACZ;AACA,IAAA,MAAM,IAAI,kBAAA;AAAA,MACR,wDAAA;AAAA,MACA,EAAE,KAAA;AAAM,KACV;AAAA,EACF;AACA,EAAA,OAAO,QAAA;AACT;AAEA,eAAe,WAAA,CACb,QACA,SAAA,EAC8B;AAC9B,EAAA,MAAM,IAAA,GACJ,MAAA,CAAO,OAAA,KAAY,QAAA,GACjB,MAAM,MAAA,CAAO,OAAA;AAAA,IACX,kBAAkB,GAAA,CAAA,kBAAA,EAAwB,GAAA,CAAI,UAAA,CAAW,SAAS,CAAC,CAAA,CAAA,CAAG;AAAA,GACxE,GACA,MAAM,MAAA,CAAO,OAAA;AAAA,IACX,iBAAA,CAAkB,GAAA;AAAA;AAAA;AAAA;AAAA,6BAAA,EAIK,SAAS;AAAA,QAAA,CAC/B;AAAA,GACH;AACJ,EAAA,OAAO,IAAI,GAAA;AAAA,IACT,IAAA,CAAK,OAAA,CAAQ,CAAC,GAAA,KAAS,OAAO,GAAA,CAAI,IAAA,KAAS,QAAA,GAAW,CAAC,GAAA,CAAI,IAAI,CAAA,GAAI,EAAG;AAAA,GACxE;AACF;AAEA,eAAe,kBAAA,CACb,QACA,MAAA,EACgC;AAChC,EAAA,MAAM,IAAA,GAAO,MAAM,MAAA,CAAO,OAAA;AAAA,IACxB,iBAAA,CAAkB,GAAA;AAAA;AAAA,WAAA,EAET,GAAA,CAAI,UAAA,CAAW,MAAA,CAAO,aAAa,CAAC;AAAA;AAAA;AAAA,WAAA,EAGpC,GAAA,CAAI,UAAA,CAAW,MAAA,CAAO,aAAa,CAAC;AAAA,2BAAA,EACpB,mBAAmB;AAAA;AAAA;AAAA,WAAA,EAGnC,GAAA,CAAI,UAAA,CAAW,MAAA,CAAO,aAAa,CAAC;AAAA;AAAA;AAAA,WAAA,EAGpC,GAAA,CAAI,UAAA,CAAW,MAAA,CAAO,aAAa,CAAC;AAAA,2BAAA,EACpB,mBAAmB;AAAA;AAAA;AAAA,WAAA,EAGnC,GAAA,CAAI,UAAA,CAAW,MAAA,CAAO,aAAa,CAAC;AAAA,IAAA,CAC5C;AAAA,GACH;AACA,EAAA,MAAM,QAAA,GAAW,IAAA,CAAK,GAAA,CAAI,CAAC,GAAA,KAAQ;AACjC,IAAA,IAAI,OAAO,GAAA,CAAI,QAAA,KAAa,QAAA,EAAU;AACpC,MAAA,MAAM,IAAI,kBAAA;AAAA,QACR,8DAAA;AAAA,QACA,EAAE,OAAA,EAAS,GAAA,CAAI,QAAA;AAAS,OAC1B;AAAA,IACF;AACA,IAAA,OAAO;AAAA,MACL,SAAS,GAAA,CAAI,QAAA;AAAA,MACb,UAAA,EAAY,sBAAA,CAAuB,GAAA,CAAI,WAAW;AAAA,KACpD;AAAA,EACF,CAAC,CAAA;AACD,EAAA,QAAA,CAAS,IAAA,CAAK,CAAC,IAAA,EAAM,KAAA,KAAU;AAC7B,IAAA,IAAI,IAAA,CAAK,OAAA,GAAU,KAAA,CAAM,OAAA,EAAS,OAAO,EAAA;AACzC,IAAA,IAAI,IAAA,CAAK,OAAA,GAAU,KAAA,CAAM,OAAA,EAAS,OAAO,CAAA;AACzC,IAAA,IAAI,IAAA,CAAK,UAAA,GAAa,KAAA,CAAM,UAAA,EAAY,OAAO,EAAA;AAC/C,IAAA,IAAI,IAAA,CAAK,UAAA,GAAa,KAAA,CAAM,UAAA,EAAY,OAAO,CAAA;AAC/C,IAAA,OAAO,CAAA;AAAA,EACT,CAAC,CAAA;AAED,EAAA,MAAM,UAAwB,EAAC;AAC/B,EAAA,IAAI,OAAA;AACJ,EAAA,IAAI,QAAA,GAAW,CAAA;AACf,EAAA,IAAI,eAAA;AACJ,EAAA,KAAA,MAAW,WAAW,QAAA,EAAU;AAC9B,IAAA,IAAI,OAAA,CAAQ,YAAY,OAAA,EAAS;AAC/B,MAAA,OAAA,GAAU,OAAA,CAAQ,OAAA;AAClB,MAAA,QAAA,GAAW,CAAA;AACX,MAAA,eAAA,GAAkB,MAAA;AAAA,IACpB;AACA,IAAA,IAAI,OAAA,CAAQ,eAAe,eAAA,EAAiB;AAC5C,IAAA,QAAA,IAAY,CAAA;AACZ,IAAA,OAAA,CAAQ,IAAA,CAAK;AAAA,MACX,SAAS,OAAA,CAAQ,OAAA;AAAA,MACjB,kBAAkB,OAAA,CAAQ,UAAA;AAAA,MAC1B,YAAY,OAAA,CAAQ,UAAA;AAAA,MACpB;AAAA,KACD,CAAA;AACD,IAAA,eAAA,GAAkB,OAAA,CAAQ,UAAA;AAAA,EAC5B;AACA,EAAA,OAAO,OAAA;AACT;AAEA,SAAS,eAAA,CACP,SACA,KAAA,EACQ;AACR,EAAA,MAAM,YAAA,GAAe,OAAA,KAAY,UAAA,GAAa,QAAA,GAAW,SAAA;AACzD,EAAA,MAAM,cAAA,GAAiB,OAAA,KAAY,UAAA,GAAa,aAAA,GAAgB,MAAA;AAChE,EAAA,OAAO,+BAA+B,KAAK,CAAA;AAAA;AAAA;AAAA,WAAA,EAGhC,YAAY,CAAA;AAAA,cAAA,EACT,cAAc,CAAA;AAAA;AAAA,EAAA,CAAA;AAG9B;AAEA,eAAe,gBAAA,CACb,MAAA,EACA,SAAA,EACA,IAAA,EACe;AACf,EAAA,MAAM,iBAAiB,MAAA,EAAQ,GAAA,CAAA,YAAA,EAAkB,IAAI,UAAA,CAAW,SAAS,CAAC,CAAA,CAAE,CAAA;AAC5E,EAAA,MAAM,mBAAmB,IAAA,CAAK,GAAA;AAAA,IAC5B,CAAA;AAAA,IACA,KAAK,KAAA,CAAA,CAAO,MAAA,CAAO,YAAA,CAAa,iBAAA,IAAqB,OAAO,CAAC;AAAA,GAC/D;AACA,EAAA,KAAA,IAAS,QAAQ,CAAA,EAAG,KAAA,GAAQ,IAAA,CAAK,MAAA,EAAQ,SAAS,gBAAA,EAAkB;AAClE,IAAA,MAAM,SAAS,IAAA,CACZ,KAAA,CAAM,KAAA,EAAO,KAAA,GAAQ,gBAAgB,CAAA,CACrC,GAAA;AAAA,MACC,CAAC,GAAA,KACC,GAAA,CAAA,CAAA,EAAO,GAAA,CAAI,OAAO,CAAA,EAAA,EAAK,GAAA,CAAI,gBAAgB,CAAA,EAAA,EAAK,GAAA,CAAI,QAAQ,CAAA,EAAA,EAAK,IAAI,UAAU,CAAA,CAAA;AAAA,KACnF;AACF,IAAA,MAAM,gBAAA;AAAA,MACJ,MAAA;AAAA,MACA,GAAA;AAAA,oBAAA,EACgB,GAAA,CAAI,UAAA,CAAW,SAAS,CAAC;AAAA;AAAA,eAAA,EAE9B,GAAA,CAAI,IAAA,CAAK,MAAA,EAAQ,GAAA,CAAA,EAAA,CAAO,CAAC;AAAA,MAAA;AAAA,KAEtC;AAAA,EACF;AACF;AAEA,SAAS,QAAA,CACP,OAAA,EACA,MAAA,EACA,SAAA,EASC;AACD,EAAA,IAAI,YAAY,QAAA,EAAU;AACxB,IAAA,MAAMA,gBAAAA,GAAkB,mBAAmB,SAAS,CAAA;AACpD,IAAA,MAAMC,YAAAA,GAAc,mBAAmB,MAAM,CAAA;AAC7C,IAAA,MAAM,sBAAA,GAAyB,oBAAoBD,gBAAe,CAAA;AAClE,IAAA,MAAM,kBAAA,GAAqB,oBAAoBC,YAAW,CAAA;AAC1D,IAAA,OAAO,oBAAA,CAAqB,wBAAwB,kBAAkB,CAAA;AAAA,EACxE;AACA,EAAA,MAAM,eAAA,GAAkB,qBAAqB,SAAS,CAAA;AACtD,EAAA,MAAM,WAAA,GAAc,qBAAqB,MAAM,CAAA;AAC/C,EAAA,OAAO,oBAAA;AAAA,IACL,sBAAsB,eAAe,CAAA;AAAA,IACrC,sBAAsB,WAAW;AAAA,GACnC;AACF;AAEA,SAAS,oBAAA,CACP,WAIA,KAAA,EAQC;AACD,EAAA,SAAS,WACP,WAAA,EACmB;AACnB,IAAA,MAAM,eAAe,SAAA,CAAU,IAAA;AAAA,MAC7B,CAAC,KAAA,KAAU,KAAA,CAAM,WAAA,KAAgB;AAAA,KACnC,EAAG,SAAA;AACH,IAAA,MAAM,WAAW,KAAA,CAAM,IAAA;AAAA,MACrB,CAAC,KAAA,KAAU,KAAA,CAAM,WAAA,KAAgB;AAAA,KACnC,EAAG,SAAA;AACH,IAAA,IAAI,YAAA,KAAiB,MAAA,IAAa,QAAA,KAAa,MAAA,EAAW;AACxD,MAAA,MAAM,IAAI,kBAAA;AAAA,QACR,wCAAwC,WAAW,CAAA,CAAA;AAAA,OACrD;AAAA,IACF;AACA,IAAA,MAAM,WAAA,GAAc,aAAa,CAAC,CAAA;AAClC,IAAA,IAAI,gBAAgB,MAAA,EAAW;AAC7B,MAAA,MAAM,IAAI,kBAAA;AAAA,QACR,8CAA8C,WAAW,CAAA,CAAA;AAAA,OAC3D;AAAA,IACF;AACA,IAAA,OAAO,CAAC,WAAA,EAAa,GAAG,QAAA,CAAS,KAAA,CAAM,CAAC,CAAC,CAAA;AAAA,EAC3C;AACA,EAAA,OAAO;AAAA,IACL,KAAA,EAAO,WAAW,eAAe,CAAA;AAAA,IACjC,KAAA,EAAO,WAAW,eAAe,CAAA;AAAA,IACjC,KAAA,EAAO,WAAW,eAAe;AAAA,GACnC;AACF;AAEA,SAAS,cAAA,CAAe,QAAgB,WAAA,EAAkC;AACxE,EAAA,IAAI,MAAA,KAAW,iBAAiB,OAAO,GAAA,CAAA,iBAAA,CAAA;AACvC,EAAA,IAAI,WAAW,aAAA,EAAe;AAC5B,IAAA,OAAO,GAAA;AAAA;AAAA,iBAAA,EAEQ,GAAA,CAAI,GAAA,CAAI,WAAW,CAAC,kBAAkB,mBAAmB;AAAA,iBAAA,EACzD,qBAAqB;AAAA;AAAA;AAAA,IAAA,CAAA;AAAA,EAItC;AACA,EAAA,OAAO,GAAA,CAAA,EAAM,IAAI,GAAA,CAAI,WAAW,CAAC,CAAA,CAAA,EAAI,GAAA,CAAI,UAAA,CAAW,MAAM,CAAC,CAAA,CAAA;AAC7D;AAEA,SAAS,YAAA,CACP,OAAA,EACA,YAAA,EACA,YAAA,EACa;AACb,EAAA,MAAM,OAAA,GAAU,GAAA,CAAI,GAAA,CAAI,YAAY,CAAA;AACpC,EAAA,MAAM,MAAA,GAAS,GAAA,CAAI,GAAA,CAAI,CAAA,OAAA,EAAU,YAAY,CAAA,CAAE,CAAA;AAC/C,EAAA,OAAO,OAAA,KAAY,UAAA,GACf,GAAA,CAAA,EAAM,OAAO,CAAA,eAAA,EAAkB,MAAM,CAAA,CAAA,GACrC,GAAA,CAAA,EAAM,OAAO,CAAA,sBAAA,EAAyB,MAAM,CAAA,CAAA;AAClD;AAEA,SAAS,mBAAA,CAAoB,OAAgB,WAAA,EAA6B;AACxE,EAAA,MAAM,KAAA,GAAQ,OAAO,KAAK,CAAA;AAC1B,EAAA,IAAI,CAAC,MAAA,CAAO,aAAA,CAAc,KAAK,CAAA,IAAK,QAAQ,CAAA,EAAG;AAC7C,IAAA,MAAM,IAAI,kBAAA;AAAA,MACR,oEAAA;AAAA,MACA,EAAE,aAAa,KAAA;AAAM,KACvB;AAAA,EACF;AACA,EAAA,OAAO,KAAA;AACT;AAEA,eAAe,8BAAA,CACb,QACA,OAAA,EACe;AACf,EAAA,MAAM,SAAA,GAAY,YAAA,CAAa,MAAA,CAAO,OAAA,EAAS,YAAY,eAAe,CAAA;AAC1E,EAAA,MAAM,OAAA,GAAU,YAAA,CAAa,MAAA,CAAO,OAAA,EAAS,UAAU,aAAa,CAAA;AACpE,EAAA,MAAM,IAAA,GAAO,MAAM,MAAA,CAAO,OAAA;AAAA,IACxB,iBAAA,CAAkB,GAAA;AAAA;AAAA,WAAA,EAET,GAAA,CAAI,UAAA,CAAW,OAAA,CAAQ,WAAW,CAAC,CAAA;AAAA,gBAAA,EAC9B,GAAA,CAAI,UAAA,CAAW,OAAA,CAAQ,YAAY,CAAC,CAAA;AAAA,mDAAA,EACD,SAAS;AAAA,gBAAA,EAC5C,GAAA,CAAI,UAAA,CAAW,OAAA,CAAQ,YAAY,CAAC,CAAA;AAAA,iDAAA,EACH,OAAO;AAAA;AAAA;AAAA,iCAAA,EAGvB,mBAAmB;AAAA;AAAA;AAAA,IAAA,CAGjD;AAAA,GACH;AACA,EAAA,MAAM,UAAU,mBAAA,CAAoB,IAAA,CAAK,CAAC,CAAA,EAAG,OAAA,EAAS,QAAQ,WAAW,CAAA;AACzE,EAAA,IAAI,YAAY,CAAA,EAAG;AACnB,EAAA,MAAM,IAAI,kBAAA;AAAA,IACR,8DAAA;AAAA,IACA,EAAE,WAAA,EAAa,OAAA,CAAQ,WAAA,EAAa,aAAa,OAAA,EAAQ;AAAA,IACzD;AAAA,MACE,UAAA,EACE;AAAA;AACJ,GACF;AACF;AAEA,eAAe,2BAAA,CACb,QACA,OAAA,EACe;AACf,EAAA,MAAM,KAAA,GAAQ,YAAA,CAAa,MAAA,CAAO,OAAA,EAAS,cAAc,aAAa,CAAA;AACtE,EAAA,MAAM,IAAA,GAAO,MAAM,MAAA,CAAO,OAAA;AAAA,IACxB,iBAAA,CAAkB,GAAA;AAAA;AAAA,WAAA,EAET,GAAA,CAAI,UAAA,CAAW,OAAA,CAAQ,WAAW,CAAC,CAAA;AAAA,gBAAA,EAC9B,GAAA,CAAI,UAAA,CAAW,OAAA,CAAQ,YAAY,CAAC,CAAA;AAAA,qDAAA,EACC,KAAK;AAAA;AAAA,IAAA,CAEvD;AAAA,GACH;AACA,EAAA,MAAM,UAAU,mBAAA,CAAoB,IAAA,CAAK,CAAC,CAAA,EAAG,OAAA,EAAS,QAAQ,WAAW,CAAA;AACzE,EAAA,IAAI,YAAY,CAAA,EAAG;AACnB,EAAA,MAAM,IAAI,kBAAA;AAAA,IACR,2DAAA;AAAA,IACA,EAAE,WAAA,EAAa,OAAA,CAAQ,WAAA,EAAa,aAAa,OAAA,EAAQ;AAAA,IACzD;AAAA,MACE,UAAA,EACE;AAAA;AACJ,GACF;AACF;AAEA,eAAe,oBAAA,CACb,QACA,OAAA,EAMe;AACf,EAAA,MAAM,UAAA,GAAa,QAAQ,OAAA,CAAQ,GAAA,CAAI,CAAC,MAAA,KAAW,GAAA,CAAI,UAAA,CAAW,MAAM,CAAC,CAAA;AACzE,EAAA,MAAM,MAAA,GAAS,QAAQ,OAAA,CAAQ,GAAA;AAAA,IAAI,CAAC,MAAA,KAClC,cAAA,CAAe,MAAA,EAAQ,QAAQ;AAAA,GACjC;AACA,EAAA,MAAM,8BAAA,CAA+B,QAAQ,OAAO,CAAA;AACpD,EAAA,MAAM,SAAA,GAAY,YAAA,CAAa,MAAA,CAAO,OAAA,EAAS,YAAY,eAAe,CAAA;AAC1E,EAAA,MAAM,OAAA,GAAU,YAAA,CAAa,MAAA,CAAO,OAAA,EAAS,UAAU,aAAa,CAAA;AACpE,EAAA,MAAM,gBAAA;AAAA,IACJ,MAAA;AAAA,IACA,GAAA;AAAA,kBAAA,EACgB,GAAA,CAAI,UAAA,CAAW,OAAA,CAAQ,cAAc,CAAC;AAAA,SAAA,EAC/C,GAAA,CAAI,IAAA,CAAK,UAAA,EAAY,GAAA,CAAA,EAAA,CAAO,CAAC,CAAA;AAAA,aAAA,EACzB,GAAA,CAAI,IAAA,CAAK,MAAA,EAAQ,GAAA,CAAA,EAAA,CAAO,CAAC;AAAA,WAAA,EAC3B,GAAA,CAAI,UAAA,CAAW,OAAA,CAAQ,WAAW,CAAC,CAAA;AAAA;AAAA;AAAA,gBAAA,EAG9B,GAAA,CAAI,UAAA,CAAW,OAAA,CAAQ,YAAY,CAAC,CAAA;AAAA,mDAAA,EACD,SAAS;AAAA,gBAAA,EAC5C,GAAA,CAAI,UAAA,CAAW,OAAA,CAAQ,YAAY,CAAC,CAAA;AAAA,iDAAA,EACH,OAAO;AAAA,IAAA;AAAA,GAExD;AACF;AAEA,eAAe,iBAAA,CACb,QACA,OAAA,EAKe;AACf,EAAA,MAAM,2BAAA,CAA4B,QAAQ,OAAO,CAAA;AACjD,EAAA,MAAM,KAAA,GAAQ,YAAA,CAAa,MAAA,CAAO,OAAA,EAAS,cAAc,aAAa,CAAA;AACtE,EAAA,MAAM,gBAAA;AAAA,IACJ,MAAA;AAAA,IACA,GAAA;AAAA,kBAAA,EACgB,GAAA,CAAI,UAAA,CAAW,OAAA,CAAQ,cAAc,CAAC;AAAA;AAAA;AAAA,WAAA,EAG7C,GAAA,CAAI,UAAA,CAAW,OAAA,CAAQ,WAAW,CAAC,CAAA;AAAA;AAAA,gBAAA,EAE9B,GAAA,CAAI,UAAA,CAAW,OAAA,CAAQ,YAAY,CAAC,CAAA;AAAA,qDAAA,EACC,KAAK;AAAA,IAAA;AAAA,GAE1D;AACF;AAEA,eAAe,mBAAA,CACb,MAAA,EACA,MAAA,EACA,YAAA,EACe;AACf,EAAA,MAAM,SAAA,GAAY;AAAA,IAChB,aAAA,EAAe,kBAAA,CAAmB,MAAA,CAAO,aAAA,EAAe,IAAI,CAAA;AAAA,IAC5D,aAAA,EAAe,kBAAA,CAAmB,MAAA,CAAO,aAAA,EAAe,IAAI,CAAA;AAAA,IAC5D,aAAA,EAAe,kBAAA,CAAmB,MAAA,CAAO,aAAA,EAAe,IAAI;AAAA,GAC9D;AACA,EAAA,MAAM,GAAA,GAAM,QAAA,CAAS,MAAA,CAAO,OAAA,EAAS,QAAQ,SAAS,CAAA;AACtD,EAAA,KAAA,MAAW,KAAA,IAAS,MAAA,CAAO,MAAA,CAAO,SAAS,CAAA,EAAG;AAC5C,IAAA,MAAM,gBAAA;AAAA,MACJ,MAAA;AAAA,MACA,GAAA,CAAA,qBAAA,EAA2B,GAAA,CAAI,UAAA,CAAW,KAAK,CAAC,CAAA;AAAA,KAClD;AAAA,EACF;AACA,EAAA,MAAM,UAAA,CAAW,MAAA,EAAQ,kBAAA,CAAmB,GAAA,CAAI,KAAK,CAAC,CAAA;AACtD,EAAA,MAAM,UAAA,CAAW,MAAA,EAAQ,kBAAA,CAAmB,GAAA,CAAI,KAAK,CAAC,CAAA;AACtD,EAAA,MAAM,UAAA,CAAW,MAAA,EAAQ,kBAAA,CAAmB,GAAA,CAAI,KAAK,CAAC,CAAA;AACtD,EAAA,MAAM,qBAAqB,MAAA,EAAQ;AAAA,IACjC,OAAA,EAAS,qBAAA;AAAA,IACT,aAAa,MAAA,CAAO,aAAA;AAAA,IACpB,YAAA;AAAA,IACA,gBAAgB,SAAA,CAAU;AAAA,GAC3B,CAAA;AACD,EAAA,MAAM,qBAAqB,MAAA,EAAQ;AAAA,IACjC,OAAA,EAAS,qBAAA;AAAA,IACT,aAAa,MAAA,CAAO,aAAA;AAAA,IACpB,YAAA;AAAA,IACA,gBAAgB,SAAA,CAAU;AAAA,GAC3B,CAAA;AACD,EAAA,MAAM,kBAAkB,MAAA,EAAQ;AAAA,IAC9B,aAAa,MAAA,CAAO,aAAA;AAAA,IACpB,YAAA;AAAA,IACA,gBAAgB,SAAA,CAAU;AAAA,GAC3B,CAAA;AAED,EAAA,MAAM,gBAAA;AAAA,IACJ,MAAA;AAAA,IACA,GAAA,CAAA,WAAA,EAAiB,GAAA,CAAI,UAAA,CAAW,MAAA,CAAO,aAAa,CAAC,CAAA;AAAA,GACvD;AACA,EAAA,MAAM,gBAAA;AAAA,IACJ,MAAA;AAAA,IACA,GAAA,CAAA,WAAA,EAAiB,GAAA,CAAI,UAAA,CAAW,MAAA,CAAO,aAAa,CAAC,CAAA;AAAA,GACvD;AACA,EAAA,MAAM,gBAAA;AAAA,IACJ,MAAA;AAAA,IACA,GAAA,CAAA,WAAA,EAAiB,GAAA,CAAI,UAAA,CAAW,MAAA,CAAO,aAAa,CAAC,CAAA;AAAA,GACvD;AACA,EAAA,MAAM,WAAA,CAAY,MAAA,EAAQ,SAAA,CAAU,aAAA,EAAe,OAAO,aAAa,CAAA;AACvE,EAAA,MAAM,WAAA,CAAY,MAAA,EAAQ,SAAA,CAAU,aAAA,EAAe,OAAO,aAAa,CAAA;AACvE,EAAA,MAAM,WAAA,CAAY,MAAA,EAAQ,SAAA,CAAU,aAAA,EAAe,OAAO,aAAa,CAAA;AACvE,EAAA,MAAM,0BAAA;AAAA,IACJ,MAAA;AAAA,IACA,SAAA,CAAU,aAAA;AAAA,IACV,MAAA,CAAO;AAAA,GACT;AACA,EAAA,MAAM,0BAAA;AAAA,IACJ,MAAA;AAAA,IACA,SAAA,CAAU,aAAA;AAAA,IACV,MAAA,CAAO;AAAA,GACT;AACA,EAAA,MAAM,0BAAA;AAAA,IACJ,MAAA;AAAA,IACA,SAAA,CAAU,aAAA;AAAA,IACV,MAAA,CAAO;AAAA,GACT;AACA,EAAA,KAAA,MAAW,SAAA,IAAa;AAAA,IACtB,GAAG,GAAA,CAAI,KAAA,CAAM,KAAA,CAAM,CAAC,CAAA;AAAA,IACpB,GAAG,GAAA,CAAI,KAAA,CAAM,KAAA,CAAM,CAAC,CAAA;AAAA,IACpB,GAAG,GAAA,CAAI,KAAA,CAAM,KAAA,CAAM,CAAC;AAAA,GACtB,EAAG;AACD,IAAA,MAAM,UAAA,CAAW,QAAQ,SAAS,CAAA;AAAA,EACpC;AACF;AAEA,eAAe,0BAAA,CACb,MAAA,EACA,cAAA,EACA,UAAA,EACe;AACf,EAAA,IAAI,MAAA,CAAO,YAAY,UAAA,EAAY;AACnC,EAAA,MAAM,gBAAA;AAAA,IACJ,MAAA;AAAA,IACA,GAAA;AAAA,kBAAA,EACgB,GAAA,CAAI,UAAA,CAAW,UAAU,CAAC;AAAA,wBAAA,EACpB,GAAA,CAAI,UAAA,CAAW,CAAA,EAAG,cAAc,OAAO,CAAC;AAAA,SAAA,EACvD,IAAI,UAAA,CAAW,mBAAA,CAAoB,GAAG,UAAU,CAAA,KAAA,CAAO,CAAC,CAAC;AAAA,IAAA;AAAA,GAElE;AACF;AAEA,SAAS,mBAAmB,UAAA,EAAuC;AACjE,EAAA,MAAM,SAAA,GAAY,WAAW,CAAC,CAAA;AAC9B,EAAA,IAAI,cAAc,MAAA,EAAW;AAC3B,IAAA,MAAM,IAAI,mBAAmB,yCAAyC,CAAA;AAAA,EACxE;AACA,EAAA,OAAO,SAAA;AACT;AAEA,eAAe,WAAA,CACb,MAAA,EACA,IAAA,EACA,EAAA,EACe;AACf,EAAA,IAAI;AACF,IAAA,MAAM,gBAAA;AAAA,MACJ,MAAA;AAAA,MACA,GAAA,CAAA,YAAA,EAAkB,IAAI,UAAA,CAAW,IAAI,CAAC,CAAA,WAAA,EAAc,GAAA,CAAI,UAAA,CAAW,EAAE,CAAC,CAAA;AAAA,KACxE;AAAA,EACF,SAAS,KAAA,EAAO;AACd,IAAA,MAAM,IAAI,kBAAA;AAAA,MACR,kDAAA;AAAA,MACA,EAAE,MAAM,EAAA,EAAG;AAAA,MACX,EAAE,OAAO,KAAA;AAAM,KACjB;AAAA,EACF;AACF;AAUA,eAAsB,0BACpB,OAAA,EAC0C;AAC1C,EAAA,MAAM,MAAA,GAAS,kBAAA,CAAmB,OAAA,CAAQ,OAAA,EAAS,QAAQ,UAAU,CAAA;AACrE,EAAA,MAAM,QAAA,GAAW,gBAAA,CAAiB,MAAA,EAAQ,OAAA,CAAQ,gBAAgB,CAAA;AAClE,EAAA,OAAO,OAAA,CAAQ,OAAA,CAAQ,WAAA,CAAY,OAAO,MAAA,KAAW;AACnD,IAAA,MAAM,YAAA,GAAe,MAAM,WAAA,CAAY,MAAA,EAAQ,OAAO,aAAa,CAAA;AACnE,IAAA,IAAI,YAAA,CAAa,SAAS,CAAA,EAAG;AAC3B,MAAA,OAAO;AAAA,QACL,QAAA,EAAU,KAAA;AAAA,QACV,MAAA,EAAQ,CAAA;AAAA,QACR,OAAA,EAAS,CAAA;AAAA,QACT,gBAAA,EAAkB;AAAA,OACpB;AAAA,IACF;AACA,IAAA,IAAI,YAAA,CAAa,GAAA,CAAI,UAAU,CAAA,EAAG;AAChC,MAAA,MAAM,UAAA,GAAa,MAAM,WAAA,CAAY,MAAA,EAAQ,QAAQ,CAAA;AACrD,MAAA,IAAI,UAAA,CAAW,SAAS,CAAA,EAAG;AACzB,QAAA,OAAO;AAAA,UACL,QAAA,EAAU,KAAA;AAAA,UACV,MAAA,EAAQ,CAAA;AAAA,UACR,OAAA,EAAS,CAAA;AAAA,UACT,gBAAA,EAAkB;AAAA,SACpB;AAAA,MACF;AACA,MAAA,MAAM,IAAA,GAAO,MAAM,MAAA,CAAO,OAAA;AAAA,QACxB,iBAAA,CAAkB,GAAA;AAAA;AAAA,eAAA,EAET,GAAA,CAAI,UAAA,CAAW,QAAQ,CAAC;AAAA,QAAA,CAChC;AAAA,OACH;AACA,MAAA,MAAM,UAAU,MAAA,CAAO,IAAA,CAAK,CAAC,CAAA,EAAG,WAAW,CAAC,CAAA;AAC5C,MAAA,MAAM,SAAS,MAAA,CAAO,IAAA,CAAK,CAAC,CAAA,EAAG,UAAU,CAAC,CAAA;AAC1C,MAAA,OAAO;AAAA,QACL,QAAA,EAAU,KAAA;AAAA,QACV,MAAA,EAAQ,MAAA,CAAO,aAAA,CAAc,MAAM,IAAI,MAAA,GAAS,CAAA;AAAA,QAChD,OAAA,EAAS,MAAA,CAAO,aAAA,CAAc,OAAO,IAAI,OAAA,GAAU,CAAA;AAAA,QACnD,gBAAA,EAAkB;AAAA,OACpB;AAAA,IACF;AACA,IAAA,MAAM,WAAA,GAAc,MAAM,WAAA,CAAY,MAAA,EAAQ,OAAO,aAAa,CAAA;AAClE,IAAA,MAAM,WAAA,GAAc,MAAM,WAAA,CAAY,MAAA,EAAQ,OAAO,aAAa,CAAA;AAClE,IAAA,IACE,CAAC,YAAY,GAAA,CAAI,eAAe,KAChC,CAAC,WAAA,CAAY,GAAA,CAAI,eAAe,CAAA,EAChC;AACA,MAAA,MAAM,IAAI,kBAAA;AAAA,QACR,4CAAA;AAAA,QACA,EAAE,MAAA;AAAO,OACX;AAAA,IACF;AAEA,IAAA,MAAM,WAAW,MAAA,EAAQ,eAAA,CAAgB,MAAA,CAAO,OAAA,EAAS,QAAQ,CAAC,CAAA;AAClE,IAAA,MAAM,OAAA,GAAU,MAAM,kBAAA,CAAmB,MAAA,EAAQ,MAAM,CAAA;AACvD,IAAA,MAAM,gBAAA,CAAiB,MAAA,EAAQ,QAAA,EAAU,OAAO,CAAA;AAChD,IAAA,MAAM,mBAAA,CAAoB,MAAA,EAAQ,MAAA,EAAQ,QAAQ,CAAA;AAClD,IAAA,OAAO;AAAA,MACL,QAAA,EAAU,IAAA;AAAA,MACV,MAAA,EAAQ,IAAI,GAAA,CAAI,OAAA,CAAQ,GAAA,CAAI,CAAC,GAAA,KAAQ,GAAA,CAAI,OAAO,CAAC,CAAA,CAAE,IAAA;AAAA,MACnD,SAAS,OAAA,CAAQ,MAAA;AAAA,MACjB,gBAAA,EAAkB;AAAA,KACpB;AAAA,EACF,CAAC,CAAA;AACH;AAGA,eAAsB,sBACpB,OAAA,EAC0B;AAC1B,EAAA,IAAI;AACF,IAAA,OAAO,iBAAA,CAAkB,QAAQ,MAAM,CAAA;AAAA,EACzC,SAAS,KAAA,EAAO;AACd,IAAA,IAAI,EAAE,KAAA,YAAiB,eAAA,CAAA,EAAkB,MAAM,KAAA;AAAA,EACjD;AACA,EAAA,MAAM,gBAAA,GAAmB,sBAAA,CAAuB,OAAA,CAAQ,MAAM,CAAA;AAC9D,EAAA,MAAM,MAAA,GAAS,kBAAA,CAAmB,OAAA,CAAQ,OAAA,EAAS,QAAQ,UAAU,CAAA;AACrE,EAAA,MAAM,QAAA,GAAW,gBAAA,CAAiB,MAAA,EAAQ,OAAA,CAAQ,gBAAgB,CAAA;AAClE,EAAA,MAAM,IAAA,GAAO,MAAM,OAAA,CAAQ,OAAA,CAAQ,OAAA;AAAA,IACjC,iBAAA,CAAkB,GAAA;AAAA;AAAA,WAAA,EAET,GAAA,CAAI,UAAA,CAAW,QAAQ,CAAC;AAAA,uBAAA,EACZ,QAAQ,OAAO;AAAA,iCAAA,EACL,gBAAgB;AAAA,IAAA,CAC9C;AAAA,GACH;AACA,EAAA,MAAM,GAAA,GAAM,KAAK,CAAC,CAAA;AAClB,EAAA,IAAI,QAAQ,MAAA,EAAW;AACrB,IAAA,MAAM,IAAI,kBAAA;AAAA,MACR,sEAAA;AAAA,MACA,EAAE,MAAA,EAAQ,OAAA,CAAQ,MAAA,EAAQ,OAAA,EAAS,QAAQ,OAAA,EAAQ;AAAA,MACnD;AAAA,QACE,UAAA,EACE;AAAA;AACJ,KACF;AAAA,EACF;AACA,EAAA,OAAO,qBAAA;AAAA,IACL,YAAA,CAAa,IAAI,QAAQ,CAAA;AAAA,IACzB,sBAAA,CAAuB,IAAI,WAAW;AAAA,GACxC;AACF;AAMA,eAAsB,8BACpB,OAAA,EACe;AACf,EAAA,IAAI,OAAA,CAAQ,OAAA,CAAQ,gBAAA,KAAqB,MAAA,EAAW;AAClD,IAAA,MAAM,IAAI,kBAAA;AAAA,MACR,6EAAA;AAAA,MACA,EAAE,OAAA,EAAS,OAAA,CAAQ,OAAA,CAAQ,OAAA;AAAQ,KACrC;AAAA,EACF;AACA,EAAA,MAAM,MAAA,GAAS,kBAAA,CAAmB,OAAA,CAAQ,OAAA,EAAS,QAAQ,UAAU,CAAA;AACrE,EAAA,MAAM,QAAA,GAAW,gBAAA,CAAiB,MAAA,EAAQ,OAAA,CAAQ,gBAAgB,CAAA;AAClE,EAAA,MAAM,OAAA,CAAQ,OAAA,CAAQ,WAAA,CAAY,OAAO,MAAA,KAAW;AAClD,IAAA,MAAM,gBAAA;AAAA,MACJ,MAAA;AAAA,MACA,GAAA;AAAA,oBAAA,EACgB,GAAA,CAAI,UAAA,CAAW,QAAQ,CAAC;AAAA,yBAAA,EACnB,QAAQ,OAAO;AAAA,MAAA;AAAA,KAEtC;AACA,IAAA,IAAI,OAAA,CAAQ,kBAAkB,IAAA,EAAM;AACpC,IAAA,MAAM,IAAA,GAAO,MAAM,MAAA,CAAO,OAAA;AAAA,MACxB,iBAAA,CAAkB,GAAA;AAAA;AAAA,aAAA,EAET,GAAA,CAAI,UAAA,CAAW,QAAQ,CAAC;AAAA,MAAA,CAChC;AAAA,KACH;AACA,IAAA,MAAM,YAAY,mBAAA,CAAoB,IAAA,CAAK,CAAC,CAAA,EAAG,SAAS,QAAQ,CAAA;AAChE,IAAA,IAAI,cAAc,CAAA,EAAG;AACnB,MAAA,MAAM,gBAAA;AAAA,QACJ,MAAA;AAAA,QACA,GAAA,CAAA,WAAA,EAAiB,GAAA,CAAI,UAAA,CAAW,QAAQ,CAAC,CAAA;AAAA,OAC3C;AAAA,IACF;AAAA,EACF,CAAC,CAAA;AACH","file":"chunk-MZLPX2R7.js","sourcesContent":["/**\n * One-time offline migration from timestamp-only recorded relations to numeric\n * revisions. The durable remap table lets applications translate checkpoints\n * stored outside TypeGraph before deleting the migration metadata.\n */\nimport {\n  asRecordedInstant,\n  createRecordedInstant,\n  RECORDED_MAX_REVISION,\n  type RecordedInstant,\n} from \"../core/temporal\";\nimport { ConfigurationError, ValidationError } from \"../errors\";\nimport {\n  createSqlSchema,\n  type ResolvedSqlTableNames,\n  type SqlTableNames,\n} from \"../query/compiler/schema\";\nimport { shortHash } from \"../query/dialect/vector-strategy\";\nimport { sql, type SqlFragment } from \"../query/sql-fragment\";\nimport { asCompiledRowsSql, asCompiledStatementSql } from \"../query/sql-intent\";\nimport { canonicalizeDatabaseTimestamp } from \"../utils/date\";\nimport { postgresContributions, sqliteContributions } from \"./drizzle/ddl\";\nimport { createPostgresTables } from \"./drizzle/schema/postgres\";\nimport { createSqliteTables } from \"./drizzle/schema/sqlite\";\nimport { type GraphBackend, type TransactionBackend } from \"./types\";\n\nconst LEGACY_RECORDED_MAX = \"9999-12-31T23:59:59.999Z\";\nconst MIGRATION_SUFFIX = \"legacy_recorded_anchors\";\n\nconst RECORDED_NODE_COLUMNS = [\n  \"history_id\",\n  \"graph_id\",\n  \"kind\",\n  \"id\",\n  \"props\",\n  \"version\",\n  \"valid_from\",\n  \"valid_to\",\n  \"created_at\",\n  \"updated_at\",\n  \"deleted_at\",\n  \"recorded_from\",\n  \"recorded_to\",\n  \"op\",\n  \"schema_version\",\n  \"tx_id\",\n  \"meta\",\n] as const;\n\nconst RECORDED_EDGE_COLUMNS = [\n  \"history_id\",\n  \"graph_id\",\n  \"id\",\n  \"kind\",\n  \"from_kind\",\n  \"from_id\",\n  \"to_kind\",\n  \"to_id\",\n  \"props\",\n  \"valid_from\",\n  \"valid_to\",\n  \"created_at\",\n  \"updated_at\",\n  \"deleted_at\",\n  \"recorded_from\",\n  \"recorded_to\",\n  \"op\",\n  \"schema_version\",\n  \"tx_id\",\n  \"meta\",\n] as const;\n\ntype LegacyInstantRow = Readonly<{\n  graph_id: unknown;\n  recorded_at: unknown;\n}>;\n\ntype MappingRow = Readonly<{\n  graphId: string;\n  legacyRecordedAt: string;\n  recordedAt: string;\n  revision: number;\n}>;\n\ntype RemapRow = Readonly<{ recorded_at: unknown; revision: unknown }>;\ntype MappingCountRow = Readonly<{ anchors: unknown; graphs: unknown }>;\ntype MissingMappingRow = Readonly<{ missing: unknown }>;\ntype ColumnRow = Readonly<{ name: unknown }>;\n\nexport type MigrateLegacyRecordedTimeOptions = Readonly<{\n  backend: GraphBackend;\n  /** Override the backend's recorded table names. */\n  tableNames?: Partial<SqlTableNames> | undefined;\n  /** Override the durable legacy-anchor mapping table name. */\n  mappingTableName?: string | undefined;\n}>;\n\nexport type MigrateLegacyRecordedTimeResult = Readonly<{\n  /** `true` when timestamp columns were rewritten during this call. */\n  migrated: boolean;\n  /** Number of graphs represented in the legacy commit order. */\n  graphs: number;\n  /** Number of distinct legacy anchors available for remapping. */\n  anchors: number;\n  /** Physical table retaining the old-anchor → revision mapping. */\n  mappingTableName: string;\n}>;\n\nexport type MigrateRecordedAnchorOptions = Readonly<{\n  backend: Pick<GraphBackend, \"dialect\" | \"execute\" | \"tableNames\">;\n  graphId: string;\n  anchor: string;\n  tableNames?: Partial<SqlTableNames> | undefined;\n  mappingTableName?: string | undefined;\n}>;\n\nexport type DeleteLegacyRecordedAnchorMapOptions = Readonly<{\n  backend: Pick<\n    GraphBackend,\n    \"dialect\" | \"execute\" | \"executeStatement\" | \"tableNames\" | \"transaction\"\n  >;\n  graphId: string;\n  tableNames?: Partial<SqlTableNames> | undefined;\n  mappingTableName?: string | undefined;\n  /** Drop the mapping table when this deletion leaves it empty. */\n  dropWhenEmpty?: boolean | undefined;\n}>;\n\nfunction resolvedTableNames(\n  backend: Pick<GraphBackend, \"tableNames\">,\n  override: Partial<SqlTableNames> | undefined,\n): ResolvedSqlTableNames {\n  return createSqlSchema(override ?? backend.tableNames ?? {}).tables;\n}\n\nfunction shortenedIdentifier(value: string): string {\n  if (value.length <= 63) return value;\n  return `${value.slice(0, 50)}_${shortHash(value)}`;\n}\n\nfunction mappingTableName(\n  tables: ResolvedSqlTableNames,\n  override: string | undefined,\n): string {\n  const candidate = override ?? `${tables.recordedClock}_${MIGRATION_SUFFIX}`;\n  return createSqlSchema({\n    recordedClock: shortenedIdentifier(candidate),\n  }).tables.recordedClock;\n}\n\nfunction temporaryTableName(tableName: string, role: string): string {\n  return shortenedIdentifier(`__tg_${role}_${shortHash(tableName)}`);\n}\n\nfunction requireStatements(\n  target: Pick<TransactionBackend, \"dialect\" | \"executeStatement\">,\n): NonNullable<TransactionBackend[\"executeStatement\"]> {\n  if (target.executeStatement === undefined) {\n    throw new ConfigurationError(\n      \"Recorded-time migration requires executeStatement support.\",\n      { dialect: target.dialect },\n      { suggestion: \"Use a built-in SQLite or PostgreSQL backend.\" },\n    );\n  }\n  return target.executeStatement;\n}\n\nasync function executeStatement(\n  target: Pick<TransactionBackend, \"dialect\" | \"executeStatement\">,\n  statement: SqlFragment,\n): Promise<void> {\n  await requireStatements(target)(asCompiledStatementSql(statement));\n}\n\nasync function executeDdl(\n  target: Pick<TransactionBackend, \"dialect\" | \"executeStatement\">,\n  ddl: string,\n): Promise<void> {\n  await executeStatement(target, sql.raw(ddl));\n}\n\nfunction canonicalLegacyInstant(value: unknown): string {\n  const canonical = canonicalizeDatabaseTimestamp(value);\n  if (canonical === undefined) {\n    throw new ConfigurationError(\n      \"Legacy recorded-time relation contained an invalid timestamp.\",\n      { value },\n    );\n  }\n  return canonical;\n}\n\nfunction safeRevision(value: unknown): number {\n  const revision =\n    typeof value === \"bigint\" ? Number(value)\n    : typeof value === \"string\" && /^\\d+$/.test(value) ? Number(value)\n    : value;\n  if (\n    typeof revision !== \"number\" ||\n    !Number.isSafeInteger(revision) ||\n    revision < 1 ||\n    revision >= RECORDED_MAX_REVISION\n  ) {\n    throw new ConfigurationError(\n      \"Recorded anchor mapping contained an invalid revision.\",\n      { value },\n    );\n  }\n  return revision;\n}\n\nasync function columnNames(\n  target: TransactionBackend,\n  tableName: string,\n): Promise<ReadonlySet<string>> {\n  const rows =\n    target.dialect === \"sqlite\" ?\n      await target.execute<ColumnRow>(\n        asCompiledRowsSql(sql`PRAGMA table_info(${sql.identifier(tableName)})`),\n      )\n    : await target.execute<ColumnRow>(\n        asCompiledRowsSql(sql`\n          SELECT column_name AS name\n          FROM information_schema.columns\n          WHERE table_schema = current_schema()\n            AND table_name = ${tableName}\n        `),\n      );\n  return new Set(\n    rows.flatMap((row) => (typeof row.name === \"string\" ? [row.name] : [])),\n  );\n}\n\nasync function readLegacyInstants(\n  target: TransactionBackend,\n  tables: ResolvedSqlTableNames,\n): Promise<readonly MappingRow[]> {\n  const rows = await target.execute<LegacyInstantRow>(\n    asCompiledRowsSql(sql`\n      SELECT graph_id, recorded_from AS recorded_at\n      FROM ${sql.identifier(tables.recordedNodes)}\n      UNION\n      SELECT graph_id, recorded_to AS recorded_at\n      FROM ${sql.identifier(tables.recordedNodes)}\n      WHERE recorded_to <> ${LEGACY_RECORDED_MAX}\n      UNION\n      SELECT graph_id, recorded_from AS recorded_at\n      FROM ${sql.identifier(tables.recordedEdges)}\n      UNION\n      SELECT graph_id, recorded_to AS recorded_at\n      FROM ${sql.identifier(tables.recordedEdges)}\n      WHERE recorded_to <> ${LEGACY_RECORDED_MAX}\n      UNION\n      SELECT graph_id, recorded_at\n      FROM ${sql.identifier(tables.recordedClock)}\n    `),\n  );\n  const instants = rows.map((row) => {\n    if (typeof row.graph_id !== \"string\") {\n      throw new ConfigurationError(\n        \"Legacy recorded-time relation contained an invalid graph id.\",\n        { graphId: row.graph_id },\n      );\n    }\n    return {\n      graphId: row.graph_id,\n      recordedAt: canonicalLegacyInstant(row.recorded_at),\n    };\n  });\n  instants.sort((left, right) => {\n    if (left.graphId < right.graphId) return -1;\n    if (left.graphId > right.graphId) return 1;\n    if (left.recordedAt < right.recordedAt) return -1;\n    if (left.recordedAt > right.recordedAt) return 1;\n    return 0;\n  });\n\n  const mapping: MappingRow[] = [];\n  let graphId: string | undefined;\n  let revision = 0;\n  let previousInstant: string | undefined;\n  for (const instant of instants) {\n    if (instant.graphId !== graphId) {\n      graphId = instant.graphId;\n      revision = 0;\n      previousInstant = undefined;\n    }\n    if (instant.recordedAt === previousInstant) continue;\n    revision += 1;\n    mapping.push({\n      graphId: instant.graphId,\n      legacyRecordedAt: instant.recordedAt,\n      recordedAt: instant.recordedAt,\n      revision,\n    });\n    previousInstant = instant.recordedAt;\n  }\n  return mapping;\n}\n\nfunction migrationMapDdl(\n  dialect: GraphBackend[\"dialect\"],\n  table: string,\n): string {\n  const revisionType = dialect === \"postgres\" ? \"BIGINT\" : \"INTEGER\";\n  const recordedAtType = dialect === \"postgres\" ? \"TIMESTAMPTZ\" : \"TEXT\";\n  return `CREATE TABLE IF NOT EXISTS \"${table}\" (\n  graph_id TEXT NOT NULL,\n  legacy_recorded_at TEXT NOT NULL,\n  revision ${revisionType} NOT NULL,\n  recorded_at ${recordedAtType} NOT NULL,\n  PRIMARY KEY (graph_id, legacy_recorded_at)\n);`;\n}\n\nasync function writeMappingRows(\n  target: TransactionBackend,\n  tableName: string,\n  rows: readonly MappingRow[],\n): Promise<void> {\n  await executeStatement(target, sql`DELETE FROM ${sql.identifier(tableName)}`);\n  const rowsPerStatement = Math.max(\n    1,\n    Math.floor((target.capabilities.maxBindParameters ?? 900) / 4),\n  );\n  for (let start = 0; start < rows.length; start += rowsPerStatement) {\n    const values = rows\n      .slice(start, start + rowsPerStatement)\n      .map(\n        (row) =>\n          sql`(${row.graphId}, ${row.legacyRecordedAt}, ${row.revision}, ${row.recordedAt})`,\n      );\n    await executeStatement(\n      target,\n      sql`\n        INSERT INTO ${sql.identifier(tableName)}\n          (graph_id, legacy_recorded_at, revision, recorded_at)\n        VALUES ${sql.join(values, sql`, `)}\n      `,\n    );\n  }\n}\n\nfunction tableDdl(\n  dialect: GraphBackend[\"dialect\"],\n  tables: ResolvedSqlTableNames,\n  temporary: Readonly<{\n    recordedClock: string;\n    recordedEdges: string;\n    recordedNodes: string;\n  }>,\n): Readonly<{\n  clock: readonly string[];\n  edges: readonly string[];\n  nodes: readonly string[];\n}> {\n  if (dialect === \"sqlite\") {\n    const temporaryTables = createSqliteTables(temporary);\n    const finalTables = createSqliteTables(tables);\n    const temporaryContributions = sqliteContributions(temporaryTables);\n    const finalContributions = sqliteContributions(finalTables);\n    return ddlForRecordedTables(temporaryContributions, finalContributions);\n  }\n  const temporaryTables = createPostgresTables(temporary);\n  const finalTables = createPostgresTables(tables);\n  return ddlForRecordedTables(\n    postgresContributions(temporaryTables),\n    postgresContributions(finalTables),\n  );\n}\n\nfunction ddlForRecordedTables(\n  temporary: readonly Readonly<{\n    createDdl: readonly string[];\n    logicalName: string;\n  }>[],\n  final: readonly Readonly<{\n    createDdl: readonly string[];\n    logicalName: string;\n  }>[],\n): Readonly<{\n  clock: readonly string[];\n  edges: readonly string[];\n  nodes: readonly string[];\n}> {\n  function statements(\n    logicalName: \"recordedClock\" | \"recordedEdges\" | \"recordedNodes\",\n  ): readonly string[] {\n    const temporaryDdl = temporary.find(\n      (entry) => entry.logicalName === logicalName,\n    )?.createDdl;\n    const finalDdl = final.find(\n      (entry) => entry.logicalName === logicalName,\n    )?.createDdl;\n    if (temporaryDdl === undefined || finalDdl === undefined) {\n      throw new ConfigurationError(\n        `Could not generate migration DDL for ${logicalName}.`,\n      );\n    }\n    const createTable = temporaryDdl[0];\n    if (createTable === undefined) {\n      throw new ConfigurationError(\n        `Could not generate migration table DDL for ${logicalName}.`,\n      );\n    }\n    return [createTable, ...finalDdl.slice(1)];\n  }\n  return {\n    clock: statements(\"recordedClock\"),\n    edges: statements(\"recordedEdges\"),\n    nodes: statements(\"recordedNodes\"),\n  };\n}\n\nfunction migratedColumn(column: string, legacyAlias: string): SqlFragment {\n  if (column === \"recorded_from\") return sql`from_map.revision`;\n  if (column === \"recorded_to\") {\n    return sql`\n      CASE\n            WHEN ${sql.raw(legacyAlias)}.recorded_to = ${LEGACY_RECORDED_MAX}\n            THEN ${RECORDED_MAX_REVISION}\n            ELSE to_map.revision\n          END\n    `;\n  }\n  return sql`${sql.raw(legacyAlias)}.${sql.identifier(column)}`;\n}\n\nfunction mappingMatch(\n  dialect: GraphBackend[\"dialect\"],\n  mappingAlias: \"anchor_map\" | \"from_map\" | \"to_map\",\n  legacyColumn: \"recorded_at\" | \"recorded_from\" | \"recorded_to\",\n): SqlFragment {\n  const mapping = sql.raw(mappingAlias);\n  const legacy = sql.raw(`legacy.${legacyColumn}`);\n  return dialect === \"postgres\" ?\n      sql`${mapping}.recorded_at = ${legacy}`\n    : sql`${mapping}.legacy_recorded_at = ${legacy}`;\n}\n\nfunction missingMappingCount(value: unknown, legacyTable: string): number {\n  const count = Number(value);\n  if (!Number.isSafeInteger(count) || count < 0) {\n    throw new ConfigurationError(\n      \"Recorded-time migration returned an invalid integrity-check count.\",\n      { legacyTable, value },\n    );\n  }\n  return count;\n}\n\nasync function assertRecordedRelationMappings(\n  target: TransactionBackend,\n  options: Readonly<{ legacyTable: string; mappingTable: string }>,\n): Promise<void> {\n  const fromMatch = mappingMatch(target.dialect, \"from_map\", \"recorded_from\");\n  const toMatch = mappingMatch(target.dialect, \"to_map\", \"recorded_to\");\n  const rows = await target.execute<MissingMappingRow>(\n    asCompiledRowsSql(sql`\n      SELECT COUNT(*) AS missing\n      FROM ${sql.identifier(options.legacyTable)} AS legacy\n      LEFT JOIN ${sql.identifier(options.mappingTable)} AS from_map\n        ON from_map.graph_id = legacy.graph_id AND ${fromMatch}\n      LEFT JOIN ${sql.identifier(options.mappingTable)} AS to_map\n        ON to_map.graph_id = legacy.graph_id AND ${toMatch}\n      WHERE from_map.revision IS NULL\n         OR (\n           legacy.recorded_to <> ${LEGACY_RECORDED_MAX}\n           AND to_map.revision IS NULL\n         )\n    `),\n  );\n  const missing = missingMappingCount(rows[0]?.missing, options.legacyTable);\n  if (missing === 0) return;\n  throw new ConfigurationError(\n    \"Legacy recorded-time boundaries could not be mapped exactly.\",\n    { legacyTable: options.legacyTable, missingRows: missing },\n    {\n      suggestion:\n        \"Ensure every legacy boundary is a valid millisecond-precision timestamp produced by the preview recorded clock before retrying the offline migration.\",\n    },\n  );\n}\n\nasync function assertRecordedClockMappings(\n  target: TransactionBackend,\n  options: Readonly<{ legacyTable: string; mappingTable: string }>,\n): Promise<void> {\n  const match = mappingMatch(target.dialect, \"anchor_map\", \"recorded_at\");\n  const rows = await target.execute<MissingMappingRow>(\n    asCompiledRowsSql(sql`\n      SELECT COUNT(*) AS missing\n      FROM ${sql.identifier(options.legacyTable)} AS legacy\n      LEFT JOIN ${sql.identifier(options.mappingTable)} AS anchor_map\n        ON anchor_map.graph_id = legacy.graph_id AND ${match}\n      WHERE anchor_map.revision IS NULL\n    `),\n  );\n  const missing = missingMappingCount(rows[0]?.missing, options.legacyTable);\n  if (missing === 0) return;\n  throw new ConfigurationError(\n    \"Legacy recorded clock values could not be mapped exactly.\",\n    { legacyTable: options.legacyTable, missingRows: missing },\n    {\n      suggestion:\n        \"Ensure every legacy clock value is a valid millisecond-precision timestamp produced by the preview recorded clock before retrying the offline migration.\",\n    },\n  );\n}\n\nasync function copyRecordedRelation(\n  target: TransactionBackend,\n  options: Readonly<{\n    columns: readonly string[];\n    legacyTable: string;\n    mappingTable: string;\n    temporaryTable: string;\n  }>,\n): Promise<void> {\n  const columnList = options.columns.map((column) => sql.identifier(column));\n  const values = options.columns.map((column) =>\n    migratedColumn(column, \"legacy\"),\n  );\n  await assertRecordedRelationMappings(target, options);\n  const fromMatch = mappingMatch(target.dialect, \"from_map\", \"recorded_from\");\n  const toMatch = mappingMatch(target.dialect, \"to_map\", \"recorded_to\");\n  await executeStatement(\n    target,\n    sql`\n      INSERT INTO ${sql.identifier(options.temporaryTable)}\n        (${sql.join(columnList, sql`, `)})\n      SELECT ${sql.join(values, sql`, `)}\n      FROM ${sql.identifier(options.legacyTable)} AS legacy\n      -- LEFT JOIN is deliberate: a missing mapping reaches the NOT NULL\n      -- revision columns and fails loud instead of silently dropping history.\n      LEFT JOIN ${sql.identifier(options.mappingTable)} AS from_map\n        ON from_map.graph_id = legacy.graph_id AND ${fromMatch}\n      LEFT JOIN ${sql.identifier(options.mappingTable)} AS to_map\n        ON to_map.graph_id = legacy.graph_id AND ${toMatch}\n    `,\n  );\n}\n\nasync function copyRecordedClock(\n  target: TransactionBackend,\n  options: Readonly<{\n    legacyTable: string;\n    mappingTable: string;\n    temporaryTable: string;\n  }>,\n): Promise<void> {\n  await assertRecordedClockMappings(target, options);\n  const match = mappingMatch(target.dialect, \"anchor_map\", \"recorded_at\");\n  await executeStatement(\n    target,\n    sql`\n      INSERT INTO ${sql.identifier(options.temporaryTable)}\n        (graph_id, revision, recorded_at)\n      SELECT legacy.graph_id, anchor_map.revision, legacy.recorded_at\n      FROM ${sql.identifier(options.legacyTable)} AS legacy\n      -- Preserve fail-loud behavior if the preflight invariant changes later.\n      LEFT JOIN ${sql.identifier(options.mappingTable)} AS anchor_map\n        ON anchor_map.graph_id = legacy.graph_id AND ${match}\n    `,\n  );\n}\n\nasync function replaceLegacyTables(\n  target: TransactionBackend,\n  tables: ResolvedSqlTableNames,\n  mappingTable: string,\n): Promise<void> {\n  const temporary = {\n    recordedNodes: temporaryTableName(tables.recordedNodes, \"rn\"),\n    recordedEdges: temporaryTableName(tables.recordedEdges, \"re\"),\n    recordedClock: temporaryTableName(tables.recordedClock, \"rc\"),\n  };\n  const ddl = tableDdl(target.dialect, tables, temporary);\n  for (const table of Object.values(temporary)) {\n    await executeStatement(\n      target,\n      sql`DROP TABLE IF EXISTS ${sql.identifier(table)}`,\n    );\n  }\n  await executeDdl(target, requireCreateTable(ddl.nodes));\n  await executeDdl(target, requireCreateTable(ddl.edges));\n  await executeDdl(target, requireCreateTable(ddl.clock));\n  await copyRecordedRelation(target, {\n    columns: RECORDED_NODE_COLUMNS,\n    legacyTable: tables.recordedNodes,\n    mappingTable,\n    temporaryTable: temporary.recordedNodes,\n  });\n  await copyRecordedRelation(target, {\n    columns: RECORDED_EDGE_COLUMNS,\n    legacyTable: tables.recordedEdges,\n    mappingTable,\n    temporaryTable: temporary.recordedEdges,\n  });\n  await copyRecordedClock(target, {\n    legacyTable: tables.recordedClock,\n    mappingTable,\n    temporaryTable: temporary.recordedClock,\n  });\n\n  await executeStatement(\n    target,\n    sql`DROP TABLE ${sql.identifier(tables.recordedNodes)}`,\n  );\n  await executeStatement(\n    target,\n    sql`DROP TABLE ${sql.identifier(tables.recordedEdges)}`,\n  );\n  await executeStatement(\n    target,\n    sql`DROP TABLE ${sql.identifier(tables.recordedClock)}`,\n  );\n  await renameTable(target, temporary.recordedNodes, tables.recordedNodes);\n  await renameTable(target, temporary.recordedEdges, tables.recordedEdges);\n  await renameTable(target, temporary.recordedClock, tables.recordedClock);\n  await renamePrimaryKeyConstraint(\n    target,\n    temporary.recordedNodes,\n    tables.recordedNodes,\n  );\n  await renamePrimaryKeyConstraint(\n    target,\n    temporary.recordedEdges,\n    tables.recordedEdges,\n  );\n  await renamePrimaryKeyConstraint(\n    target,\n    temporary.recordedClock,\n    tables.recordedClock,\n  );\n  for (const statement of [\n    ...ddl.nodes.slice(1),\n    ...ddl.edges.slice(1),\n    ...ddl.clock.slice(1),\n  ]) {\n    await executeDdl(target, statement);\n  }\n}\n\nasync function renamePrimaryKeyConstraint(\n  target: TransactionBackend,\n  temporaryTable: string,\n  finalTable: string,\n): Promise<void> {\n  if (target.dialect !== \"postgres\") return;\n  await executeStatement(\n    target,\n    sql`\n      ALTER TABLE ${sql.identifier(finalTable)}\n      RENAME CONSTRAINT ${sql.identifier(`${temporaryTable}_pkey`)}\n      TO ${sql.identifier(shortenedIdentifier(`${finalTable}_pkey`))}\n    `,\n  );\n}\n\nfunction requireCreateTable(statements: readonly string[]): string {\n  const statement = statements[0];\n  if (statement === undefined) {\n    throw new ConfigurationError(\"Recorded migration table DDL was empty.\");\n  }\n  return statement;\n}\n\nasync function renameTable(\n  target: TransactionBackend,\n  from: string,\n  to: string,\n): Promise<void> {\n  try {\n    await executeStatement(\n      target,\n      sql`ALTER TABLE ${sql.identifier(from)} RENAME TO ${sql.identifier(to)}`,\n    );\n  } catch (error) {\n    throw new ConfigurationError(\n      \"Could not rename a migrated recorded-time table.\",\n      { from, to },\n      { cause: error },\n    );\n  }\n}\n\n/**\n * Rewrites timestamp-only recorded relations to numeric revisions.\n *\n * Run offline before opening a Store with the new schema. The durable mapping\n * table is retained so external checkpoint stores can call\n * {@link migrateRecordedAnchor}; delete each graph's rows after its downstream\n * checkpoints have been rewritten.\n */\nexport async function migrateLegacyRecordedTime(\n  options: MigrateLegacyRecordedTimeOptions,\n): Promise<MigrateLegacyRecordedTimeResult> {\n  const tables = resolvedTableNames(options.backend, options.tableNames);\n  const mapTable = mappingTableName(tables, options.mappingTableName);\n  return options.backend.transaction(async (target) => {\n    const clockColumns = await columnNames(target, tables.recordedClock);\n    if (clockColumns.size === 0) {\n      return {\n        migrated: false,\n        graphs: 0,\n        anchors: 0,\n        mappingTableName: mapTable,\n      };\n    }\n    if (clockColumns.has(\"revision\")) {\n      const mapColumns = await columnNames(target, mapTable);\n      if (mapColumns.size === 0) {\n        return {\n          migrated: false,\n          graphs: 0,\n          anchors: 0,\n          mappingTableName: mapTable,\n        };\n      }\n      const rows = await target.execute<MappingCountRow>(\n        asCompiledRowsSql(sql`\n          SELECT COUNT(*) AS anchors, COUNT(DISTINCT graph_id) AS graphs\n          FROM ${sql.identifier(mapTable)}\n        `),\n      );\n      const anchors = Number(rows[0]?.anchors ?? 0);\n      const graphs = Number(rows[0]?.graphs ?? 0);\n      return {\n        migrated: false,\n        graphs: Number.isSafeInteger(graphs) ? graphs : 0,\n        anchors: Number.isSafeInteger(anchors) ? anchors : 0,\n        mappingTableName: mapTable,\n      };\n    }\n    const nodeColumns = await columnNames(target, tables.recordedNodes);\n    const edgeColumns = await columnNames(target, tables.recordedEdges);\n    if (\n      !nodeColumns.has(\"recorded_from\") ||\n      !edgeColumns.has(\"recorded_from\")\n    ) {\n      throw new ConfigurationError(\n        \"Legacy recorded-time schema is incomplete.\",\n        { tables },\n      );\n    }\n\n    await executeDdl(target, migrationMapDdl(target.dialect, mapTable));\n    const mapping = await readLegacyInstants(target, tables);\n    await writeMappingRows(target, mapTable, mapping);\n    await replaceLegacyTables(target, tables, mapTable);\n    return {\n      migrated: true,\n      graphs: new Set(mapping.map((row) => row.graphId)).size,\n      anchors: mapping.length,\n      mappingTableName: mapTable,\n    };\n  });\n}\n\n/** Remaps one timestamp-only checkpoint after {@link migrateLegacyRecordedTime}. */\nexport async function migrateRecordedAnchor(\n  options: MigrateRecordedAnchorOptions,\n): Promise<RecordedInstant> {\n  try {\n    return asRecordedInstant(options.anchor);\n  } catch (error) {\n    if (!(error instanceof ValidationError)) throw error;\n  }\n  const legacyRecordedAt = canonicalLegacyInstant(options.anchor);\n  const tables = resolvedTableNames(options.backend, options.tableNames);\n  const mapTable = mappingTableName(tables, options.mappingTableName);\n  const rows = await options.backend.execute<RemapRow>(\n    asCompiledRowsSql(sql`\n      SELECT revision, recorded_at\n      FROM ${sql.identifier(mapTable)}\n      WHERE graph_id = ${options.graphId}\n        AND legacy_recorded_at = ${legacyRecordedAt}\n    `),\n  );\n  const row = rows[0];\n  if (row === undefined) {\n    throw new ConfigurationError(\n      \"No migrated recorded anchor matches this graph and legacy timestamp.\",\n      { anchor: options.anchor, graphId: options.graphId },\n      {\n        suggestion:\n          \"Run migrateLegacyRecordedTime() before deleting its mapping rows, and pass the graph that produced the checkpoint.\",\n      },\n    );\n  }\n  return createRecordedInstant(\n    safeRevision(row.revision),\n    canonicalLegacyInstant(row.recorded_at),\n  );\n}\n\n/**\n * Deletes one graph's legacy remap rows after downstream checkpoints migrate.\n * Set `dropWhenEmpty` to remove the migration table after the final graph.\n */\nexport async function deleteLegacyRecordedAnchorMap(\n  options: DeleteLegacyRecordedAnchorMapOptions,\n): Promise<void> {\n  if (options.backend.executeStatement === undefined) {\n    throw new ConfigurationError(\n      \"Deleting a recorded anchor migration map requires executeStatement support.\",\n      { dialect: options.backend.dialect },\n    );\n  }\n  const tables = resolvedTableNames(options.backend, options.tableNames);\n  const mapTable = mappingTableName(tables, options.mappingTableName);\n  await options.backend.transaction(async (target) => {\n    await executeStatement(\n      target,\n      sql`\n        DELETE FROM ${sql.identifier(mapTable)}\n        WHERE graph_id = ${options.graphId}\n      `,\n    );\n    if (options.dropWhenEmpty !== true) return;\n    const rows = await target.execute<MappingCountRow>(\n      asCompiledRowsSql(sql`\n        SELECT COUNT(*) AS anchors, COUNT(DISTINCT graph_id) AS graphs\n        FROM ${sql.identifier(mapTable)}\n      `),\n    );\n    const remaining = missingMappingCount(rows[0]?.anchors, mapTable);\n    if (remaining === 0) {\n      await executeStatement(\n        target,\n        sql`DROP TABLE ${sql.identifier(mapTable)}`,\n      );\n    }\n  });\n}\n"]}

package/dist/chunk-N66HCGCY.cjs

@@ -0,0 +1,57 @@
+'use strict';
+
+// src/utils/object.ts
+function isPlainObject(value) {
+  if (typeof value !== "object" || value === null) return false;
+  const prototype = Object.getPrototypeOf(value);
+  return prototype === Object.prototype || prototype === null;
+}
+function hasOwnKey(bag, key) {
+  return Object.hasOwn(bag, key);
+}
+function readOwnProperty(bag, key) {
+  return hasOwnKey(bag, key) ? bag[key] : void 0;
+}
+function createDataKeyedBag() {
+  return /* @__PURE__ */ Object.create(null);
+}
+var INTEROP_PROBE_KEYS = /* @__PURE__ */ new Set(["then", "toJSON"]);
+function isInteropProbeKey(key) {
+  return INTEROP_PROBE_KEYS.has(key);
+}
+function compactUndefined(value) {
+  const result = {};
+  for (const [key, fieldValue] of Object.entries(value)) {
+    if (fieldValue !== void 0) result[key] = fieldValue;
+  }
+  return result;
+}
+function freezeDeep(value) {
+  if (value === null || typeof value !== "object") return value;
+  if (Object.isFrozen(value)) return value;
+  for (const nested of Object.values(value)) {
+    freezeDeep(nested);
+  }
+  return Object.freeze(value);
+}
+
+// src/utils/presence.ts
+function isPresent(value) {
+  return value !== null && value !== void 0;
+}
+function requireDefined(value, message = "Expected a defined value.") {
+  if (value === void 0 || value === null) throw new TypeError(message);
+  return value;
+}
+
+exports.compactUndefined = compactUndefined;
+exports.createDataKeyedBag = createDataKeyedBag;
+exports.freezeDeep = freezeDeep;
+exports.hasOwnKey = hasOwnKey;
+exports.isInteropProbeKey = isInteropProbeKey;
+exports.isPlainObject = isPlainObject;
+exports.isPresent = isPresent;
+exports.readOwnProperty = readOwnProperty;
+exports.requireDefined = requireDefined;
+//# sourceMappingURL=chunk-N66HCGCY.cjs.map
+//# sourceMappingURL=chunk-N66HCGCY.cjs.map

package/dist/chunk-N66HCGCY.cjs.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/utils/object.ts","../src/utils/presence.ts"],"names":[],"mappings":";;;AAMO,SAAS,cACd,KAAA,EACkC;AAClC,EAAA,IAAI,OAAO,KAAA,KAAU,QAAA,IAAY,KAAA,KAAU,MAAM,OAAO,KAAA;AACxD,EAAA,MAAM,SAAA,GAAqB,MAAA,CAAO,cAAA,CAAe,KAAK,CAAA;AACtD,EAAA,OAAO,SAAA,KAAc,MAAA,CAAO,SAAA,IAAa,SAAA,KAAc,IAAA;AACzD;AAyBO,SAAS,SAAA,CACd,KACA,GAAA,EACS;AACT,EAAA,OAAO,MAAA,CAAO,MAAA,CAAO,GAAA,EAAK,GAAG,CAAA;AAC/B;AASO,SAAS,eAAA,CACd,KACA,GAAA,EACS;AACT,EAAA,OAAO,UAAU,GAAA,EAAK,GAAG,CAAA,GAAI,GAAA,CAAI,GAAG,CAAA,GAAI,MAAA;AAC1C;AAqCO,SAAS,kBAAA,GAA2C;AACzD,EAAA,uBAAO,MAAA,CAAO,OAAO,IAAI,CAAA;AAC3B;AASA,IAAM,qCAA0C,IAAI,GAAA,CAAI,CAAC,MAAA,EAAQ,QAAQ,CAAC,CAAA;AAuBnE,SAAS,kBAAkB,GAAA,EAAsB;AACtD,EAAA,OAAO,kBAAA,CAAmB,IAAI,GAAG,CAAA;AACnC;AAWO,SAAS,iBAAmC,KAAA,EAE7C;AACJ,EAAA,MAAM,SAAkC,EAAC;AACzC,EAAA,KAAA,MAAW,CAAC,GAAA,EAAK,UAAU,KAAK,MAAA,CAAO,OAAA,CAAQ,KAAK,CAAA,EAAG;AACrD,IAAA,IAAI,UAAA,KAAe,MAAA,EAAW,MAAA,CAAO,GAAG,CAAA,GAAI,UAAA;AAAA,EAC9C;AACA,EAAA,OAAO,MAAA;AACT;AAUO,SAAS,WAAc,KAAA,EAAa;AACzC,EAAA,IAAI,KAAA,KAAU,IAAA,IAAQ,OAAO,KAAA,KAAU,UAAU,OAAO,KAAA;AACxD,EAAA,IAAI,MAAA,CAAO,QAAA,CAAS,KAAK,CAAA,EAAG,OAAO,KAAA;AACnC,EAAA,KAAA,MAAW,MAAA,IAAU,MAAA,CAAO,MAAA,CAAO,KAAgC,CAAA,EAAG;AACpE,IAAA,UAAA,CAAW,MAAM,CAAA;AAAA,EACnB;AACA,EAAA,OAAO,MAAA,CAAO,OAAO,KAAK,CAAA;AAC5B;;;AClKO,SAAS,UAAU,KAAA,EAAyB;AACjD,EAAA,OAAO,KAAA,KAAU,QAAQ,KAAA,KAAU,MAAA;AACrC;AAOO,SAAS,cAAA,CACd,KAAA,EACA,OAAA,GAAU,2BAAA,EACM;AAChB,EAAA,IAAI,UAAU,MAAA,IAAa,KAAA,KAAU,MAAM,MAAM,IAAI,UAAU,OAAO,CAAA;AACtE,EAAA,OAAO,KAAA;AACT","file":"chunk-N66HCGCY.cjs","sourcesContent":["/**\n * Plain-object predicate. Excludes class instances (Date, Map, Set,\n * RegExp, Buffer, …) and arrays. Used wherever the caller needs to\n * distinguish a literal `{}` from anything else — e.g. JSON-value\n * validation and runtime-document structural checks.\n */\nexport function isPlainObject(\n  value: unknown,\n): value is Record<string, unknown> {\n  if (typeof value !== \"object\" || value === null) return false;\n  const prototype: unknown = Object.getPrototypeOf(value);\n  return prototype === Object.prototype || prototype === null;\n}\n\n/**\n * Own-key membership for a bag whose KEYS ARE DATA — a props record parsed out\n * of a JSON column, a JSON-Schema `properties` map, a serialized-schema kind\n * table. The single owner of that question; every path asking it calls here.\n *\n * `in` is the wrong operator for these bags because it also finds inherited\n * members: `\"toString\" in {}` is `true`, as are `\"constructor\"`, `\"valueOf\"`,\n * `\"__proto__\"`, and the rest of `Object.prototype`. A bag that does NOT carry\n * the key therefore reads as if it does, and the `bag[key]` read that follows\n * yields the inherited member instead of stored data.\n *\n * Reachable, and not through anything exotic: a schema may DECLARE a field named\n * after a prototype member — `z.object({ toString: z.string() })` is an ordinary\n * schema — and such a field survives validation, storage, and the JSON round-trip\n * as normal data. (`__proto__` is the narrower case: Zod drops an own `__proto__`\n * key and `bag[\"__proto__\"] = value` assigns a prototype rather than creating one,\n * so no validated write produces it — but the unvalidated trusted import writes a\n * caller's bag verbatim, and JSON parses `__proto__` back as an own key.)\n *\n * `in` remains correct — and stays in use — where the key set is statically\n * known: a discriminated union's tag, a capability probe, a brand check. The\n * distinction is whether the key came from data or from the code.\n */\nexport function hasOwnKey(\n  bag: Readonly<Record<string, unknown>>,\n  key: string,\n): boolean {\n  return Object.hasOwn(bag, key);\n}\n\n/**\n * Own-key read of a data-keyed bag: an absent key reads `undefined`, never an\n * inherited `Object.prototype` member. The read companion to {@link hasOwnKey}\n * (see its doc for why `bag[key]` alone is wrong for these bags), and like it\n * the single owner — every path reading a data-keyed bag by a data-supplied\n * key calls here rather than re-spelling the guard.\n */\nexport function readOwnProperty(\n  bag: Readonly<Record<string, unknown>>,\n  key: string,\n): unknown {\n  return hasOwnKey(bag, key) ? bag[key] : undefined;\n}\n\n/**\n * Creates an accumulator whose KEYS ARE DATA — a kind name, a property name, a\n * JSON-Schema keyword, an entity's property bag. The write-side companion to\n * {@link hasOwnKey} / {@link readOwnProperty}, and like them the single owner\n * of the question: every accumulator keyed by data is built here.\n *\n * Null-prototype, because `bag[key] = value` on a `{}` literal does NOT create\n * an entry when `key` is `__proto__`: it invokes `Object.prototype`'s\n * `__proto__` SETTER, which either reparents the bag (object value) or does\n * nothing at all (primitive value). Either way the value is silently dropped,\n * and every later own-key read answers as if the writer never wrote it — the\n * write-side mirror of the inherited-member read `hasOwnKey` exists to prevent.\n *\n * Reachable, and not through anything exotic: kind names are validated against\n * `/^[A-Za-z_][A-Za-z0-9_]*$/`, which admits `__proto__` (as it does\n * `toString` and `constructor`); extension property names are unrestricted\n * apart from a reserved list; and `JSON.parse` yields `__proto__` as an\n * ordinary own key, so any document read off disk or the wire can carry one.\n *\n * A plain `{}` remains correct — and stays in use — for records whose keys are\n * statically known: an options object, a discriminated-union member, a fixed\n * lookup table.\n *\n * ## Spread it at the boundary\n *\n * The null prototype is an INTERNAL write-side protection, not something a\n * caller asked for. A bag that escapes into a value this library RETURNS must\n * be copied with a spread — `return { ...bag }` — at that boundary: returned\n * as-is it has no `toString`, no `hasOwnProperty`, and answers `false` to\n * `instanceof Object`, which is a public behavior change against every other\n * object the library hands back. The spread is safe precisely where a\n * key-by-key rebuild would not be: it copies own properties with\n * CreateDataProperty rather than Set, so an own `__proto__` key survives the\n * copy while `Object.prototype` is restored.\n */\nexport function createDataKeyedBag<T>(): Record<string, T> {\n  return Object.create(null) as Record<string, T>;\n}\n\n/**\n * The two property names JavaScript itself probes on an arbitrary object:\n * `then` (the thenable check promise adoption performs) and `toJSON` (the hook\n * `JSON.stringify` looks for). A proxy standing in for data resolves them to\n * `undefined` so it is not mistaken for a promise and does not break\n * serialization.\n */\nconst INTEROP_PROBE_KEYS: ReadonlySet<string> = new Set([\"then\", \"toJSON\"]);\n\n/**\n * True if `key` is a name the language probes for a protocol rather than a name\n * a caller asked for. The single owner of WHICH names those are — the companion\n * to, not a substitute for, the question of whether the name is data\n * (`hasOwnKey` for a materialized bag, `SchemaIntrospector.hasDeclaredField`\n * for a proxy whose key set is the schema).\n *\n * **This predicate is a fallback, never a short-circuit.** `then` and `toJSON`\n * are ordinary identifiers: `z.object({ toJSON: z.string() })` is a legal\n * schema, and such a field is stored, validated, and round-tripped as data like\n * any other. A trap that answers `undefined` for these names BEFORE consulting\n * the data it fronts therefore drops a declared field — the read side of the\n * same mistake `hasOwnKey` fixes on the write side. Ask the data question\n * first; reach for this only once the answer is \"not data\", where resolving to\n * `undefined` keeps `await` and `JSON.stringify` working on a partial object.\n *\n * Returning stored data for an own `then` is safe as well as correct: props\n * come from a JSON column, so the value can never be callable, and the thenable\n * check ignores a non-callable `then` exactly as it does on the plain objects\n * the non-selective path returns.\n */\nexport function isInteropProbeKey(key: string): boolean {\n  return INTEROP_PROBE_KEYS.has(key);\n}\n\n/**\n * Builds an object dropping any keys whose value is `undefined`.\n *\n * Lets callers construct discriminated-union members and `defineNode` /\n * `defineEdge` option objects without tripping over\n * `exactOptionalPropertyTypes: true` — which forbids setting `optional:\n * undefined` on a type that declares `optional?: boolean`. The cast keeps\n * call sites readable; this helper is the single typed seam.\n */\nexport function compactUndefined<T extends object>(value: {\n  [K in keyof T]: T[K] | undefined;\n}): T {\n  const result: Record<string, unknown> = {};\n  for (const [key, fieldValue] of Object.entries(value)) {\n    if (fieldValue !== undefined) result[key] = fieldValue;\n  }\n  return result as T;\n}\n\n/**\n * Recursively `Object.freeze` every plain object / array reachable from\n * `value`. Already-frozen branches are skipped. Returns the input for\n * convenient chaining; the freeze is in-place.\n *\n * Class instances and other non-plain values are left alone — only their\n * containers freeze.\n */\nexport function freezeDeep<T>(value: T): T {\n  if (value === null || typeof value !== \"object\") return value;\n  if (Object.isFrozen(value)) return value;\n  for (const nested of Object.values(value as Record<string, unknown>)) {\n    freezeDeep(nested);\n  }\n  return Object.freeze(value);\n}\n","/**\n * Predicate for values that are materially present in database rows.\n */\nexport function isPresent(value: unknown): boolean {\n  return value !== null && value !== undefined;\n}\n\n/**\n * Narrows a value after a runtime presence check. Prefer this to a non-null\n * assertion: an invalid invariant fails at the point where it is assumed,\n * with a stable error instead of propagating `undefined` into unrelated code.\n */\nexport function requireDefined<T>(\n  value: T,\n  message = \"Expected a defined value.\",\n): NonNullable<T> {\n  if (value === undefined || value === null) throw new TypeError(message);\n  return value;\n}\n"]}