@nicia-ai/typegraph 0.39.0 → 0.40.0

package/dist/chunk-HAQVISUF.cjs.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/backend/table-contribution.ts","../src/query/dialect/fulltext-strategy.ts","../src/query/dialect/vector-strategy.ts","../src/query/dialect/postgres.ts","../src/query/dialect/sqlite.ts","../src/query/dialect/index.ts","../src/indexes/compiler.ts"],"names":["sql","requireDefined","quoteIdentifier","parseJsonPointer","inlineSqlStringLiteral","likeEscapeClause","getSqlDialectProfile","jsonPointer"],"mappings":";;;;;;;AA+CO,IAAM,0BAAA,GAA6B;AAGnC,IAAM,uBAAA,GAA0B;;;ACrBhC,IAAM,kBAAA,GAAmD;AAAA,EAC9D,WAAA;AAAA,EACA,QAAA;AAAA,EACA,OAAA;AAAA,EACA;AACF;AAMO,SAAS,0BACd,QAAA,EACsB;AACtB,EAAA,OAAO;AAAA,IACL,SAAA,EAAW,IAAA;AAAA,IACX,WAAW,QAAA,CAAS,SAAA;AAAA,IACpB,aAAA,EAAe,QAAA,CAAS,cAAA,CAAe,QAAA,CAAS,QAAQ,CAAA;AAAA,IACxD,eAAe,QAAA,CAAS,cAAA;AAAA,IACxB,cAAc,QAAA,CAAS;AAAA,GACzB;AACF;AAkKA,SAAS,gBAAgB,IAAA,EAAsB;AAC7C,EAAA,OAAO,CAAA,CAAA,EAAI,IAAA,CAAK,UAAA,CAAW,GAAA,EAAK,IAAI,CAAC,CAAA,CAAA,CAAA;AACvC;AAEA,SAAS,eAAe,SAAA,EAAgC;AACtD,EAAA,OAAOA,qBAAA,CAAA,EAAMA,qBAAA,CAAI,UAAA,CAAW,SAAS,CAAC,CAAA,MAAA,CAAA;AACxC;AAOA,SAAS,wBACP,IAAA,EACoB;AACpB,EAAA,MAAM,IAAA,uBAAW,GAAA,EAA8B;AAC/C,EAAA,KAAA,MAAW,OAAO,IAAA,EAAM,IAAA,CAAK,GAAA,CAAI,GAAA,CAAI,QAAQ,GAAG,CAAA;AAChD,EAAA,OAAO,CAAC,GAAG,IAAA,CAAK,MAAA,EAAQ,CAAA;AAC1B;AAEA,SAAS,mBAAA,CACP,WACA,MAAA,EACa;AACb,EAAA,MAAM,KAAA,GAAQA,qBAAA,CAAI,UAAA,CAAW,SAAS,CAAA;AACtC,EAAA,OAAOA,qBAAA;AAAA,gBAAA,EACS,KAAK;AAAA,uBAAA,EACE,OAAO,OAAO;AAAA,wBAAA,EACb,OAAO,QAAQ;AAAA,sBAAA,EACjB,OAAO,MAAM;AAAA,EAAA,CAAA;AAErC;AAEA,SAAS,wBAAA,CACP,WACA,MAAA,EACyB;AACzB,EAAA,IAAI,MAAA,CAAO,OAAA,CAAQ,MAAA,KAAW,CAAA,EAAG,OAAO,MAAA;AACxC,EAAA,MAAM,SAAS,CAAC,GAAG,IAAI,GAAA,CAAI,MAAA,CAAO,OAAO,CAAC,CAAA;AAC1C,EAAA,MAAM,KAAA,GAAQA,qBAAA,CAAI,UAAA,CAAW,SAAS,CAAA;AACtC,EAAA,OAAOA,qBAAA;AAAA,gBAAA,EACS,KAAK;AAAA,uBAAA,EACE,OAAO,OAAO;AAAA,wBAAA,EACb,OAAO,QAAQ;AAAA,wBAAA,EACfA,qBAAA,CAAI,IAAA;AAAA,IACtB,OAAO,GAAA,CAAI,CAAC,EAAA,KAAOA,qBAAA,CAAA,EAAM,EAAE,CAAA,CAAE,CAAA;AAAA,IAC7BA,qBAAA,CAAA,EAAA;AAAA,GACD,CAAA;AAAA,EAAA,CAAA;AAEP;AAMA,SAAS,eAAA,CACP,IAAA,EACA,KAAA,EACA,QAAA,EACa;AAIb,EAAA,MAAM,QAAA,GACJ,QAAA,KAAa,MAAA,GAAYA,qBAAA,CAAA,UAAA,CAAA,GAAkBA,wBAAM,QAAQ,CAAA,WAAA,CAAA;AAC3D,EAAA,QAAQ,IAAA;AAAM,IACZ,KAAK,WAAA,EAAa;AAChB,MAAA,OAAOA,qBAAA,CAAA,qBAAA,EAA2B,QAAQ,CAAA,EAAA,EAAK,KAAK,CAAA,CAAA,CAAA;AAAA,IACtD;AAAA,IACA,KAAK,QAAA,EAAU;AACb,MAAA,OAAOA,qBAAA,CAAA,iBAAA,EAAuB,QAAQ,CAAA,EAAA,EAAK,KAAK,CAAA,CAAA,CAAA;AAAA,IAClD;AAAA,IACA,KAAK,OAAA,EAAS;AACZ,MAAA,OAAOA,qBAAA,CAAA,gBAAA,EAAsB,QAAQ,CAAA,EAAA,EAAK,KAAK,CAAA,CAAA,CAAA;AAAA,IACjD;AAAA,IACA,KAAK,KAAA,EAAO;AACV,MAAA,OAAOA,qBAAA,CAAA,WAAA,EAAiB,QAAQ,CAAA,EAAA,EAAK,KAAK,CAAA,CAAA,CAAA;AAAA,IAC5C;AAAA,IACA,SAAS;AACP,MAAA,MAAM,WAAA,GAAqB,IAAA;AAC3B,MAAA,MAAM,IAAI,KAAA,CAAM,CAAA,2BAAA,EAA8B,MAAA,CAAO,WAAW,CAAC,CAAA,CAAE,CAAA;AAAA,IACrE;AAAA;AAEJ;AAEO,IAAM,gBAAA,GAAqC;AAAA,EAChD,IAAA,EAAM,UAAA;AAAA,EACN,cAAA,EAAgB,kBAAA;AAAA,EAChB,gBAAA,EAAkB,IAAA;AAAA;AAAA,EAElB,cAAA,EAAgB,IAAA;AAAA,EAChB,wBAAA,EAA0B,IAAA;AAAA;AAAA;AAAA;AAAA,EAI1B,SAAA,EAAW;AAAA,IACT,QAAA;AAAA,IACA,SAAA;AAAA,IACA,QAAA;AAAA,IACA,QAAA;AAAA,IACA,SAAA;AAAA,IACA,YAAA;AAAA,IACA,SAAA;AAAA,IACA,SAAA;AAAA,IACA;AAAA,GACF;AAAA,EAEA,cAAA,CAAe,SAAA,EAAW,KAAA,EAAO,IAAA,EAAM,QAAA,EAAU;AAC/C,IAAA,MAAM,CAAA,GAAI,eAAA,CAAgB,IAAA,EAAM,KAAA,EAAO,QAAQ,CAAA;AAC/C,IAAA,OAAOA,qBAAA,CAAA,EAAM,cAAA,CAAe,SAAS,CAAC,OAAO,CAAC,CAAA,CAAA;AAAA,EAChD,CAAA;AAAA,EAEA,cAAA,CAAe,SAAA,EAAW,KAAA,EAAO,IAAA,EAAM,QAAA,EAAU;AAC/C,IAAA,MAAM,CAAA,GAAI,eAAA,CAAgB,IAAA,EAAM,KAAA,EAAO,QAAQ,CAAA;AAC/C,IAAA,OAAOA,qBAAA,CAAA,WAAA,EAAiB,cAAA,CAAe,SAAS,CAAC,KAAK,CAAC,CAAA,CAAA,CAAA;AAAA,EACzD,CAAA;AAAA,EAEA,iBAAA,CAAkB,UAAA,EAAY,KAAA,EAAO,IAAA,EAAM,QAAA,EAAU;AACnD,IAAA,MAAM,QAAA,GACJ,QAAA,KAAa,MAAA,GAAYA,qBAAA,CAAA,UAAA,CAAA,GAAkBA,wBAAM,QAAQ,CAAA,WAAA,CAAA;AAC3D,IAAA,MAAM,CAAA,GAAI,eAAA,CAAgB,IAAA,EAAM,KAAA,EAAO,QAAQ,CAAA;AAC/C,IAAA,OAAOA,qBAAA,CAAA,YAAA,EAAkB,QAAQ,CAAA,aAAA,EAAgB,CAAC,CAAA,sFAAA,CAAA;AAAA,EACpD,CAAA;AAAA,EAEA,YAAY,gBAAA,EAAkB;AAC5B,IAAA,MAAM,IAAA,GAAO,gBAAgB,gBAAgB,CAAA;AAC7C,IAAA,MAAM,GAAA,GAAM,eAAA,CAAgB,CAAA,EAAG,gBAAgB,CAAA,QAAA,CAAU,CAAA;AACzD,IAAA,MAAM,IAAA,GAAO,eAAA,CAAgB,CAAA,EAAG,gBAAgB,CAAA,SAAA,CAAW,CAAA;AAO3D,IAAA,MAAM,SAAA,GAAY;AAAA,MAChB,8BAA8B,IAAI,CAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAAA,CAAA;AAAA,MAWlC,CAAA,2BAAA,EAA8B,GAAG,CAAA,IAAA,EAAO,IAAI,CAAA,mBAAA,CAAA;AAAA,MAC5C,CAAA,2BAAA,EAA8B,IAAI,CAAA,IAAA,EAAO,IAAI,CAAA,2BAAA;AAAA,KAC/C;AAMA,IAAA,OAAO;AAAA,MACL;AAAA,QACE,WAAA,EAAa,0BAAA;AAAA,QACb,KAAA,EAAO,UAAA;AAAA,QACP,SAAA,EAAW,gBAAA;AAAA,QACX,SAAA;AAAA,QACA,aAAA,EAAe;AAAA;AACjB,KACF;AAAA,EACF,CAAA;AAAA,EAEA,WAAA,CAAY,SAAA,EAAW,MAAA,EAAQ,SAAA,EAAW;AACxC,IAAA,MAAM,KAAA,GAAQA,qBAAA,CAAI,UAAA,CAAW,SAAS,CAAA;AAItC,IAAA,OAAO;AAAA,MACLA,qBAAA;AAAA,oBAAA,EACgB,KAAK,CAAA;AAAA;AAAA,UAAA,EAEf,OAAO,OAAO,CAAA,EAAA,EAAK,OAAO,QAAQ,CAAA,EAAA,EAAK,OAAO,MAAM,CAAA;AAAA,UAAA,EACpD,MAAA,CAAO,OAAO,CAAA,EAAA,EAAK,MAAA,CAAO,QAAQ,CAAA;AAAA,UAAA,EAClC,SAAS;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAAA;AAAA,KAQjB;AAAA,EACF,CAAA;AAAA,EAEA,gBAAA,CAAiB,SAAA,EAAW,MAAA,EAAQ,SAAA,EAAW;AAC7C,IAAA,MAAM,IAAA,GAAO,uBAAA,CAAwB,MAAA,CAAO,IAAI,CAAA;AAChD,IAAA,IAAI,IAAA,CAAK,MAAA,KAAW,CAAA,EAAG,OAAO,EAAC;AAE/B,IAAA,MAAM,KAAA,GAAQA,qBAAA,CAAI,UAAA,CAAW,SAAS,CAAA;AACtC,IAAA,MAAM,cAAc,IAAA,CAAK,GAAA;AAAA,MACvB,CAAC,GAAA,KAAQA,qBAAA;AAAA;AAAA,cAAA,EAEC,OAAO,OAAO,CAAA,EAAA,EAAK,OAAO,QAAQ,CAAA,EAAA,EAAK,IAAI,MAAM,CAAA;AAAA,cAAA,EACjD,GAAA,CAAI,OAAO,CAAA,EAAA,EAAK,GAAA,CAAI,QAAQ,CAAA;AAAA,cAAA,EAC5B,SAAS;AAAA;AAAA,MAAA;AAAA,KAGrB;AAEA,IAAA,OAAO;AAAA,MACLA,qBAAA;AAAA,oBAAA,EACgB,KAAK,CAAA;AAAA,eAAA,EACVA,qBAAA,CAAI,IAAA,CAAK,WAAA,EAAaA,qBAAA,CAAA,EAAA,CAAO,CAAC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAAA;AAAA,KAO3C;AAAA,EACF,CAAA;AAAA,EAEA,WAAA,CAAY,WAAW,MAAA,EAAQ;AAC7B,IAAA,OAAO,CAAC,mBAAA,CAAoB,SAAA,EAAW,MAAM,CAAC,CAAA;AAAA,EAChD,CAAA;AAAA,EAEA,gBAAA,CAAiB,WAAW,MAAA,EAAQ;AAClC,IAAA,MAAM,IAAA,GAAO,wBAAA,CAAyB,SAAA,EAAW,MAAM,CAAA;AACvD,IAAA,OAAO,IAAA,KAAS,MAAA,GAAY,EAAC,GAAI,CAAC,IAAI,CAAA;AAAA,EACxC;AACF;AAMA,SAAS,oBAAA,CAAqB,OAAe,IAAA,EAAiC;AAC5E,EAAA,QAAQ,IAAA;AAAM,IACZ,KAAK,QAAA,EAAU;AACb,MAAA,OAAO,CAAA,CAAA,EAAI,KAAA,CAAM,UAAA,CAAW,GAAA,EAAK,IAAI,CAAC,CAAA,CAAA,CAAA;AAAA,IACxC;AAAA,IACA,KAAK,OAAA,EAAS;AACZ,MAAA,OAAO,KAAA,CACJ,IAAA,EAAK,CACL,KAAA,CAAM,MAAM,EACZ,MAAA,CAAO,CAAC,KAAA,KAAU,KAAA,CAAM,MAAA,GAAS,CAAC,EAClC,GAAA,CAAI,CAAC,KAAA,KAAU,CAAA,CAAA,EAAI,KAAA,CAAM,UAAA,CAAW,GAAA,EAAK,IAAI,CAAC,CAAA,CAAA,CAAG,CAAA,CACjD,IAAA,CAAK,GAAG,CAAA;AAAA,IACb;AAAA,IACA,KAAK,WAAA,EAAa;AAChB,MAAA,OAAO,yBAAyB,KAAK,CAAA;AAAA,IACvC;AAAA,IACA,KAAK,KAAA,EAAO;AACV,MAAA,OAAO,KAAA;AAAA,IACT;AAAA,IACA,SAAS;AACP,MAAA,MAAM,WAAA,GAAqB,IAAA;AAC3B,MAAA,MAAM,IAAI,KAAA,CAAM,CAAA,2BAAA,EAA8B,MAAA,CAAO,WAAW,CAAC,CAAA,CAAE,CAAA;AAAA,IACrE;AAAA;AAEJ;AAEA,SAAS,yBAAyB,KAAA,EAAuB;AACvD,EAAA,MAAM,SAAmB,EAAC;AAC1B,EAAA,IAAI,KAAA,GAAQ,CAAA;AAEZ,EAAA,SAAS,cAAA,GAAuB;AAC9B,IAAA,OAAO,KAAA,GAAQ,MAAM,MAAA,IAAU,KAAA,CAAM,KAAK,KAAA,CAAM,KAAK,CAAA,IAAK,EAAE,CAAA,EAAG;AAC7D,MAAA,KAAA,IAAS,CAAA;AAAA,IACX;AAAA,EACF;AAEA,EAAA,SAAS,UAAA,GAAqB;AAC5B,IAAA,KAAA,IAAS,CAAA;AACT,IAAA,IAAI,OAAA,GAAU,EAAA;AACd,IAAA,OAAO,QAAQ,KAAA,CAAM,MAAA,IAAU,KAAA,CAAM,KAAK,MAAM,GAAA,EAAK;AACnD,MAAA,OAAA,IAAW,KAAA,CAAM,KAAK,CAAA,IAAK,EAAA;AAC3B,MAAA,KAAA,IAAS,CAAA;AAAA,IACX;AACA,IAAA,IAAI,KAAA,CAAM,KAAK,CAAA,KAAM,GAAA,EAAK,KAAA,IAAS,CAAA;AACnC,IAAA,OAAO,CAAA,CAAA,EAAI,OAAA,CAAQ,UAAA,CAAW,GAAA,EAAK,IAAI,CAAC,CAAA,CAAA,CAAA;AAAA,EAC1C;AAEA,EAAA,SAAS,YAAA,GAAuB;AAC9B,IAAA,IAAI,IAAA,GAAO,EAAA;AACX,IAAA,OAAO,KAAA,GAAQ,KAAA,CAAM,MAAA,IAAU,CAAC,KAAA,CAAM,KAAK,KAAA,CAAM,KAAK,CAAA,IAAK,EAAE,CAAA,EAAG;AAC9D,MAAA,IAAA,IAAQ,KAAA,CAAM,KAAK,CAAA,IAAK,EAAA;AACxB,MAAA,KAAA,IAAS,CAAA;AAAA,IACX;AACA,IAAA,OAAO,IAAA;AAAA,EACT;AAEA,EAAA,OAAO,KAAA,GAAQ,MAAM,MAAA,EAAQ;AAC3B,IAAA,cAAA,EAAe;AACf,IAAA,IAAI,KAAA,IAAS,MAAM,MAAA,EAAQ;AAC3B,IAAA,MAAM,EAAA,GAAK,MAAM,KAAK,CAAA;AACtB,IAAA,IAAI,OAAO,GAAA,EAAK;AACd,MAAA,MAAA,CAAO,IAAA,CAAK,YAAY,CAAA;AACxB,MAAA;AAAA,IACF;AACA,IAAA,IAAI,OAAO,GAAA,EAAK;AACd,MAAA,KAAA,IAAS,CAAA;AACT,MAAA,MAAM,IAAA,GACJ,KAAA,CAAM,KAAK,CAAA,KAAM,GAAA,GACf,UAAA,EAAW,GACX,CAAA,CAAA,EAAI,YAAA,EAAa,CAAE,UAAA,CAAW,GAAA,EAAK,IAAI,CAAC,CAAA,CAAA,CAAA;AAC5C,MAAA,MAAA,CAAO,IAAA,CAAK,CAAA,IAAA,EAAO,IAAI,CAAA,CAAE,CAAA;AACzB,MAAA;AAAA,IACF;AACA,IAAA,IAAI,OAAO,GAAA,EAAK;AACd,MAAA,KAAA,IAAS,CAAA;AACT,MAAA;AAAA,IACF;AACA,IAAA,MAAM,OAAO,YAAA,EAAa;AAC1B,IAAA,IAAI,IAAA,CAAK,WAAW,CAAA,EAAG;AACvB,IAAA,IAAI,IAAA,CAAK,WAAA,EAAY,KAAM,IAAA,EAAM;AAC/B,MAAA,MAAA,CAAO,KAAK,IAAI,CAAA;AAChB,MAAA;AAAA,IACF;AACA,IAAA,MAAA,CAAO,KAAK,CAAA,CAAA,EAAI,IAAA,CAAK,WAAW,GAAA,EAAK,IAAI,CAAC,CAAA,CAAA,CAAG,CAAA;AAAA,EAC/C;AAEA,EAAA,IAAI,MAAA,CAAO,SAAS,CAAA,IAAK,MAAA,CAAO,CAAC,CAAA,EAAG,UAAA,CAAW,MAAM,CAAA,EAAG;AACtD,IAAA,MAAA,CAAO,KAAA,EAAM;AAAA,EACf;AAEA,EAAA,OAAO,MAAA,CAAO,KAAK,GAAG,CAAA;AACxB;AAEO,IAAM,YAAA,GAAiC;AAAA,EAC5C,IAAA,EAAM,MAAA;AAAA,EACN,cAAA,EAAgB,kBAAA;AAAA,EAChB,gBAAA,EAAkB,IAAA;AAAA;AAAA,EAElB,cAAA,EAAgB,IAAA;AAAA;AAAA;AAAA,EAGhB,wBAAA,EAA0B,KAAA;AAAA;AAAA;AAAA;AAAA,EAI1B,SAAA,EAAW,CAAC,QAAA,EAAU,WAAA,EAAa,SAAS,CAAA;AAAA,EAE5C,cAAA,CAAe,SAAA,EAAW,KAAA,EAAO,IAAA,EAAM,SAAA,EAAW;AAChD,IAAA,MAAM,eAAA,GAAkB,oBAAA,CAAqB,KAAA,EAAO,IAAI,CAAA;AACxD,IAAA,OAAOA,wBAAMA,qBAAA,CAAI,UAAA,CAAW,SAAS,CAAC,UAAU,eAAe,CAAA,CAAA;AAAA,EACjE,CAAA;AAAA,EAEA,cAAA,CAAe,SAAA,EAAW,MAAA,EAAQ,KAAA,EAAO,SAAA,EAAW;AAGlD,IAAA,OAAOA,qBAAA,CAAA,MAAA,EAAYA,qBAAA,CAAI,UAAA,CAAW,SAAS,CAAC,CAAA,CAAA,CAAA;AAAA,EAC9C,CAAA;AAAA,EAEA,iBAAA,CAAkB,SAAA,EAAW,MAAA,EAAQ,KAAA,EAAO,SAAA,EAAW;AACrD,IAAA,OAAOA,qBAAA,CAAA,QAAA,EAAcA,qBAAA,CAAI,UAAA,CAAW,SAAS,CAAC,CAAA,mCAAA,CAAA;AAAA,EAChD,CAAA;AAAA,EAEA,YAAY,gBAAA,EAAkB;AAC5B,IAAA,MAAM,IAAA,GAAO,gBAAgB,gBAAgB,CAAA;AAK7C,IAAA,OAAO;AAAA,MACL;AAAA,QACE,WAAA,EAAa,0BAAA;AAAA,QACb,KAAA,EAAO,MAAA;AAAA,QACP,SAAA,EAAW,gBAAA;AAAA,QACX,SAAA,EAAW;AAAA,UACT,sCAAsC,IAAI,CAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAAA;AAAA,SAS5C;AAAA,QACA,aAAA,EAAe;AAAA;AACjB,KACF;AAAA,EACF,CAAA;AAAA,EAEA,WAAA,CAAY,SAAA,EAAW,MAAA,EAAQ,SAAA,EAAW;AACxC,IAAA,MAAM,KAAA,GAAQA,qBAAA,CAAI,UAAA,CAAW,SAAS,CAAA;AAGtC,IAAA,OAAO;AAAA,MACLA,qBAAA;AAAA,oBAAA,EACgB,KAAK;AAAA,2BAAA,EACE,OAAO,OAAO;AAAA,4BAAA,EACb,OAAO,QAAQ;AAAA,0BAAA,EACjB,OAAO,MAAM;AAAA,MAAA,CAAA;AAAA,MAEnCA,qBAAA;AAAA,oBAAA,EACgB,KAAK,CAAA;AAAA,gBAAA,EACT,MAAA,CAAO,OAAO,CAAA,EAAA,EAAK,MAAA,CAAO,QAAQ,CAAA,EAAA,EAAK,MAAA,CAAO,MAAM,CAAA,EAAA,EAAK,OAAO,OAAO,CAAA,EAAA,EAAK,MAAA,CAAO,QAAQ,KAAK,SAAS,CAAA;AAAA,MAAA;AAAA,KAEvH;AAAA,EACF,CAAA;AAAA,EAEA,gBAAA,CAAiB,SAAA,EAAW,MAAA,EAAQ,SAAA,EAAW;AAC7C,IAAA,MAAM,IAAA,GAAO,uBAAA,CAAwB,MAAA,CAAO,IAAI,CAAA;AAChD,IAAA,IAAI,IAAA,CAAK,MAAA,KAAW,CAAA,EAAG,OAAO,EAAC;AAE/B,IAAA,MAAM,KAAA,GAAQA,qBAAA,CAAI,UAAA,CAAW,SAAS,CAAA;AACtC,IAAA,MAAM,UAAU,IAAA,CAAK,GAAA,CAAI,CAAC,GAAA,KAAQ,IAAI,MAAM,CAAA;AAE5C,IAAA,MAAM,UAAA,GAAaA,qBAAA;AAAA,kBAAA,EACH,KAAK;AAAA,yBAAA,EACE,OAAO,OAAO;AAAA,0BAAA,EACb,OAAO,QAAQ;AAAA,0BAAA,EACfA,qBAAA,CAAI,IAAA;AAAA,MACtB,QAAQ,GAAA,CAAI,CAAC,EAAA,KAAOA,qBAAA,CAAA,EAAM,EAAE,CAAA,CAAE,CAAA;AAAA,MAC9BA,qBAAA,CAAA,EAAA;AAAA,KACD,CAAA;AAAA,IAAA,CAAA;AAGL,IAAA,MAAM,cAAc,IAAA,CAAK,GAAA;AAAA,MACvB,CAAC,GAAA,KAAQA,qBAAA;AAAA;AAAA,cAAA,EAEC,OAAO,OAAO,CAAA,EAAA,EAAK,OAAO,QAAQ,CAAA,EAAA,EAAK,IAAI,MAAM,CAAA;AAAA,cAAA,EACjD,IAAI,OAAO,CAAA,EAAA,EAAK,GAAA,CAAI,QAAQ,KAAK,SAAS;AAAA;AAAA,MAAA;AAAA,KAGtD;AAEA,IAAA,MAAM,UAAA,GAAaA,qBAAA;AAAA,kBAAA,EACH,KAAK,CAAA;AAAA,aAAA,EACVA,qBAAA,CAAI,IAAA,CAAK,WAAA,EAAaA,qBAAA,CAAA,EAAA,CAAO,CAAC;AAAA,IAAA,CAAA;AAGzC,IAAA,OAAO,CAAC,YAAY,UAAU,CAAA;AAAA,EAChC,CAAA;AAAA,EAEA,WAAA,CAAY,WAAW,MAAA,EAAQ;AAC7B,IAAA,OAAO,CAAC,mBAAA,CAAoB,SAAA,EAAW,MAAM,CAAC,CAAA;AAAA,EAChD,CAAA;AAAA,EAEA,gBAAA,CAAiB,WAAW,MAAA,EAAQ;AAClC,IAAA,MAAM,IAAA,GAAO,wBAAA,CAAyB,SAAA,EAAW,MAAM,CAAA;AACvD,IAAA,OAAO,IAAA,KAAS,MAAA,GAAY,EAAC,GAAI,CAAC,IAAI,CAAA;AAAA,EACxC;AACF;;;ACxlBO,IAAM,0BAAA,GAA6B;AAgDnC,SAAS,wBACd,QAAA,EACoB;AACpB,EAAA,OAAO,QAAA,CAAS,YAAA;AAClB;AA6KO,SAAS,qBAAA,CACd,oBACA,MAAA,EACa;AACb,EAAA,QAAQ,MAAA;AAAQ,IACd,KAAK,QAAA,EAAU;AACb,MAAA,OAAOA,8BAAY,kBAAkB,CAAA,EAAA,CAAA;AAAA,IACvC;AAAA,IACA,KAAK,IAAA;AAAA,IACL,KAAK,eAAA,EAAiB;AACpB,MAAA,OAAO,kBAAA;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;AAMO,SAAS,uBAAA,CACd,kBAAA,EACA,MAAA,EACA,QAAA,EACa;AAKb,EAAA,oBAAA,CAAqB,UAAU,MAAM,CAAA;AACrC,EAAA,QAAQ,MAAA;AAAQ,IACd,KAAK,QAAA,EAAU;AACb,MAAA,OAAOA,qBAAA,CAAA,EAAM,kBAAkB,CAAA,IAAA,EAAO,CAAA,GAAI,QAAQ,CAAA,CAAA;AAAA,IACpD;AAAA,IACA,KAAK,IAAA,EAAM;AACT,MAAA,OAAOA,qBAAA,CAAA,EAAM,kBAAkB,CAAA,IAAA,EAAO,QAAQ,CAAA,CAAA;AAAA,IAChD;AAAA,IACA,KAAK,eAAA,EAAiB;AACpB,MAAA,OAAOA,qBAAA,CAAA,EAAM,kBAAkB,CAAA,IAAA,EAAO,CAAC,QAAQ,CAAA,CAAA;AAAA,IACjD;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;AAOO,SAAS,qBAAA,CACd,WACA,IAAA,EACM;AACN,EAAA,KAAA,MAAW,CAAC,KAAA,EAAO,KAAK,CAAA,IAAK,SAAA,CAAU,SAAQ,EAAG;AAChD,IAAA,IAAI,OAAO,KAAA,KAAU,QAAA,IAAY,CAAC,MAAA,CAAO,QAAA,CAAS,KAAK,CAAA,EAAG;AACxD,MAAA,MAAM,IAAI,SAAA;AAAA,QACR,CAAA,EAAG,IAAI,CAAA,CAAA,EAAI,KAAK,mCAAmC,KAAK,CAAA;AAAA,OAC1D;AAAA,IACF;AAAA,EACF;AACF;AAQO,SAAS,wBAAwB,KAAA,EAAqB;AAC3D,EAAA,IAAI,CAAC,MAAA,CAAO,SAAA,CAAU,KAAK,CAAA,IAAK,SAAS,CAAA,EAAG;AAC1C,IAAA,MAAM,IAAI,UAAA;AAAA,MACR,uDAAuD,KAAK,CAAA;AAAA,KAC9D;AAAA,EACF;AACF;AASO,SAAS,oBAAA,CACd,QAAA,EACA,MAAA,EACA,KAAA,GAAQ,UAAA,EACF;AACN,EAAA,IAAI,CAAC,MAAA,CAAO,QAAA,CAAS,QAAQ,CAAA,EAAG;AAC9B,IAAA,MAAM,IAAI,UAAA,CAAW,CAAA,EAAG,KAAK,CAAA,+BAAA,EAAkC,QAAQ,CAAA,CAAE,CAAA;AAAA,EAC3E;AACA,EAAA,IAAI,WAAW,QAAA,IAAY,IAAA,CAAK,GAAA,CAAI,QAAQ,IAAI,CAAA,EAAG;AACjD,IAAA,MAAM,IAAI,UAAA;AAAA,MACR,CAAA,EAAG,KAAK,CAAA,sDAAA,EAAyD,QAAQ,CAAA;AAAA,KAC3E;AAAA,EACF;AACF;AAWA,IAAM,4BAAA,GAA+B,EAAA;AAErC,SAAS,uBAAuB,KAAA,EAAuB;AACrD,EAAA,OAAO,KAAA,CAAM,WAAA,EAAY,CAAE,UAAA,CAAW,eAAe,GAAG,CAAA;AAC1D;AAOO,SAAS,UAAU,KAAA,EAAuB;AAC/C,EAAA,IAAI,EAAA,GAAK,UAAA;AACT,EAAA,IAAI,EAAA,GAAK,UAAA;AACT,EAAA,KAAA,IAAS,KAAA,GAAQ,CAAA,EAAG,KAAA,GAAQ,KAAA,CAAM,QAAQ,KAAA,EAAA,EAAS;AACjD,IAAA,MAAM,EAAA,GAAKC,gCAAA,CAAe,KAAA,CAAM,WAAA,CAAY,KAAK,CAAC,CAAA;AAClD,IAAA,EAAA,GAAK,IAAA,CAAK,IAAA,CAAK,EAAA,GAAK,EAAA,EAAI,UAAa,CAAA;AACrC,IAAA,EAAA,GAAK,IAAA,CAAK,IAAA,CAAK,EAAA,GAAK,EAAA,EAAI,UAAa,CAAA;AAAA,EACvC;AACA,EAAA,EAAA,GACE,IAAA,CAAK,IAAA,CAAK,EAAA,GAAM,EAAA,KAAO,EAAA,EAAK,UAAa,CAAA,GACzC,IAAA,CAAK,IAAA,CAAK,EAAA,GAAM,EAAA,KAAO,EAAA,EAAK,UAAa,CAAA;AAC3C,EAAA,EAAA,GACE,IAAA,CAAK,IAAA,CAAK,EAAA,GAAM,EAAA,KAAO,EAAA,EAAK,UAAa,CAAA,GACzC,IAAA,CAAK,IAAA,CAAK,EAAA,GAAM,EAAA,KAAO,EAAA,EAAK,UAAa,CAAA;AAC3C,EAAA,MAAM,EAAA,GAAA,CAAM,OAAO,CAAA,EAAG,QAAA,CAAS,EAAE,CAAA,CAAE,QAAA,CAAS,GAAG,GAAG,CAAA;AAClD,EAAA,MAAM,EAAA,GAAA,CAAM,OAAO,CAAA,EAAG,QAAA,CAAS,EAAE,CAAA,CAAE,QAAA,CAAS,GAAG,GAAG,CAAA;AAClD,EAAA,OAAO,GAAG,EAAE,CAAA,EAAG,EAAE,CAAA,CAAA,CAAG,KAAA,CAAM,GAAG,CAAC,CAAA;AAChC;AAaO,SAAS,kBAAA,CACd,MAAA,EACA,OAAA,EACA,QAAA,EACA,SAAA,EACQ;AACR,EAAA,MAAM,QAAA,GAAW,CAAA,EAAG,MAAM,CAAA,CAAA,EAAI,uBAAuB,OAAO,CAAC,CAAA,CAAA,EAAI,sBAAA,CAAuB,QAAQ,CAAC,CAAA,CAAA,EAAI,sBAAA,CAAuB,SAAS,CAAC,CAAA,CAAA;AAMtI,EAAA,MAAM,IAAA,GAAO,UAAU,IAAA,CAAK,SAAA,CAAU,CAAC,OAAA,EAAS,QAAA,EAAU,SAAS,CAAC,CAAC,CAAA;AACrE,EAAA,MAAM,IAAA,GAAO,CAAA,EAAG,QAAQ,CAAA,CAAA,EAAI,IAAI,CAAA,CAAA;AAChC,EAAA,IAAI,IAAA,CAAK,MAAA,IAAU,4BAAA,EAA8B,OAAO,IAAA;AAExD,EAAA,OAAO,CAAA,EAAG,QAAA,CAAS,KAAA,CAAM,CAAA,EAAG,4BAAA,GAA+B,IAAI,IAAA,CAAK,MAAM,CAAC,CAAA,CAAA,EAAI,IAAI,CAAA,CAAA;AACrF;AAOO,SAASC,iBAAgB,IAAA,EAAsB;AACpD,EAAA,OAAO,CAAA,CAAA,EAAI,IAAA,CAAK,UAAA,CAAW,GAAA,EAAK,IAAI,CAAC,CAAA,CAAA,CAAA;AACvC;;;AC9ZA,SAAS,eAAe,OAAA,EAAmC;AACzD,EAAA,IAAI,CAAC,OAAA,IAAW,OAAA,KAAY,EAAA,IAAM,YAAY,GAAA,EAAK;AACjD,IAAA,OAAOF,qBAAA,CAAI,IAAI,iBAAiB,CAAA;AAAA,EAClC;AAEA,EAAA,MAAM,QAAA,GAAWG,mCAAiB,OAAO,CAAA;AACzC,EAAA,IAAI,QAAA,CAAS,WAAW,CAAA,EAAG;AACzB,IAAA,OAAOH,qBAAA,CAAI,IAAI,iBAAiB,CAAA;AAAA,EAClC;AAIA,EAAA,MAAM,eAAA,GAAkB,QAAA,CACrB,GAAA,CAAI,CAAC,OAAA,KAAYI,wCAAA,CAAuB,OAAA,EAAS,UAAU,CAAC,CAAA,CAC5D,IAAA,CAAK,IAAI,CAAA;AACZ,EAAA,OAAOJ,qBAAA,CAAI,GAAA,CAAI,CAAA,MAAA,EAAS,eAAe,CAAA,CAAA,CAAG,CAAA;AAC5C;AAKO,IAAM,eAAA,GAAkC;AAAA,EAC7C,IAAA,EAAM,UAAA;AAAA,EACN,YAAA,EAAc;AAAA,IACZ,qBAAA,EAAuB,aAAA;AAAA,IACvB,sBAAA,EAAwB,eAAA;AAAA,IACxB,oCAAA,EAAsC,KAAA;AAAA,IACtC,uBAAA,EAAyB,IAAA;AAAA,IACzB,qCAAA,EAAuC,KAAA;AAAA,IACvC,uBAAA,EAAyB,QAAA;AAAA,IACzB,aAAA,EAAe,CAAC,QAAA,EAAU,IAAA,EAAM,eAAe,CAAA;AAAA,IAC/C,gBAAA,EAAkB;AAAA,GACpB;AAAA,EAEA,WAAW,UAAA,EAAY;AACrB,IAAA,OAAOA,wBAAM,UAAU,CAAA,YAAA,CAAA;AAAA,EACzB,CAAA;AAAA,EAEA,sBAAsB,KAAA,EAAO;AAC3B,IAAA,OAAOA,gCAAc,KAAK,CAAA,CAAA;AAAA,EAC5B,CAAA;AAAA,EAEA,4BAA4B,aAAA,EAAe;AAIzC,IAAA,OAAOA,sDAAoC,aAAa,CAAA,OAAA,CAAA;AAAA,EAC1D,CAAA;AAAA;AAAA;AAAA;AAAA,EAMA,YAAY,OAAA,EAAS;AACnB,IAAA,OAAO,eAAe,OAAO,CAAA;AAAA,EAC/B,CAAA;AAAA,EAEA,WAAA,CAAY,QAAQ,OAAA,EAAS;AAE3B,IAAA,MAAM,IAAA,GAAO,eAAe,OAAO,CAAA;AACnC,IAAA,OAAOA,qBAAA,CAAA,EAAM,MAAM,CAAA,IAAA,EAAO,IAAI,CAAA,CAAA;AAAA,EAChC,CAAA;AAAA,EAEA,eAAA,CAAgB,QAAQ,OAAA,EAAS;AAE/B,IAAA,MAAM,IAAA,GAAO,eAAe,OAAO,CAAA;AACnC,IAAA,OAAOA,qBAAA,CAAA,EAAM,MAAM,CAAA,KAAA,EAAQ,IAAI,CAAA,CAAA;AAAA,EACjC,CAAA;AAAA,EAEA,iBAAA,CAAkB,QAAQ,OAAA,EAAS;AAEjC,IAAA,MAAM,IAAA,GAAO,eAAe,OAAO,CAAA;AACnC,IAAA,OAAOA,qBAAA,CAAA,CAAA,EAAO,MAAM,CAAA,KAAA,EAAQ,IAAI,CAAA,UAAA,CAAA;AAAA,EAClC,CAAA;AAAA,EAEA,iBAAA,CAAkB,QAAQ,OAAA,EAAS;AAGjC,IAAA,MAAM,IAAA,GAAO,eAAe,OAAO,CAAA;AACnC,IAAA,OAAOA,qBAAA,CAAA,CAAA,EAAO,MAAM,CAAA,KAAA,EAAQ,IAAI,CAAA,mBAAA,CAAA;AAAA,EAClC,CAAA;AAAA,EAEA,kBAAA,CAAmB,QAAQ,OAAA,EAAS;AAElC,IAAA,MAAM,IAAA,GAAO,eAAe,OAAO,CAAA;AACnC,IAAA,OAAOA,qBAAA,CAAA,CAAA,EAAO,MAAM,CAAA,KAAA,EAAQ,IAAI,CAAA,UAAA,CAAA;AAAA,EAClC,CAAA;AAAA,EAEA,eAAA,CAAgB,QAAQ,OAAA,EAAS;AAE/B,IAAA,MAAM,IAAA,GAAO,eAAe,OAAO,CAAA;AACnC,IAAA,OAAOA,qBAAA,CAAA,CAAA,EAAO,MAAM,CAAA,KAAA,EAAQ,IAAI,CAAA,cAAA,CAAA;AAAA,EAClC,CAAA;AAAA;AAAA;AAAA;AAAA,EAMA,gBAAgB,MAAA,EAAQ;AACtB,IAAA,OAAOA,2CAAyB,MAAM,CAAA,CAAA,CAAA;AAAA,EACxC,CAAA;AAAA,EAEA,iBAAA,CAAkB,QAAQ,KAAA,EAAO;AAE/B,IAAA,MAAM,SAAA,GAAY,IAAA,CAAK,SAAA,CAAU,CAAC,KAAK,CAAC,CAAA;AACxC,IAAA,OAAOA,qBAAA,CAAA,EAAM,MAAM,CAAA,IAAA,EAAO,SAAS,CAAA,OAAA,CAAA;AAAA,EACrC,CAAA;AAAA,EAEA,oBAAA,CAAqB,QAAQ,MAAA,EAAQ;AACnC,IAAA,IAAI,MAAA,CAAO,WAAW,CAAA,EAAG;AACvB,MAAA,OAAOA,qBAAA,CAAI,IAAI,KAAK,CAAA;AAAA,IACtB;AAGA,IAAA,MAAM,SAAA,GAAY,IAAA,CAAK,SAAA,CAAU,MAAM,CAAA;AACvC,IAAA,OAAOA,qBAAA,CAAA,EAAM,MAAM,CAAA,IAAA,EAAO,SAAS,CAAA,OAAA,CAAA;AAAA,EACrC,CAAA;AAAA,EAEA,oBAAA,CAAqB,QAAQ,MAAA,EAAQ;AACnC,IAAA,IAAI,MAAA,CAAO,WAAW,CAAA,EAAG;AACvB,MAAA,OAAOA,qBAAA,CAAI,IAAI,KAAK,CAAA;AAAA,IACtB;AAIA,IAAA,MAAM,UAAA,GAAa,MAAA,CAAO,GAAA,CAAI,CAAC,KAAA,KAAU;AACvC,MAAA,MAAM,SAAA,GAAY,IAAA,CAAK,SAAA,CAAU,CAAC,KAAK,CAAC,CAAA;AACxC,MAAA,OAAOA,qBAAA,CAAA,EAAM,MAAM,CAAA,IAAA,EAAO,SAAS,CAAA,OAAA,CAAA;AAAA,IACrC,CAAC,CAAA;AACD,IAAA,OAAOA,qBAAA,CAAA,CAAA,EAAOA,qBAAA,CAAI,IAAA,CAAK,UAAA,EAAYA,2BAAS,CAAC,CAAA,CAAA,CAAA;AAAA,EAC/C,CAAA;AAAA;AAAA;AAAA;AAAA,EAMA,WAAA,CAAY,QAAQ,OAAA,EAAS;AAC3B,IAAA,MAAM,IAAA,GAAO,eAAe,OAAO,CAAA;AACnC,IAAA,OAAOA,qBAAA,CAAA,EAAM,MAAM,CAAA,IAAA,EAAO,IAAI,CAAA,YAAA,CAAA;AAAA,EAChC,CAAA;AAAA,EAEA,cAAA,CAAe,QAAQ,OAAA,EAAS;AAC9B,IAAA,MAAM,IAAA,GAAO,eAAe,OAAO,CAAA;AAOnC,IAAA,OAAOA,qBAAA,CAAA,sBAAA,EAA4B,MAAM,CAAA,IAAA,EAAO,IAAI,CAAA,iBAAA,CAAA;AAAA,EACtD,CAAA;AAAA,EAEA,gBAAA,CAAiB,QAAQ,OAAA,EAAS;AAChC,IAAA,MAAM,IAAA,GAAO,eAAe,OAAO,CAAA;AAGnC,IAAA,OAAOA,qBAAA,CAAA,sBAAA,EAA4B,MAAM,CAAA,IAAA,EAAO,IAAI,CAAA,oBAAA,CAAA;AAAA,EACtD,CAAA;AAAA,EAEA,iBAAA,CAAkB,QAAQ,OAAA,EAAS;AACjC,IAAA,MAAM,IAAA,GAAO,eAAe,OAAO,CAAA;AAEnC,IAAA,OAAOA,qBAAA,CAAA,sBAAA,EAA4B,MAAM,CAAA,IAAA,EAAO,IAAI,CAAA,mBAAA,CAAA;AAAA,EACtD,CAAA;AAAA;AAAA;AAAA;AAAA,EAMA,cAAA,CAAe,MAAM,KAAA,EAAO;AAC1B,IAAA,OAAOA,qBAAA,CAAA,EAAM,IAAI,CAAA,sBAAA,EAAyB,KAAK,CAAA,CAAA;AAAA,EACjD,CAAA;AAAA,EAEA,MAAA,CAAO,IAAA,EAAM,MAAA,EAAQ,OAAA,EAAS;AAC5B,IAAA,MAAM,QAAA,GAAW,UAAUA,qBAAA,CAAI,GAAA,CAAI,QAAQ,CAAA,GAAIA,qBAAA,CAAI,IAAI,IAAI,CAAA;AAC3D,IAAA,MAAM,eAAe,MAAA,CAAO,GAAA,CAAI,CAAC,KAAA,KAAUA,qBAAA,CAAA,EAAM,KAAK,CAAA,CAAE,CAAA;AACxD,IAAA,OAAOA,qBAAA,CAAA,EAAM,IAAI,CAAA,CAAA,EAAI,QAAQ,KAAKA,qBAAA,CAAI,IAAA,CAAK,YAAA,EAAcA,qBAAA,CAAA,EAAA,CAAO,CAAC,CAAA,CAAA,CAAA;AAAA,EACnE,CAAA;AAAA;AAAA;AAAA;AAAA,EAMA,KAAA,CAAM,QAAQ,OAAA,EAAS;AAIrB,IAAA,OAAOA,qBAAA,CAAA,EAAM,MAAM,CAAA,OAAA,EAAU,OAAO,IAAIK,kCAAgB,CAAA,CAAA;AAAA,EAC1D,CAAA;AAAA;AAAA;AAAA;AAAA,EAMA,wBAAwB,KAAA,EAAO;AAG7B,IAAA,OAAOL,yBAAO,KAAK,CAAA,CAAA,CAAA;AAAA,EACrB,CAAA;AAAA;AAAA;AAAA;AAAA,EAMA,eAAe,MAAA,EAAQ;AAErB,IAAA,OAAOA,8BAAY,MAAM,CAAA,CAAA,CAAA;AAAA,EAC3B,CAAA;AAAA,EAEA,UAAA,CAAW,aAAa,MAAA,EAAQ;AAE9B,IAAA,OAAOA,qBAAA,CAAA,EAAM,WAAW,CAAA,IAAA,EAAO,MAAM,CAAA,CAAA;AAAA,EACvC,CAAA;AAAA,EAEA,UAAA,CAAW,QAAQ,IAAA,EAAM;AAGvB,IAAA,OAAOA,qBAAA,CAAA,EAAM,MAAM,CAAA,QAAA,EAAW,IAAI,CAAA,CAAA,CAAA;AAAA,EACpC,CAAA;AAAA;AAAA;AAAA;AAAA,EAMA,UAAU,KAAA,EAAO;AACf,IAAA,OAAOM,sCAAA,CAAqB,UAAU,CAAA,CAAE,SAAA,CAAU,KAAK,CAAA;AAAA,EACzD,CAAA;AAAA,EAEA,eAAe,KAAA,EAAO;AACpB,IAAA,OAAON,qBAAA,CAAI,GAAA;AAAA,MACTM,sCAAA,CAAqB,UAAU,CAAA,CAAE,oBAAA,CAAqB,KAAK;AAAA,KAC7D;AAAA,EACF,CAAA;AAAA,EAEA,qBAAqB,KAAA,EAAO;AAC1B,IAAA,OAAOA,sCAAA,CAAqB,UAAU,CAAA,CAAE,oBAAA,CAAqB,KAAK,CAAA;AAAA,EACpE,CAAA;AAAA,EAEA,gBAAgB,IAAA,EAAM;AAEpB,IAAA,OAAO,CAAA,CAAA,EAAI,IAAA,CAAK,UAAA,CAAW,GAAA,EAAK,IAAI,CAAC,CAAA,CAAA,CAAA;AAAA,EACvC,CAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,eAAA,EAAiB,IAAA;AAAA;AAAA;AAAA;AAAA,EAMjB,QAAA,EAAU;AACZ,CAAA;;;ACzRA,SAAS,oBAAoB,KAAA,EAAuB;AAClD,EAAA,OAAO,CAAA,CAAA,EAAI,KAAA,CAAM,UAAA,CAAW,GAAA,EAAK,IAAI,CAAC,CAAA,CAAA,CAAA;AACxC;AAUA,SAAS,aAAa,OAAA,EAA8B;AAClD,EAAA,IAAI,CAAC,OAAA,IAAW,OAAA,KAAY,EAAA,IAAM,YAAY,GAAA,EAAK;AACjD,IAAA,OAAO,GAAA;AAAA,EACT;AAEA,EAAA,MAAM,QAAA,GAAWH,mCAAiB,OAAO,CAAA;AACzC,EAAA,MAAM,KAAA,GAAkB,CAAC,GAAG,CAAA;AAE5B,EAAA,KAAA,MAAW,WAAW,QAAA,EAAU;AAC9B,IAAA,IAAI,YAAA,CAAa,OAAO,CAAA,EAAG;AACzB,MAAA,KAAA,CAAM,IAAA,CAAK,CAAA,CAAA,EAAI,OAAO,CAAA,CAAA,CAAG,CAAA;AAAA,IAC3B,CAAA,MAAO;AAEL,MAAA,KAAA,CAAM,KAAK,CAAA,CAAA,EAAI,IAAA,CAAK,SAAA,CAAU,OAAO,CAAC,CAAA,CAAE,CAAA;AAAA,IAC1C;AAAA,EACF;AAEA,EAAA,OAAO,KAAA,CAAM,KAAK,EAAE,CAAA;AACtB;AAKA,SAAS,aAAa,OAAA,EAA0B;AAC9C,EAAA,OAAO,OAAA,CAAQ,KAAK,OAAO,CAAA;AAC7B;AAKO,IAAM,aAAA,GAAgC;AAAA,EAC3C,IAAA,EAAM,QAAA;AAAA,EACN,YAAA,EAAc;AAAA,IACZ,qBAAA,EAAuB,aAAA;AAAA,IACvB,sBAAA,EAAwB,eAAA;AAAA,IACxB,oCAAA,EAAsC,IAAA;AAAA,IACtC,uBAAA,EAAyB,KAAA;AAAA,IACzB,qCAAA,EAAuC,IAAA;AAAA,IACvC,uBAAA,EAAyB,QAAA;AAAA,IACzB,aAAA,EAAe,CAAC,QAAA,EAAU,IAAI,CAAA;AAAA,IAC9B,gBAAA,EAAkB;AAAA,GACpB;AAAA,EAEA,WAAW,UAAA,EAAY;AACrB,IAAA,OAAO,UAAA;AAAA,EACT,CAAA;AAAA,EAEA,qBAAA,GAAmC;AACjC,IAAA;AAAA,EACF,CAAA;AAAA,EAEA,2BAAA,GAAyC;AAEvC,IAAA;AAAA,EACF,CAAA;AAAA;AAAA;AAAA;AAAA,EAMA,YAAY,OAAA,EAAS;AAGnB,IAAA,OAAOH,sBAAI,GAAA,CAAI,mBAAA,CAAoB,YAAA,CAAa,OAAO,CAAC,CAAC,CAAA;AAAA,EAC3D,CAAA;AAAA,EAEA,WAAA,CAAY,QAAQ,OAAA,EAAS;AAC3B,IAAA,MAAM,IAAA,GAAO,aAAa,OAAO,CAAA;AACjC,IAAA,OAAOA,qBAAA,CAAA,aAAA,EAAmB,MAAM,CAAA,EAAA,EAAKA,qBAAA,CAAI,IAAI,mBAAA,CAAoB,IAAI,CAAC,CAAC,CAAA,CAAA,CAAA;AAAA,EACzE,CAAA;AAAA,EAEA,eAAA,CAAgB,QAAQ,OAAA,EAAS;AAG/B,IAAA,MAAM,IAAA,GAAO,aAAa,OAAO,CAAA;AACjC,IAAA,OAAOA,qBAAA,CAAA,aAAA,EAAmB,MAAM,CAAA,EAAA,EAAKA,qBAAA,CAAI,IAAI,mBAAA,CAAoB,IAAI,CAAC,CAAC,CAAA,CAAA,CAAA;AAAA,EACzE,CAAA;AAAA,EAEA,iBAAA,CAAkB,QAAQ,OAAA,EAAS;AAEjC,IAAA,MAAM,IAAA,GAAO,aAAa,OAAO,CAAA;AACjC,IAAA,OAAOA,qBAAA,CAAA,aAAA,EAAmB,MAAM,CAAA,EAAA,EAAKA,qBAAA,CAAI,IAAI,mBAAA,CAAoB,IAAI,CAAC,CAAC,CAAA,CAAA,CAAA;AAAA,EACzE,CAAA;AAAA,EAEA,iBAAA,CAAkB,QAAQ,OAAA,EAAS;AAGjC,IAAA,MAAM,IAAA,GAAO,aAAa,OAAO,CAAA;AACjC,IAAA,OAAOA,qBAAA,CAAA,aAAA,EAAmB,MAAM,CAAA,EAAA,EAAKA,qBAAA,CAAI,IAAI,mBAAA,CAAoB,IAAI,CAAC,CAAC,CAAA,CAAA,CAAA;AAAA,EACzE,CAAA;AAAA,EAEA,kBAAA,CAAmB,QAAQ,OAAA,EAAS;AAElC,IAAA,MAAM,IAAA,GAAO,aAAa,OAAO,CAAA;AACjC,IAAA,OAAOA,qBAAA,CAAA,aAAA,EAAmB,MAAM,CAAA,EAAA,EAAKA,qBAAA,CAAI,IAAI,mBAAA,CAAoB,IAAI,CAAC,CAAC,CAAA,CAAA,CAAA;AAAA,EACzE,CAAA;AAAA,EAEA,eAAA,CAAgB,QAAQ,OAAA,EAAS;AAE/B,IAAA,MAAM,IAAA,GAAO,aAAa,OAAO,CAAA;AACjC,IAAA,OAAOA,qBAAA,CAAA,aAAA,EAAmB,MAAM,CAAA,EAAA,EAAKA,qBAAA,CAAI,IAAI,mBAAA,CAAoB,IAAI,CAAC,CAAC,CAAA,CAAA,CAAA;AAAA,EACzE,CAAA;AAAA;AAAA;AAAA;AAAA,EAMA,gBAAgB,MAAA,EAAQ;AACtB,IAAA,OAAOA,0CAAwB,MAAM,CAAA,CAAA,CAAA;AAAA,EACvC,CAAA;AAAA,EAEA,iBAAA,CAAkB,QAAQ,KAAA,EAAO;AAC/B,IAAA,OAAOA,qBAAA,CAAA,gCAAA,EAAsC,MAAM,CAAA,0BAAA,EAA6B,KAAK,CAAA,CAAA,CAAA;AAAA,EACvF,CAAA;AAAA,EAEA,oBAAA,CAAqB,QAAQ,MAAA,EAAQ;AACnC,IAAA,IAAI,MAAA,CAAO,WAAW,CAAA,EAAG;AACvB,MAAA,OAAOA,qBAAA,CAAI,IAAI,KAAK,CAAA;AAAA,IACtB;AACA,IAAA,MAAM,YAAA,GAAe,IAAA,CAAK,SAAA,CAAU,MAAM,CAAA;AAC1C,IAAA,OAAOA,qBAAA;AAAA;AAAA,oCAAA,EAE2B,YAAY,CAAA;AAAA;AAAA,sCAAA,EAEV,MAAM,CAAA;AAAA;AAAA;AAAA;AAAA,IAAA,CAAA;AAAA,EAK5C,CAAA;AAAA,EAEA,oBAAA,CAAqB,QAAQ,MAAA,EAAQ;AACnC,IAAA,IAAI,MAAA,CAAO,WAAW,CAAA,EAAG;AACvB,MAAA,OAAOA,qBAAA,CAAI,IAAI,KAAK,CAAA;AAAA,IACtB;AACA,IAAA,MAAM,YAAA,GAAe,IAAA,CAAK,SAAA,CAAU,MAAM,CAAA;AAC1C,IAAA,OAAOA,qBAAA;AAAA;AAAA;AAAA,2BAAA,EAGkB,MAAM,CAAA;AAAA,2BAAA,EACN,YAAY,CAAA;AAAA;AAAA;AAAA,IAAA,CAAA;AAAA,EAIvC,CAAA;AAAA;AAAA;AAAA;AAAA,EAMA,WAAA,CAAY,QAAQ,OAAA,EAAS;AAC3B,IAAA,MAAM,IAAA,GAAO,aAAa,OAAO,CAAA;AACjC,IAAA,OAAOA,qBAAA,CAAA,UAAA,EAAgB,MAAM,CAAA,EAAA,EAAKA,qBAAA,CAAI,IAAI,mBAAA,CAAoB,IAAI,CAAC,CAAC,CAAA,aAAA,CAAA;AAAA,EACtE,CAAA;AAAA,EAEA,cAAA,CAAe,QAAQ,OAAA,EAAS;AAC9B,IAAA,MAAM,IAAA,GAAO,aAAa,OAAO,CAAA;AACjC,IAAA,MAAM,OAAA,GAAUA,qBAAA,CAAI,GAAA,CAAI,mBAAA,CAAoB,IAAI,CAAC,CAAA;AACjD,IAAA,OAAOA,qBAAA,CAAA,mBAAA,EAAyB,MAAM,CAAA,EAAA,EAAK,OAAO,CAAA,cAAA,CAAA;AAAA,EACpD,CAAA;AAAA,EAEA,gBAAA,CAAiB,QAAQ,OAAA,EAAS;AAChC,IAAA,MAAM,IAAA,GAAO,aAAa,OAAO,CAAA;AACjC,IAAA,MAAM,OAAA,GAAUA,qBAAA,CAAI,GAAA,CAAI,mBAAA,CAAoB,IAAI,CAAC,CAAA;AAGjD,IAAA,OAAOA,qBAAA,CAAA,mBAAA,EAAyB,MAAM,CAAA,EAAA,EAAK,OAAO,CAAA,4BAAA,CAAA;AAAA,EACpD,CAAA;AAAA,EAEA,iBAAA,CAAkB,QAAQ,OAAA,EAAS;AACjC,IAAA,MAAM,IAAA,GAAO,aAAa,OAAO,CAAA;AACjC,IAAA,MAAM,OAAA,GAAUA,qBAAA,CAAI,GAAA,CAAI,mBAAA,CAAoB,IAAI,CAAC,CAAA;AACjD,IAAA,OAAOA,qBAAA,CAAA,mBAAA,EAAyB,MAAM,CAAA,EAAA,EAAK,OAAO,CAAA,eAAA,CAAA;AAAA,EACpD,CAAA;AAAA;AAAA;AAAA;AAAA,EAMA,cAAA,CAAe,MAAM,KAAA,EAAO;AAG1B,IAAA,OAAOA,qBAAA,CAAA,EAAM,IAAI,CAAA,IAAA,EAAO,KAAK,CAAA,CAAA;AAAA,EAC/B,CAAA;AAAA,EAEA,MAAA,CAAO,IAAA,EAAM,MAAA,EAAQ,OAAA,EAAS;AAC5B,IAAA,MAAM,QAAA,GAAW,UAAUA,qBAAA,CAAI,GAAA,CAAI,QAAQ,CAAA,GAAIA,qBAAA,CAAI,IAAI,IAAI,CAAA;AAC3D,IAAA,MAAM,YAAA,GAAe,IAAA,CAAK,SAAA,CAAU,MAAM,CAAA;AAC1C,IAAA,OAAOA,qBAAA,CAAA,EAAM,IAAI,CAAA,CAAA,EAAI,QAAQ,iCAAiC,YAAY,CAAA,EAAA,CAAA;AAAA,EAC5E,CAAA;AAAA;AAAA;AAAA;AAAA,EAMA,KAAA,CAAM,QAAQ,OAAA,EAAS;AAKrB,IAAA,OAAOA,qBAAA,CAAA,MAAA,EAAY,MAAM,CAAA,aAAA,EAAgB,OAAO,KAAKK,kCAAgB,CAAA,CAAA;AAAA,EACvE,CAAA;AAAA;AAAA;AAAA;AAAA,EAMA,wBAAwB,KAAA,EAAO;AAG7B,IAAA,OAAOL,uCAAqB,KAAK,CAAA,CAAA,CAAA;AAAA,EACnC,CAAA;AAAA;AAAA;AAAA;AAAA,EAMA,eAAe,MAAA,EAAQ;AAErB,IAAA,OAAOA,+BAAa,MAAM,CAAA,OAAA,CAAA;AAAA,EAC5B,CAAA;AAAA,EAEA,UAAA,CAAW,aAAa,MAAA,EAAQ;AAE9B,IAAA,OAAOA,qBAAA,CAAA,EAAM,WAAW,CAAA,IAAA,EAAO,MAAM,CAAA,OAAA,CAAA;AAAA,EACvC,CAAA;AAAA,EAEA,UAAA,CAAW,QAAQ,IAAA,EAAM;AAGvB,IAAA,OAAOA,qBAAA,CAAA,MAAA,EAAY,IAAI,CAAA,SAAA,EAAY,MAAM,CAAA,YAAA,CAAA;AAAA,EAC3C,CAAA;AAAA;AAAA;AAAA;AAAA,EAMA,UAAU,KAAA,EAAO;AACf,IAAA,OAAOM,sCAAA,CAAqB,QAAQ,CAAA,CAAE,SAAA,CAAU,KAAK,CAAA;AAAA,EACvD,CAAA;AAAA,EAEA,eAAe,KAAA,EAAO;AACpB,IAAA,OAAON,sBAAI,GAAA,CAAIM,sCAAA,CAAqB,QAAQ,CAAA,CAAE,oBAAA,CAAqB,KAAK,CAAC,CAAA;AAAA,EAC3E,CAAA;AAAA,EAEA,qBAAqB,KAAA,EAAO;AAC1B,IAAA,OAAOA,sCAAA,CAAqB,QAAQ,CAAA,CAAE,oBAAA,CAAqB,KAAK,CAAA;AAAA,EAClE,CAAA;AAAA,EAEA,gBAAgB,IAAA,EAAM;AAEpB,IAAA,OAAO,CAAA,CAAA,EAAI,IAAA,CAAK,UAAA,CAAW,GAAA,EAAK,IAAI,CAAC,CAAA,CAAA,CAAA;AAAA,EACvC,CAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,eAAA,EAAiB,IAAA;AAAA;AAAA;AAAA;AAAA,EAMjB,QAAA,EAAU;AACZ,CAAA;;;ACnQA,IAAM,gBAAA,GAAuD;AAAA,EAC3D,MAAA,EAAQ,aAAA;AAAA,EACR,QAAA,EAAU;AACZ,CAAA;AAcO,SAAS,WAAW,OAAA,EAAqC;AAC9D,EAAA,OAAO,iBAAiB,OAAO,CAAA;AACjC;;;ACtBO,SAAS,oBAAA,CACd,KAAA,EACA,OAAA,EACA,WAAA,EACA,YAAA,EACmB;AACnB,EAAA,MAAM,OAAA,GAAU,WAAW,OAAO,CAAA;AAClC,EAAA,MAAM,OAAsB,EAAC;AAE7B,EAAA,MAAM,aAAA,GAAgB;AAAA,IACpB,GAAG,mBAAA,CAAoB,KAAA,CAAM,KAAK,CAAA;AAAA,IAClC,GAAI,KAAA,CAAM,gBAAA,IAAoB;AAAC,GACjC;AACA,EAAA,KAAA,MAAW,UAAU,aAAA,EAAe;AAClC,IAAA,IAAA,CAAK,IAAA,CAAK,YAAA,CAAa,MAAM,CAAC,CAAA;AAAA,EAChC;AAEA,EAAA,MAAM,cAAc,CAAC,GAAG,MAAM,MAAA,EAAQ,GAAG,MAAM,cAAc,CAAA;AAC7D,EAAA,MAAM,aAAA,GAAgB;AAAA,IACpB,GAAG,KAAA,CAAM,eAAA;AAAA,IACT,GAAG,KAAA,CAAM;AAAA,GACX;AAEA,EAAA,KAAA,MAAW,CAAC,YAAA,EAAc,OAAO,CAAA,IAAK,WAAA,CAAY,SAAQ,EAAG;AAC3D,IAAA,MAAM,SAAA,GAAY,cAAc,YAAY,CAAA;AAC5C,IAAA,MAAM,SAAA,GAAY,oBAAA;AAAA,MAChB,OAAA;AAAA,MACA,WAAA;AAAA,MACA,OAAA;AAAA,MACA;AAAA,KACF;AACA,IAAA,IAAA,CAAK,IAAA,CAAKN,qBAAA,CAAA,CAAA,EAAO,SAAS,CAAA,CAAA,CAAG,CAAA;AAAA,EAC/B;AAEA,EAAA,OAAO,EAAE,IAAA,EAAK;AAChB;AAEO,SAAS,oBAAA,CACd,KAAA,EACA,OAAA,EACA,WAAA,EACA,YAAA,EACmB;AACnB,EAAA,MAAM,OAAA,GAAU,WAAW,OAAO,CAAA;AAClC,EAAA,MAAM,OAAsB,EAAC;AAE7B,EAAA,KAAA,MAAW,UAAU,mBAAA,CAAoB,KAAA,CAAM,KAAA,EAAO,KAAA,CAAM,SAAS,CAAA,EAAG;AACtE,IAAA,IAAA,CAAK,IAAA,CAAK,YAAA,CAAa,MAAM,CAAC,CAAA;AAAA,EAChC;AAEA,EAAA,MAAM,cAAc,CAAC,GAAG,MAAM,MAAA,EAAQ,GAAG,MAAM,cAAc,CAAA;AAC7D,EAAA,MAAM,aAAA,GAAgB;AAAA,IACpB,GAAG,KAAA,CAAM,eAAA;AAAA,IACT,GAAG,KAAA,CAAM;AAAA,GACX;AAEA,EAAA,KAAA,MAAW,CAAC,YAAA,EAAc,OAAO,CAAA,IAAK,WAAA,CAAY,SAAQ,EAAG;AAC3D,IAAA,MAAM,SAAA,GAAY,cAAc,YAAY,CAAA;AAC5C,IAAA,MAAM,SAAA,GAAY,oBAAA;AAAA,MAChB,OAAA;AAAA,MACA,WAAA;AAAA,MACA,OAAA;AAAA,MACA;AAAA,KACF;AACA,IAAA,IAAA,CAAK,IAAA,CAAKA,qBAAA,CAAA,CAAA,EAAO,SAAS,CAAA,CAAA,CAAG,CAAA;AAAA,EAC/B;AAEA,EAAA,OAAO,EAAE,IAAA,EAAK;AAChB;AAYO,SAAS,yBAAA,CACd,OACA,GAAA,EACwB;AACxB,EAAA,MAAM,OAAA,GAAU,UAAA,CAAW,GAAA,CAAI,OAAO,CAAA;AACtC,EAAA,MAAM,OAAsB,EAAC;AAC7B,EAAA,KAAA,MAAW,CAAC,QAAA,EAAU,OAAO,KAAK,KAAA,CAAM,MAAA,CAAO,SAAQ,EAAG;AACxD,IAAA,MAAM,SAAA,GAAY,oBAAA;AAAA,MAChB,OAAA;AAAA,MACA,GAAA,CAAI,WAAA;AAAA,MACJ,OAAA;AAAA,MACA,KAAA,CAAM,gBAAgB,QAAQ;AAAA,KAChC;AACA,IAAA,IAAA,CAAK,IAAA,CAAKA,qBAAA,CAAA,CAAA,EAAO,SAAS,CAAA,CAAA,CAAG,CAAA;AAAA,EAC/B;AACA,EAAA,OAAO,IAAA;AACT;AAEA,SAAS,oBAAA,CACP,OAAA,EACA,WAAA,EACA,OAAA,EACA,SAAA,EACa;AACb,EAAA,QAAQ,SAAA;AAAW,IACjB,KAAK,QAAA,EAAU;AACb,MAAA,OAAO,OAAA,CAAQ,iBAAA,CAAkB,WAAA,EAAa,OAAO,CAAA;AAAA,IACvD;AAAA,IACA,KAAK,SAAA,EAAW;AACd,MAAA,OAAO,OAAA,CAAQ,kBAAA,CAAmB,WAAA,EAAa,OAAO,CAAA;AAAA,IACxD;AAAA,IACA,KAAK,MAAA,EAAQ;AACX,MAAA,OAAO,OAAA,CAAQ,eAAA,CAAgB,WAAA,EAAa,OAAO,CAAA;AAAA,IACrD;AAAA,IACA,KAAK,QAAA;AAAA,IACL,KAAK,SAAA;AAAA,IACL,KAAK,MAAA,EAAW;AACd,MAAA,OAAO,OAAA,CAAQ,eAAA,CAAgB,WAAA,EAAa,OAAO,CAAA;AAAA,IACrD;AAAA,IACA,KAAK,OAAA;AAAA,IACL,KAAK,QAAA;AAAA,IACL,KAAK,WAAA,EAAa;AAGhB,MAAA,OAAO,OAAA,CAAQ,WAAA,CAAY,WAAA,EAAa,OAAO,CAAA;AAAA,IACjD;AAAA;AAEJ;AAEO,SAAS,oBACd,KAAA,EAC6B;AAC7B,EAAA,QAAQ,KAAA;AAAO,IACb,KAAK,cAAA,EAAgB;AACnB,MAAA,OAAO,CAAC,YAAY,MAAM,CAAA;AAAA,IAC5B;AAAA,IACA,KAAK,OAAA,EAAS;AACZ,MAAA,OAAO,CAAC,UAAU,CAAA;AAAA,IACpB;AAAA,IACA,KAAK,MAAA,EAAQ;AACX,MAAA,OAAO,EAAC;AAAA,IACV;AAAA;AAEJ;AAEA,SAAS,mBAAA,CACP,OACA,SAAA,EAC6B;AAC7B,EAAA,MAAM,IAAA,GACJ,KAAA,KAAU,cAAA,GAAkB,CAAC,UAAA,EAAY,MAAM,CAAA,GAC7C,KAAA,KAAU,OAAA,GAAW,CAAC,UAAU,CAAA,GAC/B,EAAC;AAEN,EAAA,IAAI,cAAc,KAAA,EAAO;AACvB,IAAA,OAAO,CAAC,GAAG,IAAA,EAAM,SAAS,CAAA;AAAA,EAC5B;AACA,EAAA,IAAI,cAAc,IAAA,EAAM;AACtB,IAAA,OAAO,CAAC,GAAG,IAAA,EAAM,OAAO,CAAA;AAAA,EAC1B;AACA,EAAA,OAAO,CAAC,GAAG,IAAI,CAAA;AACjB;AAMA,SAAS,wBACP,KAAA,EACuC;AACvC,EAAA,OAAO,KAAA,CAAM,QAAQ,KAAK,CAAA;AAC5B;AAEO,SAAS,iBAAA,CACd,KACA,UAAA,EACa;AACb,EAAA,QAAQ,WAAW,MAAA;AAAQ,IACzB,KAAK,iBAAA,EAAmB;AACtB,MAAA,OAAOA,yBAAOA,qBAAA,CAAI,IAAA;AAAA,QAChB,UAAA,CAAW,WAAW,GAAA,CAAI,CAAC,MAAM,iBAAA,CAAkB,GAAA,EAAK,CAAC,CAAC,CAAA;AAAA,QAC1DA,qBAAA,CAAA,KAAA;AAAA,OACD,CAAA,CAAA,CAAA;AAAA,IACH;AAAA,IACA,KAAK,gBAAA,EAAkB;AACrB,MAAA,OAAOA,yBAAOA,qBAAA,CAAI,IAAA;AAAA,QAChB,UAAA,CAAW,WAAW,GAAA,CAAI,CAAC,MAAM,iBAAA,CAAkB,GAAA,EAAK,CAAC,CAAC,CAAA;AAAA,QAC1DA,qBAAA,CAAA,IAAA;AAAA,OACD,CAAA,CAAA,CAAA;AAAA,IACH;AAAA,IACA,KAAK,iBAAA,EAAmB;AACtB,MAAA,OAAOA,qBAAA,CAAA,KAAA,EAAW,iBAAA,CAAkB,GAAA,EAAK,UAAA,CAAW,SAAS,CAAC,CAAA,CAAA,CAAA;AAAA,IAChE;AAAA,IACA,KAAK,wBAAA,EAA0B;AAC7B,MAAA,MAAM,OAAA,GAAU,wBAAA,CAAyB,GAAA,EAAK,UAAA,CAAW,OAAO,CAAA;AAChE,MAAA,OAAO,WAAW,EAAA,KAAO,QAAA,GACrBA,wBAAM,OAAO,CAAA,QAAA,CAAA,GACbA,wBAAM,OAAO,CAAA,YAAA,CAAA;AAAA,IACnB;AAAA,IACA,KAAK,wBAAA,EAA0B;AAC7B,MAAA,MAAM,IAAA,GAAO,wBAAA,CAAyB,GAAA,EAAK,UAAA,CAAW,IAAI,CAAA;AAE1D,MAAA,MAAM,QAAQ,UAAA,CAAW,KAAA;AACzB,MAAA,IAAI,uBAAA,CAAwB,KAAK,CAAA,EAAG;AAClC,QAAA,IAAI,UAAA,CAAW,EAAA,KAAO,IAAA,IAAQ,UAAA,CAAW,OAAO,OAAA,EAAS;AACvD,UAAA,MAAM,IAAI,KAAA;AAAA,YACR,CAAA,UAAA,EAAa,WAAW,EAAE,CAAA,wDAAA;AAAA,WAC5B;AAAA,QACF;AACA,QAAA,MAAM,SAAS,KAAA,CAAM,GAAA;AAAA,UAAI,CAAC,OAAA,KACxB,wBAAA,CAAyB,GAAA,CAAI,SAAS,OAAO;AAAA,SAC/C;AACA,QAAA,MAAM,QAAA,GAAW,UAAA,CAAW,EAAA,KAAO,IAAA,GAAOA,qBAAA,CAAA,EAAA,CAAA,GAAUA,qBAAA,CAAA,MAAA,CAAA;AACpD,QAAA,OAAOA,qBAAA,CAAA,EAAM,IAAI,CAAA,CAAA,EAAI,QAAQ,KAAKA,qBAAA,CAAI,IAAA,CAAK,MAAA,EAAQA,qBAAA,CAAA,EAAA,CAAO,CAAC,CAAA,CAAA,CAAA;AAAA,MAC7D;AAEA,MAAA,IAAI,UAAA,CAAW,EAAA,KAAO,IAAA,IAAQ,UAAA,CAAW,OAAO,OAAA,EAAS;AACvD,QAAA,MAAM,IAAI,KAAA;AAAA,UACR,CAAA,UAAA,EAAa,WAAW,EAAE,CAAA,iDAAA;AAAA,SAC5B;AAAA,MACF;AAEA,MAAA,MAAM,YAAA,GAAe,wBAAA,CAAyB,GAAA,CAAI,OAAA,EAAS,KAAK,CAAA;AAChE,MAAA,MAAM,KAAA,GAAQ,yBAAA,CAA0B,UAAA,CAAW,EAAE,CAAA;AACrD,MAAA,OAAOA,qBAAA,CAAA,EAAM,IAAI,CAAA,CAAA,EAAI,KAAK,IAAI,YAAY,CAAA,CAAA;AAAA,IAC5C;AAAA;AAEJ;AAEA,SAAS,wBAAA,CACP,KACA,OAAA,EACa;AACb,EAAA,IAAI,OAAA,CAAQ,WAAW,sBAAA,EAAwB;AAC7C,IAAA,OAAO,GAAA,CAAI,YAAA,CAAa,OAAA,CAAQ,MAAM,CAAA;AAAA,EACxC;AAEA,EAAA,MAAM,OAAA,GAAU,UAAA,CAAW,GAAA,CAAI,OAAO,CAAA;AACtC,EAAA,MAAM,OAAA,GAAUO,6BAAA,CAAY,CAAC,OAAA,CAAQ,KAAK,CAAC,CAAA;AAE3C,EAAA,QAAQ,QAAQ,SAAA;AAAW,IACzB,KAAK,QAAA,EAAU;AACb,MAAA,OAAO,OAAA,CAAQ,iBAAA,CAAkB,GAAA,CAAI,WAAA,EAAa,OAAO,CAAA;AAAA,IAC3D;AAAA,IACA,KAAK,SAAA,EAAW;AACd,MAAA,OAAO,OAAA,CAAQ,kBAAA,CAAmB,GAAA,CAAI,WAAA,EAAa,OAAO,CAAA;AAAA,IAC5D;AAAA,IACA,KAAK,MAAA,EAAQ;AACX,MAAA,OAAO,OAAA,CAAQ,eAAA,CAAgB,GAAA,CAAI,WAAA,EAAa,OAAO,CAAA;AAAA,IACzD;AAAA,IACA,KAAK,OAAA;AAAA,IACL,KAAK,QAAA;AAAA,IACL,KAAK,WAAA,EAAa;AAChB,MAAA,OAAO,OAAA,CAAQ,WAAA,CAAY,GAAA,CAAI,WAAA,EAAa,OAAO,CAAA;AAAA,IACrD;AAAA,IACA,KAAK,QAAA;AAAA,IACL,KAAK,SAAA;AAAA,IACL,KAAK,MAAA,EAAW;AACd,MAAA,OAAO,OAAA,CAAQ,eAAA,CAAgB,GAAA,CAAI,WAAA,EAAa,OAAO,CAAA;AAAA,IACzD;AAAA;AAEJ;AAEA,SAAS,wBAAA,CACP,SACA,OAAA,EACa;AACb,EAAA,QAAQ,QAAQ,SAAA;AAAW,IACzB,KAAK,QAAA;AAAA,IACL,KAAK,MAAA,EAAQ;AACX,MAAA,OAAOP,sBAAI,GAAA,CAAI,mBAAA,CAAoB,QAAQ,KAAA,CAAM,QAAA,EAAU,CAAC,CAAA;AAAA,IAC9D;AAAA,IACA,KAAK,QAAA,EAAU;AACb,MAAA,OAAOA,qBAAA,CAAI,GAAA,CAAI,OAAA,CAAQ,KAAA,CAAM,UAAU,CAAA;AAAA,IACzC;AAAA,IACA,KAAK,SAAA,EAAW;AACd,MAAA,OAAO,UAAA,CAAW,OAAO,CAAA,CAAE,cAAA,CAAe,QAAQ,KAAgB,CAAA;AAAA,IACpE;AAAA,IACA,KAAK,OAAA;AAAA,IACL,KAAK,QAAA;AAAA,IACL,KAAK,WAAA;AAAA,IACL,KAAK,SAAA,EAAW;AACd,MAAA,OAAOA,sBAAI,GAAA,CAAI,mBAAA,CAAoB,QAAQ,KAAA,CAAM,QAAA,EAAU,CAAC,CAAA;AAAA,IAC9D;AAAA;AAEJ;AAIA,SAAS,0BAA0B,EAAA,EAAyC;AAC1E,EAAA,QAAQ,EAAA;AAAI,IACV,KAAK,IAAA,EAAM;AACT,MAAA,OAAOA,qBAAA,CAAA,CAAA,CAAA;AAAA,IACT;AAAA,IACA,KAAK,KAAA,EAAO;AACV,MAAA,OAAOA,qBAAA,CAAA,EAAA,CAAA;AAAA,IACT;AAAA,IACA,KAAK,IAAA,EAAM;AACT,MAAA,OAAOA,qBAAA,CAAA,CAAA,CAAA;AAAA,IACT;AAAA,IACA,KAAK,KAAA,EAAO;AACV,MAAA,OAAOA,qBAAA,CAAA,EAAA,CAAA;AAAA,IACT;AAAA,IACA,KAAK,IAAA,EAAM;AACT,MAAA,OAAOA,qBAAA,CAAA,CAAA,CAAA;AAAA,IACT;AAAA,IACA,KAAK,KAAA,EAAO;AACV,MAAA,OAAOA,qBAAA,CAAA,EAAA,CAAA;AAAA,IACT;AAAA;AAEJ;AAEA,SAAS,oBAAoB,KAAA,EAAuB;AAClD,EAAA,OAAO,CAAA,CAAA,EAAI,KAAA,CAAM,UAAA,CAAW,GAAA,EAAK,IAAI,CAAC,CAAA,CAAA,CAAA;AACxC","file":"chunk-HAQVISUF.cjs","sourcesContent":["/**\n * Unified table-contribution contract (#129).\n *\n * Every table TypeGraph owns — whether modeled as a Drizzle table or\n * emitted as strategy-owned raw DDL — is described by a single\n * {@link TableContribution} shape. This is the one place that answers\n * \"what tables does this backend/strategy own?\", replacing the\n * previously split surfaces (Drizzle named exports, tables-factory\n * recursion, strategy raw DDL, per-table `ensureXTable` methods).\n *\n * Lives in the neutral `backend/` layer (sibling of `backend/types.ts`,\n * which `query/dialect` already depends on) and is deliberately\n * Drizzle-free, so declaring contributions does not pull the concrete\n * Drizzle backend runtime into the query/dialect layer.\n *\n * ## Identity vs. signature (prerequisite for #135)\n *\n * #135 (durable fulltext/contribution materialization) needs to make\n * \"not materialized\" vs. \"materialized but stale\" a decidable, durable\n * fact instead of an in-memory per-backend latch. That requires two\n * conceptually separate things, and #129's job is only to make both\n * *derivable* from the contract:\n *\n * - **Materialization identity** — `owner` + `logicalName` +\n *   resolved physical `tableName`. Keying on `logicalName` alone is\n *   insufficient: custom per-deployment table names must be\n *   distinguishable, otherwise two deployments with different physical\n *   names would collide on one durable marker. (#135 additionally\n *   scopes this by `graphId` at persistence time.)\n * - **Drift signature** — a hash of the strategy identity/version,\n *   the resolved table name(s), and the normalized `createDdl`. #129\n *   guarantees `createDdl` is deterministic for a given resolved\n *   configuration so the hash #135 computes is meaningful.\n *\n * The signature is intentionally **not** eagerly carried on the\n * contribution: hashing is async (Web Crypto, see `utils/hash`) and\n * #135 already owns signature persistence the same way\n * `materializeIndexes` does for declared indexes.\n */\n\n/**\n * `logicalName` of the strategy-owned fulltext slot. Used as a logic\n * discriminant (latch routing, runtime-ensure) across the strategies\n * and both backends — a shared constant so a strategy declaring a\n * different name fails loudly at the call site instead of silently\n * skipping the latched fulltext path.\n */\nexport const FULLTEXT_CONTRIBUTION_NAME = \"fulltext\";\n\n/** `owner` of core/base schema tables (not strategy-owned). */\nexport const BASE_CONTRIBUTION_OWNER = \"base\";\n\n/**\n * A single table TypeGraph owns.\n */\nexport type TableContribution = Readonly<{\n  /**\n   * Stable, graph- and deployment-independent identity for the logical\n   * slot this contribution fills (e.g. `\"fulltext\"`). NOT the physical\n   * table name. Stable across table-name overrides and across strategy\n   * swaps of the *same* logical slot, so #135's durable marker can\n   * survive both.\n   */\n  logicalName: string;\n  /**\n   * Identifies the producer of this contribution (e.g. a strategy id\n   * like `\"tsvector\"` / `\"fts5\"`, or `\"base\"` for core schema tables).\n   * Part of the #135 materialization identity and an input to the\n   * drift signature — a strategy swap on the same `logicalName` is a\n   * legitimate, detectable drift, not a silent reuse.\n   */\n  owner: string;\n  /**\n   * Resolved physical table name after any per-deployment name\n   * override. Part of the #135 materialization identity (custom names\n   * must be distinguishable) and used by diagnostics / the focused\n   * bootstrap ensure.\n   */\n  tableName: string;\n  /**\n   * Idempotent (`CREATE ... IF NOT EXISTS`) statements that\n   * materialize this contribution's table **and its supporting\n   * indexes**. Running the full list is how the runtime ensure\n   * self-heals partial states (table present, index missing) — it is\n   * not a probe-and-skip. Deterministic for a given resolved\n   * configuration: the canonical normalized input to #135's drift\n   * signature.\n   */\n  createDdl: readonly string[];\n  /**\n   * When `true`, the post-schema-load focused ensure\n   * (`loadActiveSchemaWithBootstrap`) materializes this contribution\n   * on every successful schema load.\n   *\n   * **Invariant: only strategy-declared contributions may set this.**\n   * Core/base tables are always `false` — they are created by\n   * drizzle-kit / `bootstrapTables`. This is what lets the boot path\n   * derive runtime contributions straight from the strategy\n   * (`fulltextStrategy.ownedTables`) without walking — and generating\n   * DDL for — every base table.\n   */\n  runtimeEnsure: boolean;\n}>;\n\n/**\n * A table a {@link FulltextStrategy} declares it owns. An alias, not a\n * distinct shape: a strategy's declaration is already authoritative\n * (no resolution step). The name documents the producer role.\n */\nexport type StrategyTableContribution = TableContribution;\n","/**\n * Fulltext Strategy — pluggable DDL + SQL generation for a dialect's\n * fulltext stack. A strategy owns every SQL statement that touches its\n * backing table: DDL, upsert (single + batch), delete (single + batch),\n * MATCH condition, rank expression, and snippet expression.\n *\n * A dialect picks one as its default; `createPostgresBackend` /\n * `createSqliteBackend` accept an override for alternate Postgres stacks\n * (pg_trgm, ParadeDB/pg_search, pgroonga) to swap the entire fulltext\n * pipeline without forking TypeGraph.\n */\nimport {\n  FULLTEXT_CONTRIBUTION_NAME,\n  type StrategyTableContribution,\n} from \"../../backend/table-contribution\";\nimport {\n  type DeleteFulltextBatchParams,\n  type DeleteFulltextParams,\n  type FulltextBatchRow,\n  type FulltextCapabilities,\n  type FulltextQueryMode,\n  type UpsertFulltextBatchParams,\n  type UpsertFulltextParams,\n} from \"../../backend/types\";\nimport { sql, type SqlFragment } from \"../sql-fragment\";\n\n/**\n * Every `FulltextQueryMode` both shipped strategies accept.\n */\nexport const ALL_FULLTEXT_MODES: readonly FulltextQueryMode[] = [\n  \"websearch\",\n  \"phrase\",\n  \"plain\",\n  \"raw\",\n] as const;\n\n/**\n * Derives the `FulltextCapabilities` backends advertise from the active\n * strategy, so the two never drift.\n */\nexport function buildFulltextCapabilities(\n  strategy: FulltextStrategy,\n): FulltextCapabilities {\n  return {\n    supported: true,\n    languages: strategy.languages,\n    phraseQueries: strategy.supportedModes.includes(\"phrase\"),\n    prefixQueries: strategy.supportsPrefix,\n    highlighting: strategy.supportsSnippets,\n  };\n}\n\n/**\n * A pluggable fulltext implementation. Each strategy is expected to be\n * self-contained: given a table name, a query string, and a parse mode,\n * it emits every SQL statement the compiler and backend need — DDL,\n * reads, and writes. No out-of-band conventions across layers.\n */\nexport type FulltextStrategy = Readonly<{\n  /** Human-readable identifier used in error messages and telemetry. */\n  name: string;\n\n  /**\n   * Parse modes this strategy can translate. Callers validate against\n   * this list before emitting SQL; a mode outside the set means the\n   * strategy rejects the query at compile time.\n   */\n  supportedModes: readonly FulltextQueryMode[];\n\n  /**\n   * Whether the strategy can emit a per-row highlighted snippet. When\n   * false, `snippetExpression` returns a literal `NULL` so callers can\n   * leave the `snippet` column in place without a branch.\n   */\n  supportsSnippets: boolean;\n\n  /**\n   * Whether the strategy supports prefix queries (`foo*`). Used to\n   * populate `BackendCapabilities.fulltext.prefixQueries`. A strategy\n   * may support prefix queries via dedicated syntax without advertising\n   * \"raw\" mode (and vice-versa).\n   */\n  supportsPrefix: boolean;\n\n  /**\n   * Whether a per-query `language` override is honored. Postgres' tsvector\n   * accepts any installed regconfig at query time; SQLite FTS5's tokenizer\n   * is fixed at table-create time, so the override is silently ignored.\n   * Callers may surface a warning when the user passes `language` to a\n   * strategy that doesn't honor it.\n   */\n  supportsLanguageOverride: boolean;\n\n  /**\n   * Languages / tokenizer names understood by the strategy. Advisory — a\n   * runtime backend like Postgres may accept other installed regconfigs.\n   * Used to populate `BackendCapabilities.fulltext.languages`.\n   */\n  languages: readonly string[];\n\n  /**\n   * Emits the WHERE-side MATCH expression.\n   *\n   * @example\n   * tsvector: `\"typegraph_node_fulltext\".\"tsv\" @@ websearch_to_tsquery('english', 'cats')`\n   * fts5:     `\"typegraph_node_fulltext\" MATCH '\"cats\"'`\n   */\n  matchCondition: (\n    this: void,\n    tableName: string,\n    query: string,\n    mode: FulltextQueryMode,\n    language?: string,\n  ) => SqlFragment;\n\n  /**\n   * Emits the relevance expression. Higher values = more relevant. The\n   * compiler orders by this expression DESC, and both builder and\n   * backend-direct paths use the same form so their top-k results agree.\n   */\n  rankExpression: (\n    this: void,\n    tableName: string,\n    query: string,\n    mode: FulltextQueryMode,\n    language?: string,\n  ) => SqlFragment;\n\n  /**\n   * Emits a per-row highlighted snippet expression, or `NULL` when\n   * `supportsSnippets` is false. Snippet markup is `<mark>…</mark>` in\n   * both shipped strategies so consumers can apply one stylesheet.\n   */\n  snippetExpression: (\n    this: void,\n    tableName: string,\n    query: string,\n    mode: FulltextQueryMode,\n    language?: string,\n  ) => SqlFragment;\n\n  /**\n   * The tables this strategy owns, as Drizzle-free, already\n   * authoritative `TableContribution`s (`logicalName`, `owner`,\n   * resolved `tableName`, idempotent `createDdl` for the table **and\n   * its supporting indexes**, `runtimeEnsure`). A strategy never\n   * constructs a Drizzle table itself; drizzle-kit visibility, when\n   * applicable, is the schema barrel's responsibility (the default\n   * Postgres strategy's `schema/postgres.ts` exports a matching\n   * `tables.fulltext` — a non-default strategy must export its own).\n   *\n   * Replaces the former `generateDdl(tableName)`: DDL is now one field\n   * of a contribution rather than the strategy's whole storage\n   * surface. (Public API change — see #129.)\n   */\n  ownedTables: (\n    this: void,\n    primaryTableName: string,\n  ) => readonly StrategyTableContribution[];\n\n  /**\n   * Emits the statements that upsert a single fulltext row. Returns one\n   * or more statements — some backends (SQLite FTS5) cannot emulate\n   * upsert in a single statement and need DELETE + INSERT.\n   */\n  buildUpsert: (\n    this: void,\n    tableName: string,\n    params: UpsertFulltextParams,\n    timestamp: string,\n  ) => readonly SqlFragment[];\n\n  /**\n   * Emits the statements that upsert many fulltext rows at once. Input\n   * rows are expected to be de-duplicated last-write-wins by the\n   * strategy if the underlying SQL statement cannot tolerate duplicate\n   * conflict keys. Returns `[]` when `params.rows` is empty.\n   */\n  buildBatchUpsert: (\n    this: void,\n    tableName: string,\n    params: UpsertFulltextBatchParams,\n    timestamp: string,\n  ) => readonly SqlFragment[];\n\n  /**\n   * Emits the statements that delete a single fulltext row. Normally a\n   * single PK-scoped DELETE, but strategies that maintain auxiliary\n   * indexes (delete-triggered external stores, ParadeDB-style secondary\n   * structures) may need more.\n   */\n  buildDelete: (\n    this: void,\n    tableName: string,\n    params: DeleteFulltextParams,\n  ) => readonly SqlFragment[];\n\n  /**\n   * Emits the statements that delete many fulltext rows at once. Returns\n   * `[]` when `params.nodeIds` is empty.\n   */\n  buildBatchDelete: (\n    this: void,\n    tableName: string,\n    params: DeleteFulltextBatchParams,\n  ) => readonly SqlFragment[];\n}>;\n\n// ============================================================\n// Internal helpers\n// ============================================================\n\nfunction quoteIdentifier(name: string): string {\n  return `\"${name.replaceAll('\"', '\"\"')}\"`;\n}\n\nfunction tsvectorColumn(tableName: string): SqlFragment {\n  return sql`${sql.identifier(tableName)}.\"tsv\"`;\n}\n\n/**\n * Dedupes batch rows last-write-wins by nodeId. Returns a plain array\n * in insertion order of the last occurrence of each id. Shared by both\n * shipped strategies.\n */\nfunction dedupeFulltextBatchRows(\n  rows: readonly FulltextBatchRow[],\n): FulltextBatchRow[] {\n  const seen = new Map<string, FulltextBatchRow>();\n  for (const row of rows) seen.set(row.nodeId, row);\n  return [...seen.values()];\n}\n\nfunction buildPkScopedDelete(\n  tableName: string,\n  params: DeleteFulltextParams,\n): SqlFragment {\n  const table = sql.identifier(tableName);\n  return sql`\n    DELETE FROM ${table}\n    WHERE \"graph_id\" = ${params.graphId}\n      AND \"node_kind\" = ${params.nodeKind}\n      AND \"node_id\" = ${params.nodeId}\n  `;\n}\n\nfunction buildPkScopedBatchDelete(\n  tableName: string,\n  params: DeleteFulltextBatchParams,\n): SqlFragment | undefined {\n  if (params.nodeIds.length === 0) return undefined;\n  const unique = [...new Set(params.nodeIds)];\n  const table = sql.identifier(tableName);\n  return sql`\n    DELETE FROM ${table}\n    WHERE \"graph_id\" = ${params.graphId}\n      AND \"node_kind\" = ${params.nodeKind}\n      AND \"node_id\" IN (${sql.join(\n        unique.map((id) => sql`${id}`),\n        sql`, `,\n      )})\n  `;\n}\n\n// ============================================================\n// tsvector strategy (PostgreSQL built-in)\n// ============================================================\n\nfunction postgresTsquery(\n  mode: FulltextQueryMode,\n  query: string,\n  language: string | undefined,\n): SqlFragment {\n  // The `language` column is already `regconfig`, so the non-override\n  // path references the column directly. The per-query override path\n  // still arrives as a bound text parameter and needs the cast.\n  const langExpr: SqlFragment =\n    language === undefined ? sql`\"language\"` : sql`${language}::regconfig`;\n  switch (mode) {\n    case \"websearch\": {\n      return sql`websearch_to_tsquery(${langExpr}, ${query})`;\n    }\n    case \"phrase\": {\n      return sql`phraseto_tsquery(${langExpr}, ${query})`;\n    }\n    case \"plain\": {\n      return sql`plainto_tsquery(${langExpr}, ${query})`;\n    }\n    case \"raw\": {\n      return sql`to_tsquery(${langExpr}, ${query})`;\n    }\n    default: {\n      const _exhaustive: never = mode;\n      throw new Error(`Unsupported fulltext mode: ${String(_exhaustive)}`);\n    }\n  }\n}\n\nexport const tsvectorStrategy: FulltextStrategy = {\n  name: \"tsvector\",\n  supportedModes: ALL_FULLTEXT_MODES,\n  supportsSnippets: true,\n  // `raw` mode exposes `foo:*` prefix-match syntax to callers.\n  supportsPrefix: true,\n  supportsLanguageOverride: true,\n  // Canonical Postgres stemmers; every stock install ships these plus a\n  // few others. Runtime `to_tsvector` accepts any installed regconfig\n  // name — this list is advisory for capability discovery.\n  languages: [\n    \"simple\",\n    \"english\",\n    \"french\",\n    \"german\",\n    \"italian\",\n    \"portuguese\",\n    \"russian\",\n    \"spanish\",\n    \"swedish\",\n  ] as const,\n\n  matchCondition(tableName, query, mode, language) {\n    const q = postgresTsquery(mode, query, language);\n    return sql`${tsvectorColumn(tableName)} @@ ${q}`;\n  },\n\n  rankExpression(tableName, query, mode, language) {\n    const q = postgresTsquery(mode, query, language);\n    return sql`ts_rank_cd(${tsvectorColumn(tableName)}, ${q})`;\n  },\n\n  snippetExpression(_tableName, query, mode, language) {\n    const langExpr: SqlFragment =\n      language === undefined ? sql`\"language\"` : sql`${language}::regconfig`;\n    const q = postgresTsquery(mode, query, language);\n    return sql`ts_headline(${langExpr}, \"content\", ${q}, 'StartSel=<mark>,StopSel=</mark>,MaxFragments=1,MinWords=5,MaxWords=30,ShortWord=3')`;\n  },\n\n  ownedTables(primaryTableName) {\n    const name = quoteIdentifier(primaryTableName);\n    const gin = quoteIdentifier(`${primaryTableName}_tsv_idx`);\n    const kind = quoteIdentifier(`${primaryTableName}_kind_idx`);\n    // `language` is `regconfig` so `to_tsvector(\"language\", \"content\")`\n    // is an immutable expression — Postgres can then compute `tsv` as a\n    // GENERATED STORED column and own the `content → tsv` invariant.\n    // (The text→regconfig cast happens once at INSERT time against the\n    // bound parameter, which is fine because it's not inside the\n    // generated expression.)\n    const createDdl = [\n      `CREATE TABLE IF NOT EXISTS ${name} (\n  \"graph_id\" TEXT NOT NULL,\n  \"node_kind\" TEXT NOT NULL,\n  \"node_id\" TEXT NOT NULL,\n  \"content\" TEXT NOT NULL,\n  \"language\" regconfig NOT NULL,\n  \"tsv\" tsvector NOT NULL\n    GENERATED ALWAYS AS (to_tsvector(\"language\", \"content\")) STORED,\n  \"updated_at\" TIMESTAMPTZ NOT NULL,\n  PRIMARY KEY (\"graph_id\", \"node_kind\", \"node_id\")\n);`,\n      `CREATE INDEX IF NOT EXISTS ${gin} ON ${name} USING GIN (\"tsv\");`,\n      `CREATE INDEX IF NOT EXISTS ${kind} ON ${name} (\"graph_id\", \"node_kind\");`,\n    ];\n    // drizzle-kit visibility for this default strategy comes from\n    // `schema/postgres.ts` exporting the matching `tables.fulltext`\n    // pgTable through the barrel — one object, not two. `runtimeEnsure`\n    // because drizzle-kit-managed setups create every base table except\n    // this strategy-owned one.\n    return [\n      {\n        logicalName: FULLTEXT_CONTRIBUTION_NAME,\n        owner: \"tsvector\",\n        tableName: primaryTableName,\n        createDdl,\n        runtimeEnsure: true,\n      },\n    ];\n  },\n\n  buildUpsert(tableName, params, timestamp) {\n    const table = sql.identifier(tableName);\n    // `tsv` is a GENERATED STORED column — Postgres computes it from\n    // `content` + `language`, so it must not appear in the column list\n    // or the ON CONFLICT update set.\n    return [\n      sql`\n        INSERT INTO ${table} (\"graph_id\", \"node_kind\", \"node_id\", \"content\", \"language\", \"updated_at\")\n        VALUES (\n          ${params.graphId}, ${params.nodeKind}, ${params.nodeId},\n          ${params.content}, ${params.language}::regconfig,\n          ${timestamp}\n        )\n        ON CONFLICT (\"graph_id\", \"node_kind\", \"node_id\")\n        DO UPDATE SET\n          \"content\" = EXCLUDED.\"content\",\n          \"language\" = EXCLUDED.\"language\",\n          \"updated_at\" = EXCLUDED.\"updated_at\"\n      `,\n    ];\n  },\n\n  buildBatchUpsert(tableName, params, timestamp) {\n    const rows = dedupeFulltextBatchRows(params.rows);\n    if (rows.length === 0) return [];\n\n    const table = sql.identifier(tableName);\n    const valueTuples = rows.map(\n      (row) => sql`\n        (\n              ${params.graphId}, ${params.nodeKind}, ${row.nodeId},\n              ${row.content}, ${row.language}::regconfig,\n              ${timestamp}\n            )\n      `,\n    );\n\n    return [\n      sql`\n        INSERT INTO ${table} (\"graph_id\", \"node_kind\", \"node_id\", \"content\", \"language\", \"updated_at\")\n        VALUES ${sql.join(valueTuples, sql`, `)}\n        ON CONFLICT (\"graph_id\", \"node_kind\", \"node_id\")\n        DO UPDATE SET\n          \"content\" = EXCLUDED.\"content\",\n          \"language\" = EXCLUDED.\"language\",\n          \"updated_at\" = EXCLUDED.\"updated_at\"\n      `,\n    ];\n  },\n\n  buildDelete(tableName, params) {\n    return [buildPkScopedDelete(tableName, params)];\n  },\n\n  buildBatchDelete(tableName, params) {\n    const stmt = buildPkScopedBatchDelete(tableName, params);\n    return stmt === undefined ? [] : [stmt];\n  },\n};\n\n// ============================================================\n// FTS5 strategy (SQLite)\n// ============================================================\n\nfunction translateToFts5Query(query: string, mode: FulltextQueryMode): string {\n  switch (mode) {\n    case \"phrase\": {\n      return `\"${query.replaceAll('\"', '\"\"')}\"`;\n    }\n    case \"plain\": {\n      return query\n        .trim()\n        .split(/\\s+/u)\n        .filter((token) => token.length > 0)\n        .map((token) => `\"${token.replaceAll('\"', '\"\"')}\"`)\n        .join(\" \");\n    }\n    case \"websearch\": {\n      return translateWebsearchToFts5(query);\n    }\n    case \"raw\": {\n      return query;\n    }\n    default: {\n      const _exhaustive: never = mode;\n      throw new Error(`Unsupported fulltext mode: ${String(_exhaustive)}`);\n    }\n  }\n}\n\nfunction translateWebsearchToFts5(query: string): string {\n  const tokens: string[] = [];\n  let index = 0;\n\n  function skipWhitespace(): void {\n    while (index < query.length && /\\s/u.test(query[index] ?? \"\")) {\n      index += 1;\n    }\n  }\n\n  function readPhrase(): string {\n    index += 1;\n    let content = \"\";\n    while (index < query.length && query[index] !== '\"') {\n      content += query[index] ?? \"\";\n      index += 1;\n    }\n    if (query[index] === '\"') index += 1;\n    return `\"${content.replaceAll('\"', '\"\"')}\"`;\n  }\n\n  function readBareTerm(): string {\n    let term = \"\";\n    while (index < query.length && !/\\s/u.test(query[index] ?? \"\")) {\n      term += query[index] ?? \"\";\n      index += 1;\n    }\n    return term;\n  }\n\n  while (index < query.length) {\n    skipWhitespace();\n    if (index >= query.length) break;\n    const ch = query[index];\n    if (ch === '\"') {\n      tokens.push(readPhrase());\n      continue;\n    }\n    if (ch === \"-\") {\n      index += 1;\n      const term =\n        query[index] === '\"' ?\n          readPhrase()\n        : `\"${readBareTerm().replaceAll('\"', '\"\"')}\"`;\n      tokens.push(`NOT ${term}`);\n      continue;\n    }\n    if (ch === \"+\") {\n      index += 1;\n      continue;\n    }\n    const bare = readBareTerm();\n    if (bare.length === 0) continue;\n    if (bare.toUpperCase() === \"OR\") {\n      tokens.push(\"OR\");\n      continue;\n    }\n    tokens.push(`\"${bare.replaceAll('\"', '\"\"')}\"`);\n  }\n\n  if (tokens.length > 0 && tokens[0]?.startsWith(\"NOT \")) {\n    tokens.shift();\n  }\n\n  return tokens.join(\" \");\n}\n\nexport const fts5Strategy: FulltextStrategy = {\n  name: \"fts5\",\n  supportedModes: ALL_FULLTEXT_MODES,\n  supportsSnippets: true,\n  // FTS5 supports `foo*` prefix matching natively.\n  supportsPrefix: true,\n  // FTS5 tokenizer is fixed at table-create time; per-row / per-query\n  // language metadata is stored but not consulted.\n  supportsLanguageOverride: false,\n  // The built-in tokenizer is `porter unicode61 remove_diacritics 2`; the\n  // `language` field on searchable() is recorded for future use but not\n  // applied at query time.\n  languages: [\"porter\", \"unicode61\", \"trigram\"] as const,\n\n  matchCondition(tableName, query, mode, _language) {\n    const matchExpression = translateToFts5Query(query, mode);\n    return sql`${sql.identifier(tableName)} MATCH ${matchExpression}`;\n  },\n\n  rankExpression(tableName, _query, _mode, _language) {\n    // FTS5 bm25() returns a negative score where lower = more relevant.\n    // Negate so callers see higher = better (uniform with tsvector).\n    return sql`-bm25(${sql.identifier(tableName)})`;\n  },\n\n  snippetExpression(tableName, _query, _mode, _language) {\n    return sql`snippet(${sql.identifier(tableName)}, -1, '<mark>', '</mark>', '…', 20)`;\n  },\n\n  ownedTables(primaryTableName) {\n    const name = quoteIdentifier(primaryTableName);\n    // FTS5 virtual tables cannot be modeled as a Drizzle table, so this\n    // contribution is raw-ddl: emitted verbatim and invisible to\n    // drizzle-kit. `runtimeEnsure` because no drizzle-kit-managed setup\n    // can create it.\n    return [\n      {\n        logicalName: FULLTEXT_CONTRIBUTION_NAME,\n        owner: \"fts5\",\n        tableName: primaryTableName,\n        createDdl: [\n          `CREATE VIRTUAL TABLE IF NOT EXISTS ${name} USING fts5(\n  graph_id UNINDEXED,\n  node_kind UNINDEXED,\n  node_id UNINDEXED,\n  language UNINDEXED,\n  updated_at UNINDEXED,\n  content,\n  tokenize='porter unicode61 remove_diacritics 2'\n);`,\n        ],\n        runtimeEnsure: true,\n      },\n    ];\n  },\n\n  buildUpsert(tableName, params, timestamp) {\n    const table = sql.identifier(tableName);\n    // FTS5 virtual tables don't support ON CONFLICT — emulate with\n    // DELETE + INSERT, atomic under the caller's outer transaction.\n    return [\n      sql`\n        DELETE FROM ${table}\n        WHERE \"graph_id\" = ${params.graphId}\n          AND \"node_kind\" = ${params.nodeKind}\n          AND \"node_id\" = ${params.nodeId}\n      `,\n      sql`\n        INSERT INTO ${table} (graph_id, node_kind, node_id, content, language, updated_at)\n        VALUES (${params.graphId}, ${params.nodeKind}, ${params.nodeId}, ${params.content}, ${params.language}, ${timestamp})\n      `,\n    ];\n  },\n\n  buildBatchUpsert(tableName, params, timestamp) {\n    const rows = dedupeFulltextBatchRows(params.rows);\n    if (rows.length === 0) return [];\n\n    const table = sql.identifier(tableName);\n    const nodeIds = rows.map((row) => row.nodeId);\n\n    const deleteStmt = sql`\n      DELETE FROM ${table}\n      WHERE \"graph_id\" = ${params.graphId}\n        AND \"node_kind\" = ${params.nodeKind}\n        AND \"node_id\" IN (${sql.join(\n          nodeIds.map((id) => sql`${id}`),\n          sql`, `,\n        )})\n    `;\n\n    const valueTuples = rows.map(\n      (row) => sql`\n        (\n              ${params.graphId}, ${params.nodeKind}, ${row.nodeId},\n              ${row.content}, ${row.language}, ${timestamp}\n            )\n      `,\n    );\n\n    const insertStmt = sql`\n      INSERT INTO ${table} (graph_id, node_kind, node_id, content, language, updated_at)\n      VALUES ${sql.join(valueTuples, sql`, `)}\n    `;\n\n    return [deleteStmt, insertStmt];\n  },\n\n  buildDelete(tableName, params) {\n    return [buildPkScopedDelete(tableName, params)];\n  },\n\n  buildBatchDelete(tableName, params) {\n    const stmt = buildPkScopedBatchDelete(tableName, params);\n    return stmt === undefined ? [] : [stmt];\n  },\n};\n","/**\n * Vector Strategy — pluggable storage + SQL generation for a backend's\n * vector stack. The sibling of {@link FulltextStrategy}: a strategy owns\n * every statement that touches its embedding storage — the per-field DDL,\n * upsert, delete, similarity search, and (optional) ANN index lifecycle —\n * plus the capability advertisement and the distance/score expressions the\n * query compiler splices into its relevance CTE.\n *\n * ## Why a strategy, and why per-(kind, field) storage\n *\n * The spike behind #157 established that \"real\" ANN on every engine we\n * support converges on a\n * **typed, fixed-dimension structure per `(nodeKind, fieldPath)`**:\n *\n * - pgvector: a `vector(N)` column + HNSW/IVFFlat;\n * - libSQL native: an `F32_BLOB(N)` column + `libsql_vector_idx` +\n *   `vector_top_k` (a plain `BLOB` or dimensionless `F32_BLOB` is rejected\n *   by the index — the dimension must live in the column type);\n * - sqlite-vec: a `vec0(embedding float[N])` virtual table.\n *\n * The legacy single shared `typegraph_node_embeddings` table (one generic\n * column holding mixed-dimension vectors) can only ever be brute-forced;\n * pgvector was the sole engine that hid this, because its index supplies the\n * dimension via a `::vector(N)` cast expression. So storage is the\n * strategy's to own, slot by slot, rather than a fixed global table.\n *\n * Brute force remains a legitimate, capability-advertised mode (libSQL's\n * `vector_distance_cos` over a column with no index, sqlite-vec's\n * `vec_distance_cosine`): a strategy whose `capabilities.indexTypes` is\n * `[\"none\"]` simply never emits an ANN index and `buildSearch` always scans.\n */\nimport { type StrategyTableContribution } from \"../../backend/table-contribution\";\nimport {\n  type DeleteEmbeddingParams,\n  type UpsertEmbeddingBatchParams,\n  type UpsertEmbeddingParams,\n  type VectorCapabilities,\n  type VectorIndexType,\n  type VectorMetric,\n  type VectorSearchParams,\n} from \"../../backend/types\";\nimport { requireDefined } from \"../../utils/presence\";\nimport { sql, type SqlFragment } from \"../sql-fragment\";\n\n/**\n * `logicalName` prefix of a strategy-owned vector slot. Each\n * `(nodeKind, fieldPath)` pair fills one logical vector slot; the full\n * logical name is `${VECTOR_CONTRIBUTION_PREFIX}:${nodeKind}.${fieldPath}`,\n * stable across table-name overrides and strategy swaps so #135's durable\n * materialization marker survives both.\n */\nexport const VECTOR_CONTRIBUTION_PREFIX = \"vector\";\n\n/**\n * The resolved identity of one embedding field's storage in a graph —\n * everything a strategy needs to DDL, address, and index it.\n *\n * Graph-scoped: each `(graphId, nodeKind, fieldPath)` gets its own physical\n * table. TypeGraph supports many graphs per physical database, and the same\n * `(kind, field)` can carry different embedding dimensions across graphs — a\n * shared per-`(kind, field)` table would collide on the fixed column type\n * (`vector(N)` / `F32_BLOB(N)`). Graph-scoping also makes libSQL's\n * table-global `vector_top_k` per-graph-exact (no cross-graph recall bleed).\n */\nexport type VectorSlot = Readonly<{\n  /** Graph the embedding belongs to — scopes the physical table. */\n  graphId: string;\n  /** Node kind owning the embedding field (e.g. `\"Document\"`). */\n  nodeKind: string;\n  /** Dot-path of the embedding field within the node props (e.g. `\"embedding\"`). */\n  fieldPath: string;\n  /** Fixed vector dimension `N` for this field — carried into the column type. */\n  dimensions: number;\n  /** Distance metric the field's index is built for. */\n  metric: VectorMetric;\n  /**\n   * Index type to materialize. `\"none\"` means brute-force only (no ANN\n   * index emitted); the strategy still stores and searches the field.\n   */\n  indexType: VectorIndexType;\n  /**\n   * Optional ANN index tuning carried into the index DDL (pgvector\n   * `m`/`ef_construction`/`lists`). Present on the create-index / re-embed\n   * paths (resolved from the field's `embedding()` declaration); omitted on\n   * the write/search ensure paths, where the strategy falls back to defaults.\n   */\n  indexParams?: Readonly<{\n    m?: number;\n    efConstruction?: number;\n    lists?: number;\n  }>;\n}>;\n\n/**\n * Derives the `VectorCapabilities` a backend advertises from its active\n * strategy, so the two never drift (mirrors `buildFulltextCapabilities`).\n * The strategy is the single source of truth; there are no per-call-site\n * `SQLITE_VECTOR_*` constants.\n */\nexport function buildVectorCapabilities(\n  strategy: VectorStrategy,\n): VectorCapabilities {\n  return strategy.capabilities;\n}\n\n/**\n * A pluggable vector implementation. Each strategy is self-contained:\n * given a {@link VectorSlot}, it emits every statement the backend and\n * compiler need — per-field storage DDL, writes, similarity search, ANN\n * index lifecycle — and advertises exactly the metrics and index types it\n * can honor. Adding the Nth backend is one of these objects; no core edits.\n */\nexport type VectorStrategy = Readonly<{\n  /** Human-readable identifier used in error messages and telemetry. */\n  name: string;\n\n  /**\n   * The metrics, index types, and dimension ceiling this strategy honors —\n   * advertised verbatim as `backend.capabilities.vector`. Asymmetry across\n   * engines is legitimate and explicit here (pgvector has `inner_product`;\n   * libSQL/sqlite-vec do not), never a silent runtime failure.\n   */\n  capabilities: VectorCapabilities;\n\n  /**\n   * Deterministic physical table (or virtual-table) name backing a field in\n   * a graph. The compiler references this to scan the right per-field storage,\n   * and the backend uses it to route upserts/deletes. Must be a stable,\n   * collision-safe SQL identifier derived from `(graphId, nodeKind, fieldPath)`.\n   */\n  tableName: (\n    this: void,\n    graphId: string,\n    nodeKind: string,\n    fieldPath: string,\n  ) => string;\n\n  /**\n   * The per-field storage this strategy owns for `slot`, as Drizzle-free\n   * `StrategyTableContribution`s (resolved `tableName`, deterministic\n   * idempotent `createDdl` for the table **and** its ANN index when the\n   * slot's `indexType` warrants one, `runtimeEnsure`). Rides the #129/#135\n   * table-contribution + durable-materialization machinery exactly as the\n   * FTS5 / tsvector virtual tables do — these are materialized per graph by\n   * `materializeIndexes()`, not by global `bootstrapTables`.\n   */\n  ownedTables: (\n    this: void,\n    slot: VectorSlot,\n  ) => readonly StrategyTableContribution[];\n\n  /**\n   * Emits the statement(s) that upsert a single embedding into the slot's\n   * storage. Multiple statements are allowed for engines that cannot upsert\n   * a vector in one statement (e.g. a `vec0` virtual table → DELETE+INSERT).\n   */\n  buildUpsert: (\n    this: void,\n    slot: VectorSlot,\n    params: UpsertEmbeddingParams,\n    timestamp: string,\n  ) => readonly SqlFragment[];\n\n  /**\n   * Emits the statement(s) that upsert MANY embeddings into the slot's\n   * storage in multi-row form. Optional — the backend falls back to one\n   * {@link buildUpsert} per row when unset. The backend guarantees the\n   * rows carry distinct `nodeId`s and fit the connection's bound-parameter\n   * budget (it chunks before calling).\n   */\n  buildUpsertBatch?: (\n    this: void,\n    slot: VectorSlot,\n    params: UpsertEmbeddingBatchParams,\n    timestamp: string,\n  ) => readonly SqlFragment[];\n\n  /** Emits the statement(s) that delete a single embedding from the slot. */\n  buildDelete: (\n    this: void,\n    slot: VectorSlot,\n    params: DeleteEmbeddingParams,\n  ) => readonly SqlFragment[];\n\n  /**\n   * Raw DDL statement(s) that drop the slot's entire physical storage\n   * (table + ANN index, and any engine-managed shadow tables). Used by the\n   * destructive `store.reembedVectorField()` path to recreate a field's\n   * storage at a new dimension. Returned as raw strings (like\n   * `ownedTables(...).createDdl`) for `backend.executeDdl`; must be idempotent\n   * (`IF EXISTS`).\n   */\n  buildDropStorage: (this: void, slot: VectorSlot) => readonly string[];\n\n  /**\n   * Emits the similarity-search query for the `backend.vectorSearch` path,\n   * returning rows shaped `{ node_id, score }` ordered best-first. The\n   * strategy picks brute-force vs ANN based on whether `slot.indexType`\n   * materialized an index — the caller never branches. `score` follows the\n   * shared convention (cosine → similarity `1 - distance`; l2 /\n   * inner_product → raw distance), so `coerceVectorScore` / fusion stay\n   * dialect-neutral.\n   *\n   * `candidates`, when provided, is a subquery yielding the node ids\n   * eligible to appear in results (the backend passes its live-node-ids\n   * subquery so top-k is computed over live rows in SQL — see\n   * `liveNodeIdsSubquery`). Strategies whose ANN form cannot take the\n   * filter directly must over-fetch and post-filter, documenting the\n   * recall bound. A custom strategy that ignores the argument keeps the\n   * pre-pushdown behavior: tombstoned ids are dropped after top-k during\n   * hydration, so results can shrink below `limit` under index drift.\n   */\n  buildSearch: (\n    this: void,\n    slot: VectorSlot,\n    params: VectorSearchParams,\n    candidates?: SqlFragment,\n  ) => SqlFragment;\n\n  /**\n   * True when {@link buildSearch} returns EXACT rankings — a brute-force\n   * engine form, not an approximate index (sqlite-vec's vec0 KNN scans\n   * every row in C). The query compiler then routes the NON-approximate\n   * `.similarTo()` branch through `buildSearch` too: same results as the\n   * SQL distance scan, at engine speed (measured 489ms -> 113ms at 50k\n   * on the SQLite lane). Leave false/absent when the engine form is or\n   * can be approximate (pgvector planner rewrites, libSQL DiskANN):\n   * exactness of the default path is a semantic guarantee.\n   */\n  searchIsExact?: boolean;\n\n  /**\n   * The distance expression over the slot's embedding column, used by the\n   * **query compiler** to splice vector relevance into its CTE. This is the\n   * one genuinely engine-specific fragment (`vec_distance_cosine` vs\n   * `<=>` vs `vector_distance_cos`); the surrounding score / minScore /\n   * ORDER BY math is shared (see {@link vectorScoreExpression} etc.).\n   *\n   * `embeddingColumn` is the already-qualified column SQL; `queryEmbedding`\n   * is formatted by the strategy into its engine's literal form.\n   */\n  distanceExpression: (\n    this: void,\n    embeddingColumn: SqlFragment,\n    queryEmbedding: readonly number[],\n    metric: VectorMetric,\n  ) => SqlFragment;\n\n  /**\n   * Emits the ANN index creation statement for a slot, or `undefined` when\n   * indexing is inline (vec0) or unsupported (brute-force-only strategies).\n   * Invoked through `backend.createVectorIndex` during `materializeIndexes`.\n   */\n  buildCreateIndex?: (\n    this: void,\n    slot: VectorSlot,\n    options?: Readonly<{ concurrent?: boolean }>,\n  ) => SqlFragment | undefined;\n\n  /** Emits the ANN index drop statement, or `undefined` when not applicable. */\n  buildDropIndex?: (this: void, slot: VectorSlot) => SqlFragment | undefined;\n}>;\n\n// ============================================================\n// Shared, dialect-neutral expression math\n// ============================================================\n//\n// These transforms are identical across pgvector / sqlite-vec / libSQL —\n// only `distanceExpression` differs — so they live once here and are reused\n// by both `buildSearch` implementations and the compiler CTE builder.\n\n/**\n * Converts a distance expression into a score expression (higher = better).\n * Cosine distance is mapped to similarity (`1 - d`); l2 and inner_product\n * are returned as-is (lower distance already ranks better, ordered ASC).\n */\nexport function vectorScoreExpression(\n  distanceExpression: SqlFragment,\n  metric: VectorMetric,\n): SqlFragment {\n  switch (metric) {\n    case \"cosine\": {\n      return sql`(1 - (${distanceExpression}))`;\n    }\n    case \"l2\":\n    case \"inner_product\": {\n      return distanceExpression;\n    }\n    default: {\n      const _exhaustive: never = metric;\n      throw new Error(`Unsupported vector metric: ${String(_exhaustive)}`);\n    }\n  }\n}\n\n/**\n * Builds the `minScore` WHERE condition against a distance expression,\n * translating the score threshold back into the metric's distance space.\n */\nexport function vectorMinScoreCondition(\n  distanceExpression: SqlFragment,\n  metric: VectorMetric,\n  minScore: number,\n): SqlFragment {\n  // Validate against the RESOLVED metric — both the compiler's relevance CTE\n  // and the backend search path funnel here, so an out-of-range floor (e.g. a\n  // cosine minScore of 5 → `distance <= 1 - 5`, which matches nothing) is\n  // rejected loudly instead of silently returning zero rows.\n  assertVectorMinScore(minScore, metric);\n  switch (metric) {\n    case \"cosine\": {\n      return sql`${distanceExpression} <= ${1 - minScore}`;\n    }\n    case \"l2\": {\n      return sql`${distanceExpression} <= ${minScore}`;\n    }\n    case \"inner_product\": {\n      return sql`${distanceExpression} <= ${-minScore}`;\n    }\n    default: {\n      const _exhaustive: never = metric;\n      throw new Error(`Unsupported vector metric: ${String(_exhaustive)}`);\n    }\n  }\n}\n\n/**\n * Validates that every value in an embedding is a finite number. Shared by\n * strategies so a NaN/Infinity is reported with the offending index before\n * it reaches engine-specific literal formatting (which would mask it).\n */\nexport function assertFiniteEmbedding(\n  embedding: readonly number[],\n  name: string,\n): void {\n  for (const [index, value] of embedding.entries()) {\n    if (typeof value !== \"number\" || !Number.isFinite(value)) {\n      throw new TypeError(\n        `${name}[${index}] must be a finite number, got: ${value}`,\n      );\n    }\n  }\n}\n\n/**\n * Validates a vector-search `limit` is a positive integer. Enforced by the\n * backend's `vectorSearch` (defense in depth — the store boundary also\n * checks) so a direct backend call with `limit: 0` fails loudly instead of\n * silently scanning nothing.\n */\nexport function assertVectorSearchLimit(limit: number): void {\n  if (!Number.isInteger(limit) || limit <= 0) {\n    throw new RangeError(\n      `vectorSearch limit must be a positive integer, got: ${limit}`,\n    );\n  }\n}\n\n/**\n * Validates a `minScore` floor against its (resolved) metric: it must be finite,\n * and for cosine it must lie in [-1, 1] (a cosine score is the `1 - distance`\n * similarity). Shared by the store facade, the compiler's relevance CTE\n * ({@link vectorMinScoreCondition}), and the backend search path so every entry\n * point rejects the same out-of-range floor instead of silently returning none.\n */\nexport function assertVectorMinScore(\n  minScore: number,\n  metric: VectorMetric,\n  label = \"minScore\",\n): void {\n  if (!Number.isFinite(minScore)) {\n    throw new RangeError(`${label} must be a finite number, got: ${minScore}`);\n  }\n  if (metric === \"cosine\" && Math.abs(minScore) > 1) {\n    throw new RangeError(\n      `${label} for the cosine metric must be between -1 and 1, got: ${minScore}`,\n    );\n  }\n}\n\n// ============================================================\n// Shared physical naming\n// ============================================================\n\n/**\n * pgvector inherits Postgres' 63-byte identifier ceiling; SQLite/libSQL are\n * far more generous, so the smallest common cap keeps one naming scheme\n * across every strategy.\n */\nconst MAX_VECTOR_IDENTIFIER_LENGTH = 63;\n\nfunction sanitizeIdentifierPart(value: string): string {\n  return value.toLowerCase().replaceAll(/[^a-z0-9_]/g, \"_\");\n}\n\n/**\n * Deterministic 8-char hash for collision-safe truncation of over-long\n * identifiers. Self-contained so the strategy layer has no backend-runtime\n * dependency.\n */\nexport function shortHash(input: string): string {\n  let h1 = 0xde_ad_be_ef;\n  let h2 = 0x41_c6_ce_57;\n  for (let index = 0; index < input.length; index++) {\n    const ch = requireDefined(input.codePointAt(index));\n    h1 = Math.imul(h1 ^ ch, 0x9e_37_79_b1);\n    h2 = Math.imul(h2 ^ ch, 0x5f_35_64_95);\n  }\n  h1 =\n    Math.imul(h1 ^ (h1 >>> 16), 0x85_eb_ca_6b) ^\n    Math.imul(h2 ^ (h2 >>> 13), 0xc2_b2_ae_35);\n  h2 =\n    Math.imul(h2 ^ (h2 >>> 16), 0x85_eb_ca_6b) ^\n    Math.imul(h1 ^ (h1 >>> 13), 0xc2_b2_ae_35);\n  const hi = (h2 >>> 0).toString(16).padStart(8, \"0\");\n  const lo = (h1 >>> 0).toString(16).padStart(8, \"0\");\n  return `${hi}${lo}`.slice(0, 8);\n}\n\n/**\n * Deterministic per-`(graphId, nodeKind, fieldPath)` physical name. Shared by\n * every strategy's `tableName`, by index naming, and by the compiler's\n * per-field table resolution so all three agree on which physical object backs\n * a field in a graph. Truncated with a hash suffix past the 63-char ceiling;\n * the hash covers all three parts, so truncation stays collision-safe even\n * when long graph ids dominate the prefix.\n *\n * @example `vectorPhysicalName(\"tg_vec\", \"g1\", \"Document\", \"embedding\")`\n *          → `\"tg_vec_g1_document_embedding_<hash8>\"`\n */\nexport function vectorPhysicalName(\n  prefix: string,\n  graphId: string,\n  nodeKind: string,\n  fieldPath: string,\n): string {\n  const readable = `${prefix}_${sanitizeIdentifierPart(graphId)}_${sanitizeIdentifierPart(nodeKind)}_${sanitizeIdentifierPart(fieldPath)}`;\n  // Always suffix a hash of the EXACT (graphId, nodeKind, fieldPath) tuple.\n  // Sanitization is lossy (case-folding, every non-`[a-z0-9_]` char → `_`) and\n  // the `_` join is ambiguous, so distinct fields can share a readable part —\n  // e.g. (\"a_b\",\"c\") vs (\"a\",\"b_c\"), or \"Doc-A\" vs \"Doc_A\" vs \"doc\". The hash\n  // keeps their physical tables distinct so writes/searches never cross fields.\n  const hash = shortHash(JSON.stringify([graphId, nodeKind, fieldPath]));\n  const full = `${readable}_${hash}`;\n  if (full.length <= MAX_VECTOR_IDENTIFIER_LENGTH) return full;\n  // Over the ceiling: truncate the readable part, always keep the hash.\n  return `${readable.slice(0, MAX_VECTOR_IDENTIFIER_LENGTH - 1 - hash.length)}_${hash}`;\n}\n\n/**\n * Double-quote a SQL identifier, escaping embedded quotes. Dialect-neutral\n * (both SQLite and Postgres use `\"...\"`), so the three vector strategies share\n * one implementation for quoting their per-field table / index names.\n */\nexport function quoteIdentifier(name: string): string {\n  return `\"${name.replaceAll('\"', '\"\"')}\"`;\n}\n","/**\n * PostgreSQL Dialect Adapter\n *\n * Implements dialect-specific SQL generation for PostgreSQL databases.\n * Uses PostgreSQL's native JSONB operators for JSON operations.\n */\nimport { type JsonPointer, parseJsonPointer } from \"../json-pointer\";\nimport { sql, type SqlFragment } from \"../sql-fragment\";\nimport { tsvectorStrategy } from \"./fulltext-strategy\";\nimport { likeEscapeClause } from \"./like-escape\";\nimport { getSqlDialectProfile, inlineSqlStringLiteral } from \"./profile\";\nimport { type DialectAdapter } from \"./types\";\n\n/**\n * Escapes a string for use in a PostgreSQL string literal, independent of\n * server configuration.\n *\n * A plain `'…'` literal is only safe when the value contains no backslash:\n * under the legacy `standard_conforming_strings = off` setting, backslashes\n * act as escape characters inside regular literals, so a value ending in\n * `\\` could swallow the closing quote and change how the statement parses.\n * Values containing a backslash therefore use the `E'…'` form — where\n * backslash is an escape character under BOTH settings — with backslashes\n * and quotes doubled. Backslash-free values keep the plain form so the\n * emitted SQL text (which callers rely on being identical across clauses)\n * is unchanged for the common case.\n */\n/**\n * Converts a JSON pointer to PostgreSQL's text array path.\n *\n * Uses raw SQL (non-parameterized) to ensure the same expression text\n * is generated when the same field is used in multiple clauses (SELECT, GROUP BY).\n * Pointers usually come from schema definitions, but some (e.g. a weighted\n * traversal's `weightProperty`) are runtime strings — safe either way\n * because the shared PostgreSQL literal renderer escapes independently of server\n * configuration.\n *\n * @example\n * \"/name\" → ARRAY['name']\n * \"/items/0\" → ARRAY['items', '0']\n * \"/a/b/c\" → ARRAY['a', 'b', 'c']\n */\nfunction toPostgresPath(pointer: JsonPointer): SqlFragment {\n  if (!pointer || pointer === \"\" || pointer === \"/\") {\n    return sql.raw(\"ARRAY[]::text[]\");\n  }\n\n  const segments = parseJsonPointer(pointer);\n  if (segments.length === 0) {\n    return sql.raw(\"ARRAY[]::text[]\");\n  }\n\n  // Use raw SQL for path segments to ensure identical SQL text\n  // when the same field is used in multiple clauses (e.g., SELECT and GROUP BY)\n  const escapedSegments = segments\n    .map((segment) => inlineSqlStringLiteral(segment, \"postgres\"))\n    .join(\", \");\n  return sql.raw(`ARRAY[${escapedSegments}]`);\n}\n\n/**\n * PostgreSQL dialect adapter implementation.\n */\nexport const postgresDialect: DialectAdapter = {\n  name: \"postgres\",\n  capabilities: {\n    standardQueryStrategy: \"cte_project\",\n    recursiveQueryStrategy: \"recursive_cte\",\n    materializeIntermediateTraversalCtes: false,\n    emitNotMaterializedHint: true,\n    forceRecursiveWorktableOuterJoinOrder: false,\n    vectorPredicateStrategy: \"native\",\n    vectorMetrics: [\"cosine\", \"l2\", \"inner_product\"] as const,\n    supportsFulltext: true,\n  },\n\n  binaryText(expression) {\n    return sql`${expression} COLLATE \"C\"`;\n  },\n\n  analyzeTemporaryTable(table) {\n    return sql`ANALYZE ${table}`;\n  },\n\n  setTransactionWorkingMemory(workingMemory) {\n    // The parameterizable form of `SET LOCAL work_mem`: is_local => true\n    // scopes the override to the current transaction, matching the pgvector\n    // iterative-scan GUC handling elsewhere in the backend.\n    return sql`SELECT set_config('work_mem', ${workingMemory}, true)`;\n  },\n\n  // ============================================================\n  // JSON Path Operations\n  // ============================================================\n\n  compilePath(pointer) {\n    return toPostgresPath(pointer);\n  },\n\n  jsonExtract(column, pointer) {\n    // #> returns JSONB value at path\n    const path = toPostgresPath(pointer);\n    return sql`${column} #> ${path}`;\n  },\n\n  jsonExtractText(column, pointer) {\n    // #>> returns text value at path\n    const path = toPostgresPath(pointer);\n    return sql`${column} #>> ${path}`;\n  },\n\n  jsonExtractNumber(column, pointer) {\n    // Extract as text then cast to numeric\n    const path = toPostgresPath(pointer);\n    return sql`(${column} #>> ${path})::numeric`;\n  },\n\n  jsonExtractDouble(column, pointer) {\n    // float8, not ::numeric — decimal arithmetic would diverge from\n    // SQLite's binary doubles when values accumulate.\n    const path = toPostgresPath(pointer);\n    return sql`(${column} #>> ${path})::double precision`;\n  },\n\n  jsonExtractBoolean(column, pointer) {\n    // Extract as text then cast to boolean\n    const path = toPostgresPath(pointer);\n    return sql`(${column} #>> ${path})::boolean`;\n  },\n\n  jsonExtractDate(column, pointer) {\n    // Extract as text then cast to timestamptz\n    const path = toPostgresPath(pointer);\n    return sql`(${column} #>> ${path})::timestamptz`;\n  },\n\n  // ============================================================\n  // JSON Array Operations\n  // ============================================================\n\n  jsonArrayLength(column) {\n    return sql`jsonb_array_length(${column})`;\n  },\n\n  jsonArrayContains(column, value) {\n    // @> checks if left contains right\n    const jsonValue = JSON.stringify([value]);\n    return sql`${column} @> ${jsonValue}::jsonb`;\n  },\n\n  jsonArrayContainsAll(column, values) {\n    if (values.length === 0) {\n      return sql.raw(\"1=1\");\n    }\n\n    // @> with full array checks all values\n    const jsonValue = JSON.stringify(values);\n    return sql`${column} @> ${jsonValue}::jsonb`;\n  },\n\n  jsonArrayContainsAny(column, values) {\n    if (values.length === 0) {\n      return sql.raw(\"1=0\");\n    }\n\n    // Check each value with @> and OR them together\n    // PostgreSQL doesn't have a native \"overlaps\" for jsonb arrays\n    const conditions = values.map((value) => {\n      const jsonValue = JSON.stringify([value]);\n      return sql`${column} @> ${jsonValue}::jsonb`;\n    });\n    return sql`(${sql.join(conditions, sql` OR `)})`;\n  },\n\n  // ============================================================\n  // JSON Object Operations\n  // ============================================================\n\n  jsonHasPath(column, pointer) {\n    const path = toPostgresPath(pointer);\n    return sql`${column} #> ${path} IS NOT NULL`;\n  },\n\n  jsonPathIsNull(column, pointer) {\n    const path = toPostgresPath(pointer);\n    // Type-based, not the `#>> path = 'null'` text comparison this used to\n    // be: `#>>` renders a JSON null as SQL NULL (making the old form\n    // three-valued, so `.pathIsNull()` silently missed stored JSON nulls) and\n    // renders the JSON *string* \"null\" as the same text 'null' (falsely\n    // matching it). jsonb_typeof distinguishes both, and COALESCE maps a\n    // missing path to TRUE, keeping the predicate two-valued.\n    return sql`COALESCE(jsonb_typeof(${column} #> ${path}) = 'null', TRUE)`;\n  },\n\n  jsonPathIsNumber(column, pointer) {\n    const path = toPostgresPath(pointer);\n    // jsonb_typeof returns NULL for a missing path; COALESCE keeps the\n    // predicate two-valued so negations don't silently drop rows.\n    return sql`COALESCE(jsonb_typeof(${column} #> ${path}) = 'number', FALSE)`;\n  },\n\n  jsonPathIsNotNull(column, pointer) {\n    const path = toPostgresPath(pointer);\n    // Mirror image of jsonPathIsNull; COALESCE maps a missing path to FALSE.\n    return sql`COALESCE(jsonb_typeof(${column} #> ${path}) <> 'null', FALSE)`;\n  },\n\n  // ============================================================\n  // Comparison Operations\n  // ============================================================\n\n  nullSafeEquals(left, right) {\n    return sql`${left} IS NOT DISTINCT FROM ${right}`;\n  },\n\n  inList(left, values, negated) {\n    const operator = negated ? sql.raw(\"NOT IN\") : sql.raw(\"IN\");\n    const placeholders = values.map((value) => sql`${value}`);\n    return sql`${left} ${operator} (${sql.join(placeholders, sql`, `)})`;\n  },\n\n  // ============================================================\n  // String Operations\n  // ============================================================\n\n  ilike(column, pattern) {\n    // PostgreSQL has native ILIKE operator. Declaring backslash as the escape\n    // character is a no-op (it is the LIKE default) but keeps the emitted SQL\n    // identical in intent to SQLite, which has no default escape character.\n    return sql`${column} ILIKE ${pattern} ${likeEscapeClause}`;\n  },\n\n  // ============================================================\n  // Set Operations\n  // ============================================================\n\n  wrapSetOperationOperand(inner) {\n    // PostgreSQL allows a complete SELECT (incl. its own WITH) as a\n    // parenthesized compound operand.\n    return sql`(${inner})`;\n  },\n\n  // ============================================================\n  // Recursive CTE Path Operations\n  // ============================================================\n\n  initializePath(nodeId) {\n    // PostgreSQL uses text arrays: ARRAY[id]\n    return sql`ARRAY[${nodeId}]`;\n  },\n\n  extendPath(currentPath, nodeId) {\n    // Array concatenation: path || id\n    return sql`${currentPath} || ${nodeId}`;\n  },\n\n  cycleCheck(nodeId, path) {\n    // Check that id is NOT in array path\n    // Returns TRUE if no cycle (id not in array)\n    return sql`${nodeId} != ALL(${path})`;\n  },\n\n  // ============================================================\n  // Value Binding & Literals\n  // ============================================================\n\n  bindValue(value) {\n    return getSqlDialectProfile(\"postgres\").bindValue(value);\n  },\n\n  booleanLiteral(value) {\n    return sql.raw(\n      getSqlDialectProfile(\"postgres\").booleanLiteralString(value),\n    );\n  },\n\n  booleanLiteralString(value) {\n    return getSqlDialectProfile(\"postgres\").booleanLiteralString(value);\n  },\n\n  quoteIdentifier(name) {\n    // PostgreSQL uses double quotes, escape embedded quotes by doubling\n    return `\"${name.replaceAll('\"', '\"\"')}\"`;\n  },\n\n  // ============================================================\n  // Vector Operations\n  // ============================================================\n\n  // Compile-time gate for `field.similarTo(...)`; the active\n  // `VectorStrategy` (pgvector) owns the distance SQL.\n  supportsVectors: true,\n\n  // ============================================================\n  // Fulltext Operations\n  // ============================================================\n\n  fulltext: tsvectorStrategy,\n};\n","/**\n * SQLite Dialect Adapter\n *\n * Implements dialect-specific SQL generation for SQLite databases.\n * Uses SQLite's JSON1 extension for JSON operations.\n */\nimport { type JsonPointer, parseJsonPointer } from \"../json-pointer\";\nimport { sql } from \"../sql-fragment\";\nimport { fts5Strategy } from \"./fulltext-strategy\";\nimport { likeEscapeClause } from \"./like-escape\";\nimport { getSqlDialectProfile } from \"./profile\";\nimport { type DialectAdapter } from \"./types\";\n\n/**\n * Escapes a string for use in a SQLite string literal.\n * SQLite uses single quotes and escapes embedded single quotes by doubling them.\n */\nfunction escapeSqliteLiteral(value: string): string {\n  return `'${value.replaceAll(\"'\", \"''\")}'`;\n}\n\n/**\n * Converts a JSON pointer to SQLite's JSON path syntax.\n *\n * @example\n * \"/name\" → \"$.\\\"name\\\"\"\n * \"/items/0\" → \"$.\\\"items\\\"[0]\"\n * \"/a/b/c\" → \"$.\\\"a\\\".\\\"b\\\".\\\"c\\\"\"\n */\nfunction toSqlitePath(pointer: JsonPointer): string {\n  if (!pointer || pointer === \"\" || pointer === \"/\") {\n    return \"$\";\n  }\n\n  const segments = parseJsonPointer(pointer);\n  const parts: string[] = [\"$\"];\n\n  for (const segment of segments) {\n    if (isArrayIndex(segment)) {\n      parts.push(`[${segment}]`);\n    } else {\n      // Quote the key to handle special characters\n      parts.push(`.${JSON.stringify(segment)}`);\n    }\n  }\n\n  return parts.join(\"\");\n}\n\n/**\n * Checks if a JSON pointer segment is an array index.\n */\nfunction isArrayIndex(segment: string): boolean {\n  return /^\\d+$/.test(segment);\n}\n\n/**\n * SQLite dialect adapter implementation.\n */\nexport const sqliteDialect: DialectAdapter = {\n  name: \"sqlite\",\n  capabilities: {\n    standardQueryStrategy: \"cte_project\",\n    recursiveQueryStrategy: \"recursive_cte\",\n    materializeIntermediateTraversalCtes: true,\n    emitNotMaterializedHint: false,\n    forceRecursiveWorktableOuterJoinOrder: true,\n    vectorPredicateStrategy: \"native\",\n    vectorMetrics: [\"cosine\", \"l2\"] as const,\n    supportsFulltext: true,\n  },\n\n  binaryText(expression) {\n    return expression;\n  },\n\n  analyzeTemporaryTable(): undefined {\n    return;\n  },\n\n  setTransactionWorkingMemory(): undefined {\n    // SQLite has no per-transaction working-memory budget to raise.\n    return;\n  },\n\n  // ============================================================\n  // JSON Path Operations\n  // ============================================================\n\n  compilePath(pointer) {\n    // Use raw SQL to ensure the path is a literal, which allows expression\n    // indexes on json_extract(...) to be used by the query planner.\n    return sql.raw(escapeSqliteLiteral(toSqlitePath(pointer)));\n  },\n\n  jsonExtract(column, pointer) {\n    const path = toSqlitePath(pointer);\n    return sql`json_extract(${column}, ${sql.raw(escapeSqliteLiteral(path))})`;\n  },\n\n  jsonExtractText(column, pointer) {\n    // SQLite's json_extract returns the native JSON type, which works\n    // for text comparisons. For explicit text, we use the same function.\n    const path = toSqlitePath(pointer);\n    return sql`json_extract(${column}, ${sql.raw(escapeSqliteLiteral(path))})`;\n  },\n\n  jsonExtractNumber(column, pointer) {\n    // SQLite json_extract returns numbers natively when the value is numeric\n    const path = toSqlitePath(pointer);\n    return sql`json_extract(${column}, ${sql.raw(escapeSqliteLiteral(path))})`;\n  },\n\n  jsonExtractDouble(column, pointer) {\n    // json_extract already yields INTEGER/REAL affinity for JSON numbers,\n    // and SQLite arithmetic on those values is IEEE 754 double.\n    const path = toSqlitePath(pointer);\n    return sql`json_extract(${column}, ${sql.raw(escapeSqliteLiteral(path))})`;\n  },\n\n  jsonExtractBoolean(column, pointer) {\n    // SQLite json_extract returns 0/1 for boolean values\n    const path = toSqlitePath(pointer);\n    return sql`json_extract(${column}, ${sql.raw(escapeSqliteLiteral(path))})`;\n  },\n\n  jsonExtractDate(column, pointer) {\n    // SQLite stores dates as ISO strings, json_extract returns them as text\n    const path = toSqlitePath(pointer);\n    return sql`json_extract(${column}, ${sql.raw(escapeSqliteLiteral(path))})`;\n  },\n\n  // ============================================================\n  // JSON Array Operations\n  // ============================================================\n\n  jsonArrayLength(column) {\n    return sql`json_array_length(${column})`;\n  },\n\n  jsonArrayContains(column, value) {\n    return sql`EXISTS (SELECT 1 FROM json_each(${column}) WHERE json_each.value = ${value})`;\n  },\n\n  jsonArrayContainsAll(column, values) {\n    if (values.length === 0) {\n      return sql.raw(\"1=1\");\n    }\n    const packedValues = JSON.stringify(values);\n    return sql`\n      NOT EXISTS (\n            SELECT 1 FROM json_each(${packedValues}) AS tg_required\n            WHERE NOT EXISTS (\n              SELECT 1 FROM json_each(${column}) AS tg_actual\n              WHERE tg_actual.value = tg_required.value\n            )\n          )\n    `;\n  },\n\n  jsonArrayContainsAny(column, values) {\n    if (values.length === 0) {\n      return sql.raw(\"1=0\");\n    }\n    const packedValues = JSON.stringify(values);\n    return sql`\n      EXISTS (\n            SELECT 1\n            FROM json_each(${column}) AS tg_actual\n            JOIN json_each(${packedValues}) AS tg_wanted\n              ON tg_actual.value = tg_wanted.value\n          )\n    `;\n  },\n\n  // ============================================================\n  // JSON Object Operations\n  // ============================================================\n\n  jsonHasPath(column, pointer) {\n    const path = toSqlitePath(pointer);\n    return sql`json_type(${column}, ${sql.raw(escapeSqliteLiteral(path))}) IS NOT NULL`;\n  },\n\n  jsonPathIsNull(column, pointer) {\n    const path = toSqlitePath(pointer);\n    const pathSql = sql.raw(escapeSqliteLiteral(path));\n    return sql`COALESCE(json_type(${column}, ${pathSql}) = 'null', 1)`;\n  },\n\n  jsonPathIsNumber(column, pointer) {\n    const path = toSqlitePath(pointer);\n    const pathSql = sql.raw(escapeSqliteLiteral(path));\n    // json_type returns NULL for a missing path; COALESCE keeps the\n    // predicate two-valued so negations don't silently drop rows.\n    return sql`COALESCE(json_type(${column}, ${pathSql}) IN ('integer', 'real'), 0)`;\n  },\n\n  jsonPathIsNotNull(column, pointer) {\n    const path = toSqlitePath(pointer);\n    const pathSql = sql.raw(escapeSqliteLiteral(path));\n    return sql`COALESCE(json_type(${column}, ${pathSql}) <> 'null', 0)`;\n  },\n\n  // ============================================================\n  // Comparison Operations\n  // ============================================================\n\n  nullSafeEquals(left, right) {\n    // SQLite's IS operator is null-safe equality (equivalent to = for\n    // non-null operands, TRUE when both sides are NULL).\n    return sql`${left} IS ${right}`;\n  },\n\n  inList(left, values, negated) {\n    const operator = negated ? sql.raw(\"NOT IN\") : sql.raw(\"IN\");\n    const packedValues = JSON.stringify(values);\n    return sql`${left} ${operator} (SELECT value FROM json_each(${packedValues}))`;\n  },\n\n  // ============================================================\n  // String Operations\n  // ============================================================\n\n  ilike(column, pattern) {\n    // SQLite LIKE is case-insensitive for ASCII by default, but we use\n    // LOWER() for consistency with non-ASCII characters. SQLite has no default\n    // LIKE escape character, so declare backslash explicitly to honor the\n    // escaping the compiler applies to the pattern (parity with Postgres).\n    return sql`LOWER(${column}) LIKE LOWER(${pattern}) ${likeEscapeClause}`;\n  },\n\n  // ============================================================\n  // Set Operations\n  // ============================================================\n\n  wrapSetOperationOperand(inner) {\n    // SQLite forbids parenthesized compound operands, but a FROM-subquery may\n    // carry its own WITH clause, so wrap each operand as a subquery.\n    return sql`SELECT * FROM (${inner})`;\n  },\n\n  // ============================================================\n  // Recursive CTE Path Operations\n  // ============================================================\n\n  initializePath(nodeId) {\n    // SQLite uses string-based paths with delimiters: '|id|'\n    return sql`'|' || ${nodeId} || '|'`;\n  },\n\n  extendPath(currentPath, nodeId) {\n    // Append: path || id || '|'\n    return sql`${currentPath} || ${nodeId} || '|'`;\n  },\n\n  cycleCheck(nodeId, path) {\n    // Check that id is NOT in path using INSTR\n    // Returns TRUE if no cycle (id not found in path)\n    return sql`INSTR(${path}, '|' || ${nodeId} || '|') = 0`;\n  },\n\n  // ============================================================\n  // Value Binding & Literals\n  // ============================================================\n\n  bindValue(value) {\n    return getSqlDialectProfile(\"sqlite\").bindValue(value);\n  },\n\n  booleanLiteral(value) {\n    return sql.raw(getSqlDialectProfile(\"sqlite\").booleanLiteralString(value));\n  },\n\n  booleanLiteralString(value) {\n    return getSqlDialectProfile(\"sqlite\").booleanLiteralString(value);\n  },\n\n  quoteIdentifier(name) {\n    // SQLite uses double quotes (or backticks), escape embedded quotes by doubling\n    return `\"${name.replaceAll('\"', '\"\"')}\"`;\n  },\n\n  // ============================================================\n  // Vector Operations\n  // ============================================================\n\n  // Compile-time gate for `field.similarTo(...)`; the active\n  // `VectorStrategy` (sqlite-vec / libSQL-native) owns the distance SQL.\n  supportsVectors: true,\n\n  // ============================================================\n  // Fulltext Operations\n  // ============================================================\n\n  fulltext: fts5Strategy,\n};\n","/**\n * SQL Dialect Module\n *\n * Provides dialect adapters for different SQL databases.\n * Use `getDialect()` to get the appropriate adapter for a dialect name.\n */\n\nexport type { FulltextStrategy } from \"./fulltext-strategy\";\nexport {\n  ALL_FULLTEXT_MODES,\n  buildFulltextCapabilities,\n  fts5Strategy,\n  tsvectorStrategy,\n} from \"./fulltext-strategy\";\nexport { postgresDialect } from \"./postgres\";\nexport { sqliteDialect } from \"./sqlite\";\nexport type {\n  DialectAdapter,\n  DialectCapabilities,\n  DialectRecursiveQueryStrategy,\n  DialectStandardQueryStrategy,\n  DialectVectorPredicateStrategy,\n  SqlDialect,\n} from \"./types\";\nexport {\n  buildVectorCapabilities,\n  type VectorSlot,\n  type VectorStrategy,\n} from \"./vector-strategy\";\n\nimport { postgresDialect } from \"./postgres\";\nimport { sqliteDialect } from \"./sqlite\";\nimport { type DialectAdapter, type SqlDialect } from \"./types\";\n\n/**\n * Map of dialect names to their adapters.\n */\nconst DIALECT_ADAPTERS: Record<SqlDialect, DialectAdapter> = {\n  sqlite: sqliteDialect,\n  postgres: postgresDialect,\n};\n\n/**\n * Gets the dialect adapter for a given dialect name.\n *\n * @param dialect - The dialect name (\"sqlite\" or \"postgres\")\n * @returns The dialect adapter\n *\n * @example\n * ```typescript\n * const adapter = getDialect(\"postgres\");\n * const sql = adapter.jsonExtract(column, \"/name\");\n * ```\n */\nexport function getDialect(dialect: SqlDialect): DialectAdapter {\n  return DIALECT_ADAPTERS[dialect];\n}\n\n/**\n * Default dialect used when none is specified.\n */\nexport const DEFAULT_DIALECT: SqlDialect = \"sqlite\";\n","import { type ValueType } from \"../query/ast\";\nimport { getDialect } from \"../query/dialect\";\nimport { type SqlDialect } from \"../query/dialect/types\";\nimport { type JsonPointer, jsonPointer } from \"../query/json-pointer\";\nimport { sql, type SqlFragment } from \"../query/sql-fragment\";\nimport {\n  type EdgeIndexDeclaration,\n  type IndexWhereExpression,\n  type IndexWhereLiteral,\n  type IndexWhereOp,\n  type IndexWhereOperand,\n  type NodeIndexDeclaration,\n  type SystemColumnName,\n} from \"./types\";\n\n// ============================================================\n// Public Types\n// ============================================================\n\nexport type IndexCompilationContext = Readonly<{\n  dialect: SqlDialect;\n  propsColumn: SqlFragment;\n  systemColumn: (column: SystemColumnName) => SqlFragment;\n}>;\n\ntype CompiledIndexKeys = Readonly<{\n  /** SQL expressions in index key order */\n  keys: readonly SqlFragment[];\n}>;\n\n// ============================================================\n// Index Key Compilation\n// ============================================================\n\nexport function compileNodeIndexKeys(\n  index: NodeIndexDeclaration,\n  dialect: SqlDialect,\n  propsColumn: SqlFragment,\n  systemColumn: (column: SystemColumnName) => SqlFragment,\n): CompiledIndexKeys {\n  const adapter = getDialect(dialect);\n  const keys: SqlFragment[] = [];\n\n  const systemColumns = [\n    ...getNodeScopeColumns(index.scope),\n    ...(index.keySystemColumns ?? []),\n  ];\n  for (const column of systemColumns) {\n    keys.push(systemColumn(column));\n  }\n\n  const allPointers = [...index.fields, ...index.coveringFields];\n  const allValueTypes = [\n    ...index.fieldValueTypes,\n    ...index.coveringFieldValueTypes,\n  ];\n\n  for (const [pointerIndex, pointer] of allPointers.entries()) {\n    const valueType = allValueTypes[pointerIndex];\n    const extracted = compileIndexKeyValue(\n      adapter,\n      propsColumn,\n      pointer,\n      valueType,\n    );\n    keys.push(sql`(${extracted})`);\n  }\n\n  return { keys };\n}\n\nexport function compileEdgeIndexKeys(\n  index: EdgeIndexDeclaration,\n  dialect: SqlDialect,\n  propsColumn: SqlFragment,\n  systemColumn: (column: SystemColumnName) => SqlFragment,\n): CompiledIndexKeys {\n  const adapter = getDialect(dialect);\n  const keys: SqlFragment[] = [];\n\n  for (const column of getEdgeScopeColumns(index.scope, index.direction)) {\n    keys.push(systemColumn(column));\n  }\n\n  const allPointers = [...index.fields, ...index.coveringFields];\n  const allValueTypes = [\n    ...index.fieldValueTypes,\n    ...index.coveringFieldValueTypes,\n  ];\n\n  for (const [pointerIndex, pointer] of allPointers.entries()) {\n    const valueType = allValueTypes[pointerIndex];\n    const extracted = compileIndexKeyValue(\n      adapter,\n      propsColumn,\n      pointer,\n      valueType,\n    );\n    keys.push(sql`(${extracted})`);\n  }\n\n  return { keys };\n}\n\n/**\n * Compiles the per-field key-extraction expressions for a node index's\n * **lookup keys** — `index.fields` only, excluding scope columns and\n * `coveringFields` (which are index payload, not part of the lookup key).\n *\n * Each expression is the exact extraction the index DDL builds for that\n * field (via the shared {@link compileIndexKeyValue}), so a runtime lookup\n * predicate stays byte-identical to the materialized index expression —\n * the single source of truth that lets the planner use the physical index.\n */\nexport function compileNodeIndexFieldKeys(\n  index: NodeIndexDeclaration,\n  ctx: IndexCompilationContext,\n): readonly SqlFragment[] {\n  const adapter = getDialect(ctx.dialect);\n  const keys: SqlFragment[] = [];\n  for (const [position, pointer] of index.fields.entries()) {\n    const extracted = compileIndexKeyValue(\n      adapter,\n      ctx.propsColumn,\n      pointer,\n      index.fieldValueTypes[position],\n    );\n    keys.push(sql`(${extracted})`);\n  }\n  return keys;\n}\n\nfunction compileIndexKeyValue(\n  dialect: ReturnType<typeof getDialect>,\n  propsColumn: SqlFragment,\n  pointer: JsonPointer,\n  valueType: ValueType | undefined,\n): SqlFragment {\n  switch (valueType) {\n    case \"number\": {\n      return dialect.jsonExtractNumber(propsColumn, pointer);\n    }\n    case \"boolean\": {\n      return dialect.jsonExtractBoolean(propsColumn, pointer);\n    }\n    case \"date\": {\n      return dialect.jsonExtractDate(propsColumn, pointer);\n    }\n    case \"string\":\n    case \"unknown\":\n    case undefined: {\n      return dialect.jsonExtractText(propsColumn, pointer);\n    }\n    case \"array\":\n    case \"object\":\n    case \"embedding\": {\n      // For advanced index types (GIN/json), callers should use dialect.jsonExtract\n      // or index the props column directly. We keep this as a conservative fallback.\n      return dialect.jsonExtract(propsColumn, pointer);\n    }\n  }\n}\n\nexport function getNodeScopeColumns(\n  scope: NodeIndexDeclaration[\"scope\"],\n): readonly SystemColumnName[] {\n  switch (scope) {\n    case \"graphAndKind\": {\n      return [\"graph_id\", \"kind\"];\n    }\n    case \"graph\": {\n      return [\"graph_id\"];\n    }\n    case \"none\": {\n      return [];\n    }\n  }\n}\n\nfunction getEdgeScopeColumns(\n  scope: EdgeIndexDeclaration[\"scope\"],\n  direction: EdgeIndexDeclaration[\"direction\"],\n): readonly SystemColumnName[] {\n  const base =\n    scope === \"graphAndKind\" ? ([\"graph_id\", \"kind\"] as const)\n    : scope === \"graph\" ? ([\"graph_id\"] as const)\n    : ([] as const);\n\n  if (direction === \"out\") {\n    return [...base, \"from_id\"];\n  }\n  if (direction === \"in\") {\n    return [...base, \"to_id\"];\n  }\n  return [...base];\n}\n\n// ============================================================\n// WHERE Clause Compilation\n// ============================================================\n\nfunction isIndexWhereLiteralList(\n  value: IndexWhereLiteral | readonly IndexWhereLiteral[],\n): value is readonly IndexWhereLiteral[] {\n  return Array.isArray(value);\n}\n\nexport function compileIndexWhere(\n  ctx: IndexCompilationContext,\n  expression: IndexWhereExpression,\n): SqlFragment {\n  switch (expression.__type) {\n    case \"index_where_and\": {\n      return sql`(${sql.join(\n        expression.predicates.map((p) => compileIndexWhere(ctx, p)),\n        sql` AND `,\n      )})`;\n    }\n    case \"index_where_or\": {\n      return sql`(${sql.join(\n        expression.predicates.map((p) => compileIndexWhere(ctx, p)),\n        sql` OR `,\n      )})`;\n    }\n    case \"index_where_not\": {\n      return sql`(NOT ${compileIndexWhere(ctx, expression.predicate)})`;\n    }\n    case \"index_where_null_check\": {\n      const operand = compileIndexWhereOperand(ctx, expression.operand);\n      return expression.op === \"isNull\" ?\n          sql`${operand} IS NULL`\n        : sql`${operand} IS NOT NULL`;\n    }\n    case \"index_where_comparison\": {\n      const left = compileIndexWhereOperand(ctx, expression.left);\n\n      const right = expression.right;\n      if (isIndexWhereLiteralList(right)) {\n        if (expression.op !== \"in\" && expression.op !== \"notIn\") {\n          throw new Error(\n            `Operator \"${expression.op}\" does not support list comparison in index WHERE clause`,\n          );\n        }\n        const values = right.map((literal) =>\n          compileIndexWhereLiteral(ctx.dialect, literal),\n        );\n        const operator = expression.op === \"in\" ? sql`IN` : sql`NOT IN`;\n        return sql`${left} ${operator} (${sql.join(values, sql`, `)})`;\n      }\n\n      if (expression.op === \"in\" || expression.op === \"notIn\") {\n        throw new Error(\n          `Operator \"${expression.op}\" requires a list of values in index WHERE clause`,\n        );\n      }\n\n      const rightLiteral = compileIndexWhereLiteral(ctx.dialect, right);\n      const opSql = compileComparisonOperator(expression.op);\n      return sql`${left} ${opSql} ${rightLiteral}`;\n    }\n  }\n}\n\nfunction compileIndexWhereOperand(\n  ctx: IndexCompilationContext,\n  operand: IndexWhereOperand,\n): SqlFragment {\n  if (operand.__type === \"index_operand_system\") {\n    return ctx.systemColumn(operand.column);\n  }\n\n  const adapter = getDialect(ctx.dialect);\n  const pointer = jsonPointer([operand.field]);\n\n  switch (operand.valueType) {\n    case \"number\": {\n      return adapter.jsonExtractNumber(ctx.propsColumn, pointer);\n    }\n    case \"boolean\": {\n      return adapter.jsonExtractBoolean(ctx.propsColumn, pointer);\n    }\n    case \"date\": {\n      return adapter.jsonExtractDate(ctx.propsColumn, pointer);\n    }\n    case \"array\":\n    case \"object\":\n    case \"embedding\": {\n      return adapter.jsonExtract(ctx.propsColumn, pointer);\n    }\n    case \"string\":\n    case \"unknown\":\n    case undefined: {\n      return adapter.jsonExtractText(ctx.propsColumn, pointer);\n    }\n  }\n}\n\nfunction compileIndexWhereLiteral(\n  dialect: SqlDialect,\n  literal: IndexWhereLiteral,\n): SqlFragment {\n  switch (literal.valueType) {\n    case \"string\":\n    case \"date\": {\n      return sql.raw(escapeStringLiteral(literal.value.toString()));\n    }\n    case \"number\": {\n      return sql.raw(literal.value.toString());\n    }\n    case \"boolean\": {\n      return getDialect(dialect).booleanLiteral(literal.value as boolean);\n    }\n    case \"array\":\n    case \"object\":\n    case \"embedding\":\n    case \"unknown\": {\n      return sql.raw(escapeStringLiteral(literal.value.toString()));\n    }\n  }\n}\n\ntype ComparisonIndexWhereOp = Exclude<IndexWhereOp, \"in\" | \"notIn\">;\n\nfunction compileComparisonOperator(op: ComparisonIndexWhereOp): SqlFragment {\n  switch (op) {\n    case \"eq\": {\n      return sql`=`;\n    }\n    case \"neq\": {\n      return sql`<>`;\n    }\n    case \"gt\": {\n      return sql`>`;\n    }\n    case \"gte\": {\n      return sql`>=`;\n    }\n    case \"lt\": {\n      return sql`<`;\n    }\n    case \"lte\": {\n      return sql`<=`;\n    }\n  }\n}\n\nfunction escapeStringLiteral(value: string): string {\n  return `'${value.replaceAll(\"'\", \"''\")}'`;\n}\n"]}

package/dist/{chunk-BKAKAVRW.cjs → chunk-HQRZEYYB.cjs}

@@ -1,8 +1,8 @@
 'use strict';
 
-var chunkFMNUSGZ4_cjs = require('./chunk-FMNUSGZ4.cjs');
-var chunkZKZAIX42_cjs = require('./chunk-ZKZAIX42.cjs');
-var chunkX6RDQ5NB_cjs = require('./chunk-X6RDQ5NB.cjs');
+var chunk5YBDB7UG_cjs = require('./chunk-5YBDB7UG.cjs');
+var chunkHAQVISUF_cjs = require('./chunk-HAQVISUF.cjs');
+var chunkYX3H63VV_cjs = require('./chunk-YX3H63VV.cjs');
 
 // src/query/dialect/vector/sqlite-vec-strategy.ts
 var TABLE_PREFIX = "tg_vec";
@@ -47,17 +47,17 @@ function sqliteVecMetricToken(metric) {
   }
 }
 function vecF32Literal(embedding, name) {
-  chunkZKZAIX42_cjs.assertFiniteEmbedding(embedding, name);
-  return chunkX6RDQ5NB_cjs.sql`vec_f32(${JSON.stringify(embedding)})`;
+  chunkHAQVISUF_cjs.assertFiniteEmbedding(embedding, name);
+  return chunkYX3H63VV_cjs.sql`vec_f32(${JSON.stringify(embedding)})`;
 }
 function distanceExpression(embeddingColumn, queryEmbedding, metric) {
   const query = vecF32Literal(queryEmbedding, "queryEmbedding");
   switch (metric) {
     case "cosine": {
-      return chunkX6RDQ5NB_cjs.sql`vec_distance_cosine(${embeddingColumn}, ${query})`;
+      return chunkYX3H63VV_cjs.sql`vec_distance_cosine(${embeddingColumn}, ${query})`;
     }
     case "l2": {
-      return chunkX6RDQ5NB_cjs.sql`vec_distance_l2(${embeddingColumn}, ${query})`;
+      return chunkYX3H63VV_cjs.sql`vec_distance_l2(${embeddingColumn}, ${query})`;
     }
     case "inner_product": {
       throw new Error(
@@ -71,7 +71,7 @@ function distanceExpression(embeddingColumn, queryEmbedding, metric) {
   }
 }
 function tableName(graphId, nodeKind, fieldPath) {
-  return chunkZKZAIX42_cjs.vectorPhysicalName(TABLE_PREFIX, graphId, nodeKind, fieldPath);
+  return chunkHAQVISUF_cjs.vectorPhysicalName(TABLE_PREFIX, graphId, nodeKind, fieldPath);
 }
 var sqliteVecStrategy = {
   name: "sqlite-vec",
@@ -79,11 +79,11 @@ var sqliteVecStrategy = {
   tableName,
   ownedTables(slot) {
     const table = tableName(slot.graphId, slot.nodeKind, slot.fieldPath);
-    const name = chunkZKZAIX42_cjs.quoteIdentifier(table);
+    const name = chunkHAQVISUF_cjs.quoteIdentifier(table);
     const metric = sqliteVecMetricToken(slot.metric);
     return [
       {
-        logicalName: `${chunkZKZAIX42_cjs.VECTOR_CONTRIBUTION_PREFIX}:${slot.nodeKind}.${slot.fieldPath}`,
+        logicalName: `${chunkHAQVISUF_cjs.VECTOR_CONTRIBUTION_PREFIX}:${slot.nodeKind}.${slot.fieldPath}`,
         owner: "sqlite-vec",
         tableName: table,
         createDdl: [
@@ -100,52 +100,52 @@ var sqliteVecStrategy = {
     ];
   },
   buildUpsert(slot, params, timestamp) {
-    const table = chunkX6RDQ5NB_cjs.sql.identifier(
+    const table = chunkYX3H63VV_cjs.sql.identifier(
       tableName(slot.graphId, slot.nodeKind, slot.fieldPath)
     );
     const value = vecF32Literal(params.embedding, "embedding");
     return [
-      chunkX6RDQ5NB_cjs.sql`
+      chunkYX3H63VV_cjs.sql`
         DELETE FROM ${table}
         WHERE "node_id" = ${params.nodeId} AND "graph_id" = ${params.graphId}
       `,
-      chunkX6RDQ5NB_cjs.sql`
+      chunkYX3H63VV_cjs.sql`
         INSERT INTO ${table} ("node_id", "graph_id", "created_at", "updated_at", "embedding")
         VALUES (${params.nodeId}, ${params.graphId}, ${timestamp}, ${timestamp}, ${value})
       `
     ];
   },
   buildUpsertBatch(slot, params, timestamp) {
-    const table = chunkX6RDQ5NB_cjs.sql.identifier(
+    const table = chunkYX3H63VV_cjs.sql.identifier(
       tableName(slot.graphId, slot.nodeKind, slot.fieldPath)
     );
-    const nodeIds = chunkX6RDQ5NB_cjs.sql.join(
-      params.rows.map((row) => chunkX6RDQ5NB_cjs.sql`${row.nodeId}`),
-      chunkX6RDQ5NB_cjs.sql`, `
+    const nodeIds = chunkYX3H63VV_cjs.sql.join(
+      params.rows.map((row) => chunkYX3H63VV_cjs.sql`${row.nodeId}`),
+      chunkYX3H63VV_cjs.sql`, `
     );
-    const valueRows = chunkX6RDQ5NB_cjs.sql.join(
+    const valueRows = chunkYX3H63VV_cjs.sql.join(
       params.rows.map(
-        (row) => chunkX6RDQ5NB_cjs.sql`(${row.nodeId}, ${params.graphId}, ${timestamp}, ${timestamp}, ${vecF32Literal(row.embedding, "embedding")})`
+        (row) => chunkYX3H63VV_cjs.sql`(${row.nodeId}, ${params.graphId}, ${timestamp}, ${timestamp}, ${vecF32Literal(row.embedding, "embedding")})`
       ),
-      chunkX6RDQ5NB_cjs.sql`, `
+      chunkYX3H63VV_cjs.sql`, `
     );
     return [
-      chunkX6RDQ5NB_cjs.sql`
+      chunkYX3H63VV_cjs.sql`
         DELETE FROM ${table}
         WHERE "graph_id" = ${params.graphId} AND "node_id" IN (${nodeIds})
       `,
-      chunkX6RDQ5NB_cjs.sql`
+      chunkYX3H63VV_cjs.sql`
         INSERT INTO ${table} ("node_id", "graph_id", "created_at", "updated_at", "embedding")
         VALUES ${valueRows}
       `
     ];
   },
   buildDelete(slot, params) {
-    const table = chunkX6RDQ5NB_cjs.sql.identifier(
+    const table = chunkYX3H63VV_cjs.sql.identifier(
       tableName(slot.graphId, slot.nodeKind, slot.fieldPath)
     );
     return [
-      chunkX6RDQ5NB_cjs.sql`
+      chunkYX3H63VV_cjs.sql`
         DELETE FROM ${table}
         WHERE "node_id" = ${params.nodeId} AND "graph_id" = ${params.graphId}
       `
@@ -157,63 +157,63 @@ var sqliteVecStrategy = {
   // route the NON-approximate `.similarTo()` branch through this form.
   searchIsExact: true,
   buildSearch(slot, params, candidates) {
-    const table = chunkX6RDQ5NB_cjs.sql.identifier(
+    const table = chunkYX3H63VV_cjs.sql.identifier(
       tableName(slot.graphId, slot.nodeKind, slot.fieldPath)
     );
-    const embeddingColumn = chunkX6RDQ5NB_cjs.sql`${table}."embedding"`;
+    const embeddingColumn = chunkYX3H63VV_cjs.sql`${table}."embedding"`;
     const distance = distanceExpression(
       embeddingColumn,
       params.queryEmbedding,
       params.metric
     );
-    const score = chunkZKZAIX42_cjs.vectorScoreExpression(distance, params.metric);
+    const score = chunkHAQVISUF_cjs.vectorScoreExpression(distance, params.metric);
     if (usesAnnIndex(slot)) {
       const query = vecF32Literal(params.queryEmbedding, "queryEmbedding");
       const knnK = params.limit + (params.offset ?? 0);
       const conditions2 = [
-        chunkX6RDQ5NB_cjs.sql`${table}."embedding" MATCH ${query}`,
-        chunkX6RDQ5NB_cjs.sql`k = ${knnK}`,
-        chunkX6RDQ5NB_cjs.sql`${table}."graph_id" = ${params.graphId}`
+        chunkYX3H63VV_cjs.sql`${table}."embedding" MATCH ${query}`,
+        chunkYX3H63VV_cjs.sql`k = ${knnK}`,
+        chunkYX3H63VV_cjs.sql`${table}."graph_id" = ${params.graphId}`
       ];
       if (params.minScore !== void 0) {
         conditions2.push(
-          chunkZKZAIX42_cjs.vectorMinScoreCondition(distance, params.metric, params.minScore)
+          chunkHAQVISUF_cjs.vectorMinScoreCondition(distance, params.metric, params.minScore)
         );
       }
       if (candidates !== void 0) {
-        conditions2.push(chunkX6RDQ5NB_cjs.sql`${table}."node_id" IN (${candidates})`);
+        conditions2.push(chunkYX3H63VV_cjs.sql`${table}."node_id" IN (${candidates})`);
       }
-      const knnBody = chunkX6RDQ5NB_cjs.sql`
+      const knnBody = chunkYX3H63VV_cjs.sql`
         SELECT ${table}."node_id" AS node_id, ${score} AS score
         FROM ${table}
-        WHERE ${chunkX6RDQ5NB_cjs.sql.join(conditions2, chunkX6RDQ5NB_cjs.sql` AND `)}
+        WHERE ${chunkYX3H63VV_cjs.sql.join(conditions2, chunkYX3H63VV_cjs.sql` AND `)}
         ORDER BY distance ASC
       `;
       if (params.offset === void 0 || params.offset === 0) {
         return knnBody;
       }
-      return chunkX6RDQ5NB_cjs.sql`
+      return chunkYX3H63VV_cjs.sql`
         WITH knn_page AS MATERIALIZED (${knnBody})
         SELECT node_id, score FROM knn_page
         LIMIT ${params.limit} OFFSET ${params.offset}
       `;
     }
     const conditions = [
-      chunkX6RDQ5NB_cjs.sql`${table}."graph_id" = ${params.graphId}`
+      chunkYX3H63VV_cjs.sql`${table}."graph_id" = ${params.graphId}`
     ];
     if (candidates !== void 0) {
-      conditions.push(chunkX6RDQ5NB_cjs.sql`${table}."node_id" IN (${candidates})`);
+      conditions.push(chunkYX3H63VV_cjs.sql`${table}."node_id" IN (${candidates})`);
     }
     if (params.minScore !== void 0) {
       conditions.push(
-        chunkZKZAIX42_cjs.vectorMinScoreCondition(distance, params.metric, params.minScore)
+        chunkHAQVISUF_cjs.vectorMinScoreCondition(distance, params.metric, params.minScore)
       );
     }
-    const pageClause = chunkFMNUSGZ4_cjs.vectorPageClause(params.limit, params.offset);
-    return chunkX6RDQ5NB_cjs.sql`
+    const pageClause = chunk5YBDB7UG_cjs.vectorPageClause(params.limit, params.offset);
+    return chunkYX3H63VV_cjs.sql`
       SELECT ${table}."node_id" AS node_id, ${score} AS score
       FROM ${table}
-      WHERE ${chunkX6RDQ5NB_cjs.sql.join(conditions, chunkX6RDQ5NB_cjs.sql` AND `)}
+      WHERE ${chunkYX3H63VV_cjs.sql.join(conditions, chunkYX3H63VV_cjs.sql` AND `)}
       ORDER BY ${distance} ASC
       ${pageClause}
     `;
@@ -230,7 +230,7 @@ var sqliteVecStrategy = {
     return void 0;
   },
   buildDropStorage(slot) {
-    const table = chunkZKZAIX42_cjs.quoteIdentifier(
+    const table = chunkHAQVISUF_cjs.quoteIdentifier(
       tableName(slot.graphId, slot.nodeKind, slot.fieldPath)
     );
     return [`DROP TABLE IF EXISTS ${table}`];
@@ -238,5 +238,5 @@ var sqliteVecStrategy = {
 };
 
 exports.sqliteVecStrategy = sqliteVecStrategy;
-//# sourceMappingURL=chunk-BKAKAVRW.cjs.map
-//# sourceMappingURL=chunk-BKAKAVRW.cjs.map
+//# sourceMappingURL=chunk-HQRZEYYB.cjs.map
+//# sourceMappingURL=chunk-HQRZEYYB.cjs.map

package/dist/{chunk-BKAKAVRW.cjs.map → chunk-HQRZEYYB.cjs.map}

@@ -1 +1 @@
-{"version":3,"sources":["../src/query/dialect/vector/sqlite-vec-strategy.ts"],"names":["assertFiniteEmbedding","sql","vectorPhysicalName","quoteIdentifier","VECTOR_CONTRIBUTION_PREFIX","vectorScoreExpression","conditions","vectorMinScoreCondition","vectorPageClause"],"mappings":";;;;;;;AA6EA,IAAM,YAAA,GAAe,QAAA;AAOrB,IAAM,yBAAA,GAA4B,GAAA;AAElC,IAAM,uBAAA,GAA8C;AAAA,EAClD,SAAA,EAAW,IAAA;AAAA,EACX,OAAA,EAAS,CAAC,QAAA,EAAU,IAAI,CAAA;AAAA;AAAA;AAAA;AAAA,EAIxB,UAAA,EAAY,CAAC,MAAA,EAAQ,MAAM,CAAA;AAAA,EAC3B,aAAA,EAAe,yBAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAKf,yBAAA,EAA2B;AAAA,IACzB,IAAA,EAAM,iBAAA;AAAA,IACN,kBAAA,EAAoB;AAAA;AAExB,CAAA;AAGA,SAAS,aAAa,IAAA,EAA2B;AAC/C,EAAA,OAAO,KAAK,SAAA,KAAc,MAAA;AAC5B;AAGA,SAAS,qBAAqB,MAAA,EAA8B;AAC1D,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;AAQA,SAAS,aAAA,CACP,WACA,IAAA,EACa;AACb,EAAAA,uCAAA,CAAsB,WAAW,IAAI,CAAA;AACrC,EAAA,OAAOC,qBAAA,CAAA,QAAA,EAAc,IAAA,CAAK,SAAA,CAAU,SAAS,CAAC,CAAA,CAAA,CAAA;AAChD;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,oBAAA,EAA0B,eAAe,CAAA,EAAA,EAAK,KAAK,CAAA,CAAA,CAAA;AAAA,IAC5D;AAAA,IACA,KAAK,IAAA,EAAM;AACT,MAAA,OAAOA,qBAAA,CAAA,gBAAA,EAAsB,eAAe,CAAA,EAAA,EAAK,KAAK,CAAA,CAAA,CAAA;AAAA,IACxD;AAAA,IACA,KAAK,eAAA,EAAiB;AACpB,MAAA,MAAM,IAAI,KAAA;AAAA,QACR;AAAA,OACF;AAAA,IACF;AAAA,IACA,SAAS;AACP,MAAA,MAAM,WAAA,GAAqB,MAAA;AAC3B,MAAA,MAAM,IAAI,KAAA,CAAM,CAAA,2BAAA,EAA8B,MAAA,CAAO,WAAW,CAAC,CAAA,CAAE,CAAA;AAAA,IACrE;AAAA;AAEJ;AAEA,SAAS,SAAA,CACP,OAAA,EACA,QAAA,EACA,SAAA,EACQ;AACR,EAAA,OAAOC,oCAAA,CAAmB,YAAA,EAAc,OAAA,EAAS,QAAA,EAAU,SAAS,CAAA;AACtE;AAEO,IAAM,iBAAA,GAAoC;AAAA,EAC/C,IAAA,EAAM,YAAA;AAAA,EACN,YAAA,EAAc,uBAAA;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;AAClC,IAAA,MAAM,MAAA,GAAS,oBAAA,CAAqB,IAAA,CAAK,MAAM,CAAA;AAO/C,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,YAAA;AAAA,QACP,SAAA,EAAW,KAAA;AAAA,QACX,SAAA,EAAW;AAAA,UACT,sCAAsC,IAAI,CAAA;AAAA;AAAA;AAAA;AAAA;AAAA,kBAAA,EAKhC,IAAA,CAAK,UAAU,CAAA,kBAAA,EAAqB,MAAM;AAAA,EAAA;AAAA,SAEtD;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;AAIzD,IAAA,OAAO;AAAA,MACLA,qBAAA;AAAA,oBAAA,EACgB,KAAK;AAAA,0BAAA,EACC,MAAA,CAAO,MAAM,CAAA,kBAAA,EAAqB,MAAA,CAAO,OAAO;AAAA,MAAA,CAAA;AAAA,MAEtEA,qBAAA;AAAA,oBAAA,EACgB,KAAK,CAAA;AAAA,gBAAA,EACT,MAAA,CAAO,MAAM,CAAA,EAAA,EAAK,MAAA,CAAO,OAAO,KAAK,SAAS,CAAA,EAAA,EAAK,SAAS,CAAA,EAAA,EAAK,KAAK,CAAA;AAAA,MAAA;AAAA,KAEpF;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;AAGA,IAAA,MAAM,UAAUA,qBAAA,CAAI,IAAA;AAAA,MAClB,MAAA,CAAO,KAAK,GAAA,CAAI,CAAC,QAAQA,qBAAA,CAAA,EAAM,GAAA,CAAI,MAAM,CAAA,CAAE,CAAA;AAAA,MAC3CA,qBAAA,CAAA,EAAA;AAAA,KACF;AACA,IAAA,MAAM,YAAYA,qBAAA,CAAI,IAAA;AAAA,MACpB,OAAO,IAAA,CAAK,GAAA;AAAA,QACV,CAAC,GAAA,KACCA,qBAAA,CAAA,CAAA,EAAO,GAAA,CAAI,MAAM,KAAK,MAAA,CAAO,OAAO,CAAA,EAAA,EAAK,SAAS,KAAK,SAAS,CAAA,EAAA,EAAK,cAAc,GAAA,CAAI,SAAA,EAAW,WAAW,CAAC,CAAA,CAAA;AAAA,OAClH;AAAA,MACAA,qBAAA,CAAA,EAAA;AAAA,KACF;AACA,IAAA,OAAO;AAAA,MACLA,qBAAA;AAAA,oBAAA,EACgB,KAAK;AAAA,2BAAA,EACE,MAAA,CAAO,OAAO,CAAA,mBAAA,EAAsB,OAAO,CAAA;AAAA,MAAA,CAAA;AAAA,MAElEA,qBAAA;AAAA,oBAAA,EACgB,KAAK,CAAA;AAAA,eAAA,EACV,SAAS;AAAA,MAAA;AAAA,KAEtB;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,0BAAA,EACC,MAAA,CAAO,MAAM,CAAA,kBAAA,EAAqB,MAAA,CAAO,OAAO;AAAA,MAAA;AAAA,KAExE;AAAA,EACF,CAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,aAAA,EAAe,IAAA;AAAA,EAEf,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;AAE3D,IAAA,IAAI,YAAA,CAAa,IAAI,CAAA,EAAG;AAMtB,MAAA,MAAM,KAAA,GAAQ,aAAA,CAAc,MAAA,CAAO,cAAA,EAAgB,gBAAgB,CAAA;AAGnE,MAAA,MAAM,IAAA,GAAO,MAAA,CAAO,KAAA,IAAS,MAAA,CAAO,MAAA,IAAU,CAAA,CAAA;AAC9C,MAAA,MAAMC,WAAAA,GAA4B;AAAA,QAChCL,qBAAA,CAAA,EAAM,KAAK,CAAA,mBAAA,EAAsB,KAAK,CAAA,CAAA;AAAA,QACtCA,4BAAU,IAAI,CAAA,CAAA;AAAA,QACdA,qBAAA,CAAA,EAAM,KAAK,CAAA,cAAA,EAAiB,MAAA,CAAO,OAAO,CAAA;AAAA,OAC5C;AACA,MAAA,IAAI,MAAA,CAAO,aAAa,MAAA,EAAW;AACjC,QAAAK,WAAAA,CAAW,IAAA;AAAA,UACTC,yCAAA,CAAwB,QAAA,EAAU,MAAA,CAAO,MAAA,EAAQ,OAAO,QAAQ;AAAA,SAClE;AAAA,MACF;AAIA,MAAA,IAAI,eAAe,MAAA,EAAW;AAC5B,QAAAD,YAAW,IAAA,CAAKL,qBAAA,CAAA,EAAM,KAAK,CAAA,eAAA,EAAkB,UAAU,CAAA,CAAA,CAAG,CAAA;AAAA,MAC5D;AACA,MAAA,MAAM,OAAA,GAAUA,qBAAA;AAAA,eAAA,EACL,KAAK,0BAA0B,KAAK,CAAA;AAAA,aAAA,EACtC,KAAK;AAAA,cAAA,EACJA,qBAAA,CAAI,IAAA,CAAKK,WAAAA,EAAYL,qBAAA,CAAA,KAAA,CAAU,CAAC;AAAA;AAAA,MAAA,CAAA;AAG1C,MAAA,IAAI,MAAA,CAAO,MAAA,KAAW,MAAA,IAAa,MAAA,CAAO,WAAW,CAAA,EAAG;AACtD,QAAA,OAAO,OAAA;AAAA,MACT;AAIA,MAAA,OAAOA,qBAAA;AAAA,uCAAA,EAC4B,OAAO,CAAA;AAAA;AAAA,cAAA,EAEhC,MAAA,CAAO,KAAK,CAAA,QAAA,EAAW,MAAA,CAAO,MAAM;AAAA,MAAA,CAAA;AAAA,IAEhD;AAGA,IAAA,MAAM,UAAA,GAA4B;AAAA,MAChCA,qBAAA,CAAA,EAAM,KAAK,CAAA,cAAA,EAAiB,MAAA,CAAO,OAAO,CAAA;AAAA,KAC5C;AACA,IAAA,IAAI,eAAe,MAAA,EAAW;AAC5B,MAAA,UAAA,CAAW,IAAA,CAAKA,qBAAA,CAAA,EAAM,KAAK,CAAA,eAAA,EAAkB,UAAU,CAAA,CAAA,CAAG,CAAA;AAAA,IAC5D;AACA,IAAA,IAAI,MAAA,CAAO,aAAa,MAAA,EAAW;AACjC,MAAA,UAAA,CAAW,IAAA;AAAA,QACTM,yCAAA,CAAwB,QAAA,EAAU,MAAA,CAAO,MAAA,EAAQ,OAAO,QAAQ;AAAA,OAClE;AAAA,IACF;AACA,IAAA,MAAM,UAAA,GAAaC,kCAAA,CAAiB,MAAA,CAAO,KAAA,EAAO,OAAO,MAAM,CAAA;AAC/D,IAAA,OAAOP,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;AAAA;AAAA,EAIA,gBAAA,GAA4C;AAC1C,IAAA,OAAO,MAAA;AAAA,EACT,CAAA;AAAA,EAEA,cAAA,GAA0C;AACxC,IAAA,OAAO,MAAA;AAAA,EACT,CAAA;AAAA,EAEA,iBAAiB,IAAA,EAAyB;AACxC,IAAA,MAAM,KAAA,GAAQE,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,CAAE,CAAA;AAAA,EACzC;AACF","file":"chunk-BKAKAVRW.cjs","sourcesContent":["/**\n * sqlite-vec strategy — real `vec0` KNN for local SQLite.\n *\n * This upgrades `createLocalSqliteBackend` (better-sqlite3 + the sqlite-vec\n * extension) from the legacy brute-force-on-a-shared-table model to genuine\n * approximate-nearest-neighbor search on per-`(nodeKind, fieldPath)` storage.\n *\n * ## Storage choice: a `vec0` virtual table per field\n *\n * Each slot is backed by its own `vec0` virtual table:\n *\n * ```sql\n * CREATE VIRTUAL TABLE tg_vec_<kind>_<field> USING vec0(\n *   node_id TEXT PRIMARY KEY,\n *   graph_id TEXT PARTITION KEY,\n *   +created_at TEXT,\n *   +updated_at TEXT,\n *   embedding float[<N>] distance_metric=<cosine|l2>\n * );\n * ```\n *\n * Verified against the installed `sqlite-vec` `v0.1.9`:\n *\n * - **vec0 over a plain `vec_f32` BLOB column.** The shipped option (a) — a\n *   `vec0` virtual table — is chosen over option (b) — a regular table whose\n *   `vec_f32` BLOB column is brute-forced — because vec0 is the *only* form\n *   that gives local SQLite a real ANN index (today's code only ever\n *   brute-forces). vec0 indexes inline (the virtual table *is* the index), so\n *   there is no separate `CREATE INDEX` step.\n * - **KNN with partition-correct filtering.** `WHERE embedding MATCH vec_f32(q)\n *   AND k = ? AND graph_id = ?` returns the nearest `k`, ordered by `distance`,\n *   scoped to one graph — a near vector in another `graph_id` partition does\n *   not leak. This is strictly better than libSQL's table-global `vector_top_k`\n *   (which over-fetches for multi-graph correctness): vec0's `PARTITION KEY`\n *   makes the per-graph KNN exact.\n * - **One table serves both read paths.** The same `embedding` column answers\n *   the compiler's brute-force `distanceExpression` (`vec_distance_cosine` /\n *   `vec_distance_l2` over the column, `ORDER BY … LIMIT`, no `MATCH`), so the\n *   `.where(field.similarTo(...))` CTE path needs no second structure.\n * - **`k` and `LIMIT` are mutually exclusive** in a vec0 `MATCH` query, so the\n *   ANN path uses `k = <limit>` with no `LIMIT`, and the brute-force path uses\n *   `LIMIT <limit>` with no `MATCH`.\n * - **No `ON CONFLICT` / `INSERT OR REPLACE`** on a vec0 primary key, so upsert\n *   is `DELETE` + `INSERT` (atomic under the caller's outer transaction),\n *   mirroring the FTS5 strategy.\n *\n * Metric support is `cosine` + `l2` (no `inner_product` — sqlite-vec has no\n * `vec_distance_ip`), advertised as data on `capabilities`. The table's\n * `distance_metric` is fixed at creation from the slot's metric, alongside its\n * fixed dimension `N`.\n *\n * The libSQL and pgvector siblings implement the same `VectorStrategy`\n * contract for their engines.\n */\nimport { type StrategyTableContribution } from \"../../../backend/table-contribution\";\nimport {\n  type DeleteEmbeddingParams,\n  type UpsertEmbeddingBatchParams,\n  type UpsertEmbeddingParams,\n  type VectorCapabilities,\n  type VectorMetric,\n  type VectorSearchParams,\n} from \"../../../backend/types\";\nimport { sql, type SqlFragment } from \"../../sql-fragment\";\nimport {\n  assertFiniteEmbedding,\n  quoteIdentifier,\n  VECTOR_CONTRIBUTION_PREFIX,\n  vectorMinScoreCondition,\n  vectorPhysicalName,\n  vectorScoreExpression,\n  type VectorSlot,\n  type VectorStrategy,\n} from \"../vector-strategy\";\nimport { vectorPageClause } from \"./pagination\";\n\n/** Physical-name prefix for the per-field `vec0` virtual table. */\nconst TABLE_PREFIX = \"tg_vec\";\n\n/**\n * sqlite-vec stores each dimension as a 32-bit float; `float[N]` accepts\n * large `N`, but we advertise the same conservative ceiling the legacy\n * SQLite path used so capability discovery is stable across the swap.\n */\nconst SQLITE_VEC_MAX_DIMENSIONS = 8000;\n\nconst SQLITE_VEC_CAPABILITIES: VectorCapabilities = {\n  supported: true,\n  metrics: [\"cosine\", \"l2\"],\n  // vec0 always indexes inline, so the portable ANN intent (\"hnsw\", the\n  // `embedding()` default) is honored by real KNN; \"none\" stays brute-force.\n  // Both map to the same vec0 table — only `buildSearch` differs.\n  indexTypes: [\"hnsw\", \"none\"],\n  maxDimensions: SQLITE_VEC_MAX_DIMENSIONS,\n  // vec0's KNN accepts primary-key `IN (SELECT …)` pushdown (verified on\n  // sqlite-vec v0.1.9), so the candidate filter constrains the KNN itself and\n  // a filtered search returns `k` live rows — no over-fetch, no scan bound, no\n  // under-fill. The only bundled engine that can promise a full page.\n  filteredApproximateSearch: {\n    mode: \"filter-pushdown\",\n    guaranteesFullPage: true,\n  },\n};\n\n/** Whether a slot's declared index type maps to vec0's `MATCH … k =` KNN. */\nfunction usesAnnIndex(slot: VectorSlot): boolean {\n  return slot.indexType === \"hnsw\";\n}\n\n/** vec0 `distance_metric` token accepted in the virtual-table definition. */\nfunction sqliteVecMetricToken(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        \"sqlite-vec 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 bound JSON argument to `vec_f32(...)`. The\n * value rides as a parameter (not interpolated) — `vec_f32` parses the JSON\n * array into the packed float blob. Finiteness is validated first so a\n * NaN/Infinity names its index before JSON.stringify masks it as `null`.\n */\nfunction vecF32Literal(\n  embedding: readonly number[],\n  name: string,\n): SqlFragment {\n  assertFiniteEmbedding(embedding, name);\n  return sql`vec_f32(${JSON.stringify(embedding)})`;\n}\n\nfunction distanceExpression(\n  embeddingColumn: SqlFragment,\n  queryEmbedding: readonly number[],\n  metric: VectorMetric,\n): SqlFragment {\n  const query = vecF32Literal(queryEmbedding, \"queryEmbedding\");\n  switch (metric) {\n    case \"cosine\": {\n      return sql`vec_distance_cosine(${embeddingColumn}, ${query})`;\n    }\n    case \"l2\": {\n      return sql`vec_distance_l2(${embeddingColumn}, ${query})`;\n    }\n    case \"inner_product\": {\n      throw new Error(\n        \"sqlite-vec does not support inner_product. Use 'cosine' or 'l2'.\",\n      );\n    }\n    default: {\n      const _exhaustive: never = metric;\n      throw new Error(`Unsupported vector metric: ${String(_exhaustive)}`);\n    }\n  }\n}\n\nfunction tableName(\n  graphId: string,\n  nodeKind: string,\n  fieldPath: string,\n): string {\n  return vectorPhysicalName(TABLE_PREFIX, graphId, nodeKind, fieldPath);\n}\n\nexport const sqliteVecStrategy: VectorStrategy = {\n  name: \"sqlite-vec\",\n  capabilities: SQLITE_VEC_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    const metric = sqliteVecMetricToken(slot.metric);\n\n    // vec0 virtual tables cannot be modeled as a Drizzle table, so this is a\n    // raw-ddl contribution — emitted verbatim and invisible to drizzle-kit.\n    // `graph_id` is a PARTITION KEY so per-graph KNN is exact; `created_at` /\n    // `updated_at` are auxiliary (`+`) columns (stored, not filtered on). The\n    // virtual table *is* the index — no separate CREATE INDEX is emitted.\n    return [\n      {\n        logicalName: `${VECTOR_CONTRIBUTION_PREFIX}:${slot.nodeKind}.${slot.fieldPath}`,\n        owner: \"sqlite-vec\",\n        tableName: table,\n        createDdl: [\n          `CREATE VIRTUAL TABLE IF NOT EXISTS ${name} USING vec0(\n  node_id TEXT PRIMARY KEY,\n  graph_id TEXT PARTITION KEY,\n  +created_at TEXT,\n  +updated_at TEXT,\n  embedding float[${slot.dimensions}] distance_metric=${metric}\n);`,\n        ],\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 = vecF32Literal(params.embedding, \"embedding\");\n    // vec0 rejects ON CONFLICT / INSERT OR REPLACE on its primary key —\n    // emulate upsert with DELETE + INSERT, atomic under the caller's\n    // outer transaction (mirrors the FTS5 fulltext strategy).\n    return [\n      sql`\n        DELETE FROM ${table}\n        WHERE \"node_id\" = ${params.nodeId} AND \"graph_id\" = ${params.graphId}\n      `,\n      sql`\n        INSERT INTO ${table} (\"node_id\", \"graph_id\", \"created_at\", \"updated_at\", \"embedding\")\n        VALUES (${params.nodeId}, ${params.graphId}, ${timestamp}, ${timestamp}, ${value})\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    // Same DELETE + INSERT upsert emulation as buildUpsert, in multi-row\n    // form: one IN-list delete, one multi-row insert.\n    const nodeIds = sql.join(\n      params.rows.map((row) => sql`${row.nodeId}`),\n      sql`, `,\n    );\n    const valueRows = sql.join(\n      params.rows.map(\n        (row) =>\n          sql`(${row.nodeId}, ${params.graphId}, ${timestamp}, ${timestamp}, ${vecF32Literal(row.embedding, \"embedding\")})`,\n      ),\n      sql`, `,\n    );\n    return [\n      sql`\n        DELETE FROM ${table}\n        WHERE \"graph_id\" = ${params.graphId} AND \"node_id\" IN (${nodeIds})\n      `,\n      sql`\n        INSERT INTO ${table} (\"node_id\", \"graph_id\", \"created_at\", \"updated_at\", \"embedding\")\n        VALUES ${valueRows}\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 \"node_id\" = ${params.nodeId} AND \"graph_id\" = ${params.graphId}\n      `,\n    ];\n  },\n\n  // vec0's KNN is brute force in C — exact by construction (the\n  // \"index\" is a partitioned scan, not a graph) — and the non-indexed\n  // fallback below is a plain SQL scan. The compiler may therefore\n  // route the NON-approximate `.similarTo()` branch through this form.\n  searchIsExact: true,\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    if (usesAnnIndex(slot)) {\n      // vec0 KNN. `k` and `LIMIT` are mutually exclusive in a MATCH query, so\n      // bound `k = limit` and omit LIMIT. `graph_id` filters by the partition\n      // key (exact, no recall loss). Order by vec0's own `distance` column —\n      // the recomputed `distance` expression is reused only for score/minScore\n      // so the math matches the brute-force path and the shared helpers.\n      const query = vecF32Literal(params.queryEmbedding, \"queryEmbedding\");\n      // `k` covers the requested page: vec0 has no OFFSET inside a MATCH\n      // query, so fetch `limit + offset` neighbors and page in a wrapper.\n      const knnK = params.limit + (params.offset ?? 0);\n      const conditions: SqlFragment[] = [\n        sql`${table}.\"embedding\" MATCH ${query}`,\n        sql`k = ${knnK}`,\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      // vec0 KNN accepts primary-key `IN (SELECT ...)` pushdown (verified on\n      // sqlite-vec v0.1.9): the filter constrains the KNN candidate set\n      // itself, so `k` live results come back — exact, no over-fetch.\n      if (candidates !== undefined) {\n        conditions.push(sql`${table}.\"node_id\" IN (${candidates})`);\n      }\n      const knnBody = 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      `;\n      if (params.offset === undefined || params.offset === 0) {\n        return knnBody;\n      }\n      // MATERIALIZED fences the page wrapper: SQLite would otherwise\n      // flatten the subquery and push the outer LIMIT into the vec0 MATCH\n      // query, which rejects `k = ?` and LIMIT together.\n      return sql`\n        WITH knn_page AS MATERIALIZED (${knnBody})\n        SELECT node_id, score FROM knn_page\n        LIMIT ${params.limit} OFFSET ${params.offset}\n      `;\n    }\n\n    // Brute-force scan: no MATCH, so LIMIT is allowed (and required).\n    const conditions: SqlFragment[] = [\n      sql`${table}.\"graph_id\" = ${params.graphId}`,\n    ];\n    if (candidates !== undefined) {\n      conditions.push(sql`${table}.\"node_id\" IN (${candidates})`);\n    }\n    if (params.minScore !== undefined) {\n      conditions.push(\n        vectorMinScoreCondition(distance, params.metric, params.minScore),\n      );\n    }\n    const pageClause = vectorPageClause(params.limit, params.offset);\n    return sql`\n      SELECT ${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  // vec0 indexes inline (the virtual table is the index), so there is no\n  // standalone ANN index to create or drop — both return undefined.\n  buildCreateIndex(): SqlFragment | undefined {\n    return undefined;\n  },\n\n  buildDropIndex(): SqlFragment | undefined {\n    return undefined;\n  },\n\n  buildDropStorage(slot): readonly string[] {\n    const table = quoteIdentifier(\n      tableName(slot.graphId, slot.nodeKind, slot.fieldPath),\n    );\n    // Dropping the vec0 virtual table removes its backing shadow tables too.\n    return [`DROP TABLE IF EXISTS ${table}`];\n  },\n};\n"]}
+{"version":3,"sources":["../src/query/dialect/vector/sqlite-vec-strategy.ts"],"names":["assertFiniteEmbedding","sql","vectorPhysicalName","quoteIdentifier","VECTOR_CONTRIBUTION_PREFIX","vectorScoreExpression","conditions","vectorMinScoreCondition","vectorPageClause"],"mappings":";;;;;;;AA6EA,IAAM,YAAA,GAAe,QAAA;AAOrB,IAAM,yBAAA,GAA4B,GAAA;AAElC,IAAM,uBAAA,GAA8C;AAAA,EAClD,SAAA,EAAW,IAAA;AAAA,EACX,OAAA,EAAS,CAAC,QAAA,EAAU,IAAI,CAAA;AAAA;AAAA;AAAA;AAAA,EAIxB,UAAA,EAAY,CAAC,MAAA,EAAQ,MAAM,CAAA;AAAA,EAC3B,aAAA,EAAe,yBAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAKf,yBAAA,EAA2B;AAAA,IACzB,IAAA,EAAM,iBAAA;AAAA,IACN,kBAAA,EAAoB;AAAA;AAExB,CAAA;AAGA,SAAS,aAAa,IAAA,EAA2B;AAC/C,EAAA,OAAO,KAAK,SAAA,KAAc,MAAA;AAC5B;AAGA,SAAS,qBAAqB,MAAA,EAA8B;AAC1D,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;AAQA,SAAS,aAAA,CACP,WACA,IAAA,EACa;AACb,EAAAA,uCAAA,CAAsB,WAAW,IAAI,CAAA;AACrC,EAAA,OAAOC,qBAAA,CAAA,QAAA,EAAc,IAAA,CAAK,SAAA,CAAU,SAAS,CAAC,CAAA,CAAA,CAAA;AAChD;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,oBAAA,EAA0B,eAAe,CAAA,EAAA,EAAK,KAAK,CAAA,CAAA,CAAA;AAAA,IAC5D;AAAA,IACA,KAAK,IAAA,EAAM;AACT,MAAA,OAAOA,qBAAA,CAAA,gBAAA,EAAsB,eAAe,CAAA,EAAA,EAAK,KAAK,CAAA,CAAA,CAAA;AAAA,IACxD;AAAA,IACA,KAAK,eAAA,EAAiB;AACpB,MAAA,MAAM,IAAI,KAAA;AAAA,QACR;AAAA,OACF;AAAA,IACF;AAAA,IACA,SAAS;AACP,MAAA,MAAM,WAAA,GAAqB,MAAA;AAC3B,MAAA,MAAM,IAAI,KAAA,CAAM,CAAA,2BAAA,EAA8B,MAAA,CAAO,WAAW,CAAC,CAAA,CAAE,CAAA;AAAA,IACrE;AAAA;AAEJ;AAEA,SAAS,SAAA,CACP,OAAA,EACA,QAAA,EACA,SAAA,EACQ;AACR,EAAA,OAAOC,oCAAA,CAAmB,YAAA,EAAc,OAAA,EAAS,QAAA,EAAU,SAAS,CAAA;AACtE;AAEO,IAAM,iBAAA,GAAoC;AAAA,EAC/C,IAAA,EAAM,YAAA;AAAA,EACN,YAAA,EAAc,uBAAA;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;AAClC,IAAA,MAAM,MAAA,GAAS,oBAAA,CAAqB,IAAA,CAAK,MAAM,CAAA;AAO/C,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,YAAA;AAAA,QACP,SAAA,EAAW,KAAA;AAAA,QACX,SAAA,EAAW;AAAA,UACT,sCAAsC,IAAI,CAAA;AAAA;AAAA;AAAA;AAAA;AAAA,kBAAA,EAKhC,IAAA,CAAK,UAAU,CAAA,kBAAA,EAAqB,MAAM;AAAA,EAAA;AAAA,SAEtD;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;AAIzD,IAAA,OAAO;AAAA,MACLA,qBAAA;AAAA,oBAAA,EACgB,KAAK;AAAA,0BAAA,EACC,MAAA,CAAO,MAAM,CAAA,kBAAA,EAAqB,MAAA,CAAO,OAAO;AAAA,MAAA,CAAA;AAAA,MAEtEA,qBAAA;AAAA,oBAAA,EACgB,KAAK,CAAA;AAAA,gBAAA,EACT,MAAA,CAAO,MAAM,CAAA,EAAA,EAAK,MAAA,CAAO,OAAO,KAAK,SAAS,CAAA,EAAA,EAAK,SAAS,CAAA,EAAA,EAAK,KAAK,CAAA;AAAA,MAAA;AAAA,KAEpF;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;AAGA,IAAA,MAAM,UAAUA,qBAAA,CAAI,IAAA;AAAA,MAClB,MAAA,CAAO,KAAK,GAAA,CAAI,CAAC,QAAQA,qBAAA,CAAA,EAAM,GAAA,CAAI,MAAM,CAAA,CAAE,CAAA;AAAA,MAC3CA,qBAAA,CAAA,EAAA;AAAA,KACF;AACA,IAAA,MAAM,YAAYA,qBAAA,CAAI,IAAA;AAAA,MACpB,OAAO,IAAA,CAAK,GAAA;AAAA,QACV,CAAC,GAAA,KACCA,qBAAA,CAAA,CAAA,EAAO,GAAA,CAAI,MAAM,KAAK,MAAA,CAAO,OAAO,CAAA,EAAA,EAAK,SAAS,KAAK,SAAS,CAAA,EAAA,EAAK,cAAc,GAAA,CAAI,SAAA,EAAW,WAAW,CAAC,CAAA,CAAA;AAAA,OAClH;AAAA,MACAA,qBAAA,CAAA,EAAA;AAAA,KACF;AACA,IAAA,OAAO;AAAA,MACLA,qBAAA;AAAA,oBAAA,EACgB,KAAK;AAAA,2BAAA,EACE,MAAA,CAAO,OAAO,CAAA,mBAAA,EAAsB,OAAO,CAAA;AAAA,MAAA,CAAA;AAAA,MAElEA,qBAAA;AAAA,oBAAA,EACgB,KAAK,CAAA;AAAA,eAAA,EACV,SAAS;AAAA,MAAA;AAAA,KAEtB;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,0BAAA,EACC,MAAA,CAAO,MAAM,CAAA,kBAAA,EAAqB,MAAA,CAAO,OAAO;AAAA,MAAA;AAAA,KAExE;AAAA,EACF,CAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,aAAA,EAAe,IAAA;AAAA,EAEf,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;AAE3D,IAAA,IAAI,YAAA,CAAa,IAAI,CAAA,EAAG;AAMtB,MAAA,MAAM,KAAA,GAAQ,aAAA,CAAc,MAAA,CAAO,cAAA,EAAgB,gBAAgB,CAAA;AAGnE,MAAA,MAAM,IAAA,GAAO,MAAA,CAAO,KAAA,IAAS,MAAA,CAAO,MAAA,IAAU,CAAA,CAAA;AAC9C,MAAA,MAAMC,WAAAA,GAA4B;AAAA,QAChCL,qBAAA,CAAA,EAAM,KAAK,CAAA,mBAAA,EAAsB,KAAK,CAAA,CAAA;AAAA,QACtCA,4BAAU,IAAI,CAAA,CAAA;AAAA,QACdA,qBAAA,CAAA,EAAM,KAAK,CAAA,cAAA,EAAiB,MAAA,CAAO,OAAO,CAAA;AAAA,OAC5C;AACA,MAAA,IAAI,MAAA,CAAO,aAAa,MAAA,EAAW;AACjC,QAAAK,WAAAA,CAAW,IAAA;AAAA,UACTC,yCAAA,CAAwB,QAAA,EAAU,MAAA,CAAO,MAAA,EAAQ,OAAO,QAAQ;AAAA,SAClE;AAAA,MACF;AAIA,MAAA,IAAI,eAAe,MAAA,EAAW;AAC5B,QAAAD,YAAW,IAAA,CAAKL,qBAAA,CAAA,EAAM,KAAK,CAAA,eAAA,EAAkB,UAAU,CAAA,CAAA,CAAG,CAAA;AAAA,MAC5D;AACA,MAAA,MAAM,OAAA,GAAUA,qBAAA;AAAA,eAAA,EACL,KAAK,0BAA0B,KAAK,CAAA;AAAA,aAAA,EACtC,KAAK;AAAA,cAAA,EACJA,qBAAA,CAAI,IAAA,CAAKK,WAAAA,EAAYL,qBAAA,CAAA,KAAA,CAAU,CAAC;AAAA;AAAA,MAAA,CAAA;AAG1C,MAAA,IAAI,MAAA,CAAO,MAAA,KAAW,MAAA,IAAa,MAAA,CAAO,WAAW,CAAA,EAAG;AACtD,QAAA,OAAO,OAAA;AAAA,MACT;AAIA,MAAA,OAAOA,qBAAA;AAAA,uCAAA,EAC4B,OAAO,CAAA;AAAA;AAAA,cAAA,EAEhC,MAAA,CAAO,KAAK,CAAA,QAAA,EAAW,MAAA,CAAO,MAAM;AAAA,MAAA,CAAA;AAAA,IAEhD;AAGA,IAAA,MAAM,UAAA,GAA4B;AAAA,MAChCA,qBAAA,CAAA,EAAM,KAAK,CAAA,cAAA,EAAiB,MAAA,CAAO,OAAO,CAAA;AAAA,KAC5C;AACA,IAAA,IAAI,eAAe,MAAA,EAAW;AAC5B,MAAA,UAAA,CAAW,IAAA,CAAKA,qBAAA,CAAA,EAAM,KAAK,CAAA,eAAA,EAAkB,UAAU,CAAA,CAAA,CAAG,CAAA;AAAA,IAC5D;AACA,IAAA,IAAI,MAAA,CAAO,aAAa,MAAA,EAAW;AACjC,MAAA,UAAA,CAAW,IAAA;AAAA,QACTM,yCAAA,CAAwB,QAAA,EAAU,MAAA,CAAO,MAAA,EAAQ,OAAO,QAAQ;AAAA,OAClE;AAAA,IACF;AACA,IAAA,MAAM,UAAA,GAAaC,kCAAA,CAAiB,MAAA,CAAO,KAAA,EAAO,OAAO,MAAM,CAAA;AAC/D,IAAA,OAAOP,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;AAAA;AAAA,EAIA,gBAAA,GAA4C;AAC1C,IAAA,OAAO,MAAA;AAAA,EACT,CAAA;AAAA,EAEA,cAAA,GAA0C;AACxC,IAAA,OAAO,MAAA;AAAA,EACT,CAAA;AAAA,EAEA,iBAAiB,IAAA,EAAyB;AACxC,IAAA,MAAM,KAAA,GAAQE,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,CAAE,CAAA;AAAA,EACzC;AACF","file":"chunk-HQRZEYYB.cjs","sourcesContent":["/**\n * sqlite-vec strategy — real `vec0` KNN for local SQLite.\n *\n * This upgrades `createLocalSqliteBackend` (better-sqlite3 + the sqlite-vec\n * extension) from the legacy brute-force-on-a-shared-table model to genuine\n * approximate-nearest-neighbor search on per-`(nodeKind, fieldPath)` storage.\n *\n * ## Storage choice: a `vec0` virtual table per field\n *\n * Each slot is backed by its own `vec0` virtual table:\n *\n * ```sql\n * CREATE VIRTUAL TABLE tg_vec_<kind>_<field> USING vec0(\n *   node_id TEXT PRIMARY KEY,\n *   graph_id TEXT PARTITION KEY,\n *   +created_at TEXT,\n *   +updated_at TEXT,\n *   embedding float[<N>] distance_metric=<cosine|l2>\n * );\n * ```\n *\n * Verified against the installed `sqlite-vec` `v0.1.9`:\n *\n * - **vec0 over a plain `vec_f32` BLOB column.** The shipped option (a) — a\n *   `vec0` virtual table — is chosen over option (b) — a regular table whose\n *   `vec_f32` BLOB column is brute-forced — because vec0 is the *only* form\n *   that gives local SQLite a real ANN index (today's code only ever\n *   brute-forces). vec0 indexes inline (the virtual table *is* the index), so\n *   there is no separate `CREATE INDEX` step.\n * - **KNN with partition-correct filtering.** `WHERE embedding MATCH vec_f32(q)\n *   AND k = ? AND graph_id = ?` returns the nearest `k`, ordered by `distance`,\n *   scoped to one graph — a near vector in another `graph_id` partition does\n *   not leak. This is strictly better than libSQL's table-global `vector_top_k`\n *   (which over-fetches for multi-graph correctness): vec0's `PARTITION KEY`\n *   makes the per-graph KNN exact.\n * - **One table serves both read paths.** The same `embedding` column answers\n *   the compiler's brute-force `distanceExpression` (`vec_distance_cosine` /\n *   `vec_distance_l2` over the column, `ORDER BY … LIMIT`, no `MATCH`), so the\n *   `.where(field.similarTo(...))` CTE path needs no second structure.\n * - **`k` and `LIMIT` are mutually exclusive** in a vec0 `MATCH` query, so the\n *   ANN path uses `k = <limit>` with no `LIMIT`, and the brute-force path uses\n *   `LIMIT <limit>` with no `MATCH`.\n * - **No `ON CONFLICT` / `INSERT OR REPLACE`** on a vec0 primary key, so upsert\n *   is `DELETE` + `INSERT` (atomic under the caller's outer transaction),\n *   mirroring the FTS5 strategy.\n *\n * Metric support is `cosine` + `l2` (no `inner_product` — sqlite-vec has no\n * `vec_distance_ip`), advertised as data on `capabilities`. The table's\n * `distance_metric` is fixed at creation from the slot's metric, alongside its\n * fixed dimension `N`.\n *\n * The libSQL and pgvector siblings implement the same `VectorStrategy`\n * contract for their engines.\n */\nimport { type StrategyTableContribution } from \"../../../backend/table-contribution\";\nimport {\n  type DeleteEmbeddingParams,\n  type UpsertEmbeddingBatchParams,\n  type UpsertEmbeddingParams,\n  type VectorCapabilities,\n  type VectorMetric,\n  type VectorSearchParams,\n} from \"../../../backend/types\";\nimport { sql, type SqlFragment } from \"../../sql-fragment\";\nimport {\n  assertFiniteEmbedding,\n  quoteIdentifier,\n  VECTOR_CONTRIBUTION_PREFIX,\n  vectorMinScoreCondition,\n  vectorPhysicalName,\n  vectorScoreExpression,\n  type VectorSlot,\n  type VectorStrategy,\n} from \"../vector-strategy\";\nimport { vectorPageClause } from \"./pagination\";\n\n/** Physical-name prefix for the per-field `vec0` virtual table. */\nconst TABLE_PREFIX = \"tg_vec\";\n\n/**\n * sqlite-vec stores each dimension as a 32-bit float; `float[N]` accepts\n * large `N`, but we advertise the same conservative ceiling the legacy\n * SQLite path used so capability discovery is stable across the swap.\n */\nconst SQLITE_VEC_MAX_DIMENSIONS = 8000;\n\nconst SQLITE_VEC_CAPABILITIES: VectorCapabilities = {\n  supported: true,\n  metrics: [\"cosine\", \"l2\"],\n  // vec0 always indexes inline, so the portable ANN intent (\"hnsw\", the\n  // `embedding()` default) is honored by real KNN; \"none\" stays brute-force.\n  // Both map to the same vec0 table — only `buildSearch` differs.\n  indexTypes: [\"hnsw\", \"none\"],\n  maxDimensions: SQLITE_VEC_MAX_DIMENSIONS,\n  // vec0's KNN accepts primary-key `IN (SELECT …)` pushdown (verified on\n  // sqlite-vec v0.1.9), so the candidate filter constrains the KNN itself and\n  // a filtered search returns `k` live rows — no over-fetch, no scan bound, no\n  // under-fill. The only bundled engine that can promise a full page.\n  filteredApproximateSearch: {\n    mode: \"filter-pushdown\",\n    guaranteesFullPage: true,\n  },\n};\n\n/** Whether a slot's declared index type maps to vec0's `MATCH … k =` KNN. */\nfunction usesAnnIndex(slot: VectorSlot): boolean {\n  return slot.indexType === \"hnsw\";\n}\n\n/** vec0 `distance_metric` token accepted in the virtual-table definition. */\nfunction sqliteVecMetricToken(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        \"sqlite-vec 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 bound JSON argument to `vec_f32(...)`. The\n * value rides as a parameter (not interpolated) — `vec_f32` parses the JSON\n * array into the packed float blob. Finiteness is validated first so a\n * NaN/Infinity names its index before JSON.stringify masks it as `null`.\n */\nfunction vecF32Literal(\n  embedding: readonly number[],\n  name: string,\n): SqlFragment {\n  assertFiniteEmbedding(embedding, name);\n  return sql`vec_f32(${JSON.stringify(embedding)})`;\n}\n\nfunction distanceExpression(\n  embeddingColumn: SqlFragment,\n  queryEmbedding: readonly number[],\n  metric: VectorMetric,\n): SqlFragment {\n  const query = vecF32Literal(queryEmbedding, \"queryEmbedding\");\n  switch (metric) {\n    case \"cosine\": {\n      return sql`vec_distance_cosine(${embeddingColumn}, ${query})`;\n    }\n    case \"l2\": {\n      return sql`vec_distance_l2(${embeddingColumn}, ${query})`;\n    }\n    case \"inner_product\": {\n      throw new Error(\n        \"sqlite-vec does not support inner_product. Use 'cosine' or 'l2'.\",\n      );\n    }\n    default: {\n      const _exhaustive: never = metric;\n      throw new Error(`Unsupported vector metric: ${String(_exhaustive)}`);\n    }\n  }\n}\n\nfunction tableName(\n  graphId: string,\n  nodeKind: string,\n  fieldPath: string,\n): string {\n  return vectorPhysicalName(TABLE_PREFIX, graphId, nodeKind, fieldPath);\n}\n\nexport const sqliteVecStrategy: VectorStrategy = {\n  name: \"sqlite-vec\",\n  capabilities: SQLITE_VEC_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    const metric = sqliteVecMetricToken(slot.metric);\n\n    // vec0 virtual tables cannot be modeled as a Drizzle table, so this is a\n    // raw-ddl contribution — emitted verbatim and invisible to drizzle-kit.\n    // `graph_id` is a PARTITION KEY so per-graph KNN is exact; `created_at` /\n    // `updated_at` are auxiliary (`+`) columns (stored, not filtered on). The\n    // virtual table *is* the index — no separate CREATE INDEX is emitted.\n    return [\n      {\n        logicalName: `${VECTOR_CONTRIBUTION_PREFIX}:${slot.nodeKind}.${slot.fieldPath}`,\n        owner: \"sqlite-vec\",\n        tableName: table,\n        createDdl: [\n          `CREATE VIRTUAL TABLE IF NOT EXISTS ${name} USING vec0(\n  node_id TEXT PRIMARY KEY,\n  graph_id TEXT PARTITION KEY,\n  +created_at TEXT,\n  +updated_at TEXT,\n  embedding float[${slot.dimensions}] distance_metric=${metric}\n);`,\n        ],\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 = vecF32Literal(params.embedding, \"embedding\");\n    // vec0 rejects ON CONFLICT / INSERT OR REPLACE on its primary key —\n    // emulate upsert with DELETE + INSERT, atomic under the caller's\n    // outer transaction (mirrors the FTS5 fulltext strategy).\n    return [\n      sql`\n        DELETE FROM ${table}\n        WHERE \"node_id\" = ${params.nodeId} AND \"graph_id\" = ${params.graphId}\n      `,\n      sql`\n        INSERT INTO ${table} (\"node_id\", \"graph_id\", \"created_at\", \"updated_at\", \"embedding\")\n        VALUES (${params.nodeId}, ${params.graphId}, ${timestamp}, ${timestamp}, ${value})\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    // Same DELETE + INSERT upsert emulation as buildUpsert, in multi-row\n    // form: one IN-list delete, one multi-row insert.\n    const nodeIds = sql.join(\n      params.rows.map((row) => sql`${row.nodeId}`),\n      sql`, `,\n    );\n    const valueRows = sql.join(\n      params.rows.map(\n        (row) =>\n          sql`(${row.nodeId}, ${params.graphId}, ${timestamp}, ${timestamp}, ${vecF32Literal(row.embedding, \"embedding\")})`,\n      ),\n      sql`, `,\n    );\n    return [\n      sql`\n        DELETE FROM ${table}\n        WHERE \"graph_id\" = ${params.graphId} AND \"node_id\" IN (${nodeIds})\n      `,\n      sql`\n        INSERT INTO ${table} (\"node_id\", \"graph_id\", \"created_at\", \"updated_at\", \"embedding\")\n        VALUES ${valueRows}\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 \"node_id\" = ${params.nodeId} AND \"graph_id\" = ${params.graphId}\n      `,\n    ];\n  },\n\n  // vec0's KNN is brute force in C — exact by construction (the\n  // \"index\" is a partitioned scan, not a graph) — and the non-indexed\n  // fallback below is a plain SQL scan. The compiler may therefore\n  // route the NON-approximate `.similarTo()` branch through this form.\n  searchIsExact: true,\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    if (usesAnnIndex(slot)) {\n      // vec0 KNN. `k` and `LIMIT` are mutually exclusive in a MATCH query, so\n      // bound `k = limit` and omit LIMIT. `graph_id` filters by the partition\n      // key (exact, no recall loss). Order by vec0's own `distance` column —\n      // the recomputed `distance` expression is reused only for score/minScore\n      // so the math matches the brute-force path and the shared helpers.\n      const query = vecF32Literal(params.queryEmbedding, \"queryEmbedding\");\n      // `k` covers the requested page: vec0 has no OFFSET inside a MATCH\n      // query, so fetch `limit + offset` neighbors and page in a wrapper.\n      const knnK = params.limit + (params.offset ?? 0);\n      const conditions: SqlFragment[] = [\n        sql`${table}.\"embedding\" MATCH ${query}`,\n        sql`k = ${knnK}`,\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      // vec0 KNN accepts primary-key `IN (SELECT ...)` pushdown (verified on\n      // sqlite-vec v0.1.9): the filter constrains the KNN candidate set\n      // itself, so `k` live results come back — exact, no over-fetch.\n      if (candidates !== undefined) {\n        conditions.push(sql`${table}.\"node_id\" IN (${candidates})`);\n      }\n      const knnBody = 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      `;\n      if (params.offset === undefined || params.offset === 0) {\n        return knnBody;\n      }\n      // MATERIALIZED fences the page wrapper: SQLite would otherwise\n      // flatten the subquery and push the outer LIMIT into the vec0 MATCH\n      // query, which rejects `k = ?` and LIMIT together.\n      return sql`\n        WITH knn_page AS MATERIALIZED (${knnBody})\n        SELECT node_id, score FROM knn_page\n        LIMIT ${params.limit} OFFSET ${params.offset}\n      `;\n    }\n\n    // Brute-force scan: no MATCH, so LIMIT is allowed (and required).\n    const conditions: SqlFragment[] = [\n      sql`${table}.\"graph_id\" = ${params.graphId}`,\n    ];\n    if (candidates !== undefined) {\n      conditions.push(sql`${table}.\"node_id\" IN (${candidates})`);\n    }\n    if (params.minScore !== undefined) {\n      conditions.push(\n        vectorMinScoreCondition(distance, params.metric, params.minScore),\n      );\n    }\n    const pageClause = vectorPageClause(params.limit, params.offset);\n    return sql`\n      SELECT ${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  // vec0 indexes inline (the virtual table is the index), so there is no\n  // standalone ANN index to create or drop — both return undefined.\n  buildCreateIndex(): SqlFragment | undefined {\n    return undefined;\n  },\n\n  buildDropIndex(): SqlFragment | undefined {\n    return undefined;\n  },\n\n  buildDropStorage(slot): readonly string[] {\n    const table = quoteIdentifier(\n      tableName(slot.graphId, slot.nodeKind, slot.fieldPath),\n    );\n    // Dropping the vec0 virtual table removes its backing shadow tables too.\n    return [`DROP TABLE IF EXISTS ${table}`];\n  },\n};\n"]}