@nicia-ai/typegraph 0.28.0 → 0.29.0

package/dist/chunk-CUZGBWFT.js

@@ -0,0 +1,206 @@
+import { quoteIdentifier, quotedTableName, vectorScoreExpression, vectorMinScoreCondition, VECTOR_CONTRIBUTION_PREFIX, vectorPhysicalName, assertFiniteEmbedding } from './chunk-7KLVFWXR.js';
+import { sql } from 'drizzle-orm';
+
+var TABLE_PREFIX = "tg_vec";
+var INDEX_PREFIX = "tg_vecidx";
+var LIBSQL_MAX_DIMENSIONS = 65536;
+var LIBSQL_CAPABILITIES = {
+  supported: true,
+  metrics: ["cosine", "l2"],
+  // "hnsw" = portable ANN intent, realized as DiskANN. "none" = brute-force.
+  indexTypes: ["hnsw", "none"],
+  maxDimensions: LIBSQL_MAX_DIMENSIONS
+};
+function usesAnnIndex(slot) {
+  return slot.indexType === "hnsw";
+}
+function libsqlMetricToken(metric) {
+  switch (metric) {
+    case "cosine": {
+      return "cosine";
+    }
+    case "l2": {
+      return "l2";
+    }
+    case "inner_product": {
+      throw new Error(
+        "libSQL vector search does not support inner_product. Use 'cosine' or 'l2'."
+      );
+    }
+    default: {
+      const _exhaustive = metric;
+      throw new Error(`Unsupported vector metric: ${String(_exhaustive)}`);
+    }
+  }
+}
+function vector32Literal(embedding, name) {
+  assertFiniteEmbedding(embedding, name);
+  return sql`vector32(${`[${embedding.join(",")}]`})`;
+}
+function distanceExpression(embeddingColumn, queryEmbedding, metric) {
+  const query = vector32Literal(queryEmbedding, "queryEmbedding");
+  switch (metric) {
+    case "cosine": {
+      return sql`vector_distance_cos(${embeddingColumn}, ${query})`;
+    }
+    case "l2": {
+      return sql`vector_distance_l2(${embeddingColumn}, ${query})`;
+    }
+    case "inner_product": {
+      throw new Error(
+        "libSQL vector search does not support inner_product. Use 'cosine' or 'l2'."
+      );
+    }
+    default: {
+      const _exhaustive = metric;
+      throw new Error(`Unsupported vector metric: ${String(_exhaustive)}`);
+    }
+  }
+}
+var libsqlVectorStrategy = {
+  name: "libsql-native",
+  capabilities: LIBSQL_CAPABILITIES,
+  tableName(graphId, nodeKind, fieldPath) {
+    return vectorPhysicalName(TABLE_PREFIX, graphId, nodeKind, fieldPath);
+  },
+  ownedTables(slot) {
+    const table = this.tableName(slot.graphId, slot.nodeKind, slot.fieldPath);
+    const name = quoteIdentifier(table);
+    const createDdl = [
+      `CREATE TABLE IF NOT EXISTS ${name} (
+  "graph_id" TEXT NOT NULL,
+  "node_id" TEXT NOT NULL,
+  "embedding" F32_BLOB(${slot.dimensions}) NOT NULL,
+  "created_at" TEXT NOT NULL,
+  "updated_at" TEXT NOT NULL,
+  PRIMARY KEY ("graph_id", "node_id")
+);`
+    ];
+    if (usesAnnIndex(slot)) {
+      createDdl.push(libsqlVectorIndexDdl(table, slot));
+    }
+    return [
+      {
+        logicalName: `${VECTOR_CONTRIBUTION_PREFIX}:${slot.nodeKind}.${slot.fieldPath}`,
+        owner: "libsql-native",
+        tableName: table,
+        createDdl,
+        runtimeEnsure: true
+      }
+    ];
+  },
+  buildUpsert(slot, params, timestamp) {
+    const table = quotedTableName(
+      this.tableName(slot.graphId, slot.nodeKind, slot.fieldPath)
+    );
+    const value = vector32Literal(params.embedding, "embedding");
+    return [
+      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")
+        DO UPDATE SET "embedding" = ${value}, "updated_at" = ${timestamp}
+      `
+    ];
+  },
+  buildDelete(slot, params) {
+    const table = quotedTableName(
+      this.tableName(slot.graphId, slot.nodeKind, slot.fieldPath)
+    );
+    return [
+      sql`
+        DELETE FROM ${table}
+        WHERE "graph_id" = ${params.graphId} AND "node_id" = ${params.nodeId}
+      `
+    ];
+  },
+  buildSearch(slot, params) {
+    const table = this.tableName(slot.graphId, slot.nodeKind, slot.fieldPath);
+    const quoted = quotedTableName(table);
+    const embeddingColumn = sql`${quoted}."embedding"`;
+    const distance = distanceExpression(
+      embeddingColumn,
+      params.queryEmbedding,
+      params.metric
+    );
+    const score = vectorScoreExpression(distance, params.metric);
+    if (usesAnnIndex(slot)) {
+      const indexName = libsqlIndexName(slot);
+      const query = vector32Literal(params.queryEmbedding, "queryEmbedding");
+      const conditions2 = [sql`${quoted}."graph_id" = ${params.graphId}`];
+      if (params.minScore !== void 0) {
+        conditions2.push(
+          vectorMinScoreCondition(distance, params.metric, params.minScore)
+        );
+      }
+      return sql`
+        SELECT ${quoted}."node_id" AS node_id, ${score} AS score
+        FROM vector_top_k(${indexName}, ${query}, ${params.limit})
+        JOIN ${quoted} ON ${quoted}.rowid = id
+        WHERE ${sql.join(conditions2, sql` AND `)}
+        ORDER BY ${distance} ASC
+        LIMIT ${params.limit}
+      `;
+    }
+    const conditions = [sql`${quoted}."graph_id" = ${params.graphId}`];
+    if (params.minScore !== void 0) {
+      conditions.push(
+        vectorMinScoreCondition(distance, params.metric, params.minScore)
+      );
+    }
+    return sql`
+      SELECT ${quoted}."node_id" AS node_id, ${score} AS score
+      FROM ${quoted}
+      WHERE ${sql.join(conditions, sql` AND `)}
+      ORDER BY ${distance} ASC
+      LIMIT ${params.limit}
+    `;
+  },
+  distanceExpression(embeddingColumn, queryEmbedding, metric) {
+    return distanceExpression(embeddingColumn, queryEmbedding, metric);
+  },
+  buildCreateIndex(slot) {
+    if (!usesAnnIndex(slot)) return void 0;
+    return sql.raw(
+      libsqlVectorIndexDdl(
+        this.tableName(slot.graphId, slot.nodeKind, slot.fieldPath),
+        slot
+      )
+    );
+  },
+  buildDropIndex(slot) {
+    if (!usesAnnIndex(slot)) return void 0;
+    const indexName = libsqlIndexName(slot);
+    return sql.raw(`DROP INDEX IF EXISTS ${quoteIdentifier(indexName)}`);
+  },
+  buildDropStorage(slot) {
+    const table = quoteIdentifier(
+      this.tableName(slot.graphId, slot.nodeKind, slot.fieldPath)
+    );
+    const statements = [];
+    if (usesAnnIndex(slot)) {
+      statements.push(
+        `DROP INDEX IF EXISTS ${quoteIdentifier(libsqlIndexName(slot))}`
+      );
+    }
+    statements.push(`DROP TABLE IF EXISTS ${table}`);
+    return statements;
+  }
+};
+function libsqlIndexName(slot) {
+  return vectorPhysicalName(
+    INDEX_PREFIX,
+    slot.graphId,
+    slot.nodeKind,
+    slot.fieldPath
+  );
+}
+function libsqlVectorIndexDdl(table, slot) {
+  const indexName = quoteIdentifier(libsqlIndexName(slot));
+  const metric = libsqlMetricToken(slot.metric);
+  return `CREATE INDEX IF NOT EXISTS ${indexName} ON ${quoteIdentifier(table)}(libsql_vector_idx("embedding", 'metric=${metric}'));`;
+}
+
+export { libsqlVectorStrategy };
+//# sourceMappingURL=chunk-CUZGBWFT.js.map
+//# sourceMappingURL=chunk-CUZGBWFT.js.map

package/dist/chunk-CUZGBWFT.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/query/dialect/vector/libsql-strategy.ts"],"names":["conditions"],"mappings":";;;AA2CA,IAAM,YAAA,GAAe,QAAA;AACrB,IAAM,YAAA,GAAe,WAAA;AAKrB,IAAM,qBAAA,GAAwB,KAAA;AAE9B,IAAM,mBAAA,GAA0C;AAAA,EAC9C,SAAA,EAAW,IAAA;AAAA,EACX,OAAA,EAAS,CAAC,QAAA,EAAU,IAAI,CAAA;AAAA;AAAA,EAExB,UAAA,EAAY,CAAC,MAAA,EAAQ,MAAM,CAAA;AAAA,EAC3B,aAAA,EAAe;AACjB,CAAA;AAGA,SAAS,aAAa,IAAA,EAA2B;AAC/C,EAAA,OAAO,KAAK,SAAA,KAAc,MAAA;AAC5B;AAGA,SAAS,kBAAkB,MAAA,EAA8B;AACvD,EAAA,QAAQ,MAAA;AAAQ,IACd,KAAK,QAAA,EAAU;AACb,MAAA,OAAO,QAAA;AAAA,IACT;AAAA,IACA,KAAK,IAAA,EAAM;AACT,MAAA,OAAO,IAAA;AAAA,IACT;AAAA,IACA,KAAK,eAAA,EAAiB;AACpB,MAAA,MAAM,IAAI,KAAA;AAAA,QACR;AAAA,OACF;AAAA,IACF;AAAA,IACA,SAAS;AACP,MAAA,MAAM,WAAA,GAAqB,MAAA;AAC3B,MAAA,MAAM,IAAI,KAAA,CAAM,CAAA,2BAAA,EAA8B,MAAA,CAAO,WAAW,CAAC,CAAA,CAAE,CAAA;AAAA,IACrE;AAAA;AAEJ;AAOA,SAAS,eAAA,CAAgB,WAA8B,IAAA,EAAmB;AACxE,EAAA,qBAAA,CAAsB,WAAW,IAAI,CAAA;AACrC,EAAA,OAAO,eAAe,CAAA,CAAA,EAAI,SAAA,CAAU,IAAA,CAAK,GAAG,CAAC,CAAA,CAAA,CAAG,CAAA,CAAA,CAAA;AAClD;AAEA,SAAS,kBAAA,CACP,eAAA,EACA,cAAA,EACA,MAAA,EACK;AACL,EAAA,MAAM,KAAA,GAAQ,eAAA,CAAgB,cAAA,EAAgB,gBAAgB,CAAA;AAC9D,EAAA,QAAQ,MAAA;AAAQ,IACd,KAAK,QAAA,EAAU;AACb,MAAA,OAAO,GAAA,CAAA,oBAAA,EAA0B,eAAe,CAAA,EAAA,EAAK,KAAK,CAAA,CAAA,CAAA;AAAA,IAC5D;AAAA,IACA,KAAK,IAAA,EAAM;AACT,MAAA,OAAO,GAAA,CAAA,mBAAA,EAAyB,eAAe,CAAA,EAAA,EAAK,KAAK,CAAA,CAAA,CAAA;AAAA,IAC3D;AAAA,IACA,KAAK,eAAA,EAAiB;AACpB,MAAA,MAAM,IAAI,KAAA;AAAA,QACR;AAAA,OACF;AAAA,IACF;AAAA,IACA,SAAS;AACP,MAAA,MAAM,WAAA,GAAqB,MAAA;AAC3B,MAAA,MAAM,IAAI,KAAA,CAAM,CAAA,2BAAA,EAA8B,MAAA,CAAO,WAAW,CAAC,CAAA,CAAE,CAAA;AAAA,IACrE;AAAA;AAEJ;AAEO,IAAM,oBAAA,GAAuC;AAAA,EAClD,IAAA,EAAM,eAAA;AAAA,EACN,YAAA,EAAc,mBAAA;AAAA,EAEd,SAAA,CAAU,OAAA,EAAS,QAAA,EAAU,SAAA,EAAW;AACtC,IAAA,OAAO,kBAAA,CAAmB,YAAA,EAAc,OAAA,EAAS,QAAA,EAAU,SAAS,CAAA;AAAA,EACtE,CAAA;AAAA,EAEA,YAAY,IAAA,EAA4C;AACtD,IAAA,MAAM,KAAA,GAAQ,KAAK,SAAA,CAAU,IAAA,CAAK,SAAS,IAAA,CAAK,QAAA,EAAU,KAAK,SAAS,CAAA;AACxE,IAAA,MAAM,IAAA,GAAO,gBAAgB,KAAK,CAAA;AAKlC,IAAA,MAAM,SAAA,GAAY;AAAA,MAChB,8BAA8B,IAAI,CAAA;AAAA;AAAA;AAAA,uBAAA,EAGf,KAAK,UAAU,CAAA;AAAA;AAAA;AAAA;AAAA,EAAA;AAAA,KAKpC;AAEA,IAAA,IAAI,YAAA,CAAa,IAAI,CAAA,EAAG;AAGtB,MAAA,SAAA,CAAU,IAAA,CAAK,oBAAA,CAAqB,KAAA,EAAO,IAAI,CAAC,CAAA;AAAA,IAClD;AAEA,IAAA,OAAO;AAAA,MACL;AAAA,QACE,WAAA,EAAa,GAAG,0BAA0B,CAAA,CAAA,EAAI,KAAK,QAAQ,CAAA,CAAA,EAAI,KAAK,SAAS,CAAA,CAAA;AAAA,QAC7E,KAAA,EAAO,eAAA;AAAA,QACP,SAAA,EAAW,KAAA;AAAA,QACX,SAAA;AAAA,QACA,aAAA,EAAe;AAAA;AACjB,KACF;AAAA,EACF,CAAA;AAAA,EAEA,WAAA,CAAY,IAAA,EAAM,MAAA,EAA+B,SAAA,EAA2B;AAC1E,IAAA,MAAM,KAAA,GAAQ,eAAA;AAAA,MACZ,KAAK,SAAA,CAAU,IAAA,CAAK,SAAS,IAAA,CAAK,QAAA,EAAU,KAAK,SAAS;AAAA,KAC5D;AACA,IAAA,MAAM,KAAA,GAAQ,eAAA,CAAgB,MAAA,CAAO,SAAA,EAAW,WAAW,CAAA;AAC3D,IAAA,OAAO;AAAA,MACL,GAAA;AAAA,oBAAA,EACgB,KAAK,CAAA;AAAA,gBAAA,EACT,MAAA,CAAO,OAAO,CAAA,EAAA,EAAK,MAAA,CAAO,MAAM,KAAK,KAAK,CAAA,EAAA,EAAK,SAAS,CAAA,EAAA,EAAK,SAAS,CAAA;AAAA;AAAA,oCAAA,EAElD,KAAK,oBAAoB,SAAS;AAAA,MAAA;AAAA,KAEpE;AAAA,EACF,CAAA;AAAA,EAEA,WAAA,CAAY,MAAM,MAAA,EAA+C;AAC/D,IAAA,MAAM,KAAA,GAAQ,eAAA;AAAA,MACZ,KAAK,SAAA,CAAU,IAAA,CAAK,SAAS,IAAA,CAAK,QAAA,EAAU,KAAK,SAAS;AAAA,KAC5D;AACA,IAAA,OAAO;AAAA,MACL,GAAA;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,WAAA,CAAY,MAAM,MAAA,EAAiC;AACjD,IAAA,MAAM,KAAA,GAAQ,KAAK,SAAA,CAAU,IAAA,CAAK,SAAS,IAAA,CAAK,QAAA,EAAU,KAAK,SAAS,CAAA;AACxE,IAAA,MAAM,MAAA,GAAS,gBAAgB,KAAK,CAAA;AACpC,IAAA,MAAM,eAAA,GAAkB,MAAM,MAAM,CAAA,YAAA,CAAA;AACpC,IAAA,MAAM,QAAA,GAAW,kBAAA;AAAA,MACf,eAAA;AAAA,MACA,MAAA,CAAO,cAAA;AAAA,MACP,MAAA,CAAO;AAAA,KACT;AACA,IAAA,MAAM,KAAA,GAAQ,qBAAA,CAAsB,QAAA,EAAU,MAAA,CAAO,MAAM,CAAA;AAE3D,IAAA,IAAI,YAAA,CAAa,IAAI,CAAA,EAAG;AAKtB,MAAA,MAAM,SAAA,GAAY,gBAAgB,IAAI,CAAA;AACtC,MAAA,MAAM,KAAA,GAAQ,eAAA,CAAgB,MAAA,CAAO,cAAA,EAAgB,gBAAgB,CAAA;AACrE,MAAA,MAAMA,cAAoB,CAAC,GAAA,CAAA,EAAM,MAAM,CAAA,cAAA,EAAiB,MAAA,CAAO,OAAO,CAAA,CAAE,CAAA;AACxE,MAAA,IAAI,MAAA,CAAO,aAAa,MAAA,EAAW;AACjC,QAAAA,WAAAA,CAAW,IAAA;AAAA,UACT,uBAAA,CAAwB,QAAA,EAAU,MAAA,CAAO,MAAA,EAAQ,OAAO,QAAQ;AAAA,SAClE;AAAA,MACF;AACA,MAAA,OAAO,GAAA;AAAA,eAAA,EACI,MAAM,0BAA0B,KAAK,CAAA;AAAA,0BAAA,EAC1B,SAAS,CAAA,EAAA,EAAK,KAAK,CAAA,EAAA,EAAK,OAAO,KAAK,CAAA;AAAA,aAAA,EACjD,MAAM,OAAO,MAAM,CAAA;AAAA,cAAA,EAClB,GAAA,CAAI,IAAA,CAAKA,WAAAA,EAAY,GAAA,CAAA,KAAA,CAAU,CAAC;AAAA,iBAAA,EAC7B,QAAQ,CAAA;AAAA,cAAA,EACX,OAAO,KAAK;AAAA,MAAA,CAAA;AAAA,IAExB;AAGA,IAAA,MAAM,aAAoB,CAAC,GAAA,CAAA,EAAM,MAAM,CAAA,cAAA,EAAiB,MAAA,CAAO,OAAO,CAAA,CAAE,CAAA;AACxE,IAAA,IAAI,MAAA,CAAO,aAAa,MAAA,EAAW;AACjC,MAAA,UAAA,CAAW,IAAA;AAAA,QACT,uBAAA,CAAwB,QAAA,EAAU,MAAA,CAAO,MAAA,EAAQ,OAAO,QAAQ;AAAA,OAClE;AAAA,IACF;AACA,IAAA,OAAO,GAAA;AAAA,aAAA,EACI,MAAM,0BAA0B,KAAK,CAAA;AAAA,WAAA,EACvC,MAAM;AAAA,YAAA,EACL,GAAA,CAAI,IAAA,CAAK,UAAA,EAAY,GAAA,CAAA,KAAA,CAAU,CAAC;AAAA,eAAA,EAC7B,QAAQ,CAAA;AAAA,YAAA,EACX,OAAO,KAAK;AAAA,IAAA,CAAA;AAAA,EAExB,CAAA;AAAA,EAEA,kBAAA,CAAmB,eAAA,EAAiB,cAAA,EAAgB,MAAA,EAAQ;AAC1D,IAAA,OAAO,kBAAA,CAAmB,eAAA,EAAiB,cAAA,EAAgB,MAAM,CAAA;AAAA,EACnE,CAAA;AAAA,EAEA,iBAAiB,IAAA,EAAuB;AACtC,IAAA,IAAI,CAAC,YAAA,CAAa,IAAI,CAAA,EAAG,OAAO,MAAA;AAChC,IAAA,OAAO,GAAA,CAAI,GAAA;AAAA,MACT,oBAAA;AAAA,QACE,KAAK,SAAA,CAAU,IAAA,CAAK,SAAS,IAAA,CAAK,QAAA,EAAU,KAAK,SAAS,CAAA;AAAA,QAC1D;AAAA;AACF,KACF;AAAA,EACF,CAAA;AAAA,EAEA,eAAe,IAAA,EAAuB;AACpC,IAAA,IAAI,CAAC,YAAA,CAAa,IAAI,CAAA,EAAG,OAAO,MAAA;AAChC,IAAA,MAAM,SAAA,GAAY,gBAAgB,IAAI,CAAA;AACtC,IAAA,OAAO,IAAI,GAAA,CAAI,CAAA,qBAAA,EAAwB,eAAA,CAAgB,SAAS,CAAC,CAAA,CAAE,CAAA;AAAA,EACrE,CAAA;AAAA,EAEA,iBAAiB,IAAA,EAAyB;AACxC,IAAA,MAAM,KAAA,GAAQ,eAAA;AAAA,MACZ,KAAK,SAAA,CAAU,IAAA,CAAK,SAAS,IAAA,CAAK,QAAA,EAAU,KAAK,SAAS;AAAA,KAC5D;AACA,IAAA,MAAM,aAAuB,EAAC;AAG9B,IAAA,IAAI,YAAA,CAAa,IAAI,CAAA,EAAG;AACtB,MAAA,UAAA,CAAW,IAAA;AAAA,QACT,CAAA,qBAAA,EAAwB,eAAA,CAAgB,eAAA,CAAgB,IAAI,CAAC,CAAC,CAAA;AAAA,OAChE;AAAA,IACF;AACA,IAAA,UAAA,CAAW,IAAA,CAAK,CAAA,qBAAA,EAAwB,KAAK,CAAA,CAAE,CAAA;AAC/C,IAAA,OAAO,UAAA;AAAA,EACT;AACF;AAEA,SAAS,gBAAgB,IAAA,EAA0B;AACjD,EAAA,OAAO,kBAAA;AAAA,IACL,YAAA;AAAA,IACA,IAAA,CAAK,OAAA;AAAA,IACL,IAAA,CAAK,QAAA;AAAA,IACL,IAAA,CAAK;AAAA,GACP;AACF;AAEA,SAAS,oBAAA,CAAqB,OAAe,IAAA,EAA0B;AACrE,EAAA,MAAM,SAAA,GAAY,eAAA,CAAgB,eAAA,CAAgB,IAAI,CAAC,CAAA;AACvD,EAAA,MAAM,MAAA,GAAS,iBAAA,CAAkB,IAAA,CAAK,MAAM,CAAA;AAC5C,EAAA,OAAO,8BAA8B,SAAS,CAAA,IAAA,EAAO,gBAAgB,KAAK,CAAC,2CAA2C,MAAM,CAAA,IAAA,CAAA;AAC9H","file":"chunk-CUZGBWFT.js","sourcesContent":["/**\n * libSQL native vector strategy.\n *\n * libSQL ships vector search in core — no extension to load — so this\n * strategy is wired unconditionally by `createLibsqlBackend`. It backs each\n * `(nodeKind, fieldPath)` with its own `F32_BLOB(N)` table (the spike proved\n * the dimension MUST live in the column type for `libsql_vector_idx` to\n * build), brute-forces with `vector_distance_cos` / `vector_distance_l2`, and\n * accelerates with DiskANN (`libsql_vector_idx` + `vector_top_k`) when the\n * slot declares an approximate index.\n *\n * Metric support is `cosine` + `l2` (no `inner_product`), matching sqlite-vec\n * and advertised as data on `capabilities`. The generic `\"hnsw\"` index intent\n * (the portable \"give me an ANN index\" signal that `embedding()` defaults to)\n * is realized here as libSQL's DiskANN index; `\"ivfflat\"` is not supported and\n * a slot declaring it is materialized brute-force-only.\n *\n * The `pgvectorStrategy` and `sqliteVecStrategy` siblings follow the same\n * `VectorStrategy` contract for their engines.\n */\nimport { type SQL, sql } from \"drizzle-orm\";\n\nimport { quotedTableName } from \"../../../backend/drizzle/operations/shared\";\nimport { type StrategyTableContribution } from \"../../../backend/table-contribution\";\nimport {\n  type DeleteEmbeddingParams,\n  type UpsertEmbeddingParams,\n  type VectorCapabilities,\n  type VectorMetric,\n  type VectorSearchParams,\n} from \"../../../backend/types\";\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\";\n\n/** Physical-name prefixes for the per-field table and its DiskANN index. */\nconst TABLE_PREFIX = \"tg_vec\";\nconst INDEX_PREFIX = \"tg_vecidx\";\n\n/**\n * libSQL `F32_BLOB` caps at 65,536 dimensions (per Turso docs / spike §2).\n */\nconst LIBSQL_MAX_DIMENSIONS = 65_536;\n\nconst LIBSQL_CAPABILITIES: VectorCapabilities = {\n  supported: true,\n  metrics: [\"cosine\", \"l2\"],\n  // \"hnsw\" = portable ANN intent, realized as DiskANN. \"none\" = brute-force.\n  indexTypes: [\"hnsw\", \"none\"],\n  maxDimensions: LIBSQL_MAX_DIMENSIONS,\n};\n\n/** Whether a slot's declared index type maps to a real libSQL ANN index. */\nfunction usesAnnIndex(slot: VectorSlot): boolean {\n  return slot.indexType === \"hnsw\";\n}\n\n/** libSQL metric token accepted by `libsql_vector_idx(col, 'metric=…')`. */\nfunction libsqlMetricToken(metric: VectorMetric): string {\n  switch (metric) {\n    case \"cosine\": {\n      return \"cosine\";\n    }\n    case \"l2\": {\n      return \"l2\";\n    }\n    case \"inner_product\": {\n      throw new Error(\n        \"libSQL vector search does not support inner_product. Use 'cosine' or 'l2'.\",\n      );\n    }\n    default: {\n      const _exhaustive: never = metric;\n      throw new Error(`Unsupported vector metric: ${String(_exhaustive)}`);\n    }\n  }\n}\n\n/**\n * Formats an embedding as the text argument to `vector32(...)`. The value is\n * bound as a parameter (not interpolated) — `vector32` parses it into the\n * F32 blob. Finiteness is validated first so a NaN names its index.\n */\nfunction vector32Literal(embedding: readonly number[], name: string): SQL {\n  assertFiniteEmbedding(embedding, name);\n  return sql`vector32(${`[${embedding.join(\",\")}]`})`;\n}\n\nfunction distanceExpression(\n  embeddingColumn: SQL,\n  queryEmbedding: readonly number[],\n  metric: VectorMetric,\n): SQL {\n  const query = vector32Literal(queryEmbedding, \"queryEmbedding\");\n  switch (metric) {\n    case \"cosine\": {\n      return sql`vector_distance_cos(${embeddingColumn}, ${query})`;\n    }\n    case \"l2\": {\n      return sql`vector_distance_l2(${embeddingColumn}, ${query})`;\n    }\n    case \"inner_product\": {\n      throw new Error(\n        \"libSQL vector search does not support inner_product. Use 'cosine' or 'l2'.\",\n      );\n    }\n    default: {\n      const _exhaustive: never = metric;\n      throw new Error(`Unsupported vector metric: ${String(_exhaustive)}`);\n    }\n  }\n}\n\nexport const libsqlVectorStrategy: VectorStrategy = {\n  name: \"libsql-native\",\n  capabilities: LIBSQL_CAPABILITIES,\n\n  tableName(graphId, nodeKind, fieldPath) {\n    return vectorPhysicalName(TABLE_PREFIX, graphId, nodeKind, fieldPath);\n  },\n\n  ownedTables(slot): readonly StrategyTableContribution[] {\n    const table = this.tableName(slot.graphId, slot.nodeKind, slot.fieldPath);\n    const name = quoteIdentifier(table);\n\n    // No standalone graph_id index: the PRIMARY KEY (graph_id, node_id) already\n    // covers `WHERE graph_id = ?` via its leading column, so a separate index\n    // would be pure write amplification.\n    const createDdl = [\n      `CREATE TABLE IF NOT EXISTS ${name} (\n  \"graph_id\" TEXT NOT NULL,\n  \"node_id\" TEXT NOT NULL,\n  \"embedding\" F32_BLOB(${slot.dimensions}) NOT NULL,\n  \"created_at\" TEXT NOT NULL,\n  \"updated_at\" TEXT NOT NULL,\n  PRIMARY KEY (\"graph_id\", \"node_id\")\n);`,\n    ];\n\n    if (usesAnnIndex(slot)) {\n      // The DiskANN index DDL is deterministic raw SQL; fold it into the\n      // contribution so materialization creates table + index together.\n      createDdl.push(libsqlVectorIndexDdl(table, slot));\n    }\n\n    return [\n      {\n        logicalName: `${VECTOR_CONTRIBUTION_PREFIX}:${slot.nodeKind}.${slot.fieldPath}`,\n        owner: \"libsql-native\",\n        tableName: table,\n        createDdl,\n        runtimeEnsure: true,\n      },\n    ];\n  },\n\n  buildUpsert(slot, params: UpsertEmbeddingParams, timestamp): readonly SQL[] {\n    const table = quotedTableName(\n      this.tableName(slot.graphId, slot.nodeKind, slot.fieldPath),\n    );\n    const value = vector32Literal(params.embedding, \"embedding\");\n    return [\n      sql`\n        INSERT INTO ${table} (\"graph_id\", \"node_id\", \"embedding\", \"created_at\", \"updated_at\")\n        VALUES (${params.graphId}, ${params.nodeId}, ${value}, ${timestamp}, ${timestamp})\n        ON CONFLICT (\"graph_id\", \"node_id\")\n        DO UPDATE SET \"embedding\" = ${value}, \"updated_at\" = ${timestamp}\n      `,\n    ];\n  },\n\n  buildDelete(slot, params: DeleteEmbeddingParams): readonly SQL[] {\n    const table = quotedTableName(\n      this.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  buildSearch(slot, params: VectorSearchParams): SQL {\n    const table = this.tableName(slot.graphId, slot.nodeKind, slot.fieldPath);\n    const quoted = quotedTableName(table);\n    const embeddingColumn = sql`${quoted}.\"embedding\"`;\n    const distance = distanceExpression(\n      embeddingColumn,\n      params.queryEmbedding,\n      params.metric,\n    );\n    const score = vectorScoreExpression(distance, params.metric);\n\n    if (usesAnnIndex(slot)) {\n      // DiskANN: vector_top_k returns rowids from the per-field table; join\n      // back, then scope by graph and compute the real distance/score.\n      // `vector_top_k` is table-global, so single-graph deployments are exact;\n      // multi-graph recall is bounded by the over-fetched k (documented).\n      const indexName = libsqlIndexName(slot);\n      const query = vector32Literal(params.queryEmbedding, \"queryEmbedding\");\n      const conditions: SQL[] = [sql`${quoted}.\"graph_id\" = ${params.graphId}`];\n      if (params.minScore !== undefined) {\n        conditions.push(\n          vectorMinScoreCondition(distance, params.metric, params.minScore),\n        );\n      }\n      return sql`\n        SELECT ${quoted}.\"node_id\" AS node_id, ${score} AS score\n        FROM vector_top_k(${indexName}, ${query}, ${params.limit})\n        JOIN ${quoted} ON ${quoted}.rowid = id\n        WHERE ${sql.join(conditions, sql` AND `)}\n        ORDER BY ${distance} ASC\n        LIMIT ${params.limit}\n      `;\n    }\n\n    // Brute-force scan.\n    const conditions: SQL[] = [sql`${quoted}.\"graph_id\" = ${params.graphId}`];\n    if (params.minScore !== undefined) {\n      conditions.push(\n        vectorMinScoreCondition(distance, params.metric, params.minScore),\n      );\n    }\n    return sql`\n      SELECT ${quoted}.\"node_id\" AS node_id, ${score} AS score\n      FROM ${quoted}\n      WHERE ${sql.join(conditions, sql` AND `)}\n      ORDER BY ${distance} ASC\n      LIMIT ${params.limit}\n    `;\n  },\n\n  distanceExpression(embeddingColumn, queryEmbedding, metric) {\n    return distanceExpression(embeddingColumn, queryEmbedding, metric);\n  },\n\n  buildCreateIndex(slot): SQL | undefined {\n    if (!usesAnnIndex(slot)) return undefined;\n    return sql.raw(\n      libsqlVectorIndexDdl(\n        this.tableName(slot.graphId, slot.nodeKind, slot.fieldPath),\n        slot,\n      ),\n    );\n  },\n\n  buildDropIndex(slot): SQL | undefined {\n    if (!usesAnnIndex(slot)) return undefined;\n    const indexName = libsqlIndexName(slot);\n    return sql.raw(`DROP INDEX IF EXISTS ${quoteIdentifier(indexName)}`);\n  },\n\n  buildDropStorage(slot): readonly string[] {\n    const table = quoteIdentifier(\n      this.tableName(slot.graphId, slot.nodeKind, slot.fieldPath),\n    );\n    const statements: string[] = [];\n    // Drop the DiskANN index first so libSQL reclaims its shadow tables,\n    // then the table itself.\n    if (usesAnnIndex(slot)) {\n      statements.push(\n        `DROP INDEX IF EXISTS ${quoteIdentifier(libsqlIndexName(slot))}`,\n      );\n    }\n    statements.push(`DROP TABLE IF EXISTS ${table}`);\n    return statements;\n  },\n};\n\nfunction libsqlIndexName(slot: VectorSlot): string {\n  return vectorPhysicalName(\n    INDEX_PREFIX,\n    slot.graphId,\n    slot.nodeKind,\n    slot.fieldPath,\n  );\n}\n\nfunction libsqlVectorIndexDdl(table: string, slot: VectorSlot): string {\n  const indexName = quoteIdentifier(libsqlIndexName(slot));\n  const metric = libsqlMetricToken(slot.metric);\n  return `CREATE INDEX IF NOT EXISTS ${indexName} ON ${quoteIdentifier(table)}(libsql_vector_idx(\"embedding\", 'metric=${metric}'));`;\n}\n"]}

package/dist/chunk-F2Q76CQ4.cjs

@@ -0,0 +1,266 @@
+'use strict';
+
+var chunkC2RWFIYP_cjs = require('./chunk-C2RWFIYP.cjs');
+var drizzleOrm = require('drizzle-orm');
+var sqliteCore = require('drizzle-orm/sqlite-core');
+
+var LEGACY_EMBEDDINGS_TABLE_NAME = "typegraph_node_embeddings";
+var DEFAULT_TABLE_NAMES = {
+  nodes: "typegraph_nodes",
+  edges: "typegraph_edges",
+  uniques: "typegraph_node_uniques",
+  schemaVersions: "typegraph_schema_versions",
+  fulltext: "typegraph_node_fulltext",
+  indexMaterializations: "typegraph_index_materializations",
+  contributionMaterializations: "typegraph_contribution_materializations",
+  kindRemovals: "typegraph_kind_removals",
+  reconciliationMarkers: "typegraph_reconciliation_markers"
+};
+function createSqliteTables(names = {}, options = {}) {
+  const n = { ...DEFAULT_TABLE_NAMES, ...names };
+  const indexes = options.indexes ?? [];
+  const nodes2 = sqliteCore.sqliteTable(
+    n.nodes,
+    {
+      graphId: sqliteCore.text("graph_id").notNull(),
+      kind: sqliteCore.text("kind").notNull(),
+      id: sqliteCore.text("id").notNull(),
+      props: sqliteCore.text("props").notNull(),
+      version: sqliteCore.integer("version").notNull().default(1),
+      validFrom: sqliteCore.text("valid_from"),
+      validTo: sqliteCore.text("valid_to"),
+      createdAt: sqliteCore.text("created_at").notNull(),
+      updatedAt: sqliteCore.text("updated_at").notNull(),
+      deletedAt: sqliteCore.text("deleted_at")
+    },
+    (t) => [
+      sqliteCore.primaryKey({ columns: [t.graphId, t.kind, t.id] }),
+      sqliteCore.index(`${n.nodes}_kind_idx`).on(t.graphId, t.kind),
+      sqliteCore.index(`${n.nodes}_kind_created_idx`).on(
+        t.graphId,
+        t.kind,
+        t.deletedAt,
+        t.createdAt
+      ),
+      sqliteCore.index(`${n.nodes}_deleted_idx`).on(t.graphId, t.deletedAt),
+      sqliteCore.index(`${n.nodes}_valid_idx`).on(t.graphId, t.validFrom, t.validTo),
+      ...chunkC2RWFIYP_cjs.buildSqliteNodeIndexBuilders(t, indexes)
+    ]
+  );
+  const edges2 = sqliteCore.sqliteTable(
+    n.edges,
+    {
+      graphId: sqliteCore.text("graph_id").notNull(),
+      id: sqliteCore.text("id").notNull(),
+      kind: sqliteCore.text("kind").notNull(),
+      fromKind: sqliteCore.text("from_kind").notNull(),
+      fromId: sqliteCore.text("from_id").notNull(),
+      toKind: sqliteCore.text("to_kind").notNull(),
+      toId: sqliteCore.text("to_id").notNull(),
+      props: sqliteCore.text("props").notNull(),
+      validFrom: sqliteCore.text("valid_from"),
+      validTo: sqliteCore.text("valid_to"),
+      createdAt: sqliteCore.text("created_at").notNull(),
+      updatedAt: sqliteCore.text("updated_at").notNull(),
+      deletedAt: sqliteCore.text("deleted_at")
+    },
+    (t) => [
+      sqliteCore.primaryKey({ columns: [t.graphId, t.id] }),
+      sqliteCore.index(`${n.edges}_kind_idx`).on(t.graphId, t.kind),
+      // Directional traversal index (outgoing): supports endpoint lookups
+      // and extra filtering by edge kind / target kind.
+      sqliteCore.index(`${n.edges}_from_idx`).on(
+        t.graphId,
+        t.fromKind,
+        t.fromId,
+        t.kind,
+        t.toKind,
+        t.deletedAt,
+        t.validTo
+      ),
+      // Directional traversal index (incoming): mirrors from_idx for reverse traversals.
+      sqliteCore.index(`${n.edges}_to_idx`).on(
+        t.graphId,
+        t.toKind,
+        t.toId,
+        t.kind,
+        t.fromKind,
+        t.deletedAt,
+        t.validTo
+      ),
+      sqliteCore.index(`${n.edges}_kind_created_idx`).on(
+        t.graphId,
+        t.kind,
+        t.deletedAt,
+        t.createdAt
+      ),
+      sqliteCore.index(`${n.edges}_deleted_idx`).on(t.graphId, t.deletedAt),
+      sqliteCore.index(`${n.edges}_valid_idx`).on(t.graphId, t.validFrom, t.validTo),
+      sqliteCore.index(`${n.edges}_cardinality_idx`).on(
+        t.graphId,
+        t.kind,
+        t.fromKind,
+        t.fromId,
+        t.validTo
+      ),
+      ...chunkC2RWFIYP_cjs.buildSqliteEdgeIndexBuilders(t, indexes)
+    ]
+  );
+  const uniques2 = sqliteCore.sqliteTable(
+    n.uniques,
+    {
+      graphId: sqliteCore.text("graph_id").notNull(),
+      nodeKind: sqliteCore.text("node_kind").notNull(),
+      constraintName: sqliteCore.text("constraint_name").notNull(),
+      key: sqliteCore.text("key").notNull(),
+      nodeId: sqliteCore.text("node_id").notNull(),
+      concreteKind: sqliteCore.text("concrete_kind").notNull(),
+      deletedAt: sqliteCore.text("deleted_at")
+    },
+    (t) => [
+      sqliteCore.primaryKey({
+        columns: [t.graphId, t.nodeKind, t.constraintName, t.key]
+      }),
+      sqliteCore.index(`${n.uniques}_node_idx`).on(t.graphId, t.concreteKind, t.nodeId)
+    ]
+  );
+  const schemaVersions2 = sqliteCore.sqliteTable(
+    n.schemaVersions,
+    {
+      graphId: sqliteCore.text("graph_id").notNull(),
+      version: sqliteCore.integer("version").notNull(),
+      schemaHash: sqliteCore.text("schema_hash").notNull(),
+      schemaDoc: sqliteCore.text("schema_doc").notNull(),
+      createdAt: sqliteCore.text("created_at").notNull(),
+      isActive: sqliteCore.integer("is_active", { mode: "boolean" }).notNull().default(false)
+    },
+    (t) => [
+      sqliteCore.primaryKey({ columns: [t.graphId, t.version] }),
+      sqliteCore.index(`${n.schemaVersions}_active_idx`).on(t.graphId, t.isActive),
+      // Partial unique index enforcing the "at most one active version
+      // per graph" invariant at the storage layer. Defense in depth
+      // against buggy backend implementations or out-of-band writes.
+      // Forces the deactivate-then-activate ordering used by
+      // `commitSchemaVersion` and `setActiveVersion`.
+      sqliteCore.uniqueIndex(`${n.schemaVersions}_one_active_per_graph_idx`).on(t.graphId).where(drizzleOrm.sql`${t.isActive} = 1`)
+    ]
+  );
+  const indexMaterializations = sqliteCore.sqliteTable(
+    n.indexMaterializations,
+    {
+      indexName: sqliteCore.text("index_name").notNull(),
+      graphId: sqliteCore.text("graph_id").notNull(),
+      entity: sqliteCore.text("entity").notNull(),
+      kind: sqliteCore.text("kind").notNull(),
+      signature: sqliteCore.text("signature").notNull(),
+      schemaVersion: sqliteCore.integer("schema_version").notNull(),
+      materializedAt: sqliteCore.text("materialized_at"),
+      lastAttemptedAt: sqliteCore.text("last_attempted_at").notNull(),
+      lastError: sqliteCore.text("last_error")
+    },
+    (t) => [sqliteCore.primaryKey({ columns: [t.indexName] })]
+  );
+  const kindRemovals = sqliteCore.sqliteTable(
+    n.kindRemovals,
+    {
+      graphId: sqliteCore.text("graph_id").notNull(),
+      kindName: sqliteCore.text("kind_name").notNull(),
+      entity: sqliteCore.text("entity").notNull(),
+      schemaVersion: sqliteCore.integer("schema_version").notNull(),
+      removedAt: sqliteCore.text("removed_at"),
+      lastAttemptedAt: sqliteCore.text("last_attempted_at").notNull(),
+      lastError: sqliteCore.text("last_error")
+    },
+    (t) => [
+      sqliteCore.primaryKey({
+        columns: [t.graphId, t.kindName, t.entity, t.schemaVersion]
+      })
+    ]
+  );
+  const reconciliationMarkers = sqliteCore.sqliteTable(
+    n.reconciliationMarkers,
+    {
+      graphId: sqliteCore.text("graph_id").notNull(),
+      reconciledToVersion: sqliteCore.integer("reconciled_to_version").notNull()
+    },
+    (t) => [sqliteCore.primaryKey({ columns: [t.graphId] })]
+  );
+  const contributionMaterializations = sqliteCore.sqliteTable(
+    n.contributionMaterializations,
+    {
+      graphId: sqliteCore.text("graph_id").notNull(),
+      logicalName: sqliteCore.text("logical_name").notNull(),
+      owner: sqliteCore.text("owner").notNull(),
+      tableName: sqliteCore.text("table_name").notNull(),
+      signature: sqliteCore.text("signature").notNull(),
+      materializedAt: sqliteCore.text("materialized_at"),
+      lastAttemptedAt: sqliteCore.text("last_attempted_at").notNull(),
+      lastError: sqliteCore.text("last_error")
+    },
+    (t) => [
+      sqliteCore.primaryKey({
+        columns: [t.graphId, t.logicalName, t.owner, t.tableName]
+      })
+    ]
+  );
+  return {
+    nodes: nodes2,
+    edges: edges2,
+    uniques: uniques2,
+    schemaVersions: schemaVersions2,
+    indexMaterializations,
+    contributionMaterializations,
+    kindRemovals,
+    reconciliationMarkers,
+    /**
+     * The fulltext storage is a FTS5 virtual table which Drizzle cannot
+     * represent. DDL is emitted as raw SQL and operations query it via
+     * `sql.raw()`.
+     */
+    fulltextTableName: n.fulltext
+  };
+}
+var tables = createSqliteTables();
+var { nodes, edges, uniques, schemaVersions } = tables;
+
+// src/backend/types.ts
+function wrapWithManagedClose(backend, teardown) {
+  let isClosed = false;
+  return {
+    ...backend,
+    async close() {
+      if (isClosed) return;
+      isClosed = true;
+      await backend.close();
+      await teardown();
+    }
+  };
+}
+async function runOptionallyInTransaction(backend, fn, fallback) {
+  if (!backend.capabilities.transactions) {
+    return fn(fallback ?? backend);
+  }
+  return backend.transaction((tx) => fn(tx));
+}
+var SQLITE_CAPABILITIES = {
+  transactions: true
+  // SQLite supports transactions
+};
+var POSTGRES_CAPABILITIES = {
+  transactions: true
+  // PostgreSQL supports transactions
+};
+
+exports.LEGACY_EMBEDDINGS_TABLE_NAME = LEGACY_EMBEDDINGS_TABLE_NAME;
+exports.POSTGRES_CAPABILITIES = POSTGRES_CAPABILITIES;
+exports.SQLITE_CAPABILITIES = SQLITE_CAPABILITIES;
+exports.createSqliteTables = createSqliteTables;
+exports.edges = edges;
+exports.nodes = nodes;
+exports.runOptionallyInTransaction = runOptionallyInTransaction;
+exports.schemaVersions = schemaVersions;
+exports.tables = tables;
+exports.uniques = uniques;
+exports.wrapWithManagedClose = wrapWithManagedClose;
+//# sourceMappingURL=chunk-F2Q76CQ4.cjs.map
+//# sourceMappingURL=chunk-F2Q76CQ4.cjs.map