{"version":3,"file":"in_memory.cjs","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 availability probe: whether this adapter's runtime driver can load in the current environment. */\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,kCAAA,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;;CAGhC,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,oCAAA,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,oCAAA,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,iCAAA,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,iCAAA,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,iCAAA,eAAe,KAAK,UAAU,YAAY;EACnD;EACA,IAAI,WAAW,OAAO;GACpB,MAAM,KAAKA,KAAK,GAAG,CAAC;GACpB,OAAO,iCAAA,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,iCAAA,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"}