{"version":3,"file":"js/443-d7364d3ed1886fd8a84b.js","mappings":";uEAqBA,SAASA,IACPC,KAAKC,QAAUD,KAAKC,SAAW,CAAC,EAChCD,KAAKE,cAAgBF,KAAKE,oBAAiBC,CAC7C,CAuQA,SAASC,EAAWC,GAClB,MAAsB,oBAARA,CAChB,CAMA,SAASC,EAASD,GAChB,MAAsB,kBAARA,GAA4B,OAARA,CACpC,CAEA,SAASE,EAAYF,GACnB,YAAe,IAARA,CACT,CApRAG,EAAOC,QAAUV,EAKjBA,EAAaW,UAAUT,aAAUE,EACjCJ,EAAaW,UAAUR,mBAAgBC,EAIvCJ,EAAaY,oBAAsB,GAInCZ,EAAaW,UAAUE,gBAAkB,SAASC,GAChD,GA4PsB,kBA5PRA,GAAMA,EAAI,GAAKC,MAAMD,GACjC,MAAME,UAAU,+BAElB,OADAf,KAAKE,cAAgBW,EACdb,IACT,EAEAD,EAAaW,UAAUM,KAAO,SAASC,GACrC,IAAIC,EAAIC,EAASC,EAAKC,EAAMC,EAAGC,EAM/B,GAJKvB,KAAKC,UACRD,KAAKC,QAAU,CAAC,GAGL,UAATgB,KACGjB,KAAKC,QAAQuB,OACblB,EAASN,KAAKC,QAAQuB,SAAWxB,KAAKC,QAAQuB,MAAMC,QAAS,CAEhE,IADAP,EAAKQ,UAAU,cACGC,MAChB,MAAMT,EAGN,IAAIU,EAAM,IAAID,MAAM,yCAA2CT,EAAK,KAEpE,MADAU,EAAIC,QAAUX,EACRU,CAEV,CAKF,GAAIrB,EAFJY,EAAUnB,KAAKC,QAAQgB,IAGrB,OAAO,EAET,GAAIb,EAAWe,GACb,OAAQO,UAAUD,QAEhB,KAAK,EACHN,EAAQW,KAAK9B,MACb,MACF,KAAK,EACHmB,EAAQW,KAAK9B,KAAM0B,UAAU,IAC7B,MACF,KAAK,EACHP,EAAQW,KAAK9B,KAAM0B,UAAU,GAAIA,UAAU,IAC3C,MAEF,QACEL,EAAOU,MAAMrB,UAAUsB,MAAMF,KAAKJ,UAAW,GAC7CP,EAAQc,MAAMjC,KAAMqB,QAEnB,GAAIf,EAASa,GAIlB,IAHAE,EAAOU,MAAMrB,UAAUsB,MAAMF,KAAKJ,UAAW,GAE7CN,GADAG,EAAYJ,EAAQa,SACJP,OACXH,EAAI,EAAGA,EAAIF,EAAKE,IACnBC,EAAUD,GAAGW,MAAMjC,KAAMqB,GAG7B,OAAO,CACT,EAEAtB,EAAaW,UAAUwB,YAAc,SAASjB,EAAMkB,GAClD,IAAIC,EAEJ,IAAKhC,EAAW+B,GACd,MAAMpB,UAAU,+BA2ClB,OAzCKf,KAAKC,UACRD,KAAKC,QAAU,CAAC,GAIdD,KAAKC,QAAQoC,aACfrC,KAAKgB,KAAK,cAAeC,EACfb,EAAW+B,EAASA,UACpBA,EAASA,SAAWA,GAE3BnC,KAAKC,QAAQgB,GAGTX,EAASN,KAAKC,QAAQgB,IAE7BjB,KAAKC,QAAQgB,GAAMqB,KAAKH,GAGxBnC,KAAKC,QAAQgB,GAAQ,CAACjB,KAAKC,QAAQgB,GAAOkB,GAN1CnC,KAAKC,QAAQgB,GAAQkB,EASnB7B,EAASN,KAAKC,QAAQgB,MAAWjB,KAAKC,QAAQgB,GAAMsB,SAIpDH,EAHG7B,EAAYP,KAAKE,eAGhBH,EAAaY,oBAFbX,KAAKE,gBAKFkC,EAAI,GAAKpC,KAAKC,QAAQgB,GAAMQ,OAASW,IAC5CpC,KAAKC,QAAQgB,GAAMsB,QAAS,EAC5BC,QAAQhB,MAAM,mIAGAxB,KAAKC,QAAQgB,GAAMQ,QACJ,oBAAlBe,QAAQC,OAEjBD,QAAQC,SAKPzC,IACT,EAEAD,EAAaW,UAAUgC,GAAK3C,EAAaW,UAAUwB,YAEnDnC,EAAaW,UAAUiC,KAAO,SAAS1B,EAAMkB,GAC3C,IAAK/B,EAAW+B,GACd,MAAMpB,UAAU,+BAElB,IAAI6B,GAAQ,EAEZ,SAASC,IACP7C,KAAK8C,eAAe7B,EAAM4B,GAErBD,IACHA,GAAQ,EACRT,EAASF,MAAMjC,KAAM0B,WAEzB,CAKA,OAHAmB,EAAEV,SAAWA,EACbnC,KAAK0C,GAAGzB,EAAM4B,GAEP7C,IACT,EAGAD,EAAaW,UAAUoC,eAAiB,SAAS7B,EAAMkB,GACrD,IAAIY,EAAMC,EAAUvB,EAAQH,EAE5B,IAAKlB,EAAW+B,GACd,MAAMpB,UAAU,+BAElB,IAAKf,KAAKC,UAAYD,KAAKC,QAAQgB,GACjC,OAAOjB,KAMT,GAHAyB,GADAsB,EAAO/C,KAAKC,QAAQgB,IACNQ,OACduB,GAAY,EAERD,IAASZ,GACR/B,EAAW2C,EAAKZ,WAAaY,EAAKZ,WAAaA,SAC3CnC,KAAKC,QAAQgB,GAChBjB,KAAKC,QAAQ6C,gBACf9C,KAAKgB,KAAK,iBAAkBC,EAAMkB,QAE/B,GAAI7B,EAASyC,GAAO,CACzB,IAAKzB,EAAIG,EAAQH,KAAM,GACrB,GAAIyB,EAAKzB,KAAOa,GACXY,EAAKzB,GAAGa,UAAYY,EAAKzB,GAAGa,WAAaA,EAAW,CACvDa,EAAW1B,EACX,KACF,CAGF,GAAI0B,EAAW,EACb,OAAOhD,KAEW,IAAhB+C,EAAKtB,QACPsB,EAAKtB,OAAS,SACPzB,KAAKC,QAAQgB,IAEpB8B,EAAKE,OAAOD,EAAU,GAGpBhD,KAAKC,QAAQ6C,gBACf9C,KAAKgB,KAAK,iBAAkBC,EAAMkB,EACtC,CAEA,OAAOnC,IACT,EAEAD,EAAaW,UAAUwC,mBAAqB,SAASjC,GACnD,IAAIkC,EAAK5B,EAET,IAAKvB,KAAKC,QACR,OAAOD,KAGT,IAAKA,KAAKC,QAAQ6C,eAKhB,OAJyB,IAArBpB,UAAUD,OACZzB,KAAKC,QAAU,CAAC,EACTD,KAAKC,QAAQgB,WACbjB,KAAKC,QAAQgB,GACfjB,KAIT,GAAyB,IAArB0B,UAAUD,OAAc,CAC1B,IAAK0B,KAAOnD,KAAKC,QACH,mBAARkD,GACJnD,KAAKkD,mBAAmBC,GAI1B,OAFAnD,KAAKkD,mBAAmB,kBACxBlD,KAAKC,QAAU,CAAC,EACTD,IACT,CAIA,GAAII,EAFJmB,EAAYvB,KAAKC,QAAQgB,IAGvBjB,KAAK8C,eAAe7B,EAAMM,QACrB,GAAIA,EAET,KAAOA,EAAUE,QACfzB,KAAK8C,eAAe7B,EAAMM,EAAUA,EAAUE,OAAS,IAI3D,cAFOzB,KAAKC,QAAQgB,GAEbjB,IACT,EAEAD,EAAaW,UAAUa,UAAY,SAASN,GAQ1C,OANKjB,KAAKC,SAAYD,KAAKC,QAAQgB,GAE1Bb,EAAWJ,KAAKC,QAAQgB,IACzB,CAACjB,KAAKC,QAAQgB,IAEdjB,KAAKC,QAAQgB,GAAMe,QAJnB,EAMV,EAEAjC,EAAaW,UAAU0C,cAAgB,SAASnC,GAC9C,GAAIjB,KAAKC,QAAS,CAChB,IAAIoD,EAAarD,KAAKC,QAAQgB,GAE9B,GAAIb,EAAWiD,GACb,OAAO,EACJ,GAAIA,EACP,OAAOA,EAAW5B,MACtB,CACA,OAAO,CACT,EAEA1B,EAAaqD,cAAgB,SAASE,EAASrC,GAC7C,OAAOqC,EAAQF,cAAcnC,EAC/B,gCC3RA,IAAIsC,EAAsB,EAAQ,OAC9BC,EAAmB,EAAQ,OAC3BC,EAAgB,EAAQ,OAiC5B,SAASC,EAAoBC,EAAQC,EAAOC,GAC1C,OAAO,IAAIN,EAAoBI,EAAQC,EAAOC,EAChD,CAOAH,EAAoBI,QAAU,EAAQ,OAOtCJ,EAAoBH,oBAAsBA,EAO1CG,EAAoBF,iBAAmBA,EAOvCE,EAAoBD,cAAgBA,EAEpCjD,EAAOC,QAAUiD,gCCnEjB,IAAI3D,EAAe,EAAQ,OAgB3B,SAASgE,EAAcC,EAAYC,GACjCjE,KAAKkE,KAAOF,EACZhE,KAAKiE,GAAKA,EACVjE,KAAKmE,YAAc,IACrB,CAlBe,EAAQ,MAoBvBC,CAASL,EAAehE,GAOxBgE,EAAcrD,UAAU2D,OAAS,WAC/BrE,KAAKkD,qBACLlD,KAAKkE,KAAKI,oBAAoBtE,KAChC,EAEA+D,EAAcrD,UAAU6D,iBAAmB,SAAUC,GACnD,OAAOxE,KAAKiE,GAAGO,EACjB,EAEAhE,EAAOC,QAAUsD,gCC1BjB,IAAIU,EAAe,EAAQ,OACvBC,EAAgB,EAAQ,OACxBC,EAAO,EAAQ,OAEfC,EAAM,CAQRC,cAAe,SAAuBC,EAAgBC,EAAWC,GAC/D,GAAIJ,EAAIK,UAAUH,EAAgBC,EAAWC,GAC3C,OAAOF,EAGT,IAAII,EAAgB,GAAKF,EAErBG,EAAmBL,EAAeC,GAElCD,EAAeC,GAAWK,OAAOF,GADjC,CAACA,GAGDG,EAAM,CAAC,EAIX,OAFAA,EAAIN,GAAaI,EAEVV,EAAa,CAAC,EAAGY,EAAKP,EAC/B,EAUAQ,iBAAkB,SAChBR,EACAC,EACAC,GAEA,QAAc7E,IAAV6E,EAGF,OAAOJ,EAAIW,gBAAgBT,GAAgB,SAAUU,EAAGC,GACtD,OAAOV,IAAcU,CACvB,IAGF,IAAIP,EAAgB,GAAKF,EAEzB,OAAOJ,EAAIW,gBAAgBT,GAAgB,SAAUU,EAAGC,GACtD,OAAOV,IAAcU,GAAKP,IAAkBM,CAC9C,GACF,EAQAE,iBAAkB,SAChBZ,EACAC,EACAC,GAEA,QAAc7E,IAAV6E,EACF,MAAM,IAAIrD,MAAM,gDAElB,OAAIiD,EAAIK,UAAUH,EAAgBC,EAAWC,GACpCJ,EAAIU,iBAAiBR,EAAgBC,EAAWC,GAGlDJ,EAAIC,cAAcC,EAAgBC,EAAWC,EACtD,EAYAO,gBAAiB,SACfT,EACAC,EACAY,GAEA,QAAkBxF,IAAd4E,EAGF,OAAKL,EAAcI,GAGZ,CAAC,EAFCA,EAGJ,GAAyB,kBAAdC,EAChB,OAAOJ,EAAKG,EAAgB,CAACC,IACxB,GAAyB,oBAAdA,EAA0B,CAC1C,IAAIa,GAAa,EAEbC,EAAoBC,OAAOC,KAAKjB,GAAgBkB,QAAO,SACzDC,EACA9C,GAEA,IAAI+C,EAASpB,EAAe3B,IAAQ,GAChCgD,EAAYD,EAAOE,QAAO,SAAUpB,GACtC,OAAQD,EAAUC,EAAO7B,EAAKwC,EAChC,IAQA,OANIQ,EAAU1E,SAAWyE,EAAOzE,SAC9BmE,GAAa,GAGfK,EAAK9C,GAAOgD,EAELF,CACT,GACA,CAAC,GAED,OAAIL,EAAmBC,EAChBf,CACT,CAKF,EAUAG,UAAW,SAAmBH,EAAgBC,EAAWsB,GACvD,IAAIC,EACFC,QAAQzB,EAAeC,KACvBD,EAAeC,GAAWtD,OAAS,EAErC,QAAwBtB,IAApBkG,IAAkCC,EACpC,OAAOA,EAGT,IAAIE,EAA0B,GAAKH,EAEnC,OAAuE,IAAhEvB,EAAeC,GAAW0B,QAAQD,EAC3C,GAGFhG,EAAOC,QAAUmE,gCCzKjB,IAAIH,EAAe,EAAQ,OACvBiC,EAAO,EAAQ,OACfC,EAAe,EAAQ,OACvBC,EAAQ,EAAQ,OAChBlC,EAAgB,EAAQ,OACxBC,EAAO,EAAQ,OACfkC,EAAc,EAAQ,OACtBC,EAAmB,EAAQ,OAE3BC,EAAiB,EAAQ,OAY7B,SAASC,EAAyBC,EAAGC,GACnC,OAAInF,MAAMoF,QAAQF,IAAMlF,MAAMoF,QAAQD,GAElCD,EAAExF,SAAWyF,EAAEzF,QACfwF,EAAEG,OAAM,SAAUC,EAAI/F,GACpB,OAAO0F,EAAyBE,EAAE5F,GAAI+F,EACxC,IAGGJ,IAAMC,CACf,CA+DA,SAAS1D,EAAiB8D,GACxB,IAAIC,EAASD,EACT9D,EAAiBgE,cAAcF,GAC/B,CAAC,OAEoBnH,IAArBoH,EAAOE,WAA4BX,EAAiBS,EAAOE,YAE7DjF,QAAQkF,KACN,mIASJ1H,KAAK2H,OAASJ,EAAOI,QAAU,GAO/B3H,KAAK4H,kBAAoBL,EAAOK,mBAAqB,GASrD5H,KAAK6H,mBAAqBN,EAAOM,oBAAsB,GAevD7H,KAAK8H,kBAAoBP,EAAOO,mBAAqB,CAAC,EAatD9H,KAAK+H,eAAiBR,EAAOQ,gBAAkB,CAAC,EAahD/H,KAAKgI,6BAA+BT,EAAOS,8BAAgC,CAAC,EAY5EhI,KAAKiI,mBAAqBV,EAAOU,oBAAsB,CAAC,EAQxDjI,KAAKkI,eAAiBX,EAAOW,gBAAkB,GAe/ClI,KAAKmI,8BACHZ,EAAOY,+BAAiC,CAAC,EAG3C,IAAIC,EAAOpI,KACX8F,OAAOC,KAAKwB,GAAQc,SAAQ,SAAUC,GACpC,IAAIC,GAAiE,IAApD/E,EAAiBgF,WAAW/B,QAAQ6B,GACjDG,OAAuCtI,IAAtBoH,EAAOe,IAEvBC,GAAcE,IACjBL,EAAKE,GAAaf,EAAOe,GAE7B,GACF,CAOA9E,EAAiBgF,WAAa1C,OAAOC,KAAK,IAAIvC,GAO9CA,EAAiBgE,cAAgB,SAAUkB,GAEzC,GAAIA,aAAwBlF,EAAkB,OAAOkF,EAErD,IAAIC,EAAU,CAAC,EAwCf,GAtCiB,CACf,kBACA,eACA,iBACA,uBACA,sBACA,OACA,oBACA,WACA,sBACA,cACA,gBAGSN,SAAQ,SAAUO,GAC3B,IAAI5D,EAAQ0D,EAAaE,GACzB,GAAqB,kBAAV5D,EAAoB,CAC7B,IAAI6D,EAAcC,WAAW9D,GAE7B2D,EAAQC,GAAK9H,MAAM+H,GAAe7D,EAAQ6D,CAC5C,CACF,IAII9G,MAAMoF,QAAQuB,EAAaK,qBAC7BJ,EAAQI,kBAAoBL,EAAaK,kBAAkBC,KAAI,SAC7DC,GAEA,OAAIlH,MAAMoF,QAAQ8B,GACTA,EAAQD,KAAI,SAAUhE,GAC3B,OAAO8D,WAAW9D,EACpB,IAEKiE,CACT,KAGEP,EAAaT,mBAAoB,CACnC,IAAIA,EAAqB,CAAC,EAC1BnC,OAAOC,KAAK2C,EAAaT,oBAAoBI,SAAQ,SAAUtD,GAC7D,IAAImE,EAAYR,EAAaT,mBAAmBlD,IAAc,CAAC,EAC/DkD,EAAmBlD,GAAa,CAAC,EACjCe,OAAOC,KAAKmD,GAAWb,SAAQ,SAAUc,GACvC,IACIC,EADSF,EAAUC,GACGH,KAAI,SAAUxD,GACtC,OAAIzD,MAAMoF,QAAQ3B,GACTA,EAAEwD,KAAI,SAAUK,GACrB,MAAsB,kBAAXA,EACFP,WAAWO,GAEbA,CACT,IACsB,kBAAN7D,EACTsD,WAAWtD,GAEbA,CACT,IACAyC,EAAmBlD,GAAWoE,GAAYC,CAC5C,GACF,IACAT,EAAQV,mBAAqBA,CAC/B,CAEA,OAAOrB,EAAM,CAAC,EAAG8B,EAAcC,EACjC,EAQAnF,EAAiB8F,KAAO,SAA8BhC,GACpD,IAAIiC,EAAW,IAAI/F,EAAiB8D,GAyBpC,OAvByBA,EAAcO,oBAAsB,IAC1CQ,SAAQ,SAAUmB,GACnC,GAAIA,EAAMC,SAAU,CAClB,IAAIC,EAAoBH,EAASI,0BAA0BH,EAAMI,MAG/DF,EAAkBjI,OAAS,GACsB,IAAjDiI,EAAkB,GAAGjD,QAAQ+C,EAAMC,YAEnCF,EAAWA,EAASM,iBAAiBL,EAAMI,OAKZ,KADjCF,EAAoBH,EAASI,0BAA0BH,EAAMI,OACvCnI,SACpB8H,EAAWA,EAASO,kCAClBN,EAAMI,KACNJ,EAAMC,UAGZ,CACF,IAEOF,CACT,EAQA/F,EAAiBuG,SAAW,SAAUC,EAAcxF,GAClD,IAAI+C,EAAS/C,GAAc,CAAC,EAE5B,OACEwF,EAAaC,YACb1C,EAAOW,gBACPX,EAAOW,eAAezG,OAAS,EAExB,IAAIE,MACT,qLAKAqI,EAAa9B,eAAezG,OAAS,GAAK8F,EAAO0C,WAC5C,IAAItI,MACT,oKAMFqI,EAAaE,gBACb3C,EAAOU,oBACPvD,EAAc6C,EAAOU,oBAEd,IAAItG,MACT,+KAMA+C,EAAcsF,EAAa/B,qBAAuBV,EAAO2C,eACpD,IAAIvI,MACT,+KAMG,IACT,EAEA6B,EAAiB9C,UAAY,CAC3ByJ,YAAa3G,EAWbqG,iBAAkB,SAA0B9E,GAC1C,IAAIqF,EAAQ,CACVnC,mBAAoBjI,KAAKqK,yBAAyBtF,GAClD+C,kBAAmBf,EAAexB,gBAChCvF,KAAK8H,kBACL/C,EACA,oBAEFgD,eAAgBhB,EAAexB,gBAC7BvF,KAAK+H,eACLhD,EACA,WAEFiD,6BAA8BjB,EAAexB,gBAC3CvF,KAAKgI,6BACLjD,EACA,oBAEFoD,8BAA+BpB,EAAexB,gBAC5CvF,KAAKmI,8BACLpD,EACA,sBAGJ,OACEqF,EAAMnC,qBAAuBjI,KAAKiI,oBAClCmC,EAAMtC,oBAAsB9H,KAAK8H,mBACjCsC,EAAMrC,iBAAmB/H,KAAK+H,gBAC9BqC,EAAMpC,+BACJhI,KAAKgI,8BACPoC,EAAMjC,gCAAkCnI,KAAKmI,8BAEtCnI,KAEFA,KAAKsK,mBAAmBF,EACjC,EAMAG,UAAW,WACT,YAAwBpK,IAApBH,KAAKiK,YAA2D,IAA/BjK,KAAKkI,eAAezG,OAChDzB,KAEFA,KAAKsK,mBAAmB,CAC7BL,gBAAY9J,EACZ+H,eAAgB,IAEpB,EAOAsC,SAAU,SAAkB5G,GAC1B,OAAIA,IAAU5D,KAAK4D,MAAc5D,KAE1BA,KAAKsK,mBAAmB,CAC7B1G,MAAOA,GAEX,EAOA6G,SAAU,SAAkBC,GAC1B,OAAIA,IAAa1K,KAAK2K,MAAc3K,KAE7BA,KAAKsK,mBAAmB,CAC7BK,MAAOD,GAEX,EAOAE,QAAS,SAAiBC,GACxB,OAAIA,IAAY7K,KAAK8K,KAAa9K,KAE3BA,KAAKsK,mBAAmB,CAC7BQ,KAAMD,GAEV,EAQAE,UAAW,SAAmBpD,GAC5B,OAAO3H,KAAKsK,mBAAmB,CAC7B3C,OAAQA,GAEZ,EAQAqD,qBAAsB,SAA8BrD,GAClD,OAAO3H,KAAKsK,mBAAmB,CAC7B1C,kBAAmBD,GAEvB,EAQAsD,eAAgB,SAAwBpK,GACtC,OAAIb,KAAKkL,cAAgBrK,EAAUb,KAE5BA,KAAKsK,mBAAmB,CAC7BY,YAAarK,GAEjB,EAQAsK,iBAAkB,SAA0BC,GAC1C,OAAIpL,KAAKoL,gBAAkBA,EAAsBpL,KAE1CA,KAAKsK,mBAAmB,CAC7Bc,cAAeA,GAEnB,EAkBAC,qBAAsB,SAAUtG,EAAWoE,EAAUnE,GACnD,IAAIsG,EAAMzE,EAAY7B,GAEtB,GAAIhF,KAAKuL,iBAAiBxG,EAAWoE,EAAUmC,GAAM,OAAOtL,KAE5D,IAAIqF,EAAMuB,EAAM,CAAC,EAAG5G,KAAKiI,oBAazB,OAXA5C,EAAIN,GAAa6B,EAAM,CAAC,EAAGvB,EAAIN,IAE3BM,EAAIN,GAAWoE,IAEjB9D,EAAIN,GAAWoE,GAAY9D,EAAIN,GAAWoE,GAAUnH,QAEpDqD,EAAIN,GAAWoE,GAAU7G,KAAKgJ,IAE9BjG,EAAIN,GAAWoE,GAAY,CAACmC,GAGvBtL,KAAKsK,mBAAmB,CAC7BrC,mBAAoB5C,GAExB,EAMAmG,0BAA2B,SAAUC,GACnC,OAAKzL,KAAK0L,mBAAmBD,IAGtBzL,KAAK8H,kBAAkB2D,IAFrB,EAGX,EAMAE,0BAA2B,SAAUF,GACnC,OAAKzL,KAAK4L,mBAAmBH,IAGtBzL,KAAKgI,6BAA6ByD,IAFhC,EAGX,EAMA9B,0BAA2B,SAAU8B,GAGnC,OAAOzL,KAAKmI,8BAA8BsD,IAAc,EAC1D,EAMAI,sBAAuB,SAAUJ,GAC/B,OAAKzL,KAAK0L,mBAAmBD,IAGtBzL,KAAK+H,eAAe0D,IAFlB,EAGX,EAUAK,wBAAyB,SAAU/G,EAAWoE,EAAU4C,GACtD,IAAIC,EAAaD,EACjB,YAAmB5L,IAAf6L,EACGhM,KAAKuL,iBAAiBxG,EAAWoE,EAAU6C,GAGzChM,KAAKsK,mBAAmB,CAC7BrC,mBAAoBjI,KAAKqK,0BAAyB,SAChDrF,EACA7B,GAEA,OACEA,IAAQ4B,GACRC,EAAMiH,KAAO9C,GACbnC,EAAyBhC,EAAMsG,IAAKzE,EAAYmF,GAEpD,MAZOhM,UAcaG,IAAbgJ,EACJnJ,KAAKuL,iBAAiBxG,EAAWoE,GAC/BnJ,KAAKsK,mBAAmB,CAC7BrC,mBAAoBjI,KAAKqK,0BAAyB,SAChDrF,EACA7B,GAEA,OAAOA,IAAQ4B,GAAaC,EAAMiH,KAAO9C,CAC3C,MAPsDnJ,KAWrDA,KAAKuL,iBAAiBxG,GACpB/E,KAAKsK,mBAAmB,CAC7BrC,mBAAoBjI,KAAKqK,0BAAyB,SAAUrF,EAAO7B,GACjE,OAAOA,IAAQ4B,CACjB,MAJ4C/E,IAMhD,EAMAkM,sBAAuB,SAAUT,GAC/B,OAAOzL,KAAKiI,mBAAmBwD,IAAc,CAAC,CAChD,EAOAU,qBAAsB,SAAUpH,EAAWoE,GACzC,OACEnJ,KAAKiI,mBAAmBlD,IACxB/E,KAAKiI,mBAAmBlD,GAAWoE,EAEvC,EAWAkB,yBAA0B,SAAkCtF,GAC1D,QAAkB5E,IAAd4E,EACF,OAAKL,EAAc1E,KAAKiI,oBAGjB,CAAC,EAFCjI,KAAKiI,mBAGT,GAAyB,kBAAdlD,EAChB,OAAOJ,EAAK3E,KAAKiI,mBAAoB,CAAClD,IACjC,GAAyB,oBAAdA,EAA0B,CAC1C,IAAIa,GAAa,EACbqC,EAAqBjI,KAAKiI,mBAC1BmE,EAAwBtG,OAAOC,KAAKkC,GAAoBjC,QAC1D,SAAUC,EAAM9C,GACd,IAAI+F,EAAYjB,EAAmB9E,GAC/BkJ,EAAe,CAAC,EAsBpB,OApBAnD,EAAYA,GAAa,CAAC,EAC1BpD,OAAOC,KAAKmD,GAAWb,SAAQ,SAAUc,GACvC,IAAIjD,EAASgD,EAAUC,IAAa,GAChCmD,EAAY,GAChBpG,EAAOmC,SAAQ,SAAUrD,GACDD,EACpB,CAAEuG,IAAKtG,EAAOiH,GAAI9C,GAClBhG,EACA,YAEoBmJ,EAAUhK,KAAK0C,EACvC,IACIsH,EAAU7K,SAAWyE,EAAOzE,SAC9BmE,GAAa,GAEfyG,EAAalD,GAAYmD,CAC3B,IAEArG,EAAK9C,GAAOkJ,EAELpG,CACT,GACA,CAAC,GAGH,OAAIL,EAAmBwG,EAChBpM,KAAKiI,kBACd,CAKF,EAQAsE,SAAU,SAAkB/C,GAC1B,OAAIxJ,KAAK0L,mBAAmBlC,GACnBxJ,KAGFA,KAAKsK,mBAAmB,CAC7B3C,OAAQ3H,KAAK2H,OAAOvC,OAAO,CAACoE,KAEhC,EAQAgD,oBAAqB,SAA6BhD,GAChD,OAAIxJ,KAAK4L,mBAAmBpC,GACnBxJ,KAGFA,KAAKsK,mBAAmB,CAC7B1C,kBAAmB5H,KAAK4H,kBAAkBxC,OAAO,CAACoE,KAEtD,EASAiD,qBAAsB,SAA8BC,GAClD,GAAI1M,KAAK2M,oBAAoBD,EAAkB9C,MAC7C,MAAM,IAAIjI,MACR,+DACE+K,EAAkB9C,KAClB,KAIN,OAAO5J,KAAKsK,mBAAmB,CAC7BzC,mBAAoB7H,KAAK6H,mBAAmBzC,OAAO,CAACsH,KAExD,EAQAE,mBAAoB,SAA4BpD,EAAOxE,GACrD,IAAKhF,KAAK0L,mBAAmBlC,GAC3B,MAAM,IAAI7H,MACR6H,EACE,uEAGN,OAAIzC,EAAe9B,UAAUjF,KAAK8H,kBAAmB0B,EAAOxE,GACnDhF,KAEFA,KAAKsK,mBAAmB,CAC7BxC,kBAAmBf,EAAelC,cAChC7E,KAAK8H,kBACL0B,EACAxE,IAGN,EAQA6H,qBAAsB,SAA8BrD,EAAOxE,GACzD,IAAKhF,KAAK0L,mBAAmBlC,GAC3B,MAAM,IAAI7H,MACR6H,EACE,uEAGN,OAAIzC,EAAe9B,UAAUjF,KAAK+H,eAAgByB,EAAOxE,GAChDhF,KAEFA,KAAKsK,mBAAmB,CAC7BvC,eAAgBhB,EAAelC,cAC7B7E,KAAK+H,eACLyB,EACAxE,IAGN,EAQA8H,8BAA+B,SAC7BtD,EACAxE,GAEA,IAAKhF,KAAK4L,mBAAmBpC,GAC3B,MAAM,IAAI7H,MACR6H,EACE,kFAIN,OACEzC,EAAe9B,UAAUjF,KAAKgI,6BAA8BwB,EAAOxE,GAE5DhF,KAEFA,KAAKsK,mBAAmB,CAC7BtC,6BAA8BjB,EAAelC,cAC3C7E,KAAKgI,6BACLwB,EACAxE,IAGN,EAMA+H,iBAAkB,SAA0BC,GAC1C,GAAIhN,KAAKiN,aAAaD,GAAM,OAAOhN,KAEnC,IAAIkN,EAAe,CACjBhF,eAAgBlI,KAAKkI,eAAe9C,OAAO4H,IAG7C,OAAOhN,KAAKsK,mBAAmB4C,EACjC,EAQAC,YAAa,SAAqB3D,GAChC,OAAKxJ,KAAK0L,mBAAmBlC,GAItBxJ,KAAK6J,iBAAiBL,GAAOc,mBAAmB,CACrD3C,OAAQ3H,KAAK2H,OAAOvB,QAAO,SAAUX,GACnC,OAAOA,IAAM+D,CACf,MANOxJ,IAQX,EAQAoN,uBAAwB,SAAgC5D,GACtD,OAAKxJ,KAAK4L,mBAAmBpC,GAItBxJ,KAAK6J,iBAAiBL,GAAOc,mBAAmB,CACrD1C,kBAAmB5H,KAAK4H,kBAAkBxB,QAAO,SAAUX,GACzD,OAAOA,IAAM+D,CACf,MANOxJ,IAQX,EAQAqN,wBAAyB,SAAiC7D,GACxD,OAAKxJ,KAAK2M,oBAAoBnD,GAIvBxJ,KAAK6J,iBAAiBL,GAAOc,mBAAmB,CACrDzC,mBAAoB7H,KAAK6H,mBAAmBzB,QAAO,SAAUX,GAC3D,OAAOA,EAAEmE,OAASJ,CACpB,MANOxJ,IAQX,EAUAsN,sBAAuB,SAA+B9D,EAAOxE,GAC3D,IAAKhF,KAAK0L,mBAAmBlC,GAC3B,MAAM,IAAI7H,MACR6H,EACE,uEAGN,OAAKzC,EAAe9B,UAAUjF,KAAK8H,kBAAmB0B,EAAOxE,GAGtDhF,KAAKsK,mBAAmB,CAC7BxC,kBAAmBf,EAAezB,iBAChCtF,KAAK8H,kBACL0B,EACAxE,KANKhF,IASX,EAQAuN,wBAAyB,SAAiC/D,EAAOxE,GAC/D,IAAKhF,KAAK0L,mBAAmBlC,GAC3B,MAAM,IAAI7H,MACR6H,EACE,uEAGN,OAAKzC,EAAe9B,UAAUjF,KAAK+H,eAAgByB,EAAOxE,GAGnDhF,KAAKsK,mBAAmB,CAC7BvC,eAAgBhB,EAAezB,iBAC7BtF,KAAK+H,eACLyB,EACAxE,KANKhF,IASX,EAQAwN,iCAAkC,SAChChE,EACAxE,GAEA,IAAKhF,KAAK4L,mBAAmBpC,GAC3B,MAAM,IAAI7H,MACR6H,EACE,kFAGN,OACGzC,EAAe9B,UAAUjF,KAAKgI,6BAA8BwB,EAAOxE,GAI/DhF,KAAKsK,mBAAmB,CAC7BtC,6BAA8BjB,EAAezB,iBAC3CtF,KAAKgI,6BACLwB,EACAxE,KANKhF,IASX,EAOAyN,oBAAqB,SAA6BT,GAChD,IAAKhN,KAAKiN,aAAaD,GAAM,OAAOhN,KAEpC,IAAIkN,EAAe,CACjBhF,eAAgBlI,KAAKkI,eAAe9B,QAAO,SAAUsH,GACnD,OAAOA,IAAMV,CACf,KAGF,OAAOhN,KAAKsK,mBAAmB4C,EACjC,EAUAxH,iBAAkB,SAA0B8D,EAAOxE,GACjD,OAAOhF,KAAK2N,sBAAsBnE,EAAOxE,EAC3C,EASA2I,sBAAuB,SAA+BnE,EAAOxE,GAC3D,GAAIhF,KAAK2M,oBAAoBnD,GAC3B,OAAOxJ,KAAK8J,kCAAkCN,EAAOxE,GAChD,GAAIhF,KAAK0L,mBAAmBlC,GACjC,OAAOxJ,KAAK4N,iCAAiCpE,EAAOxE,GAC/C,GAAIhF,KAAK4L,mBAAmBpC,GACjC,OAAOxJ,KAAK6N,iCAAiCrE,EAAOxE,GAGtD,MAAM,IAAIrD,MACR,sCACE6H,EACA,6FAEN,EAQAoE,iCAAkC,SAChCpE,EACAxE,GAEA,IAAKhF,KAAK0L,mBAAmBlC,GAC3B,MAAM,IAAI7H,MACR6H,EACE,uEAIN,OAAOxJ,KAAKsK,mBAAmB,CAC7BxC,kBAAmBf,EAAerB,iBAChC1F,KAAK8H,kBACL0B,EACAxE,IAGN,EAQA8I,6BAA8B,SAC5BtE,EACAxE,GAEA,IAAKhF,KAAK0L,mBAAmBlC,GAC3B,MAAM,IAAI7H,MACR6H,EACE,uEAIN,OAAOxJ,KAAKsK,mBAAmB,CAC7BvC,eAAgBhB,EAAerB,iBAC7B1F,KAAK+H,eACLyB,EACAxE,IAGN,EAQA6I,iCAAkC,SAChCrE,EACAxE,GAEA,IAAKhF,KAAK4L,mBAAmBpC,GAC3B,MAAM,IAAI7H,MACR6H,EACE,kFAIN,OAAOxJ,KAAKsK,mBAAmB,CAC7BtC,6BAA8BjB,EAAerB,iBAC3C1F,KAAKgI,6BACLwB,EACAxE,IAGN,EAQA8E,kCAAmC,SACjCN,EACAxE,GAEA,IAAKhF,KAAK2M,oBAAoBnD,GAC5B,MAAM,IAAI7H,MACR6H,EACE,mFAIN,IAAIuE,EAAY/N,KAAKgO,+BACnBhO,KAAKiO,2BAA2BzE,IAG9BnE,EAAM,CAAC,EA2BX,YAxBgDlF,IAA9CH,KAAKmI,8BAA8BqB,IACnCxJ,KAAKmI,8BAA8BqB,GAAO/H,OAAS,IAGlDzB,KAAKmI,8BAA8BqB,GAAO,KAAOxE,GAO1C,IAFNhF,KAAKmI,8BAA8BqB,GAAO,GAAG/C,QAC3CzB,EAAQ+I,KAIsB,IAA9B/I,EAAMyB,QAAQsH,GAEhB1I,EAAImE,GAAS,GAEbnE,EAAImE,GAAS,CAACxE,EAAMhD,MAAM,EAAGgD,EAAMkJ,YAAYH,KAGjD1I,EAAImE,GAAS,CAACxE,GAGThF,KAAKsK,mBAAmB,CAC7BnC,8BAA+B1D,EAC7B,CAAC,EACDY,EACArF,KAAKmI,gCAGX,EASAgG,+BAAgC,SAAU3E,EAAO4E,GAC/C,GAAIpO,KAAKqO,2BAA2B7E,GAClC,MAAM,IAAI7H,MAAM6H,EAAQ,wBAE1B,IAAKxJ,KAAK2M,oBAAoBnD,GAC5B,MAAM,IAAI7H,MACR6H,EACE,oFAGN,IAAInE,EAAM,CAAC,EAEX,OADAA,EAAImE,GAAS,CAAC4E,GACPpO,KAAKsK,mBAAmB,CAC7BnC,8BAA+B1D,EAC7B,CAAC,EACDY,EACArF,KAAKmI,gCAGX,EAQAmG,kCAAmC,SAAU9E,GAC3C,IAAKxJ,KAAKqO,2BAA2B7E,GACnC,OAAOxJ,KAET,IAAIqF,EAAM,CAAC,EAEX,OADAA,EAAImE,GAAS,GACNxJ,KAAKsK,mBAAmB,CAC7BnC,8BAA+B1D,EAC7B,CAAC,EACDY,EACArF,KAAKmI,gCAGX,EAOAoG,oBAAqB,SAA6BvB,GAChD,OAAIhN,KAAKiN,aAAaD,GACbhN,KAAKyN,oBAAoBT,GAG3BhN,KAAK+M,iBAAiBC,EAC/B,EAOApB,mBAAoB,SAAUpC,GAC5B,OAAOxJ,KAAK4H,kBAAkBnB,QAAQ+C,IAAU,CAClD,EAOAmD,oBAAqB,SAAUlB,GAC7B,YAAsDtL,IAA/CH,KAAKiO,2BAA2BxC,EACzC,EAOAC,mBAAoB,SAAUlC,GAC5B,OAAOxJ,KAAK2H,OAAOlB,QAAQ+C,IAAU,CACvC,EAUAgF,eAAgB,SAAwBhF,EAAOxE,GAC7C,QAAKhF,KAAK0L,mBAAmBlC,IAGtBzC,EAAe9B,UAAUjF,KAAK8H,kBAAmB0B,EAAOxE,EACjE,EAWAyJ,iBAAkB,SAA0BjF,EAAOxE,GACjD,QAAKhF,KAAK0L,mBAAmBlC,IAGtBzC,EAAe9B,UAAUjF,KAAK+H,eAAgByB,EAAOxE,EAC9D,EAUA0J,0BAA2B,SAAmClF,EAAOxE,GACnE,QAAKhF,KAAK4L,mBAAmBpC,IAGtBzC,EAAe9B,UACpBjF,KAAKgI,6BACLwB,EACAxE,EAEJ,EAUAqJ,2BAA4B,SAC1B7E,EACAxE,GAEA,IAAKhF,KAAK2M,oBAAoBnD,GAC5B,OAAO,EAGT,IAAImF,EAAc3O,KAAK2J,0BAA0BH,GAEjD,OAAKxE,GAIkC,IAAhC2J,EAAYlI,QAAQzB,GAHlB2J,EAAYlN,OAAS,CAIhC,EAWA8J,iBAAkB,SAA0BxG,EAAWoE,EAAUnE,GAC/D,QAAc7E,IAAV6E,QAAoC7E,IAAbgJ,EACzB,OAAO5C,QAAQvG,KAAKiI,mBAAmBlD,IAGzC,IAAI6J,EACF5O,KAAKiI,mBAAmBlD,SACyB5E,IAAjDH,KAAKiI,mBAAmBlD,GAAWoE,GAErC,QAAchJ,IAAV6E,IAAwB4J,EAC1B,OAAOA,EAGT,IAr1CeC,EAAOC,EAq1ClBjG,EAAchC,EAAY7B,GAC1B+J,OAEF5O,KAx1Ca0O,EAu1CH7O,KAAKiI,mBAAmBlD,GAAWoE,GAv1CzB2F,EAu1CoCjG,EAt1CrDnC,EAAKmI,GAAO,SAAUG,GAC3B,OAAOhI,EAAyBgI,EAAcF,EAChD,KAu1CE,OAAOF,GAAqBG,CAC9B,EAOA9B,aAAc,SAAsBD,GAClC,OAA6C,IAAtChN,KAAKkI,eAAezB,QAAQuG,EACrC,EAQAiC,4BAA6B,WAE3B,IAAI7G,EAAOpI,KAGPkP,EAAkCvI,EACpCb,OAAOC,KAAK/F,KAAKiI,oBAAoB7B,QAAO,SAAUoD,GACpD,OAAO1D,OAAOC,KAAKqC,EAAKH,mBAAmBuB,IAAQ/H,OAAS,CAC9D,IACAzB,KAAK4H,mBAGP,OAAO9B,OAAOC,KAAK/F,KAAKgI,8BACrB5B,QAAO,SAAUoD,GAChB,OAAOpB,EAAKJ,6BAA6BwB,GAAO/H,OAAS,CAC3D,IACC2D,OAAO8J,GACP9J,OAAOpF,KAAKmP,gCACZC,MACL,EAQAD,6BAA8B,WAE5B,IAAI/G,EAAOpI,KACX,OAAO2G,EAGL3G,KAAK6H,mBAAmBmB,KAAI,SAAUQ,GACpC,OAAOA,EAAMI,IACf,IACA9D,OAAOC,KAAK/F,KAAKmI,+BAA+B/B,QAAO,SAAUoD,GAC/D,OAAOpB,EAAKD,8BAA8BqB,GAAO/H,OAAS,CAC5D,KACA2N,MACJ,EAMAC,8BAA+B,WAC7B,IAAIC,EAAgBtP,KAAKiP,8BAEzB,OAAOjP,KAAK4H,kBAAkBxB,QAAO,SAAUX,GAC7C,OAAqC,IAA9B6J,EAAc7I,QAAQhB,EAC/B,GACF,EAEA8J,kBAAmB,CACjB,QAEA,SACA,oBACA,oBACA,qBACA,iBAEA,+BACA,qBACA,iBACA,iCAGFC,eAAgB,WACd,IAAID,EAAoBvP,KAAKuP,kBAEzBE,EAAc,CAAC,EAGfrH,EAAOpI,KAWX,OAVA8F,OAAOC,KAAK/F,MAAMqI,SAAQ,SAAUC,GAClC,IAAI0D,EAAa5D,EAAKE,IAEsB,IAA1CiH,EAAkB9I,QAAQ6B,SACXnI,IAAf6L,IAEAyD,EAAYnH,GAAa0D,EAE7B,IAEOyD,CACT,EAWAC,kBAAmB,SAAsBC,EAAW3K,GAClD,GAAIhF,KAAK2P,KAAe3K,EAAO,OAAOhF,KAEtC,IAAIkN,EAAe,CAAC,EAIpB,OAFAA,EAAayC,GAAa3K,EAEnBhF,KAAKsK,mBAAmB4C,EACjC,EAOA5C,mBAAoB,SAA4B/C,GAC9C,IAAKA,EAAQ,OAAOvH,KAEpB,IAAIwB,EAAQgC,EAAiBuG,SAAS/J,KAAMuH,GAE5C,GAAI/F,EACF,MAAMA,EAIR,IAAI4G,EAAOpI,KACP4P,EAAkBpM,EAAiBgE,cAAcD,GACjDsI,EAAsB/J,OAAOC,KAAK/F,MAAMgG,QAAO,SAAU8J,EAAK3M,GAEhE,OADA2M,EAAI3M,GAAOiF,EAAKjF,GACT2M,CACT,GAAG,CAAC,GAEAC,EAAkBjK,OAAOC,KAAK6J,GAAiB5J,QAAO,SACxDgK,EACA7M,GAEA,IAAI8M,OAA2C9P,IAAlB6P,EAAS7M,GAClC+M,OAA8C/P,IAAzByP,EAAgBzM,GAEzC,OAAI8M,IAA2BC,EACtBvL,EAAKqL,EAAU,CAAC7M,KAGrB+M,IACFF,EAAS7M,GAAOyM,EAAgBzM,IAG3B6M,EACT,GACAH,GAEA,OAAO,IAAI7P,KAAKmK,YAAY4F,EAC9B,EAQAI,UAAW,WACT,YAAkBhQ,IAAdH,KAAK8K,KACA9K,KAGFA,KAAK4K,QAAQ,EACtB,EAOAwF,4BAA6B,SAAU1D,GACrC,OAAOA,EAAkB2D,QAAU,CAAC,iBAAkB,WACxD,EAQArC,+BAAgC,SAAUtB,GACxC,OAAOA,EAAkBqB,WAAa,KACxC,EAQAuC,yBAA0B,SAAU5D,GAClC,OAAOA,EAAkBjD,UAAY,IACvC,EAQA8G,gCAAiC,SAAU7D,GACzC,MAAiD,mBAAtCA,EAAkB8D,iBACpB9D,EAAkB8D,eAG7B,EAOAvC,2BAA4B,SAAUwC,GACpC,OAAO/J,EAAK1G,KAAK6H,oBAAoB,SAAUpC,GAC7C,OAAOA,EAAEmE,OAAS6G,CACpB,GACF,EAOAC,+BAAgC,SAAUjF,GACxC,IAAKzL,KAAK2M,oBAAoBlB,GAC5B,MAAO,GAGT,IAAIkF,EAAa3Q,KAAK2J,0BAA0B8B,GAAW,GAC3D,IAAKkF,EAAY,MAAO,GAExB,IAAI5C,EAAY/N,KAAKgO,+BACnBhO,KAAKiO,2BAA2BxC,IAGlC,OADWkF,EAAWC,MAAM7C,GAChB/E,KAAI,SAAU6H,GACxB,OAAOA,EAAKC,MACd,GACF,EAEAC,SAAU,WACR,OAAOC,KAAKC,UAAUjR,KAAM,KAAM,EACpC,GAYFQ,EAAOC,QAAU+C,gCCppDjBhD,EAAOC,QASP,SAAuByQ,GACrB,OAAO,SAAkBC,EAAyBC,GAChD,IAAI1E,EAAoBwE,EAAMrJ,mBAAmBuJ,GAC7CC,EACDH,EAAM/I,8BAA8BuE,EAAkB9C,OACrDsH,EAAM/I,8BAA8BuE,EAAkB9C,MAAM,IAC9D,GACE0H,EACFJ,EAAMlD,+BAA+BtB,GACnC6E,EACFL,EAAMZ,yBAAyB5D,GAC7B8E,EACFN,EAAMX,gCAAgC7D,GACpC2D,EAASoB,EACXP,EAAMd,4BAA4B1D,IAGhCgF,EAAiBP,EAAwB/J,OAAM,SAAUuK,GAC3D,OAAOA,EAAYC,UACrB,IAEIC,EA4BR,SACExB,EACAiB,EACAC,EACAC,EACA9H,GAEA,OAAO,SACLoI,EACAX,EACAY,GAEA,IAAIC,EAASF,EAEb,GAAIC,EAA2B,EAAG,CAChC,IAAIE,EAAQ,EAIZ,IAFAD,EAASF,EAEFG,EAAQF,GAA0B,CAIvC,IAAIG,EAAOF,GAAUjQ,MAAMoF,QAAQ6K,EAAOE,MAAQF,EAAOE,KAAO,GAChEF,EAAStL,EAAKwL,GAAM,SAAUC,GAC5B,OAAOA,EAAQlN,SACjB,IACAgN,GACF,CACF,CAGA,GAAID,EAAQ,CAYV,IAAII,EAAStM,OAAOC,KAAKoL,EAAwBe,MAC9ClJ,KAAI,SAAUqJ,GACb,MAAO,CAACA,EAAYlB,EAAwBe,KAAKG,GACnD,IACCjM,QAAO,SAAUkM,GAEhB,OAiCV,SACED,EACAE,EACA7I,EACA4H,EACAC,EACAC,GAGA,GACED,IAC8C,IAA7Cc,EAAW5L,QAAQ8K,IAClBA,IAAyBc,GAE3B,OAAO,EAIT,OACId,IAC+C,IAA/Cc,EAAW5L,QAAQ6K,IAEpBC,GACCc,EAAWzB,MAAMU,GAAuB7P,OACtC8P,EAAqBX,MAAMU,GAAuB7P,SAClD,IAG4C,IAA/C4Q,EAAW5L,QAAQ6K,KACoC,IAAtD5H,EAAkBjD,QAAQ6K,IAEc,IAA1C5H,EAAkBjD,QAAQ4L,IAEkC,IAA3DA,EAAW5L,QAAQ8L,EAAajB,KAC9BE,GAC2C,IAA1Ca,EAAW5L,QAAQiD,GAE3B,CAtEiB8I,CADUF,EAAM,GAGrBN,EAAO5D,MAAQmD,EACf7H,EACA4H,EACAC,EACAC,EAEJ,IAEFQ,EAAOE,KAAOO,EACZL,EAAOpJ,KAAI,SAAUsJ,GACnB,IAAID,EAAaC,EAAM,GAGvB,OAyDV,SACEI,EACAL,EACAf,EACA5H,EACAkI,GAEA,IAAIe,EAAQN,EAAWzB,MAAMU,GAC7B,MAAO,CACL1H,KAAM+I,EAAMA,EAAMlR,OAAS,GAAGqP,OAC9B1C,KAAMiE,EACNO,aAAcC,EAAiBR,GAC/BS,MAAOJ,EACPzN,UACEyE,IAAsB2I,GAC4C,IAAlE3I,EAAkBjD,QAAQ4L,EAAaf,GACzCM,WAAYA,EACZM,KAAM,KAEV,CA5EiBa,CAFUT,EAAM,GAIrBD,EACAf,EACA0B,EAAmBtJ,GACnByH,EAAwBS,WAE5B,IACAvB,EAAO,GACPA,EAAO,GAEX,CAEA,OAAOyB,CACT,CACF,CA5GyBmB,CACnB5C,EACAiB,EACAC,EACAC,EACAH,GAGE6B,EAAU/B,EAQd,OANII,IACF2B,EAAU/B,EAAwBnP,MAChCuP,EAAqBX,MAAMU,GAAuB7P,SAI/CyR,EAAQlN,OAAO6L,EAAgB,CACpCjI,KAAMsH,EAAMrJ,mBAAmBuJ,GAAwBxH,KACvDkJ,MAAO,KACP7N,WAAW,EACXmJ,KAAM,KACNwE,aAAc,KACdhB,WAAYF,EACZQ,KAAM,MAEV,CACF,EAtDA,IAAIiB,EAAK,EAAQ,MACbzM,EAAO,EAAQ,OACf+K,EAAiC,EAAQ,MACzCgB,EAAU,EAAQ,OAClBI,EAAmBM,EAAGN,iBACtBG,EAAqBG,EAAGH,iDCP5B,IAAII,EAAU,EAAQ,OAClB3O,EAAe,EAAQ,OACvB0O,EAAK,EAAQ,MACbzM,EAAO,EAAQ,OACf2M,EAAY,EAAQ,OACpBC,EAAa,EAAQ,MACrB1M,EAAQ,EAAQ,OAChB6L,EAAU,EAAQ,OAClBI,EAAmBM,EAAGN,iBACtBG,EAAqBG,EAAGH,mBAExBC,EAA2B,EAAQ,OAgDvC,SAASM,EAAWC,GAClB,IAAIC,EAAU,CAAC,EAMf,OAJAD,EAAWnL,SAAQ,SAAUiD,EAAKoI,GAChCD,EAAQnI,GAAOoI,CACjB,IAEOD,CACT,CAEA,SAASE,EAAiBC,EAAMC,EAAY1Q,GACtC0Q,GAAcA,EAAW1Q,KAC3ByQ,EAAKE,MAAQD,EAAW1Q,GAE5B,CA6JA,SAASM,EAAcyN,EAAOgC,EAASa,GACrC,IAAIC,EAAkBd,EAAQ,GAE9BlT,KAAKiU,YAAcf,EAGnB,IAAI9K,EAAOpI,KAGX8F,OAAOC,KAAKiO,GAAiB3L,SAAQ,SAAUlF,GAC7CiF,EAAKjF,GAAO6Q,EAAgB7Q,EAC9B,IAGA2C,OAAOC,KAAKgO,GAAW,CAAC,GAAG1L,SAAQ,SAAUlF,GAC3CiF,EAAKjF,GAAO4Q,EAAQ5Q,EACtB,IA8IAnD,KAAKkU,iBAAmBhB,EAAQlN,QAAO,SAAUmO,EAAKC,GACpD,YAAmCjU,IAA5BiU,EAAOF,iBACVC,EACAA,EAAMC,EAAOF,gBACnB,GAAG,GAMHlU,KAAK4H,kBAAoB,GAKzB5H,KAAK6H,mBAAqBqJ,EAAMrJ,mBAAmBmB,KACjD,WACE,MAAO,EACT,IAMFhJ,KAAK2H,OAAS,GAEd,IAAIC,EAAoBsJ,EAAMjC,8BAE1BoF,EAAgBd,EAAWrC,EAAMvJ,QACjC2M,EAA2Bf,EAAWrC,EAAMtJ,mBAC5C2M,EAAwB,EAKxBC,EAAaR,EAAgBrM,QAAU,CAAC,EAE5C7B,OAAOC,KAAKyO,GAAYnM,SAAQ,SAAUoM,GACxC,IAnVF5M,EACA6M,EAkVMC,EAAmBH,EAAWC,GAE9B/H,GArVN7E,EAsVIqJ,EAAMrJ,mBArVV6M,EAsVID,EApVG/N,EACLmB,GACA,SAAkC6E,GAEhC,OADiBA,EAAkB8G,YAAc,IAC/B/M,QAAQiO,IAA8B,CAC1D,KAkVA,GAAIhI,EAAmB,CAGrB,IAAIkI,EAAalI,EAAkB8G,WAAW/M,QAAQgO,GAClDI,EAAmBxB,EAAUnC,EAAMrJ,oBAAoB,SAAUpC,GACnE,OAAOA,EAAEmE,OAAS8C,EAAkB9C,IACtC,IACAxB,EAAKP,mBAAmBgN,GAAkBD,GAAc,CACtD7P,UAAW0P,EACXvC,KAAMyC,EACN/C,WAAYoC,EAAgBc,sBAEhC,KAAO,CACL,IAEI9R,EAFA+R,GAAoE,IAA/C7D,EAAMtJ,kBAAkBnB,QAAQgO,GACrDO,GAAyD,IAApC9D,EAAMvJ,OAAOlB,QAAQgO,GAG1CM,IACF/R,EAAWsR,EAAyBG,GACpCrM,EAAKR,kBAAkB5E,GAAY,CACjC4G,KAAM6K,EACNvC,KAAMyC,EACN/C,WAAYoC,EAAgBc,uBAE9BnB,EACEvL,EAAKR,kBAAkB5E,GACvBgR,EAAgBiB,aAChBR,IAGAO,IACFhS,EAAWqR,EAAcI,GACzBrM,EAAKT,OAAO3E,GAAY,CACtB4G,KAAM6K,EACNvC,KAAMyC,EACN/C,WAAYoC,EAAgBc,uBAE9BnB,EACEvL,EAAKT,OAAO3E,GACZgR,EAAgBiB,aAChBR,GAGN,CACF,IAGAzU,KAAK6H,mBAAqBuL,EAAQpT,KAAK6H,oBAGvCD,EAAkBS,SAAQ,SAAU6M,GAClC,IAAId,EAASlB,EAAQqB,GACjB5M,EAASyM,GAAUA,EAAOzM,OAASyM,EAAOzM,OAAS,CAAC,EACpD+E,EAAoBwE,EAAMjD,2BAA2BiH,GAGzDpP,OAAOC,KAAK4B,GAAQU,SAAQ,SAAU8M,GACpC,IAEInS,EAFAoS,EAAezN,EAAOwN,GAI1B,GAAIzI,EAAmB,CACrB1J,EAAWqQ,EAAUnC,EAAMrJ,oBAAoB,SAAUpC,GACvD,OAAOA,EAAEmE,OAAS8C,EAAkB9C,IACtC,IACA,IAAIyL,EAAiBhC,EACnBjL,EAAKP,mBAAmB7E,IACxB,SAAUyC,GACR,OAAOA,EAAEV,YAAcoQ,CACzB,IAIF,IAAwB,IAApBE,EACF,OAGFjN,EAAKP,mBAAmB7E,GAAUqS,GAAgBnD,KAAOtL,EACvD,CAAC,EACDwB,EAAKP,mBAAmB7E,GAAUqS,GAAgBnD,KAClDkD,EAEJ,KAAO,CACLpS,EAAWsR,EAAyBa,GAEpC,IAAIG,EACDtB,EAAgBrM,QAAUqM,EAAgBrM,OAAOwN,IAAY,CAAC,EAEjE/M,EAAKR,kBAAkB5E,GAAY,CACjC4G,KAAMuL,EACNjD,KAAMzN,EAAa,CAAC,EAAG2Q,EAAcE,GACrC1D,WAAYwC,EAAOU,uBAErBnB,EACEvL,EAAKR,kBAAkB5E,GACvBoR,EAAOa,aACPE,GAGEjE,EAAMlJ,6BAA6BmN,IACrCjE,EAAMlJ,6BAA6BmN,GAAQ9M,SAAQ,SACjDhC,IAIG+B,EAAKR,kBAAkB5E,GAAUkP,KAAK7L,IACvC6K,EAAMlJ,6BAA6BmN,GAAQ1O,QACzCuM,EAAmB3M,KAChB,IAEL+B,EAAKR,kBAAkB5E,GAAUkP,KAAK7L,GAAmB,EAE7D,GAEJ,CACF,IACAkO,GACF,IAGArD,EAAM/B,+BAA+B9G,SAAQ,SAAUkN,GACrD,IAAI7I,EAAoBwE,EAAMjD,2BAA2BsH,GACrDxH,EAAYmD,EAAMlD,+BAA+BtB,GAEjDhD,EAAoBwH,EAAMvH,0BAA0B4L,GAIzB,IAA7B7L,EAAkBjI,QAClBiI,EAAkB,GAAGkH,MAAM7C,GAAWtM,OAAS,GAKjDyR,EAAQlR,MAAMuS,GAAuBlM,SAAQ,SAAU+L,GACrD,IAAIzM,EAASyM,GAAUA,EAAOzM,OAASyM,EAAOzM,OAAS,CAAC,EAExD7B,OAAOC,KAAK4B,GAAQU,SAAQ,SAAU8M,GACpC,IAAIC,EAAezN,EAAOwN,GACtBnS,EAAWqQ,EAAUnC,EAAMrJ,oBAAoB,SAAUpC,GAC3D,OAAOA,EAAEmE,OAAS8C,EAAkB9C,IACtC,IACIyL,EAAiBhC,EACnBjL,EAAKP,mBAAmB7E,IACxB,SAAUyC,GACR,OAAOA,EAAEV,YAAcoQ,CACzB,IAIF,IAAwB,IAApBE,EAAJ,CAYA,IAAIG,EAAc,CAAC,EAEnB,GAAI9L,EAAkBjI,OAAS,EAAG,CAChC,IAAIgU,EAAO/L,EAAkB,GAAGkH,MAAM7C,GAAW,GACjDyH,EAAYC,GACVrN,EAAKP,mBAAmB7E,GAAUqS,GAAgBnD,KAAKuD,EAC3D,CAEArN,EAAKP,mBAAmB7E,GAAUqS,GAAgBnD,KAAOzN,EACvD+Q,EACAJ,EACAhN,EAAKP,mBAAmB7E,GAAUqS,GAAgBnD,KArBpD,CAuBF,IAEAqC,GACF,GACF,IAGAzO,OAAOC,KAAKmL,EAAMnJ,gBAAgBM,SAAQ,SAAUoD,GAClD,IAAIiK,EAAWxE,EAAMnJ,eAAe0D,GAChCzI,EAAWqR,EAAc5I,GAE7BrD,EAAKT,OAAO3E,GAAY,CACtB4G,KAAM6B,EACNyG,KAAMsC,EAAW/I,GACjBmG,WAAYoC,EAAgBc,uBAE9BY,EAASrN,SAAQ,SAAUgK,GACzBjK,EAAKT,OAAO3E,GAAYoF,EAAKT,OAAO3E,IAAa,CAAE4G,KAAM6B,GACzDrD,EAAKT,OAAO3E,GAAUkP,KAAO9J,EAAKT,OAAO3E,GAAUkP,MAAQ,CAAC,EAC5D9J,EAAKT,OAAO3E,GAAUkP,KAAKG,GAAc,CAC3C,GACF,IAKArS,KAAK6H,mBAAqB7H,KAAK6H,mBAAmBmB,IAChDiK,EAAyB/B,IAM3BlR,KAAK2H,OAASyL,EAAQpT,KAAK2H,QAI3B3H,KAAK4H,kBAAoBwL,EAAQpT,KAAK4H,mBAEtC5H,KAAK2V,OAASzE,CAChB,CA2BA,SAAS0E,EAA6B1C,EAASnO,GAC7C,SAAS8Q,EAAUrM,GACjB,OAAOA,EAAMI,OAAS7E,CACxB,CAEA,GAAImO,EAAQyC,OAAOjK,mBAAmB3G,GAAY,CAChD,IAAIyE,EAAQ9C,EAAKwM,EAAQvL,OAAQkO,GACjC,OAAKrM,EAEE1D,OAAOC,KAAKyD,EAAM0I,MAAMlJ,KAAI,SAAUY,GAC3C,IAAI5E,EAAQ6N,EAAiBjJ,GAC7B,MAAO,CACLA,KAAMA,EACNgJ,aAAc5N,EACd8N,MAAOtJ,EAAM0I,KAAKtI,GAClB3E,UAAWiO,EAAQyC,OAAOnH,eAAezJ,EAAWC,GACpD8Q,WAAY5C,EAAQyC,OAAOlH,iBAAiB1J,EAAW6E,GAE3D,IAXmB,EAYrB,CAAO,GAAIsJ,EAAQyC,OAAO/J,mBAAmB7G,GAAY,CACvD,IAAImQ,EAAmBxO,EAAKwM,EAAQtL,kBAAmBiO,GACvD,OAAKX,EAEEpP,OAAOC,KAAKmP,EAAiBhD,MAAMlJ,KAAI,SAAUY,GACtD,IAAI5E,EAAQ6N,EAAiBjJ,GAC7B,MAAO,CACLA,KAAMA,EACNgJ,aAAc5N,EACd8N,MAAOoC,EAAiBhD,KAAKtI,GAC7B3E,UAAWiO,EAAQyC,OAAOjH,0BAA0B3J,EAAWC,GAEnE,IAV8B,EAWhC,CAAO,GAAIkO,EAAQyC,OAAOhJ,oBAAoB5H,GAAY,CACxD,IAAIgR,EAA0BrP,EAAKwM,EAAQrL,mBAAoBgO,GAC/D,IAAKE,EAAyB,OAAOA,EAErC,IAAIrJ,EACFwG,EAAQyC,OAAO1H,2BAA2BlJ,GACxCgJ,EACFmF,EAAQyC,OAAO3H,+BAA+BtB,GAC5ChD,EAAoBsJ,EACtBE,EAAQyC,OAAOhM,0BAA0B5E,GAAW,IAAM,IAGE,IAA1D2E,EAAkBjD,QAAQiG,EAAkBjD,YAC9CC,EAAoBA,EAAkBsM,QACpCtJ,EAAkBjD,SAAWsE,EAC7B,KAIJ,IAAIkI,EAAyBvM,EAAkBkH,MAAM7C,GAKrD,OAJAkI,EAAuBC,QAAQnR,GAE/BoR,EAAaJ,EAAyBE,EAAwB,GAEvDF,CACT,CAGF,CASA,SAASI,EAAaC,EAAM1M,EAAmB2M,GAC7CD,EAAKnR,UAAYmR,EAAKxM,OAASF,EAAkB2M,GAC7CD,EAAKlE,MACPkE,EAAKlE,KAAK7J,SAAQ,SAAUiO,GAC1BH,EAAaG,EAAO5M,EAAmB2M,EAAQ,EACjD,GAEJ,CAWA,SAASE,EAAQC,EAAQC,EAAMC,EAAOzE,GAGpC,GAFAA,EAAQA,GAAS,EAEblQ,MAAMoF,QAAQsP,GAChB,OAAOD,EAAOC,EAAMC,EAAMzE,IAG5B,IAAKwE,EAAKvE,MAA6B,IAArBuE,EAAKvE,KAAKzQ,OAC1B,OAAOgV,EAGT,IAAIE,EAAWF,EAAKvE,KAAKlJ,KAAI,SAAU4N,GACrC,OAAOL,EAAQC,EAAQI,EAAWF,EAAOzE,EAAQ,EACnD,IACI4E,EAAiBL,EAAOG,EAAUD,EAAMzE,IAE5C,OADcxN,EAAa,CAAEyN,KAAM2E,GAAkBJ,EAEvD,CA2MA,SAASK,EAAyB3Q,EAAWsF,GAC3C,IAAIyG,EAAOxL,EAAKP,GAAW,SAAUqD,GACnC,OAAOA,EAAMI,OAAS6B,CACxB,IACA,OAAOyG,GAAQA,EAAK4B,KACtB,CAwGA,SAASiD,EAAc7F,EAAOjQ,EAAM+V,EAAepN,EAAMqN,GACvD,IAAIzN,EAAQ9C,EAAKuQ,GAAe,SAAUxR,GACxC,OAAOA,EAAEmE,OAASoN,CACpB,IACIlE,EAAQtJ,GAASA,EAAM0I,MAAQ1I,EAAM0I,KAAKtI,GAAQJ,EAAM0I,KAAKtI,GAAQ,EACrEgI,EAAcpI,GAASA,EAAMoI,aAAe,EAEhD,MAAO,CACL3Q,KAAMA,EACN+V,cAAeA,EACfpN,KAAMA,EACNkJ,MAAOA,EACPlB,WAAYA,EAEhB,CAjcAnO,EAAc/C,UAAUwW,eAAiB,SAAUtN,GACjD,SAASiM,EAAUrM,GACjB,OAAOA,EAAMI,OAASA,CACxB,CAEA,OACElD,EAAK1G,KAAK2H,OAAQkO,IAClBnP,EAAK1G,KAAK4H,kBAAmBiO,IAC7BnP,EAAK1G,KAAK6H,mBAAoBgO,EAElC,EAmHApS,EAAc0T,aAAe,CAAC,iBAAkB,aAAc,YA+H9D1T,EAAc/C,UAAU0W,eAAiB,SAAUrS,EAAWlB,GAC5D,IAAIwT,EAAczB,EAA6B5V,KAAM+E,GACrD,GAAKsS,EAAL,CAIA,IASI7D,EATAO,EAAUtP,EAAa,CAAC,EAAGZ,EAAM,CACnCwM,OAAQ5M,EAAc0T,aAGtBG,gBAAiBzT,GAAQA,EAAKwM,UAI5B6C,EAAUlT,KAEd,GAAI+B,MAAMoF,QAAQkQ,GAChB7D,EAAa,CAACzO,QAGdyO,EADaN,EAAQyC,OAAO1H,2BAA2BoJ,EAAYzN,MAC/C4J,WAGtB,OAAO+C,GACL,SAAUrE,EAAMzG,GACd,GAAIsI,EAAQuD,cAAe,CACzB,IAAIA,EAnFZ,SAA0BpE,EAASnO,GACjC,OACEmO,EAAQqE,kBACRrE,EAAQqE,iBAAiBD,eACzBpE,EAAQqE,iBAAiBD,cAAcpR,QACvCgN,EAAQqE,iBAAiBD,cAAcpR,OAAOnB,EAElD,CA4E4ByS,CAAiBtE,EAASzH,GAC9C,GAAI6L,EACF,OAxIV,SAA8BD,EAAaC,GACzC,IAAIG,EAAgB,GAChBC,EAAkB,GAOlBC,GALQL,EAAcM,OAAS,IAKV5R,QAAO,SAAU8J,EAAKlG,EAAMtI,GAEnD,OADAwO,EAAIlG,GAAQtI,EACLwO,CACT,GAAG,CAAC,GAEJuH,EAAYhP,SAAQ,SAAU+N,GAE5B,IAAIxM,EAAOwM,EAAKhI,MAAQgI,EAAKxM,UACFzJ,IAAvBwX,EAAa/N,GACf6N,EAAcE,EAAa/N,IAASwM,EAEpCsB,EAAgBpV,KAAK8T,EAEzB,IAEAqB,EAAgBA,EAAcrR,QAAO,SAAUoD,GAC7C,OAAOA,CACT,IAEA,IACIqO,EADAC,EAAkBR,EAAcQ,gBAEpC,MAAwB,WAApBA,EACKL,GAEPI,EAD6B,UAApBC,EACE,CACT,CAAC,OAAQ,QACT,CAAC,MAAO,QAGC,CAAC,CAAC,SAAU,CAAC,SAGnBL,EAAcrS,OACnBqN,EAAQiF,EAAiBG,EAAS,GAAIA,EAAS,KAEnD,CA4FiBE,CAAqB7F,EAAMoF,EAEtC,CAEA,GAAIvV,MAAMoF,QAAQ4M,EAAQ1D,QAAS,CACjC,IAAIuH,EAAQtE,EAAWS,EAAQ1D,OAAQ5M,EAAc0T,cACrD,OAAO1E,EAAQP,EAAM0F,EAAM,GAAIA,EAAM,GACvC,CAAO,GAA8B,oBAAnB7D,EAAQ1D,OACxB,OAjKR,SAAuBuH,EAAO1F,GAC5B,OAAOA,EAAK9C,KAAKwI,EACnB,CA+JeI,CAAcjE,EAAQ1D,OAAQ6B,GAEvC,MAAM,IAAIvQ,MACR,oHAGJ,GACA0V,EACA7D,EAxCF,CA0CF,EAQA/P,EAAc/C,UAAUuX,cAAgB,SAAUlT,GAChD,OAAI/E,KAAK2V,OAAOjK,mBAAmB3G,GAC1B+R,EAAyB9W,KAAK2H,OAAQ5C,GACpC/E,KAAK2V,OAAO/J,mBAAmB7G,GACjC+R,EAAyB9W,KAAK4H,kBAAmB7C,QADnD,CAKT,EA+BAtB,EAAc/C,UAAUwX,eAAiB,WACvC,IAAIhH,EAAQlR,KAAK2V,OAEbzC,EAAUlT,KACVmY,EAAM,GAoEV,OAlEArS,OAAOC,KAAKmL,EAAMpJ,mBAAmBO,SAAQ,SAAU2O,GACrD9F,EAAMpJ,kBAAkBkP,GAAe3O,SAAQ,SAAUuB,GACvDuO,EAAI7V,KACFyU,EAAc7F,EAAO,QAAS8F,EAAepN,EAAMsJ,EAAQvL,QAE/D,GACF,IAEA7B,OAAOC,KAAKmL,EAAMnJ,gBAAgBM,SAAQ,SAAU2O,GAClD9F,EAAMnJ,eAAeiP,GAAe3O,SAAQ,SAAUuB,GACpDuO,EAAI7V,KACFyU,EAAc7F,EAAO,UAAW8F,EAAepN,EAAMsJ,EAAQvL,QAEjE,GACF,IAEA7B,OAAOC,KAAKmL,EAAMlJ,8BAA8BK,SAAQ,SACtD2O,GAEA9F,EAAMlJ,6BAA6BgP,GAAe3O,SAAQ,SAAUuB,GAClEuO,EAAI7V,KACFyU,EACE7F,EACA,cACA8F,EACApN,EACAsJ,EAAQtL,mBAGd,GACF,IAEA9B,OAAOC,KAAKmL,EAAM/I,+BAA+BE,SAAQ,SACvD2O,GAEA9F,EAAM/I,8BAA8B6O,GAAe3O,SAAQ,SAAUuB,GACnEuO,EAAI7V,KAuEV,SAAmC4O,EAAO8F,EAAepN,EAAMqN,GAC7D,IAAImB,EAAmBlH,EAAMjD,2BAA2B+I,GACpDjJ,EAAYmD,EAAMlD,+BAA+BoK,GACjDxH,EAAQhH,EAAKgH,MAAM7C,GACnBsK,EAAY3R,EAAKuQ,GAAe,SAAUzN,GAC5C,OAAOA,EAAMI,OAASoN,CACxB,IAEIxN,EAAQoH,EAAM5K,QAAO,SAAUsS,EAAmBzH,GACpD,IAAI0H,EACFD,GACA5R,EAAK4R,EAAkBpG,MAAM,SAAUzM,GACrC,OAAOA,EAAEmE,OAASiH,CACpB,IACF,YAAoB1Q,IAAboY,EAAyBA,EAAWD,CAC7C,GAAGD,GAECvF,EAAStJ,GAASA,EAAMsJ,OAAU,EAClClB,EAAcpI,GAASA,EAAMoI,aAAe,EAC5CxD,EAAQ5E,GAASA,EAAM4E,MAAS,GAEpC,MAAO,CACLnN,KAAM,eACN+V,cAAeA,EACfpN,KAAMwE,EACN0E,MAAOA,EACPlB,WAAYA,EAEhB,CAlGQjI,CACEuH,EACA8F,EACApN,EACAsJ,EAAQrL,oBAGd,GACF,IAEA/B,OAAOC,KAAKmL,EAAMjJ,oBAAoBI,SAAQ,SAAU2O,GACtD,IAAI9N,EAAYgI,EAAMjJ,mBAAmB+O,GACzClR,OAAOC,KAAKmD,GAAWb,SAAQ,SAAUc,GACvCD,EAAUC,GAAUd,SAAQ,SAAUrD,GACpCmT,EAAI7V,KAAK,CACPrB,KAAM,UACN+V,cAAeA,EACfpN,KAAM5E,EACNwT,aAAcxT,EACdmE,SAAUA,GAEd,GACF,GACF,IAEA+H,EAAMhJ,eAAeG,SAAQ,SAAUuB,GACrCuO,EAAI7V,KAAK,CAAErB,KAAM,MAAO+V,cAAe,QAASpN,KAAMA,GACxD,IAEOuO,CACT,EAsEA3X,EAAOC,QAAUgD,gCCxnCjB,IAAI1D,EAAe,EAAQ,OAEvBgE,EAAgB,EAAQ,OACxB8O,EAAmB,yBACnBzO,EAAW,EAAQ,OACnBwC,EAAQ,EAAQ,OAChBlC,EAAgB,EAAQ,OACxBC,EAAO,EAAQ,OACf8T,EAAiB,EAAQ,OACzBjV,EAAmB,EAAQ,OAC3BC,EAAgB,EAAQ,OACxBK,EAAU,EAAQ,OAyGtB,SAASP,EAAoBI,EAAQC,EAAOmQ,GACJ,oBAA3BpQ,EAAO+U,iBAChB/U,EAAO+U,gBAAgB,cAAgB5U,EAAU,KAGnD9D,KAAK2Y,UAAUhV,GACf,IAAIE,EAAOkQ,GAAW,CAAC,EACvBlQ,EAAKD,MAAQA,EACb5D,KAAKkR,MAAQ1N,EAAiB8F,KAAKzF,GACnC7D,KAAKmE,YAAc,KACnBnE,KAAK4Y,SAAW,EAChB5Y,KAAK6Y,sBAAwB,EAC7B7Y,KAAK8Y,eAAiB,GACtB9Y,KAAK+Y,kBAAoB,CAC3B,CAszBA,SAASC,EAAelO,GACtB,GAAIA,EAAO,EAAG,MAAM,IAAInJ,MAAM,2BAO9B,OALA3B,KAAKiZ,QAAQ,CACX/H,MAAOlR,KAAKkR,MAAMtG,QAAQE,GAC1BoO,aAAa,IAGRlZ,IACT,CA8MA,SAASmZ,IACP,OAAOnZ,KAAKkR,MAAMpG,IACpB,CA7gCA1G,EAASb,EAAqBxD,GAa9BwD,EAAoB7C,UAAU0Y,OAAS,WAErC,OADApZ,KAAKqZ,QAAQ,CAAEC,wBAAwB,IAChCtZ,IACT,EAEAuD,EAAoB7C,UAAU6Y,6BAA+B,WAE3D,OADAvZ,KAAKqZ,QAAQ,CAAEC,wBAAwB,IAChCtZ,IACT,EAOAuD,EAAoB7C,UAAU8Y,SAAW,WACvC,IAAItI,EAAQlR,KAAKkR,MACjB,OAAOuH,EAAegB,qBAAqBvI,EAC7C,EAsCA3N,EAAoB7C,UAAUgZ,WAAa,SAAU3F,EAAS4F,GAC5D,IAAIC,EAAa7F,EAEb/T,KAAKkR,MAAM5G,mBAAmByJ,GAD9B/T,KAAKkR,MAEL2I,EAAUpB,EAAeqB,YAAYF,EAAUhW,MAAOgW,GAEtDxR,EAAOpI,KAQX,GANAA,KAAK+Y,oBAEL/Y,KAAKgB,KAAK,aAAc,CACtBkQ,MAAO0I,KAGLD,EAuBJ,OAAO3Z,KAAK2D,OAAOyV,OAAOS,GAASE,MACjC,SAAUC,GAGR,OAFA5R,EAAK2Q,oBAC0B,IAA3B3Q,EAAK2Q,mBAAyB3Q,EAAKpH,KAAK,oBACrC,CACLgZ,QAAS,IAAIvW,EAAcmW,EAAWI,EAAQ9G,SAC9ChC,MAAO0I,EACPK,kBAAmBD,EAEvB,IACA,SAAUE,GAGR,MAFA9R,EAAK2Q,oBAC0B,IAA3B3Q,EAAK2Q,mBAAyB3Q,EAAKpH,KAAK,oBACtCkZ,CACR,IApCAla,KAAK2D,OACFyV,OAAOS,GACPE,MAAK,SAAUC,GACd5R,EAAK2Q,oBAC0B,IAA3B3Q,EAAK2Q,mBACP3Q,EAAKpH,KAAK,oBAGZ2Y,EAAG,KAAM,IAAIlW,EAAcmW,EAAWI,EAAQ9G,SAAU0G,EAC1D,IACCO,OAAM,SAAUvY,GACfwG,EAAK2Q,oBAC0B,IAA3B3Q,EAAK2Q,mBACP3Q,EAAKpH,KAAK,oBAGZ2Y,EAAG/X,EAAK,KAAMgY,EAChB,GAqBN,EAaArW,EAAoB7C,UAAU0Z,YAAc,SAAUrG,GAEpDvR,QAAQkF,KAAK,yDACb,IAAIwJ,EAAQlR,KAAKkR,MACbmJ,EAAgBra,KAAK8Y,eAAe,GACxC,IAAKuB,EACH,OAAOC,QAAQC,QAAQ,IAEzB,IAAIC,EAAeH,EAAc9V,iBAAiB2M,GAC9CgB,EAAOtL,EACT,CACE6T,wBAAyB1G,EAAQ0G,wBACjCC,OAAQ3G,EAAQ2G,QAElB,CACEnT,OAAQ5C,EAAK8T,EAAegB,qBAAqBe,GAAe,CAC9D,sBACA,cACA,+BACA,0BAKFG,EACF,8GACF,GAAqC,oBAA1B3a,KAAK2D,OAAOiX,UACrB,MAAM,IAAIjZ,MAAMgZ,GAElB,IAAI/W,EAAQ5D,KAAK2D,OAAOiX,UAAUJ,EAAa5W,OAC/C,GAAiC,oBAAtBA,EAAMwW,YACf,MAAM,IAAIzY,MAAMgZ,GAElB,OAAO/W,EAAMwW,YAAYI,EAAa7P,MAAOoJ,EAAQ8G,eAAgB3I,EACvE,EAoCA3O,EAAoB7C,UAAUoa,qBAAuB,SACnDtR,EACAmB,EACAoQ,EACAC,GAEA,IAAIC,EAA4D,oBAArCjb,KAAK2D,OAAOmX,qBACnCI,EAAsD,oBAA1Blb,KAAK2D,OAAOiX,UAC5C,IACGK,IACAC,GAC6B,oBAAvBlb,KAAK2D,OAAOyV,OAEnB,MAAM,IAAIzX,MACR,yKAIJ,IAAIuP,EAAQlR,KAAKkR,MAAM5G,mBAAmB0Q,GAAa,CAAC,GACpDG,EAAgBjK,EAAMtF,mBAAmBpC,GACzC4R,EAAe3C,EAAe4C,uBAChC7R,EACAmB,EACAoQ,EACA7J,GAGFlR,KAAK+Y,oBAEL,IACIuC,EADAlT,EAAOpI,KAoCX,OAjCIib,EACFK,EAA8Btb,KAAK2D,OAAOmX,qBAAqB,CAC7D,CAAES,UAAWrK,EAAMtN,MAAO2D,OAAQ6T,KAG3BF,EACTI,EAA8Btb,KAAK2D,OAChCiX,UAAU1J,EAAMtN,OAChBkX,qBAAqBM,WAIjBA,EAAa3P,UACpB6P,EAA8Btb,KAAK2D,OAChCyV,OAAO,CACN,CACEnY,KAAM,QACNuI,MAAOA,EACP+R,UAAWrK,EAAMtN,MACjB2D,OAAQ6T,KAGXrB,MAAK,SAAyByB,GAC7B,OAAOA,EAAStI,QAAQ,EAC1B,KAGJlT,KAAKgB,KAAK,uBAAwB,CAChCkQ,MAAOA,EACP1H,MAAOA,EACPmB,MAAOA,IAGF2Q,EAA4BvB,MACjC,SAAsBC,GAapB,OAZA5R,EAAK2Q,oBAC0B,IAA3B3Q,EAAK2Q,mBAAyB3Q,EAAKpH,KAAK,qBAE5CgZ,EAAUjY,MAAMoF,QAAQ6S,GAAWA,EAAQ,GAAKA,GAExCyB,UAAUpT,SAAQ,SAAU5C,GAClCA,EAAEmN,aAAeC,EAAiBpN,EAAET,OACpCS,EAAER,UAAYkW,EACVjK,EAAMxC,0BAA0BlF,EAAO/D,EAAEmN,cACzC1B,EAAM1C,eAAehF,EAAO/D,EAAEmN,aACpC,IAEOoH,CACT,IACA,SAAUE,GAGR,MAFA9R,EAAK2Q,oBAC0B,IAA3B3Q,EAAK2Q,mBAAyB3Q,EAAKpH,KAAK,oBACtCkZ,CACR,GAEJ,EAWA3W,EAAoB7C,UAAU+J,SAAW,SAAUiR,GAMjD,OALA1b,KAAKiZ,QAAQ,CACX/H,MAAOlR,KAAKkR,MAAMf,YAAY1F,SAASiR,GACvCxC,aAAa,IAGRlZ,IACT,EAyBAuD,EAAoB7C,UAAUmJ,iBAAmB,SAAUD,GAMzD,OALA5J,KAAKiZ,QAAQ,CACX/H,MAAOlR,KAAKkR,MAAMf,YAAYtG,iBAAiBD,GAC/CsP,aAAa,IAGRlZ,IACT,EAUAuD,EAAoB7C,UAAU6J,UAAY,WAMxC,OALAvK,KAAKiZ,QAAQ,CACX/H,MAAOlR,KAAKkR,MAAMf,YAAY5F,YAC9B2O,aAAa,IAGRlZ,IACT,EAaAuD,EAAoB7C,UAAUoM,8BAAgC,SAC5DtD,EACAxE,GAOA,OALAhF,KAAKiZ,QAAQ,CACX/H,MAAOlR,KAAKkR,MAAMf,YAAYrD,8BAA8BtD,EAAOxE,GACnEkU,aAAa,IAGRlZ,IACT,EAMAuD,EAAoB7C,UAAUib,qBAAuB,WACnD,OAAO3b,KAAK8M,8BAA8B7K,MAAMjC,KAAM0B,UACxD,EAeA6B,EAAoB7C,UAAUyN,+BAAiC,SAC7D3E,EACA4E,GAOA,OALApO,KAAKiZ,QAAQ,CACX/H,MAAOlR,KAAKkR,MAAMf,YAAYhC,+BAA+B3E,EAAO4E,GACpE8K,aAAa,IAGRlZ,IACT,EAcAuD,EAAoB7C,UAAU2K,qBAAuB,SACnDtG,EACAoE,EACAnE,GASA,OAPAhF,KAAKiZ,QAAQ,CACX/H,MAAOlR,KAAKkR,MACTf,YACA9E,qBAAqBtG,EAAWoE,EAAUnE,GAC7CkU,aAAa,IAGRlZ,IACT,EAaAuD,EAAoB7C,UAAUkM,mBAAqB,SAAUpD,EAAOxE,GAMlE,OALAhF,KAAKiZ,QAAQ,CACX/H,MAAOlR,KAAKkR,MAAMf,YAAYvD,mBAAmBpD,EAAOxE,GACxDkU,aAAa,IAGRlZ,IACT,EAMAuD,EAAoB7C,UAAUkb,UAAY,WACxC,OAAO5b,KAAK4M,mBAAmB3K,MAAMjC,KAAM0B,UAC7C,EAaA6B,EAAoB7C,UAAUmb,kBAAoB,SAAUrS,EAAOxE,GAMjE,OALAhF,KAAKiZ,QAAQ,CACX/H,MAAOlR,KAAKkR,MAAMf,YAAYtD,qBAAqBrD,EAAOxE,GAC1DkU,aAAa,IAGRlZ,IACT,EAMAuD,EAAoB7C,UAAUob,WAAa,WACzC,OAAO9b,KAAK6b,kBAAkB5Z,MAAMjC,KAAM0B,UAC5C,EAYA6B,EAAoB7C,UAAUqb,OAAS,SAAU/O,GAM/C,OALAhN,KAAKiZ,QAAQ,CACX/H,MAAOlR,KAAKkR,MAAMf,YAAYpD,iBAAiBC,GAC/CkM,aAAa,IAGRlZ,IACT,EAoBAuD,EAAoB7C,UAAUoL,wBAA0B,SACtD/G,EACAoE,EACAnE,GASA,OAPAhF,KAAKiZ,QAAQ,CACX/H,MAAOlR,KAAKkR,MACTf,YACArE,wBAAwB/G,EAAWoE,EAAUnE,GAChDkU,aAAa,IAGRlZ,IACT,EAgBAuD,EAAoB7C,UAAU8M,iCAAmC,SAC/DhE,EACAxE,GASA,OAPAhF,KAAKiZ,QAAQ,CACX/H,MAAOlR,KAAKkR,MACTf,YACA3C,iCAAiChE,EAAOxE,GAC3CkU,aAAa,IAGRlZ,IACT,EAMAuD,EAAoB7C,UAAUsb,wBAA0B,WACtD,OAAOhc,KAAKwN,iCAAiCvL,MAAMjC,KAAM0B,UAC3D,EAUA6B,EAAoB7C,UAAU4N,kCAAoC,SAChE9E,GAOA,OALAxJ,KAAKiZ,QAAQ,CACX/H,MAAOlR,KAAKkR,MAAMf,YAAY7B,kCAAkC9E,GAChE0P,aAAa,IAGRlZ,IACT,EAgBAuD,EAAoB7C,UAAU4M,sBAAwB,SAAU9D,EAAOxE,GAMrE,OALAhF,KAAKiZ,QAAQ,CACX/H,MAAOlR,KAAKkR,MAAMf,YAAY7C,sBAAsB9D,EAAOxE,GAC3DkU,aAAa,IAGRlZ,IACT,EAMAuD,EAAoB7C,UAAUub,aAAe,WAC3C,OAAOjc,KAAKsN,sBAAsBrL,MAAMjC,KAAM0B,UAChD,EAgBA6B,EAAoB7C,UAAUwb,qBAAuB,SAAU1S,EAAOxE,GAMpE,OALAhF,KAAKiZ,QAAQ,CACX/H,MAAOlR,KAAKkR,MAAMf,YAAY5C,wBAAwB/D,EAAOxE,GAC7DkU,aAAa,IAGRlZ,IACT,EAMAuD,EAAoB7C,UAAUyb,cAAgB,WAC5C,OAAOnc,KAAKkc,qBAAqBja,MAAMjC,KAAM0B,UAC/C,EAYA6B,EAAoB7C,UAAU0b,UAAY,SAAUpP,GAMlD,OALAhN,KAAKiZ,QAAQ,CACX/H,MAAOlR,KAAKkR,MAAMf,YAAY1C,oBAAoBT,GAClDkM,aAAa,IAGRlZ,IACT,EAaAuD,EAAoB7C,UAAU2b,qBAAuB,SAAU7S,EAAOxE,GAMpE,OALAhF,KAAKiZ,QAAQ,CACX/H,MAAOlR,KAAKkR,MAAMf,YAAYrC,6BAA6BtE,EAAOxE,GAClEkU,aAAa,IAGRlZ,IACT,EAMAuD,EAAoB7C,UAAU4b,cAAgB,WAC5C,OAAOtc,KAAKqc,qBAAqBpa,MAAMjC,KAAM0B,UAC/C,EAiBA6B,EAAoB7C,UAAUgF,iBAAmB,SAAU8D,EAAOxE,GAChE,OAAOhF,KAAK2N,sBAAsBnE,EAAOxE,EAC3C,EAgBAzB,EAAoB7C,UAAUiN,sBAAwB,SAAUnE,EAAOxE,GAMrE,OALAhF,KAAKiZ,QAAQ,CACX/H,MAAOlR,KAAKkR,MAAMf,YAAYxC,sBAAsBnE,EAAOxE,GAC3DkU,aAAa,IAGRlZ,IACT,EAMAuD,EAAoB7C,UAAU6b,aAAe,WAC3C,OAAOvc,KAAK2N,sBAAsB1L,MAAMjC,KAAM0B,UAChD,EAYA6B,EAAoB7C,UAAU8b,UAAY,SAAUxP,GAMlD,OALAhN,KAAKiZ,QAAQ,CACX/H,MAAOlR,KAAKkR,MAAMf,YAAY5B,oBAAoBvB,GAClDkM,aAAa,IAGRlZ,IACT,EAWAuD,EAAoB7C,UAAU+b,SAAW,WACvC,IAAI3R,EAAO9K,KAAKkR,MAAMpG,MAAQ,EAC9B,OAAO9K,KAAK4K,QAAQE,EAAO,EAC7B,EAWAvH,EAAoB7C,UAAUgc,aAAe,WAC3C,IAAI5R,EAAO9K,KAAKkR,MAAMpG,MAAQ,EAC9B,OAAO9K,KAAK4K,QAAQE,EAAO,EAC7B,EA4BAvH,EAAoB7C,UAAUsY,eAAiBA,EAU/CzV,EAAoB7C,UAAUkK,QAAUoO,EAWxCzV,EAAoB7C,UAAU8J,SAAW,SAAUZ,GAMjD,OALA5J,KAAKiZ,QAAQ,CACX/H,MAAOlR,KAAKkR,MAAMf,YAAY3F,SAASZ,GACvCsP,aAAa,IAGRlZ,IACT,EAmBAuD,EAAoB7C,UAAUgP,kBAAoB,SAAUC,EAAW3K,GAMrE,OALAhF,KAAKiZ,QAAQ,CACX/H,MAAOlR,KAAKkR,MAAMf,YAAYT,kBAAkBC,EAAW3K,GAC3DkU,aAAa,IAGRlZ,IACT,EASAuD,EAAoB7C,UAAUic,SAAW,SAAUC,GAMjD,OALA5c,KAAKiZ,QAAQ,CACX/H,MAAO1N,EAAiB8F,KAAKsT,GAC7B1D,aAAa,IAGRlZ,IACT,EAmBAuD,EAAoB7C,UAAUmc,0CAC5B,SAAUD,GAER,OADA5c,KAAKkR,MAAQ,IAAI1N,EAAiBoZ,GAC3B5c,IACT,EAyBFuD,EAAoB7C,UAAUoc,eAAiB,SAAU/X,GACvD,QAAIL,EAAc1E,KAAKkR,MAAMhF,sBAAsBnH,MAExC/E,KAAKkR,MAAMxF,mBAAmB3G,GAChC/E,KAAKkR,MAAM1C,eAAezJ,GACxB/E,KAAKkR,MAAMtF,mBAAmB7G,GAChC/E,KAAKkR,MAAMxC,0BAA0B3J,KACnC/E,KAAKkR,MAAMvE,oBAAoB5H,IACjC/E,KAAKkR,MAAM7C,2BAA2BtJ,GASjD,EAqBAxB,EAAoB7C,UAAUoV,WAAa,SAAUtM,EAAOxE,GAC1D,OAAOhF,KAAKkR,MAAMzC,iBAAiBjF,EAAOxE,EAC5C,EAMAzB,EAAoB7C,UAAUqc,qBAAuB,SAAUvT,EAAOxE,GACpE,OAAOhF,KAAKkR,MAAMxC,0BAA0BlF,EAAOxE,EACrD,EAOAzB,EAAoB7C,UAAUsc,OAAS,SAAUhQ,GAC/C,OAAOhN,KAAKkR,MAAMjE,aAAaD,EACjC,EAMAzJ,EAAoB7C,UAAUuM,aAAe,WAC3C,OAAOjN,KAAKid,kBAAkBhb,MAAMjC,KAAM0B,UAC5C,EASA6B,EAAoB7C,UAAUwc,SAAW,WACvC,OAAOld,KAAKkR,MAAMtN,KACpB,EAWAL,EAAoB7C,UAAUyY,eAAiBA,EAM/C5V,EAAoB7C,UAAUyc,QAAUhE,EAOxC5V,EAAoB7C,UAAU0c,QAAU,WACtC,OAAOpd,KAAKkR,MAAMhJ,cACpB,EA8CA3E,EAAoB7C,UAAUwX,eAAiB,SAAUzM,GACvD,IAAIkD,EAAc,GAElB,GAAI3O,KAAKkR,MAAMxF,mBAAmBD,GACVzL,KAAKkR,MAAM1F,0BAA0BC,GAE3CpD,SAAQ,SAAUgV,GAChC1O,EAAYrM,KAAK,CACf0C,MAAOqY,EACPpc,KAAM,eAEV,IAEyBjB,KAAKkR,MAAMrF,sBAAsBJ,GAEvCpD,SAAQ,SAAUgV,GACnC1O,EAAYrM,KAAK,CACf0C,MAAOqY,EACPpc,KAAM,WAEV,SACK,GAAIjB,KAAKkR,MAAMtF,mBAAmBH,GAAY,CAEjDzL,KAAKkR,MAAMvF,0BAA0BF,GAEhBpD,SAAQ,SAAUgV,GACvC1O,EAAYrM,KAAK,CACf0C,MAAOqY,EACPpc,KAAM,eAEV,GACF,CAEA,IAAIgH,EAAqBjI,KAAKkR,MAAMhF,sBAAsBT,GAY1D,OAVA3F,OAAOC,KAAKkC,GAAoBI,SAAQ,SAAUc,GAChD,IAAInE,EAAQiD,EAAmBkB,GAE/BwF,EAAYrM,KAAK,CACf0C,MAAOA,EACPmE,SAAUA,EACVlI,KAAM,WAEV,IAEO0N,CACT,EAQApL,EAAoB7C,UAAUyL,qBAAuB,SACnDpH,EACAoE,GAEA,OAAOnJ,KAAKkR,MAAM/E,qBAAqBpH,EAAWoE,EACpD,EAOA5F,EAAoB7C,UAAUgQ,+BAAiC,SAC7DjF,GAEA,OAAOzL,KAAKkR,MAAMR,+BAA+BjF,EACnD,EAcAlI,EAAoB7C,UAAU2Y,QAAU,SAAUtF,GAChD,IAAI7C,EAAQlR,KAAKkR,MACboM,EAAS,GACTC,EAAc,GAEbxJ,EAAQuF,yBACXiE,EAAc9E,EAAeqB,YAAY5I,EAAMtN,MAAOsN,GAEtDoM,EAAOhb,KAAK,CACV4O,MAAOA,EACPsM,aAAcD,EAAY9b,OAC1Bgc,OAAQzd,OAGVA,KAAKgB,KAAK,SAAU,CAClBkQ,MAAOA,EACPgC,QAASlT,KAAKmE,eAIlB,IAAIuZ,EAAiB1d,KAAK8Y,eAAe9P,KAAI,SAAUqR,GACrD,IAAIG,EAAeH,EAAc9V,iBAAiB2M,GAC9CyM,EAAsBnD,EAAa5W,MACnC6U,EAAeqB,YAAYU,EAAa5W,MAAO4W,GAC/C,GAaJ,OAXA8C,EAAOhb,KAAK,CACV4O,MAAOsJ,EACPgD,aAAcG,EAAoBlc,OAClCgc,OAAQpD,IAGVA,EAAcrZ,KAAK,SAAU,CAC3BkQ,MAAOsJ,EACPtH,QAASmH,EAAclW,cAGlBwZ,CACT,IAEI9D,EAAU9X,MAAMrB,UAAU0E,OAAOnD,MAAMsb,EAAaG,GAEpDE,EAAU5d,KAAK4Y,WAGnB,GAFA5Y,KAAK+Y,qBAEAc,EAAQpY,OACX,OAAO6Y,QAAQC,QAAQ,CAAErH,QAAS,KAAM6G,KACtC/Z,KAAK6d,yBAAyBC,KAAK9d,KAAMsd,EAAQM,IAIrD,IACE5d,KAAK2D,OACFyV,OAAOS,GACPE,KAAK/Z,KAAK6d,yBAAyBC,KAAK9d,KAAMsd,EAAQM,IACtDzD,MAAMna,KAAK+d,sBAAsBD,KAAK9d,KAAM4d,GACjD,CAAE,MAAOpc,GAEPxB,KAAKgB,KAAK,QAAS,CACjBQ,MAAOA,GAEX,CAGF,EAYA+B,EAAoB7C,UAAUmd,yBAA2B,SACvDP,EACAM,EACA5D,GAIA,KAAI4D,EAAU5d,KAAK6Y,sBAAnB,CAKA7Y,KAAK+Y,mBAAqB6E,EAAU5d,KAAK6Y,qBACzC7Y,KAAK6Y,qBAAuB+E,EAEG,IAA3B5d,KAAK+Y,mBAAyB/Y,KAAKgB,KAAK,oBAE5C,IAAIkS,EAAU8G,EAAQ9G,QAAQlR,QAE9Bsb,EAAOjV,SAAQ,SAAU2V,GACvB,IAAI9M,EAAQ8M,EAAE9M,MACVsM,EAAeQ,EAAER,aACjBC,EAASO,EAAEP,OACXQ,EAAkB/K,EAAQjQ,OAAO,EAAGua,GAEnCtM,EAAMtN,OAQX6Z,EAAOtZ,YAAc,IAAIV,EAAcyN,EAAO+M,GAE9CR,EAAOzc,KAAK,SAAU,CACpBkS,QAASuK,EAAOtZ,YAChB+M,MAAOA,KAXPuM,EAAOzc,KAAK,SAAU,CACpBkS,QAAS,KACThC,MAAOA,GAWb,GA7BA,CA8BF,EAEA3N,EAAoB7C,UAAUqd,sBAAwB,SACpDH,EACApc,GAEIoc,EAAU5d,KAAK6Y,uBAKnB7Y,KAAK+Y,mBAAqB6E,EAAU5d,KAAK6Y,qBACzC7Y,KAAK6Y,qBAAuB+E,EAE5B5d,KAAKgB,KAAK,QAAS,CACjBQ,MAAOA,IAGsB,IAA3BxB,KAAK+Y,mBAAyB/Y,KAAKgB,KAAK,oBAC9C,EAEAuC,EAAoB7C,UAAUwd,mBAAqB,SACjDvT,EACAwT,EACAjU,EACAD,GAEA,OACEU,GACwB,IAAxBwT,EAAa1c,QACa,IAA1ByI,EAAezI,QACO,IAAtBwI,EAAWxI,MAEf,EAQA8B,EAAoB7C,UAAU0d,2BAA6B,SAAU5U,GACnE,OACExJ,KAAKkR,MAAMmN,uBAAuB7U,IAClCxJ,KAAKkR,MAAMmN,uBAAuB7U,GAAO/H,OAAS,CAEtD,EAEA8B,EAAoB7C,UAAUuY,QAAU,SAAUqF,GAChD,IAAIpN,EAAQoN,EAAMpN,MACdgI,EAAcoF,EAAMpF,YAEpBhI,IAAUlR,KAAKkR,QACjBlR,KAAKkR,MAAQA,EAEblR,KAAKgB,KAAK,SAAU,CAClBkQ,MAAOlR,KAAKkR,MACZgC,QAASlT,KAAKmE,YACd+U,YAAaA,IAGnB,EAMA3V,EAAoB7C,UAAU6d,WAAa,WAEzC,OADIve,KAAK2D,OAAO4a,YAAYve,KAAK2D,OAAO4a,aACjCve,IACT,EAQAuD,EAAoB7C,UAAUiY,UAAY,SAAU6F,GAClD,OAAIxe,KAAK2D,SAAW6a,IAEqB,oBAA9BA,EAAU9F,iBACnB8F,EAAU9F,gBAAgB,cAAgB5U,EAAU,KAEtD9D,KAAK2D,OAAS6a,GALwBxe,IAQxC,EAMAuD,EAAoB7C,UAAU+d,UAAY,WACxC,OAAOze,KAAK2D,MACd,EAqBAJ,EAAoB7C,UAAUge,OAAS,SAAUza,GAC/C,IAAIoW,EAAgB,IAAItW,EAAc/D,KAAMiE,GAE5C,OADAjE,KAAK8Y,eAAexW,KAAK+X,GAClBA,CACT,EAUA9W,EAAoB7C,UAAU4D,oBAAsB,SAAU+V,GAC5D,IAAIsE,EAAM3e,KAAK8Y,eAAerS,QAAQ4T,GACtC,IAAa,IAATsE,EAAY,MAAM,IAAIhd,MAAM,mCAChC3B,KAAK8Y,eAAe7V,OAAO0b,EAAK,EAClC,EAMApb,EAAoB7C,UAAUke,mBAAqB,WACjD,OAAO5e,KAAK+Y,kBAAoB,CAClC,EAkBAvY,EAAOC,QAAU8C,0BC7jDjB/C,EAAOC,QAAU,SAAiBoO,GAChC,OAAK9M,MAAMoF,QAAQ0H,GAIZA,EAAMzI,OAAOG,SAHX,EAIX,0BCJA/F,EAAOC,QAAU,WAGf,OAFcsB,MAAMrB,UAAUsB,MAAMF,KAAKJ,WAE1Bmd,aAAY,SAAU/O,EAAKgP,GAWxC,OAVAhZ,OAAOC,KAAKD,OAAOgZ,IAASzW,SAAQ,SAAUlF,QACxBhD,IAAhB2e,EAAO3b,UAGMhD,IAAb2P,EAAI3M,WAEC2M,EAAI3M,GAEb2M,EAAI3M,GAAO2b,EAAO3b,GACpB,IACO2M,CACT,GAAG,CAAC,EACN,yBCMAtP,EAAOC,QAAU,CACfoS,iBAnBF,SAA0B7N,GACxB,MAAqB,kBAAVA,EAA2BA,EAE/B+Z,OAAO/Z,GAAOgR,QAAQ,KAAM,MACrC,EAgBEhD,mBARF,SAA4BhO,GAC1B,MAAqB,kBAAVA,EAA2BA,EAE/BA,EAAMgR,QAAQ,OAAQ,IAC/B,2BCrBAxV,EAAOC,QAAU,SAAcoO,EAAOmQ,GACpC,GAAKjd,MAAMoF,QAAQ0H,GAInB,IAAK,IAAIvN,EAAI,EAAGA,EAAIuN,EAAMpN,OAAQH,IAChC,GAAI0d,EAAWnQ,EAAMvN,IACnB,OAAOuN,EAAMvN,EAKnB,0BCZAd,EAAOC,QAAU,SAAcoO,EAAOmQ,GACpC,IAAKjd,MAAMoF,QAAQ0H,GACjB,OAAQ,EAGV,IAAK,IAAIvN,EAAI,EAAGA,EAAIuN,EAAMpN,OAAQH,IAChC,GAAI0d,EAAWnQ,EAAMvN,IACnB,OAAOA,EAGX,OAAQ,CACV,+BCZA,IAAIoF,EAAO,EAAQ,OAQnBlG,EAAOC,QAAU,SAAoB4P,EAAQ4O,GAC3C,IAAIC,GAAuBD,GAAY,IAAIjW,KAAI,SAAUoG,GACvD,OAAOA,EAAKwB,MAAM,IACpB,IAEA,OAAOP,EAAOrK,QACZ,SAA0BmZ,EAAK/P,GAC7B,IAAIgQ,EAAkBhQ,EAAKwB,MAAM,KAE7ByO,EAAkB3Y,EACpBwY,GACA,SAAUI,GACR,OAAOA,EAAmB,KAAOF,EAAgB,EACnD,IAGF,OAAIA,EAAgB3d,OAAS,IAAM4d,GACjCF,EAAI,GAAG7c,KAAK8c,EAAgB,IAC5BD,EAAI,GAAG7c,KAAK8c,EAAgB,IACrBD,IAGTA,EAAI,GAAG7c,KAAK+c,EAAgB,IAC5BF,EAAI,GAAG7c,KAAK+c,EAAgB,IACrBF,EACT,GACA,CAAC,GAAI,IAET,0BCzBA3e,EAAOC,QAXP,SAAkB8e,EAAMC,GACtBD,EAAK7e,UAAYoF,OAAO2Z,OAAOD,EAAU9e,UAAW,CAClDyJ,YAAa,CACXnF,MAAOua,EACPG,YAAY,EACZC,UAAU,EACVC,cAAc,IAGpB,0BCAApf,EAAOC,QATP,SAAsBof,EAAMC,GAC1B,OAAOD,EAAKzZ,QAAO,SAAUpB,EAAOpB,GAClC,OACEkc,EAAKrZ,QAAQzB,IAAU,GACvB6a,EAAKpZ,QAAQzB,KAAWpB,CAE5B,GACF,0BCAA,SAASmc,EAA0B/a,GACjC,MACmB,oBAAVA,GACPjD,MAAMoF,QAAQnC,IAC4B,oBAA1Cc,OAAOpF,UAAUqQ,SAASjP,KAAKkD,EAEnC,CAEA,SAASgb,EAAOC,EAAQnB,GACtB,GAAImB,IAAWnB,EACb,OAAOmB,EAIT,IAAK,IAAI9c,KAAO2b,EACd,GACGhZ,OAAOpF,UAAUwf,eAAepe,KAAKgd,EAAQ3b,IACtC,cAARA,GACQ,gBAARA,EAHF,CASA,IAAIgd,EAAYrB,EAAO3b,GACnBid,EAAYH,EAAO9c,GAEE,qBAAdid,GAAkD,qBAAdD,IAM7CJ,EAA0BK,IAC1BL,EAA0BI,GAE1BF,EAAO9c,GAAO6c,EAAOI,EAAWD,GAEhCF,EAAO9c,GA5CU,kBADR6B,EA6CWmb,IA5CmB,OAAVnb,EACxBgb,EAAOje,MAAMoF,QAAQnC,GAAS,GAAK,CAAC,EAAGA,GAEzCA,EAyBL,CA7BJ,IAAeA,EAgDb,OAAOib,CACT,CAgCAzf,EAAOC,QAfP,SAAewf,GACRF,EAA0BE,KAC7BA,EAAS,CAAC,GAGZ,IAAK,IAAI3e,EAAI,EAAG+e,EAAI3e,UAAUD,OAAQH,EAAI+e,EAAG/e,IAAK,CAChD,IAAIwd,EAASpd,UAAUJ,GAEnBye,EAA0BjB,IAC5BkB,EAAOC,EAAQnB,EAEnB,CACA,OAAOmB,CACT,0BC3EAzf,EAAOC,QAJP,SAAuB6f,GACrB,OAAOA,GAAOxa,OAAOC,KAAKua,GAAK7e,OAAS,CAC1C,0BCcAjB,EAAOC,QAfP,SAAuCqe,EAAQyB,GAC7C,GAAe,OAAXzB,EAAiB,MAAO,CAAC,EAC7B,IAEI3b,EACA7B,EAHA2e,EAAS,CAAC,EACVO,EAAa1a,OAAOC,KAAK+Y,GAG7B,IAAKxd,EAAI,EAAGA,EAAIkf,EAAW/e,OAAQH,IACjC6B,EAAMqd,EAAWlf,GAEbif,EAAS9Z,QAAQtD,IAAQ,IAC7B8c,EAAO9c,GAAO2b,EAAO3b,IAEvB,OAAO8c,CACT,0BCdA,SAASQ,EAAiBzb,EAAO0b,GAC/B,GAAI1b,IAAU0b,EAAO,CACnB,IAAIC,OAAyBxgB,IAAV6E,EACf4b,EAAsB,OAAV5b,EAEZ6b,OAAyB1gB,IAAVugB,EACfI,EAAsB,OAAVJ,EAEhB,IACII,GAAa9b,EAAQ0b,GACtBE,GAAaC,IACbF,EAED,OAAO,EAET,IACIC,GAAa5b,EAAQ0b,GACtBI,GAAaH,IACbE,EAED,OAAQ,CAEZ,CACA,OAAO,CACT,CAqDArgB,EAAOC,QA7CP,SAAiBsgB,EAAYC,EAAWC,GACtC,IAAKlf,MAAMoF,QAAQ4Z,GACjB,MAAO,GAGJhf,MAAMoF,QAAQ8Z,KACjBA,EAAS,IAGX,IAAI7M,EAAS2M,EAAW/X,KAAI,SAAUhE,EAAOpB,GAC3C,MAAO,CACLsd,SAAUF,EAAUhY,KAAI,SAAUmY,GAChC,OAAOnc,EAAMmc,EACf,IACAvd,MAAOA,EACPoB,MAAOA,EAEX,IAuBA,OArBAoP,EAAOhF,MAAK,SAAkBgS,EAAQV,GAGpC,IAFA,IAAI9c,GAAS,IAEJA,EAAQwd,EAAOF,SAASzf,QAAQ,CACvC,IAAI0W,EAAMsI,EAAiBW,EAAOF,SAAStd,GAAQ8c,EAAMQ,SAAStd,IAClE,GAAIuU,EACF,OAAIvU,GAASqd,EAAOxf,OACX0W,EAEa,SAAlB8I,EAAOrd,IACDuU,EAEHA,CAEX,CAIA,OAAOiJ,EAAOxd,MAAQ8c,EAAM9c,KAC9B,IAEOwQ,EAAOpL,KAAI,SAAUmP,GAC1B,OAAOA,EAAInT,KACb,GACF,0BC7DAxE,EAAOC,QAdP,SAASoG,EAAYrB,GACnB,GAAiB,kBAANA,EACT,OAAOA,EACF,GAAiB,kBAANA,EAChB,OAAOsD,WAAWtD,GACb,GAAIzD,MAAMoF,QAAQ3B,GACvB,OAAOA,EAAEwD,IAAInC,GAGf,MAAM,IAAIlF,MACR,wEAEJ,gCCZA,IAAIiF,EAAQ,EAAQ,OAEpB,SAASya,EAAWf,GAClB,OAAOxa,OAAOC,KAAKua,GAChBlR,OACApJ,QAAO,SAAU8J,EAAKwR,GAErB,OADAxR,EAAIwR,GAAQhB,EAAIgB,GACTxR,CACT,GAAG,CAAC,EACR,CAEA,IAAI2I,EAAiB,CASnBqB,YAAa,SAAoBlW,EAAOsN,GACtC,IAAI2I,EAAU,GAoGd,OAjGAA,EAAQvX,KAAK,CACXiZ,UAAW3X,EACX2D,OAAQkR,EAAegB,qBAAqBvI,KAI9CA,EAAMjC,8BAA8B5G,SAAQ,SAAUkN,GACpDsE,EAAQvX,KAAK,CACXiZ,UAAW3X,EACX2D,OAAQkR,EAAe8I,iCACrBrQ,EACAqE,IAGN,IAGArE,EAAM/B,+BAA+B9G,SAAQ,SAAUkN,GACrD,IAAI7I,EAAoBwE,EAAMjD,2BAA2BsH,GACrD7L,EAAoBwH,EAAMvH,0BAA0B4L,GACpDxH,EAAYmD,EAAMlD,+BAA+BtB,GAIrD,GACEhD,EAAkBjI,OAAS,GAC3BiI,EAAkB,GAAGkH,MAAM7C,GAAWtM,OAAS,EAC/C,CAEA,IAAI+f,EAAa9X,EAAkB,GAChCkH,MAAM7C,GACN/L,MAAM,GAAI,GACVgE,QAAO,SAA0BgD,EAAKyY,EAASxP,GAC9C,OAAOjJ,EAAI5D,OAAO,CAChBL,UAAW2H,EAAkB8G,WAAWvB,GACxCjN,MACY,IAAViN,EACIwP,EACA,CAACzY,EAAIA,EAAIvH,OAAS,GAAGuD,MAAOyc,GAASC,KAAK3T,IAEpD,GAAG,IAELyT,EAAWnZ,SAAQ,SAAUjC,EAAQ6L,GACnC,IAAI1K,EAASkR,EAAe8I,iCAC1BrQ,EACA9K,EAAOrB,UACG,IAAVkN,GAIF,SAAS0P,EAA2B3c,GAClC,OAAO0H,EAAkB8G,WAAWoO,MAAK,SAAU7c,GACjD,OAAOA,IAAcC,EAAM4L,MAAM,KAAK,EACxC,GACF,CAEA,IAAIiR,GAAwBta,EAAO4W,cAAgB,IAAInY,QACrD,SAAU8J,EAAKgS,GACb,GAAI/f,MAAMoF,QAAQ2a,GAAc,CAC9B,IAAIC,EAAWD,EAAY1b,QAAO,SAAU4b,GAC1C,OAAQL,EAA2BK,EACrC,IAEID,EAAStgB,OAAS,GACpBqO,EAAIxN,KAAKyf,EAEb,CASA,MANyB,kBAAhBD,GACNH,EAA2BG,IAE5BhS,EAAIxN,KAAKwf,GAGJhS,CACT,GACA,IAGEkC,EAASwP,EAAWvP,EAAQ,GAE9B1K,EAAO4W,aADLlM,EAAQ,EACY4P,EAAqBzc,OACzC4M,EAAOjN,UAAY,IAAMiN,EAAOhN,OAIhC6c,EAAqBpgB,OAAS,EAC1BogB,OACA1hB,EAGR0Z,EAAQvX,KAAK,CAAEiZ,UAAW3X,EAAO2D,OAAQA,GAC3C,GACF,CACF,IAEOsS,CACT,EAQAJ,qBAAsB,SAAUvI,GAC9B,IAAIvJ,EAASuJ,EAAMvJ,OAChBvC,OAAO8L,EAAMtJ,mBACbxC,OAAOqT,EAAewJ,qCAAqC/Q,IAC3D9B,OAEC+O,EAAe1F,EAAeyJ,iBAAiBhR,GAC/ChH,EAAiBuO,EAAe0J,mBAAmBjR,GACnDjH,EAAawO,EAAe2J,eAAelR,GAC3CmR,EAAmB,CACrB1a,OAAQA,EAAOlB,QAAQ,MAAQ,EAAI,CAAC,KAAOkB,EAC3CsC,WAAYA,GAWd,OARIkU,EAAa1c,OAAS,IACxB4gB,EAAiBlE,aAAeA,GAG9BjU,EAAezI,OAAS,IAC1B4gB,EAAiBnY,eAAiBA,GAG7BmX,EAAWza,EAAM,CAAC,EAAGsK,EAAM1B,iBAAkB6S,GACtD,EAUAd,iCAAkC,SAChCrQ,EACA1H,EACA8Y,GAEA,IAAInE,EAAe1F,EAAeyJ,iBAChChR,EACA1H,EACA8Y,GAEEpY,EAAiBuO,EAAe0J,mBAAmBjR,EAAO1H,GAC1DS,EAAawO,EAAe2J,eAAelR,GAC3CmR,EAAmB,CACrBnX,YAAa,EACbJ,KAAM,EACNyX,WAAW,EACXC,gBAAgB,GAGdvY,EAAWxI,OAAS,IACtB4gB,EAAiBpY,WAAaA,GAGhC,IAAIyC,EAAoBwE,EAAMjD,2BAA2BzE,GAqBzD,OAlBE6Y,EAAiB1a,OADf+E,EAEA+L,EAAegK,0CACbvR,EACAxE,EACA4V,GAGsB9Y,EAGxBU,EAAezI,OAAS,IAC1B4gB,EAAiBnY,eAAiBA,GAGhCiU,EAAa1c,OAAS,IACxB4gB,EAAiBlE,aAAeA,GAG3BkD,EAAWza,EAAM,CAAC,EAAGsK,EAAM1B,iBAAkB6S,GACtD,EASAF,mBAAoB,SAAUjR,EAAOzF,GACnC,GAAIyF,EAAMhH,eACR,OAAOgH,EAAMhH,eAGf,IAAIA,EAAiB,GAqBrB,OAnBApE,OAAOC,KAAKmL,EAAMjJ,oBAAoBI,SAAQ,SAAUtD,GACtD,IAAImE,EAAYgI,EAAMjJ,mBAAmBlD,IAAc,CAAC,EACxDe,OAAOC,KAAKmD,GAAWb,SAAQ,SAAUc,GACvC,IAAIjD,EAASgD,EAAUC,IAAa,GAChCsC,IAAc1G,GAChBmB,EAAOmC,SAAQ,SAAUrD,GACvB,GAAIjD,MAAMoF,QAAQnC,GAAQ,CACxB,IAAI0d,EAAK1d,EAAMgE,KAAI,SAAUxD,GAC3B,OAAOT,EAAYoE,EAAW3D,CAChC,IACA0E,EAAe5H,KAAKogB,EACtB,MACExY,EAAe5H,KAAKyC,EAAYoE,EAAWnE,EAE/C,GAEJ,GACF,IAEOkF,CACT,EAQAkY,eAAgB,SAAUlR,GACxB,OAAIA,EAAMjH,WACDiH,EAAMjH,WAGRiH,EAAMhJ,eAAewZ,KAAK,IACnC,EAWAQ,iBAAkB,SAAUhR,EAAO1H,EAAO8Y,GACxC,IAAInE,EAAe,GAEfrW,EAAoBoJ,EAAMpJ,mBAAqB,CAAC,EACpDhC,OAAOC,KAAK+B,GACTsH,OACA/G,SAAQ,SAAUoD,IACC3D,EAAkB2D,IAAc,IACtC2D,OAAO/G,SAAQ,SAAUgK,GACnC8L,EAAa7b,KAAKmJ,EAAY,IAAM4G,EACtC,GACF,IAEF,IAAItK,EAAiBmJ,EAAMnJ,gBAAkB,CAAC,EAC9CjC,OAAOC,KAAKgC,GACTqH,OACA/G,SAAQ,SAAUoD,IACC1D,EAAe0D,IAAc,IACnC2D,OAAO/G,SAAQ,SAAUgK,GACnC8L,EAAa7b,KAAKmJ,EAAY,KAAO4G,EACvC,GACF,IAEF,IAAIrK,EAA+BkJ,EAAMlJ,8BAAgC,CAAC,EAC1ElC,OAAOC,KAAKiC,GACToH,OACA/G,SAAQ,SAAUoD,GACjB,IAAI4L,EAAcrP,EAA6ByD,IAAc,GAC7D,GAAIA,IAAcjC,GAAU6N,GAAsC,IAAvBA,EAAY5V,OAAvD,CAGA,IAAIkhB,EAAY,GAEhBtL,EAAYjI,OAAO/G,SAAQ,SAAUgK,GACnCsQ,EAAUrgB,KAAKmJ,EAAY,IAAM4G,EACnC,IAEA8L,EAAa7b,KAAKqgB,EAPlB,CAQF,IAEF,IAAIxa,EACF+I,EAAM/I,+BAAiC,CAAC,EAmD1C,OAlDArC,OAAOC,KAAKoC,GACTiH,OACA/G,SAAQ,SAAUoD,GACjB,IACI4G,GADclK,EAA8BsD,IAAc,IACjC,GAE7B,QAAmBtL,IAAfkS,EAAJ,CAIA,IAGIuQ,EACAC,EAJAnW,EAAoBwE,EAAMjD,2BAA2BxC,GACrDsC,EAAYmD,EAAMlD,+BAA+BtB,GACjDjD,EAAWyH,EAAMZ,yBAAyB5D,GAK9C,GAAIlD,IAAUiC,EAAW,CAGvB,IACqC,IAAnC4G,EAAW5L,QAAQsH,KACjBtE,IAAsC,IAA1B6Y,GACb7Y,GACCA,EAASmH,MAAM7C,GAAWtM,SACxB4Q,EAAWzB,MAAM7C,GAAWtM,OAEhC,OAGGgI,GAIHoZ,EAAkBpZ,EAASmH,MAAM7C,GAAWtM,OAAS,EACrD4Q,EAAa5I,IAJboZ,EAAkBxQ,EAAWzB,MAAM7C,GAAWtM,OAAS,EACvD4Q,EAAaA,EAAWrQ,MAAM,EAAGqQ,EAAWnE,YAAYH,KAM1D6U,EAAoBlW,EAAkB8G,WAAWqP,EACnD,MACEA,EAAkBxQ,EAAWzB,MAAM7C,GAAWtM,OAAS,EAEvDmhB,EAAoBlW,EAAkB8G,WAAWqP,GAG/CD,GACFzE,EAAa7b,KAAK,CAACsgB,EAAoB,IAAMvQ,GAtC/C,CAwCF,IAEK8L,CACT,EAEA8D,qCAAsC,SAAU/Q,GAG9C,OAAOA,EAAMrJ,mBAAmB7B,QAE9B,SACE8c,EACApW,GAEA,IAAIqW,EAAyB7R,EAAMvH,0BACjC+C,EAAkB9C,MAClB,GAGF,IAAKmZ,EAEH,OADAD,EAAcxgB,KAAKoK,EAAkB8G,WAAW,IACzCsP,EAGT,IAAI/U,EAAYmD,EAAMlD,+BAA+BtB,GACjDuF,EAAQ8Q,EAAuBnS,MAAM7C,GAAWtM,OAChDuhB,EAAgBtW,EAAkB8G,WAAWxR,MAAM,EAAGiQ,EAAQ,GAElE,OAAO6Q,EAAc1d,OAAO4d,EAC9B,GAvBQ,GA0BZ,EAEAP,0CAA2C,SACzCvR,EACAxE,EACAuW,GAEA,IAAIlV,EAAYmD,EAAMlD,+BAA+BtB,GACrD,IAAkB,IAAduW,EAAoB,CACtB,IAAIxZ,EAAWyH,EAAMZ,yBAAyB5D,GAC1C2I,EAAiB,EAKrB,OAHI5L,IACF4L,EAAiB5L,EAASmH,MAAM7C,GAAWtM,QAEtC,CAACiL,EAAkB8G,WAAW6B,GACvC,CAEA,IAKI6N,GAJFhS,EAAMvH,0BAA0B+C,EAAkB9C,MAAM,IAAM,IAIvBgH,MAAM7C,GAAWtM,OAAS,EACnE,OAAOiL,EAAkB8G,WAAWxR,MAAM,EAAGkhB,EAAc,EAC7D,EAEA7H,uBAAwB,SAAU5P,EAAWd,EAAOoQ,EAAc7J,GAChE,IAAIiS,EAA+BjS,EAAMtF,mBAAmBH,GACxDyF,EAAMrH,iBAAiB4B,GACvByF,EACAkS,EAAiC,CACnCC,WAAY1Y,EACZc,UAAWA,GAKb,MAH4B,kBAAjBsP,IACTqI,EAA+BrI,aAAeA,GAEzCsG,EACLza,EACE,CAAC,EACD6R,EAAegB,qBAAqB0J,GACpCC,GAGN,GAGF5iB,EAAOC,QAAUgY,0BCvbjBjY,EAAOC,QAAU,SAA0BgH,GACzC,OAAkB,OAAdA,GAGG,wBAAwB6b,KAAK7b,EACtC,0BCLAjH,EAAOC,QAAU,4BCDmDD,EAAOC,QAAgG,WAAY,aAAa,SAASiN,EAAEA,EAAEwM,EAAEmD,GAAG,OAAOnD,KAAKxM,EAAE5H,OAAOyd,eAAe7V,EAAEwM,EAAE,CAAClV,MAAMqY,EAAEqC,YAAW,EAAGE,cAAa,EAAGD,UAAS,IAAKjS,EAAEwM,GAAGmD,EAAE3P,CAAC,CAAC,SAASwM,EAAExM,EAAEwM,GAAG,IAAImD,EAAEvX,OAAOC,KAAK2H,GAAG,GAAG5H,OAAO0d,sBAAsB,CAAC,IAAI3iB,EAAEiF,OAAO0d,sBAAsB9V,GAAGwM,IAAIrZ,EAAEA,EAAEuF,QAAO,SAAU8T,GAAG,OAAOpU,OAAO2d,yBAAyB/V,EAAEwM,GAAGwF,UAAW,KAAIrC,EAAE/a,KAAKL,MAAMob,EAAExc,EAAE,CAAC,OAAOwc,CAAC,CAAC,SAASA,EAAEA,GAAG,IAAI,IAAIxc,EAAE,EAAEA,EAAEa,UAAUD,OAAOZ,IAAI,CAAC,IAAIoG,EAAE,MAAMvF,UAAUb,GAAGa,UAAUb,GAAG,CAAC,EAAEA,EAAE,EAAEqZ,EAAEpU,OAAOmB,IAAG,GAAIoB,SAAQ,SAAU6R,GAAGxM,EAAE2P,EAAEnD,EAAEjT,EAAEiT,GAAI,IAAGpU,OAAO4d,0BAA0B5d,OAAO6d,iBAAiBtG,EAAEvX,OAAO4d,0BAA0Bzc,IAAIiT,EAAEpU,OAAOmB,IAAIoB,SAAQ,SAAUqF,GAAG5H,OAAOyd,eAAelG,EAAE3P,EAAE5H,OAAO2d,yBAAyBxc,EAAEyG,GAAI,GAAE,CAAC,OAAO2P,CAAC,CAAC,SAASxc,EAAE6M,EAAEwM,GAAG,GAAG,MAAMxM,EAAE,MAAM,CAAC,EAAE,IAAI2P,EAAExc,EAAEoG,EAAE,SAASyG,EAAEwM,GAAG,GAAG,MAAMxM,EAAE,MAAM,CAAC,EAAE,IAAI2P,EAAExc,EAAEoG,EAAE,CAAC,EAAE2c,EAAE9d,OAAOC,KAAK2H,GAAG,IAAI7M,EAAE,EAAEA,EAAE+iB,EAAEniB,OAAOZ,IAAIwc,EAAEuG,EAAE/iB,GAAGqZ,EAAEzT,QAAQ4W,IAAI,IAAIpW,EAAEoW,GAAG3P,EAAE2P,IAAI,OAAOpW,CAAC,CAAnI,CAAqIyG,EAAEwM,GAAG,GAAGpU,OAAO0d,sBAAsB,CAAC,IAAII,EAAE9d,OAAO0d,sBAAsB9V,GAAG,IAAI7M,EAAE,EAAEA,EAAE+iB,EAAEniB,OAAOZ,IAAIwc,EAAEuG,EAAE/iB,GAAGqZ,EAAEzT,QAAQ4W,IAAI,GAAGvX,OAAOpF,UAAUmjB,qBAAqB/hB,KAAK4L,EAAE2P,KAAKpW,EAAEoW,GAAG3P,EAAE2P,GAAG,CAAC,OAAOpW,CAAC,CAAC,SAASA,EAAEyG,EAAEwM,GAAG,OAAO,SAASxM,GAAG,GAAG3L,MAAMoF,QAAQuG,GAAG,OAAOA,CAAC,CAAxC,CAA0CA,IAAI,SAASA,EAAEwM,GAAG,GAAK4J,OAAOC,YAAYje,OAAO4H,IAAI,uBAAuB5H,OAAOpF,UAAUqQ,SAASjP,KAAK4L,GAAzF,CAAoG,IAAI2P,EAAE,GAAGxc,GAAE,EAAGoG,GAAE,EAAG2c,OAAE,EAAO,IAAI,IAAI,IAAItiB,EAAE0iB,EAAEtW,EAAEoW,OAAOC,cAAcljB,GAAGS,EAAE0iB,EAAEC,QAAQC,QAAQ7G,EAAE/a,KAAKhB,EAAE0D,QAAQkV,GAAGmD,EAAE5b,SAASyY,GAAGrZ,GAAE,GAAI,CAAC,MAAM6M,GAAGzG,GAAE,EAAG2c,EAAElW,CAAC,CAAC,QAAQ,IAAI7M,GAAG,MAAMmjB,EAAEG,QAAQH,EAAEG,QAAQ,CAAC,QAAQ,GAAGld,EAAE,MAAM2c,CAAC,CAAC,CAAC,OAAOvG,CAA7N,CAA8N,CAA/U,CAAiV3P,EAAEwM,IAAI,WAAW,MAAM,IAAInZ,UAAU,uDAAuD,CAAtF,EAAyF,CAAC,SAAS6iB,EAAElW,GAAG,OAAO,SAASA,GAAG,GAAG3L,MAAMoF,QAAQuG,GAAG,CAAC,IAAI,IAAIwM,EAAE,EAAEmD,EAAE,IAAItb,MAAM2L,EAAEjM,QAAQyY,EAAExM,EAAEjM,OAAOyY,IAAImD,EAAEnD,GAAGxM,EAAEwM,GAAG,OAAOmD,CAAC,CAAC,CAArG,CAAuG3P,IAAI,SAASA,GAAG,GAAGoW,OAAOC,YAAYje,OAAO4H,IAAI,uBAAuB5H,OAAOpF,UAAUqQ,SAASjP,KAAK4L,GAAG,OAAO3L,MAAMqiB,KAAK1W,EAAE,CAA1H,CAA4HA,IAAI,WAAW,MAAM,IAAI3M,UAAU,kDAAkD,CAAjF,EAAoF,CAAC,SAASO,EAAEoM,GAAG,IAAIwM,EAAEmD,EAAE,2BAA2BjY,OAAOsI,EAAEvK,KAAKtC,EAAE,WAAW,YAAO,IAASqZ,IAAIA,EAAExM,EAAE2W,cAAcC,OAAOD,cAAcnK,CAAC,EAAE0J,EAAE,WAAW,OAAO5S,KAAKuT,MAAM1jB,IAAI2jB,QAAQnH,IAAI,KAAK,EAAE/b,EAAE,SAASoM,GAAG7M,IAAI4jB,QAAQpH,EAAErM,KAAKC,UAAUvD,GAAG,EAAEsW,EAAE,WAAW,IAAI9J,EAAExM,EAAEgX,WAAW,IAAIhX,EAAEgX,WAAW,KAAKrH,EAAEuG,IAAI/iB,EAAEiF,OAAO6e,YAAY7e,OAAO8e,QAAQvH,GAAGjX,QAAO,SAAUsH,GAAG,YAAO,IAASzG,EAAEyG,EAAE,GAAG,GAAGmX,SAAU,KAAI,GAAGvjB,EAAET,GAAGqZ,EAAE,CAAC,IAAI8J,EAAEle,OAAO6e,YAAY7e,OAAO8e,QAAQ/jB,GAAGuF,QAAO,SAAUsH,GAAG,IAAI2P,EAAEpW,EAAEyG,EAAE,GAAG,GAAG7M,GAAE,IAAKikB,MAAMC,UAAU,QAAQ1H,EAAEwH,UAAU3K,EAAErZ,EAAG,KAAIS,EAAE0iB,EAAE,CAAC,EAAE,MAAM,CAACgB,IAAI,SAAStX,EAAEwM,GAAG,IAAImD,EAAE3b,UAAUD,OAAO,QAAG,IAASC,UAAU,GAAGA,UAAU,GAAG,CAACujB,KAAK,WAAW,OAAO3K,QAAQC,SAAS,GAAG,OAAOD,QAAQC,UAAUR,MAAK,WAAYiK,IAAI,IAAI9J,EAAElJ,KAAKC,UAAUvD,GAAG,OAAOkW,IAAI1J,EAAG,IAAGH,MAAK,SAAUrM,GAAG,OAAO4M,QAAQ4K,IAAI,CAACxX,EAAEA,EAAE1I,MAAMkV,SAAI,IAASxM,GAAI,IAAGqM,MAAK,SAAUrM,GAAG,IAAIwM,EAAEjT,EAAEyG,EAAE,GAAG7M,EAAEqZ,EAAE,GAAG0J,EAAE1J,EAAE,GAAG,OAAOI,QAAQ4K,IAAI,CAACrkB,EAAE+iB,GAAGvG,EAAE4H,KAAKpkB,IAAK,IAAGkZ,MAAK,SAAUrM,GAAG,OAAOzG,EAAEyG,EAAE,GAAG,EAAG,GAAE,EAAEyX,IAAI,SAASzX,EAAEwM,GAAG,OAAOI,QAAQC,UAAUR,MAAK,WAAY,IAAI9S,EAAE2c,IAAI,OAAO3c,EAAE+J,KAAKC,UAAUvD,IAAI,CAACmX,WAAU,IAAKC,MAAMC,UAAU/f,MAAMkV,GAAGrZ,IAAI4jB,QAAQpH,EAAErM,KAAKC,UAAUhK,IAAIiT,CAAE,GAAE,EAAEkL,OAAO,SAAS1X,GAAG,OAAO4M,QAAQC,UAAUR,MAAK,WAAY,IAAIG,EAAE0J,WAAW1J,EAAElJ,KAAKC,UAAUvD,IAAI7M,IAAI4jB,QAAQpH,EAAErM,KAAKC,UAAUiJ,GAAI,GAAE,EAAEmL,MAAM,WAAW,OAAO/K,QAAQC,UAAUR,MAAK,WAAYlZ,IAAIykB,WAAWjI,EAAG,GAAE,EAAE,CAAC,SAAS2G,EAAEtW,GAAG,IAAIwM,EAAE0J,EAAElW,EAAE6X,QAAQlI,EAAEnD,EAAEsL,QAAQ,YAAO,IAASnI,EAAE,CAAC2H,IAAI,SAAStX,EAAEwM,GAAG,IAAImD,EAAE3b,UAAUD,OAAO,QAAG,IAASC,UAAU,GAAGA,UAAU,GAAG,CAACujB,KAAK,WAAW,OAAO3K,QAAQC,SAAS,GAAS,OAAJL,IAAaH,MAAK,SAAUrM,GAAG,OAAO4M,QAAQ4K,IAAI,CAACxX,EAAE2P,EAAE4H,KAAKvX,IAAK,IAAGqM,MAAK,SAAUrM,GAAG,OAAOzG,EAAEyG,EAAE,GAAG,EAAG,GAAE,EAAEyX,IAAI,SAASzX,EAAEwM,GAAG,OAAOI,QAAQC,QAAQL,EAAE,EAAEkL,OAAO,SAAS1X,GAAG,OAAO4M,QAAQC,SAAS,EAAE8K,MAAM,WAAW,OAAO/K,QAAQC,SAAS,GAAG,CAACyK,IAAI,SAAStX,EAAE7M,GAAG,IAAIoG,EAAEvF,UAAUD,OAAO,QAAG,IAASC,UAAU,GAAGA,UAAU,GAAG,CAACujB,KAAK,WAAW,OAAO3K,QAAQC,SAAS,GAAG,OAAO8C,EAAE2H,IAAItX,EAAE7M,EAAEoG,GAAGkT,OAAM,WAAY,OAAO6J,EAAE,CAACuB,OAAOrL,IAAI8K,IAAItX,EAAE7M,EAAEoG,EAAG,GAAE,EAAEke,IAAI,SAASzX,EAAE7M,GAAG,OAAOwc,EAAE8H,IAAIzX,EAAE7M,GAAGsZ,OAAM,WAAY,OAAO6J,EAAE,CAACuB,OAAOrL,IAAIiL,IAAIzX,EAAE7M,EAAG,GAAE,EAAEukB,OAAO,SAAS1X,GAAG,OAAO2P,EAAE+H,OAAO1X,GAAGyM,OAAM,WAAY,OAAO6J,EAAE,CAACuB,OAAOrL,IAAIkL,OAAO1X,EAAG,GAAE,EAAE2X,MAAM,WAAW,OAAOhI,EAAEgI,QAAQlL,OAAM,WAAY,OAAO6J,EAAE,CAACuB,OAAOrL,IAAImL,OAAQ,GAAE,EAAE,CAAC,SAASrH,IAAI,IAAItQ,EAAEhM,UAAUD,OAAO,QAAG,IAASC,UAAU,GAAGA,UAAU,GAAG,CAAC+jB,cAAa,GAAIvL,EAAE,CAAC,EAAE,MAAM,CAAC8K,IAAI,SAAS3H,EAAExc,GAAG,IAAIoG,EAAEvF,UAAUD,OAAO,QAAG,IAASC,UAAU,GAAGA,UAAU,GAAG,CAACujB,KAAK,WAAW,OAAO3K,QAAQC,SAAS,GAAGqJ,EAAE5S,KAAKC,UAAUoM,GAAG,GAAGuG,KAAK1J,EAAE,OAAOI,QAAQC,QAAQ7M,EAAE+X,aAAazU,KAAKuT,MAAMrK,EAAE0J,IAAI1J,EAAE0J,IAAI,IAAItiB,EAAET,IAAImjB,EAAE/c,GAAGA,EAAEge,MAAM,WAAW,OAAO3K,QAAQC,SAAS,EAAE,OAAOjZ,EAAEyY,MAAK,SAAUrM,GAAG,OAAOsW,EAAEtW,EAAG,IAAGqM,MAAK,WAAY,OAAOzY,CAAE,GAAE,EAAE6jB,IAAI,SAAS9H,EAAExc,GAAG,OAAOqZ,EAAElJ,KAAKC,UAAUoM,IAAI3P,EAAE+X,aAAazU,KAAKC,UAAUpQ,GAAGA,EAAEyZ,QAAQC,QAAQ1Z,EAAE,EAAEukB,OAAO,SAAS1X,GAAG,cAAcwM,EAAElJ,KAAKC,UAAUvD,IAAI4M,QAAQC,SAAS,EAAE8K,MAAM,WAAW,OAAOnL,EAAE,CAAC,EAAEI,QAAQC,SAAS,EAAE,CAAC,SAASmL,EAAEhY,EAAEwM,EAAEmD,GAAG,IAAIxc,EAAE,CAAC,oBAAoBwc,EAAE,2BAA2BnD,GAAG,MAAM,CAACyL,QAAQ,WAAW,OAAOjY,IAAItL,EAAEwjB,cAAc/kB,EAAE,CAAC,CAAC,EAAEglB,gBAAgB,WAAW,OAAOnY,IAAItL,EAAE0jB,sBAAsBjlB,EAAE,CAAC,CAAC,EAAE,CAAC,SAAS4E,EAAEiI,GAAG,IAAIwM,EAAE,EAAE,OAAOxM,GAAE,SAAU2P,IAAI,OAAOnD,IAAI,IAAII,SAAQ,SAAUzZ,GAAGklB,YAAW,WAAYllB,EAAE6M,EAAE2P,GAAI,GAAE2I,KAAKC,IAAI,IAAI/L,EAAE,KAAM,GAAG,GAAE,CAAC,SAASgM,EAAExY,GAAG,IAAIwM,EAAExY,UAAUD,OAAO,QAAG,IAASC,UAAU,GAAGA,UAAU,GAAG,SAASgM,EAAEwM,GAAG,OAAOI,QAAQC,SAAS,EAAE,OAAOzU,OAAOqgB,OAAOzY,EAAE,CAAC0Y,KAAK,SAAS/I,GAAG,OAAO6I,EAAExY,EAAEqM,MAAK,SAAUrM,GAAG,OAAO4M,QAAQ4K,IAAI,CAAChL,EAAExM,EAAE2P,GAAG3P,GAAI,IAAGqM,MAAK,SAAUrM,GAAG,OAAOA,EAAE,EAAG,IAAG,GAAG,CAAC,SAAS2S,EAAE3S,GAAG,IAAI,IAAIwM,EAAExM,EAAEjM,OAAO,EAAEyY,EAAE,EAAEA,IAAI,CAAC,IAAImD,EAAE2I,KAAKK,MAAML,KAAKM,UAAUpM,EAAE,IAAIrZ,EAAE6M,EAAEwM,GAAGxM,EAAEwM,GAAGxM,EAAE2P,GAAG3P,EAAE2P,GAAGxc,CAAC,CAAC,OAAO6M,CAAC,CAAC,SAAS6Y,EAAE7Y,EAAEwM,GAAG,OAAOA,GAAGpU,OAAOC,KAAKmU,GAAG7R,SAAQ,SAAUgV,GAAG3P,EAAE2P,GAAGnD,EAAEmD,GAAG3P,EAAG,IAAGA,GAAGA,CAAC,CAAC,SAAS8Y,EAAE9Y,GAAG,IAAI,IAAIwM,EAAExY,UAAUD,OAAO4b,EAAE,IAAItb,MAAMmY,EAAE,EAAEA,EAAE,EAAE,GAAGrZ,EAAE,EAAEA,EAAEqZ,EAAErZ,IAAIwc,EAAExc,EAAE,GAAGa,UAAUb,GAAG,IAAIoG,EAAE,EAAE,OAAOyG,EAAEsI,QAAQ,OAAM,WAAY,OAAOyQ,mBAAmBpJ,EAAEpW,KAAM,GAAE,CAAC,IAAI7E,EAAE,CAAC0jB,sBAAsB,EAAEF,cAAc,GAAG,SAASc,EAAEhZ,EAAEwM,GAAG,IAAImD,EAAE3P,GAAG,CAAC,EAAE7M,EAAEwc,EAAEnL,MAAM,CAAC,EAAE,OAAOpM,OAAOC,KAAKsX,GAAGhV,SAAQ,SAAUqF,IAAI,IAAI,CAAC,UAAU,UAAU,kBAAkB,OAAO,aAAajH,QAAQiH,KAAK7M,EAAE6M,GAAG2P,EAAE3P,GAAI,IAAG,CAACwE,KAAKpM,OAAO8e,QAAQ/jB,GAAGY,OAAO,EAAEZ,OAAE,EAAO8lB,QAAQtJ,EAAEsJ,SAASzM,EAAEyL,QAAQtI,EAAEsI,SAAS,CAAC,EAAEE,gBAAgBxI,EAAEwI,iBAAiB,CAAC,EAAEe,UAAUvJ,EAAEuJ,UAAU,CAAC,IAAI/jB,EAAE,CAACgkB,KAAK,EAAEC,MAAM,EAAEC,IAAI,GAAGvhB,EAAE,EAAE0B,EAAE,EAAE8f,EAAE,EAAE,SAASC,EAAEvZ,GAAG,IAAIwM,EAAExY,UAAUD,OAAO,QAAG,IAASC,UAAU,GAAGA,UAAU,GAAG8D,EAAE,OAAO6X,EAAEA,EAAE,CAAC,EAAE3P,GAAG,CAAC,EAAE,CAACwZ,OAAOhN,EAAEiN,WAAWrC,KAAKsC,OAAO,CAAC,SAASC,EAAE3Z,GAAG,MAAM,iBAAiBA,EAAE,CAAC4Z,SAAS,QAAQC,IAAI7Z,EAAE8Z,OAAO3kB,EAAEkkB,KAAK,CAACO,SAAS5Z,EAAE4Z,UAAU,QAAQC,IAAI7Z,EAAE6Z,IAAIC,OAAO9Z,EAAE8Z,QAAQ3kB,EAAEkkB,IAAI,CAAC,IAAIU,EAAE,SAASC,EAAE,MAAMC,EAAE,OAAOC,EAAE,MAAM,SAASlM,EAAEhO,EAAEwM,GAAG,OAAOI,QAAQ4K,IAAIhL,EAAElR,KAAI,SAAUkR,GAAG,OAAOxM,EAAEsX,IAAI9K,GAAE,WAAY,OAAOI,QAAQC,QAAQ0M,EAAE/M,GAAI,GAAG,KAAIH,MAAK,SAAUrM,GAAG,IAAI2P,EAAE3P,EAAEtH,QAAO,SAAUsH,GAAG,OAAO,SAASA,GAAG,OAAOA,EAAEwZ,SAAS1hB,GAAGsf,KAAKsC,MAAM1Z,EAAEyZ,WAAW,IAAI,CAA7D,CAA+DzZ,EAAG,IAAG7M,EAAE6M,EAAEtH,QAAO,SAAUsH,GAAG,OAAO,SAASA,GAAG,OAAOA,EAAEwZ,SAASF,GAAGlC,KAAKsC,MAAM1Z,EAAEyZ,YAAY,IAAI,CAA9D,CAAgEzZ,EAAG,IAAGzG,EAAE,GAAG7B,OAAOwe,EAAEvG,GAAGuG,EAAE/iB,IAAI,MAAM,CAACgnB,WAAW,SAASna,EAAEwM,GAAG,OAAO,IAAIrZ,EAAEY,QAAQ,IAAIiM,EAAE,EAAE7M,EAAEY,OAAO,EAAEiM,GAAGwM,CAAC,EAAE4N,eAAe7gB,EAAExF,OAAO,EAAEwF,EAAE+B,KAAI,SAAU0E,GAAG,OAAO2Z,EAAE3Z,EAAG,IAAGwM,EAAG,GAAE,CAAC,SAAS6N,EAAEra,EAAEwM,EAAErZ,EAAEoG,GAAG,IAAI3F,EAAE,GAAG0iB,EAAE,SAAStW,EAAEwM,GAAG,GAAGxM,EAAEsa,SAASN,SAAG,IAASha,EAAEwE,WAAM,IAASgI,EAAEhI,MAA7C,CAAyD,IAAIrR,EAAEkB,MAAMoF,QAAQuG,EAAEwE,MAAMxE,EAAEwE,KAAKmL,EAAEA,EAAE,CAAC,EAAE3P,EAAEwE,MAAMgI,EAAEhI,MAAM,OAAOlB,KAAKC,UAAUpQ,EAAjF,CAAmF,CAAzJ,CAA2JA,EAAEoG,GAAG+W,EAAE,SAAStQ,EAAEwM,GAAG,IAAIrZ,EAAEwc,EAAEA,EAAE,CAAC,EAAE3P,EAAEiY,SAASzL,EAAEyL,SAAS1e,EAAE,CAAC,EAAE,OAAOnB,OAAOC,KAAKlF,GAAGwH,SAAQ,SAAUqF,GAAG,IAAIwM,EAAErZ,EAAE6M,GAAGzG,EAAEyG,EAAEua,eAAe/N,CAAE,IAAGjT,CAAC,CAArI,CAAuIyG,EAAEzG,GAAGye,EAAE7kB,EAAEmnB,OAAOviB,EAAE5E,EAAEmnB,SAASN,EAAE,CAAC,EAAErK,EAAEA,EAAE,CAAC,EAAExc,EAAEqR,MAAMjL,EAAEiL,MAAMgU,EAAE7I,EAAEA,EAAEA,EAAE,CAAC,kBAAkB3P,EAAEwa,UAAUljB,OAAO0I,EAAEmY,iBAAiBpgB,GAAGwB,EAAE4e,iBAAiBxF,EAAE,EAAEkG,EAAE,SAASrM,EAAEmD,EAAEuG,GAAG,IAAIne,EAAE4X,EAAE8K,MAAM,QAAG,IAAS1iB,EAAE,KAAK,CAACmE,KAAK,aAAawe,QAAQ,0JAA0JC,sBAAsBC,EAAEhnB,IAAI,IAAIilB,EAAE,CAACrU,KAAK8R,EAAE2B,QAAQ3H,EAAEgK,OAAOtC,EAAE6B,IAAIgB,EAAE9iB,EAAE5E,EAAEuN,KAAK8X,GAAGsC,eAAe5E,EAAEvD,EAAE3S,EAAE+a,SAASC,SAASC,gBAAgB/E,EAAEvD,EAAEpZ,EAAE0f,UAAUH,EAAE,SAAS9Y,GAAG,IAAIwM,EAAE,CAAC0O,QAAQrC,EAAE/K,SAAS9N,EAAEmb,KAAKpjB,EAAEqjB,UAAUzL,EAAE5b,QAAQ,OAAOH,EAAEgB,KAAK4X,GAAGA,CAAC,EAAE9X,EAAE,CAAC2mB,UAAU,SAASrb,GAAG,OAAO,SAASA,GAAG,IAAI,OAAOsD,KAAKuT,MAAM7W,EAAEsM,QAAQ,CAAC,MAAME,GAAG,MAAM,SAASxM,EAAEwM,GAAG,MAAM,CAACtQ,KAAK,uBAAuBwe,QAAQ1a,EAAE8N,SAAStB,EAAE,CAAtE,CAAwEA,EAAEkO,QAAQ1a,EAAE,CAAC,CAAjJ,CAAmJA,EAAE,EAAEsb,QAAQ,SAASnoB,GAAG,IAAIoG,EAAEuf,EAAE3lB,GAAG,OAAOA,EAAEooB,YAAY5I,IAAI/F,QAAQ4K,IAAI,CAACxX,EAAEwb,OAAOC,KAAK,oBAAoBC,EAAEniB,IAAIyG,EAAE2b,WAAWlE,IAAI1f,EAAEwhB,EAAExhB,EAAE5E,EAAEooB,WAAWjC,EAAE9f,MAAM6S,MAAK,WAAY,OAAOG,EAAEmD,EAAEuG,EAAG,GAAE,EAAE0F,OAAO,SAAS5b,GAAG,MAAM8Y,EAAE9Y,GAAG,SAASA,EAAEwM,GAAG,IAAImD,EAAE3P,EAAEsM,QAAQnZ,EAAE6M,EAAEwZ,OAAOjgB,EAAEoW,EAAE,IAAIpW,EAAE+J,KAAKuT,MAAMlH,GAAG+K,OAAO,CAAC,MAAM1a,GAAG,CAAC,OAAO,SAASA,EAAEwM,EAAEmD,GAAG,MAAM,CAACzT,KAAK,WAAWwe,QAAQ1a,EAAEwZ,OAAOhN,EAAEmO,sBAAsBhL,EAAE,CAAlF,CAAoFpW,EAAEpG,EAAEqZ,EAAE,CAApL,CAAsLxM,EAAE4a,EAAEhnB,GAAG,GAAG,OAAOoM,EAAE6b,UAAUC,KAAKjD,GAAGxM,MAAK,SAAUrM,GAAG,OAAO,SAASA,EAAEwM,GAAG,OAAO,SAASxM,GAAG,IAAIwM,EAAExM,EAAEwZ,OAAO,OAAOxZ,EAAEub,YAAY,SAASvb,GAAG,IAAIwM,EAAExM,EAAEub,WAAW5L,EAAE3P,EAAEwZ,OAAO,OAAOhN,GAAG,KAAKmD,CAAC,CAA1D,CAA4D3P,IAAI,MAAMwM,EAAE,MAAM,MAAMA,EAAE,IAAI,CAA1I,CAA4IxM,GAAGwM,EAAE8O,QAAQtb,GAAG,MAAMA,EAAEwZ,OAAO,KAAKhN,EAAE6O,UAAUrb,GAAGwM,EAAEoP,OAAO5b,EAAE,CAA/N,CAAiOA,EAAEtL,EAAG,GAAE,EAAE,OAAOsZ,EAAEhO,EAAE2b,WAAWnP,GAAGH,MAAK,SAAUrM,GAAG,OAAO6Y,EAAE3C,EAAElW,EAAEoa,gBAAgB2B,UAAU/b,EAAEma,WAAY,GAAE,CAAC,SAASjf,EAAE8E,GAAG,IAAIwM,EAAExM,EAAE2b,WAAWhM,EAAE3P,EAAEwb,OAAOroB,EAAE6M,EAAE6b,UAAU3F,EAAElW,EAAEgc,cAAcpoB,EAAEoM,EAAEic,eAAe3F,EAAEtW,EAAE+a,SAASzK,EAAEtQ,EAAEwa,UAAUxC,EAAEhY,EAAEkc,MAAMnkB,EAAEiI,EAAEmY,gBAAgBK,EAAE,CAACmD,WAAWnP,EAAEgP,OAAO7L,EAAEkM,UAAU1oB,EAAE6oB,cAAc9F,EAAE+F,eAAeroB,EAAEmnB,SAASzE,EAAEkE,UAAUlK,EAAE2H,QAAQjY,EAAEiY,QAAQE,gBAAgBpgB,EAAEmkB,MAAMlE,EAAE1c,KAAI,SAAU0E,GAAG,OAAO2Z,EAAE3Z,EAAG,IAAGmc,KAAK,SAASnc,EAAEwM,GAAG,IAAImD,EAAEqJ,EAAExM,EAAEgM,EAAEuC,SAASoB,MAAMhpB,EAAE,WAAW,OAAOknB,EAAE7B,EAAEA,EAAE0D,MAAMxjB,QAAO,SAAUsH,GAAG,OAAO,IAAIA,EAAE8Z,OAAO3kB,EAAEgkB,KAAM,IAAGnZ,EAAE2P,EAAE,EAAE,IAAG,UAAM,IAASA,EAAEuJ,UAAUvJ,EAAEuJ,UAAUlZ,EAAEkZ,WAAW,OAAO/lB,IAAI,IAAI+iB,EAAE,CAACgF,QAAQlb,EAAEoc,qBAAqBzM,EAAE0M,YAAY,CAAClE,gBAAgBK,EAAEL,gBAAgBF,QAAQO,EAAEP,UAAU,OAAOO,EAAEyD,eAAe3E,IAAIpB,GAAE,WAAY,OAAOsC,EAAEwD,cAAc1E,IAAIpB,GAAE,WAAY,OAAOsC,EAAEwD,cAAcvE,IAAIvB,EAAE/iB,KAAKkZ,MAAK,SAAUrM,GAAG,OAAO4M,QAAQ4K,IAAI,CAACgB,EAAEwD,cAActE,OAAOxB,GAAGlW,GAAI,IAAE,SAAUA,GAAG,OAAO4M,QAAQ4K,IAAI,CAACgB,EAAEwD,cAActE,OAAOxB,GAAGtJ,QAAQ0P,OAAOtc,IAAK,IAAGqM,MAAK,SAAUrM,GAAG,IAAIwM,EAAEjT,EAAEyG,EAAE,GAAQ,OAALwM,EAAE,GAAUA,EAAE,EAAG,GAAG,GAAG,GAAE,CAAC+K,KAAK,SAASvX,GAAG,OAAOwY,EAAEyD,eAAexE,IAAIvB,EAAElW,EAAE,GAAG,EAAEuc,MAAM,SAASvc,EAAEwM,GAAG,OAAO6N,EAAE7B,EAAEA,EAAE0D,MAAMxjB,QAAO,SAAUsH,GAAG,OAAO,IAAIA,EAAE8Z,OAAO3kB,EAAEikB,MAAO,IAAGpZ,EAAEgZ,EAAExM,EAAEgM,EAAEuC,SAASwB,OAAO,GAAG,OAAO/D,CAAC,CAAC,SAASgE,EAAExc,GAAG,IAAIwM,EAAE,CAAClV,MAAM,2BAA2BI,OAAOsI,EAAE,KAAKyc,IAAI,SAASzc,GAAG,IAAI2P,EAAE,KAAKjY,OAAOsI,EAAE+T,SAASrc,YAAO,IAASsI,EAAE5J,QAAQ,KAAKsB,OAAOsI,EAAE5J,QAAQ,KAAK,IAAI,OAAO,IAAIoW,EAAElV,MAAMyB,QAAQ4W,KAAKnD,EAAElV,MAAM,GAAGI,OAAO8U,EAAElV,OAAOI,OAAOiY,IAAInD,CAAC,GAAG,OAAOA,CAAC,CAAC,SAASqO,EAAE7a,EAAEwM,EAAEmD,GAAG,IAAIxc,EAAEupB,EAAE/M,GAAGpW,EAAE,GAAG7B,OAAOsI,EAAE4Z,SAAS,OAAOliB,OAAOsI,EAAE6Z,IAAI,KAAKniB,OAAO,MAAM8U,EAAEmQ,OAAO,GAAGnQ,EAAEoQ,OAAO,GAAGpQ,GAAG,OAAOrZ,EAAEY,SAASwF,GAAG,IAAI7B,OAAOvE,IAAIoG,CAAC,CAAC,SAASmjB,EAAE1c,GAAG,OAAO5H,OAAOC,KAAK2H,GAAG1E,KAAI,SAAUkR,GAAG,OAAOsM,EAAE,QAAQtM,GAAGmD,EAAE3P,EAAEwM,GAAG,oBAAoBpU,OAAOpF,UAAUqQ,SAASjP,KAAKub,IAAI,mBAAmBvX,OAAOpF,UAAUqQ,SAASjP,KAAKub,GAAGrM,KAAKC,UAAUvD,EAAEwM,IAAIxM,EAAEwM,KAAK,IAAImD,CAAE,IAAGqE,KAAK,IAAI,CAAC,SAAS4G,EAAE5a,GAAG,OAAOA,EAAE1E,KAAI,SAAU0E,GAAG,OAAO0b,EAAE1b,EAAG,GAAE,CAAC,SAAS0b,EAAE1b,GAAG,IAAIwM,EAAExM,EAAEkb,QAAQjD,QAAQ,qBAAqB,CAAC,oBAAoB,SAAS,CAAC,EAAE,OAAOtI,EAAEA,EAAE,CAAC,EAAE3P,GAAG,CAAC,EAAE,CAACkb,QAAQvL,EAAEA,EAAE,CAAC,EAAE3P,EAAEkb,SAAS,CAAC,EAAE,CAACjD,QAAQtI,EAAEA,EAAE,CAAC,EAAE3P,EAAEkb,QAAQjD,SAASzL,MAAM,CAAC,IAAIqQ,EAAE,SAAS7c,GAAG,OAAO,SAASwM,EAAEmD,GAAG,OAAO3P,EAAEqc,YAAYE,MAAM,CAACjC,OAAOL,EAAEvZ,KAAK,YAAY8D,KAAKgI,GAAGmD,EAAE,CAAC,EAAEmN,EAAE,SAAS9c,GAAG,OAAO,SAASwM,EAAEmD,GAAG,OAAO3P,EAAEqc,YAAYE,MAAM,CAACjC,OAAOP,EAAErZ,KAAKoY,EAAE,eAAetM,IAAImD,EAAE,CAAC,EAAEoN,EAAE,SAAS/c,GAAG,OAAO,SAASwM,EAAEmD,GAAG,OAAO3P,EAAEqc,YAAYF,KAAK,CAAC7B,OAAON,EAAEtZ,KAAKoY,EAAE,eAAetM,IAAImD,EAAE,CAAC,EAAEqN,EAAE,SAAShd,GAAG,OAAO,SAASwM,GAAG,OAAOxM,EAAEqc,YAAYF,KAAK,CAAC7B,OAAON,EAAEtZ,KAAK,aAAa8L,EAAE,CAAC,EAAEyQ,EAAE,SAASjd,GAAG,OAAO,SAASwM,EAAEmD,GAAG,OAAO3P,EAAEqc,YAAYE,MAAM,CAACjC,OAAOL,EAAEvZ,KAAKoY,EAAE,oBAAoBtM,IAAImD,EAAE,CAAC,EAAEuN,EAAE,SAASld,GAAG,OAAO,SAASwM,GAAG,OAAOxM,EAAEqc,YAAYF,KAAK,CAAC7B,OAAON,EAAEtZ,KAAK,gCAAgC8L,EAAE,CAAC,EAAE2Q,EAAE,SAASnd,GAAG,OAAO,SAASwM,EAAEmD,GAAG,OAAO3P,EAAEqc,YAAYE,MAAM,CAACjC,OAAOL,EAAEvZ,KAAK,+BAA+B8D,KAAKgI,GAAGmD,EAAE,CAAC,EAAE,SAASyN,EAAEpd,GAAG,OAAO,SAASwM,EAAEmD,GAAG,OAAO3P,EAAEkb,QAAQvL,GAAGtD,MAAK,SAAUlZ,GAAG,QAAG,IAAS6M,EAAEqd,OAAOrd,EAAEqd,MAAMlqB,EAAEmqB,OAAOtd,EAAEud,WAAWpqB,GAAG,OAAOA,EAAEqqB,OAAOhR,EAAE,CAACgR,OAAOrqB,EAAEqqB,SAAShR,EAAE,CAACpP,MAAMuS,EAAEvS,MAAM,GAAG,GAAI,GAAE,CAAzK,CAA2K,CAAC,EAAE,CAAC,IAAIqgB,EAAE,SAASzd,GAAG,OAAO,SAASwM,EAAEjT,GAAG,IAAI2c,EAAE3c,GAAG,CAAC,EAAE3F,EAAEsiB,EAAEiC,gBAAgB7B,EAAEnjB,EAAE+iB,EAAE,CAAC,oBAAoB5F,EAAEX,EAAE,CAAC+N,IAAIlR,QAAG,IAAS5Y,EAAE,CAACukB,gBAAgBvkB,GAAG,CAAC,GAAG,OAAO4kB,EAAExY,EAAEqc,YAAYE,MAAM,CAACjC,OAAOL,EAAEvZ,KAAK,SAAS8D,KAAK8L,GAAGgG,IAAG,SAAU9J,EAAEmD,GAAG,OAAO5X,GAAE,SAAU5E,GAAG,OAAOwqB,GAAG3d,EAAH2d,CAAMnR,EAAE/W,IAAIka,GAAGlD,OAAM,SAAUzM,GAAG,GAAG,MAAMA,EAAEwZ,OAAO,MAAMxZ,EAAE,OAAO7M,GAAI,GAAG,GAAG,GAAE,CAAC,EAAEyqB,EAAE,SAAS5d,GAAG,OAAO,SAASwM,EAAEmD,EAAExc,GAAG,IAAIoG,EAAEyf,EAAE7lB,GAAG,OAAOoG,EAAE4e,gBAAgB,qBAAqB3L,EAAExM,EAAEqc,YAAYE,MAAM,CAACjC,OAAOL,EAAEvZ,KAAK,qBAAqB8D,KAAK,CAACqZ,QAAQlO,IAAIpW,EAAE,CAAC,EAAEukB,EAAE,SAAS9d,GAAG,OAAO,SAASwM,EAAEmD,EAAExc,GAAG,OAAO6M,EAAEqc,YAAYE,MAAM,CAACjC,OAAOL,EAAEvZ,KAAK,2BAA2B8D,KAAK,CAACuZ,MAAMvR,EAAEqR,QAAQlO,IAAIxc,EAAE,CAAC,EAAE6qB,EAAE,SAAShe,GAAG,OAAO,SAASwM,EAAEmD,GAAG,OAAO6I,EAAExY,EAAEqc,YAAYE,MAAM,CAACjC,OAAOL,EAAEvZ,KAAKoY,EAAE,2BAA2BtM,GAAGhI,KAAK,CAACyZ,gCAA+B,EAAGC,SAAS,CAACC,OAAO,WAAWC,KAAK,MAAMzO,IAAG,SAAUnD,EAAEmD,GAAG,OAAO0O,GAAGre,EAAHqe,CAAM7R,EAAE8R,OAAO3O,EAAG,GAAE,CAAC,EAAE4O,EAAE,SAASve,GAAG,OAAO,SAASwM,EAAEmD,EAAExc,GAAG,OAAOqlB,EAAExY,EAAEqc,YAAYE,MAAM,CAACjC,OAAOL,EAAEvZ,KAAKoY,EAAE,yBAAyBtM,GAAGhI,KAAK,CAACga,UAAU,OAAOC,YAAY9O,IAAIxc,IAAG,SAAUwc,EAAExc,GAAG,OAAOurB,GAAG1e,EAAH0e,CAAMlS,EAAE,CAACmS,QAAQ,CAACC,SAASC,MAAMD,SAASjP,EAAE2O,OAAOnrB,EAAG,GAAE,CAAC,EAAE2rB,EAAE,SAAS9e,GAAG,OAAO,SAASwM,EAAErZ,EAAEoG,GAAG,OAAOglB,EAAEve,EAAFue,CAAK/R,EAAErZ,EAAEwc,EAAEA,EAAE,CAAC,EAAEpW,GAAG,CAAC,EAAE,CAACwlB,MAAM,CAACC,GAAGC,SAAS,CAAC,EAAEC,EAAE,SAASlf,GAAG,OAAO,SAASwM,EAAErZ,EAAEoG,GAAG,OAAOglB,EAAEve,EAAFue,CAAK/R,EAAErZ,EAAEwc,EAAEA,EAAE,CAAC,EAAEpW,GAAG,CAAC,EAAE,CAACwlB,MAAM,CAACC,GAAGG,YAAY,CAAC,EAAEC,EAAE,SAASpf,GAAG,OAAO,SAASwM,EAAErZ,EAAEoG,GAAG,OAAOglB,EAAEve,EAAFue,CAAK/R,EAAErZ,EAAEwc,EAAEA,EAAE,CAAC,EAAEpW,GAAG,CAAC,EAAE,CAACwlB,MAAM,CAACC,GAAGK,YAAY,CAAC,EAAEC,EAAE,SAAStf,GAAG,OAAO,SAASwM,EAAEmD,GAAG,OAAOnD,EAAE8N,SAASN,EAAEha,EAAEqc,YAAYF,KAAK3P,EAAEmD,GAAG3P,EAAEqc,YAAYE,MAAM/P,EAAEmD,EAAE,CAAC,EAAE4P,EAAE,SAASvf,GAAG,OAAO,SAASwM,EAAEmD,GAAG,OAAO6I,EAAExY,EAAEqc,YAAYE,MAAM,CAACjC,OAAOP,EAAErZ,KAAKoY,EAAE,YAAYtM,IAAImD,IAAG,SAAUA,EAAExc,GAAG,OAAO4E,GAAE,SAAU4X,GAAG,OAAOgO,GAAG3d,EAAH2d,CAAMnR,EAAErZ,GAAGkZ,KAAKsD,GAAGlD,OAAM,SAAUzM,GAAG,GAAG,MAAMA,EAAEwZ,OAAO,MAAMxZ,CAAE,GAAG,GAAG,GAAE,CAAC,EAAEwf,EAAE,SAASxf,GAAG,OAAO,SAASwM,EAAEmD,EAAExc,GAAG,IAAIoG,EAAEoW,EAAErU,KAAI,SAAU0E,GAAG,MAAM,CAACme,OAAO,cAAcC,KAAK,CAACqB,SAASzf,GAAI,IAAG,OAAOwY,EAAExY,EAAEqc,YAAYE,MAAM,CAACjC,OAAOL,EAAEvZ,KAAKoY,EAAE,2BAA2BtM,GAAGhI,KAAK,CAACyZ,gCAA+B,EAAGC,SAAS3kB,IAAIpG,IAAG,SAAUqZ,EAAEmD,GAAG,OAAO0O,GAAGre,EAAHqe,CAAM7R,EAAE8R,OAAO3O,EAAG,GAAE,CAAC,EAAEgO,GAAG,SAAS3d,GAAG,OAAO,SAASwM,EAAEmD,GAAG,OAAO3P,EAAEqc,YAAYF,KAAK,CAAC7B,OAAON,EAAEtZ,KAAKoY,EAAE,YAAYtM,IAAImD,EAAE,CAAC,EAAE+P,GAAG,SAAS1f,GAAG,OAAO,SAASwM,EAAEmD,GAAG,OAAO3P,EAAEqc,YAAYF,KAAK,CAAC7B,OAAON,EAAEtZ,KAAKoY,EAAE,YAAYtM,EAAEnJ,aAAasM,EAAE,CAAC,EAAEgQ,GAAG,SAAS3f,GAAG,OAAO,SAASwM,GAAG,OAAOxM,EAAEqc,YAAYF,KAAK,CAAC7B,OAAON,EAAEtZ,KAAK,8BAA8B8L,EAAE,CAAC,EAAEoT,GAAG,SAAS5f,GAAG,OAAO,SAASwM,GAAG,OAAOxM,EAAEqc,YAAYF,KAAK,CAAC7B,OAAON,EAAEtZ,KAAK,UAAU8L,EAAE,CAAC,EAAEqT,GAAG,SAAS7f,GAAG,OAAO,SAASwM,GAAG,OAAOxM,EAAEqc,YAAYF,KAAK,CAAC7B,OAAON,EAAEtZ,KAAK,0BAA0B8L,EAAE,CAAC,EAAEsT,GAAG,SAAS9f,GAAG,OAAO,SAASwM,EAAEmD,GAAG,OAAO3P,EAAEqc,YAAYF,KAAK,CAAC7B,OAAON,EAAEtZ,KAAKoY,EAAE,wBAAwBtM,IAAImD,EAAE,CAAC,EAAEoQ,GAAG,SAAS/f,GAAG,OAAO,SAASwM,GAAG,IAAImD,EAAEnD,GAAG,CAAC,EAAEjT,EAAEoW,EAAEqQ,iBAAiB9J,EAAE/iB,EAAEwc,EAAE,CAAC,qBAAqB,OAAM,IAAKpW,IAAI2c,EAAE+J,aAAY,GAAIjgB,EAAEqc,YAAYF,KAAK,CAAC7B,OAAON,EAAEtZ,KAAK,8BAA8BwV,EAAE,CAAC,EAAEwI,GAAG,SAAS1e,GAAG,OAAO,SAASwM,GAAG,IAAImD,EAAE3b,UAAUD,OAAO,QAAG,IAASC,UAAU,GAAGA,UAAU,GAAG,CAAC,EAA0D,OAAO6kB,EAA7D,CAACwD,YAAYrc,EAAEqc,YAAY6D,MAAMlgB,EAAEkgB,MAAMrS,UAAUrB,GAAcmD,EAAEgP,QAAQ,CAAC,EAAEwB,GAAG,SAASngB,GAAG,OAAO,SAASwM,GAAG,OAAOxM,EAAEqc,YAAYF,KAAK,CAAC7B,OAAON,EAAEtZ,KAAK,UAAU8L,EAAE,CAAC,EAAE4T,GAAG,SAASpgB,GAAG,OAAO,SAASwM,GAAG,OAAOxM,EAAEqc,YAAYF,KAAK,CAAC7B,OAAON,EAAEtZ,KAAK,cAAc8L,EAAE,CAAC,EAAE6T,GAAG,SAASrgB,GAAG,OAAO,SAASwM,GAAG,OAAOxM,EAAEqc,YAAYF,KAAK,CAAC7B,OAAON,EAAEtZ,KAAK,aAAa8L,EAAE,CAAC,EAAE8T,GAAG,SAAStgB,GAAG,OAAO,SAASwM,GAAG,OAAOxM,EAAEqc,YAAYF,KAAK,CAAC7B,OAAON,EAAEtZ,KAAK,sBAAsB8L,EAAE,CAAC,EAAE+T,GAAG,SAASvgB,GAAG,OAAO,SAASwM,EAAEmD,EAAExc,GAAG,OAAOqlB,EAAExY,EAAEqc,YAAYE,MAAM,CAACjC,OAAOL,EAAEvZ,KAAKoY,EAAE,yBAAyBtM,GAAGhI,KAAK,CAACga,UAAU,OAAOC,YAAY9O,IAAIxc,IAAG,SAAUwc,EAAExc,GAAG,OAAOurB,GAAG1e,EAAH0e,CAAMlS,EAAE,CAACmS,QAAQ,CAACC,SAASC,MAAMD,SAASjP,EAAE2O,OAAOnrB,EAAG,GAAE,CAAC,EAAEqtB,GAAG,SAASxgB,GAAG,OAAO,SAASwM,EAAEmD,GAAG,OAAO6I,EAAExY,EAAEqc,YAAYE,MAAM,CAACjC,OAAOL,EAAEvZ,KAAK,oBAAoB8D,KAAK,CAAC0Z,SAAS1R,IAAImD,IAAG,SAAUnD,EAAEmD,GAAG,OAAO/C,QAAQ4K,IAAIpf,OAAOC,KAAKmU,EAAE8R,QAAQhjB,KAAI,SAAUnI,GAAG,OAAOurB,GAAG1e,EAAH0e,CAAMvrB,EAAE,CAACwrB,QAAQ,CAACC,SAASC,MAAMD,SAASpS,EAAE8R,OAAOnrB,GAAGwc,EAAG,IAAI,GAAE,CAAC,EAAE8Q,GAAG,SAASzgB,GAAG,OAAO,SAASwM,EAAEmD,GAAG,OAAO3P,EAAEqc,YAAYF,KAAK,CAAC7B,OAAOL,EAAEvZ,KAAK,sBAAsB8D,KAAK,CAAC0Z,SAAS1R,IAAImD,EAAE,CAAC,EAAE+Q,GAAG,SAAS1gB,GAAG,OAAO,SAASwM,EAAErZ,GAAG,IAAIoG,EAAEiT,EAAElR,KAAI,SAAU0E,GAAG,OAAO2P,EAAEA,EAAE,CAAC,EAAE3P,GAAG,CAAC,EAAE,CAACnG,OAAO6iB,EAAE1c,EAAEnG,QAAQ,CAAC,IAAK,IAAG,OAAOmG,EAAEqc,YAAYF,KAAK,CAAC7B,OAAOL,EAAEvZ,KAAK,sBAAsB8D,KAAK,CAAC0Z,SAAS3kB,GAAG2f,WAAU,GAAI/lB,EAAE,CAAC,EAAEwtB,GAAG,SAAS3gB,GAAG,OAAO,SAASwM,EAAEjT,GAAG,OAAOqT,QAAQ4K,IAAIhL,EAAElR,KAAI,SAAUkR,GAAG,IAAI0J,EAAE1J,EAAE3S,OAAOjG,EAAEsiB,EAAEnY,UAAUuY,EAAEJ,EAAEP,WAAWrF,EAAEnd,EAAE+iB,EAAE,CAAC,YAAY,eAAe,OAAOwI,GAAG1e,EAAH0e,CAAMlS,EAAEqB,UAAU,CAAC8Q,QAAQ,CAACvR,qBAAqBwT,MAAMxT,qBAAqBxZ,EAAE0iB,EAAE3G,EAAEA,EAAE,CAAC,EAAEpW,GAAG+W,GAAI,IAAG,CAAC,EAAEuQ,GAAG,SAAS7gB,GAAG,OAAO,SAASwM,EAAEmD,GAAG,IAAIxc,EAAE6lB,EAAErJ,GAAG,OAAOxc,EAAEglB,gBAAgB,qBAAqB3L,EAAExM,EAAEqc,YAAYE,MAAM,CAACjC,OAAOP,EAAErZ,KAAK,sBAAsBvN,EAAE,CAAC,EAAE2tB,GAAG,SAAS9gB,GAAG,OAAO,SAASwM,EAAEmD,EAAExc,GAAG,IAAIoG,EAAEoW,EAAErU,KAAI,SAAU0E,GAAG,MAAM,CAACme,OAAO,WAAWC,KAAKpe,EAAG,IAAG,OAAOwY,EAAExY,EAAEqc,YAAYE,MAAM,CAACjC,OAAOL,EAAEvZ,KAAKoY,EAAE,2BAA2BtM,GAAGhI,KAAK,CAACyZ,gCAA+B,EAAGC,SAAS3kB,IAAIpG,IAAG,SAAUqZ,EAAEmD,GAAG,OAAO0O,GAAGre,EAAHqe,CAAM7R,EAAE8R,OAAO3O,EAAG,GAAE,CAAC,EAAEoR,GAAG,SAAS/gB,GAAG,OAAO,SAASwM,EAAEmD,GAAG,OAAO6I,EAAExY,EAAEqc,YAAYE,MAAM,CAACjC,OAAOL,EAAEvZ,KAAKoY,EAAE,oBAAoBtM,IAAImD,IAAG,SAAUA,EAAExc,GAAG,OAAO4E,GAAE,SAAU4X,GAAG,OAAOgO,GAAG3d,EAAH2d,CAAMnR,EAAErZ,GAAGsZ,OAAM,SAAUzM,GAAG,GAAG,MAAMA,EAAEwZ,OAAO,MAAMxZ,EAAE,OAAO2P,GAAI,GAAG,GAAG,GAAE,CAAC,EAAEqR,GAAG,SAAShhB,GAAG,OAAO,SAASwM,EAAEmD,EAAExc,GAAG,IAAIoG,EAAEoW,EAAErU,KAAI,SAAU0E,GAAG,MAAM,CAACme,OAAO,WAAWC,KAAKpe,EAAG,IAAG,OAAOwY,EAAExY,EAAEqc,YAAYE,MAAM,CAACjC,OAAOL,EAAEvZ,KAAKoY,EAAE,2BAA2BtM,GAAGhI,KAAK,CAACyZ,gCAA+B,EAAGC,SAAS3kB,IAAIpG,IAAG,SAAUqZ,EAAEmD,GAAG,OAAO0O,GAAGre,EAAHqe,CAAM7R,EAAE8R,OAAO3O,EAAG,GAAE,CAAC,EAAEsR,GAAG,SAASjhB,GAAG,OAAO,SAASwM,EAAEmD,EAAExc,GAAG,OAAO6M,EAAEqc,YAAYF,KAAK,CAAC7B,OAAOL,EAAEvZ,KAAKoY,EAAE,4BAA4BtM,GAAGhI,KAAK,CAACvH,MAAM0S,GAAGuJ,WAAU,GAAI/lB,EAAE,CAAC,EAAE+tB,GAAG,SAASlhB,GAAG,OAAO,SAASwM,EAAEmD,GAAG,OAAO3P,EAAEqc,YAAYF,KAAK,CAAC7B,OAAOL,EAAEvZ,KAAK,4BAA4B8D,KAAK,CAACvH,MAAMuP,IAAImD,EAAE,CAAC,EAAEwR,GAAG,SAASnhB,GAAG,OAAO,SAASwM,EAAEmD,GAAG,OAAO6I,EAAExY,EAAEqc,YAAYE,MAAM,CAACjC,OAAOJ,EAAExZ,KAAK,6BAA6B8D,KAAKgI,GAAGmD,IAAG,SAAUnD,EAAEmD,GAAG,OAAO0O,GAAGre,EAAHqe,CAAM7R,EAAE8R,OAAO3O,EAAG,GAAE,CAAC,EAAEyR,GAAG,SAASphB,GAAG,OAAO,SAASwM,EAAEmD,GAAG,IAAIpW,EAAEnB,OAAOqgB,OAAO,CAAC,EAAE9I,GAAGuG,EAAEvG,GAAG,CAAC,EAAE/b,EAAEsiB,EAAEiC,gBAAgB7B,EAAEnjB,EAAE+iB,EAAE,CAAC,oBAAoB5F,EAAE1c,EAAE,CAACukB,gBAAgBvkB,GAAG,CAAC,EAAEokB,EAAE,CAAC,MAAM,UAAU,WAAW,kBAAkB,kBAAkB,cAAc,yBAAyB,mBAAmB,OAAOQ,EAAExY,EAAEqc,YAAYE,MAAM,CAACjC,OAAOJ,EAAExZ,KAAKoY,EAAE,YAAYtM,GAAGhI,KAAK8L,GAAGgG,IAAG,SAAU3G,EAAExc,GAAG,OAAO4E,GAAE,SAAU4X,GAAG,OAAOgO,GAAG3d,EAAH2d,CAAMnR,EAAErZ,GAAGkZ,MAAK,SAAUrM,GAAG,OAAO,SAASA,GAAG,OAAO5H,OAAOC,KAAKkB,GAAGb,QAAO,SAAUsH,GAAG,OAAO,IAAIgY,EAAEjf,QAAQiH,EAAG,IAAGtG,OAAM,SAAU8S,GAAG,GAAGnY,MAAMoF,QAAQuG,EAAEwM,KAAKnY,MAAMoF,QAAQF,EAAEiT,IAAI,CAAC,IAAImD,EAAE3P,EAAEwM,GAAG,OAAOmD,EAAE5b,SAASwF,EAAEiT,GAAGzY,QAAQ4b,EAAEjW,OAAM,SAAUsG,EAAE2P,GAAG,OAAO3P,IAAIzG,EAAEiT,GAAGmD,EAAG,GAAE,CAAC,OAAO3P,EAAEwM,KAAKjT,EAAEiT,EAAG,GAAE,CAA7P,CAA+PxM,GAAG4M,QAAQC,UAAU8C,GAAI,GAAG,GAAG,GAAE,CAAC,EAAE0O,GAAG,SAASre,GAAG,OAAO,SAASwM,EAAEmD,GAAG,OAAO5X,GAAE,SAAU5E,GAAG,OAAOusB,GAAG1f,EAAH0f,CAAMlT,EAAEmD,GAAGtD,MAAK,SAAUrM,GAAG,MAAM,cAAcA,EAAEwZ,OAAOrmB,SAAI,CAAO,GAAG,GAAE,CAAC,EAAEkuB,GAAG,SAASrhB,GAAG,OAAO,SAASwM,EAAEmD,GAAG,OAAO6I,EAAExY,EAAEqc,YAAYE,MAAM,CAACjC,OAAOL,EAAEvZ,KAAKoY,EAAE,qBAAqB9Y,EAAE6N,WAAWrJ,KAAK,CAAC0Z,SAAS1R,IAAImD,IAAG,SAAUnD,EAAEmD,GAAG,OAAOkP,GAAG7e,EAAH6e,CAAMrS,EAAE8R,OAAO3O,EAAG,GAAE,CAAC,EAAE2R,GAAG,SAASthB,GAAG,OAAO,SAASwM,GAAG,OAAO4Q,EAAEzN,EAAEA,EAAE,CAAC4N,WAAW,SAASvd,GAAG,YAAO,IAASA,EAAEwd,MAAM,GAAGhR,GAAG,CAAC,EAAE,CAAC0O,QAAQ,SAASvL,GAAG,OAAO3P,EAAEqc,YAAYF,KAAK,CAAC7B,OAAOL,EAAEvZ,KAAKoY,EAAE,sBAAsB9Y,EAAE6N,WAAWrJ,KAAKmL,GAAGnD,EAAE,IAAI,CAAC,EAAE+U,GAAG,SAASvhB,GAAG,OAAO,SAASwM,GAAG,IAAIrZ,EAAEwc,EAAE,CAACnS,YAAY,KAAKgP,GAAG,OAAO4Q,EAAEzN,EAAEA,EAAE,CAAC4N,WAAW,SAASvd,GAAG,OAAOA,EAAEsd,KAAKvpB,OAAOZ,EAAEqK,WAAW,GAAGrK,GAAG,CAAC,EAAE,CAAC+nB,QAAQ,SAAS1O,GAAG,OAAOgV,GAAGxhB,EAAHwhB,CAAM,GAAG7R,EAAEA,EAAE,CAAC,EAAExc,GAAGqZ,IAAIH,MAAK,SAAUrM,GAAG,OAAO2P,EAAEA,EAAE,CAAC,EAAE3P,GAAG,CAAC,EAAE,CAACsd,KAAKtd,EAAEsd,KAAKhiB,KAAI,SAAU0E,GAAG,cAAcA,EAAEyhB,iBAAiBzhB,CAAE,KAAK,GAAE,IAAI,CAAC,EAAE0hB,GAAG,SAAS1hB,GAAG,OAAO,SAASwM,GAAG,IAAIrZ,EAAEwc,EAAE,CAACnS,YAAY,KAAKgP,GAAG,OAAO4Q,EAAEzN,EAAEA,EAAE,CAAC4N,WAAW,SAASvd,GAAG,OAAOA,EAAEsd,KAAKvpB,OAAOZ,EAAEqK,WAAW,GAAGrK,GAAG,CAAC,EAAE,CAAC+nB,QAAQ,SAAS1O,GAAG,OAAOmV,GAAG3hB,EAAH2hB,CAAM,GAAGhS,EAAEA,EAAE,CAAC,EAAExc,GAAGqZ,IAAIH,MAAK,SAAUrM,GAAG,OAAO2P,EAAEA,EAAE,CAAC,EAAE3P,GAAG,CAAC,EAAE,CAACsd,KAAKtd,EAAEsd,KAAKhiB,KAAI,SAAU0E,GAAG,cAAcA,EAAEyhB,iBAAiBzhB,CAAE,KAAK,GAAE,IAAI,CAAC,EAAE4hB,GAAG,SAAS5hB,GAAG,OAAO,SAASwM,EAAEmD,EAAEpW,GAAG,IAAI2c,EAAE3c,GAAG,CAAC,EAAE3F,EAAEsiB,EAAE2L,UAAUvL,EAAEnjB,EAAE+iB,EAAE,CAAC,cAAc5F,EAAE,CAACwR,QAAQ,GAAGC,UAAU,IAAI,OAAOvJ,EAAE,SAASrlB,IAAI,IAAIoG,EAA6Dye,EAAE,GAAG,IAAIze,EAAlEvF,UAAUD,OAAO,QAAG,IAASC,UAAU,GAAGA,UAAU,GAAG,EAAeuF,EAAEiT,EAAEzY,SAASikB,EAAEpjB,KAAK4X,EAAEjT,IAAIye,EAAEjkB,UAAUH,GAAG,MAAM2F,KAAK,OAAO,IAAIye,EAAEjkB,OAAO6Y,QAAQC,QAAQyD,GAAG+Q,GAAGrhB,EAAHqhB,CAAMrJ,EAAE1c,KAAI,SAAU0E,GAAG,MAAM,CAACme,OAAOxO,EAAEyO,KAAKpe,EAAG,IAAGsW,GAAGjK,MAAK,SAAUrM,GAAG,OAAOsQ,EAAEyR,UAAUzR,EAAEyR,UAAUrqB,OAAOsI,EAAE+hB,WAAWzR,EAAEwR,QAAQltB,KAAKoL,EAAEse,QAAQ/kB,IAAIpG,EAAEoG,EAAG,GAAE,CAAtV,IAA0V,SAAUiT,EAAEmD,GAAG,OAAO/C,QAAQ4K,IAAIhL,EAAEsV,QAAQxmB,KAAI,SAAUkR,GAAG,OAAOqS,GAAG7e,EAAH6e,CAAMrS,EAAEmD,EAAG,IAAI,GAAE,CAAC,EAAEqS,GAAG,SAAShiB,GAAG,OAAO,SAASwM,GAAG,OAAOgM,EAAExY,EAAEqc,YAAYE,MAAM,CAACjC,OAAOL,EAAEvZ,KAAKoY,EAAE,qBAAqB9Y,EAAE6N,YAAYrB,IAAG,SAAUA,EAAEmD,GAAG,OAAOkP,GAAG7e,EAAH6e,CAAMrS,EAAE8R,OAAO3O,EAAG,GAAE,CAAC,EAAEsS,GAAG,SAASjiB,GAAG,OAAO,SAASwM,GAAG,IAAImD,EAAEnD,GAAG,CAAC,EAAEjT,EAAEoW,EAAEuS,kBAAkBhM,EAAE8C,EAAE7lB,EAAEwc,EAAE,CAAC,uBAAuB,OAAOpW,IAAI2c,EAAEiC,gBAAgB+J,kBAAkB,GAAG1J,EAAExY,EAAEqc,YAAYE,MAAM,CAACjC,OAAOL,EAAEvZ,KAAKoY,EAAE,2BAA2B9Y,EAAE6N,YAAYqI,IAAG,SAAU1J,EAAEmD,GAAG,OAAOkP,GAAG7e,EAAH6e,CAAMrS,EAAE8R,OAAO3O,EAAG,GAAE,CAAC,EAAEwS,GAAG,SAASniB,GAAG,OAAO,SAASwM,GAAG,IAAImD,EAAEnD,GAAG,CAAC,EAAEjT,EAAEoW,EAAEuS,kBAAkBhM,EAAE8C,EAAE7lB,EAAEwc,EAAE,CAAC,uBAAuB,OAAOpW,IAAI2c,EAAEiC,gBAAgB+J,kBAAkB,GAAG1J,EAAExY,EAAEqc,YAAYE,MAAM,CAACjC,OAAOL,EAAEvZ,KAAKoY,EAAE,8BAA8B9Y,EAAE6N,YAAYqI,IAAG,SAAU1J,EAAEmD,GAAG,OAAOkP,GAAG7e,EAAH6e,CAAMrS,EAAE8R,OAAO3O,EAAG,GAAE,CAAC,EAAEyS,GAAG,SAASpiB,GAAG,OAAO,SAASwM,EAAEmD,GAAG,OAAO6I,EAAExY,EAAEqc,YAAYE,MAAM,CAACjC,OAAOL,EAAEvZ,KAAKoY,EAAE,6BAA6B9Y,EAAE6N,WAAWrJ,KAAKgI,GAAGmD,IAAG,SAAUnD,EAAEmD,GAAG,OAAOkP,GAAG7e,EAAH6e,CAAMrS,EAAE8R,OAAO3O,EAAG,GAAE,CAAC,EAAE0S,GAAG,SAASriB,GAAG,OAAO,SAASwM,GAAG,OAAOgM,EAAExY,EAAEqc,YAAYE,MAAM,CAACjC,OAAOP,EAAErZ,KAAKoY,EAAE,eAAe9Y,EAAE6N,YAAYrB,IAAG,SAAUA,EAAEmD,GAAG,OAAOkP,GAAG7e,EAAH6e,CAAMrS,EAAE8R,OAAO3O,EAAG,GAAE,CAAC,EAAE2S,GAAG,SAAStiB,GAAG,OAAO,SAASwM,EAAEmD,GAAG,OAAO6I,EAAE+J,GAAGviB,EAAHuiB,CAAM,CAAC/V,GAAGmD,GAAGtD,MAAK,SAAUrM,GAAG,MAAM,CAACse,OAAOte,EAAE8hB,QAAQ,GAAI,KAAG,SAAUtV,EAAEmD,GAAG,OAAOkP,GAAG7e,EAAH6e,CAAMrS,EAAE8R,OAAO3O,EAAG,GAAE,CAAC,EAAE4S,GAAG,SAASviB,GAAG,OAAO,SAASwM,EAAEmD,GAAG,IAAIxc,EAAEqZ,EAAElR,KAAI,SAAU0E,GAAG,MAAM,CAACyf,SAASzf,EAAG,IAAG,OAAO4hB,GAAG5hB,EAAH4hB,CAAMzuB,EAAEqvB,GAAGC,aAAa9S,EAAE,CAAC,EAAE+S,GAAG,SAAS1iB,GAAG,OAAO,SAASwM,EAAEmD,GAAG,IAAIpW,EAAEoW,GAAG,CAAC,EAAEuG,EAAE3c,EAAE2oB,kBAAkBtuB,EAAEolB,EAAE7lB,EAAEoG,EAAE,CAAC,uBAAuB,OAAO2c,IAAItiB,EAAEukB,gBAAgB+J,kBAAkB,GAAG1J,EAAExY,EAAEqc,YAAYE,MAAM,CAACjC,OAAOP,EAAErZ,KAAKoY,EAAE,wBAAwB9Y,EAAE6N,UAAUrB,IAAI5Y,IAAG,SAAU4Y,EAAEmD,GAAG,OAAOkP,GAAG7e,EAAH6e,CAAMrS,EAAE8R,OAAO3O,EAAG,GAAE,CAAC,EAAEgT,GAAG,SAAS3iB,GAAG,OAAO,SAASwM,EAAEmD,GAAG,IAAIpW,EAAEoW,GAAG,CAAC,EAAEuG,EAAE3c,EAAE2oB,kBAAkBtuB,EAAEolB,EAAE7lB,EAAEoG,EAAE,CAAC,uBAAuB,OAAO2c,IAAItiB,EAAEukB,gBAAgB+J,kBAAkB,GAAG1J,EAAExY,EAAEqc,YAAYE,MAAM,CAACjC,OAAOP,EAAErZ,KAAKoY,EAAE,2BAA2B9Y,EAAE6N,UAAUrB,IAAI5Y,IAAG,SAAU4Y,EAAEmD,GAAG,OAAOkP,GAAG7e,EAAH6e,CAAMrS,EAAE8R,OAAO3O,EAAG,GAAE,CAAC,EAAEiT,GAAG,SAAS5iB,GAAG,OAAO,SAASwM,GAAG,OAAOqW,GAAG7iB,EAAH6iB,CAAMrW,GAAGH,MAAK,WAAY,OAAM,CAAG,IAAGI,OAAM,SAAUzM,GAAG,GAAG,MAAMA,EAAEwZ,OAAO,MAAMxZ,EAAE,OAAM,CAAG,GAAE,CAAC,EAAE8iB,GAAG,SAAS9iB,GAAG,OAAO,SAASwM,EAAEmD,EAAExc,GAAG,OAAO6M,EAAEqc,YAAYF,KAAK,CAAC7B,OAAOL,EAAEvZ,KAAKoY,EAAE,0BAA0B9Y,EAAE6N,WAAWrJ,KAAK,CAACvH,MAAMuP,EAAEW,eAAewC,GAAGuJ,WAAU,GAAI/lB,EAAE,CAAC,EAAE4vB,GAAG,SAAS/iB,GAAG,OAAO,SAASwM,EAAE0J,GAAG,IAAItiB,EAAEsiB,GAAG,CAAC,EAAEI,EAAE1iB,EAAEqJ,MAAMqT,EAAE1c,EAAEovB,SAAShL,EAAE7kB,EAAES,EAAE,CAAC,QAAQ,aAAamE,EAAE,EAAE,OAAO,SAAS5E,IAAI,OAAO8vB,GAAGjjB,EAAHijB,CAAM3M,GAAG,GAAG3G,EAAEA,EAAE,CAAC,EAAEqI,GAAG,CAAC,EAAE,CAAC5a,KAAKrF,KAAKsU,MAAK,SAAUrM,GAAG,IAAI,IAAI2P,EAAE,EAAEuG,EAAE9d,OAAO8e,QAAQlX,EAAEsd,MAAM3N,EAAEuG,EAAEniB,OAAO4b,IAAI,CAAC,IAAI/b,EAAE2F,EAAE2c,EAAEvG,GAAG,GAAG2G,EAAE1iB,EAAE,GAAGokB,EAAEpkB,EAAE,GAAG,GAAG4Y,EAAEwL,GAAG,MAAM,CAACtE,OAAOsE,EAAE1iB,SAAS4tB,SAAS5M,EAAE,IAAIlZ,KAAKrF,EAAE,CAAC,GAAGA,KAAI,IAAKuY,GAAGvY,GAAGiI,EAAEmjB,QAAQ,KAAK,CAACjnB,KAAK,sBAAsBwe,QAAQ,qBAAqB,OAAOvnB,GAAI,GAAE,CAA5T,EAA+T,CAAC,EAAEiwB,GAAG,SAASpjB,GAAG,OAAO,SAASwM,EAAEmD,GAAG,OAAO3P,EAAEqc,YAAYF,KAAK,CAAC7B,OAAON,EAAEtZ,KAAKoY,EAAE,kBAAkB9Y,EAAE6N,UAAUrB,IAAImD,EAAE,CAAC,EAAE0T,GAAG,WAAW,OAAO,SAASrjB,EAAEwM,GAAG,IAAI,IAAImD,EAAE,EAAExc,EAAEiF,OAAO8e,QAAQlX,EAAEsd,MAAM3N,EAAExc,EAAEY,OAAO4b,IAAI,CAAC,IAAIuG,EAAE3c,EAAEpG,EAAEwc,GAAG,GAAG/b,EAAEsiB,EAAE,GAAG,GAAGA,EAAE,GAAGuJ,WAAWjT,EAAE,OAAO0W,SAAStvB,EAAE,GAAG,CAAC,OAAO,CAAC,CAAC,EAAE0vB,GAAG,SAAStjB,GAAG,OAAO,SAASwM,EAAEjT,GAAG,IAAI2c,EAAE3c,GAAG,CAAC,EAAE3F,EAAEsiB,EAAEqN,qBAAqBjN,EAAEnjB,EAAE+iB,EAAE,CAAC,yBAAyB5F,EAAE9D,EAAElR,KAAI,SAAUkR,GAAG,OAAOmD,EAAE,CAAC9B,UAAU7N,EAAE6N,UAAU4R,SAASjT,GAAG5Y,EAAE,CAAC2vB,qBAAqB3vB,GAAG,CAAC,EAAG,IAAG,OAAOoM,EAAEqc,YAAYF,KAAK,CAAC7B,OAAOL,EAAEvZ,KAAK,sBAAsB8D,KAAK,CAAC0Z,SAAS5N,IAAIgG,EAAE,CAAC,EAAEkN,GAAG,SAASxjB,GAAG,OAAO,SAASwM,EAAEmD,GAAG,OAAO3P,EAAEqc,YAAYF,KAAK,CAAC7B,OAAON,EAAEtZ,KAAKoY,EAAE,wBAAwB9Y,EAAE6N,UAAUrB,IAAImD,EAAE,CAAC,EAAEkT,GAAG,SAAS7iB,GAAG,OAAO,SAASwM,GAAG,OAAOxM,EAAEqc,YAAYF,KAAK,CAAC7B,OAAON,EAAEtZ,KAAKoY,EAAE,wBAAwB9Y,EAAE6N,WAAWrJ,KAAK,CAACif,WAAW,IAAIjX,EAAE,CAAC,EAAEkX,GAAG,SAAS1jB,GAAG,OAAO,SAASwM,EAAEmD,GAAG,OAAO3P,EAAEqc,YAAYF,KAAK,CAAC7B,OAAON,EAAEtZ,KAAKoY,EAAE,2BAA2B9Y,EAAE6N,UAAUrB,IAAImD,EAAE,CAAC,EAAEgU,GAAG,SAAS3jB,GAAG,OAAO,SAASwM,EAAEmD,GAAG,OAAO6I,EAAEoL,GAAG5jB,EAAH4jB,CAAM,CAACpX,GAAGmD,GAAGtD,MAAK,SAAUrM,GAAG,MAAM,CAACyf,SAASzf,EAAE+hB,UAAU,GAAGzD,OAAOte,EAAE8hB,QAAQ,GAAI,KAAG,SAAUtV,EAAEmD,GAAG,OAAOkP,GAAG7e,EAAH6e,CAAMrS,EAAE8R,OAAO3O,EAAG,GAAE,CAAC,EAAEiU,GAAG,SAAS5jB,GAAG,OAAO,SAASwM,EAAEmD,GAAG,IAAIpW,EAAEoW,GAAG,CAAC,EAAEuG,EAAE3c,EAAEsqB,kBAAkBjwB,EAAET,EAAEoG,EAAE,CAAC,sBAAsB+c,EAAEJ,EAAEsM,GAAGsB,oBAAoBtB,GAAGuB,4BAA4B,OAAOnC,GAAG5hB,EAAH4hB,CAAMpV,EAAE8J,EAAE1iB,EAAE,CAAC,EAAEowB,GAAG,SAAShkB,GAAG,OAAO,SAASwM,EAAE5Y,GAAG,IAAI0iB,EAAE1iB,GAAG,CAAC,EAAE0c,EAAEgG,EAAE2N,KAAKjM,EAAE1B,EAAE4N,+BAA+BnsB,EAAEue,EAAEuL,UAAUlP,EAAExf,EAAEmjB,EAAE,CAAC,OAAO,iCAAiC,cAAcuC,EAAE,SAASrM,EAAEmD,EAAExc,EAAEoG,GAAG,OAAOif,EAAExY,EAAEqc,YAAYE,MAAM,CAACjC,OAAOL,EAAEvZ,KAAKoY,EAAE,yBAAyBtM,GAAGhI,KAAK,CAACga,UAAUrrB,EAAEsrB,YAAY9O,IAAIpW,IAAG,SAAUiT,EAAEmD,GAAG,OAAOkP,GAAG7e,EAAH6e,CAAMrS,EAAE8R,OAAO3O,EAAG,GAAE,EAAEjb,EAAE4jB,KAAKM,SAASvV,SAAS,IAAI8gB,UAAU,GAAGnL,EAAE,GAAGthB,OAAOsI,EAAE6N,UAAU,SAASnW,OAAOhD,GAAGS,EAAEivB,GAAG,CAAClE,MAAMlgB,EAAEkgB,MAAM7D,YAAYrc,EAAEqc,YAAYxO,UAAUmL,IAAIlhB,EAAE,GAAG0B,EAAEqf,EAAE7Y,EAAE6N,UAAUmL,EAAE,OAAOrJ,EAAEA,EAAE,CAAC,EAAEgD,GAAG,CAAC,EAAE,CAACoM,MAAM,CAAC,WAAW,WAAW,YAAY,OAAOjnB,EAAElD,KAAK4E,GAAGgf,GAAGlI,EAAE9W,EAAEkf,KAAK/F,GAAGnZ,GAAG6S,MAAK,WAAY,IAAIrM,EAAE7K,EAAEqX,EAAEmD,EAAEA,EAAE,CAAC,EAAEgD,GAAG,CAAC,EAAE,CAACuR,+BAA+BlM,EAAE6J,UAAU9pB,KAAK,OAAOD,EAAElD,KAAKoL,GAAGsQ,EAAEtQ,EAAE0Y,KAAK/F,GAAG3S,CAAE,IAAGqM,MAAK,WAAY,IAAIG,EAAEqM,EAAEG,EAAEhZ,EAAE6N,UAAU,OAAO8E,GAAG,OAAO7a,EAAElD,KAAK4X,GAAG8D,EAAE9D,EAAEkM,KAAK/F,GAAGnG,CAAE,IAAGH,MAAK,WAAY,OAAOO,QAAQ4K,IAAI1f,EAAG,IAAGuU,MAAK,SAAUrM,GAAG,IAAIwM,EAAEjT,EAAEyG,EAAE,GAAG2P,EAAEnD,EAAE,GAAGrZ,EAAEqZ,EAAE,GAAG5Y,EAAE4Y,EAAE,GAAG,MAAM,CAACuV,UAAU5uB,EAAE4uB,UAAUD,QAAQ,CAACnS,EAAE2O,QAAQ5mB,OAAOwe,EAAE/iB,EAAE2uB,SAAS,CAACluB,EAAE0qB,SAAU,KAAG,SAAUte,EAAEwM,GAAG,OAAOI,QAAQ4K,IAAI1f,EAAEwD,KAAI,SAAU0E,GAAG,OAAOA,EAAE0Y,KAAKlM,EAAG,IAAI,GAAE,CAAC,EAAE6X,GAAG,SAASrkB,GAAG,OAAO,SAASwM,EAAErZ,GAAG,OAAOmxB,GAAGtkB,EAAHskB,CAAM9X,EAAEmD,EAAEA,EAAE,CAAC,EAAExc,GAAG,CAAC,EAAE,CAACoxB,oBAAmB,IAAK,CAAC,EAAEC,GAAG,SAASxkB,GAAG,OAAO,SAASwM,EAAErZ,GAAG,OAAOsxB,GAAGzkB,EAAHykB,CAAMjY,EAAEmD,EAAEA,EAAE,CAAC,EAAExc,GAAG,CAAC,EAAE,CAACuxB,uBAAsB,IAAK,CAAC,EAAEC,GAAG,SAAS3kB,GAAG,OAAO,SAASwM,EAAEmD,GAAG,OAAO6I,EAAE4L,GAAGpkB,EAAHokB,CAAM,CAAC5X,GAAGmD,GAAGtD,MAAK,SAAUrM,GAAG,MAAM,CAACyf,SAASzf,EAAE+hB,UAAU,GAAGzD,OAAOte,EAAE8hB,QAAQ,GAAI,KAAG,SAAUtV,EAAEmD,GAAG,OAAOkP,GAAG7e,EAAH6e,CAAMrS,EAAE8R,OAAO3O,EAAG,GAAE,CAAC,EAAEyU,GAAG,SAASpkB,GAAG,OAAO,SAASwM,EAAEmD,GAAG,IAAIpW,EAAEoW,GAAG,CAAC,EAAEuG,EAAE3c,EAAE2qB,+BAA+BtwB,EAAET,EAAEoG,EAAE,CAAC,mCAAmC+c,EAAEJ,EAAEsM,GAAGoC,UAAUpC,GAAGqC,aAAa,GAAGvO,IAAIkM,GAAGqC,aAAa,CAAC,IAAIvU,GAAE,EAAG0H,GAAE,EAAGjgB,OAAE,EAAO,IAAI,IAAI,IAAI4a,EAAEkG,EAAErM,EAAE4J,OAAOC,cAAc/F,GAAGqC,EAAEkG,EAAEtC,QAAQC,MAAMlG,GAAE,EAAI,QAAG,IAASqC,EAAErb,MAAMmoB,SAAS,OAAOjH,EAAE5L,QAAQ0P,OAAO,CAACpgB,KAAK,uBAAuBwe,QAAQ,yOAA0O,CAAC,MAAM1a,GAAGgY,GAAE,EAAGjgB,EAAEiI,CAAC,CAAC,QAAQ,IAAIsQ,GAAG,MAAMuI,EAAEpC,QAAQoC,EAAEpC,QAAQ,CAAC,QAAQ,GAAGuB,EAAE,MAAMjgB,CAAC,CAAC,CAAC,CAAC,OAAO6pB,GAAG5hB,EAAH4hB,CAAMpV,EAAE8J,EAAE1iB,EAAE,CAAC,EAAEkxB,GAAG,SAAS9kB,GAAG,OAAO,SAASwM,EAAEmD,GAAG,OAAO2U,GAAGtkB,EAAHskB,CAAM,CAAC9X,GAAGmD,EAAE,CAAC,EAAE2U,GAAG,SAAStkB,GAAG,OAAO,SAASwM,EAAEmD,GAAG,IAAIpW,EAAEoW,GAAG,CAAC,EAAEuG,EAAE3c,EAAE2oB,kBAAkBtuB,EAAE2F,EAAEgrB,mBAAmBjO,EAAE0C,EAAE7lB,EAAEoG,EAAE,CAAC,oBAAoB,wBAAwB,OAAO2c,IAAII,EAAE6B,gBAAgB+J,kBAAkB,GAAGtuB,IAAI0iB,EAAE6B,gBAAgBoM,mBAAmB,GAAG/L,EAAExY,EAAEqc,YAAYE,MAAM,CAACjC,OAAOL,EAAEvZ,KAAKoY,EAAE,2BAA2B9Y,EAAE6N,WAAWrJ,KAAKgI,GAAG8J,IAAG,SAAU9J,EAAEmD,GAAG,OAAOkP,GAAG7e,EAAH6e,CAAMrS,EAAE8R,OAAO3O,EAAG,GAAE,CAAC,EAAEoV,GAAG,SAAS/kB,GAAG,OAAO,SAASwM,EAAEmD,GAAG,OAAO8U,GAAGzkB,EAAHykB,CAAM,CAACjY,GAAGmD,EAAE,CAAC,EAAE8U,GAAG,SAASzkB,GAAG,OAAO,SAASwM,EAAEmD,GAAG,IAAIpW,EAAEoW,GAAG,CAAC,EAAEuG,EAAE3c,EAAE2oB,kBAAkBtuB,EAAE2F,EAAEmrB,sBAAsBpO,EAAE/c,EAAEyrB,wBAAwB1U,EAAE0I,EAAE7lB,EAAEoG,EAAE,CAAC,oBAAoB,wBAAwB,6BAA6B,OAAO2c,IAAI5F,EAAE6H,gBAAgB+J,kBAAkB,IAAI5L,GAAG1iB,KAAK0c,EAAE6H,gBAAgB6M,wBAAwB,GAAGxM,EAAExY,EAAEqc,YAAYE,MAAM,CAACjC,OAAOL,EAAEvZ,KAAKoY,EAAE,8BAA8B9Y,EAAE6N,WAAWrJ,KAAKgI,GAAG8D,IAAG,SAAU9D,EAAEmD,GAAG,OAAOkP,GAAG7e,EAAH6e,CAAMrS,EAAE8R,OAAO3O,EAAG,GAAE,CAAC,EAAEsT,GAAG,SAASjjB,GAAG,OAAO,SAASwM,EAAEmD,GAAG,OAAO3P,EAAEqc,YAAYF,KAAK,CAAC7B,OAAOL,EAAEvZ,KAAKoY,EAAE,qBAAqB9Y,EAAE6N,WAAWrJ,KAAK,CAACvH,MAAMuP,GAAG0M,WAAU,GAAIvJ,EAAE,CAAC,EAAEiR,GAAG,SAAS5gB,GAAG,OAAO,SAASwM,EAAEmD,EAAExc,GAAG,OAAO6M,EAAEqc,YAAYF,KAAK,CAAC7B,OAAOL,EAAEvZ,KAAKoY,EAAE,+BAA+B9Y,EAAE6N,UAAUrB,GAAGhI,KAAK,CAACmR,WAAWhG,GAAGuJ,WAAU,GAAI/lB,EAAE,CAAC,EAAEquB,GAAG,SAASxhB,GAAG,OAAO,SAASwM,EAAEmD,GAAG,OAAO3P,EAAEqc,YAAYF,KAAK,CAAC7B,OAAOL,EAAEvZ,KAAKoY,EAAE,4BAA4B9Y,EAAE6N,WAAWrJ,KAAK,CAACvH,MAAMuP,IAAImD,EAAE,CAAC,EAAEgS,GAAG,SAAS3hB,GAAG,OAAO,SAASwM,EAAEmD,GAAG,OAAO3P,EAAEqc,YAAYF,KAAK,CAAC7B,OAAOL,EAAEvZ,KAAKoY,EAAE,+BAA+B9Y,EAAE6N,WAAWrJ,KAAK,CAACvH,MAAMuP,IAAImD,EAAE,CAAC,EAAEsV,GAAG,SAASjlB,GAAG,OAAO,SAASwM,EAAEmD,GAAG,IAAIpW,EAAEoW,GAAG,CAAC,EAAEuG,EAAE3c,EAAE2oB,kBAAkBtuB,EAAEolB,EAAE7lB,EAAEoG,EAAE,CAAC,uBAAuB,OAAO2c,IAAItiB,EAAEukB,gBAAgB+J,kBAAkB,GAAG1J,EAAExY,EAAEqc,YAAYE,MAAM,CAACjC,OAAOJ,EAAExZ,KAAKoY,EAAE,wBAAwB9Y,EAAE6N,WAAWrJ,KAAKgI,GAAG5Y,IAAG,SAAU4Y,EAAEmD,GAAG,OAAOkP,GAAG7e,EAAH6e,CAAMrS,EAAE8R,OAAO3O,EAAG,GAAE,CAAC,EAAEkP,GAAG,SAAS7e,GAAG,OAAO,SAASwM,EAAEmD,GAAG,OAAO5X,GAAE,SAAU5E,GAAG,OAAO,SAAS6M,GAAG,OAAO,SAASwM,EAAEmD,GAAG,OAAO3P,EAAEqc,YAAYF,KAAK,CAAC7B,OAAON,EAAEtZ,KAAKoY,EAAE,uBAAuB9Y,EAAE6N,UAAUrB,EAAEnJ,aAAasM,EAAE,CAAC,CAAjI,CAAmI3P,EAAnI,CAAsIwM,EAAEmD,GAAGtD,MAAK,SAAUrM,GAAG,MAAM,cAAcA,EAAEwZ,OAAOrmB,SAAI,CAAO,GAAG,GAAE,CAAC,EAAEqvB,GAAG,CAACoC,UAAU,YAAYC,aAAa,eAAef,oBAAoB,sBAAsBC,4BAA4B,8BAA8BtB,aAAa,eAAeyC,YAAY,SAASC,WAAW,SAASnG,GAAG,CAACG,SAAS,WAAWE,SAAS,WAAWJ,MAAM,SAASmG,GAAG,EAAEC,GAAG,EAAEC,GAAG,EAAMC,GAAG,SAASvlB,GAAG,OAAO,SAASwM,EAAErZ,GAAG,IAAIoG,EAAEiT,EAAElR,KAAI,SAAU0E,GAAG,OAAO2P,EAAEA,EAAE,CAAC,EAAE3P,GAAG,CAAC,EAAE,CAACwlB,UAAUxlB,EAAEwlB,WAAW,GAAI,IAAG,OAAOxlB,EAAEqc,YAAYF,KAAK,CAAC7B,OAAOL,EAAEvZ,KAAK,8BAA8B8D,KAAK,CAAC0Z,SAAS3kB,GAAG2f,WAAU,GAAI/lB,EAAE,CAAC,EAAEsyB,GAAG,SAASzlB,GAAG,OAAO,SAASwM,EAAErZ,GAAG,OAAOoyB,GAAGvlB,EAAHulB,CAAM/Y,EAAElR,KAAI,SAAU0E,GAAG,OAAO2P,EAAEA,EAAE,CAAC,EAAE3P,GAAG,CAAC,EAAE,CAAC0lB,mBAAmB,CAAC,EAAEC,MAAM,mBAAoB,IAAGxyB,EAAE,CAAC,EAAEyyB,GAAG,SAAS5lB,GAAG,OAAO,SAASwM,EAAErZ,GAAG,OAAOoyB,GAAGvlB,EAAHulB,CAAM/Y,EAAElR,KAAI,SAAU0E,GAAG,OAAO2P,EAAEA,EAAE,CAAC,EAAE3P,GAAG,CAAC,EAAE,CAAC2lB,MAAM,oBAAqB,IAAGxyB,EAAE,CAAC,EAAE0yB,GAAG,SAAS7lB,GAAG,OAAO,SAASwM,EAAErZ,GAAG,IAAIoG,EAAEiT,EAAElR,KAAI,SAAU0E,GAAG,OAAO2P,EAAEA,EAAE,CAAC,EAAE3P,GAAG,CAAC,EAAE,CAAC2lB,MAAM,kBAAkBH,UAAUxlB,EAAEwlB,WAAW,GAAI,IAAG,OAAOxlB,EAAEqc,YAAYF,KAAK,CAAC7B,OAAOL,EAAEvZ,KAAK,8BAA8B8D,KAAK,CAAC0Z,SAAS3kB,GAAG2f,WAAU,GAAI/lB,EAAE,CAAC,EAAE2yB,GAAG,SAAS9lB,GAAG,OAAO,SAASwM,EAAErZ,GAAG,IAAIoG,EAAEiT,EAAElR,KAAI,SAAU0E,GAAG,OAAO2P,EAAEA,EAAE,CAAC,EAAE3P,GAAG,CAAC,EAAE,CAAC2lB,MAAM,iBAAiBH,UAAUxlB,EAAEwlB,WAAW,GAAI,IAAG,OAAOxlB,EAAEqc,YAAYF,KAAK,CAAC7B,OAAOL,EAAEvZ,KAAK,8BAA8B8D,KAAK,CAAC0Z,SAAS3kB,GAAG2f,WAAU,GAAI/lB,EAAE,CAAC,EAAE4yB,GAAG,SAAS/lB,GAAG,OAAO,SAASwM,EAAErZ,GAAG,OAAOoyB,GAAGvlB,EAAHulB,CAAM/Y,EAAElR,KAAI,SAAU0E,GAAG,OAAO2P,EAAEA,EAAE,CAAC,EAAE3P,GAAG,CAAC,EAAE,CAAC2lB,MAAM,mBAAoB,IAAGxyB,EAAE,CAAC,EAAE6yB,GAAG,SAAShmB,GAAG,OAAO,SAASwM,EAAErZ,GAAG,IAAIoG,EAAEiT,EAAElR,KAAI,SAAU0E,GAAG,OAAO2P,EAAEA,EAAE,CAAC,EAAE3P,GAAG,CAAC,EAAE,CAAC2lB,MAAM,sBAAsBH,UAAUxlB,EAAEwlB,WAAW,GAAI,IAAG,OAAOxlB,EAAEqc,YAAYF,KAAK,CAAC7B,OAAOL,EAAEvZ,KAAK,8BAA8B8D,KAAK,CAAC0Z,SAAS3kB,GAAG2f,WAAU,GAAI/lB,EAAE,CAAC,EAAE,SAAS8yB,GAAGjmB,EAAEwM,EAAErZ,GAAG,IAAIoG,EAAE2c,EAAE,CAACgK,MAAMlgB,EAAEkmB,OAAO1Z,EAAEuO,SAAS,CAACC,QAAQ,EAAEmB,KAAK,EAAEI,MAAM,IAAIV,UAAU,CAACC,KAAK,SAAS9b,GAAG,OAAO,IAAI4M,SAAQ,SAAUJ,GAAG,IAAImD,EAAE,IAAIwW,eAAexW,EAAEyW,KAAKpmB,EAAEsa,OAAOta,EAAE6Z,KAAI,GAAIzhB,OAAOC,KAAK2H,EAAEiY,SAAStd,SAAQ,SAAU6R,GAAG,OAAOmD,EAAE0W,iBAAiB7Z,EAAExM,EAAEiY,QAAQzL,GAAI,IAAG,IAAIrZ,EAAEoG,EAAE,SAASyG,EAAE7M,GAAG,OAAOklB,YAAW,WAAY1I,EAAE2W,QAAQ9Z,EAAE,CAACgN,OAAO,EAAElN,QAAQnZ,EAAEooB,YAAW,GAAK,GAAE,IAAIvb,EAAE,EAAEkW,EAAE3c,EAAEyG,EAAE8a,eAAe,sBAAsBnL,EAAE4W,mBAAmB,WAAW5W,EAAE6W,WAAW7W,EAAE8W,aAAQ,IAAStzB,IAAIuzB,aAAaxQ,GAAG/iB,EAAEoG,EAAEyG,EAAEib,gBAAgB,kBAAkB,EAAEtL,EAAEgX,QAAQ,WAAW,IAAIhX,EAAE6J,SAASkN,aAAaxQ,GAAGwQ,aAAavzB,GAAGqZ,EAAE,CAACF,QAAQqD,EAAEiX,cAAc,yBAAyBpN,OAAO7J,EAAE6J,OAAO+B,YAAW,IAAK,EAAE5L,EAAEkX,OAAO,WAAWH,aAAaxQ,GAAGwQ,aAAavzB,GAAGqZ,EAAE,CAACF,QAAQqD,EAAEiX,aAAapN,OAAO7J,EAAE6J,OAAO+B,YAAW,GAAI,EAAE5L,EAAEmM,KAAK9b,EAAEwE,KAAM,GAAE,GAAGgX,QAAQjiB,EAAE+rB,GAAG,CAACwB,MAAM,SAAS9mB,EAAEwM,GAAG,OAAO4Y,IAAI7rB,GAAGzE,QAAQgyB,MAAM9mB,EAAEwM,GAAGI,QAAQC,SAAS,EAAE4O,KAAK,SAASzb,EAAEwM,GAAG,OAAO6Y,IAAI9rB,GAAGzE,QAAQ2mB,KAAKzb,EAAEwM,GAAGI,QAAQC,SAAS,EAAE/Y,MAAM,SAASkM,EAAEwM,GAAG,OAAO1X,QAAQhB,MAAMkM,EAAEwM,GAAGI,QAAQC,SAAS,IAAIoP,eAAe3L,IAAI0L,cAAc1L,EAAE,CAACyH,cAAa,IAAK4D,WAAWrF,EAAE,CAACuB,OAAO,CAACjkB,EAAE,CAAC6B,IAAI,GAAGiC,OAAO,SAAS,KAAKA,OAAOsI,KAAKsQ,OAAOkK,UAAUgC,EAAE,UAAUC,IAAI,CAAC1I,QAAQ,aAAahc,EAAE4X,EAAEA,EAAE,CAAC,EAAEuG,GAAG/iB,GAAGqlB,EAAE,WAAW,OAAO,SAASxY,GAAG,OAAO,SAASA,GAAG,IAAIwM,EAAExM,EAAE+mB,QAAQ,KAAK5zB,EAAE6kB,EAAEtjB,EAAEwjB,cAAclY,EAAEkgB,MAAMlgB,EAAEkmB,QAAQ3sB,EAAE2B,EAAEyU,EAAEA,EAAE,CAACuM,MAAM,CAAC,CAACrC,IAAI,mBAAmBniB,OAAO8U,EAAE,mBAAmBxM,GAAG,CAAC,EAAE,CAACiY,QAAQtI,EAAEA,EAAEA,EAAE,CAAC,EAAExc,EAAE8kB,WAAW,CAAC,eAAe,qBAAqBjY,EAAEiY,SAASE,gBAAgBxI,EAAEA,EAAE,CAAC,EAAExc,EAAEglB,mBAAmBnY,EAAEmY,oBAAoB,OAAOU,EAAE,CAACqH,MAAMlgB,EAAEkgB,MAAM7D,YAAY9iB,GAAGyG,EAAE2e,QAAQ,CAAnV,CAAqVhP,EAAEA,EAAEA,EAAE,CAAC,EAAEuG,GAAGlW,GAAG,CAAC,EAAE,CAAC2e,QAAQ,CAACqI,2BAA2B9J,EAAE+J,2BAA2B9J,KAAK,CAAC,EAAE,OAAO,SAASnd,GAAG,IAAIwM,EAAExM,EAAEkgB,MAAM/sB,EAAE6kB,OAAE,IAAShY,EAAEknB,SAASlnB,EAAEknB,SAASxyB,EAAEwjB,cAAc1L,EAAExM,EAAEkmB,QAAQ3sB,EAAE2B,EAAEyU,EAAEA,EAAE,CAACuM,MAAM,CAAC,CAACrC,IAAI,GAAGniB,OAAO8U,EAAE,oBAAoBsN,OAAO3kB,EAAEgkB,MAAM,CAACU,IAAI,GAAGniB,OAAO8U,EAAE,gBAAgBsN,OAAO3kB,EAAEikB,QAAQ1hB,OAAOib,EAAE,CAAC,CAACkH,IAAI,GAAGniB,OAAO8U,EAAE,sBAAsB,CAACqN,IAAI,GAAGniB,OAAO8U,EAAE,sBAAsB,CAACqN,IAAI,GAAGniB,OAAO8U,EAAE,0BAA0BxM,GAAG,CAAC,EAAE,CAACiY,QAAQtI,EAAEA,EAAEA,EAAE,CAAC,EAAExc,EAAE8kB,WAAW,CAAC,eAAe,sCAAsCjY,EAAEiY,SAASE,gBAAgBxI,EAAEA,EAAE,CAAC,EAAExc,EAAEglB,mBAAmBnY,EAAEmY,oBAAoB,OAAOU,EAAE,CAACwD,YAAY9iB,EAAE2mB,MAAM1T,EAAExB,gBAAgB,SAAShL,EAAEwM,GAAGjT,EAAEihB,UAAUiC,IAAI,CAAC1I,QAAQ/T,EAAE5J,QAAQoW,GAAG,EAAEqE,WAAW,WAAW,OAAOjE,QAAQ4K,IAAI,CAACje,EAAEyiB,cAAcrE,QAAQpe,EAAE0iB,eAAetE,UAAUtL,MAAK,WAAa,GAAE,GAAGrM,EAAE2e,QAAQ,CAA9tB,CAAguBhP,EAAEA,EAAE,CAAC,EAAE5X,GAAG,CAAC,EAAE,CAAC4mB,QAAQ,CAACjT,OAAOgV,GAAGtT,qBAAqBuT,GAAGwG,cAAc3G,GAAG4G,mBAAmB3G,GAAG4G,gBAAgB3G,GAAG4G,UAAU/I,EAAEgJ,aAAarI,EAAEsI,aAAapI,EAAEqI,UAAU3I,EAAE4I,UAAUnH,GAAGoH,YAAYtH,GAAGuH,QAAQhI,GAAGiI,aAAazH,GAAG0H,6BAA6BnH,GAAGoH,UAAUpK,GAAGqK,UAAUvK,EAAEwK,YAAY9H,GAAG+H,aAAa9G,GAAG+G,aAAa5I,EAAE6I,cAAcrH,GAAGsH,aAAazK,EAAE0K,cAAcxK,EAAEyK,UAAUzI,GAAG0I,cAActH,GAAGuH,YAAYnI,GAAGoI,cAAc7I,GAAG8I,aAAa9H,GAAG+H,mBAAmB7I,GAAG8I,uBAAuB7K,EAAE8K,wBAAwBtJ,EAAEuJ,sBAAsBpJ,GAAGqJ,WAAWtJ,GAAGuJ,yBAAyBnI,GAAGoI,sBAAsBlI,GAAGmI,wBAAwBlI,GAAGmI,sBAAsBjI,GAAGkI,YAAYhL,GAAGiL,cAAchK,EAAEpS,UAAU,SAASlN,GAAG,OAAO,SAASwM,GAAG,OAAOkS,GAAG1e,EAAH0e,CAAMlS,EAAE,CAACmS,QAAQ,CAACtB,MAAMgE,GAAG3J,OAAO2K,GAAG3V,YAAYoW,GAAGyG,UAAUnG,GAAGoG,WAAWlG,GAAGmG,WAAW9E,GAAG+E,YAAYtF,GAAG1Y,OAAOuX,GAAG7V,qBAAqBwT,GAAGhC,SAASC,GAAG8K,YAAY1E,GAAG2E,YAAY/G,GAAGgH,oBAAoBlG,GAAGmG,qBAAqBlG,GAAGmG,aAAazH,GAAG0H,cAAczH,GAAG0H,SAAS7H,GAAG8H,aAAalI,GAAGmI,cAAc7I,GAAG8I,kBAAkB/G,GAAGgH,WAAWtH,GAAGuH,OAAO1H,GAAG2H,YAAYxF,GAAGyF,aAAa/F,GAAGgG,WAAW/G,GAAGgH,eAAe/I,GAAGgJ,eAAejJ,GAAGkJ,cAAcjI,GAAGkI,cAAc1I,GAAG2I,kBAAkB9G,GAAG+G,mBAAmBvG,GAAGwG,YAAYxJ,GAAGyJ,QAAQzH,GAAG0H,WAAWxI,GAAGyI,SAASrG,GAAGsG,UAAU9G,GAAG+G,gBAAgBhH,GAAGiH,YAAY/J,GAAGgK,WAAWtJ,KAAK,CAAC,EAAEuJ,cAAc,WAAW,OAAO,SAASxrB,GAAG,OAAO,SAASA,GAAG,IAAIwM,EAAExM,EAAE+mB,QAAQ,KAAK5zB,EAAE6kB,EAAEtjB,EAAEwjB,cAAclY,EAAEkgB,MAAMlgB,EAAEkmB,QAAQ3sB,EAAE2B,EAAEyU,EAAEA,EAAE,CAACuM,MAAM,CAAC,CAACrC,IAAI,aAAaniB,OAAO8U,EAAE,mBAAmBxM,GAAG,CAAC,EAAE,CAACiY,QAAQtI,EAAEA,EAAEA,EAAE,CAAC,EAAExc,EAAE8kB,WAAW,CAAC,eAAe,qBAAqBjY,EAAEiY,SAASE,gBAAgBxI,EAAEA,EAAE,CAAC,EAAExc,EAAEglB,mBAAmBnY,EAAEmY,oBAAoB,OAAOU,EAAE,CAACqH,MAAMlgB,EAAEkgB,MAAM7D,YAAY9iB,GAAGyG,EAAE2e,QAAQ,CAA7U,CAA+UhP,EAAEA,EAAEA,EAAE,CAAC,EAAEuG,GAAGlW,GAAG,CAAC,EAAE,CAAC2e,QAAQ,CAAC8M,UAAU5O,EAAE6O,UAAU3O,EAAE4O,WAAW3O,EAAE4O,WAAW3O,EAAE4O,aAAa/O,KAAK,CAAC,EAAEgP,oBAAoBtT,EAAEuT,mBAAmB,WAAW,OAAO,SAAS/rB,GAAG,OAAOjI,EAAEyjB,OAAOC,KAAK,qFAAqFjD,IAAIxY,EAAE,CAAC,EAAEgsB,mBAAmBzG,GAAG0G,4BAA4BxG,GAAGyG,kBAAkBnG,GAAGoG,qBAAqBnG,GAAGoG,mBAAmBxG,GAAGyG,kBAAkBxG,GAAGyG,iBAAiBxG,MAAM,CAAC,OAAOG,GAAG7vB,QAAQ,SAAS6vB,EAAG,CAAljkCzZ,oBCDnF,IAII+f,EAJY,EAAQ,MAITC,CAHJ,EAAQ,MAGY,YAE/B15B,EAAOC,QAAUw5B,mBCNjB,IAAIE,EAAY,EAAQ,OACpBC,EAAa,EAAQ,OACrBC,EAAU,EAAQ,OAClBC,EAAU,EAAQ,OAClBC,EAAU,EAAQ,OAStB,SAASC,EAAK5V,GACZ,IAAIhhB,GAAS,EACTnC,EAAoB,MAAXmjB,EAAkB,EAAIA,EAAQnjB,OAG3C,IADAzB,KAAKqlB,UACIzhB,EAAQnC,GAAQ,CACvB,IAAIg5B,EAAQ7V,EAAQhhB,GACpB5D,KAAKmlB,IAAIsV,EAAM,GAAIA,EAAM,GAC3B,CACF,CAGAD,EAAK95B,UAAU2kB,MAAQ8U,EACvBK,EAAK95B,UAAkB,OAAI05B,EAC3BI,EAAK95B,UAAUskB,IAAMqV,EACrBG,EAAK95B,UAAUg6B,IAAMJ,EACrBE,EAAK95B,UAAUykB,IAAMoV,EAErB/5B,EAAOC,QAAU+5B,mBC/BjB,IAAIG,EAAiB,EAAQ,OACzBC,EAAkB,EAAQ,OAC1BC,EAAe,EAAQ,OACvBC,EAAe,EAAQ,OACvBC,EAAe,EAAQ,OAS3B,SAASC,EAAUpW,GACjB,IAAIhhB,GAAS,EACTnC,EAAoB,MAAXmjB,EAAkB,EAAIA,EAAQnjB,OAG3C,IADAzB,KAAKqlB,UACIzhB,EAAQnC,GAAQ,CACvB,IAAIg5B,EAAQ7V,EAAQhhB,GACpB5D,KAAKmlB,IAAIsV,EAAM,GAAIA,EAAM,GAC3B,CACF,CAGAO,EAAUt6B,UAAU2kB,MAAQsV,EAC5BK,EAAUt6B,UAAkB,OAAIk6B,EAChCI,EAAUt6B,UAAUskB,IAAM6V,EAC1BG,EAAUt6B,UAAUg6B,IAAMI,EAC1BE,EAAUt6B,UAAUykB,IAAM4V,EAE1Bv6B,EAAOC,QAAUu6B,mBC/BjB,IAIIC,EAJY,EAAQ,MAIdf,CAHC,EAAQ,MAGO,OAE1B15B,EAAOC,QAAUw6B,mBCNjB,IAAIC,EAAgB,EAAQ,OACxBC,EAAiB,EAAQ,OACzBC,EAAc,EAAQ,OACtBC,EAAc,EAAQ,MACtBC,EAAc,EAAQ,OAS1B,SAASC,EAAS3W,GAChB,IAAIhhB,GAAS,EACTnC,EAAoB,MAAXmjB,EAAkB,EAAIA,EAAQnjB,OAG3C,IADAzB,KAAKqlB,UACIzhB,EAAQnC,GAAQ,CACvB,IAAIg5B,EAAQ7V,EAAQhhB,GACpB5D,KAAKmlB,IAAIsV,EAAM,GAAIA,EAAM,GAC3B,CACF,CAGAc,EAAS76B,UAAU2kB,MAAQ6V,EAC3BK,EAAS76B,UAAkB,OAAIy6B,EAC/BI,EAAS76B,UAAUskB,IAAMoW,EACzBG,EAAS76B,UAAUg6B,IAAMW,EACzBE,EAAS76B,UAAUykB,IAAMmW,EAEzB96B,EAAOC,QAAU86B,mBC/BjB,IAIIjhB,EAJY,EAAQ,MAIV4f,CAHH,EAAQ,MAGW,WAE9B15B,EAAOC,QAAU6Z,mBCNjB,IAIIkhB,EAJY,EAAQ,MAIdtB,CAHC,EAAQ,MAGO,OAE1B15B,EAAOC,QAAU+6B,mBCNjB,IAAID,EAAW,EAAQ,OACnBE,EAAc,EAAQ,OACtBC,EAAc,EAAQ,OAU1B,SAASC,EAASz1B,GAChB,IAAItC,GAAS,EACTnC,EAAmB,MAAVyE,EAAiB,EAAIA,EAAOzE,OAGzC,IADAzB,KAAK47B,SAAW,IAAIL,IACX33B,EAAQnC,GACfzB,KAAKmqB,IAAIjkB,EAAOtC,GAEpB,CAGA+3B,EAASj7B,UAAUypB,IAAMwR,EAASj7B,UAAU4B,KAAOm5B,EACnDE,EAASj7B,UAAUg6B,IAAMgB,EAEzBl7B,EAAOC,QAAUk7B,mBC1BjB,IAAIX,EAAY,EAAQ,OACpBa,EAAa,EAAQ,OACrBC,EAAc,EAAQ,OACtBC,EAAW,EAAQ,OACnBC,EAAW,EAAQ,OACnBC,EAAW,EAAQ,OASvB,SAASC,EAAMtX,GACb,IAAI1S,EAAOlS,KAAK47B,SAAW,IAAIZ,EAAUpW,GACzC5kB,KAAKm8B,KAAOjqB,EAAKiqB,IACnB,CAGAD,EAAMx7B,UAAU2kB,MAAQwW,EACxBK,EAAMx7B,UAAkB,OAAIo7B,EAC5BI,EAAMx7B,UAAUskB,IAAM+W,EACtBG,EAAMx7B,UAAUg6B,IAAMsB,EACtBE,EAAMx7B,UAAUykB,IAAM8W,EAEtBz7B,EAAOC,QAAUy7B,mBC1BjB,IAGIE,EAHO,EAAQ,MAGGA,WAEtB57B,EAAOC,QAAU27B,mBCLjB,IAIIC,EAJY,EAAQ,MAIVnC,CAHH,EAAQ,MAGW,WAE9B15B,EAAOC,QAAU47B,aCcjB77B,EAAOC,QAVP,SAAe67B,EAAMC,EAASl7B,GAC5B,OAAQA,EAAKI,QACX,KAAK,EAAG,OAAO66B,EAAKx6B,KAAKy6B,GACzB,KAAK,EAAG,OAAOD,EAAKx6B,KAAKy6B,EAASl7B,EAAK,IACvC,KAAK,EAAG,OAAOi7B,EAAKx6B,KAAKy6B,EAASl7B,EAAK,GAAIA,EAAK,IAChD,KAAK,EAAG,OAAOi7B,EAAKx6B,KAAKy6B,EAASl7B,EAAK,GAAIA,EAAK,GAAIA,EAAK,IAE3D,OAAOi7B,EAAKr6B,MAAMs6B,EAASl7B,EAC7B,aCMAb,EAAOC,QAfP,SAAqBoO,EAAOgH,GAM1B,IALA,IAAIjS,GAAS,EACTnC,EAAkB,MAAToN,EAAgB,EAAIA,EAAMpN,OACnC+6B,EAAW,EACXpoB,EAAS,KAEJxQ,EAAQnC,GAAQ,CACvB,IAAIuD,EAAQ6J,EAAMjL,GACdiS,EAAU7Q,EAAOpB,EAAOiL,KAC1BuF,EAAOooB,KAAcx3B,EAEzB,CACA,OAAOoP,CACT,mBCtBA,IAAIqoB,EAAc,EAAQ,OAgB1Bj8B,EAAOC,QALP,SAAuBoO,EAAO7J,GAE5B,SADsB,MAAT6J,EAAgB,EAAIA,EAAMpN,SACpBg7B,EAAY5tB,EAAO7J,EAAO,IAAM,CACrD,aCOAxE,EAAOC,QAZP,SAA2BoO,EAAO7J,EAAOga,GAIvC,IAHA,IAAIpb,GAAS,EACTnC,EAAkB,MAAToN,EAAgB,EAAIA,EAAMpN,SAE9BmC,EAAQnC,GACf,GAAIud,EAAWha,EAAO6J,EAAMjL,IAC1B,OAAO,EAGX,OAAO,CACT,mBCnBA,IAAI84B,EAAY,EAAQ,OACpBC,EAAc,EAAQ,OACtBx1B,EAAU,EAAQ,OAClBy1B,EAAW,EAAQ,MACnBC,EAAU,EAAQ,OAClBC,EAAe,EAAQ,OAMvB5c,EAHcpa,OAAOpF,UAGQwf,eAqCjC1f,EAAOC,QA3BP,SAAuBuE,EAAO+3B,GAC5B,IAAIC,EAAQ71B,EAAQnC,GAChBi4B,GAASD,GAASL,EAAY33B,GAC9Bk4B,GAAUF,IAAUC,GAASL,EAAS53B,GACtCm4B,GAAUH,IAAUC,IAAUC,GAAUJ,EAAa93B,GACrDo4B,EAAcJ,GAASC,GAASC,GAAUC,EAC1C/oB,EAASgpB,EAAcV,EAAU13B,EAAMvD,OAAQsd,QAAU,GACzDtd,EAAS2S,EAAO3S,OAEpB,IAAK,IAAI0B,KAAO6B,GACT+3B,IAAa7c,EAAepe,KAAKkD,EAAO7B,IACvCi6B,IAEQ,UAAPj6B,GAEC+5B,IAAkB,UAAP/5B,GAA0B,UAAPA,IAE9Bg6B,IAAkB,UAAPh6B,GAA0B,cAAPA,GAA8B,cAAPA,IAEtD05B,EAAQ15B,EAAK1B,KAElB2S,EAAO9R,KAAKa,GAGhB,OAAOiR,CACT,aC1BA5T,EAAOC,QAXP,SAAkBoO,EAAOsS,GAKvB,IAJA,IAAIvd,GAAS,EACTnC,EAAkB,MAAToN,EAAgB,EAAIA,EAAMpN,OACnC2S,EAASrS,MAAMN,KAEVmC,EAAQnC,GACf2S,EAAOxQ,GAASud,EAAStS,EAAMjL,GAAQA,EAAOiL,GAEhD,OAAOuF,CACT,aCCA5T,EAAOC,QAXP,SAAmBoO,EAAO3I,GAKxB,IAJA,IAAItC,GAAS,EACTnC,EAASyE,EAAOzE,OAChB47B,EAASxuB,EAAMpN,SAEVmC,EAAQnC,GACfoN,EAAMwuB,EAASz5B,GAASsC,EAAOtC,GAEjC,OAAOiL,CACT,aCKArO,EAAOC,QAZP,SAAmBoO,EAAOgH,GAIxB,IAHA,IAAIjS,GAAS,EACTnC,EAAkB,MAAToN,EAAgB,EAAIA,EAAMpN,SAE9BmC,EAAQnC,GACf,GAAIoU,EAAUhH,EAAMjL,GAAQA,EAAOiL,GACjC,OAAO,EAGX,OAAO,CACT,mBCpBA,IAAIyuB,EAAkB,EAAQ,OAC1BC,EAAK,EAAQ,OAMbrd,EAHcpa,OAAOpF,UAGQwf,eAoBjC1f,EAAOC,QARP,SAAqB2gB,EAAQje,EAAK6B,GAChC,IAAIw4B,EAAWpc,EAAOje,GAChB+c,EAAepe,KAAKsf,EAAQje,IAAQo6B,EAAGC,EAAUx4B,UACxC7E,IAAV6E,GAAyB7B,KAAOie,IACnCkc,EAAgBlc,EAAQje,EAAK6B,EAEjC,mBCzBA,IAAIu4B,EAAK,EAAQ,OAoBjB/8B,EAAOC,QAVP,SAAsBoO,EAAO1L,GAE3B,IADA,IAAI1B,EAASoN,EAAMpN,OACZA,KACL,GAAI87B,EAAG1uB,EAAMpN,GAAQ,GAAI0B,GACvB,OAAO1B,EAGX,OAAQ,CACV,mBClBA,IAAI8hB,EAAiB,EAAQ,OAwB7B/iB,EAAOC,QAbP,SAAyB2gB,EAAQje,EAAK6B,GACzB,aAAP7B,GAAsBogB,EACxBA,EAAenC,EAAQje,EAAK,CAC1B,cAAgB,EAChB,YAAc,EACd,MAAS6B,EACT,UAAY,IAGdoc,EAAOje,GAAO6B,CAElB,mBCtBA,IAAIggB,EAAM,EAAQ,OAsBlBxkB,EAAOC,QAZP,SAAgB2gB,EAAQqc,GAMtB,IALA,IAAI75B,GAAS,EACTnC,EAASg8B,EAAMh8B,OACf2S,EAASrS,MAAMN,GACfi8B,EAAiB,MAAVtc,IAEFxd,EAAQnC,GACf2S,EAAOxQ,GAAS85B,OAAOv9B,EAAY6kB,EAAI5D,EAAQqc,EAAM75B,IAEvD,OAAOwQ,CACT,aCCA5T,EAAOC,QAZP,SAAmBsL,EAAQ4xB,EAAOC,GAShC,OARI7xB,IAAWA,SACC5L,IAAVy9B,IACF7xB,EAASA,GAAU6xB,EAAQ7xB,EAAS6xB,QAExBz9B,IAAVw9B,IACF5xB,EAASA,GAAU4xB,EAAQ5xB,EAAS4xB,IAGjC5xB,CACT,mBCnBA,IAAI4vB,EAAW,EAAQ,OACnBkC,EAAgB,EAAQ,OACxBC,EAAoB,EAAQ,OAC5BC,EAAW,EAAQ,OACnBC,EAAY,EAAQ,OACpBC,EAAW,EAAQ,OA6DvBz9B,EAAOC,QA7CP,SAAwBoO,EAAO3I,EAAQib,EAAUnC,GAC/C,IAAIpb,GAAS,EACTs6B,EAAWL,EACXM,GAAW,EACX18B,EAASoN,EAAMpN,OACf2S,EAAS,GACTgqB,EAAel4B,EAAOzE,OAE1B,IAAKA,EACH,OAAO2S,EAEL+M,IACFjb,EAAS63B,EAAS73B,EAAQ83B,EAAU7c,KAElCnC,GACFkf,EAAWJ,EACXK,GAAW,GAEJj4B,EAAOzE,QA/BK,MAgCnBy8B,EAAWD,EACXE,GAAW,EACXj4B,EAAS,IAAIy1B,EAASz1B,IAExBm4B,EACA,OAASz6B,EAAQnC,GAAQ,CACvB,IAAIuD,EAAQ6J,EAAMjL,GACd06B,EAAuB,MAAZnd,EAAmBnc,EAAQmc,EAASnc,GAGnD,GADAA,EAASga,GAAwB,IAAVha,EAAeA,EAAQ,EAC1Cm5B,GAAYG,IAAaA,EAAU,CAErC,IADA,IAAIC,EAAcH,EACXG,KACL,GAAIr4B,EAAOq4B,KAAiBD,EAC1B,SAASD,EAGbjqB,EAAO9R,KAAK0C,EACd,MACUk5B,EAASh4B,EAAQo4B,EAAUtf,IACnC5K,EAAO9R,KAAK0C,EAEhB,CACA,OAAOoP,CACT,mBChEA,IAAIoqB,EAAY,EAAQ,OACpBC,EAAW,EAAQ,OA8BvBj+B,EAAOC,QAlBP,SAAkBoO,EAAO7J,EAAO05B,EAAOC,GACrC,IAAIl9B,EAASoN,EAAMpN,OAWnB,KATAi9B,EAAQF,EAAUE,IACN,IACVA,GAASA,EAAQj9B,EAAS,EAAKA,EAASi9B,IAE1CC,OAAex+B,IAARw+B,GAAqBA,EAAMl9B,EAAUA,EAAS+8B,EAAUG,IACrD,IACRA,GAAOl9B,GAETk9B,EAAMD,EAAQC,EAAM,EAAIF,EAASE,GAC1BD,EAAQC,GACb9vB,EAAM6vB,KAAW15B,EAEnB,OAAO6J,CACT,YCNArO,EAAOC,QAZP,SAAuBoO,EAAOgH,EAAW+oB,EAAWC,GAIlD,IAHA,IAAIp9B,EAASoN,EAAMpN,OACfmC,EAAQg7B,GAAaC,EAAY,GAAK,GAElCA,EAAYj7B,MAAYA,EAAQnC,GACtC,GAAIoU,EAAUhH,EAAMjL,GAAQA,EAAOiL,GACjC,OAAOjL,EAGX,OAAQ,CACV,mBCrBA,IAAIk7B,EAAY,EAAQ,OACpBC,EAAgB,EAAQ,OAoC5Bv+B,EAAOC,QAvBP,SAASu+B,EAAYnwB,EAAOwH,EAAOR,EAAWopB,EAAU7qB,GACtD,IAAIxQ,GAAS,EACTnC,EAASoN,EAAMpN,OAKnB,IAHAoU,IAAcA,EAAYkpB,GAC1B3qB,IAAWA,EAAS,MAEXxQ,EAAQnC,GAAQ,CACvB,IAAIuD,EAAQ6J,EAAMjL,GACdyS,EAAQ,GAAKR,EAAU7Q,GACrBqR,EAAQ,EAEV2oB,EAAYh6B,EAAOqR,EAAQ,EAAGR,EAAWopB,EAAU7qB,GAEnD0qB,EAAU1qB,EAAQpP,GAEVi6B,IACV7qB,EAAOA,EAAO3S,QAAUuD,EAE5B,CACA,OAAOoP,CACT,mBCnCA,IAAI8qB,EAAW,EAAQ,OACnBC,EAAQ,EAAQ,OAsBpB3+B,EAAOC,QAZP,SAAiB2gB,EAAQhT,GAMvB,IAHA,IAAIxK,EAAQ,EACRnC,GAHJ2M,EAAO8wB,EAAS9wB,EAAMgT,IAGJ3f,OAED,MAAV2f,GAAkBxd,EAAQnC,GAC/B2f,EAASA,EAAO+d,EAAM/wB,EAAKxK,OAE7B,OAAQA,GAASA,GAASnC,EAAU2f,OAASjhB,CAC/C,mBCrBA,IAAI2+B,EAAY,EAAQ,OACpB33B,EAAU,EAAQ,OAkBtB3G,EAAOC,QALP,SAAwB2gB,EAAQge,EAAUC,GACxC,IAAIjrB,EAASgrB,EAAShe,GACtB,OAAOja,EAAQia,GAAUhN,EAAS0qB,EAAU1qB,EAAQirB,EAAYje,GAClE,aCLA5gB,EAAOC,QAJP,SAAmB2gB,EAAQje,GACzB,OAAiB,MAAVie,GAAkBje,KAAO2C,OAAOsb,EACzC,mBCVA,IAAIke,EAAgB,EAAQ,MACxBC,EAAY,EAAQ,OACpBC,EAAgB,EAAQ,OAiB5Bh/B,EAAOC,QANP,SAAqBoO,EAAO7J,EAAO45B,GACjC,OAAO55B,IAAUA,EACbw6B,EAAc3wB,EAAO7J,EAAO45B,GAC5BU,EAAczwB,EAAO0wB,EAAWX,EACtC,aCKAp+B,EAAOC,QAZP,SAAyBoO,EAAO7J,EAAO45B,EAAW5f,GAIhD,IAHA,IAAIpb,EAAQg7B,EAAY,EACpBn9B,EAASoN,EAAMpN,SAEVmC,EAAQnC,GACf,GAAIud,EAAWnQ,EAAMjL,GAAQoB,GAC3B,OAAOpB,EAGX,OAAQ,CACV,mBCpBA,IAAI+3B,EAAW,EAAQ,OACnBkC,EAAgB,EAAQ,OACxBC,EAAoB,EAAQ,OAC5BC,EAAW,EAAQ,OACnBC,EAAY,EAAQ,OACpBC,EAAW,EAAQ,OAGnBwB,EAAYzZ,KAAKC,IAiErBzlB,EAAOC,QArDP,SAA0Bi/B,EAAQve,EAAUnC,GAS1C,IARA,IAAIkf,EAAWlf,EAAa8e,EAAoBD,EAC5Cp8B,EAASi+B,EAAO,GAAGj+B,OACnBk+B,EAAYD,EAAOj+B,OACnBm+B,EAAWD,EACXpa,EAASxjB,MAAM49B,GACfE,EAAYC,IACZ1rB,EAAS,GAENwrB,KAAY,CACjB,IAAI/wB,EAAQ6wB,EAAOE,GACfA,GAAYze,IACdtS,EAAQkvB,EAASlvB,EAAOmvB,EAAU7c,KAEpC0e,EAAYJ,EAAU5wB,EAAMpN,OAAQo+B,GACpCta,EAAOqa,IAAa5gB,IAAemC,GAAa1f,GAAU,KAAOoN,EAAMpN,QAAU,KAC7E,IAAIk6B,EAASiE,GAAY/wB,QACzB1O,CACN,CACA0O,EAAQ6wB,EAAO,GAEf,IAAI97B,GAAS,EACTm8B,EAAOxa,EAAO,GAElB8Y,EACA,OAASz6B,EAAQnC,GAAU2S,EAAO3S,OAASo+B,GAAW,CACpD,IAAI76B,EAAQ6J,EAAMjL,GACd06B,EAAWnd,EAAWA,EAASnc,GAASA,EAG5C,GADAA,EAASga,GAAwB,IAAVha,EAAeA,EAAQ,IACxC+6B,EACE9B,EAAS8B,EAAMzB,GACfJ,EAAS9pB,EAAQkqB,EAAUtf,IAC5B,CAEL,IADA4gB,EAAWD,IACFC,GAAU,CACjB,IAAII,EAAQza,EAAOqa,GACnB,KAAMI,EACE/B,EAAS+B,EAAO1B,GAChBJ,EAASwB,EAAOE,GAAWtB,EAAUtf,IAE3C,SAASqf,CAEb,CACI0B,GACFA,EAAKz9B,KAAKg8B,GAEZlqB,EAAO9R,KAAK0C,EACd,CACF,CACA,OAAOoP,CACT,mBCvEA,IAAI6rB,EAAa,EAAQ,OACrBC,EAAe,EAAQ,OAgB3B1/B,EAAOC,QAJP,SAAyBuE,GACvB,OAAOk7B,EAAal7B,IAVR,sBAUkBi7B,EAAWj7B,EAC3C,mBCfA,IAAIm7B,EAAkB,EAAQ,OAC1BD,EAAe,EAAQ,OA0B3B1/B,EAAOC,QAVP,SAAS2/B,EAAYp7B,EAAO0b,EAAO2f,EAASC,EAAYC,GACtD,OAAIv7B,IAAU0b,IAGD,MAAT1b,GAA0B,MAAT0b,IAAmBwf,EAAal7B,KAAWk7B,EAAaxf,GACpE1b,IAAUA,GAAS0b,IAAUA,EAE/Byf,EAAgBn7B,EAAO0b,EAAO2f,EAASC,EAAYF,EAAaG,GACzE,mBCzBA,IAAIrE,EAAQ,EAAQ,OAChBsE,EAAc,EAAQ,OACtBC,EAAa,EAAQ,OACrBC,EAAe,EAAQ,OACvBC,EAAS,EAAQ,MACjBx5B,EAAU,EAAQ,OAClBy1B,EAAW,EAAQ,MACnBE,EAAe,EAAQ,OAMvB8D,EAAU,qBACVC,EAAW,iBACXC,EAAY,kBAMZ5gB,EAHcpa,OAAOpF,UAGQwf,eA6DjC1f,EAAOC,QA7CP,SAAyB2gB,EAAQV,EAAO2f,EAASC,EAAYS,EAAWR,GACtE,IAAIS,EAAW75B,EAAQia,GACnB6f,EAAW95B,EAAQuZ,GACnBwgB,EAASF,EAAWH,EAAWF,EAAOvf,GACtC+f,EAASF,EAAWJ,EAAWF,EAAOjgB,GAKtC0gB,GAHJF,EAASA,GAAUN,EAAUE,EAAYI,IAGhBJ,EACrBO,GAHJF,EAASA,GAAUP,EAAUE,EAAYK,IAGhBL,EACrBQ,EAAYJ,GAAUC,EAE1B,GAAIG,GAAa1E,EAASxb,GAAS,CACjC,IAAKwb,EAASlc,GACZ,OAAO,EAETsgB,GAAW,EACXI,GAAW,CACb,CACA,GAAIE,IAAcF,EAEhB,OADAb,IAAUA,EAAQ,IAAIrE,GACd8E,GAAYlE,EAAa1b,GAC7Bof,EAAYpf,EAAQV,EAAO2f,EAASC,EAAYS,EAAWR,GAC3DE,EAAWrf,EAAQV,EAAOwgB,EAAQb,EAASC,EAAYS,EAAWR,GAExE,KArDyB,EAqDnBF,GAAiC,CACrC,IAAIkB,EAAeH,GAAYlhB,EAAepe,KAAKsf,EAAQ,eACvDogB,EAAeH,GAAYnhB,EAAepe,KAAK4e,EAAO,eAE1D,GAAI6gB,GAAgBC,EAAc,CAChC,IAAIC,EAAeF,EAAengB,EAAOpc,QAAUoc,EAC/CsgB,EAAeF,EAAe9gB,EAAM1b,QAAU0b,EAGlD,OADA6f,IAAUA,EAAQ,IAAIrE,GACf6E,EAAUU,EAAcC,EAAcrB,EAASC,EAAYC,EACpE,CACF,CACA,QAAKe,IAGLf,IAAUA,EAAQ,IAAIrE,GACfwE,EAAatf,EAAQV,EAAO2f,EAASC,EAAYS,EAAWR,GACrE,mBChFA,IAAIrE,EAAQ,EAAQ,OAChBkE,EAAc,EAAQ,OA4D1B5/B,EAAOC,QA5CP,SAAqB2gB,EAAQtC,EAAQ6iB,EAAWrB,GAC9C,IAAI18B,EAAQ+9B,EAAUlgC,OAClBA,EAASmC,EACTg+B,GAAgBtB,EAEpB,GAAc,MAAVlf,EACF,OAAQ3f,EAGV,IADA2f,EAAStb,OAAOsb,GACTxd,KAAS,CACd,IAAIsO,EAAOyvB,EAAU/9B,GACrB,GAAKg+B,GAAgB1vB,EAAK,GAClBA,EAAK,KAAOkP,EAAOlP,EAAK,MACtBA,EAAK,KAAMkP,GAEnB,OAAO,CAEX,CACA,OAASxd,EAAQnC,GAAQ,CAEvB,IAAI0B,GADJ+O,EAAOyvB,EAAU/9B,IACF,GACX45B,EAAWpc,EAAOje,GAClB0+B,EAAW3vB,EAAK,GAEpB,GAAI0vB,GAAgB1vB,EAAK,IACvB,QAAiB/R,IAAbq9B,KAA4Br6B,KAAOie,GACrC,OAAO,MAEJ,CACL,IAAImf,EAAQ,IAAIrE,EAChB,GAAIoE,EACF,IAAIlsB,EAASksB,EAAW9C,EAAUqE,EAAU1+B,EAAKie,EAAQtC,EAAQyhB,GAEnE,UAAiBpgC,IAAXiU,EACEgsB,EAAYyB,EAAUrE,EAAUsE,EAA+CxB,EAAYC,GAC3FnsB,GAEN,OAAO,CAEX,CACF,CACA,OAAO,CACT,aChDA5T,EAAOC,QAJP,SAAmBuE,GACjB,OAAOA,IAAUA,CACnB,mBCTA,IAAI5E,EAAa,EAAQ,MACrB2hC,EAAW,EAAQ,OACnBzhC,EAAW,EAAQ,OACnB0hC,EAAW,EAAQ,OASnBC,EAAe,8BAGfC,EAAYC,SAASzhC,UACrB0hC,EAAct8B,OAAOpF,UAGrB2hC,EAAeH,EAAUnxB,SAGzBmP,EAAiBkiB,EAAYliB,eAG7BoiB,EAAaC,OAAO,IACtBF,EAAavgC,KAAKoe,GAAgBlK,QAjBjB,sBAiBuC,QACvDA,QAAQ,yDAA0D,SAAW,KAmBhFxV,EAAOC,QARP,SAAsBuE,GACpB,SAAK1E,EAAS0E,IAAU+8B,EAAS/8B,MAGnB5E,EAAW4E,GAASs9B,EAAaL,GAChC3e,KAAK0e,EAASh9B,GAC/B,kBC5CA,IAAIi7B,EAAa,EAAQ,OACrBuC,EAAW,EAAQ,OACnBtC,EAAe,EAAQ,OA8BvBuC,EAAiB,CAAC,EACtBA,EAZiB,yBAYYA,EAXZ,yBAYjBA,EAXc,sBAWYA,EAVX,uBAWfA,EAVe,uBAUYA,EATZ,uBAUfA,EATsB,8BASYA,EARlB,wBAShBA,EARgB,yBAQY,EAC5BA,EAjCc,sBAiCYA,EAhCX,kBAiCfA,EApBqB,wBAoBYA,EAhCnB,oBAiCdA,EApBkB,qBAoBYA,EAhChB,iBAiCdA,EAhCe,kBAgCYA,EA/Bb,qBAgCdA,EA/Ba,gBA+BYA,EA9BT,mBA+BhBA,EA9BgB,mBA8BYA,EA7BZ,mBA8BhBA,EA7Ba,gBA6BYA,EA5BT,mBA6BhBA,EA5BiB,qBA4BY,EAc7BjiC,EAAOC,QALP,SAA0BuE,GACxB,OAAOk7B,EAAal7B,IAClBw9B,EAASx9B,EAAMvD,WAAaghC,EAAexC,EAAWj7B,GAC1D,mBCzDA,IAAI09B,EAAc,EAAQ,OACtBC,EAAsB,EAAQ,OAC9BC,EAAW,EAAQ,OACnBz7B,EAAU,EAAQ,OAClB07B,EAAW,EAAQ,OA0BvBriC,EAAOC,QAjBP,SAAsBuE,GAGpB,MAAoB,mBAATA,EACFA,EAEI,MAATA,EACK49B,EAEW,iBAAT59B,EACFmC,EAAQnC,GACX29B,EAAoB39B,EAAM,GAAIA,EAAM,IACpC09B,EAAY19B,GAEX69B,EAAS79B,EAClB,mBC5BA,IAAI89B,EAAc,EAAQ,OACtBC,EAAa,EAAQ,MAMrB7iB,EAHcpa,OAAOpF,UAGQwf,eAsBjC1f,EAAOC,QAbP,SAAkB2gB,GAChB,IAAK0hB,EAAY1hB,GACf,OAAO2hB,EAAW3hB,GAEpB,IAAIhN,EAAS,GACb,IAAK,IAAIjR,KAAO2C,OAAOsb,GACjBlB,EAAepe,KAAKsf,EAAQje,IAAe,eAAPA,GACtCiR,EAAO9R,KAAKa,GAGhB,OAAOiR,CACT,mBC3BA,IAAI4uB,EAAc,EAAQ,OACtBC,EAAe,EAAQ,OACvBC,EAA0B,EAAQ,OAmBtC1iC,EAAOC,QAVP,SAAqBqe,GACnB,IAAI6iB,EAAYsB,EAAankB,GAC7B,OAAwB,GAApB6iB,EAAUlgC,QAAekgC,EAAU,GAAG,GACjCuB,EAAwBvB,EAAU,GAAG,GAAIA,EAAU,GAAG,IAExD,SAASvgB,GACd,OAAOA,IAAWtC,GAAUkkB,EAAY5hB,EAAQtC,EAAQ6iB,EAC1D,CACF,mBCnBA,IAAIvB,EAAc,EAAQ,OACtBpb,EAAM,EAAQ,OACdme,EAAQ,EAAQ,OAChBC,EAAQ,EAAQ,OAChBC,EAAqB,EAAQ,OAC7BH,EAA0B,EAAQ,OAClC/D,EAAQ,EAAQ,OA0BpB3+B,EAAOC,QAZP,SAA6B2N,EAAMyzB,GACjC,OAAIuB,EAAMh1B,IAASi1B,EAAmBxB,GAC7BqB,EAAwB/D,EAAM/wB,GAAOyzB,GAEvC,SAASzgB,GACd,IAAIoc,EAAWxY,EAAI5D,EAAQhT,GAC3B,YAAqBjO,IAAbq9B,GAA0BA,IAAaqE,EAC3CsB,EAAM/hB,EAAQhT,GACdgyB,EAAYyB,EAAUrE,EAAUsE,EACtC,CACF,mBC9BA,IAAIjF,EAAU,EAAQ,OAmBtBr8B,EAAOC,QATP,SAAiBoO,EAAOhO,GACtB,IAAIY,EAASoN,EAAMpN,OACnB,GAAKA,EAIL,OAAOo7B,EADPh8B,GAAKA,EAAI,EAAIY,EAAS,EACJA,GAAUoN,EAAMhO,QAAKV,CACzC,aCJAK,EAAOC,QANP,SAAsB0C,GACpB,OAAO,SAASie,GACd,OAAiB,MAAVA,OAAiBjhB,EAAYihB,EAAOje,EAC7C,CACF,mBCXA,IAAImgC,EAAU,EAAQ,OAetB9iC,EAAOC,QANP,SAA0B2N,GACxB,OAAO,SAASgT,GACd,OAAOkiB,EAAQliB,EAAQhT,EACzB,CACF,mBCbA,IAAI2vB,EAAW,EAAQ,OACnBtB,EAAc,EAAQ,OACtB8G,EAAkB,EAAQ,OAC1BvF,EAAY,EAAQ,OACpBwF,EAAY,EAAQ,OAMpBvgC,EAHalB,MAAMrB,UAGCuC,OAwCxBzC,EAAOC,QA3BP,SAAqBoO,EAAO3I,EAAQib,EAAUnC,GAC5C,IAAIvY,EAAUuY,EAAaukB,EAAkB9G,EACzC74B,GAAS,EACTnC,EAASyE,EAAOzE,OAChBs+B,EAAOlxB,EAQX,IANIA,IAAU3I,IACZA,EAASs9B,EAAUt9B,IAEjBib,IACF4e,EAAOhC,EAASlvB,EAAOmvB,EAAU7c,OAE1Bvd,EAAQnC,GAKf,IAJA,IAAIm9B,EAAY,EACZ55B,EAAQkB,EAAOtC,GACf06B,EAAWnd,EAAWA,EAASnc,GAASA,GAEpC45B,EAAYn4B,EAAQs5B,EAAMzB,EAAUM,EAAW5f,KAAgB,GACjE+gB,IAASlxB,GACX5L,EAAOnB,KAAKi+B,EAAMnB,EAAW,GAE/B37B,EAAOnB,KAAK+M,EAAO+vB,EAAW,GAGlC,OAAO/vB,CACT,mBChDA,IAAI40B,EAAY,EAAQ,OACpB5G,EAAU,EAAQ,OAMlB55B,EAHalB,MAAMrB,UAGCuC,OA6BxBzC,EAAOC,QAlBP,SAAoBoO,EAAO60B,GAIzB,IAHA,IAAIjiC,EAASoN,EAAQ60B,EAAQjiC,OAAS,EAClCkiC,EAAYliC,EAAS,EAElBA,KAAU,CACf,IAAImC,EAAQ8/B,EAAQjiC,GACpB,GAAIA,GAAUkiC,GAAa//B,IAAUoM,EAAU,CAC7C,IAAIA,EAAWpM,EACXi5B,EAAQj5B,GACVX,EAAOnB,KAAK+M,EAAOjL,EAAO,GAE1B6/B,EAAU50B,EAAOjL,EAErB,CACF,CACA,OAAOiL,CACT,mBClCA,IAAI+zB,EAAW,EAAQ,OACnBgB,EAAW,EAAQ,OACnBC,EAAc,EAAQ,OAc1BrjC,EAAOC,QAJP,SAAkB67B,EAAMoC,GACtB,OAAOmF,EAAYD,EAAStH,EAAMoC,EAAOkE,GAAWtG,EAAO,GAC7D,mBCdA,IAAIwH,EAAc,EAAQ,OACtB5E,EAAW,EAAQ,OACnBrC,EAAU,EAAQ,OAClBv8B,EAAW,EAAQ,OACnB6+B,EAAQ,EAAQ,OA8CpB3+B,EAAOC,QAlCP,SAAiB2gB,EAAQhT,EAAMpJ,EAAOs7B,GACpC,IAAKhgC,EAAS8gB,GACZ,OAAOA,EAST,IALA,IAAIxd,GAAS,EACTnC,GAHJ2M,EAAO8wB,EAAS9wB,EAAMgT,IAGJ3f,OACdkiC,EAAYliC,EAAS,EACrBsiC,EAAS3iB,EAEI,MAAV2iB,KAAoBngC,EAAQnC,GAAQ,CACzC,IAAI0B,EAAMg8B,EAAM/wB,EAAKxK,IACjBogC,EAAWh/B,EAEf,GAAY,cAAR7B,GAA+B,gBAARA,GAAiC,cAARA,EAClD,OAAOie,EAGT,GAAIxd,GAAS+/B,EAAW,CACtB,IAAInG,EAAWuG,EAAO5gC,QAELhD,KADjB6jC,EAAW1D,EAAaA,EAAW9C,EAAUr6B,EAAK4gC,QAAU5jC,KAE1D6jC,EAAW1jC,EAASk9B,GAChBA,EACCX,EAAQzuB,EAAKxK,EAAQ,IAAM,GAAK,CAAC,EAE1C,CACAkgC,EAAYC,EAAQ5gC,EAAK6gC,GACzBD,EAASA,EAAO5gC,EAClB,CACA,OAAOie,CACT,mBChDA,IAAI6iB,EAAW,EAAQ,OACnB1gB,EAAiB,EAAQ,OACzBqf,EAAW,EAAQ,OAUnBsB,EAAmB3gB,EAA4B,SAAS+Y,EAAM6H,GAChE,OAAO5gB,EAAe+Y,EAAM,WAAY,CACtC,cAAgB,EAChB,YAAc,EACd,MAAS2H,EAASE,GAClB,UAAY,GAEhB,EAPwCvB,EASxCpiC,EAAOC,QAAUyjC,aCSjB1jC,EAAOC,QArBP,SAAmBoO,EAAO6vB,EAAOC,GAC/B,IAAI/6B,GAAS,EACTnC,EAASoN,EAAMpN,OAEfi9B,EAAQ,IACVA,GAASA,EAAQj9B,EAAS,EAAKA,EAASi9B,IAE1CC,EAAMA,EAAMl9B,EAASA,EAASk9B,GACpB,IACRA,GAAOl9B,GAETA,EAASi9B,EAAQC,EAAM,EAAMA,EAAMD,IAAW,EAC9CA,KAAW,EAGX,IADA,IAAItqB,EAASrS,MAAMN,KACVmC,EAAQnC,GACf2S,EAAOxQ,GAASiL,EAAMjL,EAAQ86B,GAEhC,OAAOtqB,CACT,mBC5BA,IAAIgwB,EAAoB,EAAQ,OAC5BxB,EAAW,EAAQ,OACnByB,EAAW,EAAQ,OAuCvB7jC,EAAOC,QArBP,SAAyBoO,EAAO7J,EAAOs/B,GACrC,IAAIC,EAAM,EACNC,EAAgB,MAAT31B,EAAgB01B,EAAM11B,EAAMpN,OAEvC,GAAoB,iBAATuD,GAAqBA,IAAUA,GAASw/B,GAlBzBC,WAkBwD,CAChF,KAAOF,EAAMC,GAAM,CACjB,IAAIE,EAAOH,EAAMC,IAAU,EACvBlG,EAAWzvB,EAAM61B,GAEJ,OAAbpG,IAAsB+F,EAAS/F,KAC9BgG,EAAchG,GAAYt5B,EAAUs5B,EAAWt5B,GAClDu/B,EAAMG,EAAM,EAEZF,EAAOE,CAEX,CACA,OAAOF,CACT,CACA,OAAOJ,EAAkBv1B,EAAO7J,EAAO49B,EAAU0B,EACnD,mBCvCA,IAAID,EAAW,EAAQ,OAOnBM,EAAc3e,KAAKK,MACnBoZ,EAAYzZ,KAAKC,IA0DrBzlB,EAAOC,QA3CP,SAA2BoO,EAAO7J,EAAOmc,EAAUmjB,GACjD,IAAIC,EAAM,EACNC,EAAgB,MAAT31B,EAAgB,EAAIA,EAAMpN,OACrC,GAAa,IAAT+iC,EACF,OAAO,EAST,IALA,IAAII,GADJ5/B,EAAQmc,EAASnc,MACQA,EACrB4b,EAAsB,OAAV5b,EACZ6/B,EAAcR,EAASr/B,GACvB8/B,OAA2B3kC,IAAV6E,EAEdu/B,EAAMC,GAAM,CACjB,IAAIE,EAAMC,GAAaJ,EAAMC,GAAQ,GACjClG,EAAWnd,EAAStS,EAAM61B,IAC1B7jB,OAA4B1gB,IAAbm+B,EACfxd,EAAyB,OAAbwd,EACZyG,EAAiBzG,IAAaA,EAC9B0G,EAAcX,EAAS/F,GAE3B,GAAIsG,EACF,IAAIK,EAASX,GAAcS,OAE3BE,EADSH,EACAC,IAAmBT,GAAczjB,GACjCD,EACAmkB,GAAkBlkB,IAAiByjB,IAAexjB,GAClD+jB,EACAE,GAAkBlkB,IAAiBC,IAAcwjB,IAAeU,IAChElkB,IAAakkB,IAGbV,EAAchG,GAAYt5B,EAAUs5B,EAAWt5B,GAEtDigC,EACFV,EAAMG,EAAM,EAEZF,EAAOE,CAEX,CACA,OAAOjF,EAAU+E,EA3DGC,WA4DtB,mBChEA,IAAIlH,EAAK,EAAQ,OA6BjB/8B,EAAOC,QAlBP,SAAwBoO,EAAOsS,GAM7B,IALA,IAAIvd,GAAS,EACTnC,EAASoN,EAAMpN,OACf+6B,EAAW,EACXpoB,EAAS,KAEJxQ,EAAQnC,GAAQ,CACvB,IAAIuD,EAAQ6J,EAAMjL,GACd06B,EAAWnd,EAAWA,EAASnc,GAASA,EAE5C,IAAKpB,IAAU25B,EAAGe,EAAUyB,GAAO,CACjC,IAAIA,EAAOzB,EACXlqB,EAAOooB,KAAwB,IAAVx3B,EAAc,EAAIA,CACzC,CACF,CACA,OAAOoP,CACT,aCRA5T,EAAOC,QAVP,SAAmBI,EAAGsgB,GAIpB,IAHA,IAAIvd,GAAS,EACTwQ,EAASrS,MAAMlB,KAEV+C,EAAQ/C,GACfuT,EAAOxQ,GAASud,EAASvd,GAE3B,OAAOwQ,CACT,mBCjBA,IAAI0P,EAAS,EAAQ,OACjBia,EAAW,EAAQ,OACnB52B,EAAU,EAAQ,OAClBk9B,EAAW,EAAQ,OAMnBa,EAAcphB,EAASA,EAAOpjB,eAAYP,EAC1CglC,EAAiBD,EAAcA,EAAYn0B,cAAW5Q,EA0B1DK,EAAOC,QAhBP,SAAS2kC,EAAapgC,GAEpB,GAAoB,iBAATA,EACT,OAAOA,EAET,GAAImC,EAAQnC,GAEV,OAAO+4B,EAAS/4B,EAAOogC,GAAgB,GAEzC,GAAIf,EAASr/B,GACX,OAAOmgC,EAAiBA,EAAerjC,KAAKkD,GAAS,GAEvD,IAAIoP,EAAUpP,EAAQ,GACtB,MAAkB,KAAVoP,GAAkB,EAAIpP,IAAU,IAAa,KAAOoP,CAC9D,mBClCA,IAAIixB,EAAkB,EAAQ,OAG1BC,EAAc,OAelB9kC,EAAOC,QANP,SAAkB0jC,GAChB,OAAOA,EACHA,EAAOniC,MAAM,EAAGqjC,EAAgBlB,GAAU,GAAGnuB,QAAQsvB,EAAa,IAClEnB,CACN,aCHA3jC,EAAOC,QANP,SAAmB67B,GACjB,OAAO,SAASt3B,GACd,OAAOs3B,EAAKt3B,EACd,CACF,mBCXA,IAAI22B,EAAW,EAAQ,OACnBkC,EAAgB,EAAQ,OACxBC,EAAoB,EAAQ,OAC5BG,EAAW,EAAQ,OACnBsH,EAAY,EAAQ,OACpBC,EAAa,EAAQ,OAkEzBhlC,EAAOC,QApDP,SAAkBoO,EAAOsS,EAAUnC,GACjC,IAAIpb,GAAS,EACTs6B,EAAWL,EACXp8B,EAASoN,EAAMpN,OACf08B,GAAW,EACX/pB,EAAS,GACT2rB,EAAO3rB,EAEX,GAAI4K,EACFmf,GAAW,EACXD,EAAWJ,OAER,GAAIr8B,GAvBY,IAuBgB,CACnC,IAAI0jB,EAAMhE,EAAW,KAAOokB,EAAU12B,GACtC,GAAIsW,EACF,OAAOqgB,EAAWrgB,GAEpBgZ,GAAW,EACXD,EAAWD,EACX8B,EAAO,IAAIpE,CACb,MAEEoE,EAAO5e,EAAW,GAAK/M,EAEzBiqB,EACA,OAASz6B,EAAQnC,GAAQ,CACvB,IAAIuD,EAAQ6J,EAAMjL,GACd06B,EAAWnd,EAAWA,EAASnc,GAASA,EAG5C,GADAA,EAASga,GAAwB,IAAVha,EAAeA,EAAQ,EAC1Cm5B,GAAYG,IAAaA,EAAU,CAErC,IADA,IAAImH,EAAY1F,EAAKt+B,OACdgkC,KACL,GAAI1F,EAAK0F,KAAenH,EACtB,SAASD,EAGTld,GACF4e,EAAKz9B,KAAKg8B,GAEZlqB,EAAO9R,KAAK0C,EACd,MACUk5B,EAAS6B,EAAMzB,EAAUtf,KAC7B+gB,IAAS3rB,GACX2rB,EAAKz9B,KAAKg8B,GAEZlqB,EAAO9R,KAAK0C,GAEhB,CACA,OAAOoP,CACT,mBCrEA,IAAI8qB,EAAW,EAAQ,OACnBwG,EAAO,EAAQ,OACf1zB,EAAS,EAAQ,OACjBmtB,EAAQ,EAAQ,OAgBpB3+B,EAAOC,QANP,SAAmB2gB,EAAQhT,GAGzB,OAFAA,EAAO8wB,EAAS9wB,EAAMgT,GAEL,OADjBA,EAASpP,EAAOoP,EAAQhT,YACQgT,EAAO+d,EAAMuG,EAAKt3B,IACpD,mBCjBA,IAAIu3B,EAAY,EAAQ,OAyBxBnlC,EAAOC,QAZP,SAAmBoO,EAAOgH,EAAW+vB,EAAQ/G,GAI3C,IAHA,IAAIp9B,EAASoN,EAAMpN,OACfmC,EAAQi7B,EAAYp9B,GAAU,GAE1Bo9B,EAAYj7B,MAAYA,EAAQnC,IACtCoU,EAAUhH,EAAMjL,GAAQA,EAAOiL,KAEjC,OAAO+2B,EACHD,EAAU92B,EAAQgwB,EAAY,EAAIj7B,EAASi7B,EAAYj7B,EAAQ,EAAInC,GACnEkkC,EAAU92B,EAAQgwB,EAAYj7B,EAAQ,EAAI,EAAKi7B,EAAYp9B,EAASmC,EAC1E,mBCvBA,IAAIiiC,EAAiB,EAAQ,OACzB7G,EAAc,EAAQ,OACtB8G,EAAW,EAAQ,OAiCvBtlC,EAAOC,QArBP,SAAiBi/B,EAAQve,EAAUnC,GACjC,IAAIvd,EAASi+B,EAAOj+B,OACpB,GAAIA,EAAS,EACX,OAAOA,EAASqkC,EAASpG,EAAO,IAAM,GAKxC,IAHA,IAAI97B,GAAS,EACTwQ,EAASrS,MAAMN,KAEVmC,EAAQnC,GAIf,IAHA,IAAIoN,EAAQ6wB,EAAO97B,GACfg8B,GAAY,IAEPA,EAAWn+B,GACdm+B,GAAYh8B,IACdwQ,EAAOxQ,GAASiiC,EAAezxB,EAAOxQ,IAAUiL,EAAO6wB,EAAOE,GAAWze,EAAUnC,IAIzF,OAAO8mB,EAAS9G,EAAY5qB,EAAQ,GAAI+M,EAAUnC,EACpD,aCXAxe,EAAOC,QAbP,SAAuBslC,EAAO7/B,EAAQ8/B,GAMpC,IALA,IAAIpiC,GAAS,EACTnC,EAASskC,EAAMtkC,OACfwkC,EAAa//B,EAAOzE,OACpB2S,EAAS,CAAC,IAELxQ,EAAQnC,GAAQ,CACvB,IAAIuD,EAAQpB,EAAQqiC,EAAa//B,EAAOtC,QAASzD,EACjD6lC,EAAW5xB,EAAQ2xB,EAAMniC,GAAQoB,EACnC,CACA,OAAOoP,CACT,aCRA5T,EAAOC,QAJP,SAAkBu/B,EAAO78B,GACvB,OAAO68B,EAAMtF,IAAIv3B,EACnB,kBCVA,IAAI+iC,EAAoB,EAAQ,OAahC1lC,EAAOC,QAJP,SAA6BuE,GAC3B,OAAOkhC,EAAkBlhC,GAASA,EAAQ,EAC5C,mBCXA,IAAImC,EAAU,EAAQ,OAClBi8B,EAAQ,EAAQ,OAChB+C,EAAe,EAAQ,OACvBp1B,EAAW,EAAQ,OAiBvBvQ,EAAOC,QAPP,SAAkBuE,EAAOoc,GACvB,OAAIja,EAAQnC,GACHA,EAEFo+B,EAAMp+B,EAAOoc,GAAU,CAACpc,GAASmhC,EAAap1B,EAAS/L,GAChE,mBClBA,IAAIq/B,EAAW,EAAQ,OAwCvB7jC,EAAOC,QA9BP,SAA0BuE,EAAO0b,GAC/B,GAAI1b,IAAU0b,EAAO,CACnB,IAAIC,OAAyBxgB,IAAV6E,EACf4b,EAAsB,OAAV5b,EACZohC,EAAiBphC,IAAUA,EAC3B6/B,EAAcR,EAASr/B,GAEvB6b,OAAyB1gB,IAAVugB,EACfI,EAAsB,OAAVJ,EACZqkB,EAAiBrkB,IAAUA,EAC3BskB,EAAcX,EAAS3jB,GAE3B,IAAMI,IAAckkB,IAAgBH,GAAe7/B,EAAQ0b,GACtDmkB,GAAehkB,GAAgBkkB,IAAmBjkB,IAAckkB,GAChEpkB,GAAaC,GAAgBkkB,IAC5BpkB,GAAgBokB,IACjBqB,EACH,OAAO,EAET,IAAMxlB,IAAcikB,IAAgBG,GAAehgC,EAAQ0b,GACtDskB,GAAerkB,GAAgBylB,IAAmBxlB,IAAcikB,GAChE/jB,GAAaH,GAAgBylB,IAC5BvlB,GAAgBulB,IACjBrB,EACH,OAAQ,CAEZ,CACA,OAAO,CACT,aCnBAvkC,EAAOC,QAXP,SAAmBqe,EAAQjQ,GACzB,IAAIjL,GAAS,EACTnC,EAASqd,EAAOrd,OAGpB,IADAoN,IAAUA,EAAQ9M,MAAMN,MACfmC,EAAQnC,GACfoN,EAAMjL,GAASkb,EAAOlb,GAExB,OAAOiL,CACT,mBCjBA,IAGIw3B,EAHO,EAAQ,MAGG,sBAEtB7lC,EAAOC,QAAU4lC,mBCLjB,IAAI7K,EAAM,EAAQ,OACd8K,EAAO,EAAQ,OACfd,EAAa,EAAQ,OAYrBD,EAAc/J,GAAQ,EAAIgK,EAAW,IAAIhK,EAAI,CAAC,EAAE,KAAK,IAT1C,IASoE,SAASt1B,GAC1F,OAAO,IAAIs1B,EAAIt1B,EACjB,EAF4EogC,EAI5E9lC,EAAOC,QAAU8kC,mBClBjB,IAAIrL,EAAY,EAAQ,OAEpB3W,EAAkB,WACpB,IACE,IAAI+Y,EAAOpC,EAAUp0B,OAAQ,kBAE7B,OADAw2B,EAAK,CAAC,EAAG,GAAI,CAAC,GACPA,CACT,CAAE,MAAOpiB,GAAI,CACf,CANqB,GAQrB1Z,EAAOC,QAAU8iB,mBCVjB,IAAIoY,EAAW,EAAQ,OACnB4K,EAAY,EAAQ,OACpBtI,EAAW,EAAQ,OAiFvBz9B,EAAOC,QA9DP,SAAqBoO,EAAO6R,EAAO2f,EAASC,EAAYS,EAAWR,GACjE,IAAIiG,EAjBqB,EAiBTnG,EACZoG,EAAY53B,EAAMpN,OAClBk+B,EAAYjf,EAAMjf,OAEtB,GAAIglC,GAAa9G,KAAe6G,GAAa7G,EAAY8G,GACvD,OAAO,EAGT,IAAIC,EAAanG,EAAMvb,IAAInW,GACvB83B,EAAapG,EAAMvb,IAAItE,GAC3B,GAAIgmB,GAAcC,EAChB,OAAOD,GAAchmB,GAASimB,GAAc93B,EAE9C,IAAIjL,GAAS,EACTwQ,GAAS,EACT2rB,EA/BuB,EA+BfM,EAAoC,IAAI1E,OAAWx7B,EAM/D,IAJAogC,EAAMpb,IAAItW,EAAO6R,GACjB6f,EAAMpb,IAAIzE,EAAO7R,KAGRjL,EAAQ6iC,GAAW,CAC1B,IAAIG,EAAW/3B,EAAMjL,GACjBijC,EAAWnmB,EAAM9c,GAErB,GAAI08B,EACF,IAAIwG,EAAWN,EACXlG,EAAWuG,EAAUD,EAAUhjC,EAAO8c,EAAO7R,EAAO0xB,GACpDD,EAAWsG,EAAUC,EAAUjjC,EAAOiL,EAAO6R,EAAO6f,GAE1D,QAAiBpgC,IAAb2mC,EAAwB,CAC1B,GAAIA,EACF,SAEF1yB,GAAS,EACT,KACF,CAEA,GAAI2rB,GACF,IAAKwG,EAAU7lB,GAAO,SAASmmB,EAAUjH,GACnC,IAAK3B,EAAS8B,EAAMH,KACfgH,IAAaC,GAAY9F,EAAU6F,EAAUC,EAAUxG,EAASC,EAAYC,IAC/E,OAAOR,EAAKz9B,KAAKs9B,EAErB,IAAI,CACNxrB,GAAS,EACT,KACF,OACK,GACDwyB,IAAaC,IACX9F,EAAU6F,EAAUC,EAAUxG,EAASC,EAAYC,GACpD,CACLnsB,GAAS,EACT,KACF,CACF,CAGA,OAFAmsB,EAAc,OAAE1xB,GAChB0xB,EAAc,OAAE7f,GACTtM,CACT,mBCjFA,IAAI0P,EAAS,EAAQ,OACjBsY,EAAa,EAAQ,OACrBmB,EAAK,EAAQ,OACbiD,EAAc,EAAQ,OACtBuG,EAAa,EAAQ,OACrBvB,EAAa,EAAQ,OAqBrBN,EAAcphB,EAASA,EAAOpjB,eAAYP,EAC1C6mC,EAAgB9B,EAAcA,EAAY+B,aAAU9mC,EAoFxDK,EAAOC,QAjEP,SAAoB2gB,EAAQV,EAAO1T,EAAKqzB,EAASC,EAAYS,EAAWR,GACtE,OAAQvzB,GACN,IAzBc,oBA0BZ,GAAKoU,EAAO8lB,YAAcxmB,EAAMwmB,YAC3B9lB,EAAO+lB,YAAczmB,EAAMymB,WAC9B,OAAO,EAET/lB,EAASA,EAAOgmB,OAChB1mB,EAAQA,EAAM0mB,OAEhB,IAlCiB,uBAmCf,QAAKhmB,EAAO8lB,YAAcxmB,EAAMwmB,aAC3BnG,EAAU,IAAI3E,EAAWhb,GAAS,IAAIgb,EAAW1b,KAKxD,IAnDU,mBAoDV,IAnDU,gBAoDV,IAjDY,kBAoDV,OAAO6c,GAAInc,GAASV,GAEtB,IAxDW,iBAyDT,OAAOU,EAAOxX,MAAQ8W,EAAM9W,MAAQwX,EAAOgH,SAAW1H,EAAM0H,QAE9D,IAxDY,kBAyDZ,IAvDY,kBA2DV,OAAOhH,GAAWV,EAAQ,GAE5B,IAjES,eAkEP,IAAI2mB,EAAUN,EAEhB,IAjES,eAkEP,IAAIP,EA5EiB,EA4ELnG,EAGhB,GAFAgH,IAAYA,EAAU7B,GAElBpkB,EAAO+a,MAAQzb,EAAMyb,OAASqK,EAChC,OAAO,EAGT,IAAIc,EAAU/G,EAAMvb,IAAI5D,GACxB,GAAIkmB,EACF,OAAOA,GAAW5mB,EAEpB2f,GAtFuB,EAyFvBE,EAAMpb,IAAI/D,EAAQV,GAClB,IAAItM,EAASosB,EAAY6G,EAAQjmB,GAASimB,EAAQ3mB,GAAQ2f,EAASC,EAAYS,EAAWR,GAE1F,OADAA,EAAc,OAAEnf,GACThN,EAET,IAnFY,kBAoFV,GAAI4yB,EACF,OAAOA,EAAcllC,KAAKsf,IAAW4lB,EAAcllC,KAAK4e,GAG9D,OAAO,CACT,mBC7GA,IAAI6mB,EAAa,EAAQ,OASrBrnB,EAHcpa,OAAOpF,UAGQwf,eAgFjC1f,EAAOC,QAjEP,SAAsB2gB,EAAQV,EAAO2f,EAASC,EAAYS,EAAWR,GACnE,IAAIiG,EAtBqB,EAsBTnG,EACZmH,EAAWD,EAAWnmB,GACtBqmB,EAAYD,EAAS/lC,OAIzB,GAAIgmC,GAHWF,EAAW7mB,GACDjf,SAEM+kC,EAC7B,OAAO,EAGT,IADA,IAAI5iC,EAAQ6jC,EACL7jC,KAAS,CACd,IAAIT,EAAMqkC,EAAS5jC,GACnB,KAAM4iC,EAAYrjC,KAAOud,EAAQR,EAAepe,KAAK4e,EAAOvd,IAC1D,OAAO,CAEX,CAEA,IAAIukC,EAAanH,EAAMvb,IAAI5D,GACvBulB,EAAapG,EAAMvb,IAAItE,GAC3B,GAAIgnB,GAAcf,EAChB,OAAOe,GAAchnB,GAASimB,GAAcvlB,EAE9C,IAAIhN,GAAS,EACbmsB,EAAMpb,IAAI/D,EAAQV,GAClB6f,EAAMpb,IAAIzE,EAAOU,GAGjB,IADA,IAAIumB,EAAWnB,IACN5iC,EAAQ6jC,GAAW,CAE1B,IAAIjK,EAAWpc,EADfje,EAAMqkC,EAAS5jC,IAEXijC,EAAWnmB,EAAMvd,GAErB,GAAIm9B,EACF,IAAIwG,EAAWN,EACXlG,EAAWuG,EAAUrJ,EAAUr6B,EAAKud,EAAOU,EAAQmf,GACnDD,EAAW9C,EAAUqJ,EAAU1jC,EAAKie,EAAQV,EAAO6f,GAGzD,UAAmBpgC,IAAb2mC,EACGtJ,IAAaqJ,GAAY9F,EAAUvD,EAAUqJ,EAAUxG,EAASC,EAAYC,GAC7EuG,GACD,CACL1yB,GAAS,EACT,KACF,CACAuzB,IAAaA,EAAkB,eAAPxkC,EAC1B,CACA,GAAIiR,IAAWuzB,EAAU,CACvB,IAAIC,EAAUxmB,EAAOjX,YACjB09B,EAAUnnB,EAAMvW,YAGhBy9B,GAAWC,KACV,gBAAiBzmB,MAAU,gBAAiBV,IACzB,mBAAXknB,GAAyBA,aAAmBA,GACjC,mBAAXC,GAAyBA,aAAmBA,IACvDzzB,GAAS,EAEb,CAGA,OAFAmsB,EAAc,OAAEnf,GAChBmf,EAAc,OAAE7f,GACTtM,CACT,mBCvFA,IAAI0zB,EAAU,EAAQ,OAClBlE,EAAW,EAAQ,OACnBC,EAAc,EAAQ,OAa1BrjC,EAAOC,QAJP,SAAkB67B,GAChB,OAAOuH,EAAYD,EAAStH,OAAMn8B,EAAW2nC,GAAUxL,EAAO,GAChE,mBCbA,IAAIyL,EAAiB,EAAQ,OACzBC,EAAa,EAAQ,MACrBjiC,EAAO,EAAQ,OAanBvF,EAAOC,QAJP,SAAoB2gB,GAClB,OAAO2mB,EAAe3mB,EAAQrb,EAAMiiC,EACtC,mBCbA,IAAIC,EAAY,EAAQ,OAiBxBznC,EAAOC,QAPP,SAAoBuI,EAAK7F,GACvB,IAAI+O,EAAOlJ,EAAI4yB,SACf,OAAOqM,EAAU9kC,GACb+O,EAAmB,iBAAP/O,EAAkB,SAAW,QACzC+O,EAAKlJ,GACX,mBCfA,IAAIq6B,EAAqB,EAAQ,OAC7Bt9B,EAAO,EAAQ,OAsBnBvF,EAAOC,QAbP,SAAsB2gB,GAIpB,IAHA,IAAIhN,EAASrO,EAAKqb,GACd3f,EAAS2S,EAAO3S,OAEbA,KAAU,CACf,IAAI0B,EAAMiR,EAAO3S,GACbuD,EAAQoc,EAAOje,GAEnBiR,EAAO3S,GAAU,CAAC0B,EAAK6B,EAAOq+B,EAAmBr+B,GACnD,CACA,OAAOoP,CACT,mBCrBA,IAAI8zB,EAAe,EAAQ,OACvBC,EAAW,EAAQ,OAevB3nC,EAAOC,QALP,SAAmB2gB,EAAQje,GACzB,IAAI6B,EAAQmjC,EAAS/mB,EAAQje,GAC7B,OAAO+kC,EAAaljC,GAASA,OAAQ7E,CACvC,kBCdA,IAAIioC,EAAc,EAAQ,OACtBC,EAAY,EAAQ,OAMpBxkB,EAHc/d,OAAOpF,UAGcmjB,qBAGnCykB,EAAmBxiC,OAAO0d,sBAS1BwkB,EAAcM,EAA+B,SAASlnB,GACxD,OAAc,MAAVA,EACK,IAETA,EAAStb,OAAOsb,GACTgnB,EAAYE,EAAiBlnB,IAAS,SAASmnB,GACpD,OAAO1kB,EAAqB/hB,KAAKsf,EAAQmnB,EAC3C,IACF,EARqCF,EAUrC7nC,EAAOC,QAAUunC,kBC7BjB,IAAI/N,EAAW,EAAQ,OACnBgB,EAAM,EAAQ,OACd3gB,EAAU,EAAQ,OAClBkhB,EAAM,EAAQ,OACda,EAAU,EAAQ,OAClB4D,EAAa,EAAQ,OACrB+B,EAAW,EAAQ,OAGnBwG,EAAS,eAETC,EAAa,mBACbC,EAAS,eACTC,EAAa,mBAEbC,EAAc,oBAGdC,EAAqB7G,EAAS/H,GAC9B6O,EAAgB9G,EAAS/G,GACzB8N,EAAoB/G,EAAS1nB,GAC7B0uB,EAAgBhH,EAASxG,GACzByN,EAAoBjH,EAAS3F,GAS7BsE,EAASV,GAGRhG,GAAY0G,EAAO,IAAI1G,EAAS,IAAIiP,YAAY,MAAQN,GACxD3N,GAAO0F,EAAO,IAAI1F,IAAQuN,GAC1BluB,GAAWqmB,EAAOrmB,EAAQC,YAAckuB,GACxCjN,GAAOmF,EAAO,IAAInF,IAAQkN,GAC1BrM,GAAWsE,EAAO,IAAItE,IAAYsM,KACrChI,EAAS,SAAS37B,GAChB,IAAIoP,EAAS6rB,EAAWj7B,GACpBmkC,EA/BQ,mBA+BD/0B,EAAsBpP,EAAMmF,iBAAchK,EACjDipC,EAAaD,EAAOnH,EAASmH,GAAQ,GAEzC,GAAIC,EACF,OAAQA,GACN,KAAKP,EAAoB,OAAOD,EAChC,KAAKE,EAAe,OAAON,EAC3B,KAAKO,EAAmB,OAAON,EAC/B,KAAKO,EAAe,OAAON,EAC3B,KAAKO,EAAmB,OAAON,EAGnC,OAAOv0B,CACT,GAGF5T,EAAOC,QAAUkgC,aC7CjBngC,EAAOC,QAJP,SAAkB2gB,EAAQje,GACxB,OAAiB,MAAVie,OAAiBjhB,EAAYihB,EAAOje,EAC7C,mBCVA,IAAI+7B,EAAW,EAAQ,OACnBvC,EAAc,EAAQ,OACtBx1B,EAAU,EAAQ,OAClB01B,EAAU,EAAQ,OAClB2F,EAAW,EAAQ,OACnBrD,EAAQ,EAAQ,OAiCpB3+B,EAAOC,QAtBP,SAAiB2gB,EAAQhT,EAAMi7B,GAO7B,IAJA,IAAIzlC,GAAS,EACTnC,GAHJ2M,EAAO8wB,EAAS9wB,EAAMgT,IAGJ3f,OACd2S,GAAS,IAEJxQ,EAAQnC,GAAQ,CACvB,IAAI0B,EAAMg8B,EAAM/wB,EAAKxK,IACrB,KAAMwQ,EAAmB,MAAVgN,GAAkBioB,EAAQjoB,EAAQje,IAC/C,MAEFie,EAASA,EAAOje,EAClB,CACA,OAAIiR,KAAYxQ,GAASnC,EAChB2S,KAET3S,EAAmB,MAAV2f,EAAiB,EAAIA,EAAO3f,SAClB+gC,EAAS/gC,IAAWo7B,EAAQ15B,EAAK1B,KACjD0F,EAAQia,IAAWub,EAAYvb,GACpC,mBCpCA,IAAIkoB,EAAe,EAAQ,OAc3B9oC,EAAOC,QALP,WACET,KAAK47B,SAAW0N,EAAeA,EAAa,MAAQ,CAAC,EACrDtpC,KAAKm8B,KAAO,CACd,aCIA37B,EAAOC,QANP,SAAoB0C,GAClB,IAAIiR,EAASpU,KAAK06B,IAAIv3B,WAAenD,KAAK47B,SAASz4B,GAEnD,OADAnD,KAAKm8B,MAAQ/nB,EAAS,EAAI,EACnBA,CACT,mBCdA,IAAIk1B,EAAe,EAAQ,OASvBppB,EAHcpa,OAAOpF,UAGQwf,eAoBjC1f,EAAOC,QATP,SAAiB0C,GACf,IAAI+O,EAAOlS,KAAK47B,SAChB,GAAI0N,EAAc,CAChB,IAAIl1B,EAASlC,EAAK/O,GAClB,MArBiB,8BAqBViR,OAA4BjU,EAAYiU,CACjD,CACA,OAAO8L,EAAepe,KAAKoQ,EAAM/O,GAAO+O,EAAK/O,QAAOhD,CACtD,mBC3BA,IAAImpC,EAAe,EAAQ,OAMvBppB,EAHcpa,OAAOpF,UAGQwf,eAgBjC1f,EAAOC,QALP,SAAiB0C,GACf,IAAI+O,EAAOlS,KAAK47B,SAChB,OAAO0N,OAA8BnpC,IAAd+R,EAAK/O,GAAsB+c,EAAepe,KAAKoQ,EAAM/O,EAC9E,mBCpBA,IAAImmC,EAAe,EAAQ,OAsB3B9oC,EAAOC,QAPP,SAAiB0C,EAAK6B,GACpB,IAAIkN,EAAOlS,KAAK47B,SAGhB,OAFA57B,KAAKm8B,MAAQn8B,KAAK06B,IAAIv3B,GAAO,EAAI,EACjC+O,EAAK/O,GAAQmmC,QAA0BnpC,IAAV6E,EAfV,4BAekDA,EAC9DhF,IACT,mBCpBA,IAAI8jB,EAAS,EAAQ,OACjB6Y,EAAc,EAAQ,OACtBx1B,EAAU,EAAQ,OAGlBoiC,EAAmBzlB,EAASA,EAAO0lB,wBAAqBrpC,EAc5DK,EAAOC,QALP,SAAuBuE,GACrB,OAAOmC,EAAQnC,IAAU23B,EAAY33B,OAChCukC,GAAoBvkC,GAASA,EAAMukC,GAC1C,aChBA,IAGIE,EAAW,mBAoBfjpC,EAAOC,QAVP,SAAiBuE,EAAOvD,GACtB,IAAIR,SAAc+D,EAGlB,SAFAvD,EAAmB,MAAVA,EAfY,iBAewBA,KAGlC,UAARR,GACU,UAARA,GAAoBwoC,EAASnmB,KAAKte,KAChCA,GAAS,GAAKA,EAAQ,GAAK,GAAKA,EAAQvD,CACjD,mBCtBA,IAAI87B,EAAK,EAAQ,OACbmM,EAAc,EAAQ,OACtB7M,EAAU,EAAQ,OAClBv8B,EAAW,EAAQ,OA0BvBE,EAAOC,QAdP,SAAwBuE,EAAOpB,EAAOwd,GACpC,IAAK9gB,EAAS8gB,GACZ,OAAO,EAET,IAAIngB,SAAc2C,EAClB,SAAY,UAAR3C,EACKyoC,EAAYtoB,IAAWyb,EAAQj5B,EAAOwd,EAAO3f,QACrC,UAARR,GAAoB2C,KAASwd,IAE7Bmc,EAAGnc,EAAOxd,GAAQoB,EAG7B,mBC3BA,IAAImC,EAAU,EAAQ,OAClBk9B,EAAW,EAAQ,OAGnBsF,EAAe,mDACfC,EAAgB,QAuBpBppC,EAAOC,QAbP,SAAeuE,EAAOoc,GACpB,GAAIja,EAAQnC,GACV,OAAO,EAET,IAAI/D,SAAc+D,EAClB,QAAY,UAAR/D,GAA4B,UAARA,GAA4B,WAARA,GAC/B,MAAT+D,IAAiBq/B,EAASr/B,MAGvB4kC,EAActmB,KAAKte,KAAW2kC,EAAarmB,KAAKte,IAC1C,MAAVoc,GAAkBpc,KAASc,OAAOsb,GACvC,aCZA5gB,EAAOC,QAPP,SAAmBuE,GACjB,IAAI/D,SAAc+D,EAClB,MAAgB,UAAR/D,GAA4B,UAARA,GAA4B,UAARA,GAA4B,WAARA,EACrD,cAAV+D,EACU,OAAVA,CACP,mBCZA,IAIM6kC,EAJFxD,EAAa,EAAQ,OAGrByD,GACED,EAAM,SAASE,KAAK1D,GAAcA,EAAWtgC,MAAQsgC,EAAWtgC,KAAKikC,UAAY,KACvE,iBAAmBH,EAAO,GAc1CrpC,EAAOC,QAJP,SAAkB67B,GAChB,QAASwN,GAAeA,KAAcxN,CACxC,aChBA,IAAI8F,EAAct8B,OAAOpF,UAgBzBF,EAAOC,QAPP,SAAqBuE,GACnB,IAAImkC,EAAOnkC,GAASA,EAAMmF,YAG1B,OAAOnF,KAFqB,mBAARmkC,GAAsBA,EAAKzoC,WAAc0hC,EAG/D,mBCfA,IAAI9hC,EAAW,EAAQ,OAcvBE,EAAOC,QAJP,SAA4BuE,GAC1B,OAAOA,IAAUA,IAAU1E,EAAS0E,EACtC,aCAAxE,EAAOC,QALP,WACET,KAAK47B,SAAW,GAChB57B,KAAKm8B,KAAO,CACd,mBCVA,IAAI8N,EAAe,EAAQ,OAMvBhnC,EAHalB,MAAMrB,UAGCuC,OA4BxBzC,EAAOC,QAjBP,SAAyB0C,GACvB,IAAI+O,EAAOlS,KAAK47B,SACZh4B,EAAQqmC,EAAa/3B,EAAM/O,GAE/B,QAAIS,EAAQ,KAIRA,GADYsO,EAAKzQ,OAAS,EAE5ByQ,EAAKiW,MAELllB,EAAOnB,KAAKoQ,EAAMtO,EAAO,KAEzB5D,KAAKm8B,MACA,EACT,mBChCA,IAAI8N,EAAe,EAAQ,OAkB3BzpC,EAAOC,QAPP,SAAsB0C,GACpB,IAAI+O,EAAOlS,KAAK47B,SACZh4B,EAAQqmC,EAAa/3B,EAAM/O,GAE/B,OAAOS,EAAQ,OAAIzD,EAAY+R,EAAKtO,GAAO,EAC7C,mBChBA,IAAIqmC,EAAe,EAAQ,OAe3BzpC,EAAOC,QAJP,SAAsB0C,GACpB,OAAO8mC,EAAajqC,KAAK47B,SAAUz4B,IAAQ,CAC7C,mBCbA,IAAI8mC,EAAe,EAAQ,OAyB3BzpC,EAAOC,QAbP,SAAsB0C,EAAK6B,GACzB,IAAIkN,EAAOlS,KAAK47B,SACZh4B,EAAQqmC,EAAa/3B,EAAM/O,GAQ/B,OANIS,EAAQ,KACR5D,KAAKm8B,KACPjqB,EAAK5P,KAAK,CAACa,EAAK6B,KAEhBkN,EAAKtO,GAAO,GAAKoB,EAEZhF,IACT,mBCvBA,IAAIw6B,EAAO,EAAQ,OACfQ,EAAY,EAAQ,OACpBC,EAAM,EAAQ,OAkBlBz6B,EAAOC,QATP,WACET,KAAKm8B,KAAO,EACZn8B,KAAK47B,SAAW,CACd,KAAQ,IAAIpB,EACZ,IAAO,IAAKS,GAAOD,GACnB,OAAU,IAAIR,EAElB,mBClBA,IAAI0P,EAAa,EAAQ,OAiBzB1pC,EAAOC,QANP,SAAwB0C,GACtB,IAAIiR,EAAS81B,EAAWlqC,KAAMmD,GAAa,OAAEA,GAE7C,OADAnD,KAAKm8B,MAAQ/nB,EAAS,EAAI,EACnBA,CACT,mBCfA,IAAI81B,EAAa,EAAQ,OAezB1pC,EAAOC,QAJP,SAAqB0C,GACnB,OAAO+mC,EAAWlqC,KAAMmD,GAAK6hB,IAAI7hB,EACnC,kBCbA,IAAI+mC,EAAa,EAAQ,OAezB1pC,EAAOC,QAJP,SAAqB0C,GACnB,OAAO+mC,EAAWlqC,KAAMmD,GAAKu3B,IAAIv3B,EACnC,mBCbA,IAAI+mC,EAAa,EAAQ,OAqBzB1pC,EAAOC,QATP,SAAqB0C,EAAK6B,GACxB,IAAIkN,EAAOg4B,EAAWlqC,KAAMmD,GACxBg5B,EAAOjqB,EAAKiqB,KAIhB,OAFAjqB,EAAKiT,IAAIhiB,EAAK6B,GACdhF,KAAKm8B,MAAQjqB,EAAKiqB,MAAQA,EAAO,EAAI,EAC9Bn8B,IACT,aCFAQ,EAAOC,QAVP,SAAoBuI,GAClB,IAAIpF,GAAS,EACTwQ,EAASrS,MAAMiH,EAAImzB,MAKvB,OAHAnzB,EAAIX,SAAQ,SAASrD,EAAO7B,GAC1BiR,IAASxQ,GAAS,CAACT,EAAK6B,EAC1B,IACOoP,CACT,aCIA5T,EAAOC,QAVP,SAAiC0C,EAAK0+B,GACpC,OAAO,SAASzgB,GACd,OAAc,MAAVA,IAGGA,EAAOje,KAAS0+B,SACP1hC,IAAb0hC,GAA2B1+B,KAAO2C,OAAOsb,IAC9C,CACF,mBCjBA,IAAI+oB,EAAU,EAAQ,OAyBtB3pC,EAAOC,QAZP,SAAuB67B,GACrB,IAAIloB,EAAS+1B,EAAQ7N,GAAM,SAASn5B,GAIlC,OAfmB,MAYf68B,EAAM7D,MACR6D,EAAM3a,QAEDliB,CACT,IAEI68B,EAAQ5rB,EAAO4rB,MACnB,OAAO5rB,CACT,mBCvBA,IAGIk1B,EAHY,EAAQ,MAGLpP,CAAUp0B,OAAQ,UAErCtF,EAAOC,QAAU6oC,kBCLjB,IAGIvG,EAHU,EAAQ,MAGLqH,CAAQtkC,OAAOC,KAAMD,QAEtCtF,EAAOC,QAAUsiC,8BCLjB,IAAIsH,EAAa,EAAQ,OAGrBC,EAA4C7pC,IAAYA,EAAQ8pC,UAAY9pC,EAG5E+pC,EAAaF,GAA4C9pC,IAAWA,EAAO+pC,UAAY/pC,EAMvFiqC,EAHgBD,GAAcA,EAAW/pC,UAAY6pC,GAGtBD,EAAWK,QAG1CC,EAAY,WACd,IAEE,IAAIC,EAAQJ,GAAcA,EAAWK,SAAWL,EAAWK,QAAQ,QAAQD,MAE3E,OAAIA,GAKGH,GAAeA,EAAYK,SAAWL,EAAYK,QAAQ,OACnE,CAAE,MAAO5wB,GAAI,CACf,CAZe,GAcf1Z,EAAOC,QAAUkqC,aCfjBnqC,EAAOC,QANP,SAAiB67B,EAAMyO,GACrB,OAAO,SAAS1qC,GACd,OAAOi8B,EAAKyO,EAAU1qC,GACxB,CACF,mBCZA,IAAI4B,EAAQ,EAAQ,OAGhB+oC,EAAYhlB,KAAKilB,IAgCrBzqC,EAAOC,QArBP,SAAkB67B,EAAMoC,EAAOqM,GAE7B,OADArM,EAAQsM,OAAoB7qC,IAAVu+B,EAAuBpC,EAAK76B,OAAS,EAAKi9B,EAAO,GAC5D,WAML,IALA,IAAIr9B,EAAOK,UACPkC,GAAS,EACTnC,EAASupC,EAAU3pC,EAAKI,OAASi9B,EAAO,GACxC7vB,EAAQ9M,MAAMN,KAETmC,EAAQnC,GACfoN,EAAMjL,GAASvC,EAAKq9B,EAAQ96B,GAE9BA,GAAS,EAET,IADA,IAAIsnC,EAAYnpC,MAAM28B,EAAQ,KACrB96B,EAAQ86B,GACfwM,EAAUtnC,GAASvC,EAAKuC,GAG1B,OADAsnC,EAAUxM,GAASqM,EAAUl8B,GACtB5M,EAAMq6B,EAAMt8B,KAAMkrC,EAC3B,CACF,mBCjCA,IAAI5H,EAAU,EAAQ,OAClBqC,EAAY,EAAQ,OAcxBnlC,EAAOC,QAJP,SAAgB2gB,EAAQhT,GACtB,OAAOA,EAAK3M,OAAS,EAAI2f,EAASkiB,EAAQliB,EAAQukB,EAAUv3B,EAAM,GAAI,GACxE,aCKA5N,EAAOC,QALP,SAAqBuE,GAEnB,OADAhF,KAAK47B,SAASzW,IAAIngB,EAbC,6BAcZhF,IACT,aCHAQ,EAAOC,QAJP,SAAqBuE,GACnB,OAAOhF,KAAK47B,SAASlB,IAAI11B,EAC3B,aCMAxE,EAAOC,QAVP,SAAoB0kB,GAClB,IAAIvhB,GAAS,EACTwQ,EAASrS,MAAMojB,EAAIgX,MAKvB,OAHAhX,EAAI9c,SAAQ,SAASrD,GACnBoP,IAASxQ,GAASoB,CACpB,IACOoP,CACT,mBCfA,IAAI8vB,EAAkB,EAAQ,OAW1BL,EAVW,EAAQ,MAULsH,CAASjH,GAE3B1jC,EAAOC,QAAUojC,aCZjB,IAIIuH,EAAYtmB,KAAKsC,IA+BrB5mB,EAAOC,QApBP,SAAkB67B,GAChB,IAAIxpB,EAAQ,EACRu4B,EAAa,EAEjB,OAAO,WACL,IAAIC,EAAQF,IACRG,EApBO,IAoBiBD,EAAQD,GAGpC,GADAA,EAAaC,EACTC,EAAY,GACd,KAAMz4B,GAzBI,IA0BR,OAAOpR,UAAU,QAGnBoR,EAAQ,EAEV,OAAOwpB,EAAKr6B,WAAM9B,EAAWuB,UAC/B,CACF,mBClCA,IAAIs5B,EAAY,EAAQ,OAcxBx6B,EAAOC,QALP,WACET,KAAK47B,SAAW,IAAIZ,EACpBh7B,KAAKm8B,KAAO,CACd,aCKA37B,EAAOC,QARP,SAAqB0C,GACnB,IAAI+O,EAAOlS,KAAK47B,SACZxnB,EAASlC,EAAa,OAAE/O,GAG5B,OADAnD,KAAKm8B,KAAOjqB,EAAKiqB,KACV/nB,CACT,aCFA5T,EAAOC,QAJP,SAAkB0C,GAChB,OAAOnD,KAAK47B,SAAS5W,IAAI7hB,EAC3B,aCEA3C,EAAOC,QAJP,SAAkB0C,GAChB,OAAOnD,KAAK47B,SAASlB,IAAIv3B,EAC3B,mBCXA,IAAI63B,EAAY,EAAQ,OACpBC,EAAM,EAAQ,OACdM,EAAW,EAAQ,OA+BvB/6B,EAAOC,QAhBP,SAAkB0C,EAAK6B,GACrB,IAAIkN,EAAOlS,KAAK47B,SAChB,GAAI1pB,aAAgB8oB,EAAW,CAC7B,IAAIwQ,EAAQt5B,EAAK0pB,SACjB,IAAKX,GAAQuQ,EAAM/pC,OAASgqC,IAG1B,OAFAD,EAAMlpC,KAAK,CAACa,EAAK6B,IACjBhF,KAAKm8B,OAASjqB,EAAKiqB,KACZn8B,KAETkS,EAAOlS,KAAK47B,SAAW,IAAIL,EAASiQ,EACtC,CAGA,OAFAt5B,EAAKiT,IAAIhiB,EAAK6B,GACdhF,KAAKm8B,KAAOjqB,EAAKiqB,KACVn8B,IACT,aCTAQ,EAAOC,QAZP,SAAuBoO,EAAO7J,EAAO45B,GAInC,IAHA,IAAIh7B,EAAQg7B,EAAY,EACpBn9B,EAASoN,EAAMpN,SAEVmC,EAAQnC,GACf,GAAIoN,EAAMjL,KAAWoB,EACnB,OAAOpB,EAGX,OAAQ,CACV,aCAApD,EAAOC,QAVP,SAA2BoO,EAAO7J,EAAO45B,GAEvC,IADA,IAAIh7B,EAAQg7B,EAAY,EACjBh7B,KACL,GAAIiL,EAAMjL,KAAWoB,EACnB,OAAOpB,EAGX,OAAOA,CACT,mBClBA,IAAI8nC,EAAgB,EAAQ,OAGxBC,EAAa,mGAGbC,EAAe,WASfzF,EAAeuF,GAAc,SAASvH,GACxC,IAAI/vB,EAAS,GAOb,OAN6B,KAAzB+vB,EAAO0H,WAAW,IACpBz3B,EAAO9R,KAAK,IAEd6hC,EAAOnuB,QAAQ21B,GAAY,SAASG,EAAO//B,EAAQggC,EAAOC,GACxD53B,EAAO9R,KAAKypC,EAAQC,EAAUh2B,QAAQ41B,EAAc,MAAS7/B,GAAU+/B,EACzE,IACO13B,CACT,IAEA5T,EAAOC,QAAU0lC,mBC1BjB,IAAI9B,EAAW,EAAQ,OAoBvB7jC,EAAOC,QARP,SAAeuE,GACb,GAAoB,iBAATA,GAAqBq/B,EAASr/B,GACvC,OAAOA,EAET,IAAIoP,EAAUpP,EAAQ,GACtB,MAAkB,KAAVoP,GAAkB,EAAIpP,IAAU,IAAa,KAAOoP,CAC9D,aCjBA,IAGIiuB,EAHYF,SAASzhC,UAGIqQ,SAqB7BvQ,EAAOC,QAZP,SAAkB67B,GAChB,GAAY,MAARA,EAAc,CAChB,IACE,OAAO+F,EAAavgC,KAAKw6B,EAC3B,CAAE,MAAOpiB,GAAI,CACb,IACE,OAAQoiB,EAAO,EACjB,CAAE,MAAOpiB,GAAI,CACf,CACA,MAAO,EACT,aCtBA,IAAI+xB,EAAe,KAiBnBzrC,EAAOC,QAPP,SAAyB0jC,GAGvB,IAFA,IAAIvgC,EAAQugC,EAAO1iC,OAEZmC,KAAWqoC,EAAa3oB,KAAK6gB,EAAO9Z,OAAOzmB,MAClD,OAAOA,CACT,mBChBApD,EAAOC,QAAU,CACf,MAAS,EAAQ,OACjB,QAAW,EAAQ,OACnB,OAAU,EAAQ,OAClB,WAAc,EAAQ,OACtB,aAAgB,EAAQ,OACxB,eAAkB,EAAQ,OAC1B,KAAQ,EAAQ,MAChB,UAAa,EAAQ,OACrB,eAAkB,EAAQ,OAC1B,UAAa,EAAQ,OACrB,KAAQ,EAAQ,OAChB,UAAa,EAAQ,OACrB,cAAiB,EAAQ,OACzB,MAAS,EAAQ,OACjB,QAAW,EAAQ,OACnB,YAAe,EAAQ,MACvB,aAAgB,EAAQ,OACxB,UAAa,EAAQ,OACrB,KAAQ,EAAQ,KAChB,QAAW,EAAQ,OACnB,QAAW,EAAQ,OACnB,aAAgB,EAAQ,MACxB,eAAkB,EAAQ,OAC1B,iBAAoB,EAAQ,OAC5B,KAAQ,EAAQ,OAChB,KAAQ,EAAQ,OAChB,YAAe,EAAQ,OACvB,IAAO,EAAQ,OACf,KAAQ,EAAQ,OAChB,QAAW,EAAQ,OACnB,UAAa,EAAQ,OACrB,YAAe,EAAQ,OACvB,OAAU,EAAQ,OAClB,OAAU,EAAQ,OAClB,QAAW,EAAQ,OACnB,MAAS,EAAQ,OACjB,YAAe,EAAQ,OACvB,cAAiB,EAAQ,OACzB,cAAiB,EAAQ,OACzB,gBAAmB,EAAQ,OAC3B,kBAAqB,EAAQ,OAC7B,kBAAqB,EAAQ,OAC7B,WAAc,EAAQ,OACtB,aAAgB,EAAQ,OACxB,KAAQ,EAAQ,OAChB,KAAQ,EAAQ,OAChB,UAAa,EAAQ,OACrB,eAAkB,EAAQ,MAC1B,UAAa,EAAQ,OACrB,MAAS,EAAQ,OACjB,QAAW,EAAQ,OACnB,UAAa,EAAQ,OACrB,KAAQ,EAAQ,OAChB,OAAU,EAAQ,OAClB,SAAY,EAAQ,MACpB,MAAS,EAAQ,OACjB,UAAa,EAAQ,OACrB,QAAW,EAAQ,OACnB,IAAO,EAAQ,OACf,MAAS,EAAQ,OACjB,QAAW,EAAQ,OACnB,IAAO,EAAQ,OACf,UAAa,EAAQ,OACrB,cAAiB,EAAQ,OACzB,QAAW,EAAQ,yBCjErB,IAAIklC,EAAY,EAAQ,OACpBuG,EAAiB,EAAQ,OACzB1N,EAAY,EAAQ,OAGpB2N,EAAanmB,KAAKomB,KAClBpB,EAAYhlB,KAAKilB,IA2CrBzqC,EAAOC,QApBP,SAAeoO,EAAOstB,EAAMkQ,GAExBlQ,GADGkQ,EAAQH,EAAer9B,EAAOstB,EAAMkQ,QAAkBlsC,IAATg8B,GACzC,EAEA6O,EAAUxM,EAAUrC,GAAO,GAEpC,IAAI16B,EAAkB,MAAToN,EAAgB,EAAIA,EAAMpN,OACvC,IAAKA,GAAU06B,EAAO,EACpB,MAAO,GAMT,IAJA,IAAIv4B,EAAQ,EACR44B,EAAW,EACXpoB,EAASrS,MAAMoqC,EAAW1qC,EAAS06B,IAEhCv4B,EAAQnC,GACb2S,EAAOooB,KAAcmJ,EAAU92B,EAAOjL,EAAQA,GAASu4B,GAEzD,OAAO/nB,CACT,aCjBA5T,EAAOC,QAfP,SAAiBoO,GAMf,IALA,IAAIjL,GAAS,EACTnC,EAAkB,MAAToN,EAAgB,EAAIA,EAAMpN,OACnC+6B,EAAW,EACXpoB,EAAS,KAEJxQ,EAAQnC,GAAQ,CACvB,IAAIuD,EAAQ6J,EAAMjL,GACdoB,IACFoP,EAAOooB,KAAcx3B,EAEzB,CACA,OAAOoP,CACT,mBC5BA,IAAI0qB,EAAY,EAAQ,OACpBE,EAAc,EAAQ,OACtBwE,EAAY,EAAQ,OACpBr8B,EAAU,EAAQ,OAuCtB3G,EAAOC,QAfP,WACE,IAAIgB,EAASC,UAAUD,OACvB,IAAKA,EACH,MAAO,GAMT,IAJA,IAAIJ,EAAOU,MAAMN,EAAS,GACtBoN,EAAQnN,UAAU,GAClBkC,EAAQnC,EAELmC,KACLvC,EAAKuC,EAAQ,GAAKlC,UAAUkC,GAE9B,OAAOk7B,EAAU33B,EAAQ0H,GAAS20B,EAAU30B,GAAS,CAACA,GAAQmwB,EAAY39B,EAAM,GAClF,aCfAb,EAAOC,QANP,SAAkBuE,GAChB,OAAO,WACL,OAAOA,CACT,CACF,mBCvBA,IAAI6gC,EAAiB,EAAQ,OACzB7G,EAAc,EAAQ,OACtBsN,EAAW,EAAQ,OACnBpG,EAAoB,EAAQ,OAuB5BqG,EAAaD,GAAS,SAASz9B,EAAO3I,GACxC,OAAOggC,EAAkBr3B,GACrBg3B,EAAeh3B,EAAOmwB,EAAY94B,EAAQ,EAAGggC,GAAmB,IAChE,EACN,IAEA1lC,EAAOC,QAAU8rC,mBChCjB,IAAI1G,EAAiB,EAAQ,OACzB7G,EAAc,EAAQ,OACtBwN,EAAe,EAAQ,OACvBF,EAAW,EAAQ,OACnBpG,EAAoB,EAAQ,OAC5BR,EAAO,EAAQ,OA4Bf+G,EAAeH,GAAS,SAASz9B,EAAO3I,GAC1C,IAAIib,EAAWukB,EAAKx/B,GAIpB,OAHIggC,EAAkB/kB,KACpBA,OAAWhhB,GAEN+lC,EAAkBr3B,GACrBg3B,EAAeh3B,EAAOmwB,EAAY94B,EAAQ,EAAGggC,GAAmB,GAAOsG,EAAarrB,EAAU,IAC9F,EACN,IAEA3gB,EAAOC,QAAUgsC,mBC3CjB,IAAI5G,EAAiB,EAAQ,OACzB7G,EAAc,EAAQ,OACtBsN,EAAW,EAAQ,OACnBpG,EAAoB,EAAQ,OAC5BR,EAAO,EAAQ,OAyBfgH,EAAiBJ,GAAS,SAASz9B,EAAO3I,GAC5C,IAAI8Y,EAAa0mB,EAAKx/B,GAItB,OAHIggC,EAAkBlnB,KACpBA,OAAa7e,GAER+lC,EAAkBr3B,GACrBg3B,EAAeh3B,EAAOmwB,EAAY94B,EAAQ,EAAGggC,GAAmB,QAAO/lC,EAAW6e,GAClF,EACN,IAEAxe,EAAOC,QAAUisC,kBCvCjB,IAAI/G,EAAY,EAAQ,OACpBnH,EAAY,EAAQ,OAoCxBh+B,EAAOC,QATP,SAAcoO,EAAOhO,EAAGwrC,GACtB,IAAI5qC,EAAkB,MAAToN,EAAgB,EAAIA,EAAMpN,OACvC,OAAKA,GAGLZ,EAAKwrC,QAAelsC,IAANU,EAAmB,EAAI29B,EAAU39B,GACxC8kC,EAAU92B,EAAOhO,EAAI,EAAI,EAAIA,EAAGY,IAH9B,EAIX,mBCnCA,IAAIkkC,EAAY,EAAQ,OACpBnH,EAAY,EAAQ,OAqCxBh+B,EAAOC,QAVP,SAAmBoO,EAAOhO,EAAGwrC,GAC3B,IAAI5qC,EAAkB,MAAToN,EAAgB,EAAIA,EAAMpN,OACvC,OAAKA,GAGLZ,EAAKwrC,QAAelsC,IAANU,EAAmB,EAAI29B,EAAU39B,GAExC8kC,EAAU92B,EAAO,GADxBhO,EAAIY,EAASZ,GACkB,EAAI,EAAIA,IAJ9B,EAKX,mBCpCA,IAAI2rC,EAAe,EAAQ,OACvBG,EAAY,EAAQ,OA2CxBnsC,EAAOC,QANP,SAAwBoO,EAAOgH,GAC7B,OAAQhH,GAASA,EAAMpN,OACnBkrC,EAAU99B,EAAO29B,EAAa32B,EAAW,IAAI,GAAM,GACnD,EACN,mBC1CA,IAAI22B,EAAe,EAAQ,OACvBG,EAAY,EAAQ,OA2CxBnsC,EAAOC,QANP,SAAmBoO,EAAOgH,GACxB,OAAQhH,GAASA,EAAMpN,OACnBkrC,EAAU99B,EAAO29B,EAAa32B,EAAW,IAAI,GAC7C,EACN,aCNArV,EAAOC,QAJP,SAAYuE,EAAO0b,GACjB,OAAO1b,IAAU0b,GAAU1b,IAAUA,GAAS0b,IAAUA,CAC1D,mBClCA,IAAIksB,EAAW,EAAQ,OACnBV,EAAiB,EAAQ,OA2C7B1rC,EAAOC,QAZP,SAAcoO,EAAO7J,EAAO05B,EAAOC,GACjC,IAAIl9B,EAAkB,MAAToN,EAAgB,EAAIA,EAAMpN,OACvC,OAAKA,GAGDi9B,GAAyB,iBAATA,GAAqBwN,EAAer9B,EAAO7J,EAAO05B,KACpEA,EAAQ,EACRC,EAAMl9B,GAEDmrC,EAAS/9B,EAAO7J,EAAO05B,EAAOC,IAN5B,EAOX,mBC1CA,IAAIW,EAAgB,EAAQ,MACxBkN,EAAe,EAAQ,OACvBhO,EAAY,EAAQ,OAGpBwM,EAAYhlB,KAAKilB,IAiDrBzqC,EAAOC,QAZP,SAAmBoO,EAAOgH,EAAW+oB,GACnC,IAAIn9B,EAAkB,MAAToN,EAAgB,EAAIA,EAAMpN,OACvC,IAAKA,EACH,OAAQ,EAEV,IAAImC,EAAqB,MAAbg7B,EAAoB,EAAIJ,EAAUI,GAI9C,OAHIh7B,EAAQ,IACVA,EAAQonC,EAAUvpC,EAASmC,EAAO,IAE7B07B,EAAczwB,EAAO29B,EAAa32B,EAAW,GAAIjS,EAC1D,mBCpDA,IAAI07B,EAAgB,EAAQ,MACxBkN,EAAe,EAAQ,OACvBhO,EAAY,EAAQ,OAGpBwM,EAAYhlB,KAAKilB,IACjBxL,EAAYzZ,KAAKC,IAoDrBzlB,EAAOC,QAfP,SAAuBoO,EAAOgH,EAAW+oB,GACvC,IAAIn9B,EAAkB,MAAToN,EAAgB,EAAIA,EAAMpN,OACvC,IAAKA,EACH,OAAQ,EAEV,IAAImC,EAAQnC,EAAS,EAOrB,YANkBtB,IAAdy+B,IACFh7B,EAAQ46B,EAAUI,GAClBh7B,EAAQg7B,EAAY,EAChBoM,EAAUvpC,EAASmC,EAAO,GAC1B67B,EAAU77B,EAAOnC,EAAS,IAEzB69B,EAAczwB,EAAO29B,EAAa32B,EAAW,GAAIjS,GAAO,EACjE,mBCxDApD,EAAOC,QAAU,EAAjB,sBCAA,IAAIu+B,EAAc,EAAQ,OAqB1Bx+B,EAAOC,QALP,SAAiBoO,GAEf,OADsB,MAATA,EAAgB,EAAIA,EAAMpN,QACvBu9B,EAAYnwB,EAAO,GAAK,EAC1C,kBCnBA,IAAImwB,EAAc,EAAQ,OAGtB6N,EAAW,IAqBfrsC,EAAOC,QALP,SAAqBoO,GAEnB,OADsB,MAATA,EAAgB,EAAIA,EAAMpN,QACvBu9B,EAAYnwB,EAAOg+B,GAAY,EACjD,mBCtBA,IAAI7N,EAAc,EAAQ,OACtBR,EAAY,EAAQ,OA+BxBh+B,EAAOC,QATP,SAAsBoO,EAAOwH,GAE3B,OADsB,MAATxH,EAAgB,EAAIA,EAAMpN,SAIvC4U,OAAkBlW,IAAVkW,EAAsB,EAAImoB,EAAUnoB,GACrC2oB,EAAYnwB,EAAOwH,IAHjB,EAIX,aCHA7V,EAAOC,QAZP,SAAmB+qC,GAKjB,IAJA,IAAI5nC,GAAS,EACTnC,EAAkB,MAAT+pC,EAAgB,EAAIA,EAAM/pC,OACnC2S,EAAS,CAAC,IAELxQ,EAAQnC,GAAQ,CACvB,IAAIqrC,EAAOtB,EAAM5nC,GACjBwQ,EAAO04B,EAAK,IAAMA,EAAK,EACzB,CACA,OAAO14B,CACT,mBCzBA,IAAIkvB,EAAU,EAAQ,OAgCtB9iC,EAAOC,QALP,SAAa2gB,EAAQhT,EAAM2+B,GACzB,IAAI34B,EAAmB,MAAVgN,OAAiBjhB,EAAYmjC,EAAQliB,EAAQhT,GAC1D,YAAkBjO,IAAXiU,EAAuB24B,EAAe34B,CAC/C,mBC9BA,IAAI44B,EAAY,EAAQ,OACpBC,EAAU,EAAQ,OAgCtBzsC,EAAOC,QAJP,SAAe2gB,EAAQhT,GACrB,OAAiB,MAAVgT,GAAkB6rB,EAAQ7rB,EAAQhT,EAAM4+B,EACjD,WCTAxsC,EAAOC,QAJP,SAAcoO,GACZ,OAAQA,GAASA,EAAMpN,OAAUoN,EAAM,QAAK1O,CAC9C,aCAAK,EAAOC,QAJP,SAAkBuE,GAChB,OAAOA,CACT,mBClBA,IAAIy3B,EAAc,EAAQ,OACtB+B,EAAY,EAAQ,OAGpBwM,EAAYhlB,KAAKilB,IAqCrBzqC,EAAOC,QAZP,SAAiBoO,EAAO7J,EAAO45B,GAC7B,IAAIn9B,EAAkB,MAAToN,EAAgB,EAAIA,EAAMpN,OACvC,IAAKA,EACH,OAAQ,EAEV,IAAImC,EAAqB,MAAbg7B,EAAoB,EAAIJ,EAAUI,GAI9C,OAHIh7B,EAAQ,IACVA,EAAQonC,EAAUvpC,EAASmC,EAAO,IAE7B64B,EAAY5tB,EAAO7J,EAAOpB,EACnC,mBCvCA,IAAI+hC,EAAY,EAAQ,OAqBxBnlC,EAAOC,QALP,SAAiBoO,GAEf,OADsB,MAATA,EAAgB,EAAIA,EAAMpN,QACvBkkC,EAAU92B,EAAO,GAAI,GAAK,EAC5C,kBCnBA,IAAIkvB,EAAW,EAAQ,OACnBmP,EAAmB,EAAQ,OAC3BZ,EAAW,EAAQ,OACnBa,EAAsB,EAAQ,MAmB9BxmC,EAAe2lC,GAAS,SAAS5M,GACnC,IAAI0N,EAASrP,EAAS2B,EAAQyN,GAC9B,OAAQC,EAAO3rC,QAAU2rC,EAAO,KAAO1N,EAAO,GAC1CwN,EAAiBE,GACjB,EACN,IAEA5sC,EAAOC,QAAUkG,mBC7BjB,IAAIo3B,EAAW,EAAQ,OACnBmP,EAAmB,EAAQ,OAC3BV,EAAe,EAAQ,OACvBF,EAAW,EAAQ,OACnBa,EAAsB,EAAQ,MAC9BzH,EAAO,EAAQ,OAyBf2H,EAAiBf,GAAS,SAAS5M,GACrC,IAAIve,EAAWukB,EAAKhG,GAChB0N,EAASrP,EAAS2B,EAAQyN,GAO9B,OALIhsB,IAAaukB,EAAK0H,GACpBjsB,OAAWhhB,EAEXitC,EAAOjlB,MAEDilB,EAAO3rC,QAAU2rC,EAAO,KAAO1N,EAAO,GAC1CwN,EAAiBE,EAAQZ,EAAarrB,EAAU,IAChD,EACN,IAEA3gB,EAAOC,QAAU4sC,mBC5CjB,IAAItP,EAAW,EAAQ,OACnBmP,EAAmB,EAAQ,OAC3BZ,EAAW,EAAQ,OACnBa,EAAsB,EAAQ,MAC9BzH,EAAO,EAAQ,OAuBf4H,EAAmBhB,GAAS,SAAS5M,GACvC,IAAI1gB,EAAa0mB,EAAKhG,GAClB0N,EAASrP,EAAS2B,EAAQyN,GAM9B,OAJAnuB,EAAkC,mBAAdA,EAA2BA,OAAa7e,IAE1DitC,EAAOjlB,MAEDilB,EAAO3rC,QAAU2rC,EAAO,KAAO1N,EAAO,GAC1CwN,EAAiBE,OAAQjtC,EAAW6e,GACpC,EACN,IAEAxe,EAAOC,QAAU6sC,mBCxCjB,IAAIC,EAAkB,EAAQ,OAC1BrN,EAAe,EAAQ,OAGvBkC,EAAct8B,OAAOpF,UAGrBwf,EAAiBkiB,EAAYliB,eAG7B2D,EAAuBue,EAAYve,qBAoBnC8Y,EAAc4Q,EAAgB,WAAa,OAAO7rC,SAAW,CAA/B,IAAsC6rC,EAAkB,SAASvoC,GACjG,OAAOk7B,EAAal7B,IAAUkb,EAAepe,KAAKkD,EAAO,YACtD6e,EAAqB/hB,KAAKkD,EAAO,SACtC,EAEAxE,EAAOC,QAAUk8B,mBCnCjB,IAAIv8B,EAAa,EAAQ,MACrBoiC,EAAW,EAAQ,OA+BvBhiC,EAAOC,QAJP,SAAqBuE,GACnB,OAAgB,MAATA,GAAiBw9B,EAASx9B,EAAMvD,UAAYrB,EAAW4E,EAChE,mBC9BA,IAAI0kC,EAAc,EAAQ,OACtBxJ,EAAe,EAAQ,OA+B3B1/B,EAAOC,QAJP,SAA2BuE,GACzB,OAAOk7B,EAAal7B,IAAU0kC,EAAY1kC,EAC5C,6BC9BA,IAAIyQ,EAAO,EAAQ,MACf+3B,EAAY,EAAQ,OAGpBlD,EAA4C7pC,IAAYA,EAAQ8pC,UAAY9pC,EAG5E+pC,EAAaF,GAA4C9pC,IAAWA,EAAO+pC,UAAY/pC,EAMvFitC,EAHgBjD,GAAcA,EAAW/pC,UAAY6pC,EAG5B70B,EAAKg4B,YAASttC,EAsBvCy8B,GAnBiB6Q,EAASA,EAAO7Q,cAAWz8B,IAmBfqtC,EAEjChtC,EAAOC,QAAUm8B,kBCrCjB,IAAIqD,EAAa,EAAQ,OACrB3/B,EAAW,EAAQ,OAmCvBE,EAAOC,QAVP,SAAoBuE,GAClB,IAAK1E,EAAS0E,GACZ,OAAO,EAIT,IAAIgI,EAAMizB,EAAWj7B,GACrB,MA5BY,qBA4BLgI,GA3BI,8BA2BcA,GA7BZ,0BA6B6BA,GA1B7B,kBA0BgDA,CAC/D,aCAAxM,EAAOC,QALP,SAAkBuE,GAChB,MAAuB,iBAATA,GACZA,GAAS,GAAKA,EAAQ,GAAK,GAAKA,GA9Bb,gBA+BvB,aCFAxE,EAAOC,QALP,SAAkBuE,GAChB,IAAI/D,SAAc+D,EAClB,OAAgB,MAATA,IAA0B,UAAR/D,GAA4B,YAARA,EAC/C,mBC5BA,IAAIg/B,EAAa,EAAQ,OACrBC,EAAe,EAAQ,OA2B3B1/B,EAAOC,QALP,SAAkBuE,GAChB,MAAuB,iBAATA,GACXk7B,EAAal7B,IArBF,mBAqBYi7B,EAAWj7B,EACvC,mBC1BA,IAAI0oC,EAAmB,EAAQ,MAC3B1P,EAAY,EAAQ,OACpB2M,EAAW,EAAQ,OAGnBgD,EAAmBhD,GAAYA,EAAS7N,aAmBxCA,EAAe6Q,EAAmB3P,EAAU2P,GAAoBD,EAEpEltC,EAAOC,QAAUq8B,aCzBjB,IAGI8Q,EAHa7rC,MAAMrB,UAGKghB,KAqB5BlhB,EAAOC,QAJP,SAAcoO,EAAOd,GACnB,OAAgB,MAATc,EAAgB,GAAK++B,EAAW9rC,KAAK+M,EAAOd,EACrD,mBCvBA,IAAI8/B,EAAgB,EAAQ,OACxBC,EAAW,EAAQ,OACnBpE,EAAc,EAAQ,OAkC1BlpC,EAAOC,QAJP,SAAc2gB,GACZ,OAAOsoB,EAAYtoB,GAAUysB,EAAczsB,GAAU0sB,EAAS1sB,EAChE,aCfA5gB,EAAOC,QALP,SAAcoO,GACZ,IAAIpN,EAAkB,MAAToN,EAAgB,EAAIA,EAAMpN,OACvC,OAAOA,EAASoN,EAAMpN,EAAS,QAAKtB,CACtC,mBCjBA,IAAIm/B,EAAgB,EAAQ,MACxBC,EAAY,EAAQ,OACpBwO,EAAoB,EAAQ,OAC5BvP,EAAY,EAAQ,OAGpBwM,EAAYhlB,KAAKilB,IACjBxL,EAAYzZ,KAAKC,IAsCrBzlB,EAAOC,QAfP,SAAqBoO,EAAO7J,EAAO45B,GACjC,IAAIn9B,EAAkB,MAAToN,EAAgB,EAAIA,EAAMpN,OACvC,IAAKA,EACH,OAAQ,EAEV,IAAImC,EAAQnC,EAKZ,YAJkBtB,IAAdy+B,IAEFh7B,GADAA,EAAQ46B,EAAUI,IACF,EAAIoM,EAAUvpC,EAASmC,EAAO,GAAK67B,EAAU77B,EAAOnC,EAAS,IAExEuD,IAAUA,EACb+oC,EAAkBl/B,EAAO7J,EAAOpB,GAChC07B,EAAczwB,EAAO0wB,EAAW37B,GAAO,EAC7C,mBC3CA,IAAI23B,EAAW,EAAQ,OAiDvB,SAAS4O,EAAQ7N,EAAM0R,GACrB,GAAmB,mBAAR1R,GAAmC,MAAZ0R,GAAuC,mBAAZA,EAC3D,MAAM,IAAIjtC,UAhDQ,uBAkDpB,IAAIktC,EAAW,WACb,IAAI5sC,EAAOK,UACPyB,EAAM6qC,EAAWA,EAAS/rC,MAAMjC,KAAMqB,GAAQA,EAAK,GACnD2+B,EAAQiO,EAASjO,MAErB,GAAIA,EAAMtF,IAAIv3B,GACZ,OAAO68B,EAAMhb,IAAI7hB,GAEnB,IAAIiR,EAASkoB,EAAKr6B,MAAMjC,KAAMqB,GAE9B,OADA4sC,EAASjO,MAAQA,EAAM7a,IAAIhiB,EAAKiR,IAAW4rB,EACpC5rB,CACT,EAEA,OADA65B,EAASjO,MAAQ,IAAKmK,EAAQ+D,OAAS3S,GAChC0S,CACT,CAGA9D,EAAQ+D,MAAQ3S,EAEhB/6B,EAAOC,QAAU0pC,aCxDjB3pC,EAAOC,QAJP,WAEA,mBCdA,IAAI0tC,EAAU,EAAQ,OAClB3P,EAAY,EAAQ,OA2BxBh+B,EAAOC,QAJP,SAAaoO,EAAOhO,GAClB,OAAQgO,GAASA,EAAMpN,OAAU0sC,EAAQt/B,EAAO2vB,EAAU39B,SAAMV,CAClE,mBC1BA,IAAIiuC,EAAe,EAAQ,OACvBC,EAAmB,EAAQ,OAC3BjL,EAAQ,EAAQ,OAChBjE,EAAQ,EAAQ,OA4BpB3+B,EAAOC,QAJP,SAAkB2N,GAChB,OAAOg1B,EAAMh1B,GAAQggC,EAAajP,EAAM/wB,IAASigC,EAAiBjgC,EACpE,mBC7BA,IA0BIkgC,EA1BW,EAAQ,MA0BZhC,CAzBG,EAAQ,QA2BtB9rC,EAAOC,QAAU6tC,mBC5BjB,IAAIC,EAAc,EAAQ,OA4B1B/tC,EAAOC,QANP,SAAiBoO,EAAO3I,GACtB,OAAQ2I,GAASA,EAAMpN,QAAUyE,GAAUA,EAAOzE,OAC9C8sC,EAAY1/B,EAAO3I,GACnB2I,CACN,mBC1BA,IAAI29B,EAAe,EAAQ,OACvB+B,EAAc,EAAQ,OA+B1B/tC,EAAOC,QANP,SAAmBoO,EAAO3I,EAAQib,GAChC,OAAQtS,GAASA,EAAMpN,QAAUyE,GAAUA,EAAOzE,OAC9C8sC,EAAY1/B,EAAO3I,EAAQsmC,EAAarrB,EAAU,IAClDtS,CACN,mBC9BA,IAAI0/B,EAAc,EAAQ,OA+B1B/tC,EAAOC,QANP,SAAqBoO,EAAO3I,EAAQ8Y,GAClC,OAAQnQ,GAASA,EAAMpN,QAAUyE,GAAUA,EAAOzE,OAC9C8sC,EAAY1/B,EAAO3I,OAAQ/F,EAAW6e,GACtCnQ,CACN,mBC7BA,IAAIkvB,EAAW,EAAQ,OACnByQ,EAAS,EAAQ,OACjBC,EAAa,EAAQ,OACrBhuB,EAAmB,EAAQ,OAC3BiuB,EAAW,EAAQ,OACnB7R,EAAU,EAAQ,OA0BlB8R,EAASD,GAAS,SAAS7/B,EAAO60B,GACpC,IAAIjiC,EAAkB,MAAToN,EAAgB,EAAIA,EAAMpN,OACnC2S,EAASo6B,EAAO3/B,EAAO60B,GAM3B,OAJA+K,EAAW5/B,EAAOkvB,EAAS2F,GAAS,SAAS9/B,GAC3C,OAAOi5B,EAAQj5B,EAAOnC,IAAWmC,EAAQA,CAC3C,IAAGwL,KAAKqR,IAEDrM,CACT,IAEA5T,EAAOC,QAAUkuC,mBC1CjB,IAAInC,EAAe,EAAQ,OACvBiC,EAAa,EAAQ,OAmDzBjuC,EAAOC,QArBP,SAAgBoO,EAAOgH,GACrB,IAAIzB,EAAS,GACb,IAAMvF,IAASA,EAAMpN,OACnB,OAAO2S,EAET,IAAIxQ,GAAS,EACT8/B,EAAU,GACVjiC,EAASoN,EAAMpN,OAGnB,IADAoU,EAAY22B,EAAa32B,EAAW,KAC3BjS,EAAQnC,GAAQ,CACvB,IAAIuD,EAAQ6J,EAAMjL,GACdiS,EAAU7Q,EAAOpB,EAAOiL,KAC1BuF,EAAO9R,KAAK0C,GACZ0+B,EAAQphC,KAAKsB,GAEjB,CAEA,OADA6qC,EAAW5/B,EAAO60B,GACXtvB,CACT,aCjDA,IAGIw6B,EAHa7sC,MAAMrB,UAGQ+oB,QA6B/BjpB,EAAOC,QAJP,SAAiBoO,GACf,OAAgB,MAATA,EAAgBA,EAAQ+/B,EAAc9sC,KAAK+M,EACpD,mBC/BA,IAAI82B,EAAY,EAAQ,OACpBuG,EAAiB,EAAQ,OACzB1N,EAAY,EAAQ,OAkCxBh+B,EAAOC,QAhBP,SAAeoO,EAAO6vB,EAAOC,GAC3B,IAAIl9B,EAAkB,MAAToN,EAAgB,EAAIA,EAAMpN,OACvC,OAAKA,GAGDk9B,GAAqB,iBAAPA,GAAmBuN,EAAer9B,EAAO6vB,EAAOC,IAChED,EAAQ,EACRC,EAAMl9B,IAGNi9B,EAAiB,MAATA,EAAgB,EAAIF,EAAUE,GACtCC,OAAcx+B,IAARw+B,EAAoBl9B,EAAS+8B,EAAUG,IAExCgH,EAAU92B,EAAO6vB,EAAOC,IAVtB,EAWX,mBClCA,IAAIkQ,EAAkB,EAAQ,OAuB9BruC,EAAOC,QAJP,SAAqBoO,EAAO7J,GAC1B,OAAO6pC,EAAgBhgC,EAAO7J,EAChC,mBCrBA,IAAIwnC,EAAe,EAAQ,OACvBpI,EAAoB,EAAQ,OA+BhC5jC,EAAOC,QAJP,SAAuBoO,EAAO7J,EAAOmc,GACnC,OAAOijB,EAAkBv1B,EAAO7J,EAAOwnC,EAAarrB,EAAU,GAChE,mBC9BA,IAAI0tB,EAAkB,EAAQ,OAC1BtR,EAAK,EAAQ,OA6BjB/8B,EAAOC,QAXP,SAAuBoO,EAAO7J,GAC5B,IAAIvD,EAAkB,MAAToN,EAAgB,EAAIA,EAAMpN,OACvC,GAAIA,EAAQ,CACV,IAAImC,EAAQirC,EAAgBhgC,EAAO7J,GACnC,GAAIpB,EAAQnC,GAAU87B,EAAG1uB,EAAMjL,GAAQoB,GACrC,OAAOpB,CAEX,CACA,OAAQ,CACV,mBC5BA,IAAIirC,EAAkB,EAAQ,OAwB9BruC,EAAOC,QAJP,SAAyBoO,EAAO7J,GAC9B,OAAO6pC,EAAgBhgC,EAAO7J,GAAO,EACvC,mBCtBA,IAAIwnC,EAAe,EAAQ,OACvBpI,EAAoB,EAAQ,OA+BhC5jC,EAAOC,QAJP,SAA2BoO,EAAO7J,EAAOmc,GACvC,OAAOijB,EAAkBv1B,EAAO7J,EAAOwnC,EAAarrB,EAAU,IAAI,EACpE,mBC9BA,IAAI0tB,EAAkB,EAAQ,OAC1BtR,EAAK,EAAQ,OA6BjB/8B,EAAOC,QAXP,SAA2BoO,EAAO7J,GAEhC,GADsB,MAAT6J,EAAgB,EAAIA,EAAMpN,OAC3B,CACV,IAAImC,EAAQirC,EAAgBhgC,EAAO7J,GAAO,GAAQ,EAClD,GAAIu4B,EAAG1uB,EAAMjL,GAAQoB,GACnB,OAAOpB,CAEX,CACA,OAAQ,CACV,mBC5BA,IAAIkrC,EAAiB,EAAQ,OAuB7BtuC,EAAOC,QANP,SAAoBoO,GAClB,OAAQA,GAASA,EAAMpN,OACnBqtC,EAAejgC,GACf,EACN,mBCrBA,IAAI29B,EAAe,EAAQ,OACvBsC,EAAiB,EAAQ,OAwB7BtuC,EAAOC,QANP,SAAsBoO,EAAOsS,GAC3B,OAAQtS,GAASA,EAAMpN,OACnBqtC,EAAejgC,EAAO29B,EAAarrB,EAAU,IAC7C,EACN,aCDA3gB,EAAOC,QAJP,WACE,MAAO,EACT,aCHAD,EAAOC,QAJP,WACE,OAAO,CACT,mBCfA,IAAIklC,EAAY,EAAQ,OAqBxBnlC,EAAOC,QALP,SAAcoO,GACZ,IAAIpN,EAAkB,MAAToN,EAAgB,EAAIA,EAAMpN,OACvC,OAAOA,EAASkkC,EAAU92B,EAAO,EAAGpN,GAAU,EAChD,mBCnBA,IAAIkkC,EAAY,EAAQ,OACpBnH,EAAY,EAAQ,OAmCxBh+B,EAAOC,QARP,SAAcoO,EAAOhO,EAAGwrC,GACtB,OAAMx9B,GAASA,EAAMpN,QAGrBZ,EAAKwrC,QAAelsC,IAANU,EAAmB,EAAI29B,EAAU39B,GACxC8kC,EAAU92B,EAAO,EAAGhO,EAAI,EAAI,EAAIA,IAH9B,EAIX,mBClCA,IAAI8kC,EAAY,EAAQ,OACpBnH,EAAY,EAAQ,OAqCxBh+B,EAAOC,QAVP,SAAmBoO,EAAOhO,EAAGwrC,GAC3B,IAAI5qC,EAAkB,MAAToN,EAAgB,EAAIA,EAAMpN,OACvC,OAAKA,GAGLZ,EAAKwrC,QAAelsC,IAANU,EAAmB,EAAI29B,EAAU39B,GAExC8kC,EAAU92B,GADjBhO,EAAIY,EAASZ,GACe,EAAI,EAAIA,EAAGY,IAJ9B,EAKX,kBCpCA,IAAI+qC,EAAe,EAAQ,OACvBG,EAAY,EAAQ,OA2CxBnsC,EAAOC,QANP,SAAwBoO,EAAOgH,GAC7B,OAAQhH,GAASA,EAAMpN,OACnBkrC,EAAU99B,EAAO29B,EAAa32B,EAAW,IAAI,GAAO,GACpD,EACN,mBC1CA,IAAI22B,EAAe,EAAQ,OACvBG,EAAY,EAAQ,OA2CxBnsC,EAAOC,QANP,SAAmBoO,EAAOgH,GACxB,OAAQhH,GAASA,EAAMpN,OACnBkrC,EAAU99B,EAAO29B,EAAa32B,EAAW,IACzC,EACN,mBC1CA,IAAIk5B,EAAW,EAAQ,OAGnBlC,EAAW,IAsCfrsC,EAAOC,QAZP,SAAkBuE,GAChB,OAAKA,GAGLA,EAAQ+pC,EAAS/pC,MACH6nC,GAAY7nC,KAAU,IA9BpB,uBA+BFA,EAAQ,GAAK,EAAI,GAGxBA,IAAUA,EAAQA,EAAQ,EAPd,IAAVA,EAAcA,EAAQ,CAQjC,mBCvCA,IAAIgqC,EAAW,EAAQ,OAmCvBxuC,EAAOC,QAPP,SAAmBuE,GACjB,IAAIoP,EAAS46B,EAAShqC,GAClBiqC,EAAY76B,EAAS,EAEzB,OAAOA,IAAWA,EAAU66B,EAAY76B,EAAS66B,EAAY76B,EAAU,CACzE,mBCjCA,IAAI86B,EAAY,EAAQ,OACpB1Q,EAAY,EAAQ,OAoCxBh+B,EAAOC,QAJP,SAAkBuE,GAChB,OAAOA,EAAQkqC,EAAU1Q,EAAUx5B,GAAQ,EA9BtB,YA8B6C,CACpE,mBCnCA,IAAImqC,EAAW,EAAQ,OACnB7uC,EAAW,EAAQ,OACnB+jC,EAAW,EAAQ,OAMnB+K,EAAa,qBAGbC,EAAa,aAGbC,EAAY,cAGZC,EAAe3e,SA8CnBpwB,EAAOC,QArBP,SAAkBuE,GAChB,GAAoB,iBAATA,EACT,OAAOA,EAET,GAAIq/B,EAASr/B,GACX,OA1CM,IA4CR,GAAI1E,EAAS0E,GAAQ,CACnB,IAAI0b,EAAgC,mBAAjB1b,EAAMiiC,QAAwBjiC,EAAMiiC,UAAYjiC,EACnEA,EAAQ1E,EAASogB,GAAUA,EAAQ,GAAMA,CAC3C,CACA,GAAoB,iBAAT1b,EACT,OAAiB,IAAVA,EAAcA,GAASA,EAEhCA,EAAQmqC,EAASnqC,GACjB,IAAIwqC,EAAWH,EAAW/rB,KAAKte,GAC/B,OAAQwqC,GAAYF,EAAUhsB,KAAKte,GAC/BuqC,EAAavqC,EAAMhD,MAAM,GAAIwtC,EAAW,EAAI,GAC3CJ,EAAW9rB,KAAKte,GAvDb,KAuD6BA,CACvC,mBC7DA,IAAIogC,EAAe,EAAQ,OA2B3B5kC,EAAOC,QAJP,SAAkBuE,GAChB,OAAgB,MAATA,EAAgB,GAAKogC,EAAapgC,EAC3C,mBCzBA,IAAIg6B,EAAc,EAAQ,OACtBsN,EAAW,EAAQ,OACnBxG,EAAW,EAAQ,OACnBI,EAAoB,EAAQ,OAkB5BuJ,EAAQnD,GAAS,SAAS5M,GAC5B,OAAOoG,EAAS9G,EAAYU,EAAQ,EAAGwG,GAAmB,GAC5D,IAEA1lC,EAAOC,QAAUgvC,mBCzBjB,IAAIzQ,EAAc,EAAQ,OACtBwN,EAAe,EAAQ,OACvBF,EAAW,EAAQ,OACnBxG,EAAW,EAAQ,OACnBI,EAAoB,EAAQ,OAC5BR,EAAO,EAAQ,OAyBfgK,EAAUpD,GAAS,SAAS5M,GAC9B,IAAIve,EAAWukB,EAAKhG,GAIpB,OAHIwG,EAAkB/kB,KACpBA,OAAWhhB,GAEN2lC,EAAS9G,EAAYU,EAAQ,EAAGwG,GAAmB,GAAOsG,EAAarrB,EAAU,GAC1F,IAEA3gB,EAAOC,QAAUivC,mBCtCjB,IAAI1Q,EAAc,EAAQ,OACtBsN,EAAW,EAAQ,OACnBxG,EAAW,EAAQ,OACnBI,EAAoB,EAAQ,OAC5BR,EAAO,EAAQ,OAuBfiK,EAAYrD,GAAS,SAAS5M,GAChC,IAAI1gB,EAAa0mB,EAAKhG,GAEtB,OADA1gB,EAAkC,mBAAdA,EAA2BA,OAAa7e,EACrD2lC,EAAS9G,EAAYU,EAAQ,EAAGwG,GAAmB,QAAO/lC,EAAW6e,EAC9E,IAEAxe,EAAOC,QAAUkvC,mBCjCjB,IAAI7J,EAAW,EAAQ,OAwBvBtlC,EAAOC,QAJP,SAAcoO,GACZ,OAAQA,GAASA,EAAMpN,OAAUqkC,EAASj3B,GAAS,EACrD,mBCtBA,IAAI29B,EAAe,EAAQ,OACvB1G,EAAW,EAAQ,OA6BvBtlC,EAAOC,QAJP,SAAgBoO,EAAOsS,GACrB,OAAQtS,GAASA,EAAMpN,OAAUqkC,EAASj3B,EAAO29B,EAAarrB,EAAU,IAAM,EAChF,kBC5BA,IAAI2kB,EAAW,EAAQ,OA2BvBtlC,EAAOC,QALP,SAAkBoO,EAAOmQ,GAEvB,OADAA,EAAkC,mBAAdA,EAA2BA,OAAa7e,EACpD0O,GAASA,EAAMpN,OAAUqkC,EAASj3B,OAAO1O,EAAW6e,GAAc,EAC5E,mBCzBA,IAAIopB,EAAc,EAAQ,OACtBrK,EAAW,EAAQ,OACnBqQ,EAAe,EAAQ,OACvB1R,EAAY,EAAQ,OACpBwJ,EAAoB,EAAQ,OAG5B8E,EAAYhlB,KAAKilB,IAqCrBzqC,EAAOC,QAhBP,SAAeoO,GACb,IAAMA,IAASA,EAAMpN,OACnB,MAAO,GAET,IAAIA,EAAS,EAOb,OANAoN,EAAQu5B,EAAYv5B,GAAO,SAAS+gC,GAClC,GAAI1J,EAAkB0J,GAEpB,OADAnuC,EAASupC,EAAU4E,EAAMnuC,OAAQA,IAC1B,CAEX,IACOi7B,EAAUj7B,GAAQ,SAASmC,GAChC,OAAOm6B,EAASlvB,EAAOu/B,EAAaxqC,GACtC,GACF,mBC1CA,IAAI3B,EAAQ,EAAQ,OAChB87B,EAAW,EAAQ,OACnB8R,EAAQ,EAAQ,OAoCpBrvC,EAAOC,QAbP,SAAmBoO,EAAOsS,GACxB,IAAMtS,IAASA,EAAMpN,OACnB,MAAO,GAET,IAAI2S,EAASy7B,EAAMhhC,GACnB,OAAgB,MAAZsS,EACK/M,EAEF2pB,EAAS3pB,GAAQ,SAASw7B,GAC/B,OAAO3tC,EAAMkf,OAAUhhB,EAAWyvC,EACpC,GACF,mBCpCA,IAAI/J,EAAiB,EAAQ,OACzByG,EAAW,EAAQ,OACnBpG,EAAoB,EAAQ,OAsB5B4J,EAAUxD,GAAS,SAASz9B,EAAO3I,GACrC,OAAOggC,EAAkBr3B,GACrBg3B,EAAeh3B,EAAO3I,GACtB,EACN,IAEA1F,EAAOC,QAAUqvC,mBC9BjB,IAAI1H,EAAc,EAAQ,OACtBkE,EAAW,EAAQ,OACnByD,EAAU,EAAQ,OAClB7J,EAAoB,EAAQ,OAoB5B8J,EAAM1D,GAAS,SAAS5M,GAC1B,OAAOqQ,EAAQ3H,EAAY1I,EAAQwG,GACrC,IAEA1lC,EAAOC,QAAUuvC,mBC3BjB,IAAI5H,EAAc,EAAQ,OACtBoE,EAAe,EAAQ,OACvBF,EAAW,EAAQ,OACnByD,EAAU,EAAQ,OAClB7J,EAAoB,EAAQ,OAC5BR,EAAO,EAAQ,OAyBfuK,EAAQ3D,GAAS,SAAS5M,GAC5B,IAAIve,EAAWukB,EAAKhG,GAIpB,OAHIwG,EAAkB/kB,KACpBA,OAAWhhB,GAEN4vC,EAAQ3H,EAAY1I,EAAQwG,GAAoBsG,EAAarrB,EAAU,GAChF,IAEA3gB,EAAOC,QAAUwvC,mBCtCjB,IAAI7H,EAAc,EAAQ,OACtBkE,EAAW,EAAQ,OACnByD,EAAU,EAAQ,OAClB7J,EAAoB,EAAQ,OAC5BR,EAAO,EAAQ,OAuBfwK,EAAU5D,GAAS,SAAS5M,GAC9B,IAAI1gB,EAAa0mB,EAAKhG,GAEtB,OADA1gB,EAAkC,mBAAdA,EAA2BA,OAAa7e,EACrD4vC,EAAQ3H,EAAY1I,EAAQwG,QAAoB/lC,EAAW6e,EACpE,IAEAxe,EAAOC,QAAUyvC,mBCjCjB,IAmBIC,EAnBW,EAAQ,MAmBb7D,CAlBE,EAAQ,QAoBpB9rC,EAAOC,QAAU0vC,mBCrBjB,IAAIrM,EAAc,EAAQ,OACtBsM,EAAgB,EAAQ,OAsB5B5vC,EAAOC,QAJP,SAAmBslC,EAAO7/B,GACxB,OAAOkqC,EAAcrK,GAAS,GAAI7/B,GAAU,GAAI49B,EAClD,mBCrBA,IAAIuM,EAAU,EAAQ,OAClBD,EAAgB,EAAQ,OAqB5B5vC,EAAOC,QAJP,SAAuBslC,EAAO7/B,GAC5B,OAAOkqC,EAAcrK,GAAS,GAAI7/B,GAAU,GAAImqC,EAClD,mBCpBA,IAAI/D,EAAW,EAAQ,OACnBgE,EAAY,EAAQ,OAsBpBC,EAAUjE,GAAS,SAAS5M,GAC9B,IAAIj+B,EAASi+B,EAAOj+B,OAChB0f,EAAW1f,EAAS,EAAIi+B,EAAOj+B,EAAS,QAAKtB,EAGjD,OADAghB,EAA8B,mBAAZA,GAA0Bue,EAAOvX,MAAOhH,QAAYhhB,EAC/DmwC,EAAU5Q,EAAQve,EAC3B,IAEA3gB,EAAOC,QAAU8vC,qBCzBb/vC,EAAOC,QAUF,WAGP,IAAI+vC,EAAc,GACdC,EAAgB,GAChBC,EAAe,CAAC,EAChBC,EAAmB,CAAC,EACpBC,EAAmB,CAAC,EAQxB,SAASC,EAAcC,GACrB,MAAoB,kBAATA,EACF,IAAIvO,OAAO,IAAMuO,EAAO,IAAK,KAG/BA,CACT,CAUA,SAASC,EAAaC,EAAMC,GAE1B,OAAID,IAASC,EAAcA,EAGvBD,IAASA,EAAK/oB,cAAsBgpB,EAAMhpB,cAG1C+oB,IAASA,EAAKE,cAAsBD,EAAMC,cAG1CF,EAAK,KAAOA,EAAK,GAAGE,cACfD,EAAM5mB,OAAO,GAAG6mB,cAAgBD,EAAM3mB,OAAO,GAAGrC,cAIlDgpB,EAAMhpB,aACf,CASA,SAASkpB,EAAaC,EAAK/vC,GACzB,OAAO+vC,EAAIp7B,QAAQ,gBAAgB,SAAU81B,EAAOloC,GAClD,OAAOvC,EAAKuC,IAAU,EACxB,GACF,CASA,SAASoS,EAASg7B,EAAMF,GACtB,OAAOE,EAAKh7B,QAAQ86B,EAAK,IAAI,SAAUhF,EAAOloC,GAC5C,IAAIwQ,EAAS+8B,EAAYL,EAAK,GAAIpvC,WAElC,OACSqvC,EADK,KAAVjF,EACiBkF,EAAKptC,EAAQ,GAGfkoC,EAHmB13B,EAIxC,GACF,CAUA,SAASi9B,EAAcJ,EAAOD,EAAMM,GAElC,IAAKL,EAAMxvC,QAAUivC,EAAaxwB,eAAe+wB,GAC/C,OAAOD,EAMT,IAHA,IAAI5vC,EAAMkwC,EAAM7vC,OAGTL,KAAO,CACZ,IAAI0vC,EAAOQ,EAAMlwC,GAEjB,GAAI0vC,EAAK,GAAGxtB,KAAK0tB,GAAO,OAAOh7B,EAAQg7B,EAAMF,EAC/C,CAEA,OAAOE,CACT,CAUA,SAASO,EAAaC,EAAYC,EAASH,GACzC,OAAO,SAAUN,GAEf,IAAIC,EAAQD,EAAK/oB,cAGjB,OAAIwpB,EAAQvxB,eAAe+wB,GAClBF,EAAYC,EAAMC,GAIvBO,EAAWtxB,eAAe+wB,GACrBF,EAAYC,EAAMQ,EAAWP,IAI/BI,EAAaJ,EAAOD,EAAMM,EACnC,CACF,CAKA,SAASI,EAAWF,EAAYC,EAASH,EAAOK,GAC9C,OAAO,SAAUX,GACf,IAAIC,EAAQD,EAAK/oB,cAEjB,QAAIwpB,EAAQvxB,eAAe+wB,KACvBO,EAAWtxB,eAAe+wB,IAEvBI,EAAaJ,EAAOA,EAAOK,KAAWL,CAC/C,CACF,CAUA,SAASW,EAAWZ,EAAMl+B,EAAO++B,GAI/B,OAAQA,EAAY/+B,EAAQ,IAAM,KAHP,IAAVA,EACb8+B,EAAUE,SAASd,GAAQY,EAAUG,OAAOf,GAGlD,CAkUA,OA3TAY,EAAUG,OAASR,EACjBX,EAAkBD,EAAkBH,GAQtCoB,EAAUI,SAAWN,EACnBd,EAAkBD,EAAkBH,GAQtCoB,EAAUE,SAAWP,EACnBZ,EAAkBC,EAAkBH,GAQtCmB,EAAUK,WAAaP,EACrBf,EAAkBC,EAAkBH,GAStCmB,EAAUM,cAAgB,SAAUpB,EAAMqB,GACxC3B,EAAYluC,KAAK,CAACuuC,EAAaC,GAAOqB,GACxC,EAQAP,EAAUQ,gBAAkB,SAAUtB,EAAMqB,GAC1C1B,EAAcnuC,KAAK,CAACuuC,EAAaC,GAAOqB,GAC1C,EAOAP,EAAUS,mBAAqB,SAAUrB,GACnB,kBAATA,GAMXY,EAAUM,cAAclB,EAAM,MAC9BY,EAAUQ,gBAAgBpB,EAAM,OAN9BN,EAAaM,EAAK/oB,gBAAiB,CAOvC,EAQA2pB,EAAUU,iBAAmB,SAAUC,EAAQR,GAC7CA,EAASA,EAAO9pB,cAChBsqB,EAASA,EAAOtqB,cAEhB2oB,EAAiB2B,GAAUR,EAC3BpB,EAAiBoB,GAAUQ,CAC7B,EAKA,CAEE,CAAC,IAAK,MACN,CAAC,KAAM,MACP,CAAC,KAAM,QACP,CAAC,MAAO,QACR,CAAC,OAAQ,QACT,CAAC,SAAU,aACX,CAAC,WAAY,cACb,CAAC,SAAU,cACX,CAAC,UAAW,cACZ,CAAC,UAAW,cACZ,CAAC,WAAY,cACb,CAAC,KAAM,OACP,CAAC,MAAO,QACR,CAAC,MAAO,QACR,CAAC,OAAQ,SACT,CAAC,OAAQ,SAET,CAAC,OAAQ,UACT,CAAC,QAAS,WACV,CAAC,UAAW,aACZ,CAAC,UAAW,aACZ,CAAC,UAAW,aAEZ,CAAC,QAAS,UACV,CAAC,SAAU,WAEX,CAAC,SAAU,YACX,CAAC,QAAS,WACV,CAAC,QAAS,WACV,CAAC,QAAS,WACV,CAAC,SAAU,YACX,CAAC,WAAY,cAEb,CAAC,KAAM,QACP,CAAC,MAAO,QACR,CAAC,MAAO,QACR,CAAC,MAAO,SACR,CAAC,OAAQ,QACT,CAAC,OAAQ,SACT,CAAC,QAAS,SACV,CAAC,QAAS,SACV,CAAC,OAAQ,WACT,CAAC,QAAS,UACV,CAAC,QAAS,UACV,CAAC,QAAS,UACV,CAAC,QAAS,UACV,CAAC,QAAS,UACV,CAAC,QAAS,WACV,CAAC,SAAU,WACX,CAAC,UAAW,YACZ,CAAC,WAAY,cACblqC,SAAQ,SAAUyoC,GAClB,OAAOc,EAAUU,iBAAiBxB,EAAK,GAAIA,EAAK,GAClD,IAKA,CACE,CAAC,OAAQ,KACT,CAAC,qBAAsB,MACvB,CAAC,kBAAmB,MACpB,CAAC,gBAAiB,QAClB,CAAC,qCAAsC,QACvC,CAAC,eAAgB,OACjB,CAAC,yCAA0C,MAC3C,CAAC,4FAA6F,OAC9F,CAAC,gCAAiC,QAClC,CAAC,2BAA4B,QAC7B,CAAC,iBAAkB,SACnB,CAAC,wHAAyH,OAC1H,CAAC,qGAAsG,OACvG,CAAC,QAAS,OACV,CAAC,2CAA4C,WAC7C,CAAC,oBAAqB,SACtB,CAAC,uBAAwB,SACzB,CAAC,oBAAqB,QACtB,CAAC,gDAAiD,UAClD,CAAC,gCAAiC,SAClC,CAAC,sBAAuB,UACxB,CAAC,oBAAqB,SACtB,CAAC,SAAU,MACX,CAAC,WAAY,OACb,CAAC,OAAQ,QACTzoC,SAAQ,SAAUyoC,GAClB,OAAOc,EAAUM,cAAcpB,EAAK,GAAIA,EAAK,GAC/C,IAKA,CACE,CAAC,MAAO,IACR,CAAC,SAAU,MACX,CAAC,gEAAiE,QAClE,CAAC,kCAAmC,OACpC,CAAC,QAAS,KACV,CAAC,uFAAwF,QACzF,CAAC,oBAAqB,QACtB,CAAC,uBAAwB,UACzB,CAAC,sBAAuB,MACxB,CAAC,2FAA4F,MAC7F,CAAC,qEAAsE,SACvE,CAAC,iCAAkC,MACnC,CAAC,oBAAqB,QACtB,CAAC,4FAA6F,QAC9F,CAAC,yGAA0G,QAC3G,CAAC,8FAA+F,QAChG,CAAC,0BAA2B,OAC5B,CAAC,+BAAgC,QACjC,CAAC,sBAAuB,QACxB,CAAC,oBAAqB,UACtB,CAAC,eAAgB,MACjB,CAAC,YAAa,MACd,CAAC,QAAS,QACVzoC,SAAQ,SAAUyoC,GAClB,OAAOc,EAAUQ,gBAAgBtB,EAAK,GAAIA,EAAK,GACjD,IAKA,CAEE,YACA,SACA,SACA,MACA,WACA,UACA,OACA,YACA,QACA,YACA,QACA,QACA,QACA,QACA,UACA,SACA,OACA,OACA,UACA,QACA,WACA,MACA,WACA,cACA,QACA,SACA,WACA,YACA,MACA,SACA,YACA,YACA,YACA,WACA,WACA,MACA,UACA,UACA,WACA,WACA,eACA,SACA,SACA,YACA,WACA,YACA,cACA,QACA,UACA,QACA,SACA,aACA,YACA,WACA,OACA,QACA,OACA,QACA,QACA,MACA,QACA,OACA,OACA,YACA,OACA,WACA,SACA,SACA,YACA,WACA,OACA,WACA,OACA,SACA,WACA,SACA,SACA,WACA,SACA,WACA,UACA,QACA,QACA,SACA,UACA,iBACA,QACA,OACA,SACA,UACA,UACA,aACA,WACA,MACA,kBAEA,gBACA,SACA,SACA,YACA,WACA,QACA,WACAzoC,QAAQupC,EAAUS,oBAEbT,CACT,CAhfqBA,cCJrB,IAAIY,EAAoC,qBAAZC,QACxBC,EAAwB,oBAARzX,IAChB0X,EAAwB,oBAARnX,IAChBoX,EAAwC,oBAAhB1J,eAAgCA,YAAY2J,OAIxE,SAASC,EAAM7rC,EAAGC,GAEhB,GAAID,IAAMC,EAAG,OAAO,EAEpB,GAAID,GAAKC,GAAiB,iBAALD,GAA6B,iBAALC,EAAe,CAC1D,GAAID,EAAEkD,cAAgBjD,EAAEiD,YAAa,OAAO,EAE5C,IAAI1I,EAAQH,EAAGyE,EA6BX0nB,EA5BJ,GAAI1rB,MAAMoF,QAAQF,GAAI,CAEpB,IADAxF,EAASwF,EAAExF,SACGyF,EAAEzF,OAAQ,OAAO,EAC/B,IAAKH,EAAIG,EAAgB,IAARH,KACf,IAAKwxC,EAAM7rC,EAAE3F,GAAI4F,EAAE5F,IAAK,OAAO,EACjC,OAAO,CACT,CAuBA,GAAIoxC,GAAWzrC,aAAag0B,KAAS/zB,aAAa+zB,IAAM,CACtD,GAAIh0B,EAAEk1B,OAASj1B,EAAEi1B,KAAM,OAAO,EAE9B,IADA1O,EAAKxmB,EAAE2d,YACEtjB,EAAImsB,EAAGxJ,QAAQC,UACjBhd,EAAEwzB,IAAIp5B,EAAE0D,MAAM,IAAK,OAAO,EAEjC,IADAyoB,EAAKxmB,EAAE2d,YACEtjB,EAAImsB,EAAGxJ,QAAQC,UACjB4uB,EAAMxxC,EAAE0D,MAAM,GAAIkC,EAAE8d,IAAI1jB,EAAE0D,MAAM,KAAM,OAAO,EACpD,OAAO,CACT,CAEA,GAAI2tC,GAAW1rC,aAAau0B,KAASt0B,aAAas0B,IAAM,CACtD,GAAIv0B,EAAEk1B,OAASj1B,EAAEi1B,KAAM,OAAO,EAE9B,IADA1O,EAAKxmB,EAAE2d,YACEtjB,EAAImsB,EAAGxJ,QAAQC,UACjBhd,EAAEwzB,IAAIp5B,EAAE0D,MAAM,IAAK,OAAO,EACjC,OAAO,CACT,CAGA,GAAI4tC,GAAkB1J,YAAY2J,OAAO5rC,IAAMiiC,YAAY2J,OAAO3rC,GAAI,CAEpE,IADAzF,EAASwF,EAAExF,SACGyF,EAAEzF,OAAQ,OAAO,EAC/B,IAAKH,EAAIG,EAAgB,IAARH,KACf,GAAI2F,EAAE3F,KAAO4F,EAAE5F,GAAI,OAAO,EAC5B,OAAO,CACT,CAEA,GAAI2F,EAAEkD,cAAgBo4B,OAAQ,OAAOt7B,EAAE6X,SAAW5X,EAAE4X,QAAU7X,EAAE8rC,QAAU7rC,EAAE6rC,MAK5E,GAAI9rC,EAAEggC,UAAYnhC,OAAOpF,UAAUumC,SAAgC,oBAAdhgC,EAAEggC,SAA+C,oBAAd//B,EAAE+/B,QAAwB,OAAOhgC,EAAEggC,YAAc//B,EAAE+/B,UAC3I,GAAIhgC,EAAE8J,WAAajL,OAAOpF,UAAUqQ,UAAkC,oBAAf9J,EAAE8J,UAAiD,oBAAf7J,EAAE6J,SAAyB,OAAO9J,EAAE8J,aAAe7J,EAAE6J,WAKhJ,IADAtP,GADAsE,EAAOD,OAAOC,KAAKkB,IACLxF,UACCqE,OAAOC,KAAKmB,GAAGzF,OAAQ,OAAO,EAE7C,IAAKH,EAAIG,EAAgB,IAARH,KACf,IAAKwE,OAAOpF,UAAUwf,eAAepe,KAAKoF,EAAGnB,EAAKzE,IAAK,OAAO,EAKhE,GAAIkxC,GAAkBvrC,aAAawrC,QAAS,OAAO,EAGnD,IAAKnxC,EAAIG,EAAgB,IAARH,KACf,IAAiB,WAAZyE,EAAKzE,IAA+B,QAAZyE,EAAKzE,IAA4B,QAAZyE,EAAKzE,KAAiB2F,EAAE+rC,YAarEF,EAAM7rC,EAAElB,EAAKzE,IAAK4F,EAAEnB,EAAKzE,KAAM,OAAO,EAK7C,OAAO,CACT,CAEA,OAAO2F,IAAMA,GAAKC,IAAMA,CAC1B,CAGA1G,EAAOC,QAAU,SAAiBwG,EAAGC,GACnC,IACE,OAAO4rC,EAAM7rC,EAAGC,EAClB,CAAE,MAAO1F,GACP,IAAMA,EAAM4mB,SAAW,IAAI0jB,MAAM,oBAO/B,OADAtpC,QAAQkF,KAAK,mDACN,EAGT,MAAMlG,CACR,CACF,wEC1IA,SAASyxC,EAAQ3yB,GAAkC,OAAO2yB,EAAU,mBAAqBnvB,QAAU,iBAAmBA,OAAOC,SAAW,SAAUzD,GAAO,cAAcA,CAAK,EAAI,SAAUA,GAAO,OAAOA,GAAO,mBAAqBwD,QAAUxD,EAAInW,cAAgB2Z,QAAUxD,IAAQwD,OAAOpjB,UAAY,gBAAkB4f,CAAK,EAAG2yB,EAAQ3yB,EAAM,CAC/U,SAAS4yB,EAAQ9xB,EAAQ+xB,GAAkB,IAAIptC,EAAOD,OAAOC,KAAKqb,GAAS,GAAItb,OAAO0d,sBAAuB,CAAE,IAAI4vB,EAAUttC,OAAO0d,sBAAsBpC,GAAS+xB,IAAmBC,EAAUA,EAAQhtC,QAAO,SAAUitC,GAAO,OAAOvtC,OAAO2d,yBAAyBrC,EAAQiyB,GAAK3zB,UAAY,KAAK3Z,EAAKzD,KAAKL,MAAM8D,EAAMqtC,EAAU,CAAE,OAAOrtC,CAAM,CACpV,SAASutC,EAAcrzB,GAAU,IAAK,IAAI3e,EAAI,EAAGA,EAAII,UAAUD,OAAQH,IAAK,CAAE,IAAIwd,EAAS,MAAQpd,UAAUJ,GAAKI,UAAUJ,GAAK,CAAC,EAAGA,EAAI,EAAI4xC,EAAQptC,OAAOgZ,IAAS,GAAIzW,SAAQ,SAAUlF,GAAOowC,EAAgBtzB,EAAQ9c,EAAK2b,EAAO3b,GAAO,IAAK2C,OAAO4d,0BAA4B5d,OAAO6d,iBAAiB1D,EAAQna,OAAO4d,0BAA0B5E,IAAWo0B,EAAQptC,OAAOgZ,IAASzW,SAAQ,SAAUlF,GAAO2C,OAAOyd,eAAetD,EAAQ9c,EAAK2C,OAAO2d,yBAAyB3E,EAAQ3b,GAAO,GAAI,CAAE,OAAO8c,CAAQ,CACzf,SAASszB,EAAgBjzB,EAAKnd,EAAK6B,GAA4L,OAAnL7B,EAC5C,SAAwB9C,GAAO,IAAI8C,EACnC,SAAsBqwC,EAAOC,GAAQ,GAAuB,WAAnBR,EAAQO,IAAiC,OAAVA,EAAgB,OAAOA,EAAO,IAAIE,EAAOF,EAAM1vB,OAAO6vB,aAAc,QAAaxzC,IAATuzC,EAAoB,CAAE,IAAIv7B,EAAMu7B,EAAK5xC,KAAK0xC,EAAOC,GAAQ,WAAY,GAAqB,WAAjBR,EAAQ96B,GAAmB,OAAOA,EAAK,MAAM,IAAIpX,UAAU,+CAAiD,CAAE,OAAiB,WAAT0yC,EAAoB10B,OAAS60B,QAAQJ,EAAQ,CADnVK,CAAaxzC,EAAK,UAAW,MAAwB,WAAjB4yC,EAAQ9vC,GAAoBA,EAAM4b,OAAO5b,EAAM,CAD1E2wC,CAAe3wC,MAAiBmd,EAAOxa,OAAOyd,eAAejD,EAAKnd,EAAK,CAAE6B,MAAOA,EAAO0a,YAAY,EAAME,cAAc,EAAMD,UAAU,IAAkBW,EAAInd,GAAO6B,EAAgBsb,CAAK,CAkB3O,SAAe,cAAgB,CAC7ByzB,YAAa,4BACbC,OAAQ,yBACRC,UAAW,CACTC,eAAgB,UAElBC,iBAAkB,SAA0BpO,EAAOqO,EAAaC,EAAeC,GAC7E,IAAIC,EAAQD,EAAStuC,QAAO,SAAUmS,EAAKq8B,GACzC,MAA0B,qBAAfA,EAAKD,QACTxO,EAAM0O,aAA2B,UAAZD,EAAKE,IAGzB3O,EAAM0O,aAA2B,UAAZD,EAAKE,IAAsD,KAApCF,EAAKD,MAAM,GAAG7qC,kBACrDyO,EAEFA,EAAI/S,OAAOovC,EAAKD,MAAMvrC,KAAI,SAAUoN,GACzC,OAAOk9B,EAAcA,EAAc,CAAC,EAAGl9B,GAAO,CAAC,EAAG,CAChDs+B,GAAIF,EAAKE,GACT9wC,MAAO4wC,EAAK5wC,OAEhB,KAGGuU,CACT,GAAG,IACCw8B,EAAmB5O,EAAMmO,eAAiBnO,EAAMmO,eAAeK,GAASA,EAC5E,MAAO,CACLA,MAAOI,EACPC,UAAWD,EAAiBlzC,OAAS,EAEzC,EACAozC,OAAQ,SAAgB9O,EAAOqO,EAAaG,GAK1C,OAHyBA,aAAiBxyC,MAAQwyC,EAAMvrC,KAAI,SAAUoN,GACpE,OAAOA,EAAKpR,KACd,IAAK,CAACuvC,IACoBvuC,QAAO,SAAUmS,EAAKkN,GAC9C,OAAOA,EAAMlN,EACf,GAAGi8B,EACL,wFCbF,SAAe,OAAgB,CAC7BL,YAAa,cACbC,OAAQ,WACRG,iBAAkB,SAA0BpO,EAAOqO,EAAaC,GAC9D,IAAInhC,GAAU,QAAWmhC,EAAe,CACtCS,IAAK/O,EAAMgP,aACXC,kBAAmBjP,EAAMkP,oBAE3B,IAAK/hC,EACH,MAAO,CACL8X,KAAM,IAGV,IAAIkqB,GAAoB,QAAqBhiC,EAAQ8X,KAAM9X,EAAQhI,YAAagI,EAAQpI,MAExF,MAAO,CACLkgB,MAFgC,QAAWkqB,EAAmBhiC,EAAQiiC,SAI1E,EAYAC,oBAAqB,SAA6BC,GAChD,OAAOA,CACT,2GC/EF,SAASpC,EAAQ3yB,GAAkC,OAAO2yB,EAAU,mBAAqBnvB,QAAU,iBAAmBA,OAAOC,SAAW,SAAUzD,GAAO,cAAcA,CAAK,EAAI,SAAUA,GAAO,OAAOA,GAAO,mBAAqBwD,QAAUxD,EAAInW,cAAgB2Z,QAAUxD,IAAQwD,OAAOpjB,UAAY,gBAAkB4f,CAAK,EAAG2yB,EAAQ3yB,EAAM,CAC/U,SAASizB,EAAgBjzB,EAAKnd,EAAK6B,GAA4L,OAAnL7B,EAC5C,SAAwB9C,GAAO,IAAI8C,EACnC,SAAsBqwC,EAAOC,GAAQ,GAAuB,WAAnBR,EAAQO,IAAiC,OAAVA,EAAgB,OAAOA,EAAO,IAAIE,EAAOF,EAAM1vB,OAAO6vB,aAAc,QAAaxzC,IAATuzC,EAAoB,CAAE,IAAIv7B,EAAMu7B,EAAK5xC,KAAK0xC,EAAOC,GAAQ,WAAY,GAAqB,WAAjBR,EAAQ96B,GAAmB,OAAOA,EAAK,MAAM,IAAIpX,UAAU,+CAAiD,CAAE,OAAiB,WAAT0yC,EAAoB10B,OAAS60B,QAAQJ,EAAQ,CADnVK,CAAaxzC,EAAK,UAAW,MAAwB,WAAjB4yC,EAAQ9vC,GAAoBA,EAAM4b,OAAO5b,EAAM,CAD1E2wC,CAAe3wC,MAAiBmd,EAAOxa,OAAOyd,eAAejD,EAAKnd,EAAK,CAAE6B,MAAOA,EAAO0a,YAAY,EAAME,cAAc,EAAMD,UAAU,IAAkBW,EAAInd,GAAO6B,EAAgBsb,CAAK,CAO3O,IAAIg1B,EAAY,iBAChB,SAASC,EAAMxP,GACb,OAAOA,EAAMhhC,SACf,CACA,SAASywC,EAAqBzP,EAAOqO,EAAavyC,GAChD,IAAI6H,GAAoB,QAA0Bq8B,EAAOqO,EAAavyC,EAAS,GAAGuD,OAAOkwC,EAAW,KAAKlwC,OAAOmwC,EAAMxP,IAAS,IAC/H,MAAiC,kBAAtBr8B,EACFA,EAELA,EACK,CAACA,GAEH,EACT,CACA,SAASy+B,EAASnjC,EAAO+gC,EAAOqO,EAAavyC,GAC3C,IAAI6H,EAAoB8rC,EAAqBzP,EAAOqO,EAAavyC,GAMjE,OALwD,IAAtC6H,EAAkBjD,QAAQzB,GACT0E,EAAkBtE,OAAO,CAACJ,IAC3D0E,EAAkBtD,QAAO,SAAUqvC,GACnC,OAAOA,IAAkBzwC,CAC3B,GAEF,CACA,SAAS0wC,EAASC,GAChB,IAAIC,EAAWD,EAAKC,SAClBC,EAAQF,EAAKE,MACbC,EAAgBH,EAAKG,cACvB,OAAOF,EAAWE,EAAgBD,CACpC,CACA,SAASE,EAAQhQ,EAAOqO,EAAa4B,EAAgBn0C,GACnD,IAQIo0C,EAAY1C,EAAgB,CAAC,EARxBgC,EAAMxP,GAQyBiQ,EAAev0C,OAAS,EAAIu0C,EAAiB,IAErF,OAAO,QAAY5B,EAAa6B,EAAWp0C,GAD3B,EAC+CyzC,EACjE,CA4BA,IAAIjlC,EAAS,CAAC,YAAa,aAAc,YACzC,SAAe,OAAgB,CAC7B0jC,YAAa,wBACbC,OAAQ,qBACRC,UAAW,CACTS,GAAI,WACJ3vC,UAAW,WAAiBmxC,WAC5B/sC,SAAU,UAAgB,CAAC,MAAO,OAClCysC,SAAU,SACVC,MAAO,WACPC,cAAe,WACfK,kBAAmB,YAAkB,cAAoB,CAAC,WAAkB,cAC5EC,WAAY,SACZlC,eAAgB,SAChB58B,cAAe,UAEjB++B,aAAc,CACZltC,SAAU,KACVysC,UAAU,EACVC,MAAO,GACPC,cAAe,GACfx+B,eAAe,GAEjB68B,iBAAkB,SAA0BpO,EAAOqO,EAAaC,EAAeC,EAAUgC,GACvF,IAAIvxC,EAAYghC,EAAMhhC,UACpBqxC,EAAarQ,EAAMqQ,WACnBnB,EAAoBlP,EAAMkP,kBAC1B39B,EAAgByuB,EAAMzuB,cACpBpE,GAAU,QAAWmhC,EAAe,CACtCS,IAAK/O,EAAMgP,aACXC,kBAAmBjP,EAAMkP,oBAEvBL,EAAYruC,QAAQ2M,IAAY3M,QAAQ2M,EAAQgE,eAAenS,IAC/DwxC,EAAehwC,QAAQ+vC,GAA+BA,EAA4BvxC,IAAoD,KAAtCuxC,EAA4B3rC,OAGhI,GAAIyrC,GAAcnB,EAChB,MAAM,IAAItzC,MAAM,mGAElB,IAAKizC,EACH,MAAO,CACLL,MAAO,GACP7qC,kBAAmB8rC,EAAqBzP,EAAOqO,EAAa,CAC1DU,IAAK/O,EAAMgP,aACXC,kBAAmBjP,EAAMkP,oBAE3BL,UAAWA,EACX2B,aAAcA,EACdH,WAAYA,GAGhB,IAAI7B,EAAQgC,EAAeD,EAA4BvxC,GAAWiE,KAAI,SAAUxD,GAC9E,MAAO,CACLgxC,MAAOhxC,EAAER,MACTA,MAAOmjC,EAAS3iC,EAAEoN,aAAcmzB,EAAOqO,EAAa,CAClDU,IAAK/O,EAAMgP,aACXC,kBAAmBjP,EAAMkP,oBAE3B9lB,iBAAkB,CAChBqnB,MAAO,CACLxxC,MAAOQ,EAAEixC,cAGb3jC,MAAOtN,EAAEsN,MACT7N,UAAWO,EAAEP,UAEjB,IAAKiO,EAAQkE,eAAerS,EAAW,CACrCsL,OAAQA,EACRiH,cAAeA,IACdtO,KAAI,SAAUxD,GACf,MAAO,CACLgxC,MAAOhxC,EAAEoE,KACT5E,MAAOmjC,EAAS3iC,EAAEoN,aAAcmzB,EAAOqO,EAAa,CAClDU,IAAK/O,EAAMgP,aACXC,kBAAmBjP,EAAMkP,oBAE3BniC,MAAOtN,EAAEsN,MACT7N,UAAWO,EAAEP,UAEjB,IACI0vC,EAAmB5O,EAAMmO,eAAiBnO,EAAMmO,eAAeK,GAASA,EAC5E,MAAO,CACLA,MAAOI,EAAiB3yC,MAAM,EAAG0zC,EAAS3P,IAC1Cr8B,kBAAmB8rC,EAAqBzP,EAAOqO,EAAa,CAC1DU,IAAK/O,EAAMgP,aACXC,kBAAmBjP,EAAMkP,oBAE3BsB,aAAcA,EACdH,WAAYA,EACZxB,UAAWD,EAAiBlzC,OAAS,EAEzC,EACAozC,OAAQ,SAAgB9O,EAAOqO,EAAa4B,GAC1C,OAAOD,EAAQhQ,EAAOqO,EAAa4B,EAAgB,CACjDlB,IAAK/O,EAAMgP,aACXC,kBAAmBjP,EAAMkP,mBAE7B,EACAn6B,qBAAsB,SAA8BirB,EAAOqO,EAAa4B,GACtE,MAAO,CACLvqC,UAAWs6B,EAAMhhC,UACjB4F,MAAOqrC,EACPj7B,aAAc26B,EAAS3P,GAE3B,EACA2Q,QAAS,SAAiB3Q,EAAOqO,GAC/B,OArIJ,SAAkBrO,EAAOqO,EAAavyC,GACpC,OAAO,QAAauyC,EAAavyC,EAAS,GAAGuD,OAAOkwC,EAAW,KAAKlwC,OAAOmwC,EAAMxP,IACnF,CAmIW4Q,CAAS5Q,EAAOqO,EAAa,CAClCU,IAAK/O,EAAMgP,aACXC,kBAAmBjP,EAAMkP,mBAE7B,EACAG,oBAAqB,SAA6BC,EAAkBtP,EAAOqO,GACzE,IAAIrvC,EAAYghC,EAAMhhC,UAElB6xC,EAAsB,QADb7Q,EAAM58B,SACe,WAAa,sBAC3C0tC,EAAmB,GAAGzxC,OAAOwxC,EAAQ,cAKzC,OADAvB,GAHAA,EAAmBA,EAAiB/qC,mBAAmB,CACrDwsC,kBAAmB9wB,KAAKilB,IAAIoK,EAAiByB,mBAAqB,EAAGpB,EAAS3P,OAE5C6Q,GAAQ7xC,GACrCywC,EAAqBzP,EAAOqO,EAAa,CAC9CU,IAAK/O,EAAMgP,aACXC,kBAAmBjP,EAAMkP,oBACxBjvC,QAAO,SAAUmS,EAAK7M,GACvB,OAAO6M,EAAI0+B,GAAkB9xC,EAAWuG,EAC1C,GAAG+pC,EACL,EACA0B,YAAa,SAAqBhR,EAAOqO,GACvC,IAAIM,EAAKa,EAAMxP,GACXlkC,EAAU,CACZizC,IAAK/O,EAAMgP,aACXC,kBAAmBjP,EAAMkP,mBAE3B,MAAO,CACLP,GAAIA,EACJ9wC,OAAO,QAAW/B,GAClB0yC,MAAOiB,EAAqBzP,EAAOqO,EAAavyC,GAASJ,OAAS,EAAI,CAAC,CACrEsD,UAAWghC,EAAMhhC,UACjByxC,MAAO,GAAGpxC,OAAO2gC,EAAMhhC,UAAW,MAClC2E,kBAAmB8rC,EAAqBzP,EAAOqO,EAAavyC,GAC5DmD,MAAO,SAAegyC,GACpB,OAAOjB,EAAQhQ,EAAOiR,EAAW,GAAIn1C,EACvC,EACA0yC,MAAOiB,EAAqBzP,EAAOqO,EAAavyC,GAASmH,KAAI,SAAUoN,GACrE,MAAO,CACLogC,OAAO,QAAmB,GAAGpxC,OAAOgR,IACpCpR,MAAO,SAAegyC,GACpB,IAAIC,EAAoBzB,EAAqBzP,EAAOiR,EAAWn1C,GAASuE,QAAO,SAAUsa,GACvF,OAAOA,IAAUtK,CACnB,IACA,OAAO2/B,EAAQhQ,EAAOqO,EAAa6C,EAAmBp1C,EACxD,EAEJ,MACG,GAET,gGCzOF,SAASoxC,EAAQ3yB,GAAkC,OAAO2yB,EAAU,mBAAqBnvB,QAAU,iBAAmBA,OAAOC,SAAW,SAAUzD,GAAO,cAAcA,CAAK,EAAI,SAAUA,GAAO,OAAOA,GAAO,mBAAqBwD,QAAUxD,EAAInW,cAAgB2Z,QAAUxD,IAAQwD,OAAOpjB,UAAY,gBAAkB4f,CAAK,EAAG2yB,EAAQ3yB,EAAM,CAC/U,SAASizB,EAAgBjzB,EAAKnd,EAAK6B,GAA4L,OAAnL7B,EAC5C,SAAwB9C,GAAO,IAAI8C,EACnC,SAAsBqwC,EAAOC,GAAQ,GAAuB,WAAnBR,EAAQO,IAAiC,OAAVA,EAAgB,OAAOA,EAAO,IAAIE,EAAOF,EAAM1vB,OAAO6vB,aAAc,QAAaxzC,IAATuzC,EAAoB,CAAE,IAAIv7B,EAAMu7B,EAAK5xC,KAAK0xC,EAAOC,GAAQ,WAAY,GAAqB,WAAjBR,EAAQ96B,GAAmB,OAAOA,EAAK,MAAM,IAAIpX,UAAU,+CAAiD,CAAE,OAAiB,WAAT0yC,EAAoB10B,OAAS60B,QAAQJ,EAAQ,CADnVK,CAAaxzC,EAAK,UAAW,MAAwB,WAAjB4yC,EAAQ9vC,GAAoBA,EAAM4b,OAAO5b,EAAM,CAD1E2wC,CAAe3wC,MAAiBmd,EAAOxa,OAAOyd,eAAejD,EAAKnd,EAAK,CAAE6B,MAAOA,EAAO0a,YAAY,EAAME,cAAc,EAAMD,UAAU,IAAkBW,EAAInd,GAAO6B,EAAgBsb,CAAK,CAS3O,SAASk1B,EAAqBzP,EAAOqO,EAAavyC,GAChD,IACI6H,GAAoB,QAA0Bq8B,EAAOqO,EAAavyC,EAJ/D,QAI4E,IACnF,OAAI6H,GAGG,EACT,CACA,SAASqsC,EAAQhQ,EAAOqO,EAAa4B,EAAgBn0C,GACnD,IACIo0C,EAAY1C,EAAgB,CAAC,EAZ1B,QAYiCyC,GAExC,OAAO,QAAY5B,EAAa6B,EAAWp0C,GAD3B,EAElB,CAeA,SAAe,OAAgB,CAC7BkyC,YAAa,mBACbC,OAAQ,gBACRC,UAAW,CACTkC,kBAAmB,YAErBhC,iBAAkB,SAA0BpO,EAAOqO,EAAaC,GAC9D,MAAO,CACL3qC,kBAAmB8rC,EAAqBzP,EAAOqO,EAAa,CAC1DU,IAAK/O,EAAMgP,aACXC,kBAAmBjP,EAAMkP,oBAE3BiC,gBAAiB7C,EAAc6C,gBAEnC,EACArC,OAAQ,SAAgB9O,EAAOqO,EAAa4B,GAC1C,OAAOD,EAAQhQ,EAAOqO,EAAa4B,EAAgB,CACjDlB,IAAK/O,EAAMgP,aACXC,kBAAmBjP,EAAMkP,mBAE7B,EACAyB,QAAS,SAAiB3Q,EAAOqO,GAC/B,OApCJ,SAAkBrO,EAAOqO,EAAavyC,GACpC,OAAO,QAAauyC,EAAavyC,EAjB1B,QAkBT,CAkCW80C,CAAS5Q,EAAOqO,EAAa,CAClCU,IAAK/O,EAAMgP,aACXC,kBAAmBjP,EAAMkP,mBAE7B,EACAG,oBAAqB,SAA6BC,EAAkBtP,EAAOqO,GACzE,OAAOiB,EAAiB5qC,SAAS+qC,EAAqBzP,EAAOqO,EAAa,CACxEU,IAAK/O,EAAMgP,aACXC,kBAAmBjP,EAAMkP,oBAE7B,EACA8B,YAAa,SAAqBhR,EAAOqO,GACvC,IAAIM,EAhEC,QAiEDhrC,EAAoB8rC,EAAqBzP,EAAOqO,EAAa,CAC/DU,IAAK/O,EAAMgP,aACXC,kBAAmBjP,EAAMkP,oBAE3B,MAAO,CACLP,GAAIA,EACJ9wC,OAAO,QAAW,CAChBkxC,IAAK/O,EAAMgP,aACXC,kBAAmBjP,EAAMkP,oBAE3BV,MAA6B,OAAtB7qC,EAA6B,GAAK,CAAC,CACxC8sC,MAAO,GAAGpxC,OAAOsvC,EAAI,MAAMtvC,OAAOsE,GAClC1E,MAAO,SAAegyC,GACpB,OAAOjB,EAAQhQ,EAAOiR,EAAW,GAAI,CACnClC,IAAK/O,EAAMgP,aACXC,kBAAmBjP,EAAMkP,mBAE7B,EACAvrC,kBAAmBA,IAGzB,6EC1CF,SAAe,OAAgB,CAC7BqqC,YAAa,sBACbC,OAAQ,mBACRG,iBAAkB,SAA0BpO,EAAOqO,EAAaC,GAK9D,MAAO,CACLD,YAAaA,EACbC,eANY,QAAWA,EAAe,CACtCS,IAAK/O,EAAMgP,aACXC,kBAAmBjP,EAAMkP,oBAKzBkC,iBAAkB9C,EAAcnhC,QAChCkkC,UAAW/C,EAAc+C,UACzBF,gBAAiB7C,EAAc6C,gBAC/B11C,MAAO6yC,EAAc7yC,MACrB61C,wBAAyBhD,EAAcgD,wBACvCtR,MAAOA,EAEX,qFCrESuR,GAAoC,IAAAC,eAAc,CAC3DC,sBAAuB,WAEvB,EACAC,mBAAoB,WAClB,MAAO,GACT,EACAC,uBAAwB,WAExB,EACAC,oBAAqB,WAErB,EACAC,mBAAoB,WAEpB,EACAC,MAAO,CAAC,EACRC,eAAgB,CAAC,EACjBC,kBAAmB,KAEjBC,EAAwBV,EAAqBW,SAC/CC,EAAwBZ,EAAqBa,SAE3CC,GAA8B,IAAAb,oBAAcp3C,GAC9Ck4C,EAAgBD,EAAeH,SACfG,EAAeD,iHC1B7BG,EAAY,CAAC,gBACjB,SAASrF,EAAQ3yB,GAAkC,OAAO2yB,EAAU,mBAAqBnvB,QAAU,iBAAmBA,OAAOC,SAAW,SAAUzD,GAAO,cAAcA,CAAK,EAAI,SAAUA,GAAO,OAAOA,GAAO,mBAAqBwD,QAAUxD,EAAInW,cAAgB2Z,QAAUxD,IAAQwD,OAAOpjB,UAAY,gBAAkB4f,CAAK,EAAG2yB,EAAQ3yB,EAAM,CAC/U,SAASi4B,IAAiS,OAApRA,EAAWzyC,OAAOqgB,OAASrgB,OAAOqgB,OAAOrI,OAAS,SAAUmC,GAAU,IAAK,IAAI3e,EAAI,EAAGA,EAAII,UAAUD,OAAQH,IAAK,CAAE,IAAIwd,EAASpd,UAAUJ,GAAI,IAAK,IAAI6B,KAAO2b,EAAchZ,OAAOpF,UAAUwf,eAAepe,KAAKgd,EAAQ3b,KAAQ8c,EAAO9c,GAAO2b,EAAO3b,GAAU,CAAE,OAAO8c,CAAQ,EAAUs4B,EAASt2C,MAAMjC,KAAM0B,UAAY,CAClV,SAAS82C,EAAyB15B,EAAQyB,GAAY,GAAc,MAAVzB,EAAgB,MAAO,CAAC,EAAG,IAAkE3b,EAAK7B,EAAnE2e,EACzF,SAAuCnB,EAAQyB,GAAY,GAAc,MAAVzB,EAAgB,MAAO,CAAC,EAAG,IAA2D3b,EAAK7B,EAA5D2e,EAAS,CAAC,EAAOO,EAAa1a,OAAOC,KAAK+Y,GAAqB,IAAKxd,EAAI,EAAGA,EAAIkf,EAAW/e,OAAQH,IAAO6B,EAAMqd,EAAWlf,GAAQif,EAAS9Z,QAAQtD,IAAQ,IAAa8c,EAAO9c,GAAO2b,EAAO3b,IAAQ,OAAO8c,CAAQ,CADhNw4B,CAA8B35B,EAAQyB,GAAuB,GAAIza,OAAO0d,sBAAuB,CAAE,IAAIk1B,EAAmB5yC,OAAO0d,sBAAsB1E,GAAS,IAAKxd,EAAI,EAAGA,EAAIo3C,EAAiBj3C,OAAQH,IAAO6B,EAAMu1C,EAAiBp3C,GAAQif,EAAS9Z,QAAQtD,IAAQ,GAAkB2C,OAAOpF,UAAUmjB,qBAAqB/hB,KAAKgd,EAAQ3b,KAAgB8c,EAAO9c,GAAO2b,EAAO3b,GAAQ,CAAE,OAAO8c,CAAQ,CAE3e,SAASizB,EAAQ9xB,EAAQ+xB,GAAkB,IAAIptC,EAAOD,OAAOC,KAAKqb,GAAS,GAAItb,OAAO0d,sBAAuB,CAAE,IAAI4vB,EAAUttC,OAAO0d,sBAAsBpC,GAAS+xB,IAAmBC,EAAUA,EAAQhtC,QAAO,SAAUitC,GAAO,OAAOvtC,OAAO2d,yBAAyBrC,EAAQiyB,GAAK3zB,UAAY,KAAK3Z,EAAKzD,KAAKL,MAAM8D,EAAMqtC,EAAU,CAAE,OAAOrtC,CAAM,CACpV,SAASutC,EAAcrzB,GAAU,IAAK,IAAI3e,EAAI,EAAGA,EAAII,UAAUD,OAAQH,IAAK,CAAE,IAAIwd,EAAS,MAAQpd,UAAUJ,GAAKI,UAAUJ,GAAK,CAAC,EAAGA,EAAI,EAAI4xC,EAAQptC,OAAOgZ,IAAS,GAAIzW,SAAQ,SAAUlF,GAAOowC,EAAgBtzB,EAAQ9c,EAAK2b,EAAO3b,GAAO,IAAK2C,OAAO4d,0BAA4B5d,OAAO6d,iBAAiB1D,EAAQna,OAAO4d,0BAA0B5E,IAAWo0B,EAAQptC,OAAOgZ,IAASzW,SAAQ,SAAUlF,GAAO2C,OAAOyd,eAAetD,EAAQ9c,EAAK2C,OAAO2d,yBAAyB3E,EAAQ3b,GAAO,GAAI,CAAE,OAAO8c,CAAQ,CAEzf,SAAS04B,EAAkB14B,EAAQ8lB,GAAS,IAAK,IAAIzkC,EAAI,EAAGA,EAAIykC,EAAMtkC,OAAQH,IAAK,CAAE,IAAIs3C,EAAa7S,EAAMzkC,GAAIs3C,EAAWl5B,WAAak5B,EAAWl5B,aAAc,EAAOk5B,EAAWh5B,cAAe,EAAU,UAAWg5B,IAAYA,EAAWj5B,UAAW,GAAM7Z,OAAOyd,eAAetD,EAAQ6zB,EAAe8E,EAAWz1C,KAAMy1C,EAAa,CAAE,CAG5U,SAASC,EAAgBj1B,EAAG4C,GAA6I,OAAxIqyB,EAAkB/yC,OAAOgzC,eAAiBhzC,OAAOgzC,eAAeh7B,OAAS,SAAyB8F,EAAG4C,GAAsB,OAAjB5C,EAAEm1B,UAAYvyB,EAAU5C,CAAG,EAAUi1B,EAAgBj1B,EAAG4C,EAAI,CACvM,SAASwyB,EAAaC,GAAW,IAAIC,EAGrC,WAAuC,GAAuB,qBAAZC,UAA4BA,QAAQC,UAAW,OAAO,EAAO,GAAID,QAAQC,UAAUC,KAAM,OAAO,EAAO,GAAqB,oBAAVC,MAAsB,OAAO,EAAM,IAAsF,OAAhF/yC,QAAQ7F,UAAUumC,QAAQnlC,KAAKq3C,QAAQC,UAAU7yC,QAAS,IAAI,WAAa,MAAY,CAAM,CAAE,MAAO2T,GAAK,OAAO,CAAO,CAAE,CAHvQq/B,GAA6B,OAAO,WAAkC,IAAsCnlC,EAAlColC,EAAQC,EAAgBR,GAAkB,GAAIC,EAA2B,CAAE,IAAIQ,EAAYD,EAAgBz5C,MAAMmK,YAAaiK,EAAS+kC,QAAQC,UAAUI,EAAO93C,UAAWg4C,EAAY,MAAStlC,EAASolC,EAAMv3C,MAAMjC,KAAM0B,WAAc,OACpX,SAAoC0G,EAAMtG,GAAQ,GAAIA,IAA2B,WAAlBmxC,EAAQnxC,IAAsC,oBAATA,GAAwB,OAAOA,EAAa,QAAa,IAATA,EAAmB,MAAM,IAAIf,UAAU,4DAA+D,OAAO44C,EAAuBvxC,EAAO,CAD4FwxC,CAA2B55C,KAAMoU,EAAS,CAAG,CAExa,SAASulC,EAAuBvxC,GAAQ,QAAa,IAATA,EAAmB,MAAM,IAAIyxC,eAAe,6DAAgE,OAAOzxC,CAAM,CAErK,SAASqxC,EAAgB71B,GAA+J,OAA1J61B,EAAkB3zC,OAAOgzC,eAAiBhzC,OAAOg0C,eAAeh8B,OAAS,SAAyB8F,GAAK,OAAOA,EAAEm1B,WAAajzC,OAAOg0C,eAAel2B,EAAI,EAAU61B,EAAgB71B,EAAI,CACnN,SAAS2vB,EAAgBjzB,EAAKnd,EAAK6B,GAA4L,OAAnL7B,EAAM2wC,EAAe3wC,MAAiBmd,EAAOxa,OAAOyd,eAAejD,EAAKnd,EAAK,CAAE6B,MAAOA,EAAO0a,YAAY,EAAME,cAAc,EAAMD,UAAU,IAAkBW,EAAInd,GAAO6B,EAAgBsb,CAAK,CAC3O,SAASwzB,EAAezzC,GAAO,IAAI8C,EACnC,SAAsBqwC,EAAOC,GAAQ,GAAuB,WAAnBR,EAAQO,IAAiC,OAAVA,EAAgB,OAAOA,EAAO,IAAIE,EAAOF,EAAM1vB,OAAO6vB,aAAc,QAAaxzC,IAATuzC,EAAoB,CAAE,IAAIv7B,EAAMu7B,EAAK5xC,KAAK0xC,EAAOC,GAAQ,WAAY,GAAqB,WAAjBR,EAAQ96B,GAAmB,OAAOA,EAAK,MAAM,IAAIpX,UAAU,+CAAiD,CAAE,OAAiB,WAAT0yC,EAAoB10B,OAAS60B,QAAQJ,EAAQ,CADnVK,CAAaxzC,EAAK,UAAW,MAAwB,WAAjB4yC,EAAQ9vC,GAAoBA,EAAM4b,OAAO5b,EAAM,CAgBrH,SAAS42C,EAA8BC,GAC5C,IAAKA,EAAcjG,YACjB,MAAM,IAAIpyC,MAAM,uEAElB,IAAIs4C,EAAwD,oBAAtCD,EAAc5E,qBAA2E,oBAA9B4E,EAAcjD,aAAuE,oBAAlCiD,EAAcE,gBAClJ,OAAO,SAAUC,GACf,IAAIC,EAA6B14C,UAAUD,OAAS,QAAsBtB,IAAjBuB,UAAU,GAAmBA,UAAU,GAAK,CAAC,EAClG24C,EAAyB,SAAUC,IA/B3C,SAAmBC,EAAUC,GAAc,GAA0B,oBAAfA,GAA4C,OAAfA,EAAuB,MAAM,IAAIz5C,UAAU,sDAAyDw5C,EAAS75C,UAAYoF,OAAO2Z,OAAO+6B,GAAcA,EAAW95C,UAAW,CAAEyJ,YAAa,CAAEnF,MAAOu1C,EAAU56B,UAAU,EAAMC,cAAc,KAAW9Z,OAAOyd,eAAeg3B,EAAU,YAAa,CAAE56B,UAAU,IAAc66B,GAAY3B,EAAgB0B,EAAUC,EAAa,CAgC7bC,CAAUJ,EAAWC,GACrB,IAlCgBI,EAAaC,EAAYC,EAkCrCC,EAAS7B,EAAaqB,GAC1B,SAASA,EAAUtU,GACjB,IAAI+U,EA2CJ,OAjFR,SAAyBvxC,EAAUmxC,GAAe,KAAMnxC,aAAoBmxC,GAAgB,MAAM,IAAI35C,UAAU,oCAAwC,CAuChJg6C,CAAgB/6C,KAAMq6C,GAEtB9G,EAAgBoG,EADhBmB,EAAQD,EAAO/4C,KAAK9B,KAAM+lC,IACqB,mBAAe,GAC9DwN,EAAgBoG,EAAuBmB,GAAQ,wBAAoB,GACnEvH,EAAgBoG,EAAuBmB,GAAQ,kBAAmB,MAClEvH,EAAgBoG,EAAuBmB,GAAQ,gBAAgB,GAC/DvH,EAAgBoG,EAAuBmB,GAAQ,QAAS,CACtDE,cAAeF,EAAM3G,iBAAiB2G,EAAM/U,SAE9CwN,EAAgBoG,EAAuBmB,GAAQ,UAAU,WAEvD,IADA,IAAInF,EACKsF,EAAOv5C,UAAUD,OAAQJ,EAAO,IAAIU,MAAMk5C,GAAOC,EAAO,EAAGA,EAAOD,EAAMC,IAC/E75C,EAAK65C,GAAQx5C,UAAUw5C,GAEzBJ,EAAM/U,MAAMgP,aAAayC,uBAExB7B,EAAOqE,EAAcnF,QAAQ/yC,KAAKG,MAAM0zC,EAAM,CAACgE,EAAuBmB,GAAQA,EAAM/U,MAAO+U,EAAM/U,MAAMgP,aAAa8C,MAAMsD,WAAWC,SAASh2C,OAAO/D,IACxJ,IACAkyC,EAAgBoG,EAAuBmB,GAAQ,aAAa,WAE1D,IADA,IAAIO,EACKC,EAAQ55C,UAAUD,OAAQJ,EAAO,IAAIU,MAAMu5C,GAAQC,EAAQ,EAAGA,EAAQD,EAAOC,IACpFl6C,EAAKk6C,GAAS75C,UAAU65C,GAE1B,OAAOT,EAAM/U,MAAMgP,aAAa0C,oBAE/B4D,EAAQrB,EAAcnF,QAAQ/yC,KAAKG,MAAMo5C,EAAO,CAAC1B,EAAuBmB,GAAQA,EAAM/U,MAAO+U,EAAM/U,MAAMgP,aAAa8C,MAAMsD,WAAWC,SAASh2C,OAAO/D,IAC1J,IACAkyC,EAAgBoG,EAAuBmB,GAAQ,wBAAwB,WAErE,IADA,IAAIU,EACKC,EAAQ/5C,UAAUD,OAAQJ,EAAO,IAAIU,MAAM05C,GAAQC,EAAQ,EAAGA,EAAQD,EAAOC,IACpFr6C,EAAKq6C,GAASh6C,UAAUg6C,GAE1BZ,EAAM/U,MAAMgP,aAAa2C,wBAExB8D,EAAQxB,EAAcl/B,sBAAsBhZ,KAAKG,MAAMu5C,EAAO,CAAC7B,EAAuBmB,GAAQA,EAAM/U,MAAO+U,EAAM/U,MAAMgP,aAAa8C,MAAMsD,WAAWC,SAASh2C,OAAO/D,IACxK,IACI24C,EAAc5E,qBAChB0F,EAAM/U,MAAMgP,aAAa6C,mBAAmBoC,EAAc5E,oBAAoBt3B,KAAK67B,EAAuBmB,IAAS,CACjHhG,IAAKgG,EAAM/U,MAAMgP,aACjBC,kBAAmB8F,EAAM/U,MAAMkP,mBAC9B6F,EAAM/U,MAAOiU,EAAcjD,aAAeiD,EAAcjD,YAAYj5B,KAAK67B,EAAuBmB,IAASd,EAAcjG,aAErH+G,CACT,CA4IA,OA5NgBJ,EAiFHL,GAjFgBM,EAiFL,CAAC,CACvBx3C,IAAK,oBACL6B,MAAO,WACL,IAAI22C,EAAS37C,KACTA,KAAK47C,kBACPxnB,aAAap0B,KAAK47C,iBAClB57C,KAAK47C,gBAAkB,MAEzB57C,KAAK67C,YAAc77C,KAAK+lC,MAAMgP,aAAa8C,MAAMiE,WAAU,WACpDH,EAAOI,cACVJ,EAAOh/B,SAAS,CACdq+B,cAAeW,EAAOxH,iBAAiBwH,EAAO5V,QAGpD,IACIkU,IACFj6C,KAAKg8C,iBAAmBh8C,KAAK+lC,MAAMgP,aAAa+C,eAAemE,eAAej8C,MAElF,GACC,CACDmD,IAAK,wBACL6B,MAAO,SAA+Bk3C,EAAWlF,GAC/C,GAAmD,oBAAxCgD,EAAcmC,sBACvB,OAAOnC,EAAcmC,sBAAsBr6C,KAAK9B,KAAMA,KAAK+lC,MAAOmW,EAAWl8C,KAAKkR,MAAO8lC,GAE3F,IAAIoF,GAAa,QAAap8C,KAAK+lC,MAAOmW,GAC1C,OAAiC,OAA7Bl8C,KAAKkR,MAAM8pC,eAAsD,OAA5BhE,EAAUgE,cAC7Ch7C,KAAKkR,MAAM8pC,gBAAkBhE,EAAUgE,gBACjCoB,GAIJA,KAAe,QAAap8C,KAAKkR,MAAM8pC,cAAehE,EAAUgE,cAC1E,GACC,CACD73C,IAAK,qBACL6B,MAAO,SAA4Bq3C,GAC5B,IAAQA,EAAWr8C,KAAK+lC,SAC3B/lC,KAAK2c,SAAS,CACZq+B,cAAeh7C,KAAKm0C,iBAAiBn0C,KAAK+lC,SAExCkU,IACFj6C,KAAK+lC,MAAMgP,aAAa+C,eAAewE,SACM,oBAAlCtC,EAAcE,iBACvBl6C,KAAK+lC,MAAMgP,aAAa4C,oBAAoBqC,EAAcE,gBAAgBp4C,KAAK9B,KAAMA,KAAK+lC,MAAO/lC,KAAK+lC,MAAMgP,aAAa8C,MAAMsD,WAAWC,QAASp7C,KAAK+lC,MAAMgP,aAAa8C,MAAMsD,WAAWC,WAIpM,GACC,CACDj4C,IAAK,uBACL6B,MAAO,WACL,IAAIu3C,EAASv8C,KACbA,KAAK47C,gBAAkB71B,YAAW,WAKhC,GAJAw2B,EAAOR,cAAe,EAClBQ,EAAOV,aACTU,EAAOV,cAELU,EAAOP,mBACTO,EAAOP,mBAC8B,oBAA1BhC,EAActD,SAAwB,CAC/C,IAAIM,EAAYgD,EAActD,QAAQ50C,KAAKy6C,EAAQA,EAAOxW,MAAOwW,EAAOxW,MAAMgP,aAAa8C,MAAMsD,WAAWC,SAC5GmB,EAAOxW,MAAMgP,aAAa8C,MAAMl7B,SAAS22B,EAAcA,EAAc,CAAC,EAAGiJ,EAAOxW,MAAMgP,aAAa8C,MAAMsD,YAAa,CAAC,EAAG,CACxHC,QAASpE,KAEXuF,EAAOxW,MAAMgP,aAAa4C,qBAAoB,QAAeX,GAC/D,CAEJ,GACF,GACC,CACD7zC,IAAK,mBACL6B,MAAO,SAA0B+gC,GAC/B,IAAIyW,EAAwBx8C,KAAK+lC,MAAMgP,aAAa8C,MAAMsD,WACxDC,EAAUoB,EAAsBpB,QAChCloC,EAAUspC,EAAsBtpC,QAChCupC,EAAqBD,EAAsBC,mBAC3CrF,EAAYoF,EAAsBpF,UAClCC,EAA0BmF,EAAsBnF,wBAChDH,EAAkBsF,EAAsBtF,gBACxC5C,EAAWkI,EAAsBlI,SAE/BD,EAAgB,CAClBnhC,QAASA,EACTkkC,UAAWA,EACXC,wBAAyBA,EACzBH,gBAAiBA,EACjB11C,MANQg7C,EAAsBh7C,OAQhC,OAAOw4C,EAAc7F,iBAAiBryC,KAAK9B,KAAM+lC,EAAOqV,EAAS/G,EAAeC,EAIhFmI,EACF,GACC,CACDt5C,IAAK,sBACL6B,MAAO,SAA6BqwC,GAClC,MAAiD,oBAAtC2E,EAAc5E,oBAChB4E,EAAc5E,oBAAoBtzC,KAAK9B,KAAMq1C,EAAkBr1C,KAAK+lC,MAAO/lC,KAAK+lC,MAAMgP,aAAa8C,MAAMsD,WAAWC,SAEtH,IACT,GACC,CACDj4C,IAAK,cACL6B,MAAO,SAAqB03C,GAC1B,MAAyC,oBAA9B1C,EAAcjD,YAChBiD,EAAcjD,YAAYj1C,KAAK9B,KAAMA,KAAK+lC,MAAO2W,GAEnD,CAAC,CACV,GACC,CACDv5C,IAAK,kBACL6B,MAAO,SAAyB23C,EAAkBD,GAChD,MAA6C,oBAAlC1C,EAAcE,gBAChBF,EAAcE,gBAAgBp4C,KAAK9B,KAAMA,KAAK+lC,MAAO4W,EAAkBD,GAEzEA,CACT,GACC,CACDv5C,IAAK,SACL6B,MAAO,WACL,IAAI43C,EAAc58C,KAAK+lC,MAErBA,GADe6W,EAAY7H,aACnByD,EAAyBoE,EAAatE,IAC5C0C,EAAgBh7C,KAAKkR,MAAM8pC,cAC/B,GAAsB,OAAlBA,EACF,OAAO,KAET,IAAI6B,EAA8C,oBAAzB7C,EAAcnF,OAAwB,CAC7DA,OAAQ70C,KAAK60C,OACbiI,UAAW98C,KAAK88C,WACd,CAAC,EACDC,EAA0E,oBAAvC/C,EAAcl/B,qBAAsC,CACzFkiC,eAAgBh9C,KAAK8a,sBACnB,CAAC,EACL,OAAoB,gBAAoBq/B,EAAU5B,EAAS,CAAC,EAAGxS,EAAOiV,EAAe6B,EAAaE,GACpG,MA1NsEpE,EAAkB+B,EAAYh6C,UAAWi6C,GAAiBC,GAAajC,EAAkB+B,EAAaE,GAAc90C,OAAOyd,eAAem3B,EAAa,YAAa,CAAE/6B,UAAU,IA4NjP06B,CACT,CA7L6B,CA6L3B,EAAA4C,WAOF,OANA1J,EAAgB8G,EAAW,cAAe,GAAGj1C,OAAO40C,EAAcjG,YAAa,KAAK3uC,QAAO,QAAe+0C,GAAW,MACrH5G,EAAgB8G,EAAW,SAAUL,EAAchG,QACnDT,EAAgB8G,EAAW,eAAgBD,EAA2B8C,cACtE3J,EAAgB8G,EAAW,YAAaL,EAAc/F,WACtDV,EAAgB8G,EAAW,eAAgBL,EAAc3D,cACzD9C,EAAgB8G,EAAW,iBAAkBL,GACtCK,CACT,CACF,CAiBA,QAhBiC,SAAoCL,GACnE,OAAO,SAAUG,EAAUC,GACzB,IAAIC,EAAYN,EAA8BC,EAA9BD,CAA6CI,EAAUC,GAWvE,OAVuB,SAA0BrU,GAC/C,OAAoB,gBAAoB,KAAuB,MAAM,SAAUgP,GAC7E,OAAoB,gBAAoB,KAAe,MAAM,SAAUE,GACrE,OAAoB,gBAAoBoF,EAAW9B,EAAS,CAC1DxD,aAAcA,EACdE,kBAAmBA,GAClBlP,GACL,GACF,GACF,CAEF,CACF,8GC/PA,SAASkN,EAAQ3yB,GAAkC,OAAO2yB,EAAU,mBAAqBnvB,QAAU,iBAAmBA,OAAOC,SAAW,SAAUzD,GAAO,cAAcA,CAAK,EAAI,SAAUA,GAAO,OAAOA,GAAO,mBAAqBwD,QAAUxD,EAAInW,cAAgB2Z,QAAUxD,IAAQwD,OAAOpjB,UAAY,gBAAkB4f,CAAK,EAAG2yB,EAAQ3yB,EAAM,CAC/U,SAAS4yB,EAAQ9xB,EAAQ+xB,GAAkB,IAAIptC,EAAOD,OAAOC,KAAKqb,GAAS,GAAItb,OAAO0d,sBAAuB,CAAE,IAAI4vB,EAAUttC,OAAO0d,sBAAsBpC,GAAS+xB,IAAmBC,EAAUA,EAAQhtC,QAAO,SAAUitC,GAAO,OAAOvtC,OAAO2d,yBAAyBrC,EAAQiyB,GAAK3zB,UAAY,KAAK3Z,EAAKzD,KAAKL,MAAM8D,EAAMqtC,EAAU,CAAE,OAAOrtC,CAAM,CACpV,SAASutC,EAAcrzB,GAAU,IAAK,IAAI3e,EAAI,EAAGA,EAAII,UAAUD,OAAQH,IAAK,CAAE,IAAIwd,EAAS,MAAQpd,UAAUJ,GAAKI,UAAUJ,GAAK,CAAC,EAAGA,EAAI,EAAI4xC,EAAQptC,OAAOgZ,IAAS,GAAIzW,SAAQ,SAAUlF,GAAOowC,EAAgBtzB,EAAQ9c,EAAK2b,EAAO3b,GAAO,IAAK2C,OAAO4d,0BAA4B5d,OAAO6d,iBAAiB1D,EAAQna,OAAO4d,0BAA0B5E,IAAWo0B,EAAQptC,OAAOgZ,IAASzW,SAAQ,SAAUlF,GAAO2C,OAAOyd,eAAetD,EAAQ9c,EAAK2C,OAAO2d,yBAAyB3E,EAAQ3b,GAAO,GAAI,CAAE,OAAO8c,CAAQ,CACzf,SAASszB,EAAgBjzB,EAAKnd,EAAK6B,GAA4L,OAAnL7B,EAC5C,SAAwB9C,GAAO,IAAI8C,EACnC,SAAsBqwC,EAAOC,GAAQ,GAAuB,WAAnBR,EAAQO,IAAiC,OAAVA,EAAgB,OAAOA,EAAO,IAAIE,EAAOF,EAAM1vB,OAAO6vB,aAAc,QAAaxzC,IAATuzC,EAAoB,CAAE,IAAIv7B,EAAMu7B,EAAK5xC,KAAK0xC,EAAOC,GAAQ,WAAY,GAAqB,WAAjBR,EAAQ96B,GAAmB,OAAOA,EAAK,MAAM,IAAIpX,UAAU,+CAAiD,CAAE,OAAiB,WAAT0yC,EAAoB10B,OAAS60B,QAAQJ,EAAQ,CADnVK,CAAaxzC,EAAK,UAAW,MAAwB,WAAjB4yC,EAAQ9vC,GAAoBA,EAAM4b,OAAO5b,EAAM,CAD1E2wC,CAAe3wC,MAAiBmd,EAAOxa,OAAOyd,eAAejD,EAAKnd,EAAK,CAAE6B,MAAOA,EAAO0a,YAAY,EAAME,cAAc,EAAMD,UAAU,IAAkBW,EAAInd,GAAO6B,EAAgBsb,CAAK,CAIpO,SAAS68B,EAAWt7C,GACzB,OAAOu7C,EAAmBv7C,GAAWA,EAAQmzC,kBAAkBqI,cAAgBx7C,EAAQizC,IAAIiD,iBAC7F,CAMO,SAASuF,EAAWjJ,EAAexyC,GACxC,GAAIwyC,EAAcnhC,QAAS,CACzB,GAAImhC,EAAcnhC,QAAQ8X,KACxB,OAAOqpB,EAAcnhC,QAEvB,IAAIqqC,EAAUJ,EAAWt7C,GACzB,GAAIwyC,EAAcnhC,QAAQqqC,GACxB,OAAOlJ,EAAcnhC,QAAQqqC,EAEjC,CACA,OAAO,IACT,CACO,SAASH,EAAmBv7C,GACjC,OAAOA,GAAWA,EAAQmzC,iBAC5B,CACO,SAASwI,EAAYpJ,EAAa4B,EAAgBn0C,EAASsO,EAAWmlC,GAC3E,GAAI8H,EAAmBv7C,GAAU,CAC/B,IAAI07C,EAAUJ,EAAWt7C,GACzB,OAAOyzC,EAoCX,SAAuClB,EAAa4B,EAAgBuH,EAASptC,EAAWmlC,GACtF,IAAImI,EACA3yC,EAAOqF,EAAY,CACrBrF,KAAM,QACJ3K,EACA+Q,EAAQkjC,EAAY3gC,SAAW2gC,EAAY3gC,QAAQ8pC,GAAWjK,EAAcA,EAAc,CAAC,EAAGc,EAAY3gC,SAAU,CAAC,EAAG8/B,EAAgB,CAAC,EAAGgK,EAASjK,EAAcA,EAAc,CAAC,EAAGc,EAAY3gC,QAAQ8pC,IAAW,CAAC,GAAyBhK,EAArBkK,EAAiB,CAAC,EAAmCnI,EAAWhC,EAAcA,EAAc,CAAC,EAAGc,EAAY3gC,QAAQ8pC,GAASjI,IAAaU,IAAkBzC,EAAgBkK,EAAgB,OAAQ,GAAIA,MAAqBnK,EAAcA,EAAc,CAAC,EAAGc,EAAY3gC,SAAU,CAAC,EAAG8/B,EAAgB,CAAC,EAAGgK,EAASjK,EAAcC,EAAgB,CAAC,EAAG+B,EAAWU,GAAiBlrC,KAC/kB,OAAOwoC,EAAcA,EAAc,CAAC,EAAGc,GAAc,CAAC,EAAG,CACvD3gC,QAASvC,GAEb,CA7CuBwsC,CAA8BtJ,EAAa4B,EAAgBuH,EAASptC,EAAWmlC,GAqBtG,SAA0BlB,EAAa4B,EAAgBuH,EAASptC,GAC9D,IAAIrF,EAAOqF,EAAY,CACrBrF,KAAM,QACJ3K,EACA+Q,EAAQkjC,EAAY3gC,SAAW2gC,EAAY3gC,QAAQ8pC,GAAWjK,EAAcA,EAAc,CAAC,EAAGc,EAAY3gC,SAAU,CAAC,EAAG8/B,EAAgB,CAAC,EAAGgK,EAASjK,EAAcA,EAAcA,EAAc,CAAC,EAAGc,EAAY3gC,QAAQ8pC,IAAWvH,GAAiBlrC,KAAUwoC,EAAcA,EAAc,CAAC,EAAGc,EAAY3gC,SAAU,CAAC,EAAG8/B,EAAgB,CAAC,EAAGgK,EAASjK,EAAcA,EAAc,CAAC,EAAG0C,GAAiBlrC,KACzY,OAAOwoC,EAAcA,EAAc,CAAC,EAAGc,GAAc,CAAC,EAAG,CACvD3gC,QAASvC,GAEb,CA7BmHysC,CAAiBvJ,EAAa4B,EAAgBuH,EAASptC,EACxK,CAiBE,OAXIikC,EAAY3gC,SAAWtD,GACzBrK,OAAOC,KAAKquC,EAAY3gC,SAASpL,SAAQ,SAAUg1C,GACjDjJ,EAAcoJ,EAAYpJ,EAAa,CACrCtpC,KAAM,GACL,CACDkqC,kBAAmB,CACjBqI,cAAeA,KAEhB,EAAM/H,EACX,IAEKA,EA4BX,SAAwClB,EAAa4B,EAAgB7lC,EAAWmlC,GAC9E,IAAIxqC,EAAOqF,EAAY,CACrBrF,KAAM,QACJ3K,EACJ,OAAOmzC,EAAcA,EAAc,CAAC,EAAGc,GAAc,CAAC,EAAGb,EAAgB,CAAC,EAAG+B,EAAWhC,EAAcA,EAAc,CAAC,EAAGc,EAAYkB,IAAaU,IAAkBlrC,EACrK,CAjCuB8yC,CAA+BxJ,EAAa4B,EAAgB7lC,EAAWmlC,GAY9F,SAA2BlB,EAAa4B,EAAgB7lC,GACtD,IAAIrF,EAAOqF,EAAY,CACrBrF,KAAM,QACJ3K,EACJ,OAAOmzC,EAAcA,EAAcA,EAAc,CAAC,EAAGc,GAAc4B,GAAiBlrC,EACtF,CAjB2G+yC,CAAkBzJ,EAAa4B,EAAgB7lC,EAE1J,CAgCA,SAAS2tC,EAA6BpJ,GACpC,IAAI/hC,EAAQ+hC,EAAG5I,MAAM,kBAGrB,MAAO,CACLwJ,UAHc3iC,GAASA,EAAM,GAI7BqE,cAHkBrE,GAASA,EAAM,GAKrC,CAqCO,SAASorC,EAA0BhY,EAAOqO,EAAavyC,EAAS6yC,EAAI3H,GACzE,IAAIwQ,EAAUJ,EAAWt7C,GACrBm8C,EAAwBF,EAA6BpJ,GACvDY,EAAY0I,EAAsB1I,UAClCt+B,EAAgBgnC,EAAsBhnC,cAEpC3V,EAAO,CACT48C,WAFeb,EAAmBv7C,GAGlC07C,QAASA,EACTjI,UAAWA,EACXt+B,cAAeA,EACf09B,GAAIA,EACJN,YAAaA,GAEX8J,EAlDN,SAAwBvI,GACtB,IAAIsI,EAAatI,EAAKsI,WACpBV,EAAU5H,EAAK4H,QACfjI,EAAYK,EAAKL,UACjBt+B,EAAgB2+B,EAAK3+B,cACrB09B,EAAKiB,EAAKjB,GACVN,EAAcuB,EAAKvB,YACrB,OAAI6J,GAAc3I,EACTlB,EAAY3gC,SAAW2gC,EAAY3gC,QAAQ8pC,IAAYnJ,EAAY3gC,QAAQ8pC,GAASjI,IAAcxvC,OAAOoa,eAAepe,KAAKsyC,EAAY3gC,QAAQ8pC,GAASjI,GAAYt+B,GAE3KinC,EACK7J,EAAY3gC,SAAW2gC,EAAY3gC,QAAQ8pC,IAAYz3C,OAAOoa,eAAepe,KAAKsyC,EAAY3gC,QAAQ8pC,GAAU7I,GAErHY,EACKlB,EAAYkB,IAAcxvC,OAAOoa,eAAepe,KAAKsyC,EAAYkB,GAAYt+B,GAE/ElR,OAAOoa,eAAepe,KAAKsyC,EAAaM,EACjD,CAiC4B53B,CAAezb,GACzC,OAAI68C,EAjCN,SAAwB7C,GACtB,IAAI4C,EAAa5C,EAAM4C,WACrBV,EAAUlC,EAAMkC,QAChBjI,EAAY+F,EAAM/F,UAClBt+B,EAAgBqkC,EAAMrkC,cACtB09B,EAAK2G,EAAM3G,GACXN,EAAciH,EAAMjH,YACtB,OAAI6J,GAAc3I,EACTlB,EAAY3gC,QAAQ8pC,GAASjI,GAAWt+B,GAE7CinC,EACK7J,EAAY3gC,QAAQ8pC,GAAS7I,GAElCY,EACKlB,EAAYkB,GAAWt+B,GAEzBo9B,EAAYM,EACrB,CAiBWx8B,CAAe7W,GAEpB0kC,EAAMoQ,kBACDpQ,EAAMoQ,kBAERpJ,CACT,CACO,SAASoR,EAAa/J,EAAavyC,EAAS6yC,GACjD,IAAI6I,EAAUJ,EAAWt7C,GACrBu8C,EAAyBN,EAA6BpJ,GACxDY,EAAY8I,EAAuB9I,UACnCt+B,EAAgBonC,EAAuBpnC,cACzC,OAAIomC,EAAmBv7C,IAAY0E,QAAQ6tC,EAAY3gC,SA0BzD,SAAoC4qC,GAClC,IAAIjK,EAAciK,EAAMjK,YACtBmJ,EAAUc,EAAMd,QAChB7I,EAAK2J,EAAM3J,GACXY,EAAY+I,EAAM/I,UAClBvwC,EAAYs5C,EAAMt5C,UAChBu5C,EAAmBlK,EAAY3gC,QAAQ8pC,GAC3C,GAAIjI,GAAagJ,EACf,OAAOhL,EAAcA,EAAc,CAAC,EAAGc,GAAc,CAAC,EAAG,CACvD3gC,QAAS6/B,EAAcA,EAAc,CAAC,EAAGc,EAAY3gC,SAAU,CAAC,EAAG8/B,EAAgB,CAAC,EAAGgK,EAASjK,EAAcA,EAAc,CAAC,EAAGgL,GAAmB,CAAC,EAAG/K,EAAgB,CAAC,EAAG+B,GAAW,QAAKgJ,EAAiBhJ,GAAY,CAACvwC,UAG7N,GAAIu5C,EACF,OAAOhL,EAAcA,EAAc,CAAC,EAAGc,GAAc,CAAC,EAAG,CACvD3gC,QAAS6/B,EAAcA,EAAc,CAAC,EAAGc,EAAY3gC,SAAU,CAAC,EAAG8/B,EAAgB,CAAC,EAAGgK,GAAS,QAAKe,EAAkB,CAAC5J,QAG5H,OAAON,CACT,CA3CWmK,CAA2B,CAChCx5C,UAAWiS,EACXo9B,YAAaA,EACbmJ,QAASA,EACT7I,GAAIA,EACJY,UAAWA,IAUjB,SAAqCkG,GACnC,IAAIpH,EAAcoH,EAAMpH,YACtBM,EAAK8G,EAAM9G,GACXY,EAAYkG,EAAMlG,UAClBvwC,EAAYy2C,EAAMz2C,UACpB,GAAIuwC,EACF,OAAOhC,EAAcA,EAAc,CAAC,EAAGc,GAAc,CAAC,EAAGb,EAAgB,CAAC,EAAG+B,GAAW,QAAKlB,EAAYkB,GAAY,CAACvwC,MAExH,OAAO,QAAKqvC,EAAa,CAACM,GAC5B,CAhBS8J,CAA4B,CACjCz5C,UAAWiS,EACXo9B,YAAaA,EACbM,GAAIA,EACJY,UAAWA,GAEf,gEC7KA,SAASrC,EAAQ3yB,GAAkC,OAAO2yB,EAAU,mBAAqBnvB,QAAU,iBAAmBA,OAAOC,SAAW,SAAUzD,GAAO,cAAcA,CAAK,EAAI,SAAUA,GAAO,OAAOA,GAAO,mBAAqBwD,QAAUxD,EAAInW,cAAgB2Z,QAAUxD,IAAQwD,OAAOpjB,UAAY,gBAAkB4f,CAAK,EAAG2yB,EAAQ3yB,EAAM,CAC/U,SAASi4B,IAAiS,OAApRA,EAAWzyC,OAAOqgB,OAASrgB,OAAOqgB,OAAOrI,OAAS,SAAUmC,GAAU,IAAK,IAAI3e,EAAI,EAAGA,EAAII,UAAUD,OAAQH,IAAK,CAAE,IAAIwd,EAASpd,UAAUJ,GAAI,IAAK,IAAI6B,KAAO2b,EAAchZ,OAAOpF,UAAUwf,eAAepe,KAAKgd,EAAQ3b,KAAQ8c,EAAO9c,GAAO2b,EAAO3b,GAAU,CAAE,OAAO8c,CAAQ,EAAUs4B,EAASt2C,MAAMjC,KAAM0B,UAAY,CAElV,SAASi3C,EAAkB14B,EAAQ8lB,GAAS,IAAK,IAAIzkC,EAAI,EAAGA,EAAIykC,EAAMtkC,OAAQH,IAAK,CAAE,IAAIs3C,EAAa7S,EAAMzkC,GAAIs3C,EAAWl5B,WAAak5B,EAAWl5B,aAAc,EAAOk5B,EAAWh5B,cAAe,EAAU,UAAWg5B,IAAYA,EAAWj5B,UAAW,GAAM7Z,OAAOyd,eAAetD,EAAQ6zB,EAAe8E,EAAWz1C,KAAMy1C,EAAa,CAAE,CAG5U,SAASC,EAAgBj1B,EAAG4C,GAA6I,OAAxIqyB,EAAkB/yC,OAAOgzC,eAAiBhzC,OAAOgzC,eAAeh7B,OAAS,SAAyB8F,EAAG4C,GAAsB,OAAjB5C,EAAEm1B,UAAYvyB,EAAU5C,CAAG,EAAUi1B,EAAgBj1B,EAAG4C,EAAI,CACvM,SAASwyB,EAAaC,GAAW,IAAIC,EAGrC,WAAuC,GAAuB,qBAAZC,UAA4BA,QAAQC,UAAW,OAAO,EAAO,GAAID,QAAQC,UAAUC,KAAM,OAAO,EAAO,GAAqB,oBAAVC,MAAsB,OAAO,EAAM,IAAsF,OAAhF/yC,QAAQ7F,UAAUumC,QAAQnlC,KAAKq3C,QAAQC,UAAU7yC,QAAS,IAAI,WAAa,MAAY,CAAM,CAAE,MAAO2T,GAAK,OAAO,CAAO,CAAE,CAHvQq/B,GAA6B,OAAO,WAAkC,IAAsCnlC,EAAlColC,EAAQC,EAAgBR,GAAkB,GAAIC,EAA2B,CAAE,IAAIQ,EAAYD,EAAgBz5C,MAAMmK,YAAaiK,EAAS+kC,QAAQC,UAAUI,EAAO93C,UAAWg4C,EAAY,MAAStlC,EAASolC,EAAMv3C,MAAMjC,KAAM0B,WAAc,OACpX,SAAoC0G,EAAMtG,GAAQ,GAAIA,IAA2B,WAAlBmxC,EAAQnxC,IAAsC,oBAATA,GAAwB,OAAOA,EAAa,QAAa,IAATA,EAAmB,MAAM,IAAIf,UAAU,4DAA+D,OAAO44C,EAAuBvxC,EAAO,CAD4FwxC,CAA2B55C,KAAMoU,EAAS,CAAG,CAExa,SAASulC,EAAuBvxC,GAAQ,QAAa,IAATA,EAAmB,MAAM,IAAIyxC,eAAe,6DAAgE,OAAOzxC,CAAM,CAErK,SAASqxC,EAAgB71B,GAA+J,OAA1J61B,EAAkB3zC,OAAOgzC,eAAiBhzC,OAAOg0C,eAAeh8B,OAAS,SAAyB8F,GAAK,OAAOA,EAAEm1B,WAAajzC,OAAOg0C,eAAel2B,EAAI,EAAU61B,EAAgB71B,EAAI,CAEnN,SAASkwB,EAAezzC,GAAO,IAAI8C,EACnC,SAAsBqwC,EAAOC,GAAQ,GAAuB,WAAnBR,EAAQO,IAAiC,OAAVA,EAAgB,OAAOA,EAAO,IAAIE,EAAOF,EAAM1vB,OAAO6vB,aAAc,QAAaxzC,IAATuzC,EAAoB,CAAE,IAAIv7B,EAAMu7B,EAAK5xC,KAAK0xC,EAAOC,GAAQ,WAAY,GAAqB,WAAjBR,EAAQ96B,GAAmB,OAAOA,EAAK,MAAM,IAAIpX,UAAU,+CAAiD,CAAE,OAAiB,WAAT0yC,EAAoB10B,OAAS60B,QAAQJ,EAAQ,CADnVK,CAAaxzC,EAAK,UAAW,MAAwB,WAAjB4yC,EAAQ9vC,GAAoBA,EAAM4b,OAAO5b,EAAM,CAG5H,IAAIs7C,EAAmB,SAA0B14C,GAC/C,OAAO,SAAUggC,EAAO2Y,EAAUC,GAChC,IAAIC,EAAO7Y,EAAM2Y,GACjB,GAAIE,EAEF,IAAK,IAAIC,EAAK,EAAGC,EAAeh5C,OAAOC,KAAK64C,GAAOC,EAAKC,EAAar9C,OAAQo9C,IAAM,CACjF,IAAI17C,EAAM27C,EAAaD,GACvB,IAA2B,IAAvB94C,EAAKU,QAAQtD,GACf,OAAO,IAAIxB,MAAM,YAAYyD,OAAOs5C,EAAU,WAAWt5C,OAAOjC,EAAK,+BAAiC,OAAOiC,OAAOu5C,EAAe,MAEvI,CAGJ,CACF,EACe,SAASI,EAAaC,GACnC,OAAO,SAAU7E,GACf,IAAI8E,EAA4B,SAAU3E,IA5B9C,SAAmBC,EAAUC,GAAc,GAA0B,oBAAfA,GAA4C,OAAfA,EAAuB,MAAM,IAAIz5C,UAAU,sDAAyDw5C,EAAS75C,UAAYoF,OAAO2Z,OAAO+6B,GAAcA,EAAW95C,UAAW,CAAEyJ,YAAa,CAAEnF,MAAOu1C,EAAU56B,UAAU,EAAMC,cAAc,KAAW9Z,OAAOyd,eAAeg3B,EAAU,YAAa,CAAE56B,UAAU,IAAc66B,GAAY3B,EAAgB0B,EAAUC,EAAa,CA6B7bC,CAAUwE,EAAc3E,GACxB,IA/BgBI,EAAaC,EAAYC,EA+BrCC,EAAS7B,EAAaiG,GAC1B,SAASA,IACP,IAAInE,EAzBax6B,EAAKnd,EAAK6B,GAVnC,SAAyBuE,EAAUmxC,GAAe,KAAMnxC,aAAoBmxC,GAAgB,MAAM,IAAI35C,UAAU,oCAAwC,CAoChJg6C,CAAgB/6C,KAAMi/C,GACtB,IAAK,IAAIhE,EAAOv5C,UAAUD,OAAQJ,EAAO,IAAIU,MAAMk5C,GAAOC,EAAO,EAAGA,EAAOD,EAAMC,IAC/E75C,EAAK65C,GAAQx5C,UAAUw5C,GAczB,OAZAJ,EAAQD,EAAO/4C,KAAKG,MAAM44C,EAAQ,CAAC76C,MAAMoF,OAAO/D,IA9B/Bif,EA+BDq5B,EAAuBmB,GA/BZ91C,EA+BiC,SAAU7B,GACpE,IAAI+7C,EAAepE,EAAM/U,MAAMmZ,aAC3BC,EAAcD,GAAgBA,EAAah/B,eAAe/c,GAAO+7C,EAAa/7C,GAAO67C,EAAoB77C,GAC7G,GAA2B,oBAAhBg8C,EAA4B,CACrC,IAAK,IAAI7D,EAAQ55C,UAAUD,OAAQ8F,EAAS,IAAIxF,MAAMu5C,EAAQ,EAAIA,EAAQ,EAAI,GAAIC,EAAQ,EAAGA,EAAQD,EAAOC,IAC1Gh0C,EAAOg0C,EAAQ,GAAK75C,UAAU65C,GAEhC,OAAO4D,EAAYl9C,WAAM,EAAQsF,EACnC,CACA,OAAO43C,CACT,GAzCoCh8C,EAAM2wC,EAApB3wC,EA+ByB,gBA/B2Bmd,EAAOxa,OAAOyd,eAAejD,EAAKnd,EAAK,CAAE6B,MAAOA,EAAO0a,YAAY,EAAME,cAAc,EAAMD,UAAU,IAAkBW,EAAInd,GAAO6B,EA0CvM81C,CACT,CASA,OA5DgBJ,EAoDHuE,GApDgBtE,EAoDF,CAAC,CAC1Bx3C,IAAK,SACL6B,MAAO,WACL,OAAoB,gBAAoBm1C,EAAU5B,EAAS,CACzD6G,UAAWp/C,KAAKo/C,WACfp/C,KAAK+lC,OACV,MA1DsE4S,EAAkB+B,EAAYh6C,UAAWi6C,GAAiBC,GAAajC,EAAkB+B,EAAaE,GAAc90C,OAAOyd,eAAem3B,EAAa,YAAa,CAAE/6B,UAAU,IA4DjPs/B,CACT,CAhCgC,CAgC9B,EAAAhC,WACErzC,EAAOuwC,EAASpG,aAAeoG,EAASvwC,MAAQ,mBAKpD,OAJAq1C,EAAalL,YAAc,gBAAgB3uC,OAAOwE,EAAM,KACxDq1C,EAAahL,UAAY,CACvBiL,aAAcT,EAAiB34C,OAAOC,KAAKi5C,KAEtCC,CACT,CACF,gCCzEA,SAAS/L,EAAQ9xB,EAAQ+xB,GAAkB,IAAIptC,EAAOD,OAAOC,KAAKqb,GAAS,GAAItb,OAAO0d,sBAAuB,CAAE,IAAI4vB,EAAUttC,OAAO0d,sBAAsBpC,GAAS+xB,IAAmBC,EAAUA,EAAQhtC,QAAO,SAAUitC,GAAO,OAAOvtC,OAAO2d,yBAAyBrC,EAAQiyB,GAAK3zB,UAAY,KAAK3Z,EAAKzD,KAAKL,MAAM8D,EAAMqtC,EAAU,CAAE,OAAOrtC,CAAM,CACpV,SAASutC,EAAcrzB,GAAU,IAAK,IAAI3e,EAAI,EAAGA,EAAII,UAAUD,OAAQH,IAAK,CAAE,IAAIwd,EAAS,MAAQpd,UAAUJ,GAAKI,UAAUJ,GAAK,CAAC,EAAGA,EAAI,EAAI4xC,EAAQptC,OAAOgZ,IAAS,GAAIzW,SAAQ,SAAUlF,GAAOowC,EAAgBtzB,EAAQ9c,EAAK2b,EAAO3b,GAAO,IAAK2C,OAAO4d,0BAA4B5d,OAAO6d,iBAAiB1D,EAAQna,OAAO4d,0BAA0B5E,IAAWo0B,EAAQptC,OAAOgZ,IAASzW,SAAQ,SAAUlF,GAAO2C,OAAOyd,eAAetD,EAAQ9c,EAAK2C,OAAO2d,yBAAyB3E,EAAQ3b,GAAO,GAAI,CAAE,OAAO8c,CAAQ,CACzf,SAASszB,EAAgBjzB,EAAKnd,EAAK6B,GAA4L,OAAnL7B,EAC5C,SAAwB9C,GAAO,IAAI8C,EACnC,SAAsBqwC,EAAOC,GAAQ,GAAuB,WAAnBR,EAAQO,IAAiC,OAAVA,EAAgB,OAAOA,EAAO,IAAIE,EAAOF,EAAM1vB,OAAO6vB,aAAc,QAAaxzC,IAATuzC,EAAoB,CAAE,IAAIv7B,EAAMu7B,EAAK5xC,KAAK0xC,EAAOC,GAAQ,WAAY,GAAqB,WAAjBR,EAAQ96B,GAAmB,OAAOA,EAAK,MAAM,IAAIpX,UAAU,+CAAiD,CAAE,OAAiB,WAAT0yC,EAAoB10B,OAAS60B,QAAQJ,EAAQ,CADnVK,CAAaxzC,EAAK,UAAW,MAAwB,WAAjB4yC,EAAQ9vC,GAAoBA,EAAM4b,OAAO5b,EAAM,CAD1E2wC,CAAe3wC,MAAiBmd,EAAOxa,OAAOyd,eAAejD,EAAKnd,EAAK,CAAE6B,MAAOA,EAAO0a,YAAY,EAAME,cAAc,EAAMD,UAAU,IAAkBW,EAAInd,GAAO6B,EAAgBsb,CAAK,CAG3O,SAAS2yB,EAAQ3yB,GAAkC,OAAO2yB,EAAU,mBAAqBnvB,QAAU,iBAAmBA,OAAOC,SAAW,SAAUzD,GAAO,cAAcA,CAAK,EAAI,SAAUA,GAAO,OAAOA,GAAO,mBAAqBwD,QAAUxD,EAAInW,cAAgB2Z,QAAUxD,IAAQwD,OAAOpjB,UAAY,gBAAkB4f,CAAK,EAAG2yB,EAAQ3yB,EAAM,kFAE/U,IAAI++B,EAASv5C,OAAOpF,UAAUwf,eAGnBo/B,EAAe,SAAsBC,EAAMC,GACpD,GAAID,IAASC,EACX,OAAO,EAET,IAAIC,EAAQ35C,OAAOC,KAAKw5C,GACpBG,EAAQ55C,OAAOC,KAAKy5C,GACxB,GAAIC,EAAMh+C,SAAWi+C,EAAMj+C,OACzB,OAAO,EAIT,IAAK,IAAIH,EAAI,EAAGA,EAAIm+C,EAAMh+C,OAAQH,IAChC,IAAK+9C,EAAOv9C,KAAK09C,EAAMC,EAAMn+C,KAAOi+C,EAAKE,EAAMn+C,MAAQk+C,EAAKC,EAAMn+C,IAChE,OAAO,EAGX,OAAO,CACT,EACWq+C,EAAiB,SAAwB1C,GAClD,OAAOA,EAAUlJ,aAAekJ,EAAUrzC,MAAQ,kBACpD,EACIg2C,EAAWtlC,QAAQC,UACZslC,EAAQ,SAAep6C,GAChCm6C,EAAS7lC,KAAKtU,EAChB,EAIWq6C,EAAiB,SAASA,EAAex/B,GAYlD,OAXAxa,OAAOC,KAAKua,GAAKjY,SAAQ,SAAUlF,GACjC,IAiD0Bie,EAjDtBpc,EAAQsb,EAAInd,IALA,SAAuB6B,GACzC,MAA0B,WAAnBiuC,EAAQjuC,IAAiC,OAAVA,IAAmBjD,MAAMoF,QAAQnC,EACzE,EAIS+6C,CAAc/6C,MAgDOoc,EA7CPpc,IA8CJc,OAAOC,KAAKqb,GAAQ3f,OAAS,EA3C1Cq+C,EAAe96C,UAFRsb,EAAInd,GAIf,IACOmd,CACT,EAUO,SAAS0/B,EAAqBh1B,EAAM9f,EAAaJ,GACtD,OAAOkgB,EAAKhiB,KAAI,SAAUi3C,EAAKr8C,GAC7B,OAAO0vC,EAAcA,EAAc,CAAC,EAAG2M,GAAM,CAAC,EAAG,CAC/CC,WAAYh1C,EAAcJ,EAAOlH,EAAQ,GAE7C,GACF,CACO,SAASu8C,EAAWn1B,EAAMmqB,GAC/B,OAAKA,EAGEnqB,EAAKhiB,KAAI,SAAUi3C,GACxB,OAAO3M,EAAcA,EAAc,CAAC,EAAG2M,GAAM,CAAC,EAAG,CAC/CG,UAAWjL,GAEf,IANSnqB,CAOX,CAiBO,SAASrmB,EAAKma,EAAQyB,GAC3B,GAAe,OAAXzB,QAA8B3e,IAAX2e,EACrB,MAAO,CAAC,EAIV,IAFA,IAAImB,EAAS,CAAC,EACVO,EAAa1a,OAAOC,KAAK+Y,GACpBxd,EAAI,EAAGA,EAAIkf,EAAW/e,OAAQH,IAAK,CAC1C,IAAI6B,EAAMqd,EAAWlf,GACjBif,EAAS9Z,QAAQtD,IAAQ,IAI7B8c,EAAO9c,GAAO2b,EAAO3b,GACvB,CACA,OAAO8c,CACT,CA2BO,SAASjN,EAAmBhO,GACjC,OAAOA,EAAMgR,QAAQ,OAAQ,IAC/B,qJCzIO,IAAIqqC,EAAiB,CAC1BC,gBAAiB,6BACjBC,iBAAkB,8CCHpB,IAAIjI,EAAY,CAAC,sBACfkI,EAAa,CAAC,sBACdC,EAAa,CAAC,sBAChB,SAASxN,EAAQ3yB,GAAkC,OAAO2yB,EAAU,mBAAqBnvB,QAAU,iBAAmBA,OAAOC,SAAW,SAAUzD,GAAO,cAAcA,CAAK,EAAI,SAAUA,GAAO,OAAOA,GAAO,mBAAqBwD,QAAUxD,EAAInW,cAAgB2Z,QAAUxD,IAAQwD,OAAOpjB,UAAY,gBAAkB4f,CAAK,EAAG2yB,EAAQ3yB,EAAM,CAC/U,SAASk4B,EAAyB15B,EAAQyB,GAAY,GAAc,MAAVzB,EAAgB,MAAO,CAAC,EAAG,IAAkE3b,EAAK7B,EAAnE2e,EACzF,SAAuCnB,EAAQyB,GAAY,GAAc,MAAVzB,EAAgB,MAAO,CAAC,EAAG,IAA2D3b,EAAK7B,EAA5D2e,EAAS,CAAC,EAAOO,EAAa1a,OAAOC,KAAK+Y,GAAqB,IAAKxd,EAAI,EAAGA,EAAIkf,EAAW/e,OAAQH,IAAO6B,EAAMqd,EAAWlf,GAAQif,EAAS9Z,QAAQtD,IAAQ,IAAa8c,EAAO9c,GAAO2b,EAAO3b,IAAQ,OAAO8c,CAAQ,CADhNw4B,CAA8B35B,EAAQyB,GAAuB,GAAIza,OAAO0d,sBAAuB,CAAE,IAAIk1B,EAAmB5yC,OAAO0d,sBAAsB1E,GAAS,IAAKxd,EAAI,EAAGA,EAAIo3C,EAAiBj3C,OAAQH,IAAO6B,EAAMu1C,EAAiBp3C,GAAQif,EAAS9Z,QAAQtD,IAAQ,GAAkB2C,OAAOpF,UAAUmjB,qBAAqB/hB,KAAKgd,EAAQ3b,KAAgB8c,EAAO9c,GAAO2b,EAAO3b,GAAQ,CAAE,OAAO8c,CAAQ,CAE3e,SAASizB,EAAQ9xB,EAAQ+xB,GAAkB,IAAIptC,EAAOD,OAAOC,KAAKqb,GAAS,GAAItb,OAAO0d,sBAAuB,CAAE,IAAI4vB,EAAUttC,OAAO0d,sBAAsBpC,GAAS+xB,IAAmBC,EAAUA,EAAQhtC,QAAO,SAAUitC,GAAO,OAAOvtC,OAAO2d,yBAAyBrC,EAAQiyB,GAAK3zB,UAAY,KAAK3Z,EAAKzD,KAAKL,MAAM8D,EAAMqtC,EAAU,CAAE,OAAOrtC,CAAM,CACpV,SAASutC,EAAcrzB,GAAU,IAAK,IAAI3e,EAAI,EAAGA,EAAII,UAAUD,OAAQH,IAAK,CAAE,IAAIwd,EAAS,MAAQpd,UAAUJ,GAAKI,UAAUJ,GAAK,CAAC,EAAGA,EAAI,EAAI4xC,EAAQptC,OAAOgZ,IAAS,GAAIzW,SAAQ,SAAUlF,GAAOowC,EAAgBtzB,EAAQ9c,EAAK2b,EAAO3b,GAAO,IAAK2C,OAAO4d,0BAA4B5d,OAAO6d,iBAAiB1D,EAAQna,OAAO4d,0BAA0B5E,IAAWo0B,EAAQptC,OAAOgZ,IAASzW,SAAQ,SAAUlF,GAAO2C,OAAOyd,eAAetD,EAAQ9c,EAAK2C,OAAO2d,yBAAyB3E,EAAQ3b,GAAO,GAAI,CAAE,OAAO8c,CAAQ,CACzf,SAASszB,EAAgBjzB,EAAKnd,EAAK6B,GAA4L,OAAnL7B,EAC5C,SAAwB9C,GAAO,IAAI8C,EACnC,SAAsBqwC,EAAOC,GAAQ,GAAuB,WAAnBR,EAAQO,IAAiC,OAAVA,EAAgB,OAAOA,EAAO,IAAIE,EAAOF,EAAM1vB,OAAO6vB,aAAc,QAAaxzC,IAATuzC,EAAoB,CAAE,IAAIv7B,EAAMu7B,EAAK5xC,KAAK0xC,EAAOC,GAAQ,WAAY,GAAqB,WAAjBR,EAAQ96B,GAAmB,OAAOA,EAAK,MAAM,IAAIpX,UAAU,+CAAiD,CAAE,OAAiB,WAAT0yC,EAAoB10B,OAAS60B,QAAQJ,EAAQ,CADnVK,CAAaxzC,EAAK,UAAW,MAAwB,WAAjB4yC,EAAQ9vC,GAAoBA,EAAM4b,OAAO5b,EAAM,CAD1E2wC,CAAe3wC,MAAiBmd,EAAOxa,OAAOyd,eAAejD,EAAKnd,EAAK,CAAE6B,MAAOA,EAAO0a,YAAY,EAAME,cAAc,EAAMD,UAAU,IAAkBW,EAAInd,GAAO6B,EAAgBsb,CAAK,CAU3O,SAASogC,EAAiBC,GACoB,oBAAjCA,EAAajoC,kBACtBioC,EAAajoC,gBAAgB,UAAUtT,OAAO,UAAc,MAC5Du7C,EAAajoC,gBAAgB,wBAAwBtT,OCrBzD,SDqByE,MAEzE,CACA,IAAIw7C,EAAsB,SAA6BC,GACrD,OAAO,QAAmB,CACxB/L,IAAK+L,EAAO9a,MAAMgP,aAClBC,kBAAmB6L,EAAO9a,MAAMkP,mBAEpC,EACI6L,EAA4B,SAAmCD,EAAQtD,GACzE,OAAOsD,EAAO9a,MAAMkP,kBAAkBoI,gBAAkBE,CAC1D,EAKIwD,EAAgB,SAAuBF,GACzC,OAAOt6C,QAAQs6C,EAAO9a,MAAMwX,QAC9B,EACIyD,EAA0B,SAAiCH,EAAQtD,GACrE,OAAOsD,EAAO9a,MAAMwX,UAAYA,CAClC,EACI0D,EAAwB,SAA+BC,EAAaC,GACtE,IAAIC,EAAqBL,EAAcG,GACnCG,EAAsBN,EAAcI,GACxC,OAAIC,IAAuBC,GACjB,GAELD,GAAsBC,EAClB,EAEF,CACT,EAIA,SAASC,EAAyB98C,GAahC,OAAOsB,OAAOC,KAAKvB,GAAYwE,KAAI,SAAU7F,GAC3C,OAVW,SAAgB4P,GAC3B,IAAK,IAAIkoC,EAAOv5C,UAAUD,OAAQJ,EAAO,IAAIU,MAAMk5C,EAAO,EAAIA,EAAO,EAAI,GAAIC,EAAO,EAAGA,EAAOD,EAAMC,IAClG75C,EAAK65C,EAAO,GAAKx5C,UAAUw5C,GAE7B,IAAI55C,EAAI,EACR,OAAOyR,EAAOiD,QAAQ,OAAO,WAC3B,OAAOyQ,mBAAmBplB,EAAKC,KACjC,GACF,CAESigD,CAAO,QAASp+C,GAbsB6B,EAaDR,EAAWrB,GAZN,oBAA1C2C,OAAOpF,UAAUqQ,SAASjP,KAAKkD,IAA0E,mBAA1Cc,OAAOpF,UAAUqQ,SAASjP,KAAKkD,GAYtCgM,KAAKC,UAAUzM,EAAWrB,IAAQqB,EAAWrB,KAbxF,IAAyB6B,CAc/C,IAAG0c,KAAK,IACV,CAWe,SAAS8/B,EAA2B7L,GACjD,IAAIp6B,EAAYo6B,EAAKp6B,UACnBkmC,EAAoB9L,EAAK+L,aACzBA,OAAqC,IAAtBD,EAA+B,CAAC,EAAIA,EACnDd,EAAehL,EAAKgL,aACpBgB,EAAehM,EAAKgM,aACpBC,EAAqBjM,EAAKiM,mBACxBnkC,EAAS,IAAoBkjC,EAAcplC,EAAW+3B,EAAc,CAAC,EAAG+M,IAC5EK,EAAiBC,GACjBljC,EAAO/a,GAAG,UAgLV,WACOm/C,IACHA,EAAqB97B,YAAW,WAC9B,IAAI+7B,EAAkBjK,EAAMsD,WAE1BzyC,GADqBo5C,EAAgBrF,mBACtBjE,EAAyBsJ,EAAiBrB,IAC3D5I,EAAMl7B,SAAS22B,EAAcA,EAAc,CAAC,EAAG5qC,GAAe,CAAC,EAAG,CAChEwuC,iBAAiB,IAErB,GAAG0K,GAEP,IA3LqCl/C,GAAG,SAAUq/C,EAAoB,CACpExE,QAAShiC,KACP7Y,GAAG,QAASs/C,GAChB,IAGIC,EAHAvkB,GAAO,EACPmkB,EAAqB,KACrBK,EAA0BzkC,EAAOvM,MAEjC4mC,EEnGS,SAA8BqK,GAC3C,IAAI/G,EAAU,GAEVgH,GAAY,EAIhB,SAASC,IACHD,IAGJA,GAAY,GACZ,SAAM,WACJA,GAAY,EACZD,GACF,IACF,CACA,MAAO,CACLlG,eAAgB,SAAwB4E,GAGtC,OAFAzF,EAAQ94C,KAAKu+C,GACbwB,IACO,WACLjH,EAAQn4C,OAAOm4C,EAAQ30C,QAAQo6C,GAAS,GACxCwB,GACF,CACF,EACA/F,OAAQ+F,EACRC,WAAY,WACV,OAAOlH,CACT,EAEJ,CFoEuBmH,EA+TrB,WACE,IAAIjO,EAAWyC,EAAYc,EAAMsD,WAAWC,SAC5CvD,EAAMl7B,SAAS22B,EAAcA,EAAc,CAAC,EAAGuE,EAAMsD,YAAa,CAAC,EAAG,CACpE7G,SAAUA,EACV8C,WAAW,KAKbh+B,GACF,KApJA,SAA6BzV,EAAQuP,GACnC,IAAKA,EACH,OAOF,KAAMvP,EAAOomB,aAAepmB,EAAO6+C,mBAAqB7+C,EAAO8+C,WAA+C,oBAA3B9+C,EAAO+U,iBACxF,OAUF,GAAI/U,EAAOomB,cAAgBpmB,EAAO6+C,eAAgB,CAChD7+C,EAAO6+C,gBAAiB,EACxB,IAAIE,EAAa/+C,EAAOyV,OACxBzV,EAAOyV,OAAS,SAAUwS,GACxB,IAAK,IAAI0vB,EAAQ55C,UAAUD,OAAQkhD,EAAa,IAAI5gD,MAAMu5C,EAAQ,EAAIA,EAAQ,EAAI,GAAIC,EAAQ,EAAGA,EAAQD,EAAOC,IAC9GoH,EAAWpH,EAAQ,GAAK75C,UAAU65C,GAEpC,IAAIqH,EAA+Bh3B,EAAS5iB,KAAI,SAAU4f,GACxD,OAAO0qB,EAAcA,EAAc,CAAC,EAAG1qB,GAAU,CAAC,EAAG,CACnDrhB,OAAQ+5C,EAAyB14B,EAAQrhB,SAE7C,IACA,OAAO5D,EAAOomB,YAAYJ,eAAe3E,IAAI,CAC3CgD,OAAQ,SACR3mB,KAAM,CAACuhD,GAA8Bx9C,OAAOu9C,KAC3C,WACD,OAAOD,EAAWzgD,WAAM,EAAQ,CAAC2pB,GAAUxmB,OAAOu9C,GACpD,GACF,CACF,CACA,GAAI5gD,MAAMoF,QAAQ+L,EAAQA,SAExB,YAIJ,SAAkDvP,EAAQuP,GAGxD,GAAIvP,EAAOomB,YAgBT,YAfApmB,EAAOomB,YAAYJ,eAAexE,IAAI,CACpC6C,OAAQ,SACR3mB,KAAM,CAAC6R,EAAQlN,QAAO,SAAU8J,EAAKsE,GACnC,OAAOtE,EAAI1K,OAAOgP,EAAOyuC,WAAW75C,KAAI,SAAU4f,GAChD,MAAO,CACLrN,UAAWqN,EAAQhlB,MACnB2D,OAAQqhB,EAAQrhB,OAEpB,IACF,GAAG,MACF,CACD2L,QAASA,EAAQlN,QAAO,SAAU8J,EAAKsE,GACrC,OAAOtE,EAAI1K,OAAOgP,EAAOyuC,WAC3B,GAAG,MAWP,IAAI1/C,EAAM,6BAA6BiC,OAAO4L,KAAKC,UAAU,CAC3D2a,SAAU1Y,EAAQlN,QAAO,SAAU8J,EAAKsE,GACtC,OAAOtE,EAAI1K,OAAOgP,EAAOyuC,WAAW75C,KAAI,SAAU4f,GAChD,MAAO,CACLrN,UAAWqN,EAAQhlB,MACnB2D,OAAQqhB,EAAQrhB,OAEpB,IACF,GAAG,OAEL5D,EAAOq8B,MAAQsT,EAAcA,EAAc,CAAC,EAAG3vC,EAAOq8B,OAAQ,CAAC,EAAGuT,EAAgB,CAAC,EAAGpwC,EAAK6N,KAAKC,UAAU,CACxGiC,QAASA,EAAQlN,QAAO,SAAU8J,EAAKsE,GACrC,OAAOtE,EAAI1K,OAAOgP,EAAOyuC,WAC3B,GAAG,OAEP,CAhDIC,CAAyCn/C,EAAQuP,EAAQA,UAiD7D,SAAmDvP,EAAQuP,GAGzD,GAAIvP,EAAOomB,YAYT,YAXApmB,EAAOomB,YAAYJ,eAAexE,IAAI,CACpC6C,OAAQ,SACR3mB,KAAM,CAAC6R,EAAQ2vC,WAAW75C,KAAI,SAAU4f,GACtC,MAAO,CACLrN,UAAWqN,EAAQhlB,MACnB2D,OAAQqhB,EAAQrhB,OAEpB,MACC,CACD2L,QAASA,EAAQ2vC,aAUrB,IAAI1/C,EAAM,6BAA6BiC,OAAO4L,KAAKC,UAAU,CAC3D2a,SAAU1Y,EAAQ2vC,WAAW75C,KAAI,SAAU4f,GACzC,MAAO,CACLrN,UAAWqN,EAAQhlB,MACnB2D,OAAQqhB,EAAQrhB,OAEpB,OAEF5D,EAAOq8B,MAAQsT,EAAcA,EAAc,CAAC,EAAG3vC,EAAOq8B,OAAQ,CAAC,EAAGuT,EAAgB,CAAC,EAAGpwC,EAAK6N,KAAKC,UAAU,CACxGiC,QAASA,EAAQ2vC,cAErB,CAhFEE,CAA0Cp/C,EAAQuP,EACpD,CAjOA8vC,CAAoBrC,EAAcgB,GAClC,IAAI9J,EGtGS,SAAqB6J,GAClC,IAAIxwC,EAAQwwC,EACRngD,EAAY,GAChB,MAAO,CACL45C,SAAU,WACR,OAAOjqC,CACT,EACAyL,SAAU,SAAkBq6B,GAC1B9lC,EAAQ8lC,EACRz1C,EAAU8G,SAAQ,SAAUlG,GAC1B,OAAOA,GACT,GACF,EACA25C,UAAW,SAAmB35C,GAE5B,OADAZ,EAAUe,KAAKH,GACR,WACLZ,EAAU0B,OAAO1B,EAAUkF,QAAQtE,GAAW,EAChD,CACF,EAEJ,CHkFc8gD,CAAY,CACtB7H,QAASsG,EACTpN,SAAU4O,EAAgBvB,GAC1BzuC,QA6SF,SAA6BA,GAC3B,IAAKA,EACH,OAAO,KAET,GAAInR,MAAMoF,QAAQ+L,EAAQA,SACxB,OAAOA,EAAQA,QAAQlN,QAAO,SAAU8J,EAAKsE,GAC3C,OAAOk/B,EAAcA,EAAc,CAAC,EAAGxjC,GAAM,CAAC,EAAGyjC,EAAgB,CAAC,EAAGn/B,EAAO+uC,iBAAkB,IAAI,mBAAkC,IAAI,sBAAqC/uC,EAAOlD,OAAQkD,EAAOyuC,aACrM,GAAG,CAAC,GAEN,OAAO,IAAI,mBAAkC,IAAI,sBAAqC3vC,EAAQhC,OAAQgC,EAAQ2vC,WAChH,CAvTWO,CAAoBzB,GAC7BngD,MAAO,KACP41C,WAAW,EACXF,iBAAiB,EACjBG,yBAAyB,IAc3B,SAASN,EAAY7lC,GACnB,OAAO4mC,EAAewK,aAAal8C,QAAO,SAAUy6C,GAClD,OAAOt6C,QAAQs6C,EAAO9J,YACxB,IAAG/tC,KAAI,SAAU63C,GACf,OAAOA,EAAO9J,YAAY7lC,EAC5B,GACF,CACA,SAASkkC,IACP,IAAIiO,EAAmBvL,EAAewK,aAAal8C,QAAO,SAAUy6C,GAClE,OAAOt6C,QAAQs6C,EAAOzL,oBACxB,IAAGhvC,QAAO,SAAUy6C,GAClB,OAAQD,EAAoBC,KAAYE,EAAcF,EACxD,IAAG76C,QAAO,SAAUmS,EAAK0oC,GACvB,OAAOA,EAAOzL,oBAAoBj9B,EACpC,GAAG+pC,GACCoB,EAAiBxL,EAAewK,aAAal8C,QAAO,SAAUy6C,GAChE,OAAOt6C,QAAQs6C,EAAOzL,oBACxB,IAAGhvC,QAAO,SAAUy6C,GAClB,IAAI0C,EAA8B3C,EAAoBC,IAAWC,EAA0BD,EAAQtlC,GAC/FioC,EAAyBzC,EAAcF,IAAWG,EAAwBH,EAAQtlC,GACtF,OAAOgoC,GAA+BC,CACxC,IAGCp0C,KAAK6xC,GAAuBj7C,QAAO,SAAUmS,EAAK0oC,GACjD,OAAOA,EAAOzL,oBAAoBj9B,EACpC,GAAGkrC,GACCI,EAAiB3L,EAAewK,aAAal8C,QAAO,SAAUy6C,GAChE,OAAOt6C,QAAQs6C,EAAOzL,oBACxB,IAAGhvC,QAAO,SAAUy6C,GAClB,IAAI6C,EAAiC9C,EAAoBC,KAAYC,EAA0BD,EAAQtlC,GACnGooC,EAA4B5C,EAAcF,KAAYG,EAAwBH,EAAQtlC,GAC1F,OAAOmoC,GAAkCC,CAC3C,IAGCv0C,KAAK6xC,GAAuBj7C,QAAO,SAAUyN,EAASotC,GACrD,IAAItD,EAAUqD,EAAoBC,GAAUA,EAAO9a,MAAMkP,kBAAkBoI,cAAgBwD,EAAO9a,MAAMwX,QACpGnC,EAAU3nC,EAAQ8pC,IAAY,GAClC,OAAOjK,EAAcA,EAAc,CAAC,EAAG7/B,GAAU,CAAC,EAAG8/B,EAAgB,CAAC,EAAGgK,EAASnC,EAAQh2C,OAAOy7C,IACnG,GAAG,CAAC,GASJ,MAAO,CACLyC,eAAgBA,EAChBM,kBAVsB99C,OAAOC,KAAK09C,GAAgBz6C,KAAI,SAAUu0C,GAChE,MAAO,CACL/4C,WAAYi/C,EAAelG,GAASv3C,QAAO,SAAUmS,EAAK0oC,GACxD,OAAOA,EAAOzL,oBAAoBj9B,EACpC,GAAGkrC,GACH9F,QAASA,EAEb,IAKF,CACA,SAASnkC,IACP,IAAKskB,EAAM,CACT,IAAImmB,EAAuBzO,EAAoB33B,EAAOvM,OACpDoyC,EAAiBO,EAAqBP,eACtCM,EAAoBC,EAAqBD,kBAC3C3B,EAAgB2B,EAAkBniD,OAAS,EAM3Cgc,EAAO3E,eAAe9W,QAAQqG,SAAQ,SAAUgS,GAe9CA,EAAchW,QAChB,IACAu/C,EAAkBv7C,SAAQ,SAAUgzC,GAClC,IAAIkC,EAAUlC,EAAMkC,QAClB/4C,EAAa62C,EAAM72C,WACDiZ,EAAOiB,QAAO,WAChC,OAAOla,CACT,IACc9B,GAAG,SAAUq/C,EAAoB,CAC7CxE,QAASA,KACP76C,GAAG,QAASs/C,EAClB,IACAvkC,EAAOd,SAAS2mC,GAChB7lC,EAAOrE,QACT,CACF,CACA,SAAS2oC,EAAoBvG,GAC3B,IAAI+B,EAAU/B,EAAM+B,QACpB,OAAO,SAAUj/B,GACf2jC,IACA,IAAI/wC,EAAQ2mC,EAAMsD,WACd2I,GAAyBrmC,EAAO3E,eAAerX,OAC/CyR,EAAUhC,EAAMgC,QAAUhC,EAAMgC,QAAU,CAAC,EAK/CA,GAAW4wC,GAAyB5wC,EAAQgE,eAAiB,CAAC,EAAIhE,EAIhEA,EAHG4wC,EAGOxlC,EAAMpL,QAFNogC,EAAcA,EAAc,CAAC,EAAGpgC,GAAU,CAAC,EAAGqgC,EAAgB,CAAC,EAAGgK,EAASj/B,EAAMpL,UAI7F,IAAIlJ,EAAe6tC,EAAMsD,WACrB4I,EAAsB/5C,EAAaktC,gBAClCz5B,EAAOmB,uBACVwV,aAAaytB,GACbA,EAAqB,KACrBkC,GAAsB,GAEC/5C,EAAayyC,mBAAtC,IACE/zC,EAAe8vC,EAAyBxuC,EAAcsuC,GACxDT,EAAMl7B,SAAS22B,EAAcA,EAAc,CAAC,EAAG5qC,GAAe,CAAC,EAAG,CAChEwK,QAASA,EACTgkC,gBAAiB6M,EACjB3M,UAAW6K,EAAgB,EAC3BzgD,MAAO,OAEX,CACF,CACA,SAASwgD,EAAkB3D,GACzB,IAAI78C,EAAQ68C,EAAM78C,MACdwI,EAAe6tC,EAAMsD,WACrB4I,EAAsB/5C,EAAaktC,gBAClCz5B,EAAOmB,uBACVwV,aAAaytB,GACbkC,GAAsB,GAEC/5C,EAAayyC,mBAAtC,IACE/zC,EAAe8vC,EAAyBxuC,EAAcw2C,GACxD3I,EAAMl7B,SAAS22B,EAAcA,EAAc,CAAC,EAAG5qC,GAAe,CAAC,EAAG,CAChEwuC,gBAAiB6M,EACjBviD,MAAOA,EACP41C,WAAW,IAEf,CA8NA,MAAO,CACLS,MAAOA,EACPC,eAAgBA,EAChBkM,cARF,WACE,OAAOnM,EAAMsD,WAAW7G,SAAStuC,QAAO,SAAUmS,EAAKq8B,GACrD,MAA0B,qBAAZA,EAAKE,GAAqBv8B,EAAI/S,OAAOovC,EAAKE,IAAMv8B,CAChE,GAAG,GACL,EAKEi9B,oBAAqBA,EACrBsC,uBAhDF,SAAgCuM,GAC9B,IAAIx4C,EAAYw4C,EAAMx4C,UACpBd,EAAQs5C,EAAMt5C,MACdu5C,EAAqBD,EAAMlpC,aAC3BA,OAAsC,IAAvBmpC,EAAgC,GAAKA,EAGlDC,EAA0Bn+B,KAAKilB,IAAI,EAAGjlB,KAAKC,IAAIlL,EAAc,MACjE88B,EAAMl7B,SAAS22B,EAAcA,EAAc,CAAC,EAAGuE,EAAMsD,YAAa,CAAC,EAAG,CACpE9D,yBAAyB,KAE3B55B,EAAO3C,qBAAqBrP,EAAWd,EAAOw5C,GAAyBpqC,MAAK,SAAUC,GACpF,IAAIoqC,EACJvM,EAAMl7B,SAAS22B,EAAcA,EAAc,CAAC,EAAGuE,EAAMsD,YAAa,CAAC,EAAG,CACpE35C,MAAO,KACP61C,yBAAyB,EACzBoF,mBAAoBnJ,EAAcA,EAAc,CAAC,EAAGuE,EAAMsD,WAAWsB,oBAAqB,CAAC,GAAI2H,EAAiB,CAAC,EAAG7Q,EAAgB6Q,EAAgB34C,EAAWuO,EAAQyB,WAAY83B,EAAgB6Q,EAAgB,QAASz5C,GAAQy5C,MAExO,IAAG,SAAU5iD,GACXq2C,EAAMl7B,SAAS22B,EAAcA,EAAc,CAAC,EAAGuE,EAAMsD,YAAa,CAAC,EAAG,CACpE9D,yBAAyB,EACzB71C,MAAOA,IAEX,IAAG2Y,OAAM,SAAU3Y,GAKjBukB,YAAW,WACT,MAAMvkB,CACR,GACF,GACF,EAiBE6iD,sBA1DF,SAA+BC,GAC7B,IAAIhQ,EAAWyC,EAAYuN,GAC3BzM,EAAMl7B,SAAS22B,EAAcA,EAAc,CAAC,EAAGuE,EAAMsD,YAAa,CAAC,EAAG,CACpEC,QAASkJ,EACThQ,SAAUA,EACV8C,WAAW,KAEbh+B,GACF,EAmDE8gC,gBAnEF,SAAyBoK,GACvB,IAAIlQ,EAAcyD,EAAMsD,WAAWC,QACnC,OAAOtD,EAAewK,aAAal8C,QAAO,SAAUy6C,GAClD,OAAOt6C,QAAQs6C,EAAO3G,gBACxB,IAAGl0C,QAAO,SAAUmS,EAAK0oC,GACvB,OAAOA,EAAO3G,gBAAgB9F,EAAaj8B,EAC7C,GAAGmsC,EACL,EA6DEC,aAhYF,SAAsB5gD,GACpB+8C,EAAiB/8C,GACjB8Z,EAAO9E,UAAUhV,GACjByV,GACF,EA6XEorC,YAnBF,SAAqBC,GACnBvC,EAA0BA,EAAwB13C,SAASi6C,EAE7D,EAiBElmC,WA7XF,WACEd,EAAOc,aACPnF,GACF,EA2XEsrC,WAtYF,WACEhnB,GAAO,CACT,EAsYF,CACA,SAASwlB,EAAgBvB,GACvB,OAAKA,EAKEA,EAAarN,SAAStrC,KAAI,SAAU27C,GACzC,OAAOrR,EAAcA,EAAc,CACjCtuC,MAAO,WACL,MAAO,CAAC,CACV,GACC2/C,GAAQ,CAAC,EAAG,CACbpQ,MAAOoQ,EAAMpQ,OAASoQ,EAAMpQ,MAAMvrC,KAAI,SAAUoN,GAC9C,OAAOk9B,EAAcA,EAAc,CACjCtuC,MAAO,WACL,MAAO,CAAC,CACV,GACCoR,GAAO,CAAC,EAAG,CACZm+B,MAAOn+B,EAAKm+B,OAASn+B,EAAKm+B,MAAMvrC,KAAI,SAAU47C,GAC5C,OAAOtR,EAAc,CACnBtuC,MAAO,WACL,MAAO,CAAC,CACV,GACC4/C,EACL,KAEJ,KAEJ,IA1BS,EA2BX,CIrhBA,SAAS,EAAQtkC,GAAkC,OAAO,EAAU,mBAAqBwD,QAAU,iBAAmBA,OAAOC,SAAW,SAAUzD,GAAO,cAAcA,CAAK,EAAI,SAAUA,GAAO,OAAOA,GAAO,mBAAqBwD,QAAUxD,EAAInW,cAAgB2Z,QAAUxD,IAAQwD,OAAOpjB,UAAY,gBAAkB4f,CAAK,EAAG,EAAQA,EAAM,CA8BxU,SAASukC,EAAezJ,EAASuF,GACtC,IAAImE,EAAmBC,SAASC,cAAc,QAC1CC,EAAUF,SAASG,cAAc,QACrCJ,EAAiBl7C,KAAO,mBACxB,IAAIu7C,EA9BC,SAA4B/J,EAASuF,GAC1C,IAAIyE,EAAgB,CAAC,eAAgB,qBACjCC,EAAiBjK,EAAQpyC,KAAI,SAAU2sC,GACzC,IAAI5P,EAAQ4P,EAAK5P,MACf57B,EAAcwrC,EAAKxrC,YACjBkxC,EAAQlxC,EAAYm7C,gBAAkB,CAAC,EACzCC,EAAqBlK,EAAMhF,aAC3BA,OAAsC,IAAvBkP,EAAgC,CAAC,EAAIA,EACpDC,EAAoBnK,EAAMtH,YAE5B,MAAO,CACLA,iBAFoC,IAAtByR,EAA+Br7C,EAAY4pC,YAAcyR,EAGvExR,OAAQ7pC,EAAY6pC,OACpBkJ,aAAc/yC,EAAY+yC,aAC1B31C,OAAQzB,OAAOC,KAAKggC,GAAO3/B,QAAO,SAAUw4C,GAC1C,OAAQwG,EAAclnB,SAAS0gB,IAASvI,EAAauI,KAAU7Y,EAAM6Y,SAAyBz+C,IAAhB4lC,EAAM6Y,EACtF,IAEJ,IACIj7C,EAASg9C,EAEb,MAAO,CACL8E,GAFO9hD,EAAOomB,aAAepmB,EAAOomB,YAAY7B,UAAYvkB,EAAOomB,YAAY7B,UAAUljB,MAAQrB,EAAO+hD,IAGxGtK,QAASiK,EAEb,CAKgBM,CAAmBvK,EAASuF,GAC1CmE,EAAiB9qC,QAAUhJ,KAAKC,UAAUk0C,GAC1CF,EAAQW,YAAYd,EACtB,CCrCA,SAAS,EAAQxkC,GAAkC,OAAO,EAAU,mBAAqBwD,QAAU,iBAAmBA,OAAOC,SAAW,SAAUzD,GAAO,cAAcA,CAAK,EAAI,SAAUA,GAAO,OAAOA,GAAO,mBAAqBwD,QAAUxD,EAAInW,cAAgB2Z,QAAUxD,IAAQwD,OAAOpjB,UAAY,gBAAkB4f,CAAK,EAAG,EAAQA,EAAM,CAC/U,SAAS,EAAQc,EAAQ+xB,GAAkB,IAAIptC,EAAOD,OAAOC,KAAKqb,GAAS,GAAItb,OAAO0d,sBAAuB,CAAE,IAAI4vB,EAAUttC,OAAO0d,sBAAsBpC,GAAS+xB,IAAmBC,EAAUA,EAAQhtC,QAAO,SAAUitC,GAAO,OAAOvtC,OAAO2d,yBAAyBrC,EAAQiyB,GAAK3zB,UAAY,KAAK3Z,EAAKzD,KAAKL,MAAM8D,EAAMqtC,EAAU,CAAE,OAAOrtC,CAAM,CACpV,SAAS,EAAcka,GAAU,IAAK,IAAI3e,EAAI,EAAGA,EAAII,UAAUD,OAAQH,IAAK,CAAE,IAAIwd,EAAS,MAAQpd,UAAUJ,GAAKI,UAAUJ,GAAK,CAAC,EAAGA,EAAI,EAAI,EAAQwE,OAAOgZ,IAAS,GAAIzW,SAAQ,SAAUlF,GAAO,EAAgB8c,EAAQ9c,EAAK2b,EAAO3b,GAAO,IAAK2C,OAAO4d,0BAA4B5d,OAAO6d,iBAAiB1D,EAAQna,OAAO4d,0BAA0B5E,IAAW,EAAQhZ,OAAOgZ,IAASzW,SAAQ,SAAUlF,GAAO2C,OAAOyd,eAAetD,EAAQ9c,EAAK2C,OAAO2d,yBAAyB3E,EAAQ3b,GAAO,GAAI,CAAE,OAAO8c,CAAQ,CAEzf,SAAS04B,EAAkB14B,EAAQ8lB,GAAS,IAAK,IAAIzkC,EAAI,EAAGA,EAAIykC,EAAMtkC,OAAQH,IAAK,CAAE,IAAIs3C,EAAa7S,EAAMzkC,GAAIs3C,EAAWl5B,WAAak5B,EAAWl5B,aAAc,EAAOk5B,EAAWh5B,cAAe,EAAU,UAAWg5B,IAAYA,EAAWj5B,UAAW,GAAM7Z,OAAOyd,eAAetD,EAAQ,EAAe24B,EAAWz1C,KAAMy1C,EAAa,CAAE,CAG5U,SAASC,EAAgBj1B,EAAG4C,GAA6I,OAAxIqyB,EAAkB/yC,OAAOgzC,eAAiBhzC,OAAOgzC,eAAeh7B,OAAS,SAAyB8F,EAAG4C,GAAsB,OAAjB5C,EAAEm1B,UAAYvyB,EAAU5C,CAAG,EAAUi1B,EAAgBj1B,EAAG4C,EAAI,CACvM,SAASwyB,EAAaC,GAAW,IAAIC,EAGrC,WAAuC,GAAuB,qBAAZC,UAA4BA,QAAQC,UAAW,OAAO,EAAO,GAAID,QAAQC,UAAUC,KAAM,OAAO,EAAO,GAAqB,oBAAVC,MAAsB,OAAO,EAAM,IAAsF,OAAhF/yC,QAAQ7F,UAAUumC,QAAQnlC,KAAKq3C,QAAQC,UAAU7yC,QAAS,IAAI,WAAa,MAAY,CAAM,CAAE,MAAO2T,GAAK,OAAO,CAAO,CAAE,CAHvQq/B,GAA6B,OAAO,WAAkC,IAAsCnlC,EAAlColC,EAAQC,EAAgBR,GAAkB,GAAIC,EAA2B,CAAE,IAAIQ,EAAYD,EAAgBz5C,MAAMmK,YAAaiK,EAAS+kC,QAAQC,UAAUI,EAAO93C,UAAWg4C,EAAY,MAAStlC,EAASolC,EAAMv3C,MAAMjC,KAAM0B,WAAc,OACpX,SAAoC0G,EAAMtG,GAAQ,GAAIA,IAA2B,WAAlB,EAAQA,IAAsC,oBAATA,GAAwB,OAAOA,EAAa,QAAa,IAATA,EAAmB,MAAM,IAAIf,UAAU,4DAA+D,OAAO44C,EAAuBvxC,EAAO,CAD4FwxC,CAA2B55C,KAAMoU,EAAS,CAAG,CAExa,SAASulC,EAAuBvxC,GAAQ,QAAa,IAATA,EAAmB,MAAM,IAAIyxC,eAAe,6DAAgE,OAAOzxC,CAAM,CAErK,SAASqxC,EAAgB71B,GAA+J,OAA1J61B,EAAkB3zC,OAAOgzC,eAAiBhzC,OAAOg0C,eAAeh8B,OAAS,SAAyB8F,GAAK,OAAOA,EAAEm1B,WAAajzC,OAAOg0C,eAAel2B,EAAI,EAAU61B,EAAgB71B,EAAI,CACnN,SAAS,EAAgBtD,EAAKnd,EAAK6B,GAA4L,OAAnL7B,EAAM,EAAeA,MAAiBmd,EAAOxa,OAAOyd,eAAejD,EAAKnd,EAAK,CAAE6B,MAAOA,EAAO0a,YAAY,EAAME,cAAc,EAAMD,UAAU,IAAkBW,EAAInd,GAAO6B,EAAgBsb,CAAK,CAC3O,SAAS,EAAejgB,GAAO,IAAI8C,EACnC,SAAsBqwC,EAAOC,GAAQ,GAAuB,WAAnB,EAAQD,IAAiC,OAAVA,EAAgB,OAAOA,EAAO,IAAIE,EAAOF,EAAM1vB,OAAO6vB,aAAc,QAAaxzC,IAATuzC,EAAoB,CAAE,IAAIv7B,EAAMu7B,EAAK5xC,KAAK0xC,EAAOC,GAAQ,WAAY,GAAqB,WAAjB,EAAQt7B,GAAmB,OAAOA,EAAK,MAAM,IAAIpX,UAAU,+CAAiD,CAAE,OAAiB,WAAT0yC,EAAoB10B,OAAS60B,QAAQJ,EAAQ,CADnV,CAAanzC,EAAK,UAAW,MAAwB,WAAjB,EAAQ8C,GAAoBA,EAAM4b,OAAO5b,EAAM,CAQ5H,SAAS0iD,EAAa9f,GACpB,OAAOx/B,QAAQw/B,EAAMqO,YACvB,CAwCA,IAAI0R,EAA6B,SAAUxL,IA1D3C,SAAmBC,EAAUC,GAAc,GAA0B,oBAAfA,GAA4C,OAAfA,EAAuB,MAAM,IAAIz5C,UAAU,sDAAyDw5C,EAAS75C,UAAYoF,OAAO2Z,OAAO+6B,GAAcA,EAAW95C,UAAW,CAAEyJ,YAAa,CAAEnF,MAAOu1C,EAAU56B,UAAU,EAAMC,cAAc,KAAW9Z,OAAOyd,eAAeg3B,EAAU,YAAa,CAAE56B,UAAU,IAAc66B,GAAY3B,EAAgB0B,EAAUC,EAAa,CA2DjcC,CAAUqL,EAAexL,GACzB,IA7DoBI,EAAaC,EAAYC,EA6DzCC,EAAS7B,EAAa8M,GAC1B,SAASA,EAAc/f,GACrB,IAAI+U,GAjER,SAAyBvxC,EAAUmxC,GAAe,KAAMnxC,aAAoBmxC,GAAgB,MAAM,IAAI35C,UAAU,oCAAwC,CAkEpJg6C,CAAgB/6C,KAAM8lD,GAEtB,EAAgBnM,EADhBmB,EAAQD,EAAO/4C,KAAK9B,KAAM+lC,IACqB,kBAAmB,MAClE,EAAgB4T,EAAuBmB,GAAQ,gBAAgB,GAC/D,IAAIiL,EAAuBvE,EAA2B,CACpDjmC,UAAWu/B,EAAM/U,MAAMxqB,UACvBolC,aAAc7F,EAAM/U,MAAM4a,aAC1Be,aAAc5G,EAAM/U,MAAMqO,aAAe,CAAC,EAC1CuN,aAAc7G,EAAM/U,MAAM4b,aAC1BC,mBAAoB9G,EAAM/U,MAAM6b,qBAE9B7M,EAAe,CACjB8C,MAAOkO,EAAqBlO,MAC5BC,eAAgBiO,EAAqBjO,eACrCC,kBAAmB+C,EAAM/U,MAAMxqB,UAC/Bi8B,sBAAuBsD,EAAMkL,6BAA6BloC,KAAK67B,EAAuBmB,IACtFrD,mBAAoBqD,EAAMrD,mBAAmB35B,KAAK67B,EAAuBmB,IACzEpD,uBAAwBoD,EAAMpD,uBAAuB55B,KAAK67B,EAAuBmB,IACjFnD,oBAAqBmD,EAAMnD,oBAAoB75B,KAAK67B,EAAuBmB,IAC3ElD,mBAAoBkD,EAAMlD,mBAAmB95B,KAAK67B,EAAuBmB,KAO3E,OALAA,EAAM5pC,MAAQ,CACZ20C,aAAcA,EAAa/K,EAAM/U,OACjCggB,qBAAsBA,EACtBhR,aAAcA,GAET+F,CACT,CAuHA,OAlNoBJ,EA4FPoL,EA5FgClL,EAiMzC,CAAC,CACHz3C,IAAK,2BACL6B,MAAO,SAAkCk3C,EAAW+J,GAClD,IAAIC,EAAmBL,EAAa3J,GAChCiK,EAAsBF,EAAUF,qBAAqBlO,MAAMsD,WAAWC,QACtEkJ,EAAkBpI,EAAU9H,YAIhC,OAHI8R,IAAqB,IAAQC,EAAqB7B,IACpD2B,EAAUF,qBAAqB1B,sBAAsBnI,EAAU9H,aAE1D,CACLyR,aAAcK,EACdnR,aAAc,EAAc,EAAc,CAAC,EAAGkR,EAAUlR,cAAe,CAAC,EAAG,CACzEgD,kBAAmBmE,EAAU3gC,YAGnC,KAhN+Bo/B,EA4FL,CAAC,CAC3Bx3C,IAAK,qBACL6B,MAAO,SAA4Bq3C,GACjC,IAAI+J,EAAmBP,EAAaxJ,GACpC,GAAI+J,IAAqBpmD,KAAKkR,MAAM20C,aAClC,MAAM,IAAIlkD,MAAM,0EAElB,IAAKykD,GAAoBpmD,KAAKkR,MAAM20C,aAClC,MAAM,IAAIlkD,MAAM,0EAEd3B,KAAK+lC,MAAMsgB,UAAYhK,EAAUgK,SAAWrmD,KAAK+lC,MAAMsgB,SACzDrmD,KAAKkR,MAAM60C,qBAAqBxnC,aAE9B89B,EAAU9gC,YAAcvb,KAAK+lC,MAAMxqB,WACrCvb,KAAKkR,MAAM60C,qBAAqBvB,YAAYxkD,KAAK+lC,MAAMxqB,WAErD8gC,EAAUsE,eAAiB3gD,KAAK+lC,MAAM4a,cACxC3gD,KAAKkR,MAAM60C,qBAAqBxB,aAAavkD,KAAK+lC,MAAM4a,aAE5D,GACC,CACDx9C,IAAK,oBACL6B,MAAO,WACDhF,KAAK47C,kBACPxnB,aAAap0B,KAAK47C,iBAClB57C,KAAK47C,gBAAkB,MDxH8C,YAAjD,qBAAXt3B,OAAyB,YAAc,EAAQA,UAAuD,WAA9B,EAAQA,OAAOgiC,YAAiE,kBAA/BhiC,OAAOgiC,UAAUp+B,WAA0B5D,OAAOgiC,UAAUp+B,UAAUgW,SAAS,oBAAmD,WAA7B,EAAQ5Z,OAAOygC,WC2HtPF,EAAe7kD,KAAKkR,MAAM60C,qBAAqBjO,eAAewK,aAActiD,KAAK+lC,MAAM4a,aAE3F,GACC,CACDx9C,IAAK,uBACL6B,MAAO,WACL,IAAI22C,EAAS37C,KACbA,KAAK47C,gBAAkB71B,YAAW,WAChC41B,EAAOI,cAAe,EACtBJ,EAAOzqC,MAAM60C,qBAAqBrB,YACpC,GACF,GACC,CACDvhD,IAAK,qBACL6B,MAAO,SAA4BovC,GAEjC,OADAA,EAAcp0C,KAAKkR,MAAM60C,qBAAqB7L,gBAAgB9F,GACvDp0C,KAAKkR,MAAM20C,cAAgB7lD,KAAK+lC,MAAM+W,UAAY98C,KAAK+lC,MAAM+W,UAAU1I,EAAap0C,KAAKumD,gBAAkB,GACpH,GACC,CACDpjD,IAAK,+BACL6B,MAAO,SAAsCovC,GAC3CA,EAAcp0C,KAAKkR,MAAM60C,qBAAqB7L,gBAAgB9F,GAC9Dp0C,KAAK23C,oBAAoBvD,GACpBp0C,KAAKkR,MAAM20C,cACd7lD,KAAKkR,MAAM60C,qBAAqB1B,sBAAsBjQ,EAE1D,GACC,CACDjxC,IAAK,sBACL6B,MAAO,SAA6BovC,GAC9Bp0C,KAAK+lC,MAAM4R,sBAAwB33C,KAAK+7C,cAC1C/7C,KAAK+lC,MAAM4R,oBAAoBvD,EAEnC,GACC,CACDjxC,IAAK,qBACL6B,MAAO,SAA4BowC,EAAqBvzC,EAASkkC,EAAOgR,EAAahD,GACnF,GAAI/zC,KAAK+lC,MAAM6R,mBAAoB,CACjC,IAAI4O,EAAexmD,KAAK+lC,MAAMqO,YAAcp0C,KAAK+lC,MAAMqO,YAAc,CAAC,EACtEp0C,KAAK+lC,MAAM6R,mBAAmBxC,EAAqBvzC,EAASkkC,EAAOygB,EACrE,CACA,GAAIxmD,KAAK+lC,MAAM0gB,iBAAkB,CAC/B,IAAIC,EAAgB1mD,KAAK+lC,MAAMqO,YAAcp0C,KAAK+lC,MAAMqO,YAAc,CAAC,EACvEp0C,KAAK+lC,MAAM0gB,iBAAiB,CAC1BrR,oBAAqBA,EACrB2B,YAAaA,EACbl1C,QAASA,EACTkkC,MAAOA,EACPqO,YAAasS,EACb3S,YAAaA,GAEjB,CACF,GACC,CACD5wC,IAAK,yBACL6B,MAAO,SAAgCovC,GACrCp0C,KAAKkR,MAAM60C,qBAAqBrO,uBAAuBtD,EACzD,GACC,CACDjxC,IAAK,eACL6B,MAAO,WACL,OAAOhF,KAAKkR,MAAM60C,qBAAqB/B,eACzC,GACC,CACD7gD,IAAK,SACL6B,MAAO,WACL,OAA4C,IAAxC,EAAA2hD,SAAS7zC,MAAM9S,KAAK+lC,MAAMpvB,UACrB,KAEW,gBAAoB,KAAuB,CAC7D3R,MAAOhF,KAAKkR,MAAM6jC,cACjB/0C,KAAK+lC,MAAMpvB,SAChB,MAhM0EgiC,EAAkB+B,EAAYh6C,UAAWi6C,GAAiBC,GAAajC,EAAkB+B,EAAaE,GAAc90C,OAAOyd,eAAem3B,EAAa,YAAa,CAAE/6B,UAAU,IAkNrPmmC,CACT,CAxJiC,CAwJ/B,EAAA7I,WACF,EAAgB6I,EAAe,eAAgB,CAC7ClE,mBAAoB,IACpByE,SAAS,IAEX,EAAgBP,EAAe,YAAa,CAE1CvqC,UAAW,WAAiB26B,WAC5ByK,aAAc,UAAgB,CAC5BvnC,OAAQ,SAAe88B,WACvBp7B,qBAAsB,SACtBpC,gBAAiB,SACjB6F,WAAY,WACX23B,WACH4G,UAAW,SACXuJ,QAAS,SACTjS,YAAa,WACbuD,oBAAqB,SACrBC,mBAAoB,SACpB6O,iBAAkB,SAClB9E,aAAc,cAAoB,CAAC,WAAkB,YACrDhrC,SAAU,SACVirC,mBAAoB,aAEtB,4GChPA,SAASgF,EAAmBC,GAAO,OAInC,SAA4BA,GAAO,GAAI9kD,MAAMoF,QAAQ0/C,GAAM,OAAOC,EAAkBD,EAAM,CAJhDE,CAAmBF,IAG7D,SAA0BG,GAAQ,GAAsB,qBAAXljC,QAAmD,MAAzBkjC,EAAKljC,OAAOC,WAA2C,MAAtBijC,EAAK,cAAuB,OAAOjlD,MAAMqiB,KAAK4iC,EAAO,CAHxFC,CAAiBJ,IAEtF,SAAqCjjC,EAAGsjC,GAAU,IAAKtjC,EAAG,OAAQ,GAAiB,kBAANA,EAAgB,OAAOkjC,EAAkBljC,EAAGsjC,GAAS,IAAIrmD,EAAIiF,OAAOpF,UAAUqQ,SAASjP,KAAK8hB,GAAG5hB,MAAM,GAAI,GAAc,WAANnB,GAAkB+iB,EAAEzZ,cAAatJ,EAAI+iB,EAAEzZ,YAAYP,MAAM,GAAU,QAAN/I,GAAqB,QAANA,EAAa,OAAOkB,MAAMqiB,KAAKR,GAAI,GAAU,cAAN/iB,GAAqB,2CAA2CyiB,KAAKziB,GAAI,OAAOimD,EAAkBljC,EAAGsjC,EAAS,CAFjUC,CAA4BN,IAC1H,WAAgC,MAAM,IAAI9lD,UAAU,uIAAyI,CAD3DqmD,EAAsB,CAKxJ,SAASN,EAAkBD,EAAKzlD,IAAkB,MAAPA,GAAeA,EAAMylD,EAAIplD,UAAQL,EAAMylD,EAAIplD,QAAQ,IAAK,IAAIH,EAAI,EAAGwe,EAAO,IAAI/d,MAAMX,GAAME,EAAIF,EAAKE,IAAKwe,EAAKxe,GAAKulD,EAAIvlD,GAAI,OAAOwe,CAAM,CAE3K,IAAIunC,EAAmB,SAA0BC,GACtD,IAAIC,EAAS7lD,UAAUD,OAAS,QAAsBtB,IAAjBuB,UAAU,GAAmBA,UAAU,GAAK,MACjF,OAAO,WACL,IAAK,IAAIu5C,EAAOv5C,UAAUD,OAAQ+lD,EAAW,IAAIzlD,MAAMk5C,GAAOC,EAAO,EAAGA,EAAOD,EAAMC,IACnFsM,EAAStM,GAAQx5C,UAAUw5C,GAE7B,IAAIuM,EAAeD,EAASphD,QAAO,SAAUshD,GAC3C,OAAOA,GAAuB,KAAZA,CACpB,IAAG1+C,KAAI,SAAU0+C,GACf,IAAIC,EAAgB,GAAGviD,OAAOmiD,EAAQ,KAAKniD,OAAOkiD,GAClD,OAAOI,EAAU,GAAGtiD,OAAOuiD,EAAe,KAAKviD,OAAOsiD,GAAWC,CACnE,IACA,OAAO,IAAGF,EACZ,CACF,EACWG,EAAiB,SAAwBtpC,GAClD,IAAIupC,EAAiC,IAAjBvpC,EAAMwpC,OAC1B,OAAOvhD,QAAQshD,GAAiBvpC,EAAMypC,QAAUzpC,EAAM0pC,SAAW1pC,EAAM2pC,SAAW3pC,EAAM4pC,SAC1F,EACWC,EAAa,SAAoBhlD,GAC1C,OAAsB,IAAfA,EAAI1B,OAAe,GAAK,GAAG2D,OAAOjC,EAAI,GAAG+tC,eAAe9rC,OAAOjC,EAAInB,MAAM,GAClF,EAEO,SAASomD,EAAMzS,GACpB,IAAI0S,EAAa1S,EAAKjX,MACpBA,OAAuB,IAAf2pB,EAAwB,EAAIA,EACpC1pB,EAAMgX,EAAKhX,IACX2pB,EAAY3S,EAAK4S,KACjBA,OAAqB,IAAdD,EAAuB,EAAIA,EAEhCE,EAAqB,IAATD,EAAa,EAAIA,EAO7BE,EAAcziC,KAAK0iC,OAAO/pB,EAAMD,GAAS8pB,GAC7C,OAAO5B,EAAmB7kD,MAAM0mD,IAAcz/C,KAAI,SAAU4jB,EAAG+7B,GAC7D,OAAQjqB,EAAQiqB,GAAWH,CAC7B,GACF,uFChDA,SAASvV,EAAQ3yB,GAAkC,OAAO2yB,EAAU,mBAAqBnvB,QAAU,iBAAmBA,OAAOC,SAAW,SAAUzD,GAAO,cAAcA,CAAK,EAAI,SAAUA,GAAO,OAAOA,GAAO,mBAAqBwD,QAAUxD,EAAInW,cAAgB2Z,QAAUxD,IAAQwD,OAAOpjB,UAAY,gBAAkB4f,CAAK,EAAG2yB,EAAQ3yB,EAAM,CAC/U,SAASizB,EAAgBjzB,EAAKnd,EAAK6B,GAA4L,OAAnL7B,EAC5C,SAAwB9C,GAAO,IAAI8C,EACnC,SAAsBqwC,EAAOC,GAAQ,GAAuB,WAAnBR,EAAQO,IAAiC,OAAVA,EAAgB,OAAOA,EAAO,IAAIE,EAAOF,EAAM1vB,OAAO6vB,aAAc,QAAaxzC,IAATuzC,EAAoB,CAAE,IAAIv7B,EAAMu7B,EAAK5xC,KAAK0xC,EAAOC,GAAQ,WAAY,GAAqB,WAAjBR,EAAQ96B,GAAmB,OAAOA,EAAK,MAAM,IAAIpX,UAAU,+CAAiD,CAAE,OAAiB,WAAT0yC,EAAoB10B,OAAS60B,QAAQJ,EAAQ,CADnVK,CAAaxzC,EAAK,UAAW,MAAwB,WAAjB4yC,EAAQ9vC,GAAoBA,EAAM4b,OAAO5b,EAAM,CAD1E2wC,CAAe3wC,MAAiBmd,EAAOxa,OAAOyd,eAAejD,EAAKnd,EAAK,CAAE6B,MAAOA,EAAO0a,YAAY,EAAME,cAAc,EAAMD,UAAU,IAAkBW,EAAInd,GAAO6B,EAAgBsb,CAAK,CAQ3O,SAASk1B,EAAqBzP,EAAOqO,EAAavyC,GAChD,IAEI6H,GAAoB,QAA0Bq8B,EAAOqO,EAAavyC,EAL/D,OAII,GAEX,MAAiC,kBAAtB6H,EACFknB,SAASlnB,EAAmB,IAE9BA,CACT,CAwBA,SAAe,EAAAk/C,EAAA,GAAgB,CAC7B7U,YAAa,oBACbC,OAAQ,iBACRG,iBAAkB,SAA0BpO,EAAOqO,EAAaC,GAC9D,IAAInhC,GAAU,QAAWmhC,EAAe,CACtCS,IAAK/O,EAAMgP,aACXC,kBAAmBjP,EAAMkP,oBAE3B,IAAK/hC,EACH,OAAO,KAET,IAAI2d,EAAU3d,EAAQ2d,QACtB,MAAO,CACLA,QAASA,EACTnnB,kBAAmB8rC,EAAqBzP,EAAOqO,EAAa,CAC1DU,IAAK/O,EAAMgP,aACXC,kBAAmBjP,EAAMkP,oBAE3BL,UAAW/jB,EAAU,EAEzB,EACAgkB,OAAQ,SAAgB9O,EAAOqO,EAAa33B,GAC1C,OA7CJ,SAAiBspB,EAAOqO,EAAa33B,EAAU5a,GAC7C,IACIo0C,EAAY1C,EAAgB,CAAC,EAb1B,OAaiC92B,GAExC,OAAO,QAAY23B,EAAa6B,EAAWp0C,GAD3B,EAElB,CAwCWk0C,CAAQhQ,EAAOqO,EAAa33B,EAAU,CAC3Cq4B,IAAK/O,EAAMgP,aACXC,kBAAmBjP,EAAMkP,mBAE7B,EACAyB,QAAS,SAAiB3Q,EAAOqO,GAC/B,OAAO,QAAaA,EAAa,CAC/BU,IAAK/O,EAAMgP,aACXC,kBAAmBjP,EAAMkP,mBAhEtB,OAkEP,EACAG,oBAAqB,SAA6BC,EAAkBtP,EAAOqO,GACzE,OAAOiB,EAAiBzqC,QAAQ4qC,EAAqBzP,EAAOqO,EAAa,CACvEU,IAAK/O,EAAMgP,aACXC,kBAAmBjP,EAAMkP,oBACtB,EACP,EACA8B,YAAa,WACX,MAAO,CACLrC,GA3EG,OA6EP,qECpFF,SAAS,EAAQp0B,GAAkC,OAAO,EAAU,mBAAqBwD,QAAU,iBAAmBA,OAAOC,SAAW,SAAUzD,GAAO,cAAcA,CAAK,EAAI,SAAUA,GAAO,OAAOA,GAAO,mBAAqBwD,QAAUxD,EAAInW,cAAgB2Z,QAAUxD,IAAQwD,OAAOpjB,UAAY,gBAAkB4f,CAAK,EAAG,EAAQA,EAAM,CAC/U,SAASi4B,IAAiS,OAApRA,EAAWzyC,OAAOqgB,OAASrgB,OAAOqgB,OAAOrI,OAAS,SAAUmC,GAAU,IAAK,IAAI3e,EAAI,EAAGA,EAAII,UAAUD,OAAQH,IAAK,CAAE,IAAIwd,EAASpd,UAAUJ,GAAI,IAAK,IAAI6B,KAAO2b,EAAchZ,OAAOpF,UAAUwf,eAAepe,KAAKgd,EAAQ3b,KAAQ8c,EAAO9c,GAAO2b,EAAO3b,GAAU,CAAE,OAAO8c,CAAQ,EAAUs4B,EAASt2C,MAAMjC,KAAM0B,UAAY,CAElV,SAASi3C,EAAkB14B,EAAQ8lB,GAAS,IAAK,IAAIzkC,EAAI,EAAGA,EAAIykC,EAAMtkC,OAAQH,IAAK,CAAE,IAAIs3C,EAAa7S,EAAMzkC,GAAIs3C,EAAWl5B,WAAak5B,EAAWl5B,aAAc,EAAOk5B,EAAWh5B,cAAe,EAAU,UAAWg5B,IAAYA,EAAWj5B,UAAW,GAAM7Z,OAAOyd,eAAetD,EAAQ,EAAe24B,EAAWz1C,KAAMy1C,EAAa,CAAE,CAG5U,SAASC,EAAgBj1B,EAAG4C,GAA6I,OAAxIqyB,EAAkB/yC,OAAOgzC,eAAiBhzC,OAAOgzC,eAAeh7B,OAAS,SAAyB8F,EAAG4C,GAAsB,OAAjB5C,EAAEm1B,UAAYvyB,EAAU5C,CAAG,EAAUi1B,EAAgBj1B,EAAG4C,EAAI,CACvM,SAASwyB,EAAaC,GAAW,IAAIC,EAGrC,WAAuC,GAAuB,qBAAZC,UAA4BA,QAAQC,UAAW,OAAO,EAAO,GAAID,QAAQC,UAAUC,KAAM,OAAO,EAAO,GAAqB,oBAAVC,MAAsB,OAAO,EAAM,IAAsF,OAAhF/yC,QAAQ7F,UAAUumC,QAAQnlC,KAAKq3C,QAAQC,UAAU7yC,QAAS,IAAI,WAAa,MAAY,CAAM,CAAE,MAAO2T,GAAK,OAAO,CAAO,CAAE,CAHvQq/B,GAA6B,OAAO,WAAkC,IAAsCnlC,EAAlColC,EAAQC,EAAgBR,GAAkB,GAAIC,EAA2B,CAAE,IAAIQ,EAAYD,EAAgBz5C,MAAMmK,YAAaiK,EAAS+kC,QAAQC,UAAUI,EAAO93C,UAAWg4C,EAAY,MAAStlC,EAASolC,EAAMv3C,MAAMjC,KAAM0B,WAAc,OACpX,SAAoC0G,EAAMtG,GAAQ,GAAIA,IAA2B,WAAlB,EAAQA,IAAsC,oBAATA,GAAwB,OAAOA,EAAa,QAAa,IAATA,EAAmB,MAAM,IAAIf,UAAU,4DAA+D,OAAO44C,EAAuBvxC,EAAO,CAD4FwxC,CAA2B55C,KAAMoU,EAAS,CAAG,CAExa,SAASulC,EAAuBvxC,GAAQ,QAAa,IAATA,EAAmB,MAAM,IAAIyxC,eAAe,6DAAgE,OAAOzxC,CAAM,CAErK,SAASqxC,EAAgB71B,GAA+J,OAA1J61B,EAAkB3zC,OAAOgzC,eAAiBhzC,OAAOg0C,eAAeh8B,OAAS,SAAyB8F,GAAK,OAAOA,EAAEm1B,WAAajzC,OAAOg0C,eAAel2B,EAAI,EAAU61B,EAAgB71B,EAAI,CACnN,SAAS,EAAgBtD,EAAKnd,EAAK6B,GAA4L,OAAnL7B,EAAM,EAAeA,MAAiBmd,EAAOxa,OAAOyd,eAAejD,EAAKnd,EAAK,CAAE6B,MAAOA,EAAO0a,YAAY,EAAME,cAAc,EAAMD,UAAU,IAAkBW,EAAInd,GAAO6B,EAAgBsb,CAAK,CAC3O,SAAS,EAAejgB,GAAO,IAAI8C,EACnC,SAAsBqwC,EAAOC,GAAQ,GAAuB,WAAnB,EAAQD,IAAiC,OAAVA,EAAgB,OAAOA,EAAO,IAAIE,EAAOF,EAAM1vB,OAAO6vB,aAAc,QAAaxzC,IAATuzC,EAAoB,CAAE,IAAIv7B,EAAMu7B,EAAK5xC,KAAK0xC,EAAOC,GAAQ,WAAY,GAAqB,WAAjB,EAAQt7B,GAAmB,OAAOA,EAAK,MAAM,IAAIpX,UAAU,+CAAiD,CAAE,OAAiB,WAAT0yC,EAAoB10B,OAAS60B,QAAQJ,EAAQ,CADnV,CAAanzC,EAAK,UAAW,MAAwB,WAAjB,EAAQ8C,GAAoBA,EAAM4b,OAAO5b,EAAM,CAK5H,IAAI0lD,EAAoB,SAAUvO,IAblC,SAAmBC,EAAUC,GAAc,GAA0B,oBAAfA,GAA4C,OAAfA,EAAuB,MAAM,IAAIz5C,UAAU,sDAAyDw5C,EAAS75C,UAAYoF,OAAO2Z,OAAO+6B,GAAcA,EAAW95C,UAAW,CAAEyJ,YAAa,CAAEnF,MAAOu1C,EAAU56B,UAAU,EAAMC,cAAc,KAAW9Z,OAAOyd,eAAeg3B,EAAU,YAAa,CAAE56B,UAAU,IAAc66B,GAAY3B,EAAgB0B,EAAUC,EAAa,CAcjcC,CAAUoO,EAAMvO,GAChB,IAhBoBI,EAAaC,EAAYC,EAgBzCC,EAAS7B,EAAa6P,GAC1B,SAASA,IACP,IAAI/N,GApBR,SAAyBvxC,EAAUmxC,GAAe,KAAMnxC,aAAoBmxC,GAAgB,MAAM,IAAI35C,UAAU,oCAAwC,CAqBpJg6C,CAAgB/6C,KAAM6oD,GACtB,IAAK,IAAI5N,EAAOv5C,UAAUD,OAAQJ,EAAO,IAAIU,MAAMk5C,GAAOC,EAAO,EAAGA,EAAOD,EAAMC,IAC/E75C,EAAK65C,GAAQx5C,UAAUw5C,GAUzB,OAPA,EAAgBvB,EADhBmB,EAAQD,EAAO/4C,KAAKG,MAAM44C,EAAQ,CAAC76C,MAAMoF,OAAO/D,KACD,WAAW,SAAU6Y,IAC9D,QAAeA,KAGnB4gC,EAAM/U,MAAM+iB,UACZ5uC,EAAE6uC,iBACJ,IACOjO,CACT,CASA,OAzCoBJ,EAiCPmO,GAjCoBlO,EAiCd,CAAC,CAClBx3C,IAAK,SACL6B,MAAO,WACL,OAAoB,gBAAoB,IAAKuzC,EAAS,CAAC,EAAGv4C,KAAK+lC,MAAO,CACpE+iB,QAAS9oD,KAAK8oD,UAElB,MAvC0EnQ,EAAkB+B,EAAYh6C,UAAWi6C,GAAiBC,GAAajC,EAAkB+B,EAAaE,GAAc90C,OAAOyd,eAAem3B,EAAa,YAAa,CAAE/6B,UAAU,IAyCrPkpC,CACT,CA5BwB,CA4BtB,EAAA5L,WC9CF,SAAS,EAAQ38B,GAAkC,OAAO,EAAU,mBAAqBwD,QAAU,iBAAmBA,OAAOC,SAAW,SAAUzD,GAAO,cAAcA,CAAK,EAAI,SAAUA,GAAO,OAAOA,GAAO,mBAAqBwD,QAAUxD,EAAInW,cAAgB2Z,QAAUxD,IAAQwD,OAAOpjB,UAAY,gBAAkB4f,CAAK,EAAG,EAAQA,EAAM,CAE/U,SAAS,EAAkBL,EAAQ8lB,GAAS,IAAK,IAAIzkC,EAAI,EAAGA,EAAIykC,EAAMtkC,OAAQH,IAAK,CAAE,IAAIs3C,EAAa7S,EAAMzkC,GAAIs3C,EAAWl5B,WAAak5B,EAAWl5B,aAAc,EAAOk5B,EAAWh5B,cAAe,EAAU,UAAWg5B,IAAYA,EAAWj5B,UAAW,GAAM7Z,OAAOyd,eAAetD,EAAQ,EAAe24B,EAAWz1C,KAAMy1C,EAAa,CAAE,CAG5U,SAAS,EAAgBh1B,EAAG4C,GAA6I,OAAxI,EAAkB1gB,OAAOgzC,eAAiBhzC,OAAOgzC,eAAeh7B,OAAS,SAAyB8F,EAAG4C,GAAsB,OAAjB5C,EAAEm1B,UAAYvyB,EAAU5C,CAAG,EAAU,EAAgBA,EAAG4C,EAAI,CACvM,SAAS,EAAayyB,GAAW,IAAIC,EAGrC,WAAuC,GAAuB,qBAAZC,UAA4BA,QAAQC,UAAW,OAAO,EAAO,GAAID,QAAQC,UAAUC,KAAM,OAAO,EAAO,GAAqB,oBAAVC,MAAsB,OAAO,EAAM,IAAsF,OAAhF/yC,QAAQ7F,UAAUumC,QAAQnlC,KAAKq3C,QAAQC,UAAU7yC,QAAS,IAAI,WAAa,MAAY,CAAM,CAAE,MAAO2T,GAAK,OAAO,CAAO,CAAE,CAHvQ,GAA6B,OAAO,WAAkC,IAAsC9F,EAAlColC,EAAQ,EAAgBP,GAAkB,GAAIC,EAA2B,CAAE,IAAIQ,EAAY,EAAgB15C,MAAMmK,YAAaiK,EAAS+kC,QAAQC,UAAUI,EAAO93C,UAAWg4C,EAAY,MAAStlC,EAASolC,EAAMv3C,MAAMjC,KAAM0B,WAAc,OACpX,SAAoC0G,EAAMtG,GAAQ,GAAIA,IAA2B,WAAlB,EAAQA,IAAsC,oBAATA,GAAwB,OAAOA,EAAa,QAAa,IAATA,EAAmB,MAAM,IAAIf,UAAU,4DAA+D,OAC1P,SAAgCqH,GAAQ,QAAa,IAATA,EAAmB,MAAM,IAAIyxC,eAAe,6DAAgE,OAAOzxC,CAAM,CAD4F,CAAuBA,EAAO,CAD4F,CAA2BpI,KAAMoU,EAAS,CAAG,CAIxa,SAAS,EAAgBwP,GAA+J,OAA1J,EAAkB9d,OAAOgzC,eAAiBhzC,OAAOg0C,eAAeh8B,OAAS,SAAyB8F,GAAK,OAAOA,EAAEm1B,WAAajzC,OAAOg0C,eAAel2B,EAAI,EAAU,EAAgBA,EAAI,CAEnN,SAAS,EAAevjB,GAAO,IAAI8C,EACnC,SAAsBqwC,EAAOC,GAAQ,GAAuB,WAAnB,EAAQD,IAAiC,OAAVA,EAAgB,OAAOA,EAAO,IAAIE,EAAOF,EAAM1vB,OAAO6vB,aAAc,QAAaxzC,IAATuzC,EAAoB,CAAE,IAAIv7B,EAAMu7B,EAAK5xC,KAAK0xC,EAAOC,GAAQ,WAAY,GAAqB,WAAjB,EAAQt7B,GAAmB,OAAOA,EAAK,MAAM,IAAIpX,UAAU,+CAAiD,CAAE,OAAiB,WAAT0yC,EAAoB10B,OAAS60B,QAAQJ,EAAQ,CADnV,CAAanzC,EAAK,UAAW,MAAwB,WAAjB,EAAQ8C,GAAoBA,EAAM4b,OAAO5b,EAAM,CDmC5H,EAAgB0lD,EAAM,YAAa,CACjCC,QAAS,SAAe5S,aC/B1B,IANyB51B,EAAKnd,EAAK6B,EAM/BgkD,EAAwB,SAAU1O,IAbtC,SAAmBC,EAAUC,GAAc,GAA0B,oBAAfA,GAA4C,OAAfA,EAAuB,MAAM,IAAIz5C,UAAU,sDAAyDw5C,EAAS75C,UAAYoF,OAAO2Z,OAAO+6B,GAAcA,EAAW95C,UAAW,CAAEyJ,YAAa,CAAEnF,MAAOu1C,EAAU56B,UAAU,EAAMC,cAAc,KAAW9Z,OAAOyd,eAAeg3B,EAAU,YAAa,CAAE56B,UAAU,IAAc66B,GAAY,EAAgBD,EAAUC,EAAa,CAcjc,CAAUwO,EAAU1O,GACpB,IAhBoBI,EAAaC,EAAYC,EAgBzCC,EAAS,EAAamO,GAC1B,SAASA,IAEP,OArBJ,SAAyBz/C,EAAUmxC,GAAe,KAAMnxC,aAAoBmxC,GAAgB,MAAM,IAAI35C,UAAU,oCAAwC,CAoBpJ,CAAgBf,KAAMgpD,GACfnO,EAAO54C,MAAMjC,KAAM0B,UAC5B,CA6BA,OAjDoBg5C,EAqBPsO,EArBoBrO,EAqBV,CAAC,CACtBx3C,IAAK,SACL6B,MAAO,WACL,IAAI43C,EAAc58C,KAAK+lC,MACrBkjB,EAAKrM,EAAYqM,GACjBnM,EAAYF,EAAYE,UACxBvI,EAAQqI,EAAYrI,MACpB2U,EAAWtM,EAAYsM,SACvBtU,EAAYgI,EAAYhI,UAC1B,OAAoB,gBAAoB,KAAM,CAC5CuU,UAAWF,EAAG,QAASrU,GAAa,uBACnCL,EAAMvrC,KAAI,SAAUoN,GACrB,OAAoB,gBAAoB,KAAM,CAC5CjT,SAAkBhD,IAAbiW,EAAKjT,IAAoBiT,EAAKpR,MAAQoR,EAAKjT,IAChDgmD,UAAWF,EAAG,OAAQ7yC,EAAKgzC,WAAahzC,EAAKizC,UAAY,iBAAkBjzC,EAAKizC,UAAY,iBAAkBjzC,EAAKkzC,WAClHlzC,EAAKizC,SAAwB,gBAAoB,OAAQ,CAC1DF,UAAWF,EAAG,cACE9oD,IAAfiW,EAAKogC,MAAsBpgC,EAAKpR,MAAQoR,EAAKogC,OAAsB,gBAAoBqS,EAAM,CAC9FM,UAAWF,EAAG,OAAQ7yC,EAAKgzC,UAAY,kBACvC,aAAchzC,EAAKmzC,UACnBC,KAAM1M,EAAU1mC,EAAKpR,OACrB8jD,QAAS,WACP,OAAOI,EAAS9yC,EAAKpR,MACvB,QACgB7E,IAAfiW,EAAKogC,MAAsBpgC,EAAKpR,MAAQoR,EAAKogC,OAClD,IACF,IA/C8DmE,GAAY,EAAkBD,EAAYh6C,UAAWi6C,GAAiBC,GAAa,EAAkBF,EAAaE,GAAc90C,OAAOyd,eAAem3B,EAAa,YAAa,CAAE/6B,UAAU,IAiDrPqpC,CACT,CApC4B,CAoC1B,EAAA/L,WA1CuB38B,EA2CT0oC,EA3Cc7lD,EA2CJ,YA3CS6B,EA2CI,CACrCikD,GAAI,SAAe/S,WACnB4G,UAAW,SAAe5G,WAC1B3B,MAAO,YAAkB,UAAgB,CACvCvvC,MAAO,cAAoB,CAAC,WAAkB,WAAkB,aAAmBkxC,WACnF/yC,IAAK,cAAoB,CAAC,WAAkB,aAC5CqzC,MAAO,SACP8S,SAAU,WACVC,UAAW,WACXF,SAAU,YAEZH,SAAU,SAAehT,WACzBtB,UAAW,SAAesB,aAvDgB/yC,EAAM,EAAeA,MAAiBmd,EAAOxa,OAAOyd,eAAejD,EAAKnd,EAAK,CAAE6B,MAAOA,EAAO0a,YAAY,EAAME,cAAc,EAAMD,UAAU,IAAkBW,EAAInd,GAAO6B,ECXtN,IAAIszC,EAAY,CAAC,gBAAiB,UAAW,aAAc,oBAAqB,UAAW,YAAa,eAAgB,WAAY,WAAY,SAAU,YAAa,YAAa,YAAa,aACjM,SAAS,EAAQh4B,GAAkC,OAAO,EAAU,mBAAqBwD,QAAU,iBAAmBA,OAAOC,SAAW,SAAUzD,GAAO,cAAcA,CAAK,EAAI,SAAUA,GAAO,OAAOA,GAAO,mBAAqBwD,QAAUxD,EAAInW,cAAgB2Z,QAAUxD,IAAQwD,OAAOpjB,UAAY,gBAAkB4f,CAAK,EAAG,EAAQA,EAAM,CAC/U,SAAS,IAAiS,OAApR,EAAWxa,OAAOqgB,OAASrgB,OAAOqgB,OAAOrI,OAAS,SAAUmC,GAAU,IAAK,IAAI3e,EAAI,EAAGA,EAAII,UAAUD,OAAQH,IAAK,CAAE,IAAIwd,EAASpd,UAAUJ,GAAI,IAAK,IAAI6B,KAAO2b,EAAchZ,OAAOpF,UAAUwf,eAAepe,KAAKgd,EAAQ3b,KAAQ8c,EAAO9c,GAAO2b,EAAO3b,GAAU,CAAE,OAAO8c,CAAQ,EAAU,EAAShe,MAAMjC,KAAM0B,UAAY,CAClV,SAAS82C,EAAyB15B,EAAQyB,GAAY,GAAc,MAAVzB,EAAgB,MAAO,CAAC,EAAG,IAAkE3b,EAAK7B,EAAnE2e,EACzF,SAAuCnB,EAAQyB,GAAY,GAAc,MAAVzB,EAAgB,MAAO,CAAC,EAAG,IAA2D3b,EAAK7B,EAA5D2e,EAAS,CAAC,EAAOO,EAAa1a,OAAOC,KAAK+Y,GAAqB,IAAKxd,EAAI,EAAGA,EAAIkf,EAAW/e,OAAQH,IAAO6B,EAAMqd,EAAWlf,GAAQif,EAAS9Z,QAAQtD,IAAQ,IAAa8c,EAAO9c,GAAO2b,EAAO3b,IAAQ,OAAO8c,CAAQ,CADhNw4B,CAA8B35B,EAAQyB,GAAuB,GAAIza,OAAO0d,sBAAuB,CAAE,IAAIk1B,EAAmB5yC,OAAO0d,sBAAsB1E,GAAS,IAAKxd,EAAI,EAAGA,EAAIo3C,EAAiBj3C,OAAQH,IAAO6B,EAAMu1C,EAAiBp3C,GAAQif,EAAS9Z,QAAQtD,IAAQ,GAAkB2C,OAAOpF,UAAUmjB,qBAAqB/hB,KAAKgd,EAAQ3b,KAAgB8c,EAAO9c,GAAO2b,EAAO3b,GAAQ,CAAE,OAAO8c,CAAQ,CAG3e,SAAS,EAAkBA,EAAQ8lB,GAAS,IAAK,IAAIzkC,EAAI,EAAGA,EAAIykC,EAAMtkC,OAAQH,IAAK,CAAE,IAAIs3C,EAAa7S,EAAMzkC,GAAIs3C,EAAWl5B,WAAak5B,EAAWl5B,aAAc,EAAOk5B,EAAWh5B,cAAe,EAAU,UAAWg5B,IAAYA,EAAWj5B,UAAW,GAAM7Z,OAAOyd,eAAetD,EAAQ,EAAe24B,EAAWz1C,KAAMy1C,EAAa,CAAE,CAG5U,SAAS,EAAgBh1B,EAAG4C,GAA6I,OAAxI,EAAkB1gB,OAAOgzC,eAAiBhzC,OAAOgzC,eAAeh7B,OAAS,SAAyB8F,EAAG4C,GAAsB,OAAjB5C,EAAEm1B,UAAYvyB,EAAU5C,CAAG,EAAU,EAAgBA,EAAG4C,EAAI,CACvM,SAAS,EAAayyB,GAAW,IAAIC,EAGrC,WAAuC,GAAuB,qBAAZC,UAA4BA,QAAQC,UAAW,OAAO,EAAO,GAAID,QAAQC,UAAUC,KAAM,OAAO,EAAO,GAAqB,oBAAVC,MAAsB,OAAO,EAAM,IAAsF,OAAhF/yC,QAAQ7F,UAAUumC,QAAQnlC,KAAKq3C,QAAQC,UAAU7yC,QAAS,IAAI,WAAa,MAAY,CAAM,CAAE,MAAO2T,GAAK,OAAO,CAAO,CAAE,CAHvQ,GAA6B,OAAO,WAAkC,IAAsC9F,EAAlColC,EAAQ,EAAgBP,GAAkB,GAAIC,EAA2B,CAAE,IAAIQ,EAAY,EAAgB15C,MAAMmK,YAAaiK,EAAS+kC,QAAQC,UAAUI,EAAO93C,UAAWg4C,EAAY,MAAStlC,EAASolC,EAAMv3C,MAAMjC,KAAM0B,WAAc,OACpX,SAAoC0G,EAAMtG,GAAQ,GAAIA,IAA2B,WAAlB,EAAQA,IAAsC,oBAATA,GAAwB,OAAOA,EAAa,QAAa,IAATA,EAAmB,MAAM,IAAIf,UAAU,4DAA+D,OAC1P,SAAgCqH,GAAQ,QAAa,IAATA,EAAmB,MAAM,IAAIyxC,eAAe,6DAAgE,OAAOzxC,CAAM,CAD4F,CAAuBA,EAAO,CAD4F,CAA2BpI,KAAMoU,EAAS,CAAG,CAIxa,SAAS,EAAgBwP,GAA+J,OAA1J,EAAkB9d,OAAOgzC,eAAiBhzC,OAAOg0C,eAAeh8B,OAAS,SAAyB8F,GAAK,OAAOA,EAAEm1B,WAAajzC,OAAOg0C,eAAel2B,EAAI,EAAU,EAAgBA,EAAI,CACnN,SAAS,EAAgBtD,EAAKnd,EAAK6B,GAA4L,OAAnL7B,EAAM,EAAeA,MAAiBmd,EAAOxa,OAAOyd,eAAejD,EAAKnd,EAAK,CAAE6B,MAAOA,EAAO0a,YAAY,EAAME,cAAc,EAAMD,UAAU,IAAkBW,EAAInd,GAAO6B,EAAgBsb,CAAK,CAC3O,SAAS,EAAejgB,GAAO,IAAI8C,EACnC,SAAsBqwC,EAAOC,GAAQ,GAAuB,WAAnB,EAAQD,IAAiC,OAAVA,EAAgB,OAAOA,EAAO,IAAIE,EAAOF,EAAM1vB,OAAO6vB,aAAc,QAAaxzC,IAATuzC,EAAoB,CAAE,IAAIv7B,EAAMu7B,EAAK5xC,KAAK0xC,EAAOC,GAAQ,WAAY,GAAqB,WAAjB,EAAQt7B,GAAmB,OAAOA,EAAK,MAAM,IAAIpX,UAAU,+CAAiD,CAAE,OAAiB,WAAT0yC,EAAoB10B,OAAS60B,QAAQJ,EAAQ,CADnV,CAAanzC,EAAK,UAAW,MAAwB,WAAjB,EAAQ8C,GAAoBA,EAAM4b,OAAO5b,EAAM,CAQ5H,IAAI8lD,GAAK,OAAiB,cAiB1B,SAASQ,EAASC,EAAaC,EAAUC,GACvC,IAAIztB,EAfN,SAAuBytB,EAASD,GAC9B,OAAO3jC,KAAKC,IAAI,EAAI2jC,EAAU,EAAGD,EACnC,CAaaE,CAAcD,EAASD,GAElC,GAAIxtB,IAASwtB,EAAU,OAAO,QAAM,CAClCjrB,MAAO,EACPC,IAAKgrB,EAAW,IAElB,IAAIG,EAlBN,SAA8BJ,EAAaE,EAASD,EAAUxtB,GAC5D,OAAIutB,GAAeE,EACVF,EAELA,GAAeC,EAAWC,EACrBztB,GAAQwtB,EAAWD,GAErBE,EAAU,CACnB,CAUoBG,CAAqBL,EAAaE,EAASD,EAAUxtB,GAEnE6tB,EAAQN,EAAcI,EACtBpkB,EAAOgkB,GAFQvtB,EAAO2tB,GAG1B,OAAO,QAAM,CACXprB,MAAOsrB,EAAQ,EACfrrB,IAAK+G,EAAO,GAEhB,CACA,IAAIukB,EAA0B,SAAU3P,IAjDxC,SAAmBC,EAAUC,GAAc,GAA0B,oBAAfA,GAA4C,OAAfA,EAAuB,MAAM,IAAIz5C,UAAU,sDAAyDw5C,EAAS75C,UAAYoF,OAAO2Z,OAAO+6B,GAAcA,EAAW95C,UAAW,CAAEyJ,YAAa,CAAEnF,MAAOu1C,EAAU56B,UAAU,EAAMC,cAAc,KAAW9Z,OAAOyd,eAAeg3B,EAAU,YAAa,CAAE56B,UAAU,IAAc66B,GAAY,EAAgBD,EAAUC,EAAa,CAkDjc,CAAUyP,EAAY3P,GACtB,IApDoBI,EAAaC,EAAYC,EAoDzCC,EAAS,EAAaoP,GAC1B,SAASA,IAEP,OAzDJ,SAAyB1gD,EAAUmxC,GAAe,KAAMnxC,aAAoBmxC,GAAgB,MAAM,IAAI35C,UAAU,oCAAwC,CAwDpJ,CAAgBf,KAAMiqD,GACfpP,EAAO54C,MAAMjC,KAAM0B,UAC5B,CAoGA,OA5JoBg5C,EAyDPuP,EAzDoBtP,EAyDR,CAAC,CACxBx3C,IAAK,UACL6B,MAAO,SAAiBskD,EAAUY,EAAgBllD,GAChD,IAAI43C,EAAc58C,KAAK+lC,MACrBlV,EAAU+rB,EAAY/rB,QACtBs5B,EAAavN,EAAYuN,WACzB/K,EAAYxC,EAAYwC,UAC1B,MAAO,CACLj8C,IAAK,GAAGiC,OAAOkkD,EAAU,KAAKlkD,OAAOJ,GACrCskD,SAAUA,EACVD,SAAUrkD,EAAQ,GAAKA,GAASghB,KAAKC,IAAIkkC,EAAYt5B,GACrD2lB,MAAO4I,EAAU8K,EAAgBllD,GACjCA,MAAOA,EACPukD,UAAWnK,EAAU,OAAOh6C,QAAO,QAAW8kD,IAAkBllD,GAEpE,GACC,CACD7B,IAAK,SACL6B,MAAO,WACL,IAAIolD,EAAepqD,KAAK+lC,MACtBskB,EAAgBD,EAAaE,cAC7Bz5B,EAAUu5B,EAAav5B,QACvBs5B,EAAaC,EAAaD,WAC1BzgD,EAAoB0gD,EAAa1gD,kBACjCkgD,EAAUQ,EAAaR,QACvBW,EAAYH,EAAaG,UACzBC,EAAeJ,EAAaI,aAC5BC,EAAWL,EAAaK,SACxBC,EAAWN,EAAaM,SACxB7V,EAASuV,EAAavV,OACtBiI,EAAYsN,EAAatN,UACzBlI,EAAYwV,EAAaxV,UACzBwK,EAAYgL,EAAahL,UACzB+J,EAAYiB,EAAajB,UACzBwB,EAAanS,EAAyB4R,EAAc9R,GAClDqR,EAAW3jC,KAAKC,IAAI4K,EAASs5B,GAC7BS,EAAWjB,EACXpV,EAAQ,GAmDZ,OAlDIgW,GACFhW,EAAMjyC,KAAK,CACTa,IAAK,QACLmmD,SAAU,kBACVD,SAAgC,IAAtB3/C,EACV8sC,MAAO4I,EAAU,SACjBp6C,MAAO,EACPukD,UAAWnK,EAAU,eAGrBoL,GACFjW,EAAMjyC,KAAK,CACTa,IAAK,WACLmmD,SAAU,qBACVD,SAAgC,IAAtB3/C,EACV8sC,MAAO4I,EAAU,YACjBp6C,MAAO0E,EAAoB,EAC3B6/C,UAAWnK,EAAU,kBAGzB7K,EAAQA,EAAMnvC,OAAOqkD,EAAS//C,EAAmBigD,EAAUC,GAAS5gD,KAAI,SAAUhE,GAChF,MAAO,CACL7B,IAAK6B,EACLskD,SAAU,aACV9S,MAAO4I,EAAU,OAAQp6C,GACzBA,MAAOA,EACPokD,SAAUpkD,IAAU0E,EACpB6/C,UAAWnK,EAAU,WAAYp6C,GAErC,KACIylD,GACFlW,EAAMjyC,KAAK,CACTa,IAAK,OACLmmD,SAAU,iBACVD,SAAU3/C,IAAsBkhD,GAAYA,GAAY,EACxDpU,MAAO4I,EAAU,QACjBp6C,MAAO0E,EAAoB,EAC3B6/C,UAAWnK,EAAU,cAGrBsL,GACFnW,EAAMjyC,KAAK,CACTa,IAAK,OACLmmD,SAAU,iBACVD,SAAU3/C,IAAsBkhD,GAAYA,GAAY,EACxDpU,MAAO4I,EAAU,QACjBp6C,MAAO4lD,EACPrB,UAAWnK,EAAU,cAGL,gBAAoB,MAAO,CAC7C+J,UAAW,IAAWF,EAAG,IAAKrU,GAAa,iBAAkBuU,IAC/C,gBAAoBkB,EAAe,EAAS,CAAC,EAAGM,EAAY,CAC1E1B,GAAIA,EACJ1U,MAAOA,EACP2U,SAAUrU,EACViI,UAAWA,EACXlI,UAAWA,KAEf,IA1J8D+F,GAAY,EAAkBD,EAAYh6C,UAAWi6C,GAAiBC,GAAa,EAAkBF,EAAaE,GAAc90C,OAAOyd,eAAem3B,EAAa,YAAa,CAAE/6B,UAAU,IA4JrPsqC,CACT,CA3G8B,CA2G5B,EAAAhN,WACF,EAAgBgN,EAAY,YAAa,CACvCp5B,QAAS,WAAiBqlB,WAC1BxsC,kBAAmB,WAAiBwsC,WACpCrB,OAAQ,SAAeqB,WACvB4G,UAAW,SAAe5G,WAC1BtB,UAAW,SAAesB,WAC1BkJ,UAAW,SAAelJ,WAC1BoU,cAAe,SACfC,UAAW,SACXC,aAAc,SACdC,SAAU,SACVC,SAAU,SACVd,QAAS,WACTO,WAAY,WACZhB,UAAW,aAEb,EAAgBc,EAAY,eAAgB,CAC1CK,cAAetB,EACfuB,WAAW,EACXC,cAAc,EACdC,UAAU,EACVC,UAAU,EACVd,QAAS,EACTO,WAAYrqB,IACZqpB,UAAW,KAEb,SAAe,EAAApK,EAAA,GAAa,CAC1B/uC,SAAU,SACViU,KAAM,SACN+lC,MAAO,OACPtkB,KAAM,OACN56B,KAAM,SAAcpB,GAClB,OAAOA,EAAkBqH,UAC3B,EACA85C,aAAc,gBACdC,SAAU,YACVC,UAAW,aACXC,SAAU,YACVC,SAAU,SAAkBvhD,GAC1B,MAAO,QAAQtE,OAAOsE,EAAkBqH,WAC1C,GAdF,CAeGk5C,GC9MH,SAAS,EAAQ3pC,GAAkC,OAAO,EAAU,mBAAqBwD,QAAU,iBAAmBA,OAAOC,SAAW,SAAUzD,GAAO,cAAcA,CAAK,EAAI,SAAUA,GAAO,OAAOA,GAAO,mBAAqBwD,QAAUxD,EAAInW,cAAgB2Z,QAAUxD,IAAQwD,OAAOpjB,UAAY,gBAAkB4f,CAAK,EAAG,EAAQA,EAAM,CAE/U,SAAS,EAAkBL,EAAQ8lB,GAAS,IAAK,IAAIzkC,EAAI,EAAGA,EAAIykC,EAAMtkC,OAAQH,IAAK,CAAE,IAAIs3C,EAAa7S,EAAMzkC,GAAIs3C,EAAWl5B,WAAak5B,EAAWl5B,aAAc,EAAOk5B,EAAWh5B,cAAe,EAAU,UAAWg5B,IAAYA,EAAWj5B,UAAW,GAAM7Z,OAAOyd,eAAetD,EAAQ,GAAe24B,EAAWz1C,KAAMy1C,EAAa,CAAE,CAG5U,SAAS,EAAgBh1B,EAAG4C,GAA6I,OAAxI,EAAkB1gB,OAAOgzC,eAAiBhzC,OAAOgzC,eAAeh7B,OAAS,SAAyB8F,EAAG4C,GAAsB,OAAjB5C,EAAEm1B,UAAYvyB,EAAU5C,CAAG,EAAU,EAAgBA,EAAG4C,EAAI,CACvM,SAAS,EAAayyB,GAAW,IAAIC,EAGrC,WAAuC,GAAuB,qBAAZC,UAA4BA,QAAQC,UAAW,OAAO,EAAO,GAAID,QAAQC,UAAUC,KAAM,OAAO,EAAO,GAAqB,oBAAVC,MAAsB,OAAO,EAAM,IAAsF,OAAhF/yC,QAAQ7F,UAAUumC,QAAQnlC,KAAKq3C,QAAQC,UAAU7yC,QAAS,IAAI,WAAa,MAAY,CAAM,CAAE,MAAO2T,GAAK,OAAO,CAAO,CAAE,CAHvQ,GAA6B,OAAO,WAAkC,IAAsC9F,EAAlColC,EAAQ,GAAgBP,GAAkB,GAAIC,EAA2B,CAAE,IAAIQ,EAAY,GAAgB15C,MAAMmK,YAAaiK,EAAS+kC,QAAQC,UAAUI,EAAO93C,UAAWg4C,EAAY,MAAStlC,EAASolC,EAAMv3C,MAAMjC,KAAM0B,WAAc,OACpX,SAAoC0G,EAAMtG,GAAQ,GAAIA,IAA2B,WAAlB,EAAQA,IAAsC,oBAATA,GAAwB,OAAOA,EAAa,QAAa,IAATA,EAAmB,MAAM,IAAIf,UAAU,4DAA+D,OAAO,GAAuBqH,EAAO,CAD4F,CAA2BpI,KAAMoU,EAAS,CAAG,CAExa,SAAS,GAAuBhM,GAAQ,QAAa,IAATA,EAAmB,MAAM,IAAIyxC,eAAe,6DAAgE,OAAOzxC,CAAM,CAErK,SAAS,GAAgBwb,GAA+J,OAA1J,GAAkB9d,OAAOgzC,eAAiBhzC,OAAOg0C,eAAeh8B,OAAS,SAAyB8F,GAAK,OAAOA,EAAEm1B,WAAajzC,OAAOg0C,eAAel2B,EAAI,EAAU,GAAgBA,EAAI,CACnN,SAAS,GAAgBtD,EAAKnd,EAAK6B,GAA4L,OAAnL7B,EAAM,GAAeA,MAAiBmd,EAAOxa,OAAOyd,eAAejD,EAAKnd,EAAK,CAAE6B,MAAOA,EAAO0a,YAAY,EAAME,cAAc,EAAMD,UAAU,IAAkBW,EAAInd,GAAO6B,EAAgBsb,CAAK,CAC3O,SAAS,GAAejgB,GAAO,IAAI8C,EACnC,SAAsBqwC,EAAOC,GAAQ,GAAuB,WAAnB,EAAQD,IAAiC,OAAVA,EAAgB,OAAOA,EAAO,IAAIE,EAAOF,EAAM1vB,OAAO6vB,aAAc,QAAaxzC,IAATuzC,EAAoB,CAAE,IAAIv7B,EAAMu7B,EAAK5xC,KAAK0xC,EAAOC,GAAQ,WAAY,GAAqB,WAAjB,EAAQt7B,GAAmB,OAAOA,EAAK,MAAM,IAAIpX,UAAU,+CAAiD,CAAE,OAAiB,WAAT0yC,EAAoB10B,OAAS60B,QAAQJ,EAAQ,CADnV,CAAanzC,EAAK,UAAW,MAAwB,WAAjB,EAAQ8C,GAAoBA,EAAM4b,OAAO5b,EAAM,CAM5H,IAAI,IAAK,OAAiB,SACtBi1C,IAA8B,IAAAb,gBAAc,WAAyB,IACvE2T,GAAgB9S,GAAeH,SAC/BkT,GAAgB/S,GAAeD,SAE7BiT,GAAqB,SAAU9Q,IAnBnC,SAAmBC,EAAUC,GAAc,GAA0B,oBAAfA,GAA4C,OAAfA,EAAuB,MAAM,IAAIz5C,UAAU,sDAAyDw5C,EAAS75C,UAAYoF,OAAO2Z,OAAO+6B,GAAcA,EAAW95C,UAAW,CAAEyJ,YAAa,CAAEnF,MAAOu1C,EAAU56B,UAAU,EAAMC,cAAc,KAAW9Z,OAAOyd,eAAeg3B,EAAU,YAAa,CAAE56B,UAAU,IAAc66B,GAAY,EAAgBD,EAAUC,EAAa,CAoBjc,CAAU4Q,EAAO9Q,GACjB,IAtBoBI,EAAaC,EAAYC,EAsBzCC,EAAS,EAAauQ,GAC1B,SAASA,IACP,IAAItQ,GA1BR,SAAyBvxC,EAAUmxC,GAAe,KAAMnxC,aAAoBmxC,GAAgB,MAAM,IAAI35C,UAAU,oCAAwC,CA2BpJ,CAAgBf,KAAMorD,GACtB,IAAK,IAAInQ,EAAOv5C,UAAUD,OAAQJ,EAAO,IAAIU,MAAMk5C,GAAOC,EAAO,EAAGA,EAAOD,EAAMC,IAC/E75C,EAAK65C,GAAQx5C,UAAUw5C,GAWzB,OARA,GAAgB,GADhBJ,EAAQD,EAAO/4C,KAAKG,MAAM44C,EAAQ,CAAC76C,MAAMoF,OAAO/D,KACD,QAAS,CACtDuzC,WAAW,IAEb,GAAgB,GAAuBkG,GAAQ,gBAAgB,SAAUuQ,GACvEvQ,EAAMn+B,SAAS,CACbi4B,UAAWyW,GAEf,IACOvQ,CACT,CAuBA,OA9DoBJ,EAwCP0Q,GAxCoBzQ,EAwCb,CAAC,CACnBx3C,IAAK,SACL6B,MAAO,WACL,IAAI43C,EAAc58C,KAAK+lC,MACrBpvB,EAAWimC,EAAYjmC,SACvBwyC,EAAYvM,EAAYuM,UACxBmC,EAAS1O,EAAY0O,OACrBC,EAAS3O,EAAY2O,OACnB3W,EAAY50C,KAAKkR,MAAM0jC,UAC3B,OAAoB,gBAAoB,MAAO,CAC7CuU,UAAW,IAAW,GAAG,IAAKvU,GAAa,iBAAkBuU,IAC5DmC,GAAuB,gBAAoB,MAAO,CACnDnC,UAAW,GAAG,WACbmC,GAAsB,gBAAoB,MAAO,CAClDnC,UAAW,GAAG,SACA,gBAAoBgC,GAAe,CACjDnmD,MAAOhF,KAAKwrD,cACX70C,IAAY40C,GAAuB,gBAAoB,MAAO,CAC/DpC,UAAW,GAAG,WACboC,GACL,MA5D0E,EAAkB7Q,EAAYh6C,UAAWi6C,GAAiBC,GAAa,EAAkBF,EAAaE,GAAc90C,OAAOyd,eAAem3B,EAAa,YAAa,CAAE/6B,UAAU,IA8DrPyrC,CACT,CA3CyB,CA2CvB,EAAAnO,WACF,GAAgBmO,GAAO,YAAa,CAClCz0C,SAAU,SAAeu/B,WACzBiT,UAAW,WACXmC,OAAQ,SACRC,OAAQ,WAEV,GAAgBH,GAAO,eAAgB,CACrCjC,UAAW,GACXmC,OAAQ,KACRC,OAAQ,OC5EV,SAAS,GAAQjrC,GAAkC,OAAO,GAAU,mBAAqBwD,QAAU,iBAAmBA,OAAOC,SAAW,SAAUzD,GAAO,cAAcA,CAAK,EAAI,SAAUA,GAAO,OAAOA,GAAO,mBAAqBwD,QAAUxD,EAAInW,cAAgB2Z,QAAUxD,IAAQwD,OAAOpjB,UAAY,gBAAkB4f,CAAK,EAAG,GAAQA,EAAM,CAE/U,SAAS,GAAkBL,EAAQ8lB,GAAS,IAAK,IAAIzkC,EAAI,EAAGA,EAAIykC,EAAMtkC,OAAQH,IAAK,CAAE,IAAIs3C,EAAa7S,EAAMzkC,GAAIs3C,EAAWl5B,WAAak5B,EAAWl5B,aAAc,EAAOk5B,EAAWh5B,cAAe,EAAU,UAAWg5B,IAAYA,EAAWj5B,UAAW,GAAM7Z,OAAOyd,eAAetD,EAAQ,GAAe24B,EAAWz1C,KAAMy1C,EAAa,CAAE,CAG5U,SAAS,GAAgBh1B,EAAG4C,GAA6I,OAAxI,GAAkB1gB,OAAOgzC,eAAiBhzC,OAAOgzC,eAAeh7B,OAAS,SAAyB8F,EAAG4C,GAAsB,OAAjB5C,EAAEm1B,UAAYvyB,EAAU5C,CAAG,EAAU,GAAgBA,EAAG4C,EAAI,CACvM,SAAS,GAAayyB,GAAW,IAAIC,EAGrC,WAAuC,GAAuB,qBAAZC,UAA4BA,QAAQC,UAAW,OAAO,EAAO,GAAID,QAAQC,UAAUC,KAAM,OAAO,EAAO,GAAqB,oBAAVC,MAAsB,OAAO,EAAM,IAAsF,OAAhF/yC,QAAQ7F,UAAUumC,QAAQnlC,KAAKq3C,QAAQC,UAAU7yC,QAAS,IAAI,WAAa,MAAY,CAAM,CAAE,MAAO2T,GAAK,OAAO,CAAO,CAAE,CAHvQ,GAA6B,OAAO,WAAkC,IAAsC9F,EAAlColC,EAAQ,GAAgBP,GAAkB,GAAIC,EAA2B,CAAE,IAAIQ,EAAY,GAAgB15C,MAAMmK,YAAaiK,EAAS+kC,QAAQC,UAAUI,EAAO93C,UAAWg4C,EAAY,MAAStlC,EAASolC,EAAMv3C,MAAMjC,KAAM0B,WAAc,OACpX,SAAoC0G,EAAMtG,GAAQ,GAAIA,IAA2B,WAAlB,GAAQA,IAAsC,oBAATA,GAAwB,OAAOA,EAAa,QAAa,IAATA,EAAmB,MAAM,IAAIf,UAAU,4DAA+D,OAC1P,SAAgCqH,GAAQ,QAAa,IAATA,EAAmB,MAAM,IAAIyxC,eAAe,6DAAgE,OAAOzxC,CAAM,CAD4F,CAAuBA,EAAO,CAD4F,CAA2BpI,KAAMoU,EAAS,CAAG,CAIxa,SAAS,GAAgBwP,GAA+J,OAA1J,GAAkB9d,OAAOgzC,eAAiBhzC,OAAOg0C,eAAeh8B,OAAS,SAAyB8F,GAAK,OAAOA,EAAEm1B,WAAajzC,OAAOg0C,eAAel2B,EAAI,EAAU,GAAgBA,EAAI,CAEnN,SAAS,GAAevjB,GAAO,IAAI8C,EACnC,SAAsBqwC,EAAOC,GAAQ,GAAuB,WAAnB,GAAQD,IAAiC,OAAVA,EAAgB,OAAOA,EAAO,IAAIE,EAAOF,EAAM1vB,OAAO6vB,aAAc,QAAaxzC,IAATuzC,EAAoB,CAAE,IAAIv7B,EAAMu7B,EAAK5xC,KAAK0xC,EAAOC,GAAQ,WAAY,GAAqB,WAAjB,GAAQt7B,GAAmB,OAAOA,EAAK,MAAM,IAAIpX,UAAU,+CAAiD,CAAE,OAAiB,WAAT0yC,EAAoB10B,OAAS60B,QAAQJ,EAAQ,CADnV,CAAanzC,EAAK,UAAW,MAAwB,WAAjB,GAAQ8C,GAAoBA,EAAM4b,OAAO5b,EAAM,CAK5H,IAAIsoD,GAAoC,SAAUnR,IAblD,SAAmBC,EAAUC,GAAc,GAA0B,oBAAfA,GAA4C,OAAfA,EAAuB,MAAM,IAAIz5C,UAAU,sDAAyDw5C,EAAS75C,UAAYoF,OAAO2Z,OAAO+6B,GAAcA,EAAW95C,UAAW,CAAEyJ,YAAa,CAAEnF,MAAOu1C,EAAU56B,UAAU,EAAMC,cAAc,KAAW9Z,OAAOyd,eAAeg3B,EAAU,YAAa,CAAE56B,UAAU,IAAc66B,GAAY,GAAgBD,EAAUC,EAAa,CAcjc,CAAUiR,EAAsBnR,GAChC,IAhBoBI,EAAaC,EAAYC,EAgBzCC,EAAS,GAAa4Q,GAC1B,SAASA,IAEP,OArBJ,SAAyBliD,EAAUmxC,GAAe,KAAMnxC,aAAoBmxC,GAAgB,MAAM,IAAI35C,UAAU,oCAAwC,CAoBpJ,CAAgBf,KAAMyrD,GACf5Q,EAAO54C,MAAMjC,KAAM0B,UAC5B,CAmBA,OAvCoBg5C,EAqBP+Q,GArBoB9Q,EAqBE,CAAC,CAClCx3C,IAAK,oBACL6B,MAAO,WACLhF,KAAK+lC,MAAMylB,aAAaxrD,KAAK+lC,MAAM6O,UACrC,GACC,CACDzxC,IAAK,qBACL6B,MAAO,SAA4Bq3C,GAC7BA,EAAUzH,YAAc50C,KAAK+lC,MAAM6O,WACrC50C,KAAK+lC,MAAMylB,aAAaxrD,KAAK+lC,MAAM6O,UAEvC,GACC,CACDzxC,IAAK,SACL6B,MAAO,WACL,OAAOhF,KAAK+lC,MAAMpvB,QACpB,MArC0E,GAAkB+jC,EAAYh6C,UAAWi6C,GAAiBC,GAAa,GAAkBF,EAAaE,GAAc90C,OAAOyd,eAAem3B,EAAa,YAAa,CAAE/6B,UAAU,IAuCrP8rC,CACT,CA1BwC,CA0BtC,EAAAxO,YAhCF,SAAyB38B,EAAKnd,EAAK6B,IAAS7B,EAAM,GAAeA,MAAiBmd,EAAOxa,OAAOyd,eAAejD,EAAKnd,EAAK,CAAE6B,MAAOA,EAAO0a,YAAY,EAAME,cAAc,EAAMD,UAAU,IAAkBW,EAAInd,GAAO6B,CAAqB,CAiC3O,CAAgBymD,GAAsB,YAAa,CACjD90C,SAAU,SAAeu/B,WACzBtB,UAAW,SAAesB,WAC1BsV,aAAc,SAAetV,aAE/B,IAAIwV,GAAe,SAAsB/V,GACvC,IAAIf,EAAYe,EAAKf,UACnBj+B,EAAWg/B,EAAKh/B,SAClB,OAAoB,gBAAoBu0C,GAAe,MAAM,SAAUM,GACrE,OAAoB,gBAAoBC,GAAsB,CAC5DD,aAAcA,EACd5W,UAAWA,GACVj+B,EACL,GACF,EACA+0C,GAAazX,UAAY,CACvBW,UAAW,SAAesB,WAC1Bv/B,SAAU,SAAeu/B,YAE3B,YCDA,SAAeyV,GAHQ,SAA0B5lB,GAC/C,OAAoB,gBAAoB,GAAsBA,EAAoB,gBAAoB,EAAYA,GACpH,GACmD,CACjDmX,aAAc,4FClDhB,SAAe,EAAA0L,EAAA,GAAgB,CAC7B7U,YAAa,eACbC,OAAQ,YACRG,iBAAkB,SAA0BpO,EAAOygB,EAAcnS,GAC/D,IAAInhC,GAAU,QAAWmhC,EAAe,CACtCS,IAAK/O,EAAMgP,aACXC,kBAAmBjP,EAAMkP,oBAE3B,OAAK/hC,EAGE,CACL04C,mBAAsDzrD,IAAvC+S,EAAQ24C,4BAA4C34C,EAAQ24C,2BAA6B,GAAK34C,EAAQwH,SAAWxH,EAAQ44C,aACxIpxC,OAAQxH,EAAQwH,OAChBoxC,aAAc54C,EAAQ44C,aACtB53C,iBAAkBhB,EAAQgB,kBANnB,IAQX,qECzBE+0C,GAAK,cAAiB,SACtB8C,EAAQ,SAAepW,GACzB,IAAIqW,EAAiBrW,EAAKwT,UACxBA,OAA+B,IAAnB6C,EAA4B,GAAKA,EAC7CJ,EAAgBjW,EAAKiW,cACrBlxC,EAASi7B,EAAKj7B,OACdoxC,EAAenW,EAAKmW,aACpB53C,EAAmByhC,EAAKzhC,iBACxBkrC,EAAYzJ,EAAKyJ,UACnB,OAAoB,gBAAoB,MAAO,CAC7C+J,UAAW,IAAWF,EAAG,IAAKE,IAChB,gBAAoB,OAAQ,CAC1CA,UAAWF,EAAG,SACb7J,EAAU,QAAS1kC,EAAQxG,EAAkB43C,EAAcF,IAChE,EACAG,EAAM9X,UAAY,CAChBkV,UAAW,WACXyC,cAAe,SAAe1V,WAC9Bx7B,OAAQ,WAAiBw7B,WACzB4V,aAAc,WACd53C,iBAAkB,WAAiBgiC,WACnCkJ,UAAW,SAAelJ,YAE5B,MCGA,EAAe+V,GDHA,EAAAlN,EAAA,GAAa,CAC1BjrC,MAAO,SAAejT,EAAGqrD,EAAIC,EAASP,GACpC,OAAOA,GAAiB/qD,IAAMsrD,EAAU,GAAG/mD,OAAO+mD,EAAQC,iBAAkB,oCAAoChnD,OAAOvE,EAAEurD,iBAAkB,cAAchnD,OAAO8mD,EAAGE,iBAAkB,MAAQ,GAAGhnD,OAAOvE,EAAEurD,iBAAkB,sBAAsBhnD,OAAO8mD,EAAGE,iBAAkB,KAC/Q,GAHF,CAIGL,GCDgC,CACjC7O,aAAc,6BChChB,OAOC,WACA,aAEA,IAAImC,EAAS,CAAC,EAAEn/B,eAEhB,SAASmsC,IAGR,IAFA,IAAIC,EAAU,GAELhrD,EAAI,EAAGA,EAAII,UAAUD,OAAQH,IAAK,CAC1C,IAAIjB,EAAMqB,UAAUJ,GAChBjB,IACHisD,EAAUC,EAAYD,EAASE,EAAWnsD,IAE5C,CAEA,OAAOisD,CACR,CAEA,SAASE,EAAYnsD,GACpB,GAAmB,kBAARA,GAAmC,kBAARA,EACrC,OAAOA,EAGR,GAAmB,kBAARA,EACV,MAAO,GAGR,GAAI0B,MAAMoF,QAAQ9G,GACjB,OAAOgsD,EAAWpqD,MAAM,KAAM5B,GAG/B,GAAIA,EAAI0Q,WAAajL,OAAOpF,UAAUqQ,WAAa1Q,EAAI0Q,SAASA,WAAWmtB,SAAS,iBACnF,OAAO79B,EAAI0Q,WAGZ,IAAIu7C,EAAU,GAEd,IAAK,IAAInpD,KAAO9C,EACXg/C,EAAOv9C,KAAKzB,EAAK8C,IAAQ9C,EAAI8C,KAChCmpD,EAAUC,EAAYD,EAASnpD,IAIjC,OAAOmpD,CACR,CAEA,SAASC,EAAavnD,EAAOynD,GAC5B,OAAKA,EAIDznD,EACIA,EAAQ,IAAMynD,EAGfznD,EAAQynD,EAPPznD,CAQT,CAEqCxE,EAAOC,SAC3C4rD,EAAWK,QAAUL,EACrB7rD,EAAOC,QAAU4rD,QAKhB,KAFwB,EAAF,WACtB,OAAOA,CACP,UAFoB,OAEpB,YAIH,CArEA","sources":["webpack://lc3/./node_modules/@algolia/events/events.js","webpack://lc3/./node_modules/algoliasearch-helper/index.js","webpack://lc3/./node_modules/algoliasearch-helper/src/DerivedHelper/index.js","webpack://lc3/./node_modules/algoliasearch-helper/src/SearchParameters/RefinementList.js","webpack://lc3/./node_modules/algoliasearch-helper/src/SearchParameters/index.js","webpack://lc3/./node_modules/algoliasearch-helper/src/SearchResults/generate-hierarchical-tree.js","webpack://lc3/./node_modules/algoliasearch-helper/src/SearchResults/index.js","webpack://lc3/./node_modules/algoliasearch-helper/src/algoliasearch.helper.js","webpack://lc3/./node_modules/algoliasearch-helper/src/functions/compact.js","webpack://lc3/./node_modules/algoliasearch-helper/src/functions/defaultsPure.js","webpack://lc3/./node_modules/algoliasearch-helper/src/functions/escapeFacetValue.js","webpack://lc3/./node_modules/algoliasearch-helper/src/functions/find.js","webpack://lc3/./node_modules/algoliasearch-helper/src/functions/findIndex.js","webpack://lc3/./node_modules/algoliasearch-helper/src/functions/formatSort.js","webpack://lc3/./node_modules/algoliasearch-helper/src/functions/inherits.js","webpack://lc3/./node_modules/algoliasearch-helper/src/functions/intersection.js","webpack://lc3/./node_modules/algoliasearch-helper/src/functions/merge.js","webpack://lc3/./node_modules/algoliasearch-helper/src/functions/objectHasKeys.js","webpack://lc3/./node_modules/algoliasearch-helper/src/functions/omit.js","webpack://lc3/./node_modules/algoliasearch-helper/src/functions/orderBy.js","webpack://lc3/./node_modules/algoliasearch-helper/src/functions/valToNumber.js","webpack://lc3/./node_modules/algoliasearch-helper/src/requestBuilder.js","webpack://lc3/./node_modules/algoliasearch-helper/src/utils/isValidUserToken.js","webpack://lc3/./node_modules/algoliasearch-helper/src/version.js","webpack://lc3/./node_modules/algoliasearch/dist/algoliasearch.umd.js","webpack://lc3/./node_modules/lodash/_DataView.js","webpack://lc3/./node_modules/lodash/_Hash.js","webpack://lc3/./node_modules/lodash/_ListCache.js","webpack://lc3/./node_modules/lodash/_Map.js","webpack://lc3/./node_modules/lodash/_MapCache.js","webpack://lc3/./node_modules/lodash/_Promise.js","webpack://lc3/./node_modules/lodash/_Set.js","webpack://lc3/./node_modules/lodash/_SetCache.js","webpack://lc3/./node_modules/lodash/_Stack.js","webpack://lc3/./node_modules/lodash/_Uint8Array.js","webpack://lc3/./node_modules/lodash/_WeakMap.js","webpack://lc3/./node_modules/lodash/_apply.js","webpack://lc3/./node_modules/lodash/_arrayFilter.js","webpack://lc3/./node_modules/lodash/_arrayIncludes.js","webpack://lc3/./node_modules/lodash/_arrayIncludesWith.js","webpack://lc3/./node_modules/lodash/_arrayLikeKeys.js","webpack://lc3/./node_modules/lodash/_arrayMap.js","webpack://lc3/./node_modules/lodash/_arrayPush.js","webpack://lc3/./node_modules/lodash/_arraySome.js","webpack://lc3/./node_modules/lodash/_assignValue.js","webpack://lc3/./node_modules/lodash/_assocIndexOf.js","webpack://lc3/./node_modules/lodash/_baseAssignValue.js","webpack://lc3/./node_modules/lodash/_baseAt.js","webpack://lc3/./node_modules/lodash/_baseClamp.js","webpack://lc3/./node_modules/lodash/_baseDifference.js","webpack://lc3/./node_modules/lodash/_baseFill.js","webpack://lc3/./node_modules/lodash/_baseFindIndex.js","webpack://lc3/./node_modules/lodash/_baseFlatten.js","webpack://lc3/./node_modules/lodash/_baseGet.js","webpack://lc3/./node_modules/lodash/_baseGetAllKeys.js","webpack://lc3/./node_modules/lodash/_baseHasIn.js","webpack://lc3/./node_modules/lodash/_baseIndexOf.js","webpack://lc3/./node_modules/lodash/_baseIndexOfWith.js","webpack://lc3/./node_modules/lodash/_baseIntersection.js","webpack://lc3/./node_modules/lodash/_baseIsArguments.js","webpack://lc3/./node_modules/lodash/_baseIsEqual.js","webpack://lc3/./node_modules/lodash/_baseIsEqualDeep.js","webpack://lc3/./node_modules/lodash/_baseIsMatch.js","webpack://lc3/./node_modules/lodash/_baseIsNaN.js","webpack://lc3/./node_modules/lodash/_baseIsNative.js","webpack://lc3/./node_modules/lodash/_baseIsTypedArray.js","webpack://lc3/./node_modules/lodash/_baseIteratee.js","webpack://lc3/./node_modules/lodash/_baseKeys.js","webpack://lc3/./node_modules/lodash/_baseMatches.js","webpack://lc3/./node_modules/lodash/_baseMatchesProperty.js","webpack://lc3/./node_modules/lodash/_baseNth.js","webpack://lc3/./node_modules/lodash/_baseProperty.js","webpack://lc3/./node_modules/lodash/_basePropertyDeep.js","webpack://lc3/./node_modules/lodash/_basePullAll.js","webpack://lc3/./node_modules/lodash/_basePullAt.js","webpack://lc3/./node_modules/lodash/_baseRest.js","webpack://lc3/./node_modules/lodash/_baseSet.js","webpack://lc3/./node_modules/lodash/_baseSetToString.js","webpack://lc3/./node_modules/lodash/_baseSlice.js","webpack://lc3/./node_modules/lodash/_baseSortedIndex.js","webpack://lc3/./node_modules/lodash/_baseSortedIndexBy.js","webpack://lc3/./node_modules/lodash/_baseSortedUniq.js","webpack://lc3/./node_modules/lodash/_baseTimes.js","webpack://lc3/./node_modules/lodash/_baseToString.js","webpack://lc3/./node_modules/lodash/_baseTrim.js","webpack://lc3/./node_modules/lodash/_baseUnary.js","webpack://lc3/./node_modules/lodash/_baseUniq.js","webpack://lc3/./node_modules/lodash/_baseUnset.js","webpack://lc3/./node_modules/lodash/_baseWhile.js","webpack://lc3/./node_modules/lodash/_baseXor.js","webpack://lc3/./node_modules/lodash/_baseZipObject.js","webpack://lc3/./node_modules/lodash/_cacheHas.js","webpack://lc3/./node_modules/lodash/_castArrayLikeObject.js","webpack://lc3/./node_modules/lodash/_castPath.js","webpack://lc3/./node_modules/lodash/_compareAscending.js","webpack://lc3/./node_modules/lodash/_copyArray.js","webpack://lc3/./node_modules/lodash/_coreJsData.js","webpack://lc3/./node_modules/lodash/_createSet.js","webpack://lc3/./node_modules/lodash/_defineProperty.js","webpack://lc3/./node_modules/lodash/_equalArrays.js","webpack://lc3/./node_modules/lodash/_equalByTag.js","webpack://lc3/./node_modules/lodash/_equalObjects.js","webpack://lc3/./node_modules/lodash/_flatRest.js","webpack://lc3/./node_modules/lodash/_getAllKeys.js","webpack://lc3/./node_modules/lodash/_getMapData.js","webpack://lc3/./node_modules/lodash/_getMatchData.js","webpack://lc3/./node_modules/lodash/_getNative.js","webpack://lc3/./node_modules/lodash/_getSymbols.js","webpack://lc3/./node_modules/lodash/_getTag.js","webpack://lc3/./node_modules/lodash/_getValue.js","webpack://lc3/./node_modules/lodash/_hasPath.js","webpack://lc3/./node_modules/lodash/_hashClear.js","webpack://lc3/./node_modules/lodash/_hashDelete.js","webpack://lc3/./node_modules/lodash/_hashGet.js","webpack://lc3/./node_modules/lodash/_hashHas.js","webpack://lc3/./node_modules/lodash/_hashSet.js","webpack://lc3/./node_modules/lodash/_isFlattenable.js","webpack://lc3/./node_modules/lodash/_isIndex.js","webpack://lc3/./node_modules/lodash/_isIterateeCall.js","webpack://lc3/./node_modules/lodash/_isKey.js","webpack://lc3/./node_modules/lodash/_isKeyable.js","webpack://lc3/./node_modules/lodash/_isMasked.js","webpack://lc3/./node_modules/lodash/_isPrototype.js","webpack://lc3/./node_modules/lodash/_isStrictComparable.js","webpack://lc3/./node_modules/lodash/_listCacheClear.js","webpack://lc3/./node_modules/lodash/_listCacheDelete.js","webpack://lc3/./node_modules/lodash/_listCacheGet.js","webpack://lc3/./node_modules/lodash/_listCacheHas.js","webpack://lc3/./node_modules/lodash/_listCacheSet.js","webpack://lc3/./node_modules/lodash/_mapCacheClear.js","webpack://lc3/./node_modules/lodash/_mapCacheDelete.js","webpack://lc3/./node_modules/lodash/_mapCacheGet.js","webpack://lc3/./node_modules/lodash/_mapCacheHas.js","webpack://lc3/./node_modules/lodash/_mapCacheSet.js","webpack://lc3/./node_modules/lodash/_mapToArray.js","webpack://lc3/./node_modules/lodash/_matchesStrictComparable.js","webpack://lc3/./node_modules/lodash/_memoizeCapped.js","webpack://lc3/./node_modules/lodash/_nativeCreate.js","webpack://lc3/./node_modules/lodash/_nativeKeys.js","webpack://lc3/./node_modules/lodash/_nodeUtil.js","webpack://lc3/./node_modules/lodash/_overArg.js","webpack://lc3/./node_modules/lodash/_overRest.js","webpack://lc3/./node_modules/lodash/_parent.js","webpack://lc3/./node_modules/lodash/_setCacheAdd.js","webpack://lc3/./node_modules/lodash/_setCacheHas.js","webpack://lc3/./node_modules/lodash/_setToArray.js","webpack://lc3/./node_modules/lodash/_setToString.js","webpack://lc3/./node_modules/lodash/_shortOut.js","webpack://lc3/./node_modules/lodash/_stackClear.js","webpack://lc3/./node_modules/lodash/_stackDelete.js","webpack://lc3/./node_modules/lodash/_stackGet.js","webpack://lc3/./node_modules/lodash/_stackHas.js","webpack://lc3/./node_modules/lodash/_stackSet.js","webpack://lc3/./node_modules/lodash/_strictIndexOf.js","webpack://lc3/./node_modules/lodash/_strictLastIndexOf.js","webpack://lc3/./node_modules/lodash/_stringToPath.js","webpack://lc3/./node_modules/lodash/_toKey.js","webpack://lc3/./node_modules/lodash/_toSource.js","webpack://lc3/./node_modules/lodash/_trimmedEndIndex.js","webpack://lc3/./node_modules/lodash/array.js","webpack://lc3/./node_modules/lodash/chunk.js","webpack://lc3/./node_modules/lodash/compact.js","webpack://lc3/./node_modules/lodash/concat.js","webpack://lc3/./node_modules/lodash/constant.js","webpack://lc3/./node_modules/lodash/difference.js","webpack://lc3/./node_modules/lodash/differenceBy.js","webpack://lc3/./node_modules/lodash/differenceWith.js","webpack://lc3/./node_modules/lodash/drop.js","webpack://lc3/./node_modules/lodash/dropRight.js","webpack://lc3/./node_modules/lodash/dropRightWhile.js","webpack://lc3/./node_modules/lodash/dropWhile.js","webpack://lc3/./node_modules/lodash/eq.js","webpack://lc3/./node_modules/lodash/fill.js","webpack://lc3/./node_modules/lodash/findIndex.js","webpack://lc3/./node_modules/lodash/findLastIndex.js","webpack://lc3/./node_modules/lodash/first.js","webpack://lc3/./node_modules/lodash/flatten.js","webpack://lc3/./node_modules/lodash/flattenDeep.js","webpack://lc3/./node_modules/lodash/flattenDepth.js","webpack://lc3/./node_modules/lodash/fromPairs.js","webpack://lc3/./node_modules/lodash/get.js","webpack://lc3/./node_modules/lodash/hasIn.js","webpack://lc3/./node_modules/lodash/head.js","webpack://lc3/./node_modules/lodash/identity.js","webpack://lc3/./node_modules/lodash/indexOf.js","webpack://lc3/./node_modules/lodash/initial.js","webpack://lc3/./node_modules/lodash/intersection.js","webpack://lc3/./node_modules/lodash/intersectionBy.js","webpack://lc3/./node_modules/lodash/intersectionWith.js","webpack://lc3/./node_modules/lodash/isArguments.js","webpack://lc3/./node_modules/lodash/isArrayLike.js","webpack://lc3/./node_modules/lodash/isArrayLikeObject.js","webpack://lc3/./node_modules/lodash/isBuffer.js","webpack://lc3/./node_modules/lodash/isFunction.js","webpack://lc3/./node_modules/lodash/isLength.js","webpack://lc3/./node_modules/lodash/isObject.js","webpack://lc3/./node_modules/lodash/isSymbol.js","webpack://lc3/./node_modules/lodash/isTypedArray.js","webpack://lc3/./node_modules/lodash/join.js","webpack://lc3/./node_modules/lodash/keys.js","webpack://lc3/./node_modules/lodash/last.js","webpack://lc3/./node_modules/lodash/lastIndexOf.js","webpack://lc3/./node_modules/lodash/memoize.js","webpack://lc3/./node_modules/lodash/noop.js","webpack://lc3/./node_modules/lodash/nth.js","webpack://lc3/./node_modules/lodash/property.js","webpack://lc3/./node_modules/lodash/pull.js","webpack://lc3/./node_modules/lodash/pullAll.js","webpack://lc3/./node_modules/lodash/pullAllBy.js","webpack://lc3/./node_modules/lodash/pullAllWith.js","webpack://lc3/./node_modules/lodash/pullAt.js","webpack://lc3/./node_modules/lodash/remove.js","webpack://lc3/./node_modules/lodash/reverse.js","webpack://lc3/./node_modules/lodash/slice.js","webpack://lc3/./node_modules/lodash/sortedIndex.js","webpack://lc3/./node_modules/lodash/sortedIndexBy.js","webpack://lc3/./node_modules/lodash/sortedIndexOf.js","webpack://lc3/./node_modules/lodash/sortedLastIndex.js","webpack://lc3/./node_modules/lodash/sortedLastIndexBy.js","webpack://lc3/./node_modules/lodash/sortedLastIndexOf.js","webpack://lc3/./node_modules/lodash/sortedUniq.js","webpack://lc3/./node_modules/lodash/sortedUniqBy.js","webpack://lc3/./node_modules/lodash/stubArray.js","webpack://lc3/./node_modules/lodash/stubFalse.js","webpack://lc3/./node_modules/lodash/tail.js","webpack://lc3/./node_modules/lodash/take.js","webpack://lc3/./node_modules/lodash/takeRight.js","webpack://lc3/./node_modules/lodash/takeRightWhile.js","webpack://lc3/./node_modules/lodash/takeWhile.js","webpack://lc3/./node_modules/lodash/toFinite.js","webpack://lc3/./node_modules/lodash/toInteger.js","webpack://lc3/./node_modules/lodash/toLength.js","webpack://lc3/./node_modules/lodash/toNumber.js","webpack://lc3/./node_modules/lodash/toString.js","webpack://lc3/./node_modules/lodash/union.js","webpack://lc3/./node_modules/lodash/unionBy.js","webpack://lc3/./node_modules/lodash/unionWith.js","webpack://lc3/./node_modules/lodash/uniq.js","webpack://lc3/./node_modules/lodash/uniqBy.js","webpack://lc3/./node_modules/lodash/uniqWith.js","webpack://lc3/./node_modules/lodash/unzip.js","webpack://lc3/./node_modules/lodash/unzipWith.js","webpack://lc3/./node_modules/lodash/without.js","webpack://lc3/./node_modules/lodash/xor.js","webpack://lc3/./node_modules/lodash/xorBy.js","webpack://lc3/./node_modules/lodash/xorWith.js","webpack://lc3/./node_modules/lodash/zip.js","webpack://lc3/./node_modules/lodash/zipObject.js","webpack://lc3/./node_modules/lodash/zipObjectDeep.js","webpack://lc3/./node_modules/lodash/zipWith.js","webpack://lc3/./node_modules/pluralize/pluralize.js","webpack://lc3/./node_modules/react-fast-compare/index.js","webpack://lc3/./node_modules/react-instantsearch-core/dist/es/connectors/connectCurrentRefinements.js","webpack://lc3/./node_modules/react-instantsearch-core/dist/es/connectors/connectHits.js","webpack://lc3/./node_modules/react-instantsearch-core/dist/es/connectors/connectRefinementList.js","webpack://lc3/./node_modules/react-instantsearch-core/dist/es/connectors/connectSearchBox.js","webpack://lc3/./node_modules/react-instantsearch-core/dist/es/connectors/connectStateResults.js","webpack://lc3/./node_modules/react-instantsearch-core/dist/es/core/context.js","webpack://lc3/./node_modules/react-instantsearch-core/dist/es/core/createConnector.js","webpack://lc3/./node_modules/react-instantsearch-core/dist/es/core/indexUtils.js","webpack://lc3/./node_modules/react-instantsearch-core/dist/es/core/translatable.js","webpack://lc3/./node_modules/react-instantsearch-core/dist/es/core/utils.js","webpack://lc3/./node_modules/react-instantsearch-core/dist/es/core/highlight.js","webpack://lc3/./node_modules/react-instantsearch-core/dist/es/core/createInstantSearchManager.js","webpack://lc3/./node_modules/react-instantsearch-core/dist/es/core/version.js","webpack://lc3/./node_modules/react-instantsearch-core/dist/es/core/createWidgetsManager.js","webpack://lc3/./node_modules/react-instantsearch-core/dist/es/core/createStore.js","webpack://lc3/./node_modules/react-instantsearch-core/dist/es/core/metadata.js","webpack://lc3/./node_modules/react-instantsearch-core/dist/es/widgets/InstantSearch.js","webpack://lc3/./node_modules/react-instantsearch-dom/dist/es/core/utils.js","webpack://lc3/./node_modules/react-instantsearch-core/dist/es/connectors/connectPagination.js","webpack://lc3/./node_modules/react-instantsearch-dom/dist/es/components/Link.js","webpack://lc3/./node_modules/react-instantsearch-dom/dist/es/components/LinkList.js","webpack://lc3/./node_modules/react-instantsearch-dom/dist/es/components/Pagination.js","webpack://lc3/./node_modules/react-instantsearch-dom/dist/es/components/Panel.js","webpack://lc3/./node_modules/react-instantsearch-dom/dist/es/components/PanelCallbackHandler.js","webpack://lc3/./node_modules/react-instantsearch-dom/dist/es/widgets/Pagination.js","webpack://lc3/./node_modules/react-instantsearch-core/dist/es/connectors/connectStats.js","webpack://lc3/./node_modules/react-instantsearch-dom/dist/es/components/Stats.js","webpack://lc3/./node_modules/react-instantsearch-dom/dist/es/widgets/Stats.js","webpack://lc3/./node_modules/react-instantsearch-dom/node_modules/classnames/index.js"],"sourcesContent":["// Copyright Joyent, Inc. and other Node contributors.\n//\n// Permission is hereby granted, free of charge, to any person obtaining a\n// copy of this software and associated documentation files (the\n// \"Software\"), to deal in the Software without restriction, including\n// without limitation the rights to use, copy, modify, merge, publish,\n// distribute, sublicense, and/or sell copies of the Software, and to permit\n// persons to whom the Software is furnished to do so, subject to the\n// following conditions:\n//\n// The above copyright notice and this permission notice shall be included\n// in all copies or substantial portions of the Software.\n//\n// THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS\n// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN\n// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,\n// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR\n// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE\n// USE OR OTHER DEALINGS IN THE SOFTWARE.\n\nfunction EventEmitter() {\n  this._events = this._events || {};\n  this._maxListeners = this._maxListeners || undefined;\n}\nmodule.exports = EventEmitter;\n\n// Backwards-compat with node 0.10.x\n// EventEmitter.EventEmitter = EventEmitter;\n\nEventEmitter.prototype._events = undefined;\nEventEmitter.prototype._maxListeners = undefined;\n\n// By default EventEmitters will print a warning if more than 10 listeners are\n// added to it. This is a useful default which helps finding memory leaks.\nEventEmitter.defaultMaxListeners = 10;\n\n// Obviously not all Emitters should be limited to 10. This function allows\n// that to be increased. Set to zero for unlimited.\nEventEmitter.prototype.setMaxListeners = function(n) {\n  if (!isNumber(n) || n < 0 || isNaN(n))\n    throw TypeError('n must be a positive number');\n  this._maxListeners = n;\n  return this;\n};\n\nEventEmitter.prototype.emit = function(type) {\n  var er, handler, len, args, i, listeners;\n\n  if (!this._events)\n    this._events = {};\n\n  // If there is no 'error' event listener then throw.\n  if (type === 'error') {\n    if (!this._events.error ||\n        (isObject(this._events.error) && !this._events.error.length)) {\n      er = arguments[1];\n      if (er instanceof Error) {\n        throw er; // Unhandled 'error' event\n      } else {\n        // At least give some kind of context to the user\n        var err = new Error('Uncaught, unspecified \"error\" event. (' + er + ')');\n        err.context = er;\n        throw err;\n      }\n    }\n  }\n\n  handler = this._events[type];\n\n  if (isUndefined(handler))\n    return false;\n\n  if (isFunction(handler)) {\n    switch (arguments.length) {\n      // fast cases\n      case 1:\n        handler.call(this);\n        break;\n      case 2:\n        handler.call(this, arguments[1]);\n        break;\n      case 3:\n        handler.call(this, arguments[1], arguments[2]);\n        break;\n      // slower\n      default:\n        args = Array.prototype.slice.call(arguments, 1);\n        handler.apply(this, args);\n    }\n  } else if (isObject(handler)) {\n    args = Array.prototype.slice.call(arguments, 1);\n    listeners = handler.slice();\n    len = listeners.length;\n    for (i = 0; i < len; i++)\n      listeners[i].apply(this, args);\n  }\n\n  return true;\n};\n\nEventEmitter.prototype.addListener = function(type, listener) {\n  var m;\n\n  if (!isFunction(listener))\n    throw TypeError('listener must be a function');\n\n  if (!this._events)\n    this._events = {};\n\n  // To avoid recursion in the case that type === \"newListener\"! Before\n  // adding it to the listeners, first emit \"newListener\".\n  if (this._events.newListener)\n    this.emit('newListener', type,\n              isFunction(listener.listener) ?\n              listener.listener : listener);\n\n  if (!this._events[type])\n    // Optimize the case of one listener. Don't need the extra array object.\n    this._events[type] = listener;\n  else if (isObject(this._events[type]))\n    // If we've already got an array, just append.\n    this._events[type].push(listener);\n  else\n    // Adding the second element, need to change to array.\n    this._events[type] = [this._events[type], listener];\n\n  // Check for listener leak\n  if (isObject(this._events[type]) && !this._events[type].warned) {\n    if (!isUndefined(this._maxListeners)) {\n      m = this._maxListeners;\n    } else {\n      m = EventEmitter.defaultMaxListeners;\n    }\n\n    if (m && m > 0 && this._events[type].length > m) {\n      this._events[type].warned = true;\n      console.error('(node) warning: possible EventEmitter memory ' +\n                    'leak detected. %d listeners added. ' +\n                    'Use emitter.setMaxListeners() to increase limit.',\n                    this._events[type].length);\n      if (typeof console.trace === 'function') {\n        // not supported in IE 10\n        console.trace();\n      }\n    }\n  }\n\n  return this;\n};\n\nEventEmitter.prototype.on = EventEmitter.prototype.addListener;\n\nEventEmitter.prototype.once = function(type, listener) {\n  if (!isFunction(listener))\n    throw TypeError('listener must be a function');\n\n  var fired = false;\n\n  function g() {\n    this.removeListener(type, g);\n\n    if (!fired) {\n      fired = true;\n      listener.apply(this, arguments);\n    }\n  }\n\n  g.listener = listener;\n  this.on(type, g);\n\n  return this;\n};\n\n// emits a 'removeListener' event iff the listener was removed\nEventEmitter.prototype.removeListener = function(type, listener) {\n  var list, position, length, i;\n\n  if (!isFunction(listener))\n    throw TypeError('listener must be a function');\n\n  if (!this._events || !this._events[type])\n    return this;\n\n  list = this._events[type];\n  length = list.length;\n  position = -1;\n\n  if (list === listener ||\n      (isFunction(list.listener) && list.listener === listener)) {\n    delete this._events[type];\n    if (this._events.removeListener)\n      this.emit('removeListener', type, listener);\n\n  } else if (isObject(list)) {\n    for (i = length; i-- > 0;) {\n      if (list[i] === listener ||\n          (list[i].listener && list[i].listener === listener)) {\n        position = i;\n        break;\n      }\n    }\n\n    if (position < 0)\n      return this;\n\n    if (list.length === 1) {\n      list.length = 0;\n      delete this._events[type];\n    } else {\n      list.splice(position, 1);\n    }\n\n    if (this._events.removeListener)\n      this.emit('removeListener', type, listener);\n  }\n\n  return this;\n};\n\nEventEmitter.prototype.removeAllListeners = function(type) {\n  var key, listeners;\n\n  if (!this._events)\n    return this;\n\n  // not listening for removeListener, no need to emit\n  if (!this._events.removeListener) {\n    if (arguments.length === 0)\n      this._events = {};\n    else if (this._events[type])\n      delete this._events[type];\n    return this;\n  }\n\n  // emit removeListener for all listeners on all events\n  if (arguments.length === 0) {\n    for (key in this._events) {\n      if (key === 'removeListener') continue;\n      this.removeAllListeners(key);\n    }\n    this.removeAllListeners('removeListener');\n    this._events = {};\n    return this;\n  }\n\n  listeners = this._events[type];\n\n  if (isFunction(listeners)) {\n    this.removeListener(type, listeners);\n  } else if (listeners) {\n    // LIFO order\n    while (listeners.length)\n      this.removeListener(type, listeners[listeners.length - 1]);\n  }\n  delete this._events[type];\n\n  return this;\n};\n\nEventEmitter.prototype.listeners = function(type) {\n  var ret;\n  if (!this._events || !this._events[type])\n    ret = [];\n  else if (isFunction(this._events[type]))\n    ret = [this._events[type]];\n  else\n    ret = this._events[type].slice();\n  return ret;\n};\n\nEventEmitter.prototype.listenerCount = function(type) {\n  if (this._events) {\n    var evlistener = this._events[type];\n\n    if (isFunction(evlistener))\n      return 1;\n    else if (evlistener)\n      return evlistener.length;\n  }\n  return 0;\n};\n\nEventEmitter.listenerCount = function(emitter, type) {\n  return emitter.listenerCount(type);\n};\n\nfunction isFunction(arg) {\n  return typeof arg === 'function';\n}\n\nfunction isNumber(arg) {\n  return typeof arg === 'number';\n}\n\nfunction isObject(arg) {\n  return typeof arg === 'object' && arg !== null;\n}\n\nfunction isUndefined(arg) {\n  return arg === void 0;\n}\n","'use strict';\n\nvar AlgoliaSearchHelper = require('./src/algoliasearch.helper');\nvar SearchParameters = require('./src/SearchParameters');\nvar SearchResults = require('./src/SearchResults');\n\n/**\n * The algoliasearchHelper module is the function that will let its\n * contains everything needed to use the Algoliasearch\n * Helper. It is a also a function that instanciate the helper.\n * To use the helper, you also need the Algolia JS client v3.\n * @example\n * //using the UMD build\n * var client = algoliasearch('latency', '6be0576ff61c053d5f9a3225e2a90f76');\n * var helper = algoliasearchHelper(client, 'bestbuy', {\n *   facets: ['shipping'],\n *   disjunctiveFacets: ['category']\n * });\n * helper.on('result', function(event) {\n *   console.log(event.results);\n * });\n * helper\n *   .toggleFacetRefinement('category', 'Movies & TV Shows')\n *   .toggleFacetRefinement('shipping', 'Free shipping')\n *   .search();\n * @example\n * // The helper is an event emitter using the node API\n * helper.on('result', updateTheResults);\n * helper.once('result', updateTheResults);\n * helper.removeListener('result', updateTheResults);\n * helper.removeAllListeners('result');\n * @module algoliasearchHelper\n * @param  {AlgoliaSearch} client an AlgoliaSearch client\n * @param  {string} index the name of the index to query\n * @param  {SearchParameters|object} opts an object defining the initial config of the search. It doesn't have to be a {SearchParameters}, just an object containing the properties you need from it.\n * @return {AlgoliaSearchHelper} The helper instance\n */\nfunction algoliasearchHelper(client, index, opts) {\n  return new AlgoliaSearchHelper(client, index, opts);\n}\n\n/**\n * The version currently used\n * @member module:algoliasearchHelper.version\n * @type {number}\n */\nalgoliasearchHelper.version = require('./src/version');\n\n/**\n * Constructor for the Helper.\n * @member module:algoliasearchHelper.AlgoliaSearchHelper\n * @type {AlgoliaSearchHelper}\n */\nalgoliasearchHelper.AlgoliaSearchHelper = AlgoliaSearchHelper;\n\n/**\n * Constructor for the object containing all the parameters of the search.\n * @member module:algoliasearchHelper.SearchParameters\n * @type {SearchParameters}\n */\nalgoliasearchHelper.SearchParameters = SearchParameters;\n\n/**\n * Constructor for the object containing the results of the search.\n * @member module:algoliasearchHelper.SearchResults\n * @type {SearchResults}\n */\nalgoliasearchHelper.SearchResults = SearchResults;\n\nmodule.exports = algoliasearchHelper;\n","'use strict';\n\nvar EventEmitter = require('@algolia/events');\n\nvar inherits = require('../functions/inherits');\n\n/**\n * A DerivedHelper is a way to create sub requests to\n * Algolia from a main helper.\n * @class\n * @classdesc The DerivedHelper provides an event based interface for search callbacks:\n *  - search: when a search is triggered using the `search()` method.\n *  - result: when the response is retrieved from Algolia and is processed.\n *    This event contains a {@link SearchResults} object and the\n *    {@link SearchParameters} corresponding to this answer.\n * @param {AlgoliaSearchHelper} mainHelper the main helper\n * @param {function} fn the function to create the derived state\n */\nfunction DerivedHelper(mainHelper, fn) {\n  this.main = mainHelper;\n  this.fn = fn;\n  this.lastResults = null;\n}\n\ninherits(DerivedHelper, EventEmitter);\n\n/**\n * Detach this helper from the main helper\n * @return {undefined}\n * @throws Error if the derived helper is already detached\n */\nDerivedHelper.prototype.detach = function () {\n  this.removeAllListeners();\n  this.main.detachDerivedHelper(this);\n};\n\nDerivedHelper.prototype.getModifiedState = function (parameters) {\n  return this.fn(parameters);\n};\n\nmodule.exports = DerivedHelper;\n","'use strict';\n\n/**\n * Functions to manipulate refinement lists\n *\n * The RefinementList is not formally defined through a prototype but is based\n * on a specific structure.\n *\n * @module SearchParameters.refinementList\n *\n * @typedef {string[]} SearchParameters.refinementList.Refinements\n * @typedef {Object.<string, SearchParameters.refinementList.Refinements>} SearchParameters.refinementList.RefinementList\n */\n\nvar defaultsPure = require('../functions/defaultsPure');\nvar objectHasKeys = require('../functions/objectHasKeys');\nvar omit = require('../functions/omit');\n\nvar lib = {\n  /**\n   * Adds a refinement to a RefinementList\n   * @param {RefinementList} refinementList the initial list\n   * @param {string} attribute the attribute to refine\n   * @param {string} value the value of the refinement, if the value is not a string it will be converted\n   * @return {RefinementList} a new and updated refinement list\n   */\n  addRefinement: function addRefinement(refinementList, attribute, value) {\n    if (lib.isRefined(refinementList, attribute, value)) {\n      return refinementList;\n    }\n\n    var valueAsString = '' + value;\n\n    var facetRefinement = !refinementList[attribute]\n      ? [valueAsString]\n      : refinementList[attribute].concat(valueAsString);\n\n    var mod = {};\n\n    mod[attribute] = facetRefinement;\n\n    return defaultsPure({}, mod, refinementList);\n  },\n  /**\n   * Removes refinement(s) for an attribute:\n   *  - if the value is specified removes the refinement for the value on the attribute\n   *  - if no value is specified removes all the refinements for this attribute\n   * @param {RefinementList} refinementList the initial list\n   * @param {string} attribute the attribute to refine\n   * @param {string} [value] the value of the refinement\n   * @return {RefinementList} a new and updated refinement lst\n   */\n  removeRefinement: function removeRefinement(\n    refinementList,\n    attribute,\n    value\n  ) {\n    if (value === undefined) {\n      // we use the \"filter\" form of clearRefinement, since it leaves empty values as-is\n      // the form with a string will remove the attribute completely\n      return lib.clearRefinement(refinementList, function (v, f) {\n        return attribute === f;\n      });\n    }\n\n    var valueAsString = '' + value;\n\n    return lib.clearRefinement(refinementList, function (v, f) {\n      return attribute === f && valueAsString === v;\n    });\n  },\n  /**\n   * Toggles the refinement value for an attribute.\n   * @param {RefinementList} refinementList the initial list\n   * @param {string} attribute the attribute to refine\n   * @param {string} value the value of the refinement\n   * @return {RefinementList} a new and updated list\n   */\n  toggleRefinement: function toggleRefinement(\n    refinementList,\n    attribute,\n    value\n  ) {\n    if (value === undefined)\n      throw new Error('toggleRefinement should be used with a value');\n\n    if (lib.isRefined(refinementList, attribute, value)) {\n      return lib.removeRefinement(refinementList, attribute, value);\n    }\n\n    return lib.addRefinement(refinementList, attribute, value);\n  },\n  /**\n   * Clear all or parts of a RefinementList. Depending on the arguments, three\n   * kinds of behavior can happen:\n   *  - if no attribute is provided: clears the whole list\n   *  - if an attribute is provided as a string: clears the list for the specific attribute\n   *  - if an attribute is provided as a function: discards the elements for which the function returns true\n   * @param {RefinementList} refinementList the initial list\n   * @param {string} [attribute] the attribute or function to discard\n   * @param {string} [refinementType] optional parameter to give more context to the attribute function\n   * @return {RefinementList} a new and updated refinement list\n   */\n  clearRefinement: function clearRefinement(\n    refinementList,\n    attribute,\n    refinementType\n  ) {\n    if (attribute === undefined) {\n      // return the same object if the list is already empty\n      // this is mainly for tests, as it doesn't have much impact on performance\n      if (!objectHasKeys(refinementList)) {\n        return refinementList;\n      }\n      return {};\n    } else if (typeof attribute === 'string') {\n      return omit(refinementList, [attribute]);\n    } else if (typeof attribute === 'function') {\n      var hasChanged = false;\n\n      var newRefinementList = Object.keys(refinementList).reduce(function (\n        memo,\n        key\n      ) {\n        var values = refinementList[key] || [];\n        var facetList = values.filter(function (value) {\n          return !attribute(value, key, refinementType);\n        });\n\n        if (facetList.length !== values.length) {\n          hasChanged = true;\n        }\n\n        memo[key] = facetList;\n\n        return memo;\n      },\n      {});\n\n      if (hasChanged) return newRefinementList;\n      return refinementList;\n    }\n\n    // We return nothing if the attribute is not undefined, a string or a function,\n    // as it is not a valid value for a refinement\n    return undefined;\n  },\n  /**\n   * Test if the refinement value is used for the attribute. If no refinement value\n   * is provided, test if the refinementList contains any refinement for the\n   * given attribute.\n   * @param {RefinementList} refinementList the list of refinement\n   * @param {string} attribute name of the attribute\n   * @param {string} [refinementValue] value of the filter/refinement\n   * @return {boolean} true if the attribute is refined, false otherwise\n   */\n  isRefined: function isRefined(refinementList, attribute, refinementValue) {\n    var containsRefinements =\n      Boolean(refinementList[attribute]) &&\n      refinementList[attribute].length > 0;\n\n    if (refinementValue === undefined || !containsRefinements) {\n      return containsRefinements;\n    }\n\n    var refinementValueAsString = '' + refinementValue;\n\n    return refinementList[attribute].indexOf(refinementValueAsString) !== -1;\n  },\n};\n\nmodule.exports = lib;\n","'use strict';\n\nvar defaultsPure = require('../functions/defaultsPure');\nvar find = require('../functions/find');\nvar intersection = require('../functions/intersection');\nvar merge = require('../functions/merge');\nvar objectHasKeys = require('../functions/objectHasKeys');\nvar omit = require('../functions/omit');\nvar valToNumber = require('../functions/valToNumber');\nvar isValidUserToken = require('../utils/isValidUserToken');\n\nvar RefinementList = require('./RefinementList');\n\n/**\n * isEqual, but only for numeric refinement values, possible values:\n * - 5\n * - [5]\n * - [[5]]\n * - [[5,5],[4]]\n * @param {any} a numeric refinement value\n * @param {any} b numeric refinement value\n * @return {boolean} true if the values are equal\n */\nfunction isEqualNumericRefinement(a, b) {\n  if (Array.isArray(a) && Array.isArray(b)) {\n    return (\n      a.length === b.length &&\n      a.every(function (el, i) {\n        return isEqualNumericRefinement(b[i], el);\n      })\n    );\n  }\n  return a === b;\n}\n\n/**\n * like _.find but using deep equality to be able to use it\n * to find arrays.\n * @private\n * @param {any[]} array array to search into (elements are base or array of base)\n * @param {any} searchedValue the value we're looking for (base or array of base)\n * @return {any} the searched value or undefined\n */\nfunction findArray(array, searchedValue) {\n  return find(array, function (currentValue) {\n    return isEqualNumericRefinement(currentValue, searchedValue);\n  });\n}\n\n/**\n * The facet list is the structure used to store the list of values used to\n * filter a single attribute.\n * @typedef {string[]} SearchParameters.FacetList\n */\n\n/**\n * Structure to store numeric filters with the operator as the key. The supported operators\n * are `=`, `>`, `<`, `>=`, `<=` and `!=`.\n * @typedef {Object.<string, Array.<number|number[]>>} SearchParameters.OperatorList\n */\n\n/**\n * SearchParameters is the data structure that contains all the information\n * usable for making a search to Algolia API. It doesn't do the search itself,\n * nor does it contains logic about the parameters.\n * It is an immutable object, therefore it has been created in a way that each\n * changes does not change the object itself but returns a copy with the\n * modification.\n * This object should probably not be instantiated outside of the helper. It will\n * be provided when needed. This object is documented for reference as you'll\n * get it from events generated by the {@link AlgoliaSearchHelper}.\n * If need be, instantiate the Helper from the factory function {@link SearchParameters.make}\n * @constructor\n * @classdesc contains all the parameters of a search\n * @param {object|SearchParameters} newParameters existing parameters or partial object\n * for the properties of a new SearchParameters\n * @see SearchParameters.make\n * @example <caption>SearchParameters of the first query in\n *   <a href=\"http://demos.algolia.com/instant-search-demo/\">the instant search demo</a></caption>\n{\n   \"query\": \"\",\n   \"disjunctiveFacets\": [\n      \"customerReviewCount\",\n      \"category\",\n      \"salePrice_range\",\n      \"manufacturer\"\n  ],\n   \"maxValuesPerFacet\": 30,\n   \"page\": 0,\n   \"hitsPerPage\": 10,\n   \"facets\": [\n      \"type\",\n      \"shipping\"\n  ]\n}\n */\nfunction SearchParameters(newParameters) {\n  var params = newParameters\n    ? SearchParameters._parseNumbers(newParameters)\n    : {};\n\n  if (params.userToken !== undefined && !isValidUserToken(params.userToken)) {\n    // eslint-disable-next-line no-console\n    console.warn(\n      '[algoliasearch-helper] The `userToken` parameter is invalid. This can lead to wrong analytics.\\n  - Format: [a-zA-Z0-9_-]{1,64}'\n    );\n  }\n  /**\n   * This attribute contains the list of all the conjunctive facets\n   * used. This list will be added to requested facets in the\n   * [facets attribute](https://www.algolia.com/doc/rest-api/search#param-facets) sent to algolia.\n   * @member {string[]}\n   */\n  this.facets = params.facets || [];\n  /**\n   * This attribute contains the list of all the disjunctive facets\n   * used. This list will be added to requested facets in the\n   * [facets attribute](https://www.algolia.com/doc/rest-api/search#param-facets) sent to algolia.\n   * @member {string[]}\n   */\n  this.disjunctiveFacets = params.disjunctiveFacets || [];\n  /**\n   * This attribute contains the list of all the hierarchical facets\n   * used. This list will be added to requested facets in the\n   * [facets attribute](https://www.algolia.com/doc/rest-api/search#param-facets) sent to algolia.\n   * Hierarchical facets are a sub type of disjunctive facets that\n   * let you filter faceted attributes hierarchically.\n   * @member {string[]|object[]}\n   */\n  this.hierarchicalFacets = params.hierarchicalFacets || [];\n\n  // Refinements\n  /**\n   * This attribute contains all the filters that need to be\n   * applied on the conjunctive facets. Each facet must be properly\n   * defined in the `facets` attribute.\n   *\n   * The key is the name of the facet, and the `FacetList` contains all\n   * filters selected for the associated facet name.\n   *\n   * When querying algolia, the values stored in this attribute will\n   * be translated into the `facetFilters` attribute.\n   * @member {Object.<string, SearchParameters.FacetList>}\n   */\n  this.facetsRefinements = params.facetsRefinements || {};\n  /**\n   * This attribute contains all the filters that need to be\n   * excluded from the conjunctive facets. Each facet must be properly\n   * defined in the `facets` attribute.\n   *\n   * The key is the name of the facet, and the `FacetList` contains all\n   * filters excluded for the associated facet name.\n   *\n   * When querying algolia, the values stored in this attribute will\n   * be translated into the `facetFilters` attribute.\n   * @member {Object.<string, SearchParameters.FacetList>}\n   */\n  this.facetsExcludes = params.facetsExcludes || {};\n  /**\n   * This attribute contains all the filters that need to be\n   * applied on the disjunctive facets. Each facet must be properly\n   * defined in the `disjunctiveFacets` attribute.\n   *\n   * The key is the name of the facet, and the `FacetList` contains all\n   * filters selected for the associated facet name.\n   *\n   * When querying algolia, the values stored in this attribute will\n   * be translated into the `facetFilters` attribute.\n   * @member {Object.<string, SearchParameters.FacetList>}\n   */\n  this.disjunctiveFacetsRefinements = params.disjunctiveFacetsRefinements || {};\n  /**\n   * This attribute contains all the filters that need to be\n   * applied on the numeric attributes.\n   *\n   * The key is the name of the attribute, and the value is the\n   * filters to apply to this attribute.\n   *\n   * When querying algolia, the values stored in this attribute will\n   * be translated into the `numericFilters` attribute.\n   * @member {Object.<string, SearchParameters.OperatorList>}\n   */\n  this.numericRefinements = params.numericRefinements || {};\n  /**\n   * This attribute contains all the tags used to refine the query.\n   *\n   * When querying algolia, the values stored in this attribute will\n   * be translated into the `tagFilters` attribute.\n   * @member {string[]}\n   */\n  this.tagRefinements = params.tagRefinements || [];\n  /**\n   * This attribute contains all the filters that need to be\n   * applied on the hierarchical facets. Each facet must be properly\n   * defined in the `hierarchicalFacets` attribute.\n   *\n   * The key is the name of the facet, and the `FacetList` contains all\n   * filters selected for the associated facet name. The FacetList values\n   * are structured as a string that contain the values for each level\n   * separated by the configured separator.\n   *\n   * When querying algolia, the values stored in this attribute will\n   * be translated into the `facetFilters` attribute.\n   * @member {Object.<string, SearchParameters.FacetList>}\n   */\n  this.hierarchicalFacetsRefinements =\n    params.hierarchicalFacetsRefinements || {};\n\n  // eslint-disable-next-line consistent-this\n  var self = this;\n  Object.keys(params).forEach(function (paramName) {\n    var isKeyKnown = SearchParameters.PARAMETERS.indexOf(paramName) !== -1;\n    var isValueDefined = params[paramName] !== undefined;\n\n    if (!isKeyKnown && isValueDefined) {\n      self[paramName] = params[paramName];\n    }\n  });\n}\n\n/**\n * List all the properties in SearchParameters and therefore all the known Algolia properties\n * This doesn't contain any beta/hidden features.\n * @private\n */\nSearchParameters.PARAMETERS = Object.keys(new SearchParameters());\n\n/**\n * @private\n * @param {object} partialState full or part of a state\n * @return {object} a new object with the number keys as number\n */\nSearchParameters._parseNumbers = function (partialState) {\n  // Do not parse numbers again in SearchParameters, they ought to be parsed already\n  if (partialState instanceof SearchParameters) return partialState;\n\n  var numbers = {};\n\n  var numberKeys = [\n    'aroundPrecision',\n    'aroundRadius',\n    'getRankingInfo',\n    'minWordSizefor2Typos',\n    'minWordSizefor1Typo',\n    'page',\n    'maxValuesPerFacet',\n    'distinct',\n    'minimumAroundRadius',\n    'hitsPerPage',\n    'minProximity',\n  ];\n\n  numberKeys.forEach(function (k) {\n    var value = partialState[k];\n    if (typeof value === 'string') {\n      var parsedValue = parseFloat(value);\n      // global isNaN is ok to use here, value is only number or NaN\n      numbers[k] = isNaN(parsedValue) ? value : parsedValue;\n    }\n  });\n\n  // there's two formats of insideBoundingBox, we need to parse\n  // the one which is an array of float geo rectangles\n  if (Array.isArray(partialState.insideBoundingBox)) {\n    numbers.insideBoundingBox = partialState.insideBoundingBox.map(function (\n      geoRect\n    ) {\n      if (Array.isArray(geoRect)) {\n        return geoRect.map(function (value) {\n          return parseFloat(value);\n        });\n      }\n      return geoRect;\n    });\n  }\n\n  if (partialState.numericRefinements) {\n    var numericRefinements = {};\n    Object.keys(partialState.numericRefinements).forEach(function (attribute) {\n      var operators = partialState.numericRefinements[attribute] || {};\n      numericRefinements[attribute] = {};\n      Object.keys(operators).forEach(function (operator) {\n        var values = operators[operator];\n        var parsedValues = values.map(function (v) {\n          if (Array.isArray(v)) {\n            return v.map(function (vPrime) {\n              if (typeof vPrime === 'string') {\n                return parseFloat(vPrime);\n              }\n              return vPrime;\n            });\n          } else if (typeof v === 'string') {\n            return parseFloat(v);\n          }\n          return v;\n        });\n        numericRefinements[attribute][operator] = parsedValues;\n      });\n    });\n    numbers.numericRefinements = numericRefinements;\n  }\n\n  return merge({}, partialState, numbers);\n};\n\n/**\n * Factory for SearchParameters\n * @param {object|SearchParameters} newParameters existing parameters or partial\n * object for the properties of a new SearchParameters\n * @return {SearchParameters} frozen instance of SearchParameters\n */\nSearchParameters.make = function makeSearchParameters(newParameters) {\n  var instance = new SearchParameters(newParameters);\n\n  var hierarchicalFacets = newParameters.hierarchicalFacets || [];\n  hierarchicalFacets.forEach(function (facet) {\n    if (facet.rootPath) {\n      var currentRefinement = instance.getHierarchicalRefinement(facet.name);\n\n      if (\n        currentRefinement.length > 0 &&\n        currentRefinement[0].indexOf(facet.rootPath) !== 0\n      ) {\n        instance = instance.clearRefinements(facet.name);\n      }\n\n      // get it again in case it has been cleared\n      currentRefinement = instance.getHierarchicalRefinement(facet.name);\n      if (currentRefinement.length === 0) {\n        instance = instance.toggleHierarchicalFacetRefinement(\n          facet.name,\n          facet.rootPath\n        );\n      }\n    }\n  });\n\n  return instance;\n};\n\n/**\n * Validates the new parameters based on the previous state\n * @param {SearchParameters} currentState the current state\n * @param {object|SearchParameters} parameters the new parameters to set\n * @return {Error|null} Error if the modification is invalid, null otherwise\n */\nSearchParameters.validate = function (currentState, parameters) {\n  var params = parameters || {};\n\n  if (\n    currentState.tagFilters &&\n    params.tagRefinements &&\n    params.tagRefinements.length > 0\n  ) {\n    return new Error(\n      '[Tags] Cannot switch from the managed tag API to the advanced API. It is probably ' +\n        'an error, if it is really what you want, you should first clear the tags with clearTags method.'\n    );\n  }\n\n  if (currentState.tagRefinements.length > 0 && params.tagFilters) {\n    return new Error(\n      '[Tags] Cannot switch from the advanced tag API to the managed API. It is probably ' +\n        'an error, if it is not, you should first clear the tags with clearTags method.'\n    );\n  }\n\n  if (\n    currentState.numericFilters &&\n    params.numericRefinements &&\n    objectHasKeys(params.numericRefinements)\n  ) {\n    return new Error(\n      \"[Numeric filters] Can't switch from the advanced to the managed API. It\" +\n        ' is probably an error, if this is really what you want, you have to first' +\n        ' clear the numeric filters.'\n    );\n  }\n\n  if (objectHasKeys(currentState.numericRefinements) && params.numericFilters) {\n    return new Error(\n      \"[Numeric filters] Can't switch from the managed API to the advanced. It\" +\n        ' is probably an error, if this is really what you want, you have to first' +\n        ' clear the numeric filters.'\n    );\n  }\n\n  return null;\n};\n\nSearchParameters.prototype = {\n  constructor: SearchParameters,\n\n  /**\n   * Remove all refinements (disjunctive + conjunctive + excludes + numeric filters)\n   * @method\n   * @param {undefined|string|SearchParameters.clearCallback} [attribute] optional string or function\n   * - If not given, means to clear all the filters.\n   * - If `string`, means to clear all refinements for the `attribute` named filter.\n   * - If `function`, means to clear all the refinements that return truthy values.\n   * @return {SearchParameters} new instance with filters cleared\n   */\n  clearRefinements: function clearRefinements(attribute) {\n    var patch = {\n      numericRefinements: this._clearNumericRefinements(attribute),\n      facetsRefinements: RefinementList.clearRefinement(\n        this.facetsRefinements,\n        attribute,\n        'conjunctiveFacet'\n      ),\n      facetsExcludes: RefinementList.clearRefinement(\n        this.facetsExcludes,\n        attribute,\n        'exclude'\n      ),\n      disjunctiveFacetsRefinements: RefinementList.clearRefinement(\n        this.disjunctiveFacetsRefinements,\n        attribute,\n        'disjunctiveFacet'\n      ),\n      hierarchicalFacetsRefinements: RefinementList.clearRefinement(\n        this.hierarchicalFacetsRefinements,\n        attribute,\n        'hierarchicalFacet'\n      ),\n    };\n    if (\n      patch.numericRefinements === this.numericRefinements &&\n      patch.facetsRefinements === this.facetsRefinements &&\n      patch.facetsExcludes === this.facetsExcludes &&\n      patch.disjunctiveFacetsRefinements ===\n        this.disjunctiveFacetsRefinements &&\n      patch.hierarchicalFacetsRefinements === this.hierarchicalFacetsRefinements\n    ) {\n      return this;\n    }\n    return this.setQueryParameters(patch);\n  },\n  /**\n   * Remove all the refined tags from the SearchParameters\n   * @method\n   * @return {SearchParameters} new instance with tags cleared\n   */\n  clearTags: function clearTags() {\n    if (this.tagFilters === undefined && this.tagRefinements.length === 0)\n      return this;\n\n    return this.setQueryParameters({\n      tagFilters: undefined,\n      tagRefinements: [],\n    });\n  },\n  /**\n   * Set the index.\n   * @method\n   * @param {string} index the index name\n   * @return {SearchParameters} new instance\n   */\n  setIndex: function setIndex(index) {\n    if (index === this.index) return this;\n\n    return this.setQueryParameters({\n      index: index,\n    });\n  },\n  /**\n   * Query setter\n   * @method\n   * @param {string} newQuery value for the new query\n   * @return {SearchParameters} new instance\n   */\n  setQuery: function setQuery(newQuery) {\n    if (newQuery === this.query) return this;\n\n    return this.setQueryParameters({\n      query: newQuery,\n    });\n  },\n  /**\n   * Page setter\n   * @method\n   * @param {number} newPage new page number\n   * @return {SearchParameters} new instance\n   */\n  setPage: function setPage(newPage) {\n    if (newPage === this.page) return this;\n\n    return this.setQueryParameters({\n      page: newPage,\n    });\n  },\n  /**\n   * Facets setter\n   * The facets are the simple facets, used for conjunctive (and) faceting.\n   * @method\n   * @param {string[]} facets all the attributes of the algolia records used for conjunctive faceting\n   * @return {SearchParameters} new instance\n   */\n  setFacets: function setFacets(facets) {\n    return this.setQueryParameters({\n      facets: facets,\n    });\n  },\n  /**\n   * Disjunctive facets setter\n   * Change the list of disjunctive (or) facets the helper chan handle.\n   * @method\n   * @param {string[]} facets all the attributes of the algolia records used for disjunctive faceting\n   * @return {SearchParameters} new instance\n   */\n  setDisjunctiveFacets: function setDisjunctiveFacets(facets) {\n    return this.setQueryParameters({\n      disjunctiveFacets: facets,\n    });\n  },\n  /**\n   * HitsPerPage setter\n   * Hits per page represents the number of hits retrieved for this query\n   * @method\n   * @param {number} n number of hits retrieved per page of results\n   * @return {SearchParameters} new instance\n   */\n  setHitsPerPage: function setHitsPerPage(n) {\n    if (this.hitsPerPage === n) return this;\n\n    return this.setQueryParameters({\n      hitsPerPage: n,\n    });\n  },\n  /**\n   * typoTolerance setter\n   * Set the value of typoTolerance\n   * @method\n   * @param {string} typoTolerance new value of typoTolerance (\"true\", \"false\", \"min\" or \"strict\")\n   * @return {SearchParameters} new instance\n   */\n  setTypoTolerance: function setTypoTolerance(typoTolerance) {\n    if (this.typoTolerance === typoTolerance) return this;\n\n    return this.setQueryParameters({\n      typoTolerance: typoTolerance,\n    });\n  },\n  /**\n   * Add a numeric filter for a given attribute\n   * When value is an array, they are combined with OR\n   * When value is a single value, it will combined with AND\n   * @method\n   * @param {string} attribute attribute to set the filter on\n   * @param {string} operator operator of the filter (possible values: =, >, >=, <, <=, !=)\n   * @param {number | number[]} value value of the filter\n   * @return {SearchParameters} new instance\n   * @example\n   * // for price = 50 or 40\n   * state.addNumericRefinement('price', '=', [50, 40]);\n   * @example\n   * // for size = 38 and 40\n   * state.addNumericRefinement('size', '=', 38);\n   * state.addNumericRefinement('size', '=', 40);\n   */\n  addNumericRefinement: function (attribute, operator, value) {\n    var val = valToNumber(value);\n\n    if (this.isNumericRefined(attribute, operator, val)) return this;\n\n    var mod = merge({}, this.numericRefinements);\n\n    mod[attribute] = merge({}, mod[attribute]);\n\n    if (mod[attribute][operator]) {\n      // Array copy\n      mod[attribute][operator] = mod[attribute][operator].slice();\n      // Add the element. Concat can't be used here because value can be an array.\n      mod[attribute][operator].push(val);\n    } else {\n      mod[attribute][operator] = [val];\n    }\n\n    return this.setQueryParameters({\n      numericRefinements: mod,\n    });\n  },\n  /**\n   * Get the list of conjunctive refinements for a single facet\n   * @param {string} facetName name of the attribute used for faceting\n   * @return {string[]} list of refinements\n   */\n  getConjunctiveRefinements: function (facetName) {\n    if (!this.isConjunctiveFacet(facetName)) {\n      return [];\n    }\n    return this.facetsRefinements[facetName] || [];\n  },\n  /**\n   * Get the list of disjunctive refinements for a single facet\n   * @param {string} facetName name of the attribute used for faceting\n   * @return {string[]} list of refinements\n   */\n  getDisjunctiveRefinements: function (facetName) {\n    if (!this.isDisjunctiveFacet(facetName)) {\n      return [];\n    }\n    return this.disjunctiveFacetsRefinements[facetName] || [];\n  },\n  /**\n   * Get the list of hierarchical refinements for a single facet\n   * @param {string} facetName name of the attribute used for faceting\n   * @return {string[]} list of refinements\n   */\n  getHierarchicalRefinement: function (facetName) {\n    // we send an array but we currently do not support multiple\n    // hierarchicalRefinements for a hierarchicalFacet\n    return this.hierarchicalFacetsRefinements[facetName] || [];\n  },\n  /**\n   * Get the list of exclude refinements for a single facet\n   * @param {string} facetName name of the attribute used for faceting\n   * @return {string[]} list of refinements\n   */\n  getExcludeRefinements: function (facetName) {\n    if (!this.isConjunctiveFacet(facetName)) {\n      return [];\n    }\n    return this.facetsExcludes[facetName] || [];\n  },\n\n  /**\n   * Remove all the numeric filter for a given (attribute, operator)\n   * @method\n   * @param {string} attribute attribute to set the filter on\n   * @param {string} [operator] operator of the filter (possible values: =, >, >=, <, <=, !=)\n   * @param {number} [number] the value to be removed\n   * @return {SearchParameters} new instance\n   */\n  removeNumericRefinement: function (attribute, operator, number) {\n    var paramValue = number;\n    if (paramValue !== undefined) {\n      if (!this.isNumericRefined(attribute, operator, paramValue)) {\n        return this;\n      }\n      return this.setQueryParameters({\n        numericRefinements: this._clearNumericRefinements(function (\n          value,\n          key\n        ) {\n          return (\n            key === attribute &&\n            value.op === operator &&\n            isEqualNumericRefinement(value.val, valToNumber(paramValue))\n          );\n        }),\n      });\n    } else if (operator !== undefined) {\n      if (!this.isNumericRefined(attribute, operator)) return this;\n      return this.setQueryParameters({\n        numericRefinements: this._clearNumericRefinements(function (\n          value,\n          key\n        ) {\n          return key === attribute && value.op === operator;\n        }),\n      });\n    }\n\n    if (!this.isNumericRefined(attribute)) return this;\n    return this.setQueryParameters({\n      numericRefinements: this._clearNumericRefinements(function (value, key) {\n        return key === attribute;\n      }),\n    });\n  },\n  /**\n   * Get the list of numeric refinements for a single facet\n   * @param {string} facetName name of the attribute used for faceting\n   * @return {SearchParameters.OperatorList} list of refinements\n   */\n  getNumericRefinements: function (facetName) {\n    return this.numericRefinements[facetName] || {};\n  },\n  /**\n   * Return the current refinement for the (attribute, operator)\n   * @param {string} attribute attribute in the record\n   * @param {string} operator operator applied on the refined values\n   * @return {Array.<number|number[]>} refined values\n   */\n  getNumericRefinement: function (attribute, operator) {\n    return (\n      this.numericRefinements[attribute] &&\n      this.numericRefinements[attribute][operator]\n    );\n  },\n  /**\n   * Clear numeric filters.\n   * @method\n   * @private\n   * @param {string|SearchParameters.clearCallback} [attribute] optional string or function\n   * - If not given, means to clear all the filters.\n   * - If `string`, means to clear all refinements for the `attribute` named filter.\n   * - If `function`, means to clear all the refinements that return truthy values.\n   * @return {Object.<string, OperatorList>} new numeric refinements\n   */\n  _clearNumericRefinements: function _clearNumericRefinements(attribute) {\n    if (attribute === undefined) {\n      if (!objectHasKeys(this.numericRefinements)) {\n        return this.numericRefinements;\n      }\n      return {};\n    } else if (typeof attribute === 'string') {\n      return omit(this.numericRefinements, [attribute]);\n    } else if (typeof attribute === 'function') {\n      var hasChanged = false;\n      var numericRefinements = this.numericRefinements;\n      var newNumericRefinements = Object.keys(numericRefinements).reduce(\n        function (memo, key) {\n          var operators = numericRefinements[key];\n          var operatorList = {};\n\n          operators = operators || {};\n          Object.keys(operators).forEach(function (operator) {\n            var values = operators[operator] || [];\n            var outValues = [];\n            values.forEach(function (value) {\n              var predicateResult = attribute(\n                { val: value, op: operator },\n                key,\n                'numeric'\n              );\n              if (!predicateResult) outValues.push(value);\n            });\n            if (outValues.length !== values.length) {\n              hasChanged = true;\n            }\n            operatorList[operator] = outValues;\n          });\n\n          memo[key] = operatorList;\n\n          return memo;\n        },\n        {}\n      );\n\n      if (hasChanged) return newNumericRefinements;\n      return this.numericRefinements;\n    }\n\n    // We return nothing if the attribute is not undefined, a string or a function,\n    // as it is not a valid value for a refinement\n    return undefined;\n  },\n  /**\n   * Add a facet to the facets attribute of the helper configuration, if it\n   * isn't already present.\n   * @method\n   * @param {string} facet facet name to add\n   * @return {SearchParameters} new instance\n   */\n  addFacet: function addFacet(facet) {\n    if (this.isConjunctiveFacet(facet)) {\n      return this;\n    }\n\n    return this.setQueryParameters({\n      facets: this.facets.concat([facet]),\n    });\n  },\n  /**\n   * Add a disjunctive facet to the disjunctiveFacets attribute of the helper\n   * configuration, if it isn't already present.\n   * @method\n   * @param {string} facet disjunctive facet name to add\n   * @return {SearchParameters} new instance\n   */\n  addDisjunctiveFacet: function addDisjunctiveFacet(facet) {\n    if (this.isDisjunctiveFacet(facet)) {\n      return this;\n    }\n\n    return this.setQueryParameters({\n      disjunctiveFacets: this.disjunctiveFacets.concat([facet]),\n    });\n  },\n  /**\n   * Add a hierarchical facet to the hierarchicalFacets attribute of the helper\n   * configuration.\n   * @method\n   * @param {object} hierarchicalFacet hierarchical facet to add\n   * @return {SearchParameters} new instance\n   * @throws will throw an error if a hierarchical facet with the same name was already declared\n   */\n  addHierarchicalFacet: function addHierarchicalFacet(hierarchicalFacet) {\n    if (this.isHierarchicalFacet(hierarchicalFacet.name)) {\n      throw new Error(\n        'Cannot declare two hierarchical facets with the same name: `' +\n          hierarchicalFacet.name +\n          '`'\n      );\n    }\n\n    return this.setQueryParameters({\n      hierarchicalFacets: this.hierarchicalFacets.concat([hierarchicalFacet]),\n    });\n  },\n  /**\n   * Add a refinement on a \"normal\" facet\n   * @method\n   * @param {string} facet attribute to apply the faceting on\n   * @param {string} value value of the attribute (will be converted to string)\n   * @return {SearchParameters} new instance\n   */\n  addFacetRefinement: function addFacetRefinement(facet, value) {\n    if (!this.isConjunctiveFacet(facet)) {\n      throw new Error(\n        facet +\n          ' is not defined in the facets attribute of the helper configuration'\n      );\n    }\n    if (RefinementList.isRefined(this.facetsRefinements, facet, value))\n      return this;\n\n    return this.setQueryParameters({\n      facetsRefinements: RefinementList.addRefinement(\n        this.facetsRefinements,\n        facet,\n        value\n      ),\n    });\n  },\n  /**\n   * Exclude a value from a \"normal\" facet\n   * @method\n   * @param {string} facet attribute to apply the exclusion on\n   * @param {string} value value of the attribute (will be converted to string)\n   * @return {SearchParameters} new instance\n   */\n  addExcludeRefinement: function addExcludeRefinement(facet, value) {\n    if (!this.isConjunctiveFacet(facet)) {\n      throw new Error(\n        facet +\n          ' is not defined in the facets attribute of the helper configuration'\n      );\n    }\n    if (RefinementList.isRefined(this.facetsExcludes, facet, value))\n      return this;\n\n    return this.setQueryParameters({\n      facetsExcludes: RefinementList.addRefinement(\n        this.facetsExcludes,\n        facet,\n        value\n      ),\n    });\n  },\n  /**\n   * Adds a refinement on a disjunctive facet.\n   * @method\n   * @param {string} facet attribute to apply the faceting on\n   * @param {string} value value of the attribute (will be converted to string)\n   * @return {SearchParameters} new instance\n   */\n  addDisjunctiveFacetRefinement: function addDisjunctiveFacetRefinement(\n    facet,\n    value\n  ) {\n    if (!this.isDisjunctiveFacet(facet)) {\n      throw new Error(\n        facet +\n          ' is not defined in the disjunctiveFacets attribute of the helper configuration'\n      );\n    }\n\n    if (\n      RefinementList.isRefined(this.disjunctiveFacetsRefinements, facet, value)\n    )\n      return this;\n\n    return this.setQueryParameters({\n      disjunctiveFacetsRefinements: RefinementList.addRefinement(\n        this.disjunctiveFacetsRefinements,\n        facet,\n        value\n      ),\n    });\n  },\n  /**\n   * addTagRefinement adds a tag to the list used to filter the results\n   * @param {string} tag tag to be added\n   * @return {SearchParameters} new instance\n   */\n  addTagRefinement: function addTagRefinement(tag) {\n    if (this.isTagRefined(tag)) return this;\n\n    var modification = {\n      tagRefinements: this.tagRefinements.concat(tag),\n    };\n\n    return this.setQueryParameters(modification);\n  },\n  /**\n   * Remove a facet from the facets attribute of the helper configuration, if it\n   * is present.\n   * @method\n   * @param {string} facet facet name to remove\n   * @return {SearchParameters} new instance\n   */\n  removeFacet: function removeFacet(facet) {\n    if (!this.isConjunctiveFacet(facet)) {\n      return this;\n    }\n\n    return this.clearRefinements(facet).setQueryParameters({\n      facets: this.facets.filter(function (f) {\n        return f !== facet;\n      }),\n    });\n  },\n  /**\n   * Remove a disjunctive facet from the disjunctiveFacets attribute of the\n   * helper configuration, if it is present.\n   * @method\n   * @param {string} facet disjunctive facet name to remove\n   * @return {SearchParameters} new instance\n   */\n  removeDisjunctiveFacet: function removeDisjunctiveFacet(facet) {\n    if (!this.isDisjunctiveFacet(facet)) {\n      return this;\n    }\n\n    return this.clearRefinements(facet).setQueryParameters({\n      disjunctiveFacets: this.disjunctiveFacets.filter(function (f) {\n        return f !== facet;\n      }),\n    });\n  },\n  /**\n   * Remove a hierarchical facet from the hierarchicalFacets attribute of the\n   * helper configuration, if it is present.\n   * @method\n   * @param {string} facet hierarchical facet name to remove\n   * @return {SearchParameters} new instance\n   */\n  removeHierarchicalFacet: function removeHierarchicalFacet(facet) {\n    if (!this.isHierarchicalFacet(facet)) {\n      return this;\n    }\n\n    return this.clearRefinements(facet).setQueryParameters({\n      hierarchicalFacets: this.hierarchicalFacets.filter(function (f) {\n        return f.name !== facet;\n      }),\n    });\n  },\n  /**\n   * Remove a refinement set on facet. If a value is provided, it will clear the\n   * refinement for the given value, otherwise it will clear all the refinement\n   * values for the faceted attribute.\n   * @method\n   * @param {string} facet name of the attribute used for faceting\n   * @param {string} [value] value used to filter\n   * @return {SearchParameters} new instance\n   */\n  removeFacetRefinement: function removeFacetRefinement(facet, value) {\n    if (!this.isConjunctiveFacet(facet)) {\n      throw new Error(\n        facet +\n          ' is not defined in the facets attribute of the helper configuration'\n      );\n    }\n    if (!RefinementList.isRefined(this.facetsRefinements, facet, value))\n      return this;\n\n    return this.setQueryParameters({\n      facetsRefinements: RefinementList.removeRefinement(\n        this.facetsRefinements,\n        facet,\n        value\n      ),\n    });\n  },\n  /**\n   * Remove a negative refinement on a facet\n   * @method\n   * @param {string} facet name of the attribute used for faceting\n   * @param {string} value value used to filter\n   * @return {SearchParameters} new instance\n   */\n  removeExcludeRefinement: function removeExcludeRefinement(facet, value) {\n    if (!this.isConjunctiveFacet(facet)) {\n      throw new Error(\n        facet +\n          ' is not defined in the facets attribute of the helper configuration'\n      );\n    }\n    if (!RefinementList.isRefined(this.facetsExcludes, facet, value))\n      return this;\n\n    return this.setQueryParameters({\n      facetsExcludes: RefinementList.removeRefinement(\n        this.facetsExcludes,\n        facet,\n        value\n      ),\n    });\n  },\n  /**\n   * Remove a refinement on a disjunctive facet\n   * @method\n   * @param {string} facet name of the attribute used for faceting\n   * @param {string} value value used to filter\n   * @return {SearchParameters} new instance\n   */\n  removeDisjunctiveFacetRefinement: function removeDisjunctiveFacetRefinement(\n    facet,\n    value\n  ) {\n    if (!this.isDisjunctiveFacet(facet)) {\n      throw new Error(\n        facet +\n          ' is not defined in the disjunctiveFacets attribute of the helper configuration'\n      );\n    }\n    if (\n      !RefinementList.isRefined(this.disjunctiveFacetsRefinements, facet, value)\n    )\n      return this;\n\n    return this.setQueryParameters({\n      disjunctiveFacetsRefinements: RefinementList.removeRefinement(\n        this.disjunctiveFacetsRefinements,\n        facet,\n        value\n      ),\n    });\n  },\n  /**\n   * Remove a tag from the list of tag refinements\n   * @method\n   * @param {string} tag the tag to remove\n   * @return {SearchParameters} new instance\n   */\n  removeTagRefinement: function removeTagRefinement(tag) {\n    if (!this.isTagRefined(tag)) return this;\n\n    var modification = {\n      tagRefinements: this.tagRefinements.filter(function (t) {\n        return t !== tag;\n      }),\n    };\n\n    return this.setQueryParameters(modification);\n  },\n  /**\n   * Generic toggle refinement method to use with facet, disjunctive facets\n   * and hierarchical facets\n   * @param  {string} facet the facet to refine\n   * @param  {string} value the associated value\n   * @return {SearchParameters} new instance\n   * @throws will throw an error if the facet is not declared in the settings of the helper\n   * @deprecated since version 2.19.0, see {@link SearchParameters#toggleFacetRefinement}\n   */\n  toggleRefinement: function toggleRefinement(facet, value) {\n    return this.toggleFacetRefinement(facet, value);\n  },\n  /**\n   * Generic toggle refinement method to use with facet, disjunctive facets\n   * and hierarchical facets\n   * @param  {string} facet the facet to refine\n   * @param  {string} value the associated value\n   * @return {SearchParameters} new instance\n   * @throws will throw an error if the facet is not declared in the settings of the helper\n   */\n  toggleFacetRefinement: function toggleFacetRefinement(facet, value) {\n    if (this.isHierarchicalFacet(facet)) {\n      return this.toggleHierarchicalFacetRefinement(facet, value);\n    } else if (this.isConjunctiveFacet(facet)) {\n      return this.toggleConjunctiveFacetRefinement(facet, value);\n    } else if (this.isDisjunctiveFacet(facet)) {\n      return this.toggleDisjunctiveFacetRefinement(facet, value);\n    }\n\n    throw new Error(\n      'Cannot refine the undeclared facet ' +\n        facet +\n        '; it should be added to the helper options facets, disjunctiveFacets or hierarchicalFacets'\n    );\n  },\n  /**\n   * Switch the refinement applied over a facet/value\n   * @method\n   * @param {string} facet name of the attribute used for faceting\n   * @param {value} value value used for filtering\n   * @return {SearchParameters} new instance\n   */\n  toggleConjunctiveFacetRefinement: function toggleConjunctiveFacetRefinement(\n    facet,\n    value\n  ) {\n    if (!this.isConjunctiveFacet(facet)) {\n      throw new Error(\n        facet +\n          ' is not defined in the facets attribute of the helper configuration'\n      );\n    }\n\n    return this.setQueryParameters({\n      facetsRefinements: RefinementList.toggleRefinement(\n        this.facetsRefinements,\n        facet,\n        value\n      ),\n    });\n  },\n  /**\n   * Switch the refinement applied over a facet/value\n   * @method\n   * @param {string} facet name of the attribute used for faceting\n   * @param {value} value value used for filtering\n   * @return {SearchParameters} new instance\n   */\n  toggleExcludeFacetRefinement: function toggleExcludeFacetRefinement(\n    facet,\n    value\n  ) {\n    if (!this.isConjunctiveFacet(facet)) {\n      throw new Error(\n        facet +\n          ' is not defined in the facets attribute of the helper configuration'\n      );\n    }\n\n    return this.setQueryParameters({\n      facetsExcludes: RefinementList.toggleRefinement(\n        this.facetsExcludes,\n        facet,\n        value\n      ),\n    });\n  },\n  /**\n   * Switch the refinement applied over a facet/value\n   * @method\n   * @param {string} facet name of the attribute used for faceting\n   * @param {value} value value used for filtering\n   * @return {SearchParameters} new instance\n   */\n  toggleDisjunctiveFacetRefinement: function toggleDisjunctiveFacetRefinement(\n    facet,\n    value\n  ) {\n    if (!this.isDisjunctiveFacet(facet)) {\n      throw new Error(\n        facet +\n          ' is not defined in the disjunctiveFacets attribute of the helper configuration'\n      );\n    }\n\n    return this.setQueryParameters({\n      disjunctiveFacetsRefinements: RefinementList.toggleRefinement(\n        this.disjunctiveFacetsRefinements,\n        facet,\n        value\n      ),\n    });\n  },\n  /**\n   * Switch the refinement applied over a facet/value\n   * @method\n   * @param {string} facet name of the attribute used for faceting\n   * @param {value} value value used for filtering\n   * @return {SearchParameters} new instance\n   */\n  toggleHierarchicalFacetRefinement: function toggleHierarchicalFacetRefinement(\n    facet,\n    value\n  ) {\n    if (!this.isHierarchicalFacet(facet)) {\n      throw new Error(\n        facet +\n          ' is not defined in the hierarchicalFacets attribute of the helper configuration'\n      );\n    }\n\n    var separator = this._getHierarchicalFacetSeparator(\n      this.getHierarchicalFacetByName(facet)\n    );\n\n    var mod = {};\n\n    var upOneOrMultipleLevel =\n      this.hierarchicalFacetsRefinements[facet] !== undefined &&\n      this.hierarchicalFacetsRefinements[facet].length > 0 &&\n      // remove current refinement:\n      // refinement was 'beer > IPA', call is toggleRefine('beer > IPA'), refinement should be `beer`\n      (this.hierarchicalFacetsRefinements[facet][0] === value ||\n        // remove a parent refinement of the current refinement:\n        //  - refinement was 'beer > IPA > Flying dog'\n        //  - call is toggleRefine('beer > IPA')\n        //  - refinement should be `beer`\n        this.hierarchicalFacetsRefinements[facet][0].indexOf(\n          value + separator\n        ) === 0);\n\n    if (upOneOrMultipleLevel) {\n      if (value.indexOf(separator) === -1) {\n        // go back to root level\n        mod[facet] = [];\n      } else {\n        mod[facet] = [value.slice(0, value.lastIndexOf(separator))];\n      }\n    } else {\n      mod[facet] = [value];\n    }\n\n    return this.setQueryParameters({\n      hierarchicalFacetsRefinements: defaultsPure(\n        {},\n        mod,\n        this.hierarchicalFacetsRefinements\n      ),\n    });\n  },\n\n  /**\n   * Adds a refinement on a hierarchical facet.\n   * @param {string} facet the facet name\n   * @param {string} path the hierarchical facet path\n   * @return {SearchParameter} the new state\n   * @throws Error if the facet is not defined or if the facet is refined\n   */\n  addHierarchicalFacetRefinement: function (facet, path) {\n    if (this.isHierarchicalFacetRefined(facet)) {\n      throw new Error(facet + ' is already refined.');\n    }\n    if (!this.isHierarchicalFacet(facet)) {\n      throw new Error(\n        facet +\n          ' is not defined in the hierarchicalFacets attribute of the helper configuration.'\n      );\n    }\n    var mod = {};\n    mod[facet] = [path];\n    return this.setQueryParameters({\n      hierarchicalFacetsRefinements: defaultsPure(\n        {},\n        mod,\n        this.hierarchicalFacetsRefinements\n      ),\n    });\n  },\n\n  /**\n   * Removes the refinement set on a hierarchical facet.\n   * @param {string} facet the facet name\n   * @return {SearchParameter} the new state\n   * @throws Error if the facet is not defined or if the facet is not refined\n   */\n  removeHierarchicalFacetRefinement: function (facet) {\n    if (!this.isHierarchicalFacetRefined(facet)) {\n      return this;\n    }\n    var mod = {};\n    mod[facet] = [];\n    return this.setQueryParameters({\n      hierarchicalFacetsRefinements: defaultsPure(\n        {},\n        mod,\n        this.hierarchicalFacetsRefinements\n      ),\n    });\n  },\n  /**\n   * Switch the tag refinement\n   * @method\n   * @param {string} tag the tag to remove or add\n   * @return {SearchParameters} new instance\n   */\n  toggleTagRefinement: function toggleTagRefinement(tag) {\n    if (this.isTagRefined(tag)) {\n      return this.removeTagRefinement(tag);\n    }\n\n    return this.addTagRefinement(tag);\n  },\n  /**\n   * Test if the facet name is from one of the disjunctive facets\n   * @method\n   * @param {string} facet facet name to test\n   * @return {boolean} true if facet is a disjunctive facet\n   */\n  isDisjunctiveFacet: function (facet) {\n    return this.disjunctiveFacets.indexOf(facet) > -1;\n  },\n  /**\n   * Test if the facet name is from one of the hierarchical facets\n   * @method\n   * @param {string} facetName facet name to test\n   * @return {boolean} true if facetName is a hierarchical facet\n   */\n  isHierarchicalFacet: function (facetName) {\n    return this.getHierarchicalFacetByName(facetName) !== undefined;\n  },\n  /**\n   * Test if the facet name is from one of the conjunctive/normal facets\n   * @method\n   * @param {string} facet facet name to test\n   * @return {boolean} true if facet is a conjunctive facet\n   */\n  isConjunctiveFacet: function (facet) {\n    return this.facets.indexOf(facet) > -1;\n  },\n  /**\n   * Returns true if the facet is refined, either for a specific value or in\n   * general.\n   * @method\n   * @param {string} facet name of the attribute for used for faceting\n   * @param {string} value, optional value. If passed will test that this value\n   * is filtering the given facet.\n   * @return {boolean} returns true if refined\n   */\n  isFacetRefined: function isFacetRefined(facet, value) {\n    if (!this.isConjunctiveFacet(facet)) {\n      return false;\n    }\n    return RefinementList.isRefined(this.facetsRefinements, facet, value);\n  },\n  /**\n   * Returns true if the facet contains exclusions or if a specific value is\n   * excluded.\n   *\n   * @method\n   * @param {string} facet name of the attribute for used for faceting\n   * @param {string} [value] optional value. If passed will test that this value\n   * is filtering the given facet.\n   * @return {boolean} returns true if refined\n   */\n  isExcludeRefined: function isExcludeRefined(facet, value) {\n    if (!this.isConjunctiveFacet(facet)) {\n      return false;\n    }\n    return RefinementList.isRefined(this.facetsExcludes, facet, value);\n  },\n  /**\n   * Returns true if the facet contains a refinement, or if a value passed is a\n   * refinement for the facet.\n   * @method\n   * @param {string} facet name of the attribute for used for faceting\n   * @param {string} value optional, will test if the value is used for refinement\n   * if there is one, otherwise will test if the facet contains any refinement\n   * @return {boolean} true if the facet is refined\n   */\n  isDisjunctiveFacetRefined: function isDisjunctiveFacetRefined(facet, value) {\n    if (!this.isDisjunctiveFacet(facet)) {\n      return false;\n    }\n    return RefinementList.isRefined(\n      this.disjunctiveFacetsRefinements,\n      facet,\n      value\n    );\n  },\n  /**\n   * Returns true if the facet contains a refinement, or if a value passed is a\n   * refinement for the facet.\n   * @method\n   * @param {string} facet name of the attribute for used for faceting\n   * @param {string} value optional, will test if the value is used for refinement\n   * if there is one, otherwise will test if the facet contains any refinement\n   * @return {boolean} true if the facet is refined\n   */\n  isHierarchicalFacetRefined: function isHierarchicalFacetRefined(\n    facet,\n    value\n  ) {\n    if (!this.isHierarchicalFacet(facet)) {\n      return false;\n    }\n\n    var refinements = this.getHierarchicalRefinement(facet);\n\n    if (!value) {\n      return refinements.length > 0;\n    }\n\n    return refinements.indexOf(value) !== -1;\n  },\n  /**\n   * Test if the triple (attribute, operator, value) is already refined.\n   * If only the attribute and the operator are provided, it tests if the\n   * contains any refinement value.\n   * @method\n   * @param {string} attribute attribute for which the refinement is applied\n   * @param {string} [operator] operator of the refinement\n   * @param {string} [value] value of the refinement\n   * @return {boolean} true if it is refined\n   */\n  isNumericRefined: function isNumericRefined(attribute, operator, value) {\n    if (value === undefined && operator === undefined) {\n      return Boolean(this.numericRefinements[attribute]);\n    }\n\n    var isOperatorDefined =\n      this.numericRefinements[attribute] &&\n      this.numericRefinements[attribute][operator] !== undefined;\n\n    if (value === undefined || !isOperatorDefined) {\n      return isOperatorDefined;\n    }\n\n    var parsedValue = valToNumber(value);\n    var isAttributeValueDefined =\n      findArray(this.numericRefinements[attribute][operator], parsedValue) !==\n      undefined;\n\n    return isOperatorDefined && isAttributeValueDefined;\n  },\n  /**\n   * Returns true if the tag refined, false otherwise\n   * @method\n   * @param {string} tag the tag to check\n   * @return {boolean} true if tag is refined\n   */\n  isTagRefined: function isTagRefined(tag) {\n    return this.tagRefinements.indexOf(tag) !== -1;\n  },\n  /**\n   * Returns the list of all disjunctive facets refined\n   * @method\n   * @param {string} facet name of the attribute used for faceting\n   * @param {value} value value used for filtering\n   * @return {string[]} returns the list of refinements\n   */\n  getRefinedDisjunctiveFacets: function getRefinedDisjunctiveFacets() {\n    // eslint-disable-next-line consistent-this\n    var self = this;\n\n    // attributes used for numeric filter can also be disjunctive\n    var disjunctiveNumericRefinedFacets = intersection(\n      Object.keys(this.numericRefinements).filter(function (facet) {\n        return Object.keys(self.numericRefinements[facet]).length > 0;\n      }),\n      this.disjunctiveFacets\n    );\n\n    return Object.keys(this.disjunctiveFacetsRefinements)\n      .filter(function (facet) {\n        return self.disjunctiveFacetsRefinements[facet].length > 0;\n      })\n      .concat(disjunctiveNumericRefinedFacets)\n      .concat(this.getRefinedHierarchicalFacets())\n      .sort();\n  },\n  /**\n   * Returns the list of all disjunctive facets refined\n   * @method\n   * @param {string} facet name of the attribute used for faceting\n   * @param {value} value value used for filtering\n   * @return {string[]} returns the list of refinements\n   */\n  getRefinedHierarchicalFacets: function getRefinedHierarchicalFacets() {\n    // eslint-disable-next-line consistent-this\n    var self = this;\n    return intersection(\n      // enforce the order between the two arrays,\n      // so that refinement name index === hierarchical facet index\n      this.hierarchicalFacets.map(function (facet) {\n        return facet.name;\n      }),\n      Object.keys(this.hierarchicalFacetsRefinements).filter(function (facet) {\n        return self.hierarchicalFacetsRefinements[facet].length > 0;\n      })\n    ).sort();\n  },\n  /**\n   * Returned the list of all disjunctive facets not refined\n   * @method\n   * @return {string[]} returns the list of facets that are not refined\n   */\n  getUnrefinedDisjunctiveFacets: function () {\n    var refinedFacets = this.getRefinedDisjunctiveFacets();\n\n    return this.disjunctiveFacets.filter(function (f) {\n      return refinedFacets.indexOf(f) === -1;\n    });\n  },\n\n  managedParameters: [\n    'index',\n\n    'facets',\n    'disjunctiveFacets',\n    'facetsRefinements',\n    'hierarchicalFacets',\n    'facetsExcludes',\n\n    'disjunctiveFacetsRefinements',\n    'numericRefinements',\n    'tagRefinements',\n    'hierarchicalFacetsRefinements',\n  ],\n\n  getQueryParams: function getQueryParams() {\n    var managedParameters = this.managedParameters;\n\n    var queryParams = {};\n\n    // eslint-disable-next-line consistent-this\n    var self = this;\n    Object.keys(this).forEach(function (paramName) {\n      var paramValue = self[paramName];\n      if (\n        managedParameters.indexOf(paramName) === -1 &&\n        paramValue !== undefined\n      ) {\n        queryParams[paramName] = paramValue;\n      }\n    });\n\n    return queryParams;\n  },\n  /**\n   * Let the user set a specific value for a given parameter. Will return the\n   * same instance if the parameter is invalid or if the value is the same as the\n   * previous one.\n   * @method\n   * @param {string} parameter the parameter name\n   * @param {any} value the value to be set, must be compliant with the definition\n   * of the attribute on the object\n   * @return {SearchParameters} the updated state\n   */\n  setQueryParameter: function setParameter(parameter, value) {\n    if (this[parameter] === value) return this;\n\n    var modification = {};\n\n    modification[parameter] = value;\n\n    return this.setQueryParameters(modification);\n  },\n  /**\n   * Let the user set any of the parameters with a plain object.\n   * @method\n   * @param {object} params all the keys and the values to be updated\n   * @return {SearchParameters} a new updated instance\n   */\n  setQueryParameters: function setQueryParameters(params) {\n    if (!params) return this;\n\n    var error = SearchParameters.validate(this, params);\n\n    if (error) {\n      throw error;\n    }\n\n    // eslint-disable-next-line consistent-this\n    var self = this;\n    var nextWithNumbers = SearchParameters._parseNumbers(params);\n    var previousPlainObject = Object.keys(this).reduce(function (acc, key) {\n      acc[key] = self[key];\n      return acc;\n    }, {});\n\n    var nextPlainObject = Object.keys(nextWithNumbers).reduce(function (\n      previous,\n      key\n    ) {\n      var isPreviousValueDefined = previous[key] !== undefined;\n      var isNextValueDefined = nextWithNumbers[key] !== undefined;\n\n      if (isPreviousValueDefined && !isNextValueDefined) {\n        return omit(previous, [key]);\n      }\n\n      if (isNextValueDefined) {\n        previous[key] = nextWithNumbers[key];\n      }\n\n      return previous;\n    },\n    previousPlainObject);\n\n    return new this.constructor(nextPlainObject);\n  },\n\n  /**\n   * Returns a new instance with the page reset. Two scenarios possible:\n   * the page is omitted -> return the given instance\n   * the page is set -> return a new instance with a page of 0\n   * @return {SearchParameters} a new updated instance\n   */\n  resetPage: function () {\n    if (this.page === undefined) {\n      return this;\n    }\n\n    return this.setPage(0);\n  },\n\n  /**\n   * Helper function to get the hierarchicalFacet separator or the default one (`>`)\n   * @param  {object} hierarchicalFacet the hierarchicalFacet object\n   * @return {string} returns the hierarchicalFacet.separator or `>` as default\n   */\n  _getHierarchicalFacetSortBy: function (hierarchicalFacet) {\n    return hierarchicalFacet.sortBy || ['isRefined:desc', 'name:asc'];\n  },\n\n  /**\n   * Helper function to get the hierarchicalFacet separator or the default one (`>`)\n   * @private\n   * @param  {object} hierarchicalFacet the hierarchicalFacet object\n   * @return {string} returns the hierarchicalFacet.separator or `>` as default\n   */\n  _getHierarchicalFacetSeparator: function (hierarchicalFacet) {\n    return hierarchicalFacet.separator || ' > ';\n  },\n\n  /**\n   * Helper function to get the hierarchicalFacet prefix path or null\n   * @private\n   * @param  {object} hierarchicalFacet the hierarchicalFacet object\n   * @return {string} returns the hierarchicalFacet.rootPath or null as default\n   */\n  _getHierarchicalRootPath: function (hierarchicalFacet) {\n    return hierarchicalFacet.rootPath || null;\n  },\n\n  /**\n   * Helper function to check if we show the parent level of the hierarchicalFacet\n   * @private\n   * @param  {object} hierarchicalFacet the hierarchicalFacet object\n   * @return {string} returns the hierarchicalFacet.showParentLevel or true as default\n   */\n  _getHierarchicalShowParentLevel: function (hierarchicalFacet) {\n    if (typeof hierarchicalFacet.showParentLevel === 'boolean') {\n      return hierarchicalFacet.showParentLevel;\n    }\n    return true;\n  },\n\n  /**\n   * Helper function to get the hierarchicalFacet by it's name\n   * @param  {string} hierarchicalFacetName the hierarchicalFacet name\n   * @return {object} a hierarchicalFacet\n   */\n  getHierarchicalFacetByName: function (hierarchicalFacetName) {\n    return find(this.hierarchicalFacets, function (f) {\n      return f.name === hierarchicalFacetName;\n    });\n  },\n\n  /**\n   * Get the current breadcrumb for a hierarchical facet, as an array\n   * @param  {string} facetName Hierarchical facet name\n   * @return {array.<string>} the path as an array of string\n   */\n  getHierarchicalFacetBreadcrumb: function (facetName) {\n    if (!this.isHierarchicalFacet(facetName)) {\n      return [];\n    }\n\n    var refinement = this.getHierarchicalRefinement(facetName)[0];\n    if (!refinement) return [];\n\n    var separator = this._getHierarchicalFacetSeparator(\n      this.getHierarchicalFacetByName(facetName)\n    );\n    var path = refinement.split(separator);\n    return path.map(function (part) {\n      return part.trim();\n    });\n  },\n\n  toString: function () {\n    return JSON.stringify(this, null, 2);\n  },\n};\n\n/**\n * Callback used for clearRefinement method\n * @callback SearchParameters.clearCallback\n * @param {OperatorList|FacetList} value the value of the filter\n * @param {string} key the current attribute name\n * @param {string} type `numeric`, `disjunctiveFacet`, `conjunctiveFacet`, `hierarchicalFacet` or `exclude`\n * depending on the type of facet\n * @return {boolean} `true` if the element should be removed. `false` otherwise.\n */\nmodule.exports = SearchParameters;\n","'use strict';\n\nmodule.exports = generateTrees;\n\nvar fv = require('../functions/escapeFacetValue');\nvar find = require('../functions/find');\nvar prepareHierarchicalFacetSortBy = require('../functions/formatSort');\nvar orderBy = require('../functions/orderBy');\nvar escapeFacetValue = fv.escapeFacetValue;\nvar unescapeFacetValue = fv.unescapeFacetValue;\n\nfunction generateTrees(state) {\n  return function generate(hierarchicalFacetResult, hierarchicalFacetIndex) {\n    var hierarchicalFacet = state.hierarchicalFacets[hierarchicalFacetIndex];\n    var hierarchicalFacetRefinement =\n      (state.hierarchicalFacetsRefinements[hierarchicalFacet.name] &&\n        state.hierarchicalFacetsRefinements[hierarchicalFacet.name][0]) ||\n      '';\n    var hierarchicalSeparator =\n      state._getHierarchicalFacetSeparator(hierarchicalFacet);\n    var hierarchicalRootPath =\n      state._getHierarchicalRootPath(hierarchicalFacet);\n    var hierarchicalShowParentLevel =\n      state._getHierarchicalShowParentLevel(hierarchicalFacet);\n    var sortBy = prepareHierarchicalFacetSortBy(\n      state._getHierarchicalFacetSortBy(hierarchicalFacet)\n    );\n\n    var rootExhaustive = hierarchicalFacetResult.every(function (facetResult) {\n      return facetResult.exhaustive;\n    });\n\n    var generateTreeFn = generateHierarchicalTree(\n      sortBy,\n      hierarchicalSeparator,\n      hierarchicalRootPath,\n      hierarchicalShowParentLevel,\n      hierarchicalFacetRefinement\n    );\n\n    var results = hierarchicalFacetResult;\n\n    if (hierarchicalRootPath) {\n      results = hierarchicalFacetResult.slice(\n        hierarchicalRootPath.split(hierarchicalSeparator).length\n      );\n    }\n\n    return results.reduce(generateTreeFn, {\n      name: state.hierarchicalFacets[hierarchicalFacetIndex].name,\n      count: null, // root level, no count\n      isRefined: true, // root level, always refined\n      path: null, // root level, no path\n      escapedValue: null,\n      exhaustive: rootExhaustive,\n      data: null,\n    });\n  };\n}\n\nfunction generateHierarchicalTree(\n  sortBy,\n  hierarchicalSeparator,\n  hierarchicalRootPath,\n  hierarchicalShowParentLevel,\n  currentRefinement\n) {\n  return function generateTree(\n    hierarchicalTree,\n    hierarchicalFacetResult,\n    currentHierarchicalLevel\n  ) {\n    var parent = hierarchicalTree;\n\n    if (currentHierarchicalLevel > 0) {\n      var level = 0;\n\n      parent = hierarchicalTree;\n\n      while (level < currentHierarchicalLevel) {\n        /**\n         * @type {object[]]} hierarchical data\n         */\n        var data = parent && Array.isArray(parent.data) ? parent.data : [];\n        parent = find(data, function (subtree) {\n          return subtree.isRefined;\n        });\n        level++;\n      }\n    }\n\n    // we found a refined parent, let's add current level data under it\n    if (parent) {\n      // filter values in case an object has multiple categories:\n      //   {\n      //     categories: {\n      //       level0: ['beers', 'bières'],\n      //       level1: ['beers > IPA', 'bières > Belges']\n      //     }\n      //   }\n      //\n      // If parent refinement is `beers`, then we do not want to have `bières > Belges`\n      // showing up\n\n      var picked = Object.keys(hierarchicalFacetResult.data)\n        .map(function (facetValue) {\n          return [facetValue, hierarchicalFacetResult.data[facetValue]];\n        })\n        .filter(function (tuple) {\n          var facetValue = tuple[0];\n          return onlyMatchingTree(\n            facetValue,\n            parent.path || hierarchicalRootPath,\n            currentRefinement,\n            hierarchicalSeparator,\n            hierarchicalRootPath,\n            hierarchicalShowParentLevel\n          );\n        });\n\n      parent.data = orderBy(\n        picked.map(function (tuple) {\n          var facetValue = tuple[0];\n          var facetCount = tuple[1];\n\n          return format(\n            facetCount,\n            facetValue,\n            hierarchicalSeparator,\n            unescapeFacetValue(currentRefinement),\n            hierarchicalFacetResult.exhaustive\n          );\n        }),\n        sortBy[0],\n        sortBy[1]\n      );\n    }\n\n    return hierarchicalTree;\n  };\n}\n\n// eslint-disable-next-line max-params\nfunction onlyMatchingTree(\n  facetValue,\n  parentPath,\n  currentRefinement,\n  hierarchicalSeparator,\n  hierarchicalRootPath,\n  hierarchicalShowParentLevel\n) {\n  // we want the facetValue is a child of hierarchicalRootPath\n  if (\n    hierarchicalRootPath &&\n    (facetValue.indexOf(hierarchicalRootPath) !== 0 ||\n      hierarchicalRootPath === facetValue)\n  ) {\n    return false;\n  }\n\n  // we always want root levels (only when there is no prefix path)\n  return (\n    (!hierarchicalRootPath &&\n      facetValue.indexOf(hierarchicalSeparator) === -1) ||\n    // if there is a rootPath, being root level mean 1 level under rootPath\n    (hierarchicalRootPath &&\n      facetValue.split(hierarchicalSeparator).length -\n        hierarchicalRootPath.split(hierarchicalSeparator).length ===\n        1) ||\n    // if current refinement is a root level and current facetValue is a root level,\n    // keep the facetValue\n    (facetValue.indexOf(hierarchicalSeparator) === -1 &&\n      currentRefinement.indexOf(hierarchicalSeparator) === -1) ||\n    // currentRefinement is a child of the facet value\n    currentRefinement.indexOf(facetValue) === 0 ||\n    // facetValue is a child of the current parent, add it\n    (facetValue.indexOf(parentPath + hierarchicalSeparator) === 0 &&\n      (hierarchicalShowParentLevel ||\n        facetValue.indexOf(currentRefinement) === 0))\n  );\n}\n\nfunction format(\n  facetCount,\n  facetValue,\n  hierarchicalSeparator,\n  currentRefinement,\n  exhaustive\n) {\n  var parts = facetValue.split(hierarchicalSeparator);\n  return {\n    name: parts[parts.length - 1].trim(),\n    path: facetValue,\n    escapedValue: escapeFacetValue(facetValue),\n    count: facetCount,\n    isRefined:\n      currentRefinement === facetValue ||\n      currentRefinement.indexOf(facetValue + hierarchicalSeparator) === 0,\n    exhaustive: exhaustive,\n    data: null,\n  };\n}\n","'use strict';\n\nvar compact = require('../functions/compact');\nvar defaultsPure = require('../functions/defaultsPure');\nvar fv = require('../functions/escapeFacetValue');\nvar find = require('../functions/find');\nvar findIndex = require('../functions/findIndex');\nvar formatSort = require('../functions/formatSort');\nvar merge = require('../functions/merge');\nvar orderBy = require('../functions/orderBy');\nvar escapeFacetValue = fv.escapeFacetValue;\nvar unescapeFacetValue = fv.unescapeFacetValue;\n\nvar generateHierarchicalTree = require('./generate-hierarchical-tree');\n\n/**\n * @typedef SearchResults.Facet\n * @type {object}\n * @property {string} name name of the attribute in the record\n * @property {object} data the faceting data: value, number of entries\n * @property {object} stats undefined unless facet_stats is retrieved from algolia\n */\n\n/**\n * @typedef SearchResults.HierarchicalFacet\n * @type {object}\n * @property {string} name name of the current value given the hierarchical level, trimmed.\n * If root node, you get the facet name\n * @property {number} count number of objects matching this hierarchical value\n * @property {string} path the current hierarchical value full path\n * @property {boolean} isRefined `true` if the current value was refined, `false` otherwise\n * @property {HierarchicalFacet[]} data sub values for the current level\n */\n\n/**\n * @typedef SearchResults.FacetValue\n * @type {object}\n * @property {string} name the facet value itself\n * @property {number} count times this facet appears in the results\n * @property {boolean} isRefined is the facet currently selected\n * @property {boolean} isExcluded is the facet currently excluded (only for conjunctive facets)\n */\n\n/**\n * @typedef Refinement\n * @type {object}\n * @property {string} type the type of filter used:\n * `numeric`, `facet`, `exclude`, `disjunctive`, `hierarchical`\n * @property {string} attributeName name of the attribute used for filtering\n * @property {string} name the value of the filter\n * @property {number} numericValue the value as a number. Only for numeric filters.\n * @property {string} operator the operator used. Only for numeric filters.\n * @property {number} count the number of computed hits for this filter. Only on facets.\n * @property {boolean} exhaustive if the count is exhaustive\n */\n\n/**\n * Turn an array of attributes in an object of attributes with their position in the array as value\n * @param {string[]} attributes the list of attributes in the record\n * @return {object} the list of attributes indexed by attribute name\n */\nfunction getIndices(attributes) {\n  var indices = {};\n\n  attributes.forEach(function (val, idx) {\n    indices[val] = idx;\n  });\n\n  return indices;\n}\n\nfunction assignFacetStats(dest, facetStats, key) {\n  if (facetStats && facetStats[key]) {\n    dest.stats = facetStats[key];\n  }\n}\n\n/**\n * @typedef {Object} HierarchicalFacet\n * @property {string} name\n * @property {string[]} attributes\n */\n\n/**\n * @param {HierarchicalFacet[]} hierarchicalFacets All hierarchical facets\n * @param {string} hierarchicalAttributeName The name of the hierarchical attribute\n * @return {HierarchicalFacet} The hierarchical facet matching the attribute name\n */\nfunction findMatchingHierarchicalFacetFromAttributeName(\n  hierarchicalFacets,\n  hierarchicalAttributeName\n) {\n  return find(\n    hierarchicalFacets,\n    function facetKeyMatchesAttribute(hierarchicalFacet) {\n      var facetNames = hierarchicalFacet.attributes || [];\n      return facetNames.indexOf(hierarchicalAttributeName) > -1;\n    }\n  );\n}\n\n// eslint-disable-next-line valid-jsdoc\n/**\n * Constructor for SearchResults\n * @class\n * @classdesc SearchResults contains the results of a query to Algolia using the\n * {@link AlgoliaSearchHelper}.\n * @param {SearchParameters} state state that led to the response\n * @param {array.<object>} results the results from algolia client\n * @example <caption>SearchResults of the first query in\n * <a href=\"http://demos.algolia.com/instant-search-demo\">the instant search demo</a></caption>\n{\n   \"hitsPerPage\": 10,\n   \"processingTimeMS\": 2,\n   \"facets\": [\n      {\n         \"name\": \"type\",\n         \"data\": {\n            \"HardGood\": 6627,\n            \"BlackTie\": 550,\n            \"Music\": 665,\n            \"Software\": 131,\n            \"Game\": 456,\n            \"Movie\": 1571\n         },\n         \"exhaustive\": false\n      },\n      {\n         \"exhaustive\": false,\n         \"data\": {\n            \"Free shipping\": 5507\n         },\n         \"name\": \"shipping\"\n      }\n  ],\n   \"hits\": [\n      {\n         \"thumbnailImage\": \"http://img.bbystatic.com/BestBuy_US/images/products/1688/1688832_54x108_s.gif\",\n         \"_highlightResult\": {\n            \"shortDescription\": {\n               \"matchLevel\": \"none\",\n               \"value\": \"Safeguard your PC, Mac, Android and iOS devices with comprehensive Internet protection\",\n               \"matchedWords\": []\n            },\n            \"category\": {\n               \"matchLevel\": \"none\",\n               \"value\": \"Computer Security Software\",\n               \"matchedWords\": []\n            },\n            \"manufacturer\": {\n               \"matchedWords\": [],\n               \"value\": \"Webroot\",\n               \"matchLevel\": \"none\"\n            },\n            \"name\": {\n               \"value\": \"Webroot SecureAnywhere Internet Security (3-Device) (1-Year Subscription) - Mac/Windows\",\n               \"matchedWords\": [],\n               \"matchLevel\": \"none\"\n            }\n         },\n         \"image\": \"http://img.bbystatic.com/BestBuy_US/images/products/1688/1688832_105x210_sc.jpg\",\n         \"shipping\": \"Free shipping\",\n         \"bestSellingRank\": 4,\n         \"shortDescription\": \"Safeguard your PC, Mac, Android and iOS devices with comprehensive Internet protection\",\n         \"url\": \"http://www.bestbuy.com/site/webroot-secureanywhere-internet-security-3-devi…d=1219060687969&skuId=1688832&cmp=RMX&ky=2d3GfEmNIzjA0vkzveHdZEBgpPCyMnLTJ\",\n         \"name\": \"Webroot SecureAnywhere Internet Security (3-Device) (1-Year Subscription) - Mac/Windows\",\n         \"category\": \"Computer Security Software\",\n         \"salePrice_range\": \"1 - 50\",\n         \"objectID\": \"1688832\",\n         \"type\": \"Software\",\n         \"customerReviewCount\": 5980,\n         \"salePrice\": 49.99,\n         \"manufacturer\": \"Webroot\"\n      },\n      ....\n  ],\n   \"nbHits\": 10000,\n   \"disjunctiveFacets\": [\n      {\n         \"exhaustive\": false,\n         \"data\": {\n            \"5\": 183,\n            \"12\": 112,\n            \"7\": 149,\n            ...\n         },\n         \"name\": \"customerReviewCount\",\n         \"stats\": {\n            \"max\": 7461,\n            \"avg\": 157.939,\n            \"min\": 1\n         }\n      },\n      {\n         \"data\": {\n            \"Printer Ink\": 142,\n            \"Wireless Speakers\": 60,\n            \"Point & Shoot Cameras\": 48,\n            ...\n         },\n         \"name\": \"category\",\n         \"exhaustive\": false\n      },\n      {\n         \"exhaustive\": false,\n         \"data\": {\n            \"> 5000\": 2,\n            \"1 - 50\": 6524,\n            \"501 - 2000\": 566,\n            \"201 - 500\": 1501,\n            \"101 - 200\": 1360,\n            \"2001 - 5000\": 47\n         },\n         \"name\": \"salePrice_range\"\n      },\n      {\n         \"data\": {\n            \"Dynex™\": 202,\n            \"Insignia™\": 230,\n            \"PNY\": 72,\n            ...\n         },\n         \"name\": \"manufacturer\",\n         \"exhaustive\": false\n      }\n  ],\n   \"query\": \"\",\n   \"nbPages\": 100,\n   \"page\": 0,\n   \"index\": \"bestbuy\"\n}\n **/\nfunction SearchResults(state, results, options) {\n  var mainSubResponse = results[0];\n\n  this._rawResults = results;\n\n  // eslint-disable-next-line consistent-this\n  var self = this;\n\n  // https://www.algolia.com/doc/api-reference/api-methods/search/#response\n  Object.keys(mainSubResponse).forEach(function (key) {\n    self[key] = mainSubResponse[key];\n  });\n\n  // Make every key of the result options reachable from the instance\n  Object.keys(options || {}).forEach(function (key) {\n    self[key] = options[key];\n  });\n\n  /**\n   * query used to generate the results\n   * @name query\n   * @member {string}\n   * @memberof SearchResults\n   * @instance\n   */\n  /**\n   * The query as parsed by the engine given all the rules.\n   * @name parsedQuery\n   * @member {string}\n   * @memberof SearchResults\n   * @instance\n   */\n  /**\n   * all the records that match the search parameters. Each record is\n   * augmented with a new attribute `_highlightResult`\n   * which is an object keyed by attribute and with the following properties:\n   * - `value` : the value of the facet highlighted (html)\n   * - `matchLevel`: `full`, `partial` or `none`, depending on how the query terms match\n   * @name hits\n   * @member {object[]}\n   * @memberof SearchResults\n   * @instance\n   */\n  /**\n   * index where the results come from\n   * @name index\n   * @member {string}\n   * @memberof SearchResults\n   * @instance\n   */\n  /**\n   * number of hits per page requested\n   * @name hitsPerPage\n   * @member {number}\n   * @memberof SearchResults\n   * @instance\n   */\n  /**\n   * total number of hits of this query on the index\n   * @name nbHits\n   * @member {number}\n   * @memberof SearchResults\n   * @instance\n   */\n  /**\n   * total number of pages with respect to the number of hits per page and the total number of hits\n   * @name nbPages\n   * @member {number}\n   * @memberof SearchResults\n   * @instance\n   */\n  /**\n   * current page\n   * @name page\n   * @member {number}\n   * @memberof SearchResults\n   * @instance\n   */\n  /**\n   * The position if the position was guessed by IP.\n   * @name aroundLatLng\n   * @member {string}\n   * @memberof SearchResults\n   * @instance\n   * @example \"48.8637,2.3615\",\n   */\n  /**\n   * The radius computed by Algolia.\n   * @name automaticRadius\n   * @member {string}\n   * @memberof SearchResults\n   * @instance\n   * @example \"126792922\",\n   */\n  /**\n   * String identifying the server used to serve this request.\n   *\n   * getRankingInfo needs to be set to `true` for this to be returned\n   *\n   * @name serverUsed\n   * @member {string}\n   * @memberof SearchResults\n   * @instance\n   * @example \"c7-use-2.algolia.net\",\n   */\n  /**\n   * Boolean that indicates if the computation of the counts did time out.\n   * @deprecated\n   * @name timeoutCounts\n   * @member {boolean}\n   * @memberof SearchResults\n   * @instance\n   */\n  /**\n   * Boolean that indicates if the computation of the hits did time out.\n   * @deprecated\n   * @name timeoutHits\n   * @member {boolean}\n   * @memberof SearchResults\n   * @instance\n   */\n  /**\n   * True if the counts of the facets is exhaustive\n   * @name exhaustiveFacetsCount\n   * @member {boolean}\n   * @memberof SearchResults\n   * @instance\n   */\n  /**\n   * True if the number of hits is exhaustive\n   * @name exhaustiveNbHits\n   * @member {boolean}\n   * @memberof SearchResults\n   * @instance\n   */\n  /**\n   * Contains the userData if they are set by a [query rule](https://www.algolia.com/doc/guides/query-rules/query-rules-overview/).\n   * @name userData\n   * @member {object[]}\n   * @memberof SearchResults\n   * @instance\n   */\n  /**\n   * queryID is the unique identifier of the query used to generate the current search results.\n   * This value is only available if the `clickAnalytics` search parameter is set to `true`.\n   * @name queryID\n   * @member {string}\n   * @memberof SearchResults\n   * @instance\n   */\n\n  /**\n   * sum of the processing time of all the queries\n   * @name processingTimeMS\n   * @member {number}\n   * @memberof SearchResults\n   * @instance\n   */\n  this.processingTimeMS = results.reduce(function (sum, result) {\n    return result.processingTimeMS === undefined\n      ? sum\n      : sum + result.processingTimeMS;\n  }, 0);\n\n  /**\n   * disjunctive facets results\n   * @member {SearchResults.Facet[]}\n   */\n  this.disjunctiveFacets = [];\n  /**\n   * disjunctive facets results\n   * @member {SearchResults.HierarchicalFacet[]}\n   */\n  this.hierarchicalFacets = state.hierarchicalFacets.map(\n    function initFutureTree() {\n      return [];\n    }\n  );\n  /**\n   * other facets results\n   * @member {SearchResults.Facet[]}\n   */\n  this.facets = [];\n\n  var disjunctiveFacets = state.getRefinedDisjunctiveFacets();\n\n  var facetsIndices = getIndices(state.facets);\n  var disjunctiveFacetsIndices = getIndices(state.disjunctiveFacets);\n  var nextDisjunctiveResult = 1;\n\n  // Since we send request only for disjunctive facets that have been refined,\n  // we get the facets information from the first, general, response.\n\n  var mainFacets = mainSubResponse.facets || {};\n\n  Object.keys(mainFacets).forEach(function (facetKey) {\n    var facetValueObject = mainFacets[facetKey];\n\n    var hierarchicalFacet = findMatchingHierarchicalFacetFromAttributeName(\n      state.hierarchicalFacets,\n      facetKey\n    );\n\n    if (hierarchicalFacet) {\n      // Place the hierarchicalFacet data at the correct index depending on\n      // the attributes order that was defined at the helper initialization\n      var facetIndex = hierarchicalFacet.attributes.indexOf(facetKey);\n      var idxAttributeName = findIndex(state.hierarchicalFacets, function (f) {\n        return f.name === hierarchicalFacet.name;\n      });\n      self.hierarchicalFacets[idxAttributeName][facetIndex] = {\n        attribute: facetKey,\n        data: facetValueObject,\n        exhaustive: mainSubResponse.exhaustiveFacetsCount,\n      };\n    } else {\n      var isFacetDisjunctive = state.disjunctiveFacets.indexOf(facetKey) !== -1;\n      var isFacetConjunctive = state.facets.indexOf(facetKey) !== -1;\n      var position;\n\n      if (isFacetDisjunctive) {\n        position = disjunctiveFacetsIndices[facetKey];\n        self.disjunctiveFacets[position] = {\n          name: facetKey,\n          data: facetValueObject,\n          exhaustive: mainSubResponse.exhaustiveFacetsCount,\n        };\n        assignFacetStats(\n          self.disjunctiveFacets[position],\n          mainSubResponse.facets_stats,\n          facetKey\n        );\n      }\n      if (isFacetConjunctive) {\n        position = facetsIndices[facetKey];\n        self.facets[position] = {\n          name: facetKey,\n          data: facetValueObject,\n          exhaustive: mainSubResponse.exhaustiveFacetsCount,\n        };\n        assignFacetStats(\n          self.facets[position],\n          mainSubResponse.facets_stats,\n          facetKey\n        );\n      }\n    }\n  });\n\n  // Make sure we do not keep holes within the hierarchical facets\n  this.hierarchicalFacets = compact(this.hierarchicalFacets);\n\n  // aggregate the refined disjunctive facets\n  disjunctiveFacets.forEach(function (disjunctiveFacet) {\n    var result = results[nextDisjunctiveResult];\n    var facets = result && result.facets ? result.facets : {};\n    var hierarchicalFacet = state.getHierarchicalFacetByName(disjunctiveFacet);\n\n    // There should be only item in facets.\n    Object.keys(facets).forEach(function (dfacet) {\n      var facetResults = facets[dfacet];\n\n      var position;\n\n      if (hierarchicalFacet) {\n        position = findIndex(state.hierarchicalFacets, function (f) {\n          return f.name === hierarchicalFacet.name;\n        });\n        var attributeIndex = findIndex(\n          self.hierarchicalFacets[position],\n          function (f) {\n            return f.attribute === dfacet;\n          }\n        );\n\n        // previous refinements and no results so not able to find it\n        if (attributeIndex === -1) {\n          return;\n        }\n\n        self.hierarchicalFacets[position][attributeIndex].data = merge(\n          {},\n          self.hierarchicalFacets[position][attributeIndex].data,\n          facetResults\n        );\n      } else {\n        position = disjunctiveFacetsIndices[dfacet];\n\n        var dataFromMainRequest =\n          (mainSubResponse.facets && mainSubResponse.facets[dfacet]) || {};\n\n        self.disjunctiveFacets[position] = {\n          name: dfacet,\n          data: defaultsPure({}, facetResults, dataFromMainRequest),\n          exhaustive: result.exhaustiveFacetsCount,\n        };\n        assignFacetStats(\n          self.disjunctiveFacets[position],\n          result.facets_stats,\n          dfacet\n        );\n\n        if (state.disjunctiveFacetsRefinements[dfacet]) {\n          state.disjunctiveFacetsRefinements[dfacet].forEach(function (\n            refinementValue\n          ) {\n            // add the disjunctive refinements if it is no more retrieved\n            if (\n              !self.disjunctiveFacets[position].data[refinementValue] &&\n              state.disjunctiveFacetsRefinements[dfacet].indexOf(\n                unescapeFacetValue(refinementValue)\n              ) > -1\n            ) {\n              self.disjunctiveFacets[position].data[refinementValue] = 0;\n            }\n          });\n        }\n      }\n    });\n    nextDisjunctiveResult++;\n  });\n\n  // if we have some parent level values for hierarchical facets, merge them\n  state.getRefinedHierarchicalFacets().forEach(function (refinedFacet) {\n    var hierarchicalFacet = state.getHierarchicalFacetByName(refinedFacet);\n    var separator = state._getHierarchicalFacetSeparator(hierarchicalFacet);\n\n    var currentRefinement = state.getHierarchicalRefinement(refinedFacet);\n    // if we are already at a root refinement (or no refinement at all), there is no\n    // root level values request\n    if (\n      currentRefinement.length === 0 ||\n      currentRefinement[0].split(separator).length < 2\n    ) {\n      return;\n    }\n\n    results.slice(nextDisjunctiveResult).forEach(function (result) {\n      var facets = result && result.facets ? result.facets : {};\n\n      Object.keys(facets).forEach(function (dfacet) {\n        var facetResults = facets[dfacet];\n        var position = findIndex(state.hierarchicalFacets, function (f) {\n          return f.name === hierarchicalFacet.name;\n        });\n        var attributeIndex = findIndex(\n          self.hierarchicalFacets[position],\n          function (f) {\n            return f.attribute === dfacet;\n          }\n        );\n\n        // previous refinements and no results so not able to find it\n        if (attributeIndex === -1) {\n          return;\n        }\n\n        // when we always get root levels, if the hits refinement is `beers > IPA` (count: 5),\n        // then the disjunctive values will be `beers` (count: 100),\n        // but we do not want to display\n        //   | beers (100)\n        //     > IPA (5)\n        // We want\n        //   | beers (5)\n        //     > IPA (5)\n        var defaultData = {};\n\n        if (currentRefinement.length > 0) {\n          var root = currentRefinement[0].split(separator)[0];\n          defaultData[root] =\n            self.hierarchicalFacets[position][attributeIndex].data[root];\n        }\n\n        self.hierarchicalFacets[position][attributeIndex].data = defaultsPure(\n          defaultData,\n          facetResults,\n          self.hierarchicalFacets[position][attributeIndex].data\n        );\n      });\n\n      nextDisjunctiveResult++;\n    });\n  });\n\n  // add the excludes\n  Object.keys(state.facetsExcludes).forEach(function (facetName) {\n    var excludes = state.facetsExcludes[facetName];\n    var position = facetsIndices[facetName];\n\n    self.facets[position] = {\n      name: facetName,\n      data: mainFacets[facetName],\n      exhaustive: mainSubResponse.exhaustiveFacetsCount,\n    };\n    excludes.forEach(function (facetValue) {\n      self.facets[position] = self.facets[position] || { name: facetName };\n      self.facets[position].data = self.facets[position].data || {};\n      self.facets[position].data[facetValue] = 0;\n    });\n  });\n\n  /**\n   * @type {Array}\n   */\n  this.hierarchicalFacets = this.hierarchicalFacets.map(\n    generateHierarchicalTree(state)\n  );\n\n  /**\n   * @type {Array}\n   */\n  this.facets = compact(this.facets);\n  /**\n   * @type {Array}\n   */\n  this.disjunctiveFacets = compact(this.disjunctiveFacets);\n\n  this._state = state;\n}\n\n/**\n * Get a facet object with its name\n * @deprecated\n * @param {string} name name of the faceted attribute\n * @return {SearchResults.Facet} the facet object\n */\nSearchResults.prototype.getFacetByName = function (name) {\n  function predicate(facet) {\n    return facet.name === name;\n  }\n\n  return (\n    find(this.facets, predicate) ||\n    find(this.disjunctiveFacets, predicate) ||\n    find(this.hierarchicalFacets, predicate)\n  );\n};\n\n/**\n * Get the facet values of a specified attribute from a SearchResults object.\n * @private\n * @param {SearchResults} results the search results to search in\n * @param {string} attribute name of the faceted attribute to search for\n * @return {array|object} facet values. For the hierarchical facets it is an object.\n */\nfunction extractNormalizedFacetValues(results, attribute) {\n  function predicate(facet) {\n    return facet.name === attribute;\n  }\n\n  if (results._state.isConjunctiveFacet(attribute)) {\n    var facet = find(results.facets, predicate);\n    if (!facet) return [];\n\n    return Object.keys(facet.data).map(function (name) {\n      var value = escapeFacetValue(name);\n      return {\n        name: name,\n        escapedValue: value,\n        count: facet.data[name],\n        isRefined: results._state.isFacetRefined(attribute, value),\n        isExcluded: results._state.isExcludeRefined(attribute, name),\n      };\n    });\n  } else if (results._state.isDisjunctiveFacet(attribute)) {\n    var disjunctiveFacet = find(results.disjunctiveFacets, predicate);\n    if (!disjunctiveFacet) return [];\n\n    return Object.keys(disjunctiveFacet.data).map(function (name) {\n      var value = escapeFacetValue(name);\n      return {\n        name: name,\n        escapedValue: value,\n        count: disjunctiveFacet.data[name],\n        isRefined: results._state.isDisjunctiveFacetRefined(attribute, value),\n      };\n    });\n  } else if (results._state.isHierarchicalFacet(attribute)) {\n    var hierarchicalFacetValues = find(results.hierarchicalFacets, predicate);\n    if (!hierarchicalFacetValues) return hierarchicalFacetValues;\n\n    var hierarchicalFacet =\n      results._state.getHierarchicalFacetByName(attribute);\n    var separator =\n      results._state._getHierarchicalFacetSeparator(hierarchicalFacet);\n    var currentRefinement = unescapeFacetValue(\n      results._state.getHierarchicalRefinement(attribute)[0] || ''\n    );\n\n    if (currentRefinement.indexOf(hierarchicalFacet.rootPath) === 0) {\n      currentRefinement = currentRefinement.replace(\n        hierarchicalFacet.rootPath + separator,\n        ''\n      );\n    }\n\n    var currentRefinementSplit = currentRefinement.split(separator);\n    currentRefinementSplit.unshift(attribute);\n\n    setIsRefined(hierarchicalFacetValues, currentRefinementSplit, 0);\n\n    return hierarchicalFacetValues;\n  }\n\n  return undefined;\n}\n\n/**\n * Set the isRefined of a hierarchical facet result based on the current state.\n * @param {SearchResults.HierarchicalFacet} item Hierarchical facet to fix\n * @param {string[]} currentRefinement array of parts of the current hierarchical refinement\n * @param {number} depth recursion depth in the currentRefinement\n * @return {undefined} function mutates the item\n */\nfunction setIsRefined(item, currentRefinement, depth) {\n  item.isRefined = item.name === currentRefinement[depth];\n  if (item.data) {\n    item.data.forEach(function (child) {\n      setIsRefined(child, currentRefinement, depth + 1);\n    });\n  }\n}\n\n/**\n * Sort nodes of a hierarchical or disjunctive facet results\n * @private\n * @param {function} sortFn sort function to apply\n * @param {HierarchicalFacet|Array} node node upon which we want to apply the sort\n * @param {string[]} names attribute names\n * @param {number} [level=0] current index in the names array\n * @return {HierarchicalFacet|Array} sorted node\n */\nfunction recSort(sortFn, node, names, level) {\n  level = level || 0;\n\n  if (Array.isArray(node)) {\n    return sortFn(node, names[level]);\n  }\n\n  if (!node.data || node.data.length === 0) {\n    return node;\n  }\n\n  var children = node.data.map(function (childNode) {\n    return recSort(sortFn, childNode, names, level + 1);\n  });\n  var sortedChildren = sortFn(children, names[level]);\n  var newNode = defaultsPure({ data: sortedChildren }, node);\n  return newNode;\n}\n\nSearchResults.DEFAULT_SORT = ['isRefined:desc', 'count:desc', 'name:asc'];\n\nfunction vanillaSortFn(order, data) {\n  return data.sort(order);\n}\n\n/**\n * @typedef FacetOrdering\n * @type {Object}\n * @property {string[]} [order]\n * @property {'count' | 'alpha' | 'hidden'} [sortRemainingBy]\n */\n\n/**\n * Sorts facet arrays via their facet ordering\n * @param {Array} facetValues the values\n * @param {FacetOrdering} facetOrdering the ordering\n * @returns {Array} the sorted facet values\n */\nfunction sortViaFacetOrdering(facetValues, facetOrdering) {\n  var orderedFacets = [];\n  var remainingFacets = [];\n\n  var order = facetOrdering.order || [];\n  /**\n   * an object with the keys being the values in order, the values their index:\n   * ['one', 'two'] -> { one: 0, two: 1 }\n   */\n  var reverseOrder = order.reduce(function (acc, name, i) {\n    acc[name] = i;\n    return acc;\n  }, {});\n\n  facetValues.forEach(function (item) {\n    // hierarchical facets get sorted using their raw name\n    var name = item.path || item.name;\n    if (reverseOrder[name] !== undefined) {\n      orderedFacets[reverseOrder[name]] = item;\n    } else {\n      remainingFacets.push(item);\n    }\n  });\n\n  orderedFacets = orderedFacets.filter(function (facet) {\n    return facet;\n  });\n\n  var sortRemainingBy = facetOrdering.sortRemainingBy;\n  var ordering;\n  if (sortRemainingBy === 'hidden') {\n    return orderedFacets;\n  } else if (sortRemainingBy === 'alpha') {\n    ordering = [\n      ['path', 'name'],\n      ['asc', 'asc'],\n    ];\n  } else {\n    ordering = [['count'], ['desc']];\n  }\n\n  return orderedFacets.concat(\n    orderBy(remainingFacets, ordering[0], ordering[1])\n  );\n}\n\n/**\n * @param {SearchResults} results the search results class\n * @param {string} attribute the attribute to retrieve ordering of\n * @returns {FacetOrdering | undefined} the facet ordering\n */\nfunction getFacetOrdering(results, attribute) {\n  return (\n    results.renderingContent &&\n    results.renderingContent.facetOrdering &&\n    results.renderingContent.facetOrdering.values &&\n    results.renderingContent.facetOrdering.values[attribute]\n  );\n}\n\n/**\n * Get a the list of values for a given facet attribute. Those values are sorted\n * refinement first, descending count (bigger value on top), and name ascending\n * (alphabetical order). The sort formula can overridden using either string based\n * predicates or a function.\n *\n * This method will return all the values returned by the Algolia engine plus all\n * the values already refined. This means that it can happen that the\n * `maxValuesPerFacet` [configuration](https://www.algolia.com/doc/rest-api/search#param-maxValuesPerFacet)\n * might not be respected if you have facet values that are already refined.\n * @param {string} attribute attribute name\n * @param {object} opts configuration options.\n * @param {boolean} [opts.facetOrdering]\n * Force the use of facetOrdering from the result if a sortBy is present. If\n * sortBy isn't present, facetOrdering will be used automatically.\n * @param {Array.<string> | function} opts.sortBy\n * When using strings, it consists of\n * the name of the [FacetValue](#SearchResults.FacetValue) or the\n * [HierarchicalFacet](#SearchResults.HierarchicalFacet) attributes with the\n * order (`asc` or `desc`). For example to order the value by count, the\n * argument would be `['count:asc']`.\n *\n * If only the attribute name is specified, the ordering defaults to the one\n * specified in the default value for this attribute.\n *\n * When not specified, the order is\n * ascending.  This parameter can also be a function which takes two facet\n * values and should return a number, 0 if equal, 1 if the first argument is\n * bigger or -1 otherwise.\n *\n * The default value for this attribute `['isRefined:desc', 'count:desc', 'name:asc']`\n * @return {FacetValue[]|HierarchicalFacet|undefined} depending on the type of facet of\n * the attribute requested (hierarchical, disjunctive or conjunctive)\n * @example\n * helper.on('result', function(event){\n *   //get values ordered only by name ascending using the string predicate\n *   event.results.getFacetValues('city', {sortBy: ['name:asc']});\n *   //get values  ordered only by count ascending using a function\n *   event.results.getFacetValues('city', {\n *     // this is equivalent to ['count:asc']\n *     sortBy: function(a, b) {\n *       if (a.count === b.count) return 0;\n *       if (a.count > b.count)   return 1;\n *       if (b.count > a.count)   return -1;\n *     }\n *   });\n * });\n */\nSearchResults.prototype.getFacetValues = function (attribute, opts) {\n  var facetValues = extractNormalizedFacetValues(this, attribute);\n  if (!facetValues) {\n    return undefined;\n  }\n\n  var options = defaultsPure({}, opts, {\n    sortBy: SearchResults.DEFAULT_SORT,\n    // if no sortBy is given, attempt to sort based on facetOrdering\n    // if it is given, we still allow to sort via facet ordering first\n    facetOrdering: !(opts && opts.sortBy),\n  });\n\n  // eslint-disable-next-line consistent-this\n  var results = this;\n  var attributes;\n  if (Array.isArray(facetValues)) {\n    attributes = [attribute];\n  } else {\n    var config = results._state.getHierarchicalFacetByName(facetValues.name);\n    attributes = config.attributes;\n  }\n\n  return recSort(\n    function (data, facetName) {\n      if (options.facetOrdering) {\n        var facetOrdering = getFacetOrdering(results, facetName);\n        if (facetOrdering) {\n          return sortViaFacetOrdering(data, facetOrdering);\n        }\n      }\n\n      if (Array.isArray(options.sortBy)) {\n        var order = formatSort(options.sortBy, SearchResults.DEFAULT_SORT);\n        return orderBy(data, order[0], order[1]);\n      } else if (typeof options.sortBy === 'function') {\n        return vanillaSortFn(options.sortBy, data);\n      }\n      throw new Error(\n        'options.sortBy is optional but if defined it must be ' +\n          'either an array of string (predicates) or a sorting function'\n      );\n    },\n    facetValues,\n    attributes\n  );\n};\n\n/**\n * Returns the facet stats if attribute is defined and the facet contains some.\n * Otherwise returns undefined.\n * @param {string} attribute name of the faceted attribute\n * @return {object} The stats of the facet\n */\nSearchResults.prototype.getFacetStats = function (attribute) {\n  if (this._state.isConjunctiveFacet(attribute)) {\n    return getFacetStatsIfAvailable(this.facets, attribute);\n  } else if (this._state.isDisjunctiveFacet(attribute)) {\n    return getFacetStatsIfAvailable(this.disjunctiveFacets, attribute);\n  }\n\n  return undefined;\n};\n\n/**\n * @typedef {Object} FacetListItem\n * @property {string} name\n */\n\n/**\n * @param {FacetListItem[]} facetList (has more items, but enough for here)\n * @param {string} facetName The attribute to look for\n * @return {object|undefined} The stats of the facet\n */\nfunction getFacetStatsIfAvailable(facetList, facetName) {\n  var data = find(facetList, function (facet) {\n    return facet.name === facetName;\n  });\n  return data && data.stats;\n}\n\n/**\n * Returns all refinements for all filters + tags. It also provides\n * additional information: count and exhaustiveness for each filter.\n *\n * See the [refinement type](#Refinement) for an exhaustive view of the available\n * data.\n *\n * Note that for a numeric refinement, results are grouped per operator, this\n * means that it will return responses for operators which are empty.\n *\n * @return {Array.<Refinement>} all the refinements\n */\nSearchResults.prototype.getRefinements = function () {\n  var state = this._state;\n  // eslint-disable-next-line consistent-this\n  var results = this;\n  var res = [];\n\n  Object.keys(state.facetsRefinements).forEach(function (attributeName) {\n    state.facetsRefinements[attributeName].forEach(function (name) {\n      res.push(\n        getRefinement(state, 'facet', attributeName, name, results.facets)\n      );\n    });\n  });\n\n  Object.keys(state.facetsExcludes).forEach(function (attributeName) {\n    state.facetsExcludes[attributeName].forEach(function (name) {\n      res.push(\n        getRefinement(state, 'exclude', attributeName, name, results.facets)\n      );\n    });\n  });\n\n  Object.keys(state.disjunctiveFacetsRefinements).forEach(function (\n    attributeName\n  ) {\n    state.disjunctiveFacetsRefinements[attributeName].forEach(function (name) {\n      res.push(\n        getRefinement(\n          state,\n          'disjunctive',\n          attributeName,\n          name,\n          results.disjunctiveFacets\n        )\n      );\n    });\n  });\n\n  Object.keys(state.hierarchicalFacetsRefinements).forEach(function (\n    attributeName\n  ) {\n    state.hierarchicalFacetsRefinements[attributeName].forEach(function (name) {\n      res.push(\n        getHierarchicalRefinement(\n          state,\n          attributeName,\n          name,\n          results.hierarchicalFacets\n        )\n      );\n    });\n  });\n\n  Object.keys(state.numericRefinements).forEach(function (attributeName) {\n    var operators = state.numericRefinements[attributeName];\n    Object.keys(operators).forEach(function (operator) {\n      operators[operator].forEach(function (value) {\n        res.push({\n          type: 'numeric',\n          attributeName: attributeName,\n          name: value,\n          numericValue: value,\n          operator: operator,\n        });\n      });\n    });\n  });\n\n  state.tagRefinements.forEach(function (name) {\n    res.push({ type: 'tag', attributeName: '_tags', name: name });\n  });\n\n  return res;\n};\n\n/**\n * @typedef {Object} Facet\n * @property {string} name\n * @property {Object} data\n * @property {boolean} exhaustive\n */\n\n/**\n * @param {SearchParameters} state the current state\n * @param {string} type the type of the refinement\n * @param {string} attributeName The attribute of the facet\n * @param {*} name The name of the facet\n * @param {Facet[]} resultsFacets facets from the results\n * @return {Refinement} the refinement\n */\nfunction getRefinement(state, type, attributeName, name, resultsFacets) {\n  var facet = find(resultsFacets, function (f) {\n    return f.name === attributeName;\n  });\n  var count = facet && facet.data && facet.data[name] ? facet.data[name] : 0;\n  var exhaustive = (facet && facet.exhaustive) || false;\n\n  return {\n    type: type,\n    attributeName: attributeName,\n    name: name,\n    count: count,\n    exhaustive: exhaustive,\n  };\n}\n\n/**\n * @param {SearchParameters} state the current state\n * @param {string} attributeName the attribute of the hierarchical facet\n * @param {string} name the name of the facet\n * @param {Facet[]} resultsFacets facets from the results\n * @return {HierarchicalFacet} the hierarchical facet\n */\nfunction getHierarchicalRefinement(state, attributeName, name, resultsFacets) {\n  var facetDeclaration = state.getHierarchicalFacetByName(attributeName);\n  var separator = state._getHierarchicalFacetSeparator(facetDeclaration);\n  var split = name.split(separator);\n  var rootFacet = find(resultsFacets, function (facet) {\n    return facet.name === attributeName;\n  });\n\n  var facet = split.reduce(function (intermediateFacet, part) {\n    var newFacet =\n      intermediateFacet &&\n      find(intermediateFacet.data, function (f) {\n        return f.name === part;\n      });\n    return newFacet !== undefined ? newFacet : intermediateFacet;\n  }, rootFacet);\n\n  var count = (facet && facet.count) || 0;\n  var exhaustive = (facet && facet.exhaustive) || false;\n  var path = (facet && facet.path) || '';\n\n  return {\n    type: 'hierarchical',\n    attributeName: attributeName,\n    name: path,\n    count: count,\n    exhaustive: exhaustive,\n  };\n}\n\nmodule.exports = SearchResults;\n","'use strict';\n\nvar EventEmitter = require('@algolia/events');\n\nvar DerivedHelper = require('./DerivedHelper');\nvar escapeFacetValue = require('./functions/escapeFacetValue').escapeFacetValue;\nvar inherits = require('./functions/inherits');\nvar merge = require('./functions/merge');\nvar objectHasKeys = require('./functions/objectHasKeys');\nvar omit = require('./functions/omit');\nvar requestBuilder = require('./requestBuilder');\nvar SearchParameters = require('./SearchParameters');\nvar SearchResults = require('./SearchResults');\nvar version = require('./version');\n\n/**\n * Event triggered when a parameter is set or updated\n * @event AlgoliaSearchHelper#event:change\n * @property {object} event\n * @property {SearchParameters} event.state the current parameters with the latest changes applied\n * @property {SearchResults} event.results the previous results received from Algolia. `null` before the first request\n * @example\n * helper.on('change', function(event) {\n *   console.log('The parameters have changed');\n * });\n */\n\n/**\n * Event triggered when a main search is sent to Algolia\n * @event AlgoliaSearchHelper#event:search\n * @property {object} event\n * @property {SearchParameters} event.state the parameters used for this search\n * @property {SearchResults} event.results the results from the previous search. `null` if it is the first search.\n * @example\n * helper.on('search', function(event) {\n *   console.log('Search sent');\n * });\n */\n\n/**\n * Event triggered when a search using `searchForFacetValues` is sent to Algolia\n * @event AlgoliaSearchHelper#event:searchForFacetValues\n * @property {object} event\n * @property {SearchParameters} event.state the parameters used for this search it is the first search.\n * @property {string} event.facet the facet searched into\n * @property {string} event.query the query used to search in the facets\n * @example\n * helper.on('searchForFacetValues', function(event) {\n *   console.log('searchForFacetValues sent');\n * });\n */\n\n/**\n * Event triggered when a search using `searchOnce` is sent to Algolia\n * @event AlgoliaSearchHelper#event:searchOnce\n * @property {object} event\n * @property {SearchParameters} event.state the parameters used for this search it is the first search.\n * @example\n * helper.on('searchOnce', function(event) {\n *   console.log('searchOnce sent');\n * });\n */\n\n/**\n * Event triggered when the results are retrieved from Algolia\n * @event AlgoliaSearchHelper#event:result\n * @property {object} event\n * @property {SearchResults} event.results the results received from Algolia\n * @property {SearchParameters} event.state the parameters used to query Algolia. Those might be different from the one in the helper instance (for example if the network is unreliable).\n * @example\n * helper.on('result', function(event) {\n *   console.log('Search results received');\n * });\n */\n\n/**\n * Event triggered when Algolia sends back an error. For example, if an unknown parameter is\n * used, the error can be caught using this event.\n * @event AlgoliaSearchHelper#event:error\n * @property {object} event\n * @property {Error} event.error the error returned by the Algolia.\n * @example\n * helper.on('error', function(event) {\n *   console.log('Houston we got a problem.');\n * });\n */\n\n/**\n * Event triggered when the queue of queries have been depleted (with any result or outdated queries)\n * @event AlgoliaSearchHelper#event:searchQueueEmpty\n * @example\n * helper.on('searchQueueEmpty', function() {\n *   console.log('No more search pending');\n *   // This is received before the result event if we're not expecting new results\n * });\n *\n * helper.search();\n */\n\n/**\n * Initialize a new AlgoliaSearchHelper\n * @class\n * @classdesc The AlgoliaSearchHelper is a class that ease the management of the\n * search. It provides an event based interface for search callbacks:\n *  - change: when the internal search state is changed.\n *    This event contains a {@link SearchParameters} object and the\n *    {@link SearchResults} of the last result if any.\n *  - search: when a search is triggered using the `search()` method.\n *  - result: when the response is retrieved from Algolia and is processed.\n *    This event contains a {@link SearchResults} object and the\n *    {@link SearchParameters} corresponding to this answer.\n *  - error: when the response is an error. This event contains the error returned by the server.\n * @param  {AlgoliaSearch} client an AlgoliaSearch client\n * @param  {string} index the index name to query\n * @param  {SearchParameters | object} options an object defining the initial\n * config of the search. It doesn't have to be a {SearchParameters},\n * just an object containing the properties you need from it.\n */\nfunction AlgoliaSearchHelper(client, index, options) {\n  if (typeof client.addAlgoliaAgent === 'function') {\n    client.addAlgoliaAgent('JS Helper (' + version + ')');\n  }\n\n  this.setClient(client);\n  var opts = options || {};\n  opts.index = index;\n  this.state = SearchParameters.make(opts);\n  this.lastResults = null;\n  this._queryId = 0;\n  this._lastQueryIdReceived = -1;\n  this.derivedHelpers = [];\n  this._currentNbQueries = 0;\n}\n\ninherits(AlgoliaSearchHelper, EventEmitter);\n\n/**\n * Start the search with the parameters set in the state. When the\n * method is called, it triggers a `search` event. The results will\n * be available through the `result` event. If an error occurs, an\n * `error` will be fired instead.\n * @return {AlgoliaSearchHelper} Method is chainable, it returns itself\n * @fires search\n * @fires result\n * @fires error\n * @chainable\n */\nAlgoliaSearchHelper.prototype.search = function () {\n  this._search({ onlyWithDerivedHelpers: false });\n  return this;\n};\n\nAlgoliaSearchHelper.prototype.searchOnlyWithDerivedHelpers = function () {\n  this._search({ onlyWithDerivedHelpers: true });\n  return this;\n};\n\n/**\n * Gets the search query parameters that would be sent to the Algolia Client\n * for the hits\n * @return {object} Query Parameters\n */\nAlgoliaSearchHelper.prototype.getQuery = function () {\n  var state = this.state;\n  return requestBuilder._getHitsSearchParams(state);\n};\n\n/**\n * Start a search using a modified version of the current state. This method does\n * not trigger the helper lifecycle and does not modify the state kept internally\n * by the helper. This second aspect means that the next search call will be the\n * same as a search call before calling searchOnce.\n * @param {object} options can contain all the parameters that can be set to SearchParameters\n * plus the index\n * @param {function} [cb] optional callback executed when the response from the\n * server is back.\n * @return {promise|undefined} if a callback is passed the method returns undefined\n * otherwise it returns a promise containing an object with two keys :\n *  - content with a SearchResults\n *  - state with the state used for the query as a SearchParameters\n * @example\n * // Changing the number of records returned per page to 1\n * // This example uses the callback API\n * var state = helper.searchOnce({hitsPerPage: 1},\n *   function(error, content, state) {\n *     // if an error occurred it will be passed in error, otherwise its value is null\n *     // content contains the results formatted as a SearchResults\n *     // state is the instance of SearchParameters used for this search\n *   });\n * @example\n * // Changing the number of records returned per page to 1\n * // This example uses the promise API\n * var state1 = helper.searchOnce({hitsPerPage: 1})\n *                 .then(promiseHandler);\n *\n * function promiseHandler(res) {\n *   // res contains\n *   // {\n *   //   content : SearchResults\n *   //   state   : SearchParameters (the one used for this specific search)\n *   // }\n * }\n */\nAlgoliaSearchHelper.prototype.searchOnce = function (options, cb) {\n  var tempState = !options\n    ? this.state\n    : this.state.setQueryParameters(options);\n  var queries = requestBuilder._getQueries(tempState.index, tempState);\n  // eslint-disable-next-line consistent-this\n  var self = this;\n\n  this._currentNbQueries++;\n\n  this.emit('searchOnce', {\n    state: tempState,\n  });\n\n  if (cb) {\n    this.client\n      .search(queries)\n      .then(function (content) {\n        self._currentNbQueries--;\n        if (self._currentNbQueries === 0) {\n          self.emit('searchQueueEmpty');\n        }\n\n        cb(null, new SearchResults(tempState, content.results), tempState);\n      })\n      .catch(function (err) {\n        self._currentNbQueries--;\n        if (self._currentNbQueries === 0) {\n          self.emit('searchQueueEmpty');\n        }\n\n        cb(err, null, tempState);\n      });\n\n    return undefined;\n  }\n\n  return this.client.search(queries).then(\n    function (content) {\n      self._currentNbQueries--;\n      if (self._currentNbQueries === 0) self.emit('searchQueueEmpty');\n      return {\n        content: new SearchResults(tempState, content.results),\n        state: tempState,\n        _originalResponse: content,\n      };\n    },\n    function (e) {\n      self._currentNbQueries--;\n      if (self._currentNbQueries === 0) self.emit('searchQueueEmpty');\n      throw e;\n    }\n  );\n};\n\n/**\n * Start the search for answers with the parameters set in the state.\n * This method returns a promise.\n * @param {Object} options - the options for answers API call\n * @param {string[]} options.attributesForPrediction - Attributes to use for predictions. If empty, `searchableAttributes` is used instead.\n * @param {string[]} options.queryLanguages - The languages in the query. Currently only supports ['en'].\n * @param {number} options.nbHits - Maximum number of answers to retrieve from the Answers Engine. Cannot be greater than 1000.\n *\n * @return {promise} the answer results\n * @deprecated answers is deprecated and will be replaced with new initiatives\n */\nAlgoliaSearchHelper.prototype.findAnswers = function (options) {\n  // eslint-disable-next-line no-console\n  console.warn('[algoliasearch-helper] answers is no longer supported');\n  var state = this.state;\n  var derivedHelper = this.derivedHelpers[0];\n  if (!derivedHelper) {\n    return Promise.resolve([]);\n  }\n  var derivedState = derivedHelper.getModifiedState(state);\n  var data = merge(\n    {\n      attributesForPrediction: options.attributesForPrediction,\n      nbHits: options.nbHits,\n    },\n    {\n      params: omit(requestBuilder._getHitsSearchParams(derivedState), [\n        'attributesToSnippet',\n        'hitsPerPage',\n        'restrictSearchableAttributes',\n        'snippetEllipsisText',\n      ]),\n    }\n  );\n\n  var errorMessage =\n    'search for answers was called, but this client does not have a function client.initIndex(index).findAnswers';\n  if (typeof this.client.initIndex !== 'function') {\n    throw new Error(errorMessage);\n  }\n  var index = this.client.initIndex(derivedState.index);\n  if (typeof index.findAnswers !== 'function') {\n    throw new Error(errorMessage);\n  }\n  return index.findAnswers(derivedState.query, options.queryLanguages, data);\n};\n\n/**\n * Structure of each result when using\n * [`searchForFacetValues()`](reference.html#AlgoliaSearchHelper#searchForFacetValues)\n * @typedef FacetSearchHit\n * @type {object}\n * @property {string} value the facet value\n * @property {string} highlighted the facet value highlighted with the query string\n * @property {number} count number of occurrence of this facet value\n * @property {boolean} isRefined true if the value is already refined\n */\n\n/**\n * Structure of the data resolved by the\n * [`searchForFacetValues()`](reference.html#AlgoliaSearchHelper#searchForFacetValues)\n * promise.\n * @typedef FacetSearchResult\n * @type {object}\n * @property {FacetSearchHit} facetHits the results for this search for facet values\n * @property {number} processingTimeMS time taken by the query inside the engine\n */\n\n/**\n * Search for facet values based on an query and the name of a faceted attribute. This\n * triggers a search and will return a promise. On top of using the query, it also sends\n * the parameters from the state so that the search is narrowed down to only the possible values.\n *\n * See the description of [FacetSearchResult](reference.html#FacetSearchResult)\n * @param {string} facet the name of the faceted attribute\n * @param {string} query the string query for the search\n * @param {number} [maxFacetHits] the maximum number values returned. Should be > 0 and <= 100\n * @param {object} [userState] the set of custom parameters to use on top of the current state. Setting a property to `undefined` removes\n * it in the generated query.\n * @return {promise.<FacetSearchResult>} the results of the search\n */\nAlgoliaSearchHelper.prototype.searchForFacetValues = function (\n  facet,\n  query,\n  maxFacetHits,\n  userState\n) {\n  var clientHasSFFV = typeof this.client.searchForFacetValues === 'function';\n  var clientHasInitIndex = typeof this.client.initIndex === 'function';\n  if (\n    !clientHasSFFV &&\n    !clientHasInitIndex &&\n    typeof this.client.search !== 'function'\n  ) {\n    throw new Error(\n      'search for facet values (searchable) was called, but this client does not have a function client.searchForFacetValues or client.initIndex(index).searchForFacetValues'\n    );\n  }\n\n  var state = this.state.setQueryParameters(userState || {});\n  var isDisjunctive = state.isDisjunctiveFacet(facet);\n  var algoliaQuery = requestBuilder.getSearchForFacetQuery(\n    facet,\n    query,\n    maxFacetHits,\n    state\n  );\n\n  this._currentNbQueries++;\n  // eslint-disable-next-line consistent-this\n  var self = this;\n  var searchForFacetValuesPromise;\n  // newer algoliasearch ^3.27.1 - ~4.0.0\n  if (clientHasSFFV) {\n    searchForFacetValuesPromise = this.client.searchForFacetValues([\n      { indexName: state.index, params: algoliaQuery },\n    ]);\n    // algoliasearch < 3.27.1\n  } else if (clientHasInitIndex) {\n    searchForFacetValuesPromise = this.client\n      .initIndex(state.index)\n      .searchForFacetValues(algoliaQuery);\n    // algoliasearch ~5.0.0\n  } else {\n    // @MAJOR only use client.search\n    delete algoliaQuery.facetName;\n    searchForFacetValuesPromise = this.client\n      .search([\n        {\n          type: 'facet',\n          facet: facet,\n          indexName: state.index,\n          params: algoliaQuery,\n        },\n      ])\n      .then(function processResponse(response) {\n        return response.results[0];\n      });\n  }\n\n  this.emit('searchForFacetValues', {\n    state: state,\n    facet: facet,\n    query: query,\n  });\n\n  return searchForFacetValuesPromise.then(\n    function addIsRefined(content) {\n      self._currentNbQueries--;\n      if (self._currentNbQueries === 0) self.emit('searchQueueEmpty');\n\n      content = Array.isArray(content) ? content[0] : content;\n\n      content.facetHits.forEach(function (f) {\n        f.escapedValue = escapeFacetValue(f.value);\n        f.isRefined = isDisjunctive\n          ? state.isDisjunctiveFacetRefined(facet, f.escapedValue)\n          : state.isFacetRefined(facet, f.escapedValue);\n      });\n\n      return content;\n    },\n    function (e) {\n      self._currentNbQueries--;\n      if (self._currentNbQueries === 0) self.emit('searchQueueEmpty');\n      throw e;\n    }\n  );\n};\n\n/**\n * Sets the text query used for the search.\n *\n * This method resets the current page to 0.\n * @param  {string} q the user query\n * @return {AlgoliaSearchHelper} Method is chainable, it returns itself\n * @fires change\n * @chainable\n */\nAlgoliaSearchHelper.prototype.setQuery = function (q) {\n  this._change({\n    state: this.state.resetPage().setQuery(q),\n    isPageReset: true,\n  });\n\n  return this;\n};\n\n/**\n * Remove all the types of refinements except tags. A string can be provided to remove\n * only the refinements of a specific attribute. For more advanced use case, you can\n * provide a function instead. This function should follow the\n * [clearCallback definition](#SearchParameters.clearCallback).\n *\n * This method resets the current page to 0.\n * @param {string} [name] optional name of the facet / attribute on which we want to remove all refinements\n * @return {AlgoliaSearchHelper} Method is chainable, it returns itself\n * @fires change\n * @chainable\n * @example\n * // Removing all the refinements\n * helper.clearRefinements().search();\n * @example\n * // Removing all the filters on a the category attribute.\n * helper.clearRefinements('category').search();\n * @example\n * // Removing only the exclude filters on the category facet.\n * helper.clearRefinements(function(value, attribute, type) {\n *   return type === 'exclude' && attribute === 'category';\n * }).search();\n */\nAlgoliaSearchHelper.prototype.clearRefinements = function (name) {\n  this._change({\n    state: this.state.resetPage().clearRefinements(name),\n    isPageReset: true,\n  });\n\n  return this;\n};\n\n/**\n * Remove all the tag filters.\n *\n * This method resets the current page to 0.\n * @return {AlgoliaSearchHelper} Method is chainable, it returns itself\n * @fires change\n * @chainable\n */\nAlgoliaSearchHelper.prototype.clearTags = function () {\n  this._change({\n    state: this.state.resetPage().clearTags(),\n    isPageReset: true,\n  });\n\n  return this;\n};\n\n/**\n * Adds a disjunctive filter to a faceted attribute with the `value` provided. If the\n * filter is already set, it doesn't change the filters.\n *\n * This method resets the current page to 0.\n * @param  {string} facet the facet to refine\n * @param  {string} value the associated value (will be converted to string)\n * @return {AlgoliaSearchHelper} Method is chainable, it returns itself\n * @fires change\n * @chainable\n */\nAlgoliaSearchHelper.prototype.addDisjunctiveFacetRefinement = function (\n  facet,\n  value\n) {\n  this._change({\n    state: this.state.resetPage().addDisjunctiveFacetRefinement(facet, value),\n    isPageReset: true,\n  });\n\n  return this;\n};\n\n// eslint-disable-next-line valid-jsdoc\n/**\n * @deprecated since version 2.4.0, see {@link AlgoliaSearchHelper#addDisjunctiveFacetRefinement}\n */\nAlgoliaSearchHelper.prototype.addDisjunctiveRefine = function () {\n  return this.addDisjunctiveFacetRefinement.apply(this, arguments);\n};\n\n/**\n * Adds a refinement on a hierarchical facet. It will throw\n * an exception if the facet is not defined or if the facet\n * is already refined.\n *\n * This method resets the current page to 0.\n * @param {string} facet the facet name\n * @param {string} path the hierarchical facet path\n * @return {AlgoliaSearchHelper} Method is chainable, it returns itself\n * @throws Error if the facet is not defined or if the facet is refined\n * @chainable\n * @fires change\n */\nAlgoliaSearchHelper.prototype.addHierarchicalFacetRefinement = function (\n  facet,\n  path\n) {\n  this._change({\n    state: this.state.resetPage().addHierarchicalFacetRefinement(facet, path),\n    isPageReset: true,\n  });\n\n  return this;\n};\n\n/**\n * Adds a an numeric filter to an attribute with the `operator` and `value` provided. If the\n * filter is already set, it doesn't change the filters.\n *\n * This method resets the current page to 0.\n * @param  {string} attribute the attribute on which the numeric filter applies\n * @param  {string} operator the operator of the filter\n * @param  {number} value the value of the filter\n * @return {AlgoliaSearchHelper} Method is chainable, it returns itself\n * @fires change\n * @chainable\n */\nAlgoliaSearchHelper.prototype.addNumericRefinement = function (\n  attribute,\n  operator,\n  value\n) {\n  this._change({\n    state: this.state\n      .resetPage()\n      .addNumericRefinement(attribute, operator, value),\n    isPageReset: true,\n  });\n\n  return this;\n};\n\n/**\n * Adds a filter to a faceted attribute with the `value` provided. If the\n * filter is already set, it doesn't change the filters.\n *\n * This method resets the current page to 0.\n * @param  {string} facet the facet to refine\n * @param  {string} value the associated value (will be converted to string)\n * @return {AlgoliaSearchHelper} Method is chainable, it returns itself\n * @fires change\n * @chainable\n */\nAlgoliaSearchHelper.prototype.addFacetRefinement = function (facet, value) {\n  this._change({\n    state: this.state.resetPage().addFacetRefinement(facet, value),\n    isPageReset: true,\n  });\n\n  return this;\n};\n\n// eslint-disable-next-line valid-jsdoc\n/**\n * @deprecated since version 2.4.0, see {@link AlgoliaSearchHelper#addFacetRefinement}\n */\nAlgoliaSearchHelper.prototype.addRefine = function () {\n  return this.addFacetRefinement.apply(this, arguments);\n};\n\n/**\n * Adds a an exclusion filter to a faceted attribute with the `value` provided. If the\n * filter is already set, it doesn't change the filters.\n *\n * This method resets the current page to 0.\n * @param  {string} facet the facet to refine\n * @param  {string} value the associated value (will be converted to string)\n * @return {AlgoliaSearchHelper} Method is chainable, it returns itself\n * @fires change\n * @chainable\n */\nAlgoliaSearchHelper.prototype.addFacetExclusion = function (facet, value) {\n  this._change({\n    state: this.state.resetPage().addExcludeRefinement(facet, value),\n    isPageReset: true,\n  });\n\n  return this;\n};\n\n// eslint-disable-next-line valid-jsdoc\n/**\n * @deprecated since version 2.4.0, see {@link AlgoliaSearchHelper#addFacetExclusion}\n */\nAlgoliaSearchHelper.prototype.addExclude = function () {\n  return this.addFacetExclusion.apply(this, arguments);\n};\n\n/**\n * Adds a tag filter with the `tag` provided. If the\n * filter is already set, it doesn't change the filters.\n *\n * This method resets the current page to 0.\n * @param {string} tag the tag to add to the filter\n * @return {AlgoliaSearchHelper} Method is chainable, it returns itself\n * @fires change\n * @chainable\n */\nAlgoliaSearchHelper.prototype.addTag = function (tag) {\n  this._change({\n    state: this.state.resetPage().addTagRefinement(tag),\n    isPageReset: true,\n  });\n\n  return this;\n};\n\n/**\n * Removes an numeric filter to an attribute with the `operator` and `value` provided. If the\n * filter is not set, it doesn't change the filters.\n *\n * Some parameters are optional, triggering different behavior:\n *  - if the value is not provided, then all the numeric value will be removed for the\n *  specified attribute/operator couple.\n *  - if the operator is not provided either, then all the numeric filter on this attribute\n *  will be removed.\n *\n * This method resets the current page to 0.\n * @param  {string} attribute the attribute on which the numeric filter applies\n * @param  {string} [operator] the operator of the filter\n * @param  {number} [value] the value of the filter\n * @return {AlgoliaSearchHelper} Method is chainable, it returns itself\n * @fires change\n * @chainable\n */\nAlgoliaSearchHelper.prototype.removeNumericRefinement = function (\n  attribute,\n  operator,\n  value\n) {\n  this._change({\n    state: this.state\n      .resetPage()\n      .removeNumericRefinement(attribute, operator, value),\n    isPageReset: true,\n  });\n\n  return this;\n};\n\n/**\n * Removes a disjunctive filter to a faceted attribute with the `value` provided. If the\n * filter is not set, it doesn't change the filters.\n *\n * If the value is omitted, then this method will remove all the filters for the\n * attribute.\n *\n * This method resets the current page to 0.\n * @param  {string} facet the facet to refine\n * @param  {string} [value] the associated value\n * @return {AlgoliaSearchHelper} Method is chainable, it returns itself\n * @fires change\n * @chainable\n */\nAlgoliaSearchHelper.prototype.removeDisjunctiveFacetRefinement = function (\n  facet,\n  value\n) {\n  this._change({\n    state: this.state\n      .resetPage()\n      .removeDisjunctiveFacetRefinement(facet, value),\n    isPageReset: true,\n  });\n\n  return this;\n};\n\n// eslint-disable-next-line valid-jsdoc\n/**\n * @deprecated since version 2.4.0, see {@link AlgoliaSearchHelper#removeDisjunctiveFacetRefinement}\n */\nAlgoliaSearchHelper.prototype.removeDisjunctiveRefine = function () {\n  return this.removeDisjunctiveFacetRefinement.apply(this, arguments);\n};\n\n/**\n * Removes the refinement set on a hierarchical facet.\n * @param {string} facet the facet name\n * @return {AlgoliaSearchHelper} Method is chainable, it returns itself\n * @throws Error if the facet is not defined or if the facet is not refined\n * @fires change\n * @chainable\n */\nAlgoliaSearchHelper.prototype.removeHierarchicalFacetRefinement = function (\n  facet\n) {\n  this._change({\n    state: this.state.resetPage().removeHierarchicalFacetRefinement(facet),\n    isPageReset: true,\n  });\n\n  return this;\n};\n\n/**\n * Removes a filter to a faceted attribute with the `value` provided. If the\n * filter is not set, it doesn't change the filters.\n *\n * If the value is omitted, then this method will remove all the filters for the\n * attribute.\n *\n * This method resets the current page to 0.\n * @param  {string} facet the facet to refine\n * @param  {string} [value] the associated value\n * @return {AlgoliaSearchHelper} Method is chainable, it returns itself\n * @fires change\n * @chainable\n */\nAlgoliaSearchHelper.prototype.removeFacetRefinement = function (facet, value) {\n  this._change({\n    state: this.state.resetPage().removeFacetRefinement(facet, value),\n    isPageReset: true,\n  });\n\n  return this;\n};\n\n// eslint-disable-next-line valid-jsdoc\n/**\n * @deprecated since version 2.4.0, see {@link AlgoliaSearchHelper#removeFacetRefinement}\n */\nAlgoliaSearchHelper.prototype.removeRefine = function () {\n  return this.removeFacetRefinement.apply(this, arguments);\n};\n\n/**\n * Removes an exclusion filter to a faceted attribute with the `value` provided. If the\n * filter is not set, it doesn't change the filters.\n *\n * If the value is omitted, then this method will remove all the filters for the\n * attribute.\n *\n * This method resets the current page to 0.\n * @param  {string} facet the facet to refine\n * @param  {string} [value] the associated value\n * @return {AlgoliaSearchHelper} Method is chainable, it returns itself\n * @fires change\n * @chainable\n */\nAlgoliaSearchHelper.prototype.removeFacetExclusion = function (facet, value) {\n  this._change({\n    state: this.state.resetPage().removeExcludeRefinement(facet, value),\n    isPageReset: true,\n  });\n\n  return this;\n};\n\n// eslint-disable-next-line valid-jsdoc\n/**\n * @deprecated since version 2.4.0, see {@link AlgoliaSearchHelper#removeFacetExclusion}\n */\nAlgoliaSearchHelper.prototype.removeExclude = function () {\n  return this.removeFacetExclusion.apply(this, arguments);\n};\n\n/**\n * Removes a tag filter with the `tag` provided. If the\n * filter is not set, it doesn't change the filters.\n *\n * This method resets the current page to 0.\n * @param {string} tag tag to remove from the filter\n * @return {AlgoliaSearchHelper} Method is chainable, it returns itself\n * @fires change\n * @chainable\n */\nAlgoliaSearchHelper.prototype.removeTag = function (tag) {\n  this._change({\n    state: this.state.resetPage().removeTagRefinement(tag),\n    isPageReset: true,\n  });\n\n  return this;\n};\n\n/**\n * Adds or removes an exclusion filter to a faceted attribute with the `value` provided. If\n * the value is set then it removes it, otherwise it adds the filter.\n *\n * This method resets the current page to 0.\n * @param  {string} facet the facet to refine\n * @param  {string} value the associated value\n * @return {AlgoliaSearchHelper} Method is chainable, it returns itself\n * @fires change\n * @chainable\n */\nAlgoliaSearchHelper.prototype.toggleFacetExclusion = function (facet, value) {\n  this._change({\n    state: this.state.resetPage().toggleExcludeFacetRefinement(facet, value),\n    isPageReset: true,\n  });\n\n  return this;\n};\n\n// eslint-disable-next-line valid-jsdoc\n/**\n * @deprecated since version 2.4.0, see {@link AlgoliaSearchHelper#toggleFacetExclusion}\n */\nAlgoliaSearchHelper.prototype.toggleExclude = function () {\n  return this.toggleFacetExclusion.apply(this, arguments);\n};\n\n/**\n * Adds or removes a filter to a faceted attribute with the `value` provided. If\n * the value is set then it removes it, otherwise it adds the filter.\n *\n * This method can be used for conjunctive, disjunctive and hierarchical filters.\n *\n * This method resets the current page to 0.\n * @param  {string} facet the facet to refine\n * @param  {string} value the associated value\n * @return {AlgoliaSearchHelper} Method is chainable, it returns itself\n * @throws Error will throw an error if the facet is not declared in the settings of the helper\n * @fires change\n * @chainable\n * @deprecated since version 2.19.0, see {@link AlgoliaSearchHelper#toggleFacetRefinement}\n */\nAlgoliaSearchHelper.prototype.toggleRefinement = function (facet, value) {\n  return this.toggleFacetRefinement(facet, value);\n};\n\n/**\n * Adds or removes a filter to a faceted attribute with the `value` provided. If\n * the value is set then it removes it, otherwise it adds the filter.\n *\n * This method can be used for conjunctive, disjunctive and hierarchical filters.\n *\n * This method resets the current page to 0.\n * @param  {string} facet the facet to refine\n * @param  {string} value the associated value\n * @return {AlgoliaSearchHelper} Method is chainable, it returns itself\n * @throws Error will throw an error if the facet is not declared in the settings of the helper\n * @fires change\n * @chainable\n */\nAlgoliaSearchHelper.prototype.toggleFacetRefinement = function (facet, value) {\n  this._change({\n    state: this.state.resetPage().toggleFacetRefinement(facet, value),\n    isPageReset: true,\n  });\n\n  return this;\n};\n\n// eslint-disable-next-line valid-jsdoc\n/**\n * @deprecated since version 2.4.0, see {@link AlgoliaSearchHelper#toggleFacetRefinement}\n */\nAlgoliaSearchHelper.prototype.toggleRefine = function () {\n  return this.toggleFacetRefinement.apply(this, arguments);\n};\n\n/**\n * Adds or removes a tag filter with the `value` provided. If\n * the value is set then it removes it, otherwise it adds the filter.\n *\n * This method resets the current page to 0.\n * @param {string} tag tag to remove or add\n * @return {AlgoliaSearchHelper} Method is chainable, it returns itself\n * @fires change\n * @chainable\n */\nAlgoliaSearchHelper.prototype.toggleTag = function (tag) {\n  this._change({\n    state: this.state.resetPage().toggleTagRefinement(tag),\n    isPageReset: true,\n  });\n\n  return this;\n};\n\n/**\n * Increments the page number by one.\n * @return {AlgoliaSearchHelper} Method is chainable, it returns itself\n * @fires change\n * @chainable\n * @example\n * helper.setPage(0).nextPage().getPage();\n * // returns 1\n */\nAlgoliaSearchHelper.prototype.nextPage = function () {\n  var page = this.state.page || 0;\n  return this.setPage(page + 1);\n};\n\n/**\n * Decrements the page number by one.\n * @fires change\n * @return {AlgoliaSearchHelper} Method is chainable, it returns itself\n * @chainable\n * @example\n * helper.setPage(1).previousPage().getPage();\n * // returns 0\n */\nAlgoliaSearchHelper.prototype.previousPage = function () {\n  var page = this.state.page || 0;\n  return this.setPage(page - 1);\n};\n\n/**\n * @private\n * @param {number} page The page number\n * @return {AlgoliaSearchHelper} Method is chainable, it returns itself\n * @chainable\n * @fires change\n */\nfunction setCurrentPage(page) {\n  if (page < 0) throw new Error('Page requested below 0.');\n\n  this._change({\n    state: this.state.setPage(page),\n    isPageReset: false,\n  });\n\n  return this;\n}\n\n/**\n * Change the current page\n * @deprecated\n * @param  {number} page The page number\n * @return {AlgoliaSearchHelper} Method is chainable, it returns itself\n * @fires change\n * @chainable\n */\nAlgoliaSearchHelper.prototype.setCurrentPage = setCurrentPage;\n\n/**\n * Updates the current page.\n * @function\n * @param  {number} page The page number\n * @return {AlgoliaSearchHelper} Method is chainable, it returns itself\n * @fires change\n * @chainable\n */\nAlgoliaSearchHelper.prototype.setPage = setCurrentPage;\n\n/**\n * Updates the name of the index that will be targeted by the query.\n *\n * This method resets the current page to 0.\n * @param {string} name the index name\n * @return {AlgoliaSearchHelper} Method is chainable, it returns itself\n * @fires change\n * @chainable\n */\nAlgoliaSearchHelper.prototype.setIndex = function (name) {\n  this._change({\n    state: this.state.resetPage().setIndex(name),\n    isPageReset: true,\n  });\n\n  return this;\n};\n\n/**\n * Update a parameter of the search. This method reset the page\n *\n * The complete list of parameters is available on the\n * [Algolia website](https://www.algolia.com/doc/rest#query-an-index).\n * The most commonly used parameters have their own [shortcuts](#query-parameters-shortcuts)\n * or benefit from higher-level APIs (all the kind of filters and facets have their own API)\n *\n * This method resets the current page to 0.\n * @param {string} parameter name of the parameter to update\n * @param {any} value new value of the parameter\n * @return {AlgoliaSearchHelper} Method is chainable, it returns itself\n * @fires change\n * @chainable\n * @example\n * helper.setQueryParameter('hitsPerPage', 20).search();\n */\nAlgoliaSearchHelper.prototype.setQueryParameter = function (parameter, value) {\n  this._change({\n    state: this.state.resetPage().setQueryParameter(parameter, value),\n    isPageReset: true,\n  });\n\n  return this;\n};\n\n/**\n * Set the whole state (warning: will erase previous state)\n * @param {SearchParameters} newState the whole new state\n * @return {AlgoliaSearchHelper} Method is chainable, it returns itself\n * @fires change\n * @chainable\n */\nAlgoliaSearchHelper.prototype.setState = function (newState) {\n  this._change({\n    state: SearchParameters.make(newState),\n    isPageReset: false,\n  });\n\n  return this;\n};\n\n/**\n * Override the current state without triggering a change event.\n * Do not use this method unless you know what you are doing. (see the example\n * for a legit use case)\n * @param {SearchParameters} newState the whole new state\n * @return {AlgoliaSearchHelper} Method is chainable, it returns itself\n * @example\n *  helper.on('change', function(state){\n *    // In this function you might want to find a way to store the state in the url/history\n *    updateYourURL(state)\n *  })\n *  window.onpopstate = function(event){\n *    // This is naive though as you should check if the state is really defined etc.\n *    helper.overrideStateWithoutTriggeringChangeEvent(event.state).search()\n *  }\n * @chainable\n */\nAlgoliaSearchHelper.prototype.overrideStateWithoutTriggeringChangeEvent =\n  function (newState) {\n    this.state = new SearchParameters(newState);\n    return this;\n  };\n\n/**\n * Check if an attribute has any numeric, conjunctive, disjunctive or hierarchical filters.\n * @param {string} attribute the name of the attribute\n * @return {boolean} true if the attribute is filtered by at least one value\n * @example\n * // hasRefinements works with numeric, conjunctive, disjunctive and hierarchical filters\n * helper.hasRefinements('price'); // false\n * helper.addNumericRefinement('price', '>', 100);\n * helper.hasRefinements('price'); // true\n *\n * helper.hasRefinements('color'); // false\n * helper.addFacetRefinement('color', 'blue');\n * helper.hasRefinements('color'); // true\n *\n * helper.hasRefinements('material'); // false\n * helper.addDisjunctiveFacetRefinement('material', 'plastic');\n * helper.hasRefinements('material'); // true\n *\n * helper.hasRefinements('categories'); // false\n * helper.toggleFacetRefinement('categories', 'kitchen > knife');\n * helper.hasRefinements('categories'); // true\n *\n */\nAlgoliaSearchHelper.prototype.hasRefinements = function (attribute) {\n  if (objectHasKeys(this.state.getNumericRefinements(attribute))) {\n    return true;\n  } else if (this.state.isConjunctiveFacet(attribute)) {\n    return this.state.isFacetRefined(attribute);\n  } else if (this.state.isDisjunctiveFacet(attribute)) {\n    return this.state.isDisjunctiveFacetRefined(attribute);\n  } else if (this.state.isHierarchicalFacet(attribute)) {\n    return this.state.isHierarchicalFacetRefined(attribute);\n  }\n\n  // there's currently no way to know that the user did call `addNumericRefinement` at some point\n  // thus we cannot distinguish if there once was a numeric refinement that was cleared\n  // so we will return false in every other situations to be consistent\n  // while what we should do here is throw because we did not find the attribute in any type\n  // of refinement\n  return false;\n};\n\n/**\n * Check if a value is excluded for a specific faceted attribute. If the value\n * is omitted then the function checks if there is any excluding refinements.\n *\n * @param  {string}  facet name of the attribute for used for faceting\n * @param  {string}  [value] optional value. If passed will test that this value\n * is filtering the given facet.\n * @return {boolean} true if refined\n * @example\n * helper.isExcludeRefined('color'); // false\n * helper.isExcludeRefined('color', 'blue') // false\n * helper.isExcludeRefined('color', 'red') // false\n *\n * helper.addFacetExclusion('color', 'red');\n *\n * helper.isExcludeRefined('color'); // true\n * helper.isExcludeRefined('color', 'blue') // false\n * helper.isExcludeRefined('color', 'red') // true\n */\nAlgoliaSearchHelper.prototype.isExcluded = function (facet, value) {\n  return this.state.isExcludeRefined(facet, value);\n};\n\n// eslint-disable-next-line valid-jsdoc\n/**\n * @deprecated since 2.4.0, see {@link AlgoliaSearchHelper#hasRefinements}\n */\nAlgoliaSearchHelper.prototype.isDisjunctiveRefined = function (facet, value) {\n  return this.state.isDisjunctiveFacetRefined(facet, value);\n};\n\n/**\n * Check if the string is a currently filtering tag.\n * @param {string} tag tag to check\n * @return {boolean} true if the tag is currently refined\n */\nAlgoliaSearchHelper.prototype.hasTag = function (tag) {\n  return this.state.isTagRefined(tag);\n};\n\n// eslint-disable-next-line valid-jsdoc\n/**\n * @deprecated since 2.4.0, see {@link AlgoliaSearchHelper#hasTag}\n */\nAlgoliaSearchHelper.prototype.isTagRefined = function () {\n  return this.hasTagRefinements.apply(this, arguments);\n};\n\n/**\n * Get the name of the currently used index.\n * @return {string} name of the index\n * @example\n * helper.setIndex('highestPrice_products').getIndex();\n * // returns 'highestPrice_products'\n */\nAlgoliaSearchHelper.prototype.getIndex = function () {\n  return this.state.index;\n};\n\nfunction getCurrentPage() {\n  return this.state.page;\n}\n\n/**\n * Get the currently selected page\n * @deprecated\n * @return {number} the current page\n */\nAlgoliaSearchHelper.prototype.getCurrentPage = getCurrentPage;\n/**\n * Get the currently selected page\n * @function\n * @return {number} the current page\n */\nAlgoliaSearchHelper.prototype.getPage = getCurrentPage;\n\n/**\n * Get all the tags currently set to filters the results.\n *\n * @return {string[]} The list of tags currently set.\n */\nAlgoliaSearchHelper.prototype.getTags = function () {\n  return this.state.tagRefinements;\n};\n\n/**\n * Get the list of refinements for a given attribute. This method works with\n * conjunctive, disjunctive, excluding and numerical filters.\n *\n * See also SearchResults#getRefinements\n *\n * @param {string} facetName attribute name used for faceting\n * @return {Array.<FacetRefinement|NumericRefinement>} All Refinement are objects that contain a value, and\n * a type. Numeric also contains an operator.\n * @example\n * helper.addNumericRefinement('price', '>', 100);\n * helper.getRefinements('price');\n * // [\n * //   {\n * //     \"value\": [\n * //       100\n * //     ],\n * //     \"operator\": \">\",\n * //     \"type\": \"numeric\"\n * //   }\n * // ]\n * @example\n * helper.addFacetRefinement('color', 'blue');\n * helper.addFacetExclusion('color', 'red');\n * helper.getRefinements('color');\n * // [\n * //   {\n * //     \"value\": \"blue\",\n * //     \"type\": \"conjunctive\"\n * //   },\n * //   {\n * //     \"value\": \"red\",\n * //     \"type\": \"exclude\"\n * //   }\n * // ]\n * @example\n * helper.addDisjunctiveFacetRefinement('material', 'plastic');\n * // [\n * //   {\n * //     \"value\": \"plastic\",\n * //     \"type\": \"disjunctive\"\n * //   }\n * // ]\n */\nAlgoliaSearchHelper.prototype.getRefinements = function (facetName) {\n  var refinements = [];\n\n  if (this.state.isConjunctiveFacet(facetName)) {\n    var conjRefinements = this.state.getConjunctiveRefinements(facetName);\n\n    conjRefinements.forEach(function (r) {\n      refinements.push({\n        value: r,\n        type: 'conjunctive',\n      });\n    });\n\n    var excludeRefinements = this.state.getExcludeRefinements(facetName);\n\n    excludeRefinements.forEach(function (r) {\n      refinements.push({\n        value: r,\n        type: 'exclude',\n      });\n    });\n  } else if (this.state.isDisjunctiveFacet(facetName)) {\n    var disjunctiveRefinements =\n      this.state.getDisjunctiveRefinements(facetName);\n\n    disjunctiveRefinements.forEach(function (r) {\n      refinements.push({\n        value: r,\n        type: 'disjunctive',\n      });\n    });\n  }\n\n  var numericRefinements = this.state.getNumericRefinements(facetName);\n\n  Object.keys(numericRefinements).forEach(function (operator) {\n    var value = numericRefinements[operator];\n\n    refinements.push({\n      value: value,\n      operator: operator,\n      type: 'numeric',\n    });\n  });\n\n  return refinements;\n};\n\n/**\n * Return the current refinement for the (attribute, operator)\n * @param {string} attribute attribute in the record\n * @param {string} operator operator applied on the refined values\n * @return {Array.<number|number[]>} refined values\n */\nAlgoliaSearchHelper.prototype.getNumericRefinement = function (\n  attribute,\n  operator\n) {\n  return this.state.getNumericRefinement(attribute, operator);\n};\n\n/**\n * Get the current breadcrumb for a hierarchical facet, as an array\n * @param  {string} facetName Hierarchical facet name\n * @return {array.<string>} the path as an array of string\n */\nAlgoliaSearchHelper.prototype.getHierarchicalFacetBreadcrumb = function (\n  facetName\n) {\n  return this.state.getHierarchicalFacetBreadcrumb(facetName);\n};\n\n// /////////// PRIVATE\n\n/**\n * Perform the underlying queries\n * @private\n * @param {object} options options for the query\n * @param {boolean} [options.onlyWithDerivedHelpers=false] if true, only the derived helpers will be queried\n * @return {undefined} does not return anything\n * @fires search\n * @fires result\n * @fires error\n */\nAlgoliaSearchHelper.prototype._search = function (options) {\n  var state = this.state;\n  var states = [];\n  var mainQueries = [];\n\n  if (!options.onlyWithDerivedHelpers) {\n    mainQueries = requestBuilder._getQueries(state.index, state);\n\n    states.push({\n      state: state,\n      queriesCount: mainQueries.length,\n      helper: this,\n    });\n\n    this.emit('search', {\n      state: state,\n      results: this.lastResults,\n    });\n  }\n\n  var derivedQueries = this.derivedHelpers.map(function (derivedHelper) {\n    var derivedState = derivedHelper.getModifiedState(state);\n    var derivedStateQueries = derivedState.index\n      ? requestBuilder._getQueries(derivedState.index, derivedState)\n      : [];\n\n    states.push({\n      state: derivedState,\n      queriesCount: derivedStateQueries.length,\n      helper: derivedHelper,\n    });\n\n    derivedHelper.emit('search', {\n      state: derivedState,\n      results: derivedHelper.lastResults,\n    });\n\n    return derivedStateQueries;\n  });\n\n  var queries = Array.prototype.concat.apply(mainQueries, derivedQueries);\n\n  var queryId = this._queryId++;\n  this._currentNbQueries++;\n\n  if (!queries.length) {\n    return Promise.resolve({ results: [] }).then(\n      this._dispatchAlgoliaResponse.bind(this, states, queryId)\n    );\n  }\n\n  try {\n    this.client\n      .search(queries)\n      .then(this._dispatchAlgoliaResponse.bind(this, states, queryId))\n      .catch(this._dispatchAlgoliaError.bind(this, queryId));\n  } catch (error) {\n    // If we reach this part, we're in an internal error state\n    this.emit('error', {\n      error: error,\n    });\n  }\n\n  return undefined;\n};\n\n/**\n * Transform the responses as sent by the server and transform them into a user\n * usable object that merge the results of all the batch requests. It will dispatch\n * over the different helper + derived helpers (when there are some).\n * @private\n * @param {array.<{SearchParameters, AlgoliaQueries, AlgoliaSearchHelper}>} states state used to generate the request\n * @param {number} queryId id of the current request\n * @param {object} content content of the response\n * @return {undefined}\n */\nAlgoliaSearchHelper.prototype._dispatchAlgoliaResponse = function (\n  states,\n  queryId,\n  content\n) {\n  // @TODO remove the number of outdated queries discarded instead of just one\n\n  if (queryId < this._lastQueryIdReceived) {\n    // Outdated answer\n    return;\n  }\n\n  this._currentNbQueries -= queryId - this._lastQueryIdReceived;\n  this._lastQueryIdReceived = queryId;\n\n  if (this._currentNbQueries === 0) this.emit('searchQueueEmpty');\n\n  var results = content.results.slice();\n\n  states.forEach(function (s) {\n    var state = s.state;\n    var queriesCount = s.queriesCount;\n    var helper = s.helper;\n    var specificResults = results.splice(0, queriesCount);\n\n    if (!state.index) {\n      helper.emit('result', {\n        results: null,\n        state: state,\n      });\n      return;\n    }\n\n    helper.lastResults = new SearchResults(state, specificResults);\n\n    helper.emit('result', {\n      results: helper.lastResults,\n      state: state,\n    });\n  });\n};\n\nAlgoliaSearchHelper.prototype._dispatchAlgoliaError = function (\n  queryId,\n  error\n) {\n  if (queryId < this._lastQueryIdReceived) {\n    // Outdated answer\n    return;\n  }\n\n  this._currentNbQueries -= queryId - this._lastQueryIdReceived;\n  this._lastQueryIdReceived = queryId;\n\n  this.emit('error', {\n    error: error,\n  });\n\n  if (this._currentNbQueries === 0) this.emit('searchQueueEmpty');\n};\n\nAlgoliaSearchHelper.prototype.containsRefinement = function (\n  query,\n  facetFilters,\n  numericFilters,\n  tagFilters\n) {\n  return (\n    query ||\n    facetFilters.length !== 0 ||\n    numericFilters.length !== 0 ||\n    tagFilters.length !== 0\n  );\n};\n\n/**\n * Test if there are some disjunctive refinements on the facet\n * @private\n * @param {string} facet the attribute to test\n * @return {boolean} true if there are refinements on this attribute\n */\nAlgoliaSearchHelper.prototype._hasDisjunctiveRefinements = function (facet) {\n  return (\n    this.state.disjunctiveRefinements[facet] &&\n    this.state.disjunctiveRefinements[facet].length > 0\n  );\n};\n\nAlgoliaSearchHelper.prototype._change = function (event) {\n  var state = event.state;\n  var isPageReset = event.isPageReset;\n\n  if (state !== this.state) {\n    this.state = state;\n\n    this.emit('change', {\n      state: this.state,\n      results: this.lastResults,\n      isPageReset: isPageReset,\n    });\n  }\n};\n\n/**\n * Clears the cache of the underlying Algolia client.\n * @return {AlgoliaSearchHelper} Method is chainable, it returns itself\n */\nAlgoliaSearchHelper.prototype.clearCache = function () {\n  if (this.client.clearCache) this.client.clearCache();\n  return this;\n};\n\n/**\n * Updates the internal client instance. If the reference of the clients\n * are equal then no update is actually done.\n * @param  {AlgoliaSearch} newClient an AlgoliaSearch client\n * @return {AlgoliaSearchHelper} Method is chainable, it returns itself\n */\nAlgoliaSearchHelper.prototype.setClient = function (newClient) {\n  if (this.client === newClient) return this;\n\n  if (typeof newClient.addAlgoliaAgent === 'function') {\n    newClient.addAlgoliaAgent('JS Helper (' + version + ')');\n  }\n  this.client = newClient;\n\n  return this;\n};\n\n/**\n * Gets the instance of the currently used client.\n * @return {AlgoliaSearch} the currently used client\n */\nAlgoliaSearchHelper.prototype.getClient = function () {\n  return this.client;\n};\n\n/**\n * Creates an derived instance of the Helper. A derived helper\n * is a way to request other indices synchronised with the lifecycle\n * of the main Helper. This mechanism uses the multiqueries feature\n * of Algolia to aggregate all the requests in a single network call.\n *\n * This method takes a function that is used to create a new SearchParameter\n * that will be used to create requests to Algolia. Those new requests\n * are created just before the `search` event. The signature of the function\n * is `SearchParameters -> SearchParameters`.\n *\n * This method returns a new DerivedHelper which is an EventEmitter\n * that fires the same `search`, `result` and `error` events. Those\n * events, however, will receive data specific to this DerivedHelper\n * and the SearchParameters that is returned by the call of the\n * parameter function.\n * @param {function} fn SearchParameters -> SearchParameters\n * @return {DerivedHelper} a new DerivedHelper\n */\nAlgoliaSearchHelper.prototype.derive = function (fn) {\n  var derivedHelper = new DerivedHelper(this, fn);\n  this.derivedHelpers.push(derivedHelper);\n  return derivedHelper;\n};\n\n/**\n * This method detaches a derived Helper from the main one. Prefer using the one from the\n * derived helper itself, to remove the event listeners too.\n * @private\n * @param  {DerivedHelper} derivedHelper the derived helper to detach\n * @return {undefined} nothing is returned\n * @throws Error\n */\nAlgoliaSearchHelper.prototype.detachDerivedHelper = function (derivedHelper) {\n  var pos = this.derivedHelpers.indexOf(derivedHelper);\n  if (pos === -1) throw new Error('Derived helper already detached');\n  this.derivedHelpers.splice(pos, 1);\n};\n\n/**\n * This method returns true if there is currently at least one on-going search.\n * @return {boolean} true if there is a search pending\n */\nAlgoliaSearchHelper.prototype.hasPendingRequests = function () {\n  return this._currentNbQueries > 0;\n};\n\n/**\n * @typedef AlgoliaSearchHelper.NumericRefinement\n * @type {object}\n * @property {number[]} value the numbers that are used for filtering this attribute with\n * the operator specified.\n * @property {string} operator the faceting data: value, number of entries\n * @property {string} type will be 'numeric'\n */\n\n/**\n * @typedef AlgoliaSearchHelper.FacetRefinement\n * @type {object}\n * @property {string} value the string use to filter the attribute\n * @property {string} type the type of filter: 'conjunctive', 'disjunctive', 'exclude'\n */\n\nmodule.exports = AlgoliaSearchHelper;\n","'use strict';\n\nmodule.exports = function compact(array) {\n  if (!Array.isArray(array)) {\n    return [];\n  }\n\n  return array.filter(Boolean);\n};\n","'use strict';\n\n// NOTE: this behaves like lodash/defaults, but doesn't mutate the target\n// it also preserve keys order\nmodule.exports = function defaultsPure() {\n  var sources = Array.prototype.slice.call(arguments);\n\n  return sources.reduceRight(function (acc, source) {\n    Object.keys(Object(source)).forEach(function (key) {\n      if (source[key] === undefined) {\n        return;\n      }\n      if (acc[key] !== undefined) {\n        // remove if already added, so that we can add it in correct order\n        delete acc[key];\n      }\n      acc[key] = source[key];\n    });\n    return acc;\n  }, {});\n};\n","'use strict';\n\n/**\n * Replaces a leading - with \\-\n * @private\n * @param {any} value the facet value to replace\n * @returns {any} the escaped facet value or the value if it was not a string\n */\nfunction escapeFacetValue(value) {\n  if (typeof value !== 'string') return value;\n\n  return String(value).replace(/^-/, '\\\\-');\n}\n\n/**\n * Replaces a leading \\- with -\n * @private\n * @param {any} value the escaped facet value\n * @returns {any} the unescaped facet value or the value if it was not a string\n */\nfunction unescapeFacetValue(value) {\n  if (typeof value !== 'string') return value;\n\n  return value.replace(/^\\\\-/, '-');\n}\n\nmodule.exports = {\n  escapeFacetValue: escapeFacetValue,\n  unescapeFacetValue: unescapeFacetValue,\n};\n","'use strict';\n\n// @MAJOR can be replaced by native Array#find when we change support\nmodule.exports = function find(array, comparator) {\n  if (!Array.isArray(array)) {\n    return undefined;\n  }\n\n  for (var i = 0; i < array.length; i++) {\n    if (comparator(array[i])) {\n      return array[i];\n    }\n  }\n\n  return undefined;\n};\n","'use strict';\n\n// @MAJOR can be replaced by native Array#findIndex when we change support\nmodule.exports = function find(array, comparator) {\n  if (!Array.isArray(array)) {\n    return -1;\n  }\n\n  for (var i = 0; i < array.length; i++) {\n    if (comparator(array[i])) {\n      return i;\n    }\n  }\n  return -1;\n};\n","'use strict';\n\nvar find = require('./find');\n\n/**\n * Transform sort format from user friendly notation to lodash format\n * @param {string[]} sortBy array of predicate of the form \"attribute:order\"\n * @param {string[]} [defaults] array of predicate of the form \"attribute:order\"\n * @return {array.<string[]>} array containing 2 elements : attributes, orders\n */\nmodule.exports = function formatSort(sortBy, defaults) {\n  var defaultInstructions = (defaults || []).map(function (sort) {\n    return sort.split(':');\n  });\n\n  return sortBy.reduce(\n    function preparePredicate(out, sort) {\n      var sortInstruction = sort.split(':');\n\n      var matchingDefault = find(\n        defaultInstructions,\n        function (defaultInstruction) {\n          return defaultInstruction[0] === sortInstruction[0];\n        }\n      );\n\n      if (sortInstruction.length > 1 || !matchingDefault) {\n        out[0].push(sortInstruction[0]);\n        out[1].push(sortInstruction[1]);\n        return out;\n      }\n\n      out[0].push(matchingDefault[0]);\n      out[1].push(matchingDefault[1]);\n      return out;\n    },\n    [[], []]\n  );\n};\n","'use strict';\n\nfunction inherits(ctor, superCtor) {\n  ctor.prototype = Object.create(superCtor.prototype, {\n    constructor: {\n      value: ctor,\n      enumerable: false,\n      writable: true,\n      configurable: true,\n    },\n  });\n}\n\nmodule.exports = inherits;\n","'use strict';\n\nfunction intersection(arr1, arr2) {\n  return arr1.filter(function (value, index) {\n    return (\n      arr2.indexOf(value) > -1 &&\n      arr1.indexOf(value) === index /* skips duplicates */\n    );\n  });\n}\n\nmodule.exports = intersection;\n","'use strict';\n\nfunction clone(value) {\n  if (typeof value === 'object' && value !== null) {\n    return _merge(Array.isArray(value) ? [] : {}, value);\n  }\n  return value;\n}\n\nfunction isObjectOrArrayOrFunction(value) {\n  return (\n    typeof value === 'function' ||\n    Array.isArray(value) ||\n    Object.prototype.toString.call(value) === '[object Object]'\n  );\n}\n\nfunction _merge(target, source) {\n  if (target === source) {\n    return target;\n  }\n\n  // eslint-disable-next-line no-restricted-syntax\n  for (var key in source) {\n    if (\n      !Object.prototype.hasOwnProperty.call(source, key) ||\n      key === '__proto__' ||\n      key === 'constructor'\n    ) {\n      // eslint-disable-next-line no-continue\n      continue;\n    }\n\n    var sourceVal = source[key];\n    var targetVal = target[key];\n\n    if (typeof targetVal !== 'undefined' && typeof sourceVal === 'undefined') {\n      // eslint-disable-next-line no-continue\n      continue;\n    }\n\n    if (\n      isObjectOrArrayOrFunction(targetVal) &&\n      isObjectOrArrayOrFunction(sourceVal)\n    ) {\n      target[key] = _merge(targetVal, sourceVal);\n    } else {\n      target[key] = clone(sourceVal);\n    }\n  }\n  return target;\n}\n\n/**\n * This method is like Object.assign, but recursively merges own and inherited\n * enumerable keyed properties of source objects into the destination object.\n *\n * NOTE: this behaves like lodash/merge, but:\n * - does mutate functions if they are a source\n * - treats non-plain objects as plain\n * - does not work for circular objects\n * - treats sparse arrays as sparse\n * - does not convert Array-like objects (Arguments, NodeLists, etc.) to arrays\n *\n * @param {Object} target The destination object.\n * @param {...Object} [sources] The source objects.\n * @returns {Object} Returns `object`.\n */\nfunction merge(target) {\n  if (!isObjectOrArrayOrFunction(target)) {\n    target = {};\n  }\n\n  for (var i = 1, l = arguments.length; i < l; i++) {\n    var source = arguments[i];\n\n    if (isObjectOrArrayOrFunction(source)) {\n      _merge(target, source);\n    }\n  }\n  return target;\n}\n\nmodule.exports = merge;\n","'use strict';\n\nfunction objectHasKeys(obj) {\n  return obj && Object.keys(obj).length > 0;\n}\n\nmodule.exports = objectHasKeys;\n","'use strict';\n\n// https://github.com/babel/babel/blob/3aaafae053fa75febb3aa45d45b6f00646e30ba4/packages/babel-helpers/src/helpers.js#L604-L620\nfunction _objectWithoutPropertiesLoose(source, excluded) {\n  if (source === null) return {};\n  var target = {};\n  var sourceKeys = Object.keys(source);\n  var key;\n  var i;\n  for (i = 0; i < sourceKeys.length; i++) {\n    key = sourceKeys[i];\n    // eslint-disable-next-line no-continue\n    if (excluded.indexOf(key) >= 0) continue;\n    target[key] = source[key];\n  }\n  return target;\n}\n\nmodule.exports = _objectWithoutPropertiesLoose;\n","'use strict';\n\nfunction compareAscending(value, other) {\n  if (value !== other) {\n    var valIsDefined = value !== undefined;\n    var valIsNull = value === null;\n\n    var othIsDefined = other !== undefined;\n    var othIsNull = other === null;\n\n    if (\n      (!othIsNull && value > other) ||\n      (valIsNull && othIsDefined) ||\n      !valIsDefined\n    ) {\n      return 1;\n    }\n    if (\n      (!valIsNull && value < other) ||\n      (othIsNull && valIsDefined) ||\n      !othIsDefined\n    ) {\n      return -1;\n    }\n  }\n  return 0;\n}\n\n/**\n * @param {Array<object>} collection object with keys in attributes\n * @param {Array<string>} iteratees attributes\n * @param {Array<string>} orders asc | desc\n * @return {Array<object>} sorted collection\n */\nfunction orderBy(collection, iteratees, orders) {\n  if (!Array.isArray(collection)) {\n    return [];\n  }\n\n  if (!Array.isArray(orders)) {\n    orders = [];\n  }\n\n  var result = collection.map(function (value, index) {\n    return {\n      criteria: iteratees.map(function (iteratee) {\n        return value[iteratee];\n      }),\n      index: index,\n      value: value,\n    };\n  });\n\n  result.sort(function comparer(object, other) {\n    var index = -1;\n\n    while (++index < object.criteria.length) {\n      var res = compareAscending(object.criteria[index], other.criteria[index]);\n      if (res) {\n        if (index >= orders.length) {\n          return res;\n        }\n        if (orders[index] === 'desc') {\n          return -res;\n        }\n        return res;\n      }\n    }\n\n    // This ensures a stable sort in V8 and other engines.\n    // See https://bugs.chromium.org/p/v8/issues/detail?id=90 for more details.\n    return object.index - other.index;\n  });\n\n  return result.map(function (res) {\n    return res.value;\n  });\n}\n\nmodule.exports = orderBy;\n","'use strict';\n\nfunction valToNumber(v) {\n  if (typeof v === 'number') {\n    return v;\n  } else if (typeof v === 'string') {\n    return parseFloat(v);\n  } else if (Array.isArray(v)) {\n    return v.map(valToNumber);\n  }\n\n  throw new Error(\n    'The value should be a number, a parsable string or an array of those.'\n  );\n}\n\nmodule.exports = valToNumber;\n","'use strict';\n\nvar merge = require('./functions/merge');\n\nfunction sortObject(obj) {\n  return Object.keys(obj)\n    .sort()\n    .reduce(function (acc, curr) {\n      acc[curr] = obj[curr];\n      return acc;\n    }, {});\n}\n\nvar requestBuilder = {\n  /**\n   * Get all the queries to send to the client, those queries can used directly\n   * with the Algolia client.\n   * @private\n   * @param  {string} index The name of the index\n   * @param  {SearchParameters} state The state from which to get the queries\n   * @return {object[]} The queries\n   */\n  _getQueries: function getQueries(index, state) {\n    var queries = [];\n\n    // One query for the hits\n    queries.push({\n      indexName: index,\n      params: requestBuilder._getHitsSearchParams(state),\n    });\n\n    // One for each disjunctive facets\n    state.getRefinedDisjunctiveFacets().forEach(function (refinedFacet) {\n      queries.push({\n        indexName: index,\n        params: requestBuilder._getDisjunctiveFacetSearchParams(\n          state,\n          refinedFacet\n        ),\n      });\n    });\n\n    // More to get the parent levels of the hierarchical facets when refined\n    state.getRefinedHierarchicalFacets().forEach(function (refinedFacet) {\n      var hierarchicalFacet = state.getHierarchicalFacetByName(refinedFacet);\n      var currentRefinement = state.getHierarchicalRefinement(refinedFacet);\n      var separator = state._getHierarchicalFacetSeparator(hierarchicalFacet);\n\n      // If we are deeper than level 0 (starting from `beer > IPA`)\n      // we want to get all parent values\n      if (\n        currentRefinement.length > 0 &&\n        currentRefinement[0].split(separator).length > 1\n      ) {\n        // We generate a map of the filters we will use for our facet values queries\n        var filtersMap = currentRefinement[0]\n          .split(separator)\n          .slice(0, -1)\n          .reduce(function createFiltersMap(map, segment, level) {\n            return map.concat({\n              attribute: hierarchicalFacet.attributes[level],\n              value:\n                level === 0\n                  ? segment\n                  : [map[map.length - 1].value, segment].join(separator),\n            });\n          }, []);\n\n        filtersMap.forEach(function (filter, level) {\n          var params = requestBuilder._getDisjunctiveFacetSearchParams(\n            state,\n            filter.attribute,\n            level === 0\n          );\n\n          // Keep facet filters unrelated to current hierarchical attributes\n          function hasHierarchicalFacetFilter(value) {\n            return hierarchicalFacet.attributes.some(function (attribute) {\n              return attribute === value.split(':')[0];\n            });\n          }\n\n          var filteredFacetFilters = (params.facetFilters || []).reduce(\n            function (acc, facetFilter) {\n              if (Array.isArray(facetFilter)) {\n                var filtered = facetFilter.filter(function (filterValue) {\n                  return !hasHierarchicalFacetFilter(filterValue);\n                });\n\n                if (filtered.length > 0) {\n                  acc.push(filtered);\n                }\n              }\n\n              if (\n                typeof facetFilter === 'string' &&\n                !hasHierarchicalFacetFilter(facetFilter)\n              ) {\n                acc.push(facetFilter);\n              }\n\n              return acc;\n            },\n            []\n          );\n\n          var parent = filtersMap[level - 1];\n          if (level > 0) {\n            params.facetFilters = filteredFacetFilters.concat(\n              parent.attribute + ':' + parent.value\n            );\n          } else {\n            params.facetFilters =\n              filteredFacetFilters.length > 0\n                ? filteredFacetFilters\n                : undefined;\n          }\n\n          queries.push({ indexName: index, params: params });\n        });\n      }\n    });\n\n    return queries;\n  },\n\n  /**\n   * Build search parameters used to fetch hits\n   * @private\n   * @param  {SearchParameters} state The state from which to get the queries\n   * @return {object.<string, any>} The search parameters for hits\n   */\n  _getHitsSearchParams: function (state) {\n    var facets = state.facets\n      .concat(state.disjunctiveFacets)\n      .concat(requestBuilder._getHitsHierarchicalFacetsAttributes(state))\n      .sort();\n\n    var facetFilters = requestBuilder._getFacetFilters(state);\n    var numericFilters = requestBuilder._getNumericFilters(state);\n    var tagFilters = requestBuilder._getTagFilters(state);\n    var additionalParams = {\n      facets: facets.indexOf('*') > -1 ? ['*'] : facets,\n      tagFilters: tagFilters,\n    };\n\n    if (facetFilters.length > 0) {\n      additionalParams.facetFilters = facetFilters;\n    }\n\n    if (numericFilters.length > 0) {\n      additionalParams.numericFilters = numericFilters;\n    }\n\n    return sortObject(merge({}, state.getQueryParams(), additionalParams));\n  },\n\n  /**\n   * Build search parameters used to fetch a disjunctive facet\n   * @private\n   * @param  {SearchParameters} state The state from which to get the queries\n   * @param  {string} facet the associated facet name\n   * @param  {boolean} hierarchicalRootLevel ?? FIXME\n   * @return {object} The search parameters for a disjunctive facet\n   */\n  _getDisjunctiveFacetSearchParams: function (\n    state,\n    facet,\n    hierarchicalRootLevel\n  ) {\n    var facetFilters = requestBuilder._getFacetFilters(\n      state,\n      facet,\n      hierarchicalRootLevel\n    );\n    var numericFilters = requestBuilder._getNumericFilters(state, facet);\n    var tagFilters = requestBuilder._getTagFilters(state);\n    var additionalParams = {\n      hitsPerPage: 0,\n      page: 0,\n      analytics: false,\n      clickAnalytics: false,\n    };\n\n    if (tagFilters.length > 0) {\n      additionalParams.tagFilters = tagFilters;\n    }\n\n    var hierarchicalFacet = state.getHierarchicalFacetByName(facet);\n\n    if (hierarchicalFacet) {\n      additionalParams.facets =\n        requestBuilder._getDisjunctiveHierarchicalFacetAttribute(\n          state,\n          hierarchicalFacet,\n          hierarchicalRootLevel\n        );\n    } else {\n      additionalParams.facets = facet;\n    }\n\n    if (numericFilters.length > 0) {\n      additionalParams.numericFilters = numericFilters;\n    }\n\n    if (facetFilters.length > 0) {\n      additionalParams.facetFilters = facetFilters;\n    }\n\n    return sortObject(merge({}, state.getQueryParams(), additionalParams));\n  },\n\n  /**\n   * Return the numeric filters in an algolia request fashion\n   * @private\n   * @param {SearchParameters} state the state from which to get the filters\n   * @param {string} [facetName] the name of the attribute for which the filters should be excluded\n   * @return {string[]} the numeric filters in the algolia format\n   */\n  _getNumericFilters: function (state, facetName) {\n    if (state.numericFilters) {\n      return state.numericFilters;\n    }\n\n    var numericFilters = [];\n\n    Object.keys(state.numericRefinements).forEach(function (attribute) {\n      var operators = state.numericRefinements[attribute] || {};\n      Object.keys(operators).forEach(function (operator) {\n        var values = operators[operator] || [];\n        if (facetName !== attribute) {\n          values.forEach(function (value) {\n            if (Array.isArray(value)) {\n              var vs = value.map(function (v) {\n                return attribute + operator + v;\n              });\n              numericFilters.push(vs);\n            } else {\n              numericFilters.push(attribute + operator + value);\n            }\n          });\n        }\n      });\n    });\n\n    return numericFilters;\n  },\n\n  /**\n   * Return the tags filters depending on which format is used, either tagFilters or tagRefinements\n   * @private\n   * @param {SearchParameters} state the state from which to get the filters\n   * @return {string} Tag filters in a single string\n   */\n  _getTagFilters: function (state) {\n    if (state.tagFilters) {\n      return state.tagFilters;\n    }\n\n    return state.tagRefinements.join(',');\n  },\n\n  /**\n   * Build facetFilters parameter based on current refinements. The array returned\n   * contains strings representing the facet filters in the algolia format.\n   * @private\n   * @param  {SearchParameters} state The state from which to get the queries\n   * @param  {string} [facet] if set, the current disjunctive facet\n   * @param  {boolean} [hierarchicalRootLevel] ?? FIXME\n   * @return {array.<string>} The facet filters in the algolia format\n   */\n  _getFacetFilters: function (state, facet, hierarchicalRootLevel) {\n    var facetFilters = [];\n\n    var facetsRefinements = state.facetsRefinements || {};\n    Object.keys(facetsRefinements)\n      .sort()\n      .forEach(function (facetName) {\n        var facetValues = facetsRefinements[facetName] || [];\n        facetValues.sort().forEach(function (facetValue) {\n          facetFilters.push(facetName + ':' + facetValue);\n        });\n      });\n\n    var facetsExcludes = state.facetsExcludes || {};\n    Object.keys(facetsExcludes)\n      .sort()\n      .forEach(function (facetName) {\n        var facetValues = facetsExcludes[facetName] || [];\n        facetValues.sort().forEach(function (facetValue) {\n          facetFilters.push(facetName + ':-' + facetValue);\n        });\n      });\n\n    var disjunctiveFacetsRefinements = state.disjunctiveFacetsRefinements || {};\n    Object.keys(disjunctiveFacetsRefinements)\n      .sort()\n      .forEach(function (facetName) {\n        var facetValues = disjunctiveFacetsRefinements[facetName] || [];\n        if (facetName === facet || !facetValues || facetValues.length === 0) {\n          return;\n        }\n        var orFilters = [];\n\n        facetValues.sort().forEach(function (facetValue) {\n          orFilters.push(facetName + ':' + facetValue);\n        });\n\n        facetFilters.push(orFilters);\n      });\n\n    var hierarchicalFacetsRefinements =\n      state.hierarchicalFacetsRefinements || {};\n    Object.keys(hierarchicalFacetsRefinements)\n      .sort()\n      .forEach(function (facetName) {\n        var facetValues = hierarchicalFacetsRefinements[facetName] || [];\n        var facetValue = facetValues[0];\n\n        if (facetValue === undefined) {\n          return;\n        }\n\n        var hierarchicalFacet = state.getHierarchicalFacetByName(facetName);\n        var separator = state._getHierarchicalFacetSeparator(hierarchicalFacet);\n        var rootPath = state._getHierarchicalRootPath(hierarchicalFacet);\n        var attributeToRefine;\n        var attributesIndex;\n\n        // we ask for parent facet values only when the `facet` is the current hierarchical facet\n        if (facet === facetName) {\n          // if we are at the root level already, no need to ask for facet values, we get them from\n          // the hits query\n          if (\n            facetValue.indexOf(separator) === -1 ||\n            (!rootPath && hierarchicalRootLevel === true) ||\n            (rootPath &&\n              rootPath.split(separator).length ===\n                facetValue.split(separator).length)\n          ) {\n            return;\n          }\n\n          if (!rootPath) {\n            attributesIndex = facetValue.split(separator).length - 2;\n            facetValue = facetValue.slice(0, facetValue.lastIndexOf(separator));\n          } else {\n            attributesIndex = rootPath.split(separator).length - 1;\n            facetValue = rootPath;\n          }\n\n          attributeToRefine = hierarchicalFacet.attributes[attributesIndex];\n        } else {\n          attributesIndex = facetValue.split(separator).length - 1;\n\n          attributeToRefine = hierarchicalFacet.attributes[attributesIndex];\n        }\n\n        if (attributeToRefine) {\n          facetFilters.push([attributeToRefine + ':' + facetValue]);\n        }\n      });\n\n    return facetFilters;\n  },\n\n  _getHitsHierarchicalFacetsAttributes: function (state) {\n    var out = [];\n\n    return state.hierarchicalFacets.reduce(\n      // ask for as much levels as there's hierarchical refinements\n      function getHitsAttributesForHierarchicalFacet(\n        allAttributes,\n        hierarchicalFacet\n      ) {\n        var hierarchicalRefinement = state.getHierarchicalRefinement(\n          hierarchicalFacet.name\n        )[0];\n\n        // if no refinement, ask for root level\n        if (!hierarchicalRefinement) {\n          allAttributes.push(hierarchicalFacet.attributes[0]);\n          return allAttributes;\n        }\n\n        var separator = state._getHierarchicalFacetSeparator(hierarchicalFacet);\n        var level = hierarchicalRefinement.split(separator).length;\n        var newAttributes = hierarchicalFacet.attributes.slice(0, level + 1);\n\n        return allAttributes.concat(newAttributes);\n      },\n      out\n    );\n  },\n\n  _getDisjunctiveHierarchicalFacetAttribute: function (\n    state,\n    hierarchicalFacet,\n    rootLevel\n  ) {\n    var separator = state._getHierarchicalFacetSeparator(hierarchicalFacet);\n    if (rootLevel === true) {\n      var rootPath = state._getHierarchicalRootPath(hierarchicalFacet);\n      var attributeIndex = 0;\n\n      if (rootPath) {\n        attributeIndex = rootPath.split(separator).length;\n      }\n      return [hierarchicalFacet.attributes[attributeIndex]];\n    }\n\n    var hierarchicalRefinement =\n      state.getHierarchicalRefinement(hierarchicalFacet.name)[0] || '';\n    // if refinement is 'beers > IPA > Flying dog',\n    // then we want `facets: ['beers > IPA']` as disjunctive facet (parent level values)\n\n    var parentLevel = hierarchicalRefinement.split(separator).length - 1;\n    return hierarchicalFacet.attributes.slice(0, parentLevel + 1);\n  },\n\n  getSearchForFacetQuery: function (facetName, query, maxFacetHits, state) {\n    var stateForSearchForFacetValues = state.isDisjunctiveFacet(facetName)\n      ? state.clearRefinements(facetName)\n      : state;\n    var searchForFacetSearchParameters = {\n      facetQuery: query,\n      facetName: facetName,\n    };\n    if (typeof maxFacetHits === 'number') {\n      searchForFacetSearchParameters.maxFacetHits = maxFacetHits;\n    }\n    return sortObject(\n      merge(\n        {},\n        requestBuilder._getHitsSearchParams(stateForSearchForFacetValues),\n        searchForFacetSearchParameters\n      )\n    );\n  },\n};\n\nmodule.exports = requestBuilder;\n","'use strict';\n\nmodule.exports = function isValidUserToken(userToken) {\n  if (userToken === null) {\n    return false;\n  }\n  return /^[a-zA-Z0-9_-]{1,64}$/.test(userToken);\n};\n","'use strict';\n\nmodule.exports = '3.14.0';\n","/*! algoliasearch.umd.js | 4.24.0 | © Algolia, inc. | https://github.com/algolia/algoliasearch-client-javascript */\n!function(t,e){\"object\"==typeof exports&&\"undefined\"!=typeof module?module.exports=e():\"function\"==typeof define&&define.amd?define(e):(t=t||self).algoliasearch=e()}(this,(function(){\"use strict\";function t(t,e,r){return e in t?Object.defineProperty(t,e,{value:r,enumerable:!0,configurable:!0,writable:!0}):t[e]=r,t}function e(t,e){var r=Object.keys(t);if(Object.getOwnPropertySymbols){var n=Object.getOwnPropertySymbols(t);e&&(n=n.filter((function(e){return Object.getOwnPropertyDescriptor(t,e).enumerable}))),r.push.apply(r,n)}return r}function r(r){for(var n=1;n<arguments.length;n++){var a=null!=arguments[n]?arguments[n]:{};n%2?e(Object(a),!0).forEach((function(e){t(r,e,a[e])})):Object.getOwnPropertyDescriptors?Object.defineProperties(r,Object.getOwnPropertyDescriptors(a)):e(Object(a)).forEach((function(t){Object.defineProperty(r,t,Object.getOwnPropertyDescriptor(a,t))}))}return r}function n(t,e){if(null==t)return{};var r,n,a=function(t,e){if(null==t)return{};var r,n,a={},o=Object.keys(t);for(n=0;n<o.length;n++)r=o[n],e.indexOf(r)>=0||(a[r]=t[r]);return a}(t,e);if(Object.getOwnPropertySymbols){var o=Object.getOwnPropertySymbols(t);for(n=0;n<o.length;n++)r=o[n],e.indexOf(r)>=0||Object.prototype.propertyIsEnumerable.call(t,r)&&(a[r]=t[r])}return a}function a(t,e){return function(t){if(Array.isArray(t))return t}(t)||function(t,e){if(!(Symbol.iterator in Object(t)||\"[object Arguments]\"===Object.prototype.toString.call(t)))return;var r=[],n=!0,a=!1,o=void 0;try{for(var i,u=t[Symbol.iterator]();!(n=(i=u.next()).done)&&(r.push(i.value),!e||r.length!==e);n=!0);}catch(t){a=!0,o=t}finally{try{n||null==u.return||u.return()}finally{if(a)throw o}}return r}(t,e)||function(){throw new TypeError(\"Invalid attempt to destructure non-iterable instance\")}()}function o(t){return function(t){if(Array.isArray(t)){for(var e=0,r=new Array(t.length);e<t.length;e++)r[e]=t[e];return r}}(t)||function(t){if(Symbol.iterator in Object(t)||\"[object Arguments]\"===Object.prototype.toString.call(t))return Array.from(t)}(t)||function(){throw new TypeError(\"Invalid attempt to spread non-iterable instance\")}()}function i(t){var e,r=\"algoliasearch-client-js-\".concat(t.key),n=function(){return void 0===e&&(e=t.localStorage||window.localStorage),e},o=function(){return JSON.parse(n().getItem(r)||\"{}\")},i=function(t){n().setItem(r,JSON.stringify(t))},u=function(){var e=t.timeToLive?1e3*t.timeToLive:null,r=o(),n=Object.fromEntries(Object.entries(r).filter((function(t){return void 0!==a(t,2)[1].timestamp})));if(i(n),e){var u=Object.fromEntries(Object.entries(n).filter((function(t){var r=a(t,2)[1],n=(new Date).getTime();return!(r.timestamp+e<n)})));i(u)}};return{get:function(t,e){var r=arguments.length>2&&void 0!==arguments[2]?arguments[2]:{miss:function(){return Promise.resolve()}};return Promise.resolve().then((function(){u();var e=JSON.stringify(t);return o()[e]})).then((function(t){return Promise.all([t?t.value:e(),void 0!==t])})).then((function(t){var e=a(t,2),n=e[0],o=e[1];return Promise.all([n,o||r.miss(n)])})).then((function(t){return a(t,1)[0]}))},set:function(t,e){return Promise.resolve().then((function(){var a=o();return a[JSON.stringify(t)]={timestamp:(new Date).getTime(),value:e},n().setItem(r,JSON.stringify(a)),e}))},delete:function(t){return Promise.resolve().then((function(){var e=o();delete e[JSON.stringify(t)],n().setItem(r,JSON.stringify(e))}))},clear:function(){return Promise.resolve().then((function(){n().removeItem(r)}))}}}function u(t){var e=o(t.caches),r=e.shift();return void 0===r?{get:function(t,e){var r=arguments.length>2&&void 0!==arguments[2]?arguments[2]:{miss:function(){return Promise.resolve()}},n=e();return n.then((function(t){return Promise.all([t,r.miss(t)])})).then((function(t){return a(t,1)[0]}))},set:function(t,e){return Promise.resolve(e)},delete:function(t){return Promise.resolve()},clear:function(){return Promise.resolve()}}:{get:function(t,n){var a=arguments.length>2&&void 0!==arguments[2]?arguments[2]:{miss:function(){return Promise.resolve()}};return r.get(t,n,a).catch((function(){return u({caches:e}).get(t,n,a)}))},set:function(t,n){return r.set(t,n).catch((function(){return u({caches:e}).set(t,n)}))},delete:function(t){return r.delete(t).catch((function(){return u({caches:e}).delete(t)}))},clear:function(){return r.clear().catch((function(){return u({caches:e}).clear()}))}}}function s(){var t=arguments.length>0&&void 0!==arguments[0]?arguments[0]:{serializable:!0},e={};return{get:function(r,n){var a=arguments.length>2&&void 0!==arguments[2]?arguments[2]:{miss:function(){return Promise.resolve()}},o=JSON.stringify(r);if(o in e)return Promise.resolve(t.serializable?JSON.parse(e[o]):e[o]);var i=n(),u=a&&a.miss||function(){return Promise.resolve()};return i.then((function(t){return u(t)})).then((function(){return i}))},set:function(r,n){return e[JSON.stringify(r)]=t.serializable?JSON.stringify(n):n,Promise.resolve(n)},delete:function(t){return delete e[JSON.stringify(t)],Promise.resolve()},clear:function(){return e={},Promise.resolve()}}}function c(t,e,r){var n={\"x-algolia-api-key\":r,\"x-algolia-application-id\":e};return{headers:function(){return t===m.WithinHeaders?n:{}},queryParameters:function(){return t===m.WithinQueryParameters?n:{}}}}function f(t){var e=0;return t((function r(){return e++,new Promise((function(n){setTimeout((function(){n(t(r))}),Math.min(100*e,1e3))}))}))}function d(t){var e=arguments.length>1&&void 0!==arguments[1]?arguments[1]:function(t,e){return Promise.resolve()};return Object.assign(t,{wait:function(r){return d(t.then((function(t){return Promise.all([e(t,r),t])})).then((function(t){return t[1]})))}})}function l(t){for(var e=t.length-1;e>0;e--){var r=Math.floor(Math.random()*(e+1)),n=t[e];t[e]=t[r],t[r]=n}return t}function h(t,e){return e?(Object.keys(e).forEach((function(r){t[r]=e[r](t)})),t):t}function p(t){for(var e=arguments.length,r=new Array(e>1?e-1:0),n=1;n<e;n++)r[n-1]=arguments[n];var a=0;return t.replace(/%s/g,(function(){return encodeURIComponent(r[a++])}))}var m={WithinQueryParameters:0,WithinHeaders:1};function y(t,e){var r=t||{},n=r.data||{};return Object.keys(r).forEach((function(t){-1===[\"timeout\",\"headers\",\"queryParameters\",\"data\",\"cacheable\"].indexOf(t)&&(n[t]=r[t])})),{data:Object.entries(n).length>0?n:void 0,timeout:r.timeout||e,headers:r.headers||{},queryParameters:r.queryParameters||{},cacheable:r.cacheable}}var g={Read:1,Write:2,Any:3},v=1,b=2,P=3;function O(t){var e=arguments.length>1&&void 0!==arguments[1]?arguments[1]:v;return r(r({},t),{},{status:e,lastUpdate:Date.now()})}function w(t){return\"string\"==typeof t?{protocol:\"https\",url:t,accept:g.Any}:{protocol:t.protocol||\"https\",url:t.url,accept:t.accept||g.Any}}var I=\"DELETE\",x=\"GET\",j=\"POST\",D=\"PUT\";function q(t,e){return Promise.all(e.map((function(e){return t.get(e,(function(){return Promise.resolve(O(e))}))}))).then((function(t){var r=t.filter((function(t){return function(t){return t.status===v||Date.now()-t.lastUpdate>12e4}(t)})),n=t.filter((function(t){return function(t){return t.status===P&&Date.now()-t.lastUpdate<=12e4}(t)})),a=[].concat(o(r),o(n));return{getTimeout:function(t,e){return(0===n.length&&0===t?1:n.length+3+t)*e},statelessHosts:a.length>0?a.map((function(t){return w(t)})):e}}))}function S(t,e,n,a){var i=[],u=function(t,e){if(t.method===x||void 0===t.data&&void 0===e.data)return;var n=Array.isArray(t.data)?t.data:r(r({},t.data),e.data);return JSON.stringify(n)}(n,a),s=function(t,e){var n=r(r({},t.headers),e.headers),a={};return Object.keys(n).forEach((function(t){var e=n[t];a[t.toLowerCase()]=e})),a}(t,a),c=n.method,f=n.method!==x?{}:r(r({},n.data),a.data),d=r(r(r({\"x-algolia-agent\":t.userAgent.value},t.queryParameters),f),a.queryParameters),l=0,h=function e(r,o){var f=r.pop();if(void 0===f)throw{name:\"RetryError\",message:\"Unreachable hosts - your application id may be incorrect. If the error persists, please reach out to the Algolia Support team: https://alg.li/support .\",transporterStackTrace:E(i)};var h={data:u,headers:s,method:c,url:N(f,n.path,d),connectTimeout:o(l,t.timeouts.connect),responseTimeout:o(l,a.timeout)},p=function(t){var e={request:h,response:t,host:f,triesLeft:r.length};return i.push(e),e},m={onSuccess:function(t){return function(t){try{return JSON.parse(t.content)}catch(e){throw function(t,e){return{name:\"DeserializationError\",message:t,response:e}}(e.message,t)}}(t)},onRetry:function(n){var a=p(n);return n.isTimedOut&&l++,Promise.all([t.logger.info(\"Retryable failure\",A(a)),t.hostsCache.set(f,O(f,n.isTimedOut?P:b))]).then((function(){return e(r,o)}))},onFail:function(t){throw p(t),function(t,e){var r=t.content,n=t.status,a=r;try{a=JSON.parse(r).message}catch(t){}return function(t,e,r){return{name:\"ApiError\",message:t,status:e,transporterStackTrace:r}}(a,n,e)}(t,E(i))}};return t.requester.send(h).then((function(t){return function(t,e){return function(t){var e=t.status;return t.isTimedOut||function(t){var e=t.isTimedOut,r=t.status;return!e&&0==~~r}(t)||2!=~~(e/100)&&4!=~~(e/100)}(t)?e.onRetry(t):2==~~(t.status/100)?e.onSuccess(t):e.onFail(t)}(t,m)}))};return q(t.hostsCache,e).then((function(t){return h(o(t.statelessHosts).reverse(),t.getTimeout)}))}function k(t){var e=t.hostsCache,r=t.logger,n=t.requester,o=t.requestsCache,i=t.responsesCache,u=t.timeouts,s=t.userAgent,c=t.hosts,f=t.queryParameters,d={hostsCache:e,logger:r,requester:n,requestsCache:o,responsesCache:i,timeouts:u,userAgent:s,headers:t.headers,queryParameters:f,hosts:c.map((function(t){return w(t)})),read:function(t,e){var r=y(e,d.timeouts.read),n=function(){return S(d,d.hosts.filter((function(t){return 0!=(t.accept&g.Read)})),t,r)};if(!0!==(void 0!==r.cacheable?r.cacheable:t.cacheable))return n();var o={request:t,mappedRequestOptions:r,transporter:{queryParameters:d.queryParameters,headers:d.headers}};return d.responsesCache.get(o,(function(){return d.requestsCache.get(o,(function(){return d.requestsCache.set(o,n()).then((function(t){return Promise.all([d.requestsCache.delete(o),t])}),(function(t){return Promise.all([d.requestsCache.delete(o),Promise.reject(t)])})).then((function(t){var e=a(t,2);e[0];return e[1]}))}))}),{miss:function(t){return d.responsesCache.set(o,t)}})},write:function(t,e){return S(d,d.hosts.filter((function(t){return 0!=(t.accept&g.Write)})),t,y(e,d.timeouts.write))}};return d}function T(t){var e={value:\"Algolia for JavaScript (\".concat(t,\")\"),add:function(t){var r=\"; \".concat(t.segment).concat(void 0!==t.version?\" (\".concat(t.version,\")\"):\"\");return-1===e.value.indexOf(r)&&(e.value=\"\".concat(e.value).concat(r)),e}};return e}function N(t,e,r){var n=R(r),a=\"\".concat(t.protocol,\"://\").concat(t.url,\"/\").concat(\"/\"===e.charAt(0)?e.substr(1):e);return n.length&&(a+=\"?\".concat(n)),a}function R(t){return Object.keys(t).map((function(e){return p(\"%s=%s\",e,(r=t[e],\"[object Object]\"===Object.prototype.toString.call(r)||\"[object Array]\"===Object.prototype.toString.call(r)?JSON.stringify(t[e]):t[e]));var r})).join(\"&\")}function E(t){return t.map((function(t){return A(t)}))}function A(t){var e=t.request.headers[\"x-algolia-api-key\"]?{\"x-algolia-api-key\":\"*****\"}:{};return r(r({},t),{},{request:r(r({},t.request),{},{headers:r(r({},t.request.headers),e)})})}var C=function(t){return function(e,r){return t.transporter.write({method:j,path:\"2/abtests\",data:e},r)}},U=function(t){return function(e,r){return t.transporter.write({method:I,path:p(\"2/abtests/%s\",e)},r)}},z=function(t){return function(e,r){return t.transporter.read({method:x,path:p(\"2/abtests/%s\",e)},r)}},J=function(t){return function(e){return t.transporter.read({method:x,path:\"2/abtests\"},e)}},F=function(t){return function(e,r){return t.transporter.write({method:j,path:p(\"2/abtests/%s/stop\",e)},r)}},H=function(t){return function(e){return t.transporter.read({method:x,path:\"1/strategies/personalization\"},e)}},M=function(t){return function(e,r){return t.transporter.write({method:j,path:\"1/strategies/personalization\",data:e},r)}};function B(t){return function e(r){return t.request(r).then((function(n){if(void 0!==t.batch&&t.batch(n.hits),!t.shouldStop(n))return n.cursor?e({cursor:n.cursor}):e({page:(r.page||0)+1})}))}({})}var K=function(t){return function(e,a){var o=a||{},i=o.queryParameters,u=n(o,[\"queryParameters\"]),s=r({acl:e},void 0!==i?{queryParameters:i}:{});return d(t.transporter.write({method:j,path:\"1/keys\",data:s},u),(function(e,r){return f((function(n){return tt(t)(e.key,r).catch((function(t){if(404!==t.status)throw t;return n()}))}))}))}},W=function(t){return function(e,r,n){var a=y(n);return a.queryParameters[\"X-Algolia-User-ID\"]=e,t.transporter.write({method:j,path:\"1/clusters/mapping\",data:{cluster:r}},a)}},L=function(t){return function(e,r,n){return t.transporter.write({method:j,path:\"1/clusters/mapping/batch\",data:{users:e,cluster:r}},n)}},Q=function(t){return function(e,r){return d(t.transporter.write({method:j,path:p(\"/1/dictionaries/%s/batch\",e),data:{clearExistingDictionaryEntries:!0,requests:{action:\"addEntry\",body:[]}}},r),(function(e,r){return jt(t)(e.taskID,r)}))}},G=function(t){return function(e,r,n){return d(t.transporter.write({method:j,path:p(\"1/indexes/%s/operation\",e),data:{operation:\"copy\",destination:r}},n),(function(r,n){return ut(t)(e,{methods:{waitTask:de}}).waitTask(r.taskID,n)}))}},V=function(t){return function(e,n,a){return G(t)(e,n,r(r({},a),{},{scope:[he.Rules]}))}},_=function(t){return function(e,n,a){return G(t)(e,n,r(r({},a),{},{scope:[he.Settings]}))}},X=function(t){return function(e,n,a){return G(t)(e,n,r(r({},a),{},{scope:[he.Synonyms]}))}},Y=function(t){return function(e,r){return e.method===x?t.transporter.read(e,r):t.transporter.write(e,r)}},Z=function(t){return function(e,r){return d(t.transporter.write({method:I,path:p(\"1/keys/%s\",e)},r),(function(r,n){return f((function(r){return tt(t)(e,n).then(r).catch((function(t){if(404!==t.status)throw t}))}))}))}},$=function(t){return function(e,r,n){var a=r.map((function(t){return{action:\"deleteEntry\",body:{objectID:t}}}));return d(t.transporter.write({method:j,path:p(\"/1/dictionaries/%s/batch\",e),data:{clearExistingDictionaryEntries:!1,requests:a}},n),(function(e,r){return jt(t)(e.taskID,r)}))}},tt=function(t){return function(e,r){return t.transporter.read({method:x,path:p(\"1/keys/%s\",e)},r)}},et=function(t){return function(e,r){return t.transporter.read({method:x,path:p(\"1/task/%s\",e.toString())},r)}},rt=function(t){return function(e){return t.transporter.read({method:x,path:\"/1/dictionaries/*/settings\"},e)}},nt=function(t){return function(e){return t.transporter.read({method:x,path:\"1/logs\"},e)}},at=function(t){return function(e){return t.transporter.read({method:x,path:\"1/clusters/mapping/top\"},e)}},ot=function(t){return function(e,r){return t.transporter.read({method:x,path:p(\"1/clusters/mapping/%s\",e)},r)}},it=function(t){return function(e){var r=e||{},a=r.retrieveMappings,o=n(r,[\"retrieveMappings\"]);return!0===a&&(o.getClusters=!0),t.transporter.read({method:x,path:\"1/clusters/mapping/pending\"},o)}},ut=function(t){return function(e){var r=arguments.length>1&&void 0!==arguments[1]?arguments[1]:{},n={transporter:t.transporter,appId:t.appId,indexName:e};return h(n,r.methods)}},st=function(t){return function(e){return t.transporter.read({method:x,path:\"1/keys\"},e)}},ct=function(t){return function(e){return t.transporter.read({method:x,path:\"1/clusters\"},e)}},ft=function(t){return function(e){return t.transporter.read({method:x,path:\"1/indexes\"},e)}},dt=function(t){return function(e){return t.transporter.read({method:x,path:\"1/clusters/mapping\"},e)}},lt=function(t){return function(e,r,n){return d(t.transporter.write({method:j,path:p(\"1/indexes/%s/operation\",e),data:{operation:\"move\",destination:r}},n),(function(r,n){return ut(t)(e,{methods:{waitTask:de}}).waitTask(r.taskID,n)}))}},ht=function(t){return function(e,r){return d(t.transporter.write({method:j,path:\"1/indexes/*/batch\",data:{requests:e}},r),(function(e,r){return Promise.all(Object.keys(e.taskID).map((function(n){return ut(t)(n,{methods:{waitTask:de}}).waitTask(e.taskID[n],r)})))}))}},pt=function(t){return function(e,r){return t.transporter.read({method:j,path:\"1/indexes/*/objects\",data:{requests:e}},r)}},mt=function(t){return function(e,n){var a=e.map((function(t){return r(r({},t),{},{params:R(t.params||{})})}));return t.transporter.read({method:j,path:\"1/indexes/*/queries\",data:{requests:a},cacheable:!0},n)}},yt=function(t){return function(e,a){return Promise.all(e.map((function(e){var o=e.params,i=o.facetName,u=o.facetQuery,s=n(o,[\"facetName\",\"facetQuery\"]);return ut(t)(e.indexName,{methods:{searchForFacetValues:ue}}).searchForFacetValues(i,u,r(r({},a),s))})))}},gt=function(t){return function(e,r){var n=y(r);return n.queryParameters[\"X-Algolia-User-ID\"]=e,t.transporter.write({method:I,path:\"1/clusters/mapping\"},n)}},vt=function(t){return function(e,r,n){var a=r.map((function(t){return{action:\"addEntry\",body:t}}));return d(t.transporter.write({method:j,path:p(\"/1/dictionaries/%s/batch\",e),data:{clearExistingDictionaryEntries:!0,requests:a}},n),(function(e,r){return jt(t)(e.taskID,r)}))}},bt=function(t){return function(e,r){return d(t.transporter.write({method:j,path:p(\"1/keys/%s/restore\",e)},r),(function(r,n){return f((function(r){return tt(t)(e,n).catch((function(t){if(404!==t.status)throw t;return r()}))}))}))}},Pt=function(t){return function(e,r,n){var a=r.map((function(t){return{action:\"addEntry\",body:t}}));return d(t.transporter.write({method:j,path:p(\"/1/dictionaries/%s/batch\",e),data:{clearExistingDictionaryEntries:!1,requests:a}},n),(function(e,r){return jt(t)(e.taskID,r)}))}},Ot=function(t){return function(e,r,n){return t.transporter.read({method:j,path:p(\"/1/dictionaries/%s/search\",e),data:{query:r},cacheable:!0},n)}},wt=function(t){return function(e,r){return t.transporter.read({method:j,path:\"1/clusters/mapping/search\",data:{query:e}},r)}},It=function(t){return function(e,r){return d(t.transporter.write({method:D,path:\"/1/dictionaries/*/settings\",data:e},r),(function(e,r){return jt(t)(e.taskID,r)}))}},xt=function(t){return function(e,r){var a=Object.assign({},r),o=r||{},i=o.queryParameters,u=n(o,[\"queryParameters\"]),s=i?{queryParameters:i}:{},c=[\"acl\",\"indexes\",\"referers\",\"restrictSources\",\"queryParameters\",\"description\",\"maxQueriesPerIPPerHour\",\"maxHitsPerQuery\"];return d(t.transporter.write({method:D,path:p(\"1/keys/%s\",e),data:s},u),(function(r,n){return f((function(r){return tt(t)(e,n).then((function(t){return function(t){return Object.keys(a).filter((function(t){return-1!==c.indexOf(t)})).every((function(e){if(Array.isArray(t[e])&&Array.isArray(a[e])){var r=t[e];return r.length===a[e].length&&r.every((function(t,r){return t===a[e][r]}))}return t[e]===a[e]}))}(t)?Promise.resolve():r()}))}))}))}},jt=function(t){return function(e,r){return f((function(n){return et(t)(e,r).then((function(t){return\"published\"!==t.status?n():void 0}))}))}},Dt=function(t){return function(e,r){return d(t.transporter.write({method:j,path:p(\"1/indexes/%s/batch\",t.indexName),data:{requests:e}},r),(function(e,r){return de(t)(e.taskID,r)}))}},qt=function(t){return function(e){return B(r(r({shouldStop:function(t){return void 0===t.cursor}},e),{},{request:function(r){return t.transporter.read({method:j,path:p(\"1/indexes/%s/browse\",t.indexName),data:r},e)}}))}},St=function(t){return function(e){var n=r({hitsPerPage:1e3},e);return B(r(r({shouldStop:function(t){return t.hits.length<n.hitsPerPage}},n),{},{request:function(e){return se(t)(\"\",r(r({},n),e)).then((function(t){return r(r({},t),{},{hits:t.hits.map((function(t){return delete t._highlightResult,t}))})}))}}))}},kt=function(t){return function(e){var n=r({hitsPerPage:1e3},e);return B(r(r({shouldStop:function(t){return t.hits.length<n.hitsPerPage}},n),{},{request:function(e){return ce(t)(\"\",r(r({},n),e)).then((function(t){return r(r({},t),{},{hits:t.hits.map((function(t){return delete t._highlightResult,t}))})}))}}))}},Tt=function(t){return function(e,r,a){var o=a||{},i=o.batchSize,u=n(o,[\"batchSize\"]),s={taskIDs:[],objectIDs:[]};return d(function n(){var a,o=arguments.length>0&&void 0!==arguments[0]?arguments[0]:0,c=[];for(a=o;a<e.length&&(c.push(e[a]),c.length!==(i||1e3));a++);return 0===c.length?Promise.resolve(s):Dt(t)(c.map((function(t){return{action:r,body:t}})),u).then((function(t){return s.objectIDs=s.objectIDs.concat(t.objectIDs),s.taskIDs.push(t.taskID),a++,n(a)}))}(),(function(e,r){return Promise.all(e.taskIDs.map((function(e){return de(t)(e,r)})))}))}},Nt=function(t){return function(e){return d(t.transporter.write({method:j,path:p(\"1/indexes/%s/clear\",t.indexName)},e),(function(e,r){return de(t)(e.taskID,r)}))}},Rt=function(t){return function(e){var r=e||{},a=r.forwardToReplicas,o=y(n(r,[\"forwardToReplicas\"]));return a&&(o.queryParameters.forwardToReplicas=1),d(t.transporter.write({method:j,path:p(\"1/indexes/%s/rules/clear\",t.indexName)},o),(function(e,r){return de(t)(e.taskID,r)}))}},Et=function(t){return function(e){var r=e||{},a=r.forwardToReplicas,o=y(n(r,[\"forwardToReplicas\"]));return a&&(o.queryParameters.forwardToReplicas=1),d(t.transporter.write({method:j,path:p(\"1/indexes/%s/synonyms/clear\",t.indexName)},o),(function(e,r){return de(t)(e.taskID,r)}))}},At=function(t){return function(e,r){return d(t.transporter.write({method:j,path:p(\"1/indexes/%s/deleteByQuery\",t.indexName),data:e},r),(function(e,r){return de(t)(e.taskID,r)}))}},Ct=function(t){return function(e){return d(t.transporter.write({method:I,path:p(\"1/indexes/%s\",t.indexName)},e),(function(e,r){return de(t)(e.taskID,r)}))}},Ut=function(t){return function(e,r){return d(zt(t)([e],r).then((function(t){return{taskID:t.taskIDs[0]}})),(function(e,r){return de(t)(e.taskID,r)}))}},zt=function(t){return function(e,r){var n=e.map((function(t){return{objectID:t}}));return Tt(t)(n,le.DeleteObject,r)}},Jt=function(t){return function(e,r){var a=r||{},o=a.forwardToReplicas,i=y(n(a,[\"forwardToReplicas\"]));return o&&(i.queryParameters.forwardToReplicas=1),d(t.transporter.write({method:I,path:p(\"1/indexes/%s/rules/%s\",t.indexName,e)},i),(function(e,r){return de(t)(e.taskID,r)}))}},Ft=function(t){return function(e,r){var a=r||{},o=a.forwardToReplicas,i=y(n(a,[\"forwardToReplicas\"]));return o&&(i.queryParameters.forwardToReplicas=1),d(t.transporter.write({method:I,path:p(\"1/indexes/%s/synonyms/%s\",t.indexName,e)},i),(function(e,r){return de(t)(e.taskID,r)}))}},Ht=function(t){return function(e){return Gt(t)(e).then((function(){return!0})).catch((function(t){if(404!==t.status)throw t;return!1}))}},Mt=function(t){return function(e,r,n){return t.transporter.read({method:j,path:p(\"1/answers/%s/prediction\",t.indexName),data:{query:e,queryLanguages:r},cacheable:!0},n)}},Bt=function(t){return function(e,o){var i=o||{},u=i.query,s=i.paginate,c=n(i,[\"query\",\"paginate\"]),f=0;return function n(){return ie(t)(u||\"\",r(r({},c),{},{page:f})).then((function(t){for(var r=0,o=Object.entries(t.hits);r<o.length;r++){var i=a(o[r],2),u=i[0],c=i[1];if(e(c))return{object:c,position:parseInt(u,10),page:f}}if(f++,!1===s||f>=t.nbPages)throw{name:\"ObjectNotFoundError\",message:\"Object not found.\"};return n()}))}()}},Kt=function(t){return function(e,r){return t.transporter.read({method:x,path:p(\"1/indexes/%s/%s\",t.indexName,e)},r)}},Wt=function(){return function(t,e){for(var r=0,n=Object.entries(t.hits);r<n.length;r++){var o=a(n[r],2),i=o[0];if(o[1].objectID===e)return parseInt(i,10)}return-1}},Lt=function(t){return function(e,a){var o=a||{},i=o.attributesToRetrieve,u=n(o,[\"attributesToRetrieve\"]),s=e.map((function(e){return r({indexName:t.indexName,objectID:e},i?{attributesToRetrieve:i}:{})}));return t.transporter.read({method:j,path:\"1/indexes/*/objects\",data:{requests:s}},u)}},Qt=function(t){return function(e,r){return t.transporter.read({method:x,path:p(\"1/indexes/%s/rules/%s\",t.indexName,e)},r)}},Gt=function(t){return function(e){return t.transporter.read({method:x,path:p(\"1/indexes/%s/settings\",t.indexName),data:{getVersion:2}},e)}},Vt=function(t){return function(e,r){return t.transporter.read({method:x,path:p(\"1/indexes/%s/synonyms/%s\",t.indexName,e)},r)}},_t=function(t){return function(e,r){return d(Xt(t)([e],r).then((function(t){return{objectID:t.objectIDs[0],taskID:t.taskIDs[0]}})),(function(e,r){return de(t)(e.taskID,r)}))}},Xt=function(t){return function(e,r){var a=r||{},o=a.createIfNotExists,i=n(a,[\"createIfNotExists\"]),u=o?le.PartialUpdateObject:le.PartialUpdateObjectNoCreate;return Tt(t)(e,u,i)}},Yt=function(t){return function(e,i){var u=i||{},s=u.safe,c=u.autoGenerateObjectIDIfNotExist,f=u.batchSize,l=n(u,[\"safe\",\"autoGenerateObjectIDIfNotExist\",\"batchSize\"]),h=function(e,r,n,a){return d(t.transporter.write({method:j,path:p(\"1/indexes/%s/operation\",e),data:{operation:n,destination:r}},a),(function(e,r){return de(t)(e.taskID,r)}))},m=Math.random().toString(36).substring(7),y=\"\".concat(t.indexName,\"_tmp_\").concat(m),g=ee({appId:t.appId,transporter:t.transporter,indexName:y}),v=[],b=h(t.indexName,y,\"copy\",r(r({},l),{},{scope:[\"settings\",\"synonyms\",\"rules\"]}));return v.push(b),d((s?b.wait(l):b).then((function(){var t=g(e,r(r({},l),{},{autoGenerateObjectIDIfNotExist:c,batchSize:f}));return v.push(t),s?t.wait(l):t})).then((function(){var e=h(y,t.indexName,\"move\",l);return v.push(e),s?e.wait(l):e})).then((function(){return Promise.all(v)})).then((function(t){var e=a(t,3),r=e[0],n=e[1],i=e[2];return{objectIDs:n.objectIDs,taskIDs:[r.taskID].concat(o(n.taskIDs),[i.taskID])}})),(function(t,e){return Promise.all(v.map((function(t){return t.wait(e)})))}))}},Zt=function(t){return function(e,n){return ne(t)(e,r(r({},n),{},{clearExistingRules:!0}))}},$t=function(t){return function(e,n){return oe(t)(e,r(r({},n),{},{clearExistingSynonyms:!0}))}},te=function(t){return function(e,r){return d(ee(t)([e],r).then((function(t){return{objectID:t.objectIDs[0],taskID:t.taskIDs[0]}})),(function(e,r){return de(t)(e.taskID,r)}))}},ee=function(t){return function(e,r){var a=r||{},o=a.autoGenerateObjectIDIfNotExist,i=n(a,[\"autoGenerateObjectIDIfNotExist\"]),u=o?le.AddObject:le.UpdateObject;if(u===le.UpdateObject){var s=!0,c=!1,f=void 0;try{for(var l,h=e[Symbol.iterator]();!(s=(l=h.next()).done);s=!0){if(void 0===l.value.objectID)return d(Promise.reject({name:\"MissingObjectIDError\",message:\"All objects must have an unique objectID (like a primary key) to be valid. Algolia is also able to generate objectIDs automatically but *it's not recommended*. To do it, use the `{'autoGenerateObjectIDIfNotExist': true}` option.\"}))}}catch(t){c=!0,f=t}finally{try{s||null==h.return||h.return()}finally{if(c)throw f}}}return Tt(t)(e,u,i)}},re=function(t){return function(e,r){return ne(t)([e],r)}},ne=function(t){return function(e,r){var a=r||{},o=a.forwardToReplicas,i=a.clearExistingRules,u=y(n(a,[\"forwardToReplicas\",\"clearExistingRules\"]));return o&&(u.queryParameters.forwardToReplicas=1),i&&(u.queryParameters.clearExistingRules=1),d(t.transporter.write({method:j,path:p(\"1/indexes/%s/rules/batch\",t.indexName),data:e},u),(function(e,r){return de(t)(e.taskID,r)}))}},ae=function(t){return function(e,r){return oe(t)([e],r)}},oe=function(t){return function(e,r){var a=r||{},o=a.forwardToReplicas,i=a.clearExistingSynonyms,u=a.replaceExistingSynonyms,s=y(n(a,[\"forwardToReplicas\",\"clearExistingSynonyms\",\"replaceExistingSynonyms\"]));return o&&(s.queryParameters.forwardToReplicas=1),(u||i)&&(s.queryParameters.replaceExistingSynonyms=1),d(t.transporter.write({method:j,path:p(\"1/indexes/%s/synonyms/batch\",t.indexName),data:e},s),(function(e,r){return de(t)(e.taskID,r)}))}},ie=function(t){return function(e,r){return t.transporter.read({method:j,path:p(\"1/indexes/%s/query\",t.indexName),data:{query:e},cacheable:!0},r)}},ue=function(t){return function(e,r,n){return t.transporter.read({method:j,path:p(\"1/indexes/%s/facets/%s/query\",t.indexName,e),data:{facetQuery:r},cacheable:!0},n)}},se=function(t){return function(e,r){return t.transporter.read({method:j,path:p(\"1/indexes/%s/rules/search\",t.indexName),data:{query:e}},r)}},ce=function(t){return function(e,r){return t.transporter.read({method:j,path:p(\"1/indexes/%s/synonyms/search\",t.indexName),data:{query:e}},r)}},fe=function(t){return function(e,r){var a=r||{},o=a.forwardToReplicas,i=y(n(a,[\"forwardToReplicas\"]));return o&&(i.queryParameters.forwardToReplicas=1),d(t.transporter.write({method:D,path:p(\"1/indexes/%s/settings\",t.indexName),data:e},i),(function(e,r){return de(t)(e.taskID,r)}))}},de=function(t){return function(e,r){return f((function(n){return function(t){return function(e,r){return t.transporter.read({method:x,path:p(\"1/indexes/%s/task/%s\",t.indexName,e.toString())},r)}}(t)(e,r).then((function(t){return\"published\"!==t.status?n():void 0}))}))}},le={AddObject:\"addObject\",UpdateObject:\"updateObject\",PartialUpdateObject:\"partialUpdateObject\",PartialUpdateObjectNoCreate:\"partialUpdateObjectNoCreate\",DeleteObject:\"deleteObject\",DeleteIndex:\"delete\",ClearIndex:\"clear\"},he={Settings:\"settings\",Synonyms:\"synonyms\",Rules:\"rules\"},pe=1,me=2,ye=3;var ge=function(t){return function(e,n){var a=e.map((function(t){return r(r({},t),{},{threshold:t.threshold||0})}));return t.transporter.read({method:j,path:\"1/indexes/*/recommendations\",data:{requests:a},cacheable:!0},n)}},ve=function(t){return function(e,n){return ge(t)(e.map((function(t){return r(r({},t),{},{fallbackParameters:{},model:\"bought-together\"})})),n)}},be=function(t){return function(e,n){return ge(t)(e.map((function(t){return r(r({},t),{},{model:\"related-products\"})})),n)}},Pe=function(t){return function(e,n){var a=e.map((function(t){return r(r({},t),{},{model:\"trending-facets\",threshold:t.threshold||0})}));return t.transporter.read({method:j,path:\"1/indexes/*/recommendations\",data:{requests:a},cacheable:!0},n)}},Oe=function(t){return function(e,n){var a=e.map((function(t){return r(r({},t),{},{model:\"trending-items\",threshold:t.threshold||0})}));return t.transporter.read({method:j,path:\"1/indexes/*/recommendations\",data:{requests:a},cacheable:!0},n)}},we=function(t){return function(e,n){return ge(t)(e.map((function(t){return r(r({},t),{},{model:\"looking-similar\"})})),n)}},Ie=function(t){return function(e,n){var a=e.map((function(t){return r(r({},t),{},{model:\"recommended-for-you\",threshold:t.threshold||0})}));return t.transporter.read({method:j,path:\"1/indexes/*/recommendations\",data:{requests:a},cacheable:!0},n)}};function xe(t,e,n){var a,o={appId:t,apiKey:e,timeouts:{connect:1,read:2,write:30},requester:{send:function(t){return new Promise((function(e){var r=new XMLHttpRequest;r.open(t.method,t.url,!0),Object.keys(t.headers).forEach((function(e){return r.setRequestHeader(e,t.headers[e])}));var n,a=function(t,n){return setTimeout((function(){r.abort(),e({status:0,content:n,isTimedOut:!0})}),1e3*t)},o=a(t.connectTimeout,\"Connection timeout\");r.onreadystatechange=function(){r.readyState>r.OPENED&&void 0===n&&(clearTimeout(o),n=a(t.responseTimeout,\"Socket timeout\"))},r.onerror=function(){0===r.status&&(clearTimeout(o),clearTimeout(n),e({content:r.responseText||\"Network request failed\",status:r.status,isTimedOut:!1}))},r.onload=function(){clearTimeout(o),clearTimeout(n),e({content:r.responseText,status:r.status,isTimedOut:!1})},r.send(t.data)}))}},logger:(a=ye,{debug:function(t,e){return pe>=a&&console.debug(t,e),Promise.resolve()},info:function(t,e){return me>=a&&console.info(t,e),Promise.resolve()},error:function(t,e){return console.error(t,e),Promise.resolve()}}),responsesCache:s(),requestsCache:s({serializable:!1}),hostsCache:u({caches:[i({key:\"\".concat(\"4.24.0\",\"-\").concat(t)}),s()]}),userAgent:T(\"4.24.0\").add({segment:\"Browser\"})},f=r(r({},o),n),d=function(){return function(t){return function(t){var e=t.region||\"us\",n=c(m.WithinHeaders,t.appId,t.apiKey),a=k(r(r({hosts:[{url:\"personalization.\".concat(e,\".algolia.com\")}]},t),{},{headers:r(r(r({},n.headers()),{\"content-type\":\"application/json\"}),t.headers),queryParameters:r(r({},n.queryParameters()),t.queryParameters)}));return h({appId:t.appId,transporter:a},t.methods)}(r(r(r({},o),t),{},{methods:{getPersonalizationStrategy:H,setPersonalizationStrategy:M}}))}};return function(t){var e=t.appId,n=c(void 0!==t.authMode?t.authMode:m.WithinHeaders,e,t.apiKey),a=k(r(r({hosts:[{url:\"\".concat(e,\"-dsn.algolia.net\"),accept:g.Read},{url:\"\".concat(e,\".algolia.net\"),accept:g.Write}].concat(l([{url:\"\".concat(e,\"-1.algolianet.com\")},{url:\"\".concat(e,\"-2.algolianet.com\")},{url:\"\".concat(e,\"-3.algolianet.com\")}]))},t),{},{headers:r(r(r({},n.headers()),{\"content-type\":\"application/x-www-form-urlencoded\"}),t.headers),queryParameters:r(r({},n.queryParameters()),t.queryParameters)}));return h({transporter:a,appId:e,addAlgoliaAgent:function(t,e){a.userAgent.add({segment:t,version:e})},clearCache:function(){return Promise.all([a.requestsCache.clear(),a.responsesCache.clear()]).then((function(){}))}},t.methods)}(r(r({},f),{},{methods:{search:mt,searchForFacetValues:yt,multipleBatch:ht,multipleGetObjects:pt,multipleQueries:mt,copyIndex:G,copySettings:_,copySynonyms:X,copyRules:V,moveIndex:lt,listIndices:ft,getLogs:nt,listClusters:ct,multipleSearchForFacetValues:yt,getApiKey:tt,addApiKey:K,listApiKeys:st,updateApiKey:xt,deleteApiKey:Z,restoreApiKey:bt,assignUserID:W,assignUserIDs:L,getUserID:ot,searchUserIDs:wt,listUserIDs:dt,getTopUserIDs:at,removeUserID:gt,hasPendingMappings:it,clearDictionaryEntries:Q,deleteDictionaryEntries:$,getDictionarySettings:rt,getAppTask:et,replaceDictionaryEntries:vt,saveDictionaryEntries:Pt,searchDictionaryEntries:Ot,setDictionarySettings:It,waitAppTask:jt,customRequest:Y,initIndex:function(t){return function(e){return ut(t)(e,{methods:{batch:Dt,delete:Ct,findAnswers:Mt,getObject:Kt,getObjects:Lt,saveObject:te,saveObjects:ee,search:ie,searchForFacetValues:ue,waitTask:de,setSettings:fe,getSettings:Gt,partialUpdateObject:_t,partialUpdateObjects:Xt,deleteObject:Ut,deleteObjects:zt,deleteBy:At,clearObjects:Nt,browseObjects:qt,getObjectPosition:Wt,findObject:Bt,exists:Ht,saveSynonym:ae,saveSynonyms:oe,getSynonym:Vt,searchSynonyms:ce,browseSynonyms:kt,deleteSynonym:Ft,clearSynonyms:Et,replaceAllObjects:Yt,replaceAllSynonyms:$t,searchRules:se,getRule:Qt,deleteRule:Jt,saveRule:re,saveRules:ne,replaceAllRules:Zt,browseRules:St,clearRules:Rt}})}},initAnalytics:function(){return function(t){return function(t){var e=t.region||\"us\",n=c(m.WithinHeaders,t.appId,t.apiKey),a=k(r(r({hosts:[{url:\"analytics.\".concat(e,\".algolia.com\")}]},t),{},{headers:r(r(r({},n.headers()),{\"content-type\":\"application/json\"}),t.headers),queryParameters:r(r({},n.queryParameters()),t.queryParameters)}));return h({appId:t.appId,transporter:a},t.methods)}(r(r(r({},o),t),{},{methods:{addABTest:C,getABTest:z,getABTests:J,stopABTest:F,deleteABTest:U}}))}},initPersonalization:d,initRecommendation:function(){return function(t){return f.logger.info(\"The `initRecommendation` method is deprecated. Use `initPersonalization` instead.\"),d()(t)}},getRecommendations:ge,getFrequentlyBoughtTogether:ve,getLookingSimilar:we,getRecommendedForYou:Ie,getRelatedProducts:be,getTrendingFacets:Pe,getTrendingItems:Oe}}))}return xe.version=\"4.24.0\",xe}));\n","var getNative = require('./_getNative'),\n    root = require('./_root');\n\n/* Built-in method references that are verified to be native. */\nvar DataView = getNative(root, 'DataView');\n\nmodule.exports = DataView;\n","var hashClear = require('./_hashClear'),\n    hashDelete = require('./_hashDelete'),\n    hashGet = require('./_hashGet'),\n    hashHas = require('./_hashHas'),\n    hashSet = require('./_hashSet');\n\n/**\n * Creates a hash object.\n *\n * @private\n * @constructor\n * @param {Array} [entries] The key-value pairs to cache.\n */\nfunction Hash(entries) {\n  var index = -1,\n      length = entries == null ? 0 : entries.length;\n\n  this.clear();\n  while (++index < length) {\n    var entry = entries[index];\n    this.set(entry[0], entry[1]);\n  }\n}\n\n// Add methods to `Hash`.\nHash.prototype.clear = hashClear;\nHash.prototype['delete'] = hashDelete;\nHash.prototype.get = hashGet;\nHash.prototype.has = hashHas;\nHash.prototype.set = hashSet;\n\nmodule.exports = Hash;\n","var listCacheClear = require('./_listCacheClear'),\n    listCacheDelete = require('./_listCacheDelete'),\n    listCacheGet = require('./_listCacheGet'),\n    listCacheHas = require('./_listCacheHas'),\n    listCacheSet = require('./_listCacheSet');\n\n/**\n * Creates an list cache object.\n *\n * @private\n * @constructor\n * @param {Array} [entries] The key-value pairs to cache.\n */\nfunction ListCache(entries) {\n  var index = -1,\n      length = entries == null ? 0 : entries.length;\n\n  this.clear();\n  while (++index < length) {\n    var entry = entries[index];\n    this.set(entry[0], entry[1]);\n  }\n}\n\n// Add methods to `ListCache`.\nListCache.prototype.clear = listCacheClear;\nListCache.prototype['delete'] = listCacheDelete;\nListCache.prototype.get = listCacheGet;\nListCache.prototype.has = listCacheHas;\nListCache.prototype.set = listCacheSet;\n\nmodule.exports = ListCache;\n","var getNative = require('./_getNative'),\n    root = require('./_root');\n\n/* Built-in method references that are verified to be native. */\nvar Map = getNative(root, 'Map');\n\nmodule.exports = Map;\n","var mapCacheClear = require('./_mapCacheClear'),\n    mapCacheDelete = require('./_mapCacheDelete'),\n    mapCacheGet = require('./_mapCacheGet'),\n    mapCacheHas = require('./_mapCacheHas'),\n    mapCacheSet = require('./_mapCacheSet');\n\n/**\n * Creates a map cache object to store key-value pairs.\n *\n * @private\n * @constructor\n * @param {Array} [entries] The key-value pairs to cache.\n */\nfunction MapCache(entries) {\n  var index = -1,\n      length = entries == null ? 0 : entries.length;\n\n  this.clear();\n  while (++index < length) {\n    var entry = entries[index];\n    this.set(entry[0], entry[1]);\n  }\n}\n\n// Add methods to `MapCache`.\nMapCache.prototype.clear = mapCacheClear;\nMapCache.prototype['delete'] = mapCacheDelete;\nMapCache.prototype.get = mapCacheGet;\nMapCache.prototype.has = mapCacheHas;\nMapCache.prototype.set = mapCacheSet;\n\nmodule.exports = MapCache;\n","var getNative = require('./_getNative'),\n    root = require('./_root');\n\n/* Built-in method references that are verified to be native. */\nvar Promise = getNative(root, 'Promise');\n\nmodule.exports = Promise;\n","var getNative = require('./_getNative'),\n    root = require('./_root');\n\n/* Built-in method references that are verified to be native. */\nvar Set = getNative(root, 'Set');\n\nmodule.exports = Set;\n","var MapCache = require('./_MapCache'),\n    setCacheAdd = require('./_setCacheAdd'),\n    setCacheHas = require('./_setCacheHas');\n\n/**\n *\n * Creates an array cache object to store unique values.\n *\n * @private\n * @constructor\n * @param {Array} [values] The values to cache.\n */\nfunction SetCache(values) {\n  var index = -1,\n      length = values == null ? 0 : values.length;\n\n  this.__data__ = new MapCache;\n  while (++index < length) {\n    this.add(values[index]);\n  }\n}\n\n// Add methods to `SetCache`.\nSetCache.prototype.add = SetCache.prototype.push = setCacheAdd;\nSetCache.prototype.has = setCacheHas;\n\nmodule.exports = SetCache;\n","var ListCache = require('./_ListCache'),\n    stackClear = require('./_stackClear'),\n    stackDelete = require('./_stackDelete'),\n    stackGet = require('./_stackGet'),\n    stackHas = require('./_stackHas'),\n    stackSet = require('./_stackSet');\n\n/**\n * Creates a stack cache object to store key-value pairs.\n *\n * @private\n * @constructor\n * @param {Array} [entries] The key-value pairs to cache.\n */\nfunction Stack(entries) {\n  var data = this.__data__ = new ListCache(entries);\n  this.size = data.size;\n}\n\n// Add methods to `Stack`.\nStack.prototype.clear = stackClear;\nStack.prototype['delete'] = stackDelete;\nStack.prototype.get = stackGet;\nStack.prototype.has = stackHas;\nStack.prototype.set = stackSet;\n\nmodule.exports = Stack;\n","var root = require('./_root');\n\n/** Built-in value references. */\nvar Uint8Array = root.Uint8Array;\n\nmodule.exports = Uint8Array;\n","var getNative = require('./_getNative'),\n    root = require('./_root');\n\n/* Built-in method references that are verified to be native. */\nvar WeakMap = getNative(root, 'WeakMap');\n\nmodule.exports = WeakMap;\n","/**\n * A faster alternative to `Function#apply`, this function invokes `func`\n * with the `this` binding of `thisArg` and the arguments of `args`.\n *\n * @private\n * @param {Function} func The function to invoke.\n * @param {*} thisArg The `this` binding of `func`.\n * @param {Array} args The arguments to invoke `func` with.\n * @returns {*} Returns the result of `func`.\n */\nfunction apply(func, thisArg, args) {\n  switch (args.length) {\n    case 0: return func.call(thisArg);\n    case 1: return func.call(thisArg, args[0]);\n    case 2: return func.call(thisArg, args[0], args[1]);\n    case 3: return func.call(thisArg, args[0], args[1], args[2]);\n  }\n  return func.apply(thisArg, args);\n}\n\nmodule.exports = apply;\n","/**\n * A specialized version of `_.filter` for arrays without support for\n * iteratee shorthands.\n *\n * @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} predicate The function invoked per iteration.\n * @returns {Array} Returns the new filtered array.\n */\nfunction arrayFilter(array, predicate) {\n  var index = -1,\n      length = array == null ? 0 : array.length,\n      resIndex = 0,\n      result = [];\n\n  while (++index < length) {\n    var value = array[index];\n    if (predicate(value, index, array)) {\n      result[resIndex++] = value;\n    }\n  }\n  return result;\n}\n\nmodule.exports = arrayFilter;\n","var baseIndexOf = require('./_baseIndexOf');\n\n/**\n * A specialized version of `_.includes` for arrays without support for\n * specifying an index to search from.\n *\n * @private\n * @param {Array} [array] The array to inspect.\n * @param {*} target The value to search for.\n * @returns {boolean} Returns `true` if `target` is found, else `false`.\n */\nfunction arrayIncludes(array, value) {\n  var length = array == null ? 0 : array.length;\n  return !!length && baseIndexOf(array, value, 0) > -1;\n}\n\nmodule.exports = arrayIncludes;\n","/**\n * This function is like `arrayIncludes` except that it accepts a comparator.\n *\n * @private\n * @param {Array} [array] The array to inspect.\n * @param {*} target The value to search for.\n * @param {Function} comparator The comparator invoked per element.\n * @returns {boolean} Returns `true` if `target` is found, else `false`.\n */\nfunction arrayIncludesWith(array, value, comparator) {\n  var index = -1,\n      length = array == null ? 0 : array.length;\n\n  while (++index < length) {\n    if (comparator(value, array[index])) {\n      return true;\n    }\n  }\n  return false;\n}\n\nmodule.exports = arrayIncludesWith;\n","var baseTimes = require('./_baseTimes'),\n    isArguments = require('./isArguments'),\n    isArray = require('./isArray'),\n    isBuffer = require('./isBuffer'),\n    isIndex = require('./_isIndex'),\n    isTypedArray = require('./isTypedArray');\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/**\n * Creates an array of the enumerable property names of the array-like `value`.\n *\n * @private\n * @param {*} value The value to query.\n * @param {boolean} inherited Specify returning inherited property names.\n * @returns {Array} Returns the array of property names.\n */\nfunction arrayLikeKeys(value, inherited) {\n  var isArr = isArray(value),\n      isArg = !isArr && isArguments(value),\n      isBuff = !isArr && !isArg && isBuffer(value),\n      isType = !isArr && !isArg && !isBuff && isTypedArray(value),\n      skipIndexes = isArr || isArg || isBuff || isType,\n      result = skipIndexes ? baseTimes(value.length, String) : [],\n      length = result.length;\n\n  for (var key in value) {\n    if ((inherited || hasOwnProperty.call(value, key)) &&\n        !(skipIndexes && (\n           // Safari 9 has enumerable `arguments.length` in strict mode.\n           key == 'length' ||\n           // Node.js 0.10 has enumerable non-index properties on buffers.\n           (isBuff && (key == 'offset' || key == 'parent')) ||\n           // PhantomJS 2 has enumerable non-index properties on typed arrays.\n           (isType && (key == 'buffer' || key == 'byteLength' || key == 'byteOffset')) ||\n           // Skip index properties.\n           isIndex(key, length)\n        ))) {\n      result.push(key);\n    }\n  }\n  return result;\n}\n\nmodule.exports = arrayLikeKeys;\n","/**\n * A specialized version of `_.map` for arrays without support for iteratee\n * shorthands.\n *\n * @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Array} Returns the new mapped array.\n */\nfunction arrayMap(array, iteratee) {\n  var index = -1,\n      length = array == null ? 0 : array.length,\n      result = Array(length);\n\n  while (++index < length) {\n    result[index] = iteratee(array[index], index, array);\n  }\n  return result;\n}\n\nmodule.exports = arrayMap;\n","/**\n * Appends the elements of `values` to `array`.\n *\n * @private\n * @param {Array} array The array to modify.\n * @param {Array} values The values to append.\n * @returns {Array} Returns `array`.\n */\nfunction arrayPush(array, values) {\n  var index = -1,\n      length = values.length,\n      offset = array.length;\n\n  while (++index < length) {\n    array[offset + index] = values[index];\n  }\n  return array;\n}\n\nmodule.exports = arrayPush;\n","/**\n * A specialized version of `_.some` for arrays without support for iteratee\n * shorthands.\n *\n * @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} predicate The function invoked per iteration.\n * @returns {boolean} Returns `true` if any element passes the predicate check,\n *  else `false`.\n */\nfunction arraySome(array, predicate) {\n  var index = -1,\n      length = array == null ? 0 : array.length;\n\n  while (++index < length) {\n    if (predicate(array[index], index, array)) {\n      return true;\n    }\n  }\n  return false;\n}\n\nmodule.exports = arraySome;\n","var baseAssignValue = require('./_baseAssignValue'),\n    eq = require('./eq');\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/**\n * Assigns `value` to `key` of `object` if the existing value is not equivalent\n * using [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * for equality comparisons.\n *\n * @private\n * @param {Object} object The object to modify.\n * @param {string} key The key of the property to assign.\n * @param {*} value The value to assign.\n */\nfunction assignValue(object, key, value) {\n  var objValue = object[key];\n  if (!(hasOwnProperty.call(object, key) && eq(objValue, value)) ||\n      (value === undefined && !(key in object))) {\n    baseAssignValue(object, key, value);\n  }\n}\n\nmodule.exports = assignValue;\n","var eq = require('./eq');\n\n/**\n * Gets the index at which the `key` is found in `array` of key-value pairs.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {*} key The key to search for.\n * @returns {number} Returns the index of the matched value, else `-1`.\n */\nfunction assocIndexOf(array, key) {\n  var length = array.length;\n  while (length--) {\n    if (eq(array[length][0], key)) {\n      return length;\n    }\n  }\n  return -1;\n}\n\nmodule.exports = assocIndexOf;\n","var defineProperty = require('./_defineProperty');\n\n/**\n * The base implementation of `assignValue` and `assignMergeValue` without\n * value checks.\n *\n * @private\n * @param {Object} object The object to modify.\n * @param {string} key The key of the property to assign.\n * @param {*} value The value to assign.\n */\nfunction baseAssignValue(object, key, value) {\n  if (key == '__proto__' && defineProperty) {\n    defineProperty(object, key, {\n      'configurable': true,\n      'enumerable': true,\n      'value': value,\n      'writable': true\n    });\n  } else {\n    object[key] = value;\n  }\n}\n\nmodule.exports = baseAssignValue;\n","var get = require('./get');\n\n/**\n * The base implementation of `_.at` without support for individual paths.\n *\n * @private\n * @param {Object} object The object to iterate over.\n * @param {string[]} paths The property paths to pick.\n * @returns {Array} Returns the picked elements.\n */\nfunction baseAt(object, paths) {\n  var index = -1,\n      length = paths.length,\n      result = Array(length),\n      skip = object == null;\n\n  while (++index < length) {\n    result[index] = skip ? undefined : get(object, paths[index]);\n  }\n  return result;\n}\n\nmodule.exports = baseAt;\n","/**\n * The base implementation of `_.clamp` which doesn't coerce arguments.\n *\n * @private\n * @param {number} number The number to clamp.\n * @param {number} [lower] The lower bound.\n * @param {number} upper The upper bound.\n * @returns {number} Returns the clamped number.\n */\nfunction baseClamp(number, lower, upper) {\n  if (number === number) {\n    if (upper !== undefined) {\n      number = number <= upper ? number : upper;\n    }\n    if (lower !== undefined) {\n      number = number >= lower ? number : lower;\n    }\n  }\n  return number;\n}\n\nmodule.exports = baseClamp;\n","var SetCache = require('./_SetCache'),\n    arrayIncludes = require('./_arrayIncludes'),\n    arrayIncludesWith = require('./_arrayIncludesWith'),\n    arrayMap = require('./_arrayMap'),\n    baseUnary = require('./_baseUnary'),\n    cacheHas = require('./_cacheHas');\n\n/** Used as the size to enable large array optimizations. */\nvar LARGE_ARRAY_SIZE = 200;\n\n/**\n * The base implementation of methods like `_.difference` without support\n * for excluding multiple arrays or iteratee shorthands.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {Array} values The values to exclude.\n * @param {Function} [iteratee] The iteratee invoked per element.\n * @param {Function} [comparator] The comparator invoked per element.\n * @returns {Array} Returns the new array of filtered values.\n */\nfunction baseDifference(array, values, iteratee, comparator) {\n  var index = -1,\n      includes = arrayIncludes,\n      isCommon = true,\n      length = array.length,\n      result = [],\n      valuesLength = values.length;\n\n  if (!length) {\n    return result;\n  }\n  if (iteratee) {\n    values = arrayMap(values, baseUnary(iteratee));\n  }\n  if (comparator) {\n    includes = arrayIncludesWith;\n    isCommon = false;\n  }\n  else if (values.length >= LARGE_ARRAY_SIZE) {\n    includes = cacheHas;\n    isCommon = false;\n    values = new SetCache(values);\n  }\n  outer:\n  while (++index < length) {\n    var value = array[index],\n        computed = iteratee == null ? value : iteratee(value);\n\n    value = (comparator || value !== 0) ? value : 0;\n    if (isCommon && computed === computed) {\n      var valuesIndex = valuesLength;\n      while (valuesIndex--) {\n        if (values[valuesIndex] === computed) {\n          continue outer;\n        }\n      }\n      result.push(value);\n    }\n    else if (!includes(values, computed, comparator)) {\n      result.push(value);\n    }\n  }\n  return result;\n}\n\nmodule.exports = baseDifference;\n","var toInteger = require('./toInteger'),\n    toLength = require('./toLength');\n\n/**\n * The base implementation of `_.fill` without an iteratee call guard.\n *\n * @private\n * @param {Array} array The array to fill.\n * @param {*} value The value to fill `array` with.\n * @param {number} [start=0] The start position.\n * @param {number} [end=array.length] The end position.\n * @returns {Array} Returns `array`.\n */\nfunction baseFill(array, value, start, end) {\n  var length = array.length;\n\n  start = toInteger(start);\n  if (start < 0) {\n    start = -start > length ? 0 : (length + start);\n  }\n  end = (end === undefined || end > length) ? length : toInteger(end);\n  if (end < 0) {\n    end += length;\n  }\n  end = start > end ? 0 : toLength(end);\n  while (start < end) {\n    array[start++] = value;\n  }\n  return array;\n}\n\nmodule.exports = baseFill;\n","/**\n * The base implementation of `_.findIndex` and `_.findLastIndex` without\n * support for iteratee shorthands.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {Function} predicate The function invoked per iteration.\n * @param {number} fromIndex The index to search from.\n * @param {boolean} [fromRight] Specify iterating from right to left.\n * @returns {number} Returns the index of the matched value, else `-1`.\n */\nfunction baseFindIndex(array, predicate, fromIndex, fromRight) {\n  var length = array.length,\n      index = fromIndex + (fromRight ? 1 : -1);\n\n  while ((fromRight ? index-- : ++index < length)) {\n    if (predicate(array[index], index, array)) {\n      return index;\n    }\n  }\n  return -1;\n}\n\nmodule.exports = baseFindIndex;\n","var arrayPush = require('./_arrayPush'),\n    isFlattenable = require('./_isFlattenable');\n\n/**\n * The base implementation of `_.flatten` with support for restricting flattening.\n *\n * @private\n * @param {Array} array The array to flatten.\n * @param {number} depth The maximum recursion depth.\n * @param {boolean} [predicate=isFlattenable] The function invoked per iteration.\n * @param {boolean} [isStrict] Restrict to values that pass `predicate` checks.\n * @param {Array} [result=[]] The initial result value.\n * @returns {Array} Returns the new flattened array.\n */\nfunction baseFlatten(array, depth, predicate, isStrict, result) {\n  var index = -1,\n      length = array.length;\n\n  predicate || (predicate = isFlattenable);\n  result || (result = []);\n\n  while (++index < length) {\n    var value = array[index];\n    if (depth > 0 && predicate(value)) {\n      if (depth > 1) {\n        // Recursively flatten arrays (susceptible to call stack limits).\n        baseFlatten(value, depth - 1, predicate, isStrict, result);\n      } else {\n        arrayPush(result, value);\n      }\n    } else if (!isStrict) {\n      result[result.length] = value;\n    }\n  }\n  return result;\n}\n\nmodule.exports = baseFlatten;\n","var castPath = require('./_castPath'),\n    toKey = require('./_toKey');\n\n/**\n * The base implementation of `_.get` without support for default values.\n *\n * @private\n * @param {Object} object The object to query.\n * @param {Array|string} path The path of the property to get.\n * @returns {*} Returns the resolved value.\n */\nfunction baseGet(object, path) {\n  path = castPath(path, object);\n\n  var index = 0,\n      length = path.length;\n\n  while (object != null && index < length) {\n    object = object[toKey(path[index++])];\n  }\n  return (index && index == length) ? object : undefined;\n}\n\nmodule.exports = baseGet;\n","var arrayPush = require('./_arrayPush'),\n    isArray = require('./isArray');\n\n/**\n * The base implementation of `getAllKeys` and `getAllKeysIn` which uses\n * `keysFunc` and `symbolsFunc` to get the enumerable property names and\n * symbols of `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @param {Function} keysFunc The function to get the keys of `object`.\n * @param {Function} symbolsFunc The function to get the symbols of `object`.\n * @returns {Array} Returns the array of property names and symbols.\n */\nfunction baseGetAllKeys(object, keysFunc, symbolsFunc) {\n  var result = keysFunc(object);\n  return isArray(object) ? result : arrayPush(result, symbolsFunc(object));\n}\n\nmodule.exports = baseGetAllKeys;\n","/**\n * The base implementation of `_.hasIn` without support for deep paths.\n *\n * @private\n * @param {Object} [object] The object to query.\n * @param {Array|string} key The key to check.\n * @returns {boolean} Returns `true` if `key` exists, else `false`.\n */\nfunction baseHasIn(object, key) {\n  return object != null && key in Object(object);\n}\n\nmodule.exports = baseHasIn;\n","var baseFindIndex = require('./_baseFindIndex'),\n    baseIsNaN = require('./_baseIsNaN'),\n    strictIndexOf = require('./_strictIndexOf');\n\n/**\n * The base implementation of `_.indexOf` without `fromIndex` bounds checks.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {*} value The value to search for.\n * @param {number} fromIndex The index to search from.\n * @returns {number} Returns the index of the matched value, else `-1`.\n */\nfunction baseIndexOf(array, value, fromIndex) {\n  return value === value\n    ? strictIndexOf(array, value, fromIndex)\n    : baseFindIndex(array, baseIsNaN, fromIndex);\n}\n\nmodule.exports = baseIndexOf;\n","/**\n * This function is like `baseIndexOf` except that it accepts a comparator.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {*} value The value to search for.\n * @param {number} fromIndex The index to search from.\n * @param {Function} comparator The comparator invoked per element.\n * @returns {number} Returns the index of the matched value, else `-1`.\n */\nfunction baseIndexOfWith(array, value, fromIndex, comparator) {\n  var index = fromIndex - 1,\n      length = array.length;\n\n  while (++index < length) {\n    if (comparator(array[index], value)) {\n      return index;\n    }\n  }\n  return -1;\n}\n\nmodule.exports = baseIndexOfWith;\n","var SetCache = require('./_SetCache'),\n    arrayIncludes = require('./_arrayIncludes'),\n    arrayIncludesWith = require('./_arrayIncludesWith'),\n    arrayMap = require('./_arrayMap'),\n    baseUnary = require('./_baseUnary'),\n    cacheHas = require('./_cacheHas');\n\n/* Built-in method references for those with the same name as other `lodash` methods. */\nvar nativeMin = Math.min;\n\n/**\n * The base implementation of methods like `_.intersection`, without support\n * for iteratee shorthands, that accepts an array of arrays to inspect.\n *\n * @private\n * @param {Array} arrays The arrays to inspect.\n * @param {Function} [iteratee] The iteratee invoked per element.\n * @param {Function} [comparator] The comparator invoked per element.\n * @returns {Array} Returns the new array of shared values.\n */\nfunction baseIntersection(arrays, iteratee, comparator) {\n  var includes = comparator ? arrayIncludesWith : arrayIncludes,\n      length = arrays[0].length,\n      othLength = arrays.length,\n      othIndex = othLength,\n      caches = Array(othLength),\n      maxLength = Infinity,\n      result = [];\n\n  while (othIndex--) {\n    var array = arrays[othIndex];\n    if (othIndex && iteratee) {\n      array = arrayMap(array, baseUnary(iteratee));\n    }\n    maxLength = nativeMin(array.length, maxLength);\n    caches[othIndex] = !comparator && (iteratee || (length >= 120 && array.length >= 120))\n      ? new SetCache(othIndex && array)\n      : undefined;\n  }\n  array = arrays[0];\n\n  var index = -1,\n      seen = caches[0];\n\n  outer:\n  while (++index < length && result.length < maxLength) {\n    var value = array[index],\n        computed = iteratee ? iteratee(value) : value;\n\n    value = (comparator || value !== 0) ? value : 0;\n    if (!(seen\n          ? cacheHas(seen, computed)\n          : includes(result, computed, comparator)\n        )) {\n      othIndex = othLength;\n      while (--othIndex) {\n        var cache = caches[othIndex];\n        if (!(cache\n              ? cacheHas(cache, computed)\n              : includes(arrays[othIndex], computed, comparator))\n            ) {\n          continue outer;\n        }\n      }\n      if (seen) {\n        seen.push(computed);\n      }\n      result.push(value);\n    }\n  }\n  return result;\n}\n\nmodule.exports = baseIntersection;\n","var baseGetTag = require('./_baseGetTag'),\n    isObjectLike = require('./isObjectLike');\n\n/** `Object#toString` result references. */\nvar argsTag = '[object Arguments]';\n\n/**\n * The base implementation of `_.isArguments`.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an `arguments` object,\n */\nfunction baseIsArguments(value) {\n  return isObjectLike(value) && baseGetTag(value) == argsTag;\n}\n\nmodule.exports = baseIsArguments;\n","var baseIsEqualDeep = require('./_baseIsEqualDeep'),\n    isObjectLike = require('./isObjectLike');\n\n/**\n * The base implementation of `_.isEqual` which supports partial comparisons\n * and tracks traversed objects.\n *\n * @private\n * @param {*} value The value to compare.\n * @param {*} other The other value to compare.\n * @param {boolean} bitmask The bitmask flags.\n *  1 - Unordered comparison\n *  2 - Partial comparison\n * @param {Function} [customizer] The function to customize comparisons.\n * @param {Object} [stack] Tracks traversed `value` and `other` objects.\n * @returns {boolean} Returns `true` if the values are equivalent, else `false`.\n */\nfunction baseIsEqual(value, other, bitmask, customizer, stack) {\n  if (value === other) {\n    return true;\n  }\n  if (value == null || other == null || (!isObjectLike(value) && !isObjectLike(other))) {\n    return value !== value && other !== other;\n  }\n  return baseIsEqualDeep(value, other, bitmask, customizer, baseIsEqual, stack);\n}\n\nmodule.exports = baseIsEqual;\n","var Stack = require('./_Stack'),\n    equalArrays = require('./_equalArrays'),\n    equalByTag = require('./_equalByTag'),\n    equalObjects = require('./_equalObjects'),\n    getTag = require('./_getTag'),\n    isArray = require('./isArray'),\n    isBuffer = require('./isBuffer'),\n    isTypedArray = require('./isTypedArray');\n\n/** Used to compose bitmasks for value comparisons. */\nvar COMPARE_PARTIAL_FLAG = 1;\n\n/** `Object#toString` result references. */\nvar argsTag = '[object Arguments]',\n    arrayTag = '[object Array]',\n    objectTag = '[object Object]';\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/**\n * A specialized version of `baseIsEqual` for arrays and objects which performs\n * deep comparisons and tracks traversed objects enabling objects with circular\n * references to be compared.\n *\n * @private\n * @param {Object} object The object to compare.\n * @param {Object} other The other object to compare.\n * @param {number} bitmask The bitmask flags. See `baseIsEqual` for more details.\n * @param {Function} customizer The function to customize comparisons.\n * @param {Function} equalFunc The function to determine equivalents of values.\n * @param {Object} [stack] Tracks traversed `object` and `other` objects.\n * @returns {boolean} Returns `true` if the objects are equivalent, else `false`.\n */\nfunction baseIsEqualDeep(object, other, bitmask, customizer, equalFunc, stack) {\n  var objIsArr = isArray(object),\n      othIsArr = isArray(other),\n      objTag = objIsArr ? arrayTag : getTag(object),\n      othTag = othIsArr ? arrayTag : getTag(other);\n\n  objTag = objTag == argsTag ? objectTag : objTag;\n  othTag = othTag == argsTag ? objectTag : othTag;\n\n  var objIsObj = objTag == objectTag,\n      othIsObj = othTag == objectTag,\n      isSameTag = objTag == othTag;\n\n  if (isSameTag && isBuffer(object)) {\n    if (!isBuffer(other)) {\n      return false;\n    }\n    objIsArr = true;\n    objIsObj = false;\n  }\n  if (isSameTag && !objIsObj) {\n    stack || (stack = new Stack);\n    return (objIsArr || isTypedArray(object))\n      ? equalArrays(object, other, bitmask, customizer, equalFunc, stack)\n      : equalByTag(object, other, objTag, bitmask, customizer, equalFunc, stack);\n  }\n  if (!(bitmask & COMPARE_PARTIAL_FLAG)) {\n    var objIsWrapped = objIsObj && hasOwnProperty.call(object, '__wrapped__'),\n        othIsWrapped = othIsObj && hasOwnProperty.call(other, '__wrapped__');\n\n    if (objIsWrapped || othIsWrapped) {\n      var objUnwrapped = objIsWrapped ? object.value() : object,\n          othUnwrapped = othIsWrapped ? other.value() : other;\n\n      stack || (stack = new Stack);\n      return equalFunc(objUnwrapped, othUnwrapped, bitmask, customizer, stack);\n    }\n  }\n  if (!isSameTag) {\n    return false;\n  }\n  stack || (stack = new Stack);\n  return equalObjects(object, other, bitmask, customizer, equalFunc, stack);\n}\n\nmodule.exports = baseIsEqualDeep;\n","var Stack = require('./_Stack'),\n    baseIsEqual = require('./_baseIsEqual');\n\n/** Used to compose bitmasks for value comparisons. */\nvar COMPARE_PARTIAL_FLAG = 1,\n    COMPARE_UNORDERED_FLAG = 2;\n\n/**\n * The base implementation of `_.isMatch` without support for iteratee shorthands.\n *\n * @private\n * @param {Object} object The object to inspect.\n * @param {Object} source The object of property values to match.\n * @param {Array} matchData The property names, values, and compare flags to match.\n * @param {Function} [customizer] The function to customize comparisons.\n * @returns {boolean} Returns `true` if `object` is a match, else `false`.\n */\nfunction baseIsMatch(object, source, matchData, customizer) {\n  var index = matchData.length,\n      length = index,\n      noCustomizer = !customizer;\n\n  if (object == null) {\n    return !length;\n  }\n  object = Object(object);\n  while (index--) {\n    var data = matchData[index];\n    if ((noCustomizer && data[2])\n          ? data[1] !== object[data[0]]\n          : !(data[0] in object)\n        ) {\n      return false;\n    }\n  }\n  while (++index < length) {\n    data = matchData[index];\n    var key = data[0],\n        objValue = object[key],\n        srcValue = data[1];\n\n    if (noCustomizer && data[2]) {\n      if (objValue === undefined && !(key in object)) {\n        return false;\n      }\n    } else {\n      var stack = new Stack;\n      if (customizer) {\n        var result = customizer(objValue, srcValue, key, object, source, stack);\n      }\n      if (!(result === undefined\n            ? baseIsEqual(srcValue, objValue, COMPARE_PARTIAL_FLAG | COMPARE_UNORDERED_FLAG, customizer, stack)\n            : result\n          )) {\n        return false;\n      }\n    }\n  }\n  return true;\n}\n\nmodule.exports = baseIsMatch;\n","/**\n * The base implementation of `_.isNaN` without support for number objects.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is `NaN`, else `false`.\n */\nfunction baseIsNaN(value) {\n  return value !== value;\n}\n\nmodule.exports = baseIsNaN;\n","var isFunction = require('./isFunction'),\n    isMasked = require('./_isMasked'),\n    isObject = require('./isObject'),\n    toSource = require('./_toSource');\n\n/**\n * Used to match `RegExp`\n * [syntax characters](http://ecma-international.org/ecma-262/7.0/#sec-patterns).\n */\nvar reRegExpChar = /[\\\\^$.*+?()[\\]{}|]/g;\n\n/** Used to detect host constructors (Safari). */\nvar reIsHostCtor = /^\\[object .+?Constructor\\]$/;\n\n/** Used for built-in method references. */\nvar funcProto = Function.prototype,\n    objectProto = Object.prototype;\n\n/** Used to resolve the decompiled source of functions. */\nvar funcToString = funcProto.toString;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/** Used to detect if a method is native. */\nvar reIsNative = RegExp('^' +\n  funcToString.call(hasOwnProperty).replace(reRegExpChar, '\\\\$&')\n  .replace(/hasOwnProperty|(function).*?(?=\\\\\\()| for .+?(?=\\\\\\])/g, '$1.*?') + '$'\n);\n\n/**\n * The base implementation of `_.isNative` without bad shim checks.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a native function,\n *  else `false`.\n */\nfunction baseIsNative(value) {\n  if (!isObject(value) || isMasked(value)) {\n    return false;\n  }\n  var pattern = isFunction(value) ? reIsNative : reIsHostCtor;\n  return pattern.test(toSource(value));\n}\n\nmodule.exports = baseIsNative;\n","var baseGetTag = require('./_baseGetTag'),\n    isLength = require('./isLength'),\n    isObjectLike = require('./isObjectLike');\n\n/** `Object#toString` result references. */\nvar argsTag = '[object Arguments]',\n    arrayTag = '[object Array]',\n    boolTag = '[object Boolean]',\n    dateTag = '[object Date]',\n    errorTag = '[object Error]',\n    funcTag = '[object Function]',\n    mapTag = '[object Map]',\n    numberTag = '[object Number]',\n    objectTag = '[object Object]',\n    regexpTag = '[object RegExp]',\n    setTag = '[object Set]',\n    stringTag = '[object String]',\n    weakMapTag = '[object WeakMap]';\n\nvar arrayBufferTag = '[object ArrayBuffer]',\n    dataViewTag = '[object DataView]',\n    float32Tag = '[object Float32Array]',\n    float64Tag = '[object Float64Array]',\n    int8Tag = '[object Int8Array]',\n    int16Tag = '[object Int16Array]',\n    int32Tag = '[object Int32Array]',\n    uint8Tag = '[object Uint8Array]',\n    uint8ClampedTag = '[object Uint8ClampedArray]',\n    uint16Tag = '[object Uint16Array]',\n    uint32Tag = '[object Uint32Array]';\n\n/** Used to identify `toStringTag` values of typed arrays. */\nvar typedArrayTags = {};\ntypedArrayTags[float32Tag] = typedArrayTags[float64Tag] =\ntypedArrayTags[int8Tag] = typedArrayTags[int16Tag] =\ntypedArrayTags[int32Tag] = typedArrayTags[uint8Tag] =\ntypedArrayTags[uint8ClampedTag] = typedArrayTags[uint16Tag] =\ntypedArrayTags[uint32Tag] = true;\ntypedArrayTags[argsTag] = typedArrayTags[arrayTag] =\ntypedArrayTags[arrayBufferTag] = typedArrayTags[boolTag] =\ntypedArrayTags[dataViewTag] = typedArrayTags[dateTag] =\ntypedArrayTags[errorTag] = typedArrayTags[funcTag] =\ntypedArrayTags[mapTag] = typedArrayTags[numberTag] =\ntypedArrayTags[objectTag] = typedArrayTags[regexpTag] =\ntypedArrayTags[setTag] = typedArrayTags[stringTag] =\ntypedArrayTags[weakMapTag] = false;\n\n/**\n * The base implementation of `_.isTypedArray` without Node.js optimizations.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a typed array, else `false`.\n */\nfunction baseIsTypedArray(value) {\n  return isObjectLike(value) &&\n    isLength(value.length) && !!typedArrayTags[baseGetTag(value)];\n}\n\nmodule.exports = baseIsTypedArray;\n","var baseMatches = require('./_baseMatches'),\n    baseMatchesProperty = require('./_baseMatchesProperty'),\n    identity = require('./identity'),\n    isArray = require('./isArray'),\n    property = require('./property');\n\n/**\n * The base implementation of `_.iteratee`.\n *\n * @private\n * @param {*} [value=_.identity] The value to convert to an iteratee.\n * @returns {Function} Returns the iteratee.\n */\nfunction baseIteratee(value) {\n  // Don't store the `typeof` result in a variable to avoid a JIT bug in Safari 9.\n  // See https://bugs.webkit.org/show_bug.cgi?id=156034 for more details.\n  if (typeof value == 'function') {\n    return value;\n  }\n  if (value == null) {\n    return identity;\n  }\n  if (typeof value == 'object') {\n    return isArray(value)\n      ? baseMatchesProperty(value[0], value[1])\n      : baseMatches(value);\n  }\n  return property(value);\n}\n\nmodule.exports = baseIteratee;\n","var isPrototype = require('./_isPrototype'),\n    nativeKeys = require('./_nativeKeys');\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/**\n * The base implementation of `_.keys` which doesn't treat sparse arrays as dense.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names.\n */\nfunction baseKeys(object) {\n  if (!isPrototype(object)) {\n    return nativeKeys(object);\n  }\n  var result = [];\n  for (var key in Object(object)) {\n    if (hasOwnProperty.call(object, key) && key != 'constructor') {\n      result.push(key);\n    }\n  }\n  return result;\n}\n\nmodule.exports = baseKeys;\n","var baseIsMatch = require('./_baseIsMatch'),\n    getMatchData = require('./_getMatchData'),\n    matchesStrictComparable = require('./_matchesStrictComparable');\n\n/**\n * The base implementation of `_.matches` which doesn't clone `source`.\n *\n * @private\n * @param {Object} source The object of property values to match.\n * @returns {Function} Returns the new spec function.\n */\nfunction baseMatches(source) {\n  var matchData = getMatchData(source);\n  if (matchData.length == 1 && matchData[0][2]) {\n    return matchesStrictComparable(matchData[0][0], matchData[0][1]);\n  }\n  return function(object) {\n    return object === source || baseIsMatch(object, source, matchData);\n  };\n}\n\nmodule.exports = baseMatches;\n","var baseIsEqual = require('./_baseIsEqual'),\n    get = require('./get'),\n    hasIn = require('./hasIn'),\n    isKey = require('./_isKey'),\n    isStrictComparable = require('./_isStrictComparable'),\n    matchesStrictComparable = require('./_matchesStrictComparable'),\n    toKey = require('./_toKey');\n\n/** Used to compose bitmasks for value comparisons. */\nvar COMPARE_PARTIAL_FLAG = 1,\n    COMPARE_UNORDERED_FLAG = 2;\n\n/**\n * The base implementation of `_.matchesProperty` which doesn't clone `srcValue`.\n *\n * @private\n * @param {string} path The path of the property to get.\n * @param {*} srcValue The value to match.\n * @returns {Function} Returns the new spec function.\n */\nfunction baseMatchesProperty(path, srcValue) {\n  if (isKey(path) && isStrictComparable(srcValue)) {\n    return matchesStrictComparable(toKey(path), srcValue);\n  }\n  return function(object) {\n    var objValue = get(object, path);\n    return (objValue === undefined && objValue === srcValue)\n      ? hasIn(object, path)\n      : baseIsEqual(srcValue, objValue, COMPARE_PARTIAL_FLAG | COMPARE_UNORDERED_FLAG);\n  };\n}\n\nmodule.exports = baseMatchesProperty;\n","var isIndex = require('./_isIndex');\n\n/**\n * The base implementation of `_.nth` which doesn't coerce arguments.\n *\n * @private\n * @param {Array} array The array to query.\n * @param {number} n The index of the element to return.\n * @returns {*} Returns the nth element of `array`.\n */\nfunction baseNth(array, n) {\n  var length = array.length;\n  if (!length) {\n    return;\n  }\n  n += n < 0 ? length : 0;\n  return isIndex(n, length) ? array[n] : undefined;\n}\n\nmodule.exports = baseNth;\n","/**\n * The base implementation of `_.property` without support for deep paths.\n *\n * @private\n * @param {string} key The key of the property to get.\n * @returns {Function} Returns the new accessor function.\n */\nfunction baseProperty(key) {\n  return function(object) {\n    return object == null ? undefined : object[key];\n  };\n}\n\nmodule.exports = baseProperty;\n","var baseGet = require('./_baseGet');\n\n/**\n * A specialized version of `baseProperty` which supports deep paths.\n *\n * @private\n * @param {Array|string} path The path of the property to get.\n * @returns {Function} Returns the new accessor function.\n */\nfunction basePropertyDeep(path) {\n  return function(object) {\n    return baseGet(object, path);\n  };\n}\n\nmodule.exports = basePropertyDeep;\n","var arrayMap = require('./_arrayMap'),\n    baseIndexOf = require('./_baseIndexOf'),\n    baseIndexOfWith = require('./_baseIndexOfWith'),\n    baseUnary = require('./_baseUnary'),\n    copyArray = require('./_copyArray');\n\n/** Used for built-in method references. */\nvar arrayProto = Array.prototype;\n\n/** Built-in value references. */\nvar splice = arrayProto.splice;\n\n/**\n * The base implementation of `_.pullAllBy` without support for iteratee\n * shorthands.\n *\n * @private\n * @param {Array} array The array to modify.\n * @param {Array} values The values to remove.\n * @param {Function} [iteratee] The iteratee invoked per element.\n * @param {Function} [comparator] The comparator invoked per element.\n * @returns {Array} Returns `array`.\n */\nfunction basePullAll(array, values, iteratee, comparator) {\n  var indexOf = comparator ? baseIndexOfWith : baseIndexOf,\n      index = -1,\n      length = values.length,\n      seen = array;\n\n  if (array === values) {\n    values = copyArray(values);\n  }\n  if (iteratee) {\n    seen = arrayMap(array, baseUnary(iteratee));\n  }\n  while (++index < length) {\n    var fromIndex = 0,\n        value = values[index],\n        computed = iteratee ? iteratee(value) : value;\n\n    while ((fromIndex = indexOf(seen, computed, fromIndex, comparator)) > -1) {\n      if (seen !== array) {\n        splice.call(seen, fromIndex, 1);\n      }\n      splice.call(array, fromIndex, 1);\n    }\n  }\n  return array;\n}\n\nmodule.exports = basePullAll;\n","var baseUnset = require('./_baseUnset'),\n    isIndex = require('./_isIndex');\n\n/** Used for built-in method references. */\nvar arrayProto = Array.prototype;\n\n/** Built-in value references. */\nvar splice = arrayProto.splice;\n\n/**\n * The base implementation of `_.pullAt` without support for individual\n * indexes or capturing the removed elements.\n *\n * @private\n * @param {Array} array The array to modify.\n * @param {number[]} indexes The indexes of elements to remove.\n * @returns {Array} Returns `array`.\n */\nfunction basePullAt(array, indexes) {\n  var length = array ? indexes.length : 0,\n      lastIndex = length - 1;\n\n  while (length--) {\n    var index = indexes[length];\n    if (length == lastIndex || index !== previous) {\n      var previous = index;\n      if (isIndex(index)) {\n        splice.call(array, index, 1);\n      } else {\n        baseUnset(array, index);\n      }\n    }\n  }\n  return array;\n}\n\nmodule.exports = basePullAt;\n","var identity = require('./identity'),\n    overRest = require('./_overRest'),\n    setToString = require('./_setToString');\n\n/**\n * The base implementation of `_.rest` which doesn't validate or coerce arguments.\n *\n * @private\n * @param {Function} func The function to apply a rest parameter to.\n * @param {number} [start=func.length-1] The start position of the rest parameter.\n * @returns {Function} Returns the new function.\n */\nfunction baseRest(func, start) {\n  return setToString(overRest(func, start, identity), func + '');\n}\n\nmodule.exports = baseRest;\n","var assignValue = require('./_assignValue'),\n    castPath = require('./_castPath'),\n    isIndex = require('./_isIndex'),\n    isObject = require('./isObject'),\n    toKey = require('./_toKey');\n\n/**\n * The base implementation of `_.set`.\n *\n * @private\n * @param {Object} object The object to modify.\n * @param {Array|string} path The path of the property to set.\n * @param {*} value The value to set.\n * @param {Function} [customizer] The function to customize path creation.\n * @returns {Object} Returns `object`.\n */\nfunction baseSet(object, path, value, customizer) {\n  if (!isObject(object)) {\n    return object;\n  }\n  path = castPath(path, object);\n\n  var index = -1,\n      length = path.length,\n      lastIndex = length - 1,\n      nested = object;\n\n  while (nested != null && ++index < length) {\n    var key = toKey(path[index]),\n        newValue = value;\n\n    if (key === '__proto__' || key === 'constructor' || key === 'prototype') {\n      return object;\n    }\n\n    if (index != lastIndex) {\n      var objValue = nested[key];\n      newValue = customizer ? customizer(objValue, key, nested) : undefined;\n      if (newValue === undefined) {\n        newValue = isObject(objValue)\n          ? objValue\n          : (isIndex(path[index + 1]) ? [] : {});\n      }\n    }\n    assignValue(nested, key, newValue);\n    nested = nested[key];\n  }\n  return object;\n}\n\nmodule.exports = baseSet;\n","var constant = require('./constant'),\n    defineProperty = require('./_defineProperty'),\n    identity = require('./identity');\n\n/**\n * The base implementation of `setToString` without support for hot loop shorting.\n *\n * @private\n * @param {Function} func The function to modify.\n * @param {Function} string The `toString` result.\n * @returns {Function} Returns `func`.\n */\nvar baseSetToString = !defineProperty ? identity : function(func, string) {\n  return defineProperty(func, 'toString', {\n    'configurable': true,\n    'enumerable': false,\n    'value': constant(string),\n    'writable': true\n  });\n};\n\nmodule.exports = baseSetToString;\n","/**\n * The base implementation of `_.slice` without an iteratee call guard.\n *\n * @private\n * @param {Array} array The array to slice.\n * @param {number} [start=0] The start position.\n * @param {number} [end=array.length] The end position.\n * @returns {Array} Returns the slice of `array`.\n */\nfunction baseSlice(array, start, end) {\n  var index = -1,\n      length = array.length;\n\n  if (start < 0) {\n    start = -start > length ? 0 : (length + start);\n  }\n  end = end > length ? length : end;\n  if (end < 0) {\n    end += length;\n  }\n  length = start > end ? 0 : ((end - start) >>> 0);\n  start >>>= 0;\n\n  var result = Array(length);\n  while (++index < length) {\n    result[index] = array[index + start];\n  }\n  return result;\n}\n\nmodule.exports = baseSlice;\n","var baseSortedIndexBy = require('./_baseSortedIndexBy'),\n    identity = require('./identity'),\n    isSymbol = require('./isSymbol');\n\n/** Used as references for the maximum length and index of an array. */\nvar MAX_ARRAY_LENGTH = 4294967295,\n    HALF_MAX_ARRAY_LENGTH = MAX_ARRAY_LENGTH >>> 1;\n\n/**\n * The base implementation of `_.sortedIndex` and `_.sortedLastIndex` which\n * performs a binary search of `array` to determine the index at which `value`\n * should be inserted into `array` in order to maintain its sort order.\n *\n * @private\n * @param {Array} array The sorted array to inspect.\n * @param {*} value The value to evaluate.\n * @param {boolean} [retHighest] Specify returning the highest qualified index.\n * @returns {number} Returns the index at which `value` should be inserted\n *  into `array`.\n */\nfunction baseSortedIndex(array, value, retHighest) {\n  var low = 0,\n      high = array == null ? low : array.length;\n\n  if (typeof value == 'number' && value === value && high <= HALF_MAX_ARRAY_LENGTH) {\n    while (low < high) {\n      var mid = (low + high) >>> 1,\n          computed = array[mid];\n\n      if (computed !== null && !isSymbol(computed) &&\n          (retHighest ? (computed <= value) : (computed < value))) {\n        low = mid + 1;\n      } else {\n        high = mid;\n      }\n    }\n    return high;\n  }\n  return baseSortedIndexBy(array, value, identity, retHighest);\n}\n\nmodule.exports = baseSortedIndex;\n","var isSymbol = require('./isSymbol');\n\n/** Used as references for the maximum length and index of an array. */\nvar MAX_ARRAY_LENGTH = 4294967295,\n    MAX_ARRAY_INDEX = MAX_ARRAY_LENGTH - 1;\n\n/* Built-in method references for those with the same name as other `lodash` methods. */\nvar nativeFloor = Math.floor,\n    nativeMin = Math.min;\n\n/**\n * The base implementation of `_.sortedIndexBy` and `_.sortedLastIndexBy`\n * which invokes `iteratee` for `value` and each element of `array` to compute\n * their sort ranking. The iteratee is invoked with one argument; (value).\n *\n * @private\n * @param {Array} array The sorted array to inspect.\n * @param {*} value The value to evaluate.\n * @param {Function} iteratee The iteratee invoked per element.\n * @param {boolean} [retHighest] Specify returning the highest qualified index.\n * @returns {number} Returns the index at which `value` should be inserted\n *  into `array`.\n */\nfunction baseSortedIndexBy(array, value, iteratee, retHighest) {\n  var low = 0,\n      high = array == null ? 0 : array.length;\n  if (high === 0) {\n    return 0;\n  }\n\n  value = iteratee(value);\n  var valIsNaN = value !== value,\n      valIsNull = value === null,\n      valIsSymbol = isSymbol(value),\n      valIsUndefined = value === undefined;\n\n  while (low < high) {\n    var mid = nativeFloor((low + high) / 2),\n        computed = iteratee(array[mid]),\n        othIsDefined = computed !== undefined,\n        othIsNull = computed === null,\n        othIsReflexive = computed === computed,\n        othIsSymbol = isSymbol(computed);\n\n    if (valIsNaN) {\n      var setLow = retHighest || othIsReflexive;\n    } else if (valIsUndefined) {\n      setLow = othIsReflexive && (retHighest || othIsDefined);\n    } else if (valIsNull) {\n      setLow = othIsReflexive && othIsDefined && (retHighest || !othIsNull);\n    } else if (valIsSymbol) {\n      setLow = othIsReflexive && othIsDefined && !othIsNull && (retHighest || !othIsSymbol);\n    } else if (othIsNull || othIsSymbol) {\n      setLow = false;\n    } else {\n      setLow = retHighest ? (computed <= value) : (computed < value);\n    }\n    if (setLow) {\n      low = mid + 1;\n    } else {\n      high = mid;\n    }\n  }\n  return nativeMin(high, MAX_ARRAY_INDEX);\n}\n\nmodule.exports = baseSortedIndexBy;\n","var eq = require('./eq');\n\n/**\n * The base implementation of `_.sortedUniq` and `_.sortedUniqBy` without\n * support for iteratee shorthands.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {Function} [iteratee] The iteratee invoked per element.\n * @returns {Array} Returns the new duplicate free array.\n */\nfunction baseSortedUniq(array, iteratee) {\n  var index = -1,\n      length = array.length,\n      resIndex = 0,\n      result = [];\n\n  while (++index < length) {\n    var value = array[index],\n        computed = iteratee ? iteratee(value) : value;\n\n    if (!index || !eq(computed, seen)) {\n      var seen = computed;\n      result[resIndex++] = value === 0 ? 0 : value;\n    }\n  }\n  return result;\n}\n\nmodule.exports = baseSortedUniq;\n","/**\n * The base implementation of `_.times` without support for iteratee shorthands\n * or max array length checks.\n *\n * @private\n * @param {number} n The number of times to invoke `iteratee`.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Array} Returns the array of results.\n */\nfunction baseTimes(n, iteratee) {\n  var index = -1,\n      result = Array(n);\n\n  while (++index < n) {\n    result[index] = iteratee(index);\n  }\n  return result;\n}\n\nmodule.exports = baseTimes;\n","var Symbol = require('./_Symbol'),\n    arrayMap = require('./_arrayMap'),\n    isArray = require('./isArray'),\n    isSymbol = require('./isSymbol');\n\n/** Used as references for various `Number` constants. */\nvar INFINITY = 1 / 0;\n\n/** Used to convert symbols to primitives and strings. */\nvar symbolProto = Symbol ? Symbol.prototype : undefined,\n    symbolToString = symbolProto ? symbolProto.toString : undefined;\n\n/**\n * The base implementation of `_.toString` which doesn't convert nullish\n * values to empty strings.\n *\n * @private\n * @param {*} value The value to process.\n * @returns {string} Returns the string.\n */\nfunction baseToString(value) {\n  // Exit early for strings to avoid a performance hit in some environments.\n  if (typeof value == 'string') {\n    return value;\n  }\n  if (isArray(value)) {\n    // Recursively convert values (susceptible to call stack limits).\n    return arrayMap(value, baseToString) + '';\n  }\n  if (isSymbol(value)) {\n    return symbolToString ? symbolToString.call(value) : '';\n  }\n  var result = (value + '');\n  return (result == '0' && (1 / value) == -INFINITY) ? '-0' : result;\n}\n\nmodule.exports = baseToString;\n","var trimmedEndIndex = require('./_trimmedEndIndex');\n\n/** Used to match leading whitespace. */\nvar reTrimStart = /^\\s+/;\n\n/**\n * The base implementation of `_.trim`.\n *\n * @private\n * @param {string} string The string to trim.\n * @returns {string} Returns the trimmed string.\n */\nfunction baseTrim(string) {\n  return string\n    ? string.slice(0, trimmedEndIndex(string) + 1).replace(reTrimStart, '')\n    : string;\n}\n\nmodule.exports = baseTrim;\n","/**\n * The base implementation of `_.unary` without support for storing metadata.\n *\n * @private\n * @param {Function} func The function to cap arguments for.\n * @returns {Function} Returns the new capped function.\n */\nfunction baseUnary(func) {\n  return function(value) {\n    return func(value);\n  };\n}\n\nmodule.exports = baseUnary;\n","var SetCache = require('./_SetCache'),\n    arrayIncludes = require('./_arrayIncludes'),\n    arrayIncludesWith = require('./_arrayIncludesWith'),\n    cacheHas = require('./_cacheHas'),\n    createSet = require('./_createSet'),\n    setToArray = require('./_setToArray');\n\n/** Used as the size to enable large array optimizations. */\nvar LARGE_ARRAY_SIZE = 200;\n\n/**\n * The base implementation of `_.uniqBy` without support for iteratee shorthands.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {Function} [iteratee] The iteratee invoked per element.\n * @param {Function} [comparator] The comparator invoked per element.\n * @returns {Array} Returns the new duplicate free array.\n */\nfunction baseUniq(array, iteratee, comparator) {\n  var index = -1,\n      includes = arrayIncludes,\n      length = array.length,\n      isCommon = true,\n      result = [],\n      seen = result;\n\n  if (comparator) {\n    isCommon = false;\n    includes = arrayIncludesWith;\n  }\n  else if (length >= LARGE_ARRAY_SIZE) {\n    var set = iteratee ? null : createSet(array);\n    if (set) {\n      return setToArray(set);\n    }\n    isCommon = false;\n    includes = cacheHas;\n    seen = new SetCache;\n  }\n  else {\n    seen = iteratee ? [] : result;\n  }\n  outer:\n  while (++index < length) {\n    var value = array[index],\n        computed = iteratee ? iteratee(value) : value;\n\n    value = (comparator || value !== 0) ? value : 0;\n    if (isCommon && computed === computed) {\n      var seenIndex = seen.length;\n      while (seenIndex--) {\n        if (seen[seenIndex] === computed) {\n          continue outer;\n        }\n      }\n      if (iteratee) {\n        seen.push(computed);\n      }\n      result.push(value);\n    }\n    else if (!includes(seen, computed, comparator)) {\n      if (seen !== result) {\n        seen.push(computed);\n      }\n      result.push(value);\n    }\n  }\n  return result;\n}\n\nmodule.exports = baseUniq;\n","var castPath = require('./_castPath'),\n    last = require('./last'),\n    parent = require('./_parent'),\n    toKey = require('./_toKey');\n\n/**\n * The base implementation of `_.unset`.\n *\n * @private\n * @param {Object} object The object to modify.\n * @param {Array|string} path The property path to unset.\n * @returns {boolean} Returns `true` if the property is deleted, else `false`.\n */\nfunction baseUnset(object, path) {\n  path = castPath(path, object);\n  object = parent(object, path);\n  return object == null || delete object[toKey(last(path))];\n}\n\nmodule.exports = baseUnset;\n","var baseSlice = require('./_baseSlice');\n\n/**\n * The base implementation of methods like `_.dropWhile` and `_.takeWhile`\n * without support for iteratee shorthands.\n *\n * @private\n * @param {Array} array The array to query.\n * @param {Function} predicate The function invoked per iteration.\n * @param {boolean} [isDrop] Specify dropping elements instead of taking them.\n * @param {boolean} [fromRight] Specify iterating from right to left.\n * @returns {Array} Returns the slice of `array`.\n */\nfunction baseWhile(array, predicate, isDrop, fromRight) {\n  var length = array.length,\n      index = fromRight ? length : -1;\n\n  while ((fromRight ? index-- : ++index < length) &&\n    predicate(array[index], index, array)) {}\n\n  return isDrop\n    ? baseSlice(array, (fromRight ? 0 : index), (fromRight ? index + 1 : length))\n    : baseSlice(array, (fromRight ? index + 1 : 0), (fromRight ? length : index));\n}\n\nmodule.exports = baseWhile;\n","var baseDifference = require('./_baseDifference'),\n    baseFlatten = require('./_baseFlatten'),\n    baseUniq = require('./_baseUniq');\n\n/**\n * The base implementation of methods like `_.xor`, without support for\n * iteratee shorthands, that accepts an array of arrays to inspect.\n *\n * @private\n * @param {Array} arrays The arrays to inspect.\n * @param {Function} [iteratee] The iteratee invoked per element.\n * @param {Function} [comparator] The comparator invoked per element.\n * @returns {Array} Returns the new array of values.\n */\nfunction baseXor(arrays, iteratee, comparator) {\n  var length = arrays.length;\n  if (length < 2) {\n    return length ? baseUniq(arrays[0]) : [];\n  }\n  var index = -1,\n      result = Array(length);\n\n  while (++index < length) {\n    var array = arrays[index],\n        othIndex = -1;\n\n    while (++othIndex < length) {\n      if (othIndex != index) {\n        result[index] = baseDifference(result[index] || array, arrays[othIndex], iteratee, comparator);\n      }\n    }\n  }\n  return baseUniq(baseFlatten(result, 1), iteratee, comparator);\n}\n\nmodule.exports = baseXor;\n","/**\n * This base implementation of `_.zipObject` which assigns values using `assignFunc`.\n *\n * @private\n * @param {Array} props The property identifiers.\n * @param {Array} values The property values.\n * @param {Function} assignFunc The function to assign values.\n * @returns {Object} Returns the new object.\n */\nfunction baseZipObject(props, values, assignFunc) {\n  var index = -1,\n      length = props.length,\n      valsLength = values.length,\n      result = {};\n\n  while (++index < length) {\n    var value = index < valsLength ? values[index] : undefined;\n    assignFunc(result, props[index], value);\n  }\n  return result;\n}\n\nmodule.exports = baseZipObject;\n","/**\n * Checks if a `cache` value for `key` exists.\n *\n * @private\n * @param {Object} cache The cache to query.\n * @param {string} key The key of the entry to check.\n * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n */\nfunction cacheHas(cache, key) {\n  return cache.has(key);\n}\n\nmodule.exports = cacheHas;\n","var isArrayLikeObject = require('./isArrayLikeObject');\n\n/**\n * Casts `value` to an empty array if it's not an array like object.\n *\n * @private\n * @param {*} value The value to inspect.\n * @returns {Array|Object} Returns the cast array-like object.\n */\nfunction castArrayLikeObject(value) {\n  return isArrayLikeObject(value) ? value : [];\n}\n\nmodule.exports = castArrayLikeObject;\n","var isArray = require('./isArray'),\n    isKey = require('./_isKey'),\n    stringToPath = require('./_stringToPath'),\n    toString = require('./toString');\n\n/**\n * Casts `value` to a path array if it's not one.\n *\n * @private\n * @param {*} value The value to inspect.\n * @param {Object} [object] The object to query keys on.\n * @returns {Array} Returns the cast property path array.\n */\nfunction castPath(value, object) {\n  if (isArray(value)) {\n    return value;\n  }\n  return isKey(value, object) ? [value] : stringToPath(toString(value));\n}\n\nmodule.exports = castPath;\n","var isSymbol = require('./isSymbol');\n\n/**\n * Compares values to sort them in ascending order.\n *\n * @private\n * @param {*} value The value to compare.\n * @param {*} other The other value to compare.\n * @returns {number} Returns the sort order indicator for `value`.\n */\nfunction compareAscending(value, other) {\n  if (value !== other) {\n    var valIsDefined = value !== undefined,\n        valIsNull = value === null,\n        valIsReflexive = value === value,\n        valIsSymbol = isSymbol(value);\n\n    var othIsDefined = other !== undefined,\n        othIsNull = other === null,\n        othIsReflexive = other === other,\n        othIsSymbol = isSymbol(other);\n\n    if ((!othIsNull && !othIsSymbol && !valIsSymbol && value > other) ||\n        (valIsSymbol && othIsDefined && othIsReflexive && !othIsNull && !othIsSymbol) ||\n        (valIsNull && othIsDefined && othIsReflexive) ||\n        (!valIsDefined && othIsReflexive) ||\n        !valIsReflexive) {\n      return 1;\n    }\n    if ((!valIsNull && !valIsSymbol && !othIsSymbol && value < other) ||\n        (othIsSymbol && valIsDefined && valIsReflexive && !valIsNull && !valIsSymbol) ||\n        (othIsNull && valIsDefined && valIsReflexive) ||\n        (!othIsDefined && valIsReflexive) ||\n        !othIsReflexive) {\n      return -1;\n    }\n  }\n  return 0;\n}\n\nmodule.exports = compareAscending;\n","/**\n * Copies the values of `source` to `array`.\n *\n * @private\n * @param {Array} source The array to copy values from.\n * @param {Array} [array=[]] The array to copy values to.\n * @returns {Array} Returns `array`.\n */\nfunction copyArray(source, array) {\n  var index = -1,\n      length = source.length;\n\n  array || (array = Array(length));\n  while (++index < length) {\n    array[index] = source[index];\n  }\n  return array;\n}\n\nmodule.exports = copyArray;\n","var root = require('./_root');\n\n/** Used to detect overreaching core-js shims. */\nvar coreJsData = root['__core-js_shared__'];\n\nmodule.exports = coreJsData;\n","var Set = require('./_Set'),\n    noop = require('./noop'),\n    setToArray = require('./_setToArray');\n\n/** Used as references for various `Number` constants. */\nvar INFINITY = 1 / 0;\n\n/**\n * Creates a set object of `values`.\n *\n * @private\n * @param {Array} values The values to add to the set.\n * @returns {Object} Returns the new set.\n */\nvar createSet = !(Set && (1 / setToArray(new Set([,-0]))[1]) == INFINITY) ? noop : function(values) {\n  return new Set(values);\n};\n\nmodule.exports = createSet;\n","var getNative = require('./_getNative');\n\nvar defineProperty = (function() {\n  try {\n    var func = getNative(Object, 'defineProperty');\n    func({}, '', {});\n    return func;\n  } catch (e) {}\n}());\n\nmodule.exports = defineProperty;\n","var SetCache = require('./_SetCache'),\n    arraySome = require('./_arraySome'),\n    cacheHas = require('./_cacheHas');\n\n/** Used to compose bitmasks for value comparisons. */\nvar COMPARE_PARTIAL_FLAG = 1,\n    COMPARE_UNORDERED_FLAG = 2;\n\n/**\n * A specialized version of `baseIsEqualDeep` for arrays with support for\n * partial deep comparisons.\n *\n * @private\n * @param {Array} array The array to compare.\n * @param {Array} other The other array to compare.\n * @param {number} bitmask The bitmask flags. See `baseIsEqual` for more details.\n * @param {Function} customizer The function to customize comparisons.\n * @param {Function} equalFunc The function to determine equivalents of values.\n * @param {Object} stack Tracks traversed `array` and `other` objects.\n * @returns {boolean} Returns `true` if the arrays are equivalent, else `false`.\n */\nfunction equalArrays(array, other, bitmask, customizer, equalFunc, stack) {\n  var isPartial = bitmask & COMPARE_PARTIAL_FLAG,\n      arrLength = array.length,\n      othLength = other.length;\n\n  if (arrLength != othLength && !(isPartial && othLength > arrLength)) {\n    return false;\n  }\n  // Check that cyclic values are equal.\n  var arrStacked = stack.get(array);\n  var othStacked = stack.get(other);\n  if (arrStacked && othStacked) {\n    return arrStacked == other && othStacked == array;\n  }\n  var index = -1,\n      result = true,\n      seen = (bitmask & COMPARE_UNORDERED_FLAG) ? new SetCache : undefined;\n\n  stack.set(array, other);\n  stack.set(other, array);\n\n  // Ignore non-index properties.\n  while (++index < arrLength) {\n    var arrValue = array[index],\n        othValue = other[index];\n\n    if (customizer) {\n      var compared = isPartial\n        ? customizer(othValue, arrValue, index, other, array, stack)\n        : customizer(arrValue, othValue, index, array, other, stack);\n    }\n    if (compared !== undefined) {\n      if (compared) {\n        continue;\n      }\n      result = false;\n      break;\n    }\n    // Recursively compare arrays (susceptible to call stack limits).\n    if (seen) {\n      if (!arraySome(other, function(othValue, othIndex) {\n            if (!cacheHas(seen, othIndex) &&\n                (arrValue === othValue || equalFunc(arrValue, othValue, bitmask, customizer, stack))) {\n              return seen.push(othIndex);\n            }\n          })) {\n        result = false;\n        break;\n      }\n    } else if (!(\n          arrValue === othValue ||\n            equalFunc(arrValue, othValue, bitmask, customizer, stack)\n        )) {\n      result = false;\n      break;\n    }\n  }\n  stack['delete'](array);\n  stack['delete'](other);\n  return result;\n}\n\nmodule.exports = equalArrays;\n","var Symbol = require('./_Symbol'),\n    Uint8Array = require('./_Uint8Array'),\n    eq = require('./eq'),\n    equalArrays = require('./_equalArrays'),\n    mapToArray = require('./_mapToArray'),\n    setToArray = require('./_setToArray');\n\n/** Used to compose bitmasks for value comparisons. */\nvar COMPARE_PARTIAL_FLAG = 1,\n    COMPARE_UNORDERED_FLAG = 2;\n\n/** `Object#toString` result references. */\nvar boolTag = '[object Boolean]',\n    dateTag = '[object Date]',\n    errorTag = '[object Error]',\n    mapTag = '[object Map]',\n    numberTag = '[object Number]',\n    regexpTag = '[object RegExp]',\n    setTag = '[object Set]',\n    stringTag = '[object String]',\n    symbolTag = '[object Symbol]';\n\nvar arrayBufferTag = '[object ArrayBuffer]',\n    dataViewTag = '[object DataView]';\n\n/** Used to convert symbols to primitives and strings. */\nvar symbolProto = Symbol ? Symbol.prototype : undefined,\n    symbolValueOf = symbolProto ? symbolProto.valueOf : undefined;\n\n/**\n * A specialized version of `baseIsEqualDeep` for comparing objects of\n * the same `toStringTag`.\n *\n * **Note:** This function only supports comparing values with tags of\n * `Boolean`, `Date`, `Error`, `Number`, `RegExp`, or `String`.\n *\n * @private\n * @param {Object} object The object to compare.\n * @param {Object} other The other object to compare.\n * @param {string} tag The `toStringTag` of the objects to compare.\n * @param {number} bitmask The bitmask flags. See `baseIsEqual` for more details.\n * @param {Function} customizer The function to customize comparisons.\n * @param {Function} equalFunc The function to determine equivalents of values.\n * @param {Object} stack Tracks traversed `object` and `other` objects.\n * @returns {boolean} Returns `true` if the objects are equivalent, else `false`.\n */\nfunction equalByTag(object, other, tag, bitmask, customizer, equalFunc, stack) {\n  switch (tag) {\n    case dataViewTag:\n      if ((object.byteLength != other.byteLength) ||\n          (object.byteOffset != other.byteOffset)) {\n        return false;\n      }\n      object = object.buffer;\n      other = other.buffer;\n\n    case arrayBufferTag:\n      if ((object.byteLength != other.byteLength) ||\n          !equalFunc(new Uint8Array(object), new Uint8Array(other))) {\n        return false;\n      }\n      return true;\n\n    case boolTag:\n    case dateTag:\n    case numberTag:\n      // Coerce booleans to `1` or `0` and dates to milliseconds.\n      // Invalid dates are coerced to `NaN`.\n      return eq(+object, +other);\n\n    case errorTag:\n      return object.name == other.name && object.message == other.message;\n\n    case regexpTag:\n    case stringTag:\n      // Coerce regexes to strings and treat strings, primitives and objects,\n      // as equal. See http://www.ecma-international.org/ecma-262/7.0/#sec-regexp.prototype.tostring\n      // for more details.\n      return object == (other + '');\n\n    case mapTag:\n      var convert = mapToArray;\n\n    case setTag:\n      var isPartial = bitmask & COMPARE_PARTIAL_FLAG;\n      convert || (convert = setToArray);\n\n      if (object.size != other.size && !isPartial) {\n        return false;\n      }\n      // Assume cyclic values are equal.\n      var stacked = stack.get(object);\n      if (stacked) {\n        return stacked == other;\n      }\n      bitmask |= COMPARE_UNORDERED_FLAG;\n\n      // Recursively compare objects (susceptible to call stack limits).\n      stack.set(object, other);\n      var result = equalArrays(convert(object), convert(other), bitmask, customizer, equalFunc, stack);\n      stack['delete'](object);\n      return result;\n\n    case symbolTag:\n      if (symbolValueOf) {\n        return symbolValueOf.call(object) == symbolValueOf.call(other);\n      }\n  }\n  return false;\n}\n\nmodule.exports = equalByTag;\n","var getAllKeys = require('./_getAllKeys');\n\n/** Used to compose bitmasks for value comparisons. */\nvar COMPARE_PARTIAL_FLAG = 1;\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/**\n * A specialized version of `baseIsEqualDeep` for objects with support for\n * partial deep comparisons.\n *\n * @private\n * @param {Object} object The object to compare.\n * @param {Object} other The other object to compare.\n * @param {number} bitmask The bitmask flags. See `baseIsEqual` for more details.\n * @param {Function} customizer The function to customize comparisons.\n * @param {Function} equalFunc The function to determine equivalents of values.\n * @param {Object} stack Tracks traversed `object` and `other` objects.\n * @returns {boolean} Returns `true` if the objects are equivalent, else `false`.\n */\nfunction equalObjects(object, other, bitmask, customizer, equalFunc, stack) {\n  var isPartial = bitmask & COMPARE_PARTIAL_FLAG,\n      objProps = getAllKeys(object),\n      objLength = objProps.length,\n      othProps = getAllKeys(other),\n      othLength = othProps.length;\n\n  if (objLength != othLength && !isPartial) {\n    return false;\n  }\n  var index = objLength;\n  while (index--) {\n    var key = objProps[index];\n    if (!(isPartial ? key in other : hasOwnProperty.call(other, key))) {\n      return false;\n    }\n  }\n  // Check that cyclic values are equal.\n  var objStacked = stack.get(object);\n  var othStacked = stack.get(other);\n  if (objStacked && othStacked) {\n    return objStacked == other && othStacked == object;\n  }\n  var result = true;\n  stack.set(object, other);\n  stack.set(other, object);\n\n  var skipCtor = isPartial;\n  while (++index < objLength) {\n    key = objProps[index];\n    var objValue = object[key],\n        othValue = other[key];\n\n    if (customizer) {\n      var compared = isPartial\n        ? customizer(othValue, objValue, key, other, object, stack)\n        : customizer(objValue, othValue, key, object, other, stack);\n    }\n    // Recursively compare objects (susceptible to call stack limits).\n    if (!(compared === undefined\n          ? (objValue === othValue || equalFunc(objValue, othValue, bitmask, customizer, stack))\n          : compared\n        )) {\n      result = false;\n      break;\n    }\n    skipCtor || (skipCtor = key == 'constructor');\n  }\n  if (result && !skipCtor) {\n    var objCtor = object.constructor,\n        othCtor = other.constructor;\n\n    // Non `Object` object instances with different constructors are not equal.\n    if (objCtor != othCtor &&\n        ('constructor' in object && 'constructor' in other) &&\n        !(typeof objCtor == 'function' && objCtor instanceof objCtor &&\n          typeof othCtor == 'function' && othCtor instanceof othCtor)) {\n      result = false;\n    }\n  }\n  stack['delete'](object);\n  stack['delete'](other);\n  return result;\n}\n\nmodule.exports = equalObjects;\n","var flatten = require('./flatten'),\n    overRest = require('./_overRest'),\n    setToString = require('./_setToString');\n\n/**\n * A specialized version of `baseRest` which flattens the rest array.\n *\n * @private\n * @param {Function} func The function to apply a rest parameter to.\n * @returns {Function} Returns the new function.\n */\nfunction flatRest(func) {\n  return setToString(overRest(func, undefined, flatten), func + '');\n}\n\nmodule.exports = flatRest;\n","var baseGetAllKeys = require('./_baseGetAllKeys'),\n    getSymbols = require('./_getSymbols'),\n    keys = require('./keys');\n\n/**\n * Creates an array of own enumerable property names and symbols of `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names and symbols.\n */\nfunction getAllKeys(object) {\n  return baseGetAllKeys(object, keys, getSymbols);\n}\n\nmodule.exports = getAllKeys;\n","var isKeyable = require('./_isKeyable');\n\n/**\n * Gets the data for `map`.\n *\n * @private\n * @param {Object} map The map to query.\n * @param {string} key The reference key.\n * @returns {*} Returns the map data.\n */\nfunction getMapData(map, key) {\n  var data = map.__data__;\n  return isKeyable(key)\n    ? data[typeof key == 'string' ? 'string' : 'hash']\n    : data.map;\n}\n\nmodule.exports = getMapData;\n","var isStrictComparable = require('./_isStrictComparable'),\n    keys = require('./keys');\n\n/**\n * Gets the property names, values, and compare flags of `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the match data of `object`.\n */\nfunction getMatchData(object) {\n  var result = keys(object),\n      length = result.length;\n\n  while (length--) {\n    var key = result[length],\n        value = object[key];\n\n    result[length] = [key, value, isStrictComparable(value)];\n  }\n  return result;\n}\n\nmodule.exports = getMatchData;\n","var baseIsNative = require('./_baseIsNative'),\n    getValue = require('./_getValue');\n\n/**\n * Gets the native function at `key` of `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @param {string} key The key of the method to get.\n * @returns {*} Returns the function if it's native, else `undefined`.\n */\nfunction getNative(object, key) {\n  var value = getValue(object, key);\n  return baseIsNative(value) ? value : undefined;\n}\n\nmodule.exports = getNative;\n","var arrayFilter = require('./_arrayFilter'),\n    stubArray = require('./stubArray');\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Built-in value references. */\nvar propertyIsEnumerable = objectProto.propertyIsEnumerable;\n\n/* Built-in method references for those with the same name as other `lodash` methods. */\nvar nativeGetSymbols = Object.getOwnPropertySymbols;\n\n/**\n * Creates an array of the own enumerable symbols of `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of symbols.\n */\nvar getSymbols = !nativeGetSymbols ? stubArray : function(object) {\n  if (object == null) {\n    return [];\n  }\n  object = Object(object);\n  return arrayFilter(nativeGetSymbols(object), function(symbol) {\n    return propertyIsEnumerable.call(object, symbol);\n  });\n};\n\nmodule.exports = getSymbols;\n","var DataView = require('./_DataView'),\n    Map = require('./_Map'),\n    Promise = require('./_Promise'),\n    Set = require('./_Set'),\n    WeakMap = require('./_WeakMap'),\n    baseGetTag = require('./_baseGetTag'),\n    toSource = require('./_toSource');\n\n/** `Object#toString` result references. */\nvar mapTag = '[object Map]',\n    objectTag = '[object Object]',\n    promiseTag = '[object Promise]',\n    setTag = '[object Set]',\n    weakMapTag = '[object WeakMap]';\n\nvar dataViewTag = '[object DataView]';\n\n/** Used to detect maps, sets, and weakmaps. */\nvar dataViewCtorString = toSource(DataView),\n    mapCtorString = toSource(Map),\n    promiseCtorString = toSource(Promise),\n    setCtorString = toSource(Set),\n    weakMapCtorString = toSource(WeakMap);\n\n/**\n * Gets the `toStringTag` of `value`.\n *\n * @private\n * @param {*} value The value to query.\n * @returns {string} Returns the `toStringTag`.\n */\nvar getTag = baseGetTag;\n\n// Fallback for data views, maps, sets, and weak maps in IE 11 and promises in Node.js < 6.\nif ((DataView && getTag(new DataView(new ArrayBuffer(1))) != dataViewTag) ||\n    (Map && getTag(new Map) != mapTag) ||\n    (Promise && getTag(Promise.resolve()) != promiseTag) ||\n    (Set && getTag(new Set) != setTag) ||\n    (WeakMap && getTag(new WeakMap) != weakMapTag)) {\n  getTag = function(value) {\n    var result = baseGetTag(value),\n        Ctor = result == objectTag ? value.constructor : undefined,\n        ctorString = Ctor ? toSource(Ctor) : '';\n\n    if (ctorString) {\n      switch (ctorString) {\n        case dataViewCtorString: return dataViewTag;\n        case mapCtorString: return mapTag;\n        case promiseCtorString: return promiseTag;\n        case setCtorString: return setTag;\n        case weakMapCtorString: return weakMapTag;\n      }\n    }\n    return result;\n  };\n}\n\nmodule.exports = getTag;\n","/**\n * Gets the value at `key` of `object`.\n *\n * @private\n * @param {Object} [object] The object to query.\n * @param {string} key The key of the property to get.\n * @returns {*} Returns the property value.\n */\nfunction getValue(object, key) {\n  return object == null ? undefined : object[key];\n}\n\nmodule.exports = getValue;\n","var castPath = require('./_castPath'),\n    isArguments = require('./isArguments'),\n    isArray = require('./isArray'),\n    isIndex = require('./_isIndex'),\n    isLength = require('./isLength'),\n    toKey = require('./_toKey');\n\n/**\n * Checks if `path` exists on `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @param {Array|string} path The path to check.\n * @param {Function} hasFunc The function to check properties.\n * @returns {boolean} Returns `true` if `path` exists, else `false`.\n */\nfunction hasPath(object, path, hasFunc) {\n  path = castPath(path, object);\n\n  var index = -1,\n      length = path.length,\n      result = false;\n\n  while (++index < length) {\n    var key = toKey(path[index]);\n    if (!(result = object != null && hasFunc(object, key))) {\n      break;\n    }\n    object = object[key];\n  }\n  if (result || ++index != length) {\n    return result;\n  }\n  length = object == null ? 0 : object.length;\n  return !!length && isLength(length) && isIndex(key, length) &&\n    (isArray(object) || isArguments(object));\n}\n\nmodule.exports = hasPath;\n","var nativeCreate = require('./_nativeCreate');\n\n/**\n * Removes all key-value entries from the hash.\n *\n * @private\n * @name clear\n * @memberOf Hash\n */\nfunction hashClear() {\n  this.__data__ = nativeCreate ? nativeCreate(null) : {};\n  this.size = 0;\n}\n\nmodule.exports = hashClear;\n","/**\n * Removes `key` and its value from the hash.\n *\n * @private\n * @name delete\n * @memberOf Hash\n * @param {Object} hash The hash to modify.\n * @param {string} key The key of the value to remove.\n * @returns {boolean} Returns `true` if the entry was removed, else `false`.\n */\nfunction hashDelete(key) {\n  var result = this.has(key) && delete this.__data__[key];\n  this.size -= result ? 1 : 0;\n  return result;\n}\n\nmodule.exports = hashDelete;\n","var nativeCreate = require('./_nativeCreate');\n\n/** Used to stand-in for `undefined` hash values. */\nvar HASH_UNDEFINED = '__lodash_hash_undefined__';\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/**\n * Gets the hash value for `key`.\n *\n * @private\n * @name get\n * @memberOf Hash\n * @param {string} key The key of the value to get.\n * @returns {*} Returns the entry value.\n */\nfunction hashGet(key) {\n  var data = this.__data__;\n  if (nativeCreate) {\n    var result = data[key];\n    return result === HASH_UNDEFINED ? undefined : result;\n  }\n  return hasOwnProperty.call(data, key) ? data[key] : undefined;\n}\n\nmodule.exports = hashGet;\n","var nativeCreate = require('./_nativeCreate');\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/**\n * Checks if a hash value for `key` exists.\n *\n * @private\n * @name has\n * @memberOf Hash\n * @param {string} key The key of the entry to check.\n * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n */\nfunction hashHas(key) {\n  var data = this.__data__;\n  return nativeCreate ? (data[key] !== undefined) : hasOwnProperty.call(data, key);\n}\n\nmodule.exports = hashHas;\n","var nativeCreate = require('./_nativeCreate');\n\n/** Used to stand-in for `undefined` hash values. */\nvar HASH_UNDEFINED = '__lodash_hash_undefined__';\n\n/**\n * Sets the hash `key` to `value`.\n *\n * @private\n * @name set\n * @memberOf Hash\n * @param {string} key The key of the value to set.\n * @param {*} value The value to set.\n * @returns {Object} Returns the hash instance.\n */\nfunction hashSet(key, value) {\n  var data = this.__data__;\n  this.size += this.has(key) ? 0 : 1;\n  data[key] = (nativeCreate && value === undefined) ? HASH_UNDEFINED : value;\n  return this;\n}\n\nmodule.exports = hashSet;\n","var Symbol = require('./_Symbol'),\n    isArguments = require('./isArguments'),\n    isArray = require('./isArray');\n\n/** Built-in value references. */\nvar spreadableSymbol = Symbol ? Symbol.isConcatSpreadable : undefined;\n\n/**\n * Checks if `value` is a flattenable `arguments` object or array.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is flattenable, else `false`.\n */\nfunction isFlattenable(value) {\n  return isArray(value) || isArguments(value) ||\n    !!(spreadableSymbol && value && value[spreadableSymbol]);\n}\n\nmodule.exports = isFlattenable;\n","/** Used as references for various `Number` constants. */\nvar MAX_SAFE_INTEGER = 9007199254740991;\n\n/** Used to detect unsigned integer values. */\nvar reIsUint = /^(?:0|[1-9]\\d*)$/;\n\n/**\n * Checks if `value` is a valid array-like index.\n *\n * @private\n * @param {*} value The value to check.\n * @param {number} [length=MAX_SAFE_INTEGER] The upper bounds of a valid index.\n * @returns {boolean} Returns `true` if `value` is a valid index, else `false`.\n */\nfunction isIndex(value, length) {\n  var type = typeof value;\n  length = length == null ? MAX_SAFE_INTEGER : length;\n\n  return !!length &&\n    (type == 'number' ||\n      (type != 'symbol' && reIsUint.test(value))) &&\n        (value > -1 && value % 1 == 0 && value < length);\n}\n\nmodule.exports = isIndex;\n","var eq = require('./eq'),\n    isArrayLike = require('./isArrayLike'),\n    isIndex = require('./_isIndex'),\n    isObject = require('./isObject');\n\n/**\n * Checks if the given arguments are from an iteratee call.\n *\n * @private\n * @param {*} value The potential iteratee value argument.\n * @param {*} index The potential iteratee index or key argument.\n * @param {*} object The potential iteratee object argument.\n * @returns {boolean} Returns `true` if the arguments are from an iteratee call,\n *  else `false`.\n */\nfunction isIterateeCall(value, index, object) {\n  if (!isObject(object)) {\n    return false;\n  }\n  var type = typeof index;\n  if (type == 'number'\n        ? (isArrayLike(object) && isIndex(index, object.length))\n        : (type == 'string' && index in object)\n      ) {\n    return eq(object[index], value);\n  }\n  return false;\n}\n\nmodule.exports = isIterateeCall;\n","var isArray = require('./isArray'),\n    isSymbol = require('./isSymbol');\n\n/** Used to match property names within property paths. */\nvar reIsDeepProp = /\\.|\\[(?:[^[\\]]*|([\"'])(?:(?!\\1)[^\\\\]|\\\\.)*?\\1)\\]/,\n    reIsPlainProp = /^\\w*$/;\n\n/**\n * Checks if `value` is a property name and not a property path.\n *\n * @private\n * @param {*} value The value to check.\n * @param {Object} [object] The object to query keys on.\n * @returns {boolean} Returns `true` if `value` is a property name, else `false`.\n */\nfunction isKey(value, object) {\n  if (isArray(value)) {\n    return false;\n  }\n  var type = typeof value;\n  if (type == 'number' || type == 'symbol' || type == 'boolean' ||\n      value == null || isSymbol(value)) {\n    return true;\n  }\n  return reIsPlainProp.test(value) || !reIsDeepProp.test(value) ||\n    (object != null && value in Object(object));\n}\n\nmodule.exports = isKey;\n","/**\n * Checks if `value` is suitable for use as unique object key.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is suitable, else `false`.\n */\nfunction isKeyable(value) {\n  var type = typeof value;\n  return (type == 'string' || type == 'number' || type == 'symbol' || type == 'boolean')\n    ? (value !== '__proto__')\n    : (value === null);\n}\n\nmodule.exports = isKeyable;\n","var coreJsData = require('./_coreJsData');\n\n/** Used to detect methods masquerading as native. */\nvar maskSrcKey = (function() {\n  var uid = /[^.]+$/.exec(coreJsData && coreJsData.keys && coreJsData.keys.IE_PROTO || '');\n  return uid ? ('Symbol(src)_1.' + uid) : '';\n}());\n\n/**\n * Checks if `func` has its source masked.\n *\n * @private\n * @param {Function} func The function to check.\n * @returns {boolean} Returns `true` if `func` is masked, else `false`.\n */\nfunction isMasked(func) {\n  return !!maskSrcKey && (maskSrcKey in func);\n}\n\nmodule.exports = isMasked;\n","/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/**\n * Checks if `value` is likely a prototype object.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a prototype, else `false`.\n */\nfunction isPrototype(value) {\n  var Ctor = value && value.constructor,\n      proto = (typeof Ctor == 'function' && Ctor.prototype) || objectProto;\n\n  return value === proto;\n}\n\nmodule.exports = isPrototype;\n","var isObject = require('./isObject');\n\n/**\n * Checks if `value` is suitable for strict equality comparisons, i.e. `===`.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` if suitable for strict\n *  equality comparisons, else `false`.\n */\nfunction isStrictComparable(value) {\n  return value === value && !isObject(value);\n}\n\nmodule.exports = isStrictComparable;\n","/**\n * Removes all key-value entries from the list cache.\n *\n * @private\n * @name clear\n * @memberOf ListCache\n */\nfunction listCacheClear() {\n  this.__data__ = [];\n  this.size = 0;\n}\n\nmodule.exports = listCacheClear;\n","var assocIndexOf = require('./_assocIndexOf');\n\n/** Used for built-in method references. */\nvar arrayProto = Array.prototype;\n\n/** Built-in value references. */\nvar splice = arrayProto.splice;\n\n/**\n * Removes `key` and its value from the list cache.\n *\n * @private\n * @name delete\n * @memberOf ListCache\n * @param {string} key The key of the value to remove.\n * @returns {boolean} Returns `true` if the entry was removed, else `false`.\n */\nfunction listCacheDelete(key) {\n  var data = this.__data__,\n      index = assocIndexOf(data, key);\n\n  if (index < 0) {\n    return false;\n  }\n  var lastIndex = data.length - 1;\n  if (index == lastIndex) {\n    data.pop();\n  } else {\n    splice.call(data, index, 1);\n  }\n  --this.size;\n  return true;\n}\n\nmodule.exports = listCacheDelete;\n","var assocIndexOf = require('./_assocIndexOf');\n\n/**\n * Gets the list cache value for `key`.\n *\n * @private\n * @name get\n * @memberOf ListCache\n * @param {string} key The key of the value to get.\n * @returns {*} Returns the entry value.\n */\nfunction listCacheGet(key) {\n  var data = this.__data__,\n      index = assocIndexOf(data, key);\n\n  return index < 0 ? undefined : data[index][1];\n}\n\nmodule.exports = listCacheGet;\n","var assocIndexOf = require('./_assocIndexOf');\n\n/**\n * Checks if a list cache value for `key` exists.\n *\n * @private\n * @name has\n * @memberOf ListCache\n * @param {string} key The key of the entry to check.\n * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n */\nfunction listCacheHas(key) {\n  return assocIndexOf(this.__data__, key) > -1;\n}\n\nmodule.exports = listCacheHas;\n","var assocIndexOf = require('./_assocIndexOf');\n\n/**\n * Sets the list cache `key` to `value`.\n *\n * @private\n * @name set\n * @memberOf ListCache\n * @param {string} key The key of the value to set.\n * @param {*} value The value to set.\n * @returns {Object} Returns the list cache instance.\n */\nfunction listCacheSet(key, value) {\n  var data = this.__data__,\n      index = assocIndexOf(data, key);\n\n  if (index < 0) {\n    ++this.size;\n    data.push([key, value]);\n  } else {\n    data[index][1] = value;\n  }\n  return this;\n}\n\nmodule.exports = listCacheSet;\n","var Hash = require('./_Hash'),\n    ListCache = require('./_ListCache'),\n    Map = require('./_Map');\n\n/**\n * Removes all key-value entries from the map.\n *\n * @private\n * @name clear\n * @memberOf MapCache\n */\nfunction mapCacheClear() {\n  this.size = 0;\n  this.__data__ = {\n    'hash': new Hash,\n    'map': new (Map || ListCache),\n    'string': new Hash\n  };\n}\n\nmodule.exports = mapCacheClear;\n","var getMapData = require('./_getMapData');\n\n/**\n * Removes `key` and its value from the map.\n *\n * @private\n * @name delete\n * @memberOf MapCache\n * @param {string} key The key of the value to remove.\n * @returns {boolean} Returns `true` if the entry was removed, else `false`.\n */\nfunction mapCacheDelete(key) {\n  var result = getMapData(this, key)['delete'](key);\n  this.size -= result ? 1 : 0;\n  return result;\n}\n\nmodule.exports = mapCacheDelete;\n","var getMapData = require('./_getMapData');\n\n/**\n * Gets the map value for `key`.\n *\n * @private\n * @name get\n * @memberOf MapCache\n * @param {string} key The key of the value to get.\n * @returns {*} Returns the entry value.\n */\nfunction mapCacheGet(key) {\n  return getMapData(this, key).get(key);\n}\n\nmodule.exports = mapCacheGet;\n","var getMapData = require('./_getMapData');\n\n/**\n * Checks if a map value for `key` exists.\n *\n * @private\n * @name has\n * @memberOf MapCache\n * @param {string} key The key of the entry to check.\n * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n */\nfunction mapCacheHas(key) {\n  return getMapData(this, key).has(key);\n}\n\nmodule.exports = mapCacheHas;\n","var getMapData = require('./_getMapData');\n\n/**\n * Sets the map `key` to `value`.\n *\n * @private\n * @name set\n * @memberOf MapCache\n * @param {string} key The key of the value to set.\n * @param {*} value The value to set.\n * @returns {Object} Returns the map cache instance.\n */\nfunction mapCacheSet(key, value) {\n  var data = getMapData(this, key),\n      size = data.size;\n\n  data.set(key, value);\n  this.size += data.size == size ? 0 : 1;\n  return this;\n}\n\nmodule.exports = mapCacheSet;\n","/**\n * Converts `map` to its key-value pairs.\n *\n * @private\n * @param {Object} map The map to convert.\n * @returns {Array} Returns the key-value pairs.\n */\nfunction mapToArray(map) {\n  var index = -1,\n      result = Array(map.size);\n\n  map.forEach(function(value, key) {\n    result[++index] = [key, value];\n  });\n  return result;\n}\n\nmodule.exports = mapToArray;\n","/**\n * A specialized version of `matchesProperty` for source values suitable\n * for strict equality comparisons, i.e. `===`.\n *\n * @private\n * @param {string} key The key of the property to get.\n * @param {*} srcValue The value to match.\n * @returns {Function} Returns the new spec function.\n */\nfunction matchesStrictComparable(key, srcValue) {\n  return function(object) {\n    if (object == null) {\n      return false;\n    }\n    return object[key] === srcValue &&\n      (srcValue !== undefined || (key in Object(object)));\n  };\n}\n\nmodule.exports = matchesStrictComparable;\n","var memoize = require('./memoize');\n\n/** Used as the maximum memoize cache size. */\nvar MAX_MEMOIZE_SIZE = 500;\n\n/**\n * A specialized version of `_.memoize` which clears the memoized function's\n * cache when it exceeds `MAX_MEMOIZE_SIZE`.\n *\n * @private\n * @param {Function} func The function to have its output memoized.\n * @returns {Function} Returns the new memoized function.\n */\nfunction memoizeCapped(func) {\n  var result = memoize(func, function(key) {\n    if (cache.size === MAX_MEMOIZE_SIZE) {\n      cache.clear();\n    }\n    return key;\n  });\n\n  var cache = result.cache;\n  return result;\n}\n\nmodule.exports = memoizeCapped;\n","var getNative = require('./_getNative');\n\n/* Built-in method references that are verified to be native. */\nvar nativeCreate = getNative(Object, 'create');\n\nmodule.exports = nativeCreate;\n","var overArg = require('./_overArg');\n\n/* Built-in method references for those with the same name as other `lodash` methods. */\nvar nativeKeys = overArg(Object.keys, Object);\n\nmodule.exports = nativeKeys;\n","var freeGlobal = require('./_freeGlobal');\n\n/** Detect free variable `exports`. */\nvar freeExports = typeof exports == 'object' && exports && !exports.nodeType && exports;\n\n/** Detect free variable `module`. */\nvar freeModule = freeExports && typeof module == 'object' && module && !module.nodeType && module;\n\n/** Detect the popular CommonJS extension `module.exports`. */\nvar moduleExports = freeModule && freeModule.exports === freeExports;\n\n/** Detect free variable `process` from Node.js. */\nvar freeProcess = moduleExports && freeGlobal.process;\n\n/** Used to access faster Node.js helpers. */\nvar nodeUtil = (function() {\n  try {\n    // Use `util.types` for Node.js 10+.\n    var types = freeModule && freeModule.require && freeModule.require('util').types;\n\n    if (types) {\n      return types;\n    }\n\n    // Legacy `process.binding('util')` for Node.js < 10.\n    return freeProcess && freeProcess.binding && freeProcess.binding('util');\n  } catch (e) {}\n}());\n\nmodule.exports = nodeUtil;\n","/**\n * Creates a unary function that invokes `func` with its argument transformed.\n *\n * @private\n * @param {Function} func The function to wrap.\n * @param {Function} transform The argument transform.\n * @returns {Function} Returns the new function.\n */\nfunction overArg(func, transform) {\n  return function(arg) {\n    return func(transform(arg));\n  };\n}\n\nmodule.exports = overArg;\n","var apply = require('./_apply');\n\n/* Built-in method references for those with the same name as other `lodash` methods. */\nvar nativeMax = Math.max;\n\n/**\n * A specialized version of `baseRest` which transforms the rest array.\n *\n * @private\n * @param {Function} func The function to apply a rest parameter to.\n * @param {number} [start=func.length-1] The start position of the rest parameter.\n * @param {Function} transform The rest array transform.\n * @returns {Function} Returns the new function.\n */\nfunction overRest(func, start, transform) {\n  start = nativeMax(start === undefined ? (func.length - 1) : start, 0);\n  return function() {\n    var args = arguments,\n        index = -1,\n        length = nativeMax(args.length - start, 0),\n        array = Array(length);\n\n    while (++index < length) {\n      array[index] = args[start + index];\n    }\n    index = -1;\n    var otherArgs = Array(start + 1);\n    while (++index < start) {\n      otherArgs[index] = args[index];\n    }\n    otherArgs[start] = transform(array);\n    return apply(func, this, otherArgs);\n  };\n}\n\nmodule.exports = overRest;\n","var baseGet = require('./_baseGet'),\n    baseSlice = require('./_baseSlice');\n\n/**\n * Gets the parent value at `path` of `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @param {Array} path The path to get the parent value of.\n * @returns {*} Returns the parent value.\n */\nfunction parent(object, path) {\n  return path.length < 2 ? object : baseGet(object, baseSlice(path, 0, -1));\n}\n\nmodule.exports = parent;\n","/** Used to stand-in for `undefined` hash values. */\nvar HASH_UNDEFINED = '__lodash_hash_undefined__';\n\n/**\n * Adds `value` to the array cache.\n *\n * @private\n * @name add\n * @memberOf SetCache\n * @alias push\n * @param {*} value The value to cache.\n * @returns {Object} Returns the cache instance.\n */\nfunction setCacheAdd(value) {\n  this.__data__.set(value, HASH_UNDEFINED);\n  return this;\n}\n\nmodule.exports = setCacheAdd;\n","/**\n * Checks if `value` is in the array cache.\n *\n * @private\n * @name has\n * @memberOf SetCache\n * @param {*} value The value to search for.\n * @returns {number} Returns `true` if `value` is found, else `false`.\n */\nfunction setCacheHas(value) {\n  return this.__data__.has(value);\n}\n\nmodule.exports = setCacheHas;\n","/**\n * Converts `set` to an array of its values.\n *\n * @private\n * @param {Object} set The set to convert.\n * @returns {Array} Returns the values.\n */\nfunction setToArray(set) {\n  var index = -1,\n      result = Array(set.size);\n\n  set.forEach(function(value) {\n    result[++index] = value;\n  });\n  return result;\n}\n\nmodule.exports = setToArray;\n","var baseSetToString = require('./_baseSetToString'),\n    shortOut = require('./_shortOut');\n\n/**\n * Sets the `toString` method of `func` to return `string`.\n *\n * @private\n * @param {Function} func The function to modify.\n * @param {Function} string The `toString` result.\n * @returns {Function} Returns `func`.\n */\nvar setToString = shortOut(baseSetToString);\n\nmodule.exports = setToString;\n","/** Used to detect hot functions by number of calls within a span of milliseconds. */\nvar HOT_COUNT = 800,\n    HOT_SPAN = 16;\n\n/* Built-in method references for those with the same name as other `lodash` methods. */\nvar nativeNow = Date.now;\n\n/**\n * Creates a function that'll short out and invoke `identity` instead\n * of `func` when it's called `HOT_COUNT` or more times in `HOT_SPAN`\n * milliseconds.\n *\n * @private\n * @param {Function} func The function to restrict.\n * @returns {Function} Returns the new shortable function.\n */\nfunction shortOut(func) {\n  var count = 0,\n      lastCalled = 0;\n\n  return function() {\n    var stamp = nativeNow(),\n        remaining = HOT_SPAN - (stamp - lastCalled);\n\n    lastCalled = stamp;\n    if (remaining > 0) {\n      if (++count >= HOT_COUNT) {\n        return arguments[0];\n      }\n    } else {\n      count = 0;\n    }\n    return func.apply(undefined, arguments);\n  };\n}\n\nmodule.exports = shortOut;\n","var ListCache = require('./_ListCache');\n\n/**\n * Removes all key-value entries from the stack.\n *\n * @private\n * @name clear\n * @memberOf Stack\n */\nfunction stackClear() {\n  this.__data__ = new ListCache;\n  this.size = 0;\n}\n\nmodule.exports = stackClear;\n","/**\n * Removes `key` and its value from the stack.\n *\n * @private\n * @name delete\n * @memberOf Stack\n * @param {string} key The key of the value to remove.\n * @returns {boolean} Returns `true` if the entry was removed, else `false`.\n */\nfunction stackDelete(key) {\n  var data = this.__data__,\n      result = data['delete'](key);\n\n  this.size = data.size;\n  return result;\n}\n\nmodule.exports = stackDelete;\n","/**\n * Gets the stack value for `key`.\n *\n * @private\n * @name get\n * @memberOf Stack\n * @param {string} key The key of the value to get.\n * @returns {*} Returns the entry value.\n */\nfunction stackGet(key) {\n  return this.__data__.get(key);\n}\n\nmodule.exports = stackGet;\n","/**\n * Checks if a stack value for `key` exists.\n *\n * @private\n * @name has\n * @memberOf Stack\n * @param {string} key The key of the entry to check.\n * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n */\nfunction stackHas(key) {\n  return this.__data__.has(key);\n}\n\nmodule.exports = stackHas;\n","var ListCache = require('./_ListCache'),\n    Map = require('./_Map'),\n    MapCache = require('./_MapCache');\n\n/** Used as the size to enable large array optimizations. */\nvar LARGE_ARRAY_SIZE = 200;\n\n/**\n * Sets the stack `key` to `value`.\n *\n * @private\n * @name set\n * @memberOf Stack\n * @param {string} key The key of the value to set.\n * @param {*} value The value to set.\n * @returns {Object} Returns the stack cache instance.\n */\nfunction stackSet(key, value) {\n  var data = this.__data__;\n  if (data instanceof ListCache) {\n    var pairs = data.__data__;\n    if (!Map || (pairs.length < LARGE_ARRAY_SIZE - 1)) {\n      pairs.push([key, value]);\n      this.size = ++data.size;\n      return this;\n    }\n    data = this.__data__ = new MapCache(pairs);\n  }\n  data.set(key, value);\n  this.size = data.size;\n  return this;\n}\n\nmodule.exports = stackSet;\n","/**\n * A specialized version of `_.indexOf` which performs strict equality\n * comparisons of values, i.e. `===`.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {*} value The value to search for.\n * @param {number} fromIndex The index to search from.\n * @returns {number} Returns the index of the matched value, else `-1`.\n */\nfunction strictIndexOf(array, value, fromIndex) {\n  var index = fromIndex - 1,\n      length = array.length;\n\n  while (++index < length) {\n    if (array[index] === value) {\n      return index;\n    }\n  }\n  return -1;\n}\n\nmodule.exports = strictIndexOf;\n","/**\n * A specialized version of `_.lastIndexOf` which performs strict equality\n * comparisons of values, i.e. `===`.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {*} value The value to search for.\n * @param {number} fromIndex The index to search from.\n * @returns {number} Returns the index of the matched value, else `-1`.\n */\nfunction strictLastIndexOf(array, value, fromIndex) {\n  var index = fromIndex + 1;\n  while (index--) {\n    if (array[index] === value) {\n      return index;\n    }\n  }\n  return index;\n}\n\nmodule.exports = strictLastIndexOf;\n","var memoizeCapped = require('./_memoizeCapped');\n\n/** Used to match property names within property paths. */\nvar rePropName = /[^.[\\]]+|\\[(?:(-?\\d+(?:\\.\\d+)?)|([\"'])((?:(?!\\2)[^\\\\]|\\\\.)*?)\\2)\\]|(?=(?:\\.|\\[\\])(?:\\.|\\[\\]|$))/g;\n\n/** Used to match backslashes in property paths. */\nvar reEscapeChar = /\\\\(\\\\)?/g;\n\n/**\n * Converts `string` to a property path array.\n *\n * @private\n * @param {string} string The string to convert.\n * @returns {Array} Returns the property path array.\n */\nvar stringToPath = memoizeCapped(function(string) {\n  var result = [];\n  if (string.charCodeAt(0) === 46 /* . */) {\n    result.push('');\n  }\n  string.replace(rePropName, function(match, number, quote, subString) {\n    result.push(quote ? subString.replace(reEscapeChar, '$1') : (number || match));\n  });\n  return result;\n});\n\nmodule.exports = stringToPath;\n","var isSymbol = require('./isSymbol');\n\n/** Used as references for various `Number` constants. */\nvar INFINITY = 1 / 0;\n\n/**\n * Converts `value` to a string key if it's not a string or symbol.\n *\n * @private\n * @param {*} value The value to inspect.\n * @returns {string|symbol} Returns the key.\n */\nfunction toKey(value) {\n  if (typeof value == 'string' || isSymbol(value)) {\n    return value;\n  }\n  var result = (value + '');\n  return (result == '0' && (1 / value) == -INFINITY) ? '-0' : result;\n}\n\nmodule.exports = toKey;\n","/** Used for built-in method references. */\nvar funcProto = Function.prototype;\n\n/** Used to resolve the decompiled source of functions. */\nvar funcToString = funcProto.toString;\n\n/**\n * Converts `func` to its source code.\n *\n * @private\n * @param {Function} func The function to convert.\n * @returns {string} Returns the source code.\n */\nfunction toSource(func) {\n  if (func != null) {\n    try {\n      return funcToString.call(func);\n    } catch (e) {}\n    try {\n      return (func + '');\n    } catch (e) {}\n  }\n  return '';\n}\n\nmodule.exports = toSource;\n","/** Used to match a single whitespace character. */\nvar reWhitespace = /\\s/;\n\n/**\n * Used by `_.trim` and `_.trimEnd` to get the index of the last non-whitespace\n * character of `string`.\n *\n * @private\n * @param {string} string The string to inspect.\n * @returns {number} Returns the index of the last non-whitespace character.\n */\nfunction trimmedEndIndex(string) {\n  var index = string.length;\n\n  while (index-- && reWhitespace.test(string.charAt(index))) {}\n  return index;\n}\n\nmodule.exports = trimmedEndIndex;\n","module.exports = {\n  'chunk': require('./chunk'),\n  'compact': require('./compact'),\n  'concat': require('./concat'),\n  'difference': require('./difference'),\n  'differenceBy': require('./differenceBy'),\n  'differenceWith': require('./differenceWith'),\n  'drop': require('./drop'),\n  'dropRight': require('./dropRight'),\n  'dropRightWhile': require('./dropRightWhile'),\n  'dropWhile': require('./dropWhile'),\n  'fill': require('./fill'),\n  'findIndex': require('./findIndex'),\n  'findLastIndex': require('./findLastIndex'),\n  'first': require('./first'),\n  'flatten': require('./flatten'),\n  'flattenDeep': require('./flattenDeep'),\n  'flattenDepth': require('./flattenDepth'),\n  'fromPairs': require('./fromPairs'),\n  'head': require('./head'),\n  'indexOf': require('./indexOf'),\n  'initial': require('./initial'),\n  'intersection': require('./intersection'),\n  'intersectionBy': require('./intersectionBy'),\n  'intersectionWith': require('./intersectionWith'),\n  'join': require('./join'),\n  'last': require('./last'),\n  'lastIndexOf': require('./lastIndexOf'),\n  'nth': require('./nth'),\n  'pull': require('./pull'),\n  'pullAll': require('./pullAll'),\n  'pullAllBy': require('./pullAllBy'),\n  'pullAllWith': require('./pullAllWith'),\n  'pullAt': require('./pullAt'),\n  'remove': require('./remove'),\n  'reverse': require('./reverse'),\n  'slice': require('./slice'),\n  'sortedIndex': require('./sortedIndex'),\n  'sortedIndexBy': require('./sortedIndexBy'),\n  'sortedIndexOf': require('./sortedIndexOf'),\n  'sortedLastIndex': require('./sortedLastIndex'),\n  'sortedLastIndexBy': require('./sortedLastIndexBy'),\n  'sortedLastIndexOf': require('./sortedLastIndexOf'),\n  'sortedUniq': require('./sortedUniq'),\n  'sortedUniqBy': require('./sortedUniqBy'),\n  'tail': require('./tail'),\n  'take': require('./take'),\n  'takeRight': require('./takeRight'),\n  'takeRightWhile': require('./takeRightWhile'),\n  'takeWhile': require('./takeWhile'),\n  'union': require('./union'),\n  'unionBy': require('./unionBy'),\n  'unionWith': require('./unionWith'),\n  'uniq': require('./uniq'),\n  'uniqBy': require('./uniqBy'),\n  'uniqWith': require('./uniqWith'),\n  'unzip': require('./unzip'),\n  'unzipWith': require('./unzipWith'),\n  'without': require('./without'),\n  'xor': require('./xor'),\n  'xorBy': require('./xorBy'),\n  'xorWith': require('./xorWith'),\n  'zip': require('./zip'),\n  'zipObject': require('./zipObject'),\n  'zipObjectDeep': require('./zipObjectDeep'),\n  'zipWith': require('./zipWith')\n};\n","var baseSlice = require('./_baseSlice'),\n    isIterateeCall = require('./_isIterateeCall'),\n    toInteger = require('./toInteger');\n\n/* Built-in method references for those with the same name as other `lodash` methods. */\nvar nativeCeil = Math.ceil,\n    nativeMax = Math.max;\n\n/**\n * Creates an array of elements split into groups the length of `size`.\n * If `array` can't be split evenly, the final chunk will be the remaining\n * elements.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Array\n * @param {Array} array The array to process.\n * @param {number} [size=1] The length of each chunk\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n * @returns {Array} Returns the new array of chunks.\n * @example\n *\n * _.chunk(['a', 'b', 'c', 'd'], 2);\n * // => [['a', 'b'], ['c', 'd']]\n *\n * _.chunk(['a', 'b', 'c', 'd'], 3);\n * // => [['a', 'b', 'c'], ['d']]\n */\nfunction chunk(array, size, guard) {\n  if ((guard ? isIterateeCall(array, size, guard) : size === undefined)) {\n    size = 1;\n  } else {\n    size = nativeMax(toInteger(size), 0);\n  }\n  var length = array == null ? 0 : array.length;\n  if (!length || size < 1) {\n    return [];\n  }\n  var index = 0,\n      resIndex = 0,\n      result = Array(nativeCeil(length / size));\n\n  while (index < length) {\n    result[resIndex++] = baseSlice(array, index, (index += size));\n  }\n  return result;\n}\n\nmodule.exports = chunk;\n","/**\n * Creates an array with all falsey values removed. The values `false`, `null`,\n * `0`, `\"\"`, `undefined`, and `NaN` are falsey.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {Array} array The array to compact.\n * @returns {Array} Returns the new array of filtered values.\n * @example\n *\n * _.compact([0, 1, false, 2, '', 3]);\n * // => [1, 2, 3]\n */\nfunction compact(array) {\n  var index = -1,\n      length = array == null ? 0 : array.length,\n      resIndex = 0,\n      result = [];\n\n  while (++index < length) {\n    var value = array[index];\n    if (value) {\n      result[resIndex++] = value;\n    }\n  }\n  return result;\n}\n\nmodule.exports = compact;\n","var arrayPush = require('./_arrayPush'),\n    baseFlatten = require('./_baseFlatten'),\n    copyArray = require('./_copyArray'),\n    isArray = require('./isArray');\n\n/**\n * Creates a new array concatenating `array` with any additional arrays\n * and/or values.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The array to concatenate.\n * @param {...*} [values] The values to concatenate.\n * @returns {Array} Returns the new concatenated array.\n * @example\n *\n * var array = [1];\n * var other = _.concat(array, 2, [3], [[4]]);\n *\n * console.log(other);\n * // => [1, 2, 3, [4]]\n *\n * console.log(array);\n * // => [1]\n */\nfunction concat() {\n  var length = arguments.length;\n  if (!length) {\n    return [];\n  }\n  var args = Array(length - 1),\n      array = arguments[0],\n      index = length;\n\n  while (index--) {\n    args[index - 1] = arguments[index];\n  }\n  return arrayPush(isArray(array) ? copyArray(array) : [array], baseFlatten(args, 1));\n}\n\nmodule.exports = concat;\n","/**\n * Creates a function that returns `value`.\n *\n * @static\n * @memberOf _\n * @since 2.4.0\n * @category Util\n * @param {*} value The value to return from the new function.\n * @returns {Function} Returns the new constant function.\n * @example\n *\n * var objects = _.times(2, _.constant({ 'a': 1 }));\n *\n * console.log(objects);\n * // => [{ 'a': 1 }, { 'a': 1 }]\n *\n * console.log(objects[0] === objects[1]);\n * // => true\n */\nfunction constant(value) {\n  return function() {\n    return value;\n  };\n}\n\nmodule.exports = constant;\n","var baseDifference = require('./_baseDifference'),\n    baseFlatten = require('./_baseFlatten'),\n    baseRest = require('./_baseRest'),\n    isArrayLikeObject = require('./isArrayLikeObject');\n\n/**\n * Creates an array of `array` values not included in the other given arrays\n * using [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * for equality comparisons. The order and references of result values are\n * determined by the first array.\n *\n * **Note:** Unlike `_.pullAll`, this method returns a new array.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @param {...Array} [values] The values to exclude.\n * @returns {Array} Returns the new array of filtered values.\n * @see _.without, _.xor\n * @example\n *\n * _.difference([2, 1], [2, 3]);\n * // => [1]\n */\nvar difference = baseRest(function(array, values) {\n  return isArrayLikeObject(array)\n    ? baseDifference(array, baseFlatten(values, 1, isArrayLikeObject, true))\n    : [];\n});\n\nmodule.exports = difference;\n","var baseDifference = require('./_baseDifference'),\n    baseFlatten = require('./_baseFlatten'),\n    baseIteratee = require('./_baseIteratee'),\n    baseRest = require('./_baseRest'),\n    isArrayLikeObject = require('./isArrayLikeObject'),\n    last = require('./last');\n\n/**\n * This method is like `_.difference` except that it accepts `iteratee` which\n * is invoked for each element of `array` and `values` to generate the criterion\n * by which they're compared. The order and references of result values are\n * determined by the first array. The iteratee is invoked with one argument:\n * (value).\n *\n * **Note:** Unlike `_.pullAllBy`, this method returns a new array.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @param {...Array} [values] The values to exclude.\n * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n * @returns {Array} Returns the new array of filtered values.\n * @example\n *\n * _.differenceBy([2.1, 1.2], [2.3, 3.4], Math.floor);\n * // => [1.2]\n *\n * // The `_.property` iteratee shorthand.\n * _.differenceBy([{ 'x': 2 }, { 'x': 1 }], [{ 'x': 1 }], 'x');\n * // => [{ 'x': 2 }]\n */\nvar differenceBy = baseRest(function(array, values) {\n  var iteratee = last(values);\n  if (isArrayLikeObject(iteratee)) {\n    iteratee = undefined;\n  }\n  return isArrayLikeObject(array)\n    ? baseDifference(array, baseFlatten(values, 1, isArrayLikeObject, true), baseIteratee(iteratee, 2))\n    : [];\n});\n\nmodule.exports = differenceBy;\n","var baseDifference = require('./_baseDifference'),\n    baseFlatten = require('./_baseFlatten'),\n    baseRest = require('./_baseRest'),\n    isArrayLikeObject = require('./isArrayLikeObject'),\n    last = require('./last');\n\n/**\n * This method is like `_.difference` except that it accepts `comparator`\n * which is invoked to compare elements of `array` to `values`. The order and\n * references of result values are determined by the first array. The comparator\n * is invoked with two arguments: (arrVal, othVal).\n *\n * **Note:** Unlike `_.pullAllWith`, this method returns a new array.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @param {...Array} [values] The values to exclude.\n * @param {Function} [comparator] The comparator invoked per element.\n * @returns {Array} Returns the new array of filtered values.\n * @example\n *\n * var objects = [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }];\n *\n * _.differenceWith(objects, [{ 'x': 1, 'y': 2 }], _.isEqual);\n * // => [{ 'x': 2, 'y': 1 }]\n */\nvar differenceWith = baseRest(function(array, values) {\n  var comparator = last(values);\n  if (isArrayLikeObject(comparator)) {\n    comparator = undefined;\n  }\n  return isArrayLikeObject(array)\n    ? baseDifference(array, baseFlatten(values, 1, isArrayLikeObject, true), undefined, comparator)\n    : [];\n});\n\nmodule.exports = differenceWith;\n","var baseSlice = require('./_baseSlice'),\n    toInteger = require('./toInteger');\n\n/**\n * Creates a slice of `array` with `n` elements dropped from the beginning.\n *\n * @static\n * @memberOf _\n * @since 0.5.0\n * @category Array\n * @param {Array} array The array to query.\n * @param {number} [n=1] The number of elements to drop.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n * @returns {Array} Returns the slice of `array`.\n * @example\n *\n * _.drop([1, 2, 3]);\n * // => [2, 3]\n *\n * _.drop([1, 2, 3], 2);\n * // => [3]\n *\n * _.drop([1, 2, 3], 5);\n * // => []\n *\n * _.drop([1, 2, 3], 0);\n * // => [1, 2, 3]\n */\nfunction drop(array, n, guard) {\n  var length = array == null ? 0 : array.length;\n  if (!length) {\n    return [];\n  }\n  n = (guard || n === undefined) ? 1 : toInteger(n);\n  return baseSlice(array, n < 0 ? 0 : n, length);\n}\n\nmodule.exports = drop;\n","var baseSlice = require('./_baseSlice'),\n    toInteger = require('./toInteger');\n\n/**\n * Creates a slice of `array` with `n` elements dropped from the end.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Array\n * @param {Array} array The array to query.\n * @param {number} [n=1] The number of elements to drop.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n * @returns {Array} Returns the slice of `array`.\n * @example\n *\n * _.dropRight([1, 2, 3]);\n * // => [1, 2]\n *\n * _.dropRight([1, 2, 3], 2);\n * // => [1]\n *\n * _.dropRight([1, 2, 3], 5);\n * // => []\n *\n * _.dropRight([1, 2, 3], 0);\n * // => [1, 2, 3]\n */\nfunction dropRight(array, n, guard) {\n  var length = array == null ? 0 : array.length;\n  if (!length) {\n    return [];\n  }\n  n = (guard || n === undefined) ? 1 : toInteger(n);\n  n = length - n;\n  return baseSlice(array, 0, n < 0 ? 0 : n);\n}\n\nmodule.exports = dropRight;\n","var baseIteratee = require('./_baseIteratee'),\n    baseWhile = require('./_baseWhile');\n\n/**\n * Creates a slice of `array` excluding elements dropped from the end.\n * Elements are dropped until `predicate` returns falsey. The predicate is\n * invoked with three arguments: (value, index, array).\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Array\n * @param {Array} array The array to query.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @returns {Array} Returns the slice of `array`.\n * @example\n *\n * var users = [\n *   { 'user': 'barney',  'active': true },\n *   { 'user': 'fred',    'active': false },\n *   { 'user': 'pebbles', 'active': false }\n * ];\n *\n * _.dropRightWhile(users, function(o) { return !o.active; });\n * // => objects for ['barney']\n *\n * // The `_.matches` iteratee shorthand.\n * _.dropRightWhile(users, { 'user': 'pebbles', 'active': false });\n * // => objects for ['barney', 'fred']\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.dropRightWhile(users, ['active', false]);\n * // => objects for ['barney']\n *\n * // The `_.property` iteratee shorthand.\n * _.dropRightWhile(users, 'active');\n * // => objects for ['barney', 'fred', 'pebbles']\n */\nfunction dropRightWhile(array, predicate) {\n  return (array && array.length)\n    ? baseWhile(array, baseIteratee(predicate, 3), true, true)\n    : [];\n}\n\nmodule.exports = dropRightWhile;\n","var baseIteratee = require('./_baseIteratee'),\n    baseWhile = require('./_baseWhile');\n\n/**\n * Creates a slice of `array` excluding elements dropped from the beginning.\n * Elements are dropped until `predicate` returns falsey. The predicate is\n * invoked with three arguments: (value, index, array).\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Array\n * @param {Array} array The array to query.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @returns {Array} Returns the slice of `array`.\n * @example\n *\n * var users = [\n *   { 'user': 'barney',  'active': false },\n *   { 'user': 'fred',    'active': false },\n *   { 'user': 'pebbles', 'active': true }\n * ];\n *\n * _.dropWhile(users, function(o) { return !o.active; });\n * // => objects for ['pebbles']\n *\n * // The `_.matches` iteratee shorthand.\n * _.dropWhile(users, { 'user': 'barney', 'active': false });\n * // => objects for ['fred', 'pebbles']\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.dropWhile(users, ['active', false]);\n * // => objects for ['pebbles']\n *\n * // The `_.property` iteratee shorthand.\n * _.dropWhile(users, 'active');\n * // => objects for ['barney', 'fred', 'pebbles']\n */\nfunction dropWhile(array, predicate) {\n  return (array && array.length)\n    ? baseWhile(array, baseIteratee(predicate, 3), true)\n    : [];\n}\n\nmodule.exports = dropWhile;\n","/**\n * Performs a\n * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * comparison between two values to determine if they are equivalent.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to compare.\n * @param {*} other The other value to compare.\n * @returns {boolean} Returns `true` if the values are equivalent, else `false`.\n * @example\n *\n * var object = { 'a': 1 };\n * var other = { 'a': 1 };\n *\n * _.eq(object, object);\n * // => true\n *\n * _.eq(object, other);\n * // => false\n *\n * _.eq('a', 'a');\n * // => true\n *\n * _.eq('a', Object('a'));\n * // => false\n *\n * _.eq(NaN, NaN);\n * // => true\n */\nfunction eq(value, other) {\n  return value === other || (value !== value && other !== other);\n}\n\nmodule.exports = eq;\n","var baseFill = require('./_baseFill'),\n    isIterateeCall = require('./_isIterateeCall');\n\n/**\n * Fills elements of `array` with `value` from `start` up to, but not\n * including, `end`.\n *\n * **Note:** This method mutates `array`.\n *\n * @static\n * @memberOf _\n * @since 3.2.0\n * @category Array\n * @param {Array} array The array to fill.\n * @param {*} value The value to fill `array` with.\n * @param {number} [start=0] The start position.\n * @param {number} [end=array.length] The end position.\n * @returns {Array} Returns `array`.\n * @example\n *\n * var array = [1, 2, 3];\n *\n * _.fill(array, 'a');\n * console.log(array);\n * // => ['a', 'a', 'a']\n *\n * _.fill(Array(3), 2);\n * // => [2, 2, 2]\n *\n * _.fill([4, 6, 8, 10], '*', 1, 3);\n * // => [4, '*', '*', 10]\n */\nfunction fill(array, value, start, end) {\n  var length = array == null ? 0 : array.length;\n  if (!length) {\n    return [];\n  }\n  if (start && typeof start != 'number' && isIterateeCall(array, value, start)) {\n    start = 0;\n    end = length;\n  }\n  return baseFill(array, value, start, end);\n}\n\nmodule.exports = fill;\n","var baseFindIndex = require('./_baseFindIndex'),\n    baseIteratee = require('./_baseIteratee'),\n    toInteger = require('./toInteger');\n\n/* Built-in method references for those with the same name as other `lodash` methods. */\nvar nativeMax = Math.max;\n\n/**\n * This method is like `_.find` except that it returns the index of the first\n * element `predicate` returns truthy for instead of the element itself.\n *\n * @static\n * @memberOf _\n * @since 1.1.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @param {number} [fromIndex=0] The index to search from.\n * @returns {number} Returns the index of the found element, else `-1`.\n * @example\n *\n * var users = [\n *   { 'user': 'barney',  'active': false },\n *   { 'user': 'fred',    'active': false },\n *   { 'user': 'pebbles', 'active': true }\n * ];\n *\n * _.findIndex(users, function(o) { return o.user == 'barney'; });\n * // => 0\n *\n * // The `_.matches` iteratee shorthand.\n * _.findIndex(users, { 'user': 'fred', 'active': false });\n * // => 1\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.findIndex(users, ['active', false]);\n * // => 0\n *\n * // The `_.property` iteratee shorthand.\n * _.findIndex(users, 'active');\n * // => 2\n */\nfunction findIndex(array, predicate, fromIndex) {\n  var length = array == null ? 0 : array.length;\n  if (!length) {\n    return -1;\n  }\n  var index = fromIndex == null ? 0 : toInteger(fromIndex);\n  if (index < 0) {\n    index = nativeMax(length + index, 0);\n  }\n  return baseFindIndex(array, baseIteratee(predicate, 3), index);\n}\n\nmodule.exports = findIndex;\n","var baseFindIndex = require('./_baseFindIndex'),\n    baseIteratee = require('./_baseIteratee'),\n    toInteger = require('./toInteger');\n\n/* Built-in method references for those with the same name as other `lodash` methods. */\nvar nativeMax = Math.max,\n    nativeMin = Math.min;\n\n/**\n * This method is like `_.findIndex` except that it iterates over elements\n * of `collection` from right to left.\n *\n * @static\n * @memberOf _\n * @since 2.0.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @param {number} [fromIndex=array.length-1] The index to search from.\n * @returns {number} Returns the index of the found element, else `-1`.\n * @example\n *\n * var users = [\n *   { 'user': 'barney',  'active': true },\n *   { 'user': 'fred',    'active': false },\n *   { 'user': 'pebbles', 'active': false }\n * ];\n *\n * _.findLastIndex(users, function(o) { return o.user == 'pebbles'; });\n * // => 2\n *\n * // The `_.matches` iteratee shorthand.\n * _.findLastIndex(users, { 'user': 'barney', 'active': true });\n * // => 0\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.findLastIndex(users, ['active', false]);\n * // => 2\n *\n * // The `_.property` iteratee shorthand.\n * _.findLastIndex(users, 'active');\n * // => 0\n */\nfunction findLastIndex(array, predicate, fromIndex) {\n  var length = array == null ? 0 : array.length;\n  if (!length) {\n    return -1;\n  }\n  var index = length - 1;\n  if (fromIndex !== undefined) {\n    index = toInteger(fromIndex);\n    index = fromIndex < 0\n      ? nativeMax(length + index, 0)\n      : nativeMin(index, length - 1);\n  }\n  return baseFindIndex(array, baseIteratee(predicate, 3), index, true);\n}\n\nmodule.exports = findLastIndex;\n","module.exports = require('./head');\n","var baseFlatten = require('./_baseFlatten');\n\n/**\n * Flattens `array` a single level deep.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {Array} array The array to flatten.\n * @returns {Array} Returns the new flattened array.\n * @example\n *\n * _.flatten([1, [2, [3, [4]], 5]]);\n * // => [1, 2, [3, [4]], 5]\n */\nfunction flatten(array) {\n  var length = array == null ? 0 : array.length;\n  return length ? baseFlatten(array, 1) : [];\n}\n\nmodule.exports = flatten;\n","var baseFlatten = require('./_baseFlatten');\n\n/** Used as references for various `Number` constants. */\nvar INFINITY = 1 / 0;\n\n/**\n * Recursively flattens `array`.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Array\n * @param {Array} array The array to flatten.\n * @returns {Array} Returns the new flattened array.\n * @example\n *\n * _.flattenDeep([1, [2, [3, [4]], 5]]);\n * // => [1, 2, 3, 4, 5]\n */\nfunction flattenDeep(array) {\n  var length = array == null ? 0 : array.length;\n  return length ? baseFlatten(array, INFINITY) : [];\n}\n\nmodule.exports = flattenDeep;\n","var baseFlatten = require('./_baseFlatten'),\n    toInteger = require('./toInteger');\n\n/**\n * Recursively flatten `array` up to `depth` times.\n *\n * @static\n * @memberOf _\n * @since 4.4.0\n * @category Array\n * @param {Array} array The array to flatten.\n * @param {number} [depth=1] The maximum recursion depth.\n * @returns {Array} Returns the new flattened array.\n * @example\n *\n * var array = [1, [2, [3, [4]], 5]];\n *\n * _.flattenDepth(array, 1);\n * // => [1, 2, [3, [4]], 5]\n *\n * _.flattenDepth(array, 2);\n * // => [1, 2, 3, [4], 5]\n */\nfunction flattenDepth(array, depth) {\n  var length = array == null ? 0 : array.length;\n  if (!length) {\n    return [];\n  }\n  depth = depth === undefined ? 1 : toInteger(depth);\n  return baseFlatten(array, depth);\n}\n\nmodule.exports = flattenDepth;\n","/**\n * The inverse of `_.toPairs`; this method returns an object composed\n * from key-value `pairs`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} pairs The key-value pairs.\n * @returns {Object} Returns the new object.\n * @example\n *\n * _.fromPairs([['a', 1], ['b', 2]]);\n * // => { 'a': 1, 'b': 2 }\n */\nfunction fromPairs(pairs) {\n  var index = -1,\n      length = pairs == null ? 0 : pairs.length,\n      result = {};\n\n  while (++index < length) {\n    var pair = pairs[index];\n    result[pair[0]] = pair[1];\n  }\n  return result;\n}\n\nmodule.exports = fromPairs;\n","var baseGet = require('./_baseGet');\n\n/**\n * Gets the value at `path` of `object`. If the resolved value is\n * `undefined`, the `defaultValue` is returned in its place.\n *\n * @static\n * @memberOf _\n * @since 3.7.0\n * @category Object\n * @param {Object} object The object to query.\n * @param {Array|string} path The path of the property to get.\n * @param {*} [defaultValue] The value returned for `undefined` resolved values.\n * @returns {*} Returns the resolved value.\n * @example\n *\n * var object = { 'a': [{ 'b': { 'c': 3 } }] };\n *\n * _.get(object, 'a[0].b.c');\n * // => 3\n *\n * _.get(object, ['a', '0', 'b', 'c']);\n * // => 3\n *\n * _.get(object, 'a.b.c', 'default');\n * // => 'default'\n */\nfunction get(object, path, defaultValue) {\n  var result = object == null ? undefined : baseGet(object, path);\n  return result === undefined ? defaultValue : result;\n}\n\nmodule.exports = get;\n","var baseHasIn = require('./_baseHasIn'),\n    hasPath = require('./_hasPath');\n\n/**\n * Checks if `path` is a direct or inherited property of `object`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Object\n * @param {Object} object The object to query.\n * @param {Array|string} path The path to check.\n * @returns {boolean} Returns `true` if `path` exists, else `false`.\n * @example\n *\n * var object = _.create({ 'a': _.create({ 'b': 2 }) });\n *\n * _.hasIn(object, 'a');\n * // => true\n *\n * _.hasIn(object, 'a.b');\n * // => true\n *\n * _.hasIn(object, ['a', 'b']);\n * // => true\n *\n * _.hasIn(object, 'b');\n * // => false\n */\nfunction hasIn(object, path) {\n  return object != null && hasPath(object, path, baseHasIn);\n}\n\nmodule.exports = hasIn;\n","/**\n * Gets the first element of `array`.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @alias first\n * @category Array\n * @param {Array} array The array to query.\n * @returns {*} Returns the first element of `array`.\n * @example\n *\n * _.head([1, 2, 3]);\n * // => 1\n *\n * _.head([]);\n * // => undefined\n */\nfunction head(array) {\n  return (array && array.length) ? array[0] : undefined;\n}\n\nmodule.exports = head;\n","/**\n * This method returns the first argument it receives.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Util\n * @param {*} value Any value.\n * @returns {*} Returns `value`.\n * @example\n *\n * var object = { 'a': 1 };\n *\n * console.log(_.identity(object) === object);\n * // => true\n */\nfunction identity(value) {\n  return value;\n}\n\nmodule.exports = identity;\n","var baseIndexOf = require('./_baseIndexOf'),\n    toInteger = require('./toInteger');\n\n/* Built-in method references for those with the same name as other `lodash` methods. */\nvar nativeMax = Math.max;\n\n/**\n * Gets the index at which the first occurrence of `value` is found in `array`\n * using [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * for equality comparisons. If `fromIndex` is negative, it's used as the\n * offset from the end of `array`.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @param {*} value The value to search for.\n * @param {number} [fromIndex=0] The index to search from.\n * @returns {number} Returns the index of the matched value, else `-1`.\n * @example\n *\n * _.indexOf([1, 2, 1, 2], 2);\n * // => 1\n *\n * // Search from the `fromIndex`.\n * _.indexOf([1, 2, 1, 2], 2, 2);\n * // => 3\n */\nfunction indexOf(array, value, fromIndex) {\n  var length = array == null ? 0 : array.length;\n  if (!length) {\n    return -1;\n  }\n  var index = fromIndex == null ? 0 : toInteger(fromIndex);\n  if (index < 0) {\n    index = nativeMax(length + index, 0);\n  }\n  return baseIndexOf(array, value, index);\n}\n\nmodule.exports = indexOf;\n","var baseSlice = require('./_baseSlice');\n\n/**\n * Gets all but the last element of `array`.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {Array} array The array to query.\n * @returns {Array} Returns the slice of `array`.\n * @example\n *\n * _.initial([1, 2, 3]);\n * // => [1, 2]\n */\nfunction initial(array) {\n  var length = array == null ? 0 : array.length;\n  return length ? baseSlice(array, 0, -1) : [];\n}\n\nmodule.exports = initial;\n","var arrayMap = require('./_arrayMap'),\n    baseIntersection = require('./_baseIntersection'),\n    baseRest = require('./_baseRest'),\n    castArrayLikeObject = require('./_castArrayLikeObject');\n\n/**\n * Creates an array of unique values that are included in all given arrays\n * using [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * for equality comparisons. The order and references of result values are\n * determined by the first array.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {...Array} [arrays] The arrays to inspect.\n * @returns {Array} Returns the new array of intersecting values.\n * @example\n *\n * _.intersection([2, 1], [2, 3]);\n * // => [2]\n */\nvar intersection = baseRest(function(arrays) {\n  var mapped = arrayMap(arrays, castArrayLikeObject);\n  return (mapped.length && mapped[0] === arrays[0])\n    ? baseIntersection(mapped)\n    : [];\n});\n\nmodule.exports = intersection;\n","var arrayMap = require('./_arrayMap'),\n    baseIntersection = require('./_baseIntersection'),\n    baseIteratee = require('./_baseIteratee'),\n    baseRest = require('./_baseRest'),\n    castArrayLikeObject = require('./_castArrayLikeObject'),\n    last = require('./last');\n\n/**\n * This method is like `_.intersection` except that it accepts `iteratee`\n * which is invoked for each element of each `arrays` to generate the criterion\n * by which they're compared. The order and references of result values are\n * determined by the first array. The iteratee is invoked with one argument:\n * (value).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {...Array} [arrays] The arrays to inspect.\n * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n * @returns {Array} Returns the new array of intersecting values.\n * @example\n *\n * _.intersectionBy([2.1, 1.2], [2.3, 3.4], Math.floor);\n * // => [2.1]\n *\n * // The `_.property` iteratee shorthand.\n * _.intersectionBy([{ 'x': 1 }], [{ 'x': 2 }, { 'x': 1 }], 'x');\n * // => [{ 'x': 1 }]\n */\nvar intersectionBy = baseRest(function(arrays) {\n  var iteratee = last(arrays),\n      mapped = arrayMap(arrays, castArrayLikeObject);\n\n  if (iteratee === last(mapped)) {\n    iteratee = undefined;\n  } else {\n    mapped.pop();\n  }\n  return (mapped.length && mapped[0] === arrays[0])\n    ? baseIntersection(mapped, baseIteratee(iteratee, 2))\n    : [];\n});\n\nmodule.exports = intersectionBy;\n","var arrayMap = require('./_arrayMap'),\n    baseIntersection = require('./_baseIntersection'),\n    baseRest = require('./_baseRest'),\n    castArrayLikeObject = require('./_castArrayLikeObject'),\n    last = require('./last');\n\n/**\n * This method is like `_.intersection` except that it accepts `comparator`\n * which is invoked to compare elements of `arrays`. The order and references\n * of result values are determined by the first array. The comparator is\n * invoked with two arguments: (arrVal, othVal).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {...Array} [arrays] The arrays to inspect.\n * @param {Function} [comparator] The comparator invoked per element.\n * @returns {Array} Returns the new array of intersecting values.\n * @example\n *\n * var objects = [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }];\n * var others = [{ 'x': 1, 'y': 1 }, { 'x': 1, 'y': 2 }];\n *\n * _.intersectionWith(objects, others, _.isEqual);\n * // => [{ 'x': 1, 'y': 2 }]\n */\nvar intersectionWith = baseRest(function(arrays) {\n  var comparator = last(arrays),\n      mapped = arrayMap(arrays, castArrayLikeObject);\n\n  comparator = typeof comparator == 'function' ? comparator : undefined;\n  if (comparator) {\n    mapped.pop();\n  }\n  return (mapped.length && mapped[0] === arrays[0])\n    ? baseIntersection(mapped, undefined, comparator)\n    : [];\n});\n\nmodule.exports = intersectionWith;\n","var baseIsArguments = require('./_baseIsArguments'),\n    isObjectLike = require('./isObjectLike');\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/** Built-in value references. */\nvar propertyIsEnumerable = objectProto.propertyIsEnumerable;\n\n/**\n * Checks if `value` is likely an `arguments` object.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an `arguments` object,\n *  else `false`.\n * @example\n *\n * _.isArguments(function() { return arguments; }());\n * // => true\n *\n * _.isArguments([1, 2, 3]);\n * // => false\n */\nvar isArguments = baseIsArguments(function() { return arguments; }()) ? baseIsArguments : function(value) {\n  return isObjectLike(value) && hasOwnProperty.call(value, 'callee') &&\n    !propertyIsEnumerable.call(value, 'callee');\n};\n\nmodule.exports = isArguments;\n","var isFunction = require('./isFunction'),\n    isLength = require('./isLength');\n\n/**\n * Checks if `value` is array-like. A value is considered array-like if it's\n * not a function and has a `value.length` that's an integer greater than or\n * equal to `0` and less than or equal to `Number.MAX_SAFE_INTEGER`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is array-like, else `false`.\n * @example\n *\n * _.isArrayLike([1, 2, 3]);\n * // => true\n *\n * _.isArrayLike(document.body.children);\n * // => true\n *\n * _.isArrayLike('abc');\n * // => true\n *\n * _.isArrayLike(_.noop);\n * // => false\n */\nfunction isArrayLike(value) {\n  return value != null && isLength(value.length) && !isFunction(value);\n}\n\nmodule.exports = isArrayLike;\n","var isArrayLike = require('./isArrayLike'),\n    isObjectLike = require('./isObjectLike');\n\n/**\n * This method is like `_.isArrayLike` except that it also checks if `value`\n * is an object.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an array-like object,\n *  else `false`.\n * @example\n *\n * _.isArrayLikeObject([1, 2, 3]);\n * // => true\n *\n * _.isArrayLikeObject(document.body.children);\n * // => true\n *\n * _.isArrayLikeObject('abc');\n * // => false\n *\n * _.isArrayLikeObject(_.noop);\n * // => false\n */\nfunction isArrayLikeObject(value) {\n  return isObjectLike(value) && isArrayLike(value);\n}\n\nmodule.exports = isArrayLikeObject;\n","var root = require('./_root'),\n    stubFalse = require('./stubFalse');\n\n/** Detect free variable `exports`. */\nvar freeExports = typeof exports == 'object' && exports && !exports.nodeType && exports;\n\n/** Detect free variable `module`. */\nvar freeModule = freeExports && typeof module == 'object' && module && !module.nodeType && module;\n\n/** Detect the popular CommonJS extension `module.exports`. */\nvar moduleExports = freeModule && freeModule.exports === freeExports;\n\n/** Built-in value references. */\nvar Buffer = moduleExports ? root.Buffer : undefined;\n\n/* Built-in method references for those with the same name as other `lodash` methods. */\nvar nativeIsBuffer = Buffer ? Buffer.isBuffer : undefined;\n\n/**\n * Checks if `value` is a buffer.\n *\n * @static\n * @memberOf _\n * @since 4.3.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a buffer, else `false`.\n * @example\n *\n * _.isBuffer(new Buffer(2));\n * // => true\n *\n * _.isBuffer(new Uint8Array(2));\n * // => false\n */\nvar isBuffer = nativeIsBuffer || stubFalse;\n\nmodule.exports = isBuffer;\n","var baseGetTag = require('./_baseGetTag'),\n    isObject = require('./isObject');\n\n/** `Object#toString` result references. */\nvar asyncTag = '[object AsyncFunction]',\n    funcTag = '[object Function]',\n    genTag = '[object GeneratorFunction]',\n    proxyTag = '[object Proxy]';\n\n/**\n * Checks if `value` is classified as a `Function` object.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a function, else `false`.\n * @example\n *\n * _.isFunction(_);\n * // => true\n *\n * _.isFunction(/abc/);\n * // => false\n */\nfunction isFunction(value) {\n  if (!isObject(value)) {\n    return false;\n  }\n  // The use of `Object#toString` avoids issues with the `typeof` operator\n  // in Safari 9 which returns 'object' for typed arrays and other constructors.\n  var tag = baseGetTag(value);\n  return tag == funcTag || tag == genTag || tag == asyncTag || tag == proxyTag;\n}\n\nmodule.exports = isFunction;\n","/** Used as references for various `Number` constants. */\nvar MAX_SAFE_INTEGER = 9007199254740991;\n\n/**\n * Checks if `value` is a valid array-like length.\n *\n * **Note:** This method is loosely based on\n * [`ToLength`](http://ecma-international.org/ecma-262/7.0/#sec-tolength).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a valid length, else `false`.\n * @example\n *\n * _.isLength(3);\n * // => true\n *\n * _.isLength(Number.MIN_VALUE);\n * // => false\n *\n * _.isLength(Infinity);\n * // => false\n *\n * _.isLength('3');\n * // => false\n */\nfunction isLength(value) {\n  return typeof value == 'number' &&\n    value > -1 && value % 1 == 0 && value <= MAX_SAFE_INTEGER;\n}\n\nmodule.exports = isLength;\n","/**\n * Checks if `value` is the\n * [language type](http://www.ecma-international.org/ecma-262/7.0/#sec-ecmascript-language-types)\n * of `Object`. (e.g. arrays, functions, objects, regexes, `new Number(0)`, and `new String('')`)\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an object, else `false`.\n * @example\n *\n * _.isObject({});\n * // => true\n *\n * _.isObject([1, 2, 3]);\n * // => true\n *\n * _.isObject(_.noop);\n * // => true\n *\n * _.isObject(null);\n * // => false\n */\nfunction isObject(value) {\n  var type = typeof value;\n  return value != null && (type == 'object' || type == 'function');\n}\n\nmodule.exports = isObject;\n","var baseGetTag = require('./_baseGetTag'),\n    isObjectLike = require('./isObjectLike');\n\n/** `Object#toString` result references. */\nvar symbolTag = '[object Symbol]';\n\n/**\n * Checks if `value` is classified as a `Symbol` primitive or object.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a symbol, else `false`.\n * @example\n *\n * _.isSymbol(Symbol.iterator);\n * // => true\n *\n * _.isSymbol('abc');\n * // => false\n */\nfunction isSymbol(value) {\n  return typeof value == 'symbol' ||\n    (isObjectLike(value) && baseGetTag(value) == symbolTag);\n}\n\nmodule.exports = isSymbol;\n","var baseIsTypedArray = require('./_baseIsTypedArray'),\n    baseUnary = require('./_baseUnary'),\n    nodeUtil = require('./_nodeUtil');\n\n/* Node.js helper references. */\nvar nodeIsTypedArray = nodeUtil && nodeUtil.isTypedArray;\n\n/**\n * Checks if `value` is classified as a typed array.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a typed array, else `false`.\n * @example\n *\n * _.isTypedArray(new Uint8Array);\n * // => true\n *\n * _.isTypedArray([]);\n * // => false\n */\nvar isTypedArray = nodeIsTypedArray ? baseUnary(nodeIsTypedArray) : baseIsTypedArray;\n\nmodule.exports = isTypedArray;\n","/** Used for built-in method references. */\nvar arrayProto = Array.prototype;\n\n/* Built-in method references for those with the same name as other `lodash` methods. */\nvar nativeJoin = arrayProto.join;\n\n/**\n * Converts all elements in `array` into a string separated by `separator`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The array to convert.\n * @param {string} [separator=','] The element separator.\n * @returns {string} Returns the joined string.\n * @example\n *\n * _.join(['a', 'b', 'c'], '~');\n * // => 'a~b~c'\n */\nfunction join(array, separator) {\n  return array == null ? '' : nativeJoin.call(array, separator);\n}\n\nmodule.exports = join;\n","var arrayLikeKeys = require('./_arrayLikeKeys'),\n    baseKeys = require('./_baseKeys'),\n    isArrayLike = require('./isArrayLike');\n\n/**\n * Creates an array of the own enumerable property names of `object`.\n *\n * **Note:** Non-object values are coerced to objects. See the\n * [ES spec](http://ecma-international.org/ecma-262/7.0/#sec-object.keys)\n * for more details.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Object\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names.\n * @example\n *\n * function Foo() {\n *   this.a = 1;\n *   this.b = 2;\n * }\n *\n * Foo.prototype.c = 3;\n *\n * _.keys(new Foo);\n * // => ['a', 'b'] (iteration order is not guaranteed)\n *\n * _.keys('hi');\n * // => ['0', '1']\n */\nfunction keys(object) {\n  return isArrayLike(object) ? arrayLikeKeys(object) : baseKeys(object);\n}\n\nmodule.exports = keys;\n","/**\n * Gets the last element of `array`.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {Array} array The array to query.\n * @returns {*} Returns the last element of `array`.\n * @example\n *\n * _.last([1, 2, 3]);\n * // => 3\n */\nfunction last(array) {\n  var length = array == null ? 0 : array.length;\n  return length ? array[length - 1] : undefined;\n}\n\nmodule.exports = last;\n","var baseFindIndex = require('./_baseFindIndex'),\n    baseIsNaN = require('./_baseIsNaN'),\n    strictLastIndexOf = require('./_strictLastIndexOf'),\n    toInteger = require('./toInteger');\n\n/* Built-in method references for those with the same name as other `lodash` methods. */\nvar nativeMax = Math.max,\n    nativeMin = Math.min;\n\n/**\n * This method is like `_.indexOf` except that it iterates over elements of\n * `array` from right to left.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @param {*} value The value to search for.\n * @param {number} [fromIndex=array.length-1] The index to search from.\n * @returns {number} Returns the index of the matched value, else `-1`.\n * @example\n *\n * _.lastIndexOf([1, 2, 1, 2], 2);\n * // => 3\n *\n * // Search from the `fromIndex`.\n * _.lastIndexOf([1, 2, 1, 2], 2, 2);\n * // => 1\n */\nfunction lastIndexOf(array, value, fromIndex) {\n  var length = array == null ? 0 : array.length;\n  if (!length) {\n    return -1;\n  }\n  var index = length;\n  if (fromIndex !== undefined) {\n    index = toInteger(fromIndex);\n    index = index < 0 ? nativeMax(length + index, 0) : nativeMin(index, length - 1);\n  }\n  return value === value\n    ? strictLastIndexOf(array, value, index)\n    : baseFindIndex(array, baseIsNaN, index, true);\n}\n\nmodule.exports = lastIndexOf;\n","var MapCache = require('./_MapCache');\n\n/** Error message constants. */\nvar FUNC_ERROR_TEXT = 'Expected a function';\n\n/**\n * Creates a function that memoizes the result of `func`. If `resolver` is\n * provided, it determines the cache key for storing the result based on the\n * arguments provided to the memoized function. By default, the first argument\n * provided to the memoized function is used as the map cache key. The `func`\n * is invoked with the `this` binding of the memoized function.\n *\n * **Note:** The cache is exposed as the `cache` property on the memoized\n * function. Its creation may be customized by replacing the `_.memoize.Cache`\n * constructor with one whose instances implement the\n * [`Map`](http://ecma-international.org/ecma-262/7.0/#sec-properties-of-the-map-prototype-object)\n * method interface of `clear`, `delete`, `get`, `has`, and `set`.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Function\n * @param {Function} func The function to have its output memoized.\n * @param {Function} [resolver] The function to resolve the cache key.\n * @returns {Function} Returns the new memoized function.\n * @example\n *\n * var object = { 'a': 1, 'b': 2 };\n * var other = { 'c': 3, 'd': 4 };\n *\n * var values = _.memoize(_.values);\n * values(object);\n * // => [1, 2]\n *\n * values(other);\n * // => [3, 4]\n *\n * object.a = 2;\n * values(object);\n * // => [1, 2]\n *\n * // Modify the result cache.\n * values.cache.set(object, ['a', 'b']);\n * values(object);\n * // => ['a', 'b']\n *\n * // Replace `_.memoize.Cache`.\n * _.memoize.Cache = WeakMap;\n */\nfunction memoize(func, resolver) {\n  if (typeof func != 'function' || (resolver != null && typeof resolver != 'function')) {\n    throw new TypeError(FUNC_ERROR_TEXT);\n  }\n  var memoized = function() {\n    var args = arguments,\n        key = resolver ? resolver.apply(this, args) : args[0],\n        cache = memoized.cache;\n\n    if (cache.has(key)) {\n      return cache.get(key);\n    }\n    var result = func.apply(this, args);\n    memoized.cache = cache.set(key, result) || cache;\n    return result;\n  };\n  memoized.cache = new (memoize.Cache || MapCache);\n  return memoized;\n}\n\n// Expose `MapCache`.\nmemoize.Cache = MapCache;\n\nmodule.exports = memoize;\n","/**\n * This method returns `undefined`.\n *\n * @static\n * @memberOf _\n * @since 2.3.0\n * @category Util\n * @example\n *\n * _.times(2, _.noop);\n * // => [undefined, undefined]\n */\nfunction noop() {\n  // No operation performed.\n}\n\nmodule.exports = noop;\n","var baseNth = require('./_baseNth'),\n    toInteger = require('./toInteger');\n\n/**\n * Gets the element at index `n` of `array`. If `n` is negative, the nth\n * element from the end is returned.\n *\n * @static\n * @memberOf _\n * @since 4.11.0\n * @category Array\n * @param {Array} array The array to query.\n * @param {number} [n=0] The index of the element to return.\n * @returns {*} Returns the nth element of `array`.\n * @example\n *\n * var array = ['a', 'b', 'c', 'd'];\n *\n * _.nth(array, 1);\n * // => 'b'\n *\n * _.nth(array, -2);\n * // => 'c';\n */\nfunction nth(array, n) {\n  return (array && array.length) ? baseNth(array, toInteger(n)) : undefined;\n}\n\nmodule.exports = nth;\n","var baseProperty = require('./_baseProperty'),\n    basePropertyDeep = require('./_basePropertyDeep'),\n    isKey = require('./_isKey'),\n    toKey = require('./_toKey');\n\n/**\n * Creates a function that returns the value at `path` of a given object.\n *\n * @static\n * @memberOf _\n * @since 2.4.0\n * @category Util\n * @param {Array|string} path The path of the property to get.\n * @returns {Function} Returns the new accessor function.\n * @example\n *\n * var objects = [\n *   { 'a': { 'b': 2 } },\n *   { 'a': { 'b': 1 } }\n * ];\n *\n * _.map(objects, _.property('a.b'));\n * // => [2, 1]\n *\n * _.map(_.sortBy(objects, _.property(['a', 'b'])), 'a.b');\n * // => [1, 2]\n */\nfunction property(path) {\n  return isKey(path) ? baseProperty(toKey(path)) : basePropertyDeep(path);\n}\n\nmodule.exports = property;\n","var baseRest = require('./_baseRest'),\n    pullAll = require('./pullAll');\n\n/**\n * Removes all given values from `array` using\n * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * for equality comparisons.\n *\n * **Note:** Unlike `_.without`, this method mutates `array`. Use `_.remove`\n * to remove elements from an array by predicate.\n *\n * @static\n * @memberOf _\n * @since 2.0.0\n * @category Array\n * @param {Array} array The array to modify.\n * @param {...*} [values] The values to remove.\n * @returns {Array} Returns `array`.\n * @example\n *\n * var array = ['a', 'b', 'c', 'a', 'b', 'c'];\n *\n * _.pull(array, 'a', 'c');\n * console.log(array);\n * // => ['b', 'b']\n */\nvar pull = baseRest(pullAll);\n\nmodule.exports = pull;\n","var basePullAll = require('./_basePullAll');\n\n/**\n * This method is like `_.pull` except that it accepts an array of values to remove.\n *\n * **Note:** Unlike `_.difference`, this method mutates `array`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The array to modify.\n * @param {Array} values The values to remove.\n * @returns {Array} Returns `array`.\n * @example\n *\n * var array = ['a', 'b', 'c', 'a', 'b', 'c'];\n *\n * _.pullAll(array, ['a', 'c']);\n * console.log(array);\n * // => ['b', 'b']\n */\nfunction pullAll(array, values) {\n  return (array && array.length && values && values.length)\n    ? basePullAll(array, values)\n    : array;\n}\n\nmodule.exports = pullAll;\n","var baseIteratee = require('./_baseIteratee'),\n    basePullAll = require('./_basePullAll');\n\n/**\n * This method is like `_.pullAll` except that it accepts `iteratee` which is\n * invoked for each element of `array` and `values` to generate the criterion\n * by which they're compared. The iteratee is invoked with one argument: (value).\n *\n * **Note:** Unlike `_.differenceBy`, this method mutates `array`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The array to modify.\n * @param {Array} values The values to remove.\n * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n * @returns {Array} Returns `array`.\n * @example\n *\n * var array = [{ 'x': 1 }, { 'x': 2 }, { 'x': 3 }, { 'x': 1 }];\n *\n * _.pullAllBy(array, [{ 'x': 1 }, { 'x': 3 }], 'x');\n * console.log(array);\n * // => [{ 'x': 2 }]\n */\nfunction pullAllBy(array, values, iteratee) {\n  return (array && array.length && values && values.length)\n    ? basePullAll(array, values, baseIteratee(iteratee, 2))\n    : array;\n}\n\nmodule.exports = pullAllBy;\n","var basePullAll = require('./_basePullAll');\n\n/**\n * This method is like `_.pullAll` except that it accepts `comparator` which\n * is invoked to compare elements of `array` to `values`. The comparator is\n * invoked with two arguments: (arrVal, othVal).\n *\n * **Note:** Unlike `_.differenceWith`, this method mutates `array`.\n *\n * @static\n * @memberOf _\n * @since 4.6.0\n * @category Array\n * @param {Array} array The array to modify.\n * @param {Array} values The values to remove.\n * @param {Function} [comparator] The comparator invoked per element.\n * @returns {Array} Returns `array`.\n * @example\n *\n * var array = [{ 'x': 1, 'y': 2 }, { 'x': 3, 'y': 4 }, { 'x': 5, 'y': 6 }];\n *\n * _.pullAllWith(array, [{ 'x': 3, 'y': 4 }], _.isEqual);\n * console.log(array);\n * // => [{ 'x': 1, 'y': 2 }, { 'x': 5, 'y': 6 }]\n */\nfunction pullAllWith(array, values, comparator) {\n  return (array && array.length && values && values.length)\n    ? basePullAll(array, values, undefined, comparator)\n    : array;\n}\n\nmodule.exports = pullAllWith;\n","var arrayMap = require('./_arrayMap'),\n    baseAt = require('./_baseAt'),\n    basePullAt = require('./_basePullAt'),\n    compareAscending = require('./_compareAscending'),\n    flatRest = require('./_flatRest'),\n    isIndex = require('./_isIndex');\n\n/**\n * Removes elements from `array` corresponding to `indexes` and returns an\n * array of removed elements.\n *\n * **Note:** Unlike `_.at`, this method mutates `array`.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Array\n * @param {Array} array The array to modify.\n * @param {...(number|number[])} [indexes] The indexes of elements to remove.\n * @returns {Array} Returns the new array of removed elements.\n * @example\n *\n * var array = ['a', 'b', 'c', 'd'];\n * var pulled = _.pullAt(array, [1, 3]);\n *\n * console.log(array);\n * // => ['a', 'c']\n *\n * console.log(pulled);\n * // => ['b', 'd']\n */\nvar pullAt = flatRest(function(array, indexes) {\n  var length = array == null ? 0 : array.length,\n      result = baseAt(array, indexes);\n\n  basePullAt(array, arrayMap(indexes, function(index) {\n    return isIndex(index, length) ? +index : index;\n  }).sort(compareAscending));\n\n  return result;\n});\n\nmodule.exports = pullAt;\n","var baseIteratee = require('./_baseIteratee'),\n    basePullAt = require('./_basePullAt');\n\n/**\n * Removes all elements from `array` that `predicate` returns truthy for\n * and returns an array of the removed elements. The predicate is invoked\n * with three arguments: (value, index, array).\n *\n * **Note:** Unlike `_.filter`, this method mutates `array`. Use `_.pull`\n * to pull elements from an array by value.\n *\n * @static\n * @memberOf _\n * @since 2.0.0\n * @category Array\n * @param {Array} array The array to modify.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @returns {Array} Returns the new array of removed elements.\n * @example\n *\n * var array = [1, 2, 3, 4];\n * var evens = _.remove(array, function(n) {\n *   return n % 2 == 0;\n * });\n *\n * console.log(array);\n * // => [1, 3]\n *\n * console.log(evens);\n * // => [2, 4]\n */\nfunction remove(array, predicate) {\n  var result = [];\n  if (!(array && array.length)) {\n    return result;\n  }\n  var index = -1,\n      indexes = [],\n      length = array.length;\n\n  predicate = baseIteratee(predicate, 3);\n  while (++index < length) {\n    var value = array[index];\n    if (predicate(value, index, array)) {\n      result.push(value);\n      indexes.push(index);\n    }\n  }\n  basePullAt(array, indexes);\n  return result;\n}\n\nmodule.exports = remove;\n","/** Used for built-in method references. */\nvar arrayProto = Array.prototype;\n\n/* Built-in method references for those with the same name as other `lodash` methods. */\nvar nativeReverse = arrayProto.reverse;\n\n/**\n * Reverses `array` so that the first element becomes the last, the second\n * element becomes the second to last, and so on.\n *\n * **Note:** This method mutates `array` and is based on\n * [`Array#reverse`](https://mdn.io/Array/reverse).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The array to modify.\n * @returns {Array} Returns `array`.\n * @example\n *\n * var array = [1, 2, 3];\n *\n * _.reverse(array);\n * // => [3, 2, 1]\n *\n * console.log(array);\n * // => [3, 2, 1]\n */\nfunction reverse(array) {\n  return array == null ? array : nativeReverse.call(array);\n}\n\nmodule.exports = reverse;\n","var baseSlice = require('./_baseSlice'),\n    isIterateeCall = require('./_isIterateeCall'),\n    toInteger = require('./toInteger');\n\n/**\n * Creates a slice of `array` from `start` up to, but not including, `end`.\n *\n * **Note:** This method is used instead of\n * [`Array#slice`](https://mdn.io/Array/slice) to ensure dense arrays are\n * returned.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Array\n * @param {Array} array The array to slice.\n * @param {number} [start=0] The start position.\n * @param {number} [end=array.length] The end position.\n * @returns {Array} Returns the slice of `array`.\n */\nfunction slice(array, start, end) {\n  var length = array == null ? 0 : array.length;\n  if (!length) {\n    return [];\n  }\n  if (end && typeof end != 'number' && isIterateeCall(array, start, end)) {\n    start = 0;\n    end = length;\n  }\n  else {\n    start = start == null ? 0 : toInteger(start);\n    end = end === undefined ? length : toInteger(end);\n  }\n  return baseSlice(array, start, end);\n}\n\nmodule.exports = slice;\n","var baseSortedIndex = require('./_baseSortedIndex');\n\n/**\n * Uses a binary search to determine the lowest index at which `value`\n * should be inserted into `array` in order to maintain its sort order.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {Array} array The sorted array to inspect.\n * @param {*} value The value to evaluate.\n * @returns {number} Returns the index at which `value` should be inserted\n *  into `array`.\n * @example\n *\n * _.sortedIndex([30, 50], 40);\n * // => 1\n */\nfunction sortedIndex(array, value) {\n  return baseSortedIndex(array, value);\n}\n\nmodule.exports = sortedIndex;\n","var baseIteratee = require('./_baseIteratee'),\n    baseSortedIndexBy = require('./_baseSortedIndexBy');\n\n/**\n * This method is like `_.sortedIndex` except that it accepts `iteratee`\n * which is invoked for `value` and each element of `array` to compute their\n * sort ranking. The iteratee is invoked with one argument: (value).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The sorted array to inspect.\n * @param {*} value The value to evaluate.\n * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n * @returns {number} Returns the index at which `value` should be inserted\n *  into `array`.\n * @example\n *\n * var objects = [{ 'x': 4 }, { 'x': 5 }];\n *\n * _.sortedIndexBy(objects, { 'x': 4 }, function(o) { return o.x; });\n * // => 0\n *\n * // The `_.property` iteratee shorthand.\n * _.sortedIndexBy(objects, { 'x': 4 }, 'x');\n * // => 0\n */\nfunction sortedIndexBy(array, value, iteratee) {\n  return baseSortedIndexBy(array, value, baseIteratee(iteratee, 2));\n}\n\nmodule.exports = sortedIndexBy;\n","var baseSortedIndex = require('./_baseSortedIndex'),\n    eq = require('./eq');\n\n/**\n * This method is like `_.indexOf` except that it performs a binary\n * search on a sorted `array`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @param {*} value The value to search for.\n * @returns {number} Returns the index of the matched value, else `-1`.\n * @example\n *\n * _.sortedIndexOf([4, 5, 5, 5, 6], 5);\n * // => 1\n */\nfunction sortedIndexOf(array, value) {\n  var length = array == null ? 0 : array.length;\n  if (length) {\n    var index = baseSortedIndex(array, value);\n    if (index < length && eq(array[index], value)) {\n      return index;\n    }\n  }\n  return -1;\n}\n\nmodule.exports = sortedIndexOf;\n","var baseSortedIndex = require('./_baseSortedIndex');\n\n/**\n * This method is like `_.sortedIndex` except that it returns the highest\n * index at which `value` should be inserted into `array` in order to\n * maintain its sort order.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Array\n * @param {Array} array The sorted array to inspect.\n * @param {*} value The value to evaluate.\n * @returns {number} Returns the index at which `value` should be inserted\n *  into `array`.\n * @example\n *\n * _.sortedLastIndex([4, 5, 5, 5, 6], 5);\n * // => 4\n */\nfunction sortedLastIndex(array, value) {\n  return baseSortedIndex(array, value, true);\n}\n\nmodule.exports = sortedLastIndex;\n","var baseIteratee = require('./_baseIteratee'),\n    baseSortedIndexBy = require('./_baseSortedIndexBy');\n\n/**\n * This method is like `_.sortedLastIndex` except that it accepts `iteratee`\n * which is invoked for `value` and each element of `array` to compute their\n * sort ranking. The iteratee is invoked with one argument: (value).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The sorted array to inspect.\n * @param {*} value The value to evaluate.\n * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n * @returns {number} Returns the index at which `value` should be inserted\n *  into `array`.\n * @example\n *\n * var objects = [{ 'x': 4 }, { 'x': 5 }];\n *\n * _.sortedLastIndexBy(objects, { 'x': 4 }, function(o) { return o.x; });\n * // => 1\n *\n * // The `_.property` iteratee shorthand.\n * _.sortedLastIndexBy(objects, { 'x': 4 }, 'x');\n * // => 1\n */\nfunction sortedLastIndexBy(array, value, iteratee) {\n  return baseSortedIndexBy(array, value, baseIteratee(iteratee, 2), true);\n}\n\nmodule.exports = sortedLastIndexBy;\n","var baseSortedIndex = require('./_baseSortedIndex'),\n    eq = require('./eq');\n\n/**\n * This method is like `_.lastIndexOf` except that it performs a binary\n * search on a sorted `array`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @param {*} value The value to search for.\n * @returns {number} Returns the index of the matched value, else `-1`.\n * @example\n *\n * _.sortedLastIndexOf([4, 5, 5, 5, 6], 5);\n * // => 3\n */\nfunction sortedLastIndexOf(array, value) {\n  var length = array == null ? 0 : array.length;\n  if (length) {\n    var index = baseSortedIndex(array, value, true) - 1;\n    if (eq(array[index], value)) {\n      return index;\n    }\n  }\n  return -1;\n}\n\nmodule.exports = sortedLastIndexOf;\n","var baseSortedUniq = require('./_baseSortedUniq');\n\n/**\n * This method is like `_.uniq` except that it's designed and optimized\n * for sorted arrays.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @returns {Array} Returns the new duplicate free array.\n * @example\n *\n * _.sortedUniq([1, 1, 2]);\n * // => [1, 2]\n */\nfunction sortedUniq(array) {\n  return (array && array.length)\n    ? baseSortedUniq(array)\n    : [];\n}\n\nmodule.exports = sortedUniq;\n","var baseIteratee = require('./_baseIteratee'),\n    baseSortedUniq = require('./_baseSortedUniq');\n\n/**\n * This method is like `_.uniqBy` except that it's designed and optimized\n * for sorted arrays.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @param {Function} [iteratee] The iteratee invoked per element.\n * @returns {Array} Returns the new duplicate free array.\n * @example\n *\n * _.sortedUniqBy([1.1, 1.2, 2.3, 2.4], Math.floor);\n * // => [1.1, 2.3]\n */\nfunction sortedUniqBy(array, iteratee) {\n  return (array && array.length)\n    ? baseSortedUniq(array, baseIteratee(iteratee, 2))\n    : [];\n}\n\nmodule.exports = sortedUniqBy;\n","/**\n * This method returns a new empty array.\n *\n * @static\n * @memberOf _\n * @since 4.13.0\n * @category Util\n * @returns {Array} Returns the new empty array.\n * @example\n *\n * var arrays = _.times(2, _.stubArray);\n *\n * console.log(arrays);\n * // => [[], []]\n *\n * console.log(arrays[0] === arrays[1]);\n * // => false\n */\nfunction stubArray() {\n  return [];\n}\n\nmodule.exports = stubArray;\n","/**\n * This method returns `false`.\n *\n * @static\n * @memberOf _\n * @since 4.13.0\n * @category Util\n * @returns {boolean} Returns `false`.\n * @example\n *\n * _.times(2, _.stubFalse);\n * // => [false, false]\n */\nfunction stubFalse() {\n  return false;\n}\n\nmodule.exports = stubFalse;\n","var baseSlice = require('./_baseSlice');\n\n/**\n * Gets all but the first element of `array`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The array to query.\n * @returns {Array} Returns the slice of `array`.\n * @example\n *\n * _.tail([1, 2, 3]);\n * // => [2, 3]\n */\nfunction tail(array) {\n  var length = array == null ? 0 : array.length;\n  return length ? baseSlice(array, 1, length) : [];\n}\n\nmodule.exports = tail;\n","var baseSlice = require('./_baseSlice'),\n    toInteger = require('./toInteger');\n\n/**\n * Creates a slice of `array` with `n` elements taken from the beginning.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {Array} array The array to query.\n * @param {number} [n=1] The number of elements to take.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n * @returns {Array} Returns the slice of `array`.\n * @example\n *\n * _.take([1, 2, 3]);\n * // => [1]\n *\n * _.take([1, 2, 3], 2);\n * // => [1, 2]\n *\n * _.take([1, 2, 3], 5);\n * // => [1, 2, 3]\n *\n * _.take([1, 2, 3], 0);\n * // => []\n */\nfunction take(array, n, guard) {\n  if (!(array && array.length)) {\n    return [];\n  }\n  n = (guard || n === undefined) ? 1 : toInteger(n);\n  return baseSlice(array, 0, n < 0 ? 0 : n);\n}\n\nmodule.exports = take;\n","var baseSlice = require('./_baseSlice'),\n    toInteger = require('./toInteger');\n\n/**\n * Creates a slice of `array` with `n` elements taken from the end.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Array\n * @param {Array} array The array to query.\n * @param {number} [n=1] The number of elements to take.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n * @returns {Array} Returns the slice of `array`.\n * @example\n *\n * _.takeRight([1, 2, 3]);\n * // => [3]\n *\n * _.takeRight([1, 2, 3], 2);\n * // => [2, 3]\n *\n * _.takeRight([1, 2, 3], 5);\n * // => [1, 2, 3]\n *\n * _.takeRight([1, 2, 3], 0);\n * // => []\n */\nfunction takeRight(array, n, guard) {\n  var length = array == null ? 0 : array.length;\n  if (!length) {\n    return [];\n  }\n  n = (guard || n === undefined) ? 1 : toInteger(n);\n  n = length - n;\n  return baseSlice(array, n < 0 ? 0 : n, length);\n}\n\nmodule.exports = takeRight;\n","var baseIteratee = require('./_baseIteratee'),\n    baseWhile = require('./_baseWhile');\n\n/**\n * Creates a slice of `array` with elements taken from the end. Elements are\n * taken until `predicate` returns falsey. The predicate is invoked with\n * three arguments: (value, index, array).\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Array\n * @param {Array} array The array to query.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @returns {Array} Returns the slice of `array`.\n * @example\n *\n * var users = [\n *   { 'user': 'barney',  'active': true },\n *   { 'user': 'fred',    'active': false },\n *   { 'user': 'pebbles', 'active': false }\n * ];\n *\n * _.takeRightWhile(users, function(o) { return !o.active; });\n * // => objects for ['fred', 'pebbles']\n *\n * // The `_.matches` iteratee shorthand.\n * _.takeRightWhile(users, { 'user': 'pebbles', 'active': false });\n * // => objects for ['pebbles']\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.takeRightWhile(users, ['active', false]);\n * // => objects for ['fred', 'pebbles']\n *\n * // The `_.property` iteratee shorthand.\n * _.takeRightWhile(users, 'active');\n * // => []\n */\nfunction takeRightWhile(array, predicate) {\n  return (array && array.length)\n    ? baseWhile(array, baseIteratee(predicate, 3), false, true)\n    : [];\n}\n\nmodule.exports = takeRightWhile;\n","var baseIteratee = require('./_baseIteratee'),\n    baseWhile = require('./_baseWhile');\n\n/**\n * Creates a slice of `array` with elements taken from the beginning. Elements\n * are taken until `predicate` returns falsey. The predicate is invoked with\n * three arguments: (value, index, array).\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Array\n * @param {Array} array The array to query.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @returns {Array} Returns the slice of `array`.\n * @example\n *\n * var users = [\n *   { 'user': 'barney',  'active': false },\n *   { 'user': 'fred',    'active': false },\n *   { 'user': 'pebbles', 'active': true }\n * ];\n *\n * _.takeWhile(users, function(o) { return !o.active; });\n * // => objects for ['barney', 'fred']\n *\n * // The `_.matches` iteratee shorthand.\n * _.takeWhile(users, { 'user': 'barney', 'active': false });\n * // => objects for ['barney']\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.takeWhile(users, ['active', false]);\n * // => objects for ['barney', 'fred']\n *\n * // The `_.property` iteratee shorthand.\n * _.takeWhile(users, 'active');\n * // => []\n */\nfunction takeWhile(array, predicate) {\n  return (array && array.length)\n    ? baseWhile(array, baseIteratee(predicate, 3))\n    : [];\n}\n\nmodule.exports = takeWhile;\n","var toNumber = require('./toNumber');\n\n/** Used as references for various `Number` constants. */\nvar INFINITY = 1 / 0,\n    MAX_INTEGER = 1.7976931348623157e+308;\n\n/**\n * Converts `value` to a finite number.\n *\n * @static\n * @memberOf _\n * @since 4.12.0\n * @category Lang\n * @param {*} value The value to convert.\n * @returns {number} Returns the converted number.\n * @example\n *\n * _.toFinite(3.2);\n * // => 3.2\n *\n * _.toFinite(Number.MIN_VALUE);\n * // => 5e-324\n *\n * _.toFinite(Infinity);\n * // => 1.7976931348623157e+308\n *\n * _.toFinite('3.2');\n * // => 3.2\n */\nfunction toFinite(value) {\n  if (!value) {\n    return value === 0 ? value : 0;\n  }\n  value = toNumber(value);\n  if (value === INFINITY || value === -INFINITY) {\n    var sign = (value < 0 ? -1 : 1);\n    return sign * MAX_INTEGER;\n  }\n  return value === value ? value : 0;\n}\n\nmodule.exports = toFinite;\n","var toFinite = require('./toFinite');\n\n/**\n * Converts `value` to an integer.\n *\n * **Note:** This method is loosely based on\n * [`ToInteger`](http://www.ecma-international.org/ecma-262/7.0/#sec-tointeger).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to convert.\n * @returns {number} Returns the converted integer.\n * @example\n *\n * _.toInteger(3.2);\n * // => 3\n *\n * _.toInteger(Number.MIN_VALUE);\n * // => 0\n *\n * _.toInteger(Infinity);\n * // => 1.7976931348623157e+308\n *\n * _.toInteger('3.2');\n * // => 3\n */\nfunction toInteger(value) {\n  var result = toFinite(value),\n      remainder = result % 1;\n\n  return result === result ? (remainder ? result - remainder : result) : 0;\n}\n\nmodule.exports = toInteger;\n","var baseClamp = require('./_baseClamp'),\n    toInteger = require('./toInteger');\n\n/** Used as references for the maximum length and index of an array. */\nvar MAX_ARRAY_LENGTH = 4294967295;\n\n/**\n * Converts `value` to an integer suitable for use as the length of an\n * array-like object.\n *\n * **Note:** This method is based on\n * [`ToLength`](http://ecma-international.org/ecma-262/7.0/#sec-tolength).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to convert.\n * @returns {number} Returns the converted integer.\n * @example\n *\n * _.toLength(3.2);\n * // => 3\n *\n * _.toLength(Number.MIN_VALUE);\n * // => 0\n *\n * _.toLength(Infinity);\n * // => 4294967295\n *\n * _.toLength('3.2');\n * // => 3\n */\nfunction toLength(value) {\n  return value ? baseClamp(toInteger(value), 0, MAX_ARRAY_LENGTH) : 0;\n}\n\nmodule.exports = toLength;\n","var baseTrim = require('./_baseTrim'),\n    isObject = require('./isObject'),\n    isSymbol = require('./isSymbol');\n\n/** Used as references for various `Number` constants. */\nvar NAN = 0 / 0;\n\n/** Used to detect bad signed hexadecimal string values. */\nvar reIsBadHex = /^[-+]0x[0-9a-f]+$/i;\n\n/** Used to detect binary string values. */\nvar reIsBinary = /^0b[01]+$/i;\n\n/** Used to detect octal string values. */\nvar reIsOctal = /^0o[0-7]+$/i;\n\n/** Built-in method references without a dependency on `root`. */\nvar freeParseInt = parseInt;\n\n/**\n * Converts `value` to a number.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to process.\n * @returns {number} Returns the number.\n * @example\n *\n * _.toNumber(3.2);\n * // => 3.2\n *\n * _.toNumber(Number.MIN_VALUE);\n * // => 5e-324\n *\n * _.toNumber(Infinity);\n * // => Infinity\n *\n * _.toNumber('3.2');\n * // => 3.2\n */\nfunction toNumber(value) {\n  if (typeof value == 'number') {\n    return value;\n  }\n  if (isSymbol(value)) {\n    return NAN;\n  }\n  if (isObject(value)) {\n    var other = typeof value.valueOf == 'function' ? value.valueOf() : value;\n    value = isObject(other) ? (other + '') : other;\n  }\n  if (typeof value != 'string') {\n    return value === 0 ? value : +value;\n  }\n  value = baseTrim(value);\n  var isBinary = reIsBinary.test(value);\n  return (isBinary || reIsOctal.test(value))\n    ? freeParseInt(value.slice(2), isBinary ? 2 : 8)\n    : (reIsBadHex.test(value) ? NAN : +value);\n}\n\nmodule.exports = toNumber;\n","var baseToString = require('./_baseToString');\n\n/**\n * Converts `value` to a string. An empty string is returned for `null`\n * and `undefined` values. The sign of `-0` is preserved.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to convert.\n * @returns {string} Returns the converted string.\n * @example\n *\n * _.toString(null);\n * // => ''\n *\n * _.toString(-0);\n * // => '-0'\n *\n * _.toString([1, 2, 3]);\n * // => '1,2,3'\n */\nfunction toString(value) {\n  return value == null ? '' : baseToString(value);\n}\n\nmodule.exports = toString;\n","var baseFlatten = require('./_baseFlatten'),\n    baseRest = require('./_baseRest'),\n    baseUniq = require('./_baseUniq'),\n    isArrayLikeObject = require('./isArrayLikeObject');\n\n/**\n * Creates an array of unique values, in order, from all given arrays using\n * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * for equality comparisons.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {...Array} [arrays] The arrays to inspect.\n * @returns {Array} Returns the new array of combined values.\n * @example\n *\n * _.union([2], [1, 2]);\n * // => [2, 1]\n */\nvar union = baseRest(function(arrays) {\n  return baseUniq(baseFlatten(arrays, 1, isArrayLikeObject, true));\n});\n\nmodule.exports = union;\n","var baseFlatten = require('./_baseFlatten'),\n    baseIteratee = require('./_baseIteratee'),\n    baseRest = require('./_baseRest'),\n    baseUniq = require('./_baseUniq'),\n    isArrayLikeObject = require('./isArrayLikeObject'),\n    last = require('./last');\n\n/**\n * This method is like `_.union` except that it accepts `iteratee` which is\n * invoked for each element of each `arrays` to generate the criterion by\n * which uniqueness is computed. Result values are chosen from the first\n * array in which the value occurs. The iteratee is invoked with one argument:\n * (value).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {...Array} [arrays] The arrays to inspect.\n * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n * @returns {Array} Returns the new array of combined values.\n * @example\n *\n * _.unionBy([2.1], [1.2, 2.3], Math.floor);\n * // => [2.1, 1.2]\n *\n * // The `_.property` iteratee shorthand.\n * _.unionBy([{ 'x': 1 }], [{ 'x': 2 }, { 'x': 1 }], 'x');\n * // => [{ 'x': 1 }, { 'x': 2 }]\n */\nvar unionBy = baseRest(function(arrays) {\n  var iteratee = last(arrays);\n  if (isArrayLikeObject(iteratee)) {\n    iteratee = undefined;\n  }\n  return baseUniq(baseFlatten(arrays, 1, isArrayLikeObject, true), baseIteratee(iteratee, 2));\n});\n\nmodule.exports = unionBy;\n","var baseFlatten = require('./_baseFlatten'),\n    baseRest = require('./_baseRest'),\n    baseUniq = require('./_baseUniq'),\n    isArrayLikeObject = require('./isArrayLikeObject'),\n    last = require('./last');\n\n/**\n * This method is like `_.union` except that it accepts `comparator` which\n * is invoked to compare elements of `arrays`. Result values are chosen from\n * the first array in which the value occurs. The comparator is invoked\n * with two arguments: (arrVal, othVal).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {...Array} [arrays] The arrays to inspect.\n * @param {Function} [comparator] The comparator invoked per element.\n * @returns {Array} Returns the new array of combined values.\n * @example\n *\n * var objects = [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }];\n * var others = [{ 'x': 1, 'y': 1 }, { 'x': 1, 'y': 2 }];\n *\n * _.unionWith(objects, others, _.isEqual);\n * // => [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }, { 'x': 1, 'y': 1 }]\n */\nvar unionWith = baseRest(function(arrays) {\n  var comparator = last(arrays);\n  comparator = typeof comparator == 'function' ? comparator : undefined;\n  return baseUniq(baseFlatten(arrays, 1, isArrayLikeObject, true), undefined, comparator);\n});\n\nmodule.exports = unionWith;\n","var baseUniq = require('./_baseUniq');\n\n/**\n * Creates a duplicate-free version of an array, using\n * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * for equality comparisons, in which only the first occurrence of each element\n * is kept. The order of result values is determined by the order they occur\n * in the array.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @returns {Array} Returns the new duplicate free array.\n * @example\n *\n * _.uniq([2, 1, 2]);\n * // => [2, 1]\n */\nfunction uniq(array) {\n  return (array && array.length) ? baseUniq(array) : [];\n}\n\nmodule.exports = uniq;\n","var baseIteratee = require('./_baseIteratee'),\n    baseUniq = require('./_baseUniq');\n\n/**\n * This method is like `_.uniq` except that it accepts `iteratee` which is\n * invoked for each element in `array` to generate the criterion by which\n * uniqueness is computed. The order of result values is determined by the\n * order they occur in the array. The iteratee is invoked with one argument:\n * (value).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n * @returns {Array} Returns the new duplicate free array.\n * @example\n *\n * _.uniqBy([2.1, 1.2, 2.3], Math.floor);\n * // => [2.1, 1.2]\n *\n * // The `_.property` iteratee shorthand.\n * _.uniqBy([{ 'x': 1 }, { 'x': 2 }, { 'x': 1 }], 'x');\n * // => [{ 'x': 1 }, { 'x': 2 }]\n */\nfunction uniqBy(array, iteratee) {\n  return (array && array.length) ? baseUniq(array, baseIteratee(iteratee, 2)) : [];\n}\n\nmodule.exports = uniqBy;\n","var baseUniq = require('./_baseUniq');\n\n/**\n * This method is like `_.uniq` except that it accepts `comparator` which\n * is invoked to compare elements of `array`. The order of result values is\n * determined by the order they occur in the array.The comparator is invoked\n * with two arguments: (arrVal, othVal).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @param {Function} [comparator] The comparator invoked per element.\n * @returns {Array} Returns the new duplicate free array.\n * @example\n *\n * var objects = [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }, { 'x': 1, 'y': 2 }];\n *\n * _.uniqWith(objects, _.isEqual);\n * // => [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }]\n */\nfunction uniqWith(array, comparator) {\n  comparator = typeof comparator == 'function' ? comparator : undefined;\n  return (array && array.length) ? baseUniq(array, undefined, comparator) : [];\n}\n\nmodule.exports = uniqWith;\n","var arrayFilter = require('./_arrayFilter'),\n    arrayMap = require('./_arrayMap'),\n    baseProperty = require('./_baseProperty'),\n    baseTimes = require('./_baseTimes'),\n    isArrayLikeObject = require('./isArrayLikeObject');\n\n/* Built-in method references for those with the same name as other `lodash` methods. */\nvar nativeMax = Math.max;\n\n/**\n * This method is like `_.zip` except that it accepts an array of grouped\n * elements and creates an array regrouping the elements to their pre-zip\n * configuration.\n *\n * @static\n * @memberOf _\n * @since 1.2.0\n * @category Array\n * @param {Array} array The array of grouped elements to process.\n * @returns {Array} Returns the new array of regrouped elements.\n * @example\n *\n * var zipped = _.zip(['a', 'b'], [1, 2], [true, false]);\n * // => [['a', 1, true], ['b', 2, false]]\n *\n * _.unzip(zipped);\n * // => [['a', 'b'], [1, 2], [true, false]]\n */\nfunction unzip(array) {\n  if (!(array && array.length)) {\n    return [];\n  }\n  var length = 0;\n  array = arrayFilter(array, function(group) {\n    if (isArrayLikeObject(group)) {\n      length = nativeMax(group.length, length);\n      return true;\n    }\n  });\n  return baseTimes(length, function(index) {\n    return arrayMap(array, baseProperty(index));\n  });\n}\n\nmodule.exports = unzip;\n","var apply = require('./_apply'),\n    arrayMap = require('./_arrayMap'),\n    unzip = require('./unzip');\n\n/**\n * This method is like `_.unzip` except that it accepts `iteratee` to specify\n * how regrouped values should be combined. The iteratee is invoked with the\n * elements of each group: (...group).\n *\n * @static\n * @memberOf _\n * @since 3.8.0\n * @category Array\n * @param {Array} array The array of grouped elements to process.\n * @param {Function} [iteratee=_.identity] The function to combine\n *  regrouped values.\n * @returns {Array} Returns the new array of regrouped elements.\n * @example\n *\n * var zipped = _.zip([1, 2], [10, 20], [100, 200]);\n * // => [[1, 10, 100], [2, 20, 200]]\n *\n * _.unzipWith(zipped, _.add);\n * // => [3, 30, 300]\n */\nfunction unzipWith(array, iteratee) {\n  if (!(array && array.length)) {\n    return [];\n  }\n  var result = unzip(array);\n  if (iteratee == null) {\n    return result;\n  }\n  return arrayMap(result, function(group) {\n    return apply(iteratee, undefined, group);\n  });\n}\n\nmodule.exports = unzipWith;\n","var baseDifference = require('./_baseDifference'),\n    baseRest = require('./_baseRest'),\n    isArrayLikeObject = require('./isArrayLikeObject');\n\n/**\n * Creates an array excluding all given values using\n * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * for equality comparisons.\n *\n * **Note:** Unlike `_.pull`, this method returns a new array.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @param {...*} [values] The values to exclude.\n * @returns {Array} Returns the new array of filtered values.\n * @see _.difference, _.xor\n * @example\n *\n * _.without([2, 1, 2, 3], 1, 2);\n * // => [3]\n */\nvar without = baseRest(function(array, values) {\n  return isArrayLikeObject(array)\n    ? baseDifference(array, values)\n    : [];\n});\n\nmodule.exports = without;\n","var arrayFilter = require('./_arrayFilter'),\n    baseRest = require('./_baseRest'),\n    baseXor = require('./_baseXor'),\n    isArrayLikeObject = require('./isArrayLikeObject');\n\n/**\n * Creates an array of unique values that is the\n * [symmetric difference](https://en.wikipedia.org/wiki/Symmetric_difference)\n * of the given arrays. The order of result values is determined by the order\n * they occur in the arrays.\n *\n * @static\n * @memberOf _\n * @since 2.4.0\n * @category Array\n * @param {...Array} [arrays] The arrays to inspect.\n * @returns {Array} Returns the new array of filtered values.\n * @see _.difference, _.without\n * @example\n *\n * _.xor([2, 1], [2, 3]);\n * // => [1, 3]\n */\nvar xor = baseRest(function(arrays) {\n  return baseXor(arrayFilter(arrays, isArrayLikeObject));\n});\n\nmodule.exports = xor;\n","var arrayFilter = require('./_arrayFilter'),\n    baseIteratee = require('./_baseIteratee'),\n    baseRest = require('./_baseRest'),\n    baseXor = require('./_baseXor'),\n    isArrayLikeObject = require('./isArrayLikeObject'),\n    last = require('./last');\n\n/**\n * This method is like `_.xor` except that it accepts `iteratee` which is\n * invoked for each element of each `arrays` to generate the criterion by\n * which by which they're compared. The order of result values is determined\n * by the order they occur in the arrays. The iteratee is invoked with one\n * argument: (value).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {...Array} [arrays] The arrays to inspect.\n * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n * @returns {Array} Returns the new array of filtered values.\n * @example\n *\n * _.xorBy([2.1, 1.2], [2.3, 3.4], Math.floor);\n * // => [1.2, 3.4]\n *\n * // The `_.property` iteratee shorthand.\n * _.xorBy([{ 'x': 1 }], [{ 'x': 2 }, { 'x': 1 }], 'x');\n * // => [{ 'x': 2 }]\n */\nvar xorBy = baseRest(function(arrays) {\n  var iteratee = last(arrays);\n  if (isArrayLikeObject(iteratee)) {\n    iteratee = undefined;\n  }\n  return baseXor(arrayFilter(arrays, isArrayLikeObject), baseIteratee(iteratee, 2));\n});\n\nmodule.exports = xorBy;\n","var arrayFilter = require('./_arrayFilter'),\n    baseRest = require('./_baseRest'),\n    baseXor = require('./_baseXor'),\n    isArrayLikeObject = require('./isArrayLikeObject'),\n    last = require('./last');\n\n/**\n * This method is like `_.xor` except that it accepts `comparator` which is\n * invoked to compare elements of `arrays`. The order of result values is\n * determined by the order they occur in the arrays. The comparator is invoked\n * with two arguments: (arrVal, othVal).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {...Array} [arrays] The arrays to inspect.\n * @param {Function} [comparator] The comparator invoked per element.\n * @returns {Array} Returns the new array of filtered values.\n * @example\n *\n * var objects = [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }];\n * var others = [{ 'x': 1, 'y': 1 }, { 'x': 1, 'y': 2 }];\n *\n * _.xorWith(objects, others, _.isEqual);\n * // => [{ 'x': 2, 'y': 1 }, { 'x': 1, 'y': 1 }]\n */\nvar xorWith = baseRest(function(arrays) {\n  var comparator = last(arrays);\n  comparator = typeof comparator == 'function' ? comparator : undefined;\n  return baseXor(arrayFilter(arrays, isArrayLikeObject), undefined, comparator);\n});\n\nmodule.exports = xorWith;\n","var baseRest = require('./_baseRest'),\n    unzip = require('./unzip');\n\n/**\n * Creates an array of grouped elements, the first of which contains the\n * first elements of the given arrays, the second of which contains the\n * second elements of the given arrays, and so on.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {...Array} [arrays] The arrays to process.\n * @returns {Array} Returns the new array of grouped elements.\n * @example\n *\n * _.zip(['a', 'b'], [1, 2], [true, false]);\n * // => [['a', 1, true], ['b', 2, false]]\n */\nvar zip = baseRest(unzip);\n\nmodule.exports = zip;\n","var assignValue = require('./_assignValue'),\n    baseZipObject = require('./_baseZipObject');\n\n/**\n * This method is like `_.fromPairs` except that it accepts two arrays,\n * one of property identifiers and one of corresponding values.\n *\n * @static\n * @memberOf _\n * @since 0.4.0\n * @category Array\n * @param {Array} [props=[]] The property identifiers.\n * @param {Array} [values=[]] The property values.\n * @returns {Object} Returns the new object.\n * @example\n *\n * _.zipObject(['a', 'b'], [1, 2]);\n * // => { 'a': 1, 'b': 2 }\n */\nfunction zipObject(props, values) {\n  return baseZipObject(props || [], values || [], assignValue);\n}\n\nmodule.exports = zipObject;\n","var baseSet = require('./_baseSet'),\n    baseZipObject = require('./_baseZipObject');\n\n/**\n * This method is like `_.zipObject` except that it supports property paths.\n *\n * @static\n * @memberOf _\n * @since 4.1.0\n * @category Array\n * @param {Array} [props=[]] The property identifiers.\n * @param {Array} [values=[]] The property values.\n * @returns {Object} Returns the new object.\n * @example\n *\n * _.zipObjectDeep(['a.b[0].c', 'a.b[1].d'], [1, 2]);\n * // => { 'a': { 'b': [{ 'c': 1 }, { 'd': 2 }] } }\n */\nfunction zipObjectDeep(props, values) {\n  return baseZipObject(props || [], values || [], baseSet);\n}\n\nmodule.exports = zipObjectDeep;\n","var baseRest = require('./_baseRest'),\n    unzipWith = require('./unzipWith');\n\n/**\n * This method is like `_.zip` except that it accepts `iteratee` to specify\n * how grouped values should be combined. The iteratee is invoked with the\n * elements of each group: (...group).\n *\n * @static\n * @memberOf _\n * @since 3.8.0\n * @category Array\n * @param {...Array} [arrays] The arrays to process.\n * @param {Function} [iteratee=_.identity] The function to combine\n *  grouped values.\n * @returns {Array} Returns the new array of grouped elements.\n * @example\n *\n * _.zipWith([1, 2], [10, 20], [100, 200], function(a, b, c) {\n *   return a + b + c;\n * });\n * // => [111, 222]\n */\nvar zipWith = baseRest(function(arrays) {\n  var length = arrays.length,\n      iteratee = length > 1 ? arrays[length - 1] : undefined;\n\n  iteratee = typeof iteratee == 'function' ? (arrays.pop(), iteratee) : undefined;\n  return unzipWith(arrays, iteratee);\n});\n\nmodule.exports = zipWith;\n","/* global define */\n\n(function (root, pluralize) {\n  /* istanbul ignore else */\n  if (typeof require === 'function' && typeof exports === 'object' && typeof module === 'object') {\n    // Node.\n    module.exports = pluralize();\n  } else if (typeof define === 'function' && define.amd) {\n    // AMD, registers as an anonymous module.\n    define(function () {\n      return pluralize();\n    });\n  } else {\n    // Browser global.\n    root.pluralize = pluralize();\n  }\n})(this, function () {\n  // Rule storage - pluralize and singularize need to be run sequentially,\n  // while other rules can be optimized using an object for instant lookups.\n  var pluralRules = [];\n  var singularRules = [];\n  var uncountables = {};\n  var irregularPlurals = {};\n  var irregularSingles = {};\n\n  /**\n   * Sanitize a pluralization rule to a usable regular expression.\n   *\n   * @param  {(RegExp|string)} rule\n   * @return {RegExp}\n   */\n  function sanitizeRule (rule) {\n    if (typeof rule === 'string') {\n      return new RegExp('^' + rule + '$', 'i');\n    }\n\n    return rule;\n  }\n\n  /**\n   * Pass in a word token to produce a function that can replicate the case on\n   * another word.\n   *\n   * @param  {string}   word\n   * @param  {string}   token\n   * @return {Function}\n   */\n  function restoreCase (word, token) {\n    // Tokens are an exact match.\n    if (word === token) return token;\n\n    // Lower cased words. E.g. \"hello\".\n    if (word === word.toLowerCase()) return token.toLowerCase();\n\n    // Upper cased words. E.g. \"WHISKY\".\n    if (word === word.toUpperCase()) return token.toUpperCase();\n\n    // Title cased words. E.g. \"Title\".\n    if (word[0] === word[0].toUpperCase()) {\n      return token.charAt(0).toUpperCase() + token.substr(1).toLowerCase();\n    }\n\n    // Lower cased words. E.g. \"test\".\n    return token.toLowerCase();\n  }\n\n  /**\n   * Interpolate a regexp string.\n   *\n   * @param  {string} str\n   * @param  {Array}  args\n   * @return {string}\n   */\n  function interpolate (str, args) {\n    return str.replace(/\\$(\\d{1,2})/g, function (match, index) {\n      return args[index] || '';\n    });\n  }\n\n  /**\n   * Replace a word using a rule.\n   *\n   * @param  {string} word\n   * @param  {Array}  rule\n   * @return {string}\n   */\n  function replace (word, rule) {\n    return word.replace(rule[0], function (match, index) {\n      var result = interpolate(rule[1], arguments);\n\n      if (match === '') {\n        return restoreCase(word[index - 1], result);\n      }\n\n      return restoreCase(match, result);\n    });\n  }\n\n  /**\n   * Sanitize a word by passing in the word and sanitization rules.\n   *\n   * @param  {string}   token\n   * @param  {string}   word\n   * @param  {Array}    rules\n   * @return {string}\n   */\n  function sanitizeWord (token, word, rules) {\n    // Empty string or doesn't need fixing.\n    if (!token.length || uncountables.hasOwnProperty(token)) {\n      return word;\n    }\n\n    var len = rules.length;\n\n    // Iterate over the sanitization rules and use the first one to match.\n    while (len--) {\n      var rule = rules[len];\n\n      if (rule[0].test(word)) return replace(word, rule);\n    }\n\n    return word;\n  }\n\n  /**\n   * Replace a word with the updated word.\n   *\n   * @param  {Object}   replaceMap\n   * @param  {Object}   keepMap\n   * @param  {Array}    rules\n   * @return {Function}\n   */\n  function replaceWord (replaceMap, keepMap, rules) {\n    return function (word) {\n      // Get the correct token and case restoration functions.\n      var token = word.toLowerCase();\n\n      // Check against the keep object map.\n      if (keepMap.hasOwnProperty(token)) {\n        return restoreCase(word, token);\n      }\n\n      // Check against the replacement map for a direct word replacement.\n      if (replaceMap.hasOwnProperty(token)) {\n        return restoreCase(word, replaceMap[token]);\n      }\n\n      // Run all the rules against the word.\n      return sanitizeWord(token, word, rules);\n    };\n  }\n\n  /**\n   * Check if a word is part of the map.\n   */\n  function checkWord (replaceMap, keepMap, rules, bool) {\n    return function (word) {\n      var token = word.toLowerCase();\n\n      if (keepMap.hasOwnProperty(token)) return true;\n      if (replaceMap.hasOwnProperty(token)) return false;\n\n      return sanitizeWord(token, token, rules) === token;\n    };\n  }\n\n  /**\n   * Pluralize or singularize a word based on the passed in count.\n   *\n   * @param  {string}  word      The word to pluralize\n   * @param  {number}  count     How many of the word exist\n   * @param  {boolean} inclusive Whether to prefix with the number (e.g. 3 ducks)\n   * @return {string}\n   */\n  function pluralize (word, count, inclusive) {\n    var pluralized = count === 1\n      ? pluralize.singular(word) : pluralize.plural(word);\n\n    return (inclusive ? count + ' ' : '') + pluralized;\n  }\n\n  /**\n   * Pluralize a word.\n   *\n   * @type {Function}\n   */\n  pluralize.plural = replaceWord(\n    irregularSingles, irregularPlurals, pluralRules\n  );\n\n  /**\n   * Check if a word is plural.\n   *\n   * @type {Function}\n   */\n  pluralize.isPlural = checkWord(\n    irregularSingles, irregularPlurals, pluralRules\n  );\n\n  /**\n   * Singularize a word.\n   *\n   * @type {Function}\n   */\n  pluralize.singular = replaceWord(\n    irregularPlurals, irregularSingles, singularRules\n  );\n\n  /**\n   * Check if a word is singular.\n   *\n   * @type {Function}\n   */\n  pluralize.isSingular = checkWord(\n    irregularPlurals, irregularSingles, singularRules\n  );\n\n  /**\n   * Add a pluralization rule to the collection.\n   *\n   * @param {(string|RegExp)} rule\n   * @param {string}          replacement\n   */\n  pluralize.addPluralRule = function (rule, replacement) {\n    pluralRules.push([sanitizeRule(rule), replacement]);\n  };\n\n  /**\n   * Add a singularization rule to the collection.\n   *\n   * @param {(string|RegExp)} rule\n   * @param {string}          replacement\n   */\n  pluralize.addSingularRule = function (rule, replacement) {\n    singularRules.push([sanitizeRule(rule), replacement]);\n  };\n\n  /**\n   * Add an uncountable word rule.\n   *\n   * @param {(string|RegExp)} word\n   */\n  pluralize.addUncountableRule = function (word) {\n    if (typeof word === 'string') {\n      uncountables[word.toLowerCase()] = true;\n      return;\n    }\n\n    // Set singular and plural references for the word.\n    pluralize.addPluralRule(word, '$0');\n    pluralize.addSingularRule(word, '$0');\n  };\n\n  /**\n   * Add an irregular word definition.\n   *\n   * @param {string} single\n   * @param {string} plural\n   */\n  pluralize.addIrregularRule = function (single, plural) {\n    plural = plural.toLowerCase();\n    single = single.toLowerCase();\n\n    irregularSingles[single] = plural;\n    irregularPlurals[plural] = single;\n  };\n\n  /**\n   * Irregular rules.\n   */\n  [\n    // Pronouns.\n    ['I', 'we'],\n    ['me', 'us'],\n    ['he', 'they'],\n    ['she', 'they'],\n    ['them', 'them'],\n    ['myself', 'ourselves'],\n    ['yourself', 'yourselves'],\n    ['itself', 'themselves'],\n    ['herself', 'themselves'],\n    ['himself', 'themselves'],\n    ['themself', 'themselves'],\n    ['is', 'are'],\n    ['was', 'were'],\n    ['has', 'have'],\n    ['this', 'these'],\n    ['that', 'those'],\n    // Words ending in with a consonant and `o`.\n    ['echo', 'echoes'],\n    ['dingo', 'dingoes'],\n    ['volcano', 'volcanoes'],\n    ['tornado', 'tornadoes'],\n    ['torpedo', 'torpedoes'],\n    // Ends with `us`.\n    ['genus', 'genera'],\n    ['viscus', 'viscera'],\n    // Ends with `ma`.\n    ['stigma', 'stigmata'],\n    ['stoma', 'stomata'],\n    ['dogma', 'dogmata'],\n    ['lemma', 'lemmata'],\n    ['schema', 'schemata'],\n    ['anathema', 'anathemata'],\n    // Other irregular rules.\n    ['ox', 'oxen'],\n    ['axe', 'axes'],\n    ['die', 'dice'],\n    ['yes', 'yeses'],\n    ['foot', 'feet'],\n    ['eave', 'eaves'],\n    ['goose', 'geese'],\n    ['tooth', 'teeth'],\n    ['quiz', 'quizzes'],\n    ['human', 'humans'],\n    ['proof', 'proofs'],\n    ['carve', 'carves'],\n    ['valve', 'valves'],\n    ['looey', 'looies'],\n    ['thief', 'thieves'],\n    ['groove', 'grooves'],\n    ['pickaxe', 'pickaxes'],\n    ['passerby', 'passersby']\n  ].forEach(function (rule) {\n    return pluralize.addIrregularRule(rule[0], rule[1]);\n  });\n\n  /**\n   * Pluralization rules.\n   */\n  [\n    [/s?$/i, 's'],\n    [/[^\\u0000-\\u007F]$/i, '$0'],\n    [/([^aeiou]ese)$/i, '$1'],\n    [/(ax|test)is$/i, '$1es'],\n    [/(alias|[^aou]us|t[lm]as|gas|ris)$/i, '$1es'],\n    [/(e[mn]u)s?$/i, '$1s'],\n    [/([^l]ias|[aeiou]las|[ejzr]as|[iu]am)$/i, '$1'],\n    [/(alumn|syllab|vir|radi|nucle|fung|cact|stimul|termin|bacill|foc|uter|loc|strat)(?:us|i)$/i, '$1i'],\n    [/(alumn|alg|vertebr)(?:a|ae)$/i, '$1ae'],\n    [/(seraph|cherub)(?:im)?$/i, '$1im'],\n    [/(her|at|gr)o$/i, '$1oes'],\n    [/(agend|addend|millenni|dat|extrem|bacteri|desiderat|strat|candelabr|errat|ov|symposi|curricul|automat|quor)(?:a|um)$/i, '$1a'],\n    [/(apheli|hyperbat|periheli|asyndet|noumen|phenomen|criteri|organ|prolegomen|hedr|automat)(?:a|on)$/i, '$1a'],\n    [/sis$/i, 'ses'],\n    [/(?:(kni|wi|li)fe|(ar|l|ea|eo|oa|hoo)f)$/i, '$1$2ves'],\n    [/([^aeiouy]|qu)y$/i, '$1ies'],\n    [/([^ch][ieo][ln])ey$/i, '$1ies'],\n    [/(x|ch|ss|sh|zz)$/i, '$1es'],\n    [/(matr|cod|mur|sil|vert|ind|append)(?:ix|ex)$/i, '$1ices'],\n    [/\\b((?:tit)?m|l)(?:ice|ouse)$/i, '$1ice'],\n    [/(pe)(?:rson|ople)$/i, '$1ople'],\n    [/(child)(?:ren)?$/i, '$1ren'],\n    [/eaux$/i, '$0'],\n    [/m[ae]n$/i, 'men'],\n    ['thou', 'you']\n  ].forEach(function (rule) {\n    return pluralize.addPluralRule(rule[0], rule[1]);\n  });\n\n  /**\n   * Singularization rules.\n   */\n  [\n    [/s$/i, ''],\n    [/(ss)$/i, '$1'],\n    [/(wi|kni|(?:after|half|high|low|mid|non|night|[^\\w]|^)li)ves$/i, '$1fe'],\n    [/(ar|(?:wo|[ae])l|[eo][ao])ves$/i, '$1f'],\n    [/ies$/i, 'y'],\n    [/\\b([pl]|zomb|(?:neck|cross)?t|coll|faer|food|gen|goon|group|lass|talk|goal|cut)ies$/i, '$1ie'],\n    [/\\b(mon|smil)ies$/i, '$1ey'],\n    [/\\b((?:tit)?m|l)ice$/i, '$1ouse'],\n    [/(seraph|cherub)im$/i, '$1'],\n    [/(x|ch|ss|sh|zz|tto|go|cho|alias|[^aou]us|t[lm]as|gas|(?:her|at|gr)o|[aeiou]ris)(?:es)?$/i, '$1'],\n    [/(analy|diagno|parenthe|progno|synop|the|empha|cri|ne)(?:sis|ses)$/i, '$1sis'],\n    [/(movie|twelve|abuse|e[mn]u)s$/i, '$1'],\n    [/(test)(?:is|es)$/i, '$1is'],\n    [/(alumn|syllab|vir|radi|nucle|fung|cact|stimul|termin|bacill|foc|uter|loc|strat)(?:us|i)$/i, '$1us'],\n    [/(agend|addend|millenni|dat|extrem|bacteri|desiderat|strat|candelabr|errat|ov|symposi|curricul|quor)a$/i, '$1um'],\n    [/(apheli|hyperbat|periheli|asyndet|noumen|phenomen|criteri|organ|prolegomen|hedr|automat)a$/i, '$1on'],\n    [/(alumn|alg|vertebr)ae$/i, '$1a'],\n    [/(cod|mur|sil|vert|ind)ices$/i, '$1ex'],\n    [/(matr|append)ices$/i, '$1ix'],\n    [/(pe)(rson|ople)$/i, '$1rson'],\n    [/(child)ren$/i, '$1'],\n    [/(eau)x?$/i, '$1'],\n    [/men$/i, 'man']\n  ].forEach(function (rule) {\n    return pluralize.addSingularRule(rule[0], rule[1]);\n  });\n\n  /**\n   * Uncountable rules.\n   */\n  [\n    // Singular words with no plurals.\n    'adulthood',\n    'advice',\n    'agenda',\n    'aid',\n    'aircraft',\n    'alcohol',\n    'ammo',\n    'analytics',\n    'anime',\n    'athletics',\n    'audio',\n    'bison',\n    'blood',\n    'bream',\n    'buffalo',\n    'butter',\n    'carp',\n    'cash',\n    'chassis',\n    'chess',\n    'clothing',\n    'cod',\n    'commerce',\n    'cooperation',\n    'corps',\n    'debris',\n    'diabetes',\n    'digestion',\n    'elk',\n    'energy',\n    'equipment',\n    'excretion',\n    'expertise',\n    'firmware',\n    'flounder',\n    'fun',\n    'gallows',\n    'garbage',\n    'graffiti',\n    'hardware',\n    'headquarters',\n    'health',\n    'herpes',\n    'highjinks',\n    'homework',\n    'housework',\n    'information',\n    'jeans',\n    'justice',\n    'kudos',\n    'labour',\n    'literature',\n    'machinery',\n    'mackerel',\n    'mail',\n    'media',\n    'mews',\n    'moose',\n    'music',\n    'mud',\n    'manga',\n    'news',\n    'only',\n    'personnel',\n    'pike',\n    'plankton',\n    'pliers',\n    'police',\n    'pollution',\n    'premises',\n    'rain',\n    'research',\n    'rice',\n    'salmon',\n    'scissors',\n    'series',\n    'sewage',\n    'shambles',\n    'shrimp',\n    'software',\n    'species',\n    'staff',\n    'swine',\n    'tennis',\n    'traffic',\n    'transportation',\n    'trout',\n    'tuna',\n    'wealth',\n    'welfare',\n    'whiting',\n    'wildebeest',\n    'wildlife',\n    'you',\n    /pok[eé]mon$/i,\n    // Regexes.\n    /[^aeiou]ese$/i, // \"chinese\", \"japanese\"\n    /deer$/i, // \"deer\", \"reindeer\"\n    /fish$/i, // \"fish\", \"blowfish\", \"angelfish\"\n    /measles$/i,\n    /o[iu]s$/i, // \"carnivorous\"\n    /pox$/i, // \"chickpox\", \"smallpox\"\n    /sheep$/i\n  ].forEach(pluralize.addUncountableRule);\n\n  return pluralize;\n});\n","/* global Map:readonly, Set:readonly, ArrayBuffer:readonly */\n\nvar hasElementType = typeof Element !== 'undefined';\nvar hasMap = typeof Map === 'function';\nvar hasSet = typeof Set === 'function';\nvar hasArrayBuffer = typeof ArrayBuffer === 'function' && !!ArrayBuffer.isView;\n\n// Note: We **don't** need `envHasBigInt64Array` in fde es6/index.js\n\nfunction equal(a, b) {\n  // START: fast-deep-equal es6/index.js 3.1.3\n  if (a === b) return true;\n\n  if (a && b && typeof a == 'object' && typeof b == 'object') {\n    if (a.constructor !== b.constructor) return false;\n\n    var length, i, keys;\n    if (Array.isArray(a)) {\n      length = a.length;\n      if (length != b.length) return false;\n      for (i = length; i-- !== 0;)\n        if (!equal(a[i], b[i])) return false;\n      return true;\n    }\n\n    // START: Modifications:\n    // 1. Extra `has<Type> &&` helpers in initial condition allow es6 code\n    //    to co-exist with es5.\n    // 2. Replace `for of` with es5 compliant iteration using `for`.\n    //    Basically, take:\n    //\n    //    ```js\n    //    for (i of a.entries())\n    //      if (!b.has(i[0])) return false;\n    //    ```\n    //\n    //    ... and convert to:\n    //\n    //    ```js\n    //    it = a.entries();\n    //    while (!(i = it.next()).done)\n    //      if (!b.has(i.value[0])) return false;\n    //    ```\n    //\n    //    **Note**: `i` access switches to `i.value`.\n    var it;\n    if (hasMap && (a instanceof Map) && (b instanceof Map)) {\n      if (a.size !== b.size) return false;\n      it = a.entries();\n      while (!(i = it.next()).done)\n        if (!b.has(i.value[0])) return false;\n      it = a.entries();\n      while (!(i = it.next()).done)\n        if (!equal(i.value[1], b.get(i.value[0]))) return false;\n      return true;\n    }\n\n    if (hasSet && (a instanceof Set) && (b instanceof Set)) {\n      if (a.size !== b.size) return false;\n      it = a.entries();\n      while (!(i = it.next()).done)\n        if (!b.has(i.value[0])) return false;\n      return true;\n    }\n    // END: Modifications\n\n    if (hasArrayBuffer && ArrayBuffer.isView(a) && ArrayBuffer.isView(b)) {\n      length = a.length;\n      if (length != b.length) return false;\n      for (i = length; i-- !== 0;)\n        if (a[i] !== b[i]) return false;\n      return true;\n    }\n\n    if (a.constructor === RegExp) return a.source === b.source && a.flags === b.flags;\n    // START: Modifications:\n    // Apply guards for `Object.create(null)` handling. See:\n    // - https://github.com/FormidableLabs/react-fast-compare/issues/64\n    // - https://github.com/epoberezkin/fast-deep-equal/issues/49\n    if (a.valueOf !== Object.prototype.valueOf && typeof a.valueOf === 'function' && typeof b.valueOf === 'function') return a.valueOf() === b.valueOf();\n    if (a.toString !== Object.prototype.toString && typeof a.toString === 'function' && typeof b.toString === 'function') return a.toString() === b.toString();\n    // END: Modifications\n\n    keys = Object.keys(a);\n    length = keys.length;\n    if (length !== Object.keys(b).length) return false;\n\n    for (i = length; i-- !== 0;)\n      if (!Object.prototype.hasOwnProperty.call(b, keys[i])) return false;\n    // END: fast-deep-equal\n\n    // START: react-fast-compare\n    // custom handling for DOM elements\n    if (hasElementType && a instanceof Element) return false;\n\n    // custom handling for React/Preact\n    for (i = length; i-- !== 0;) {\n      if ((keys[i] === '_owner' || keys[i] === '__v' || keys[i] === '__o') && a.$$typeof) {\n        // React-specific: avoid traversing React elements' _owner\n        // Preact-specific: avoid traversing Preact elements' __v and __o\n        //    __v = $_original / $_vnode\n        //    __o = $_owner\n        // These properties contain circular references and are not needed when\n        // comparing the actual elements (and not their owners)\n        // .$$typeof and ._store on just reasonable markers of elements\n\n        continue;\n      }\n\n      // all other properties should be traversed as usual\n      if (!equal(a[keys[i]], b[keys[i]])) return false;\n    }\n    // END: react-fast-compare\n\n    // START: fast-deep-equal\n    return true;\n  }\n\n  return a !== a && b !== b;\n}\n// end fast-deep-equal\n\nmodule.exports = function isEqual(a, b) {\n  try {\n    return equal(a, b);\n  } catch (error) {\n    if (((error.message || '').match(/stack|recursion/i))) {\n      // warn on circular references, don't crash\n      // browsers give this different errors name and messages:\n      // chrome/safari: \"RangeError\", \"Maximum call stack size exceeded\"\n      // firefox: \"InternalError\", too much recursion\"\n      // edge: \"Error\", \"Out of stack space\"\n      console.warn('react-fast-compare cannot handle circular refs');\n      return false;\n    }\n    // some other error. we should definitely know about these\n    throw error;\n  }\n};\n","function _typeof(obj) { \"@babel/helpers - typeof\"; return _typeof = \"function\" == typeof Symbol && \"symbol\" == typeof Symbol.iterator ? function (obj) { return typeof obj; } : function (obj) { return obj && \"function\" == typeof Symbol && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }, _typeof(obj); }\nfunction ownKeys(object, enumerableOnly) { var keys = Object.keys(object); if (Object.getOwnPropertySymbols) { var symbols = Object.getOwnPropertySymbols(object); enumerableOnly && (symbols = symbols.filter(function (sym) { return Object.getOwnPropertyDescriptor(object, sym).enumerable; })), keys.push.apply(keys, symbols); } return keys; }\nfunction _objectSpread(target) { for (var i = 1; i < arguments.length; i++) { var source = null != arguments[i] ? arguments[i] : {}; i % 2 ? ownKeys(Object(source), !0).forEach(function (key) { _defineProperty(target, key, source[key]); }) : Object.getOwnPropertyDescriptors ? Object.defineProperties(target, Object.getOwnPropertyDescriptors(source)) : ownKeys(Object(source)).forEach(function (key) { Object.defineProperty(target, key, Object.getOwnPropertyDescriptor(source, key)); }); } return target; }\nfunction _defineProperty(obj, key, value) { key = _toPropertyKey(key); if (key in obj) { Object.defineProperty(obj, key, { value: value, enumerable: true, configurable: true, writable: true }); } else { obj[key] = value; } return obj; }\nfunction _toPropertyKey(arg) { var key = _toPrimitive(arg, \"string\"); return _typeof(key) === \"symbol\" ? key : String(key); }\nfunction _toPrimitive(input, hint) { if (_typeof(input) !== \"object\" || input === null) return input; var prim = input[Symbol.toPrimitive]; if (prim !== undefined) { var res = prim.call(input, hint || \"default\"); if (_typeof(res) !== \"object\") return res; throw new TypeError(\"@@toPrimitive must return a primitive value.\"); } return (hint === \"string\" ? String : Number)(input); }\nimport PropTypes from 'prop-types';\nimport createConnector from \"../core/createConnector.js\";\n\n/**\n * connectCurrentRefinements connector provides the logic to build a widget that will\n * give the user the ability to remove all or some of the filters that were\n * set.\n * @name connectCurrentRefinements\n * @kind connector\n * @propType {function} [transformItems] - Function to modify the items being displayed, e.g. for filtering or sorting them. Takes an items as parameter and expects it back in return.\n * @propType {function} [clearsQuery=false] - Pass true to also clear the search query\n * @providedPropType {function} refine - a function to remove a single filter\n * @providedPropType {array.<{label: string, attribute: string, currentRefinement: string || object, items: array, value: function}>} items - all the filters, the `value` is to pass to the `refine` function for removing all currentrefinements, `label` is for the display. When existing several refinements for the same atribute name, then you get a nested `items` object that contains a `label` and a `value` function to use to remove a single filter. `attribute` and `currentRefinement` are metadata containing row values.\n * @providedPropType {string} query - the search query\n */\nexport default createConnector({\n  displayName: 'AlgoliaCurrentRefinements',\n  $$type: 'ais.currentRefinements',\n  propTypes: {\n    transformItems: PropTypes.func\n  },\n  getProvidedProps: function getProvidedProps(props, searchState, searchResults, metadata) {\n    var items = metadata.reduce(function (res, meta) {\n      if (typeof meta.items !== 'undefined') {\n        if (!props.clearsQuery && meta.id === 'query') {\n          return res;\n        } else {\n          if (props.clearsQuery && meta.id === 'query' && meta.items[0].currentRefinement === '') {\n            return res;\n          }\n          return res.concat(meta.items.map(function (item) {\n            return _objectSpread(_objectSpread({}, item), {}, {\n              id: meta.id,\n              index: meta.index\n            });\n          }));\n        }\n      }\n      return res;\n    }, []);\n    var transformedItems = props.transformItems ? props.transformItems(items) : items;\n    return {\n      items: transformedItems,\n      canRefine: transformedItems.length > 0\n    };\n  },\n  refine: function refine(props, searchState, items) {\n    // `value` corresponds to our internal clear function computed in each connector metadata.\n    var refinementsToClear = items instanceof Array ? items.map(function (item) {\n      return item.value;\n    }) : [items];\n    return refinementsToClear.reduce(function (res, clear) {\n      return clear(res);\n    }, searchState);\n  }\n});","import createConnector from \"../core/createConnector.js\";\nimport { getResults } from \"../core/indexUtils.js\";\nimport { addAbsolutePositions, addQueryID } from \"../core/utils.js\";\n\n/**\n * connectHits connector provides the logic to create connected\n * components that will render the results retrieved from\n * Algolia.\n *\n * To configure the number of hits retrieved, use [HitsPerPage widget](widgets/HitsPerPage.html),\n * [connectHitsPerPage connector](connectors/connectHitsPerPage.html) or pass the hitsPerPage\n * prop to a [Configure](guide/Search_parameters.html) widget.\n *\n * **Warning:** you will need to use the **objectID** property available on every hit as a key\n * when iterating over them. This will ensure you have the best possible UI experience\n * especially on slow networks.\n * @name connectHits\n * @kind connector\n * @providedPropType {array.<object>} hits - the records that matched the search state\n * @example\n * import React from 'react';\n * import algoliasearch from 'algoliasearch/lite';\n * import { InstantSearch, Highlight, connectHits } from 'react-instantsearch-dom';\n *\n * const searchClient = algoliasearch(\n *   'latency',\n *   '6be0576ff61c053d5f9a3225e2a90f76'\n * );\n * const CustomHits = connectHits(({ hits }) => (\n *   <div>\n *     {hits.map(hit =>\n *       <p key={hit.objectID}>\n *         <Highlight attribute=\"name\" hit={hit} />\n *       </p>\n *     )}\n *   </div>\n * ));\n *\n * const App = () => (\n *   <InstantSearch\n *     searchClient={searchClient}\n *     indexName=\"instant_search\"\n *   >\n *     <CustomHits />\n *   </InstantSearch>\n * );\n */\nexport default createConnector({\n  displayName: 'AlgoliaHits',\n  $$type: 'ais.hits',\n  getProvidedProps: function getProvidedProps(props, searchState, searchResults) {\n    var results = getResults(searchResults, {\n      ais: props.contextValue,\n      multiIndexContext: props.indexContextValue\n    });\n    if (!results) {\n      return {\n        hits: []\n      };\n    }\n    var hitsWithPositions = addAbsolutePositions(results.hits, results.hitsPerPage, results.page);\n    var hitsWithPositionsAndQueryID = addQueryID(hitsWithPositions, results.queryID);\n    return {\n      hits: hitsWithPositionsAndQueryID\n    };\n  },\n  /*\n   * Hits needs to be considered as a widget to trigger a search,\n   * even if no other widgets are used.\n   *\n   * To be considered as a widget you need either:\n   * - getSearchParameters\n   * - getMetadata\n   * - transitionState\n   *\n   * See: createConnector.tsx\n   */\n  getSearchParameters: function getSearchParameters(searchParameters) {\n    return searchParameters;\n  }\n});","function _typeof(obj) { \"@babel/helpers - typeof\"; return _typeof = \"function\" == typeof Symbol && \"symbol\" == typeof Symbol.iterator ? function (obj) { return typeof obj; } : function (obj) { return obj && \"function\" == typeof Symbol && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }, _typeof(obj); }\nfunction _defineProperty(obj, key, value) { key = _toPropertyKey(key); if (key in obj) { Object.defineProperty(obj, key, { value: value, enumerable: true, configurable: true, writable: true }); } else { obj[key] = value; } return obj; }\nfunction _toPropertyKey(arg) { var key = _toPrimitive(arg, \"string\"); return _typeof(key) === \"symbol\" ? key : String(key); }\nfunction _toPrimitive(input, hint) { if (_typeof(input) !== \"object\" || input === null) return input; var prim = input[Symbol.toPrimitive]; if (prim !== undefined) { var res = prim.call(input, hint || \"default\"); if (_typeof(res) !== \"object\") return res; throw new TypeError(\"@@toPrimitive must return a primitive value.\"); } return (hint === \"string\" ? String : Number)(input); }\nimport PropTypes from 'prop-types';\nimport createConnector from \"../core/createConnector.js\";\nimport { cleanUpValue, getIndexId, refineValue, getCurrentRefinementValue, getResults } from \"../core/indexUtils.js\";\nimport { unescapeFacetValue } from \"../core/utils.js\";\nvar namespace = 'refinementList';\nfunction getId(props) {\n  return props.attribute;\n}\nfunction getCurrentRefinement(props, searchState, context) {\n  var currentRefinement = getCurrentRefinementValue(props, searchState, context, \"\".concat(namespace, \".\").concat(getId(props)), []);\n  if (typeof currentRefinement !== 'string') {\n    return currentRefinement;\n  }\n  if (currentRefinement) {\n    return [currentRefinement];\n  }\n  return [];\n}\nfunction getValue(value, props, searchState, context) {\n  var currentRefinement = getCurrentRefinement(props, searchState, context);\n  var isAnewValue = currentRefinement.indexOf(value) === -1;\n  var nextRefinement = isAnewValue ? currentRefinement.concat([value]) // cannot use .push(), it mutates\n  : currentRefinement.filter(function (selectedValue) {\n    return selectedValue !== value;\n  }); // cannot use .splice(), it mutates\n  return nextRefinement;\n}\nfunction getLimit(_ref) {\n  var showMore = _ref.showMore,\n    limit = _ref.limit,\n    showMoreLimit = _ref.showMoreLimit;\n  return showMore ? showMoreLimit : limit;\n}\nfunction _refine(props, searchState, nextRefinement, context) {\n  var id = getId(props);\n  // Setting the value to an empty string ensures that it is persisted in\n  // the URL as an empty value.\n  // This is necessary in the case where `defaultRefinement` contains one\n  // item and we try to deselect it. `nextSelected` would be an empty array,\n  // which would not be persisted to the URL.\n  // {foo: ['bar']} => \"foo[0]=bar\"\n  // {foo: []} => \"\"\n  var nextValue = _defineProperty({}, id, nextRefinement.length > 0 ? nextRefinement : '');\n  var resetPage = true;\n  return refineValue(searchState, nextValue, context, resetPage, namespace);\n}\nfunction _cleanUp(props, searchState, context) {\n  return cleanUpValue(searchState, context, \"\".concat(namespace, \".\").concat(getId(props)));\n}\n/**\n * connectRefinementList connector provides the logic to build a widget that will\n * give the user the ability to choose multiple values for a specific facet.\n * @name connectRefinementList\n * @kind connector\n * @requirements The attribute passed to the `attribute` prop must be present in \"attributes for faceting\"\n * on the Algolia dashboard or configured as `attributesForFaceting` via a set settings call to the Algolia API.\n * @propType {string} attribute - the name of the attribute in the record\n * @propType {boolean} [searchable=false] - allow search inside values\n * @propType {string} [operator=or] - How to apply the refinements. Possible values: 'or' or 'and'.\n * @propType {boolean} [showMore=false] - true if the component should display a button that will expand the number of items\n * @propType {number} [limit=10] - the minimum number of displayed items\n * @propType {number} [showMoreLimit=20] - the maximun number of displayed items. Only used when showMore is set to `true`\n * @propType {string[]} defaultRefinement - the values of the items selected by default. The searchState of this widget takes the form of a list of `string`s, which correspond to the values of all selected refinements. However, when there are no refinements selected, the value of the searchState is an empty string.\n * @propType {function} [transformItems] - Function to modify the items being displayed, e.g. for filtering or sorting them. Takes an items as parameter and expects it back in return.\n * @providedPropType {function} refine - a function to toggle a refinement\n * @providedPropType {function} createURL - a function to generate a URL for the corresponding search state\n * @providedPropType {string[]} currentRefinement - the refinement currently applied\n * @providedPropType {array.<{count: number, isRefined: boolean, label: string, value: string}>} items - the list of items the RefinementList can display.\n * @providedPropType {function} searchForItems - a function to toggle a search inside items values\n * @providedPropType {boolean} isFromSearch - a boolean that says if the `items` props contains facet values from the global search or from the search inside items.\n * @providedPropType {boolean} canRefine - a boolean that says whether you can refine\n */\n\nvar sortBy = ['isRefined', 'count:desc', 'name:asc'];\nexport default createConnector({\n  displayName: 'AlgoliaRefinementList',\n  $$type: 'ais.refinementList',\n  propTypes: {\n    id: PropTypes.string,\n    attribute: PropTypes.string.isRequired,\n    operator: PropTypes.oneOf(['and', 'or']),\n    showMore: PropTypes.bool,\n    limit: PropTypes.number,\n    showMoreLimit: PropTypes.number,\n    defaultRefinement: PropTypes.arrayOf(PropTypes.oneOfType([PropTypes.string, PropTypes.number])),\n    searchable: PropTypes.bool,\n    transformItems: PropTypes.func,\n    facetOrdering: PropTypes.bool\n  },\n  defaultProps: {\n    operator: 'or',\n    showMore: false,\n    limit: 10,\n    showMoreLimit: 20,\n    facetOrdering: true\n  },\n  getProvidedProps: function getProvidedProps(props, searchState, searchResults, metadata, searchForFacetValuesResults) {\n    var attribute = props.attribute,\n      searchable = props.searchable,\n      indexContextValue = props.indexContextValue,\n      facetOrdering = props.facetOrdering;\n    var results = getResults(searchResults, {\n      ais: props.contextValue,\n      multiIndexContext: props.indexContextValue\n    });\n    var canRefine = Boolean(results) && Boolean(results.getFacetByName(attribute));\n    var isFromSearch = Boolean(searchForFacetValuesResults && searchForFacetValuesResults[attribute] && searchForFacetValuesResults.query !== '');\n\n    // Search For Facet Values is not available with derived helper (used for multi index search)\n    if (searchable && indexContextValue) {\n      throw new Error('react-instantsearch: searching in *List is not available when used inside a' + ' multi index context');\n    }\n    if (!canRefine) {\n      return {\n        items: [],\n        currentRefinement: getCurrentRefinement(props, searchState, {\n          ais: props.contextValue,\n          multiIndexContext: props.indexContextValue\n        }),\n        canRefine: canRefine,\n        isFromSearch: isFromSearch,\n        searchable: searchable\n      };\n    }\n    var items = isFromSearch ? searchForFacetValuesResults[attribute].map(function (v) {\n      return {\n        label: v.value,\n        value: getValue(v.escapedValue, props, searchState, {\n          ais: props.contextValue,\n          multiIndexContext: props.indexContextValue\n        }),\n        _highlightResult: {\n          label: {\n            value: v.highlighted\n          }\n        },\n        count: v.count,\n        isRefined: v.isRefined\n      };\n    }) : results.getFacetValues(attribute, {\n      sortBy: sortBy,\n      facetOrdering: facetOrdering\n    }).map(function (v) {\n      return {\n        label: v.name,\n        value: getValue(v.escapedValue, props, searchState, {\n          ais: props.contextValue,\n          multiIndexContext: props.indexContextValue\n        }),\n        count: v.count,\n        isRefined: v.isRefined\n      };\n    });\n    var transformedItems = props.transformItems ? props.transformItems(items) : items;\n    return {\n      items: transformedItems.slice(0, getLimit(props)),\n      currentRefinement: getCurrentRefinement(props, searchState, {\n        ais: props.contextValue,\n        multiIndexContext: props.indexContextValue\n      }),\n      isFromSearch: isFromSearch,\n      searchable: searchable,\n      canRefine: transformedItems.length > 0\n    };\n  },\n  refine: function refine(props, searchState, nextRefinement) {\n    return _refine(props, searchState, nextRefinement, {\n      ais: props.contextValue,\n      multiIndexContext: props.indexContextValue\n    });\n  },\n  searchForFacetValues: function searchForFacetValues(props, searchState, nextRefinement) {\n    return {\n      facetName: props.attribute,\n      query: nextRefinement,\n      maxFacetHits: getLimit(props)\n    };\n  },\n  cleanUp: function cleanUp(props, searchState) {\n    return _cleanUp(props, searchState, {\n      ais: props.contextValue,\n      multiIndexContext: props.indexContextValue\n    });\n  },\n  getSearchParameters: function getSearchParameters(searchParameters, props, searchState) {\n    var attribute = props.attribute,\n      operator = props.operator;\n    var addKey = operator === 'and' ? 'addFacet' : 'addDisjunctiveFacet';\n    var addRefinementKey = \"\".concat(addKey, \"Refinement\");\n    searchParameters = searchParameters.setQueryParameters({\n      maxValuesPerFacet: Math.max(searchParameters.maxValuesPerFacet || 0, getLimit(props))\n    });\n    searchParameters = searchParameters[addKey](attribute);\n    return getCurrentRefinement(props, searchState, {\n      ais: props.contextValue,\n      multiIndexContext: props.indexContextValue\n    }).reduce(function (res, val) {\n      return res[addRefinementKey](attribute, val);\n    }, searchParameters);\n  },\n  getMetadata: function getMetadata(props, searchState) {\n    var id = getId(props);\n    var context = {\n      ais: props.contextValue,\n      multiIndexContext: props.indexContextValue\n    };\n    return {\n      id: id,\n      index: getIndexId(context),\n      items: getCurrentRefinement(props, searchState, context).length > 0 ? [{\n        attribute: props.attribute,\n        label: \"\".concat(props.attribute, \": \"),\n        currentRefinement: getCurrentRefinement(props, searchState, context),\n        value: function value(nextState) {\n          return _refine(props, nextState, [], context);\n        },\n        items: getCurrentRefinement(props, searchState, context).map(function (item) {\n          return {\n            label: unescapeFacetValue(\"\".concat(item)),\n            value: function value(nextState) {\n              var nextSelectedItems = getCurrentRefinement(props, nextState, context).filter(function (other) {\n                return other !== item;\n              });\n              return _refine(props, searchState, nextSelectedItems, context);\n            }\n          };\n        })\n      }] : []\n    };\n  }\n});","function _typeof(obj) { \"@babel/helpers - typeof\"; return _typeof = \"function\" == typeof Symbol && \"symbol\" == typeof Symbol.iterator ? function (obj) { return typeof obj; } : function (obj) { return obj && \"function\" == typeof Symbol && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }, _typeof(obj); }\nfunction _defineProperty(obj, key, value) { key = _toPropertyKey(key); if (key in obj) { Object.defineProperty(obj, key, { value: value, enumerable: true, configurable: true, writable: true }); } else { obj[key] = value; } return obj; }\nfunction _toPropertyKey(arg) { var key = _toPrimitive(arg, \"string\"); return _typeof(key) === \"symbol\" ? key : String(key); }\nfunction _toPrimitive(input, hint) { if (_typeof(input) !== \"object\" || input === null) return input; var prim = input[Symbol.toPrimitive]; if (prim !== undefined) { var res = prim.call(input, hint || \"default\"); if (_typeof(res) !== \"object\") return res; throw new TypeError(\"@@toPrimitive must return a primitive value.\"); } return (hint === \"string\" ? String : Number)(input); }\nimport PropTypes from 'prop-types';\nimport createConnector from \"../core/createConnector.js\";\nimport { cleanUpValue, refineValue, getCurrentRefinementValue, getIndexId } from \"../core/indexUtils.js\";\nfunction getId() {\n  return 'query';\n}\nfunction getCurrentRefinement(props, searchState, context) {\n  var id = getId(props);\n  var currentRefinement = getCurrentRefinementValue(props, searchState, context, id, '');\n  if (currentRefinement) {\n    return currentRefinement;\n  }\n  return '';\n}\nfunction _refine(props, searchState, nextRefinement, context) {\n  var id = getId();\n  var nextValue = _defineProperty({}, id, nextRefinement);\n  var resetPage = true;\n  return refineValue(searchState, nextValue, context, resetPage);\n}\nfunction _cleanUp(props, searchState, context) {\n  return cleanUpValue(searchState, context, getId());\n}\n\n/**\n * connectSearchBox connector provides the logic to build a widget that will\n * let the user search for a query\n * @name connectSearchBox\n * @kind connector\n * @propType {string} [defaultRefinement] - Provide a default value for the query\n * @providedPropType {function} refine - a function to change the current query\n * @providedPropType {string} currentRefinement - the current query used\n * @providedPropType {boolean} isSearchStalled - a flag that indicates if InstantSearch has detected that searches are stalled\n */\nexport default createConnector({\n  displayName: 'AlgoliaSearchBox',\n  $$type: 'ais.searchBox',\n  propTypes: {\n    defaultRefinement: PropTypes.string\n  },\n  getProvidedProps: function getProvidedProps(props, searchState, searchResults) {\n    return {\n      currentRefinement: getCurrentRefinement(props, searchState, {\n        ais: props.contextValue,\n        multiIndexContext: props.indexContextValue\n      }),\n      isSearchStalled: searchResults.isSearchStalled\n    };\n  },\n  refine: function refine(props, searchState, nextRefinement) {\n    return _refine(props, searchState, nextRefinement, {\n      ais: props.contextValue,\n      multiIndexContext: props.indexContextValue\n    });\n  },\n  cleanUp: function cleanUp(props, searchState) {\n    return _cleanUp(props, searchState, {\n      ais: props.contextValue,\n      multiIndexContext: props.indexContextValue\n    });\n  },\n  getSearchParameters: function getSearchParameters(searchParameters, props, searchState) {\n    return searchParameters.setQuery(getCurrentRefinement(props, searchState, {\n      ais: props.contextValue,\n      multiIndexContext: props.indexContextValue\n    }));\n  },\n  getMetadata: function getMetadata(props, searchState) {\n    var id = getId(props);\n    var currentRefinement = getCurrentRefinement(props, searchState, {\n      ais: props.contextValue,\n      multiIndexContext: props.indexContextValue\n    });\n    return {\n      id: id,\n      index: getIndexId({\n        ais: props.contextValue,\n        multiIndexContext: props.indexContextValue\n      }),\n      items: currentRefinement === null ? [] : [{\n        label: \"\".concat(id, \": \").concat(currentRefinement),\n        value: function value(nextState) {\n          return _refine(props, nextState, '', {\n            ais: props.contextValue,\n            multiIndexContext: props.indexContextValue\n          });\n        },\n        currentRefinement: currentRefinement\n      }]\n    };\n  }\n});","import createConnector from \"../core/createConnector.js\";\nimport { getResults } from \"../core/indexUtils.js\";\n\n/**\n * The `connectStateResults` connector provides a way to access the `searchState` and the `searchResults`\n * of InstantSearch.\n * For instance this connector allows you to create results/noResults or query/noQuery pages.\n * @name connectStateResults\n * @kind connector\n * @providedPropType {object} searchState - The search state of the instant search component. <br/><br/> See: [Search state structure](https://community.algolia.com/react-instantsearch/guide/Search_state.html)\n * @providedPropType {object} searchResults - The search results. <br/><br/> In case of multiple indices: if used under `<Index>`, results will be those of the corresponding index otherwise it'll be those of the root index  See: [Search results structure](https://community.algolia.com/algoliasearch-helper-js/reference.html#searchresults)\n * @providedPropType {object} allSearchResults - In case of multiple indices you can retrieve all the results\n * @providedPropType {string} error - If the search failed, the error will be logged here.\n * @providedPropType {boolean} searching - If there is a search in progress.\n * @providedPropType {boolean} isSearchStalled - Flag that indicates if React InstantSearch has detected that searches are stalled.\n * @providedPropType {boolean} searchingForFacetValues - If there is a search in a list in progress.\n * @providedPropType {object} props - component props.\n * @example\n * import React from 'react';\n * import algoliasearch from 'algoliasearch/lite';\n * import { InstantSearch, SearchBox, Hits, connectStateResults } from 'react-instantsearch-dom';\n *\n * const searchClient = algoliasearch(\n *   'latency',\n *   '6be0576ff61c053d5f9a3225e2a90f76'\n * );\n *\n * const Content = connectStateResults(({ searchState, searchResults }) => {\n *   const hasResults = searchResults && searchResults.nbHits !== 0;\n *\n *    return (\n *      <div>\n *        <div hidden={!hasResults}>\n *          <Hits />\n *        </div>\n *        <div hidden={hasResults}>\n *          <div>No results has been found for {searchState.query}</div>\n *        </div>\n *      </div>\n *    );\n * });\n *\n * const App = () => (\n *   <InstantSearch\n *      searchClient={searchClient}\n *      indexName=\"instant_search\"\n *    >\n *      <SearchBox />\n *      <Content />\n *    </InstantSearch>\n * );\n */\nexport default createConnector({\n  displayName: 'AlgoliaStateResults',\n  $$type: 'ais.stateResults',\n  getProvidedProps: function getProvidedProps(props, searchState, searchResults) {\n    var results = getResults(searchResults, {\n      ais: props.contextValue,\n      multiIndexContext: props.indexContextValue\n    });\n    return {\n      searchState: searchState,\n      searchResults: results,\n      allSearchResults: searchResults.results,\n      searching: searchResults.searching,\n      isSearchStalled: searchResults.isSearchStalled,\n      error: searchResults.error,\n      searchingForFacetValues: searchResults.searchingForFacetValues,\n      props: props\n    };\n  }\n});","import { createContext } from 'react';\nexport var instantSearchContext = /*#__PURE__*/createContext({\n  onInternalStateUpdate: function onInternalStateUpdate() {\n    return undefined;\n  },\n  createHrefForState: function createHrefForState() {\n    return '#';\n  },\n  onSearchForFacetValues: function onSearchForFacetValues() {\n    return undefined;\n  },\n  onSearchStateChange: function onSearchStateChange() {\n    return undefined;\n  },\n  onSearchParameters: function onSearchParameters() {\n    return undefined;\n  },\n  store: {},\n  widgetsManager: {},\n  mainTargetedIndex: ''\n});\nvar InstantSearchConsumer = instantSearchContext.Consumer,\n  InstantSearchProvider = instantSearchContext.Provider;\nexport { InstantSearchConsumer, InstantSearchProvider };\nvar _createContext = /*#__PURE__*/createContext(undefined),\n  IndexConsumer = _createContext.Consumer,\n  IndexProvider = _createContext.Provider;\nexport { IndexConsumer, IndexProvider };","var _excluded = [\"contextValue\"];\nfunction _typeof(obj) { \"@babel/helpers - typeof\"; return _typeof = \"function\" == typeof Symbol && \"symbol\" == typeof Symbol.iterator ? function (obj) { return typeof obj; } : function (obj) { return obj && \"function\" == typeof Symbol && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }, _typeof(obj); }\nfunction _extends() { _extends = Object.assign ? Object.assign.bind() : function (target) { for (var i = 1; i < arguments.length; i++) { var source = arguments[i]; for (var key in source) { if (Object.prototype.hasOwnProperty.call(source, key)) { target[key] = source[key]; } } } return target; }; return _extends.apply(this, arguments); }\nfunction _objectWithoutProperties(source, excluded) { if (source == null) return {}; var target = _objectWithoutPropertiesLoose(source, excluded); var key, i; if (Object.getOwnPropertySymbols) { var sourceSymbolKeys = Object.getOwnPropertySymbols(source); for (i = 0; i < sourceSymbolKeys.length; i++) { key = sourceSymbolKeys[i]; if (excluded.indexOf(key) >= 0) continue; if (!Object.prototype.propertyIsEnumerable.call(source, key)) continue; target[key] = source[key]; } } return target; }\nfunction _objectWithoutPropertiesLoose(source, excluded) { if (source == null) return {}; var target = {}; var sourceKeys = Object.keys(source); var key, i; for (i = 0; i < sourceKeys.length; i++) { key = sourceKeys[i]; if (excluded.indexOf(key) >= 0) continue; target[key] = source[key]; } return target; }\nfunction ownKeys(object, enumerableOnly) { var keys = Object.keys(object); if (Object.getOwnPropertySymbols) { var symbols = Object.getOwnPropertySymbols(object); enumerableOnly && (symbols = symbols.filter(function (sym) { return Object.getOwnPropertyDescriptor(object, sym).enumerable; })), keys.push.apply(keys, symbols); } return keys; }\nfunction _objectSpread(target) { for (var i = 1; i < arguments.length; i++) { var source = null != arguments[i] ? arguments[i] : {}; i % 2 ? ownKeys(Object(source), !0).forEach(function (key) { _defineProperty(target, key, source[key]); }) : Object.getOwnPropertyDescriptors ? Object.defineProperties(target, Object.getOwnPropertyDescriptors(source)) : ownKeys(Object(source)).forEach(function (key) { Object.defineProperty(target, key, Object.getOwnPropertyDescriptor(source, key)); }); } return target; }\nfunction _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError(\"Cannot call a class as a function\"); } }\nfunction _defineProperties(target, props) { for (var i = 0; i < props.length; i++) { var descriptor = props[i]; descriptor.enumerable = descriptor.enumerable || false; descriptor.configurable = true; if (\"value\" in descriptor) descriptor.writable = true; Object.defineProperty(target, _toPropertyKey(descriptor.key), descriptor); } }\nfunction _createClass(Constructor, protoProps, staticProps) { if (protoProps) _defineProperties(Constructor.prototype, protoProps); if (staticProps) _defineProperties(Constructor, staticProps); Object.defineProperty(Constructor, \"prototype\", { writable: false }); return Constructor; }\nfunction _inherits(subClass, superClass) { if (typeof superClass !== \"function\" && superClass !== null) { throw new TypeError(\"Super expression must either be null or a function\"); } subClass.prototype = Object.create(superClass && superClass.prototype, { constructor: { value: subClass, writable: true, configurable: true } }); Object.defineProperty(subClass, \"prototype\", { writable: false }); if (superClass) _setPrototypeOf(subClass, superClass); }\nfunction _setPrototypeOf(o, p) { _setPrototypeOf = Object.setPrototypeOf ? Object.setPrototypeOf.bind() : function _setPrototypeOf(o, p) { o.__proto__ = p; return o; }; return _setPrototypeOf(o, p); }\nfunction _createSuper(Derived) { var hasNativeReflectConstruct = _isNativeReflectConstruct(); return function _createSuperInternal() { var Super = _getPrototypeOf(Derived), result; if (hasNativeReflectConstruct) { var NewTarget = _getPrototypeOf(this).constructor; result = Reflect.construct(Super, arguments, NewTarget); } else { result = Super.apply(this, arguments); } return _possibleConstructorReturn(this, result); }; }\nfunction _possibleConstructorReturn(self, call) { if (call && (_typeof(call) === \"object\" || typeof call === \"function\")) { return call; } else if (call !== void 0) { throw new TypeError(\"Derived constructors may only return object or undefined\"); } return _assertThisInitialized(self); }\nfunction _assertThisInitialized(self) { if (self === void 0) { throw new ReferenceError(\"this hasn't been initialised - super() hasn't been called\"); } return self; }\nfunction _isNativeReflectConstruct() { if (typeof Reflect === \"undefined\" || !Reflect.construct) return false; if (Reflect.construct.sham) return false; if (typeof Proxy === \"function\") return true; try { Boolean.prototype.valueOf.call(Reflect.construct(Boolean, [], function () {})); return true; } catch (e) { return false; } }\nfunction _getPrototypeOf(o) { _getPrototypeOf = Object.setPrototypeOf ? Object.getPrototypeOf.bind() : function _getPrototypeOf(o) { return o.__proto__ || Object.getPrototypeOf(o); }; return _getPrototypeOf(o); }\nfunction _defineProperty(obj, key, value) { key = _toPropertyKey(key); if (key in obj) { Object.defineProperty(obj, key, { value: value, enumerable: true, configurable: true, writable: true }); } else { obj[key] = value; } return obj; }\nfunction _toPropertyKey(arg) { var key = _toPrimitive(arg, \"string\"); return _typeof(key) === \"symbol\" ? key : String(key); }\nfunction _toPrimitive(input, hint) { if (_typeof(input) !== \"object\" || input === null) return input; var prim = input[Symbol.toPrimitive]; if (prim !== undefined) { var res = prim.call(input, hint || \"default\"); if (_typeof(res) !== \"object\") return res; throw new TypeError(\"@@toPrimitive must return a primitive value.\"); } return (hint === \"string\" ? String : Number)(input); }\nimport React, { Component } from 'react';\nimport isEqual from 'react-fast-compare';\nimport { InstantSearchConsumer, IndexConsumer } from \"./context.js\";\nimport { shallowEqual, getDisplayName, removeEmptyKey } from \"./utils.js\";\n/**\n * Connectors are the HOC used to transform React components\n * into InstantSearch widgets.\n * In order to simplify the construction of such connectors\n * `createConnector` takes a description and transform it into\n * a connector.\n * @param {ConnectorDescription} connectorDesc the description of the connector\n * @return {Connector} a function that wraps a component into\n * an instantsearch connected one.\n */\nexport function createConnectorWithoutContext(connectorDesc) {\n  if (!connectorDesc.displayName) {\n    throw new Error('`createConnector` requires you to provide a `displayName` property.');\n  }\n  var isWidget = typeof connectorDesc.getSearchParameters === 'function' || typeof connectorDesc.getMetadata === 'function' || typeof connectorDesc.transitionState === 'function';\n  return function (Composed) {\n    var additionalWidgetProperties = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {};\n    var Connector = /*#__PURE__*/function (_Component) {\n      _inherits(Connector, _Component);\n      var _super = _createSuper(Connector);\n      function Connector(props) {\n        var _this;\n        _classCallCheck(this, Connector);\n        _this = _super.call(this, props);\n        _defineProperty(_assertThisInitialized(_this), \"unsubscribe\", void 0);\n        _defineProperty(_assertThisInitialized(_this), \"unregisterWidget\", void 0);\n        _defineProperty(_assertThisInitialized(_this), \"cleanupTimerRef\", null);\n        _defineProperty(_assertThisInitialized(_this), \"isUnmounting\", false);\n        _defineProperty(_assertThisInitialized(_this), \"state\", {\n          providedProps: _this.getProvidedProps(_this.props)\n        });\n        _defineProperty(_assertThisInitialized(_this), \"refine\", function () {\n          var _ref;\n          for (var _len = arguments.length, args = new Array(_len), _key = 0; _key < _len; _key++) {\n            args[_key] = arguments[_key];\n          }\n          _this.props.contextValue.onInternalStateUpdate(\n          // refine will always be defined here because the prop is only given conditionally\n          (_ref = connectorDesc.refine).call.apply(_ref, [_assertThisInitialized(_this), _this.props, _this.props.contextValue.store.getState().widgets].concat(args)));\n        });\n        _defineProperty(_assertThisInitialized(_this), \"createURL\", function () {\n          var _ref2;\n          for (var _len2 = arguments.length, args = new Array(_len2), _key2 = 0; _key2 < _len2; _key2++) {\n            args[_key2] = arguments[_key2];\n          }\n          return _this.props.contextValue.createHrefForState(\n          // refine will always be defined here because the prop is only given conditionally\n          (_ref2 = connectorDesc.refine).call.apply(_ref2, [_assertThisInitialized(_this), _this.props, _this.props.contextValue.store.getState().widgets].concat(args)));\n        });\n        _defineProperty(_assertThisInitialized(_this), \"searchForFacetValues\", function () {\n          var _ref3;\n          for (var _len3 = arguments.length, args = new Array(_len3), _key3 = 0; _key3 < _len3; _key3++) {\n            args[_key3] = arguments[_key3];\n          }\n          _this.props.contextValue.onSearchForFacetValues(\n          // searchForFacetValues will always be defined here because the prop is only given conditionally\n          (_ref3 = connectorDesc.searchForFacetValues).call.apply(_ref3, [_assertThisInitialized(_this), _this.props, _this.props.contextValue.store.getState().widgets].concat(args)));\n        });\n        if (connectorDesc.getSearchParameters) {\n          _this.props.contextValue.onSearchParameters(connectorDesc.getSearchParameters.bind(_assertThisInitialized(_this)), {\n            ais: _this.props.contextValue,\n            multiIndexContext: _this.props.indexContextValue\n          }, _this.props, connectorDesc.getMetadata && connectorDesc.getMetadata.bind(_assertThisInitialized(_this)), connectorDesc.displayName);\n        }\n        return _this;\n      }\n      _createClass(Connector, [{\n        key: \"componentDidMount\",\n        value: function componentDidMount() {\n          var _this2 = this;\n          if (this.cleanupTimerRef) {\n            clearTimeout(this.cleanupTimerRef);\n            this.cleanupTimerRef = null;\n          }\n          this.unsubscribe = this.props.contextValue.store.subscribe(function () {\n            if (!_this2.isUnmounting) {\n              _this2.setState({\n                providedProps: _this2.getProvidedProps(_this2.props)\n              });\n            }\n          });\n          if (isWidget) {\n            this.unregisterWidget = this.props.contextValue.widgetsManager.registerWidget(this);\n          }\n        }\n      }, {\n        key: \"shouldComponentUpdate\",\n        value: function shouldComponentUpdate(nextProps, nextState) {\n          if (typeof connectorDesc.shouldComponentUpdate === 'function') {\n            return connectorDesc.shouldComponentUpdate.call(this, this.props, nextProps, this.state, nextState);\n          }\n          var propsEqual = shallowEqual(this.props, nextProps);\n          if (this.state.providedProps === null || nextState.providedProps === null) {\n            if (this.state.providedProps === nextState.providedProps) {\n              return !propsEqual;\n            }\n            return true;\n          }\n          return !propsEqual || !shallowEqual(this.state.providedProps, nextState.providedProps);\n        }\n      }, {\n        key: \"componentDidUpdate\",\n        value: function componentDidUpdate(prevProps) {\n          if (!isEqual(prevProps, this.props)) {\n            this.setState({\n              providedProps: this.getProvidedProps(this.props)\n            });\n            if (isWidget) {\n              this.props.contextValue.widgetsManager.update();\n              if (typeof connectorDesc.transitionState === 'function') {\n                this.props.contextValue.onSearchStateChange(connectorDesc.transitionState.call(this, this.props, this.props.contextValue.store.getState().widgets, this.props.contextValue.store.getState().widgets));\n              }\n            }\n          }\n        }\n      }, {\n        key: \"componentWillUnmount\",\n        value: function componentWillUnmount() {\n          var _this3 = this;\n          this.cleanupTimerRef = setTimeout(function () {\n            _this3.isUnmounting = true;\n            if (_this3.unsubscribe) {\n              _this3.unsubscribe();\n            }\n            if (_this3.unregisterWidget) {\n              _this3.unregisterWidget();\n              if (typeof connectorDesc.cleanUp === 'function') {\n                var nextState = connectorDesc.cleanUp.call(_this3, _this3.props, _this3.props.contextValue.store.getState().widgets);\n                _this3.props.contextValue.store.setState(_objectSpread(_objectSpread({}, _this3.props.contextValue.store.getState()), {}, {\n                  widgets: nextState\n                }));\n                _this3.props.contextValue.onSearchStateChange(removeEmptyKey(nextState));\n              }\n            }\n          });\n        }\n      }, {\n        key: \"getProvidedProps\",\n        value: function getProvidedProps(props) {\n          var _this$props$contextVa = this.props.contextValue.store.getState(),\n            widgets = _this$props$contextVa.widgets,\n            results = _this$props$contextVa.results,\n            resultsFacetValues = _this$props$contextVa.resultsFacetValues,\n            searching = _this$props$contextVa.searching,\n            searchingForFacetValues = _this$props$contextVa.searchingForFacetValues,\n            isSearchStalled = _this$props$contextVa.isSearchStalled,\n            metadata = _this$props$contextVa.metadata,\n            error = _this$props$contextVa.error;\n          var searchResults = {\n            results: results,\n            searching: searching,\n            searchingForFacetValues: searchingForFacetValues,\n            isSearchStalled: isSearchStalled,\n            error: error\n          };\n          return connectorDesc.getProvidedProps.call(this, props, widgets, searchResults, metadata,\n          // @MAJOR: move this attribute on the `searchResults` it doesn't\n          // makes sense to have it into a separate argument. The search\n          // flags are on the object why not the results?\n          resultsFacetValues);\n        }\n      }, {\n        key: \"getSearchParameters\",\n        value: function getSearchParameters(searchParameters) {\n          if (typeof connectorDesc.getSearchParameters === 'function') {\n            return connectorDesc.getSearchParameters.call(this, searchParameters, this.props, this.props.contextValue.store.getState().widgets);\n          }\n          return null;\n        }\n      }, {\n        key: \"getMetadata\",\n        value: function getMetadata(nextWidgetsState) {\n          if (typeof connectorDesc.getMetadata === 'function') {\n            return connectorDesc.getMetadata.call(this, this.props, nextWidgetsState);\n          }\n          return {};\n        }\n      }, {\n        key: \"transitionState\",\n        value: function transitionState(prevWidgetsState, nextWidgetsState) {\n          if (typeof connectorDesc.transitionState === 'function') {\n            return connectorDesc.transitionState.call(this, this.props, prevWidgetsState, nextWidgetsState);\n          }\n          return nextWidgetsState;\n        }\n      }, {\n        key: \"render\",\n        value: function render() {\n          var _this$props = this.props,\n            contextValue = _this$props.contextValue,\n            props = _objectWithoutProperties(_this$props, _excluded);\n          var providedProps = this.state.providedProps;\n          if (providedProps === null) {\n            return null;\n          }\n          var refineProps = typeof connectorDesc.refine === 'function' ? {\n            refine: this.refine,\n            createURL: this.createURL\n          } : {};\n          var searchForFacetValuesProps = typeof connectorDesc.searchForFacetValues === 'function' ? {\n            searchForItems: this.searchForFacetValues\n          } : {};\n          return /*#__PURE__*/React.createElement(Composed, _extends({}, props, providedProps, refineProps, searchForFacetValuesProps));\n        }\n      }]);\n      return Connector;\n    }(Component);\n    _defineProperty(Connector, \"displayName\", \"\".concat(connectorDesc.displayName, \"(\").concat(getDisplayName(Composed), \")\"));\n    _defineProperty(Connector, \"$$type\", connectorDesc.$$type);\n    _defineProperty(Connector, \"$$widgetType\", additionalWidgetProperties.$$widgetType);\n    _defineProperty(Connector, \"propTypes\", connectorDesc.propTypes);\n    _defineProperty(Connector, \"defaultProps\", connectorDesc.defaultProps);\n    _defineProperty(Connector, \"_connectorDesc\", connectorDesc);\n    return Connector;\n  };\n}\nvar createConnectorWithContext = function createConnectorWithContext(connectorDesc) {\n  return function (Composed, additionalWidgetProperties) {\n    var Connector = createConnectorWithoutContext(connectorDesc)(Composed, additionalWidgetProperties);\n    var ConnectorWrapper = function ConnectorWrapper(props) {\n      return /*#__PURE__*/React.createElement(InstantSearchConsumer, null, function (contextValue) {\n        return /*#__PURE__*/React.createElement(IndexConsumer, null, function (indexContextValue) {\n          return /*#__PURE__*/React.createElement(Connector, _extends({\n            contextValue: contextValue,\n            indexContextValue: indexContextValue\n          }, props));\n        });\n      });\n    };\n    return ConnectorWrapper;\n  };\n};\nexport default createConnectorWithContext;","function _typeof(obj) { \"@babel/helpers - typeof\"; return _typeof = \"function\" == typeof Symbol && \"symbol\" == typeof Symbol.iterator ? function (obj) { return typeof obj; } : function (obj) { return obj && \"function\" == typeof Symbol && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }, _typeof(obj); }\nfunction ownKeys(object, enumerableOnly) { var keys = Object.keys(object); if (Object.getOwnPropertySymbols) { var symbols = Object.getOwnPropertySymbols(object); enumerableOnly && (symbols = symbols.filter(function (sym) { return Object.getOwnPropertyDescriptor(object, sym).enumerable; })), keys.push.apply(keys, symbols); } return keys; }\nfunction _objectSpread(target) { for (var i = 1; i < arguments.length; i++) { var source = null != arguments[i] ? arguments[i] : {}; i % 2 ? ownKeys(Object(source), !0).forEach(function (key) { _defineProperty(target, key, source[key]); }) : Object.getOwnPropertyDescriptors ? Object.defineProperties(target, Object.getOwnPropertyDescriptors(source)) : ownKeys(Object(source)).forEach(function (key) { Object.defineProperty(target, key, Object.getOwnPropertyDescriptor(source, key)); }); } return target; }\nfunction _defineProperty(obj, key, value) { key = _toPropertyKey(key); if (key in obj) { Object.defineProperty(obj, key, { value: value, enumerable: true, configurable: true, writable: true }); } else { obj[key] = value; } return obj; }\nfunction _toPropertyKey(arg) { var key = _toPrimitive(arg, \"string\"); return _typeof(key) === \"symbol\" ? key : String(key); }\nfunction _toPrimitive(input, hint) { if (_typeof(input) !== \"object\" || input === null) return input; var prim = input[Symbol.toPrimitive]; if (prim !== undefined) { var res = prim.call(input, hint || \"default\"); if (_typeof(res) !== \"object\") return res; throw new TypeError(\"@@toPrimitive must return a primitive value.\"); } return (hint === \"string\" ? String : Number)(input); }\nimport { omit } from \"./utils.js\";\nexport function getIndexId(context) {\n  return hasMultipleIndices(context) ? context.multiIndexContext.targetedIndex : context.ais.mainTargetedIndex;\n}\n\n// eslint-disable-next-line valid-jsdoc\n/**\n * @returns {import('algoliasearch-helper').SearchResults} results\n */\nexport function getResults(searchResults, context) {\n  if (searchResults.results) {\n    if (searchResults.results.hits) {\n      return searchResults.results;\n    }\n    var indexId = getIndexId(context);\n    if (searchResults.results[indexId]) {\n      return searchResults.results[indexId];\n    }\n  }\n  return null;\n}\nexport function hasMultipleIndices(context) {\n  return context && context.multiIndexContext;\n}\nexport function refineValue(searchState, nextRefinement, context, resetPage, namespace) {\n  if (hasMultipleIndices(context)) {\n    var indexId = getIndexId(context);\n    return namespace ? refineMultiIndexWithNamespace(searchState, nextRefinement, indexId, resetPage, namespace) : refineMultiIndex(searchState, nextRefinement, indexId, resetPage);\n  } else {\n    // When we have a multi index page with shared widgets we should also\n    // reset their page to 1 if the resetPage is provided. Otherwise the\n    // indices will always be reset\n    // see: https://github.com/algolia/react-instantsearch/issues/310\n    // see: https://github.com/algolia/react-instantsearch/issues/637\n    if (searchState.indices && resetPage) {\n      Object.keys(searchState.indices).forEach(function (targetedIndex) {\n        searchState = refineValue(searchState, {\n          page: 1\n        }, {\n          multiIndexContext: {\n            targetedIndex: targetedIndex\n          }\n        }, true, namespace);\n      });\n    }\n    return namespace ? refineSingleIndexWithNamespace(searchState, nextRefinement, resetPage, namespace) : refineSingleIndex(searchState, nextRefinement, resetPage);\n  }\n}\nfunction refineMultiIndex(searchState, nextRefinement, indexId, resetPage) {\n  var page = resetPage ? {\n    page: 1\n  } : undefined;\n  var state = searchState.indices && searchState.indices[indexId] ? _objectSpread(_objectSpread({}, searchState.indices), {}, _defineProperty({}, indexId, _objectSpread(_objectSpread(_objectSpread({}, searchState.indices[indexId]), nextRefinement), page))) : _objectSpread(_objectSpread({}, searchState.indices), {}, _defineProperty({}, indexId, _objectSpread(_objectSpread({}, nextRefinement), page)));\n  return _objectSpread(_objectSpread({}, searchState), {}, {\n    indices: state\n  });\n}\nfunction refineSingleIndex(searchState, nextRefinement, resetPage) {\n  var page = resetPage ? {\n    page: 1\n  } : undefined;\n  return _objectSpread(_objectSpread(_objectSpread({}, searchState), nextRefinement), page);\n}\nfunction refineMultiIndexWithNamespace(searchState, nextRefinement, indexId, resetPage, namespace) {\n  var _objectSpread4;\n  var page = resetPage ? {\n    page: 1\n  } : undefined;\n  var state = searchState.indices && searchState.indices[indexId] ? _objectSpread(_objectSpread({}, searchState.indices), {}, _defineProperty({}, indexId, _objectSpread(_objectSpread({}, searchState.indices[indexId]), {}, (_objectSpread4 = {}, _defineProperty(_objectSpread4, namespace, _objectSpread(_objectSpread({}, searchState.indices[indexId][namespace]), nextRefinement)), _defineProperty(_objectSpread4, \"page\", 1), _objectSpread4)))) : _objectSpread(_objectSpread({}, searchState.indices), {}, _defineProperty({}, indexId, _objectSpread(_defineProperty({}, namespace, nextRefinement), page)));\n  return _objectSpread(_objectSpread({}, searchState), {}, {\n    indices: state\n  });\n}\nfunction refineSingleIndexWithNamespace(searchState, nextRefinement, resetPage, namespace) {\n  var page = resetPage ? {\n    page: 1\n  } : undefined;\n  return _objectSpread(_objectSpread({}, searchState), {}, _defineProperty({}, namespace, _objectSpread(_objectSpread({}, searchState[namespace]), nextRefinement)), page);\n}\nfunction getNamespaceAndAttributeName(id) {\n  var parts = id.match(/^([^.]*)\\.(.*)/);\n  var namespace = parts && parts[1];\n  var attributeName = parts && parts[2];\n  return {\n    namespace: namespace,\n    attributeName: attributeName\n  };\n}\nfunction hasRefinements(_ref) {\n  var multiIndex = _ref.multiIndex,\n    indexId = _ref.indexId,\n    namespace = _ref.namespace,\n    attributeName = _ref.attributeName,\n    id = _ref.id,\n    searchState = _ref.searchState;\n  if (multiIndex && namespace) {\n    return searchState.indices && searchState.indices[indexId] && searchState.indices[indexId][namespace] && Object.hasOwnProperty.call(searchState.indices[indexId][namespace], attributeName);\n  }\n  if (multiIndex) {\n    return searchState.indices && searchState.indices[indexId] && Object.hasOwnProperty.call(searchState.indices[indexId], id);\n  }\n  if (namespace) {\n    return searchState[namespace] && Object.hasOwnProperty.call(searchState[namespace], attributeName);\n  }\n  return Object.hasOwnProperty.call(searchState, id);\n}\nfunction getRefinements(_ref2) {\n  var multiIndex = _ref2.multiIndex,\n    indexId = _ref2.indexId,\n    namespace = _ref2.namespace,\n    attributeName = _ref2.attributeName,\n    id = _ref2.id,\n    searchState = _ref2.searchState;\n  if (multiIndex && namespace) {\n    return searchState.indices[indexId][namespace][attributeName];\n  }\n  if (multiIndex) {\n    return searchState.indices[indexId][id];\n  }\n  if (namespace) {\n    return searchState[namespace][attributeName];\n  }\n  return searchState[id];\n}\nexport function getCurrentRefinementValue(props, searchState, context, id, defaultValue) {\n  var indexId = getIndexId(context);\n  var _getNamespaceAndAttri = getNamespaceAndAttributeName(id),\n    namespace = _getNamespaceAndAttri.namespace,\n    attributeName = _getNamespaceAndAttri.attributeName;\n  var multiIndex = hasMultipleIndices(context);\n  var args = {\n    multiIndex: multiIndex,\n    indexId: indexId,\n    namespace: namespace,\n    attributeName: attributeName,\n    id: id,\n    searchState: searchState\n  };\n  var hasRefinementsValue = hasRefinements(args);\n  if (hasRefinementsValue) {\n    return getRefinements(args);\n  }\n  if (props.defaultRefinement) {\n    return props.defaultRefinement;\n  }\n  return defaultValue;\n}\nexport function cleanUpValue(searchState, context, id) {\n  var indexId = getIndexId(context);\n  var _getNamespaceAndAttri2 = getNamespaceAndAttributeName(id),\n    namespace = _getNamespaceAndAttri2.namespace,\n    attributeName = _getNamespaceAndAttri2.attributeName;\n  if (hasMultipleIndices(context) && Boolean(searchState.indices)) {\n    return cleanUpValueWithMultiIndex({\n      attribute: attributeName,\n      searchState: searchState,\n      indexId: indexId,\n      id: id,\n      namespace: namespace\n    });\n  }\n  return cleanUpValueWithSingleIndex({\n    attribute: attributeName,\n    searchState: searchState,\n    id: id,\n    namespace: namespace\n  });\n}\nfunction cleanUpValueWithSingleIndex(_ref3) {\n  var searchState = _ref3.searchState,\n    id = _ref3.id,\n    namespace = _ref3.namespace,\n    attribute = _ref3.attribute;\n  if (namespace) {\n    return _objectSpread(_objectSpread({}, searchState), {}, _defineProperty({}, namespace, omit(searchState[namespace], [attribute])));\n  }\n  return omit(searchState, [id]);\n}\nfunction cleanUpValueWithMultiIndex(_ref4) {\n  var searchState = _ref4.searchState,\n    indexId = _ref4.indexId,\n    id = _ref4.id,\n    namespace = _ref4.namespace,\n    attribute = _ref4.attribute;\n  var indexSearchState = searchState.indices[indexId];\n  if (namespace && indexSearchState) {\n    return _objectSpread(_objectSpread({}, searchState), {}, {\n      indices: _objectSpread(_objectSpread({}, searchState.indices), {}, _defineProperty({}, indexId, _objectSpread(_objectSpread({}, indexSearchState), {}, _defineProperty({}, namespace, omit(indexSearchState[namespace], [attribute])))))\n    });\n  }\n  if (indexSearchState) {\n    return _objectSpread(_objectSpread({}, searchState), {}, {\n      indices: _objectSpread(_objectSpread({}, searchState.indices), {}, _defineProperty({}, indexId, omit(indexSearchState, [id])))\n    });\n  }\n  return searchState;\n}","function _typeof(obj) { \"@babel/helpers - typeof\"; return _typeof = \"function\" == typeof Symbol && \"symbol\" == typeof Symbol.iterator ? function (obj) { return typeof obj; } : function (obj) { return obj && \"function\" == typeof Symbol && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }, _typeof(obj); }\nfunction _extends() { _extends = Object.assign ? Object.assign.bind() : function (target) { for (var i = 1; i < arguments.length; i++) { var source = arguments[i]; for (var key in source) { if (Object.prototype.hasOwnProperty.call(source, key)) { target[key] = source[key]; } } } return target; }; return _extends.apply(this, arguments); }\nfunction _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError(\"Cannot call a class as a function\"); } }\nfunction _defineProperties(target, props) { for (var i = 0; i < props.length; i++) { var descriptor = props[i]; descriptor.enumerable = descriptor.enumerable || false; descriptor.configurable = true; if (\"value\" in descriptor) descriptor.writable = true; Object.defineProperty(target, _toPropertyKey(descriptor.key), descriptor); } }\nfunction _createClass(Constructor, protoProps, staticProps) { if (protoProps) _defineProperties(Constructor.prototype, protoProps); if (staticProps) _defineProperties(Constructor, staticProps); Object.defineProperty(Constructor, \"prototype\", { writable: false }); return Constructor; }\nfunction _inherits(subClass, superClass) { if (typeof superClass !== \"function\" && superClass !== null) { throw new TypeError(\"Super expression must either be null or a function\"); } subClass.prototype = Object.create(superClass && superClass.prototype, { constructor: { value: subClass, writable: true, configurable: true } }); Object.defineProperty(subClass, \"prototype\", { writable: false }); if (superClass) _setPrototypeOf(subClass, superClass); }\nfunction _setPrototypeOf(o, p) { _setPrototypeOf = Object.setPrototypeOf ? Object.setPrototypeOf.bind() : function _setPrototypeOf(o, p) { o.__proto__ = p; return o; }; return _setPrototypeOf(o, p); }\nfunction _createSuper(Derived) { var hasNativeReflectConstruct = _isNativeReflectConstruct(); return function _createSuperInternal() { var Super = _getPrototypeOf(Derived), result; if (hasNativeReflectConstruct) { var NewTarget = _getPrototypeOf(this).constructor; result = Reflect.construct(Super, arguments, NewTarget); } else { result = Super.apply(this, arguments); } return _possibleConstructorReturn(this, result); }; }\nfunction _possibleConstructorReturn(self, call) { if (call && (_typeof(call) === \"object\" || typeof call === \"function\")) { return call; } else if (call !== void 0) { throw new TypeError(\"Derived constructors may only return object or undefined\"); } return _assertThisInitialized(self); }\nfunction _assertThisInitialized(self) { if (self === void 0) { throw new ReferenceError(\"this hasn't been initialised - super() hasn't been called\"); } return self; }\nfunction _isNativeReflectConstruct() { if (typeof Reflect === \"undefined\" || !Reflect.construct) return false; if (Reflect.construct.sham) return false; if (typeof Proxy === \"function\") return true; try { Boolean.prototype.valueOf.call(Reflect.construct(Boolean, [], function () {})); return true; } catch (e) { return false; } }\nfunction _getPrototypeOf(o) { _getPrototypeOf = Object.setPrototypeOf ? Object.getPrototypeOf.bind() : function _getPrototypeOf(o) { return o.__proto__ || Object.getPrototypeOf(o); }; return _getPrototypeOf(o); }\nfunction _defineProperty(obj, key, value) { key = _toPropertyKey(key); if (key in obj) { Object.defineProperty(obj, key, { value: value, enumerable: true, configurable: true, writable: true }); } else { obj[key] = value; } return obj; }\nfunction _toPropertyKey(arg) { var key = _toPrimitive(arg, \"string\"); return _typeof(key) === \"symbol\" ? key : String(key); }\nfunction _toPrimitive(input, hint) { if (_typeof(input) !== \"object\" || input === null) return input; var prim = input[Symbol.toPrimitive]; if (prim !== undefined) { var res = prim.call(input, hint || \"default\"); if (_typeof(res) !== \"object\") return res; throw new TypeError(\"@@toPrimitive must return a primitive value.\"); } return (hint === \"string\" ? String : Number)(input); }\nimport React, { Component } from 'react';\nvar withKeysPropType = function withKeysPropType(keys) {\n  return function (props, propName, componentName) {\n    var prop = props[propName];\n    if (prop) {\n      // eslint-disable-next-line no-restricted-syntax\n      for (var _i = 0, _Object$keys = Object.keys(prop); _i < _Object$keys.length; _i++) {\n        var key = _Object$keys[_i];\n        if (keys.indexOf(key) === -1) {\n          return new Error(\"Unknown `\".concat(propName, \"` key `\").concat(key, \"`. Check the render method \") + \"of `\".concat(componentName, \"`.\"));\n        }\n      }\n    }\n    return undefined;\n  };\n};\nexport default function translatable(defaultTranslations) {\n  return function (Composed) {\n    var Translatable = /*#__PURE__*/function (_Component) {\n      _inherits(Translatable, _Component);\n      var _super = _createSuper(Translatable);\n      function Translatable() {\n        var _this;\n        _classCallCheck(this, Translatable);\n        for (var _len = arguments.length, args = new Array(_len), _key = 0; _key < _len; _key++) {\n          args[_key] = arguments[_key];\n        }\n        _this = _super.call.apply(_super, [this].concat(args));\n        _defineProperty(_assertThisInitialized(_this), \"translate\", function (key) {\n          var translations = _this.props.translations;\n          var translation = translations && translations.hasOwnProperty(key) ? translations[key] : defaultTranslations[key];\n          if (typeof translation === 'function') {\n            for (var _len2 = arguments.length, params = new Array(_len2 > 1 ? _len2 - 1 : 0), _key2 = 1; _key2 < _len2; _key2++) {\n              params[_key2 - 1] = arguments[_key2];\n            }\n            return translation.apply(void 0, params);\n          }\n          return translation;\n        });\n        return _this;\n      }\n      _createClass(Translatable, [{\n        key: \"render\",\n        value: function render() {\n          return /*#__PURE__*/React.createElement(Composed, _extends({\n            translate: this.translate\n          }, this.props));\n        }\n      }]);\n      return Translatable;\n    }(Component);\n    var name = Composed.displayName || Composed.name || 'UnknownComponent';\n    Translatable.displayName = \"Translatable(\".concat(name, \")\");\n    Translatable.propTypes = {\n      translations: withKeysPropType(Object.keys(defaultTranslations))\n    };\n    return Translatable;\n  };\n}","function ownKeys(object, enumerableOnly) { var keys = Object.keys(object); if (Object.getOwnPropertySymbols) { var symbols = Object.getOwnPropertySymbols(object); enumerableOnly && (symbols = symbols.filter(function (sym) { return Object.getOwnPropertyDescriptor(object, sym).enumerable; })), keys.push.apply(keys, symbols); } return keys; }\nfunction _objectSpread(target) { for (var i = 1; i < arguments.length; i++) { var source = null != arguments[i] ? arguments[i] : {}; i % 2 ? ownKeys(Object(source), !0).forEach(function (key) { _defineProperty(target, key, source[key]); }) : Object.getOwnPropertyDescriptors ? Object.defineProperties(target, Object.getOwnPropertyDescriptors(source)) : ownKeys(Object(source)).forEach(function (key) { Object.defineProperty(target, key, Object.getOwnPropertyDescriptor(source, key)); }); } return target; }\nfunction _defineProperty(obj, key, value) { key = _toPropertyKey(key); if (key in obj) { Object.defineProperty(obj, key, { value: value, enumerable: true, configurable: true, writable: true }); } else { obj[key] = value; } return obj; }\nfunction _toPropertyKey(arg) { var key = _toPrimitive(arg, \"string\"); return _typeof(key) === \"symbol\" ? key : String(key); }\nfunction _toPrimitive(input, hint) { if (_typeof(input) !== \"object\" || input === null) return input; var prim = input[Symbol.toPrimitive]; if (prim !== undefined) { var res = prim.call(input, hint || \"default\"); if (_typeof(res) !== \"object\") return res; throw new TypeError(\"@@toPrimitive must return a primitive value.\"); } return (hint === \"string\" ? String : Number)(input); }\nfunction _typeof(obj) { \"@babel/helpers - typeof\"; return _typeof = \"function\" == typeof Symbol && \"symbol\" == typeof Symbol.iterator ? function (obj) { return typeof obj; } : function (obj) { return obj && \"function\" == typeof Symbol && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }, _typeof(obj); }\n// eslint-disable-next-line @typescript-eslint/unbound-method\nvar hasOwn = Object.prototype.hasOwnProperty;\n\n// From https://github.com/reactjs/react-redux/blob/master/src/utils/shallowEqual.js\nexport var shallowEqual = function shallowEqual(objA, objB) {\n  if (objA === objB) {\n    return true;\n  }\n  var keysA = Object.keys(objA);\n  var keysB = Object.keys(objB);\n  if (keysA.length !== keysB.length) {\n    return false;\n  }\n\n  // Test for A's keys different from B.\n  for (var i = 0; i < keysA.length; i++) {\n    if (!hasOwn.call(objB, keysA[i]) || objA[keysA[i]] !== objB[keysA[i]]) {\n      return false;\n    }\n  }\n  return true;\n};\nexport var getDisplayName = function getDisplayName(Component) {\n  return Component.displayName || Component.name || 'UnknownComponent';\n};\nvar resolved = Promise.resolve();\nexport var defer = function defer(f) {\n  resolved.then(f);\n};\nvar isPlainObject = function isPlainObject(value) {\n  return _typeof(value) === 'object' && value !== null && !Array.isArray(value);\n};\nexport var removeEmptyKey = function removeEmptyKey(obj) {\n  Object.keys(obj).forEach(function (key) {\n    var value = obj[key];\n    if (!isPlainObject(value)) {\n      return;\n    }\n    if (!objectHasKeys(value)) {\n      delete obj[key];\n    } else {\n      removeEmptyKey(value);\n    }\n  });\n  return obj;\n};\nexport var removeEmptyArraysFromObject = function removeEmptyArraysFromObject(obj) {\n  Object.keys(obj).forEach(function (key) {\n    var value = obj[key];\n    if (Array.isArray(value) && value.length === 0) {\n      delete obj[key];\n    }\n  });\n  return obj;\n};\nexport function addAbsolutePositions(hits, hitsPerPage, page) {\n  return hits.map(function (hit, index) {\n    return _objectSpread(_objectSpread({}, hit), {}, {\n      __position: hitsPerPage * page + index + 1\n    });\n  });\n}\nexport function addQueryID(hits, queryID) {\n  if (!queryID) {\n    return hits;\n  }\n  return hits.map(function (hit) {\n    return _objectSpread(_objectSpread({}, hit), {}, {\n      __queryID: queryID\n    });\n  });\n}\nexport function find(array, comparator) {\n  if (!Array.isArray(array)) {\n    return undefined;\n  }\n  for (var i = 0; i < array.length; i++) {\n    if (comparator(array[i])) {\n      return array[i];\n    }\n  }\n  return undefined;\n}\nexport function objectHasKeys(object) {\n  return object && Object.keys(object).length > 0;\n}\n\n// https://github.com/babel/babel/blob/3aaafae053fa75febb3aa45d45b6f00646e30ba4/packages/babel-helpers/src/helpers.js#L604-L620\nexport function omit(source, excluded) {\n  if (source === null || source === undefined) {\n    return {};\n  }\n  var target = {};\n  var sourceKeys = Object.keys(source);\n  for (var i = 0; i < sourceKeys.length; i++) {\n    var key = sourceKeys[i];\n    if (excluded.indexOf(key) >= 0) {\n      // eslint-disable-next-line no-continue\n      continue;\n    }\n    target[key] = source[key];\n  }\n  return target;\n}\n\n/**\n * Retrieve the value at a path of the object:\n *\n * @example\n * getPropertyByPath(\n *   { test: { this: { function: [{ now: { everyone: true } }] } } },\n *   'test.this.function[0].now.everyone'\n * ); // true\n *\n * getPropertyByPath(\n *   { test: { this: { function: [{ now: { everyone: true } }] } } },\n *   ['test', 'this', 'function', 0, 'now', 'everyone']\n * ); // true\n *\n * @param object Source object to query\n * @param path either an array of properties, or a string form of the properties, separated by .\n */\nexport var getPropertyByPath = function getPropertyByPath(object, path) {\n  return (Array.isArray(path) ? path : path.replace(/\\[(\\d+)]/g, '.$1').split('.')).reduce(function (current, key) {\n    return current ? current[key] : undefined;\n  }, object);\n};\nexport function getObjectType(object) {\n  return Object.prototype.toString.call(object).slice(8, -1);\n}\nexport function unescapeFacetValue(value) {\n  return value.replace(/^\\\\-/, '-');\n}","import { getPropertyByPath } from \"./utils.js\";\nexport var HIGHLIGHT_TAGS = {\n  highlightPreTag: \"<ais-highlight-0000000000>\",\n  highlightPostTag: \"</ais-highlight-0000000000>\"\n};\n\n/**\n * Parses an highlighted attribute into an array of objects with the string value, and\n * a boolean that indicated if this part is highlighted.\n *\n * @param {string} preTag - string used to identify the start of an highlighted value\n * @param {string} postTag - string used to identify the end of an highlighted value\n * @param {string} highlightedValue - highlighted attribute as returned by Algolia highlight feature\n * @return {object[]} - An array of {value: string, isHighlighted: boolean}.\n */\nfunction parseHighlightedAttribute(_ref) {\n  var preTag = _ref.preTag,\n    postTag = _ref.postTag,\n    _ref$highlightedValue = _ref.highlightedValue,\n    highlightedValue = _ref$highlightedValue === void 0 ? '' : _ref$highlightedValue;\n  var splitByPreTag = highlightedValue.split(preTag);\n  var firstValue = splitByPreTag.shift();\n  var elements = firstValue === '' ? [] : [{\n    value: firstValue,\n    isHighlighted: false\n  }];\n  if (postTag === preTag) {\n    var isHighlighted = true;\n    splitByPreTag.forEach(function (split) {\n      elements.push({\n        value: split,\n        isHighlighted: isHighlighted\n      });\n      isHighlighted = !isHighlighted;\n    });\n  } else {\n    splitByPreTag.forEach(function (split) {\n      var splitByPostTag = split.split(postTag);\n      elements.push({\n        value: splitByPostTag[0],\n        isHighlighted: true\n      });\n      if (splitByPostTag[1] !== '') {\n        elements.push({\n          value: splitByPostTag[1],\n          isHighlighted: false\n        });\n      }\n    });\n  }\n  return elements;\n}\n\n/**\n * Find an highlighted attribute given an `attribute` and an `highlightProperty`, parses it,\n * and provided an array of objects with the string value and a boolean if this\n * value is highlighted.\n *\n * In order to use this feature, highlight must be activated in the configuration of\n * the index. The `preTag` and `postTag` attributes are respectively highlightPreTag and\n * highlightPostTag in Algolia configuration.\n *\n * @param {string} preTag - string used to identify the start of an highlighted value\n * @param {string} postTag - string used to identify the end of an highlighted value\n * @param {string} highlightProperty - the property that contains the highlight structure in the results\n * @param {string} attribute - the highlighted attribute to look for\n * @param {object} hit - the actual hit returned by Algolia.\n * @return {object[]} - An array of {value: string, isHighlighted: boolean}.\n */\nexport function parseAlgoliaHit(_ref2) {\n  var _ref2$preTag = _ref2.preTag,\n    preTag = _ref2$preTag === void 0 ? '<em>' : _ref2$preTag,\n    _ref2$postTag = _ref2.postTag,\n    postTag = _ref2$postTag === void 0 ? '</em>' : _ref2$postTag,\n    highlightProperty = _ref2.highlightProperty,\n    attribute = _ref2.attribute,\n    hit = _ref2.hit;\n  if (!hit) throw new Error('`hit`, the matching record, must be provided');\n  var highlightObject = getPropertyByPath(hit[highlightProperty], attribute) || {};\n  if (Array.isArray(highlightObject)) {\n    return highlightObject.map(function (item) {\n      return parseHighlightedAttribute({\n        preTag: preTag,\n        postTag: postTag,\n        highlightedValue: item.value\n      });\n    });\n  }\n  return parseHighlightedAttribute({\n    preTag: preTag,\n    postTag: postTag,\n    highlightedValue: highlightObject.value\n  });\n}","var _excluded = [\"resultsFacetValues\"],\n  _excluded2 = [\"resultsFacetValues\"],\n  _excluded3 = [\"resultsFacetValues\"];\nfunction _typeof(obj) { \"@babel/helpers - typeof\"; return _typeof = \"function\" == typeof Symbol && \"symbol\" == typeof Symbol.iterator ? function (obj) { return typeof obj; } : function (obj) { return obj && \"function\" == typeof Symbol && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }, _typeof(obj); }\nfunction _objectWithoutProperties(source, excluded) { if (source == null) return {}; var target = _objectWithoutPropertiesLoose(source, excluded); var key, i; if (Object.getOwnPropertySymbols) { var sourceSymbolKeys = Object.getOwnPropertySymbols(source); for (i = 0; i < sourceSymbolKeys.length; i++) { key = sourceSymbolKeys[i]; if (excluded.indexOf(key) >= 0) continue; if (!Object.prototype.propertyIsEnumerable.call(source, key)) continue; target[key] = source[key]; } } return target; }\nfunction _objectWithoutPropertiesLoose(source, excluded) { if (source == null) return {}; var target = {}; var sourceKeys = Object.keys(source); var key, i; for (i = 0; i < sourceKeys.length; i++) { key = sourceKeys[i]; if (excluded.indexOf(key) >= 0) continue; target[key] = source[key]; } return target; }\nfunction ownKeys(object, enumerableOnly) { var keys = Object.keys(object); if (Object.getOwnPropertySymbols) { var symbols = Object.getOwnPropertySymbols(object); enumerableOnly && (symbols = symbols.filter(function (sym) { return Object.getOwnPropertyDescriptor(object, sym).enumerable; })), keys.push.apply(keys, symbols); } return keys; }\nfunction _objectSpread(target) { for (var i = 1; i < arguments.length; i++) { var source = null != arguments[i] ? arguments[i] : {}; i % 2 ? ownKeys(Object(source), !0).forEach(function (key) { _defineProperty(target, key, source[key]); }) : Object.getOwnPropertyDescriptors ? Object.defineProperties(target, Object.getOwnPropertyDescriptors(source)) : ownKeys(Object(source)).forEach(function (key) { Object.defineProperty(target, key, Object.getOwnPropertyDescriptor(source, key)); }); } return target; }\nfunction _defineProperty(obj, key, value) { key = _toPropertyKey(key); if (key in obj) { Object.defineProperty(obj, key, { value: value, enumerable: true, configurable: true, writable: true }); } else { obj[key] = value; } return obj; }\nfunction _toPropertyKey(arg) { var key = _toPrimitive(arg, \"string\"); return _typeof(key) === \"symbol\" ? key : String(key); }\nfunction _toPrimitive(input, hint) { if (_typeof(input) !== \"object\" || input === null) return input; var prim = input[Symbol.toPrimitive]; if (prim !== undefined) { var res = prim.call(input, hint || \"default\"); if (_typeof(res) !== \"object\") return res; throw new TypeError(\"@@toPrimitive must return a primitive value.\"); } return (hint === \"string\" ? String : Number)(input); }\nimport algoliasearchHelper from 'algoliasearch-helper';\nimport { version as ReactVersion } from 'react';\nimport createStore from \"./createStore.js\";\nimport createWidgetsManager from \"./createWidgetsManager.js\";\nimport { HIGHLIGHT_TAGS } from \"./highlight.js\";\nimport { hasMultipleIndices } from \"./indexUtils.js\";\nimport version from \"./version.js\";\nfunction addAlgoliaAgents(searchClient) {\n  if (typeof searchClient.addAlgoliaAgent === 'function') {\n    searchClient.addAlgoliaAgent(\"react (\".concat(ReactVersion, \")\"));\n    searchClient.addAlgoliaAgent(\"react-instantsearch (\".concat(version, \")\"));\n  }\n}\nvar isMultiIndexContext = function isMultiIndexContext(widget) {\n  return hasMultipleIndices({\n    ais: widget.props.contextValue,\n    multiIndexContext: widget.props.indexContextValue\n  });\n};\nvar isTargetedIndexEqualIndex = function isTargetedIndexEqualIndex(widget, indexId) {\n  return widget.props.indexContextValue.targetedIndex === indexId;\n};\n\n// Relying on the `indexId` is a bit brittle to detect the `Index` widget.\n// Since it's a class we could rely on `instanceof` or similar. We never\n// had an issue though. Works for now.\nvar isIndexWidget = function isIndexWidget(widget) {\n  return Boolean(widget.props.indexId);\n};\nvar isIndexWidgetEqualIndex = function isIndexWidgetEqualIndex(widget, indexId) {\n  return widget.props.indexId === indexId;\n};\nvar sortIndexWidgetsFirst = function sortIndexWidgetsFirst(firstWidget, secondWidget) {\n  var isFirstWidgetIndex = isIndexWidget(firstWidget);\n  var isSecondWidgetIndex = isIndexWidget(secondWidget);\n  if (isFirstWidgetIndex && !isSecondWidgetIndex) {\n    return -1;\n  }\n  if (!isFirstWidgetIndex && isSecondWidgetIndex) {\n    return 1;\n  }\n  return 0;\n};\n\n// This function is copied from the algoliasearch v4 API Client. If modified,\n// consider updating it also in `serializeQueryParameters` from `@algolia/transporter`.\nfunction serializeQueryParameters(parameters) {\n  var isObjectOrArray = function isObjectOrArray(value) {\n    return Object.prototype.toString.call(value) === '[object Object]' || Object.prototype.toString.call(value) === '[object Array]';\n  };\n  var encode = function encode(format) {\n    for (var _len = arguments.length, args = new Array(_len > 1 ? _len - 1 : 0), _key = 1; _key < _len; _key++) {\n      args[_key - 1] = arguments[_key];\n    }\n    var i = 0;\n    return format.replace(/%s/g, function () {\n      return encodeURIComponent(args[i++]);\n    });\n  };\n  return Object.keys(parameters).map(function (key) {\n    return encode('%s=%s', key, isObjectOrArray(parameters[key]) ? JSON.stringify(parameters[key]) : parameters[key]);\n  }).join('&');\n}\n\n/**\n * Creates a new instance of the InstantSearchManager which controls the widgets and\n * trigger the search when the widgets are updated.\n * @param {string} indexName - the main index name\n * @param {object} initialState - initial widget state\n * @param {object} SearchParameters - optional additional parameters to send to the algolia API\n * @param {number} stalledSearchDelay - time (in ms) after the search is stalled\n * @return {InstantSearchManager} a new instance of InstantSearchManager\n */\nexport default function createInstantSearchManager(_ref) {\n  var indexName = _ref.indexName,\n    _ref$initialState = _ref.initialState,\n    initialState = _ref$initialState === void 0 ? {} : _ref$initialState,\n    searchClient = _ref.searchClient,\n    resultsState = _ref.resultsState,\n    stalledSearchDelay = _ref.stalledSearchDelay;\n  var helper = algoliasearchHelper(searchClient, indexName, _objectSpread({}, HIGHLIGHT_TAGS));\n  addAlgoliaAgents(searchClient);\n  helper.on('search', handleNewSearch).on('result', handleSearchSuccess({\n    indexId: indexName\n  })).on('error', handleSearchError);\n  var skip = false;\n  var stalledSearchTimer = null;\n  var initialSearchParameters = helper.state;\n  var searchCounter;\n  var widgetsManager = createWidgetsManager(onWidgetsUpdate);\n  hydrateSearchClient(searchClient, resultsState);\n  var store = createStore({\n    widgets: initialState,\n    metadata: hydrateMetadata(resultsState),\n    results: hydrateResultsState(resultsState),\n    error: null,\n    searching: false,\n    isSearchStalled: true,\n    searchingForFacetValues: false\n  });\n  function skipSearch() {\n    skip = true;\n  }\n  function updateClient(client) {\n    addAlgoliaAgents(client);\n    helper.setClient(client);\n    search();\n  }\n  function clearCache() {\n    helper.clearCache();\n    search();\n  }\n  function getMetadata(state) {\n    return widgetsManager.getWidgets().filter(function (widget) {\n      return Boolean(widget.getMetadata);\n    }).map(function (widget) {\n      return widget.getMetadata(state);\n    });\n  }\n  function getSearchParameters() {\n    var sharedParameters = widgetsManager.getWidgets().filter(function (widget) {\n      return Boolean(widget.getSearchParameters);\n    }).filter(function (widget) {\n      return !isMultiIndexContext(widget) && !isIndexWidget(widget);\n    }).reduce(function (res, widget) {\n      return widget.getSearchParameters(res);\n    }, initialSearchParameters);\n    var mainParameters = widgetsManager.getWidgets().filter(function (widget) {\n      return Boolean(widget.getSearchParameters);\n    }).filter(function (widget) {\n      var targetedIndexEqualMainIndex = isMultiIndexContext(widget) && isTargetedIndexEqualIndex(widget, indexName);\n      var subIndexEqualMainIndex = isIndexWidget(widget) && isIndexWidgetEqualIndex(widget, indexName);\n      return targetedIndexEqualMainIndex || subIndexEqualMainIndex;\n    })\n    // We have to sort the `Index` widgets first so the `index` parameter\n    // is correctly set in the `reduce` function for the following widgets\n    .sort(sortIndexWidgetsFirst).reduce(function (res, widget) {\n      return widget.getSearchParameters(res);\n    }, sharedParameters);\n    var derivedIndices = widgetsManager.getWidgets().filter(function (widget) {\n      return Boolean(widget.getSearchParameters);\n    }).filter(function (widget) {\n      var targetedIndexNotEqualMainIndex = isMultiIndexContext(widget) && !isTargetedIndexEqualIndex(widget, indexName);\n      var subIndexNotEqualMainIndex = isIndexWidget(widget) && !isIndexWidgetEqualIndex(widget, indexName);\n      return targetedIndexNotEqualMainIndex || subIndexNotEqualMainIndex;\n    })\n    // We have to sort the `Index` widgets first so the `index` parameter\n    // is correctly set in the `reduce` function for the following widgets\n    .sort(sortIndexWidgetsFirst).reduce(function (indices, widget) {\n      var indexId = isMultiIndexContext(widget) ? widget.props.indexContextValue.targetedIndex : widget.props.indexId;\n      var widgets = indices[indexId] || [];\n      return _objectSpread(_objectSpread({}, indices), {}, _defineProperty({}, indexId, widgets.concat(widget)));\n    }, {});\n    var derivedParameters = Object.keys(derivedIndices).map(function (indexId) {\n      return {\n        parameters: derivedIndices[indexId].reduce(function (res, widget) {\n          return widget.getSearchParameters(res);\n        }, sharedParameters),\n        indexId: indexId\n      };\n    });\n    return {\n      mainParameters: mainParameters,\n      derivedParameters: derivedParameters\n    };\n  }\n  function search() {\n    if (!skip) {\n      var _getSearchParameters = getSearchParameters(helper.state),\n        mainParameters = _getSearchParameters.mainParameters,\n        derivedParameters = _getSearchParameters.derivedParameters;\n      searchCounter = derivedParameters.length + 1;\n\n      // We have to call `slice` because the method `detach` on the derived\n      // helpers mutates the value `derivedHelpers`. The `forEach` loop does\n      // not iterate on each value and we're not able to correctly clear the\n      // previous derived helpers (memory leak + useless requests).\n      helper.derivedHelpers.slice().forEach(function (derivedHelper) {\n        // Since we detach the derived helpers on **every** new search they\n        // won't receive intermediate results in case of a stalled search.\n        // Only the last result is dispatched by the derived helper because\n        // they are not detached yet:\n        //\n        // - a -> main helper receives results\n        // - ap -> main helper receives results\n        // - app -> main helper + derived helpers receive results\n        //\n        // The quick fix is to avoid to detach them on search but only once they\n        // received the results. But it means that in case of a stalled search\n        // all the derived helpers not detached yet register a new search inside\n        // the helper. The number grows fast in case of a bad network and it's\n        // not deterministic.\n        derivedHelper.detach();\n      });\n      derivedParameters.forEach(function (_ref2) {\n        var indexId = _ref2.indexId,\n          parameters = _ref2.parameters;\n        var derivedHelper = helper.derive(function () {\n          return parameters;\n        });\n        derivedHelper.on('result', handleSearchSuccess({\n          indexId: indexId\n        })).on('error', handleSearchError);\n      });\n      helper.setState(mainParameters);\n      helper.search();\n    }\n  }\n  function handleSearchSuccess(_ref3) {\n    var indexId = _ref3.indexId;\n    return function (event) {\n      searchCounter--;\n      var state = store.getState();\n      var isDerivedHelpersEmpty = !helper.derivedHelpers.length;\n      var results = state.results ? state.results : {};\n\n      // Switching from mono index to multi index and vice versa must reset the\n      // results to an empty object, otherwise we keep reference of stalled and\n      // unused results.\n      results = !isDerivedHelpersEmpty && results.getFacetByName ? {} : results;\n      if (!isDerivedHelpersEmpty) {\n        results = _objectSpread(_objectSpread({}, results), {}, _defineProperty({}, indexId, event.results));\n      } else {\n        results = event.results;\n      }\n      var currentState = store.getState();\n      var nextIsSearchStalled = currentState.isSearchStalled;\n      if (!helper.hasPendingRequests()) {\n        clearTimeout(stalledSearchTimer);\n        stalledSearchTimer = null;\n        nextIsSearchStalled = false;\n      }\n      var resultsFacetValues = currentState.resultsFacetValues,\n        partialState = _objectWithoutProperties(currentState, _excluded);\n      store.setState(_objectSpread(_objectSpread({}, partialState), {}, {\n        results: results,\n        isSearchStalled: nextIsSearchStalled,\n        searching: searchCounter > 0,\n        error: null\n      }));\n    };\n  }\n  function handleSearchError(_ref4) {\n    var error = _ref4.error;\n    var currentState = store.getState();\n    var nextIsSearchStalled = currentState.isSearchStalled;\n    if (!helper.hasPendingRequests()) {\n      clearTimeout(stalledSearchTimer);\n      nextIsSearchStalled = false;\n    }\n    var resultsFacetValues = currentState.resultsFacetValues,\n      partialState = _objectWithoutProperties(currentState, _excluded2);\n    store.setState(_objectSpread(_objectSpread({}, partialState), {}, {\n      isSearchStalled: nextIsSearchStalled,\n      error: error,\n      searching: false\n    }));\n  }\n  function handleNewSearch() {\n    if (!stalledSearchTimer) {\n      stalledSearchTimer = setTimeout(function () {\n        var _store$getState = store.getState(),\n          resultsFacetValues = _store$getState.resultsFacetValues,\n          partialState = _objectWithoutProperties(_store$getState, _excluded3);\n        store.setState(_objectSpread(_objectSpread({}, partialState), {}, {\n          isSearchStalled: true\n        }));\n      }, stalledSearchDelay);\n    }\n  }\n  function hydrateSearchClient(client, results) {\n    if (!results) {\n      return;\n    }\n\n    // Disable cache hydration on:\n    // - Algoliasearch API Client < v4 with cache disabled\n    // - Third party clients (detected by the `addAlgoliaAgent` function missing)\n\n    if ((!client.transporter || client._cacheHydrated) && (!client._useCache || typeof client.addAlgoliaAgent !== 'function')) {\n      return;\n    }\n\n    // Algoliasearch API Client >= v4\n    // To hydrate the client we need to populate the cache with the data from\n    // the server (done in `hydrateSearchClientWithMultiIndexRequest` or\n    // `hydrateSearchClientWithSingleIndexRequest`). But since there is no way\n    // for us to compute the key the same way as `algoliasearch-client` we need\n    // to populate it on a custom key and override the `search` method to\n    // search on it first.\n    if (client.transporter && !client._cacheHydrated) {\n      client._cacheHydrated = true;\n      var baseMethod = client.search;\n      client.search = function (requests) {\n        for (var _len2 = arguments.length, methodArgs = new Array(_len2 > 1 ? _len2 - 1 : 0), _key2 = 1; _key2 < _len2; _key2++) {\n          methodArgs[_key2 - 1] = arguments[_key2];\n        }\n        var requestsWithSerializedParams = requests.map(function (request) {\n          return _objectSpread(_objectSpread({}, request), {}, {\n            params: serializeQueryParameters(request.params)\n          });\n        });\n        return client.transporter.responsesCache.get({\n          method: 'search',\n          args: [requestsWithSerializedParams].concat(methodArgs)\n        }, function () {\n          return baseMethod.apply(void 0, [requests].concat(methodArgs));\n        });\n      };\n    }\n    if (Array.isArray(results.results)) {\n      hydrateSearchClientWithMultiIndexRequest(client, results.results);\n      return;\n    }\n    hydrateSearchClientWithSingleIndexRequest(client, results);\n  }\n  function hydrateSearchClientWithMultiIndexRequest(client, results) {\n    // Algoliasearch API Client >= v4\n    // Populate the cache with the data from the server\n    if (client.transporter) {\n      client.transporter.responsesCache.set({\n        method: 'search',\n        args: [results.reduce(function (acc, result) {\n          return acc.concat(result.rawResults.map(function (request) {\n            return {\n              indexName: request.index,\n              params: request.params\n            };\n          }));\n        }, [])]\n      }, {\n        results: results.reduce(function (acc, result) {\n          return acc.concat(result.rawResults);\n        }, [])\n      });\n      return;\n    }\n\n    // Algoliasearch API Client < v4\n    // Prior to client v4 we didn't have a proper API to hydrate the client\n    // cache from the outside. The following code populates the cache with\n    // a single-index result. You can find more information about the\n    // computation of the key inside the client (see link below).\n    // https://github.com/algolia/algoliasearch-client-javascript/blob/c27e89ff92b2a854ae6f40dc524bffe0f0cbc169/src/AlgoliaSearchCore.js#L232-L240\n    var key = \"/1/indexes/*/queries_body_\".concat(JSON.stringify({\n      requests: results.reduce(function (acc, result) {\n        return acc.concat(result.rawResults.map(function (request) {\n          return {\n            indexName: request.index,\n            params: request.params\n          };\n        }));\n      }, [])\n    }));\n    client.cache = _objectSpread(_objectSpread({}, client.cache), {}, _defineProperty({}, key, JSON.stringify({\n      results: results.reduce(function (acc, result) {\n        return acc.concat(result.rawResults);\n      }, [])\n    })));\n  }\n  function hydrateSearchClientWithSingleIndexRequest(client, results) {\n    // Algoliasearch API Client >= v4\n    // Populate the cache with the data from the server\n    if (client.transporter) {\n      client.transporter.responsesCache.set({\n        method: 'search',\n        args: [results.rawResults.map(function (request) {\n          return {\n            indexName: request.index,\n            params: request.params\n          };\n        })]\n      }, {\n        results: results.rawResults\n      });\n      return;\n    }\n    // Algoliasearch API Client < v4\n    // Prior to client v4 we didn't have a proper API to hydrate the client\n    // cache from the outside. The following code populates the cache with\n    // a single-index result. You can find more information about the\n    // computation of the key inside the client (see link below).\n    // https://github.com/algolia/algoliasearch-client-javascript/blob/c27e89ff92b2a854ae6f40dc524bffe0f0cbc169/src/AlgoliaSearchCore.js#L232-L240\n    var key = \"/1/indexes/*/queries_body_\".concat(JSON.stringify({\n      requests: results.rawResults.map(function (request) {\n        return {\n          indexName: request.index,\n          params: request.params\n        };\n      })\n    }));\n    client.cache = _objectSpread(_objectSpread({}, client.cache), {}, _defineProperty({}, key, JSON.stringify({\n      results: results.rawResults\n    })));\n  }\n  function hydrateResultsState(results) {\n    if (!results) {\n      return null;\n    }\n    if (Array.isArray(results.results)) {\n      return results.results.reduce(function (acc, result) {\n        return _objectSpread(_objectSpread({}, acc), {}, _defineProperty({}, result._internalIndexId, new algoliasearchHelper.SearchResults(new algoliasearchHelper.SearchParameters(result.state), result.rawResults)));\n      }, {});\n    }\n    return new algoliasearchHelper.SearchResults(new algoliasearchHelper.SearchParameters(results.state), results.rawResults);\n  }\n\n  // Called whenever a widget has been rendered with new props.\n  function onWidgetsUpdate() {\n    var metadata = getMetadata(store.getState().widgets);\n    store.setState(_objectSpread(_objectSpread({}, store.getState()), {}, {\n      metadata: metadata,\n      searching: true\n    }));\n\n    // Since the `getSearchParameters` method of widgets also depends on props,\n    // the result search parameters might have changed.\n    search();\n  }\n  function transitionState(nextSearchState) {\n    var searchState = store.getState().widgets;\n    return widgetsManager.getWidgets().filter(function (widget) {\n      return Boolean(widget.transitionState);\n    }).reduce(function (res, widget) {\n      return widget.transitionState(searchState, res);\n    }, nextSearchState);\n  }\n  function onExternalStateUpdate(nextSearchState) {\n    var metadata = getMetadata(nextSearchState);\n    store.setState(_objectSpread(_objectSpread({}, store.getState()), {}, {\n      widgets: nextSearchState,\n      metadata: metadata,\n      searching: true\n    }));\n    search();\n  }\n  function onSearchForFacetValues(_ref5) {\n    var facetName = _ref5.facetName,\n      query = _ref5.query,\n      _ref5$maxFacetHits = _ref5.maxFacetHits,\n      maxFacetHits = _ref5$maxFacetHits === void 0 ? 10 : _ref5$maxFacetHits;\n    // The values 1, 100 are the min / max values that the engine accepts.\n    // see: https://www.algolia.com/doc/api-reference/api-parameters/maxFacetHits\n    var maxFacetHitsWithinRange = Math.max(1, Math.min(maxFacetHits, 100));\n    store.setState(_objectSpread(_objectSpread({}, store.getState()), {}, {\n      searchingForFacetValues: true\n    }));\n    helper.searchForFacetValues(facetName, query, maxFacetHitsWithinRange).then(function (content) {\n      var _objectSpread7;\n      store.setState(_objectSpread(_objectSpread({}, store.getState()), {}, {\n        error: null,\n        searchingForFacetValues: false,\n        resultsFacetValues: _objectSpread(_objectSpread({}, store.getState().resultsFacetValues), {}, (_objectSpread7 = {}, _defineProperty(_objectSpread7, facetName, content.facetHits), _defineProperty(_objectSpread7, \"query\", query), _objectSpread7))\n      }));\n    }, function (error) {\n      store.setState(_objectSpread(_objectSpread({}, store.getState()), {}, {\n        searchingForFacetValues: false,\n        error: error\n      }));\n    }).catch(function (error) {\n      // Since setState is synchronous, any error that occurs in the render of a\n      // component will be swallowed by this promise.\n      // This is a trick to make the error show up correctly in the console.\n      // See http://stackoverflow.com/a/30741722/969302\n      setTimeout(function () {\n        throw error;\n      });\n    });\n  }\n  function updateIndex(newIndex) {\n    initialSearchParameters = initialSearchParameters.setIndex(newIndex);\n    // No need to trigger a new search here as the widgets will also update and trigger it if needed.\n  }\n\n  function getWidgetsIds() {\n    return store.getState().metadata.reduce(function (res, meta) {\n      return typeof meta.id !== 'undefined' ? res.concat(meta.id) : res;\n    }, []);\n  }\n  return {\n    store: store,\n    widgetsManager: widgetsManager,\n    getWidgetsIds: getWidgetsIds,\n    getSearchParameters: getSearchParameters,\n    onSearchForFacetValues: onSearchForFacetValues,\n    onExternalStateUpdate: onExternalStateUpdate,\n    transitionState: transitionState,\n    updateClient: updateClient,\n    updateIndex: updateIndex,\n    clearCache: clearCache,\n    skipSearch: skipSearch\n  };\n}\nfunction hydrateMetadata(resultsState) {\n  if (!resultsState) {\n    return [];\n  }\n\n  // add a value noop, which gets replaced once the widgets are mounted\n  return resultsState.metadata.map(function (datum) {\n    return _objectSpread(_objectSpread({\n      value: function value() {\n        return {};\n      }\n    }, datum), {}, {\n      items: datum.items && datum.items.map(function (item) {\n        return _objectSpread(_objectSpread({\n          value: function value() {\n            return {};\n          }\n        }, item), {}, {\n          items: item.items && item.items.map(function (nestedItem) {\n            return _objectSpread({\n              value: function value() {\n                return {};\n              }\n            }, nestedItem);\n          })\n        });\n      })\n    });\n  });\n}","export default '6.40.4';","import { defer } from \"./utils.js\";\nexport default function createWidgetsManager(onWidgetsUpdate) {\n  var widgets = [];\n  // Is an update scheduled?\n  var scheduled = false;\n\n  // The state manager's updates need to be batched since more than one\n  // component can register or unregister widgets during the same tick.\n  function scheduleUpdate() {\n    if (scheduled) {\n      return;\n    }\n    scheduled = true;\n    defer(function () {\n      scheduled = false;\n      onWidgetsUpdate();\n    });\n  }\n  return {\n    registerWidget: function registerWidget(widget) {\n      widgets.push(widget);\n      scheduleUpdate();\n      return function unregisterWidget() {\n        widgets.splice(widgets.indexOf(widget), 1);\n        scheduleUpdate();\n      };\n    },\n    update: scheduleUpdate,\n    getWidgets: function getWidgets() {\n      return widgets;\n    }\n  };\n}","export default function createStore(initialState) {\n  var state = initialState;\n  var listeners = [];\n  return {\n    getState: function getState() {\n      return state;\n    },\n    setState: function setState(nextState) {\n      state = nextState;\n      listeners.forEach(function (listener) {\n        return listener();\n      });\n    },\n    subscribe: function subscribe(listener) {\n      listeners.push(listener);\n      return function unsubscribe() {\n        listeners.splice(listeners.indexOf(listener), 1);\n      };\n    }\n  };\n}","function _typeof(obj) { \"@babel/helpers - typeof\"; return _typeof = \"function\" == typeof Symbol && \"symbol\" == typeof Symbol.iterator ? function (obj) { return typeof obj; } : function (obj) { return obj && \"function\" == typeof Symbol && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }, _typeof(obj); }\nexport function isMetadataEnabled() {\n  return (typeof window === \"undefined\" ? \"undefined\" : _typeof(window)) === 'object' && _typeof(window.navigator) === 'object' && typeof window.navigator.userAgent === 'string' && window.navigator.userAgent.includes('Algolia Crawler') && _typeof(window.document) === 'object';\n}\nexport function getMetadataPayload(widgets, searchClient) {\n  var internalProps = ['contextValue', 'indexContextValue'];\n  var widgetsPayload = widgets.map(function (_ref) {\n    var props = _ref.props,\n      constructor = _ref.constructor;\n    var _ref2 = constructor._connectorDesc || {},\n      _ref2$defaultProps = _ref2.defaultProps,\n      defaultProps = _ref2$defaultProps === void 0 ? {} : _ref2$defaultProps,\n      _ref2$displayName = _ref2.displayName,\n      displayName = _ref2$displayName === void 0 ? constructor.displayName : _ref2$displayName;\n    return {\n      displayName: displayName,\n      $$type: constructor.$$type,\n      $$widgetType: constructor.$$widgetType,\n      params: Object.keys(props).filter(function (prop) {\n        return !internalProps.includes(prop) && defaultProps[prop] !== props[prop] && props[prop] !== undefined;\n      })\n    };\n  });\n  var client = searchClient;\n  var ua = client.transporter && client.transporter.userAgent ? client.transporter.userAgent.value : client._ua;\n  return {\n    ua: ua,\n    widgets: widgetsPayload\n  };\n}\nexport function injectMetadata(widgets, searchClient) {\n  var payloadContainer = document.createElement('meta');\n  var refNode = document.querySelector('head');\n  payloadContainer.name = 'algolia:metadata';\n  var payload = getMetadataPayload(widgets, searchClient);\n  payloadContainer.content = JSON.stringify(payload);\n  refNode.appendChild(payloadContainer);\n}","function _typeof(obj) { \"@babel/helpers - typeof\"; return _typeof = \"function\" == typeof Symbol && \"symbol\" == typeof Symbol.iterator ? function (obj) { return typeof obj; } : function (obj) { return obj && \"function\" == typeof Symbol && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }, _typeof(obj); }\nfunction ownKeys(object, enumerableOnly) { var keys = Object.keys(object); if (Object.getOwnPropertySymbols) { var symbols = Object.getOwnPropertySymbols(object); enumerableOnly && (symbols = symbols.filter(function (sym) { return Object.getOwnPropertyDescriptor(object, sym).enumerable; })), keys.push.apply(keys, symbols); } return keys; }\nfunction _objectSpread(target) { for (var i = 1; i < arguments.length; i++) { var source = null != arguments[i] ? arguments[i] : {}; i % 2 ? ownKeys(Object(source), !0).forEach(function (key) { _defineProperty(target, key, source[key]); }) : Object.getOwnPropertyDescriptors ? Object.defineProperties(target, Object.getOwnPropertyDescriptors(source)) : ownKeys(Object(source)).forEach(function (key) { Object.defineProperty(target, key, Object.getOwnPropertyDescriptor(source, key)); }); } return target; }\nfunction _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError(\"Cannot call a class as a function\"); } }\nfunction _defineProperties(target, props) { for (var i = 0; i < props.length; i++) { var descriptor = props[i]; descriptor.enumerable = descriptor.enumerable || false; descriptor.configurable = true; if (\"value\" in descriptor) descriptor.writable = true; Object.defineProperty(target, _toPropertyKey(descriptor.key), descriptor); } }\nfunction _createClass(Constructor, protoProps, staticProps) { if (protoProps) _defineProperties(Constructor.prototype, protoProps); if (staticProps) _defineProperties(Constructor, staticProps); Object.defineProperty(Constructor, \"prototype\", { writable: false }); return Constructor; }\nfunction _inherits(subClass, superClass) { if (typeof superClass !== \"function\" && superClass !== null) { throw new TypeError(\"Super expression must either be null or a function\"); } subClass.prototype = Object.create(superClass && superClass.prototype, { constructor: { value: subClass, writable: true, configurable: true } }); Object.defineProperty(subClass, \"prototype\", { writable: false }); if (superClass) _setPrototypeOf(subClass, superClass); }\nfunction _setPrototypeOf(o, p) { _setPrototypeOf = Object.setPrototypeOf ? Object.setPrototypeOf.bind() : function _setPrototypeOf(o, p) { o.__proto__ = p; return o; }; return _setPrototypeOf(o, p); }\nfunction _createSuper(Derived) { var hasNativeReflectConstruct = _isNativeReflectConstruct(); return function _createSuperInternal() { var Super = _getPrototypeOf(Derived), result; if (hasNativeReflectConstruct) { var NewTarget = _getPrototypeOf(this).constructor; result = Reflect.construct(Super, arguments, NewTarget); } else { result = Super.apply(this, arguments); } return _possibleConstructorReturn(this, result); }; }\nfunction _possibleConstructorReturn(self, call) { if (call && (_typeof(call) === \"object\" || typeof call === \"function\")) { return call; } else if (call !== void 0) { throw new TypeError(\"Derived constructors may only return object or undefined\"); } return _assertThisInitialized(self); }\nfunction _assertThisInitialized(self) { if (self === void 0) { throw new ReferenceError(\"this hasn't been initialised - super() hasn't been called\"); } return self; }\nfunction _isNativeReflectConstruct() { if (typeof Reflect === \"undefined\" || !Reflect.construct) return false; if (Reflect.construct.sham) return false; if (typeof Proxy === \"function\") return true; try { Boolean.prototype.valueOf.call(Reflect.construct(Boolean, [], function () {})); return true; } catch (e) { return false; } }\nfunction _getPrototypeOf(o) { _getPrototypeOf = Object.setPrototypeOf ? Object.getPrototypeOf.bind() : function _getPrototypeOf(o) { return o.__proto__ || Object.getPrototypeOf(o); }; return _getPrototypeOf(o); }\nfunction _defineProperty(obj, key, value) { key = _toPropertyKey(key); if (key in obj) { Object.defineProperty(obj, key, { value: value, enumerable: true, configurable: true, writable: true }); } else { obj[key] = value; } return obj; }\nfunction _toPropertyKey(arg) { var key = _toPrimitive(arg, \"string\"); return _typeof(key) === \"symbol\" ? key : String(key); }\nfunction _toPrimitive(input, hint) { if (_typeof(input) !== \"object\" || input === null) return input; var prim = input[Symbol.toPrimitive]; if (prim !== undefined) { var res = prim.call(input, hint || \"default\"); if (_typeof(res) !== \"object\") return res; throw new TypeError(\"@@toPrimitive must return a primitive value.\"); } return (hint === \"string\" ? String : Number)(input); }\nimport PropTypes from 'prop-types';\nimport React, { Component, Children } from 'react';\nimport isEqual from 'react-fast-compare';\nimport { InstantSearchProvider } from \"../core/context.js\";\nimport createInstantSearchManager from \"../core/createInstantSearchManager.js\";\nimport { isMetadataEnabled, injectMetadata } from \"../core/metadata.js\";\nfunction isControlled(props) {\n  return Boolean(props.searchState);\n}\n\n/**\n * @description\n * `<InstantSearch>` is the root component of all React InstantSearch implementations.\n * It provides all the connected components (aka widgets) a means to interact\n * with the searchState.\n * @kind widget\n * @name <InstantSearch>\n * @requirements You will need to have an Algolia account to be able to use this widget.\n * [Create one now](https://www.algolia.com/users/sign_up).\n * @propType {string} indexName - Main index in which to search.\n * @propType {boolean} [refresh=false] - Flag to activate when the cache needs to be cleared so that the front-end is updated when a change occurs in the index.\n * @propType {object} [searchClient] - Provide a custom search client.\n * @propType {func} [onSearchStateChange] - Function to be called everytime a new search is done. Useful for [URL Routing](guide/Routing.html).\n * @propType {object} [searchState] - Object to inject some search state. Switches the InstantSearch component in controlled mode. Useful for [URL Routing](guide/Routing.html).\n * @propType {func} [createURL] - Function to call when creating links, useful for [URL Routing](guide/Routing.html).\n * @propType {SearchResults|SearchResults[]} [resultsState] - Use this to inject the results that will be used at first rendering. Those results are found by using the `findResultsState` function. Useful for [Server Side Rendering](guide/Server-side_rendering.html).\n * @propType {number} [stalledSearchDelay=200] - The amount of time before considering that the search takes too much time. The time is expressed in milliseconds.\n * @propType {{ Root: string|function, props: object }} [root] - Use this to customize the root element. Default value: `{ Root: 'div' }`\n * @example\n * import React from 'react';\n * import algoliasearch from 'algoliasearch/lite';\n * import { InstantSearch, SearchBox, Hits } from 'react-instantsearch-dom';\n *\n * const searchClient = algoliasearch(\n *   'latency',\n *   '6be0576ff61c053d5f9a3225e2a90f76'\n * );\n *\n * const App = () => (\n *   <InstantSearch\n *     searchClient={searchClient}\n *     indexName=\"instant_search\"\n *   >\n *     <SearchBox />\n *     <Hits />\n *   </InstantSearch>\n * );\n */\nvar InstantSearch = /*#__PURE__*/function (_Component) {\n  _inherits(InstantSearch, _Component);\n  var _super = _createSuper(InstantSearch);\n  function InstantSearch(props) {\n    var _this;\n    _classCallCheck(this, InstantSearch);\n    _this = _super.call(this, props);\n    _defineProperty(_assertThisInitialized(_this), \"cleanupTimerRef\", null);\n    _defineProperty(_assertThisInitialized(_this), \"isUnmounting\", false);\n    var instantSearchManager = createInstantSearchManager({\n      indexName: _this.props.indexName,\n      searchClient: _this.props.searchClient,\n      initialState: _this.props.searchState || {},\n      resultsState: _this.props.resultsState,\n      stalledSearchDelay: _this.props.stalledSearchDelay\n    });\n    var contextValue = {\n      store: instantSearchManager.store,\n      widgetsManager: instantSearchManager.widgetsManager,\n      mainTargetedIndex: _this.props.indexName,\n      onInternalStateUpdate: _this.onWidgetsInternalStateUpdate.bind(_assertThisInitialized(_this)),\n      createHrefForState: _this.createHrefForState.bind(_assertThisInitialized(_this)),\n      onSearchForFacetValues: _this.onSearchForFacetValues.bind(_assertThisInitialized(_this)),\n      onSearchStateChange: _this.onSearchStateChange.bind(_assertThisInitialized(_this)),\n      onSearchParameters: _this.onSearchParameters.bind(_assertThisInitialized(_this))\n    };\n    _this.state = {\n      isControlled: isControlled(_this.props),\n      instantSearchManager: instantSearchManager,\n      contextValue: contextValue\n    };\n    return _this;\n  }\n  _createClass(InstantSearch, [{\n    key: \"componentDidUpdate\",\n    value: function componentDidUpdate(prevProps) {\n      var prevIsControlled = isControlled(prevProps);\n      if (prevIsControlled && !this.state.isControlled) {\n        throw new Error(\"You can't switch <InstantSearch> from being controlled to uncontrolled\");\n      }\n      if (!prevIsControlled && this.state.isControlled) {\n        throw new Error(\"You can't switch <InstantSearch> from being uncontrolled to controlled\");\n      }\n      if (this.props.refresh !== prevProps.refresh && this.props.refresh) {\n        this.state.instantSearchManager.clearCache();\n      }\n      if (prevProps.indexName !== this.props.indexName) {\n        this.state.instantSearchManager.updateIndex(this.props.indexName);\n      }\n      if (prevProps.searchClient !== this.props.searchClient) {\n        this.state.instantSearchManager.updateClient(this.props.searchClient);\n      }\n    }\n  }, {\n    key: \"componentDidMount\",\n    value: function componentDidMount() {\n      if (this.cleanupTimerRef) {\n        clearTimeout(this.cleanupTimerRef);\n        this.cleanupTimerRef = null;\n      }\n      if (isMetadataEnabled()) {\n        injectMetadata(this.state.instantSearchManager.widgetsManager.getWidgets(), this.props.searchClient);\n      }\n    }\n  }, {\n    key: \"componentWillUnmount\",\n    value: function componentWillUnmount() {\n      var _this2 = this;\n      this.cleanupTimerRef = setTimeout(function () {\n        _this2.isUnmounting = true;\n        _this2.state.instantSearchManager.skipSearch();\n      });\n    }\n  }, {\n    key: \"createHrefForState\",\n    value: function createHrefForState(searchState) {\n      searchState = this.state.instantSearchManager.transitionState(searchState);\n      return this.state.isControlled && this.props.createURL ? this.props.createURL(searchState, this.getKnownKeys()) : '#';\n    }\n  }, {\n    key: \"onWidgetsInternalStateUpdate\",\n    value: function onWidgetsInternalStateUpdate(searchState) {\n      searchState = this.state.instantSearchManager.transitionState(searchState);\n      this.onSearchStateChange(searchState);\n      if (!this.state.isControlled) {\n        this.state.instantSearchManager.onExternalStateUpdate(searchState);\n      }\n    }\n  }, {\n    key: \"onSearchStateChange\",\n    value: function onSearchStateChange(searchState) {\n      if (this.props.onSearchStateChange && !this.isUnmounting) {\n        this.props.onSearchStateChange(searchState);\n      }\n    }\n  }, {\n    key: \"onSearchParameters\",\n    value: function onSearchParameters(getSearchParameters, context, props, getMetadata, displayName) {\n      if (this.props.onSearchParameters) {\n        var _searchState = this.props.searchState ? this.props.searchState : {};\n        this.props.onSearchParameters(getSearchParameters, context, props, _searchState);\n      }\n      if (this.props.widgetsCollector) {\n        var _searchState2 = this.props.searchState ? this.props.searchState : {};\n        this.props.widgetsCollector({\n          getSearchParameters: getSearchParameters,\n          getMetadata: getMetadata,\n          context: context,\n          props: props,\n          searchState: _searchState2,\n          displayName: displayName\n        });\n      }\n    }\n  }, {\n    key: \"onSearchForFacetValues\",\n    value: function onSearchForFacetValues(searchState) {\n      this.state.instantSearchManager.onSearchForFacetValues(searchState);\n    }\n  }, {\n    key: \"getKnownKeys\",\n    value: function getKnownKeys() {\n      return this.state.instantSearchManager.getWidgetsIds();\n    }\n  }, {\n    key: \"render\",\n    value: function render() {\n      if (Children.count(this.props.children) === 0) {\n        return null;\n      }\n      return /*#__PURE__*/React.createElement(InstantSearchProvider, {\n        value: this.state.contextValue\n      }, this.props.children);\n    }\n  }], [{\n    key: \"getDerivedStateFromProps\",\n    value: function getDerivedStateFromProps(nextProps, prevState) {\n      var nextIsControlled = isControlled(nextProps);\n      var previousSearchState = prevState.instantSearchManager.store.getState().widgets;\n      var nextSearchState = nextProps.searchState;\n      if (nextIsControlled && !isEqual(previousSearchState, nextSearchState)) {\n        prevState.instantSearchManager.onExternalStateUpdate(nextProps.searchState);\n      }\n      return {\n        isControlled: nextIsControlled,\n        contextValue: _objectSpread(_objectSpread({}, prevState.contextValue), {}, {\n          mainTargetedIndex: nextProps.indexName\n        })\n      };\n    }\n  }]);\n  return InstantSearch;\n}(Component);\n_defineProperty(InstantSearch, \"defaultProps\", {\n  stalledSearchDelay: 200,\n  refresh: false\n});\n_defineProperty(InstantSearch, \"propTypes\", {\n  // @TODO: These props are currently constant.\n  indexName: PropTypes.string.isRequired,\n  searchClient: PropTypes.shape({\n    search: PropTypes.func.isRequired,\n    searchForFacetValues: PropTypes.func,\n    addAlgoliaAgent: PropTypes.func,\n    clearCache: PropTypes.func\n  }).isRequired,\n  createURL: PropTypes.func,\n  refresh: PropTypes.bool,\n  searchState: PropTypes.object,\n  onSearchStateChange: PropTypes.func,\n  onSearchParameters: PropTypes.func,\n  widgetsCollector: PropTypes.func,\n  resultsState: PropTypes.oneOfType([PropTypes.object, PropTypes.array]),\n  children: PropTypes.node,\n  stalledSearchDelay: PropTypes.number\n});\nexport default InstantSearch;","function _toConsumableArray(arr) { return _arrayWithoutHoles(arr) || _iterableToArray(arr) || _unsupportedIterableToArray(arr) || _nonIterableSpread(); }\nfunction _nonIterableSpread() { throw new TypeError(\"Invalid attempt to spread non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.\"); }\nfunction _unsupportedIterableToArray(o, minLen) { if (!o) return; if (typeof o === \"string\") return _arrayLikeToArray(o, minLen); var n = Object.prototype.toString.call(o).slice(8, -1); if (n === \"Object\" && o.constructor) n = o.constructor.name; if (n === \"Map\" || n === \"Set\") return Array.from(o); if (n === \"Arguments\" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _arrayLikeToArray(o, minLen); }\nfunction _iterableToArray(iter) { if (typeof Symbol !== \"undefined\" && iter[Symbol.iterator] != null || iter[\"@@iterator\"] != null) return Array.from(iter); }\nfunction _arrayWithoutHoles(arr) { if (Array.isArray(arr)) return _arrayLikeToArray(arr); }\nfunction _arrayLikeToArray(arr, len) { if (len == null || len > arr.length) len = arr.length; for (var i = 0, arr2 = new Array(len); i < len; i++) arr2[i] = arr[i]; return arr2; }\nimport cx from 'classnames';\nexport var createClassNames = function createClassNames(block) {\n  var prefix = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 'ais';\n  return function () {\n    for (var _len = arguments.length, elements = new Array(_len), _key = 0; _key < _len; _key++) {\n      elements[_key] = arguments[_key];\n    }\n    var suitElements = elements.filter(function (element) {\n      return element || element === '';\n    }).map(function (element) {\n      var baseClassName = \"\".concat(prefix, \"-\").concat(block);\n      return element ? \"\".concat(baseClassName, \"-\").concat(element) : baseClassName;\n    });\n    return cx(suitElements);\n  };\n};\nexport var isSpecialClick = function isSpecialClick(event) {\n  var isMiddleClick = event.button === 1;\n  return Boolean(isMiddleClick || event.altKey || event.ctrlKey || event.metaKey || event.shiftKey);\n};\nexport var capitalize = function capitalize(key) {\n  return key.length === 0 ? '' : \"\".concat(key[0].toUpperCase()).concat(key.slice(1));\n};\n// taken from InstantSearch.js/utils\nexport function range(_ref) {\n  var _ref$start = _ref.start,\n    start = _ref$start === void 0 ? 0 : _ref$start,\n    end = _ref.end,\n    _ref$step = _ref.step,\n    step = _ref$step === void 0 ? 1 : _ref$step;\n  // We can't divide by 0 so we re-assign the step to 1 if it happens.\n  var limitStep = step === 0 ? 1 : step;\n\n  // In some cases the array to create has a decimal length.\n  // We therefore need to round the value.\n  // Example:\n  //   { start: 1, end: 5000, step: 500 }\n  //   => Array length = (5000 - 1) / 500 = 9.998\n  var arrayLength = Math.round((end - start) / limitStep);\n  return _toConsumableArray(Array(arrayLength)).map(function (_, current) {\n    return (start + current) * limitStep;\n  });\n}\nexport function find(array, comparator) {\n  if (!Array.isArray(array)) {\n    return undefined;\n  }\n  for (var i = 0; i < array.length; i++) {\n    if (comparator(array[i])) {\n      return array[i];\n    }\n  }\n  return undefined;\n}","function _typeof(obj) { \"@babel/helpers - typeof\"; return _typeof = \"function\" == typeof Symbol && \"symbol\" == typeof Symbol.iterator ? function (obj) { return typeof obj; } : function (obj) { return obj && \"function\" == typeof Symbol && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }, _typeof(obj); }\nfunction _defineProperty(obj, key, value) { key = _toPropertyKey(key); if (key in obj) { Object.defineProperty(obj, key, { value: value, enumerable: true, configurable: true, writable: true }); } else { obj[key] = value; } return obj; }\nfunction _toPropertyKey(arg) { var key = _toPrimitive(arg, \"string\"); return _typeof(key) === \"symbol\" ? key : String(key); }\nfunction _toPrimitive(input, hint) { if (_typeof(input) !== \"object\" || input === null) return input; var prim = input[Symbol.toPrimitive]; if (prim !== undefined) { var res = prim.call(input, hint || \"default\"); if (_typeof(res) !== \"object\") return res; throw new TypeError(\"@@toPrimitive must return a primitive value.\"); } return (hint === \"string\" ? String : Number)(input); }\nimport createConnector from \"../core/createConnector.js\";\nimport { cleanUpValue, refineValue, getCurrentRefinementValue, getResults } from \"../core/indexUtils.js\";\nfunction getId() {\n  return 'page';\n}\nfunction getCurrentRefinement(props, searchState, context) {\n  var id = getId();\n  var page = 1;\n  var currentRefinement = getCurrentRefinementValue(props, searchState, context, id, page);\n  if (typeof currentRefinement === 'string') {\n    return parseInt(currentRefinement, 10);\n  }\n  return currentRefinement;\n}\nfunction _refine(props, searchState, nextPage, context) {\n  var id = getId();\n  var nextValue = _defineProperty({}, id, nextPage);\n  var resetPage = false;\n  return refineValue(searchState, nextValue, context, resetPage);\n}\n\n/**\n * connectPagination connector provides the logic to build a widget that will\n * let the user displays hits corresponding to a certain page.\n * @name connectPagination\n * @kind connector\n * @propType {boolean} [showFirst=true] - Display the first page link.\n * @propType {boolean} [showLast=false] - Display the last page link.\n * @propType {boolean} [showPrevious=true] - Display the previous page link.\n * @propType {boolean} [showNext=true] - Display the next page link.\n * @propType {number} [padding=3] - How many page links to display around the current page.\n * @propType {number} [totalPages=Infinity] - Maximum number of pages to display.\n * @providedPropType {function} refine - a function to remove a single filter\n * @providedPropType {function} createURL - a function to generate a URL for the corresponding search state\n * @providedPropType {number} nbPages - the total of existing pages\n * @providedPropType {number} currentRefinement - the page refinement currently applied\n */\nexport default createConnector({\n  displayName: 'AlgoliaPagination',\n  $$type: 'ais.pagination',\n  getProvidedProps: function getProvidedProps(props, searchState, searchResults) {\n    var results = getResults(searchResults, {\n      ais: props.contextValue,\n      multiIndexContext: props.indexContextValue\n    });\n    if (!results) {\n      return null;\n    }\n    var nbPages = results.nbPages;\n    return {\n      nbPages: nbPages,\n      currentRefinement: getCurrentRefinement(props, searchState, {\n        ais: props.contextValue,\n        multiIndexContext: props.indexContextValue\n      }),\n      canRefine: nbPages > 1\n    };\n  },\n  refine: function refine(props, searchState, nextPage) {\n    return _refine(props, searchState, nextPage, {\n      ais: props.contextValue,\n      multiIndexContext: props.indexContextValue\n    });\n  },\n  cleanUp: function cleanUp(props, searchState) {\n    return cleanUpValue(searchState, {\n      ais: props.contextValue,\n      multiIndexContext: props.indexContextValue\n    }, getId());\n  },\n  getSearchParameters: function getSearchParameters(searchParameters, props, searchState) {\n    return searchParameters.setPage(getCurrentRefinement(props, searchState, {\n      ais: props.contextValue,\n      multiIndexContext: props.indexContextValue\n    }) - 1);\n  },\n  getMetadata: function getMetadata() {\n    return {\n      id: getId()\n    };\n  }\n});","function _typeof(obj) { \"@babel/helpers - typeof\"; return _typeof = \"function\" == typeof Symbol && \"symbol\" == typeof Symbol.iterator ? function (obj) { return typeof obj; } : function (obj) { return obj && \"function\" == typeof Symbol && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }, _typeof(obj); }\nfunction _extends() { _extends = Object.assign ? Object.assign.bind() : function (target) { for (var i = 1; i < arguments.length; i++) { var source = arguments[i]; for (var key in source) { if (Object.prototype.hasOwnProperty.call(source, key)) { target[key] = source[key]; } } } return target; }; return _extends.apply(this, arguments); }\nfunction _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError(\"Cannot call a class as a function\"); } }\nfunction _defineProperties(target, props) { for (var i = 0; i < props.length; i++) { var descriptor = props[i]; descriptor.enumerable = descriptor.enumerable || false; descriptor.configurable = true; if (\"value\" in descriptor) descriptor.writable = true; Object.defineProperty(target, _toPropertyKey(descriptor.key), descriptor); } }\nfunction _createClass(Constructor, protoProps, staticProps) { if (protoProps) _defineProperties(Constructor.prototype, protoProps); if (staticProps) _defineProperties(Constructor, staticProps); Object.defineProperty(Constructor, \"prototype\", { writable: false }); return Constructor; }\nfunction _inherits(subClass, superClass) { if (typeof superClass !== \"function\" && superClass !== null) { throw new TypeError(\"Super expression must either be null or a function\"); } subClass.prototype = Object.create(superClass && superClass.prototype, { constructor: { value: subClass, writable: true, configurable: true } }); Object.defineProperty(subClass, \"prototype\", { writable: false }); if (superClass) _setPrototypeOf(subClass, superClass); }\nfunction _setPrototypeOf(o, p) { _setPrototypeOf = Object.setPrototypeOf ? Object.setPrototypeOf.bind() : function _setPrototypeOf(o, p) { o.__proto__ = p; return o; }; return _setPrototypeOf(o, p); }\nfunction _createSuper(Derived) { var hasNativeReflectConstruct = _isNativeReflectConstruct(); return function _createSuperInternal() { var Super = _getPrototypeOf(Derived), result; if (hasNativeReflectConstruct) { var NewTarget = _getPrototypeOf(this).constructor; result = Reflect.construct(Super, arguments, NewTarget); } else { result = Super.apply(this, arguments); } return _possibleConstructorReturn(this, result); }; }\nfunction _possibleConstructorReturn(self, call) { if (call && (_typeof(call) === \"object\" || typeof call === \"function\")) { return call; } else if (call !== void 0) { throw new TypeError(\"Derived constructors may only return object or undefined\"); } return _assertThisInitialized(self); }\nfunction _assertThisInitialized(self) { if (self === void 0) { throw new ReferenceError(\"this hasn't been initialised - super() hasn't been called\"); } return self; }\nfunction _isNativeReflectConstruct() { if (typeof Reflect === \"undefined\" || !Reflect.construct) return false; if (Reflect.construct.sham) return false; if (typeof Proxy === \"function\") return true; try { Boolean.prototype.valueOf.call(Reflect.construct(Boolean, [], function () {})); return true; } catch (e) { return false; } }\nfunction _getPrototypeOf(o) { _getPrototypeOf = Object.setPrototypeOf ? Object.getPrototypeOf.bind() : function _getPrototypeOf(o) { return o.__proto__ || Object.getPrototypeOf(o); }; return _getPrototypeOf(o); }\nfunction _defineProperty(obj, key, value) { key = _toPropertyKey(key); if (key in obj) { Object.defineProperty(obj, key, { value: value, enumerable: true, configurable: true, writable: true }); } else { obj[key] = value; } return obj; }\nfunction _toPropertyKey(arg) { var key = _toPrimitive(arg, \"string\"); return _typeof(key) === \"symbol\" ? key : String(key); }\nfunction _toPrimitive(input, hint) { if (_typeof(input) !== \"object\" || input === null) return input; var prim = input[Symbol.toPrimitive]; if (prim !== undefined) { var res = prim.call(input, hint || \"default\"); if (_typeof(res) !== \"object\") return res; throw new TypeError(\"@@toPrimitive must return a primitive value.\"); } return (hint === \"string\" ? String : Number)(input); }\nimport PropTypes from 'prop-types';\nimport React, { Component } from 'react';\nimport { isSpecialClick } from \"../core/utils.js\";\nvar Link = /*#__PURE__*/function (_Component) {\n  _inherits(Link, _Component);\n  var _super = _createSuper(Link);\n  function Link() {\n    var _this;\n    _classCallCheck(this, Link);\n    for (var _len = arguments.length, args = new Array(_len), _key = 0; _key < _len; _key++) {\n      args[_key] = arguments[_key];\n    }\n    _this = _super.call.apply(_super, [this].concat(args));\n    _defineProperty(_assertThisInitialized(_this), \"onClick\", function (e) {\n      if (isSpecialClick(e)) {\n        return;\n      }\n      _this.props.onClick();\n      e.preventDefault();\n    });\n    return _this;\n  }\n  _createClass(Link, [{\n    key: \"render\",\n    value: function render() {\n      return /*#__PURE__*/React.createElement(\"a\", _extends({}, this.props, {\n        onClick: this.onClick\n      }));\n    }\n  }]);\n  return Link;\n}(Component);\n_defineProperty(Link, \"propTypes\", {\n  onClick: PropTypes.func.isRequired\n});\nexport { Link as default };","function _typeof(obj) { \"@babel/helpers - typeof\"; return _typeof = \"function\" == typeof Symbol && \"symbol\" == typeof Symbol.iterator ? function (obj) { return typeof obj; } : function (obj) { return obj && \"function\" == typeof Symbol && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }, _typeof(obj); }\nfunction _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError(\"Cannot call a class as a function\"); } }\nfunction _defineProperties(target, props) { for (var i = 0; i < props.length; i++) { var descriptor = props[i]; descriptor.enumerable = descriptor.enumerable || false; descriptor.configurable = true; if (\"value\" in descriptor) descriptor.writable = true; Object.defineProperty(target, _toPropertyKey(descriptor.key), descriptor); } }\nfunction _createClass(Constructor, protoProps, staticProps) { if (protoProps) _defineProperties(Constructor.prototype, protoProps); if (staticProps) _defineProperties(Constructor, staticProps); Object.defineProperty(Constructor, \"prototype\", { writable: false }); return Constructor; }\nfunction _inherits(subClass, superClass) { if (typeof superClass !== \"function\" && superClass !== null) { throw new TypeError(\"Super expression must either be null or a function\"); } subClass.prototype = Object.create(superClass && superClass.prototype, { constructor: { value: subClass, writable: true, configurable: true } }); Object.defineProperty(subClass, \"prototype\", { writable: false }); if (superClass) _setPrototypeOf(subClass, superClass); }\nfunction _setPrototypeOf(o, p) { _setPrototypeOf = Object.setPrototypeOf ? Object.setPrototypeOf.bind() : function _setPrototypeOf(o, p) { o.__proto__ = p; return o; }; return _setPrototypeOf(o, p); }\nfunction _createSuper(Derived) { var hasNativeReflectConstruct = _isNativeReflectConstruct(); return function _createSuperInternal() { var Super = _getPrototypeOf(Derived), result; if (hasNativeReflectConstruct) { var NewTarget = _getPrototypeOf(this).constructor; result = Reflect.construct(Super, arguments, NewTarget); } else { result = Super.apply(this, arguments); } return _possibleConstructorReturn(this, result); }; }\nfunction _possibleConstructorReturn(self, call) { if (call && (_typeof(call) === \"object\" || typeof call === \"function\")) { return call; } else if (call !== void 0) { throw new TypeError(\"Derived constructors may only return object or undefined\"); } return _assertThisInitialized(self); }\nfunction _assertThisInitialized(self) { if (self === void 0) { throw new ReferenceError(\"this hasn't been initialised - super() hasn't been called\"); } return self; }\nfunction _isNativeReflectConstruct() { if (typeof Reflect === \"undefined\" || !Reflect.construct) return false; if (Reflect.construct.sham) return false; if (typeof Proxy === \"function\") return true; try { Boolean.prototype.valueOf.call(Reflect.construct(Boolean, [], function () {})); return true; } catch (e) { return false; } }\nfunction _getPrototypeOf(o) { _getPrototypeOf = Object.setPrototypeOf ? Object.getPrototypeOf.bind() : function _getPrototypeOf(o) { return o.__proto__ || Object.getPrototypeOf(o); }; return _getPrototypeOf(o); }\nfunction _defineProperty(obj, key, value) { key = _toPropertyKey(key); if (key in obj) { Object.defineProperty(obj, key, { value: value, enumerable: true, configurable: true, writable: true }); } else { obj[key] = value; } return obj; }\nfunction _toPropertyKey(arg) { var key = _toPrimitive(arg, \"string\"); return _typeof(key) === \"symbol\" ? key : String(key); }\nfunction _toPrimitive(input, hint) { if (_typeof(input) !== \"object\" || input === null) return input; var prim = input[Symbol.toPrimitive]; if (prim !== undefined) { var res = prim.call(input, hint || \"default\"); if (_typeof(res) !== \"object\") return res; throw new TypeError(\"@@toPrimitive must return a primitive value.\"); } return (hint === \"string\" ? String : Number)(input); }\nimport PropTypes from 'prop-types';\nimport React, { Component } from 'react';\nimport Link from \"./Link.js\";\nvar LinkList = /*#__PURE__*/function (_Component) {\n  _inherits(LinkList, _Component);\n  var _super = _createSuper(LinkList);\n  function LinkList() {\n    _classCallCheck(this, LinkList);\n    return _super.apply(this, arguments);\n  }\n  _createClass(LinkList, [{\n    key: \"render\",\n    value: function render() {\n      var _this$props = this.props,\n        cx = _this$props.cx,\n        createURL = _this$props.createURL,\n        items = _this$props.items,\n        onSelect = _this$props.onSelect,\n        canRefine = _this$props.canRefine;\n      return /*#__PURE__*/React.createElement(\"ul\", {\n        className: cx('list', !canRefine && 'list--noRefinement')\n      }, items.map(function (item) {\n        return /*#__PURE__*/React.createElement(\"li\", {\n          key: item.key === undefined ? item.value : item.key,\n          className: cx('item', item.selected && !item.disabled && 'item--selected', item.disabled && 'item--disabled', item.modifier)\n        }, item.disabled ? /*#__PURE__*/React.createElement(\"span\", {\n          className: cx('link')\n        }, item.label === undefined ? item.value : item.label) : /*#__PURE__*/React.createElement(Link, {\n          className: cx('link', item.selected && 'link--selected'),\n          \"aria-label\": item.ariaLabel,\n          href: createURL(item.value),\n          onClick: function onClick() {\n            return onSelect(item.value);\n          }\n        }, item.label === undefined ? item.value : item.label));\n      }));\n    }\n  }]);\n  return LinkList;\n}(Component);\n_defineProperty(LinkList, \"propTypes\", {\n  cx: PropTypes.func.isRequired,\n  createURL: PropTypes.func.isRequired,\n  items: PropTypes.arrayOf(PropTypes.shape({\n    value: PropTypes.oneOfType([PropTypes.string, PropTypes.number, PropTypes.object]).isRequired,\n    key: PropTypes.oneOfType([PropTypes.string, PropTypes.number]),\n    label: PropTypes.node,\n    modifier: PropTypes.string,\n    ariaLabel: PropTypes.string,\n    disabled: PropTypes.bool\n  })),\n  onSelect: PropTypes.func.isRequired,\n  canRefine: PropTypes.bool.isRequired\n});\nexport { LinkList as default };","var _excluded = [\"listComponent\", \"nbPages\", \"totalPages\", \"currentRefinement\", \"padding\", \"showFirst\", \"showPrevious\", \"showNext\", \"showLast\", \"refine\", \"createURL\", \"canRefine\", \"translate\", \"className\"];\nfunction _typeof(obj) { \"@babel/helpers - typeof\"; return _typeof = \"function\" == typeof Symbol && \"symbol\" == typeof Symbol.iterator ? function (obj) { return typeof obj; } : function (obj) { return obj && \"function\" == typeof Symbol && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }, _typeof(obj); }\nfunction _extends() { _extends = Object.assign ? Object.assign.bind() : function (target) { for (var i = 1; i < arguments.length; i++) { var source = arguments[i]; for (var key in source) { if (Object.prototype.hasOwnProperty.call(source, key)) { target[key] = source[key]; } } } return target; }; return _extends.apply(this, arguments); }\nfunction _objectWithoutProperties(source, excluded) { if (source == null) return {}; var target = _objectWithoutPropertiesLoose(source, excluded); var key, i; if (Object.getOwnPropertySymbols) { var sourceSymbolKeys = Object.getOwnPropertySymbols(source); for (i = 0; i < sourceSymbolKeys.length; i++) { key = sourceSymbolKeys[i]; if (excluded.indexOf(key) >= 0) continue; if (!Object.prototype.propertyIsEnumerable.call(source, key)) continue; target[key] = source[key]; } } return target; }\nfunction _objectWithoutPropertiesLoose(source, excluded) { if (source == null) return {}; var target = {}; var sourceKeys = Object.keys(source); var key, i; for (i = 0; i < sourceKeys.length; i++) { key = sourceKeys[i]; if (excluded.indexOf(key) >= 0) continue; target[key] = source[key]; } return target; }\nfunction _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError(\"Cannot call a class as a function\"); } }\nfunction _defineProperties(target, props) { for (var i = 0; i < props.length; i++) { var descriptor = props[i]; descriptor.enumerable = descriptor.enumerable || false; descriptor.configurable = true; if (\"value\" in descriptor) descriptor.writable = true; Object.defineProperty(target, _toPropertyKey(descriptor.key), descriptor); } }\nfunction _createClass(Constructor, protoProps, staticProps) { if (protoProps) _defineProperties(Constructor.prototype, protoProps); if (staticProps) _defineProperties(Constructor, staticProps); Object.defineProperty(Constructor, \"prototype\", { writable: false }); return Constructor; }\nfunction _inherits(subClass, superClass) { if (typeof superClass !== \"function\" && superClass !== null) { throw new TypeError(\"Super expression must either be null or a function\"); } subClass.prototype = Object.create(superClass && superClass.prototype, { constructor: { value: subClass, writable: true, configurable: true } }); Object.defineProperty(subClass, \"prototype\", { writable: false }); if (superClass) _setPrototypeOf(subClass, superClass); }\nfunction _setPrototypeOf(o, p) { _setPrototypeOf = Object.setPrototypeOf ? Object.setPrototypeOf.bind() : function _setPrototypeOf(o, p) { o.__proto__ = p; return o; }; return _setPrototypeOf(o, p); }\nfunction _createSuper(Derived) { var hasNativeReflectConstruct = _isNativeReflectConstruct(); return function _createSuperInternal() { var Super = _getPrototypeOf(Derived), result; if (hasNativeReflectConstruct) { var NewTarget = _getPrototypeOf(this).constructor; result = Reflect.construct(Super, arguments, NewTarget); } else { result = Super.apply(this, arguments); } return _possibleConstructorReturn(this, result); }; }\nfunction _possibleConstructorReturn(self, call) { if (call && (_typeof(call) === \"object\" || typeof call === \"function\")) { return call; } else if (call !== void 0) { throw new TypeError(\"Derived constructors may only return object or undefined\"); } return _assertThisInitialized(self); }\nfunction _assertThisInitialized(self) { if (self === void 0) { throw new ReferenceError(\"this hasn't been initialised - super() hasn't been called\"); } return self; }\nfunction _isNativeReflectConstruct() { if (typeof Reflect === \"undefined\" || !Reflect.construct) return false; if (Reflect.construct.sham) return false; if (typeof Proxy === \"function\") return true; try { Boolean.prototype.valueOf.call(Reflect.construct(Boolean, [], function () {})); return true; } catch (e) { return false; } }\nfunction _getPrototypeOf(o) { _getPrototypeOf = Object.setPrototypeOf ? Object.getPrototypeOf.bind() : function _getPrototypeOf(o) { return o.__proto__ || Object.getPrototypeOf(o); }; return _getPrototypeOf(o); }\nfunction _defineProperty(obj, key, value) { key = _toPropertyKey(key); if (key in obj) { Object.defineProperty(obj, key, { value: value, enumerable: true, configurable: true, writable: true }); } else { obj[key] = value; } return obj; }\nfunction _toPropertyKey(arg) { var key = _toPrimitive(arg, \"string\"); return _typeof(key) === \"symbol\" ? key : String(key); }\nfunction _toPrimitive(input, hint) { if (_typeof(input) !== \"object\" || input === null) return input; var prim = input[Symbol.toPrimitive]; if (prim !== undefined) { var res = prim.call(input, hint || \"default\"); if (_typeof(res) !== \"object\") return res; throw new TypeError(\"@@toPrimitive must return a primitive value.\"); } return (hint === \"string\" ? String : Number)(input); }\nimport classNames from 'classnames';\nimport PropTypes from 'prop-types';\nimport React, { Component } from 'react';\nimport { translatable } from 'react-instantsearch-core';\nimport { createClassNames, capitalize, range } from \"../core/utils.js\";\nimport LinkList from \"./LinkList.js\";\nvar cx = createClassNames('Pagination');\n\n// Determines the size of the widget (the number of pages displayed - that the user can directly click on)\nfunction calculateSize(padding, maxPages) {\n  return Math.min(2 * padding + 1, maxPages);\n}\nfunction calculatePaddingLeft(currentPage, padding, maxPages, size) {\n  if (currentPage <= padding) {\n    return currentPage;\n  }\n  if (currentPage >= maxPages - padding) {\n    return size - (maxPages - currentPage);\n  }\n  return padding + 1;\n}\n\n// Retrieve the correct page range to populate the widget\nfunction getPages(currentPage, maxPages, padding) {\n  var size = calculateSize(padding, maxPages);\n  // If the widget size is equal to the max number of pages, return the entire page range\n  if (size === maxPages) return range({\n    start: 1,\n    end: maxPages + 1\n  });\n  var paddingLeft = calculatePaddingLeft(currentPage, padding, maxPages, size);\n  var paddingRight = size - paddingLeft;\n  var first = currentPage - paddingLeft;\n  var last = currentPage + paddingRight;\n  return range({\n    start: first + 1,\n    end: last + 1\n  });\n}\nvar Pagination = /*#__PURE__*/function (_Component) {\n  _inherits(Pagination, _Component);\n  var _super = _createSuper(Pagination);\n  function Pagination() {\n    _classCallCheck(this, Pagination);\n    return _super.apply(this, arguments);\n  }\n  _createClass(Pagination, [{\n    key: \"getItem\",\n    value: function getItem(modifier, translationKey, value) {\n      var _this$props = this.props,\n        nbPages = _this$props.nbPages,\n        totalPages = _this$props.totalPages,\n        translate = _this$props.translate;\n      return {\n        key: \"\".concat(modifier, \".\").concat(value),\n        modifier: modifier,\n        disabled: value < 1 || value >= Math.min(totalPages, nbPages),\n        label: translate(translationKey, value),\n        value: value,\n        ariaLabel: translate(\"aria\".concat(capitalize(translationKey)), value)\n      };\n    }\n  }, {\n    key: \"render\",\n    value: function render() {\n      var _this$props2 = this.props,\n        ListComponent = _this$props2.listComponent,\n        nbPages = _this$props2.nbPages,\n        totalPages = _this$props2.totalPages,\n        currentRefinement = _this$props2.currentRefinement,\n        padding = _this$props2.padding,\n        showFirst = _this$props2.showFirst,\n        showPrevious = _this$props2.showPrevious,\n        showNext = _this$props2.showNext,\n        showLast = _this$props2.showLast,\n        refine = _this$props2.refine,\n        createURL = _this$props2.createURL,\n        canRefine = _this$props2.canRefine,\n        translate = _this$props2.translate,\n        className = _this$props2.className,\n        otherProps = _objectWithoutProperties(_this$props2, _excluded);\n      var maxPages = Math.min(nbPages, totalPages);\n      var lastPage = maxPages;\n      var items = [];\n      if (showFirst) {\n        items.push({\n          key: 'first',\n          modifier: 'item--firstPage',\n          disabled: currentRefinement === 1,\n          label: translate('first'),\n          value: 1,\n          ariaLabel: translate('ariaFirst')\n        });\n      }\n      if (showPrevious) {\n        items.push({\n          key: 'previous',\n          modifier: 'item--previousPage',\n          disabled: currentRefinement === 1,\n          label: translate('previous'),\n          value: currentRefinement - 1,\n          ariaLabel: translate('ariaPrevious')\n        });\n      }\n      items = items.concat(getPages(currentRefinement, maxPages, padding).map(function (value) {\n        return {\n          key: value,\n          modifier: 'item--page',\n          label: translate('page', value),\n          value: value,\n          selected: value === currentRefinement,\n          ariaLabel: translate('ariaPage', value)\n        };\n      }));\n      if (showNext) {\n        items.push({\n          key: 'next',\n          modifier: 'item--nextPage',\n          disabled: currentRefinement === lastPage || lastPage <= 1,\n          label: translate('next'),\n          value: currentRefinement + 1,\n          ariaLabel: translate('ariaNext')\n        });\n      }\n      if (showLast) {\n        items.push({\n          key: 'last',\n          modifier: 'item--lastPage',\n          disabled: currentRefinement === lastPage || lastPage <= 1,\n          label: translate('last'),\n          value: lastPage,\n          ariaLabel: translate('ariaLast')\n        });\n      }\n      return /*#__PURE__*/React.createElement(\"div\", {\n        className: classNames(cx('', !canRefine && '-noRefinement'), className)\n      }, /*#__PURE__*/React.createElement(ListComponent, _extends({}, otherProps, {\n        cx: cx,\n        items: items,\n        onSelect: refine,\n        createURL: createURL,\n        canRefine: canRefine\n      })));\n    }\n  }]);\n  return Pagination;\n}(Component);\n_defineProperty(Pagination, \"propTypes\", {\n  nbPages: PropTypes.number.isRequired,\n  currentRefinement: PropTypes.number.isRequired,\n  refine: PropTypes.func.isRequired,\n  createURL: PropTypes.func.isRequired,\n  canRefine: PropTypes.bool.isRequired,\n  translate: PropTypes.func.isRequired,\n  listComponent: PropTypes.func,\n  showFirst: PropTypes.bool,\n  showPrevious: PropTypes.bool,\n  showNext: PropTypes.bool,\n  showLast: PropTypes.bool,\n  padding: PropTypes.number,\n  totalPages: PropTypes.number,\n  className: PropTypes.string\n});\n_defineProperty(Pagination, \"defaultProps\", {\n  listComponent: LinkList,\n  showFirst: true,\n  showPrevious: true,\n  showNext: true,\n  showLast: false,\n  padding: 3,\n  totalPages: Infinity,\n  className: ''\n});\nexport default translatable({\n  previous: '‹',\n  next: '›',\n  first: '«',\n  last: '»',\n  page: function page(currentRefinement) {\n    return currentRefinement.toString();\n  },\n  ariaPrevious: 'Previous page',\n  ariaNext: 'Next page',\n  ariaFirst: 'First page',\n  ariaLast: 'Last page',\n  ariaPage: function ariaPage(currentRefinement) {\n    return \"Page \".concat(currentRefinement.toString());\n  }\n})(Pagination);","function _typeof(obj) { \"@babel/helpers - typeof\"; return _typeof = \"function\" == typeof Symbol && \"symbol\" == typeof Symbol.iterator ? function (obj) { return typeof obj; } : function (obj) { return obj && \"function\" == typeof Symbol && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }, _typeof(obj); }\nfunction _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError(\"Cannot call a class as a function\"); } }\nfunction _defineProperties(target, props) { for (var i = 0; i < props.length; i++) { var descriptor = props[i]; descriptor.enumerable = descriptor.enumerable || false; descriptor.configurable = true; if (\"value\" in descriptor) descriptor.writable = true; Object.defineProperty(target, _toPropertyKey(descriptor.key), descriptor); } }\nfunction _createClass(Constructor, protoProps, staticProps) { if (protoProps) _defineProperties(Constructor.prototype, protoProps); if (staticProps) _defineProperties(Constructor, staticProps); Object.defineProperty(Constructor, \"prototype\", { writable: false }); return Constructor; }\nfunction _inherits(subClass, superClass) { if (typeof superClass !== \"function\" && superClass !== null) { throw new TypeError(\"Super expression must either be null or a function\"); } subClass.prototype = Object.create(superClass && superClass.prototype, { constructor: { value: subClass, writable: true, configurable: true } }); Object.defineProperty(subClass, \"prototype\", { writable: false }); if (superClass) _setPrototypeOf(subClass, superClass); }\nfunction _setPrototypeOf(o, p) { _setPrototypeOf = Object.setPrototypeOf ? Object.setPrototypeOf.bind() : function _setPrototypeOf(o, p) { o.__proto__ = p; return o; }; return _setPrototypeOf(o, p); }\nfunction _createSuper(Derived) { var hasNativeReflectConstruct = _isNativeReflectConstruct(); return function _createSuperInternal() { var Super = _getPrototypeOf(Derived), result; if (hasNativeReflectConstruct) { var NewTarget = _getPrototypeOf(this).constructor; result = Reflect.construct(Super, arguments, NewTarget); } else { result = Super.apply(this, arguments); } return _possibleConstructorReturn(this, result); }; }\nfunction _possibleConstructorReturn(self, call) { if (call && (_typeof(call) === \"object\" || typeof call === \"function\")) { return call; } else if (call !== void 0) { throw new TypeError(\"Derived constructors may only return object or undefined\"); } return _assertThisInitialized(self); }\nfunction _assertThisInitialized(self) { if (self === void 0) { throw new ReferenceError(\"this hasn't been initialised - super() hasn't been called\"); } return self; }\nfunction _isNativeReflectConstruct() { if (typeof Reflect === \"undefined\" || !Reflect.construct) return false; if (Reflect.construct.sham) return false; if (typeof Proxy === \"function\") return true; try { Boolean.prototype.valueOf.call(Reflect.construct(Boolean, [], function () {})); return true; } catch (e) { return false; } }\nfunction _getPrototypeOf(o) { _getPrototypeOf = Object.setPrototypeOf ? Object.getPrototypeOf.bind() : function _getPrototypeOf(o) { return o.__proto__ || Object.getPrototypeOf(o); }; return _getPrototypeOf(o); }\nfunction _defineProperty(obj, key, value) { key = _toPropertyKey(key); if (key in obj) { Object.defineProperty(obj, key, { value: value, enumerable: true, configurable: true, writable: true }); } else { obj[key] = value; } return obj; }\nfunction _toPropertyKey(arg) { var key = _toPrimitive(arg, \"string\"); return _typeof(key) === \"symbol\" ? key : String(key); }\nfunction _toPrimitive(input, hint) { if (_typeof(input) !== \"object\" || input === null) return input; var prim = input[Symbol.toPrimitive]; if (prim !== undefined) { var res = prim.call(input, hint || \"default\"); if (_typeof(res) !== \"object\") return res; throw new TypeError(\"@@toPrimitive must return a primitive value.\"); } return (hint === \"string\" ? String : Number)(input); }\nimport classNames from 'classnames';\nimport PropTypes from 'prop-types';\nimport React, { Component, createContext } from 'react';\nimport { createClassNames } from \"../core/utils.js\";\nvar cx = createClassNames('Panel');\nvar _createContext = /*#__PURE__*/createContext(function setCanRefine() {}),\n  PanelConsumer = _createContext.Consumer,\n  PanelProvider = _createContext.Provider;\nexport { PanelConsumer, PanelProvider };\nvar Panel = /*#__PURE__*/function (_Component) {\n  _inherits(Panel, _Component);\n  var _super = _createSuper(Panel);\n  function Panel() {\n    var _this;\n    _classCallCheck(this, Panel);\n    for (var _len = arguments.length, args = new Array(_len), _key = 0; _key < _len; _key++) {\n      args[_key] = arguments[_key];\n    }\n    _this = _super.call.apply(_super, [this].concat(args));\n    _defineProperty(_assertThisInitialized(_this), \"state\", {\n      canRefine: true\n    });\n    _defineProperty(_assertThisInitialized(_this), \"setCanRefine\", function (nextCanRefine) {\n      _this.setState({\n        canRefine: nextCanRefine\n      });\n    });\n    return _this;\n  }\n  _createClass(Panel, [{\n    key: \"render\",\n    value: function render() {\n      var _this$props = this.props,\n        children = _this$props.children,\n        className = _this$props.className,\n        header = _this$props.header,\n        footer = _this$props.footer;\n      var canRefine = this.state.canRefine;\n      return /*#__PURE__*/React.createElement(\"div\", {\n        className: classNames(cx('', !canRefine && '-noRefinement'), className)\n      }, header && /*#__PURE__*/React.createElement(\"div\", {\n        className: cx('header')\n      }, header), /*#__PURE__*/React.createElement(\"div\", {\n        className: cx('body')\n      }, /*#__PURE__*/React.createElement(PanelProvider, {\n        value: this.setCanRefine\n      }, children)), footer && /*#__PURE__*/React.createElement(\"div\", {\n        className: cx('footer')\n      }, footer));\n    }\n  }]);\n  return Panel;\n}(Component);\n_defineProperty(Panel, \"propTypes\", {\n  children: PropTypes.node.isRequired,\n  className: PropTypes.string,\n  header: PropTypes.node,\n  footer: PropTypes.node\n});\n_defineProperty(Panel, \"defaultProps\", {\n  className: '',\n  header: null,\n  footer: null\n});\nexport default Panel;","function _typeof(obj) { \"@babel/helpers - typeof\"; return _typeof = \"function\" == typeof Symbol && \"symbol\" == typeof Symbol.iterator ? function (obj) { return typeof obj; } : function (obj) { return obj && \"function\" == typeof Symbol && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }, _typeof(obj); }\nfunction _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError(\"Cannot call a class as a function\"); } }\nfunction _defineProperties(target, props) { for (var i = 0; i < props.length; i++) { var descriptor = props[i]; descriptor.enumerable = descriptor.enumerable || false; descriptor.configurable = true; if (\"value\" in descriptor) descriptor.writable = true; Object.defineProperty(target, _toPropertyKey(descriptor.key), descriptor); } }\nfunction _createClass(Constructor, protoProps, staticProps) { if (protoProps) _defineProperties(Constructor.prototype, protoProps); if (staticProps) _defineProperties(Constructor, staticProps); Object.defineProperty(Constructor, \"prototype\", { writable: false }); return Constructor; }\nfunction _inherits(subClass, superClass) { if (typeof superClass !== \"function\" && superClass !== null) { throw new TypeError(\"Super expression must either be null or a function\"); } subClass.prototype = Object.create(superClass && superClass.prototype, { constructor: { value: subClass, writable: true, configurable: true } }); Object.defineProperty(subClass, \"prototype\", { writable: false }); if (superClass) _setPrototypeOf(subClass, superClass); }\nfunction _setPrototypeOf(o, p) { _setPrototypeOf = Object.setPrototypeOf ? Object.setPrototypeOf.bind() : function _setPrototypeOf(o, p) { o.__proto__ = p; return o; }; return _setPrototypeOf(o, p); }\nfunction _createSuper(Derived) { var hasNativeReflectConstruct = _isNativeReflectConstruct(); return function _createSuperInternal() { var Super = _getPrototypeOf(Derived), result; if (hasNativeReflectConstruct) { var NewTarget = _getPrototypeOf(this).constructor; result = Reflect.construct(Super, arguments, NewTarget); } else { result = Super.apply(this, arguments); } return _possibleConstructorReturn(this, result); }; }\nfunction _possibleConstructorReturn(self, call) { if (call && (_typeof(call) === \"object\" || typeof call === \"function\")) { return call; } else if (call !== void 0) { throw new TypeError(\"Derived constructors may only return object or undefined\"); } return _assertThisInitialized(self); }\nfunction _assertThisInitialized(self) { if (self === void 0) { throw new ReferenceError(\"this hasn't been initialised - super() hasn't been called\"); } return self; }\nfunction _isNativeReflectConstruct() { if (typeof Reflect === \"undefined\" || !Reflect.construct) return false; if (Reflect.construct.sham) return false; if (typeof Proxy === \"function\") return true; try { Boolean.prototype.valueOf.call(Reflect.construct(Boolean, [], function () {})); return true; } catch (e) { return false; } }\nfunction _getPrototypeOf(o) { _getPrototypeOf = Object.setPrototypeOf ? Object.getPrototypeOf.bind() : function _getPrototypeOf(o) { return o.__proto__ || Object.getPrototypeOf(o); }; return _getPrototypeOf(o); }\nfunction _defineProperty(obj, key, value) { key = _toPropertyKey(key); if (key in obj) { Object.defineProperty(obj, key, { value: value, enumerable: true, configurable: true, writable: true }); } else { obj[key] = value; } return obj; }\nfunction _toPropertyKey(arg) { var key = _toPrimitive(arg, \"string\"); return _typeof(key) === \"symbol\" ? key : String(key); }\nfunction _toPrimitive(input, hint) { if (_typeof(input) !== \"object\" || input === null) return input; var prim = input[Symbol.toPrimitive]; if (prim !== undefined) { var res = prim.call(input, hint || \"default\"); if (_typeof(res) !== \"object\") return res; throw new TypeError(\"@@toPrimitive must return a primitive value.\"); } return (hint === \"string\" ? String : Number)(input); }\nimport PropTypes from 'prop-types';\nimport React, { Component } from 'react';\nimport { PanelConsumer } from \"./Panel.js\";\nvar PanelCallbackHandler = /*#__PURE__*/function (_Component) {\n  _inherits(PanelCallbackHandler, _Component);\n  var _super = _createSuper(PanelCallbackHandler);\n  function PanelCallbackHandler() {\n    _classCallCheck(this, PanelCallbackHandler);\n    return _super.apply(this, arguments);\n  }\n  _createClass(PanelCallbackHandler, [{\n    key: \"componentDidMount\",\n    value: function componentDidMount() {\n      this.props.setCanRefine(this.props.canRefine);\n    }\n  }, {\n    key: \"componentDidUpdate\",\n    value: function componentDidUpdate(prevProps) {\n      if (prevProps.canRefine !== this.props.canRefine) {\n        this.props.setCanRefine(this.props.canRefine);\n      }\n    }\n  }, {\n    key: \"render\",\n    value: function render() {\n      return this.props.children;\n    }\n  }]);\n  return PanelCallbackHandler;\n}(Component);\n_defineProperty(PanelCallbackHandler, \"propTypes\", {\n  children: PropTypes.node.isRequired,\n  canRefine: PropTypes.bool.isRequired,\n  setCanRefine: PropTypes.func.isRequired\n});\nvar PanelWrapper = function PanelWrapper(_ref) {\n  var canRefine = _ref.canRefine,\n    children = _ref.children;\n  return /*#__PURE__*/React.createElement(PanelConsumer, null, function (setCanRefine) {\n    return /*#__PURE__*/React.createElement(PanelCallbackHandler, {\n      setCanRefine: setCanRefine,\n      canRefine: canRefine\n    }, children);\n  });\n};\nPanelWrapper.propTypes = {\n  canRefine: PropTypes.bool.isRequired,\n  children: PropTypes.node.isRequired\n};\nexport default PanelWrapper;","import React from 'react';\nimport { connectPagination } from 'react-instantsearch-core';\nimport Pagination from \"../components/Pagination.js\";\nimport PanelCallbackHandler from \"../components/PanelCallbackHandler.js\";\n\n/**\n * The Pagination widget displays a simple pagination system allowing the user to\n * change the current page.\n * @name Pagination\n * @kind widget\n * @propType {boolean} [showFirst=true] - Display the first page link.\n * @propType {boolean} [showLast=false] - Display the last page link.\n * @propType {boolean} [showPrevious=true] - Display the previous page link.\n * @propType {boolean} [showNext=true] - Display the next page link.\n * @propType {number} [padding=3] - How many page links to display around the current page.\n * @propType {number} [totalPages=Infinity] - Maximum number of pages to display.\n * @themeKey ais-Pagination - the root div of the widget\n * @themeKey ais-Pagination--noRefinement - the root div of the widget when there is no refinement\n * @themeKey ais-Pagination-list - the list of all pagination items\n * @themeKey ais-Pagination-list--noRefinement - the list of all pagination items when there is no refinement\n * @themeKey ais-Pagination-item - the pagination list item\n * @themeKey ais-Pagination-item--firstPage - the \"first\" pagination list item\n * @themeKey ais-Pagination-item--lastPage - the \"last\" pagination list item\n * @themeKey ais-Pagination-item--previousPage - the \"previous\" pagination list item\n * @themeKey ais-Pagination-item--nextPage - the \"next\" pagination list item\n * @themeKey ais-Pagination-item--page - the \"page\" pagination list item\n * @themeKey ais-Pagination-item--selected - the selected pagination list item\n * @themeKey ais-Pagination-item--disabled - the disabled pagination list item\n * @themeKey ais-Pagination-link - the pagination clickable element\n * @translationKey previous - Label value for the previous page link\n * @translationKey next - Label value for the next page link\n * @translationKey first - Label value for the first page link\n * @translationKey last - Label value for the last page link\n * @translationkey page - Label value for a page item. You get function(currentRefinement) and you need to return a string\n * @translationKey ariaPrevious - Accessibility label value for the previous page link\n * @translationKey ariaNext - Accessibility label value for the next page link\n * @translationKey ariaFirst - Accessibility label value for the first page link\n * @translationKey ariaLast - Accessibility label value for the last page link\n * @translationkey ariaPage - Accessibility label value for a page item. You get function(currentRefinement) and you need to return a string\n * @example\n * import React from 'react';\n * import algoliasearch from 'algoliasearch/lite';\n * import { InstantSearch, Pagination } from 'react-instantsearch-dom';\n *\n * const searchClient = algoliasearch(\n *   'latency',\n *   '6be0576ff61c053d5f9a3225e2a90f76'\n * );\n *\n * const App = () => (\n *   <InstantSearch\n *     searchClient={searchClient}\n *     indexName=\"instant_search\"\n *   >\n *     <Pagination />\n *   </InstantSearch>\n * );\n */\n\nvar PaginationWidget = function PaginationWidget(props) {\n  return /*#__PURE__*/React.createElement(PanelCallbackHandler, props, /*#__PURE__*/React.createElement(Pagination, props));\n};\nexport default connectPagination(PaginationWidget, {\n  $$widgetType: 'ais.pagination'\n});","import createConnector from \"../core/createConnector.js\";\n// @ts-ignore\nimport { getResults } from \"../core/indexUtils.js\";\n\n/**\n * connectStats connector provides the logic to build a widget that will\n *  displays algolia search statistics (hits number and processing time).\n * @name connectStats\n * @kind connector\n * @providedPropType {number} nbHits - number of hits returned by Algolia.\n * @providedPropType {number} nbSortedHits - number of sorted hits returned by Algolia.\n * @providedPropType {number} processingTimeMS - the time in ms took by Algolia to search for results.\n */\nexport default createConnector({\n  displayName: 'AlgoliaStats',\n  $$type: 'ais.stats',\n  getProvidedProps: function getProvidedProps(props, _searchState, searchResults) {\n    var results = getResults(searchResults, {\n      ais: props.contextValue,\n      multiIndexContext: props.indexContextValue\n    });\n    if (!results) {\n      return null;\n    }\n    return {\n      areHitsSorted: results.appliedRelevancyStrictness !== undefined && results.appliedRelevancyStrictness > 0 && results.nbHits !== results.nbSortedHits,\n      nbHits: results.nbHits,\n      nbSortedHits: results.nbSortedHits,\n      processingTimeMS: results.processingTimeMS\n    };\n  }\n});","import classNames from 'classnames';\nimport PropTypes from 'prop-types';\nimport React from 'react';\nimport { translatable } from 'react-instantsearch-core';\nimport { createClassNames } from \"../core/utils.js\";\nvar cx = createClassNames('Stats');\nvar Stats = function Stats(_ref) {\n  var _ref$className = _ref.className,\n    className = _ref$className === void 0 ? '' : _ref$className,\n    areHitsSorted = _ref.areHitsSorted,\n    nbHits = _ref.nbHits,\n    nbSortedHits = _ref.nbSortedHits,\n    processingTimeMS = _ref.processingTimeMS,\n    translate = _ref.translate;\n  return /*#__PURE__*/React.createElement(\"div\", {\n    className: classNames(cx(''), className)\n  }, /*#__PURE__*/React.createElement(\"span\", {\n    className: cx('text')\n  }, translate('stats', nbHits, processingTimeMS, nbSortedHits, areHitsSorted)));\n};\nStats.propTypes = {\n  className: PropTypes.string,\n  areHitsSorted: PropTypes.bool.isRequired,\n  nbHits: PropTypes.number.isRequired,\n  nbSortedHits: PropTypes.number,\n  processingTimeMS: PropTypes.number.isRequired,\n  translate: PropTypes.func.isRequired\n};\nexport default translatable({\n  stats: function stats(n, ms, nSorted, areHitsSorted) {\n    return areHitsSorted && n !== nSorted ? \"\".concat(nSorted.toLocaleString(), \" relevant results sorted out of \").concat(n.toLocaleString(), \" found in \").concat(ms.toLocaleString(), \"ms\") : \"\".concat(n.toLocaleString(), \" results found in \").concat(ms.toLocaleString(), \"ms\");\n  }\n})(Stats);","import { connectStats } from 'react-instantsearch-core';\nimport Stats from \"../components/Stats.js\";\n\n/**\n * The Stats component displays the total number of matching hits and the time it took to get them (time spent in the Algolia server) if `relevancyStrictness` is `undefined`. Displays the total number of matching sorted hits out of the matching hits and the time it took to get them (time spent in the Algolia server) otherwise.\n * @name Stats\n * @kind widget\n * @themeKey ais-Stats - the root div of the widget\n * @themeKey ais-Stats-text - the text of the widget - the count of items for each item\n * @translationkey stats - The string displayed by the stats widget. You get function(n, ms, nSorted, areHitsSorted) and you need to return a string. `n` is a number of hits retrieved, `ms` is a processed time, `nSorted` is a number of sorted hits retrieved, `areHitsSorted` is a boolean translating a `relevancyStrictness` set between 0 and 100.\n * @example\n * import React from 'react';\n * import { InstantSearch, Stats, Hits } from 'react-instantsearch-dom';\n * import algoliasearch from 'algoliasearch/lite';\n *\n * const searchClient = algoliasearch(\n *   'latency',\n *   '6be0576ff61c053d5f9a3225e2a90f76'\n * );\n *\n * const App = () => (\n *   <InstantSearch\n *     searchClient={searchClient}\n *     indexName=\"instant_search\"\n *   >\n *     <Stats />\n *     <Hits />\n *   </InstantSearch>\n * );\n */\n\nexport default connectStats(Stats, {\n  $$widgetType: 'ais.stats'\n});","/*!\n\tCopyright (c) 2018 Jed Watson.\n\tLicensed under the MIT License (MIT), see\n\thttp://jedwatson.github.io/classnames\n*/\n/* global define */\n\n(function () {\n\t'use strict';\n\n\tvar hasOwn = {}.hasOwnProperty;\n\n\tfunction classNames () {\n\t\tvar classes = '';\n\n\t\tfor (var i = 0; i < arguments.length; i++) {\n\t\t\tvar arg = arguments[i];\n\t\t\tif (arg) {\n\t\t\t\tclasses = appendClass(classes, parseValue(arg));\n\t\t\t}\n\t\t}\n\n\t\treturn classes;\n\t}\n\n\tfunction parseValue (arg) {\n\t\tif (typeof arg === 'string' || typeof arg === 'number') {\n\t\t\treturn arg;\n\t\t}\n\n\t\tif (typeof arg !== 'object') {\n\t\t\treturn '';\n\t\t}\n\n\t\tif (Array.isArray(arg)) {\n\t\t\treturn classNames.apply(null, arg);\n\t\t}\n\n\t\tif (arg.toString !== Object.prototype.toString && !arg.toString.toString().includes('[native code]')) {\n\t\t\treturn arg.toString();\n\t\t}\n\n\t\tvar classes = '';\n\n\t\tfor (var key in arg) {\n\t\t\tif (hasOwn.call(arg, key) && arg[key]) {\n\t\t\t\tclasses = appendClass(classes, key);\n\t\t\t}\n\t\t}\n\n\t\treturn classes;\n\t}\n\n\tfunction appendClass (value, newClass) {\n\t\tif (!newClass) {\n\t\t\treturn value;\n\t\t}\n\t\n\t\tif (value) {\n\t\t\treturn value + ' ' + newClass;\n\t\t}\n\t\n\t\treturn value + newClass;\n\t}\n\n\tif (typeof module !== 'undefined' && module.exports) {\n\t\tclassNames.default = classNames;\n\t\tmodule.exports = classNames;\n\t} else if (typeof define === 'function' && typeof define.amd === 'object' && define.amd) {\n\t\t// register as 'classnames', consistent with npm package name\n\t\tdefine('classnames', [], function () {\n\t\t\treturn classNames;\n\t\t});\n\t} else {\n\t\twindow.classNames = classNames;\n\t}\n}());\n"],"names":["EventEmitter","this","_events","_maxListeners","undefined","isFunction","arg","isObject","isUndefined","module","exports","prototype","defaultMaxListeners","setMaxListeners","n","isNaN","TypeError","emit","type","er","handler","len","args","i","listeners","error","length","arguments","Error","err","context","call","Array","slice","apply","addListener","listener","m","newListener","push","warned","console","trace","on","once","fired","g","removeListener","list","position","splice","removeAllListeners","key","listenerCount","evlistener","emitter","AlgoliaSearchHelper","SearchParameters","SearchResults","algoliasearchHelper","client","index","opts","version","DerivedHelper","mainHelper","fn","main","lastResults","inherits","detach","detachDerivedHelper","getModifiedState","parameters","defaultsPure","objectHasKeys","omit","lib","addRefinement","refinementList","attribute","value","isRefined","valueAsString","facetRefinement","concat","mod","removeRefinement","clearRefinement","v","f","toggleRefinement","refinementType","hasChanged","newRefinementList","Object","keys","reduce","memo","values","facetList","filter","refinementValue","containsRefinements","Boolean","refinementValueAsString","indexOf","find","intersection","merge","valToNumber","isValidUserToken","RefinementList","isEqualNumericRefinement","a","b","isArray","every","el","newParameters","params","_parseNumbers","userToken","warn","facets","disjunctiveFacets","hierarchicalFacets","facetsRefinements","facetsExcludes","disjunctiveFacetsRefinements","numericRefinements","tagRefinements","hierarchicalFacetsRefinements","self","forEach","paramName","isKeyKnown","PARAMETERS","isValueDefined","partialState","numbers","k","parsedValue","parseFloat","insideBoundingBox","map","geoRect","operators","operator","parsedValues","vPrime","make","instance","facet","rootPath","currentRefinement","getHierarchicalRefinement","name","clearRefinements","toggleHierarchicalFacetRefinement","validate","currentState","tagFilters","numericFilters","constructor","patch","_clearNumericRefinements","setQueryParameters","clearTags","setIndex","setQuery","newQuery","query","setPage","newPage","page","setFacets","setDisjunctiveFacets","setHitsPerPage","hitsPerPage","setTypoTolerance","typoTolerance","addNumericRefinement","val","isNumericRefined","getConjunctiveRefinements","facetName","isConjunctiveFacet","getDisjunctiveRefinements","isDisjunctiveFacet","getExcludeRefinements","removeNumericRefinement","number","paramValue","op","getNumericRefinements","getNumericRefinement","newNumericRefinements","operatorList","outValues","addFacet","addDisjunctiveFacet","addHierarchicalFacet","hierarchicalFacet","isHierarchicalFacet","addFacetRefinement","addExcludeRefinement","addDisjunctiveFacetRefinement","addTagRefinement","tag","isTagRefined","modification","removeFacet","removeDisjunctiveFacet","removeHierarchicalFacet","removeFacetRefinement","removeExcludeRefinement","removeDisjunctiveFacetRefinement","removeTagRefinement","t","toggleFacetRefinement","toggleConjunctiveFacetRefinement","toggleDisjunctiveFacetRefinement","toggleExcludeFacetRefinement","separator","_getHierarchicalFacetSeparator","getHierarchicalFacetByName","lastIndexOf","addHierarchicalFacetRefinement","path","isHierarchicalFacetRefined","removeHierarchicalFacetRefinement","toggleTagRefinement","isFacetRefined","isExcludeRefined","isDisjunctiveFacetRefined","refinements","isOperatorDefined","array","searchedValue","isAttributeValueDefined","currentValue","getRefinedDisjunctiveFacets","disjunctiveNumericRefinedFacets","getRefinedHierarchicalFacets","sort","getUnrefinedDisjunctiveFacets","refinedFacets","managedParameters","getQueryParams","queryParams","setQueryParameter","parameter","nextWithNumbers","previousPlainObject","acc","nextPlainObject","previous","isPreviousValueDefined","isNextValueDefined","resetPage","_getHierarchicalFacetSortBy","sortBy","_getHierarchicalRootPath","_getHierarchicalShowParentLevel","showParentLevel","hierarchicalFacetName","getHierarchicalFacetBreadcrumb","refinement","split","part","trim","toString","JSON","stringify","state","hierarchicalFacetResult","hierarchicalFacetIndex","hierarchicalFacetRefinement","hierarchicalSeparator","hierarchicalRootPath","hierarchicalShowParentLevel","prepareHierarchicalFacetSortBy","rootExhaustive","facetResult","exhaustive","generateTreeFn","hierarchicalTree","currentHierarchicalLevel","parent","level","data","subtree","picked","facetValue","tuple","parentPath","onlyMatchingTree","orderBy","facetCount","parts","escapedValue","escapeFacetValue","count","format","unescapeFacetValue","generateHierarchicalTree","results","fv","compact","findIndex","formatSort","getIndices","attributes","indices","idx","assignFacetStats","dest","facetStats","stats","options","mainSubResponse","_rawResults","processingTimeMS","sum","result","facetsIndices","disjunctiveFacetsIndices","nextDisjunctiveResult","mainFacets","facetKey","hierarchicalAttributeName","facetValueObject","facetIndex","idxAttributeName","exhaustiveFacetsCount","isFacetDisjunctive","isFacetConjunctive","facets_stats","disjunctiveFacet","dfacet","facetResults","attributeIndex","dataFromMainRequest","refinedFacet","defaultData","root","excludes","_state","extractNormalizedFacetValues","predicate","isExcluded","hierarchicalFacetValues","replace","currentRefinementSplit","unshift","setIsRefined","item","depth","child","recSort","sortFn","node","names","children","childNode","sortedChildren","getFacetStatsIfAvailable","getRefinement","attributeName","resultsFacets","getFacetByName","DEFAULT_SORT","getFacetValues","facetValues","facetOrdering","renderingContent","getFacetOrdering","orderedFacets","remainingFacets","reverseOrder","order","ordering","sortRemainingBy","sortViaFacetOrdering","vanillaSortFn","getFacetStats","getRefinements","res","facetDeclaration","rootFacet","intermediateFacet","newFacet","numericValue","requestBuilder","addAlgoliaAgent","setClient","_queryId","_lastQueryIdReceived","derivedHelpers","_currentNbQueries","setCurrentPage","_change","isPageReset","getCurrentPage","search","_search","onlyWithDerivedHelpers","searchOnlyWithDerivedHelpers","getQuery","_getHitsSearchParams","searchOnce","cb","tempState","queries","_getQueries","then","content","_originalResponse","e","catch","findAnswers","derivedHelper","Promise","resolve","derivedState","attributesForPrediction","nbHits","errorMessage","initIndex","queryLanguages","searchForFacetValues","maxFacetHits","userState","clientHasSFFV","clientHasInitIndex","isDisjunctive","algoliaQuery","getSearchForFacetQuery","searchForFacetValuesPromise","indexName","response","facetHits","q","addDisjunctiveRefine","addRefine","addFacetExclusion","addExclude","addTag","removeDisjunctiveRefine","removeRefine","removeFacetExclusion","removeExclude","removeTag","toggleFacetExclusion","toggleExclude","toggleRefine","toggleTag","nextPage","previousPage","setState","newState","overrideStateWithoutTriggeringChangeEvent","hasRefinements","isDisjunctiveRefined","hasTag","hasTagRefinements","getIndex","getPage","getTags","r","states","mainQueries","queriesCount","helper","derivedQueries","derivedStateQueries","queryId","_dispatchAlgoliaResponse","bind","_dispatchAlgoliaError","s","specificResults","containsRefinement","facetFilters","_hasDisjunctiveRefinements","disjunctiveRefinements","event","clearCache","newClient","getClient","derive","pos","hasPendingRequests","reduceRight","source","String","comparator","defaults","defaultInstructions","out","sortInstruction","matchingDefault","defaultInstruction","ctor","superCtor","create","enumerable","writable","configurable","arr1","arr2","isObjectOrArrayOrFunction","_merge","target","hasOwnProperty","sourceVal","targetVal","l","obj","excluded","sourceKeys","compareAscending","other","valIsDefined","valIsNull","othIsDefined","othIsNull","collection","iteratees","orders","criteria","iteratee","object","sortObject","curr","_getDisjunctiveFacetSearchParams","filtersMap","segment","join","hasHierarchicalFacetFilter","some","filteredFacetFilters","facetFilter","filtered","filterValue","_getHitsHierarchicalFacetsAttributes","_getFacetFilters","_getNumericFilters","_getTagFilters","additionalParams","hierarchicalRootLevel","analytics","clickAnalytics","_getDisjunctiveHierarchicalFacetAttribute","vs","orFilters","attributeToRefine","attributesIndex","allAttributes","hierarchicalRefinement","newAttributes","rootLevel","parentLevel","stateForSearchForFacetValues","searchForFacetSearchParameters","facetQuery","test","defineProperty","getOwnPropertySymbols","getOwnPropertyDescriptor","getOwnPropertyDescriptors","defineProperties","o","propertyIsEnumerable","Symbol","iterator","u","next","done","return","from","localStorage","window","parse","getItem","setItem","timeToLive","fromEntries","entries","timestamp","Date","getTime","get","miss","all","set","delete","clear","removeItem","caches","shift","serializable","c","headers","WithinHeaders","queryParameters","WithinQueryParameters","setTimeout","Math","min","d","assign","wait","floor","random","h","p","encodeURIComponent","y","timeout","cacheable","Read","Write","Any","P","O","status","lastUpdate","now","w","protocol","url","accept","I","x","j","D","getTimeout","statelessHosts","S","method","toLowerCase","userAgent","pop","message","transporterStackTrace","E","N","connectTimeout","timeouts","connect","responseTimeout","request","host","triesLeft","onSuccess","onRetry","isTimedOut","logger","info","A","hostsCache","onFail","requester","send","reverse","requestsCache","responsesCache","hosts","read","mappedRequestOptions","transporter","reject","write","T","add","R","charAt","substr","C","U","z","J","F","H","M","B","batch","hits","shouldStop","cursor","K","acl","tt","W","cluster","L","users","Q","clearExistingDictionaryEntries","requests","action","body","jt","taskID","G","operation","destination","ut","methods","waitTask","de","V","scope","he","Rules","_","Settings","X","Synonyms","Y","Z","$","objectID","et","rt","nt","at","ot","it","retrieveMappings","getClusters","appId","st","ct","ft","dt","lt","ht","pt","mt","yt","ue","gt","vt","bt","Pt","Ot","wt","It","xt","Dt","qt","St","se","_highlightResult","kt","ce","Tt","batchSize","taskIDs","objectIDs","Nt","Rt","forwardToReplicas","Et","At","Ct","Ut","zt","le","DeleteObject","Jt","Ft","Ht","Gt","Mt","Bt","paginate","ie","parseInt","nbPages","Kt","Wt","Lt","attributesToRetrieve","Qt","getVersion","Vt","_t","Xt","createIfNotExists","PartialUpdateObject","PartialUpdateObjectNoCreate","Yt","safe","autoGenerateObjectIDIfNotExist","substring","ee","Zt","ne","clearExistingRules","$t","oe","clearExistingSynonyms","te","AddObject","UpdateObject","re","ae","replaceExistingSynonyms","fe","DeleteIndex","ClearIndex","pe","me","ye","ge","threshold","ve","fallbackParameters","model","be","Pe","Oe","we","Ie","xe","apiKey","XMLHttpRequest","open","setRequestHeader","abort","onreadystatechange","readyState","OPENED","clearTimeout","onerror","responseText","onload","debug","region","getPersonalizationStrategy","setPersonalizationStrategy","authMode","multipleBatch","multipleGetObjects","multipleQueries","copyIndex","copySettings","copySynonyms","copyRules","moveIndex","listIndices","getLogs","listClusters","multipleSearchForFacetValues","getApiKey","addApiKey","listApiKeys","updateApiKey","deleteApiKey","restoreApiKey","assignUserID","assignUserIDs","getUserID","searchUserIDs","listUserIDs","getTopUserIDs","removeUserID","hasPendingMappings","clearDictionaryEntries","deleteDictionaryEntries","getDictionarySettings","getAppTask","replaceDictionaryEntries","saveDictionaryEntries","searchDictionaryEntries","setDictionarySettings","waitAppTask","customRequest","getObject","getObjects","saveObject","saveObjects","setSettings","getSettings","partialUpdateObject","partialUpdateObjects","deleteObject","deleteObjects","deleteBy","clearObjects","browseObjects","getObjectPosition","findObject","exists","saveSynonym","saveSynonyms","getSynonym","searchSynonyms","browseSynonyms","deleteSynonym","clearSynonyms","replaceAllObjects","replaceAllSynonyms","searchRules","getRule","deleteRule","saveRule","saveRules","replaceAllRules","browseRules","clearRules","initAnalytics","addABTest","getABTest","getABTests","stopABTest","deleteABTest","initPersonalization","initRecommendation","getRecommendations","getFrequentlyBoughtTogether","getLookingSimilar","getRecommendedForYou","getRelatedProducts","getTrendingFacets","getTrendingItems","DataView","getNative","hashClear","hashDelete","hashGet","hashHas","hashSet","Hash","entry","has","listCacheClear","listCacheDelete","listCacheGet","listCacheHas","listCacheSet","ListCache","Map","mapCacheClear","mapCacheDelete","mapCacheGet","mapCacheHas","mapCacheSet","MapCache","Set","setCacheAdd","setCacheHas","SetCache","__data__","stackClear","stackDelete","stackGet","stackHas","stackSet","Stack","size","Uint8Array","WeakMap","func","thisArg","resIndex","baseIndexOf","baseTimes","isArguments","isBuffer","isIndex","isTypedArray","inherited","isArr","isArg","isBuff","isType","skipIndexes","offset","baseAssignValue","eq","objValue","paths","skip","lower","upper","arrayIncludes","arrayIncludesWith","arrayMap","baseUnary","cacheHas","includes","isCommon","valuesLength","outer","computed","valuesIndex","toInteger","toLength","start","end","fromIndex","fromRight","arrayPush","isFlattenable","baseFlatten","isStrict","castPath","toKey","keysFunc","symbolsFunc","baseFindIndex","baseIsNaN","strictIndexOf","nativeMin","arrays","othLength","othIndex","maxLength","Infinity","seen","cache","baseGetTag","isObjectLike","baseIsEqualDeep","baseIsEqual","bitmask","customizer","stack","equalArrays","equalByTag","equalObjects","getTag","argsTag","arrayTag","objectTag","equalFunc","objIsArr","othIsArr","objTag","othTag","objIsObj","othIsObj","isSameTag","objIsWrapped","othIsWrapped","objUnwrapped","othUnwrapped","matchData","noCustomizer","srcValue","COMPARE_PARTIAL_FLAG","isMasked","toSource","reIsHostCtor","funcProto","Function","objectProto","funcToString","reIsNative","RegExp","isLength","typedArrayTags","baseMatches","baseMatchesProperty","identity","property","isPrototype","nativeKeys","baseIsMatch","getMatchData","matchesStrictComparable","hasIn","isKey","isStrictComparable","baseGet","baseIndexOfWith","copyArray","baseUnset","indexes","lastIndex","overRest","setToString","assignValue","nested","newValue","constant","baseSetToString","string","baseSortedIndexBy","isSymbol","retHighest","low","high","MAX_ARRAY_LENGTH","mid","nativeFloor","valIsNaN","valIsSymbol","valIsUndefined","othIsReflexive","othIsSymbol","setLow","symbolProto","symbolToString","baseToString","trimmedEndIndex","reTrimStart","createSet","setToArray","seenIndex","last","baseSlice","isDrop","baseDifference","baseUniq","props","assignFunc","valsLength","isArrayLikeObject","stringToPath","valIsReflexive","coreJsData","noop","arraySome","isPartial","arrLength","arrStacked","othStacked","arrValue","othValue","compared","mapToArray","symbolValueOf","valueOf","byteLength","byteOffset","buffer","convert","stacked","getAllKeys","objProps","objLength","objStacked","skipCtor","objCtor","othCtor","flatten","baseGetAllKeys","getSymbols","isKeyable","baseIsNative","getValue","arrayFilter","stubArray","nativeGetSymbols","symbol","mapTag","promiseTag","setTag","weakMapTag","dataViewTag","dataViewCtorString","mapCtorString","promiseCtorString","setCtorString","weakMapCtorString","ArrayBuffer","Ctor","ctorString","hasFunc","nativeCreate","spreadableSymbol","isConcatSpreadable","reIsUint","isArrayLike","reIsDeepProp","reIsPlainProp","uid","maskSrcKey","exec","IE_PROTO","assocIndexOf","getMapData","memoize","overArg","freeGlobal","freeExports","nodeType","freeModule","freeProcess","process","nodeUtil","types","require","binding","transform","nativeMax","max","otherArgs","shortOut","nativeNow","lastCalled","stamp","remaining","pairs","LARGE_ARRAY_SIZE","memoizeCapped","rePropName","reEscapeChar","charCodeAt","match","quote","subString","reWhitespace","isIterateeCall","nativeCeil","ceil","guard","baseRest","difference","baseIteratee","differenceBy","differenceWith","baseWhile","baseFill","INFINITY","pair","defaultValue","baseHasIn","hasPath","baseIntersection","castArrayLikeObject","mapped","intersectionBy","intersectionWith","baseIsArguments","stubFalse","Buffer","baseIsTypedArray","nodeIsTypedArray","nativeJoin","arrayLikeKeys","baseKeys","strictLastIndexOf","resolver","memoized","Cache","baseNth","baseProperty","basePropertyDeep","pull","basePullAll","baseAt","basePullAt","flatRest","pullAt","nativeReverse","baseSortedIndex","baseSortedUniq","toNumber","toFinite","remainder","baseClamp","baseTrim","reIsBadHex","reIsBinary","reIsOctal","freeParseInt","isBinary","union","unionBy","unionWith","group","unzip","without","baseXor","xor","xorBy","xorWith","zip","baseZipObject","baseSet","unzipWith","zipWith","pluralRules","singularRules","uncountables","irregularPlurals","irregularSingles","sanitizeRule","rule","restoreCase","word","token","toUpperCase","interpolate","str","sanitizeWord","rules","replaceWord","replaceMap","keepMap","checkWord","bool","pluralize","inclusive","singular","plural","isPlural","isSingular","addPluralRule","replacement","addSingularRule","addUncountableRule","addIrregularRule","single","hasElementType","Element","hasMap","hasSet","hasArrayBuffer","isView","equal","flags","$$typeof","_typeof","ownKeys","enumerableOnly","symbols","sym","_objectSpread","_defineProperty","input","hint","prim","toPrimitive","Number","_toPrimitive","_toPropertyKey","displayName","$$type","propTypes","transformItems","getProvidedProps","searchState","searchResults","metadata","items","meta","clearsQuery","id","transformedItems","canRefine","refine","ais","contextValue","multiIndexContext","indexContextValue","hitsWithPositions","queryID","getSearchParameters","searchParameters","namespace","getId","getCurrentRefinement","selectedValue","getLimit","_ref","showMore","limit","showMoreLimit","_refine","nextRefinement","nextValue","isRequired","defaultRefinement","searchable","defaultProps","searchForFacetValuesResults","isFromSearch","label","highlighted","cleanUp","_cleanUp","addKey","addRefinementKey","maxValuesPerFacet","getMetadata","nextState","nextSelectedItems","isSearchStalled","allSearchResults","searching","searchingForFacetValues","instantSearchContext","createContext","onInternalStateUpdate","createHrefForState","onSearchForFacetValues","onSearchStateChange","onSearchParameters","store","widgetsManager","mainTargetedIndex","InstantSearchConsumer","Consumer","InstantSearchProvider","Provider","_createContext","IndexConsumer","_excluded","_extends","_objectWithoutProperties","_objectWithoutPropertiesLoose","sourceSymbolKeys","_defineProperties","descriptor","_setPrototypeOf","setPrototypeOf","__proto__","_createSuper","Derived","hasNativeReflectConstruct","Reflect","construct","sham","Proxy","_isNativeReflectConstruct","Super","_getPrototypeOf","NewTarget","_assertThisInitialized","_possibleConstructorReturn","ReferenceError","getPrototypeOf","createConnectorWithoutContext","connectorDesc","isWidget","transitionState","Composed","additionalWidgetProperties","Connector","_Component","subClass","superClass","_inherits","Constructor","protoProps","staticProps","_super","_this","_classCallCheck","providedProps","_len","_key","getState","widgets","_ref2","_len2","_key2","_ref3","_len3","_key3","_this2","cleanupTimerRef","unsubscribe","subscribe","isUnmounting","unregisterWidget","registerWidget","nextProps","shouldComponentUpdate","propsEqual","prevProps","update","_this3","_this$props$contextVa","resultsFacetValues","nextWidgetsState","prevWidgetsState","_this$props","refineProps","createURL","searchForFacetValuesProps","searchForItems","Component","$$widgetType","getIndexId","hasMultipleIndices","targetedIndex","getResults","indexId","refineValue","_objectSpread4","refineMultiIndexWithNamespace","refineMultiIndex","refineSingleIndexWithNamespace","refineSingleIndex","getNamespaceAndAttributeName","getCurrentRefinementValue","_getNamespaceAndAttri","multiIndex","hasRefinementsValue","cleanUpValue","_getNamespaceAndAttri2","_ref4","indexSearchState","cleanUpValueWithMultiIndex","cleanUpValueWithSingleIndex","withKeysPropType","propName","componentName","prop","_i","_Object$keys","translatable","defaultTranslations","Translatable","translations","translation","translate","hasOwn","shallowEqual","objA","objB","keysA","keysB","getDisplayName","resolved","defer","removeEmptyKey","isPlainObject","addAbsolutePositions","hit","__position","addQueryID","__queryID","HIGHLIGHT_TAGS","highlightPreTag","highlightPostTag","_excluded2","_excluded3","addAlgoliaAgents","searchClient","isMultiIndexContext","widget","isTargetedIndexEqualIndex","isIndexWidget","isIndexWidgetEqualIndex","sortIndexWidgetsFirst","firstWidget","secondWidget","isFirstWidgetIndex","isSecondWidgetIndex","serializeQueryParameters","encode","createInstantSearchManager","_ref$initialState","initialState","resultsState","stalledSearchDelay","stalledSearchTimer","_store$getState","handleSearchSuccess","handleSearchError","searchCounter","initialSearchParameters","onWidgetsUpdate","scheduled","scheduleUpdate","getWidgets","createWidgetsManager","_cacheHydrated","_useCache","baseMethod","methodArgs","requestsWithSerializedParams","rawResults","hydrateSearchClientWithMultiIndexRequest","hydrateSearchClientWithSingleIndexRequest","hydrateSearchClient","createStore","hydrateMetadata","_internalIndexId","hydrateResultsState","sharedParameters","mainParameters","targetedIndexEqualMainIndex","subIndexEqualMainIndex","derivedIndices","targetedIndexNotEqualMainIndex","subIndexNotEqualMainIndex","derivedParameters","_getSearchParameters","isDerivedHelpersEmpty","nextIsSearchStalled","getWidgetsIds","_ref5","_ref5$maxFacetHits","maxFacetHitsWithinRange","_objectSpread7","onExternalStateUpdate","nextSearchState","updateClient","updateIndex","newIndex","skipSearch","datum","nestedItem","injectMetadata","payloadContainer","document","createElement","refNode","querySelector","payload","internalProps","widgetsPayload","_connectorDesc","_ref2$defaultProps","_ref2$displayName","ua","_ua","getMetadataPayload","appendChild","isControlled","InstantSearch","instantSearchManager","onWidgetsInternalStateUpdate","prevState","nextIsControlled","previousSearchState","prevIsControlled","refresh","navigator","getKnownKeys","_searchState","widgetsCollector","_searchState2","Children","_toConsumableArray","arr","_arrayLikeToArray","_arrayWithoutHoles","iter","_iterableToArray","minLen","_unsupportedIterableToArray","_nonIterableSpread","createClassNames","block","prefix","elements","suitElements","element","baseClassName","isSpecialClick","isMiddleClick","button","altKey","ctrlKey","metaKey","shiftKey","capitalize","range","_ref$start","_ref$step","step","limitStep","arrayLength","round","current","createConnector","Link","onClick","preventDefault","LinkList","cx","onSelect","className","selected","disabled","modifier","ariaLabel","href","getPages","currentPage","maxPages","padding","calculateSize","paddingLeft","calculatePaddingLeft","first","Pagination","translationKey","totalPages","_this$props2","ListComponent","listComponent","showFirst","showPrevious","showNext","showLast","otherProps","lastPage","ariaPrevious","ariaNext","ariaFirst","ariaLast","ariaPage","PanelConsumer","PanelProvider","Panel","nextCanRefine","header","footer","setCanRefine","PanelCallbackHandler","PanelWrapper","connectPagination","areHitsSorted","appliedRelevancyStrictness","nbSortedHits","Stats","_ref$className","connectStats","ms","nSorted","toLocaleString","classNames","classes","appendClass","parseValue","newClass","default"],"sourceRoot":""}