npm - @azure/cosmos - Versions diffs - 4.9.1 → 4.9.2 - Mend

@azure/cosmos 4.9.1 → 4.9.2

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.

Files changed (1282) hide show

package/dist/commonjs/utils/hashing/murmurHash.js.map CHANGED Viewed

@@ -1 +1,7 @@
-{"version":3,"file":"murmurHash.js","sourceRoot":"","sources":["../../../../src/utils/hashing/murmurHash.ts"],"names":[],"mappings":";AAAA,2EAA2E;AAC3E,oEAAoE;AACpE,2EAA2E;AAC3E,2EAA2E;AAC3E,gFAAgF;AAChF,gHAAgH;AAChH,2EAA2E;AAC3E,2EAA2E;;AAmhB3E,0BAQC;AAzhBD,oBAAoB;AACpB,oBAAoB;AACpB,0CAAqE;AACrE,SAAS,YAAY,CAAC,CAAS,EAAE,CAAS;IACxC,EAAE;IACF,iEAAiE;IACjE,aAAa;IACb,EAAE;IAEF,OAAO,CAAC,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC;AAChE,CAAC;AAED,SAAS,QAAQ,CAAC,CAAS,EAAE,CAAS;IACpC,EAAE;IACF,uEAAuE;IACvE,kEAAkE;IAClE,EAAE;IAEF,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;AACrC,CAAC;AAED,SAAS,QAAQ,CAAC,CAAS;IACzB,EAAE;IACF,oEAAoE;IACpE,EAAE;IAEF,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC;IACd,CAAC,GAAG,YAAY,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC;IAChC,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC;IACd,CAAC,GAAG,YAAY,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC;IAChC,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC;IAEd,OAAO,CAAC,CAAC;AACX,CAAC;AAED,SAAS,OAAO,CAAC,CAAW,EAAE,CAAW;IACvC,EAAE;IACF,uEAAuE;IACvE,iEAAiE;IACjE,EAAE;IAEF,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC;IAC7D,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC;IAC7D,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IAEvB,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IACpB,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC;IACpB,CAAC,CAAC,CAAC,CAAC,IAAI,MAAM,CAAC;IAEf,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IACpB,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC;IACpB,CAAC,CAAC,CAAC,CAAC,IAAI,MAAM,CAAC;IAEf,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IACpB,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC;IACpB,CAAC,CAAC,CAAC,CAAC,IAAI,MAAM,CAAC;IAEf,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IACpB,CAAC,CAAC,CAAC,CAAC,IAAI,MAAM,CAAC;IAEf,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AACpD,CAAC;AAED,SAAS,YAAY,CAAC,CAAW,EAAE,CAAW;IAC5C,EAAE;IACF,uEAAuE;IACvE,sEAAsE;IACtE,EAAE;IAEF,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC;IAC7D,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC;IAC7D,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IAEvB,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IACpB,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC;IACpB,CAAC,CAAC,CAAC,CAAC,IAAI,MAAM,CAAC;IAEf,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IACpB,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC;IACpB,CAAC,CAAC,CAAC,CAAC,IAAI,MAAM,CAAC;IAEf,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IACpB,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC;IACpB,CAAC,CAAC,CAAC,CAAC,IAAI,MAAM,CAAC;IAEf,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IACpB,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC;IACpB,CAAC,CAAC,CAAC,CAAC,IAAI,MAAM,CAAC;IAEf,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IACpB,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC;IACpB,CAAC,CAAC,CAAC,CAAC,IAAI,MAAM,CAAC;IAEf,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IACpB,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC;IACpB,CAAC,CAAC,CAAC,CAAC,IAAI,MAAM,CAAC;IAEf,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IAC9D,CAAC,CAAC,CAAC,CAAC,IAAI,MAAM,CAAC;IAEf,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AACpD,CAAC;AAED,SAAS,QAAQ,CAAC,CAAW,EAAE,CAAS;IACtC,EAAE;IACF,+DAA+D;IAC/D,uEAAuE;IACvE,qEAAqE;IACrE,EAAE;IAEF,CAAC,IAAI,EAAE,CAAC;IAER,IAAI,CAAC,KAAK,EAAE,EAAE,CAAC;QACb,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACtB,CAAC;SAAM,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC;QAClB,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IAChF,CAAC;SAAM,CAAC;QACN,CAAC,IAAI,EAAE,CAAC;QACR,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IAChF,CAAC;AACH,CAAC;AAED,SAAS,aAAa,CAAC,CAAW,EAAE,CAAS;IAC3C,EAAE;IACF,+DAA+D;IAC/D,uEAAuE;IACvE,qEAAqE;IACrE,EAAE;IAEF,CAAC,IAAI,EAAE,CAAC;IAER,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;QACZ,OAAO,CAAC,CAAC;IACX,CAAC;SAAM,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC;QAClB,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;IACxD,CAAC;SAAM,CAAC;QACN,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IAC/B,CAAC;AACH,CAAC;AAED,SAAS,OAAO,CAAC,CAAW,EAAE,CAAW;IACvC,EAAE;IACF,uEAAuE;IACvE,iEAAiE;IACjE,EAAE;IAEF,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AACpC,CAAC;AAED,SAAS,QAAQ,CAAC,CAAW;IAC3B,EAAE;IACF,oEAAoE;IACpE,mEAAmE;IACnE,uDAAuD;IACvD,EAAE;IAEF,CAAC,GAAG,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAChC,CAAC,GAAG,YAAY,CAAC,CAAC,EAAE,CAAC,UAAU,EAAE,UAAU,CAAC,CAAC,CAAC;IAC9C,CAAC,GAAG,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAChC,CAAC,GAAG,YAAY,CAAC,CAAC,EAAE,CAAC,UAAU,EAAE,UAAU,CAAC,CAAC,CAAC;IAC9C,CAAC,GAAG,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAEhC,OAAO,CAAC,CAAC;AACX,CAAC;AAED,mBAAmB;AACnB,mBAAmB;AAEnB,SAAS,SAAS,CAAC,KAAiB,EAAE,IAAa;IACjD,EAAE;IACF,uEAAuE;IACvE,2DAA2D;IAC3D,EAAE;IACF,IAAI,GAAG,IAAI,IAAI,CAAC,CAAC;IAEjB,MAAM,SAAS,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;IACnC,MAAM,MAAM,GAAG,KAAK,CAAC,MAAM,GAAG,SAAS,CAAC;IAExC,IAAI,EAAE,GAAG,IAAI,CAAC;IAEd,IAAI,EAAE,GAAG,CAAC,CAAC;IAEX,MAAM,EAAE,GAAG,UAAU,CAAC;IACtB,MAAM,EAAE,GAAG,UAAU,CAAC;IACtB,IAAI,CAAC,GAAG,CAAC,CAAC;IAEV,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;QACtC,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC;QAElF,EAAE,GAAG,YAAY,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QAC1B,EAAE,GAAG,QAAQ,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QACtB,EAAE,GAAG,YAAY,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QAE1B,EAAE,IAAI,EAAE,CAAC;QACT,EAAE,GAAG,QAAQ,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QACtB,EAAE,GAAG,YAAY,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,UAAU,CAAC;QACtC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IACZ,CAAC;IAED,EAAE,GAAG,CAAC,CAAC;IAEP,QAAQ,SAAS,EAAE,CAAC;QAClB,KAAK,CAAC;YACJ,EAAE,IAAI,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC;QAE3B,KAAK,CAAC;YACJ,EAAE,IAAI,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC;QAE1B,KAAK,CAAC;YACJ,EAAE,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC;YACf,EAAE,GAAG,YAAY,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;YAC1B,EAAE,GAAG,QAAQ,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;YACtB,EAAE,GAAG,YAAY,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;YAC1B,EAAE,IAAI,EAAE,CAAC;IACb,CAAC;IAED,EAAE,IAAI,KAAK,CAAC,MAAM,CAAC;IACnB,EAAE,GAAG,QAAQ,CAAC,EAAE,CAAC,CAAC;IAElB,OAAO,EAAE,KAAK,CAAC,CAAC;AAClB,CAAC;AAED,SAAS,UAAU,CAAC,KAAiB,EAAE,IAAa;IAClD,EAAE;IACF,mEAAmE;IACnE,gEAAgE;IAChE,EAAE;IAEF,IAAI,GAAG,IAAI,IAAI,CAAC,CAAC;IACjB,MAAM,SAAS,GAAG,KAAK,CAAC,MAAM,GAAG,EAAE,CAAC;IACpC,MAAM,MAAM,GAAG,KAAK,CAAC,MAAM,GAAG,SAAS,CAAC;IAExC,IAAI,EAAE,GAAG,IAAI,CAAC;IACd,IAAI,EAAE,GAAG,IAAI,CAAC;IACd,IAAI,EAAE,GAAG,IAAI,CAAC;IACd,IAAI,EAAE,GAAG,IAAI,CAAC;IAEd,IAAI,EAAE,GAAG,CAAC,CAAC;IACX,IAAI,EAAE,GAAG,CAAC,CAAC;IACX,IAAI,EAAE,GAAG,CAAC,CAAC;IACX,IAAI,EAAE,GAAG,CAAC,CAAC;IAEX,MAAM,EAAE,GAAG,UAAU,CAAC;IACtB,MAAM,EAAE,GAAG,UAAU,CAAC;IACtB,MAAM,EAAE,GAAG,UAAU,CAAC;IACtB,MAAM,EAAE,GAAG,UAAU,CAAC;IACtB,IAAI,CAAC,GAAG,CAAC,CAAC;IAEV,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE,CAAC;QACvC,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC;QAClF,EAAE,GAAG,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC;QACtF,EAAE,GAAG,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,GAAG,EAAE,CAAC,IAAI,EAAE,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,GAAG,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC;QACxF,EAAE,GAAG,KAAK,CAAC,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,GAAG,EAAE,CAAC,IAAI,EAAE,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,GAAG,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC;QAE1F,EAAE,GAAG,YAAY,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QAC1B,EAAE,GAAG,QAAQ,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QACtB,EAAE,GAAG,YAAY,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QAC1B,EAAE,IAAI,EAAE,CAAC;QAET,EAAE,GAAG,QAAQ,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QACtB,EAAE,IAAI,EAAE,CAAC;QACT,EAAE,GAAG,YAAY,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,UAAU,CAAC;QAEtC,EAAE,GAAG,YAAY,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QAC1B,EAAE,GAAG,QAAQ,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QACtB,EAAE,GAAG,YAAY,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QAC1B,EAAE,IAAI,EAAE,CAAC;QAET,EAAE,GAAG,QAAQ,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QACtB,EAAE,IAAI,EAAE,CAAC;QACT,EAAE,GAAG,YAAY,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,UAAU,CAAC;QAEtC,EAAE,GAAG,YAAY,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QAC1B,EAAE,GAAG,QAAQ,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QACtB,EAAE,GAAG,YAAY,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QAC1B,EAAE,IAAI,EAAE,CAAC;QAET,EAAE,GAAG,QAAQ,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QACtB,EAAE,IAAI,EAAE,CAAC;QACT,EAAE,GAAG,YAAY,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,UAAU,CAAC;QAEtC,EAAE,GAAG,YAAY,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QAC1B,EAAE,GAAG,QAAQ,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QACtB,EAAE,GAAG,YAAY,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QAC1B,EAAE,IAAI,EAAE,CAAC;QAET,EAAE,GAAG,QAAQ,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QACtB,EAAE,IAAI,EAAE,CAAC;QACT,EAAE,GAAG,YAAY,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,UAAU,CAAC;QACtC,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC;IACb,CAAC;IAED,EAAE,GAAG,CAAC,CAAC;IACP,EAAE,GAAG,CAAC,CAAC;IACP,EAAE,GAAG,CAAC,CAAC;IACP,EAAE,GAAG,CAAC,CAAC;IAEP,QAAQ,SAAS,EAAE,CAAC;QAClB,KAAK,EAAE;YACL,EAAE,IAAI,KAAK,CAAC,CAAC,GAAG,EAAE,CAAC,IAAI,EAAE,CAAC;QAE5B,KAAK,EAAE;YACL,EAAE,IAAI,KAAK,CAAC,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,CAAC;QAE3B,KAAK,EAAE;YACL,EAAE,IAAI,KAAK,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC;YACpB,EAAE,GAAG,YAAY,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;YAC1B,EAAE,GAAG,QAAQ,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;YACtB,EAAE,GAAG,YAAY,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;YAC1B,EAAE,IAAI,EAAE,CAAC;QAEX,KAAK,EAAE;YACL,EAAE,IAAI,KAAK,CAAC,CAAC,GAAG,EAAE,CAAC,IAAI,EAAE,CAAC;QAE5B,KAAK,EAAE;YACL,EAAE,IAAI,KAAK,CAAC,CAAC,GAAG,EAAE,CAAC,IAAI,EAAE,CAAC;QAE5B,KAAK,EAAE;YACL,EAAE,IAAI,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC;QAE1B,KAAK,CAAC;YACJ,EAAE,IAAI,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YACnB,EAAE,GAAG,YAAY,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;YAC1B,EAAE,GAAG,QAAQ,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;YACtB,EAAE,GAAG,YAAY,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;YAC1B,EAAE,IAAI,EAAE,CAAC;QAEX,KAAK,CAAC;YACJ,EAAE,IAAI,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC;QAE3B,KAAK,CAAC;YACJ,EAAE,IAAI,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC;QAE3B,KAAK,CAAC;YACJ,EAAE,IAAI,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC;QAE1B,KAAK,CAAC;YACJ,EAAE,IAAI,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YACnB,EAAE,GAAG,YAAY,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;YAC1B,EAAE,GAAG,QAAQ,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;YACtB,EAAE,GAAG,YAAY,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;YAC1B,EAAE,IAAI,EAAE,CAAC;QAEX,KAAK,CAAC;YACJ,EAAE,IAAI,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC;QAE3B,KAAK,CAAC;YACJ,EAAE,IAAI,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC;QAE3B,KAAK,CAAC;YACJ,EAAE,IAAI,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC;QAE1B,KAAK,CAAC;YACJ,EAAE,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC;YACf,EAAE,GAAG,YAAY,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;YAC1B,EAAE,GAAG,QAAQ,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;YACtB,EAAE,GAAG,YAAY,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;YAC1B,EAAE,IAAI,EAAE,CAAC;IACb,CAAC;IAED,EAAE,IAAI,KAAK,CAAC,MAAM,CAAC;IACnB,EAAE,IAAI,KAAK,CAAC,MAAM,CAAC;IACnB,EAAE,IAAI,KAAK,CAAC,MAAM,CAAC;IACnB,EAAE,IAAI,KAAK,CAAC,MAAM,CAAC;IAEnB,EAAE,IAAI,EAAE,CAAC;IACT,EAAE,IAAI,EAAE,CAAC;IACT,EAAE,IAAI,EAAE,CAAC;IACT,EAAE,IAAI,EAAE,CAAC;IACT,EAAE,IAAI,EAAE,CAAC;IACT,EAAE,IAAI,EAAE,CAAC;IAET,EAAE,GAAG,QAAQ,CAAC,EAAE,CAAC,CAAC;IAClB,EAAE,GAAG,QAAQ,CAAC,EAAE,CAAC,CAAC;IAClB,EAAE,GAAG,QAAQ,CAAC,EAAE,CAAC,CAAC;IAClB,EAAE,GAAG,QAAQ,CAAC,EAAE,CAAC,CAAC;IAElB,EAAE,IAAI,EAAE,CAAC;IACT,EAAE,IAAI,EAAE,CAAC;IACT,EAAE,IAAI,EAAE,CAAC;IACT,EAAE,IAAI,EAAE,CAAC;IACT,EAAE,IAAI,EAAE,CAAC;IACT,EAAE,IAAI,EAAE,CAAC;IAET,OAAO,CACL,CAAC,UAAU,GAAG,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QAChD,CAAC,UAAU,GAAG,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QAChD,CAAC,UAAU,GAAG,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QAChD,CAAC,UAAU,GAAG,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CACjD,CAAC;AACJ,CAAC;AAED,SAAS,UAAU,CAAC,KAAiB,EAAE,IAAa;IAClD,EAAE;IACF,mEAAmE;IACnE,gEAAgE;IAChE,EAAE;IACF,IAAI,GAAG,IAAI,IAAI,CAAC,CAAC;IAEjB,MAAM,SAAS,GAAG,KAAK,CAAC,MAAM,GAAG,EAAE,CAAC;IACpC,MAAM,MAAM,GAAG,KAAK,CAAC,MAAM,GAAG,SAAS,CAAC;IAExC,IAAI,EAAE,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;IACnB,IAAI,EAAE,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;IAEnB,IAAI,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAChB,IAAI,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAEhB,MAAM,EAAE,GAAG,CAAC,UAAU,EAAE,UAAU,CAAC,CAAC;IACpC,MAAM,EAAE,GAAG,CAAC,UAAU,EAAE,UAAU,CAAC,CAAC;IACpC,IAAI,CAAC,GAAG,CAAC,CAAC;IAEV,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE,CAAC;QACvC,EAAE,GAAG;YACH,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC;YAChF,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC;SAC7E,CAAC;QACF,EAAE,GAAG;YACH,KAAK,CAAC,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,GAAG,EAAE,CAAC,IAAI,EAAE,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,GAAG,EAAE,CAAC,IAAI,EAAE,CAAC;YACpF,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,GAAG,EAAE,CAAC,IAAI,EAAE,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,GAAG,EAAE,CAAC,IAAI,EAAE,CAAC;SACnF,CAAC;QAEF,EAAE,GAAG,YAAY,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QAC1B,EAAE,GAAG,QAAQ,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QACtB,EAAE,GAAG,YAAY,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QAC1B,EAAE,GAAG,OAAO,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QAErB,EAAE,GAAG,QAAQ,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QACtB,EAAE,GAAG,OAAO,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QACrB,EAAE,GAAG,OAAO,CAAC,YAAY,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC,CAAC;QAExD,EAAE,GAAG,YAAY,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QAC1B,EAAE,GAAG,QAAQ,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QACtB,EAAE,GAAG,YAAY,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QAC1B,EAAE,GAAG,OAAO,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QAErB,EAAE,GAAG,QAAQ,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QACtB,EAAE,GAAG,OAAO,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QACrB,EAAE,GAAG,OAAO,CAAC,YAAY,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC,CAAC;QACxD,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC;IACb,CAAC;IAED,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACZ,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAEZ,QAAQ,SAAS,EAAE,CAAC;QAClB,KAAK,EAAE;YACL,EAAE,GAAG,OAAO,CAAC,EAAE,EAAE,aAAa,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;QAE1D,KAAK,EAAE;YACL,EAAE,GAAG,OAAO,CAAC,EAAE,EAAE,aAAa,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;QAE1D,KAAK,EAAE;YACL,EAAE,GAAG,OAAO,CAAC,EAAE,EAAE,aAAa,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;QAE1D,KAAK,EAAE;YACL,EAAE,GAAG,OAAO,CAAC,EAAE,EAAE,aAAa,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;QAE1D,KAAK,EAAE;YACL,EAAE,GAAG,OAAO,CAAC,EAAE,EAAE,aAAa,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;QAE1D,KAAK,EAAE;YACL,EAAE,GAAG,OAAO,CAAC,EAAE,EAAE,aAAa,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAExD,KAAK,CAAC;YACJ,EAAE,GAAG,OAAO,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YACpC,EAAE,GAAG,YAAY,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;YAC1B,EAAE,GAAG,QAAQ,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;YACtB,EAAE,GAAG,YAAY,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;YAC1B,EAAE,GAAG,OAAO,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QAEvB,KAAK,CAAC;YACJ,EAAE,GAAG,OAAO,CAAC,EAAE,EAAE,aAAa,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;QAEzD,KAAK,CAAC;YACJ,EAAE,GAAG,OAAO,CAAC,EAAE,EAAE,aAAa,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;QAEzD,KAAK,CAAC;YACJ,EAAE,GAAG,OAAO,CAAC,EAAE,EAAE,aAAa,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;QAEzD,KAAK,CAAC;YACJ,EAAE,GAAG,OAAO,CAAC,EAAE,EAAE,aAAa,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;QAEzD,KAAK,CAAC;YACJ,EAAE,GAAG,OAAO,CAAC,EAAE,EAAE,aAAa,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;QAEzD,KAAK,CAAC;YACJ,EAAE,GAAG,OAAO,CAAC,EAAE,EAAE,aAAa,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;QAEzD,KAAK,CAAC;YACJ,EAAE,GAAG,OAAO,CAAC,EAAE,EAAE,aAAa,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAExD,KAAK,CAAC;YACJ,EAAE,GAAG,OAAO,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAChC,EAAE,GAAG,YAAY,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;YAC1B,EAAE,GAAG,QAAQ,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;YACtB,EAAE,GAAG,YAAY,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;YAC1B,EAAE,GAAG,OAAO,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;IACzB,CAAC;IAED,EAAE,GAAG,OAAO,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC;IACpC,EAAE,GAAG,OAAO,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC;IAEpC,EAAE,GAAG,OAAO,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;IACrB,EAAE,GAAG,OAAO,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;IAErB,EAAE,GAAG,QAAQ,CAAC,EAAE,CAAC,CAAC;IAClB,EAAE,GAAG,QAAQ,CAAC,EAAE,CAAC,CAAC;IAElB,EAAE,GAAG,OAAO,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;IACrB,EAAE,GAAG,OAAO,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;IAErB,sCAAsC;IACtC,mEAAmE;IACnE,mDAAmD;IACnD,MAAM,KAAK,GACT,CAAC,UAAU,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QACnD,CAAC,UAAU,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;IACtD,MAAM,MAAM,GAAG,IAAA,gCAAqB,EAAC,KAAK,CAAC,CAAC;IAC5C,MAAM,UAAU,GAAG,IAAA,0BAAe,EAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC;IAEpD,MAAM,KAAK,GACT,CAAC,UAAU,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QACnD,CAAC,UAAU,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;IACtD,MAAM,MAAM,GAAG,IAAA,gCAAqB,EAAC,KAAK,CAAC,CAAC;IAC5C,MAAM,UAAU,GAAG,IAAA,0BAAe,EAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC;IACpD,OAAO,UAAU,GAAG,UAAU,CAAC;AACjC,CAAC;AAED,SAAgB,OAAO,CAAC,IAAgB;IACtC,MAAM,UAAU,GAAG,IAAI,UAAU,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IAE/C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC;QACtD,UAAU,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;QACxB,UAAU,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;IAC1B,CAAC;IACD,OAAO,UAAU,CAAC;AACpB,CAAC;AAED,kBAAe;IACb,OAAO,EAAE,OAAO;IAChB,GAAG,EAAE;QACH,MAAM,EAAE,SAAS;QACjB,OAAO,EAAE,UAAU;KACpB;IACD,GAAG,EAAE;QACH,OAAO,EAAE,UAAU;KACpB;IACD,eAAe,EAAE,IAAI;CACtB,CAAC","sourcesContent":["// +----------------------------------------------------------------------+\n// | murmurHash3js.js v3.0.1 // https://github.com/pid/murmurHash3js\n// | A javascript implementation of MurmurHash3's x86 hashing algorithms. |\n// |----------------------------------------------------------------------|\n// | Copyright (c) 2012-2015 Karan Lyons                                       |\n// | https://github.com/karanlyons/murmurHash3.js/blob/c1778f75792abef7bdd74bc85d2d4e1a3d25cfe9/murmurHash3.js |\n// | Freely distributable under the MIT license.                          |\n// +----------------------------------------------------------------------+\n\n// PRIVATE FUNCTIONS\n// -----------------\nimport { hexStringToUint8Array, uint8ArrayToHex } from \"../uint8.js\";\nfunction _x86Multiply(m: number, n: number) {\n  //\n  // Given two 32bit ints, returns the two multiplied together as a\n  // 32bit int.\n  //\n\n  return (m & 0xffff) * n + ((((m >>> 16) * n) & 0xffff) << 16);\n}\n\nfunction _x86Rotl(m: number, n: number) {\n  //\n  // Given a 32bit int and an int representing a number of bit positions,\n  // returns the 32bit int rotated left by that number of positions.\n  //\n\n  return (m << n) | (m >>> (32 - n));\n}\n\nfunction _x86Fmix(h: number) {\n  //\n  // Given a block, returns murmurHash3's final x86 mix of that block.\n  //\n\n  h ^= h >>> 16;\n  h = _x86Multiply(h, 0x85ebca6b);\n  h ^= h >>> 13;\n  h = _x86Multiply(h, 0xc2b2ae35);\n  h ^= h >>> 16;\n\n  return h;\n}\n\nfunction _x64Add(m: number[], n: number[]) {\n  //\n  // Given two 64bit ints (as an array of two 32bit ints) returns the two\n  // added together as a 64bit int (as an array of two 32bit ints).\n  //\n\n  m = [m[0] >>> 16, m[0] & 0xffff, m[1] >>> 16, m[1] & 0xffff];\n  n = [n[0] >>> 16, n[0] & 0xffff, n[1] >>> 16, n[1] & 0xffff];\n  const o = [0, 0, 0, 0];\n\n  o[3] += m[3] + n[3];\n  o[2] += o[3] >>> 16;\n  o[3] &= 0xffff;\n\n  o[2] += m[2] + n[2];\n  o[1] += o[2] >>> 16;\n  o[2] &= 0xffff;\n\n  o[1] += m[1] + n[1];\n  o[0] += o[1] >>> 16;\n  o[1] &= 0xffff;\n\n  o[0] += m[0] + n[0];\n  o[0] &= 0xffff;\n\n  return [(o[0] << 16) | o[1], (o[2] << 16) | o[3]];\n}\n\nfunction _x64Multiply(m: number[], n: number[]) {\n  //\n  // Given two 64bit ints (as an array of two 32bit ints) returns the two\n  // multiplied together as a 64bit int (as an array of two 32bit ints).\n  //\n\n  m = [m[0] >>> 16, m[0] & 0xffff, m[1] >>> 16, m[1] & 0xffff];\n  n = [n[0] >>> 16, n[0] & 0xffff, n[1] >>> 16, n[1] & 0xffff];\n  const o = [0, 0, 0, 0];\n\n  o[3] += m[3] * n[3];\n  o[2] += o[3] >>> 16;\n  o[3] &= 0xffff;\n\n  o[2] += m[2] * n[3];\n  o[1] += o[2] >>> 16;\n  o[2] &= 0xffff;\n\n  o[2] += m[3] * n[2];\n  o[1] += o[2] >>> 16;\n  o[2] &= 0xffff;\n\n  o[1] += m[1] * n[3];\n  o[0] += o[1] >>> 16;\n  o[1] &= 0xffff;\n\n  o[1] += m[2] * n[2];\n  o[0] += o[1] >>> 16;\n  o[1] &= 0xffff;\n\n  o[1] += m[3] * n[1];\n  o[0] += o[1] >>> 16;\n  o[1] &= 0xffff;\n\n  o[0] += m[0] * n[3] + m[1] * n[2] + m[2] * n[1] + m[3] * n[0];\n  o[0] &= 0xffff;\n\n  return [(o[0] << 16) | o[1], (o[2] << 16) | o[3]];\n}\n\nfunction _x64Rotl(m: number[], n: number) {\n  //\n  // Given a 64bit int (as an array of two 32bit ints) and an int\n  // representing a number of bit positions, returns the 64bit int (as an\n  // array of two 32bit ints) rotated left by that number of positions.\n  //\n\n  n %= 64;\n\n  if (n === 32) {\n    return [m[1], m[0]];\n  } else if (n < 32) {\n    return [(m[0] << n) | (m[1] >>> (32 - n)), (m[1] << n) | (m[0] >>> (32 - n))];\n  } else {\n    n -= 32;\n    return [(m[1] << n) | (m[0] >>> (32 - n)), (m[0] << n) | (m[1] >>> (32 - n))];\n  }\n}\n\nfunction _x64LeftShift(m: number[], n: number) {\n  //\n  // Given a 64bit int (as an array of two 32bit ints) and an int\n  // representing a number of bit positions, returns the 64bit int (as an\n  // array of two 32bit ints) shifted left by that number of positions.\n  //\n\n  n %= 64;\n\n  if (n === 0) {\n    return m;\n  } else if (n < 32) {\n    return [(m[0] << n) | (m[1] >>> (32 - n)), m[1] << n];\n  } else {\n    return [m[1] << (n - 32), 0];\n  }\n}\n\nfunction _x64Xor(m: number[], n: number[]) {\n  //\n  // Given two 64bit ints (as an array of two 32bit ints) returns the two\n  // xored together as a 64bit int (as an array of two 32bit ints).\n  //\n\n  return [m[0] ^ n[0], m[1] ^ n[1]];\n}\n\nfunction _x64Fmix(h: number[]) {\n  //\n  // Given a block, returns murmurHash3's final x64 mix of that block.\n  // (`[0, h[0] >>> 1]` is a 33 bit unsigned right shift. This is the\n  // only place where we need to right shift 64bit ints.)\n  //\n\n  h = _x64Xor(h, [0, h[0] >>> 1]);\n  h = _x64Multiply(h, [0xff51afd7, 0xed558ccd]);\n  h = _x64Xor(h, [0, h[0] >>> 1]);\n  h = _x64Multiply(h, [0xc4ceb9fe, 0x1a85ec53]);\n  h = _x64Xor(h, [0, h[0] >>> 1]);\n\n  return h;\n}\n\n// PUBLIC FUNCTIONS\n// ----------------\n\nfunction x86Hash32(bytes: Uint8Array, seed?: number) {\n  //\n  // Given a string and an optional seed as an int, returns a 32 bit hash\n  // using the x86 flavor of MurmurHash3, as an unsigned int.\n  //\n  seed = seed || 0;\n\n  const remainder = bytes.length % 4;\n  const blocks = bytes.length - remainder;\n\n  let h1 = seed;\n\n  let k1 = 0;\n\n  const c1 = 0xcc9e2d51;\n  const c2 = 0x1b873593;\n  let j = 0;\n\n  for (let i = 0; i < blocks; i = i + 4) {\n    k1 = bytes[i] | (bytes[i + 1] << 8) | (bytes[i + 2] << 16) | (bytes[i + 3] << 24);\n\n    k1 = _x86Multiply(k1, c1);\n    k1 = _x86Rotl(k1, 15);\n    k1 = _x86Multiply(k1, c2);\n\n    h1 ^= k1;\n    h1 = _x86Rotl(h1, 13);\n    h1 = _x86Multiply(h1, 5) + 0xe6546b64;\n    j = i + 4;\n  }\n\n  k1 = 0;\n\n  switch (remainder) {\n    case 3:\n      k1 ^= bytes[j + 2] << 16;\n\n    case 2:\n      k1 ^= bytes[j + 1] << 8;\n\n    case 1:\n      k1 ^= bytes[j];\n      k1 = _x86Multiply(k1, c1);\n      k1 = _x86Rotl(k1, 15);\n      k1 = _x86Multiply(k1, c2);\n      h1 ^= k1;\n  }\n\n  h1 ^= bytes.length;\n  h1 = _x86Fmix(h1);\n\n  return h1 >>> 0;\n}\n\nfunction x86Hash128(bytes: Uint8Array, seed?: number) {\n  //\n  // Given a string and an optional seed as an int, returns a 128 bit\n  // hash using the x86 flavor of MurmurHash3, as an unsigned hex.\n  //\n\n  seed = seed || 0;\n  const remainder = bytes.length % 16;\n  const blocks = bytes.length - remainder;\n\n  let h1 = seed;\n  let h2 = seed;\n  let h3 = seed;\n  let h4 = seed;\n\n  let k1 = 0;\n  let k2 = 0;\n  let k3 = 0;\n  let k4 = 0;\n\n  const c1 = 0x239b961b;\n  const c2 = 0xab0e9789;\n  const c3 = 0x38b34ae5;\n  const c4 = 0xa1e38b93;\n  let j = 0;\n\n  for (let i = 0; i < blocks; i = i + 16) {\n    k1 = bytes[i] | (bytes[i + 1] << 8) | (bytes[i + 2] << 16) | (bytes[i + 3] << 24);\n    k2 = bytes[i + 4] | (bytes[i + 5] << 8) | (bytes[i + 6] << 16) | (bytes[i + 7] << 24);\n    k3 = bytes[i + 8] | (bytes[i + 9] << 8) | (bytes[i + 10] << 16) | (bytes[i + 11] << 24);\n    k4 = bytes[i + 12] | (bytes[i + 13] << 8) | (bytes[i + 14] << 16) | (bytes[i + 15] << 24);\n\n    k1 = _x86Multiply(k1, c1);\n    k1 = _x86Rotl(k1, 15);\n    k1 = _x86Multiply(k1, c2);\n    h1 ^= k1;\n\n    h1 = _x86Rotl(h1, 19);\n    h1 += h2;\n    h1 = _x86Multiply(h1, 5) + 0x561ccd1b;\n\n    k2 = _x86Multiply(k2, c2);\n    k2 = _x86Rotl(k2, 16);\n    k2 = _x86Multiply(k2, c3);\n    h2 ^= k2;\n\n    h2 = _x86Rotl(h2, 17);\n    h2 += h3;\n    h2 = _x86Multiply(h2, 5) + 0x0bcaa747;\n\n    k3 = _x86Multiply(k3, c3);\n    k3 = _x86Rotl(k3, 17);\n    k3 = _x86Multiply(k3, c4);\n    h3 ^= k3;\n\n    h3 = _x86Rotl(h3, 15);\n    h3 += h4;\n    h3 = _x86Multiply(h3, 5) + 0x96cd1c35;\n\n    k4 = _x86Multiply(k4, c4);\n    k4 = _x86Rotl(k4, 18);\n    k4 = _x86Multiply(k4, c1);\n    h4 ^= k4;\n\n    h4 = _x86Rotl(h4, 13);\n    h4 += h1;\n    h4 = _x86Multiply(h4, 5) + 0x32ac3b17;\n    j = i + 16;\n  }\n\n  k1 = 0;\n  k2 = 0;\n  k3 = 0;\n  k4 = 0;\n\n  switch (remainder) {\n    case 15:\n      k4 ^= bytes[j + 14] << 16;\n\n    case 14:\n      k4 ^= bytes[j + 13] << 8;\n\n    case 13:\n      k4 ^= bytes[j + 12];\n      k4 = _x86Multiply(k4, c4);\n      k4 = _x86Rotl(k4, 18);\n      k4 = _x86Multiply(k4, c1);\n      h4 ^= k4;\n\n    case 12:\n      k3 ^= bytes[j + 11] << 24;\n\n    case 11:\n      k3 ^= bytes[j + 10] << 16;\n\n    case 10:\n      k3 ^= bytes[j + 9] << 8;\n\n    case 9:\n      k3 ^= bytes[j + 8];\n      k3 = _x86Multiply(k3, c3);\n      k3 = _x86Rotl(k3, 17);\n      k3 = _x86Multiply(k3, c4);\n      h3 ^= k3;\n\n    case 8:\n      k2 ^= bytes[j + 7] << 24;\n\n    case 7:\n      k2 ^= bytes[j + 6] << 16;\n\n    case 6:\n      k2 ^= bytes[j + 5] << 8;\n\n    case 5:\n      k2 ^= bytes[j + 4];\n      k2 = _x86Multiply(k2, c2);\n      k2 = _x86Rotl(k2, 16);\n      k2 = _x86Multiply(k2, c3);\n      h2 ^= k2;\n\n    case 4:\n      k1 ^= bytes[j + 3] << 24;\n\n    case 3:\n      k1 ^= bytes[j + 2] << 16;\n\n    case 2:\n      k1 ^= bytes[j + 1] << 8;\n\n    case 1:\n      k1 ^= bytes[j];\n      k1 = _x86Multiply(k1, c1);\n      k1 = _x86Rotl(k1, 15);\n      k1 = _x86Multiply(k1, c2);\n      h1 ^= k1;\n  }\n\n  h1 ^= bytes.length;\n  h2 ^= bytes.length;\n  h3 ^= bytes.length;\n  h4 ^= bytes.length;\n\n  h1 += h2;\n  h1 += h3;\n  h1 += h4;\n  h2 += h1;\n  h3 += h1;\n  h4 += h1;\n\n  h1 = _x86Fmix(h1);\n  h2 = _x86Fmix(h2);\n  h3 = _x86Fmix(h3);\n  h4 = _x86Fmix(h4);\n\n  h1 += h2;\n  h1 += h3;\n  h1 += h4;\n  h2 += h1;\n  h3 += h1;\n  h4 += h1;\n\n  return (\n    (\"00000000\" + (h1 >>> 0).toString(16)).slice(-8) +\n    (\"00000000\" + (h2 >>> 0).toString(16)).slice(-8) +\n    (\"00000000\" + (h3 >>> 0).toString(16)).slice(-8) +\n    (\"00000000\" + (h4 >>> 0).toString(16)).slice(-8)\n  );\n}\n\nfunction x64Hash128(bytes: Uint8Array, seed?: number) {\n  //\n  // Given a string and an optional seed as an int, returns a 128 bit\n  // hash using the x64 flavor of MurmurHash3, as an unsigned hex.\n  //\n  seed = seed || 0;\n\n  const remainder = bytes.length % 16;\n  const blocks = bytes.length - remainder;\n\n  let h1 = [0, seed];\n  let h2 = [0, seed];\n\n  let k1 = [0, 0];\n  let k2 = [0, 0];\n\n  const c1 = [0x87c37b91, 0x114253d5];\n  const c2 = [0x4cf5ad43, 0x2745937f];\n  let j = 0;\n\n  for (let i = 0; i < blocks; i = i + 16) {\n    k1 = [\n      bytes[i + 4] | (bytes[i + 5] << 8) | (bytes[i + 6] << 16) | (bytes[i + 7] << 24),\n      bytes[i] | (bytes[i + 1] << 8) | (bytes[i + 2] << 16) | (bytes[i + 3] << 24),\n    ];\n    k2 = [\n      bytes[i + 12] | (bytes[i + 13] << 8) | (bytes[i + 14] << 16) | (bytes[i + 15] << 24),\n      bytes[i + 8] | (bytes[i + 9] << 8) | (bytes[i + 10] << 16) | (bytes[i + 11] << 24),\n    ];\n\n    k1 = _x64Multiply(k1, c1);\n    k1 = _x64Rotl(k1, 31);\n    k1 = _x64Multiply(k1, c2);\n    h1 = _x64Xor(h1, k1);\n\n    h1 = _x64Rotl(h1, 27);\n    h1 = _x64Add(h1, h2);\n    h1 = _x64Add(_x64Multiply(h1, [0, 5]), [0, 0x52dce729]);\n\n    k2 = _x64Multiply(k2, c2);\n    k2 = _x64Rotl(k2, 33);\n    k2 = _x64Multiply(k2, c1);\n    h2 = _x64Xor(h2, k2);\n\n    h2 = _x64Rotl(h2, 31);\n    h2 = _x64Add(h2, h1);\n    h2 = _x64Add(_x64Multiply(h2, [0, 5]), [0, 0x38495ab5]);\n    j = i + 16;\n  }\n\n  k1 = [0, 0];\n  k2 = [0, 0];\n\n  switch (remainder) {\n    case 15:\n      k2 = _x64Xor(k2, _x64LeftShift([0, bytes[j + 14]], 48));\n\n    case 14:\n      k2 = _x64Xor(k2, _x64LeftShift([0, bytes[j + 13]], 40));\n\n    case 13:\n      k2 = _x64Xor(k2, _x64LeftShift([0, bytes[j + 12]], 32));\n\n    case 12:\n      k2 = _x64Xor(k2, _x64LeftShift([0, bytes[j + 11]], 24));\n\n    case 11:\n      k2 = _x64Xor(k2, _x64LeftShift([0, bytes[j + 10]], 16));\n\n    case 10:\n      k2 = _x64Xor(k2, _x64LeftShift([0, bytes[j + 9]], 8));\n\n    case 9:\n      k2 = _x64Xor(k2, [0, bytes[j + 8]]);\n      k2 = _x64Multiply(k2, c2);\n      k2 = _x64Rotl(k2, 33);\n      k2 = _x64Multiply(k2, c1);\n      h2 = _x64Xor(h2, k2);\n\n    case 8:\n      k1 = _x64Xor(k1, _x64LeftShift([0, bytes[j + 7]], 56));\n\n    case 7:\n      k1 = _x64Xor(k1, _x64LeftShift([0, bytes[j + 6]], 48));\n\n    case 6:\n      k1 = _x64Xor(k1, _x64LeftShift([0, bytes[j + 5]], 40));\n\n    case 5:\n      k1 = _x64Xor(k1, _x64LeftShift([0, bytes[j + 4]], 32));\n\n    case 4:\n      k1 = _x64Xor(k1, _x64LeftShift([0, bytes[j + 3]], 24));\n\n    case 3:\n      k1 = _x64Xor(k1, _x64LeftShift([0, bytes[j + 2]], 16));\n\n    case 2:\n      k1 = _x64Xor(k1, _x64LeftShift([0, bytes[j + 1]], 8));\n\n    case 1:\n      k1 = _x64Xor(k1, [0, bytes[j]]);\n      k1 = _x64Multiply(k1, c1);\n      k1 = _x64Rotl(k1, 31);\n      k1 = _x64Multiply(k1, c2);\n      h1 = _x64Xor(h1, k1);\n  }\n\n  h1 = _x64Xor(h1, [0, bytes.length]);\n  h2 = _x64Xor(h2, [0, bytes.length]);\n\n  h1 = _x64Add(h1, h2);\n  h2 = _x64Add(h2, h1);\n\n  h1 = _x64Fmix(h1);\n  h2 = _x64Fmix(h2);\n\n  h1 = _x64Add(h1, h2);\n  h2 = _x64Add(h2, h1);\n\n  // Here we reverse h1 and h2 in Cosmos\n  // This is an implementation detail and not part of the public spec\n  // Convert h1 to hex string and then to Uint8Array.\n  const h1Hex =\n    (\"00000000\" + (h1[0] >>> 0).toString(16)).slice(-8) +\n    (\"00000000\" + (h1[1] >>> 0).toString(16)).slice(-8);\n  const h1Buff = hexStringToUint8Array(h1Hex);\n  const h1Reversed = uint8ArrayToHex(reverse(h1Buff));\n\n  const h2Hex =\n    (\"00000000\" + (h2[0] >>> 0).toString(16)).slice(-8) +\n    (\"00000000\" + (h2[1] >>> 0).toString(16)).slice(-8);\n  const h2Buff = hexStringToUint8Array(h2Hex);\n  const h2Reversed = uint8ArrayToHex(reverse(h2Buff));\n  return h1Reversed + h2Reversed;\n}\n\nexport function reverse(buff: Uint8Array) {\n  const uint8array = new Uint8Array(buff.length);\n\n  for (let i = 0, j = buff.length - 1; i <= j; ++i, --j) {\n    uint8array[i] = buff[j];\n    uint8array[j] = buff[i];\n  }\n  return uint8array;\n}\n\nexport default {\n  version: \"3.0.0\",\n  x86: {\n    hash32: x86Hash32,\n    hash128: x86Hash128,\n  },\n  x64: {\n    hash128: x64Hash128,\n  },\n  inputValidation: true,\n};\n"]}
+{
+  "version": 3,
+  "sources": ["/mnt/vss/_work/1/s/sdk/cosmosdb/cosmos/src/utils/hashing/murmurHash.ts"],
+  "sourcesContent": ["// +----------------------------------------------------------------------+\n// | murmurHash3js.js v3.0.1 // https://github.com/pid/murmurHash3js\n// | A javascript implementation of MurmurHash3's x86 hashing algorithms. |\n// |----------------------------------------------------------------------|\n// | Copyright (c) 2012-2015 Karan Lyons                                       |\n// | https://github.com/karanlyons/murmurHash3.js/blob/c1778f75792abef7bdd74bc85d2d4e1a3d25cfe9/murmurHash3.js |\n// | Freely distributable under the MIT license.                          |\n// +----------------------------------------------------------------------+\n\n// PRIVATE FUNCTIONS\n// -----------------\nimport { hexStringToUint8Array, uint8ArrayToHex } from \"../uint8.js\";\nfunction _x86Multiply(m: number, n: number) {\n  //\n  // Given two 32bit ints, returns the two multiplied together as a\n  // 32bit int.\n  //\n\n  return (m & 0xffff) * n + ((((m >>> 16) * n) & 0xffff) << 16);\n}\n\nfunction _x86Rotl(m: number, n: number) {\n  //\n  // Given a 32bit int and an int representing a number of bit positions,\n  // returns the 32bit int rotated left by that number of positions.\n  //\n\n  return (m << n) | (m >>> (32 - n));\n}\n\nfunction _x86Fmix(h: number) {\n  //\n  // Given a block, returns murmurHash3's final x86 mix of that block.\n  //\n\n  h ^= h >>> 16;\n  h = _x86Multiply(h, 0x85ebca6b);\n  h ^= h >>> 13;\n  h = _x86Multiply(h, 0xc2b2ae35);\n  h ^= h >>> 16;\n\n  return h;\n}\n\nfunction _x64Add(m: number[], n: number[]) {\n  //\n  // Given two 64bit ints (as an array of two 32bit ints) returns the two\n  // added together as a 64bit int (as an array of two 32bit ints).\n  //\n\n  m = [m[0] >>> 16, m[0] & 0xffff, m[1] >>> 16, m[1] & 0xffff];\n  n = [n[0] >>> 16, n[0] & 0xffff, n[1] >>> 16, n[1] & 0xffff];\n  const o = [0, 0, 0, 0];\n\n  o[3] += m[3] + n[3];\n  o[2] += o[3] >>> 16;\n  o[3] &= 0xffff;\n\n  o[2] += m[2] + n[2];\n  o[1] += o[2] >>> 16;\n  o[2] &= 0xffff;\n\n  o[1] += m[1] + n[1];\n  o[0] += o[1] >>> 16;\n  o[1] &= 0xffff;\n\n  o[0] += m[0] + n[0];\n  o[0] &= 0xffff;\n\n  return [(o[0] << 16) | o[1], (o[2] << 16) | o[3]];\n}\n\nfunction _x64Multiply(m: number[], n: number[]) {\n  //\n  // Given two 64bit ints (as an array of two 32bit ints) returns the two\n  // multiplied together as a 64bit int (as an array of two 32bit ints).\n  //\n\n  m = [m[0] >>> 16, m[0] & 0xffff, m[1] >>> 16, m[1] & 0xffff];\n  n = [n[0] >>> 16, n[0] & 0xffff, n[1] >>> 16, n[1] & 0xffff];\n  const o = [0, 0, 0, 0];\n\n  o[3] += m[3] * n[3];\n  o[2] += o[3] >>> 16;\n  o[3] &= 0xffff;\n\n  o[2] += m[2] * n[3];\n  o[1] += o[2] >>> 16;\n  o[2] &= 0xffff;\n\n  o[2] += m[3] * n[2];\n  o[1] += o[2] >>> 16;\n  o[2] &= 0xffff;\n\n  o[1] += m[1] * n[3];\n  o[0] += o[1] >>> 16;\n  o[1] &= 0xffff;\n\n  o[1] += m[2] * n[2];\n  o[0] += o[1] >>> 16;\n  o[1] &= 0xffff;\n\n  o[1] += m[3] * n[1];\n  o[0] += o[1] >>> 16;\n  o[1] &= 0xffff;\n\n  o[0] += m[0] * n[3] + m[1] * n[2] + m[2] * n[1] + m[3] * n[0];\n  o[0] &= 0xffff;\n\n  return [(o[0] << 16) | o[1], (o[2] << 16) | o[3]];\n}\n\nfunction _x64Rotl(m: number[], n: number) {\n  //\n  // Given a 64bit int (as an array of two 32bit ints) and an int\n  // representing a number of bit positions, returns the 64bit int (as an\n  // array of two 32bit ints) rotated left by that number of positions.\n  //\n\n  n %= 64;\n\n  if (n === 32) {\n    return [m[1], m[0]];\n  } else if (n < 32) {\n    return [(m[0] << n) | (m[1] >>> (32 - n)), (m[1] << n) | (m[0] >>> (32 - n))];\n  } else {\n    n -= 32;\n    return [(m[1] << n) | (m[0] >>> (32 - n)), (m[0] << n) | (m[1] >>> (32 - n))];\n  }\n}\n\nfunction _x64LeftShift(m: number[], n: number) {\n  //\n  // Given a 64bit int (as an array of two 32bit ints) and an int\n  // representing a number of bit positions, returns the 64bit int (as an\n  // array of two 32bit ints) shifted left by that number of positions.\n  //\n\n  n %= 64;\n\n  if (n === 0) {\n    return m;\n  } else if (n < 32) {\n    return [(m[0] << n) | (m[1] >>> (32 - n)), m[1] << n];\n  } else {\n    return [m[1] << (n - 32), 0];\n  }\n}\n\nfunction _x64Xor(m: number[], n: number[]) {\n  //\n  // Given two 64bit ints (as an array of two 32bit ints) returns the two\n  // xored together as a 64bit int (as an array of two 32bit ints).\n  //\n\n  return [m[0] ^ n[0], m[1] ^ n[1]];\n}\n\nfunction _x64Fmix(h: number[]) {\n  //\n  // Given a block, returns murmurHash3's final x64 mix of that block.\n  // (`[0, h[0] >>> 1]` is a 33 bit unsigned right shift. This is the\n  // only place where we need to right shift 64bit ints.)\n  //\n\n  h = _x64Xor(h, [0, h[0] >>> 1]);\n  h = _x64Multiply(h, [0xff51afd7, 0xed558ccd]);\n  h = _x64Xor(h, [0, h[0] >>> 1]);\n  h = _x64Multiply(h, [0xc4ceb9fe, 0x1a85ec53]);\n  h = _x64Xor(h, [0, h[0] >>> 1]);\n\n  return h;\n}\n\n// PUBLIC FUNCTIONS\n// ----------------\n\nfunction x86Hash32(bytes: Uint8Array, seed?: number) {\n  //\n  // Given a string and an optional seed as an int, returns a 32 bit hash\n  // using the x86 flavor of MurmurHash3, as an unsigned int.\n  //\n  seed = seed || 0;\n\n  const remainder = bytes.length % 4;\n  const blocks = bytes.length - remainder;\n\n  let h1 = seed;\n\n  let k1 = 0;\n\n  const c1 = 0xcc9e2d51;\n  const c2 = 0x1b873593;\n  let j = 0;\n\n  for (let i = 0; i < blocks; i = i + 4) {\n    k1 = bytes[i] | (bytes[i + 1] << 8) | (bytes[i + 2] << 16) | (bytes[i + 3] << 24);\n\n    k1 = _x86Multiply(k1, c1);\n    k1 = _x86Rotl(k1, 15);\n    k1 = _x86Multiply(k1, c2);\n\n    h1 ^= k1;\n    h1 = _x86Rotl(h1, 13);\n    h1 = _x86Multiply(h1, 5) + 0xe6546b64;\n    j = i + 4;\n  }\n\n  k1 = 0;\n\n  switch (remainder) {\n    case 3:\n      k1 ^= bytes[j + 2] << 16;\n\n    case 2:\n      k1 ^= bytes[j + 1] << 8;\n\n    case 1:\n      k1 ^= bytes[j];\n      k1 = _x86Multiply(k1, c1);\n      k1 = _x86Rotl(k1, 15);\n      k1 = _x86Multiply(k1, c2);\n      h1 ^= k1;\n  }\n\n  h1 ^= bytes.length;\n  h1 = _x86Fmix(h1);\n\n  return h1 >>> 0;\n}\n\nfunction x86Hash128(bytes: Uint8Array, seed?: number) {\n  //\n  // Given a string and an optional seed as an int, returns a 128 bit\n  // hash using the x86 flavor of MurmurHash3, as an unsigned hex.\n  //\n\n  seed = seed || 0;\n  const remainder = bytes.length % 16;\n  const blocks = bytes.length - remainder;\n\n  let h1 = seed;\n  let h2 = seed;\n  let h3 = seed;\n  let h4 = seed;\n\n  let k1 = 0;\n  let k2 = 0;\n  let k3 = 0;\n  let k4 = 0;\n\n  const c1 = 0x239b961b;\n  const c2 = 0xab0e9789;\n  const c3 = 0x38b34ae5;\n  const c4 = 0xa1e38b93;\n  let j = 0;\n\n  for (let i = 0; i < blocks; i = i + 16) {\n    k1 = bytes[i] | (bytes[i + 1] << 8) | (bytes[i + 2] << 16) | (bytes[i + 3] << 24);\n    k2 = bytes[i + 4] | (bytes[i + 5] << 8) | (bytes[i + 6] << 16) | (bytes[i + 7] << 24);\n    k3 = bytes[i + 8] | (bytes[i + 9] << 8) | (bytes[i + 10] << 16) | (bytes[i + 11] << 24);\n    k4 = bytes[i + 12] | (bytes[i + 13] << 8) | (bytes[i + 14] << 16) | (bytes[i + 15] << 24);\n\n    k1 = _x86Multiply(k1, c1);\n    k1 = _x86Rotl(k1, 15);\n    k1 = _x86Multiply(k1, c2);\n    h1 ^= k1;\n\n    h1 = _x86Rotl(h1, 19);\n    h1 += h2;\n    h1 = _x86Multiply(h1, 5) + 0x561ccd1b;\n\n    k2 = _x86Multiply(k2, c2);\n    k2 = _x86Rotl(k2, 16);\n    k2 = _x86Multiply(k2, c3);\n    h2 ^= k2;\n\n    h2 = _x86Rotl(h2, 17);\n    h2 += h3;\n    h2 = _x86Multiply(h2, 5) + 0x0bcaa747;\n\n    k3 = _x86Multiply(k3, c3);\n    k3 = _x86Rotl(k3, 17);\n    k3 = _x86Multiply(k3, c4);\n    h3 ^= k3;\n\n    h3 = _x86Rotl(h3, 15);\n    h3 += h4;\n    h3 = _x86Multiply(h3, 5) + 0x96cd1c35;\n\n    k4 = _x86Multiply(k4, c4);\n    k4 = _x86Rotl(k4, 18);\n    k4 = _x86Multiply(k4, c1);\n    h4 ^= k4;\n\n    h4 = _x86Rotl(h4, 13);\n    h4 += h1;\n    h4 = _x86Multiply(h4, 5) + 0x32ac3b17;\n    j = i + 16;\n  }\n\n  k1 = 0;\n  k2 = 0;\n  k3 = 0;\n  k4 = 0;\n\n  switch (remainder) {\n    case 15:\n      k4 ^= bytes[j + 14] << 16;\n\n    case 14:\n      k4 ^= bytes[j + 13] << 8;\n\n    case 13:\n      k4 ^= bytes[j + 12];\n      k4 = _x86Multiply(k4, c4);\n      k4 = _x86Rotl(k4, 18);\n      k4 = _x86Multiply(k4, c1);\n      h4 ^= k4;\n\n    case 12:\n      k3 ^= bytes[j + 11] << 24;\n\n    case 11:\n      k3 ^= bytes[j + 10] << 16;\n\n    case 10:\n      k3 ^= bytes[j + 9] << 8;\n\n    case 9:\n      k3 ^= bytes[j + 8];\n      k3 = _x86Multiply(k3, c3);\n      k3 = _x86Rotl(k3, 17);\n      k3 = _x86Multiply(k3, c4);\n      h3 ^= k3;\n\n    case 8:\n      k2 ^= bytes[j + 7] << 24;\n\n    case 7:\n      k2 ^= bytes[j + 6] << 16;\n\n    case 6:\n      k2 ^= bytes[j + 5] << 8;\n\n    case 5:\n      k2 ^= bytes[j + 4];\n      k2 = _x86Multiply(k2, c2);\n      k2 = _x86Rotl(k2, 16);\n      k2 = _x86Multiply(k2, c3);\n      h2 ^= k2;\n\n    case 4:\n      k1 ^= bytes[j + 3] << 24;\n\n    case 3:\n      k1 ^= bytes[j + 2] << 16;\n\n    case 2:\n      k1 ^= bytes[j + 1] << 8;\n\n    case 1:\n      k1 ^= bytes[j];\n      k1 = _x86Multiply(k1, c1);\n      k1 = _x86Rotl(k1, 15);\n      k1 = _x86Multiply(k1, c2);\n      h1 ^= k1;\n  }\n\n  h1 ^= bytes.length;\n  h2 ^= bytes.length;\n  h3 ^= bytes.length;\n  h4 ^= bytes.length;\n\n  h1 += h2;\n  h1 += h3;\n  h1 += h4;\n  h2 += h1;\n  h3 += h1;\n  h4 += h1;\n\n  h1 = _x86Fmix(h1);\n  h2 = _x86Fmix(h2);\n  h3 = _x86Fmix(h3);\n  h4 = _x86Fmix(h4);\n\n  h1 += h2;\n  h1 += h3;\n  h1 += h4;\n  h2 += h1;\n  h3 += h1;\n  h4 += h1;\n\n  return (\n    (\"00000000\" + (h1 >>> 0).toString(16)).slice(-8) +\n    (\"00000000\" + (h2 >>> 0).toString(16)).slice(-8) +\n    (\"00000000\" + (h3 >>> 0).toString(16)).slice(-8) +\n    (\"00000000\" + (h4 >>> 0).toString(16)).slice(-8)\n  );\n}\n\nfunction x64Hash128(bytes: Uint8Array, seed?: number) {\n  //\n  // Given a string and an optional seed as an int, returns a 128 bit\n  // hash using the x64 flavor of MurmurHash3, as an unsigned hex.\n  //\n  seed = seed || 0;\n\n  const remainder = bytes.length % 16;\n  const blocks = bytes.length - remainder;\n\n  let h1 = [0, seed];\n  let h2 = [0, seed];\n\n  let k1 = [0, 0];\n  let k2 = [0, 0];\n\n  const c1 = [0x87c37b91, 0x114253d5];\n  const c2 = [0x4cf5ad43, 0x2745937f];\n  let j = 0;\n\n  for (let i = 0; i < blocks; i = i + 16) {\n    k1 = [\n      bytes[i + 4] | (bytes[i + 5] << 8) | (bytes[i + 6] << 16) | (bytes[i + 7] << 24),\n      bytes[i] | (bytes[i + 1] << 8) | (bytes[i + 2] << 16) | (bytes[i + 3] << 24),\n    ];\n    k2 = [\n      bytes[i + 12] | (bytes[i + 13] << 8) | (bytes[i + 14] << 16) | (bytes[i + 15] << 24),\n      bytes[i + 8] | (bytes[i + 9] << 8) | (bytes[i + 10] << 16) | (bytes[i + 11] << 24),\n    ];\n\n    k1 = _x64Multiply(k1, c1);\n    k1 = _x64Rotl(k1, 31);\n    k1 = _x64Multiply(k1, c2);\n    h1 = _x64Xor(h1, k1);\n\n    h1 = _x64Rotl(h1, 27);\n    h1 = _x64Add(h1, h2);\n    h1 = _x64Add(_x64Multiply(h1, [0, 5]), [0, 0x52dce729]);\n\n    k2 = _x64Multiply(k2, c2);\n    k2 = _x64Rotl(k2, 33);\n    k2 = _x64Multiply(k2, c1);\n    h2 = _x64Xor(h2, k2);\n\n    h2 = _x64Rotl(h2, 31);\n    h2 = _x64Add(h2, h1);\n    h2 = _x64Add(_x64Multiply(h2, [0, 5]), [0, 0x38495ab5]);\n    j = i + 16;\n  }\n\n  k1 = [0, 0];\n  k2 = [0, 0];\n\n  switch (remainder) {\n    case 15:\n      k2 = _x64Xor(k2, _x64LeftShift([0, bytes[j + 14]], 48));\n\n    case 14:\n      k2 = _x64Xor(k2, _x64LeftShift([0, bytes[j + 13]], 40));\n\n    case 13:\n      k2 = _x64Xor(k2, _x64LeftShift([0, bytes[j + 12]], 32));\n\n    case 12:\n      k2 = _x64Xor(k2, _x64LeftShift([0, bytes[j + 11]], 24));\n\n    case 11:\n      k2 = _x64Xor(k2, _x64LeftShift([0, bytes[j + 10]], 16));\n\n    case 10:\n      k2 = _x64Xor(k2, _x64LeftShift([0, bytes[j + 9]], 8));\n\n    case 9:\n      k2 = _x64Xor(k2, [0, bytes[j + 8]]);\n      k2 = _x64Multiply(k2, c2);\n      k2 = _x64Rotl(k2, 33);\n      k2 = _x64Multiply(k2, c1);\n      h2 = _x64Xor(h2, k2);\n\n    case 8:\n      k1 = _x64Xor(k1, _x64LeftShift([0, bytes[j + 7]], 56));\n\n    case 7:\n      k1 = _x64Xor(k1, _x64LeftShift([0, bytes[j + 6]], 48));\n\n    case 6:\n      k1 = _x64Xor(k1, _x64LeftShift([0, bytes[j + 5]], 40));\n\n    case 5:\n      k1 = _x64Xor(k1, _x64LeftShift([0, bytes[j + 4]], 32));\n\n    case 4:\n      k1 = _x64Xor(k1, _x64LeftShift([0, bytes[j + 3]], 24));\n\n    case 3:\n      k1 = _x64Xor(k1, _x64LeftShift([0, bytes[j + 2]], 16));\n\n    case 2:\n      k1 = _x64Xor(k1, _x64LeftShift([0, bytes[j + 1]], 8));\n\n    case 1:\n      k1 = _x64Xor(k1, [0, bytes[j]]);\n      k1 = _x64Multiply(k1, c1);\n      k1 = _x64Rotl(k1, 31);\n      k1 = _x64Multiply(k1, c2);\n      h1 = _x64Xor(h1, k1);\n  }\n\n  h1 = _x64Xor(h1, [0, bytes.length]);\n  h2 = _x64Xor(h2, [0, bytes.length]);\n\n  h1 = _x64Add(h1, h2);\n  h2 = _x64Add(h2, h1);\n\n  h1 = _x64Fmix(h1);\n  h2 = _x64Fmix(h2);\n\n  h1 = _x64Add(h1, h2);\n  h2 = _x64Add(h2, h1);\n\n  // Here we reverse h1 and h2 in Cosmos\n  // This is an implementation detail and not part of the public spec\n  // Convert h1 to hex string and then to Uint8Array.\n  const h1Hex =\n    (\"00000000\" + (h1[0] >>> 0).toString(16)).slice(-8) +\n    (\"00000000\" + (h1[1] >>> 0).toString(16)).slice(-8);\n  const h1Buff = hexStringToUint8Array(h1Hex);\n  const h1Reversed = uint8ArrayToHex(reverse(h1Buff));\n\n  const h2Hex =\n    (\"00000000\" + (h2[0] >>> 0).toString(16)).slice(-8) +\n    (\"00000000\" + (h2[1] >>> 0).toString(16)).slice(-8);\n  const h2Buff = hexStringToUint8Array(h2Hex);\n  const h2Reversed = uint8ArrayToHex(reverse(h2Buff));\n  return h1Reversed + h2Reversed;\n}\n\nexport function reverse(buff: Uint8Array) {\n  const uint8array = new Uint8Array(buff.length);\n\n  for (let i = 0, j = buff.length - 1; i <= j; ++i, --j) {\n    uint8array[i] = buff[j];\n    uint8array[j] = buff[i];\n  }\n  return uint8array;\n}\n\nexport default {\n  version: \"3.0.0\",\n  x86: {\n    hash32: x86Hash32,\n    hash128: x86Hash128,\n  },\n  x64: {\n    hash128: x64Hash128,\n  },\n  inputValidation: true,\n};\n"],
+  "mappings": ";;;;;;;;;;;;;;;;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAWA,mBAAuD;AACvD,SAAS,aAAa,GAAW,GAAW;AAM1C,UAAQ,IAAI,SAAU,OAAQ,MAAM,MAAM,IAAK,UAAW;AAC5D;AAEA,SAAS,SAAS,GAAW,GAAW;AAMtC,SAAQ,KAAK,IAAM,MAAO,KAAK;AACjC;AAEA,SAAS,SAAS,GAAW;AAK3B,OAAK,MAAM;AACX,MAAI,aAAa,GAAG,UAAU;AAC9B,OAAK,MAAM;AACX,MAAI,aAAa,GAAG,UAAU;AAC9B,OAAK,MAAM;AAEX,SAAO;AACT;AAEA,SAAS,QAAQ,GAAa,GAAa;AAMzC,MAAI,CAAC,EAAE,CAAC,MAAM,IAAI,EAAE,CAAC,IAAI,OAAQ,EAAE,CAAC,MAAM,IAAI,EAAE,CAAC,IAAI,KAAM;AAC3D,MAAI,CAAC,EAAE,CAAC,MAAM,IAAI,EAAE,CAAC,IAAI,OAAQ,EAAE,CAAC,MAAM,IAAI,EAAE,CAAC,IAAI,KAAM;AAC3D,QAAM,IAAI,CAAC,GAAG,GAAG,GAAG,CAAC;AAErB,IAAE,CAAC,KAAK,EAAE,CAAC,IAAI,EAAE,CAAC;AAClB,IAAE,CAAC,KAAK,EAAE,CAAC,MAAM;AACjB,IAAE,CAAC,KAAK;AAER,IAAE,CAAC,KAAK,EAAE,CAAC,IAAI,EAAE,CAAC;AAClB,IAAE,CAAC,KAAK,EAAE,CAAC,MAAM;AACjB,IAAE,CAAC,KAAK;AAER,IAAE,CAAC,KAAK,EAAE,CAAC,IAAI,EAAE,CAAC;AAClB,IAAE,CAAC,KAAK,EAAE,CAAC,MAAM;AACjB,IAAE,CAAC,KAAK;AAER,IAAE,CAAC,KAAK,EAAE,CAAC,IAAI,EAAE,CAAC;AAClB,IAAE,CAAC,KAAK;AAER,SAAO,CAAE,EAAE,CAAC,KAAK,KAAM,EAAE,CAAC,GAAI,EAAE,CAAC,KAAK,KAAM,EAAE,CAAC,CAAC;AAClD;AAEA,SAAS,aAAa,GAAa,GAAa;AAM9C,MAAI,CAAC,EAAE,CAAC,MAAM,IAAI,EAAE,CAAC,IAAI,OAAQ,EAAE,CAAC,MAAM,IAAI,EAAE,CAAC,IAAI,KAAM;AAC3D,MAAI,CAAC,EAAE,CAAC,MAAM,IAAI,EAAE,CAAC,IAAI,OAAQ,EAAE,CAAC,MAAM,IAAI,EAAE,CAAC,IAAI,KAAM;AAC3D,QAAM,IAAI,CAAC,GAAG,GAAG,GAAG,CAAC;AAErB,IAAE,CAAC,KAAK,EAAE,CAAC,IAAI,EAAE,CAAC;AAClB,IAAE,CAAC,KAAK,EAAE,CAAC,MAAM;AACjB,IAAE,CAAC,KAAK;AAER,IAAE,CAAC,KAAK,EAAE,CAAC,IAAI,EAAE,CAAC;AAClB,IAAE,CAAC,KAAK,EAAE,CAAC,MAAM;AACjB,IAAE,CAAC,KAAK;AAER,IAAE,CAAC,KAAK,EAAE,CAAC,IAAI,EAAE,CAAC;AAClB,IAAE,CAAC,KAAK,EAAE,CAAC,MAAM;AACjB,IAAE,CAAC,KAAK;AAER,IAAE,CAAC,KAAK,EAAE,CAAC,IAAI,EAAE,CAAC;AAClB,IAAE,CAAC,KAAK,EAAE,CAAC,MAAM;AACjB,IAAE,CAAC,KAAK;AAER,IAAE,CAAC,KAAK,EAAE,CAAC,IAAI,EAAE,CAAC;AAClB,IAAE,CAAC,KAAK,EAAE,CAAC,MAAM;AACjB,IAAE,CAAC,KAAK;AAER,IAAE,CAAC,KAAK,EAAE,CAAC,IAAI,EAAE,CAAC;AAClB,IAAE,CAAC,KAAK,EAAE,CAAC,MAAM;AACjB,IAAE,CAAC,KAAK;AAER,IAAE,CAAC,KAAK,EAAE,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,CAAC;AAC5D,IAAE,CAAC,KAAK;AAER,SAAO,CAAE,EAAE,CAAC,KAAK,KAAM,EAAE,CAAC,GAAI,EAAE,CAAC,KAAK,KAAM,EAAE,CAAC,CAAC;AAClD;AAEA,SAAS,SAAS,GAAa,GAAW;AAOxC,OAAK;AAEL,MAAI,MAAM,IAAI;AACZ,WAAO,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC;AAAA,EACpB,WAAW,IAAI,IAAI;AACjB,WAAO,CAAE,EAAE,CAAC,KAAK,IAAM,EAAE,CAAC,MAAO,KAAK,GAAM,EAAE,CAAC,KAAK,IAAM,EAAE,CAAC,MAAO,KAAK,CAAG;AAAA,EAC9E,OAAO;AACL,SAAK;AACL,WAAO,CAAE,EAAE,CAAC,KAAK,IAAM,EAAE,CAAC,MAAO,KAAK,GAAM,EAAE,CAAC,KAAK,IAAM,EAAE,CAAC,MAAO,KAAK,CAAG;AAAA,EAC9E;AACF;AAEA,SAAS,cAAc,GAAa,GAAW;AAO7C,OAAK;AAEL,MAAI,MAAM,GAAG;AACX,WAAO;AAAA,EACT,WAAW,IAAI,IAAI;AACjB,WAAO,CAAE,EAAE,CAAC,KAAK,IAAM,EAAE,CAAC,MAAO,KAAK,GAAK,EAAE,CAAC,KAAK,CAAC;AAAA,EACtD,OAAO;AACL,WAAO,CAAC,EAAE,CAAC,KAAM,IAAI,IAAK,CAAC;AAAA,EAC7B;AACF;AAEA,SAAS,QAAQ,GAAa,GAAa;AAMzC,SAAO,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,GAAG,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC;AAClC;AAEA,SAAS,SAAS,GAAa;AAO7B,MAAI,QAAQ,GAAG,CAAC,GAAG,EAAE,CAAC,MAAM,CAAC,CAAC;AAC9B,MAAI,aAAa,GAAG,CAAC,YAAY,UAAU,CAAC;AAC5C,MAAI,QAAQ,GAAG,CAAC,GAAG,EAAE,CAAC,MAAM,CAAC,CAAC;AAC9B,MAAI,aAAa,GAAG,CAAC,YAAY,SAAU,CAAC;AAC5C,MAAI,QAAQ,GAAG,CAAC,GAAG,EAAE,CAAC,MAAM,CAAC,CAAC;AAE9B,SAAO;AACT;AAKA,SAAS,UAAU,OAAmB,MAAe;AAKnD,SAAO,QAAQ;AAEf,QAAM,YAAY,MAAM,SAAS;AACjC,QAAM,SAAS,MAAM,SAAS;AAE9B,MAAI,KAAK;AAET,MAAI,KAAK;AAET,QAAM,KAAK;AACX,QAAM,KAAK;AACX,MAAI,IAAI;AAER,WAAS,IAAI,GAAG,IAAI,QAAQ,IAAI,IAAI,GAAG;AACrC,SAAK,MAAM,CAAC,IAAK,MAAM,IAAI,CAAC,KAAK,IAAM,MAAM,IAAI,CAAC,KAAK,KAAO,MAAM,IAAI,CAAC,KAAK;AAE9E,SAAK,aAAa,IAAI,EAAE;AACxB,SAAK,SAAS,IAAI,EAAE;AACpB,SAAK,aAAa,IAAI,EAAE;AAExB,UAAM;AACN,SAAK,SAAS,IAAI,EAAE;AACpB,SAAK,aAAa,IAAI,CAAC,IAAI;AAC3B,QAAI,IAAI;AAAA,EACV;AAEA,OAAK;AAEL,UAAQ,WAAW;AAAA,IACjB,KAAK;AACH,YAAM,MAAM,IAAI,CAAC,KAAK;AAAA,IAExB,KAAK;AACH,YAAM,MAAM,IAAI,CAAC,KAAK;AAAA,IAExB,KAAK;AACH,YAAM,MAAM,CAAC;AACb,WAAK,aAAa,IAAI,EAAE;AACxB,WAAK,SAAS,IAAI,EAAE;AACpB,WAAK,aAAa,IAAI,EAAE;AACxB,YAAM;AAAA,EACV;AAEA,QAAM,MAAM;AACZ,OAAK,SAAS,EAAE;AAEhB,SAAO,OAAO;AAChB;AAEA,SAAS,WAAW,OAAmB,MAAe;AAMpD,SAAO,QAAQ;AACf,QAAM,YAAY,MAAM,SAAS;AACjC,QAAM,SAAS,MAAM,SAAS;AAE9B,MAAI,KAAK;AACT,MAAI,KAAK;AACT,MAAI,KAAK;AACT,MAAI,KAAK;AAET,MAAI,KAAK;AACT,MAAI,KAAK;AACT,MAAI,KAAK;AACT,MAAI,KAAK;AAET,QAAM,KAAK;AACX,QAAM,KAAK;AACX,QAAM,KAAK;AACX,QAAM,KAAK;AACX,MAAI,IAAI;AAER,WAAS,IAAI,GAAG,IAAI,QAAQ,IAAI,IAAI,IAAI;AACtC,SAAK,MAAM,CAAC,IAAK,MAAM,IAAI,CAAC,KAAK,IAAM,MAAM,IAAI,CAAC,KAAK,KAAO,MAAM,IAAI,CAAC,KAAK;AAC9E,SAAK,MAAM,IAAI,CAAC,IAAK,MAAM,IAAI,CAAC,KAAK,IAAM,MAAM,IAAI,CAAC,KAAK,KAAO,MAAM,IAAI,CAAC,KAAK;AAClF,SAAK,MAAM,IAAI,CAAC,IAAK,MAAM,IAAI,CAAC,KAAK,IAAM,MAAM,IAAI,EAAE,KAAK,KAAO,MAAM,IAAI,EAAE,KAAK;AACpF,SAAK,MAAM,IAAI,EAAE,IAAK,MAAM,IAAI,EAAE,KAAK,IAAM,MAAM,IAAI,EAAE,KAAK,KAAO,MAAM,IAAI,EAAE,KAAK;AAEtF,SAAK,aAAa,IAAI,EAAE;AACxB,SAAK,SAAS,IAAI,EAAE;AACpB,SAAK,aAAa,IAAI,EAAE;AACxB,UAAM;AAEN,SAAK,SAAS,IAAI,EAAE;AACpB,UAAM;AACN,SAAK,aAAa,IAAI,CAAC,IAAI;AAE3B,SAAK,aAAa,IAAI,EAAE;AACxB,SAAK,SAAS,IAAI,EAAE;AACpB,SAAK,aAAa,IAAI,EAAE;AACxB,UAAM;AAEN,SAAK,SAAS,IAAI,EAAE;AACpB,UAAM;AACN,SAAK,aAAa,IAAI,CAAC,IAAI;AAE3B,SAAK,aAAa,IAAI,EAAE;AACxB,SAAK,SAAS,IAAI,EAAE;AACpB,SAAK,aAAa,IAAI,EAAE;AACxB,UAAM;AAEN,SAAK,SAAS,IAAI,EAAE;AACpB,UAAM;AACN,SAAK,aAAa,IAAI,CAAC,IAAI;AAE3B,SAAK,aAAa,IAAI,EAAE;AACxB,SAAK,SAAS,IAAI,EAAE;AACpB,SAAK,aAAa,IAAI,EAAE;AACxB,UAAM;AAEN,SAAK,SAAS,IAAI,EAAE;AACpB,UAAM;AACN,SAAK,aAAa,IAAI,CAAC,IAAI;AAC3B,QAAI,IAAI;AAAA,EACV;AAEA,OAAK;AACL,OAAK;AACL,OAAK;AACL,OAAK;AAEL,UAAQ,WAAW;AAAA,IACjB,KAAK;AACH,YAAM,MAAM,IAAI,EAAE,KAAK;AAAA,IAEzB,KAAK;AACH,YAAM,MAAM,IAAI,EAAE,KAAK;AAAA,IAEzB,KAAK;AACH,YAAM,MAAM,IAAI,EAAE;AAClB,WAAK,aAAa,IAAI,EAAE;AACxB,WAAK,SAAS,IAAI,EAAE;AACpB,WAAK,aAAa,IAAI,EAAE;AACxB,YAAM;AAAA,IAER,KAAK;AACH,YAAM,MAAM,IAAI,EAAE,KAAK;AAAA,IAEzB,KAAK;AACH,YAAM,MAAM,IAAI,EAAE,KAAK;AAAA,IAEzB,KAAK;AACH,YAAM,MAAM,IAAI,CAAC,KAAK;AAAA,IAExB,KAAK;AACH,YAAM,MAAM,IAAI,CAAC;AACjB,WAAK,aAAa,IAAI,EAAE;AACxB,WAAK,SAAS,IAAI,EAAE;AACpB,WAAK,aAAa,IAAI,EAAE;AACxB,YAAM;AAAA,IAER,KAAK;AACH,YAAM,MAAM,IAAI,CAAC,KAAK;AAAA,IAExB,KAAK;AACH,YAAM,MAAM,IAAI,CAAC,KAAK;AAAA,IAExB,KAAK;AACH,YAAM,MAAM,IAAI,CAAC,KAAK;AAAA,IAExB,KAAK;AACH,YAAM,MAAM,IAAI,CAAC;AACjB,WAAK,aAAa,IAAI,EAAE;AACxB,WAAK,SAAS,IAAI,EAAE;AACpB,WAAK,aAAa,IAAI,EAAE;AACxB,YAAM;AAAA,IAER,KAAK;AACH,YAAM,MAAM,IAAI,CAAC,KAAK;AAAA,IAExB,KAAK;AACH,YAAM,MAAM,IAAI,CAAC,KAAK;AAAA,IAExB,KAAK;AACH,YAAM,MAAM,IAAI,CAAC,KAAK;AAAA,IAExB,KAAK;AACH,YAAM,MAAM,CAAC;AACb,WAAK,aAAa,IAAI,EAAE;AACxB,WAAK,SAAS,IAAI,EAAE;AACpB,WAAK,aAAa,IAAI,EAAE;AACxB,YAAM;AAAA,EACV;AAEA,QAAM,MAAM;AACZ,QAAM,MAAM;AACZ,QAAM,MAAM;AACZ,QAAM,MAAM;AAEZ,QAAM;AACN,QAAM;AACN,QAAM;AACN,QAAM;AACN,QAAM;AACN,QAAM;AAEN,OAAK,SAAS,EAAE;AAChB,OAAK,SAAS,EAAE;AAChB,OAAK,SAAS,EAAE;AAChB,OAAK,SAAS,EAAE;AAEhB,QAAM;AACN,QAAM;AACN,QAAM;AACN,QAAM;AACN,QAAM;AACN,QAAM;AAEN,UACG,cAAc,OAAO,GAAG,SAAS,EAAE,GAAG,MAAM,EAAE,KAC9C,cAAc,OAAO,GAAG,SAAS,EAAE,GAAG,MAAM,EAAE,KAC9C,cAAc,OAAO,GAAG,SAAS,EAAE,GAAG,MAAM,EAAE,KAC9C,cAAc,OAAO,GAAG,SAAS,EAAE,GAAG,MAAM,EAAE;AAEnD;AAEA,SAAS,WAAW,OAAmB,MAAe;AAKpD,SAAO,QAAQ;AAEf,QAAM,YAAY,MAAM,SAAS;AACjC,QAAM,SAAS,MAAM,SAAS;AAE9B,MAAI,KAAK,CAAC,GAAG,IAAI;AACjB,MAAI,KAAK,CAAC,GAAG,IAAI;AAEjB,MAAI,KAAK,CAAC,GAAG,CAAC;AACd,MAAI,KAAK,CAAC,GAAG,CAAC;AAEd,QAAM,KAAK,CAAC,YAAY,SAAU;AAClC,QAAM,KAAK,CAAC,YAAY,SAAU;AAClC,MAAI,IAAI;AAER,WAAS,IAAI,GAAG,IAAI,QAAQ,IAAI,IAAI,IAAI;AACtC,SAAK;AAAA,MACH,MAAM,IAAI,CAAC,IAAK,MAAM,IAAI,CAAC,KAAK,IAAM,MAAM,IAAI,CAAC,KAAK,KAAO,MAAM,IAAI,CAAC,KAAK;AAAA,MAC7E,MAAM,CAAC,IAAK,MAAM,IAAI,CAAC,KAAK,IAAM,MAAM,IAAI,CAAC,KAAK,KAAO,MAAM,IAAI,CAAC,KAAK;AAAA,IAC3E;AACA,SAAK;AAAA,MACH,MAAM,IAAI,EAAE,IAAK,MAAM,IAAI,EAAE,KAAK,IAAM,MAAM,IAAI,EAAE,KAAK,KAAO,MAAM,IAAI,EAAE,KAAK;AAAA,MACjF,MAAM,IAAI,CAAC,IAAK,MAAM,IAAI,CAAC,KAAK,IAAM,MAAM,IAAI,EAAE,KAAK,KAAO,MAAM,IAAI,EAAE,KAAK;AAAA,IACjF;AAEA,SAAK,aAAa,IAAI,EAAE;AACxB,SAAK,SAAS,IAAI,EAAE;AACpB,SAAK,aAAa,IAAI,EAAE;AACxB,SAAK,QAAQ,IAAI,EAAE;AAEnB,SAAK,SAAS,IAAI,EAAE;AACpB,SAAK,QAAQ,IAAI,EAAE;AACnB,SAAK,QAAQ,aAAa,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,UAAU,CAAC;AAEtD,SAAK,aAAa,IAAI,EAAE;AACxB,SAAK,SAAS,IAAI,EAAE;AACpB,SAAK,aAAa,IAAI,EAAE;AACxB,SAAK,QAAQ,IAAI,EAAE;AAEnB,SAAK,SAAS,IAAI,EAAE;AACpB,SAAK,QAAQ,IAAI,EAAE;AACnB,SAAK,QAAQ,aAAa,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,SAAU,CAAC;AACtD,QAAI,IAAI;AAAA,EACV;AAEA,OAAK,CAAC,GAAG,CAAC;AACV,OAAK,CAAC,GAAG,CAAC;AAEV,UAAQ,WAAW;AAAA,IACjB,KAAK;AACH,WAAK,QAAQ,IAAI,cAAc,CAAC,GAAG,MAAM,IAAI,EAAE,CAAC,GAAG,EAAE,CAAC;AAAA,IAExD,KAAK;AACH,WAAK,QAAQ,IAAI,cAAc,CAAC,GAAG,MAAM,IAAI,EAAE,CAAC,GAAG,EAAE,CAAC;AAAA,IAExD,KAAK;AACH,WAAK,QAAQ,IAAI,cAAc,CAAC,GAAG,MAAM,IAAI,EAAE,CAAC,GAAG,EAAE,CAAC;AAAA,IAExD,KAAK;AACH,WAAK,QAAQ,IAAI,cAAc,CAAC,GAAG,MAAM,IAAI,EAAE,CAAC,GAAG,EAAE,CAAC;AAAA,IAExD,KAAK;AACH,WAAK,QAAQ,IAAI,cAAc,CAAC,GAAG,MAAM,IAAI,EAAE,CAAC,GAAG,EAAE,CAAC;AAAA,IAExD,KAAK;AACH,WAAK,QAAQ,IAAI,cAAc,CAAC,GAAG,MAAM,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;AAAA,IAEtD,KAAK;AACH,WAAK,QAAQ,IAAI,CAAC,GAAG,MAAM,IAAI,CAAC,CAAC,CAAC;AAClC,WAAK,aAAa,IAAI,EAAE;AACxB,WAAK,SAAS,IAAI,EAAE;AACpB,WAAK,aAAa,IAAI,EAAE;AACxB,WAAK,QAAQ,IAAI,EAAE;AAAA,IAErB,KAAK;AACH,WAAK,QAAQ,IAAI,cAAc,CAAC,GAAG,MAAM,IAAI,CAAC,CAAC,GAAG,EAAE,CAAC;AAAA,IAEvD,KAAK;AACH,WAAK,QAAQ,IAAI,cAAc,CAAC,GAAG,MAAM,IAAI,CAAC,CAAC,GAAG,EAAE,CAAC;AAAA,IAEvD,KAAK;AACH,WAAK,QAAQ,IAAI,cAAc,CAAC,GAAG,MAAM,IAAI,CAAC,CAAC,GAAG,EAAE,CAAC;AAAA,IAEvD,KAAK;AACH,WAAK,QAAQ,IAAI,cAAc,CAAC,GAAG,MAAM,IAAI,CAAC,CAAC,GAAG,EAAE,CAAC;AAAA,IAEvD,KAAK;AACH,WAAK,QAAQ,IAAI,cAAc,CAAC,GAAG,MAAM,IAAI,CAAC,CAAC,GAAG,EAAE,CAAC;AAAA,IAEvD,KAAK;AACH,WAAK,QAAQ,IAAI,cAAc,CAAC,GAAG,MAAM,IAAI,CAAC,CAAC,GAAG,EAAE,CAAC;AAAA,IAEvD,KAAK;AACH,WAAK,QAAQ,IAAI,cAAc,CAAC,GAAG,MAAM,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;AAAA,IAEtD,KAAK;AACH,WAAK,QAAQ,IAAI,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC;AAC9B,WAAK,aAAa,IAAI,EAAE;AACxB,WAAK,SAAS,IAAI,EAAE;AACpB,WAAK,aAAa,IAAI,EAAE;AACxB,WAAK,QAAQ,IAAI,EAAE;AAAA,EACvB;AAEA,OAAK,QAAQ,IAAI,CAAC,GAAG,MAAM,MAAM,CAAC;AAClC,OAAK,QAAQ,IAAI,CAAC,GAAG,MAAM,MAAM,CAAC;AAElC,OAAK,QAAQ,IAAI,EAAE;AACnB,OAAK,QAAQ,IAAI,EAAE;AAEnB,OAAK,SAAS,EAAE;AAChB,OAAK,SAAS,EAAE;AAEhB,OAAK,QAAQ,IAAI,EAAE;AACnB,OAAK,QAAQ,IAAI,EAAE;AAKnB,QAAM,SACH,cAAc,GAAG,CAAC,MAAM,GAAG,SAAS,EAAE,GAAG,MAAM,EAAE,KACjD,cAAc,GAAG,CAAC,MAAM,GAAG,SAAS,EAAE,GAAG,MAAM,EAAE;AACpD,QAAM,aAAS,oCAAsB,KAAK;AAC1C,QAAM,iBAAa,8BAAgB,QAAQ,MAAM,CAAC;AAElD,QAAM,SACH,cAAc,GAAG,CAAC,MAAM,GAAG,SAAS,EAAE,GAAG,MAAM,EAAE,KACjD,cAAc,GAAG,CAAC,MAAM,GAAG,SAAS,EAAE,GAAG,MAAM,EAAE;AACpD,QAAM,aAAS,oCAAsB,KAAK;AAC1C,QAAM,iBAAa,8BAAgB,QAAQ,MAAM,CAAC;AAClD,SAAO,aAAa;AACtB;AAEO,SAAS,QAAQ,MAAkB;AACxC,QAAM,aAAa,IAAI,WAAW,KAAK,MAAM;AAE7C,WAAS,IAAI,GAAG,IAAI,KAAK,SAAS,GAAG,KAAK,GAAG,EAAE,GAAG,EAAE,GAAG;AACrD,eAAW,CAAC,IAAI,KAAK,CAAC;AACtB,eAAW,CAAC,IAAI,KAAK,CAAC;AAAA,EACxB;AACA,SAAO;AACT;AAEA,IAAO,qBAAQ;AAAA,EACb,SAAS;AAAA,EACT,KAAK;AAAA,IACH,QAAQ;AAAA,IACR,SAAS;AAAA,EACX;AAAA,EACA,KAAK;AAAA,IACH,SAAS;AAAA,EACX;AAAA,EACA,iBAAiB;AACnB;",
+  "names": []
+}

package/dist/commonjs/utils/hashing/v1.js CHANGED Viewed

@@ -1,80 +1,109 @@
-"use strict";
-// Copyright (c) Microsoft Corporation.
-// Licensed under the MIT License.
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.hashV1PartitionKey = hashV1PartitionKey;
-const tslib_1 = require("tslib");
-const number_js_1 = require("./encoding/number.js");
-const string_js_1 = require("./encoding/string.js");
-const prefix_js_1 = require("./encoding/prefix.js");
-const murmurHash_js_1 = tslib_1.__importDefault(require("./murmurHash.js"));
-const uint8_js_1 = require("../uint8.js");
+var __create = Object.create;
+var __defProp = Object.defineProperty;
+var __getOwnPropDesc = Object.getOwnPropertyDescriptor;
+var __getOwnPropNames = Object.getOwnPropertyNames;
+var __getProtoOf = Object.getPrototypeOf;
+var __hasOwnProp = Object.prototype.hasOwnProperty;
+var __export = (target, all) => {
+  for (var name in all)
+    __defProp(target, name, { get: all[name], enumerable: true });
+};
+var __copyProps = (to, from, except, desc) => {
+  if (from && typeof from === "object" || typeof from === "function") {
+    for (let key of __getOwnPropNames(from))
+      if (!__hasOwnProp.call(to, key) && key !== except)
+        __defProp(to, key, { get: () => from[key], enumerable: !(desc = __getOwnPropDesc(from, key)) || desc.enumerable });
+  }
+  return to;
+};
+var __toESM = (mod, isNodeMode, target) => (target = mod != null ? __create(__getProtoOf(mod)) : {}, __copyProps(
+  // If the importer is in node compatibility mode or this is not an ESM
+  // file that has been converted to a CommonJS file using a Babel-
+  // compatible transform (i.e. "__esModule" has not been set), then set
+  // "default" to the CommonJS "module.exports" for node compatibility.
+  isNodeMode || !mod || !mod.__esModule ? __defProp(target, "default", { value: mod, enumerable: true }) : target,
+  mod
+));
+var __toCommonJS = (mod) => __copyProps(__defProp({}, "__esModule", { value: true }), mod);
+var v1_exports = {};
+__export(v1_exports, {
+  hashV1PartitionKey: () => hashV1PartitionKey
+});
+module.exports = __toCommonJS(v1_exports);
+var import_number = require("./encoding/number.js");
+var import_string = require("./encoding/string.js");
+var import_prefix = require("./encoding/prefix.js");
+var import_murmurHash = __toESM(require("./murmurHash.js"));
+var import_uint8 = require("../uint8.js");
 const MAX_STRING_CHARS = 100;
 function hashV1PartitionKey(partitionKey) {
-    const key = partitionKey[0];
-    const toHash = prefixKeyByType(key);
-    const hash = murmurHash_js_1.default.x86.hash32(toHash);
-    const encodedJSBI = (0, number_js_1.writeNumberForBinaryEncodingBigInt)(hash);
-    const encodedValue = encodeByType(key);
-    const finalHash = (0, uint8_js_1.uint8ArrayToHex)((0, uint8_js_1.concatUint8Arrays)([encodedJSBI, encodedValue])).toUpperCase();
-    return finalHash;
+  const key = partitionKey[0];
+  const toHash = prefixKeyByType(key);
+  const hash = import_murmurHash.default.x86.hash32(toHash);
+  const encodedJSBI = (0, import_number.writeNumberForBinaryEncodingBigInt)(hash);
+  const encodedValue = encodeByType(key);
+  const finalHash = (0, import_uint8.uint8ArrayToHex)((0, import_uint8.concatUint8Arrays)([encodedJSBI, encodedValue])).toUpperCase();
+  return finalHash;
 }
 function prefixKeyByType(key) {
-    let bytes;
-    switch (typeof key) {
-        case "string": {
-            const truncated = key.substr(0, MAX_STRING_CHARS);
-            bytes = (0, uint8_js_1.concatUint8Arrays)([
-                (0, uint8_js_1.hexStringToUint8Array)(prefix_js_1.BytePrefix.String),
-                new TextEncoder().encode(truncated),
-                (0, uint8_js_1.hexStringToUint8Array)(prefix_js_1.BytePrefix.Undefined),
-            ]);
-            return bytes;
-        }
-        case "number": {
-            const numberBytes = (0, number_js_1.doubleToByteArrayBigInt)(key);
-            bytes = (0, uint8_js_1.concatUint8Arrays)([(0, uint8_js_1.hexStringToUint8Array)(prefix_js_1.BytePrefix.Number), numberBytes]);
-            return bytes;
-        }
-        case "boolean": {
-            const prefix = key ? prefix_js_1.BytePrefix.True : prefix_js_1.BytePrefix.False;
-            return (0, uint8_js_1.hexStringToUint8Array)(prefix);
-        }
-        case "object": {
-            if (key === null) {
-                return (0, uint8_js_1.hexStringToUint8Array)(prefix_js_1.BytePrefix.Null);
-            }
-            return (0, uint8_js_1.hexStringToUint8Array)(prefix_js_1.BytePrefix.Undefined);
-        }
-        case "undefined": {
-            return (0, uint8_js_1.hexStringToUint8Array)(prefix_js_1.BytePrefix.Undefined);
-        }
-        default:
-            throw new Error(`Unexpected type: ${typeof key}`);
+  let bytes;
+  switch (typeof key) {
+    case "string": {
+      const truncated = key.substr(0, MAX_STRING_CHARS);
+      bytes = (0, import_uint8.concatUint8Arrays)([
+        (0, import_uint8.hexStringToUint8Array)(import_prefix.BytePrefix.String),
+        new TextEncoder().encode(truncated),
+        (0, import_uint8.hexStringToUint8Array)(import_prefix.BytePrefix.Undefined)
+      ]);
+      return bytes;
     }
+    case "number": {
+      const numberBytes = (0, import_number.doubleToByteArrayBigInt)(key);
+      bytes = (0, import_uint8.concatUint8Arrays)([(0, import_uint8.hexStringToUint8Array)(import_prefix.BytePrefix.Number), numberBytes]);
+      return bytes;
+    }
+    case "boolean": {
+      const prefix = key ? import_prefix.BytePrefix.True : import_prefix.BytePrefix.False;
+      return (0, import_uint8.hexStringToUint8Array)(prefix);
+    }
+    case "object": {
+      if (key === null) {
+        return (0, import_uint8.hexStringToUint8Array)(import_prefix.BytePrefix.Null);
+      }
+      return (0, import_uint8.hexStringToUint8Array)(import_prefix.BytePrefix.Undefined);
+    }
+    case "undefined": {
+      return (0, import_uint8.hexStringToUint8Array)(import_prefix.BytePrefix.Undefined);
+    }
+    default:
+      throw new Error(`Unexpected type: ${typeof key}`);
+  }
 }
 function encodeByType(key) {
-    switch (typeof key) {
-        case "string": {
-            const truncated = key.substring(0, MAX_STRING_CHARS);
-            return (0, string_js_1.writeStringForBinaryEncoding)(truncated);
-        }
-        case "number": {
-            return (0, number_js_1.writeNumberForBinaryEncodingBigInt)(key);
-        }
-        case "boolean": {
-            const prefix = key ? prefix_js_1.BytePrefix.True : prefix_js_1.BytePrefix.False;
-            return (0, uint8_js_1.hexStringToUint8Array)(prefix);
-        }
-        case "object":
-            if (key === null) {
-                return (0, uint8_js_1.hexStringToUint8Array)(prefix_js_1.BytePrefix.Null);
-            }
-            return (0, uint8_js_1.hexStringToUint8Array)(prefix_js_1.BytePrefix.Undefined);
-        case "undefined":
-            return (0, uint8_js_1.hexStringToUint8Array)(prefix_js_1.BytePrefix.Undefined);
-        default:
-            throw new Error(`Unexpected type: ${typeof key}`);
+  switch (typeof key) {
+    case "string": {
+      const truncated = key.substring(0, MAX_STRING_CHARS);
+      return (0, import_string.writeStringForBinaryEncoding)(truncated);
+    }
+    case "number": {
+      return (0, import_number.writeNumberForBinaryEncodingBigInt)(key);
+    }
+    case "boolean": {
+      const prefix = key ? import_prefix.BytePrefix.True : import_prefix.BytePrefix.False;
+      return (0, import_uint8.hexStringToUint8Array)(prefix);
     }
+    case "object":
+      if (key === null) {
+        return (0, import_uint8.hexStringToUint8Array)(import_prefix.BytePrefix.Null);
+      }
+      return (0, import_uint8.hexStringToUint8Array)(import_prefix.BytePrefix.Undefined);
+    case "undefined":
+      return (0, import_uint8.hexStringToUint8Array)(import_prefix.BytePrefix.Undefined);
+    default:
+      throw new Error(`Unexpected type: ${typeof key}`);
+  }
 }
-//# sourceMappingURL=v1.js.map
+// Annotate the CommonJS export names for ESM import in node:
+0 && (module.exports = {
+  hashV1PartitionKey
+});

package/dist/commonjs/utils/hashing/v1.js.map CHANGED Viewed

@@ -1 +1,7 @@
-{"version":3,"file":"v1.js","sourceRoot":"","sources":["../../../../src/utils/hashing/v1.ts"],"names":[],"mappings":";AAAA,uCAAuC;AACvC,kCAAkC;;AAWlC,gDAQC;;AAjBD,oDAAmG;AACnG,oDAAoE;AACpE,oDAAkD;AAClD,4EAAyC;AAEzC,0CAAwF;AAExF,MAAM,gBAAgB,GAAG,GAAG,CAAC;AAE7B,SAAgB,kBAAkB,CAAC,YAA0C;IAC3E,MAAM,GAAG,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC;IAC5B,MAAM,MAAM,GAAG,eAAe,CAAC,GAAG,CAAC,CAAC;IACpC,MAAM,IAAI,GAAG,uBAAU,CAAC,GAAG,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;IAC3C,MAAM,WAAW,GAAG,IAAA,8CAAkC,EAAC,IAAI,CAAC,CAAC;IAC7D,MAAM,YAAY,GAAG,YAAY,CAAC,GAAG,CAAC,CAAC;IACvC,MAAM,SAAS,GAAG,IAAA,0BAAe,EAAC,IAAA,4BAAiB,EAAC,CAAC,WAAW,EAAE,YAAY,CAAC,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC;IAChG,OAAO,SAAS,CAAC;AACnB,CAAC;AAED,SAAS,eAAe,CAAC,GAA+B;IACtD,IAAI,KAAiB,CAAC;IACtB,QAAQ,OAAO,GAAG,EAAE,CAAC;QACnB,KAAK,QAAQ,CAAC,CAAC,CAAC;YACd,MAAM,SAAS,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC,EAAE,gBAAgB,CAAC,CAAC;YAClD,KAAK,GAAG,IAAA,4BAAiB,EAAC;gBACxB,IAAA,gCAAqB,EAAC,sBAAU,CAAC,MAAM,CAAC;gBACxC,IAAI,WAAW,EAAE,CAAC,MAAM,CAAC,SAAS,CAAC;gBACnC,IAAA,gCAAqB,EAAC,sBAAU,CAAC,SAAS,CAAC;aAC5C,CAAC,CAAC;YACH,OAAO,KAAK,CAAC;QACf,CAAC;QACD,KAAK,QAAQ,CAAC,CAAC,CAAC;YACd,MAAM,WAAW,GAAG,IAAA,mCAAuB,EAAC,GAAG,CAAC,CAAC;YACjD,KAAK,GAAG,IAAA,4BAAiB,EAAC,CAAC,IAAA,gCAAqB,EAAC,sBAAU,CAAC,MAAM,CAAC,EAAE,WAAW,CAAC,CAAC,CAAC;YACnF,OAAO,KAAK,CAAC;QACf,CAAC;QACD,KAAK,SAAS,CAAC,CAAC,CAAC;YACf,MAAM,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC,sBAAU,CAAC,IAAI,CAAC,CAAC,CAAC,sBAAU,CAAC,KAAK,CAAC;YACxD,OAAO,IAAA,gCAAqB,EAAC,MAAM,CAAC,CAAC;QACvC,CAAC;QACD,KAAK,QAAQ,CAAC,CAAC,CAAC;YACd,IAAI,GAAG,KAAK,IAAI,EAAE,CAAC;gBACjB,OAAO,IAAA,gCAAqB,EAAC,sBAAU,CAAC,IAAI,CAAC,CAAC;YAChD,CAAC;YACD,OAAO,IAAA,gCAAqB,EAAC,sBAAU,CAAC,SAAS,CAAC,CAAC;QACrD,CAAC;QACD,KAAK,WAAW,CAAC,CAAC,CAAC;YACjB,OAAO,IAAA,gCAAqB,EAAC,sBAAU,CAAC,SAAS,CAAC,CAAC;QACrD,CAAC;QACD;YACE,MAAM,IAAI,KAAK,CAAC,oBAAoB,OAAO,GAAG,EAAE,CAAC,CAAC;IACtD,CAAC;AACH,CAAC;AAED,SAAS,YAAY,CAAC,GAA+B;IACnD,QAAQ,OAAO,GAAG,EAAE,CAAC;QACnB,KAAK,QAAQ,CAAC,CAAC,CAAC;YACd,MAAM,SAAS,GAAG,GAAG,CAAC,SAAS,CAAC,CAAC,EAAE,gBAAgB,CAAC,CAAC;YACrD,OAAO,IAAA,wCAA4B,EAAC,SAAS,CAAC,CAAC;QACjD,CAAC;QACD,KAAK,QAAQ,CAAC,CAAC,CAAC;YACd,OAAO,IAAA,8CAAkC,EAAC,GAAG,CAAC,CAAC;QACjD,CAAC;QACD,KAAK,SAAS,CAAC,CAAC,CAAC;YACf,MAAM,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC,sBAAU,CAAC,IAAI,CAAC,CAAC,CAAC,sBAAU,CAAC,KAAK,CAAC;YACxD,OAAO,IAAA,gCAAqB,EAAC,MAAM,CAAC,CAAC;QACvC,CAAC;QACD,KAAK,QAAQ;YACX,IAAI,GAAG,KAAK,IAAI,EAAE,CAAC;gBACjB,OAAO,IAAA,gCAAqB,EAAC,sBAAU,CAAC,IAAI,CAAC,CAAC;YAChD,CAAC;YACD,OAAO,IAAA,gCAAqB,EAAC,sBAAU,CAAC,SAAS,CAAC,CAAC;QACrD,KAAK,WAAW;YACd,OAAO,IAAA,gCAAqB,EAAC,sBAAU,CAAC,SAAS,CAAC,CAAC;QACrD;YACE,MAAM,IAAI,KAAK,CAAC,oBAAoB,OAAO,GAAG,EAAE,CAAC,CAAC;IACtD,CAAC;AACH,CAAC","sourcesContent":["// Copyright (c) Microsoft Corporation.\n// Licensed under the MIT License.\n\nimport { doubleToByteArrayBigInt, writeNumberForBinaryEncodingBigInt } from \"./encoding/number.js\";\nimport { writeStringForBinaryEncoding } from \"./encoding/string.js\";\nimport { BytePrefix } from \"./encoding/prefix.js\";\nimport MurmurHash from \"./murmurHash.js\";\nimport type { PrimitivePartitionKeyValue } from \"../../documents/index.js\";\nimport { concatUint8Arrays, hexStringToUint8Array, uint8ArrayToHex } from \"../uint8.js\";\n\nconst MAX_STRING_CHARS = 100;\n\nexport function hashV1PartitionKey(partitionKey: PrimitivePartitionKeyValue[]): string {\n  const key = partitionKey[0];\n  const toHash = prefixKeyByType(key);\n  const hash = MurmurHash.x86.hash32(toHash);\n  const encodedJSBI = writeNumberForBinaryEncodingBigInt(hash);\n  const encodedValue = encodeByType(key);\n  const finalHash = uint8ArrayToHex(concatUint8Arrays([encodedJSBI, encodedValue])).toUpperCase();\n  return finalHash;\n}\n\nfunction prefixKeyByType(key: PrimitivePartitionKeyValue): Uint8Array {\n  let bytes: Uint8Array;\n  switch (typeof key) {\n    case \"string\": {\n      const truncated = key.substr(0, MAX_STRING_CHARS);\n      bytes = concatUint8Arrays([\n        hexStringToUint8Array(BytePrefix.String),\n        new TextEncoder().encode(truncated),\n        hexStringToUint8Array(BytePrefix.Undefined),\n      ]);\n      return bytes;\n    }\n    case \"number\": {\n      const numberBytes = doubleToByteArrayBigInt(key);\n      bytes = concatUint8Arrays([hexStringToUint8Array(BytePrefix.Number), numberBytes]);\n      return bytes;\n    }\n    case \"boolean\": {\n      const prefix = key ? BytePrefix.True : BytePrefix.False;\n      return hexStringToUint8Array(prefix);\n    }\n    case \"object\": {\n      if (key === null) {\n        return hexStringToUint8Array(BytePrefix.Null);\n      }\n      return hexStringToUint8Array(BytePrefix.Undefined);\n    }\n    case \"undefined\": {\n      return hexStringToUint8Array(BytePrefix.Undefined);\n    }\n    default:\n      throw new Error(`Unexpected type: ${typeof key}`);\n  }\n}\n\nfunction encodeByType(key: PrimitivePartitionKeyValue): Uint8Array {\n  switch (typeof key) {\n    case \"string\": {\n      const truncated = key.substring(0, MAX_STRING_CHARS);\n      return writeStringForBinaryEncoding(truncated);\n    }\n    case \"number\": {\n      return writeNumberForBinaryEncodingBigInt(key);\n    }\n    case \"boolean\": {\n      const prefix = key ? BytePrefix.True : BytePrefix.False;\n      return hexStringToUint8Array(prefix);\n    }\n    case \"object\":\n      if (key === null) {\n        return hexStringToUint8Array(BytePrefix.Null);\n      }\n      return hexStringToUint8Array(BytePrefix.Undefined);\n    case \"undefined\":\n      return hexStringToUint8Array(BytePrefix.Undefined);\n    default:\n      throw new Error(`Unexpected type: ${typeof key}`);\n  }\n}\n"]}
+{
+  "version": 3,
+  "sources": ["/mnt/vss/_work/1/s/sdk/cosmosdb/cosmos/src/utils/hashing/v1.ts"],
+  "sourcesContent": ["// Copyright (c) Microsoft Corporation.\n// Licensed under the MIT License.\n\nimport { doubleToByteArrayBigInt, writeNumberForBinaryEncodingBigInt } from \"./encoding/number.js\";\nimport { writeStringForBinaryEncoding } from \"./encoding/string.js\";\nimport { BytePrefix } from \"./encoding/prefix.js\";\nimport MurmurHash from \"./murmurHash.js\";\nimport type { PrimitivePartitionKeyValue } from \"../../documents/index.js\";\nimport { concatUint8Arrays, hexStringToUint8Array, uint8ArrayToHex } from \"../uint8.js\";\n\nconst MAX_STRING_CHARS = 100;\n\nexport function hashV1PartitionKey(partitionKey: PrimitivePartitionKeyValue[]): string {\n  const key = partitionKey[0];\n  const toHash = prefixKeyByType(key);\n  const hash = MurmurHash.x86.hash32(toHash);\n  const encodedJSBI = writeNumberForBinaryEncodingBigInt(hash);\n  const encodedValue = encodeByType(key);\n  const finalHash = uint8ArrayToHex(concatUint8Arrays([encodedJSBI, encodedValue])).toUpperCase();\n  return finalHash;\n}\n\nfunction prefixKeyByType(key: PrimitivePartitionKeyValue): Uint8Array {\n  let bytes: Uint8Array;\n  switch (typeof key) {\n    case \"string\": {\n      const truncated = key.substr(0, MAX_STRING_CHARS);\n      bytes = concatUint8Arrays([\n        hexStringToUint8Array(BytePrefix.String),\n        new TextEncoder().encode(truncated),\n        hexStringToUint8Array(BytePrefix.Undefined),\n      ]);\n      return bytes;\n    }\n    case \"number\": {\n      const numberBytes = doubleToByteArrayBigInt(key);\n      bytes = concatUint8Arrays([hexStringToUint8Array(BytePrefix.Number), numberBytes]);\n      return bytes;\n    }\n    case \"boolean\": {\n      const prefix = key ? BytePrefix.True : BytePrefix.False;\n      return hexStringToUint8Array(prefix);\n    }\n    case \"object\": {\n      if (key === null) {\n        return hexStringToUint8Array(BytePrefix.Null);\n      }\n      return hexStringToUint8Array(BytePrefix.Undefined);\n    }\n    case \"undefined\": {\n      return hexStringToUint8Array(BytePrefix.Undefined);\n    }\n    default:\n      throw new Error(`Unexpected type: ${typeof key}`);\n  }\n}\n\nfunction encodeByType(key: PrimitivePartitionKeyValue): Uint8Array {\n  switch (typeof key) {\n    case \"string\": {\n      const truncated = key.substring(0, MAX_STRING_CHARS);\n      return writeStringForBinaryEncoding(truncated);\n    }\n    case \"number\": {\n      return writeNumberForBinaryEncodingBigInt(key);\n    }\n    case \"boolean\": {\n      const prefix = key ? BytePrefix.True : BytePrefix.False;\n      return hexStringToUint8Array(prefix);\n    }\n    case \"object\":\n      if (key === null) {\n        return hexStringToUint8Array(BytePrefix.Null);\n      }\n      return hexStringToUint8Array(BytePrefix.Undefined);\n    case \"undefined\":\n      return hexStringToUint8Array(BytePrefix.Undefined);\n    default:\n      throw new Error(`Unexpected type: ${typeof key}`);\n  }\n}\n"],
+  "mappings": ";;;;;;;;;;;;;;;;;;;;;;;;;;;AAAA;AAAA;AAAA;AAAA;AAAA;AAGA,oBAA4E;AAC5E,oBAA6C;AAC7C,oBAA2B;AAC3B,wBAAuB;AAEvB,mBAA0E;AAE1E,MAAM,mBAAmB;AAElB,SAAS,mBAAmB,cAAoD;AACrF,QAAM,MAAM,aAAa,CAAC;AAC1B,QAAM,SAAS,gBAAgB,GAAG;AAClC,QAAM,OAAO,kBAAAA,QAAW,IAAI,OAAO,MAAM;AACzC,QAAM,kBAAc,kDAAmC,IAAI;AAC3D,QAAM,eAAe,aAAa,GAAG;AACrC,QAAM,gBAAY,kCAAgB,gCAAkB,CAAC,aAAa,YAAY,CAAC,CAAC,EAAE,YAAY;AAC9F,SAAO;AACT;AAEA,SAAS,gBAAgB,KAA6C;AACpE,MAAI;AACJ,UAAQ,OAAO,KAAK;AAAA,IAClB,KAAK,UAAU;AACb,YAAM,YAAY,IAAI,OAAO,GAAG,gBAAgB;AAChD,kBAAQ,gCAAkB;AAAA,YACxB,oCAAsB,yBAAW,MAAM;AAAA,QACvC,IAAI,YAAY,EAAE,OAAO,SAAS;AAAA,YAClC,oCAAsB,yBAAW,SAAS;AAAA,MAC5C,CAAC;AACD,aAAO;AAAA,IACT;AAAA,IACA,KAAK,UAAU;AACb,YAAM,kBAAc,uCAAwB,GAAG;AAC/C,kBAAQ,gCAAkB,KAAC,oCAAsB,yBAAW,MAAM,GAAG,WAAW,CAAC;AACjF,aAAO;AAAA,IACT;AAAA,IACA,KAAK,WAAW;AACd,YAAM,SAAS,MAAM,yBAAW,OAAO,yBAAW;AAClD,iBAAO,oCAAsB,MAAM;AAAA,IACrC;AAAA,IACA,KAAK,UAAU;AACb,UAAI,QAAQ,MAAM;AAChB,mBAAO,oCAAsB,yBAAW,IAAI;AAAA,MAC9C;AACA,iBAAO,oCAAsB,yBAAW,SAAS;AAAA,IACnD;AAAA,IACA,KAAK,aAAa;AAChB,iBAAO,oCAAsB,yBAAW,SAAS;AAAA,IACnD;AAAA,IACA;AACE,YAAM,IAAI,MAAM,oBAAoB,OAAO,GAAG,EAAE;AAAA,EACpD;AACF;AAEA,SAAS,aAAa,KAA6C;AACjE,UAAQ,OAAO,KAAK;AAAA,IAClB,KAAK,UAAU;AACb,YAAM,YAAY,IAAI,UAAU,GAAG,gBAAgB;AACnD,iBAAO,4CAA6B,SAAS;AAAA,IAC/C;AAAA,IACA,KAAK,UAAU;AACb,iBAAO,kDAAmC,GAAG;AAAA,IAC/C;AAAA,IACA,KAAK,WAAW;AACd,YAAM,SAAS,MAAM,yBAAW,OAAO,yBAAW;AAClD,iBAAO,oCAAsB,MAAM;AAAA,IACrC;AAAA,IACA,KAAK;AACH,UAAI,QAAQ,MAAM;AAChB,mBAAO,oCAAsB,yBAAW,IAAI;AAAA,MAC9C;AACA,iBAAO,oCAAsB,yBAAW,SAAS;AAAA,IACnD,KAAK;AACH,iBAAO,oCAAsB,yBAAW,SAAS;AAAA,IACnD;AACE,YAAM,IAAI,MAAM,oBAAoB,OAAO,GAAG,EAAE;AAAA,EACpD;AACF;",
+  "names": ["MurmurHash"]
+}

package/dist/commonjs/utils/hashing/v2.js CHANGED Viewed

@@ -1,70 +1,90 @@
-"use strict";
-// Copyright (c) Microsoft Corporation.
-// Licensed under the MIT License.
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.hashV2PartitionKey = hashV2PartitionKey;
-exports.reverse = reverse;
-const tslib_1 = require("tslib");
-const number_js_1 = require("./encoding/number.js");
-const prefix_js_1 = require("./encoding/prefix.js");
-const murmurHash_js_1 = tslib_1.__importDefault(require("./murmurHash.js"));
-const uint8_js_1 = require("../uint8.js");
+var __create = Object.create;
+var __defProp = Object.defineProperty;
+var __getOwnPropDesc = Object.getOwnPropertyDescriptor;
+var __getOwnPropNames = Object.getOwnPropertyNames;
+var __getProtoOf = Object.getPrototypeOf;
+var __hasOwnProp = Object.prototype.hasOwnProperty;
+var __export = (target, all) => {
+  for (var name in all)
+    __defProp(target, name, { get: all[name], enumerable: true });
+};
+var __copyProps = (to, from, except, desc) => {
+  if (from && typeof from === "object" || typeof from === "function") {
+    for (let key of __getOwnPropNames(from))
+      if (!__hasOwnProp.call(to, key) && key !== except)
+        __defProp(to, key, { get: () => from[key], enumerable: !(desc = __getOwnPropDesc(from, key)) || desc.enumerable });
+  }
+  return to;
+};
+var __toESM = (mod, isNodeMode, target) => (target = mod != null ? __create(__getProtoOf(mod)) : {}, __copyProps(
+  // If the importer is in node compatibility mode or this is not an ESM
+  // file that has been converted to a CommonJS file using a Babel-
+  // compatible transform (i.e. "__esModule" has not been set), then set
+  // "default" to the CommonJS "module.exports" for node compatibility.
+  isNodeMode || !mod || !mod.__esModule ? __defProp(target, "default", { value: mod, enumerable: true }) : target,
+  mod
+));
+var __toCommonJS = (mod) => __copyProps(__defProp({}, "__esModule", { value: true }), mod);
+var v2_exports = {};
+__export(v2_exports, {
+  hashV2PartitionKey: () => hashV2PartitionKey,
+  reverse: () => reverse
+});
+module.exports = __toCommonJS(v2_exports);
+var import_number = require("./encoding/number.js");
+var import_prefix = require("./encoding/prefix.js");
+var import_murmurHash = __toESM(require("./murmurHash.js"));
+var import_uint8 = require("../uint8.js");
 function hashV2PartitionKey(partitionKey) {
-    // Create a single Uint8Array from the concatenated prefixes for each partition key value.
-    const toHash = (0, uint8_js_1.concatUint8Arrays)(partitionKey.map(prefixKeyByType));
-    // Compute the 128-bit hash. This returns a hex string.
-    const hash = murmurHash_js_1.default.x64.hash128(toHash);
-    // Convert the hex string hash to a Uint8Array and reverse it.
-    const reverseBuff = reverse((0, uint8_js_1.hexStringToUint8Array)(hash));
-    // Mask the first byte as required.
-    reverseBuff[0] &= 0x3f;
-    // Convert the reversed buffer back to a hex string, uppercase it, and return.
-    return (0, uint8_js_1.uint8ArrayToHex)(reverseBuff).toUpperCase();
+  const toHash = (0, import_uint8.concatUint8Arrays)(partitionKey.map(prefixKeyByType));
+  const hash = import_murmurHash.default.x64.hash128(toHash);
+  const reverseBuff = reverse((0, import_uint8.hexStringToUint8Array)(hash));
+  reverseBuff[0] &= 63;
+  return (0, import_uint8.uint8ArrayToHex)(reverseBuff).toUpperCase();
 }
 function prefixKeyByType(key) {
-    let bytes;
-    switch (typeof key) {
-        case "string": {
-            // For strings, concatenate:
-            // - The hex prefix for String
-            // - The UTF-8 bytes for the key (using Uint8Array.from should work for string iterables; alternatively use an encoder)
-            // - The hex prefix for Infinity
-            bytes = (0, uint8_js_1.concatUint8Arrays)([
-                (0, uint8_js_1.hexStringToUint8Array)(prefix_js_1.BytePrefix.String),
-                new TextEncoder().encode(key),
-                (0, uint8_js_1.hexStringToUint8Array)(prefix_js_1.BytePrefix.Infinity),
-            ]);
-            return bytes;
-        }
-        case "number": {
-            const numberBytes = (0, number_js_1.doubleToByteArrayBigInt)(key);
-            bytes = (0, uint8_js_1.concatUint8Arrays)([(0, uint8_js_1.hexStringToUint8Array)(prefix_js_1.BytePrefix.Number), numberBytes]);
-            return bytes;
-        }
-        case "boolean": {
-            const prefix = key ? prefix_js_1.BytePrefix.True : prefix_js_1.BytePrefix.False;
-            return (0, uint8_js_1.hexStringToUint8Array)(prefix);
-        }
-        case "object": {
-            if (key === null) {
-                return (0, uint8_js_1.hexStringToUint8Array)(prefix_js_1.BytePrefix.Null);
-            }
-            return (0, uint8_js_1.hexStringToUint8Array)(prefix_js_1.BytePrefix.Undefined);
-        }
-        case "undefined": {
-            return (0, uint8_js_1.hexStringToUint8Array)(prefix_js_1.BytePrefix.Undefined);
-        }
-        default:
-            throw new Error(`Unexpected type: ${typeof key}`);
+  let bytes;
+  switch (typeof key) {
+    case "string": {
+      bytes = (0, import_uint8.concatUint8Arrays)([
+        (0, import_uint8.hexStringToUint8Array)(import_prefix.BytePrefix.String),
+        new TextEncoder().encode(key),
+        (0, import_uint8.hexStringToUint8Array)(import_prefix.BytePrefix.Infinity)
+      ]);
+      return bytes;
     }
+    case "number": {
+      const numberBytes = (0, import_number.doubleToByteArrayBigInt)(key);
+      bytes = (0, import_uint8.concatUint8Arrays)([(0, import_uint8.hexStringToUint8Array)(import_prefix.BytePrefix.Number), numberBytes]);
+      return bytes;
+    }
+    case "boolean": {
+      const prefix = key ? import_prefix.BytePrefix.True : import_prefix.BytePrefix.False;
+      return (0, import_uint8.hexStringToUint8Array)(prefix);
+    }
+    case "object": {
+      if (key === null) {
+        return (0, import_uint8.hexStringToUint8Array)(import_prefix.BytePrefix.Null);
+      }
+      return (0, import_uint8.hexStringToUint8Array)(import_prefix.BytePrefix.Undefined);
+    }
+    case "undefined": {
+      return (0, import_uint8.hexStringToUint8Array)(import_prefix.BytePrefix.Undefined);
+    }
+    default:
+      throw new Error(`Unexpected type: ${typeof key}`);
+  }
 }
 function reverse(buff) {
-    // Replace Uint8Array.allocUnsafe(buff.length) with new Uint8Array(buff.length)
-    const uint8array = new Uint8Array(buff.length);
-    for (let i = 0, j = buff.length - 1; i <= j; ++i, --j) {
-        uint8array[i] = buff[j];
-        uint8array[j] = buff[i];
-    }
-    return uint8array;
+  const uint8array = new Uint8Array(buff.length);
+  for (let i = 0, j = buff.length - 1; i <= j; ++i, --j) {
+    uint8array[i] = buff[j];
+    uint8array[j] = buff[i];
+  }
+  return uint8array;
 }
-//# sourceMappingURL=v2.js.map
+// Annotate the CommonJS export names for ESM import in node:
+0 && (module.exports = {
+  hashV2PartitionKey,
+  reverse
+});

package/dist/commonjs/utils/hashing/v2.js.map CHANGED Viewed

@@ -1 +1,7 @@
-{"version":3,"file":"v2.js","sourceRoot":"","sources":["../../../../src/utils/hashing/v2.ts"],"names":[],"mappings":";AAAA,uCAAuC;AACvC,kCAAkC;;AAQlC,gDAeC;AAwCD,0BAQC;;AApED,oDAA+D;AAC/D,oDAAkD;AAClD,4EAAyC;AACzC,0CAAwF;AAExF,SAAgB,kBAAkB,CAAC,YAA0C;IAC3E,0FAA0F;IAC1F,MAAM,MAAM,GAAe,IAAA,4BAAiB,EAAC,YAAY,CAAC,GAAG,CAAC,eAAe,CAAC,CAAC,CAAC;IAEhF,uDAAuD;IACvD,MAAM,IAAI,GAAG,uBAAU,CAAC,GAAG,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;IAE5C,8DAA8D;IAC9D,MAAM,WAAW,GAAe,OAAO,CAAC,IAAA,gCAAqB,EAAC,IAAI,CAAC,CAAC,CAAC;IAErE,mCAAmC;IACnC,WAAW,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC;IAEvB,8EAA8E;IAC9E,OAAO,IAAA,0BAAe,EAAC,WAAW,CAAC,CAAC,WAAW,EAAE,CAAC;AACpD,CAAC;AAED,SAAS,eAAe,CAAC,GAA+B;IACtD,IAAI,KAAiB,CAAC;IACtB,QAAQ,OAAO,GAAG,EAAE,CAAC;QACnB,KAAK,QAAQ,CAAC,CAAC,CAAC;YACd,4BAA4B;YAC5B,8BAA8B;YAC9B,uHAAuH;YACvH,gCAAgC;YAChC,KAAK,GAAG,IAAA,4BAAiB,EAAC;gBACxB,IAAA,gCAAqB,EAAC,sBAAU,CAAC,MAAM,CAAC;gBACxC,IAAI,WAAW,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC;gBAC7B,IAAA,gCAAqB,EAAC,sBAAU,CAAC,QAAQ,CAAC;aAC3C,CAAC,CAAC;YACH,OAAO,KAAK,CAAC;QACf,CAAC;QACD,KAAK,QAAQ,CAAC,CAAC,CAAC;YACd,MAAM,WAAW,GAAG,IAAA,mCAAuB,EAAC,GAAG,CAAC,CAAC;YACjD,KAAK,GAAG,IAAA,4BAAiB,EAAC,CAAC,IAAA,gCAAqB,EAAC,sBAAU,CAAC,MAAM,CAAC,EAAE,WAAW,CAAC,CAAC,CAAC;YACnF,OAAO,KAAK,CAAC;QACf,CAAC;QACD,KAAK,SAAS,CAAC,CAAC,CAAC;YACf,MAAM,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC,sBAAU,CAAC,IAAI,CAAC,CAAC,CAAC,sBAAU,CAAC,KAAK,CAAC;YACxD,OAAO,IAAA,gCAAqB,EAAC,MAAM,CAAC,CAAC;QACvC,CAAC;QACD,KAAK,QAAQ,CAAC,CAAC,CAAC;YACd,IAAI,GAAG,KAAK,IAAI,EAAE,CAAC;gBACjB,OAAO,IAAA,gCAAqB,EAAC,sBAAU,CAAC,IAAI,CAAC,CAAC;YAChD,CAAC;YACD,OAAO,IAAA,gCAAqB,EAAC,sBAAU,CAAC,SAAS,CAAC,CAAC;QACrD,CAAC;QACD,KAAK,WAAW,CAAC,CAAC,CAAC;YACjB,OAAO,IAAA,gCAAqB,EAAC,sBAAU,CAAC,SAAS,CAAC,CAAC;QACrD,CAAC;QACD;YACE,MAAM,IAAI,KAAK,CAAC,oBAAoB,OAAO,GAAG,EAAE,CAAC,CAAC;IACtD,CAAC;AACH,CAAC;AAED,SAAgB,OAAO,CAAC,IAAgB;IACtC,+EAA+E;IAC/E,MAAM,UAAU,GAAG,IAAI,UAAU,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IAC/C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC;QACtD,UAAU,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;QACxB,UAAU,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;IAC1B,CAAC;IACD,OAAO,UAAU,CAAC;AACpB,CAAC","sourcesContent":["// Copyright (c) Microsoft Corporation.\n// Licensed under the MIT License.\n\nimport type { PrimitivePartitionKeyValue } from \"../../documents/index.js\";\nimport { doubleToByteArrayBigInt } from \"./encoding/number.js\";\nimport { BytePrefix } from \"./encoding/prefix.js\";\nimport MurmurHash from \"./murmurHash.js\";\nimport { concatUint8Arrays, hexStringToUint8Array, uint8ArrayToHex } from \"../uint8.js\";\n\nexport function hashV2PartitionKey(partitionKey: PrimitivePartitionKeyValue[]): string {\n  // Create a single Uint8Array from the concatenated prefixes for each partition key value.\n  const toHash: Uint8Array = concatUint8Arrays(partitionKey.map(prefixKeyByType));\n\n  // Compute the 128-bit hash. This returns a hex string.\n  const hash = MurmurHash.x64.hash128(toHash);\n\n  // Convert the hex string hash to a Uint8Array and reverse it.\n  const reverseBuff: Uint8Array = reverse(hexStringToUint8Array(hash));\n\n  // Mask the first byte as required.\n  reverseBuff[0] &= 0x3f;\n\n  // Convert the reversed buffer back to a hex string, uppercase it, and return.\n  return uint8ArrayToHex(reverseBuff).toUpperCase();\n}\n\nfunction prefixKeyByType(key: PrimitivePartitionKeyValue): Uint8Array {\n  let bytes: Uint8Array;\n  switch (typeof key) {\n    case \"string\": {\n      // For strings, concatenate:\n      // - The hex prefix for String\n      // - The UTF-8 bytes for the key (using Uint8Array.from should work for string iterables; alternatively use an encoder)\n      // - The hex prefix for Infinity\n      bytes = concatUint8Arrays([\n        hexStringToUint8Array(BytePrefix.String),\n        new TextEncoder().encode(key),\n        hexStringToUint8Array(BytePrefix.Infinity),\n      ]);\n      return bytes;\n    }\n    case \"number\": {\n      const numberBytes = doubleToByteArrayBigInt(key);\n      bytes = concatUint8Arrays([hexStringToUint8Array(BytePrefix.Number), numberBytes]);\n      return bytes;\n    }\n    case \"boolean\": {\n      const prefix = key ? BytePrefix.True : BytePrefix.False;\n      return hexStringToUint8Array(prefix);\n    }\n    case \"object\": {\n      if (key === null) {\n        return hexStringToUint8Array(BytePrefix.Null);\n      }\n      return hexStringToUint8Array(BytePrefix.Undefined);\n    }\n    case \"undefined\": {\n      return hexStringToUint8Array(BytePrefix.Undefined);\n    }\n    default:\n      throw new Error(`Unexpected type: ${typeof key}`);\n  }\n}\n\nexport function reverse(buff: Uint8Array): Uint8Array {\n  // Replace Uint8Array.allocUnsafe(buff.length) with new Uint8Array(buff.length)\n  const uint8array = new Uint8Array(buff.length);\n  for (let i = 0, j = buff.length - 1; i <= j; ++i, --j) {\n    uint8array[i] = buff[j];\n    uint8array[j] = buff[i];\n  }\n  return uint8array;\n}\n"]}
+{
+  "version": 3,
+  "sources": ["/mnt/vss/_work/1/s/sdk/cosmosdb/cosmos/src/utils/hashing/v2.ts"],
+  "sourcesContent": ["// Copyright (c) Microsoft Corporation.\n// Licensed under the MIT License.\n\nimport type { PrimitivePartitionKeyValue } from \"../../documents/index.js\";\nimport { doubleToByteArrayBigInt } from \"./encoding/number.js\";\nimport { BytePrefix } from \"./encoding/prefix.js\";\nimport MurmurHash from \"./murmurHash.js\";\nimport { concatUint8Arrays, hexStringToUint8Array, uint8ArrayToHex } from \"../uint8.js\";\n\nexport function hashV2PartitionKey(partitionKey: PrimitivePartitionKeyValue[]): string {\n  // Create a single Uint8Array from the concatenated prefixes for each partition key value.\n  const toHash: Uint8Array = concatUint8Arrays(partitionKey.map(prefixKeyByType));\n\n  // Compute the 128-bit hash. This returns a hex string.\n  const hash = MurmurHash.x64.hash128(toHash);\n\n  // Convert the hex string hash to a Uint8Array and reverse it.\n  const reverseBuff: Uint8Array = reverse(hexStringToUint8Array(hash));\n\n  // Mask the first byte as required.\n  reverseBuff[0] &= 0x3f;\n\n  // Convert the reversed buffer back to a hex string, uppercase it, and return.\n  return uint8ArrayToHex(reverseBuff).toUpperCase();\n}\n\nfunction prefixKeyByType(key: PrimitivePartitionKeyValue): Uint8Array {\n  let bytes: Uint8Array;\n  switch (typeof key) {\n    case \"string\": {\n      // For strings, concatenate:\n      // - The hex prefix for String\n      // - The UTF-8 bytes for the key (using Uint8Array.from should work for string iterables; alternatively use an encoder)\n      // - The hex prefix for Infinity\n      bytes = concatUint8Arrays([\n        hexStringToUint8Array(BytePrefix.String),\n        new TextEncoder().encode(key),\n        hexStringToUint8Array(BytePrefix.Infinity),\n      ]);\n      return bytes;\n    }\n    case \"number\": {\n      const numberBytes = doubleToByteArrayBigInt(key);\n      bytes = concatUint8Arrays([hexStringToUint8Array(BytePrefix.Number), numberBytes]);\n      return bytes;\n    }\n    case \"boolean\": {\n      const prefix = key ? BytePrefix.True : BytePrefix.False;\n      return hexStringToUint8Array(prefix);\n    }\n    case \"object\": {\n      if (key === null) {\n        return hexStringToUint8Array(BytePrefix.Null);\n      }\n      return hexStringToUint8Array(BytePrefix.Undefined);\n    }\n    case \"undefined\": {\n      return hexStringToUint8Array(BytePrefix.Undefined);\n    }\n    default:\n      throw new Error(`Unexpected type: ${typeof key}`);\n  }\n}\n\nexport function reverse(buff: Uint8Array): Uint8Array {\n  // Replace Uint8Array.allocUnsafe(buff.length) with new Uint8Array(buff.length)\n  const uint8array = new Uint8Array(buff.length);\n  for (let i = 0, j = buff.length - 1; i <= j; ++i, --j) {\n    uint8array[i] = buff[j];\n    uint8array[j] = buff[i];\n  }\n  return uint8array;\n}\n"],
+  "mappings": ";;;;;;;;;;;;;;;;;;;;;;;;;;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAIA,oBAAwC;AACxC,oBAA2B;AAC3B,wBAAuB;AACvB,mBAA0E;AAEnE,SAAS,mBAAmB,cAAoD;AAErF,QAAM,aAAqB,gCAAkB,aAAa,IAAI,eAAe,CAAC;AAG9E,QAAM,OAAO,kBAAAA,QAAW,IAAI,QAAQ,MAAM;AAG1C,QAAM,cAA0B,YAAQ,oCAAsB,IAAI,CAAC;AAGnE,cAAY,CAAC,KAAK;AAGlB,aAAO,8BAAgB,WAAW,EAAE,YAAY;AAClD;AAEA,SAAS,gBAAgB,KAA6C;AACpE,MAAI;AACJ,UAAQ,OAAO,KAAK;AAAA,IAClB,KAAK,UAAU;AAKb,kBAAQ,gCAAkB;AAAA,YACxB,oCAAsB,yBAAW,MAAM;AAAA,QACvC,IAAI,YAAY,EAAE,OAAO,GAAG;AAAA,YAC5B,oCAAsB,yBAAW,QAAQ;AAAA,MAC3C,CAAC;AACD,aAAO;AAAA,IACT;AAAA,IACA,KAAK,UAAU;AACb,YAAM,kBAAc,uCAAwB,GAAG;AAC/C,kBAAQ,gCAAkB,KAAC,oCAAsB,yBAAW,MAAM,GAAG,WAAW,CAAC;AACjF,aAAO;AAAA,IACT;AAAA,IACA,KAAK,WAAW;AACd,YAAM,SAAS,MAAM,yBAAW,OAAO,yBAAW;AAClD,iBAAO,oCAAsB,MAAM;AAAA,IACrC;AAAA,IACA,KAAK,UAAU;AACb,UAAI,QAAQ,MAAM;AAChB,mBAAO,oCAAsB,yBAAW,IAAI;AAAA,MAC9C;AACA,iBAAO,oCAAsB,yBAAW,SAAS;AAAA,IACnD;AAAA,IACA,KAAK,aAAa;AAChB,iBAAO,oCAAsB,yBAAW,SAAS;AAAA,IACnD;AAAA,IACA;AACE,YAAM,IAAI,MAAM,oBAAoB,OAAO,GAAG,EAAE;AAAA,EACpD;AACF;AAEO,SAAS,QAAQ,MAA8B;AAEpD,QAAM,aAAa,IAAI,WAAW,KAAK,MAAM;AAC7C,WAAS,IAAI,GAAG,IAAI,KAAK,SAAS,GAAG,KAAK,GAAG,EAAE,GAAG,EAAE,GAAG;AACrD,eAAW,CAAC,IAAI,KAAK,CAAC;AACtB,eAAW,CAAC,IAAI,KAAK,CAAC;AAAA,EACxB;AACA,SAAO;AACT;",
+  "names": ["MurmurHash"]
+}