@nhtio/adk 1.20260604.0 → 1.20260607.0

package/batteries/vector/in_memory.mjs

@@ -0,0 +1,176 @@
+import { evaluateFilter } from "./filters.mjs";
+import { normalizeScore } from "./helpers.mjs";
+import { E_VECTOR_STORE_DIMENSION_MISMATCH } from "./exceptions.mjs";
+import { BaseVectorStore } from "./contract.mjs";
+import { validateRecords } from "./validation.mjs";
+//#region src/batteries/vector/in_memory/index.ts
+/**
+* @module @nhtio/adk/batteries/vector/in_memory
+*/
+var InMemoryVectorStore = class extends BaseVectorStore {
+	capabilities = {
+		transactions: false,
+		namedVectors: false,
+		rename: true,
+		rawSql: false,
+		builtInEncoding: false,
+		consistency: {
+			configurable: false,
+			default: "strong",
+			modes: ["strong"]
+		}
+	};
+	#collections = /* @__PURE__ */ new Map();
+	#dims = /* @__PURE__ */ new Map();
+	static isAvailable() {
+		return true;
+	}
+	isAvailable() {
+		return true;
+	}
+	async connect() {}
+	async close() {}
+	async createCollection(spec, ifNotExists) {
+		if (this.#collections.has(spec.collection)) {
+			if (!ifNotExists) throw new Error(`Collection "${spec.collection}" already exists`);
+			return;
+		}
+		this.#collections.set(spec.collection, /* @__PURE__ */ new Map());
+		this.#dims.set(spec.collection, spec.vector.dimensions);
+	}
+	async dropCollection(collection, ifExists) {
+		if (!this.#collections.has(collection)) {
+			if (!ifExists) throw new Error(`Collection "${collection}" does not exist`);
+			return;
+		}
+		this.#collections.delete(collection);
+		this.#dims.delete(collection);
+	}
+	async hasCollection(collection) {
+		return this.#collections.has(collection);
+	}
+	async renameCollection(from, to) {
+		const m = this.#collections.get(from);
+		if (!m) throw new Error(`Collection "${from}" does not exist`);
+		if (this.#collections.has(to)) throw new Error(`Collection "${to}" already exists`);
+		this.#collections.set(to, m);
+		this.#collections.delete(from);
+		const d = this.#dims.get(from);
+		if (d !== void 0) {
+			this.#dims.set(to, d);
+			this.#dims.delete(from);
+		}
+	}
+	#coll(collection) {
+		let m = this.#collections.get(collection);
+		if (!m) {
+			m = /* @__PURE__ */ new Map();
+			this.#collections.set(collection, m);
+		}
+		return m;
+	}
+	async executeUpsert(plan) {
+		if (plan.records.length === 0) return;
+		validateRecords(plan.records);
+		const expected = this.#dims.get(plan.collection);
+		const m = this.#coll(plan.collection);
+		for (const r of plan.records) {
+			let vector = r.vector;
+			if (!vector && r.document) {
+				const [v] = await this.encode([r.document], "document");
+				vector = v;
+			}
+			if (vector && expected !== void 0 && vector.length !== expected) throw new E_VECTOR_STORE_DIMENSION_MISMATCH([expected, vector.length]);
+			m.set(r.id, {
+				id: r.id,
+				vector,
+				document: r.document,
+				metadata: r.metadata
+			});
+		}
+	}
+	async executeDelete(plan) {
+		const m = this.#coll(plan.collection);
+		if (plan.ids) {
+			for (const id of plan.ids) m.delete(id);
+			return;
+		}
+		if (plan.filter) {
+			for (const [id, row] of [...m]) if (evaluateFilter(plan.filter, row.metadata ?? {})) m.delete(id);
+			return;
+		}
+		m.clear();
+	}
+	async executeSearch(plan) {
+		const m = this.#coll(plan.collection);
+		let rows = [...m.values()];
+		if (plan.filter) rows = rows.filter((row) => evaluateFilter(plan.filter, row.metadata ?? {}));
+		let scored;
+		if (plan.near && "vector" in plan.near) {
+			scored = rows.map((row) => ({
+				row,
+				score: this.#cosineLikeScore(plan.near, row, plan)
+			}));
+			scored.sort((a, b) => (b.score ?? 0) - (a.score ?? 0));
+		} else if (plan.near && "serverText" in plan.near) {
+			const [qv] = await this.encode([plan.near.serverText], "query");
+			scored = rows.map((row) => ({
+				row,
+				score: this.#scoreVec(qv, row.vector, plan)
+			}));
+			scored.sort((a, b) => (b.score ?? 0) - (a.score ?? 0));
+		} else if (plan.near && "id" in plan.near) {
+			const qv = m.get(plan.near.id)?.vector;
+			scored = rows.map((row) => ({
+				row,
+				score: qv ? this.#scoreVec(qv, row.vector, plan) : void 0
+			}));
+			scored.sort((a, b) => (b.score ?? 0) - (a.score ?? 0));
+		} else scored = rows.map((row) => ({ row }));
+		return scored.slice(plan.offset ?? 0, (plan.offset ?? 0) + plan.topK).map(({ row, score }) => this.#project(row, score, plan.projection));
+	}
+	#scoreVec(q, v, _plan) {
+		if (!v) return void 0;
+		const metric = this.options.metric ?? "cosine";
+		let raw;
+		if (metric === "cosine") {
+			const dot = this.#dot(q, v);
+			const na = Math.sqrt(this.#dot(q, q));
+			const nb = Math.sqrt(this.#dot(v, v));
+			raw = na && nb ? dot / (na * nb) : 0;
+			return normalizeScore(raw, "cosine", "similarity");
+		}
+		if (metric === "dot") {
+			raw = this.#dot(q, v);
+			return normalizeScore(raw, "dot", "similarity");
+		}
+		let s = 0;
+		for (let i = 0; i < Math.min(q.length, v.length); i++) {
+			const d = q[i] - v[i];
+			s += d * d;
+		}
+		raw = Math.sqrt(s);
+		return normalizeScore(raw, "euclidean", "distance");
+	}
+	#cosineLikeScore(near, row, plan) {
+		return this.#scoreVec(near.vector, row.vector, plan);
+	}
+	#dot(a, b) {
+		let s = 0;
+		for (let i = 0; i < Math.min(a.length, b.length); i++) s += a[i] * b[i];
+		return s;
+	}
+	#project(row, score, p) {
+		const out = {};
+		if (p.id) out.id = row.id;
+		if (score !== void 0) out.score = score;
+		if (p.vector && row.vector) out.vector = row.vector;
+		if (p.document && row.document !== void 0) out.document = row.document;
+		if (p.metadata && row.metadata !== void 0) out.metadata = row.metadata;
+		return out;
+	}
+};
+//#endregion
+export { InMemoryVectorStore };
+
+//# sourceMappingURL=in_memory.mjs.map

package/batteries/vector/in_memory.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"in_memory.mjs","names":["#collections","#dims","#coll","#cosineLikeScore","#scoreVec","#project","#dot"],"sources":["../../../src/batteries/vector/in_memory/index.ts"],"sourcesContent":["/**\n * @module @nhtio/adk/batteries/vector/in_memory\n */\n\nimport { evaluateFilter } from '../filters'\nimport { normalizeScore } from '../helpers'\nimport { BaseVectorStore } from '../contract'\nimport { validateRecords } from '../validation'\nimport { E_VECTOR_STORE_DIMENSION_MISMATCH } from '../exceptions'\nimport type { VectorMatch, VectorStoreCapabilities, BaseVectorStoreOptions } from '../types'\nimport type { SearchPlan, UpsertPlan, DeletePlan, CollectionSpec, Projection } from '../plan'\n\nexport interface InMemoryVectorStoreOptions extends BaseVectorStoreOptions {}\n\ninterface StoredRow {\n  id: string\n  vector?: number[]\n  document?: string\n  metadata?: Record<string, unknown>\n}\n\nexport class InMemoryVectorStore extends BaseVectorStore {\n  readonly capabilities: VectorStoreCapabilities = {\n    transactions: false,\n    namedVectors: false,\n    rename: true,\n    rawSql: false,\n    builtInEncoding: false,\n    // Strongly consistent: a write is visible on resolve, so the option is a no-op.\n    consistency: { configurable: false, default: 'strong', modes: ['strong'] },\n  }\n  #collections = new Map<string, Map<string, StoredRow>>()\n  #dims = new Map<string, number>()\n\n  static isAvailable(): boolean {\n    return true\n  }\n  isAvailable(): boolean {\n    return true\n  }\n  async connect(): Promise<void> {\n    /* no-op */\n  }\n  async close(): Promise<void> {\n    /* no-op */\n  }\n\n  async createCollection(spec: CollectionSpec, ifNotExists: boolean): Promise<void> {\n    if (this.#collections.has(spec.collection)) {\n      if (!ifNotExists) {\n        throw new Error(`Collection \"${spec.collection}\" already exists`)\n      }\n      return\n    }\n    this.#collections.set(spec.collection, new Map())\n    this.#dims.set(spec.collection, spec.vector.dimensions)\n  }\n\n  async dropCollection(collection: string, ifExists: boolean): Promise<void> {\n    if (!this.#collections.has(collection)) {\n      if (!ifExists) {\n        throw new Error(`Collection \"${collection}\" does not exist`)\n      }\n      return\n    }\n    this.#collections.delete(collection)\n    this.#dims.delete(collection)\n  }\n\n  async hasCollection(collection: string): Promise<boolean> {\n    return this.#collections.has(collection)\n  }\n\n  async renameCollection(from: string, to: string): Promise<void> {\n    const m = this.#collections.get(from)\n    if (!m) {\n      throw new Error(`Collection \"${from}\" does not exist`)\n    }\n    if (this.#collections.has(to)) {\n      throw new Error(`Collection \"${to}\" already exists`)\n    }\n    this.#collections.set(to, m)\n    this.#collections.delete(from)\n    const d = this.#dims.get(from)\n    if (d !== undefined) {\n      this.#dims.set(to, d)\n      this.#dims.delete(from)\n    }\n  }\n\n  #coll(collection: string): Map<string, StoredRow> {\n    let m = this.#collections.get(collection)\n    if (!m) {\n      m = new Map()\n      this.#collections.set(collection, m)\n    }\n    return m\n  }\n\n  async executeUpsert(plan: UpsertPlan): Promise<void> {\n    if (plan.records.length === 0) return\n    validateRecords(plan.records)\n    const expected = this.#dims.get(plan.collection)\n    const m = this.#coll(plan.collection)\n    for (const r of plan.records) {\n      let vector = r.vector\n      if (!vector && r.document) {\n        const [v] = await this.encode([r.document], 'document')\n        vector = v\n      }\n      if (vector && expected !== undefined && vector.length !== expected) {\n        throw new E_VECTOR_STORE_DIMENSION_MISMATCH([expected, vector.length])\n      }\n      m.set(r.id, {\n        id: r.id,\n        vector,\n        document: r.document,\n        metadata: r.metadata as Record<string, unknown> | undefined,\n      })\n    }\n  }\n\n  async executeDelete(plan: DeletePlan): Promise<void> {\n    const m = this.#coll(plan.collection)\n    if (plan.ids) {\n      for (const id of plan.ids) m.delete(id)\n      return\n    }\n    if (plan.filter) {\n      for (const [id, row] of [...m]) {\n        if (evaluateFilter(plan.filter, (row.metadata ?? {}) as any)) m.delete(id)\n      }\n      return\n    }\n    m.clear()\n  }\n\n  async executeSearch(plan: SearchPlan): Promise<VectorMatch[]> {\n    const m = this.#coll(plan.collection)\n    let rows = [...m.values()]\n    if (plan.filter)\n      rows = rows.filter((row) => evaluateFilter(plan.filter!, (row.metadata ?? {}) as any))\n    let scored: { row: StoredRow; score?: number }[]\n    if (plan.near && 'vector' in plan.near) {\n      scored = rows.map((row) => ({\n        row,\n        score: this.#cosineLikeScore(plan.near as { vector: number[] }, row, plan),\n      }))\n      scored.sort((a, b) => (b.score ?? 0) - (a.score ?? 0))\n    } else if (plan.near && 'serverText' in plan.near) {\n      const [qv] = await this.encode([plan.near.serverText], 'query')\n      scored = rows.map((row) => ({ row, score: this.#scoreVec(qv, row.vector, plan) }))\n      scored.sort((a, b) => (b.score ?? 0) - (a.score ?? 0))\n    } else if (plan.near && 'id' in plan.near) {\n      const ref = m.get(plan.near.id)\n      const qv = ref?.vector\n      scored = rows.map((row) => ({\n        row,\n        score: qv ? this.#scoreVec(qv, row.vector, plan) : undefined,\n      }))\n      scored.sort((a, b) => (b.score ?? 0) - (a.score ?? 0))\n    } else {\n      scored = rows.map((row) => ({ row }))\n    }\n    const limited = scored.slice(plan.offset ?? 0, (plan.offset ?? 0) + plan.topK)\n    return limited.map(({ row, score }) => this.#project(row, score, plan.projection))\n  }\n\n  #scoreVec(q: number[], v: number[] | undefined, _plan: SearchPlan): number | undefined {\n    if (!v) return undefined\n    const metric = this.options.metric ?? 'cosine'\n    let raw: number\n    if (metric === 'cosine') {\n      const dot = this.#dot(q, v)\n      const na = Math.sqrt(this.#dot(q, q))\n      const nb = Math.sqrt(this.#dot(v, v))\n      raw = na && nb ? dot / (na * nb) : 0\n      return normalizeScore(raw, 'cosine', 'similarity')\n    }\n    if (metric === 'dot') {\n      raw = this.#dot(q, v)\n      return normalizeScore(raw, 'dot', 'similarity')\n    }\n    let s = 0\n    for (let i = 0; i < Math.min(q.length, v.length); i++) {\n      const d = q[i] - v[i]\n      s += d * d\n    }\n    raw = Math.sqrt(s)\n    return normalizeScore(raw, 'euclidean', 'distance')\n  }\n\n  #cosineLikeScore(\n    near: { vector: number[] },\n    row: StoredRow,\n    plan: SearchPlan\n  ): number | undefined {\n    return this.#scoreVec(near.vector, row.vector, plan)\n  }\n\n  #dot(a: number[], b: number[]): number {\n    let s = 0\n    for (let i = 0; i < Math.min(a.length, b.length); i++) s += a[i] * b[i]\n    return s\n  }\n\n  #project(row: StoredRow, score: number | undefined, p: Projection): VectorMatch {\n    const out: VectorMatch = {}\n    if (p.id) out.id = row.id\n    if (score !== undefined) out.score = score\n    if (p.vector && row.vector) out.vector = row.vector\n    if (p.document && row.document !== undefined) out.document = row.document\n    if (p.metadata && row.metadata !== undefined) out.metadata = row.metadata as any\n    return out\n  }\n}\n"],"mappings":";;;;;;;;;AAqBA,IAAa,sBAAb,cAAyC,gBAAgB;CACvD,eAAiD;EAC/C,cAAc;EACd,cAAc;EACd,QAAQ;EACR,QAAQ;EACR,iBAAiB;EAEjB,aAAa;GAAE,cAAc;GAAO,SAAS;GAAU,OAAO,CAAC,QAAQ;EAAE;CAC3E;CACA,+BAAe,IAAI,IAAoC;CACvD,wBAAQ,IAAI,IAAoB;CAEhC,OAAO,cAAuB;EAC5B,OAAO;CACT;CACA,cAAuB;EACrB,OAAO;CACT;CACA,MAAM,UAAyB,CAE/B;CACA,MAAM,QAAuB,CAE7B;CAEA,MAAM,iBAAiB,MAAsB,aAAqC;EAChF,IAAI,KAAKA,aAAa,IAAI,KAAK,UAAU,GAAG;GAC1C,IAAI,CAAC,aACH,MAAM,IAAI,MAAM,eAAe,KAAK,WAAW,iBAAiB;GAElE;EACF;EACA,KAAKA,aAAa,IAAI,KAAK,4BAAY,IAAI,IAAI,CAAC;EAChD,KAAKC,MAAM,IAAI,KAAK,YAAY,KAAK,OAAO,UAAU;CACxD;CAEA,MAAM,eAAe,YAAoB,UAAkC;EACzE,IAAI,CAAC,KAAKD,aAAa,IAAI,UAAU,GAAG;GACtC,IAAI,CAAC,UACH,MAAM,IAAI,MAAM,eAAe,WAAW,iBAAiB;GAE7D;EACF;EACA,KAAKA,aAAa,OAAO,UAAU;EACnC,KAAKC,MAAM,OAAO,UAAU;CAC9B;CAEA,MAAM,cAAc,YAAsC;EACxD,OAAO,KAAKD,aAAa,IAAI,UAAU;CACzC;CAEA,MAAM,iBAAiB,MAAc,IAA2B;EAC9D,MAAM,IAAI,KAAKA,aAAa,IAAI,IAAI;EACpC,IAAI,CAAC,GACH,MAAM,IAAI,MAAM,eAAe,KAAK,iBAAiB;EAEvD,IAAI,KAAKA,aAAa,IAAI,EAAE,GAC1B,MAAM,IAAI,MAAM,eAAe,GAAG,iBAAiB;EAErD,KAAKA,aAAa,IAAI,IAAI,CAAC;EAC3B,KAAKA,aAAa,OAAO,IAAI;EAC7B,MAAM,IAAI,KAAKC,MAAM,IAAI,IAAI;EAC7B,IAAI,MAAM,KAAA,GAAW;GACnB,KAAKA,MAAM,IAAI,IAAI,CAAC;GACpB,KAAKA,MAAM,OAAO,IAAI;EACxB;CACF;CAEA,MAAM,YAA4C;EAChD,IAAI,IAAI,KAAKD,aAAa,IAAI,UAAU;EACxC,IAAI,CAAC,GAAG;GACN,oBAAI,IAAI,IAAI;GACZ,KAAKA,aAAa,IAAI,YAAY,CAAC;EACrC;EACA,OAAO;CACT;CAEA,MAAM,cAAc,MAAiC;EACnD,IAAI,KAAK,QAAQ,WAAW,GAAG;EAC/B,gBAAgB,KAAK,OAAO;EAC5B,MAAM,WAAW,KAAKC,MAAM,IAAI,KAAK,UAAU;EAC/C,MAAM,IAAI,KAAKC,MAAM,KAAK,UAAU;EACpC,KAAK,MAAM,KAAK,KAAK,SAAS;GAC5B,IAAI,SAAS,EAAE;GACf,IAAI,CAAC,UAAU,EAAE,UAAU;IACzB,MAAM,CAAC,KAAK,MAAM,KAAK,OAAO,CAAC,EAAE,QAAQ,GAAG,UAAU;IACtD,SAAS;GACX;GACA,IAAI,UAAU,aAAa,KAAA,KAAa,OAAO,WAAW,UACxD,MAAM,IAAI,kCAAkC,CAAC,UAAU,OAAO,MAAM,CAAC;GAEvE,EAAE,IAAI,EAAE,IAAI;IACV,IAAI,EAAE;IACN;IACA,UAAU,EAAE;IACZ,UAAU,EAAE;GACd,CAAC;EACH;CACF;CAEA,MAAM,cAAc,MAAiC;EACnD,MAAM,IAAI,KAAKA,MAAM,KAAK,UAAU;EACpC,IAAI,KAAK,KAAK;GACZ,KAAK,MAAM,MAAM,KAAK,KAAK,EAAE,OAAO,EAAE;GACtC;EACF;EACA,IAAI,KAAK,QAAQ;GACf,KAAK,MAAM,CAAC,IAAI,QAAQ,CAAC,GAAG,CAAC,GAC3B,IAAI,eAAe,KAAK,QAAS,IAAI,YAAY,CAAC,CAAS,GAAG,EAAE,OAAO,EAAE;GAE3E;EACF;EACA,EAAE,MAAM;CACV;CAEA,MAAM,cAAc,MAA0C;EAC5D,MAAM,IAAI,KAAKA,MAAM,KAAK,UAAU;EACpC,IAAI,OAAO,CAAC,GAAG,EAAE,OAAO,CAAC;EACzB,IAAI,KAAK,QACP,OAAO,KAAK,QAAQ,QAAQ,eAAe,KAAK,QAAU,IAAI,YAAY,CAAC,CAAS,CAAC;EACvF,IAAI;EACJ,IAAI,KAAK,QAAQ,YAAY,KAAK,MAAM;GACtC,SAAS,KAAK,KAAK,SAAS;IAC1B;IACA,OAAO,KAAKC,iBAAiB,KAAK,MAA8B,KAAK,IAAI;GAC3E,EAAE;GACF,OAAO,MAAM,GAAG,OAAO,EAAE,SAAS,MAAM,EAAE,SAAS,EAAE;EACvD,OAAO,IAAI,KAAK,QAAQ,gBAAgB,KAAK,MAAM;GACjD,MAAM,CAAC,MAAM,MAAM,KAAK,OAAO,CAAC,KAAK,KAAK,UAAU,GAAG,OAAO;GAC9D,SAAS,KAAK,KAAK,SAAS;IAAE;IAAK,OAAO,KAAKC,UAAU,IAAI,IAAI,QAAQ,IAAI;GAAE,EAAE;GACjF,OAAO,MAAM,GAAG,OAAO,EAAE,SAAS,MAAM,EAAE,SAAS,EAAE;EACvD,OAAO,IAAI,KAAK,QAAQ,QAAQ,KAAK,MAAM;GAEzC,MAAM,KADM,EAAE,IAAI,KAAK,KAAK,EACjB,GAAK;GAChB,SAAS,KAAK,KAAK,SAAS;IAC1B;IACA,OAAO,KAAK,KAAKA,UAAU,IAAI,IAAI,QAAQ,IAAI,IAAI,KAAA;GACrD,EAAE;GACF,OAAO,MAAM,GAAG,OAAO,EAAE,SAAS,MAAM,EAAE,SAAS,EAAE;EACvD,OACE,SAAS,KAAK,KAAK,SAAS,EAAE,IAAI,EAAE;EAGtC,OADgB,OAAO,MAAM,KAAK,UAAU,IAAI,KAAK,UAAU,KAAK,KAAK,IAClE,EAAQ,KAAK,EAAE,KAAK,YAAY,KAAKC,SAAS,KAAK,OAAO,KAAK,UAAU,CAAC;CACnF;CAEA,UAAU,GAAa,GAAyB,OAAuC;EACrF,IAAI,CAAC,GAAG,OAAO,KAAA;EACf,MAAM,SAAS,KAAK,QAAQ,UAAU;EACtC,IAAI;EACJ,IAAI,WAAW,UAAU;GACvB,MAAM,MAAM,KAAKC,KAAK,GAAG,CAAC;GAC1B,MAAM,KAAK,KAAK,KAAK,KAAKA,KAAK,GAAG,CAAC,CAAC;GACpC,MAAM,KAAK,KAAK,KAAK,KAAKA,KAAK,GAAG,CAAC,CAAC;GACpC,MAAM,MAAM,KAAK,OAAO,KAAK,MAAM;GACnC,OAAO,eAAe,KAAK,UAAU,YAAY;EACnD;EACA,IAAI,WAAW,OAAO;GACpB,MAAM,KAAKA,KAAK,GAAG,CAAC;GACpB,OAAO,eAAe,KAAK,OAAO,YAAY;EAChD;EACA,IAAI,IAAI;EACR,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,IAAI,EAAE,QAAQ,EAAE,MAAM,GAAG,KAAK;GACrD,MAAM,IAAI,EAAE,KAAK,EAAE;GACnB,KAAK,IAAI;EACX;EACA,MAAM,KAAK,KAAK,CAAC;EACjB,OAAO,eAAe,KAAK,aAAa,UAAU;CACpD;CAEA,iBACE,MACA,KACA,MACoB;EACpB,OAAO,KAAKF,UAAU,KAAK,QAAQ,IAAI,QAAQ,IAAI;CACrD;CAEA,KAAK,GAAa,GAAqB;EACrC,IAAI,IAAI;EACR,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,IAAI,EAAE,QAAQ,EAAE,MAAM,GAAG,KAAK,KAAK,EAAE,KAAK,EAAE;EACrE,OAAO;CACT;CAEA,SAAS,KAAgB,OAA2B,GAA4B;EAC9E,MAAM,MAAmB,CAAC;EAC1B,IAAI,EAAE,IAAI,IAAI,KAAK,IAAI;EACvB,IAAI,UAAU,KAAA,GAAW,IAAI,QAAQ;EACrC,IAAI,EAAE,UAAU,IAAI,QAAQ,IAAI,SAAS,IAAI;EAC7C,IAAI,EAAE,YAAY,IAAI,aAAa,KAAA,GAAW,IAAI,WAAW,IAAI;EACjE,IAAI,EAAE,YAAY,IAAI,aAAa,KAAA,GAAW,IAAI,WAAW,IAAI;EACjE,OAAO;CACT;AACF"}

package/batteries/vector/index.d.ts

@@ -0,0 +1,18 @@
+/**
+ * @module @nhtio/adk/batteries/vector
+ */
+export * from "./types";
+export * from "./plan";
+export * from "./filters";
+export * from "./helpers";
+export * from "./exceptions";
+export * from "./builder";
+export * from "./schema";
+export * from "./migrate";
+export * from "./contract";
+export * from "./vector_store_constructor";
+export * from "./validation";
+export * from "./factory";
+export * from "./retrievable_glue";
+export * from "./in_memory/index";
+export * from "./orama/index";

package/batteries/vector/lancedb/index.d.ts

@@ -0,0 +1,34 @@
+/**
+ * @module @nhtio/adk/batteries/vector/lancedb
+ *
+ * Embedded LanceDB adapter (no server — file-based, like sqlite_vec/duckdb). Each collection
+ * is a Lance table with an explicit Arrow schema (`id` Utf8, `vec` FixedSizeList<Float32>,
+ * `document` Utf8, `metadata` Utf8-JSON). KNN uses `table.search(vector).distanceType(...)`;
+ * metadata is filtered with the neutral filter tree's JS reference evaluator for exact
+ * cross-adapter parity. Upsert is a merge-insert on `id`.
+ *
+ * Drivers: `@lancedb/lancedb` + `apache-arrow` (prebuilt binary; no native compile).
+ */
+import { BaseVectorStore } from "../contract";
+import type { SearchPlan, UpsertPlan, DeletePlan, CollectionSpec } from "../plan";
+import type { VectorMatch, VectorStoreCapabilities, BaseVectorStoreOptions } from "../types";
+export interface LanceDBVectorStoreOptions extends BaseVectorStoreOptions {
+    connection: {
+        uri: string;
+    };
+}
+export declare class LanceDBVectorStore extends BaseVectorStore {
+    #private;
+    readonly capabilities: VectorStoreCapabilities;
+    static isAvailable(): boolean;
+    isAvailable(): boolean;
+    connect(): Promise<void>;
+    close(): Promise<void>;
+    createCollection(spec: CollectionSpec, ifNotExists: boolean): Promise<void>;
+    dropCollection(collection: string, ifExists: boolean): Promise<void>;
+    hasCollection(collection: string): Promise<boolean>;
+    renameCollection(_from: string, _to: string): Promise<void>;
+    executeUpsert(plan: UpsertPlan): Promise<void>;
+    executeSearch(plan: SearchPlan): Promise<VectorMatch[]>;
+    executeDelete(plan: DeletePlan): Promise<void>;
+}

package/batteries/vector/lancedb.cjs

@@ -0,0 +1,224 @@
+Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
+require("../../chunk-Ble4zEEl.js");
+const require_tool_registry = require("../../tool_registry-DYUYqXvo.js");
+require("../../guards.cjs");
+const require_batteries_vector_filters = require("./filters.cjs");
+const require_batteries_vector_helpers = require("./helpers.cjs");
+const require_batteries_vector_exceptions = require("./exceptions.cjs");
+const require_batteries_vector_contract = require("./contract.cjs");
+const require_batteries_vector_validation = require("./validation.cjs");
+//#region src/batteries/vector/lancedb/index.ts
+/**
+* @module @nhtio/adk/batteries/vector/lancedb
+*
+* Embedded LanceDB adapter (no server — file-based, like sqlite_vec/duckdb). Each collection
+* is a Lance table with an explicit Arrow schema (`id` Utf8, `vec` FixedSizeList<Float32>,
+* `document` Utf8, `metadata` Utf8-JSON). KNN uses `table.search(vector).distanceType(...)`;
+* metadata is filtered with the neutral filter tree's JS reference evaluator for exact
+* cross-adapter parity. Upsert is a merge-insert on `id`.
+*
+* Drivers: `@lancedb/lancedb` + `apache-arrow` (prebuilt binary; no native compile).
+*/
+var getLanceDB = async () => {
+	try {
+		return await import("@lancedb/lancedb");
+	} catch {
+		throw new require_batteries_vector_exceptions.E_VECTOR_STORE_DRIVER_UNAVAILABLE(["@lancedb/lancedb"]);
+	}
+};
+var getArrow = async () => {
+	try {
+		return await import("apache-arrow");
+	} catch {
+		throw new require_batteries_vector_exceptions.E_VECTOR_STORE_DRIVER_UNAVAILABLE(["apache-arrow"]);
+	}
+};
+var lanceMetric = (metric) => metric === "euclidean" ? "l2" : metric === "dot" ? "dot" : "cosine";
+var lit = (value) => `'${value.replace(/'/g, "''")}'`;
+var LanceDBVectorStore = class extends require_batteries_vector_contract.BaseVectorStore {
+	capabilities = {
+		transactions: false,
+		namedVectors: false,
+		rename: true,
+		rawSql: false,
+		builtInEncoding: false,
+		consistency: {
+			configurable: false,
+			default: "strong",
+			modes: ["strong"]
+		}
+	};
+	#db = null;
+	#dims = /* @__PURE__ */ new Map();
+	get #opts() {
+		return this.options;
+	}
+	static isAvailable() {
+		return typeof process !== "undefined";
+	}
+	isAvailable() {
+		return typeof process !== "undefined";
+	}
+	async connect() {
+		if (this.#db) return;
+		const lancedb = await getLanceDB();
+		const uri = this.#opts.connection?.uri;
+		if (!uri) throw new require_batteries_vector_exceptions.E_VECTOR_STORE_CONNECTION_FAILED(["LanceDB requires connection.uri (a directory path)"]);
+		try {
+			this.#db = await lancedb.connect(uri);
+		} catch (err) {
+			throw new require_batteries_vector_exceptions.E_VECTOR_STORE_CONNECTION_FAILED([String(err)]);
+		}
+	}
+	async close() {
+		this.#db = null;
+	}
+	async #ensure() {
+		if (!this.#db) await this.connect();
+		return this.#db;
+	}
+	async createCollection(spec, ifNotExists) {
+		const db = await this.#ensure();
+		this.#dims.set(spec.collection, spec.vector.dimensions);
+		if (ifNotExists && await this.hasCollection(spec.collection)) return;
+		const arrow = await getArrow();
+		const schema = new arrow.Schema([
+			new arrow.Field("id", new arrow.Utf8(), false),
+			new arrow.Field("vec", new arrow.FixedSizeList(spec.vector.dimensions, new arrow.Field("item", new arrow.Float32(), true)), false),
+			new arrow.Field("document", new arrow.Utf8(), true),
+			new arrow.Field("metadata", new arrow.Utf8(), true)
+		]);
+		try {
+			await db.createEmptyTable(spec.collection, schema, { mode: "overwrite" });
+		} catch (err) {
+			throw new require_batteries_vector_exceptions.E_VECTOR_STORE_COLLECTION_FAILED(["createCollection", String(err)]);
+		}
+	}
+	async dropCollection(collection, ifExists) {
+		const db = await this.#ensure();
+		if (ifExists && !await this.hasCollection(collection)) return;
+		try {
+			await db.dropTable(collection);
+			this.#dims.delete(collection);
+		} catch (err) {
+			const msg = String(err);
+			if (ifExists && msg.includes("not found")) return;
+			throw new require_batteries_vector_exceptions.E_VECTOR_STORE_COLLECTION_FAILED(["dropCollection", msg]);
+		}
+	}
+	async hasCollection(collection) {
+		const db = await this.#ensure();
+		try {
+			return (await db.tableNames()).includes(collection);
+		} catch {
+			return false;
+		}
+	}
+	async renameCollection(_from, _to) {
+		throw new require_batteries_vector_exceptions.E_VECTOR_STORE_UNSUPPORTED_OPERATION(["renameCollection", "lancedb"]);
+	}
+	async executeUpsert(plan) {
+		if (plan.records.length === 0) return;
+		require_batteries_vector_validation.validateRecords(plan.records);
+		const db = await this.#ensure();
+		const expected = this.#opts.dimensions ?? this.#dims.get(plan.collection);
+		try {
+			const rows = [];
+			for (const r of plan.records) {
+				let vector = r.vector;
+				if (!vector && r.document) {
+					const [v] = await this.encode([r.document], "document");
+					vector = v;
+				}
+				if (!vector) throw new require_batteries_vector_exceptions.E_VECTOR_STORE_UPSERT_FAILED(["Record missing vector and document"]);
+				if (expected !== void 0 && vector.length !== expected) throw new require_batteries_vector_exceptions.E_VECTOR_STORE_DIMENSION_MISMATCH([expected, vector.length]);
+				rows.push({
+					id: r.id,
+					vec: vector,
+					document: r.document ?? "",
+					metadata: r.metadata ? JSON.stringify(r.metadata) : "{}"
+				});
+			}
+			await (await db.openTable(plan.collection)).mergeInsert("id").whenMatchedUpdateAll().whenNotMatchedInsertAll().execute(rows);
+		} catch (err) {
+			if (require_tool_registry.isInstanceOf(err, "E_VECTOR_STORE_DIMENSION_MISMATCH", require_batteries_vector_exceptions.E_VECTOR_STORE_DIMENSION_MISMATCH) || require_tool_registry.isInstanceOf(err, "E_VECTOR_STORE_UPSERT_FAILED", require_batteries_vector_exceptions.E_VECTOR_STORE_UPSERT_FAILED)) throw err;
+			throw new require_batteries_vector_exceptions.E_VECTOR_STORE_UPSERT_FAILED([String(err)]);
+		}
+	}
+	async executeSearch(plan) {
+		const db = await this.#ensure();
+		const metric = this.#opts.metric ?? "cosine";
+		let queryVector;
+		let tbl;
+		try {
+			tbl = await db.openTable(plan.collection);
+		} catch (err) {
+			throw new require_batteries_vector_exceptions.E_VECTOR_STORE_SEARCH_FAILED([String(err)]);
+		}
+		if (plan.near) {
+			if ("vector" in plan.near) queryVector = plan.near.vector;
+			else if ("serverText" in plan.near) {
+				const [v] = await this.encode([plan.near.serverText], "query");
+				queryVector = v;
+			} else if ("id" in plan.near) {
+				const rows = await tbl.query().where(`id = ${lit(plan.near.id)}`).limit(1).toArray();
+				if (rows.length === 0) throw new require_batteries_vector_exceptions.E_VECTOR_STORE_SEARCH_FAILED(["Referenced id not found: " + plan.near.id]);
+				queryVector = Array.from(rows[0].vec);
+			}
+		}
+		const offset = plan.offset ?? 0;
+		try {
+			if (queryVector) {
+				const k = plan.filter ? 1e3 : plan.topK + offset;
+				const rows = await tbl.search(queryVector).distanceType(lanceMetric(metric)).limit(k).toArray();
+				return (plan.filter ? rows.filter((row) => require_batteries_vector_filters.evaluateFilter(plan.filter, this.#parseMeta(row.metadata))) : rows).slice(offset, offset + plan.topK).map((row) => this.#project(row, plan, metric, true));
+			} else {
+				const rows = await tbl.query().limit(plan.filter ? 1e5 : plan.topK + offset).toArray();
+				return (plan.filter ? rows.filter((row) => require_batteries_vector_filters.evaluateFilter(plan.filter, this.#parseMeta(row.metadata))) : rows).slice(offset, offset + plan.topK).map((row) => this.#project(row, plan, metric, false));
+			}
+		} catch (err) {
+			throw new require_batteries_vector_exceptions.E_VECTOR_STORE_SEARCH_FAILED([String(err)]);
+		}
+	}
+	#parseMeta(val) {
+		if (typeof val === "string") try {
+			return JSON.parse(val);
+		} catch {
+			return {};
+		}
+		if (val && typeof val === "object") return val;
+		return {};
+	}
+	#project(row, plan, metric, isKnn) {
+		const proj = plan.projection;
+		const out = {};
+		if (proj.id) out.id = row.id;
+		if (proj.vector && row.vec) out.vector = Array.from(row.vec);
+		if (proj.document) out.document = row.document ?? void 0;
+		if (proj.metadata) out.metadata = this.#parseMeta(row.metadata);
+		if (isKnn && row._distance !== void 0 && row._distance !== null) out.score = require_batteries_vector_helpers.normalizeScore(Number(row._distance), metric, "distance");
+		return out;
+	}
+	async executeDelete(plan) {
+		const db = await this.#ensure();
+		try {
+			const tbl = await db.openTable(plan.collection);
+			if (plan.ids && plan.ids.length > 0) {
+				const list = plan.ids.map((id) => lit(id)).join(", ");
+				await tbl.delete(`id IN (${list})`);
+			} else if (plan.filter) {
+				const targets = (await tbl.query().limit(1e5).toArray()).filter((row) => require_batteries_vector_filters.evaluateFilter(plan.filter, this.#parseMeta(row.metadata))).map((row) => row.id);
+				if (targets.length > 0) {
+					const list = targets.map((id) => lit(id)).join(", ");
+					await tbl.delete(`id IN (${list})`);
+				}
+			} else await tbl.delete("true");
+		} catch (err) {
+			throw new require_batteries_vector_exceptions.E_VECTOR_STORE_DELETE_FAILED([String(err)]);
+		}
+	}
+};
+//#endregion
+exports.LanceDBVectorStore = LanceDBVectorStore;
+
+//# sourceMappingURL=lancedb.cjs.map

package/batteries/vector/lancedb.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"lancedb.cjs","names":["#opts","#db","#ensure","#dims","#parseMeta","#project"],"sources":["../../../src/batteries/vector/lancedb/index.ts"],"sourcesContent":["/**\n * @module @nhtio/adk/batteries/vector/lancedb\n *\n * Embedded LanceDB adapter (no server — file-based, like sqlite_vec/duckdb). Each collection\n * is a Lance table with an explicit Arrow schema (`id` Utf8, `vec` FixedSizeList<Float32>,\n * `document` Utf8, `metadata` Utf8-JSON). KNN uses `table.search(vector).distanceType(...)`;\n * metadata is filtered with the neutral filter tree's JS reference evaluator for exact\n * cross-adapter parity. Upsert is a merge-insert on `id`.\n *\n * Drivers: `@lancedb/lancedb` + `apache-arrow` (prebuilt binary; no native compile).\n */\n\nimport { evaluateFilter } from '../filters'\nimport { normalizeScore } from '../helpers'\nimport { BaseVectorStore } from '../contract'\nimport { validateRecords } from '../validation'\nimport { isInstanceOf } from '@nhtio/adk/guards'\nimport {\n  E_VECTOR_STORE_DRIVER_UNAVAILABLE,\n  E_VECTOR_STORE_CONNECTION_FAILED,\n  E_VECTOR_STORE_COLLECTION_FAILED,\n  E_VECTOR_STORE_UPSERT_FAILED,\n  E_VECTOR_STORE_SEARCH_FAILED,\n  E_VECTOR_STORE_DELETE_FAILED,\n  E_VECTOR_STORE_DIMENSION_MISMATCH,\n  E_VECTOR_STORE_UNSUPPORTED_OPERATION,\n} from '../exceptions'\nimport type { SearchPlan, UpsertPlan, DeletePlan, CollectionSpec } from '../plan'\nimport type {\n  VectorMatch,\n  VectorStoreCapabilities,\n  BaseVectorStoreOptions,\n  VectorMetadata,\n  DistanceMetric,\n} from '../types'\n\nexport interface LanceDBVectorStoreOptions extends BaseVectorStoreOptions {\n  connection: { uri: string }\n}\n\nconst getLanceDB = async () => {\n  try {\n    return await import('@lancedb/lancedb')\n  } catch {\n    throw new E_VECTOR_STORE_DRIVER_UNAVAILABLE(['@lancedb/lancedb'])\n  }\n}\n\nconst getArrow = async () => {\n  try {\n    return await import('apache-arrow')\n  } catch {\n    throw new E_VECTOR_STORE_DRIVER_UNAVAILABLE(['apache-arrow'])\n  }\n}\n\nconst lanceMetric = (metric: DistanceMetric): string =>\n  metric === 'euclidean' ? 'l2' : metric === 'dot' ? 'dot' : 'cosine'\n\n// LanceDB SQL string literal (single-quoted, escape embedded quotes).\nconst lit = (value: string): string => `'${value.replace(/'/g, \"''\")}'`\n\nexport class LanceDBVectorStore extends BaseVectorStore {\n  readonly capabilities: VectorStoreCapabilities = {\n    transactions: false,\n    namedVectors: false,\n    rename: true,\n    rawSql: false,\n    builtInEncoding: false,\n    // Embedded and synchronous: a write is visible on resolve. The option is a no-op.\n    consistency: { configurable: false, default: 'strong', modes: ['strong'] },\n  }\n\n  #db: any | null = null\n  #dims: Map<string, number> = new Map()\n\n  get #opts(): LanceDBVectorStoreOptions {\n    return this.options as LanceDBVectorStoreOptions\n  }\n\n  static isAvailable(): boolean {\n    return typeof process !== 'undefined'\n  }\n  isAvailable(): boolean {\n    return typeof process !== 'undefined'\n  }\n\n  async connect(): Promise<void> {\n    if (this.#db) return\n    const lancedb = await getLanceDB()\n    const uri = this.#opts.connection?.uri\n    if (!uri) {\n      throw new E_VECTOR_STORE_CONNECTION_FAILED([\n        'LanceDB requires connection.uri (a directory path)',\n      ])\n    }\n    try {\n      this.#db = await lancedb.connect(uri)\n    } catch (err) {\n      throw new E_VECTOR_STORE_CONNECTION_FAILED([String(err)])\n    }\n  }\n\n  async close(): Promise<void> {\n    this.#db = null\n  }\n\n  async #ensure(): Promise<any> {\n    if (!this.#db) await this.connect()\n    return this.#db!\n  }\n\n  async createCollection(spec: CollectionSpec, ifNotExists: boolean): Promise<void> {\n    const db = await this.#ensure()\n    this.#dims.set(spec.collection, spec.vector.dimensions)\n    if (ifNotExists && (await this.hasCollection(spec.collection))) return\n    const arrow = await getArrow()\n    const schema = new arrow.Schema([\n      new arrow.Field('id', new arrow.Utf8(), false),\n      new arrow.Field(\n        'vec',\n        new arrow.FixedSizeList(\n          spec.vector.dimensions,\n          new arrow.Field('item', new arrow.Float32(), true)\n        ),\n        false\n      ),\n      new arrow.Field('document', new arrow.Utf8(), true),\n      new arrow.Field('metadata', new arrow.Utf8(), true),\n    ])\n    try {\n      await db.createEmptyTable(spec.collection, schema, { mode: 'overwrite' })\n    } catch (err) {\n      throw new E_VECTOR_STORE_COLLECTION_FAILED(['createCollection', String(err)])\n    }\n  }\n\n  async dropCollection(collection: string, ifExists: boolean): Promise<void> {\n    const db = await this.#ensure()\n    if (ifExists && !(await this.hasCollection(collection))) return\n    try {\n      await db.dropTable(collection)\n      this.#dims.delete(collection)\n    } catch (err) {\n      const msg = String(err)\n      if (ifExists && msg.includes('not found')) return\n      throw new E_VECTOR_STORE_COLLECTION_FAILED(['dropCollection', msg])\n    }\n  }\n\n  async hasCollection(collection: string): Promise<boolean> {\n    const db = await this.#ensure()\n    try {\n      const names = await db.tableNames()\n      return names.includes(collection)\n    } catch {\n      return false\n    }\n  }\n\n  async renameCollection(_from: string, _to: string): Promise<void> {\n    throw new E_VECTOR_STORE_UNSUPPORTED_OPERATION(['renameCollection', 'lancedb'])\n  }\n\n  async executeUpsert(plan: UpsertPlan): Promise<void> {\n    if (plan.records.length === 0) return\n    validateRecords(plan.records)\n    const db = await this.#ensure()\n    const expected = this.#opts.dimensions ?? this.#dims.get(plan.collection)\n    try {\n      const rows: any[] = []\n      for (const r of plan.records) {\n        let vector = r.vector\n        if (!vector && r.document) {\n          const [v] = await this.encode([r.document], 'document')\n          vector = v\n        }\n        if (!vector) {\n          throw new E_VECTOR_STORE_UPSERT_FAILED(['Record missing vector and document'])\n        }\n        if (expected !== undefined && vector.length !== expected) {\n          throw new E_VECTOR_STORE_DIMENSION_MISMATCH([expected, vector.length])\n        }\n        rows.push({\n          id: r.id,\n          vec: vector,\n          document: r.document ?? '',\n          metadata: r.metadata ? JSON.stringify(r.metadata) : '{}',\n        })\n      }\n      const tbl = await db.openTable(plan.collection)\n      // Merge-insert on id = upsert (update matched, insert unmatched).\n      await tbl.mergeInsert('id').whenMatchedUpdateAll().whenNotMatchedInsertAll().execute(rows)\n    } catch (err) {\n      if (\n        isInstanceOf(err, 'E_VECTOR_STORE_DIMENSION_MISMATCH', E_VECTOR_STORE_DIMENSION_MISMATCH) ||\n        isInstanceOf(err, 'E_VECTOR_STORE_UPSERT_FAILED', E_VECTOR_STORE_UPSERT_FAILED)\n      ) {\n        throw err\n      }\n      throw new E_VECTOR_STORE_UPSERT_FAILED([String(err)])\n    }\n  }\n\n  async executeSearch(plan: SearchPlan): Promise<VectorMatch[]> {\n    const db = await this.#ensure()\n    const metric = this.#opts.metric ?? 'cosine'\n    let queryVector: number[] | undefined\n    let tbl: any\n    try {\n      tbl = await db.openTable(plan.collection)\n    } catch (err) {\n      throw new E_VECTOR_STORE_SEARCH_FAILED([String(err)])\n    }\n\n    if (plan.near) {\n      if ('vector' in plan.near) {\n        queryVector = plan.near.vector\n      } else if ('serverText' in plan.near) {\n        const [v] = await this.encode([plan.near.serverText], 'query')\n        queryVector = v\n      } else if ('id' in plan.near) {\n        const rows = await tbl\n          .query()\n          .where(`id = ${lit(plan.near.id)}`)\n          .limit(1)\n          .toArray()\n        if (rows.length === 0) {\n          throw new E_VECTOR_STORE_SEARCH_FAILED(['Referenced id not found: ' + plan.near.id])\n        }\n        queryVector = Array.from(rows[0].vec as ArrayLike<number>)\n      }\n    }\n\n    const offset = plan.offset ?? 0\n    try {\n      if (queryVector) {\n        // Over-fetch then JS-filter for exact cross-adapter filter semantics.\n        const k = plan.filter ? 1000 : plan.topK + offset\n        const rows = await tbl\n          .search(queryVector)\n          .distanceType(lanceMetric(metric))\n          .limit(k)\n          .toArray()\n        const filtered = plan.filter\n          ? rows.filter((row: any) => evaluateFilter(plan.filter!, this.#parseMeta(row.metadata)))\n          : rows\n        return filtered\n          .slice(offset, offset + plan.topK)\n          .map((row: any) => this.#project(row, plan, metric, true))\n      } else {\n        const rows = await tbl\n          .query()\n          .limit(plan.filter ? 100000 : plan.topK + offset)\n          .toArray()\n        const filtered = plan.filter\n          ? rows.filter((row: any) => evaluateFilter(plan.filter!, this.#parseMeta(row.metadata)))\n          : rows\n        return filtered\n          .slice(offset, offset + plan.topK)\n          .map((row: any) => this.#project(row, plan, metric, false))\n      }\n    } catch (err) {\n      throw new E_VECTOR_STORE_SEARCH_FAILED([String(err)])\n    }\n  }\n\n  #parseMeta(val: unknown): VectorMetadata {\n    if (typeof val === 'string') {\n      try {\n        return JSON.parse(val) as VectorMetadata\n      } catch {\n        return {}\n      }\n    }\n    if (val && typeof val === 'object') return val as VectorMetadata\n    return {}\n  }\n\n  #project(row: any, plan: SearchPlan, metric: string, isKnn: boolean): VectorMatch {\n    const proj = plan.projection\n    const out: VectorMatch = {}\n    if (proj.id) out.id = row.id as string\n    if (proj.vector && row.vec) out.vector = Array.from(row.vec as ArrayLike<number>)\n    if (proj.document) out.document = (row.document ?? undefined) as string | undefined\n    if (proj.metadata) out.metadata = this.#parseMeta(row.metadata)\n    if (isKnn && row._distance !== undefined && row._distance !== null) {\n      out.score = normalizeScore(Number(row._distance), metric as DistanceMetric, 'distance')\n    }\n    return out\n  }\n\n  async executeDelete(plan: DeletePlan): Promise<void> {\n    const db = await this.#ensure()\n    try {\n      const tbl = await db.openTable(plan.collection)\n      if (plan.ids && plan.ids.length > 0) {\n        const list = plan.ids.map((id) => lit(id)).join(', ')\n        await tbl.delete(`id IN (${list})`)\n      } else if (plan.filter) {\n        const rows = await tbl.query().limit(100000).toArray()\n        const targets: string[] = rows\n          .filter((row: any) => evaluateFilter(plan.filter!, this.#parseMeta(row.metadata)))\n          .map((row: any) => row.id as string)\n        if (targets.length > 0) {\n          const list = targets.map((id) => lit(id)).join(', ')\n          await tbl.delete(`id IN (${list})`)\n        }\n      } else {\n        await tbl.delete('true')\n      }\n    } catch (err) {\n      throw new E_VECTOR_STORE_DELETE_FAILED([String(err)])\n    }\n  }\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;AAwCA,IAAM,aAAa,YAAY;CAC7B,IAAI;EACF,OAAO,MAAM,OAAO;CACtB,QAAQ;EACN,MAAM,IAAI,oCAAA,kCAAkC,CAAC,kBAAkB,CAAC;CAClE;AACF;AAEA,IAAM,WAAW,YAAY;CAC3B,IAAI;EACF,OAAO,MAAM,OAAO;CACtB,QAAQ;EACN,MAAM,IAAI,oCAAA,kCAAkC,CAAC,cAAc,CAAC;CAC9D;AACF;AAEA,IAAM,eAAe,WACnB,WAAW,cAAc,OAAO,WAAW,QAAQ,QAAQ;AAG7D,IAAM,OAAO,UAA0B,IAAI,MAAM,QAAQ,MAAM,IAAI,EAAE;AAErE,IAAa,qBAAb,cAAwC,kCAAA,gBAAgB;CACtD,eAAiD;EAC/C,cAAc;EACd,cAAc;EACd,QAAQ;EACR,QAAQ;EACR,iBAAiB;EAEjB,aAAa;GAAE,cAAc;GAAO,SAAS;GAAU,OAAO,CAAC,QAAQ;EAAE;CAC3E;CAEA,MAAkB;CAClB,wBAA6B,IAAI,IAAI;CAErC,IAAIA,QAAmC;EACrC,OAAO,KAAK;CACd;CAEA,OAAO,cAAuB;EAC5B,OAAO,OAAO,YAAY;CAC5B;CACA,cAAuB;EACrB,OAAO,OAAO,YAAY;CAC5B;CAEA,MAAM,UAAyB;EAC7B,IAAI,KAAKC,KAAK;EACd,MAAM,UAAU,MAAM,WAAW;EACjC,MAAM,MAAM,KAAKD,MAAM,YAAY;EACnC,IAAI,CAAC,KACH,MAAM,IAAI,oCAAA,iCAAiC,CACzC,oDACF,CAAC;EAEH,IAAI;GACF,KAAKC,MAAM,MAAM,QAAQ,QAAQ,GAAG;EACtC,SAAS,KAAK;GACZ,MAAM,IAAI,oCAAA,iCAAiC,CAAC,OAAO,GAAG,CAAC,CAAC;EAC1D;CACF;CAEA,MAAM,QAAuB;EAC3B,KAAKA,MAAM;CACb;CAEA,MAAMC,UAAwB;EAC5B,IAAI,CAAC,KAAKD,KAAK,MAAM,KAAK,QAAQ;EAClC,OAAO,KAAKA;CACd;CAEA,MAAM,iBAAiB,MAAsB,aAAqC;EAChF,MAAM,KAAK,MAAM,KAAKC,QAAQ;EAC9B,KAAKC,MAAM,IAAI,KAAK,YAAY,KAAK,OAAO,UAAU;EACtD,IAAI,eAAgB,MAAM,KAAK,cAAc,KAAK,UAAU,GAAI;EAChE,MAAM,QAAQ,MAAM,SAAS;EAC7B,MAAM,SAAS,IAAI,MAAM,OAAO;GAC9B,IAAI,MAAM,MAAM,MAAM,IAAI,MAAM,KAAK,GAAG,KAAK;GAC7C,IAAI,MAAM,MACR,OACA,IAAI,MAAM,cACR,KAAK,OAAO,YACZ,IAAI,MAAM,MAAM,QAAQ,IAAI,MAAM,QAAQ,GAAG,IAAI,CACnD,GACA,KACF;GACA,IAAI,MAAM,MAAM,YAAY,IAAI,MAAM,KAAK,GAAG,IAAI;GAClD,IAAI,MAAM,MAAM,YAAY,IAAI,MAAM,KAAK,GAAG,IAAI;EACpD,CAAC;EACD,IAAI;GACF,MAAM,GAAG,iBAAiB,KAAK,YAAY,QAAQ,EAAE,MAAM,YAAY,CAAC;EAC1E,SAAS,KAAK;GACZ,MAAM,IAAI,oCAAA,iCAAiC,CAAC,oBAAoB,OAAO,GAAG,CAAC,CAAC;EAC9E;CACF;CAEA,MAAM,eAAe,YAAoB,UAAkC;EACzE,MAAM,KAAK,MAAM,KAAKD,QAAQ;EAC9B,IAAI,YAAY,CAAE,MAAM,KAAK,cAAc,UAAU,GAAI;EACzD,IAAI;GACF,MAAM,GAAG,UAAU,UAAU;GAC7B,KAAKC,MAAM,OAAO,UAAU;EAC9B,SAAS,KAAK;GACZ,MAAM,MAAM,OAAO,GAAG;GACtB,IAAI,YAAY,IAAI,SAAS,WAAW,GAAG;GAC3C,MAAM,IAAI,oCAAA,iCAAiC,CAAC,kBAAkB,GAAG,CAAC;EACpE;CACF;CAEA,MAAM,cAAc,YAAsC;EACxD,MAAM,KAAK,MAAM,KAAKD,QAAQ;EAC9B,IAAI;GAEF,QAAO,MADa,GAAG,WAAW,GACrB,SAAS,UAAU;EAClC,QAAQ;GACN,OAAO;EACT;CACF;CAEA,MAAM,iBAAiB,OAAe,KAA4B;EAChE,MAAM,IAAI,oCAAA,qCAAqC,CAAC,oBAAoB,SAAS,CAAC;CAChF;CAEA,MAAM,cAAc,MAAiC;EACnD,IAAI,KAAK,QAAQ,WAAW,GAAG;EAC/B,oCAAA,gBAAgB,KAAK,OAAO;EAC5B,MAAM,KAAK,MAAM,KAAKA,QAAQ;EAC9B,MAAM,WAAW,KAAKF,MAAM,cAAc,KAAKG,MAAM,IAAI,KAAK,UAAU;EACxE,IAAI;GACF,MAAM,OAAc,CAAC;GACrB,KAAK,MAAM,KAAK,KAAK,SAAS;IAC5B,IAAI,SAAS,EAAE;IACf,IAAI,CAAC,UAAU,EAAE,UAAU;KACzB,MAAM,CAAC,KAAK,MAAM,KAAK,OAAO,CAAC,EAAE,QAAQ,GAAG,UAAU;KACtD,SAAS;IACX;IACA,IAAI,CAAC,QACH,MAAM,IAAI,oCAAA,6BAA6B,CAAC,oCAAoC,CAAC;IAE/E,IAAI,aAAa,KAAA,KAAa,OAAO,WAAW,UAC9C,MAAM,IAAI,oCAAA,kCAAkC,CAAC,UAAU,OAAO,MAAM,CAAC;IAEvE,KAAK,KAAK;KACR,IAAI,EAAE;KACN,KAAK;KACL,UAAU,EAAE,YAAY;KACxB,UAAU,EAAE,WAAW,KAAK,UAAU,EAAE,QAAQ,IAAI;IACtD,CAAC;GACH;GAGA,OAAM,MAFY,GAAG,UAAU,KAAK,UAAU,GAEpC,YAAY,IAAI,EAAE,qBAAqB,EAAE,wBAAwB,EAAE,QAAQ,IAAI;EAC3F,SAAS,KAAK;GACZ,IACE,sBAAA,aAAa,KAAK,qCAAqC,oCAAA,iCAAiC,KACxF,sBAAA,aAAa,KAAK,gCAAgC,oCAAA,4BAA4B,GAE9E,MAAM;GAER,MAAM,IAAI,oCAAA,6BAA6B,CAAC,OAAO,GAAG,CAAC,CAAC;EACtD;CACF;CAEA,MAAM,cAAc,MAA0C;EAC5D,MAAM,KAAK,MAAM,KAAKD,QAAQ;EAC9B,MAAM,SAAS,KAAKF,MAAM,UAAU;EACpC,IAAI;EACJ,IAAI;EACJ,IAAI;GACF,MAAM,MAAM,GAAG,UAAU,KAAK,UAAU;EAC1C,SAAS,KAAK;GACZ,MAAM,IAAI,oCAAA,6BAA6B,CAAC,OAAO,GAAG,CAAC,CAAC;EACtD;EAEA,IAAI,KAAK;OACH,YAAY,KAAK,MACnB,cAAc,KAAK,KAAK;QACnB,IAAI,gBAAgB,KAAK,MAAM;IACpC,MAAM,CAAC,KAAK,MAAM,KAAK,OAAO,CAAC,KAAK,KAAK,UAAU,GAAG,OAAO;IAC7D,cAAc;GAChB,OAAO,IAAI,QAAQ,KAAK,MAAM;IAC5B,MAAM,OAAO,MAAM,IAChB,MAAM,EACN,MAAM,QAAQ,IAAI,KAAK,KAAK,EAAE,GAAG,EACjC,MAAM,CAAC,EACP,QAAQ;IACX,IAAI,KAAK,WAAW,GAClB,MAAM,IAAI,oCAAA,6BAA6B,CAAC,8BAA8B,KAAK,KAAK,EAAE,CAAC;IAErF,cAAc,MAAM,KAAK,KAAK,GAAG,GAAwB;GAC3D;;EAGF,MAAM,SAAS,KAAK,UAAU;EAC9B,IAAI;GACF,IAAI,aAAa;IAEf,MAAM,IAAI,KAAK,SAAS,MAAO,KAAK,OAAO;IAC3C,MAAM,OAAO,MAAM,IAChB,OAAO,WAAW,EAClB,aAAa,YAAY,MAAM,CAAC,EAChC,MAAM,CAAC,EACP,QAAQ;IAIX,QAHiB,KAAK,SAClB,KAAK,QAAQ,QAAa,iCAAA,eAAe,KAAK,QAAS,KAAKI,WAAW,IAAI,QAAQ,CAAC,CAAC,IACrF,MAED,MAAM,QAAQ,SAAS,KAAK,IAAI,EAChC,KAAK,QAAa,KAAKC,SAAS,KAAK,MAAM,QAAQ,IAAI,CAAC;GAC7D,OAAO;IACL,MAAM,OAAO,MAAM,IAChB,MAAM,EACN,MAAM,KAAK,SAAS,MAAS,KAAK,OAAO,MAAM,EAC/C,QAAQ;IAIX,QAHiB,KAAK,SAClB,KAAK,QAAQ,QAAa,iCAAA,eAAe,KAAK,QAAS,KAAKD,WAAW,IAAI,QAAQ,CAAC,CAAC,IACrF,MAED,MAAM,QAAQ,SAAS,KAAK,IAAI,EAChC,KAAK,QAAa,KAAKC,SAAS,KAAK,MAAM,QAAQ,KAAK,CAAC;GAC9D;EACF,SAAS,KAAK;GACZ,MAAM,IAAI,oCAAA,6BAA6B,CAAC,OAAO,GAAG,CAAC,CAAC;EACtD;CACF;CAEA,WAAW,KAA8B;EACvC,IAAI,OAAO,QAAQ,UACjB,IAAI;GACF,OAAO,KAAK,MAAM,GAAG;EACvB,QAAQ;GACN,OAAO,CAAC;EACV;EAEF,IAAI,OAAO,OAAO,QAAQ,UAAU,OAAO;EAC3C,OAAO,CAAC;CACV;CAEA,SAAS,KAAU,MAAkB,QAAgB,OAA6B;EAChF,MAAM,OAAO,KAAK;EAClB,MAAM,MAAmB,CAAC;EAC1B,IAAI,KAAK,IAAI,IAAI,KAAK,IAAI;EAC1B,IAAI,KAAK,UAAU,IAAI,KAAK,IAAI,SAAS,MAAM,KAAK,IAAI,GAAwB;EAChF,IAAI,KAAK,UAAU,IAAI,WAAY,IAAI,YAAY,KAAA;EACnD,IAAI,KAAK,UAAU,IAAI,WAAW,KAAKD,WAAW,IAAI,QAAQ;EAC9D,IAAI,SAAS,IAAI,cAAc,KAAA,KAAa,IAAI,cAAc,MAC5D,IAAI,QAAQ,iCAAA,eAAe,OAAO,IAAI,SAAS,GAAG,QAA0B,UAAU;EAExF,OAAO;CACT;CAEA,MAAM,cAAc,MAAiC;EACnD,MAAM,KAAK,MAAM,KAAKF,QAAQ;EAC9B,IAAI;GACF,MAAM,MAAM,MAAM,GAAG,UAAU,KAAK,UAAU;GAC9C,IAAI,KAAK,OAAO,KAAK,IAAI,SAAS,GAAG;IACnC,MAAM,OAAO,KAAK,IAAI,KAAK,OAAO,IAAI,EAAE,CAAC,EAAE,KAAK,IAAI;IACpD,MAAM,IAAI,OAAO,UAAU,KAAK,EAAE;GACpC,OAAO,IAAI,KAAK,QAAQ;IAEtB,MAAM,WAAoB,MADP,IAAI,MAAM,EAAE,MAAM,GAAM,EAAE,QAAQ,GAElD,QAAQ,QAAa,iCAAA,eAAe,KAAK,QAAS,KAAKE,WAAW,IAAI,QAAQ,CAAC,CAAC,EAChF,KAAK,QAAa,IAAI,EAAY;IACrC,IAAI,QAAQ,SAAS,GAAG;KACtB,MAAM,OAAO,QAAQ,KAAK,OAAO,IAAI,EAAE,CAAC,EAAE,KAAK,IAAI;KACnD,MAAM,IAAI,OAAO,UAAU,KAAK,EAAE;IACpC;GACF,OACE,MAAM,IAAI,OAAO,MAAM;EAE3B,SAAS,KAAK;GACZ,MAAM,IAAI,oCAAA,6BAA6B,CAAC,OAAO,GAAG,CAAC,CAAC;EACtD;CACF;AACF"}