npm - @vicin/sigil - Versions diffs - 2.0.1 → 2.0.3 - Mend

@vicin/sigil 2.0.1 → 2.0.3

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 (7) hide show

package/dist/index.global.js.map CHANGED Viewed

	@@ -1 +1 @@
1	- {"version":3,"sources":["../src/core/options.ts","../src/core/symbols.ts","../node_modules/@noble/hashes/src/_u64.ts","../node_modules/@noble/hashes/src/utils.ts","../node_modules/@noble/hashes/src/sha3.ts","../node_modules/bignumber.js/bignumber.mjs","../node_modules/@paralleldrive/cuid2/src/index.js","../src/core/constants.ts","../src/core/helpers.ts","../src/core/mixin.ts","../src/core/classes.ts","../src/core/decorator.ts","../src/core/enhancers.ts"],"names":["BigNumber","alphabet","compare","format","ctor"],"mappings":";;;;;;;;EAoDO,IAAM,OAAA,GAAkC;EAAA,EAC7C,eAAA,EAAiB,IAAA;EAAA,EACjB,yBAAA,EAA2B,KAAA;EAAA,EAC3B,cAAA,EAAgB;EAClB,CAAA;AAQO,MAAM,aAAA,GAAgB,CAAC,IAAA,KAA6B;EACzD,EAAA,KAAA,MAAW,CAAC,CAAA,EAAG,CAAC,CAAA,IAAK,MAAA,CAAO,OAAA,CAAQ,IAAI,CAAA,EAAI,OAAA,CAAgB,CAAC,CAAA,GAAI,CAAA;EACnE;EAOA,IAAM,eAAA,GAA0C;EAAA,EAC9C,eAAA,EAAiB,IAAA;EAAA,EACjB,yBAAA,EAA2B,KAAA;EAAA,EAC3B,cAAA,EAAgB;EAClB,CAAA;EAGA,aAAA,CAAc,eAAe,CAAA;AAatB,MAAM,mBAAA,GAAsB;;;ECpF5B,IAAM,SAAA,mBAAY,MAAA,CAAO,GAAA,CAAI,kBAAkB,CAAA;EAW/C,IAAM,cAAA,mBAAiB,MAAA,CAAO,GAAA,CAAI,uBAAuB,CAAA;EAWzD,IAAM,aAAA,mBAAgB,MAAA,CAAO,GAAA,CAAI,sBAAsB,CAAA;EAUvD,IAAM,uBAAA,mBAA0B,MAAA,CAAO,GAAA,CAAI,gCAAgC,CAAA;EAU3E,IAAM,SAAA,mBAAY,MAAA,CAAO,GAAA,CAAI,kBAAkB,CAAA;EAU/C,IAAM,iBAAA,mBAAoB,MAAA,CAAO,GAAA,CAAI,0BAA0B,CAAA;EAU/D,IAAM,aAAA,mBAAgB,MAAA,CAAO,GAAA,CAAI,sBAAsB,CAAA;;;EClE9D,IAAM,UAAA,mBAA6B,MAAA,CAAO,CAAA,IAAK,EAAA,GAAK,CAAC,CAAA;EACrD,IAAM,IAAA,0BAA8B,EAAE,CAAA;EAEtC,SAAS,OAAA,CACP,CAAA,EACA,EAAA,GAAK,KAAA,EAAK;EAKV,EAAA,IAAI,EAAA;EAAI,IAAA,OAAO,EAAE,CAAA,EAAG,MAAA,CAAO,CAAA,GAAI,UAAU,CAAA,EAAG,CAAA,EAAG,MAAA,CAAQ,CAAA,IAAK,IAAA,GAAQ,UAAU,CAAA,EAAC;EAC/E,EAAA,OAAO,EAAE,CAAA,EAAG,MAAA,CAAQ,CAAA,IAAK,IAAA,GAAQ,UAAU,CAAA,GAAI,CAAA,EAAG,CAAA,EAAG,MAAA,CAAO,CAAA,GAAI,UAAU,IAAI,CAAA,EAAC;EACjF;EAEA,SAAS,KAAA,CAAM,GAAA,EAAe,EAAA,GAAK,KAAA,EAAK;EACtC,EAAA,MAAM,MAAM,GAAA,CAAI,MAAA;EAChB,EAAA,IAAI,EAAA,GAAK,IAAI,WAAA,CAAY,GAAG,CAAA;EAC5B,EAAA,IAAI,EAAA,GAAK,IAAI,WAAA,CAAY,GAAG,CAAA;EAC5B,EAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,GAAA,EAAK,CAAA,EAAA,EAAK;EAC5B,IAAA,MAAM,EAAE,GAAG,CAAA,EAAC,GAAK,QAAQ,GAAA,CAAI,CAAC,GAAG,EAAE,CAAA;EACnC,IAAA,CAAC,EAAA,CAAG,CAAC,CAAA,EAAG,EAAA,CAAG,CAAC,CAAC,CAAA,GAAI,CAAC,CAAA,EAAG,CAAC,CAAA;EACxB,EAAA;EACA,EAAA,OAAO,CAAC,IAAI,EAAE,CAAA;EAChB;EAgBA,IAAM,MAAA,GAAS,CAAC,CAAA,EAAW,CAAA,EAAW,MAAuB,CAAA,IAAK,CAAA,GAAM,MAAO,EAAA,GAAK,CAAA;EACpF,IAAM,MAAA,GAAS,CAAC,CAAA,EAAW,CAAA,EAAW,MAAuB,CAAA,IAAK,CAAA,GAAM,MAAO,EAAA,GAAK,CAAA;EAEpF,IAAM,MAAA,GAAS,CAAC,CAAA,EAAW,CAAA,EAAW,MAAuB,CAAA,IAAM,CAAA,GAAI,EAAA,GAAQ,CAAA,KAAO,EAAA,GAAK,CAAA;EAC3F,IAAM,MAAA,GAAS,CAAC,CAAA,EAAW,CAAA,EAAW,MAAuB,CAAA,IAAM,CAAA,GAAI,EAAA,GAAQ,CAAA,KAAO,EAAA,GAAK,CAAA;;;EC1CrF,SAAU,QAAQ,CAAA,EAAU;EAChC,EAAA,OAAO,CAAA,YAAa,cAAe,WAAA,CAAY,MAAA,CAAO,CAAC,CAAA,IAAK,CAAA,CAAE,YAAY,IAAA,KAAS,YAAA;EACrF;EAGM,SAAU,OAAA,CAAQ,CAAA,EAAW,KAAA,GAAgB,EAAA,EAAE;EACnD,EAAA,IAAI,CAAC,MAAA,CAAO,aAAA,CAAc,CAAC,CAAA,IAAK,IAAI,CAAA,EAAG;EACrC,IAAA,MAAM,MAAA,GAAS,KAAA,IAAS,CAAA,CAAA,EAAI,KAAK,CAAA,EAAA,CAAA;EACjC,IAAA,MAAM,IAAI,KAAA,CAAM,CAAA,EAAG,MAAM,CAAA,2BAAA,EAA8B,CAAC,CAAA,CAAE,CAAA;EAC5D,EAAA;EACF;EAGM,SAAU,MAAA,CAAO,KAAA,EAAmB,MAAA,EAAiB,KAAA,GAAgB,EAAA,EAAE;EAC3E,EAAA,MAAM,KAAA,GAAQ,QAAQ,KAAK,CAAA;EAC3B,EAAA,MAAM,MAAM,KAAA,IAAA,IAAA,GAAA,MAAA,GAAA,KAAA,CAAO,MAAA;EACnB,EAAA,MAAM,WAAW,MAAA,KAAW,MAAA;EAC5B,EAAA,IAAI,CAAC,KAAA,IAAU,QAAoB,EAAS;EAC1C,IAAA,MAAM,MAAA,GAAS,KAAA,IAAS,CAAA,CAAA,EAAI,KAAK,CAAA,EAAA,CAAA;EACjC,IAAA,MAAM,KAAA,GAA4C,EAAA;EAClD,IAAA,MAAM,MAAM,KAAA,GAAQ,CAAA,OAAA,EAAU,GAAG,CAAA,CAAA,GAAK,CAAA,KAAA,EAAQ,OAAO,KAAK,CAAA,CAAA;EAC1D,IAAA,MAAM,IAAI,KAAA,CAAM,MAAA,GAAS,qBAAA,GAAwB,KAAA,GAAQ,WAAW,GAAG,CAAA;EACzE,EAAA;EACA,EAAA,OAAO,KAAA;EACT;EAWM,SAAU,OAAA,CAAQ,QAAA,EAAe,aAAA,GAAgB,IAAA,EAAI;EACzD,EAAA,IAAI,QAAA,CAAS,SAAA;EAAW,IAAA,MAAM,IAAI,MAAM,kCAAkC,CAAA;EAC1E,EAAA,IAAI,iBAAiB,QAAA,CAAS,QAAA;EAAU,IAAA,MAAM,IAAI,MAAM,uCAAuC,CAAA;EACjG;EAGM,SAAU,OAAA,CAAQ,KAAU,QAAA,EAAa;EAC7C,EAAA,MAAA,CAAO,GAAA,EAAK,QAAW,qBAAqB,CAAA;EAC5C,EAAA,MAAM,MAAM,QAAA,CAAS,SAAA;EACrB,EAAA,IAAI,GAAA,CAAI,SAAS,GAAA,EAAK;EACpB,IAAA,MAAM,IAAI,KAAA,CAAM,mDAAA,GAAsD,GAAG,CAAA;EAC3E,EAAA;EACF;EAaM,SAAU,IAAI,GAAA,EAAe;EACjC,EAAA,OAAO,IAAI,WAAA,CAAY,GAAA,CAAI,MAAA,EAAQ,GAAA,CAAI,UAAA,EAAY,IAAA,CAAK,KAAA,CAAM,GAAA,CAAI,UAAA,GAAa,CAAC,CAAC,CAAA;EACnF;EAGM,SAAU,SAAS,MAAA,EAAoB;EAC3C,EAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,MAAA,CAAO,QAAQ,CAAA,EAAA,EAAK;EACtC,IAAA,MAAA,CAAO,CAAC,CAAA,CAAE,IAAA,CAAK,CAAC,CAAA;EAClB,EAAA;EACF;EAkBO,IAAM,IAAA,mBAAiC,CAAA,MAC5C,IAAI,UAAA,CAAW,IAAI,WAAA,CAAY,CAAC,SAAU,CAAC,CAAA,CAAE,MAAM,CAAA,CAAE,CAAC,MAAM,EAAA,GAAK;EAG7D,SAAU,SAAS,IAAA,EAAY;EACnC,EAAA,OACI,IAAA,IAAQ,EAAA,GAAM,UAAA,GACd,IAAA,IAAQ,CAAA,GAAK,WACb,IAAA,KAAS,CAAA,GAAK,KAAA,GACd,IAAA,KAAS,EAAA,GAAM,GAAA;EAErB;EAOM,SAAU,WAAW,GAAA,EAAgB;EACzC,EAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,GAAA,CAAI,QAAQ,CAAA,EAAA,EAAK;EACnC,IAAA,GAAA,CAAI,CAAC,CAAA,GAAI,QAAA,CAAS,GAAA,CAAI,CAAC,CAAC,CAAA;EAC1B,EAAA;EACA,EAAA,OAAO,GAAA;EACT;EAEO,IAAM,UAAA,GAA8C,IAAA,GACvD,CAAC,CAAA,KAAmB,CAAA,GACpB,UAAA;EAiME,SAAU,YAAA,CACd,QAAA,EACA,IAAA,GAAiB,EAAA,EAAE;EAEnB,EAAA,MAAM,KAAA,GAAa,CAAC,GAAA,EAAiB,IAAA,KAAgB,QAAA,CAAS,IAAI,CAAA,CAAE,MAAA,CAAO,GAAG,CAAA,CAAE,MAAA,EAAM;EACtF,EAAA,MAAM,GAAA,GAAM,SAAS,MAAS,CAAA;EAC9B,EAAA,KAAA,CAAM,YAAY,GAAA,CAAI,SAAA;EACtB,EAAA,KAAA,CAAM,WAAW,GAAA,CAAI,QAAA;EACrB,EAAA,KAAA,CAAM,MAAA,GAAS,CAAC,IAAA,KAAgB,QAAA,CAAS,IAAI,CAAA;EAC7C,EAAA,MAAA,CAAO,MAAA,CAAO,OAAO,IAAI,CAAA;EACzB,EAAA,OAAO,MAAA,CAAO,OAAO,KAAK,CAAA;EAC5B;EAWO,IAAM,OAAA,GAAU,CAAC,MAAA,MAAwC;EAC9D,EAAA,GAAA,EAAK,UAAA,CAAW,IAAA,CAAK,CAAC,CAAA,EAAM,GAAM,EAAA,EAAM,GAAA,EAAM,EAAA,EAAM,CAAA,EAAM,GAAA,EAAM,CAAA,EAAM,CAAA,EAAM,CAAA,EAAM,MAAM,CAAC;;;;ECpT3F,IAAM,GAAA,GAAM,OAAO,CAAC,CAAA;EACpB,IAAM,GAAA,GAAM,OAAO,CAAC,CAAA;EACpB,IAAM,GAAA,GAAM,OAAO,CAAC,CAAA;EACpB,IAAM,GAAA,GAAM,OAAO,CAAC,CAAA;EACpB,IAAM,KAAA,GAAQ,OAAO,GAAG,CAAA;EACxB,IAAM,MAAA,GAAS,OAAO,GAAI,CAAA;EAC1B,IAAM,UAAoB,EAAA;EAC1B,IAAM,YAAsB,EAAA;EAC5B,IAAM,aAAuB,EAAA;EAC7B,KAAA,IAAS,KAAA,GAAQ,CAAA,EAAG,CAAA,GAAI,GAAA,EAAK,CAAA,GAAI,GAAG,CAAA,GAAI,CAAA,EAAG,KAAA,GAAQ,EAAA,EAAI,KAAA,EAAA,EAAS;EAE9D,EAAA,CAAC,CAAA,EAAG,CAAC,CAAA,GAAI,CAAC,IAAI,CAAA,GAAI,CAAA,GAAI,CAAA,GAAI,CAAA,IAAK,CAAC,CAAA;EAChC,EAAA,OAAA,CAAQ,IAAA,CAAK,CAAA,IAAK,CAAA,GAAI,CAAA,GAAI,CAAA,CAAE,CAAA;EAE5B,EAAA,SAAA,CAAU,MAAQ,KAAA,GAAQ,CAAA,KAAM,KAAA,GAAQ,CAAA,CAAA,GAAM,IAAK,EAAE,CAAA;EAErD,EAAA,IAAI,CAAA,GAAI,GAAA;EACR,EAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,CAAA,EAAG,CAAA,EAAA,EAAK;EAC1B,IAAA,CAAA,GAAA,CAAM,CAAA,IAAK,GAAA,GAAA,CAAS,CAAA,IAAK,GAAA,IAAO,MAAA,IAAW,KAAA;EAC3C,IAAA,IAAI,CAAA,GAAI,GAAA;EAAK,MAAA,CAAA,IAAK,GAAA,IAAA,CAAS,GAAA,IAAO,MAAA,CAAO,CAAC,CAAA,IAAK,GAAA;EACjD,EAAA;EACA,EAAA,UAAA,CAAW,KAAK,CAAC,CAAA;EACnB;EACA,IAAM,KAAA,GAAQ,KAAA,CAAM,UAAA,EAAY,IAAI,CAAA;EACpC,IAAM,WAAA,GAAc,MAAM,CAAC,CAAA;EAC3B,IAAM,WAAA,GAAc,MAAM,CAAC,CAAA;EAG3B,IAAM,KAAA,GAAQ,CAAC,CAAA,EAAW,CAAA,EAAW,MAAe,CAAA,GAAI,EAAA,GAAK,MAAA,CAAO,CAAA,EAAG,GAAG,CAAC,CAAA,GAAI,MAAA,CAAO,CAAA,EAAG,GAAG,CAAC,CAAA;EAC7F,IAAM,KAAA,GAAQ,CAAC,CAAA,EAAW,CAAA,EAAW,MAAe,CAAA,GAAI,EAAA,GAAK,MAAA,CAAO,CAAA,EAAG,GAAG,CAAC,CAAA,GAAI,MAAA,CAAO,CAAA,EAAG,GAAG,CAAC,CAAA;EAGvF,SAAU,OAAA,CAAQ,CAAA,EAAgB,MAAA,GAAiB,EAAA,EAAE;EACzD,EAAA,MAAM,CAAA,GAAI,IAAI,WAAA,CAAY,CAAA,GAAI,CAAC,CAAA;EAE/B,EAAA,KAAA,IAAS,KAAA,GAAQ,EAAA,GAAK,MAAA,EAAQ,KAAA,GAAQ,IAAI,KAAA,EAAA,EAAS;EAEjD,IAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,EAAA,EAAI,CAAA,EAAA;EAAK,MAAA,CAAA,CAAE,CAAC,CAAA,GAAI,CAAA,CAAE,CAAC,CAAA,GAAI,CAAA,CAAE,IAAI,EAAE,CAAA,GAAI,EAAE,CAAA,GAAI,EAAE,IAAI,CAAA,CAAE,CAAA,GAAI,EAAE,CAAA,GAAI,CAAA,CAAE,IAAI,EAAE,CAAA;EACvF,IAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,EAAA,EAAI,KAAK,CAAA,EAAG;EAC9B,MAAA,MAAM,IAAA,GAAA,CAAQ,IAAI,CAAA,IAAK,EAAA;EACvB,MAAA,MAAM,IAAA,GAAA,CAAQ,IAAI,CAAA,IAAK,EAAA;EACvB,MAAA,MAAM,EAAA,GAAK,EAAE,IAAI,CAAA;EACjB,MAAA,MAAM,EAAA,GAAK,CAAA,CAAE,IAAA,GAAO,CAAC,CAAA;EACrB,MAAA,MAAM,KAAK,KAAA,CAAM,EAAA,EAAI,IAAI,CAAC,CAAA,GAAI,EAAE,IAAI,CAAA;EACpC,MAAA,MAAM,EAAA,GAAK,MAAM,EAAA,EAAI,EAAA,EAAI,CAAC,CAAA,GAAI,CAAA,CAAE,OAAO,CAAC,CAAA;EACxC,MAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,EAAA,EAAI,KAAK,EAAA,EAAI;EAC/B,QAAA,CAAA,CAAE,CAAA,GAAI,CAAC,CAAA,IAAK,EAAA;EACZ,QAAA,CAAA,CAAE,CAAA,GAAI,CAAA,GAAI,CAAC,CAAA,IAAK,EAAA;EAClB,MAAA;EACF,IAAA;EAEA,IAAA,IAAI,IAAA,GAAO,EAAE,CAAC,CAAA;EACd,IAAA,IAAI,IAAA,GAAO,EAAE,CAAC,CAAA;EACd,IAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,EAAA,EAAI,CAAA,EAAA,EAAK;EAC3B,MAAA,MAAM,KAAA,GAAQ,UAAU,CAAC,CAAA;EACzB,MAAA,MAAM,EAAA,GAAK,KAAA,CAAM,IAAA,EAAM,IAAA,EAAM,KAAK,CAAA;EAClC,MAAA,MAAM,EAAA,GAAK,KAAA,CAAM,IAAA,EAAM,IAAA,EAAM,KAAK,CAAA;EAClC,MAAA,MAAM,EAAA,GAAK,QAAQ,CAAC,CAAA;EACpB,MAAA,IAAA,GAAO,EAAE,EAAE,CAAA;EACX,MAAA,IAAA,GAAO,CAAA,CAAE,KAAK,CAAC,CAAA;EACf,MAAA,CAAA,CAAE,EAAE,CAAA,GAAI,EAAA;EACR,MAAA,CAAA,CAAE,EAAA,GAAK,CAAC,CAAA,GAAI,EAAA;EACd,IAAA;EAEA,IAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,EAAA,EAAI,KAAK,EAAA,EAAI;EAC/B,MAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,EAAA,EAAI,CAAA,EAAA;EAAK,QAAA,CAAA,CAAE,CAAC,CAAA,GAAI,CAAA,CAAE,CAAA,GAAI,CAAC,CAAA;EAC3C,MAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,EAAA,EAAI,CAAA,EAAA;EAAK,QAAA,CAAA,CAAE,CAAA,GAAI,CAAC,CAAA,IAAK,CAAC,CAAA,CAAA,CAAG,CAAA,GAAI,CAAA,IAAK,EAAE,CAAA,GAAI,CAAA,CAAA,CAAG,CAAA,GAAI,CAAA,IAAK,EAAE,CAAA;EAC5E,IAAA;EAEA,IAAA,CAAA,CAAE,CAAC,CAAA,IAAK,WAAA,CAAY,KAAK,CAAA;EACzB,IAAA,CAAA,CAAE,CAAC,CAAA,IAAK,WAAA,CAAY,KAAK,CAAA;EAC3B,EAAA;EACA,EAAA,KAAA,CAAM,CAAC,CAAA;EACT;EAGM,IAAO,MAAA,GAAP,MAAO,OAAA,CAAM;;EAejB,EAAA,WAAA,CACE,UACA,MAAA,EACA,SAAA,EACA,SAAA,GAAY,KAAA,EACZ,SAAiB,EAAA,EAAE;EAnBX,IAAA,aAAA,CAAA,IAAA,EAAA,OAAA,CAAA;EACA,IAAA,aAAA,CAAA,IAAA,EAAA,KAAA,EAAM,CAAA,CAAA;EACN,IAAA,aAAA,CAAA,IAAA,EAAA,QAAA,EAAS,CAAA,CAAA;EACT,IAAA,aAAA,CAAA,IAAA,EAAA,UAAA,EAAW,KAAA,CAAA;EACX,IAAA,aAAA,CAAA,IAAA,EAAA,SAAA,CAAA;EACA,IAAA,aAAA,CAAA,IAAA,EAAA,WAAA,EAAY,KAAA,CAAA;EAEf,IAAA,aAAA,CAAA,IAAA,EAAA,UAAA,CAAA;EACA,IAAA,aAAA,CAAA,IAAA,EAAA,QAAA,CAAA;EACA,IAAA,aAAA,CAAA,IAAA,EAAA,WAAA,CAAA;EACG,IAAA,aAAA,CAAA,IAAA,EAAA,WAAA,EAAY,KAAA,CAAA;EACZ,IAAA,aAAA,CAAA,IAAA,EAAA,QAAA,CAAA;EAUR,IAAA,IAAA,CAAK,QAAA,GAAW,QAAA;EAChB,IAAA,IAAA,CAAK,MAAA,GAAS,MAAA;EACd,IAAA,IAAA,CAAK,SAAA,GAAY,SAAA;EACjB,IAAA,IAAA,CAAK,SAAA,GAAY,SAAA;EACjB,IAAA,IAAA,CAAK,MAAA,GAAS,MAAA;EAEd,IAAA,OAAA,CAAQ,WAAW,WAAW,CAAA;EAG9B,IAAA,IAAI,EAAE,CAAA,GAAI,QAAA,IAAY,QAAA,GAAW,GAAA,CAAA;EAC/B,MAAA,MAAM,IAAI,MAAM,yCAAyC,CAAA;EAC3D,IAAA,IAAA,CAAK,KAAA,GAAQ,IAAI,UAAA,CAAW,GAAG,CAAA;EAC/B,IAAA,IAAA,CAAK,OAAA,GAAU,GAAA,CAAI,IAAA,CAAK,KAAK,CAAA;EAC/B,EAAA;IACA,KAAA,GAAK;EACH,IAAA,OAAO,KAAK,UAAA,EAAU;EACxB,EAAA;IACU,MAAA,GAAM;EACd,IAAA,UAAA,CAAW,KAAK,OAAO,CAAA;EACvB,IAAA,OAAA,CAAQ,IAAA,CAAK,OAAA,EAAS,IAAA,CAAK,MAAM,CAAA;EACjC,IAAA,UAAA,CAAW,KAAK,OAAO,CAAA;EACvB,IAAA,IAAA,CAAK,MAAA,GAAS,CAAA;EACd,IAAA,IAAA,CAAK,GAAA,GAAM,CAAA;EACb,EAAA;EACA,EAAA,MAAA,CAAO,IAAA,EAAgB;EACrB,IAAA,OAAA,CAAQ,IAAI,CAAA;EACZ,IAAA,MAAA,CAAO,IAAI,CAAA;EACX,IAAA,MAAM,EAAE,QAAA,EAAU,KAAA,EAAK,GAAK,IAAA;EAC5B,IAAA,MAAM,MAAM,IAAA,CAAK,MAAA;EACjB,IAAA,KAAA,IAAS,GAAA,GAAM,CAAA,EAAG,GAAA,GAAM,GAAA,IAAO;EAC7B,MAAA,MAAM,OAAO,IAAA,CAAK,GAAA,CAAI,WAAW,IAAA,CAAK,GAAA,EAAK,MAAM,GAAG,CAAA;EACpD,MAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,IAAA,EAAM,CAAA,EAAA;EAAK,QAAA,KAAA,CAAM,IAAA,CAAK,GAAA,EAAK,CAAA,IAAK,IAAA,CAAK,GAAA,EAAK,CAAA;EAC9D,MAAA,IAAI,KAAK,GAAA,KAAQ,QAAA;EAAU,QAAA,IAAA,CAAK,MAAA,EAAM;EACxC,IAAA;EACA,IAAA,OAAO,IAAA;EACT,EAAA;IACU,MAAA,GAAM;EACd,IAAA,IAAI,IAAA,CAAK,QAAA;EAAU,MAAA;EACnB,IAAA,IAAA,CAAK,QAAA,GAAW,IAAA;EAChB,IAAA,MAAM,EAAE,KAAA,EAAO,MAAA,EAAQ,GAAA,EAAK,UAAQ,GAAK,IAAA;EAEzC,IAAA,KAAA,CAAM,GAAG,CAAA,IAAK,MAAA;EACd,IAAA,IAAA,CAAK,MAAA,GAAS,GAAA,MAAU,CAAA,IAAK,GAAA,KAAQ,QAAA,GAAW,CAAA;EAAG,MAAA,IAAA,CAAK,MAAA,EAAM;EAC9D,IAAA,KAAA,CAAM,QAAA,GAAW,CAAC,CAAA,IAAK,GAAA;EACvB,IAAA,IAAA,CAAK,MAAA,EAAM;EACb,EAAA;EACU,EAAA,SAAA,CAAU,GAAA,EAAe;EACjC,IAAA,OAAA,CAAQ,MAAM,KAAK,CAAA;EACnB,IAAA,MAAA,CAAO,GAAG,CAAA;EACV,IAAA,IAAA,CAAK,MAAA,EAAM;EACX,IAAA,MAAM,YAAY,IAAA,CAAK,KAAA;EACvB,IAAA,MAAM,EAAE,UAAQ,GAAK,IAAA;EACrB,IAAA,KAAA,IAAS,MAAM,CAAA,EAAG,GAAA,GAAM,GAAA,CAAI,MAAA,EAAQ,MAAM,GAAA,IAAO;EAC/C,MAAA,IAAI,KAAK,MAAA,IAAU,QAAA;EAAU,QAAA,IAAA,CAAK,MAAA,EAAM;EACxC,MAAA,MAAM,OAAO,IAAA,CAAK,GAAA,CAAI,WAAW,IAAA,CAAK,MAAA,EAAQ,MAAM,GAAG,CAAA;EACvD,MAAA,GAAA,CAAI,GAAA,CAAI,UAAU,QAAA,CAAS,IAAA,CAAK,QAAQ,IAAA,CAAK,MAAA,GAAS,IAAI,CAAA,EAAG,GAAG,CAAA;EAChE,MAAA,IAAA,CAAK,MAAA,IAAU,IAAA;EACf,MAAA,GAAA,IAAO,IAAA;EACT,IAAA;EACA,IAAA,OAAO,GAAA;EACT,EAAA;EACA,EAAA,OAAA,CAAQ,GAAA,EAAe;EAErB,IAAA,IAAI,CAAC,IAAA,CAAK,SAAA;EAAW,MAAA,MAAM,IAAI,MAAM,uCAAuC,CAAA;EAC5E,IAAA,OAAO,IAAA,CAAK,UAAU,GAAG,CAAA;EAC3B,EAAA;EACA,EAAA,GAAA,CAAI,KAAA,EAAa;EACf,IAAA,OAAA,CAAQ,KAAK,CAAA;EACb,IAAA,OAAO,IAAA,CAAK,OAAA,CAAQ,IAAI,UAAA,CAAW,KAAK,CAAC,CAAA;EAC3C,EAAA;EACA,EAAA,UAAA,CAAW,GAAA,EAAe;EACxB,IAAA,OAAA,CAAQ,KAAK,IAAI,CAAA;EACjB,IAAA,IAAI,IAAA,CAAK,QAAA;EAAU,MAAA,MAAM,IAAI,MAAM,6BAA6B,CAAA;EAChE,IAAA,IAAA,CAAK,UAAU,GAAG,CAAA;EAClB,IAAA,IAAA,CAAK,OAAA,EAAO;EACZ,IAAA,OAAO,GAAA;EACT,EAAA;IACA,MAAA,GAAM;EACJ,IAAA,OAAO,KAAK,UAAA,CAAW,IAAI,UAAA,CAAW,IAAA,CAAK,SAAS,CAAC,CAAA;EACvD,EAAA;IACA,OAAA,GAAO;EACL,IAAA,IAAA,CAAK,SAAA,GAAY,IAAA;EACjB,IAAA,KAAA,CAAM,KAAK,KAAK,CAAA;EAClB,EAAA;EACA,EAAA,UAAA,CAAW,EAAA,EAAW;EACpB,IAAA,MAAM,EAAE,QAAA,EAAU,MAAA,EAAQ,SAAA,EAAW,MAAA,EAAQ,WAAS,GAAK,IAAA;EAC3D,IAAA,EAAA,KAAA,EAAA,GAAO,IAAI,OAAA,CAAO,QAAA,EAAU,MAAA,EAAQ,SAAA,EAAW,WAAW,MAAM,CAAA,CAAA;EAChE,IAAA,EAAA,CAAG,OAAA,CAAQ,GAAA,CAAI,IAAA,CAAK,OAAO,CAAA;EAC3B,IAAA,EAAA,CAAG,MAAM,IAAA,CAAK,GAAA;EACd,IAAA,EAAA,CAAG,SAAS,IAAA,CAAK,MAAA;EACjB,IAAA,EAAA,CAAG,WAAW,IAAA,CAAK,QAAA;EACnB,IAAA,EAAA,CAAG,MAAA,GAAS,MAAA;EAEZ,IAAA,EAAA,CAAG,MAAA,GAAS,MAAA;EACZ,IAAA,EAAA,CAAG,SAAA,GAAY,SAAA;EACf,IAAA,EAAA,CAAG,SAAA,GAAY,SAAA;EACf,IAAA,EAAA,CAAG,YAAY,IAAA,CAAK,SAAA;EACpB,IAAA,OAAO,EAAA;EACT,EAAA;;EAGF,IAAM,YAAY,CAAC,MAAA,EAAgB,QAAA,EAAkB,SAAA,EAAmB,OAAiB,EAAA,KACvF,YAAA,CAAa,MAAM,IAAI,MAAA,CAAO,QAAA,EAAU,MAAA,EAAQ,SAAS,GAAG,IAAI,CAAA;EAwB3D,IAAM,QAAA,mBAAkC,SAAA;EAC7C,EAAA,CAAA;EACA,EAAA,EAAA;EACA,EAAA,EAAA;EACgB,kBAAA,OAAA,CAAQ,EAAI;EAAC,CAAA;;;EChN/B,IACE,SAAA,GAAY,4CAAA;EADd,IAEE,WAAW,IAAA,CAAK,IAAA;EAFlB,IAGE,YAAY,IAAA,CAAK,KAAA;EAHnB,IAKE,cAAA,GAAiB,oBAAA;EALnB,IAME,gBAAgB,cAAA,GAAiB,wDAAA;EANnC,IAQE,IAAA,GAAO,IAAA;EART,IASE,QAAA,GAAW,EAAA;EATb,IAUE,gBAAA,GAAmB,gBAAA;EAVrB,IAYE,QAAA,GAAW,CAAC,CAAA,EAAG,EAAA,EAAI,KAAK,GAAA,EAAK,GAAA,EAAK,GAAA,EAAK,GAAA,EAAK,KAAK,GAAA,EAAK,GAAA,EAAK,IAAA,EAAM,IAAA,EAAM,MAAM,IAAI,CAAA;EAZnF,IAaE,SAAA,GAAY,GAAA;EAbd,IAkBE,GAAA,GAAM,GAAA;EAMR,SAAS,MAAM,YAAA,EAAc;EAC3B,EAAA,IAAI,KAAK,WAAA,EAAa,YAAA,EACpB,CAAA,GAAIA,UAAAA,CAAU,YAAY,EAAE,WAAA,EAAaA,UAAAA,EAAW,QAAA,EAAU,MAAM,OAAA,EAAS,IAAA,EAAK,EAClF,GAAA,GAAM,IAAIA,UAAAA,CAAU,CAAC,CAAA,EAUrB,cAAA,GAAiB,IAajB,aAAA,GAAgB,CAAA,EAMhB,UAAA,GAAa,EAAA,EAIb,aAAa,EAAA,EAMb,OAAA,GAAU,IAAA,EAKV,OAAA,GAAU,KAGV,MAAA,GAAS,KAAA,EAkBT,cAAc,CAAA,EAId,aAAA,GAAgB,GAGhB,MAAA,GAAS;EAAA,IACP,MAAA,EAAQ,EAAA;EAAA,IACR,SAAA,EAAW,CAAA;EAAA,IACX,kBAAA,EAAoB,CAAA;EAAA,IACpB,cAAA,EAAgB,GAAA;EAAA,IAChB,gBAAA,EAAkB,GAAA;EAAA,IAClB,iBAAA,EAAmB,CAAA;EAAA,IACnB,sBAAA,EAAwB,MAAA;EAAA;EAAA,IACxB,MAAA,EAAQ;EAAA,GACV,EAKA,QAAA,GAAW,sCAAA,EACX,8BAAA,GAAiC,IAAA;EAgBnC,EAAA,SAASA,UAAAA,CAAU,GAAG,CAAA,EAAG;EACvB,IAAA,IAAIC,SAAAA,EAAU,GAAG,WAAA,EAAa,CAAA,EAAG,GAAG,KAAA,EAAO,GAAA,EAAK,KAC9C,CAAA,GAAI,IAAA;EAGN,IAAA,IAAI,EAAE,CAAA,YAAaD,UAAAA,CAAAA,SAAmB,IAAIA,UAAAA,CAAU,GAAG,CAAC,CAAA;EAExD,IAAA,IAAI,KAAK,IAAA,EAAM;EAEb,MAAA,IAAI,CAAA,IAAK,CAAA,CAAE,YAAA,KAAiB,IAAA,EAAM;EAChC,QAAA,CAAA,CAAE,IAAI,CAAA,CAAE,CAAA;EAER,QAAA,IAAI,CAAC,CAAA,CAAE,CAAA,IAAK,CAAA,CAAE,IAAI,OAAA,EAAS;EACzB,UAAA,CAAA,CAAE,CAAA,GAAI,EAAE,CAAA,GAAI,IAAA;EAAA,QACd,CAAA,MAAA,IAAW,CAAA,CAAE,CAAA,GAAI,OAAA,EAAS;EACxB,UAAA,CAAA,CAAE,CAAA,GAAI,CAAC,CAAA,CAAE,CAAA,GAAI,CAAC,CAAA;EAAA,QAChB,CAAA,MAAO;EACL,UAAA,CAAA,CAAE,IAAI,CAAA,CAAE,CAAA;EACR,UAAA,CAAA,CAAE,CAAA,GAAI,CAAA,CAAE,CAAA,CAAE,KAAA,EAAM;EAAA,QAClB;EAEA,QAAA;EAAA,MACF;EAEA,MAAA,IAAA,CAAK,QAAQ,OAAO,CAAA,IAAK,QAAA,KAAa,CAAA,GAAI,KAAK,CAAA,EAAG;EAGhD,QAAA,CAAA,CAAE,IAAI,CAAA,GAAI,CAAA,GAAI,KAAK,CAAA,GAAI,CAAC,GAAG,EAAA,IAAM,CAAA;EAGjC,QAAA,IAAI,CAAA,KAAM,CAAC,CAAC,CAAA,EAAG;EACb,UAAA,KAAK,CAAA,GAAI,GAAG,CAAA,GAAI,CAAA,EAAG,KAAK,EAAA,EAAI,CAAA,IAAK,IAAI,CAAA,EAAA,EAAI;EAEzC,UAAA,IAAI,IAAI,OAAA,EAAS;EACf,YAAA,CAAA,CAAE,CAAA,GAAI,EAAE,CAAA,GAAI,IAAA;EAAA,UACd,CAAA,MAAO;EACL,YAAA,CAAA,CAAE,CAAA,GAAI,CAAA;EACN,YAAA,CAAA,CAAE,CAAA,GAAI,CAAC,CAAC,CAAA;EAAA,UACV;EAEA,UAAA;EAAA,QACF;EAEA,QAAA,GAAA,GAAM,OAAO,CAAC,CAAA;EAAA,MAChB,CAAA,MAAO;EAEL,QAAA,IAAI,CAAC,SAAA,CAAU,IAAA,CAAK,GAAA,GAAM,MAAA,CAAO,CAAC,CAAC,CAAA,EAAG,OAAO,YAAA,CAAa,CAAA,EAAG,GAAA,EAAK,KAAK,CAAA;EAEvE,QAAA,CAAA,CAAE,CAAA,GAAI,GAAA,CAAI,UAAA,CAAW,CAAC,CAAA,IAAK,EAAA,IAAM,GAAA,GAAM,GAAA,CAAI,KAAA,CAAM,CAAC,CAAA,EAAG,EAAA,IAAM,CAAA;EAAA,MAC7D;EAGA,MAAA,IAAA,CAAK,CAAA,GAAI,GAAA,CAAI,OAAA,CAAQ,GAAG,CAAA,IAAK,IAAI,GAAA,GAAM,GAAA,CAAI,OAAA,CAAQ,GAAA,EAAK,EAAE,CAAA;EAG1D,MAAA,IAAA,CAAK,CAAA,GAAI,GAAA,CAAI,MAAA,CAAO,IAAI,KAAK,CAAA,EAAG;EAG9B,QAAA,IAAI,CAAA,GAAI,GAAG,CAAA,GAAI,CAAA;EACf,QAAA,CAAA,IAAK,CAAC,GAAA,CAAI,KAAA,CAAM,CAAA,GAAI,CAAC,CAAA;EACrB,QAAA,GAAA,GAAM,GAAA,CAAI,SAAA,CAAU,CAAA,EAAG,CAAC,CAAA;EAAA,MAC1B,CAAA,MAAA,IAAW,IAAI,CAAA,EAAG;EAGhB,QAAA,CAAA,GAAI,GAAA,CAAI,MAAA;EAAA,MACV;EAAA,IAEF,CAAA,MAAO;EAGL,MAAA,QAAA,CAAS,CAAA,EAAG,CAAA,EAAG,QAAA,CAAS,MAAA,EAAQ,MAAM,CAAA;EAItC,MAAA,IAAI,CAAA,IAAK,MAAM,8BAAA,EAAgC;EAC7C,QAAA,CAAA,GAAI,IAAIA,WAAU,CAAC,CAAA;EACnB,QAAA,OAAO,MAAM,CAAA,EAAG,cAAA,GAAiB,CAAA,CAAE,CAAA,GAAI,GAAG,aAAa,CAAA;EAAA,MACzD;EAEA,MAAA,GAAA,GAAM,OAAO,CAAC,CAAA;EAEd,MAAA,IAAI,KAAA,GAAQ,OAAO,CAAA,IAAK,QAAA,EAAU;EAGhC,QAAA,IAAI,CAAA,GAAI,KAAK,CAAA,EAAG,OAAO,aAAa,CAAA,EAAG,GAAA,EAAK,OAAO,CAAC,CAAA;EAEpD,QAAA,CAAA,CAAE,CAAA,GAAI,IAAI,CAAA,GAAI,CAAA,IAAK,MAAM,GAAA,CAAI,KAAA,CAAM,CAAC,CAAA,EAAG,EAAA,IAAM,CAAA;EAG7C,QAAA,IAAIA,UAAAA,CAAU,SAAS,GAAA,CAAI,OAAA,CAAQ,aAAa,EAAE,CAAA,CAAE,SAAS,EAAA,EAAI;EAC/D,UAAA,MAAM,KAAA,CACJ,gBAAgB,CAAC,CAAA;EAAA,QACrB;EAAA,MACF,CAAA,MAAO;EACL,QAAA,CAAA,CAAE,CAAA,GAAI,GAAA,CAAI,UAAA,CAAW,CAAC,CAAA,KAAM,EAAA,IAAM,GAAA,GAAM,GAAA,CAAI,KAAA,CAAM,CAAC,CAAA,EAAG,EAAA,IAAM,CAAA;EAAA,MAC9D;EAEA,MAAAC,SAAAA,GAAW,QAAA,CAAS,KAAA,CAAM,CAAA,EAAG,CAAC,CAAA;EAC9B,MAAA,CAAA,GAAI,CAAA,GAAI,CAAA;EAIR,MAAA,KAAK,GAAA,GAAM,GAAA,CAAI,MAAA,EAAQ,CAAA,GAAI,KAAK,CAAA,EAAA,EAAK;EACnC,QAAA,IAAIA,SAAAA,CAAS,QAAQ,CAAA,GAAI,GAAA,CAAI,OAAO,CAAC,CAAC,IAAI,CAAA,EAAG;EAC3C,UAAA,IAAI,KAAK,GAAA,EAAK;EAGZ,YAAA,IAAI,IAAI,CAAA,EAAG;EACT,cAAA,CAAA,GAAI,GAAA;EACJ,cAAA;EAAA,YACF;EAAA,UACF,CAAA,MAAA,IAAW,CAAC,WAAA,EAAa;EAGvB,YAAA,IAAI,GAAA,IAAO,GAAA,CAAI,WAAA,EAAY,KAAM,MAAM,GAAA,CAAI,WAAA,EAAY,CAAA,IACnD,GAAA,IAAO,IAAI,WAAA,EAAY,KAAM,GAAA,GAAM,GAAA,CAAI,aAAY,CAAA,EAAI;EACzD,cAAA,WAAA,GAAc,IAAA;EACd,cAAA,CAAA,GAAI,EAAA;EACJ,cAAA,CAAA,GAAI,CAAA;EACJ,cAAA;EAAA,YACF;EAAA,UACF;EAEA,UAAA,OAAO,aAAa,CAAA,EAAG,MAAA,CAAO,CAAC,CAAA,EAAG,OAAO,CAAC,CAAA;EAAA,QAC5C;EAAA,MACF;EAGA,MAAA,KAAA,GAAQ,KAAA;EACR,MAAA,GAAA,GAAM,WAAA,CAAY,GAAA,EAAK,CAAA,EAAG,EAAA,EAAI,EAAE,CAAC,CAAA;EAGjC,MAAA,IAAA,CAAK,CAAA,GAAI,GAAA,CAAI,OAAA,CAAQ,GAAG,CAAA,IAAK,IAAI,GAAA,GAAM,GAAA,CAAI,OAAA,CAAQ,GAAA,EAAK,EAAE,CAAA;EAAA,eACjD,GAAA,CAAI,MAAA;EAAA,IACf;EAGA,IAAA,KAAK,IAAI,CAAA,EAAG,GAAA,CAAI,WAAW,CAAC,CAAA,KAAM,IAAI,CAAA,EAAA,EAAI;EAG1C,IAAA,KAAK,GAAA,GAAM,IAAI,MAAA,EAAQ,GAAA,CAAI,WAAW,EAAE,GAAG,MAAM,EAAA,IAAI;EAErD,IAAA,IAAI,MAAM,GAAA,CAAI,KAAA,CAAM,CAAA,EAAG,EAAE,GAAG,CAAA,EAAG;EAC7B,MAAA,GAAA,IAAO,CAAA;EAGP,MAAA,IAAI,KAAA,IAASD,UAAAA,CAAU,KAAA,IACrB,GAAA,GAAM,EAAA,KAAO,IAAI,gBAAA,IAAoB,CAAA,KAAM,SAAA,CAAU,CAAC,CAAA,CAAA,EAAI;EACxD,QAAA,MAAM,KAAA,CACJ,aAAA,GAAiB,CAAA,CAAE,CAAA,GAAI,CAAE,CAAA;EAAA,MAC/B;EAGA,MAAA,IAAA,CAAK,CAAA,GAAI,CAAA,GAAI,CAAA,GAAI,CAAA,IAAK,OAAA,EAAS;EAG7B,QAAA,CAAA,CAAE,CAAA,GAAI,EAAE,CAAA,GAAI,IAAA;EAAA,MAGd,CAAA,MAAA,IAAW,IAAI,OAAA,EAAS;EAGtB,QAAA,CAAA,CAAE,CAAA,GAAI,CAAC,CAAA,CAAE,CAAA,GAAI,CAAC,CAAA;EAAA,MAChB,CAAA,MAAO;EACL,QAAA,CAAA,CAAE,CAAA,GAAI,CAAA;EACN,QAAA,CAAA,CAAE,IAAI,EAAC;EAMP,QAAA,CAAA,GAAA,CAAK,IAAI,CAAA,IAAK,QAAA;EACd,QAAA,IAAI,CAAA,GAAI,GAAG,CAAA,IAAK,QAAA;EAEhB,QAAA,IAAI,IAAI,GAAA,EAAK;EACX,UAAA,IAAI,CAAA,IAAK,CAAA,CAAE,IAAA,CAAK,CAAC,GAAA,CAAI,KAAA,CAAM,CAAA,EAAG,CAAC,CAAC,CAAA;EAEhC,UAAA,KAAK,GAAA,IAAO,QAAA,EAAU,CAAA,GAAI,GAAA,IAAM;EAC9B,YAAA,CAAA,CAAE,CAAA,CAAE,KAAK,CAAC,GAAA,CAAI,MAAM,CAAA,EAAG,CAAA,IAAK,QAAQ,CAAC,CAAA;EAAA,UACvC;EAEA,UAAA,CAAA,GAAI,QAAA,GAAA,CAAY,GAAA,GAAM,GAAA,CAAI,KAAA,CAAM,CAAC,CAAA,EAAG,MAAA;EAAA,QACtC,CAAA,MAAO;EACL,UAAA,CAAA,IAAK,GAAA;EAAA,QACP;EAEA,QAAA,OAAO,CAAA,EAAA,EAAK,OAAO,GAAA,EAAI;EACvB,QAAA,CAAA,CAAE,CAAA,CAAE,IAAA,CAAK,CAAC,GAAG,CAAA;EAAA,MACf;EAAA,IACF,CAAA,MAAO;EAGL,MAAA,CAAA,CAAE,CAAA,GAAI,CAAC,CAAA,CAAE,CAAA,GAAI,CAAC,CAAA;EAAA,IAChB;EAAA,EACF;EAMA,EAAAA,WAAU,KAAA,GAAQ,KAAA;EAElB,EAAAA,WAAU,QAAA,GAAW,CAAA;EACrB,EAAAA,WAAU,UAAA,GAAa,CAAA;EACvB,EAAAA,WAAU,UAAA,GAAa,CAAA;EACvB,EAAAA,WAAU,WAAA,GAAc,CAAA;EACxB,EAAAA,WAAU,aAAA,GAAgB,CAAA;EAC1B,EAAAA,WAAU,eAAA,GAAkB,CAAA;EAC5B,EAAAA,WAAU,eAAA,GAAkB,CAAA;EAC5B,EAAAA,WAAU,eAAA,GAAkB,CAAA;EAC5B,EAAAA,WAAU,gBAAA,GAAmB,CAAA;EAC7B,EAAAA,WAAU,MAAA,GAAS,CAAA;EAqCnB,EAAAA,UAAAA,CAAU,MAAA,GAASA,UAAAA,CAAU,GAAA,GAAM,SAAU,GAAA,EAAK;EAChD,IAAA,IAAI,CAAA,EAAG,CAAA;EAEP,IAAA,IAAI,OAAO,IAAA,EAAM;EAEf,MAAA,IAAI,OAAO,OAAO,QAAA,EAAU;EAI1B,QAAA,IAAI,GAAA,CAAI,cAAA,CAAe,CAAA,GAAI,gBAAgB,CAAA,EAAG;EAC5C,UAAA,CAAA,GAAI,IAAI,CAAC,CAAA;EACT,UAAA,QAAA,CAAS,CAAA,EAAG,CAAA,EAAG,GAAA,EAAK,CAAC,CAAA;EACrB,UAAA,cAAA,GAAiB,CAAA;EAAA,QACnB;EAIA,QAAA,IAAI,GAAA,CAAI,cAAA,CAAe,CAAA,GAAI,eAAe,CAAA,EAAG;EAC3C,UAAA,CAAA,GAAI,IAAI,CAAC,CAAA;EACT,UAAA,QAAA,CAAS,CAAA,EAAG,CAAA,EAAG,CAAA,EAAG,CAAC,CAAA;EACnB,UAAA,aAAA,GAAgB,CAAA;EAAA,QAClB;EAMA,QAAA,IAAI,GAAA,CAAI,cAAA,CAAe,CAAA,GAAI,gBAAgB,CAAA,EAAG;EAC5C,UAAA,CAAA,GAAI,IAAI,CAAC,CAAA;EACT,UAAA,IAAI,CAAA,IAAK,EAAE,GAAA,EAAK;EACd,YAAA,QAAA,CAAS,EAAE,CAAC,CAAA,EAAG,CAAC,GAAA,EAAK,GAAG,CAAC,CAAA;EACzB,YAAA,QAAA,CAAS,CAAA,CAAE,CAAC,CAAA,EAAG,CAAA,EAAG,KAAK,CAAC,CAAA;EACxB,YAAA,UAAA,GAAa,EAAE,CAAC,CAAA;EAChB,YAAA,UAAA,GAAa,EAAE,CAAC,CAAA;EAAA,UAClB,CAAA,MAAO;EACL,YAAA,QAAA,CAAS,CAAA,EAAG,CAAC,GAAA,EAAK,GAAA,EAAK,CAAC,CAAA;EACxB,YAAA,UAAA,GAAa,EAAE,UAAA,GAAa,CAAA,GAAI,CAAA,GAAI,CAAC,CAAA,GAAI,CAAA,CAAA;EAAA,UAC3C;EAAA,QACF;EAKA,QAAA,IAAI,GAAA,CAAI,cAAA,CAAe,CAAA,GAAI,OAAO,CAAA,EAAG;EACnC,UAAA,CAAA,GAAI,IAAI,CAAC,CAAA;EACT,UAAA,IAAI,CAAA,IAAK,EAAE,GAAA,EAAK;EACd,YAAA,QAAA,CAAS,EAAE,CAAC,CAAA,EAAG,CAAC,GAAA,EAAK,IAAI,CAAC,CAAA;EAC1B,YAAA,QAAA,CAAS,CAAA,CAAE,CAAC,CAAA,EAAG,CAAA,EAAG,KAAK,CAAC,CAAA;EACxB,YAAA,OAAA,GAAU,EAAE,CAAC,CAAA;EACb,YAAA,OAAA,GAAU,EAAE,CAAC,CAAA;EAAA,UACf,CAAA,MAAO;EACL,YAAA,QAAA,CAAS,CAAA,EAAG,CAAC,GAAA,EAAK,GAAA,EAAK,CAAC,CAAA;EACxB,YAAA,IAAI,CAAA,EAAG;EACL,cAAA,OAAA,GAAU,EAAE,OAAA,GAAU,CAAA,GAAI,CAAA,GAAI,CAAC,CAAA,GAAI,CAAA,CAAA;EAAA,YACrC,CAAA,MAAO;EACL,cAAA,MAAM,KAAA,CACJ,cAAA,GAAiB,CAAA,GAAI,mBAAA,GAAsB,CAAC,CAAA;EAAA,YAChD;EAAA,UACF;EAAA,QACF;EAKA,QAAA,IAAI,GAAA,CAAI,cAAA,CAAe,CAAA,GAAI,QAAQ,CAAA,EAAG;EACpC,UAAA,CAAA,GAAI,IAAI,CAAC,CAAA;EACT,UAAA,IAAI,CAAA,KAAM,CAAC,CAAC,CAAA,EAAG;EACb,YAAA,IAAI,CAAA,EAAG;EACL,cAAA,IAAI,OAAO,MAAA,IAAU,WAAA,IAAe,WAClC,MAAA,CAAO,eAAA,IAAmB,OAAO,WAAA,CAAA,EAAc;EAC/C,gBAAA,MAAA,GAAS,CAAA;EAAA,cACX,CAAA,MAAO;EACL,gBAAA,MAAA,GAAS,CAAC,CAAA;EACV,gBAAA,MAAM,KAAA,CACJ,iBAAiB,oBAAoB,CAAA;EAAA,cACzC;EAAA,YACF,CAAA,MAAO;EACL,cAAA,MAAA,GAAS,CAAA;EAAA,YACX;EAAA,UACF,CAAA,MAAO;EACL,YAAA,MAAM,KAAA,CACJ,cAAA,GAAiB,CAAA,GAAI,sBAAA,GAAyB,CAAC,CAAA;EAAA,UACnD;EAAA,QACF;EAIA,QAAA,IAAI,GAAA,CAAI,cAAA,CAAe,CAAA,GAAI,aAAa,CAAA,EAAG;EACzC,UAAA,CAAA,GAAI,IAAI,CAAC,CAAA;EACT,UAAA,QAAA,CAAS,CAAA,EAAG,CAAA,EAAG,CAAA,EAAG,CAAC,CAAA;EACnB,UAAA,WAAA,GAAc,CAAA;EAAA,QAChB;EAIA,QAAA,IAAI,GAAA,CAAI,cAAA,CAAe,CAAA,GAAI,eAAe,CAAA,EAAG;EAC3C,UAAA,CAAA,GAAI,IAAI,CAAC,CAAA;EACT,UAAA,QAAA,CAAS,CAAA,EAAG,CAAA,EAAG,GAAA,EAAK,CAAC,CAAA;EACrB,UAAA,aAAA,GAAgB,CAAA;EAAA,QAClB;EAIA,QAAA,IAAI,GAAA,CAAI,cAAA,CAAe,CAAA,GAAI,QAAQ,CAAA,EAAG;EACpC,UAAA,CAAA,GAAI,IAAI,CAAC,CAAA;EACT,UAAA,IAAI,OAAO,CAAA,IAAK,QAAA,EAAU,MAAA,GAAS,CAAA;EAAA,eAC9B,MAAM,KAAA,CACT,cAAA,GAAiB,CAAA,GAAI,qBAAqB,CAAC,CAAA;EAAA,QAC/C;EAIA,QAAA,IAAI,GAAA,CAAI,cAAA,CAAe,CAAA,GAAI,UAAU,CAAA,EAAG;EACtC,UAAA,CAAA,GAAI,IAAI,CAAC,CAAA;EAIT,UAAA,IAAI,OAAO,CAAA,IAAK,QAAA,IAAY,CAAC,uBAAA,CAAwB,IAAA,CAAK,CAAC,CAAA,EAAG;EAC5D,YAAA,8BAAA,GAAiC,CAAA,CAAE,KAAA,CAAM,CAAA,EAAG,EAAE,CAAA,IAAK,YAAA;EACnD,YAAA,QAAA,GAAW,CAAA;EAAA,UACb,CAAA,MAAO;EACL,YAAA,MAAM,KAAA,CACJ,cAAA,GAAiB,CAAA,GAAI,YAAA,GAAe,CAAC,CAAA;EAAA,UACzC;EAAA,QACF;EAAA,MAEF,CAAA,MAAO;EAGL,QAAA,MAAM,KAAA,CACJ,cAAA,GAAiB,mBAAA,GAAsB,GAAG,CAAA;EAAA,MAC9C;EAAA,IACF;EAEA,IAAA,OAAO;EAAA,MACL,cAAA;EAAA,MACA,aAAA;EAAA,MACA,cAAA,EAAgB,CAAC,UAAA,EAAY,UAAU,CAAA;EAAA,MACvC,KAAA,EAAO,CAAC,OAAA,EAAS,OAAO,CAAA;EAAA,MACxB,MAAA;EAAA,MACA,WAAA;EAAA,MACA,aAAA;EAAA,MACA,MAAA;EAAA,MACA;EAAA,KACF;EAAA,EACF,CAAA;EAYA,EAAAA,UAAAA,CAAU,WAAA,GAAc,SAAU,CAAA,EAAG;EACnC,IAAA,IAAI,CAAC,CAAA,IAAK,CAAA,CAAE,YAAA,KAAiB,MAAM,OAAO,KAAA;EAC1C,IAAA,IAAI,CAACA,UAAAA,CAAU,KAAA,EAAO,OAAO,IAAA;EAE7B,IAAA,IAAI,CAAA,EAAG,GACL,CAAA,GAAI,CAAA,CAAE,GACN,CAAA,GAAI,CAAA,CAAE,CAAA,EACN,CAAA,GAAI,CAAA,CAAE,CAAA;EAER,IAAA,GAAA,MAAS,EAAC,CAAE,SAAS,IAAA,CAAK,CAAC,KAAK,gBAAA,EAAkB;EAEhD,MAAA,IAAA,CAAK,CAAA,KAAM,CAAA,IAAK,CAAA,KAAM,EAAA,KAAO,CAAA,IAAK,CAAC,GAAA,IAAO,CAAA,IAAK,GAAA,IAAO,CAAA,KAAM,SAAA,CAAU,CAAC,CAAA,EAAG;EAGxE,QAAA,IAAI,CAAA,CAAE,CAAC,CAAA,KAAM,CAAA,EAAG;EACd,UAAA,IAAI,CAAA,KAAM,CAAA,IAAK,CAAA,CAAE,MAAA,KAAW,GAAG,OAAO,IAAA;EACtC,UAAA,MAAM,GAAA;EAAA,QACR;EAGA,QAAA,CAAA,GAAA,CAAK,IAAI,CAAA,IAAK,QAAA;EACd,QAAA,IAAI,CAAA,GAAI,GAAG,CAAA,IAAK,QAAA;EAIhB,QAAA,IAAI,OAAO,CAAA,CAAE,CAAC,CAAC,CAAA,CAAE,UAAU,CAAA,EAAG;EAE5B,UAAA,KAAK,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,CAAA,CAAE,QAAQ,CAAA,EAAA,EAAK;EAC7B,YAAA,CAAA,GAAI,EAAE,CAAC,CAAA;EACP,YAAA,IAAI,CAAA,GAAI,KAAK,CAAA,IAAK,IAAA,IAAQ,MAAM,SAAA,CAAU,CAAC,GAAG,MAAM,GAAA;EAAA,UACtD;EAGA,UAAA,IAAI,CAAA,KAAM,GAAG,OAAO,IAAA;EAAA,QACtB;EAAA,MACF;EAAA,IAGF,CAAA,MAAA,IAAW,CAAA,KAAM,IAAA,IAAQ,CAAA,KAAM,IAAA,KAAS,MAAM,IAAA,IAAQ,CAAA,KAAM,CAAA,IAAK,CAAA,KAAM,EAAA,CAAA,EAAK;EAC1E,MAAA,OAAO,IAAA;EAAA,IACT;EAEA,IAAA,MAAM,KAAA,CACH,cAAA,GAAiB,qBAAA,GAAwB,CAAC,CAAA;EAAA,EAC/C,CAAA;EAQA,EAAAA,UAAAA,CAAU,OAAA,GAAUA,UAAAA,CAAU,GAAA,GAAM,WAAY;EAC9C,IAAA,OAAO,QAAA,CAAS,WAAW,EAAE,CAAA;EAAA,EAC/B,CAAA;EAQA,EAAAA,UAAAA,CAAU,OAAA,GAAUA,UAAAA,CAAU,GAAA,GAAM,WAAY;EAC9C,IAAA,OAAO,QAAA,CAAS,WAAW,CAAC,CAAA;EAAA,EAC9B,CAAA;EAaA,EAAAA,UAAAA,CAAU,UAAU,WAAY;EAC9B,IAAA,IAAI,OAAA,GAAU,gBAAA;EAMd,IAAA,IAAI,iBAAkB,IAAA,CAAK,MAAA,EAAO,GAAI,OAAA,GAAW,UAC9C,WAAY;EAAE,MAAA,OAAO,SAAA,CAAU,IAAA,CAAK,MAAA,EAAO,GAAI,OAAO,CAAA;EAAA,IAAG,IACzD,WAAY;EAAE,MAAA,OAAA,CAAS,IAAA,CAAK,QAAO,GAAI,UAAA,GAAa,KAAK,OAAA,IACxD,IAAA,CAAK,MAAA,EAAO,GAAI,OAAA,GAAW,CAAA,CAAA;EAAA,IAAI,CAAA;EAEnC,IAAA,OAAO,SAAU,EAAA,EAAI;EACnB,MAAA,IAAI,CAAA,EAAG,CAAA,EAAG,CAAA,EAAG,CAAA,EAAG,CAAA,EACd,CAAA,GAAI,CAAA,EACJ,CAAA,GAAI,EAAC,EACL,IAAA,GAAO,IAAIA,WAAU,GAAG,CAAA;EAE1B,MAAA,IAAI,EAAA,IAAM,MAAM,EAAA,GAAK,cAAA;EAAA,WAChB,QAAA,CAAS,EAAA,EAAI,CAAA,EAAG,GAAG,CAAA;EAExB,MAAA,CAAA,GAAI,QAAA,CAAS,KAAK,QAAQ,CAAA;EAE1B,MAAA,IAAI,MAAA,EAAQ;EAGV,QAAA,IAAI,OAAO,eAAA,EAAiB;EAE1B,UAAA,CAAA,GAAI,OAAO,eAAA,CAAgB,IAAI,WAAA,CAAY,CAAA,IAAK,CAAC,CAAC,CAAA;EAElD,UAAA,OAAO,IAAI,CAAA,IAAI;EAQb,YAAA,CAAA,GAAI,EAAE,CAAC,CAAA,GAAI,UAAW,CAAA,CAAE,CAAA,GAAI,CAAC,CAAA,KAAM,EAAA,CAAA;EAMnC,YAAA,IAAI,KAAK,IAAA,EAAM;EACb,cAAA,CAAA,GAAI,MAAA,CAAO,eAAA,CAAgB,IAAI,WAAA,CAAY,CAAC,CAAC,CAAA;EAC7C,cAAA,CAAA,CAAE,CAAC,CAAA,GAAI,CAAA,CAAE,CAAC,CAAA;EACV,cAAA,CAAA,CAAE,CAAA,GAAI,CAAC,CAAA,GAAI,CAAA,CAAE,CAAC,CAAA;EAAA,YAChB,CAAA,MAAO;EAIL,cAAA,CAAA,CAAE,IAAA,CAAK,IAAI,IAAI,CAAA;EACf,cAAA,CAAA,IAAK,CAAA;EAAA,YACP;EAAA,UACF;EACA,UAAA,CAAA,GAAI,CAAA,GAAI,CAAA;EAAA,QAGV,CAAA,MAAA,IAAW,OAAO,WAAA,EAAa;EAG7B,UAAA,CAAA,GAAI,MAAA,CAAO,WAAA,CAAY,CAAA,IAAK,CAAC,CAAA;EAE7B,UAAA,OAAO,IAAI,CAAA,IAAI;EAMb,YAAA,CAAA,GAAA,CAAM,CAAA,CAAE,CAAC,CAAA,GAAI,EAAA,IAAM,kBAAoB,CAAA,CAAE,CAAA,GAAI,CAAC,CAAA,GAAI,aAAA,GAC9C,CAAA,CAAE,CAAA,GAAI,CAAC,IAAI,UAAA,GAAgB,CAAA,CAAE,CAAA,GAAI,CAAC,CAAA,GAAI,QAAA,IACtC,CAAA,CAAE,CAAA,GAAI,CAAC,CAAA,IAAK,EAAA,CAAA,IAAO,CAAA,CAAE,CAAA,GAAI,CAAC,CAAA,IAAK,CAAA,CAAA,GAAK,CAAA,CAAE,IAAI,CAAC,CAAA;EAE/C,YAAA,IAAI,KAAK,IAAA,EAAM;EACb,cAAA,MAAA,CAAO,WAAA,CAAY,CAAC,CAAA,CAAE,IAAA,CAAK,GAAG,CAAC,CAAA;EAAA,YACjC,CAAA,MAAO;EAGL,cAAA,CAAA,CAAE,IAAA,CAAK,IAAI,IAAI,CAAA;EACf,cAAA,CAAA,IAAK,CAAA;EAAA,YACP;EAAA,UACF;EACA,UAAA,CAAA,GAAI,CAAA,GAAI,CAAA;EAAA,QACV,CAAA,MAAO;EACL,UAAA,MAAA,GAAS,KAAA;EACT,UAAA,MAAM,KAAA,CACJ,iBAAiB,oBAAoB,CAAA;EAAA,QACzC;EAAA,MACF;EAGA,MAAA,IAAI,CAAC,MAAA,EAAQ;EAEX,QAAA,OAAO,IAAI,CAAA,IAAI;EACb,UAAA,CAAA,GAAI,cAAA,EAAe;EACnB,UAAA,IAAI,CAAA,GAAI,IAAA,EAAM,CAAA,CAAE,CAAA,EAAG,IAAI,CAAA,GAAI,IAAA;EAAA,QAC7B;EAAA,MACF;EAEA,MAAA,CAAA,GAAI,CAAA,CAAE,EAAE,CAAC,CAAA;EACT,MAAA,EAAA,IAAM,QAAA;EAGN,MAAA,IAAI,KAAK,EAAA,EAAI;EACX,QAAA,CAAA,GAAI,QAAA,CAAS,WAAW,EAAE,CAAA;EAC1B,QAAA,CAAA,CAAE,CAAC,CAAA,GAAI,SAAA,CAAU,CAAA,GAAI,CAAC,CAAA,GAAI,CAAA;EAAA,MAC5B;EAGA,MAAA,OAAO,EAAE,CAAC,CAAA,KAAM,GAAG,CAAA,CAAE,GAAA,IAAO,CAAA,EAAA,EAAI;EAGhC,MAAA,IAAI,IAAI,CAAA,EAAG;EACT,QAAA,CAAA,GAAI,CAAC,IAAI,CAAC,CAAA;EAAA,MACZ,CAAA,MAAO;EAGL,QAAA,KAAK,CAAA,GAAI,EAAA,EAAK,CAAA,CAAE,CAAC,CAAA,KAAM,CAAA,EAAG,CAAA,CAAE,MAAA,CAAO,CAAA,EAAG,CAAC,CAAA,EAAG,CAAA,IAAK,QAAA,EAAS;EAGxD,QAAA,KAAK,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,CAAA,CAAE,CAAC,GAAG,CAAA,IAAK,EAAA,EAAI,CAAA,IAAK,EAAA,EAAI,CAAA,EAAA,EAAI;EAG5C,QAAA,IAAI,CAAA,GAAI,QAAA,EAAU,CAAA,IAAK,QAAA,GAAW,CAAA;EAAA,MACpC;EAEA,MAAA,IAAA,CAAK,CAAA,GAAI,CAAA;EACT,MAAA,IAAA,CAAK,CAAA,GAAI,CAAA;EACT,MAAA,OAAO,IAAA;EAAA,IACT,CAAA;EAAA,EACF,CAAA,GAAG;EAQH,EAAAA,UAAAA,CAAU,MAAM,WAAY;EAC1B,IAAA,IAAI,CAAA,GAAI,GACN,IAAA,GAAO,SAAA,EACP,MAAM,IAAIA,UAAAA,CAAU,IAAA,CAAK,CAAC,CAAC,CAAA;EAC7B,IAAA,OAAO,CAAA,GAAI,KAAK,MAAA,IAAS,GAAA,GAAM,IAAI,IAAA,CAAK,IAAA,CAAK,GAAG,CAAC,CAAA;EACjD,IAAA,OAAO,GAAA;EAAA,EACT,CAAA;EAOA,EAAA,WAAA,mBAAe,CAAA,WAAY;EACzB,IAAA,IAAI,OAAA,GAAU,YAAA;EAOd,IAAA,SAAS,SAAA,CAAU,GAAA,EAAK,MAAA,EAAQ,OAAA,EAASC,SAAAA,EAAU;EACjD,MAAA,IAAI,CAAA,EACF,MAAM,CAAC,CAAC,GACR,IAAA,EACA,CAAA,GAAI,CAAA,EACJ,GAAA,GAAM,GAAA,CAAI,MAAA;EAEZ,MAAA,OAAO,IAAI,GAAA,IAAM;EACf,QAAA,KAAK,OAAO,GAAA,CAAI,MAAA,EAAQ,QAAQ,GAAA,CAAI,IAAI,KAAK,MAAA,EAAO;EAEpD,QAAA,GAAA,CAAI,CAAC,CAAA,IAAKA,SAAAA,CAAS,QAAQ,GAAA,CAAI,MAAA,CAAO,GAAG,CAAC,CAAA;EAE1C,QAAA,KAAK,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,GAAA,CAAI,QAAQ,CAAA,EAAA,EAAK;EAE/B,UAAA,IAAI,GAAA,CAAI,CAAC,CAAA,GAAI,OAAA,GAAU,CAAA,EAAG;EACxB,YAAA,IAAI,GAAA,CAAI,IAAI,CAAC,CAAA,IAAK,MAAM,GAAA,CAAI,CAAA,GAAI,CAAC,CAAA,GAAI,CAAA;EACrC,YAAA,GAAA,CAAI,IAAI,CAAC,CAAA,IAAK,GAAA,CAAI,CAAC,IAAI,OAAA,GAAU,CAAA;EACjC,YAAA,GAAA,CAAI,CAAC,CAAA,IAAK,OAAA;EAAA,UACZ;EAAA,QACF;EAAA,MACF;EAEA,MAAA,OAAO,IAAI,OAAA,EAAQ;EAAA,IACrB;EAKA,IAAA,OAAO,SAAU,GAAA,EAAK,MAAA,EAAQ,OAAA,EAAS,MAAM,gBAAA,EAAkB;EAC7D,MAAA,IAAIA,SAAAA,EAAU,CAAA,EAAG,CAAA,EAAG,CAAA,EAAG,GAAG,CAAA,EAAG,EAAA,EAAI,CAAA,EAC/B,CAAA,GAAI,IAAI,OAAA,CAAQ,GAAG,CAAA,EACnB,EAAA,GAAK,gBACL,EAAA,GAAK,aAAA;EAGP,MAAA,IAAI,KAAK,CAAA,EAAG;EACV,QAAA,CAAA,GAAI,aAAA;EAGJ,QAAA,aAAA,GAAgB,CAAA;EAChB,QAAA,GAAA,GAAM,GAAA,CAAI,OAAA,CAAQ,GAAA,EAAK,EAAE,CAAA;EACzB,QAAA,CAAA,GAAI,IAAID,WAAU,MAAM,CAAA;EACxB,QAAA,CAAA,GAAI,CAAA,CAAE,GAAA,CAAI,GAAA,CAAI,MAAA,GAAS,CAAC,CAAA;EACxB,QAAA,aAAA,GAAgB,CAAA;EAKhB,QAAA,CAAA,CAAE,CAAA,GAAI,SAAA;EAAA,UAAU,aAAa,aAAA,CAAc,CAAA,CAAE,CAAC,CAAA,EAAG,CAAA,CAAE,GAAG,GAAG,CAAA;EAAA,UACxD,EAAA;EAAA,UAAI,OAAA;EAAA,UAAS;EAAA,SAAO;EACrB,QAAA,CAAA,CAAE,CAAA,GAAI,EAAE,CAAA,CAAE,MAAA;EAAA,MACZ;EAIA,MAAA,EAAA,GAAK,SAAA,CAAU,GAAA,EAAK,MAAA,EAAQ,OAAA,EAAS,gBAAA,IACjCC,YAAW,QAAA,EAAU,OAAA,KACrBA,SAAAA,GAAW,OAAA,EAAS,QAAA,CAAS,CAAA;EAGjC,MAAA,CAAA,GAAI,IAAI,EAAA,CAAG,MAAA;EAGX,MAAA,OAAO,GAAG,EAAE,CAAC,KAAK,CAAA,EAAG,EAAA,CAAG,KAAI,EAAE;EAG9B,MAAA,IAAI,CAAC,EAAA,CAAG,CAAC,GAAG,OAAOA,SAAAA,CAAS,OAAO,CAAC,CAAA;EAGpC,MAAA,IAAI,IAAI,CAAA,EAAG;EACT,QAAA,EAAE,CAAA;EAAA,MACJ,CAAA,MAAO;EACL,QAAA,CAAA,CAAE,CAAA,GAAI,EAAA;EACN,QAAA,CAAA,CAAE,CAAA,GAAI,CAAA;EAGN,QAAA,CAAA,CAAE,CAAA,GAAI,IAAA;EACN,QAAA,CAAA,GAAI,GAAA,CAAI,CAAA,EAAG,CAAA,EAAG,EAAA,EAAI,IAAI,OAAO,CAAA;EAC7B,QAAA,EAAA,GAAK,CAAA,CAAE,CAAA;EACP,QAAA,CAAA,GAAI,CAAA,CAAE,CAAA;EACN,QAAA,CAAA,GAAI,CAAA,CAAE,CAAA;EAAA,MACR;EAKA,MAAA,CAAA,GAAI,IAAI,EAAA,GAAK,CAAA;EAGb,MAAA,CAAA,GAAI,GAAG,CAAC,CAAA;EAIR,MAAA,CAAA,GAAI,OAAA,GAAU,CAAA;EACd,MAAA,CAAA,GAAI,KAAK,CAAA,GAAI,CAAA,IAAK,EAAA,CAAG,CAAA,GAAI,CAAC,CAAA,IAAK,IAAA;EAE/B,MAAA,CAAA,GAAI,EAAA,GAAK,CAAA,GAAA,CAAK,CAAA,IAAK,IAAA,IAAQ,CAAA,MAAO,EAAA,IAAM,CAAA,IAAK,EAAA,KAAO,CAAA,CAAE,CAAA,GAAI,CAAA,GAAI,CAAA,GAAI,MAC1D,CAAA,GAAI,CAAA,IAAK,CAAA,IAAK,CAAA,KAAK,EAAA,IAAM,CAAA,IAAK,CAAA,IAAK,EAAA,IAAM,KAAK,EAAA,CAAG,CAAA,GAAI,CAAC,CAAA,GAAI,CAAA,IAC3D,EAAA,KAAO,CAAA,CAAE,CAAA,GAAI,IAAI,CAAA,GAAI,CAAA,CAAA,CAAA;EAK5B,MAAA,IAAI,CAAA,GAAI,CAAA,IAAK,CAAC,EAAA,CAAG,CAAC,CAAA,EAAG;EAGnB,QAAA,GAAA,GAAM,CAAA,GAAI,YAAA,CAAaA,SAAAA,CAAS,MAAA,CAAO,CAAC,CAAA,EAAG,CAAC,EAAA,EAAIA,SAAAA,CAAS,OAAO,CAAC,CAAC,CAAA,GAAIA,SAAAA,CAAS,OAAO,CAAC,CAAA;EAAA,MACzF,CAAA,MAAO;EAGL,QAAA,EAAA,CAAG,MAAA,GAAS,CAAA;EAGZ,QAAA,IAAI,CAAA,EAAG;EAGL,UAAA,KAAK,EAAE,OAAA,EAAS,EAAE,GAAG,EAAE,CAAC,IAAI,OAAA,IAAU;EACpC,YAAA,EAAA,CAAG,CAAC,CAAA,GAAI,CAAA;EAER,YAAA,IAAI,CAAC,CAAA,EAAG;EACN,cAAA,EAAE,CAAA;EACF,cAAA,EAAA,GAAK,CAAC,CAAC,CAAA,CAAE,MAAA,CAAO,EAAE,CAAA;EAAA,YACpB;EAAA,UACF;EAAA,QACF;EAGA,QAAA,KAAK,IAAI,EAAA,CAAG,MAAA,EAAQ,CAAC,EAAA,CAAG,EAAE,CAAC,CAAA,IAAG;EAG9B,QAAA,KAAK,CAAA,GAAI,CAAA,EAAG,GAAA,GAAM,EAAA,EAAI,CAAA,IAAK,CAAA,EAAG,GAAA,IAAOA,SAAAA,CAAS,MAAA,CAAO,EAAA,CAAG,CAAA,EAAG,CAAC,CAAA,EAAE;EAG9D,QAAA,GAAA,GAAM,aAAa,GAAA,EAAK,CAAA,EAAGA,SAAAA,CAAS,MAAA,CAAO,CAAC,CAAC,CAAA;EAAA,MAC/C;EAGA,MAAA,OAAO,GAAA;EAAA,IACT,CAAA;EAAA,EACF,CAAA,GAAG;EAIH,EAAA,GAAA,mBAAO,CAAA,WAAY;EAGjB,IAAA,SAAS,QAAA,CAAS,CAAA,EAAG,CAAA,EAAG,IAAA,EAAM;EAC5B,MAAA,IAAI,CAAA,EAAG,IAAA,EAAM,GAAA,EAAK,GAAA,EAChB,QAAQ,CAAA,EACR,CAAA,GAAI,CAAA,CAAE,MAAA,EACN,GAAA,GAAM,CAAA,GAAI,SAAA,EACV,GAAA,GAAM,IAAI,SAAA,GAAY,CAAA;EAExB,MAAA,KAAK,CAAA,GAAI,CAAA,CAAE,KAAA,EAAM,EAAG,CAAA,EAAA,IAAM;EACxB,QAAA,GAAA,GAAM,CAAA,CAAE,CAAC,CAAA,GAAI,SAAA;EACb,QAAA,GAAA,GAAM,CAAA,CAAE,CAAC,CAAA,GAAI,SAAA,GAAY,CAAA;EACzB,QAAA,CAAA,GAAI,GAAA,GAAM,MAAM,GAAA,GAAM,GAAA;EACtB,QAAA,IAAA,GAAO,GAAA,GAAM,GAAA,GAAQ,CAAA,GAAI,SAAA,GAAa,SAAA,GAAa,KAAA;EACnD,QAAA,KAAA,GAAA,CAAS,OAAO,IAAA,GAAO,CAAA,KAAM,CAAA,GAAI,SAAA,GAAY,KAAK,GAAA,GAAM,GAAA;EACxD,QAAA,CAAA,CAAE,CAAC,IAAI,IAAA,GAAO,IAAA;EAAA,MAChB;EAEA,MAAA,IAAI,OAAO,CAAA,GAAI,CAAC,KAAK,CAAA,CAAE,OAAO,CAAC,CAAA;EAE/B,MAAA,OAAO,CAAA;EAAA,IACT;EAEA,IAAA,SAASC,QAAAA,CAAQ,CAAA,EAAG,CAAA,EAAG,EAAA,EAAI,EAAA,EAAI;EAC7B,MAAA,IAAI,CAAA,EAAG,GAAA;EAEP,MAAA,IAAI,MAAM,EAAA,EAAI;EACZ,QAAA,GAAA,GAAM,EAAA,GAAK,KAAK,CAAA,GAAI,EAAA;EAAA,MACtB,CAAA,MAAO;EAEL,QAAA,KAAK,CAAA,GAAI,GAAA,GAAM,CAAA,EAAG,CAAA,GAAI,IAAI,CAAA,EAAA,EAAK;EAE7B,UAAA,IAAI,CAAA,CAAE,CAAC,CAAA,IAAK,CAAA,CAAE,CAAC,CAAA,EAAG;EAChB,YAAA,GAAA,GAAM,EAAE,CAAC,CAAA,GAAI,CAAA,CAAE,CAAC,IAAI,CAAA,GAAI,EAAA;EACxB,YAAA;EAAA,UACF;EAAA,QACF;EAAA,MACF;EAEA,MAAA,OAAO,GAAA;EAAA,IACT;EAEA,IAAA,SAAS,QAAA,CAAS,CAAA,EAAG,CAAA,EAAG,EAAA,EAAI,IAAA,EAAM;EAChC,MAAA,IAAI,CAAA,GAAI,CAAA;EAGR,MAAA,OAAO,EAAA,EAAA,IAAO;EACZ,QAAA,CAAA,CAAE,EAAE,CAAA,IAAK,CAAA;EACT,QAAA,CAAA,GAAI,EAAE,EAAE,CAAA,GAAI,CAAA,CAAE,EAAE,IAAI,CAAA,GAAI,CAAA;EACxB,QAAA,CAAA,CAAE,EAAE,IAAI,CAAA,GAAI,IAAA,GAAO,EAAE,EAAE,CAAA,GAAI,EAAE,EAAE,CAAA;EAAA,MACjC;EAGA,MAAA,OAAO,CAAC,CAAA,CAAE,CAAC,CAAA,IAAK,CAAA,CAAE,MAAA,GAAS,CAAA,EAAG,CAAA,CAAE,MAAA,CAAO,CAAA,EAAG,CAAC,CAAA,EAAE;EAAA,IAC/C;EAGA,IAAA,OAAO,SAAU,CAAA,EAAG,CAAA,EAAG,EAAA,EAAI,IAAI,IAAA,EAAM;EACnC,MAAA,IAAI,GAAA,EAAK,CAAA,EAAG,CAAA,EAAG,IAAA,EAAM,CAAA,EAAG,IAAA,EAAM,KAAA,EAAO,CAAA,EAAG,EAAA,EAAI,GAAA,EAAK,IAAA,EAAM,IAAA,EAAM,EAAA,EAAI,EAAA,EAAI,GAAA,EACnE,EAAA,EAAI,EAAA,EACJ,CAAA,GAAI,CAAA,CAAE,CAAA,IAAK,CAAA,CAAE,CAAA,GAAI,CAAA,GAAI,EAAA,EACrB,EAAA,GAAK,CAAA,CAAE,CAAA,EACP,EAAA,GAAK,CAAA,CAAE,CAAA;EAGT,MAAA,IAAI,CAAC,EAAA,IAAM,CAAC,EAAA,CAAG,CAAC,CAAA,IAAK,CAAC,EAAA,IAAM,CAAC,EAAA,CAAG,CAAC,CAAA,EAAG;EAElC,QAAA,OAAO,IAAIF,UAAAA;EAAA;EAAA,UAGV,CAAC,CAAA,CAAE,CAAA,IAAK,CAAC,EAAE,CAAA,KAAM,EAAA,GAAK,EAAA,IAAM,EAAA,CAAG,CAAC,CAAA,IAAK,EAAA,CAAG,CAAC,CAAA,GAAI,CAAC,EAAA,CAAA,GAAM,GAAA;EAAA;EAAA,YAGnD,EAAA,IAAM,GAAG,CAAC,CAAA,IAAK,KAAK,CAAC,EAAA,GAAK,CAAA,GAAI,CAAA,GAAI,CAAA,GAAI;EAAA;EAAA,SACzC;EAAA,MACD;EAEA,MAAA,CAAA,GAAI,IAAIA,WAAU,CAAC,CAAA;EACnB,MAAA,EAAA,GAAK,CAAA,CAAE,IAAI,EAAC;EACZ,MAAA,CAAA,GAAI,CAAA,CAAE,IAAI,CAAA,CAAE,CAAA;EACZ,MAAA,CAAA,GAAI,KAAK,CAAA,GAAI,CAAA;EAEb,MAAA,IAAI,CAAC,IAAA,EAAM;EACT,QAAA,IAAA,GAAO,IAAA;EACP,QAAA,CAAA,GAAI,QAAA,CAAS,EAAE,CAAA,GAAI,QAAQ,IAAI,QAAA,CAAS,CAAA,CAAE,IAAI,QAAQ,CAAA;EACtD,QAAA,CAAA,GAAI,IAAI,QAAA,GAAW,CAAA;EAAA,MACrB;EAIA,MAAA,KAAK,CAAA,GAAI,GAAG,EAAA,CAAG,CAAC,MAAM,EAAA,CAAG,CAAC,CAAA,IAAK,CAAA,CAAA,EAAI,CAAA,EAAA,EAAI;EAEvC,MAAA,IAAI,GAAG,CAAC,CAAA,IAAK,EAAA,CAAG,CAAC,KAAK,CAAA,CAAA,EAAI,CAAA,EAAA;EAE1B,MAAA,IAAI,IAAI,CAAA,EAAG;EACT,QAAA,EAAA,CAAG,KAAK,CAAC,CAAA;EACT,QAAA,IAAA,GAAO,IAAA;EAAA,MACT,CAAA,MAAO;EACL,QAAA,EAAA,GAAK,EAAA,CAAG,MAAA;EACR,QAAA,EAAA,GAAK,EAAA,CAAG,MAAA;EACR,QAAA,CAAA,GAAI,CAAA;EACJ,QAAA,CAAA,IAAK,CAAA;EAIL,QAAA,CAAA,GAAI,SAAA,CAAU,IAAA,IAAQ,EAAA,CAAG,CAAC,IAAI,CAAA,CAAE,CAAA;EAIhC,QAAA,IAAI,IAAI,CAAA,EAAG;EACT,UAAA,EAAA,GAAK,QAAA,CAAS,EAAA,EAAI,CAAA,EAAG,IAAI,CAAA;EACzB,UAAA,EAAA,GAAK,QAAA,CAAS,EAAA,EAAI,CAAA,EAAG,IAAI,CAAA;EACzB,UAAA,EAAA,GAAK,EAAA,CAAG,MAAA;EACR,UAAA,EAAA,GAAK,EAAA,CAAG,MAAA;EAAA,QACV;EAEA,QAAA,EAAA,GAAK,EAAA;EACL,QAAA,GAAA,GAAM,EAAA,CAAG,KAAA,CAAM,CAAA,EAAG,EAAE,CAAA;EACpB,QAAA,IAAA,GAAO,GAAA,CAAI,MAAA;EAGX,QAAA,OAAO,IAAA,GAAO,EAAA,EAAI,GAAA,CAAI,IAAA,EAAM,IAAI,CAAA,EAAE;EAClC,QAAA,EAAA,GAAK,GAAG,KAAA,EAAM;EACd,QAAA,EAAA,GAAK,CAAC,CAAC,CAAA,CAAE,MAAA,CAAO,EAAE,CAAA;EAClB,QAAA,GAAA,GAAM,GAAG,CAAC,CAAA;EACV,QAAA,IAAI,EAAA,CAAG,CAAC,CAAA,IAAK,IAAA,GAAO,CAAA,EAAG,GAAA,EAAA;EAIvB,QAAA,GAAG;EACD,UAAA,CAAA,GAAI,CAAA;EAGJ,UAAA,GAAA,GAAME,QAAAA,CAAQ,EAAA,EAAI,GAAA,EAAK,EAAA,EAAI,IAAI,CAAA;EAG/B,UAAA,IAAI,MAAM,CAAA,EAAG;EAIX,YAAA,IAAA,GAAO,IAAI,CAAC,CAAA;EACZ,YAAA,IAAI,MAAM,IAAA,EAAM,IAAA,GAAO,OAAO,IAAA,IAAQ,GAAA,CAAI,CAAC,CAAA,IAAK,CAAA,CAAA;EAGhD,YAAA,CAAA,GAAI,SAAA,CAAU,OAAO,GAAG,CAAA;EAaxB,YAAA,IAAI,IAAI,CAAA,EAAG;EAGT,cAAA,IAAI,CAAA,IAAK,IAAA,EAAM,CAAA,GAAI,IAAA,GAAO,CAAA;EAG1B,cAAA,IAAA,GAAO,QAAA,CAAS,EAAA,EAAI,CAAA,EAAG,IAAI,CAAA;EAC3B,cAAA,KAAA,GAAQ,IAAA,CAAK,MAAA;EACb,cAAA,IAAA,GAAO,GAAA,CAAI,MAAA;EAMX,cAAA,OAAOA,SAAQ,IAAA,EAAM,GAAA,EAAK,KAAA,EAAO,IAAI,KAAK,CAAA,EAAG;EAC3C,gBAAA,CAAA,EAAA;EAGA,gBAAA,QAAA,CAAS,MAAM,EAAA,GAAK,KAAA,GAAQ,EAAA,GAAK,EAAA,EAAI,OAAO,IAAI,CAAA;EAChD,gBAAA,KAAA,GAAQ,IAAA,CAAK,MAAA;EACb,gBAAA,GAAA,GAAM,CAAA;EAAA,cACR;EAAA,YACF,CAAA,MAAO;EAML,cAAA,IAAI,KAAK,CAAA,EAAG;EAGV,gBAAA,GAAA,GAAM,CAAA,GAAI,CAAA;EAAA,cACZ;EAGA,cAAA,IAAA,GAAO,GAAG,KAAA,EAAM;EAChB,cAAA,KAAA,GAAQ,IAAA,CAAK,MAAA;EAAA,YACf;EAEA,YAAA,IAAI,QAAQ,IAAA,EAAM,IAAA,GAAO,CAAC,CAAC,CAAA,CAAE,OAAO,IAAI,CAAA;EAGxC,YAAA,QAAA,CAAS,GAAA,EAAK,IAAA,EAAM,IAAA,EAAM,IAAI,CAAA;EAC9B,YAAA,IAAA,GAAO,GAAA,CAAI,MAAA;EAGX,YAAA,IAAI,OAAO,EAAA,EAAI;EAMb,cAAA,OAAOA,SAAQ,EAAA,EAAI,GAAA,EAAK,EAAA,EAAI,IAAI,IAAI,CAAA,EAAG;EACrC,gBAAA,CAAA,EAAA;EAGA,gBAAA,QAAA,CAAS,KAAK,EAAA,GAAK,IAAA,GAAO,EAAA,GAAK,EAAA,EAAI,MAAM,IAAI,CAAA;EAC7C,gBAAA,IAAA,GAAO,GAAA,CAAI,MAAA;EAAA,cACb;EAAA,YACF;EAAA,UACF,CAAA,MAAA,IAAW,QAAQ,CAAA,EAAG;EACpB,YAAA,CAAA,EAAA;EACA,YAAA,GAAA,GAAM,CAAC,CAAC,CAAA;EAAA,UACV;EAGA,UAAA,EAAA,CAAG,GAAG,CAAA,GAAI,CAAA;EAGV,UAAA,IAAI,GAAA,CAAI,CAAC,CAAA,EAAG;EACV,YAAA,GAAA,CAAI,IAAA,EAAM,CAAA,GAAI,EAAA,CAAG,EAAE,CAAA,IAAK,CAAA;EAAA,UAC1B,CAAA,MAAO;EACL,YAAA,GAAA,GAAM,CAAC,EAAA,CAAG,EAAE,CAAC,CAAA;EACb,YAAA,IAAA,GAAO,CAAA;EAAA,UACT;EAAA,QACF,UAAU,EAAA,EAAA,GAAO,EAAA,IAAM,GAAA,CAAI,CAAC,KAAK,IAAA,KAAS,CAAA,EAAA;EAE1C,QAAA,IAAA,GAAO,GAAA,CAAI,CAAC,CAAA,IAAK,IAAA;EAGjB,QAAA,IAAI,CAAC,EAAA,CAAG,CAAC,GAAG,EAAA,CAAG,MAAA,CAAO,GAAG,CAAC,CAAA;EAAA,MAC5B;EAEA,MAAA,IAAI,QAAQ,IAAA,EAAM;EAGhB,QAAA,KAAK,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,EAAA,CAAG,CAAC,GAAG,CAAA,IAAK,EAAA,EAAI,CAAA,IAAK,EAAA,EAAI,CAAA,EAAA,EAAI;EAE7C,QAAA,KAAA,CAAM,CAAA,EAAG,EAAA,IAAM,CAAA,CAAE,CAAA,GAAI,CAAA,GAAI,IAAI,QAAA,GAAW,CAAA,CAAA,GAAK,CAAA,EAAG,EAAA,EAAI,IAAI,CAAA;EAAA,MAG1D,CAAA,MAAO;EACL,QAAA,CAAA,CAAE,CAAA,GAAI,CAAA;EACN,QAAA,CAAA,CAAE,IAAI,CAAC,IAAA;EAAA,MACT;EAEA,MAAA,OAAO,CAAA;EAAA,IACT,CAAA;EAAA,EACF,CAAA,GAAG;EAYH,EAAA,SAAS,MAAA,CAAO,CAAA,EAAG,CAAA,EAAG,EAAA,EAAI,EAAA,EAAI;EAC5B,IAAA,IAAI,EAAA,EAAI,CAAA,EAAG,EAAA,EAAI,GAAA,EAAK,GAAA;EAEpB,IAAA,IAAI,EAAA,IAAM,MAAM,EAAA,GAAK,aAAA;EAAA,SAChB,QAAA,CAAS,EAAA,EAAI,CAAA,EAAG,CAAC,CAAA;EAEtB,IAAA,IAAI,CAAC,CAAA,CAAE,CAAA,EAAG,OAAO,EAAE,QAAA,EAAS;EAE5B,IAAA,EAAA,GAAK,CAAA,CAAE,EAAE,CAAC,CAAA;EACV,IAAA,EAAA,GAAK,CAAA,CAAE,CAAA;EAEP,IAAA,IAAI,KAAK,IAAA,EAAM;EACb,MAAA,GAAA,GAAM,aAAA,CAAc,EAAE,CAAC,CAAA;EACvB,MAAA,GAAA,GAAM,EAAA,IAAM,CAAA,IAAK,EAAA,IAAM,CAAA,KAAM,MAAM,UAAA,IAAc,EAAA,IAAM,UAAA,CAAA,GACpD,aAAA,CAAc,KAAK,EAAE,CAAA,GACrB,YAAA,CAAa,GAAA,EAAK,IAAI,GAAG,CAAA;EAAA,IAC9B,CAAA,MAAO;EACL,MAAA,CAAA,GAAI,MAAM,IAAIF,UAAAA,CAAU,CAAC,CAAA,EAAG,GAAG,EAAE,CAAA;EAGjC,MAAA,CAAA,GAAI,CAAA,CAAE,CAAA;EAEN,MAAA,GAAA,GAAM,aAAA,CAAc,EAAE,CAAC,CAAA;EACvB,MAAA,GAAA,GAAM,GAAA,CAAI,MAAA;EAOV,MAAA,IAAI,MAAM,CAAA,IAAK,EAAA,IAAM,MAAM,CAAA,IAAK,CAAA,IAAK,KAAK,UAAA,CAAA,EAAa;EAGrD,QAAA,OAAO,GAAA,GAAM,CAAA,EAAG,GAAA,IAAO,GAAA,EAAK,GAAA,EAAA,EAAM;EAClC,QAAA,GAAA,GAAM,aAAA,CAAc,KAAK,CAAC,CAAA;EAAA,MAG5B,CAAA,MAAO;EACL,QAAA,CAAA,IAAK,EAAA,IAAM,EAAA,KAAO,CAAA,IAAK,CAAA,GAAI,EAAA,CAAA;EAC3B,QAAA,GAAA,GAAM,YAAA,CAAa,GAAA,EAAK,CAAA,EAAG,GAAG,CAAA;EAG9B,QAAA,IAAI,CAAA,GAAI,IAAI,GAAA,EAAK;EACf,UAAA,IAAI,EAAE,IAAI,CAAA,EAAG,KAAK,OAAO,GAAA,EAAK,CAAA,EAAA,EAAK,OAAO,GAAA,EAAI;EAAA,QAChD,CAAA,MAAO;EACL,UAAA,CAAA,IAAK,CAAA,GAAI,GAAA;EACT,UAAA,IAAI,IAAI,CAAA,EAAG;EACT,YAAA,IAAI,CAAA,GAAI,CAAA,IAAK,GAAA,EAAK,GAAA,IAAO,GAAA;EACzB,YAAA,OAAO,CAAA,EAAA,EAAK,OAAO,GAAA,EAAI;EAAA,UACzB;EAAA,QACF;EAAA,MACF;EAAA,IACF;EAEA,IAAA,OAAO,CAAA,CAAE,CAAA,GAAI,CAAA,IAAK,EAAA,GAAK,MAAM,GAAA,GAAM,GAAA;EAAA,EACrC;EAKA,EAAA,SAAS,QAAA,CAAS,MAAM,CAAA,EAAG;EACzB,IAAA,IAAI,CAAA,EAAG,GACL,CAAA,GAAI,CAAA,EACJ,IAAI,IAAIA,UAAAA,CAAU,IAAA,CAAK,CAAC,CAAC,CAAA;EAE3B,IAAA,OAAO,CAAA,GAAI,IAAA,CAAK,MAAA,EAAQ,CAAA,EAAA,EAAK;EAC3B,MAAA,CAAA,GAAI,IAAIA,UAAAA,CAAU,IAAA,CAAK,CAAC,CAAC,CAAA;EACzB,MAAA,IAAI,CAAC,CAAA,CAAE,CAAA,IAAA,CAAM,CAAA,GAAI,OAAA,CAAQ,CAAA,EAAG,CAAC,CAAA,MAAO,CAAA,IAAK,CAAA,KAAM,CAAA,IAAK,CAAA,CAAE,MAAM,CAAA,EAAG;EAC7D,QAAA,CAAA,GAAI,CAAA;EAAA,MACN;EAAA,IACF;EAEA,IAAA,OAAO,CAAA;EAAA,EACT;EAOA,EAAA,SAAS,SAAA,CAAU,CAAA,EAAG,CAAA,EAAG,CAAA,EAAG;EAC1B,IAAA,IAAI,CAAA,GAAI,CAAA,EACN,CAAA,GAAI,CAAA,CAAE,MAAA;EAGR,IAAA,OAAO,CAAC,CAAA,CAAE,EAAE,CAAC,CAAA,EAAG,CAAA,CAAE,KAAI,EAAE;EAGxB,IAAA,KAAK,CAAA,GAAI,EAAE,CAAC,CAAA,EAAG,KAAK,EAAA,EAAI,CAAA,IAAK,IAAI,CAAA,EAAA,EAAI;EAGrC,IAAA,IAAA,CAAK,CAAA,GAAI,CAAA,GAAI,CAAA,GAAI,QAAA,GAAW,KAAK,OAAA,EAAS;EAGxC,MAAA,CAAA,CAAE,CAAA,GAAI,EAAE,CAAA,GAAI,IAAA;EAAA,IAGd,CAAA,MAAA,IAAW,IAAI,OAAA,EAAS;EAGtB,MAAA,CAAA,CAAE,CAAA,GAAI,CAAC,CAAA,CAAE,CAAA,GAAI,CAAC,CAAA;EAAA,IAChB,CAAA,MAAO;EACL,MAAA,CAAA,CAAE,CAAA,GAAI,CAAA;EACN,MAAA,CAAA,CAAE,CAAA,GAAI,CAAA;EAAA,IACR;EAEA,IAAA,OAAO,CAAA;EAAA,EACT;EAIA,EAAA,YAAA,mBAAgB,CAAA,WAAY;EAC1B,IAAA,IAAI,UAAA,GAAa,+BACf,QAAA,GAAW,aAAA,EACX,YAAY,aAAA,EACZ,eAAA,GAAkB,sBAClB,gBAAA,GAAmB,4BAAA;EAErB,IAAA,OAAO,SAAU,CAAA,EAAG,GAAA,EAAK,KAAA,EAAO,CAAA,EAAG;EACjC,MAAA,IAAI,MACF,CAAA,GAAI,KAAA,GAAQ,MAAM,GAAA,CAAI,OAAA,CAAQ,kBAAkB,EAAE,CAAA;EAGpD,MAAA,IAAI,eAAA,CAAgB,IAAA,CAAK,CAAC,CAAA,EAAG;EAC3B,QAAA,CAAA,CAAE,IAAI,KAAA,CAAM,CAAC,IAAI,IAAA,GAAO,CAAA,GAAI,IAAI,EAAA,GAAK,CAAA;EAAA,MACvC,CAAA,MAAO;EACL,QAAA,IAAI,CAAC,KAAA,EAAO;EAGV,UAAA,CAAA,GAAI,EAAE,OAAA,CAAQ,UAAA,EAAY,SAAU,CAAA,EAAG,IAAI,EAAA,EAAI;EAC7C,YAAA,IAAA,GAAA,CAAQ,EAAA,GAAK,GAAG,WAAA,EAAY,KAAM,MAAM,EAAA,GAAK,EAAA,IAAM,MAAM,CAAA,GAAI,CAAA;EAC7D,YAAA,OAAO,CAAC,CAAA,IAAK,CAAA,IAAK,IAAA,GAAO,EAAA,GAAK,CAAA;EAAA,UAChC,CAAC,CAAA;EAED,UAAA,IAAI,CAAA,EAAG;EACL,YAAA,IAAA,GAAO,CAAA;EAGP,YAAA,CAAA,GAAI,EAAE,OAAA,CAAQ,QAAA,EAAU,IAAI,CAAA,CAAE,OAAA,CAAQ,WAAW,MAAM,CAAA;EAAA,UACzD;EAEA,UAAA,IAAI,OAAO,CAAA,EAAG,OAAO,IAAIA,UAAAA,CAAU,GAAG,IAAI,CAAA;EAAA,QAC5C;EAIA,QAAA,IAAIA,WAAU,KAAA,EAAO;EACnB,UAAA,MAAM,KAAA,CACH,iBAAiB,OAAA,IAAW,CAAA,GAAI,WAAW,CAAA,GAAI,EAAA,CAAA,GAAM,cAAc,GAAG,CAAA;EAAA,QAC3E;EAGA,QAAA,CAAA,CAAE,CAAA,GAAI,IAAA;EAAA,MACR;EAEA,MAAA,CAAA,CAAE,CAAA,GAAI,EAAE,CAAA,GAAI,IAAA;EAAA,IACd,CAAA;EAAA,EACF,CAAA,GAAG;EAOH,EAAA,SAAS,KAAA,CAAM,CAAA,EAAG,EAAA,EAAI,EAAA,EAAI,CAAA,EAAG;EAC3B,IAAA,IAAI,CAAA,EAAG,CAAA,EAAG,CAAA,EAAG,CAAA,EAAG,CAAA,EAAG,IAAI,EAAA,EACrB,EAAA,GAAK,CAAA,CAAE,CAAA,EACP,MAAA,GAAS,QAAA;EAGX,IAAA,IAAI,EAAA,EAAI;EAQN,MAAA,GAAA,EAAK;EAGH,QAAA,KAAK,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,EAAA,CAAG,CAAC,GAAG,CAAA,IAAK,EAAA,EAAI,CAAA,IAAK,EAAA,EAAI,CAAA,EAAA,EAAI;EAC7C,QAAA,CAAA,GAAI,EAAA,GAAK,CAAA;EAGT,QAAA,IAAI,IAAI,CAAA,EAAG;EACT,UAAA,CAAA,IAAK,QAAA;EACL,UAAA,CAAA,GAAI,EAAA;EACJ,UAAA,CAAA,GAAI,EAAA,CAAG,KAAK,CAAC,CAAA;EAGb,UAAA,EAAA,GAAK,UAAU,CAAA,GAAI,MAAA,CAAO,IAAI,CAAA,GAAI,CAAC,IAAI,EAAE,CAAA;EAAA,QAC3C,CAAA,MAAO;EACL,UAAA,EAAA,GAAK,QAAA,CAAA,CAAU,CAAA,GAAI,CAAA,IAAK,QAAQ,CAAA;EAEhC,UAAA,IAAI,EAAA,IAAM,GAAG,MAAA,EAAQ;EAEnB,YAAA,IAAI,CAAA,EAAG;EAGL,cAAA,OAAO,GAAG,MAAA,IAAU,EAAA,EAAI,EAAA,CAAG,IAAA,CAAK,CAAC,CAAA,EAAE;EACnC,cAAA,CAAA,GAAI,EAAA,GAAK,CAAA;EACT,cAAA,CAAA,GAAI,CAAA;EACJ,cAAA,CAAA,IAAK,QAAA;EACL,cAAA,CAAA,GAAI,IAAI,QAAA,GAAW,CAAA;EAAA,YACrB,CAAA,MAAO;EACL,cAAA,MAAM,GAAA;EAAA,YACR;EAAA,UACF,CAAA,MAAO;EACL,YAAA,CAAA,GAAI,CAAA,GAAI,GAAG,EAAE,CAAA;EAGb,YAAA,KAAK,IAAI,CAAA,EAAG,CAAA,IAAK,EAAA,EAAI,CAAA,IAAK,IAAI,CAAA,EAAA,EAAI;EAGlC,YAAA,CAAA,IAAK,QAAA;EAIL,YAAA,CAAA,GAAI,IAAI,QAAA,GAAW,CAAA;EAGnB,YAAA,EAAA,GAAK,CAAA,GAAI,CAAA,GAAI,CAAA,GAAI,SAAA,CAAU,CAAA,GAAI,OAAO,CAAA,GAAI,CAAA,GAAI,CAAC,CAAA,GAAI,EAAE,CAAA;EAAA,UACvD;EAAA,QACF;EAEA,QAAA,CAAA,GAAI,KAAK,EAAA,GAAK,CAAA;EAAA;EAAA;EAAA,QAKb,EAAA,CAAG,EAAA,GAAK,CAAC,CAAA,IAAK,IAAA,KAAS,CAAA,GAAI,CAAA,GAAI,CAAA,GAAI,CAAA,GAAI,MAAA,CAAO,CAAA,GAAI,CAAA,GAAI,CAAC,CAAA,CAAA;EAExD,QAAA,CAAA,GAAI,KAAK,CAAA,GAAA,CACL,EAAA,IAAM,OAAO,EAAA,IAAM,CAAA,IAAK,OAAO,CAAA,CAAE,CAAA,GAAI,IAAI,CAAA,GAAI,CAAA,CAAA,CAAA,GAC9C,KAAK,CAAA,IAAK,EAAA,IAAM,MAAM,EAAA,IAAM,CAAA,IAAK,KAAK,EAAA,IAAM,CAAA;EAAA,QAAA,CAG3C,CAAA,GAAI,IAAI,CAAA,GAAI,CAAA,GAAI,IAAI,MAAA,CAAO,CAAA,GAAI,CAAC,CAAA,GAAI,CAAA,GAAI,GAAG,EAAA,GAAK,CAAC,KAAK,EAAA,GAAM,CAAA,IAC7D,OAAO,CAAA,CAAE,CAAA,GAAI,IAAI,CAAA,GAAI,CAAA,CAAA,CAAA;EAExB,QAAA,IAAI,EAAA,GAAK,CAAA,IAAK,CAAC,EAAA,CAAG,CAAC,CAAA,EAAG;EACpB,UAAA,EAAA,CAAG,MAAA,GAAS,CAAA;EAEZ,UAAA,IAAI,CAAA,EAAG;EAGL,YAAA,EAAA,IAAM,EAAE,CAAA,GAAI,CAAA;EAGZ,YAAA,EAAA,CAAG,CAAC,CAAA,GAAI,MAAA,CAAA,CAAQ,QAAA,GAAW,EAAA,GAAK,YAAY,QAAQ,CAAA;EACpD,YAAA,CAAA,CAAE,CAAA,GAAI,CAAC,EAAA,IAAM,CAAA;EAAA,UACf,CAAA,MAAO;EAGL,YAAA,EAAA,CAAG,CAAC,CAAA,GAAI,CAAA,CAAE,CAAA,GAAI,CAAA;EAAA,UAChB;EAEA,UAAA,OAAO,CAAA;EAAA,QACT;EAGA,QAAA,IAAI,KAAK,CAAA,EAAG;EACV,UAAA,EAAA,CAAG,MAAA,GAAS,EAAA;EACZ,UAAA,CAAA,GAAI,CAAA;EACJ,UAAA,EAAA,EAAA;EAAA,QACF,CAAA,MAAO;EACL,UAAA,EAAA,CAAG,SAAS,EAAA,GAAK,CAAA;EACjB,UAAA,CAAA,GAAI,MAAA,CAAO,WAAW,CAAC,CAAA;EAIvB,UAAA,EAAA,CAAG,EAAE,CAAA,GAAI,CAAA,GAAI,CAAA,GAAI,UAAU,CAAA,GAAI,MAAA,CAAO,CAAA,GAAI,CAAC,CAAA,GAAI,MAAA,CAAO,CAAC,CAAC,IAAI,CAAA,GAAI,CAAA;EAAA,QAClE;EAGA,QAAA,IAAI,CAAA,EAAG;EAEL,UAAA,WAAU;EAGR,YAAA,IAAI,MAAM,CAAA,EAAG;EAGX,cAAA,KAAK,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,EAAA,CAAG,CAAC,GAAG,CAAA,IAAK,EAAA,EAAI,CAAA,IAAK,EAAA,EAAI,CAAA,EAAA,EAAI;EAC7C,cAAA,CAAA,GAAI,EAAA,CAAG,CAAC,CAAA,IAAK,CAAA;EACb,cAAA,KAAK,IAAI,CAAA,EAAG,CAAA,IAAK,EAAA,EAAI,CAAA,IAAK,IAAI,CAAA,EAAA,EAAI;EAGlC,cAAA,IAAI,KAAK,CAAA,EAAG;EACV,gBAAA,CAAA,CAAE,CAAA,EAAA;EACF,gBAAA,IAAI,GAAG,CAAC,CAAA,IAAK,IAAA,EAAM,EAAA,CAAG,CAAC,CAAA,GAAI,CAAA;EAAA,cAC7B;EAEA,cAAA;EAAA,YACF,CAAA,MAAO;EACL,cAAA,EAAA,CAAG,EAAE,CAAA,IAAK,CAAA;EACV,cAAA,IAAI,EAAA,CAAG,EAAE,CAAA,IAAK,IAAA,EAAM;EACpB,cAAA,EAAA,CAAG,IAAI,CAAA,GAAI,CAAA;EACX,cAAA,CAAA,GAAI,CAAA;EAAA,YACN;EAAA,UACF;EAAA,QACF;EAGA,QAAA,KAAK,CAAA,GAAI,EAAA,CAAG,MAAA,EAAQ,EAAA,CAAG,EAAE,CAAC,CAAA,KAAM,CAAA,EAAG,EAAA,CAAG,GAAA,EAAI,EAAE;EAAA,MAC9C;EAGA,MAAA,IAAI,CAAA,CAAE,IAAI,OAAA,EAAS;EACjB,QAAA,CAAA,CAAE,CAAA,GAAI,EAAE,CAAA,GAAI,IAAA;EAAA,MAGd,CAAA,MAAA,IAAW,CAAA,CAAE,CAAA,GAAI,OAAA,EAAS;EACxB,QAAA,CAAA,CAAE,CAAA,GAAI,CAAC,CAAA,CAAE,CAAA,GAAI,CAAC,CAAA;EAAA,MAChB;EAAA,IACF;EAEA,IAAA,OAAO,CAAA;EAAA,EACT;EAGA,EAAA,SAAS,QAAQ,CAAA,EAAG;EAClB,IAAA,IAAI,GAAA,EACF,IAAI,CAAA,CAAE,CAAA;EAER,IAAA,IAAI,CAAA,KAAM,IAAA,EAAM,OAAO,CAAA,CAAE,QAAA,EAAS;EAElC,IAAA,GAAA,GAAM,aAAA,CAAc,EAAE,CAAC,CAAA;EAEvB,IAAA,GAAA,GAAM,CAAA,IAAK,UAAA,IAAc,CAAA,IAAK,UAAA,GAC1B,aAAA,CAAc,GAAA,EAAK,CAAC,CAAA,GACpB,YAAA,CAAa,GAAA,EAAK,CAAA,EAAG,GAAG,CAAA;EAE5B,IAAA,OAAO,CAAA,CAAE,CAAA,GAAI,CAAA,GAAI,GAAA,GAAM,GAAA,GAAM,GAAA;EAAA,EAC/B;EASA,EAAA,CAAA,CAAE,aAAA,GAAgB,CAAA,CAAE,GAAA,GAAM,WAAY;EACpC,IAAA,IAAI,CAAA,GAAI,IAAIA,UAAAA,CAAU,IAAI,CAAA;EAC1B,IAAA,IAAI,CAAA,CAAE,CAAA,GAAI,CAAA,EAAG,CAAA,CAAE,CAAA,GAAI,CAAA;EACnB,IAAA,OAAO,CAAA;EAAA,EACT,CAAA;EAUA,EAAA,CAAA,CAAE,UAAA,GAAa,SAAU,CAAA,EAAG,CAAA,EAAG;EAC7B,IAAA,OAAO,QAAQ,IAAA,EAAM,IAAIA,UAAAA,CAAU,CAAA,EAAG,CAAC,CAAC,CAAA;EAAA,EAC1C,CAAA;EAgBA,EAAA,CAAA,CAAE,aAAA,GAAgB,CAAA,CAAE,EAAA,GAAK,SAAU,IAAI,EAAA,EAAI;EACzC,IAAA,IAAI,CAAA,EAAG,CAAA,EAAG,CAAA,EACR,CAAA,GAAI,IAAA;EAEN,IAAA,IAAI,MAAM,IAAA,EAAM;EACd,MAAA,QAAA,CAAS,EAAA,EAAI,GAAG,GAAG,CAAA;EACnB,MAAA,IAAI,EAAA,IAAM,MAAM,EAAA,GAAK,aAAA;EAAA,WAChB,QAAA,CAAS,EAAA,EAAI,CAAA,EAAG,CAAC,CAAA;EAEtB,MAAA,OAAO,KAAA,CAAM,IAAIA,UAAAA,CAAU,CAAC,GAAG,EAAA,GAAK,CAAA,CAAE,CAAA,GAAI,CAAA,EAAG,EAAE,CAAA;EAAA,IACjD;EAEA,IAAA,IAAI,EAAE,CAAA,GAAI,CAAA,CAAE,CAAA,CAAA,EAAI,OAAO,IAAA;EACvB,IAAA,CAAA,GAAA,CAAA,CAAM,CAAA,GAAI,EAAE,MAAA,GAAS,CAAA,IAAK,SAAS,IAAA,CAAK,CAAA,GAAI,QAAQ,CAAA,IAAK,QAAA;EAGzD,IAAA,IAAI,CAAA,GAAI,CAAA,CAAE,CAAC,CAAA,EAAG,OAAO,IAAI,EAAA,IAAM,CAAA,EAAG,CAAA,IAAK,EAAA,EAAI,CAAA,EAAA,EAAI;EAC/C,IAAA,IAAI,CAAA,GAAI,GAAG,CAAA,GAAI,CAAA;EAEf,IAAA,OAAO,CAAA;EAAA,EACT,CAAA;EAuBA,EAAA,CAAA,CAAE,SAAA,GAAY,CAAA,CAAE,GAAA,GAAM,SAAU,GAAG,CAAA,EAAG;EACpC,IAAA,OAAO,GAAA,CAAI,MAAM,IAAIA,UAAAA,CAAU,GAAG,CAAC,CAAA,EAAG,gBAAgB,aAAa,CAAA;EAAA,EACrE,CAAA;EAOA,EAAA,CAAA,CAAE,kBAAA,GAAqB,CAAA,CAAE,IAAA,GAAO,SAAU,GAAG,CAAA,EAAG;EAC9C,IAAA,OAAO,GAAA,CAAI,MAAM,IAAIA,UAAAA,CAAU,GAAG,CAAC,CAAA,EAAG,GAAG,CAAC,CAAA;EAAA,EAC5C,CAAA;EAkBA,EAAA,CAAA,CAAE,eAAA,GAAkB,CAAA,CAAE,GAAA,GAAM,SAAU,GAAG,CAAA,EAAG;EAC1C,IAAA,IAAI,IAAA,EAAM,UAAU,CAAA,EAAG,CAAA,EAAG,MAAM,MAAA,EAAQ,MAAA,EAAQ,MAAA,EAAQ,CAAA,EACtD,CAAA,GAAI,IAAA;EAEN,IAAA,CAAA,GAAI,IAAIA,WAAU,CAAC,CAAA;EAGnB,IAAA,IAAI,CAAA,CAAE,CAAA,IAAK,CAAC,CAAA,CAAE,WAAU,EAAG;EACzB,MAAA,MAAM,KAAA,CACH,cAAA,GAAiB,2BAAA,GAA8B,OAAA,CAAQ,CAAC,CAAC,CAAA;EAAA,IAC9D;EAEA,IAAA,IAAI,CAAA,IAAK,IAAA,EAAM,CAAA,GAAI,IAAIA,WAAU,CAAC,CAAA;EAGlC,IAAA,MAAA,GAAS,EAAE,CAAA,GAAI,EAAA;EAGf,IAAA,IAAI,CAAC,CAAA,CAAE,CAAA,IAAK,CAAC,CAAA,CAAE,CAAA,CAAE,CAAC,CAAA,IAAK,CAAA,CAAE,CAAA,CAAE,CAAC,CAAA,IAAK,CAAA,IAAK,CAAC,CAAA,CAAE,CAAA,IAAK,CAAA,CAAE,CAAA,CAAE,MAAA,IAAU,CAAA,IAAK,CAAC,CAAA,CAAE,CAAA,IAAK,CAAC,CAAA,CAAE,CAAA,CAAE,CAAC,CAAA,EAAG;EAIhF,MAAA,CAAA,GAAI,IAAIA,UAAAA,CAAU,IAAA,CAAK,IAAI,CAAC,OAAA,CAAQ,CAAC,CAAA,EAAG,MAAA,GAAS,EAAE,CAAA,IAAK,CAAA,GAAI,MAAM,CAAC,CAAA,CAAA,GAAK,CAAC,OAAA,CAAQ,CAAC,CAAC,CAAC,CAAA;EACpF,MAAA,OAAO,CAAA,GAAI,CAAA,CAAE,GAAA,CAAI,CAAC,CAAA,GAAI,CAAA;EAAA,IACxB;EAEA,IAAA,MAAA,GAAS,EAAE,CAAA,GAAI,CAAA;EAEf,IAAA,IAAI,CAAA,EAAG;EAGL,MAAA,IAAI,CAAA,CAAE,CAAA,GAAI,CAAC,CAAA,CAAE,CAAA,CAAE,CAAC,CAAA,GAAI,CAAC,CAAA,CAAE,CAAA,EAAG,OAAO,IAAIA,WAAU,GAAG,CAAA;EAElD,MAAA,QAAA,GAAW,CAAC,MAAA,IAAU,CAAA,CAAE,SAAA,EAAU,IAAK,EAAE,SAAA,EAAU;EAEnD,MAAA,IAAI,QAAA,EAAU,CAAA,GAAI,CAAA,CAAE,GAAA,CAAI,CAAC,CAAA;EAAA,IAI3B,CAAA,MAAA,IAAW,CAAA,CAAE,CAAA,GAAI,CAAA,KAAM,EAAE,CAAA,GAAI,CAAA,IAAK,CAAA,CAAE,CAAA,GAAI,OAAO,CAAA,CAAE,CAAA,IAAK,CAAA,GAElD,CAAA,CAAE,EAAE,CAAC,CAAA,GAAI,CAAA,IAAK,MAAA,IAAU,CAAA,CAAE,CAAA,CAAE,CAAC,CAAA,IAAK,OAElC,CAAA,CAAE,CAAA,CAAE,CAAC,CAAA,GAAI,QAAQ,MAAA,IAAU,CAAA,CAAE,CAAA,CAAE,CAAC,KAAK,SAAA,CAAA,CAAA,EAAa;EAGpD,MAAA,CAAA,GAAI,EAAE,CAAA,GAAI,CAAA,IAAK,KAAA,CAAM,CAAC,IAAI,EAAA,GAAK,CAAA;EAG/B,MAAA,IAAI,CAAA,CAAE,CAAA,GAAI,EAAA,EAAI,CAAA,GAAI,CAAA,GAAI,CAAA;EAGtB,MAAA,OAAO,IAAIA,UAAAA,CAAU,MAAA,GAAS,CAAA,GAAI,IAAI,CAAC,CAAA;EAAA,IAEzC,WAAW,aAAA,EAAe;EAKxB,MAAA,CAAA,GAAI,QAAA,CAAS,aAAA,GAAgB,QAAA,GAAW,CAAC,CAAA;EAAA,IAC3C;EAEA,IAAA,IAAI,MAAA,EAAQ;EACV,MAAA,IAAA,GAAO,IAAIA,WAAU,GAAG,CAAA;EACxB,MAAA,IAAI,MAAA,IAAU,CAAA,GAAI,CAAA;EAClB,MAAA,MAAA,GAAS,MAAM,CAAC,CAAA;EAAA,IAClB,CAAA,MAAO;EACL,MAAA,CAAA,GAAI,IAAA,CAAK,GAAA,CAAI,CAAC,OAAA,CAAQ,CAAC,CAAC,CAAA;EACxB,MAAA,MAAA,GAAS,CAAA,GAAI,CAAA;EAAA,IACf;EAEA,IAAA,CAAA,GAAI,IAAIA,WAAU,GAAG,CAAA;EAGrB,IAAA,WAAU;EAER,MAAA,IAAI,MAAA,EAAQ;EACV,QAAA,CAAA,GAAI,CAAA,CAAE,MAAM,CAAC,CAAA;EACb,QAAA,IAAI,CAAC,EAAE,CAAA,EAAG;EAEV,QAAA,IAAI,CAAA,EAAG;EACL,UAAA,IAAI,EAAE,CAAA,CAAE,MAAA,GAAS,CAAA,EAAG,CAAA,CAAE,EAAE,MAAA,GAAS,CAAA;EAAA,QACnC,WAAW,QAAA,EAAU;EACnB,UAAA,CAAA,GAAI,CAAA,CAAE,IAAI,CAAC,CAAA;EAAA,QACb;EAAA,MACF;EAEA,MAAA,IAAI,CAAA,EAAG;EACL,QAAA,CAAA,GAAI,SAAA,CAAU,IAAI,CAAC,CAAA;EACnB,QAAA,IAAI,MAAM,CAAA,EAAG;EACb,QAAA,MAAA,GAAS,CAAA,GAAI,CAAA;EAAA,MACf,CAAA,MAAO;EACL,QAAA,CAAA,GAAI,CAAA,CAAE,MAAM,IAAI,CAAA;EAChB,QAAA,KAAA,CAAM,CAAA,EAAG,CAAA,CAAE,CAAA,GAAI,CAAA,EAAG,CAAC,CAAA;EAEnB,QAAA,IAAI,CAAA,CAAE,IAAI,EAAA,EAAI;EACZ,UAAA,MAAA,GAAS,MAAM,CAAC,CAAA;EAAA,QAClB,CAAA,MAAO;EACL,UAAA,CAAA,GAAI,CAAC,QAAQ,CAAC,CAAA;EACd,UAAA,IAAI,MAAM,CAAA,EAAG;EACb,UAAA,MAAA,GAAS,CAAA,GAAI,CAAA;EAAA,QACf;EAAA,MACF;EAEA,MAAA,CAAA,GAAI,CAAA,CAAE,MAAM,CAAC,CAAA;EAEb,MAAA,IAAI,CAAA,EAAG;EACL,QAAA,IAAI,CAAA,CAAE,KAAK,CAAA,CAAE,CAAA,CAAE,SAAS,CAAA,EAAG,CAAA,CAAE,EAAE,MAAA,GAAS,CAAA;EAAA,MAC1C,WAAW,QAAA,EAAU;EACnB,QAAA,CAAA,GAAI,CAAA,CAAE,IAAI,CAAC,CAAA;EAAA,MACb;EAAA,IACF;EAEA,IAAA,IAAI,UAAU,OAAO,CAAA;EACrB,IAAA,IAAI,MAAA,EAAQ,CAAA,GAAI,GAAA,CAAI,GAAA,CAAI,CAAC,CAAA;EAEzB,IAAA,OAAO,CAAA,GAAI,CAAA,CAAE,GAAA,CAAI,CAAC,CAAA,GAAI,CAAA,GAAI,KAAA,CAAM,CAAA,EAAG,aAAA,EAAe,aAAA,EAAe,IAAI,CAAA,GAAI,CAAA;EAAA,EAC3E,CAAA;EAWA,EAAA,CAAA,CAAE,YAAA,GAAe,SAAU,EAAA,EAAI;EAC7B,IAAA,IAAI,CAAA,GAAI,IAAIA,UAAAA,CAAU,IAAI,CAAA;EAC1B,IAAA,IAAI,EAAA,IAAM,MAAM,EAAA,GAAK,aAAA;EAAA,SAChB,QAAA,CAAS,EAAA,EAAI,CAAA,EAAG,CAAC,CAAA;EACtB,IAAA,OAAO,KAAA,CAAM,CAAA,EAAG,CAAA,CAAE,CAAA,GAAI,GAAG,EAAE,CAAA;EAAA,EAC7B,CAAA;EAOA,EAAA,CAAA,CAAE,SAAA,GAAY,CAAA,CAAE,EAAA,GAAK,SAAU,GAAG,CAAA,EAAG;EACnC,IAAA,OAAO,QAAQ,IAAA,EAAM,IAAIA,WAAU,CAAA,EAAG,CAAC,CAAC,CAAA,KAAM,CAAA;EAAA,EAChD,CAAA;EAMA,EAAA,CAAA,CAAE,WAAW,WAAY;EACvB,IAAA,OAAO,CAAC,CAAC,IAAA,CAAK,CAAA;EAAA,EAChB,CAAA;EAOA,EAAA,CAAA,CAAE,aAAA,GAAgB,CAAA,CAAE,EAAA,GAAK,SAAU,GAAG,CAAA,EAAG;EACvC,IAAA,OAAO,QAAQ,IAAA,EAAM,IAAIA,WAAU,CAAA,EAAG,CAAC,CAAC,CAAA,GAAI,CAAA;EAAA,EAC9C,CAAA;EAOA,EAAA,CAAA,CAAE,sBAAA,GAAyB,CAAA,CAAE,GAAA,GAAM,SAAU,GAAG,CAAA,EAAG;EACjD,IAAA,OAAA,CAAQ,CAAA,GAAI,OAAA,CAAQ,IAAA,EAAM,IAAIA,UAAAA,CAAU,GAAG,CAAC,CAAC,CAAA,MAAO,CAAA,IAAK,CAAA,KAAM,CAAA;EAAA,EAEjE,CAAA;EAMA,EAAA,CAAA,CAAE,YAAY,WAAY;EACxB,IAAA,OAAO,CAAC,CAAC,IAAA,CAAK,CAAA,IAAK,QAAA,CAAS,IAAA,CAAK,CAAA,GAAI,QAAQ,CAAA,GAAI,IAAA,CAAK,CAAA,CAAE,MAAA,GAAS,CAAA;EAAA,EACnE,CAAA;EAOA,EAAA,CAAA,CAAE,UAAA,GAAa,CAAA,CAAE,EAAA,GAAK,SAAU,GAAG,CAAA,EAAG;EACpC,IAAA,OAAO,QAAQ,IAAA,EAAM,IAAIA,WAAU,CAAA,EAAG,CAAC,CAAC,CAAA,GAAI,CAAA;EAAA,EAC9C,CAAA;EAOA,EAAA,CAAA,CAAE,mBAAA,GAAsB,CAAA,CAAE,GAAA,GAAM,SAAU,GAAG,CAAA,EAAG;EAC9C,IAAA,OAAA,CAAQ,CAAA,GAAI,OAAA,CAAQ,IAAA,EAAM,IAAIA,UAAAA,CAAU,GAAG,CAAC,CAAC,CAAA,MAAO,EAAA,IAAM,CAAA,KAAM,CAAA;EAAA,EAClE,CAAA;EAMA,EAAA,CAAA,CAAE,QAAQ,WAAY;EACpB,IAAA,OAAO,CAAC,IAAA,CAAK,CAAA;EAAA,EACf,CAAA;EAMA,EAAA,CAAA,CAAE,aAAa,WAAY;EACzB,IAAA,OAAO,KAAK,CAAA,GAAI,CAAA;EAAA,EAClB,CAAA;EAMA,EAAA,CAAA,CAAE,aAAa,WAAY;EACzB,IAAA,OAAO,KAAK,CAAA,GAAI,CAAA;EAAA,EAClB,CAAA;EAMA,EAAA,CAAA,CAAE,SAAS,WAAY;EACrB,IAAA,OAAO,CAAC,CAAC,IAAA,CAAK,KAAK,IAAA,CAAK,CAAA,CAAE,CAAC,CAAA,IAAK,CAAA;EAAA,EAClC,CAAA;EAuBA,EAAA,CAAA,CAAE,KAAA,GAAQ,SAAU,CAAA,EAAG,CAAA,EAAG;EACxB,IAAA,IAAI,GAAG,CAAA,EAAG,CAAA,EAAG,MACX,CAAA,GAAI,IAAA,EACJ,IAAI,CAAA,CAAE,CAAA;EAER,IAAA,CAAA,GAAI,IAAIA,UAAAA,CAAU,CAAA,EAAG,CAAC,CAAA;EACtB,IAAA,CAAA,GAAI,CAAA,CAAE,CAAA;EAGN,IAAA,IAAI,CAAC,CAAA,IAAK,CAAC,GAAG,OAAO,IAAIA,WAAU,GAAG,CAAA;EAGtC,IAAA,IAAI,KAAK,CAAA,EAAG;EACV,MAAA,CAAA,CAAE,IAAI,CAAC,CAAA;EACP,MAAA,OAAO,CAAA,CAAE,KAAK,CAAC,CAAA;EAAA,IACjB;EAEA,IAAA,IAAI,EAAA,GAAK,CAAA,CAAE,CAAA,GAAI,QAAA,EACb,EAAA,GAAK,CAAA,CAAE,CAAA,GAAI,QAAA,EACX,EAAA,GAAK,CAAA,CAAE,CAAA,EACP,EAAA,GAAK,CAAA,CAAE,CAAA;EAET,IAAA,IAAI,CAAC,EAAA,IAAM,CAAC,EAAA,EAAI;EAGd,MAAA,IAAI,CAAC,EAAA,IAAM,CAAC,EAAA,SAAW,EAAA,IAAM,CAAA,CAAE,CAAA,GAAI,CAAC,GAAG,CAAA,IAAK,IAAIA,UAAAA,CAAU,EAAA,GAAK,IAAI,GAAG,CAAA;EAGtE,MAAA,IAAI,CAAC,EAAA,CAAG,CAAC,KAAK,CAAC,EAAA,CAAG,CAAC,CAAA,EAAG;EAGpB,QAAA,OAAO,EAAA,CAAG,CAAC,CAAA,IAAK,CAAA,CAAE,CAAA,GAAI,CAAC,CAAA,EAAG,CAAA,IAAK,IAAIA,UAAAA,CAAU,EAAA,CAAG,CAAC,CAAA,GAAI,CAAA;EAAA;EAAA,UAGpD,aAAA,IAAiB,IAAI,EAAA,GAAK;EAAA,SAAC,CAAA;EAAA,MAC9B;EAAA,IACF;EAEA,IAAA,EAAA,GAAK,SAAS,EAAE,CAAA;EAChB,IAAA,EAAA,GAAK,SAAS,EAAE,CAAA;EAChB,IAAA,EAAA,GAAK,GAAG,KAAA,EAAM;EAGd,IAAA,IAAI,CAAA,GAAI,KAAK,EAAA,EAAI;EAEf,MAAA,IAAI,IAAA,GAAO,IAAI,CAAA,EAAG;EAChB,QAAA,CAAA,GAAI,CAAC,CAAA;EACL,QAAA,CAAA,GAAI,EAAA;EAAA,MACN,CAAA,MAAO;EACL,QAAA,EAAA,GAAK,EAAA;EACL,QAAA,CAAA,GAAI,EAAA;EAAA,MACN;EAEA,MAAA,CAAA,CAAE,OAAA,EAAQ;EAGV,MAAA,KAAK,IAAI,CAAA,EAAG,CAAA,EAAA,EAAK,CAAA,CAAE,IAAA,CAAK,CAAC,CAAA,EAAE;EAC3B,MAAA,CAAA,CAAE,OAAA,EAAQ;EAAA,IACZ,CAAA,MAAO;EAGL,MAAA,CAAA,GAAA,CAAK,QAAQ,CAAA,GAAI,EAAA,CAAG,WAAW,CAAA,GAAI,EAAA,CAAG,WAAW,CAAA,GAAI,CAAA;EAErD,MAAA,KAAK,CAAA,GAAI,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,GAAG,CAAA,EAAA,EAAK;EAE1B,QAAA,IAAI,EAAA,CAAG,CAAC,CAAA,IAAK,EAAA,CAAG,CAAC,CAAA,EAAG;EAClB,UAAA,IAAA,GAAO,EAAA,CAAG,CAAC,CAAA,GAAI,EAAA,CAAG,CAAC,CAAA;EACnB,UAAA;EAAA,QACF;EAAA,MACF;EAAA,IACF;EAGA,IAAA,IAAI,IAAA,EAAM;EACR,MAAA,CAAA,GAAI,EAAA;EACJ,MAAA,EAAA,GAAK,EAAA;EACL,MAAA,EAAA,GAAK,CAAA;EACL,MAAA,CAAA,CAAE,CAAA,GAAI,CAAC,CAAA,CAAE,CAAA;EAAA,IACX;EAEA,IAAA,CAAA,GAAA,CAAK,CAAA,GAAI,EAAA,CAAG,MAAA,KAAW,CAAA,GAAI,EAAA,CAAG,MAAA,CAAA;EAI9B,IAAA,IAAI,IAAI,CAAA,EAAG,OAAO,KAAK,EAAA,CAAG,CAAA,EAAG,IAAI,CAAA,EAAE;EACnC,IAAA,CAAA,GAAI,IAAA,GAAO,CAAA;EAGX,IAAA,OAAO,IAAI,CAAA,IAAI;EAEb,MAAA,IAAI,GAAG,EAAE,CAAC,CAAA,GAAI,EAAA,CAAG,CAAC,CAAA,EAAG;EACnB,QAAA,KAAK,CAAA,GAAI,CAAA,EAAG,CAAA,IAAK,CAAC,EAAA,CAAG,EAAE,CAAC,CAAA,EAAG,EAAA,CAAG,CAAC,CAAA,GAAI,CAAA,EAAE;EACrC,QAAA,EAAE,GAAG,CAAC,CAAA;EACN,QAAA,EAAA,CAAG,CAAC,CAAA,IAAK,IAAA;EAAA,MACX;EAEA,MAAA,EAAA,CAAG,CAAC,CAAA,IAAK,EAAA,CAAG,CAAC,CAAA;EAAA,IACf;EAGA,IAAA,OAAO,EAAA,CAAG,CAAC,CAAA,IAAK,CAAA,EAAG,EAAA,CAAG,OAAO,CAAA,EAAG,CAAC,CAAA,EAAG,EAAE,EAAA,EAAG;EAGzC,IAAA,IAAI,CAAC,EAAA,CAAG,CAAC,CAAA,EAAG;EAIV,MAAA,CAAA,CAAE,CAAA,GAAI,aAAA,IAAiB,CAAA,GAAI,EAAA,GAAK,CAAA;EAChC,MAAA,CAAA,CAAE,CAAA,GAAI,CAAC,CAAA,CAAE,CAAA,GAAI,CAAC,CAAA;EACd,MAAA,OAAO,CAAA;EAAA,IACT;EAIA,IAAA,OAAO,SAAA,CAAU,CAAA,EAAG,EAAA,EAAI,EAAE,CAAA;EAAA,EAC5B,CAAA;EAwBA,EAAA,CAAA,CAAE,MAAA,GAAS,CAAA,CAAE,GAAA,GAAM,SAAU,GAAG,CAAA,EAAG;EACjC,IAAA,IAAI,CAAA,EAAG,GACL,CAAA,GAAI,IAAA;EAEN,IAAA,CAAA,GAAI,IAAIA,UAAAA,CAAU,CAAA,EAAG,CAAC,CAAA;EAGtB,IAAA,IAAI,CAAC,CAAA,CAAE,CAAA,IAAK,CAAC,CAAA,CAAE,CAAA,IAAK,CAAA,CAAE,CAAA,IAAK,CAAC,CAAA,CAAE,CAAA,CAAE,CAAC,CAAA,EAAG;EAClC,MAAA,OAAO,IAAIA,WAAU,GAAG,CAAA;EAAA,IAG1B,CAAA,MAAA,IAAW,CAAC,CAAA,CAAE,CAAA,IAAK,CAAA,CAAE,KAAK,CAAC,CAAA,CAAE,CAAA,CAAE,CAAC,CAAA,EAAG;EACjC,MAAA,OAAO,IAAIA,WAAU,CAAC,CAAA;EAAA,IACxB;EAEA,IAAA,IAAI,eAAe,CAAA,EAAG;EAIpB,MAAA,CAAA,GAAI,CAAA,CAAE,CAAA;EACN,MAAA,CAAA,CAAE,CAAA,GAAI,CAAA;EACN,MAAA,CAAA,GAAI,GAAA,CAAI,CAAA,EAAG,CAAA,EAAG,CAAA,EAAG,CAAC,CAAA;EAClB,MAAA,CAAA,CAAE,CAAA,GAAI,CAAA;EACN,MAAA,CAAA,CAAE,CAAA,IAAK,CAAA;EAAA,IACT,CAAA,MAAO;EACL,MAAA,CAAA,GAAI,GAAA,CAAI,CAAA,EAAG,CAAA,EAAG,CAAA,EAAG,WAAW,CAAA;EAAA,IAC9B;EAEA,IAAA,CAAA,GAAI,CAAA,CAAE,KAAA,CAAM,CAAA,CAAE,KAAA,CAAM,CAAC,CAAC,CAAA;EAGtB,IAAA,IAAI,CAAC,EAAE,CAAA,CAAE,CAAC,KAAK,WAAA,IAAe,CAAA,EAAG,CAAA,CAAE,CAAA,GAAI,CAAA,CAAE,CAAA;EAEzC,IAAA,OAAO,CAAA;EAAA,EACT,CAAA;EAuBA,EAAA,CAAA,CAAE,YAAA,GAAe,CAAA,CAAE,KAAA,GAAQ,SAAU,GAAG,CAAA,EAAG;EACzC,IAAA,IAAI,CAAA,EAAG,CAAA,EAAG,CAAA,EAAG,CAAA,EAAG,CAAA,EAAG,CAAA,EAAG,GAAA,EAAK,GAAA,EAAK,GAAA,EAAK,GAAA,EAAK,GAAA,EAAK,GAAA,EAAK,EAAA,EAClD,MAAM,QAAA,EACN,CAAA,GAAI,IAAA,EACJ,EAAA,GAAK,CAAA,CAAE,CAAA,EACP,EAAA,GAAA,CAAM,CAAA,GAAI,IAAIA,UAAAA,CAAU,CAAA,EAAG,CAAC,CAAA,EAAG,CAAA;EAGjC,IAAA,IAAI,CAAC,EAAA,IAAM,CAAC,EAAA,IAAM,CAAC,EAAA,CAAG,CAAC,CAAA,IAAK,CAAC,EAAA,CAAG,CAAC,CAAA,EAAG;EAGlC,MAAA,IAAI,CAAC,CAAA,CAAE,CAAA,IAAK,CAAC,CAAA,CAAE,CAAA,IAAK,MAAM,CAAC,EAAA,CAAG,CAAC,CAAA,IAAK,CAAC,MAAM,EAAA,IAAM,CAAC,GAAG,CAAC,CAAA,IAAK,CAAC,EAAA,EAAI;EAC9D,QAAA,CAAA,CAAE,CAAA,GAAI,CAAA,CAAE,CAAA,GAAI,CAAA,CAAE,CAAA,GAAI,IAAA;EAAA,MACpB,CAAA,MAAO;EACL,QAAA,CAAA,CAAE,KAAK,CAAA,CAAE,CAAA;EAGT,QAAA,IAAI,CAAC,EAAA,IAAM,CAAC,EAAA,EAAI;EACd,UAAA,CAAA,CAAE,CAAA,GAAI,EAAE,CAAA,GAAI,IAAA;EAAA,QAGd,CAAA,MAAO;EACL,UAAA,CAAA,CAAE,CAAA,GAAI,CAAC,CAAC,CAAA;EACR,UAAA,CAAA,CAAE,CAAA,GAAI,CAAA;EAAA,QACR;EAAA,MACF;EAEA,MAAA,OAAO,CAAA;EAAA,IACT;EAEA,IAAA,CAAA,GAAI,QAAA,CAAS,EAAE,CAAA,GAAI,QAAQ,IAAI,QAAA,CAAS,CAAA,CAAE,IAAI,QAAQ,CAAA;EACtD,IAAA,CAAA,CAAE,KAAK,CAAA,CAAE,CAAA;EACT,IAAA,GAAA,GAAM,EAAA,CAAG,MAAA;EACT,IAAA,GAAA,GAAM,EAAA,CAAG,MAAA;EAGT,IAAA,IAAI,MAAM,GAAA,EAAK;EACb,MAAA,EAAA,GAAK,EAAA;EACL,MAAA,EAAA,GAAK,EAAA;EACL,MAAA,EAAA,GAAK,EAAA;EACL,MAAA,CAAA,GAAI,GAAA;EACJ,MAAA,GAAA,GAAM,GAAA;EACN,MAAA,GAAA,GAAM,CAAA;EAAA,IACR;EAGA,IAAA,KAAK,CAAA,GAAI,GAAA,GAAM,GAAA,EAAK,EAAA,GAAK,IAAI,CAAA,EAAA,EAAK,EAAA,CAAG,IAAA,CAAK,CAAC,CAAA,EAAE;EAE7C,IAAA,IAAA,GAAO,IAAA;EACP,IAAA,QAAA,GAAW,SAAA;EAEX,IAAA,KAAK,CAAA,GAAI,GAAA,EAAK,EAAE,CAAA,IAAK,CAAA,IAAI;EACvB,MAAA,CAAA,GAAI,CAAA;EACJ,MAAA,GAAA,GAAM,EAAA,CAAG,CAAC,CAAA,GAAI,QAAA;EACd,MAAA,GAAA,GAAM,EAAA,CAAG,CAAC,CAAA,GAAI,QAAA,GAAW,CAAA;EAEzB,MAAA,KAAK,IAAI,GAAA,EAAK,CAAA,GAAI,CAAA,GAAI,CAAA,EAAG,IAAI,CAAA,IAAI;EAC/B,QAAA,GAAA,GAAM,EAAA,CAAG,EAAE,CAAC,CAAA,GAAI,QAAA;EAChB,QAAA,GAAA,GAAM,EAAA,CAAG,CAAC,CAAA,GAAI,QAAA,GAAW,CAAA;EACzB,QAAA,CAAA,GAAI,GAAA,GAAM,MAAM,GAAA,GAAM,GAAA;EACtB,QAAA,GAAA,GAAM,MAAM,GAAA,GAAQ,CAAA,GAAI,WAAY,QAAA,GAAY,EAAA,CAAG,CAAC,CAAA,GAAI,CAAA;EACxD,QAAA,CAAA,GAAA,CAAK,MAAM,IAAA,GAAO,CAAA,KAAM,CAAA,GAAI,QAAA,GAAW,KAAK,GAAA,GAAM,GAAA;EAClD,QAAA,EAAA,CAAG,CAAA,EAAG,IAAI,GAAA,GAAM,IAAA;EAAA,MAClB;EAEA,MAAA,EAAA,CAAG,CAAC,CAAA,GAAI,CAAA;EAAA,IACV;EAEA,IAAA,IAAI,CAAA,EAAG;EACL,MAAA,EAAE,CAAA;EAAA,IACJ,CAAA,MAAO;EACL,MAAA,EAAA,CAAG,MAAA,CAAO,GAAG,CAAC,CAAA;EAAA,IAChB;EAEA,IAAA,OAAO,SAAA,CAAU,CAAA,EAAG,EAAA,EAAI,CAAC,CAAA;EAAA,EAC3B,CAAA;EAOA,EAAA,CAAA,CAAE,UAAU,WAAY;EACtB,IAAA,IAAI,CAAA,GAAI,IAAIA,UAAAA,CAAU,IAAI,CAAA;EAC1B,IAAA,CAAA,CAAE,CAAA,GAAI,CAAC,CAAA,CAAE,CAAA,IAAK,IAAA;EACd,IAAA,OAAO,CAAA;EAAA,EACT,CAAA;EAuBA,EAAA,CAAA,CAAE,IAAA,GAAO,SAAU,CAAA,EAAG,CAAA,EAAG;EACvB,IAAA,IAAI,CAAA,EACF,CAAA,GAAI,IAAA,EACJ,CAAA,GAAI,CAAA,CAAE,CAAA;EAER,IAAA,CAAA,GAAI,IAAIA,UAAAA,CAAU,CAAA,EAAG,CAAC,CAAA;EACtB,IAAA,CAAA,GAAI,CAAA,CAAE,CAAA;EAGN,IAAA,IAAI,CAAC,CAAA,IAAK,CAAC,GAAG,OAAO,IAAIA,WAAU,GAAG,CAAA;EAGrC,IAAA,IAAI,KAAK,CAAA,EAAG;EACX,MAAA,CAAA,CAAE,IAAI,CAAC,CAAA;EACP,MAAA,OAAO,CAAA,CAAE,MAAM,CAAC,CAAA;EAAA,IAClB;EAEA,IAAA,IAAI,EAAA,GAAK,CAAA,CAAE,CAAA,GAAI,QAAA,EACb,EAAA,GAAK,CAAA,CAAE,CAAA,GAAI,QAAA,EACX,EAAA,GAAK,CAAA,CAAE,CAAA,EACP,EAAA,GAAK,CAAA,CAAE,CAAA;EAET,IAAA,IAAI,CAAC,EAAA,IAAM,CAAC,EAAA,EAAI;EAGd,MAAA,IAAI,CAAC,MAAM,CAAC,EAAA,SAAW,IAAIA,UAAAA,CAAU,IAAI,CAAC,CAAA;EAI1C,MAAA,IAAI,CAAC,GAAG,CAAC,CAAA,IAAK,CAAC,EAAA,CAAG,CAAC,GAAG,OAAO,EAAA,CAAG,CAAC,CAAA,GAAI,CAAA,GAAI,IAAIA,UAAAA,CAAU,EAAA,CAAG,CAAC,CAAA,GAAI,CAAA,GAAI,IAAI,CAAC,CAAA;EAAA,IAC1E;EAEA,IAAA,EAAA,GAAK,SAAS,EAAE,CAAA;EAChB,IAAA,EAAA,GAAK,SAAS,EAAE,CAAA;EAChB,IAAA,EAAA,GAAK,GAAG,KAAA,EAAM;EAGd,IAAA,IAAI,CAAA,GAAI,KAAK,EAAA,EAAI;EACf,MAAA,IAAI,IAAI,CAAA,EAAG;EACT,QAAA,EAAA,GAAK,EAAA;EACL,QAAA,CAAA,GAAI,EAAA;EAAA,MACN,CAAA,MAAO;EACL,QAAA,CAAA,GAAI,CAAC,CAAA;EACL,QAAA,CAAA,GAAI,EAAA;EAAA,MACN;EAEA,MAAA,CAAA,CAAE,OAAA,EAAQ;EACV,MAAA,OAAO,CAAA,EAAA,EAAK,CAAA,CAAE,IAAA,CAAK,CAAC,CAAA,EAAE;EACtB,MAAA,CAAA,CAAE,OAAA,EAAQ;EAAA,IACZ;EAEA,IAAA,CAAA,GAAI,EAAA,CAAG,MAAA;EACP,IAAA,CAAA,GAAI,EAAA,CAAG,MAAA;EAGP,IAAA,IAAI,CAAA,GAAI,IAAI,CAAA,EAAG;EACb,MAAA,CAAA,GAAI,EAAA;EACJ,MAAA,EAAA,GAAK,EAAA;EACL,MAAA,EAAA,GAAK,CAAA;EACL,MAAA,CAAA,GAAI,CAAA;EAAA,IACN;EAGA,IAAA,KAAK,CAAA,GAAI,GAAG,CAAA,IAAI;EACd,MAAA,CAAA,GAAA,CAAK,EAAA,CAAG,EAAE,CAAC,CAAA,GAAI,EAAA,CAAG,CAAC,CAAA,GAAI,EAAA,CAAG,CAAC,CAAA,GAAI,CAAA,IAAK,IAAA,GAAO,CAAA;EAC3C,MAAA,EAAA,CAAG,CAAC,IAAI,IAAA,KAAS,EAAA,CAAG,CAAC,CAAA,GAAI,CAAA,GAAI,EAAA,CAAG,CAAC,CAAA,GAAI,IAAA;EAAA,IACvC;EAEA,IAAA,IAAI,CAAA,EAAG;EACL,MAAA,EAAA,GAAK,CAAC,CAAC,CAAA,CAAE,MAAA,CAAO,EAAE,CAAA;EAClB,MAAA,EAAE,EAAA;EAAA,IACJ;EAIA,IAAA,OAAO,SAAA,CAAU,CAAA,EAAG,EAAA,EAAI,EAAE,CAAA;EAAA,EAC5B,CAAA;EAkBA,EAAA,CAAA,CAAE,SAAA,GAAY,CAAA,CAAE,EAAA,GAAK,SAAU,IAAI,EAAA,EAAI;EACrC,IAAA,IAAI,CAAA,EAAG,CAAA,EAAG,CAAA,EACR,CAAA,GAAI,IAAA;EAEN,IAAA,IAAI,EAAA,IAAM,IAAA,IAAQ,EAAA,KAAO,CAAC,CAAC,EAAA,EAAI;EAC7B,MAAA,QAAA,CAAS,EAAA,EAAI,GAAG,GAAG,CAAA;EACnB,MAAA,IAAI,EAAA,IAAM,MAAM,EAAA,GAAK,aAAA;EAAA,WAChB,QAAA,CAAS,EAAA,EAAI,CAAA,EAAG,CAAC,CAAA;EAEtB,MAAA,OAAO,MAAM,IAAIA,UAAAA,CAAU,CAAC,CAAA,EAAG,IAAI,EAAE,CAAA;EAAA,IACvC;EAEA,IAAA,IAAI,EAAE,CAAA,GAAI,CAAA,CAAE,CAAA,CAAA,EAAI,OAAO,IAAA;EACvB,IAAA,CAAA,GAAI,EAAE,MAAA,GAAS,CAAA;EACf,IAAA,CAAA,GAAI,IAAI,QAAA,GAAW,CAAA;EAEnB,IAAA,IAAI,CAAA,GAAI,CAAA,CAAE,CAAC,CAAA,EAAG;EAGZ,MAAA,OAAO,CAAA,GAAI,EAAA,IAAM,CAAA,EAAG,CAAA,IAAK,IAAI,CAAA,EAAA,EAAI;EAGjC,MAAA,KAAK,CAAA,GAAI,EAAE,CAAC,CAAA,EAAG,KAAK,EAAA,EAAI,CAAA,IAAK,IAAI,CAAA,EAAA,EAAI;EAAA,IACvC;EAEA,IAAA,IAAI,MAAM,CAAA,CAAE,CAAA,GAAI,IAAI,CAAA,EAAG,CAAA,GAAI,EAAE,CAAA,GAAI,CAAA;EAEjC,IAAA,OAAO,CAAA;EAAA,EACT,CAAA;EAWA,EAAA,CAAA,CAAE,SAAA,GAAY,SAAU,CAAA,EAAG;EACzB,IAAA,QAAA,CAAS,CAAA,EAAG,CAAC,gBAAA,EAAkB,gBAAgB,CAAA;EAC/C,IAAA,OAAO,IAAA,CAAK,KAAA,CAAM,IAAA,GAAO,CAAC,CAAA;EAAA,EAC5B,CAAA;EAcA,EAAA,CAAA,CAAE,UAAA,GAAa,CAAA,CAAE,IAAA,GAAO,WAAY;EAClC,IAAA,IAAI,CAAA,EAAG,GAAG,CAAA,EAAG,GAAA,EAAK,GAChB,CAAA,GAAI,IAAA,EACJ,CAAA,GAAI,CAAA,CAAE,CAAA,EACN,CAAA,GAAI,EAAE,CAAA,EACN,CAAA,GAAI,EAAE,CAAA,EACN,EAAA,GAAK,iBAAiB,CAAA,EACtB,IAAA,GAAO,IAAIA,UAAAA,CAAU,KAAK,CAAA;EAG5B,IAAA,IAAI,MAAM,CAAA,IAAK,CAAC,KAAK,CAAC,CAAA,CAAE,CAAC,CAAA,EAAG;EAC1B,MAAA,OAAO,IAAIA,UAAAA,CAAU,CAAC,CAAA,IAAK,IAAI,CAAA,KAAM,CAAC,CAAA,IAAK,CAAA,CAAE,CAAC,CAAA,CAAA,GAAK,GAAA,GAAM,CAAA,GAAI,CAAA,GAAI,IAAI,CAAC,CAAA;EAAA,IACxE;EAGA,IAAA,CAAA,GAAI,IAAA,CAAK,IAAA,CAAK,CAAC,OAAA,CAAQ,CAAC,CAAC,CAAA;EAIzB,IAAA,IAAI,CAAA,IAAK,CAAA,IAAK,CAAA,IAAK,CAAA,GAAI,CAAA,EAAG;EACxB,MAAA,CAAA,GAAI,cAAc,CAAC,CAAA;EACnB,MAAA,IAAA,CAAK,CAAA,CAAE,MAAA,GAAS,CAAA,IAAK,CAAA,IAAK,GAAG,CAAA,IAAK,GAAA;EAClC,MAAA,CAAA,GAAI,IAAA,CAAK,IAAA,CAAK,CAAC,CAAC,CAAA;EAChB,MAAA,CAAA,GAAI,UAAU,CAAA,GAAI,CAAA,IAAK,CAAC,CAAA,IAAK,CAAA,GAAI,KAAK,CAAA,GAAI,CAAA,CAAA;EAE1C,MAAA,IAAI,CAAA,IAAK,IAAI,CAAA,EAAG;EACd,QAAA,CAAA,GAAI,IAAA,GAAO,CAAA;EAAA,MACb,CAAA,MAAO;EACL,QAAA,CAAA,GAAI,EAAE,aAAA,EAAc;EACpB,QAAA,CAAA,GAAI,CAAA,CAAE,MAAM,CAAA,EAAG,CAAA,CAAE,QAAQ,GAAG,CAAA,GAAI,CAAC,CAAA,GAAI,CAAA;EAAA,MACvC;EAEA,MAAA,CAAA,GAAI,IAAIA,WAAU,CAAC,CAAA;EAAA,IACrB,CAAA,MAAO;EACL,MAAA,CAAA,GAAI,IAAIA,UAAAA,CAAU,CAAA,GAAI,EAAE,CAAA;EAAA,IAC1B;EAMA,IAAA,IAAI,CAAA,CAAE,CAAA,CAAE,CAAC,CAAA,EAAG;EACV,MAAA,CAAA,GAAI,CAAA,CAAE,CAAA;EACN,MAAA,CAAA,GAAI,CAAA,GAAI,EAAA;EACR,MAAA,IAAI,CAAA,GAAI,GAAG,CAAA,GAAI,CAAA;EAGf,MAAA,WAAU;EACR,QAAA,CAAA,GAAI,CAAA;EACJ,QAAA,CAAA,GAAI,IAAA,CAAK,KAAA,CAAM,CAAA,CAAE,IAAA,CAAK,GAAA,CAAI,GAAG,CAAA,EAAG,EAAA,EAAI,CAAC,CAAC,CAAC,CAAA;EAEvC,QAAA,IAAI,cAAc,CAAA,CAAE,CAAC,CAAA,CAAE,KAAA,CAAM,GAAG,CAAC,CAAA,KAAA,CAAO,CAAA,GAAI,aAAA,CAAc,EAAE,CAAC,CAAA,EAAG,KAAA,CAAM,CAAA,EAAG,CAAC,CAAA,EAAG;EAK3E,UAAA,IAAI,CAAA,CAAE,CAAA,GAAI,CAAA,EAAG,EAAE,CAAA;EACf,UAAA,CAAA,GAAI,CAAA,CAAE,KAAA,CAAM,CAAA,GAAI,CAAA,EAAG,IAAI,CAAC,CAAA;EAKxB,UAAA,IAAI,CAAA,IAAK,MAAA,IAAU,CAAC,GAAA,IAAO,KAAK,MAAA,EAAQ;EAItC,YAAA,IAAI,CAAC,GAAA,EAAK;EACR,cAAA,KAAA,CAAM,CAAA,EAAG,CAAA,CAAE,CAAA,GAAI,cAAA,GAAiB,GAAG,CAAC,CAAA;EAEpC,cAAA,IAAI,EAAE,KAAA,CAAM,CAAC,CAAA,CAAE,EAAA,CAAG,CAAC,CAAA,EAAG;EACpB,gBAAA,CAAA,GAAI,CAAA;EACJ,gBAAA;EAAA,cACF;EAAA,YACF;EAEA,YAAA,EAAA,IAAM,CAAA;EACN,YAAA,CAAA,IAAK,CAAA;EACL,YAAA,GAAA,GAAM,CAAA;EAAA,UACR,CAAA,MAAO;EAIL,YAAA,IAAI,CAAC,CAAC,CAAA,IAAK,CAAC,CAAC,CAAA,CAAE,KAAA,CAAM,CAAC,CAAA,IAAK,CAAA,CAAE,MAAA,CAAO,CAAC,KAAK,GAAA,EAAK;EAG7C,cAAA,KAAA,CAAM,CAAA,EAAG,CAAA,CAAE,CAAA,GAAI,cAAA,GAAiB,GAAG,CAAC,CAAA;EACpC,cAAA,CAAA,GAAI,CAAC,CAAA,CAAE,KAAA,CAAM,CAAC,CAAA,CAAE,GAAG,CAAC,CAAA;EAAA,YACtB;EAEA,YAAA;EAAA,UACF;EAAA,QACF;EAAA,MACF;EAAA,IACF;EAEA,IAAA,OAAO,MAAM,CAAA,EAAG,CAAA,CAAE,IAAI,cAAA,GAAiB,CAAA,EAAG,eAAe,CAAC,CAAA;EAAA,EAC5D,CAAA;EAYA,EAAA,CAAA,CAAE,aAAA,GAAgB,SAAU,EAAA,EAAI,EAAA,EAAI;EAClC,IAAA,IAAI,MAAM,IAAA,EAAM;EACd,MAAA,QAAA,CAAS,EAAA,EAAI,GAAG,GAAG,CAAA;EACnB,MAAA,EAAA,EAAA;EAAA,IACF;EACA,IAAA,OAAO,MAAA,CAAO,IAAA,EAAM,EAAA,EAAI,EAAA,EAAI,CAAC,CAAA;EAAA,EAC/B,CAAA;EAeA,EAAA,CAAA,CAAE,OAAA,GAAU,SAAU,EAAA,EAAI,EAAA,EAAI;EAC5B,IAAA,IAAI,MAAM,IAAA,EAAM;EACd,MAAA,QAAA,CAAS,EAAA,EAAI,GAAG,GAAG,CAAA;EACnB,MAAA,EAAA,GAAK,EAAA,GAAK,KAAK,CAAA,GAAI,CAAA;EAAA,IACrB;EACA,IAAA,OAAO,MAAA,CAAO,IAAA,EAAM,EAAA,EAAI,EAAE,CAAA;EAAA,EAC5B,CAAA;EA4BA,EAAA,CAAA,CAAE,QAAA,GAAW,SAAU,EAAA,EAAI,EAAA,EAAIG,OAAAA,EAAQ;EACrC,IAAA,IAAI,KACF,CAAA,GAAI,IAAA;EAEN,IAAA,IAAIA,WAAU,IAAA,EAAM;EAClB,MAAA,IAAI,EAAA,IAAM,IAAA,IAAQ,EAAA,IAAM,OAAO,MAAM,QAAA,EAAU;EAC7C,QAAAA,OAAAA,GAAS,EAAA;EACT,QAAA,EAAA,GAAK,IAAA;EAAA,MACP,CAAA,MAAA,IAAW,EAAA,IAAM,OAAO,EAAA,IAAM,QAAA,EAAU;EACtC,QAAAA,OAAAA,GAAS,EAAA;EACT,QAAA,EAAA,GAAK,EAAA,GAAK,IAAA;EAAA,MACZ,CAAA,MAAO;EACL,QAAAA,OAAAA,GAAS,MAAA;EAAA,MACX;EAAA,IACF,CAAA,MAAA,IAAW,OAAOA,OAAAA,IAAU,QAAA,EAAU;EACpC,MAAA,MAAM,KAAA,CACH,cAAA,GAAiB,0BAAA,GAA6BA,OAAM,CAAA;EAAA,IACzD;EAEA,IAAA,GAAA,GAAM,CAAA,CAAE,OAAA,CAAQ,EAAA,EAAI,EAAE,CAAA;EAEtB,IAAA,IAAI,EAAE,CAAA,EAAG;EACP,MAAA,IAAI,GACF,GAAA,GAAM,GAAA,CAAI,KAAA,CAAM,GAAG,GACnB,EAAA,GAAK,CAACA,OAAAA,CAAO,SAAA,EACb,KAAK,CAACA,OAAAA,CAAO,oBACb,cAAA,GAAiBA,OAAAA,CAAO,kBAAkB,EAAA,EAC1C,OAAA,GAAU,GAAA,CAAI,CAAC,GACf,YAAA,GAAe,GAAA,CAAI,CAAC,CAAA,EACpB,QAAQ,CAAA,CAAE,CAAA,GAAI,CAAA,EACd,SAAA,GAAY,QAAQ,OAAA,CAAQ,KAAA,CAAM,CAAC,CAAA,GAAI,OAAA,EACvC,MAAM,SAAA,CAAU,MAAA;EAElB,MAAA,IAAI,EAAA,EAAI;EACN,QAAA,CAAA,GAAI,EAAA;EACJ,QAAA,EAAA,GAAK,EAAA;EACL,QAAA,EAAA,GAAK,CAAA;EACL,QAAA,GAAA,IAAO,CAAA;EAAA,MACT;EAEA,MAAA,IAAI,EAAA,GAAK,CAAA,IAAK,GAAA,GAAM,CAAA,EAAG;EACrB,QAAA,CAAA,GAAI,MAAM,EAAA,IAAM,EAAA;EAChB,QAAA,OAAA,GAAU,SAAA,CAAU,MAAA,CAAO,CAAA,EAAG,CAAC,CAAA;EAC/B,QAAA,OAAO,CAAA,GAAI,KAAK,CAAA,IAAK,EAAA,aAAe,cAAA,GAAiB,SAAA,CAAU,MAAA,CAAO,CAAA,EAAG,EAAE,CAAA;EAC3E,QAAA,IAAI,KAAK,CAAA,EAAG,OAAA,IAAW,cAAA,GAAiB,SAAA,CAAU,MAAM,CAAC,CAAA;EACzD,QAAA,IAAI,KAAA,YAAiB,GAAA,GAAM,OAAA;EAAA,MAC7B;EAEA,MAAA,GAAA,GAAM,YAAA,GACH,WAAWA,OAAAA,CAAO,gBAAA,IAAoB,QAAQ,EAAA,GAAK,CAACA,OAAAA,CAAO,iBAAA,IAC1D,YAAA,CAAa,OAAA;EAAA,QAAQ,IAAI,MAAA,CAAO,MAAA,GAAS,EAAA,GAAK,QAAQ,GAAG,CAAA;EAAA,QAC1D,IAAA,IAAQA,QAAO,sBAAA,IAA0B,EAAA;EAAA,UACxC,YAAA,CAAA,GACD,OAAA;EAAA,IACL;EAEA,IAAA,OAAA,CAAQA,OAAAA,CAAO,MAAA,IAAU,EAAA,IAAM,GAAA,IAAOA,QAAO,MAAA,IAAU,EAAA,CAAA;EAAA,EACzD,CAAA;EAcA,EAAA,CAAA,CAAE,UAAA,GAAa,SAAU,EAAA,EAAI;EAC3B,IAAA,IAAI,CAAA,EAAG,EAAA,EAAI,EAAA,EAAI,EAAA,EAAI,GAAG,GAAA,EAAK,CAAA,EAAG,EAAA,EAAI,EAAA,EAAI,GAAG,CAAA,EAAG,CAAA,EAC1C,CAAA,GAAI,IAAA,EACJ,KAAK,CAAA,CAAE,CAAA;EAET,IAAA,IAAI,MAAM,IAAA,EAAM;EACd,MAAA,CAAA,GAAI,IAAIH,WAAU,EAAE,CAAA;EAGpB,MAAA,IAAI,CAAC,CAAA,CAAE,SAAA,EAAU,KAAM,CAAA,CAAE,CAAA,IAAK,CAAA,CAAE,CAAA,KAAM,CAAA,CAAA,IAAM,CAAA,CAAE,EAAA,CAAG,GAAG,CAAA,EAAG;EACrD,QAAA,MAAM,KAAA,CACH,cAAA,GAAiB,WAAA,IACf,CAAA,CAAE,SAAA,KAAc,gBAAA,GAAmB,kBAAA,CAAA,GAAsB,OAAA,CAAQ,CAAC,CAAC,CAAA;EAAA,MAC1E;EAAA,IACF;EAEA,IAAA,IAAI,CAAC,EAAA,EAAI,OAAO,IAAIA,WAAU,CAAC,CAAA;EAE/B,IAAA,CAAA,GAAI,IAAIA,WAAU,GAAG,CAAA;EACrB,IAAA,EAAA,GAAK,EAAA,GAAK,IAAIA,UAAAA,CAAU,GAAG,CAAA;EAC3B,IAAA,EAAA,GAAK,EAAA,GAAK,IAAIA,UAAAA,CAAU,GAAG,CAAA;EAC3B,IAAA,CAAA,GAAI,cAAc,EAAE,CAAA;EAIpB,IAAA,CAAA,GAAI,CAAA,CAAE,CAAA,GAAI,CAAA,CAAE,MAAA,GAAS,EAAE,CAAA,GAAI,CAAA;EAC3B,IAAA,CAAA,CAAE,CAAA,CAAE,CAAC,CAAA,GAAI,QAAA,CAAA,CAAU,GAAA,GAAM,IAAI,QAAA,IAAY,CAAA,GAAI,QAAA,GAAW,GAAA,GAAM,GAAG,CAAA;EACjE,IAAA,EAAA,GAAK,CAAC,EAAA,IAAM,CAAA,CAAE,UAAA,CAAW,CAAC,IAAI,CAAA,GAAK,CAAA,GAAI,CAAA,GAAI,CAAA,GAAI,EAAA,GAAM,CAAA;EAErD,IAAA,GAAA,GAAM,OAAA;EACN,IAAA,OAAA,GAAU,CAAA,GAAI,CAAA;EACd,IAAA,CAAA,GAAI,IAAIA,WAAU,CAAC,CAAA;EAGnB,IAAA,EAAA,CAAG,CAAA,CAAE,CAAC,CAAA,GAAI,CAAA;EAEV,IAAA,WAAW;EACT,MAAA,CAAA,GAAI,GAAA,CAAI,CAAA,EAAG,CAAA,EAAG,CAAA,EAAG,CAAC,CAAA;EAClB,MAAA,EAAA,GAAK,EAAA,CAAG,IAAA,CAAK,CAAA,CAAE,KAAA,CAAM,EAAE,CAAC,CAAA;EACxB,MAAA,IAAI,EAAA,CAAG,UAAA,CAAW,EAAE,CAAA,IAAK,CAAA,EAAG;EAC5B,MAAA,EAAA,GAAK,EAAA;EACL,MAAA,EAAA,GAAK,EAAA;EACL,MAAA,EAAA,GAAK,GAAG,IAAA,CAAK,CAAA,CAAE,KAAA,CAAM,EAAA,GAAK,EAAE,CAAC,CAAA;EAC7B,MAAA,EAAA,GAAK,EAAA;EACL,MAAA,CAAA,GAAI,EAAE,KAAA,CAAM,CAAA,CAAE,KAAA,CAAM,EAAA,GAAK,CAAC,CAAC,CAAA;EAC3B,MAAA,CAAA,GAAI,EAAA;EAAA,IACN;EAEA,IAAA,EAAA,GAAK,IAAI,EAAA,CAAG,KAAA,CAAM,EAAE,CAAA,EAAG,EAAA,EAAI,GAAG,CAAC,CAAA;EAC/B,IAAA,EAAA,GAAK,EAAA,CAAG,IAAA,CAAK,EAAA,CAAG,KAAA,CAAM,EAAE,CAAC,CAAA;EACzB,IAAA,EAAA,GAAK,EAAA,CAAG,IAAA,CAAK,EAAA,CAAG,KAAA,CAAM,EAAE,CAAC,CAAA;EACzB,IAAA,EAAA,CAAG,CAAA,GAAI,EAAA,CAAG,CAAA,GAAI,CAAA,CAAE,CAAA;EAChB,IAAA,CAAA,GAAI,CAAA,GAAI,CAAA;EAGR,IAAA,CAAA,GAAI,GAAA,CAAI,EAAA,EAAI,EAAA,EAAI,CAAA,EAAG,aAAa,EAAE,KAAA,CAAM,CAAC,CAAA,CAAE,GAAA,EAAI,CAAE,UAAA;EAAA,MAC7C,GAAA,CAAI,IAAI,EAAA,EAAI,CAAA,EAAG,aAAa,CAAA,CAAE,KAAA,CAAM,CAAC,CAAA,CAAE,GAAA;EAAI,KAAC,GAAI,IAAI,CAAC,EAAA,EAAI,EAAE,CAAA,GAAI,CAAC,IAAI,EAAE,CAAA;EAE1E,IAAA,OAAA,GAAU,GAAA;EAEV,IAAA,OAAO,CAAA;EAAA,EACT,CAAA;EAMA,EAAA,CAAA,CAAE,WAAW,WAAY;EACvB,IAAA,OAAO,CAAC,QAAQ,IAAI,CAAA;EAAA,EACtB,CAAA;EAcA,EAAA,CAAA,CAAE,WAAA,GAAc,SAAU,EAAA,EAAI,EAAA,EAAI;EAChC,IAAA,IAAI,EAAA,IAAM,IAAA,EAAM,QAAA,CAAS,EAAA,EAAI,GAAG,GAAG,CAAA;EACnC,IAAA,OAAO,MAAA,CAAO,IAAA,EAAM,EAAA,EAAI,EAAA,EAAI,CAAC,CAAA;EAAA,EAC/B,CAAA;EAcA,EAAA,CAAA,CAAE,QAAA,GAAW,SAAU,CAAA,EAAG;EACxB,IAAA,IAAI,KACF,CAAA,GAAI,IAAA,EACJ,IAAI,CAAA,CAAE,CAAA,EACN,IAAI,CAAA,CAAE,CAAA;EAGR,IAAA,IAAI,MAAM,IAAA,EAAM;EACd,MAAA,IAAI,CAAA,EAAG;EACL,QAAA,GAAA,GAAM,UAAA;EACN,QAAA,IAAI,CAAA,GAAI,CAAA,EAAG,GAAA,GAAM,GAAA,GAAM,GAAA;EAAA,MACzB,CAAA,MAAO;EACL,QAAA,GAAA,GAAM,KAAA;EAAA,MACR;EAAA,IACF,CAAA,MAAO;EACL,MAAA,IAAI,KAAK,IAAA,EAAM;EACb,QAAA,GAAA,GAAM,KAAK,UAAA,IAAc,CAAA,IAAK,UAAA,GAC3B,aAAA,CAAc,cAAc,CAAA,CAAE,CAAC,CAAA,EAAG,CAAC,IACnC,YAAA,CAAa,aAAA,CAAc,EAAE,CAAC,CAAA,EAAG,GAAG,GAAG,CAAA;EAAA,MAC5C,CAAA,MAAA,IAAW,CAAA,KAAM,EAAA,IAAM,8BAAA,EAAgC;EACrD,QAAA,CAAA,GAAI,KAAA,CAAM,IAAIA,UAAAA,CAAU,CAAC,GAAG,cAAA,GAAiB,CAAA,GAAI,GAAG,aAAa,CAAA;EACjE,QAAA,GAAA,GAAM,aAAa,aAAA,CAAc,CAAA,CAAE,CAAC,CAAA,EAAG,CAAA,CAAE,GAAG,GAAG,CAAA;EAAA,MACjD,CAAA,MAAO;EACL,QAAA,QAAA,CAAS,CAAA,EAAG,CAAA,EAAG,QAAA,CAAS,MAAA,EAAQ,MAAM,CAAA;EACtC,QAAA,GAAA,GAAM,WAAA,CAAY,YAAA,CAAa,aAAA,CAAc,CAAA,CAAE,CAAC,CAAA,EAAG,CAAA,EAAG,GAAG,CAAA,EAAG,EAAA,EAAI,CAAA,EAAG,CAAA,EAAG,IAAI,CAAA;EAAA,MAC5E;EAEA,MAAA,IAAI,IAAI,CAAA,IAAK,CAAA,CAAE,EAAE,CAAC,CAAA,QAAS,GAAA,GAAM,GAAA;EAAA,IACnC;EAEA,IAAA,OAAO,GAAA;EAAA,EACT,CAAA;EAOA,EAAA,CAAA,CAAE,OAAA,GAAU,CAAA,CAAE,MAAA,GAAS,WAAY;EACjC,IAAA,OAAO,QAAQ,IAAI,CAAA;EAAA,EACrB,CAAA;EAGA,EAAA,CAAA,CAAE,YAAA,GAAe,IAAA;EAEjB,EAAA,CAAA,CAAE,MAAA,CAAO,WAAW,CAAA,GAAI,WAAA;EAGxB,EAAA,CAAA,iBAAE,MAAA,CAAO,GAAA,CAAI,4BAA4B,CAAC,IAAI,CAAA,CAAE,OAAA;EAEhD,EAAA,IAAI,YAAA,IAAgB,IAAA,EAAMA,UAAAA,CAAU,IAAI,YAAY,CAAA;EAEpD,EAAA,OAAOA,UAAAA;EACT;EASA,SAAS,SAAS,CAAA,EAAG;EACnB,EAAA,IAAI,IAAI,CAAA,GAAI,CAAA;EACZ,EAAA,OAAO,CAAA,GAAI,CAAA,IAAK,CAAA,KAAM,CAAA,GAAI,IAAI,CAAA,GAAI,CAAA;EACpC;EAIA,SAAS,cAAc,CAAA,EAAG;EACxB,EAAA,IAAI,CAAA,EAAG,CAAA,EACL,CAAA,GAAI,CAAA,EACJ,CAAA,GAAI,EAAE,MAAA,EACN,CAAA,GAAI,CAAA,CAAE,CAAC,CAAA,GAAI,EAAA;EAEb,EAAA,OAAO,IAAI,CAAA,IAAI;EACb,IAAA,CAAA,GAAI,CAAA,CAAE,GAAG,CAAA,GAAI,EAAA;EACb,IAAA,CAAA,GAAI,WAAW,CAAA,CAAE,MAAA;EACjB,IAAA,OAAO,CAAA,EAAA,EAAK,CAAA,GAAI,GAAA,GAAM,CAAA,EAAE;EACxB,IAAA,CAAA,IAAK,CAAA;EAAA,EACP;EAGA,EAAA,KAAK,CAAA,GAAI,EAAE,MAAA,EAAQ,CAAA,CAAE,WAAW,EAAE,CAAC,MAAM,EAAA,IAAI;EAE7C,EAAA,OAAO,CAAA,CAAE,KAAA,CAAM,CAAA,EAAG,CAAA,GAAI,KAAK,CAAC,CAAA;EAC9B;EAIA,SAAS,OAAA,CAAQ,GAAG,CAAA,EAAG;EACrB,EAAA,IAAI,GAAG,CAAA,EACL,EAAA,GAAK,EAAE,CAAA,EACP,EAAA,GAAK,EAAE,CAAA,EACP,CAAA,GAAI,CAAA,CAAE,CAAA,EACN,IAAI,CAAA,CAAE,CAAA,EACN,IAAI,CAAA,CAAE,CAAA,EACN,IAAI,CAAA,CAAE,CAAA;EAGR,EAAA,IAAI,CAAC,CAAA,IAAK,CAAC,CAAA,EAAG,OAAO,IAAA;EAErB,EAAA,CAAA,GAAI,EAAA,IAAM,CAAC,EAAA,CAAG,CAAC,CAAA;EACf,EAAA,CAAA,GAAI,EAAA,IAAM,CAAC,EAAA,CAAG,CAAC,CAAA;EAGf,EAAA,IAAI,KAAK,CAAA,EAAG,OAAO,IAAI,CAAA,GAAI,CAAA,GAAI,CAAC,CAAA,GAAI,CAAA;EAGpC,EAAA,IAAI,CAAA,IAAK,GAAG,OAAO,CAAA;EAEnB,EAAA,CAAA,GAAI,CAAA,GAAI,CAAA;EACR,EAAA,CAAA,GAAI,CAAA,IAAK,CAAA;EAGT,EAAA,IAAI,CAAC,EAAA,IAAM,CAAC,EAAA,EAAI,OAAO,IAAI,CAAA,GAAI,CAAC,EAAA,GAAK,CAAA,GAAI,CAAA,GAAI,EAAA;EAG7C,EAAA,IAAI,CAAC,CAAA,EAAG,OAAO,CAAA,GAAI,CAAA,GAAI,IAAI,CAAA,GAAI,EAAA;EAE/B,EAAA,CAAA,GAAA,CAAK,IAAI,EAAA,CAAG,MAAA,KAAW,CAAA,GAAI,EAAA,CAAG,UAAU,CAAA,GAAI,CAAA;EAG5C,EAAA,KAAK,CAAA,GAAI,GAAG,CAAA,GAAI,CAAA,EAAG,KAAK,IAAI,EAAA,CAAG,CAAC,CAAA,IAAK,EAAA,CAAG,CAAC,CAAA,EAAG,OAAO,GAAG,CAAC,CAAA,GAAI,GAAG,CAAC,CAAA,GAAI,IAAI,CAAA,GAAI,EAAA;EAG3E,EAAA,OAAO,KAAK,CAAA,GAAI,CAAA,GAAI,CAAA,GAAI,CAAA,GAAI,IAAI,CAAA,GAAI,EAAA;EACtC;EAMA,SAAS,QAAA,CAAS,CAAA,EAAG,GAAA,EAAK,GAAA,EAAK,IAAA,EAAM;EACnC,EAAA,IAAI,IAAI,GAAA,IAAO,CAAA,GAAI,OAAO,CAAA,KAAM,SAAA,CAAU,CAAC,CAAA,EAAG;EAC5C,IAAA,MAAM,MACJ,cAAA,IAAkB,IAAA,IAAQ,UAAA,CAAA,IAAe,OAAO,KAAK,QAAA,GAClD,CAAA,GAAI,GAAA,IAAO,CAAA,GAAI,MAAM,iBAAA,GAAoB,mBAAA,GACzC,2BAAA,CAAA,GAA+B,MAAA,CAAO,CAAC,CAAC,CAAA;EAAA,EAC/C;EACF;EAIA,SAAS,MAAM,CAAA,EAAG;EAChB,EAAA,IAAI,CAAA,GAAI,CAAA,CAAE,CAAA,CAAE,MAAA,GAAS,CAAA;EACrB,EAAA,OAAO,QAAA,CAAS,CAAA,CAAE,CAAA,GAAI,QAAQ,CAAA,IAAK,KAAK,CAAA,CAAE,CAAA,CAAE,CAAC,CAAA,GAAI,CAAA,IAAK,CAAA;EACxD;EAGA,SAAS,aAAA,CAAc,KAAK,CAAA,EAAG;EAC7B,EAAA,OAAA,CAAQ,IAAI,MAAA,GAAS,CAAA,GAAI,GAAA,CAAI,MAAA,CAAO,CAAC,CAAA,GAAI,GAAA,GAAM,GAAA,CAAI,KAAA,CAAM,CAAC,CAAA,GAAI,GAAA,KAC5D,CAAA,GAAI,CAAA,GAAI,MAAM,IAAA,CAAA,GAAQ,CAAA;EAC1B;EAGA,SAAS,YAAA,CAAa,GAAA,EAAK,CAAA,EAAG,CAAA,EAAG;EAC/B,EAAA,IAAI,GAAA,EAAK,EAAA;EAGT,EAAA,IAAI,IAAI,CAAA,EAAG;EAGT,IAAA,KAAK,KAAK,CAAA,GAAI,GAAA,EAAK,EAAE,CAAA,EAAG,MAAM,CAAA,EAAE;EAChC,IAAA,GAAA,GAAM,EAAA,GAAK,GAAA;EAAA,EAGb,CAAA,MAAO;EACL,IAAA,GAAA,GAAM,GAAA,CAAI,MAAA;EAGV,IAAA,IAAI,EAAE,IAAI,GAAA,EAAK;EACb,MAAA,KAAK,KAAK,CAAA,EAAG,CAAA,IAAK,KAAK,EAAE,CAAA,EAAG,MAAM,CAAA,EAAE;EACpC,MAAA,GAAA,IAAO,EAAA;EAAA,IACT,CAAA,MAAA,IAAW,IAAI,GAAA,EAAK;EAClB,MAAA,GAAA,GAAM,GAAA,CAAI,MAAM,CAAA,EAAG,CAAC,IAAI,GAAA,GAAM,GAAA,CAAI,MAAM,CAAC,CAAA;EAAA,IAC3C;EAAA,EACF;EAEA,EAAA,OAAO,GAAA;EACT;EAMO,IAAI,YAAY,KAAA,EAAM;EAE7B,IAAO,iBAAA,GAAQ,SAAA;;;ECt1Ff,IAAM,aAAA,GAAgB,EAAA;EACtB,IAAM,SAAA,GAAY,EAAA;EAOlB,IAAM,eAAe,MAAM;EAEzB,EAAA,IACE,OAAO,eAAe,WAAA,IACtB,UAAA,CAAW,UACX,OAAO,UAAA,CAAW,MAAA,CAAO,eAAA,KAAoB,UAAA,EAC7C;EACA,IAAA,OAAO,MAAM;EAEX,MAAA,MAAM,MAAA,GAAS,IAAI,WAAA,CAAY,CAAC,CAAA;EAChC,MAAA,UAAA,CAAW,MAAA,CAAO,gBAAgB,MAAM,CAAA;EAExC,MAAA,OAAO,MAAA,CAAO,CAAC,CAAA,GAAI,UAAA;EAAA,IACrB,CAAA;EAAA,EACF;EAEA,EAAA,OAAO,IAAA,CAAK,MAAA;EACd,CAAA;EAEA,IAAM,SAAS,YAAA,EAAa;EAE5B,IAAM,aAAA,GAAgB,CAAC,MAAA,GAAS,CAAA,EAAG,OAAO,MAAA,KAAW;EACnD,EAAA,IAAI,OAAA,GAAU,EAAA;EAEd,EAAA,OAAO,OAAA,CAAQ,SAAS,MAAA,EAAQ;EAC9B,IAAA,OAAA,GAAU,OAAA,GAAU,KAAK,KAAA,CAAM,IAAA,KAAS,EAAE,CAAA,CAAE,SAAS,EAAE,CAAA;EAAA,EACzD;EACA,EAAA,OAAO,OAAA;EACT,CAAA;EAMA,SAAS,YAAY,GAAA,EAAK;EACxB,EAAA,IAAI,KAAA,GAAQ,IAAI,iBAAA,CAAU,CAAC,CAAA;EAE3B,EAAA,KAAA,MAAW,CAAA,IAAK,GAAA,CAAI,MAAA,EAAO,EAAG;EAE5B,IAAA,KAAA,GAAQ,KAAA,CAAM,YAAA,CAAa,GAAG,CAAA,CAAE,KAAK,CAAC,CAAA;EAAA,EACxC;EACA,EAAA,OAAO,KAAA;EACT;EAEA,IAAM,IAAA,GAAO,CAAC,KAAA,GAAQ,EAAA,KAAO;EAG3B,EAAA,MAAM,OAAA,GAAU,IAAI,WAAA,EAAY;EAChC,EAAA,OAAO,WAAA,CAAY,QAAA,CAAK,OAAA,CAAQ,MAAA,CAAO,KAAK,CAAC,CAAC,CAAA,CAC3C,QAAA,CAAS,EAAE,CAAA,CACX,KAAA,CAAM,CAAC,CAAA;EACZ,CAAA;EAEA,IAAM,WAAW,KAAA,CAAM,IAAA;EAAA,EAAK,EAAE,QAAQ,EAAA,EAAG;EAAA,EAAG,CAAC,CAAA,EAAG,CAAA,KAC9C,MAAA,CAAO,YAAA,CAAa,IAAI,EAAE;EAC5B,CAAA;EAEA,IAAM,YAAA,GAAe,CAAC,IAAA,KAAS,QAAA,CAAS,IAAA,CAAK,MAAM,IAAA,EAAK,GAAI,QAAA,CAAS,MAAM,CAAC,CAAA;EAQ5E,IAAM,oBAAoB,CAAC;EAAA,EACzB,SAAA,GAAY,OAAO,MAAA,KAAW,WAAA,GAC1B,SACA,OAAO,MAAA,KAAW,WAAA,GAChB,MAAA,GACA,EAAC;EAAA,EACP,QAAQ,IAAA,GAAO;EACjB,CAAA,GAAI,EAAC,KAAM;EACT,EAAA,MAAM,OAAA,GAAU,MAAA,CAAO,IAAA,CAAK,SAAS,EAAE,QAAA,EAAS;EAChD,EAAA,MAAM,YAAA,GAAe,OAAA,CAAQ,MAAA,GACzB,OAAA,GAAU,aAAA,CAAc,WAAW,IAAI,CAAA,GACvC,aAAA,CAAc,SAAA,EAAW,IAAI,CAAA;EAEjC,EAAA,OAAO,IAAA,CAAK,YAAY,CAAA,CAAE,SAAA,CAAU,GAAG,SAAS,CAAA;EAClD,CAAA;EAEA,IAAM,aAAA,GAAgB,CAAC,KAAA,KAAU,MAAM;EACrC,EAAA,OAAO,KAAA,EAAA;EACT,CAAA;EAIA,IAAM,eAAA,GAAkB,SAAA;EAExB,IAAM,OAAO,CAAC;EAAA;EAAA;EAAA;EAAA,EAIZ,QAAQ,IAAA,GAAO,MAAA;EAAA,EACf,UAAU,aAAA,CAAc,IAAA,CAAK,MAAM,IAAA,EAAK,GAAI,eAAe,CAAC,CAAA;EAAA,EAC5D,MAAA,GAAS,aAAA;EAAA,EACT,WAAA,GAAc,iBAAA,CAAkB,EAAE,MAAA,EAAQ,MAAM;EAClD,CAAA,GAAI,EAAC,KAAM;EACT,EAAA,IAAI,SAAS,SAAA,EAAW;EACtB,IAAA,MAAM,IAAI,KAAA;EAAA,MACR,CAAA,6BAAA,EAAgC,SAAS,CAAA,YAAA,EAAe,MAAM,CAAA;EAAA,KAChE;EAAA,EACF;EACA,EAAA,OAAO,SAAS,KAAA,GAAQ;EACtB,IAAA,MAAM,WAAA,GAAc,aAAa,IAAI,CAAA;EAIrC,IAAA,MAAM,IAAA,GAAO,IAAA,CAAK,GAAA,EAAI,CAAE,SAAS,EAAE,CAAA;EACnC,IAAA,MAAM,KAAA,GAAQ,OAAA,EAAQ,CAAE,QAAA,CAAS,EAAE,CAAA;EAKnC,IAAA,MAAM,IAAA,GAAO,aAAA,CAAc,MAAA,EAAQ,IAAI,CAAA;EACvC,IAAA,MAAM,SAAA,GAAY,CAAA,EAAG,IAAA,GAAO,IAAA,GAAO,QAAQ,WAAW,CAAA,CAAA;EAEtD,IAAA,OAAO,CAAA,EAAG,cAAc,IAAA,CAAK,SAAS,EAAE,SAAA,CAAU,CAAA,EAAG,MAAM,CAAC,CAAA,CAAA;EAAA,EAC9D,CAAA;EACF,CAAA;EAEA,IAAM,QAAA,GAAW,KAAK,IAAI,CAAA;EAC1B,SAAS,KAAK,EAAA,EAAI;EAChB,EAAA,IAAI,WAAA;EACJ,EAAA,OAAO,MAAM;EACX,IAAA,IAAI,CAAC,WAAA,EAAa;EAChB,MAAA,WAAA,GAAc,EAAA,EAAG;EAAA,IACnB;EACA,IAAA,OAAO,WAAA,EAAY;EAAA,EACrB,CAAA;EACF;;;EC9IO,IAAM,UAAU,OAAO,OAAA,KAAY,WAAA,IAAe,OAAA,CAAQ,IAAI,QAAA,KAAa,aAAA;;;ECoC3E,SAAS,YAAA,CAAa,IAAA,EAAgB,KAAA,EAAe,OAAA,GAAmB,KAAA,EAAO;EAEpF,EAAA,IAAI,YAAY,IAAI,CAAA;EAClB,IAAA,MAAM,IAAI,KAAA;EAAA,MACR,eAAe,IAAI,CAAA,gHAAA;EAAA,KACrB;EAGF,EAAA,MAAA,CAAO,cAAA,CAAe,MAAM,SAAA,EAAW;EAAA,IACrC,KAAA,EAAO,KAAA;EAAA,IACP,YAAA,EAAc,KAAA;EAAA,IACd,UAAA,EAAY,KAAA;EAAA,IACZ,QAAA,EAAU;EAAA,GACX,CAAA;EAGD,EAAA,MAAM,MAAA,GAAS,MAAA,CAAO,cAAA,CAAe,IAAI,CAAA;EACzC,EAAA,MAAM,WAAA,GAAc,UAAU,MAAA,CAAO,iBAAiB,IAAI,MAAA,CAAO,iBAAiB,IAAI,EAAC;EAGvF,EAAA,MAAM,SAAA,GACJ,OAAA,IAAW,KAAA,KAAU,OAAA,GAAU,CAAC,OAAA,EAAS,GAAG,WAAA,EAAa,KAAK,CAAA,GAAI,CAAC,GAAG,aAAa,KAAK,CAAA;EAG1F,EAAA,MAAA,CAAO,cAAA,CAAe,MAAM,iBAAA,EAAmB;EAAA,IAC7C,KAAA,EAAO,SAAA;EAAA,IACP,YAAA,EAAc,KAAA;EAAA,IACd,UAAA,EAAY,KAAA;EAAA,IACZ,QAAA,EAAU;EAAA,GACX,CAAA;EACD,EAAA,MAAA,CAAO,cAAA,CAAe,MAAM,aAAA,EAAe;EAAA,IACzC,KAAA,EAAO,IAAI,GAAA,CAAI,SAAS,CAAA;EAAA,IACxB,YAAA,EAAc,KAAA;EAAA,IACd,UAAA,EAAY,KAAA;EAAA,IACZ,QAAA,EAAU;EAAA,GACX,CAAA;EAGD,EAAA,aAAA,CAAc,IAAI,CAAA;EACpB;EAsBO,SAAS,gBAAA,CACd,MACA,IAAA,EACA;EApGF,EAAA,IAAA,EAAA,EAAA,EAAA;EAqGE,EAAA,MAAM,yBAAA,GAAA,CACJ,EAAA,GAAA,IAAA,IAAA,IAAA,GAAA,MAAA,GAAA,IAAA,CAAM,yBAAA,KAAN,IAAA,GAAA,EAAA,GAAmC,OAAA,CAAQ,yBAAA;EAC7C,EAAA,MAAM,cAAA,GAAA,CAAiB,EAAA,GAAA,IAAA,IAAA,IAAA,GAAA,MAAA,GAAA,IAAA,CAAM,cAAA,KAAN,IAAA,GAAA,EAAA,GAAwB,OAAA,CAAQ,cAAA;EAEvD,EAAA,IAAI,CAAC,WAAA,CAAY,IAAI,CAAA,EAAG;EACxB,EAAA,IAAI,oBAAA,CAAqB,IAAI,CAAA,IAAK,yBAAA,EAA2B;EAG7D,EAAA,MAAM,KAAA,GAAkB,CAAC,IAAI,CAAA;EAG7B,EAAA,IAAI,QAAA,GAAgB,MAAA,CAAO,cAAA,CAAe,IAAI,CAAA;EAC9C,EAAA,OAAO,WAAA,CAAY,QAAQ,CAAA,EAAG;EAC5B,IAAA,KAAA,CAAM,KAAK,QAAQ,CAAA;EACnB,IAAA,QAAA,GAAW,MAAA,CAAO,eAAe,QAAQ,CAAA;EAAA,EAC3C;EAGA,EAAA,MAAM,UAAA,uBAAiB,GAAA,EAAoB;EAG3C,EAAA,KAAA,IAAS,IAAI,KAAA,CAAM,MAAA,GAAS,CAAA,EAAG,CAAA,IAAK,GAAG,CAAA,EAAA,EAAK;EAC1C,IAAA,MAAMI,KAAAA,GAAO,MAAM,CAAC,CAAA;EACpB,IAAA,IAAI,CAACA,KAAAA,EAAM;EACX,IAAA,IAAI,QAAQA,KAAAA,CAAK,UAAA;EACjB,IAAA,IAAI,UAAA,CAAW,GAAA,CAAI,KAAK,CAAA,EAAG;EACzB,MAAA,IAAI,WAAA,CAAYA,KAAI,CAAA,IAAK,CAAC,cAAA,EAAgB;EACxC,QAAA,MAAM,YAAA,GAAe,UAAA,CAAW,GAAA,CAAI,KAAK,CAAA;EACzC,QAAA,MAAM,IAAI,KAAA;EAAA,UACR,wBAAwBA,KAAAA,CAAK,IAAI,CAAA,uBAAA,EAA0B,KAAK,oBAAoB,YAAY,CAAA,4GAAA;EAAA,SAElG;EAAA,MACF;EACA,MAAA,KAAA,GAAQ,mBAAA,EAAoB;EAC5B,MAAA,YAAA,CAAaA,OAAM,KAAK,CAAA;EAAA,IAC1B;EACA,IAAA,UAAA,CAAW,GAAA,CAAI,KAAA,EAAOA,KAAAA,CAAK,IAAI,CAAA;EAAA,EACjC;EACA,EAAA,sBAAA,CAAuB,IAAI,CAAA;EAC7B;EAiBO,SAAS,WAAA,CACd,OACA,IAAA,EACM;EAhKR,EAAA,IAAA,EAAA;EAiKE,EAAA,MAAM,eAAA,GAAA,CAAkB,EAAA,GAAA,IAAA,IAAA,IAAA,GAAA,MAAA,GAAA,IAAA,CAAM,eAAA,KAAN,IAAA,GAAA,EAAA,GAAyB,OAAA,CAAQ,eAAA;EAEzD,EAAA,IAAI,eAAA,EAAiB;EACnB,IAAA,IAAI,KAAA;EACJ,IAAA,IAAI,eAAA,YAA2B,MAAA,EAAQ,KAAA,GAAQ,eAAA,CAAgB,KAAK,KAAK,CAAA;EAAA,SACpE,KAAA,GAAQ,gBAAgB,KAAK,CAAA;EAElC,IAAA,IAAI,CAAC,KAAA;EACH,MAAA,MAAM,IAAI,KAAA;EAAA,QACR,mCAAmC,KAAK,CAAA,sEAAA;EAAA,OAC1C;EAAA,EACJ;EACF;EAYO,SAAS,mBAAA,GAA8B;EAC5C,EAAA,IAAI,QAAQ,QAAA,EAAS;EACrB,EAAA,OAAO,eAAe,KAAK,CAAA,CAAA;EAC7B;EAgBO,SAAS,UAAU,IAAA,EAAgB;EACxC,EAAA,MAAA,CAAO,cAAA,CAAe,MAAM,SAAA,EAAW;EAAA,IACrC,KAAA,EAAO,IAAA;EAAA,IACP,YAAA,EAAc,KAAA;EAAA,IACd,UAAA,EAAY,KAAA;EAAA,IACZ,QAAA,EAAU;EAAA,GACX,CAAA;EACH;EAYO,SAAS,cAAc,IAAA,EAAgB;EAC5C,EAAA,MAAA,CAAO,cAAA,CAAe,MAAM,cAAA,EAAgB;EAAA,IAC1C,KAAA,EAAO,IAAA;EAAA,IACP,YAAA,EAAc,KAAA;EAAA,IACd,UAAA,EAAY,KAAA;EAAA,IACZ,QAAA,EAAU;EAAA,GACX,CAAA;EACH;EAWO,SAAS,cAAc,IAAA,EAAgB;EAC5C,EAAA,MAAA,CAAO,cAAA,CAAe,MAAM,aAAA,EAAe;EAAA,IACzC,KAAA,EAAO,IAAA;EAAA,IACP,YAAA,EAAc,KAAA;EAAA,IACd,UAAA,EAAY,KAAA;EAAA,IACZ,QAAA,EAAU;EAAA,GACX,CAAA;EACH;EAWO,SAAS,uBAAuB,IAAA,EAAgB;EACrD,EAAA,MAAA,CAAO,cAAA,CAAe,MAAM,uBAAA,EAAyB;EAAA,IACnD,KAAA,EAAO,IAAA;EAAA,IACP,YAAA,EAAc,KAAA;EAAA,IACd,UAAA,EAAY,KAAA;EAAA,IACZ,QAAA,EAAU;EAAA,GACX,CAAA;EACH;EAWO,SAAS,YAAY,IAAA,EAA+B;EACzD,EAAA,OAAO,OAAO,IAAA,KAAS,UAAA,IAAe,IAAA,CAAa,SAAS,CAAA,KAAM,IAAA;EACpE;EASO,SAAS,gBAAgB,IAAA,EAA6C;EAC3E,EAAA,IAAI,CAAC,IAAA,IAAQ,OAAO,IAAA,KAAS,UAAU,OAAO,KAAA;EAC9C,EAAA,MAAM,IAAA,GAAO,eAAe,IAAI,CAAA;EAChC,EAAA,OAAO,YAAY,IAAI,CAAA;EACzB;EAUO,SAAS,gBAAgB,IAAA,EAAgC;EAC9D,EAAA,OAAO,MAAA,CAAO,MAAA,CAAO,IAAA,EAAM,cAAc,CAAA;EAC3C;EAUO,SAAS,oBAAoB,IAAA,EAA6C;EAC/E,EAAA,IAAI,CAAC,IAAA,IAAQ,OAAO,IAAA,KAAS,UAAU,OAAO,KAAA;EAC9C,EAAA,MAAM,IAAA,GAAO,eAAe,IAAI,CAAA;EAChC,EAAA,OAAO,gBAAgB,IAAI,CAAA;EAC7B;EAWO,SAAS,YAAY,IAAA,EAAyB;EACnD,EAAA,OAAO,MAAA,CAAO,MAAA,CAAO,IAAA,EAAM,aAAa,CAAA;EAC1C;EAWO,SAAS,qBAAqB,IAAA,EAAyB;EAC5D,EAAA,OAAO,MAAA,CAAO,MAAA,CAAO,IAAA,EAAM,uBAAuB,CAAA;EACpD;EAeO,SAAS,eAAe,GAAA,EAAU;EAvWzC,EAAA,IAAA,EAAA,EAAA,EAAA,EAAA,EAAA;EAwWE,EAAA,IAAI,CAAC,GAAA,IAAO,OAAO,GAAA,KAAQ,UAAU,OAAO,IAAA;EAC5C,EAAA,OAAA,CAAO,EAAA,GAAA,CAAA,EAAA,GAAA,GAAA,CAAI,gBAAJ,IAAA,GAAA,EAAA,GAAA,CAAmB,EAAA,GAAA,MAAA,CAAO,eAAe,GAAG,CAAA,KAAzB,IAAA,GAAA,MAAA,GAAA,EAAA,CAA4B,WAAA,KAA/C,IAAA,GAAA,EAAA,GAA8D,IAAA;EACvE;;;EC3UO,SAAS,QAAA,CACd,IAAA,EACA,KAAA,EACA,IAAA,EACA;EAEA,EAAA,IAAI,WAAA,CAAY,IAAI,CAAA,EAAG,MAAM,IAAI,KAAA,CAAM,CAAA,wBAAA,EAA2B,KAAK,CAAA,qBAAA,CAAuB,CAAA;EAG9F,EAAA,IAAI,CAAA;EACJ,EAAA,IAAI,KAAA,EAAO;EACT,IAAA,WAAA,CAAY,OAAO,IAAI,CAAA;EACvB,IAAA,CAAA,GAAI,KAAA;EAAA,EACN,CAAA,UAAW,mBAAA,EAAoB;EAAA,EAG/B,MAAM,mBAAmB,IAAA,CAAK;EAAA;EAAA;EAAA;EAAA,IAmB5B,WAAW,UAAA,GAAqB;EAC9B,MAAA,OAAQ,KAAa,SAAS,CAAA;EAAA,IAChC;EAAA;EAAA;EAAA;EAAA;EAAA;EAAA;EAAA;EAAA,IASA,WAAW,iBAAA,GAAuC;EA7EtD,MAAA,IAAA,EAAA;EA8EM,MAAA,OAAO,CAAC,GAAA,CAAK,EAAA,GAAA,IAAA,CAAa,iBAAiB,CAAA,KAA9B,IAAA,GAAA,EAAA,GAAmC,EAAG,CAAA;EAAA,IACrD;EAAA;EAAA;EAAA;EAAA;EAAA;EAAA;EAAA;EAAA,IASA,WAAW,aAAA,GAAuC;EAChD,MAAA,MAAM,GAAA,uBAAuB,GAAA,EAAI;EACjC,MAAA,KAAA,MAAW,KAAM,IAAA,CAAa,aAAa,CAAA,EAAG,GAAA,CAAI,IAAI,CAAC,CAAA;EACvD,MAAA,OAAO,GAAA;EAAA,IACT;EAAA,IAiBA,eAAe,IAAA,EAAa;EAC1B,MAAA,KAAA,CAAM,GAAG,IAAI,CAAA;EAGb,MAAA,IAAI,MAAA,CAAO,cAAA,CAAe,IAAI,CAAA,KAAM,GAAA,CAAA,MAAA,CAAW,SAAA;EAC7C,QAAA,MAAA,CAAO,cAAA,CAAe,IAAA,EAAM,GAAA,CAAA,MAAA,CAAW,SAAS,CAAA;EAGlD,MAAA,MAAM,IAAA,GAAO,eAAe,IAAI,CAAA;EAChC,MAAA,IAAI,CAAC,IAAA,EAAM;EACT,QAAA,IAAI,OAAA;EACF,UAAA,MAAM,IAAI,KAAA,CAAM,CAAA,wBAAA,EAA2B,KAAK,CAAA,+BAAA,CAAiC,CAAA;EACnF,QAAA;EAAA,MACF;EAGA,MAAA,IAAI,OAAA,mBAA0B,IAAI,CAAA;EAAA,IACpC;EAAA;EAAA;EAAA;EAAA;EAAA;EAAA;EAAA,IAQA,OAAO,aAAa,GAAA,EAA6B;EAC/C,MAAA,OAAO,gBAAgB,GAAG,CAAA;EAAA,IAC5B;EAAA;EAAA;EAAA;EAAA;EAAA;EAAA;EAAA;EAAA;EAAA;EAAA;EAAA;EAAA,IAaA,OAAO,SAAqB,KAAA,EAAyC;EArJzE,MAAA,IAAA,EAAA;EAsJM,MAAA,IAAI,CAAC,eAAA,CAAgB,KAAK,CAAA,EAAG,OAAO,KAAA;EACpC,MAAA,MAAM,QAAA,GAAA,CAAW,EAAA,GAAA,cAAA,CAAe,KAAK,CAAA,KAApB,IAAA,GAAA,MAAA,GAAA,EAAA,CAAwB,aAAA,CAAA;EACzC,MAAA,MAAM,QAAA,GAAY,KAAa,SAAS,CAAA;EACxC,MAAA,OAAO,CAAC,CAAC,QAAA,IAAY,QAAA,CAAS,IAAI,QAAQ,CAAA;EAAA,IAC5C;EAAA;EAAA;EAAA;EAAA;EAAA;EAAA;EAAA;EAAA;EAAA,IAUA,OAAO,eAA2B,KAAA,EAAyC;EApK/E,MAAA,IAAA,EAAA;EAqKM,MAAA,IAAI,CAAC,eAAA,CAAgB,KAAK,CAAA,EAAG,OAAO,KAAA;EACpC,MAAA,MAAM,YAAA,GAAA,CAAe,EAAA,GAAA,cAAA,CAAe,KAAK,CAAA,KAApB,IAAA,GAAA,MAAA,GAAA,EAAA,CAAwB,iBAAA,CAAA;EAC7C,MAAA,MAAM,WAAA,GAAe,KAAa,iBAAiB,CAAA;EACnD,MAAA,OAAO,CAAC,CAAC,YAAA,IAAgB,WAAA,CAAY,KAAA,CAAM,CAAC,CAAA,EAAG,CAAA,KAAM,CAAA,KAAM,YAAA,CAAa,CAAC,CAAC,CAAA;EAAA,IAC5E;EAAA;EAAA;EAAA;EAAA;EAAA;EAAA;EAAA;EAAA;EAAA;EAAA;EAAA,IAYA,SAAqB,KAAA,EAAyC;EArLlE,MAAA,IAAA,EAAA;EAsLM,MAAA,IAAI,CAAC,eAAA,CAAgB,KAAK,CAAA,EAAG,OAAO,KAAA;EACpC,MAAA,MAAM,QAAA,GAAA,CAAW,EAAA,GAAA,cAAA,CAAe,KAAK,CAAA,KAApB,IAAA,GAAA,MAAA,GAAA,EAAA,CAAwB,aAAA,CAAA;EACzC,MAAA,MAAM,QAAA,GAAW,cAAA,CAAe,IAAI,CAAA,CAAE,SAAS,CAAA;EAC/C,MAAA,OAAO,CAAC,CAAC,QAAA,IAAY,QAAA,CAAS,IAAI,QAAQ,CAAA;EAAA,IAC5C;EAAA;EAAA;EAAA;EAAA;EAAA;EAAA;EAAA;EAAA;EAAA;EAAA;EAAA,IAYA,eAA2B,KAAA,EAAyC;EAtMxE,MAAA,IAAA,EAAA,EAAA,EAAA;EAuMM,MAAA,IAAI,CAAC,eAAA,CAAgB,KAAK,CAAA,EAAG,OAAO,KAAA;EACpC,MAAA,MAAM,YAAA,GAAA,CAAe,EAAA,GAAA,cAAA,CAAe,KAAK,CAAA,KAApB,IAAA,GAAA,MAAA,GAAA,EAAA,CAAwB,iBAAA,CAAA;EAC7C,MAAA,MAAM,WAAA,GAAA,CAAc,EAAA,GAAA,cAAA,CAAe,IAAI,CAAA,KAAnB,IAAA,GAAA,MAAA,GAAA,EAAA,CAAuB,iBAAA,CAAA;EAC3C,MAAA,OAAO,CAAC,CAAC,YAAA,IAAgB,WAAA,CAAY,KAAA,CAAM,CAAC,CAAA,EAAG,CAAA,KAAM,CAAA,KAAM,YAAA,CAAa,CAAC,CAAC,CAAA;EAAA,IAC5E;EAAA;EAAA;EAAA;EAAA;EAAA;EAAA,IAOA,aAAA,GAAwB;EACtB,MAAA,MAAM,IAAA,GAAO,eAAe,IAAI,CAAA;EAChC,MAAA,IAAI,CAAC,IAAA,EAAM;EACT,QAAA,IAAI,OAAA;EACF,UAAA,MAAM,IAAI,KAAA,CAAM,CAAA,wBAAA,EAA2B,KAAK,CAAA,+BAAA,CAAiC,CAAA;EACnF,QAAA,OAAO,gBAAA;EAAA,MACT;EACA,MAAA,OAAO,IAAA,CAAK,UAAA;EAAA,IACd;EAAA;EAAA;EAAA;EAAA;EAAA;EAAA,IAOA,oBAAA,GAA0C;EACxC,MAAA,MAAM,IAAA,GAAO,eAAe,IAAI,CAAA;EAChC,MAAA,IAAI,CAAC,IAAA,EAAM;EACT,QAAA,IAAI,OAAA;EACF,UAAA,MAAM,IAAI,KAAA,CAAM,CAAA,wBAAA,EAA2B,KAAK,CAAA,+BAAA,CAAiC,CAAA;EACnF,QAAA,OAAO,CAAC,gBAAgB,CAAA;EAAA,MAC1B;EACA,MAAA,OAAO,IAAA,CAAK,iBAAA;EAAA,IACd;EAAA;EAAA;EAAA;EAAA;EAAA;EAAA,IAOA,gBAAA,GAA0C;EACxC,MAAA,MAAM,IAAA,GAAO,eAAe,IAAI,CAAA;EAChC,MAAA,IAAI,CAAC,IAAA,EAAM;EACT,QAAA,IAAI,OAAA;EACF,UAAA,MAAM,IAAI,KAAA,CAAM,CAAA,wBAAA,EAA2B,KAAK,CAAA,+BAAA,CAAiC,CAAA;EACnF,QAAA,uBAAO,IAAI,GAAA,CAAI,CAAC,gBAAgB,CAAC,CAAA;EAAA,MACnC;EACA,MAAA,OAAO,IAAA,CAAK,aAAA;EAAA,IACd;EAAA;EAIF,EAAA,YAAA,CAAa,UAAA,EAAY,GAAG,IAAI,CAAA;EAGhC,EAAA,SAAA,CAAU,UAAU,CAAA;EACpB,EAAA,aAAA,CAAc,UAAU,CAAA;EAExB,EAAA,OAAO,UAAA;EACT;EAiBO,SAAS,gBAAA,CACd,IAAA,EACA,KAAA,EACA,IAAA,EACA;EAEA,EAAA,IAAI,WAAA,CAAY,IAAI,CAAA,EAAG,MAAM,IAAI,KAAA,CAAM,CAAA,wBAAA,EAA2B,KAAK,CAAA,qBAAA,CAAuB,CAAA;EAG9F,EAAA,IAAI,CAAA;EACJ,EAAA,IAAI,KAAA,EAAO;EACT,IAAA,WAAA,CAAY,OAAO,IAAI,CAAA;EACvB,IAAA,CAAA,GAAI,KAAA;EAAA,EACN,CAAA,UAAW,mBAAA,EAAoB;EAAA,EAG/B,MAAe,mBAAmB,IAAA,CAAK;EAAA;EAAA;EAAA;EAAA,IAmBrC,WAAW,UAAA,GAAqB;EAC9B,MAAA,OAAQ,KAAa,SAAS,CAAA;EAAA,IAChC;EAAA;EAAA;EAAA;EAAA;EAAA;EAAA;EAAA;EAAA,IASA,WAAW,iBAAA,GAAuC;EAlUtD,MAAA,IAAA,EAAA;EAmUM,MAAA,OAAO,CAAC,GAAA,CAAK,EAAA,GAAA,IAAA,CAAa,iBAAiB,CAAA,KAA9B,IAAA,GAAA,EAAA,GAAmC,EAAG,CAAA;EAAA,IACrD;EAAA;EAAA;EAAA;EAAA;EAAA;EAAA;EAAA;EAAA,IASA,WAAW,aAAA,GAAuC;EAChD,MAAA,MAAM,GAAA,uBAAuB,GAAA,EAAI;EACjC,MAAA,KAAA,MAAW,KAAM,IAAA,CAAa,aAAa,CAAA,EAAG,GAAA,CAAI,IAAI,CAAC,CAAA;EACvD,MAAA,OAAO,GAAA;EAAA,IACT;EAAA,IAiBA,eAAe,IAAA,EAAa;EAC1B,MAAA,KAAA,CAAM,GAAG,IAAI,CAAA;EAGb,MAAA,IAAI,MAAA,CAAO,cAAA,CAAe,IAAI,CAAA,KAAM,GAAA,CAAA,MAAA,CAAW,SAAA;EAC7C,QAAA,MAAA,CAAO,cAAA,CAAe,IAAA,EAAM,GAAA,CAAA,MAAA,CAAW,SAAS,CAAA;EAGlD,MAAA,MAAM,IAAA,GAAO,eAAe,IAAI,CAAA;EAChC,MAAA,IAAI,CAAC,IAAA,EAAM;EACT,QAAA,IAAI,OAAA;EACF,UAAA,MAAM,IAAI,KAAA,CAAM,CAAA,wBAAA,EAA2B,KAAK,CAAA,+BAAA,CAAiC,CAAA;EACnF,QAAA;EAAA,MACF;EAGA,MAAA,IAAI,OAAA,mBAA0B,IAAI,CAAA;EAAA,IACpC;EAAA;EAAA;EAAA;EAAA;EAAA;EAAA;EAAA,IAQA,OAAO,aAAa,GAAA,EAA6B;EAC/C,MAAA,OAAO,gBAAgB,GAAG,CAAA;EAAA,IAC5B;EAAA;EAAA;EAAA;EAAA;EAAA;EAAA;EAAA;EAAA;EAAA;EAAA;EAAA;EAAA;EAAA;EAAA;EAAA;EAAA,IAiBA,OAAO,SAAqB,KAAA,EAAyC;EA9YzE,MAAA,IAAA,EAAA;EA+YM,MAAA,IAAI,CAAC,gBAAgB,KAAK,CAAA,IAAK,CAAC,WAAA,CAAY,IAAI,GAAG,OAAO,KAAA;EAC1D,MAAA,MAAM,QAAA,GAAA,CAAW,EAAA,GAAA,cAAA,CAAe,KAAK,CAAA,KAApB,IAAA,GAAA,MAAA,GAAA,EAAA,CAAwB,aAAA,CAAA;EACzC,MAAA,MAAM,QAAA,GAAY,KAAa,SAAS,CAAA;EACxC,MAAA,OAAO,CAAC,CAAC,QAAA,IAAY,QAAA,CAAS,IAAI,QAAQ,CAAA;EAAA,IAC5C;EAAA;EAAA;EAAA;EAAA;EAAA;EAAA;EAAA;EAAA;EAAA;EAAA;EAAA;EAAA;EAAA,IAcA,OAAO,eAA2B,KAAA,EAAyC;EAja/E,MAAA,IAAA,EAAA;EAkaM,MAAA,IAAI,CAAC,gBAAgB,KAAK,CAAA,IAAK,CAAC,WAAA,CAAY,IAAI,GAAG,OAAO,KAAA;EAC1D,MAAA,MAAM,YAAA,GAAA,CAAe,EAAA,GAAA,cAAA,CAAe,KAAK,CAAA,KAApB,IAAA,GAAA,MAAA,GAAA,EAAA,CAAwB,iBAAA,CAAA;EAC7C,MAAA,MAAM,WAAA,GAAe,KAAa,iBAAiB,CAAA;EACnD,MAAA,OAAO,CAAC,CAAC,YAAA,IAAgB,WAAA,CAAY,KAAA,CAAM,CAAC,CAAA,EAAG,CAAA,KAAM,CAAA,KAAM,YAAA,CAAa,CAAC,CAAC,CAAA;EAAA,IAC5E;EAAA;EAAA;EAAA;EAAA;EAAA;EAAA;EAAA;EAAA;EAAA;EAAA;EAAA,IAYA,SAAqB,KAAA,EAAyC;EAlblE,MAAA,IAAA,EAAA;EAmbM,MAAA,IAAI,CAAC,gBAAgB,KAAK,CAAA,IAAK,CAAC,eAAA,CAAgB,IAAI,GAAG,OAAO,KAAA;EAC9D,MAAA,MAAM,QAAA,GAAA,CAAW,EAAA,GAAA,cAAA,CAAe,KAAK,CAAA,KAApB,IAAA,GAAA,MAAA,GAAA,EAAA,CAAwB,aAAA,CAAA;EACzC,MAAA,MAAM,QAAA,GAAW,cAAA,CAAe,IAAI,CAAA,CAAE,SAAS,CAAA;EAC/C,MAAA,OAAO,CAAC,CAAC,QAAA,IAAY,QAAA,CAAS,IAAI,QAAQ,CAAA;EAAA,IAC5C;EAAA;EAAA;EAAA;EAAA;EAAA;EAAA;EAAA;EAAA;EAAA;EAAA;EAAA,IAYA,eAA2B,KAAA,EAAyC;EAncxE,MAAA,IAAA,EAAA,EAAA,EAAA;EAocM,MAAA,IAAI,CAAC,gBAAgB,KAAK,CAAA,IAAK,CAAC,eAAA,CAAgB,IAAI,GAAG,OAAO,KAAA;EAC9D,MAAA,MAAM,YAAA,GAAA,CAAe,EAAA,GAAA,cAAA,CAAe,KAAK,CAAA,KAApB,IAAA,GAAA,MAAA,GAAA,EAAA,CAAwB,iBAAA,CAAA;EAC7C,MAAA,MAAM,WAAA,GAAA,CAAc,EAAA,GAAA,cAAA,CAAe,IAAI,CAAA,KAAnB,IAAA,GAAA,MAAA,GAAA,EAAA,CAAuB,iBAAA,CAAA;EAC3C,MAAA,OAAO,CAAC,CAAC,YAAA,IAAgB,WAAA,CAAY,KAAA,CAAM,CAAC,CAAA,EAAG,CAAA,KAAM,CAAA,KAAM,YAAA,CAAa,CAAC,CAAC,CAAA;EAAA,IAC5E;EAAA;EAAA;EAAA;EAAA;EAAA;EAAA,IAOA,aAAA,GAAwB;EACtB,MAAA,MAAM,IAAA,GAAO,eAAe,IAAI,CAAA;EAChC,MAAA,IAAI,CAAC,IAAA,EAAM;EACT,QAAA,IAAI,OAAA;EACF,UAAA,MAAM,IAAI,KAAA,CAAM,CAAA,wBAAA,EAA2B,KAAK,CAAA,+BAAA,CAAiC,CAAA;EACnF,QAAA,OAAO,gBAAA;EAAA,MACT;EACA,MAAA,OAAO,IAAA,CAAK,UAAA;EAAA,IACd;EAAA;EAAA;EAAA;EAAA;EAAA;EAAA,IAOA,oBAAA,GAA0C;EACxC,MAAA,MAAM,IAAA,GAAO,eAAe,IAAI,CAAA;EAChC,MAAA,IAAI,CAAC,IAAA,EAAM;EACT,QAAA,IAAI,OAAA;EACF,UAAA,MAAM,IAAI,KAAA,CAAM,CAAA,wBAAA,EAA2B,KAAK,CAAA,+BAAA,CAAiC,CAAA;EACnF,QAAA,OAAO,CAAC,gBAAgB,CAAA;EAAA,MAC1B;EACA,MAAA,OAAO,IAAA,CAAK,iBAAA;EAAA,IACd;EAAA;EAAA;EAAA;EAAA;EAAA;EAAA,IAOA,gBAAA,GAA0C;EACxC,MAAA,MAAM,IAAA,GAAO,eAAe,IAAI,CAAA;EAChC,MAAA,IAAI,CAAC,IAAA,EAAM;EACT,QAAA,IAAI,OAAA;EACF,UAAA,MAAM,IAAI,KAAA,CAAM,CAAA,wBAAA,EAA2B,KAAK,CAAA,+BAAA,CAAiC,CAAA;EACnF,QAAA,uBAAO,IAAI,GAAA,CAAI,CAAC,gBAAgB,CAAC,CAAA;EAAA,MACnC;EACA,MAAA,OAAO,IAAA,CAAK,aAAA;EAAA,IACd;EAAA;EAIF,EAAA,YAAA,CAAa,UAAA,EAAY,GAAG,IAAI,CAAA;EAGhC,EAAA,SAAA,CAAU,UAAU,CAAA;EACpB,EAAA,aAAA,CAAc,UAAU,CAAA;EAExB,EAAA,OAAO,UAAA;EACT;;;ACxfO,MAAM,KAAA,GAAQ,SAAS,MAAM;EAAC,CAAA,EAAG,OAAO;AAUxC,MAAM,UAAA,GAAa,QAAA,CAAS,KAAA,EAAO,YAAY;;;ECiB/C,SAAS,SAAA,CAA4B,OAAW,IAAA,EAAqB;EAE1E,EAAA,IAAI,CAAA;EACJ,EAAA,IAAI,KAAA,EAAO;EACT,IAAA,WAAA,CAAY,OAAO,IAAI,CAAA;EACvB,IAAA,CAAA,GAAI,KAAA;EAAA,EACN,CAAA,UAAW,mBAAA,EAAoB;EAE/B,EAAA,OAAO,SAAU,OAAiB,OAAA,EAAc;EAE9C,IAAA,IAAI,OAAA,CAAQ,SAAS,OAAA,EAAS;EAC9B,IAAA,IAAI,CAAC,YAAY,KAAK,CAAA;EACpB,MAAA,MAAM,IAAI,KAAA;EAAA,QACR,CAAA,gFAAA,EAAmF,MAAM,IAAI,CAAA;EAAA,OAC/F;EAEF,IAAA,YAAA,CAAa,OAAO,CAAC,CAAA;EAErB,IAAA,IAAI,OAAA,EAAS,gBAAA,CAAiB,KAAA,EAAO,IAAI,CAAA;EAAA,EAC3C,CAAA;EACF;;;EC1BO,SAAS,SAAA,CACd,KAAA,EACA,KAAA,EACA,IAAA,EACG;EAjCL,EAAA,IAAA,EAAA;EAkCE,EAAA,IAAI,CAAC,YAAY,KAAK,CAAA;EACpB,IAAA,MAAM,IAAI,KAAA;EAAA,MACR,CAAA,2EAAA,EAAA,CAA8E,EAAA,GAAA,KAAA,IAAA,IAAA,GAAA,MAAA,GAAA,KAAA,CAAO,IAAA,KAAP,IAAA,GAAA,EAAA,GAAe,SAAS,CAAA;EAAA,KACxG;EAGF,EAAA,IAAI,CAAA;EACJ,EAAA,IAAI,KAAA,EAAO;EACT,IAAA,WAAA,CAAY,OAAO,IAAI,CAAA;EACvB,IAAA,CAAA,GAAI,KAAA;EAAA,EACN,CAAA,UAAW,mBAAA,EAAoB;EAG/B,EAAA,MAAM,IAAA,GAAO,KAAA;EACb,EAAA,YAAA,CAAa,MAAM,CAAC,CAAA;EACpB,EAAA,IAAI,OAAA,EAAS,gBAAA,CAAiB,IAAA,EAAM,IAAI,CAAA;EAExC,EAAA,OAAO,KAAA;EACT;EAqBO,SAAS,cAAA,CACd,KAAA,EACA,KAAA,EACA,IAAA,EACkB;EA7EpB,EAAA,IAAA,EAAA;EA8EE,EAAA,IAAI,CAAC,YAAY,KAAK,CAAA;EACpB,IAAA,MAAM,IAAI,KAAA;EAAA,MACR,CAAA,+EAAA,EAAA,CAAkF,EAAA,GAAA,KAAA,IAAA,IAAA,GAAA,MAAA,GAAA,KAAA,CAAO,IAAA,KAAP,IAAA,GAAA,EAAA,GAAe,SAAS,CAAA;EAAA,KAC5G;EAGF,EAAA,IAAI,CAAA;EACJ,EAAA,IAAI,KAAA,EAAO;EACT,IAAA,WAAA,CAAY,OAAO,IAAI,CAAA;EACvB,IAAA,CAAA,GAAI,KAAA;EAAA,EACN,CAAA,UAAW,mBAAA,EAAoB;EAG/B,EAAA,MAAM,IAAA,GAAO,KAAA;EACb,EAAA,YAAA,CAAa,MAAM,CAAC,CAAA;EACpB,EAAA,IAAI,OAAA,EAAS,gBAAA,CAAiB,IAAA,EAAM,IAAI,CAAA;EAExC,EAAA,OAAO,KAAA;EACT","file":"index.global.js","sourcesContent":["/*\n Configuration options for the Sigil library.\n \n These options control runtime validation, inheritance checks, label autofill behavior.\n /\nexport interface SigilOptions {\n /\n Validation rule applied to sigil labels before registration.\n \n - A function receives the label and must return `true` if valid.\n * - A `RegExp` must match the label.\n * - `null` disables validation entirely.\n \n Defaults to `null`.\n /\n labelValidation?: ((label: string) => boolean) \| RegExp \| null;\n\n /\n Skips the runtime check that prevents subclasses from inheriting\n * the same sigil label as their ancestors.\n \n When `false` (default), extending a sigil class without\n * using `WithSigil(newLabel)` decorator will throw an error if the label\n * is reused and `OPTIONS.autofillLabels` is set to `false`.\n \n Set this to `true` only if you intentionally want subclasses to inherit labels\n * from their ancestors (this weakens the uniqueness guarantees).\n \n WARNING:\n * Disabling inheritanceCheck removes guaranties by 'Sigil' or unique label for\n * each class and allow multiple child classes to use the same label which can\n * result on false 'isOfType' result. this options should be used in debugging\n * only to silence all errors but never in production.\n /\n skipLabelInheritanceCheck?: boolean;\n\n /\n When enabled, non-decorated subclasses that would otherwise inherit an ancestor's label\n * will be assigned an autogenerated random label (so that explicit labels stay unique).\n /\n autofillLabels?: boolean;\n}\n\n/* -----------------------------------------\n * Main options object\n * ----------------------------------------- /\n\n/\n Defined SigilOptions used in the library.\n \n @internal\n /\nexport const OPTIONS: Required<SigilOptions> = {\n labelValidation: null,\n skipLabelInheritanceCheck: false,\n autofillLabels: false,\n};\n\n/\n Update runtime options for the Sigil library.\n * Call this early during application startup if you want non-default behavior.\n \n @param opts - Partial options to merge into the global `OPTIONS` object.\n /\nexport const updateOptions = (opts: SigilOptions): void => {\n for (const [k, v] of Object.entries(opts)) (OPTIONS as any)[k] = v;\n};\n\n/\n Default runtime options used by the Sigil library.\n \n @internal\n /\nconst DEFAULT_OPTIONS: Required<SigilOptions> = {\n labelValidation: null,\n skipLabelInheritanceCheck: false,\n autofillLabels: false,\n};\n\n// populate 'OPTIONS' with DEFAULT_OPTIONS\nupdateOptions(DEFAULT_OPTIONS);\n\n/* -----------------------------------------\n * Label validation\n * ----------------------------------------- /\n\n/\n Label validation regex. Labels must follow the pattern\n * `@scope/package.ClassName` where `ClassName` begins with an uppercase\n * letter. This avoids collisions across packages and helps debugging.\n \n It's advised to use this regex in 'SigilOptions.labelValidation'.\n /\nexport const DEFAULT_LABEL_REGEX = /^@[\\w-]+(?:\\/[\\w-]+)\\.[A-Z][A-Za-z0-9]$/;\n","/\n Symbol to uniquely identify sigil classes.\n \n Uses `Symbol.for()` so the symbol is stable across multiple bundles/realms\n * that share the same global symbol registry.\n \n @internal\n * @constant {symbol}\n /\nexport const __SIGIL__ = Symbol.for('@Sigil.__SIGIL__');\n\n/\n Symbol to uniquely identify the base of sigil classes.\n \n When attached to a constructor it indicates that the constructor is a\n * sigil base and should be treated specially by inheritance checks.\n \n @internal\n * @constant {symbol}\n /\nexport const __SIGIL_BASE__ = Symbol.for('@Sigil.__SIGIL_BASE__');\n\n/\n Symbol to mark constructors that were explicitly decorated with `WithSigil()`.\n \n This differs from `__SIGIL__` in that `__DECORATED__` indicates explicit\n * decoration (as opposed to automatically assigned labels).\n \n @internal\n * @constant {symbol}\n /\nexport const __DECORATED__ = Symbol.for('@Sigil.__DECORATED__');\n\n/\n Symbol to mark that inheritance checks for a given constructor have been completed.\n \n This is used to avoid repeated DEV-time validation on subsequent instance creations.\n \n @internal\n * @constant {symbol}\n /\nexport const __INHERITANCE_CHECKED__ = Symbol.for('@Sigil.__INHERITANCE_CHECKED__');\n\n/\n Symbol used to store the human-readable label for a sigil constructor.\n \n Stored on the constructor as a non-enumerable property.\n \n @internal\n * @constant {symbol}\n /\nexport const __LABEL__ = Symbol.for('@Sigil.__LABEL__');\n\n/\n Symbol used to store the linearized label lineage for a sigil constructor.\n \n This is an array of labels (strings) representing the inheritance path of labels.\n \n @internal\n * @constant {symbol}\n /\nexport const __LABEL_LINEAGE__ = Symbol.for('@Sigil.__LABEL_LINEAGE__');\n\n/\n Symbol used to store the set of labels for a sigil constructor.\n \n This is a `Set<string>` that mirrors `__LABEL_LINEAGE__` for fast membership checks.\n \n @internal\n * @constant {symbol}\n /\nexport const __LABEL_SET__ = Symbol.for('@Sigil.__LABEL_SET__');\n","/\n Internal helpers for u64. BigUint64Array is too slow as per 2025, so we implement it using Uint32Array.\n * @todo re-check https://issues.chromium.org/issues/42212588\n * @module\n /\nconst U32_MASK64 = / @__PURE__ / BigInt(2 * 32 - 1);\nconst _32n = /* @__PURE__ / BigInt(32);\n\nfunction fromBig(\n n: bigint,\n le = false\n): {\n h: number;\n l: number;\n} {\n if (le) return { h: Number(n & U32_MASK64), l: Number((n >> _32n) & U32_MASK64) };\n return { h: Number((n >> _32n) & U32_MASK64) \| 0, l: Number(n & U32_MASK64) \| 0 };\n}\n\nfunction split(lst: bigint[], le = false): Uint32Array[] {\n const len = lst.length;\n let Ah = new Uint32Array(len);\n let Al = new Uint32Array(len);\n for (let i = 0; i < len; i++) {\n const { h, l } = fromBig(lst[i], le);\n [Ah[i], Al[i]] = [h, l];\n }\n return [Ah, Al];\n}\n\nconst toBig = (h: number, l: number): bigint => (BigInt(h >>> 0) << _32n) \| BigInt(l >>> 0);\n// for Shift in [0, 32)\nconst shrSH = (h: number, _l: number, s: number): number => h >>> s;\nconst shrSL = (h: number, l: number, s: number): number => (h << (32 - s)) \| (l >>> s);\n// Right rotate for Shift in [1, 32)\nconst rotrSH = (h: number, l: number, s: number): number => (h >>> s) \| (l << (32 - s));\nconst rotrSL = (h: number, l: number, s: number): number => (h << (32 - s)) \| (l >>> s);\n// Right rotate for Shift in (32, 64), NOTE: 32 is special case.\nconst rotrBH = (h: number, l: number, s: number): number => (h << (64 - s)) \| (l >>> (s - 32));\nconst rotrBL = (h: number, l: number, s: number): number => (h >>> (s - 32)) \| (l << (64 - s));\n// Right rotate for shift===32 (just swaps l&h)\nconst rotr32H = (_h: number, l: number): number => l;\nconst rotr32L = (h: number, _l: number): number => h;\n// Left rotate for Shift in [1, 32)\nconst rotlSH = (h: number, l: number, s: number): number => (h << s) \| (l >>> (32 - s));\nconst rotlSL = (h: number, l: number, s: number): number => (l << s) \| (h >>> (32 - s));\n// Left rotate for Shift in (32, 64), NOTE: 32 is special case.\nconst rotlBH = (h: number, l: number, s: number): number => (l << (s - 32)) \| (h >>> (64 - s));\nconst rotlBL = (h: number, l: number, s: number): number => (h << (s - 32)) \| (l >>> (64 - s));\n\n// JS uses 32-bit signed integers for bitwise operations which means we cannot\n// simple take carry out of low bit sum by shift, we need to use division.\nfunction add(\n Ah: number,\n Al: number,\n Bh: number,\n Bl: number\n): {\n h: number;\n l: number;\n} {\n const l = (Al >>> 0) + (Bl >>> 0);\n return { h: (Ah + Bh + ((l / 2 * 32) \| 0)) \| 0, l: l \| 0 };\n}\n// Addition with more than 2 elements\nconst add3L = (Al: number, Bl: number, Cl: number): number => (Al >>> 0) + (Bl >>> 0) + (Cl >>> 0);\nconst add3H = (low: number, Ah: number, Bh: number, Ch: number): number =>\n (Ah + Bh + Ch + ((low / 2 32) \| 0)) \| 0;\nconst add4L = (Al: number, Bl: number, Cl: number, Dl: number): number =>\n (Al >>> 0) + (Bl >>> 0) + (Cl >>> 0) + (Dl >>> 0);\nconst add4H = (low: number, Ah: number, Bh: number, Ch: number, Dh: number): number =>\n (Ah + Bh + Ch + Dh + ((low / 2 32) \| 0)) \| 0;\nconst add5L = (Al: number, Bl: number, Cl: number, Dl: number, El: number): number =>\n (Al >>> 0) + (Bl >>> 0) + (Cl >>> 0) + (Dl >>> 0) + (El >>> 0);\nconst add5H = (low: number, Ah: number, Bh: number, Ch: number, Dh: number, Eh: number): number =>\n (Ah + Bh + Ch + Dh + Eh + ((low / 2 32) \| 0)) \| 0;\n\n// prettier-ignore\nexport {\n add, add3H, add3L, add4H, add4L, add5H, add5L, fromBig, rotlBH, rotlBL, rotlSH, rotlSL, rotr32H, rotr32L, rotrBH, rotrBL, rotrSH, rotrSL, shrSH, shrSL, split, toBig\n};\n// prettier-ignore\nconst u64: { fromBig: typeof fromBig; split: typeof split; toBig: (h: number, l: number) => bigint; shrSH: (h: number, _l: number, s: number) => number; shrSL: (h: number, l: number, s: number) => number; rotrSH: (h: number, l: number, s: number) => number; rotrSL: (h: number, l: number, s: number) => number; rotrBH: (h: number, l: number, s: number) => number; rotrBL: (h: number, l: number, s: number) => number; rotr32H: (_h: number, l: number) => number; rotr32L: (h: number, _l: number) => number; rotlSH: (h: number, l: number, s: number) => number; rotlSL: (h: number, l: number, s: number) => number; rotlBH: (h: number, l: number, s: number) => number; rotlBL: (h: number, l: number, s: number) => number; add: typeof add; add3L: (Al: number, Bl: number, Cl: number) => number; add3H: (low: number, Ah: number, Bh: number, Ch: number) => number; add4L: (Al: number, Bl: number, Cl: number, Dl: number) => number; add4H: (low: number, Ah: number, Bh: number, Ch: number, Dh: number) => number; add5H: (low: number, Ah: number, Bh: number, Ch: number, Dh: number, Eh: number) => number; add5L: (Al: number, Bl: number, Cl: number, Dl: number, El: number) => number; } = {\n fromBig, split, toBig,\n shrSH, shrSL,\n rotrSH, rotrSL, rotrBH, rotrBL,\n rotr32H, rotr32L,\n rotlSH, rotlSL, rotlBH, rotlBL,\n add, add3L, add3H, add4L, add4H, add5H, add5L,\n};\nexport default u64;\n","/\n * Utilities for hex, bytes, CSPRNG.\n * @module\n /\n/! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) /\n/* Checks if something is Uint8Array. Be careful: nodejs Buffer will return true. /\nexport function isBytes(a: unknown): a is Uint8Array {\n return a instanceof Uint8Array \|\| (ArrayBuffer.isView(a) && a.constructor.name === 'Uint8Array');\n}\n\n/* Asserts something is positive integer. /\nexport function anumber(n: number, title: string = ''): void {\n if (!Number.isSafeInteger(n) \|\| n < 0) {\n const prefix = title && `\"${title}\" `;\n throw new Error(`${prefix}expected integer >= 0, got ${n}`);\n }\n}\n\n/* Asserts something is Uint8Array. /\nexport function abytes(value: Uint8Array, length?: number, title: string = ''): Uint8Array {\n const bytes = isBytes(value);\n const len = value?.length;\n const needsLen = length !== undefined;\n if (!bytes \|\| (needsLen && len !== length)) {\n const prefix = title && `\"${title}\" `;\n const ofLen = needsLen ? ` of length ${length}` : '';\n const got = bytes ? `length=${len}` : `type=${typeof value}`;\n throw new Error(prefix + 'expected Uint8Array' + ofLen + ', got ' + got);\n }\n return value;\n}\n\n/* Asserts something is hash /\nexport function ahash(h: CHash): void {\n if (typeof h !== 'function' \|\| typeof h.create !== 'function')\n throw new Error('Hash must wrapped by utils.createHasher');\n anumber(h.outputLen);\n anumber(h.blockLen);\n}\n\n/* Asserts a hash instance has not been destroyed / finished /\nexport function aexists(instance: any, checkFinished = true): void {\n if (instance.destroyed) throw new Error('Hash instance has been destroyed');\n if (checkFinished && instance.finished) throw new Error('Hash#digest() has already been called');\n}\n\n/* Asserts output is properly-sized byte array /\nexport function aoutput(out: any, instance: any): void {\n abytes(out, undefined, 'digestInto() output');\n const min = instance.outputLen;\n if (out.length < min) {\n throw new Error('\"digestInto() output\" expected to be of length >=' + min);\n }\n}\n\n/* Generic type encompassing 8/16/32-byte arrays - but not 64-byte. /\n// prettier-ignore\nexport type TypedArray = Int8Array \| Uint8ClampedArray \| Uint8Array \|\n Uint16Array \| Int16Array \| Uint32Array \| Int32Array;\n\n/* Cast u8 / u16 / u32 to u8. /\nexport function u8(arr: TypedArray): Uint8Array {\n return new Uint8Array(arr.buffer, arr.byteOffset, arr.byteLength);\n}\n\n/* Cast u8 / u16 / u32 to u32. /\nexport function u32(arr: TypedArray): Uint32Array {\n return new Uint32Array(arr.buffer, arr.byteOffset, Math.floor(arr.byteLength / 4));\n}\n\n/* Zeroize a byte array. Warning: JS provides no guarantees. /\nexport function clean(...arrays: TypedArray[]): void {\n for (let i = 0; i < arrays.length; i++) {\n arrays[i].fill(0);\n }\n}\n\n/* Create DataView of an array for easy byte-level manipulation. /\nexport function createView(arr: TypedArray): DataView {\n return new DataView(arr.buffer, arr.byteOffset, arr.byteLength);\n}\n\n/* The rotate right (circular right shift) operation for uint32 /\nexport function rotr(word: number, shift: number): number {\n return (word << (32 - shift)) \| (word >>> shift);\n}\n\n/* The rotate left (circular left shift) operation for uint32 /\nexport function rotl(word: number, shift: number): number {\n return (word << shift) \| ((word >>> (32 - shift)) >>> 0);\n}\n\n/* Is current platform little-endian? Most are. Big-Endian platform: IBM /\nexport const isLE: boolean = / @__PURE__ / (() =>\n new Uint8Array(new Uint32Array([0x11223344]).buffer)[0] === 0x44)();\n\n/* The byte swap operation for uint32 /\nexport function byteSwap(word: number): number {\n return (\n ((word << 24) & 0xff000000) \|\n ((word << 8) & 0xff0000) \|\n ((word >>> 8) & 0xff00) \|\n ((word >>> 24) & 0xff)\n );\n}\n/* Conditionally byte swap if on a big-endian platform /\nexport const swap8IfBE: (n: number) => number = isLE\n ? (n: number) => n\n : (n: number) => byteSwap(n);\n\n/* In place byte swap for Uint32Array /\nexport function byteSwap32(arr: Uint32Array): Uint32Array {\n for (let i = 0; i < arr.length; i++) {\n arr[i] = byteSwap(arr[i]);\n }\n return arr;\n}\n\nexport const swap32IfBE: (u: Uint32Array) => Uint32Array = isLE\n ? (u: Uint32Array) => u\n : byteSwap32;\n\n// Built-in hex conversion https://caniuse.com/mdn-javascript_builtins_uint8array_fromhex\nconst hasHexBuiltin: boolean = / @__PURE__ / (() =>\n // @ts-ignore\n typeof Uint8Array.from([]).toHex === 'function' && typeof Uint8Array.fromHex === 'function')();\n\n// Array where index 0xf0 (240) is mapped to string 'f0'\nconst hexes = / @__PURE__ / Array.from({ length: 256 }, (_, i) =>\n i.toString(16).padStart(2, '0')\n);\n\n/\n Convert byte array to hex string. Uses built-in function, when available.\n * @example bytesToHex(Uint8Array.from([0xca, 0xfe, 0x01, 0x23])) // 'cafe0123'\n /\nexport function bytesToHex(bytes: Uint8Array): string {\n abytes(bytes);\n // @ts-ignore\n if (hasHexBuiltin) return bytes.toHex();\n // pre-caching improves the speed 6x\n let hex = '';\n for (let i = 0; i < bytes.length; i++) {\n hex += hexes[bytes[i]];\n }\n return hex;\n}\n\n// We use optimized technique to convert hex string to byte array\nconst asciis = { _0: 48, _9: 57, A: 65, F: 70, a: 97, f: 102 } as const;\nfunction asciiToBase16(ch: number): number \| undefined {\n if (ch >= asciis._0 && ch <= asciis._9) return ch - asciis._0; // '2' => 50-48\n if (ch >= asciis.A && ch <= asciis.F) return ch - (asciis.A - 10); // 'B' => 66-(65-10)\n if (ch >= asciis.a && ch <= asciis.f) return ch - (asciis.a - 10); // 'b' => 98-(97-10)\n return;\n}\n\n/\n Convert hex string to byte array. Uses built-in function, when available.\n * @example hexToBytes('cafe0123') // Uint8Array.from([0xca, 0xfe, 0x01, 0x23])\n /\nexport function hexToBytes(hex: string): Uint8Array {\n if (typeof hex !== 'string') throw new Error('hex string expected, got ' + typeof hex);\n // @ts-ignore\n if (hasHexBuiltin) return Uint8Array.fromHex(hex);\n const hl = hex.length;\n const al = hl / 2;\n if (hl % 2) throw new Error('hex string expected, got unpadded hex of length ' + hl);\n const array = new Uint8Array(al);\n for (let ai = 0, hi = 0; ai < al; ai++, hi += 2) {\n const n1 = asciiToBase16(hex.charCodeAt(hi));\n const n2 = asciiToBase16(hex.charCodeAt(hi + 1));\n if (n1 === undefined \|\| n2 === undefined) {\n const char = hex[hi] + hex[hi + 1];\n throw new Error('hex string expected, got non-hex character \"' + char + '\" at index ' + hi);\n }\n array[ai] = n1 16 + n2; // multiply first octet, e.g. 'a3' => 1016+3 => 160 + 3 => 163\n }\n return array;\n}\n\n/\n There is no setImmediate in browser and setTimeout is slow.\n * Call of async fn will return Promise, which will be fullfiled only on\n * next scheduler queue processing step and this is exactly what we need.\n /\nexport const nextTick = async (): Promise<void> => {};\n\n/* Returns control to thread each 'tick' ms to avoid blocking. /\nexport async function asyncLoop(\n iters: number,\n tick: number,\n cb: (i: number) => void\n): Promise<void> {\n let ts = Date.now();\n for (let i = 0; i < iters; i++) {\n cb(i);\n // Date.now() is not monotonic, so in case if clock goes backwards we return return control too\n const diff = Date.now() - ts;\n if (diff >= 0 && diff < tick) continue;\n await nextTick();\n ts += diff;\n }\n}\n\n// Global symbols, but ts doesn't see them: https://github.com/microsoft/TypeScript/issues/31535\ndeclare const TextEncoder: any;\n\n/\n Converts string to bytes using UTF8 encoding.\n * Built-in doesn't validate input to be string: we do the check.\n * @example utf8ToBytes('abc') // Uint8Array.from([97, 98, 99])\n /\nexport function utf8ToBytes(str: string): Uint8Array {\n if (typeof str !== 'string') throw new Error('string expected');\n return new Uint8Array(new TextEncoder().encode(str)); // https://bugzil.la/1681809\n}\n\n/* KDFs can accept string or Uint8Array for user convenience. /\nexport type KDFInput = string \| Uint8Array;\n\n/\n Helper for KDFs: consumes uint8array or string.\n * When string is passed, does utf8 decoding, using TextDecoder.\n /\nexport function kdfInputToBytes(data: KDFInput, errorTitle = ''): Uint8Array {\n if (typeof data === 'string') return utf8ToBytes(data);\n return abytes(data, undefined, errorTitle);\n}\n\n/* Copies several Uint8Arrays into one. /\nexport function concatBytes(...arrays: Uint8Array[]): Uint8Array {\n let sum = 0;\n for (let i = 0; i < arrays.length; i++) {\n const a = arrays[i];\n abytes(a);\n sum += a.length;\n }\n const res = new Uint8Array(sum);\n for (let i = 0, pad = 0; i < arrays.length; i++) {\n const a = arrays[i];\n res.set(a, pad);\n pad += a.length;\n }\n return res;\n}\n\ntype EmptyObj = {};\n/* Merges default options and passed options. /\nexport function checkOpts<T1 extends EmptyObj, T2 extends EmptyObj>(\n defaults: T1,\n opts?: T2\n): T1 & T2 {\n if (opts !== undefined && {}.toString.call(opts) !== '[object Object]')\n throw new Error('options must be object or undefined');\n const merged = Object.assign(defaults, opts);\n return merged as T1 & T2;\n}\n\n/* Common interface for all hashes. /\nexport interface Hash<T> {\n blockLen: number; // Bytes per block\n outputLen: number; // Bytes in output\n update(buf: Uint8Array): this;\n digestInto(buf: Uint8Array): void;\n digest(): Uint8Array;\n destroy(): void;\n _cloneInto(to?: T): T;\n clone(): T;\n}\n\n/* PseudoRandom (number) Generator /\nexport interface PRG {\n addEntropy(seed: Uint8Array): void;\n randomBytes(length: number): Uint8Array;\n clean(): void;\n}\n\n/\n XOF: streaming API to read digest in chunks.\n * Same as 'squeeze' in keccak/k12 and 'seek' in blake3, but more generic name.\n * When hash used in XOF mode it is up to user to call '.destroy' afterwards, since we cannot\n * destroy state, next call can require more bytes.\n /\nexport type HashXOF<T extends Hash<T>> = Hash<T> & {\n xof(bytes: number): Uint8Array; // Read 'bytes' bytes from digest stream\n xofInto(buf: Uint8Array): Uint8Array; // read buf.length bytes from digest stream into buf\n};\n\n/* Hash constructor /\nexport type HasherCons<T, Opts = undefined> = Opts extends undefined ? () => T : (opts?: Opts) => T;\n/* Optional hash params. /\nexport type HashInfo = {\n oid?: Uint8Array; // DER encoded OID in bytes\n};\n/* Hash function /\nexport type CHash<T extends Hash<T> = Hash<any>, Opts = undefined> = {\n outputLen: number;\n blockLen: number;\n} & HashInfo &\n (Opts extends undefined\n ? {\n (msg: Uint8Array): Uint8Array;\n create(): T;\n }\n : {\n (msg: Uint8Array, opts?: Opts): Uint8Array;\n create(opts?: Opts): T;\n });\n/* XOF with output /\nexport type CHashXOF<T extends HashXOF<T> = HashXOF<any>, Opts = undefined> = CHash<T, Opts>;\n\n/* Creates function with outputLen, blockLen, create properties from a class constructor. /\nexport function createHasher<T extends Hash<T>, Opts = undefined>(\n hashCons: HasherCons<T, Opts>,\n info: HashInfo = {}\n): CHash<T, Opts> {\n const hashC: any = (msg: Uint8Array, opts?: Opts) => hashCons(opts).update(msg).digest();\n const tmp = hashCons(undefined);\n hashC.outputLen = tmp.outputLen;\n hashC.blockLen = tmp.blockLen;\n hashC.create = (opts?: Opts) => hashCons(opts);\n Object.assign(hashC, info);\n return Object.freeze(hashC);\n}\n\n/* Cryptographically secure PRNG. Uses internal OS-level `crypto.getRandomValues`. /\nexport function randomBytes(bytesLength = 32): Uint8Array {\n const cr = typeof globalThis === 'object' ? (globalThis as any).crypto : null;\n if (typeof cr?.getRandomValues !== 'function')\n throw new Error('crypto.getRandomValues must be defined');\n return cr.getRandomValues(new Uint8Array(bytesLength));\n}\n\n/* Creates OID opts for NIST hashes, with prefix 06 09 60 86 48 01 65 03 04 02. /\nexport const oidNist = (suffix: number): Required<HashInfo> => ({\n oid: Uint8Array.from([0x06, 0x09, 0x60, 0x86, 0x48, 0x01, 0x65, 0x03, 0x04, 0x02, suffix]),\n});\n","/\n SHA3 (keccak) hash function, based on a new \"Sponge function\" design.\n * Different from older hashes, the internal state is bigger than output size.\n \n Check out [FIPS-202](https://nvlpubs.nist.gov/nistpubs/FIPS/NIST.FIPS.202.pdf),\n * [Website](https://keccak.team/keccak.html),\n * [the differences between SHA-3 and Keccak](https://crypto.stackexchange.com/questions/15727/what-are-the-key-differences-between-the-draft-sha-3-standard-and-the-keccak-sub).\n \n Check out `sha3-addons` module for cSHAKE, k12, and others.\n * @module\n /\nimport { rotlBH, rotlBL, rotlSH, rotlSL, split } from './_u64.ts';\n// prettier-ignore\nimport {\n abytes, aexists, anumber, aoutput,\n clean, createHasher,\n oidNist,\n swap32IfBE,\n u32,\n type CHash, type CHashXOF,\n type Hash,\n type HashInfo,\n type HashXOF\n} from './utils.ts';\n\n// No __PURE__ annotations in sha3 header:\n// EVERYTHING is in fact used on every export.\n// Various per round constants calculations\nconst _0n = BigInt(0);\nconst _1n = BigInt(1);\nconst _2n = BigInt(2);\nconst _7n = BigInt(7);\nconst _256n = BigInt(256);\nconst _0x71n = BigInt(0x71);\nconst SHA3_PI: number[] = [];\nconst SHA3_ROTL: number[] = [];\nconst _SHA3_IOTA: bigint[] = []; // no pure annotation: var is always used\nfor (let round = 0, R = _1n, x = 1, y = 0; round < 24; round++) {\n // Pi\n [x, y] = [y, (2 x + 3 * y) % 5];\n SHA3_PI.push(2 * (5 * y + x));\n // Rotational\n SHA3_ROTL.push((((round + 1) * (round + 2)) / 2) % 64);\n // Iota\n let t = _0n;\n for (let j = 0; j < 7; j++) {\n R = ((R << _1n) ^ ((R >> _7n) * _0x71n)) % _256n;\n if (R & _2n) t ^= _1n << ((_1n << BigInt(j)) - _1n);\n }\n _SHA3_IOTA.push(t);\n}\nconst IOTAS = split(_SHA3_IOTA, true);\nconst SHA3_IOTA_H = IOTAS[0];\nconst SHA3_IOTA_L = IOTAS[1];\n\n// Left rotation (without 0, 32, 64)\nconst rotlH = (h: number, l: number, s: number) => (s > 32 ? rotlBH(h, l, s) : rotlSH(h, l, s));\nconst rotlL = (h: number, l: number, s: number) => (s > 32 ? rotlBL(h, l, s) : rotlSL(h, l, s));\n\n/** `keccakf1600` internal function, additionally allows to adjust round count. /\nexport function keccakP(s: Uint32Array, rounds: number = 24): void {\n const B = new Uint32Array(5 2);\n // NOTE: all indices are x2 since we store state as u32 instead of u64 (bigints to slow in js)\n for (let round = 24 - rounds; round < 24; round++) {\n // Theta θ\n for (let x = 0; x < 10; x++) B[x] = s[x] ^ s[x + 10] ^ s[x + 20] ^ s[x + 30] ^ s[x + 40];\n for (let x = 0; x < 10; x += 2) {\n const idx1 = (x + 8) % 10;\n const idx0 = (x + 2) % 10;\n const B0 = B[idx0];\n const B1 = B[idx0 + 1];\n const Th = rotlH(B0, B1, 1) ^ B[idx1];\n const Tl = rotlL(B0, B1, 1) ^ B[idx1 + 1];\n for (let y = 0; y < 50; y += 10) {\n s[x + y] ^= Th;\n s[x + y + 1] ^= Tl;\n }\n }\n // Rho (ρ) and Pi (π)\n let curH = s[2];\n let curL = s[3];\n for (let t = 0; t < 24; t++) {\n const shift = SHA3_ROTL[t];\n const Th = rotlH(curH, curL, shift);\n const Tl = rotlL(curH, curL, shift);\n const PI = SHA3_PI[t];\n curH = s[PI];\n curL = s[PI + 1];\n s[PI] = Th;\n s[PI + 1] = Tl;\n }\n // Chi (χ)\n for (let y = 0; y < 50; y += 10) {\n for (let x = 0; x < 10; x++) B[x] = s[y + x];\n for (let x = 0; x < 10; x++) s[y + x] ^= ~B[(x + 2) % 10] & B[(x + 4) % 10];\n }\n // Iota (ι)\n s[0] ^= SHA3_IOTA_H[round];\n s[1] ^= SHA3_IOTA_L[round];\n }\n clean(B);\n}\n\n/** Keccak sponge function. /\nexport class Keccak implements Hash<Keccak>, HashXOF<Keccak> {\n protected state: Uint8Array;\n protected pos = 0;\n protected posOut = 0;\n protected finished = false;\n protected state32: Uint32Array;\n protected destroyed = false;\n\n public blockLen: number;\n public suffix: number;\n public outputLen: number;\n protected enableXOF = false;\n protected rounds: number;\n\n // NOTE: we accept arguments in bytes instead of bits here.\n constructor(\n blockLen: number,\n suffix: number,\n outputLen: number,\n enableXOF = false,\n rounds: number = 24\n ) {\n this.blockLen = blockLen;\n this.suffix = suffix;\n this.outputLen = outputLen;\n this.enableXOF = enableXOF;\n this.rounds = rounds;\n // Can be passed from user as dkLen\n anumber(outputLen, 'outputLen');\n // 1600 = 5x5 matrix of 64bit. 1600 bits === 200 bytes\n // 0 < blockLen < 200\n if (!(0 < blockLen && blockLen < 200))\n throw new Error('only keccak-f1600 function is supported');\n this.state = new Uint8Array(200);\n this.state32 = u32(this.state);\n }\n clone(): Keccak {\n return this._cloneInto();\n }\n protected keccak(): void {\n swap32IfBE(this.state32);\n keccakP(this.state32, this.rounds);\n swap32IfBE(this.state32);\n this.posOut = 0;\n this.pos = 0;\n }\n update(data: Uint8Array): this {\n aexists(this);\n abytes(data);\n const { blockLen, state } = this;\n const len = data.length;\n for (let pos = 0; pos < len; ) {\n const take = Math.min(blockLen - this.pos, len - pos);\n for (let i = 0; i < take; i++) state[this.pos++] ^= data[pos++];\n if (this.pos === blockLen) this.keccak();\n }\n return this;\n }\n protected finish(): void {\n if (this.finished) return;\n this.finished = true;\n const { state, suffix, pos, blockLen } = this;\n // Do the padding\n state[pos] ^= suffix;\n if ((suffix & 0x80) !== 0 && pos === blockLen - 1) this.keccak();\n state[blockLen - 1] ^= 0x80;\n this.keccak();\n }\n protected writeInto(out: Uint8Array): Uint8Array {\n aexists(this, false);\n abytes(out);\n this.finish();\n const bufferOut = this.state;\n const { blockLen } = this;\n for (let pos = 0, len = out.length; pos < len; ) {\n if (this.posOut >= blockLen) this.keccak();\n const take = Math.min(blockLen - this.posOut, len - pos);\n out.set(bufferOut.subarray(this.posOut, this.posOut + take), pos);\n this.posOut += take;\n pos += take;\n }\n return out;\n }\n xofInto(out: Uint8Array): Uint8Array {\n // Sha3/Keccak usage with XOF is probably mistake, only SHAKE instances can do XOF\n if (!this.enableXOF) throw new Error('XOF is not possible for this instance');\n return this.writeInto(out);\n }\n xof(bytes: number): Uint8Array {\n anumber(bytes);\n return this.xofInto(new Uint8Array(bytes));\n }\n digestInto(out: Uint8Array): Uint8Array {\n aoutput(out, this);\n if (this.finished) throw new Error('digest() was already called');\n this.writeInto(out);\n this.destroy();\n return out;\n }\n digest(): Uint8Array {\n return this.digestInto(new Uint8Array(this.outputLen));\n }\n destroy(): void {\n this.destroyed = true;\n clean(this.state);\n }\n _cloneInto(to?: Keccak): Keccak {\n const { blockLen, suffix, outputLen, rounds, enableXOF } = this;\n to \|\|= new Keccak(blockLen, suffix, outputLen, enableXOF, rounds);\n to.state32.set(this.state32);\n to.pos = this.pos;\n to.posOut = this.posOut;\n to.finished = this.finished;\n to.rounds = rounds;\n // Suffix can change in cSHAKE\n to.suffix = suffix;\n to.outputLen = outputLen;\n to.enableXOF = enableXOF;\n to.destroyed = this.destroyed;\n return to;\n }\n}\n\nconst genKeccak = (suffix: number, blockLen: number, outputLen: number, info: HashInfo = {}) =>\n createHasher(() => new Keccak(blockLen, suffix, outputLen), info);\n\n/* SHA3-224 hash function. /\nexport const sha3_224: CHash = / @__PURE__ / genKeccak(\n 0x06,\n 144,\n 28,\n / @__PURE__ / oidNist(0x07)\n);\n/* SHA3-256 hash function. Different from keccak-256. /\nexport const sha3_256: CHash = / @__PURE__ / genKeccak(\n 0x06,\n 136,\n 32,\n / @__PURE__ / oidNist(0x08)\n);\n/* SHA3-384 hash function. /\nexport const sha3_384: CHash = / @__PURE__ / genKeccak(\n 0x06,\n 104,\n 48,\n / @__PURE__ / oidNist(0x09)\n);\n/* SHA3-512 hash function. /\nexport const sha3_512: CHash = / @__PURE__ / genKeccak(\n 0x06,\n 72,\n 64,\n / @__PURE__ / oidNist(0x0a)\n);\n\n/* keccak-224 hash function. /\nexport const keccak_224: CHash = / @__PURE__ / genKeccak(0x01, 144, 28);\n/* keccak-256 hash function. Different from SHA3-256. /\nexport const keccak_256: CHash = / @__PURE__ / genKeccak(0x01, 136, 32);\n/* keccak-384 hash function. /\nexport const keccak_384: CHash = / @__PURE__ / genKeccak(0x01, 104, 48);\n/* keccak-512 hash function. /\nexport const keccak_512: CHash = / @__PURE__ / genKeccak(0x01, 72, 64);\n\n/* Options for SHAKE XOF. /\nexport type ShakeOpts = { dkLen?: number };\n\nconst genShake = (suffix: number, blockLen: number, outputLen: number, info: HashInfo = {}) =>\n createHasher<Keccak, ShakeOpts>(\n (opts: ShakeOpts = {}) =>\n new Keccak(blockLen, suffix, opts.dkLen === undefined ? outputLen : opts.dkLen, true),\n info\n );\n\n/* SHAKE128 XOF with 128-bit security. /\nexport const shake128: CHashXOF<Keccak, ShakeOpts> =\n / @__PURE__ /\n genShake(0x1f, 168, 16, / @__PURE__ / oidNist(0x0b));\n/* SHAKE256 XOF with 256-bit security. /\nexport const shake256: CHashXOF<Keccak, ShakeOpts> =\n / @__PURE__ /\n genShake(0x1f, 136, 32, / @__PURE__ / oidNist(0x0c));\n\n/* SHAKE128 XOF with 256-bit output (NIST version). /\nexport const shake128_32: CHashXOF<Keccak, ShakeOpts> =\n / @__PURE__ /\n genShake(0x1f, 168, 32, / @__PURE__ / oidNist(0x0b));\n/* SHAKE256 XOF with 512-bit output (NIST version). /\nexport const shake256_64: CHashXOF<Keccak, ShakeOpts> =\n / @__PURE__ /\n genShake(0x1f, 136, 64, / @__PURE__ / oidNist(0x0c));\n","/\r\n * bignumber.js v9.3.1\r\n * A JavaScript library for arbitrary-precision arithmetic.\r\n * https://github.com/MikeMcl/bignumber.js\r\n * Copyright (c) 2025 Michael Mclaughlin <M8ch88l@gmail.com>\r\n * MIT Licensed.\r\n \r\n BigNumber.prototype methods \| BigNumber methods\r\n * \|\r\n * absoluteValue abs \| clone\r\n * comparedTo \| config set\r\n * decimalPlaces dp \| DECIMAL_PLACES\r\n * dividedBy div \| ROUNDING_MODE\r\n * dividedToIntegerBy idiv \| EXPONENTIAL_AT\r\n * exponentiatedBy pow \| RANGE\r\n * integerValue \| CRYPTO\r\n * isEqualTo eq \| MODULO_MODE\r\n * isFinite \| POW_PRECISION\r\n * isGreaterThan gt \| FORMAT\r\n * isGreaterThanOrEqualTo gte \| ALPHABET\r\n * isInteger \| isBigNumber\r\n * isLessThan lt \| maximum max\r\n * isLessThanOrEqualTo lte \| minimum min\r\n * isNaN \| random\r\n * isNegative \| sum\r\n * isPositive \|\r\n * isZero \|\r\n * minus \|\r\n * modulo mod \|\r\n * multipliedBy times \|\r\n * negated \|\r\n * plus \|\r\n * precision sd \|\r\n * shiftedBy \|\r\n * squareRoot sqrt \|\r\n * toExponential \|\r\n * toFixed \|\r\n * toFormat \|\r\n * toFraction \|\r\n * toJSON \|\r\n * toNumber \|\r\n * toPrecision \|\r\n * toString \|\r\n * valueOf \|\r\n \r\n /\r\n\r\n\r\nvar\r\n isNumeric = /^-?(?:\\d+(?:\\.\\d)?\|\\.\\d+)(?:e[+-]?\\d+)?$/i,\r\n mathceil = Math.ceil,\r\n mathfloor = Math.floor,\r\n\r\n bignumberError = '[BigNumber Error] ',\r\n tooManyDigits = bignumberError + 'Number primitive has more than 15 significant digits: ',\r\n\r\n BASE = 1e14,\r\n LOG_BASE = 14,\r\n MAX_SAFE_INTEGER = 0x1fffffffffffff, // 2^53 - 1\r\n // MAX_INT32 = 0x7fffffff, // 2^31 - 1\r\n POWS_TEN = [1, 10, 100, 1e3, 1e4, 1e5, 1e6, 1e7, 1e8, 1e9, 1e10, 1e11, 1e12, 1e13],\r\n SQRT_BASE = 1e7,\r\n\r\n // EDITABLE\r\n // The limit on the value of DECIMAL_PLACES, TO_EXP_NEG, TO_EXP_POS, MIN_EXP, MAX_EXP, and\r\n // the arguments to toExponential, toFixed, toFormat, and toPrecision.\r\n MAX = 1E9; // 0 to MAX_INT32\r\n\r\n\r\n/\r\n * Create and return a BigNumber constructor.\r\n /\r\nfunction clone(configObject) {\r\n var div, convertBase, parseNumeric,\r\n P = BigNumber.prototype = { constructor: BigNumber, toString: null, valueOf: null },\r\n ONE = new BigNumber(1),\r\n\r\n\r\n //----------------------------- EDITABLE CONFIG DEFAULTS -------------------------------\r\n\r\n\r\n // The default values below must be integers within the inclusive ranges stated.\r\n // The values can also be changed at run-time using BigNumber.set.\r\n\r\n // The maximum number of decimal places for operations involving division.\r\n DECIMAL_PLACES = 20, // 0 to MAX\r\n\r\n // The rounding mode used when rounding to the above decimal places, and when using\r\n // toExponential, toFixed, toFormat and toPrecision, and round (default value).\r\n // UP 0 Away from zero.\r\n // DOWN 1 Towards zero.\r\n // CEIL 2 Towards +Infinity.\r\n // FLOOR 3 Towards -Infinity.\r\n // HALF_UP 4 Towards nearest neighbour. If equidistant, up.\r\n // HALF_DOWN 5 Towards nearest neighbour. If equidistant, down.\r\n // HALF_EVEN 6 Towards nearest neighbour. If equidistant, towards even neighbour.\r\n // HALF_CEIL 7 Towards nearest neighbour. If equidistant, towards +Infinity.\r\n // HALF_FLOOR 8 Towards nearest neighbour. If equidistant, towards -Infinity.\r\n ROUNDING_MODE = 4, // 0 to 8\r\n\r\n // EXPONENTIAL_AT : [TO_EXP_NEG , TO_EXP_POS]\r\n\r\n // The exponent value at and beneath which toString returns exponential notation.\r\n // Number type: -7\r\n TO_EXP_NEG = -7, // 0 to -MAX\r\n\r\n // The exponent value at and above which toString returns exponential notation.\r\n // Number type: 21\r\n TO_EXP_POS = 21, // 0 to MAX\r\n\r\n // RANGE : [MIN_EXP, MAX_EXP]\r\n\r\n // The minimum exponent value, beneath which underflow to zero occurs.\r\n // Number type: -324 (5e-324)\r\n MIN_EXP = -1e7, // -1 to -MAX\r\n\r\n // The maximum exponent value, above which overflow to Infinity occurs.\r\n // Number type: 308 (1.7976931348623157e+308)\r\n // For MAX_EXP > 1e7, e.g. new BigNumber('1e100000000').plus(1) may be slow.\r\n MAX_EXP = 1e7, // 1 to MAX\r\n\r\n // Whether to use cryptographically-secure random number generation, if available.\r\n CRYPTO = false, // true or false\r\n\r\n // The modulo mode used when calculating the modulus: a mod n.\r\n // The quotient (q = a / n) is calculated according to the corresponding rounding mode.\r\n // The remainder (r) is calculated as: r = a - n q.\r\n //\r\n // UP 0 The remainder is positive if the dividend is negative, else is negative.\r\n // DOWN 1 The remainder has the same sign as the dividend.\r\n // This modulo mode is commonly known as 'truncated division' and is\r\n // equivalent to (a % n) in JavaScript.\r\n // FLOOR 3 The remainder has the same sign as the divisor (Python %).\r\n // HALF_EVEN 6 This modulo mode implements the IEEE 754 remainder function.\r\n // EUCLID 9 Euclidian division. q = sign(n) * floor(a / abs(n)).\r\n // The remainder is always positive.\r\n //\r\n // The truncated division, floored division, Euclidian division and IEEE 754 remainder\r\n // modes are commonly used for the modulus operation.\r\n // Although the other rounding modes can also be used, they may not give useful results.\r\n MODULO_MODE = 1, // 0 to 9\r\n\r\n // The maximum number of significant digits of the result of the exponentiatedBy operation.\r\n // If POW_PRECISION is 0, there will be unlimited significant digits.\r\n POW_PRECISION = 0, // 0 to MAX\r\n\r\n // The format specification used by the BigNumber.prototype.toFormat method.\r\n FORMAT = {\r\n prefix: '',\r\n groupSize: 3,\r\n secondaryGroupSize: 0,\r\n groupSeparator: ',',\r\n decimalSeparator: '.',\r\n fractionGroupSize: 0,\r\n fractionGroupSeparator: '\\xA0', // non-breaking space\r\n suffix: ''\r\n },\r\n\r\n // The alphabet used for base conversion. It must be at least 2 characters long, with no '+',\r\n // '-', '.', whitespace, or repeated character.\r\n // '0123456789abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ$_'\r\n ALPHABET = '0123456789abcdefghijklmnopqrstuvwxyz',\r\n alphabetHasNormalDecimalDigits = true;\r\n\r\n\r\n //------------------------------------------------------------------------------------------\r\n\r\n\r\n // CONSTRUCTOR\r\n\r\n\r\n /\r\n The BigNumber constructor and exported function.\r\n * Create and return a new instance of a BigNumber object.\r\n \r\n v {number\|string\|BigNumber} A numeric value.\r\n * [b] {number} The base of v. Integer, 2 to ALPHABET.length inclusive.\r\n /\r\n function BigNumber(v, b) {\r\n var alphabet, c, caseChanged, e, i, isNum, len, str,\r\n x = this;\r\n\r\n // Enable constructor call without `new`.\r\n if (!(x instanceof BigNumber)) return new BigNumber(v, b);\r\n\r\n if (b == null) {\r\n\r\n if (v && v._isBigNumber === true) {\r\n x.s = v.s;\r\n\r\n if (!v.c \|\| v.e > MAX_EXP) {\r\n x.c = x.e = null;\r\n } else if (v.e < MIN_EXP) {\r\n x.c = [x.e = 0];\r\n } else {\r\n x.e = v.e;\r\n x.c = v.c.slice();\r\n }\r\n\r\n return;\r\n }\r\n\r\n if ((isNum = typeof v == 'number') && v 0 == 0) {\r\n\r\n // Use `1 / n` to handle minus zero also.\r\n x.s = 1 / v < 0 ? (v = -v, -1) : 1;\r\n\r\n // Fast path for integers, where n < 2147483648 (2*31).\r\n if (v === ~~v) {\r\n for (e = 0, i = v; i >= 10; i /= 10, e++);\r\n\r\n if (e > MAX_EXP) {\r\n x.c = x.e = null;\r\n } else {\r\n x.e = e;\r\n x.c = [v];\r\n }\r\n\r\n return;\r\n }\r\n\r\n str = String(v);\r\n } else {\r\n\r\n if (!isNumeric.test(str = String(v))) return parseNumeric(x, str, isNum);\r\n\r\n x.s = str.charCodeAt(0) == 45 ? (str = str.slice(1), -1) : 1;\r\n }\r\n\r\n // Decimal point?\r\n if ((e = str.indexOf('.')) > -1) str = str.replace('.', '');\r\n\r\n // Exponential form?\r\n if ((i = str.search(/e/i)) > 0) {\r\n\r\n // Determine exponent.\r\n if (e < 0) e = i;\r\n e += +str.slice(i + 1);\r\n str = str.substring(0, i);\r\n } else if (e < 0) {\r\n\r\n // Integer.\r\n e = str.length;\r\n }\r\n\r\n } else {\r\n\r\n // '[BigNumber Error] Base {not a primitive number\|not an integer\|out of range}: {b}'\r\n intCheck(b, 2, ALPHABET.length, 'Base');\r\n\r\n // Allow exponential notation to be used with base 10 argument, while\r\n // also rounding to DECIMAL_PLACES as with other bases.\r\n if (b == 10 && alphabetHasNormalDecimalDigits) {\r\n x = new BigNumber(v);\r\n return round(x, DECIMAL_PLACES + x.e + 1, ROUNDING_MODE);\r\n }\r\n\r\n str = String(v);\r\n\r\n if (isNum = typeof v == 'number') {\r\n\r\n // Avoid potential interpretation of Infinity and NaN as base 44+ values.\r\n if (v 0 != 0) return parseNumeric(x, str, isNum, b);\r\n\r\n x.s = 1 / v < 0 ? (str = str.slice(1), -1) : 1;\r\n\r\n // '[BigNumber Error] Number primitive has more than 15 significant digits: {n}'\r\n if (BigNumber.DEBUG && str.replace(/^0\\.0\|\\./, '').length > 15) {\r\n throw Error\r\n (tooManyDigits + v);\r\n }\r\n } else {\r\n x.s = str.charCodeAt(0) === 45 ? (str = str.slice(1), -1) : 1;\r\n }\r\n\r\n alphabet = ALPHABET.slice(0, b);\r\n e = i = 0;\r\n\r\n // Check that str is a valid base b number.\r\n // Don't use RegExp, so alphabet can contain special characters.\r\n for (len = str.length; i < len; i++) {\r\n if (alphabet.indexOf(c = str.charAt(i)) < 0) {\r\n if (c == '.') {\r\n\r\n // If '.' is not the first character and it has not be found before.\r\n if (i > e) {\r\n e = len;\r\n continue;\r\n }\r\n } else if (!caseChanged) {\r\n\r\n // Allow e.g. hexadecimal 'FF' as well as 'ff'.\r\n if (str == str.toUpperCase() && (str = str.toLowerCase()) \|\|\r\n str == str.toLowerCase() && (str = str.toUpperCase())) {\r\n caseChanged = true;\r\n i = -1;\r\n e = 0;\r\n continue;\r\n }\r\n }\r\n\r\n return parseNumeric(x, String(v), isNum, b);\r\n }\r\n }\r\n\r\n // Prevent later check for length on converted number.\r\n isNum = false;\r\n str = convertBase(str, b, 10, x.s);\r\n\r\n // Decimal point?\r\n if ((e = str.indexOf('.')) > -1) str = str.replace('.', '');\r\n else e = str.length;\r\n }\r\n\r\n // Determine leading zeros.\r\n for (i = 0; str.charCodeAt(i) === 48; i++);\r\n\r\n // Determine trailing zeros.\r\n for (len = str.length; str.charCodeAt(--len) === 48;);\r\n\r\n if (str = str.slice(i, ++len)) {\r\n len -= i;\r\n\r\n // '[BigNumber Error] Number primitive has more than 15 significant digits: {n}'\r\n if (isNum && BigNumber.DEBUG &&\r\n len > 15 && (v > MAX_SAFE_INTEGER \|\| v !== mathfloor(v))) {\r\n throw Error\r\n (tooManyDigits + (x.s v));\r\n }\r\n\r\n // Overflow?\r\n if ((e = e - i - 1) > MAX_EXP) {\r\n\r\n // Infinity.\r\n x.c = x.e = null;\r\n\r\n // Underflow?\r\n } else if (e < MIN_EXP) {\r\n\r\n // Zero.\r\n x.c = [x.e = 0];\r\n } else {\r\n x.e = e;\r\n x.c = [];\r\n\r\n // Transform base\r\n\r\n // e is the base 10 exponent.\r\n // i is where to slice str to get the first element of the coefficient array.\r\n i = (e + 1) % LOG_BASE;\r\n if (e < 0) i += LOG_BASE; // i < 1\r\n\r\n if (i < len) {\r\n if (i) x.c.push(+str.slice(0, i));\r\n\r\n for (len -= LOG_BASE; i < len;) {\r\n x.c.push(+str.slice(i, i += LOG_BASE));\r\n }\r\n\r\n i = LOG_BASE - (str = str.slice(i)).length;\r\n } else {\r\n i -= len;\r\n }\r\n\r\n for (; i--; str += '0');\r\n x.c.push(+str);\r\n }\r\n } else {\r\n\r\n // Zero.\r\n x.c = [x.e = 0];\r\n }\r\n }\r\n\r\n\r\n // CONSTRUCTOR PROPERTIES\r\n\r\n\r\n BigNumber.clone = clone;\r\n\r\n BigNumber.ROUND_UP = 0;\r\n BigNumber.ROUND_DOWN = 1;\r\n BigNumber.ROUND_CEIL = 2;\r\n BigNumber.ROUND_FLOOR = 3;\r\n BigNumber.ROUND_HALF_UP = 4;\r\n BigNumber.ROUND_HALF_DOWN = 5;\r\n BigNumber.ROUND_HALF_EVEN = 6;\r\n BigNumber.ROUND_HALF_CEIL = 7;\r\n BigNumber.ROUND_HALF_FLOOR = 8;\r\n BigNumber.EUCLID = 9;\r\n\r\n\r\n /\r\n Configure infrequently-changing library-wide settings.\r\n \r\n Accept an object with the following optional properties (if the value of a property is\r\n * a number, it must be an integer within the inclusive range stated):\r\n \r\n DECIMAL_PLACES {number} 0 to MAX\r\n * ROUNDING_MODE {number} 0 to 8\r\n * EXPONENTIAL_AT {number\|number[]} -MAX to MAX or [-MAX to 0, 0 to MAX]\r\n * RANGE {number\|number[]} -MAX to MAX (not zero) or [-MAX to -1, 1 to MAX]\r\n * CRYPTO {boolean} true or false\r\n * MODULO_MODE {number} 0 to 9\r\n * POW_PRECISION {number} 0 to MAX\r\n * ALPHABET {string} A string of two or more unique characters which does\r\n * not contain '.'.\r\n * FORMAT {object} An object with some of the following properties:\r\n * prefix {string}\r\n * groupSize {number}\r\n * secondaryGroupSize {number}\r\n * groupSeparator {string}\r\n * decimalSeparator {string}\r\n * fractionGroupSize {number}\r\n * fractionGroupSeparator {string}\r\n * suffix {string}\r\n \r\n (The values assigned to the above FORMAT object properties are not checked for validity.)\r\n \r\n E.g.\r\n * BigNumber.config({ DECIMAL_PLACES : 20, ROUNDING_MODE : 4 })\r\n \r\n Ignore properties/parameters set to null or undefined, except for ALPHABET.\r\n \r\n Return an object with the properties current values.\r\n /\r\n BigNumber.config = BigNumber.set = function (obj) {\r\n var p, v;\r\n\r\n if (obj != null) {\r\n\r\n if (typeof obj == 'object') {\r\n\r\n // DECIMAL_PLACES {number} Integer, 0 to MAX inclusive.\r\n // '[BigNumber Error] DECIMAL_PLACES {not a primitive number\|not an integer\|out of range}: {v}'\r\n if (obj.hasOwnProperty(p = 'DECIMAL_PLACES')) {\r\n v = obj[p];\r\n intCheck(v, 0, MAX, p);\r\n DECIMAL_PLACES = v;\r\n }\r\n\r\n // ROUNDING_MODE {number} Integer, 0 to 8 inclusive.\r\n // '[BigNumber Error] ROUNDING_MODE {not a primitive number\|not an integer\|out of range}: {v}'\r\n if (obj.hasOwnProperty(p = 'ROUNDING_MODE')) {\r\n v = obj[p];\r\n intCheck(v, 0, 8, p);\r\n ROUNDING_MODE = v;\r\n }\r\n\r\n // EXPONENTIAL_AT {number\|number[]}\r\n // Integer, -MAX to MAX inclusive or\r\n // [integer -MAX to 0 inclusive, 0 to MAX inclusive].\r\n // '[BigNumber Error] EXPONENTIAL_AT {not a primitive number\|not an integer\|out of range}: {v}'\r\n if (obj.hasOwnProperty(p = 'EXPONENTIAL_AT')) {\r\n v = obj[p];\r\n if (v && v.pop) {\r\n intCheck(v[0], -MAX, 0, p);\r\n intCheck(v[1], 0, MAX, p);\r\n TO_EXP_NEG = v[0];\r\n TO_EXP_POS = v[1];\r\n } else {\r\n intCheck(v, -MAX, MAX, p);\r\n TO_EXP_NEG = -(TO_EXP_POS = v < 0 ? -v : v);\r\n }\r\n }\r\n\r\n // RANGE {number\|number[]} Non-zero integer, -MAX to MAX inclusive or\r\n // [integer -MAX to -1 inclusive, integer 1 to MAX inclusive].\r\n // '[BigNumber Error] RANGE {not a primitive number\|not an integer\|out of range\|cannot be zero}: {v}'\r\n if (obj.hasOwnProperty(p = 'RANGE')) {\r\n v = obj[p];\r\n if (v && v.pop) {\r\n intCheck(v[0], -MAX, -1, p);\r\n intCheck(v[1], 1, MAX, p);\r\n MIN_EXP = v[0];\r\n MAX_EXP = v[1];\r\n } else {\r\n intCheck(v, -MAX, MAX, p);\r\n if (v) {\r\n MIN_EXP = -(MAX_EXP = v < 0 ? -v : v);\r\n } else {\r\n throw Error\r\n (bignumberError + p + ' cannot be zero: ' + v);\r\n }\r\n }\r\n }\r\n\r\n // CRYPTO {boolean} true or false.\r\n // '[BigNumber Error] CRYPTO not true or false: {v}'\r\n // '[BigNumber Error] crypto unavailable'\r\n if (obj.hasOwnProperty(p = 'CRYPTO')) {\r\n v = obj[p];\r\n if (v === !!v) {\r\n if (v) {\r\n if (typeof crypto != 'undefined' && crypto &&\r\n (crypto.getRandomValues \|\| crypto.randomBytes)) {\r\n CRYPTO = v;\r\n } else {\r\n CRYPTO = !v;\r\n throw Error\r\n (bignumberError + 'crypto unavailable');\r\n }\r\n } else {\r\n CRYPTO = v;\r\n }\r\n } else {\r\n throw Error\r\n (bignumberError + p + ' not true or false: ' + v);\r\n }\r\n }\r\n\r\n // MODULO_MODE {number} Integer, 0 to 9 inclusive.\r\n // '[BigNumber Error] MODULO_MODE {not a primitive number\|not an integer\|out of range}: {v}'\r\n if (obj.hasOwnProperty(p = 'MODULO_MODE')) {\r\n v = obj[p];\r\n intCheck(v, 0, 9, p);\r\n MODULO_MODE = v;\r\n }\r\n\r\n // POW_PRECISION {number} Integer, 0 to MAX inclusive.\r\n // '[BigNumber Error] POW_PRECISION {not a primitive number\|not an integer\|out of range}: {v}'\r\n if (obj.hasOwnProperty(p = 'POW_PRECISION')) {\r\n v = obj[p];\r\n intCheck(v, 0, MAX, p);\r\n POW_PRECISION = v;\r\n }\r\n\r\n // FORMAT {object}\r\n // '[BigNumber Error] FORMAT not an object: {v}'\r\n if (obj.hasOwnProperty(p = 'FORMAT')) {\r\n v = obj[p];\r\n if (typeof v == 'object') FORMAT = v;\r\n else throw Error\r\n (bignumberError + p + ' not an object: ' + v);\r\n }\r\n\r\n // ALPHABET {string}\r\n // '[BigNumber Error] ALPHABET invalid: {v}'\r\n if (obj.hasOwnProperty(p = 'ALPHABET')) {\r\n v = obj[p];\r\n\r\n // Disallow if less than two characters,\r\n // or if it contains '+', '-', '.', whitespace, or a repeated character.\r\n if (typeof v == 'string' && !/^.?$\|[+\\-.\\s]\|(.).\\1/.test(v)) {\r\n alphabetHasNormalDecimalDigits = v.slice(0, 10) == '0123456789';\r\n ALPHABET = v;\r\n } else {\r\n throw Error\r\n (bignumberError + p + ' invalid: ' + v);\r\n }\r\n }\r\n\r\n } else {\r\n\r\n // '[BigNumber Error] Object expected: {v}'\r\n throw Error\r\n (bignumberError + 'Object expected: ' + obj);\r\n }\r\n }\r\n\r\n return {\r\n DECIMAL_PLACES: DECIMAL_PLACES,\r\n ROUNDING_MODE: ROUNDING_MODE,\r\n EXPONENTIAL_AT: [TO_EXP_NEG, TO_EXP_POS],\r\n RANGE: [MIN_EXP, MAX_EXP],\r\n CRYPTO: CRYPTO,\r\n MODULO_MODE: MODULO_MODE,\r\n POW_PRECISION: POW_PRECISION,\r\n FORMAT: FORMAT,\r\n ALPHABET: ALPHABET\r\n };\r\n };\r\n\r\n\r\n /\r\n Return true if v is a BigNumber instance, otherwise return false.\r\n \r\n If BigNumber.DEBUG is true, throw if a BigNumber instance is not well-formed.\r\n \r\n v {any}\r\n \r\n '[BigNumber Error] Invalid BigNumber: {v}'\r\n /\r\n BigNumber.isBigNumber = function (v) {\r\n if (!v \|\| v._isBigNumber !== true) return false;\r\n if (!BigNumber.DEBUG) return true;\r\n\r\n var i, n,\r\n c = v.c,\r\n e = v.e,\r\n s = v.s;\r\n\r\n out: if ({}.toString.call(c) == '[object Array]') {\r\n\r\n if ((s === 1 \|\| s === -1) && e >= -MAX && e <= MAX && e === mathfloor(e)) {\r\n\r\n // If the first element is zero, the BigNumber value must be zero.\r\n if (c[0] === 0) {\r\n if (e === 0 && c.length === 1) return true;\r\n break out;\r\n }\r\n\r\n // Calculate number of digits that c[0] should have, based on the exponent.\r\n i = (e + 1) % LOG_BASE;\r\n if (i < 1) i += LOG_BASE;\r\n\r\n // Calculate number of digits of c[0].\r\n //if (Math.ceil(Math.log(c[0] + 1) / Math.LN10) == i) {\r\n if (String(c[0]).length == i) {\r\n\r\n for (i = 0; i < c.length; i++) {\r\n n = c[i];\r\n if (n < 0 \|\| n >= BASE \|\| n !== mathfloor(n)) break out;\r\n }\r\n\r\n // Last element cannot be zero, unless it is the only element.\r\n if (n !== 0) return true;\r\n }\r\n }\r\n\r\n // Infinity/NaN\r\n } else if (c === null && e === null && (s === null \|\| s === 1 \|\| s === -1)) {\r\n return true;\r\n }\r\n\r\n throw Error\r\n (bignumberError + 'Invalid BigNumber: ' + v);\r\n };\r\n\r\n\r\n /\r\n * Return a new BigNumber whose value is the maximum of the arguments.\r\n \r\n arguments {number\|string\|BigNumber}\r\n /\r\n BigNumber.maximum = BigNumber.max = function () {\r\n return maxOrMin(arguments, -1);\r\n };\r\n\r\n\r\n /\r\n * Return a new BigNumber whose value is the minimum of the arguments.\r\n \r\n arguments {number\|string\|BigNumber}\r\n /\r\n BigNumber.minimum = BigNumber.min = function () {\r\n return maxOrMin(arguments, 1);\r\n };\r\n\r\n\r\n /\r\n * Return a new BigNumber with a random value equal to or greater than 0 and less than 1,\r\n * and with dp, or DECIMAL_PLACES if dp is omitted, decimal places (or less if trailing\r\n * zeros are produced).\r\n \r\n [dp] {number} Decimal places. Integer, 0 to MAX inclusive.\r\n \r\n '[BigNumber Error] Argument {not a primitive number\|not an integer\|out of range}: {dp}'\r\n * '[BigNumber Error] crypto unavailable'\r\n /\r\n BigNumber.random = (function () {\r\n var pow2_53 = 0x20000000000000;\r\n\r\n // Return a 53 bit integer n, where 0 <= n < 9007199254740992.\r\n // Check if Math.random() produces more than 32 bits of randomness.\r\n // If it does, assume at least 53 bits are produced, otherwise assume at least 30 bits.\r\n // 0x40000000 is 2^30, 0x800000 is 2^23, 0x1fffff is 2^21 - 1.\r\n var random53bitInt = (Math.random() pow2_53) & 0x1fffff\r\n ? function () { return mathfloor(Math.random() * pow2_53); }\r\n : function () { return ((Math.random() * 0x40000000 \| 0) * 0x800000) +\r\n (Math.random() * 0x800000 \| 0); };\r\n\r\n return function (dp) {\r\n var a, b, e, k, v,\r\n i = 0,\r\n c = [],\r\n rand = new BigNumber(ONE);\r\n\r\n if (dp == null) dp = DECIMAL_PLACES;\r\n else intCheck(dp, 0, MAX);\r\n\r\n k = mathceil(dp / LOG_BASE);\r\n\r\n if (CRYPTO) {\r\n\r\n // Browsers supporting crypto.getRandomValues.\r\n if (crypto.getRandomValues) {\r\n\r\n a = crypto.getRandomValues(new Uint32Array(k = 2));\r\n\r\n for (; i < k;) {\r\n\r\n // 53 bits:\r\n // ((Math.pow(2, 32) - 1) Math.pow(2, 21)).toString(2)\r\n // 11111 11111111 11111111 11111111 11100000 00000000 00000000\r\n // ((Math.pow(2, 32) - 1) >>> 11).toString(2)\r\n // 11111 11111111 11111111\r\n // 0x20000 is 2^21.\r\n v = a[i] * 0x20000 + (a[i + 1] >>> 11);\r\n\r\n // Rejection sampling:\r\n // 0 <= v < 9007199254740992\r\n // Probability that v >= 9e15, is\r\n // 7199254740992 / 9007199254740992 ~= 0.0008, i.e. 1 in 1251\r\n if (v >= 9e15) {\r\n b = crypto.getRandomValues(new Uint32Array(2));\r\n a[i] = b[0];\r\n a[i + 1] = b[1];\r\n } else {\r\n\r\n // 0 <= v <= 8999999999999999\r\n // 0 <= (v % 1e14) <= 99999999999999\r\n c.push(v % 1e14);\r\n i += 2;\r\n }\r\n }\r\n i = k / 2;\r\n\r\n // Node.js supporting crypto.randomBytes.\r\n } else if (crypto.randomBytes) {\r\n\r\n // buffer\r\n a = crypto.randomBytes(k = 7);\r\n\r\n for (; i < k;) {\r\n\r\n // 0x1000000000000 is 2^48, 0x10000000000 is 2^40\r\n // 0x100000000 is 2^32, 0x1000000 is 2^24\r\n // 11111 11111111 11111111 11111111 11111111 11111111 11111111\r\n // 0 <= v < 9007199254740992\r\n v = ((a[i] & 31) 0x1000000000000) + (a[i + 1] * 0x10000000000) +\r\n (a[i + 2] * 0x100000000) + (a[i + 3] * 0x1000000) +\r\n (a[i + 4] << 16) + (a[i + 5] << 8) + a[i + 6];\r\n\r\n if (v >= 9e15) {\r\n crypto.randomBytes(7).copy(a, i);\r\n } else {\r\n\r\n // 0 <= (v % 1e14) <= 99999999999999\r\n c.push(v % 1e14);\r\n i += 7;\r\n }\r\n }\r\n i = k / 7;\r\n } else {\r\n CRYPTO = false;\r\n throw Error\r\n (bignumberError + 'crypto unavailable');\r\n }\r\n }\r\n\r\n // Use Math.random.\r\n if (!CRYPTO) {\r\n\r\n for (; i < k;) {\r\n v = random53bitInt();\r\n if (v < 9e15) c[i++] = v % 1e14;\r\n }\r\n }\r\n\r\n k = c[--i];\r\n dp %= LOG_BASE;\r\n\r\n // Convert trailing digits to zeros according to dp.\r\n if (k && dp) {\r\n v = POWS_TEN[LOG_BASE - dp];\r\n c[i] = mathfloor(k / v) * v;\r\n }\r\n\r\n // Remove trailing elements which are zero.\r\n for (; c[i] === 0; c.pop(), i--);\r\n\r\n // Zero?\r\n if (i < 0) {\r\n c = [e = 0];\r\n } else {\r\n\r\n // Remove leading elements which are zero and adjust exponent accordingly.\r\n for (e = -1 ; c[0] === 0; c.splice(0, 1), e -= LOG_BASE);\r\n\r\n // Count the digits of the first element of c to determine leading zeros, and...\r\n for (i = 1, v = c[0]; v >= 10; v /= 10, i++);\r\n\r\n // adjust the exponent accordingly.\r\n if (i < LOG_BASE) e -= LOG_BASE - i;\r\n }\r\n\r\n rand.e = e;\r\n rand.c = c;\r\n return rand;\r\n };\r\n })();\r\n\r\n\r\n /\r\n Return a BigNumber whose value is the sum of the arguments.\r\n \r\n arguments {number\|string\|BigNumber}\r\n /\r\n BigNumber.sum = function () {\r\n var i = 1,\r\n args = arguments,\r\n sum = new BigNumber(args[0]);\r\n for (; i < args.length;) sum = sum.plus(args[i++]);\r\n return sum;\r\n };\r\n\r\n\r\n // PRIVATE FUNCTIONS\r\n\r\n\r\n // Called by BigNumber and BigNumber.prototype.toString.\r\n convertBase = (function () {\r\n var decimal = '0123456789';\r\n\r\n /\r\n * Convert string of baseIn to an array of numbers of baseOut.\r\n * Eg. toBaseOut('255', 10, 16) returns [15, 15].\r\n * Eg. toBaseOut('ff', 16, 10) returns [2, 5, 5].\r\n /\r\n function toBaseOut(str, baseIn, baseOut, alphabet) {\r\n var j,\r\n arr = [0],\r\n arrL,\r\n i = 0,\r\n len = str.length;\r\n\r\n for (; i < len;) {\r\n for (arrL = arr.length; arrL--; arr[arrL] = baseIn);\r\n\r\n arr[0] += alphabet.indexOf(str.charAt(i++));\r\n\r\n for (j = 0; j < arr.length; j++) {\r\n\r\n if (arr[j] > baseOut - 1) {\r\n if (arr[j + 1] == null) arr[j + 1] = 0;\r\n arr[j + 1] += arr[j] / baseOut \| 0;\r\n arr[j] %= baseOut;\r\n }\r\n }\r\n }\r\n\r\n return arr.reverse();\r\n }\r\n\r\n // Convert a numeric string of baseIn to a numeric string of baseOut.\r\n // If the caller is toString, we are converting from base 10 to baseOut.\r\n // If the caller is BigNumber, we are converting from baseIn to base 10.\r\n return function (str, baseIn, baseOut, sign, callerIsToString) {\r\n var alphabet, d, e, k, r, x, xc, y,\r\n i = str.indexOf('.'),\r\n dp = DECIMAL_PLACES,\r\n rm = ROUNDING_MODE;\r\n\r\n // Non-integer.\r\n if (i >= 0) {\r\n k = POW_PRECISION;\r\n\r\n // Unlimited precision.\r\n POW_PRECISION = 0;\r\n str = str.replace('.', '');\r\n y = new BigNumber(baseIn);\r\n x = y.pow(str.length - i);\r\n POW_PRECISION = k;\r\n\r\n // Convert str as if an integer, then restore the fraction part by dividing the\r\n // result by its base raised to a power.\r\n\r\n y.c = toBaseOut(toFixedPoint(coeffToString(x.c), x.e, '0'),\r\n 10, baseOut, decimal);\r\n y.e = y.c.length;\r\n }\r\n\r\n // Convert the number as integer.\r\n\r\n xc = toBaseOut(str, baseIn, baseOut, callerIsToString\r\n ? (alphabet = ALPHABET, decimal)\r\n : (alphabet = decimal, ALPHABET));\r\n\r\n // xc now represents str as an integer and converted to baseOut. e is the exponent.\r\n e = k = xc.length;\r\n\r\n // Remove trailing zeros.\r\n for (; xc[--k] == 0; xc.pop());\r\n\r\n // Zero?\r\n if (!xc[0]) return alphabet.charAt(0);\r\n\r\n // Does str represent an integer? If so, no need for the division.\r\n if (i < 0) {\r\n --e;\r\n } else {\r\n x.c = xc;\r\n x.e = e;\r\n\r\n // The sign is needed for correct rounding.\r\n x.s = sign;\r\n x = div(x, y, dp, rm, baseOut);\r\n xc = x.c;\r\n r = x.r;\r\n e = x.e;\r\n }\r\n\r\n // xc now represents str converted to baseOut.\r\n\r\n // The index of the rounding digit.\r\n d = e + dp + 1;\r\n\r\n // The rounding digit: the digit to the right of the digit that may be rounded up.\r\n i = xc[d];\r\n\r\n // Look at the rounding digits and mode to determine whether to round up.\r\n\r\n k = baseOut / 2;\r\n r = r \|\| d < 0 \|\| xc[d + 1] != null;\r\n\r\n r = rm < 4 ? (i != null \|\| r) && (rm == 0 \|\| rm == (x.s < 0 ? 3 : 2))\r\n : i > k \|\| i == k &&(rm == 4 \|\| r \|\| rm == 6 && xc[d - 1] & 1 \|\|\r\n rm == (x.s < 0 ? 8 : 7));\r\n\r\n // If the index of the rounding digit is not greater than zero, or xc represents\r\n // zero, then the result of the base conversion is zero or, if rounding up, a value\r\n // such as 0.00001.\r\n if (d < 1 \|\| !xc[0]) {\r\n\r\n // 1^-dp or 0\r\n str = r ? toFixedPoint(alphabet.charAt(1), -dp, alphabet.charAt(0)) : alphabet.charAt(0);\r\n } else {\r\n\r\n // Truncate xc to the required number of decimal places.\r\n xc.length = d;\r\n\r\n // Round up?\r\n if (r) {\r\n\r\n // Rounding up may mean the previous digit has to be rounded up and so on.\r\n for (--baseOut; ++xc[--d] > baseOut;) {\r\n xc[d] = 0;\r\n\r\n if (!d) {\r\n ++e;\r\n xc = [1].concat(xc);\r\n }\r\n }\r\n }\r\n\r\n // Determine trailing zeros.\r\n for (k = xc.length; !xc[--k];);\r\n\r\n // E.g. [4, 11, 15] becomes 4bf.\r\n for (i = 0, str = ''; i <= k; str += alphabet.charAt(xc[i++]));\r\n\r\n // Add leading zeros, decimal point and trailing zeros as required.\r\n str = toFixedPoint(str, e, alphabet.charAt(0));\r\n }\r\n\r\n // The caller will add the sign.\r\n return str;\r\n };\r\n })();\r\n\r\n\r\n // Perform division in the specified base. Called by div and convertBase.\r\n div = (function () {\r\n\r\n // Assume non-zero x and k.\r\n function multiply(x, k, base) {\r\n var m, temp, xlo, xhi,\r\n carry = 0,\r\n i = x.length,\r\n klo = k % SQRT_BASE,\r\n khi = k / SQRT_BASE \| 0;\r\n\r\n for (x = x.slice(); i--;) {\r\n xlo = x[i] % SQRT_BASE;\r\n xhi = x[i] / SQRT_BASE \| 0;\r\n m = khi * xlo + xhi * klo;\r\n temp = klo * xlo + ((m % SQRT_BASE) * SQRT_BASE) + carry;\r\n carry = (temp / base \| 0) + (m / SQRT_BASE \| 0) + khi * xhi;\r\n x[i] = temp % base;\r\n }\r\n\r\n if (carry) x = [carry].concat(x);\r\n\r\n return x;\r\n }\r\n\r\n function compare(a, b, aL, bL) {\r\n var i, cmp;\r\n\r\n if (aL != bL) {\r\n cmp = aL > bL ? 1 : -1;\r\n } else {\r\n\r\n for (i = cmp = 0; i < aL; i++) {\r\n\r\n if (a[i] != b[i]) {\r\n cmp = a[i] > b[i] ? 1 : -1;\r\n break;\r\n }\r\n }\r\n }\r\n\r\n return cmp;\r\n }\r\n\r\n function subtract(a, b, aL, base) {\r\n var i = 0;\r\n\r\n // Subtract b from a.\r\n for (; aL--;) {\r\n a[aL] -= i;\r\n i = a[aL] < b[aL] ? 1 : 0;\r\n a[aL] = i * base + a[aL] - b[aL];\r\n }\r\n\r\n // Remove leading zeros.\r\n for (; !a[0] && a.length > 1; a.splice(0, 1));\r\n }\r\n\r\n // x: dividend, y: divisor.\r\n return function (x, y, dp, rm, base) {\r\n var cmp, e, i, more, n, prod, prodL, q, qc, rem, remL, rem0, xi, xL, yc0,\r\n yL, yz,\r\n s = x.s == y.s ? 1 : -1,\r\n xc = x.c,\r\n yc = y.c;\r\n\r\n // Either NaN, Infinity or 0?\r\n if (!xc \|\| !xc[0] \|\| !yc \|\| !yc[0]) {\r\n\r\n return new BigNumber(\r\n\r\n // Return NaN if either NaN, or both Infinity or 0.\r\n !x.s \|\| !y.s \|\| (xc ? yc && xc[0] == yc[0] : !yc) ? NaN :\r\n\r\n // Return ±0 if x is ±0 or y is ±Infinity, or return ±Infinity as y is ±0.\r\n xc && xc[0] == 0 \|\| !yc ? s * 0 : s / 0\r\n );\r\n }\r\n\r\n q = new BigNumber(s);\r\n qc = q.c = [];\r\n e = x.e - y.e;\r\n s = dp + e + 1;\r\n\r\n if (!base) {\r\n base = BASE;\r\n e = bitFloor(x.e / LOG_BASE) - bitFloor(y.e / LOG_BASE);\r\n s = s / LOG_BASE \| 0;\r\n }\r\n\r\n // Result exponent may be one less then the current value of e.\r\n // The coefficients of the BigNumbers from convertBase may have trailing zeros.\r\n for (i = 0; yc[i] == (xc[i] \|\| 0); i++);\r\n\r\n if (yc[i] > (xc[i] \|\| 0)) e--;\r\n\r\n if (s < 0) {\r\n qc.push(1);\r\n more = true;\r\n } else {\r\n xL = xc.length;\r\n yL = yc.length;\r\n i = 0;\r\n s += 2;\r\n\r\n // Normalise xc and yc so highest order digit of yc is >= base / 2.\r\n\r\n n = mathfloor(base / (yc[0] + 1));\r\n\r\n // Not necessary, but to handle odd bases where yc[0] == (base / 2) - 1.\r\n // if (n > 1 \|\| n++ == 1 && yc[0] < base / 2) {\r\n if (n > 1) {\r\n yc = multiply(yc, n, base);\r\n xc = multiply(xc, n, base);\r\n yL = yc.length;\r\n xL = xc.length;\r\n }\r\n\r\n xi = yL;\r\n rem = xc.slice(0, yL);\r\n remL = rem.length;\r\n\r\n // Add zeros to make remainder as long as divisor.\r\n for (; remL < yL; rem[remL++] = 0);\r\n yz = yc.slice();\r\n yz = [0].concat(yz);\r\n yc0 = yc[0];\r\n if (yc[1] >= base / 2) yc0++;\r\n // Not necessary, but to prevent trial digit n > base, when using base 3.\r\n // else if (base == 3 && yc0 == 1) yc0 = 1 + 1e-15;\r\n\r\n do {\r\n n = 0;\r\n\r\n // Compare divisor and remainder.\r\n cmp = compare(yc, rem, yL, remL);\r\n\r\n // If divisor < remainder.\r\n if (cmp < 0) {\r\n\r\n // Calculate trial digit, n.\r\n\r\n rem0 = rem[0];\r\n if (yL != remL) rem0 = rem0 * base + (rem[1] \|\| 0);\r\n\r\n // n is how many times the divisor goes into the current remainder.\r\n n = mathfloor(rem0 / yc0);\r\n\r\n // Algorithm:\r\n // product = divisor multiplied by trial digit (n).\r\n // Compare product and remainder.\r\n // If product is greater than remainder:\r\n // Subtract divisor from product, decrement trial digit.\r\n // Subtract product from remainder.\r\n // If product was less than remainder at the last compare:\r\n // Compare new remainder and divisor.\r\n // If remainder is greater than divisor:\r\n // Subtract divisor from remainder, increment trial digit.\r\n\r\n if (n > 1) {\r\n\r\n // n may be > base only when base is 3.\r\n if (n >= base) n = base - 1;\r\n\r\n // product = divisor * trial digit.\r\n prod = multiply(yc, n, base);\r\n prodL = prod.length;\r\n remL = rem.length;\r\n\r\n // Compare product and remainder.\r\n // If product > remainder then trial digit n too high.\r\n // n is 1 too high about 5% of the time, and is not known to have\r\n // ever been more than 1 too high.\r\n while (compare(prod, rem, prodL, remL) == 1) {\r\n n--;\r\n\r\n // Subtract divisor from product.\r\n subtract(prod, yL < prodL ? yz : yc, prodL, base);\r\n prodL = prod.length;\r\n cmp = 1;\r\n }\r\n } else {\r\n\r\n // n is 0 or 1, cmp is -1.\r\n // If n is 0, there is no need to compare yc and rem again below,\r\n // so change cmp to 1 to avoid it.\r\n // If n is 1, leave cmp as -1, so yc and rem are compared again.\r\n if (n == 0) {\r\n\r\n // divisor < remainder, so n must be at least 1.\r\n cmp = n = 1;\r\n }\r\n\r\n // product = divisor\r\n prod = yc.slice();\r\n prodL = prod.length;\r\n }\r\n\r\n if (prodL < remL) prod = [0].concat(prod);\r\n\r\n // Subtract product from remainder.\r\n subtract(rem, prod, remL, base);\r\n remL = rem.length;\r\n\r\n // If product was < remainder.\r\n if (cmp == -1) {\r\n\r\n // Compare divisor and new remainder.\r\n // If divisor < new remainder, subtract divisor from remainder.\r\n // Trial digit n too low.\r\n // n is 1 too low about 5% of the time, and very rarely 2 too low.\r\n while (compare(yc, rem, yL, remL) < 1) {\r\n n++;\r\n\r\n // Subtract divisor from remainder.\r\n subtract(rem, yL < remL ? yz : yc, remL, base);\r\n remL = rem.length;\r\n }\r\n }\r\n } else if (cmp === 0) {\r\n n++;\r\n rem = [0];\r\n } // else cmp === 1 and n will be 0\r\n\r\n // Add the next digit, n, to the result array.\r\n qc[i++] = n;\r\n\r\n // Update the remainder.\r\n if (rem[0]) {\r\n rem[remL++] = xc[xi] \|\| 0;\r\n } else {\r\n rem = [xc[xi]];\r\n remL = 1;\r\n }\r\n } while ((xi++ < xL \|\| rem[0] != null) && s--);\r\n\r\n more = rem[0] != null;\r\n\r\n // Leading zero?\r\n if (!qc[0]) qc.splice(0, 1);\r\n }\r\n\r\n if (base == BASE) {\r\n\r\n // To calculate q.e, first get the number of digits of qc[0].\r\n for (i = 1, s = qc[0]; s >= 10; s /= 10, i++);\r\n\r\n round(q, dp + (q.e = i + e * LOG_BASE - 1) + 1, rm, more);\r\n\r\n // Caller is convertBase.\r\n } else {\r\n q.e = e;\r\n q.r = +more;\r\n }\r\n\r\n return q;\r\n };\r\n })();\r\n\r\n\r\n /\r\n Return a string representing the value of BigNumber n in fixed-point or exponential\r\n * notation rounded to the specified decimal places or significant digits.\r\n \r\n n: a BigNumber.\r\n * i: the index of the last digit required (i.e. the digit that may be rounded up).\r\n * rm: the rounding mode.\r\n * id: 1 (toExponential) or 2 (toPrecision).\r\n /\r\n function format(n, i, rm, id) {\r\n var c0, e, ne, len, str;\r\n\r\n if (rm == null) rm = ROUNDING_MODE;\r\n else intCheck(rm, 0, 8);\r\n\r\n if (!n.c) return n.toString();\r\n\r\n c0 = n.c[0];\r\n ne = n.e;\r\n\r\n if (i == null) {\r\n str = coeffToString(n.c);\r\n str = id == 1 \|\| id == 2 && (ne <= TO_EXP_NEG \|\| ne >= TO_EXP_POS)\r\n ? toExponential(str, ne)\r\n : toFixedPoint(str, ne, '0');\r\n } else {\r\n n = round(new BigNumber(n), i, rm);\r\n\r\n // n.e may have changed if the value was rounded up.\r\n e = n.e;\r\n\r\n str = coeffToString(n.c);\r\n len = str.length;\r\n\r\n // toPrecision returns exponential notation if the number of significant digits\r\n // specified is less than the number of digits necessary to represent the integer\r\n // part of the value in fixed-point notation.\r\n\r\n // Exponential notation.\r\n if (id == 1 \|\| id == 2 && (i <= e \|\| e <= TO_EXP_NEG)) {\r\n\r\n // Append zeros?\r\n for (; len < i; str += '0', len++);\r\n str = toExponential(str, e);\r\n\r\n // Fixed-point notation.\r\n } else {\r\n i -= ne + (id === 2 && e > ne);\r\n str = toFixedPoint(str, e, '0');\r\n\r\n // Append zeros?\r\n if (e + 1 > len) {\r\n if (--i > 0) for (str += '.'; i--; str += '0');\r\n } else {\r\n i += e - len;\r\n if (i > 0) {\r\n if (e + 1 == len) str += '.';\r\n for (; i--; str += '0');\r\n }\r\n }\r\n }\r\n }\r\n\r\n return n.s < 0 && c0 ? '-' + str : str;\r\n }\r\n\r\n\r\n // Handle BigNumber.max and BigNumber.min.\r\n // If any number is NaN, return NaN.\r\n function maxOrMin(args, n) {\r\n var k, y,\r\n i = 1,\r\n x = new BigNumber(args[0]);\r\n\r\n for (; i < args.length; i++) {\r\n y = new BigNumber(args[i]);\r\n if (!y.s \|\| (k = compare(x, y)) === n \|\| k === 0 && x.s === n) {\r\n x = y;\r\n }\r\n }\r\n\r\n return x;\r\n }\r\n\r\n\r\n /\r\n * Strip trailing zeros, calculate base 10 exponent and check against MIN_EXP and MAX_EXP.\r\n * Called by minus, plus and times.\r\n /\r\n function normalise(n, c, e) {\r\n var i = 1,\r\n j = c.length;\r\n\r\n // Remove trailing zeros.\r\n for (; !c[--j]; c.pop());\r\n\r\n // Calculate the base 10 exponent. First get the number of digits of c[0].\r\n for (j = c[0]; j >= 10; j /= 10, i++);\r\n\r\n // Overflow?\r\n if ((e = i + e LOG_BASE - 1) > MAX_EXP) {\r\n\r\n // Infinity.\r\n n.c = n.e = null;\r\n\r\n // Underflow?\r\n } else if (e < MIN_EXP) {\r\n\r\n // Zero.\r\n n.c = [n.e = 0];\r\n } else {\r\n n.e = e;\r\n n.c = c;\r\n }\r\n\r\n return n;\r\n }\r\n\r\n\r\n // Handle values that fail the validity test in BigNumber.\r\n parseNumeric = (function () {\r\n var basePrefix = /^(-?)0([xbo])(?=\\w[\\w.]$)/i,\r\n dotAfter = /^([^.]+)\\.$/,\r\n dotBefore = /^\\.([^.]+)$/,\r\n isInfinityOrNaN = /^-?(Infinity\|NaN)$/,\r\n whitespaceOrPlus = /^\\s\\+(?=[\\w.])\|^\\s+\|\\s+$/g;\r\n\r\n return function (x, str, isNum, b) {\r\n var base,\r\n s = isNum ? str : str.replace(whitespaceOrPlus, '');\r\n\r\n // No exception on ±Infinity or NaN.\r\n if (isInfinityOrNaN.test(s)) {\r\n x.s = isNaN(s) ? null : s < 0 ? -1 : 1;\r\n } else {\r\n if (!isNum) {\r\n\r\n // basePrefix = /^(-?)0([xbo])(?=\\w[\\w.]$)/i\r\n s = s.replace(basePrefix, function (m, p1, p2) {\r\n base = (p2 = p2.toLowerCase()) == 'x' ? 16 : p2 == 'b' ? 2 : 8;\r\n return !b \|\| b == base ? p1 : m;\r\n });\r\n\r\n if (b) {\r\n base = b;\r\n\r\n // E.g. '1.' to '1', '.1' to '0.1'\r\n s = s.replace(dotAfter, '$1').replace(dotBefore, '0.$1');\r\n }\r\n\r\n if (str != s) return new BigNumber(s, base);\r\n }\r\n\r\n // '[BigNumber Error] Not a number: {n}'\r\n // '[BigNumber Error] Not a base {b} number: {n}'\r\n if (BigNumber.DEBUG) {\r\n throw Error\r\n (bignumberError + 'Not a' + (b ? ' base ' + b : '') + ' number: ' + str);\r\n }\r\n\r\n // NaN\r\n x.s = null;\r\n }\r\n\r\n x.c = x.e = null;\r\n }\r\n })();\r\n\r\n\r\n /\r\n * Round x to sd significant digits using rounding mode rm. Check for over/under-flow.\r\n * If r is truthy, it is known that there are more digits after the rounding digit.\r\n /\r\n function round(x, sd, rm, r) {\r\n var d, i, j, k, n, ni, rd,\r\n xc = x.c,\r\n pows10 = POWS_TEN;\r\n\r\n // if x is not Infinity or NaN...\r\n if (xc) {\r\n\r\n // rd is the rounding digit, i.e. the digit after the digit that may be rounded up.\r\n // n is a base 1e14 number, the value of the element of array x.c containing rd.\r\n // ni is the index of n within x.c.\r\n // d is the number of digits of n.\r\n // i is the index of rd within n including leading zeros.\r\n // j is the actual index of rd within n (if < 0, rd is a leading zero).\r\n out: {\r\n\r\n // Get the number of digits of the first element of xc.\r\n for (d = 1, k = xc[0]; k >= 10; k /= 10, d++);\r\n i = sd - d;\r\n\r\n // If the rounding digit is in the first element of xc...\r\n if (i < 0) {\r\n i += LOG_BASE;\r\n j = sd;\r\n n = xc[ni = 0];\r\n\r\n // Get the rounding digit at index j of n.\r\n rd = mathfloor(n / pows10[d - j - 1] % 10);\r\n } else {\r\n ni = mathceil((i + 1) / LOG_BASE);\r\n\r\n if (ni >= xc.length) {\r\n\r\n if (r) {\r\n\r\n // Needed by sqrt.\r\n for (; xc.length <= ni; xc.push(0));\r\n n = rd = 0;\r\n d = 1;\r\n i %= LOG_BASE;\r\n j = i - LOG_BASE + 1;\r\n } else {\r\n break out;\r\n }\r\n } else {\r\n n = k = xc[ni];\r\n\r\n // Get the number of digits of n.\r\n for (d = 1; k >= 10; k /= 10, d++);\r\n\r\n // Get the index of rd within n.\r\n i %= LOG_BASE;\r\n\r\n // Get the index of rd within n, adjusted for leading zeros.\r\n // The number of leading zeros of n is given by LOG_BASE - d.\r\n j = i - LOG_BASE + d;\r\n\r\n // Get the rounding digit at index j of n.\r\n rd = j < 0 ? 0 : mathfloor(n / pows10[d - j - 1] % 10);\r\n }\r\n }\r\n\r\n r = r \|\| sd < 0 \|\|\r\n\r\n // Are there any non-zero digits after the rounding digit?\r\n // The expression n % pows10[d - j - 1] returns all digits of n to the right\r\n // of the digit at j, e.g. if n is 908714 and j is 2, the expression gives 714.\r\n xc[ni + 1] != null \|\| (j < 0 ? n : n % pows10[d - j - 1]);\r\n\r\n r = rm < 4\r\n ? (rd \|\| r) && (rm == 0 \|\| rm == (x.s < 0 ? 3 : 2))\r\n : rd > 5 \|\| rd == 5 && (rm == 4 \|\| r \|\| rm == 6 &&\r\n\r\n // Check whether the digit to the left of the rounding digit is odd.\r\n ((i > 0 ? j > 0 ? n / pows10[d - j] : 0 : xc[ni - 1]) % 10) & 1 \|\|\r\n rm == (x.s < 0 ? 8 : 7));\r\n\r\n if (sd < 1 \|\| !xc[0]) {\r\n xc.length = 0;\r\n\r\n if (r) {\r\n\r\n // Convert sd to decimal places.\r\n sd -= x.e + 1;\r\n\r\n // 1, 0.1, 0.01, 0.001, 0.0001 etc.\r\n xc[0] = pows10[(LOG_BASE - sd % LOG_BASE) % LOG_BASE];\r\n x.e = -sd \|\| 0;\r\n } else {\r\n\r\n // Zero.\r\n xc[0] = x.e = 0;\r\n }\r\n\r\n return x;\r\n }\r\n\r\n // Remove excess digits.\r\n if (i == 0) {\r\n xc.length = ni;\r\n k = 1;\r\n ni--;\r\n } else {\r\n xc.length = ni + 1;\r\n k = pows10[LOG_BASE - i];\r\n\r\n // E.g. 56700 becomes 56000 if 7 is the rounding digit.\r\n // j > 0 means i > number of leading zeros of n.\r\n xc[ni] = j > 0 ? mathfloor(n / pows10[d - j] % pows10[j]) k : 0;\r\n }\r\n\r\n // Round up?\r\n if (r) {\r\n\r\n for (; ;) {\r\n\r\n // If the digit to be rounded up is in the first element of xc...\r\n if (ni == 0) {\r\n\r\n // i will be the length of xc[0] before k is added.\r\n for (i = 1, j = xc[0]; j >= 10; j /= 10, i++);\r\n j = xc[0] += k;\r\n for (k = 1; j >= 10; j /= 10, k++);\r\n\r\n // if i != k the length has increased.\r\n if (i != k) {\r\n x.e++;\r\n if (xc[0] == BASE) xc[0] = 1;\r\n }\r\n\r\n break;\r\n } else {\r\n xc[ni] += k;\r\n if (xc[ni] != BASE) break;\r\n xc[ni--] = 0;\r\n k = 1;\r\n }\r\n }\r\n }\r\n\r\n // Remove trailing zeros.\r\n for (i = xc.length; xc[--i] === 0; xc.pop());\r\n }\r\n\r\n // Overflow? Infinity.\r\n if (x.e > MAX_EXP) {\r\n x.c = x.e = null;\r\n\r\n // Underflow? Zero.\r\n } else if (x.e < MIN_EXP) {\r\n x.c = [x.e = 0];\r\n }\r\n }\r\n\r\n return x;\r\n }\r\n\r\n\r\n function valueOf(n) {\r\n var str,\r\n e = n.e;\r\n\r\n if (e === null) return n.toString();\r\n\r\n str = coeffToString(n.c);\r\n\r\n str = e <= TO_EXP_NEG \|\| e >= TO_EXP_POS\r\n ? toExponential(str, e)\r\n : toFixedPoint(str, e, '0');\r\n\r\n return n.s < 0 ? '-' + str : str;\r\n }\r\n\r\n\r\n // PROTOTYPE/INSTANCE METHODS\r\n\r\n\r\n /\r\n Return a new BigNumber whose value is the absolute value of this BigNumber.\r\n /\r\n P.absoluteValue = P.abs = function () {\r\n var x = new BigNumber(this);\r\n if (x.s < 0) x.s = 1;\r\n return x;\r\n };\r\n\r\n\r\n /\r\n * Return\r\n * 1 if the value of this BigNumber is greater than the value of BigNumber(y, b),\r\n * -1 if the value of this BigNumber is less than the value of BigNumber(y, b),\r\n * 0 if they have the same value,\r\n * or null if the value of either is NaN.\r\n /\r\n P.comparedTo = function (y, b) {\r\n return compare(this, new BigNumber(y, b));\r\n };\r\n\r\n\r\n /\r\n * If dp is undefined or null or true or false, return the number of decimal places of the\r\n * value of this BigNumber, or null if the value of this BigNumber is ±Infinity or NaN.\r\n \r\n Otherwise, if dp is a number, return a new BigNumber whose value is the value of this\r\n * BigNumber rounded to a maximum of dp decimal places using rounding mode rm, or\r\n * ROUNDING_MODE if rm is omitted.\r\n \r\n [dp] {number} Decimal places: integer, 0 to MAX inclusive.\r\n * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n \r\n '[BigNumber Error] Argument {not a primitive number\|not an integer\|out of range}: {dp\|rm}'\r\n /\r\n P.decimalPlaces = P.dp = function (dp, rm) {\r\n var c, n, v,\r\n x = this;\r\n\r\n if (dp != null) {\r\n intCheck(dp, 0, MAX);\r\n if (rm == null) rm = ROUNDING_MODE;\r\n else intCheck(rm, 0, 8);\r\n\r\n return round(new BigNumber(x), dp + x.e + 1, rm);\r\n }\r\n\r\n if (!(c = x.c)) return null;\r\n n = ((v = c.length - 1) - bitFloor(this.e / LOG_BASE)) LOG_BASE;\r\n\r\n // Subtract the number of trailing zeros of the last number.\r\n if (v = c[v]) for (; v % 10 == 0; v /= 10, n--);\r\n if (n < 0) n = 0;\r\n\r\n return n;\r\n };\r\n\r\n\r\n /\r\n n / 0 = I\r\n * n / N = N\r\n * n / I = 0\r\n * 0 / n = 0\r\n * 0 / 0 = N\r\n * 0 / N = N\r\n * 0 / I = 0\r\n * N / n = N\r\n * N / 0 = N\r\n * N / N = N\r\n * N / I = N\r\n * I / n = I\r\n * I / 0 = I\r\n * I / N = N\r\n * I / I = N\r\n \r\n Return a new BigNumber whose value is the value of this BigNumber divided by the value of\r\n * BigNumber(y, b), rounded according to DECIMAL_PLACES and ROUNDING_MODE.\r\n /\r\n P.dividedBy = P.div = function (y, b) {\r\n return div(this, new BigNumber(y, b), DECIMAL_PLACES, ROUNDING_MODE);\r\n };\r\n\r\n\r\n /\r\n * Return a new BigNumber whose value is the integer part of dividing the value of this\r\n * BigNumber by the value of BigNumber(y, b).\r\n /\r\n P.dividedToIntegerBy = P.idiv = function (y, b) {\r\n return div(this, new BigNumber(y, b), 0, 1);\r\n };\r\n\r\n\r\n /\r\n * Return a BigNumber whose value is the value of this BigNumber exponentiated by n.\r\n \r\n If m is present, return the result modulo m.\r\n * If n is negative round according to DECIMAL_PLACES and ROUNDING_MODE.\r\n * If POW_PRECISION is non-zero and m is not present, round to POW_PRECISION using ROUNDING_MODE.\r\n \r\n The modular power operation works efficiently when x, n, and m are integers, otherwise it\r\n * is equivalent to calculating x.exponentiatedBy(n).modulo(m) with a POW_PRECISION of 0.\r\n \r\n n {number\|string\|BigNumber} The exponent. An integer.\r\n * [m] {number\|string\|BigNumber} The modulus.\r\n \r\n '[BigNumber Error] Exponent not an integer: {n}'\r\n /\r\n P.exponentiatedBy = P.pow = function (n, m) {\r\n var half, isModExp, i, k, more, nIsBig, nIsNeg, nIsOdd, y,\r\n x = this;\r\n\r\n n = new BigNumber(n);\r\n\r\n // Allow NaN and ±Infinity, but not other non-integers.\r\n if (n.c && !n.isInteger()) {\r\n throw Error\r\n (bignumberError + 'Exponent not an integer: ' + valueOf(n));\r\n }\r\n\r\n if (m != null) m = new BigNumber(m);\r\n\r\n // Exponent of MAX_SAFE_INTEGER is 15.\r\n nIsBig = n.e > 14;\r\n\r\n // If x is NaN, ±Infinity, ±0 or ±1, or n is ±Infinity, NaN or ±0.\r\n if (!x.c \|\| !x.c[0] \|\| x.c[0] == 1 && !x.e && x.c.length == 1 \|\| !n.c \|\| !n.c[0]) {\r\n\r\n // The sign of the result of pow when x is negative depends on the evenness of n.\r\n // If +n overflows to ±Infinity, the evenness of n would be not be known.\r\n y = new BigNumber(Math.pow(+valueOf(x), nIsBig ? n.s (2 - isOdd(n)) : +valueOf(n)));\r\n return m ? y.mod(m) : y;\r\n }\r\n\r\n nIsNeg = n.s < 0;\r\n\r\n if (m) {\r\n\r\n // x % m returns NaN if abs(m) is zero, or m is NaN.\r\n if (m.c ? !m.c[0] : !m.s) return new BigNumber(NaN);\r\n\r\n isModExp = !nIsNeg && x.isInteger() && m.isInteger();\r\n\r\n if (isModExp) x = x.mod(m);\r\n\r\n // Overflow to ±Infinity: >=21e10 or >=1.00000241e15.\r\n // Underflow to ±0: <=0.791e10 or <=0.99999751e15.\r\n } else if (n.e > 9 && (x.e > 0 \|\| x.e < -1 \|\| (x.e == 0\r\n // [1, 240000000]\r\n ? x.c[0] > 1 \|\| nIsBig && x.c[1] >= 24e7\r\n // [80000000000000] [99999750000000]\r\n : x.c[0] < 8e13 \|\| nIsBig && x.c[0] <= 9999975e7))) {\r\n\r\n // If x is negative and n is odd, k = -0, else k = 0.\r\n k = x.s < 0 && isOdd(n) ? -0 : 0;\r\n\r\n // If x >= 1, k = ±Infinity.\r\n if (x.e > -1) k = 1 / k;\r\n\r\n // If n is negative return ±0, else return ±Infinity.\r\n return new BigNumber(nIsNeg ? 1 / k : k);\r\n\r\n } else if (POW_PRECISION) {\r\n\r\n // Truncating each coefficient array to a length of k after each multiplication\r\n // equates to truncating significant digits to POW_PRECISION + [28, 41],\r\n // i.e. there will be a minimum of 28 guard digits retained.\r\n k = mathceil(POW_PRECISION / LOG_BASE + 2);\r\n }\r\n\r\n if (nIsBig) {\r\n half = new BigNumber(0.5);\r\n if (nIsNeg) n.s = 1;\r\n nIsOdd = isOdd(n);\r\n } else {\r\n i = Math.abs(+valueOf(n));\r\n nIsOdd = i % 2;\r\n }\r\n\r\n y = new BigNumber(ONE);\r\n\r\n // Performs 54 loop iterations for n of 9007199254740991.\r\n for (; ;) {\r\n\r\n if (nIsOdd) {\r\n y = y.times(x);\r\n if (!y.c) break;\r\n\r\n if (k) {\r\n if (y.c.length > k) y.c.length = k;\r\n } else if (isModExp) {\r\n y = y.mod(m); //y = y.minus(div(y, m, 0, MODULO_MODE).times(m));\r\n }\r\n }\r\n\r\n if (i) {\r\n i = mathfloor(i / 2);\r\n if (i === 0) break;\r\n nIsOdd = i % 2;\r\n } else {\r\n n = n.times(half);\r\n round(n, n.e + 1, 1);\r\n\r\n if (n.e > 14) {\r\n nIsOdd = isOdd(n);\r\n } else {\r\n i = +valueOf(n);\r\n if (i === 0) break;\r\n nIsOdd = i % 2;\r\n }\r\n }\r\n\r\n x = x.times(x);\r\n\r\n if (k) {\r\n if (x.c && x.c.length > k) x.c.length = k;\r\n } else if (isModExp) {\r\n x = x.mod(m); //x = x.minus(div(x, m, 0, MODULO_MODE).times(m));\r\n }\r\n }\r\n\r\n if (isModExp) return y;\r\n if (nIsNeg) y = ONE.div(y);\r\n\r\n return m ? y.mod(m) : k ? round(y, POW_PRECISION, ROUNDING_MODE, more) : y;\r\n };\r\n\r\n\r\n /\r\n Return a new BigNumber whose value is the value of this BigNumber rounded to an integer\r\n * using rounding mode rm, or ROUNDING_MODE if rm is omitted.\r\n \r\n [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n \r\n '[BigNumber Error] Argument {not a primitive number\|not an integer\|out of range}: {rm}'\r\n /\r\n P.integerValue = function (rm) {\r\n var n = new BigNumber(this);\r\n if (rm == null) rm = ROUNDING_MODE;\r\n else intCheck(rm, 0, 8);\r\n return round(n, n.e + 1, rm);\r\n };\r\n\r\n\r\n /\r\n * Return true if the value of this BigNumber is equal to the value of BigNumber(y, b),\r\n * otherwise return false.\r\n /\r\n P.isEqualTo = P.eq = function (y, b) {\r\n return compare(this, new BigNumber(y, b)) === 0;\r\n };\r\n\r\n\r\n /\r\n * Return true if the value of this BigNumber is a finite number, otherwise return false.\r\n /\r\n P.isFinite = function () {\r\n return !!this.c;\r\n };\r\n\r\n\r\n /\r\n * Return true if the value of this BigNumber is greater than the value of BigNumber(y, b),\r\n * otherwise return false.\r\n /\r\n P.isGreaterThan = P.gt = function (y, b) {\r\n return compare(this, new BigNumber(y, b)) > 0;\r\n };\r\n\r\n\r\n /\r\n * Return true if the value of this BigNumber is greater than or equal to the value of\r\n * BigNumber(y, b), otherwise return false.\r\n /\r\n P.isGreaterThanOrEqualTo = P.gte = function (y, b) {\r\n return (b = compare(this, new BigNumber(y, b))) === 1 \|\| b === 0;\r\n\r\n };\r\n\r\n\r\n /\r\n * Return true if the value of this BigNumber is an integer, otherwise return false.\r\n /\r\n P.isInteger = function () {\r\n return !!this.c && bitFloor(this.e / LOG_BASE) > this.c.length - 2;\r\n };\r\n\r\n\r\n /\r\n * Return true if the value of this BigNumber is less than the value of BigNumber(y, b),\r\n * otherwise return false.\r\n /\r\n P.isLessThan = P.lt = function (y, b) {\r\n return compare(this, new BigNumber(y, b)) < 0;\r\n };\r\n\r\n\r\n /\r\n * Return true if the value of this BigNumber is less than or equal to the value of\r\n * BigNumber(y, b), otherwise return false.\r\n /\r\n P.isLessThanOrEqualTo = P.lte = function (y, b) {\r\n return (b = compare(this, new BigNumber(y, b))) === -1 \|\| b === 0;\r\n };\r\n\r\n\r\n /\r\n * Return true if the value of this BigNumber is NaN, otherwise return false.\r\n /\r\n P.isNaN = function () {\r\n return !this.s;\r\n };\r\n\r\n\r\n /\r\n * Return true if the value of this BigNumber is negative, otherwise return false.\r\n /\r\n P.isNegative = function () {\r\n return this.s < 0;\r\n };\r\n\r\n\r\n /\r\n * Return true if the value of this BigNumber is positive, otherwise return false.\r\n /\r\n P.isPositive = function () {\r\n return this.s > 0;\r\n };\r\n\r\n\r\n /\r\n * Return true if the value of this BigNumber is 0 or -0, otherwise return false.\r\n /\r\n P.isZero = function () {\r\n return !!this.c && this.c[0] == 0;\r\n };\r\n\r\n\r\n /\r\n * n - 0 = n\r\n * n - N = N\r\n * n - I = -I\r\n * 0 - n = -n\r\n * 0 - 0 = 0\r\n * 0 - N = N\r\n * 0 - I = -I\r\n * N - n = N\r\n * N - 0 = N\r\n * N - N = N\r\n * N - I = N\r\n * I - n = I\r\n * I - 0 = I\r\n * I - N = N\r\n * I - I = N\r\n \r\n Return a new BigNumber whose value is the value of this BigNumber minus the value of\r\n * BigNumber(y, b).\r\n /\r\n P.minus = function (y, b) {\r\n var i, j, t, xLTy,\r\n x = this,\r\n a = x.s;\r\n\r\n y = new BigNumber(y, b);\r\n b = y.s;\r\n\r\n // Either NaN?\r\n if (!a \|\| !b) return new BigNumber(NaN);\r\n\r\n // Signs differ?\r\n if (a != b) {\r\n y.s = -b;\r\n return x.plus(y);\r\n }\r\n\r\n var xe = x.e / LOG_BASE,\r\n ye = y.e / LOG_BASE,\r\n xc = x.c,\r\n yc = y.c;\r\n\r\n if (!xe \|\| !ye) {\r\n\r\n // Either Infinity?\r\n if (!xc \|\| !yc) return xc ? (y.s = -b, y) : new BigNumber(yc ? x : NaN);\r\n\r\n // Either zero?\r\n if (!xc[0] \|\| !yc[0]) {\r\n\r\n // Return y if y is non-zero, x if x is non-zero, or zero if both are zero.\r\n return yc[0] ? (y.s = -b, y) : new BigNumber(xc[0] ? x :\r\n\r\n // IEEE 754 (2008) 6.3: n - n = -0 when rounding to -Infinity\r\n ROUNDING_MODE == 3 ? -0 : 0);\r\n }\r\n }\r\n\r\n xe = bitFloor(xe);\r\n ye = bitFloor(ye);\r\n xc = xc.slice();\r\n\r\n // Determine which is the bigger number.\r\n if (a = xe - ye) {\r\n\r\n if (xLTy = a < 0) {\r\n a = -a;\r\n t = xc;\r\n } else {\r\n ye = xe;\r\n t = yc;\r\n }\r\n\r\n t.reverse();\r\n\r\n // Prepend zeros to equalise exponents.\r\n for (b = a; b--; t.push(0));\r\n t.reverse();\r\n } else {\r\n\r\n // Exponents equal. Check digit by digit.\r\n j = (xLTy = (a = xc.length) < (b = yc.length)) ? a : b;\r\n\r\n for (a = b = 0; b < j; b++) {\r\n\r\n if (xc[b] != yc[b]) {\r\n xLTy = xc[b] < yc[b];\r\n break;\r\n }\r\n }\r\n }\r\n\r\n // x < y? Point xc to the array of the bigger number.\r\n if (xLTy) {\r\n t = xc;\r\n xc = yc;\r\n yc = t;\r\n y.s = -y.s;\r\n }\r\n\r\n b = (j = yc.length) - (i = xc.length);\r\n\r\n // Append zeros to xc if shorter.\r\n // No need to add zeros to yc if shorter as subtract only needs to start at yc.length.\r\n if (b > 0) for (; b--; xc[i++] = 0);\r\n b = BASE - 1;\r\n\r\n // Subtract yc from xc.\r\n for (; j > a;) {\r\n\r\n if (xc[--j] < yc[j]) {\r\n for (i = j; i && !xc[--i]; xc[i] = b);\r\n --xc[i];\r\n xc[j] += BASE;\r\n }\r\n\r\n xc[j] -= yc[j];\r\n }\r\n\r\n // Remove leading zeros and adjust exponent accordingly.\r\n for (; xc[0] == 0; xc.splice(0, 1), --ye);\r\n\r\n // Zero?\r\n if (!xc[0]) {\r\n\r\n // Following IEEE 754 (2008) 6.3,\r\n // n - n = +0 but n - n = -0 when rounding towards -Infinity.\r\n y.s = ROUNDING_MODE == 3 ? -1 : 1;\r\n y.c = [y.e = 0];\r\n return y;\r\n }\r\n\r\n // No need to check for Infinity as +x - +y != Infinity && -x - -y != Infinity\r\n // for finite x and y.\r\n return normalise(y, xc, ye);\r\n };\r\n\r\n\r\n /\r\n * n % 0 = N\r\n * n % N = N\r\n * n % I = n\r\n * 0 % n = 0\r\n * -0 % n = -0\r\n * 0 % 0 = N\r\n * 0 % N = N\r\n * 0 % I = 0\r\n * N % n = N\r\n * N % 0 = N\r\n * N % N = N\r\n * N % I = N\r\n * I % n = N\r\n * I % 0 = N\r\n * I % N = N\r\n * I % I = N\r\n \r\n Return a new BigNumber whose value is the value of this BigNumber modulo the value of\r\n * BigNumber(y, b). The result depends on the value of MODULO_MODE.\r\n /\r\n P.modulo = P.mod = function (y, b) {\r\n var q, s,\r\n x = this;\r\n\r\n y = new BigNumber(y, b);\r\n\r\n // Return NaN if x is Infinity or NaN, or y is NaN or zero.\r\n if (!x.c \|\| !y.s \|\| y.c && !y.c[0]) {\r\n return new BigNumber(NaN);\r\n\r\n // Return x if y is Infinity or x is zero.\r\n } else if (!y.c \|\| x.c && !x.c[0]) {\r\n return new BigNumber(x);\r\n }\r\n\r\n if (MODULO_MODE == 9) {\r\n\r\n // Euclidian division: q = sign(y) floor(x / abs(y))\r\n // r = x - qy where 0 <= r < abs(y)\r\n s = y.s;\r\n y.s = 1;\r\n q = div(x, y, 0, 3);\r\n y.s = s;\r\n q.s = s;\r\n } else {\r\n q = div(x, y, 0, MODULO_MODE);\r\n }\r\n\r\n y = x.minus(q.times(y));\r\n\r\n // To match JavaScript %, ensure sign of zero is sign of dividend.\r\n if (!y.c[0] && MODULO_MODE == 1) y.s = x.s;\r\n\r\n return y;\r\n };\r\n\r\n\r\n /\r\n * n * 0 = 0\r\n * n * N = N\r\n * n * I = I\r\n * 0 * n = 0\r\n * 0 * 0 = 0\r\n * 0 * N = N\r\n * 0 * I = N\r\n * N * n = N\r\n * N * 0 = N\r\n * N * N = N\r\n * N * I = N\r\n * I * n = I\r\n * I * 0 = N\r\n * I * N = N\r\n * I * I = I\r\n \r\n Return a new BigNumber whose value is the value of this BigNumber multiplied by the value\r\n * of BigNumber(y, b).\r\n /\r\n P.multipliedBy = P.times = function (y, b) {\r\n var c, e, i, j, k, m, xcL, xlo, xhi, ycL, ylo, yhi, zc,\r\n base, sqrtBase,\r\n x = this,\r\n xc = x.c,\r\n yc = (y = new BigNumber(y, b)).c;\r\n\r\n // Either NaN, ±Infinity or ±0?\r\n if (!xc \|\| !yc \|\| !xc[0] \|\| !yc[0]) {\r\n\r\n // Return NaN if either is NaN, or one is 0 and the other is Infinity.\r\n if (!x.s \|\| !y.s \|\| xc && !xc[0] && !yc \|\| yc && !yc[0] && !xc) {\r\n y.c = y.e = y.s = null;\r\n } else {\r\n y.s = x.s;\r\n\r\n // Return ±Infinity if either is ±Infinity.\r\n if (!xc \|\| !yc) {\r\n y.c = y.e = null;\r\n\r\n // Return ±0 if either is ±0.\r\n } else {\r\n y.c = [0];\r\n y.e = 0;\r\n }\r\n }\r\n\r\n return y;\r\n }\r\n\r\n e = bitFloor(x.e / LOG_BASE) + bitFloor(y.e / LOG_BASE);\r\n y.s = x.s;\r\n xcL = xc.length;\r\n ycL = yc.length;\r\n\r\n // Ensure xc points to longer array and xcL to its length.\r\n if (xcL < ycL) {\r\n zc = xc;\r\n xc = yc;\r\n yc = zc;\r\n i = xcL;\r\n xcL = ycL;\r\n ycL = i;\r\n }\r\n\r\n // Initialise the result array with zeros.\r\n for (i = xcL + ycL, zc = []; i--; zc.push(0));\r\n\r\n base = BASE;\r\n sqrtBase = SQRT_BASE;\r\n\r\n for (i = ycL; --i >= 0;) {\r\n c = 0;\r\n ylo = yc[i] % sqrtBase;\r\n yhi = yc[i] / sqrtBase \| 0;\r\n\r\n for (k = xcL, j = i + k; j > i;) {\r\n xlo = xc[--k] % sqrtBase;\r\n xhi = xc[k] / sqrtBase \| 0;\r\n m = yhi xlo + xhi * ylo;\r\n xlo = ylo * xlo + ((m % sqrtBase) * sqrtBase) + zc[j] + c;\r\n c = (xlo / base \| 0) + (m / sqrtBase \| 0) + yhi * xhi;\r\n zc[j--] = xlo % base;\r\n }\r\n\r\n zc[j] = c;\r\n }\r\n\r\n if (c) {\r\n ++e;\r\n } else {\r\n zc.splice(0, 1);\r\n }\r\n\r\n return normalise(y, zc, e);\r\n };\r\n\r\n\r\n /\r\n Return a new BigNumber whose value is the value of this BigNumber negated,\r\n * i.e. multiplied by -1.\r\n /\r\n P.negated = function () {\r\n var x = new BigNumber(this);\r\n x.s = -x.s \|\| null;\r\n return x;\r\n };\r\n\r\n\r\n /\r\n * n + 0 = n\r\n * n + N = N\r\n * n + I = I\r\n * 0 + n = n\r\n * 0 + 0 = 0\r\n * 0 + N = N\r\n * 0 + I = I\r\n * N + n = N\r\n * N + 0 = N\r\n * N + N = N\r\n * N + I = N\r\n * I + n = I\r\n * I + 0 = I\r\n * I + N = N\r\n * I + I = I\r\n \r\n Return a new BigNumber whose value is the value of this BigNumber plus the value of\r\n * BigNumber(y, b).\r\n /\r\n P.plus = function (y, b) {\r\n var t,\r\n x = this,\r\n a = x.s;\r\n\r\n y = new BigNumber(y, b);\r\n b = y.s;\r\n\r\n // Either NaN?\r\n if (!a \|\| !b) return new BigNumber(NaN);\r\n\r\n // Signs differ?\r\n if (a != b) {\r\n y.s = -b;\r\n return x.minus(y);\r\n }\r\n\r\n var xe = x.e / LOG_BASE,\r\n ye = y.e / LOG_BASE,\r\n xc = x.c,\r\n yc = y.c;\r\n\r\n if (!xe \|\| !ye) {\r\n\r\n // Return ±Infinity if either ±Infinity.\r\n if (!xc \|\| !yc) return new BigNumber(a / 0);\r\n\r\n // Either zero?\r\n // Return y if y is non-zero, x if x is non-zero, or zero if both are zero.\r\n if (!xc[0] \|\| !yc[0]) return yc[0] ? y : new BigNumber(xc[0] ? x : a 0);\r\n }\r\n\r\n xe = bitFloor(xe);\r\n ye = bitFloor(ye);\r\n xc = xc.slice();\r\n\r\n // Prepend zeros to equalise exponents. Faster to use reverse then do unshifts.\r\n if (a = xe - ye) {\r\n if (a > 0) {\r\n ye = xe;\r\n t = yc;\r\n } else {\r\n a = -a;\r\n t = xc;\r\n }\r\n\r\n t.reverse();\r\n for (; a--; t.push(0));\r\n t.reverse();\r\n }\r\n\r\n a = xc.length;\r\n b = yc.length;\r\n\r\n // Point xc to the longer array, and b to the shorter length.\r\n if (a - b < 0) {\r\n t = yc;\r\n yc = xc;\r\n xc = t;\r\n b = a;\r\n }\r\n\r\n // Only start adding at yc.length - 1 as the further digits of xc can be ignored.\r\n for (a = 0; b;) {\r\n a = (xc[--b] = xc[b] + yc[b] + a) / BASE \| 0;\r\n xc[b] = BASE === xc[b] ? 0 : xc[b] % BASE;\r\n }\r\n\r\n if (a) {\r\n xc = [a].concat(xc);\r\n ++ye;\r\n }\r\n\r\n // No need to check for zero, as +x + +y != 0 && -x + -y != 0\r\n // ye = MAX_EXP + 1 possible\r\n return normalise(y, xc, ye);\r\n };\r\n\r\n\r\n /\r\n If sd is undefined or null or true or false, return the number of significant digits of\r\n * the value of this BigNumber, or null if the value of this BigNumber is ±Infinity or NaN.\r\n * If sd is true include integer-part trailing zeros in the count.\r\n \r\n Otherwise, if sd is a number, return a new BigNumber whose value is the value of this\r\n * BigNumber rounded to a maximum of sd significant digits using rounding mode rm, or\r\n * ROUNDING_MODE if rm is omitted.\r\n \r\n sd {number\|boolean} number: significant digits: integer, 1 to MAX inclusive.\r\n * boolean: whether to count integer-part trailing zeros: true or false.\r\n * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n \r\n '[BigNumber Error] Argument {not a primitive number\|not an integer\|out of range}: {sd\|rm}'\r\n /\r\n P.precision = P.sd = function (sd, rm) {\r\n var c, n, v,\r\n x = this;\r\n\r\n if (sd != null && sd !== !!sd) {\r\n intCheck(sd, 1, MAX);\r\n if (rm == null) rm = ROUNDING_MODE;\r\n else intCheck(rm, 0, 8);\r\n\r\n return round(new BigNumber(x), sd, rm);\r\n }\r\n\r\n if (!(c = x.c)) return null;\r\n v = c.length - 1;\r\n n = v LOG_BASE + 1;\r\n\r\n if (v = c[v]) {\r\n\r\n // Subtract the number of trailing zeros of the last element.\r\n for (; v % 10 == 0; v /= 10, n--);\r\n\r\n // Add the number of digits of the first element.\r\n for (v = c[0]; v >= 10; v /= 10, n++);\r\n }\r\n\r\n if (sd && x.e + 1 > n) n = x.e + 1;\r\n\r\n return n;\r\n };\r\n\r\n\r\n /\r\n Return a new BigNumber whose value is the value of this BigNumber shifted by k places\r\n * (powers of 10). Shift to the right if n > 0, and to the left if n < 0.\r\n \r\n k {number} Integer, -MAX_SAFE_INTEGER to MAX_SAFE_INTEGER inclusive.\r\n \r\n '[BigNumber Error] Argument {not a primitive number\|not an integer\|out of range}: {k}'\r\n /\r\n P.shiftedBy = function (k) {\r\n intCheck(k, -MAX_SAFE_INTEGER, MAX_SAFE_INTEGER);\r\n return this.times('1e' + k);\r\n };\r\n\r\n\r\n /\r\n * sqrt(-n) = N\r\n * sqrt(N) = N\r\n * sqrt(-I) = N\r\n * sqrt(I) = I\r\n * sqrt(0) = 0\r\n * sqrt(-0) = -0\r\n \r\n Return a new BigNumber whose value is the square root of the value of this BigNumber,\r\n * rounded according to DECIMAL_PLACES and ROUNDING_MODE.\r\n /\r\n P.squareRoot = P.sqrt = function () {\r\n var m, n, r, rep, t,\r\n x = this,\r\n c = x.c,\r\n s = x.s,\r\n e = x.e,\r\n dp = DECIMAL_PLACES + 4,\r\n half = new BigNumber('0.5');\r\n\r\n // Negative/NaN/Infinity/zero?\r\n if (s !== 1 \|\| !c \|\| !c[0]) {\r\n return new BigNumber(!s \|\| s < 0 && (!c \|\| c[0]) ? NaN : c ? x : 1 / 0);\r\n }\r\n\r\n // Initial estimate.\r\n s = Math.sqrt(+valueOf(x));\r\n\r\n // Math.sqrt underflow/overflow?\r\n // Pass x to Math.sqrt as integer, then adjust the exponent of the result.\r\n if (s == 0 \|\| s == 1 / 0) {\r\n n = coeffToString(c);\r\n if ((n.length + e) % 2 == 0) n += '0';\r\n s = Math.sqrt(+n);\r\n e = bitFloor((e + 1) / 2) - (e < 0 \|\| e % 2);\r\n\r\n if (s == 1 / 0) {\r\n n = '5e' + e;\r\n } else {\r\n n = s.toExponential();\r\n n = n.slice(0, n.indexOf('e') + 1) + e;\r\n }\r\n\r\n r = new BigNumber(n);\r\n } else {\r\n r = new BigNumber(s + '');\r\n }\r\n\r\n // Check for zero.\r\n // r could be zero if MIN_EXP is changed after the this value was created.\r\n // This would cause a division by zero (x/t) and hence Infinity below, which would cause\r\n // coeffToString to throw.\r\n if (r.c[0]) {\r\n e = r.e;\r\n s = e + dp;\r\n if (s < 3) s = 0;\r\n\r\n // Newton-Raphson iteration.\r\n for (; ;) {\r\n t = r;\r\n r = half.times(t.plus(div(x, t, dp, 1)));\r\n\r\n if (coeffToString(t.c).slice(0, s) === (n = coeffToString(r.c)).slice(0, s)) {\r\n\r\n // The exponent of r may here be one less than the final result exponent,\r\n // e.g 0.0009999 (e-4) --> 0.001 (e-3), so adjust s so the rounding digits\r\n // are indexed correctly.\r\n if (r.e < e) --s;\r\n n = n.slice(s - 3, s + 1);\r\n\r\n // The 4th rounding digit may be in error by -1 so if the 4 rounding digits\r\n // are 9999 or 4999 (i.e. approaching a rounding boundary) continue the\r\n // iteration.\r\n if (n == '9999' \|\| !rep && n == '4999') {\r\n\r\n // On the first iteration only, check to see if rounding up gives the\r\n // exact result as the nines may infinitely repeat.\r\n if (!rep) {\r\n round(t, t.e + DECIMAL_PLACES + 2, 0);\r\n\r\n if (t.times(t).eq(x)) {\r\n r = t;\r\n break;\r\n }\r\n }\r\n\r\n dp += 4;\r\n s += 4;\r\n rep = 1;\r\n } else {\r\n\r\n // If rounding digits are null, 0{0,4} or 50{0,3}, check for exact\r\n // result. If not, then there are further digits and m will be truthy.\r\n if (!+n \|\| !+n.slice(1) && n.charAt(0) == '5') {\r\n\r\n // Truncate to the first rounding digit.\r\n round(r, r.e + DECIMAL_PLACES + 2, 1);\r\n m = !r.times(r).eq(x);\r\n }\r\n\r\n break;\r\n }\r\n }\r\n }\r\n }\r\n\r\n return round(r, r.e + DECIMAL_PLACES + 1, ROUNDING_MODE, m);\r\n };\r\n\r\n\r\n /\r\n * Return a string representing the value of this BigNumber in exponential notation and\r\n * rounded using ROUNDING_MODE to dp fixed decimal places.\r\n \r\n [dp] {number} Decimal places. Integer, 0 to MAX inclusive.\r\n * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n \r\n '[BigNumber Error] Argument {not a primitive number\|not an integer\|out of range}: {dp\|rm}'\r\n /\r\n P.toExponential = function (dp, rm) {\r\n if (dp != null) {\r\n intCheck(dp, 0, MAX);\r\n dp++;\r\n }\r\n return format(this, dp, rm, 1);\r\n };\r\n\r\n\r\n /\r\n * Return a string representing the value of this BigNumber in fixed-point notation rounding\r\n * to dp fixed decimal places using rounding mode rm, or ROUNDING_MODE if rm is omitted.\r\n \r\n Note: as with JavaScript's number type, (-0).toFixed(0) is '0',\r\n * but e.g. (-0.00001).toFixed(0) is '-0'.\r\n \r\n [dp] {number} Decimal places. Integer, 0 to MAX inclusive.\r\n * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n \r\n '[BigNumber Error] Argument {not a primitive number\|not an integer\|out of range}: {dp\|rm}'\r\n /\r\n P.toFixed = function (dp, rm) {\r\n if (dp != null) {\r\n intCheck(dp, 0, MAX);\r\n dp = dp + this.e + 1;\r\n }\r\n return format(this, dp, rm);\r\n };\r\n\r\n\r\n /\r\n * Return a string representing the value of this BigNumber in fixed-point notation rounded\r\n * using rm or ROUNDING_MODE to dp decimal places, and formatted according to the properties\r\n * of the format or FORMAT object (see BigNumber.set).\r\n \r\n The formatting object may contain some or all of the properties shown below.\r\n \r\n FORMAT = {\r\n * prefix: '',\r\n * groupSize: 3,\r\n * secondaryGroupSize: 0,\r\n * groupSeparator: ',',\r\n * decimalSeparator: '.',\r\n * fractionGroupSize: 0,\r\n * fractionGroupSeparator: '\\xA0', // non-breaking space\r\n * suffix: ''\r\n * };\r\n \r\n [dp] {number} Decimal places. Integer, 0 to MAX inclusive.\r\n * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n * [format] {object} Formatting options. See FORMAT pbject above.\r\n \r\n '[BigNumber Error] Argument {not a primitive number\|not an integer\|out of range}: {dp\|rm}'\r\n * '[BigNumber Error] Argument not an object: {format}'\r\n /\r\n P.toFormat = function (dp, rm, format) {\r\n var str,\r\n x = this;\r\n\r\n if (format == null) {\r\n if (dp != null && rm && typeof rm == 'object') {\r\n format = rm;\r\n rm = null;\r\n } else if (dp && typeof dp == 'object') {\r\n format = dp;\r\n dp = rm = null;\r\n } else {\r\n format = FORMAT;\r\n }\r\n } else if (typeof format != 'object') {\r\n throw Error\r\n (bignumberError + 'Argument not an object: ' + format);\r\n }\r\n\r\n str = x.toFixed(dp, rm);\r\n\r\n if (x.c) {\r\n var i,\r\n arr = str.split('.'),\r\n g1 = +format.groupSize,\r\n g2 = +format.secondaryGroupSize,\r\n groupSeparator = format.groupSeparator \|\| '',\r\n intPart = arr[0],\r\n fractionPart = arr[1],\r\n isNeg = x.s < 0,\r\n intDigits = isNeg ? intPart.slice(1) : intPart,\r\n len = intDigits.length;\r\n\r\n if (g2) {\r\n i = g1;\r\n g1 = g2;\r\n g2 = i;\r\n len -= i;\r\n }\r\n\r\n if (g1 > 0 && len > 0) {\r\n i = len % g1 \|\| g1;\r\n intPart = intDigits.substr(0, i);\r\n for (; i < len; i += g1) intPart += groupSeparator + intDigits.substr(i, g1);\r\n if (g2 > 0) intPart += groupSeparator + intDigits.slice(i);\r\n if (isNeg) intPart = '-' + intPart;\r\n }\r\n\r\n str = fractionPart\r\n ? intPart + (format.decimalSeparator \|\| '') + ((g2 = +format.fractionGroupSize)\r\n ? fractionPart.replace(new RegExp('\\\\d{' + g2 + '}\\\\B', 'g'),\r\n '$&' + (format.fractionGroupSeparator \|\| ''))\r\n : fractionPart)\r\n : intPart;\r\n }\r\n\r\n return (format.prefix \|\| '') + str + (format.suffix \|\| '');\r\n };\r\n\r\n\r\n /\r\n * Return an array of two BigNumbers representing the value of this BigNumber as a simple\r\n * fraction with an integer numerator and an integer denominator.\r\n * The denominator will be a positive non-zero value less than or equal to the specified\r\n * maximum denominator. If a maximum denominator is not specified, the denominator will be\r\n * the lowest value necessary to represent the number exactly.\r\n \r\n [md] {number\|string\|BigNumber} Integer >= 1, or Infinity. The maximum denominator.\r\n \r\n '[BigNumber Error] Argument {not an integer\|out of range} : {md}'\r\n /\r\n P.toFraction = function (md) {\r\n var d, d0, d1, d2, e, exp, n, n0, n1, q, r, s,\r\n x = this,\r\n xc = x.c;\r\n\r\n if (md != null) {\r\n n = new BigNumber(md);\r\n\r\n // Throw if md is less than one or is not an integer, unless it is Infinity.\r\n if (!n.isInteger() && (n.c \|\| n.s !== 1) \|\| n.lt(ONE)) {\r\n throw Error\r\n (bignumberError + 'Argument ' +\r\n (n.isInteger() ? 'out of range: ' : 'not an integer: ') + valueOf(n));\r\n }\r\n }\r\n\r\n if (!xc) return new BigNumber(x);\r\n\r\n d = new BigNumber(ONE);\r\n n1 = d0 = new BigNumber(ONE);\r\n d1 = n0 = new BigNumber(ONE);\r\n s = coeffToString(xc);\r\n\r\n // Determine initial denominator.\r\n // d is a power of 10 and the minimum max denominator that specifies the value exactly.\r\n e = d.e = s.length - x.e - 1;\r\n d.c[0] = POWS_TEN[(exp = e % LOG_BASE) < 0 ? LOG_BASE + exp : exp];\r\n md = !md \|\| n.comparedTo(d) > 0 ? (e > 0 ? d : n1) : n;\r\n\r\n exp = MAX_EXP;\r\n MAX_EXP = 1 / 0;\r\n n = new BigNumber(s);\r\n\r\n // n0 = d1 = 0\r\n n0.c[0] = 0;\r\n\r\n for (; ;) {\r\n q = div(n, d, 0, 1);\r\n d2 = d0.plus(q.times(d1));\r\n if (d2.comparedTo(md) == 1) break;\r\n d0 = d1;\r\n d1 = d2;\r\n n1 = n0.plus(q.times(d2 = n1));\r\n n0 = d2;\r\n d = n.minus(q.times(d2 = d));\r\n n = d2;\r\n }\r\n\r\n d2 = div(md.minus(d0), d1, 0, 1);\r\n n0 = n0.plus(d2.times(n1));\r\n d0 = d0.plus(d2.times(d1));\r\n n0.s = n1.s = x.s;\r\n e = e 2;\r\n\r\n // Determine which fraction is closer to x, n0/d0 or n1/d1\r\n r = div(n1, d1, e, ROUNDING_MODE).minus(x).abs().comparedTo(\r\n div(n0, d0, e, ROUNDING_MODE).minus(x).abs()) < 1 ? [n1, d1] : [n0, d0];\r\n\r\n MAX_EXP = exp;\r\n\r\n return r;\r\n };\r\n\r\n\r\n /\r\n Return the value of this BigNumber converted to a number primitive.\r\n /\r\n P.toNumber = function () {\r\n return +valueOf(this);\r\n };\r\n\r\n\r\n /\r\n * Return a string representing the value of this BigNumber rounded to sd significant digits\r\n * using rounding mode rm or ROUNDING_MODE. If sd is less than the number of digits\r\n * necessary to represent the integer part of the value in fixed-point notation, then use\r\n * exponential notation.\r\n \r\n [sd] {number} Significant digits. Integer, 1 to MAX inclusive.\r\n * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n \r\n '[BigNumber Error] Argument {not a primitive number\|not an integer\|out of range}: {sd\|rm}'\r\n /\r\n P.toPrecision = function (sd, rm) {\r\n if (sd != null) intCheck(sd, 1, MAX);\r\n return format(this, sd, rm, 2);\r\n };\r\n\r\n\r\n /\r\n * Return a string representing the value of this BigNumber in base b, or base 10 if b is\r\n * omitted. If a base is specified, including base 10, round according to DECIMAL_PLACES and\r\n * ROUNDING_MODE. If a base is not specified, and this BigNumber has a positive exponent\r\n * that is equal to or greater than TO_EXP_POS, or a negative exponent equal to or less than\r\n * TO_EXP_NEG, return exponential notation.\r\n \r\n [b] {number} Integer, 2 to ALPHABET.length inclusive.\r\n \r\n '[BigNumber Error] Base {not a primitive number\|not an integer\|out of range}: {b}'\r\n /\r\n P.toString = function (b) {\r\n var str,\r\n n = this,\r\n s = n.s,\r\n e = n.e;\r\n\r\n // Infinity or NaN?\r\n if (e === null) {\r\n if (s) {\r\n str = 'Infinity';\r\n if (s < 0) str = '-' + str;\r\n } else {\r\n str = 'NaN';\r\n }\r\n } else {\r\n if (b == null) {\r\n str = e <= TO_EXP_NEG \|\| e >= TO_EXP_POS\r\n ? toExponential(coeffToString(n.c), e)\r\n : toFixedPoint(coeffToString(n.c), e, '0');\r\n } else if (b === 10 && alphabetHasNormalDecimalDigits) {\r\n n = round(new BigNumber(n), DECIMAL_PLACES + e + 1, ROUNDING_MODE);\r\n str = toFixedPoint(coeffToString(n.c), n.e, '0');\r\n } else {\r\n intCheck(b, 2, ALPHABET.length, 'Base');\r\n str = convertBase(toFixedPoint(coeffToString(n.c), e, '0'), 10, b, s, true);\r\n }\r\n\r\n if (s < 0 && n.c[0]) str = '-' + str;\r\n }\r\n\r\n return str;\r\n };\r\n\r\n\r\n /\r\n * Return as toString, but do not accept a base argument, and include the minus sign for\r\n * negative zero.\r\n /\r\n P.valueOf = P.toJSON = function () {\r\n return valueOf(this);\r\n };\r\n\r\n\r\n P._isBigNumber = true;\r\n\r\n P[Symbol.toStringTag] = 'BigNumber';\r\n\r\n // Node.js v10.12.0+\r\n P[Symbol.for('nodejs.util.inspect.custom')] = P.valueOf;\r\n\r\n if (configObject != null) BigNumber.set(configObject);\r\n\r\n return BigNumber;\r\n}\r\n\r\n\r\n// PRIVATE HELPER FUNCTIONS\r\n\r\n// These functions don't need access to variables,\r\n// e.g. DECIMAL_PLACES, in the scope of the `clone` function above.\r\n\r\n\r\nfunction bitFloor(n) {\r\n var i = n \| 0;\r\n return n > 0 \|\| n === i ? i : i - 1;\r\n}\r\n\r\n\r\n// Return a coefficient array as a string of base 10 digits.\r\nfunction coeffToString(a) {\r\n var s, z,\r\n i = 1,\r\n j = a.length,\r\n r = a[0] + '';\r\n\r\n for (; i < j;) {\r\n s = a[i++] + '';\r\n z = LOG_BASE - s.length;\r\n for (; z--; s = '0' + s);\r\n r += s;\r\n }\r\n\r\n // Determine trailing zeros.\r\n for (j = r.length; r.charCodeAt(--j) === 48;);\r\n\r\n return r.slice(0, j + 1 \|\| 1);\r\n}\r\n\r\n\r\n// Compare the value of BigNumbers x and y.\r\nfunction compare(x, y) {\r\n var a, b,\r\n xc = x.c,\r\n yc = y.c,\r\n i = x.s,\r\n j = y.s,\r\n k = x.e,\r\n l = y.e;\r\n\r\n // Either NaN?\r\n if (!i \|\| !j) return null;\r\n\r\n a = xc && !xc[0];\r\n b = yc && !yc[0];\r\n\r\n // Either zero?\r\n if (a \|\| b) return a ? b ? 0 : -j : i;\r\n\r\n // Signs differ?\r\n if (i != j) return i;\r\n\r\n a = i < 0;\r\n b = k == l;\r\n\r\n // Either Infinity?\r\n if (!xc \|\| !yc) return b ? 0 : !xc ^ a ? 1 : -1;\r\n\r\n // Compare exponents.\r\n if (!b) return k > l ^ a ? 1 : -1;\r\n\r\n j = (k = xc.length) < (l = yc.length) ? k : l;\r\n\r\n // Compare digit by digit.\r\n for (i = 0; i < j; i++) if (xc[i] != yc[i]) return xc[i] > yc[i] ^ a ? 1 : -1;\r\n\r\n // Compare lengths.\r\n return k == l ? 0 : k > l ^ a ? 1 : -1;\r\n}\r\n\r\n\r\n/\r\n * Check that n is a primitive number, an integer, and in range, otherwise throw.\r\n /\r\nfunction intCheck(n, min, max, name) {\r\n if (n < min \|\| n > max \|\| n !== mathfloor(n)) {\r\n throw Error\r\n (bignumberError + (name \|\| 'Argument') + (typeof n == 'number'\r\n ? n < min \|\| n > max ? ' out of range: ' : ' not an integer: '\r\n : ' not a primitive number: ') + String(n));\r\n }\r\n}\r\n\r\n\r\n// Assumes finite n.\r\nfunction isOdd(n) {\r\n var k = n.c.length - 1;\r\n return bitFloor(n.e / LOG_BASE) == k && n.c[k] % 2 != 0;\r\n}\r\n\r\n\r\nfunction toExponential(str, e) {\r\n return (str.length > 1 ? str.charAt(0) + '.' + str.slice(1) : str) +\r\n (e < 0 ? 'e' : 'e+') + e;\r\n}\r\n\r\n\r\nfunction toFixedPoint(str, e, z) {\r\n var len, zs;\r\n\r\n // Negative exponent?\r\n if (e < 0) {\r\n\r\n // Prepend zeros.\r\n for (zs = z + '.'; ++e; zs += z);\r\n str = zs + str;\r\n\r\n // Positive exponent\r\n } else {\r\n len = str.length;\r\n\r\n // Append zeros.\r\n if (++e > len) {\r\n for (zs = z, e -= len; --e; zs += z);\r\n str += zs;\r\n } else if (e < len) {\r\n str = str.slice(0, e) + '.' + str.slice(e);\r\n }\r\n }\r\n\r\n return str;\r\n}\r\n\r\n\r\n// EXPORT\r\n\r\n\r\nexport var BigNumber = clone();\r\n\r\nexport default BigNumber;\r\n","/ global global, window /\nimport { sha3_512 as sha3 } from \"@noble/hashes/sha3.js\";\nimport BigNumber from \"bignumber.js\";\n\nconst defaultLength = 24;\nconst bigLength = 32;\n\n/\n A cryptographically secure random number generator that mimics Math.random()\n * Uses the Web Crypto API which is available in both modern browsers and Node.js\n * Returns a random float in the range [0, 1) just like Math.random()\n /\nconst createRandom = () => {\n // Use globalThis.crypto which works in both Node.js and browsers\n if (\n typeof globalThis !== \"undefined\" &&\n globalThis.crypto &&\n typeof globalThis.crypto.getRandomValues === \"function\"\n ) {\n return () => {\n // Generate a random 32-bit unsigned integer\n const buffer = new Uint32Array(1);\n globalThis.crypto.getRandomValues(buffer);\n // Convert to a float in [0, 1) by dividing by 2^32\n return buffer[0] / 0x100000000;\n };\n }\n // Fallback to Math.random if crypto is not available\n return Math.random;\n};\n\nconst random = createRandom();\n\nconst createEntropy = (length = 4, rand = random) => {\n let entropy = \"\";\n\n while (entropy.length < length) {\n entropy = entropy + Math.floor(rand() 36).toString(36);\n }\n return entropy;\n};\n\n/\n Adapted from https://github.com/juanelas/bigint-conversion\n * MIT License Copyright (c) 2018 Juan Hernández Serrano\n /\nfunction bufToBigInt(buf) {\n let value = new BigNumber(0);\n\n for (const i of buf.values()) {\n // Multiply by 256 (left shift by 8 bits) and add the current byte\n value = value.multipliedBy(256).plus(i);\n }\n return value;\n}\n\nconst hash = (input = \"\") => {\n // Drop the first character because it will bias the histogram\n // to the left.\n const encoder = new TextEncoder();\n return bufToBigInt(sha3(encoder.encode(input)))\n .toString(36)\n .slice(1);\n};\n\nconst alphabet = Array.from({ length: 26 }, (x, i) =>\n String.fromCharCode(i + 97),\n);\n\nconst randomLetter = (rand) => alphabet[Math.floor(rand() alphabet.length)];\n\n/\nThis is a fingerprint of the host environment. It is used to help\nprevent collisions when generating ids in a distributed system.\nIf no global object is available, you can pass in your own, or fall back\non a random string.\n/\nconst createFingerprint = ({\n globalObj = typeof global !== \"undefined\"\n ? global\n : typeof window !== \"undefined\"\n ? window\n : {},\n random: rand = random,\n} = {}) => {\n const globals = Object.keys(globalObj).toString();\n const sourceString = globals.length\n ? globals + createEntropy(bigLength, rand)\n : createEntropy(bigLength, rand);\n\n return hash(sourceString).substring(0, bigLength);\n};\n\nconst createCounter = (count) => () => {\n return count++;\n};\n\n// ~22k hosts before 50% chance of initial counter collision\n// with a remaining counter range of 9.0e+15 in JavaScript.\nconst initialCountMax = 476782367;\n\nconst init = ({\n // Fallback if the user does not pass in a CSPRNG. This should be OK\n // because we don't rely solely on the random number generator for entropy.\n // We also use the host fingerprint, current time, and a session counter.\n random: rand = random,\n counter = createCounter(Math.floor(rand() * initialCountMax)),\n length = defaultLength,\n fingerprint = createFingerprint({ random: rand }),\n} = {}) => {\n if (length > bigLength) {\n throw new Error(\n `Length must be between 2 and ${bigLength}. Received: ${length}`,\n );\n }\n return function cuid2() {\n const firstLetter = randomLetter(rand);\n\n // If we're lucky, the `.toString(36)` calls may reduce hashing rounds\n // by shortening the input to the hash function a little.\n const time = Date.now().toString(36);\n const count = counter().toString(36);\n\n // The salt should be long enough to be globally unique across the full\n // length of the hash. For simplicity, we use the same length as the\n // intended id output.\n const salt = createEntropy(length, rand);\n const hashInput = `${time + salt + count + fingerprint}`;\n\n return `${firstLetter + hash(hashInput).substring(1, length)}`;\n };\n};\n\nconst createId = lazy(init);\nfunction lazy(fn) {\n let initialized;\n return () => {\n if (!initialized) {\n initialized = fn();\n }\n return initialized();\n };\n}\n\nconst isCuid = (\n id,\n { minLength = 2, maxLength = bigLength, length = id?.length } = {},\n) => {\n const regex = /^[a-z][0-9a-z]+$/;\n\n return (\n typeof id === \"string\" &&\n length >= minLength &&\n length <= maxLength &&\n regex.test(id)\n );\n};\n\nexport const getConstants = () => ({ defaultLength, bigLength });\nexport { init };\nexport { createId };\nexport { bufToBigInt };\nexport { createCounter };\nexport { createFingerprint };\nexport { isCuid };\n","export const __DEV__ = typeof process !== 'undefined' && process.env.NODE_ENV === 'development';\n","import { OPTIONS, type SigilOptions } from './options';\nimport {\n __DECORATED__,\n __INHERITANCE_CHECKED__,\n __LABEL__,\n __SIGIL_BASE__,\n __SIGIL__,\n __LABEL_LINEAGE__,\n __LABEL_SET__,\n} from './symbols';\nimport type { ISigil } from './types';\nimport { createId } from '@paralleldrive/cuid2';\nimport { __DEV__ } from './constants';\n\n/** -----------------------------------------\n * High level helpers\n * ----------------------------------------- /\n\n/\n Attach sigil-related statics to a constructor and register its label.\n \n Side effects:\n * - Defines non-enumerable statics on the constructor:\n * - `__LABEL__` (string)\n * - `__LABEL_LINEAGE__` (array of strings)\n * - `__LABEL_SET__` (Set of strings)\n * - Marks the constructor as decorated via `markDecorated`.\n \n Throws if the constructor is already decorated.\n \n @internal\n * @param ctor - The constructor to decorate.\n * @param label - The identity label to register and attach (e.g. '@scope/pkg.ClassName').\n * @param opts - Options object to override any global options if needed.\n * @throws Error when `ctor` is already decorated.\n /\nexport function decorateCtor(ctor: Function, label: string, isMixin: boolean = false) {\n // if already decorated throw error\n if (isDecorated(ctor))\n throw new Error(\n `Constructor ${ctor} is already decorated. if you are using 'withSigilTyped()' & '@WithSigil()' at the same time remove one of them.`\n );\n\n // attach basic runtime statics\n Object.defineProperty(ctor, __LABEL__, {\n value: label,\n configurable: false,\n enumerable: false,\n writable: false,\n });\n\n // get parent chain (safe if parent hasn't been augmented yet — uses existing value or empty)\n const parent = Object.getPrototypeOf(ctor);\n const parentChain = parent && parent[__LABEL_LINEAGE__] ? parent[__LABEL_LINEAGE__] : [];\n\n // generate Ctor chain, if mixin (Sigilify function) then append 'Sigil' at the start\n const ctorChain =\n isMixin && label !== 'Sigil' ? ['Sigil', ...parentChain, label] : [...parentChain, label];\n\n // attach symbol lineage and set\n Object.defineProperty(ctor, __LABEL_LINEAGE__, {\n value: ctorChain,\n configurable: false,\n enumerable: false,\n writable: false,\n });\n Object.defineProperty(ctor, __LABEL_SET__, {\n value: new Set(ctorChain),\n configurable: false,\n enumerable: false,\n writable: false,\n });\n\n // mark as decorated\n markDecorated(ctor);\n}\n\n/\n Perform development-only inheritance checks to ensure no ancestor classes\n * reuse the same sigil label.\n \n Behavior:\n * - No-op if `ctor` is not a sigil constructor.\n * - No-op in non-DEV builds.\n * - No-op if inheritance checks were already performed or `OPTIONS.skipLabelInheritanceCheck` is true.\n \n When a duplicate label is detected:\n * - If the class is explicitly decorated (`isDecorated`) or `OPTIONS.autofillLabels` is false,\n * an Error is thrown describing the label collision.\n * - Otherwise (autofill enabled), a random label will be generated and assigned\n * to the offending constructor via `decorateCtor`.\n \n @internal\n * @param ctor - The constructor to validate.\n * @param opts - Options object to override any global options if needed.\n * @throws Error when a decorated subclass re-uses an ancestor's sigil label.\n /\nexport function checkInheritance(\n ctor: Function,\n opts?: Pick<SigilOptions, 'skipLabelInheritanceCheck' \| 'autofillLabels'>\n) {\n const skipLabelInheritanceCheck =\n opts?.skipLabelInheritanceCheck ?? OPTIONS.skipLabelInheritanceCheck;\n const autofillLabels = opts?.autofillLabels ?? OPTIONS.autofillLabels;\n\n if (!isSigilCtor(ctor)) return;\n if (isInheritanceChecked(ctor) \|\| skipLabelInheritanceCheck) return;\n\n /* Array of all sigil constructors in the chain (starting with the provided ctor) /\n const ctors: ISigil[] = [ctor];\n\n // go through prototype chain to get all sigil ancestors\n let ancestor: any = Object.getPrototypeOf(ctor);\n while (isSigilCtor(ancestor)) {\n ctors.push(ancestor);\n ancestor = Object.getPrototypeOf(ancestor);\n }\n\n /* Map<label, className> to record the owner of each label. /\n const labelOwner = new Map<string, string>();\n\n // loop ctors from base to current and make sure no label is reused\n for (let i = ctors.length - 1; i >= 0; i--) {\n const ctor = ctors[i];\n if (!ctor) continue;\n let label = ctor.SigilLabel;\n if (labelOwner.has(label)) {\n if (isDecorated(ctor) \|\| !autofillLabels) {\n const ancestorName = labelOwner.get(label);\n throw new Error(\n `[Sigil Error] Class \"${ctor.name}\" re-uses Sigil label \"${label}\" from ancestor \"${ancestorName}\". ` +\n `Each Sigil subclass must use a unique label. Did you forget to use \"WithSigil(newLabel)\" on the subclass?`\n );\n }\n label = generateRandomLabel();\n decorateCtor(ctor, label);\n }\n labelOwner.set(label, ctor.name);\n }\n markInheritanceChecked(ctor);\n}\n\n/\n Validate a sigil label at runtime and throw a helpful error if it is malformed.\n \n This is intentionally `void` and runs synchronously at class declaration time so\n * invalid labels fail fast during development. Validation behavior follows `OPTIONS.labelValidation`:\n * - If `OPTIONS.labelValidation` is `null` no validation is performed.\n * - If it is a `RegExp`, the label must match the regex.\n * - If it is a function, the function must return `true` for the label to be considered valid.\n \n @internal\n * @typeParam L - Label string literal type.\n * @param label - The label to validate.\n * @param opts - Options object to override any global options if needed.\n * @throws {Error} Throws when the label does not pass configured validation.\n /\nexport function verifyLabel<L extends string>(\n label: L,\n opts?: Pick<SigilOptions, 'labelValidation'>\n): void {\n const labelValidation = opts?.labelValidation ?? OPTIONS.labelValidation;\n\n if (labelValidation) {\n let valid: boolean;\n if (labelValidation instanceof RegExp) valid = labelValidation.test(label);\n else valid = labelValidation(label);\n\n if (!valid)\n throw new Error(\n `[Sigil] Invalid identity label \"${label}\". Make sure that supplied label matches validation regex or function.`\n );\n }\n}\n\n/\n Generate a random alphanumeric label of the requested length.\n \n This is used to auto-generate labels when `OPTIONS.autofillLabels` is enabled.\n * It insures that generated label is not registered yet.\n \n @internal\n * @param length - Desired length of the generated string (defaults to 16).\n * @returns A random label.\n /\nexport function generateRandomLabel(): string {\n let label = createId();\n return `@Sigil.auto-${label}`;\n}\n\n/* -----------------------------------------\n * Introspection helpers\n * ----------------------------------------- /\n\n/\n Mark a constructor as a sigil constructor by attaching an internal symbol.\n \n This function defines a non-enumerable, non-writable, non-configurable\n * property on the constructor so subsequent checks can detect sigil\n * constructors.\n \n @internal\n * @param ctor - The constructor to mark.\n /\nexport function markSigil(ctor: Function) {\n Object.defineProperty(ctor, __SIGIL__, {\n value: true,\n configurable: false,\n enumerable: false,\n writable: false,\n });\n}\n\n/\n Mark a constructor as a \"sigil base\" constructor.\n \n A sigil base constructor indicates that the class is the base for\n * other sigil classes. This writes a stable, non-enumerable property\n * to the constructor.\n \n @internal\n * @param ctor - The constructor to mark as sigil base.\n /\nexport function markSigilBase(ctor: Function) {\n Object.defineProperty(ctor, __SIGIL_BASE__, {\n value: true,\n configurable: false,\n enumerable: false,\n writable: false,\n });\n}\n\n/\n Mark a constructor as having been decorated with `WithSigil`.\n \n This is used to detect classes that were explicitly decorated rather\n * than auto-filled by the library.\n \n @internal\n * @param ctor - The constructor that was decorated.\n /\nexport function markDecorated(ctor: Function) {\n Object.defineProperty(ctor, __DECORATED__, {\n value: true,\n configurable: false,\n enumerable: false,\n writable: false,\n });\n}\n\n/\n Mark that inheritance checks for this constructor have already been performed.\n \n The library uses this to avoid repeating expensive inheritance validation\n * during development.\n \n @internal\n * @param ctor - The constructor that has been checked.\n /\nexport function markInheritanceChecked(ctor: Function) {\n Object.defineProperty(ctor, __INHERITANCE_CHECKED__, {\n value: true,\n configurable: false,\n enumerable: false,\n writable: false,\n });\n}\n\n/\n Runtime predicate that checks whether the provided value is a sigil constructor.\n \n This is a lightweight check that verifies the presence of an internal\n * symbol attached to the constructor.\n \n @param ctor - Constructor to test.\n * @returns `true` if `value` is a sigil constructor, otherwise `false`.\n /\nexport function isSigilCtor(ctor: unknown): ctor is ISigil {\n return typeof ctor === 'function' && (ctor as any)[__SIGIL__] === true;\n}\n\n/\n Runtime predicate that checks whether the provided object is an instance\n * of a sigil class.\n \n @param inst - The instanca to test.\n * @returns `true` if `obj` is an instance produced by a sigil constructor.\n /\nexport function isSigilInstance(inst: unknown): inst is InstanceType<ISigil> {\n if (!inst \|\| typeof inst !== 'object') return false;\n const ctor = getConstructor(inst);\n return isSigilCtor(ctor);\n}\n\n/\n Check whether the provided constructor was marked as a sigil base constructor.\n \n Uses `Object.hasOwn` to ensure we only check own properties.\n \n @param ctor - Constructor to check.\n * @returns `true` if `ctor` is a sigil base constructor.\n /\nexport function isSigilBaseCtor(ctor: Function): ctor is ISigil {\n return Object.hasOwn(ctor, __SIGIL_BASE__);\n}\n\n/\n Check whether the provided object is an instance of a sigil base constructor.\n \n This resolves the instance's constructor and delegates to `isSigilBaseCtor`.\n \n @param inst - The instance to test.\n * @returns `true` if `inst` is an instance of a sigil base constructor.\n /\nexport function isSigilBaseInstance(inst: unknown): inst is InstanceType<ISigil> {\n if (!inst \|\| typeof inst !== 'object') return false;\n const ctor = getConstructor(inst);\n return isSigilBaseCtor(ctor);\n}\n\n/\n Returns whether the constructor has been explicitly decorated with `WithSigil`.\n \n This is an own-property check and does not traverse the prototype chain.\n \n @internal\n * @param ctor - Constructor to test.\n * @returns `true` if the constructor is explicitly decorated.\n /\nexport function isDecorated(ctor: Function): boolean {\n return Object.hasOwn(ctor, __DECORATED__);\n}\n\n/\n Returns whether inheritance checks have already been performed for the constructor.\n \n This is used to avoid repeated checks during development (DEV-only checks).\n \n @internal\n * @param ctor - Constructor to test.\n * @returns `true` if inheritance checks were marked as completed.\n /\nexport function isInheritanceChecked(ctor: Function): boolean {\n return Object.hasOwn(ctor, __INHERITANCE_CHECKED__);\n}\n\n/* -----------------------------------------\n * Generic helpers\n * ----------------------------------------- /\n\n/\n Retrieve the constructor function for a given instance.\n \n Returns `null` for non-objects or when a constructor cannot be resolved.\n \n @internal\n * @param obj - The value that may be an instance whose constructor should be returned.\n * @returns The constructor function or `null` if not available.\n /\nexport function getConstructor(obj: any) {\n if (!obj \|\| typeof obj !== 'object') return null;\n return obj.constructor ?? Object.getPrototypeOf(obj)?.constructor ?? null;\n}\n","import {\n checkInheritance,\n decorateCtor,\n generateRandomLabel,\n getConstructor,\n isSigilCtor,\n isSigilInstance,\n markSigil,\n markSigilBase,\n verifyLabel,\n} from './helpers';\nimport type { SigilOptions } from './options';\nimport { __LABEL__, __LABEL_LINEAGE__, __LABEL_SET__ } from './symbols';\nimport type { Constructor, ISigil, Prettify, GetInstance, ConstructorAbstract } from './types';\nimport { __DEV__ } from './constants';\n\n/\n Mixin factory that augments an existing class with Sigil runtime metadata and\n * helpers.\n \n The returned class:\n * - exposes static helpers such as `SigilLabel`, `SigilType`, `isOfType`, and `isOfTypeStrict`\n * - exposes instance helpers such as `getSigilLabel`, `getSigilType`, etc.\n \n @param Base - The base constructor to extend.\n * @param label - Optional identity label to attach to the resulting class (e.g. '@scope/pkg.ClassName').\n * If not passed a random label is generated instead.\n * @param opts - Options object to override any global options if needed.\n * @returns A new abstract constructor that extends `Base` and includes Sigil statics/instance methods.\n * @throws Error if `Base` is already sigilized.\n /\nexport function Sigilify<B extends Constructor, L extends string>(\n Base: B,\n label?: L,\n opts?: SigilOptions\n) {\n // if siglified throw\n if (isSigilCtor(Base)) throw new Error(`[Sigil Error] 'Sigilify(${label})' already siglified.`);\n\n // generate random label if not passed and verify it\n let l: string;\n if (label) {\n verifyLabel(label, opts);\n l = label;\n } else l = generateRandomLabel();\n\n // extend actual class\n class Sigilified extends Base {\n /\n Compile-time nominal brand that encodes the class label `L` plus parent's brand keys `BrandOf<P>`.\n \n - HAVE NO RUN-TIME VALUE (undefined)\n * - Provides a type-only unique marker that makes instances nominally\n * distinct by label and allows propagation/merging of brand keys across inheritance.\n /\n declare static readonly __SIGIL_BRAND__: Prettify<\n {\n Sigil: true;\n } & {\n [K in L]: true;\n }\n >;\n\n /\n Class-level human-readable label constant for this sigil constructor.\n /\n static get SigilLabel(): string {\n return (this as any)[__LABEL__];\n }\n\n /\n Copy of the linearized sigil type label chain for the current constructor.\n \n Useful for debugging and performing strict lineage comparisons.\n \n @returns An array of labels representing parent → child type labels.\n /\n static get SigilLabelLineage(): readonly string[] {\n return [...((this as any)[__LABEL_LINEAGE__] ?? [])];\n }\n\n /\n Copy of the sigil type label set for the current constructor.\n \n Useful for quick membership checks (O(1) lookups) and debugging.\n \n @returns A Readonly Set of labels that represent the type lineage.\n /\n static get SigilLabelSet(): Readonly<Set<string>> {\n const set: Set<string> = new Set();\n for (const s of (this as any)[__LABEL_SET__]) set.add(s);\n return set;\n }\n\n /\n Compile-time nominal brand that encodes the class label `L` plus parent's brand keys `BrandOf<P>`.\n \n - HAVE NO RUN-TIME VALUE (undefined)\n * - Provides a type-only unique marker that makes instances nominally\n * distinct by label and allows propagation/merging of brand keys across inheritance.\n /\n declare readonly __SIGIL_BRAND__: Prettify<\n {\n Sigil: true;\n } & {\n [K in L]: true;\n }\n >;\n\n constructor(...args: any[]) {\n super(...args);\n\n // Correct prototype chain when necessary (defensive for transpiled code / edge cases)\n if (Object.getPrototypeOf(this) !== new.target.prototype)\n Object.setPrototypeOf(this, new.target.prototype);\n\n // Resolve constructor; defensive null-check helps catch weird runtime cases.\n const ctor = getConstructor(this);\n if (!ctor) {\n if (__DEV__)\n throw new Error(`[Sigil Error] 'Sigilify(${label})' instance without constructor`);\n return;\n }\n\n // Perform dev-only inheritance validation to ensure labels are unique across the chain.\n if (__DEV__) checkInheritance(ctor);\n }\n\n /\n Runtime predicate indicating whether `obj` is an instance produced by a sigil class.\n \n @param obj - The value to test.\n * @returns `true` if `obj` is a sigil instance.\n /\n static isSigilified(obj: unknown): obj is ISigil {\n return isSigilInstance(obj);\n }\n\n /\n Check whether `other` is (or inherits from) the type represented by the calling constructor.\n \n This replaces `instanceof` so that checks remain valid across bundles/realms\n * and when subclassing.\n \n @typeParam T - The calling constructor type (narrowing the returned instance type).\n * @param this - The constructor performing the check.\n * @param other - The object to test.\n * @returns `true` if `other` is an instance of this type or a subtype.\n /\n static isOfType<T>(this: T, other: unknown): other is GetInstance<T> {\n if (!isSigilInstance(other)) return false;\n const otherSet = getConstructor(other)?.[__LABEL_SET__];\n const thisType = (this as any)[__LABEL__];\n return !!otherSet && otherSet.has(thisType);\n }\n\n /\n Strict lineage check: compares the type label lineage arrays element-by-element.\n \n @typeParam T - The calling constructor type.\n * @param this - The constructor performing the check.\n * @param other - The object to test.\n * @returns `true` if `other` has an identical lineage up to the length of this constructor's lineage.\n /\n static isOfTypeStrict<T>(this: T, other: unknown): other is GetInstance<T> {\n if (!isSigilInstance(other)) return false;\n const otherLineage = getConstructor(other)?.[__LABEL_LINEAGE__];\n const thisLineage = (this as any)[__LABEL_LINEAGE__] as readonly string[];\n return !!otherLineage && thisLineage.every((s, i) => s === otherLineage[i]);\n }\n\n /\n Check whether `other` is (or inherits from) the type instance.\n \n Allows 'instanceof' like checks but in instances.\n \n @typeParam T - The instance type.\n * @param this - The instance performing the check.\n * @param other - The object to test.\n * @returns `true` if `other` is the same instance of this type or a subtype.\n /\n isOfType<T>(this: T, other: unknown): other is GetInstance<T> {\n if (!isSigilInstance(other)) return false;\n const otherSet = getConstructor(other)?.[__LABEL_SET__];\n const thisType = getConstructor(this)[__LABEL__];\n return !!otherSet && otherSet.has(thisType);\n }\n\n /\n Strict lineage check: compares the type label lineage arrays element-by-element.\n \n Allows 'instanceof' like checks but in instances.\n \n @typeParam T - The instance type.\n * @param this - The instance performing the check.\n * @param other - The object to test.\n * @returns `true` if `other` has an identical lineage up to the length of this instance's lineage.\n /\n isOfTypeStrict<T>(this: T, other: unknown): other is GetInstance<T> {\n if (!isSigilInstance(other)) return false;\n const otherLineage = getConstructor(other)?.[__LABEL_LINEAGE__];\n const thisLineage = getConstructor(this)?.[__LABEL_LINEAGE__] as readonly string[];\n return !!otherLineage && thisLineage.every((s, i) => s === otherLineage[i]);\n }\n\n /\n Returns the human-readable sigil label of this instance's constructor.\n \n @returns The label string (e.g. '@scope/pkg.ClassName') or '@Sigil.unknown' in DEV when constructor is missing.\n /\n getSigilLabel(): string {\n const ctor = getConstructor(this);\n if (!ctor) {\n if (__DEV__)\n throw new Error(`[Sigil Error] 'Sigilify(${label})' instance without constructor`);\n return '@Sigil.unknown';\n }\n return ctor.SigilLabel;\n }\n\n /\n Returns a copy of the sigil type label lineage for this instance's constructor.\n \n @returns readonly array of labels representing the type lineage.\n /\n getSigilLabelLineage(): readonly string[] {\n const ctor = getConstructor(this);\n if (!ctor) {\n if (__DEV__)\n throw new Error(`[Sigil Error] 'Sigilify(${label})' instance without constructor`);\n return ['@Sigil.unknown'];\n }\n return ctor.SigilLabelLineage;\n }\n\n /\n Returns a readonly copy of the sigil type label set for this instance's constructor.\n \n @returns A Readonly Set of labels representing the type lineage for O(1) membership tests.\n /\n getSigilLabelSet(): Readonly<Set<string>> {\n const ctor = getConstructor(this);\n if (!ctor) {\n if (__DEV__)\n throw new Error(`[Sigil Error] 'Sigilify(${label})' instance without constructor`);\n return new Set(['@Sigil.unknown']);\n }\n return ctor.SigilLabelSet;\n }\n }\n\n // Attach sigil metadata to constructor (registers label, sets labels, marks decorated)\n decorateCtor(Sigilified, l, true);\n\n // Mark the returned constructor as sigil (runtime flag) and as a base.\n markSigil(Sigilified);\n markSigilBase(Sigilified);\n\n return Sigilified;\n}\n\n/\n Mixin factory that augments an existing class with Sigil runtime metadata and\n * helpers. Accept and return 'abstract' class.\n \n The returned class:\n * - exposes static helpers such as `SigilLabel`, `SigilType`, `isOfType`, and `isOfTypeStrict`\n * - exposes instance helpers such as `getSigilLabel`, `getSigilType`, etc.\n \n @param Base - The base constructor to extend.\n * @param label - Optional identity label to attach to the resulting class (e.g. '@scope/pkg.ClassName').\n * If not passed a random label is generated instead.\n * @param opts - Options object to override any global options if needed.\n * @returns A new abstract constructor that extends `Base` and includes Sigil statics/instance methods.\n * @throws Error if `Base` is already sigilized.\n /\nexport function SigilifyAbstract<B extends ConstructorAbstract, L extends string>(\n Base: B,\n label?: L,\n opts?: SigilOptions\n) {\n // if siglified throw\n if (isSigilCtor(Base)) throw new Error(`[Sigil Error] 'Sigilify(${label})' already siglified.`);\n\n // generate random label if not passed and verify it\n let l: string;\n if (label) {\n verifyLabel(label, opts);\n l = label;\n } else l = generateRandomLabel();\n\n // extend actual class\n abstract class Sigilified extends Base {\n /\n Compile-time nominal brand that encodes the class label `L` plus parent's brand keys `BrandOf<P>`.\n \n - HAVE NO RUN-TIME VALUE (undefined)\n * - Provides a type-only unique marker that makes instances nominally\n * distinct by label and allows propagation/merging of brand keys across inheritance.\n /\n declare static readonly __SIGIL_BRAND__: Prettify<\n {\n Sigil: true;\n } & {\n [K in L]: true;\n }\n >;\n\n /\n Class-level human-readable label constant for this sigil constructor.\n /\n static get SigilLabel(): string {\n return (this as any)[__LABEL__];\n }\n\n /\n Copy of the linearized sigil type label chain for the current constructor.\n \n Useful for debugging and performing strict lineage comparisons.\n \n @returns An array of labels representing parent → child type labels.\n /\n static get SigilLabelLineage(): readonly string[] {\n return [...((this as any)[__LABEL_LINEAGE__] ?? [])];\n }\n\n /\n Copy of the sigil type label set for the current constructor.\n \n Useful for quick membership checks (O(1) lookups) and debugging.\n \n @returns A Readonly Set of labels that represent the type lineage.\n /\n static get SigilLabelSet(): Readonly<Set<string>> {\n const set: Set<string> = new Set();\n for (const s of (this as any)[__LABEL_SET__]) set.add(s);\n return set;\n }\n\n /\n Compile-time nominal brand that encodes the class label `L` plus parent's brand keys `BrandOf<P>`.\n \n - HAVE NO RUN-TIME VALUE (undefined)\n * - Provides a type-only unique marker that makes instances nominally\n * distinct by label and allows propagation/merging of brand keys across inheritance.\n /\n declare readonly __SIGIL_BRAND__: Prettify<\n {\n Sigil: true;\n } & {\n [K in L]: true;\n }\n >;\n\n constructor(...args: any[]) {\n super(...args);\n\n // Correct prototype chain when necessary (defensive for transpiled code / edge cases)\n if (Object.getPrototypeOf(this) !== new.target.prototype)\n Object.setPrototypeOf(this, new.target.prototype);\n\n // Resolve constructor; defensive null-check helps catch weird runtime cases.\n const ctor = getConstructor(this);\n if (!ctor) {\n if (__DEV__)\n throw new Error(`[Sigil Error] 'Sigilify(${label})' instance without constructor`);\n return;\n }\n\n // Perform dev-only inheritance validation to ensure labels are unique across the chain.\n if (__DEV__) checkInheritance(ctor);\n }\n\n /\n Runtime predicate indicating whether `obj` is an instance produced by a sigil class.\n \n @param obj - The value to test.\n * @returns `true` if `obj` is a sigil instance.\n /\n static isSigilified(obj: unknown): obj is ISigil {\n return isSigilInstance(obj);\n }\n\n /\n Check whether `other` is (or inherits from) the type represented by the calling constructor.\n \n Implementation detail:\n * - Uses the other instance's `__LABEL_SET__` for O(1) membership test.\n * - O(1) and reliable as long as `OPTIONS.skipLabelInheritanceCheck` is `false`.\n \n This replaces `instanceof` so that checks remain valid across bundles/realms\n * and when subclassing.\n \n @typeParam T - The calling constructor type (narrowing the returned instance type).\n * @param this - The constructor performing the check.\n * @param other - The object to test.\n * @returns `true` if `other` is an instance of this type or a subtype.\n /\n static isOfType<T>(this: T, other: unknown): other is GetInstance<T> {\n if (!isSigilInstance(other) \|\| !isSigilCtor(this)) return false;\n const otherSet = getConstructor(other)?.[__LABEL_SET__];\n const thisType = (this as any)[__LABEL__];\n return !!otherSet && otherSet.has(thisType);\n }\n\n /\n Strict lineage check: compares the type label lineage arrays element-by-element.\n \n Implementation detail:\n * - Works in O(n) time where n is the depth of the lineage.\n * - Reliable when `OPTIONS.skipLabelInheritanceCheck` is `false`.\n \n @typeParam T - The calling constructor type.\n * @param this - The constructor performing the check.\n * @param other - The object to test.\n * @returns `true` if `other` has an identical lineage up to the length of this constructor's lineage.\n /\n static isOfTypeStrict<T>(this: T, other: unknown): other is GetInstance<T> {\n if (!isSigilInstance(other) \|\| !isSigilCtor(this)) return false;\n const otherLineage = getConstructor(other)?.[__LABEL_LINEAGE__];\n const thisLineage = (this as any)[__LABEL_LINEAGE__] as readonly string[];\n return !!otherLineage && thisLineage.every((s, i) => s === otherLineage[i]);\n }\n\n /\n Check whether `other` is (or inherits from) the type instance.\n \n Allows 'instanceof' like checks but in instances.\n \n @typeParam T - The instance type.\n * @param this - The instance performing the check.\n * @param other - The object to test.\n * @returns `true` if `other` is the same instance of this type or a subtype.\n /\n isOfType<T>(this: T, other: unknown): other is GetInstance<T> {\n if (!isSigilInstance(other) \|\| !isSigilInstance(this)) return false;\n const otherSet = getConstructor(other)?.[__LABEL_SET__];\n const thisType = getConstructor(this)[__LABEL__];\n return !!otherSet && otherSet.has(thisType);\n }\n\n /\n Strict lineage check: compares the type label lineage arrays element-by-element.\n \n Allows 'instanceof' like checks but in instances.\n \n @typeParam T - The instance type.\n * @param this - The instance performing the check.\n * @param other - The object to test.\n * @returns `true` if `other` has an identical lineage up to the length of this instance's lineage.\n /\n isOfTypeStrict<T>(this: T, other: unknown): other is GetInstance<T> {\n if (!isSigilInstance(other) \|\| !isSigilInstance(this)) return false;\n const otherLineage = getConstructor(other)?.[__LABEL_LINEAGE__];\n const thisLineage = getConstructor(this)?.[__LABEL_LINEAGE__] as readonly string[];\n return !!otherLineage && thisLineage.every((s, i) => s === otherLineage[i]);\n }\n\n /\n Returns the human-readable sigil label of this instance's constructor.\n \n @returns The label string (e.g. '@scope/pkg.ClassName') or '@Sigil.unknown' in DEV when constructor is missing.\n /\n getSigilLabel(): string {\n const ctor = getConstructor(this);\n if (!ctor) {\n if (__DEV__)\n throw new Error(`[Sigil Error] 'Sigilify(${label})' instance without constructor`);\n return '@Sigil.unknown';\n }\n return ctor.SigilLabel;\n }\n\n /\n Returns a copy of the sigil type label lineage for this instance's constructor.\n \n @returns readonly array of labels representing the type lineage.\n /\n getSigilLabelLineage(): readonly string[] {\n const ctor = getConstructor(this);\n if (!ctor) {\n if (__DEV__)\n throw new Error(`[Sigil Error] 'Sigilify(${label})' instance without constructor`);\n return ['@Sigil.unknown'];\n }\n return ctor.SigilLabelLineage;\n }\n\n /\n Returns a readonly copy of the sigil type label set for this instance's constructor.\n \n @returns A Readonly Set of labels representing the type lineage for O(1) membership tests.\n /\n getSigilLabelSet(): Readonly<Set<string>> {\n const ctor = getConstructor(this);\n if (!ctor) {\n if (__DEV__)\n throw new Error(`[Sigil Error] 'Sigilify(${label})' instance without constructor`);\n return new Set(['@Sigil.unknown']);\n }\n return ctor.SigilLabelSet;\n }\n }\n\n // Attach sigil metadata to constructor (registers label, sets labels, marks decorated)\n decorateCtor(Sigilified, l, true);\n\n // Mark the returned constructor as sigil (runtime flag) and as a base.\n markSigil(Sigilified);\n markSigilBase(Sigilified);\n\n return Sigilified;\n}\n","import { Sigilify } from './mixin';\n\n/\n A minimal root Sigil class used by the library as a base identity.\n \n This is produced by `Sigilify` and can serve as a basic sentinel/base\n * class for other sigil classes or for debugging/inspection.\n /\nexport const Sigil = Sigilify(class {}, 'Sigil');\nexport type Sigil = InstanceType<typeof Sigil>;\n\n/\n A sigil variant of the built-in `Error` constructor used by the library\n * to represent Sigil-specific errors.\n \n Use `SigilError` when you want an Error type that is identifiable via sigil\n * runtime checks (e.g. `SigilError.isOfType(someError)`).\n /\nexport const SigilError = Sigilify(Error, 'SigilError');\nexport type SigilError = InstanceType<typeof SigilError>;\n","import {\n checkInheritance,\n decorateCtor,\n generateRandomLabel,\n isSigilCtor,\n verifyLabel,\n} from './helpers';\nimport type { SigilOptions } from './options';\nimport { __DEV__ } from './constants';\n\n/\n Class decorator factory that attaches sigil statics to a class constructor.\n \n Usage:\n * ```ts\n * @WithSigil('@myorg/mypkg.MyClass')\n * class MyClass { ... }\n * ```\n \n The returned decorator:\n * - validates the provided label (via `verifyLabel`)\n * - performs inheritance checks (via `checkInheritance`) in DEV builds\n * - attaches sigil-related statics to the constructor (via `decorateCtor`)\n \n Notes:\n * - This decorator is intended to be applied to classes only. When used\n * incorrectly (e.g. on a property), it is a no-op.\n * - Throws an error during class creation if the label validation fails.\n \n @typeParam L - Narrow string literal type for the provided label.\n * @param label - Optional sigil label to assign to the decorated class (e.g. `@scope/pkg.ClassName`).\n * If not passed a random label is generated instead.\n * @param opts - Options object to override any global options if needed.\n * @returns A class decorator compatible with the ECMAScript decorator context.\n /\nexport function WithSigil<L extends string>(label?: L, opts?: SigilOptions) {\n // generate random label if not passed and verify it\n let l: string;\n if (label) {\n verifyLabel(label, opts);\n l = label;\n } else l = generateRandomLabel();\n\n return function (value: Function, context: any) {\n // Only apply to class declarations\n if (context.kind !== 'class') return;\n if (!isSigilCtor(value))\n throw new Error(\n `[Sigil Error] 'WithSigil' decorator accept only Sigil classes but used on class ${value.name}`\n );\n // Attach sigil metadata to constructor (registers label, sets symbols, marks decorated)\n decorateCtor(value, l);\n // Development-only inheritance checks and potential autofill\n if (__DEV__) checkInheritance(value, opts);\n };\n}\n","import {\n checkInheritance,\n decorateCtor,\n generateRandomLabel,\n isSigilCtor,\n verifyLabel,\n} from './helpers';\nimport type { SigilOptions } from './options';\nimport type { TypedSigil } from './types';\nimport { __DEV__ } from './constants';\n\n/\n HOF (class inhancer) that attaches runtime sigil metadata to Sigil class.\n * Alternative to '@WithSigil' if you prefer HOFs.\n \n This does both:\n * - validate (and autofill) a label,\n * - perform runtime decoration (via `decorateCtor`),\n \n The helper is idempotent: `decorateCtor` will register the label and throw if already\n * decorated; we handle this gracefully in DEV to support HMR flows.\n \n @typeParam S - Constructor type (should be an ISigil).\n * @typeParam L - Label literal to attach.\n * @param Class - The constructor (class) to enhance.\n * @param label - Optional label string. If omitted, a random label is generated.\n * @param opts - Options object to override any global options if needed.\n * @returns The same constructor value, with runtime metadata ensured.\n /\nexport function withSigil<S extends Function, L extends string = string>(\n Class: S,\n label?: L,\n opts?: SigilOptions\n): S {\n if (!isSigilCtor(Class))\n throw new Error(\n `[Sigil Error] 'withSigil' HOF accept only Sigil classes but used on class ${Class?.name ?? 'unknown'}`\n );\n\n // generate random label if not passed and verify it\n let l: string;\n if (label) {\n verifyLabel(label, opts);\n l = label;\n } else l = generateRandomLabel();\n\n // decorate and check inheritance.\n const ctor = Class;\n decorateCtor(ctor, l);\n if (__DEV__) checkInheritance(ctor, opts);\n\n return Class;\n}\n\n/\n Convenience helper that combine 'withSigil' and 'typeSigil'.\n \n This does both:\n * - validate (and autofill) a label,\n * - perform runtime decoration (via `decorateCtor`),\n * - return the constructor typed as `TypedSigil`.\n \n The helper is idempotent: `decorateCtor` will register the label and throw if already\n * decorated; we handle this gracefully in DEV to support HMR flows.\n \n @typeParam S - Constructor type (should be an ISigil).\n * @typeParam L - Label literal to attach.\n * @param Class - The constructor (class) to decorate and type.\n * @param label - Optional label string. If omitted, a random label is generated.\n * @param parent - Optional parent sigil constructor (type-only).\n * @param opts - Options object to override any global options if needed.\n * @returns The same constructor value, with runtime metadata ensured and typed as `TypedSigil<S,L,P>`.\n */\nexport function withSigilTyped<S extends Function, L extends string = string>(\n Class: S,\n label?: L,\n opts?: SigilOptions\n): TypedSigil<S, L> {\n if (!isSigilCtor(Class))\n throw new Error(\n `[Sigil Error] 'withSigilTyped' HOF accept only Sigil classes but used on class ${Class?.name ?? 'unknown'}`\n );\n\n // generate random label if not passed and verify it\n let l: string;\n if (label) {\n verifyLabel(label, opts);\n l = label;\n } else l = generateRandomLabel();\n\n // decorate and check inheritance.\n const ctor = Class;\n decorateCtor(ctor, l);\n if (__DEV__) checkInheritance(ctor, opts);\n\n return Class as unknown as TypedSigil<S, L>;\n}\n"]}
1	+ {"version":3,"sources":["../src/core/options.ts","../src/core/symbols.ts","../node_modules/@noble/hashes/src/_u64.ts","../node_modules/@noble/hashes/src/utils.ts","../node_modules/@noble/hashes/src/sha3.ts","../node_modules/bignumber.js/bignumber.mjs","../node_modules/@paralleldrive/cuid2/src/index.js","../src/core/constants.ts","../src/core/helpers.ts","../src/core/mixin.ts","../src/core/classes.ts","../src/core/decorator.ts","../src/core/enhancers.ts"],"names":["BigNumber","alphabet","compare","format","ctor"],"mappings":";;;;;;;;EAoDO,IAAM,OAAA,GAAkC;EAAA,EAC7C,eAAA,EAAiB,IAAA;EAAA,EACjB,yBAAA,EAA2B,KAAA;EAAA,EAC3B,cAAA,EAAgB;EAClB,CAAA;AAQO,MAAM,aAAA,GAAgB,CAAC,IAAA,KAA6B;EACzD,EAAA,KAAA,MAAW,CAAC,CAAA,EAAG,CAAC,CAAA,IAAK,MAAA,CAAO,OAAA,CAAQ,IAAI,CAAA,EAAI,OAAA,CAAgB,CAAC,CAAA,GAAI,CAAA;EACnE;EAOA,IAAM,eAAA,GAA0C;EAAA,EAC9C,eAAA,EAAiB,IAAA;EAAA,EACjB,yBAAA,EAA2B,KAAA;EAAA,EAC3B,cAAA,EAAgB;EAClB,CAAA;EAGA,aAAA,CAAc,eAAe,CAAA;AAatB,MAAM,mBAAA,GAAsB;;;ECpF5B,IAAM,SAAA,mBAAY,MAAA,CAAO,GAAA,CAAI,kBAAkB,CAAA;EAW/C,IAAM,cAAA,mBAAiB,MAAA,CAAO,GAAA,CAAI,uBAAuB,CAAA;EAWzD,IAAM,aAAA,mBAAgB,MAAA,CAAO,GAAA,CAAI,sBAAsB,CAAA;EAUvD,IAAM,uBAAA,mBAA0B,MAAA,CAAO,GAAA,CAAI,gCAAgC,CAAA;EAU3E,IAAM,SAAA,mBAAY,MAAA,CAAO,GAAA,CAAI,kBAAkB,CAAA;EAU/C,IAAM,iBAAA,mBAAoB,MAAA,CAAO,GAAA,CAAI,0BAA0B,CAAA;EAU/D,IAAM,aAAA,mBAAgB,MAAA,CAAO,GAAA,CAAI,sBAAsB,CAAA;;;EClE9D,IAAM,UAAA,mBAA6B,MAAA,CAAO,CAAA,IAAK,EAAA,GAAK,CAAC,CAAA;EACrD,IAAM,IAAA,0BAA8B,EAAE,CAAA;EAEtC,SAAS,OAAA,CACP,CAAA,EACA,EAAA,GAAK,KAAA,EAAK;EAKV,EAAA,IAAI,EAAA;EAAI,IAAA,OAAO,EAAE,CAAA,EAAG,MAAA,CAAO,CAAA,GAAI,UAAU,CAAA,EAAG,CAAA,EAAG,MAAA,CAAQ,CAAA,IAAK,IAAA,GAAQ,UAAU,CAAA,EAAC;EAC/E,EAAA,OAAO,EAAE,CAAA,EAAG,MAAA,CAAQ,CAAA,IAAK,IAAA,GAAQ,UAAU,CAAA,GAAI,CAAA,EAAG,CAAA,EAAG,MAAA,CAAO,CAAA,GAAI,UAAU,IAAI,CAAA,EAAC;EACjF;EAEA,SAAS,KAAA,CAAM,GAAA,EAAe,EAAA,GAAK,KAAA,EAAK;EACtC,EAAA,MAAM,MAAM,GAAA,CAAI,MAAA;EAChB,EAAA,IAAI,EAAA,GAAK,IAAI,WAAA,CAAY,GAAG,CAAA;EAC5B,EAAA,IAAI,EAAA,GAAK,IAAI,WAAA,CAAY,GAAG,CAAA;EAC5B,EAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,GAAA,EAAK,CAAA,EAAA,EAAK;EAC5B,IAAA,MAAM,EAAE,GAAG,CAAA,EAAC,GAAK,QAAQ,GAAA,CAAI,CAAC,GAAG,EAAE,CAAA;EACnC,IAAA,CAAC,EAAA,CAAG,CAAC,CAAA,EAAG,EAAA,CAAG,CAAC,CAAC,CAAA,GAAI,CAAC,CAAA,EAAG,CAAC,CAAA;EACxB,EAAA;EACA,EAAA,OAAO,CAAC,IAAI,EAAE,CAAA;EAChB;EAgBA,IAAM,MAAA,GAAS,CAAC,CAAA,EAAW,CAAA,EAAW,MAAuB,CAAA,IAAK,CAAA,GAAM,MAAO,EAAA,GAAK,CAAA;EACpF,IAAM,MAAA,GAAS,CAAC,CAAA,EAAW,CAAA,EAAW,MAAuB,CAAA,IAAK,CAAA,GAAM,MAAO,EAAA,GAAK,CAAA;EAEpF,IAAM,MAAA,GAAS,CAAC,CAAA,EAAW,CAAA,EAAW,MAAuB,CAAA,IAAM,CAAA,GAAI,EAAA,GAAQ,CAAA,KAAO,EAAA,GAAK,CAAA;EAC3F,IAAM,MAAA,GAAS,CAAC,CAAA,EAAW,CAAA,EAAW,MAAuB,CAAA,IAAM,CAAA,GAAI,EAAA,GAAQ,CAAA,KAAO,EAAA,GAAK,CAAA;;;EC1CrF,SAAU,QAAQ,CAAA,EAAU;EAChC,EAAA,OAAO,CAAA,YAAa,cAAe,WAAA,CAAY,MAAA,CAAO,CAAC,CAAA,IAAK,CAAA,CAAE,YAAY,IAAA,KAAS,YAAA;EACrF;EAGM,SAAU,OAAA,CAAQ,CAAA,EAAW,KAAA,GAAgB,EAAA,EAAE;EACnD,EAAA,IAAI,CAAC,MAAA,CAAO,aAAA,CAAc,CAAC,CAAA,IAAK,IAAI,CAAA,EAAG;EACrC,IAAA,MAAM,MAAA,GAAS,KAAA,IAAS,CAAA,CAAA,EAAI,KAAK,CAAA,EAAA,CAAA;EACjC,IAAA,MAAM,IAAI,KAAA,CAAM,CAAA,EAAG,MAAM,CAAA,2BAAA,EAA8B,CAAC,CAAA,CAAE,CAAA;EAC5D,EAAA;EACF;EAGM,SAAU,MAAA,CAAO,KAAA,EAAmB,MAAA,EAAiB,KAAA,GAAgB,EAAA,EAAE;EAC3E,EAAA,MAAM,KAAA,GAAQ,QAAQ,KAAK,CAAA;EAC3B,EAAA,MAAM,MAAM,KAAA,IAAA,IAAA,GAAA,MAAA,GAAA,KAAA,CAAO,MAAA;EACnB,EAAA,MAAM,WAAW,MAAA,KAAW,MAAA;EAC5B,EAAA,IAAI,CAAC,KAAA,IAAU,QAAoB,EAAS;EAC1C,IAAA,MAAM,MAAA,GAAS,KAAA,IAAS,CAAA,CAAA,EAAI,KAAK,CAAA,EAAA,CAAA;EACjC,IAAA,MAAM,KAAA,GAA4C,EAAA;EAClD,IAAA,MAAM,MAAM,KAAA,GAAQ,CAAA,OAAA,EAAU,GAAG,CAAA,CAAA,GAAK,CAAA,KAAA,EAAQ,OAAO,KAAK,CAAA,CAAA;EAC1D,IAAA,MAAM,IAAI,KAAA,CAAM,MAAA,GAAS,qBAAA,GAAwB,KAAA,GAAQ,WAAW,GAAG,CAAA;EACzE,EAAA;EACA,EAAA,OAAO,KAAA;EACT;EAWM,SAAU,OAAA,CAAQ,QAAA,EAAe,aAAA,GAAgB,IAAA,EAAI;EACzD,EAAA,IAAI,QAAA,CAAS,SAAA;EAAW,IAAA,MAAM,IAAI,MAAM,kCAAkC,CAAA;EAC1E,EAAA,IAAI,iBAAiB,QAAA,CAAS,QAAA;EAAU,IAAA,MAAM,IAAI,MAAM,uCAAuC,CAAA;EACjG;EAGM,SAAU,OAAA,CAAQ,KAAU,QAAA,EAAa;EAC7C,EAAA,MAAA,CAAO,GAAA,EAAK,QAAW,qBAAqB,CAAA;EAC5C,EAAA,MAAM,MAAM,QAAA,CAAS,SAAA;EACrB,EAAA,IAAI,GAAA,CAAI,SAAS,GAAA,EAAK;EACpB,IAAA,MAAM,IAAI,KAAA,CAAM,mDAAA,GAAsD,GAAG,CAAA;EAC3E,EAAA;EACF;EAaM,SAAU,IAAI,GAAA,EAAe;EACjC,EAAA,OAAO,IAAI,WAAA,CAAY,GAAA,CAAI,MAAA,EAAQ,GAAA,CAAI,UAAA,EAAY,IAAA,CAAK,KAAA,CAAM,GAAA,CAAI,UAAA,GAAa,CAAC,CAAC,CAAA;EACnF;EAGM,SAAU,SAAS,MAAA,EAAoB;EAC3C,EAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,MAAA,CAAO,QAAQ,CAAA,EAAA,EAAK;EACtC,IAAA,MAAA,CAAO,CAAC,CAAA,CAAE,IAAA,CAAK,CAAC,CAAA;EAClB,EAAA;EACF;EAkBO,IAAM,IAAA,mBAAiC,CAAA,MAC5C,IAAI,UAAA,CAAW,IAAI,WAAA,CAAY,CAAC,SAAU,CAAC,CAAA,CAAE,MAAM,CAAA,CAAE,CAAC,MAAM,EAAA,GAAK;EAG7D,SAAU,SAAS,IAAA,EAAY;EACnC,EAAA,OACI,IAAA,IAAQ,EAAA,GAAM,UAAA,GACd,IAAA,IAAQ,CAAA,GAAK,WACb,IAAA,KAAS,CAAA,GAAK,KAAA,GACd,IAAA,KAAS,EAAA,GAAM,GAAA;EAErB;EAOM,SAAU,WAAW,GAAA,EAAgB;EACzC,EAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,GAAA,CAAI,QAAQ,CAAA,EAAA,EAAK;EACnC,IAAA,GAAA,CAAI,CAAC,CAAA,GAAI,QAAA,CAAS,GAAA,CAAI,CAAC,CAAC,CAAA;EAC1B,EAAA;EACA,EAAA,OAAO,GAAA;EACT;EAEO,IAAM,UAAA,GAA8C,IAAA,GACvD,CAAC,CAAA,KAAmB,CAAA,GACpB,UAAA;EAiME,SAAU,YAAA,CACd,QAAA,EACA,IAAA,GAAiB,EAAA,EAAE;EAEnB,EAAA,MAAM,KAAA,GAAa,CAAC,GAAA,EAAiB,IAAA,KAAgB,QAAA,CAAS,IAAI,CAAA,CAAE,MAAA,CAAO,GAAG,CAAA,CAAE,MAAA,EAAM;EACtF,EAAA,MAAM,GAAA,GAAM,SAAS,MAAS,CAAA;EAC9B,EAAA,KAAA,CAAM,YAAY,GAAA,CAAI,SAAA;EACtB,EAAA,KAAA,CAAM,WAAW,GAAA,CAAI,QAAA;EACrB,EAAA,KAAA,CAAM,MAAA,GAAS,CAAC,IAAA,KAAgB,QAAA,CAAS,IAAI,CAAA;EAC7C,EAAA,MAAA,CAAO,MAAA,CAAO,OAAO,IAAI,CAAA;EACzB,EAAA,OAAO,MAAA,CAAO,OAAO,KAAK,CAAA;EAC5B;EAWO,IAAM,OAAA,GAAU,CAAC,MAAA,MAAwC;EAC9D,EAAA,GAAA,EAAK,UAAA,CAAW,IAAA,CAAK,CAAC,CAAA,EAAM,GAAM,EAAA,EAAM,GAAA,EAAM,EAAA,EAAM,CAAA,EAAM,GAAA,EAAM,CAAA,EAAM,CAAA,EAAM,CAAA,EAAM,MAAM,CAAC;;;;ECpT3F,IAAM,GAAA,GAAM,OAAO,CAAC,CAAA;EACpB,IAAM,GAAA,GAAM,OAAO,CAAC,CAAA;EACpB,IAAM,GAAA,GAAM,OAAO,CAAC,CAAA;EACpB,IAAM,GAAA,GAAM,OAAO,CAAC,CAAA;EACpB,IAAM,KAAA,GAAQ,OAAO,GAAG,CAAA;EACxB,IAAM,MAAA,GAAS,OAAO,GAAI,CAAA;EAC1B,IAAM,UAAoB,EAAA;EAC1B,IAAM,YAAsB,EAAA;EAC5B,IAAM,aAAuB,EAAA;EAC7B,KAAA,IAAS,KAAA,GAAQ,CAAA,EAAG,CAAA,GAAI,GAAA,EAAK,CAAA,GAAI,GAAG,CAAA,GAAI,CAAA,EAAG,KAAA,GAAQ,EAAA,EAAI,KAAA,EAAA,EAAS;EAE9D,EAAA,CAAC,CAAA,EAAG,CAAC,CAAA,GAAI,CAAC,IAAI,CAAA,GAAI,CAAA,GAAI,CAAA,GAAI,CAAA,IAAK,CAAC,CAAA;EAChC,EAAA,OAAA,CAAQ,IAAA,CAAK,CAAA,IAAK,CAAA,GAAI,CAAA,GAAI,CAAA,CAAE,CAAA;EAE5B,EAAA,SAAA,CAAU,MAAQ,KAAA,GAAQ,CAAA,KAAM,KAAA,GAAQ,CAAA,CAAA,GAAM,IAAK,EAAE,CAAA;EAErD,EAAA,IAAI,CAAA,GAAI,GAAA;EACR,EAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,CAAA,EAAG,CAAA,EAAA,EAAK;EAC1B,IAAA,CAAA,GAAA,CAAM,CAAA,IAAK,GAAA,GAAA,CAAS,CAAA,IAAK,GAAA,IAAO,MAAA,IAAW,KAAA;EAC3C,IAAA,IAAI,CAAA,GAAI,GAAA;EAAK,MAAA,CAAA,IAAK,GAAA,IAAA,CAAS,GAAA,IAAO,MAAA,CAAO,CAAC,CAAA,IAAK,GAAA;EACjD,EAAA;EACA,EAAA,UAAA,CAAW,KAAK,CAAC,CAAA;EACnB;EACA,IAAM,KAAA,GAAQ,KAAA,CAAM,UAAA,EAAY,IAAI,CAAA;EACpC,IAAM,WAAA,GAAc,MAAM,CAAC,CAAA;EAC3B,IAAM,WAAA,GAAc,MAAM,CAAC,CAAA;EAG3B,IAAM,KAAA,GAAQ,CAAC,CAAA,EAAW,CAAA,EAAW,MAAe,CAAA,GAAI,EAAA,GAAK,MAAA,CAAO,CAAA,EAAG,GAAG,CAAC,CAAA,GAAI,MAAA,CAAO,CAAA,EAAG,GAAG,CAAC,CAAA;EAC7F,IAAM,KAAA,GAAQ,CAAC,CAAA,EAAW,CAAA,EAAW,MAAe,CAAA,GAAI,EAAA,GAAK,MAAA,CAAO,CAAA,EAAG,GAAG,CAAC,CAAA,GAAI,MAAA,CAAO,CAAA,EAAG,GAAG,CAAC,CAAA;EAGvF,SAAU,OAAA,CAAQ,CAAA,EAAgB,MAAA,GAAiB,EAAA,EAAE;EACzD,EAAA,MAAM,CAAA,GAAI,IAAI,WAAA,CAAY,CAAA,GAAI,CAAC,CAAA;EAE/B,EAAA,KAAA,IAAS,KAAA,GAAQ,EAAA,GAAK,MAAA,EAAQ,KAAA,GAAQ,IAAI,KAAA,EAAA,EAAS;EAEjD,IAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,EAAA,EAAI,CAAA,EAAA;EAAK,MAAA,CAAA,CAAE,CAAC,CAAA,GAAI,CAAA,CAAE,CAAC,CAAA,GAAI,CAAA,CAAE,IAAI,EAAE,CAAA,GAAI,EAAE,CAAA,GAAI,EAAE,IAAI,CAAA,CAAE,CAAA,GAAI,EAAE,CAAA,GAAI,CAAA,CAAE,IAAI,EAAE,CAAA;EACvF,IAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,EAAA,EAAI,KAAK,CAAA,EAAG;EAC9B,MAAA,MAAM,IAAA,GAAA,CAAQ,IAAI,CAAA,IAAK,EAAA;EACvB,MAAA,MAAM,IAAA,GAAA,CAAQ,IAAI,CAAA,IAAK,EAAA;EACvB,MAAA,MAAM,EAAA,GAAK,EAAE,IAAI,CAAA;EACjB,MAAA,MAAM,EAAA,GAAK,CAAA,CAAE,IAAA,GAAO,CAAC,CAAA;EACrB,MAAA,MAAM,KAAK,KAAA,CAAM,EAAA,EAAI,IAAI,CAAC,CAAA,GAAI,EAAE,IAAI,CAAA;EACpC,MAAA,MAAM,EAAA,GAAK,MAAM,EAAA,EAAI,EAAA,EAAI,CAAC,CAAA,GAAI,CAAA,CAAE,OAAO,CAAC,CAAA;EACxC,MAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,EAAA,EAAI,KAAK,EAAA,EAAI;EAC/B,QAAA,CAAA,CAAE,CAAA,GAAI,CAAC,CAAA,IAAK,EAAA;EACZ,QAAA,CAAA,CAAE,CAAA,GAAI,CAAA,GAAI,CAAC,CAAA,IAAK,EAAA;EAClB,MAAA;EACF,IAAA;EAEA,IAAA,IAAI,IAAA,GAAO,EAAE,CAAC,CAAA;EACd,IAAA,IAAI,IAAA,GAAO,EAAE,CAAC,CAAA;EACd,IAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,EAAA,EAAI,CAAA,EAAA,EAAK;EAC3B,MAAA,MAAM,KAAA,GAAQ,UAAU,CAAC,CAAA;EACzB,MAAA,MAAM,EAAA,GAAK,KAAA,CAAM,IAAA,EAAM,IAAA,EAAM,KAAK,CAAA;EAClC,MAAA,MAAM,EAAA,GAAK,KAAA,CAAM,IAAA,EAAM,IAAA,EAAM,KAAK,CAAA;EAClC,MAAA,MAAM,EAAA,GAAK,QAAQ,CAAC,CAAA;EACpB,MAAA,IAAA,GAAO,EAAE,EAAE,CAAA;EACX,MAAA,IAAA,GAAO,CAAA,CAAE,KAAK,CAAC,CAAA;EACf,MAAA,CAAA,CAAE,EAAE,CAAA,GAAI,EAAA;EACR,MAAA,CAAA,CAAE,EAAA,GAAK,CAAC,CAAA,GAAI,EAAA;EACd,IAAA;EAEA,IAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,EAAA,EAAI,KAAK,EAAA,EAAI;EAC/B,MAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,EAAA,EAAI,CAAA,EAAA;EAAK,QAAA,CAAA,CAAE,CAAC,CAAA,GAAI,CAAA,CAAE,CAAA,GAAI,CAAC,CAAA;EAC3C,MAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,EAAA,EAAI,CAAA,EAAA;EAAK,QAAA,CAAA,CAAE,CAAA,GAAI,CAAC,CAAA,IAAK,CAAC,CAAA,CAAA,CAAG,CAAA,GAAI,CAAA,IAAK,EAAE,CAAA,GAAI,CAAA,CAAA,CAAG,CAAA,GAAI,CAAA,IAAK,EAAE,CAAA;EAC5E,IAAA;EAEA,IAAA,CAAA,CAAE,CAAC,CAAA,IAAK,WAAA,CAAY,KAAK,CAAA;EACzB,IAAA,CAAA,CAAE,CAAC,CAAA,IAAK,WAAA,CAAY,KAAK,CAAA;EAC3B,EAAA;EACA,EAAA,KAAA,CAAM,CAAC,CAAA;EACT;EAGM,IAAO,MAAA,GAAP,MAAO,OAAA,CAAM;;EAejB,EAAA,WAAA,CACE,UACA,MAAA,EACA,SAAA,EACA,SAAA,GAAY,KAAA,EACZ,SAAiB,EAAA,EAAE;EAnBX,IAAA,aAAA,CAAA,IAAA,EAAA,OAAA,CAAA;EACA,IAAA,aAAA,CAAA,IAAA,EAAA,KAAA,EAAM,CAAA,CAAA;EACN,IAAA,aAAA,CAAA,IAAA,EAAA,QAAA,EAAS,CAAA,CAAA;EACT,IAAA,aAAA,CAAA,IAAA,EAAA,UAAA,EAAW,KAAA,CAAA;EACX,IAAA,aAAA,CAAA,IAAA,EAAA,SAAA,CAAA;EACA,IAAA,aAAA,CAAA,IAAA,EAAA,WAAA,EAAY,KAAA,CAAA;EAEf,IAAA,aAAA,CAAA,IAAA,EAAA,UAAA,CAAA;EACA,IAAA,aAAA,CAAA,IAAA,EAAA,QAAA,CAAA;EACA,IAAA,aAAA,CAAA,IAAA,EAAA,WAAA,CAAA;EACG,IAAA,aAAA,CAAA,IAAA,EAAA,WAAA,EAAY,KAAA,CAAA;EACZ,IAAA,aAAA,CAAA,IAAA,EAAA,QAAA,CAAA;EAUR,IAAA,IAAA,CAAK,QAAA,GAAW,QAAA;EAChB,IAAA,IAAA,CAAK,MAAA,GAAS,MAAA;EACd,IAAA,IAAA,CAAK,SAAA,GAAY,SAAA;EACjB,IAAA,IAAA,CAAK,SAAA,GAAY,SAAA;EACjB,IAAA,IAAA,CAAK,MAAA,GAAS,MAAA;EAEd,IAAA,OAAA,CAAQ,WAAW,WAAW,CAAA;EAG9B,IAAA,IAAI,EAAE,CAAA,GAAI,QAAA,IAAY,QAAA,GAAW,GAAA,CAAA;EAC/B,MAAA,MAAM,IAAI,MAAM,yCAAyC,CAAA;EAC3D,IAAA,IAAA,CAAK,KAAA,GAAQ,IAAI,UAAA,CAAW,GAAG,CAAA;EAC/B,IAAA,IAAA,CAAK,OAAA,GAAU,GAAA,CAAI,IAAA,CAAK,KAAK,CAAA;EAC/B,EAAA;IACA,KAAA,GAAK;EACH,IAAA,OAAO,KAAK,UAAA,EAAU;EACxB,EAAA;IACU,MAAA,GAAM;EACd,IAAA,UAAA,CAAW,KAAK,OAAO,CAAA;EACvB,IAAA,OAAA,CAAQ,IAAA,CAAK,OAAA,EAAS,IAAA,CAAK,MAAM,CAAA;EACjC,IAAA,UAAA,CAAW,KAAK,OAAO,CAAA;EACvB,IAAA,IAAA,CAAK,MAAA,GAAS,CAAA;EACd,IAAA,IAAA,CAAK,GAAA,GAAM,CAAA;EACb,EAAA;EACA,EAAA,MAAA,CAAO,IAAA,EAAgB;EACrB,IAAA,OAAA,CAAQ,IAAI,CAAA;EACZ,IAAA,MAAA,CAAO,IAAI,CAAA;EACX,IAAA,MAAM,EAAE,QAAA,EAAU,KAAA,EAAK,GAAK,IAAA;EAC5B,IAAA,MAAM,MAAM,IAAA,CAAK,MAAA;EACjB,IAAA,KAAA,IAAS,GAAA,GAAM,CAAA,EAAG,GAAA,GAAM,GAAA,IAAO;EAC7B,MAAA,MAAM,OAAO,IAAA,CAAK,GAAA,CAAI,WAAW,IAAA,CAAK,GAAA,EAAK,MAAM,GAAG,CAAA;EACpD,MAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,IAAA,EAAM,CAAA,EAAA;EAAK,QAAA,KAAA,CAAM,IAAA,CAAK,GAAA,EAAK,CAAA,IAAK,IAAA,CAAK,GAAA,EAAK,CAAA;EAC9D,MAAA,IAAI,KAAK,GAAA,KAAQ,QAAA;EAAU,QAAA,IAAA,CAAK,MAAA,EAAM;EACxC,IAAA;EACA,IAAA,OAAO,IAAA;EACT,EAAA;IACU,MAAA,GAAM;EACd,IAAA,IAAI,IAAA,CAAK,QAAA;EAAU,MAAA;EACnB,IAAA,IAAA,CAAK,QAAA,GAAW,IAAA;EAChB,IAAA,MAAM,EAAE,KAAA,EAAO,MAAA,EAAQ,GAAA,EAAK,UAAQ,GAAK,IAAA;EAEzC,IAAA,KAAA,CAAM,GAAG,CAAA,IAAK,MAAA;EACd,IAAA,IAAA,CAAK,MAAA,GAAS,GAAA,MAAU,CAAA,IAAK,GAAA,KAAQ,QAAA,GAAW,CAAA;EAAG,MAAA,IAAA,CAAK,MAAA,EAAM;EAC9D,IAAA,KAAA,CAAM,QAAA,GAAW,CAAC,CAAA,IAAK,GAAA;EACvB,IAAA,IAAA,CAAK,MAAA,EAAM;EACb,EAAA;EACU,EAAA,SAAA,CAAU,GAAA,EAAe;EACjC,IAAA,OAAA,CAAQ,MAAM,KAAK,CAAA;EACnB,IAAA,MAAA,CAAO,GAAG,CAAA;EACV,IAAA,IAAA,CAAK,MAAA,EAAM;EACX,IAAA,MAAM,YAAY,IAAA,CAAK,KAAA;EACvB,IAAA,MAAM,EAAE,UAAQ,GAAK,IAAA;EACrB,IAAA,KAAA,IAAS,MAAM,CAAA,EAAG,GAAA,GAAM,GAAA,CAAI,MAAA,EAAQ,MAAM,GAAA,IAAO;EAC/C,MAAA,IAAI,KAAK,MAAA,IAAU,QAAA;EAAU,QAAA,IAAA,CAAK,MAAA,EAAM;EACxC,MAAA,MAAM,OAAO,IAAA,CAAK,GAAA,CAAI,WAAW,IAAA,CAAK,MAAA,EAAQ,MAAM,GAAG,CAAA;EACvD,MAAA,GAAA,CAAI,GAAA,CAAI,UAAU,QAAA,CAAS,IAAA,CAAK,QAAQ,IAAA,CAAK,MAAA,GAAS,IAAI,CAAA,EAAG,GAAG,CAAA;EAChE,MAAA,IAAA,CAAK,MAAA,IAAU,IAAA;EACf,MAAA,GAAA,IAAO,IAAA;EACT,IAAA;EACA,IAAA,OAAO,GAAA;EACT,EAAA;EACA,EAAA,OAAA,CAAQ,GAAA,EAAe;EAErB,IAAA,IAAI,CAAC,IAAA,CAAK,SAAA;EAAW,MAAA,MAAM,IAAI,MAAM,uCAAuC,CAAA;EAC5E,IAAA,OAAO,IAAA,CAAK,UAAU,GAAG,CAAA;EAC3B,EAAA;EACA,EAAA,GAAA,CAAI,KAAA,EAAa;EACf,IAAA,OAAA,CAAQ,KAAK,CAAA;EACb,IAAA,OAAO,IAAA,CAAK,OAAA,CAAQ,IAAI,UAAA,CAAW,KAAK,CAAC,CAAA;EAC3C,EAAA;EACA,EAAA,UAAA,CAAW,GAAA,EAAe;EACxB,IAAA,OAAA,CAAQ,KAAK,IAAI,CAAA;EACjB,IAAA,IAAI,IAAA,CAAK,QAAA;EAAU,MAAA,MAAM,IAAI,MAAM,6BAA6B,CAAA;EAChE,IAAA,IAAA,CAAK,UAAU,GAAG,CAAA;EAClB,IAAA,IAAA,CAAK,OAAA,EAAO;EACZ,IAAA,OAAO,GAAA;EACT,EAAA;IACA,MAAA,GAAM;EACJ,IAAA,OAAO,KAAK,UAAA,CAAW,IAAI,UAAA,CAAW,IAAA,CAAK,SAAS,CAAC,CAAA;EACvD,EAAA;IACA,OAAA,GAAO;EACL,IAAA,IAAA,CAAK,SAAA,GAAY,IAAA;EACjB,IAAA,KAAA,CAAM,KAAK,KAAK,CAAA;EAClB,EAAA;EACA,EAAA,UAAA,CAAW,EAAA,EAAW;EACpB,IAAA,MAAM,EAAE,QAAA,EAAU,MAAA,EAAQ,SAAA,EAAW,MAAA,EAAQ,WAAS,GAAK,IAAA;EAC3D,IAAA,EAAA,KAAA,EAAA,GAAO,IAAI,OAAA,CAAO,QAAA,EAAU,MAAA,EAAQ,SAAA,EAAW,WAAW,MAAM,CAAA,CAAA;EAChE,IAAA,EAAA,CAAG,OAAA,CAAQ,GAAA,CAAI,IAAA,CAAK,OAAO,CAAA;EAC3B,IAAA,EAAA,CAAG,MAAM,IAAA,CAAK,GAAA;EACd,IAAA,EAAA,CAAG,SAAS,IAAA,CAAK,MAAA;EACjB,IAAA,EAAA,CAAG,WAAW,IAAA,CAAK,QAAA;EACnB,IAAA,EAAA,CAAG,MAAA,GAAS,MAAA;EAEZ,IAAA,EAAA,CAAG,MAAA,GAAS,MAAA;EACZ,IAAA,EAAA,CAAG,SAAA,GAAY,SAAA;EACf,IAAA,EAAA,CAAG,SAAA,GAAY,SAAA;EACf,IAAA,EAAA,CAAG,YAAY,IAAA,CAAK,SAAA;EACpB,IAAA,OAAO,EAAA;EACT,EAAA;;EAGF,IAAM,YAAY,CAAC,MAAA,EAAgB,QAAA,EAAkB,SAAA,EAAmB,OAAiB,EAAA,KACvF,YAAA,CAAa,MAAM,IAAI,MAAA,CAAO,QAAA,EAAU,MAAA,EAAQ,SAAS,GAAG,IAAI,CAAA;EAwB3D,IAAM,QAAA,mBAAkC,SAAA;EAC7C,EAAA,CAAA;EACA,EAAA,EAAA;EACA,EAAA,EAAA;EACgB,kBAAA,OAAA,CAAQ,EAAI;EAAC,CAAA;;;EChN/B,IACE,SAAA,GAAY,4CAAA;EADd,IAEE,WAAW,IAAA,CAAK,IAAA;EAFlB,IAGE,YAAY,IAAA,CAAK,KAAA;EAHnB,IAKE,cAAA,GAAiB,oBAAA;EALnB,IAME,gBAAgB,cAAA,GAAiB,wDAAA;EANnC,IAQE,IAAA,GAAO,IAAA;EART,IASE,QAAA,GAAW,EAAA;EATb,IAUE,gBAAA,GAAmB,gBAAA;EAVrB,IAYE,QAAA,GAAW,CAAC,CAAA,EAAG,EAAA,EAAI,KAAK,GAAA,EAAK,GAAA,EAAK,GAAA,EAAK,GAAA,EAAK,KAAK,GAAA,EAAK,GAAA,EAAK,IAAA,EAAM,IAAA,EAAM,MAAM,IAAI,CAAA;EAZnF,IAaE,SAAA,GAAY,GAAA;EAbd,IAkBE,GAAA,GAAM,GAAA;EAMR,SAAS,MAAM,YAAA,EAAc;EAC3B,EAAA,IAAI,KAAK,WAAA,EAAa,YAAA,EACpB,CAAA,GAAIA,UAAAA,CAAU,YAAY,EAAE,WAAA,EAAaA,UAAAA,EAAW,QAAA,EAAU,MAAM,OAAA,EAAS,IAAA,EAAK,EAClF,GAAA,GAAM,IAAIA,UAAAA,CAAU,CAAC,CAAA,EAUrB,cAAA,GAAiB,IAajB,aAAA,GAAgB,CAAA,EAMhB,UAAA,GAAa,EAAA,EAIb,aAAa,EAAA,EAMb,OAAA,GAAU,IAAA,EAKV,OAAA,GAAU,KAGV,MAAA,GAAS,KAAA,EAkBT,cAAc,CAAA,EAId,aAAA,GAAgB,GAGhB,MAAA,GAAS;EAAA,IACP,MAAA,EAAQ,EAAA;EAAA,IACR,SAAA,EAAW,CAAA;EAAA,IACX,kBAAA,EAAoB,CAAA;EAAA,IACpB,cAAA,EAAgB,GAAA;EAAA,IAChB,gBAAA,EAAkB,GAAA;EAAA,IAClB,iBAAA,EAAmB,CAAA;EAAA,IACnB,sBAAA,EAAwB,MAAA;EAAA;EAAA,IACxB,MAAA,EAAQ;EAAA,GACV,EAKA,QAAA,GAAW,sCAAA,EACX,8BAAA,GAAiC,IAAA;EAgBnC,EAAA,SAASA,UAAAA,CAAU,GAAG,CAAA,EAAG;EACvB,IAAA,IAAIC,SAAAA,EAAU,GAAG,WAAA,EAAa,CAAA,EAAG,GAAG,KAAA,EAAO,GAAA,EAAK,KAC9C,CAAA,GAAI,IAAA;EAGN,IAAA,IAAI,EAAE,CAAA,YAAaD,UAAAA,CAAAA,SAAmB,IAAIA,UAAAA,CAAU,GAAG,CAAC,CAAA;EAExD,IAAA,IAAI,KAAK,IAAA,EAAM;EAEb,MAAA,IAAI,CAAA,IAAK,CAAA,CAAE,YAAA,KAAiB,IAAA,EAAM;EAChC,QAAA,CAAA,CAAE,IAAI,CAAA,CAAE,CAAA;EAER,QAAA,IAAI,CAAC,CAAA,CAAE,CAAA,IAAK,CAAA,CAAE,IAAI,OAAA,EAAS;EACzB,UAAA,CAAA,CAAE,CAAA,GAAI,EAAE,CAAA,GAAI,IAAA;EAAA,QACd,CAAA,MAAA,IAAW,CAAA,CAAE,CAAA,GAAI,OAAA,EAAS;EACxB,UAAA,CAAA,CAAE,CAAA,GAAI,CAAC,CAAA,CAAE,CAAA,GAAI,CAAC,CAAA;EAAA,QAChB,CAAA,MAAO;EACL,UAAA,CAAA,CAAE,IAAI,CAAA,CAAE,CAAA;EACR,UAAA,CAAA,CAAE,CAAA,GAAI,CAAA,CAAE,CAAA,CAAE,KAAA,EAAM;EAAA,QAClB;EAEA,QAAA;EAAA,MACF;EAEA,MAAA,IAAA,CAAK,QAAQ,OAAO,CAAA,IAAK,QAAA,KAAa,CAAA,GAAI,KAAK,CAAA,EAAG;EAGhD,QAAA,CAAA,CAAE,IAAI,CAAA,GAAI,CAAA,GAAI,KAAK,CAAA,GAAI,CAAC,GAAG,EAAA,IAAM,CAAA;EAGjC,QAAA,IAAI,CAAA,KAAM,CAAC,CAAC,CAAA,EAAG;EACb,UAAA,KAAK,CAAA,GAAI,GAAG,CAAA,GAAI,CAAA,EAAG,KAAK,EAAA,EAAI,CAAA,IAAK,IAAI,CAAA,EAAA,EAAI;EAEzC,UAAA,IAAI,IAAI,OAAA,EAAS;EACf,YAAA,CAAA,CAAE,CAAA,GAAI,EAAE,CAAA,GAAI,IAAA;EAAA,UACd,CAAA,MAAO;EACL,YAAA,CAAA,CAAE,CAAA,GAAI,CAAA;EACN,YAAA,CAAA,CAAE,CAAA,GAAI,CAAC,CAAC,CAAA;EAAA,UACV;EAEA,UAAA;EAAA,QACF;EAEA,QAAA,GAAA,GAAM,OAAO,CAAC,CAAA;EAAA,MAChB,CAAA,MAAO;EAEL,QAAA,IAAI,CAAC,SAAA,CAAU,IAAA,CAAK,GAAA,GAAM,MAAA,CAAO,CAAC,CAAC,CAAA,EAAG,OAAO,YAAA,CAAa,CAAA,EAAG,GAAA,EAAK,KAAK,CAAA;EAEvE,QAAA,CAAA,CAAE,CAAA,GAAI,GAAA,CAAI,UAAA,CAAW,CAAC,CAAA,IAAK,EAAA,IAAM,GAAA,GAAM,GAAA,CAAI,KAAA,CAAM,CAAC,CAAA,EAAG,EAAA,IAAM,CAAA;EAAA,MAC7D;EAGA,MAAA,IAAA,CAAK,CAAA,GAAI,GAAA,CAAI,OAAA,CAAQ,GAAG,CAAA,IAAK,IAAI,GAAA,GAAM,GAAA,CAAI,OAAA,CAAQ,GAAA,EAAK,EAAE,CAAA;EAG1D,MAAA,IAAA,CAAK,CAAA,GAAI,GAAA,CAAI,MAAA,CAAO,IAAI,KAAK,CAAA,EAAG;EAG9B,QAAA,IAAI,CAAA,GAAI,GAAG,CAAA,GAAI,CAAA;EACf,QAAA,CAAA,IAAK,CAAC,GAAA,CAAI,KAAA,CAAM,CAAA,GAAI,CAAC,CAAA;EACrB,QAAA,GAAA,GAAM,GAAA,CAAI,SAAA,CAAU,CAAA,EAAG,CAAC,CAAA;EAAA,MAC1B,CAAA,MAAA,IAAW,IAAI,CAAA,EAAG;EAGhB,QAAA,CAAA,GAAI,GAAA,CAAI,MAAA;EAAA,MACV;EAAA,IAEF,CAAA,MAAO;EAGL,MAAA,QAAA,CAAS,CAAA,EAAG,CAAA,EAAG,QAAA,CAAS,MAAA,EAAQ,MAAM,CAAA;EAItC,MAAA,IAAI,CAAA,IAAK,MAAM,8BAAA,EAAgC;EAC7C,QAAA,CAAA,GAAI,IAAIA,WAAU,CAAC,CAAA;EACnB,QAAA,OAAO,MAAM,CAAA,EAAG,cAAA,GAAiB,CAAA,CAAE,CAAA,GAAI,GAAG,aAAa,CAAA;EAAA,MACzD;EAEA,MAAA,GAAA,GAAM,OAAO,CAAC,CAAA;EAEd,MAAA,IAAI,KAAA,GAAQ,OAAO,CAAA,IAAK,QAAA,EAAU;EAGhC,QAAA,IAAI,CAAA,GAAI,KAAK,CAAA,EAAG,OAAO,aAAa,CAAA,EAAG,GAAA,EAAK,OAAO,CAAC,CAAA;EAEpD,QAAA,CAAA,CAAE,CAAA,GAAI,IAAI,CAAA,GAAI,CAAA,IAAK,MAAM,GAAA,CAAI,KAAA,CAAM,CAAC,CAAA,EAAG,EAAA,IAAM,CAAA;EAG7C,QAAA,IAAIA,UAAAA,CAAU,SAAS,GAAA,CAAI,OAAA,CAAQ,aAAa,EAAE,CAAA,CAAE,SAAS,EAAA,EAAI;EAC/D,UAAA,MAAM,KAAA,CACJ,gBAAgB,CAAC,CAAA;EAAA,QACrB;EAAA,MACF,CAAA,MAAO;EACL,QAAA,CAAA,CAAE,CAAA,GAAI,GAAA,CAAI,UAAA,CAAW,CAAC,CAAA,KAAM,EAAA,IAAM,GAAA,GAAM,GAAA,CAAI,KAAA,CAAM,CAAC,CAAA,EAAG,EAAA,IAAM,CAAA;EAAA,MAC9D;EAEA,MAAAC,SAAAA,GAAW,QAAA,CAAS,KAAA,CAAM,CAAA,EAAG,CAAC,CAAA;EAC9B,MAAA,CAAA,GAAI,CAAA,GAAI,CAAA;EAIR,MAAA,KAAK,GAAA,GAAM,GAAA,CAAI,MAAA,EAAQ,CAAA,GAAI,KAAK,CAAA,EAAA,EAAK;EACnC,QAAA,IAAIA,SAAAA,CAAS,QAAQ,CAAA,GAAI,GAAA,CAAI,OAAO,CAAC,CAAC,IAAI,CAAA,EAAG;EAC3C,UAAA,IAAI,KAAK,GAAA,EAAK;EAGZ,YAAA,IAAI,IAAI,CAAA,EAAG;EACT,cAAA,CAAA,GAAI,GAAA;EACJ,cAAA;EAAA,YACF;EAAA,UACF,CAAA,MAAA,IAAW,CAAC,WAAA,EAAa;EAGvB,YAAA,IAAI,GAAA,IAAO,GAAA,CAAI,WAAA,EAAY,KAAM,MAAM,GAAA,CAAI,WAAA,EAAY,CAAA,IACnD,GAAA,IAAO,IAAI,WAAA,EAAY,KAAM,GAAA,GAAM,GAAA,CAAI,aAAY,CAAA,EAAI;EACzD,cAAA,WAAA,GAAc,IAAA;EACd,cAAA,CAAA,GAAI,EAAA;EACJ,cAAA,CAAA,GAAI,CAAA;EACJ,cAAA;EAAA,YACF;EAAA,UACF;EAEA,UAAA,OAAO,aAAa,CAAA,EAAG,MAAA,CAAO,CAAC,CAAA,EAAG,OAAO,CAAC,CAAA;EAAA,QAC5C;EAAA,MACF;EAGA,MAAA,KAAA,GAAQ,KAAA;EACR,MAAA,GAAA,GAAM,WAAA,CAAY,GAAA,EAAK,CAAA,EAAG,EAAA,EAAI,EAAE,CAAC,CAAA;EAGjC,MAAA,IAAA,CAAK,CAAA,GAAI,GAAA,CAAI,OAAA,CAAQ,GAAG,CAAA,IAAK,IAAI,GAAA,GAAM,GAAA,CAAI,OAAA,CAAQ,GAAA,EAAK,EAAE,CAAA;EAAA,eACjD,GAAA,CAAI,MAAA;EAAA,IACf;EAGA,IAAA,KAAK,IAAI,CAAA,EAAG,GAAA,CAAI,WAAW,CAAC,CAAA,KAAM,IAAI,CAAA,EAAA,EAAI;EAG1C,IAAA,KAAK,GAAA,GAAM,IAAI,MAAA,EAAQ,GAAA,CAAI,WAAW,EAAE,GAAG,MAAM,EAAA,IAAI;EAErD,IAAA,IAAI,MAAM,GAAA,CAAI,KAAA,CAAM,CAAA,EAAG,EAAE,GAAG,CAAA,EAAG;EAC7B,MAAA,GAAA,IAAO,CAAA;EAGP,MAAA,IAAI,KAAA,IAASD,UAAAA,CAAU,KAAA,IACrB,GAAA,GAAM,EAAA,KAAO,IAAI,gBAAA,IAAoB,CAAA,KAAM,SAAA,CAAU,CAAC,CAAA,CAAA,EAAI;EACxD,QAAA,MAAM,KAAA,CACJ,aAAA,GAAiB,CAAA,CAAE,CAAA,GAAI,CAAE,CAAA;EAAA,MAC/B;EAGA,MAAA,IAAA,CAAK,CAAA,GAAI,CAAA,GAAI,CAAA,GAAI,CAAA,IAAK,OAAA,EAAS;EAG7B,QAAA,CAAA,CAAE,CAAA,GAAI,EAAE,CAAA,GAAI,IAAA;EAAA,MAGd,CAAA,MAAA,IAAW,IAAI,OAAA,EAAS;EAGtB,QAAA,CAAA,CAAE,CAAA,GAAI,CAAC,CAAA,CAAE,CAAA,GAAI,CAAC,CAAA;EAAA,MAChB,CAAA,MAAO;EACL,QAAA,CAAA,CAAE,CAAA,GAAI,CAAA;EACN,QAAA,CAAA,CAAE,IAAI,EAAC;EAMP,QAAA,CAAA,GAAA,CAAK,IAAI,CAAA,IAAK,QAAA;EACd,QAAA,IAAI,CAAA,GAAI,GAAG,CAAA,IAAK,QAAA;EAEhB,QAAA,IAAI,IAAI,GAAA,EAAK;EACX,UAAA,IAAI,CAAA,IAAK,CAAA,CAAE,IAAA,CAAK,CAAC,GAAA,CAAI,KAAA,CAAM,CAAA,EAAG,CAAC,CAAC,CAAA;EAEhC,UAAA,KAAK,GAAA,IAAO,QAAA,EAAU,CAAA,GAAI,GAAA,IAAM;EAC9B,YAAA,CAAA,CAAE,CAAA,CAAE,KAAK,CAAC,GAAA,CAAI,MAAM,CAAA,EAAG,CAAA,IAAK,QAAQ,CAAC,CAAA;EAAA,UACvC;EAEA,UAAA,CAAA,GAAI,QAAA,GAAA,CAAY,GAAA,GAAM,GAAA,CAAI,KAAA,CAAM,CAAC,CAAA,EAAG,MAAA;EAAA,QACtC,CAAA,MAAO;EACL,UAAA,CAAA,IAAK,GAAA;EAAA,QACP;EAEA,QAAA,OAAO,CAAA,EAAA,EAAK,OAAO,GAAA,EAAI;EACvB,QAAA,CAAA,CAAE,CAAA,CAAE,IAAA,CAAK,CAAC,GAAG,CAAA;EAAA,MACf;EAAA,IACF,CAAA,MAAO;EAGL,MAAA,CAAA,CAAE,CAAA,GAAI,CAAC,CAAA,CAAE,CAAA,GAAI,CAAC,CAAA;EAAA,IAChB;EAAA,EACF;EAMA,EAAAA,WAAU,KAAA,GAAQ,KAAA;EAElB,EAAAA,WAAU,QAAA,GAAW,CAAA;EACrB,EAAAA,WAAU,UAAA,GAAa,CAAA;EACvB,EAAAA,WAAU,UAAA,GAAa,CAAA;EACvB,EAAAA,WAAU,WAAA,GAAc,CAAA;EACxB,EAAAA,WAAU,aAAA,GAAgB,CAAA;EAC1B,EAAAA,WAAU,eAAA,GAAkB,CAAA;EAC5B,EAAAA,WAAU,eAAA,GAAkB,CAAA;EAC5B,EAAAA,WAAU,eAAA,GAAkB,CAAA;EAC5B,EAAAA,WAAU,gBAAA,GAAmB,CAAA;EAC7B,EAAAA,WAAU,MAAA,GAAS,CAAA;EAqCnB,EAAAA,UAAAA,CAAU,MAAA,GAASA,UAAAA,CAAU,GAAA,GAAM,SAAU,GAAA,EAAK;EAChD,IAAA,IAAI,CAAA,EAAG,CAAA;EAEP,IAAA,IAAI,OAAO,IAAA,EAAM;EAEf,MAAA,IAAI,OAAO,OAAO,QAAA,EAAU;EAI1B,QAAA,IAAI,GAAA,CAAI,cAAA,CAAe,CAAA,GAAI,gBAAgB,CAAA,EAAG;EAC5C,UAAA,CAAA,GAAI,IAAI,CAAC,CAAA;EACT,UAAA,QAAA,CAAS,CAAA,EAAG,CAAA,EAAG,GAAA,EAAK,CAAC,CAAA;EACrB,UAAA,cAAA,GAAiB,CAAA;EAAA,QACnB;EAIA,QAAA,IAAI,GAAA,CAAI,cAAA,CAAe,CAAA,GAAI,eAAe,CAAA,EAAG;EAC3C,UAAA,CAAA,GAAI,IAAI,CAAC,CAAA;EACT,UAAA,QAAA,CAAS,CAAA,EAAG,CAAA,EAAG,CAAA,EAAG,CAAC,CAAA;EACnB,UAAA,aAAA,GAAgB,CAAA;EAAA,QAClB;EAMA,QAAA,IAAI,GAAA,CAAI,cAAA,CAAe,CAAA,GAAI,gBAAgB,CAAA,EAAG;EAC5C,UAAA,CAAA,GAAI,IAAI,CAAC,CAAA;EACT,UAAA,IAAI,CAAA,IAAK,EAAE,GAAA,EAAK;EACd,YAAA,QAAA,CAAS,EAAE,CAAC,CAAA,EAAG,CAAC,GAAA,EAAK,GAAG,CAAC,CAAA;EACzB,YAAA,QAAA,CAAS,CAAA,CAAE,CAAC,CAAA,EAAG,CAAA,EAAG,KAAK,CAAC,CAAA;EACxB,YAAA,UAAA,GAAa,EAAE,CAAC,CAAA;EAChB,YAAA,UAAA,GAAa,EAAE,CAAC,CAAA;EAAA,UAClB,CAAA,MAAO;EACL,YAAA,QAAA,CAAS,CAAA,EAAG,CAAC,GAAA,EAAK,GAAA,EAAK,CAAC,CAAA;EACxB,YAAA,UAAA,GAAa,EAAE,UAAA,GAAa,CAAA,GAAI,CAAA,GAAI,CAAC,CAAA,GAAI,CAAA,CAAA;EAAA,UAC3C;EAAA,QACF;EAKA,QAAA,IAAI,GAAA,CAAI,cAAA,CAAe,CAAA,GAAI,OAAO,CAAA,EAAG;EACnC,UAAA,CAAA,GAAI,IAAI,CAAC,CAAA;EACT,UAAA,IAAI,CAAA,IAAK,EAAE,GAAA,EAAK;EACd,YAAA,QAAA,CAAS,EAAE,CAAC,CAAA,EAAG,CAAC,GAAA,EAAK,IAAI,CAAC,CAAA;EAC1B,YAAA,QAAA,CAAS,CAAA,CAAE,CAAC,CAAA,EAAG,CAAA,EAAG,KAAK,CAAC,CAAA;EACxB,YAAA,OAAA,GAAU,EAAE,CAAC,CAAA;EACb,YAAA,OAAA,GAAU,EAAE,CAAC,CAAA;EAAA,UACf,CAAA,MAAO;EACL,YAAA,QAAA,CAAS,CAAA,EAAG,CAAC,GAAA,EAAK,GAAA,EAAK,CAAC,CAAA;EACxB,YAAA,IAAI,CAAA,EAAG;EACL,cAAA,OAAA,GAAU,EAAE,OAAA,GAAU,CAAA,GAAI,CAAA,GAAI,CAAC,CAAA,GAAI,CAAA,CAAA;EAAA,YACrC,CAAA,MAAO;EACL,cAAA,MAAM,KAAA,CACJ,cAAA,GAAiB,CAAA,GAAI,mBAAA,GAAsB,CAAC,CAAA;EAAA,YAChD;EAAA,UACF;EAAA,QACF;EAKA,QAAA,IAAI,GAAA,CAAI,cAAA,CAAe,CAAA,GAAI,QAAQ,CAAA,EAAG;EACpC,UAAA,CAAA,GAAI,IAAI,CAAC,CAAA;EACT,UAAA,IAAI,CAAA,KAAM,CAAC,CAAC,CAAA,EAAG;EACb,YAAA,IAAI,CAAA,EAAG;EACL,cAAA,IAAI,OAAO,MAAA,IAAU,WAAA,IAAe,WAClC,MAAA,CAAO,eAAA,IAAmB,OAAO,WAAA,CAAA,EAAc;EAC/C,gBAAA,MAAA,GAAS,CAAA;EAAA,cACX,CAAA,MAAO;EACL,gBAAA,MAAA,GAAS,CAAC,CAAA;EACV,gBAAA,MAAM,KAAA,CACJ,iBAAiB,oBAAoB,CAAA;EAAA,cACzC;EAAA,YACF,CAAA,MAAO;EACL,cAAA,MAAA,GAAS,CAAA;EAAA,YACX;EAAA,UACF,CAAA,MAAO;EACL,YAAA,MAAM,KAAA,CACJ,cAAA,GAAiB,CAAA,GAAI,sBAAA,GAAyB,CAAC,CAAA;EAAA,UACnD;EAAA,QACF;EAIA,QAAA,IAAI,GAAA,CAAI,cAAA,CAAe,CAAA,GAAI,aAAa,CAAA,EAAG;EACzC,UAAA,CAAA,GAAI,IAAI,CAAC,CAAA;EACT,UAAA,QAAA,CAAS,CAAA,EAAG,CAAA,EAAG,CAAA,EAAG,CAAC,CAAA;EACnB,UAAA,WAAA,GAAc,CAAA;EAAA,QAChB;EAIA,QAAA,IAAI,GAAA,CAAI,cAAA,CAAe,CAAA,GAAI,eAAe,CAAA,EAAG;EAC3C,UAAA,CAAA,GAAI,IAAI,CAAC,CAAA;EACT,UAAA,QAAA,CAAS,CAAA,EAAG,CAAA,EAAG,GAAA,EAAK,CAAC,CAAA;EACrB,UAAA,aAAA,GAAgB,CAAA;EAAA,QAClB;EAIA,QAAA,IAAI,GAAA,CAAI,cAAA,CAAe,CAAA,GAAI,QAAQ,CAAA,EAAG;EACpC,UAAA,CAAA,GAAI,IAAI,CAAC,CAAA;EACT,UAAA,IAAI,OAAO,CAAA,IAAK,QAAA,EAAU,MAAA,GAAS,CAAA;EAAA,eAC9B,MAAM,KAAA,CACT,cAAA,GAAiB,CAAA,GAAI,qBAAqB,CAAC,CAAA;EAAA,QAC/C;EAIA,QAAA,IAAI,GAAA,CAAI,cAAA,CAAe,CAAA,GAAI,UAAU,CAAA,EAAG;EACtC,UAAA,CAAA,GAAI,IAAI,CAAC,CAAA;EAIT,UAAA,IAAI,OAAO,CAAA,IAAK,QAAA,IAAY,CAAC,uBAAA,CAAwB,IAAA,CAAK,CAAC,CAAA,EAAG;EAC5D,YAAA,8BAAA,GAAiC,CAAA,CAAE,KAAA,CAAM,CAAA,EAAG,EAAE,CAAA,IAAK,YAAA;EACnD,YAAA,QAAA,GAAW,CAAA;EAAA,UACb,CAAA,MAAO;EACL,YAAA,MAAM,KAAA,CACJ,cAAA,GAAiB,CAAA,GAAI,YAAA,GAAe,CAAC,CAAA;EAAA,UACzC;EAAA,QACF;EAAA,MAEF,CAAA,MAAO;EAGL,QAAA,MAAM,KAAA,CACJ,cAAA,GAAiB,mBAAA,GAAsB,GAAG,CAAA;EAAA,MAC9C;EAAA,IACF;EAEA,IAAA,OAAO;EAAA,MACL,cAAA;EAAA,MACA,aAAA;EAAA,MACA,cAAA,EAAgB,CAAC,UAAA,EAAY,UAAU,CAAA;EAAA,MACvC,KAAA,EAAO,CAAC,OAAA,EAAS,OAAO,CAAA;EAAA,MACxB,MAAA;EAAA,MACA,WAAA;EAAA,MACA,aAAA;EAAA,MACA,MAAA;EAAA,MACA;EAAA,KACF;EAAA,EACF,CAAA;EAYA,EAAAA,UAAAA,CAAU,WAAA,GAAc,SAAU,CAAA,EAAG;EACnC,IAAA,IAAI,CAAC,CAAA,IAAK,CAAA,CAAE,YAAA,KAAiB,MAAM,OAAO,KAAA;EAC1C,IAAA,IAAI,CAACA,UAAAA,CAAU,KAAA,EAAO,OAAO,IAAA;EAE7B,IAAA,IAAI,CAAA,EAAG,GACL,CAAA,GAAI,CAAA,CAAE,GACN,CAAA,GAAI,CAAA,CAAE,CAAA,EACN,CAAA,GAAI,CAAA,CAAE,CAAA;EAER,IAAA,GAAA,MAAS,EAAC,CAAE,SAAS,IAAA,CAAK,CAAC,KAAK,gBAAA,EAAkB;EAEhD,MAAA,IAAA,CAAK,CAAA,KAAM,CAAA,IAAK,CAAA,KAAM,EAAA,KAAO,CAAA,IAAK,CAAC,GAAA,IAAO,CAAA,IAAK,GAAA,IAAO,CAAA,KAAM,SAAA,CAAU,CAAC,CAAA,EAAG;EAGxE,QAAA,IAAI,CAAA,CAAE,CAAC,CAAA,KAAM,CAAA,EAAG;EACd,UAAA,IAAI,CAAA,KAAM,CAAA,IAAK,CAAA,CAAE,MAAA,KAAW,GAAG,OAAO,IAAA;EACtC,UAAA,MAAM,GAAA;EAAA,QACR;EAGA,QAAA,CAAA,GAAA,CAAK,IAAI,CAAA,IAAK,QAAA;EACd,QAAA,IAAI,CAAA,GAAI,GAAG,CAAA,IAAK,QAAA;EAIhB,QAAA,IAAI,OAAO,CAAA,CAAE,CAAC,CAAC,CAAA,CAAE,UAAU,CAAA,EAAG;EAE5B,UAAA,KAAK,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,CAAA,CAAE,QAAQ,CAAA,EAAA,EAAK;EAC7B,YAAA,CAAA,GAAI,EAAE,CAAC,CAAA;EACP,YAAA,IAAI,CAAA,GAAI,KAAK,CAAA,IAAK,IAAA,IAAQ,MAAM,SAAA,CAAU,CAAC,GAAG,MAAM,GAAA;EAAA,UACtD;EAGA,UAAA,IAAI,CAAA,KAAM,GAAG,OAAO,IAAA;EAAA,QACtB;EAAA,MACF;EAAA,IAGF,CAAA,MAAA,IAAW,CAAA,KAAM,IAAA,IAAQ,CAAA,KAAM,IAAA,KAAS,MAAM,IAAA,IAAQ,CAAA,KAAM,CAAA,IAAK,CAAA,KAAM,EAAA,CAAA,EAAK;EAC1E,MAAA,OAAO,IAAA;EAAA,IACT;EAEA,IAAA,MAAM,KAAA,CACH,cAAA,GAAiB,qBAAA,GAAwB,CAAC,CAAA;EAAA,EAC/C,CAAA;EAQA,EAAAA,UAAAA,CAAU,OAAA,GAAUA,UAAAA,CAAU,GAAA,GAAM,WAAY;EAC9C,IAAA,OAAO,QAAA,CAAS,WAAW,EAAE,CAAA;EAAA,EAC/B,CAAA;EAQA,EAAAA,UAAAA,CAAU,OAAA,GAAUA,UAAAA,CAAU,GAAA,GAAM,WAAY;EAC9C,IAAA,OAAO,QAAA,CAAS,WAAW,CAAC,CAAA;EAAA,EAC9B,CAAA;EAaA,EAAAA,UAAAA,CAAU,UAAU,WAAY;EAC9B,IAAA,IAAI,OAAA,GAAU,gBAAA;EAMd,IAAA,IAAI,iBAAkB,IAAA,CAAK,MAAA,EAAO,GAAI,OAAA,GAAW,UAC9C,WAAY;EAAE,MAAA,OAAO,SAAA,CAAU,IAAA,CAAK,MAAA,EAAO,GAAI,OAAO,CAAA;EAAA,IAAG,IACzD,WAAY;EAAE,MAAA,OAAA,CAAS,IAAA,CAAK,QAAO,GAAI,UAAA,GAAa,KAAK,OAAA,IACxD,IAAA,CAAK,MAAA,EAAO,GAAI,OAAA,GAAW,CAAA,CAAA;EAAA,IAAI,CAAA;EAEnC,IAAA,OAAO,SAAU,EAAA,EAAI;EACnB,MAAA,IAAI,CAAA,EAAG,CAAA,EAAG,CAAA,EAAG,CAAA,EAAG,CAAA,EACd,CAAA,GAAI,CAAA,EACJ,CAAA,GAAI,EAAC,EACL,IAAA,GAAO,IAAIA,WAAU,GAAG,CAAA;EAE1B,MAAA,IAAI,EAAA,IAAM,MAAM,EAAA,GAAK,cAAA;EAAA,WAChB,QAAA,CAAS,EAAA,EAAI,CAAA,EAAG,GAAG,CAAA;EAExB,MAAA,CAAA,GAAI,QAAA,CAAS,KAAK,QAAQ,CAAA;EAE1B,MAAA,IAAI,MAAA,EAAQ;EAGV,QAAA,IAAI,OAAO,eAAA,EAAiB;EAE1B,UAAA,CAAA,GAAI,OAAO,eAAA,CAAgB,IAAI,WAAA,CAAY,CAAA,IAAK,CAAC,CAAC,CAAA;EAElD,UAAA,OAAO,IAAI,CAAA,IAAI;EAQb,YAAA,CAAA,GAAI,EAAE,CAAC,CAAA,GAAI,UAAW,CAAA,CAAE,CAAA,GAAI,CAAC,CAAA,KAAM,EAAA,CAAA;EAMnC,YAAA,IAAI,KAAK,IAAA,EAAM;EACb,cAAA,CAAA,GAAI,MAAA,CAAO,eAAA,CAAgB,IAAI,WAAA,CAAY,CAAC,CAAC,CAAA;EAC7C,cAAA,CAAA,CAAE,CAAC,CAAA,GAAI,CAAA,CAAE,CAAC,CAAA;EACV,cAAA,CAAA,CAAE,CAAA,GAAI,CAAC,CAAA,GAAI,CAAA,CAAE,CAAC,CAAA;EAAA,YAChB,CAAA,MAAO;EAIL,cAAA,CAAA,CAAE,IAAA,CAAK,IAAI,IAAI,CAAA;EACf,cAAA,CAAA,IAAK,CAAA;EAAA,YACP;EAAA,UACF;EACA,UAAA,CAAA,GAAI,CAAA,GAAI,CAAA;EAAA,QAGV,CAAA,MAAA,IAAW,OAAO,WAAA,EAAa;EAG7B,UAAA,CAAA,GAAI,MAAA,CAAO,WAAA,CAAY,CAAA,IAAK,CAAC,CAAA;EAE7B,UAAA,OAAO,IAAI,CAAA,IAAI;EAMb,YAAA,CAAA,GAAA,CAAM,CAAA,CAAE,CAAC,CAAA,GAAI,EAAA,IAAM,kBAAoB,CAAA,CAAE,CAAA,GAAI,CAAC,CAAA,GAAI,aAAA,GAC9C,CAAA,CAAE,CAAA,GAAI,CAAC,IAAI,UAAA,GAAgB,CAAA,CAAE,CAAA,GAAI,CAAC,CAAA,GAAI,QAAA,IACtC,CAAA,CAAE,CAAA,GAAI,CAAC,CAAA,IAAK,EAAA,CAAA,IAAO,CAAA,CAAE,CAAA,GAAI,CAAC,CAAA,IAAK,CAAA,CAAA,GAAK,CAAA,CAAE,IAAI,CAAC,CAAA;EAE/C,YAAA,IAAI,KAAK,IAAA,EAAM;EACb,cAAA,MAAA,CAAO,WAAA,CAAY,CAAC,CAAA,CAAE,IAAA,CAAK,GAAG,CAAC,CAAA;EAAA,YACjC,CAAA,MAAO;EAGL,cAAA,CAAA,CAAE,IAAA,CAAK,IAAI,IAAI,CAAA;EACf,cAAA,CAAA,IAAK,CAAA;EAAA,YACP;EAAA,UACF;EACA,UAAA,CAAA,GAAI,CAAA,GAAI,CAAA;EAAA,QACV,CAAA,MAAO;EACL,UAAA,MAAA,GAAS,KAAA;EACT,UAAA,MAAM,KAAA,CACJ,iBAAiB,oBAAoB,CAAA;EAAA,QACzC;EAAA,MACF;EAGA,MAAA,IAAI,CAAC,MAAA,EAAQ;EAEX,QAAA,OAAO,IAAI,CAAA,IAAI;EACb,UAAA,CAAA,GAAI,cAAA,EAAe;EACnB,UAAA,IAAI,CAAA,GAAI,IAAA,EAAM,CAAA,CAAE,CAAA,EAAG,IAAI,CAAA,GAAI,IAAA;EAAA,QAC7B;EAAA,MACF;EAEA,MAAA,CAAA,GAAI,CAAA,CAAE,EAAE,CAAC,CAAA;EACT,MAAA,EAAA,IAAM,QAAA;EAGN,MAAA,IAAI,KAAK,EAAA,EAAI;EACX,QAAA,CAAA,GAAI,QAAA,CAAS,WAAW,EAAE,CAAA;EAC1B,QAAA,CAAA,CAAE,CAAC,CAAA,GAAI,SAAA,CAAU,CAAA,GAAI,CAAC,CAAA,GAAI,CAAA;EAAA,MAC5B;EAGA,MAAA,OAAO,EAAE,CAAC,CAAA,KAAM,GAAG,CAAA,CAAE,GAAA,IAAO,CAAA,EAAA,EAAI;EAGhC,MAAA,IAAI,IAAI,CAAA,EAAG;EACT,QAAA,CAAA,GAAI,CAAC,IAAI,CAAC,CAAA;EAAA,MACZ,CAAA,MAAO;EAGL,QAAA,KAAK,CAAA,GAAI,EAAA,EAAK,CAAA,CAAE,CAAC,CAAA,KAAM,CAAA,EAAG,CAAA,CAAE,MAAA,CAAO,CAAA,EAAG,CAAC,CAAA,EAAG,CAAA,IAAK,QAAA,EAAS;EAGxD,QAAA,KAAK,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,CAAA,CAAE,CAAC,GAAG,CAAA,IAAK,EAAA,EAAI,CAAA,IAAK,EAAA,EAAI,CAAA,EAAA,EAAI;EAG5C,QAAA,IAAI,CAAA,GAAI,QAAA,EAAU,CAAA,IAAK,QAAA,GAAW,CAAA;EAAA,MACpC;EAEA,MAAA,IAAA,CAAK,CAAA,GAAI,CAAA;EACT,MAAA,IAAA,CAAK,CAAA,GAAI,CAAA;EACT,MAAA,OAAO,IAAA;EAAA,IACT,CAAA;EAAA,EACF,CAAA,GAAG;EAQH,EAAAA,UAAAA,CAAU,MAAM,WAAY;EAC1B,IAAA,IAAI,CAAA,GAAI,GACN,IAAA,GAAO,SAAA,EACP,MAAM,IAAIA,UAAAA,CAAU,IAAA,CAAK,CAAC,CAAC,CAAA;EAC7B,IAAA,OAAO,CAAA,GAAI,KAAK,MAAA,IAAS,GAAA,GAAM,IAAI,IAAA,CAAK,IAAA,CAAK,GAAG,CAAC,CAAA;EACjD,IAAA,OAAO,GAAA;EAAA,EACT,CAAA;EAOA,EAAA,WAAA,mBAAe,CAAA,WAAY;EACzB,IAAA,IAAI,OAAA,GAAU,YAAA;EAOd,IAAA,SAAS,SAAA,CAAU,GAAA,EAAK,MAAA,EAAQ,OAAA,EAASC,SAAAA,EAAU;EACjD,MAAA,IAAI,CAAA,EACF,MAAM,CAAC,CAAC,GACR,IAAA,EACA,CAAA,GAAI,CAAA,EACJ,GAAA,GAAM,GAAA,CAAI,MAAA;EAEZ,MAAA,OAAO,IAAI,GAAA,IAAM;EACf,QAAA,KAAK,OAAO,GAAA,CAAI,MAAA,EAAQ,QAAQ,GAAA,CAAI,IAAI,KAAK,MAAA,EAAO;EAEpD,QAAA,GAAA,CAAI,CAAC,CAAA,IAAKA,SAAAA,CAAS,QAAQ,GAAA,CAAI,MAAA,CAAO,GAAG,CAAC,CAAA;EAE1C,QAAA,KAAK,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,GAAA,CAAI,QAAQ,CAAA,EAAA,EAAK;EAE/B,UAAA,IAAI,GAAA,CAAI,CAAC,CAAA,GAAI,OAAA,GAAU,CAAA,EAAG;EACxB,YAAA,IAAI,GAAA,CAAI,IAAI,CAAC,CAAA,IAAK,MAAM,GAAA,CAAI,CAAA,GAAI,CAAC,CAAA,GAAI,CAAA;EACrC,YAAA,GAAA,CAAI,IAAI,CAAC,CAAA,IAAK,GAAA,CAAI,CAAC,IAAI,OAAA,GAAU,CAAA;EACjC,YAAA,GAAA,CAAI,CAAC,CAAA,IAAK,OAAA;EAAA,UACZ;EAAA,QACF;EAAA,MACF;EAEA,MAAA,OAAO,IAAI,OAAA,EAAQ;EAAA,IACrB;EAKA,IAAA,OAAO,SAAU,GAAA,EAAK,MAAA,EAAQ,OAAA,EAAS,MAAM,gBAAA,EAAkB;EAC7D,MAAA,IAAIA,SAAAA,EAAU,CAAA,EAAG,CAAA,EAAG,CAAA,EAAG,GAAG,CAAA,EAAG,EAAA,EAAI,CAAA,EAC/B,CAAA,GAAI,IAAI,OAAA,CAAQ,GAAG,CAAA,EACnB,EAAA,GAAK,gBACL,EAAA,GAAK,aAAA;EAGP,MAAA,IAAI,KAAK,CAAA,EAAG;EACV,QAAA,CAAA,GAAI,aAAA;EAGJ,QAAA,aAAA,GAAgB,CAAA;EAChB,QAAA,GAAA,GAAM,GAAA,CAAI,OAAA,CAAQ,GAAA,EAAK,EAAE,CAAA;EACzB,QAAA,CAAA,GAAI,IAAID,WAAU,MAAM,CAAA;EACxB,QAAA,CAAA,GAAI,CAAA,CAAE,GAAA,CAAI,GAAA,CAAI,MAAA,GAAS,CAAC,CAAA;EACxB,QAAA,aAAA,GAAgB,CAAA;EAKhB,QAAA,CAAA,CAAE,CAAA,GAAI,SAAA;EAAA,UAAU,aAAa,aAAA,CAAc,CAAA,CAAE,CAAC,CAAA,EAAG,CAAA,CAAE,GAAG,GAAG,CAAA;EAAA,UACxD,EAAA;EAAA,UAAI,OAAA;EAAA,UAAS;EAAA,SAAO;EACrB,QAAA,CAAA,CAAE,CAAA,GAAI,EAAE,CAAA,CAAE,MAAA;EAAA,MACZ;EAIA,MAAA,EAAA,GAAK,SAAA,CAAU,GAAA,EAAK,MAAA,EAAQ,OAAA,EAAS,gBAAA,IACjCC,YAAW,QAAA,EAAU,OAAA,KACrBA,SAAAA,GAAW,OAAA,EAAS,QAAA,CAAS,CAAA;EAGjC,MAAA,CAAA,GAAI,IAAI,EAAA,CAAG,MAAA;EAGX,MAAA,OAAO,GAAG,EAAE,CAAC,KAAK,CAAA,EAAG,EAAA,CAAG,KAAI,EAAE;EAG9B,MAAA,IAAI,CAAC,EAAA,CAAG,CAAC,GAAG,OAAOA,SAAAA,CAAS,OAAO,CAAC,CAAA;EAGpC,MAAA,IAAI,IAAI,CAAA,EAAG;EACT,QAAA,EAAE,CAAA;EAAA,MACJ,CAAA,MAAO;EACL,QAAA,CAAA,CAAE,CAAA,GAAI,EAAA;EACN,QAAA,CAAA,CAAE,CAAA,GAAI,CAAA;EAGN,QAAA,CAAA,CAAE,CAAA,GAAI,IAAA;EACN,QAAA,CAAA,GAAI,GAAA,CAAI,CAAA,EAAG,CAAA,EAAG,EAAA,EAAI,IAAI,OAAO,CAAA;EAC7B,QAAA,EAAA,GAAK,CAAA,CAAE,CAAA;EACP,QAAA,CAAA,GAAI,CAAA,CAAE,CAAA;EACN,QAAA,CAAA,GAAI,CAAA,CAAE,CAAA;EAAA,MACR;EAKA,MAAA,CAAA,GAAI,IAAI,EAAA,GAAK,CAAA;EAGb,MAAA,CAAA,GAAI,GAAG,CAAC,CAAA;EAIR,MAAA,CAAA,GAAI,OAAA,GAAU,CAAA;EACd,MAAA,CAAA,GAAI,KAAK,CAAA,GAAI,CAAA,IAAK,EAAA,CAAG,CAAA,GAAI,CAAC,CAAA,IAAK,IAAA;EAE/B,MAAA,CAAA,GAAI,EAAA,GAAK,CAAA,GAAA,CAAK,CAAA,IAAK,IAAA,IAAQ,CAAA,MAAO,EAAA,IAAM,CAAA,IAAK,EAAA,KAAO,CAAA,CAAE,CAAA,GAAI,CAAA,GAAI,CAAA,GAAI,MAC1D,CAAA,GAAI,CAAA,IAAK,CAAA,IAAK,CAAA,KAAK,EAAA,IAAM,CAAA,IAAK,CAAA,IAAK,EAAA,IAAM,KAAK,EAAA,CAAG,CAAA,GAAI,CAAC,CAAA,GAAI,CAAA,IAC3D,EAAA,KAAO,CAAA,CAAE,CAAA,GAAI,IAAI,CAAA,GAAI,CAAA,CAAA,CAAA;EAK5B,MAAA,IAAI,CAAA,GAAI,CAAA,IAAK,CAAC,EAAA,CAAG,CAAC,CAAA,EAAG;EAGnB,QAAA,GAAA,GAAM,CAAA,GAAI,YAAA,CAAaA,SAAAA,CAAS,MAAA,CAAO,CAAC,CAAA,EAAG,CAAC,EAAA,EAAIA,SAAAA,CAAS,OAAO,CAAC,CAAC,CAAA,GAAIA,SAAAA,CAAS,OAAO,CAAC,CAAA;EAAA,MACzF,CAAA,MAAO;EAGL,QAAA,EAAA,CAAG,MAAA,GAAS,CAAA;EAGZ,QAAA,IAAI,CAAA,EAAG;EAGL,UAAA,KAAK,EAAE,OAAA,EAAS,EAAE,GAAG,EAAE,CAAC,IAAI,OAAA,IAAU;EACpC,YAAA,EAAA,CAAG,CAAC,CAAA,GAAI,CAAA;EAER,YAAA,IAAI,CAAC,CAAA,EAAG;EACN,cAAA,EAAE,CAAA;EACF,cAAA,EAAA,GAAK,CAAC,CAAC,CAAA,CAAE,MAAA,CAAO,EAAE,CAAA;EAAA,YACpB;EAAA,UACF;EAAA,QACF;EAGA,QAAA,KAAK,IAAI,EAAA,CAAG,MAAA,EAAQ,CAAC,EAAA,CAAG,EAAE,CAAC,CAAA,IAAG;EAG9B,QAAA,KAAK,CAAA,GAAI,CAAA,EAAG,GAAA,GAAM,EAAA,EAAI,CAAA,IAAK,CAAA,EAAG,GAAA,IAAOA,SAAAA,CAAS,MAAA,CAAO,EAAA,CAAG,CAAA,EAAG,CAAC,CAAA,EAAE;EAG9D,QAAA,GAAA,GAAM,aAAa,GAAA,EAAK,CAAA,EAAGA,SAAAA,CAAS,MAAA,CAAO,CAAC,CAAC,CAAA;EAAA,MAC/C;EAGA,MAAA,OAAO,GAAA;EAAA,IACT,CAAA;EAAA,EACF,CAAA,GAAG;EAIH,EAAA,GAAA,mBAAO,CAAA,WAAY;EAGjB,IAAA,SAAS,QAAA,CAAS,CAAA,EAAG,CAAA,EAAG,IAAA,EAAM;EAC5B,MAAA,IAAI,CAAA,EAAG,IAAA,EAAM,GAAA,EAAK,GAAA,EAChB,QAAQ,CAAA,EACR,CAAA,GAAI,CAAA,CAAE,MAAA,EACN,GAAA,GAAM,CAAA,GAAI,SAAA,EACV,GAAA,GAAM,IAAI,SAAA,GAAY,CAAA;EAExB,MAAA,KAAK,CAAA,GAAI,CAAA,CAAE,KAAA,EAAM,EAAG,CAAA,EAAA,IAAM;EACxB,QAAA,GAAA,GAAM,CAAA,CAAE,CAAC,CAAA,GAAI,SAAA;EACb,QAAA,GAAA,GAAM,CAAA,CAAE,CAAC,CAAA,GAAI,SAAA,GAAY,CAAA;EACzB,QAAA,CAAA,GAAI,GAAA,GAAM,MAAM,GAAA,GAAM,GAAA;EACtB,QAAA,IAAA,GAAO,GAAA,GAAM,GAAA,GAAQ,CAAA,GAAI,SAAA,GAAa,SAAA,GAAa,KAAA;EACnD,QAAA,KAAA,GAAA,CAAS,OAAO,IAAA,GAAO,CAAA,KAAM,CAAA,GAAI,SAAA,GAAY,KAAK,GAAA,GAAM,GAAA;EACxD,QAAA,CAAA,CAAE,CAAC,IAAI,IAAA,GAAO,IAAA;EAAA,MAChB;EAEA,MAAA,IAAI,OAAO,CAAA,GAAI,CAAC,KAAK,CAAA,CAAE,OAAO,CAAC,CAAA;EAE/B,MAAA,OAAO,CAAA;EAAA,IACT;EAEA,IAAA,SAASC,QAAAA,CAAQ,CAAA,EAAG,CAAA,EAAG,EAAA,EAAI,EAAA,EAAI;EAC7B,MAAA,IAAI,CAAA,EAAG,GAAA;EAEP,MAAA,IAAI,MAAM,EAAA,EAAI;EACZ,QAAA,GAAA,GAAM,EAAA,GAAK,KAAK,CAAA,GAAI,EAAA;EAAA,MACtB,CAAA,MAAO;EAEL,QAAA,KAAK,CAAA,GAAI,GAAA,GAAM,CAAA,EAAG,CAAA,GAAI,IAAI,CAAA,EAAA,EAAK;EAE7B,UAAA,IAAI,CAAA,CAAE,CAAC,CAAA,IAAK,CAAA,CAAE,CAAC,CAAA,EAAG;EAChB,YAAA,GAAA,GAAM,EAAE,CAAC,CAAA,GAAI,CAAA,CAAE,CAAC,IAAI,CAAA,GAAI,EAAA;EACxB,YAAA;EAAA,UACF;EAAA,QACF;EAAA,MACF;EAEA,MAAA,OAAO,GAAA;EAAA,IACT;EAEA,IAAA,SAAS,QAAA,CAAS,CAAA,EAAG,CAAA,EAAG,EAAA,EAAI,IAAA,EAAM;EAChC,MAAA,IAAI,CAAA,GAAI,CAAA;EAGR,MAAA,OAAO,EAAA,EAAA,IAAO;EACZ,QAAA,CAAA,CAAE,EAAE,CAAA,IAAK,CAAA;EACT,QAAA,CAAA,GAAI,EAAE,EAAE,CAAA,GAAI,CAAA,CAAE,EAAE,IAAI,CAAA,GAAI,CAAA;EACxB,QAAA,CAAA,CAAE,EAAE,IAAI,CAAA,GAAI,IAAA,GAAO,EAAE,EAAE,CAAA,GAAI,EAAE,EAAE,CAAA;EAAA,MACjC;EAGA,MAAA,OAAO,CAAC,CAAA,CAAE,CAAC,CAAA,IAAK,CAAA,CAAE,MAAA,GAAS,CAAA,EAAG,CAAA,CAAE,MAAA,CAAO,CAAA,EAAG,CAAC,CAAA,EAAE;EAAA,IAC/C;EAGA,IAAA,OAAO,SAAU,CAAA,EAAG,CAAA,EAAG,EAAA,EAAI,IAAI,IAAA,EAAM;EACnC,MAAA,IAAI,GAAA,EAAK,CAAA,EAAG,CAAA,EAAG,IAAA,EAAM,CAAA,EAAG,IAAA,EAAM,KAAA,EAAO,CAAA,EAAG,EAAA,EAAI,GAAA,EAAK,IAAA,EAAM,IAAA,EAAM,EAAA,EAAI,EAAA,EAAI,GAAA,EACnE,EAAA,EAAI,EAAA,EACJ,CAAA,GAAI,CAAA,CAAE,CAAA,IAAK,CAAA,CAAE,CAAA,GAAI,CAAA,GAAI,EAAA,EACrB,EAAA,GAAK,CAAA,CAAE,CAAA,EACP,EAAA,GAAK,CAAA,CAAE,CAAA;EAGT,MAAA,IAAI,CAAC,EAAA,IAAM,CAAC,EAAA,CAAG,CAAC,CAAA,IAAK,CAAC,EAAA,IAAM,CAAC,EAAA,CAAG,CAAC,CAAA,EAAG;EAElC,QAAA,OAAO,IAAIF,UAAAA;EAAA;EAAA,UAGV,CAAC,CAAA,CAAE,CAAA,IAAK,CAAC,EAAE,CAAA,KAAM,EAAA,GAAK,EAAA,IAAM,EAAA,CAAG,CAAC,CAAA,IAAK,EAAA,CAAG,CAAC,CAAA,GAAI,CAAC,EAAA,CAAA,GAAM,GAAA;EAAA;EAAA,YAGnD,EAAA,IAAM,GAAG,CAAC,CAAA,IAAK,KAAK,CAAC,EAAA,GAAK,CAAA,GAAI,CAAA,GAAI,CAAA,GAAI;EAAA;EAAA,SACzC;EAAA,MACD;EAEA,MAAA,CAAA,GAAI,IAAIA,WAAU,CAAC,CAAA;EACnB,MAAA,EAAA,GAAK,CAAA,CAAE,IAAI,EAAC;EACZ,MAAA,CAAA,GAAI,CAAA,CAAE,IAAI,CAAA,CAAE,CAAA;EACZ,MAAA,CAAA,GAAI,KAAK,CAAA,GAAI,CAAA;EAEb,MAAA,IAAI,CAAC,IAAA,EAAM;EACT,QAAA,IAAA,GAAO,IAAA;EACP,QAAA,CAAA,GAAI,QAAA,CAAS,EAAE,CAAA,GAAI,QAAQ,IAAI,QAAA,CAAS,CAAA,CAAE,IAAI,QAAQ,CAAA;EACtD,QAAA,CAAA,GAAI,IAAI,QAAA,GAAW,CAAA;EAAA,MACrB;EAIA,MAAA,KAAK,CAAA,GAAI,GAAG,EAAA,CAAG,CAAC,MAAM,EAAA,CAAG,CAAC,CAAA,IAAK,CAAA,CAAA,EAAI,CAAA,EAAA,EAAI;EAEvC,MAAA,IAAI,GAAG,CAAC,CAAA,IAAK,EAAA,CAAG,CAAC,KAAK,CAAA,CAAA,EAAI,CAAA,EAAA;EAE1B,MAAA,IAAI,IAAI,CAAA,EAAG;EACT,QAAA,EAAA,CAAG,KAAK,CAAC,CAAA;EACT,QAAA,IAAA,GAAO,IAAA;EAAA,MACT,CAAA,MAAO;EACL,QAAA,EAAA,GAAK,EAAA,CAAG,MAAA;EACR,QAAA,EAAA,GAAK,EAAA,CAAG,MAAA;EACR,QAAA,CAAA,GAAI,CAAA;EACJ,QAAA,CAAA,IAAK,CAAA;EAIL,QAAA,CAAA,GAAI,SAAA,CAAU,IAAA,IAAQ,EAAA,CAAG,CAAC,IAAI,CAAA,CAAE,CAAA;EAIhC,QAAA,IAAI,IAAI,CAAA,EAAG;EACT,UAAA,EAAA,GAAK,QAAA,CAAS,EAAA,EAAI,CAAA,EAAG,IAAI,CAAA;EACzB,UAAA,EAAA,GAAK,QAAA,CAAS,EAAA,EAAI,CAAA,EAAG,IAAI,CAAA;EACzB,UAAA,EAAA,GAAK,EAAA,CAAG,MAAA;EACR,UAAA,EAAA,GAAK,EAAA,CAAG,MAAA;EAAA,QACV;EAEA,QAAA,EAAA,GAAK,EAAA;EACL,QAAA,GAAA,GAAM,EAAA,CAAG,KAAA,CAAM,CAAA,EAAG,EAAE,CAAA;EACpB,QAAA,IAAA,GAAO,GAAA,CAAI,MAAA;EAGX,QAAA,OAAO,IAAA,GAAO,EAAA,EAAI,GAAA,CAAI,IAAA,EAAM,IAAI,CAAA,EAAE;EAClC,QAAA,EAAA,GAAK,GAAG,KAAA,EAAM;EACd,QAAA,EAAA,GAAK,CAAC,CAAC,CAAA,CAAE,MAAA,CAAO,EAAE,CAAA;EAClB,QAAA,GAAA,GAAM,GAAG,CAAC,CAAA;EACV,QAAA,IAAI,EAAA,CAAG,CAAC,CAAA,IAAK,IAAA,GAAO,CAAA,EAAG,GAAA,EAAA;EAIvB,QAAA,GAAG;EACD,UAAA,CAAA,GAAI,CAAA;EAGJ,UAAA,GAAA,GAAME,QAAAA,CAAQ,EAAA,EAAI,GAAA,EAAK,EAAA,EAAI,IAAI,CAAA;EAG/B,UAAA,IAAI,MAAM,CAAA,EAAG;EAIX,YAAA,IAAA,GAAO,IAAI,CAAC,CAAA;EACZ,YAAA,IAAI,MAAM,IAAA,EAAM,IAAA,GAAO,OAAO,IAAA,IAAQ,GAAA,CAAI,CAAC,CAAA,IAAK,CAAA,CAAA;EAGhD,YAAA,CAAA,GAAI,SAAA,CAAU,OAAO,GAAG,CAAA;EAaxB,YAAA,IAAI,IAAI,CAAA,EAAG;EAGT,cAAA,IAAI,CAAA,IAAK,IAAA,EAAM,CAAA,GAAI,IAAA,GAAO,CAAA;EAG1B,cAAA,IAAA,GAAO,QAAA,CAAS,EAAA,EAAI,CAAA,EAAG,IAAI,CAAA;EAC3B,cAAA,KAAA,GAAQ,IAAA,CAAK,MAAA;EACb,cAAA,IAAA,GAAO,GAAA,CAAI,MAAA;EAMX,cAAA,OAAOA,SAAQ,IAAA,EAAM,GAAA,EAAK,KAAA,EAAO,IAAI,KAAK,CAAA,EAAG;EAC3C,gBAAA,CAAA,EAAA;EAGA,gBAAA,QAAA,CAAS,MAAM,EAAA,GAAK,KAAA,GAAQ,EAAA,GAAK,EAAA,EAAI,OAAO,IAAI,CAAA;EAChD,gBAAA,KAAA,GAAQ,IAAA,CAAK,MAAA;EACb,gBAAA,GAAA,GAAM,CAAA;EAAA,cACR;EAAA,YACF,CAAA,MAAO;EAML,cAAA,IAAI,KAAK,CAAA,EAAG;EAGV,gBAAA,GAAA,GAAM,CAAA,GAAI,CAAA;EAAA,cACZ;EAGA,cAAA,IAAA,GAAO,GAAG,KAAA,EAAM;EAChB,cAAA,KAAA,GAAQ,IAAA,CAAK,MAAA;EAAA,YACf;EAEA,YAAA,IAAI,QAAQ,IAAA,EAAM,IAAA,GAAO,CAAC,CAAC,CAAA,CAAE,OAAO,IAAI,CAAA;EAGxC,YAAA,QAAA,CAAS,GAAA,EAAK,IAAA,EAAM,IAAA,EAAM,IAAI,CAAA;EAC9B,YAAA,IAAA,GAAO,GAAA,CAAI,MAAA;EAGX,YAAA,IAAI,OAAO,EAAA,EAAI;EAMb,cAAA,OAAOA,SAAQ,EAAA,EAAI,GAAA,EAAK,EAAA,EAAI,IAAI,IAAI,CAAA,EAAG;EACrC,gBAAA,CAAA,EAAA;EAGA,gBAAA,QAAA,CAAS,KAAK,EAAA,GAAK,IAAA,GAAO,EAAA,GAAK,EAAA,EAAI,MAAM,IAAI,CAAA;EAC7C,gBAAA,IAAA,GAAO,GAAA,CAAI,MAAA;EAAA,cACb;EAAA,YACF;EAAA,UACF,CAAA,MAAA,IAAW,QAAQ,CAAA,EAAG;EACpB,YAAA,CAAA,EAAA;EACA,YAAA,GAAA,GAAM,CAAC,CAAC,CAAA;EAAA,UACV;EAGA,UAAA,EAAA,CAAG,GAAG,CAAA,GAAI,CAAA;EAGV,UAAA,IAAI,GAAA,CAAI,CAAC,CAAA,EAAG;EACV,YAAA,GAAA,CAAI,IAAA,EAAM,CAAA,GAAI,EAAA,CAAG,EAAE,CAAA,IAAK,CAAA;EAAA,UAC1B,CAAA,MAAO;EACL,YAAA,GAAA,GAAM,CAAC,EAAA,CAAG,EAAE,CAAC,CAAA;EACb,YAAA,IAAA,GAAO,CAAA;EAAA,UACT;EAAA,QACF,UAAU,EAAA,EAAA,GAAO,EAAA,IAAM,GAAA,CAAI,CAAC,KAAK,IAAA,KAAS,CAAA,EAAA;EAE1C,QAAA,IAAA,GAAO,GAAA,CAAI,CAAC,CAAA,IAAK,IAAA;EAGjB,QAAA,IAAI,CAAC,EAAA,CAAG,CAAC,GAAG,EAAA,CAAG,MAAA,CAAO,GAAG,CAAC,CAAA;EAAA,MAC5B;EAEA,MAAA,IAAI,QAAQ,IAAA,EAAM;EAGhB,QAAA,KAAK,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,EAAA,CAAG,CAAC,GAAG,CAAA,IAAK,EAAA,EAAI,CAAA,IAAK,EAAA,EAAI,CAAA,EAAA,EAAI;EAE7C,QAAA,KAAA,CAAM,CAAA,EAAG,EAAA,IAAM,CAAA,CAAE,CAAA,GAAI,CAAA,GAAI,IAAI,QAAA,GAAW,CAAA,CAAA,GAAK,CAAA,EAAG,EAAA,EAAI,IAAI,CAAA;EAAA,MAG1D,CAAA,MAAO;EACL,QAAA,CAAA,CAAE,CAAA,GAAI,CAAA;EACN,QAAA,CAAA,CAAE,IAAI,CAAC,IAAA;EAAA,MACT;EAEA,MAAA,OAAO,CAAA;EAAA,IACT,CAAA;EAAA,EACF,CAAA,GAAG;EAYH,EAAA,SAAS,MAAA,CAAO,CAAA,EAAG,CAAA,EAAG,EAAA,EAAI,EAAA,EAAI;EAC5B,IAAA,IAAI,EAAA,EAAI,CAAA,EAAG,EAAA,EAAI,GAAA,EAAK,GAAA;EAEpB,IAAA,IAAI,EAAA,IAAM,MAAM,EAAA,GAAK,aAAA;EAAA,SAChB,QAAA,CAAS,EAAA,EAAI,CAAA,EAAG,CAAC,CAAA;EAEtB,IAAA,IAAI,CAAC,CAAA,CAAE,CAAA,EAAG,OAAO,EAAE,QAAA,EAAS;EAE5B,IAAA,EAAA,GAAK,CAAA,CAAE,EAAE,CAAC,CAAA;EACV,IAAA,EAAA,GAAK,CAAA,CAAE,CAAA;EAEP,IAAA,IAAI,KAAK,IAAA,EAAM;EACb,MAAA,GAAA,GAAM,aAAA,CAAc,EAAE,CAAC,CAAA;EACvB,MAAA,GAAA,GAAM,EAAA,IAAM,CAAA,IAAK,EAAA,IAAM,CAAA,KAAM,MAAM,UAAA,IAAc,EAAA,IAAM,UAAA,CAAA,GACpD,aAAA,CAAc,KAAK,EAAE,CAAA,GACrB,YAAA,CAAa,GAAA,EAAK,IAAI,GAAG,CAAA;EAAA,IAC9B,CAAA,MAAO;EACL,MAAA,CAAA,GAAI,MAAM,IAAIF,UAAAA,CAAU,CAAC,CAAA,EAAG,GAAG,EAAE,CAAA;EAGjC,MAAA,CAAA,GAAI,CAAA,CAAE,CAAA;EAEN,MAAA,GAAA,GAAM,aAAA,CAAc,EAAE,CAAC,CAAA;EACvB,MAAA,GAAA,GAAM,GAAA,CAAI,MAAA;EAOV,MAAA,IAAI,MAAM,CAAA,IAAK,EAAA,IAAM,MAAM,CAAA,IAAK,CAAA,IAAK,KAAK,UAAA,CAAA,EAAa;EAGrD,QAAA,OAAO,GAAA,GAAM,CAAA,EAAG,GAAA,IAAO,GAAA,EAAK,GAAA,EAAA,EAAM;EAClC,QAAA,GAAA,GAAM,aAAA,CAAc,KAAK,CAAC,CAAA;EAAA,MAG5B,CAAA,MAAO;EACL,QAAA,CAAA,IAAK,EAAA,IAAM,EAAA,KAAO,CAAA,IAAK,CAAA,GAAI,EAAA,CAAA;EAC3B,QAAA,GAAA,GAAM,YAAA,CAAa,GAAA,EAAK,CAAA,EAAG,GAAG,CAAA;EAG9B,QAAA,IAAI,CAAA,GAAI,IAAI,GAAA,EAAK;EACf,UAAA,IAAI,EAAE,IAAI,CAAA,EAAG,KAAK,OAAO,GAAA,EAAK,CAAA,EAAA,EAAK,OAAO,GAAA,EAAI;EAAA,QAChD,CAAA,MAAO;EACL,UAAA,CAAA,IAAK,CAAA,GAAI,GAAA;EACT,UAAA,IAAI,IAAI,CAAA,EAAG;EACT,YAAA,IAAI,CAAA,GAAI,CAAA,IAAK,GAAA,EAAK,GAAA,IAAO,GAAA;EACzB,YAAA,OAAO,CAAA,EAAA,EAAK,OAAO,GAAA,EAAI;EAAA,UACzB;EAAA,QACF;EAAA,MACF;EAAA,IACF;EAEA,IAAA,OAAO,CAAA,CAAE,CAAA,GAAI,CAAA,IAAK,EAAA,GAAK,MAAM,GAAA,GAAM,GAAA;EAAA,EACrC;EAKA,EAAA,SAAS,QAAA,CAAS,MAAM,CAAA,EAAG;EACzB,IAAA,IAAI,CAAA,EAAG,GACL,CAAA,GAAI,CAAA,EACJ,IAAI,IAAIA,UAAAA,CAAU,IAAA,CAAK,CAAC,CAAC,CAAA;EAE3B,IAAA,OAAO,CAAA,GAAI,IAAA,CAAK,MAAA,EAAQ,CAAA,EAAA,EAAK;EAC3B,MAAA,CAAA,GAAI,IAAIA,UAAAA,CAAU,IAAA,CAAK,CAAC,CAAC,CAAA;EACzB,MAAA,IAAI,CAAC,CAAA,CAAE,CAAA,IAAA,CAAM,CAAA,GAAI,OAAA,CAAQ,CAAA,EAAG,CAAC,CAAA,MAAO,CAAA,IAAK,CAAA,KAAM,CAAA,IAAK,CAAA,CAAE,MAAM,CAAA,EAAG;EAC7D,QAAA,CAAA,GAAI,CAAA;EAAA,MACN;EAAA,IACF;EAEA,IAAA,OAAO,CAAA;EAAA,EACT;EAOA,EAAA,SAAS,SAAA,CAAU,CAAA,EAAG,CAAA,EAAG,CAAA,EAAG;EAC1B,IAAA,IAAI,CAAA,GAAI,CAAA,EACN,CAAA,GAAI,CAAA,CAAE,MAAA;EAGR,IAAA,OAAO,CAAC,CAAA,CAAE,EAAE,CAAC,CAAA,EAAG,CAAA,CAAE,KAAI,EAAE;EAGxB,IAAA,KAAK,CAAA,GAAI,EAAE,CAAC,CAAA,EAAG,KAAK,EAAA,EAAI,CAAA,IAAK,IAAI,CAAA,EAAA,EAAI;EAGrC,IAAA,IAAA,CAAK,CAAA,GAAI,CAAA,GAAI,CAAA,GAAI,QAAA,GAAW,KAAK,OAAA,EAAS;EAGxC,MAAA,CAAA,CAAE,CAAA,GAAI,EAAE,CAAA,GAAI,IAAA;EAAA,IAGd,CAAA,MAAA,IAAW,IAAI,OAAA,EAAS;EAGtB,MAAA,CAAA,CAAE,CAAA,GAAI,CAAC,CAAA,CAAE,CAAA,GAAI,CAAC,CAAA;EAAA,IAChB,CAAA,MAAO;EACL,MAAA,CAAA,CAAE,CAAA,GAAI,CAAA;EACN,MAAA,CAAA,CAAE,CAAA,GAAI,CAAA;EAAA,IACR;EAEA,IAAA,OAAO,CAAA;EAAA,EACT;EAIA,EAAA,YAAA,mBAAgB,CAAA,WAAY;EAC1B,IAAA,IAAI,UAAA,GAAa,+BACf,QAAA,GAAW,aAAA,EACX,YAAY,aAAA,EACZ,eAAA,GAAkB,sBAClB,gBAAA,GAAmB,4BAAA;EAErB,IAAA,OAAO,SAAU,CAAA,EAAG,GAAA,EAAK,KAAA,EAAO,CAAA,EAAG;EACjC,MAAA,IAAI,MACF,CAAA,GAAI,KAAA,GAAQ,MAAM,GAAA,CAAI,OAAA,CAAQ,kBAAkB,EAAE,CAAA;EAGpD,MAAA,IAAI,eAAA,CAAgB,IAAA,CAAK,CAAC,CAAA,EAAG;EAC3B,QAAA,CAAA,CAAE,IAAI,KAAA,CAAM,CAAC,IAAI,IAAA,GAAO,CAAA,GAAI,IAAI,EAAA,GAAK,CAAA;EAAA,MACvC,CAAA,MAAO;EACL,QAAA,IAAI,CAAC,KAAA,EAAO;EAGV,UAAA,CAAA,GAAI,EAAE,OAAA,CAAQ,UAAA,EAAY,SAAU,CAAA,EAAG,IAAI,EAAA,EAAI;EAC7C,YAAA,IAAA,GAAA,CAAQ,EAAA,GAAK,GAAG,WAAA,EAAY,KAAM,MAAM,EAAA,GAAK,EAAA,IAAM,MAAM,CAAA,GAAI,CAAA;EAC7D,YAAA,OAAO,CAAC,CAAA,IAAK,CAAA,IAAK,IAAA,GAAO,EAAA,GAAK,CAAA;EAAA,UAChC,CAAC,CAAA;EAED,UAAA,IAAI,CAAA,EAAG;EACL,YAAA,IAAA,GAAO,CAAA;EAGP,YAAA,CAAA,GAAI,EAAE,OAAA,CAAQ,QAAA,EAAU,IAAI,CAAA,CAAE,OAAA,CAAQ,WAAW,MAAM,CAAA;EAAA,UACzD;EAEA,UAAA,IAAI,OAAO,CAAA,EAAG,OAAO,IAAIA,UAAAA,CAAU,GAAG,IAAI,CAAA;EAAA,QAC5C;EAIA,QAAA,IAAIA,WAAU,KAAA,EAAO;EACnB,UAAA,MAAM,KAAA,CACH,iBAAiB,OAAA,IAAW,CAAA,GAAI,WAAW,CAAA,GAAI,EAAA,CAAA,GAAM,cAAc,GAAG,CAAA;EAAA,QAC3E;EAGA,QAAA,CAAA,CAAE,CAAA,GAAI,IAAA;EAAA,MACR;EAEA,MAAA,CAAA,CAAE,CAAA,GAAI,EAAE,CAAA,GAAI,IAAA;EAAA,IACd,CAAA;EAAA,EACF,CAAA,GAAG;EAOH,EAAA,SAAS,KAAA,CAAM,CAAA,EAAG,EAAA,EAAI,EAAA,EAAI,CAAA,EAAG;EAC3B,IAAA,IAAI,CAAA,EAAG,CAAA,EAAG,CAAA,EAAG,CAAA,EAAG,CAAA,EAAG,IAAI,EAAA,EACrB,EAAA,GAAK,CAAA,CAAE,CAAA,EACP,MAAA,GAAS,QAAA;EAGX,IAAA,IAAI,EAAA,EAAI;EAQN,MAAA,GAAA,EAAK;EAGH,QAAA,KAAK,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,EAAA,CAAG,CAAC,GAAG,CAAA,IAAK,EAAA,EAAI,CAAA,IAAK,EAAA,EAAI,CAAA,EAAA,EAAI;EAC7C,QAAA,CAAA,GAAI,EAAA,GAAK,CAAA;EAGT,QAAA,IAAI,IAAI,CAAA,EAAG;EACT,UAAA,CAAA,IAAK,QAAA;EACL,UAAA,CAAA,GAAI,EAAA;EACJ,UAAA,CAAA,GAAI,EAAA,CAAG,KAAK,CAAC,CAAA;EAGb,UAAA,EAAA,GAAK,UAAU,CAAA,GAAI,MAAA,CAAO,IAAI,CAAA,GAAI,CAAC,IAAI,EAAE,CAAA;EAAA,QAC3C,CAAA,MAAO;EACL,UAAA,EAAA,GAAK,QAAA,CAAA,CAAU,CAAA,GAAI,CAAA,IAAK,QAAQ,CAAA;EAEhC,UAAA,IAAI,EAAA,IAAM,GAAG,MAAA,EAAQ;EAEnB,YAAA,IAAI,CAAA,EAAG;EAGL,cAAA,OAAO,GAAG,MAAA,IAAU,EAAA,EAAI,EAAA,CAAG,IAAA,CAAK,CAAC,CAAA,EAAE;EACnC,cAAA,CAAA,GAAI,EAAA,GAAK,CAAA;EACT,cAAA,CAAA,GAAI,CAAA;EACJ,cAAA,CAAA,IAAK,QAAA;EACL,cAAA,CAAA,GAAI,IAAI,QAAA,GAAW,CAAA;EAAA,YACrB,CAAA,MAAO;EACL,cAAA,MAAM,GAAA;EAAA,YACR;EAAA,UACF,CAAA,MAAO;EACL,YAAA,CAAA,GAAI,CAAA,GAAI,GAAG,EAAE,CAAA;EAGb,YAAA,KAAK,IAAI,CAAA,EAAG,CAAA,IAAK,EAAA,EAAI,CAAA,IAAK,IAAI,CAAA,EAAA,EAAI;EAGlC,YAAA,CAAA,IAAK,QAAA;EAIL,YAAA,CAAA,GAAI,IAAI,QAAA,GAAW,CAAA;EAGnB,YAAA,EAAA,GAAK,CAAA,GAAI,CAAA,GAAI,CAAA,GAAI,SAAA,CAAU,CAAA,GAAI,OAAO,CAAA,GAAI,CAAA,GAAI,CAAC,CAAA,GAAI,EAAE,CAAA;EAAA,UACvD;EAAA,QACF;EAEA,QAAA,CAAA,GAAI,KAAK,EAAA,GAAK,CAAA;EAAA;EAAA;EAAA,QAKb,EAAA,CAAG,EAAA,GAAK,CAAC,CAAA,IAAK,IAAA,KAAS,CAAA,GAAI,CAAA,GAAI,CAAA,GAAI,CAAA,GAAI,MAAA,CAAO,CAAA,GAAI,CAAA,GAAI,CAAC,CAAA,CAAA;EAExD,QAAA,CAAA,GAAI,KAAK,CAAA,GAAA,CACL,EAAA,IAAM,OAAO,EAAA,IAAM,CAAA,IAAK,OAAO,CAAA,CAAE,CAAA,GAAI,IAAI,CAAA,GAAI,CAAA,CAAA,CAAA,GAC9C,KAAK,CAAA,IAAK,EAAA,IAAM,MAAM,EAAA,IAAM,CAAA,IAAK,KAAK,EAAA,IAAM,CAAA;EAAA,QAAA,CAG3C,CAAA,GAAI,IAAI,CAAA,GAAI,CAAA,GAAI,IAAI,MAAA,CAAO,CAAA,GAAI,CAAC,CAAA,GAAI,CAAA,GAAI,GAAG,EAAA,GAAK,CAAC,KAAK,EAAA,GAAM,CAAA,IAC7D,OAAO,CAAA,CAAE,CAAA,GAAI,IAAI,CAAA,GAAI,CAAA,CAAA,CAAA;EAExB,QAAA,IAAI,EAAA,GAAK,CAAA,IAAK,CAAC,EAAA,CAAG,CAAC,CAAA,EAAG;EACpB,UAAA,EAAA,CAAG,MAAA,GAAS,CAAA;EAEZ,UAAA,IAAI,CAAA,EAAG;EAGL,YAAA,EAAA,IAAM,EAAE,CAAA,GAAI,CAAA;EAGZ,YAAA,EAAA,CAAG,CAAC,CAAA,GAAI,MAAA,CAAA,CAAQ,QAAA,GAAW,EAAA,GAAK,YAAY,QAAQ,CAAA;EACpD,YAAA,CAAA,CAAE,CAAA,GAAI,CAAC,EAAA,IAAM,CAAA;EAAA,UACf,CAAA,MAAO;EAGL,YAAA,EAAA,CAAG,CAAC,CAAA,GAAI,CAAA,CAAE,CAAA,GAAI,CAAA;EAAA,UAChB;EAEA,UAAA,OAAO,CAAA;EAAA,QACT;EAGA,QAAA,IAAI,KAAK,CAAA,EAAG;EACV,UAAA,EAAA,CAAG,MAAA,GAAS,EAAA;EACZ,UAAA,CAAA,GAAI,CAAA;EACJ,UAAA,EAAA,EAAA;EAAA,QACF,CAAA,MAAO;EACL,UAAA,EAAA,CAAG,SAAS,EAAA,GAAK,CAAA;EACjB,UAAA,CAAA,GAAI,MAAA,CAAO,WAAW,CAAC,CAAA;EAIvB,UAAA,EAAA,CAAG,EAAE,CAAA,GAAI,CAAA,GAAI,CAAA,GAAI,UAAU,CAAA,GAAI,MAAA,CAAO,CAAA,GAAI,CAAC,CAAA,GAAI,MAAA,CAAO,CAAC,CAAC,IAAI,CAAA,GAAI,CAAA;EAAA,QAClE;EAGA,QAAA,IAAI,CAAA,EAAG;EAEL,UAAA,WAAU;EAGR,YAAA,IAAI,MAAM,CAAA,EAAG;EAGX,cAAA,KAAK,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,EAAA,CAAG,CAAC,GAAG,CAAA,IAAK,EAAA,EAAI,CAAA,IAAK,EAAA,EAAI,CAAA,EAAA,EAAI;EAC7C,cAAA,CAAA,GAAI,EAAA,CAAG,CAAC,CAAA,IAAK,CAAA;EACb,cAAA,KAAK,IAAI,CAAA,EAAG,CAAA,IAAK,EAAA,EAAI,CAAA,IAAK,IAAI,CAAA,EAAA,EAAI;EAGlC,cAAA,IAAI,KAAK,CAAA,EAAG;EACV,gBAAA,CAAA,CAAE,CAAA,EAAA;EACF,gBAAA,IAAI,GAAG,CAAC,CAAA,IAAK,IAAA,EAAM,EAAA,CAAG,CAAC,CAAA,GAAI,CAAA;EAAA,cAC7B;EAEA,cAAA;EAAA,YACF,CAAA,MAAO;EACL,cAAA,EAAA,CAAG,EAAE,CAAA,IAAK,CAAA;EACV,cAAA,IAAI,EAAA,CAAG,EAAE,CAAA,IAAK,IAAA,EAAM;EACpB,cAAA,EAAA,CAAG,IAAI,CAAA,GAAI,CAAA;EACX,cAAA,CAAA,GAAI,CAAA;EAAA,YACN;EAAA,UACF;EAAA,QACF;EAGA,QAAA,KAAK,CAAA,GAAI,EAAA,CAAG,MAAA,EAAQ,EAAA,CAAG,EAAE,CAAC,CAAA,KAAM,CAAA,EAAG,EAAA,CAAG,GAAA,EAAI,EAAE;EAAA,MAC9C;EAGA,MAAA,IAAI,CAAA,CAAE,IAAI,OAAA,EAAS;EACjB,QAAA,CAAA,CAAE,CAAA,GAAI,EAAE,CAAA,GAAI,IAAA;EAAA,MAGd,CAAA,MAAA,IAAW,CAAA,CAAE,CAAA,GAAI,OAAA,EAAS;EACxB,QAAA,CAAA,CAAE,CAAA,GAAI,CAAC,CAAA,CAAE,CAAA,GAAI,CAAC,CAAA;EAAA,MAChB;EAAA,IACF;EAEA,IAAA,OAAO,CAAA;EAAA,EACT;EAGA,EAAA,SAAS,QAAQ,CAAA,EAAG;EAClB,IAAA,IAAI,GAAA,EACF,IAAI,CAAA,CAAE,CAAA;EAER,IAAA,IAAI,CAAA,KAAM,IAAA,EAAM,OAAO,CAAA,CAAE,QAAA,EAAS;EAElC,IAAA,GAAA,GAAM,aAAA,CAAc,EAAE,CAAC,CAAA;EAEvB,IAAA,GAAA,GAAM,CAAA,IAAK,UAAA,IAAc,CAAA,IAAK,UAAA,GAC1B,aAAA,CAAc,GAAA,EAAK,CAAC,CAAA,GACpB,YAAA,CAAa,GAAA,EAAK,CAAA,EAAG,GAAG,CAAA;EAE5B,IAAA,OAAO,CAAA,CAAE,CAAA,GAAI,CAAA,GAAI,GAAA,GAAM,GAAA,GAAM,GAAA;EAAA,EAC/B;EASA,EAAA,CAAA,CAAE,aAAA,GAAgB,CAAA,CAAE,GAAA,GAAM,WAAY;EACpC,IAAA,IAAI,CAAA,GAAI,IAAIA,UAAAA,CAAU,IAAI,CAAA;EAC1B,IAAA,IAAI,CAAA,CAAE,CAAA,GAAI,CAAA,EAAG,CAAA,CAAE,CAAA,GAAI,CAAA;EACnB,IAAA,OAAO,CAAA;EAAA,EACT,CAAA;EAUA,EAAA,CAAA,CAAE,UAAA,GAAa,SAAU,CAAA,EAAG,CAAA,EAAG;EAC7B,IAAA,OAAO,QAAQ,IAAA,EAAM,IAAIA,UAAAA,CAAU,CAAA,EAAG,CAAC,CAAC,CAAA;EAAA,EAC1C,CAAA;EAgBA,EAAA,CAAA,CAAE,aAAA,GAAgB,CAAA,CAAE,EAAA,GAAK,SAAU,IAAI,EAAA,EAAI;EACzC,IAAA,IAAI,CAAA,EAAG,CAAA,EAAG,CAAA,EACR,CAAA,GAAI,IAAA;EAEN,IAAA,IAAI,MAAM,IAAA,EAAM;EACd,MAAA,QAAA,CAAS,EAAA,EAAI,GAAG,GAAG,CAAA;EACnB,MAAA,IAAI,EAAA,IAAM,MAAM,EAAA,GAAK,aAAA;EAAA,WAChB,QAAA,CAAS,EAAA,EAAI,CAAA,EAAG,CAAC,CAAA;EAEtB,MAAA,OAAO,KAAA,CAAM,IAAIA,UAAAA,CAAU,CAAC,GAAG,EAAA,GAAK,CAAA,CAAE,CAAA,GAAI,CAAA,EAAG,EAAE,CAAA;EAAA,IACjD;EAEA,IAAA,IAAI,EAAE,CAAA,GAAI,CAAA,CAAE,CAAA,CAAA,EAAI,OAAO,IAAA;EACvB,IAAA,CAAA,GAAA,CAAA,CAAM,CAAA,GAAI,EAAE,MAAA,GAAS,CAAA,IAAK,SAAS,IAAA,CAAK,CAAA,GAAI,QAAQ,CAAA,IAAK,QAAA;EAGzD,IAAA,IAAI,CAAA,GAAI,CAAA,CAAE,CAAC,CAAA,EAAG,OAAO,IAAI,EAAA,IAAM,CAAA,EAAG,CAAA,IAAK,EAAA,EAAI,CAAA,EAAA,EAAI;EAC/C,IAAA,IAAI,CAAA,GAAI,GAAG,CAAA,GAAI,CAAA;EAEf,IAAA,OAAO,CAAA;EAAA,EACT,CAAA;EAuBA,EAAA,CAAA,CAAE,SAAA,GAAY,CAAA,CAAE,GAAA,GAAM,SAAU,GAAG,CAAA,EAAG;EACpC,IAAA,OAAO,GAAA,CAAI,MAAM,IAAIA,UAAAA,CAAU,GAAG,CAAC,CAAA,EAAG,gBAAgB,aAAa,CAAA;EAAA,EACrE,CAAA;EAOA,EAAA,CAAA,CAAE,kBAAA,GAAqB,CAAA,CAAE,IAAA,GAAO,SAAU,GAAG,CAAA,EAAG;EAC9C,IAAA,OAAO,GAAA,CAAI,MAAM,IAAIA,UAAAA,CAAU,GAAG,CAAC,CAAA,EAAG,GAAG,CAAC,CAAA;EAAA,EAC5C,CAAA;EAkBA,EAAA,CAAA,CAAE,eAAA,GAAkB,CAAA,CAAE,GAAA,GAAM,SAAU,GAAG,CAAA,EAAG;EAC1C,IAAA,IAAI,IAAA,EAAM,UAAU,CAAA,EAAG,CAAA,EAAG,MAAM,MAAA,EAAQ,MAAA,EAAQ,MAAA,EAAQ,CAAA,EACtD,CAAA,GAAI,IAAA;EAEN,IAAA,CAAA,GAAI,IAAIA,WAAU,CAAC,CAAA;EAGnB,IAAA,IAAI,CAAA,CAAE,CAAA,IAAK,CAAC,CAAA,CAAE,WAAU,EAAG;EACzB,MAAA,MAAM,KAAA,CACH,cAAA,GAAiB,2BAAA,GAA8B,OAAA,CAAQ,CAAC,CAAC,CAAA;EAAA,IAC9D;EAEA,IAAA,IAAI,CAAA,IAAK,IAAA,EAAM,CAAA,GAAI,IAAIA,WAAU,CAAC,CAAA;EAGlC,IAAA,MAAA,GAAS,EAAE,CAAA,GAAI,EAAA;EAGf,IAAA,IAAI,CAAC,CAAA,CAAE,CAAA,IAAK,CAAC,CAAA,CAAE,CAAA,CAAE,CAAC,CAAA,IAAK,CAAA,CAAE,CAAA,CAAE,CAAC,CAAA,IAAK,CAAA,IAAK,CAAC,CAAA,CAAE,CAAA,IAAK,CAAA,CAAE,CAAA,CAAE,MAAA,IAAU,CAAA,IAAK,CAAC,CAAA,CAAE,CAAA,IAAK,CAAC,CAAA,CAAE,CAAA,CAAE,CAAC,CAAA,EAAG;EAIhF,MAAA,CAAA,GAAI,IAAIA,UAAAA,CAAU,IAAA,CAAK,IAAI,CAAC,OAAA,CAAQ,CAAC,CAAA,EAAG,MAAA,GAAS,EAAE,CAAA,IAAK,CAAA,GAAI,MAAM,CAAC,CAAA,CAAA,GAAK,CAAC,OAAA,CAAQ,CAAC,CAAC,CAAC,CAAA;EACpF,MAAA,OAAO,CAAA,GAAI,CAAA,CAAE,GAAA,CAAI,CAAC,CAAA,GAAI,CAAA;EAAA,IACxB;EAEA,IAAA,MAAA,GAAS,EAAE,CAAA,GAAI,CAAA;EAEf,IAAA,IAAI,CAAA,EAAG;EAGL,MAAA,IAAI,CAAA,CAAE,CAAA,GAAI,CAAC,CAAA,CAAE,CAAA,CAAE,CAAC,CAAA,GAAI,CAAC,CAAA,CAAE,CAAA,EAAG,OAAO,IAAIA,WAAU,GAAG,CAAA;EAElD,MAAA,QAAA,GAAW,CAAC,MAAA,IAAU,CAAA,CAAE,SAAA,EAAU,IAAK,EAAE,SAAA,EAAU;EAEnD,MAAA,IAAI,QAAA,EAAU,CAAA,GAAI,CAAA,CAAE,GAAA,CAAI,CAAC,CAAA;EAAA,IAI3B,CAAA,MAAA,IAAW,CAAA,CAAE,CAAA,GAAI,CAAA,KAAM,EAAE,CAAA,GAAI,CAAA,IAAK,CAAA,CAAE,CAAA,GAAI,OAAO,CAAA,CAAE,CAAA,IAAK,CAAA,GAElD,CAAA,CAAE,EAAE,CAAC,CAAA,GAAI,CAAA,IAAK,MAAA,IAAU,CAAA,CAAE,CAAA,CAAE,CAAC,CAAA,IAAK,OAElC,CAAA,CAAE,CAAA,CAAE,CAAC,CAAA,GAAI,QAAQ,MAAA,IAAU,CAAA,CAAE,CAAA,CAAE,CAAC,KAAK,SAAA,CAAA,CAAA,EAAa;EAGpD,MAAA,CAAA,GAAI,EAAE,CAAA,GAAI,CAAA,IAAK,KAAA,CAAM,CAAC,IAAI,EAAA,GAAK,CAAA;EAG/B,MAAA,IAAI,CAAA,CAAE,CAAA,GAAI,EAAA,EAAI,CAAA,GAAI,CAAA,GAAI,CAAA;EAGtB,MAAA,OAAO,IAAIA,UAAAA,CAAU,MAAA,GAAS,CAAA,GAAI,IAAI,CAAC,CAAA;EAAA,IAEzC,WAAW,aAAA,EAAe;EAKxB,MAAA,CAAA,GAAI,QAAA,CAAS,aAAA,GAAgB,QAAA,GAAW,CAAC,CAAA;EAAA,IAC3C;EAEA,IAAA,IAAI,MAAA,EAAQ;EACV,MAAA,IAAA,GAAO,IAAIA,WAAU,GAAG,CAAA;EACxB,MAAA,IAAI,MAAA,IAAU,CAAA,GAAI,CAAA;EAClB,MAAA,MAAA,GAAS,MAAM,CAAC,CAAA;EAAA,IAClB,CAAA,MAAO;EACL,MAAA,CAAA,GAAI,IAAA,CAAK,GAAA,CAAI,CAAC,OAAA,CAAQ,CAAC,CAAC,CAAA;EACxB,MAAA,MAAA,GAAS,CAAA,GAAI,CAAA;EAAA,IACf;EAEA,IAAA,CAAA,GAAI,IAAIA,WAAU,GAAG,CAAA;EAGrB,IAAA,WAAU;EAER,MAAA,IAAI,MAAA,EAAQ;EACV,QAAA,CAAA,GAAI,CAAA,CAAE,MAAM,CAAC,CAAA;EACb,QAAA,IAAI,CAAC,EAAE,CAAA,EAAG;EAEV,QAAA,IAAI,CAAA,EAAG;EACL,UAAA,IAAI,EAAE,CAAA,CAAE,MAAA,GAAS,CAAA,EAAG,CAAA,CAAE,EAAE,MAAA,GAAS,CAAA;EAAA,QACnC,WAAW,QAAA,EAAU;EACnB,UAAA,CAAA,GAAI,CAAA,CAAE,IAAI,CAAC,CAAA;EAAA,QACb;EAAA,MACF;EAEA,MAAA,IAAI,CAAA,EAAG;EACL,QAAA,CAAA,GAAI,SAAA,CAAU,IAAI,CAAC,CAAA;EACnB,QAAA,IAAI,MAAM,CAAA,EAAG;EACb,QAAA,MAAA,GAAS,CAAA,GAAI,CAAA;EAAA,MACf,CAAA,MAAO;EACL,QAAA,CAAA,GAAI,CAAA,CAAE,MAAM,IAAI,CAAA;EAChB,QAAA,KAAA,CAAM,CAAA,EAAG,CAAA,CAAE,CAAA,GAAI,CAAA,EAAG,CAAC,CAAA;EAEnB,QAAA,IAAI,CAAA,CAAE,IAAI,EAAA,EAAI;EACZ,UAAA,MAAA,GAAS,MAAM,CAAC,CAAA;EAAA,QAClB,CAAA,MAAO;EACL,UAAA,CAAA,GAAI,CAAC,QAAQ,CAAC,CAAA;EACd,UAAA,IAAI,MAAM,CAAA,EAAG;EACb,UAAA,MAAA,GAAS,CAAA,GAAI,CAAA;EAAA,QACf;EAAA,MACF;EAEA,MAAA,CAAA,GAAI,CAAA,CAAE,MAAM,CAAC,CAAA;EAEb,MAAA,IAAI,CAAA,EAAG;EACL,QAAA,IAAI,CAAA,CAAE,KAAK,CAAA,CAAE,CAAA,CAAE,SAAS,CAAA,EAAG,CAAA,CAAE,EAAE,MAAA,GAAS,CAAA;EAAA,MAC1C,WAAW,QAAA,EAAU;EACnB,QAAA,CAAA,GAAI,CAAA,CAAE,IAAI,CAAC,CAAA;EAAA,MACb;EAAA,IACF;EAEA,IAAA,IAAI,UAAU,OAAO,CAAA;EACrB,IAAA,IAAI,MAAA,EAAQ,CAAA,GAAI,GAAA,CAAI,GAAA,CAAI,CAAC,CAAA;EAEzB,IAAA,OAAO,CAAA,GAAI,CAAA,CAAE,GAAA,CAAI,CAAC,CAAA,GAAI,CAAA,GAAI,KAAA,CAAM,CAAA,EAAG,aAAA,EAAe,aAAA,EAAe,IAAI,CAAA,GAAI,CAAA;EAAA,EAC3E,CAAA;EAWA,EAAA,CAAA,CAAE,YAAA,GAAe,SAAU,EAAA,EAAI;EAC7B,IAAA,IAAI,CAAA,GAAI,IAAIA,UAAAA,CAAU,IAAI,CAAA;EAC1B,IAAA,IAAI,EAAA,IAAM,MAAM,EAAA,GAAK,aAAA;EAAA,SAChB,QAAA,CAAS,EAAA,EAAI,CAAA,EAAG,CAAC,CAAA;EACtB,IAAA,OAAO,KAAA,CAAM,CAAA,EAAG,CAAA,CAAE,CAAA,GAAI,GAAG,EAAE,CAAA;EAAA,EAC7B,CAAA;EAOA,EAAA,CAAA,CAAE,SAAA,GAAY,CAAA,CAAE,EAAA,GAAK,SAAU,GAAG,CAAA,EAAG;EACnC,IAAA,OAAO,QAAQ,IAAA,EAAM,IAAIA,WAAU,CAAA,EAAG,CAAC,CAAC,CAAA,KAAM,CAAA;EAAA,EAChD,CAAA;EAMA,EAAA,CAAA,CAAE,WAAW,WAAY;EACvB,IAAA,OAAO,CAAC,CAAC,IAAA,CAAK,CAAA;EAAA,EAChB,CAAA;EAOA,EAAA,CAAA,CAAE,aAAA,GAAgB,CAAA,CAAE,EAAA,GAAK,SAAU,GAAG,CAAA,EAAG;EACvC,IAAA,OAAO,QAAQ,IAAA,EAAM,IAAIA,WAAU,CAAA,EAAG,CAAC,CAAC,CAAA,GAAI,CAAA;EAAA,EAC9C,CAAA;EAOA,EAAA,CAAA,CAAE,sBAAA,GAAyB,CAAA,CAAE,GAAA,GAAM,SAAU,GAAG,CAAA,EAAG;EACjD,IAAA,OAAA,CAAQ,CAAA,GAAI,OAAA,CAAQ,IAAA,EAAM,IAAIA,UAAAA,CAAU,GAAG,CAAC,CAAC,CAAA,MAAO,CAAA,IAAK,CAAA,KAAM,CAAA;EAAA,EAEjE,CAAA;EAMA,EAAA,CAAA,CAAE,YAAY,WAAY;EACxB,IAAA,OAAO,CAAC,CAAC,IAAA,CAAK,CAAA,IAAK,QAAA,CAAS,IAAA,CAAK,CAAA,GAAI,QAAQ,CAAA,GAAI,IAAA,CAAK,CAAA,CAAE,MAAA,GAAS,CAAA;EAAA,EACnE,CAAA;EAOA,EAAA,CAAA,CAAE,UAAA,GAAa,CAAA,CAAE,EAAA,GAAK,SAAU,GAAG,CAAA,EAAG;EACpC,IAAA,OAAO,QAAQ,IAAA,EAAM,IAAIA,WAAU,CAAA,EAAG,CAAC,CAAC,CAAA,GAAI,CAAA;EAAA,EAC9C,CAAA;EAOA,EAAA,CAAA,CAAE,mBAAA,GAAsB,CAAA,CAAE,GAAA,GAAM,SAAU,GAAG,CAAA,EAAG;EAC9C,IAAA,OAAA,CAAQ,CAAA,GAAI,OAAA,CAAQ,IAAA,EAAM,IAAIA,UAAAA,CAAU,GAAG,CAAC,CAAC,CAAA,MAAO,EAAA,IAAM,CAAA,KAAM,CAAA;EAAA,EAClE,CAAA;EAMA,EAAA,CAAA,CAAE,QAAQ,WAAY;EACpB,IAAA,OAAO,CAAC,IAAA,CAAK,CAAA;EAAA,EACf,CAAA;EAMA,EAAA,CAAA,CAAE,aAAa,WAAY;EACzB,IAAA,OAAO,KAAK,CAAA,GAAI,CAAA;EAAA,EAClB,CAAA;EAMA,EAAA,CAAA,CAAE,aAAa,WAAY;EACzB,IAAA,OAAO,KAAK,CAAA,GAAI,CAAA;EAAA,EAClB,CAAA;EAMA,EAAA,CAAA,CAAE,SAAS,WAAY;EACrB,IAAA,OAAO,CAAC,CAAC,IAAA,CAAK,KAAK,IAAA,CAAK,CAAA,CAAE,CAAC,CAAA,IAAK,CAAA;EAAA,EAClC,CAAA;EAuBA,EAAA,CAAA,CAAE,KAAA,GAAQ,SAAU,CAAA,EAAG,CAAA,EAAG;EACxB,IAAA,IAAI,GAAG,CAAA,EAAG,CAAA,EAAG,MACX,CAAA,GAAI,IAAA,EACJ,IAAI,CAAA,CAAE,CAAA;EAER,IAAA,CAAA,GAAI,IAAIA,UAAAA,CAAU,CAAA,EAAG,CAAC,CAAA;EACtB,IAAA,CAAA,GAAI,CAAA,CAAE,CAAA;EAGN,IAAA,IAAI,CAAC,CAAA,IAAK,CAAC,GAAG,OAAO,IAAIA,WAAU,GAAG,CAAA;EAGtC,IAAA,IAAI,KAAK,CAAA,EAAG;EACV,MAAA,CAAA,CAAE,IAAI,CAAC,CAAA;EACP,MAAA,OAAO,CAAA,CAAE,KAAK,CAAC,CAAA;EAAA,IACjB;EAEA,IAAA,IAAI,EAAA,GAAK,CAAA,CAAE,CAAA,GAAI,QAAA,EACb,EAAA,GAAK,CAAA,CAAE,CAAA,GAAI,QAAA,EACX,EAAA,GAAK,CAAA,CAAE,CAAA,EACP,EAAA,GAAK,CAAA,CAAE,CAAA;EAET,IAAA,IAAI,CAAC,EAAA,IAAM,CAAC,EAAA,EAAI;EAGd,MAAA,IAAI,CAAC,EAAA,IAAM,CAAC,EAAA,SAAW,EAAA,IAAM,CAAA,CAAE,CAAA,GAAI,CAAC,GAAG,CAAA,IAAK,IAAIA,UAAAA,CAAU,EAAA,GAAK,IAAI,GAAG,CAAA;EAGtE,MAAA,IAAI,CAAC,EAAA,CAAG,CAAC,KAAK,CAAC,EAAA,CAAG,CAAC,CAAA,EAAG;EAGpB,QAAA,OAAO,EAAA,CAAG,CAAC,CAAA,IAAK,CAAA,CAAE,CAAA,GAAI,CAAC,CAAA,EAAG,CAAA,IAAK,IAAIA,UAAAA,CAAU,EAAA,CAAG,CAAC,CAAA,GAAI,CAAA;EAAA;EAAA,UAGpD,aAAA,IAAiB,IAAI,EAAA,GAAK;EAAA,SAAC,CAAA;EAAA,MAC9B;EAAA,IACF;EAEA,IAAA,EAAA,GAAK,SAAS,EAAE,CAAA;EAChB,IAAA,EAAA,GAAK,SAAS,EAAE,CAAA;EAChB,IAAA,EAAA,GAAK,GAAG,KAAA,EAAM;EAGd,IAAA,IAAI,CAAA,GAAI,KAAK,EAAA,EAAI;EAEf,MAAA,IAAI,IAAA,GAAO,IAAI,CAAA,EAAG;EAChB,QAAA,CAAA,GAAI,CAAC,CAAA;EACL,QAAA,CAAA,GAAI,EAAA;EAAA,MACN,CAAA,MAAO;EACL,QAAA,EAAA,GAAK,EAAA;EACL,QAAA,CAAA,GAAI,EAAA;EAAA,MACN;EAEA,MAAA,CAAA,CAAE,OAAA,EAAQ;EAGV,MAAA,KAAK,IAAI,CAAA,EAAG,CAAA,EAAA,EAAK,CAAA,CAAE,IAAA,CAAK,CAAC,CAAA,EAAE;EAC3B,MAAA,CAAA,CAAE,OAAA,EAAQ;EAAA,IACZ,CAAA,MAAO;EAGL,MAAA,CAAA,GAAA,CAAK,QAAQ,CAAA,GAAI,EAAA,CAAG,WAAW,CAAA,GAAI,EAAA,CAAG,WAAW,CAAA,GAAI,CAAA;EAErD,MAAA,KAAK,CAAA,GAAI,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,GAAG,CAAA,EAAA,EAAK;EAE1B,QAAA,IAAI,EAAA,CAAG,CAAC,CAAA,IAAK,EAAA,CAAG,CAAC,CAAA,EAAG;EAClB,UAAA,IAAA,GAAO,EAAA,CAAG,CAAC,CAAA,GAAI,EAAA,CAAG,CAAC,CAAA;EACnB,UAAA;EAAA,QACF;EAAA,MACF;EAAA,IACF;EAGA,IAAA,IAAI,IAAA,EAAM;EACR,MAAA,CAAA,GAAI,EAAA;EACJ,MAAA,EAAA,GAAK,EAAA;EACL,MAAA,EAAA,GAAK,CAAA;EACL,MAAA,CAAA,CAAE,CAAA,GAAI,CAAC,CAAA,CAAE,CAAA;EAAA,IACX;EAEA,IAAA,CAAA,GAAA,CAAK,CAAA,GAAI,EAAA,CAAG,MAAA,KAAW,CAAA,GAAI,EAAA,CAAG,MAAA,CAAA;EAI9B,IAAA,IAAI,IAAI,CAAA,EAAG,OAAO,KAAK,EAAA,CAAG,CAAA,EAAG,IAAI,CAAA,EAAE;EACnC,IAAA,CAAA,GAAI,IAAA,GAAO,CAAA;EAGX,IAAA,OAAO,IAAI,CAAA,IAAI;EAEb,MAAA,IAAI,GAAG,EAAE,CAAC,CAAA,GAAI,EAAA,CAAG,CAAC,CAAA,EAAG;EACnB,QAAA,KAAK,CAAA,GAAI,CAAA,EAAG,CAAA,IAAK,CAAC,EAAA,CAAG,EAAE,CAAC,CAAA,EAAG,EAAA,CAAG,CAAC,CAAA,GAAI,CAAA,EAAE;EACrC,QAAA,EAAE,GAAG,CAAC,CAAA;EACN,QAAA,EAAA,CAAG,CAAC,CAAA,IAAK,IAAA;EAAA,MACX;EAEA,MAAA,EAAA,CAAG,CAAC,CAAA,IAAK,EAAA,CAAG,CAAC,CAAA;EAAA,IACf;EAGA,IAAA,OAAO,EAAA,CAAG,CAAC,CAAA,IAAK,CAAA,EAAG,EAAA,CAAG,OAAO,CAAA,EAAG,CAAC,CAAA,EAAG,EAAE,EAAA,EAAG;EAGzC,IAAA,IAAI,CAAC,EAAA,CAAG,CAAC,CAAA,EAAG;EAIV,MAAA,CAAA,CAAE,CAAA,GAAI,aAAA,IAAiB,CAAA,GAAI,EAAA,GAAK,CAAA;EAChC,MAAA,CAAA,CAAE,CAAA,GAAI,CAAC,CAAA,CAAE,CAAA,GAAI,CAAC,CAAA;EACd,MAAA,OAAO,CAAA;EAAA,IACT;EAIA,IAAA,OAAO,SAAA,CAAU,CAAA,EAAG,EAAA,EAAI,EAAE,CAAA;EAAA,EAC5B,CAAA;EAwBA,EAAA,CAAA,CAAE,MAAA,GAAS,CAAA,CAAE,GAAA,GAAM,SAAU,GAAG,CAAA,EAAG;EACjC,IAAA,IAAI,CAAA,EAAG,GACL,CAAA,GAAI,IAAA;EAEN,IAAA,CAAA,GAAI,IAAIA,UAAAA,CAAU,CAAA,EAAG,CAAC,CAAA;EAGtB,IAAA,IAAI,CAAC,CAAA,CAAE,CAAA,IAAK,CAAC,CAAA,CAAE,CAAA,IAAK,CAAA,CAAE,CAAA,IAAK,CAAC,CAAA,CAAE,CAAA,CAAE,CAAC,CAAA,EAAG;EAClC,MAAA,OAAO,IAAIA,WAAU,GAAG,CAAA;EAAA,IAG1B,CAAA,MAAA,IAAW,CAAC,CAAA,CAAE,CAAA,IAAK,CAAA,CAAE,KAAK,CAAC,CAAA,CAAE,CAAA,CAAE,CAAC,CAAA,EAAG;EACjC,MAAA,OAAO,IAAIA,WAAU,CAAC,CAAA;EAAA,IACxB;EAEA,IAAA,IAAI,eAAe,CAAA,EAAG;EAIpB,MAAA,CAAA,GAAI,CAAA,CAAE,CAAA;EACN,MAAA,CAAA,CAAE,CAAA,GAAI,CAAA;EACN,MAAA,CAAA,GAAI,GAAA,CAAI,CAAA,EAAG,CAAA,EAAG,CAAA,EAAG,CAAC,CAAA;EAClB,MAAA,CAAA,CAAE,CAAA,GAAI,CAAA;EACN,MAAA,CAAA,CAAE,CAAA,IAAK,CAAA;EAAA,IACT,CAAA,MAAO;EACL,MAAA,CAAA,GAAI,GAAA,CAAI,CAAA,EAAG,CAAA,EAAG,CAAA,EAAG,WAAW,CAAA;EAAA,IAC9B;EAEA,IAAA,CAAA,GAAI,CAAA,CAAE,KAAA,CAAM,CAAA,CAAE,KAAA,CAAM,CAAC,CAAC,CAAA;EAGtB,IAAA,IAAI,CAAC,EAAE,CAAA,CAAE,CAAC,KAAK,WAAA,IAAe,CAAA,EAAG,CAAA,CAAE,CAAA,GAAI,CAAA,CAAE,CAAA;EAEzC,IAAA,OAAO,CAAA;EAAA,EACT,CAAA;EAuBA,EAAA,CAAA,CAAE,YAAA,GAAe,CAAA,CAAE,KAAA,GAAQ,SAAU,GAAG,CAAA,EAAG;EACzC,IAAA,IAAI,CAAA,EAAG,CAAA,EAAG,CAAA,EAAG,CAAA,EAAG,CAAA,EAAG,CAAA,EAAG,GAAA,EAAK,GAAA,EAAK,GAAA,EAAK,GAAA,EAAK,GAAA,EAAK,GAAA,EAAK,EAAA,EAClD,MAAM,QAAA,EACN,CAAA,GAAI,IAAA,EACJ,EAAA,GAAK,CAAA,CAAE,CAAA,EACP,EAAA,GAAA,CAAM,CAAA,GAAI,IAAIA,UAAAA,CAAU,CAAA,EAAG,CAAC,CAAA,EAAG,CAAA;EAGjC,IAAA,IAAI,CAAC,EAAA,IAAM,CAAC,EAAA,IAAM,CAAC,EAAA,CAAG,CAAC,CAAA,IAAK,CAAC,EAAA,CAAG,CAAC,CAAA,EAAG;EAGlC,MAAA,IAAI,CAAC,CAAA,CAAE,CAAA,IAAK,CAAC,CAAA,CAAE,CAAA,IAAK,MAAM,CAAC,EAAA,CAAG,CAAC,CAAA,IAAK,CAAC,MAAM,EAAA,IAAM,CAAC,GAAG,CAAC,CAAA,IAAK,CAAC,EAAA,EAAI;EAC9D,QAAA,CAAA,CAAE,CAAA,GAAI,CAAA,CAAE,CAAA,GAAI,CAAA,CAAE,CAAA,GAAI,IAAA;EAAA,MACpB,CAAA,MAAO;EACL,QAAA,CAAA,CAAE,KAAK,CAAA,CAAE,CAAA;EAGT,QAAA,IAAI,CAAC,EAAA,IAAM,CAAC,EAAA,EAAI;EACd,UAAA,CAAA,CAAE,CAAA,GAAI,EAAE,CAAA,GAAI,IAAA;EAAA,QAGd,CAAA,MAAO;EACL,UAAA,CAAA,CAAE,CAAA,GAAI,CAAC,CAAC,CAAA;EACR,UAAA,CAAA,CAAE,CAAA,GAAI,CAAA;EAAA,QACR;EAAA,MACF;EAEA,MAAA,OAAO,CAAA;EAAA,IACT;EAEA,IAAA,CAAA,GAAI,QAAA,CAAS,EAAE,CAAA,GAAI,QAAQ,IAAI,QAAA,CAAS,CAAA,CAAE,IAAI,QAAQ,CAAA;EACtD,IAAA,CAAA,CAAE,KAAK,CAAA,CAAE,CAAA;EACT,IAAA,GAAA,GAAM,EAAA,CAAG,MAAA;EACT,IAAA,GAAA,GAAM,EAAA,CAAG,MAAA;EAGT,IAAA,IAAI,MAAM,GAAA,EAAK;EACb,MAAA,EAAA,GAAK,EAAA;EACL,MAAA,EAAA,GAAK,EAAA;EACL,MAAA,EAAA,GAAK,EAAA;EACL,MAAA,CAAA,GAAI,GAAA;EACJ,MAAA,GAAA,GAAM,GAAA;EACN,MAAA,GAAA,GAAM,CAAA;EAAA,IACR;EAGA,IAAA,KAAK,CAAA,GAAI,GAAA,GAAM,GAAA,EAAK,EAAA,GAAK,IAAI,CAAA,EAAA,EAAK,EAAA,CAAG,IAAA,CAAK,CAAC,CAAA,EAAE;EAE7C,IAAA,IAAA,GAAO,IAAA;EACP,IAAA,QAAA,GAAW,SAAA;EAEX,IAAA,KAAK,CAAA,GAAI,GAAA,EAAK,EAAE,CAAA,IAAK,CAAA,IAAI;EACvB,MAAA,CAAA,GAAI,CAAA;EACJ,MAAA,GAAA,GAAM,EAAA,CAAG,CAAC,CAAA,GAAI,QAAA;EACd,MAAA,GAAA,GAAM,EAAA,CAAG,CAAC,CAAA,GAAI,QAAA,GAAW,CAAA;EAEzB,MAAA,KAAK,IAAI,GAAA,EAAK,CAAA,GAAI,CAAA,GAAI,CAAA,EAAG,IAAI,CAAA,IAAI;EAC/B,QAAA,GAAA,GAAM,EAAA,CAAG,EAAE,CAAC,CAAA,GAAI,QAAA;EAChB,QAAA,GAAA,GAAM,EAAA,CAAG,CAAC,CAAA,GAAI,QAAA,GAAW,CAAA;EACzB,QAAA,CAAA,GAAI,GAAA,GAAM,MAAM,GAAA,GAAM,GAAA;EACtB,QAAA,GAAA,GAAM,MAAM,GAAA,GAAQ,CAAA,GAAI,WAAY,QAAA,GAAY,EAAA,CAAG,CAAC,CAAA,GAAI,CAAA;EACxD,QAAA,CAAA,GAAA,CAAK,MAAM,IAAA,GAAO,CAAA,KAAM,CAAA,GAAI,QAAA,GAAW,KAAK,GAAA,GAAM,GAAA;EAClD,QAAA,EAAA,CAAG,CAAA,EAAG,IAAI,GAAA,GAAM,IAAA;EAAA,MAClB;EAEA,MAAA,EAAA,CAAG,CAAC,CAAA,GAAI,CAAA;EAAA,IACV;EAEA,IAAA,IAAI,CAAA,EAAG;EACL,MAAA,EAAE,CAAA;EAAA,IACJ,CAAA,MAAO;EACL,MAAA,EAAA,CAAG,MAAA,CAAO,GAAG,CAAC,CAAA;EAAA,IAChB;EAEA,IAAA,OAAO,SAAA,CAAU,CAAA,EAAG,EAAA,EAAI,CAAC,CAAA;EAAA,EAC3B,CAAA;EAOA,EAAA,CAAA,CAAE,UAAU,WAAY;EACtB,IAAA,IAAI,CAAA,GAAI,IAAIA,UAAAA,CAAU,IAAI,CAAA;EAC1B,IAAA,CAAA,CAAE,CAAA,GAAI,CAAC,CAAA,CAAE,CAAA,IAAK,IAAA;EACd,IAAA,OAAO,CAAA;EAAA,EACT,CAAA;EAuBA,EAAA,CAAA,CAAE,IAAA,GAAO,SAAU,CAAA,EAAG,CAAA,EAAG;EACvB,IAAA,IAAI,CAAA,EACF,CAAA,GAAI,IAAA,EACJ,CAAA,GAAI,CAAA,CAAE,CAAA;EAER,IAAA,CAAA,GAAI,IAAIA,UAAAA,CAAU,CAAA,EAAG,CAAC,CAAA;EACtB,IAAA,CAAA,GAAI,CAAA,CAAE,CAAA;EAGN,IAAA,IAAI,CAAC,CAAA,IAAK,CAAC,GAAG,OAAO,IAAIA,WAAU,GAAG,CAAA;EAGrC,IAAA,IAAI,KAAK,CAAA,EAAG;EACX,MAAA,CAAA,CAAE,IAAI,CAAC,CAAA;EACP,MAAA,OAAO,CAAA,CAAE,MAAM,CAAC,CAAA;EAAA,IAClB;EAEA,IAAA,IAAI,EAAA,GAAK,CAAA,CAAE,CAAA,GAAI,QAAA,EACb,EAAA,GAAK,CAAA,CAAE,CAAA,GAAI,QAAA,EACX,EAAA,GAAK,CAAA,CAAE,CAAA,EACP,EAAA,GAAK,CAAA,CAAE,CAAA;EAET,IAAA,IAAI,CAAC,EAAA,IAAM,CAAC,EAAA,EAAI;EAGd,MAAA,IAAI,CAAC,MAAM,CAAC,EAAA,SAAW,IAAIA,UAAAA,CAAU,IAAI,CAAC,CAAA;EAI1C,MAAA,IAAI,CAAC,GAAG,CAAC,CAAA,IAAK,CAAC,EAAA,CAAG,CAAC,GAAG,OAAO,EAAA,CAAG,CAAC,CAAA,GAAI,CAAA,GAAI,IAAIA,UAAAA,CAAU,EAAA,CAAG,CAAC,CAAA,GAAI,CAAA,GAAI,IAAI,CAAC,CAAA;EAAA,IAC1E;EAEA,IAAA,EAAA,GAAK,SAAS,EAAE,CAAA;EAChB,IAAA,EAAA,GAAK,SAAS,EAAE,CAAA;EAChB,IAAA,EAAA,GAAK,GAAG,KAAA,EAAM;EAGd,IAAA,IAAI,CAAA,GAAI,KAAK,EAAA,EAAI;EACf,MAAA,IAAI,IAAI,CAAA,EAAG;EACT,QAAA,EAAA,GAAK,EAAA;EACL,QAAA,CAAA,GAAI,EAAA;EAAA,MACN,CAAA,MAAO;EACL,QAAA,CAAA,GAAI,CAAC,CAAA;EACL,QAAA,CAAA,GAAI,EAAA;EAAA,MACN;EAEA,MAAA,CAAA,CAAE,OAAA,EAAQ;EACV,MAAA,OAAO,CAAA,EAAA,EAAK,CAAA,CAAE,IAAA,CAAK,CAAC,CAAA,EAAE;EACtB,MAAA,CAAA,CAAE,OAAA,EAAQ;EAAA,IACZ;EAEA,IAAA,CAAA,GAAI,EAAA,CAAG,MAAA;EACP,IAAA,CAAA,GAAI,EAAA,CAAG,MAAA;EAGP,IAAA,IAAI,CAAA,GAAI,IAAI,CAAA,EAAG;EACb,MAAA,CAAA,GAAI,EAAA;EACJ,MAAA,EAAA,GAAK,EAAA;EACL,MAAA,EAAA,GAAK,CAAA;EACL,MAAA,CAAA,GAAI,CAAA;EAAA,IACN;EAGA,IAAA,KAAK,CAAA,GAAI,GAAG,CAAA,IAAI;EACd,MAAA,CAAA,GAAA,CAAK,EAAA,CAAG,EAAE,CAAC,CAAA,GAAI,EAAA,CAAG,CAAC,CAAA,GAAI,EAAA,CAAG,CAAC,CAAA,GAAI,CAAA,IAAK,IAAA,GAAO,CAAA;EAC3C,MAAA,EAAA,CAAG,CAAC,IAAI,IAAA,KAAS,EAAA,CAAG,CAAC,CAAA,GAAI,CAAA,GAAI,EAAA,CAAG,CAAC,CAAA,GAAI,IAAA;EAAA,IACvC;EAEA,IAAA,IAAI,CAAA,EAAG;EACL,MAAA,EAAA,GAAK,CAAC,CAAC,CAAA,CAAE,MAAA,CAAO,EAAE,CAAA;EAClB,MAAA,EAAE,EAAA;EAAA,IACJ;EAIA,IAAA,OAAO,SAAA,CAAU,CAAA,EAAG,EAAA,EAAI,EAAE,CAAA;EAAA,EAC5B,CAAA;EAkBA,EAAA,CAAA,CAAE,SAAA,GAAY,CAAA,CAAE,EAAA,GAAK,SAAU,IAAI,EAAA,EAAI;EACrC,IAAA,IAAI,CAAA,EAAG,CAAA,EAAG,CAAA,EACR,CAAA,GAAI,IAAA;EAEN,IAAA,IAAI,EAAA,IAAM,IAAA,IAAQ,EAAA,KAAO,CAAC,CAAC,EAAA,EAAI;EAC7B,MAAA,QAAA,CAAS,EAAA,EAAI,GAAG,GAAG,CAAA;EACnB,MAAA,IAAI,EAAA,IAAM,MAAM,EAAA,GAAK,aAAA;EAAA,WAChB,QAAA,CAAS,EAAA,EAAI,CAAA,EAAG,CAAC,CAAA;EAEtB,MAAA,OAAO,MAAM,IAAIA,UAAAA,CAAU,CAAC,CAAA,EAAG,IAAI,EAAE,CAAA;EAAA,IACvC;EAEA,IAAA,IAAI,EAAE,CAAA,GAAI,CAAA,CAAE,CAAA,CAAA,EAAI,OAAO,IAAA;EACvB,IAAA,CAAA,GAAI,EAAE,MAAA,GAAS,CAAA;EACf,IAAA,CAAA,GAAI,IAAI,QAAA,GAAW,CAAA;EAEnB,IAAA,IAAI,CAAA,GAAI,CAAA,CAAE,CAAC,CAAA,EAAG;EAGZ,MAAA,OAAO,CAAA,GAAI,EAAA,IAAM,CAAA,EAAG,CAAA,IAAK,IAAI,CAAA,EAAA,EAAI;EAGjC,MAAA,KAAK,CAAA,GAAI,EAAE,CAAC,CAAA,EAAG,KAAK,EAAA,EAAI,CAAA,IAAK,IAAI,CAAA,EAAA,EAAI;EAAA,IACvC;EAEA,IAAA,IAAI,MAAM,CAAA,CAAE,CAAA,GAAI,IAAI,CAAA,EAAG,CAAA,GAAI,EAAE,CAAA,GAAI,CAAA;EAEjC,IAAA,OAAO,CAAA;EAAA,EACT,CAAA;EAWA,EAAA,CAAA,CAAE,SAAA,GAAY,SAAU,CAAA,EAAG;EACzB,IAAA,QAAA,CAAS,CAAA,EAAG,CAAC,gBAAA,EAAkB,gBAAgB,CAAA;EAC/C,IAAA,OAAO,IAAA,CAAK,KAAA,CAAM,IAAA,GAAO,CAAC,CAAA;EAAA,EAC5B,CAAA;EAcA,EAAA,CAAA,CAAE,UAAA,GAAa,CAAA,CAAE,IAAA,GAAO,WAAY;EAClC,IAAA,IAAI,CAAA,EAAG,GAAG,CAAA,EAAG,GAAA,EAAK,GAChB,CAAA,GAAI,IAAA,EACJ,CAAA,GAAI,CAAA,CAAE,CAAA,EACN,CAAA,GAAI,EAAE,CAAA,EACN,CAAA,GAAI,EAAE,CAAA,EACN,EAAA,GAAK,iBAAiB,CAAA,EACtB,IAAA,GAAO,IAAIA,UAAAA,CAAU,KAAK,CAAA;EAG5B,IAAA,IAAI,MAAM,CAAA,IAAK,CAAC,KAAK,CAAC,CAAA,CAAE,CAAC,CAAA,EAAG;EAC1B,MAAA,OAAO,IAAIA,UAAAA,CAAU,CAAC,CAAA,IAAK,IAAI,CAAA,KAAM,CAAC,CAAA,IAAK,CAAA,CAAE,CAAC,CAAA,CAAA,GAAK,GAAA,GAAM,CAAA,GAAI,CAAA,GAAI,IAAI,CAAC,CAAA;EAAA,IACxE;EAGA,IAAA,CAAA,GAAI,IAAA,CAAK,IAAA,CAAK,CAAC,OAAA,CAAQ,CAAC,CAAC,CAAA;EAIzB,IAAA,IAAI,CAAA,IAAK,CAAA,IAAK,CAAA,IAAK,CAAA,GAAI,CAAA,EAAG;EACxB,MAAA,CAAA,GAAI,cAAc,CAAC,CAAA;EACnB,MAAA,IAAA,CAAK,CAAA,CAAE,MAAA,GAAS,CAAA,IAAK,CAAA,IAAK,GAAG,CAAA,IAAK,GAAA;EAClC,MAAA,CAAA,GAAI,IAAA,CAAK,IAAA,CAAK,CAAC,CAAC,CAAA;EAChB,MAAA,CAAA,GAAI,UAAU,CAAA,GAAI,CAAA,IAAK,CAAC,CAAA,IAAK,CAAA,GAAI,KAAK,CAAA,GAAI,CAAA,CAAA;EAE1C,MAAA,IAAI,CAAA,IAAK,IAAI,CAAA,EAAG;EACd,QAAA,CAAA,GAAI,IAAA,GAAO,CAAA;EAAA,MACb,CAAA,MAAO;EACL,QAAA,CAAA,GAAI,EAAE,aAAA,EAAc;EACpB,QAAA,CAAA,GAAI,CAAA,CAAE,MAAM,CAAA,EAAG,CAAA,CAAE,QAAQ,GAAG,CAAA,GAAI,CAAC,CAAA,GAAI,CAAA;EAAA,MACvC;EAEA,MAAA,CAAA,GAAI,IAAIA,WAAU,CAAC,CAAA;EAAA,IACrB,CAAA,MAAO;EACL,MAAA,CAAA,GAAI,IAAIA,UAAAA,CAAU,CAAA,GAAI,EAAE,CAAA;EAAA,IAC1B;EAMA,IAAA,IAAI,CAAA,CAAE,CAAA,CAAE,CAAC,CAAA,EAAG;EACV,MAAA,CAAA,GAAI,CAAA,CAAE,CAAA;EACN,MAAA,CAAA,GAAI,CAAA,GAAI,EAAA;EACR,MAAA,IAAI,CAAA,GAAI,GAAG,CAAA,GAAI,CAAA;EAGf,MAAA,WAAU;EACR,QAAA,CAAA,GAAI,CAAA;EACJ,QAAA,CAAA,GAAI,IAAA,CAAK,KAAA,CAAM,CAAA,CAAE,IAAA,CAAK,GAAA,CAAI,GAAG,CAAA,EAAG,EAAA,EAAI,CAAC,CAAC,CAAC,CAAA;EAEvC,QAAA,IAAI,cAAc,CAAA,CAAE,CAAC,CAAA,CAAE,KAAA,CAAM,GAAG,CAAC,CAAA,KAAA,CAAO,CAAA,GAAI,aAAA,CAAc,EAAE,CAAC,CAAA,EAAG,KAAA,CAAM,CAAA,EAAG,CAAC,CAAA,EAAG;EAK3E,UAAA,IAAI,CAAA,CAAE,CAAA,GAAI,CAAA,EAAG,EAAE,CAAA;EACf,UAAA,CAAA,GAAI,CAAA,CAAE,KAAA,CAAM,CAAA,GAAI,CAAA,EAAG,IAAI,CAAC,CAAA;EAKxB,UAAA,IAAI,CAAA,IAAK,MAAA,IAAU,CAAC,GAAA,IAAO,KAAK,MAAA,EAAQ;EAItC,YAAA,IAAI,CAAC,GAAA,EAAK;EACR,cAAA,KAAA,CAAM,CAAA,EAAG,CAAA,CAAE,CAAA,GAAI,cAAA,GAAiB,GAAG,CAAC,CAAA;EAEpC,cAAA,IAAI,EAAE,KAAA,CAAM,CAAC,CAAA,CAAE,EAAA,CAAG,CAAC,CAAA,EAAG;EACpB,gBAAA,CAAA,GAAI,CAAA;EACJ,gBAAA;EAAA,cACF;EAAA,YACF;EAEA,YAAA,EAAA,IAAM,CAAA;EACN,YAAA,CAAA,IAAK,CAAA;EACL,YAAA,GAAA,GAAM,CAAA;EAAA,UACR,CAAA,MAAO;EAIL,YAAA,IAAI,CAAC,CAAC,CAAA,IAAK,CAAC,CAAC,CAAA,CAAE,KAAA,CAAM,CAAC,CAAA,IAAK,CAAA,CAAE,MAAA,CAAO,CAAC,KAAK,GAAA,EAAK;EAG7C,cAAA,KAAA,CAAM,CAAA,EAAG,CAAA,CAAE,CAAA,GAAI,cAAA,GAAiB,GAAG,CAAC,CAAA;EACpC,cAAA,CAAA,GAAI,CAAC,CAAA,CAAE,KAAA,CAAM,CAAC,CAAA,CAAE,GAAG,CAAC,CAAA;EAAA,YACtB;EAEA,YAAA;EAAA,UACF;EAAA,QACF;EAAA,MACF;EAAA,IACF;EAEA,IAAA,OAAO,MAAM,CAAA,EAAG,CAAA,CAAE,IAAI,cAAA,GAAiB,CAAA,EAAG,eAAe,CAAC,CAAA;EAAA,EAC5D,CAAA;EAYA,EAAA,CAAA,CAAE,aAAA,GAAgB,SAAU,EAAA,EAAI,EAAA,EAAI;EAClC,IAAA,IAAI,MAAM,IAAA,EAAM;EACd,MAAA,QAAA,CAAS,EAAA,EAAI,GAAG,GAAG,CAAA;EACnB,MAAA,EAAA,EAAA;EAAA,IACF;EACA,IAAA,OAAO,MAAA,CAAO,IAAA,EAAM,EAAA,EAAI,EAAA,EAAI,CAAC,CAAA;EAAA,EAC/B,CAAA;EAeA,EAAA,CAAA,CAAE,OAAA,GAAU,SAAU,EAAA,EAAI,EAAA,EAAI;EAC5B,IAAA,IAAI,MAAM,IAAA,EAAM;EACd,MAAA,QAAA,CAAS,EAAA,EAAI,GAAG,GAAG,CAAA;EACnB,MAAA,EAAA,GAAK,EAAA,GAAK,KAAK,CAAA,GAAI,CAAA;EAAA,IACrB;EACA,IAAA,OAAO,MAAA,CAAO,IAAA,EAAM,EAAA,EAAI,EAAE,CAAA;EAAA,EAC5B,CAAA;EA4BA,EAAA,CAAA,CAAE,QAAA,GAAW,SAAU,EAAA,EAAI,EAAA,EAAIG,OAAAA,EAAQ;EACrC,IAAA,IAAI,KACF,CAAA,GAAI,IAAA;EAEN,IAAA,IAAIA,WAAU,IAAA,EAAM;EAClB,MAAA,IAAI,EAAA,IAAM,IAAA,IAAQ,EAAA,IAAM,OAAO,MAAM,QAAA,EAAU;EAC7C,QAAAA,OAAAA,GAAS,EAAA;EACT,QAAA,EAAA,GAAK,IAAA;EAAA,MACP,CAAA,MAAA,IAAW,EAAA,IAAM,OAAO,EAAA,IAAM,QAAA,EAAU;EACtC,QAAAA,OAAAA,GAAS,EAAA;EACT,QAAA,EAAA,GAAK,EAAA,GAAK,IAAA;EAAA,MACZ,CAAA,MAAO;EACL,QAAAA,OAAAA,GAAS,MAAA;EAAA,MACX;EAAA,IACF,CAAA,MAAA,IAAW,OAAOA,OAAAA,IAAU,QAAA,EAAU;EACpC,MAAA,MAAM,KAAA,CACH,cAAA,GAAiB,0BAAA,GAA6BA,OAAM,CAAA;EAAA,IACzD;EAEA,IAAA,GAAA,GAAM,CAAA,CAAE,OAAA,CAAQ,EAAA,EAAI,EAAE,CAAA;EAEtB,IAAA,IAAI,EAAE,CAAA,EAAG;EACP,MAAA,IAAI,GACF,GAAA,GAAM,GAAA,CAAI,KAAA,CAAM,GAAG,GACnB,EAAA,GAAK,CAACA,OAAAA,CAAO,SAAA,EACb,KAAK,CAACA,OAAAA,CAAO,oBACb,cAAA,GAAiBA,OAAAA,CAAO,kBAAkB,EAAA,EAC1C,OAAA,GAAU,GAAA,CAAI,CAAC,GACf,YAAA,GAAe,GAAA,CAAI,CAAC,CAAA,EACpB,QAAQ,CAAA,CAAE,CAAA,GAAI,CAAA,EACd,SAAA,GAAY,QAAQ,OAAA,CAAQ,KAAA,CAAM,CAAC,CAAA,GAAI,OAAA,EACvC,MAAM,SAAA,CAAU,MAAA;EAElB,MAAA,IAAI,EAAA,EAAI;EACN,QAAA,CAAA,GAAI,EAAA;EACJ,QAAA,EAAA,GAAK,EAAA;EACL,QAAA,EAAA,GAAK,CAAA;EACL,QAAA,GAAA,IAAO,CAAA;EAAA,MACT;EAEA,MAAA,IAAI,EAAA,GAAK,CAAA,IAAK,GAAA,GAAM,CAAA,EAAG;EACrB,QAAA,CAAA,GAAI,MAAM,EAAA,IAAM,EAAA;EAChB,QAAA,OAAA,GAAU,SAAA,CAAU,MAAA,CAAO,CAAA,EAAG,CAAC,CAAA;EAC/B,QAAA,OAAO,CAAA,GAAI,KAAK,CAAA,IAAK,EAAA,aAAe,cAAA,GAAiB,SAAA,CAAU,MAAA,CAAO,CAAA,EAAG,EAAE,CAAA;EAC3E,QAAA,IAAI,KAAK,CAAA,EAAG,OAAA,IAAW,cAAA,GAAiB,SAAA,CAAU,MAAM,CAAC,CAAA;EACzD,QAAA,IAAI,KAAA,YAAiB,GAAA,GAAM,OAAA;EAAA,MAC7B;EAEA,MAAA,GAAA,GAAM,YAAA,GACH,WAAWA,OAAAA,CAAO,gBAAA,IAAoB,QAAQ,EAAA,GAAK,CAACA,OAAAA,CAAO,iBAAA,IAC1D,YAAA,CAAa,OAAA;EAAA,QAAQ,IAAI,MAAA,CAAO,MAAA,GAAS,EAAA,GAAK,QAAQ,GAAG,CAAA;EAAA,QAC1D,IAAA,IAAQA,QAAO,sBAAA,IAA0B,EAAA;EAAA,UACxC,YAAA,CAAA,GACD,OAAA;EAAA,IACL;EAEA,IAAA,OAAA,CAAQA,OAAAA,CAAO,MAAA,IAAU,EAAA,IAAM,GAAA,IAAOA,QAAO,MAAA,IAAU,EAAA,CAAA;EAAA,EACzD,CAAA;EAcA,EAAA,CAAA,CAAE,UAAA,GAAa,SAAU,EAAA,EAAI;EAC3B,IAAA,IAAI,CAAA,EAAG,EAAA,EAAI,EAAA,EAAI,EAAA,EAAI,GAAG,GAAA,EAAK,CAAA,EAAG,EAAA,EAAI,EAAA,EAAI,GAAG,CAAA,EAAG,CAAA,EAC1C,CAAA,GAAI,IAAA,EACJ,KAAK,CAAA,CAAE,CAAA;EAET,IAAA,IAAI,MAAM,IAAA,EAAM;EACd,MAAA,CAAA,GAAI,IAAIH,WAAU,EAAE,CAAA;EAGpB,MAAA,IAAI,CAAC,CAAA,CAAE,SAAA,EAAU,KAAM,CAAA,CAAE,CAAA,IAAK,CAAA,CAAE,CAAA,KAAM,CAAA,CAAA,IAAM,CAAA,CAAE,EAAA,CAAG,GAAG,CAAA,EAAG;EACrD,QAAA,MAAM,KAAA,CACH,cAAA,GAAiB,WAAA,IACf,CAAA,CAAE,SAAA,KAAc,gBAAA,GAAmB,kBAAA,CAAA,GAAsB,OAAA,CAAQ,CAAC,CAAC,CAAA;EAAA,MAC1E;EAAA,IACF;EAEA,IAAA,IAAI,CAAC,EAAA,EAAI,OAAO,IAAIA,WAAU,CAAC,CAAA;EAE/B,IAAA,CAAA,GAAI,IAAIA,WAAU,GAAG,CAAA;EACrB,IAAA,EAAA,GAAK,EAAA,GAAK,IAAIA,UAAAA,CAAU,GAAG,CAAA;EAC3B,IAAA,EAAA,GAAK,EAAA,GAAK,IAAIA,UAAAA,CAAU,GAAG,CAAA;EAC3B,IAAA,CAAA,GAAI,cAAc,EAAE,CAAA;EAIpB,IAAA,CAAA,GAAI,CAAA,CAAE,CAAA,GAAI,CAAA,CAAE,MAAA,GAAS,EAAE,CAAA,GAAI,CAAA;EAC3B,IAAA,CAAA,CAAE,CAAA,CAAE,CAAC,CAAA,GAAI,QAAA,CAAA,CAAU,GAAA,GAAM,IAAI,QAAA,IAAY,CAAA,GAAI,QAAA,GAAW,GAAA,GAAM,GAAG,CAAA;EACjE,IAAA,EAAA,GAAK,CAAC,EAAA,IAAM,CAAA,CAAE,UAAA,CAAW,CAAC,IAAI,CAAA,GAAK,CAAA,GAAI,CAAA,GAAI,CAAA,GAAI,EAAA,GAAM,CAAA;EAErD,IAAA,GAAA,GAAM,OAAA;EACN,IAAA,OAAA,GAAU,CAAA,GAAI,CAAA;EACd,IAAA,CAAA,GAAI,IAAIA,WAAU,CAAC,CAAA;EAGnB,IAAA,EAAA,CAAG,CAAA,CAAE,CAAC,CAAA,GAAI,CAAA;EAEV,IAAA,WAAW;EACT,MAAA,CAAA,GAAI,GAAA,CAAI,CAAA,EAAG,CAAA,EAAG,CAAA,EAAG,CAAC,CAAA;EAClB,MAAA,EAAA,GAAK,EAAA,CAAG,IAAA,CAAK,CAAA,CAAE,KAAA,CAAM,EAAE,CAAC,CAAA;EACxB,MAAA,IAAI,EAAA,CAAG,UAAA,CAAW,EAAE,CAAA,IAAK,CAAA,EAAG;EAC5B,MAAA,EAAA,GAAK,EAAA;EACL,MAAA,EAAA,GAAK,EAAA;EACL,MAAA,EAAA,GAAK,GAAG,IAAA,CAAK,CAAA,CAAE,KAAA,CAAM,EAAA,GAAK,EAAE,CAAC,CAAA;EAC7B,MAAA,EAAA,GAAK,EAAA;EACL,MAAA,CAAA,GAAI,EAAE,KAAA,CAAM,CAAA,CAAE,KAAA,CAAM,EAAA,GAAK,CAAC,CAAC,CAAA;EAC3B,MAAA,CAAA,GAAI,EAAA;EAAA,IACN;EAEA,IAAA,EAAA,GAAK,IAAI,EAAA,CAAG,KAAA,CAAM,EAAE,CAAA,EAAG,EAAA,EAAI,GAAG,CAAC,CAAA;EAC/B,IAAA,EAAA,GAAK,EAAA,CAAG,IAAA,CAAK,EAAA,CAAG,KAAA,CAAM,EAAE,CAAC,CAAA;EACzB,IAAA,EAAA,GAAK,EAAA,CAAG,IAAA,CAAK,EAAA,CAAG,KAAA,CAAM,EAAE,CAAC,CAAA;EACzB,IAAA,EAAA,CAAG,CAAA,GAAI,EAAA,CAAG,CAAA,GAAI,CAAA,CAAE,CAAA;EAChB,IAAA,CAAA,GAAI,CAAA,GAAI,CAAA;EAGR,IAAA,CAAA,GAAI,GAAA,CAAI,EAAA,EAAI,EAAA,EAAI,CAAA,EAAG,aAAa,EAAE,KAAA,CAAM,CAAC,CAAA,CAAE,GAAA,EAAI,CAAE,UAAA;EAAA,MAC7C,GAAA,CAAI,IAAI,EAAA,EAAI,CAAA,EAAG,aAAa,CAAA,CAAE,KAAA,CAAM,CAAC,CAAA,CAAE,GAAA;EAAI,KAAC,GAAI,IAAI,CAAC,EAAA,EAAI,EAAE,CAAA,GAAI,CAAC,IAAI,EAAE,CAAA;EAE1E,IAAA,OAAA,GAAU,GAAA;EAEV,IAAA,OAAO,CAAA;EAAA,EACT,CAAA;EAMA,EAAA,CAAA,CAAE,WAAW,WAAY;EACvB,IAAA,OAAO,CAAC,QAAQ,IAAI,CAAA;EAAA,EACtB,CAAA;EAcA,EAAA,CAAA,CAAE,WAAA,GAAc,SAAU,EAAA,EAAI,EAAA,EAAI;EAChC,IAAA,IAAI,EAAA,IAAM,IAAA,EAAM,QAAA,CAAS,EAAA,EAAI,GAAG,GAAG,CAAA;EACnC,IAAA,OAAO,MAAA,CAAO,IAAA,EAAM,EAAA,EAAI,EAAA,EAAI,CAAC,CAAA;EAAA,EAC/B,CAAA;EAcA,EAAA,CAAA,CAAE,QAAA,GAAW,SAAU,CAAA,EAAG;EACxB,IAAA,IAAI,KACF,CAAA,GAAI,IAAA,EACJ,IAAI,CAAA,CAAE,CAAA,EACN,IAAI,CAAA,CAAE,CAAA;EAGR,IAAA,IAAI,MAAM,IAAA,EAAM;EACd,MAAA,IAAI,CAAA,EAAG;EACL,QAAA,GAAA,GAAM,UAAA;EACN,QAAA,IAAI,CAAA,GAAI,CAAA,EAAG,GAAA,GAAM,GAAA,GAAM,GAAA;EAAA,MACzB,CAAA,MAAO;EACL,QAAA,GAAA,GAAM,KAAA;EAAA,MACR;EAAA,IACF,CAAA,MAAO;EACL,MAAA,IAAI,KAAK,IAAA,EAAM;EACb,QAAA,GAAA,GAAM,KAAK,UAAA,IAAc,CAAA,IAAK,UAAA,GAC3B,aAAA,CAAc,cAAc,CAAA,CAAE,CAAC,CAAA,EAAG,CAAC,IACnC,YAAA,CAAa,aAAA,CAAc,EAAE,CAAC,CAAA,EAAG,GAAG,GAAG,CAAA;EAAA,MAC5C,CAAA,MAAA,IAAW,CAAA,KAAM,EAAA,IAAM,8BAAA,EAAgC;EACrD,QAAA,CAAA,GAAI,KAAA,CAAM,IAAIA,UAAAA,CAAU,CAAC,GAAG,cAAA,GAAiB,CAAA,GAAI,GAAG,aAAa,CAAA;EACjE,QAAA,GAAA,GAAM,aAAa,aAAA,CAAc,CAAA,CAAE,CAAC,CAAA,EAAG,CAAA,CAAE,GAAG,GAAG,CAAA;EAAA,MACjD,CAAA,MAAO;EACL,QAAA,QAAA,CAAS,CAAA,EAAG,CAAA,EAAG,QAAA,CAAS,MAAA,EAAQ,MAAM,CAAA;EACtC,QAAA,GAAA,GAAM,WAAA,CAAY,YAAA,CAAa,aAAA,CAAc,CAAA,CAAE,CAAC,CAAA,EAAG,CAAA,EAAG,GAAG,CAAA,EAAG,EAAA,EAAI,CAAA,EAAG,CAAA,EAAG,IAAI,CAAA;EAAA,MAC5E;EAEA,MAAA,IAAI,IAAI,CAAA,IAAK,CAAA,CAAE,EAAE,CAAC,CAAA,QAAS,GAAA,GAAM,GAAA;EAAA,IACnC;EAEA,IAAA,OAAO,GAAA;EAAA,EACT,CAAA;EAOA,EAAA,CAAA,CAAE,OAAA,GAAU,CAAA,CAAE,MAAA,GAAS,WAAY;EACjC,IAAA,OAAO,QAAQ,IAAI,CAAA;EAAA,EACrB,CAAA;EAGA,EAAA,CAAA,CAAE,YAAA,GAAe,IAAA;EAEjB,EAAA,CAAA,CAAE,MAAA,CAAO,WAAW,CAAA,GAAI,WAAA;EAGxB,EAAA,CAAA,iBAAE,MAAA,CAAO,GAAA,CAAI,4BAA4B,CAAC,IAAI,CAAA,CAAE,OAAA;EAEhD,EAAA,IAAI,YAAA,IAAgB,IAAA,EAAMA,UAAAA,CAAU,IAAI,YAAY,CAAA;EAEpD,EAAA,OAAOA,UAAAA;EACT;EASA,SAAS,SAAS,CAAA,EAAG;EACnB,EAAA,IAAI,IAAI,CAAA,GAAI,CAAA;EACZ,EAAA,OAAO,CAAA,GAAI,CAAA,IAAK,CAAA,KAAM,CAAA,GAAI,IAAI,CAAA,GAAI,CAAA;EACpC;EAIA,SAAS,cAAc,CAAA,EAAG;EACxB,EAAA,IAAI,CAAA,EAAG,CAAA,EACL,CAAA,GAAI,CAAA,EACJ,CAAA,GAAI,EAAE,MAAA,EACN,CAAA,GAAI,CAAA,CAAE,CAAC,CAAA,GAAI,EAAA;EAEb,EAAA,OAAO,IAAI,CAAA,IAAI;EACb,IAAA,CAAA,GAAI,CAAA,CAAE,GAAG,CAAA,GAAI,EAAA;EACb,IAAA,CAAA,GAAI,WAAW,CAAA,CAAE,MAAA;EACjB,IAAA,OAAO,CAAA,EAAA,EAAK,CAAA,GAAI,GAAA,GAAM,CAAA,EAAE;EACxB,IAAA,CAAA,IAAK,CAAA;EAAA,EACP;EAGA,EAAA,KAAK,CAAA,GAAI,EAAE,MAAA,EAAQ,CAAA,CAAE,WAAW,EAAE,CAAC,MAAM,EAAA,IAAI;EAE7C,EAAA,OAAO,CAAA,CAAE,KAAA,CAAM,CAAA,EAAG,CAAA,GAAI,KAAK,CAAC,CAAA;EAC9B;EAIA,SAAS,OAAA,CAAQ,GAAG,CAAA,EAAG;EACrB,EAAA,IAAI,GAAG,CAAA,EACL,EAAA,GAAK,EAAE,CAAA,EACP,EAAA,GAAK,EAAE,CAAA,EACP,CAAA,GAAI,CAAA,CAAE,CAAA,EACN,IAAI,CAAA,CAAE,CAAA,EACN,IAAI,CAAA,CAAE,CAAA,EACN,IAAI,CAAA,CAAE,CAAA;EAGR,EAAA,IAAI,CAAC,CAAA,IAAK,CAAC,CAAA,EAAG,OAAO,IAAA;EAErB,EAAA,CAAA,GAAI,EAAA,IAAM,CAAC,EAAA,CAAG,CAAC,CAAA;EACf,EAAA,CAAA,GAAI,EAAA,IAAM,CAAC,EAAA,CAAG,CAAC,CAAA;EAGf,EAAA,IAAI,KAAK,CAAA,EAAG,OAAO,IAAI,CAAA,GAAI,CAAA,GAAI,CAAC,CAAA,GAAI,CAAA;EAGpC,EAAA,IAAI,CAAA,IAAK,GAAG,OAAO,CAAA;EAEnB,EAAA,CAAA,GAAI,CAAA,GAAI,CAAA;EACR,EAAA,CAAA,GAAI,CAAA,IAAK,CAAA;EAGT,EAAA,IAAI,CAAC,EAAA,IAAM,CAAC,EAAA,EAAI,OAAO,IAAI,CAAA,GAAI,CAAC,EAAA,GAAK,CAAA,GAAI,CAAA,GAAI,EAAA;EAG7C,EAAA,IAAI,CAAC,CAAA,EAAG,OAAO,CAAA,GAAI,CAAA,GAAI,IAAI,CAAA,GAAI,EAAA;EAE/B,EAAA,CAAA,GAAA,CAAK,IAAI,EAAA,CAAG,MAAA,KAAW,CAAA,GAAI,EAAA,CAAG,UAAU,CAAA,GAAI,CAAA;EAG5C,EAAA,KAAK,CAAA,GAAI,GAAG,CAAA,GAAI,CAAA,EAAG,KAAK,IAAI,EAAA,CAAG,CAAC,CAAA,IAAK,EAAA,CAAG,CAAC,CAAA,EAAG,OAAO,GAAG,CAAC,CAAA,GAAI,GAAG,CAAC,CAAA,GAAI,IAAI,CAAA,GAAI,EAAA;EAG3E,EAAA,OAAO,KAAK,CAAA,GAAI,CAAA,GAAI,CAAA,GAAI,CAAA,GAAI,IAAI,CAAA,GAAI,EAAA;EACtC;EAMA,SAAS,QAAA,CAAS,CAAA,EAAG,GAAA,EAAK,GAAA,EAAK,IAAA,EAAM;EACnC,EAAA,IAAI,IAAI,GAAA,IAAO,CAAA,GAAI,OAAO,CAAA,KAAM,SAAA,CAAU,CAAC,CAAA,EAAG;EAC5C,IAAA,MAAM,MACJ,cAAA,IAAkB,IAAA,IAAQ,UAAA,CAAA,IAAe,OAAO,KAAK,QAAA,GAClD,CAAA,GAAI,GAAA,IAAO,CAAA,GAAI,MAAM,iBAAA,GAAoB,mBAAA,GACzC,2BAAA,CAAA,GAA+B,MAAA,CAAO,CAAC,CAAC,CAAA;EAAA,EAC/C;EACF;EAIA,SAAS,MAAM,CAAA,EAAG;EAChB,EAAA,IAAI,CAAA,GAAI,CAAA,CAAE,CAAA,CAAE,MAAA,GAAS,CAAA;EACrB,EAAA,OAAO,QAAA,CAAS,CAAA,CAAE,CAAA,GAAI,QAAQ,CAAA,IAAK,KAAK,CAAA,CAAE,CAAA,CAAE,CAAC,CAAA,GAAI,CAAA,IAAK,CAAA;EACxD;EAGA,SAAS,aAAA,CAAc,KAAK,CAAA,EAAG;EAC7B,EAAA,OAAA,CAAQ,IAAI,MAAA,GAAS,CAAA,GAAI,GAAA,CAAI,MAAA,CAAO,CAAC,CAAA,GAAI,GAAA,GAAM,GAAA,CAAI,KAAA,CAAM,CAAC,CAAA,GAAI,GAAA,KAC5D,CAAA,GAAI,CAAA,GAAI,MAAM,IAAA,CAAA,GAAQ,CAAA;EAC1B;EAGA,SAAS,YAAA,CAAa,GAAA,EAAK,CAAA,EAAG,CAAA,EAAG;EAC/B,EAAA,IAAI,GAAA,EAAK,EAAA;EAGT,EAAA,IAAI,IAAI,CAAA,EAAG;EAGT,IAAA,KAAK,KAAK,CAAA,GAAI,GAAA,EAAK,EAAE,CAAA,EAAG,MAAM,CAAA,EAAE;EAChC,IAAA,GAAA,GAAM,EAAA,GAAK,GAAA;EAAA,EAGb,CAAA,MAAO;EACL,IAAA,GAAA,GAAM,GAAA,CAAI,MAAA;EAGV,IAAA,IAAI,EAAE,IAAI,GAAA,EAAK;EACb,MAAA,KAAK,KAAK,CAAA,EAAG,CAAA,IAAK,KAAK,EAAE,CAAA,EAAG,MAAM,CAAA,EAAE;EACpC,MAAA,GAAA,IAAO,EAAA;EAAA,IACT,CAAA,MAAA,IAAW,IAAI,GAAA,EAAK;EAClB,MAAA,GAAA,GAAM,GAAA,CAAI,MAAM,CAAA,EAAG,CAAC,IAAI,GAAA,GAAM,GAAA,CAAI,MAAM,CAAC,CAAA;EAAA,IAC3C;EAAA,EACF;EAEA,EAAA,OAAO,GAAA;EACT;EAMO,IAAI,YAAY,KAAA,EAAM;EAE7B,IAAO,iBAAA,GAAQ,SAAA;;;ECt1Ff,IAAM,aAAA,GAAgB,EAAA;EACtB,IAAM,SAAA,GAAY,EAAA;EAOlB,IAAM,eAAe,MAAM;EAEzB,EAAA,IACE,OAAO,eAAe,WAAA,IACtB,UAAA,CAAW,UACX,OAAO,UAAA,CAAW,MAAA,CAAO,eAAA,KAAoB,UAAA,EAC7C;EACA,IAAA,OAAO,MAAM;EAEX,MAAA,MAAM,MAAA,GAAS,IAAI,WAAA,CAAY,CAAC,CAAA;EAChC,MAAA,UAAA,CAAW,MAAA,CAAO,gBAAgB,MAAM,CAAA;EAExC,MAAA,OAAO,MAAA,CAAO,CAAC,CAAA,GAAI,UAAA;EAAA,IACrB,CAAA;EAAA,EACF;EAEA,EAAA,OAAO,IAAA,CAAK,MAAA;EACd,CAAA;EAEA,IAAM,SAAS,YAAA,EAAa;EAE5B,IAAM,aAAA,GAAgB,CAAC,MAAA,GAAS,CAAA,EAAG,OAAO,MAAA,KAAW;EACnD,EAAA,IAAI,OAAA,GAAU,EAAA;EAEd,EAAA,OAAO,OAAA,CAAQ,SAAS,MAAA,EAAQ;EAC9B,IAAA,OAAA,GAAU,OAAA,GAAU,KAAK,KAAA,CAAM,IAAA,KAAS,EAAE,CAAA,CAAE,SAAS,EAAE,CAAA;EAAA,EACzD;EACA,EAAA,OAAO,OAAA;EACT,CAAA;EAMA,SAAS,YAAY,GAAA,EAAK;EACxB,EAAA,IAAI,KAAA,GAAQ,IAAI,iBAAA,CAAU,CAAC,CAAA;EAE3B,EAAA,KAAA,MAAW,CAAA,IAAK,GAAA,CAAI,MAAA,EAAO,EAAG;EAE5B,IAAA,KAAA,GAAQ,KAAA,CAAM,YAAA,CAAa,GAAG,CAAA,CAAE,KAAK,CAAC,CAAA;EAAA,EACxC;EACA,EAAA,OAAO,KAAA;EACT;EAEA,IAAM,IAAA,GAAO,CAAC,KAAA,GAAQ,EAAA,KAAO;EAG3B,EAAA,MAAM,OAAA,GAAU,IAAI,WAAA,EAAY;EAChC,EAAA,OAAO,WAAA,CAAY,QAAA,CAAK,OAAA,CAAQ,MAAA,CAAO,KAAK,CAAC,CAAC,CAAA,CAC3C,QAAA,CAAS,EAAE,CAAA,CACX,KAAA,CAAM,CAAC,CAAA;EACZ,CAAA;EAEA,IAAM,WAAW,KAAA,CAAM,IAAA;EAAA,EAAK,EAAE,QAAQ,EAAA,EAAG;EAAA,EAAG,CAAC,CAAA,EAAG,CAAA,KAC9C,MAAA,CAAO,YAAA,CAAa,IAAI,EAAE;EAC5B,CAAA;EAEA,IAAM,YAAA,GAAe,CAAC,IAAA,KAAS,QAAA,CAAS,IAAA,CAAK,MAAM,IAAA,EAAK,GAAI,QAAA,CAAS,MAAM,CAAC,CAAA;EAQ5E,IAAM,oBAAoB,CAAC;EAAA,EACzB,SAAA,GAAY,OAAO,MAAA,KAAW,WAAA,GAC1B,SACA,OAAO,MAAA,KAAW,WAAA,GAChB,MAAA,GACA,EAAC;EAAA,EACP,QAAQ,IAAA,GAAO;EACjB,CAAA,GAAI,EAAC,KAAM;EACT,EAAA,MAAM,OAAA,GAAU,MAAA,CAAO,IAAA,CAAK,SAAS,EAAE,QAAA,EAAS;EAChD,EAAA,MAAM,YAAA,GAAe,OAAA,CAAQ,MAAA,GACzB,OAAA,GAAU,aAAA,CAAc,WAAW,IAAI,CAAA,GACvC,aAAA,CAAc,SAAA,EAAW,IAAI,CAAA;EAEjC,EAAA,OAAO,IAAA,CAAK,YAAY,CAAA,CAAE,SAAA,CAAU,GAAG,SAAS,CAAA;EAClD,CAAA;EAEA,IAAM,aAAA,GAAgB,CAAC,KAAA,KAAU,MAAM;EACrC,EAAA,OAAO,KAAA,EAAA;EACT,CAAA;EAIA,IAAM,eAAA,GAAkB,SAAA;EAExB,IAAM,OAAO,CAAC;EAAA;EAAA;EAAA;EAAA,EAIZ,QAAQ,IAAA,GAAO,MAAA;EAAA,EACf,UAAU,aAAA,CAAc,IAAA,CAAK,MAAM,IAAA,EAAK,GAAI,eAAe,CAAC,CAAA;EAAA,EAC5D,MAAA,GAAS,aAAA;EAAA,EACT,WAAA,GAAc,iBAAA,CAAkB,EAAE,MAAA,EAAQ,MAAM;EAClD,CAAA,GAAI,EAAC,KAAM;EACT,EAAA,IAAI,SAAS,SAAA,EAAW;EACtB,IAAA,MAAM,IAAI,KAAA;EAAA,MACR,CAAA,6BAAA,EAAgC,SAAS,CAAA,YAAA,EAAe,MAAM,CAAA;EAAA,KAChE;EAAA,EACF;EACA,EAAA,OAAO,SAAS,KAAA,GAAQ;EACtB,IAAA,MAAM,WAAA,GAAc,aAAa,IAAI,CAAA;EAIrC,IAAA,MAAM,IAAA,GAAO,IAAA,CAAK,GAAA,EAAI,CAAE,SAAS,EAAE,CAAA;EACnC,IAAA,MAAM,KAAA,GAAQ,OAAA,EAAQ,CAAE,QAAA,CAAS,EAAE,CAAA;EAKnC,IAAA,MAAM,IAAA,GAAO,aAAA,CAAc,MAAA,EAAQ,IAAI,CAAA;EACvC,IAAA,MAAM,SAAA,GAAY,CAAA,EAAG,IAAA,GAAO,IAAA,GAAO,QAAQ,WAAW,CAAA,CAAA;EAEtD,IAAA,OAAO,CAAA,EAAG,cAAc,IAAA,CAAK,SAAS,EAAE,SAAA,CAAU,CAAA,EAAG,MAAM,CAAC,CAAA,CAAA;EAAA,EAC9D,CAAA;EACF,CAAA;EAEA,IAAM,QAAA,GAAW,KAAK,IAAI,CAAA;EAC1B,SAAS,KAAK,EAAA,EAAI;EAChB,EAAA,IAAI,WAAA;EACJ,EAAA,OAAO,MAAM;EACX,IAAA,IAAI,CAAC,WAAA,EAAa;EAChB,MAAA,WAAA,GAAc,EAAA,EAAG;EAAA,IACnB;EACA,IAAA,OAAO,WAAA,EAAY;EAAA,EACrB,CAAA;EACF;;;EC9IO,IAAM,UAAU,OAAO,OAAA,KAAY,WAAA,IAAe,OAAA,CAAQ,IAAI,QAAA,KAAa,aAAA;;;ECoC3E,SAAS,YAAA,CAAa,IAAA,EAAgB,KAAA,EAAe,OAAA,GAAmB,KAAA,EAAO;EAEpF,EAAA,IAAI,YAAY,IAAI,CAAA;EAClB,IAAA,MAAM,IAAI,KAAA;EAAA,MACR,eAAe,IAAI,CAAA,gHAAA;EAAA,KACrB;EAGF,EAAA,MAAA,CAAO,cAAA,CAAe,MAAM,SAAA,EAAW;EAAA,IACrC,KAAA,EAAO,KAAA;EAAA,IACP,YAAA,EAAc,KAAA;EAAA,IACd,UAAA,EAAY,KAAA;EAAA,IACZ,QAAA,EAAU;EAAA,GACX,CAAA;EAGD,EAAA,MAAM,MAAA,GAAS,MAAA,CAAO,cAAA,CAAe,IAAI,CAAA;EACzC,EAAA,MAAM,WAAA,GAAc,UAAU,MAAA,CAAO,iBAAiB,IAAI,MAAA,CAAO,iBAAiB,IAAI,EAAC;EAGvF,EAAA,MAAM,SAAA,GACJ,OAAA,IAAW,KAAA,KAAU,OAAA,GAAU,CAAC,OAAA,EAAS,GAAG,WAAA,EAAa,KAAK,CAAA,GAAI,CAAC,GAAG,aAAa,KAAK,CAAA;EAG1F,EAAA,MAAA,CAAO,cAAA,CAAe,MAAM,iBAAA,EAAmB;EAAA,IAC7C,KAAA,EAAO,SAAA;EAAA,IACP,YAAA,EAAc,KAAA;EAAA,IACd,UAAA,EAAY,KAAA;EAAA,IACZ,QAAA,EAAU;EAAA,GACX,CAAA;EACD,EAAA,MAAA,CAAO,cAAA,CAAe,MAAM,aAAA,EAAe;EAAA,IACzC,KAAA,EAAO,IAAI,GAAA,CAAI,SAAS,CAAA;EAAA,IACxB,YAAA,EAAc,KAAA;EAAA,IACd,UAAA,EAAY,KAAA;EAAA,IACZ,QAAA,EAAU;EAAA,GACX,CAAA;EAGD,EAAA,aAAA,CAAc,IAAI,CAAA;EACpB;EAsBO,SAAS,gBAAA,CACd,MACA,IAAA,EACA;EApGF,EAAA,IAAA,EAAA,EAAA,EAAA;EAqGE,EAAA,MAAM,yBAAA,GAAA,CACJ,EAAA,GAAA,IAAA,IAAA,IAAA,GAAA,MAAA,GAAA,IAAA,CAAM,yBAAA,KAAN,IAAA,GAAA,EAAA,GAAmC,OAAA,CAAQ,yBAAA;EAC7C,EAAA,MAAM,cAAA,GAAA,CAAiB,EAAA,GAAA,IAAA,IAAA,IAAA,GAAA,MAAA,GAAA,IAAA,CAAM,cAAA,KAAN,IAAA,GAAA,EAAA,GAAwB,OAAA,CAAQ,cAAA;EAEvD,EAAA,IAAI,CAAC,WAAA,CAAY,IAAI,CAAA,EAAG;EACxB,EAAA,IAAI,oBAAA,CAAqB,IAAI,CAAA,IAAK,yBAAA,EAA2B;EAG7D,EAAA,MAAM,KAAA,GAAkB,CAAC,IAAI,CAAA;EAG7B,EAAA,IAAI,QAAA,GAAgB,MAAA,CAAO,cAAA,CAAe,IAAI,CAAA;EAC9C,EAAA,OAAO,WAAA,CAAY,QAAQ,CAAA,EAAG;EAC5B,IAAA,KAAA,CAAM,KAAK,QAAQ,CAAA;EACnB,IAAA,QAAA,GAAW,MAAA,CAAO,eAAe,QAAQ,CAAA;EAAA,EAC3C;EAGA,EAAA,MAAM,UAAA,uBAAiB,GAAA,EAAoB;EAG3C,EAAA,KAAA,IAAS,IAAI,KAAA,CAAM,MAAA,GAAS,CAAA,EAAG,CAAA,IAAK,GAAG,CAAA,EAAA,EAAK;EAC1C,IAAA,MAAMI,KAAAA,GAAO,MAAM,CAAC,CAAA;EACpB,IAAA,IAAI,CAACA,KAAAA,EAAM;EACX,IAAA,IAAI,QAAQA,KAAAA,CAAK,UAAA;EACjB,IAAA,IAAI,UAAA,CAAW,GAAA,CAAI,KAAK,CAAA,EAAG;EACzB,MAAA,IAAI,WAAA,CAAYA,KAAI,CAAA,IAAK,CAAC,cAAA,EAAgB;EACxC,QAAA,MAAM,YAAA,GAAe,UAAA,CAAW,GAAA,CAAI,KAAK,CAAA;EACzC,QAAA,MAAM,IAAI,KAAA;EAAA,UACR,wBAAwBA,KAAAA,CAAK,IAAI,CAAA,uBAAA,EAA0B,KAAK,oBAAoB,YAAY,CAAA,4GAAA;EAAA,SAElG;EAAA,MACF;EACA,MAAA,KAAA,GAAQ,mBAAA,EAAoB;EAC5B,MAAA,YAAA,CAAaA,OAAM,KAAK,CAAA;EAAA,IAC1B;EACA,IAAA,UAAA,CAAW,GAAA,CAAI,KAAA,EAAOA,KAAAA,CAAK,IAAI,CAAA;EAAA,EACjC;EACA,EAAA,sBAAA,CAAuB,IAAI,CAAA;EAC7B;EAiBO,SAAS,WAAA,CACd,OACA,IAAA,EACM;EAhKR,EAAA,IAAA,EAAA;EAiKE,EAAA,MAAM,eAAA,GAAA,CAAkB,EAAA,GAAA,IAAA,IAAA,IAAA,GAAA,MAAA,GAAA,IAAA,CAAM,eAAA,KAAN,IAAA,GAAA,EAAA,GAAyB,OAAA,CAAQ,eAAA;EAEzD,EAAA,IAAI,eAAA,EAAiB;EACnB,IAAA,IAAI,KAAA;EACJ,IAAA,IAAI,eAAA,YAA2B,MAAA,EAAQ,KAAA,GAAQ,eAAA,CAAgB,KAAK,KAAK,CAAA;EAAA,SACpE,KAAA,GAAQ,gBAAgB,KAAK,CAAA;EAElC,IAAA,IAAI,CAAC,KAAA;EACH,MAAA,MAAM,IAAI,KAAA;EAAA,QACR,mCAAmC,KAAK,CAAA,sEAAA;EAAA,OAC1C;EAAA,EACJ;EACF;EAYO,SAAS,mBAAA,GAA8B;EAC5C,EAAA,IAAI,QAAQ,QAAA,EAAS;EACrB,EAAA,OAAO,eAAe,KAAK,CAAA,CAAA;EAC7B;EAgBO,SAAS,UAAU,IAAA,EAAgB;EACxC,EAAA,MAAA,CAAO,cAAA,CAAe,MAAM,SAAA,EAAW;EAAA,IACrC,KAAA,EAAO,IAAA;EAAA,IACP,YAAA,EAAc,KAAA;EAAA,IACd,UAAA,EAAY,KAAA;EAAA,IACZ,QAAA,EAAU;EAAA,GACX,CAAA;EACH;EAYO,SAAS,cAAc,IAAA,EAAgB;EAC5C,EAAA,MAAA,CAAO,cAAA,CAAe,MAAM,cAAA,EAAgB;EAAA,IAC1C,KAAA,EAAO,IAAA;EAAA,IACP,YAAA,EAAc,KAAA;EAAA,IACd,UAAA,EAAY,KAAA;EAAA,IACZ,QAAA,EAAU;EAAA,GACX,CAAA;EACH;EAWO,SAAS,cAAc,IAAA,EAAgB;EAC5C,EAAA,MAAA,CAAO,cAAA,CAAe,MAAM,aAAA,EAAe;EAAA,IACzC,KAAA,EAAO,IAAA;EAAA,IACP,YAAA,EAAc,KAAA;EAAA,IACd,UAAA,EAAY,KAAA;EAAA,IACZ,QAAA,EAAU;EAAA,GACX,CAAA;EACH;EAWO,SAAS,uBAAuB,IAAA,EAAgB;EACrD,EAAA,MAAA,CAAO,cAAA,CAAe,MAAM,uBAAA,EAAyB;EAAA,IACnD,KAAA,EAAO,IAAA;EAAA,IACP,YAAA,EAAc,KAAA;EAAA,IACd,UAAA,EAAY,KAAA;EAAA,IACZ,QAAA,EAAU;EAAA,GACX,CAAA;EACH;EAWO,SAAS,YAAY,IAAA,EAA+B;EACzD,EAAA,OAAO,OAAO,IAAA,KAAS,UAAA,IAAe,IAAA,CAAa,SAAS,CAAA,KAAM,IAAA;EACpE;EASO,SAAS,gBAAgB,IAAA,EAA4C;EAC1E,EAAA,IAAI,CAAC,IAAA,IAAQ,OAAO,IAAA,KAAS,UAAU,OAAO,KAAA;EAC9C,EAAA,MAAM,IAAA,GAAO,eAAe,IAAI,CAAA;EAChC,EAAA,OAAO,YAAY,IAAI,CAAA;EACzB;EAUO,SAAS,gBAAgB,IAAA,EAAgC;EAC9D,EAAA,OAAO,MAAA,CAAO,MAAA,CAAO,IAAA,EAAM,cAAc,CAAA;EAC3C;EAUO,SAAS,oBAAoB,IAAA,EAA4C;EAC9E,EAAA,IAAI,CAAC,IAAA,IAAQ,OAAO,IAAA,KAAS,UAAU,OAAO,KAAA;EAC9C,EAAA,MAAM,IAAA,GAAO,eAAe,IAAI,CAAA;EAChC,EAAA,OAAO,gBAAgB,IAAI,CAAA;EAC7B;EAWO,SAAS,YAAY,IAAA,EAAyB;EACnD,EAAA,OAAO,MAAA,CAAO,MAAA,CAAO,IAAA,EAAM,aAAa,CAAA;EAC1C;EAWO,SAAS,qBAAqB,IAAA,EAAyB;EAC5D,EAAA,OAAO,MAAA,CAAO,MAAA,CAAO,IAAA,EAAM,uBAAuB,CAAA;EACpD;EAeO,SAAS,eAAe,GAAA,EAAU;EAvWzC,EAAA,IAAA,EAAA,EAAA,EAAA,EAAA,EAAA;EAwWE,EAAA,IAAI,CAAC,GAAA,IAAO,OAAO,GAAA,KAAQ,UAAU,OAAO,IAAA;EAC5C,EAAA,OAAA,CAAO,EAAA,GAAA,CAAA,EAAA,GAAA,GAAA,CAAI,gBAAJ,IAAA,GAAA,EAAA,GAAA,CAAmB,EAAA,GAAA,MAAA,CAAO,eAAe,GAAG,CAAA,KAAzB,IAAA,GAAA,MAAA,GAAA,EAAA,CAA4B,WAAA,KAA/C,IAAA,GAAA,EAAA,GAA8D,IAAA;EACvE;;;ECpUO,SAAS,QAAA,CACd,IAAA,EACA,KAAA,EACA,IAAA,EACA;EAEA,EAAA,IAAI,WAAA,CAAY,IAAI,CAAA,EAAG,MAAM,IAAI,KAAA,CAAM,CAAA,wBAAA,EAA2B,KAAK,CAAA,qBAAA,CAAuB,CAAA;EAG9F,EAAA,IAAI,CAAA;EACJ,EAAA,IAAI,KAAA,EAAO;EACT,IAAA,WAAA,CAAY,OAAO,IAAI,CAAA;EACvB,IAAA,CAAA,GAAI,KAAA;EAAA,EACN,CAAA,UAAW,mBAAA,EAAoB;EAAA,EAG/B,MAAM,mBAAmB,IAAA,CAA+B;EAAA;EAAA;EAAA;EAAA,IAmBtD,WAAW,UAAA,GAAqB;EAC9B,MAAA,OAAQ,KAAa,SAAS,CAAA;EAAA,IAChC;EAAA;EAAA;EAAA;EAAA;EAAA;EAAA;EAAA;EAAA,IASA,WAAW,iBAAA,GAAuC;EApFtD,MAAA,IAAA,EAAA;EAqFM,MAAA,OAAO,CAAC,GAAA,CAAK,EAAA,GAAA,IAAA,CAAa,iBAAiB,CAAA,KAA9B,IAAA,GAAA,EAAA,GAAmC,EAAG,CAAA;EAAA,IACrD;EAAA;EAAA;EAAA;EAAA;EAAA;EAAA;EAAA;EAAA,IASA,WAAW,aAAA,GAAuC;EAChD,MAAA,MAAM,GAAA,uBAAuB,GAAA,EAAI;EACjC,MAAA,KAAA,MAAW,KAAM,IAAA,CAAa,aAAa,CAAA,EAAG,GAAA,CAAI,IAAI,CAAC,CAAA;EACvD,MAAA,OAAO,GAAA;EAAA,IACT;EAAA,IAiBA,eAAe,IAAA,EAAa;EAC1B,MAAA,KAAA,CAAM,GAAG,IAAI,CAAA;EAGb,MAAA,IAAI,MAAA,CAAO,cAAA,CAAe,IAAI,CAAA,KAAM,GAAA,CAAA,MAAA,CAAW,SAAA;EAC7C,QAAA,MAAA,CAAO,cAAA,CAAe,IAAA,EAAM,GAAA,CAAA,MAAA,CAAW,SAAS,CAAA;EAGlD,MAAA,MAAM,IAAA,GAAO,eAAe,IAAI,CAAA;EAChC,MAAA,IAAI,CAAC,IAAA,EAAM;EACT,QAAA,IAAI,OAAA;EACF,UAAA,MAAM,IAAI,KAAA,CAAM,CAAA,wBAAA,EAA2B,KAAK,CAAA,+BAAA,CAAiC,CAAA;EACnF,QAAA;EAAA,MACF;EAGA,MAAA,IAAI,OAAA,mBAA0B,IAAI,CAAA;EAAA,IACpC;EAAA;EAAA;EAAA;EAAA;EAAA;EAAA;EAAA,IAQA,OAAO,aAAa,GAAA,EAA6B;EAC/C,MAAA,OAAO,gBAAgB,GAAG,CAAA;EAAA,IAC5B;EAAA;EAAA;EAAA;EAAA;EAAA;EAAA;EAAA;EAAA;EAAA;EAAA;EAAA;EAAA,IAaA,OAAO,SAAqB,KAAA,EAAyC;EA5JzE,MAAA,IAAA,EAAA;EA6JM,MAAA,IAAI,CAAC,eAAA,CAAgB,KAAK,CAAA,EAAG,OAAO,KAAA;EACpC,MAAA,MAAM,QAAA,GAAA,CAAW,EAAA,GAAA,cAAA,CAAe,KAAK,CAAA,KAApB,IAAA,GAAA,MAAA,GAAA,EAAA,CAAwB,aAAA,CAAA;EACzC,MAAA,MAAM,QAAA,GAAY,KAAa,SAAS,CAAA;EACxC,MAAA,OAAO,CAAC,CAAC,QAAA,IAAY,QAAA,CAAS,IAAI,QAAQ,CAAA;EAAA,IAC5C;EAAA;EAAA;EAAA;EAAA;EAAA;EAAA;EAAA;EAAA;EAAA,IAUA,OAAO,eAA2B,KAAA,EAAyC;EA3K/E,MAAA,IAAA,EAAA;EA4KM,MAAA,IAAI,CAAC,eAAA,CAAgB,KAAK,CAAA,EAAG,OAAO,KAAA;EACpC,MAAA,MAAM,YAAA,GAAA,CAAe,EAAA,GAAA,cAAA,CAAe,KAAK,CAAA,KAApB,IAAA,GAAA,MAAA,GAAA,EAAA,CAAwB,iBAAA,CAAA;EAC7C,MAAA,MAAM,WAAA,GAAe,KAAa,iBAAiB,CAAA;EACnD,MAAA,OAAO,CAAC,CAAC,YAAA,IAAgB,WAAA,CAAY,KAAA,CAAM,CAAC,CAAA,EAAG,CAAA,KAAM,CAAA,KAAM,YAAA,CAAa,CAAC,CAAC,CAAA;EAAA,IAC5E;EAAA;EAAA;EAAA;EAAA;EAAA;EAAA;EAAA;EAAA;EAAA;EAAA;EAAA,IAYA,SAAqB,KAAA,EAAyC;EA5LlE,MAAA,IAAA,EAAA;EA6LM,MAAA,IAAI,CAAC,eAAA,CAAgB,KAAK,CAAA,EAAG,OAAO,KAAA;EACpC,MAAA,MAAM,QAAA,GAAA,CAAW,EAAA,GAAA,cAAA,CAAe,KAAK,CAAA,KAApB,IAAA,GAAA,MAAA,GAAA,EAAA,CAAwB,aAAA,CAAA;EACzC,MAAA,MAAM,QAAA,GAAW,cAAA,CAAe,IAAI,CAAA,CAAE,SAAS,CAAA;EAC/C,MAAA,OAAO,CAAC,CAAC,QAAA,IAAY,QAAA,CAAS,IAAI,QAAQ,CAAA;EAAA,IAC5C;EAAA;EAAA;EAAA;EAAA;EAAA;EAAA;EAAA;EAAA;EAAA;EAAA;EAAA,IAYA,eAA2B,KAAA,EAAyC;EA7MxE,MAAA,IAAA,EAAA,EAAA,EAAA;EA8MM,MAAA,IAAI,CAAC,eAAA,CAAgB,KAAK,CAAA,EAAG,OAAO,KAAA;EACpC,MAAA,MAAM,YAAA,GAAA,CAAe,EAAA,GAAA,cAAA,CAAe,KAAK,CAAA,KAApB,IAAA,GAAA,MAAA,GAAA,EAAA,CAAwB,iBAAA,CAAA;EAC7C,MAAA,MAAM,WAAA,GAAA,CAAc,EAAA,GAAA,cAAA,CAAe,IAAI,CAAA,KAAnB,IAAA,GAAA,MAAA,GAAA,EAAA,CAAuB,iBAAA,CAAA;EAC3C,MAAA,OAAO,CAAC,CAAC,YAAA,IAAgB,WAAA,CAAY,KAAA,CAAM,CAAC,CAAA,EAAG,CAAA,KAAM,CAAA,KAAM,YAAA,CAAa,CAAC,CAAC,CAAA;EAAA,IAC5E;EAAA;EAAA;EAAA;EAAA;EAAA;EAAA,IAOA,aAAA,GAAwB;EACtB,MAAA,MAAM,IAAA,GAAO,eAAe,IAAI,CAAA;EAChC,MAAA,IAAI,CAAC,IAAA,EAAM;EACT,QAAA,IAAI,OAAA;EACF,UAAA,MAAM,IAAI,KAAA,CAAM,CAAA,wBAAA,EAA2B,KAAK,CAAA,+BAAA,CAAiC,CAAA;EACnF,QAAA,OAAO,gBAAA;EAAA,MACT;EACA,MAAA,OAAO,IAAA,CAAK,UAAA;EAAA,IACd;EAAA;EAAA;EAAA;EAAA;EAAA;EAAA,IAOA,oBAAA,GAA0C;EACxC,MAAA,MAAM,IAAA,GAAO,eAAe,IAAI,CAAA;EAChC,MAAA,IAAI,CAAC,IAAA,EAAM;EACT,QAAA,IAAI,OAAA;EACF,UAAA,MAAM,IAAI,KAAA,CAAM,CAAA,wBAAA,EAA2B,KAAK,CAAA,+BAAA,CAAiC,CAAA;EACnF,QAAA,OAAO,CAAC,gBAAgB,CAAA;EAAA,MAC1B;EACA,MAAA,OAAO,IAAA,CAAK,iBAAA;EAAA,IACd;EAAA;EAAA;EAAA;EAAA;EAAA;EAAA,IAOA,gBAAA,GAA0C;EACxC,MAAA,MAAM,IAAA,GAAO,eAAe,IAAI,CAAA;EAChC,MAAA,IAAI,CAAC,IAAA,EAAM;EACT,QAAA,IAAI,OAAA;EACF,UAAA,MAAM,IAAI,KAAA,CAAM,CAAA,wBAAA,EAA2B,KAAK,CAAA,+BAAA,CAAiC,CAAA;EACnF,QAAA,uBAAO,IAAI,GAAA,CAAI,CAAC,gBAAgB,CAAC,CAAA;EAAA,MACnC;EACA,MAAA,OAAO,IAAA,CAAK,aAAA;EAAA,IACd;EAAA;EAIF,EAAA,YAAA,CAAa,UAAA,EAAY,GAAG,IAAI,CAAA;EAGhC,EAAA,SAAA,CAAU,UAAU,CAAA;EACpB,EAAA,aAAA,CAAc,UAAU,CAAA;EAExB,EAAA,OAAO,UAAA;EACT;EAiBO,SAAS,gBAAA,CACd,IAAA,EACA,KAAA,EACA,IAAA,EACA;EAEA,EAAA,IAAI,WAAA,CAAY,IAAI,CAAA,EAAG,MAAM,IAAI,KAAA,CAAM,CAAA,wBAAA,EAA2B,KAAK,CAAA,qBAAA,CAAuB,CAAA;EAG9F,EAAA,IAAI,CAAA;EACJ,EAAA,IAAI,KAAA,EAAO;EACT,IAAA,WAAA,CAAY,OAAO,IAAI,CAAA;EACvB,IAAA,CAAA,GAAI,KAAA;EAAA,EACN,CAAA,UAAW,mBAAA,EAAoB;EAAA,EAG/B,MAAe,mBAAmB,IAAA,CAA+B;EAAA;EAAA;EAAA;EAAA,IAmB/D,WAAW,UAAA,GAAqB;EAC9B,MAAA,OAAQ,KAAa,SAAS,CAAA;EAAA,IAChC;EAAA;EAAA;EAAA;EAAA;EAAA;EAAA;EAAA;EAAA,IASA,WAAW,iBAAA,GAAuC;EAzUtD,MAAA,IAAA,EAAA;EA0UM,MAAA,OAAO,CAAC,GAAA,CAAK,EAAA,GAAA,IAAA,CAAa,iBAAiB,CAAA,KAA9B,IAAA,GAAA,EAAA,GAAmC,EAAG,CAAA;EAAA,IACrD;EAAA;EAAA;EAAA;EAAA;EAAA;EAAA;EAAA;EAAA,IASA,WAAW,aAAA,GAAuC;EAChD,MAAA,MAAM,GAAA,uBAAuB,GAAA,EAAI;EACjC,MAAA,KAAA,MAAW,KAAM,IAAA,CAAa,aAAa,CAAA,EAAG,GAAA,CAAI,IAAI,CAAC,CAAA;EACvD,MAAA,OAAO,GAAA;EAAA,IACT;EAAA,IAiBA,eAAe,IAAA,EAAa;EAC1B,MAAA,KAAA,CAAM,GAAG,IAAI,CAAA;EAGb,MAAA,IAAI,MAAA,CAAO,cAAA,CAAe,IAAI,CAAA,KAAM,GAAA,CAAA,MAAA,CAAW,SAAA;EAC7C,QAAA,MAAA,CAAO,cAAA,CAAe,IAAA,EAAM,GAAA,CAAA,MAAA,CAAW,SAAS,CAAA;EAGlD,MAAA,MAAM,IAAA,GAAO,eAAe,IAAI,CAAA;EAChC,MAAA,IAAI,CAAC,IAAA,EAAM;EACT,QAAA,IAAI,OAAA;EACF,UAAA,MAAM,IAAI,KAAA,CAAM,CAAA,wBAAA,EAA2B,KAAK,CAAA,+BAAA,CAAiC,CAAA;EACnF,QAAA;EAAA,MACF;EAGA,MAAA,IAAI,OAAA,mBAA0B,IAAI,CAAA;EAAA,IACpC;EAAA;EAAA;EAAA;EAAA;EAAA;EAAA;EAAA,IAQA,OAAO,aAAa,GAAA,EAA6B;EAC/C,MAAA,OAAO,gBAAgB,GAAG,CAAA;EAAA,IAC5B;EAAA;EAAA;EAAA;EAAA;EAAA;EAAA;EAAA;EAAA;EAAA;EAAA;EAAA;EAAA;EAAA;EAAA;EAAA;EAAA,IAiBA,OAAO,SAAqB,KAAA,EAAyC;EArZzE,MAAA,IAAA,EAAA;EAsZM,MAAA,IAAI,CAAC,gBAAgB,KAAK,CAAA,IAAK,CAAC,WAAA,CAAY,IAAI,GAAG,OAAO,KAAA;EAC1D,MAAA,MAAM,QAAA,GAAA,CAAW,EAAA,GAAA,cAAA,CAAe,KAAK,CAAA,KAApB,IAAA,GAAA,MAAA,GAAA,EAAA,CAAwB,aAAA,CAAA;EACzC,MAAA,MAAM,QAAA,GAAY,KAAa,SAAS,CAAA;EACxC,MAAA,OAAO,CAAC,CAAC,QAAA,IAAY,QAAA,CAAS,IAAI,QAAQ,CAAA;EAAA,IAC5C;EAAA;EAAA;EAAA;EAAA;EAAA;EAAA;EAAA;EAAA;EAAA;EAAA;EAAA;EAAA;EAAA,IAcA,OAAO,eAA2B,KAAA,EAAyC;EAxa/E,MAAA,IAAA,EAAA;EAyaM,MAAA,IAAI,CAAC,gBAAgB,KAAK,CAAA,IAAK,CAAC,WAAA,CAAY,IAAI,GAAG,OAAO,KAAA;EAC1D,MAAA,MAAM,YAAA,GAAA,CAAe,EAAA,GAAA,cAAA,CAAe,KAAK,CAAA,KAApB,IAAA,GAAA,MAAA,GAAA,EAAA,CAAwB,iBAAA,CAAA;EAC7C,MAAA,MAAM,WAAA,GAAe,KAAa,iBAAiB,CAAA;EACnD,MAAA,OAAO,CAAC,CAAC,YAAA,IAAgB,WAAA,CAAY,KAAA,CAAM,CAAC,CAAA,EAAG,CAAA,KAAM,CAAA,KAAM,YAAA,CAAa,CAAC,CAAC,CAAA;EAAA,IAC5E;EAAA;EAAA;EAAA;EAAA;EAAA;EAAA;EAAA;EAAA;EAAA;EAAA;EAAA,IAYA,SAAqB,KAAA,EAAyC;EAzblE,MAAA,IAAA,EAAA;EA0bM,MAAA,IAAI,CAAC,gBAAgB,KAAK,CAAA,IAAK,CAAC,eAAA,CAAgB,IAAI,GAAG,OAAO,KAAA;EAC9D,MAAA,MAAM,QAAA,GAAA,CAAW,EAAA,GAAA,cAAA,CAAe,KAAK,CAAA,KAApB,IAAA,GAAA,MAAA,GAAA,EAAA,CAAwB,aAAA,CAAA;EACzC,MAAA,MAAM,QAAA,GAAW,cAAA,CAAe,IAAI,CAAA,CAAE,SAAS,CAAA;EAC/C,MAAA,OAAO,CAAC,CAAC,QAAA,IAAY,QAAA,CAAS,IAAI,QAAQ,CAAA;EAAA,IAC5C;EAAA;EAAA;EAAA;EAAA;EAAA;EAAA;EAAA;EAAA;EAAA;EAAA;EAAA,IAYA,eAA2B,KAAA,EAAyC;EA1cxE,MAAA,IAAA,EAAA,EAAA,EAAA;EA2cM,MAAA,IAAI,CAAC,gBAAgB,KAAK,CAAA,IAAK,CAAC,eAAA,CAAgB,IAAI,GAAG,OAAO,KAAA;EAC9D,MAAA,MAAM,YAAA,GAAA,CAAe,EAAA,GAAA,cAAA,CAAe,KAAK,CAAA,KAApB,IAAA,GAAA,MAAA,GAAA,EAAA,CAAwB,iBAAA,CAAA;EAC7C,MAAA,MAAM,WAAA,GAAA,CAAc,EAAA,GAAA,cAAA,CAAe,IAAI,CAAA,KAAnB,IAAA,GAAA,MAAA,GAAA,EAAA,CAAuB,iBAAA,CAAA;EAC3C,MAAA,OAAO,CAAC,CAAC,YAAA,IAAgB,WAAA,CAAY,KAAA,CAAM,CAAC,CAAA,EAAG,CAAA,KAAM,CAAA,KAAM,YAAA,CAAa,CAAC,CAAC,CAAA;EAAA,IAC5E;EAAA;EAAA;EAAA;EAAA;EAAA;EAAA,IAOA,aAAA,GAAwB;EACtB,MAAA,MAAM,IAAA,GAAO,eAAe,IAAI,CAAA;EAChC,MAAA,IAAI,CAAC,IAAA,EAAM;EACT,QAAA,IAAI,OAAA;EACF,UAAA,MAAM,IAAI,KAAA,CAAM,CAAA,wBAAA,EAA2B,KAAK,CAAA,+BAAA,CAAiC,CAAA;EACnF,QAAA,OAAO,gBAAA;EAAA,MACT;EACA,MAAA,OAAO,IAAA,CAAK,UAAA;EAAA,IACd;EAAA;EAAA;EAAA;EAAA;EAAA;EAAA,IAOA,oBAAA,GAA0C;EACxC,MAAA,MAAM,IAAA,GAAO,eAAe,IAAI,CAAA;EAChC,MAAA,IAAI,CAAC,IAAA,EAAM;EACT,QAAA,IAAI,OAAA;EACF,UAAA,MAAM,IAAI,KAAA,CAAM,CAAA,wBAAA,EAA2B,KAAK,CAAA,+BAAA,CAAiC,CAAA;EACnF,QAAA,OAAO,CAAC,gBAAgB,CAAA;EAAA,MAC1B;EACA,MAAA,OAAO,IAAA,CAAK,iBAAA;EAAA,IACd;EAAA;EAAA;EAAA;EAAA;EAAA;EAAA,IAOA,gBAAA,GAA0C;EACxC,MAAA,MAAM,IAAA,GAAO,eAAe,IAAI,CAAA;EAChC,MAAA,IAAI,CAAC,IAAA,EAAM;EACT,QAAA,IAAI,OAAA;EACF,UAAA,MAAM,IAAI,KAAA,CAAM,CAAA,wBAAA,EAA2B,KAAK,CAAA,+BAAA,CAAiC,CAAA;EACnF,QAAA,uBAAO,IAAI,GAAA,CAAI,CAAC,gBAAgB,CAAC,CAAA;EAAA,MACnC;EACA,MAAA,OAAO,IAAA,CAAK,aAAA;EAAA,IACd;EAAA;EAIF,EAAA,YAAA,CAAa,UAAA,EAAY,GAAG,IAAI,CAAA;EAGhC,EAAA,SAAA,CAAU,UAAU,CAAA;EACpB,EAAA,aAAA,CAAc,UAAU,CAAA;EAExB,EAAA,OAAO,UAAA;EACT;;;AC9fO,MAAM,KAAA,GAAQ,SAAS,MAAM;EAAC,CAAA,EAAG,OAAO;AAUxC,MAAM,UAAA,GAAa,QAAA,CAAS,KAAA,EAAO,YAAY;;;ECgB/C,SAAS,SAAA,CAA4B,OAAW,IAAA,EAAqB;EAE1E,EAAA,IAAI,CAAA;EACJ,EAAA,IAAI,KAAA,EAAO;EACT,IAAA,WAAA,CAAY,OAAO,IAAI,CAAA;EACvB,IAAA,CAAA,GAAI,KAAA;EAAA,EACN,CAAA,UAAW,mBAAA,EAAoB;EAE/B,EAAA,OAAO,SAAU,OAAiB,OAAA,EAAc;EAE9C,IAAA,IAAI,OAAA,CAAQ,SAAS,OAAA,EAAS;EAC9B,IAAA,IAAI,CAAC,YAAY,KAAK,CAAA;EACpB,MAAA,MAAM,IAAI,KAAA;EAAA,QACR,CAAA,gFAAA,EAAmF,MAAM,IAAI,CAAA;EAAA,OAC/F;EAEF,IAAA,YAAA,CAAa,OAAO,CAAC,CAAA;EAErB,IAAA,IAAI,OAAA,EAAS,gBAAA,CAAiB,KAAA,EAAO,IAAI,CAAA;EAAA,EAC3C,CAAA;EACF;;;EC1BO,SAAS,SAAA,CACd,KAAA,EACA,KAAA,EACA,IAAA,EACG;EAjCL,EAAA,IAAA,EAAA;EAkCE,EAAA,IAAI,CAAC,YAAY,KAAK,CAAA;EACpB,IAAA,MAAM,IAAI,KAAA;EAAA,MACR,CAAA,2EAAA,EAAA,CAA8E,EAAA,GAAA,KAAA,IAAA,IAAA,GAAA,MAAA,GAAA,KAAA,CAAO,IAAA,KAAP,IAAA,GAAA,EAAA,GAAe,SAAS,CAAA;EAAA,KACxG;EAGF,EAAA,IAAI,CAAA;EACJ,EAAA,IAAI,KAAA,EAAO;EACT,IAAA,WAAA,CAAY,OAAO,IAAI,CAAA;EACvB,IAAA,CAAA,GAAI,KAAA;EAAA,EACN,CAAA,UAAW,mBAAA,EAAoB;EAG/B,EAAA,MAAM,IAAA,GAAO,KAAA;EACb,EAAA,YAAA,CAAa,MAAM,CAAC,CAAA;EACpB,EAAA,IAAI,OAAA,EAAS,gBAAA,CAAiB,IAAA,EAAM,IAAI,CAAA;EAExC,EAAA,OAAO,KAAA;EACT;EAqBO,SAAS,cAAA,CACd,KAAA,EACA,KAAA,EACA,IAAA,EACkB;EA7EpB,EAAA,IAAA,EAAA;EA8EE,EAAA,IAAI,CAAC,YAAY,KAAK,CAAA;EACpB,IAAA,MAAM,IAAI,KAAA;EAAA,MACR,CAAA,+EAAA,EAAA,CAAkF,EAAA,GAAA,KAAA,IAAA,IAAA,GAAA,MAAA,GAAA,KAAA,CAAO,IAAA,KAAP,IAAA,GAAA,EAAA,GAAe,SAAS,CAAA;EAAA,KAC5G;EAGF,EAAA,IAAI,CAAA;EACJ,EAAA,IAAI,KAAA,EAAO;EACT,IAAA,WAAA,CAAY,OAAO,IAAI,CAAA;EACvB,IAAA,CAAA,GAAI,KAAA;EAAA,EACN,CAAA,UAAW,mBAAA,EAAoB;EAG/B,EAAA,MAAM,IAAA,GAAO,KAAA;EACb,EAAA,YAAA,CAAa,MAAM,CAAC,CAAA;EACpB,EAAA,IAAI,OAAA,EAAS,gBAAA,CAAiB,IAAA,EAAM,IAAI,CAAA;EAExC,EAAA,OAAO,KAAA;EACT","file":"index.global.js","sourcesContent":["/*\n Configuration options for the Sigil library.\n \n These options control runtime validation, inheritance checks, label autofill behavior.\n /\nexport interface SigilOptions {\n /\n Validation rule applied to sigil labels before registration.\n \n - A function receives the label and must return `true` if valid.\n * - A `RegExp` must match the label.\n * - `null` disables validation entirely.\n \n Defaults to `null`.\n /\n labelValidation?: ((label: string) => boolean) \| RegExp \| null;\n\n /\n Skips the runtime check that prevents subclasses from inheriting\n * the same sigil label as their ancestors.\n \n When `false` (default), extending a sigil class without\n * using `WithSigil(newLabel)` decorator will throw an error if the label\n * is reused and `OPTIONS.autofillLabels` is set to `false`.\n \n Set this to `true` only if you intentionally want subclasses to inherit labels\n * from their ancestors (this weakens the uniqueness guarantees).\n \n WARNING:\n * Disabling inheritanceCheck removes guaranties by 'Sigil' or unique label for\n * each class and allow multiple child classes to use the same label which can\n * result on false 'isOfType' result. this options should be used in debugging\n * only to silence all errors but never in production.\n /\n skipLabelInheritanceCheck?: boolean;\n\n /\n When enabled, non-decorated subclasses that would otherwise inherit an ancestor's label\n * will be assigned an autogenerated random label (so that explicit labels stay unique).\n /\n autofillLabels?: boolean;\n}\n\n/* -----------------------------------------\n * Main options object\n * ----------------------------------------- /\n\n/\n Defined SigilOptions used in the library.\n \n @internal\n /\nexport const OPTIONS: Required<SigilOptions> = {\n labelValidation: null,\n skipLabelInheritanceCheck: false,\n autofillLabels: false,\n};\n\n/\n Update runtime options for the Sigil library.\n * Call this early during application startup if you want non-default behavior.\n \n @param opts - Partial options to merge into the global `OPTIONS` object.\n /\nexport const updateOptions = (opts: SigilOptions): void => {\n for (const [k, v] of Object.entries(opts)) (OPTIONS as any)[k] = v;\n};\n\n/\n Default runtime options used by the Sigil library.\n \n @internal\n /\nconst DEFAULT_OPTIONS: Required<SigilOptions> = {\n labelValidation: null,\n skipLabelInheritanceCheck: false,\n autofillLabels: false,\n};\n\n// populate 'OPTIONS' with DEFAULT_OPTIONS\nupdateOptions(DEFAULT_OPTIONS);\n\n/* -----------------------------------------\n * Label validation\n * ----------------------------------------- /\n\n/\n Label validation regex. Labels must follow the pattern\n * `@scope/package.ClassName` where `ClassName` begins with an uppercase\n * letter. This avoids collisions across packages and helps debugging.\n \n It's advised to use this regex in 'SigilOptions.labelValidation'.\n /\nexport const DEFAULT_LABEL_REGEX = /^@[\\w-]+(?:\\/[\\w-]+)\\.[A-Z][A-Za-z0-9]$/;\n","/\n Symbol to uniquely identify sigil classes.\n \n Uses `Symbol.for()` so the symbol is stable across multiple bundles/realms\n * that share the same global symbol registry.\n \n @internal\n * @constant {symbol}\n /\nexport const __SIGIL__ = Symbol.for('@Sigil.__SIGIL__');\n\n/\n Symbol to uniquely identify the base of sigil classes.\n \n When attached to a constructor it indicates that the constructor is a\n * sigil base and should be treated specially by inheritance checks.\n \n @internal\n * @constant {symbol}\n /\nexport const __SIGIL_BASE__ = Symbol.for('@Sigil.__SIGIL_BASE__');\n\n/\n Symbol to mark constructors that were explicitly decorated with `WithSigil()`.\n \n This differs from `__SIGIL__` in that `__DECORATED__` indicates explicit\n * decoration (as opposed to automatically assigned labels).\n \n @internal\n * @constant {symbol}\n /\nexport const __DECORATED__ = Symbol.for('@Sigil.__DECORATED__');\n\n/\n Symbol to mark that inheritance checks for a given constructor have been completed.\n \n This is used to avoid repeated DEV-time validation on subsequent instance creations.\n \n @internal\n * @constant {symbol}\n /\nexport const __INHERITANCE_CHECKED__ = Symbol.for('@Sigil.__INHERITANCE_CHECKED__');\n\n/\n Symbol used to store the human-readable label for a sigil constructor.\n \n Stored on the constructor as a non-enumerable property.\n \n @internal\n * @constant {symbol}\n /\nexport const __LABEL__ = Symbol.for('@Sigil.__LABEL__');\n\n/\n Symbol used to store the linearized label lineage for a sigil constructor.\n \n This is an array of labels (strings) representing the inheritance path of labels.\n \n @internal\n * @constant {symbol}\n /\nexport const __LABEL_LINEAGE__ = Symbol.for('@Sigil.__LABEL_LINEAGE__');\n\n/\n Symbol used to store the set of labels for a sigil constructor.\n \n This is a `Set<string>` that mirrors `__LABEL_LINEAGE__` for fast membership checks.\n \n @internal\n * @constant {symbol}\n /\nexport const __LABEL_SET__ = Symbol.for('@Sigil.__LABEL_SET__');\n","/\n Internal helpers for u64. BigUint64Array is too slow as per 2025, so we implement it using Uint32Array.\n * @todo re-check https://issues.chromium.org/issues/42212588\n * @module\n /\nconst U32_MASK64 = / @__PURE__ / BigInt(2 * 32 - 1);\nconst _32n = /* @__PURE__ / BigInt(32);\n\nfunction fromBig(\n n: bigint,\n le = false\n): {\n h: number;\n l: number;\n} {\n if (le) return { h: Number(n & U32_MASK64), l: Number((n >> _32n) & U32_MASK64) };\n return { h: Number((n >> _32n) & U32_MASK64) \| 0, l: Number(n & U32_MASK64) \| 0 };\n}\n\nfunction split(lst: bigint[], le = false): Uint32Array[] {\n const len = lst.length;\n let Ah = new Uint32Array(len);\n let Al = new Uint32Array(len);\n for (let i = 0; i < len; i++) {\n const { h, l } = fromBig(lst[i], le);\n [Ah[i], Al[i]] = [h, l];\n }\n return [Ah, Al];\n}\n\nconst toBig = (h: number, l: number): bigint => (BigInt(h >>> 0) << _32n) \| BigInt(l >>> 0);\n// for Shift in [0, 32)\nconst shrSH = (h: number, _l: number, s: number): number => h >>> s;\nconst shrSL = (h: number, l: number, s: number): number => (h << (32 - s)) \| (l >>> s);\n// Right rotate for Shift in [1, 32)\nconst rotrSH = (h: number, l: number, s: number): number => (h >>> s) \| (l << (32 - s));\nconst rotrSL = (h: number, l: number, s: number): number => (h << (32 - s)) \| (l >>> s);\n// Right rotate for Shift in (32, 64), NOTE: 32 is special case.\nconst rotrBH = (h: number, l: number, s: number): number => (h << (64 - s)) \| (l >>> (s - 32));\nconst rotrBL = (h: number, l: number, s: number): number => (h >>> (s - 32)) \| (l << (64 - s));\n// Right rotate for shift===32 (just swaps l&h)\nconst rotr32H = (_h: number, l: number): number => l;\nconst rotr32L = (h: number, _l: number): number => h;\n// Left rotate for Shift in [1, 32)\nconst rotlSH = (h: number, l: number, s: number): number => (h << s) \| (l >>> (32 - s));\nconst rotlSL = (h: number, l: number, s: number): number => (l << s) \| (h >>> (32 - s));\n// Left rotate for Shift in (32, 64), NOTE: 32 is special case.\nconst rotlBH = (h: number, l: number, s: number): number => (l << (s - 32)) \| (h >>> (64 - s));\nconst rotlBL = (h: number, l: number, s: number): number => (h << (s - 32)) \| (l >>> (64 - s));\n\n// JS uses 32-bit signed integers for bitwise operations which means we cannot\n// simple take carry out of low bit sum by shift, we need to use division.\nfunction add(\n Ah: number,\n Al: number,\n Bh: number,\n Bl: number\n): {\n h: number;\n l: number;\n} {\n const l = (Al >>> 0) + (Bl >>> 0);\n return { h: (Ah + Bh + ((l / 2 * 32) \| 0)) \| 0, l: l \| 0 };\n}\n// Addition with more than 2 elements\nconst add3L = (Al: number, Bl: number, Cl: number): number => (Al >>> 0) + (Bl >>> 0) + (Cl >>> 0);\nconst add3H = (low: number, Ah: number, Bh: number, Ch: number): number =>\n (Ah + Bh + Ch + ((low / 2 32) \| 0)) \| 0;\nconst add4L = (Al: number, Bl: number, Cl: number, Dl: number): number =>\n (Al >>> 0) + (Bl >>> 0) + (Cl >>> 0) + (Dl >>> 0);\nconst add4H = (low: number, Ah: number, Bh: number, Ch: number, Dh: number): number =>\n (Ah + Bh + Ch + Dh + ((low / 2 32) \| 0)) \| 0;\nconst add5L = (Al: number, Bl: number, Cl: number, Dl: number, El: number): number =>\n (Al >>> 0) + (Bl >>> 0) + (Cl >>> 0) + (Dl >>> 0) + (El >>> 0);\nconst add5H = (low: number, Ah: number, Bh: number, Ch: number, Dh: number, Eh: number): number =>\n (Ah + Bh + Ch + Dh + Eh + ((low / 2 32) \| 0)) \| 0;\n\n// prettier-ignore\nexport {\n add, add3H, add3L, add4H, add4L, add5H, add5L, fromBig, rotlBH, rotlBL, rotlSH, rotlSL, rotr32H, rotr32L, rotrBH, rotrBL, rotrSH, rotrSL, shrSH, shrSL, split, toBig\n};\n// prettier-ignore\nconst u64: { fromBig: typeof fromBig; split: typeof split; toBig: (h: number, l: number) => bigint; shrSH: (h: number, _l: number, s: number) => number; shrSL: (h: number, l: number, s: number) => number; rotrSH: (h: number, l: number, s: number) => number; rotrSL: (h: number, l: number, s: number) => number; rotrBH: (h: number, l: number, s: number) => number; rotrBL: (h: number, l: number, s: number) => number; rotr32H: (_h: number, l: number) => number; rotr32L: (h: number, _l: number) => number; rotlSH: (h: number, l: number, s: number) => number; rotlSL: (h: number, l: number, s: number) => number; rotlBH: (h: number, l: number, s: number) => number; rotlBL: (h: number, l: number, s: number) => number; add: typeof add; add3L: (Al: number, Bl: number, Cl: number) => number; add3H: (low: number, Ah: number, Bh: number, Ch: number) => number; add4L: (Al: number, Bl: number, Cl: number, Dl: number) => number; add4H: (low: number, Ah: number, Bh: number, Ch: number, Dh: number) => number; add5H: (low: number, Ah: number, Bh: number, Ch: number, Dh: number, Eh: number) => number; add5L: (Al: number, Bl: number, Cl: number, Dl: number, El: number) => number; } = {\n fromBig, split, toBig,\n shrSH, shrSL,\n rotrSH, rotrSL, rotrBH, rotrBL,\n rotr32H, rotr32L,\n rotlSH, rotlSL, rotlBH, rotlBL,\n add, add3L, add3H, add4L, add4H, add5H, add5L,\n};\nexport default u64;\n","/\n * Utilities for hex, bytes, CSPRNG.\n * @module\n /\n/! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) /\n/* Checks if something is Uint8Array. Be careful: nodejs Buffer will return true. /\nexport function isBytes(a: unknown): a is Uint8Array {\n return a instanceof Uint8Array \|\| (ArrayBuffer.isView(a) && a.constructor.name === 'Uint8Array');\n}\n\n/* Asserts something is positive integer. /\nexport function anumber(n: number, title: string = ''): void {\n if (!Number.isSafeInteger(n) \|\| n < 0) {\n const prefix = title && `\"${title}\" `;\n throw new Error(`${prefix}expected integer >= 0, got ${n}`);\n }\n}\n\n/* Asserts something is Uint8Array. /\nexport function abytes(value: Uint8Array, length?: number, title: string = ''): Uint8Array {\n const bytes = isBytes(value);\n const len = value?.length;\n const needsLen = length !== undefined;\n if (!bytes \|\| (needsLen && len !== length)) {\n const prefix = title && `\"${title}\" `;\n const ofLen = needsLen ? ` of length ${length}` : '';\n const got = bytes ? `length=${len}` : `type=${typeof value}`;\n throw new Error(prefix + 'expected Uint8Array' + ofLen + ', got ' + got);\n }\n return value;\n}\n\n/* Asserts something is hash /\nexport function ahash(h: CHash): void {\n if (typeof h !== 'function' \|\| typeof h.create !== 'function')\n throw new Error('Hash must wrapped by utils.createHasher');\n anumber(h.outputLen);\n anumber(h.blockLen);\n}\n\n/* Asserts a hash instance has not been destroyed / finished /\nexport function aexists(instance: any, checkFinished = true): void {\n if (instance.destroyed) throw new Error('Hash instance has been destroyed');\n if (checkFinished && instance.finished) throw new Error('Hash#digest() has already been called');\n}\n\n/* Asserts output is properly-sized byte array /\nexport function aoutput(out: any, instance: any): void {\n abytes(out, undefined, 'digestInto() output');\n const min = instance.outputLen;\n if (out.length < min) {\n throw new Error('\"digestInto() output\" expected to be of length >=' + min);\n }\n}\n\n/* Generic type encompassing 8/16/32-byte arrays - but not 64-byte. /\n// prettier-ignore\nexport type TypedArray = Int8Array \| Uint8ClampedArray \| Uint8Array \|\n Uint16Array \| Int16Array \| Uint32Array \| Int32Array;\n\n/* Cast u8 / u16 / u32 to u8. /\nexport function u8(arr: TypedArray): Uint8Array {\n return new Uint8Array(arr.buffer, arr.byteOffset, arr.byteLength);\n}\n\n/* Cast u8 / u16 / u32 to u32. /\nexport function u32(arr: TypedArray): Uint32Array {\n return new Uint32Array(arr.buffer, arr.byteOffset, Math.floor(arr.byteLength / 4));\n}\n\n/* Zeroize a byte array. Warning: JS provides no guarantees. /\nexport function clean(...arrays: TypedArray[]): void {\n for (let i = 0; i < arrays.length; i++) {\n arrays[i].fill(0);\n }\n}\n\n/* Create DataView of an array for easy byte-level manipulation. /\nexport function createView(arr: TypedArray): DataView {\n return new DataView(arr.buffer, arr.byteOffset, arr.byteLength);\n}\n\n/* The rotate right (circular right shift) operation for uint32 /\nexport function rotr(word: number, shift: number): number {\n return (word << (32 - shift)) \| (word >>> shift);\n}\n\n/* The rotate left (circular left shift) operation for uint32 /\nexport function rotl(word: number, shift: number): number {\n return (word << shift) \| ((word >>> (32 - shift)) >>> 0);\n}\n\n/* Is current platform little-endian? Most are. Big-Endian platform: IBM /\nexport const isLE: boolean = / @__PURE__ / (() =>\n new Uint8Array(new Uint32Array([0x11223344]).buffer)[0] === 0x44)();\n\n/* The byte swap operation for uint32 /\nexport function byteSwap(word: number): number {\n return (\n ((word << 24) & 0xff000000) \|\n ((word << 8) & 0xff0000) \|\n ((word >>> 8) & 0xff00) \|\n ((word >>> 24) & 0xff)\n );\n}\n/* Conditionally byte swap if on a big-endian platform /\nexport const swap8IfBE: (n: number) => number = isLE\n ? (n: number) => n\n : (n: number) => byteSwap(n);\n\n/* In place byte swap for Uint32Array /\nexport function byteSwap32(arr: Uint32Array): Uint32Array {\n for (let i = 0; i < arr.length; i++) {\n arr[i] = byteSwap(arr[i]);\n }\n return arr;\n}\n\nexport const swap32IfBE: (u: Uint32Array) => Uint32Array = isLE\n ? (u: Uint32Array) => u\n : byteSwap32;\n\n// Built-in hex conversion https://caniuse.com/mdn-javascript_builtins_uint8array_fromhex\nconst hasHexBuiltin: boolean = / @__PURE__ / (() =>\n // @ts-ignore\n typeof Uint8Array.from([]).toHex === 'function' && typeof Uint8Array.fromHex === 'function')();\n\n// Array where index 0xf0 (240) is mapped to string 'f0'\nconst hexes = / @__PURE__ / Array.from({ length: 256 }, (_, i) =>\n i.toString(16).padStart(2, '0')\n);\n\n/\n Convert byte array to hex string. Uses built-in function, when available.\n * @example bytesToHex(Uint8Array.from([0xca, 0xfe, 0x01, 0x23])) // 'cafe0123'\n /\nexport function bytesToHex(bytes: Uint8Array): string {\n abytes(bytes);\n // @ts-ignore\n if (hasHexBuiltin) return bytes.toHex();\n // pre-caching improves the speed 6x\n let hex = '';\n for (let i = 0; i < bytes.length; i++) {\n hex += hexes[bytes[i]];\n }\n return hex;\n}\n\n// We use optimized technique to convert hex string to byte array\nconst asciis = { _0: 48, _9: 57, A: 65, F: 70, a: 97, f: 102 } as const;\nfunction asciiToBase16(ch: number): number \| undefined {\n if (ch >= asciis._0 && ch <= asciis._9) return ch - asciis._0; // '2' => 50-48\n if (ch >= asciis.A && ch <= asciis.F) return ch - (asciis.A - 10); // 'B' => 66-(65-10)\n if (ch >= asciis.a && ch <= asciis.f) return ch - (asciis.a - 10); // 'b' => 98-(97-10)\n return;\n}\n\n/\n Convert hex string to byte array. Uses built-in function, when available.\n * @example hexToBytes('cafe0123') // Uint8Array.from([0xca, 0xfe, 0x01, 0x23])\n /\nexport function hexToBytes(hex: string): Uint8Array {\n if (typeof hex !== 'string') throw new Error('hex string expected, got ' + typeof hex);\n // @ts-ignore\n if (hasHexBuiltin) return Uint8Array.fromHex(hex);\n const hl = hex.length;\n const al = hl / 2;\n if (hl % 2) throw new Error('hex string expected, got unpadded hex of length ' + hl);\n const array = new Uint8Array(al);\n for (let ai = 0, hi = 0; ai < al; ai++, hi += 2) {\n const n1 = asciiToBase16(hex.charCodeAt(hi));\n const n2 = asciiToBase16(hex.charCodeAt(hi + 1));\n if (n1 === undefined \|\| n2 === undefined) {\n const char = hex[hi] + hex[hi + 1];\n throw new Error('hex string expected, got non-hex character \"' + char + '\" at index ' + hi);\n }\n array[ai] = n1 16 + n2; // multiply first octet, e.g. 'a3' => 1016+3 => 160 + 3 => 163\n }\n return array;\n}\n\n/\n There is no setImmediate in browser and setTimeout is slow.\n * Call of async fn will return Promise, which will be fullfiled only on\n * next scheduler queue processing step and this is exactly what we need.\n /\nexport const nextTick = async (): Promise<void> => {};\n\n/* Returns control to thread each 'tick' ms to avoid blocking. /\nexport async function asyncLoop(\n iters: number,\n tick: number,\n cb: (i: number) => void\n): Promise<void> {\n let ts = Date.now();\n for (let i = 0; i < iters; i++) {\n cb(i);\n // Date.now() is not monotonic, so in case if clock goes backwards we return return control too\n const diff = Date.now() - ts;\n if (diff >= 0 && diff < tick) continue;\n await nextTick();\n ts += diff;\n }\n}\n\n// Global symbols, but ts doesn't see them: https://github.com/microsoft/TypeScript/issues/31535\ndeclare const TextEncoder: any;\n\n/\n Converts string to bytes using UTF8 encoding.\n * Built-in doesn't validate input to be string: we do the check.\n * @example utf8ToBytes('abc') // Uint8Array.from([97, 98, 99])\n /\nexport function utf8ToBytes(str: string): Uint8Array {\n if (typeof str !== 'string') throw new Error('string expected');\n return new Uint8Array(new TextEncoder().encode(str)); // https://bugzil.la/1681809\n}\n\n/* KDFs can accept string or Uint8Array for user convenience. /\nexport type KDFInput = string \| Uint8Array;\n\n/\n Helper for KDFs: consumes uint8array or string.\n * When string is passed, does utf8 decoding, using TextDecoder.\n /\nexport function kdfInputToBytes(data: KDFInput, errorTitle = ''): Uint8Array {\n if (typeof data === 'string') return utf8ToBytes(data);\n return abytes(data, undefined, errorTitle);\n}\n\n/* Copies several Uint8Arrays into one. /\nexport function concatBytes(...arrays: Uint8Array[]): Uint8Array {\n let sum = 0;\n for (let i = 0; i < arrays.length; i++) {\n const a = arrays[i];\n abytes(a);\n sum += a.length;\n }\n const res = new Uint8Array(sum);\n for (let i = 0, pad = 0; i < arrays.length; i++) {\n const a = arrays[i];\n res.set(a, pad);\n pad += a.length;\n }\n return res;\n}\n\ntype EmptyObj = {};\n/* Merges default options and passed options. /\nexport function checkOpts<T1 extends EmptyObj, T2 extends EmptyObj>(\n defaults: T1,\n opts?: T2\n): T1 & T2 {\n if (opts !== undefined && {}.toString.call(opts) !== '[object Object]')\n throw new Error('options must be object or undefined');\n const merged = Object.assign(defaults, opts);\n return merged as T1 & T2;\n}\n\n/* Common interface for all hashes. /\nexport interface Hash<T> {\n blockLen: number; // Bytes per block\n outputLen: number; // Bytes in output\n update(buf: Uint8Array): this;\n digestInto(buf: Uint8Array): void;\n digest(): Uint8Array;\n destroy(): void;\n _cloneInto(to?: T): T;\n clone(): T;\n}\n\n/* PseudoRandom (number) Generator /\nexport interface PRG {\n addEntropy(seed: Uint8Array): void;\n randomBytes(length: number): Uint8Array;\n clean(): void;\n}\n\n/\n XOF: streaming API to read digest in chunks.\n * Same as 'squeeze' in keccak/k12 and 'seek' in blake3, but more generic name.\n * When hash used in XOF mode it is up to user to call '.destroy' afterwards, since we cannot\n * destroy state, next call can require more bytes.\n /\nexport type HashXOF<T extends Hash<T>> = Hash<T> & {\n xof(bytes: number): Uint8Array; // Read 'bytes' bytes from digest stream\n xofInto(buf: Uint8Array): Uint8Array; // read buf.length bytes from digest stream into buf\n};\n\n/* Hash constructor /\nexport type HasherCons<T, Opts = undefined> = Opts extends undefined ? () => T : (opts?: Opts) => T;\n/* Optional hash params. /\nexport type HashInfo = {\n oid?: Uint8Array; // DER encoded OID in bytes\n};\n/* Hash function /\nexport type CHash<T extends Hash<T> = Hash<any>, Opts = undefined> = {\n outputLen: number;\n blockLen: number;\n} & HashInfo &\n (Opts extends undefined\n ? {\n (msg: Uint8Array): Uint8Array;\n create(): T;\n }\n : {\n (msg: Uint8Array, opts?: Opts): Uint8Array;\n create(opts?: Opts): T;\n });\n/* XOF with output /\nexport type CHashXOF<T extends HashXOF<T> = HashXOF<any>, Opts = undefined> = CHash<T, Opts>;\n\n/* Creates function with outputLen, blockLen, create properties from a class constructor. /\nexport function createHasher<T extends Hash<T>, Opts = undefined>(\n hashCons: HasherCons<T, Opts>,\n info: HashInfo = {}\n): CHash<T, Opts> {\n const hashC: any = (msg: Uint8Array, opts?: Opts) => hashCons(opts).update(msg).digest();\n const tmp = hashCons(undefined);\n hashC.outputLen = tmp.outputLen;\n hashC.blockLen = tmp.blockLen;\n hashC.create = (opts?: Opts) => hashCons(opts);\n Object.assign(hashC, info);\n return Object.freeze(hashC);\n}\n\n/* Cryptographically secure PRNG. Uses internal OS-level `crypto.getRandomValues`. /\nexport function randomBytes(bytesLength = 32): Uint8Array {\n const cr = typeof globalThis === 'object' ? (globalThis as any).crypto : null;\n if (typeof cr?.getRandomValues !== 'function')\n throw new Error('crypto.getRandomValues must be defined');\n return cr.getRandomValues(new Uint8Array(bytesLength));\n}\n\n/* Creates OID opts for NIST hashes, with prefix 06 09 60 86 48 01 65 03 04 02. /\nexport const oidNist = (suffix: number): Required<HashInfo> => ({\n oid: Uint8Array.from([0x06, 0x09, 0x60, 0x86, 0x48, 0x01, 0x65, 0x03, 0x04, 0x02, suffix]),\n});\n","/\n SHA3 (keccak) hash function, based on a new \"Sponge function\" design.\n * Different from older hashes, the internal state is bigger than output size.\n \n Check out [FIPS-202](https://nvlpubs.nist.gov/nistpubs/FIPS/NIST.FIPS.202.pdf),\n * [Website](https://keccak.team/keccak.html),\n * [the differences between SHA-3 and Keccak](https://crypto.stackexchange.com/questions/15727/what-are-the-key-differences-between-the-draft-sha-3-standard-and-the-keccak-sub).\n \n Check out `sha3-addons` module for cSHAKE, k12, and others.\n * @module\n /\nimport { rotlBH, rotlBL, rotlSH, rotlSL, split } from './_u64.ts';\n// prettier-ignore\nimport {\n abytes, aexists, anumber, aoutput,\n clean, createHasher,\n oidNist,\n swap32IfBE,\n u32,\n type CHash, type CHashXOF,\n type Hash,\n type HashInfo,\n type HashXOF\n} from './utils.ts';\n\n// No __PURE__ annotations in sha3 header:\n// EVERYTHING is in fact used on every export.\n// Various per round constants calculations\nconst _0n = BigInt(0);\nconst _1n = BigInt(1);\nconst _2n = BigInt(2);\nconst _7n = BigInt(7);\nconst _256n = BigInt(256);\nconst _0x71n = BigInt(0x71);\nconst SHA3_PI: number[] = [];\nconst SHA3_ROTL: number[] = [];\nconst _SHA3_IOTA: bigint[] = []; // no pure annotation: var is always used\nfor (let round = 0, R = _1n, x = 1, y = 0; round < 24; round++) {\n // Pi\n [x, y] = [y, (2 x + 3 * y) % 5];\n SHA3_PI.push(2 * (5 * y + x));\n // Rotational\n SHA3_ROTL.push((((round + 1) * (round + 2)) / 2) % 64);\n // Iota\n let t = _0n;\n for (let j = 0; j < 7; j++) {\n R = ((R << _1n) ^ ((R >> _7n) * _0x71n)) % _256n;\n if (R & _2n) t ^= _1n << ((_1n << BigInt(j)) - _1n);\n }\n _SHA3_IOTA.push(t);\n}\nconst IOTAS = split(_SHA3_IOTA, true);\nconst SHA3_IOTA_H = IOTAS[0];\nconst SHA3_IOTA_L = IOTAS[1];\n\n// Left rotation (without 0, 32, 64)\nconst rotlH = (h: number, l: number, s: number) => (s > 32 ? rotlBH(h, l, s) : rotlSH(h, l, s));\nconst rotlL = (h: number, l: number, s: number) => (s > 32 ? rotlBL(h, l, s) : rotlSL(h, l, s));\n\n/** `keccakf1600` internal function, additionally allows to adjust round count. /\nexport function keccakP(s: Uint32Array, rounds: number = 24): void {\n const B = new Uint32Array(5 2);\n // NOTE: all indices are x2 since we store state as u32 instead of u64 (bigints to slow in js)\n for (let round = 24 - rounds; round < 24; round++) {\n // Theta θ\n for (let x = 0; x < 10; x++) B[x] = s[x] ^ s[x + 10] ^ s[x + 20] ^ s[x + 30] ^ s[x + 40];\n for (let x = 0; x < 10; x += 2) {\n const idx1 = (x + 8) % 10;\n const idx0 = (x + 2) % 10;\n const B0 = B[idx0];\n const B1 = B[idx0 + 1];\n const Th = rotlH(B0, B1, 1) ^ B[idx1];\n const Tl = rotlL(B0, B1, 1) ^ B[idx1 + 1];\n for (let y = 0; y < 50; y += 10) {\n s[x + y] ^= Th;\n s[x + y + 1] ^= Tl;\n }\n }\n // Rho (ρ) and Pi (π)\n let curH = s[2];\n let curL = s[3];\n for (let t = 0; t < 24; t++) {\n const shift = SHA3_ROTL[t];\n const Th = rotlH(curH, curL, shift);\n const Tl = rotlL(curH, curL, shift);\n const PI = SHA3_PI[t];\n curH = s[PI];\n curL = s[PI + 1];\n s[PI] = Th;\n s[PI + 1] = Tl;\n }\n // Chi (χ)\n for (let y = 0; y < 50; y += 10) {\n for (let x = 0; x < 10; x++) B[x] = s[y + x];\n for (let x = 0; x < 10; x++) s[y + x] ^= ~B[(x + 2) % 10] & B[(x + 4) % 10];\n }\n // Iota (ι)\n s[0] ^= SHA3_IOTA_H[round];\n s[1] ^= SHA3_IOTA_L[round];\n }\n clean(B);\n}\n\n/** Keccak sponge function. /\nexport class Keccak implements Hash<Keccak>, HashXOF<Keccak> {\n protected state: Uint8Array;\n protected pos = 0;\n protected posOut = 0;\n protected finished = false;\n protected state32: Uint32Array;\n protected destroyed = false;\n\n public blockLen: number;\n public suffix: number;\n public outputLen: number;\n protected enableXOF = false;\n protected rounds: number;\n\n // NOTE: we accept arguments in bytes instead of bits here.\n constructor(\n blockLen: number,\n suffix: number,\n outputLen: number,\n enableXOF = false,\n rounds: number = 24\n ) {\n this.blockLen = blockLen;\n this.suffix = suffix;\n this.outputLen = outputLen;\n this.enableXOF = enableXOF;\n this.rounds = rounds;\n // Can be passed from user as dkLen\n anumber(outputLen, 'outputLen');\n // 1600 = 5x5 matrix of 64bit. 1600 bits === 200 bytes\n // 0 < blockLen < 200\n if (!(0 < blockLen && blockLen < 200))\n throw new Error('only keccak-f1600 function is supported');\n this.state = new Uint8Array(200);\n this.state32 = u32(this.state);\n }\n clone(): Keccak {\n return this._cloneInto();\n }\n protected keccak(): void {\n swap32IfBE(this.state32);\n keccakP(this.state32, this.rounds);\n swap32IfBE(this.state32);\n this.posOut = 0;\n this.pos = 0;\n }\n update(data: Uint8Array): this {\n aexists(this);\n abytes(data);\n const { blockLen, state } = this;\n const len = data.length;\n for (let pos = 0; pos < len; ) {\n const take = Math.min(blockLen - this.pos, len - pos);\n for (let i = 0; i < take; i++) state[this.pos++] ^= data[pos++];\n if (this.pos === blockLen) this.keccak();\n }\n return this;\n }\n protected finish(): void {\n if (this.finished) return;\n this.finished = true;\n const { state, suffix, pos, blockLen } = this;\n // Do the padding\n state[pos] ^= suffix;\n if ((suffix & 0x80) !== 0 && pos === blockLen - 1) this.keccak();\n state[blockLen - 1] ^= 0x80;\n this.keccak();\n }\n protected writeInto(out: Uint8Array): Uint8Array {\n aexists(this, false);\n abytes(out);\n this.finish();\n const bufferOut = this.state;\n const { blockLen } = this;\n for (let pos = 0, len = out.length; pos < len; ) {\n if (this.posOut >= blockLen) this.keccak();\n const take = Math.min(blockLen - this.posOut, len - pos);\n out.set(bufferOut.subarray(this.posOut, this.posOut + take), pos);\n this.posOut += take;\n pos += take;\n }\n return out;\n }\n xofInto(out: Uint8Array): Uint8Array {\n // Sha3/Keccak usage with XOF is probably mistake, only SHAKE instances can do XOF\n if (!this.enableXOF) throw new Error('XOF is not possible for this instance');\n return this.writeInto(out);\n }\n xof(bytes: number): Uint8Array {\n anumber(bytes);\n return this.xofInto(new Uint8Array(bytes));\n }\n digestInto(out: Uint8Array): Uint8Array {\n aoutput(out, this);\n if (this.finished) throw new Error('digest() was already called');\n this.writeInto(out);\n this.destroy();\n return out;\n }\n digest(): Uint8Array {\n return this.digestInto(new Uint8Array(this.outputLen));\n }\n destroy(): void {\n this.destroyed = true;\n clean(this.state);\n }\n _cloneInto(to?: Keccak): Keccak {\n const { blockLen, suffix, outputLen, rounds, enableXOF } = this;\n to \|\|= new Keccak(blockLen, suffix, outputLen, enableXOF, rounds);\n to.state32.set(this.state32);\n to.pos = this.pos;\n to.posOut = this.posOut;\n to.finished = this.finished;\n to.rounds = rounds;\n // Suffix can change in cSHAKE\n to.suffix = suffix;\n to.outputLen = outputLen;\n to.enableXOF = enableXOF;\n to.destroyed = this.destroyed;\n return to;\n }\n}\n\nconst genKeccak = (suffix: number, blockLen: number, outputLen: number, info: HashInfo = {}) =>\n createHasher(() => new Keccak(blockLen, suffix, outputLen), info);\n\n/* SHA3-224 hash function. /\nexport const sha3_224: CHash = / @__PURE__ / genKeccak(\n 0x06,\n 144,\n 28,\n / @__PURE__ / oidNist(0x07)\n);\n/* SHA3-256 hash function. Different from keccak-256. /\nexport const sha3_256: CHash = / @__PURE__ / genKeccak(\n 0x06,\n 136,\n 32,\n / @__PURE__ / oidNist(0x08)\n);\n/* SHA3-384 hash function. /\nexport const sha3_384: CHash = / @__PURE__ / genKeccak(\n 0x06,\n 104,\n 48,\n / @__PURE__ / oidNist(0x09)\n);\n/* SHA3-512 hash function. /\nexport const sha3_512: CHash = / @__PURE__ / genKeccak(\n 0x06,\n 72,\n 64,\n / @__PURE__ / oidNist(0x0a)\n);\n\n/* keccak-224 hash function. /\nexport const keccak_224: CHash = / @__PURE__ / genKeccak(0x01, 144, 28);\n/* keccak-256 hash function. Different from SHA3-256. /\nexport const keccak_256: CHash = / @__PURE__ / genKeccak(0x01, 136, 32);\n/* keccak-384 hash function. /\nexport const keccak_384: CHash = / @__PURE__ / genKeccak(0x01, 104, 48);\n/* keccak-512 hash function. /\nexport const keccak_512: CHash = / @__PURE__ / genKeccak(0x01, 72, 64);\n\n/* Options for SHAKE XOF. /\nexport type ShakeOpts = { dkLen?: number };\n\nconst genShake = (suffix: number, blockLen: number, outputLen: number, info: HashInfo = {}) =>\n createHasher<Keccak, ShakeOpts>(\n (opts: ShakeOpts = {}) =>\n new Keccak(blockLen, suffix, opts.dkLen === undefined ? outputLen : opts.dkLen, true),\n info\n );\n\n/* SHAKE128 XOF with 128-bit security. /\nexport const shake128: CHashXOF<Keccak, ShakeOpts> =\n / @__PURE__ /\n genShake(0x1f, 168, 16, / @__PURE__ / oidNist(0x0b));\n/* SHAKE256 XOF with 256-bit security. /\nexport const shake256: CHashXOF<Keccak, ShakeOpts> =\n / @__PURE__ /\n genShake(0x1f, 136, 32, / @__PURE__ / oidNist(0x0c));\n\n/* SHAKE128 XOF with 256-bit output (NIST version). /\nexport const shake128_32: CHashXOF<Keccak, ShakeOpts> =\n / @__PURE__ /\n genShake(0x1f, 168, 32, / @__PURE__ / oidNist(0x0b));\n/* SHAKE256 XOF with 512-bit output (NIST version). /\nexport const shake256_64: CHashXOF<Keccak, ShakeOpts> =\n / @__PURE__ /\n genShake(0x1f, 136, 64, / @__PURE__ / oidNist(0x0c));\n","/\r\n * bignumber.js v9.3.1\r\n * A JavaScript library for arbitrary-precision arithmetic.\r\n * https://github.com/MikeMcl/bignumber.js\r\n * Copyright (c) 2025 Michael Mclaughlin <M8ch88l@gmail.com>\r\n * MIT Licensed.\r\n \r\n BigNumber.prototype methods \| BigNumber methods\r\n * \|\r\n * absoluteValue abs \| clone\r\n * comparedTo \| config set\r\n * decimalPlaces dp \| DECIMAL_PLACES\r\n * dividedBy div \| ROUNDING_MODE\r\n * dividedToIntegerBy idiv \| EXPONENTIAL_AT\r\n * exponentiatedBy pow \| RANGE\r\n * integerValue \| CRYPTO\r\n * isEqualTo eq \| MODULO_MODE\r\n * isFinite \| POW_PRECISION\r\n * isGreaterThan gt \| FORMAT\r\n * isGreaterThanOrEqualTo gte \| ALPHABET\r\n * isInteger \| isBigNumber\r\n * isLessThan lt \| maximum max\r\n * isLessThanOrEqualTo lte \| minimum min\r\n * isNaN \| random\r\n * isNegative \| sum\r\n * isPositive \|\r\n * isZero \|\r\n * minus \|\r\n * modulo mod \|\r\n * multipliedBy times \|\r\n * negated \|\r\n * plus \|\r\n * precision sd \|\r\n * shiftedBy \|\r\n * squareRoot sqrt \|\r\n * toExponential \|\r\n * toFixed \|\r\n * toFormat \|\r\n * toFraction \|\r\n * toJSON \|\r\n * toNumber \|\r\n * toPrecision \|\r\n * toString \|\r\n * valueOf \|\r\n \r\n /\r\n\r\n\r\nvar\r\n isNumeric = /^-?(?:\\d+(?:\\.\\d)?\|\\.\\d+)(?:e[+-]?\\d+)?$/i,\r\n mathceil = Math.ceil,\r\n mathfloor = Math.floor,\r\n\r\n bignumberError = '[BigNumber Error] ',\r\n tooManyDigits = bignumberError + 'Number primitive has more than 15 significant digits: ',\r\n\r\n BASE = 1e14,\r\n LOG_BASE = 14,\r\n MAX_SAFE_INTEGER = 0x1fffffffffffff, // 2^53 - 1\r\n // MAX_INT32 = 0x7fffffff, // 2^31 - 1\r\n POWS_TEN = [1, 10, 100, 1e3, 1e4, 1e5, 1e6, 1e7, 1e8, 1e9, 1e10, 1e11, 1e12, 1e13],\r\n SQRT_BASE = 1e7,\r\n\r\n // EDITABLE\r\n // The limit on the value of DECIMAL_PLACES, TO_EXP_NEG, TO_EXP_POS, MIN_EXP, MAX_EXP, and\r\n // the arguments to toExponential, toFixed, toFormat, and toPrecision.\r\n MAX = 1E9; // 0 to MAX_INT32\r\n\r\n\r\n/\r\n * Create and return a BigNumber constructor.\r\n /\r\nfunction clone(configObject) {\r\n var div, convertBase, parseNumeric,\r\n P = BigNumber.prototype = { constructor: BigNumber, toString: null, valueOf: null },\r\n ONE = new BigNumber(1),\r\n\r\n\r\n //----------------------------- EDITABLE CONFIG DEFAULTS -------------------------------\r\n\r\n\r\n // The default values below must be integers within the inclusive ranges stated.\r\n // The values can also be changed at run-time using BigNumber.set.\r\n\r\n // The maximum number of decimal places for operations involving division.\r\n DECIMAL_PLACES = 20, // 0 to MAX\r\n\r\n // The rounding mode used when rounding to the above decimal places, and when using\r\n // toExponential, toFixed, toFormat and toPrecision, and round (default value).\r\n // UP 0 Away from zero.\r\n // DOWN 1 Towards zero.\r\n // CEIL 2 Towards +Infinity.\r\n // FLOOR 3 Towards -Infinity.\r\n // HALF_UP 4 Towards nearest neighbour. If equidistant, up.\r\n // HALF_DOWN 5 Towards nearest neighbour. If equidistant, down.\r\n // HALF_EVEN 6 Towards nearest neighbour. If equidistant, towards even neighbour.\r\n // HALF_CEIL 7 Towards nearest neighbour. If equidistant, towards +Infinity.\r\n // HALF_FLOOR 8 Towards nearest neighbour. If equidistant, towards -Infinity.\r\n ROUNDING_MODE = 4, // 0 to 8\r\n\r\n // EXPONENTIAL_AT : [TO_EXP_NEG , TO_EXP_POS]\r\n\r\n // The exponent value at and beneath which toString returns exponential notation.\r\n // Number type: -7\r\n TO_EXP_NEG = -7, // 0 to -MAX\r\n\r\n // The exponent value at and above which toString returns exponential notation.\r\n // Number type: 21\r\n TO_EXP_POS = 21, // 0 to MAX\r\n\r\n // RANGE : [MIN_EXP, MAX_EXP]\r\n\r\n // The minimum exponent value, beneath which underflow to zero occurs.\r\n // Number type: -324 (5e-324)\r\n MIN_EXP = -1e7, // -1 to -MAX\r\n\r\n // The maximum exponent value, above which overflow to Infinity occurs.\r\n // Number type: 308 (1.7976931348623157e+308)\r\n // For MAX_EXP > 1e7, e.g. new BigNumber('1e100000000').plus(1) may be slow.\r\n MAX_EXP = 1e7, // 1 to MAX\r\n\r\n // Whether to use cryptographically-secure random number generation, if available.\r\n CRYPTO = false, // true or false\r\n\r\n // The modulo mode used when calculating the modulus: a mod n.\r\n // The quotient (q = a / n) is calculated according to the corresponding rounding mode.\r\n // The remainder (r) is calculated as: r = a - n q.\r\n //\r\n // UP 0 The remainder is positive if the dividend is negative, else is negative.\r\n // DOWN 1 The remainder has the same sign as the dividend.\r\n // This modulo mode is commonly known as 'truncated division' and is\r\n // equivalent to (a % n) in JavaScript.\r\n // FLOOR 3 The remainder has the same sign as the divisor (Python %).\r\n // HALF_EVEN 6 This modulo mode implements the IEEE 754 remainder function.\r\n // EUCLID 9 Euclidian division. q = sign(n) * floor(a / abs(n)).\r\n // The remainder is always positive.\r\n //\r\n // The truncated division, floored division, Euclidian division and IEEE 754 remainder\r\n // modes are commonly used for the modulus operation.\r\n // Although the other rounding modes can also be used, they may not give useful results.\r\n MODULO_MODE = 1, // 0 to 9\r\n\r\n // The maximum number of significant digits of the result of the exponentiatedBy operation.\r\n // If POW_PRECISION is 0, there will be unlimited significant digits.\r\n POW_PRECISION = 0, // 0 to MAX\r\n\r\n // The format specification used by the BigNumber.prototype.toFormat method.\r\n FORMAT = {\r\n prefix: '',\r\n groupSize: 3,\r\n secondaryGroupSize: 0,\r\n groupSeparator: ',',\r\n decimalSeparator: '.',\r\n fractionGroupSize: 0,\r\n fractionGroupSeparator: '\\xA0', // non-breaking space\r\n suffix: ''\r\n },\r\n\r\n // The alphabet used for base conversion. It must be at least 2 characters long, with no '+',\r\n // '-', '.', whitespace, or repeated character.\r\n // '0123456789abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ$_'\r\n ALPHABET = '0123456789abcdefghijklmnopqrstuvwxyz',\r\n alphabetHasNormalDecimalDigits = true;\r\n\r\n\r\n //------------------------------------------------------------------------------------------\r\n\r\n\r\n // CONSTRUCTOR\r\n\r\n\r\n /\r\n The BigNumber constructor and exported function.\r\n * Create and return a new instance of a BigNumber object.\r\n \r\n v {number\|string\|BigNumber} A numeric value.\r\n * [b] {number} The base of v. Integer, 2 to ALPHABET.length inclusive.\r\n /\r\n function BigNumber(v, b) {\r\n var alphabet, c, caseChanged, e, i, isNum, len, str,\r\n x = this;\r\n\r\n // Enable constructor call without `new`.\r\n if (!(x instanceof BigNumber)) return new BigNumber(v, b);\r\n\r\n if (b == null) {\r\n\r\n if (v && v._isBigNumber === true) {\r\n x.s = v.s;\r\n\r\n if (!v.c \|\| v.e > MAX_EXP) {\r\n x.c = x.e = null;\r\n } else if (v.e < MIN_EXP) {\r\n x.c = [x.e = 0];\r\n } else {\r\n x.e = v.e;\r\n x.c = v.c.slice();\r\n }\r\n\r\n return;\r\n }\r\n\r\n if ((isNum = typeof v == 'number') && v 0 == 0) {\r\n\r\n // Use `1 / n` to handle minus zero also.\r\n x.s = 1 / v < 0 ? (v = -v, -1) : 1;\r\n\r\n // Fast path for integers, where n < 2147483648 (2*31).\r\n if (v === ~~v) {\r\n for (e = 0, i = v; i >= 10; i /= 10, e++);\r\n\r\n if (e > MAX_EXP) {\r\n x.c = x.e = null;\r\n } else {\r\n x.e = e;\r\n x.c = [v];\r\n }\r\n\r\n return;\r\n }\r\n\r\n str = String(v);\r\n } else {\r\n\r\n if (!isNumeric.test(str = String(v))) return parseNumeric(x, str, isNum);\r\n\r\n x.s = str.charCodeAt(0) == 45 ? (str = str.slice(1), -1) : 1;\r\n }\r\n\r\n // Decimal point?\r\n if ((e = str.indexOf('.')) > -1) str = str.replace('.', '');\r\n\r\n // Exponential form?\r\n if ((i = str.search(/e/i)) > 0) {\r\n\r\n // Determine exponent.\r\n if (e < 0) e = i;\r\n e += +str.slice(i + 1);\r\n str = str.substring(0, i);\r\n } else if (e < 0) {\r\n\r\n // Integer.\r\n e = str.length;\r\n }\r\n\r\n } else {\r\n\r\n // '[BigNumber Error] Base {not a primitive number\|not an integer\|out of range}: {b}'\r\n intCheck(b, 2, ALPHABET.length, 'Base');\r\n\r\n // Allow exponential notation to be used with base 10 argument, while\r\n // also rounding to DECIMAL_PLACES as with other bases.\r\n if (b == 10 && alphabetHasNormalDecimalDigits) {\r\n x = new BigNumber(v);\r\n return round(x, DECIMAL_PLACES + x.e + 1, ROUNDING_MODE);\r\n }\r\n\r\n str = String(v);\r\n\r\n if (isNum = typeof v == 'number') {\r\n\r\n // Avoid potential interpretation of Infinity and NaN as base 44+ values.\r\n if (v 0 != 0) return parseNumeric(x, str, isNum, b);\r\n\r\n x.s = 1 / v < 0 ? (str = str.slice(1), -1) : 1;\r\n\r\n // '[BigNumber Error] Number primitive has more than 15 significant digits: {n}'\r\n if (BigNumber.DEBUG && str.replace(/^0\\.0\|\\./, '').length > 15) {\r\n throw Error\r\n (tooManyDigits + v);\r\n }\r\n } else {\r\n x.s = str.charCodeAt(0) === 45 ? (str = str.slice(1), -1) : 1;\r\n }\r\n\r\n alphabet = ALPHABET.slice(0, b);\r\n e = i = 0;\r\n\r\n // Check that str is a valid base b number.\r\n // Don't use RegExp, so alphabet can contain special characters.\r\n for (len = str.length; i < len; i++) {\r\n if (alphabet.indexOf(c = str.charAt(i)) < 0) {\r\n if (c == '.') {\r\n\r\n // If '.' is not the first character and it has not be found before.\r\n if (i > e) {\r\n e = len;\r\n continue;\r\n }\r\n } else if (!caseChanged) {\r\n\r\n // Allow e.g. hexadecimal 'FF' as well as 'ff'.\r\n if (str == str.toUpperCase() && (str = str.toLowerCase()) \|\|\r\n str == str.toLowerCase() && (str = str.toUpperCase())) {\r\n caseChanged = true;\r\n i = -1;\r\n e = 0;\r\n continue;\r\n }\r\n }\r\n\r\n return parseNumeric(x, String(v), isNum, b);\r\n }\r\n }\r\n\r\n // Prevent later check for length on converted number.\r\n isNum = false;\r\n str = convertBase(str, b, 10, x.s);\r\n\r\n // Decimal point?\r\n if ((e = str.indexOf('.')) > -1) str = str.replace('.', '');\r\n else e = str.length;\r\n }\r\n\r\n // Determine leading zeros.\r\n for (i = 0; str.charCodeAt(i) === 48; i++);\r\n\r\n // Determine trailing zeros.\r\n for (len = str.length; str.charCodeAt(--len) === 48;);\r\n\r\n if (str = str.slice(i, ++len)) {\r\n len -= i;\r\n\r\n // '[BigNumber Error] Number primitive has more than 15 significant digits: {n}'\r\n if (isNum && BigNumber.DEBUG &&\r\n len > 15 && (v > MAX_SAFE_INTEGER \|\| v !== mathfloor(v))) {\r\n throw Error\r\n (tooManyDigits + (x.s v));\r\n }\r\n\r\n // Overflow?\r\n if ((e = e - i - 1) > MAX_EXP) {\r\n\r\n // Infinity.\r\n x.c = x.e = null;\r\n\r\n // Underflow?\r\n } else if (e < MIN_EXP) {\r\n\r\n // Zero.\r\n x.c = [x.e = 0];\r\n } else {\r\n x.e = e;\r\n x.c = [];\r\n\r\n // Transform base\r\n\r\n // e is the base 10 exponent.\r\n // i is where to slice str to get the first element of the coefficient array.\r\n i = (e + 1) % LOG_BASE;\r\n if (e < 0) i += LOG_BASE; // i < 1\r\n\r\n if (i < len) {\r\n if (i) x.c.push(+str.slice(0, i));\r\n\r\n for (len -= LOG_BASE; i < len;) {\r\n x.c.push(+str.slice(i, i += LOG_BASE));\r\n }\r\n\r\n i = LOG_BASE - (str = str.slice(i)).length;\r\n } else {\r\n i -= len;\r\n }\r\n\r\n for (; i--; str += '0');\r\n x.c.push(+str);\r\n }\r\n } else {\r\n\r\n // Zero.\r\n x.c = [x.e = 0];\r\n }\r\n }\r\n\r\n\r\n // CONSTRUCTOR PROPERTIES\r\n\r\n\r\n BigNumber.clone = clone;\r\n\r\n BigNumber.ROUND_UP = 0;\r\n BigNumber.ROUND_DOWN = 1;\r\n BigNumber.ROUND_CEIL = 2;\r\n BigNumber.ROUND_FLOOR = 3;\r\n BigNumber.ROUND_HALF_UP = 4;\r\n BigNumber.ROUND_HALF_DOWN = 5;\r\n BigNumber.ROUND_HALF_EVEN = 6;\r\n BigNumber.ROUND_HALF_CEIL = 7;\r\n BigNumber.ROUND_HALF_FLOOR = 8;\r\n BigNumber.EUCLID = 9;\r\n\r\n\r\n /\r\n Configure infrequently-changing library-wide settings.\r\n \r\n Accept an object with the following optional properties (if the value of a property is\r\n * a number, it must be an integer within the inclusive range stated):\r\n \r\n DECIMAL_PLACES {number} 0 to MAX\r\n * ROUNDING_MODE {number} 0 to 8\r\n * EXPONENTIAL_AT {number\|number[]} -MAX to MAX or [-MAX to 0, 0 to MAX]\r\n * RANGE {number\|number[]} -MAX to MAX (not zero) or [-MAX to -1, 1 to MAX]\r\n * CRYPTO {boolean} true or false\r\n * MODULO_MODE {number} 0 to 9\r\n * POW_PRECISION {number} 0 to MAX\r\n * ALPHABET {string} A string of two or more unique characters which does\r\n * not contain '.'.\r\n * FORMAT {object} An object with some of the following properties:\r\n * prefix {string}\r\n * groupSize {number}\r\n * secondaryGroupSize {number}\r\n * groupSeparator {string}\r\n * decimalSeparator {string}\r\n * fractionGroupSize {number}\r\n * fractionGroupSeparator {string}\r\n * suffix {string}\r\n \r\n (The values assigned to the above FORMAT object properties are not checked for validity.)\r\n \r\n E.g.\r\n * BigNumber.config({ DECIMAL_PLACES : 20, ROUNDING_MODE : 4 })\r\n \r\n Ignore properties/parameters set to null or undefined, except for ALPHABET.\r\n \r\n Return an object with the properties current values.\r\n /\r\n BigNumber.config = BigNumber.set = function (obj) {\r\n var p, v;\r\n\r\n if (obj != null) {\r\n\r\n if (typeof obj == 'object') {\r\n\r\n // DECIMAL_PLACES {number} Integer, 0 to MAX inclusive.\r\n // '[BigNumber Error] DECIMAL_PLACES {not a primitive number\|not an integer\|out of range}: {v}'\r\n if (obj.hasOwnProperty(p = 'DECIMAL_PLACES')) {\r\n v = obj[p];\r\n intCheck(v, 0, MAX, p);\r\n DECIMAL_PLACES = v;\r\n }\r\n\r\n // ROUNDING_MODE {number} Integer, 0 to 8 inclusive.\r\n // '[BigNumber Error] ROUNDING_MODE {not a primitive number\|not an integer\|out of range}: {v}'\r\n if (obj.hasOwnProperty(p = 'ROUNDING_MODE')) {\r\n v = obj[p];\r\n intCheck(v, 0, 8, p);\r\n ROUNDING_MODE = v;\r\n }\r\n\r\n // EXPONENTIAL_AT {number\|number[]}\r\n // Integer, -MAX to MAX inclusive or\r\n // [integer -MAX to 0 inclusive, 0 to MAX inclusive].\r\n // '[BigNumber Error] EXPONENTIAL_AT {not a primitive number\|not an integer\|out of range}: {v}'\r\n if (obj.hasOwnProperty(p = 'EXPONENTIAL_AT')) {\r\n v = obj[p];\r\n if (v && v.pop) {\r\n intCheck(v[0], -MAX, 0, p);\r\n intCheck(v[1], 0, MAX, p);\r\n TO_EXP_NEG = v[0];\r\n TO_EXP_POS = v[1];\r\n } else {\r\n intCheck(v, -MAX, MAX, p);\r\n TO_EXP_NEG = -(TO_EXP_POS = v < 0 ? -v : v);\r\n }\r\n }\r\n\r\n // RANGE {number\|number[]} Non-zero integer, -MAX to MAX inclusive or\r\n // [integer -MAX to -1 inclusive, integer 1 to MAX inclusive].\r\n // '[BigNumber Error] RANGE {not a primitive number\|not an integer\|out of range\|cannot be zero}: {v}'\r\n if (obj.hasOwnProperty(p = 'RANGE')) {\r\n v = obj[p];\r\n if (v && v.pop) {\r\n intCheck(v[0], -MAX, -1, p);\r\n intCheck(v[1], 1, MAX, p);\r\n MIN_EXP = v[0];\r\n MAX_EXP = v[1];\r\n } else {\r\n intCheck(v, -MAX, MAX, p);\r\n if (v) {\r\n MIN_EXP = -(MAX_EXP = v < 0 ? -v : v);\r\n } else {\r\n throw Error\r\n (bignumberError + p + ' cannot be zero: ' + v);\r\n }\r\n }\r\n }\r\n\r\n // CRYPTO {boolean} true or false.\r\n // '[BigNumber Error] CRYPTO not true or false: {v}'\r\n // '[BigNumber Error] crypto unavailable'\r\n if (obj.hasOwnProperty(p = 'CRYPTO')) {\r\n v = obj[p];\r\n if (v === !!v) {\r\n if (v) {\r\n if (typeof crypto != 'undefined' && crypto &&\r\n (crypto.getRandomValues \|\| crypto.randomBytes)) {\r\n CRYPTO = v;\r\n } else {\r\n CRYPTO = !v;\r\n throw Error\r\n (bignumberError + 'crypto unavailable');\r\n }\r\n } else {\r\n CRYPTO = v;\r\n }\r\n } else {\r\n throw Error\r\n (bignumberError + p + ' not true or false: ' + v);\r\n }\r\n }\r\n\r\n // MODULO_MODE {number} Integer, 0 to 9 inclusive.\r\n // '[BigNumber Error] MODULO_MODE {not a primitive number\|not an integer\|out of range}: {v}'\r\n if (obj.hasOwnProperty(p = 'MODULO_MODE')) {\r\n v = obj[p];\r\n intCheck(v, 0, 9, p);\r\n MODULO_MODE = v;\r\n }\r\n\r\n // POW_PRECISION {number} Integer, 0 to MAX inclusive.\r\n // '[BigNumber Error] POW_PRECISION {not a primitive number\|not an integer\|out of range}: {v}'\r\n if (obj.hasOwnProperty(p = 'POW_PRECISION')) {\r\n v = obj[p];\r\n intCheck(v, 0, MAX, p);\r\n POW_PRECISION = v;\r\n }\r\n\r\n // FORMAT {object}\r\n // '[BigNumber Error] FORMAT not an object: {v}'\r\n if (obj.hasOwnProperty(p = 'FORMAT')) {\r\n v = obj[p];\r\n if (typeof v == 'object') FORMAT = v;\r\n else throw Error\r\n (bignumberError + p + ' not an object: ' + v);\r\n }\r\n\r\n // ALPHABET {string}\r\n // '[BigNumber Error] ALPHABET invalid: {v}'\r\n if (obj.hasOwnProperty(p = 'ALPHABET')) {\r\n v = obj[p];\r\n\r\n // Disallow if less than two characters,\r\n // or if it contains '+', '-', '.', whitespace, or a repeated character.\r\n if (typeof v == 'string' && !/^.?$\|[+\\-.\\s]\|(.).\\1/.test(v)) {\r\n alphabetHasNormalDecimalDigits = v.slice(0, 10) == '0123456789';\r\n ALPHABET = v;\r\n } else {\r\n throw Error\r\n (bignumberError + p + ' invalid: ' + v);\r\n }\r\n }\r\n\r\n } else {\r\n\r\n // '[BigNumber Error] Object expected: {v}'\r\n throw Error\r\n (bignumberError + 'Object expected: ' + obj);\r\n }\r\n }\r\n\r\n return {\r\n DECIMAL_PLACES: DECIMAL_PLACES,\r\n ROUNDING_MODE: ROUNDING_MODE,\r\n EXPONENTIAL_AT: [TO_EXP_NEG, TO_EXP_POS],\r\n RANGE: [MIN_EXP, MAX_EXP],\r\n CRYPTO: CRYPTO,\r\n MODULO_MODE: MODULO_MODE,\r\n POW_PRECISION: POW_PRECISION,\r\n FORMAT: FORMAT,\r\n ALPHABET: ALPHABET\r\n };\r\n };\r\n\r\n\r\n /\r\n Return true if v is a BigNumber instance, otherwise return false.\r\n \r\n If BigNumber.DEBUG is true, throw if a BigNumber instance is not well-formed.\r\n \r\n v {any}\r\n \r\n '[BigNumber Error] Invalid BigNumber: {v}'\r\n /\r\n BigNumber.isBigNumber = function (v) {\r\n if (!v \|\| v._isBigNumber !== true) return false;\r\n if (!BigNumber.DEBUG) return true;\r\n\r\n var i, n,\r\n c = v.c,\r\n e = v.e,\r\n s = v.s;\r\n\r\n out: if ({}.toString.call(c) == '[object Array]') {\r\n\r\n if ((s === 1 \|\| s === -1) && e >= -MAX && e <= MAX && e === mathfloor(e)) {\r\n\r\n // If the first element is zero, the BigNumber value must be zero.\r\n if (c[0] === 0) {\r\n if (e === 0 && c.length === 1) return true;\r\n break out;\r\n }\r\n\r\n // Calculate number of digits that c[0] should have, based on the exponent.\r\n i = (e + 1) % LOG_BASE;\r\n if (i < 1) i += LOG_BASE;\r\n\r\n // Calculate number of digits of c[0].\r\n //if (Math.ceil(Math.log(c[0] + 1) / Math.LN10) == i) {\r\n if (String(c[0]).length == i) {\r\n\r\n for (i = 0; i < c.length; i++) {\r\n n = c[i];\r\n if (n < 0 \|\| n >= BASE \|\| n !== mathfloor(n)) break out;\r\n }\r\n\r\n // Last element cannot be zero, unless it is the only element.\r\n if (n !== 0) return true;\r\n }\r\n }\r\n\r\n // Infinity/NaN\r\n } else if (c === null && e === null && (s === null \|\| s === 1 \|\| s === -1)) {\r\n return true;\r\n }\r\n\r\n throw Error\r\n (bignumberError + 'Invalid BigNumber: ' + v);\r\n };\r\n\r\n\r\n /\r\n * Return a new BigNumber whose value is the maximum of the arguments.\r\n \r\n arguments {number\|string\|BigNumber}\r\n /\r\n BigNumber.maximum = BigNumber.max = function () {\r\n return maxOrMin(arguments, -1);\r\n };\r\n\r\n\r\n /\r\n * Return a new BigNumber whose value is the minimum of the arguments.\r\n \r\n arguments {number\|string\|BigNumber}\r\n /\r\n BigNumber.minimum = BigNumber.min = function () {\r\n return maxOrMin(arguments, 1);\r\n };\r\n\r\n\r\n /\r\n * Return a new BigNumber with a random value equal to or greater than 0 and less than 1,\r\n * and with dp, or DECIMAL_PLACES if dp is omitted, decimal places (or less if trailing\r\n * zeros are produced).\r\n \r\n [dp] {number} Decimal places. Integer, 0 to MAX inclusive.\r\n \r\n '[BigNumber Error] Argument {not a primitive number\|not an integer\|out of range}: {dp}'\r\n * '[BigNumber Error] crypto unavailable'\r\n /\r\n BigNumber.random = (function () {\r\n var pow2_53 = 0x20000000000000;\r\n\r\n // Return a 53 bit integer n, where 0 <= n < 9007199254740992.\r\n // Check if Math.random() produces more than 32 bits of randomness.\r\n // If it does, assume at least 53 bits are produced, otherwise assume at least 30 bits.\r\n // 0x40000000 is 2^30, 0x800000 is 2^23, 0x1fffff is 2^21 - 1.\r\n var random53bitInt = (Math.random() pow2_53) & 0x1fffff\r\n ? function () { return mathfloor(Math.random() * pow2_53); }\r\n : function () { return ((Math.random() * 0x40000000 \| 0) * 0x800000) +\r\n (Math.random() * 0x800000 \| 0); };\r\n\r\n return function (dp) {\r\n var a, b, e, k, v,\r\n i = 0,\r\n c = [],\r\n rand = new BigNumber(ONE);\r\n\r\n if (dp == null) dp = DECIMAL_PLACES;\r\n else intCheck(dp, 0, MAX);\r\n\r\n k = mathceil(dp / LOG_BASE);\r\n\r\n if (CRYPTO) {\r\n\r\n // Browsers supporting crypto.getRandomValues.\r\n if (crypto.getRandomValues) {\r\n\r\n a = crypto.getRandomValues(new Uint32Array(k = 2));\r\n\r\n for (; i < k;) {\r\n\r\n // 53 bits:\r\n // ((Math.pow(2, 32) - 1) Math.pow(2, 21)).toString(2)\r\n // 11111 11111111 11111111 11111111 11100000 00000000 00000000\r\n // ((Math.pow(2, 32) - 1) >>> 11).toString(2)\r\n // 11111 11111111 11111111\r\n // 0x20000 is 2^21.\r\n v = a[i] * 0x20000 + (a[i + 1] >>> 11);\r\n\r\n // Rejection sampling:\r\n // 0 <= v < 9007199254740992\r\n // Probability that v >= 9e15, is\r\n // 7199254740992 / 9007199254740992 ~= 0.0008, i.e. 1 in 1251\r\n if (v >= 9e15) {\r\n b = crypto.getRandomValues(new Uint32Array(2));\r\n a[i] = b[0];\r\n a[i + 1] = b[1];\r\n } else {\r\n\r\n // 0 <= v <= 8999999999999999\r\n // 0 <= (v % 1e14) <= 99999999999999\r\n c.push(v % 1e14);\r\n i += 2;\r\n }\r\n }\r\n i = k / 2;\r\n\r\n // Node.js supporting crypto.randomBytes.\r\n } else if (crypto.randomBytes) {\r\n\r\n // buffer\r\n a = crypto.randomBytes(k = 7);\r\n\r\n for (; i < k;) {\r\n\r\n // 0x1000000000000 is 2^48, 0x10000000000 is 2^40\r\n // 0x100000000 is 2^32, 0x1000000 is 2^24\r\n // 11111 11111111 11111111 11111111 11111111 11111111 11111111\r\n // 0 <= v < 9007199254740992\r\n v = ((a[i] & 31) 0x1000000000000) + (a[i + 1] * 0x10000000000) +\r\n (a[i + 2] * 0x100000000) + (a[i + 3] * 0x1000000) +\r\n (a[i + 4] << 16) + (a[i + 5] << 8) + a[i + 6];\r\n\r\n if (v >= 9e15) {\r\n crypto.randomBytes(7).copy(a, i);\r\n } else {\r\n\r\n // 0 <= (v % 1e14) <= 99999999999999\r\n c.push(v % 1e14);\r\n i += 7;\r\n }\r\n }\r\n i = k / 7;\r\n } else {\r\n CRYPTO = false;\r\n throw Error\r\n (bignumberError + 'crypto unavailable');\r\n }\r\n }\r\n\r\n // Use Math.random.\r\n if (!CRYPTO) {\r\n\r\n for (; i < k;) {\r\n v = random53bitInt();\r\n if (v < 9e15) c[i++] = v % 1e14;\r\n }\r\n }\r\n\r\n k = c[--i];\r\n dp %= LOG_BASE;\r\n\r\n // Convert trailing digits to zeros according to dp.\r\n if (k && dp) {\r\n v = POWS_TEN[LOG_BASE - dp];\r\n c[i] = mathfloor(k / v) * v;\r\n }\r\n\r\n // Remove trailing elements which are zero.\r\n for (; c[i] === 0; c.pop(), i--);\r\n\r\n // Zero?\r\n if (i < 0) {\r\n c = [e = 0];\r\n } else {\r\n\r\n // Remove leading elements which are zero and adjust exponent accordingly.\r\n for (e = -1 ; c[0] === 0; c.splice(0, 1), e -= LOG_BASE);\r\n\r\n // Count the digits of the first element of c to determine leading zeros, and...\r\n for (i = 1, v = c[0]; v >= 10; v /= 10, i++);\r\n\r\n // adjust the exponent accordingly.\r\n if (i < LOG_BASE) e -= LOG_BASE - i;\r\n }\r\n\r\n rand.e = e;\r\n rand.c = c;\r\n return rand;\r\n };\r\n })();\r\n\r\n\r\n /\r\n Return a BigNumber whose value is the sum of the arguments.\r\n \r\n arguments {number\|string\|BigNumber}\r\n /\r\n BigNumber.sum = function () {\r\n var i = 1,\r\n args = arguments,\r\n sum = new BigNumber(args[0]);\r\n for (; i < args.length;) sum = sum.plus(args[i++]);\r\n return sum;\r\n };\r\n\r\n\r\n // PRIVATE FUNCTIONS\r\n\r\n\r\n // Called by BigNumber and BigNumber.prototype.toString.\r\n convertBase = (function () {\r\n var decimal = '0123456789';\r\n\r\n /\r\n * Convert string of baseIn to an array of numbers of baseOut.\r\n * Eg. toBaseOut('255', 10, 16) returns [15, 15].\r\n * Eg. toBaseOut('ff', 16, 10) returns [2, 5, 5].\r\n /\r\n function toBaseOut(str, baseIn, baseOut, alphabet) {\r\n var j,\r\n arr = [0],\r\n arrL,\r\n i = 0,\r\n len = str.length;\r\n\r\n for (; i < len;) {\r\n for (arrL = arr.length; arrL--; arr[arrL] = baseIn);\r\n\r\n arr[0] += alphabet.indexOf(str.charAt(i++));\r\n\r\n for (j = 0; j < arr.length; j++) {\r\n\r\n if (arr[j] > baseOut - 1) {\r\n if (arr[j + 1] == null) arr[j + 1] = 0;\r\n arr[j + 1] += arr[j] / baseOut \| 0;\r\n arr[j] %= baseOut;\r\n }\r\n }\r\n }\r\n\r\n return arr.reverse();\r\n }\r\n\r\n // Convert a numeric string of baseIn to a numeric string of baseOut.\r\n // If the caller is toString, we are converting from base 10 to baseOut.\r\n // If the caller is BigNumber, we are converting from baseIn to base 10.\r\n return function (str, baseIn, baseOut, sign, callerIsToString) {\r\n var alphabet, d, e, k, r, x, xc, y,\r\n i = str.indexOf('.'),\r\n dp = DECIMAL_PLACES,\r\n rm = ROUNDING_MODE;\r\n\r\n // Non-integer.\r\n if (i >= 0) {\r\n k = POW_PRECISION;\r\n\r\n // Unlimited precision.\r\n POW_PRECISION = 0;\r\n str = str.replace('.', '');\r\n y = new BigNumber(baseIn);\r\n x = y.pow(str.length - i);\r\n POW_PRECISION = k;\r\n\r\n // Convert str as if an integer, then restore the fraction part by dividing the\r\n // result by its base raised to a power.\r\n\r\n y.c = toBaseOut(toFixedPoint(coeffToString(x.c), x.e, '0'),\r\n 10, baseOut, decimal);\r\n y.e = y.c.length;\r\n }\r\n\r\n // Convert the number as integer.\r\n\r\n xc = toBaseOut(str, baseIn, baseOut, callerIsToString\r\n ? (alphabet = ALPHABET, decimal)\r\n : (alphabet = decimal, ALPHABET));\r\n\r\n // xc now represents str as an integer and converted to baseOut. e is the exponent.\r\n e = k = xc.length;\r\n\r\n // Remove trailing zeros.\r\n for (; xc[--k] == 0; xc.pop());\r\n\r\n // Zero?\r\n if (!xc[0]) return alphabet.charAt(0);\r\n\r\n // Does str represent an integer? If so, no need for the division.\r\n if (i < 0) {\r\n --e;\r\n } else {\r\n x.c = xc;\r\n x.e = e;\r\n\r\n // The sign is needed for correct rounding.\r\n x.s = sign;\r\n x = div(x, y, dp, rm, baseOut);\r\n xc = x.c;\r\n r = x.r;\r\n e = x.e;\r\n }\r\n\r\n // xc now represents str converted to baseOut.\r\n\r\n // The index of the rounding digit.\r\n d = e + dp + 1;\r\n\r\n // The rounding digit: the digit to the right of the digit that may be rounded up.\r\n i = xc[d];\r\n\r\n // Look at the rounding digits and mode to determine whether to round up.\r\n\r\n k = baseOut / 2;\r\n r = r \|\| d < 0 \|\| xc[d + 1] != null;\r\n\r\n r = rm < 4 ? (i != null \|\| r) && (rm == 0 \|\| rm == (x.s < 0 ? 3 : 2))\r\n : i > k \|\| i == k &&(rm == 4 \|\| r \|\| rm == 6 && xc[d - 1] & 1 \|\|\r\n rm == (x.s < 0 ? 8 : 7));\r\n\r\n // If the index of the rounding digit is not greater than zero, or xc represents\r\n // zero, then the result of the base conversion is zero or, if rounding up, a value\r\n // such as 0.00001.\r\n if (d < 1 \|\| !xc[0]) {\r\n\r\n // 1^-dp or 0\r\n str = r ? toFixedPoint(alphabet.charAt(1), -dp, alphabet.charAt(0)) : alphabet.charAt(0);\r\n } else {\r\n\r\n // Truncate xc to the required number of decimal places.\r\n xc.length = d;\r\n\r\n // Round up?\r\n if (r) {\r\n\r\n // Rounding up may mean the previous digit has to be rounded up and so on.\r\n for (--baseOut; ++xc[--d] > baseOut;) {\r\n xc[d] = 0;\r\n\r\n if (!d) {\r\n ++e;\r\n xc = [1].concat(xc);\r\n }\r\n }\r\n }\r\n\r\n // Determine trailing zeros.\r\n for (k = xc.length; !xc[--k];);\r\n\r\n // E.g. [4, 11, 15] becomes 4bf.\r\n for (i = 0, str = ''; i <= k; str += alphabet.charAt(xc[i++]));\r\n\r\n // Add leading zeros, decimal point and trailing zeros as required.\r\n str = toFixedPoint(str, e, alphabet.charAt(0));\r\n }\r\n\r\n // The caller will add the sign.\r\n return str;\r\n };\r\n })();\r\n\r\n\r\n // Perform division in the specified base. Called by div and convertBase.\r\n div = (function () {\r\n\r\n // Assume non-zero x and k.\r\n function multiply(x, k, base) {\r\n var m, temp, xlo, xhi,\r\n carry = 0,\r\n i = x.length,\r\n klo = k % SQRT_BASE,\r\n khi = k / SQRT_BASE \| 0;\r\n\r\n for (x = x.slice(); i--;) {\r\n xlo = x[i] % SQRT_BASE;\r\n xhi = x[i] / SQRT_BASE \| 0;\r\n m = khi * xlo + xhi * klo;\r\n temp = klo * xlo + ((m % SQRT_BASE) * SQRT_BASE) + carry;\r\n carry = (temp / base \| 0) + (m / SQRT_BASE \| 0) + khi * xhi;\r\n x[i] = temp % base;\r\n }\r\n\r\n if (carry) x = [carry].concat(x);\r\n\r\n return x;\r\n }\r\n\r\n function compare(a, b, aL, bL) {\r\n var i, cmp;\r\n\r\n if (aL != bL) {\r\n cmp = aL > bL ? 1 : -1;\r\n } else {\r\n\r\n for (i = cmp = 0; i < aL; i++) {\r\n\r\n if (a[i] != b[i]) {\r\n cmp = a[i] > b[i] ? 1 : -1;\r\n break;\r\n }\r\n }\r\n }\r\n\r\n return cmp;\r\n }\r\n\r\n function subtract(a, b, aL, base) {\r\n var i = 0;\r\n\r\n // Subtract b from a.\r\n for (; aL--;) {\r\n a[aL] -= i;\r\n i = a[aL] < b[aL] ? 1 : 0;\r\n a[aL] = i * base + a[aL] - b[aL];\r\n }\r\n\r\n // Remove leading zeros.\r\n for (; !a[0] && a.length > 1; a.splice(0, 1));\r\n }\r\n\r\n // x: dividend, y: divisor.\r\n return function (x, y, dp, rm, base) {\r\n var cmp, e, i, more, n, prod, prodL, q, qc, rem, remL, rem0, xi, xL, yc0,\r\n yL, yz,\r\n s = x.s == y.s ? 1 : -1,\r\n xc = x.c,\r\n yc = y.c;\r\n\r\n // Either NaN, Infinity or 0?\r\n if (!xc \|\| !xc[0] \|\| !yc \|\| !yc[0]) {\r\n\r\n return new BigNumber(\r\n\r\n // Return NaN if either NaN, or both Infinity or 0.\r\n !x.s \|\| !y.s \|\| (xc ? yc && xc[0] == yc[0] : !yc) ? NaN :\r\n\r\n // Return ±0 if x is ±0 or y is ±Infinity, or return ±Infinity as y is ±0.\r\n xc && xc[0] == 0 \|\| !yc ? s * 0 : s / 0\r\n );\r\n }\r\n\r\n q = new BigNumber(s);\r\n qc = q.c = [];\r\n e = x.e - y.e;\r\n s = dp + e + 1;\r\n\r\n if (!base) {\r\n base = BASE;\r\n e = bitFloor(x.e / LOG_BASE) - bitFloor(y.e / LOG_BASE);\r\n s = s / LOG_BASE \| 0;\r\n }\r\n\r\n // Result exponent may be one less then the current value of e.\r\n // The coefficients of the BigNumbers from convertBase may have trailing zeros.\r\n for (i = 0; yc[i] == (xc[i] \|\| 0); i++);\r\n\r\n if (yc[i] > (xc[i] \|\| 0)) e--;\r\n\r\n if (s < 0) {\r\n qc.push(1);\r\n more = true;\r\n } else {\r\n xL = xc.length;\r\n yL = yc.length;\r\n i = 0;\r\n s += 2;\r\n\r\n // Normalise xc and yc so highest order digit of yc is >= base / 2.\r\n\r\n n = mathfloor(base / (yc[0] + 1));\r\n\r\n // Not necessary, but to handle odd bases where yc[0] == (base / 2) - 1.\r\n // if (n > 1 \|\| n++ == 1 && yc[0] < base / 2) {\r\n if (n > 1) {\r\n yc = multiply(yc, n, base);\r\n xc = multiply(xc, n, base);\r\n yL = yc.length;\r\n xL = xc.length;\r\n }\r\n\r\n xi = yL;\r\n rem = xc.slice(0, yL);\r\n remL = rem.length;\r\n\r\n // Add zeros to make remainder as long as divisor.\r\n for (; remL < yL; rem[remL++] = 0);\r\n yz = yc.slice();\r\n yz = [0].concat(yz);\r\n yc0 = yc[0];\r\n if (yc[1] >= base / 2) yc0++;\r\n // Not necessary, but to prevent trial digit n > base, when using base 3.\r\n // else if (base == 3 && yc0 == 1) yc0 = 1 + 1e-15;\r\n\r\n do {\r\n n = 0;\r\n\r\n // Compare divisor and remainder.\r\n cmp = compare(yc, rem, yL, remL);\r\n\r\n // If divisor < remainder.\r\n if (cmp < 0) {\r\n\r\n // Calculate trial digit, n.\r\n\r\n rem0 = rem[0];\r\n if (yL != remL) rem0 = rem0 * base + (rem[1] \|\| 0);\r\n\r\n // n is how many times the divisor goes into the current remainder.\r\n n = mathfloor(rem0 / yc0);\r\n\r\n // Algorithm:\r\n // product = divisor multiplied by trial digit (n).\r\n // Compare product and remainder.\r\n // If product is greater than remainder:\r\n // Subtract divisor from product, decrement trial digit.\r\n // Subtract product from remainder.\r\n // If product was less than remainder at the last compare:\r\n // Compare new remainder and divisor.\r\n // If remainder is greater than divisor:\r\n // Subtract divisor from remainder, increment trial digit.\r\n\r\n if (n > 1) {\r\n\r\n // n may be > base only when base is 3.\r\n if (n >= base) n = base - 1;\r\n\r\n // product = divisor * trial digit.\r\n prod = multiply(yc, n, base);\r\n prodL = prod.length;\r\n remL = rem.length;\r\n\r\n // Compare product and remainder.\r\n // If product > remainder then trial digit n too high.\r\n // n is 1 too high about 5% of the time, and is not known to have\r\n // ever been more than 1 too high.\r\n while (compare(prod, rem, prodL, remL) == 1) {\r\n n--;\r\n\r\n // Subtract divisor from product.\r\n subtract(prod, yL < prodL ? yz : yc, prodL, base);\r\n prodL = prod.length;\r\n cmp = 1;\r\n }\r\n } else {\r\n\r\n // n is 0 or 1, cmp is -1.\r\n // If n is 0, there is no need to compare yc and rem again below,\r\n // so change cmp to 1 to avoid it.\r\n // If n is 1, leave cmp as -1, so yc and rem are compared again.\r\n if (n == 0) {\r\n\r\n // divisor < remainder, so n must be at least 1.\r\n cmp = n = 1;\r\n }\r\n\r\n // product = divisor\r\n prod = yc.slice();\r\n prodL = prod.length;\r\n }\r\n\r\n if (prodL < remL) prod = [0].concat(prod);\r\n\r\n // Subtract product from remainder.\r\n subtract(rem, prod, remL, base);\r\n remL = rem.length;\r\n\r\n // If product was < remainder.\r\n if (cmp == -1) {\r\n\r\n // Compare divisor and new remainder.\r\n // If divisor < new remainder, subtract divisor from remainder.\r\n // Trial digit n too low.\r\n // n is 1 too low about 5% of the time, and very rarely 2 too low.\r\n while (compare(yc, rem, yL, remL) < 1) {\r\n n++;\r\n\r\n // Subtract divisor from remainder.\r\n subtract(rem, yL < remL ? yz : yc, remL, base);\r\n remL = rem.length;\r\n }\r\n }\r\n } else if (cmp === 0) {\r\n n++;\r\n rem = [0];\r\n } // else cmp === 1 and n will be 0\r\n\r\n // Add the next digit, n, to the result array.\r\n qc[i++] = n;\r\n\r\n // Update the remainder.\r\n if (rem[0]) {\r\n rem[remL++] = xc[xi] \|\| 0;\r\n } else {\r\n rem = [xc[xi]];\r\n remL = 1;\r\n }\r\n } while ((xi++ < xL \|\| rem[0] != null) && s--);\r\n\r\n more = rem[0] != null;\r\n\r\n // Leading zero?\r\n if (!qc[0]) qc.splice(0, 1);\r\n }\r\n\r\n if (base == BASE) {\r\n\r\n // To calculate q.e, first get the number of digits of qc[0].\r\n for (i = 1, s = qc[0]; s >= 10; s /= 10, i++);\r\n\r\n round(q, dp + (q.e = i + e * LOG_BASE - 1) + 1, rm, more);\r\n\r\n // Caller is convertBase.\r\n } else {\r\n q.e = e;\r\n q.r = +more;\r\n }\r\n\r\n return q;\r\n };\r\n })();\r\n\r\n\r\n /\r\n Return a string representing the value of BigNumber n in fixed-point or exponential\r\n * notation rounded to the specified decimal places or significant digits.\r\n \r\n n: a BigNumber.\r\n * i: the index of the last digit required (i.e. the digit that may be rounded up).\r\n * rm: the rounding mode.\r\n * id: 1 (toExponential) or 2 (toPrecision).\r\n /\r\n function format(n, i, rm, id) {\r\n var c0, e, ne, len, str;\r\n\r\n if (rm == null) rm = ROUNDING_MODE;\r\n else intCheck(rm, 0, 8);\r\n\r\n if (!n.c) return n.toString();\r\n\r\n c0 = n.c[0];\r\n ne = n.e;\r\n\r\n if (i == null) {\r\n str = coeffToString(n.c);\r\n str = id == 1 \|\| id == 2 && (ne <= TO_EXP_NEG \|\| ne >= TO_EXP_POS)\r\n ? toExponential(str, ne)\r\n : toFixedPoint(str, ne, '0');\r\n } else {\r\n n = round(new BigNumber(n), i, rm);\r\n\r\n // n.e may have changed if the value was rounded up.\r\n e = n.e;\r\n\r\n str = coeffToString(n.c);\r\n len = str.length;\r\n\r\n // toPrecision returns exponential notation if the number of significant digits\r\n // specified is less than the number of digits necessary to represent the integer\r\n // part of the value in fixed-point notation.\r\n\r\n // Exponential notation.\r\n if (id == 1 \|\| id == 2 && (i <= e \|\| e <= TO_EXP_NEG)) {\r\n\r\n // Append zeros?\r\n for (; len < i; str += '0', len++);\r\n str = toExponential(str, e);\r\n\r\n // Fixed-point notation.\r\n } else {\r\n i -= ne + (id === 2 && e > ne);\r\n str = toFixedPoint(str, e, '0');\r\n\r\n // Append zeros?\r\n if (e + 1 > len) {\r\n if (--i > 0) for (str += '.'; i--; str += '0');\r\n } else {\r\n i += e - len;\r\n if (i > 0) {\r\n if (e + 1 == len) str += '.';\r\n for (; i--; str += '0');\r\n }\r\n }\r\n }\r\n }\r\n\r\n return n.s < 0 && c0 ? '-' + str : str;\r\n }\r\n\r\n\r\n // Handle BigNumber.max and BigNumber.min.\r\n // If any number is NaN, return NaN.\r\n function maxOrMin(args, n) {\r\n var k, y,\r\n i = 1,\r\n x = new BigNumber(args[0]);\r\n\r\n for (; i < args.length; i++) {\r\n y = new BigNumber(args[i]);\r\n if (!y.s \|\| (k = compare(x, y)) === n \|\| k === 0 && x.s === n) {\r\n x = y;\r\n }\r\n }\r\n\r\n return x;\r\n }\r\n\r\n\r\n /\r\n * Strip trailing zeros, calculate base 10 exponent and check against MIN_EXP and MAX_EXP.\r\n * Called by minus, plus and times.\r\n /\r\n function normalise(n, c, e) {\r\n var i = 1,\r\n j = c.length;\r\n\r\n // Remove trailing zeros.\r\n for (; !c[--j]; c.pop());\r\n\r\n // Calculate the base 10 exponent. First get the number of digits of c[0].\r\n for (j = c[0]; j >= 10; j /= 10, i++);\r\n\r\n // Overflow?\r\n if ((e = i + e LOG_BASE - 1) > MAX_EXP) {\r\n\r\n // Infinity.\r\n n.c = n.e = null;\r\n\r\n // Underflow?\r\n } else if (e < MIN_EXP) {\r\n\r\n // Zero.\r\n n.c = [n.e = 0];\r\n } else {\r\n n.e = e;\r\n n.c = c;\r\n }\r\n\r\n return n;\r\n }\r\n\r\n\r\n // Handle values that fail the validity test in BigNumber.\r\n parseNumeric = (function () {\r\n var basePrefix = /^(-?)0([xbo])(?=\\w[\\w.]$)/i,\r\n dotAfter = /^([^.]+)\\.$/,\r\n dotBefore = /^\\.([^.]+)$/,\r\n isInfinityOrNaN = /^-?(Infinity\|NaN)$/,\r\n whitespaceOrPlus = /^\\s\\+(?=[\\w.])\|^\\s+\|\\s+$/g;\r\n\r\n return function (x, str, isNum, b) {\r\n var base,\r\n s = isNum ? str : str.replace(whitespaceOrPlus, '');\r\n\r\n // No exception on ±Infinity or NaN.\r\n if (isInfinityOrNaN.test(s)) {\r\n x.s = isNaN(s) ? null : s < 0 ? -1 : 1;\r\n } else {\r\n if (!isNum) {\r\n\r\n // basePrefix = /^(-?)0([xbo])(?=\\w[\\w.]$)/i\r\n s = s.replace(basePrefix, function (m, p1, p2) {\r\n base = (p2 = p2.toLowerCase()) == 'x' ? 16 : p2 == 'b' ? 2 : 8;\r\n return !b \|\| b == base ? p1 : m;\r\n });\r\n\r\n if (b) {\r\n base = b;\r\n\r\n // E.g. '1.' to '1', '.1' to '0.1'\r\n s = s.replace(dotAfter, '$1').replace(dotBefore, '0.$1');\r\n }\r\n\r\n if (str != s) return new BigNumber(s, base);\r\n }\r\n\r\n // '[BigNumber Error] Not a number: {n}'\r\n // '[BigNumber Error] Not a base {b} number: {n}'\r\n if (BigNumber.DEBUG) {\r\n throw Error\r\n (bignumberError + 'Not a' + (b ? ' base ' + b : '') + ' number: ' + str);\r\n }\r\n\r\n // NaN\r\n x.s = null;\r\n }\r\n\r\n x.c = x.e = null;\r\n }\r\n })();\r\n\r\n\r\n /\r\n * Round x to sd significant digits using rounding mode rm. Check for over/under-flow.\r\n * If r is truthy, it is known that there are more digits after the rounding digit.\r\n /\r\n function round(x, sd, rm, r) {\r\n var d, i, j, k, n, ni, rd,\r\n xc = x.c,\r\n pows10 = POWS_TEN;\r\n\r\n // if x is not Infinity or NaN...\r\n if (xc) {\r\n\r\n // rd is the rounding digit, i.e. the digit after the digit that may be rounded up.\r\n // n is a base 1e14 number, the value of the element of array x.c containing rd.\r\n // ni is the index of n within x.c.\r\n // d is the number of digits of n.\r\n // i is the index of rd within n including leading zeros.\r\n // j is the actual index of rd within n (if < 0, rd is a leading zero).\r\n out: {\r\n\r\n // Get the number of digits of the first element of xc.\r\n for (d = 1, k = xc[0]; k >= 10; k /= 10, d++);\r\n i = sd - d;\r\n\r\n // If the rounding digit is in the first element of xc...\r\n if (i < 0) {\r\n i += LOG_BASE;\r\n j = sd;\r\n n = xc[ni = 0];\r\n\r\n // Get the rounding digit at index j of n.\r\n rd = mathfloor(n / pows10[d - j - 1] % 10);\r\n } else {\r\n ni = mathceil((i + 1) / LOG_BASE);\r\n\r\n if (ni >= xc.length) {\r\n\r\n if (r) {\r\n\r\n // Needed by sqrt.\r\n for (; xc.length <= ni; xc.push(0));\r\n n = rd = 0;\r\n d = 1;\r\n i %= LOG_BASE;\r\n j = i - LOG_BASE + 1;\r\n } else {\r\n break out;\r\n }\r\n } else {\r\n n = k = xc[ni];\r\n\r\n // Get the number of digits of n.\r\n for (d = 1; k >= 10; k /= 10, d++);\r\n\r\n // Get the index of rd within n.\r\n i %= LOG_BASE;\r\n\r\n // Get the index of rd within n, adjusted for leading zeros.\r\n // The number of leading zeros of n is given by LOG_BASE - d.\r\n j = i - LOG_BASE + d;\r\n\r\n // Get the rounding digit at index j of n.\r\n rd = j < 0 ? 0 : mathfloor(n / pows10[d - j - 1] % 10);\r\n }\r\n }\r\n\r\n r = r \|\| sd < 0 \|\|\r\n\r\n // Are there any non-zero digits after the rounding digit?\r\n // The expression n % pows10[d - j - 1] returns all digits of n to the right\r\n // of the digit at j, e.g. if n is 908714 and j is 2, the expression gives 714.\r\n xc[ni + 1] != null \|\| (j < 0 ? n : n % pows10[d - j - 1]);\r\n\r\n r = rm < 4\r\n ? (rd \|\| r) && (rm == 0 \|\| rm == (x.s < 0 ? 3 : 2))\r\n : rd > 5 \|\| rd == 5 && (rm == 4 \|\| r \|\| rm == 6 &&\r\n\r\n // Check whether the digit to the left of the rounding digit is odd.\r\n ((i > 0 ? j > 0 ? n / pows10[d - j] : 0 : xc[ni - 1]) % 10) & 1 \|\|\r\n rm == (x.s < 0 ? 8 : 7));\r\n\r\n if (sd < 1 \|\| !xc[0]) {\r\n xc.length = 0;\r\n\r\n if (r) {\r\n\r\n // Convert sd to decimal places.\r\n sd -= x.e + 1;\r\n\r\n // 1, 0.1, 0.01, 0.001, 0.0001 etc.\r\n xc[0] = pows10[(LOG_BASE - sd % LOG_BASE) % LOG_BASE];\r\n x.e = -sd \|\| 0;\r\n } else {\r\n\r\n // Zero.\r\n xc[0] = x.e = 0;\r\n }\r\n\r\n return x;\r\n }\r\n\r\n // Remove excess digits.\r\n if (i == 0) {\r\n xc.length = ni;\r\n k = 1;\r\n ni--;\r\n } else {\r\n xc.length = ni + 1;\r\n k = pows10[LOG_BASE - i];\r\n\r\n // E.g. 56700 becomes 56000 if 7 is the rounding digit.\r\n // j > 0 means i > number of leading zeros of n.\r\n xc[ni] = j > 0 ? mathfloor(n / pows10[d - j] % pows10[j]) k : 0;\r\n }\r\n\r\n // Round up?\r\n if (r) {\r\n\r\n for (; ;) {\r\n\r\n // If the digit to be rounded up is in the first element of xc...\r\n if (ni == 0) {\r\n\r\n // i will be the length of xc[0] before k is added.\r\n for (i = 1, j = xc[0]; j >= 10; j /= 10, i++);\r\n j = xc[0] += k;\r\n for (k = 1; j >= 10; j /= 10, k++);\r\n\r\n // if i != k the length has increased.\r\n if (i != k) {\r\n x.e++;\r\n if (xc[0] == BASE) xc[0] = 1;\r\n }\r\n\r\n break;\r\n } else {\r\n xc[ni] += k;\r\n if (xc[ni] != BASE) break;\r\n xc[ni--] = 0;\r\n k = 1;\r\n }\r\n }\r\n }\r\n\r\n // Remove trailing zeros.\r\n for (i = xc.length; xc[--i] === 0; xc.pop());\r\n }\r\n\r\n // Overflow? Infinity.\r\n if (x.e > MAX_EXP) {\r\n x.c = x.e = null;\r\n\r\n // Underflow? Zero.\r\n } else if (x.e < MIN_EXP) {\r\n x.c = [x.e = 0];\r\n }\r\n }\r\n\r\n return x;\r\n }\r\n\r\n\r\n function valueOf(n) {\r\n var str,\r\n e = n.e;\r\n\r\n if (e === null) return n.toString();\r\n\r\n str = coeffToString(n.c);\r\n\r\n str = e <= TO_EXP_NEG \|\| e >= TO_EXP_POS\r\n ? toExponential(str, e)\r\n : toFixedPoint(str, e, '0');\r\n\r\n return n.s < 0 ? '-' + str : str;\r\n }\r\n\r\n\r\n // PROTOTYPE/INSTANCE METHODS\r\n\r\n\r\n /\r\n Return a new BigNumber whose value is the absolute value of this BigNumber.\r\n /\r\n P.absoluteValue = P.abs = function () {\r\n var x = new BigNumber(this);\r\n if (x.s < 0) x.s = 1;\r\n return x;\r\n };\r\n\r\n\r\n /\r\n * Return\r\n * 1 if the value of this BigNumber is greater than the value of BigNumber(y, b),\r\n * -1 if the value of this BigNumber is less than the value of BigNumber(y, b),\r\n * 0 if they have the same value,\r\n * or null if the value of either is NaN.\r\n /\r\n P.comparedTo = function (y, b) {\r\n return compare(this, new BigNumber(y, b));\r\n };\r\n\r\n\r\n /\r\n * If dp is undefined or null or true or false, return the number of decimal places of the\r\n * value of this BigNumber, or null if the value of this BigNumber is ±Infinity or NaN.\r\n \r\n Otherwise, if dp is a number, return a new BigNumber whose value is the value of this\r\n * BigNumber rounded to a maximum of dp decimal places using rounding mode rm, or\r\n * ROUNDING_MODE if rm is omitted.\r\n \r\n [dp] {number} Decimal places: integer, 0 to MAX inclusive.\r\n * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n \r\n '[BigNumber Error] Argument {not a primitive number\|not an integer\|out of range}: {dp\|rm}'\r\n /\r\n P.decimalPlaces = P.dp = function (dp, rm) {\r\n var c, n, v,\r\n x = this;\r\n\r\n if (dp != null) {\r\n intCheck(dp, 0, MAX);\r\n if (rm == null) rm = ROUNDING_MODE;\r\n else intCheck(rm, 0, 8);\r\n\r\n return round(new BigNumber(x), dp + x.e + 1, rm);\r\n }\r\n\r\n if (!(c = x.c)) return null;\r\n n = ((v = c.length - 1) - bitFloor(this.e / LOG_BASE)) LOG_BASE;\r\n\r\n // Subtract the number of trailing zeros of the last number.\r\n if (v = c[v]) for (; v % 10 == 0; v /= 10, n--);\r\n if (n < 0) n = 0;\r\n\r\n return n;\r\n };\r\n\r\n\r\n /\r\n n / 0 = I\r\n * n / N = N\r\n * n / I = 0\r\n * 0 / n = 0\r\n * 0 / 0 = N\r\n * 0 / N = N\r\n * 0 / I = 0\r\n * N / n = N\r\n * N / 0 = N\r\n * N / N = N\r\n * N / I = N\r\n * I / n = I\r\n * I / 0 = I\r\n * I / N = N\r\n * I / I = N\r\n \r\n Return a new BigNumber whose value is the value of this BigNumber divided by the value of\r\n * BigNumber(y, b), rounded according to DECIMAL_PLACES and ROUNDING_MODE.\r\n /\r\n P.dividedBy = P.div = function (y, b) {\r\n return div(this, new BigNumber(y, b), DECIMAL_PLACES, ROUNDING_MODE);\r\n };\r\n\r\n\r\n /\r\n * Return a new BigNumber whose value is the integer part of dividing the value of this\r\n * BigNumber by the value of BigNumber(y, b).\r\n /\r\n P.dividedToIntegerBy = P.idiv = function (y, b) {\r\n return div(this, new BigNumber(y, b), 0, 1);\r\n };\r\n\r\n\r\n /\r\n * Return a BigNumber whose value is the value of this BigNumber exponentiated by n.\r\n \r\n If m is present, return the result modulo m.\r\n * If n is negative round according to DECIMAL_PLACES and ROUNDING_MODE.\r\n * If POW_PRECISION is non-zero and m is not present, round to POW_PRECISION using ROUNDING_MODE.\r\n \r\n The modular power operation works efficiently when x, n, and m are integers, otherwise it\r\n * is equivalent to calculating x.exponentiatedBy(n).modulo(m) with a POW_PRECISION of 0.\r\n \r\n n {number\|string\|BigNumber} The exponent. An integer.\r\n * [m] {number\|string\|BigNumber} The modulus.\r\n \r\n '[BigNumber Error] Exponent not an integer: {n}'\r\n /\r\n P.exponentiatedBy = P.pow = function (n, m) {\r\n var half, isModExp, i, k, more, nIsBig, nIsNeg, nIsOdd, y,\r\n x = this;\r\n\r\n n = new BigNumber(n);\r\n\r\n // Allow NaN and ±Infinity, but not other non-integers.\r\n if (n.c && !n.isInteger()) {\r\n throw Error\r\n (bignumberError + 'Exponent not an integer: ' + valueOf(n));\r\n }\r\n\r\n if (m != null) m = new BigNumber(m);\r\n\r\n // Exponent of MAX_SAFE_INTEGER is 15.\r\n nIsBig = n.e > 14;\r\n\r\n // If x is NaN, ±Infinity, ±0 or ±1, or n is ±Infinity, NaN or ±0.\r\n if (!x.c \|\| !x.c[0] \|\| x.c[0] == 1 && !x.e && x.c.length == 1 \|\| !n.c \|\| !n.c[0]) {\r\n\r\n // The sign of the result of pow when x is negative depends on the evenness of n.\r\n // If +n overflows to ±Infinity, the evenness of n would be not be known.\r\n y = new BigNumber(Math.pow(+valueOf(x), nIsBig ? n.s (2 - isOdd(n)) : +valueOf(n)));\r\n return m ? y.mod(m) : y;\r\n }\r\n\r\n nIsNeg = n.s < 0;\r\n\r\n if (m) {\r\n\r\n // x % m returns NaN if abs(m) is zero, or m is NaN.\r\n if (m.c ? !m.c[0] : !m.s) return new BigNumber(NaN);\r\n\r\n isModExp = !nIsNeg && x.isInteger() && m.isInteger();\r\n\r\n if (isModExp) x = x.mod(m);\r\n\r\n // Overflow to ±Infinity: >=21e10 or >=1.00000241e15.\r\n // Underflow to ±0: <=0.791e10 or <=0.99999751e15.\r\n } else if (n.e > 9 && (x.e > 0 \|\| x.e < -1 \|\| (x.e == 0\r\n // [1, 240000000]\r\n ? x.c[0] > 1 \|\| nIsBig && x.c[1] >= 24e7\r\n // [80000000000000] [99999750000000]\r\n : x.c[0] < 8e13 \|\| nIsBig && x.c[0] <= 9999975e7))) {\r\n\r\n // If x is negative and n is odd, k = -0, else k = 0.\r\n k = x.s < 0 && isOdd(n) ? -0 : 0;\r\n\r\n // If x >= 1, k = ±Infinity.\r\n if (x.e > -1) k = 1 / k;\r\n\r\n // If n is negative return ±0, else return ±Infinity.\r\n return new BigNumber(nIsNeg ? 1 / k : k);\r\n\r\n } else if (POW_PRECISION) {\r\n\r\n // Truncating each coefficient array to a length of k after each multiplication\r\n // equates to truncating significant digits to POW_PRECISION + [28, 41],\r\n // i.e. there will be a minimum of 28 guard digits retained.\r\n k = mathceil(POW_PRECISION / LOG_BASE + 2);\r\n }\r\n\r\n if (nIsBig) {\r\n half = new BigNumber(0.5);\r\n if (nIsNeg) n.s = 1;\r\n nIsOdd = isOdd(n);\r\n } else {\r\n i = Math.abs(+valueOf(n));\r\n nIsOdd = i % 2;\r\n }\r\n\r\n y = new BigNumber(ONE);\r\n\r\n // Performs 54 loop iterations for n of 9007199254740991.\r\n for (; ;) {\r\n\r\n if (nIsOdd) {\r\n y = y.times(x);\r\n if (!y.c) break;\r\n\r\n if (k) {\r\n if (y.c.length > k) y.c.length = k;\r\n } else if (isModExp) {\r\n y = y.mod(m); //y = y.minus(div(y, m, 0, MODULO_MODE).times(m));\r\n }\r\n }\r\n\r\n if (i) {\r\n i = mathfloor(i / 2);\r\n if (i === 0) break;\r\n nIsOdd = i % 2;\r\n } else {\r\n n = n.times(half);\r\n round(n, n.e + 1, 1);\r\n\r\n if (n.e > 14) {\r\n nIsOdd = isOdd(n);\r\n } else {\r\n i = +valueOf(n);\r\n if (i === 0) break;\r\n nIsOdd = i % 2;\r\n }\r\n }\r\n\r\n x = x.times(x);\r\n\r\n if (k) {\r\n if (x.c && x.c.length > k) x.c.length = k;\r\n } else if (isModExp) {\r\n x = x.mod(m); //x = x.minus(div(x, m, 0, MODULO_MODE).times(m));\r\n }\r\n }\r\n\r\n if (isModExp) return y;\r\n if (nIsNeg) y = ONE.div(y);\r\n\r\n return m ? y.mod(m) : k ? round(y, POW_PRECISION, ROUNDING_MODE, more) : y;\r\n };\r\n\r\n\r\n /\r\n Return a new BigNumber whose value is the value of this BigNumber rounded to an integer\r\n * using rounding mode rm, or ROUNDING_MODE if rm is omitted.\r\n \r\n [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n \r\n '[BigNumber Error] Argument {not a primitive number\|not an integer\|out of range}: {rm}'\r\n /\r\n P.integerValue = function (rm) {\r\n var n = new BigNumber(this);\r\n if (rm == null) rm = ROUNDING_MODE;\r\n else intCheck(rm, 0, 8);\r\n return round(n, n.e + 1, rm);\r\n };\r\n\r\n\r\n /\r\n * Return true if the value of this BigNumber is equal to the value of BigNumber(y, b),\r\n * otherwise return false.\r\n /\r\n P.isEqualTo = P.eq = function (y, b) {\r\n return compare(this, new BigNumber(y, b)) === 0;\r\n };\r\n\r\n\r\n /\r\n * Return true if the value of this BigNumber is a finite number, otherwise return false.\r\n /\r\n P.isFinite = function () {\r\n return !!this.c;\r\n };\r\n\r\n\r\n /\r\n * Return true if the value of this BigNumber is greater than the value of BigNumber(y, b),\r\n * otherwise return false.\r\n /\r\n P.isGreaterThan = P.gt = function (y, b) {\r\n return compare(this, new BigNumber(y, b)) > 0;\r\n };\r\n\r\n\r\n /\r\n * Return true if the value of this BigNumber is greater than or equal to the value of\r\n * BigNumber(y, b), otherwise return false.\r\n /\r\n P.isGreaterThanOrEqualTo = P.gte = function (y, b) {\r\n return (b = compare(this, new BigNumber(y, b))) === 1 \|\| b === 0;\r\n\r\n };\r\n\r\n\r\n /\r\n * Return true if the value of this BigNumber is an integer, otherwise return false.\r\n /\r\n P.isInteger = function () {\r\n return !!this.c && bitFloor(this.e / LOG_BASE) > this.c.length - 2;\r\n };\r\n\r\n\r\n /\r\n * Return true if the value of this BigNumber is less than the value of BigNumber(y, b),\r\n * otherwise return false.\r\n /\r\n P.isLessThan = P.lt = function (y, b) {\r\n return compare(this, new BigNumber(y, b)) < 0;\r\n };\r\n\r\n\r\n /\r\n * Return true if the value of this BigNumber is less than or equal to the value of\r\n * BigNumber(y, b), otherwise return false.\r\n /\r\n P.isLessThanOrEqualTo = P.lte = function (y, b) {\r\n return (b = compare(this, new BigNumber(y, b))) === -1 \|\| b === 0;\r\n };\r\n\r\n\r\n /\r\n * Return true if the value of this BigNumber is NaN, otherwise return false.\r\n /\r\n P.isNaN = function () {\r\n return !this.s;\r\n };\r\n\r\n\r\n /\r\n * Return true if the value of this BigNumber is negative, otherwise return false.\r\n /\r\n P.isNegative = function () {\r\n return this.s < 0;\r\n };\r\n\r\n\r\n /\r\n * Return true if the value of this BigNumber is positive, otherwise return false.\r\n /\r\n P.isPositive = function () {\r\n return this.s > 0;\r\n };\r\n\r\n\r\n /\r\n * Return true if the value of this BigNumber is 0 or -0, otherwise return false.\r\n /\r\n P.isZero = function () {\r\n return !!this.c && this.c[0] == 0;\r\n };\r\n\r\n\r\n /\r\n * n - 0 = n\r\n * n - N = N\r\n * n - I = -I\r\n * 0 - n = -n\r\n * 0 - 0 = 0\r\n * 0 - N = N\r\n * 0 - I = -I\r\n * N - n = N\r\n * N - 0 = N\r\n * N - N = N\r\n * N - I = N\r\n * I - n = I\r\n * I - 0 = I\r\n * I - N = N\r\n * I - I = N\r\n \r\n Return a new BigNumber whose value is the value of this BigNumber minus the value of\r\n * BigNumber(y, b).\r\n /\r\n P.minus = function (y, b) {\r\n var i, j, t, xLTy,\r\n x = this,\r\n a = x.s;\r\n\r\n y = new BigNumber(y, b);\r\n b = y.s;\r\n\r\n // Either NaN?\r\n if (!a \|\| !b) return new BigNumber(NaN);\r\n\r\n // Signs differ?\r\n if (a != b) {\r\n y.s = -b;\r\n return x.plus(y);\r\n }\r\n\r\n var xe = x.e / LOG_BASE,\r\n ye = y.e / LOG_BASE,\r\n xc = x.c,\r\n yc = y.c;\r\n\r\n if (!xe \|\| !ye) {\r\n\r\n // Either Infinity?\r\n if (!xc \|\| !yc) return xc ? (y.s = -b, y) : new BigNumber(yc ? x : NaN);\r\n\r\n // Either zero?\r\n if (!xc[0] \|\| !yc[0]) {\r\n\r\n // Return y if y is non-zero, x if x is non-zero, or zero if both are zero.\r\n return yc[0] ? (y.s = -b, y) : new BigNumber(xc[0] ? x :\r\n\r\n // IEEE 754 (2008) 6.3: n - n = -0 when rounding to -Infinity\r\n ROUNDING_MODE == 3 ? -0 : 0);\r\n }\r\n }\r\n\r\n xe = bitFloor(xe);\r\n ye = bitFloor(ye);\r\n xc = xc.slice();\r\n\r\n // Determine which is the bigger number.\r\n if (a = xe - ye) {\r\n\r\n if (xLTy = a < 0) {\r\n a = -a;\r\n t = xc;\r\n } else {\r\n ye = xe;\r\n t = yc;\r\n }\r\n\r\n t.reverse();\r\n\r\n // Prepend zeros to equalise exponents.\r\n for (b = a; b--; t.push(0));\r\n t.reverse();\r\n } else {\r\n\r\n // Exponents equal. Check digit by digit.\r\n j = (xLTy = (a = xc.length) < (b = yc.length)) ? a : b;\r\n\r\n for (a = b = 0; b < j; b++) {\r\n\r\n if (xc[b] != yc[b]) {\r\n xLTy = xc[b] < yc[b];\r\n break;\r\n }\r\n }\r\n }\r\n\r\n // x < y? Point xc to the array of the bigger number.\r\n if (xLTy) {\r\n t = xc;\r\n xc = yc;\r\n yc = t;\r\n y.s = -y.s;\r\n }\r\n\r\n b = (j = yc.length) - (i = xc.length);\r\n\r\n // Append zeros to xc if shorter.\r\n // No need to add zeros to yc if shorter as subtract only needs to start at yc.length.\r\n if (b > 0) for (; b--; xc[i++] = 0);\r\n b = BASE - 1;\r\n\r\n // Subtract yc from xc.\r\n for (; j > a;) {\r\n\r\n if (xc[--j] < yc[j]) {\r\n for (i = j; i && !xc[--i]; xc[i] = b);\r\n --xc[i];\r\n xc[j] += BASE;\r\n }\r\n\r\n xc[j] -= yc[j];\r\n }\r\n\r\n // Remove leading zeros and adjust exponent accordingly.\r\n for (; xc[0] == 0; xc.splice(0, 1), --ye);\r\n\r\n // Zero?\r\n if (!xc[0]) {\r\n\r\n // Following IEEE 754 (2008) 6.3,\r\n // n - n = +0 but n - n = -0 when rounding towards -Infinity.\r\n y.s = ROUNDING_MODE == 3 ? -1 : 1;\r\n y.c = [y.e = 0];\r\n return y;\r\n }\r\n\r\n // No need to check for Infinity as +x - +y != Infinity && -x - -y != Infinity\r\n // for finite x and y.\r\n return normalise(y, xc, ye);\r\n };\r\n\r\n\r\n /\r\n * n % 0 = N\r\n * n % N = N\r\n * n % I = n\r\n * 0 % n = 0\r\n * -0 % n = -0\r\n * 0 % 0 = N\r\n * 0 % N = N\r\n * 0 % I = 0\r\n * N % n = N\r\n * N % 0 = N\r\n * N % N = N\r\n * N % I = N\r\n * I % n = N\r\n * I % 0 = N\r\n * I % N = N\r\n * I % I = N\r\n \r\n Return a new BigNumber whose value is the value of this BigNumber modulo the value of\r\n * BigNumber(y, b). The result depends on the value of MODULO_MODE.\r\n /\r\n P.modulo = P.mod = function (y, b) {\r\n var q, s,\r\n x = this;\r\n\r\n y = new BigNumber(y, b);\r\n\r\n // Return NaN if x is Infinity or NaN, or y is NaN or zero.\r\n if (!x.c \|\| !y.s \|\| y.c && !y.c[0]) {\r\n return new BigNumber(NaN);\r\n\r\n // Return x if y is Infinity or x is zero.\r\n } else if (!y.c \|\| x.c && !x.c[0]) {\r\n return new BigNumber(x);\r\n }\r\n\r\n if (MODULO_MODE == 9) {\r\n\r\n // Euclidian division: q = sign(y) floor(x / abs(y))\r\n // r = x - qy where 0 <= r < abs(y)\r\n s = y.s;\r\n y.s = 1;\r\n q = div(x, y, 0, 3);\r\n y.s = s;\r\n q.s = s;\r\n } else {\r\n q = div(x, y, 0, MODULO_MODE);\r\n }\r\n\r\n y = x.minus(q.times(y));\r\n\r\n // To match JavaScript %, ensure sign of zero is sign of dividend.\r\n if (!y.c[0] && MODULO_MODE == 1) y.s = x.s;\r\n\r\n return y;\r\n };\r\n\r\n\r\n /\r\n * n * 0 = 0\r\n * n * N = N\r\n * n * I = I\r\n * 0 * n = 0\r\n * 0 * 0 = 0\r\n * 0 * N = N\r\n * 0 * I = N\r\n * N * n = N\r\n * N * 0 = N\r\n * N * N = N\r\n * N * I = N\r\n * I * n = I\r\n * I * 0 = N\r\n * I * N = N\r\n * I * I = I\r\n \r\n Return a new BigNumber whose value is the value of this BigNumber multiplied by the value\r\n * of BigNumber(y, b).\r\n /\r\n P.multipliedBy = P.times = function (y, b) {\r\n var c, e, i, j, k, m, xcL, xlo, xhi, ycL, ylo, yhi, zc,\r\n base, sqrtBase,\r\n x = this,\r\n xc = x.c,\r\n yc = (y = new BigNumber(y, b)).c;\r\n\r\n // Either NaN, ±Infinity or ±0?\r\n if (!xc \|\| !yc \|\| !xc[0] \|\| !yc[0]) {\r\n\r\n // Return NaN if either is NaN, or one is 0 and the other is Infinity.\r\n if (!x.s \|\| !y.s \|\| xc && !xc[0] && !yc \|\| yc && !yc[0] && !xc) {\r\n y.c = y.e = y.s = null;\r\n } else {\r\n y.s = x.s;\r\n\r\n // Return ±Infinity if either is ±Infinity.\r\n if (!xc \|\| !yc) {\r\n y.c = y.e = null;\r\n\r\n // Return ±0 if either is ±0.\r\n } else {\r\n y.c = [0];\r\n y.e = 0;\r\n }\r\n }\r\n\r\n return y;\r\n }\r\n\r\n e = bitFloor(x.e / LOG_BASE) + bitFloor(y.e / LOG_BASE);\r\n y.s = x.s;\r\n xcL = xc.length;\r\n ycL = yc.length;\r\n\r\n // Ensure xc points to longer array and xcL to its length.\r\n if (xcL < ycL) {\r\n zc = xc;\r\n xc = yc;\r\n yc = zc;\r\n i = xcL;\r\n xcL = ycL;\r\n ycL = i;\r\n }\r\n\r\n // Initialise the result array with zeros.\r\n for (i = xcL + ycL, zc = []; i--; zc.push(0));\r\n\r\n base = BASE;\r\n sqrtBase = SQRT_BASE;\r\n\r\n for (i = ycL; --i >= 0;) {\r\n c = 0;\r\n ylo = yc[i] % sqrtBase;\r\n yhi = yc[i] / sqrtBase \| 0;\r\n\r\n for (k = xcL, j = i + k; j > i;) {\r\n xlo = xc[--k] % sqrtBase;\r\n xhi = xc[k] / sqrtBase \| 0;\r\n m = yhi xlo + xhi * ylo;\r\n xlo = ylo * xlo + ((m % sqrtBase) * sqrtBase) + zc[j] + c;\r\n c = (xlo / base \| 0) + (m / sqrtBase \| 0) + yhi * xhi;\r\n zc[j--] = xlo % base;\r\n }\r\n\r\n zc[j] = c;\r\n }\r\n\r\n if (c) {\r\n ++e;\r\n } else {\r\n zc.splice(0, 1);\r\n }\r\n\r\n return normalise(y, zc, e);\r\n };\r\n\r\n\r\n /\r\n Return a new BigNumber whose value is the value of this BigNumber negated,\r\n * i.e. multiplied by -1.\r\n /\r\n P.negated = function () {\r\n var x = new BigNumber(this);\r\n x.s = -x.s \|\| null;\r\n return x;\r\n };\r\n\r\n\r\n /\r\n * n + 0 = n\r\n * n + N = N\r\n * n + I = I\r\n * 0 + n = n\r\n * 0 + 0 = 0\r\n * 0 + N = N\r\n * 0 + I = I\r\n * N + n = N\r\n * N + 0 = N\r\n * N + N = N\r\n * N + I = N\r\n * I + n = I\r\n * I + 0 = I\r\n * I + N = N\r\n * I + I = I\r\n \r\n Return a new BigNumber whose value is the value of this BigNumber plus the value of\r\n * BigNumber(y, b).\r\n /\r\n P.plus = function (y, b) {\r\n var t,\r\n x = this,\r\n a = x.s;\r\n\r\n y = new BigNumber(y, b);\r\n b = y.s;\r\n\r\n // Either NaN?\r\n if (!a \|\| !b) return new BigNumber(NaN);\r\n\r\n // Signs differ?\r\n if (a != b) {\r\n y.s = -b;\r\n return x.minus(y);\r\n }\r\n\r\n var xe = x.e / LOG_BASE,\r\n ye = y.e / LOG_BASE,\r\n xc = x.c,\r\n yc = y.c;\r\n\r\n if (!xe \|\| !ye) {\r\n\r\n // Return ±Infinity if either ±Infinity.\r\n if (!xc \|\| !yc) return new BigNumber(a / 0);\r\n\r\n // Either zero?\r\n // Return y if y is non-zero, x if x is non-zero, or zero if both are zero.\r\n if (!xc[0] \|\| !yc[0]) return yc[0] ? y : new BigNumber(xc[0] ? x : a 0);\r\n }\r\n\r\n xe = bitFloor(xe);\r\n ye = bitFloor(ye);\r\n xc = xc.slice();\r\n\r\n // Prepend zeros to equalise exponents. Faster to use reverse then do unshifts.\r\n if (a = xe - ye) {\r\n if (a > 0) {\r\n ye = xe;\r\n t = yc;\r\n } else {\r\n a = -a;\r\n t = xc;\r\n }\r\n\r\n t.reverse();\r\n for (; a--; t.push(0));\r\n t.reverse();\r\n }\r\n\r\n a = xc.length;\r\n b = yc.length;\r\n\r\n // Point xc to the longer array, and b to the shorter length.\r\n if (a - b < 0) {\r\n t = yc;\r\n yc = xc;\r\n xc = t;\r\n b = a;\r\n }\r\n\r\n // Only start adding at yc.length - 1 as the further digits of xc can be ignored.\r\n for (a = 0; b;) {\r\n a = (xc[--b] = xc[b] + yc[b] + a) / BASE \| 0;\r\n xc[b] = BASE === xc[b] ? 0 : xc[b] % BASE;\r\n }\r\n\r\n if (a) {\r\n xc = [a].concat(xc);\r\n ++ye;\r\n }\r\n\r\n // No need to check for zero, as +x + +y != 0 && -x + -y != 0\r\n // ye = MAX_EXP + 1 possible\r\n return normalise(y, xc, ye);\r\n };\r\n\r\n\r\n /\r\n If sd is undefined or null or true or false, return the number of significant digits of\r\n * the value of this BigNumber, or null if the value of this BigNumber is ±Infinity or NaN.\r\n * If sd is true include integer-part trailing zeros in the count.\r\n \r\n Otherwise, if sd is a number, return a new BigNumber whose value is the value of this\r\n * BigNumber rounded to a maximum of sd significant digits using rounding mode rm, or\r\n * ROUNDING_MODE if rm is omitted.\r\n \r\n sd {number\|boolean} number: significant digits: integer, 1 to MAX inclusive.\r\n * boolean: whether to count integer-part trailing zeros: true or false.\r\n * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n \r\n '[BigNumber Error] Argument {not a primitive number\|not an integer\|out of range}: {sd\|rm}'\r\n /\r\n P.precision = P.sd = function (sd, rm) {\r\n var c, n, v,\r\n x = this;\r\n\r\n if (sd != null && sd !== !!sd) {\r\n intCheck(sd, 1, MAX);\r\n if (rm == null) rm = ROUNDING_MODE;\r\n else intCheck(rm, 0, 8);\r\n\r\n return round(new BigNumber(x), sd, rm);\r\n }\r\n\r\n if (!(c = x.c)) return null;\r\n v = c.length - 1;\r\n n = v LOG_BASE + 1;\r\n\r\n if (v = c[v]) {\r\n\r\n // Subtract the number of trailing zeros of the last element.\r\n for (; v % 10 == 0; v /= 10, n--);\r\n\r\n // Add the number of digits of the first element.\r\n for (v = c[0]; v >= 10; v /= 10, n++);\r\n }\r\n\r\n if (sd && x.e + 1 > n) n = x.e + 1;\r\n\r\n return n;\r\n };\r\n\r\n\r\n /\r\n Return a new BigNumber whose value is the value of this BigNumber shifted by k places\r\n * (powers of 10). Shift to the right if n > 0, and to the left if n < 0.\r\n \r\n k {number} Integer, -MAX_SAFE_INTEGER to MAX_SAFE_INTEGER inclusive.\r\n \r\n '[BigNumber Error] Argument {not a primitive number\|not an integer\|out of range}: {k}'\r\n /\r\n P.shiftedBy = function (k) {\r\n intCheck(k, -MAX_SAFE_INTEGER, MAX_SAFE_INTEGER);\r\n return this.times('1e' + k);\r\n };\r\n\r\n\r\n /\r\n * sqrt(-n) = N\r\n * sqrt(N) = N\r\n * sqrt(-I) = N\r\n * sqrt(I) = I\r\n * sqrt(0) = 0\r\n * sqrt(-0) = -0\r\n \r\n Return a new BigNumber whose value is the square root of the value of this BigNumber,\r\n * rounded according to DECIMAL_PLACES and ROUNDING_MODE.\r\n /\r\n P.squareRoot = P.sqrt = function () {\r\n var m, n, r, rep, t,\r\n x = this,\r\n c = x.c,\r\n s = x.s,\r\n e = x.e,\r\n dp = DECIMAL_PLACES + 4,\r\n half = new BigNumber('0.5');\r\n\r\n // Negative/NaN/Infinity/zero?\r\n if (s !== 1 \|\| !c \|\| !c[0]) {\r\n return new BigNumber(!s \|\| s < 0 && (!c \|\| c[0]) ? NaN : c ? x : 1 / 0);\r\n }\r\n\r\n // Initial estimate.\r\n s = Math.sqrt(+valueOf(x));\r\n\r\n // Math.sqrt underflow/overflow?\r\n // Pass x to Math.sqrt as integer, then adjust the exponent of the result.\r\n if (s == 0 \|\| s == 1 / 0) {\r\n n = coeffToString(c);\r\n if ((n.length + e) % 2 == 0) n += '0';\r\n s = Math.sqrt(+n);\r\n e = bitFloor((e + 1) / 2) - (e < 0 \|\| e % 2);\r\n\r\n if (s == 1 / 0) {\r\n n = '5e' + e;\r\n } else {\r\n n = s.toExponential();\r\n n = n.slice(0, n.indexOf('e') + 1) + e;\r\n }\r\n\r\n r = new BigNumber(n);\r\n } else {\r\n r = new BigNumber(s + '');\r\n }\r\n\r\n // Check for zero.\r\n // r could be zero if MIN_EXP is changed after the this value was created.\r\n // This would cause a division by zero (x/t) and hence Infinity below, which would cause\r\n // coeffToString to throw.\r\n if (r.c[0]) {\r\n e = r.e;\r\n s = e + dp;\r\n if (s < 3) s = 0;\r\n\r\n // Newton-Raphson iteration.\r\n for (; ;) {\r\n t = r;\r\n r = half.times(t.plus(div(x, t, dp, 1)));\r\n\r\n if (coeffToString(t.c).slice(0, s) === (n = coeffToString(r.c)).slice(0, s)) {\r\n\r\n // The exponent of r may here be one less than the final result exponent,\r\n // e.g 0.0009999 (e-4) --> 0.001 (e-3), so adjust s so the rounding digits\r\n // are indexed correctly.\r\n if (r.e < e) --s;\r\n n = n.slice(s - 3, s + 1);\r\n\r\n // The 4th rounding digit may be in error by -1 so if the 4 rounding digits\r\n // are 9999 or 4999 (i.e. approaching a rounding boundary) continue the\r\n // iteration.\r\n if (n == '9999' \|\| !rep && n == '4999') {\r\n\r\n // On the first iteration only, check to see if rounding up gives the\r\n // exact result as the nines may infinitely repeat.\r\n if (!rep) {\r\n round(t, t.e + DECIMAL_PLACES + 2, 0);\r\n\r\n if (t.times(t).eq(x)) {\r\n r = t;\r\n break;\r\n }\r\n }\r\n\r\n dp += 4;\r\n s += 4;\r\n rep = 1;\r\n } else {\r\n\r\n // If rounding digits are null, 0{0,4} or 50{0,3}, check for exact\r\n // result. If not, then there are further digits and m will be truthy.\r\n if (!+n \|\| !+n.slice(1) && n.charAt(0) == '5') {\r\n\r\n // Truncate to the first rounding digit.\r\n round(r, r.e + DECIMAL_PLACES + 2, 1);\r\n m = !r.times(r).eq(x);\r\n }\r\n\r\n break;\r\n }\r\n }\r\n }\r\n }\r\n\r\n return round(r, r.e + DECIMAL_PLACES + 1, ROUNDING_MODE, m);\r\n };\r\n\r\n\r\n /\r\n * Return a string representing the value of this BigNumber in exponential notation and\r\n * rounded using ROUNDING_MODE to dp fixed decimal places.\r\n \r\n [dp] {number} Decimal places. Integer, 0 to MAX inclusive.\r\n * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n \r\n '[BigNumber Error] Argument {not a primitive number\|not an integer\|out of range}: {dp\|rm}'\r\n /\r\n P.toExponential = function (dp, rm) {\r\n if (dp != null) {\r\n intCheck(dp, 0, MAX);\r\n dp++;\r\n }\r\n return format(this, dp, rm, 1);\r\n };\r\n\r\n\r\n /\r\n * Return a string representing the value of this BigNumber in fixed-point notation rounding\r\n * to dp fixed decimal places using rounding mode rm, or ROUNDING_MODE if rm is omitted.\r\n \r\n Note: as with JavaScript's number type, (-0).toFixed(0) is '0',\r\n * but e.g. (-0.00001).toFixed(0) is '-0'.\r\n \r\n [dp] {number} Decimal places. Integer, 0 to MAX inclusive.\r\n * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n \r\n '[BigNumber Error] Argument {not a primitive number\|not an integer\|out of range}: {dp\|rm}'\r\n /\r\n P.toFixed = function (dp, rm) {\r\n if (dp != null) {\r\n intCheck(dp, 0, MAX);\r\n dp = dp + this.e + 1;\r\n }\r\n return format(this, dp, rm);\r\n };\r\n\r\n\r\n /\r\n * Return a string representing the value of this BigNumber in fixed-point notation rounded\r\n * using rm or ROUNDING_MODE to dp decimal places, and formatted according to the properties\r\n * of the format or FORMAT object (see BigNumber.set).\r\n \r\n The formatting object may contain some or all of the properties shown below.\r\n \r\n FORMAT = {\r\n * prefix: '',\r\n * groupSize: 3,\r\n * secondaryGroupSize: 0,\r\n * groupSeparator: ',',\r\n * decimalSeparator: '.',\r\n * fractionGroupSize: 0,\r\n * fractionGroupSeparator: '\\xA0', // non-breaking space\r\n * suffix: ''\r\n * };\r\n \r\n [dp] {number} Decimal places. Integer, 0 to MAX inclusive.\r\n * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n * [format] {object} Formatting options. See FORMAT pbject above.\r\n \r\n '[BigNumber Error] Argument {not a primitive number\|not an integer\|out of range}: {dp\|rm}'\r\n * '[BigNumber Error] Argument not an object: {format}'\r\n /\r\n P.toFormat = function (dp, rm, format) {\r\n var str,\r\n x = this;\r\n\r\n if (format == null) {\r\n if (dp != null && rm && typeof rm == 'object') {\r\n format = rm;\r\n rm = null;\r\n } else if (dp && typeof dp == 'object') {\r\n format = dp;\r\n dp = rm = null;\r\n } else {\r\n format = FORMAT;\r\n }\r\n } else if (typeof format != 'object') {\r\n throw Error\r\n (bignumberError + 'Argument not an object: ' + format);\r\n }\r\n\r\n str = x.toFixed(dp, rm);\r\n\r\n if (x.c) {\r\n var i,\r\n arr = str.split('.'),\r\n g1 = +format.groupSize,\r\n g2 = +format.secondaryGroupSize,\r\n groupSeparator = format.groupSeparator \|\| '',\r\n intPart = arr[0],\r\n fractionPart = arr[1],\r\n isNeg = x.s < 0,\r\n intDigits = isNeg ? intPart.slice(1) : intPart,\r\n len = intDigits.length;\r\n\r\n if (g2) {\r\n i = g1;\r\n g1 = g2;\r\n g2 = i;\r\n len -= i;\r\n }\r\n\r\n if (g1 > 0 && len > 0) {\r\n i = len % g1 \|\| g1;\r\n intPart = intDigits.substr(0, i);\r\n for (; i < len; i += g1) intPart += groupSeparator + intDigits.substr(i, g1);\r\n if (g2 > 0) intPart += groupSeparator + intDigits.slice(i);\r\n if (isNeg) intPart = '-' + intPart;\r\n }\r\n\r\n str = fractionPart\r\n ? intPart + (format.decimalSeparator \|\| '') + ((g2 = +format.fractionGroupSize)\r\n ? fractionPart.replace(new RegExp('\\\\d{' + g2 + '}\\\\B', 'g'),\r\n '$&' + (format.fractionGroupSeparator \|\| ''))\r\n : fractionPart)\r\n : intPart;\r\n }\r\n\r\n return (format.prefix \|\| '') + str + (format.suffix \|\| '');\r\n };\r\n\r\n\r\n /\r\n * Return an array of two BigNumbers representing the value of this BigNumber as a simple\r\n * fraction with an integer numerator and an integer denominator.\r\n * The denominator will be a positive non-zero value less than or equal to the specified\r\n * maximum denominator. If a maximum denominator is not specified, the denominator will be\r\n * the lowest value necessary to represent the number exactly.\r\n \r\n [md] {number\|string\|BigNumber} Integer >= 1, or Infinity. The maximum denominator.\r\n \r\n '[BigNumber Error] Argument {not an integer\|out of range} : {md}'\r\n /\r\n P.toFraction = function (md) {\r\n var d, d0, d1, d2, e, exp, n, n0, n1, q, r, s,\r\n x = this,\r\n xc = x.c;\r\n\r\n if (md != null) {\r\n n = new BigNumber(md);\r\n\r\n // Throw if md is less than one or is not an integer, unless it is Infinity.\r\n if (!n.isInteger() && (n.c \|\| n.s !== 1) \|\| n.lt(ONE)) {\r\n throw Error\r\n (bignumberError + 'Argument ' +\r\n (n.isInteger() ? 'out of range: ' : 'not an integer: ') + valueOf(n));\r\n }\r\n }\r\n\r\n if (!xc) return new BigNumber(x);\r\n\r\n d = new BigNumber(ONE);\r\n n1 = d0 = new BigNumber(ONE);\r\n d1 = n0 = new BigNumber(ONE);\r\n s = coeffToString(xc);\r\n\r\n // Determine initial denominator.\r\n // d is a power of 10 and the minimum max denominator that specifies the value exactly.\r\n e = d.e = s.length - x.e - 1;\r\n d.c[0] = POWS_TEN[(exp = e % LOG_BASE) < 0 ? LOG_BASE + exp : exp];\r\n md = !md \|\| n.comparedTo(d) > 0 ? (e > 0 ? d : n1) : n;\r\n\r\n exp = MAX_EXP;\r\n MAX_EXP = 1 / 0;\r\n n = new BigNumber(s);\r\n\r\n // n0 = d1 = 0\r\n n0.c[0] = 0;\r\n\r\n for (; ;) {\r\n q = div(n, d, 0, 1);\r\n d2 = d0.plus(q.times(d1));\r\n if (d2.comparedTo(md) == 1) break;\r\n d0 = d1;\r\n d1 = d2;\r\n n1 = n0.plus(q.times(d2 = n1));\r\n n0 = d2;\r\n d = n.minus(q.times(d2 = d));\r\n n = d2;\r\n }\r\n\r\n d2 = div(md.minus(d0), d1, 0, 1);\r\n n0 = n0.plus(d2.times(n1));\r\n d0 = d0.plus(d2.times(d1));\r\n n0.s = n1.s = x.s;\r\n e = e 2;\r\n\r\n // Determine which fraction is closer to x, n0/d0 or n1/d1\r\n r = div(n1, d1, e, ROUNDING_MODE).minus(x).abs().comparedTo(\r\n div(n0, d0, e, ROUNDING_MODE).minus(x).abs()) < 1 ? [n1, d1] : [n0, d0];\r\n\r\n MAX_EXP = exp;\r\n\r\n return r;\r\n };\r\n\r\n\r\n /\r\n Return the value of this BigNumber converted to a number primitive.\r\n /\r\n P.toNumber = function () {\r\n return +valueOf(this);\r\n };\r\n\r\n\r\n /\r\n * Return a string representing the value of this BigNumber rounded to sd significant digits\r\n * using rounding mode rm or ROUNDING_MODE. If sd is less than the number of digits\r\n * necessary to represent the integer part of the value in fixed-point notation, then use\r\n * exponential notation.\r\n \r\n [sd] {number} Significant digits. Integer, 1 to MAX inclusive.\r\n * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n \r\n '[BigNumber Error] Argument {not a primitive number\|not an integer\|out of range}: {sd\|rm}'\r\n /\r\n P.toPrecision = function (sd, rm) {\r\n if (sd != null) intCheck(sd, 1, MAX);\r\n return format(this, sd, rm, 2);\r\n };\r\n\r\n\r\n /\r\n * Return a string representing the value of this BigNumber in base b, or base 10 if b is\r\n * omitted. If a base is specified, including base 10, round according to DECIMAL_PLACES and\r\n * ROUNDING_MODE. If a base is not specified, and this BigNumber has a positive exponent\r\n * that is equal to or greater than TO_EXP_POS, or a negative exponent equal to or less than\r\n * TO_EXP_NEG, return exponential notation.\r\n \r\n [b] {number} Integer, 2 to ALPHABET.length inclusive.\r\n \r\n '[BigNumber Error] Base {not a primitive number\|not an integer\|out of range}: {b}'\r\n /\r\n P.toString = function (b) {\r\n var str,\r\n n = this,\r\n s = n.s,\r\n e = n.e;\r\n\r\n // Infinity or NaN?\r\n if (e === null) {\r\n if (s) {\r\n str = 'Infinity';\r\n if (s < 0) str = '-' + str;\r\n } else {\r\n str = 'NaN';\r\n }\r\n } else {\r\n if (b == null) {\r\n str = e <= TO_EXP_NEG \|\| e >= TO_EXP_POS\r\n ? toExponential(coeffToString(n.c), e)\r\n : toFixedPoint(coeffToString(n.c), e, '0');\r\n } else if (b === 10 && alphabetHasNormalDecimalDigits) {\r\n n = round(new BigNumber(n), DECIMAL_PLACES + e + 1, ROUNDING_MODE);\r\n str = toFixedPoint(coeffToString(n.c), n.e, '0');\r\n } else {\r\n intCheck(b, 2, ALPHABET.length, 'Base');\r\n str = convertBase(toFixedPoint(coeffToString(n.c), e, '0'), 10, b, s, true);\r\n }\r\n\r\n if (s < 0 && n.c[0]) str = '-' + str;\r\n }\r\n\r\n return str;\r\n };\r\n\r\n\r\n /\r\n * Return as toString, but do not accept a base argument, and include the minus sign for\r\n * negative zero.\r\n /\r\n P.valueOf = P.toJSON = function () {\r\n return valueOf(this);\r\n };\r\n\r\n\r\n P._isBigNumber = true;\r\n\r\n P[Symbol.toStringTag] = 'BigNumber';\r\n\r\n // Node.js v10.12.0+\r\n P[Symbol.for('nodejs.util.inspect.custom')] = P.valueOf;\r\n\r\n if (configObject != null) BigNumber.set(configObject);\r\n\r\n return BigNumber;\r\n}\r\n\r\n\r\n// PRIVATE HELPER FUNCTIONS\r\n\r\n// These functions don't need access to variables,\r\n// e.g. DECIMAL_PLACES, in the scope of the `clone` function above.\r\n\r\n\r\nfunction bitFloor(n) {\r\n var i = n \| 0;\r\n return n > 0 \|\| n === i ? i : i - 1;\r\n}\r\n\r\n\r\n// Return a coefficient array as a string of base 10 digits.\r\nfunction coeffToString(a) {\r\n var s, z,\r\n i = 1,\r\n j = a.length,\r\n r = a[0] + '';\r\n\r\n for (; i < j;) {\r\n s = a[i++] + '';\r\n z = LOG_BASE - s.length;\r\n for (; z--; s = '0' + s);\r\n r += s;\r\n }\r\n\r\n // Determine trailing zeros.\r\n for (j = r.length; r.charCodeAt(--j) === 48;);\r\n\r\n return r.slice(0, j + 1 \|\| 1);\r\n}\r\n\r\n\r\n// Compare the value of BigNumbers x and y.\r\nfunction compare(x, y) {\r\n var a, b,\r\n xc = x.c,\r\n yc = y.c,\r\n i = x.s,\r\n j = y.s,\r\n k = x.e,\r\n l = y.e;\r\n\r\n // Either NaN?\r\n if (!i \|\| !j) return null;\r\n\r\n a = xc && !xc[0];\r\n b = yc && !yc[0];\r\n\r\n // Either zero?\r\n if (a \|\| b) return a ? b ? 0 : -j : i;\r\n\r\n // Signs differ?\r\n if (i != j) return i;\r\n\r\n a = i < 0;\r\n b = k == l;\r\n\r\n // Either Infinity?\r\n if (!xc \|\| !yc) return b ? 0 : !xc ^ a ? 1 : -1;\r\n\r\n // Compare exponents.\r\n if (!b) return k > l ^ a ? 1 : -1;\r\n\r\n j = (k = xc.length) < (l = yc.length) ? k : l;\r\n\r\n // Compare digit by digit.\r\n for (i = 0; i < j; i++) if (xc[i] != yc[i]) return xc[i] > yc[i] ^ a ? 1 : -1;\r\n\r\n // Compare lengths.\r\n return k == l ? 0 : k > l ^ a ? 1 : -1;\r\n}\r\n\r\n\r\n/\r\n * Check that n is a primitive number, an integer, and in range, otherwise throw.\r\n /\r\nfunction intCheck(n, min, max, name) {\r\n if (n < min \|\| n > max \|\| n !== mathfloor(n)) {\r\n throw Error\r\n (bignumberError + (name \|\| 'Argument') + (typeof n == 'number'\r\n ? n < min \|\| n > max ? ' out of range: ' : ' not an integer: '\r\n : ' not a primitive number: ') + String(n));\r\n }\r\n}\r\n\r\n\r\n// Assumes finite n.\r\nfunction isOdd(n) {\r\n var k = n.c.length - 1;\r\n return bitFloor(n.e / LOG_BASE) == k && n.c[k] % 2 != 0;\r\n}\r\n\r\n\r\nfunction toExponential(str, e) {\r\n return (str.length > 1 ? str.charAt(0) + '.' + str.slice(1) : str) +\r\n (e < 0 ? 'e' : 'e+') + e;\r\n}\r\n\r\n\r\nfunction toFixedPoint(str, e, z) {\r\n var len, zs;\r\n\r\n // Negative exponent?\r\n if (e < 0) {\r\n\r\n // Prepend zeros.\r\n for (zs = z + '.'; ++e; zs += z);\r\n str = zs + str;\r\n\r\n // Positive exponent\r\n } else {\r\n len = str.length;\r\n\r\n // Append zeros.\r\n if (++e > len) {\r\n for (zs = z, e -= len; --e; zs += z);\r\n str += zs;\r\n } else if (e < len) {\r\n str = str.slice(0, e) + '.' + str.slice(e);\r\n }\r\n }\r\n\r\n return str;\r\n}\r\n\r\n\r\n// EXPORT\r\n\r\n\r\nexport var BigNumber = clone();\r\n\r\nexport default BigNumber;\r\n","/ global global, window /\nimport { sha3_512 as sha3 } from \"@noble/hashes/sha3.js\";\nimport BigNumber from \"bignumber.js\";\n\nconst defaultLength = 24;\nconst bigLength = 32;\n\n/\n A cryptographically secure random number generator that mimics Math.random()\n * Uses the Web Crypto API which is available in both modern browsers and Node.js\n * Returns a random float in the range [0, 1) just like Math.random()\n /\nconst createRandom = () => {\n // Use globalThis.crypto which works in both Node.js and browsers\n if (\n typeof globalThis !== \"undefined\" &&\n globalThis.crypto &&\n typeof globalThis.crypto.getRandomValues === \"function\"\n ) {\n return () => {\n // Generate a random 32-bit unsigned integer\n const buffer = new Uint32Array(1);\n globalThis.crypto.getRandomValues(buffer);\n // Convert to a float in [0, 1) by dividing by 2^32\n return buffer[0] / 0x100000000;\n };\n }\n // Fallback to Math.random if crypto is not available\n return Math.random;\n};\n\nconst random = createRandom();\n\nconst createEntropy = (length = 4, rand = random) => {\n let entropy = \"\";\n\n while (entropy.length < length) {\n entropy = entropy + Math.floor(rand() 36).toString(36);\n }\n return entropy;\n};\n\n/\n Adapted from https://github.com/juanelas/bigint-conversion\n * MIT License Copyright (c) 2018 Juan Hernández Serrano\n /\nfunction bufToBigInt(buf) {\n let value = new BigNumber(0);\n\n for (const i of buf.values()) {\n // Multiply by 256 (left shift by 8 bits) and add the current byte\n value = value.multipliedBy(256).plus(i);\n }\n return value;\n}\n\nconst hash = (input = \"\") => {\n // Drop the first character because it will bias the histogram\n // to the left.\n const encoder = new TextEncoder();\n return bufToBigInt(sha3(encoder.encode(input)))\n .toString(36)\n .slice(1);\n};\n\nconst alphabet = Array.from({ length: 26 }, (x, i) =>\n String.fromCharCode(i + 97),\n);\n\nconst randomLetter = (rand) => alphabet[Math.floor(rand() alphabet.length)];\n\n/\nThis is a fingerprint of the host environment. It is used to help\nprevent collisions when generating ids in a distributed system.\nIf no global object is available, you can pass in your own, or fall back\non a random string.\n/\nconst createFingerprint = ({\n globalObj = typeof global !== \"undefined\"\n ? global\n : typeof window !== \"undefined\"\n ? window\n : {},\n random: rand = random,\n} = {}) => {\n const globals = Object.keys(globalObj).toString();\n const sourceString = globals.length\n ? globals + createEntropy(bigLength, rand)\n : createEntropy(bigLength, rand);\n\n return hash(sourceString).substring(0, bigLength);\n};\n\nconst createCounter = (count) => () => {\n return count++;\n};\n\n// ~22k hosts before 50% chance of initial counter collision\n// with a remaining counter range of 9.0e+15 in JavaScript.\nconst initialCountMax = 476782367;\n\nconst init = ({\n // Fallback if the user does not pass in a CSPRNG. This should be OK\n // because we don't rely solely on the random number generator for entropy.\n // We also use the host fingerprint, current time, and a session counter.\n random: rand = random,\n counter = createCounter(Math.floor(rand() * initialCountMax)),\n length = defaultLength,\n fingerprint = createFingerprint({ random: rand }),\n} = {}) => {\n if (length > bigLength) {\n throw new Error(\n `Length must be between 2 and ${bigLength}. Received: ${length}`,\n );\n }\n return function cuid2() {\n const firstLetter = randomLetter(rand);\n\n // If we're lucky, the `.toString(36)` calls may reduce hashing rounds\n // by shortening the input to the hash function a little.\n const time = Date.now().toString(36);\n const count = counter().toString(36);\n\n // The salt should be long enough to be globally unique across the full\n // length of the hash. For simplicity, we use the same length as the\n // intended id output.\n const salt = createEntropy(length, rand);\n const hashInput = `${time + salt + count + fingerprint}`;\n\n return `${firstLetter + hash(hashInput).substring(1, length)}`;\n };\n};\n\nconst createId = lazy(init);\nfunction lazy(fn) {\n let initialized;\n return () => {\n if (!initialized) {\n initialized = fn();\n }\n return initialized();\n };\n}\n\nconst isCuid = (\n id,\n { minLength = 2, maxLength = bigLength, length = id?.length } = {},\n) => {\n const regex = /^[a-z][0-9a-z]+$/;\n\n return (\n typeof id === \"string\" &&\n length >= minLength &&\n length <= maxLength &&\n regex.test(id)\n );\n};\n\nexport const getConstants = () => ({ defaultLength, bigLength });\nexport { init };\nexport { createId };\nexport { bufToBigInt };\nexport { createCounter };\nexport { createFingerprint };\nexport { isCuid };\n","export const __DEV__ = typeof process !== 'undefined' && process.env.NODE_ENV === 'development';\n","import { OPTIONS, type SigilOptions } from './options';\nimport {\n __DECORATED__,\n __INHERITANCE_CHECKED__,\n __LABEL__,\n __SIGIL_BASE__,\n __SIGIL__,\n __LABEL_LINEAGE__,\n __LABEL_SET__,\n} from './symbols';\nimport type { ISigil, GetInstance } from './types';\nimport { createId } from '@paralleldrive/cuid2';\nimport { __DEV__ } from './constants';\n\n/** -----------------------------------------\n * High level helpers\n * ----------------------------------------- /\n\n/\n Attach sigil-related statics to a constructor and register its label.\n \n Side effects:\n * - Defines non-enumerable statics on the constructor:\n * - `__LABEL__` (string)\n * - `__LABEL_LINEAGE__` (array of strings)\n * - `__LABEL_SET__` (Set of strings)\n * - Marks the constructor as decorated via `markDecorated`.\n \n Throws if the constructor is already decorated.\n \n @internal\n * @param ctor - The constructor to decorate.\n * @param label - The identity label to register and attach (e.g. '@scope/pkg.ClassName').\n * @param opts - Options object to override any global options if needed.\n * @throws Error when `ctor` is already decorated.\n /\nexport function decorateCtor(ctor: Function, label: string, isMixin: boolean = false) {\n // if already decorated throw error\n if (isDecorated(ctor))\n throw new Error(\n `Constructor ${ctor} is already decorated. if you are using 'withSigilTyped()' & '@WithSigil()' at the same time remove one of them.`\n );\n\n // attach basic runtime statics\n Object.defineProperty(ctor, __LABEL__, {\n value: label,\n configurable: false,\n enumerable: false,\n writable: false,\n });\n\n // get parent chain (safe if parent hasn't been augmented yet — uses existing value or empty)\n const parent = Object.getPrototypeOf(ctor);\n const parentChain = parent && parent[__LABEL_LINEAGE__] ? parent[__LABEL_LINEAGE__] : [];\n\n // generate Ctor chain, if mixin (Sigilify function) then append 'Sigil' at the start\n const ctorChain =\n isMixin && label !== 'Sigil' ? ['Sigil', ...parentChain, label] : [...parentChain, label];\n\n // attach symbol lineage and set\n Object.defineProperty(ctor, __LABEL_LINEAGE__, {\n value: ctorChain,\n configurable: false,\n enumerable: false,\n writable: false,\n });\n Object.defineProperty(ctor, __LABEL_SET__, {\n value: new Set(ctorChain),\n configurable: false,\n enumerable: false,\n writable: false,\n });\n\n // mark as decorated\n markDecorated(ctor);\n}\n\n/\n Perform development-only inheritance checks to ensure no ancestor classes\n * reuse the same sigil label.\n \n Behavior:\n * - No-op if `ctor` is not a sigil constructor.\n * - No-op in non-DEV builds.\n * - No-op if inheritance checks were already performed or `OPTIONS.skipLabelInheritanceCheck` is true.\n \n When a duplicate label is detected:\n * - If the class is explicitly decorated (`isDecorated`) or `OPTIONS.autofillLabels` is false,\n * an Error is thrown describing the label collision.\n * - Otherwise (autofill enabled), a random label will be generated and assigned\n * to the offending constructor via `decorateCtor`.\n \n @internal\n * @param ctor - The constructor to validate.\n * @param opts - Options object to override any global options if needed.\n * @throws Error when a decorated subclass re-uses an ancestor's sigil label.\n /\nexport function checkInheritance(\n ctor: Function,\n opts?: Pick<SigilOptions, 'skipLabelInheritanceCheck' \| 'autofillLabels'>\n) {\n const skipLabelInheritanceCheck =\n opts?.skipLabelInheritanceCheck ?? OPTIONS.skipLabelInheritanceCheck;\n const autofillLabels = opts?.autofillLabels ?? OPTIONS.autofillLabels;\n\n if (!isSigilCtor(ctor)) return;\n if (isInheritanceChecked(ctor) \|\| skipLabelInheritanceCheck) return;\n\n /* Array of all sigil constructors in the chain (starting with the provided ctor) /\n const ctors: ISigil[] = [ctor];\n\n // go through prototype chain to get all sigil ancestors\n let ancestor: any = Object.getPrototypeOf(ctor);\n while (isSigilCtor(ancestor)) {\n ctors.push(ancestor);\n ancestor = Object.getPrototypeOf(ancestor);\n }\n\n /* Map<label, className> to record the owner of each label. /\n const labelOwner = new Map<string, string>();\n\n // loop ctors from base to current and make sure no label is reused\n for (let i = ctors.length - 1; i >= 0; i--) {\n const ctor = ctors[i];\n if (!ctor) continue;\n let label = ctor.SigilLabel;\n if (labelOwner.has(label)) {\n if (isDecorated(ctor) \|\| !autofillLabels) {\n const ancestorName = labelOwner.get(label);\n throw new Error(\n `[Sigil Error] Class \"${ctor.name}\" re-uses Sigil label \"${label}\" from ancestor \"${ancestorName}\". ` +\n `Each Sigil subclass must use a unique label. Did you forget to use \"WithSigil(newLabel)\" on the subclass?`\n );\n }\n label = generateRandomLabel();\n decorateCtor(ctor, label);\n }\n labelOwner.set(label, ctor.name);\n }\n markInheritanceChecked(ctor);\n}\n\n/\n Validate a sigil label at runtime and throw a helpful error if it is malformed.\n \n This is intentionally `void` and runs synchronously at class declaration time so\n * invalid labels fail fast during development. Validation behavior follows `OPTIONS.labelValidation`:\n * - If `OPTIONS.labelValidation` is `null` no validation is performed.\n * - If it is a `RegExp`, the label must match the regex.\n * - If it is a function, the function must return `true` for the label to be considered valid.\n \n @internal\n * @typeParam L - Label string literal type.\n * @param label - The label to validate.\n * @param opts - Options object to override any global options if needed.\n * @throws {Error} Throws when the label does not pass configured validation.\n /\nexport function verifyLabel<L extends string>(\n label: L,\n opts?: Pick<SigilOptions, 'labelValidation'>\n): void {\n const labelValidation = opts?.labelValidation ?? OPTIONS.labelValidation;\n\n if (labelValidation) {\n let valid: boolean;\n if (labelValidation instanceof RegExp) valid = labelValidation.test(label);\n else valid = labelValidation(label);\n\n if (!valid)\n throw new Error(\n `[Sigil] Invalid identity label \"${label}\". Make sure that supplied label matches validation regex or function.`\n );\n }\n}\n\n/\n Generate a random alphanumeric label of the requested length.\n \n This is used to auto-generate labels when `OPTIONS.autofillLabels` is enabled.\n * It insures that generated label is not registered yet.\n \n @internal\n * @param length - Desired length of the generated string (defaults to 16).\n * @returns A random label.\n /\nexport function generateRandomLabel(): string {\n let label = createId();\n return `@Sigil.auto-${label}`;\n}\n\n/* -----------------------------------------\n * Introspection helpers\n * ----------------------------------------- /\n\n/\n Mark a constructor as a sigil constructor by attaching an internal symbol.\n \n This function defines a non-enumerable, non-writable, non-configurable\n * property on the constructor so subsequent checks can detect sigil\n * constructors.\n \n @internal\n * @param ctor - The constructor to mark.\n /\nexport function markSigil(ctor: Function) {\n Object.defineProperty(ctor, __SIGIL__, {\n value: true,\n configurable: false,\n enumerable: false,\n writable: false,\n });\n}\n\n/\n Mark a constructor as a \"sigil base\" constructor.\n \n A sigil base constructor indicates that the class is the base for\n * other sigil classes. This writes a stable, non-enumerable property\n * to the constructor.\n \n @internal\n * @param ctor - The constructor to mark as sigil base.\n /\nexport function markSigilBase(ctor: Function) {\n Object.defineProperty(ctor, __SIGIL_BASE__, {\n value: true,\n configurable: false,\n enumerable: false,\n writable: false,\n });\n}\n\n/\n Mark a constructor as having been decorated with `WithSigil`.\n \n This is used to detect classes that were explicitly decorated rather\n * than auto-filled by the library.\n \n @internal\n * @param ctor - The constructor that was decorated.\n /\nexport function markDecorated(ctor: Function) {\n Object.defineProperty(ctor, __DECORATED__, {\n value: true,\n configurable: false,\n enumerable: false,\n writable: false,\n });\n}\n\n/\n Mark that inheritance checks for this constructor have already been performed.\n \n The library uses this to avoid repeating expensive inheritance validation\n * during development.\n \n @internal\n * @param ctor - The constructor that has been checked.\n /\nexport function markInheritanceChecked(ctor: Function) {\n Object.defineProperty(ctor, __INHERITANCE_CHECKED__, {\n value: true,\n configurable: false,\n enumerable: false,\n writable: false,\n });\n}\n\n/\n Runtime predicate that checks whether the provided value is a sigil constructor.\n \n This is a lightweight check that verifies the presence of an internal\n * symbol attached to the constructor.\n \n @param ctor - Constructor to test.\n * @returns `true` if `value` is a sigil constructor, otherwise `false`.\n /\nexport function isSigilCtor(ctor: unknown): ctor is ISigil {\n return typeof ctor === 'function' && (ctor as any)[__SIGIL__] === true;\n}\n\n/\n Runtime predicate that checks whether the provided object is an instance\n * of a sigil class.\n \n @param inst - The instanca to test.\n * @returns `true` if `obj` is an instance produced by a sigil constructor.\n /\nexport function isSigilInstance(inst: unknown): inst is GetInstance<ISigil> {\n if (!inst \|\| typeof inst !== 'object') return false;\n const ctor = getConstructor(inst);\n return isSigilCtor(ctor);\n}\n\n/\n Check whether the provided constructor was marked as a sigil base constructor.\n \n Uses `Object.hasOwn` to ensure we only check own properties.\n \n @param ctor - Constructor to check.\n * @returns `true` if `ctor` is a sigil base constructor.\n /\nexport function isSigilBaseCtor(ctor: Function): ctor is ISigil {\n return Object.hasOwn(ctor, __SIGIL_BASE__);\n}\n\n/\n Check whether the provided object is an instance of a sigil base constructor.\n \n This resolves the instance's constructor and delegates to `isSigilBaseCtor`.\n \n @param inst - The instance to test.\n * @returns `true` if `inst` is an instance of a sigil base constructor.\n /\nexport function isSigilBaseInstance(inst: unknown): inst is GetInstance<ISigil> {\n if (!inst \|\| typeof inst !== 'object') return false;\n const ctor = getConstructor(inst);\n return isSigilBaseCtor(ctor);\n}\n\n/\n Returns whether the constructor has been explicitly decorated with `WithSigil`.\n \n This is an own-property check and does not traverse the prototype chain.\n \n @internal\n * @param ctor - Constructor to test.\n * @returns `true` if the constructor is explicitly decorated.\n /\nexport function isDecorated(ctor: Function): boolean {\n return Object.hasOwn(ctor, __DECORATED__);\n}\n\n/\n Returns whether inheritance checks have already been performed for the constructor.\n \n This is used to avoid repeated checks during development (DEV-only checks).\n \n @internal\n * @param ctor - Constructor to test.\n * @returns `true` if inheritance checks were marked as completed.\n /\nexport function isInheritanceChecked(ctor: Function): boolean {\n return Object.hasOwn(ctor, __INHERITANCE_CHECKED__);\n}\n\n/* -----------------------------------------\n * Generic helpers\n * ----------------------------------------- /\n\n/\n Retrieve the constructor function for a given instance.\n \n Returns `null` for non-objects or when a constructor cannot be resolved.\n \n @internal\n * @param obj - The value that may be an instance whose constructor should be returned.\n * @returns The constructor function or `null` if not available.\n /\nexport function getConstructor(obj: any) {\n if (!obj \|\| typeof obj !== 'object') return null;\n return obj.constructor ?? Object.getPrototypeOf(obj)?.constructor ?? null;\n}\n","import {\n checkInheritance,\n decorateCtor,\n generateRandomLabel,\n getConstructor,\n isSigilCtor,\n isSigilInstance,\n markSigil,\n markSigilBase,\n verifyLabel,\n} from './helpers';\nimport type { SigilOptions } from './options';\nimport { __LABEL__, __LABEL_LINEAGE__, __LABEL_SET__ } from './symbols';\nimport type {\n Constructor,\n ISigil,\n Prettify,\n GetInstance,\n ConstructorAbstract,\n ISigilInstance,\n} from './types';\nimport { __DEV__ } from './constants';\n\n/\n Mixin factory that augments an existing class with Sigil runtime metadata and\n * helpers.\n \n The returned class:\n * - exposes static helpers such as `SigilLabel`, `SigilType`, `isOfType`, and `isOfTypeStrict`\n * - exposes instance helpers such as `getSigilLabel`, `getSigilType`, etc.\n \n @param Base - The base constructor to extend.\n * @param label - Optional identity label to attach to the resulting class (e.g. '@scope/pkg.ClassName').\n * If not passed a random label is generated instead.\n * @param opts - Options object to override any global options if needed.\n * @returns A new abstract constructor that extends `Base` and includes Sigil statics/instance methods.\n * @throws Error if `Base` is already sigilized.\n /\nexport function Sigilify<B extends Constructor, L extends string>(\n Base: B,\n label?: L,\n opts?: SigilOptions\n) {\n // if siglified throw\n if (isSigilCtor(Base)) throw new Error(`[Sigil Error] 'Sigilify(${label})' already siglified.`);\n\n // generate random label if not passed and verify it\n let l: string;\n if (label) {\n verifyLabel(label, opts);\n l = label;\n } else l = generateRandomLabel();\n\n // extend actual class\n class Sigilified extends Base implements ISigilInstance {\n /\n Compile-time nominal brand that encodes the class label `L` plus parent's brand keys `BrandOf<P>`.\n \n - HAVE NO RUN-TIME VALUE (undefined)\n * - Provides a type-only unique marker that makes instances nominally\n * distinct by label and allows propagation/merging of brand keys across inheritance.\n /\n declare static readonly __SIGIL_BRAND__: Prettify<\n {\n Sigil: true;\n } & {\n [K in L]: true;\n }\n >;\n\n /\n Class-level human-readable label constant for this sigil constructor.\n /\n static get SigilLabel(): string {\n return (this as any)[__LABEL__];\n }\n\n /\n Copy of the linearized sigil type label chain for the current constructor.\n \n Useful for debugging and performing strict lineage comparisons.\n \n @returns An array of labels representing parent → child type labels.\n /\n static get SigilLabelLineage(): readonly string[] {\n return [...((this as any)[__LABEL_LINEAGE__] ?? [])];\n }\n\n /\n Copy of the sigil type label set for the current constructor.\n \n Useful for quick membership checks (O(1) lookups) and debugging.\n \n @returns A Readonly Set of labels that represent the type lineage.\n /\n static get SigilLabelSet(): Readonly<Set<string>> {\n const set: Set<string> = new Set();\n for (const s of (this as any)[__LABEL_SET__]) set.add(s);\n return set;\n }\n\n /\n Compile-time nominal brand that encodes the class label `L` plus parent's brand keys `BrandOf<P>`.\n \n - HAVE NO RUN-TIME VALUE (undefined)\n * - Provides a type-only unique marker that makes instances nominally\n * distinct by label and allows propagation/merging of brand keys across inheritance.\n /\n declare readonly __SIGIL_BRAND__: Prettify<\n {\n Sigil: true;\n } & {\n [K in L]: true;\n }\n >;\n\n constructor(...args: any[]) {\n super(...args);\n\n // Correct prototype chain when necessary (defensive for transpiled code / edge cases)\n if (Object.getPrototypeOf(this) !== new.target.prototype)\n Object.setPrototypeOf(this, new.target.prototype);\n\n // Resolve constructor; defensive null-check helps catch weird runtime cases.\n const ctor = getConstructor(this);\n if (!ctor) {\n if (__DEV__)\n throw new Error(`[Sigil Error] 'Sigilify(${label})' instance without constructor`);\n return;\n }\n\n // Perform dev-only inheritance validation to ensure labels are unique across the chain.\n if (__DEV__) checkInheritance(ctor);\n }\n\n /\n Runtime predicate indicating whether `obj` is an instance produced by a sigil class.\n \n @param obj - The value to test.\n * @returns `true` if `obj` is a sigil instance.\n /\n static isSigilified(obj: unknown): obj is ISigil {\n return isSigilInstance(obj);\n }\n\n /\n Check whether `other` is (or inherits from) the type represented by the calling constructor.\n \n This replaces `instanceof` so that checks remain valid across bundles/realms\n * and when subclassing.\n \n @typeParam T - The calling constructor type (narrowing the returned instance type).\n * @param this - The constructor performing the check.\n * @param other - The object to test.\n * @returns `true` if `other` is an instance of this type or a subtype.\n /\n static isOfType<T>(this: T, other: unknown): other is GetInstance<T> {\n if (!isSigilInstance(other)) return false;\n const otherSet = getConstructor(other)?.[__LABEL_SET__];\n const thisType = (this as any)[__LABEL__];\n return !!otherSet && otherSet.has(thisType);\n }\n\n /\n Strict lineage check: compares the type label lineage arrays element-by-element.\n \n @typeParam T - The calling constructor type.\n * @param this - The constructor performing the check.\n * @param other - The object to test.\n * @returns `true` if `other` has an identical lineage up to the length of this constructor's lineage.\n /\n static isOfTypeStrict<T>(this: T, other: unknown): other is GetInstance<T> {\n if (!isSigilInstance(other)) return false;\n const otherLineage = getConstructor(other)?.[__LABEL_LINEAGE__];\n const thisLineage = (this as any)[__LABEL_LINEAGE__] as readonly string[];\n return !!otherLineage && thisLineage.every((s, i) => s === otherLineage[i]);\n }\n\n /\n Check whether `other` is (or inherits from) the type instance.\n \n Allows 'instanceof' like checks but in instances.\n \n @typeParam T - The instance type.\n * @param this - The instance performing the check.\n * @param other - The object to test.\n * @returns `true` if `other` is the same instance of this type or a subtype.\n /\n isOfType<T>(this: T, other: unknown): other is GetInstance<T> {\n if (!isSigilInstance(other)) return false;\n const otherSet = getConstructor(other)?.[__LABEL_SET__];\n const thisType = getConstructor(this)[__LABEL__];\n return !!otherSet && otherSet.has(thisType);\n }\n\n /\n Strict lineage check: compares the type label lineage arrays element-by-element.\n \n Allows 'instanceof' like checks but in instances.\n \n @typeParam T - The instance type.\n * @param this - The instance performing the check.\n * @param other - The object to test.\n * @returns `true` if `other` has an identical lineage up to the length of this instance's lineage.\n /\n isOfTypeStrict<T>(this: T, other: unknown): other is GetInstance<T> {\n if (!isSigilInstance(other)) return false;\n const otherLineage = getConstructor(other)?.[__LABEL_LINEAGE__];\n const thisLineage = getConstructor(this)?.[__LABEL_LINEAGE__] as readonly string[];\n return !!otherLineage && thisLineage.every((s, i) => s === otherLineage[i]);\n }\n\n /\n Returns the human-readable sigil label of this instance's constructor.\n \n @returns The label string (e.g. '@scope/pkg.ClassName') or '@Sigil.unknown' in DEV when constructor is missing.\n /\n getSigilLabel(): string {\n const ctor = getConstructor(this);\n if (!ctor) {\n if (__DEV__)\n throw new Error(`[Sigil Error] 'Sigilify(${label})' instance without constructor`);\n return '@Sigil.unknown';\n }\n return ctor.SigilLabel;\n }\n\n /\n Returns a copy of the sigil type label lineage for this instance's constructor.\n \n @returns readonly array of labels representing the type lineage.\n /\n getSigilLabelLineage(): readonly string[] {\n const ctor = getConstructor(this);\n if (!ctor) {\n if (__DEV__)\n throw new Error(`[Sigil Error] 'Sigilify(${label})' instance without constructor`);\n return ['@Sigil.unknown'];\n }\n return ctor.SigilLabelLineage;\n }\n\n /\n Returns a readonly copy of the sigil type label set for this instance's constructor.\n \n @returns A Readonly Set of labels representing the type lineage for O(1) membership tests.\n /\n getSigilLabelSet(): Readonly<Set<string>> {\n const ctor = getConstructor(this);\n if (!ctor) {\n if (__DEV__)\n throw new Error(`[Sigil Error] 'Sigilify(${label})' instance without constructor`);\n return new Set(['@Sigil.unknown']);\n }\n return ctor.SigilLabelSet;\n }\n }\n\n // Attach sigil metadata to constructor (registers label, sets labels, marks decorated)\n decorateCtor(Sigilified, l, true);\n\n // Mark the returned constructor as sigil (runtime flag) and as a base.\n markSigil(Sigilified);\n markSigilBase(Sigilified);\n\n return Sigilified;\n}\n\n/\n Mixin factory that augments an existing class with Sigil runtime metadata and\n * helpers. Accept and return 'abstract' class.\n \n The returned class:\n * - exposes static helpers such as `SigilLabel`, `SigilType`, `isOfType`, and `isOfTypeStrict`\n * - exposes instance helpers such as `getSigilLabel`, `getSigilType`, etc.\n \n @param Base - The base constructor to extend.\n * @param label - Optional identity label to attach to the resulting class (e.g. '@scope/pkg.ClassName').\n * If not passed a random label is generated instead.\n * @param opts - Options object to override any global options if needed.\n * @returns A new abstract constructor that extends `Base` and includes Sigil statics/instance methods.\n * @throws Error if `Base` is already sigilized.\n /\nexport function SigilifyAbstract<B extends ConstructorAbstract, L extends string>(\n Base: B,\n label?: L,\n opts?: SigilOptions\n) {\n // if siglified throw\n if (isSigilCtor(Base)) throw new Error(`[Sigil Error] 'Sigilify(${label})' already siglified.`);\n\n // generate random label if not passed and verify it\n let l: string;\n if (label) {\n verifyLabel(label, opts);\n l = label;\n } else l = generateRandomLabel();\n\n // extend actual class\n abstract class Sigilified extends Base implements ISigilInstance {\n /\n Compile-time nominal brand that encodes the class label `L` plus parent's brand keys `BrandOf<P>`.\n \n - HAVE NO RUN-TIME VALUE (undefined)\n * - Provides a type-only unique marker that makes instances nominally\n * distinct by label and allows propagation/merging of brand keys across inheritance.\n /\n declare static readonly __SIGIL_BRAND__: Prettify<\n {\n Sigil: true;\n } & {\n [K in L]: true;\n }\n >;\n\n /\n Class-level human-readable label constant for this sigil constructor.\n /\n static get SigilLabel(): string {\n return (this as any)[__LABEL__];\n }\n\n /\n Copy of the linearized sigil type label chain for the current constructor.\n \n Useful for debugging and performing strict lineage comparisons.\n \n @returns An array of labels representing parent → child type labels.\n /\n static get SigilLabelLineage(): readonly string[] {\n return [...((this as any)[__LABEL_LINEAGE__] ?? [])];\n }\n\n /\n Copy of the sigil type label set for the current constructor.\n \n Useful for quick membership checks (O(1) lookups) and debugging.\n \n @returns A Readonly Set of labels that represent the type lineage.\n /\n static get SigilLabelSet(): Readonly<Set<string>> {\n const set: Set<string> = new Set();\n for (const s of (this as any)[__LABEL_SET__]) set.add(s);\n return set;\n }\n\n /\n Compile-time nominal brand that encodes the class label `L` plus parent's brand keys `BrandOf<P>`.\n \n - HAVE NO RUN-TIME VALUE (undefined)\n * - Provides a type-only unique marker that makes instances nominally\n * distinct by label and allows propagation/merging of brand keys across inheritance.\n /\n declare readonly __SIGIL_BRAND__: Prettify<\n {\n Sigil: true;\n } & {\n [K in L]: true;\n }\n >;\n\n constructor(...args: any[]) {\n super(...args);\n\n // Correct prototype chain when necessary (defensive for transpiled code / edge cases)\n if (Object.getPrototypeOf(this) !== new.target.prototype)\n Object.setPrototypeOf(this, new.target.prototype);\n\n // Resolve constructor; defensive null-check helps catch weird runtime cases.\n const ctor = getConstructor(this);\n if (!ctor) {\n if (__DEV__)\n throw new Error(`[Sigil Error] 'Sigilify(${label})' instance without constructor`);\n return;\n }\n\n // Perform dev-only inheritance validation to ensure labels are unique across the chain.\n if (__DEV__) checkInheritance(ctor);\n }\n\n /\n Runtime predicate indicating whether `obj` is an instance produced by a sigil class.\n \n @param obj - The value to test.\n * @returns `true` if `obj` is a sigil instance.\n /\n static isSigilified(obj: unknown): obj is ISigil {\n return isSigilInstance(obj);\n }\n\n /\n Check whether `other` is (or inherits from) the type represented by the calling constructor.\n \n Implementation detail:\n * - Uses the other instance's `__LABEL_SET__` for O(1) membership test.\n * - O(1) and reliable as long as `OPTIONS.skipLabelInheritanceCheck` is `false`.\n \n This replaces `instanceof` so that checks remain valid across bundles/realms\n * and when subclassing.\n \n @typeParam T - The calling constructor type (narrowing the returned instance type).\n * @param this - The constructor performing the check.\n * @param other - The object to test.\n * @returns `true` if `other` is an instance of this type or a subtype.\n /\n static isOfType<T>(this: T, other: unknown): other is GetInstance<T> {\n if (!isSigilInstance(other) \|\| !isSigilCtor(this)) return false;\n const otherSet = getConstructor(other)?.[__LABEL_SET__];\n const thisType = (this as any)[__LABEL__];\n return !!otherSet && otherSet.has(thisType);\n }\n\n /\n Strict lineage check: compares the type label lineage arrays element-by-element.\n \n Implementation detail:\n * - Works in O(n) time where n is the depth of the lineage.\n * - Reliable when `OPTIONS.skipLabelInheritanceCheck` is `false`.\n \n @typeParam T - The calling constructor type.\n * @param this - The constructor performing the check.\n * @param other - The object to test.\n * @returns `true` if `other` has an identical lineage up to the length of this constructor's lineage.\n /\n static isOfTypeStrict<T>(this: T, other: unknown): other is GetInstance<T> {\n if (!isSigilInstance(other) \|\| !isSigilCtor(this)) return false;\n const otherLineage = getConstructor(other)?.[__LABEL_LINEAGE__];\n const thisLineage = (this as any)[__LABEL_LINEAGE__] as readonly string[];\n return !!otherLineage && thisLineage.every((s, i) => s === otherLineage[i]);\n }\n\n /\n Check whether `other` is (or inherits from) the type instance.\n \n Allows 'instanceof' like checks but in instances.\n \n @typeParam T - The instance type.\n * @param this - The instance performing the check.\n * @param other - The object to test.\n * @returns `true` if `other` is the same instance of this type or a subtype.\n /\n isOfType<T>(this: T, other: unknown): other is GetInstance<T> {\n if (!isSigilInstance(other) \|\| !isSigilInstance(this)) return false;\n const otherSet = getConstructor(other)?.[__LABEL_SET__];\n const thisType = getConstructor(this)[__LABEL__];\n return !!otherSet && otherSet.has(thisType);\n }\n\n /\n Strict lineage check: compares the type label lineage arrays element-by-element.\n \n Allows 'instanceof' like checks but in instances.\n \n @typeParam T - The instance type.\n * @param this - The instance performing the check.\n * @param other - The object to test.\n * @returns `true` if `other` has an identical lineage up to the length of this instance's lineage.\n /\n isOfTypeStrict<T>(this: T, other: unknown): other is GetInstance<T> {\n if (!isSigilInstance(other) \|\| !isSigilInstance(this)) return false;\n const otherLineage = getConstructor(other)?.[__LABEL_LINEAGE__];\n const thisLineage = getConstructor(this)?.[__LABEL_LINEAGE__] as readonly string[];\n return !!otherLineage && thisLineage.every((s, i) => s === otherLineage[i]);\n }\n\n /\n Returns the human-readable sigil label of this instance's constructor.\n \n @returns The label string (e.g. '@scope/pkg.ClassName') or '@Sigil.unknown' in DEV when constructor is missing.\n /\n getSigilLabel(): string {\n const ctor = getConstructor(this);\n if (!ctor) {\n if (__DEV__)\n throw new Error(`[Sigil Error] 'Sigilify(${label})' instance without constructor`);\n return '@Sigil.unknown';\n }\n return ctor.SigilLabel;\n }\n\n /\n Returns a copy of the sigil type label lineage for this instance's constructor.\n \n @returns readonly array of labels representing the type lineage.\n /\n getSigilLabelLineage(): readonly string[] {\n const ctor = getConstructor(this);\n if (!ctor) {\n if (__DEV__)\n throw new Error(`[Sigil Error] 'Sigilify(${label})' instance without constructor`);\n return ['@Sigil.unknown'];\n }\n return ctor.SigilLabelLineage;\n }\n\n /\n Returns a readonly copy of the sigil type label set for this instance's constructor.\n \n @returns A Readonly Set of labels representing the type lineage for O(1) membership tests.\n /\n getSigilLabelSet(): Readonly<Set<string>> {\n const ctor = getConstructor(this);\n if (!ctor) {\n if (__DEV__)\n throw new Error(`[Sigil Error] 'Sigilify(${label})' instance without constructor`);\n return new Set(['@Sigil.unknown']);\n }\n return ctor.SigilLabelSet;\n }\n }\n\n // Attach sigil metadata to constructor (registers label, sets labels, marks decorated)\n decorateCtor(Sigilified, l, true);\n\n // Mark the returned constructor as sigil (runtime flag) and as a base.\n markSigil(Sigilified);\n markSigilBase(Sigilified);\n\n return Sigilified;\n}\n","import { Sigilify } from './mixin';\nimport type { GetInstance } from './types';\n\n/\n A minimal root Sigil class used by the library as a base identity.\n \n This is produced by `Sigilify` and can serve as a basic sentinel/base\n * class for other sigil classes or for debugging/inspection.\n /\nexport const Sigil = Sigilify(class {}, 'Sigil');\nexport type Sigil = GetInstance<typeof Sigil>;\n\n/\n A sigil variant of the built-in `Error` constructor used by the library\n * to represent Sigil-specific errors.\n \n Use `SigilError` when you want an Error type that is identifiable via sigil\n * runtime checks (e.g. `SigilError.isOfType(someError)`).\n /\nexport const SigilError = Sigilify(Error, 'SigilError');\nexport type SigilError = GetInstance<typeof SigilError>;\n","import {\n checkInheritance,\n decorateCtor,\n generateRandomLabel,\n isSigilCtor,\n verifyLabel,\n} from './helpers';\nimport type { SigilOptions } from './options';\nimport { __DEV__ } from './constants';\n\n/\n Class decorator factory that attaches sigil statics to a class constructor.\n \n Usage:\n * ```ts\n * @WithSigil('@myorg/mypkg.MyClass')\n * class MyClass { ... }\n * ```\n \n The returned decorator:\n * - validates the provided label (via `verifyLabel`)\n * - performs inheritance checks (via `checkInheritance`) in DEV builds\n * - attaches sigil-related statics to the constructor (via `decorateCtor`)\n \n Notes:\n * - This decorator is intended to be applied to classes only. When used\n * incorrectly (e.g. on a property), it is a no-op.\n * - Throws an error during class creation if the label validation fails.\n \n @typeParam L - Narrow string literal type for the provided label.\n * @param label - Optional sigil label to assign to the decorated class (e.g. `@scope/pkg.ClassName`).\n * If not passed a random label is generated instead.\n * @param opts - Options object to override any global options if needed.\n * @returns A class decorator compatible with the ECMAScript decorator context.\n /\nexport function WithSigil<L extends string>(label?: L, opts?: SigilOptions) {\n // generate random label if not passed and verify it\n let l: string;\n if (label) {\n verifyLabel(label, opts);\n l = label;\n } else l = generateRandomLabel();\n\n return function (value: Function, context: any) {\n // Only apply to class declarations\n if (context.kind !== 'class') return;\n if (!isSigilCtor(value))\n throw new Error(\n `[Sigil Error] 'WithSigil' decorator accept only Sigil classes but used on class ${value.name}`\n );\n // Attach sigil metadata to constructor (registers label, sets symbols, marks decorated)\n decorateCtor(value, l);\n // Development-only inheritance checks and potential autofill\n if (__DEV__) checkInheritance(value, opts);\n };\n}\n","import {\n checkInheritance,\n decorateCtor,\n generateRandomLabel,\n isSigilCtor,\n verifyLabel,\n} from './helpers';\nimport type { SigilOptions } from './options';\nimport type { TypedSigil } from './types';\nimport { __DEV__ } from './constants';\n\n/\n HOF (class inhancer) that attaches runtime sigil metadata to Sigil class.\n * Alternative to '@WithSigil' if you prefer HOFs.\n \n This does both:\n * - validate (and autofill) a label,\n * - perform runtime decoration (via `decorateCtor`),\n \n The helper is idempotent: `decorateCtor` will register the label and throw if already\n * decorated; we handle this gracefully in DEV to support HMR flows.\n \n @typeParam S - Constructor type (should be an ISigil).\n * @typeParam L - Label literal to attach.\n * @param Class - The constructor (class) to enhance.\n * @param label - Optional label string. If omitted, a random label is generated.\n * @param opts - Options object to override any global options if needed.\n * @returns The same constructor value, with runtime metadata ensured.\n /\nexport function withSigil<S extends Function, L extends string = string>(\n Class: S,\n label?: L,\n opts?: SigilOptions\n): S {\n if (!isSigilCtor(Class))\n throw new Error(\n `[Sigil Error] 'withSigil' HOF accept only Sigil classes but used on class ${Class?.name ?? 'unknown'}`\n );\n\n // generate random label if not passed and verify it\n let l: string;\n if (label) {\n verifyLabel(label, opts);\n l = label;\n } else l = generateRandomLabel();\n\n // decorate and check inheritance.\n const ctor = Class;\n decorateCtor(ctor, l);\n if (__DEV__) checkInheritance(ctor, opts);\n\n return Class;\n}\n\n/\n Convenience helper that combine 'withSigil' and 'typeSigil'.\n \n This does both:\n * - validate (and autofill) a label,\n * - perform runtime decoration (via `decorateCtor`),\n * - return the constructor typed as `TypedSigil`.\n \n The helper is idempotent: `decorateCtor` will register the label and throw if already\n * decorated; we handle this gracefully in DEV to support HMR flows.\n \n @typeParam S - Constructor type (should be an ISigil).\n * @typeParam L - Label literal to attach.\n * @param Class - The constructor (class) to decorate and type.\n * @param label - Optional label string. If omitted, a random label is generated.\n * @param parent - Optional parent sigil constructor (type-only).\n * @param opts - Options object to override any global options if needed.\n * @returns The same constructor value, with runtime metadata ensured and typed as `TypedSigil<S,L,P>`.\n */\nexport function withSigilTyped<S extends Function, L extends string = string>(\n Class: S,\n label?: L,\n opts?: SigilOptions\n): TypedSigil<S, L> {\n if (!isSigilCtor(Class))\n throw new Error(\n `[Sigil Error] 'withSigilTyped' HOF accept only Sigil classes but used on class ${Class?.name ?? 'unknown'}`\n );\n\n // generate random label if not passed and verify it\n let l: string;\n if (label) {\n verifyLabel(label, opts);\n l = label;\n } else l = generateRandomLabel();\n\n // decorate and check inheritance.\n const ctor = Class;\n decorateCtor(ctor, l);\n if (__DEV__) checkInheritance(ctor, opts);\n\n return Class as unknown as TypedSigil<S, L>;\n}\n"]}