joist-core 2.3.0 → 2.4.0

package/build/dataloaders/findDataLoader.js.map

@@ -1 +1 @@
-{"version":3,"file":"findDataLoader.js","sourceRoot":"","sources":["../../src/dataloaders/findDataLoader.ts"],"names":[],"mappings":";;;AAsCA,wCAgHC;AASD,0CAEC;AAED,0CAIC;AAGD,sDAgBC;AAiCD,sDAiDC;AAmBD,wEAaC;AAGD,sCAcC;AAiID,wCAkBC;AA+BD,0EAUC;AAvfD,gEAAgD;AAChD,oDAAmG;AACnG,sDAAgE;AAChE,0CAA4C;AAC5C,gDAWwB;AACxB,kDAAkD;AAElD,sCAA+C;AAC/C,0CAAoC;AAEpC,sDAA4C;AAC5C,sCAA2C;AAC3C,oCAAuC;AACvC,+DAA4D;AAE/C,QAAA,aAAa,GAAG,MAAM,CAAC;AAUpC,SAAgB,cAAc,CAC5B,EAAiB,EACjB,IAAuC,EACvC,MAA4B,EAC5B,IAA6B;IAE7B,MAAM,EAAE,KAAK,EAAE,GAAG,IAAI,EAAE,GAAG,MAAM,CAAC;IAClC,IAAI,OAAO,IAAI,IAAI,IAAI,QAAQ,IAAI,IAAI,EAAE,CAAC;QACxC,MAAM,IAAI,KAAK,CAAC,6CAA6C,CAAC,CAAC;IACjE,CAAC;IAED,MAAM,IAAI,GAAG,IAAA,4BAAW,EAAC,IAAI,CAAC,CAAC;IAC/B,MAAM,KAAK,GAAG,IAAA,4BAAc,EAAC,IAAI,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC;IAChD,MAAM,EAAE,UAAU,EAAE,YAAY,EAAE,GAAG,EAAE,CAAC,aAAa,CAAC,CAAC,IAAI,EAAE,qBAAa,EAAE,KAAK,EAAE;QACjF,GAAG,IAAI;QACP,KAAK,EAAE,EAAE,CAAC,WAAW;KACtB,CAAC,CAAC;IACH,MAAM,QAAQ,GAAU,EAAE,CAAC;IAC3B,aAAa,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;IAC/B,MAAM,QAAQ,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE,QAAQ,EAAE,YAAY,EAAE,UAAU,EAAiC,CAAC;IACtG,MAAM,QAAQ,GAAG,+BAA+B,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;IAE9D,OAAO,EAAE;SACN,SAAS,CACR,qBAAa;IACb,sFAAsF;IACtF,wFAAwF;IACxF,wFAAwF;IACxF,uFAAuF;IACvF,yBAAyB;IACzB,GAAG,QAAQ,IAAI,IAAA,wBAAO,EAAC,IAAI,CAAC,EAAE,EAC9B,KAAK,EAAE,OAAO,EAAE,EAAE;QAChB,kEAAkE;QAElE,uGAAuG;QACvG,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACzB,MAAM,EAAE,KAAK,EAAE,YAAY,EAAE,UAAU,EAAE,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;YACvD,0BAA0B;YAC1B,MAAM,EAAE,SAAS,EAAE,GAAG,IAAA,gCAAgB,EAAC,EAAE,CAAC,CAAC;YAC3C,MAAM,eAAe,GAAG,SAAS,IAAI,IAAI,IAAI,SAAS,CAAC,aAAa,CAAC,IAAI,EAAE,IAAA,wBAAa,EAAC,IAAI,CAAC,EAAE,KAAK,CAAC,CAAC;YACvG,MAAM,IAAI,GAAG,MAAM,EAAE,CAAC,qBAAqB,CAAC,CAAC,IAAI,EAAE,qBAAa,EAAE,KAAK,EAAE,YAAY,EAAE,UAAU,CAAC,CAAC;YACnG,MAAM,QAAQ,GAAG,EAAE,CAAC,OAAO,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;YACxC,eAAe,EAAE,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;YAClC,OAAO,CAAC,qBAAqB,CAAC,EAAE,EAAE,QAAQ,CAAC,CAAC,CAAC;QAC/C,CAAC;QAED,oCAAoC;QACpC,2EAA2E;QAC3E,IAAI;QACJ,4CAA4C;QAC5C,iBAAiB;QACjB,4BAA4B;QAC5B,8DAA8D;QAC9D,gBAAgB;QAEhB,gDAAgD;QAChD,MAAM,EAAE,KAAK,EAAE,YAAY,EAAE,UAAU,EAAE,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;QACvD,MAAM,EAAE,SAAS,EAAE,GAAG,IAAA,gCAAgB,EAAC,EAAE,CAAC,CAAC;QAC3C,MAAM,YAAY,GAAG,SAAS,IAAI,IAAI,IAAI,SAAS,CAAC,eAAe,CAAC,IAAI,EAAE,IAAA,wBAAa,EAAC,IAAI,CAAC,EAAE,KAAK,CAAC,CAAC;QAEtG,MAAM,IAAI,GAAG,qBAAqB,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;QACnD,MAAM,WAAW,GAAe,CAAC,EAAE,UAAU,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC;QACrG,MAAM,YAAY,GAAG,8BAA8B,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;QACnE,MAAM,MAAM,GAAoB;YAC9B,GAAG,KAAK;YACR,OAAO,EAAE,CAAC,+BAA+B,EAAE,GAAG,KAAK,CAAC,OAAO,CAAC;YAC5D,MAAM,EAAE,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,KAAK,EAAE,OAAO,EAAE,KAAK,EAAE,OAAO,EAAE,EAAE,GAAG,KAAK,CAAC,MAAM,CAAC;YAC5E,IAAI,EAAE,CAAC,IAAA,uBAAc,EAAC,OAAO,EAAE,WAAW,EAAE,YAAY,CAAC,EAAE,GAAG,CAAC,KAAK,CAAC,IAAI,IAAI,EAAE,CAAC,CAAC;SAClF,CAAC;QACF,IAAI,YAAY,EAAE,CAAC;YACjB,MAAM,CAAC,OAAO,CAAC,IAAI,CACjB,GAAG,YAAY,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE;YAC5B,oFAAoF;YACpF,iFAAiF;YACjF,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,cAAc,CAAC,CAAC,KAAK,YAAY,CAAC,CAAC,EAAE,EAAE,CAAC,CAC9D,CACF,CAAC;YACF,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;QACzD,CAAC;QAED,yFAAyF;QACzF,MAAM,CAAC,QAAQ,GAAG,aAAa,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;QAEhD,8EAA8E;QAC9E,MAAM,CAAC,OAAO,CAAC,GAAG,IAAA,uBAAS,EAAC,MAAM,CAAC,CAAC;QACpC,KAAK,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,IAAI,MAAM,CAAC,QAAQ,EAAE,CAAC;YAChD,IAAI,KAAK,KAAK,OAAO,CAAC,KAAK,EAAE,CAAC;gBAC5B,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC,CAAC;YAC1C,CAAC;QACH,CAAC;QAED,MAAM,IAAI,GAAG,MAAM,EAAE,CAAC,qBAAqB,CAAC,CAAC,IAAI,EAAE,qBAAa,EAAE,MAAM,EAAE,YAAY,EAAE,UAAU,CAAC,CAAC;QAEpG,MAAM,QAAQ,GAAG,EAAE,CAAC,OAAO,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;QACxC,YAAY,EAAE,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC,CAAC;QAEzD,0EAA0E;QAC1E,MAAM,OAAO,GAAG,OAAO,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,EAAS,CAAC,CAAC;QAC7C,qDAAqD;QACrD,IAAI,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE;YACtB,MAAM,MAAM,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;YAC3B,IAAI,CAAC,MAAM,CAAC,eAAe,EAAE,CAAC;gBAC5B,KAAK,MAAM,GAAG,IAAI,GAAG,CAAC,KAAK;oBAAE,OAAO,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YACzD,CAAC;YACD,OAAO,GAAG,CAAC,KAAK,CAAC;QACnB,CAAC,CAAC,CAAC;QACH,OAAO,OAAO,CAAC;IACjB,CAAC;IACD,iGAAiG;IACjG,EAAE,UAAU,EAAE,eAAe,EAAE,CAChC;SACA,IAAI,CAAC,QAAQ,CAAC,CAAC;AACpB,CAAC;AAED;;;;;;GAMG;AACH,SAAgB,eAAe,CAAC,KAAuD;IACrF,OAAO,eAAe,CAAC,EAAE,KAAK,EAAE,KAAK,CAAC,KAAK,EAAE,YAAY,EAAE,KAAK,CAAC,YAAY,EAAE,CAAC,CAAC;AACnF,CAAC;AAED,SAAgB,eAAe,CAAC,KAAa;IAC3C,MAAM,GAAG,GAAG,IAAA,yCAAmB,EAAC,KAAK,CAAC,CAAC;IACvC,IAAI,GAAG,KAAK,SAAS;QAAE,MAAM,IAAI,KAAK,CAAC,qDAAqD,CAAC,CAAC;IAC9F,OAAO,GAAG,CAAC;AACb,CAAC;AAED,iHAAiH;AACjH,SAAgB,qBAAqB,CAAmB,EAAiB,EAAE,QAAa;IACtF,+FAA+F;IAC/F,IAAI,CAAC,IAAA,gCAAgB,EAAC,EAAE,CAAC,CAAC,aAAa,EAAE;QAAE,OAAO,QAAQ,CAAC;IAE3D,MAAM,YAAY,GAAG,QAAQ,CAAC,SAAS,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,MAAM,CAAC,eAAe,CAAC,CAAC;IAC5E,IAAI,YAAY,KAAK,CAAC,CAAC;QAAE,OAAO,QAAQ,CAAC;IAEzC,IAAI,UAAU,GAAG,YAAY,CAAC;IAC9B,KAAK,IAAI,SAAS,GAAG,YAAY,GAAG,CAAC,EAAE,SAAS,GAAG,QAAQ,CAAC,MAAM,EAAE,SAAS,EAAE,EAAE,CAAC;QAChF,MAAM,MAAM,GAAG,QAAQ,CAAC,SAAS,CAAC,CAAC;QACnC,IAAI,CAAC,MAAM,CAAC,eAAe,EAAE,CAAC;YAC5B,QAAQ,CAAC,UAAU,EAAE,CAAC,GAAG,MAAM,CAAC;QAClC,CAAC;IACH,CAAC;IACD,QAAQ,CAAC,MAAM,GAAG,UAAU,CAAC;IAC7B,OAAO,QAAQ,CAAC;AAClB,CAAC;AAED,MAAM,UAAU;IACN,KAAK,GAAG,CAAC,CAAC;IAClB,IAAI;QACF,OAAO,IAAI,CAAC,KAAK,EAAE,CAAC;IACtB,CAAC;CACF;AAYD;;;;;;;;;;;;;GAaG;AACH,SAAgB,qBAAqB,CAAC,KAAsB,EAAE,OAAuC;IACnG,MAAM,IAAI,GAAa,EAAE,CAAC;IAC1B,MAAM,SAAS,GAAG,IAAI,UAAU,EAAE,CAAC;IACnC,iGAAiG;IACjG,uGAAuG;IACvG,MAAM,QAAQ,GAAG,uBAAuB,CAAC,OAAO,CAAC,CAAC;IAClD,IAAI,YAAY,GAAG,CAAC,CAAC;IACrB,IAAA,8BAAe,EAAC,KAAK,EAAE;QACrB,SAAS,CAAC,CAAkB;YAC1B,IAAI,OAAO,IAAI,CAAC,CAAC,IAAI,EAAE,CAAC;gBACtB,MAAM,EAAE,IAAI,EAAE,GAAG,CAAC,CAAC,IAAI,CAAC;gBACxB,0FAA0F;gBAC1F,MAAM,QAAQ,GAAG,IAAI,KAAK,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC5C,MAAM,KAAK,GAAG,YAAY,CAAC;gBAC3B,YAAY,IAAI,QAAQ,CAAC;gBACzB,0FAA0F;gBAC1F,0FAA0F;gBAC1F,IAAI,WAAW,GAAG,IAAI,CAAC;gBACvB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,EAAE,CAAC,EAAE,EAAE,CAAC;oBAClC,IAAI,CAAC,QAAQ,CAAC,KAAK,GAAG,CAAC,CAAC,EAAE,CAAC;wBACzB,WAAW,GAAG,KAAK,CAAC;wBACpB,MAAM;oBACR,CAAC;gBACH,CAAC;gBACD,IAAI,WAAW;oBAAE,OAAO;gBACxB,+FAA+F;gBAC/F,yFAAyF;gBACzF,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;oBACvB,IAAI,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,EAAE,UAAU,EAAE,MAAM,IAAI,CAAC,MAAM,EAAE,EAAE,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE,EAAE,YAAY,EAAE,KAAK,EAAE,CAAC,CAAC;oBAClG,IAAI,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,EAAE,UAAU,EAAE,MAAM,IAAI,CAAC,MAAM,EAAE,EAAE,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE,EAAE,YAAY,EAAE,KAAK,GAAG,CAAC,EAAE,CAAC,CAAC;gBACxG,CAAC;qBAAM,CAAC;oBACN,6FAA6F;oBAC7F,MAAM,MAAM,GACV,IAAI,KAAK,IAAI,IAAI,IAAI,KAAK,KAAK;wBAC7B,CAAC,CAAC,GAAG,CAAC,CAAC,MAAM,IAAI,CAAC,6CAA6C;wBAC/D,CAAC,CAAC,IAAI,KAAK,gBAAgB,IAAI,IAAI,KAAK,mBAAmB;4BACzD,CAAC,CAAC,UAAU,CAAC,0FAA0F;4BACvG,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;oBACjB,IAAI,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,EAAE,UAAU,EAAE,MAAM,IAAI,CAAC,MAAM,EAAE,EAAE,MAAM,EAAE,EAAE,YAAY,EAAE,KAAK,EAAE,CAAC,CAAC;gBAC1F,CAAC;gBACD,OAAO,qBAAqB,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC;YAC7C,CAAC;iBAAM,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,KAAK,SAAS,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,KAAK,UAAU,EAAE,CAAC;gBACnE,iBAAiB;YACnB,CAAC;iBAAM,CAAC;gBACN,MAAM,IAAI,KAAK,CAAC,aAAa,CAAC,CAAC;YACjC,CAAC;QACH,CAAC;KACF,CAAC,CAAC;IACH,OAAO,IAAI,CAAC;AACd,CAAC;AAED,SAAS,qBAAqB,CAAC,CAAkB,EAAE,SAAqB;IACtE,MAAM,CAAC,EAAE,EAAE,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC;IAC/C,OAAO;QACL,IAAI,EAAE,KAAK;QACX,OAAO,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC;QAClB,SAAS,EAAE,GAAG,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,GAAG,IAAA,gBAAK,EAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,MAAM,CAAC,IAAI,EAAE,EAAE;QACrE,SAAS,EAAE,CAAC,CAAC,SAAS,IAAI,KAAK;QAC/B,QAAQ,EAAE,EAAE;KACb,CAAC;AACJ,CAAC;AAED;;;;;GAKG;AACH,SAAgB,8BAA8B,CAC5C,IAAuB,EACvB,OAAuC;IAEvC,MAAM,YAAY,GAAY,IAAI,KAAK,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IACzD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,YAAY,CAAC,MAAM,EAAE,CAAC,EAAE;QAAE,YAAY,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC;IACnE,OAAO,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,CAAC,EAAE,EAAE;QAC3B,YAAY,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACxB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACrC,YAAY,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC;QACjE,CAAC;IACH,CAAC,CAAC,CAAC;IACH,OAAO,YAAY,CAAC;AACtB,CAAC;AAED,kFAAkF;AAClF,SAAgB,aAAa,CAAC,QAAe,EAAE,KAAsB;IACnE,IAAA,8BAAe,EAAC,KAAK,EAAE;QACrB,SAAS,CAAC,CAAkB;YAC1B,IAAI,OAAO,IAAI,CAAC,CAAC,IAAI,EAAE,CAAC;gBACtB,yBAAyB;gBACzB,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,KAAK,SAAS,EAAE,CAAC;oBAC9B,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;oBAC/B,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;gBACjC,CAAC;qBAAM,CAAC;oBACN,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;gBAC9B,CAAC;YACH,CAAC;QACH,CAAC;KACF,CAAC,CAAC;AACL,CAAC;AAED,0FAA0F;AAC1F,SAAS,iBAAiB,CAAC,MAAc;IACvC,OAAO,MAAM,CAAC,WAAW,EAAE,CAAC,QAAQ,CAAC,YAAY,CAAC,CAAC;AACrD,CAAC;AAED,8GAA8G;AAC9G,SAAS,aAAa,CAAC,OAAuB;IAC5C,MAAM,UAAU,GAAG,OAAO,CAAC,GAAG,CAAC,mBAAmB,CAAC,CAAC;IACpD,MAAM,eAAe,GAAG,IAAI,GAAG,CAC7B,UAAU;SACP,MAAM,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC,iBAAiB,CAAC,MAAM,CAAC,IAAI,gBAAgB,CAAC,MAAM,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;SACzF,GAAG,CAAC,wBAAU,CAAC,CACnB,CAAC;IACF,OAAO,UAAU;SACd,MAAM,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC,iBAAiB,CAAC,MAAM,CAAC,CAAC;SAC9C,MAAM,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC,0BAA0B,CAAC,MAAM,EAAE,eAAe,CAAC,CAAC;SACxE,GAAG,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC,CAAC;AAC5C,CAAC;AAED,8FAA8F;AAC9F,SAAS,mBAAmB,CAAC,MAAoB;IAC/C,IAAI,OAAO,MAAM,KAAK,QAAQ,EAAE,CAAC;QAC/B,OAAO,MAAM,CAAC;IAChB,CAAC;IACD,MAAM,IAAI,KAAK,CAAC,iEAAiE,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC;AACjG,CAAC;AAED,kHAAkH;AAClH,SAAS,aAAa,CAAC,MAAc;IACnC,MAAM,UAAU,GAAG,gBAAgB,CAAC,MAAM,CAAC,CAAC;IAC5C,IAAI,UAAU,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC;QAC9B,OAAO,EAAE,KAAK,EAAE,IAAA,wBAAU,EAAC,UAAU,CAAC,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC;IACzD,CAAC;IACD,OAAO,EAAE,UAAU,EAAE,CAAC;AACxB,CAAC;AAED,8FAA8F;AAC9F,SAAS,gBAAgB,CAAC,MAAc;IACtC,MAAM,KAAK,GAAG,uBAAuB,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IACnD,OAAO,KAAK,EAAE,CAAC,CAAC,CAAC,IAAI,MAAM,CAAC;AAC9B,CAAC;AAED,qGAAqG;AACrG,SAAS,0BAA0B,CAAC,MAAc,EAAE,eAA4B;IAC9E,MAAM,UAAU,GAAG,gBAAgB,CAAC,MAAM,CAAC,CAAC;IAC5C,IAAI,UAAU,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC;QAC9B,OAAO,KAAK,CAAC;IACf,CAAC;IACD,MAAM,OAAO,GAAG,mBAAmB,CAAC,UAAU,CAAC,CAAC;IAChD,OAAO,OAAO,CAAC,MAAM,GAAG,CAAC,IAAI,OAAO,CAAC,KAAK,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,eAAe,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC;AACpF,CAAC;AAED,sGAAsG;AACtG,SAAS,mBAAmB,CAAC,UAAkB;IAC7C,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAClC,KAAK,MAAM,KAAK,IAAI,UAAU,CAAC,QAAQ,CAAC,mCAAmC,CAAC,EAAE,CAAC;QAC7E,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;IACpC,CAAC;IACD,OAAO,CAAC,GAAG,OAAO,CAAC,CAAC;AACtB,CAAC;AAED,qFAAqF;AACrF,SAAS,WAAW,CAAC,KAAsB;IACzC,IAAA,8BAAe,EAAC,KAAK,EAAE;QACrB,SAAS,CAAC,CAAkB;YAC1B,IAAI,OAAO,IAAI,CAAC,CAAC,IAAI,EAAE,CAAC;gBACtB,CAAC,CAAC,IAAI,CAAC,KAAK,GAAG,GAAG,CAAC;YACrB,CAAC;QACH,CAAC;KACF,CAAC,CAAC;AACL,CAAC;AAED,qEAAqE;AACrE,SAAS,MAAM,CAAC,IAA4B,EAAE,SAAqB;IACjE,QAAQ,IAAI,CAAC,IAAI,EAAE,CAAC;QAClB,KAAK,IAAI,CAAC;QACV,KAAK,IAAI,CAAC;QACV,KAAK,KAAK,CAAC;QACX,KAAK,IAAI,CAAC;QACV,KAAK,KAAK,CAAC;QACX,KAAK,IAAI,CAAC;QACV,KAAK,MAAM,CAAC;QACZ,KAAK,OAAO,CAAC;QACb,KAAK,OAAO,CAAC;QACb,KAAK,QAAQ,CAAC;QACd,KAAK,OAAO,CAAC;QACb,KAAK,QAAQ,CAAC;QACd,KAAK,QAAQ,CAAC;QACd,KAAK,SAAS,CAAC;QACf,KAAK,gBAAgB,CAAC;QACtB,KAAK,mBAAmB,CAAC;QACzB,KAAK,UAAU,CAAC;QAChB,KAAK,UAAU,CAAC;QAChB,KAAK,aAAa,CAAC,CAAC,CAAC;YACnB,MAAM,EAAE,GAAG,4BAAM,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,oBAAoB,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC;YACtE,OAAO,CAAC,GAAG,EAAE,aAAa,SAAS,CAAC,IAAI,EAAE,EAAE,EAAE,KAAK,CAAC,CAAC;QACvD,CAAC;QACD,KAAK,WAAW,CAAC;QACjB,KAAK,WAAW,CAAC,CAAC,CAAC;YACjB,MAAM,EAAE,GAAI,4BAAc,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,oBAAoB,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC;YAC5F,OAAO,CAAC,GAAG,EAAE,aAAa,SAAS,CAAC,IAAI,EAAE,EAAE,EAAE,IAAI,CAAC,CAAC;QACtD,CAAC;QACD,KAAK,SAAS;YACZ,OAAO,CAAC,SAAS,EAAE,KAAK,CAAC,CAAC;QAC5B,KAAK,UAAU;YACb,OAAO,CAAC,aAAa,EAAE,KAAK,CAAC,CAAC;QAChC,KAAK,IAAI;YACP,OAAO,CAAC,kBAAkB,SAAS,CAAC,IAAI,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC;QACxD,KAAK,KAAK;YACR,OAAO,CAAC,mBAAmB,SAAS,CAAC,IAAI,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC;QACzD,KAAK,SAAS;YACZ,OAAO,CAAC,oBAAoB,SAAS,CAAC,IAAI,EAAE,iBAAiB,SAAS,CAAC,IAAI,EAAE,EAAE,EAAE,KAAK,CAAC,CAAC;QAC1F;YACE,IAAA,mBAAW,EAAC,IAAI,CAAC,CAAC;IACtB,CAAC;AACH,CAAC;AAED;;;;;;;;;GASG;AACH,SAAgB,cAAc,CAC5B,KAAa,EACb,OAAiD,EACjD,IAAoB;AACpB,oDAAoD;AACpD,QAAwB;IAExB,OAAO;QACL,KAAK;QACL,OAAO;QACP,KAAK,EAAE;YACL,IAAI,EAAE,KAAK;YACX,GAAG,EAAE;UACD,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,IAAI,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC;OAC1G;YACD,QAAQ;SACT;KACF,CAAC;AACJ,CAAC;AAED,oFAAoF;AACpF,SAAS,uBAAuB,CAAC,OAAuC;IACtE,MAAM,MAAM,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC;IAC1C,MAAM,QAAQ,GAAG,IAAI,KAAK,CAAU,MAAM,CAAC,CAAC;IAC5C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAChC,MAAM,KAAK,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;QACrC,IAAI,IAAI,GAAG,IAAI,CAAC;QAChB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACxC,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,EAAE,CAAC;gBAC9C,IAAI,GAAG,KAAK,CAAC;gBACb,MAAM;YACR,CAAC;QACH,CAAC;QACD,QAAQ,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;IACrB,CAAC;IACD,OAAO,QAAQ,CAAC;AAClB,CAAC;AAED;;;;;;GAMG;AACH,SAAS,SAAS,CAAC,CAAM,EAAE,CAAM;IAC/B,OAAO,IAAA,cAAK,EAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,IAAA,oBAAW,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;AACpF,CAAC;AAED,SAAgB,+BAA+B,CAAC,IAAoB,EAAE,KAAsB;IAC1F,6FAA6F;IAC7F,MAAM,KAAK,GAAG,eAAe,CAAC,KAAK,CAAC,CAAC;IACrC,WAAW,CAAC,KAAK,CAAC,CAAC;IACnB,IAAI,IAAI,CAAC,qBAAqB,EAAE,CAAC;QAC/B,8EAA8E;QAC7E,KAAa,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;IAClC,CAAC;IACD,qDAAqD;IACrD,OAAO,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;AAC/B,CAAC"}
+{"version":3,"file":"findDataLoader.js","names":[],"sources":["../../src/dataloaders/findDataLoader.ts"],"sourcesContent":["import { fastWhereFilterHash } from \"src/dataloaders/fastWhereFilterHash.ts\";\nimport type { OpColumn } from \"src/drivers/EntityWriter.ts\";\nimport type { Entity } from \"src/Entity.ts\";\nimport { type EntityManager, type MaybeAbstractEntityConstructor, getEmInternalApi } from \"src/EntityManager.ts\";\nimport { type EntityMetadata, getMetadata } from \"src/EntityMetadata.ts\";\nimport { equal, equalArrays } from \"src/fields.ts\";\nimport { buildHintTree } from \"src/loading/HintTree.ts\";\nimport type { LoadHint } from \"src/loading/loadHints.ts\";\nimport { hintKey } from \"src/normalizeHints.ts\";\nimport type { FilterAndSettings } from \"src/queries/find/EntityFilter.ts\";\nimport { opToFn } from \"src/queries/find/EntityGraphQLFilter.ts\";\nimport {\n  type ParsedCteClause,\n  type ParsedFindQuery,\n  type ParsedGroupBy,\n  type ParsedSelect,\n  getTables,\n  parseAlias,\n  parseFindQuery,\n} from \"src/queries/find/QueryParser.ts\";\nimport { isQueryProvablyEmpty, visitConditions } from \"src/queries/find/QueryVisitor.ts\";\nimport type { ColumnCondition, ParsedValueFilter, RawCondition } from \"src/queries/parsedConditions.ts\";\nimport { kqDot } from \"src/queries/sql/keywords.ts\";\nimport { buildUnnestCte } from \"src/queries/unnest.ts\";\nimport { assertNever, fail } from \"src/utils.ts\";\n\nexport const findOperation = \"find\";\n\ninterface PreparedFindEntry<T extends Entity> {\n  filter: FilterAndSettings<T>;\n  query: ParsedFindQuery;\n  bindings: any[];\n  findSettings: any;\n  checkLimit: boolean | undefined;\n}\n\nexport function findDataLoader<T extends Entity>(\n  em: EntityManager,\n  type: MaybeAbstractEntityConstructor<T>,\n  filter: FilterAndSettings<T>,\n  hint: LoadHint<T> | undefined,\n): Promise<T[]> {\n  const { where, ...opts } = filter;\n  if (\"limit\" in opts || \"offset\" in opts) {\n    throw new Error(\"Cannot use limit/offset with findDataLoader\");\n  }\n\n  const meta = getMetadata(type);\n  const query = parseFindQuery(meta, where, opts);\n  const { checkLimit, findSettings } = em[\"prepareFind\"](meta, findOperation, query, {\n    ...opts,\n    limit: em.entityLimit,\n  });\n  if (isQueryProvablyEmpty(query)) return Promise.resolve([]);\n\n  const bindings: any[] = [];\n  collectValues(bindings, query);\n  const prepared = { filter, query, bindings, findSettings, checkLimit } satisfies PreparedFindEntry<T>;\n  const batchKey = getBatchKeyFromGenericStructure(meta, query);\n\n  return em\n    .getLoader<PreparedFindEntry<T>, T[]>(\n      findOperation,\n      // It's unlikely we'll have simultaneous em.finds with the same WHERE clause structure\n      // but lots of different load hints, and it'd be complicated to implement the preloading\n      // in a way that doesn't naively over-fetch data (which our loadDataLoader does prevent,\n      // but it's simpler b/c it's given exact ids to load), so for now just include the load\n      // hint in the batch key.\n      `${batchKey}-${hintKey(hint)}`,\n      async (entries) => {\n        // We're guaranteed that these queries all have the same structure\n\n        // Don't bother with the CTE if there's only 1 query (or each query has exactly the same filter values)\n        if (entries.length === 1) {\n          const { query, findSettings, checkLimit } = entries[0];\n          // Maybe add preload joins\n          const { preloader } = getEmInternalApi(em);\n          const preloadHydrator = preloader && hint && preloader.addPreloading(meta, buildHintTree(hint), query);\n          const rowData = await em[\"executePreparedFindRowData\"](meta, findOperation, query, findSettings, checkLimit);\n          const entities = em[\"hydrateAndFinalize\"](type, rowData, {\n            sidecars: (entities) => preloadHydrator?.(rowData, entities),\n          });\n          return [filterDeletedEntities(em, entities)];\n        }\n\n        // WITH _find (tag, arg1, arg2) AS (\n        //   SELECT unnest($0::int[]), unnest($0::varchar[]), unnest($0::varchar[])\n        // )\n        // SELECT a.*, array_agg(_find.tag) AS _tags\n        // FROM authors a\n        // CROSS JOIN _find AS _find\n        // WHERE a.first_name = _find.arg0 OR a.last_name = _find.arg1\n        // GROUP BY a.id\n\n        // Build the list of 'arg1', 'arg2', ... strings\n        const { query, findSettings, checkLimit } = entries[0];\n        const { preloader } = getEmInternalApi(em);\n        const preloadJoins = preloader && hint && preloader.getPreloadJoins(meta, buildHintTree(hint), query);\n\n        const args = collectAndReplaceArgs(query, entries);\n        const argsColumns: OpColumn[] = [{ columnName: \"tag\", dbType: \"int\" }, ...args.map((a) => a.column)];\n        const columnValues = createColumnValuesFromPrepared(args, entries);\n        const query2: ParsedFindQuery = {\n          ...query,\n          selects: [\"array_agg(_find.tag) as _tags\", ...query.selects],\n          tables: [{ join: \"cross\", table: \"_find\", alias: \"_find\" }, ...query.tables],\n          ctes: [buildUnnestCte(\"_find\", argsColumns, columnValues), ...(query.ctes ?? [])],\n        };\n        if (preloadJoins) {\n          query2.selects.push(\n            ...preloadJoins.flatMap((j) =>\n              // Because we 'group by primary.id' to collapse the \"a1 matched multiple finds\" into\n              // a single row, we also need to pick just the first value of each preload column\n              j.selects.map((s) => `(array_agg(${s.value}))[1] AS ${s.as}`),\n            ),\n          );\n          query2.tables.push(...preloadJoins.map((j) => j.join));\n        }\n\n        // Because we want to use `array_agg(tag)`, add `GROUP BY`s to the values we're selecting\n        query2.groupBys = buildGroupBys(query2.selects);\n\n        // Also because of our `array_agg` group by, add any order bys to the group by\n        const [primary] = getTables(query2);\n        for (const { alias, column } of query2.orderBys) {\n          if (alias !== primary.alias) {\n            query2.groupBys.push({ alias, column });\n          }\n        }\n\n        const rowData = await em[\"executePreparedFindRowData\"](meta, findOperation, query2, findSettings, checkLimit);\n\n        // Make an empty array for each batched query, per the dataloader contract\n        const results = entries.map(() => [] as T[]);\n        em[\"hydrateAndFinalize\"](type, rowData, {\n          sidecars: (entities) => {\n            preloadJoins?.forEach((j) => j.hydrator(rowData, entities));\n            // Put each row into the tagged query it matched\n            for (let i = 0; i < entities.length; i++) {\n              const entity = entities[i];\n              if (!entity.isDeletedEntity) {\n                for (const tag of rowData.get(i, \"_tags\")) results[tag].push(entity);\n              }\n            }\n          },\n        });\n        return results;\n      },\n      // Our filter/order tuple is a complex object, so use a stable cache key to ensure caching works.\n      { cacheKeyFn: queryFilterHash },\n    )\n    .load(prepared);\n}\n\n/**\n * Returns a stable cache key from the already-parsed query rather than the raw `where`.\n *\n * A scope `where` is an opaque proxy that `fastWhereFilterHash` can't serialize — but it doesn't need\n * to: by this point the scope's structure and values are already worked into the `ParsedFindQuery`, so\n * hashing that distinguishes e.g. `Author.adult` (age>=18) from `Author.senior` (age>=65) correctly.\n */\nexport function queryFilterHash(entry: { query: ParsedFindQuery; findSettings: object }): any {\n  return whereFilterHash({ query: entry.query, findSettings: entry.findSettings });\n}\n\nexport function whereFilterHash(where: object): any {\n  const key = fastWhereFilterHash(where);\n  if (key === undefined) throw new Error(\"fastWhereFilterHash could not serialize find filter\");\n  return key;\n}\n\n/** Filters pending-delete entities in place to avoid allocating a replacement array for the common find path. */\nexport function filterDeletedEntities<T extends Entity>(em: EntityManager, entities: T[]): T[] {\n  // Most EMs never delete entities, so skip even the findIndex scan until a delete has happened.\n  if (!getEmInternalApi(em).hasAnyDeletes()) return entities;\n\n  const firstDeleted = entities.findIndex((entity) => entity.isDeletedEntity);\n  if (firstDeleted === -1) return entities;\n\n  let writeIndex = firstDeleted;\n  for (let readIndex = firstDeleted + 1; readIndex < entities.length; readIndex++) {\n    const entity = entities[readIndex];\n    if (!entity.isDeletedEntity) {\n      entities[writeIndex++] = entity;\n    }\n  }\n  entities.length = writeIndex;\n  return entities;\n}\n\nclass ArgCounter {\n  private index = 0;\n  next(): number {\n    return this.index++;\n  }\n}\n\n/**\n * A single batched arg: the `_find` CTE column to create, plus the index into each entry's `bindings`\n * array that fills it. `bindingIndex` can differ from the column's position because inlined constants\n * are skipped — see {@link collectAndReplaceArgs}.\n */\nexport interface CteArg {\n  column: OpColumn;\n  bindingIndex: number;\n}\n\n/**\n * Rewrites each batched arg in `query` into a `_find.argX` placeholder.\n *\n * Any condition whose value(s) are identical across every batched query is left inline (using\n * query's condition as-is from entity0), so it renders as `col = ?` for better query planning.\n *\n * The returned array has the non-constant CTE columns, one {@link CteArg} per `_find.argX`.\n *\n * Because constants are skipped, the 1st CTE column (i.e. for last name) might actually have a\n * binding index of `1` if we've skipped an early constant column (i.e. first name).\n *\n * @param query the initial query in the batch, that all other queries structurally match\n * @param entries the values (bindings) for each query in the batch\n */\nexport function collectAndReplaceArgs(query: ParsedFindQuery, entries: readonly { bindings: any[] }[]): CteArg[] {\n  const args: CteArg[] = [];\n  const argsIndex = new ArgCounter();\n  // `bindings` were pushed in this same `visitConditions` order, so we can walk the conditions and\n  // each entry's `bindings` in lockstep, deciding per condition whether to inline or batch its value(s).\n  const constant = computeConstantBindings(entries);\n  let bindingIndex = 0;\n  visitConditions(query, {\n    visitCond(c: ColumnCondition) {\n      if (\"value\" in c.cond) {\n        const { kind } = c.cond;\n        // `between` consumes two bindings, everything else (incl. array `in`/`nin`) consumes one.\n        const consumed = kind === \"between\" ? 2 : 1;\n        const start = bindingIndex;\n        bindingIndex += consumed;\n        // If every batched query shares this condition's value(s), leave it as a normal `col = ?`\n        // condition (rendered from `entries[0]`'s value) instead of threading it through the CTE.\n        let allConstant = true;\n        for (let k = 0; k < consumed; k++) {\n          if (!constant[start + k]) {\n            allConstant = false;\n            break;\n          }\n        }\n        if (allConstant) return;\n        // `arg${args.length}` keeps the CTE column names in step with the `_find.argX` references that\n        // `rewriteToRawCondition` emits, since both only advance for the args we actually batch.\n        if (kind === \"between\") {\n          args.push({ column: { columnName: `arg${args.length}`, dbType: c.dbType }, bindingIndex: start });\n          args.push({ column: { columnName: `arg${args.length}`, dbType: c.dbType }, bindingIndex: start + 1 });\n        } else {\n          // Figure out the _find CTE's `unnest($n::${dbType})` so Postgres knows what we're sending in\n          const dbType =\n            kind === \"in\" || kind === \"nin\"\n              ? `${c.dbType}[]` // `in`/`nin` compare against an array column\n              : kind === \"jsonPathExists\" || kind === \"jsonPathPredicate\"\n                ? \"jsonpath\" // jsonPath needs `::jsonpath` (not `::jsonb`, which would be an invalid `jsonb @@ jsonb`)\n                : c.dbType;\n          args.push({ column: { columnName: `arg${args.length}`, dbType }, bindingIndex: start });\n        }\n        return rewriteToRawCondition(c, argsIndex);\n      } else if (c.cond.kind === \"is-null\" || c.cond.kind === \"not-null\") {\n        // leave it alone\n      } else {\n        throw new Error(\"Unsupported\");\n      }\n    },\n  });\n  return args;\n}\n\nfunction rewriteToRawCondition(c: ColumnCondition, argsIndex: ArgCounter): RawCondition {\n  const [op, negate] = makeOp(c.cond, argsIndex);\n  return {\n    kind: \"raw\",\n    aliases: [c.alias],\n    condition: `${negate ? \"NOT \" : \"\"}${kqDot(c.alias, c.column)} ${op}`,\n    pruneable: c.pruneable ?? false,\n    bindings: [],\n  };\n}\n\n/**\n * Builds the column-major values for the `_find` CTE.\n *\n * Column 0 is the per-entry `tag`; the remaining columns mirror `args` 1:1, each pulling its\n * `bindingIndex` from every entry's `bindings` (so inlined constants are naturally skipped).\n */\nexport function createColumnValuesFromPrepared(\n  args: readonly CteArg[],\n  entries: readonly { bindings: any[] }[],\n): any[][] {\n  const columnValues: any[][] = new Array(args.length + 1);\n  for (let i = 0; i < columnValues.length; i++) columnValues[i] = [];\n  entries.forEach((entry, i) => {\n    columnValues[0].push(i);\n    for (let k = 0; k < args.length; k++) {\n      columnValues[k + 1].push(entry.bindings[args[k].bindingIndex]);\n    }\n  });\n  return columnValues;\n}\n\n/** Pushes the arg values of a given query in the cross-query `bindings` array. */\nexport function collectValues(bindings: any[], query: ParsedFindQuery): void {\n  visitConditions(query, {\n    visitCond(c: ColumnCondition) {\n      if (\"value\" in c.cond) {\n        // between has two values\n        if (c.cond.kind === \"between\") {\n          bindings.push(c.cond.value[0]);\n          bindings.push(c.cond.value[1]);\n        } else {\n          bindings.push(c.cond.value);\n        }\n      }\n    },\n  });\n}\n\n/** Returns true for select expressions that do not need to be represented in GROUP BY. */\nfunction isAggregateSelect(select: string): boolean {\n  return select.toLowerCase().includes(\"array_agg(\");\n}\n\n/** Builds GROUP BYs for selected values, accounting for whole-row selects that are grouped by primary key. */\nfunction buildGroupBys(selects: ParsedSelect[]): ParsedGroupBy[] {\n  const sqlSelects = selects.map(selectSqlForGroupBy);\n  const wholeRowAliases = new Set(\n    sqlSelects\n      .filter((select) => !isAggregateSelect(select) && stripSelectAlias(select).endsWith(\".*\"))\n      .map(parseAlias),\n  );\n  return sqlSelects\n    .filter((select) => !isAggregateSelect(select))\n    .filter((select) => !isCoveredByWholeRowGroupBy(select, wholeRowAliases))\n    .map((select) => groupBySelect(select));\n}\n\n/** Returns a SQL string for group-by analysis, until we support bindings in ParsedGroupBy. */\nfunction selectSqlForGroupBy(select: ParsedSelect): string {\n  if (typeof select === \"string\") {\n    return select;\n  }\n  throw new Error(`find batching does not support grouped selects with bindings: ${select.sql}`);\n}\n\n/** Builds a GROUP BY for a selected value so `array_agg(_find.tag)` can coexist with plugin-rewritten selects. */\nfunction groupBySelect(select: string): ParsedGroupBy {\n  const expression = stripSelectAlias(select);\n  if (expression.endsWith(\".*\")) {\n    return { alias: parseAlias(expression), column: \"id\" };\n  }\n  return { expression };\n}\n\n/** Removes a trailing SQL alias from a select expression, i.e. `(a.id) as id` -> `(a.id)`. */\nfunction stripSelectAlias(select: string): string {\n  const match = /^(.*)\\s+as\\s+[^\\s]+$/i.exec(select);\n  return match?.[1] ?? select;\n}\n\n/** Returns true when an expression is functionally covered by an already-grouped whole-row alias. */\nfunction isCoveredByWholeRowGroupBy(select: string, wholeRowAliases: Set<string>): boolean {\n  const expression = stripSelectAlias(select);\n  if (expression.endsWith(\".*\")) {\n    return false;\n  }\n  const aliases = findSelectedAliases(expression);\n  return aliases.length > 0 && aliases.every((alias) => wholeRowAliases.has(alias));\n}\n\n/** Finds SQL aliases referenced as `alias.column` or `\"alias\".column`, i.e. `a.first_name` -> `a`. */\nfunction findSelectedAliases(expression: string): string[] {\n  const aliases = new Set<string>();\n  for (const match of expression.matchAll(/(?:\"([^\"]+)\"|([a-zA-Z_][\\w]*))\\./g)) {\n    aliases.add(match[1] ?? match[2]);\n  }\n  return [...aliases];\n}\n\n/** Returns [operator, argsTaken, negate], i.e. `[\"=\", 1, false]`. */\nfunction makeOp(cond: ParsedValueFilter<any>, argsIndex: ArgCounter): [string, boolean] {\n  switch (cond.kind) {\n    case \"eq\":\n    case \"ne\":\n    case \"gte\":\n    case \"gt\":\n    case \"lte\":\n    case \"lt\":\n    case \"like\":\n    case \"nlike\":\n    case \"ilike\":\n    case \"nilike\":\n    case \"regex\":\n    case \"nregex\":\n    case \"iregex\":\n    case \"niregex\":\n    case \"jsonPathExists\":\n    case \"jsonPathPredicate\":\n    case \"contains\":\n    case \"overlaps\":\n    case \"containedBy\": {\n      const fn = opToFn[cond.kind] ?? fail(`Invalid operator ${cond.kind}`);\n      return [`${fn} _find.arg${argsIndex.next()}`, false];\n    }\n    case \"noverlaps\":\n    case \"ncontains\": {\n      const fn = (opToFn as any)[cond.kind.substring(1)] ?? fail(`Invalid operator ${cond.kind}`);\n      return [`${fn} _find.arg${argsIndex.next()}`, true];\n    }\n    case \"is-null\":\n      return [`IS NULL`, false];\n    case \"not-null\":\n      return [`IS NOT NULL`, false];\n    case \"in\":\n      return [`= ANY(_find.arg${argsIndex.next()})`, false];\n    case \"nin\":\n      return [`!= ALL(_find.arg${argsIndex.next()})`, false];\n    case \"between\":\n      return [`BETWEEN _find.arg${argsIndex.next()} AND _find.arg${argsIndex.next()}`, false];\n    default:\n      assertNever(cond);\n  }\n}\n\n/**\n * Creates a `VALUES (...), (...)` SQL string for use in a CTE, typically for our\n * batch INSERTs/UPDATEs where the CTE is how we inject N rows of data/params into\n * the single INSERT/UPDATE statement.\n *\n * The caller is responsible for filling in the `bindings`, which should have 1\n * entry for each `rows x columns` cell.\n *\n * @deprecated Use newUnnestCte instead because it uses arrays to have a bounded number of parameters.\n */\nexport function buildValuesCte(\n  alias: string,\n  columns: { columnName: string; dbType: string }[],\n  rows: readonly any[],\n  // Should have a value for each `row x column` cell.\n  bindings: readonly any[],\n): ParsedCteClause {\n  return {\n    alias,\n    columns,\n    query: {\n      kind: \"raw\",\n      sql: `VALUES\n        ${rows.map((_, i) => `(${columns.map((c) => (i === 0 ? `?::${c.dbType}` : `?`)).join(\", \")})`).join(\", \")}\n      `,\n      bindings,\n    },\n  };\n}\n\n/** Returns, per binding slot, whether every batched query shares the same value. */\nfunction computeConstantBindings(entries: readonly { bindings: any[] }[]): boolean[] {\n  const length = entries[0].bindings.length;\n  const constant = new Array<boolean>(length);\n  for (let j = 0; j < length; j++) {\n    const first = entries[0].bindings[j];\n    let same = true;\n    for (let i = 1; i < entries.length; i++) {\n      if (!argsEqual(entries[i].bindings[j], first)) {\n        same = false;\n        break;\n      }\n    }\n    constant[j] = same;\n  }\n  return constant;\n}\n\n/**\n * Deep-equals two find-arg values (scalars, Dates, Temporals, or arrays thereof), reusing the same\n * scalar/array equality `setField` uses for change detection.\n *\n * Only used to decide whether a condition can be inlined, so false negatives are safe (we just fall\n * back to the CTE); we only return true when the values are genuinely equal.\n */\nfunction argsEqual(a: any, b: any): boolean {\n  return equal(a, b) || (Array.isArray(a) && Array.isArray(b) && equalArrays(a, b));\n}\n\nexport function getBatchKeyFromGenericStructure(meta: EntityMetadata, query: ParsedFindQuery): string {\n  // Temporarily swap condition values for `*` so we can see the generic structure of the query,\n  // then restore them; this avoids deep-cloning the entire parsed query on every em.find call.\n  // Track values per condition object b/c parseFindQuery does not deep copy complex conditions,\n  // i.e. `a.firstName.eq(...)`, so the same condition instance could appear twice.\n  const saved = new Map<any, any>();\n  visitConditions(query, {\n    visitCond(c: ColumnCondition) {\n      const { cond } = c;\n      if (\"value\" in cond && !saved.has(cond)) {\n        saved.set(cond, cond.value);\n        cond.value = \"*\";\n      }\n    },\n  });\n  const structure = JSON.stringify(query);\n  for (const [cond, value] of saved) cond.value = value;\n  // Include the meta b/c STI queries for different subtypes will look identical\n  return meta.stiDiscriminatorValue ? `${structure}|${meta.type}` : structure;\n}\n"],"mappings":";;;;;;;;;;;;;AA0BA,MAAa,gBAAgB;AAU7B,SAAgB,eACd,IACA,MACA,QACA,MACc;CACd,MAAM,EAAE,OAAO,GAAG,SAAS;CAC3B,IAAI,WAAW,QAAQ,YAAY,MACjC,MAAM,IAAI,MAAM,6CAA6C;CAG/D,MAAM,OAAO,YAAY,IAAI;CAC7B,MAAM,QAAQ,eAAe,MAAM,OAAO,IAAI;CAC9C,MAAM,EAAE,YAAY,iBAAiB,GAAG,cAAc,CAAC,MAAM,eAAe,OAAO;EACjF,GAAG;EACH,OAAO,GAAG;CACZ,CAAC;CACD,IAAI,qBAAqB,KAAK,GAAG,OAAO,QAAQ,QAAQ,CAAC,CAAC;CAE1D,MAAM,WAAkB,CAAC;CACzB,cAAc,UAAU,KAAK;CAC7B,MAAM,WAAW;EAAE;EAAQ;EAAO;EAAU;EAAc;CAAW;CACrE,MAAM,WAAW,gCAAgC,MAAM,KAAK;CAE5D,OAAO,GACJ,UACC,eAMA,GAAG,SAAS,GAAG,QAAQ,IAAI,KAC3B,OAAO,YAAY;EAIjB,IAAI,QAAQ,WAAW,GAAG;GACxB,MAAM,EAAE,OAAO,cAAc,eAAe,QAAQ;GAEpD,MAAM,EAAE,cAAc,iBAAiB,EAAE;GACzC,MAAM,kBAAkB,aAAa,QAAQ,UAAU,cAAc,MAAM,cAAc,IAAI,GAAG,KAAK;GACrG,MAAM,UAAU,MAAM,GAAG,6BAA6B,CAAC,MAAM,eAAe,OAAO,cAAc,UAAU;GAI3G,OAAO,CAAC,sBAAsB,IAHb,GAAG,qBAAqB,CAAC,MAAM,SAAS,EACvD,WAAW,aAAa,kBAAkB,SAAS,QAAQ,EAC7D,CACyC,CAAC,CAAC;EAC7C;EAYA,MAAM,EAAE,OAAO,cAAc,eAAe,QAAQ;EACpD,MAAM,EAAE,cAAc,iBAAiB,EAAE;EACzC,MAAM,eAAe,aAAa,QAAQ,UAAU,gBAAgB,MAAM,cAAc,IAAI,GAAG,KAAK;EAEpG,MAAM,OAAO,sBAAsB,OAAO,OAAO;EACjD,MAAM,cAA0B,CAAC;GAAE,YAAY;GAAO,QAAQ;EAAM,GAAG,GAAG,KAAK,KAAK,MAAM,EAAE,MAAM,CAAC;EACnG,MAAM,eAAe,+BAA+B,MAAM,OAAO;EACjE,MAAM,SAA0B;GAC9B,GAAG;GACH,SAAS,CAAC,iCAAiC,GAAG,MAAM,OAAO;GAC3D,QAAQ,CAAC;IAAE,MAAM;IAAS,OAAO;IAAS,OAAO;GAAQ,GAAG,GAAG,MAAM,MAAM;GAC3E,MAAM,CAAC,eAAe,SAAS,aAAa,YAAY,GAAG,GAAI,MAAM,QAAQ,CAAC,CAAE;EAClF;EACA,IAAI,cAAc;GAChB,OAAO,QAAQ,KACb,GAAG,aAAa,SAAS,MAGvB,EAAE,QAAQ,KAAK,MAAM,cAAc,EAAE,MAAM,WAAW,EAAE,IAAI,CAC9D,CACF;GACA,OAAO,OAAO,KAAK,GAAG,aAAa,KAAK,MAAM,EAAE,IAAI,CAAC;EACvD;EAGA,OAAO,WAAW,cAAc,OAAO,OAAO;EAG9C,MAAM,CAAC,WAAW,UAAU,MAAM;EAClC,KAAK,MAAM,EAAE,OAAO,YAAY,OAAO,UACrC,IAAI,UAAU,QAAQ,OACpB,OAAO,SAAS,KAAK;GAAE;GAAO;EAAO,CAAC;EAI1C,MAAM,UAAU,MAAM,GAAG,6BAA6B,CAAC,MAAM,eAAe,QAAQ,cAAc,UAAU;EAG5G,MAAM,UAAU,QAAQ,UAAU,CAAC,CAAQ;EAC3C,GAAG,qBAAqB,CAAC,MAAM,SAAS,EACtC,WAAW,aAAa;GACtB,cAAc,SAAS,MAAM,EAAE,SAAS,SAAS,QAAQ,CAAC;GAE1D,KAAK,IAAI,IAAI,GAAG,IAAI,SAAS,QAAQ,KAAK;IACxC,MAAM,SAAS,SAAS;IACxB,IAAI,CAAC,OAAO,iBACV,KAAK,MAAM,OAAO,QAAQ,IAAI,GAAG,OAAO,GAAG,QAAQ,IAAI,CAAC,KAAK,MAAM;GAEvE;EACF,EACF,CAAC;EACD,OAAO;CACT,GAEA,EAAE,YAAY,gBAAgB,CAChC,CAAC,CACA,KAAK,QAAQ;AAClB;;;;;;;;AASA,SAAgB,gBAAgB,OAA8D;CAC5F,OAAO,gBAAgB;EAAE,OAAO,MAAM;EAAO,cAAc,MAAM;CAAa,CAAC;AACjF;AAEA,SAAgB,gBAAgB,OAAoB;CAClD,MAAM,MAAM,oBAAoB,KAAK;CACrC,IAAI,QAAQ,KAAA,GAAW,MAAM,IAAI,MAAM,qDAAqD;CAC5F,OAAO;AACT;;AAGA,SAAgB,sBAAwC,IAAmB,UAAoB;CAE7F,IAAI,CAAC,iBAAiB,EAAE,CAAC,CAAC,cAAc,GAAG,OAAO;CAElD,MAAM,eAAe,SAAS,WAAW,WAAW,OAAO,eAAe;CAC1E,IAAI,iBAAiB,IAAI,OAAO;CAEhC,IAAI,aAAa;CACjB,KAAK,IAAI,YAAY,eAAe,GAAG,YAAY,SAAS,QAAQ,aAAa;EAC/E,MAAM,SAAS,SAAS;EACxB,IAAI,CAAC,OAAO,iBACV,SAAS,gBAAgB;CAE7B;CACA,SAAS,SAAS;CAClB,OAAO;AACT;AAEA,IAAM,aAAN,MAAiB;CACf,QAAgB;CAChB,OAAe;EACb,OAAO,KAAK;CACd;AACF;;;;;;;;;;;;;;;AA0BA,SAAgB,sBAAsB,OAAwB,SAAmD;CAC/G,MAAM,OAAiB,CAAC;CACxB,MAAM,YAAY,IAAI,WAAW;CAGjC,MAAM,WAAW,wBAAwB,OAAO;CAChD,IAAI,eAAe;CACnB,gBAAgB,OAAO,EACrB,UAAU,GAAoB;EAC5B,IAAI,WAAW,EAAE,MAAM;GACrB,MAAM,EAAE,SAAS,EAAE;GAEnB,MAAM,WAAW,SAAS,YAAY,IAAI;GAC1C,MAAM,QAAQ;GACd,gBAAgB;GAGhB,IAAI,cAAc;GAClB,KAAK,IAAI,IAAI,GAAG,IAAI,UAAU,KAC5B,IAAI,CAAC,SAAS,QAAQ,IAAI;IACxB,cAAc;IACd;GACF;GAEF,IAAI,aAAa;GAGjB,IAAI,SAAS,WAAW;IACtB,KAAK,KAAK;KAAE,QAAQ;MAAE,YAAY,MAAM,KAAK;MAAU,QAAQ,EAAE;KAAO;KAAG,cAAc;IAAM,CAAC;IAChG,KAAK,KAAK;KAAE,QAAQ;MAAE,YAAY,MAAM,KAAK;MAAU,QAAQ,EAAE;KAAO;KAAG,cAAc,QAAQ;IAAE,CAAC;GACtG,OAAO;IAEL,MAAM,SACJ,SAAS,QAAQ,SAAS,QACtB,GAAG,EAAE,OAAO,MACZ,SAAS,oBAAoB,SAAS,sBACpC,aACA,EAAE;IACV,KAAK,KAAK;KAAE,QAAQ;MAAE,YAAY,MAAM,KAAK;MAAU;KAAO;KAAG,cAAc;IAAM,CAAC;GACxF;GACA,OAAO,sBAAsB,GAAG,SAAS;EAC3C,OAAO,IAAI,EAAE,KAAK,SAAS,aAAa,EAAE,KAAK,SAAS,YAAY,CAEpE,OACE,MAAM,IAAI,MAAM,aAAa;CAEjC,EACF,CAAC;CACD,OAAO;AACT;AAEA,SAAS,sBAAsB,GAAoB,WAAqC;CACtF,MAAM,CAAC,IAAI,UAAU,OAAO,EAAE,MAAM,SAAS;CAC7C,OAAO;EACL,MAAM;EACN,SAAS,CAAC,EAAE,KAAK;EACjB,WAAW,GAAG,SAAS,SAAS,KAAK,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,GAAG;EACjE,WAAW,EAAE,aAAa;EAC1B,UAAU,CAAC;CACb;AACF;;;;;;;AAQA,SAAgB,+BACd,MACA,SACS;CACT,MAAM,eAAwB,IAAI,MAAM,KAAK,SAAS,CAAC;CACvD,KAAK,IAAI,IAAI,GAAG,IAAI,aAAa,QAAQ,KAAK,aAAa,KAAK,CAAC;CACjE,QAAQ,SAAS,OAAO,MAAM;EAC5B,aAAa,EAAE,CAAC,KAAK,CAAC;EACtB,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,QAAQ,KAC/B,aAAa,IAAI,EAAE,CAAC,KAAK,MAAM,SAAS,KAAK,EAAE,CAAC,aAAa;CAEjE,CAAC;CACD,OAAO;AACT;;AAGA,SAAgB,cAAc,UAAiB,OAA8B;CAC3E,gBAAgB,OAAO,EACrB,UAAU,GAAoB;EAC5B,IAAI,WAAW,EAAE,MAAM;GAErB,IAAI,EAAE,KAAK,SAAS,WAAW;IAC7B,SAAS,KAAK,EAAE,KAAK,MAAM,EAAE;IAC7B,SAAS,KAAK,EAAE,KAAK,MAAM,EAAE;GAC/B,OACE,SAAS,KAAK,EAAE,KAAK,KAAK;EAE9B;CACF,EACF,CAAC;AACH;;AAGA,SAAS,kBAAkB,QAAyB;CAClD,OAAO,OAAO,YAAY,CAAC,CAAC,SAAS,YAAY;AACnD;;AAGA,SAAS,cAAc,SAA0C;CAC/D,MAAM,aAAa,QAAQ,IAAI,mBAAmB;CAClD,MAAM,kBAAkB,IAAI,IAC1B,WACG,QAAQ,WAAW,CAAC,kBAAkB,MAAM,KAAK,iBAAiB,MAAM,CAAC,CAAC,SAAS,IAAI,CAAC,CAAC,CACzF,IAAI,UAAU,CACnB;CACA,OAAO,WACJ,QAAQ,WAAW,CAAC,kBAAkB,MAAM,CAAC,CAAC,CAC9C,QAAQ,WAAW,CAAC,2BAA2B,QAAQ,eAAe,CAAC,CAAC,CACxE,KAAK,WAAW,cAAc,MAAM,CAAC;AAC1C;;AAGA,SAAS,oBAAoB,QAA8B;CACzD,IAAI,OAAO,WAAW,UACpB,OAAO;CAET,MAAM,IAAI,MAAM,iEAAiE,OAAO,KAAK;AAC/F;;AAGA,SAAS,cAAc,QAA+B;CACpD,MAAM,aAAa,iBAAiB,MAAM;CAC1C,IAAI,WAAW,SAAS,IAAI,GAC1B,OAAO;EAAE,OAAO,WAAW,UAAU;EAAG,QAAQ;CAAK;CAEvD,OAAO,EAAE,WAAW;AACtB;;AAGA,SAAS,iBAAiB,QAAwB;CAEhD,OADc,wBAAwB,KAAK,MAChC,CAAC,GAAG,MAAM;AACvB;;AAGA,SAAS,2BAA2B,QAAgB,iBAAuC;CACzF,MAAM,aAAa,iBAAiB,MAAM;CAC1C,IAAI,WAAW,SAAS,IAAI,GAC1B,OAAO;CAET,MAAM,UAAU,oBAAoB,UAAU;CAC9C,OAAO,QAAQ,SAAS,KAAK,QAAQ,OAAO,UAAU,gBAAgB,IAAI,KAAK,CAAC;AAClF;;AAGA,SAAS,oBAAoB,YAA8B;CACzD,MAAM,0BAAU,IAAI,IAAY;CAChC,KAAK,MAAM,SAAS,WAAW,SAAS,mCAAmC,GACzE,QAAQ,IAAI,MAAM,MAAM,MAAM,EAAE;CAElC,OAAO,CAAC,GAAG,OAAO;AACpB;;AAGA,SAAS,OAAO,MAA8B,WAA0C;CACtF,QAAQ,KAAK,MAAb;EACE,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK,eAEH,OAAO,CAAC,GADG,OAAO,KAAK,SAAS,KAAK,oBAAoB,KAAK,MAAM,EACtD,YAAY,UAAU,KAAK,KAAK,KAAK;EAErD,KAAK;EACL,KAAK,aAEH,OAAO,CAAC,GADI,OAAe,KAAK,KAAK,UAAU,CAAC,MAAM,KAAK,oBAAoB,KAAK,MAAM,EAC5E,YAAY,UAAU,KAAK,KAAK,IAAI;EAEpD,KAAK,WACH,OAAO,CAAC,WAAW,KAAK;EAC1B,KAAK,YACH,OAAO,CAAC,eAAe,KAAK;EAC9B,KAAK,MACH,OAAO,CAAC,kBAAkB,UAAU,KAAK,EAAE,IAAI,KAAK;EACtD,KAAK,OACH,OAAO,CAAC,mBAAmB,UAAU,KAAK,EAAE,IAAI,KAAK;EACvD,KAAK,WACH,OAAO,CAAC,oBAAoB,UAAU,KAAK,EAAE,gBAAgB,UAAU,KAAK,KAAK,KAAK;EACxF,SACE,YAAY,IAAI;CACpB;AACF;;;;;;;;;;;AAYA,SAAgB,eACd,OACA,SACA,MAEA,UACiB;CACjB,OAAO;EACL;EACA;EACA,OAAO;GACL,MAAM;GACN,KAAK;UACD,KAAK,KAAK,GAAG,MAAM,IAAI,QAAQ,KAAK,MAAO,MAAM,IAAI,MAAM,EAAE,WAAW,GAAI,CAAC,CAAC,KAAK,IAAI,EAAE,EAAE,CAAC,CAAC,KAAK,IAAI,EAAE;;GAE5G;EACF;CACF;AACF;;AAGA,SAAS,wBAAwB,SAAoD;CACnF,MAAM,SAAS,QAAQ,EAAE,CAAC,SAAS;CACnC,MAAM,WAAW,IAAI,MAAe,MAAM;CAC1C,KAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,KAAK;EAC/B,MAAM,QAAQ,QAAQ,EAAE,CAAC,SAAS;EAClC,IAAI,OAAO;EACX,KAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,QAAQ,KAClC,IAAI,CAAC,UAAU,QAAQ,EAAE,CAAC,SAAS,IAAI,KAAK,GAAG;GAC7C,OAAO;GACP;EACF;EAEF,SAAS,KAAK;CAChB;CACA,OAAO;AACT;;;;;;;;AASA,SAAS,UAAU,GAAQ,GAAiB;CAC1C,OAAO,MAAM,GAAG,CAAC,KAAM,MAAM,QAAQ,CAAC,KAAK,MAAM,QAAQ,CAAC,KAAK,YAAY,GAAG,CAAC;AACjF;AAEA,SAAgB,gCAAgC,MAAsB,OAAgC;CAKpG,MAAM,wBAAQ,IAAI,IAAc;CAChC,gBAAgB,OAAO,EACrB,UAAU,GAAoB;EAC5B,MAAM,EAAE,SAAS;EACjB,IAAI,WAAW,QAAQ,CAAC,MAAM,IAAI,IAAI,GAAG;GACvC,MAAM,IAAI,MAAM,KAAK,KAAK;GAC1B,KAAK,QAAQ;EACf;CACF,EACF,CAAC;CACD,MAAM,YAAY,KAAK,UAAU,KAAK;CACtC,KAAK,MAAM,CAAC,MAAM,UAAU,OAAO,KAAK,QAAQ;CAEhD,OAAO,KAAK,wBAAwB,GAAG,UAAU,GAAG,KAAK,SAAS;AACpE"}

package/build/dataloaders/findIdsDataLoader.cjs

@@ -0,0 +1,82 @@
+Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
+const require_keys = require("../keys.cjs");
+const require_queries_sql_keywords = require("../queries/sql/keywords.cjs");
+const require_queries_find_QueryVisitor = require("../queries/find/QueryVisitor.cjs");
+const require_queries_find_QueryParser = require("../queries/find/QueryParser.cjs");
+const require_utils = require("../utils.cjs");
+const require_EntityMetadata = require("../EntityMetadata.cjs");
+const require_queries_unnest = require("../queries/unnest.cjs");
+const require_dataloaders_findDataLoader = require("./findDataLoader.cjs");
+//#region src/dataloaders/findIdsDataLoader.ts
+const findIdsOperation = "find-ids";
+function findIdsDataLoader(em, type, filter) {
+	const { where, ...opts } = filter;
+	if (opts.limit || opts.offset) throw new Error("Cannot use limit/offset with findIdsDataLoader");
+	const meta = require_EntityMetadata.getMetadata(type);
+	const query = require_queries_find_QueryParser.parseFindQuery(meta, where, opts);
+	const { findSettings } = em["prepareFind"](meta, findIdsOperation, query, {
+		...opts,
+		limit: void 0
+	});
+	if (require_queries_find_QueryVisitor.isQueryProvablyEmpty(query)) return Promise.resolve([]);
+	const bindings = [];
+	require_dataloaders_findDataLoader.collectValues(bindings, query);
+	const prepared = {
+		filter,
+		query,
+		bindings,
+		findSettings
+	};
+	const batchKey = require_dataloaders_findDataLoader.getBatchKeyFromGenericStructure(meta, query);
+	return em.getLoader(findIdsOperation, batchKey, async (entries) => {
+		if (entries.length === 1) {
+			const { query, findSettings } = entries[0];
+			const primary = query.tables.find((t) => t.join === "primary") ?? require_utils.fail("No primary");
+			query.selects = [`${require_queries_sql_keywords.kq(primary.alias)}.id as id`];
+			query.orderBys = [{
+				alias: primary.alias,
+				column: "id",
+				order: "ASC"
+			}];
+			return [(await em["executePreparedFind"](meta, findIdsOperation, query, findSettings, false)).map((row) => require_keys.keyToTaggedId(meta, row.id))];
+		}
+		const { query, findSettings } = entries[0];
+		const args = require_dataloaders_findDataLoader.collectAndReplaceArgs(query, entries);
+		const argsColumns = [{
+			columnName: "tag",
+			dbType: "int"
+		}, ...args.map((a) => a.column)];
+		const primary = query.tables.find((t) => t.join === "primary") ?? require_utils.fail("No primary");
+		query.selects = [`${require_queries_sql_keywords.kq(primary.alias)}.id as id`];
+		query.orderBys = [{
+			alias: primary.alias,
+			column: "id",
+			order: "ASC"
+		}];
+		const query2 = {
+			selects: ["_find.tag as tag", "_data.id as id"],
+			tables: [{
+				join: "primary",
+				table: "_find",
+				alias: "_find"
+			}, {
+				join: "lateral",
+				query,
+				table: meta.tableName,
+				alias: "_data",
+				fromAlias: "_f"
+			}],
+			ctes: [require_queries_unnest.buildUnnestCte("_find", argsColumns, require_dataloaders_findDataLoader.createColumnValuesFromPrepared(args, entries))],
+			orderBys: []
+		};
+		const rows = await em["executePreparedFind"](meta, findIdsOperation, query2, findSettings, false);
+		const results = entries.map(() => []);
+		for (const row of rows) results[row.tag].push(require_keys.keyToTaggedId(meta, row.id));
+		return results;
+	}, { cacheKeyFn: require_dataloaders_findDataLoader.queryFilterHash }).load(prepared);
+}
+//#endregion
+exports.findIdsDataLoader = findIdsDataLoader;
+exports.findIdsOperation = findIdsOperation;
+
+//# sourceMappingURL=findIdsDataLoader.cjs.map

package/build/dataloaders/findIdsDataLoader.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"findIdsDataLoader.cjs","names":["getMetadata","parseFindQuery","isQueryProvablyEmpty","getBatchKeyFromGenericStructure","fail","kq","keyToTaggedId","collectAndReplaceArgs","buildUnnestCte","createColumnValuesFromPrepared","queryFilterHash"],"sources":["../../src/dataloaders/findIdsDataLoader.ts"],"sourcesContent":["import {\n  collectAndReplaceArgs,\n  collectValues,\n  createColumnValuesFromPrepared,\n  getBatchKeyFromGenericStructure,\n  queryFilterHash,\n} from \"src/dataloaders/findDataLoader.ts\";\nimport type { Entity } from \"src/Entity.ts\";\nimport type { EntityManager, MaybeAbstractEntityConstructor } from \"src/EntityManager.ts\";\nimport { getMetadata } from \"src/EntityMetadata.ts\";\nimport { keyToTaggedId } from \"src/keys.ts\";\nimport type { FilterAndSettings } from \"src/queries/find/EntityFilter.ts\";\nimport { type ParsedFindQuery, parseFindQuery } from \"src/queries/find/QueryParser.ts\";\nimport { isQueryProvablyEmpty } from \"src/queries/find/QueryVisitor.ts\";\nimport { kq } from \"src/queries/sql/keywords.ts\";\nimport { buildUnnestCte } from \"src/queries/unnest.ts\";\nimport { fail } from \"src/utils.ts\";\n\nexport const findIdsOperation = \"find-ids\";\n\nexport function findIdsDataLoader<T extends Entity>(\n  em: EntityManager,\n  type: MaybeAbstractEntityConstructor<T>,\n  filter: FilterAndSettings<T>,\n): Promise<string[]> {\n  const { where, ...opts } = filter;\n  if (opts.limit || opts.offset) {\n    throw new Error(\"Cannot use limit/offset with findIdsDataLoader\");\n  }\n\n  const meta = getMetadata(type);\n  const query = parseFindQuery(meta, where, opts);\n  const { findSettings } = em[\"prepareFind\"](meta, findIdsOperation, query, { ...opts, limit: undefined });\n  if (isQueryProvablyEmpty(query)) return Promise.resolve([]);\n\n  const bindings: any[] = [];\n  collectValues(bindings, query);\n  const prepared = { filter, query, bindings, findSettings };\n  const batchKey = getBatchKeyFromGenericStructure(meta, query);\n\n  return em\n    .getLoader<typeof prepared, string[]>(\n      findIdsOperation,\n      batchKey,\n      async (entries) => {\n        // We're guaranteed that these queries all have the same structure\n\n        // Don't bother with the CTE if there's only 1 query (or each query has exactly the same filter values)\n        if (entries.length === 1) {\n          const { query, findSettings } = entries[0];\n          const primary = query.tables.find((t) => t.join === \"primary\") ?? fail(\"No primary\");\n          query.selects = [`${kq(primary.alias)}.id as id`];\n          query.orderBys = [{ alias: primary.alias, column: \"id\", order: \"ASC\" }];\n          const rows = await em[\"executePreparedFind\"](meta, findIdsOperation, query, findSettings, false);\n          return [rows.map((row: any) => keyToTaggedId(meta, row.id)!)];\n        }\n\n        // WITH _find (tag, arg1, arg2) AS (\n        //   SELECT unnest($0::int[]) unnest($0::varchar[]), unnest($0::varchar[])\n        // )\n        // SELECT _find.tag, _data.id\n        // FROM _find\n        // CROSS JOIN LATERAL (\n        //   SELECT distinct a.id as id\n        //   FROM author a WHERE a.first_name = _find.arg1 OR a.last_name = _find.arg2\n        // ) _data\n\n        // Build the list of 'arg1', 'arg2', ... strings\n        const { query, findSettings } = entries[0];\n        const args = collectAndReplaceArgs(query, entries);\n        const argsColumns = [{ columnName: \"tag\", dbType: \"int\" }, ...args.map((a) => a.column)];\n\n        // We're not returning the entities, just selecting their IDs\n        const primary = query.tables.find((t) => t.join === \"primary\") ?? fail(\"No primary\");\n        query.selects = [`${kq(primary.alias)}.id as id`];\n        query.orderBys = [{ alias: primary.alias, column: \"id\", order: \"ASC\" }];\n\n        const query2: ParsedFindQuery = {\n          selects: [\"_find.tag as tag\", \"_data.id as id\"],\n          tables: [\n            { join: \"primary\", table: \"_find\", alias: \"_find\" },\n            { join: \"lateral\", query, table: meta.tableName, alias: \"_data\", fromAlias: \"_f\" },\n          ],\n          // For each unique query, capture its filter values in `bindings` to populate the CTE _find table\n          ctes: [buildUnnestCte(\"_find\", argsColumns, createColumnValuesFromPrepared(args, entries))],\n          orderBys: [],\n        };\n\n        const rows = await em[\"executePreparedFind\"](meta, findIdsOperation, query2, findSettings, false);\n\n        // Make an empty array for each batched query, per the dataloader contract\n        const results: string[][] = entries.map(() => []);\n        // Then put each row's ID into the tagged query it matched\n        for (const row of rows) {\n          results[row.tag].push(keyToTaggedId(meta, row.id)!);\n        }\n        return results;\n      },\n      // Our filter/order tuple is a complex object, so use a stable cache key to ensure caching works.\n      { cacheKeyFn: queryFilterHash },\n    )\n    .load(prepared);\n}\n"],"mappings":";;;;;;;;;;AAkBA,MAAa,mBAAmB;AAEhC,SAAgB,kBACd,IACA,MACA,QACmB;CACnB,MAAM,EAAE,OAAO,GAAG,SAAS;CAC3B,IAAI,KAAK,SAAS,KAAK,QACrB,MAAM,IAAI,MAAM,gDAAgD;CAGlE,MAAM,OAAOA,uBAAAA,YAAY,IAAI;CAC7B,MAAM,QAAQC,iCAAAA,eAAe,MAAM,OAAO,IAAI;CAC9C,MAAM,EAAE,iBAAiB,GAAG,cAAc,CAAC,MAAM,kBAAkB,OAAO;EAAE,GAAG;EAAM,OAAO,KAAA;CAAU,CAAC;CACvG,IAAIC,kCAAAA,qBAAqB,KAAK,GAAG,OAAO,QAAQ,QAAQ,CAAC,CAAC;CAE1D,MAAM,WAAkB,CAAC;CACzB,mCAAA,cAAc,UAAU,KAAK;CAC7B,MAAM,WAAW;EAAE;EAAQ;EAAO;EAAU;CAAa;CACzD,MAAM,WAAWC,mCAAAA,gCAAgC,MAAM,KAAK;CAE5D,OAAO,GACJ,UACC,kBACA,UACA,OAAO,YAAY;EAIjB,IAAI,QAAQ,WAAW,GAAG;GACxB,MAAM,EAAE,OAAO,iBAAiB,QAAQ;GACxC,MAAM,UAAU,MAAM,OAAO,MAAM,MAAM,EAAE,SAAS,SAAS,KAAKC,cAAAA,KAAK,YAAY;GACnF,MAAM,UAAU,CAAC,GAAGC,6BAAAA,GAAG,QAAQ,KAAK,EAAE,UAAU;GAChD,MAAM,WAAW,CAAC;IAAE,OAAO,QAAQ;IAAO,QAAQ;IAAM,OAAO;GAAM,CAAC;GAEtE,OAAO,EAAC,MADW,GAAG,sBAAsB,CAAC,MAAM,kBAAkB,OAAO,cAAc,KAAK,EAAA,CAClF,KAAK,QAAaC,aAAAA,cAAc,MAAM,IAAI,EAAE,CAAE,CAAC;EAC9D;EAaA,MAAM,EAAE,OAAO,iBAAiB,QAAQ;EACxC,MAAM,OAAOC,mCAAAA,sBAAsB,OAAO,OAAO;EACjD,MAAM,cAAc,CAAC;GAAE,YAAY;GAAO,QAAQ;EAAM,GAAG,GAAG,KAAK,KAAK,MAAM,EAAE,MAAM,CAAC;EAGvF,MAAM,UAAU,MAAM,OAAO,MAAM,MAAM,EAAE,SAAS,SAAS,KAAKH,cAAAA,KAAK,YAAY;EACnF,MAAM,UAAU,CAAC,GAAGC,6BAAAA,GAAG,QAAQ,KAAK,EAAE,UAAU;EAChD,MAAM,WAAW,CAAC;GAAE,OAAO,QAAQ;GAAO,QAAQ;GAAM,OAAO;EAAM,CAAC;EAEtE,MAAM,SAA0B;GAC9B,SAAS,CAAC,oBAAoB,gBAAgB;GAC9C,QAAQ,CACN;IAAE,MAAM;IAAW,OAAO;IAAS,OAAO;GAAQ,GAClD;IAAE,MAAM;IAAW;IAAO,OAAO,KAAK;IAAW,OAAO;IAAS,WAAW;GAAK,CACnF;GAEA,MAAM,CAACG,uBAAAA,eAAe,SAAS,aAAaC,mCAAAA,+BAA+B,MAAM,OAAO,CAAC,CAAC;GAC1F,UAAU,CAAC;EACb;EAEA,MAAM,OAAO,MAAM,GAAG,sBAAsB,CAAC,MAAM,kBAAkB,QAAQ,cAAc,KAAK;EAGhG,MAAM,UAAsB,QAAQ,UAAU,CAAC,CAAC;EAEhD,KAAK,MAAM,OAAO,MAChB,QAAQ,IAAI,IAAI,CAAC,KAAKH,aAAAA,cAAc,MAAM,IAAI,EAAE,CAAE;EAEpD,OAAO;CACT,GAEA,EAAE,YAAYI,mCAAAA,gBAAgB,CAChC,CAAC,CACA,KAAK,QAAQ;AAClB"}

package/build/dataloaders/findIdsDataLoader.d.cts

@@ -0,0 +1,9 @@
+import { FilterAndSettings } from "../queries/find/EntityFilter.cjs";
+import { EntityManager, MaybeAbstractEntityConstructor } from "../EntityManager.cjs";
+import { Entity } from "../Entity.cjs";
+//#region src/dataloaders/findIdsDataLoader.d.ts
+declare const findIdsOperation = "find-ids";
+declare function findIdsDataLoader<T extends Entity>(em: EntityManager, type: MaybeAbstractEntityConstructor<T>, filter: FilterAndSettings<T>): Promise<string[]>;
+//#endregion
+export { findIdsDataLoader, findIdsOperation };
+//# sourceMappingURL=findIdsDataLoader.d.cts.map

package/build/dataloaders/findIdsDataLoader.d.cts.map

@@ -0,0 +1 @@
+{"version":3,"file":"findIdsDataLoader.d.cts","names":[],"sources":["../../src/dataloaders/findIdsDataLoader.ts"],"mappings":";;;;cAkBa;iBAEG,kBAAkB,UAAU,QAC1C,IAAI,eACJ,MAAM,+BAA+B,IACrC,QAAQ,kBAAkB,KACzB"}

package/build/dataloaders/findIdsDataLoader.d.mts

@@ -0,0 +1,9 @@
+import { FilterAndSettings } from "../queries/find/EntityFilter.mjs";
+import { EntityManager, MaybeAbstractEntityConstructor } from "../EntityManager.mjs";
+import { Entity } from "../Entity.mjs";
+//#region src/dataloaders/findIdsDataLoader.d.ts
+declare const findIdsOperation = "find-ids";
+declare function findIdsDataLoader<T extends Entity>(em: EntityManager, type: MaybeAbstractEntityConstructor<T>, filter: FilterAndSettings<T>): Promise<string[]>;
+//#endregion
+export { findIdsDataLoader, findIdsOperation };
+//# sourceMappingURL=findIdsDataLoader.d.mts.map

package/build/dataloaders/findIdsDataLoader.d.mts.map

@@ -0,0 +1 @@
+{"version":3,"file":"findIdsDataLoader.d.mts","names":[],"sources":["../../src/dataloaders/findIdsDataLoader.ts"],"mappings":";;;;cAkBa;iBAEG,kBAAkB,UAAU,QAC1C,IAAI,eACJ,MAAM,+BAA+B,IACrC,QAAQ,kBAAkB,KACzB"}

package/build/dataloaders/findIdsDataLoader.js

@@ -1,77 +1,80 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.findIdsOperation = void 0;
-exports.findIdsDataLoader = findIdsDataLoader;
-const EntityMetadata_1 = require("../EntityMetadata");
-const keys_1 = require("../keys");
-const keywords_1 = require("../keywords");
-const QueryParser_1 = require("../QueryParser");
-const unnest_1 = require("../unnest");
-const utils_1 = require("../utils");
-const findDataLoader_1 = require("./findDataLoader");
-exports.findIdsOperation = "find-ids";
+import { keyToTaggedId } from "../keys.js";
+import { kq } from "../queries/sql/keywords.js";
+import { isQueryProvablyEmpty } from "../queries/find/QueryVisitor.js";
+import { parseFindQuery } from "../queries/find/QueryParser.js";
+import { fail } from "../utils.js";
+import { getMetadata } from "../EntityMetadata.js";
+import { buildUnnestCte } from "../queries/unnest.js";
+import { collectAndReplaceArgs, collectValues, createColumnValuesFromPrepared, getBatchKeyFromGenericStructure, queryFilterHash } from "./findDataLoader.js";
+//#region src/dataloaders/findIdsDataLoader.ts
+const findIdsOperation = "find-ids";
 function findIdsDataLoader(em, type, filter) {
-    const { where, ...opts } = filter;
-    if (opts.limit || opts.offset) {
-        throw new Error("Cannot use limit/offset with findIdsDataLoader");
-    }
-    const meta = (0, EntityMetadata_1.getMetadata)(type);
-    const query = (0, QueryParser_1.parseFindQuery)(meta, where, opts);
-    const { findSettings } = em["prepareFind"](meta, exports.findIdsOperation, query, { ...opts, limit: undefined });
-    const bindings = [];
-    (0, findDataLoader_1.collectValues)(bindings, query);
-    const prepared = { filter, query, bindings, findSettings };
-    const batchKey = (0, findDataLoader_1.getBatchKeyFromGenericStructure)(meta, query);
-    return em
-        .getLoader(exports.findIdsOperation, batchKey, async (entries) => {
-        // We're guaranteed that these queries all have the same structure
-        // Don't bother with the CTE if there's only 1 query (or each query has exactly the same filter values)
-        if (entries.length === 1) {
-            const { query, findSettings } = entries[0];
-            const primary = query.tables.find((t) => t.join === "primary") ?? (0, utils_1.fail)("No primary");
-            query.selects = [`${(0, keywords_1.kq)(primary.alias)}.id as id`];
-            query.orderBys = [{ alias: primary.alias, column: "id", order: "ASC" }];
-            const rows = await em["executePreparedFind"](meta, exports.findIdsOperation, query, findSettings, false);
-            return [rows.map((row) => (0, keys_1.keyToTaggedId)(meta, row.id))];
-        }
-        // WITH _find (tag, arg1, arg2) AS (
-        //   SELECT unnest($0::int[]) unnest($0::varchar[]), unnest($0::varchar[])
-        // )
-        // SELECT _find.tag, _data.id
-        // FROM _find
-        // CROSS JOIN LATERAL (
-        //   SELECT distinct a.id as id
-        //   FROM author a WHERE a.first_name = _find.arg1 OR a.last_name = _find.arg2
-        // ) _data
-        // Build the list of 'arg1', 'arg2', ... strings
-        const { query, findSettings } = entries[0];
-        const args = (0, findDataLoader_1.collectAndReplaceArgs)(query, entries);
-        const argsColumns = [{ columnName: "tag", dbType: "int" }, ...args.map((a) => a.column)];
-        // We're not returning the entities, just selecting their IDs
-        const primary = query.tables.find((t) => t.join === "primary") ?? (0, utils_1.fail)("No primary");
-        query.selects = [`${(0, keywords_1.kq)(primary.alias)}.id as id`];
-        query.orderBys = [{ alias: primary.alias, column: "id", order: "ASC" }];
-        const query2 = {
-            selects: ["_find.tag as tag", "_data.id as id"],
-            tables: [
-                { join: "primary", table: "_find", alias: "_find" },
-                { join: "lateral", query, table: meta.tableName, alias: "_data", fromAlias: "_f" },
-            ],
-            // For each unique query, capture its filter values in `bindings` to populate the CTE _find table
-            ctes: [(0, unnest_1.buildUnnestCte)("_find", argsColumns, (0, findDataLoader_1.createColumnValuesFromPrepared)(args, entries))],
-            orderBys: [],
-        };
-        const rows = await em["executePreparedFind"](meta, exports.findIdsOperation, query2, findSettings, false);
-        // Make an empty array for each batched query, per the dataloader contract
-        const results = entries.map(() => []);
-        // Then put each row's ID into the tagged query it matched
-        for (const row of rows) {
-            results[row.tag].push((0, keys_1.keyToTaggedId)(meta, row.id));
-        }
-        return results;
-    }, 
-    // Our filter/order tuple is a complex object, so use a stable cache key to ensure caching works.
-    { cacheKeyFn: findDataLoader_1.queryFilterHash })
-        .load(prepared);
+	const { where, ...opts } = filter;
+	if (opts.limit || opts.offset) throw new Error("Cannot use limit/offset with findIdsDataLoader");
+	const meta = getMetadata(type);
+	const query = parseFindQuery(meta, where, opts);
+	const { findSettings } = em["prepareFind"](meta, findIdsOperation, query, {
+		...opts,
+		limit: void 0
+	});
+	if (isQueryProvablyEmpty(query)) return Promise.resolve([]);
+	const bindings = [];
+	collectValues(bindings, query);
+	const prepared = {
+		filter,
+		query,
+		bindings,
+		findSettings
+	};
+	const batchKey = getBatchKeyFromGenericStructure(meta, query);
+	return em.getLoader(findIdsOperation, batchKey, async (entries) => {
+		if (entries.length === 1) {
+			const { query, findSettings } = entries[0];
+			const primary = query.tables.find((t) => t.join === "primary") ?? fail("No primary");
+			query.selects = [`${kq(primary.alias)}.id as id`];
+			query.orderBys = [{
+				alias: primary.alias,
+				column: "id",
+				order: "ASC"
+			}];
+			return [(await em["executePreparedFind"](meta, findIdsOperation, query, findSettings, false)).map((row) => keyToTaggedId(meta, row.id))];
+		}
+		const { query, findSettings } = entries[0];
+		const args = collectAndReplaceArgs(query, entries);
+		const argsColumns = [{
+			columnName: "tag",
+			dbType: "int"
+		}, ...args.map((a) => a.column)];
+		const primary = query.tables.find((t) => t.join === "primary") ?? fail("No primary");
+		query.selects = [`${kq(primary.alias)}.id as id`];
+		query.orderBys = [{
+			alias: primary.alias,
+			column: "id",
+			order: "ASC"
+		}];
+		const query2 = {
+			selects: ["_find.tag as tag", "_data.id as id"],
+			tables: [{
+				join: "primary",
+				table: "_find",
+				alias: "_find"
+			}, {
+				join: "lateral",
+				query,
+				table: meta.tableName,
+				alias: "_data",
+				fromAlias: "_f"
+			}],
+			ctes: [buildUnnestCte("_find", argsColumns, createColumnValuesFromPrepared(args, entries))],
+			orderBys: []
+		};
+		const rows = await em["executePreparedFind"](meta, findIdsOperation, query2, findSettings, false);
+		const results = entries.map(() => []);
+		for (const row of rows) results[row.tag].push(keyToTaggedId(meta, row.id));
+		return results;
+	}, { cacheKeyFn: queryFilterHash }).load(prepared);
 }
+//#endregion
+export { findIdsDataLoader, findIdsOperation };
+
 //# sourceMappingURL=findIdsDataLoader.js.map

package/build/dataloaders/findIdsDataLoader.js.map

@@ -1 +1 @@
-{"version":3,"file":"findIdsDataLoader.js","sourceRoot":"","sources":["../../src/dataloaders/findIdsDataLoader.ts"],"names":[],"mappings":";;;AAmBA,8CAgFC;AAhGD,sDAAgD;AAChD,kCAAwC;AACxC,0CAAiC;AACjC,gDAAiE;AACjE,sCAA2C;AAC3C,oCAAgC;AAChC,qDAM0B;AAEb,QAAA,gBAAgB,GAAG,UAAU,CAAC;AAE3C,SAAgB,iBAAiB,CAC/B,EAAiB,EACjB,IAAuC,EACvC,MAA4B;IAE5B,MAAM,EAAE,KAAK,EAAE,GAAG,IAAI,EAAE,GAAG,MAAM,CAAC;IAClC,IAAI,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;QAC9B,MAAM,IAAI,KAAK,CAAC,gDAAgD,CAAC,CAAC;IACpE,CAAC;IAED,MAAM,IAAI,GAAG,IAAA,4BAAW,EAAC,IAAI,CAAC,CAAC;IAC/B,MAAM,KAAK,GAAG,IAAA,4BAAc,EAAC,IAAI,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC;IAChD,MAAM,EAAE,YAAY,EAAE,GAAG,EAAE,CAAC,aAAa,CAAC,CAAC,IAAI,EAAE,wBAAgB,EAAE,KAAK,EAAE,EAAE,GAAG,IAAI,EAAE,KAAK,EAAE,SAAS,EAAE,CAAC,CAAC;IACzG,MAAM,QAAQ,GAAU,EAAE,CAAC;IAC3B,IAAA,8BAAa,EAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;IAC/B,MAAM,QAAQ,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE,QAAQ,EAAE,YAAY,EAAE,CAAC;IAC3D,MAAM,QAAQ,GAAG,IAAA,gDAA+B,EAAC,IAAI,EAAE,KAAK,CAAC,CAAC;IAE9D,OAAO,EAAE;SACN,SAAS,CACR,wBAAgB,EAChB,QAAQ,EACR,KAAK,EAAE,OAAO,EAAE,EAAE;QAChB,kEAAkE;QAElE,uGAAuG;QACvG,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACzB,MAAM,EAAE,KAAK,EAAE,YAAY,EAAE,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;YAC3C,MAAM,OAAO,GAAG,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,SAAS,CAAC,IAAI,IAAA,YAAI,EAAC,YAAY,CAAC,CAAC;YACrF,KAAK,CAAC,OAAO,GAAG,CAAC,GAAG,IAAA,aAAE,EAAC,OAAO,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC;YAClD,KAAK,CAAC,QAAQ,GAAG,CAAC,EAAE,KAAK,EAAE,OAAO,CAAC,KAAK,EAAE,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,CAAC;YACxE,MAAM,IAAI,GAAG,MAAM,EAAE,CAAC,qBAAqB,CAAC,CAAC,IAAI,EAAE,wBAAgB,EAAE,KAAK,EAAE,YAAY,EAAE,KAAK,CAAC,CAAC;YACjG,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,GAAQ,EAAE,EAAE,CAAC,IAAA,oBAAa,EAAC,IAAI,EAAE,GAAG,CAAC,EAAE,CAAE,CAAC,CAAC,CAAC;QAChE,CAAC;QAED,oCAAoC;QACpC,0EAA0E;QAC1E,IAAI;QACJ,6BAA6B;QAC7B,aAAa;QACb,uBAAuB;QACvB,+BAA+B;QAC/B,8EAA8E;QAC9E,UAAU;QAEV,gDAAgD;QAChD,MAAM,EAAE,KAAK,EAAE,YAAY,EAAE,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;QAC3C,MAAM,IAAI,GAAG,IAAA,sCAAqB,EAAC,KAAK,EAAE,OAAO,CAAC,CAAC;QACnD,MAAM,WAAW,GAAG,CAAC,EAAE,UAAU,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC;QAEzF,6DAA6D;QAC7D,MAAM,OAAO,GAAG,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,SAAS,CAAC,IAAI,IAAA,YAAI,EAAC,YAAY,CAAC,CAAC;QACrF,KAAK,CAAC,OAAO,GAAG,CAAC,GAAG,IAAA,aAAE,EAAC,OAAO,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC;QAClD,KAAK,CAAC,QAAQ,GAAG,CAAC,EAAE,KAAK,EAAE,OAAO,CAAC,KAAK,EAAE,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,CAAC;QAExE,MAAM,MAAM,GAAoB;YAC9B,OAAO,EAAE,CAAC,kBAAkB,EAAE,gBAAgB,CAAC;YAC/C,MAAM,EAAE;gBACN,EAAE,IAAI,EAAE,SAAS,EAAE,KAAK,EAAE,OAAO,EAAE,KAAK,EAAE,OAAO,EAAE;gBACnD,EAAE,IAAI,EAAE,SAAS,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,CAAC,SAAS,EAAE,KAAK,EAAE,OAAO,EAAE,SAAS,EAAE,IAAI,EAAE;aACnF;YACD,iGAAiG;YACjG,IAAI,EAAE,CAAC,IAAA,uBAAc,EAAC,OAAO,EAAE,WAAW,EAAE,IAAA,+CAA8B,EAAC,IAAI,EAAE,OAAO,CAAC,CAAC,CAAC;YAC3F,QAAQ,EAAE,EAAE;SACb,CAAC;QAEF,MAAM,IAAI,GAAG,MAAM,EAAE,CAAC,qBAAqB,CAAC,CAAC,IAAI,EAAE,wBAAgB,EAAE,MAAM,EAAE,YAAY,EAAE,KAAK,CAAC,CAAC;QAElG,0EAA0E;QAC1E,MAAM,OAAO,GAAe,OAAO,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC;QAClD,0DAA0D;QAC1D,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;YACvB,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,IAAA,oBAAa,EAAC,IAAI,EAAE,GAAG,CAAC,EAAE,CAAE,CAAC,CAAC;QACtD,CAAC;QACD,OAAO,OAAO,CAAC;IACjB,CAAC;IACD,iGAAiG;IACjG,EAAE,UAAU,EAAE,gCAAe,EAAE,CAChC;SACA,IAAI,CAAC,QAAQ,CAAC,CAAC;AACpB,CAAC"}
+{"version":3,"file":"findIdsDataLoader.js","names":[],"sources":["../../src/dataloaders/findIdsDataLoader.ts"],"sourcesContent":["import {\n  collectAndReplaceArgs,\n  collectValues,\n  createColumnValuesFromPrepared,\n  getBatchKeyFromGenericStructure,\n  queryFilterHash,\n} from \"src/dataloaders/findDataLoader.ts\";\nimport type { Entity } from \"src/Entity.ts\";\nimport type { EntityManager, MaybeAbstractEntityConstructor } from \"src/EntityManager.ts\";\nimport { getMetadata } from \"src/EntityMetadata.ts\";\nimport { keyToTaggedId } from \"src/keys.ts\";\nimport type { FilterAndSettings } from \"src/queries/find/EntityFilter.ts\";\nimport { type ParsedFindQuery, parseFindQuery } from \"src/queries/find/QueryParser.ts\";\nimport { isQueryProvablyEmpty } from \"src/queries/find/QueryVisitor.ts\";\nimport { kq } from \"src/queries/sql/keywords.ts\";\nimport { buildUnnestCte } from \"src/queries/unnest.ts\";\nimport { fail } from \"src/utils.ts\";\n\nexport const findIdsOperation = \"find-ids\";\n\nexport function findIdsDataLoader<T extends Entity>(\n  em: EntityManager,\n  type: MaybeAbstractEntityConstructor<T>,\n  filter: FilterAndSettings<T>,\n): Promise<string[]> {\n  const { where, ...opts } = filter;\n  if (opts.limit || opts.offset) {\n    throw new Error(\"Cannot use limit/offset with findIdsDataLoader\");\n  }\n\n  const meta = getMetadata(type);\n  const query = parseFindQuery(meta, where, opts);\n  const { findSettings } = em[\"prepareFind\"](meta, findIdsOperation, query, { ...opts, limit: undefined });\n  if (isQueryProvablyEmpty(query)) return Promise.resolve([]);\n\n  const bindings: any[] = [];\n  collectValues(bindings, query);\n  const prepared = { filter, query, bindings, findSettings };\n  const batchKey = getBatchKeyFromGenericStructure(meta, query);\n\n  return em\n    .getLoader<typeof prepared, string[]>(\n      findIdsOperation,\n      batchKey,\n      async (entries) => {\n        // We're guaranteed that these queries all have the same structure\n\n        // Don't bother with the CTE if there's only 1 query (or each query has exactly the same filter values)\n        if (entries.length === 1) {\n          const { query, findSettings } = entries[0];\n          const primary = query.tables.find((t) => t.join === \"primary\") ?? fail(\"No primary\");\n          query.selects = [`${kq(primary.alias)}.id as id`];\n          query.orderBys = [{ alias: primary.alias, column: \"id\", order: \"ASC\" }];\n          const rows = await em[\"executePreparedFind\"](meta, findIdsOperation, query, findSettings, false);\n          return [rows.map((row: any) => keyToTaggedId(meta, row.id)!)];\n        }\n\n        // WITH _find (tag, arg1, arg2) AS (\n        //   SELECT unnest($0::int[]) unnest($0::varchar[]), unnest($0::varchar[])\n        // )\n        // SELECT _find.tag, _data.id\n        // FROM _find\n        // CROSS JOIN LATERAL (\n        //   SELECT distinct a.id as id\n        //   FROM author a WHERE a.first_name = _find.arg1 OR a.last_name = _find.arg2\n        // ) _data\n\n        // Build the list of 'arg1', 'arg2', ... strings\n        const { query, findSettings } = entries[0];\n        const args = collectAndReplaceArgs(query, entries);\n        const argsColumns = [{ columnName: \"tag\", dbType: \"int\" }, ...args.map((a) => a.column)];\n\n        // We're not returning the entities, just selecting their IDs\n        const primary = query.tables.find((t) => t.join === \"primary\") ?? fail(\"No primary\");\n        query.selects = [`${kq(primary.alias)}.id as id`];\n        query.orderBys = [{ alias: primary.alias, column: \"id\", order: \"ASC\" }];\n\n        const query2: ParsedFindQuery = {\n          selects: [\"_find.tag as tag\", \"_data.id as id\"],\n          tables: [\n            { join: \"primary\", table: \"_find\", alias: \"_find\" },\n            { join: \"lateral\", query, table: meta.tableName, alias: \"_data\", fromAlias: \"_f\" },\n          ],\n          // For each unique query, capture its filter values in `bindings` to populate the CTE _find table\n          ctes: [buildUnnestCte(\"_find\", argsColumns, createColumnValuesFromPrepared(args, entries))],\n          orderBys: [],\n        };\n\n        const rows = await em[\"executePreparedFind\"](meta, findIdsOperation, query2, findSettings, false);\n\n        // Make an empty array for each batched query, per the dataloader contract\n        const results: string[][] = entries.map(() => []);\n        // Then put each row's ID into the tagged query it matched\n        for (const row of rows) {\n          results[row.tag].push(keyToTaggedId(meta, row.id)!);\n        }\n        return results;\n      },\n      // Our filter/order tuple is a complex object, so use a stable cache key to ensure caching works.\n      { cacheKeyFn: queryFilterHash },\n    )\n    .load(prepared);\n}\n"],"mappings":";;;;;;;;;AAkBA,MAAa,mBAAmB;AAEhC,SAAgB,kBACd,IACA,MACA,QACmB;CACnB,MAAM,EAAE,OAAO,GAAG,SAAS;CAC3B,IAAI,KAAK,SAAS,KAAK,QACrB,MAAM,IAAI,MAAM,gDAAgD;CAGlE,MAAM,OAAO,YAAY,IAAI;CAC7B,MAAM,QAAQ,eAAe,MAAM,OAAO,IAAI;CAC9C,MAAM,EAAE,iBAAiB,GAAG,cAAc,CAAC,MAAM,kBAAkB,OAAO;EAAE,GAAG;EAAM,OAAO,KAAA;CAAU,CAAC;CACvG,IAAI,qBAAqB,KAAK,GAAG,OAAO,QAAQ,QAAQ,CAAC,CAAC;CAE1D,MAAM,WAAkB,CAAC;CACzB,cAAc,UAAU,KAAK;CAC7B,MAAM,WAAW;EAAE;EAAQ;EAAO;EAAU;CAAa;CACzD,MAAM,WAAW,gCAAgC,MAAM,KAAK;CAE5D,OAAO,GACJ,UACC,kBACA,UACA,OAAO,YAAY;EAIjB,IAAI,QAAQ,WAAW,GAAG;GACxB,MAAM,EAAE,OAAO,iBAAiB,QAAQ;GACxC,MAAM,UAAU,MAAM,OAAO,MAAM,MAAM,EAAE,SAAS,SAAS,KAAK,KAAK,YAAY;GACnF,MAAM,UAAU,CAAC,GAAG,GAAG,QAAQ,KAAK,EAAE,UAAU;GAChD,MAAM,WAAW,CAAC;IAAE,OAAO,QAAQ;IAAO,QAAQ;IAAM,OAAO;GAAM,CAAC;GAEtE,OAAO,EAAC,MADW,GAAG,sBAAsB,CAAC,MAAM,kBAAkB,OAAO,cAAc,KAAK,EAAA,CAClF,KAAK,QAAa,cAAc,MAAM,IAAI,EAAE,CAAE,CAAC;EAC9D;EAaA,MAAM,EAAE,OAAO,iBAAiB,QAAQ;EACxC,MAAM,OAAO,sBAAsB,OAAO,OAAO;EACjD,MAAM,cAAc,CAAC;GAAE,YAAY;GAAO,QAAQ;EAAM,GAAG,GAAG,KAAK,KAAK,MAAM,EAAE,MAAM,CAAC;EAGvF,MAAM,UAAU,MAAM,OAAO,MAAM,MAAM,EAAE,SAAS,SAAS,KAAK,KAAK,YAAY;EACnF,MAAM,UAAU,CAAC,GAAG,GAAG,QAAQ,KAAK,EAAE,UAAU;EAChD,MAAM,WAAW,CAAC;GAAE,OAAO,QAAQ;GAAO,QAAQ;GAAM,OAAO;EAAM,CAAC;EAEtE,MAAM,SAA0B;GAC9B,SAAS,CAAC,oBAAoB,gBAAgB;GAC9C,QAAQ,CACN;IAAE,MAAM;IAAW,OAAO;IAAS,OAAO;GAAQ,GAClD;IAAE,MAAM;IAAW;IAAO,OAAO,KAAK;IAAW,OAAO;IAAS,WAAW;GAAK,CACnF;GAEA,MAAM,CAAC,eAAe,SAAS,aAAa,+BAA+B,MAAM,OAAO,CAAC,CAAC;GAC1F,UAAU,CAAC;EACb;EAEA,MAAM,OAAO,MAAM,GAAG,sBAAsB,CAAC,MAAM,kBAAkB,QAAQ,cAAc,KAAK;EAGhG,MAAM,UAAsB,QAAQ,UAAU,CAAC,CAAC;EAEhD,KAAK,MAAM,OAAO,MAChB,QAAQ,IAAI,IAAI,CAAC,KAAK,cAAc,MAAM,IAAI,EAAE,CAAE;EAEpD,OAAO;CACT,GAEA,EAAE,YAAY,gBAAgB,CAChC,CAAC,CACA,KAAK,QAAQ;AAClB"}

package/build/dataloaders/findOrCreateDataLoader.cjs

@@ -0,0 +1,120 @@
+Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
+const require_relations_Reference = require("../relations/Reference.cjs");
+require("../relations/index.cjs");
+const require_utils = require("../utils.cjs");
+const require_EntityMetadata = require("../EntityMetadata.cjs");
+const require_dataloaders_findDataLoader = require("./findDataLoader.cjs");
+const require_resurrection = require("../resurrection.cjs");
+const require_EntityManager = require("../EntityManager.cjs");
+const require_Entity = require("../Entity.cjs");
+//#region src/dataloaders/findOrCreateDataLoader.ts
+function findOrCreateDataLoader(em, type, where, softDeletes) {
+	const meta = require_EntityMetadata.getMetadata(type);
+	const hasAnyStrings = Object.values(meta.allFields).some((f) => f.kind === "primitive" && f.type === "string");
+	const hasAnyCitext = Object.values(meta.allFields).some((f) => f.kind === "primitive" && f.citext);
+	where = hasAnyStrings ? maybeClean(meta, where) : where;
+	const whereValue = require_dataloaders_findDataLoader.whereFilterHash(hasAnyCitext ? maybeLower(meta, where) : where);
+	const batchKey = `${type.name}-${whereValue}-${softDeletes}`;
+	const invalidKeys = Object.keys(where).filter((key) => {
+		const field = meta.allFields[key] ?? require_utils.fail(`Invalid field ${key}`);
+		return !(field.kind === "primitive" || field.kind === "enum" || field.kind === "m2o" || field.kind === "poly");
+	});
+	if (invalidKeys.length > 0) throw new Error("findOrCreate only supports primitive, enum, m2o, or poly fields in the where clause. Invalid keys: " + invalidKeys.join(", "));
+	return em.getLoader("find-or-create", batchKey, async (keys) => {
+		const [{ ifNew, upsert }] = keys;
+		const inMemory = em.filterEntities(type, where);
+		if (inMemory.length > 1) throw new require_EntityManager.TooManyError(`Found more than one existing ${type.name} with ${whereAsString(where)}`);
+		else if (inMemory.length === 1) {
+			const entity = inMemory[0];
+			require_resurrection.resurrectIfSoftDeleted(entity);
+			if (upsert) entity.set(upsert);
+			return keys.map(() => entity);
+		}
+		if (Object.values(where).some((v) => require_Entity.isEntity(v) && v.isNewEntity)) {
+			const entity = em.create(type, {
+				...where,
+				...ifNew
+			});
+			if (upsert) entity.set(upsert);
+			return keys.map(() => entity);
+		}
+		const entities = await em.find(type, Object.fromEntries(Object.entries(where).map(([k, v]) => [k, v === void 0 ? null : v])), { softDeletes: "include" });
+		let entity;
+		if (entities.length > 1) throw new require_EntityManager.TooManyError(`Found more than one existing ${type.name} with ${whereAsString(where)}`);
+		else if (entities.length === 1) {
+			entity = entities[0];
+			require_resurrection.resurrectIfSoftDeleted(entity);
+		} else entity = em.create(type, {
+			...where,
+			...ifNew
+		});
+		if (upsert) entity.set(upsert);
+		return keys.map(() => entity);
+	}, { cacheKeyFn: require_dataloaders_findDataLoader.whereFilterHash });
+}
+/** A simple in-memory match of `entity` against a mini/flat "WHERE clause" of `opts`. */
+function entityMatches(entity, opts) {
+	const meta = require_EntityMetadata.getMetadata(entity);
+	return Object.entries(opts).every(([fieldName, value]) => {
+		const field = meta.allFields[fieldName] ?? require_utils.fail(`Invalid field ${fieldName}`);
+		const fn = fieldName;
+		switch (field.kind) {
+			case "primaryKey":
+			case "enum": return entity[fn] === value;
+			case "primitive": if (field.citext) return compareCaseInsensitive(entity[fn], value);
+			else return entity[fn] === value;
+			case "m2o":
+			case "poly":
+				const relation = entity[fn];
+				if (require_relations_Reference.isLoadedReference(relation)) return require_EntityManager.sameEntity(relation.get, value);
+				else if (relation.isSet) return require_EntityManager.sameEntity(relation.id, value);
+				else return value === void 0 || value === null;
+			default: throw new Error(`Unsupported field ${fieldName}`);
+		}
+	});
+}
+function whereAsString(where) {
+	return Object.entries(where).map(([key, value]) => `${key}=${value}`).join(", ");
+}
+function compareCaseInsensitive(str1, str2) {
+	return str1 !== void 0 && str2 !== void 0 && typeof str1 === "string" && typeof str2 === "string" && str1.toLowerCase() === str2.toLowerCase();
+}
+/** Returns a copy of `opts` with any `citext` values turned to lower case. */
+function maybeLower(meta, opts) {
+	if (!opts) return opts;
+	let result = void 0;
+	for (const k in opts) {
+		const v = opts[k];
+		const field = meta.allFields[k];
+		if (field && field.kind === "primitive" && field.type === "string" && field.citext) {
+			const lowered = v?.toLowerCase();
+			if (lowered !== v) {
+				result ??= { ...opts };
+				result[k] = lowered;
+			}
+		}
+	}
+	return result ?? opts;
+}
+/** Returns a copy of `opts` with any string values trimmed/coalesced. */
+function maybeClean(meta, opts) {
+	if (!opts) return opts;
+	let result = void 0;
+	for (const k in opts) {
+		const v = opts[k];
+		const field = meta.allFields[k];
+		if (field && field.kind === "primitive" && field.type === "string" && field.sanitize !== false) {
+			const cleaned = require_utils.cleanStringValue(v);
+			if (cleaned !== v) {
+				result ??= { ...opts };
+				result[k] = cleaned;
+			}
+		}
+	}
+	return result ?? opts;
+}
+//#endregion
+exports.entityMatches = entityMatches;
+exports.findOrCreateDataLoader = findOrCreateDataLoader;
+
+//# sourceMappingURL=findOrCreateDataLoader.cjs.map

package/build/dataloaders/findOrCreateDataLoader.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"findOrCreateDataLoader.cjs","names":["getMetadata","whereFilterHash","fail","TooManyError","isEntity","isLoadedReference","sameEntity","cleanStringValue"],"sources":["../../src/dataloaders/findOrCreateDataLoader.ts"],"sourcesContent":["import type DataLoader from \"dataloader\";\nimport { whereFilterHash } from \"src/dataloaders/findDataLoader.ts\";\nimport { type Entity, isEntity } from \"src/Entity.ts\";\nimport { type EntityConstructor, type EntityManager, TooManyError, sameEntity } from \"src/EntityManager.ts\";\nimport { type EntityMetadata, getMetadata } from \"src/EntityMetadata.ts\";\nimport { type ManyToOneReference, type PolymorphicReference, isLoadedReference } from \"src/relations/index.ts\";\nimport { resurrectIfSoftDeleted } from \"src/resurrection.ts\";\nimport type { OptsOf } from \"src/typeMap.ts\";\nimport { cleanStringValue, fail } from \"src/utils.ts\";\n\ninterface FindOrCreateKey<T extends Entity> {\n  ifNew: OptsOf<T>;\n  upsert: Partial<OptsOf<T>> | undefined;\n}\n\nexport function findOrCreateDataLoader<T extends Entity>(\n  em: EntityManager,\n  type: EntityConstructor<T>,\n  where: Partial<OptsOf<T>>,\n  softDeletes: \"include\" | \"exclude\",\n): DataLoader<FindOrCreateKey<T>, T> {\n  const meta = getMetadata(type);\n\n  // Do some extra logic to make unclean strings/citext not create duplicate entities\n  const hasAnyStrings = Object.values(meta.allFields).some((f) => f.kind === \"primitive\" && f.type === \"string\");\n  const hasAnyCitext = Object.values(meta.allFields).some((f) => f.kind === \"primitive\" && f.citext);\n\n  // The `where` here will be later used to `em.create`, so we only clean (not lower for citext)\n  where = hasAnyStrings ? maybeClean(meta, where) : where;\n  // Use `whereFilterHash` to batch the same `findOrCreate` `where: { firstName: \"a1\" }` calls together to avoid duplicates\n  const whereValue = whereFilterHash(\n    // Only maybeLower for the purposes of batching, not the later em.create\n    hasAnyCitext ? maybeLower(meta, where) : (where as any),\n  );\n  const batchKey = `${type.name}-${whereValue}-${softDeletes}`;\n\n  const invalidKeys = Object.keys(where).filter((key) => {\n    const field = meta.allFields[key] ?? fail(`Invalid field ${key}`);\n    const supported =\n      field.kind === \"primitive\" || field.kind === \"enum\" || field.kind === \"m2o\" || field.kind === \"poly\";\n    return !supported;\n  });\n  if (invalidKeys.length > 0) {\n    throw new Error(\n      \"findOrCreate only supports primitive, enum, m2o, or poly fields in the where clause. Invalid keys: \" +\n        invalidKeys.join(\", \"),\n    );\n  }\n\n  return em.getLoader<FindOrCreateKey<T>, T>(\n    \"find-or-create\",\n    batchKey,\n    async (keys) => {\n      // Because our `batchKey` is based only on the `where` clause, if the user called\n      // `findOrCreate({ firstName: a1 })` multiple times, but with different ifNew/upsert\n      // conditions (or different cased strings and is using a citext column), we'll end\n      // up with multiple keys...\n      //\n      // This is fundamentally asking to create the same entity, but with different ifNew/upsert\n      // conditions, which we could fail on, but for now just take the first tuple of\n      // {where/ifNew/upsert} and assume it wins\n      const [{ ifNew, upsert }] = keys;\n\n      // Before we find/create an entity, see if we have a maybe-new one in the EM already.\n      // This will also use any WIP changes we've made to the found entity, which ideally is\n      // something `em.find` would do as well, but its queries are much more complex...\n      const inMemory = em.filterEntities(type, where);\n      if (inMemory.length > 1) {\n        throw new TooManyError(`Found more than one existing ${type.name} with ${whereAsString(where)}`);\n      } else if (inMemory.length === 1) {\n        const entity = inMemory[0] as T;\n        resurrectIfSoftDeleted(entity);\n        if (upsert) {\n          entity.set(upsert);\n        }\n        return keys.map(() => entity);\n      }\n\n      // If there is a param like `{ publisher: newPublisherEntity }`, then we know that\n      // an entity matching this condition can't be in the db anyway, so skip the em.find\n      const hasNewEntityParam = Object.values(where).some((v) => isEntity(v) && v.isNewEntity);\n      if (hasNewEntityParam) {\n        const entity = em.create(type, { ...where, ...(ifNew as object) } as OptsOf<T>);\n        if (upsert) {\n          entity.set(upsert);\n        }\n        return keys.map(() => entity);\n      }\n\n      // If we didn't find it in the EM, do the db query/em.create\n      const entities = await em.find(\n        type,\n        // Convert `publisher: undefined` --> `publisher: null`, and we need to make a copy anyway\n        Object.fromEntries(Object.entries(where).map(([k, v]) => [k, v === undefined ? null : v])) as any,\n        // Always include soft-deleted rows so findOrCreate can resurrect them instead of creating duplicates.\n        { softDeletes: \"include\" },\n      );\n      let entity: T;\n      if (entities.length > 1) {\n        throw new TooManyError(`Found more than one existing ${type.name} with ${whereAsString(where)}`);\n      } else if (entities.length === 1) {\n        entity = entities[0];\n        resurrectIfSoftDeleted(entity);\n      } else {\n        entity = em.create(type, { ...where, ...(ifNew as object) } as OptsOf<T>);\n      }\n      if (upsert) {\n        entity.set(upsert);\n      }\n      return keys.map(() => entity);\n    },\n    // Our filter tuple is a complex object, so use a stable cache key to ensure caching works.\n    { cacheKeyFn: whereFilterHash as any },\n  );\n}\n\n/** A simple in-memory match of `entity` against a mini/flat \"WHERE clause\" of `opts`. */\nexport function entityMatches<T extends Entity>(entity: T, opts: Partial<OptsOf<T>>): boolean {\n  const meta = getMetadata(entity);\n  return Object.entries(opts).every(([fieldName, value]) => {\n    const field = meta.allFields[fieldName] ?? fail(`Invalid field ${fieldName}`);\n    const fn = fieldName as keyof T & keyof OptsOf<T>;\n    switch (field.kind) {\n      case \"primaryKey\":\n      case \"enum\":\n        return entity[fn] === value;\n      case \"primitive\":\n        if (field.citext) {\n          return compareCaseInsensitive(entity[fn], value);\n        } else {\n          return entity[fn] === value;\n        }\n      case \"m2o\":\n      case \"poly\":\n        const relation = entity[fn] as ManyToOneReference<T, any, any> | PolymorphicReference<T, any, any>;\n        if (isLoadedReference(relation)) {\n          // Prefer using `.get` because it will handle new/id-less entities\n          return sameEntity(relation.get, value as any);\n        } else if (relation.isSet) {\n          // Otherwise use ids\n          return sameEntity(relation.id as any, value as any);\n        } else {\n          // Relation is not set, match if value is null-ish (null or undefined)\n          return value === undefined || value === null;\n        }\n      default:\n        throw new Error(`Unsupported field ${fieldName}`);\n    }\n  });\n}\n\nfunction whereAsString(where: object): string {\n  return Object.entries(where)\n    .map(([key, value]) => `${key}=${value}`)\n    .join(\", \");\n}\n\nfunction compareCaseInsensitive(str1: any, str2: any): boolean {\n  return (\n    str1 !== undefined &&\n    str2 !== undefined &&\n    typeof str1 === \"string\" &&\n    typeof str2 === \"string\" &&\n    str1.toLowerCase() === str2.toLowerCase()\n  );\n}\n\n/** Returns a copy of `opts` with any `citext` values turned to lower case. */\nfunction maybeLower<T extends object | undefined>(meta: EntityMetadata, opts: T): T {\n  if (!opts) return opts;\n  let result: T | undefined = undefined;\n  for (const k in opts) {\n    const v = (opts as any)[k];\n    const field = meta.allFields[k];\n    const isString = field && field.kind === \"primitive\" && field.type === \"string\";\n    if (isString && field.citext) {\n      const lowered = v?.toLowerCase();\n      if (lowered !== v) {\n        result ??= { ...opts };\n        (result as any)[k] = lowered as any;\n      }\n    }\n  }\n  return result ?? opts;\n}\n\n/** Returns a copy of `opts` with any string values trimmed/coalesced. */\nfunction maybeClean<T extends object | undefined>(meta: EntityMetadata, opts: T): T {\n  if (!opts) return opts;\n  let result: T | undefined = undefined;\n  for (const k in opts) {\n    const v = (opts as any)[k];\n    const field = meta.allFields[k];\n    const isString = field && field.kind === \"primitive\" && field.type === \"string\";\n    if (isString && field.sanitize !== false) {\n      const cleaned = cleanStringValue(v);\n      if (cleaned !== v) {\n        result ??= { ...opts }; // Only create copy on first change\n        (result as any)[k] = cleaned;\n      }\n    }\n  }\n  return result ?? opts;\n}\n"],"mappings":";;;;;;;;;;AAeA,SAAgB,uBACd,IACA,MACA,OACA,aACmC;CACnC,MAAM,OAAOA,uBAAAA,YAAY,IAAI;CAG7B,MAAM,gBAAgB,OAAO,OAAO,KAAK,SAAS,CAAC,CAAC,MAAM,MAAM,EAAE,SAAS,eAAe,EAAE,SAAS,QAAQ;CAC7G,MAAM,eAAe,OAAO,OAAO,KAAK,SAAS,CAAC,CAAC,MAAM,MAAM,EAAE,SAAS,eAAe,EAAE,MAAM;CAGjG,QAAQ,gBAAgB,WAAW,MAAM,KAAK,IAAI;CAElD,MAAM,aAAaC,mCAAAA,gBAEjB,eAAe,WAAW,MAAM,KAAK,IAAK,KAC5C;CACA,MAAM,WAAW,GAAG,KAAK,KAAK,GAAG,WAAW,GAAG;CAE/C,MAAM,cAAc,OAAO,KAAK,KAAK,CAAC,CAAC,QAAQ,QAAQ;EACrD,MAAM,QAAQ,KAAK,UAAU,QAAQC,cAAAA,KAAK,iBAAiB,KAAK;EAGhE,OAAO,EADL,MAAM,SAAS,eAAe,MAAM,SAAS,UAAU,MAAM,SAAS,SAAS,MAAM,SAAS;CAElG,CAAC;CACD,IAAI,YAAY,SAAS,GACvB,MAAM,IAAI,MACR,wGACE,YAAY,KAAK,IAAI,CACzB;CAGF,OAAO,GAAG,UACR,kBACA,UACA,OAAO,SAAS;EASd,MAAM,CAAC,EAAE,OAAO,YAAY;EAK5B,MAAM,WAAW,GAAG,eAAe,MAAM,KAAK;EAC9C,IAAI,SAAS,SAAS,GACpB,MAAM,IAAIC,sBAAAA,aAAa,gCAAgC,KAAK,KAAK,QAAQ,cAAc,KAAK,GAAG;OAC1F,IAAI,SAAS,WAAW,GAAG;GAChC,MAAM,SAAS,SAAS;GACxB,qBAAA,uBAAuB,MAAM;GAC7B,IAAI,QACF,OAAO,IAAI,MAAM;GAEnB,OAAO,KAAK,UAAU,MAAM;EAC9B;EAKA,IAD0B,OAAO,OAAO,KAAK,CAAC,CAAC,MAAM,MAAMC,eAAAA,SAAS,CAAC,KAAK,EAAE,WACxD,GAAG;GACrB,MAAM,SAAS,GAAG,OAAO,MAAM;IAAE,GAAG;IAAO,GAAI;GAAiB,CAAc;GAC9E,IAAI,QACF,OAAO,IAAI,MAAM;GAEnB,OAAO,KAAK,UAAU,MAAM;EAC9B;EAGA,MAAM,WAAW,MAAM,GAAG,KACxB,MAEA,OAAO,YAAY,OAAO,QAAQ,KAAK,CAAC,CAAC,KAAK,CAAC,GAAG,OAAO,CAAC,GAAG,MAAM,KAAA,IAAY,OAAO,CAAC,CAAC,CAAC,GAEzF,EAAE,aAAa,UAAU,CAC3B;EACA,IAAI;EACJ,IAAI,SAAS,SAAS,GACpB,MAAM,IAAID,sBAAAA,aAAa,gCAAgC,KAAK,KAAK,QAAQ,cAAc,KAAK,GAAG;OAC1F,IAAI,SAAS,WAAW,GAAG;GAChC,SAAS,SAAS;GAClB,qBAAA,uBAAuB,MAAM;EAC/B,OACE,SAAS,GAAG,OAAO,MAAM;GAAE,GAAG;GAAO,GAAI;EAAiB,CAAc;EAE1E,IAAI,QACF,OAAO,IAAI,MAAM;EAEnB,OAAO,KAAK,UAAU,MAAM;CAC9B,GAEA,EAAE,YAAYF,mCAAAA,gBAAuB,CACvC;AACF;;AAGA,SAAgB,cAAgC,QAAW,MAAmC;CAC5F,MAAM,OAAOD,uBAAAA,YAAY,MAAM;CAC/B,OAAO,OAAO,QAAQ,IAAI,CAAC,CAAC,OAAO,CAAC,WAAW,WAAW;EACxD,MAAM,QAAQ,KAAK,UAAU,cAAcE,cAAAA,KAAK,iBAAiB,WAAW;EAC5E,MAAM,KAAK;EACX,QAAQ,MAAM,MAAd;GACE,KAAK;GACL,KAAK,QACH,OAAO,OAAO,QAAQ;GACxB,KAAK,aACH,IAAI,MAAM,QACR,OAAO,uBAAuB,OAAO,KAAK,KAAK;QAE/C,OAAO,OAAO,QAAQ;GAE1B,KAAK;GACL,KAAK;IACH,MAAM,WAAW,OAAO;IACxB,IAAIG,4BAAAA,kBAAkB,QAAQ,GAE5B,OAAOC,sBAAAA,WAAW,SAAS,KAAK,KAAY;SACvC,IAAI,SAAS,OAElB,OAAOA,sBAAAA,WAAW,SAAS,IAAW,KAAY;SAGlD,OAAO,UAAU,KAAA,KAAa,UAAU;GAE5C,SACE,MAAM,IAAI,MAAM,qBAAqB,WAAW;EACpD;CACF,CAAC;AACH;AAEA,SAAS,cAAc,OAAuB;CAC5C,OAAO,OAAO,QAAQ,KAAK,CAAC,CACzB,KAAK,CAAC,KAAK,WAAW,GAAG,IAAI,GAAG,OAAO,CAAC,CACxC,KAAK,IAAI;AACd;AAEA,SAAS,uBAAuB,MAAW,MAAoB;CAC7D,OACE,SAAS,KAAA,KACT,SAAS,KAAA,KACT,OAAO,SAAS,YAChB,OAAO,SAAS,YAChB,KAAK,YAAY,MAAM,KAAK,YAAY;AAE5C;;AAGA,SAAS,WAAyC,MAAsB,MAAY;CAClF,IAAI,CAAC,MAAM,OAAO;CAClB,IAAI,SAAwB,KAAA;CAC5B,KAAK,MAAM,KAAK,MAAM;EACpB,MAAM,IAAK,KAAa;EACxB,MAAM,QAAQ,KAAK,UAAU;EAE7B,IADiB,SAAS,MAAM,SAAS,eAAe,MAAM,SAAS,YACvD,MAAM,QAAQ;GAC5B,MAAM,UAAU,GAAG,YAAY;GAC/B,IAAI,YAAY,GAAG;IACjB,WAAW,EAAE,GAAG,KAAK;IACrB,OAAgB,KAAK;GACvB;EACF;CACF;CACA,OAAO,UAAU;AACnB;;AAGA,SAAS,WAAyC,MAAsB,MAAY;CAClF,IAAI,CAAC,MAAM,OAAO;CAClB,IAAI,SAAwB,KAAA;CAC5B,KAAK,MAAM,KAAK,MAAM;EACpB,MAAM,IAAK,KAAa;EACxB,MAAM,QAAQ,KAAK,UAAU;EAE7B,IADiB,SAAS,MAAM,SAAS,eAAe,MAAM,SAAS,YACvD,MAAM,aAAa,OAAO;GACxC,MAAM,UAAUC,cAAAA,iBAAiB,CAAC;GAClC,IAAI,YAAY,GAAG;IACjB,WAAW,EAAE,GAAG,KAAK;IACrB,OAAgB,KAAK;GACvB;EACF;CACF;CACA,OAAO,UAAU;AACnB"}

package/build/dataloaders/findOrCreateDataLoader.d.cts

@@ -0,0 +1,15 @@
+import { OptsOf } from "../typeMap.cjs";
+import { EntityConstructor, EntityManager } from "../EntityManager.cjs";
+import { Entity } from "../Entity.cjs";
+import DataLoader from "dataloader";
+//#region src/dataloaders/findOrCreateDataLoader.d.ts
+interface FindOrCreateKey<T extends Entity> {
+  ifNew: OptsOf<T>;
+  upsert: Partial<OptsOf<T>> | undefined;
+}
+declare function findOrCreateDataLoader<T extends Entity>(em: EntityManager, type: EntityConstructor<T>, where: Partial<OptsOf<T>>, softDeletes: "include" | "exclude"): DataLoader<FindOrCreateKey<T>, T>;
+/** A simple in-memory match of `entity` against a mini/flat "WHERE clause" of `opts`. */
+declare function entityMatches<T extends Entity>(entity: T, opts: Partial<OptsOf<T>>): boolean;
+//#endregion
+export { entityMatches, findOrCreateDataLoader };
+//# sourceMappingURL=findOrCreateDataLoader.d.cts.map

package/build/dataloaders/findOrCreateDataLoader.d.cts.map

@@ -0,0 +1 @@
+{"version":3,"file":"findOrCreateDataLoader.d.cts","names":[],"sources":["../../src/dataloaders/findOrCreateDataLoader.ts"],"mappings":";;;;;UAUU,gBAAgB,UAAU;EAClC,OAAO,OAAO;EACd,QAAQ,QAAQ,OAAO;;iBAGT,uBAAuB,UAAU,QAC/C,IAAI,eACJ,MAAM,kBAAkB,IACxB,OAAO,QAAQ,OAAO,KACtB,qCACC,WAAW,gBAAgB,IAAI;;iBAiGlB,cAAc,UAAU,QAAQ,QAAQ,GAAG,MAAM,QAAQ,OAAO"}