joist-core 2.3.0 → 2.4.0

package/build/configure.js.map

@@ -1 +1 @@
-{"version":3,"file":"configure.js","sourceRoot":"","sources":["../src/configure.ts"],"names":[],"mappings":";;AA8BA,8CA2BC;AAqED,kDAEC;AAED,sDAEC;AAED,gEAGC;AAED,kDAEC;AAED,gDAEC;AAGD,0DAEC;AAED,4EAKC;AA3JD,qDAQ0B;AAC1B,qCAA6E;AAC7E,yCAA0C;AAC1C,mDAAgD;AAChD,iCAA8D;AAC9D,mDAAsD;AAEtD,uEAAwE;AAExE,mCAAgD;AAChD,mCAAmC;AACnC,mCAAiD;AAEjD,MAAM,mBAAmB,GAAG,IAAI,GAAG,EAA+C,CAAC;AACnF,MAAM,cAAc,GAAG,IAAI,GAAG,EAA0B,CAAC;AACzD,MAAM,aAAa,GAAG,IAAI,GAAG,EAA0B,CAAC;AAExD,IAAI,iBAAsB,CAAC;AAE3B,yEAAyE;AACzE,SAAgB,iBAAiB,CAAC,KAAuB;IACvD,mGAAmG;IACnG,8FAA8F;IAC9F,kFAAkF;IAClF,IAAI,iBAAiB,EAAE,CAAC;QACtB,MAAM,iBAAiB,CAAC;IAC1B,CAAC;IACD,IAAI,CAAC;QACH,uBAAuB,CAAC,KAAK,CAAC,CAAC;QAC/B,yBAAyB,CAAC,KAAK,CAAC,CAAC;QACjC,sBAAsB,CAAC,KAAK,CAAC,CAAC;QAC9B,mBAAmB,CAAC,KAAK,CAAC,CAAC;QAC3B,kBAAkB,CAAC,KAAK,CAAC,CAAC;QAC1B,2BAA2B,CAAC,KAAK,CAAC,CAAC;QACnC,kBAAkB,CAAC,KAAK,CAAC,CAAC;QAC1B,mFAAmF;QACnF,0CAA0C;QAC1C,IAAA,kBAAS,GAAE,CAAC;QACZ,iGAAiG;QACjG,iBAAiB,CAAC,KAAK,CAAC,CAAC;QACzB,sBAAsB,CAAC,KAAK,CAAC,CAAC;QAC9B,8BAA8B,CAAC,KAAK,CAAC,CAAC;QACtC,4BAA4B,CAAC,KAAK,CAAC,CAAC;IACtC,CAAC;IAAC,OAAO,CAAC,EAAE,CAAC;QACX,iBAAiB,GAAG,CAAC,CAAC;QACtB,MAAM,CAAC,CAAC;IACV,CAAC;AACH,CAAC;AAED,gEAAgE;AAChE,SAAS,sBAAsB,CAAC,KAAuB;IACrD,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,IAAA,wBAAgB,EAAC,IAAI,EAAE,gBAAgB,EAAE,SAAS,mBAAmB;YACnE,OAAO,IAAI,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;QAC3D,CAAC,CAAC,CAAC;QACH,IAAA,wBAAgB,EAAC,IAAI,EAAE,oBAAoB,EAAE,SAAS,uBAAuB;YAC3E,OAAO,IAAI,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,qBAAqB,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;QAC5E,CAAC,CAAC,CAAC;QACH,IAAA,wBAAgB,EAAC,IAAI,EAAE,4BAA4B,EAAE,SAAS,+BAA+B;YAC3F,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,qBAAsB,CAAC,CAAC;YACvD,IAAI,KAAK,KAAK,SAAS;gBAAE,MAAM,IAAI,KAAK,CAAC,GAAG,IAAI,CAAC,IAAI,2CAA2C,CAAC,CAAC;YAClG,IAAI,KAAK,CAAC,IAAI,KAAK,MAAM;gBAAE,MAAM,IAAI,KAAK,CAAC,qCAAqC,CAAC,CAAC;YAClF,OAAQ,KAAmB,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC;QAC1D,CAAC,CAAC,CAAC;IACL,CAAC;AACH,CAAC;AAED,6FAA6F;AAC7F,SAAS,8BAA8B,CAAC,KAAuB;IAC7D,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,IAAA,wBAAgB,EAAC,IAAI,EAAE,YAAY,EAAE,SAAS,eAAe;YAC3D,OAAO,IAAA,oCAAmB,EAAC,IAAI,CAAC;iBAC7B,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,UAAU,CAAC;iBAC1C,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC;QAClC,CAAC,CAAC,CAAC;QACH,IAAA,wBAAgB,EAAC,IAAI,EAAE,mBAAmB,EAAE,SAAS,sBAAsB;YACzE,OAAO,sBAAsB,CAAC,IAAI,CAAC,UAAW,CAAC,CAAC;QAClD,CAAC,CAAC,CAAC;QACH,IAAA,wBAAgB,EAAC,IAAI,EAAE,6BAA6B,EAAE,SAAS,gCAAgC;YAC7F,OAAO,IAAA,oCAAmB,EAAC,IAAI,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;QAC9E,CAAC,CAAC,CAAC;QACH,IAAA,wBAAgB,EAAC,IAAI,EAAE,oCAAoC,EAAE,SAAS,uCAAuC;YAC3G,OAAO,sBAAsB,CAAC,IAAI,CAAC,2BAA4B,CAAC,CAAC;QACnE,CAAC,CAAC,CAAC;QACH,IAAA,wBAAgB,EAAC,IAAI,EAAE,eAAe,EAAE,SAAS,kBAAkB;YACjE,0FAA0F;YAC1F,8DAA8D;YAC9D,EAAE;YACF,6FAA6F;YAC7F,qGAAqG;YACrG,OAAO,IAAA,uCAAsB,EAAC,IAAI,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,aAAa,CAAC,CAAC;QACpF,CAAC,CAAC,CAAC;IACL,CAAC;AACH,CAAC;AAED,2FAA2F;AAC3F,SAAS,mBAAmB,CAAC,KAAuB;IAClD,KAAK,CAAC,IAAI,CAAC,sBAAsB,CAAC,CAAC;AACrC,CAAC;AAED,qFAAqF;AACrF,SAAS,sBAAsB,CAAC,CAAiB,EAAE,CAAiB;IAClE,IAAI,CAAC,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,CAAC,SAAS,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IACjE,IAAI,CAAC,CAAC,SAAS,CAAC,MAAM,KAAK,CAAC,IAAI,CAAC,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC;QAAE,OAAO,CAAC,CAAC,CAAC;IAClE,IAAI,CAAC,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,QAAQ,EAAE,EAAE,CAAC,QAAQ,KAAK,CAAC,CAAC;QAAE,OAAO,CAAC,CAAC;IAC7D,IAAI,CAAC,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,QAAQ,EAAE,EAAE,CAAC,QAAQ,KAAK,CAAC,CAAC;QAAE,OAAO,CAAC,CAAC,CAAC;IAC9D,OAAO,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;AACtC,CAAC;AAED,SAAS,kBAAkB,CAAC,KAAuB;IACjD,IAAA,+BAAsB,GAAE,CAAC;IACzB,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,KAAK,MAAM,EAAE,IAAI,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,sBAAsB;YAAE,EAAE,CAAC,IAAI,CAAC,CAAC;IACvE,CAAC;AACH,CAAC;AAED,SAAgB,mBAAmB;IACjC,mBAAmB,CAAC,KAAK,EAAE,CAAC;AAC9B,CAAC;AAED,SAAgB,qBAAqB,CAAC,GAAW;IAC/C,OAAO,mBAAmB,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,IAAA,YAAI,EAAC,iBAAiB,GAAG,IAAI,CAAC,CAAC;AACxE,CAAC;AAED,SAAgB,0BAA0B,CAAC,EAAY;IACrD,MAAM,GAAG,GAAG,IAAA,gBAAS,EAAC,EAAE,CAAC,CAAC;IAC1B,OAAO,qBAAqB,CAAC,GAAG,CAAC,CAAC;AACpC,CAAC;AAED,SAAgB,mBAAmB,CAAC,SAAiB;IACnD,OAAO,cAAc,CAAC,GAAG,CAAC,SAAS,CAAC,IAAI,IAAA,YAAI,EAAC,iBAAiB,SAAS,EAAE,CAAC,CAAC;AAC7E,CAAC;AAED,SAAgB,kBAAkB,CAAC,QAAgB;IACjD,OAAO,aAAa,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,IAAA,YAAI,EAAC,gBAAgB,QAAQ,EAAE,CAAC,CAAC;AACzE,CAAC;AAED,0FAA0F;AAC1F,SAAgB,uBAAuB,CAA4B,QAAgB;IACjF,OAAO,aAAa,CAAC,GAAG,CAAC,QAAQ,CAAkC,CAAC;AACtE,CAAC;AAED,SAAgB,gCAAgC,CAC9C,KAA6D;IAE7D,MAAM,EAAE,GAAG,IAAA,gCAAyB,EAAC,KAAK,CAAC,CAAC;IAC5C,OAAO,EAAE,CAAC,CAAC,CAAC,0BAA0B,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;AACzD,CAAC;AAED,SAAS,uBAAuB,CAAC,KAAuB;IACtD,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,iFAAiF;QACjF,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC;YACnB,MAAM,QAAQ,GAAG,mBAAmB,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YACvD,IAAI,QAAQ;gBAAE,MAAM,IAAI,KAAK,CAAC,kBAAkB,IAAI,CAAC,OAAO,SAAS,IAAI,CAAC,IAAI,QAAQ,QAAQ,CAAC,IAAI,EAAE,CAAC,CAAC;YACvG,mBAAmB,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;QACnD,CAAC;QACD,+CAA+C;QAC/C,cAAc,CAAC,GAAG,CAAC,IAAI,CAAC,SAAS,EAAE,IAAI,CAAC,CAAC;QACzC,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;IACrC,CAAC;AACH,CAAC;AAED,oFAAoF;AACpF,SAAS,kBAAkB,CAAC,KAAuB;IACjD,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,sEAAsE;QACtE,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC;YAC5C,IAAI,IAAA,6BAAqB,EAAC,IAAI,CAAC,EAAE,CAAC,IAAI,IAAI,CAAC,EAAE,CAAC,SAAS,EAAE,CAAC;gBACxD,uDAAuD;gBACvD,MAAM,SAAS,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC;gBAC7C,8DAA8D;gBAC9D,MAAM,SAAS,GAAG,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC;gBAChD,wCAAwC;gBACxC,IAAI,CAAC,SAAS,IAAI,CAAC,SAAS,EAAE,CAAC;oBAC7B,MAAM,IAAI,KAAK,CAAC,kBAAkB,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,EAAE,CAAC,KAAK,4BAA4B,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC;gBACvG,CAAC;gBACD,IAAI,SAAS;oBAAE,SAAS,CAAC,SAAS,GAAG,IAAI,CAAC;gBAC1C,IAAI,SAAS;oBAAE,SAAS,CAAC,SAAS,GAAG,IAAI,CAAC;YAC5C,CAAC;QACH,CAAC;IACH,CAAC;AACH,CAAC;AAED,2BAA2B;AAC3B,SAAS,yBAAyB,CAAC,KAAuB;IACxD,MAAM,UAAU,GAAG,KAAK,CAAC,MAAM,CAC7B,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE;QACT,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAChB,OAAO,GAAG,CAAC;IACb,CAAC,EACD,EAAoC,CACrC,CAAC;IACF,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACtB,mEAAmE;QACnE,CAAC,CAAC,SAAS,GAAG,MAAM,CAAC,WAAW,CAC9B,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,KAAK,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,EAAE,EAAE,GAAG,KAAK,EAAE,WAAW,EAAE,EAAE,EAAE,CAAC,CAAC,CACvF,CAAC;QACF,gGAAgG;QAChG,IAAI,CAAC,CAAC,QAAQ,EAAE,CAAC;YACf,MAAM,CAAC,GAAG,UAAU,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC;YACjC,CAAC,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACpB,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACnB,sFAAsF;YACtF,oFAAoF;YACpF,kFAAkF;YAClF,wBAAwB;YACxB,EAAE;YACF,oFAAoF;YACpF,qFAAqF;YACrF,yFAAyF;YACzF,WAAW;YACX,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,EAAE,KAAK,CAAC,EAAE,EAAE;gBACjD,mGAAmG;gBACnG,MAAM,WAAW,GAAG,CAAC,CAAC,eAAe,KAAK,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC;gBAC7D,IAAI,IAAI,IAAI,CAAC,CAAC,SAAS,IAAI,IAAI,KAAK,IAAI,EAAE,CAAC;oBACzC,mGAAmG;oBACnG,qGAAqG;oBACrG,gGAAgG;oBAChG,gGAAgG;oBAChG,+CAA+C;oBAC/C,OAAO,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;oBACtB,CAAC,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,WAAW,GAAG,WAAW,CAAC;oBAC5C,CAAC,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,WAAW,GAAG,IAAI,CAAC;gBACvC,CAAC;qBAAM,CAAC;oBACN,CAAC,CAAC,SAAS,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,KAAK,EAAE,WAAW,EAAE,CAAC;gBAChD,CAAC;YACH,CAAC,CAAC,CAAC;QACL,CAAC;IACH,CAAC;AACH,CAAC;AAED,8GAA8G;AAC9G,SAAS,iBAAiB,CAAC,KAAuB;IAChD,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACtB,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,SAAS,EAAE,CAAC;YAC5B,8DAA8D;YAC9D,KAAK,MAAM,CAAC,SAAS,EAAE,EAAE,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,aAAa,CAAC,EAAE,CAAC;gBAC5E,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,aAAa,CAAC,SAAS,CAAC,EAAE,CAAC;oBAC9C,4FAA4F;oBAC5F,mDAAmD;oBACnD,0EAA0E;oBAC1E,+CAA+C;oBAC/C,mFAAmF;oBACnF,mDAAmD;oBACnD,EAAE;oBACF,wFAAwF;oBACxF,sFAAsF;oBACtF,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,aAAa,CAAC,SAAS,CAAC,GAAG,IAAI,uBAAY,CAAC,EAAE,CAAC,SAAS,EAAE,EAAE,CAAC,SAAS,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC;gBACjG,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;AACH,CAAC;AAED,6BAA6B;AAC7B,SAAS,sBAAsB,CAAC,KAAuB;IACrD,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,gDAAgD;QAChD,KAAK,MAAM,EAAE,IAAI,EAAE,IAAI,EAAE,EAAE,EAAE,IAAI,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC;YAC1D,IAAI,IAAI,EAAE,CAAC;gBACT,MAAM,SAAS,GAAG,IAAA,mCAAmB,EAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;gBAClE,iFAAiF;gBACjF,oDAAoD;gBACpD,KAAK,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,SAAS,EAAE,CAAC;oBACvD,IAAI,IAAI,KAAK,QAAQ,EAAE,CAAC;wBACtB,IAAA,4BAAW,EAAC,MAAM,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,aAAa,CAAC,IAAI,CAAC;4BACnD,MAAM,EAAE,MAAM;4BACd,IAAI,EAAE,IAAI,CAAC,IAAI;4BACf,IAAI;4BACJ,MAAM;4BACN,IAAI;4BACJ,EAAE;yBACH,CAAC,CAAC;oBACL,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QAED,gCAAgC;QAChC,KAAK,MAAM,EAAE,IAAI,EAAE,IAAI,EAAE,EAAE,EAAE,OAAO,EAAE,IAAI,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,SAAS,EAAE,CAAC;YACvE,MAAM,SAAS,GAAG,IAAA,mCAAmB,EAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;YAClE,2EAA2E;YAC3E,wDAAwD;YACxD,KAAK,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,SAAS,EAAE,CAAC;gBACvD,IAAA,4BAAW,EAAC,MAAM,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,UAAU,CAAC,IAAI,CAAC;oBAChD,IAAI,EAAE,UAAU;oBAChB,MAAM,EAAE,MAAM;oBACd,IAAI,EAAE,IAAI,CAAC,IAAI;oBACf,UAAU,EAAE,IAAI,KAAK,WAAW;oBAChC,IAAI;oBACJ,MAAM;oBACN,IAAI;oBACJ,EAAE;oBACF,OAAO;iBACR,CAAC,CAAC;YACL,CAAC;QACH,CAAC;QAED,gFAAgF;QAChF,MAAM,iBAAiB,GAAG,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,MAAM,CAC5D,CAAC,CAAC,EAAE,EAAE,CACJ,CAAC,CAAC,IAAI,KAAK,WAAW;YACtB,CAAC,CAAC,CAAC,IAAI,KAAK,KAAK,IAAI,CAAC,CAAC,OAAO,KAAK,OAAO,CAAC;YAC3C,CAAC,CAAC,CAAC,IAAI,KAAK,MAAM,IAAI,CAAC,CAAC,OAAO,KAAK,OAAO,CAAC;YAC5C,CAAC,CAAC,CAAC,IAAI,KAAK,KAAK,IAAI,CAAC,CAAC,OAAO,KAAK,OAAO,CAAC,CAC9C,CAAC;QACF,KAAK,MAAM,KAAK,IAAI,iBAAiB,EAAE,CAAC;YACtC,MAAM,EAAE,GAAI,IAAA,6BAAa,EAAC,IAAI,CAAS,CAAC,KAAK,CAAC,SAAS,CAK1C,CAAC;YACd,mFAAmF;YACnF,yEAAyE;YACzE,2DAA2D;YAC3D,IAAI,EAAE,EAAE,YAAY,EAAE,CAAC;gBACrB,MAAM,SAAS,GAAG,IAAA,mCAAmB,EAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC,YAAY,CAAC,CAAC;gBAC7E,KAAK,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,SAAS,EAAE,CAAC;oBACvD,IAAA,4BAAW,EAAC,MAAM,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,UAAU,CAAC,IAAI,CAAC;wBAChD,IAAI,EAAE,EAAE,YAAY,2CAAsB,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,UAAU;wBACjE,IAAI,EAAE,IAAI,CAAC,IAAI;wBACf,UAAU,EAAE,IAAI,KAAK,WAAW;wBAChC,IAAI,EAAE,KAAK,CAAC,SAAS;wBACrB,IAAI;wBACJ,MAAM;wBACN,OAAO,EAAE,KAAK;qBACf,CAAC,CAAC;gBACL,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;AACH,CAAC;AAED;;;;GAIG;AACH,SAAS,2BAA2B,CAAC,KAAuB;IAC1D,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,SAAS,CAAC,EAAE,CAAC;YAC1D,IAAI,KAAK,CAAC,IAAI,KAAK,MAAM,EAAE,CAAC;gBAC1B,IAAI,CAAC,mBAAmB,KAAK,EAAE,CAAC;gBAChC,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,UAAU,EAAE,CAAC;oBACpC,MAAM,SAAS,GAAG,GAAG,GAAG,GAAG,IAAI,CAAC,aAAa,EAAE,CAAC,IAAI,EAAE,CAAC;oBACvD,iFAAiF;oBACjF,2DAA2D;oBAC3D,IAAI,CAAC,mBAAmB,CAAC,SAAS,CAAC,GAAG;wBACpC,IAAI,EAAE,KAAK;wBACX,SAAS;wBACT,WAAW,EAAE,GAAG,SAAS,IAAI;wBAC7B,QAAQ,EAAE,KAAK;wBACf,SAAS,EAAE,KAAK;wBAChB,OAAO,EAAE,KAAK;wBACd,KAAK,EAAE,IAAI,gBAAQ,CACjB,IAAI,CAAC,aAAa,EAAE,CAAC,OAAO,EAC5B,SAAS,EACT,IAAI,CAAC,UAAU,EACf,KAAK,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,MAAa,CACrC;wBACD,GAAG,IAAI;wBACP,WAAW,EAAE,KAAK,CAAC,WAAW;qBACoB,CAAC;gBACvD,CAAC;YACH,CAAC;iBAAM,IAAI,KAAK,CAAC,IAAI,KAAK,KAAK,EAAE,CAAC;gBAChC,KAAK,CAAC,aAAa,EAAE,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,EAAE;oBAC5C,MAAM,SAAS,GAAG,GAAG,GAAG,GAAG,EAAE,CAAC,IAAI,EAAE,CAAC;oBACrC,IAAI,CAAC,mBAAmB,KAAK,EAAE,CAAC;oBAChC,IAAI,CAAC,mBAAmB,CAAC,SAAS,CAAC,GAAG;wBACpC,GAAG,KAAK;wBACR,sGAAsG;wBACtG,2GAA2G;wBAC3G,+BAA+B;wBAC/B,QAAQ,EAAE,KAAK;wBACf,SAAS;wBACT,WAAW,EAAE,GAAG,SAAS,IAAI;wBAC7B,aAAa,EAAE,GAAG,EAAE,CAAC,EAAE;qBAC2B,CAAC;gBACvD,CAAC,CAAC,CAAC;YACL,CAAC;iBAAM,IAAI,KAAK,CAAC,IAAI,KAAK,KAAK,EAAE,CAAC;gBAChC,KAAK,CAAC,aAAa,EAAE,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,EAAE;oBAC5C,MAAM,SAAS,GAAG,GAAG,GAAG,GAAG,EAAE,CAAC,IAAI,EAAE,CAAC;oBACrC,IAAI,CAAC,mBAAmB,KAAK,EAAE,CAAC;oBAChC,IAAI,CAAC,mBAAmB,CAAC,SAAS,CAAC,GAAG;wBACpC,GAAG,KAAK;wBACR,SAAS;wBACT,WAAW,EAAE,GAAG,SAAS,IAAI;wBAC7B,aAAa,EAAE,GAAG,EAAE,CAAC,EAAE;qBAC2B,CAAC;gBACvD,CAAC,CAAC,CAAC;YACL,CAAC;QACH,CAAC;IACH,CAAC;AACH,CAAC;AAED,SAAS,4BAA4B,CAAC,IAAsB;IAC1D,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;QACrB,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,SAAS,EAAE,CAAC;YAC5B,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,cAAc,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,cAAc,CAAC,CAAC;QACzE,CAAC;IACH,CAAC;AACH,CAAC;AAED,oFAAoF;AACpF,SAAS,sBAAsB,CAAC,UAAgC;IAC9D,MAAM,OAAO,GAAG,IAAI,GAAG,EAAuB,CAAC;IAC/C,KAAK,MAAM,SAAS,IAAI,UAAU,EAAE,CAAC;QACnC,KAAK,MAAM,KAAK,IAAI,SAAS,CAAC,MAAM,EAAE,CAAC;YACrC,IAAI,MAAM,GAAG,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;YAChC,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;gBACzB,MAAM,GAAG,EAAE,CAAC;gBACZ,OAAO,CAAC,GAAG,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;YAC7B,CAAC;YACD,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,SAAS,CAAC;gBAAE,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QAC1D,CAAC;IACH,CAAC;IACD,OAAO,OAAO,CAAC;AACjB,CAAC"}
+{"version":3,"file":"configure.js","names":[],"sources":["../src/configure.ts"],"sourcesContent":["import { type Reactable, setAfterMetadataLocked, setBooted } from \"src/config.ts\";\nimport { AsyncDefault } from \"src/defaults.ts\";\nimport { type Entity } from \"src/Entity.ts\";\nimport { type MaybeAbstractEntityConstructor, type TaggedId } from \"src/EntityManager.ts\";\nimport {\n  type EntityMetadata,\n  type EnumField,\n  type ManyToOneField,\n  type OneToManyField,\n  getBaseAndSelfMetas,\n  getBaseSelfAndSubMetas,\n  getMetadata,\n} from \"src/EntityMetadata.ts\";\nimport { getProperties } from \"src/getProperties.ts\";\nimport { maybeResolveReferenceToId, setTaggedIdDelimiter, tagFromId } from \"src/keys.ts\";\nimport { reverseReactiveHint } from \"src/reactivity/reactiveHints.ts\";\nimport { AsyncReactiveFieldImpl } from \"src/relations/AsyncReactiveField.ts\";\nimport { type ReactiveManyToManyImpl, type ReactiveReferenceImpl, type Reference } from \"src/relations/index.ts\";\nimport { type ReactiveFieldImpl } from \"src/relations/ReactiveField.ts\";\nimport { isCannotBeUpdatedRule } from \"src/rules.ts\";\nimport { maybeGetRuntimeConfig } from \"src/runtimeConfig.ts\";\nimport { SimpleFieldSerde } from \"src/serde/fieldSerde.ts\";\nimport { defineLazyGetter, fail } from \"src/utils.ts\";\n\nconst tagToConstructorMap = new Map<string, MaybeAbstractEntityConstructor<any>>();\nconst tableToMetaMap = new Map<string, EntityMetadata>();\nconst typeToMetaMap = new Map<string, EntityMetadata>();\n\nlet previousBootError: any;\n\n/** Performs our boot-time initialization, i.e. hooking up reactivity. */\nexport function configureMetadata(metas: EntityMetadata[]): void {\n  // Add explicit \"did we already fail\" check b/c if a transformer like tsx gets a runtime error from\n  // here, it can potentially suppress it, move on to another file, which will naively re-invoke\n  // `configureMetadata` again, and fail with a very confusing \"Duplicate tag\" error\n  if (previousBootError) {\n    throw previousBootError;\n  }\n  try {\n    populateConstructorMaps(metas);\n    hookUpBaseTypeAndSubTypes(metas);\n    installMetadataGetters(metas);\n    sortMetasByBaseType(metas);\n    setImmutableFields(metas);\n    populatePolyComponentFields(metas);\n    fireAfterMetadatas(metas);\n    // Callers can make `config` calls during `afterMetadata` callbacks, but after that\n    // we don't allow any more config changes.\n    setBooted();\n    // Do these after `fireAfterMetadatas`, in case afterMetadata callbacks added more defaults/rules\n    copyAsyncDefaults(metas);\n    reverseIndexReactivity(metas);\n    installReactiveMetadataGetters(metas);\n    copyRunBeforeBooksToBaseType(metas);\n  } catch (e) {\n    previousBootError = e;\n    throw e;\n  }\n}\n\n/** Installs lazy lookup getters for metadata-derived caches. */\nfunction installMetadataGetters(metas: EntityMetadata[]): void {\n  for (const meta of metas) {\n    defineLazyGetter(meta, \"subTypesByType\", function buildSubTypesByType() {\n      return new Map(meta.subTypes.map((st) => [st.type, st]));\n    });\n    defineLazyGetter(meta, \"subTypesByStiValue\", function buildSubTypesByStiValue() {\n      return new Map(meta.subTypes.map((st) => [st.stiDiscriminatorValue, st]));\n    });\n    defineLazyGetter(meta, \"stiDiscriminatorColumnName\", function buildStiDiscriminatorColumnName() {\n      const field = meta.fields[meta.stiDiscriminatorField!];\n      if (field === undefined) throw new Error(`${meta.type} does not have an STI discriminator field`);\n      if (field.kind !== \"enum\") throw new Error(\"Discriminator field must be an enum\");\n      return (field as EnumField).serde.columns[0].columnName;\n    });\n    defineLazyGetter(meta, \"lazyFieldNames\", function buildLazyFieldNames() {\n      return new Set(\n        Object.values(meta.fields)\n          .filter((f) => f.kind === \"primitive\" && f.lazy)\n          .map((f) => f.fieldName),\n      );\n    });\n    defineLazyGetter(meta, \"hasLazyColumns\", function buildHasLazyColumns() {\n      return meta.lazyFieldNames!.size > 0;\n    });\n    defineLazyGetter(meta, \"syncDerivedFields\", function buildSyncDerivedFields() {\n      return Object.values(meta.allFields)\n        .filter((f) => (f.kind === \"primitive\" || f.kind === \"enum\") && f.derived === \"sync\")\n        .map((f) => f.fieldName);\n    });\n  }\n}\n\n/** Installs lazy getters for reactivity caches after reactivity has been reverse-indexed. */\nfunction installReactiveMetadataGetters(metas: EntityMetadata[]): void {\n  for (const meta of metas) {\n    defineLazyGetter(meta, \"reactables\", function buildReactables() {\n      return getBaseAndSelfMetas(meta)\n        .flatMap((m) => m.config.__data.reactables)\n        .filter((r) => !r.isReadOnly);\n    });\n    defineLazyGetter(meta, \"reactablesByField\", function buildReactablesByField() {\n      return indexReactablesByField(meta.reactables!);\n    });\n    defineLazyGetter(meta, \"reactablesIncludingReadOnly\", function buildReactablesIncludingReadOnly() {\n      return getBaseAndSelfMetas(meta).flatMap((m) => m.config.__data.reactables);\n    });\n    defineLazyGetter(meta, \"reactablesIncludingReadOnlyByField\", function buildReactablesIncludingReadOnlyByField() {\n      return indexReactablesByField(meta.reactablesIncludingReadOnly!);\n    });\n    defineLazyGetter(meta, \"reactiveRules\", function buildReactiveRules() {\n      // We use \"AndSub\" because `reactiveRules` is called with `todo.metadata`, which is always\n      // the root type, but ofc we don't want to skip subtype rules.\n      //\n      // I had considered filtering this list with `rr.fields.length > 0`, but even rules with 100%\n      // immutable fields (so all read-only, and so not \"reactive\") need to run on initial entity creation.\n      return getBaseSelfAndSubMetas(meta).flatMap((m) => m.config.__data.reactiveRules);\n    });\n    defineLazyGetter(meta, \"reactiveCommitRules\", function buildReactiveCommitRules() {\n      // Same \"AndSub\" reasoning as `reactiveRules`, just for the post-flush/pre-commit commit rules.\n      return getBaseSelfAndSubMetas(meta).flatMap((m) => m.config.__data.reactiveCommitRules);\n    });\n    defineLazyGetter(meta, \"hasCommitRules\", function buildHasCommitRules() {\n      // True if flushing an entity of this type could trigger commit-rule work, so `em.flush` can\n      // skip the whole commit-rule pass otherwise. We need *both* checks because hinted and\n      // non-hinted commit rules are stored in different places:\n      //\n      // 1. Hinted commit rules are reverse-indexed onto their *trigger* entity's `reactiveCommitRules`,\n      //    which is often a *different* entity than the one the rule is declared on. I.e. a rule\n      //    `config.addCommitRule({ books: \"title\" }, fn)` declared on `Author` lands on\n      //    `Book.reactiveCommitRules`, so flushing a Book must run it even though `Book`'s own\n      //    `config.__data.commitRules` is empty — hence checking `reactiveCommitRules`, not `commitRules`.\n      //\n      // 2. Non-hinted commit rules are *not* reverse-indexed at all; they run on every insert/update of\n      //    the entity they're declared on (via `validateSimpleRules`). I.e. `config.addCommitRule(fn)` on\n      //    `Author` only ever shows up in `Author.config.__data.commitRules` with `hint === undefined`,\n      //    so `reactiveCommitRules` would miss it. (We filter to `hint === undefined` because hinted\n      //    rules are already covered by check #1.)\n      return (\n        meta.reactiveCommitRules!.length > 0 ||\n        getBaseSelfAndSubMetas(meta).some((m) => m.config.__data.commitRules.some((r) => r.hint === undefined))\n      );\n    });\n  }\n}\n\n// Sort metas in place by inheritance hierarchy so that the base type comes before subtypes\nfunction sortMetasByBaseType(metas: EntityMetadata[]): void {\n  metas.sort(compareMetasByBaseType);\n}\n\n// Compare metas by inheritance hierarchy so that the base type sorts before subtypes\nfunction compareMetasByBaseType(a: EntityMetadata, b: EntityMetadata): number {\n  if (a.baseTypes.length > 0 && b.baseTypes.length === 0) return 1;\n  if (a.baseTypes.length === 0 && b.baseTypes.length > 0) return -1;\n  if (a.baseTypes.some((baseType) => baseType === b)) return 1;\n  if (b.baseTypes.some((baseType) => baseType === a)) return -1;\n  return a.type.localeCompare(b.type);\n}\n\nfunction fireAfterMetadatas(metas: EntityMetadata[]): void {\n  setAfterMetadataLocked();\n  for (const meta of metas) {\n    for (const fn of meta.config.__data.afterMetadataCallbacks) fn(meta);\n  }\n}\n\nexport function resetConstructorMap(): void {\n  tagToConstructorMap.clear();\n  setTaggedIdDelimiter(\":\");\n}\n\nexport function getConstructorFromTag(tag: string): MaybeAbstractEntityConstructor<any> {\n  return tagToConstructorMap.get(tag) ?? fail(`Unknown tag: \"${tag}\" `);\n}\n\nexport function getConstructorFromTaggedId(id: TaggedId): MaybeAbstractEntityConstructor<any> {\n  return getConstructorFromTag(tagFromId(id));\n}\n\nexport function getMetadataForTable(tableName: string): EntityMetadata {\n  return tableToMetaMap.get(tableName) ?? fail(`Unknown table ${tableName}`);\n}\n\nexport function getMetadataForType(typeName: string): EntityMetadata {\n  return typeToMetaMap.get(typeName) ?? fail(`Unknown type ${typeName}`);\n}\n\n/** Returns metadata for `typeName`, if `configureMetadata` has populated the type map. */\nexport function maybeGetMetadataForType<T extends Entity = Entity>(typeName: string): EntityMetadata<T> | undefined {\n  return typeToMetaMap.get(typeName) as EntityMetadata<T> | undefined;\n}\n\nexport function maybeGetConstructorFromReference(\n  value: string | Entity | Reference<any, any, any> | undefined,\n): MaybeAbstractEntityConstructor<any> | undefined {\n  const id = maybeResolveReferenceToId(value);\n  return id ? getConstructorFromTaggedId(id) : undefined;\n}\n\nfunction populateConstructorMaps(metas: EntityMetadata[]): void {\n  const runtimeConfig = maybeGetRuntimeConfig();\n  const tagDelimiter = runtimeConfig && Object.hasOwn(runtimeConfig, \"tagDelimiter\") ? runtimeConfig.tagDelimiter : \":\";\n  setTaggedIdDelimiter(tagDelimiter);\n\n  for (const meta of metas) {\n    // Add each (root) constructor into our tag -> constructor map for future lookups\n    if (!meta.baseType) {\n      const existing = tagToConstructorMap.get(meta.tagName);\n      if (existing) throw new Error(`Duplicate tag '${meta.tagName}' for ${meta.type} and ${existing.name}`);\n      tagToConstructorMap.set(meta.tagName, meta.cstr);\n    }\n    // Same for tables, but include subclass tables\n    tableToMetaMap.set(meta.tableName, meta);\n    typeToMetaMap.set(meta.type, meta);\n  }\n}\n\n// Do a first pass to flag immutable fields (which we'll use in reverseReactiveHint)\nfunction setImmutableFields(metas: EntityMetadata[]): void {\n  for (const meta of metas) {\n    // Scan rules for cannotBeUpdated so that we can set `field.immutable`\n    for (const rule of meta.config.__data.rules) {\n      if (isCannotBeUpdatedRule(rule.fn) && rule.fn.immutable) {\n        // Usually the field will exist directly in meta.fields\n        const selfField = meta.fields[rule.fn.field];\n        // Or it might have come in from a base type in meta.allFields\n        const baseField = meta.allFields[rule.fn.field];\n        // Either way, at least one should exist\n        if (!selfField && !baseField) {\n          throw new Error(`Missing field '${meta.type}.${rule.fn.field}' for cannotBeUpdated at ${rule.name}`);\n        }\n        if (selfField) selfField.immutable = true;\n        if (baseField) baseField.immutable = true;\n      }\n    }\n  }\n}\n\n// Setup subTypes/baseTypes\nfunction hookUpBaseTypeAndSubTypes(metas: EntityMetadata[]): void {\n  const metaByName = metas.reduce(\n    (acc, m) => {\n      acc[m.type] = m;\n      return acc;\n    },\n    {} as Record<string, EntityMetadata>,\n  );\n  for (const m of metas) {\n    // This is basically m.fields.mapValues to assign the primary alias\n    m.allFields = Object.fromEntries(\n      Object.entries(m.fields).map(([name, field]) => [name, { ...field, aliasSuffix: \"\" }]),\n    );\n    // Only supporting one level of inheritance for now, ideally would loop `while current !== null`\n    if (m.baseType) {\n      const b = metaByName[m.baseType];\n      if (m.inheritanceType === \"sti\") {\n        m.columns = b.columns;\n      }\n      m.baseTypes.push(b);\n      b.subTypes.push(m);\n      // Add all the base's fields to our allFields, with the base's aliasSuffix, so that in\n      // `WHERE` clauses for `small_publishers`, we'll have joined in `publishers` with an\n      // alias + this alias suffix, so can `WHERE` on `${alias}_b0.name = 'foo'` and get\n      // to the correct table.\n      //\n      // Note that we don't need to do this for subtypes, because `em.find` queries aren't\n      // allowed to `WHERE` against columns in their subtypes. Maybe someday we can support\n      // that like the GraphQL `...on SmallPublisher` syntax, like conditional/subtype-specific\n      // clauses.\n      Object.entries(b.fields).forEach(([name, field]) => {\n        // We use `b0` because that is what addTablePerClassJoinsAndClassTag uses to join in the base table\n        const aliasSuffix = b.inheritanceType === \"cti\" ? \"_b0\" : \"\";\n        if (name in m.allFields && name !== \"id\") {\n          // If the base field (i.e. group) is already in `m.allFields`, it's from a CTI subtype specializing\n          // a base field (i.e. `SmallPublisher.group`), in which case we don't really want it inserted/updated\n          // in the `small_publishers` table itself, so we'll delete it from `m.fields`, *but* leave it in\n          // m.allFields, with appropriate/overridden `otherEntity: SmallPublisherGroup` config so that it\n          // can be used to reverse validation rules/RFs.\n          delete m.fields[name];\n          m.allFields[name].aliasSuffix = aliasSuffix;\n          m.allFields[name].specialized = true;\n        } else {\n          m.allFields[name] = { ...field, aliasSuffix };\n        }\n      });\n    }\n  }\n  // Now that base/sub links are complete, cache the hot-path meta arrays that\n  // `getBaseAndSelfMetas`/`getBaseSelfAndSubMetas` would otherwise re-allocate per call.\n  for (const m of metas) {\n    m.baseSelfMetas = [...m.baseTypes, m];\n    m.baseSelfAndSubMetas = [...m.baseTypes, m, ...m.subTypes];\n  }\n}\n\n/** Copy/pastes base AsyncDefaults onto subtypes, so that subtypes can have their own default dependencies. */\nfunction copyAsyncDefaults(metas: EntityMetadata[]): void {\n  for (const m of metas) {\n    for (const b of m.baseTypes) {\n      // Clone in the base asyncDefaults, unless we override our own\n      for (const [fieldName, df] of Object.entries(b.config.__data.asyncDefaults)) {\n        if (!m.config.__data.asyncDefaults[fieldName]) {\n          // Given our subtype its own instance, because we might have different default dependencies.\n          // I.e. from a sample domain model, something like:\n          // - The base `PlanVersion.type` default depends on `{ identity: \"type\" }`\n          // - The base `Plan.type` has no default itself\n          // - The sub `SpecialPlanVersion` inherits type, and specializes `SPV.identity: SP`\n          // - The sub `SpecialPlan.type` does have a default\n          //\n          // So we need to eval `PlanVersion.type` separately from `SpecialPlanVersion.type`, even\n          // though they come from the same `config.setDefault` call/lambda in `PlanVersion.ts`.\n          m.config.__data.asyncDefaults[fieldName] = new AsyncDefault(df.fieldName, df.fieldHint, df.fn);\n        }\n      }\n    }\n  }\n}\n\n// Now hook up our reactivity\nfunction reverseIndexReactivity(metas: EntityMetadata[]): void {\n  for (const meta of metas) {\n    // Look for reactive validation rules to reverse\n    for (const { name, hint, fn } of meta.config.__data.rules) {\n      if (hint) {\n        const reversals = reverseReactiveHint(meta.cstr, meta.cstr, hint);\n        // For each reversal, tell its config about the reverse hint to force-re-validate\n        // the original rule's instance any time it changes.\n        for (const { kind, entity, path, fields } of reversals) {\n          if (kind === \"update\") {\n            getMetadata(entity).config.__data.reactiveRules.push({\n              source: entity,\n              cstr: meta.cstr,\n              name,\n              fields,\n              path,\n              fn,\n            });\n          }\n        }\n      }\n    }\n\n    // Same reverse-indexing as `rules` above, but for `commitRules` -> `reactiveCommitRules`.\n    for (const { name, hint, fn } of meta.config.__data.commitRules) {\n      if (hint) {\n        const reversals = reverseReactiveHint(meta.cstr, meta.cstr, hint);\n        for (const { kind, entity, path, fields } of reversals) {\n          if (kind === \"update\") {\n            getMetadata(entity).config.__data.reactiveCommitRules.push({\n              source: entity,\n              cstr: meta.cstr,\n              name,\n              fields,\n              path,\n              fn,\n            });\n          }\n        }\n      }\n    }\n\n    // Look for reactions to reverse\n    for (const { name, hint, fn, runOnce } of meta.config.__data.reactions) {\n      const reversals = reverseReactiveHint(meta.cstr, meta.cstr, hint);\n      // For each reversal, tell its config about the reverse hint to force-rerun\n      // the original reaction's instance any time it changes.\n      for (const { kind, entity, path, fields } of reversals) {\n        getMetadata(entity).config.__data.reactables.push({\n          kind: \"reaction\",\n          source: entity,\n          cstr: meta.cstr,\n          isReadOnly: kind === \"read-only\",\n          name,\n          fields,\n          path,\n          fn,\n          runOnce,\n        });\n      }\n    }\n\n    // Look for ReactiveFields, ReactiveReferences, & ReactiveManyToManys to reverse\n    const reactiveRelations = Object.values(meta.allFields).filter(\n      (f) =>\n        f.kind === \"primitive\" ||\n        (f.kind === \"m2o\" && f.derived === \"async\") ||\n        (f.kind === \"enum\" && f.derived === \"async\") ||\n        (f.kind === \"m2m\" && f.derived === \"async\"),\n    );\n    for (const field of reactiveRelations) {\n      const ap = (getProperties(meta) as any)[field.fieldName] as\n        | ReactiveFieldImpl<any, any, any>\n        | AsyncReactiveFieldImpl<any, any, any, any>\n        | ReactiveReferenceImpl<any, any, any, any>\n        | ReactiveManyToManyImpl<any, any, any>\n        | undefined;\n      // We might have an async property configured in joist-config.json that has not yet\n      // been made a `hasReactiveField` in the entity file, so avoid continuing\n      // if we don't actually have a property/loadHint available.\n      if (ap?.reactiveHint) {\n        const reversals = reverseReactiveHint(meta.cstr, meta.cstr, ap.reactiveHint);\n        for (const { kind, entity, path, fields } of reversals) {\n          getMetadata(entity).config.__data.reactables.push({\n            kind: ap instanceof AsyncReactiveFieldImpl ? \"query\" : \"populate\",\n            cstr: meta.cstr,\n            isReadOnly: kind === \"read-only\",\n            name: field.fieldName,\n            path,\n            fields,\n            runOnce: false,\n          });\n        }\n      }\n    }\n  }\n}\n\n/**\n * In addition to the canonical `meta.allFields`, we populate a `meta.polyComponentFields` to\n * disaggregates the poly's components into individual fields so that `em.find` / `parseFindQuery`\n * can support component-specific find queries.\n */\nfunction populatePolyComponentFields(metas: EntityMetadata[]): void {\n  for (const meta of metas) {\n    for (const [key, field] of Object.entries(meta.allFields)) {\n      if (field.kind === \"poly\") {\n        meta.polyComponentFields ??= {};\n        for (const comp of field.components) {\n          const fieldName = `${key}${comp.otherMetadata().type}`;\n          // Synthesize a m2o component that won't be used for any actual read/write serde,\n          // but just to help `parseFindQuery` build `WHERE` clauses.\n          meta.polyComponentFields[fieldName] = {\n            kind: \"m2o\",\n            fieldName,\n            fieldIdName: `${fieldName}Id`,\n            required: false,\n            immutable: false,\n            derived: false,\n            serde: new SimpleFieldSerde(fieldName, comp.column),\n            otherMetadata: comp.otherMetadata,\n            otherFieldName: comp.otherFieldName,\n            aliasSuffix: field.aliasSuffix,\n          } satisfies ManyToOneField & { aliasSuffix: string };\n        }\n      } else if (field.kind === \"m2o\") {\n        field.otherMetadata().subTypes.forEach((st) => {\n          const fieldName = `${key}${st.type}`;\n          meta.polyComponentFields ??= {};\n          meta.polyComponentFields[fieldName] = {\n            ...field,\n            // a subtype specific sub-field (i.e. `publisherLargePublishers`) cannot be required (which turns into\n            // an `inner join`), even if its parent is, since it won't always be present (i.e. the pointed-at publisher\n            // might be a small publisher).\n            required: false,\n            fieldName,\n            fieldIdName: `${fieldName}Id`,\n            otherMetadata: () => st,\n          } satisfies ManyToOneField & { aliasSuffix: string };\n        });\n      } else if (field.kind === \"o2m\") {\n        field.otherMetadata().subTypes.forEach((st) => {\n          const fieldName = `${key}${st.type}`;\n          meta.polyComponentFields ??= {};\n          meta.polyComponentFields[fieldName] = {\n            ...field,\n            fieldName,\n            fieldIdName: `${fieldName}Id`,\n            otherMetadata: () => st,\n          } satisfies OneToManyField & { aliasSuffix: string };\n        });\n      }\n    }\n  }\n}\n\nfunction copyRunBeforeBooksToBaseType(meta: EntityMetadata[]): void {\n  for (const m of meta) {\n    for (const b of m.baseTypes) {\n      b.config.__data.runHooksBefore.push(...m.config.__data.runHooksBefore);\n    }\n  }\n}\n\n/** Indexes reactables once so field setters don't scan every reactable's fields. */\nfunction indexReactablesByField(reactables: readonly Reactable[]): Map<string, Reactable[]> {\n  const byField = new Map<string, Reactable[]>();\n  for (const reactable of reactables) {\n    for (const field of reactable.fields) {\n      let fields = byField.get(field);\n      if (fields === undefined) {\n        fields = [];\n        byField.set(field, fields);\n      }\n      if (!fields.includes(reactable)) fields.push(reactable);\n    }\n  }\n  return byField;\n}\n"],"mappings":";;;;;;;;;;;;;;;;AAwBA,MAAM,sCAAsB,IAAI,IAAiD;AACjF,MAAM,iCAAiB,IAAI,IAA4B;AACvD,MAAM,gCAAgB,IAAI,IAA4B;AAEtD,IAAI;;AAGJ,SAAgB,kBAAkB,OAA+B;CAI/D,IAAI,mBACF,MAAM;CAER,IAAI;EACF,wBAAwB,KAAK;EAC7B,0BAA0B,KAAK;EAC/B,uBAAuB,KAAK;EAC5B,oBAAoB,KAAK;EACzB,mBAAmB,KAAK;EACxB,4BAA4B,KAAK;EACjC,mBAAmB,KAAK;EAGxB,UAAU;EAEV,kBAAkB,KAAK;EACvB,uBAAuB,KAAK;EAC5B,+BAA+B,KAAK;EACpC,6BAA6B,KAAK;CACpC,SAAS,GAAG;EACV,oBAAoB;EACpB,MAAM;CACR;AACF;;AAGA,SAAS,uBAAuB,OAA+B;CAC7D,KAAK,MAAM,QAAQ,OAAO;EACxB,iBAAiB,MAAM,kBAAkB,SAAS,sBAAsB;GACtE,OAAO,IAAI,IAAI,KAAK,SAAS,KAAK,OAAO,CAAC,GAAG,MAAM,EAAE,CAAC,CAAC;EACzD,CAAC;EACD,iBAAiB,MAAM,sBAAsB,SAAS,0BAA0B;GAC9E,OAAO,IAAI,IAAI,KAAK,SAAS,KAAK,OAAO,CAAC,GAAG,uBAAuB,EAAE,CAAC,CAAC;EAC1E,CAAC;EACD,iBAAiB,MAAM,8BAA8B,SAAS,kCAAkC;GAC9F,MAAM,QAAQ,KAAK,OAAO,KAAK;GAC/B,IAAI,UAAU,KAAA,GAAW,MAAM,IAAI,MAAM,GAAG,KAAK,KAAK,0CAA0C;GAChG,IAAI,MAAM,SAAS,QAAQ,MAAM,IAAI,MAAM,qCAAqC;GAChF,OAAQ,MAAoB,MAAM,QAAQ,EAAE,CAAC;EAC/C,CAAC;EACD,iBAAiB,MAAM,kBAAkB,SAAS,sBAAsB;GACtE,OAAO,IAAI,IACT,OAAO,OAAO,KAAK,MAAM,CAAC,CACvB,QAAQ,MAAM,EAAE,SAAS,eAAe,EAAE,IAAI,CAAC,CAC/C,KAAK,MAAM,EAAE,SAAS,CAC3B;EACF,CAAC;EACD,iBAAiB,MAAM,kBAAkB,SAAS,sBAAsB;GACtE,OAAO,KAAK,eAAgB,OAAO;EACrC,CAAC;EACD,iBAAiB,MAAM,qBAAqB,SAAS,yBAAyB;GAC5E,OAAO,OAAO,OAAO,KAAK,SAAS,CAAC,CACjC,QAAQ,OAAO,EAAE,SAAS,eAAe,EAAE,SAAS,WAAW,EAAE,YAAY,MAAM,CAAC,CACpF,KAAK,MAAM,EAAE,SAAS;EAC3B,CAAC;CACH;AACF;;AAGA,SAAS,+BAA+B,OAA+B;CACrE,KAAK,MAAM,QAAQ,OAAO;EACxB,iBAAiB,MAAM,cAAc,SAAS,kBAAkB;GAC9D,OAAO,oBAAoB,IAAI,CAAC,CAC7B,SAAS,MAAM,EAAE,OAAO,OAAO,UAAU,CAAC,CAC1C,QAAQ,MAAM,CAAC,EAAE,UAAU;EAChC,CAAC;EACD,iBAAiB,MAAM,qBAAqB,SAAS,yBAAyB;GAC5E,OAAO,uBAAuB,KAAK,UAAW;EAChD,CAAC;EACD,iBAAiB,MAAM,+BAA+B,SAAS,mCAAmC;GAChG,OAAO,oBAAoB,IAAI,CAAC,CAAC,SAAS,MAAM,EAAE,OAAO,OAAO,UAAU;EAC5E,CAAC;EACD,iBAAiB,MAAM,sCAAsC,SAAS,0CAA0C;GAC9G,OAAO,uBAAuB,KAAK,2BAA4B;EACjE,CAAC;EACD,iBAAiB,MAAM,iBAAiB,SAAS,qBAAqB;GAMpE,OAAO,uBAAuB,IAAI,CAAC,CAAC,SAAS,MAAM,EAAE,OAAO,OAAO,aAAa;EAClF,CAAC;EACD,iBAAiB,MAAM,uBAAuB,SAAS,2BAA2B;GAEhF,OAAO,uBAAuB,IAAI,CAAC,CAAC,SAAS,MAAM,EAAE,OAAO,OAAO,mBAAmB;EACxF,CAAC;EACD,iBAAiB,MAAM,kBAAkB,SAAS,sBAAsB;GAgBtE,OACE,KAAK,oBAAqB,SAAS,KACnC,uBAAuB,IAAI,CAAC,CAAC,MAAM,MAAM,EAAE,OAAO,OAAO,YAAY,MAAM,MAAM,EAAE,SAAS,KAAA,CAAS,CAAC;EAE1G,CAAC;CACH;AACF;AAGA,SAAS,oBAAoB,OAA+B;CAC1D,MAAM,KAAK,sBAAsB;AACnC;AAGA,SAAS,uBAAuB,GAAmB,GAA2B;CAC5E,IAAI,EAAE,UAAU,SAAS,KAAK,EAAE,UAAU,WAAW,GAAG,OAAO;CAC/D,IAAI,EAAE,UAAU,WAAW,KAAK,EAAE,UAAU,SAAS,GAAG,OAAO;CAC/D,IAAI,EAAE,UAAU,MAAM,aAAa,aAAa,CAAC,GAAG,OAAO;CAC3D,IAAI,EAAE,UAAU,MAAM,aAAa,aAAa,CAAC,GAAG,OAAO;CAC3D,OAAO,EAAE,KAAK,cAAc,EAAE,IAAI;AACpC;AAEA,SAAS,mBAAmB,OAA+B;CACzD,uBAAuB;CACvB,KAAK,MAAM,QAAQ,OACjB,KAAK,MAAM,MAAM,KAAK,OAAO,OAAO,wBAAwB,GAAG,IAAI;AAEvE;AAEA,SAAgB,sBAA4B;CAC1C,oBAAoB,MAAM;CAC1B,qBAAqB,GAAG;AAC1B;AAEA,SAAgB,sBAAsB,KAAkD;CACtF,OAAO,oBAAoB,IAAI,GAAG,KAAK,KAAK,iBAAiB,IAAI,GAAG;AACtE;AAEA,SAAgB,2BAA2B,IAAmD;CAC5F,OAAO,sBAAsB,UAAU,EAAE,CAAC;AAC5C;AAEA,SAAgB,oBAAoB,WAAmC;CACrE,OAAO,eAAe,IAAI,SAAS,KAAK,KAAK,iBAAiB,WAAW;AAC3E;AAEA,SAAgB,mBAAmB,UAAkC;CACnE,OAAO,cAAc,IAAI,QAAQ,KAAK,KAAK,gBAAgB,UAAU;AACvE;;AAGA,SAAgB,wBAAmD,UAAiD;CAClH,OAAO,cAAc,IAAI,QAAQ;AACnC;AAEA,SAAgB,iCACd,OACiD;CACjD,MAAM,KAAK,0BAA0B,KAAK;CAC1C,OAAO,KAAK,2BAA2B,EAAE,IAAI,KAAA;AAC/C;AAEA,SAAS,wBAAwB,OAA+B;CAC9D,MAAM,gBAAgB,sBAAsB;CAC5C,MAAM,eAAe,iBAAiB,OAAO,OAAO,eAAe,cAAc,IAAI,cAAc,eAAe;CAClH,qBAAqB,YAAY;CAEjC,KAAK,MAAM,QAAQ,OAAO;EAExB,IAAI,CAAC,KAAK,UAAU;GAClB,MAAM,WAAW,oBAAoB,IAAI,KAAK,OAAO;GACrD,IAAI,UAAU,MAAM,IAAI,MAAM,kBAAkB,KAAK,QAAQ,QAAQ,KAAK,KAAK,OAAO,SAAS,MAAM;GACrG,oBAAoB,IAAI,KAAK,SAAS,KAAK,IAAI;EACjD;EAEA,eAAe,IAAI,KAAK,WAAW,IAAI;EACvC,cAAc,IAAI,KAAK,MAAM,IAAI;CACnC;AACF;AAGA,SAAS,mBAAmB,OAA+B;CACzD,KAAK,MAAM,QAAQ,OAEjB,KAAK,MAAM,QAAQ,KAAK,OAAO,OAAO,OACpC,IAAI,sBAAsB,KAAK,EAAE,KAAK,KAAK,GAAG,WAAW;EAEvD,MAAM,YAAY,KAAK,OAAO,KAAK,GAAG;EAEtC,MAAM,YAAY,KAAK,UAAU,KAAK,GAAG;EAEzC,IAAI,CAAC,aAAa,CAAC,WACjB,MAAM,IAAI,MAAM,kBAAkB,KAAK,KAAK,GAAG,KAAK,GAAG,MAAM,2BAA2B,KAAK,MAAM;EAErG,IAAI,WAAW,UAAU,YAAY;EACrC,IAAI,WAAW,UAAU,YAAY;CACvC;AAGN;AAGA,SAAS,0BAA0B,OAA+B;CAChE,MAAM,aAAa,MAAM,QACtB,KAAK,MAAM;EACV,IAAI,EAAE,QAAQ;EACd,OAAO;CACT,GACA,CAAC,CACH;CACA,KAAK,MAAM,KAAK,OAAO;EAErB,EAAE,YAAY,OAAO,YACnB,OAAO,QAAQ,EAAE,MAAM,CAAC,CAAC,KAAK,CAAC,MAAM,WAAW,CAAC,MAAM;GAAE,GAAG;GAAO,aAAa;EAAG,CAAC,CAAC,CACvF;EAEA,IAAI,EAAE,UAAU;GACd,MAAM,IAAI,WAAW,EAAE;GACvB,IAAI,EAAE,oBAAoB,OACxB,EAAE,UAAU,EAAE;GAEhB,EAAE,UAAU,KAAK,CAAC;GAClB,EAAE,SAAS,KAAK,CAAC;GAUjB,OAAO,QAAQ,EAAE,MAAM,CAAC,CAAC,SAAS,CAAC,MAAM,WAAW;IAElD,MAAM,cAAc,EAAE,oBAAoB,QAAQ,QAAQ;IAC1D,IAAI,QAAQ,EAAE,aAAa,SAAS,MAAM;KAMxC,OAAO,EAAE,OAAO;KAChB,EAAE,UAAU,KAAK,CAAC,cAAc;KAChC,EAAE,UAAU,KAAK,CAAC,cAAc;IAClC,OACE,EAAE,UAAU,QAAQ;KAAE,GAAG;KAAO;IAAY;GAEhD,CAAC;EACH;CACF;CAGA,KAAK,MAAM,KAAK,OAAO;EACrB,EAAE,gBAAgB,CAAC,GAAG,EAAE,WAAW,CAAC;EACpC,EAAE,sBAAsB;GAAC,GAAG,EAAE;GAAW;GAAG,GAAG,EAAE;EAAQ;CAC3D;AACF;;AAGA,SAAS,kBAAkB,OAA+B;CACxD,KAAK,MAAM,KAAK,OACd,KAAK,MAAM,KAAK,EAAE,WAEhB,KAAK,MAAM,CAAC,WAAW,OAAO,OAAO,QAAQ,EAAE,OAAO,OAAO,aAAa,GACxE,IAAI,CAAC,EAAE,OAAO,OAAO,cAAc,YAUjC,EAAE,OAAO,OAAO,cAAc,aAAa,IAAI,aAAa,GAAG,WAAW,GAAG,WAAW,GAAG,EAAE;AAKvG;AAGA,SAAS,uBAAuB,OAA+B;CAC7D,KAAK,MAAM,QAAQ,OAAO;EAExB,KAAK,MAAM,EAAE,MAAM,MAAM,QAAQ,KAAK,OAAO,OAAO,OAClD,IAAI,MAAM;GACR,MAAM,YAAY,oBAAoB,KAAK,MAAM,KAAK,MAAM,IAAI;GAGhE,KAAK,MAAM,EAAE,MAAM,QAAQ,MAAM,YAAY,WAC3C,IAAI,SAAS,UACX,YAAY,MAAM,CAAC,CAAC,OAAO,OAAO,cAAc,KAAK;IACnD,QAAQ;IACR,MAAM,KAAK;IACX;IACA;IACA;IACA;GACF,CAAC;EAGP;EAIF,KAAK,MAAM,EAAE,MAAM,MAAM,QAAQ,KAAK,OAAO,OAAO,aAClD,IAAI,MAAM;GACR,MAAM,YAAY,oBAAoB,KAAK,MAAM,KAAK,MAAM,IAAI;GAChE,KAAK,MAAM,EAAE,MAAM,QAAQ,MAAM,YAAY,WAC3C,IAAI,SAAS,UACX,YAAY,MAAM,CAAC,CAAC,OAAO,OAAO,oBAAoB,KAAK;IACzD,QAAQ;IACR,MAAM,KAAK;IACX;IACA;IACA;IACA;GACF,CAAC;EAGP;EAIF,KAAK,MAAM,EAAE,MAAM,MAAM,IAAI,aAAa,KAAK,OAAO,OAAO,WAAW;GACtE,MAAM,YAAY,oBAAoB,KAAK,MAAM,KAAK,MAAM,IAAI;GAGhE,KAAK,MAAM,EAAE,MAAM,QAAQ,MAAM,YAAY,WAC3C,YAAY,MAAM,CAAC,CAAC,OAAO,OAAO,WAAW,KAAK;IAChD,MAAM;IACN,QAAQ;IACR,MAAM,KAAK;IACX,YAAY,SAAS;IACrB;IACA;IACA;IACA;IACA;GACF,CAAC;EAEL;EAGA,MAAM,oBAAoB,OAAO,OAAO,KAAK,SAAS,CAAC,CAAC,QACrD,MACC,EAAE,SAAS,eACV,EAAE,SAAS,SAAS,EAAE,YAAY,WAClC,EAAE,SAAS,UAAU,EAAE,YAAY,WACnC,EAAE,SAAS,SAAS,EAAE,YAAY,OACvC;EACA,KAAK,MAAM,SAAS,mBAAmB;GACrC,MAAM,KAAM,cAAc,IAAI,CAAC,CAAS,MAAM;GAS9C,IAAI,IAAI,cAAc;IACpB,MAAM,YAAY,oBAAoB,KAAK,MAAM,KAAK,MAAM,GAAG,YAAY;IAC3E,KAAK,MAAM,EAAE,MAAM,QAAQ,MAAM,YAAY,WAC3C,YAAY,MAAM,CAAC,CAAC,OAAO,OAAO,WAAW,KAAK;KAChD,MAAM,cAAc,yBAAyB,UAAU;KACvD,MAAM,KAAK;KACX,YAAY,SAAS;KACrB,MAAM,MAAM;KACZ;KACA;KACA,SAAS;IACX,CAAC;GAEL;EACF;CACF;AACF;;;;;;AAOA,SAAS,4BAA4B,OAA+B;CAClE,KAAK,MAAM,QAAQ,OACjB,KAAK,MAAM,CAAC,KAAK,UAAU,OAAO,QAAQ,KAAK,SAAS,GACtD,IAAI,MAAM,SAAS,QAAQ;EACzB,KAAK,wBAAwB,CAAC;EAC9B,KAAK,MAAM,QAAQ,MAAM,YAAY;GACnC,MAAM,YAAY,GAAG,MAAM,KAAK,cAAc,CAAC,CAAC;GAGhD,KAAK,oBAAoB,aAAa;IACpC,MAAM;IACN;IACA,aAAa,GAAG,UAAU;IAC1B,UAAU;IACV,WAAW;IACX,SAAS;IACT,OAAO,IAAI,iBAAiB,WAAW,KAAK,MAAM;IAClD,eAAe,KAAK;IACpB,gBAAgB,KAAK;IACrB,aAAa,MAAM;GACrB;EACF;CACF,OAAO,IAAI,MAAM,SAAS,OACxB,MAAM,cAAc,CAAC,CAAC,SAAS,SAAS,OAAO;EAC7C,MAAM,YAAY,GAAG,MAAM,GAAG;EAC9B,KAAK,wBAAwB,CAAC;EAC9B,KAAK,oBAAoB,aAAa;GACpC,GAAG;GAIH,UAAU;GACV;GACA,aAAa,GAAG,UAAU;GAC1B,qBAAqB;EACvB;CACF,CAAC;MACI,IAAI,MAAM,SAAS,OACxB,MAAM,cAAc,CAAC,CAAC,SAAS,SAAS,OAAO;EAC7C,MAAM,YAAY,GAAG,MAAM,GAAG;EAC9B,KAAK,wBAAwB,CAAC;EAC9B,KAAK,oBAAoB,aAAa;GACpC,GAAG;GACH;GACA,aAAa,GAAG,UAAU;GAC1B,qBAAqB;EACvB;CACF,CAAC;AAIT;AAEA,SAAS,6BAA6B,MAA8B;CAClE,KAAK,MAAM,KAAK,MACd,KAAK,MAAM,KAAK,EAAE,WAChB,EAAE,OAAO,OAAO,eAAe,KAAK,GAAG,EAAE,OAAO,OAAO,cAAc;AAG3E;;AAGA,SAAS,uBAAuB,YAA4D;CAC1F,MAAM,0BAAU,IAAI,IAAyB;CAC7C,KAAK,MAAM,aAAa,YACtB,KAAK,MAAM,SAAS,UAAU,QAAQ;EACpC,IAAI,SAAS,QAAQ,IAAI,KAAK;EAC9B,IAAI,WAAW,KAAA,GAAW;GACxB,SAAS,CAAC;GACV,QAAQ,IAAI,OAAO,MAAM;EAC3B;EACA,IAAI,CAAC,OAAO,SAAS,SAAS,GAAG,OAAO,KAAK,SAAS;CACxD;CAEF,OAAO;AACT"}

package/build/dataloaders/fastWhereFilterHash.cjs

@@ -0,0 +1,140 @@
+Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
+const require_serde_temporal = require("../serde/temporal.cjs");
+const require_relations_Reference = require("../relations/Reference.cjs");
+const require_queries_find_Aliases = require("../queries/find/Aliases.cjs");
+require("../relations/index.cjs");
+const require_serde_temporalMappers = require("../serde/temporalMappers.cjs");
+const require_Entity = require("../Entity.cjs");
+//#region src/dataloaders/fastWhereFilterHash.ts
+const Temporal = require_serde_temporal.maybeRequireTemporal()?.Temporal;
+/**
+* Returns a fast stable key for find filters.
+*
+* This avoids `object-hash` for simple find filters; the phase 8 query-prep benchmark saw 1,000-query p50s drop
+* from ~22-26ms to ~7.6-10.9ms, with heap allocation dropping from ~24-30MB to ~10-16MB.
+*
+* We also benchmarked native/WASM non-cryptographic hash libraries, but they only hash bytes; they still need this
+* deterministic serialization first. For 1,000 filter keys, this helper alone had p50s of 0.337/0.353/0.410ms vs.
+* object-hash md5 at 7.467/7.436/7.620ms, and wrapping this key with native hashes was slower: farmhash
+* fingerprint64 at 0.517/0.524/0.538ms, @node-rs/xxhash xxh3-128 at 0.611/0.613/0.627ms, and xxhash-addon
+* XXH128 at 1.031/1.078/1.348ms. So the stable serialization is the necessary work, and keeping it as the cache
+* key avoids extra native-call/digest overhead and avoids introducing probabilistic hash collisions.
+*/
+function fastWhereFilterHash(value) {
+	return appendStableValue("", value, /* @__PURE__ */ new WeakSet());
+}
+/** Appends a deterministic, type-tagged representation of `value` to `key`. */
+function appendStableValue(key, value, seen) {
+	if (value === void 0) return `${key}u;`;
+	if (value === null) return `${key}n;`;
+	switch (typeof value) {
+		case "string": return `${key}s${value.length}:${value};`;
+		case "number": return `${key}d${value};`;
+		case "boolean": return `${key}b${value ? 1 : 0};`;
+		case "bigint": return `${key}i${value.toString()};`;
+		case "object": return appendStableObject(key, value, seen);
+		case "function": return require_queries_find_Aliases.isAlias(value) ? `${key}xalias;` : void 0;
+		default: return;
+	}
+}
+/** Appends a deterministic, type-tagged representation of `value` to `key`. */
+function appendStableObject(key, value, seen) {
+	if (value instanceof Date) return `${key}t${value.toISOString().length}:${value.toISOString()};`;
+	if (ArrayBuffer.isView(value)) return appendArrayBufferView(key, value);
+	if (Array.isArray(value)) {
+		if (seen.has(value)) return void 0;
+		seen.add(value);
+		key = `${key}a${value.length}[`;
+		for (const item of value) {
+			const nextKey = appendStableValue(key, item, seen);
+			if (nextKey === void 0) {
+				seen.delete(value);
+				return;
+			}
+			key = nextKey;
+		}
+		seen.delete(value);
+		return `${key}]`;
+	}
+	if (isPlainObject(value)) {
+		if (seen.has(value)) return void 0;
+		seen.add(value);
+		const keys = Object.keys(value).sort();
+		key = `${key}o${keys.length}{`;
+		for (const property of keys) {
+			key = `${key}${property.length}:${property}=`;
+			const nextKey = appendStableValue(key, value[property], seen);
+			if (nextKey === void 0) {
+				seen.delete(value);
+				return;
+			}
+			key = nextKey;
+		}
+		seen.delete(value);
+		return `${key}}`;
+	}
+	if (require_Entity.isEntity(value)) return `${key}e${value.toString().length}:${value.toString()};`;
+	const referenceKey = appendReferenceValue(key, value);
+	if (referenceKey !== void 0) return referenceKey;
+	const temporalValue = toTemporalDbValue(value);
+	if (temporalValue !== void 0) return appendTemporalValue(key, temporalValue);
+	const valueObjectKey = appendValueObject(key, value, seen);
+	if (valueObjectKey !== void 0) return valueObjectKey;
+}
+/** Appends an ArrayBuffer view by its exact byte contents. */
+function appendArrayBufferView(key, value) {
+	const bytes = Buffer.from(value.buffer, value.byteOffset, value.byteLength).toString("base64");
+	return `${key}y${value.constructor.name.length}:${value.constructor.name}:${bytes.length}:${bytes};`;
+}
+/** Appends a Joist reference by its tagged id. */
+function appendReferenceValue(key, value) {
+	if (!require_relations_Reference.isReference(value)) return void 0;
+	const id = value.idTaggedMaybe;
+	return id === void 0 ? `${key}r;` : `${key}r${id.length}:${id};`;
+}
+/** Appends a custom value object by constructor name and enumerable properties. */
+function appendValueObject(key, value, seen) {
+	if (!isValueObject(value)) return void 0;
+	if (seen.has(value)) return void 0;
+	seen.add(value);
+	const constructorName = value.constructor.name;
+	const keys = Object.keys(value).sort();
+	key = `${key}c${constructorName.length}:${constructorName}:${keys.length}{`;
+	for (const property of keys) {
+		key = `${key}${property.length}:${property}=`;
+		const nextKey = appendStableValue(key, value[property], seen);
+		if (nextKey === void 0) {
+			seen.delete(value);
+			return;
+		}
+		key = nextKey;
+	}
+	seen.delete(value);
+	return `${key}}`;
+}
+/** Appends a Temporal value as a distinct scalar type. */
+function appendTemporalValue(key, value) {
+	return `${key}t${value.length}:${value};`;
+}
+/** Returns the db representation for Temporal values, or undefined for non-Temporal values. */
+function toTemporalDbValue(value) {
+	if (!Temporal) return void 0;
+	if (value instanceof Temporal.ZonedDateTime) return require_serde_temporalMappers.zonedDateTimeMapper.toDb(value);
+	if (value instanceof Temporal.PlainDateTime) return require_serde_temporalMappers.plainDateTimeMapper.toDb(value);
+	if (value instanceof Temporal.PlainDate) return require_serde_temporalMappers.plainDateMapper.toDb(value);
+	if (value instanceof Temporal.PlainTime) return require_serde_temporalMappers.plainTimeMapper.toDb(value);
+}
+/** Returns true for plain object literals used by find filters/settings. */
+function isPlainObject(value) {
+	const prototype = Object.getPrototypeOf(value);
+	return prototype === Object.prototype || prototype === null;
+}
+/** Returns true for custom value objects that can be represented by enumerable fields. */
+function isValueObject(value) {
+	const prototype = Object.getPrototypeOf(value);
+	return prototype !== Object.prototype && prototype !== null && Object.keys(value).length > 0;
+}
+//#endregion
+exports.fastWhereFilterHash = fastWhereFilterHash;
+
+//# sourceMappingURL=fastWhereFilterHash.cjs.map

package/build/dataloaders/fastWhereFilterHash.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"fastWhereFilterHash.cjs","names":["maybeRequireTemporal","isAlias","isEntity","isReference","zonedDateTimeMapper","plainDateTimeMapper","plainDateMapper","plainTimeMapper"],"sources":["../../src/dataloaders/fastWhereFilterHash.ts"],"sourcesContent":["import { isEntity } from \"src/Entity.ts\";\nimport { isAlias } from \"src/queries/find/Aliases.ts\";\nimport { isReference } from \"src/relations/index.ts\";\nimport { maybeRequireTemporal } from \"src/serde/temporal.ts\";\nimport {\n  plainDateMapper,\n  plainDateTimeMapper,\n  plainTimeMapper,\n  zonedDateTimeMapper,\n} from \"src/serde/temporalMappers.ts\";\n\nconst Temporal = maybeRequireTemporal()?.Temporal;\n\n/**\n * Returns a fast stable key for find filters.\n *\n * This avoids `object-hash` for simple find filters; the phase 8 query-prep benchmark saw 1,000-query p50s drop\n * from ~22-26ms to ~7.6-10.9ms, with heap allocation dropping from ~24-30MB to ~10-16MB.\n *\n * We also benchmarked native/WASM non-cryptographic hash libraries, but they only hash bytes; they still need this\n * deterministic serialization first. For 1,000 filter keys, this helper alone had p50s of 0.337/0.353/0.410ms vs.\n * object-hash md5 at 7.467/7.436/7.620ms, and wrapping this key with native hashes was slower: farmhash\n * fingerprint64 at 0.517/0.524/0.538ms, @node-rs/xxhash xxh3-128 at 0.611/0.613/0.627ms, and xxhash-addon\n * XXH128 at 1.031/1.078/1.348ms. So the stable serialization is the necessary work, and keeping it as the cache\n * key avoids extra native-call/digest overhead and avoids introducing probabilistic hash collisions.\n */\nexport function fastWhereFilterHash(value: unknown): string | undefined {\n  return appendStableValue(\"\", value, new WeakSet<object>());\n}\n\n/** Appends a deterministic, type-tagged representation of `value` to `key`. */\nfunction appendStableValue(key: string, value: unknown, seen: WeakSet<object>): string | undefined {\n  if (value === undefined) return `${key}u;`;\n  if (value === null) return `${key}n;`;\n  switch (typeof value) {\n    case \"string\":\n      return `${key}s${value.length}:${value};`;\n    case \"number\":\n      return `${key}d${value};`;\n    case \"boolean\":\n      return `${key}b${value ? 1 : 0};`;\n    case \"bigint\":\n      return `${key}i${value.toString()};`;\n    case \"object\":\n      return appendStableObject(key, value, seen);\n    case \"function\":\n      return isAlias(value) ? `${key}xalias;` : undefined;\n    default:\n      return undefined;\n  }\n}\n\n/** Appends a deterministic, type-tagged representation of `value` to `key`. */\nfunction appendStableObject(key: string, value: object, seen: WeakSet<object>): string | undefined {\n  if (value instanceof Date) return `${key}t${value.toISOString().length}:${value.toISOString()};`;\n  if (ArrayBuffer.isView(value)) return appendArrayBufferView(key, value);\n\n  if (Array.isArray(value)) {\n    if (seen.has(value)) return undefined;\n    seen.add(value);\n    key = `${key}a${value.length}[`;\n    for (const item of value) {\n      const nextKey = appendStableValue(key, item, seen);\n      if (nextKey === undefined) {\n        seen.delete(value);\n        return undefined;\n      }\n      key = nextKey;\n    }\n    seen.delete(value);\n    return `${key}]`;\n  }\n\n  if (isPlainObject(value)) {\n    if (seen.has(value)) return undefined;\n    seen.add(value);\n\n    const keys = Object.keys(value).sort();\n    key = `${key}o${keys.length}{`;\n    for (const property of keys) {\n      key = `${key}${property.length}:${property}=`;\n      const nextKey = appendStableValue(key, (value as Record<string, unknown>)[property], seen);\n      if (nextKey === undefined) {\n        seen.delete(value);\n        return undefined;\n      }\n      key = nextKey;\n    }\n    seen.delete(value);\n    return `${key}}`;\n  }\n\n  if (isEntity(value)) return `${key}e${value.toString().length}:${value.toString()};`;\n  const referenceKey = appendReferenceValue(key, value);\n  if (referenceKey !== undefined) return referenceKey;\n  const temporalValue = toTemporalDbValue(value);\n  if (temporalValue !== undefined) return appendTemporalValue(key, temporalValue);\n  const valueObjectKey = appendValueObject(key, value, seen);\n  if (valueObjectKey !== undefined) return valueObjectKey;\n  return undefined;\n}\n\n/** Appends an ArrayBuffer view by its exact byte contents. */\nfunction appendArrayBufferView(key: string, value: ArrayBufferView): string {\n  const bytes = Buffer.from(value.buffer, value.byteOffset, value.byteLength).toString(\"base64\");\n  return `${key}y${value.constructor.name.length}:${value.constructor.name}:${bytes.length}:${bytes};`;\n}\n\n/** Appends a Joist reference by its tagged id. */\nfunction appendReferenceValue(key: string, value: object): string | undefined {\n  if (!isReference(value)) return undefined;\n  const id = value.idTaggedMaybe;\n  return id === undefined ? `${key}r;` : `${key}r${id.length}:${id};`;\n}\n\n/** Appends a custom value object by constructor name and enumerable properties. */\nfunction appendValueObject(key: string, value: object, seen: WeakSet<object>): string | undefined {\n  if (!isValueObject(value)) return undefined;\n  if (seen.has(value)) return undefined;\n  seen.add(value);\n\n  const constructorName = value.constructor.name;\n  const keys = Object.keys(value).sort();\n  key = `${key}c${constructorName.length}:${constructorName}:${keys.length}{`;\n  for (const property of keys) {\n    key = `${key}${property.length}:${property}=`;\n    const nextKey = appendStableValue(key, (value as Record<string, unknown>)[property], seen);\n    if (nextKey === undefined) {\n      seen.delete(value);\n      return undefined;\n    }\n    key = nextKey;\n  }\n  seen.delete(value);\n  return `${key}}`;\n}\n\n/** Appends a Temporal value as a distinct scalar type. */\nfunction appendTemporalValue(key: string, value: string): string {\n  return `${key}t${value.length}:${value};`;\n}\n\n/** Returns the db representation for Temporal values, or undefined for non-Temporal values. */\nfunction toTemporalDbValue(value: object): string | undefined {\n  if (!Temporal) return undefined;\n  if (value instanceof Temporal.ZonedDateTime) return zonedDateTimeMapper.toDb(value);\n  if (value instanceof Temporal.PlainDateTime) return plainDateTimeMapper.toDb(value);\n  if (value instanceof Temporal.PlainDate) return plainDateMapper.toDb(value);\n  if (value instanceof Temporal.PlainTime) return plainTimeMapper.toDb(value);\n  return undefined;\n}\n\n/** Returns true for plain object literals used by find filters/settings. */\nfunction isPlainObject(value: object): boolean {\n  const prototype = Object.getPrototypeOf(value);\n  return prototype === Object.prototype || prototype === null;\n}\n\n/** Returns true for custom value objects that can be represented by enumerable fields. */\nfunction isValueObject(value: object): boolean {\n  const prototype = Object.getPrototypeOf(value);\n  return prototype !== Object.prototype && prototype !== null && Object.keys(value).length > 0;\n}\n"],"mappings":";;;;;;;;AAWA,MAAM,WAAWA,uBAAAA,qBAAqB,CAAC,EAAE;;;;;;;;;;;;;;AAezC,SAAgB,oBAAoB,OAAoC;CACtE,OAAO,kBAAkB,IAAI,uBAAO,IAAI,QAAgB,CAAC;AAC3D;;AAGA,SAAS,kBAAkB,KAAa,OAAgB,MAA2C;CACjG,IAAI,UAAU,KAAA,GAAW,OAAO,GAAG,IAAI;CACvC,IAAI,UAAU,MAAM,OAAO,GAAG,IAAI;CAClC,QAAQ,OAAO,OAAf;EACE,KAAK,UACH,OAAO,GAAG,IAAI,GAAG,MAAM,OAAO,GAAG,MAAM;EACzC,KAAK,UACH,OAAO,GAAG,IAAI,GAAG,MAAM;EACzB,KAAK,WACH,OAAO,GAAG,IAAI,GAAG,QAAQ,IAAI,EAAE;EACjC,KAAK,UACH,OAAO,GAAG,IAAI,GAAG,MAAM,SAAS,EAAE;EACpC,KAAK,UACH,OAAO,mBAAmB,KAAK,OAAO,IAAI;EAC5C,KAAK,YACH,OAAOC,6BAAAA,QAAQ,KAAK,IAAI,GAAG,IAAI,WAAW,KAAA;EAC5C,SACE;CACJ;AACF;;AAGA,SAAS,mBAAmB,KAAa,OAAe,MAA2C;CACjG,IAAI,iBAAiB,MAAM,OAAO,GAAG,IAAI,GAAG,MAAM,YAAY,CAAC,CAAC,OAAO,GAAG,MAAM,YAAY,EAAE;CAC9F,IAAI,YAAY,OAAO,KAAK,GAAG,OAAO,sBAAsB,KAAK,KAAK;CAEtE,IAAI,MAAM,QAAQ,KAAK,GAAG;EACxB,IAAI,KAAK,IAAI,KAAK,GAAG,OAAO,KAAA;EAC5B,KAAK,IAAI,KAAK;EACd,MAAM,GAAG,IAAI,GAAG,MAAM,OAAO;EAC7B,KAAK,MAAM,QAAQ,OAAO;GACxB,MAAM,UAAU,kBAAkB,KAAK,MAAM,IAAI;GACjD,IAAI,YAAY,KAAA,GAAW;IACzB,KAAK,OAAO,KAAK;IACjB;GACF;GACA,MAAM;EACR;EACA,KAAK,OAAO,KAAK;EACjB,OAAO,GAAG,IAAI;CAChB;CAEA,IAAI,cAAc,KAAK,GAAG;EACxB,IAAI,KAAK,IAAI,KAAK,GAAG,OAAO,KAAA;EAC5B,KAAK,IAAI,KAAK;EAEd,MAAM,OAAO,OAAO,KAAK,KAAK,CAAC,CAAC,KAAK;EACrC,MAAM,GAAG,IAAI,GAAG,KAAK,OAAO;EAC5B,KAAK,MAAM,YAAY,MAAM;GAC3B,MAAM,GAAG,MAAM,SAAS,OAAO,GAAG,SAAS;GAC3C,MAAM,UAAU,kBAAkB,KAAM,MAAkC,WAAW,IAAI;GACzF,IAAI,YAAY,KAAA,GAAW;IACzB,KAAK,OAAO,KAAK;IACjB;GACF;GACA,MAAM;EACR;EACA,KAAK,OAAO,KAAK;EACjB,OAAO,GAAG,IAAI;CAChB;CAEA,IAAIC,eAAAA,SAAS,KAAK,GAAG,OAAO,GAAG,IAAI,GAAG,MAAM,SAAS,CAAC,CAAC,OAAO,GAAG,MAAM,SAAS,EAAE;CAClF,MAAM,eAAe,qBAAqB,KAAK,KAAK;CACpD,IAAI,iBAAiB,KAAA,GAAW,OAAO;CACvC,MAAM,gBAAgB,kBAAkB,KAAK;CAC7C,IAAI,kBAAkB,KAAA,GAAW,OAAO,oBAAoB,KAAK,aAAa;CAC9E,MAAM,iBAAiB,kBAAkB,KAAK,OAAO,IAAI;CACzD,IAAI,mBAAmB,KAAA,GAAW,OAAO;AAE3C;;AAGA,SAAS,sBAAsB,KAAa,OAAgC;CAC1E,MAAM,QAAQ,OAAO,KAAK,MAAM,QAAQ,MAAM,YAAY,MAAM,UAAU,CAAC,CAAC,SAAS,QAAQ;CAC7F,OAAO,GAAG,IAAI,GAAG,MAAM,YAAY,KAAK,OAAO,GAAG,MAAM,YAAY,KAAK,GAAG,MAAM,OAAO,GAAG,MAAM;AACpG;;AAGA,SAAS,qBAAqB,KAAa,OAAmC;CAC5E,IAAI,CAACC,4BAAAA,YAAY,KAAK,GAAG,OAAO,KAAA;CAChC,MAAM,KAAK,MAAM;CACjB,OAAO,OAAO,KAAA,IAAY,GAAG,IAAI,MAAM,GAAG,IAAI,GAAG,GAAG,OAAO,GAAG,GAAG;AACnE;;AAGA,SAAS,kBAAkB,KAAa,OAAe,MAA2C;CAChG,IAAI,CAAC,cAAc,KAAK,GAAG,OAAO,KAAA;CAClC,IAAI,KAAK,IAAI,KAAK,GAAG,OAAO,KAAA;CAC5B,KAAK,IAAI,KAAK;CAEd,MAAM,kBAAkB,MAAM,YAAY;CAC1C,MAAM,OAAO,OAAO,KAAK,KAAK,CAAC,CAAC,KAAK;CACrC,MAAM,GAAG,IAAI,GAAG,gBAAgB,OAAO,GAAG,gBAAgB,GAAG,KAAK,OAAO;CACzE,KAAK,MAAM,YAAY,MAAM;EAC3B,MAAM,GAAG,MAAM,SAAS,OAAO,GAAG,SAAS;EAC3C,MAAM,UAAU,kBAAkB,KAAM,MAAkC,WAAW,IAAI;EACzF,IAAI,YAAY,KAAA,GAAW;GACzB,KAAK,OAAO,KAAK;GACjB;EACF;EACA,MAAM;CACR;CACA,KAAK,OAAO,KAAK;CACjB,OAAO,GAAG,IAAI;AAChB;;AAGA,SAAS,oBAAoB,KAAa,OAAuB;CAC/D,OAAO,GAAG,IAAI,GAAG,MAAM,OAAO,GAAG,MAAM;AACzC;;AAGA,SAAS,kBAAkB,OAAmC;CAC5D,IAAI,CAAC,UAAU,OAAO,KAAA;CACtB,IAAI,iBAAiB,SAAS,eAAe,OAAOC,8BAAAA,oBAAoB,KAAK,KAAK;CAClF,IAAI,iBAAiB,SAAS,eAAe,OAAOC,8BAAAA,oBAAoB,KAAK,KAAK;CAClF,IAAI,iBAAiB,SAAS,WAAW,OAAOC,8BAAAA,gBAAgB,KAAK,KAAK;CAC1E,IAAI,iBAAiB,SAAS,WAAW,OAAOC,8BAAAA,gBAAgB,KAAK,KAAK;AAE5E;;AAGA,SAAS,cAAc,OAAwB;CAC7C,MAAM,YAAY,OAAO,eAAe,KAAK;CAC7C,OAAO,cAAc,OAAO,aAAa,cAAc;AACzD;;AAGA,SAAS,cAAc,OAAwB;CAC7C,MAAM,YAAY,OAAO,eAAe,KAAK;CAC7C,OAAO,cAAc,OAAO,aAAa,cAAc,QAAQ,OAAO,KAAK,KAAK,CAAC,CAAC,SAAS;AAC7F"}

package/build/dataloaders/fastWhereFilterHash.d.cts

@@ -0,0 +1,18 @@
+//#region src/dataloaders/fastWhereFilterHash.d.ts
+/**
+ * Returns a fast stable key for find filters.
+ *
+ * This avoids `object-hash` for simple find filters; the phase 8 query-prep benchmark saw 1,000-query p50s drop
+ * from ~22-26ms to ~7.6-10.9ms, with heap allocation dropping from ~24-30MB to ~10-16MB.
+ *
+ * We also benchmarked native/WASM non-cryptographic hash libraries, but they only hash bytes; they still need this
+ * deterministic serialization first. For 1,000 filter keys, this helper alone had p50s of 0.337/0.353/0.410ms vs.
+ * object-hash md5 at 7.467/7.436/7.620ms, and wrapping this key with native hashes was slower: farmhash
+ * fingerprint64 at 0.517/0.524/0.538ms, @node-rs/xxhash xxh3-128 at 0.611/0.613/0.627ms, and xxhash-addon
+ * XXH128 at 1.031/1.078/1.348ms. So the stable serialization is the necessary work, and keeping it as the cache
+ * key avoids extra native-call/digest overhead and avoids introducing probabilistic hash collisions.
+ */
+declare function fastWhereFilterHash(value: unknown): string | undefined;
+//#endregion
+export { fastWhereFilterHash };
+//# sourceMappingURL=fastWhereFilterHash.d.cts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"fastWhereFilterHash.d.cts","names":[],"sources":["../../src/dataloaders/fastWhereFilterHash.ts"],"mappings":";;;;;;;;;;;;;;iBA0BgB,oBAAoB"}

package/build/dataloaders/fastWhereFilterHash.d.mts

@@ -0,0 +1,18 @@
+//#region src/dataloaders/fastWhereFilterHash.d.ts
+/**
+ * Returns a fast stable key for find filters.
+ *
+ * This avoids `object-hash` for simple find filters; the phase 8 query-prep benchmark saw 1,000-query p50s drop
+ * from ~22-26ms to ~7.6-10.9ms, with heap allocation dropping from ~24-30MB to ~10-16MB.
+ *
+ * We also benchmarked native/WASM non-cryptographic hash libraries, but they only hash bytes; they still need this
+ * deterministic serialization first. For 1,000 filter keys, this helper alone had p50s of 0.337/0.353/0.410ms vs.
+ * object-hash md5 at 7.467/7.436/7.620ms, and wrapping this key with native hashes was slower: farmhash
+ * fingerprint64 at 0.517/0.524/0.538ms, @node-rs/xxhash xxh3-128 at 0.611/0.613/0.627ms, and xxhash-addon
+ * XXH128 at 1.031/1.078/1.348ms. So the stable serialization is the necessary work, and keeping it as the cache
+ * key avoids extra native-call/digest overhead and avoids introducing probabilistic hash collisions.
+ */
+declare function fastWhereFilterHash(value: unknown): string | undefined;
+//#endregion
+export { fastWhereFilterHash };
+//# sourceMappingURL=fastWhereFilterHash.d.mts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"fastWhereFilterHash.d.mts","names":[],"sources":["../../src/dataloaders/fastWhereFilterHash.ts"],"mappings":";;;;;;;;;;;;;;iBA0BgB,oBAAoB"}

package/build/dataloaders/fastWhereFilterHash.js

@@ -1,164 +1,139 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.fastWhereFilterHash = fastWhereFilterHash;
-const Aliases_1 = require("../Aliases");
-const Entity_1 = require("../Entity");
-const relations_1 = require("../relations");
-const temporal_1 = require("../temporal");
-const temporalMappers_1 = require("../temporalMappers");
-const Temporal = (0, temporal_1.maybeRequireTemporal)()?.Temporal;
+import { maybeRequireTemporal } from "../serde/temporal.js";
+import { isReference } from "../relations/Reference.js";
+import { isAlias } from "../queries/find/Aliases.js";
+import "../relations/index.js";
+import { plainDateMapper, plainDateTimeMapper, plainTimeMapper, zonedDateTimeMapper } from "../serde/temporalMappers.js";
+import { isEntity } from "../Entity.js";
+//#region src/dataloaders/fastWhereFilterHash.ts
+const Temporal = maybeRequireTemporal()?.Temporal;
 /**
- * Returns a fast stable key for find filters.
- *
- * This avoids `object-hash` for simple find filters; the phase 8 query-prep benchmark saw 1,000-query p50s drop
- * from ~22-26ms to ~7.6-10.9ms, with heap allocation dropping from ~24-30MB to ~10-16MB.
- *
- * We also benchmarked native/WASM non-cryptographic hash libraries, but they only hash bytes; they still need this
- * deterministic serialization first. For 1,000 filter keys, this helper alone had p50s of 0.337/0.353/0.410ms vs.
- * object-hash md5 at 7.467/7.436/7.620ms, and wrapping this key with native hashes was slower: farmhash
- * fingerprint64 at 0.517/0.524/0.538ms, @node-rs/xxhash xxh3-128 at 0.611/0.613/0.627ms, and xxhash-addon
- * XXH128 at 1.031/1.078/1.348ms. So the stable serialization is the necessary work, and keeping it as the cache
- * key avoids extra native-call/digest overhead and avoids introducing probabilistic hash collisions.
- */
+* Returns a fast stable key for find filters.
+*
+* This avoids `object-hash` for simple find filters; the phase 8 query-prep benchmark saw 1,000-query p50s drop
+* from ~22-26ms to ~7.6-10.9ms, with heap allocation dropping from ~24-30MB to ~10-16MB.
+*
+* We also benchmarked native/WASM non-cryptographic hash libraries, but they only hash bytes; they still need this
+* deterministic serialization first. For 1,000 filter keys, this helper alone had p50s of 0.337/0.353/0.410ms vs.
+* object-hash md5 at 7.467/7.436/7.620ms, and wrapping this key with native hashes was slower: farmhash
+* fingerprint64 at 0.517/0.524/0.538ms, @node-rs/xxhash xxh3-128 at 0.611/0.613/0.627ms, and xxhash-addon
+* XXH128 at 1.031/1.078/1.348ms. So the stable serialization is the necessary work, and keeping it as the cache
+* key avoids extra native-call/digest overhead and avoids introducing probabilistic hash collisions.
+*/
 function fastWhereFilterHash(value) {
-    return appendStableValue("", value, new WeakSet());
+	return appendStableValue("", value, /* @__PURE__ */ new WeakSet());
 }
 /** Appends a deterministic, type-tagged representation of `value` to `key`. */
 function appendStableValue(key, value, seen) {
-    if (value === undefined)
-        return `${key}u;`;
-    if (value === null)
-        return `${key}n;`;
-    switch (typeof value) {
-        case "string":
-            return `${key}s${value.length}:${value};`;
-        case "number":
-            return `${key}d${value};`;
-        case "boolean":
-            return `${key}b${value ? 1 : 0};`;
-        case "bigint":
-            return `${key}i${value.toString()};`;
-        case "object":
-            return appendStableObject(key, value, seen);
-        case "function":
-            return (0, Aliases_1.isAlias)(value) ? `${key}xalias;` : undefined;
-        default:
-            return undefined;
-    }
+	if (value === void 0) return `${key}u;`;
+	if (value === null) return `${key}n;`;
+	switch (typeof value) {
+		case "string": return `${key}s${value.length}:${value};`;
+		case "number": return `${key}d${value};`;
+		case "boolean": return `${key}b${value ? 1 : 0};`;
+		case "bigint": return `${key}i${value.toString()};`;
+		case "object": return appendStableObject(key, value, seen);
+		case "function": return isAlias(value) ? `${key}xalias;` : void 0;
+		default: return;
+	}
 }
 /** Appends a deterministic, type-tagged representation of `value` to `key`. */
 function appendStableObject(key, value, seen) {
-    if (value instanceof Date)
-        return `${key}t${value.toISOString().length}:${value.toISOString()};`;
-    if (ArrayBuffer.isView(value))
-        return appendArrayBufferView(key, value);
-    if (Array.isArray(value)) {
-        if (seen.has(value))
-            return undefined;
-        seen.add(value);
-        key = `${key}a${value.length}[`;
-        for (const item of value) {
-            const nextKey = appendStableValue(key, item, seen);
-            if (nextKey === undefined) {
-                seen.delete(value);
-                return undefined;
-            }
-            key = nextKey;
-        }
-        seen.delete(value);
-        return `${key}]`;
-    }
-    if (isPlainObject(value)) {
-        if (seen.has(value))
-            return undefined;
-        seen.add(value);
-        const keys = Object.keys(value).sort();
-        key = `${key}o${keys.length}{`;
-        for (const property of keys) {
-            key = `${key}${property.length}:${property}=`;
-            const nextKey = appendStableValue(key, value[property], seen);
-            if (nextKey === undefined) {
-                seen.delete(value);
-                return undefined;
-            }
-            key = nextKey;
-        }
-        seen.delete(value);
-        return `${key}}`;
-    }
-    if ((0, Entity_1.isEntity)(value))
-        return `${key}e${value.toString().length}:${value.toString()};`;
-    const referenceKey = appendReferenceValue(key, value);
-    if (referenceKey !== undefined)
-        return referenceKey;
-    const temporalValue = toTemporalDbValue(value);
-    if (temporalValue !== undefined)
-        return appendTemporalValue(key, temporalValue);
-    const valueObjectKey = appendValueObject(key, value, seen);
-    if (valueObjectKey !== undefined)
-        return valueObjectKey;
-    return undefined;
+	if (value instanceof Date) return `${key}t${value.toISOString().length}:${value.toISOString()};`;
+	if (ArrayBuffer.isView(value)) return appendArrayBufferView(key, value);
+	if (Array.isArray(value)) {
+		if (seen.has(value)) return void 0;
+		seen.add(value);
+		key = `${key}a${value.length}[`;
+		for (const item of value) {
+			const nextKey = appendStableValue(key, item, seen);
+			if (nextKey === void 0) {
+				seen.delete(value);
+				return;
+			}
+			key = nextKey;
+		}
+		seen.delete(value);
+		return `${key}]`;
+	}
+	if (isPlainObject(value)) {
+		if (seen.has(value)) return void 0;
+		seen.add(value);
+		const keys = Object.keys(value).sort();
+		key = `${key}o${keys.length}{`;
+		for (const property of keys) {
+			key = `${key}${property.length}:${property}=`;
+			const nextKey = appendStableValue(key, value[property], seen);
+			if (nextKey === void 0) {
+				seen.delete(value);
+				return;
+			}
+			key = nextKey;
+		}
+		seen.delete(value);
+		return `${key}}`;
+	}
+	if (isEntity(value)) return `${key}e${value.toString().length}:${value.toString()};`;
+	const referenceKey = appendReferenceValue(key, value);
+	if (referenceKey !== void 0) return referenceKey;
+	const temporalValue = toTemporalDbValue(value);
+	if (temporalValue !== void 0) return appendTemporalValue(key, temporalValue);
+	const valueObjectKey = appendValueObject(key, value, seen);
+	if (valueObjectKey !== void 0) return valueObjectKey;
 }
 /** Appends an ArrayBuffer view by its exact byte contents. */
 function appendArrayBufferView(key, value) {
-    const bytes = Buffer.from(value.buffer, value.byteOffset, value.byteLength).toString("base64");
-    return `${key}y${value.constructor.name.length}:${value.constructor.name}:${bytes.length}:${bytes};`;
+	const bytes = Buffer.from(value.buffer, value.byteOffset, value.byteLength).toString("base64");
+	return `${key}y${value.constructor.name.length}:${value.constructor.name}:${bytes.length}:${bytes};`;
 }
 /** Appends a Joist reference by its tagged id. */
 function appendReferenceValue(key, value) {
-    if (!(0, relations_1.isReference)(value))
-        return undefined;
-    const id = value.idTaggedMaybe;
-    return id === undefined ? `${key}r;` : `${key}r${id.length}:${id};`;
+	if (!isReference(value)) return void 0;
+	const id = value.idTaggedMaybe;
+	return id === void 0 ? `${key}r;` : `${key}r${id.length}:${id};`;
 }
 /** Appends a custom value object by constructor name and enumerable properties. */
 function appendValueObject(key, value, seen) {
-    if (!isValueObject(value))
-        return undefined;
-    if (seen.has(value))
-        return undefined;
-    seen.add(value);
-    const constructorName = value.constructor.name;
-    const keys = Object.keys(value).sort();
-    key = `${key}c${constructorName.length}:${constructorName}:${keys.length}{`;
-    for (const property of keys) {
-        key = `${key}${property.length}:${property}=`;
-        const nextKey = appendStableValue(key, value[property], seen);
-        if (nextKey === undefined) {
-            seen.delete(value);
-            return undefined;
-        }
-        key = nextKey;
-    }
-    seen.delete(value);
-    return `${key}}`;
+	if (!isValueObject(value)) return void 0;
+	if (seen.has(value)) return void 0;
+	seen.add(value);
+	const constructorName = value.constructor.name;
+	const keys = Object.keys(value).sort();
+	key = `${key}c${constructorName.length}:${constructorName}:${keys.length}{`;
+	for (const property of keys) {
+		key = `${key}${property.length}:${property}=`;
+		const nextKey = appendStableValue(key, value[property], seen);
+		if (nextKey === void 0) {
+			seen.delete(value);
+			return;
+		}
+		key = nextKey;
+	}
+	seen.delete(value);
+	return `${key}}`;
 }
 /** Appends a Temporal value as a distinct scalar type. */
 function appendTemporalValue(key, value) {
-    return `${key}t${value.length}:${value};`;
+	return `${key}t${value.length}:${value};`;
 }
 /** Returns the db representation for Temporal values, or undefined for non-Temporal values. */
 function toTemporalDbValue(value) {
-    if (!Temporal)
-        return undefined;
-    if (value instanceof Temporal.ZonedDateTime)
-        return temporalMappers_1.zonedDateTimeMapper.toDb(value);
-    if (value instanceof Temporal.PlainDateTime)
-        return temporalMappers_1.plainDateTimeMapper.toDb(value);
-    if (value instanceof Temporal.PlainDate)
-        return temporalMappers_1.plainDateMapper.toDb(value);
-    if (value instanceof Temporal.PlainTime)
-        return temporalMappers_1.plainTimeMapper.toDb(value);
-    return undefined;
+	if (!Temporal) return void 0;
+	if (value instanceof Temporal.ZonedDateTime) return zonedDateTimeMapper.toDb(value);
+	if (value instanceof Temporal.PlainDateTime) return plainDateTimeMapper.toDb(value);
+	if (value instanceof Temporal.PlainDate) return plainDateMapper.toDb(value);
+	if (value instanceof Temporal.PlainTime) return plainTimeMapper.toDb(value);
 }
 /** Returns true for plain object literals used by find filters/settings. */
 function isPlainObject(value) {
-    const prototype = Object.getPrototypeOf(value);
-    return prototype === Object.prototype || prototype === null;
+	const prototype = Object.getPrototypeOf(value);
+	return prototype === Object.prototype || prototype === null;
 }
 /** Returns true for custom value objects that can be represented by enumerable fields. */
 function isValueObject(value) {
-    const prototype = Object.getPrototypeOf(value);
-    return prototype !== Object.prototype && prototype !== null && Object.keys(value).length > 0;
+	const prototype = Object.getPrototypeOf(value);
+	return prototype !== Object.prototype && prototype !== null && Object.keys(value).length > 0;
 }
+//#endregion
+export { fastWhereFilterHash };
+
 //# sourceMappingURL=fastWhereFilterHash.js.map