@stigg/js-client-sdk 0.20.0

package/dist/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","mappings":";CAAA,SAA2CA,EAAMC,GAC1B,iBAAZC,SAA0C,iBAAXC,OACxCA,OAAOD,QAAUD,IACQ,mBAAXG,QAAyBA,OAAOC,IAC9CD,OAAO,QAAS,GAAIH,GACM,iBAAZC,QACdA,QAAe,MAAID,IAEnBD,EAAY,MAAIC,IARlB,CASGK,MAAM,WACT,sCCVA,IAAIC,EAAyB,oBAATD,KAAuBA,KAAOE,KAC9CC,EAAW,WACf,SAASC,IACTF,KAAKG,OAAQ,EACbH,KAAKI,aAAeL,EAAOK,aAG3B,OADAF,EAAEG,UAAYN,EACP,IAAIG,EANI,IAQf,SAAUJ,IAEQ,SAAUJ,GAE1B,IAAIY,EACY,oBAAqBR,EADjCQ,EAEQ,WAAYR,GAAQ,aAAcS,OAF1CD,EAIA,eAAgBR,GAChB,SAAUA,GACV,WACE,IAEE,OADA,IAAIU,MACG,EACP,MAAOC,GACP,OAAO,GALX,GANAH,EAcQ,aAAcR,EAdtBQ,EAeW,gBAAiBR,EAOhC,GAAIQ,EACF,IAAII,EAAc,CAChB,qBACA,sBACA,6BACA,sBACA,uBACA,sBACA,uBACA,wBACA,yBAGEC,EACFC,YAAYC,QACZ,SAASC,GACP,OAAOA,GAAOJ,EAAYK,QAAQC,OAAOX,UAAUY,SAASC,KAAKJ,KAAS,GAIhF,SAASK,EAAcC,GAIrB,GAHoB,iBAATA,IACTA,EAAOC,OAAOD,IAEZ,4BAA4BE,KAAKF,GACnC,MAAM,IAAIG,UAAU,0CAEtB,OAAOH,EAAKI,cAGd,SAASC,EAAeC,GAItB,MAHqB,iBAAVA,IACTA,EAAQL,OAAOK,IAEVA,EAIT,SAASC,EAAYC,GACnB,IAAIC,EAAW,CACbC,KAAM,WACJ,IAAIJ,EAAQE,EAAMG,QAClB,MAAO,CAACC,UAAgBC,IAAVP,EAAqBA,MAAOA,KAU9C,OANIpB,IACFuB,EAAStB,OAAOsB,UAAY,WAC1B,OAAOA,IAIJA,EAGT,SAASK,EAAQC,GACfnC,KAAKoC,IAAM,GAEPD,aAAmBD,EACrBC,EAAQE,SAAQ,SAASX,EAAON,GAC9BpB,KAAKsC,OAAOlB,EAAMM,KACjB1B,MACMuC,MAAMC,QAAQL,GACvBA,EAAQE,SAAQ,SAASI,GACvBzC,KAAKsC,OAAOG,EAAO,GAAIA,EAAO,MAC7BzC,MACMmC,GACTnB,OAAO0B,oBAAoBP,GAASE,SAAQ,SAASjB,GACnDpB,KAAKsC,OAAOlB,EAAMe,EAAQf,MACzBpB,MAgEP,SAAS2C,EAASC,GAChB,GAAIA,EAAKC,SACP,OAAOC,QAAQC,OAAO,IAAIxB,UAAU,iBAEtCqB,EAAKC,UAAW,EAGlB,SAASG,EAAgBC,GACvB,OAAO,IAAIH,SAAQ,SAASI,EAASH,GACnCE,EAAOE,OAAS,WACdD,EAAQD,EAAOG,SAEjBH,EAAOI,QAAU,WACfN,EAAOE,EAAOK,WAKpB,SAASC,EAAsBC,GAC7B,IAAIP,EAAS,IAAIQ,WACbC,EAAUV,EAAgBC,GAE9B,OADAA,EAAOU,kBAAkBH,GAClBE,EAoBT,SAASE,EAAYC,GACnB,GAAIA,EAAIC,MACN,OAAOD,EAAIC,MAAM,GAEjB,IAAIC,EAAO,IAAIC,WAAWH,EAAII,YAE9B,OADAF,EAAKG,IAAI,IAAIF,WAAWH,IACjBE,EAAKI,OAIhB,SAASC,IA0FP,OAzFApE,KAAK6C,UAAW,EAEhB7C,KAAKqE,UAAY,SAASzB,GAhM5B,IAAoB9B,EAiMhBd,KAAKsE,UAAY1B,EACZA,EAEsB,iBAATA,EAChB5C,KAAKuE,UAAY3B,EACRtC,GAAgBE,KAAKH,UAAUmE,cAAc5B,GACtD5C,KAAKyE,UAAY7B,EACRtC,GAAoBoE,SAASrE,UAAUmE,cAAc5B,GAC9D5C,KAAK2E,cAAgB/B,EACZtC,GAAwBsE,gBAAgBvE,UAAUmE,cAAc5B,GACzE5C,KAAKuE,UAAY3B,EAAK3B,WACbX,GAAuBA,IA5MlBQ,EA4M6C8B,IA3MjDiC,SAASxE,UAAUmE,cAAc1D,IA4M3Cd,KAAK8E,iBAAmBlB,EAAYhB,EAAKuB,QAEzCnE,KAAKsE,UAAY,IAAI9D,KAAK,CAACR,KAAK8E,oBACvBxE,IAAwBM,YAAYP,UAAUmE,cAAc5B,IAASjC,EAAkBiC,IAChG5C,KAAK8E,iBAAmBlB,EAAYhB,GAEpC5C,KAAKuE,UAAY3B,EAAO5B,OAAOX,UAAUY,SAASC,KAAK0B,GAhBvD5C,KAAKuE,UAAY,GAmBdvE,KAAKmC,QAAQ4C,IAAI,kBACA,iBAATnC,EACT5C,KAAKmC,QAAQ+B,IAAI,eAAgB,4BACxBlE,KAAKyE,WAAazE,KAAKyE,UAAUO,KAC1ChF,KAAKmC,QAAQ+B,IAAI,eAAgBlE,KAAKyE,UAAUO,MACvC1E,GAAwBsE,gBAAgBvE,UAAUmE,cAAc5B,IACzE5C,KAAKmC,QAAQ+B,IAAI,eAAgB,qDAKnC5D,IACFN,KAAKwD,KAAO,WACV,IAAIyB,EAAWtC,EAAS3C,MACxB,GAAIiF,EACF,OAAOA,EAGT,GAAIjF,KAAKyE,UACP,OAAO3B,QAAQI,QAAQlD,KAAKyE,WACvB,GAAIzE,KAAK8E,iBACd,OAAOhC,QAAQI,QAAQ,IAAI1C,KAAK,CAACR,KAAK8E,oBACjC,GAAI9E,KAAK2E,cACd,MAAM,IAAIO,MAAM,wCAEhB,OAAOpC,QAAQI,QAAQ,IAAI1C,KAAK,CAACR,KAAKuE,cAI1CvE,KAAKmF,YAAc,WACjB,OAAInF,KAAK8E,iBACAnC,EAAS3C,OAAS8C,QAAQI,QAAQlD,KAAK8E,kBAEvC9E,KAAKwD,OAAO4B,KAAK7B,KAK9BvD,KAAKqF,KAAO,WACV,IA3FoB7B,EAClBP,EACAS,EAyFEuB,EAAWtC,EAAS3C,MACxB,GAAIiF,EACF,OAAOA,EAGT,GAAIjF,KAAKyE,UACP,OAjGkBjB,EAiGIxD,KAAKyE,UA/F3Bf,EAAUV,EADVC,EAAS,IAAIQ,YAEjBR,EAAOqC,WAAW9B,GACXE,EA8FE,GAAI1D,KAAK8E,iBACd,OAAOhC,QAAQI,QA5FrB,SAA+BW,GAI7B,IAHA,IAAIE,EAAO,IAAIC,WAAWH,GACtB0B,EAAQ,IAAIhD,MAAMwB,EAAKyB,QAElBC,EAAI,EAAGA,EAAI1B,EAAKyB,OAAQC,IAC/BF,EAAME,GAAKpE,OAAOqE,aAAa3B,EAAK0B,IAEtC,OAAOF,EAAMI,KAAK,IAqFSC,CAAsB5F,KAAK8E,mBAC7C,GAAI9E,KAAK2E,cACd,MAAM,IAAIO,MAAM,wCAEhB,OAAOpC,QAAQI,QAAQlD,KAAKuE,YAI5BjE,IACFN,KAAK6F,SAAW,WACd,OAAO7F,KAAKqF,OAAOD,KAAKU,KAI5B9F,KAAK+F,KAAO,WACV,OAAO/F,KAAKqF,OAAOD,KAAKY,KAAKC,QAGxBjG,KA1MTkC,EAAQ7B,UAAUiC,OAAS,SAASlB,EAAMM,GACxCN,EAAOD,EAAcC,GACrBM,EAAQD,EAAeC,GACvB,IAAIwE,EAAWlG,KAAKoC,IAAIhB,GACxBpB,KAAKoC,IAAIhB,GAAQ8E,EAAWA,EAAW,KAAOxE,EAAQA,GAGxDQ,EAAQ7B,UAAkB,OAAI,SAASe,UAC9BpB,KAAKoC,IAAIjB,EAAcC,KAGhCc,EAAQ7B,UAAU0E,IAAM,SAAS3D,GAE/B,OADAA,EAAOD,EAAcC,GACdpB,KAAKmG,IAAI/E,GAAQpB,KAAKoC,IAAIhB,GAAQ,MAG3Cc,EAAQ7B,UAAU8F,IAAM,SAAS/E,GAC/B,OAAOpB,KAAKoC,IAAIgE,eAAejF,EAAcC,KAG/Cc,EAAQ7B,UAAU6D,IAAM,SAAS9C,EAAMM,GACrC1B,KAAKoC,IAAIjB,EAAcC,IAASK,EAAeC,IAGjDQ,EAAQ7B,UAAUgC,QAAU,SAASgE,EAAUC,GAC7C,IAAK,IAAIlF,KAAQpB,KAAKoC,IAChBpC,KAAKoC,IAAIgE,eAAehF,IAC1BiF,EAASnF,KAAKoF,EAAStG,KAAKoC,IAAIhB,GAAOA,EAAMpB,OAKnDkC,EAAQ7B,UAAUkG,KAAO,WACvB,IAAI3E,EAAQ,GAIZ,OAHA5B,KAAKqC,SAAQ,SAASX,EAAON,GAC3BQ,EAAM4E,KAAKpF,MAENO,EAAYC,IAGrBM,EAAQ7B,UAAUoG,OAAS,WACzB,IAAI7E,EAAQ,GAIZ,OAHA5B,KAAKqC,SAAQ,SAASX,GACpBE,EAAM4E,KAAK9E,MAENC,EAAYC,IAGrBM,EAAQ7B,UAAUqG,QAAU,WAC1B,IAAI9E,EAAQ,GAIZ,OAHA5B,KAAKqC,SAAQ,SAASX,EAAON,GAC3BQ,EAAM4E,KAAK,CAACpF,EAAMM,OAEbC,EAAYC,IAGjBtB,IACF4B,EAAQ7B,UAAUE,OAAOsB,UAAYK,EAAQ7B,UAAUqG,SAqJzD,IAAIC,EAAU,CAAC,SAAU,MAAO,OAAQ,UAAW,OAAQ,OAO3D,SAASC,EAAQC,EAAOC,GAEtB,IAPuBC,EACnBC,EAMApE,GADJkE,EAAUA,GAAW,IACFlE,KAEnB,GAAIiE,aAAiBD,EAAS,CAC5B,GAAIC,EAAMhE,SACR,MAAM,IAAItB,UAAU,gBAEtBvB,KAAKiH,IAAMJ,EAAMI,IACjBjH,KAAKkH,YAAcL,EAAMK,YACpBJ,EAAQ3E,UACXnC,KAAKmC,QAAU,IAAID,EAAQ2E,EAAM1E,UAEnCnC,KAAK+G,OAASF,EAAME,OACpB/G,KAAKmH,KAAON,EAAMM,KAClBnH,KAAKoH,OAASP,EAAMO,OACfxE,GAA2B,MAAnBiE,EAAMvC,YACjB1B,EAAOiE,EAAMvC,UACbuC,EAAMhE,UAAW,QAGnB7C,KAAKiH,IAAM5F,OAAOwF,GAYpB,GATA7G,KAAKkH,YAAcJ,EAAQI,aAAelH,KAAKkH,aAAe,eAC1DJ,EAAQ3E,SAAYnC,KAAKmC,UAC3BnC,KAAKmC,QAAU,IAAID,EAAQ4E,EAAQ3E,UAErCnC,KAAK+G,QAhCDC,GADmBD,EAiCOD,EAAQC,QAAU/G,KAAK+G,QAAU,OAhC1CM,cACdV,EAAQ5F,QAAQiG,IAAY,EAAIA,EAAUD,GAgCjD/G,KAAKmH,KAAOL,EAAQK,MAAQnH,KAAKmH,MAAQ,KACzCnH,KAAKoH,OAASN,EAAQM,QAAUpH,KAAKoH,OACrCpH,KAAKsH,SAAW,MAEK,QAAhBtH,KAAK+G,QAAoC,SAAhB/G,KAAK+G,SAAsBnE,EACvD,MAAM,IAAIrB,UAAU,6CAEtBvB,KAAKqE,UAAUzB,GAOjB,SAASkD,EAAOlD,GACd,IAAI2E,EAAO,IAAI7C,SAYf,OAXA9B,EACG4E,OACAC,MAAM,KACNpF,SAAQ,SAASqF,GAChB,GAAIA,EAAO,CACT,IAAID,EAAQC,EAAMD,MAAM,KACpBrG,EAAOqG,EAAM1F,QAAQ4F,QAAQ,MAAO,KACpCjG,EAAQ+F,EAAM9B,KAAK,KAAKgC,QAAQ,MAAO,KAC3CJ,EAAKjF,OAAOsF,mBAAmBxG,GAAOwG,mBAAmBlG,QAGxD6F,EAqBT,SAASM,EAASC,EAAUhB,GACrBA,IACHA,EAAU,IAGZ9G,KAAKgF,KAAO,UACZhF,KAAK+H,YAA4B9F,IAAnB6E,EAAQiB,OAAuB,IAAMjB,EAAQiB,OAC3D/H,KAAKgI,GAAKhI,KAAK+H,QAAU,KAAO/H,KAAK+H,OAAS,IAC9C/H,KAAKiI,WAAa,eAAgBnB,EAAUA,EAAQmB,WAAa,KACjEjI,KAAKmC,QAAU,IAAID,EAAQ4E,EAAQ3E,SACnCnC,KAAKiH,IAAMH,EAAQG,KAAO,GAC1BjH,KAAKqE,UAAUyD,GAjDjBlB,EAAQvG,UAAU6H,MAAQ,WACxB,OAAO,IAAItB,EAAQ5G,KAAM,CAAC4C,KAAM5C,KAAKsE,aAmCvCF,EAAKlD,KAAK0F,EAAQvG,WAgBlB+D,EAAKlD,KAAK2G,EAASxH,WAEnBwH,EAASxH,UAAU6H,MAAQ,WACzB,OAAO,IAAIL,EAAS7H,KAAKsE,UAAW,CAClCyD,OAAQ/H,KAAK+H,OACbE,WAAYjI,KAAKiI,WACjB9F,QAAS,IAAID,EAAQlC,KAAKmC,SAC1B8E,IAAKjH,KAAKiH,OAIdY,EAASvE,MAAQ,WACf,IAAI6E,EAAW,IAAIN,EAAS,KAAM,CAACE,OAAQ,EAAGE,WAAY,KAE1D,OADAE,EAASnD,KAAO,QACTmD,GAGT,IAAIC,EAAmB,CAAC,IAAK,IAAK,IAAK,IAAK,KAE5CP,EAASQ,SAAW,SAASpB,EAAKc,GAChC,IAA0C,IAAtCK,EAAiBrH,QAAQgH,GAC3B,MAAM,IAAIO,WAAW,uBAGvB,OAAO,IAAIT,EAAS,KAAM,CAACE,OAAQA,EAAQ5F,QAAS,CAACoG,SAAUtB,MAGjEvH,EAAQU,aAAeN,EAAKM,aAC5B,IACE,IAAIV,EAAQU,aACZ,MAAOoI,GACP9I,EAAQU,aAAe,SAASqI,EAASrH,GACvCpB,KAAKyI,QAAUA,EACfzI,KAAKoB,KAAOA,EACZ,IAAIkC,EAAQ4B,MAAMuD,GAClBzI,KAAK0I,MAAQpF,EAAMoF,OAErBhJ,EAAQU,aAAaC,UAAYW,OAAO2H,OAAOzD,MAAM7E,WACrDX,EAAQU,aAAaC,UAAUuI,YAAclJ,EAAQU,aAGvD,SAASD,EAAM0G,EAAOgC,GACpB,OAAO,IAAI/F,SAAQ,SAASI,EAASH,GACnC,IAAI+F,EAAU,IAAIlC,EAAQC,EAAOgC,GAEjC,GAAIC,EAAQ1B,QAAU0B,EAAQ1B,OAAO2B,QACnC,OAAOhG,EAAO,IAAIrD,EAAQU,aAAa,UAAW,eAGpD,IAAI4I,EAAM,IAAIC,eAEd,SAASC,IACPF,EAAIG,QAGNH,EAAI7F,OAAS,WACX,IAxFgBiG,EAChBjH,EAuFI2E,EAAU,CACZiB,OAAQiB,EAAIjB,OACZE,WAAYe,EAAIf,WAChB9F,SA3FciH,EA2FQJ,EAAIK,yBAA2B,GA1FvDlH,EAAU,IAAID,EAGQkH,EAAWzB,QAAQ,eAAgB,KACzCF,MAAM,SAASpF,SAAQ,SAASiH,GAClD,IAAIC,EAAQD,EAAK7B,MAAM,KACnB+B,EAAMD,EAAMxH,QAAQyF,OACxB,GAAIgC,EAAK,CACP,IAAI9H,EAAQ6H,EAAM5D,KAAK,KAAK6B,OAC5BrF,EAAQG,OAAOkH,EAAK9H,OAGjBS,IAgFH2E,EAAQG,IAAM,gBAAiB+B,EAAMA,EAAIS,YAAc3C,EAAQ3E,QAAQ4C,IAAI,iBAC3E,IAAInC,EAAO,aAAcoG,EAAMA,EAAIb,SAAWa,EAAIU,aAClDxG,EAAQ,IAAI2E,EAASjF,EAAMkE,KAG7BkC,EAAI3F,QAAU,WACZN,EAAO,IAAIxB,UAAU,4BAGvByH,EAAIW,UAAY,WACd5G,EAAO,IAAIxB,UAAU,4BAGvByH,EAAIY,QAAU,WACZ7G,EAAO,IAAIrD,EAAQU,aAAa,UAAW,gBAG7C4I,EAAIa,KAAKf,EAAQ/B,OAAQ+B,EAAQ7B,KAAK,GAEV,YAAxB6B,EAAQ5B,YACV8B,EAAIc,iBAAkB,EACW,SAAxBhB,EAAQ5B,cACjB8B,EAAIc,iBAAkB,GAGpB,iBAAkBd,GAAO1I,IAC3B0I,EAAIe,aAAe,QAGrBjB,EAAQ3G,QAAQE,SAAQ,SAASX,EAAON,GACtC4H,EAAIgB,iBAAiB5I,EAAMM,MAGzBoH,EAAQ1B,SACV0B,EAAQ1B,OAAO6C,iBAAiB,QAASf,GAEzCF,EAAIkB,mBAAqB,WAEA,IAAnBlB,EAAImB,YACNrB,EAAQ1B,OAAOgD,oBAAoB,QAASlB,KAKlDF,EAAIqB,UAAkC,IAAtBvB,EAAQxE,UAA4B,KAAOwE,EAAQxE,cAIvEnE,EAAMmK,UAAW,EAEZxK,EAAKK,QACRL,EAAKK,MAAQA,EACbL,EAAKoC,QAAUA,EACfpC,EAAK8G,QAAUA,EACf9G,EAAK+H,SAAWA,GAGlBnI,EAAQwC,QAAUA,EAClBxC,EAAQkH,QAAUA,EAClBlH,EAAQmI,SAAWA,EACnBnI,EAAQS,MAAQA,EAEhBa,OAAOuJ,eAAe7K,EAAS,aAAc,CAAEgC,OAAO,IA5gBvC,CAghBf,IAlhBF,CAmhBGzB,GACHA,EAASE,MAAMqK,UAAW,SAEnBvK,EAASE,MAAMmK,SAGtB,IAAIG,EAAMxK,GACVP,EAAU+K,EAAItK,OACd,QAAkBsK,EAAItK,MACtBT,EAAQS,MAAQsK,EAAItK,MACpBT,EAAQwC,QAAUuI,EAAIvI,QACtBxC,EAAQkH,QAAU6D,EAAI7D,QACtBlH,EAAQmI,SAAW4C,EAAI5C,SACvBlI,EAAOD,QAAUA,kBCziBjB,IAIImF,EAJY,EAAQ,IAIT6F,CAHJ,EAAQ,MAGY,YAE/B/K,EAAOD,QAAUmF,kBCNjB,IAAI8F,EAAY,EAAQ,MACpBC,EAAa,EAAQ,KACrBC,EAAU,EAAQ,MAClBC,EAAU,EAAQ,MAClBC,EAAU,EAAQ,MAStB,SAASC,EAAKtE,GACZ,IAAIuE,GAAS,EACTzF,EAAoB,MAAXkB,EAAkB,EAAIA,EAAQlB,OAG3C,IADAxF,KAAKkL,UACID,EAAQzF,GAAQ,CACvB,IAAI2F,EAAQzE,EAAQuE,GACpBjL,KAAKkE,IAAIiH,EAAM,GAAIA,EAAM,KAK7BH,EAAK3K,UAAU6K,MAAQP,EACvBK,EAAK3K,UAAkB,OAAIuK,EAC3BI,EAAK3K,UAAU0E,IAAM8F,EACrBG,EAAK3K,UAAU8F,IAAM2E,EACrBE,EAAK3K,UAAU6D,IAAM6G,EAErBpL,EAAOD,QAAUsL,kBC/BjB,IAAII,EAAiB,EAAQ,MACzBC,EAAkB,EAAQ,MAC1BC,EAAe,EAAQ,MACvBC,EAAe,EAAQ,MACvBC,EAAe,EAAQ,MAS3B,SAASC,EAAU/E,GACjB,IAAIuE,GAAS,EACTzF,EAAoB,MAAXkB,EAAkB,EAAIA,EAAQlB,OAG3C,IADAxF,KAAKkL,UACID,EAAQzF,GAAQ,CACvB,IAAI2F,EAAQzE,EAAQuE,GACpBjL,KAAKkE,IAAIiH,EAAM,GAAIA,EAAM,KAK7BM,EAAUpL,UAAU6K,MAAQE,EAC5BK,EAAUpL,UAAkB,OAAIgL,EAChCI,EAAUpL,UAAU0E,IAAMuG,EAC1BG,EAAUpL,UAAU8F,IAAMoF,EAC1BE,EAAUpL,UAAU6D,IAAMsH,EAE1B7L,EAAOD,QAAU+L,kBC/BjB,IAIIC,EAJY,EAAQ,IAIdhB,CAHC,EAAQ,MAGO,OAE1B/K,EAAOD,QAAUgM,kBCNjB,IAAIC,EAAgB,EAAQ,MACxBC,EAAiB,EAAQ,MACzBC,EAAc,EAAQ,KACtBC,EAAc,EAAQ,MACtBC,EAAc,EAAQ,MAS1B,SAASC,EAAStF,GAChB,IAAIuE,GAAS,EACTzF,EAAoB,MAAXkB,EAAkB,EAAIA,EAAQlB,OAG3C,IADAxF,KAAKkL,UACID,EAAQzF,GAAQ,CACvB,IAAI2F,EAAQzE,EAAQuE,GACpBjL,KAAKkE,IAAIiH,EAAM,GAAIA,EAAM,KAK7Ba,EAAS3L,UAAU6K,MAAQS,EAC3BK,EAAS3L,UAAkB,OAAIuL,EAC/BI,EAAS3L,UAAU0E,IAAM8G,EACzBG,EAAS3L,UAAU8F,IAAM2F,EACzBE,EAAS3L,UAAU6D,IAAM6H,EAEzBpM,EAAOD,QAAUsM,kBC/BjB,IAIIlJ,EAJY,EAAQ,IAIV4H,CAHH,EAAQ,MAGW,WAE9B/K,EAAOD,QAAUoD,kBCNjB,IAIImJ,EAJY,EAAQ,IAIdvB,CAHC,EAAQ,MAGO,OAE1B/K,EAAOD,QAAUuM,kBCNjB,IAAID,EAAW,EAAQ,MACnBE,EAAc,EAAQ,KACtBC,EAAc,EAAQ,MAU1B,SAASC,EAAS3F,GAChB,IAAIwE,GAAS,EACTzF,EAAmB,MAAViB,EAAiB,EAAIA,EAAOjB,OAGzC,IADAxF,KAAKqM,SAAW,IAAIL,IACXf,EAAQzF,GACfxF,KAAKsM,IAAI7F,EAAOwE,IAKpBmB,EAAS/L,UAAUiM,IAAMF,EAAS/L,UAAUmG,KAAO0F,EACnDE,EAAS/L,UAAU8F,IAAMgG,EAEzBxM,EAAOD,QAAU0M,kBC1BjB,IAAIX,EAAY,EAAQ,MACpBc,EAAa,EAAQ,MACrBC,EAAc,EAAQ,MACtBC,EAAW,EAAQ,MACnBC,EAAW,EAAQ,MACnBC,EAAW,EAAQ,MASvB,SAASC,EAAMlG,GACb,IAAImG,EAAO7M,KAAKqM,SAAW,IAAIZ,EAAU/E,GACzC1G,KAAK8M,KAAOD,EAAKC,KAInBF,EAAMvM,UAAU6K,MAAQqB,EACxBK,EAAMvM,UAAkB,OAAImM,EAC5BI,EAAMvM,UAAU0E,IAAM0H,EACtBG,EAAMvM,UAAU8F,IAAMuG,EACtBE,EAAMvM,UAAU6D,IAAMyI,EAEtBhN,EAAOD,QAAUkN,kBC1BjB,IAGIrM,EAHO,EAAQ,MAGDA,OAElBZ,EAAOD,QAAUa,kBCLjB,IAGIyD,EAHO,EAAQ,MAGGA,WAEtBrE,EAAOD,QAAUsE,iBCLjB,IAII+I,EAJY,EAAQ,IAIVrC,CAHH,EAAQ,MAGW,WAE9B/K,EAAOD,QAAUqN,YCcjBpN,EAAOD,QAVP,SAAesN,EAAM1G,EAAS2G,GAC5B,OAAQA,EAAKzH,QACX,KAAK,EAAG,OAAOwH,EAAK9L,KAAKoF,GACzB,KAAK,EAAG,OAAO0G,EAAK9L,KAAKoF,EAAS2G,EAAK,IACvC,KAAK,EAAG,OAAOD,EAAK9L,KAAKoF,EAAS2G,EAAK,GAAIA,EAAK,IAChD,KAAK,EAAG,OAAOD,EAAK9L,KAAKoF,EAAS2G,EAAK,GAAIA,EAAK,GAAIA,EAAK,IAE3D,OAAOD,EAAKE,MAAM5G,EAAS2G,cCO7BtN,EAAOD,QAfP,SAAqByN,EAAOC,GAM1B,IALA,IAAInC,GAAS,EACTzF,EAAkB,MAAT2H,EAAgB,EAAIA,EAAM3H,OACnC6H,EAAW,EACXjK,EAAS,KAEJ6H,EAAQzF,GAAQ,CACvB,IAAI9D,EAAQyL,EAAMlC,GACdmC,EAAU1L,EAAOuJ,EAAOkC,KAC1B/J,EAAOiK,KAAc3L,GAGzB,OAAO0B,mBCrBT,IAAIkK,EAAY,EAAQ,MACpBC,EAAc,EAAQ,MACtB/K,EAAU,EAAQ,MAClBgL,EAAW,EAAQ,MACnBC,EAAU,EAAQ,MAClBC,EAAe,EAAQ,MAMvBtH,EAHcpF,OAAOX,UAGQ+F,eAqCjCzG,EAAOD,QA3BP,SAAuBgC,EAAOiM,GAC5B,IAAIC,EAAQpL,EAAQd,GAChBmM,GAASD,GAASL,EAAY7L,GAC9BoM,GAAUF,IAAUC,GAASL,EAAS9L,GACtCqM,GAAUH,IAAUC,IAAUC,GAAUJ,EAAahM,GACrDsM,EAAcJ,GAASC,GAASC,GAAUC,EAC1C3K,EAAS4K,EAAcV,EAAU5L,EAAM8D,OAAQnE,QAAU,GACzDmE,EAASpC,EAAOoC,OAEpB,IAAK,IAAIgE,KAAO9H,GACTiM,IAAavH,EAAelF,KAAKQ,EAAO8H,IACvCwE,IAEQ,UAAPxE,GAECsE,IAAkB,UAAPtE,GAA0B,UAAPA,IAE9BuE,IAAkB,UAAPvE,GAA0B,cAAPA,GAA8B,cAAPA,IAEtDiE,EAAQjE,EAAKhE,KAElBpC,EAAOoD,KAAKgD,GAGhB,OAAOpG,aCzBTzD,EAAOD,QAXP,SAAkByN,EAAOc,GAKvB,IAJA,IAAIhD,GAAS,EACTzF,EAAkB,MAAT2H,EAAgB,EAAIA,EAAM3H,OACnCpC,EAASb,MAAMiD,KAEVyF,EAAQzF,GACfpC,EAAO6H,GAASgD,EAASd,EAAMlC,GAAQA,EAAOkC,GAEhD,OAAO/J,aCETzD,EAAOD,QAXP,SAAmByN,EAAO1G,GAKxB,IAJA,IAAIwE,GAAS,EACTzF,EAASiB,EAAOjB,OAChB0I,EAASf,EAAM3H,SAEVyF,EAAQzF,GACf2H,EAAMe,EAASjD,GAASxE,EAAOwE,GAEjC,OAAOkC,aCMTxN,EAAOD,QAZP,SAAmByN,EAAOC,GAIxB,IAHA,IAAInC,GAAS,EACTzF,EAAkB,MAAT2H,EAAgB,EAAIA,EAAM3H,SAE9ByF,EAAQzF,GACf,GAAI4H,EAAUD,EAAMlC,GAAQA,EAAOkC,GACjC,OAAO,EAGX,OAAO,mBCnBT,IAAIgB,EAAkB,EAAQ,MAC1BC,EAAK,EAAQ,MAkBjBzO,EAAOD,QAPP,SAA0B2O,EAAQ7E,EAAK9H,SACtBO,IAAVP,IAAwB0M,EAAGC,EAAO7E,GAAM9H,SAC9BO,IAAVP,KAAyB8H,KAAO6E,KACnCF,EAAgBE,EAAQ7E,EAAK9H,oBCfjC,IAAIyM,EAAkB,EAAQ,MAC1BC,EAAK,EAAQ,MAMbhI,EAHcpF,OAAOX,UAGQ+F,eAoBjCzG,EAAOD,QARP,SAAqB2O,EAAQ7E,EAAK9H,GAChC,IAAI4M,EAAWD,EAAO7E,GAChBpD,EAAelF,KAAKmN,EAAQ7E,IAAQ4E,EAAGE,EAAU5M,UACxCO,IAAVP,GAAyB8H,KAAO6E,IACnCF,EAAgBE,EAAQ7E,EAAK9H,oBCvBjC,IAAI0M,EAAK,EAAQ,MAoBjBzO,EAAOD,QAVP,SAAsByN,EAAO3D,GAE3B,IADA,IAAIhE,EAAS2H,EAAM3H,OACZA,KACL,GAAI4I,EAAGjB,EAAM3H,GAAQ,GAAIgE,GACvB,OAAOhE,EAGX,OAAQ,mBCjBV,IAAI+E,EAAiB,EAAQ,MAwB7B5K,EAAOD,QAbP,SAAyB2O,EAAQ7E,EAAK9H,GACzB,aAAP8H,GAAsBe,EACxBA,EAAe8D,EAAQ7E,EAAK,CAC1B,cAAgB,EAChB,YAAc,EACd,MAAS9H,EACT,UAAY,IAGd2M,EAAO7E,GAAO9H,mBCpBlB,IAAI6M,EAAW,EAAQ,MAGnBC,EAAexN,OAAO2H,OAUtB8F,EAAc,WAChB,SAASJ,KACT,OAAO,SAASK,GACd,IAAKH,EAASG,GACZ,MAAO,GAET,GAAIF,EACF,OAAOA,EAAaE,GAEtBL,EAAOhO,UAAYqO,EACnB,IAAItL,EAAS,IAAIiL,EAEjB,OADAA,EAAOhO,eAAY4B,EACZmB,GAZM,GAgBjBzD,EAAOD,QAAU+O,kBC7BjB,IAAIE,EAAa,EAAQ,MAWrBC,EAViB,EAAQ,KAUdC,CAAeF,GAE9BhP,EAAOD,QAAUkP,kBCbjB,IAAIE,EAAY,EAAQ,MACpBC,EAAgB,EAAQ,MAoC5BpP,EAAOD,QAvBP,SAASsP,EAAY7B,EAAO8B,EAAO7B,EAAW8B,EAAU9L,GACtD,IAAI6H,GAAS,EACTzF,EAAS2H,EAAM3H,OAKnB,IAHA4H,IAAcA,EAAY2B,GAC1B3L,IAAWA,EAAS,MAEX6H,EAAQzF,GAAQ,CACvB,IAAI9D,EAAQyL,EAAMlC,GACdgE,EAAQ,GAAK7B,EAAU1L,GACrBuN,EAAQ,EAEVD,EAAYtN,EAAOuN,EAAQ,EAAG7B,EAAW8B,EAAU9L,GAEnD0L,EAAU1L,EAAQ1B,GAEVwN,IACV9L,EAAOA,EAAOoC,QAAU9D,GAG5B,OAAO0B,mBClCT,IAaI+L,EAbgB,EAAQ,KAadC,GAEdzP,EAAOD,QAAUyP,kBCfjB,IAAIA,EAAU,EAAQ,MAClB5I,EAAO,EAAQ,MAcnB5G,EAAOD,QAJP,SAAoB2O,EAAQJ,GAC1B,OAAOI,GAAUc,EAAQd,EAAQJ,EAAU1H,oBCZ7C,IAAI8I,EAAW,EAAQ,MACnBC,EAAQ,EAAQ,KAsBpB3P,EAAOD,QAZP,SAAiB2O,EAAQkB,GAMvB,IAHA,IAAItE,EAAQ,EACRzF,GAHJ+J,EAAOF,EAASE,EAAMlB,IAGJ7I,OAED,MAAV6I,GAAkBpD,EAAQzF,GAC/B6I,EAASA,EAAOiB,EAAMC,EAAKtE,OAE7B,OAAQA,GAASA,GAASzF,EAAU6I,OAASpM,mBCpB/C,IAAI6M,EAAY,EAAQ,MACpBtM,EAAU,EAAQ,MAkBtB7C,EAAOD,QALP,SAAwB2O,EAAQmB,EAAUC,GACxC,IAAIrM,EAASoM,EAASnB,GACtB,OAAO7L,EAAQ6L,GAAUjL,EAAS0L,EAAU1L,EAAQqM,EAAYpB,qBChBlE,IAAI9N,EAAS,EAAQ,MACjBmP,EAAY,EAAQ,MACpBC,EAAiB,EAAQ,MAOzBC,EAAiBrP,EAASA,EAAOsP,iBAAc5N,EAkBnDtC,EAAOD,QATP,SAAoBgC,GAClB,OAAa,MAATA,OACeO,IAAVP,EAdQ,qBADL,gBAiBJkO,GAAkBA,KAAkB5O,OAAOU,GAC/CgO,EAAUhO,GACViO,EAAejO,YCZrB/B,EAAOD,QAJP,SAAmB2O,EAAQ7E,GACzB,OAAiB,MAAV6E,GAAkB7E,KAAOxI,OAAOqN,oBCTzC,IAAIyB,EAAa,EAAQ,MACrBC,EAAe,EAAQ,MAgB3BpQ,EAAOD,QAJP,SAAyBgC,GACvB,OAAOqO,EAAarO,IAVR,sBAUkBoO,EAAWpO,mBCd3C,IAAIsO,EAAkB,EAAQ,MAC1BD,EAAe,EAAQ,MA0B3BpQ,EAAOD,QAVP,SAASuQ,EAAYvO,EAAOwO,EAAOC,EAASC,EAAY1H,GACtD,OAAIhH,IAAUwO,IAGD,MAATxO,GAA0B,MAATwO,IAAmBH,EAAarO,KAAWqO,EAAaG,GACpExO,GAAUA,GAASwO,GAAUA,EAE/BF,EAAgBtO,EAAOwO,EAAOC,EAASC,EAAYH,EAAavH,qBCxBzE,IAAIkE,EAAQ,EAAQ,MAChByD,EAAc,EAAQ,MACtBC,EAAa,EAAQ,MACrBC,EAAe,EAAQ,MACvBC,EAAS,EAAQ,MACjBhO,EAAU,EAAQ,MAClBgL,EAAW,EAAQ,MACnBE,EAAe,EAAQ,MAMvB+C,EAAU,qBACVC,EAAW,iBACXC,EAAY,kBAMZvK,EAHcpF,OAAOX,UAGQ+F,eA6DjCzG,EAAOD,QA7CP,SAAyB2O,EAAQ6B,EAAOC,EAASC,EAAYQ,EAAWlI,GACtE,IAAImI,EAAWrO,EAAQ6L,GACnByC,EAAWtO,EAAQ0N,GACnBa,EAASF,EAAWH,EAAWF,EAAOnC,GACtC2C,EAASF,EAAWJ,EAAWF,EAAON,GAKtCe,GAHJF,EAASA,GAAUN,EAAUE,EAAYI,IAGhBJ,EACrBO,GAHJF,EAASA,GAAUP,EAAUE,EAAYK,IAGhBL,EACrBQ,EAAYJ,GAAUC,EAE1B,GAAIG,GAAa3D,EAASa,GAAS,CACjC,IAAKb,EAAS0C,GACZ,OAAO,EAETW,GAAW,EACXI,GAAW,EAEb,GAAIE,IAAcF,EAEhB,OADAvI,IAAUA,EAAQ,IAAIkE,GACdiE,GAAYnD,EAAaW,GAC7BgC,EAAYhC,EAAQ6B,EAAOC,EAASC,EAAYQ,EAAWlI,GAC3D4H,EAAWjC,EAAQ6B,EAAOa,EAAQZ,EAASC,EAAYQ,EAAWlI,GAExE,KArDyB,EAqDnByH,GAAiC,CACrC,IAAIiB,EAAeH,GAAY7K,EAAelF,KAAKmN,EAAQ,eACvDgD,EAAeH,GAAY9K,EAAelF,KAAKgP,EAAO,eAE1D,GAAIkB,GAAgBC,EAAc,CAChC,IAAIC,EAAeF,EAAe/C,EAAO3M,QAAU2M,EAC/CkD,EAAeF,EAAenB,EAAMxO,QAAUwO,EAGlD,OADAxH,IAAUA,EAAQ,IAAIkE,GACfgE,EAAUU,EAAcC,EAAcpB,EAASC,EAAY1H,IAGtE,QAAKyI,IAGLzI,IAAUA,EAAQ,IAAIkE,GACf2D,EAAalC,EAAQ6B,EAAOC,EAASC,EAAYQ,EAAWlI,qBC/ErE,IAAIkE,EAAQ,EAAQ,MAChBqD,EAAc,EAAQ,KA4D1BtQ,EAAOD,QA5CP,SAAqB2O,EAAQmD,EAAQC,EAAWrB,GAC9C,IAAInF,EAAQwG,EAAUjM,OAClBA,EAASyF,EACTyG,GAAgBtB,EAEpB,GAAc,MAAV/B,EACF,OAAQ7I,EAGV,IADA6I,EAASrN,OAAOqN,GACTpD,KAAS,CACd,IAAI4B,EAAO4E,EAAUxG,GACrB,GAAKyG,GAAgB7E,EAAK,GAClBA,EAAK,KAAOwB,EAAOxB,EAAK,MACtBA,EAAK,KAAMwB,GAEnB,OAAO,EAGX,OAASpD,EAAQzF,GAAQ,CAEvB,IAAIgE,GADJqD,EAAO4E,EAAUxG,IACF,GACXqD,EAAWD,EAAO7E,GAClBmI,EAAW9E,EAAK,GAEpB,GAAI6E,GAAgB7E,EAAK,IACvB,QAAiB5K,IAAbqM,KAA4B9E,KAAO6E,GACrC,OAAO,MAEJ,CACL,IAAI3F,EAAQ,IAAIkE,EAChB,GAAIwD,EACF,IAAIhN,EAASgN,EAAW9B,EAAUqD,EAAUnI,EAAK6E,EAAQmD,EAAQ9I,GAEnE,UAAiBzG,IAAXmB,EACE6M,EAAY0B,EAAUrD,EAAUsD,EAA+CxB,EAAY1H,GAC3FtF,GAEN,OAAO,GAIb,OAAO,mBC1DT,IAAIyO,EAAa,EAAQ,MACrBC,EAAW,EAAQ,MACnBvD,EAAW,EAAQ,MACnBwD,EAAW,EAAQ,KASnBC,EAAe,8BAGfC,EAAYC,SAAS7R,UACrB8R,EAAcnR,OAAOX,UAGrB+R,EAAeH,EAAUhR,SAGzBmF,EAAiB+L,EAAY/L,eAG7BiM,EAAaC,OAAO,IACtBF,EAAalR,KAAKkF,GAAgBuB,QAjBjB,sBAiBuC,QACvDA,QAAQ,yDAA0D,SAAW,KAmBhFhI,EAAOD,QARP,SAAsBgC,GACpB,SAAK6M,EAAS7M,IAAUoQ,EAASpQ,MAGnBmQ,EAAWnQ,GAAS2Q,EAAaL,GAChC1Q,KAAKyQ,EAASrQ,qBC3C/B,IAAIoO,EAAa,EAAQ,MACrByC,EAAW,EAAQ,MACnBxC,EAAe,EAAQ,MA8BvByC,EAAiB,GACrBA,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,EAc7B7S,EAAOD,QALP,SAA0BgC,GACxB,OAAOqO,EAAarO,IAClB6Q,EAAS7Q,EAAM8D,WAAagN,EAAe1C,EAAWpO,qBCxD1D,IAAI+Q,EAAc,EAAQ,MACtBC,EAAsB,EAAQ,MAC9BC,EAAW,EAAQ,MACnBnQ,EAAU,EAAQ,MAClBoQ,EAAW,EAAQ,MA0BvBjT,EAAOD,QAjBP,SAAsBgC,GAGpB,MAAoB,mBAATA,EACFA,EAEI,MAATA,EACKiR,EAEW,iBAATjR,EACFc,EAAQd,GACXgR,EAAoBhR,EAAM,GAAIA,EAAM,IACpC+Q,EAAY/Q,GAEXkR,EAASlR,mBC3BlB,IAAImR,EAAc,EAAQ,MACtBC,EAAa,EAAQ,MAMrB1M,EAHcpF,OAAOX,UAGQ+F,eAsBjCzG,EAAOD,QAbP,SAAkB2O,GAChB,IAAKwE,EAAYxE,GACf,OAAOyE,EAAWzE,GAEpB,IAAIjL,EAAS,GACb,IAAK,IAAIoG,KAAOxI,OAAOqN,GACjBjI,EAAelF,KAAKmN,EAAQ7E,IAAe,eAAPA,GACtCpG,EAAOoD,KAAKgD,GAGhB,OAAOpG,kBC1BT,IAAImL,EAAW,EAAQ,MACnBsE,EAAc,EAAQ,MACtBE,EAAe,EAAQ,MAMvB3M,EAHcpF,OAAOX,UAGQ+F,eAwBjCzG,EAAOD,QAfP,SAAoB2O,GAClB,IAAKE,EAASF,GACZ,OAAO0E,EAAa1E,GAEtB,IAAI2E,EAAUH,EAAYxE,GACtBjL,EAAS,GAEb,IAAK,IAAIoG,KAAO6E,GACD,eAAP7E,IAAyBwJ,GAAY5M,EAAelF,KAAKmN,EAAQ7E,KACrEpG,EAAOoD,KAAKgD,GAGhB,OAAOpG,mBC7BT,IAAIwL,EAAW,EAAQ,MACnBqE,EAAc,EAAQ,MAoB1BtT,EAAOD,QAVP,SAAiBwT,EAAYjF,GAC3B,IAAIhD,GAAS,EACT7H,EAAS6P,EAAYC,GAAc3Q,MAAM2Q,EAAW1N,QAAU,GAKlE,OAHAoJ,EAASsE,GAAY,SAASxR,EAAO8H,EAAK0J,GACxC9P,IAAS6H,GAASgD,EAASvM,EAAO8H,EAAK0J,MAElC9P,mBClBT,IAAI+P,EAAc,EAAQ,MACtBC,EAAe,EAAQ,MACvBC,EAA0B,EAAQ,MAmBtC1T,EAAOD,QAVP,SAAqB8R,GACnB,IAAIC,EAAY2B,EAAa5B,GAC7B,OAAwB,GAApBC,EAAUjM,QAAeiM,EAAU,GAAG,GACjC4B,EAAwB5B,EAAU,GAAG,GAAIA,EAAU,GAAG,IAExD,SAASpD,GACd,OAAOA,IAAWmD,GAAU2B,EAAY9E,EAAQmD,EAAQC,qBCjB5D,IAAIxB,EAAc,EAAQ,KACtBlL,EAAM,EAAQ,MACduO,EAAQ,EAAQ,MAChBC,EAAQ,EAAQ,MAChBC,EAAqB,EAAQ,MAC7BH,EAA0B,EAAQ,MAClC/D,EAAQ,EAAQ,KA0BpB3P,EAAOD,QAZP,SAA6B6P,EAAMoC,GACjC,OAAI4B,EAAMhE,IAASiE,EAAmB7B,GAC7B0B,EAAwB/D,EAAMC,GAAOoC,GAEvC,SAAStD,GACd,IAAIC,EAAWvJ,EAAIsJ,EAAQkB,GAC3B,YAAqBtN,IAAbqM,GAA0BA,IAAaqD,EAC3C2B,EAAMjF,EAAQkB,GACdU,EAAY0B,EAAUrD,EAAUsD,qBC5BxC,IAAIhF,EAAQ,EAAQ,MAChB6G,EAAmB,EAAQ,MAC3BtE,EAAU,EAAQ,MAClBuE,EAAgB,EAAQ,MACxBnF,EAAW,EAAQ,MACnBoF,EAAS,EAAQ,MACjBC,EAAU,EAAQ,MAmCtBjU,EAAOD,QAtBP,SAASmU,EAAUxF,EAAQmD,EAAQsC,EAAU1D,EAAY1H,GACnD2F,IAAWmD,GAGfrC,EAAQqC,GAAQ,SAASG,EAAUnI,GAEjC,GADAd,IAAUA,EAAQ,IAAIkE,GAClB2B,EAASoD,GACX+B,EAAcrF,EAAQmD,EAAQhI,EAAKsK,EAAUD,EAAWzD,EAAY1H,OAEjE,CACH,IAAIqL,EAAW3D,EACXA,EAAWwD,EAAQvF,EAAQ7E,GAAMmI,EAAWnI,EAAM,GAAK6E,EAAQmD,EAAQ9I,QACvEzG,OAEaA,IAAb8R,IACFA,EAAWpC,GAEb8B,EAAiBpF,EAAQ7E,EAAKuK,MAE/BJ,oBCtCL,IAAIF,EAAmB,EAAQ,MAC3BO,EAAc,EAAQ,MACtBC,EAAkB,EAAQ,MAC1BC,EAAY,EAAQ,KACpBC,EAAkB,EAAQ,MAC1B5G,EAAc,EAAQ,MACtB/K,EAAU,EAAQ,MAClB4R,EAAoB,EAAQ,MAC5B5G,EAAW,EAAQ,MACnBqE,EAAa,EAAQ,MACrBtD,EAAW,EAAQ,MACnB8F,EAAgB,EAAQ,MACxB3G,EAAe,EAAQ,MACvBkG,EAAU,EAAQ,MAClBU,EAAgB,EAAQ,MA+E5B3U,EAAOD,QA9DP,SAAuB2O,EAAQmD,EAAQhI,EAAKsK,EAAUS,EAAWnE,EAAY1H,GAC3E,IAAI4F,EAAWsF,EAAQvF,EAAQ7E,GAC3BmI,EAAWiC,EAAQpC,EAAQhI,GAC3BgL,EAAU9L,EAAM3D,IAAI4M,GAExB,GAAI6C,EACFf,EAAiBpF,EAAQ7E,EAAKgL,OADhC,CAIA,IAAIT,EAAW3D,EACXA,EAAW9B,EAAUqD,EAAWnI,EAAM,GAAK6E,EAAQmD,EAAQ9I,QAC3DzG,EAEAwS,OAAwBxS,IAAb8R,EAEf,GAAIU,EAAU,CACZ,IAAI7G,EAAQpL,EAAQmP,GAChB7D,GAAUF,GAASJ,EAASmE,GAC5B+C,GAAW9G,IAAUE,GAAUJ,EAAaiE,GAEhDoC,EAAWpC,EACP/D,GAASE,GAAU4G,EACjBlS,EAAQ8L,GACVyF,EAAWzF,EAEJ8F,EAAkB9F,GACzByF,EAAWG,EAAU5F,GAEdR,GACP2G,GAAW,EACXV,EAAWC,EAAYrC,GAAU,IAE1B+C,GACPD,GAAW,EACXV,EAAWE,EAAgBtC,GAAU,IAGrCoC,EAAW,GAGNM,EAAc1C,IAAapE,EAAYoE,IAC9CoC,EAAWzF,EACPf,EAAYe,GACdyF,EAAWO,EAAchG,GAEjBC,EAASD,KAAauD,EAAWvD,KACzCyF,EAAWI,EAAgBxC,KAI7B8C,GAAW,EAGXA,IAEF/L,EAAMxE,IAAIyN,EAAUoC,GACpBQ,EAAUR,EAAUpC,EAAUmC,EAAU1D,EAAY1H,GACpDA,EAAc,OAAEiJ,IAElB8B,EAAiBpF,EAAQ7E,EAAKuK,qBC1FhC,IAAIY,EAAW,EAAQ,MACnBC,EAAU,EAAQ,MAClBC,EAAe,EAAQ,MACvBC,EAAU,EAAQ,MAClBC,EAAa,EAAQ,MACrBC,EAAY,EAAQ,MACpBC,EAAkB,EAAQ,MAC1BtC,EAAW,EAAQ,MACnBnQ,EAAU,EAAQ,MAwCtB7C,EAAOD,QA7BP,SAAqBwT,EAAYgC,EAAWC,GAExCD,EADEA,EAAU1P,OACAmP,EAASO,GAAW,SAASjH,GACvC,OAAIzL,EAAQyL,GACH,SAASvM,GACd,OAAOkT,EAAQlT,EAA2B,IAApBuM,EAASzI,OAAeyI,EAAS,GAAKA,IAGzDA,KAGG,CAAC0E,GAGf,IAAI1H,GAAS,EACbiK,EAAYP,EAASO,EAAWF,EAAUH,IAE1C,IAAIzR,EAAS0R,EAAQ5B,GAAY,SAASxR,EAAO8H,EAAK0J,GAIpD,MAAO,CAAE,SAHMyB,EAASO,GAAW,SAASjH,GAC1C,OAAOA,EAASvM,MAEa,QAAWuJ,EAAO,MAASvJ,MAG5D,OAAOqT,EAAW3R,GAAQ,SAASiL,EAAQ6B,GACzC,OAAO+E,EAAgB5G,EAAQ6B,EAAOiF,gBC/B1CxV,EAAOD,QANP,SAAsB8J,GACpB,OAAO,SAAS6E,GACd,OAAiB,MAAVA,OAAiBpM,EAAYoM,EAAO7E,qBCT/C,IAAIoL,EAAU,EAAQ,MAetBjV,EAAOD,QANP,SAA0B6P,GACxB,OAAO,SAASlB,GACd,OAAOuG,EAAQvG,EAAQkB,qBCX3B,IAAIoD,EAAW,EAAQ,MACnByC,EAAW,EAAQ,MACnBC,EAAc,EAAQ,IAc1B1V,EAAOD,QAJP,SAAkBsN,EAAMsI,GACtB,OAAOD,EAAYD,EAASpI,EAAMsI,EAAO3C,GAAW3F,EAAO,qBCb7D,IAAIuI,EAAW,EAAQ,MACnBhL,EAAiB,EAAQ,MACzBoI,EAAW,EAAQ,MAUnB6C,EAAmBjL,EAA4B,SAASyC,EAAMyI,GAChE,OAAOlL,EAAeyC,EAAM,WAAY,CACtC,cAAgB,EAChB,YAAc,EACd,MAASuI,EAASE,GAClB,UAAY,KALwB9C,EASxChT,EAAOD,QAAU8V,YCDjB7V,EAAOD,QAVP,SAAoByN,EAAOuI,GACzB,IAAIlQ,EAAS2H,EAAM3H,OAGnB,IADA2H,EAAMwI,KAAKD,GACJlQ,KACL2H,EAAM3H,GAAU2H,EAAM3H,GAAQ9D,MAEhC,OAAOyL,aCETxN,EAAOD,QAVP,SAAmBkW,EAAG3H,GAIpB,IAHA,IAAIhD,GAAS,EACT7H,EAASb,MAAMqT,KAEV3K,EAAQ2K,GACfxS,EAAO6H,GAASgD,EAAShD,GAE3B,OAAO7H,kBChBT,IAAI7C,EAAS,EAAQ,MACjBoU,EAAW,EAAQ,MACnBnS,EAAU,EAAQ,MAClBqT,EAAW,EAAQ,MAMnBC,EAAcvV,EAASA,EAAOF,eAAY4B,EAC1C8T,EAAiBD,EAAcA,EAAY7U,cAAWgB,EA0B1DtC,EAAOD,QAhBP,SAASsW,EAAatU,GAEpB,GAAoB,iBAATA,EACT,OAAOA,EAET,GAAIc,EAAQd,GAEV,OAAOiT,EAASjT,EAAOsU,GAAgB,GAEzC,GAAIH,EAASnU,GACX,OAAOqU,EAAiBA,EAAe7U,KAAKQ,GAAS,GAEvD,IAAI0B,EAAU1B,EAAQ,GACtB,MAAkB,KAAV0B,GAAkB,EAAI1B,IA3BjB,IA2BwC,KAAO0B,aCpB9DzD,EAAOD,QANP,SAAmBsN,GACjB,OAAO,SAAStL,GACd,OAAOsL,EAAKtL,eCGhB/B,EAAOD,QAJP,SAAkBuW,EAAOzM,GACvB,OAAOyM,EAAM9P,IAAIqD,oBCTnB,IAAIhH,EAAU,EAAQ,MAClB+Q,EAAQ,EAAQ,MAChB2C,EAAe,EAAQ,MACvBjV,EAAW,EAAQ,MAiBvBtB,EAAOD,QAPP,SAAkBgC,EAAO2M,GACvB,OAAI7L,EAAQd,GACHA,EAEF6R,EAAM7R,EAAO2M,GAAU,CAAC3M,GAASwU,EAAajV,EAASS,qBCjBhE,IAAIsC,EAAa,EAAQ,MAezBrE,EAAOD,QANP,SAA0ByF,GACxB,IAAI/B,EAAS,IAAI+B,EAAYyD,YAAYzD,EAAYlB,YAErD,OADA,IAAID,EAAWZ,GAAQc,IAAI,IAAIF,EAAWmB,IACnC/B,8BCZT,IAAI5D,EAAO,EAAQ,MAGf2W,EAA4CzW,IAAYA,EAAQ0W,UAAY1W,EAG5E2W,EAAaF,GAA4CxW,IAAWA,EAAOyW,UAAYzW,EAMvF2W,EAHgBD,GAAcA,EAAW3W,UAAYyW,EAG5B3W,EAAK8W,YAASrU,EACvCsU,EAAcD,EAASA,EAAOC,iBAActU,EAqBhDtC,EAAOD,QAXP,SAAqByE,EAAQqS,GAC3B,GAAIA,EACF,OAAOrS,EAAOL,QAEhB,IAAI0B,EAASrB,EAAOqB,OAChBpC,EAASmT,EAAcA,EAAY/Q,GAAU,IAAIrB,EAAOyE,YAAYpD,GAGxE,OADArB,EAAOsS,KAAKrT,GACLA,mBC/BT,IAAIsT,EAAmB,EAAQ,MAe/B/W,EAAOD,QALP,SAAyBiX,EAAYH,GACnC,IAAIrS,EAASqS,EAASE,EAAiBC,EAAWxS,QAAUwS,EAAWxS,OACvE,OAAO,IAAIwS,EAAW/N,YAAYzE,EAAQwS,EAAWC,WAAYD,EAAWnR,yBCZ9E,IAAIqQ,EAAW,EAAQ,MAwCvBlW,EAAOD,QA9BP,SAA0BgC,EAAOwO,GAC/B,GAAIxO,IAAUwO,EAAO,CACnB,IAAI2G,OAAyB5U,IAAVP,EACfoV,EAAsB,OAAVpV,EACZqV,EAAiBrV,GAAUA,EAC3BsV,EAAcnB,EAASnU,GAEvBuV,OAAyBhV,IAAViO,EACfgH,EAAsB,OAAVhH,EACZiH,EAAiBjH,GAAUA,EAC3BkH,EAAcvB,EAAS3F,GAE3B,IAAMgH,IAAcE,IAAgBJ,GAAetV,EAAQwO,GACtD8G,GAAeC,GAAgBE,IAAmBD,IAAcE,GAChEN,GAAaG,GAAgBE,IAC5BN,GAAgBM,IACjBJ,EACH,OAAO,EAET,IAAMD,IAAcE,IAAgBI,GAAe1V,EAAQwO,GACtDkH,GAAeP,GAAgBE,IAAmBD,IAAcE,GAChEE,GAAaL,GAAgBE,IAC5BE,GAAgBF,IACjBI,EACH,OAAQ,EAGZ,OAAO,mBCrCT,IAAIE,EAAmB,EAAQ,MA2C/B1X,EAAOD,QA3BP,SAAyB2O,EAAQ6B,EAAOiF,GAOtC,IANA,IAAIlK,GAAS,EACTqM,EAAcjJ,EAAOkJ,SACrBC,EAActH,EAAMqH,SACpB/R,EAAS8R,EAAY9R,OACrBiS,EAAetC,EAAO3P,SAEjByF,EAAQzF,GAAQ,CACvB,IAAIpC,EAASiU,EAAiBC,EAAYrM,GAAQuM,EAAYvM,IAC9D,GAAI7H,EACF,OAAI6H,GAASwM,EACJrU,EAGFA,GAAmB,QADd+R,EAAOlK,IACiB,EAAI,GAU5C,OAAOoD,EAAOpD,MAAQiF,EAAMjF,gBCrB9BtL,EAAOD,QAXP,SAAmB8R,EAAQrE,GACzB,IAAIlC,GAAS,EACTzF,EAASgM,EAAOhM,OAGpB,IADA2H,IAAUA,EAAQ5K,MAAMiD,MACfyF,EAAQzF,GACf2H,EAAMlC,GAASuG,EAAOvG,GAExB,OAAOkC,mBChBT,IAAIuK,EAAc,EAAQ,MACtBvJ,EAAkB,EAAQ,MAsC9BxO,EAAOD,QA1BP,SAAoB8R,EAAQmG,EAAOtJ,EAAQ+B,GACzC,IAAIwH,GAASvJ,EACbA,IAAWA,EAAS,IAKpB,IAHA,IAAIpD,GAAS,EACTzF,EAASmS,EAAMnS,SAEVyF,EAAQzF,GAAQ,CACvB,IAAIgE,EAAMmO,EAAM1M,GAEZ8I,EAAW3D,EACXA,EAAW/B,EAAO7E,GAAMgI,EAAOhI,GAAMA,EAAK6E,EAAQmD,QAClDvP,OAEaA,IAAb8R,IACFA,EAAWvC,EAAOhI,IAEhBoO,EACFzJ,EAAgBE,EAAQ7E,EAAKuK,GAE7B2D,EAAYrJ,EAAQ7E,EAAKuK,GAG7B,OAAO1F,mBCpCT,IAGIwJ,EAHO,EAAQ,MAGG,sBAEtBlY,EAAOD,QAAUmY,kBCLjB,IAAIC,EAAW,EAAQ,MACnBC,EAAiB,EAAQ,MAmC7BpY,EAAOD,QA1BP,SAAwBsY,GACtB,OAAOF,GAAS,SAASzJ,EAAQ4J,GAC/B,IAAIhN,GAAS,EACTzF,EAASyS,EAAQzS,OACjB4K,EAAa5K,EAAS,EAAIyS,EAAQzS,EAAS,QAAKvD,EAChDiW,EAAQ1S,EAAS,EAAIyS,EAAQ,QAAKhW,EAWtC,IATAmO,EAAc4H,EAASxS,OAAS,GAA0B,mBAAd4K,GACvC5K,IAAU4K,QACXnO,EAEAiW,GAASH,EAAeE,EAAQ,GAAIA,EAAQ,GAAIC,KAClD9H,EAAa5K,EAAS,OAAIvD,EAAYmO,EACtC5K,EAAS,GAEX6I,EAASrN,OAAOqN,KACPpD,EAAQzF,GAAQ,CACvB,IAAIgM,EAASyG,EAAQhN,GACjBuG,GACFwG,EAAS3J,EAAQmD,EAAQvG,EAAOmF,GAGpC,OAAO/B,sBChCX,IAAI4E,EAAc,EAAQ,MA+B1BtT,EAAOD,QArBP,SAAwByY,EAAUC,GAChC,OAAO,SAASlF,EAAYjF,GAC1B,GAAkB,MAAdiF,EACF,OAAOA,EAET,IAAKD,EAAYC,GACf,OAAOiF,EAASjF,EAAYjF,GAM9B,IAJA,IAAIzI,EAAS0N,EAAW1N,OACpByF,EAAQmN,EAAY5S,GAAU,EAC9B6S,EAAWrX,OAAOkS,IAEdkF,EAAYnN,MAAYA,EAAQzF,KACa,IAA/CyI,EAASoK,EAASpN,GAAQA,EAAOoN,KAIvC,OAAOnF,cCHXvT,EAAOD,QAjBP,SAAuB0Y,GACrB,OAAO,SAAS/J,EAAQJ,EAAUuB,GAMhC,IALA,IAAIvE,GAAS,EACToN,EAAWrX,OAAOqN,GAClBsJ,EAAQnI,EAASnB,GACjB7I,EAASmS,EAAMnS,OAEZA,KAAU,CACf,IAAIgE,EAAMmO,EAAMS,EAAY5S,IAAWyF,GACvC,IAA+C,IAA3CgD,EAASoK,EAAS7O,GAAMA,EAAK6O,GAC/B,MAGJ,OAAOhK,oBCpBX,IAAI3D,EAAY,EAAQ,KAEpBH,EAAkB,WACpB,IACE,IAAIyC,EAAOtC,EAAU1J,OAAQ,kBAE7B,OADAgM,EAAK,GAAI,GAAI,IACNA,EACP,MAAOvM,KALU,GAQrBd,EAAOD,QAAU6K,kBCVjB,IAAI6B,EAAW,EAAQ,MACnBkM,EAAY,EAAQ,MACpBC,EAAW,EAAQ,MAiFvB5Y,EAAOD,QA9DP,SAAqByN,EAAO+C,EAAOC,EAASC,EAAYQ,EAAWlI,GACjE,IAAI8P,EAjBqB,EAiBTrI,EACZsI,EAAYtL,EAAM3H,OAClBkT,EAAYxI,EAAM1K,OAEtB,GAAIiT,GAAaC,KAAeF,GAAaE,EAAYD,GACvD,OAAO,EAGT,IAAIE,EAAajQ,EAAM3D,IAAIoI,GACvByL,EAAalQ,EAAM3D,IAAImL,GAC3B,GAAIyI,GAAcC,EAChB,OAAOD,GAAczI,GAAS0I,GAAczL,EAE9C,IAAIlC,GAAS,EACT7H,GAAS,EACTyV,EA/BuB,EA+Bf1I,EAAoC,IAAI/D,OAAWnK,EAM/D,IAJAyG,EAAMxE,IAAIiJ,EAAO+C,GACjBxH,EAAMxE,IAAIgM,EAAO/C,KAGRlC,EAAQwN,GAAW,CAC1B,IAAIK,EAAW3L,EAAMlC,GACjB8N,EAAW7I,EAAMjF,GAErB,GAAImF,EACF,IAAI4I,EAAWR,EACXpI,EAAW2I,EAAUD,EAAU7N,EAAOiF,EAAO/C,EAAOzE,GACpD0H,EAAW0I,EAAUC,EAAU9N,EAAOkC,EAAO+C,EAAOxH,GAE1D,QAAiBzG,IAAb+W,EAAwB,CAC1B,GAAIA,EACF,SAEF5V,GAAS,EACT,MAGF,GAAIyV,GACF,IAAKP,EAAUpI,GAAO,SAAS6I,EAAUE,GACnC,IAAKV,EAASM,EAAMI,KACfH,IAAaC,GAAYnI,EAAUkI,EAAUC,EAAU5I,EAASC,EAAY1H,IAC/E,OAAOmQ,EAAKrS,KAAKyS,MAEjB,CACN7V,GAAS,EACT,YAEG,GACD0V,IAAaC,IACXnI,EAAUkI,EAAUC,EAAU5I,EAASC,EAAY1H,GACpD,CACLtF,GAAS,EACT,OAKJ,OAFAsF,EAAc,OAAEyE,GAChBzE,EAAc,OAAEwH,GACT9M,mBChFT,IAAI7C,EAAS,EAAQ,MACjByD,EAAa,EAAQ,MACrBoK,EAAK,EAAQ,MACbiC,EAAc,EAAQ,MACtB6I,EAAa,EAAQ,MACrBC,EAAa,EAAQ,MAqBrBrD,EAAcvV,EAASA,EAAOF,eAAY4B,EAC1CmX,EAAgBtD,EAAcA,EAAYuD,aAAUpX,EAoFxDtC,EAAOD,QAjEP,SAAoB2O,EAAQ6B,EAAOoJ,EAAKnJ,EAASC,EAAYQ,EAAWlI,GACtE,OAAQ4Q,GACN,IAzBc,oBA0BZ,GAAKjL,EAAOpK,YAAciM,EAAMjM,YAC3BoK,EAAOuI,YAAc1G,EAAM0G,WAC9B,OAAO,EAETvI,EAASA,EAAOlK,OAChB+L,EAAQA,EAAM/L,OAEhB,IAlCiB,uBAmCf,QAAKkK,EAAOpK,YAAciM,EAAMjM,aAC3B2M,EAAU,IAAI5M,EAAWqK,GAAS,IAAIrK,EAAWkM,KAKxD,IAnDU,mBAoDV,IAnDU,gBAoDV,IAjDY,kBAoDV,OAAO9B,GAAIC,GAAS6B,GAEtB,IAxDW,iBAyDT,OAAO7B,EAAOjN,MAAQ8O,EAAM9O,MAAQiN,EAAO5F,SAAWyH,EAAMzH,QAE9D,IAxDY,kBAyDZ,IAvDY,kBA2DV,OAAO4F,GAAW6B,EAAQ,GAE5B,IAjES,eAkEP,IAAIqJ,EAAUL,EAEhB,IAjES,eAkEP,IAAIV,EA5EiB,EA4ELrI,EAGhB,GAFAoJ,IAAYA,EAAUJ,GAElB9K,EAAOvB,MAAQoD,EAAMpD,OAAS0L,EAChC,OAAO,EAGT,IAAIhE,EAAU9L,EAAM3D,IAAIsJ,GACxB,GAAImG,EACF,OAAOA,GAAWtE,EAEpBC,GAtFuB,EAyFvBzH,EAAMxE,IAAImK,EAAQ6B,GAClB,IAAI9M,EAASiN,EAAYkJ,EAAQlL,GAASkL,EAAQrJ,GAAQC,EAASC,EAAYQ,EAAWlI,GAE1F,OADAA,EAAc,OAAE2F,GACTjL,EAET,IAnFY,kBAoFV,GAAIgW,EACF,OAAOA,EAAclY,KAAKmN,IAAW+K,EAAclY,KAAKgP,GAG9D,OAAO,mBC5GT,IAAIsJ,EAAa,EAAQ,MASrBpT,EAHcpF,OAAOX,UAGQ+F,eAgFjCzG,EAAOD,QAjEP,SAAsB2O,EAAQ6B,EAAOC,EAASC,EAAYQ,EAAWlI,GACnE,IAAI8P,EAtBqB,EAsBTrI,EACZsJ,EAAWD,EAAWnL,GACtBqL,EAAYD,EAASjU,OAIzB,GAAIkU,GAHWF,EAAWtJ,GACD1K,SAEMgT,EAC7B,OAAO,EAGT,IADA,IAAIvN,EAAQyO,EACLzO,KAAS,CACd,IAAIzB,EAAMiQ,EAASxO,GACnB,KAAMuN,EAAYhP,KAAO0G,EAAQ9J,EAAelF,KAAKgP,EAAO1G,IAC1D,OAAO,EAIX,IAAImQ,EAAajR,EAAM3D,IAAIsJ,GACvBuK,EAAalQ,EAAM3D,IAAImL,GAC3B,GAAIyJ,GAAcf,EAChB,OAAOe,GAAczJ,GAAS0I,GAAcvK,EAE9C,IAAIjL,GAAS,EACbsF,EAAMxE,IAAImK,EAAQ6B,GAClBxH,EAAMxE,IAAIgM,EAAO7B,GAGjB,IADA,IAAIuL,EAAWpB,IACNvN,EAAQyO,GAAW,CAE1B,IAAIpL,EAAWD,EADf7E,EAAMiQ,EAASxO,IAEX8N,EAAW7I,EAAM1G,GAErB,GAAI4G,EACF,IAAI4I,EAAWR,EACXpI,EAAW2I,EAAUzK,EAAU9E,EAAK0G,EAAO7B,EAAQ3F,GACnD0H,EAAW9B,EAAUyK,EAAUvP,EAAK6E,EAAQ6B,EAAOxH,GAGzD,UAAmBzG,IAAb+W,EACG1K,IAAayK,GAAYnI,EAAUtC,EAAUyK,EAAU5I,EAASC,EAAY1H,GAC7EsQ,GACD,CACL5V,GAAS,EACT,MAEFwW,IAAaA,EAAkB,eAAPpQ,GAE1B,GAAIpG,IAAWwW,EAAU,CACvB,IAAIC,EAAUxL,EAAOzF,YACjBkR,EAAU5J,EAAMtH,YAGhBiR,GAAWC,KACV,gBAAiBzL,MAAU,gBAAiB6B,IACzB,mBAAX2J,GAAyBA,aAAmBA,GACjC,mBAAXC,GAAyBA,aAAmBA,IACvD1W,GAAS,GAKb,OAFAsF,EAAc,OAAE2F,GAChB3F,EAAc,OAAEwH,GACT9M,mBCrFT,IAAI2W,EAA8B,iBAAV,EAAAC,GAAsB,EAAAA,GAAU,EAAAA,EAAOhZ,SAAWA,QAAU,EAAAgZ,EAEpFra,EAAOD,QAAUqa,kBCHjB,IAAIE,EAAiB,EAAQ,MACzBC,EAAa,EAAQ,MACrB3T,EAAO,EAAQ,MAanB5G,EAAOD,QAJP,SAAoB2O,GAClB,OAAO4L,EAAe5L,EAAQ9H,EAAM2T,oBCZtC,IAAIC,EAAY,EAAQ,MAiBxBxa,EAAOD,QAPP,SAAoB0C,EAAKoH,GACvB,IAAIqD,EAAOzK,EAAIiK,SACf,OAAO8N,EAAU3Q,GACbqD,EAAmB,iBAAPrD,EAAkB,SAAW,QACzCqD,EAAKzK,qBCdX,IAAIoR,EAAqB,EAAQ,MAC7BjN,EAAO,EAAQ,MAsBnB5G,EAAOD,QAbP,SAAsB2O,GAIpB,IAHA,IAAIjL,EAASmD,EAAK8H,GACd7I,EAASpC,EAAOoC,OAEbA,KAAU,CACf,IAAIgE,EAAMpG,EAAOoC,GACb9D,EAAQ2M,EAAO7E,GAEnBpG,EAAOoC,GAAU,CAACgE,EAAK9H,EAAO8R,EAAmB9R,IAEnD,OAAO0B,kBCpBT,IAAIgX,EAAe,EAAQ,MACvBC,EAAW,EAAQ,MAevB1a,EAAOD,QALP,SAAmB2O,EAAQ7E,GACzB,IAAI9H,EAAQ2Y,EAAShM,EAAQ7E,GAC7B,OAAO4Q,EAAa1Y,GAASA,OAAQO,mBCbvC,IAGIqY,EAHU,EAAQ,KAGHC,CAAQvZ,OAAOwZ,eAAgBxZ,QAElDrB,EAAOD,QAAU4a,kBCLjB,IAAI/Z,EAAS,EAAQ,MAGjB4R,EAAcnR,OAAOX,UAGrB+F,EAAiB+L,EAAY/L,eAO7BqU,EAAuBtI,EAAYlR,SAGnC2O,EAAiBrP,EAASA,EAAOsP,iBAAc5N,EA6BnDtC,EAAOD,QApBP,SAAmBgC,GACjB,IAAIgZ,EAAQtU,EAAelF,KAAKQ,EAAOkO,GACnC0J,EAAM5X,EAAMkO,GAEhB,IACElO,EAAMkO,QAAkB3N,EACxB,IAAI0Y,GAAW,EACf,MAAOla,IAET,IAAI2C,EAASqX,EAAqBvZ,KAAKQ,GAQvC,OAPIiZ,IACED,EACFhZ,EAAMkO,GAAkB0J,SAEjB5X,EAAMkO,IAGVxM,mBC1CT,IAAIwX,EAAc,EAAQ,MACtBC,EAAY,EAAQ,KAMpBC,EAHc9Z,OAAOX,UAGcya,qBAGnCC,EAAmB/Z,OAAOga,sBAS1Bd,EAAca,EAA+B,SAAS1M,GACxD,OAAc,MAAVA,EACK,IAETA,EAASrN,OAAOqN,GACTuM,EAAYG,EAAiB1M,IAAS,SAAS4M,GACpD,OAAOH,EAAqB5Z,KAAKmN,EAAQ4M,QANRJ,EAUrClb,EAAOD,QAAUwa,kBC7BjB,IAAIrV,EAAW,EAAQ,MACnB6G,EAAM,EAAQ,MACd5I,EAAU,EAAQ,MAClBmJ,EAAM,EAAQ,MACdc,EAAU,EAAQ,KAClB+C,EAAa,EAAQ,MACrBiC,EAAW,EAAQ,KAGnBmJ,EAAS,eAETC,EAAa,mBACbC,EAAS,eACTC,EAAa,mBAEbC,EAAc,oBAGdC,EAAqBxJ,EAASlN,GAC9B2W,EAAgBzJ,EAASrG,GACzB+P,EAAoB1J,EAASjP,GAC7B4Y,EAAgB3J,EAAS9F,GACzB0P,EAAoB5J,EAAShF,GAS7ByD,EAASV,GAGRjL,GAAY2L,EAAO,IAAI3L,EAAS,IAAIjE,YAAY,MAAQ0a,GACxD5P,GAAO8E,EAAO,IAAI9E,IAAQwP,GAC1BpY,GAAW0N,EAAO1N,EAAQI,YAAciY,GACxClP,GAAOuE,EAAO,IAAIvE,IAAQmP,GAC1BrO,GAAWyD,EAAO,IAAIzD,IAAYsO,KACrC7K,EAAS,SAAS9O,GAChB,IAAI0B,EAAS0M,EAAWpO,GACpBka,EA/BQ,mBA+BDxY,EAAsB1B,EAAMkH,iBAAc3G,EACjD4Z,EAAaD,EAAO7J,EAAS6J,GAAQ,GAEzC,GAAIC,EACF,OAAQA,GACN,KAAKN,EAAoB,OAAOD,EAChC,KAAKE,EAAe,OAAON,EAC3B,KAAKO,EAAmB,OAAON,EAC/B,KAAKO,EAAe,OAAON,EAC3B,KAAKO,EAAmB,OAAON,EAGnC,OAAOjY,IAIXzD,EAAOD,QAAU8Q,YC7CjB7Q,EAAOD,QAJP,SAAkB2O,EAAQ7E,GACxB,OAAiB,MAAV6E,OAAiBpM,EAAYoM,EAAO7E,mBCT7C,IAAI6F,EAAW,EAAQ,MACnB9B,EAAc,EAAQ,MACtB/K,EAAU,EAAQ,MAClBiL,EAAU,EAAQ,MAClB8E,EAAW,EAAQ,MACnBjD,EAAQ,EAAQ,KAiCpB3P,EAAOD,QAtBP,SAAiB2O,EAAQkB,EAAMuM,GAO7B,IAJA,IAAI7Q,GAAS,EACTzF,GAHJ+J,EAAOF,EAASE,EAAMlB,IAGJ7I,OACdpC,GAAS,IAEJ6H,EAAQzF,GAAQ,CACvB,IAAIgE,EAAM8F,EAAMC,EAAKtE,IACrB,KAAM7H,EAAmB,MAAViL,GAAkByN,EAAQzN,EAAQ7E,IAC/C,MAEF6E,EAASA,EAAO7E,GAElB,OAAIpG,KAAY6H,GAASzF,EAChBpC,KAEToC,EAAmB,MAAV6I,EAAiB,EAAIA,EAAO7I,SAClB+M,EAAS/M,IAAWiI,EAAQjE,EAAKhE,KACjDhD,EAAQ6L,IAAWd,EAAYc,qBCnCpC,IAAI0N,EAAe,EAAQ,MAc3Bpc,EAAOD,QALP,WACEM,KAAKqM,SAAW0P,EAAeA,EAAa,MAAQ,GACpD/b,KAAK8M,KAAO,YCKdnN,EAAOD,QANP,SAAoB8J,GAClB,IAAIpG,EAASpD,KAAKmG,IAAIqD,WAAexJ,KAAKqM,SAAS7C,GAEnD,OADAxJ,KAAK8M,MAAQ1J,EAAS,EAAI,EACnBA,mBCbT,IAAI2Y,EAAe,EAAQ,MASvB3V,EAHcpF,OAAOX,UAGQ+F,eAoBjCzG,EAAOD,QATP,SAAiB8J,GACf,IAAIqD,EAAO7M,KAAKqM,SAChB,GAAI0P,EAAc,CAChB,IAAI3Y,EAASyJ,EAAKrD,GAClB,MArBiB,8BAqBVpG,OAA4BnB,EAAYmB,EAEjD,OAAOgD,EAAelF,KAAK2L,EAAMrD,GAAOqD,EAAKrD,QAAOvH,mBC1BtD,IAAI8Z,EAAe,EAAQ,MAMvB3V,EAHcpF,OAAOX,UAGQ+F,eAgBjCzG,EAAOD,QALP,SAAiB8J,GACf,IAAIqD,EAAO7M,KAAKqM,SAChB,OAAO0P,OAA8B9Z,IAAd4K,EAAKrD,GAAsBpD,EAAelF,KAAK2L,EAAMrD,oBCnB9E,IAAIuS,EAAe,EAAQ,MAsB3Bpc,EAAOD,QAPP,SAAiB8J,EAAK9H,GACpB,IAAImL,EAAO7M,KAAKqM,SAGhB,OAFArM,KAAK8M,MAAQ9M,KAAKmG,IAAIqD,GAAO,EAAI,EACjCqD,EAAKrD,GAAQuS,QAA0B9Z,IAAVP,EAfV,4BAekDA,EAC9D1B,sBCnBT,IAAIyO,EAAa,EAAQ,MACrB6L,EAAe,EAAQ,MACvBzH,EAAc,EAAQ,MAe1BlT,EAAOD,QANP,SAAyB2O,GACvB,MAAqC,mBAAtBA,EAAOzF,aAA8BiK,EAAYxE,GAE5D,GADAI,EAAW6L,EAAajM,qBCb9B,IAAI9N,EAAS,EAAQ,MACjBgN,EAAc,EAAQ,MACtB/K,EAAU,EAAQ,MAGlBwZ,EAAmBzb,EAASA,EAAO0b,wBAAqBha,EAc5DtC,EAAOD,QALP,SAAuBgC,GACrB,OAAOc,EAAQd,IAAU6L,EAAY7L,OAChCsa,GAAoBta,GAASA,EAAMsa,eCf1C,IAGIE,EAAW,mBAoBfvc,EAAOD,QAVP,SAAiBgC,EAAO8D,GACtB,IAAIR,SAActD,EAGlB,SAFA8D,EAAmB,MAAVA,EAfY,iBAewBA,KAGlC,UAARR,GACU,UAARA,GAAoBkX,EAAS5a,KAAKI,KAChCA,GAAS,GAAKA,EAAQ,GAAK,GAAKA,EAAQ8D,mBCrBjD,IAAI4I,EAAK,EAAQ,MACb6E,EAAc,EAAQ,MACtBxF,EAAU,EAAQ,MAClBc,EAAW,EAAQ,MA0BvB5O,EAAOD,QAdP,SAAwBgC,EAAOuJ,EAAOoD,GACpC,IAAKE,EAASF,GACZ,OAAO,EAET,IAAIrJ,SAAciG,EAClB,SAAY,UAARjG,EACKiO,EAAY5E,IAAWZ,EAAQxC,EAAOoD,EAAO7I,QACrC,UAARR,GAAoBiG,KAASoD,IAE7BD,EAAGC,EAAOpD,GAAQvJ,oBCxB7B,IAAIc,EAAU,EAAQ,MAClBqT,EAAW,EAAQ,MAGnBsG,EAAe,mDACfC,EAAgB,QAuBpBzc,EAAOD,QAbP,SAAegC,EAAO2M,GACpB,GAAI7L,EAAQd,GACV,OAAO,EAET,IAAIsD,SAActD,EAClB,QAAY,UAARsD,GAA4B,UAARA,GAA4B,WAARA,GAC/B,MAATtD,IAAiBmU,EAASnU,KAGvB0a,EAAc9a,KAAKI,KAAWya,EAAa7a,KAAKI,IAC1C,MAAV2M,GAAkB3M,KAASV,OAAOqN,cCXvC1O,EAAOD,QAPP,SAAmBgC,GACjB,IAAIsD,SAActD,EAClB,MAAgB,UAARsD,GAA4B,UAARA,GAA4B,UAARA,GAA4B,WAARA,EACrD,cAAVtD,EACU,OAAVA,mBCXP,IAIM2a,EAJFxE,EAAa,EAAQ,MAGrByE,GACED,EAAM,SAASE,KAAK1E,GAAcA,EAAWtR,MAAQsR,EAAWtR,KAAKiW,UAAY,KACvE,iBAAmBH,EAAO,GAc1C1c,EAAOD,QAJP,SAAkBsN,GAChB,QAASsP,GAAeA,KAActP,aCfxC,IAAImF,EAAcnR,OAAOX,UAgBzBV,EAAOD,QAPP,SAAqBgC,GACnB,IAAIka,EAAOla,GAASA,EAAMkH,YAG1B,OAAOlH,KAFqB,mBAARka,GAAsBA,EAAKvb,WAAc8R,oBCZ/D,IAAI5D,EAAW,EAAQ,MAcvB5O,EAAOD,QAJP,SAA4BgC,GAC1B,OAAOA,GAAUA,IAAU6M,EAAS7M,cCCtC/B,EAAOD,QALP,WACEM,KAAKqM,SAAW,GAChBrM,KAAK8M,KAAO,mBCTd,IAAI2P,EAAe,EAAQ,MAMvBC,EAHana,MAAMlC,UAGCqc,OA4BxB/c,EAAOD,QAjBP,SAAyB8J,GACvB,IAAIqD,EAAO7M,KAAKqM,SACZpB,EAAQwR,EAAa5P,EAAMrD,GAE/B,QAAIyB,EAAQ,IAIRA,GADY4B,EAAKrH,OAAS,EAE5BqH,EAAK8P,MAELD,EAAOxb,KAAK2L,EAAM5B,EAAO,KAEzBjL,KAAK8M,KACA,qBC/BT,IAAI2P,EAAe,EAAQ,MAkB3B9c,EAAOD,QAPP,SAAsB8J,GACpB,IAAIqD,EAAO7M,KAAKqM,SACZpB,EAAQwR,EAAa5P,EAAMrD,GAE/B,OAAOyB,EAAQ,OAAIhJ,EAAY4K,EAAK5B,GAAO,oBCf7C,IAAIwR,EAAe,EAAQ,MAe3B9c,EAAOD,QAJP,SAAsB8J,GACpB,OAAOiT,EAAazc,KAAKqM,SAAU7C,IAAQ,mBCZ7C,IAAIiT,EAAe,EAAQ,MAyB3B9c,EAAOD,QAbP,SAAsB8J,EAAK9H,GACzB,IAAImL,EAAO7M,KAAKqM,SACZpB,EAAQwR,EAAa5P,EAAMrD,GAQ/B,OANIyB,EAAQ,KACRjL,KAAK8M,KACPD,EAAKrG,KAAK,CAACgD,EAAK9H,KAEhBmL,EAAK5B,GAAO,GAAKvJ,EAEZ1B,sBCtBT,IAAIgL,EAAO,EAAQ,MACfS,EAAY,EAAQ,MACpBC,EAAM,EAAQ,MAkBlB/L,EAAOD,QATP,WACEM,KAAK8M,KAAO,EACZ9M,KAAKqM,SAAW,CACd,KAAQ,IAAIrB,EACZ,IAAO,IAAKU,GAAOD,GACnB,OAAU,IAAIT,oBChBlB,IAAI4R,EAAa,EAAQ,MAiBzBjd,EAAOD,QANP,SAAwB8J,GACtB,IAAIpG,EAASwZ,EAAW5c,KAAMwJ,GAAa,OAAEA,GAE7C,OADAxJ,KAAK8M,MAAQ1J,EAAS,EAAI,EACnBA,kBCdT,IAAIwZ,EAAa,EAAQ,MAezBjd,EAAOD,QAJP,SAAqB8J,GACnB,OAAOoT,EAAW5c,KAAMwJ,GAAKzE,IAAIyE,oBCZnC,IAAIoT,EAAa,EAAQ,MAezBjd,EAAOD,QAJP,SAAqB8J,GACnB,OAAOoT,EAAW5c,KAAMwJ,GAAKrD,IAAIqD,oBCZnC,IAAIoT,EAAa,EAAQ,MAqBzBjd,EAAOD,QATP,SAAqB8J,EAAK9H,GACxB,IAAImL,EAAO+P,EAAW5c,KAAMwJ,GACxBsD,EAAOD,EAAKC,KAIhB,OAFAD,EAAK3I,IAAIsF,EAAK9H,GACd1B,KAAK8M,MAAQD,EAAKC,MAAQA,EAAO,EAAI,EAC9B9M,gBCDTL,EAAOD,QAVP,SAAoB0C,GAClB,IAAI6I,GAAS,EACT7H,EAASb,MAAMH,EAAI0K,MAKvB,OAHA1K,EAAIC,SAAQ,SAASX,EAAO8H,GAC1BpG,IAAS6H,GAAS,CAACzB,EAAK9H,MAEnB0B,aCKTzD,EAAOD,QAVP,SAAiC8J,EAAKmI,GACpC,OAAO,SAAStD,GACd,OAAc,MAAVA,GAGGA,EAAO7E,KAASmI,SACP1P,IAAb0P,GAA2BnI,KAAOxI,OAAOqN,sBCfhD,IAAIwO,EAAU,EAAQ,MAyBtBld,EAAOD,QAZP,SAAuBsN,GACrB,IAAI5J,EAASyZ,EAAQ7P,GAAM,SAASxD,GAIlC,OAfmB,MAYfyM,EAAMnJ,MACRmJ,EAAM/K,QAED1B,KAGLyM,EAAQ7S,EAAO6S,MACnB,OAAO7S,mBCtBT,IAGI2Y,EAHY,EAAQ,IAGLrR,CAAU1J,OAAQ,UAErCrB,EAAOD,QAAUqc,kBCLjB,IAGIjJ,EAHU,EAAQ,KAGLyH,CAAQvZ,OAAOuF,KAAMvF,QAEtCrB,EAAOD,QAAUoT,YCcjBnT,EAAOD,QAVP,SAAsB2O,GACpB,IAAIjL,EAAS,GACb,GAAc,MAAViL,EACF,IAAK,IAAI7E,KAAOxI,OAAOqN,GACrBjL,EAAOoD,KAAKgD,GAGhB,OAAOpG,8BChBT,IAAI2W,EAAa,EAAQ,MAGrB5D,EAA4CzW,IAAYA,EAAQ0W,UAAY1W,EAG5E2W,EAAaF,GAA4CxW,IAAWA,EAAOyW,UAAYzW,EAMvFmd,EAHgBzG,GAAcA,EAAW3W,UAAYyW,GAGtB4D,EAAWgD,QAG1CC,EAAY,WACd,IAIE,OAFY3G,GAAcA,EAAW4G,SAAW5G,EAAW4G,QAAQ,QAAQC,OAOpEJ,GAAeA,EAAYK,SAAWL,EAAYK,QAAQ,QACjE,MAAO1c,KAXI,GAcfd,EAAOD,QAAUsd,YC5BjB,IAOIvC,EAPczZ,OAAOX,UAOcY,SAavCtB,EAAOD,QAJP,SAAwBgC,GACtB,OAAO+Y,EAAqBvZ,KAAKQ,cCJnC/B,EAAOD,QANP,SAAiBsN,EAAMoQ,GACrB,OAAO,SAASC,GACd,OAAOrQ,EAAKoQ,EAAUC,sBCV1B,IAAInQ,EAAQ,EAAQ,MAGhBoQ,EAAYC,KAAKC,IAgCrB7d,EAAOD,QArBP,SAAkBsN,EAAMsI,EAAO8H,GAE7B,OADA9H,EAAQgI,OAAoBrb,IAAVqT,EAAuBtI,EAAKxH,OAAS,EAAK8P,EAAO,GAC5D,WAML,IALA,IAAIrI,EAAOwQ,UACPxS,GAAS,EACTzF,EAAS8X,EAAUrQ,EAAKzH,OAAS8P,EAAO,GACxCnI,EAAQ5K,MAAMiD,KAETyF,EAAQzF,GACf2H,EAAMlC,GAASgC,EAAKqI,EAAQrK,GAE9BA,GAAS,EAET,IADA,IAAIyS,EAAYnb,MAAM+S,EAAQ,KACrBrK,EAAQqK,GACfoI,EAAUzS,GAASgC,EAAKhC,GAG1B,OADAyS,EAAUpI,GAAS8H,EAAUjQ,GACtBD,EAAMF,EAAMhN,KAAM0d,qBC/B7B,IAAI3D,EAAa,EAAQ,MAGrB4D,EAA0B,iBAAR7d,MAAoBA,MAAQA,KAAKkB,SAAWA,QAAUlB,KAGxEN,EAAOua,GAAc4D,GAAYzL,SAAS,cAATA,GAErCvS,EAAOD,QAAUF,YCYjBG,EAAOD,QAZP,SAAiB2O,EAAQ7E,GACvB,IAAY,gBAARA,GAAgD,mBAAhB6E,EAAO7E,KAIhC,aAAPA,EAIJ,OAAO6E,EAAO7E,aCChB7J,EAAOD,QALP,SAAqBgC,GAEnB,OADA1B,KAAKqM,SAASnI,IAAIxC,EAbC,6BAcZ1B,gBCFTL,EAAOD,QAJP,SAAqBgC,GACnB,OAAO1B,KAAKqM,SAASlG,IAAIzE,cCO3B/B,EAAOD,QAVP,SAAoBwE,GAClB,IAAI+G,GAAS,EACT7H,EAASb,MAAM2B,EAAI4I,MAKvB,OAHA5I,EAAI7B,SAAQ,SAASX,GACnB0B,IAAS6H,GAASvJ,KAEb0B,iBCdT,IAAIoS,EAAkB,EAAQ,MAW1BH,EAVW,EAAQ,KAULuI,CAASpI,GAE3B7V,EAAOD,QAAU2V,YCZjB,IAIIwI,EAAYC,KAAKC,IA+BrBpe,EAAOD,QApBP,SAAkBsN,GAChB,IAAIgR,EAAQ,EACRC,EAAa,EAEjB,OAAO,WACL,IAAIC,EAAQL,IACRM,EApBO,IAoBiBD,EAAQD,GAGpC,GADAA,EAAaC,EACTC,EAAY,GACd,KAAMH,GAzBI,IA0BR,OAAOP,UAAU,QAGnBO,EAAQ,EAEV,OAAOhR,EAAKE,WAAMjL,EAAWwb,6BChCjC,IAAIhS,EAAY,EAAQ,MAcxB9L,EAAOD,QALP,WACEM,KAAKqM,SAAW,IAAIZ,EACpBzL,KAAK8M,KAAO,aCMdnN,EAAOD,QARP,SAAqB8J,GACnB,IAAIqD,EAAO7M,KAAKqM,SACZjJ,EAASyJ,EAAa,OAAErD,GAG5B,OADAxJ,KAAK8M,KAAOD,EAAKC,KACV1J,aCDTzD,EAAOD,QAJP,SAAkB8J,GAChB,OAAOxJ,KAAKqM,SAAStH,IAAIyE,cCG3B7J,EAAOD,QAJP,SAAkB8J,GAChB,OAAOxJ,KAAKqM,SAASlG,IAAIqD,oBCV3B,IAAIiC,EAAY,EAAQ,MACpBC,EAAM,EAAQ,MACdM,EAAW,EAAQ,MA+BvBrM,EAAOD,QAhBP,SAAkB8J,EAAK9H,GACrB,IAAImL,EAAO7M,KAAKqM,SAChB,GAAIQ,aAAgBpB,EAAW,CAC7B,IAAI2S,EAAQvR,EAAKR,SACjB,IAAKX,GAAQ0S,EAAM5Y,OAAS6Y,IAG1B,OAFAD,EAAM5X,KAAK,CAACgD,EAAK9H,IACjB1B,KAAK8M,OAASD,EAAKC,KACZ9M,KAET6M,EAAO7M,KAAKqM,SAAW,IAAIL,EAASoS,GAItC,OAFAvR,EAAK3I,IAAIsF,EAAK9H,GACd1B,KAAK8M,KAAOD,EAAKC,KACV9M,sBC9BT,IAAIse,EAAgB,EAAQ,MAGxBC,EAAa,mGAGbC,EAAe,WASftI,EAAeoI,GAAc,SAAS7I,GACxC,IAAIrS,EAAS,GAOb,OAN6B,KAAzBqS,EAAOgJ,WAAW,IACpBrb,EAAOoD,KAAK,IAEdiP,EAAO9N,QAAQ4W,GAAY,SAASG,EAAOC,EAAQC,EAAOC,GACxDzb,EAAOoD,KAAKoY,EAAQC,EAAUlX,QAAQ6W,EAAc,MAASG,GAAUD,MAElEtb,KAGTzD,EAAOD,QAAUwW,iBC1BjB,IAAIL,EAAW,EAAQ,MAoBvBlW,EAAOD,QARP,SAAegC,GACb,GAAoB,iBAATA,GAAqBmU,EAASnU,GACvC,OAAOA,EAET,IAAI0B,EAAU1B,EAAQ,GACtB,MAAkB,KAAV0B,GAAkB,EAAI1B,IAdjB,IAcwC,KAAO0B,YChB9D,IAGIgP,EAHYF,SAAS7R,UAGIY,SAqB7BtB,EAAOD,QAZP,SAAkBsN,GAChB,GAAY,MAARA,EAAc,CAChB,IACE,OAAOoF,EAAalR,KAAK8L,GACzB,MAAOvM,IACT,IACE,OAAQuM,EAAO,GACf,MAAOvM,KAEX,MAAO,cCGTd,EAAOD,QANP,SAAkBgC,GAChB,OAAO,WACL,OAAOA,cCeX/B,EAAOD,QAJP,SAAYgC,EAAOwO,GACjB,OAAOxO,IAAUwO,GAAUxO,GAAUA,GAASwO,GAAUA,mBCjC1D,IAAI0E,EAAU,EAAQ,MAgCtBjV,EAAOD,QALP,SAAa2O,EAAQkB,EAAMuP,GACzB,IAAI1b,EAAmB,MAAViL,OAAiBpM,EAAY2S,EAAQvG,EAAQkB,GAC1D,YAAkBtN,IAAXmB,EAAuB0b,EAAe1b,mBC7B/C,IAAI2b,EAAY,EAAQ,IACpBC,EAAU,EAAQ,KAgCtBrf,EAAOD,QAJP,SAAe2O,EAAQkB,GACrB,OAAiB,MAAVlB,GAAkB2Q,EAAQ3Q,EAAQkB,EAAMwP,cCVjDpf,EAAOD,QAJP,SAAkBgC,GAChB,OAAOA,mBCjBT,IAAIud,EAAkB,EAAQ,MAC1BlP,EAAe,EAAQ,MAGvBoC,EAAcnR,OAAOX,UAGrB+F,EAAiB+L,EAAY/L,eAG7B0U,EAAuB3I,EAAY2I,qBAoBnCvN,EAAc0R,EAAgB,WAAa,OAAOxB,UAApB,IAAsCwB,EAAkB,SAASvd,GACjG,OAAOqO,EAAarO,IAAU0E,EAAelF,KAAKQ,EAAO,YACtDoZ,EAAqB5Z,KAAKQ,EAAO,WAGtC/B,EAAOD,QAAU6N,YCZjB,IAAI/K,EAAUD,MAAMC,QAEpB7C,EAAOD,QAAU8C,kBCzBjB,IAAIqP,EAAa,EAAQ,MACrBU,EAAW,EAAQ,MA+BvB5S,EAAOD,QAJP,SAAqBgC,GACnB,OAAgB,MAATA,GAAiB6Q,EAAS7Q,EAAM8D,UAAYqM,EAAWnQ,oBC7BhE,IAAIuR,EAAc,EAAQ,MACtBlD,EAAe,EAAQ,MA+B3BpQ,EAAOD,QAJP,SAA2BgC,GACzB,OAAOqO,EAAarO,IAAUuR,EAAYvR,+BC7B5C,IAAIlC,EAAO,EAAQ,MACf0f,EAAY,EAAQ,MAGpB/I,EAA4CzW,IAAYA,EAAQ0W,UAAY1W,EAG5E2W,EAAaF,GAA4CxW,IAAWA,EAAOyW,UAAYzW,EAMvF2W,EAHgBD,GAAcA,EAAW3W,UAAYyW,EAG5B3W,EAAK8W,YAASrU,EAsBvCuL,GAnBiB8I,EAASA,EAAO9I,cAAWvL,IAmBfid,EAEjCvf,EAAOD,QAAU8N,kBCrCjB,IAAI2R,EAAW,EAAQ,KACnB3O,EAAS,EAAQ,MACjBjD,EAAc,EAAQ,MACtB/K,EAAU,EAAQ,MAClByQ,EAAc,EAAQ,MACtBzF,EAAW,EAAQ,MACnBqF,EAAc,EAAQ,MACtBnF,EAAe,EAAQ,MAUvBtH,EAHcpF,OAAOX,UAGQ+F,eA2DjCzG,EAAOD,QAxBP,SAAiBgC,GACf,GAAa,MAATA,EACF,OAAO,EAET,GAAIuR,EAAYvR,KACXc,EAAQd,IAA0B,iBAATA,GAA4C,mBAAhBA,EAAMgb,QAC1DlP,EAAS9L,IAAUgM,EAAahM,IAAU6L,EAAY7L,IAC1D,OAAQA,EAAM8D,OAEhB,IAAI8T,EAAM9I,EAAO9O,GACjB,GApDW,gBAoDP4X,GAnDO,gBAmDUA,EACnB,OAAQ5X,EAAMoL,KAEhB,GAAI+F,EAAYnR,GACd,OAAQyd,EAASzd,GAAO8D,OAE1B,IAAK,IAAIgE,KAAO9H,EACd,GAAI0E,EAAelF,KAAKQ,EAAO8H,GAC7B,OAAO,EAGX,OAAO,mBCzET,IAAIsG,EAAa,EAAQ,MACrBvB,EAAW,EAAQ,MAmCvB5O,EAAOD,QAVP,SAAoBgC,GAClB,IAAK6M,EAAS7M,GACZ,OAAO,EAIT,IAAI4X,EAAMxJ,EAAWpO,GACrB,MA5BY,qBA4BL4X,GA3BI,8BA2BcA,GA7BZ,0BA6B6BA,GA1B7B,kBA0BgDA,aCC/D3Z,EAAOD,QALP,SAAkBgC,GAChB,MAAuB,iBAATA,GACZA,GAAS,GAAKA,EAAQ,GAAK,GAAKA,GA9Bb,4BC6BvB/B,EAAOD,QALP,SAAkBgC,GAChB,IAAIsD,SAActD,EAClB,OAAgB,MAATA,IAA0B,UAARsD,GAA4B,YAARA,cCC/CrF,EAAOD,QAJP,SAAsBgC,GACpB,OAAgB,MAATA,GAAiC,iBAATA,mBCzBjC,IAAIoO,EAAa,EAAQ,MACrBwK,EAAe,EAAQ,MACvBvK,EAAe,EAAQ,MAMvBkC,EAAYC,SAAS7R,UACrB8R,EAAcnR,OAAOX,UAGrB+R,EAAeH,EAAUhR,SAGzBmF,EAAiB+L,EAAY/L,eAG7BgZ,EAAmBhN,EAAalR,KAAKF,QA2CzCrB,EAAOD,QAbP,SAAuBgC,GACrB,IAAKqO,EAAarO,IA5CJ,mBA4CcoO,EAAWpO,GACrC,OAAO,EAET,IAAIgN,EAAQ4L,EAAa5Y,GACzB,GAAc,OAAVgN,EACF,OAAO,EAET,IAAIkN,EAAOxV,EAAelF,KAAKwN,EAAO,gBAAkBA,EAAM9F,YAC9D,MAAsB,mBAARgT,GAAsBA,aAAgBA,GAClDxJ,EAAalR,KAAK0a,IAASwD,mBC1D/B,IAAItP,EAAa,EAAQ,MACrBC,EAAe,EAAQ,MA2B3BpQ,EAAOD,QALP,SAAkBgC,GAChB,MAAuB,iBAATA,GACXqO,EAAarO,IArBF,mBAqBYoO,EAAWpO,oBCzBvC,IAAI2d,EAAmB,EAAQ,MAC3BrK,EAAY,EAAQ,MACpBgI,EAAW,EAAQ,MAGnBsC,EAAmBtC,GAAYA,EAAStP,aAmBxCA,EAAe4R,EAAmBtK,EAAUsK,GAAoBD,EAEpE1f,EAAOD,QAAUgO,kBC1BjB,IAAI6R,EAAgB,EAAQ,MACxBJ,EAAW,EAAQ,KACnBlM,EAAc,EAAQ,MAkC1BtT,EAAOD,QAJP,SAAc2O,GACZ,OAAO4E,EAAY5E,GAAUkR,EAAclR,GAAU8Q,EAAS9Q,oBCjChE,IAAIkR,EAAgB,EAAQ,MACxBC,EAAa,EAAQ,KACrBvM,EAAc,EAAQ,MA6B1BtT,EAAOD,QAJP,SAAgB2O,GACd,OAAO4E,EAAY5E,GAAUkR,EAAclR,GAAQ,GAAQmR,EAAWnR,0BC5BxE,iBAQE,WAGA,IAAIpM,EAUAwd,EAAkB,sBAIlBC,EAAiB,4BAMjBC,EAAc,yBAiBdC,EAAoB,GAEpBC,EAAgB,IAkBhBC,EAAW,IACXC,EAAmB,iBAEnBC,EAAM,IAGNC,EAAmB,WAKnBC,EAAY,CACd,CAAC,MAAOL,GACR,CAAC,OAtCkB,GAuCnB,CAAC,UAtCsB,GAuCvB,CAAC,QArCmB,GAsCpB,CAAC,aArCyB,IAsC1B,CAAC,OAjCkB,KAkCnB,CAAC,UAAWD,GACZ,CAAC,eAtC2B,IAuC5B,CAAC,QArCmB,MAyClBnP,EAAU,qBACVC,EAAW,iBAEXyP,EAAU,mBACVC,EAAU,gBAEVC,EAAW,iBACXC,EAAU,oBACVC,EAAS,6BACTrF,EAAS,eACTsF,EAAY,kBAEZ7P,EAAY,kBACZwK,EAAa,mBAEbsF,EAAY,kBACZrF,EAAS,eACTsF,EAAY,kBACZC,EAAY,kBAEZtF,EAAa,mBAGbuF,EAAiB,uBACjBtF,EAAc,oBACduF,EAAa,wBACbC,EAAa,wBACbC,EAAU,qBACVC,EAAW,sBACXC,EAAW,sBACXC,EAAW,sBACXC,EAAkB,6BAClBC,EAAY,uBACZC,EAAY,uBAGZC,EAAuB,iBACvBC,EAAsB,qBACtBC,EAAwB,gCAGxBC,EAAgB,4BAChBC,EAAkB,WAClBC,EAAmBrP,OAAOmP,EAAcjQ,QACxCoQ,EAAqBtP,OAAOoP,EAAgBlQ,QAG5CqQ,EAAW,mBACXC,EAAa,kBACbC,EAAgB,mBAGhB5F,EAAe,mDACfC,EAAgB,QAChBmC,GAAa,mGAMbyD,GAAe,sBACfC,GAAkB3P,OAAO0P,GAAaxQ,QAGtC0Q,GAAc,OAGdC,GAAe,KAGfC,GAAgB,4CAChBC,GAAgB,oCAChBC,GAAiB,QAGjBC,GAAc,4CAYdC,GAA6B,mBAG7BhE,GAAe,WAMfiE,GAAe,kCAGfC,GAAU,OAGVC,GAAa,qBAGbC,GAAa,aAGb5Q,GAAe,8BAGf6Q,GAAY,cAGZ3G,GAAW,mBAGX4G,GAAU,8CAGVC,GAAY,OAGZC,GAAoB,yBAOpBC,GAAeC,gDAEfC,GAAe,4BAKfC,GAAe,4BAEfC,GAAeC,8OAKfC,GAAU,IAAMF,GAAe,IAC/BG,GAAU,IAAMP,GAAe,IAC/BQ,GAAW,OAEXC,GAAU,IAAMP,GAAe,IAC/BQ,GAAS,oBAAuBN,GAAeI,GAlB9B,kBAkB0DN,GAAeC,GAAe,IACzGQ,GAAS,2BAETC,GAAc,qBACdC,GAAa,kCACbC,GAAa,qCACbC,GAAU,IAAMZ,GAAe,IAI/Ba,GAAc,MAAQP,GAAU,IAAMC,GAAS,IAC/CO,GAAc,MAAQF,GAAU,IAAML,GAAS,IAC/CQ,GAAkB,gCAClBC,GAAkB,gCAClBC,GAZa,MAAQb,GAAU,IAAMI,GAY1BU,KACXC,GAAW,oBAIXC,GAAQD,GAAWF,GAHP,gBAAwB,CAACR,GAAaC,GAAYC,IAAYpe,KAAK,KAAO,IAAM4e,GAAWF,GAAW,KAIlHI,GAAU,MAAQ,CAtBN,oBAsBkBX,GAAYC,IAAYpe,KAAK,KAAO,IAAM6e,GACxEE,GAAW,MAAQ,CAACb,GAAcL,GAAU,IAAKA,GAASM,GAAYC,GA3B3D,qBA2BiFpe,KAAK,KAAO,IAGxGgf,GAASrS,OA/BA,OA+Be,KAMxBsS,GAActS,OAAOkR,GAAS,KAG9BqB,GAAYvS,OAAOsR,GAAS,MAAQA,GAAS,KAAOc,GAAWF,GAAO,KAGtEM,GAAgBxS,OAAO,CACzB0R,GAAU,IAAMN,GAAU,IAAMS,GAAkB,MAAQ,CAACZ,GAASS,GAAS,KAAKre,KAAK,KAAO,IAC9Fue,GAAc,IAAME,GAAkB,MAAQ,CAACb,GAASS,GAAUC,GAAa,KAAKte,KAAK,KAAO,IAChGqe,GAAU,IAAMC,GAAc,IAAME,GACpCH,GAAU,IAAMI,GAtBD,mDADA,mDA0BfX,GACAgB,IACA9e,KAAK,KAAM,KAGTof,GAAezS,OAAO,0BAA+B2Q,GAA/B,mBAGtB+B,GAAmB,qEAGnBC,GAAe,CACjB,QAAS,SAAU,WAAY,OAAQ,QAAS,eAAgB,eAChE,WAAY,YAAa,aAAc,aAAc,MAAO,OAAQ,SACpE,UAAW,SAAU,MAAO,SAAU,SAAU,YAAa,aAC7D,oBAAqB,cAAe,cAAe,UACnD,IAAK,eAAgB,WAAY,WAAY,cAI3CC,IAAmB,EAGnB1S,GAAiB,GACrBA,GAAeqO,GAAcrO,GAAesO,GAC5CtO,GAAeuO,GAAWvO,GAAewO,GACzCxO,GAAeyO,GAAYzO,GAAe0O,GAC1C1O,GAAe2O,GAAmB3O,GAAe4O,GACjD5O,GAAe6O,IAAa,EAC5B7O,GAAe/B,GAAW+B,GAAe9B,GACzC8B,GAAeoO,GAAkBpO,GAAe2N,GAChD3N,GAAe8I,GAAe9I,GAAe4N,GAC7C5N,GAAe6N,GAAY7N,GAAe8N,GAC1C9N,GAAe0I,GAAU1I,GAAegO,GACxChO,GAAe7B,GAAa6B,GAAeiO,GAC3CjO,GAAe4I,GAAU5I,GAAekO,GACxClO,GAAe6I,IAAc,EAG7B,IAAI8J,GAAgB,GACpBA,GAAc1U,GAAW0U,GAAczU,GACvCyU,GAAcvE,GAAkBuE,GAAc7J,GAC9C6J,GAAchF,GAAWgF,GAAc/E,GACvC+E,GAActE,GAAcsE,GAAcrE,GAC1CqE,GAAcpE,GAAWoE,GAAcnE,GACvCmE,GAAclE,GAAYkE,GAAcjK,GACxCiK,GAAc3E,GAAa2E,GAAcxU,GACzCwU,GAAc1E,GAAa0E,GAAc/J,GACzC+J,GAAczE,GAAayE,GAAcxE,GACzCwE,GAAcjE,GAAYiE,GAAchE,GACxCgE,GAAc/D,GAAa+D,GAAc9D,IAAa,EACtD8D,GAAc9E,GAAY8E,GAAc7E,GACxC6E,GAAc9J,IAAc,EAG5B,IA4EI+J,GAAgB,CAClB,KAAM,KACN,IAAK,IACL,KAAM,IACN,KAAM,IACN,SAAU,QACV,SAAU,SAIRC,GAAiBC,WACjBC,GAAeC,SAGfzL,GAA8B,iBAAV,EAAAC,GAAsB,EAAAA,GAAU,EAAAA,EAAOhZ,SAAWA,QAAU,EAAAgZ,EAGhF2D,GAA0B,iBAAR7d,MAAoBA,MAAQA,KAAKkB,SAAWA,QAAUlB,KAGxEN,GAAOua,IAAc4D,IAAYzL,SAAS,cAATA,GAGjCiE,GAA4CzW,IAAYA,EAAQ0W,UAAY1W,EAG5E2W,GAAaF,IAA4CxW,IAAWA,EAAOyW,UAAYzW,EAGvF8lB,GAAgBpP,IAAcA,GAAW3W,UAAYyW,GAGrD2G,GAAc2I,IAAiB1L,GAAWgD,QAG1CC,GAAY,WACd,IAIE,OAFY3G,IAAcA,GAAW4G,SAAW5G,GAAW4G,QAAQ,QAAQC,OAOpEJ,IAAeA,GAAYK,SAAWL,GAAYK,QAAQ,QACjE,MAAO1c,KAXI,GAeXilB,GAAoB1I,IAAYA,GAAS2I,cACzCC,GAAa5I,IAAYA,GAAS6I,OAClCC,GAAY9I,IAAYA,GAAS+I,MACjCC,GAAehJ,IAAYA,GAASiJ,SACpCC,GAAYlJ,IAAYA,GAASmJ,MACjC7G,GAAmBtC,IAAYA,GAAStP,aAc5C,SAASR,GAAMF,EAAM1G,EAAS2G,GAC5B,OAAQA,EAAKzH,QACX,KAAK,EAAG,OAAOwH,EAAK9L,KAAKoF,GACzB,KAAK,EAAG,OAAO0G,EAAK9L,KAAKoF,EAAS2G,EAAK,IACvC,KAAK,EAAG,OAAOD,EAAK9L,KAAKoF,EAAS2G,EAAK,GAAIA,EAAK,IAChD,KAAK,EAAG,OAAOD,EAAK9L,KAAKoF,EAAS2G,EAAK,GAAIA,EAAK,GAAIA,EAAK,IAE3D,OAAOD,EAAKE,MAAM5G,EAAS2G,GAa7B,SAASmZ,GAAgBjZ,EAAOkZ,EAAQpY,EAAUqY,GAIhD,IAHA,IAAIrb,GAAS,EACTzF,EAAkB,MAAT2H,EAAgB,EAAIA,EAAM3H,SAE9ByF,EAAQzF,GAAQ,CACvB,IAAI9D,EAAQyL,EAAMlC,GAClBob,EAAOC,EAAa5kB,EAAOuM,EAASvM,GAAQyL,GAE9C,OAAOmZ,EAYT,SAASC,GAAUpZ,EAAOc,GAIxB,IAHA,IAAIhD,GAAS,EACTzF,EAAkB,MAAT2H,EAAgB,EAAIA,EAAM3H,SAE9ByF,EAAQzF,IAC8B,IAAzCyI,EAASd,EAAMlC,GAAQA,EAAOkC,KAIpC,OAAOA,EAYT,SAASqZ,GAAerZ,EAAOc,GAG7B,IAFA,IAAIzI,EAAkB,MAAT2H,EAAgB,EAAIA,EAAM3H,OAEhCA,MAC0C,IAA3CyI,EAASd,EAAM3H,GAASA,EAAQ2H,KAItC,OAAOA,EAaT,SAASsZ,GAAWtZ,EAAOC,GAIzB,IAHA,IAAInC,GAAS,EACTzF,EAAkB,MAAT2H,EAAgB,EAAIA,EAAM3H,SAE9ByF,EAAQzF,GACf,IAAK4H,EAAUD,EAAMlC,GAAQA,EAAOkC,GAClC,OAAO,EAGX,OAAO,EAYT,SAASyN,GAAYzN,EAAOC,GAM1B,IALA,IAAInC,GAAS,EACTzF,EAAkB,MAAT2H,EAAgB,EAAIA,EAAM3H,OACnC6H,EAAW,EACXjK,EAAS,KAEJ6H,EAAQzF,GAAQ,CACvB,IAAI9D,EAAQyL,EAAMlC,GACdmC,EAAU1L,EAAOuJ,EAAOkC,KAC1B/J,EAAOiK,KAAc3L,GAGzB,OAAO0B,EAYT,SAASsjB,GAAcvZ,EAAOzL,GAE5B,QADsB,MAATyL,IAAoBA,EAAM3H,SACpBmhB,GAAYxZ,EAAOzL,EAAO,IAAM,EAYrD,SAASklB,GAAkBzZ,EAAOzL,EAAOmlB,GAIvC,IAHA,IAAI5b,GAAS,EACTzF,EAAkB,MAAT2H,EAAgB,EAAIA,EAAM3H,SAE9ByF,EAAQzF,GACf,GAAIqhB,EAAWnlB,EAAOyL,EAAMlC,IAC1B,OAAO,EAGX,OAAO,EAYT,SAAS0J,GAASxH,EAAOc,GAKvB,IAJA,IAAIhD,GAAS,EACTzF,EAAkB,MAAT2H,EAAgB,EAAIA,EAAM3H,OACnCpC,EAASb,MAAMiD,KAEVyF,EAAQzF,GACfpC,EAAO6H,GAASgD,EAASd,EAAMlC,GAAQA,EAAOkC,GAEhD,OAAO/J,EAWT,SAAS0L,GAAU3B,EAAO1G,GAKxB,IAJA,IAAIwE,GAAS,EACTzF,EAASiB,EAAOjB,OAChB0I,EAASf,EAAM3H,SAEVyF,EAAQzF,GACf2H,EAAMe,EAASjD,GAASxE,EAAOwE,GAEjC,OAAOkC,EAeT,SAAS2Z,GAAY3Z,EAAOc,EAAUqY,EAAaS,GACjD,IAAI9b,GAAS,EACTzF,EAAkB,MAAT2H,EAAgB,EAAIA,EAAM3H,OAKvC,IAHIuhB,GAAavhB,IACf8gB,EAAcnZ,IAAQlC,MAEfA,EAAQzF,GACf8gB,EAAcrY,EAASqY,EAAanZ,EAAMlC,GAAQA,EAAOkC,GAE3D,OAAOmZ,EAeT,SAASU,GAAiB7Z,EAAOc,EAAUqY,EAAaS,GACtD,IAAIvhB,EAAkB,MAAT2H,EAAgB,EAAIA,EAAM3H,OAIvC,IAHIuhB,GAAavhB,IACf8gB,EAAcnZ,IAAQ3H,IAEjBA,KACL8gB,EAAcrY,EAASqY,EAAanZ,EAAM3H,GAASA,EAAQ2H,GAE7D,OAAOmZ,EAaT,SAAShO,GAAUnL,EAAOC,GAIxB,IAHA,IAAInC,GAAS,EACTzF,EAAkB,MAAT2H,EAAgB,EAAIA,EAAM3H,SAE9ByF,EAAQzF,GACf,GAAI4H,EAAUD,EAAMlC,GAAQA,EAAOkC,GACjC,OAAO,EAGX,OAAO,EAUT,IAAI8Z,GAAYC,GAAa,UAmC7B,SAASC,GAAYjU,EAAY9F,EAAW+K,GAC1C,IAAI/U,EAOJ,OANA+U,EAASjF,GAAY,SAASxR,EAAO8H,EAAK0J,GACxC,GAAI9F,EAAU1L,EAAO8H,EAAK0J,GAExB,OADA9P,EAASoG,GACF,KAGJpG,EAcT,SAASgkB,GAAcja,EAAOC,EAAWia,EAAWjP,GAIlD,IAHA,IAAI5S,EAAS2H,EAAM3H,OACfyF,EAAQoc,GAAajP,EAAY,GAAK,GAElCA,EAAYnN,MAAYA,EAAQzF,GACtC,GAAI4H,EAAUD,EAAMlC,GAAQA,EAAOkC,GACjC,OAAOlC,EAGX,OAAQ,EAYV,SAAS0b,GAAYxZ,EAAOzL,EAAO2lB,GACjC,OAAO3lB,GAAUA,EAidnB,SAAuByL,EAAOzL,EAAO2lB,GAInC,IAHA,IAAIpc,EAAQoc,EAAY,EACpB7hB,EAAS2H,EAAM3H,SAEVyF,EAAQzF,GACf,GAAI2H,EAAMlC,KAAWvJ,EACnB,OAAOuJ,EAGX,OAAQ,EAzdJqc,CAAcna,EAAOzL,EAAO2lB,GAC5BD,GAAcja,EAAOoa,GAAWF,GAatC,SAASG,GAAgBra,EAAOzL,EAAO2lB,EAAWR,GAIhD,IAHA,IAAI5b,EAAQoc,EAAY,EACpB7hB,EAAS2H,EAAM3H,SAEVyF,EAAQzF,GACf,GAAIqhB,EAAW1Z,EAAMlC,GAAQvJ,GAC3B,OAAOuJ,EAGX,OAAQ,EAUV,SAASsc,GAAU7lB,GACjB,OAAOA,GAAUA,EAYnB,SAAS+lB,GAASta,EAAOc,GACvB,IAAIzI,EAAkB,MAAT2H,EAAgB,EAAIA,EAAM3H,OACvC,OAAOA,EAAUkiB,GAAQva,EAAOc,GAAYzI,EAAUwa,EAUxD,SAASkH,GAAa1d,GACpB,OAAO,SAAS6E,GACd,OAAiB,MAAVA,EAAiBpM,EAAYoM,EAAO7E,IAW/C,SAASme,GAAetZ,GACtB,OAAO,SAAS7E,GACd,OAAiB,MAAV6E,EAAiBpM,EAAYoM,EAAO7E,IAiB/C,SAASoe,GAAW1U,EAAYjF,EAAUqY,EAAaS,EAAW5O,GAMhE,OALAA,EAASjF,GAAY,SAASxR,EAAOuJ,EAAOiI,GAC1CoT,EAAcS,GACTA,GAAY,EAAOrlB,GACpBuM,EAASqY,EAAa5kB,EAAOuJ,EAAOiI,MAEnCoT,EAgCT,SAASoB,GAAQva,EAAOc,GAKtB,IAJA,IAAI7K,EACA6H,GAAS,EACTzF,EAAS2H,EAAM3H,SAEVyF,EAAQzF,GAAQ,CACvB,IAAIqiB,EAAU5Z,EAASd,EAAMlC,IACzB4c,IAAY5lB,IACdmB,EAASA,IAAWnB,EAAY4lB,EAAWzkB,EAASykB,GAGxD,OAAOzkB,EAYT,SAASkK,GAAUsI,EAAG3H,GAIpB,IAHA,IAAIhD,GAAS,EACT7H,EAASb,MAAMqT,KAEV3K,EAAQ2K,GACfxS,EAAO6H,GAASgD,EAAShD,GAE3B,OAAO7H,EAyBT,SAAS0kB,GAASrS,GAChB,OAAOA,EACHA,EAAO3R,MAAM,EAAGikB,GAAgBtS,GAAU,GAAG9N,QAAQua,GAAa,IAClEzM,EAUN,SAAST,GAAUhI,GACjB,OAAO,SAAStL,GACd,OAAOsL,EAAKtL,IAchB,SAASsmB,GAAW3Z,EAAQsJ,GAC1B,OAAOhD,GAASgD,GAAO,SAASnO,GAC9B,OAAO6E,EAAO7E,MAYlB,SAAS+O,GAAStC,EAAOzM,GACvB,OAAOyM,EAAM9P,IAAIqD,GAYnB,SAASye,GAAgBC,EAAYC,GAInC,IAHA,IAAIld,GAAS,EACTzF,EAAS0iB,EAAW1iB,SAEfyF,EAAQzF,GAAUmhB,GAAYwB,EAAYD,EAAWjd,GAAQ,IAAM,IAC5E,OAAOA,EAYT,SAASmd,GAAcF,EAAYC,GAGjC,IAFA,IAAIld,EAAQid,EAAW1iB,OAEhByF,KAAW0b,GAAYwB,EAAYD,EAAWjd,GAAQ,IAAM,IACnE,OAAOA,EAWT,SAASod,GAAalb,EAAOmb,GAI3B,IAHA,IAAI9iB,EAAS2H,EAAM3H,OACfpC,EAAS,EAENoC,KACD2H,EAAM3H,KAAY8iB,KAClBllB,EAGN,OAAOA,EAWT,IAAImlB,GAAeZ,GAjxBG,CAEpB,EAAQ,IAAM,EAAQ,IAAK,EAAQ,IAAK,EAAQ,IAAK,EAAQ,IAAK,EAAQ,IAC1E,EAAQ,IAAM,EAAQ,IAAK,EAAQ,IAAK,EAAQ,IAAK,EAAQ,IAAK,EAAQ,IAC1E,EAAQ,IAAM,EAAQ,IACtB,EAAQ,IAAM,EAAQ,IACtB,EAAQ,IAAM,EAAQ,IAAK,EAAQ,IAAK,EAAQ,IAChD,EAAQ,IAAM,EAAQ,IAAK,EAAQ,IAAK,EAAQ,IAChD,EAAQ,IAAM,EAAQ,IAAK,EAAQ,IAAK,EAAQ,IAChD,EAAQ,IAAM,EAAQ,IAAK,EAAQ,IAAK,EAAQ,IAChD,EAAQ,IAAM,EAAQ,IACtB,EAAQ,IAAM,EAAQ,IAAK,EAAQ,IAAK,EAAQ,IAAK,EAAQ,IAAK,EAAQ,IAC1E,EAAQ,IAAM,EAAQ,IAAK,EAAQ,IAAK,EAAQ,IAAK,EAAQ,IAAK,EAAQ,IAC1E,EAAQ,IAAM,EAAQ,IAAK,EAAQ,IAAK,EAAQ,IAChD,EAAQ,IAAM,EAAQ,IAAK,EAAQ,IAAK,EAAQ,IAChD,EAAQ,IAAM,EAAQ,IAAK,EAAQ,IACnC,EAAQ,KAAM,EAAQ,KACtB,EAAQ,KAAM,EAAQ,KACtB,EAAQ,KAER,EAAU,IAAM,EAAU,IAAK,EAAU,IACzC,EAAU,IAAM,EAAU,IAAK,EAAU,IACzC,EAAU,IAAM,EAAU,IAAK,EAAU,IAAK,EAAU,IACxD,EAAU,IAAM,EAAU,IAAK,EAAU,IAAK,EAAU,IACxD,EAAU,IAAM,EAAU,IAAK,EAAU,IAAK,EAAU,IACxD,EAAU,IAAM,EAAU,IAAK,EAAU,IAAK,EAAU,IAAK,EAAU,IACvE,EAAU,IAAM,EAAU,IAAK,EAAU,IAAK,EAAU,IAAK,EAAU,IACvE,EAAU,IAAM,EAAU,IAAK,EAAU,IAAK,EAAU,IACxD,EAAU,IAAM,EAAU,IAAK,EAAU,IAAK,EAAU,IACxD,EAAU,IAAM,EAAU,IAAK,EAAU,IAAK,EAAU,IACxD,EAAU,IAAM,EAAU,IAAK,EAAU,IAAK,EAAU,IAAK,EAAU,IACvE,EAAU,IAAM,EAAU,IAAK,EAAU,IAAK,EAAU,IAAK,EAAU,IACvE,EAAU,IAAM,EAAU,IAC1B,EAAU,IAAM,EAAU,IAAK,EAAU,IACzC,EAAU,IAAM,EAAU,IAAK,EAAU,IAAK,EAAU,IAAK,EAAU,IACvE,EAAU,IAAM,EAAU,IAAK,EAAU,IAAK,EAAU,IAAK,EAAU,IACvE,EAAU,IAAM,EAAU,IAAK,EAAU,IAAK,EAAU,IACxD,EAAU,IAAM,EAAU,IAAK,EAAU,IAAK,EAAU,IACxD,EAAU,IAAM,EAAU,IAAK,EAAU,IACzC,EAAU,IAAM,EAAU,IAAK,EAAU,IACzC,EAAU,IAAM,EAAU,IAAK,EAAU,IACzC,EAAU,IAAM,EAAU,IAAK,EAAU,IACzC,EAAU,IAAM,EAAU,IAAK,EAAU,IAAK,EAAU,IACxD,EAAU,IAAM,EAAU,IAAK,EAAU,IAAK,EAAU,IACxD,EAAU,IAAM,EAAU,IAAK,EAAU,IACzC,EAAU,IAAM,EAAU,IAAK,EAAU,IACzC,EAAU,IAAM,EAAU,IAAK,EAAU,IAAK,EAAU,IAAK,EAAU,IAAK,EAAU,IACtF,EAAU,IAAM,EAAU,IAAK,EAAU,IAAK,EAAU,IAAK,EAAU,IAAK,EAAU,IACtF,EAAU,IAAM,EAAU,IAC1B,EAAU,IAAM,EAAU,IAAK,EAAU,IACzC,EAAU,IAAM,EAAU,IAAK,EAAU,IACzC,EAAU,IAAM,EAAU,IAAK,EAAU,IACzC,EAAU,KAAM,EAAU,KAC1B,EAAU,KAAM,EAAU,KAC1B,EAAU,KAAM,EAAU,MAouBxBa,GAAiBb,GAhuBH,CAChB,IAAK,QACL,IAAK,OACL,IAAK,OACL,IAAK,SACL,IAAK,UAouBP,SAASc,GAAiBC,GACxB,MAAO,KAAOtD,GAAcsD,GAsB9B,SAASC,GAAWlT,GAClB,OAAOsP,GAAazjB,KAAKmU,GAsC3B,SAASyD,GAAW9W,GAClB,IAAI6I,GAAS,EACT7H,EAASb,MAAMH,EAAI0K,MAKvB,OAHA1K,EAAIC,SAAQ,SAASX,EAAO8H,GAC1BpG,IAAS6H,GAAS,CAACzB,EAAK9H,MAEnB0B,EAWT,SAASmX,GAAQvN,EAAMoQ,GACrB,OAAO,SAASC,GACd,OAAOrQ,EAAKoQ,EAAUC,KAa1B,SAASuL,GAAezb,EAAOmb,GAM7B,IALA,IAAIrd,GAAS,EACTzF,EAAS2H,EAAM3H,OACf6H,EAAW,EACXjK,EAAS,KAEJ6H,EAAQzF,GAAQ,CACvB,IAAI9D,EAAQyL,EAAMlC,GACdvJ,IAAU4mB,GAAe5mB,IAAUie,IACrCxS,EAAMlC,GAAS0U,EACfvc,EAAOiK,KAAcpC,GAGzB,OAAO7H,EAUT,SAAS+V,GAAWjV,GAClB,IAAI+G,GAAS,EACT7H,EAASb,MAAM2B,EAAI4I,MAKvB,OAHA5I,EAAI7B,SAAQ,SAASX,GACnB0B,IAAS6H,GAASvJ,KAEb0B,EAUT,SAASylB,GAAW3kB,GAClB,IAAI+G,GAAS,EACT7H,EAASb,MAAM2B,EAAI4I,MAKvB,OAHA5I,EAAI7B,SAAQ,SAASX,GACnB0B,IAAS6H,GAAS,CAACvJ,EAAOA,MAErB0B,EAoDT,SAAS0lB,GAAWrT,GAClB,OAAOkT,GAAWlT,GAiDpB,SAAqBA,GAEnB,IADA,IAAIrS,EAASyhB,GAAUkE,UAAY,EAC5BlE,GAAUvjB,KAAKmU,MAClBrS,EAEJ,OAAOA,EArDH4lB,CAAYvT,GACZwR,GAAUxR,GAUhB,SAASwT,GAAcxT,GACrB,OAAOkT,GAAWlT,GAmDpB,SAAwBA,GACtB,OAAOA,EAAOiJ,MAAMmG,KAAc,GAnD9BqE,CAAezT,GA7kBrB,SAAsBA,GACpB,OAAOA,EAAOhO,MAAM,IA6kBhB0hB,CAAa1T,GAWnB,SAASsS,GAAgBtS,GAGvB,IAFA,IAAIxK,EAAQwK,EAAOjQ,OAEZyF,KAAWkX,GAAa7gB,KAAKmU,EAAO2T,OAAOne,MAClD,OAAOA,EAUT,IAAIoe,GAAmB1B,GA38BH,CAClB,QAAS,IACT,OAAQ,IACR,OAAQ,IACR,SAAU,IACV,QAAS,MAk4gBP2B,GAt3ee,SAAUC,EAAaC,GAIxC,IA6BMnN,EA7BF9Z,GAHJinB,EAAqB,MAAXA,EAAkBhqB,GAAO8pB,GAAEG,SAASjqB,GAAKwB,SAAUwoB,EAASF,GAAEI,KAAKlqB,GAAMylB,MAG/D1iB,MAChBub,GAAO0L,EAAQ1L,KACf5Y,GAAQskB,EAAQtkB,MAChBgN,GAAWsX,EAAQtX,SACnBqL,GAAOiM,EAAQjM,KACfvc,GAASwoB,EAAQxoB,OACjBsR,GAASkX,EAAQlX,OACjBjR,GAASmoB,EAAQnoB,OACjBE,GAAYioB,EAAQjoB,UAGpBooB,GAAapnB,EAAMlC,UACnB4R,GAAYC,GAAS7R,UACrB8R,GAAcnR,GAAOX,UAGrBwX,GAAa2R,EAAQ,sBAGrBpX,GAAeH,GAAUhR,SAGzBmF,GAAiB+L,GAAY/L,eAG7BwjB,GAAY,EAGZtN,IACED,EAAM,SAASE,KAAK1E,IAAcA,GAAWtR,MAAQsR,GAAWtR,KAAKiW,UAAY,KACvE,iBAAmBH,EAAO,GAQtC5B,GAAuBtI,GAAYlR,SAGnCme,GAAmBhN,GAAalR,KAAKF,IAGrC6oB,GAAUrqB,GAAK8pB,EAGfjX,GAAaC,GAAO,IACtBF,GAAalR,KAAKkF,IAAgBuB,QAAQqa,GAAc,QACvDra,QAAQ,yDAA0D,SAAW,KAI5E2O,GAASmP,GAAgB+D,EAAQlT,OAASrU,EAC1C1B,GAASipB,EAAQjpB,OACjByD,GAAawlB,EAAQxlB,WACrBuS,GAAcD,GAASA,GAAOC,YAActU,EAC5CqY,GAAeC,GAAQvZ,GAAOwZ,eAAgBxZ,IAC9CwN,GAAexN,GAAO2H,OACtBmS,GAAuB3I,GAAY2I,qBACnC4B,GAASiN,GAAWjN,OACpBV,GAAmBzb,GAASA,GAAO0b,mBAAqBha,EACxD6nB,GAAcvpB,GAASA,GAAOsB,SAAWI,EACzC2N,GAAiBrP,GAASA,GAAOsP,YAAc5N,EAE/CsI,GAAkB,WACpB,IACE,IAAIyC,EAAOtC,GAAU1J,GAAQ,kBAE7B,OADAgM,EAAK,GAAI,GAAI,IACNA,EACP,MAAOvM,KALU,GASjBspB,GAAkBP,EAAQQ,eAAiBxqB,GAAKwqB,cAAgBR,EAAQQ,aACxEC,GAASnM,IAAQA,GAAKC,MAAQve,GAAKse,KAAKC,KAAOD,GAAKC,IACpDmM,GAAgBV,EAAQW,aAAe3qB,GAAK2qB,YAAcX,EAAQW,WAGlEC,GAAa7M,GAAK8M,KAClBC,GAAc/M,GAAKgN,MACnBxP,GAAmB/Z,GAAOga,sBAC1BwP,GAAiBlU,GAASA,GAAO9I,SAAWvL,EAC5CwoB,GAAiBjB,EAAQkB,SACzBC,GAAahB,GAAWhkB,KACxBmN,GAAayH,GAAQvZ,GAAOuF,KAAMvF,IAClCsc,GAAYC,GAAKC,IACjBoN,GAAYrN,GAAKsN,IACjBhN,GAAYC,GAAKC,IACjB+M,GAAiBtB,EAAQhE,SACzBuF,GAAexN,GAAKyN,OACpBC,GAAgBtB,GAAWuB,QAG3BrmB,GAAW6F,GAAU8e,EAAS,YAC9B9d,GAAMhB,GAAU8e,EAAS,OACzB1mB,GAAU4H,GAAU8e,EAAS,WAC7Bvd,GAAMvB,GAAU8e,EAAS,OACzBzc,GAAUrC,GAAU8e,EAAS,WAC7BzN,GAAerR,GAAU1J,GAAQ,UAGjCmqB,GAAUpe,IAAW,IAAIA,GAGzBqe,GAAY,GAGZ7P,GAAqBxJ,GAASlN,IAC9B2W,GAAgBzJ,GAASrG,IACzB+P,GAAoB1J,GAASjP,IAC7B4Y,GAAgB3J,GAAS9F,IACzB0P,GAAoB5J,GAAShF,IAG7B+I,GAAcvV,GAASA,GAAOF,UAAY4B,EAC1CmX,GAAgBtD,GAAcA,GAAYuD,QAAUpX,EACpD8T,GAAiBD,GAAcA,GAAY7U,SAAWgB,EAyH1D,SAASopB,GAAO3pB,GACd,GAAIqO,GAAarO,KAAWc,GAAQd,MAAYA,aAAiB4pB,IAAc,CAC7E,GAAI5pB,aAAiB6pB,GACnB,OAAO7pB,EAET,GAAI0E,GAAelF,KAAKQ,EAAO,eAC7B,OAAO8pB,GAAa9pB,GAGxB,OAAO,IAAI6pB,GAAc7pB,GAW3B,IAAI+M,GAAc,WAChB,SAASJ,KACT,OAAO,SAASK,GACd,IAAKH,GAASG,GACZ,MAAO,GAET,GAAIF,GACF,OAAOA,GAAaE,GAEtBL,EAAOhO,UAAYqO,EACnB,IAAItL,EAAS,IAAIiL,EAEjB,OADAA,EAAOhO,UAAY4B,EACZmB,GAZM,GAqBjB,SAASqoB,MAWT,SAASF,GAAc7pB,EAAOgqB,GAC5B1rB,KAAK2rB,YAAcjqB,EACnB1B,KAAK4rB,YAAc,GACnB5rB,KAAK6rB,YAAcH,EACnB1rB,KAAK8rB,UAAY,EACjB9rB,KAAK+rB,WAAa9pB,EAgFpB,SAASqpB,GAAY5pB,GACnB1B,KAAK2rB,YAAcjqB,EACnB1B,KAAK4rB,YAAc,GACnB5rB,KAAKgsB,QAAU,EACfhsB,KAAKisB,cAAe,EACpBjsB,KAAKksB,cAAgB,GACrBlsB,KAAKmsB,cAAgBlM,EACrBjgB,KAAKosB,UAAY,GAgHnB,SAASphB,GAAKtE,GACZ,IAAIuE,GAAS,EACTzF,EAAoB,MAAXkB,EAAkB,EAAIA,EAAQlB,OAG3C,IADAxF,KAAKkL,UACID,EAAQzF,GAAQ,CACvB,IAAI2F,EAAQzE,EAAQuE,GACpBjL,KAAKkE,IAAIiH,EAAM,GAAIA,EAAM,KAiG7B,SAASM,GAAU/E,GACjB,IAAIuE,GAAS,EACTzF,EAAoB,MAAXkB,EAAkB,EAAIA,EAAQlB,OAG3C,IADAxF,KAAKkL,UACID,EAAQzF,GAAQ,CACvB,IAAI2F,EAAQzE,EAAQuE,GACpBjL,KAAKkE,IAAIiH,EAAM,GAAIA,EAAM,KA8G7B,SAASa,GAAStF,GAChB,IAAIuE,GAAS,EACTzF,EAAoB,MAAXkB,EAAkB,EAAIA,EAAQlB,OAG3C,IADAxF,KAAKkL,UACID,EAAQzF,GAAQ,CACvB,IAAI2F,EAAQzE,EAAQuE,GACpBjL,KAAKkE,IAAIiH,EAAM,GAAIA,EAAM,KAiG7B,SAASiB,GAAS3F,GAChB,IAAIwE,GAAS,EACTzF,EAAmB,MAAViB,EAAiB,EAAIA,EAAOjB,OAGzC,IADAxF,KAAKqM,SAAW,IAAIL,KACXf,EAAQzF,GACfxF,KAAKsM,IAAI7F,EAAOwE,IA6CpB,SAAS2B,GAAMlG,GACb,IAAImG,EAAO7M,KAAKqM,SAAW,IAAIZ,GAAU/E,GACzC1G,KAAK8M,KAAOD,EAAKC,KAqGnB,SAASyS,GAAc7d,EAAOiM,GAC5B,IAAIC,EAAQpL,GAAQd,GAChBmM,GAASD,GAASL,GAAY7L,GAC9BoM,GAAUF,IAAUC,GAASL,GAAS9L,GACtCqM,GAAUH,IAAUC,IAAUC,GAAUJ,GAAahM,GACrDsM,EAAcJ,GAASC,GAASC,GAAUC,EAC1C3K,EAAS4K,EAAcV,GAAU5L,EAAM8D,OAAQnE,IAAU,GACzDmE,EAASpC,EAAOoC,OAEpB,IAAK,IAAIgE,KAAO9H,GACTiM,IAAavH,GAAelF,KAAKQ,EAAO8H,IACvCwE,IAEQ,UAAPxE,GAECsE,IAAkB,UAAPtE,GAA0B,UAAPA,IAE9BuE,IAAkB,UAAPvE,GAA0B,cAAPA,GAA8B,cAAPA,IAEtDiE,GAAQjE,EAAKhE,KAElBpC,EAAOoD,KAAKgD,GAGhB,OAAOpG,EAUT,SAASipB,GAAYlf,GACnB,IAAI3H,EAAS2H,EAAM3H,OACnB,OAAOA,EAAS2H,EAAMmf,GAAW,EAAG9mB,EAAS,IAAMvD,EAWrD,SAASsqB,GAAgBpf,EAAOyI,GAC9B,OAAO4W,GAAYtY,GAAU/G,GAAQsf,GAAU7W,EAAG,EAAGzI,EAAM3H,SAU7D,SAASknB,GAAavf,GACpB,OAAOqf,GAAYtY,GAAU/G,IAY/B,SAASsG,GAAiBpF,EAAQ7E,EAAK9H,IAChCA,IAAUO,IAAcmM,GAAGC,EAAO7E,GAAM9H,IACxCA,IAAUO,KAAeuH,KAAO6E,KACnCF,GAAgBE,EAAQ7E,EAAK9H,GAcjC,SAASgW,GAAYrJ,EAAQ7E,EAAK9H,GAChC,IAAI4M,EAAWD,EAAO7E,GAChBpD,GAAelF,KAAKmN,EAAQ7E,IAAQ4E,GAAGE,EAAU5M,KAClDA,IAAUO,GAAeuH,KAAO6E,IACnCF,GAAgBE,EAAQ7E,EAAK9H,GAYjC,SAAS+a,GAAatP,EAAO3D,GAE3B,IADA,IAAIhE,EAAS2H,EAAM3H,OACZA,KACL,GAAI4I,GAAGjB,EAAM3H,GAAQ,GAAIgE,GACvB,OAAOhE,EAGX,OAAQ,EAcV,SAASmnB,GAAezZ,EAAYmT,EAAQpY,EAAUqY,GAIpD,OAHA1X,GAASsE,GAAY,SAASxR,EAAO8H,EAAK0J,GACxCmT,EAAOC,EAAa5kB,EAAOuM,EAASvM,GAAQwR,MAEvCoT,EAYT,SAASsG,GAAWve,EAAQmD,GAC1B,OAAOnD,GAAUwe,GAAWrb,EAAQjL,GAAKiL,GAASnD,GAyBpD,SAASF,GAAgBE,EAAQ7E,EAAK9H,GACzB,aAAP8H,GAAsBe,GACxBA,GAAe8D,EAAQ7E,EAAK,CAC1B,cAAgB,EAChB,YAAc,EACd,MAAS9H,EACT,UAAY,IAGd2M,EAAO7E,GAAO9H,EAYlB,SAASorB,GAAOze,EAAQ0e,GAMtB,IALA,IAAI9hB,GAAS,EACTzF,EAASunB,EAAMvnB,OACfpC,EAASb,EAAMiD,GACfwnB,EAAiB,MAAV3e,IAEFpD,EAAQzF,GACfpC,EAAO6H,GAAS+hB,EAAO/qB,EAAY8C,GAAIsJ,EAAQ0e,EAAM9hB,IAEvD,OAAO7H,EAYT,SAASqpB,GAAU9N,EAAQsO,EAAOC,GAShC,OARIvO,GAAWA,IACTuO,IAAUjrB,IACZ0c,EAASA,GAAUuO,EAAQvO,EAASuO,GAElCD,IAAUhrB,IACZ0c,EAASA,GAAUsO,EAAQtO,EAASsO,IAGjCtO,EAmBT,SAASwO,GAAUzrB,EAAOyO,EAASC,EAAY5G,EAAK6E,EAAQ3F,GAC1D,IAAItF,EACAoT,EArkFc,EAqkFLrG,EACTid,EArkFc,EAqkFLjd,EACTkd,EArkFiB,EAqkFRld,EAKb,GAHIC,IACFhN,EAASiL,EAAS+B,EAAW1O,EAAO8H,EAAK6E,EAAQ3F,GAAS0H,EAAW1O,IAEnE0B,IAAWnB,EACb,OAAOmB,EAET,IAAKmL,GAAS7M,GACZ,OAAOA,EAET,IAAIkM,EAAQpL,GAAQd,GACpB,GAAIkM,GAEF,GADAxK,EA68GJ,SAAwB+J,GACtB,IAAI3H,EAAS2H,EAAM3H,OACfpC,EAAS,IAAI+J,EAAMvE,YAAYpD,GAOnC,OAJIA,GAA6B,iBAAZ2H,EAAM,IAAkB/G,GAAelF,KAAKiM,EAAO,WACtE/J,EAAO6H,MAAQkC,EAAMlC,MACrB7H,EAAOyD,MAAQsG,EAAMtG,OAEhBzD,EAt9GIkqB,CAAe5rB,IACnB8U,EACH,OAAOtC,GAAUxS,EAAO0B,OAErB,CACL,IAAIkW,EAAM9I,GAAO9O,GACb6rB,EAASjU,GAAOgH,GAAWhH,GAAOiH,EAEtC,GAAI/S,GAAS9L,GACX,OAAOsS,GAAYtS,EAAO8U,GAE5B,GAAI8C,GAAO3I,GAAa2I,GAAO7I,GAAY8c,IAAWlf,GAEpD,GADAjL,EAAUgqB,GAAUG,EAAU,GAAKpZ,GAAgBzS,IAC9C8U,EACH,OAAO4W,EA+nEf,SAAuB5b,EAAQnD,GAC7B,OAAOwe,GAAWrb,EAAQgc,GAAahc,GAASnD,GA/nEtCof,CAAc/rB,EAnH1B,SAAsB2M,EAAQmD,GAC5B,OAAOnD,GAAUwe,GAAWrb,EAAQmC,GAAOnC,GAASnD,GAkHrBqf,CAAatqB,EAAQ1B,IAknEtD,SAAqB8P,EAAQnD,GAC3B,OAAOwe,GAAWrb,EAAQ0I,GAAW1I,GAASnD,GAlnEpCsf,CAAYjsB,EAAOkrB,GAAWxpB,EAAQ1B,QAEvC,CACL,IAAKyjB,GAAc7L,GACjB,OAAOjL,EAAS3M,EAAQ,GAE1B0B,EA49GN,SAAwBiL,EAAQiL,EAAK9C,GACnC,IAzlDmByE,EAylDfW,EAAOvN,EAAOzF,YAClB,OAAQ0Q,GACN,KAAKsH,EACH,OAAOlK,GAAiBrI,GAE1B,KAAK8R,EACL,KAAKC,EACH,OAAO,IAAIxE,GAAMvN,GAEnB,KAAKiN,EACH,OA5nDN,SAAuBsS,EAAUpX,GAC/B,IAAIrS,EAASqS,EAASE,GAAiBkX,EAASzpB,QAAUypB,EAASzpB,OACnE,OAAO,IAAIypB,EAAShlB,YAAYzE,EAAQypB,EAAShX,WAAYgX,EAAS3pB,YA0nD3D4pB,CAAcxf,EAAQmI,GAE/B,KAAKqK,EAAY,KAAKC,EACtB,KAAKC,EAAS,KAAKC,EAAU,KAAKC,EAClC,KAAKC,EAAU,KAAKC,EAAiB,KAAKC,EAAW,KAAKC,EACxD,OAAOpN,GAAgB5F,EAAQmI,GAEjC,KAAK0E,EACH,OAAO,IAAIU,EAEb,KAAK4E,EACL,KAAKE,EACH,OAAO,IAAI9E,EAAKvN,GAElB,KAAKoS,EACH,OA/nDN,SAAqBqN,GACnB,IAAI1qB,EAAS,IAAI0qB,EAAOllB,YAAYklB,EAAOtc,OAAQkR,GAAQnG,KAAKuR,IAEhE,OADA1qB,EAAO2lB,UAAY+E,EAAO/E,UACnB3lB,EA4nDI2qB,CAAY1f,GAErB,KAAK+M,EACH,OAAO,IAAIQ,EAEb,KAAK+E,EACH,OAxnDe1F,EAwnDI5M,EAvnDhB+K,GAAgBpY,GAAOoY,GAAclY,KAAK+Z,IAAW,IAr4D/C+S,CAAetsB,EAAO4X,EAAK9C,IAIxC9N,IAAUA,EAAQ,IAAIkE,IACtB,IAAI4H,EAAU9L,EAAM3D,IAAIrD,GACxB,GAAI8S,EACF,OAAOA,EAET9L,EAAMxE,IAAIxC,EAAO0B,GAEb+iB,GAAMzkB,GACRA,EAAMW,SAAQ,SAAS4rB,GACrB7qB,EAAOkJ,IAAI6gB,GAAUc,EAAU9d,EAASC,EAAY6d,EAAUvsB,EAAOgH,OAE9Dqd,GAAMrkB,IACfA,EAAMW,SAAQ,SAAS4rB,EAAUzkB,GAC/BpG,EAAOc,IAAIsF,EAAK2jB,GAAUc,EAAU9d,EAASC,EAAY5G,EAAK9H,EAAOgH,OAIzE,IAIIiP,EAAQ/J,EAAQ3L,GAJLorB,EACVD,EAASc,GAAe1U,GACxB4T,EAASzZ,GAASpN,IAEkB7E,GASzC,OARA6kB,GAAU5O,GAASjW,GAAO,SAASusB,EAAUzkB,GACvCmO,IAEFsW,EAAWvsB,EADX8H,EAAMykB,IAIRvW,GAAYtU,EAAQoG,EAAK2jB,GAAUc,EAAU9d,EAASC,EAAY5G,EAAK9H,EAAOgH,OAEzEtF,EAyBT,SAAS+qB,GAAe9f,EAAQmD,EAAQmG,GACtC,IAAInS,EAASmS,EAAMnS,OACnB,GAAc,MAAV6I,EACF,OAAQ7I,EAGV,IADA6I,EAASrN,GAAOqN,GACT7I,KAAU,CACf,IAAIgE,EAAMmO,EAAMnS,GACZ4H,EAAYoE,EAAOhI,GACnB9H,EAAQ2M,EAAO7E,GAEnB,GAAK9H,IAAUO,KAAeuH,KAAO6E,KAAajB,EAAU1L,GAC1D,OAAO,EAGX,OAAO,EAaT,SAAS0sB,GAAUphB,EAAMqhB,EAAMphB,GAC7B,GAAmB,mBAARD,EACT,MAAM,IAAIzL,GAAUke,GAEtB,OAAO0K,IAAW,WAAand,EAAKE,MAAMjL,EAAWgL,KAAUohB,GAcjE,SAASC,GAAenhB,EAAO1G,EAAQwH,EAAU4Y,GAC/C,IAAI5b,GAAS,EACTsjB,EAAW7H,GACXjS,GAAW,EACXjP,EAAS2H,EAAM3H,OACfpC,EAAS,GACTorB,EAAe/nB,EAAOjB,OAE1B,IAAKA,EACH,OAAOpC,EAEL6K,IACFxH,EAASkO,GAASlO,EAAQuO,GAAU/G,KAElC4Y,GACF0H,EAAW3H,GACXnS,GAAW,GAEJhO,EAAOjB,QAtvFG,MAuvFjB+oB,EAAWhW,GACX9D,GAAW,EACXhO,EAAS,IAAI2F,GAAS3F,IAExBgoB,EACA,OAASxjB,EAAQzF,GAAQ,CACvB,IAAI9D,EAAQyL,EAAMlC,GACdyjB,EAAuB,MAAZzgB,EAAmBvM,EAAQuM,EAASvM,GAGnD,GADAA,EAASmlB,GAAwB,IAAVnlB,EAAeA,EAAQ,EAC1C+S,GAAYia,GAAaA,EAAU,CAErC,IADA,IAAIC,EAAcH,EACXG,KACL,GAAIloB,EAAOkoB,KAAiBD,EAC1B,SAASD,EAGbrrB,EAAOoD,KAAK9E,QAEJ6sB,EAAS9nB,EAAQioB,EAAU7H,IACnCzjB,EAAOoD,KAAK9E,GAGhB,OAAO0B,EAjkCTioB,GAAOuD,iBAAmB,CAQxB,OAAU/M,EAQV,SAAYC,EAQZ,YAAeC,EAQf,SAAY,GAQZ,QAAW,CAQT,EAAKsJ,KAKTA,GAAOhrB,UAAYorB,GAAWprB,UAC9BgrB,GAAOhrB,UAAUuI,YAAcyiB,GAE/BE,GAAclrB,UAAYoO,GAAWgd,GAAWprB,WAChDkrB,GAAclrB,UAAUuI,YAAc2iB,GAsHtCD,GAAYjrB,UAAYoO,GAAWgd,GAAWprB,WAC9CirB,GAAYjrB,UAAUuI,YAAc0iB,GAoGpCtgB,GAAK3K,UAAU6K,MAvEf,WACElL,KAAKqM,SAAW0P,GAAeA,GAAa,MAAQ,GACpD/b,KAAK8M,KAAO,GAsEd9B,GAAK3K,UAAkB,OAzDvB,SAAoBmJ,GAClB,IAAIpG,EAASpD,KAAKmG,IAAIqD,WAAexJ,KAAKqM,SAAS7C,GAEnD,OADAxJ,KAAK8M,MAAQ1J,EAAS,EAAI,EACnBA,GAuDT4H,GAAK3K,UAAU0E,IA3Cf,SAAiByE,GACf,IAAIqD,EAAO7M,KAAKqM,SAChB,GAAI0P,GAAc,CAChB,IAAI3Y,EAASyJ,EAAKrD,GAClB,OAAOpG,IAAWsc,EAAiBzd,EAAYmB,EAEjD,OAAOgD,GAAelF,KAAK2L,EAAMrD,GAAOqD,EAAKrD,GAAOvH,GAsCtD+I,GAAK3K,UAAU8F,IA1Bf,SAAiBqD,GACf,IAAIqD,EAAO7M,KAAKqM,SAChB,OAAO0P,GAAgBlP,EAAKrD,KAASvH,EAAamE,GAAelF,KAAK2L,EAAMrD,IAyB9EwB,GAAK3K,UAAU6D,IAZf,SAAiBsF,EAAK9H,GACpB,IAAImL,EAAO7M,KAAKqM,SAGhB,OAFArM,KAAK8M,MAAQ9M,KAAKmG,IAAIqD,GAAO,EAAI,EACjCqD,EAAKrD,GAAQuS,IAAgBra,IAAUO,EAAayd,EAAiBhe,EAC9D1B,MAyHTyL,GAAUpL,UAAU6K,MApFpB,WACElL,KAAKqM,SAAW,GAChBrM,KAAK8M,KAAO,GAmFdrB,GAAUpL,UAAkB,OAvE5B,SAAyBmJ,GACvB,IAAIqD,EAAO7M,KAAKqM,SACZpB,EAAQwR,GAAa5P,EAAMrD,GAE/B,QAAIyB,EAAQ,IAIRA,GADY4B,EAAKrH,OAAS,EAE5BqH,EAAK8P,MAELD,GAAOxb,KAAK2L,EAAM5B,EAAO,KAEzBjL,KAAK8M,KACA,KA0DTrB,GAAUpL,UAAU0E,IA9CpB,SAAsByE,GACpB,IAAIqD,EAAO7M,KAAKqM,SACZpB,EAAQwR,GAAa5P,EAAMrD,GAE/B,OAAOyB,EAAQ,EAAIhJ,EAAY4K,EAAK5B,GAAO,IA2C7CQ,GAAUpL,UAAU8F,IA/BpB,SAAsBqD,GACpB,OAAOiT,GAAazc,KAAKqM,SAAU7C,IAAQ,GA+B7CiC,GAAUpL,UAAU6D,IAlBpB,SAAsBsF,EAAK9H,GACzB,IAAImL,EAAO7M,KAAKqM,SACZpB,EAAQwR,GAAa5P,EAAMrD,GAQ/B,OANIyB,EAAQ,KACRjL,KAAK8M,KACPD,EAAKrG,KAAK,CAACgD,EAAK9H,KAEhBmL,EAAK5B,GAAO,GAAKvJ,EAEZ1B,MA2GTgM,GAAS3L,UAAU6K,MAtEnB,WACElL,KAAK8M,KAAO,EACZ9M,KAAKqM,SAAW,CACd,KAAQ,IAAIrB,GACZ,IAAO,IAAKU,IAAOD,IACnB,OAAU,IAAIT,KAkElBgB,GAAS3L,UAAkB,OArD3B,SAAwBmJ,GACtB,IAAIpG,EAASwZ,GAAW5c,KAAMwJ,GAAa,OAAEA,GAE7C,OADAxJ,KAAK8M,MAAQ1J,EAAS,EAAI,EACnBA,GAmDT4I,GAAS3L,UAAU0E,IAvCnB,SAAqByE,GACnB,OAAOoT,GAAW5c,KAAMwJ,GAAKzE,IAAIyE,IAuCnCwC,GAAS3L,UAAU8F,IA3BnB,SAAqBqD,GACnB,OAAOoT,GAAW5c,KAAMwJ,GAAKrD,IAAIqD,IA2BnCwC,GAAS3L,UAAU6D,IAdnB,SAAqBsF,EAAK9H,GACxB,IAAImL,EAAO+P,GAAW5c,KAAMwJ,GACxBsD,EAAOD,EAAKC,KAIhB,OAFAD,EAAK3I,IAAIsF,EAAK9H,GACd1B,KAAK8M,MAAQD,EAAKC,MAAQA,EAAO,EAAI,EAC9B9M,MA2DToM,GAAS/L,UAAUiM,IAAMF,GAAS/L,UAAUmG,KAnB5C,SAAqB9E,GAEnB,OADA1B,KAAKqM,SAASnI,IAAIxC,EAAOge,GAClB1f,MAkBToM,GAAS/L,UAAU8F,IANnB,SAAqBzE,GACnB,OAAO1B,KAAKqM,SAASlG,IAAIzE,IAuG3BkL,GAAMvM,UAAU6K,MA3EhB,WACElL,KAAKqM,SAAW,IAAIZ,GACpBzL,KAAK8M,KAAO,GA0EdF,GAAMvM,UAAkB,OA9DxB,SAAqBmJ,GACnB,IAAIqD,EAAO7M,KAAKqM,SACZjJ,EAASyJ,EAAa,OAAErD,GAG5B,OADAxJ,KAAK8M,KAAOD,EAAKC,KACV1J,GA0DTwJ,GAAMvM,UAAU0E,IA9ChB,SAAkByE,GAChB,OAAOxJ,KAAKqM,SAAStH,IAAIyE,IA8C3BoD,GAAMvM,UAAU8F,IAlChB,SAAkBqD,GAChB,OAAOxJ,KAAKqM,SAASlG,IAAIqD,IAkC3BoD,GAAMvM,UAAU6D,IArBhB,SAAkBsF,EAAK9H,GACrB,IAAImL,EAAO7M,KAAKqM,SAChB,GAAIQ,aAAgBpB,GAAW,CAC7B,IAAI2S,EAAQvR,EAAKR,SACjB,IAAKX,IAAQ0S,EAAM5Y,OAAS6Y,IAG1B,OAFAD,EAAM5X,KAAK,CAACgD,EAAK9H,IACjB1B,KAAK8M,OAASD,EAAKC,KACZ9M,KAET6M,EAAO7M,KAAKqM,SAAW,IAAIL,GAASoS,GAItC,OAFAvR,EAAK3I,IAAIsF,EAAK9H,GACd1B,KAAK8M,KAAOD,EAAKC,KACV9M,MAscT,IAAI4O,GAAWC,GAAeF,IAU1BkgB,GAAgBhgB,GAAeigB,IAAiB,GAWpD,SAASC,GAAU7b,EAAY9F,GAC7B,IAAIhK,GAAS,EAKb,OAJAwL,GAASsE,GAAY,SAASxR,EAAOuJ,EAAOiI,GAE1C,OADA9P,IAAWgK,EAAU1L,EAAOuJ,EAAOiI,MAG9B9P,EAaT,SAAS4rB,GAAa7hB,EAAOc,EAAU4Y,GAIrC,IAHA,IAAI5b,GAAS,EACTzF,EAAS2H,EAAM3H,SAEVyF,EAAQzF,GAAQ,CACvB,IAAI9D,EAAQyL,EAAMlC,GACd4c,EAAU5Z,EAASvM,GAEvB,GAAe,MAAXmmB,IAAoB6G,IAAazsB,EAC5B4lB,GAAYA,IAAYhS,GAASgS,GAClChB,EAAWgB,EAAS6G,IAE1B,IAAIA,EAAW7G,EACXzkB,EAAS1B,EAGjB,OAAO0B,EAuCT,SAAS6rB,GAAW/b,EAAY9F,GAC9B,IAAIhK,EAAS,GAMb,OALAwL,GAASsE,GAAY,SAASxR,EAAOuJ,EAAOiI,GACtC9F,EAAU1L,EAAOuJ,EAAOiI,IAC1B9P,EAAOoD,KAAK9E,MAGT0B,EAcT,SAAS4L,GAAY7B,EAAO8B,EAAO7B,EAAW8B,EAAU9L,GACtD,IAAI6H,GAAS,EACTzF,EAAS2H,EAAM3H,OAKnB,IAHA4H,IAAcA,EAAY2B,IAC1B3L,IAAWA,EAAS,MAEX6H,EAAQzF,GAAQ,CACvB,IAAI9D,EAAQyL,EAAMlC,GACdgE,EAAQ,GAAK7B,EAAU1L,GACrBuN,EAAQ,EAEVD,GAAYtN,EAAOuN,EAAQ,EAAG7B,EAAW8B,EAAU9L,GAEnD0L,GAAU1L,EAAQ1B,GAEVwN,IACV9L,EAAOA,EAAOoC,QAAU9D,GAG5B,OAAO0B,EAcT,IAAI+L,GAAUC,KAYV8f,GAAe9f,IAAc,GAUjC,SAAST,GAAWN,EAAQJ,GAC1B,OAAOI,GAAUc,GAAQd,EAAQJ,EAAU1H,IAW7C,SAASuoB,GAAgBzgB,EAAQJ,GAC/B,OAAOI,GAAU6gB,GAAa7gB,EAAQJ,EAAU1H,IAYlD,SAAS4oB,GAAc9gB,EAAQsJ,GAC7B,OAAOiD,GAAYjD,GAAO,SAASnO,GACjC,OAAOqI,GAAWxD,EAAO7E,OAY7B,SAASoL,GAAQvG,EAAQkB,GAMvB,IAHA,IAAItE,EAAQ,EACRzF,GAHJ+J,EAAOF,GAASE,EAAMlB,IAGJ7I,OAED,MAAV6I,GAAkBpD,EAAQzF,GAC/B6I,EAASA,EAAOiB,GAAMC,EAAKtE,OAE7B,OAAQA,GAASA,GAASzF,EAAU6I,EAASpM,EAc/C,SAASgY,GAAe5L,EAAQmB,EAAUC,GACxC,IAAIrM,EAASoM,EAASnB,GACtB,OAAO7L,GAAQ6L,GAAUjL,EAAS0L,GAAU1L,EAAQqM,EAAYpB,IAUlE,SAASyB,GAAWpO,GAClB,OAAa,MAATA,EACKA,IAAUO,EAn7FJ,qBARL,gBA67FF2N,IAAkBA,MAAkB5O,GAAOU,GA23FrD,SAAmBA,GACjB,IAAIgZ,EAAQtU,GAAelF,KAAKQ,EAAOkO,IACnC0J,EAAM5X,EAAMkO,IAEhB,IACElO,EAAMkO,IAAkB3N,EACxB,IAAI0Y,GAAW,EACf,MAAOla,IAET,IAAI2C,EAASqX,GAAqBvZ,KAAKQ,GAQvC,OAPIiZ,IACED,EACFhZ,EAAMkO,IAAkB0J,SAEjB5X,EAAMkO,KAGVxM,EA34FHsM,CAAUhO,GA+5GhB,SAAwBA,GACtB,OAAO+Y,GAAqBvZ,KAAKQ,GA/5G7BiO,CAAejO,GAYrB,SAAS0tB,GAAO1tB,EAAOwO,GACrB,OAAOxO,EAAQwO,EAWjB,SAASmf,GAAQhhB,EAAQ7E,GACvB,OAAiB,MAAV6E,GAAkBjI,GAAelF,KAAKmN,EAAQ7E,GAWvD,SAASuV,GAAU1Q,EAAQ7E,GACzB,OAAiB,MAAV6E,GAAkB7E,KAAOxI,GAAOqN,GA0BzC,SAASihB,GAAiBC,EAAQthB,EAAU4Y,GAS1C,IARA,IAAI0H,EAAW1H,EAAaD,GAAoBF,GAC5ClhB,EAAS+pB,EAAO,GAAG/pB,OACnBkT,EAAY6W,EAAO/pB,OACnByT,EAAWP,EACX8W,EAASjtB,EAAMmW,GACf+W,EAAYC,EAAAA,EACZtsB,EAAS,GAEN6V,KAAY,CACjB,IAAI9L,EAAQoiB,EAAOtW,GACfA,GAAYhL,IACdd,EAAQwH,GAASxH,EAAO6H,GAAU/G,KAEpCwhB,EAAY7E,GAAUzd,EAAM3H,OAAQiqB,GACpCD,EAAOvW,IAAa4N,IAAe5Y,GAAazI,GAAU,KAAO2H,EAAM3H,QAAU,KAC7E,IAAI4G,GAAS6M,GAAY9L,GACzBlL,EAENkL,EAAQoiB,EAAO,GAEf,IAAItkB,GAAS,EACT4N,EAAO2W,EAAO,GAElBf,EACA,OAASxjB,EAAQzF,GAAUpC,EAAOoC,OAASiqB,GAAW,CACpD,IAAI/tB,EAAQyL,EAAMlC,GACdyjB,EAAWzgB,EAAWA,EAASvM,GAASA,EAG5C,GADAA,EAASmlB,GAAwB,IAAVnlB,EAAeA,EAAQ,IACxCmX,EACEN,GAASM,EAAM6V,GACfH,EAASnrB,EAAQsrB,EAAU7H,IAC5B,CAEL,IADA5N,EAAWP,IACFO,GAAU,CACjB,IAAIhD,EAAQuZ,EAAOvW,GACnB,KAAMhD,EACEsC,GAAStC,EAAOyY,GAChBH,EAASgB,EAAOtW,GAAWyV,EAAU7H,IAE3C,SAAS4H,EAGT5V,GACFA,EAAKrS,KAAKkoB,GAEZtrB,EAAOoD,KAAK9E,IAGhB,OAAO0B,EA+BT,SAASusB,GAAWthB,EAAQkB,EAAMtC,GAGhC,IAAID,EAAiB,OADrBqB,EAASuhB,GAAOvhB,EADhBkB,EAAOF,GAASE,EAAMlB,KAEMA,EAASA,EAAOiB,GAAMugB,GAAKtgB,KACvD,OAAe,MAARvC,EAAe/K,EAAYiL,GAAMF,EAAMqB,EAAQpB,GAUxD,SAASgS,GAAgBvd,GACvB,OAAOqO,GAAarO,IAAUoO,GAAWpO,IAAU+O,EAuCrD,SAASR,GAAYvO,EAAOwO,EAAOC,EAASC,EAAY1H,GACtD,OAAIhH,IAAUwO,IAGD,MAATxO,GAA0B,MAATwO,IAAmBH,GAAarO,KAAWqO,GAAaG,GACpExO,GAAUA,GAASwO,GAAUA,EAmBxC,SAAyB7B,EAAQ6B,EAAOC,EAASC,EAAYQ,EAAWlI,GACtE,IAAImI,EAAWrO,GAAQ6L,GACnByC,EAAWtO,GAAQ0N,GACnBa,EAASF,EAAWH,EAAWF,GAAOnC,GACtC2C,EAASF,EAAWJ,EAAWF,GAAON,GAKtCe,GAHJF,EAASA,GAAUN,EAAUE,EAAYI,IAGhBJ,EACrBO,GAHJF,EAASA,GAAUP,EAAUE,EAAYK,IAGhBL,EACrBQ,EAAYJ,GAAUC,EAE1B,GAAIG,GAAa3D,GAASa,GAAS,CACjC,IAAKb,GAAS0C,GACZ,OAAO,EAETW,GAAW,EACXI,GAAW,EAEb,GAAIE,IAAcF,EAEhB,OADAvI,IAAUA,EAAQ,IAAIkE,IACdiE,GAAYnD,GAAaW,GAC7BgC,GAAYhC,EAAQ6B,EAAOC,EAASC,EAAYQ,EAAWlI,GA81EnE,SAAoB2F,EAAQ6B,EAAOoJ,EAAKnJ,EAASC,EAAYQ,EAAWlI,GACtE,OAAQ4Q,GACN,KAAKgC,EACH,GAAKjN,EAAOpK,YAAciM,EAAMjM,YAC3BoK,EAAOuI,YAAc1G,EAAM0G,WAC9B,OAAO,EAETvI,EAASA,EAAOlK,OAChB+L,EAAQA,EAAM/L,OAEhB,KAAKyc,EACH,QAAKvS,EAAOpK,YAAciM,EAAMjM,aAC3B2M,EAAU,IAAI5M,GAAWqK,GAAS,IAAIrK,GAAWkM,KAKxD,KAAKiQ,EACL,KAAKC,EACL,KAAKI,EAGH,OAAOpS,IAAIC,GAAS6B,GAEtB,KAAKmQ,EACH,OAAOhS,EAAOjN,MAAQ8O,EAAM9O,MAAQiN,EAAO5F,SAAWyH,EAAMzH,QAE9D,KAAKgY,EACL,KAAKC,EAIH,OAAOrS,GAAW6B,EAAQ,GAE5B,KAAKgL,EACH,IAAI3B,EAAUL,GAEhB,KAAKkC,EACH,IAAI5C,EAxnLe,EAwnLHrI,EAGhB,GAFAoJ,IAAYA,EAAUJ,IAElB9K,EAAOvB,MAAQoD,EAAMpD,OAAS0L,EAChC,OAAO,EAGT,IAAIhE,EAAU9L,EAAM3D,IAAIsJ,GACxB,GAAImG,EACF,OAAOA,GAAWtE,EAEpBC,GAloLqB,EAqoLrBzH,EAAMxE,IAAImK,EAAQ6B,GAClB,IAAI9M,EAASiN,GAAYkJ,EAAQlL,GAASkL,EAAQrJ,GAAQC,EAASC,EAAYQ,EAAWlI,GAE1F,OADAA,EAAc,OAAE2F,GACTjL,EAET,KAAKud,EACH,GAAIvH,GACF,OAAOA,GAAclY,KAAKmN,IAAW+K,GAAclY,KAAKgP,GAG9D,OAAO,EA35EDI,CAAWjC,EAAQ6B,EAAOa,EAAQZ,EAASC,EAAYQ,EAAWlI,GAExE,KAvvGuB,EAuvGjByH,GAAiC,CACrC,IAAIiB,EAAeH,GAAY7K,GAAelF,KAAKmN,EAAQ,eACvDgD,EAAeH,GAAY9K,GAAelF,KAAKgP,EAAO,eAE1D,GAAIkB,GAAgBC,EAAc,CAChC,IAAIC,EAAeF,EAAe/C,EAAO3M,QAAU2M,EAC/CkD,EAAeF,EAAenB,EAAMxO,QAAUwO,EAGlD,OADAxH,IAAUA,EAAQ,IAAIkE,IACfgE,EAAUU,EAAcC,EAAcpB,EAASC,EAAY1H,IAGtE,QAAKyI,IAGLzI,IAAUA,EAAQ,IAAIkE,IA05ExB,SAAsByB,EAAQ6B,EAAOC,EAASC,EAAYQ,EAAWlI,GACnE,IAAI8P,EAjqLmB,EAiqLPrI,EACZsJ,EAAWD,GAAWnL,GACtBqL,EAAYD,EAASjU,OAIzB,GAAIkU,GAHWF,GAAWtJ,GACD1K,SAEMgT,EAC7B,OAAO,EAGT,IADA,IAAIvN,EAAQyO,EACLzO,KAAS,CACd,IAAIzB,EAAMiQ,EAASxO,GACnB,KAAMuN,EAAYhP,KAAO0G,EAAQ9J,GAAelF,KAAKgP,EAAO1G,IAC1D,OAAO,EAIX,IAAImQ,EAAajR,EAAM3D,IAAIsJ,GACvBuK,EAAalQ,EAAM3D,IAAImL,GAC3B,GAAIyJ,GAAcf,EAChB,OAAOe,GAAczJ,GAAS0I,GAAcvK,EAE9C,IAAIjL,GAAS,EACbsF,EAAMxE,IAAImK,EAAQ6B,GAClBxH,EAAMxE,IAAIgM,EAAO7B,GAGjB,IADA,IAAIuL,EAAWpB,IACNvN,EAAQyO,GAAW,CAE1B,IAAIpL,EAAWD,EADf7E,EAAMiQ,EAASxO,IAEX8N,EAAW7I,EAAM1G,GAErB,GAAI4G,EACF,IAAI4I,EAAWR,EACXpI,EAAW2I,EAAUzK,EAAU9E,EAAK0G,EAAO7B,EAAQ3F,GACnD0H,EAAW9B,EAAUyK,EAAUvP,EAAK6E,EAAQ6B,EAAOxH,GAGzD,KAAMsQ,IAAa/W,EACVqM,IAAayK,GAAYnI,EAAUtC,EAAUyK,EAAU5I,EAASC,EAAY1H,GAC7EsQ,GACD,CACL5V,GAAS,EACT,MAEFwW,IAAaA,EAAkB,eAAPpQ,GAE1B,GAAIpG,IAAWwW,EAAU,CACvB,IAAIC,EAAUxL,EAAOzF,YACjBkR,EAAU5J,EAAMtH,YAGhBiR,GAAWC,KACV,gBAAiBzL,MAAU,gBAAiB6B,IACzB,mBAAX2J,GAAyBA,aAAmBA,GACjC,mBAAXC,GAAyBA,aAAmBA,IACvD1W,GAAS,GAKb,OAFAsF,EAAc,OAAE2F,GAChB3F,EAAc,OAAEwH,GACT9M,EAv9EAmN,CAAalC,EAAQ6B,EAAOC,EAASC,EAAYQ,EAAWlI,IA3D5DsH,CAAgBtO,EAAOwO,EAAOC,EAASC,EAAYH,GAAavH,IAmFzE,SAASyK,GAAY9E,EAAQmD,EAAQC,EAAWrB,GAC9C,IAAInF,EAAQwG,EAAUjM,OAClBA,EAASyF,EACTyG,GAAgBtB,EAEpB,GAAc,MAAV/B,EACF,OAAQ7I,EAGV,IADA6I,EAASrN,GAAOqN,GACTpD,KAAS,CACd,IAAI4B,EAAO4E,EAAUxG,GACrB,GAAKyG,GAAgB7E,EAAK,GAClBA,EAAK,KAAOwB,EAAOxB,EAAK,MACtBA,EAAK,KAAMwB,GAEnB,OAAO,EAGX,OAASpD,EAAQzF,GAAQ,CAEvB,IAAIgE,GADJqD,EAAO4E,EAAUxG,IACF,GACXqD,EAAWD,EAAO7E,GAClBmI,EAAW9E,EAAK,GAEpB,GAAI6E,GAAgB7E,EAAK,IACvB,GAAIyB,IAAarM,KAAeuH,KAAO6E,GACrC,OAAO,MAEJ,CACL,IAAI3F,EAAQ,IAAIkE,GAChB,GAAIwD,EACF,IAAIhN,EAASgN,EAAW9B,EAAUqD,EAAUnI,EAAK6E,EAAQmD,EAAQ9I,GAEnE,KAAMtF,IAAWnB,EACTgO,GAAY0B,EAAUrD,EAAUsD,EAA+CxB,EAAY1H,GAC3FtF,GAEN,OAAO,GAIb,OAAO,EAWT,SAASgX,GAAa1Y,GACpB,SAAK6M,GAAS7M,KA05FEsL,EA15FiBtL,EA25FxB4a,IAAeA,MAActP,MAx5FxB6E,GAAWnQ,GAAS2Q,GAAaL,IAChC1Q,KAAKyQ,GAASrQ,IAs5F/B,IAAkBsL,EA12FlB,SAAS6H,GAAanT,GAGpB,MAAoB,mBAATA,EACFA,EAEI,MAATA,EACKiR,GAEW,iBAATjR,EACFc,GAAQd,GACXgR,GAAoBhR,EAAM,GAAIA,EAAM,IACpC+Q,GAAY/Q,GAEXkR,GAASlR,GAUlB,SAASyd,GAAS9Q,GAChB,IAAKwE,GAAYxE,GACf,OAAOyE,GAAWzE,GAEpB,IAAIjL,EAAS,GACb,IAAK,IAAIoG,KAAOxI,GAAOqN,GACjBjI,GAAelF,KAAKmN,EAAQ7E,IAAe,eAAPA,GACtCpG,EAAOoD,KAAKgD,GAGhB,OAAOpG,EAkCT,SAAS0sB,GAAOpuB,EAAOwO,GACrB,OAAOxO,EAAQwO,EAWjB,SAAS4E,GAAQ5B,EAAYjF,GAC3B,IAAIhD,GAAS,EACT7H,EAAS6P,GAAYC,GAAc3Q,EAAM2Q,EAAW1N,QAAU,GAKlE,OAHAoJ,GAASsE,GAAY,SAASxR,EAAO8H,EAAK0J,GACxC9P,IAAS6H,GAASgD,EAASvM,EAAO8H,EAAK0J,MAElC9P,EAUT,SAASqP,GAAYjB,GACnB,IAAIC,EAAY2B,GAAa5B,GAC7B,OAAwB,GAApBC,EAAUjM,QAAeiM,EAAU,GAAG,GACjC4B,GAAwB5B,EAAU,GAAG,GAAIA,EAAU,GAAG,IAExD,SAASpD,GACd,OAAOA,IAAWmD,GAAU2B,GAAY9E,EAAQmD,EAAQC,IAY5D,SAASiB,GAAoBnD,EAAMoC,GACjC,OAAI4B,GAAMhE,IAASiE,GAAmB7B,GAC7B0B,GAAwB/D,GAAMC,GAAOoC,GAEvC,SAAStD,GACd,IAAIC,EAAWvJ,GAAIsJ,EAAQkB,GAC3B,OAAQjB,IAAarM,GAAaqM,IAAaqD,EAC3C2B,GAAMjF,EAAQkB,GACdU,GAAY0B,EAAUrD,EAAUsD,IAexC,SAASiC,GAAUxF,EAAQmD,EAAQsC,EAAU1D,EAAY1H,GACnD2F,IAAWmD,GAGfrC,GAAQqC,GAAQ,SAASG,EAAUnI,GAEjC,GADAd,IAAUA,EAAQ,IAAIkE,IAClB2B,GAASoD,IA+BjB,SAAuBtD,EAAQmD,EAAQhI,EAAKsK,EAAUS,EAAWnE,EAAY1H,GAC3E,IAAI4F,EAAWsF,GAAQvF,EAAQ7E,GAC3BmI,EAAWiC,GAAQpC,EAAQhI,GAC3BgL,EAAU9L,EAAM3D,IAAI4M,GAExB,GAAI6C,EACFf,GAAiBpF,EAAQ7E,EAAKgL,OADhC,CAIA,IAAIT,EAAW3D,EACXA,EAAW9B,EAAUqD,EAAWnI,EAAM,GAAK6E,EAAQmD,EAAQ9I,GAC3DzG,EAEAwS,EAAWV,IAAa9R,EAE5B,GAAIwS,EAAU,CACZ,IAAI7G,EAAQpL,GAAQmP,GAChB7D,GAAUF,GAASJ,GAASmE,GAC5B+C,GAAW9G,IAAUE,GAAUJ,GAAaiE,GAEhDoC,EAAWpC,EACP/D,GAASE,GAAU4G,EACjBlS,GAAQ8L,GACVyF,EAAWzF,EAEJ8F,GAAkB9F,GACzByF,EAAWG,GAAU5F,GAEdR,GACP2G,GAAW,EACXV,EAAWC,GAAYrC,GAAU,IAE1B+C,GACPD,GAAW,EACXV,EAAWE,GAAgBtC,GAAU,IAGrCoC,EAAW,GAGNM,GAAc1C,IAAapE,GAAYoE,IAC9CoC,EAAWzF,EACPf,GAAYe,GACdyF,EAAWO,GAAchG,GAEjBC,GAASD,KAAauD,GAAWvD,KACzCyF,EAAWI,GAAgBxC,KAI7B8C,GAAW,EAGXA,IAEF/L,EAAMxE,IAAIyN,EAAUoC,GACpBQ,EAAUR,EAAUpC,EAAUmC,EAAU1D,EAAY1H,GACpDA,EAAc,OAAEiJ,IAElB8B,GAAiBpF,EAAQ7E,EAAKuK,IAzF1BL,CAAcrF,EAAQmD,EAAQhI,EAAKsK,EAAUD,GAAWzD,EAAY1H,OAEjE,CACH,IAAIqL,EAAW3D,EACXA,EAAWwD,GAAQvF,EAAQ7E,GAAMmI,EAAWnI,EAAM,GAAK6E,EAAQmD,EAAQ9I,GACvEzG,EAEA8R,IAAa9R,IACf8R,EAAWpC,GAEb8B,GAAiBpF,EAAQ7E,EAAKuK,MAE/BJ,IAwFL,SAASoc,GAAQ5iB,EAAOyI,GACtB,IAAIpQ,EAAS2H,EAAM3H,OACnB,GAAKA,EAIL,OAAOiI,GADPmI,GAAKA,EAAI,EAAIpQ,EAAS,EACJA,GAAU2H,EAAMyI,GAAK3T,EAYzC,SAAS+tB,GAAY9c,EAAYgC,EAAWC,GAExCD,EADEA,EAAU1P,OACAmP,GAASO,GAAW,SAASjH,GACvC,OAAIzL,GAAQyL,GACH,SAASvM,GACd,OAAOkT,GAAQlT,EAA2B,IAApBuM,EAASzI,OAAeyI,EAAS,GAAKA,IAGzDA,KAGG,CAAC0E,IAGf,IAAI1H,GAAS,EACbiK,EAAYP,GAASO,EAAWF,GAAUib,OAE1C,IAAI7sB,EAAS0R,GAAQ5B,GAAY,SAASxR,EAAO8H,EAAK0J,GACpD,IAAIqE,EAAW5C,GAASO,GAAW,SAASjH,GAC1C,OAAOA,EAASvM,MAElB,MAAO,CAAE,SAAY6V,EAAU,QAAWtM,EAAO,MAASvJ,MAG5D,OA5xFJ,SAAoByL,EAAOuI,GACzB,IAAIlQ,EAAS2H,EAAM3H,OAGnB,IADA2H,EAAMwI,MAyxFsB,SAAStH,EAAQ6B,GACzC,OA04BJ,SAAyB7B,EAAQ6B,EAAOiF,GAOtC,IANA,IAAIlK,GAAS,EACTqM,EAAcjJ,EAAOkJ,SACrBC,EAActH,EAAMqH,SACpB/R,EAAS8R,EAAY9R,OACrBiS,EAAetC,EAAO3P,SAEjByF,EAAQzF,GAAQ,CACvB,IAAIpC,EAASiU,GAAiBC,EAAYrM,GAAQuM,EAAYvM,IAC9D,GAAI7H,EACF,OAAI6H,GAASwM,EACJrU,EAGFA,GAAmB,QADd+R,EAAOlK,IACiB,EAAI,GAU5C,OAAOoD,EAAOpD,MAAQiF,EAAMjF,MAl6BnBgK,CAAgB5G,EAAQ6B,EAAOiF,MAzxFnC3P,KACL2H,EAAM3H,GAAU2H,EAAM3H,GAAQ9D,MAEhC,OAAOyL,EAqxFE4H,CAAW3R,GA6BpB,SAAS8sB,GAAW7hB,EAAQ0e,EAAO3f,GAKjC,IAJA,IAAInC,GAAS,EACTzF,EAASunB,EAAMvnB,OACfpC,EAAS,KAEJ6H,EAAQzF,GAAQ,CACvB,IAAI+J,EAAOwd,EAAM9hB,GACbvJ,EAAQkT,GAAQvG,EAAQkB,GAExBnC,EAAU1L,EAAO6N,IACnB4gB,GAAQ/sB,EAAQiM,GAASE,EAAMlB,GAAS3M,GAG5C,OAAO0B,EA2BT,SAASgtB,GAAYjjB,EAAO1G,EAAQwH,EAAU4Y,GAC5C,IAAI9lB,EAAU8lB,EAAaW,GAAkBb,GACzC1b,GAAS,EACTzF,EAASiB,EAAOjB,OAChBqT,EAAO1L,EAQX,IANIA,IAAU1G,IACZA,EAASyN,GAAUzN,IAEjBwH,IACF4K,EAAOlE,GAASxH,EAAO6H,GAAU/G,OAE1BhD,EAAQzF,GAKf,IAJA,IAAI6hB,EAAY,EACZ3lB,EAAQ+E,EAAOwE,GACfyjB,EAAWzgB,EAAWA,EAASvM,GAASA,GAEpC2lB,EAAYtmB,EAAQ8X,EAAM6V,EAAUrH,EAAWR,KAAgB,GACjEhO,IAAS1L,GACXuP,GAAOxb,KAAK2X,EAAMwO,EAAW,GAE/B3K,GAAOxb,KAAKiM,EAAOka,EAAW,GAGlC,OAAOla,EAYT,SAASkjB,GAAWljB,EAAOmjB,GAIzB,IAHA,IAAI9qB,EAAS2H,EAAQmjB,EAAQ9qB,OAAS,EAClCujB,EAAYvjB,EAAS,EAElBA,KAAU,CACf,IAAIyF,EAAQqlB,EAAQ9qB,GACpB,GAAIA,GAAUujB,GAAa9d,IAAUslB,EAAU,CAC7C,IAAIA,EAAWtlB,EACXwC,GAAQxC,GACVyR,GAAOxb,KAAKiM,EAAOlC,EAAO,GAE1BulB,GAAUrjB,EAAOlC,IAIvB,OAAOkC,EAYT,SAASmf,GAAWW,EAAOC,GACzB,OAAOD,EAAQ3C,GAAYS,MAAkBmC,EAAQD,EAAQ,IAkC/D,SAASwD,GAAWhb,EAAQG,GAC1B,IAAIxS,EAAS,GACb,IAAKqS,GAAUG,EAAI,GAAKA,EAAImK,EAC1B,OAAO3c,EAIT,GACMwS,EAAI,IACNxS,GAAUqS,IAEZG,EAAI0U,GAAY1U,EAAI,MAElBH,GAAUA,SAELG,GAET,OAAOxS,EAWT,SAAS0U,GAAS9K,EAAMsI,GACtB,OAAOD,GAAYD,GAASpI,EAAMsI,EAAO3C,IAAW3F,EAAO,IAU7D,SAAS0jB,GAAWxd,GAClB,OAAOmZ,GAAY5lB,GAAOyM,IAW5B,SAASyd,GAAezd,EAAY0C,GAClC,IAAIzI,EAAQ1G,GAAOyM,GACnB,OAAOsZ,GAAYrf,EAAOsf,GAAU7W,EAAG,EAAGzI,EAAM3H,SAalD,SAAS2qB,GAAQ9hB,EAAQkB,EAAM7N,EAAO0O,GACpC,IAAK7B,GAASF,GACZ,OAAOA,EAST,IALA,IAAIpD,GAAS,EACTzF,GAHJ+J,EAAOF,GAASE,EAAMlB,IAGJ7I,OACdujB,EAAYvjB,EAAS,EACrBorB,EAASviB,EAEI,MAAVuiB,KAAoB3lB,EAAQzF,GAAQ,CACzC,IAAIgE,EAAM8F,GAAMC,EAAKtE,IACjB8I,EAAWrS,EAEf,GAAY,cAAR8H,GAA+B,gBAARA,GAAiC,cAARA,EAClD,OAAO6E,EAGT,GAAIpD,GAAS8d,EAAW,CACtB,IAAIza,EAAWsiB,EAAOpnB,IACtBuK,EAAW3D,EAAaA,EAAW9B,EAAU9E,EAAKonB,GAAU3uB,KAC3CA,IACf8R,EAAWxF,GAASD,GAChBA,EACCb,GAAQ8B,EAAKtE,EAAQ,IAAM,GAAK,IAGzCyM,GAAYkZ,EAAQpnB,EAAKuK,GACzB6c,EAASA,EAAOpnB,GAElB,OAAO6E,EAWT,IAAIwiB,GAAe1F,GAAqB,SAASne,EAAMH,GAErD,OADAse,GAAQjnB,IAAI8I,EAAMH,GACXG,GAFoB2F,GAazB6C,GAAmBjL,GAA4B,SAASyC,EAAMyI,GAChE,OAAOlL,GAAeyC,EAAM,WAAY,CACtC,cAAgB,EAChB,YAAc,EACd,MAASuI,GAASE,GAClB,UAAY,KALwB9C,GAgBxC,SAASme,GAAY5d,GACnB,OAAOsZ,GAAY/lB,GAAOyM,IAY5B,SAAS6d,GAAU5jB,EAAOmI,EAAO0b,GAC/B,IAAI/lB,GAAS,EACTzF,EAAS2H,EAAM3H,OAEf8P,EAAQ,IACVA,GAASA,EAAQ9P,EAAS,EAAKA,EAAS8P,IAE1C0b,EAAMA,EAAMxrB,EAASA,EAASwrB,GACpB,IACRA,GAAOxrB,GAETA,EAAS8P,EAAQ0b,EAAM,EAAMA,EAAM1b,IAAW,EAC9CA,KAAW,EAGX,IADA,IAAIlS,EAASb,EAAMiD,KACVyF,EAAQzF,GACfpC,EAAO6H,GAASkC,EAAMlC,EAAQqK,GAEhC,OAAOlS,EAYT,SAAS6tB,GAAS/d,EAAY9F,GAC5B,IAAIhK,EAMJ,OAJAwL,GAASsE,GAAY,SAASxR,EAAOuJ,EAAOiI,GAE1C,QADA9P,EAASgK,EAAU1L,EAAOuJ,EAAOiI,SAG1B9P,EAeX,SAAS8tB,GAAgB/jB,EAAOzL,EAAOyvB,GACrC,IAAIC,EAAM,EACNC,EAAgB,MAATlkB,EAAgBikB,EAAMjkB,EAAM3H,OAEvC,GAAoB,iBAAT9D,GAAqBA,GAAUA,GAAS2vB,GAn/H3BpR,WAm/H0D,CAChF,KAAOmR,EAAMC,GAAM,CACjB,IAAIC,EAAOF,EAAMC,IAAU,EACvB3C,EAAWvhB,EAAMmkB,GAEJ,OAAb5C,IAAsB7Y,GAAS6Y,KAC9ByC,EAAczC,GAAYhtB,EAAUgtB,EAAWhtB,GAClD0vB,EAAME,EAAM,EAEZD,EAAOC,EAGX,OAAOD,EAET,OAAOE,GAAkBpkB,EAAOzL,EAAOiR,GAAUwe,GAgBnD,SAASI,GAAkBpkB,EAAOzL,EAAOuM,EAAUkjB,GACjD,IAAIC,EAAM,EACNC,EAAgB,MAATlkB,EAAgB,EAAIA,EAAM3H,OACrC,GAAa,IAAT6rB,EACF,OAAO,EAST,IALA,IAAIG,GADJ9vB,EAAQuM,EAASvM,KACQA,EACrBoV,EAAsB,OAAVpV,EACZsV,EAAcnB,GAASnU,GACvB+vB,EAAiB/vB,IAAUO,EAExBmvB,EAAMC,GAAM,CACjB,IAAIC,EAAMhH,IAAa8G,EAAMC,GAAQ,GACjC3C,EAAWzgB,EAASd,EAAMmkB,IAC1Bra,EAAeyX,IAAazsB,EAC5BiV,EAAyB,OAAbwX,EACZvX,EAAiBuX,GAAaA,EAC9BtX,EAAcvB,GAAS6Y,GAE3B,GAAI8C,EACF,IAAIE,EAASP,GAAcha,OAE3Bua,EADSD,EACAta,IAAmBga,GAAcla,GACjCH,EACAK,GAAkBF,IAAiBka,IAAeja,GAClDF,EACAG,GAAkBF,IAAiBC,IAAcia,IAAe/Z,IAChEF,IAAaE,IAGb+Z,EAAczC,GAAYhtB,EAAUgtB,EAAWhtB,GAEtDgwB,EACFN,EAAME,EAAM,EAEZD,EAAOC,EAGX,OAAO1G,GAAUyG,EA1jICpR,YAskIpB,SAAS0R,GAAexkB,EAAOc,GAM7B,IALA,IAAIhD,GAAS,EACTzF,EAAS2H,EAAM3H,OACf6H,EAAW,EACXjK,EAAS,KAEJ6H,EAAQzF,GAAQ,CACvB,IAAI9D,EAAQyL,EAAMlC,GACdyjB,EAAWzgB,EAAWA,EAASvM,GAASA,EAE5C,IAAKuJ,IAAUmD,GAAGsgB,EAAU7V,GAAO,CACjC,IAAIA,EAAO6V,EACXtrB,EAAOiK,KAAwB,IAAV3L,EAAc,EAAIA,GAG3C,OAAO0B,EAWT,SAASwuB,GAAalwB,GACpB,MAAoB,iBAATA,EACFA,EAELmU,GAASnU,GACJse,GAEDte,EAWV,SAASsU,GAAatU,GAEpB,GAAoB,iBAATA,EACT,OAAOA,EAET,GAAIc,GAAQd,GAEV,OAAOiT,GAASjT,EAAOsU,IAAgB,GAEzC,GAAIH,GAASnU,GACX,OAAOqU,GAAiBA,GAAe7U,KAAKQ,GAAS,GAEvD,IAAI0B,EAAU1B,EAAQ,GACtB,MAAkB,KAAV0B,GAAkB,EAAI1B,IAAU,IAAa,KAAO0B,EAY9D,SAASyuB,GAAS1kB,EAAOc,EAAU4Y,GACjC,IAAI5b,GAAS,EACTsjB,EAAW7H,GACXlhB,EAAS2H,EAAM3H,OACfiP,GAAW,EACXrR,EAAS,GACTyV,EAAOzV,EAEX,GAAIyjB,EACFpS,GAAW,EACX8Z,EAAW3H,QAER,GAAIphB,GAjtIU,IAitIkB,CACnC,IAAItB,EAAM+J,EAAW,KAAO6jB,GAAU3kB,GACtC,GAAIjJ,EACF,OAAOiV,GAAWjV,GAEpBuQ,GAAW,EACX8Z,EAAWhW,GACXM,EAAO,IAAIzM,QAGXyM,EAAO5K,EAAW,GAAK7K,EAEzBqrB,EACA,OAASxjB,EAAQzF,GAAQ,CACvB,IAAI9D,EAAQyL,EAAMlC,GACdyjB,EAAWzgB,EAAWA,EAASvM,GAASA,EAG5C,GADAA,EAASmlB,GAAwB,IAAVnlB,EAAeA,EAAQ,EAC1C+S,GAAYia,GAAaA,EAAU,CAErC,IADA,IAAIqD,EAAYlZ,EAAKrT,OACdusB,KACL,GAAIlZ,EAAKkZ,KAAerD,EACtB,SAASD,EAGTxgB,GACF4K,EAAKrS,KAAKkoB,GAEZtrB,EAAOoD,KAAK9E,QAEJ6sB,EAAS1V,EAAM6V,EAAU7H,KAC7BhO,IAASzV,GACXyV,EAAKrS,KAAKkoB,GAEZtrB,EAAOoD,KAAK9E,IAGhB,OAAO0B,EAWT,SAASotB,GAAUniB,EAAQkB,GAGzB,OAAiB,OADjBlB,EAASuhB,GAAOvhB,EADhBkB,EAAOF,GAASE,EAAMlB,aAEUA,EAAOiB,GAAMugB,GAAKtgB,KAapD,SAASyiB,GAAW3jB,EAAQkB,EAAM0iB,EAAS7hB,GACzC,OAAO+f,GAAQ9hB,EAAQkB,EAAM0iB,EAAQrd,GAAQvG,EAAQkB,IAAQa,GAc/D,SAAS8hB,GAAU/kB,EAAOC,EAAW+kB,EAAQ/Z,GAI3C,IAHA,IAAI5S,EAAS2H,EAAM3H,OACfyF,EAAQmN,EAAY5S,GAAU,GAE1B4S,EAAYnN,MAAYA,EAAQzF,IACtC4H,EAAUD,EAAMlC,GAAQA,EAAOkC,KAEjC,OAAOglB,EACHpB,GAAU5jB,EAAQiL,EAAY,EAAInN,EAASmN,EAAYnN,EAAQ,EAAIzF,GACnEurB,GAAU5jB,EAAQiL,EAAYnN,EAAQ,EAAI,EAAKmN,EAAY5S,EAASyF,GAa1E,SAASmnB,GAAiB1wB,EAAO2wB,GAC/B,IAAIjvB,EAAS1B,EAIb,OAHI0B,aAAkBkoB,KACpBloB,EAASA,EAAO1B,SAEXolB,GAAYuL,GAAS,SAASjvB,EAAQkvB,GAC3C,OAAOA,EAAOtlB,KAAKE,MAAMolB,EAAOhsB,QAASwI,GAAU,CAAC1L,GAASkvB,EAAOrlB,SACnE7J,GAaL,SAASmvB,GAAQhD,EAAQthB,EAAU4Y,GACjC,IAAIrhB,EAAS+pB,EAAO/pB,OACpB,GAAIA,EAAS,EACX,OAAOA,EAASqsB,GAAStC,EAAO,IAAM,GAKxC,IAHA,IAAItkB,GAAS,EACT7H,EAASb,EAAMiD,KAEVyF,EAAQzF,GAIf,IAHA,IAAI2H,EAAQoiB,EAAOtkB,GACfgO,GAAY,IAEPA,EAAWzT,GACdyT,GAAYhO,IACd7H,EAAO6H,GAASqjB,GAAelrB,EAAO6H,IAAUkC,EAAOoiB,EAAOtW,GAAWhL,EAAU4Y,IAIzF,OAAOgL,GAAS7iB,GAAY5L,EAAQ,GAAI6K,EAAU4Y,GAYpD,SAAS2L,GAAc7a,EAAOlR,EAAQgsB,GAMpC,IALA,IAAIxnB,GAAS,EACTzF,EAASmS,EAAMnS,OACfktB,EAAajsB,EAAOjB,OACpBpC,EAAS,KAEJ6H,EAAQzF,GAAQ,CACvB,IAAI9D,EAAQuJ,EAAQynB,EAAajsB,EAAOwE,GAAShJ,EACjDwwB,EAAWrvB,EAAQuU,EAAM1M,GAAQvJ,GAEnC,OAAO0B,EAUT,SAASuvB,GAAoBjxB,GAC3B,OAAO0S,GAAkB1S,GAASA,EAAQ,GAU5C,SAASkxB,GAAalxB,GACpB,MAAuB,mBAATA,EAAsBA,EAAQiR,GAW9C,SAAStD,GAAS3N,EAAO2M,GACvB,OAAI7L,GAAQd,GACHA,EAEF6R,GAAM7R,EAAO2M,GAAU,CAAC3M,GAASwU,GAAajV,GAASS,IAYhE,IAAImxB,GAAW/a,GAWf,SAASgb,GAAU3lB,EAAOmI,EAAO0b,GAC/B,IAAIxrB,EAAS2H,EAAM3H,OAEnB,OADAwrB,EAAMA,IAAQ/uB,EAAYuD,EAASwrB,GAC1B1b,GAAS0b,GAAOxrB,EAAU2H,EAAQ4jB,GAAU5jB,EAAOmI,EAAO0b,GASrE,IAAIhH,GAAeD,IAAmB,SAASgJ,GAC7C,OAAOvzB,GAAKwqB,aAAa+I,IAW3B,SAAS/e,GAAY7P,EAAQqS,GAC3B,GAAIA,EACF,OAAOrS,EAAOL,QAEhB,IAAI0B,EAASrB,EAAOqB,OAChBpC,EAASmT,GAAcA,GAAY/Q,GAAU,IAAIrB,EAAOyE,YAAYpD,GAGxE,OADArB,EAAOsS,KAAKrT,GACLA,EAUT,SAASsT,GAAiBvR,GACxB,IAAI/B,EAAS,IAAI+B,EAAYyD,YAAYzD,EAAYlB,YAErD,OADA,IAAID,GAAWZ,GAAQc,IAAI,IAAIF,GAAWmB,IACnC/B,EAgDT,SAAS6Q,GAAgB0C,EAAYH,GACnC,IAAIrS,EAASqS,EAASE,GAAiBC,EAAWxS,QAAUwS,EAAWxS,OACvE,OAAO,IAAIwS,EAAW/N,YAAYzE,EAAQwS,EAAWC,WAAYD,EAAWnR,QAW9E,SAAS6R,GAAiB3V,EAAOwO,GAC/B,GAAIxO,IAAUwO,EAAO,CACnB,IAAI2G,EAAenV,IAAUO,EACzB6U,EAAsB,OAAVpV,EACZqV,EAAiBrV,GAAUA,EAC3BsV,EAAcnB,GAASnU,GAEvBuV,EAAe/G,IAAUjO,EACzBiV,EAAsB,OAAVhH,EACZiH,EAAiBjH,GAAUA,EAC3BkH,EAAcvB,GAAS3F,GAE3B,IAAMgH,IAAcE,IAAgBJ,GAAetV,EAAQwO,GACtD8G,GAAeC,GAAgBE,IAAmBD,IAAcE,GAChEN,GAAaG,GAAgBE,IAC5BN,GAAgBM,IACjBJ,EACH,OAAO,EAET,IAAMD,IAAcE,IAAgBI,GAAe1V,EAAQwO,GACtDkH,GAAeP,GAAgBE,IAAmBD,IAAcE,GAChEE,GAAaL,GAAgBE,IAC5BE,GAAgBF,IACjBI,EACH,OAAQ,EAGZ,OAAO,EAuDT,SAAS6b,GAAY/lB,EAAMgmB,EAAUC,EAASC,GAU5C,IATA,IAAIC,GAAa,EACbC,EAAapmB,EAAKzH,OAClB8tB,EAAgBJ,EAAQ1tB,OACxB+tB,GAAa,EACbC,EAAaP,EAASztB,OACtBiuB,EAAcnW,GAAU+V,EAAaC,EAAe,GACpDlwB,EAASb,EAAMixB,EAAaC,GAC5BC,GAAeP,IAEVI,EAAYC,GACnBpwB,EAAOmwB,GAAaN,EAASM,GAE/B,OAASH,EAAYE,IACfI,GAAeN,EAAYC,KAC7BjwB,EAAO8vB,EAAQE,IAAcnmB,EAAKmmB,IAGtC,KAAOK,KACLrwB,EAAOmwB,KAAetmB,EAAKmmB,KAE7B,OAAOhwB,EAcT,SAASuwB,GAAiB1mB,EAAMgmB,EAAUC,EAASC,GAWjD,IAVA,IAAIC,GAAa,EACbC,EAAapmB,EAAKzH,OAClBouB,GAAgB,EAChBN,EAAgBJ,EAAQ1tB,OACxBquB,GAAc,EACdC,EAAcb,EAASztB,OACvBiuB,EAAcnW,GAAU+V,EAAaC,EAAe,GACpDlwB,EAASb,EAAMkxB,EAAcK,GAC7BJ,GAAeP,IAEVC,EAAYK,GACnBrwB,EAAOgwB,GAAanmB,EAAKmmB,GAG3B,IADA,IAAIllB,EAASklB,IACJS,EAAaC,GACpB1wB,EAAO8K,EAAS2lB,GAAcZ,EAASY,GAEzC,OAASD,EAAeN,IAClBI,GAAeN,EAAYC,KAC7BjwB,EAAO8K,EAASglB,EAAQU,IAAiB3mB,EAAKmmB,MAGlD,OAAOhwB,EAWT,SAAS8Q,GAAU1C,EAAQrE,GACzB,IAAIlC,GAAS,EACTzF,EAASgM,EAAOhM,OAGpB,IADA2H,IAAUA,EAAQ5K,EAAMiD,MACfyF,EAAQzF,GACf2H,EAAMlC,GAASuG,EAAOvG,GAExB,OAAOkC,EAaT,SAAS0f,GAAWrb,EAAQmG,EAAOtJ,EAAQ+B,GACzC,IAAIwH,GAASvJ,EACbA,IAAWA,EAAS,IAKpB,IAHA,IAAIpD,GAAS,EACTzF,EAASmS,EAAMnS,SAEVyF,EAAQzF,GAAQ,CACvB,IAAIgE,EAAMmO,EAAM1M,GAEZ8I,EAAW3D,EACXA,EAAW/B,EAAO7E,GAAMgI,EAAOhI,GAAMA,EAAK6E,EAAQmD,GAClDvP,EAEA8R,IAAa9R,IACf8R,EAAWvC,EAAOhI,IAEhBoO,EACFzJ,GAAgBE,EAAQ7E,EAAKuK,GAE7B2D,GAAYrJ,EAAQ7E,EAAKuK,GAG7B,OAAO1F,EAmCT,SAAS0lB,GAAiB1N,EAAQ2N,GAChC,OAAO,SAAS9gB,EAAYjF,GAC1B,IAAIjB,EAAOxK,GAAQ0Q,GAAckT,GAAkBuG,GAC/CrG,EAAc0N,EAAcA,IAAgB,GAEhD,OAAOhnB,EAAKkG,EAAYmT,EAAQ4J,GAAYhiB,EAAU,GAAIqY,IAW9D,SAAS2N,GAAejc,GACtB,OAAOF,IAAS,SAASzJ,EAAQ4J,GAC/B,IAAIhN,GAAS,EACTzF,EAASyS,EAAQzS,OACjB4K,EAAa5K,EAAS,EAAIyS,EAAQzS,EAAS,GAAKvD,EAChDiW,EAAQ1S,EAAS,EAAIyS,EAAQ,GAAKhW,EAWtC,IATAmO,EAAc4H,EAASxS,OAAS,GAA0B,mBAAd4K,GACvC5K,IAAU4K,GACXnO,EAEAiW,GAASH,GAAeE,EAAQ,GAAIA,EAAQ,GAAIC,KAClD9H,EAAa5K,EAAS,EAAIvD,EAAYmO,EACtC5K,EAAS,GAEX6I,EAASrN,GAAOqN,KACPpD,EAAQzF,GAAQ,CACvB,IAAIgM,EAASyG,EAAQhN,GACjBuG,GACFwG,EAAS3J,EAAQmD,EAAQvG,EAAOmF,GAGpC,OAAO/B,KAYX,SAASQ,GAAesJ,EAAUC,GAChC,OAAO,SAASlF,EAAYjF,GAC1B,GAAkB,MAAdiF,EACF,OAAOA,EAET,IAAKD,GAAYC,GACf,OAAOiF,EAASjF,EAAYjF,GAM9B,IAJA,IAAIzI,EAAS0N,EAAW1N,OACpByF,EAAQmN,EAAY5S,GAAU,EAC9B6S,EAAWrX,GAAOkS,IAEdkF,EAAYnN,MAAYA,EAAQzF,KACa,IAA/CyI,EAASoK,EAASpN,GAAQA,EAAOoN,KAIvC,OAAOnF,GAWX,SAAS9D,GAAcgJ,GACrB,OAAO,SAAS/J,EAAQJ,EAAUuB,GAMhC,IALA,IAAIvE,GAAS,EACToN,EAAWrX,GAAOqN,GAClBsJ,EAAQnI,EAASnB,GACjB7I,EAASmS,EAAMnS,OAEZA,KAAU,CACf,IAAIgE,EAAMmO,EAAMS,EAAY5S,IAAWyF,GACvC,IAA+C,IAA3CgD,EAASoK,EAAS7O,GAAMA,EAAK6O,GAC/B,MAGJ,OAAOhK,GAgCX,SAAS6lB,GAAgBC,GACvB,OAAO,SAAS1e,GAGd,IAAIyS,EAAaS,GAFjBlT,EAASxU,GAASwU,IAGdwT,GAAcxT,GACdxT,EAEAymB,EAAMR,EACNA,EAAW,GACXzS,EAAO2T,OAAO,GAEdgL,EAAWlM,EACX4K,GAAU5K,EAAY,GAAGviB,KAAK,IAC9B8P,EAAO3R,MAAM,GAEjB,OAAO4kB,EAAIyL,KAAgBC,GAW/B,SAASC,GAAiBhuB,GACxB,OAAO,SAASoP,GACd,OAAOqR,GAAYwN,GAAMC,GAAO9e,GAAQ9N,QAAQgd,GAAQ,KAAMte,EAAU,KAY5E,SAASmuB,GAAW5Y,GAClB,OAAO,WAIL,IAAI3O,EAAOwQ,UACX,OAAQxQ,EAAKzH,QACX,KAAK,EAAG,OAAO,IAAIoW,EACnB,KAAK,EAAG,OAAO,IAAIA,EAAK3O,EAAK,IAC7B,KAAK,EAAG,OAAO,IAAI2O,EAAK3O,EAAK,GAAIA,EAAK,IACtC,KAAK,EAAG,OAAO,IAAI2O,EAAK3O,EAAK,GAAIA,EAAK,GAAIA,EAAK,IAC/C,KAAK,EAAG,OAAO,IAAI2O,EAAK3O,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,IACxD,KAAK,EAAG,OAAO,IAAI2O,EAAK3O,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,IACjE,KAAK,EAAG,OAAO,IAAI2O,EAAK3O,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,IAC1E,KAAK,EAAG,OAAO,IAAI2O,EAAK3O,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,IAErF,IAAIwnB,EAAchmB,GAAWmN,EAAKvb,WAC9B+C,EAASwY,EAAK1O,MAAMunB,EAAaxnB,GAIrC,OAAOsB,GAASnL,GAAUA,EAASqxB,GAgDvC,SAASC,GAAWC,GAClB,OAAO,SAASzhB,EAAY9F,EAAWia,GACrC,IAAIhP,EAAWrX,GAAOkS,GACtB,IAAKD,GAAYC,GAAa,CAC5B,IAAIjF,EAAWgiB,GAAY7iB,EAAW,GACtC8F,EAAa3M,GAAK2M,GAClB9F,EAAY,SAAS5D,GAAO,OAAOyE,EAASoK,EAAS7O,GAAMA,EAAK6O,IAElE,IAAIpN,EAAQ0pB,EAAczhB,EAAY9F,EAAWia,GACjD,OAAOpc,GAAS,EAAIoN,EAASpK,EAAWiF,EAAWjI,GAASA,GAAShJ,GAWzE,SAAS2yB,GAAWxc,GAClB,OAAOyc,IAAS,SAASC,GACvB,IAAItvB,EAASsvB,EAAMtvB,OACfyF,EAAQzF,EACRuvB,EAASxJ,GAAclrB,UAAU20B,KAKrC,IAHI5c,GACF0c,EAAM5J,UAEDjgB,KAAS,CACd,IAAI+B,EAAO8nB,EAAM7pB,GACjB,GAAmB,mBAAR+B,EACT,MAAM,IAAIzL,GAAUke,GAEtB,GAAIsV,IAAWE,GAAgC,WAArBC,GAAYloB,GACpC,IAAIioB,EAAU,IAAI1J,GAAc,IAAI,GAIxC,IADAtgB,EAAQgqB,EAAUhqB,EAAQzF,IACjByF,EAAQzF,GAAQ,CAGvB,IAAI2vB,EAAWD,GAFfloB,EAAO8nB,EAAM7pB,IAGT4B,EAAmB,WAAZsoB,EAAwBC,GAAQpoB,GAAQ/K,EAMjDgzB,EAJEpoB,GAAQwoB,GAAWxoB,EAAK,KACX,KAAXA,EAAK,KACJA,EAAK,GAAGrH,QAAqB,GAAXqH,EAAK,GAElBooB,EAAQC,GAAYroB,EAAK,KAAKK,MAAM+nB,EAASpoB,EAAK,IAElC,GAAfG,EAAKxH,QAAe6vB,GAAWroB,GACtCioB,EAAQE,KACRF,EAAQD,KAAKhoB,GAGrB,OAAO,WACL,IAAIC,EAAOwQ,UACP/b,EAAQuL,EAAK,GAEjB,GAAIgoB,GAA0B,GAAfhoB,EAAKzH,QAAehD,GAAQd,GACzC,OAAOuzB,EAAQK,MAAM5zB,GAAOA,QAK9B,IAHA,IAAIuJ,EAAQ,EACR7H,EAASoC,EAASsvB,EAAM7pB,GAAOiC,MAAMlN,KAAMiN,GAAQvL,IAE9CuJ,EAAQzF,GACfpC,EAAS0xB,EAAM7pB,GAAO/J,KAAKlB,KAAMoD,GAEnC,OAAOA,MAwBb,SAASmyB,GAAavoB,EAAMmD,EAAS7J,EAAS2sB,EAAUC,EAASsC,EAAeC,EAAcC,EAAQC,EAAKC,GACzG,IAAIC,EAAQ1lB,EAAU0P,EAClBiW,EA5iKa,EA4iKJ3lB,EACT4lB,EA5iKiB,EA4iKL5lB,EACZgjB,EAAsB,GAAVhjB,EACZ6lB,EAtiKa,IAsiKJ7lB,EACTyL,EAAOma,EAAY9zB,EAAYuyB,GAAWxnB,GA6C9C,OA3CA,SAASioB,IAKP,IAJA,IAAIzvB,EAASiY,UAAUjY,OACnByH,EAAO1K,EAAMiD,GACbyF,EAAQzF,EAELyF,KACLgC,EAAKhC,GAASwS,UAAUxS,GAE1B,GAAIkoB,EACF,IAAI7K,EAAc2N,GAAUhB,GACxBiB,EAAe7N,GAAapb,EAAMqb,GASxC,GAPI2K,IACFhmB,EAAO+lB,GAAY/lB,EAAMgmB,EAAUC,EAASC,IAE1CqC,IACFvoB,EAAO0mB,GAAiB1mB,EAAMuoB,EAAeC,EAActC,IAE7D3tB,GAAU0wB,EACN/C,GAAa3tB,EAASowB,EAAO,CAC/B,IAAIO,EAAavN,GAAe3b,EAAMqb,GACtC,OAAO8N,GACLppB,EAAMmD,EAASolB,GAAcN,EAAQ3M,YAAahiB,EAClD2G,EAAMkpB,EAAYT,EAAQC,EAAKC,EAAQpwB,GAG3C,IAAIivB,EAAcqB,EAASxvB,EAAUtG,KACjCq2B,EAAKN,EAAYtB,EAAYznB,GAAQA,EAczC,OAZAxH,EAASyH,EAAKzH,OACVkwB,EACFzoB,EAAOqpB,GAAQrpB,EAAMyoB,GACZM,GAAUxwB,EAAS,GAC5ByH,EAAKie,UAEH2K,GAASF,EAAMnwB,IACjByH,EAAKzH,OAASmwB,GAEZ31B,MAAQA,OAASR,IAAQQ,gBAAgBi1B,IAC3CoB,EAAKza,GAAQ4Y,GAAW6B,IAEnBA,EAAGnpB,MAAMunB,EAAaxnB,IAajC,SAASspB,GAAelQ,EAAQmQ,GAC9B,OAAO,SAASnoB,EAAQJ,GACtB,OAh/DJ,SAAsBI,EAAQgY,EAAQpY,EAAUqY,GAI9C,OAHA3X,GAAWN,GAAQ,SAAS3M,EAAO8H,EAAK6E,GACtCgY,EAAOC,EAAarY,EAASvM,GAAQ8H,EAAK6E,MAErCiY,EA4+DEmQ,CAAapoB,EAAQgY,EAAQmQ,EAAWvoB,GAAW,KAY9D,SAASyoB,GAAoBC,EAAU7X,GACrC,OAAO,SAASpd,EAAOwO,GACrB,IAAI9M,EACJ,GAAI1B,IAAUO,GAAaiO,IAAUjO,EACnC,OAAO6c,EAKT,GAHIpd,IAAUO,IACZmB,EAAS1B,GAEPwO,IAAUjO,EAAW,CACvB,GAAImB,IAAWnB,EACb,OAAOiO,EAEW,iBAATxO,GAAqC,iBAATwO,GACrCxO,EAAQsU,GAAatU,GACrBwO,EAAQ8F,GAAa9F,KAErBxO,EAAQkwB,GAAalwB,GACrBwO,EAAQ0hB,GAAa1hB,IAEvB9M,EAASuzB,EAASj1B,EAAOwO,GAE3B,OAAO9M,GAWX,SAASwzB,GAAWC,GAClB,OAAOhC,IAAS,SAAS3f,GAEvB,OADAA,EAAYP,GAASO,EAAWF,GAAUib,OACnCnY,IAAS,SAAS7K,GACvB,IAAI3G,EAAUtG,KACd,OAAO62B,EAAU3hB,GAAW,SAASjH,GACnC,OAAOf,GAAMe,EAAU3H,EAAS2G,YAexC,SAAS6pB,GAActxB,EAAQD,GAG7B,IAAIwxB,GAFJxxB,EAAQA,IAAUtD,EAAY,IAAM+T,GAAazQ,IAEzBC,OACxB,GAAIuxB,EAAc,EAChB,OAAOA,EAActG,GAAWlrB,EAAOC,GAAUD,EAEnD,IAAInC,EAASqtB,GAAWlrB,EAAO6kB,GAAW5kB,EAASsjB,GAAWvjB,KAC9D,OAAOojB,GAAWpjB,GACdutB,GAAU7J,GAAc7lB,GAAS,EAAGoC,GAAQG,KAAK,IACjDvC,EAAOU,MAAM,EAAG0B,GA6CtB,SAASwxB,GAAY5e,GACnB,OAAO,SAAS9C,EAAO0b,EAAKiG,GAa1B,OAZIA,GAAuB,iBAARA,GAAoBlf,GAAezC,EAAO0b,EAAKiG,KAChEjG,EAAMiG,EAAOh1B,GAGfqT,EAAQ4hB,GAAS5hB,GACb0b,IAAQ/uB,GACV+uB,EAAM1b,EACNA,EAAQ,GAER0b,EAAMkG,GAASlG,GA57CrB,SAAmB1b,EAAO0b,EAAKiG,EAAM7e,GAKnC,IAJA,IAAInN,GAAS,EACTzF,EAAS8X,GAAU8M,IAAY4G,EAAM1b,IAAU2hB,GAAQ,IAAK,GAC5D7zB,EAASb,EAAMiD,GAEZA,KACLpC,EAAOgV,EAAY5S,IAAWyF,GAASqK,EACvCA,GAAS2hB,EAEX,OAAO7zB,EAs7CE+zB,CAAU7hB,EAAO0b,EADxBiG,EAAOA,IAASh1B,EAAaqT,EAAQ0b,EAAM,GAAK,EAAKkG,GAASD,GAC3B7e,IAWvC,SAASgf,GAA0BT,GACjC,OAAO,SAASj1B,EAAOwO,GAKrB,MAJsB,iBAATxO,GAAqC,iBAATwO,IACvCxO,EAAQ21B,GAAS31B,GACjBwO,EAAQmnB,GAASnnB,IAEZymB,EAASj1B,EAAOwO,IAqB3B,SAASkmB,GAAcppB,EAAMmD,EAASmnB,EAAUhP,EAAahiB,EAAS2sB,EAAUC,EAASwC,EAAQC,EAAKC,GACpG,IAAI2B,EArxKc,EAqxKJpnB,EAMdA,GAAYonB,EAAU3X,EAxxKI,GAJF,GA6xKxBzP,KAAaonB,EAzxKa,GAyxKuB3X,MAG/CzP,IAAW,GAEb,IAAIqnB,EAAU,CACZxqB,EAAMmD,EAAS7J,EAVCixB,EAAUtE,EAAWhxB,EAFtBs1B,EAAUrE,EAAUjxB,EAGds1B,EAAUt1B,EAAYgxB,EAFvBsE,EAAUt1B,EAAYixB,EAYzBwC,EAAQC,EAAKC,GAG5BxyB,EAASk0B,EAASpqB,MAAMjL,EAAWu1B,GAKvC,OAJInC,GAAWroB,IACbyqB,GAAQr0B,EAAQo0B,GAElBp0B,EAAOklB,YAAcA,EACdoP,GAAgBt0B,EAAQ4J,EAAMmD,GAUvC,SAASwnB,GAAYxD,GACnB,IAAInnB,EAAOuQ,GAAK4W,GAChB,OAAO,SAASxV,EAAQiZ,GAGtB,GAFAjZ,EAAS0Y,GAAS1Y,IAClBiZ,EAAyB,MAAbA,EAAoB,EAAIhN,GAAUiN,GAAUD,GAAY,OACnDnN,GAAe9L,GAAS,CAGvC,IAAImZ,GAAQ72B,GAAS0d,GAAU,KAAKlX,MAAM,KAI1C,SADAqwB,GAAQ72B,GAFI+L,EAAK8qB,EAAK,GAAK,MAAQA,EAAK,GAAKF,KAEnB,KAAKnwB,MAAM,MACvB,GAAK,MAAQqwB,EAAK,GAAKF,IAEvC,OAAO5qB,EAAK2R,IAWhB,IAAImT,GAAc7lB,IAAQ,EAAIkN,GAAW,IAAIlN,GAAI,CAAC,EAAE,KAAK,IAAO6T,EAAmB,SAASrZ,GAC1F,OAAO,IAAIwF,GAAIxF,IAD2DsxB,GAW5E,SAASC,GAAcxoB,GACrB,OAAO,SAASnB,GACd,IAAIiL,EAAM9I,GAAOnC,GACjB,OAAIiL,GAAO4B,EACFhC,GAAW7K,GAEhBiL,GAAO8B,EACFyN,GAAWxa,GAn6I1B,SAAqBA,EAAQsJ,GAC3B,OAAOhD,GAASgD,GAAO,SAASnO,GAC9B,MAAO,CAACA,EAAK6E,EAAO7E,OAm6IXyuB,CAAY5pB,EAAQmB,EAASnB,KA6BxC,SAAS6pB,GAAWlrB,EAAMmD,EAAS7J,EAAS2sB,EAAUC,EAASwC,EAAQC,EAAKC,GAC1E,IAAIG,EAl4KiB,EAk4KL5lB,EAChB,IAAK4lB,GAA4B,mBAAR/oB,EACvB,MAAM,IAAIzL,GAAUke,GAEtB,IAAIja,EAASytB,EAAWA,EAASztB,OAAS,EAS1C,GARKA,IACH2K,IAAW,GACX8iB,EAAWC,EAAUjxB,GAEvB0zB,EAAMA,IAAQ1zB,EAAY0zB,EAAMrY,GAAUua,GAAUlC,GAAM,GAC1DC,EAAQA,IAAU3zB,EAAY2zB,EAAQiC,GAAUjC,GAChDpwB,GAAU0tB,EAAUA,EAAQ1tB,OAAS,EAx4KX,GA04KtB2K,EAAmC,CACrC,IAAIqlB,EAAgBvC,EAChBwC,EAAevC,EAEnBD,EAAWC,EAAUjxB,EAEvB,IAAI4K,EAAOkpB,EAAY9zB,EAAYmzB,GAAQpoB,GAEvCwqB,EAAU,CACZxqB,EAAMmD,EAAS7J,EAAS2sB,EAAUC,EAASsC,EAAeC,EAC1DC,EAAQC,EAAKC,GAkBf,GAfI/oB,GA26BN,SAAmBA,EAAM2E,GACvB,IAAIrB,EAAUtD,EAAK,GACfsrB,EAAa3mB,EAAO,GACpB4mB,EAAajoB,EAAUgoB,EACvB1jB,EAAW2jB,EAAa,IAExBC,EACAF,GAActY,GA50MA,GA40MmB1P,GACjCgoB,GAActY,GAx0MA,KAw0MmB1P,GAAgCtD,EAAK,GAAGrH,QAAUgM,EAAO,IAC5E,KAAd2mB,GAAqD3mB,EAAO,GAAGhM,QAAUgM,EAAO,IA90MlE,GA80M0ErB,EAG5F,IAAMsE,IAAY4jB,EAChB,OAAOxrB,EAr1MQ,EAw1MbsrB,IACFtrB,EAAK,GAAK2E,EAAO,GAEjB4mB,GA31Me,EA21MDjoB,EAA2B,EAz1MnB,GA41MxB,IAAIzO,EAAQ8P,EAAO,GACnB,GAAI9P,EAAO,CACT,IAAIuxB,EAAWpmB,EAAK,GACpBA,EAAK,GAAKomB,EAAWD,GAAYC,EAAUvxB,EAAO8P,EAAO,IAAM9P,EAC/DmL,EAAK,GAAKomB,EAAWrK,GAAe/b,EAAK,GAAI8S,GAAenO,EAAO,IAGrE9P,EAAQ8P,EAAO,MAEbyhB,EAAWpmB,EAAK,GAChBA,EAAK,GAAKomB,EAAWU,GAAiBV,EAAUvxB,EAAO8P,EAAO,IAAM9P,EACpEmL,EAAK,GAAKomB,EAAWrK,GAAe/b,EAAK,GAAI8S,GAAenO,EAAO,KAGrE9P,EAAQ8P,EAAO,MAEb3E,EAAK,GAAKnL,GAGRy2B,EAAatY,IACfhT,EAAK,GAAgB,MAAXA,EAAK,GAAa2E,EAAO,GAAKoZ,GAAU/d,EAAK,GAAI2E,EAAO,KAGrD,MAAX3E,EAAK,KACPA,EAAK,GAAK2E,EAAO,IAGnB3E,EAAK,GAAK2E,EAAO,GACjB3E,EAAK,GAAKurB,EA59BRE,CAAUd,EAAS3qB,GAErBG,EAAOwqB,EAAQ,GACfrnB,EAAUqnB,EAAQ,GAClBlxB,EAAUkxB,EAAQ,GAClBvE,EAAWuE,EAAQ,GACnBtE,EAAUsE,EAAQ,KAClB5B,EAAQ4B,EAAQ,GAAKA,EAAQ,KAAOv1B,EAC/B8zB,EAAY,EAAI/oB,EAAKxH,OACtB8X,GAAUka,EAAQ,GAAKhyB,EAAQ,KAEX,GAAV2K,IACZA,IAAW,IAERA,GA56KY,GA46KDA,EAGd/M,EA56KgB,GA26KP+M,GA16Ka,IA06KiBA,EApgB3C,SAAqBnD,EAAMmD,EAASylB,GAClC,IAAIha,EAAO4Y,GAAWxnB,GAwBtB,OAtBA,SAASioB,IAMP,IALA,IAAIzvB,EAASiY,UAAUjY,OACnByH,EAAO1K,EAAMiD,GACbyF,EAAQzF,EACR8iB,EAAc2N,GAAUhB,GAErBhqB,KACLgC,EAAKhC,GAASwS,UAAUxS,GAE1B,IAAIioB,EAAW1tB,EAAS,GAAKyH,EAAK,KAAOqb,GAAerb,EAAKzH,EAAS,KAAO8iB,EACzE,GACAM,GAAe3b,EAAMqb,GAGzB,OADA9iB,GAAU0tB,EAAQ1tB,QACLowB,EACJQ,GACLppB,EAAMmD,EAASolB,GAAcN,EAAQ3M,YAAarmB,EAClDgL,EAAMimB,EAASjxB,EAAWA,EAAW2zB,EAAQpwB,GAG1C0H,GADGlN,MAAQA,OAASR,IAAQQ,gBAAgBi1B,EAAWrZ,EAAO5O,EACpDhN,KAAMiN,IA8edsrB,CAAYvrB,EAAMmD,EAASylB,GAC1BzlB,GAAWyP,GAAgC,IAAXzP,GAAqD+iB,EAAQ1tB,OAG9F+vB,GAAaroB,MAAMjL,EAAWu1B,GA9O3C,SAAuBxqB,EAAMmD,EAAS7J,EAAS2sB,GAC7C,IAAI6C,EAtsKa,EAssKJ3lB,EACTyL,EAAO4Y,GAAWxnB,GAkBtB,OAhBA,SAASioB,IAQP,IAPA,IAAI7B,GAAa,EACbC,EAAa5V,UAAUjY,OACvB+tB,GAAa,EACbC,EAAaP,EAASztB,OACtByH,EAAO1K,EAAMixB,EAAaH,GAC1BgD,EAAMr2B,MAAQA,OAASR,IAAQQ,gBAAgBi1B,EAAWrZ,EAAO5O,IAE5DumB,EAAYC,GACnBvmB,EAAKsmB,GAAaN,EAASM,GAE7B,KAAOF,KACLpmB,EAAKsmB,KAAe9V,YAAY2V,GAElC,OAAOlmB,GAAMmpB,EAAIP,EAASxvB,EAAUtG,KAAMiN,IA0NjCurB,CAAcxrB,EAAMmD,EAAS7J,EAAS2sB,QAJ/C,IAAI7vB,EAhmBR,SAAoB4J,EAAMmD,EAAS7J,GACjC,IAAIwvB,EA90Ja,EA80JJ3lB,EACTyL,EAAO4Y,GAAWxnB,GAMtB,OAJA,SAASioB,IAEP,OADUj1B,MAAQA,OAASR,IAAQQ,gBAAgBi1B,EAAWrZ,EAAO5O,GAC3DE,MAAM4oB,EAASxvB,EAAUtG,KAAMyd,YA0lB5Bgb,CAAWzrB,EAAMmD,EAAS7J,GASzC,OAAOoxB,IADM7qB,EAAOgkB,GAAc4G,IACJr0B,EAAQo0B,GAAUxqB,EAAMmD,GAexD,SAASuoB,GAAuBpqB,EAAUqD,EAAUnI,EAAK6E,GACvD,OAAIC,IAAarM,GACZmM,GAAGE,EAAU6D,GAAY3I,MAAUpD,GAAelF,KAAKmN,EAAQ7E,GAC3DmI,EAEFrD,EAiBT,SAASqqB,GAAoBrqB,EAAUqD,EAAUnI,EAAK6E,EAAQmD,EAAQ9I,GAOpE,OANI6F,GAASD,IAAaC,GAASoD,KAEjCjJ,EAAMxE,IAAIyN,EAAUrD,GACpBuF,GAAUvF,EAAUqD,EAAU1P,EAAW02B,GAAqBjwB,GAC9DA,EAAc,OAAEiJ,IAEXrD,EAYT,SAASsqB,GAAgBl3B,GACvB,OAAO2S,GAAc3S,GAASO,EAAYP,EAgB5C,SAAS2O,GAAYlD,EAAO+C,EAAOC,EAASC,EAAYQ,EAAWlI,GACjE,IAAI8P,EApgLmB,EAogLPrI,EACZsI,EAAYtL,EAAM3H,OAClBkT,EAAYxI,EAAM1K,OAEtB,GAAIiT,GAAaC,KAAeF,GAAaE,EAAYD,GACvD,OAAO,EAGT,IAAIE,EAAajQ,EAAM3D,IAAIoI,GACvByL,EAAalQ,EAAM3D,IAAImL,GAC3B,GAAIyI,GAAcC,EAChB,OAAOD,GAAczI,GAAS0I,GAAczL,EAE9C,IAAIlC,GAAS,EACT7H,GAAS,EACTyV,EAlhLqB,EAkhLb1I,EAAoC,IAAI/D,GAAWnK,EAM/D,IAJAyG,EAAMxE,IAAIiJ,EAAO+C,GACjBxH,EAAMxE,IAAIgM,EAAO/C,KAGRlC,EAAQwN,GAAW,CAC1B,IAAIK,EAAW3L,EAAMlC,GACjB8N,EAAW7I,EAAMjF,GAErB,GAAImF,EACF,IAAI4I,EAAWR,EACXpI,EAAW2I,EAAUD,EAAU7N,EAAOiF,EAAO/C,EAAOzE,GACpD0H,EAAW0I,EAAUC,EAAU9N,EAAOkC,EAAO+C,EAAOxH,GAE1D,GAAIsQ,IAAa/W,EAAW,CAC1B,GAAI+W,EACF,SAEF5V,GAAS,EACT,MAGF,GAAIyV,GACF,IAAKP,GAAUpI,GAAO,SAAS6I,EAAUE,GACnC,IAAKV,GAASM,EAAMI,KACfH,IAAaC,GAAYnI,EAAUkI,EAAUC,EAAU5I,EAASC,EAAY1H,IAC/E,OAAOmQ,EAAKrS,KAAKyS,MAEjB,CACN7V,GAAS,EACT,YAEG,GACD0V,IAAaC,IACXnI,EAAUkI,EAAUC,EAAU5I,EAASC,EAAY1H,GACpD,CACLtF,GAAS,EACT,OAKJ,OAFAsF,EAAc,OAAEyE,GAChBzE,EAAc,OAAEwH,GACT9M,EA0KT,SAASyxB,GAAS7nB,GAChB,OAAOqI,GAAYD,GAASpI,EAAM/K,EAAW42B,IAAU7rB,EAAO,IAUhE,SAASwM,GAAWnL,GAClB,OAAO4L,GAAe5L,EAAQ9H,GAAM2T,IAWtC,SAASgU,GAAa7f,GACpB,OAAO4L,GAAe5L,EAAQsF,GAAQ6Z,IAUxC,IAAI4H,GAAWjK,GAAiB,SAASne,GACvC,OAAOme,GAAQpmB,IAAIiI,IADI+qB,GAWzB,SAAS7C,GAAYloB,GAKnB,IAJA,IAAI5J,EAAU4J,EAAK5L,KAAO,GACtB+L,EAAQie,GAAUhoB,GAClBoC,EAASY,GAAelF,KAAKkqB,GAAWhoB,GAAU+J,EAAM3H,OAAS,EAE9DA,KAAU,CACf,IAAIqH,EAAOM,EAAM3H,GACbszB,EAAYjsB,EAAKG,KACrB,GAAiB,MAAb8rB,GAAqBA,GAAa9rB,EACpC,OAAOH,EAAKzL,KAGhB,OAAOgC,EAUT,SAAS6yB,GAAUjpB,GAEjB,OADa5G,GAAelF,KAAKmqB,GAAQ,eAAiBA,GAASre,GACrDsb,YAchB,SAAS2H,KACP,IAAI7sB,EAASioB,GAAOpd,UAAYA,GAEhC,OADA7K,EAASA,IAAW6K,GAAW4G,GAAezR,EACvCqa,UAAUjY,OAASpC,EAAOqa,UAAU,GAAIA,UAAU,IAAMra,EAWjE,SAASwZ,GAAWxa,EAAKoH,GACvB,IAgYiB9H,EACbsD,EAjYA6H,EAAOzK,EAAIiK,SACf,OAiYgB,WADZrH,SADatD,EA/XA8H,KAiYmB,UAARxE,GAA4B,UAARA,GAA4B,WAARA,EACrD,cAAVtD,EACU,OAAVA,GAlYDmL,EAAmB,iBAAPrD,EAAkB,SAAW,QACzCqD,EAAKzK,IAUX,SAASgR,GAAa/E,GAIpB,IAHA,IAAIjL,EAASmD,GAAK8H,GACd7I,EAASpC,EAAOoC,OAEbA,KAAU,CACf,IAAIgE,EAAMpG,EAAOoC,GACb9D,EAAQ2M,EAAO7E,GAEnBpG,EAAOoC,GAAU,CAACgE,EAAK9H,EAAO8R,GAAmB9R,IAEnD,OAAO0B,EAWT,SAASsH,GAAU2D,EAAQ7E,GACzB,IAAI9H,EAlxJR,SAAkB2M,EAAQ7E,GACxB,OAAiB,MAAV6E,EAAiBpM,EAAYoM,EAAO7E,GAixJ7B6Q,CAAShM,EAAQ7E,GAC7B,OAAO4Q,GAAa1Y,GAASA,EAAQO,EAqCvC,IAAIiY,GAAca,GAA+B,SAAS1M,GACxD,OAAc,MAAVA,EACK,IAETA,EAASrN,GAAOqN,GACTuM,GAAYG,GAAiB1M,IAAS,SAAS4M,GACpD,OAAOH,GAAqB5Z,KAAKmN,EAAQ4M,QANRJ,GAiBjC2S,GAAgBzS,GAA+B,SAAS1M,GAE1D,IADA,IAAIjL,EAAS,GACNiL,GACLS,GAAU1L,EAAQ8W,GAAW7L,IAC7BA,EAASiM,GAAajM,GAExB,OAAOjL,GAN8ByX,GAgBnCrK,GAASV,GA2Eb,SAASkP,GAAQ3Q,EAAQkB,EAAMuM,GAO7B,IAJA,IAAI7Q,GAAS,EACTzF,GAHJ+J,EAAOF,GAASE,EAAMlB,IAGJ7I,OACdpC,GAAS,IAEJ6H,EAAQzF,GAAQ,CACvB,IAAIgE,EAAM8F,GAAMC,EAAKtE,IACrB,KAAM7H,EAAmB,MAAViL,GAAkByN,EAAQzN,EAAQ7E,IAC/C,MAEF6E,EAASA,EAAO7E,GAElB,OAAIpG,KAAY6H,GAASzF,EAChBpC,KAEToC,EAAmB,MAAV6I,EAAiB,EAAIA,EAAO7I,SAClB+M,GAAS/M,IAAWiI,GAAQjE,EAAKhE,KACjDhD,GAAQ6L,IAAWd,GAAYc,IA6BpC,SAAS8F,GAAgB9F,GACvB,MAAqC,mBAAtBA,EAAOzF,aAA8BiK,GAAYxE,GAE5D,GADAI,GAAW6L,GAAajM,IA8E9B,SAASU,GAAcrN,GACrB,OAAOc,GAAQd,IAAU6L,GAAY7L,OAChCsa,IAAoBta,GAASA,EAAMsa,KAW1C,SAASvO,GAAQ/L,EAAO8D,GACtB,IAAIR,SAActD,EAGlB,SAFA8D,EAAmB,MAAVA,EAAiBua,EAAmBva,KAGlC,UAARR,GACU,UAARA,GAAoBkX,GAAS5a,KAAKI,KAChCA,GAAS,GAAKA,EAAQ,GAAK,GAAKA,EAAQ8D,EAajD,SAASuS,GAAerW,EAAOuJ,EAAOoD,GACpC,IAAKE,GAASF,GACZ,OAAO,EAET,IAAIrJ,SAAciG,EAClB,SAAY,UAARjG,EACKiO,GAAY5E,IAAWZ,GAAQxC,EAAOoD,EAAO7I,QACrC,UAARR,GAAoBiG,KAASoD,IAE7BD,GAAGC,EAAOpD,GAAQvJ,GAa7B,SAAS6R,GAAM7R,EAAO2M,GACpB,GAAI7L,GAAQd,GACV,OAAO,EAET,IAAIsD,SAActD,EAClB,QAAY,UAARsD,GAA4B,UAARA,GAA4B,WAARA,GAC/B,MAATtD,IAAiBmU,GAASnU,KAGvB0a,EAAc9a,KAAKI,KAAWya,EAAa7a,KAAKI,IAC1C,MAAV2M,GAAkB3M,KAASV,GAAOqN,GAyBvC,SAASgnB,GAAWroB,GAClB,IAAImoB,EAAWD,GAAYloB,GACvBkD,EAAQmb,GAAO8J,GAEnB,GAAoB,mBAATjlB,KAAyBilB,KAAY7J,GAAYjrB,WAC1D,OAAO,EAET,GAAI2M,IAASkD,EACX,OAAO,EAET,IAAIrD,EAAOuoB,GAAQllB,GACnB,QAASrD,GAAQG,IAASH,EAAK,IA7S5BhI,IAAY2L,GAAO,IAAI3L,GAAS,IAAIjE,YAAY,MAAQ0a,GACxD5P,IAAO8E,GAAO,IAAI9E,KAAQwP,GAC1BpY,IAAW0N,GAAO1N,GAAQI,YAAciY,GACxClP,IAAOuE,GAAO,IAAIvE,KAAQmP,GAC1BrO,IAAWyD,GAAO,IAAIzD,KAAYsO,KACrC7K,GAAS,SAAS9O,GAChB,IAAI0B,EAAS0M,GAAWpO,GACpBka,EAAOxY,GAAUuN,EAAYjP,EAAMkH,YAAc3G,EACjD4Z,EAAaD,EAAO7J,GAAS6J,GAAQ,GAEzC,GAAIC,EACF,OAAQA,GACN,KAAKN,GAAoB,OAAOD,EAChC,KAAKE,GAAe,OAAON,EAC3B,KAAKO,GAAmB,OAAON,EAC/B,KAAKO,GAAe,OAAON,EAC3B,KAAKO,GAAmB,OAAON,EAGnC,OAAOjY,IA+SX,IAAI21B,GAAalhB,GAAahG,GAAaqN,GAS3C,SAASrM,GAAYnR,GACnB,IAAIka,EAAOla,GAASA,EAAMkH,YAG1B,OAAOlH,KAFqB,mBAARka,GAAsBA,EAAKvb,WAAc8R,IAa/D,SAASqB,GAAmB9R,GAC1B,OAAOA,GAAUA,IAAU6M,GAAS7M,GAYtC,SAAS2R,GAAwB7J,EAAKmI,GACpC,OAAO,SAAStD,GACd,OAAc,MAAVA,GAGGA,EAAO7E,KAASmI,IACpBA,IAAa1P,GAAcuH,KAAOxI,GAAOqN,KAsIhD,SAAS+G,GAASpI,EAAMsI,EAAO8H,GAE7B,OADA9H,EAAQgI,GAAUhI,IAAUrT,EAAa+K,EAAKxH,OAAS,EAAK8P,EAAO,GAC5D,WAML,IALA,IAAIrI,EAAOwQ,UACPxS,GAAS,EACTzF,EAAS8X,GAAUrQ,EAAKzH,OAAS8P,EAAO,GACxCnI,EAAQ5K,EAAMiD,KAETyF,EAAQzF,GACf2H,EAAMlC,GAASgC,EAAKqI,EAAQrK,GAE9BA,GAAS,EAET,IADA,IAAIyS,EAAYnb,EAAM+S,EAAQ,KACrBrK,EAAQqK,GACfoI,EAAUzS,GAASgC,EAAKhC,GAG1B,OADAyS,EAAUpI,GAAS8H,EAAUjQ,GACtBD,GAAMF,EAAMhN,KAAM0d,IAY7B,SAASkS,GAAOvhB,EAAQkB,GACtB,OAAOA,EAAK/J,OAAS,EAAI6I,EAASuG,GAAQvG,EAAQ0iB,GAAUxhB,EAAM,GAAI,IAaxE,SAAS+mB,GAAQnpB,EAAOmjB,GAKtB,IAJA,IAAI7X,EAAYtL,EAAM3H,OAClBA,EAASolB,GAAU0F,EAAQ9qB,OAAQiT,GACnCugB,EAAW9kB,GAAU/G,GAElB3H,KAAU,CACf,IAAIyF,EAAQqlB,EAAQ9qB,GACpB2H,EAAM3H,GAAUiI,GAAQxC,EAAOwN,GAAaugB,EAAS/tB,GAAShJ,EAEhE,OAAOkL,EAWT,SAASyG,GAAQvF,EAAQ7E,GACvB,IAAY,gBAARA,GAAgD,mBAAhB6E,EAAO7E,KAIhC,aAAPA,EAIJ,OAAO6E,EAAO7E,GAiBhB,IAAIiuB,GAAU7Z,GAASiT,IAUnB1G,GAAaD,IAAiB,SAASld,EAAMqhB,GAC/C,OAAO7uB,GAAK2qB,WAAWnd,EAAMqhB,IAW3BhZ,GAAcuI,GAASpI,IAY3B,SAASkiB,GAAgBzC,EAASgE,EAAW9oB,GAC3C,IAAIqB,EAAUynB,EAAY,GAC1B,OAAO5jB,GAAY4f,EA1brB,SAA2BzjB,EAAQ0nB,GACjC,IAAI1zB,EAAS0zB,EAAQ1zB,OACrB,IAAKA,EACH,OAAOgM,EAET,IAAIuX,EAAYvjB,EAAS,EAGzB,OAFA0zB,EAAQnQ,IAAcvjB,EAAS,EAAI,KAAO,IAAM0zB,EAAQnQ,GACxDmQ,EAAUA,EAAQvzB,KAAKH,EAAS,EAAI,KAAO,KACpCgM,EAAO7J,QAAQya,GAAe,uBAAyB8W,EAAU,UAkb5CC,CAAkB3nB,EAqHhD,SAA2B0nB,EAAS/oB,GAOlC,OANAoW,GAAUrG,GAAW,SAAS4X,GAC5B,IAAIp2B,EAAQ,KAAOo2B,EAAK,GACnB3nB,EAAU2nB,EAAK,KAAQpR,GAAcwS,EAASx3B,IACjDw3B,EAAQ1yB,KAAK9E,MAGVw3B,EAAQvjB,OA5HuCyjB,CAtjBxD,SAAwB5nB,GACtB,IAAIkN,EAAQlN,EAAOkN,MAAM2D,IACzB,OAAO3D,EAAQA,EAAM,GAAGjX,MAAM6a,IAAkB,GAojBwB+W,CAAe7nB,GAASrB,KAYlG,SAASyN,GAAS5Q,GAChB,IAAIgR,EAAQ,EACRC,EAAa,EAEjB,OAAO,WACL,IAAIC,EAAQL,KACRM,EApiNK,IAoiNmBD,EAAQD,GAGpC,GADAA,EAAaC,EACTC,EAAY,GACd,KAAMH,GAziNE,IA0iNN,OAAOP,UAAU,QAGnBO,EAAQ,EAEV,OAAOhR,EAAKE,MAAMjL,EAAWwb,YAYjC,SAAS+O,GAAYrf,EAAOL,GAC1B,IAAI7B,GAAS,EACTzF,EAAS2H,EAAM3H,OACfujB,EAAYvjB,EAAS,EAGzB,IADAsH,EAAOA,IAAS7K,EAAYuD,EAASsH,IAC5B7B,EAAQ6B,GAAM,CACrB,IAAIwsB,EAAOhN,GAAWrhB,EAAO8d,GACzBrnB,EAAQyL,EAAMmsB,GAElBnsB,EAAMmsB,GAAQnsB,EAAMlC,GACpBkC,EAAMlC,GAASvJ,EAGjB,OADAyL,EAAM3H,OAASsH,EACRK,EAUT,IAtTM/J,GAOA6S,GA+SFC,IAtTE9S,GAASyZ,IAsTkB,SAASpH,GACxC,IAAIrS,EAAS,GAOb,OAN6B,KAAzBqS,EAAOgJ,WAAW,IACpBrb,EAAOoD,KAAK,IAEdiP,EAAO9N,QAAQ4W,IAAY,SAASG,EAAOC,EAAQC,EAAOC,GACxDzb,EAAOoD,KAAKoY,EAAQC,EAAUlX,QAAQ6W,GAAc,MAASG,GAAUD,MAElEtb,KA9ToB,SAASoG,GAIlC,OAh0MiB,MA6zMbyM,GAAMnJ,MACRmJ,GAAM/K,QAED1B,KAGLyM,GAAQ7S,GAAO6S,MACZ7S,IAgUT,SAASkM,GAAM5N,GACb,GAAoB,iBAATA,GAAqBmU,GAASnU,GACvC,OAAOA,EAET,IAAI0B,EAAU1B,EAAQ,GACtB,MAAkB,KAAV0B,GAAkB,EAAI1B,IAAU,IAAa,KAAO0B,EAU9D,SAAS2O,GAAS/E,GAChB,GAAY,MAARA,EAAc,CAChB,IACE,OAAOoF,GAAalR,KAAK8L,GACzB,MAAOvM,IACT,IACE,OAAQuM,EAAO,GACf,MAAOvM,KAEX,MAAO,GA4BT,SAAS+qB,GAAayJ,GACpB,GAAIA,aAAmB3J,GACrB,OAAO2J,EAAQ/sB,QAEjB,IAAI9E,EAAS,IAAImoB,GAAc0J,EAAQtJ,YAAasJ,EAAQpJ,WAI5D,OAHAzoB,EAAOwoB,YAAc1X,GAAU+gB,EAAQrJ,aACvCxoB,EAAO0oB,UAAamJ,EAAQnJ,UAC5B1oB,EAAO2oB,WAAakJ,EAAQlJ,WACrB3oB,EAsIT,IAAIm2B,GAAazhB,IAAS,SAAS3K,EAAO1G,GACxC,OAAO2N,GAAkBjH,GACrBmhB,GAAenhB,EAAO6B,GAAYvI,EAAQ,EAAG2N,IAAmB,IAChE,MA6BFolB,GAAe1hB,IAAS,SAAS3K,EAAO1G,GAC1C,IAAIwH,EAAW4hB,GAAKppB,GAIpB,OAHI2N,GAAkBnG,KACpBA,EAAWhM,GAENmS,GAAkBjH,GACrBmhB,GAAenhB,EAAO6B,GAAYvI,EAAQ,EAAG2N,IAAmB,GAAO6b,GAAYhiB,EAAU,IAC7F,MA0BFwrB,GAAiB3hB,IAAS,SAAS3K,EAAO1G,GAC5C,IAAIogB,EAAagJ,GAAKppB,GAItB,OAHI2N,GAAkByS,KACpBA,EAAa5kB,GAERmS,GAAkBjH,GACrBmhB,GAAenhB,EAAO6B,GAAYvI,EAAQ,EAAG2N,IAAmB,GAAOnS,EAAW4kB,GAClF,MAsON,SAAS6S,GAAUvsB,EAAOC,EAAWia,GACnC,IAAI7hB,EAAkB,MAAT2H,EAAgB,EAAIA,EAAM3H,OACvC,IAAKA,EACH,OAAQ,EAEV,IAAIyF,EAAqB,MAAboc,EAAoB,EAAIwQ,GAAUxQ,GAI9C,OAHIpc,EAAQ,IACVA,EAAQqS,GAAU9X,EAASyF,EAAO,IAE7Bmc,GAAcja,EAAO8iB,GAAY7iB,EAAW,GAAInC,GAsCzD,SAAS0uB,GAAcxsB,EAAOC,EAAWia,GACvC,IAAI7hB,EAAkB,MAAT2H,EAAgB,EAAIA,EAAM3H,OACvC,IAAKA,EACH,OAAQ,EAEV,IAAIyF,EAAQzF,EAAS,EAOrB,OANI6hB,IAAcplB,IAChBgJ,EAAQ4sB,GAAUxQ,GAClBpc,EAAQoc,EAAY,EAChB/J,GAAU9X,EAASyF,EAAO,GAC1B2f,GAAU3f,EAAOzF,EAAS,IAEzB4hB,GAAcja,EAAO8iB,GAAY7iB,EAAW,GAAInC,GAAO,GAiBhE,SAAS4tB,GAAQ1rB,GAEf,OADsB,MAATA,GAAoBA,EAAM3H,OACvBwJ,GAAY7B,EAAO,GAAK,GAgG1C,SAASysB,GAAKzsB,GACZ,OAAQA,GAASA,EAAM3H,OAAU2H,EAAM,GAAKlL,EA0E9C,IAAI43B,GAAe/hB,IAAS,SAASyX,GACnC,IAAIuK,EAASnlB,GAAS4a,EAAQoD,IAC9B,OAAQmH,EAAOt0B,QAAUs0B,EAAO,KAAOvK,EAAO,GAC1CD,GAAiBwK,GACjB,MA0BFC,GAAiBjiB,IAAS,SAASyX,GACrC,IAAIthB,EAAW4hB,GAAKN,GAChBuK,EAASnlB,GAAS4a,EAAQoD,IAO9B,OALI1kB,IAAa4hB,GAAKiK,GACpB7rB,EAAWhM,EAEX63B,EAAOnd,MAEDmd,EAAOt0B,QAAUs0B,EAAO,KAAOvK,EAAO,GAC1CD,GAAiBwK,EAAQ7J,GAAYhiB,EAAU,IAC/C,MAwBF+rB,GAAmBliB,IAAS,SAASyX,GACvC,IAAI1I,EAAagJ,GAAKN,GAClBuK,EAASnlB,GAAS4a,EAAQoD,IAM9B,OAJA9L,EAAkC,mBAAdA,EAA2BA,EAAa5kB,IAE1D63B,EAAOnd,MAEDmd,EAAOt0B,QAAUs0B,EAAO,KAAOvK,EAAO,GAC1CD,GAAiBwK,EAAQ73B,EAAW4kB,GACpC,MAoCN,SAASgJ,GAAK1iB,GACZ,IAAI3H,EAAkB,MAAT2H,EAAgB,EAAIA,EAAM3H,OACvC,OAAOA,EAAS2H,EAAM3H,EAAS,GAAKvD,EAuFtC,IAAIg4B,GAAOniB,GAASoiB,IAsBpB,SAASA,GAAQ/sB,EAAO1G,GACtB,OAAQ0G,GAASA,EAAM3H,QAAUiB,GAAUA,EAAOjB,OAC9C4qB,GAAYjjB,EAAO1G,GACnB0G,EAqFN,IAAIgtB,GAAStF,IAAS,SAAS1nB,EAAOmjB,GACpC,IAAI9qB,EAAkB,MAAT2H,EAAgB,EAAIA,EAAM3H,OACnCpC,EAAS0pB,GAAO3f,EAAOmjB,GAM3B,OAJAD,GAAWljB,EAAOwH,GAAS2b,GAAS,SAASrlB,GAC3C,OAAOwC,GAAQxC,EAAOzF,IAAWyF,EAAQA,KACxC0K,KAAK0B,KAEDjU,KA2ET,SAAS8nB,GAAQ/d,GACf,OAAgB,MAATA,EAAgBA,EAAQ8d,GAAc/pB,KAAKiM,GAkapD,IAAIitB,GAAQtiB,IAAS,SAASyX,GAC5B,OAAOsC,GAAS7iB,GAAYugB,EAAQ,EAAGnb,IAAmB,OA0BxDimB,GAAUviB,IAAS,SAASyX,GAC9B,IAAIthB,EAAW4hB,GAAKN,GAIpB,OAHInb,GAAkBnG,KACpBA,EAAWhM,GAEN4vB,GAAS7iB,GAAYugB,EAAQ,EAAGnb,IAAmB,GAAO6b,GAAYhiB,EAAU,OAwBrFqsB,GAAYxiB,IAAS,SAASyX,GAChC,IAAI1I,EAAagJ,GAAKN,GAEtB,OADA1I,EAAkC,mBAAdA,EAA2BA,EAAa5kB,EACrD4vB,GAAS7iB,GAAYugB,EAAQ,EAAGnb,IAAmB,GAAOnS,EAAW4kB,MAgG9E,SAAS0T,GAAMptB,GACb,IAAMA,IAASA,EAAM3H,OACnB,MAAO,GAET,IAAIA,EAAS,EAOb,OANA2H,EAAQyN,GAAYzN,GAAO,SAASqtB,GAClC,GAAIpmB,GAAkBomB,GAEpB,OADAh1B,EAAS8X,GAAUkd,EAAMh1B,OAAQA,IAC1B,KAGJ8H,GAAU9H,GAAQ,SAASyF,GAChC,OAAO0J,GAASxH,EAAO+Z,GAAajc,OAyBxC,SAASwvB,GAAUttB,EAAOc,GACxB,IAAMd,IAASA,EAAM3H,OACnB,MAAO,GAET,IAAIpC,EAASm3B,GAAMptB,GACnB,OAAgB,MAAZc,EACK7K,EAEFuR,GAASvR,GAAQ,SAASo3B,GAC/B,OAAOttB,GAAMe,EAAUhM,EAAWu4B,MAwBtC,IAAIE,GAAU5iB,IAAS,SAAS3K,EAAO1G,GACrC,OAAO2N,GAAkBjH,GACrBmhB,GAAenhB,EAAO1G,GACtB,MAqBFk0B,GAAM7iB,IAAS,SAASyX,GAC1B,OAAOgD,GAAQ3X,GAAY2U,EAAQnb,QA0BjCwmB,GAAQ9iB,IAAS,SAASyX,GAC5B,IAAIthB,EAAW4hB,GAAKN,GAIpB,OAHInb,GAAkBnG,KACpBA,EAAWhM,GAENswB,GAAQ3X,GAAY2U,EAAQnb,IAAoB6b,GAAYhiB,EAAU,OAwB3E4sB,GAAU/iB,IAAS,SAASyX,GAC9B,IAAI1I,EAAagJ,GAAKN,GAEtB,OADA1I,EAAkC,mBAAdA,EAA2BA,EAAa5kB,EACrDswB,GAAQ3X,GAAY2U,EAAQnb,IAAoBnS,EAAW4kB,MAmBhEiU,GAAMhjB,GAASyiB,IA6DfQ,GAAUjjB,IAAS,SAASyX,GAC9B,IAAI/pB,EAAS+pB,EAAO/pB,OAChByI,EAAWzI,EAAS,EAAI+pB,EAAO/pB,EAAS,GAAKvD,EAGjD,OADAgM,EAA8B,mBAAZA,GAA0BshB,EAAO5S,MAAO1O,GAAYhM,EAC/Dw4B,GAAUlL,EAAQthB,MAkC3B,SAAS+sB,GAAMt5B,GACb,IAAI0B,EAASioB,GAAO3pB,GAEpB,OADA0B,EAAOyoB,WAAY,EACZzoB,EAsDT,SAAS4xB,GAAKtzB,EAAOu5B,GACnB,OAAOA,EAAYv5B,GAmBrB,IAAIw5B,GAAYrG,IAAS,SAAS9H,GAChC,IAAIvnB,EAASunB,EAAMvnB,OACf8P,EAAQ9P,EAASunB,EAAM,GAAK,EAC5BrrB,EAAQ1B,KAAK2rB,YACbsP,EAAc,SAAS5sB,GAAU,OAAOye,GAAOze,EAAQ0e,IAE3D,QAAIvnB,EAAS,GAAKxF,KAAK4rB,YAAYpmB,SAC7B9D,aAAiB4pB,IAAiB7d,GAAQ6H,KAGhD5T,EAAQA,EAAMoC,MAAMwR,GAAQA,GAAS9P,EAAS,EAAI,KAC5ComB,YAAYplB,KAAK,CACrB,KAAQwuB,GACR,KAAQ,CAACiG,GACT,QAAWh5B,IAEN,IAAIspB,GAAc7pB,EAAO1B,KAAK6rB,WAAWmJ,MAAK,SAAS7nB,GAI5D,OAHI3H,IAAW2H,EAAM3H,QACnB2H,EAAM3G,KAAKvE,GAENkL,MAZAnN,KAAKg1B,KAAKiG,MA+PjBE,GAAUpH,IAAiB,SAAS3wB,EAAQ1B,EAAO8H,GACjDpD,GAAelF,KAAKkC,EAAQoG,KAC5BpG,EAAOoG,GAET2E,GAAgB/K,EAAQoG,EAAK,MAuI7B4xB,GAAO1G,GAAWgF,IAqBlB2B,GAAW3G,GAAWiF,IA2G1B,SAASt3B,GAAQ6Q,EAAYjF,GAE3B,OADWzL,GAAQ0Q,GAAcqT,GAAY3X,IACjCsE,EAAY+c,GAAYhiB,EAAU,IAuBhD,SAASqtB,GAAapoB,EAAYjF,GAEhC,OADWzL,GAAQ0Q,GAAcsT,GAAiBqI,IACtC3b,EAAY+c,GAAYhiB,EAAU,IA0BhD,IAAIstB,GAAUxH,IAAiB,SAAS3wB,EAAQ1B,EAAO8H,GACjDpD,GAAelF,KAAKkC,EAAQoG,GAC9BpG,EAAOoG,GAAKhD,KAAK9E,GAEjByM,GAAgB/K,EAAQoG,EAAK,CAAC9H,OAsE9B85B,GAAY1jB,IAAS,SAAS5E,EAAY3D,EAAMtC,GAClD,IAAIhC,GAAS,EACTsiB,EAAwB,mBAARhe,EAChBnM,EAAS6P,GAAYC,GAAc3Q,EAAM2Q,EAAW1N,QAAU,GAKlE,OAHAoJ,GAASsE,GAAY,SAASxR,GAC5B0B,IAAS6H,GAASsiB,EAASrgB,GAAMqC,EAAM7N,EAAOuL,GAAQ0iB,GAAWjuB,EAAO6N,EAAMtC,MAEzE7J,KA+BLq4B,GAAQ1H,IAAiB,SAAS3wB,EAAQ1B,EAAO8H,GACnD2E,GAAgB/K,EAAQoG,EAAK9H,MA6C/B,SAASU,GAAI8Q,EAAYjF,GAEvB,OADWzL,GAAQ0Q,GAAcyB,GAAWG,IAChC5B,EAAY+c,GAAYhiB,EAAU,IAkFhD,IAAIytB,GAAY3H,IAAiB,SAAS3wB,EAAQ1B,EAAO8H,GACvDpG,EAAOoG,EAAM,EAAI,GAAGhD,KAAK9E,MACxB,WAAa,MAAO,CAAC,GAAI,OAmSxBi6B,GAAS7jB,IAAS,SAAS5E,EAAYgC,GACzC,GAAkB,MAAdhC,EACF,MAAO,GAET,IAAI1N,EAAS0P,EAAU1P,OAMvB,OALIA,EAAS,GAAKuS,GAAe7E,EAAYgC,EAAU,GAAIA,EAAU,IACnEA,EAAY,GACH1P,EAAS,GAAKuS,GAAe7C,EAAU,GAAIA,EAAU,GAAIA,EAAU,MAC5EA,EAAY,CAACA,EAAU,KAElB8a,GAAY9c,EAAYlE,GAAYkG,EAAW,GAAI,OAqBxD6I,GAAMkM,IAAU,WAClB,OAAOzqB,GAAKse,KAAKC,OA0DnB,SAAS4X,GAAI3oB,EAAM4I,EAAGsC,GAGpB,OAFAtC,EAAIsC,EAAQjW,EAAY2T,EACxBA,EAAK5I,GAAa,MAAL4I,EAAa5I,EAAKxH,OAASoQ,EACjCsiB,GAAWlrB,EAAM6S,EAAe5d,EAAWA,EAAWA,EAAWA,EAAW2T,GAoBrF,SAASgmB,GAAOhmB,EAAG5I,GACjB,IAAI5J,EACJ,GAAmB,mBAAR4J,EACT,MAAM,IAAIzL,GAAUke,GAGtB,OADA7J,EAAIiiB,GAAUjiB,GACP,WAOL,QANMA,EAAI,IACRxS,EAAS4J,EAAKE,MAAMlN,KAAMyd,YAExB7H,GAAK,IACP5I,EAAO/K,GAEFmB,GAuCX,IAAIy4B,GAAO/jB,IAAS,SAAS9K,EAAM1G,EAAS2sB,GAC1C,IAAI9iB,EAv4Ta,EAw4TjB,GAAI8iB,EAASztB,OAAQ,CACnB,IAAI0tB,EAAUtK,GAAeqK,EAAUgD,GAAU4F,KACjD1rB,GAAWyP,EAEb,OAAOsY,GAAWlrB,EAAMmD,EAAS7J,EAAS2sB,EAAUC,MAgDlD4I,GAAUhkB,IAAS,SAASzJ,EAAQ7E,EAAKypB,GAC3C,IAAI9iB,EAAU4rB,EACd,GAAI9I,EAASztB,OAAQ,CACnB,IAAI0tB,EAAUtK,GAAeqK,EAAUgD,GAAU6F,KACjD3rB,GAAWyP,EAEb,OAAOsY,GAAW1uB,EAAK2G,EAAS9B,EAAQ4kB,EAAUC,MAsJpD,SAAS8I,GAAShvB,EAAMqhB,EAAMvnB,GAC5B,IAAIm1B,EACAC,EACAC,EACA/4B,EACAg5B,EACAC,EACAC,EAAiB,EACjBC,GAAU,EACVC,GAAS,EACTpI,GAAW,EAEf,GAAmB,mBAARpnB,EACT,MAAM,IAAIzL,GAAUke,GAUtB,SAASgd,EAAWC,GAClB,IAAIzvB,EAAOgvB,EACP31B,EAAU41B,EAKd,OAHAD,EAAWC,EAAWj6B,EACtBq6B,EAAiBI,EACjBt5B,EAAS4J,EAAKE,MAAM5G,EAAS2G,GAI/B,SAAS0vB,EAAYD,GAMnB,OAJAJ,EAAiBI,EAEjBN,EAAUjS,GAAWyS,EAAcvO,GAE5BkO,EAAUE,EAAWC,GAAQt5B,EAatC,SAASy5B,EAAaH,GACpB,IAAII,EAAoBJ,EAAOL,EAM/B,OAAQA,IAAiBp6B,GAAc66B,GAAqBzO,GACzDyO,EAAoB,GAAON,GANJE,EAAOJ,GAM8BH,EAGjE,SAASS,IACP,IAAIF,EAAO3e,KACX,GAAI8e,EAAaH,GACf,OAAOK,EAAaL,GAGtBN,EAAUjS,GAAWyS,EA3BvB,SAAuBF,GACrB,IAEIM,EAAc3O,GAFMqO,EAAOL,GAI/B,OAAOG,EACH5R,GAAUoS,EAAab,GAJDO,EAAOJ,IAK7BU,EAoB+BC,CAAcP,IAGnD,SAASK,EAAaL,GAKpB,OAJAN,EAAUn6B,EAINmyB,GAAY6H,EACPQ,EAAWC,IAEpBT,EAAWC,EAAWj6B,EACfmB,GAeT,SAAS85B,IACP,IAAIR,EAAO3e,KACPof,EAAaN,EAAaH,GAM9B,GAJAT,EAAWxe,UACXye,EAAWl8B,KACXq8B,EAAeK,EAEXS,EAAY,CACd,GAAIf,IAAYn6B,EACd,OAAO06B,EAAYN,GAErB,GAAIG,EAIF,OAFAxS,GAAaoS,GACbA,EAAUjS,GAAWyS,EAAcvO,GAC5BoO,EAAWJ,GAMtB,OAHID,IAAYn6B,IACdm6B,EAAUjS,GAAWyS,EAAcvO,IAE9BjrB,EAIT,OA3GAirB,EAAOgJ,GAAShJ,IAAS,EACrB9f,GAASzH,KACXy1B,IAAYz1B,EAAQy1B,QAEpBJ,GADAK,EAAS,YAAa11B,GACHwW,GAAU+Z,GAASvwB,EAAQq1B,UAAY,EAAG9N,GAAQ8N,EACrE/H,EAAW,aAActtB,IAAYA,EAAQstB,SAAWA,GAoG1D8I,EAAUE,OApCV,WACMhB,IAAYn6B,GACd+nB,GAAaoS,GAEfE,EAAiB,EACjBL,EAAWI,EAAeH,EAAWE,EAAUn6B,GAgCjDi7B,EAAUG,MA7BV,WACE,OAAOjB,IAAYn6B,EAAYmB,EAAS25B,EAAahf,OA6BhDmf,EAqBT,IAAII,GAAQxlB,IAAS,SAAS9K,EAAMC,GAClC,OAAOmhB,GAAUphB,EAAM,EAAGC,MAsBxBswB,GAAQzlB,IAAS,SAAS9K,EAAMqhB,EAAMphB,GACxC,OAAOmhB,GAAUphB,EAAMqqB,GAAShJ,IAAS,EAAGphB,MAqE9C,SAAS4P,GAAQ7P,EAAMwwB,GACrB,GAAmB,mBAARxwB,GAAmC,MAAZwwB,GAAuC,mBAAZA,EAC3D,MAAM,IAAIj8B,GAAUke,GAEtB,IAAIge,EAAW,WACb,IAAIxwB,EAAOwQ,UACPjU,EAAMg0B,EAAWA,EAAStwB,MAAMlN,KAAMiN,GAAQA,EAAK,GACnDgJ,EAAQwnB,EAASxnB,MAErB,GAAIA,EAAM9P,IAAIqD,GACZ,OAAOyM,EAAMlR,IAAIyE,GAEnB,IAAIpG,EAAS4J,EAAKE,MAAMlN,KAAMiN,GAE9B,OADAwwB,EAASxnB,MAAQA,EAAM/R,IAAIsF,EAAKpG,IAAW6S,EACpC7S,GAGT,OADAq6B,EAASxnB,MAAQ,IAAK4G,GAAQ6gB,OAAS1xB,IAChCyxB,EA0BT,SAASE,GAAOvwB,GACd,GAAwB,mBAAbA,EACT,MAAM,IAAI7L,GAAUke,GAEtB,OAAO,WACL,IAAIxS,EAAOwQ,UACX,OAAQxQ,EAAKzH,QACX,KAAK,EAAG,OAAQ4H,EAAUlM,KAAKlB,MAC/B,KAAK,EAAG,OAAQoN,EAAUlM,KAAKlB,KAAMiN,EAAK,IAC1C,KAAK,EAAG,OAAQG,EAAUlM,KAAKlB,KAAMiN,EAAK,GAAIA,EAAK,IACnD,KAAK,EAAG,OAAQG,EAAUlM,KAAKlB,KAAMiN,EAAK,GAAIA,EAAK,GAAIA,EAAK,IAE9D,OAAQG,EAAUF,MAAMlN,KAAMiN,IAlClC4P,GAAQ6gB,MAAQ1xB,GA2FhB,IAAI4xB,GAAW/K,IAAS,SAAS7lB,EAAM6wB,GAKrC,IAAIC,GAJJD,EAAmC,GAArBA,EAAWr4B,QAAehD,GAAQq7B,EAAW,IACvDlpB,GAASkpB,EAAW,GAAI7oB,GAAUib,OAClCtb,GAAS3F,GAAY6uB,EAAY,GAAI7oB,GAAUib,QAEtBzqB,OAC7B,OAAOsS,IAAS,SAAS7K,GAIvB,IAHA,IAAIhC,GAAS,EACTzF,EAASolB,GAAU3d,EAAKzH,OAAQs4B,KAE3B7yB,EAAQzF,GACfyH,EAAKhC,GAAS4yB,EAAW5yB,GAAO/J,KAAKlB,KAAMiN,EAAKhC,IAElD,OAAOiC,GAAMF,EAAMhN,KAAMiN,SAqCzB8wB,GAAUjmB,IAAS,SAAS9K,EAAMimB,GACpC,IAAIC,EAAUtK,GAAeqK,EAAUgD,GAAU8H,KACjD,OAAO7F,GAAWlrB,EAAM4S,EAAmB3d,EAAWgxB,EAAUC,MAmC9D8K,GAAelmB,IAAS,SAAS9K,EAAMimB,GACzC,IAAIC,EAAUtK,GAAeqK,EAAUgD,GAAU+H,KACjD,OAAO9F,GAAWlrB,EAvgVQ,GAugVuB/K,EAAWgxB,EAAUC,MAyBpE+K,GAAQpJ,IAAS,SAAS7nB,EAAMsjB,GAClC,OAAO4H,GAAWlrB,EA/hVA,IA+hVuB/K,EAAWA,EAAWA,EAAWquB,MAia5E,SAASliB,GAAG1M,EAAOwO,GACjB,OAAOxO,IAAUwO,GAAUxO,GAAUA,GAASwO,GAAUA,EA0B1D,IAAIguB,GAAK9G,GAA0BhI,IAyB/B+O,GAAM/G,IAA0B,SAAS11B,EAAOwO,GAClD,OAAOxO,GAASwO,KAqBd3C,GAAc0R,GAAgB,WAAa,OAAOxB,UAApB,IAAsCwB,GAAkB,SAASvd,GACjG,OAAOqO,GAAarO,IAAU0E,GAAelF,KAAKQ,EAAO,YACtDoZ,GAAqB5Z,KAAKQ,EAAO,WA0BlCc,GAAUD,EAAMC,QAmBhBmjB,GAAgBD,GAAoB1Q,GAAU0Q,IA75PlD,SAA2BhkB,GACzB,OAAOqO,GAAarO,IAAUoO,GAAWpO,IAAUkf,GAu7PrD,SAAS3N,GAAYvR,GACnB,OAAgB,MAATA,GAAiB6Q,GAAS7Q,EAAM8D,UAAYqM,GAAWnQ,GA4BhE,SAAS0S,GAAkB1S,GACzB,OAAOqO,GAAarO,IAAUuR,GAAYvR,GA0C5C,IAAI8L,GAAWgd,IAAkBtL,GAmB7B2G,GAASD,GAAa5Q,GAAU4Q,IAxgQpC,SAAoBlkB,GAClB,OAAOqO,GAAarO,IAAUoO,GAAWpO,IAAU0e,GA+qQrD,SAASge,GAAQ18B,GACf,IAAKqO,GAAarO,GAChB,OAAO,EAET,IAAI4X,EAAMxJ,GAAWpO,GACrB,OAAO4X,GAAO+G,GA9yWF,yBA8yWc/G,GACC,iBAAjB5X,EAAM+G,SAA4C,iBAAd/G,EAAMN,OAAqBiT,GAAc3S,GAkDzF,SAASmQ,GAAWnQ,GAClB,IAAK6M,GAAS7M,GACZ,OAAO,EAIT,IAAI4X,EAAMxJ,GAAWpO,GACrB,OAAO4X,GAAOgH,GAAWhH,GAAOiH,GA32WrB,0BA22W+BjH,GA/1W/B,kBA+1WkDA,EA6B/D,SAAS+kB,GAAU38B,GACjB,MAAuB,iBAATA,GAAqBA,GAASm2B,GAAUn2B,GA6BxD,SAAS6Q,GAAS7Q,GAChB,MAAuB,iBAATA,GACZA,GAAS,GAAKA,EAAQ,GAAK,GAAKA,GAASqe,EA4B7C,SAASxR,GAAS7M,GAChB,IAAIsD,SAActD,EAClB,OAAgB,MAATA,IAA0B,UAARsD,GAA4B,YAARA,GA2B/C,SAAS+K,GAAarO,GACpB,OAAgB,MAATA,GAAiC,iBAATA,EAoBjC,IAAIqkB,GAAQD,GAAY9Q,GAAU8Q,IA5xQlC,SAAmBpkB,GACjB,OAAOqO,GAAarO,IAAU8O,GAAO9O,IAAUwZ,GA6+QjD,SAASojB,GAAS58B,GAChB,MAAuB,iBAATA,GACXqO,GAAarO,IAAUoO,GAAWpO,IAAU8e,EA+BjD,SAASnM,GAAc3S,GACrB,IAAKqO,GAAarO,IAAUoO,GAAWpO,IAAUiP,EAC/C,OAAO,EAET,IAAIjC,EAAQ4L,GAAa5Y,GACzB,GAAc,OAAVgN,EACF,OAAO,EAET,IAAIkN,EAAOxV,GAAelF,KAAKwN,EAAO,gBAAkBA,EAAM9F,YAC9D,MAAsB,mBAARgT,GAAsBA,aAAgBA,GAClDxJ,GAAalR,KAAK0a,IAASwD,GAoB/B,IAAI6G,GAAWD,GAAehR,GAAUgR,IA59QxC,SAAsBtkB,GACpB,OAAOqO,GAAarO,IAAUoO,GAAWpO,IAAU+e,GA6gRjD0F,GAAQD,GAAYlR,GAAUkR,IAngRlC,SAAmBxkB,GACjB,OAAOqO,GAAarO,IAAU8O,GAAO9O,IAAU0Z,GAqhRjD,SAASmjB,GAAS78B,GAChB,MAAuB,iBAATA,IACVc,GAAQd,IAAUqO,GAAarO,IAAUoO,GAAWpO,IAAUgf,EAoBpE,SAAS7K,GAASnU,GAChB,MAAuB,iBAATA,GACXqO,GAAarO,IAAUoO,GAAWpO,IAAUif,EAoBjD,IAAIjT,GAAe4R,GAAmBtK,GAAUsK,IAvjRhD,SAA0B5d,GACxB,OAAOqO,GAAarO,IAClB6Q,GAAS7Q,EAAM8D,WAAagN,GAAe1C,GAAWpO,KA6oRtD88B,GAAKpH,GAA0BtH,IAyB/B2O,GAAMrH,IAA0B,SAAS11B,EAAOwO,GAClD,OAAOxO,GAASwO,KA0BlB,SAASwuB,GAAQh9B,GACf,IAAKA,EACH,MAAO,GAET,GAAIuR,GAAYvR,GACd,OAAO68B,GAAS78B,GAASunB,GAAcvnB,GAASwS,GAAUxS,GAE5D,GAAIooB,IAAepoB,EAAMooB,IACvB,OAv8VN,SAAyBjoB,GAIvB,IAHA,IAAIgL,EACAzJ,EAAS,KAEJyJ,EAAOhL,EAASC,QAAQE,MAC/BoB,EAAOoD,KAAKqG,EAAKnL,OAEnB,OAAO0B,EAg8VIu7B,CAAgBj9B,EAAMooB,OAE/B,IAAIxQ,EAAM9I,GAAO9O,GAGjB,OAFW4X,GAAO4B,EAAShC,GAAcI,GAAO8B,EAASjC,GAAa1S,IAE1D/E,GA0Bd,SAASw1B,GAASx1B,GAChB,OAAKA,GAGLA,EAAQ21B,GAAS31B,MACHoe,GAAYpe,KAAU,IAxkYtB,uBAykYAA,EAAQ,GAAK,EAAI,GAGxBA,GAAUA,EAAQA,EAAQ,EAPd,IAAVA,EAAcA,EAAQ,EAoCjC,SAASm2B,GAAUn2B,GACjB,IAAI0B,EAAS8zB,GAASx1B,GAClBk9B,EAAYx7B,EAAS,EAEzB,OAAOA,GAAWA,EAAUw7B,EAAYx7B,EAASw7B,EAAYx7B,EAAU,EA8BzE,SAASy7B,GAASn9B,GAChB,OAAOA,EAAQ+qB,GAAUoL,GAAUn2B,GAAQ,EAAGue,GAAoB,EA0BpE,SAASoX,GAAS31B,GAChB,GAAoB,iBAATA,EACT,OAAOA,EAET,GAAImU,GAASnU,GACX,OAAOse,EAET,GAAIzR,GAAS7M,GAAQ,CACnB,IAAIwO,EAAgC,mBAAjBxO,EAAM2X,QAAwB3X,EAAM2X,UAAY3X,EACnEA,EAAQ6M,GAAS2B,GAAUA,EAAQ,GAAMA,EAE3C,GAAoB,iBAATxO,EACT,OAAiB,IAAVA,EAAcA,GAASA,EAEhCA,EAAQomB,GAASpmB,GACjB,IAAIo9B,EAAWlc,GAAWthB,KAAKI,GAC/B,OAAQo9B,GAAYjc,GAAUvhB,KAAKI,GAC/B6jB,GAAa7jB,EAAMoC,MAAM,GAAIg7B,EAAW,EAAI,GAC3Cnc,GAAWrhB,KAAKI,GAASse,GAAOte,EA2BvC,SAAS4S,GAAc5S,GACrB,OAAOmrB,GAAWnrB,EAAOiS,GAAOjS,IAsDlC,SAAST,GAASS,GAChB,OAAgB,MAATA,EAAgB,GAAKsU,GAAatU,GAqC3C,IAAIq9B,GAAS9K,IAAe,SAAS5lB,EAAQmD,GAC3C,GAAIqB,GAAYrB,IAAWyB,GAAYzB,GACrCqb,GAAWrb,EAAQjL,GAAKiL,GAASnD,QAGnC,IAAK,IAAI7E,KAAOgI,EACVpL,GAAelF,KAAKsQ,EAAQhI,IAC9BkO,GAAYrJ,EAAQ7E,EAAKgI,EAAOhI,OAoClCw1B,GAAW/K,IAAe,SAAS5lB,EAAQmD,GAC7Cqb,GAAWrb,EAAQmC,GAAOnC,GAASnD,MAgCjC4wB,GAAehL,IAAe,SAAS5lB,EAAQmD,EAAQsC,EAAU1D,GACnEyc,GAAWrb,EAAQmC,GAAOnC,GAASnD,EAAQ+B,MA+BzC8uB,GAAajL,IAAe,SAAS5lB,EAAQmD,EAAQsC,EAAU1D,GACjEyc,GAAWrb,EAAQjL,GAAKiL,GAASnD,EAAQ+B,MAoBvC+uB,GAAKtK,GAAS/H,IA8DdrD,GAAW3R,IAAS,SAASzJ,EAAQ4J,GACvC5J,EAASrN,GAAOqN,GAEhB,IAAIpD,GAAS,EACTzF,EAASyS,EAAQzS,OACjB0S,EAAQ1S,EAAS,EAAIyS,EAAQ,GAAKhW,EAMtC,IAJIiW,GAASH,GAAeE,EAAQ,GAAIA,EAAQ,GAAIC,KAClD1S,EAAS,KAGFyF,EAAQzF,GAMf,IALA,IAAIgM,EAASyG,EAAQhN,GACjB0M,EAAQhE,GAAOnC,GACf4tB,GAAc,EACdC,EAAc1nB,EAAMnS,SAEf45B,EAAaC,GAAa,CACjC,IAAI71B,EAAMmO,EAAMynB,GACZ19B,EAAQ2M,EAAO7E,IAEf9H,IAAUO,GACTmM,GAAG1M,EAAOyQ,GAAY3I,MAAUpD,GAAelF,KAAKmN,EAAQ7E,MAC/D6E,EAAO7E,GAAOgI,EAAOhI,IAK3B,OAAO6E,KAsBLixB,GAAexnB,IAAS,SAAS7K,GAEnC,OADAA,EAAKzG,KAAKvE,EAAW02B,IACdzrB,GAAMqyB,GAAWt9B,EAAWgL,MAgSrC,SAASlI,GAAIsJ,EAAQkB,EAAMuP,GACzB,IAAI1b,EAAmB,MAAViL,EAAiBpM,EAAY2S,GAAQvG,EAAQkB,GAC1D,OAAOnM,IAAWnB,EAAY6c,EAAe1b,EA4D/C,SAASkQ,GAAMjF,EAAQkB,GACrB,OAAiB,MAAVlB,GAAkB2Q,GAAQ3Q,EAAQkB,EAAMwP,IAqBjD,IAAIygB,GAASjJ,IAAe,SAASnzB,EAAQ1B,EAAO8H,GACrC,MAAT9H,GACyB,mBAAlBA,EAAMT,WACfS,EAAQ+Y,GAAqBvZ,KAAKQ,IAGpC0B,EAAO1B,GAAS8H,IACf+L,GAAS5C,KA4BR8sB,GAAWlJ,IAAe,SAASnzB,EAAQ1B,EAAO8H,GACvC,MAAT9H,GACyB,mBAAlBA,EAAMT,WACfS,EAAQ+Y,GAAqBvZ,KAAKQ,IAGhC0E,GAAelF,KAAKkC,EAAQ1B,GAC9B0B,EAAO1B,GAAO8E,KAAKgD,GAEnBpG,EAAO1B,GAAS,CAAC8H,KAElBymB,IAoBCyP,GAAS5nB,GAAS6X,IA8BtB,SAASppB,GAAK8H,GACZ,OAAO4E,GAAY5E,GAAUkR,GAAclR,GAAU8Q,GAAS9Q,GA0BhE,SAASsF,GAAOtF,GACd,OAAO4E,GAAY5E,GAAUkR,GAAclR,GAAQ,GAloTrD,SAAoBA,GAClB,IAAKE,GAASF,GACZ,OA09FJ,SAAsBA,GACpB,IAAIjL,EAAS,GACb,GAAc,MAAViL,EACF,IAAK,IAAI7E,KAAOxI,GAAOqN,GACrBjL,EAAOoD,KAAKgD,GAGhB,OAAOpG,EAj+FE2P,CAAa1E,GAEtB,IAAI2E,EAAUH,GAAYxE,GACtBjL,EAAS,GAEb,IAAK,IAAIoG,KAAO6E,GACD,eAAP7E,IAAyBwJ,GAAY5M,GAAelF,KAAKmN,EAAQ7E,KACrEpG,EAAOoD,KAAKgD,GAGhB,OAAOpG,EAsnToDoc,CAAWnR,GAuGxE,IAAIsxB,GAAQ1L,IAAe,SAAS5lB,EAAQmD,EAAQsC,GAClDD,GAAUxF,EAAQmD,EAAQsC,MAkCxByrB,GAAYtL,IAAe,SAAS5lB,EAAQmD,EAAQsC,EAAU1D,GAChEyD,GAAUxF,EAAQmD,EAAQsC,EAAU1D,MAuBlCwvB,GAAO/K,IAAS,SAASxmB,EAAQ0e,GACnC,IAAI3pB,EAAS,GACb,GAAc,MAAViL,EACF,OAAOjL,EAET,IAAIoT,GAAS,EACbuW,EAAQpY,GAASoY,GAAO,SAASxd,GAG/B,OAFAA,EAAOF,GAASE,EAAMlB,GACtBmI,IAAWA,EAASjH,EAAK/J,OAAS,GAC3B+J,KAETsd,GAAWxe,EAAQ6f,GAAa7f,GAASjL,GACrCoT,IACFpT,EAAS+pB,GAAU/pB,EAAQy8B,EAAwDjH,KAGrF,IADA,IAAIpzB,EAASunB,EAAMvnB,OACZA,KACLgrB,GAAUptB,EAAQ2pB,EAAMvnB,IAE1B,OAAOpC,KA4CLsmB,GAAOmL,IAAS,SAASxmB,EAAQ0e,GACnC,OAAiB,MAAV1e,EAAiB,GAnmT1B,SAAkBA,EAAQ0e,GACxB,OAAOmD,GAAW7hB,EAAQ0e,GAAO,SAASrrB,EAAO6N,GAC/C,OAAO+D,GAAMjF,EAAQkB,MAimTMuwB,CAASzxB,EAAQ0e,MAqBhD,SAASgT,GAAO1xB,EAAQjB,GACtB,GAAc,MAAViB,EACF,MAAO,GAET,IAAIsJ,EAAQhD,GAASuZ,GAAa7f,IAAS,SAAS2xB,GAClD,MAAO,CAACA,MAGV,OADA5yB,EAAY6iB,GAAY7iB,GACjB8iB,GAAW7hB,EAAQsJ,GAAO,SAASjW,EAAO6N,GAC/C,OAAOnC,EAAU1L,EAAO6N,EAAK,OA4IjC,IAAI0wB,GAAUjI,GAAczxB,IA0BxB25B,GAAYlI,GAAcrkB,IA4K9B,SAASlN,GAAO4H,GACd,OAAiB,MAAVA,EAAiB,GAAK2Z,GAAW3Z,EAAQ9H,GAAK8H,IAkNvD,IAAI8xB,GAAY9L,IAAiB,SAASjxB,EAAQg9B,EAAMn1B,GAEtD,OADAm1B,EAAOA,EAAK5+B,cACL4B,GAAU6H,EAAQo1B,GAAWD,GAAQA,MAkB9C,SAASC,GAAW5qB,GAClB,OAAO6qB,GAAWr/B,GAASwU,GAAQjU,eAqBrC,SAAS+yB,GAAO9e,GAEd,OADAA,EAASxU,GAASwU,KACDA,EAAO9N,QAAQmb,GAASyF,IAAc5gB,QAAQid,GAAa,IAsH9E,IAAI2b,GAAYlM,IAAiB,SAASjxB,EAAQg9B,EAAMn1B,GACtD,OAAO7H,GAAU6H,EAAQ,IAAM,IAAMm1B,EAAK5+B,iBAuBxCg/B,GAAYnM,IAAiB,SAASjxB,EAAQg9B,EAAMn1B,GACtD,OAAO7H,GAAU6H,EAAQ,IAAM,IAAMm1B,EAAK5+B,iBAoBxCi/B,GAAavM,GAAgB,eA0N7BwM,GAAYrM,IAAiB,SAASjxB,EAAQg9B,EAAMn1B,GACtD,OAAO7H,GAAU6H,EAAQ,IAAM,IAAMm1B,EAAK5+B,iBAgExCm/B,GAAYtM,IAAiB,SAASjxB,EAAQg9B,EAAMn1B,GACtD,OAAO7H,GAAU6H,EAAQ,IAAM,IAAMq1B,GAAWF,MAsiB9CQ,GAAYvM,IAAiB,SAASjxB,EAAQg9B,EAAMn1B,GACtD,OAAO7H,GAAU6H,EAAQ,IAAM,IAAMm1B,EAAK/4B,iBAoBxCi5B,GAAapM,GAAgB,eAqBjC,SAASI,GAAM7e,EAAQorB,EAAS3oB,GAI9B,OAHAzC,EAASxU,GAASwU,IAClBorB,EAAU3oB,EAAQjW,EAAY4+B,KAEd5+B,EArybpB,SAAwBwT,GACtB,OAAOuP,GAAiB1jB,KAAKmU,GAqyblBqrB,CAAerrB,GA1jb5B,SAAsBA,GACpB,OAAOA,EAAOiJ,MAAMoG,KAAkB,GAyjbFic,CAAatrB,GAzrcnD,SAAoBA,GAClB,OAAOA,EAAOiJ,MAAM6D,KAAgB,GAwrcuBye,CAAWvrB,GAE7DA,EAAOiJ,MAAMmiB,IAAY,GA2BlC,IAAII,GAAUnpB,IAAS,SAAS9K,EAAMC,GACpC,IACE,OAAOC,GAAMF,EAAM/K,EAAWgL,GAC9B,MAAOxM,GACP,OAAO29B,GAAQ39B,GAAKA,EAAI,IAAIyE,GAAMzE,OA8BlCygC,GAAUrM,IAAS,SAASxmB,EAAQ8yB,GAKtC,OAJA5a,GAAU4a,GAAa,SAAS33B,GAC9BA,EAAM8F,GAAM9F,GACZ2E,GAAgBE,EAAQ7E,EAAKqyB,GAAKxtB,EAAO7E,GAAM6E,OAE1CA,KAqGT,SAASkH,GAAS7T,GAChB,OAAO,WACL,OAAOA,GAkDX,IAAI0/B,GAAOxM,KAuBPyM,GAAYzM,IAAW,GAkB3B,SAASjiB,GAASjR,GAChB,OAAOA,EA6CT,SAASuM,GAASjB,GAChB,OAAO6H,GAA4B,mBAAR7H,EAAqBA,EAAOmgB,GAAUngB,EAjte/C,IAwzepB,IAAIjG,GAAS+Q,IAAS,SAASvI,EAAMtC,GACnC,OAAO,SAASoB,GACd,OAAOshB,GAAWthB,EAAQkB,EAAMtC,OA2BhCq0B,GAAWxpB,IAAS,SAASzJ,EAAQpB,GACvC,OAAO,SAASsC,GACd,OAAOogB,GAAWthB,EAAQkB,EAAMtC,OAwCpC,SAASs0B,GAAMlzB,EAAQmD,EAAQ1K,GAC7B,IAAI6Q,EAAQpR,GAAKiL,GACb2vB,EAAchS,GAAc3d,EAAQmG,GAEzB,MAAX7Q,GACEyH,GAASiD,KAAY2vB,EAAY37B,SAAWmS,EAAMnS,UACtDsB,EAAU0K,EACVA,EAASnD,EACTA,EAASrO,KACTmhC,EAAchS,GAAc3d,EAAQjL,GAAKiL,KAE3C,IAAIwpB,IAAUzsB,GAASzH,IAAY,UAAWA,IAAcA,EAAQk0B,OAChEzN,EAAS1b,GAAWxD,GAqBxB,OAnBAkY,GAAU4a,GAAa,SAAShN,GAC9B,IAAInnB,EAAOwE,EAAO2iB,GAClB9lB,EAAO8lB,GAAcnnB,EACjBugB,IACFlf,EAAOhO,UAAU8zB,GAAc,WAC7B,IAAIzI,EAAW1rB,KAAK6rB,UACpB,GAAImP,GAAStP,EAAU,CACrB,IAAItoB,EAASiL,EAAOrO,KAAK2rB,aACrB0G,EAAUjvB,EAAOwoB,YAAc1X,GAAUlU,KAAK4rB,aAIlD,OAFAyG,EAAQ7rB,KAAK,CAAE,KAAQwG,EAAM,KAAQyQ,UAAW,QAAWpP,IAC3DjL,EAAOyoB,UAAYH,EACZtoB,EAET,OAAO4J,EAAKE,MAAMmB,EAAQS,GAAU,CAAC9O,KAAK0B,SAAU+b,iBAKnDpP,EAmCT,SAAS0pB,MAiDT,IAAIyJ,GAAO5K,GAAWjiB,IA8BlB8sB,GAAY7K,GAAWnQ,IAiCvBib,GAAW9K,GAAWte,IAwB1B,SAAS1F,GAASrD,GAChB,OAAOgE,GAAMhE,GAAQ2X,GAAa5X,GAAMC,IAh3X1C,SAA0BA,GACxB,OAAO,SAASlB,GACd,OAAOuG,GAAQvG,EAAQkB,IA82XwBoyB,CAAiBpyB,GAuEpE,IAAIqyB,GAAQ5K,KAsCR6K,GAAa7K,IAAY,GAoB7B,SAASnc,KACP,MAAO,GAgBT,SAASqE,KACP,OAAO,EA+JT,IA2oBM1N,GA3oBFlF,GAAMoqB,IAAoB,SAASoL,EAAQC,GAC7C,OAAOD,EAASC,IACf,GAuBC1X,GAAOsN,GAAY,QAiBnBqK,GAAStL,IAAoB,SAASuL,EAAUC,GAClD,OAAOD,EAAWC,IACjB,GAuBC3X,GAAQoN,GAAY,SAwKpBwK,GAAWzL,IAAoB,SAAS0L,EAAYC,GACtD,OAAOD,EAAaC,IACnB,GAuBCC,GAAQ3K,GAAY,SAiBpB4K,GAAW7L,IAAoB,SAAS8L,EAASC,GACnD,OAAOD,EAAUC,IAChB,GAgmBH,OA1iBApX,GAAOqX,MAp6MP,SAAe9sB,EAAG5I,GAChB,GAAmB,mBAARA,EACT,MAAM,IAAIzL,GAAUke,GAGtB,OADA7J,EAAIiiB,GAAUjiB,GACP,WACL,KAAMA,EAAI,EACR,OAAO5I,EAAKE,MAAMlN,KAAMyd,aA85M9B4N,GAAOsK,IAAMA,GACbtK,GAAO0T,OAASA,GAChB1T,GAAO2T,SAAWA,GAClB3T,GAAO4T,aAAeA,GACtB5T,GAAO6T,WAAaA,GACpB7T,GAAO8T,GAAKA,GACZ9T,GAAOuQ,OAASA,GAChBvQ,GAAOwQ,KAAOA,GACdxQ,GAAO6V,QAAUA,GACjB7V,GAAOyQ,QAAUA,GACjBzQ,GAAOsX,UAl8KP,WACE,IAAKllB,UAAUjY,OACb,MAAO,GAET,IAAI9D,EAAQ+b,UAAU,GACtB,OAAOjb,GAAQd,GAASA,EAAQ,CAACA,IA87KnC2pB,GAAO2P,MAAQA,GACf3P,GAAOuX,MApgTP,SAAez1B,EAAOL,EAAMoL,GAExBpL,GADGoL,EAAQH,GAAe5K,EAAOL,EAAMoL,GAASpL,IAAS7K,GAClD,EAEAqb,GAAUua,GAAU/qB,GAAO,GAEpC,IAAItH,EAAkB,MAAT2H,EAAgB,EAAIA,EAAM3H,OACvC,IAAKA,GAAUsH,EAAO,EACpB,MAAO,GAMT,IAJA,IAAI7B,EAAQ,EACRoC,EAAW,EACXjK,EAASb,EAAM6nB,GAAW5kB,EAASsH,IAEhC7B,EAAQzF,GACbpC,EAAOiK,KAAc0jB,GAAU5jB,EAAOlC,EAAQA,GAAS6B,GAEzD,OAAO1J,GAo/STioB,GAAOwX,QAl+SP,SAAiB11B,GAMf,IALA,IAAIlC,GAAS,EACTzF,EAAkB,MAAT2H,EAAgB,EAAIA,EAAM3H,OACnC6H,EAAW,EACXjK,EAAS,KAEJ6H,EAAQzF,GAAQ,CACvB,IAAI9D,EAAQyL,EAAMlC,GACdvJ,IACF0B,EAAOiK,KAAc3L,GAGzB,OAAO0B,GAu9STioB,GAAOyX,OA97SP,WACE,IAAIt9B,EAASiY,UAAUjY,OACvB,IAAKA,EACH,MAAO,GAMT,IAJA,IAAIyH,EAAO1K,EAAMiD,EAAS,GACtB2H,EAAQsQ,UAAU,GAClBxS,EAAQzF,EAELyF,KACLgC,EAAKhC,EAAQ,GAAKwS,UAAUxS,GAE9B,OAAO6D,GAAUtM,GAAQ2K,GAAS+G,GAAU/G,GAAS,CAACA,GAAQ6B,GAAY/B,EAAM,KAm7SlFoe,GAAO0X,KA3tCP,SAAc3kB,GACZ,IAAI5Y,EAAkB,MAAT4Y,EAAgB,EAAIA,EAAM5Y,OACnCgxB,EAAavG,KASjB,OAPA7R,EAAS5Y,EAAcmP,GAASyJ,GAAO,SAAS0Z,GAC9C,GAAsB,mBAAXA,EAAK,GACd,MAAM,IAAIv2B,GAAUke,GAEtB,MAAO,CAAC+W,EAAWsB,EAAK,IAAKA,EAAK,OAJlB,GAOXhgB,IAAS,SAAS7K,GAEvB,IADA,IAAIhC,GAAS,IACJA,EAAQzF,GAAQ,CACvB,IAAIsyB,EAAO1Z,EAAMnT,GACjB,GAAIiC,GAAM4qB,EAAK,GAAI93B,KAAMiN,GACvB,OAAOC,GAAM4qB,EAAK,GAAI93B,KAAMiN,QA4sCpCoe,GAAO2X,SA9qCP,SAAkBxxB,GAChB,OAz5YF,SAAsBA,GACpB,IAAImG,EAAQpR,GAAKiL,GACjB,OAAO,SAASnD,GACd,OAAO8f,GAAe9f,EAAQmD,EAAQmG,IAs5YjCsrB,CAAa9V,GAAU3b,EA/ieZ,KA6tgBpB6Z,GAAO9V,SAAWA,GAClB8V,GAAO8P,QAAUA,GACjB9P,GAAO1iB,OAtuHP,SAAgBtI,EAAW6iC,GACzB,IAAI9/B,EAASqL,GAAWpO,GACxB,OAAqB,MAAd6iC,EAAqB9/B,EAASwpB,GAAWxpB,EAAQ8/B,IAquH1D7X,GAAO8X,MAzuMP,SAASA,EAAMn2B,EAAM4oB,EAAO1d,GAE1B,IAAI9U,EAAS80B,GAAWlrB,EA7+TN,EA6+T6B/K,EAAWA,EAAWA,EAAWA,EAAWA,EAD3F2zB,EAAQ1d,EAAQjW,EAAY2zB,GAG5B,OADAxyB,EAAOklB,YAAc6a,EAAM7a,YACpBllB,GAsuMTioB,GAAO+X,WA7rMP,SAASA,EAAWp2B,EAAM4oB,EAAO1d,GAE/B,IAAI9U,EAAS80B,GAAWlrB,EAzhUA,GAyhU6B/K,EAAWA,EAAWA,EAAWA,EAAWA,EADjG2zB,EAAQ1d,EAAQjW,EAAY2zB,GAG5B,OADAxyB,EAAOklB,YAAc8a,EAAW9a,YACzBllB,GA0rMTioB,GAAO2Q,SAAWA,GAClB3Q,GAAO5B,SAAWA,GAClB4B,GAAOiU,aAAeA,GACtBjU,GAAOiS,MAAQA,GACfjS,GAAOkS,MAAQA,GACflS,GAAOkO,WAAaA,GACpBlO,GAAOmO,aAAeA,GACtBnO,GAAOoO,eAAiBA,GACxBpO,GAAOgY,KAt0SP,SAAcl2B,EAAOyI,EAAGsC,GACtB,IAAI1S,EAAkB,MAAT2H,EAAgB,EAAIA,EAAM3H,OACvC,OAAKA,EAIEurB,GAAU5jB,GADjByI,EAAKsC,GAAStC,IAAM3T,EAAa,EAAI41B,GAAUjiB,IACnB,EAAI,EAAIA,EAAGpQ,GAH9B,IAo0SX6lB,GAAOiY,UArySP,SAAmBn2B,EAAOyI,EAAGsC,GAC3B,IAAI1S,EAAkB,MAAT2H,EAAgB,EAAIA,EAAM3H,OACvC,OAAKA,EAKEurB,GAAU5jB,EAAO,GADxByI,EAAIpQ,GADJoQ,EAAKsC,GAAStC,IAAM3T,EAAa,EAAI41B,GAAUjiB,KAEhB,EAAI,EAAIA,GAJ9B,IAmySXyV,GAAOkY,eAzvSP,SAAwBp2B,EAAOC,GAC7B,OAAQD,GAASA,EAAM3H,OACnB0sB,GAAU/kB,EAAO8iB,GAAY7iB,EAAW,IAAI,GAAM,GAClD,IAuvSNie,GAAOmY,UAjtSP,SAAmBr2B,EAAOC,GACxB,OAAQD,GAASA,EAAM3H,OACnB0sB,GAAU/kB,EAAO8iB,GAAY7iB,EAAW,IAAI,GAC5C,IA+sSNie,GAAOoY,KA/qSP,SAAct2B,EAAOzL,EAAO4T,EAAO0b,GACjC,IAAIxrB,EAAkB,MAAT2H,EAAgB,EAAIA,EAAM3H,OACvC,OAAKA,GAGD8P,GAAyB,iBAATA,GAAqByC,GAAe5K,EAAOzL,EAAO4T,KACpEA,EAAQ,EACR0b,EAAMxrB,GAzvIV,SAAkB2H,EAAOzL,EAAO4T,EAAO0b,GACrC,IAAIxrB,EAAS2H,EAAM3H,OAWnB,KATA8P,EAAQuiB,GAAUviB,IACN,IACVA,GAASA,EAAQ9P,EAAS,EAAKA,EAAS8P,IAE1C0b,EAAOA,IAAQ/uB,GAAa+uB,EAAMxrB,EAAUA,EAASqyB,GAAU7G,IACrD,IACRA,GAAOxrB,GAETwrB,EAAM1b,EAAQ0b,EAAM,EAAI6N,GAAS7N,GAC1B1b,EAAQ0b,GACb7jB,EAAMmI,KAAW5T,EAEnB,OAAOyL,EA4uIAu2B,CAASv2B,EAAOzL,EAAO4T,EAAO0b,IAN5B,IA6qSX3F,GAAOsY,OA3vOP,SAAgBzwB,EAAY9F,GAE1B,OADW5K,GAAQ0Q,GAAc0H,GAAcqU,IACnC/b,EAAY+c,GAAY7iB,EAAW,KA0vOjDie,GAAOuY,QAvqOP,SAAiB1wB,EAAYjF,GAC3B,OAAOe,GAAY5M,GAAI8Q,EAAYjF,GAAW,IAuqOhDod,GAAOwY,YAhpOP,SAAqB3wB,EAAYjF,GAC/B,OAAOe,GAAY5M,GAAI8Q,EAAYjF,GAAW6R,IAgpOhDuL,GAAOyY,aAxnOP,SAAsB5wB,EAAYjF,EAAUgB,GAE1C,OADAA,EAAQA,IAAUhN,EAAY,EAAI41B,GAAU5oB,GACrCD,GAAY5M,GAAI8Q,EAAYjF,GAAWgB,IAunOhDoc,GAAOwN,QAAUA,GACjBxN,GAAO0Y,YAviSP,SAAqB52B,GAEnB,OADsB,MAATA,GAAoBA,EAAM3H,OACvBwJ,GAAY7B,EAAO2S,GAAY,IAsiSjDuL,GAAO2Y,aA/gSP,SAAsB72B,EAAO8B,GAE3B,OADsB,MAAT9B,GAAoBA,EAAM3H,OAKhCwJ,GAAY7B,EADnB8B,EAAQA,IAAUhN,EAAY,EAAI41B,GAAU5oB,IAFnC,IA6gSXoc,GAAO4Y,KAz9LP,SAAcj3B,GACZ,OAAOkrB,GAAWlrB,EA5wUD,MAqugBnBqe,GAAO+V,KAAOA,GACd/V,GAAOgW,UAAYA,GACnBhW,GAAO6Y,UA3/RP,SAAmB9lB,GAKjB,IAJA,IAAInT,GAAS,EACTzF,EAAkB,MAAT4Y,EAAgB,EAAIA,EAAM5Y,OACnCpC,EAAS,KAEJ6H,EAAQzF,GAAQ,CACvB,IAAIsyB,EAAO1Z,EAAMnT,GACjB7H,EAAO00B,EAAK,IAAMA,EAAK,GAEzB,OAAO10B,GAm/RTioB,GAAO8Y,UA38GP,SAAmB91B,GACjB,OAAiB,MAAVA,EAAiB,GAAK8gB,GAAc9gB,EAAQ9H,GAAK8H,KA28G1Dgd,GAAO+Y,YAj7GP,SAAqB/1B,GACnB,OAAiB,MAAVA,EAAiB,GAAK8gB,GAAc9gB,EAAQsF,GAAOtF,KAi7G5Dgd,GAAOkQ,QAAUA,GACjBlQ,GAAOgZ,QA56RP,SAAiBl3B,GAEf,OADsB,MAATA,GAAoBA,EAAM3H,OACvBurB,GAAU5jB,EAAO,GAAI,GAAK,IA26R5Cke,GAAOwO,aAAeA,GACtBxO,GAAO0O,eAAiBA,GACxB1O,GAAO2O,iBAAmBA,GAC1B3O,GAAOmU,OAASA,GAChBnU,GAAOoU,SAAWA,GAClBpU,GAAOmQ,UAAYA,GACnBnQ,GAAOpd,SAAWA,GAClBod,GAAOoQ,MAAQA,GACfpQ,GAAO9kB,KAAOA,GACd8kB,GAAO1X,OAASA,GAChB0X,GAAOjpB,IAAMA,GACbipB,GAAOiZ,QA1rGP,SAAiBj2B,EAAQJ,GACvB,IAAI7K,EAAS,GAMb,OALA6K,EAAWgiB,GAAYhiB,EAAU,GAEjCU,GAAWN,GAAQ,SAAS3M,EAAO8H,EAAK6E,GACtCF,GAAgB/K,EAAQ6K,EAASvM,EAAO8H,EAAK6E,GAAS3M,MAEjD0B,GAorGTioB,GAAOkZ,UArpGP,SAAmBl2B,EAAQJ,GACzB,IAAI7K,EAAS,GAMb,OALA6K,EAAWgiB,GAAYhiB,EAAU,GAEjCU,GAAWN,GAAQ,SAAS3M,EAAO8H,EAAK6E,GACtCF,GAAgB/K,EAAQoG,EAAKyE,EAASvM,EAAO8H,EAAK6E,OAE7CjL,GA+oGTioB,GAAOmZ,QAphCP,SAAiBhzB,GACf,OAAOiB,GAAY0a,GAAU3b,EAxveX,KA4wgBpB6Z,GAAOoZ,gBAh/BP,SAAyBl1B,EAAMoC,GAC7B,OAAOe,GAAoBnD,EAAM4d,GAAUxb,EA7xezB,KA6wgBpB0Z,GAAOxO,QAAUA,GACjBwO,GAAOsU,MAAQA,GACftU,GAAOkU,UAAYA,GACnBlU,GAAOtkB,OAASA,GAChBskB,GAAOiW,SAAWA,GAClBjW,GAAOkW,MAAQA,GACflW,GAAOsS,OAASA,GAChBtS,GAAOqZ,OAzzBP,SAAgB9uB,GAEd,OADAA,EAAIiiB,GAAUjiB,GACPkC,IAAS,SAAS7K,GACvB,OAAO8iB,GAAQ9iB,EAAM2I,OAuzBzByV,GAAOuU,KAAOA,GACdvU,GAAOsZ,OAnhGP,SAAgBt2B,EAAQjB,GACtB,OAAO2yB,GAAO1xB,EAAQsvB,GAAO1N,GAAY7iB,MAmhG3Cie,GAAOuZ,KA73LP,SAAc53B,GACZ,OAAO4uB,GAAO,EAAG5uB,IA63LnBqe,GAAOwZ,QAr4NP,SAAiB3xB,EAAYgC,EAAWC,EAAQ+C,GAC9C,OAAkB,MAAdhF,EACK,IAEJ1Q,GAAQ0S,KACXA,EAAyB,MAAbA,EAAoB,GAAK,CAACA,IAGnC1S,GADL2S,EAAS+C,EAAQjW,EAAYkT,KAE3BA,EAAmB,MAAVA,EAAiB,GAAK,CAACA,IAE3B6a,GAAY9c,EAAYgC,EAAWC,KA23N5CkW,GAAOmW,KAAOA,GACdnW,GAAOuS,SAAWA,GAClBvS,GAAOoW,UAAYA,GACnBpW,GAAOqW,SAAWA,GAClBrW,GAAO0S,QAAUA,GACjB1S,GAAO2S,aAAeA,GACtB3S,GAAOqQ,UAAYA,GACnBrQ,GAAO3B,KAAOA,GACd2B,GAAO0U,OAASA,GAChB1U,GAAOzY,SAAWA,GAClByY,GAAOyZ,WA/rBP,SAAoBz2B,GAClB,OAAO,SAASkB,GACd,OAAiB,MAAVlB,EAAiBpM,EAAY2S,GAAQvG,EAAQkB,KA8rBxD8b,GAAO4O,KAAOA,GACd5O,GAAO6O,QAAUA,GACjB7O,GAAO0Z,UApsRP,SAAmB53B,EAAO1G,EAAQwH,GAChC,OAAQd,GAASA,EAAM3H,QAAUiB,GAAUA,EAAOjB,OAC9C4qB,GAAYjjB,EAAO1G,EAAQwpB,GAAYhiB,EAAU,IACjDd,GAksRNke,GAAO2Z,YAxqRP,SAAqB73B,EAAO1G,EAAQogB,GAClC,OAAQ1Z,GAASA,EAAM3H,QAAUiB,GAAUA,EAAOjB,OAC9C4qB,GAAYjjB,EAAO1G,EAAQxE,EAAW4kB,GACtC1Z,GAsqRNke,GAAO8O,OAASA,GAChB9O,GAAOuW,MAAQA,GACfvW,GAAOwW,WAAaA,GACpBxW,GAAO4S,MAAQA,GACf5S,GAAOtoB,OAxvNP,SAAgBmQ,EAAY9F,GAE1B,OADW5K,GAAQ0Q,GAAc0H,GAAcqU,IACnC/b,EAAYyqB,GAAO1N,GAAY7iB,EAAW,MAuvNxDie,GAAO4Z,OAzmRP,SAAgB93B,EAAOC,GACrB,IAAIhK,EAAS,GACb,IAAM+J,IAASA,EAAM3H,OACnB,OAAOpC,EAET,IAAI6H,GAAS,EACTqlB,EAAU,GACV9qB,EAAS2H,EAAM3H,OAGnB,IADA4H,EAAY6iB,GAAY7iB,EAAW,KAC1BnC,EAAQzF,GAAQ,CACvB,IAAI9D,EAAQyL,EAAMlC,GACdmC,EAAU1L,EAAOuJ,EAAOkC,KAC1B/J,EAAOoD,KAAK9E,GACZ4uB,EAAQ9pB,KAAKyE,IAIjB,OADAolB,GAAWljB,EAAOmjB,GACXltB,GAwlRTioB,GAAO6Z,KAluLP,SAAcl4B,EAAMsI,GAClB,GAAmB,mBAARtI,EACT,MAAM,IAAIzL,GAAUke,GAGtB,OAAO3H,GAAS9K,EADhBsI,EAAQA,IAAUrT,EAAYqT,EAAQuiB,GAAUviB,KA+tLlD+V,GAAOH,QAAUA,GACjBG,GAAO8Z,WAhtNP,SAAoBjyB,EAAY0C,EAAGsC,GAOjC,OALEtC,GADGsC,EAAQH,GAAe7E,EAAY0C,EAAGsC,GAAStC,IAAM3T,GACpD,EAEA41B,GAAUjiB,IAELpT,GAAQ0Q,GAAcqZ,GAAkBoE,IACvCzd,EAAY0C,IA0sN1ByV,GAAOnnB,IAv6FP,SAAamK,EAAQkB,EAAM7N,GACzB,OAAiB,MAAV2M,EAAiBA,EAAS8hB,GAAQ9hB,EAAQkB,EAAM7N,IAu6FzD2pB,GAAO+Z,QA54FP,SAAiB/2B,EAAQkB,EAAM7N,EAAO0O,GAEpC,OADAA,EAAkC,mBAAdA,EAA2BA,EAAanO,EAC3C,MAAVoM,EAAiBA,EAAS8hB,GAAQ9hB,EAAQkB,EAAM7N,EAAO0O,IA24FhEib,GAAOga,QA1rNP,SAAiBnyB,GAEf,OADW1Q,GAAQ0Q,GAAcwZ,GAAeoE,IACpC5d,IAyrNdmY,GAAOvnB,MAhjRP,SAAeqJ,EAAOmI,EAAO0b,GAC3B,IAAIxrB,EAAkB,MAAT2H,EAAgB,EAAIA,EAAM3H,OACvC,OAAKA,GAGDwrB,GAAqB,iBAAPA,GAAmBjZ,GAAe5K,EAAOmI,EAAO0b,IAChE1b,EAAQ,EACR0b,EAAMxrB,IAGN8P,EAAiB,MAATA,EAAgB,EAAIuiB,GAAUviB,GACtC0b,EAAMA,IAAQ/uB,EAAYuD,EAASqyB,GAAU7G,IAExCD,GAAU5jB,EAAOmI,EAAO0b,IAVtB,IA8iRX3F,GAAOsQ,OAASA,GAChBtQ,GAAOia,WAx3QP,SAAoBn4B,GAClB,OAAQA,GAASA,EAAM3H,OACnBmsB,GAAexkB,GACf,IAs3QNke,GAAOka,aAn2QP,SAAsBp4B,EAAOc,GAC3B,OAAQd,GAASA,EAAM3H,OACnBmsB,GAAexkB,EAAO8iB,GAAYhiB,EAAU,IAC5C,IAi2QNod,GAAO5jB,MA5hEP,SAAegO,EAAQ+vB,EAAWC,GAKhC,OAJIA,GAAyB,iBAATA,GAAqB1tB,GAAetC,EAAQ+vB,EAAWC,KACzED,EAAYC,EAAQxjC,IAEtBwjC,EAAQA,IAAUxjC,EAAYge,EAAmBwlB,IAAU,IAI3DhwB,EAASxU,GAASwU,MAEQ,iBAAb+vB,GACO,MAAbA,IAAsBvf,GAASuf,OAEpCA,EAAYxvB,GAAawvB,KACP7c,GAAWlT,GACpBqd,GAAU7J,GAAcxT,GAAS,EAAGgwB,GAGxChwB,EAAOhO,MAAM+9B,EAAWC,GAZtB,IAuhEXpa,GAAOqa,OAnsLP,SAAgB14B,EAAMsI,GACpB,GAAmB,mBAARtI,EACT,MAAM,IAAIzL,GAAUke,GAGtB,OADAnK,EAAiB,MAATA,EAAgB,EAAIgI,GAAUua,GAAUviB,GAAQ,GACjDwC,IAAS,SAAS7K,GACvB,IAAIE,EAAQF,EAAKqI,GACboI,EAAYoV,GAAU7lB,EAAM,EAAGqI,GAKnC,OAHInI,GACF2B,GAAU4O,EAAWvQ,GAEhBD,GAAMF,EAAMhN,KAAM0d,OAwrL7B2N,GAAOsa,KAl1QP,SAAcx4B,GACZ,IAAI3H,EAAkB,MAAT2H,EAAgB,EAAIA,EAAM3H,OACvC,OAAOA,EAASurB,GAAU5jB,EAAO,EAAG3H,GAAU,IAi1QhD6lB,GAAOua,KArzQP,SAAcz4B,EAAOyI,EAAGsC,GACtB,OAAM/K,GAASA,EAAM3H,OAIdurB,GAAU5jB,EAAO,GADxByI,EAAKsC,GAAStC,IAAM3T,EAAa,EAAI41B,GAAUjiB,IAChB,EAAI,EAAIA,GAH9B,IAozQXyV,GAAOwa,UArxQP,SAAmB14B,EAAOyI,EAAGsC,GAC3B,IAAI1S,EAAkB,MAAT2H,EAAgB,EAAIA,EAAM3H,OACvC,OAAKA,EAKEurB,GAAU5jB,GADjByI,EAAIpQ,GADJoQ,EAAKsC,GAAStC,IAAM3T,EAAa,EAAI41B,GAAUjiB,KAEnB,EAAI,EAAIA,EAAGpQ,GAJ9B,IAmxQX6lB,GAAOya,eAzuQP,SAAwB34B,EAAOC,GAC7B,OAAQD,GAASA,EAAM3H,OACnB0sB,GAAU/kB,EAAO8iB,GAAY7iB,EAAW,IAAI,GAAO,GACnD,IAuuQNie,GAAO0a,UAjsQP,SAAmB54B,EAAOC,GACxB,OAAQD,GAASA,EAAM3H,OACnB0sB,GAAU/kB,EAAO8iB,GAAY7iB,EAAW,IACxC,IA+rQNie,GAAO2a,IApuPP,SAAatkC,EAAOu5B,GAElB,OADAA,EAAYv5B,GACLA,GAmuPT2pB,GAAO4a,SA9oLP,SAAkBj5B,EAAMqhB,EAAMvnB,GAC5B,IAAIy1B,GAAU,EACVnI,GAAW,EAEf,GAAmB,mBAARpnB,EACT,MAAM,IAAIzL,GAAUke,GAMtB,OAJIlR,GAASzH,KACXy1B,EAAU,YAAaz1B,IAAYA,EAAQy1B,QAAUA,EACrDnI,EAAW,aAActtB,IAAYA,EAAQstB,SAAWA,GAEnD4H,GAAShvB,EAAMqhB,EAAM,CAC1B,QAAWkO,EACX,QAAWlO,EACX,SAAY+F,KAioLhB/I,GAAO2J,KAAOA,GACd3J,GAAOqT,QAAUA,GACjBrT,GAAO4U,QAAUA,GACjB5U,GAAO6U,UAAYA,GACnB7U,GAAO6a,OArfP,SAAgBxkC,GACd,OAAIc,GAAQd,GACHiT,GAASjT,EAAO4N,IAElBuG,GAASnU,GAAS,CAACA,GAASwS,GAAUgC,GAAajV,GAASS,MAkfrE2pB,GAAO/W,cAAgBA,GACvB+W,GAAOjO,UA10FP,SAAmB/O,EAAQJ,EAAUqY,GACnC,IAAI1Y,EAAQpL,GAAQ6L,GAChB83B,EAAYv4B,GAASJ,GAASa,IAAWX,GAAaW,GAG1D,GADAJ,EAAWgiB,GAAYhiB,EAAU,GACd,MAAfqY,EAAqB,CACvB,IAAI1K,EAAOvN,GAAUA,EAAOzF,YAE1B0d,EADE6f,EACYv4B,EAAQ,IAAIgO,EAAO,GAE1BrN,GAASF,IACFwD,GAAW+J,GAAQnN,GAAW6L,GAAajM,IAG3C,GAMlB,OAHC83B,EAAY5f,GAAY5X,IAAYN,GAAQ,SAAS3M,EAAOuJ,EAAOoD,GAClE,OAAOJ,EAASqY,EAAa5kB,EAAOuJ,EAAOoD,MAEtCiY,GAuzFT+E,GAAO+a,MArnLP,SAAep5B,GACb,OAAO2oB,GAAI3oB,EAAM,IAqnLnBqe,GAAO+O,MAAQA,GACf/O,GAAOgP,QAAUA,GACjBhP,GAAOiP,UAAYA,GACnBjP,GAAOgb,KAzmQP,SAAcl5B,GACZ,OAAQA,GAASA,EAAM3H,OAAUqsB,GAAS1kB,GAAS,IAymQrDke,GAAOib,OA/kQP,SAAgBn5B,EAAOc,GACrB,OAAQd,GAASA,EAAM3H,OAAUqsB,GAAS1kB,EAAO8iB,GAAYhiB,EAAU,IAAM,IA+kQ/Eod,GAAOkb,SAxjQP,SAAkBp5B,EAAO0Z,GAEvB,OADAA,EAAkC,mBAAdA,EAA2BA,EAAa5kB,EACpDkL,GAASA,EAAM3H,OAAUqsB,GAAS1kB,EAAOlL,EAAW4kB,GAAc,IAujQ5EwE,GAAOmb,MAhyFP,SAAen4B,EAAQkB,GACrB,OAAiB,MAAVlB,GAAwBmiB,GAAUniB,EAAQkB,IAgyFnD8b,GAAOkP,MAAQA,GACflP,GAAOoP,UAAYA,GACnBpP,GAAOob,OApwFP,SAAgBp4B,EAAQkB,EAAM0iB,GAC5B,OAAiB,MAAV5jB,EAAiBA,EAAS2jB,GAAW3jB,EAAQkB,EAAMqjB,GAAaX,KAowFzE5G,GAAOqb,WAzuFP,SAAoBr4B,EAAQkB,EAAM0iB,EAAS7hB,GAEzC,OADAA,EAAkC,mBAAdA,EAA2BA,EAAanO,EAC3C,MAAVoM,EAAiBA,EAAS2jB,GAAW3jB,EAAQkB,EAAMqjB,GAAaX,GAAU7hB,IAwuFnFib,GAAO5kB,OAASA,GAChB4kB,GAAOsb,SAhrFP,SAAkBt4B,GAChB,OAAiB,MAAVA,EAAiB,GAAK2Z,GAAW3Z,EAAQsF,GAAOtF,KAgrFzDgd,GAAOqP,QAAUA,GACjBrP,GAAOiJ,MAAQA,GACfjJ,GAAOub,KA3mLP,SAAcllC,EAAOuzB,GACnB,OAAO8I,GAAQnL,GAAaqC,GAAUvzB,IA2mLxC2pB,GAAOsP,IAAMA,GACbtP,GAAOuP,MAAQA,GACfvP,GAAOwP,QAAUA,GACjBxP,GAAOyP,IAAMA,GACbzP,GAAOwb,UAj3PP,SAAmBlvB,EAAOlR,GACxB,OAAO+rB,GAAc7a,GAAS,GAAIlR,GAAU,GAAIiR,KAi3PlD2T,GAAOyb,cA/1PP,SAAuBnvB,EAAOlR,GAC5B,OAAO+rB,GAAc7a,GAAS,GAAIlR,GAAU,GAAI0pB,KA+1PlD9E,GAAO0P,QAAUA,GAGjB1P,GAAO3kB,QAAUu5B,GACjB5U,GAAO0b,UAAY7G,GACnB7U,GAAO2b,OAAShI,GAChB3T,GAAO4b,WAAahI,GAGpBsC,GAAMlW,GAAQA,IAKdA,GAAO/e,IAAMA,GACb+e,GAAO4V,QAAUA,GACjB5V,GAAO8U,UAAYA,GACnB9U,GAAOgV,WAAaA,GACpBhV,GAAOhB,KAAOA,GACdgB,GAAO6b,MAprFP,SAAevoB,EAAQsO,EAAOC,GAa5B,OAZIA,IAAUjrB,IACZirB,EAAQD,EACRA,EAAQhrB,GAENirB,IAAUjrB,IAEZirB,GADAA,EAAQmK,GAASnK,KACCA,EAAQA,EAAQ,GAEhCD,IAAUhrB,IAEZgrB,GADAA,EAAQoK,GAASpK,KACCA,EAAQA,EAAQ,GAE7BR,GAAU4K,GAAS1Y,GAASsO,EAAOC,IAwqF5C7B,GAAOnjB,MA7jLP,SAAexG,GACb,OAAOyrB,GAAUzrB,EArzVI,IAk3gBvB2pB,GAAO8b,UApgLP,SAAmBzlC,GACjB,OAAOyrB,GAAUzrB,EAAOm+B,IAogL1BxU,GAAO+b,cAr+KP,SAAuB1lC,EAAO0O,GAE5B,OAAO+c,GAAUzrB,EAAOm+B,EADxBzvB,EAAkC,mBAAdA,EAA2BA,EAAanO,IAq+K9DopB,GAAOgc,UA7hLP,SAAmB3lC,EAAO0O,GAExB,OAAO+c,GAAUzrB,EAz1VI,EAw1VrB0O,EAAkC,mBAAdA,EAA2BA,EAAanO,IA6hL9DopB,GAAOic,WA18KP,SAAoBj5B,EAAQmD,GAC1B,OAAiB,MAAVA,GAAkB2c,GAAe9f,EAAQmD,EAAQjL,GAAKiL,KA08K/D6Z,GAAOkJ,OAASA,GAChBlJ,GAAOkc,UA1xCP,SAAmB7lC,EAAOod,GACxB,OAAiB,MAATpd,GAAiBA,GAAUA,EAASod,EAAepd,GA0xC7D2pB,GAAO2W,OAASA,GAChB3W,GAAOmc,SAz9EP,SAAkB/xB,EAAQgyB,EAAQC,GAChCjyB,EAASxU,GAASwU,GAClBgyB,EAASzxB,GAAayxB,GAEtB,IAAIjiC,EAASiQ,EAAOjQ,OAKhBwrB,EAJJ0W,EAAWA,IAAazlC,EACpBuD,EACAinB,GAAUoL,GAAU6P,GAAW,EAAGliC,GAItC,OADAkiC,GAAYD,EAAOjiC,SACA,GAAKiQ,EAAO3R,MAAM4jC,EAAU1W,IAAQyW,GA+8EzDpc,GAAOjd,GAAKA,GACZid,GAAOsc,OAj7EP,SAAgBlyB,GAEd,OADAA,EAASxU,GAASwU,KACAmM,EAAmBtgB,KAAKmU,GACtCA,EAAO9N,QAAQ+Z,EAAiB8G,IAChC/S,GA86EN4V,GAAOuc,aA55EP,SAAsBnyB,GAEpB,OADAA,EAASxU,GAASwU,KACAwM,GAAgB3gB,KAAKmU,GACnCA,EAAO9N,QAAQqa,GAAc,QAC7BvM,GAy5EN4V,GAAOwc,MA57OP,SAAe30B,EAAY9F,EAAW8K,GACpC,IAAIlL,EAAOxK,GAAQ0Q,GAAcuT,GAAasI,GAI9C,OAHI7W,GAASH,GAAe7E,EAAY9F,EAAW8K,KACjD9K,EAAYnL,GAEP+K,EAAKkG,EAAY+c,GAAY7iB,EAAW,KAw7OjDie,GAAO+P,KAAOA,GACd/P,GAAOqO,UAAYA,GACnBrO,GAAOyc,QArxHP,SAAiBz5B,EAAQjB,GACvB,OAAO+Z,GAAY9Y,EAAQ4hB,GAAY7iB,EAAW,GAAIuB,KAqxHxD0c,GAAOgQ,SAAWA,GAClBhQ,GAAOsO,cAAgBA,GACvBtO,GAAO0c,YAjvHP,SAAqB15B,EAAQjB,GAC3B,OAAO+Z,GAAY9Y,EAAQ4hB,GAAY7iB,EAAW,GAAI0hB,KAivHxDzD,GAAOd,MAAQA,GACfc,GAAOhpB,QAAUA,GACjBgpB,GAAOiQ,aAAeA,GACtBjQ,GAAO2c,MArtHP,SAAe35B,EAAQJ,GACrB,OAAiB,MAAVI,EACHA,EACAc,GAAQd,EAAQ4hB,GAAYhiB,EAAU,GAAI0F,KAmtHhD0X,GAAO4c,WAtrHP,SAAoB55B,EAAQJ,GAC1B,OAAiB,MAAVI,EACHA,EACA6gB,GAAa7gB,EAAQ4hB,GAAYhiB,EAAU,GAAI0F,KAorHrD0X,GAAO6c,OArpHP,SAAgB75B,EAAQJ,GACtB,OAAOI,GAAUM,GAAWN,EAAQ4hB,GAAYhiB,EAAU,KAqpH5Dod,GAAO8c,YAxnHP,SAAqB95B,EAAQJ,GAC3B,OAAOI,GAAUygB,GAAgBzgB,EAAQ4hB,GAAYhiB,EAAU,KAwnHjEod,GAAOtmB,IAAMA,GACbsmB,GAAO6S,GAAKA,GACZ7S,GAAO8S,IAAMA,GACb9S,GAAOllB,IAzgHP,SAAakI,EAAQkB,GACnB,OAAiB,MAAVlB,GAAkB2Q,GAAQ3Q,EAAQkB,EAAM8f,KAygHjDhE,GAAO/X,MAAQA,GACf+X,GAAOuO,KAAOA,GACdvO,GAAO1Y,SAAWA,GAClB0Y,GAAOkD,SA5pOP,SAAkBrb,EAAYxR,EAAO2lB,EAAWnP,GAC9ChF,EAAaD,GAAYC,GAAcA,EAAazM,GAAOyM,GAC3DmU,EAAaA,IAAcnP,EAAS2f,GAAUxQ,GAAa,EAE3D,IAAI7hB,EAAS0N,EAAW1N,OAIxB,OAHI6hB,EAAY,IACdA,EAAY/J,GAAU9X,EAAS6hB,EAAW,IAErCkX,GAASrrB,GACXmU,GAAa7hB,GAAU0N,EAAWnS,QAAQW,EAAO2lB,IAAc,IAC7D7hB,GAAUmhB,GAAYzT,EAAYxR,EAAO2lB,IAAc,GAmpOhEgE,GAAOtqB,QA9lSP,SAAiBoM,EAAOzL,EAAO2lB,GAC7B,IAAI7hB,EAAkB,MAAT2H,EAAgB,EAAIA,EAAM3H,OACvC,IAAKA,EACH,OAAQ,EAEV,IAAIyF,EAAqB,MAAboc,EAAoB,EAAIwQ,GAAUxQ,GAI9C,OAHIpc,EAAQ,IACVA,EAAQqS,GAAU9X,EAASyF,EAAO,IAE7B0b,GAAYxZ,EAAOzL,EAAOuJ,IAslSnCogB,GAAO+c,QAlqFP,SAAiBzpB,EAAQrJ,EAAO0b,GAS9B,OARA1b,EAAQ4hB,GAAS5hB,GACb0b,IAAQ/uB,GACV+uB,EAAM1b,EACNA,EAAQ,GAER0b,EAAMkG,GAASlG,GArsVnB,SAAqBrS,EAAQrJ,EAAO0b,GAClC,OAAOrS,GAAUiM,GAAUtV,EAAO0b,IAAQrS,EAASrB,GAAUhI,EAAO0b,GAusV7DqX,CADP1pB,EAAS0Y,GAAS1Y,GACSrJ,EAAO0b,IA0pFpC3F,GAAOqU,OAASA,GAChBrU,GAAO9d,YAAcA,GACrB8d,GAAO7oB,QAAUA,GACjB6oB,GAAO1F,cAAgBA,GACvB0F,GAAOpY,YAAcA,GACrBoY,GAAOjX,kBAAoBA,GAC3BiX,GAAOid,UAtwKP,SAAmB5mC,GACjB,OAAiB,IAAVA,IAA4B,IAAVA,GACtBqO,GAAarO,IAAUoO,GAAWpO,IAAUye,GAqwKjDkL,GAAO7d,SAAWA,GAClB6d,GAAOxF,OAASA,GAChBwF,GAAOkd,UA7sKP,SAAmB7mC,GACjB,OAAOqO,GAAarO,IAA6B,IAAnBA,EAAM0U,WAAmB/B,GAAc3S,IA6sKvE2pB,GAAOmd,QAzqKP,SAAiB9mC,GACf,GAAa,MAATA,EACF,OAAO,EAET,GAAIuR,GAAYvR,KACXc,GAAQd,IAA0B,iBAATA,GAA4C,mBAAhBA,EAAMgb,QAC1DlP,GAAS9L,IAAUgM,GAAahM,IAAU6L,GAAY7L,IAC1D,OAAQA,EAAM8D,OAEhB,IAAI8T,EAAM9I,GAAO9O,GACjB,GAAI4X,GAAO4B,GAAU5B,GAAO8B,EAC1B,OAAQ1Z,EAAMoL,KAEhB,GAAI+F,GAAYnR,GACd,OAAQyd,GAASzd,GAAO8D,OAE1B,IAAK,IAAIgE,KAAO9H,EACd,GAAI0E,GAAelF,KAAKQ,EAAO8H,GAC7B,OAAO,EAGX,OAAO,GAqpKT6hB,GAAOod,QAtnKP,SAAiB/mC,EAAOwO,GACtB,OAAOD,GAAYvO,EAAOwO,IAsnK5Bmb,GAAOqd,YAnlKP,SAAqBhnC,EAAOwO,EAAOE,GAEjC,IAAIhN,GADJgN,EAAkC,mBAAdA,EAA2BA,EAAanO,GAClCmO,EAAW1O,EAAOwO,GAASjO,EACrD,OAAOmB,IAAWnB,EAAYgO,GAAYvO,EAAOwO,EAAOjO,EAAWmO,KAAgBhN,GAilKrFioB,GAAO+S,QAAUA,GACjB/S,GAAOX,SA1hKP,SAAkBhpB,GAChB,MAAuB,iBAATA,GAAqB+oB,GAAe/oB,IA0hKpD2pB,GAAOxZ,WAAaA,GACpBwZ,GAAOgT,UAAYA,GACnBhT,GAAO9Y,SAAWA,GAClB8Y,GAAOtF,MAAQA,GACfsF,GAAOsd,QA11JP,SAAiBt6B,EAAQmD,GACvB,OAAOnD,IAAWmD,GAAU2B,GAAY9E,EAAQmD,EAAQ4B,GAAa5B,KA01JvE6Z,GAAOud,YAvzJP,SAAqBv6B,EAAQmD,EAAQpB,GAEnC,OADAA,EAAkC,mBAAdA,EAA2BA,EAAanO,EACrDkR,GAAY9E,EAAQmD,EAAQ4B,GAAa5B,GAASpB,IAszJ3Dib,GAAOwd,MAvxJP,SAAennC,GAIb,OAAO48B,GAAS58B,IAAUA,IAAUA,GAoxJtC2pB,GAAOyd,SAvvJP,SAAkBpnC,GAChB,GAAIq3B,GAAWr3B,GACb,MAAM,IAAIwD,GAtsXM,mEAwsXlB,OAAOkV,GAAa1Y,IAovJtB2pB,GAAO0d,MAxsJP,SAAernC,GACb,OAAgB,MAATA,GAwsJT2pB,GAAO2d,OAjuJP,SAAgBtnC,GACd,OAAiB,OAAVA,GAiuJT2pB,GAAOiT,SAAWA,GAClBjT,GAAO9c,SAAWA,GAClB8c,GAAOtb,aAAeA,GACtBsb,GAAOhX,cAAgBA,GACvBgX,GAAOpF,SAAWA,GAClBoF,GAAO4d,cArlJP,SAAuBvnC,GACrB,OAAO28B,GAAU38B,IAAUA,IAAS,kBAAqBA,GAASqe,GAqlJpEsL,GAAOlF,MAAQA,GACfkF,GAAOkT,SAAWA,GAClBlT,GAAOxV,SAAWA,GAClBwV,GAAO3d,aAAeA,GACtB2d,GAAO6d,YAn/IP,SAAqBxnC,GACnB,OAAOA,IAAUO,GAm/InBopB,GAAO8d,UA/9IP,SAAmBznC,GACjB,OAAOqO,GAAarO,IAAU8O,GAAO9O,IAAU2Z,GA+9IjDgQ,GAAO+d,UA38IP,SAAmB1nC,GACjB,OAAOqO,GAAarO,IAn6XP,oBAm6XiBoO,GAAWpO,IA28I3C2pB,GAAO1lB,KAz/RP,SAAcwH,EAAOq4B,GACnB,OAAgB,MAATr4B,EAAgB,GAAKwd,GAAWzpB,KAAKiM,EAAOq4B,IAy/RrDna,GAAOkV,UAAYA,GACnBlV,GAAOwE,KAAOA,GACdxE,GAAOge,YAh9RP,SAAqBl8B,EAAOzL,EAAO2lB,GACjC,IAAI7hB,EAAkB,MAAT2H,EAAgB,EAAIA,EAAM3H,OACvC,IAAKA,EACH,OAAQ,EAEV,IAAIyF,EAAQzF,EAKZ,OAJI6hB,IAAcplB,IAEhBgJ,GADAA,EAAQ4sB,GAAUxQ,IACF,EAAI/J,GAAU9X,EAASyF,EAAO,GAAK2f,GAAU3f,EAAOzF,EAAS,IAExE9D,GAAUA,EArvMrB,SAA2ByL,EAAOzL,EAAO2lB,GAEvC,IADA,IAAIpc,EAAQoc,EAAY,EACjBpc,KACL,GAAIkC,EAAMlC,KAAWvJ,EACnB,OAAOuJ,EAGX,OAAOA,EA+uMDq+B,CAAkBn8B,EAAOzL,EAAOuJ,GAChCmc,GAAcja,EAAOoa,GAAWtc,GAAO,IAq8R7CogB,GAAOmV,UAAYA,GACnBnV,GAAOoV,WAAaA,GACpBpV,GAAOmT,GAAKA,GACZnT,GAAOoT,IAAMA,GACbpT,GAAO7N,IAhfP,SAAarQ,GACX,OAAQA,GAASA,EAAM3H,OACnBwpB,GAAa7hB,EAAOwF,GAAUyc,IAC9BntB,GA8eNopB,GAAOke,MApdP,SAAep8B,EAAOc,GACpB,OAAQd,GAASA,EAAM3H,OACnBwpB,GAAa7hB,EAAO8iB,GAAYhiB,EAAU,GAAImhB,IAC9CntB,GAkdNopB,GAAOme,KAjcP,SAAcr8B,GACZ,OAAOsa,GAASta,EAAOwF,KAiczB0Y,GAAOoe,OAvaP,SAAgBt8B,EAAOc,GACrB,OAAOwZ,GAASta,EAAO8iB,GAAYhiB,EAAU,KAua/Cod,GAAOR,IAlZP,SAAa1d,GACX,OAAQA,GAASA,EAAM3H,OACnBwpB,GAAa7hB,EAAOwF,GAAUmd,IAC9B7tB,GAgZNopB,GAAOqe,MAtXP,SAAev8B,EAAOc,GACpB,OAAQd,GAASA,EAAM3H,OACnBwpB,GAAa7hB,EAAO8iB,GAAYhiB,EAAU,GAAI6hB,IAC9C7tB,GAoXNopB,GAAOxQ,UAAYA,GACnBwQ,GAAOnM,UAAYA,GACnBmM,GAAOse,WAztBP,WACE,MAAO,IAytBTte,GAAOue,WAzsBP,WACE,MAAO,IAysBTve,GAAOwe,SAzrBP,WACE,OAAO,GAyrBTxe,GAAO8W,SAAWA,GAClB9W,GAAOye,IA77RP,SAAa38B,EAAOyI,GAClB,OAAQzI,GAASA,EAAM3H,OAAUuqB,GAAQ5iB,EAAO0qB,GAAUjiB,IAAM3T,GA67RlEopB,GAAO0e,WAliCP,WAIE,OAHIvqC,GAAK8pB,IAAMtpB,OACbR,GAAK8pB,EAAIO,IAEJ7pB,MA+hCTqrB,GAAO0M,KAAOA,GACd1M,GAAOtN,IAAMA,GACbsN,GAAO2e,IAj5EP,SAAav0B,EAAQjQ,EAAQD,GAC3BkQ,EAASxU,GAASwU,GAGlB,IAAIw0B,GAFJzkC,EAASqyB,GAAUryB,IAEMsjB,GAAWrT,GAAU,EAC9C,IAAKjQ,GAAUykC,GAAazkC,EAC1B,OAAOiQ,EAET,IAAI6b,GAAO9rB,EAASykC,GAAa,EACjC,OACEnT,GAAcxM,GAAYgH,GAAM/rB,GAChCkQ,EACAqhB,GAAc1M,GAAWkH,GAAM/rB,IAs4EnC8lB,GAAO6e,OA32EP,SAAgBz0B,EAAQjQ,EAAQD,GAC9BkQ,EAASxU,GAASwU,GAGlB,IAAIw0B,GAFJzkC,EAASqyB,GAAUryB,IAEMsjB,GAAWrT,GAAU,EAC9C,OAAQjQ,GAAUykC,EAAYzkC,EACzBiQ,EAASqhB,GAActxB,EAASykC,EAAW1kC,GAC5CkQ,GAq2EN4V,GAAO8e,SA30EP,SAAkB10B,EAAQjQ,EAAQD,GAChCkQ,EAASxU,GAASwU,GAGlB,IAAIw0B,GAFJzkC,EAASqyB,GAAUryB,IAEMsjB,GAAWrT,GAAU,EAC9C,OAAQjQ,GAAUykC,EAAYzkC,EACzBsxB,GAActxB,EAASykC,EAAW1kC,GAASkQ,EAC5CA,GAq0EN4V,GAAO7F,SA1yEP,SAAkB/P,EAAQ20B,EAAOlyB,GAM/B,OALIA,GAAkB,MAATkyB,EACXA,EAAQ,EACCA,IACTA,GAASA,GAEJtf,GAAe7pB,GAASwU,GAAQ9N,QAAQua,GAAa,IAAKkoB,GAAS,IAqyE5E/e,GAAOL,OA1rFP,SAAgBiC,EAAOC,EAAOmd,GA2B5B,GA1BIA,GAA+B,kBAAZA,GAAyBtyB,GAAekV,EAAOC,EAAOmd,KAC3End,EAAQmd,EAAWpoC,GAEjBooC,IAAapoC,IACK,kBAATirB,GACTmd,EAAWnd,EACXA,EAAQjrB,GAEe,kBAATgrB,IACdod,EAAWpd,EACXA,EAAQhrB,IAGRgrB,IAAUhrB,GAAairB,IAAUjrB,GACnCgrB,EAAQ,EACRC,EAAQ,IAGRD,EAAQiK,GAASjK,GACbC,IAAUjrB,GACZirB,EAAQD,EACRA,EAAQ,GAERC,EAAQgK,GAAShK,IAGjBD,EAAQC,EAAO,CACjB,IAAIod,EAAOrd,EACXA,EAAQC,EACRA,EAAQod,EAEV,GAAID,GAAYpd,EAAQ,GAAKC,EAAQ,EAAG,CACtC,IAAIoM,EAAOvO,KACX,OAAOH,GAAUqC,EAASqM,GAAQpM,EAAQD,EAAQ5H,GAAe,QAAUiU,EAAO,IAAI9zB,OAAS,KAAO0nB,GAExG,OAAOZ,GAAWW,EAAOC,IAupF3B7B,GAAOkf,OA5+NP,SAAgBr3B,EAAYjF,EAAUqY,GACpC,IAAItZ,EAAOxK,GAAQ0Q,GAAc4T,GAAcc,GAC3Cb,EAAYtJ,UAAUjY,OAAS,EAEnC,OAAOwH,EAAKkG,EAAY+c,GAAYhiB,EAAU,GAAIqY,EAAaS,EAAWnY,KAy+N5Eyc,GAAOmf,YAh9NP,SAAqBt3B,EAAYjF,EAAUqY,GACzC,IAAItZ,EAAOxK,GAAQ0Q,GAAc8T,GAAmBY,GAChDb,EAAYtJ,UAAUjY,OAAS,EAEnC,OAAOwH,EAAKkG,EAAY+c,GAAYhiB,EAAU,GAAIqY,EAAaS,EAAW8H,KA68N5ExD,GAAOof,OA/wEP,SAAgBh1B,EAAQG,EAAGsC,GAMzB,OAJEtC,GADGsC,EAAQH,GAAetC,EAAQG,EAAGsC,GAAStC,IAAM3T,GAChD,EAEA41B,GAAUjiB,GAET6a,GAAWxvB,GAASwU,GAASG,IA0wEtCyV,GAAO1jB,QApvEP,WACE,IAAIsF,EAAOwQ,UACPhI,EAASxU,GAASgM,EAAK,IAE3B,OAAOA,EAAKzH,OAAS,EAAIiQ,EAASA,EAAO9N,QAAQsF,EAAK,GAAIA,EAAK,KAivEjEoe,GAAOjoB,OAtoGP,SAAgBiL,EAAQkB,EAAMuP,GAG5B,IAAI7T,GAAS,EACTzF,GAHJ+J,EAAOF,GAASE,EAAMlB,IAGJ7I,OAOlB,IAJKA,IACHA,EAAS,EACT6I,EAASpM,KAEFgJ,EAAQzF,GAAQ,CACvB,IAAI9D,EAAkB,MAAV2M,EAAiBpM,EAAYoM,EAAOiB,GAAMC,EAAKtE,KACvDvJ,IAAUO,IACZgJ,EAAQzF,EACR9D,EAAQod,GAEVzQ,EAASwD,GAAWnQ,GAASA,EAAMR,KAAKmN,GAAU3M,EAEpD,OAAO2M,GAonGTgd,GAAOiX,MAAQA,GACfjX,GAAO9B,aAAeA,EACtB8B,GAAOqf,OA15NP,SAAgBx3B,GAEd,OADW1Q,GAAQ0Q,GAAcmZ,GAAcqE,IACnCxd,IAy5NdmY,GAAOve,KA/0NP,SAAcoG,GACZ,GAAkB,MAAdA,EACF,OAAO,EAET,GAAID,GAAYC,GACd,OAAOqrB,GAASrrB,GAAc4V,GAAW5V,GAAcA,EAAW1N,OAEpE,IAAI8T,EAAM9I,GAAO0C,GACjB,OAAIoG,GAAO4B,GAAU5B,GAAO8B,EACnBlI,EAAWpG,KAEbqS,GAASjM,GAAY1N,QAq0N9B6lB,GAAOqV,UAAYA,GACnBrV,GAAOsf,KA/xNP,SAAcz3B,EAAY9F,EAAW8K,GACnC,IAAIlL,EAAOxK,GAAQ0Q,GAAcoF,GAAY2Y,GAI7C,OAHI/Y,GAASH,GAAe7E,EAAY9F,EAAW8K,KACjD9K,EAAYnL,GAEP+K,EAAKkG,EAAY+c,GAAY7iB,EAAW,KA2xNjDie,GAAOuf,YAhsRP,SAAqBz9B,EAAOzL,GAC1B,OAAOwvB,GAAgB/jB,EAAOzL,IAgsRhC2pB,GAAOwf,cApqRP,SAAuB19B,EAAOzL,EAAOuM,GACnC,OAAOsjB,GAAkBpkB,EAAOzL,EAAOuuB,GAAYhiB,EAAU,KAoqR/Dod,GAAOyf,cAjpRP,SAAuB39B,EAAOzL,GAC5B,IAAI8D,EAAkB,MAAT2H,EAAgB,EAAIA,EAAM3H,OACvC,GAAIA,EAAQ,CACV,IAAIyF,EAAQimB,GAAgB/jB,EAAOzL,GACnC,GAAIuJ,EAAQzF,GAAU4I,GAAGjB,EAAMlC,GAAQvJ,GACrC,OAAOuJ,EAGX,OAAQ,GA0oRVogB,GAAO0f,gBArnRP,SAAyB59B,EAAOzL,GAC9B,OAAOwvB,GAAgB/jB,EAAOzL,GAAO,IAqnRvC2pB,GAAO2f,kBAzlRP,SAA2B79B,EAAOzL,EAAOuM,GACvC,OAAOsjB,GAAkBpkB,EAAOzL,EAAOuuB,GAAYhiB,EAAU,IAAI,IAylRnEod,GAAO4f,kBAtkRP,SAA2B99B,EAAOzL,GAEhC,GADsB,MAATyL,GAAoBA,EAAM3H,OAC3B,CACV,IAAIyF,EAAQimB,GAAgB/jB,EAAOzL,GAAO,GAAQ,EAClD,GAAI0M,GAAGjB,EAAMlC,GAAQvJ,GACnB,OAAOuJ,EAGX,OAAQ,GA+jRVogB,GAAOsV,UAAYA,GACnBtV,GAAO6f,WA3oEP,SAAoBz1B,EAAQgyB,EAAQC,GAOlC,OANAjyB,EAASxU,GAASwU,GAClBiyB,EAAuB,MAAZA,EACP,EACAjb,GAAUoL,GAAU6P,GAAW,EAAGjyB,EAAOjQ,QAE7CiiC,EAASzxB,GAAayxB,GACfhyB,EAAO3R,MAAM4jC,EAAUA,EAAWD,EAAOjiC,SAAWiiC,GAqoE7Dpc,GAAOkX,SAAWA,GAClBlX,GAAO8f,IAzUP,SAAah+B,GACX,OAAQA,GAASA,EAAM3H,OACnBkiB,GAAQva,EAAOwF,IACf,GAuUN0Y,GAAO+f,MA7SP,SAAej+B,EAAOc,GACpB,OAAQd,GAASA,EAAM3H,OACnBkiB,GAAQva,EAAO8iB,GAAYhiB,EAAU,IACrC,GA2SNod,GAAOggB,SA7hEP,SAAkB51B,EAAQ3O,EAASoR,GAIjC,IAAIozB,EAAWjgB,GAAOuD,iBAElB1W,GAASH,GAAetC,EAAQ3O,EAASoR,KAC3CpR,EAAU7E,GAEZwT,EAASxU,GAASwU,GAClB3O,EAAUm4B,GAAa,GAAIn4B,EAASwkC,EAAU5S,IAE9C,IAII6S,EACAC,EALAC,EAAUxM,GAAa,GAAIn4B,EAAQ2kC,QAASH,EAASG,QAAS/S,IAC9DgT,EAAcnlC,GAAKklC,GACnBE,EAAgB3jB,GAAWyjB,EAASC,GAIpCzgC,EAAQ,EACR2gC,EAAc9kC,EAAQ8kC,aAAe7oB,GACrCvR,EAAS,WAGTq6B,EAAev5B,IAChBxL,EAAQ6gC,QAAU5kB,IAAWvR,OAAS,IACvCo6B,EAAYp6B,OAAS,KACpBo6B,IAAgB7pB,EAAgBU,GAAeM,IAAWvR,OAAS,KACnE1K,EAAQglC,UAAY/oB,IAAWvR,OAAS,KACzC,KAMEu6B,EAAY,kBACb3lC,GAAelF,KAAK4F,EAAS,cACzBA,EAAQilC,UAAY,IAAIpkC,QAAQ,MAAO,KACvC,6BAA+Bud,GAAmB,KACnD,KAENzP,EAAO9N,QAAQkkC,GAAc,SAASntB,EAAOstB,EAAaC,EAAkBC,EAAiBC,EAAej+B,GAsB1G,OArBA+9B,IAAqBA,EAAmBC,GAGxC16B,GAAUiE,EAAO3R,MAAMmH,EAAOiD,GAAQvG,QAAQqb,GAAmByF,IAG7DujB,IACFT,GAAa,EACb/5B,GAAU,YAAcw6B,EAAc,UAEpCG,IACFX,GAAe,EACfh6B,GAAU,OAAS26B,EAAgB,eAEjCF,IACFz6B,GAAU,iBAAmBy6B,EAAmB,+BAElDhhC,EAAQiD,EAASwQ,EAAMlZ,OAIhBkZ,KAGTlN,GAAU,OAIV,IAAI46B,EAAWhmC,GAAelF,KAAK4F,EAAS,aAAeA,EAAQslC,SACnE,GAAKA,GAKA,GAAI5pB,GAA2BlhB,KAAK8qC,GACvC,MAAM,IAAIlnC,GA3idmB,2DAsid7BsM,EAAS,iBAAmBA,EAAS,QASvCA,GAAUg6B,EAAeh6B,EAAO7J,QAAQ2Z,EAAsB,IAAM9P,GACjE7J,QAAQ4Z,EAAqB,MAC7B5Z,QAAQ6Z,EAAuB,OAGlChQ,EAAS,aAAe46B,GAAY,OAAS,SAC1CA,EACG,GACA,wBAEJ,qBACCb,EACI,mBACA,KAEJC,EACG,uFAEA,OAEJh6B,EACA,gBAEF,IAAIpO,EAAS69B,IAAQ,WACnB,OAAO/uB,GAASw5B,EAAaK,EAAY,UAAYv6B,GAClDtE,MAAMjL,EAAW0pC,MAMtB,GADAvoC,EAAOoO,OAASA,EACZ4sB,GAAQh7B,GACV,MAAMA,EAER,OAAOA,GA46DTioB,GAAOghB,MApsBP,SAAez2B,EAAG3H,GAEhB,IADA2H,EAAIiiB,GAAUjiB,IACN,GAAKA,EAAImK,EACf,MAAO,GAET,IAAI9U,EAAQgV,EACRza,EAASolB,GAAUhV,EAAGqK,GAE1BhS,EAAWgiB,GAAYhiB,GACvB2H,GAAKqK,EAGL,IADA,IAAI7c,EAASkK,GAAU9H,EAAQyI,KACtBhD,EAAQ2K,GACf3H,EAAShD,GAEX,OAAO7H,GAsrBTioB,GAAO6L,SAAWA,GAClB7L,GAAOwM,UAAYA,GACnBxM,GAAOwT,SAAWA,GAClBxT,GAAOihB,QAx5DP,SAAiB5qC,GACf,OAAOT,GAASS,GAAOF,eAw5DzB6pB,GAAOgM,SAAWA,GAClBhM,GAAOkhB,cApuIP,SAAuB7qC,GACrB,OAAOA,EACH+qB,GAAUoL,GAAUn2B,IAAQ,iBAAmBqe,GACpC,IAAVre,EAAcA,EAAQ,GAkuI7B2pB,GAAOpqB,SAAWA,GAClBoqB,GAAOmhB,QAn4DP,SAAiB9qC,GACf,OAAOT,GAASS,GAAO2F,eAm4DzBgkB,GAAO7jB,KA12DP,SAAciO,EAAQlQ,EAAO2S,GAE3B,IADAzC,EAASxU,GAASwU,MACHyC,GAAS3S,IAAUtD,GAChC,OAAO6lB,GAASrS,GAElB,IAAKA,KAAYlQ,EAAQyQ,GAAazQ,IACpC,OAAOkQ,EAET,IAAIyS,EAAae,GAAcxT,GAC3B0S,EAAac,GAAc1jB,GAI/B,OAAOutB,GAAU5K,EAHLD,GAAgBC,EAAYC,GAC9BC,GAAcF,EAAYC,GAAc,GAETxiB,KAAK,KA81DhD0lB,GAAOohB,QAx0DP,SAAiBh3B,EAAQlQ,EAAO2S,GAE9B,IADAzC,EAASxU,GAASwU,MACHyC,GAAS3S,IAAUtD,GAChC,OAAOwT,EAAO3R,MAAM,EAAGikB,GAAgBtS,GAAU,GAEnD,IAAKA,KAAYlQ,EAAQyQ,GAAazQ,IACpC,OAAOkQ,EAET,IAAIyS,EAAae,GAAcxT,GAG/B,OAAOqd,GAAU5K,EAAY,EAFnBE,GAAcF,EAAYe,GAAc1jB,IAAU,GAEvBI,KAAK,KA8zD5C0lB,GAAOqhB,UAxyDP,SAAmBj3B,EAAQlQ,EAAO2S,GAEhC,IADAzC,EAASxU,GAASwU,MACHyC,GAAS3S,IAAUtD,GAChC,OAAOwT,EAAO9N,QAAQua,GAAa,IAErC,IAAKzM,KAAYlQ,EAAQyQ,GAAazQ,IACpC,OAAOkQ,EAET,IAAIyS,EAAae,GAAcxT,GAG/B,OAAOqd,GAAU5K,EAFLD,GAAgBC,EAAYe,GAAc1jB,KAElBI,KAAK,KA8xD3C0lB,GAAOshB,SAtvDP,SAAkBl3B,EAAQ3O,GACxB,IAAItB,EAnvdmB,GAovdnBonC,EAnvdqB,MAqvdzB,GAAIr+B,GAASzH,GAAU,CACrB,IAAI0+B,EAAY,cAAe1+B,EAAUA,EAAQ0+B,UAAYA,EAC7DhgC,EAAS,WAAYsB,EAAU+wB,GAAU/wB,EAAQtB,QAAUA,EAC3DonC,EAAW,aAAc9lC,EAAUkP,GAAalP,EAAQ8lC,UAAYA,EAItE,IAAI3C,GAFJx0B,EAASxU,GAASwU,IAEKjQ,OACvB,GAAImjB,GAAWlT,GAAS,CACtB,IAAIyS,EAAae,GAAcxT,GAC/Bw0B,EAAY/hB,EAAW1iB,OAEzB,GAAIA,GAAUykC,EACZ,OAAOx0B,EAET,IAAIub,EAAMxrB,EAASsjB,GAAW8jB,GAC9B,GAAI5b,EAAM,EACR,OAAO4b,EAET,IAAIxpC,EAAS8kB,EACT4K,GAAU5K,EAAY,EAAG8I,GAAKrrB,KAAK,IACnC8P,EAAO3R,MAAM,EAAGktB,GAEpB,GAAIwU,IAAcvjC,EAChB,OAAOmB,EAASwpC,EAKlB,GAHI1kB,IACF8I,GAAQ5tB,EAAOoC,OAASwrB,GAEtB/K,GAASuf,IACX,GAAI/vB,EAAO3R,MAAMktB,GAAK6b,OAAOrH,GAAY,CACvC,IAAI9mB,EACAouB,EAAY1pC,EAMhB,IAJKoiC,EAAUzlC,SACbylC,EAAYlzB,GAAOkzB,EAAUh0B,OAAQvQ,GAASyhB,GAAQnG,KAAKipB,IAAc,MAE3EA,EAAUzc,UAAY,EACdrK,EAAQ8mB,EAAUjpB,KAAKuwB,IAC7B,IAAIC,EAASruB,EAAMzT,MAErB7H,EAASA,EAAOU,MAAM,EAAGipC,IAAW9qC,EAAY+uB,EAAM+b,SAEnD,GAAIt3B,EAAO1U,QAAQiV,GAAawvB,GAAYxU,IAAQA,EAAK,CAC9D,IAAI/lB,EAAQ7H,EAAOimC,YAAY7D,GAC3Bv6B,GAAS,IACX7H,EAASA,EAAOU,MAAM,EAAGmH,IAG7B,OAAO7H,EAASwpC,GAksDlBvhB,GAAO2hB,SA5qDP,SAAkBv3B,GAEhB,OADAA,EAASxU,GAASwU,KACAkM,EAAiBrgB,KAAKmU,GACpCA,EAAO9N,QAAQ8Z,EAAe4H,IAC9B5T,GAyqDN4V,GAAO4hB,SAvpBP,SAAkBC,GAChB,IAAIna,IAAOnJ,GACX,OAAO3oB,GAASisC,GAAUna,GAspB5B1H,GAAOuV,UAAYA,GACnBvV,GAAOiV,WAAaA,GAGpBjV,GAAO8hB,KAAO9qC,GACdgpB,GAAO+hB,UAAY9R,GACnBjQ,GAAOgiB,MAAQzT,GAEf2H,GAAMlW,IACA7Z,GAAS,GACb7C,GAAW0c,IAAQ,SAASre,EAAMmnB,GAC3B/tB,GAAelF,KAAKmqB,GAAOhrB,UAAW8zB,KACzC3iB,GAAO2iB,GAAcnnB,MAGlBwE,IACH,CAAE,OAAS,IAWjB6Z,GAAOiiB,QA/ihBK,UAkjhBZ/mB,GAAU,CAAC,OAAQ,UAAW,QAAS,aAAc,UAAW,iBAAiB,SAAS4N,GACxF9I,GAAO8I,GAAY7L,YAAc+C,MAInC9E,GAAU,CAAC,OAAQ,SAAS,SAAS4N,EAAYlpB,GAC/CqgB,GAAYjrB,UAAU8zB,GAAc,SAASve,GAC3CA,EAAIA,IAAM3T,EAAY,EAAIqb,GAAUua,GAAUjiB,GAAI,GAElD,IAAIxS,EAAUpD,KAAKisB,eAAiBhhB,EAChC,IAAIqgB,GAAYtrB,MAChBA,KAAKkI,QAUT,OARI9E,EAAO6oB,aACT7oB,EAAO+oB,cAAgBvB,GAAUhV,EAAGxS,EAAO+oB,eAE3C/oB,EAAOgpB,UAAU5lB,KAAK,CACpB,KAAQokB,GAAUhV,EAAGqK,GACrB,KAAQkU,GAAc/wB,EAAO4oB,QAAU,EAAI,QAAU,MAGlD5oB,GAGTkoB,GAAYjrB,UAAU8zB,EAAa,SAAW,SAASve,GACrD,OAAO5V,KAAKkrB,UAAUiJ,GAAYve,GAAGsV,cAKzC3E,GAAU,CAAC,SAAU,MAAO,cAAc,SAAS4N,EAAYlpB,GAC7D,IAAIjG,EAAOiG,EAAQ,EACfsiC,EAjihBe,GAiihBJvoC,GA/hhBG,GA+hhByBA,EAE3CsmB,GAAYjrB,UAAU8zB,GAAc,SAASlmB,GAC3C,IAAI7K,EAASpD,KAAKkI,QAMlB,OALA9E,EAAO8oB,cAAc1lB,KAAK,CACxB,SAAYypB,GAAYhiB,EAAU,GAClC,KAAQjJ,IAEV5B,EAAO6oB,aAAe7oB,EAAO6oB,cAAgBshB,EACtCnqC,MAKXmjB,GAAU,CAAC,OAAQ,SAAS,SAAS4N,EAAYlpB,GAC/C,IAAIuiC,EAAW,QAAUviC,EAAQ,QAAU,IAE3CqgB,GAAYjrB,UAAU8zB,GAAc,WAClC,OAAOn0B,KAAKwtC,GAAU,GAAG9rC,QAAQ,OAKrC6kB,GAAU,CAAC,UAAW,SAAS,SAAS4N,EAAYlpB,GAClD,IAAIwiC,EAAW,QAAUxiC,EAAQ,GAAK,SAEtCqgB,GAAYjrB,UAAU8zB,GAAc,WAClC,OAAOn0B,KAAKisB,aAAe,IAAIX,GAAYtrB,MAAQA,KAAKytC,GAAU,OAItEniB,GAAYjrB,UAAUwiC,QAAU,WAC9B,OAAO7iC,KAAK2jC,OAAOhxB,KAGrB2Y,GAAYjrB,UAAU+6B,KAAO,SAAShuB,GACpC,OAAOpN,KAAK2jC,OAAOv2B,GAAWwsB,QAGhCtO,GAAYjrB,UAAUg7B,SAAW,SAASjuB,GACxC,OAAOpN,KAAKkrB,UAAUkQ,KAAKhuB,IAG7Bke,GAAYjrB,UAAUm7B,UAAY1jB,IAAS,SAASvI,EAAMtC,GACxD,MAAmB,mBAARsC,EACF,IAAI+b,GAAYtrB,MAElBA,KAAKoC,KAAI,SAASV,GACvB,OAAOiuB,GAAWjuB,EAAO6N,EAAMtC,SAInCqe,GAAYjrB,UAAU0C,OAAS,SAASqK,GACtC,OAAOpN,KAAK2jC,OAAOhG,GAAO1N,GAAY7iB,MAGxCke,GAAYjrB,UAAUyD,MAAQ,SAASwR,EAAO0b,GAC5C1b,EAAQuiB,GAAUviB,GAElB,IAAIlS,EAASpD,KACb,OAAIoD,EAAO6oB,eAAiB3W,EAAQ,GAAK0b,EAAM,GACtC,IAAI1F,GAAYloB,IAErBkS,EAAQ,EACVlS,EAASA,EAAOyiC,WAAWvwB,GAClBA,IACTlS,EAASA,EAAOigC,KAAK/tB,IAEnB0b,IAAQ/uB,IAEVmB,GADA4tB,EAAM6G,GAAU7G,IACD,EAAI5tB,EAAOkgC,WAAWtS,GAAO5tB,EAAOwiC,KAAK5U,EAAM1b,IAEzDlS,IAGTkoB,GAAYjrB,UAAUylC,eAAiB,SAAS14B,GAC9C,OAAOpN,KAAKkrB,UAAU6a,UAAU34B,GAAW8d,WAG7CI,GAAYjrB,UAAUq+B,QAAU,WAC9B,OAAO1+B,KAAK4lC,KAAK3lB,IAInBtR,GAAW2c,GAAYjrB,WAAW,SAAS2M,EAAMmnB,GAC/C,IAAIuZ,EAAgB,qCAAqCpsC,KAAK6yB,GAC1DwZ,EAAU,kBAAkBrsC,KAAK6yB,GACjCyZ,EAAaviB,GAAOsiB,EAAW,QAAwB,QAAdxZ,EAAuB,QAAU,IAAOA,GACjF0Z,EAAeF,GAAW,QAAQrsC,KAAK6yB,GAEtCyZ,IAGLviB,GAAOhrB,UAAU8zB,GAAc,WAC7B,IAAIzyB,EAAQ1B,KAAK2rB,YACb1e,EAAO0gC,EAAU,CAAC,GAAKlwB,UACvBqwB,EAASpsC,aAAiB4pB,GAC1Brd,EAAWhB,EAAK,GAChB8gC,EAAUD,GAAUtrC,GAAQd,GAE5Bu5B,EAAc,SAASv5B,GACzB,IAAI0B,EAASwqC,EAAW1gC,MAAMme,GAAQvc,GAAU,CAACpN,GAAQuL,IACzD,OAAQ0gC,GAAWjiB,EAAYtoB,EAAO,GAAKA,GAGzC2qC,GAAWL,GAAoC,mBAAZz/B,GAA6C,GAAnBA,EAASzI,SAExEsoC,EAASC,GAAU,GAErB,IAAIriB,EAAW1rB,KAAK6rB,UAChBmiB,IAAahuC,KAAK4rB,YAAYpmB,OAC9ByoC,EAAcJ,IAAiBniB,EAC/BwiB,EAAWJ,IAAWE,EAE1B,IAAKH,GAAgBE,EAAS,CAC5BrsC,EAAQwsC,EAAWxsC,EAAQ,IAAI4pB,GAAYtrB,MAC3C,IAAIoD,EAAS4J,EAAKE,MAAMxL,EAAOuL,GAE/B,OADA7J,EAAOwoB,YAAYplB,KAAK,CAAE,KAAQwuB,GAAM,KAAQ,CAACiG,GAAc,QAAWh5B,IACnE,IAAIspB,GAAcnoB,EAAQsoB,GAEnC,OAAIuiB,GAAeC,EACVlhC,EAAKE,MAAMlN,KAAMiN,IAE1B7J,EAASpD,KAAKg1B,KAAKiG,GACZgT,EAAeN,EAAUvqC,EAAO1B,QAAQ,GAAK0B,EAAO1B,QAAW0B,QAK1EmjB,GAAU,CAAC,MAAO,OAAQ,QAAS,OAAQ,SAAU,YAAY,SAAS4N,GACxE,IAAInnB,EAAO2c,GAAWwK,GAClBga,EAAY,0BAA0B7sC,KAAK6yB,GAAc,MAAQ,OACjE0Z,EAAe,kBAAkBvsC,KAAK6yB,GAE1C9I,GAAOhrB,UAAU8zB,GAAc,WAC7B,IAAIlnB,EAAOwQ,UACX,GAAIowB,IAAiB7tC,KAAK6rB,UAAW,CACnC,IAAInqB,EAAQ1B,KAAK0B,QACjB,OAAOsL,EAAKE,MAAM1K,GAAQd,GAASA,EAAQ,GAAIuL,GAEjD,OAAOjN,KAAKmuC,IAAW,SAASzsC,GAC9B,OAAOsL,EAAKE,MAAM1K,GAAQd,GAASA,EAAQ,GAAIuL,UAMrD0B,GAAW2c,GAAYjrB,WAAW,SAAS2M,EAAMmnB,GAC/C,IAAIyZ,EAAaviB,GAAO8I,GACxB,GAAIyZ,EAAY,CACd,IAAIpkC,EAAMokC,EAAWxsC,KAAO,GACvBgF,GAAelF,KAAKkqB,GAAW5hB,KAClC4hB,GAAU5hB,GAAO,IAEnB4hB,GAAU5hB,GAAKhD,KAAK,CAAE,KAAQ2tB,EAAY,KAAQyZ,QAItDxiB,GAAUmK,GAAatzB,EAlthBA,GAkthB+Bb,MAAQ,CAAC,CAC7D,KAAQ,UACR,KAAQa,IAIVqpB,GAAYjrB,UAAU6H,MAh9dtB,WACE,IAAI9E,EAAS,IAAIkoB,GAAYtrB,KAAK2rB,aAOlC,OANAvoB,EAAOwoB,YAAc1X,GAAUlU,KAAK4rB,aACpCxoB,EAAO4oB,QAAUhsB,KAAKgsB,QACtB5oB,EAAO6oB,aAAejsB,KAAKisB,aAC3B7oB,EAAO8oB,cAAgBhY,GAAUlU,KAAKksB,eACtC9oB,EAAO+oB,cAAgBnsB,KAAKmsB,cAC5B/oB,EAAOgpB,UAAYlY,GAAUlU,KAAKosB,WAC3BhpB,GAy8dTkoB,GAAYjrB,UAAU6qB,QA97dtB,WACE,GAAIlrB,KAAKisB,aAAc,CACrB,IAAI7oB,EAAS,IAAIkoB,GAAYtrB,MAC7BoD,EAAO4oB,SAAW,EAClB5oB,EAAO6oB,cAAe,OAEtB7oB,EAASpD,KAAKkI,SACP8jB,UAAY,EAErB,OAAO5oB,GAs7dTkoB,GAAYjrB,UAAUqB,MA36dtB,WACE,IAAIyL,EAAQnN,KAAK2rB,YAAYjqB,QACzB0sC,EAAMpuC,KAAKgsB,QACXpe,EAAQpL,GAAQ2K,GAChBkhC,EAAUD,EAAM,EAChB31B,EAAY7K,EAAQT,EAAM3H,OAAS,EACnCzB,EA8pIN,SAAiBuR,EAAO0b,EAAK6M,GAI3B,IAHA,IAAI5yB,GAAS,EACTzF,EAASq4B,EAAWr4B,SAEfyF,EAAQzF,GAAQ,CACvB,IAAIqH,EAAOgxB,EAAW5yB,GAClB6B,EAAOD,EAAKC,KAEhB,OAAQD,EAAK7H,MACX,IAAK,OAAasQ,GAASxI,EAAM,MACjC,IAAK,YAAakkB,GAAOlkB,EAAM,MAC/B,IAAK,OAAakkB,EAAMpG,GAAUoG,EAAK1b,EAAQxI,GAAO,MACtD,IAAK,YAAawI,EAAQgI,GAAUhI,EAAO0b,EAAMlkB,IAGrD,MAAO,CAAE,MAASwI,EAAO,IAAO0b,GA7qIrBsd,CAAQ,EAAG71B,EAAWzY,KAAKosB,WAClC9W,EAAQvR,EAAKuR,MACb0b,EAAMjtB,EAAKitB,IACXxrB,EAASwrB,EAAM1b,EACfrK,EAAQojC,EAAUrd,EAAO1b,EAAQ,EACjCJ,EAAYlV,KAAKksB,cACjBqiB,EAAar5B,EAAU1P,OACvB6H,EAAW,EACXmhC,EAAY5jB,GAAUplB,EAAQxF,KAAKmsB,eAEvC,IAAKve,IAAWygC,GAAW51B,GAAajT,GAAUgpC,GAAahpC,EAC7D,OAAO4sB,GAAiBjlB,EAAOnN,KAAK4rB,aAEtC,IAAIxoB,EAAS,GAEbqrB,EACA,KAAOjpB,KAAY6H,EAAWmhC,GAAW,CAMvC,IAHA,IAAIC,GAAa,EACb/sC,EAAQyL,EAHZlC,GAASmjC,KAKAK,EAAYF,GAAY,CAC/B,IAAI1hC,EAAOqI,EAAUu5B,GACjBxgC,EAAWpB,EAAKoB,SAChBjJ,EAAO6H,EAAK7H,KACZ0pB,EAAWzgB,EAASvM,GAExB,GA7zDY,GA6zDRsD,EACFtD,EAAQgtB,OACH,IAAKA,EAAU,CACpB,GAj0Da,GAi0DT1pB,EACF,SAASypB,EAET,MAAMA,GAIZrrB,EAAOiK,KAAc3L,EAEvB,OAAO0B,GAg4dTioB,GAAOhrB,UAAU8+B,GAAKjE,GACtB7P,GAAOhrB,UAAU26B,MA1iQjB,WACE,OAAOA,GAAMh7B,OA0iQfqrB,GAAOhrB,UAAUquC,OA7gQjB,WACE,OAAO,IAAInjB,GAAcvrB,KAAK0B,QAAS1B,KAAK6rB,YA6gQ9CR,GAAOhrB,UAAUyB,KAp/PjB,WACM9B,KAAK+rB,aAAe9pB,IACtBjC,KAAK+rB,WAAa2S,GAAQ1+B,KAAK0B,UAEjC,IAAIM,EAAOhC,KAAK8rB,WAAa9rB,KAAK+rB,WAAWvmB,OAG7C,MAAO,CAAE,KAAQxD,EAAM,MAFXA,EAAOC,EAAYjC,KAAK+rB,WAAW/rB,KAAK8rB,eAg/PtDT,GAAOhrB,UAAUi1B,MA77PjB,SAAsB5zB,GAIpB,IAHA,IAAI0B,EACAwsB,EAAS5vB,KAEN4vB,aAAkBnE,IAAY,CACnC,IAAIvjB,EAAQsjB,GAAaoE,GACzB1nB,EAAM4jB,UAAY,EAClB5jB,EAAM6jB,WAAa9pB,EACfmB,EACFmtB,EAAS5E,YAAczjB,EAEvB9E,EAAS8E,EAEX,IAAIqoB,EAAWroB,EACf0nB,EAASA,EAAOjE,YAGlB,OADA4E,EAAS5E,YAAcjqB,EAChB0B,GA66PTioB,GAAOhrB,UAAU6qB,QAt5PjB,WACE,IAAIxpB,EAAQ1B,KAAK2rB,YACjB,GAAIjqB,aAAiB4pB,GAAa,CAChC,IAAIqjB,EAAUjtC,EAUd,OATI1B,KAAK4rB,YAAYpmB,SACnBmpC,EAAU,IAAIrjB,GAAYtrB,QAE5B2uC,EAAUA,EAAQzjB,WACVU,YAAYplB,KAAK,CACvB,KAAQwuB,GACR,KAAQ,CAAC9J,IACT,QAAWjpB,IAEN,IAAIspB,GAAcojB,EAAS3uC,KAAK6rB,WAEzC,OAAO7rB,KAAKg1B,KAAK9J,KAw4PnBG,GAAOhrB,UAAUuuC,OAASvjB,GAAOhrB,UAAUgZ,QAAUgS,GAAOhrB,UAAUqB,MAv3PtE,WACE,OAAO0wB,GAAiBpyB,KAAK2rB,YAAa3rB,KAAK4rB,cAy3PjDP,GAAOhrB,UAAUgtC,MAAQhiB,GAAOhrB,UAAUu5B,KAEtC9P,KACFuB,GAAOhrB,UAAUypB,IAj+PnB,WACE,OAAO9pB,OAk+PFqrB,GAMD9B,GAQN/pB,GAAK8pB,EAAIA,IAIT,aACE,OAAOA,IACR,mCAaHpoB,KAAKlB,sBCxzhBP,IAAI2U,EAAW,EAAQ,MACnBE,EAAe,EAAQ,MACvBC,EAAU,EAAQ,MAClBtS,EAAU,EAAQ,MAiDtB7C,EAAOD,QALP,SAAawT,EAAYjF,GAEvB,OADWzL,EAAQ0Q,GAAcyB,EAAWG,GAChC5B,EAAY2B,EAAa5G,EAAU,qBCjDjD,IAAIjC,EAAW,EAAQ,MAiDvB,SAAS6Q,EAAQ7P,EAAMwwB,GACrB,GAAmB,mBAARxwB,GAAmC,MAAZwwB,GAAuC,mBAAZA,EAC3D,MAAM,IAAIj8B,UAhDQ,uBAkDpB,IAAIk8B,EAAW,WACb,IAAIxwB,EAAOwQ,UACPjU,EAAMg0B,EAAWA,EAAStwB,MAAMlN,KAAMiN,GAAQA,EAAK,GACnDgJ,EAAQwnB,EAASxnB,MAErB,GAAIA,EAAM9P,IAAIqD,GACZ,OAAOyM,EAAMlR,IAAIyE,GAEnB,IAAIpG,EAAS4J,EAAKE,MAAMlN,KAAMiN,GAE9B,OADAwwB,EAASxnB,MAAQA,EAAM/R,IAAIsF,EAAKpG,IAAW6S,EACpC7S,GAGT,OADAq6B,EAASxnB,MAAQ,IAAK4G,EAAQ6gB,OAAS1xB,GAChCyxB,EAIT5gB,EAAQ6gB,MAAQ1xB,EAEhBrM,EAAOD,QAAUmd,kBCxEjB,IAAIhJ,EAAY,EAAQ,MAkCpB8rB,EAjCiB,EAAQ,KAiCjB1L,EAAe,SAAS5lB,EAAQmD,EAAQsC,GAClDD,EAAUxF,EAAQmD,EAAQsC,MAG5BnU,EAAOD,QAAUigC,kBCtCjB,IAAIzY,EAAe,EAAQ,KACvBya,EAAmB,EAAQ,MAC3BpuB,EAAQ,EAAQ,MAChBjE,EAAQ,EAAQ,KA4BpB3P,EAAOD,QAJP,SAAkB6P,GAChB,OAAOgE,EAAMhE,GAAQ2X,EAAa5X,EAAMC,IAASoyB,EAAiBpyB,oBC5BpE,IAAIP,EAAc,EAAQ,MACtBghB,EAAc,EAAQ,MACtBlY,EAAW,EAAQ,MACnBC,EAAiB,EAAQ,MA+BzB4jB,EAAS7jB,GAAS,SAAS5E,EAAYgC,GACzC,GAAkB,MAAdhC,EACF,MAAO,GAET,IAAI1N,EAAS0P,EAAU1P,OAMvB,OALIA,EAAS,GAAKuS,EAAe7E,EAAYgC,EAAU,GAAIA,EAAU,IACnEA,EAAY,GACH1P,EAAS,GAAKuS,EAAe7C,EAAU,GAAIA,EAAU,GAAIA,EAAU,MAC5EA,EAAY,CAACA,EAAU,KAElB8a,EAAY9c,EAAYlE,EAAYkG,EAAW,GAAI,OAG5DvV,EAAOD,QAAUi8B,WCzBjBh8B,EAAOD,QAJP,WACE,MAAO,cCFTC,EAAOD,QAJP,WACE,OAAO,mBCdT,IAAImtB,EAAa,EAAQ,MACrBlZ,EAAS,EAAQ,MA8BrBhU,EAAOD,QAJP,SAAuBgC,GACrB,OAAOmrB,EAAWnrB,EAAOiS,EAAOjS,qBC5BlC,IAAIsU,EAAe,EAAQ,KA2B3BrW,EAAOD,QAJP,SAAkBgC,GAChB,OAAgB,MAATA,EAAgB,GAAKsU,EAAatU,iCCL3C,IAAYmtC,EA4GAC,EAmCAC,EAIAC,EAMAC,EAwBAC,EA2BAC,EA+HAC,EAmFAC,EAgEAC,EAgLAC,EA2BAC,EAaAC,EAiDAC,EAMAC,EAqDAC,EAcAC,EAwBAC,EAkEAC,EASAC,EAoFAC,EA0BAC,EAKAC,EAMAC,EA6BAC,EAqGAC,EAiCAC,EAyEAC,EA0EAC,EAuDAC,EAmEAC,EAeAC,EASAC,EA8CAC,EAwiBAC,EAMAC,EAyFAC,EA8DAC,EAOAC,EA8BAC,EAKAC,EAmOAC,EAMAC,EAuBAC,EC/+EA,EAKA,qPDPZ,SAAY3C,GACV,sCACA,oCACA,8CACA,0EACA,8DACA,oBANF,CAAYA,IAAAA,EAAkB,KA4G9B,SAAYC,GACV,wBACA,wBACA,4BACA,4BACA,gCACA,UACA,sBACA,wBACA,gBACA,kBACA,wBACA,gCAZF,CAAYA,IAAAA,EAAe,KAmC3B,SAAYC,GACV,UADF,CAAYA,IAAAA,EAAgB,KAI5B,SAAYC,GACV,kBACA,kBAFF,CAAYA,IAAAA,EAAU,KAMtB,SAAYC,GACV,qBACA,qBACA,2BAHF,CAAYA,IAAAA,EAAY,KAwBxB,SAAYC,GACV,sBACA,oBAFF,CAAYA,IAAAA,EAAa,KA2BzB,SAAYC,GACV,gBACA,oBACA,sBAHF,CAAYA,IAAAA,EAAU,KA+HtB,SAAYC,GACV,YADF,CAAYA,IAAAA,EAAQ,KAmFpB,SAAYC,GACV,wBACA,wBACA,gBACA,gBACA,gCACA,UACA,cACA,gBACA,wBATF,CAAYA,IAAAA,EAAkB,KAgE9B,SAAYC,GACV,wBACA,gBACA,oBACA,gCACA,UACA,gBACA,wBACA,kBARF,CAAYA,IAAAA,EAA8B,KAgL1C,SAAYC,GACV,YACA,cACA,gBACA,cAJF,CAAYA,IAAAA,EAAsB,KA2BlC,SAAYC,GACV,4BACA,UAFF,CAAYA,IAAAA,EAAqB,KAajC,SAAYC,GACV,gCACA,kDACA,sCACA,0DACA,0CACA,oCACA,wCACA,0CACA,gEACA,4CACA,4FACA,gDACA,kCACA,0EACA,0EACA,oDACA,4CACA,8BACA,8DACA,gCACA,wDACA,0CACA,gEACA,oCACA,kDACA,4DA1BF,CAAYA,IAAAA,EAAS,KAiDrB,SAAYC,GACV,gCACA,UAFF,CAAYA,IAAAA,EAAkB,KAM9B,SAAYC,GACV,+BACA,+BACA,+BACA,qCACA,qCACA,qCACA,yCACA,2CACA,+CACA,mCACA,mCACA,mCACA,6CACA,uCACA,6BACA,6BACA,6BACA,kEACA,kEACA,kEACA,kEACA,+CACA,6CACA,6CACA,4DACA,2DACA,wDACA,wDACA,6CA7BF,CAAYA,IAAAA,EAAY,KAqDxB,SAAYC,GACV,wBACA,4BACA,4BACA,gCACA,gCACA,4BACA,UACA,wBACA,gBACA,wBAVF,CAAYA,IAAAA,EAAiB,KAc7B,SAAYC,GACV,kBACA,YACA,wBAHF,CAAYA,IAAAA,EAAa,KAwBzB,SAAYC,GACV,oBACA,kBAFF,CAAYA,IAAAA,EAAW,KAkEvB,SAAYC,GACV,wBACA,sBACA,gCACA,UACA,kBALF,CAAYA,IAAAA,EAAc,KAS1B,SAAYC,GACV,kBACA,sBAFF,CAAYA,IAAAA,EAAU,KAoFtB,SAAYC,GACV,gCACA,UACA,sCAHF,CAAYA,IAAAA,EAAqB,KA0BjC,SAAYC,GACV,UADF,CAAYA,IAAAA,EAAgB,KAK5B,SAAYC,GACV,oBACA,0BAFF,CAAYA,IAAAA,EAAY,KAMxB,SAAYC,GACV,4BACA,4BACA,cAHF,CAAYA,IAAAA,EAAS,KA6BrB,SAAYC,GACV,oCACA,wCAFF,CAAYA,IAAAA,EAAkB,KAqG9B,SAAYC,GACV,wBACA,gCACA,UACA,wBACA,wBALF,CAAYA,IAAAA,EAA4B,KAiCxC,SAAYC,GACV,gBACA,wBAFF,CAAYA,IAAAA,EAAa,KAyEzB,SAAYC,GACV,wBACA,wBACA,4BACA,4BACA,gCACA,UACA,sBACA,wBACA,gBACA,kBACA,wBACA,gCAZF,CAAYA,IAAAA,EAAc,KA0E1B,SAAYC,GACV,8BACA,gCACA,UAHF,CAAYA,IAAAA,EAAe,KAuD3B,SAAYC,GACV,wBACA,4BACA,4BACA,gCACA,UACA,sCACA,gBACA,wBARF,CAAYA,IAAAA,EAAiB,KAmE7B,SAAYC,GACV,kBACA,sBACA,uBACA,qBACA,qBACA,uBANF,CAAYA,IAAAA,EAA4B,KAexC,SAAYC,GACV,wBACA,gCACA,UACA,kBACA,wBALF,CAAYA,IAAAA,EAAgC,KAS5C,SAAYC,GACV,kBACA,oBACA,kBAHF,CAAYA,IAAAA,EAA4B,KA8CxC,SAAYC,GACV,+BACA,+BAFF,CAAYA,IAAAA,EAAoB,KAwiBhC,SAAYC,GACV,YACA,cAFF,CAAYA,IAAAA,EAAa,KAMzB,SAAYC,GACV,2BACA,yBAFF,CAAYA,IAAAA,EAAS,KAyFrB,SAAYC,GACV,UACA,sBACA,wBAHF,CAAYA,IAAAA,EAA2B,KA8DvC,SAAYC,GACV,UACA,wBACA,0BAHF,CAAYA,IAAAA,EAA2B,KAOvC,SAAYC,GACV,kBACA,oBACA,sBACA,qBAJF,CAAYA,IAAAA,EAAkB,KA8B9B,SAAYC,GACV,YACA,gBAFF,CAAYA,IAAAA,EAAgB,KAK5B,SAAYC,GACV,2CACA,sCACA,uBAHF,CAAYA,IAAAA,EAAU,KAmOtB,SAAYC,GACV,wBACA,gCACA,UAHF,CAAYA,IAAAA,EAA0B,KAMtC,SAAYC,GACV,kBACA,gBAFF,CAAYA,IAAAA,EAAgB,KAuB5B,SAAYC,GACV,4BACA,4BACA,gCACA,4BACA,gCACA,8BACA,kCACA,wCARF,CAAYA,IAAAA,EAAiB,KC/+E7B,SAAY1B,GACV,oBACA,kBAFF,CAAY,MAAW,KAKvB,SAAYM,GACV,4BACA,4BACA,cAHF,CAAY,MAAS,KAkEd,IAAMqB,EAA0C,CACrDC,SAAS,EACTC,WAAW,EACXC,mBAAoB/C,EAAmBgD,SAqHzC,aAOE,WAAYC,GACV9wC,OAAO+9B,OAAO/+B,KAAM8xC,GAcxB,OAXE,YAAAC,uBAAA,WACE,OAAO/xC,KAAKgyC,cAAcrO,QAAO,SAACsO,GAAM,OAAAA,EAAElqC,SAAWopC,EAAmBe,WAG1E,YAAAC,gBAAA,WACE,OAAOnyC,KAAKgyC,cAAcrO,QAAO,SAACsO,GAAM,OAAAA,EAAElqC,SAAWopC,EAAmBiB,YAG1E,YAAAC,iCAAA,WACE,OAAOryC,KAAKsyC,wBAAwB3O,QAAO,SAACsO,GAAM,OAAAA,EAAElqC,SAAW8oC,EAA6BqB,WAEhG,EAtBA,GCpMIK,EAAgB,SAASC,EAAGC,GAI5B,OAHAF,EAAgBvxC,OAAO0xC,gBAClB,CAAEC,UAAW,cAAgBpwC,OAAS,SAAUiwC,EAAGC,GAAKD,EAAEG,UAAYF,IACvE,SAAUD,EAAGC,GAAK,IAAK,IAAIG,KAAKH,EAAOzxC,OAAOX,UAAU+F,eAAelF,KAAKuxC,EAAGG,KAAIJ,EAAEI,GAAKH,EAAEG,KACzFL,EAAcC,EAAGC,IAGrB,SAASI,EAAUL,EAAGC,GACzB,GAAiB,mBAANA,GAA0B,OAANA,EAC3B,MAAM,IAAIlxC,UAAU,uBAAyBF,OAAOoxC,GAAK,iCAE7D,SAASK,IAAO9yC,KAAK4I,YAAc4pC,EADnCD,EAAcC,EAAGC,GAEjBD,EAAEnyC,UAAkB,OAANoyC,EAAazxC,OAAO2H,OAAO8pC,IAAMK,EAAGzyC,UAAYoyC,EAAEpyC,UAAW,IAAIyyC,GAG5E,IAAIC,EAAW,WAQlB,OAPAA,EAAW/xC,OAAO+9B,QAAU,SAAkBiU,GAC1C,IAAK,IAAIC,EAAGxtC,EAAI,EAAGmQ,EAAI6H,UAAUjY,OAAQC,EAAImQ,EAAGnQ,IAE5C,IAAK,IAAImtC,KADTK,EAAIx1B,UAAUhY,GACOzE,OAAOX,UAAU+F,eAAelF,KAAK+xC,EAAGL,KAAII,EAAEJ,GAAKK,EAAEL,IAE9E,OAAOI,GAEJD,EAAS7lC,MAAMlN,KAAMyd,YAGzB,SAASy1B,GAAOD,EAAGxyC,GACtB,IAAIuyC,EAAI,GACR,IAAK,IAAIJ,KAAKK,EAAOjyC,OAAOX,UAAU+F,eAAelF,KAAK+xC,EAAGL,IAAMnyC,EAAEM,QAAQ6xC,GAAK,IAC9EI,EAAEJ,GAAKK,EAAEL,IACb,GAAS,MAALK,GAAqD,mBAAjCjyC,OAAOga,sBACtB,KAAIvV,EAAI,EAAb,IAAgBmtC,EAAI5xC,OAAOga,sBAAsBi4B,GAAIxtC,EAAImtC,EAAEptC,OAAQC,IAC3DhF,EAAEM,QAAQ6xC,EAAEntC,IAAM,GAAKzE,OAAOX,UAAUya,qBAAqB5Z,KAAK+xC,EAAGL,EAAEntC,MACvEutC,EAAEJ,EAAEntC,IAAMwtC,EAAEL,EAAEntC,KAE1B,OAAOutC,EAkBJ,SAASG,GAAU7sC,EAAS8sC,EAAYC,EAAGC,GAE9C,OAAO,IAAKD,IAAMA,EAAIvwC,WAAU,SAAUI,EAASH,GAC/C,SAASwwC,EAAU7xC,GAAS,IAAMu1B,EAAKqc,EAAUxxC,KAAKJ,IAAW,MAAOjB,GAAKsC,EAAOtC,IACpF,SAASwE,EAASvD,GAAS,IAAMu1B,EAAKqc,EAAiB,MAAE5xC,IAAW,MAAOjB,GAAKsC,EAAOtC,IACvF,SAASw2B,EAAK7zB,GAJlB,IAAe1B,EAIa0B,EAAOpB,KAAOkB,EAAQE,EAAO1B,QAJ1CA,EAIyD0B,EAAO1B,MAJhDA,aAAiB2xC,EAAI3xC,EAAQ,IAAI2xC,GAAE,SAAUnwC,GAAWA,EAAQxB,OAIT0D,KAAKmuC,EAAWtuC,GAClGgyB,GAAMqc,EAAYA,EAAUpmC,MAAM5G,EAAS8sC,GAAc,KAAKtxC,WAI/D,SAAS0xC,GAAYltC,EAAS1D,GACjC,IAAsG6wC,EAAGC,EAAGV,EAAGh5B,EAA3GsP,EAAI,CAAEqqB,MAAO,EAAGC,KAAM,WAAa,GAAW,EAAPZ,EAAE,GAAQ,MAAMA,EAAE,GAAI,OAAOA,EAAE,IAAOa,KAAM,GAAIC,IAAK,IAChG,OAAO95B,EAAI,CAAElY,KAAMiyC,EAAK,GAAI,MAASA,EAAK,GAAI,OAAUA,EAAK,IAAwB,mBAAXxzC,SAA0ByZ,EAAEzZ,OAAOsB,UAAY,WAAa,OAAO7B,OAAUga,EACvJ,SAAS+5B,EAAKn+B,GAAK,OAAO,SAAUo+B,GAAK,OACzC,SAAcC,GACV,GAAIR,EAAG,MAAM,IAAIlyC,UAAU,mCAC3B,KAAO+nB,OACH,GAAImqB,EAAI,EAAGC,IAAMV,EAAY,EAARiB,EAAG,GAASP,EAAU,OAAIO,EAAG,GAAKP,EAAS,SAAOV,EAAIU,EAAU,SAAMV,EAAE9xC,KAAKwyC,GAAI,GAAKA,EAAE5xC,SAAWkxC,EAAIA,EAAE9xC,KAAKwyC,EAAGO,EAAG,KAAKjyC,KAAM,OAAOgxC,EAE3J,OADIU,EAAI,EAAGV,IAAGiB,EAAK,CAAS,EAARA,EAAG,GAAQjB,EAAEtxC,QACzBuyC,EAAG,IACP,KAAK,EAAG,KAAK,EAAGjB,EAAIiB,EAAI,MACxB,KAAK,EAAc,OAAX3qB,EAAEqqB,QAAgB,CAAEjyC,MAAOuyC,EAAG,GAAIjyC,MAAM,GAChD,KAAK,EAAGsnB,EAAEqqB,QAASD,EAAIO,EAAG,GAAIA,EAAK,CAAC,GAAI,SACxC,KAAK,EAAGA,EAAK3qB,EAAEwqB,IAAIn3B,MAAO2M,EAAEuqB,KAAKl3B,MAAO,SACxC,QACI,MAAkBq2B,GAAZA,EAAI1pB,EAAEuqB,MAAYruC,OAAS,GAAKwtC,EAAEA,EAAExtC,OAAS,KAAkB,IAAVyuC,EAAG,IAAsB,IAAVA,EAAG,IAAW,CAAE3qB,EAAI,EAAG,SACjG,GAAc,IAAV2qB,EAAG,MAAcjB,GAAMiB,EAAG,GAAKjB,EAAE,IAAMiB,EAAG,GAAKjB,EAAE,IAAM,CAAE1pB,EAAEqqB,MAAQM,EAAG,GAAI,MAC9E,GAAc,IAAVA,EAAG,IAAY3qB,EAAEqqB,MAAQX,EAAE,GAAI,CAAE1pB,EAAEqqB,MAAQX,EAAE,GAAIA,EAAIiB,EAAI,MAC7D,GAAIjB,GAAK1pB,EAAEqqB,MAAQX,EAAE,GAAI,CAAE1pB,EAAEqqB,MAAQX,EAAE,GAAI1pB,EAAEwqB,IAAIttC,KAAKytC,GAAK,MACvDjB,EAAE,IAAI1pB,EAAEwqB,IAAIn3B,MAChB2M,EAAEuqB,KAAKl3B,MAAO,SAEtBs3B,EAAKrxC,EAAK1B,KAAKoF,EAASgjB,GAC1B,MAAO7oB,GAAKwzC,EAAK,CAAC,EAAGxzC,GAAIizC,EAAI,EAAK,QAAUD,EAAIT,EAAI,EACtD,GAAY,EAARiB,EAAG,GAAQ,MAAMA,EAAG,GAAI,MAAO,CAAEvyC,MAAOuyC,EAAG,GAAKA,EAAG,QAAK,EAAQjyC,MAAM,GArB9Bi1B,CAAK,CAACrhB,EAAGo+B,MAkFtD,SAASE,GAAcC,EAAIC,EAAMC,GACpC,GAAIA,GAA6B,IAArB52B,UAAUjY,OAAc,IAAK,IAA4B8uC,EAAxB7uC,EAAI,EAAG8uC,EAAIH,EAAK5uC,OAAYC,EAAI8uC,EAAG9uC,KACxE6uC,GAAQ7uC,KAAK2uC,IACRE,IAAIA,EAAK/xC,MAAMlC,UAAUyD,MAAM5C,KAAKkzC,EAAM,EAAG3uC,IAClD6uC,EAAG7uC,GAAK2uC,EAAK3uC,IAGrB,OAAO0uC,EAAGrR,OAAOwR,GAAM/xC,MAAMlC,UAAUyD,MAAM5C,KAAKkzC,IC3K/C,SAASI,GAAUC,EAAWhsC,GAGnC,IAFyBisC,QAAQD,GAG/B,MAAM,IAAIvvC,MACG,MAAXuD,EAAkBA,EAAU,mCDsGLzH,OAAO2H,OAsGX3H,OAAO2H,OEhNhC,MAAMgsC,GAAa,eASZ,SAASC,GAAYpjC,EAAQk2B,GAClC,IAAImN,EAAgB,EAChBvrC,EAAO,EAEX,IAAK,MAAMoV,KAASlN,EAAO5O,KAAKkyC,SAASH,IAAa,CAGpD,GAFuB,iBAAhBj2B,EAAMzT,OAAsBupC,IAAU,GAEzC91B,EAAMzT,OAASy8B,EACjB,MAGFmN,EAAgBn2B,EAAMzT,MAAQyT,EAAM,GAAGlZ,OACvC8D,GAAQ,EAGV,MAAO,CACLA,KAAAA,EACAyrC,OAAQrN,EAAW,EAAImN,GCZpB,SAASG,GAAoBxjC,EAAQyjC,GAC1C,MAAMC,EAAwB1jC,EAAO2jC,eAAeJ,OAAS,EACvDnyC,EAAO,GAAGunC,SAAS+K,GAAyB1jC,EAAO5O,KACnDwyC,EAAYH,EAAe3rC,KAAO,EAClC+rC,EAAa7jC,EAAO2jC,eAAe7rC,KAAO,EAC1CgsC,EAAUL,EAAe3rC,KAAO+rC,EAChCE,EAAuC,IAAxBN,EAAe3rC,KAAa4rC,EAAwB,EACnEM,EAAYP,EAAeF,OAASQ,EACpCE,EAAc,GAAGjkC,EAAOpQ,QAAQk0C,KAAWE,MAC3CE,EAAQ9yC,EAAK6E,MAAM,gBACnBkuC,EAAeD,EAAMN,GAE3B,GAAIO,EAAanwC,OAAS,IAAK,CAC7B,MAAMowC,EAAer4B,KAAKgN,MAAMirB,EAAY,IACtCK,EAAmBL,EAAY,GAC/BM,EAAW,GAEjB,IAAK,IAAIrwC,EAAI,EAAGA,EAAIkwC,EAAanwC,OAAQC,GAAK,GAC5CqwC,EAAStvC,KAAKmvC,EAAa7xC,MAAM2B,EAAGA,EAAI,KAG1C,OACEgwC,EACAM,GAAmB,CACjB,CAAC,GAAGT,MAAaQ,EAAS,OACvBA,EAAShyC,MAAM,EAAG8xC,EAAe,GAAGxzC,KAAK4zC,GAAY,CAAC,IAAKA,KAC9D,CAAC,IAAK,IAAI7L,SAAS0L,IACnB,CAAC,IAAKC,EAASF,EAAe,MAKpC,OACEH,EACAM,GAAmB,CAEjB,CAAIT,EAAU,EAAb,KAAoBI,EAAMN,EAAY,IACvC,CAAC,GAAGE,MAAaK,GACjB,CAAC,IAAK,IAAIxL,SAASqL,IACnB,CAAC,GAAGF,EAAU,MAAOI,EAAMN,EAAY,MAK7C,SAASW,GAAmBL,GAC1B,MAAMO,EAAgBP,EAAM/R,QAAO,EAAEra,EAAGhgB,UAAmBrH,IAATqH,IAC5C4sC,EAAS34B,KAAKC,OAAOy4B,EAAc7zC,KAAI,EAAE8qC,KAAYA,EAAO1nC,UAClE,OAAOywC,EACJ7zC,KAAI,EAAE8qC,EAAQ5jC,KAAU4jC,EAAO/C,SAAS+L,IAAW5sC,EAAO,IAAMA,EAAO,MACvE3D,KAAK,MC1CH,MAAMwwC,WAAqBjxC,MA0ChC0D,YACEH,EACA2tC,EACA5kC,EACA6kC,EACA9mC,EACA+mC,EACAC,GAEA,IAAIC,EAAaC,EAAiBC,EAElCC,MAAMluC,GACNzI,KAAKoB,KAAO,eACZpB,KAAKuP,KAAOA,MAAAA,EAAmCA,OAAOtN,EACtDjC,KAAKs2C,cACHA,MAAAA,EACIA,OACAr0C,EAENjC,KAAKo2C,MAAQQ,GACXr0C,MAAMC,QAAQ4zC,GAASA,EAAQA,EAAQ,CAACA,QAASn0C,GAEnD,MAAM40C,EAAgBD,GACW,QAA9BJ,EAAcx2C,KAAKo2C,aAAmC,IAAhBI,OACnC,EACAA,EAAYp0C,KAAK00C,GAASA,EAAKC,MAAKpT,QAAQoT,GAAe,MAAPA,KAG1D/2C,KAAKwR,OACHA,MAAAA,EACIA,EACAqlC,MAAAA,GAEyC,QAAxCJ,EAAkBI,EAAc,UACb,IAApBJ,OAFA,EAIAA,EAAgBjlC,OACtBxR,KAAKq2C,UACHA,MAAAA,EACIA,EACAQ,MAAAA,OACA,EACAA,EAAcz0C,KAAK20C,GAAQA,EAAIzhC,QACrCtV,KAAKg3C,UACHX,GAAa7kC,EACT6kC,EAAUj0C,KAAK60C,GAAQrC,GAAYpjC,EAAQylC,KAC3CJ,MAAAA,OACA,EACAA,EAAcz0C,KAAK20C,GAAQnC,GAAYmC,EAAIvlC,OAAQulC,EAAIzhC,SAC7D,MAAM4hC,EC5Ge,iBADIx1C,ED8GvB40C,MAAAA,OACI,EACAA,EAAcC,aC/GuB,OAAV70C,EDiH7B40C,MAAAA,OACE,EACAA,EAAcC,gBAChBt0C,ECrHD,IAAsBP,EDsHzB1B,KAAKu2C,WAI2B,QAH7BG,EACCH,MAAAA,EACIA,EACAW,SAAyC,IAATR,EAClCA,EACA11C,OAAO2H,OAAO,MAGpB3H,OAAOm2C,iBAAiBn3C,KAAM,CAC5ByI,QAAS,CACP2uC,UAAU,EACVC,YAAY,GAEdj2C,KAAM,CACJi2C,YAAY,GAEdjB,MAAO,CACLiB,YAAY,GAEd7lC,OAAQ,CACN6lC,YAAY,GAEdhB,UAAW,CACTgB,YAAY,GAEdf,cAAe,CACbe,YAAY,KAMdf,MAAAA,GAEAA,EAAc5tC,MAEd1H,OAAOuJ,eAAevK,KAAM,QAAS,CACnC0B,MAAO40C,EAAc5tC,MACrB0uC,UAAU,EACVE,cAAc,IAEPpyC,MAAMqyC,kBACfryC,MAAMqyC,kBAAkBv3C,KAAMm2C,IAE9Bn1C,OAAOuJ,eAAevK,KAAM,QAAS,CACnC0B,MAAOwD,QAAQwD,MACf0uC,UAAU,EACVE,cAAc,IAKRznC,IAAPtP,OAAOsP,eACV,MAAO,eAGT5O,WACE,IAAIu2C,EAASx3C,KAAKyI,QAElB,GAAIzI,KAAKo2C,MACP,IAAK,MAAMU,KAAQ92C,KAAKo2C,MAClBU,EAAKC,MACPS,GAAU,ODnLXxC,IADqBzsC,ECoLauuC,EAAKC,KDlLnCvlC,OACTojC,GAAYrsC,EAASiJ,OAAQjJ,EAAS+M,cCoL/B,GAAItV,KAAKwR,QAAUxR,KAAKg3C,UAC7B,IAAK,MAAMzuC,KAAYvI,KAAKg3C,UAC1BQ,GAAU,OAASxC,GAAoBh1C,KAAKwR,OAAQjJ,GDzLrD,IAAuBA,EC6L1B,OAAOivC,EAGT5I,SACE,MAAM6I,EAAiB,CACrBhvC,QAASzI,KAAKyI,SAehB,OAZsB,MAAlBzI,KAAKg3C,YACPS,EAAeT,UAAYh3C,KAAKg3C,WAGjB,MAAbh3C,KAAKuP,OACPkoC,EAAeloC,KAAOvP,KAAKuP,MAGN,MAAnBvP,KAAKu2C,YAAsBv1C,OAAOuF,KAAKvG,KAAKu2C,YAAY/wC,OAAS,IACnEiyC,EAAelB,WAAav2C,KAAKu2C,YAG5BkB,GAIX,SAASb,GAAiBzpC,GACxB,YAAiBlL,IAAVkL,GAAwC,IAAjBA,EAAM3H,YAAevD,EAAYkL,EErN1D,SAASuqC,GAAYlmC,EAAQk2B,EAAUiQ,GAC5C,OAAO,IAAIxB,GAAa,iBAAiBwB,SAAe11C,EAAWuP,EAAQ,CACzEk2B,ICLG,IAAI,GAOX,IAAWkQ,IAAAA,GA4CR,KAAS,GAAO,KA3CN,KAAI,OACfA,GAAe,SAAI,WACnBA,GAA2B,qBAAI,sBAC/BA,GAA0B,oBAAI,qBAC9BA,GAAoB,cAAI,eACxBA,GAAY,MAAI,QAChBA,GAAe,SAAI,WACnBA,GAAsB,gBAAI,iBAC1BA,GAAsB,gBAAI,iBAC1BA,GAA0B,oBAAI,qBAC9BA,GAAe,SAAI,WACnBA,GAAU,IAAI,WACdA,GAAY,MAAI,aAChBA,GAAa,OAAI,cACjBA,GAAc,QAAI,eAClBA,GAAW,KAAI,YACfA,GAAW,KAAI,YACfA,GAAW,KAAI,YACfA,GAAa,OAAI,cACjBA,GAAmB,aAAI,cACvBA,GAAgB,UAAI,YACpBA,GAAiB,WAAI,YACrBA,GAAgB,UAAI,WACpBA,GAAoB,cAAI,cACxBA,GAAwB,kBAAI,mBAC5BA,GAAgC,0BAAI,0BACpCA,GAA6B,uBAAI,uBACjCA,GAA6B,uBAAI,uBACjCA,GAAuB,iBAAI,kBAC3BA,GAA6B,uBAAI,uBACjCA,GAAgC,0BAAI,0BACpCA,GAA4B,sBAAI,sBAChCA,GAA2B,qBAAI,qBAC/BA,GAA4B,sBAAI,sBAChCA,GAAmC,6BAAI,4BACvCA,GAA2B,qBAAI,sBAC/BA,GAAuB,iBAAI,kBAC3BA,GAA4B,sBAAI,sBAChCA,GAA4B,sBAAI,sBAChCA,GAA+B,yBAAI,yBACnCA,GAA2B,qBAAI,qBAC/BA,GAA0B,oBAAI,oBAC9BA,GAAkC,4BAAI,2BCjDjC,MAAMC,GAoBXjvC,YAAYkvC,EAAYC,EAAUvmC,GAChCxR,KAAKsV,MAAQwiC,EAAWxiC,MACxBtV,KAAKgxB,IAAM+mB,EAAS/mB,IACpBhxB,KAAK83C,WAAaA,EAClB93C,KAAK+3C,SAAWA,EAChB/3C,KAAKwR,OAASA,EAGJ3B,IAAPtP,OAAOsP,eACV,MAAO,WAGT++B,SACE,MAAO,CACLt5B,MAAOtV,KAAKsV,MACZ0b,IAAKhxB,KAAKgxB,MAST,MAAMgnB,GAiCXpvC,YAAYqvC,EAAM3iC,EAAO0b,EAAK1nB,EAAMyrC,EAAQrzC,GAC1C1B,KAAKi4C,KAAOA,EACZj4C,KAAKsV,MAAQA,EACbtV,KAAKgxB,IAAMA,EACXhxB,KAAKsJ,KAAOA,EACZtJ,KAAK+0C,OAASA,EAEd/0C,KAAK0B,MAAQA,EACb1B,KAAKk4C,KAAO,KACZl4C,KAAK8B,KAAO,KAGF+N,IAAPtP,OAAOsP,eACV,MAAO,QAGT++B,SACE,MAAO,CACLqJ,KAAMj4C,KAAKi4C,KACXv2C,MAAO1B,KAAK0B,MACZ4H,KAAMtJ,KAAKsJ,KACXyrC,OAAQ/0C,KAAK+0C,SAWZ,MAAMoD,GAAoB,CAC/BC,KAAM,GACNC,SAAU,CAAC,eACXC,oBAAqB,CACnB,OACA,sBACA,aACA,gBAEFC,mBAAoB,CAAC,WAAY,OAAQ,eAAgB,cACzDC,SAAU,CAAC,QACXC,aAAc,CAAC,cACfC,MAAO,CAAC,QAAS,OAAQ,YAAa,aAAc,gBACpDC,SAAU,CAAC,OAAQ,SACnBC,eAAgB,CAAC,OAAQ,cACzBC,eAAgB,CAAC,gBAAiB,aAAc,gBAChDC,mBAAoB,CAClB,OACA,sBACA,gBACA,aACA,gBAEFC,SAAU,GACVC,WAAY,GACZC,YAAa,GACbC,aAAc,GACdC,UAAW,GACXC,UAAW,GACXC,UAAW,CAAC,UACZC,YAAa,CAAC,UACdC,YAAa,CAAC,OAAQ,SACtBC,UAAW,CAAC,OAAQ,aACpBC,UAAW,CAAC,QACZC,SAAU,CAAC,QACXC,YAAa,CAAC,QACdC,iBAAkB,CAAC,cAAe,aAAc,kBAChDC,wBAAyB,CAAC,QAC1BC,qBAAsB,CAAC,cAAe,OAAQ,cAC9CC,qBAAsB,CACpB,cACA,OACA,aACA,aACA,UAEFC,gBAAiB,CAAC,cAAe,OAAQ,YAAa,OAAQ,cAC9DC,qBAAsB,CACpB,cACA,OACA,OACA,eACA,cAEFC,wBAAyB,CACvB,cACA,OACA,aACA,aACA,UAEFC,oBAAqB,CAAC,cAAe,OAAQ,aAAc,SAC3DC,mBAAoB,CAAC,cAAe,OAAQ,aAAc,UAC1DC,oBAAqB,CAAC,cAAe,OAAQ,cAC7CC,0BAA2B,CAAC,cAAe,OAAQ,aAAc,UACjEC,oBAAqB,CAAC,cAAe,OAAQ,YAAa,aAC1DC,gBAAiB,CAAC,aAAc,kBAChCC,oBAAqB,CAAC,OAAQ,cAC9BC,oBAAqB,CAAC,OAAQ,aAAc,aAAc,UAC1DC,uBAAwB,CAAC,OAAQ,aAAc,aAAc,UAC7DC,mBAAoB,CAAC,OAAQ,aAAc,SAC3CC,kBAAmB,CAAC,OAAQ,aAAc,UAC1CC,yBAA0B,CAAC,OAAQ,aAAc,WAE7CC,GAAa,IAAI9uC,IAAIjL,OAAOuF,KAAK4xC,KAKhC,SAAS6C,GAAOC,GACrB,MAAMC,EACJD,MAAAA,OAA6C,EAASA,EAAUhD,KAClE,MAA4B,iBAAdiD,GAA0BH,GAAW50C,IAAI+0C,GAIlD,IAAIC,GCnMA,GAOX,IAAWC,GCLJ,SAASC,GAAQ35C,GACtB,OAAO45C,GAAY55C,EAAO,IAG5B,SAAS45C,GAAY55C,EAAO65C,GAC1B,cAAe75C,GACb,IAAK,SACH,OAAOsE,KAAKw1C,UAAU95C,GAExB,IAAK,WACH,OAAOA,EAAMN,KAAO,aAAaM,EAAMN,QAAU,aAEnD,IAAK,SACH,OAON,SAA2BM,EAAO+5C,GAChC,GAAc,OAAV/5C,EACF,MAAO,OAGT,GAAI+5C,EAAqBltB,SAAS7sB,GAChC,MAAO,aAGT,MAAM65C,EAAa,IAAIE,EAAsB/5C,GAE7C,GAeF,SAAoBA,GAClB,MAA+B,mBAAjBA,EAAMktC,OAhBhB8M,CAAWh6C,GAAQ,CACrB,MAAMi6C,EAAYj6C,EAAMktC,SAExB,GAAI+M,IAAcj6C,EAChB,MAA4B,iBAAdi6C,EACVA,EACAL,GAAYK,EAAWJ,QAExB,GAAIh5C,MAAMC,QAAQd,GACvB,OA2BJ,SAAqByL,EAAOouC,GAC1B,GAAqB,IAAjBpuC,EAAM3H,OACR,MAAO,KAGT,GAAI+1C,EAAW/1C,OA7EW,EA8ExB,MAAO,UAGT,MAAMo2C,EAAMr+B,KAAKsN,IAlFM,GAkFgB1d,EAAM3H,QACvC2Y,EAAYhR,EAAM3H,OAASo2C,EAC3Bh6C,EAAQ,GAEd,IAAK,IAAI6D,EAAI,EAAGA,EAAIm2C,IAAOn2C,EACzB7D,EAAM4E,KAAK80C,GAAYnuC,EAAM1H,GAAI81C,IASnC,OANkB,IAAdp9B,EACFvc,EAAM4E,KAAK,mBACF2X,EAAY,GACrBvc,EAAM4E,KAAK,OAAO2X,gBAGb,IAAMvc,EAAM+D,KAAK,MAAQ,IAlDvBk2C,CAAYn6C,EAAO65C,GAG5B,OAOF,SAAsBltC,EAAQktC,GAC5B,MAAM70C,EAAU1F,OAAO0F,QAAQ2H,GAE/B,GAAuB,IAAnB3H,EAAQlB,OACV,MAAO,KAGT,GAAI+1C,EAAW/1C,OA9DW,EA+DxB,MAAO,IAmCX,SAAsB6I,GACpB,MAAMiL,EAAMtY,OAAOX,UAAUY,SAC1BC,KAAKmN,GACL1G,QAAQ,aAAc,IACtBA,QAAQ,KAAM,IAEjB,GAAY,WAAR2R,GAAkD,mBAAvBjL,EAAOzF,YAA4B,CAChE,MAAMxH,EAAOiN,EAAOzF,YAAYxH,KAEhC,GAAoB,iBAATA,GAA8B,KAATA,EAC9B,OAAOA,EAIX,OAAOkY,EAjDQwiC,CAAaztC,GAAU,IAGtC,MAAM60B,EAAax8B,EAAQtE,KACzB,EAAEoH,EAAK9H,KAAW8H,EAAM,KAAO8xC,GAAY55C,EAAO65C,KAEpD,MAAO,KAAOrY,EAAWv9B,KAAK,MAAQ,KArB/Bo2C,CAAar6C,EAAO65C,GA9BhBS,CAAkBt6C,EAAO65C,GAElC,QACE,OAAOl6C,OAAOK,ICtBb,SAASu6C,GAAUxH,EAAWhsC,GAGnC,IAFyBisC,QAAQD,GAG/B,MAAM,IAAIvvC,MAAMuD,IHqMpB,SAAW0yC,GACTA,EAAyB,MAAI,QAC7BA,EAA4B,SAAI,WAChCA,EAAgC,aAAI,eAHtC,CAIGA,KAAsBA,GAAoB,MClMlCC,GAuBR,KAAc,GAAY,KAtBZ,IAAI,QACnBA,GAAe,IAAI,QACnBA,GAAgB,KAAI,IACpBA,GAAkB,OAAI,IACtBA,GAAe,IAAI,IACnBA,GAAmB,QAAI,IACvBA,GAAmB,QAAI,IACvBA,GAAkB,OAAI,MACtBA,GAAiB,MAAI,IACrBA,GAAkB,OAAI,IACtBA,GAAc,GAAI,IAClBA,GAAqB,UAAI,IACzBA,GAAqB,UAAI,IACzBA,GAAmB,QAAI,IACvBA,GAAgB,KAAI,IACpBA,GAAmB,QAAI,IACvBA,GAAgB,KAAI,OACpBA,GAAe,IAAI,MACnBA,GAAiB,MAAI,QACrBA,GAAkB,OAAI,SACtBA,GAAwB,aAAI,cAC5BA,GAAmB,QAAI,UGtBlB,MAAMc,GACXtzC,YACEhG,EACAxB,EAAO,kBACP+zC,EAAiB,CACf7rC,KAAM,EACNyrC,OAAQ,IAGM,iBAATnyC,GACLq5C,IAAU,EAAO,oCAAoCZ,GAAQz4C,OAC/D5C,KAAK4C,KAAOA,EACZ5C,KAAKoB,KAAOA,EACZpB,KAAKm1C,eAAiBA,EACtBn1C,KAAKm1C,eAAe7rC,KAAO,GACzB2yC,IACE,EACA,6DAEJj8C,KAAKm1C,eAAeJ,OAAS,GAC3BkH,IACE,EACA,+DAIMpsC,IAAPtP,OAAOsP,eACV,MAAO,UCnCJ,IAAIssC,GCKJ,SAASC,GAAuBC,GAErC,MAAM3G,EAAQ2G,EAAU50C,MAAM,gBAExB60C,EAoCD,SAAmC56C,GACxC,IAAI66C,EAEJ,IAAIC,GAAc,EACdC,GAAc,EACdC,EAAS,EACTJ,EAAe,KAEnB,IAAK,IAAI72C,EAAI,EAAGA,EAAI/D,EAAM8D,SAAUC,EAClC,OAAQ/D,EAAM+c,WAAWhZ,IACvB,KAAK,GAE6B,KAA5B/D,EAAM+c,WAAWhZ,EAAI,MACrBA,EAKN,KAAK,GAEH+2C,GAAc,EACdC,GAAc,EACdC,EAAS,EACT,MAEF,KAAK,EAEL,KAAK,KAEDA,EACF,MAEF,QAEID,IACCD,IACiB,OAAjBF,GAAyBI,EAASJ,KAEnCA,EAAeI,GAGjBD,GAAc,EAIpB,OAA0C,QAAlCF,EAAgBD,SAA4C,IAAlBC,EAC9CA,EACA,EAnFiBI,CAA0BN,GAE/C,GAAqB,IAAjBC,EACF,IAAK,IAAI72C,EAAI,EAAGA,EAAIiwC,EAAMlwC,OAAQC,IAChCiwC,EAAMjwC,GAAKiwC,EAAMjwC,GAAG3B,MAAMw4C,GAI9B,IAAIM,EAAY,EAEhB,KAAOA,EAAYlH,EAAMlwC,QAAUq3C,GAAQnH,EAAMkH,OAC7CA,EAGJ,IAAIE,EAAUpH,EAAMlwC,OAEpB,KAAOs3C,EAAUF,GAAaC,GAAQnH,EAAMoH,EAAU,OAClDA,EAGJ,OAAOpH,EAAM5xC,MAAM84C,EAAWE,GAASn3C,KAAK,MAG9C,SAASk3C,GAAQE,GACf,IAAK,MAAMC,KAAQD,EACjB,GAAa,MAATC,GAAyB,OAATA,EAClB,OAAO,EAIX,OAAO,ECnCF,SAASC,GAAQC,GACtB,OAAOA,GAAQ,IAAUA,GAAQ,GAa5B,SAASC,GAASD,GACvB,OACGA,GAAQ,IAAUA,GAAQ,KAC1BA,GAAQ,IAAUA,GAAQ,GAYxB,SAASE,GAAYF,GAC1B,OAAOC,GAASD,IAAkB,KAATA,GF3B3B,SAAWf,GACTA,EAAyB,MAAI,QAC7BA,EAA4B,SAAI,WAChCA,EAAgC,aAAI,eACpCA,EAAyB,MAAI,QAC7BA,EAAuC,oBAAI,sBAC3CA,EAAmC,gBAAI,kBACvCA,EAAmC,gBAAI,kBACvCA,EAAuC,oBAAI,sBAC3CA,EAA0B,OAAI,SAC9BA,EAA0B,OAAI,SAC9BA,EAA0B,OAAI,SAC9BA,EAAoC,iBAAI,mBACxCA,EAAuC,oBAAI,sBAC3CA,EAA6B,UAAI,YACjCA,EAAyB,MAAI,QAC7BA,EAAwB,KAAI,OAC5BA,EAA8B,WAAI,aAClCA,EAAgC,aAAI,eACpCA,EAA0C,uBAAI,yBAnBhD,CAoBGA,KAAsBA,GAAoB,KGhBtC,MAAMkB,GAgBXz0C,YAAY4I,GACV,MAAM8rC,EAAmB,IAAItF,GAAM,OAAe,EAAG,EAAG,EAAG,GAC3Dh4C,KAAKwR,OAASA,EACdxR,KAAKu9C,UAAYD,EACjBt9C,KAAKw9C,MAAQF,EACbt9C,KAAKsJ,KAAO,EACZtJ,KAAKy9C,UAAY,EAGP5tC,IAAPtP,OAAOsP,eACV,MAAO,QAMT6tC,UAGE,OAFA19C,KAAKu9C,UAAYv9C,KAAKw9C,MACPx9C,KAAKw9C,MAAQx9C,KAAK29C,YAQnCA,YACE,IAAIH,EAAQx9C,KAAKw9C,MAEjB,GAAIA,EAAMvF,OAAS,OACjB,GACE,GAAIuF,EAAM17C,KACR07C,EAAQA,EAAM17C,SACT,CAEL,MAAM87C,EAAYC,GAAc79C,KAAMw9C,EAAMxsB,KAE5CwsB,EAAM17C,KAAO87C,EAEbA,EAAU1F,KAAOsF,EACjBA,EAAQI,SAEHJ,EAAMvF,OAAS,YAG1B,OAAOuF,GAkCX,SAASM,GAAqBZ,GAC5B,OACGA,GAAQ,GAAUA,GAAQ,OAAYA,GAAQ,OAAUA,GAAQ,QAYrE,SAASa,GAAyBn7C,EAAM2F,GACtC,OACEy1C,GAAmBp7C,EAAK6b,WAAWlW,KACnC01C,GAAoBr7C,EAAK6b,WAAWlW,EAAW,IAInD,SAASy1C,GAAmBd,GAC1B,OAAOA,GAAQ,OAAUA,GAAQ,MAGnC,SAASe,GAAoBf,GAC3B,OAAOA,GAAQ,OAAUA,GAAQ,MAUnC,SAASgB,GAAiBC,EAAO51C,GAC/B,MAAM20C,EAAOiB,EAAM3sC,OAAO5O,KAAKw7C,YAAY71C,GAE3C,QAAatG,IAATi7C,EACF,OAAO,OACF,GAAIA,GAAQ,IAAUA,GAAQ,IAAQ,CAE3C,MAAMF,EAAO37C,OAAOg9C,cAAcnB,GAClC,MAAgB,MAATF,EAAe,OAAS,IAAIA,KAGrC,MAAO,KAAOE,EAAKj8C,SAAS,IAAIoG,cAAc8iC,SAAS,EAAG,KAM5D,SAASmU,GAAYH,EAAOlG,EAAM3iC,EAAO0b,EAAKtvB,GAC5C,MAAM4H,EAAO60C,EAAM70C,KACbi1C,EAAM,EAAIjpC,EAAQ6oC,EAAMV,UAC9B,OAAO,IAAIzF,GAAMC,EAAM3iC,EAAO0b,EAAK1nB,EAAMi1C,EAAK78C,GAUhD,SAASm8C,GAAcM,EAAO7oC,GAC5B,MAAM1S,EAAOu7C,EAAM3sC,OAAO5O,KACpB47C,EAAa57C,EAAK4C,OACxB,IAAIkiC,EAAWpyB,EAEf,KAAOoyB,EAAW8W,GAAY,CAC5B,MAAMtB,EAAOt6C,EAAK6b,WAAWipB,GAE7B,OAAQwV,GAeN,KAAK,MAEL,KAAK,EAEL,KAAK,GAEL,KAAK,KAEDxV,EACF,SAMF,KAAK,KAEDA,IACAyW,EAAM70C,KACR60C,EAAMV,UAAY/V,EAClB,SAEF,KAAK,GAEmC,KAAlC9kC,EAAK6b,WAAWipB,EAAW,GAC7BA,GAAY,IAEVA,IAGFyW,EAAM70C,KACR60C,EAAMV,UAAY/V,EAClB,SAGF,KAAK,GAEH,OAAO+W,GAAYN,EAAOzW,GAU5B,KAAK,GAEH,OAAO4W,GAAYH,EAAO,QAAgBzW,EAAUA,EAAW,GAEjE,KAAK,GAEH,OAAO4W,GAAYH,EAAO,UAAkBzW,EAAUA,EAAW,GAEnE,KAAK,GAEH,OAAO4W,GAAYH,EAAO,OAAezW,EAAUA,EAAW,GAEhE,KAAK,GAEH,OAAO4W,GAAYH,EAAO,WAAmBzW,EAAUA,EAAW,GAEpE,KAAK,GAEH,OAAO4W,GAAYH,EAAO,WAAmBzW,EAAUA,EAAW,GAEpE,KAAK,GAEH,GACoC,KAAlC9kC,EAAK6b,WAAWipB,EAAW,IACO,KAAlC9kC,EAAK6b,WAAWipB,EAAW,GAE3B,OAAO4W,GAAYH,EAAO,UAAkBzW,EAAUA,EAAW,GAGnE,MAEF,KAAK,GAEH,OAAO4W,GAAYH,EAAO,SAAiBzW,EAAUA,EAAW,GAElE,KAAK,GAEH,OAAO4W,GAAYH,EAAO,UAAkBzW,EAAUA,EAAW,GAEnE,KAAK,GAEH,OAAO4W,GAAYH,EAAO,MAAczW,EAAUA,EAAW,GAE/D,KAAK,GAEH,OAAO4W,GAAYH,EAAO,aAAqBzW,EAAUA,EAAW,GAEtE,KAAK,GAEH,OAAO4W,GAAYH,EAAO,aAAqBzW,EAAUA,EAAW,GAEtE,KAAK,IAEH,OAAO4W,GAAYH,EAAO,WAAmBzW,EAAUA,EAAW,GAEpE,KAAK,IAEH,OAAO4W,GAAYH,EAAO,QAAgBzW,EAAUA,EAAW,GAEjE,KAAK,IAEH,OAAO4W,GAAYH,EAAO,WAAmBzW,EAAUA,EAAW,GAGpE,KAAK,GAEH,OACoC,KAAlC9kC,EAAK6b,WAAWipB,EAAW,IACO,KAAlC9kC,EAAK6b,WAAWipB,EAAW,GAEpBgX,GAAgBP,EAAOzW,GAGzBiX,GAAWR,EAAOzW,GAG7B,GAAIuV,GAAQC,IAAkB,KAATA,EACnB,OAAO0B,GAAWT,EAAOzW,EAAUwV,GAGrC,GAAIE,GAAYF,GACd,OAAO2B,GAASV,EAAOzW,GAGzB,MAAMgQ,GACJyG,EAAM3sC,OACNk2B,EACS,KAATwV,EACI,kFACAY,GAAqBZ,IAASa,GAAyBn7C,EAAM8kC,GAC7D,yBAAyBwW,GAAiBC,EAAOzW,MACjD,sBAAsBwW,GAAiBC,EAAOzW,OAItD,OAAO4W,GAAYH,EAAO,OAAeK,EAAYA,GAYvD,SAASC,GAAYN,EAAO7oC,GAC1B,MAAM1S,EAAOu7C,EAAM3sC,OAAO5O,KACpB47C,EAAa57C,EAAK4C,OACxB,IAAIkiC,EAAWpyB,EAAQ,EAEvB,KAAOoyB,EAAW8W,GAAY,CAC5B,MAAMtB,EAAOt6C,EAAK6b,WAAWipB,GAE7B,GAAa,KAATwV,GAA4B,KAATA,EACrB,MAGF,GAAIY,GAAqBZ,KACrBxV,MACG,KAAIqW,GAAyBn7C,EAAM8kC,GAGxC,MAFAA,GAAY,GAMhB,OAAO4W,GACLH,EACA,WACA7oC,EACAoyB,EACA9kC,EAAKkB,MAAMwR,EAAQ,EAAGoyB,IAiC1B,SAASkX,GAAWT,EAAO7oC,EAAOwpC,GAChC,MAAMl8C,EAAOu7C,EAAM3sC,OAAO5O,KAC1B,IAAI8kC,EAAWpyB,EACX4nC,EAAO4B,EACPC,GAAU,EAMd,GAJa,KAAT7B,IACFA,EAAOt6C,EAAK6b,aAAaipB,IAGd,KAATwV,GAGF,GAFAA,EAAOt6C,EAAK6b,aAAaipB,GAErBuV,GAAQC,GACV,MAAMxF,GACJyG,EAAM3sC,OACNk2B,EACA,6CAA6CwW,GAC3CC,EACAzW,YAKNA,EAAWsX,GAAWb,EAAOzW,EAAUwV,GACvCA,EAAOt6C,EAAK6b,WAAWipB,GAsBzB,GAnBa,KAATwV,IACF6B,GAAU,EACV7B,EAAOt6C,EAAK6b,aAAaipB,GACzBA,EAAWsX,GAAWb,EAAOzW,EAAUwV,GACvCA,EAAOt6C,EAAK6b,WAAWipB,IAGZ,KAATwV,GAA4B,MAATA,IACrB6B,GAAU,EACV7B,EAAOt6C,EAAK6b,aAAaipB,GAEZ,KAATwV,GAA4B,KAATA,IACrBA,EAAOt6C,EAAK6b,aAAaipB,IAG3BA,EAAWsX,GAAWb,EAAOzW,EAAUwV,GACvCA,EAAOt6C,EAAK6b,WAAWipB,IAGZ,KAATwV,GAAmBE,GAAYF,GACjC,MAAMxF,GACJyG,EAAM3sC,OACNk2B,EACA,2CAA2CwW,GACzCC,EACAzW,OAKN,OAAO4W,GACLH,EACAY,EAAU,SAAkB,OAC5BzpC,EACAoyB,EACA9kC,EAAKkB,MAAMwR,EAAOoyB,IAOtB,SAASsX,GAAWb,EAAO7oC,EAAOwpC,GAChC,IAAK7B,GAAQ6B,GACX,MAAMpH,GACJyG,EAAM3sC,OACN8D,EACA,2CAA2C4oC,GACzCC,EACA7oC,OAKN,MAAM1S,EAAOu7C,EAAM3sC,OAAO5O,KAC1B,IAAI8kC,EAAWpyB,EAAQ,EAEvB,KAAO2nC,GAAQr6C,EAAK6b,WAAWipB,OAC3BA,EAGJ,OAAOA,EAuBT,SAASiX,GAAWR,EAAO7oC,GACzB,MAAM1S,EAAOu7C,EAAM3sC,OAAO5O,KACpB47C,EAAa57C,EAAK4C,OACxB,IAAIkiC,EAAWpyB,EAAQ,EACnB2pC,EAAavX,EACbhmC,EAAQ,GAEZ,KAAOgmC,EAAW8W,GAAY,CAC5B,MAAMtB,EAAOt6C,EAAK6b,WAAWipB,GAE7B,GAAa,KAATwV,EAEF,OADAx7C,GAASkB,EAAKkB,MAAMm7C,EAAYvX,GACzB4W,GAAYH,EAAO,UAAkB7oC,EAAOoyB,EAAW,EAAGhmC,GAGnE,GAAa,KAATw7C,EAAJ,CAcA,GAAa,KAATA,GAA4B,KAATA,EACrB,MAGF,GAAIY,GAAqBZ,KACrBxV,MACG,KAAIqW,GAAyBn7C,EAAM8kC,GAGxC,MAAMgQ,GACJyG,EAAM3sC,OACNk2B,EACA,oCAAoCwW,GAClCC,EACAzW,OAPJA,GAAY,OArBd,CACEhmC,GAASkB,EAAKkB,MAAMm7C,EAAYvX,GAChC,MAAMC,EAC8B,MAAlC/kC,EAAK6b,WAAWipB,EAAW,GACW,MAAlC9kC,EAAK6b,WAAWipB,EAAW,GACzBwX,GAAgCf,EAAOzW,GACvCyX,GAA6BhB,EAAOzW,GACtC0X,GAAqBjB,EAAOzW,GAClChmC,GAASimC,EAAOjmC,MAChBgmC,GAAYC,EAAO76B,KACnBmyC,EAAavX,GAwBjB,MAAMgQ,GAAYyG,EAAM3sC,OAAQk2B,EAAU,wBAG5C,SAASwX,GAAgCf,EAAOzW,GAC9C,MAAM9kC,EAAOu7C,EAAM3sC,OAAO5O,KAC1B,IAAIy8C,EAAQ,EACRvyC,EAAO,EAEX,KAAOA,EAAO,IAAI,CAChB,MAAMowC,EAAOt6C,EAAK6b,WAAWipB,EAAW56B,KAExC,GAAa,MAATowC,EAAiB,CAEnB,GAAIpwC,EAAO,IAAMgxC,GAAqBuB,GACpC,MAGF,MAAO,CACL39C,MAAOL,OAAOg9C,cAAcgB,GAC5BvyC,KAAAA,GAMJ,GAFAuyC,EAASA,GAAS,EAAKC,GAAapC,GAEhCmC,EAAQ,EACV,MAIJ,MAAM3H,GACJyG,EAAM3sC,OACNk2B,EACA,qCAAqC9kC,EAAKkB,MACxC4jC,EACAA,EAAW56B,QAKjB,SAASqyC,GAA6BhB,EAAOzW,GAC3C,MAAM9kC,EAAOu7C,EAAM3sC,OAAO5O,KACpBs6C,EAAOqC,GAAiB38C,EAAM8kC,EAAW,GAE/C,GAAIoW,GAAqBZ,GACvB,MAAO,CACLx7C,MAAOL,OAAOg9C,cAAcnB,GAC5BpwC,KAAM,GAKV,GAAIkxC,GAAmBd,IAGe,KAAlCt6C,EAAK6b,WAAWipB,EAAW,IACO,MAAlC9kC,EAAK6b,WAAWipB,EAAW,GAC3B,CACA,MAAM8X,EAAeD,GAAiB38C,EAAM8kC,EAAW,GAEvD,GAAIuW,GAAoBuB,GAOtB,MAAO,CACL99C,MAAOL,OAAOg9C,cAAcnB,EAAMsC,GAClC1yC,KAAM,IAMd,MAAM4qC,GACJyG,EAAM3sC,OACNk2B,EACA,qCAAqC9kC,EAAKkB,MAAM4jC,EAAUA,EAAW,QAWzE,SAAS6X,GAAiB38C,EAAM8kC,GAG9B,OACG4X,GAAa18C,EAAK6b,WAAWipB,KAAc,GAC3C4X,GAAa18C,EAAK6b,WAAWipB,EAAW,KAAO,EAC/C4X,GAAa18C,EAAK6b,WAAWipB,EAAW,KAAO,EAChD4X,GAAa18C,EAAK6b,WAAWipB,EAAW,IAkB5C,SAAS4X,GAAapC,GACpB,OAAOA,GAAQ,IAAUA,GAAQ,GAC7BA,EAAO,GACPA,GAAQ,IAAUA,GAAQ,GAC1BA,EAAO,GACPA,GAAQ,IAAUA,GAAQ,IAC1BA,EAAO,IACN,EAeP,SAASkC,GAAqBjB,EAAOzW,GACnC,MAAM9kC,EAAOu7C,EAAM3sC,OAAO5O,KAG1B,OAFaA,EAAK6b,WAAWipB,EAAW,IAGtC,KAAK,GAEH,MAAO,CACLhmC,MAAO,IACPoL,KAAM,GAGV,KAAK,GAEH,MAAO,CACLpL,MAAO,KACPoL,KAAM,GAGV,KAAK,GAEH,MAAO,CACLpL,MAAO,IACPoL,KAAM,GAGV,KAAK,GAEH,MAAO,CACLpL,MAAO,KACPoL,KAAM,GAGV,KAAK,IAEH,MAAO,CACLpL,MAAO,KACPoL,KAAM,GAGV,KAAK,IAEH,MAAO,CACLpL,MAAO,KACPoL,KAAM,GAGV,KAAK,IAEH,MAAO,CACLpL,MAAO,KACPoL,KAAM,GAGV,KAAK,IAEH,MAAO,CACLpL,MAAO,KACPoL,KAAM,GAIZ,MAAM4qC,GACJyG,EAAM3sC,OACNk2B,EACA,uCAAuC9kC,EAAKkB,MAC1C4jC,EACAA,EAAW,QAiBjB,SAASgX,GAAgBP,EAAO7oC,GAC9B,MAAM1S,EAAOu7C,EAAM3sC,OAAO5O,KACpB47C,EAAa57C,EAAK4C,OAClBo3C,EAAYuB,EAAM70C,KAClBm2C,EAAc,EAAInqC,EAAQ6oC,EAAMV,UACtC,IAAI/V,EAAWpyB,EAAQ,EACnB2pC,EAAavX,EACbgY,EAAW,GAEf,KAAOhY,EAAW8W,GAAY,CAC5B,MAAMtB,EAAOt6C,EAAK6b,WAAWipB,GAE7B,GACW,KAATwV,GACkC,KAAlCt6C,EAAK6b,WAAWipB,EAAW,IACO,KAAlC9kC,EAAK6b,WAAWipB,EAAW,GAG3B,OADAgY,GAAY98C,EAAKkB,MAAMm7C,EAAYvX,GAC5B,IAAIsQ,GACT,gBACA1iC,EACAoyB,EAAW,EACXkV,EACA6C,EACArD,GAAuBsD,IAI3B,GACW,KAATxC,GACkC,KAAlCt6C,EAAK6b,WAAWipB,EAAW,IACO,KAAlC9kC,EAAK6b,WAAWipB,EAAW,IACO,KAAlC9kC,EAAK6b,WAAWipB,EAAW,GAQ7B,GAAa,KAATwV,GAA4B,KAATA,EAYvB,GAAIY,GAAqBZ,KACrBxV,MACG,KAAIqW,GAAyBn7C,EAAM8kC,GAGxC,MAAMgQ,GACJyG,EAAM3sC,OACNk2B,EACA,oCAAoCwW,GAClCC,EACAzW,OAPJA,GAAY,OAdC,KAATwV,GAAqD,KAAlCt6C,EAAK6b,WAAWipB,EAAW,GAChDA,GAAY,IAEVA,IAGFyW,EAAM70C,KACR60C,EAAMV,UAAY/V,OAdlBgY,GAAY98C,EAAKkB,MAAMm7C,EAAYvX,GAAY,MAC/CA,GAAY,EACZuX,EAAavX,EAgCjB,MAAMgQ,GAAYyG,EAAM3sC,OAAQk2B,EAAU,wBAW5C,SAASmX,GAASV,EAAO7oC,GACvB,MAAM1S,EAAOu7C,EAAM3sC,OAAO5O,KACpB47C,EAAa57C,EAAK4C,OACxB,IAAIkiC,EAAWpyB,EAAQ,EAEvB,KAAOoyB,EAAW8W,ID1zBXrB,GADsBD,EC4zBdt6C,EAAK6b,WAAWipB,KD3zBNuV,GAAQC,IAAkB,KAATA,MC8zBpCxV,ED/zBD,IAAwBwV,ECq0B7B,OAAOoB,GACLH,EACA,QACA7oC,EACAoyB,EACA9kC,EAAKkB,MAAMwR,EAAOoyB,IC5yBf,MAAMiY,GACX/2C,YAAY4I,EAAQ1K,GAClB,MAAM84C,ELlCH,SAAkBpuC,GACvB,OAAkBA,aAAQ0qC,GKiCN2D,CAASruC,GAAUA,EAAS,IAAI0qC,GAAO1qC,GACzDxR,KAAK8/C,OAAS,IAAIzC,GAAMuC,GACxB5/C,KAAK+/C,SAAWj5C,EAMlBk5C,YACE,MAAMxC,EAAQx9C,KAAKigD,YAAY,SAC/B,OAAOjgD,KAAK82C,KAAK0G,EAAO,CACtBvF,KAAM,QACNv2C,MAAO87C,EAAM97C,QAQjBw+C,gBACE,OAAOlgD,KAAK82C,KAAK92C,KAAK8/C,OAAOtC,MAAO,CAClCvF,KAAM,YACNkI,YAAangD,KAAKogD,KAChB,OACApgD,KAAKqgD,gBACL,UA4BNA,kBACE,GAAIrgD,KAAKsgD,KAAK,YACZ,OAAOtgD,KAAKugD,2BAGd,MAAMC,EAAiBxgD,KAAKygD,kBACtBC,EAAeF,EACjBxgD,KAAK8/C,OAAOnC,YACZ39C,KAAK8/C,OAAOtC,MAEhB,GAAIkD,EAAazI,OAAS,QAAgB,CACxC,OAAQyI,EAAah/C,OACnB,IAAK,SACH,OAAO1B,KAAK2gD,wBAEd,IAAK,SACH,OAAO3gD,KAAK4gD,4BAEd,IAAK,OACH,OAAO5gD,KAAK6gD,4BAEd,IAAK,YACH,OAAO7gD,KAAK8gD,+BAEd,IAAK,QACH,OAAO9gD,KAAK+gD,2BAEd,IAAK,OACH,OAAO/gD,KAAKghD,0BAEd,IAAK,QACH,OAAOhhD,KAAKihD,iCAEd,IAAK,YACH,OAAOjhD,KAAKkhD,2BAGhB,GAAIV,EACF,MAAM9I,GACJ13C,KAAK8/C,OAAOtuC,OACZxR,KAAK8/C,OAAOtC,MAAMloC,MAClB,gFAIJ,OAAQorC,EAAah/C,OACnB,IAAK,QACL,IAAK,WACL,IAAK,eACH,OAAO1B,KAAKugD,2BAEd,IAAK,WACH,OAAOvgD,KAAKmhD,0BAEd,IAAK,SACH,OAAOnhD,KAAKohD,4BAIlB,MAAMphD,KAAKqhD,WAAWX,GASxBH,2BACE,MAAMjrC,EAAQtV,KAAK8/C,OAAOtC,MAE1B,GAAIx9C,KAAKsgD,KAAK,YACZ,OAAOtgD,KAAK82C,KAAKxhC,EAAO,CACtB2iC,KAAM,wBACNqJ,UAAWnG,GAAkBoG,MAC7BngD,UAAMa,EACNu/C,oBAAqB,GACrBC,WAAY,GACZC,aAAc1hD,KAAK2hD,sBAIvB,MAAML,EAAYthD,KAAK4hD,qBACvB,IAAIxgD,EAMJ,OAJIpB,KAAKsgD,KAAK,WACZl/C,EAAOpB,KAAKggD,aAGPhgD,KAAK82C,KAAKxhC,EAAO,CACtB2iC,KAAM,wBACNqJ,UAAAA,EACAlgD,KAAAA,EACAogD,oBAAqBxhD,KAAK6hD,2BAC1BJ,WAAYzhD,KAAK8hD,iBAAgB,GACjCJ,aAAc1hD,KAAK2hD,sBAOvBC,qBACE,MAAMG,EAAiB/hD,KAAKigD,YAAY,SAExC,OAAQ8B,EAAergD,OACrB,IAAK,QACH,OAAOy5C,GAAkBoG,MAE3B,IAAK,WACH,OAAOpG,GAAkB6G,SAE3B,IAAK,eACH,OAAO7G,GAAkB8G,aAG7B,MAAMjiD,KAAKqhD,WAAWU,GAMxBF,2BACE,OAAO7hD,KAAKkiD,aACV,WACAliD,KAAKmiD,wBACL,YAOJA,0BACE,OAAOniD,KAAK82C,KAAK92C,KAAK8/C,OAAOtC,MAAO,CAClCvF,KAAM,uBACN7L,SAAUpsC,KAAKoiD,gBACfp9C,MAAOhF,KAAKigD,YAAY,UAAkBjgD,KAAKqiD,sBAC/CvjC,aAAc9e,KAAKsiD,oBAAoB,WACnCtiD,KAAKuiD,8BACLtgD,EACJw/C,WAAYzhD,KAAKwiD,yBAOrBJ,gBACE,MAAM9sC,EAAQtV,KAAK8/C,OAAOtC,MAE1B,OADAx9C,KAAKigD,YAAY,WACVjgD,KAAK82C,KAAKxhC,EAAO,CACtB2iC,KAAM,YACN72C,KAAMpB,KAAKggD,cASf2B,oBACE,OAAO3hD,KAAK82C,KAAK92C,KAAK8/C,OAAOtC,MAAO,CAClCvF,KAAM,iBACNwK,WAAYziD,KAAKogD,KACf,WACApgD,KAAK0iD,eACL,cAWNA,iBACE,OAAO1iD,KAAKsgD,KAAK,WACbtgD,KAAK2iD,gBACL3iD,KAAK4iD,aAQXA,aACE,MAAMttC,EAAQtV,KAAK8/C,OAAOtC,MACpBqF,EAAc7iD,KAAKggD,YACzB,IAAI8C,EACA1hD,EASJ,OAPIpB,KAAKsiD,oBAAoB,WAC3BQ,EAAQD,EACRzhD,EAAOpB,KAAKggD,aAEZ5+C,EAAOyhD,EAGF7iD,KAAK82C,KAAKxhC,EAAO,CACtB2iC,KAAM,SACN6K,MAAAA,EACA1hD,KAAAA,EACAqc,UAAWzd,KAAK+iD,gBAAe,GAC/BtB,WAAYzhD,KAAK8hD,iBAAgB,GACjCJ,aAAc1hD,KAAKsgD,KAAK,YACpBtgD,KAAK2hD,yBACL1/C,IAOR8gD,eAAeC,GACb,MAAMC,EAAOD,EAAUhjD,KAAKkjD,mBAAqBljD,KAAKmjD,cACtD,OAAOnjD,KAAKkiD,aAAa,WAAmBe,EAAM,YAMpDE,cAAcH,GAAU,GACtB,MAAM1tC,EAAQtV,KAAK8/C,OAAOtC,MACpBp8C,EAAOpB,KAAKggD,YAElB,OADAhgD,KAAKigD,YAAY,UACVjgD,KAAK82C,KAAKxhC,EAAO,CACtB2iC,KAAM,YACN72C,KAAAA,EACAM,MAAO1B,KAAKojD,kBAAkBJ,KAIlCE,qBACE,OAAOljD,KAAKmjD,eAAc,GAW5BR,gBACE,MAAMrtC,EAAQtV,KAAK8/C,OAAOtC,MAC1Bx9C,KAAKigD,YAAY,WACjB,MAAMoD,EAAmBrjD,KAAKsjD,sBAAsB,MAEpD,OAAKD,GAAoBrjD,KAAKsgD,KAAK,SAC1BtgD,KAAK82C,KAAKxhC,EAAO,CACtB2iC,KAAM,mBACN72C,KAAMpB,KAAKujD,oBACX9B,WAAYzhD,KAAK8hD,iBAAgB,KAI9B9hD,KAAK82C,KAAKxhC,EAAO,CACtB2iC,KAAM,mBACNuL,cAAeH,EAAmBrjD,KAAKyjD,sBAAmBxhD,EAC1Dw/C,WAAYzhD,KAAK8hD,iBAAgB,GACjCJ,aAAc1hD,KAAK2hD,sBAUvBR,0BACE,IAAIuC,EAEJ,MAAMpuC,EAAQtV,KAAK8/C,OAAOtC,MAK1B,OAJAx9C,KAAK2jD,cAAc,aAOoC,KAFf,QAApCD,EAAiB1jD,KAAK+/C,gBAAyC,IAAnB2D,OAC1C,EACAA,EAAeE,8BAEZ5jD,KAAK82C,KAAKxhC,EAAO,CACtB2iC,KAAM,uBACN72C,KAAMpB,KAAKujD,oBACX/B,oBAAqBxhD,KAAK6hD,2BAC1B2B,eAAgBxjD,KAAK2jD,cAAc,MAAO3jD,KAAKyjD,kBAC/ChC,WAAYzhD,KAAK8hD,iBAAgB,GACjCJ,aAAc1hD,KAAK2hD,sBAIhB3hD,KAAK82C,KAAKxhC,EAAO,CACtB2iC,KAAM,uBACN72C,KAAMpB,KAAKujD,oBACXC,eAAgBxjD,KAAK2jD,cAAc,MAAO3jD,KAAKyjD,kBAC/ChC,WAAYzhD,KAAK8hD,iBAAgB,GACjCJ,aAAc1hD,KAAK2hD,sBAOvB4B,oBACE,GAAgC,OAA5BvjD,KAAK8/C,OAAOtC,MAAM97C,MACpB,MAAM1B,KAAKqhD,aAGb,OAAOrhD,KAAKggD,YAsBdoD,kBAAkBJ,GAChB,MAAMxF,EAAQx9C,KAAK8/C,OAAOtC,MAE1B,OAAQA,EAAMvF,MACZ,KAAK,aACH,OAAOj4C,KAAK6jD,UAAUb,GAExB,KAAK,WACH,OAAOhjD,KAAK8jD,YAAYd,GAE1B,KAAK,OAGH,OAFAhjD,KAAK8/C,OAAOpC,UAEL19C,KAAK82C,KAAK0G,EAAO,CACtBvF,KAAM,OACNv2C,MAAO87C,EAAM97C,QAGjB,KAAK,SAGH,OAFA1B,KAAK8/C,OAAOpC,UAEL19C,KAAK82C,KAAK0G,EAAO,CACtBvF,KAAM,SACNv2C,MAAO87C,EAAM97C,QAGjB,KAAK,UACL,KAAK,gBACH,OAAO1B,KAAK+jD,qBAEd,KAAK,QAGH,OAFA/jD,KAAK8/C,OAAOpC,UAEJF,EAAM97C,OACZ,IAAK,OACH,OAAO1B,KAAK82C,KAAK0G,EAAO,CACtBvF,KAAM,WACNv2C,OAAO,IAGX,IAAK,QACH,OAAO1B,KAAK82C,KAAK0G,EAAO,CACtBvF,KAAM,WACNv2C,OAAO,IAGX,IAAK,OACH,OAAO1B,KAAK82C,KAAK0G,EAAO,CACtBvF,KAAM,UAGV,QACE,OAAOj4C,KAAK82C,KAAK0G,EAAO,CACtBvF,KAAM,QACNv2C,MAAO87C,EAAM97C,QAIrB,KAAK,UACH,GAAIshD,EAAS,CAGX,GAFAhjD,KAAKigD,YAAY,WAEbjgD,KAAK8/C,OAAOtC,MAAMvF,OAAS,QAAgB,CAC7C,MAAM+L,EAAUhkD,KAAK8/C,OAAOtC,MAAM97C,MAClC,MAAMg2C,GACJ13C,KAAK8/C,OAAOtuC,OACZgsC,EAAMloC,MACN,yBAAyB0uC,yBAG3B,MAAMhkD,KAAKqhD,WAAW7D,GAI1B,OAAOx9C,KAAKoiD,gBAGhB,MAAMpiD,KAAKqhD,aAGbkB,yBACE,OAAOviD,KAAKojD,mBAAkB,GAGhCW,qBACE,MAAMvG,EAAQx9C,KAAK8/C,OAAOtC,MAI1B,OAFAx9C,KAAK8/C,OAAOpC,UAEL19C,KAAK82C,KAAK0G,EAAO,CACtBvF,KAAM,UACNv2C,MAAO87C,EAAM97C,MACbuiD,MAAOzG,EAAMvF,OAAS,kBAS1B4L,UAAUb,GAGR,OAAOhjD,KAAK82C,KAAK92C,KAAK8/C,OAAOtC,MAAO,CAClCvF,KAAM,QACNxxC,OAAQzG,KAAKkkD,IAAI,cAJN,IAAMlkD,KAAKojD,kBAAkBJ,IAII,gBAWhDc,YAAYd,GAGV,OAAOhjD,KAAK82C,KAAK92C,KAAK8/C,OAAOtC,MAAO,CAClCvF,KAAM,UACNkM,OAAQnkD,KAAKkkD,IAAI,YAJN,IAAMlkD,KAAKokD,iBAAiBpB,IAIG,cAO9CoB,iBAAiBpB,GACf,MAAM1tC,EAAQtV,KAAK8/C,OAAOtC,MACpBp8C,EAAOpB,KAAKggD,YAElB,OADAhgD,KAAKigD,YAAY,UACVjgD,KAAK82C,KAAKxhC,EAAO,CACtB2iC,KAAM,gBACN72C,KAAAA,EACAM,MAAO1B,KAAKojD,kBAAkBJ,KAQlClB,gBAAgBkB,GACd,MAAMvB,EAAa,GAEnB,KAAOzhD,KAAKsgD,KAAK,QACfmB,EAAWj7C,KAAKxG,KAAKqkD,eAAerB,IAGtC,OAAOvB,EAGTe,uBACE,OAAOxiD,KAAK8hD,iBAAgB,GAQ9BuC,eAAerB,GACb,MAAM1tC,EAAQtV,KAAK8/C,OAAOtC,MAE1B,OADAx9C,KAAKigD,YAAY,OACVjgD,KAAK82C,KAAKxhC,EAAO,CACtB2iC,KAAM,aACN72C,KAAMpB,KAAKggD,YACXviC,UAAWzd,KAAK+iD,eAAeC,KAWnCX,qBACE,MAAM/sC,EAAQtV,KAAK8/C,OAAOtC,MAC1B,IAAIx4C,EAEJ,GAAIhF,KAAKsiD,oBAAoB,cAAsB,CACjD,MAAMgC,EAAYtkD,KAAKqiD,qBACvBriD,KAAKigD,YAAY,cACjBj7C,EAAOhF,KAAK82C,KAAKxhC,EAAO,CACtB2iC,KAAM,aACNjzC,KAAMs/C,SAGRt/C,EAAOhF,KAAKyjD,iBAGd,OAAIzjD,KAAKsiD,oBAAoB,SACpBtiD,KAAK82C,KAAKxhC,EAAO,CACtB2iC,KAAM,iBACNjzC,KAAAA,IAIGA,EAMTy+C,iBACE,OAAOzjD,KAAK82C,KAAK92C,KAAK8/C,OAAOtC,MAAO,CAClCvF,KAAM,cACN72C,KAAMpB,KAAKggD,cAIfS,kBACE,OAAOzgD,KAAKsgD,KAAK,YAAqBtgD,KAAKsgD,KAAK,iBAMlDiE,mBACE,GAAIvkD,KAAKygD,kBACP,OAAOzgD,KAAK+jD,qBAShBpD,wBACE,MAAMrrC,EAAQtV,KAAK8/C,OAAOtC,MACpB7F,EAAc33C,KAAKukD,mBACzBvkD,KAAK2jD,cAAc,UACnB,MAAMlC,EAAazhD,KAAKwiD,uBAClBgC,EAAiBxkD,KAAKogD,KAC1B,WACApgD,KAAKykD,6BACL,YAEF,OAAOzkD,KAAK82C,KAAKxhC,EAAO,CACtB2iC,KAAM,qBACNN,YAAAA,EACA8J,WAAAA,EACA+C,eAAAA,IAOJC,+BACE,MAAMnvC,EAAQtV,KAAK8/C,OAAOtC,MACpB8D,EAAYthD,KAAK4hD,qBACvB5hD,KAAKigD,YAAY,UACjB,MAAMj7C,EAAOhF,KAAKyjD,iBAClB,OAAOzjD,KAAK82C,KAAKxhC,EAAO,CACtB2iC,KAAM,6BACNqJ,UAAAA,EACAt8C,KAAAA,IAOJ47C,4BACE,MAAMtrC,EAAQtV,KAAK8/C,OAAOtC,MACpB7F,EAAc33C,KAAKukD,mBACzBvkD,KAAK2jD,cAAc,UACnB,MAAMviD,EAAOpB,KAAKggD,YACZyB,EAAazhD,KAAKwiD,uBACxB,OAAOxiD,KAAK82C,KAAKxhC,EAAO,CACtB2iC,KAAM,0BACNN,YAAAA,EACAv2C,KAAAA,EACAqgD,WAAAA,IASJZ,4BACE,MAAMvrC,EAAQtV,KAAK8/C,OAAOtC,MACpB7F,EAAc33C,KAAKukD,mBACzBvkD,KAAK2jD,cAAc,QACnB,MAAMviD,EAAOpB,KAAKggD,YACZ0E,EAAa1kD,KAAK2kD,4BAClBlD,EAAazhD,KAAKwiD,uBAClB2B,EAASnkD,KAAK4kD,wBACpB,OAAO5kD,KAAK82C,KAAKxhC,EAAO,CACtB2iC,KAAM,0BACNN,YAAAA,EACAv2C,KAAAA,EACAsjD,WAAAA,EACAjD,WAAAA,EACA0C,OAAAA,IASJQ,4BACE,OAAO3kD,KAAKsjD,sBAAsB,cAC9BtjD,KAAK6kD,cAAc,OAAe7kD,KAAKyjD,gBACvC,GAQNmB,wBACE,OAAO5kD,KAAKkiD,aACV,WACAliD,KAAK8kD,qBACL,YAQJA,uBACE,MAAMxvC,EAAQtV,KAAK8/C,OAAOtC,MACpB7F,EAAc33C,KAAKukD,mBACnBnjD,EAAOpB,KAAKggD,YACZ/yC,EAAOjN,KAAK+kD,oBAClB/kD,KAAKigD,YAAY,UACjB,MAAMj7C,EAAOhF,KAAKqiD,qBACZZ,EAAazhD,KAAKwiD,uBACxB,OAAOxiD,KAAK82C,KAAKxhC,EAAO,CACtB2iC,KAAM,oBACNN,YAAAA,EACAv2C,KAAAA,EACAqc,UAAWxQ,EACXjI,KAAAA,EACAy8C,WAAAA,IAOJsD,oBACE,OAAO/kD,KAAKkiD,aACV,WACAliD,KAAKglD,mBACL,YAQJA,qBACE,MAAM1vC,EAAQtV,KAAK8/C,OAAOtC,MACpB7F,EAAc33C,KAAKukD,mBACnBnjD,EAAOpB,KAAKggD,YAClBhgD,KAAKigD,YAAY,UACjB,MAAMj7C,EAAOhF,KAAKqiD,qBAClB,IAAIvjC,EAEA9e,KAAKsiD,oBAAoB,aAC3BxjC,EAAe9e,KAAKuiD,0BAGtB,MAAMd,EAAazhD,KAAKwiD,uBACxB,OAAOxiD,KAAK82C,KAAKxhC,EAAO,CACtB2iC,KAAM,0BACNN,YAAAA,EACAv2C,KAAAA,EACA4D,KAAAA,EACA8Z,aAAAA,EACA2iC,WAAAA,IAQJX,+BACE,MAAMxrC,EAAQtV,KAAK8/C,OAAOtC,MACpB7F,EAAc33C,KAAKukD,mBACzBvkD,KAAK2jD,cAAc,aACnB,MAAMviD,EAAOpB,KAAKggD,YACZ0E,EAAa1kD,KAAK2kD,4BAClBlD,EAAazhD,KAAKwiD,uBAClB2B,EAASnkD,KAAK4kD,wBACpB,OAAO5kD,KAAK82C,KAAKxhC,EAAO,CACtB2iC,KAAM,6BACNN,YAAAA,EACAv2C,KAAAA,EACAsjD,WAAAA,EACAjD,WAAAA,EACA0C,OAAAA,IAQJpD,2BACE,MAAMzrC,EAAQtV,KAAK8/C,OAAOtC,MACpB7F,EAAc33C,KAAKukD,mBACzBvkD,KAAK2jD,cAAc,SACnB,MAAMviD,EAAOpB,KAAKggD,YACZyB,EAAazhD,KAAKwiD,uBAClBtlC,EAAQld,KAAKilD,wBACnB,OAAOjlD,KAAK82C,KAAKxhC,EAAO,CACtB2iC,KAAM,yBACNN,YAAAA,EACAv2C,KAAAA,EACAqgD,WAAAA,EACAvkC,MAAAA,IASJ+nC,wBACE,OAAOjlD,KAAKsiD,oBAAoB,WAC5BtiD,KAAK6kD,cAAc,QAAgB7kD,KAAKyjD,gBACxC,GAONzC,0BACE,MAAM1rC,EAAQtV,KAAK8/C,OAAOtC,MACpB7F,EAAc33C,KAAKukD,mBACzBvkD,KAAK2jD,cAAc,QACnB,MAAMviD,EAAOpB,KAAKggD,YACZyB,EAAazhD,KAAKwiD,uBAClB/7C,EAASzG,KAAKklD,4BACpB,OAAOllD,KAAK82C,KAAKxhC,EAAO,CACtB2iC,KAAM,wBACNN,YAAAA,EACAv2C,KAAAA,EACAqgD,WAAAA,EACAh7C,OAAAA,IASJy+C,4BACE,OAAOllD,KAAKkiD,aACV,WACAliD,KAAKmlD,yBACL,YAOJA,2BACE,MAAM7vC,EAAQtV,KAAK8/C,OAAOtC,MACpB7F,EAAc33C,KAAKukD,mBACnBnjD,EAAOpB,KAAKolD,qBACZ3D,EAAazhD,KAAKwiD,uBACxB,OAAOxiD,KAAK82C,KAAKxhC,EAAO,CACtB2iC,KAAM,yBACNN,YAAAA,EACAv2C,KAAAA,EACAqgD,WAAAA,IAOJ2D,qBACE,GAC8B,SAA5BplD,KAAK8/C,OAAOtC,MAAM97C,OACU,UAA5B1B,KAAK8/C,OAAOtC,MAAM97C,OACU,SAA5B1B,KAAK8/C,OAAOtC,MAAM97C,MAElB,MAAMg2C,GACJ13C,KAAK8/C,OAAOtuC,OACZxR,KAAK8/C,OAAOtC,MAAMloC,MAClB,GAAG+vC,GACDrlD,KAAK8/C,OAAOtC,4DAKlB,OAAOx9C,KAAKggD,YAOdiB,iCACE,MAAM3rC,EAAQtV,KAAK8/C,OAAOtC,MACpB7F,EAAc33C,KAAKukD,mBACzBvkD,KAAK2jD,cAAc,SACnB,MAAMviD,EAAOpB,KAAKggD,YACZyB,EAAazhD,KAAKwiD,uBAClB2B,EAASnkD,KAAKslD,6BACpB,OAAOtlD,KAAK82C,KAAKxhC,EAAO,CACtB2iC,KAAM,gCACNN,YAAAA,EACAv2C,KAAAA,EACAqgD,WAAAA,EACA0C,OAAAA,IASJmB,6BACE,OAAOtlD,KAAKkiD,aACV,WACAliD,KAAKglD,mBACL,YAiBJ5D,2BACE,MAAMV,EAAe1gD,KAAK8/C,OAAOnC,YAEjC,GAAI+C,EAAazI,OAAS,QACxB,OAAQyI,EAAah/C,OACnB,IAAK,SACH,OAAO1B,KAAKulD,uBAEd,IAAK,SACH,OAAOvlD,KAAKwlD,2BAEd,IAAK,OACH,OAAOxlD,KAAKylD,2BAEd,IAAK,YACH,OAAOzlD,KAAK0lD,8BAEd,IAAK,QACH,OAAO1lD,KAAK2lD,0BAEd,IAAK,OACH,OAAO3lD,KAAK4lD,yBAEd,IAAK,QACH,OAAO5lD,KAAK6lD,gCAIlB,MAAM7lD,KAAKqhD,WAAWX,GAUxB6E,uBACE,MAAMjwC,EAAQtV,KAAK8/C,OAAOtC,MAC1Bx9C,KAAK2jD,cAAc,UACnB3jD,KAAK2jD,cAAc,UACnB,MAAMlC,EAAazhD,KAAKwiD,uBAClBgC,EAAiBxkD,KAAKkiD,aAC1B,WACAliD,KAAKykD,6BACL,YAGF,GAA0B,IAAtBhD,EAAWj8C,QAA0C,IAA1Bg/C,EAAeh/C,OAC5C,MAAMxF,KAAKqhD,aAGb,OAAOrhD,KAAK82C,KAAKxhC,EAAO,CACtB2iC,KAAM,oBACNwJ,WAAAA,EACA+C,eAAAA,IAQJgB,2BACE,MAAMlwC,EAAQtV,KAAK8/C,OAAOtC,MAC1Bx9C,KAAK2jD,cAAc,UACnB3jD,KAAK2jD,cAAc,UACnB,MAAMviD,EAAOpB,KAAKggD,YACZyB,EAAazhD,KAAKwiD,uBAExB,GAA0B,IAAtBf,EAAWj8C,OACb,MAAMxF,KAAKqhD,aAGb,OAAOrhD,KAAK82C,KAAKxhC,EAAO,CACtB2iC,KAAM,yBACN72C,KAAAA,EACAqgD,WAAAA,IAUJgE,2BACE,MAAMnwC,EAAQtV,KAAK8/C,OAAOtC,MAC1Bx9C,KAAK2jD,cAAc,UACnB3jD,KAAK2jD,cAAc,QACnB,MAAMviD,EAAOpB,KAAKggD,YACZ0E,EAAa1kD,KAAK2kD,4BAClBlD,EAAazhD,KAAKwiD,uBAClB2B,EAASnkD,KAAK4kD,wBAEpB,GACwB,IAAtBF,EAAWl/C,QACW,IAAtBi8C,EAAWj8C,QACO,IAAlB2+C,EAAO3+C,OAEP,MAAMxF,KAAKqhD,aAGb,OAAOrhD,KAAK82C,KAAKxhC,EAAO,CACtB2iC,KAAM,yBACN72C,KAAAA,EACAsjD,WAAAA,EACAjD,WAAAA,EACA0C,OAAAA,IAUJuB,8BACE,MAAMpwC,EAAQtV,KAAK8/C,OAAOtC,MAC1Bx9C,KAAK2jD,cAAc,UACnB3jD,KAAK2jD,cAAc,aACnB,MAAMviD,EAAOpB,KAAKggD,YACZ0E,EAAa1kD,KAAK2kD,4BAClBlD,EAAazhD,KAAKwiD,uBAClB2B,EAASnkD,KAAK4kD,wBAEpB,GACwB,IAAtBF,EAAWl/C,QACW,IAAtBi8C,EAAWj8C,QACO,IAAlB2+C,EAAO3+C,OAEP,MAAMxF,KAAKqhD,aAGb,OAAOrhD,KAAK82C,KAAKxhC,EAAO,CACtB2iC,KAAM,4BACN72C,KAAAA,EACAsjD,WAAAA,EACAjD,WAAAA,EACA0C,OAAAA,IASJwB,0BACE,MAAMrwC,EAAQtV,KAAK8/C,OAAOtC,MAC1Bx9C,KAAK2jD,cAAc,UACnB3jD,KAAK2jD,cAAc,SACnB,MAAMviD,EAAOpB,KAAKggD,YACZyB,EAAazhD,KAAKwiD,uBAClBtlC,EAAQld,KAAKilD,wBAEnB,GAA0B,IAAtBxD,EAAWj8C,QAAiC,IAAjB0X,EAAM1X,OACnC,MAAMxF,KAAKqhD,aAGb,OAAOrhD,KAAK82C,KAAKxhC,EAAO,CACtB2iC,KAAM,wBACN72C,KAAAA,EACAqgD,WAAAA,EACAvkC,MAAAA,IASJ0oC,yBACE,MAAMtwC,EAAQtV,KAAK8/C,OAAOtC,MAC1Bx9C,KAAK2jD,cAAc,UACnB3jD,KAAK2jD,cAAc,QACnB,MAAMviD,EAAOpB,KAAKggD,YACZyB,EAAazhD,KAAKwiD,uBAClB/7C,EAASzG,KAAKklD,4BAEpB,GAA0B,IAAtBzD,EAAWj8C,QAAkC,IAAlBiB,EAAOjB,OACpC,MAAMxF,KAAKqhD,aAGb,OAAOrhD,KAAK82C,KAAKxhC,EAAO,CACtB2iC,KAAM,uBACN72C,KAAAA,EACAqgD,WAAAA,EACAh7C,OAAAA,IASJo/C,gCACE,MAAMvwC,EAAQtV,KAAK8/C,OAAOtC,MAC1Bx9C,KAAK2jD,cAAc,UACnB3jD,KAAK2jD,cAAc,SACnB,MAAMviD,EAAOpB,KAAKggD,YACZyB,EAAazhD,KAAKwiD,uBAClB2B,EAASnkD,KAAKslD,6BAEpB,GAA0B,IAAtB7D,EAAWj8C,QAAkC,IAAlB2+C,EAAO3+C,OACpC,MAAMxF,KAAKqhD,aAGb,OAAOrhD,KAAK82C,KAAKxhC,EAAO,CACtB2iC,KAAM,+BACN72C,KAAAA,EACAqgD,WAAAA,EACA0C,OAAAA,IAUJjD,2BACE,MAAM5rC,EAAQtV,KAAK8/C,OAAOtC,MACpB7F,EAAc33C,KAAKukD,mBACzBvkD,KAAK2jD,cAAc,aACnB3jD,KAAKigD,YAAY,OACjB,MAAM7+C,EAAOpB,KAAKggD,YACZ/yC,EAAOjN,KAAK+kD,oBACZe,EAAa9lD,KAAKsjD,sBAAsB,cAC9CtjD,KAAK2jD,cAAc,MACnB,MAAM3M,EAAYh3C,KAAK+lD,0BACvB,OAAO/lD,KAAK82C,KAAKxhC,EAAO,CACtB2iC,KAAM,wBACNN,YAAAA,EACAv2C,KAAAA,EACAqc,UAAWxQ,EACX64C,WAAAA,EACA9O,UAAAA,IASJ+O,0BACE,OAAO/lD,KAAK6kD,cAAc,QAAgB7kD,KAAKgmD,wBA8BjDA,yBACE,MAAM1wC,EAAQtV,KAAK8/C,OAAOtC,MACpBp8C,EAAOpB,KAAKggD,YAElB,GAAIh/C,OAAOX,UAAU+F,eAAelF,KAAKi7C,GAAmB/6C,EAAKM,OAC/D,OAAON,EAGT,MAAMpB,KAAKqhD,WAAW/rC,GASxBwhC,KAAKgB,EAAYhB,GACf,IAAImP,EAcJ,OATsC,KAFG,QAArCA,EAAkBjmD,KAAK+/C,gBAA0C,IAApBkG,OAC3C,EACAA,EAAgBC,cAEpBpP,EAAKC,IAAM,IAAIc,GACbC,EACA93C,KAAK8/C,OAAOvC,UACZv9C,KAAK8/C,OAAOtuC,SAITslC,EAMTwJ,KAAKrI,GACH,OAAOj4C,KAAK8/C,OAAOtC,MAAMvF,OAASA,EAOpCgI,YAAYhI,GACV,MAAMuF,EAAQx9C,KAAK8/C,OAAOtC,MAE1B,GAAIA,EAAMvF,OAASA,EAGjB,OAFAj4C,KAAK8/C,OAAOpC,UAELF,EAGT,MAAM9F,GACJ13C,KAAK8/C,OAAOtuC,OACZgsC,EAAMloC,MACN,YAAY6wC,GAAiBlO,aAAgBoN,GAAa7H,OAQ9D8E,oBAAoBrK,GAGlB,OAFcj4C,KAAK8/C,OAAOtC,MAEhBvF,OAASA,IACjBj4C,KAAK8/C,OAAOpC,WAEL,GAUXiG,cAAcjiD,GACZ,MAAM87C,EAAQx9C,KAAK8/C,OAAOtC,MAE1B,GAAIA,EAAMvF,OAAS,SAAkBuF,EAAM97C,QAAUA,EAGnD,MAAMg2C,GACJ13C,KAAK8/C,OAAOtuC,OACZgsC,EAAMloC,MACN,aAAa5T,aAAiB2jD,GAAa7H,OAL7Cx9C,KAAK8/C,OAAOpC,UAchB4F,sBAAsB5hD,GACpB,MAAM87C,EAAQx9C,KAAK8/C,OAAOtC,MAE1B,OAAIA,EAAMvF,OAAS,SAAkBuF,EAAM97C,QAAUA,IACnD1B,KAAK8/C,OAAOpC,WAEL,GASX2D,WAAW+E,GACT,MAAM5I,EACJ4I,MAAAA,EAAyCA,EAAUpmD,KAAK8/C,OAAOtC,MACjE,OAAO9F,GACL13C,KAAK8/C,OAAOtuC,OACZgsC,EAAMloC,MACN,cAAc+vC,GAAa7H,OAS/B0G,IAAImC,EAAUC,EAASC,GACrBvmD,KAAKigD,YAAYoG,GACjB,MAAMjQ,EAAQ,GAEd,MAAQp2C,KAAKsiD,oBAAoBiE,IAC/BnQ,EAAM5vC,KAAK8/C,EAAQplD,KAAKlB,OAG1B,OAAOo2C,EAST8L,aAAamE,EAAUC,EAASC,GAC9B,GAAIvmD,KAAKsiD,oBAAoB+D,GAAW,CACtC,MAAMjQ,EAAQ,GAEd,GACEA,EAAM5vC,KAAK8/C,EAAQplD,KAAKlB,cAChBA,KAAKsiD,oBAAoBiE,IAEnC,OAAOnQ,EAGT,MAAO,GAQTgK,KAAKiG,EAAUC,EAASC,GACtBvmD,KAAKigD,YAAYoG,GACjB,MAAMjQ,EAAQ,GAEd,GACEA,EAAM5vC,KAAK8/C,EAAQplD,KAAKlB,cAChBA,KAAKsiD,oBAAoBiE,IAEnC,OAAOnQ,EAQTyO,cAAc2B,EAAeF,GAC3BtmD,KAAKsiD,oBAAoBkE,GACzB,MAAMpQ,EAAQ,GAEd,GACEA,EAAM5vC,KAAK8/C,EAAQplD,KAAKlB,aACjBA,KAAKsiD,oBAAoBkE,IAElC,OAAOpQ,GAOX,SAASiP,GAAa7H,GACpB,MAAM97C,EAAQ87C,EAAM97C,MACpB,OAAOykD,GAAiB3I,EAAMvF,OAAkB,MAATv2C,EAAgB,KAAKA,KAAW,IAMzE,SAASykD,GAAiBlO,GACxB,OD/5CK,SAA+BA,GACpC,OACEA,IAAS,SACTA,IAAS,WACTA,IAAS,QACTA,IAAS,YACTA,IAAS,YACTA,IAAS,WACTA,IAAS,UACTA,IAAS,WACTA,IAAS,OACTA,IAAS,cACTA,IAAS,cACTA,IAAS,YACTA,IAAS,SACTA,IAAS,WCg5CJwO,CAAsBxO,GAAQ,IAAIA,KAAUA,EC/+CrD,IAAIyO,GAAW,IAAIh7C,IACfi7C,GAAoB,IAAIj7C,IACxBk7C,IAAwB,EACxBC,IAAgC,EACpC,SAASC,GAAUrxC,GACf,OAAOA,EAAO9N,QAAQ,UAAW,KAAKH,OAsD1C,SAAS04C,GAAc1uC,GACnB,IAlDsBu1C,EAClBC,EACA7G,EAgDA8G,EAAWH,GAAUt1C,GACzB,IAAKk1C,GAASvgD,IAAI8gD,GAAW,CACzB,IAAIC,EDjDL,SAAe11C,EAAQ1K,GAE5B,OADe,IAAI64C,GAAOnuC,EAAQ1K,GACpBo5C,gBC+CKj6C,CAAMuL,EAAQ,CACvBq1C,8BAA+BA,GAC/BjD,6BAA8BiD,KAElC,IAAKK,GAA0B,aAAhBA,EAAOjP,KAClB,MAAM,IAAI/yC,MAAM,iCAEpBwhD,GAASxiD,IAAI+iD,EA7BrB,SAAkBE,GACd,IAAIC,EAAU,IAAIn7C,IAAIk7C,EAAIhH,aAC1BiH,EAAQ/kD,SAAQ,SAAUy0C,GAClBA,EAAKC,YACED,EAAKC,IAChB/1C,OAAOuF,KAAKuwC,GAAMz0C,SAAQ,SAAUmH,GAChC,IAAI9H,EAAQo1C,EAAKttC,GACb9H,GAA0B,iBAAVA,GAChB0lD,EAAQ96C,IAAI5K,SAIxB,IAAIq1C,EAAMoQ,EAAIpQ,IAKd,OAJIA,WACOA,EAAIe,kBACJf,EAAIgB,UAERoP,EAYoBE,EA3DLN,EA2D+BG,EA1DjDF,EAAW,IAAI/6C,IACfk0C,EAAc,GAClB4G,EAAI5G,YAAY99C,SAAQ,SAAUilD,GAC9B,GAAgC,uBAA5BA,EAAmBrP,KAA+B,CAClD,IAAIsP,EAAeD,EAAmBlmD,KAAKM,MACvC8lD,EARLV,IADc/P,EASmBuQ,EAAmBvQ,KARtCvlC,OAAO5O,KAAKkqC,UAAUiK,EAAIzhC,MAAOyhC,EAAI/lB,MAS9Cy2B,EAAed,GAAkB5hD,IAAIwiD,GACrCE,IAAiBA,EAAathD,IAAIqhD,GAC9BZ,IACAc,QAAQC,KAAK,+BAAiCJ,EAAjC,iMAKXE,GACNd,GAAkBziD,IAAIqjD,EAAcE,EAAe,IAAIx7C,KAE3Dw7C,EAAan7C,IAAIk7C,GACZR,EAAS7gD,IAAIqhD,KACdR,EAAS16C,IAAIk7C,GACbrH,EAAY35C,KAAK8gD,SAIrBnH,EAAY35C,KAAK8gD,GA5B7B,IAAyBvQ,KA+BdhE,EAASA,EAAS,GAAIgU,GAAM,CAAE5G,YAAaA,OAiClD,OAAOuG,GAAS3hD,IAAIkiD,GAEjB,SAASW,GAAIC,GAEhB,IADA,IAAI56C,EAAO,GACF66C,EAAK,EAAGA,EAAKrqC,UAAUjY,OAAQsiD,IACpC76C,EAAK66C,EAAK,GAAKrqC,UAAUqqC,GAEL,iBAAbD,IACPA,EAAW,CAACA,IAEhB,IAAIzkD,EAASykD,EAAS,GAUtB,OATA56C,EAAK5K,SAAQ,SAAUgb,EAAK5X,GACpB4X,GAAoB,aAAbA,EAAI46B,KACX70C,GAAUia,EAAI05B,IAAIvlC,OAAO5O,KAGzBQ,GAAUia,EAEdja,GAAUykD,EAASpiD,EAAI,MAEpBy6C,GAAc98C,GAezB,IAOW2kD,GAPPC,GACKJ,IAMEG,GAERH,KAAQA,GAAM,KADPA,IAAMI,GAAYD,GAAME,YArB3B,WACHvB,GAASx7C,QACTy7C,GAAkBz7C,SAmB8C68C,GAAMG,wBAjBnE,WACHtB,IAAwB,GAgBwGmB,GAAMI,oCAdnI,WACHtB,IAAgC,GAawLkB,GAAMK,qCAX3N,WACHvB,IAAgC,GAYpCe,GAAa,QAAIA,gBCpHJS,GAAiBT,GAAG,8nBCE3BU,GAA+BV,GAAG,wmBAkBlCW,GAAiBX,GAAG,0UAWpBY,GAAgBZ,GAAG,i8BA4BO,OACd,OACA,QAFdU,GACAD,GACAE,IA2CJ,SAxCA,WACE,WAA6BE,GAAA,KAAAA,OAAAA,EAqC/B,OAnCE,YAAAC,SAAA,WACE,OAAO1oD,KAAKyoD,OAAOE,MAA6C,CAC9DA,MAAOf,GAAG,qoBAUO,cAAbY,IAEJI,UAAW,CACTC,OAAQ,CACNxb,MAAO,IAET1J,OAAQ,CACN57B,OAAQ,CACNqG,GAAImiC,EAAcuY,WAEpBC,SAAU,CACRC,IAAI,IAGRC,QAAS,CACP,CACEC,MAAO1Y,EAAe2Y,MACtBC,UAAWrY,EAAcsY,UAMrC,EAtCA,qHC9DMC,GAAwB1B,GAAG,u7FAgFf,QAAdS,IAGEkB,GAAmC3B,GAAG,wsBAqBtC4B,GAAoB5B,GAAG,wiBAeJ,OACW,QADhC0B,GACAC,IA4BJ,SAzBA,WACE,WAA6Bd,GAAA,KAAAA,OAAAA,EAsB/B,OApBE,YAAAgB,YAAA,SAAYC,GACV,OAAO1pD,KAAKyoD,OAAOE,MAAiE,CAClFA,MAAOf,GAAG,6gBAUW,cAAjB4B,IAEJZ,UAAW,CACTjlB,OAAQ,CAAEgmB,MAAO,CAAEv7C,GAAIs7C,KAEzBE,YAAa,kBAGnB,EAvBA,mBCjHA,SANE,SAAYnB,GACVzoD,KAAK6pD,QAAU,IAAI,GAAWpB,GAC9BzoD,KAAK8pD,UAAY,IAAI,GAAarB,oDCsB/B,SAASsB,GAA0B,OAAEL,EAAU,aACpD,IAAKA,GAAc,KAAQA,GAEzB,MAAM,IAAIxkD,MAAM,6FAElB,OAAOwkD,qQCLT,2BACE,KAAAM,yBAA2B,SACzBC,EACAC,EACAC,EACAC,GAEA,IAAMC,EAAcF,EAAYG,sBAAsBD,YAChDE,EAAYJ,EAAYG,sBAAsBC,UACpD,IAAKF,EACH,MAAM,IAAInlD,MAAM,iDAGlB,OAAQmlD,GACN,KAAK,UACH,MAAO,CACL3Y,SAAS,EACT2Y,YAAaA,EACb1Y,UAAWsY,EAAStY,UACpBC,mBAAoBqY,EAASrY,mBAC7BsY,UAAS,GAEb,KAAK,SACH,OAAIK,IAAcna,EAAUoa,aAAeD,IAAcna,EAAUqa,YAC1D,CACL/Y,SAAS,EACT2Y,YAAa,SACb1Y,UAAWsY,EAAStY,UACpB+Y,WAAYP,EAAYG,sBAAsBI,YAAc,EAC5DC,aAAcR,EAAYG,sBAAsBK,cAAgB,GAChEC,mBAAoBT,EAAYG,sBAAsBM,oBAAsB,GAC5EhZ,mBAAoBqY,EAASrY,mBAC7BiZ,kBAAmBV,EAAYG,sBAAsBO,kBACrDN,UAAWA,EACXO,aAAcX,EAAYY,aAAaD,cAAgB,EACvDV,eAAgBA,GAAkB,EAClCY,YAAab,EAAYY,aAAaC,YACtCC,cAAed,EAAYY,aAAaE,cACxCC,yBAA0Bf,EAAYY,aAAaG,yBACnDhB,UAAS,GAGJ,CACLxY,SAAS,EACT2Y,YAAa,SACbE,UAAWA,EACX5Y,UAAWsY,EAAStY,UACpB+Y,WAAYP,EAAYG,sBAAsBI,YAAc,EAC5DC,aAAcR,EAAYG,sBAAsBK,cAAgB,GAChEC,mBAAoBT,EAAYG,sBAAsBM,oBAAsB,GAC5EhZ,mBAAoBqY,EAASrY,mBAC7BiZ,kBAAmBV,EAAYG,sBAAsBO,kBACrDX,UAAS,GAIf,QACE,MAAM,IAAIhlD,MAAM,uBAAgBmlD,EAAW,mDAySnD,OArSE,YAAAc,mBAAA,SAAmBhB,iBACXE,EAAiC,QAAnB,EAAAF,EAAYiB,eAAO,eAAEf,YACnCE,EAA+B,QAAnB,EAAAJ,EAAYiB,eAAO,eAAEb,UACvC,IAAKF,EAAa,CAChB,GAAIF,EAAYvY,qBAAuB/C,EAAmBwc,gBACxD,MAAO,CACL3Z,SAAS,EACTC,WAAW,EACXC,mBAAoB/C,EAAmBwc,iBAI3C,MAAM,IAAInmD,MAAM,gDAElB,OAAQmlD,GACN,KAAK,UACH,MAAO,CACL3Y,SAAS,EACT2Y,YAAaA,EACb1Y,UAAWwY,EAAYxY,UACvBC,mBAAoBuY,EAAYvY,mBAChCsY,UAA8B,QAAnB,EAAAC,EAAYiB,eAAO,eAAEzB,OAEpC,KAAK,SACH,OAAIY,IAAcna,EAAUoa,aAAeD,IAAcna,EAAUqa,YAC1D,CACL/Y,SAAS,EACT2Y,YAAaA,EACbE,UAAWA,EACXL,UAA8B,QAAnB,EAAAC,EAAYiB,eAAO,eAAEzB,MAChChY,UAAWwY,EAAYxY,UACvB+Y,WAAYP,EAAYO,YAAc,EACtCI,aAAcX,EAAYW,cAAgB,EAC1CV,eAAgBD,EAAYC,gBAAkB,EAC9CS,kBAAmBV,EAAYU,kBAC/BG,YAAab,EAAYa,YACzBC,cAAed,EAAYc,cAC3BC,yBAA0Bf,EAAYe,yBACtCtZ,mBAAoBuY,EAAYvY,oBAG3B,CACLF,SAAS,EACT2Y,YAAaA,EACbH,UAA8B,QAAnB,EAAAC,EAAYiB,eAAO,eAAEzB,MAChChY,WAAW,EACXC,mBAAoBuY,EAAYvY,mBAChC8Y,WAAYP,EAAYO,YAAc,EACtCG,kBAAmBV,EAAYU,mBAIrC,QAEE,MAAM,IAAI3lD,MAAM,uBAAgBmlD,EAAW,mDAIjD,YAAAiB,6BAAA,SACEnB,EACAF,EACAP,EACAU,GAEA,OAAOpqD,KAAKurD,mBAAmB,kBAC1BtB,GAAQ,CACXP,WAAU,IACPS,EAAYG,uBACZH,EAAYY,cAAY,CAC3BK,QAAS,CACPf,YAAaF,EAAYG,sBAAsBD,YAC/CE,UAAWJ,EAAYG,sBAAsBC,UAC7CI,aAAcR,EAAYG,sBAAsBK,aAChDC,mBAAoBT,EAAYG,sBAAsBM,mBACtDjT,YAAawS,EAAYG,sBAAsBkB,mBAC/CC,YAAatB,EAAYG,sBAAsBoB,oBAAsB,GACrE/B,MAAOQ,EAAYG,sBAAsBJ,WAE3CE,eAAc,MAIlB,YAAAmB,mBAAA,SAAmBI,+BACXxB,EAAcnqD,KAAKmrD,mBAAmBQ,GACtCtB,EAAqC,QAAvB,EAAAsB,EAAgBP,eAAO,eAAEf,YACvCE,EAAmC,QAAvB,EAAAoB,EAAgBP,eAAO,eAAEb,UAE3C,OAAQF,GACN,KAAK,UACH,OAAO,SACFF,GAAW,CACduB,mBAA2C,QAAvB,EAAAC,EAAgBP,eAAO,eAAEK,YAC7CD,mBAA2C,QAAvB,EAAAG,EAAgBP,eAAO,eAAEzT,cAEjD,KAAK,SACH,OAAI4S,IAAcna,EAAUoa,aAAeD,IAAcna,EAAUqa,YAC1D,SACFN,GAAW,CACdQ,cAAqC,QAAvB,EAAAgB,EAAgBP,eAAO,eAAET,eAAgB,GACvDC,oBAA2C,QAAvB,EAAAe,EAAgBP,eAAO,eAAER,qBAAsB,GACnEc,mBAA2C,QAAvB,EAAAC,EAAgBP,eAAO,eAAEK,YAC7CD,mBAA2C,QAAvB,EAAAG,EAAgBP,eAAO,eAAEzT,cAGxC,SACFwS,GAAW,CACdQ,cAAqC,QAAvB,EAAAgB,EAAgBP,eAAO,eAAET,eAAgB,GACvDC,oBAA2C,QAAvB,EAAAe,EAAgBP,eAAO,eAAER,qBAAsB,GACnEc,mBAA2C,QAAvB,EAAAC,EAAgBP,eAAO,eAAEK,YAC7CD,mBAA2C,QAAvB,EAAAG,EAAgBP,eAAO,eAAEzT,cAInD,QAEE,MAAM,IAAIzyC,MAAM,uBAAgBmlD,EAAW,mDAIjD,YAAAuB,qBAAA,SAAqBzB,EAAkCW,EAAuBG,qBAC5E,MAAO,CACLX,sBAAuB,CACrBJ,UAA8B,QAAnB,EAAAC,EAAYiB,eAAO,eAAEzB,MAChCU,YAAgC,QAAnB,EAAAF,EAAYiB,eAAO,eAAEf,YAClCE,UAA8B,QAAnB,EAAAJ,EAAYiB,eAAO,eAAEb,UAChCG,WAAYP,EAAYO,WACxBG,kBAAmBV,EAAYU,kBAC/BF,aAAiC,QAAnB,EAAAR,EAAYiB,eAAO,eAAET,aACnCC,mBAAuC,QAAnB,EAAAT,EAAYiB,eAAO,eAAER,mBACzCc,mBAAuC,QAAnB,EAAAvB,EAAYiB,eAAO,eAAEK,YACzCD,mBAAuC,QAAnB,EAAArB,EAAYiB,eAAO,eAAEzT,aAE3CoT,aAAc,CACZC,YAAab,EAAYa,YACzBE,yBAA0Bf,EAAYe,yBACtCJ,aAAcA,GAAgBX,EAAYW,aAC1CG,cAAeA,GAAiBd,EAAYc,iBAKlD,YAAAY,sBAAA,SAAsBC,GAAtB,WACE,OAAO,IAAIpgD,IACTogD,EAAoB1pD,KAAI,SAAC+nD,SAAgB,QACpB,QAAnB,EAAAA,EAAYiB,eAAO,eAAEzB,QAAS,GAC9B,EAAKiC,qBAAqBzB,SAKhC,YAAA4B,SAAA,SAASC,GAAT,WACQC,EAAQD,EAAWC,MAAMC,MAAM9pD,KAAI,SAAC6vC,GAAM,OAAAA,EAAE6E,QAElD,OADoB92C,KAAKmsD,UAAUF,GAChB7pD,KAAI,SAACgqD,EAAMnhD,GAAU,SAAKohD,QAAQD,EAAMnhD,OAGrD,YAAAqhD,SAAR,SAAiBC,GACP,IAAAnB,EAAgDmB,EAAO,QAA9CC,EAAuCD,EAAO,MACzDE,EAAqB,CACzBC,aAFsDH,EAAO,aAG7DI,cAHsDJ,EAAO,cAI7DK,OAAQJ,EAAMI,OACdC,SAAUL,EAAMK,UAUlB,OARIzB,IACFqB,EAAYrB,QAAU,CACpBK,YAAaL,EAAQK,YACrBd,aAAcS,EAAQT,aACtBC,mBAAoBQ,EAAQR,qBAIzB6B,GAGD,YAAAJ,QAAR,SAAgBD,EAAoBU,GAApC,eACE,YADkC,IAAAA,IAAAA,EAAA,GAC3B,CACL/5B,GAAIq5B,EAAKzC,MACTmD,MAAK,EACLrB,YAAaW,EAAKX,YAClB9T,YAAayU,EAAKzU,YAClBoV,SAAUX,EAAKW,SAAW,CAAEh6B,GAAIq5B,EAAKW,SAASpD,MAAO8B,YAAaW,EAAKW,SAAStB,kBAAgBxpD,EAChG+qD,aAAc,KACZ,KAAOZ,EAAKY,cAAc,SAACC,GAAuB,OAAAA,EAAmB7B,QAAQzB,UAC7E,SAACQ,GAAgB,SAAK+C,sBAAsB/C,MAE9CgD,sBAAuB,KACrB,KAAOf,EAAKe,uBAAuB,SAACF,GAAuB,OAAAA,EAAmB7B,QAAQzB,UACtF,SAACQ,GAAgB,SAAK+C,sBAAsB/C,MAE9CiD,OAAQ,KAAIhB,EAAKgB,QAAQ,SAACZ,GAAU,SAAKF,SAASE,MAClDa,mBAAoBjB,EAAKiB,mBACzBC,iBAA6E,QAA3D,EAAqB,QAArB,EAAAlB,EAAKkB,wBAAgB,eAAElrD,KAAI,SAACmrD,GAAU,SAAKC,SAASD,aAAO,QAAI,KAIrF,YAAAE,YAAA,SAAYC,GAAZ,WACE,OAAO,IAAIC,EAAc,CACvB56B,GAAI26B,EAAS/D,MACbvoD,KAAMssD,EAAStsD,WAAQa,EACvB2rD,MAAOF,EAASE,YAAS3rD,EACzB4rD,UAAW,IAAI/vC,KAAK4vC,EAASG,WAC7BC,UAAW,IAAIhwC,KAAK4vC,EAASI,WAC7B9b,cAAe,KAAI0b,EAAS1b,eAAe,SAACC,GAAM,SAAK8b,gBAAgB9b,MACvEK,wBAAyB,KAAIob,EAASpb,yBAAyB,SAACL,GAAM,SAAK+b,0BAA0B/b,SAIjG,YAAAib,sBAAR,SAA8B/C,GACpB,IAAAiB,EAAYjB,EAAW,QAC/B,MAAO,CACLO,WAAYP,EAAYO,YAAc,EACtCL,YAAae,EAAQf,YACrB4D,iBAAkB7C,EAAQb,UAC1BI,aAAcS,EAAQT,aACtBC,mBAAoBQ,EAAQR,mBAC5Bc,mBAAoBN,EAAQK,YAC5BD,mBAAoBJ,EAAQzT,YAC5BuS,UAAWkB,EAAQzB,MACnBkB,kBAAmBV,EAAYU,kBAC/BG,YAAab,EAAYa,cAIrB,YAAAgD,0BAAR,SAAkC7D,GACxB,IAAAiB,EAAYjB,EAAW,QAC/B,MAAO,CACLpiD,OAAQoiD,EAAYpiD,OACpB2iD,WAAYP,EAAYO,YAAc,EACtCL,YAAae,EAAQf,YACrB4D,iBAAkB7C,EAAQb,UAC1BI,aAAcS,EAAQT,aACtBC,mBAAoBQ,EAAQR,mBAC5Bc,mBAAoBN,EAAQK,YAC5BD,mBAAoBJ,EAAQzT,YAC5BuS,UAAWkB,EAAQzB,MACnBkB,kBAAmBV,EAAYU,kBAC/BG,YAAab,EAAYa,YACzBkD,QAAS/D,EAAY+D,QACrBC,UAAWhE,EAAYgE,YAInB,YAAAJ,gBAAR,SAAwBK,GAAxB,aACSC,GAAaD,EAAahB,QAAU,IAAE,GAC7C,MAAO,CACLr6B,GAAIq7B,EAAazE,MACjB5hD,OAAQqmD,EAAarmD,OACrBqkD,KAAMpsD,KAAKqsD,QAAQ+B,EAAahC,MAChCI,MAAO6B,EAAYruD,KAAKssD,SAAS+B,EAAU7B,OAAS,KACpD8B,QACqB,QAAnB,EAAAF,EAAaE,cAAM,eAAElsD,KAAI,SAAC,OAAEmsD,EAAQ,WAAEhB,EAAK,QAAO,OAChDgB,SAAUA,EACVhB,MAAO,EAAKC,SAASD,SAChB,GACTiB,UAAW,IAAI1wC,KAAKswC,EAAaI,WACjCN,QAASE,EAAaF,SAAW,IAAIpwC,KAAKswC,EAAaF,WAInD,YAAAV,SAAR,SAAiBD,GAAjB,WACE,MAAO,CACLx6B,GAAIw6B,EAAM5D,MACV8B,YAAa8B,EAAM9B,YACnB9T,YAAa4V,EAAM5V,aAAe,GAClCqV,aAAc,KAAIO,EAAMP,cAAc,SAAC/a,GAAM,SAAKib,sBAAsBjb,QAIpE,YAAAka,UAAR,SAAkBF,GAChB,IAAMwC,EAAY,KAChBxC,EAAMtoB,QAAO,SAACsO,GAAM,OAACA,EAAE8a,aACvB,SAACX,GAAS,OAAAA,EAAKzC,SAGXvmD,iMAAM,IAAuBqrD,GAAS,GAE5C,SAASC,EAAYC,EAAoB1C,EAAuB7oD,GAC9D,IAAMwrD,EAAW,KACf3C,EAAMtoB,QAAO,SAACsO,GAAC,MAAK,OAAU,QAAV,EAAAA,EAAE8a,gBAAQ,eAAEpD,SAAUgF,MAC1C,SAACvC,GAAS,OAAAA,EAAKzC,SAGjBvmD,EAAOoD,KAAI,MAAXpD,EAAewrD,GAEXxrD,EAAOoC,SAAWymD,EAAMzmD,QAC1BopD,EAASvsD,SAAQ,SAAC4vC,GAAM,OAAAyc,EAAYzc,EAAE0X,MAAOsC,EAAO7oD,MAKxD,OADAqrD,EAAUpsD,SAAQ,SAAC4vC,GAAM,OAAAyc,EAAYzc,EAAE0X,MAAOsC,EAAO7oD,MAC9CA,GAEX,EAlWA,GC9BIyrD,GAAiB,sBACjBC,GAAK9tD,OAAO0xC,eAAgBA,QAAwB,IAAPoc,GAAgB,SAAUhuD,EAAK4N,GAE5E,OADA5N,EAAI6xC,UAAYjkC,EACT5N,GACPguD,GACAC,GAAgC,SAAUC,GAE1C,SAASD,EAAetmD,QACJ,IAAZA,IAAsBA,EAAUomD,IACpC,IAAII,EAAQD,EAAO9tD,KAAKlB,KAAyB,iBAAZyI,EAC/BomD,GAAiB,KAAOpmD,EAAU,6DAClCA,IAAYzI,KAIlB,OAHAivD,EAAMC,YAAc,EACpBD,EAAM7tD,KAAOytD,GACbnc,GAAeuc,EAAOF,EAAe1uD,WAC9B4uD,EAEX,OAXApc,EAAUkc,EAAgBC,GAWnBD,EAZwB,CAajC7pD,OACF,SAAS,GAAUuvC,EAAWhsC,GAC1B,IAAKgsC,EACD,MAAM,IAAIsa,GAAetmD,GAGjC,IAAI0mD,GAAkB,CAAC,QAAS,MAAO,OAAQ,QAAS,UACpDC,GAAiBD,GAAgBpuD,QAAQ,OAC7C,SAASsuD,GAAkBjuD,GACvB,OAAO,WACH,GAAI+tD,GAAgBpuD,QAAQK,IAASguD,GAAgB,CAGjD,IAAIroD,EAAS2gD,QAAQtmD,IAASsmD,QAAQ4H,IACtC,OAAOvoD,EAAOmG,MAAMw6C,QAASjqC,aClClC,SAAS8xC,GAAMC,GAClB,IACI,OAAOA,IAEX,MAAOV,MDkCX,SAAWta,GACPA,EAAUib,MAAQJ,GAAkB,SACpC7a,EAAU8a,IAAMD,GAAkB,OAClC7a,EAAUmT,KAAO0H,GAAkB,QACnC7a,EAAUlxC,MAAQ+rD,GAAkB,SAJxC,CAKG,KAAc,GAAY,KE1C7B,SAAgBE,IAAM,WAAc,OAAOG,eACvCH,IAAM,WAAc,OAAOI,WAC3BJ,IAAM,WAAc,OAAOzvD,SAC3ByvD,IAAM,WAAc,OAAO,EAAAv1C,MAC3Bu1C,IAAM,WAAc,OAAOr9C,SAAS,cAATA,MCH/B,IAAI4gC,GAAK,KACL8c,GAAa,CAAC9c,GAAIA,IAAIntC,KAAK,OAe/B,SAdA,WACI,IACI,OAAO+uC,QAAQmb,SAEnB,MAAOf,GAOH,OANA9tD,OAAOuJ,eAAexK,GAAQ6vD,GAAY,CACtCluD,MAA+D,eAAxD6tD,IAAM,WAAc,MAAO,gBAClClY,YAAY,EACZC,cAAc,EACdF,UAAU,IAEPr3C,GAAO6vD,KAGtB,GClBA,SAAS,GAAMJ,GACb,IAAM,OAAOA,IAAU,MAAOlmC,KAGhC,IAAIwmC,GACF,IAAM,WAAa,OAAOJ,eAC1B,IAAM,WAAa,OAAOC,WAC1B,IAAM,WAAa,OAAO7vD,SAC1B,IAAM,WAAa,OAAO,EAAAka,MAC1B,IAAM,WAAa,OAAO9H,SAAS,cAATA,MAGxB69C,IAAe,ECRnB,SAASC,GAAkBC,EAAKrU,IAAkB,MAAPA,GAAeA,EAAMqU,EAAIzqD,UAAQo2C,EAAMqU,EAAIzqD,QAAQ,IAAK,IAAIC,EAAI,EAAGyqD,EAAO,IAAI3tD,MAAMq5C,GAAMn2C,EAAIm2C,EAAKn2C,IAAOyqD,EAAKzqD,GAAKwqD,EAAIxqD,GAAM,OAAOyqD,EAEhL,SAASC,GAAkB1oB,EAAQ9vB,GAAS,IAAK,IAAIlS,EAAI,EAAGA,EAAIkS,EAAMnS,OAAQC,IAAK,CAAE,IAAI2qD,EAAaz4C,EAAMlS,GAAI2qD,EAAW/Y,WAAa+Y,EAAW/Y,aAAc,EAAO+Y,EAAW9Y,cAAe,EAAU,UAAW8Y,IAAYA,EAAWhZ,UAAW,GAAMp2C,OAAOuJ,eAAek9B,EAAQ2oB,EAAW5mD,IAAK4mD,IAE7S,SAASC,GAAaC,EAAaC,EAAYC,GAAmJ,OAAhID,GAAYJ,GAAkBG,EAAYjwD,UAAWkwD,GAAiBC,GAAaL,GAAkBG,EAAaE,GAAqBF,GDOnMR,IACC,IAAM,WAAa,MAAO,iBAC1B,IAAM,WAAa,OAAO/yC,aAC7B/b,OAAOuJ,eAAeulD,GAAY,UAAW,CAC3CpuD,MAAO,CACL+uD,IAAK,CAIHC,SAAU,eAKdpZ,cAAc,EACdD,YAAY,EACZD,UAAU,IAEZ2Y,IAAe,GAQbA,YACKD,GAAW/yC,QAClBgzC,IAAe,GEvCfF,QAAU,GAAU,kBAAqBc,GAAKA,IAAO,GAAU,kBAAqBA,GAAK,IDO7F,IAAIC,GAAa,WACf,MAAyB,mBAAXrwD,QAGZswD,GAAY,SAAUzvD,GACxB,OAAOwvD,MAAgBlc,QAAQn0C,OAAOa,KAGpC0vD,GAAY,SAAU1vD,GACxB,OAAOyvD,GAAUzvD,GAAQb,OAAOa,GAAQ,KAAOA,GAG7CwvD,OAAiBC,GAAU,gBAC7BtwD,OAAOwwD,WAAaxwD,OAAO,eAG7B,IAAIywD,GAAiBF,GAAU,YAC3BG,GAAmBH,GAAU,cAC7BI,GAAgBJ,GAAU,WAE9B,SAASK,GAAUrwD,EAAK0I,GACtB,IAAI9H,EAAQZ,EAAI0I,GAChB,GAAa,MAAT9H,EAAJ,CACA,GAAqB,mBAAVA,EAAsB,MAAM,IAAIH,UAAUG,EAAQ,sBAC7D,OAAOA,GAGT,SAAS0vD,GAAWtwD,GAClB,IAAIuwD,EAAOvwD,EAAI8H,YAUf,YARa3G,IAATovD,GAGW,QAFbA,EAAOA,EAAKH,OAGVG,OAAOpvD,QAIKA,IAATovD,EAAqBA,EAAOC,GAGrC,SAASC,GAAatf,GACpB,OAAOA,aAAaqf,GAGtB,SAASE,GAAgB/wD,GACnB+wD,GAAgBlC,IAClBkC,GAAgBlC,IAAI7uD,GAEpB0pB,YAAW,WACT,MAAM1pB,KAKZ,SAASgxD,GAAQp7B,GACfvzB,QAAQI,UAAUkC,MAAK,WACrB,IACEixB,IACA,MAAO51B,GACP+wD,GAAgB/wD,OAKtB,SAASixD,GAAoBtD,GAC3B,IAAIuD,EAAUvD,EAAawD,SAC3B,QAAgB3vD,IAAZ0vD,IACJvD,EAAawD,cAAW3vD,EAEnB0vD,GAIL,IACE,GAAuB,mBAAZA,EACTA,QACK,CACL,IAAIE,EAAcV,GAAUQ,EAAS,eAEjCE,GACFA,EAAY3wD,KAAKywD,IAGrB,MAAOlxD,GACP+wD,GAAgB/wD,IAIpB,SAASqxD,GAAkB1D,GACzBA,EAAa2D,eAAY9vD,EACzBmsD,EAAa4D,YAAS/vD,EACtBmsD,EAAa6D,OAAS,SAmBxB,SAASC,GAAmB9D,EAAcppD,EAAMtD,GAC9C0sD,EAAa6D,OAAS,UACtB,IAAIE,EAAW/D,EAAa2D,UAE5B,IACE,IAAIK,EAAIjB,GAAUgB,EAAUntD,GAE5B,OAAQA,GACN,IAAK,OACCotD,GAAGA,EAAElxD,KAAKixD,EAAUzwD,GACxB,MAEF,IAAK,QAEH,GADAowD,GAAkB1D,IACdgE,EAAgC,MAAM1wD,EAAnC0wD,EAAElxD,KAAKixD,EAAUzwD,GACxB,MAEF,IAAK,WACHowD,GAAkB1D,GACdgE,GAAGA,EAAElxD,KAAKixD,IAGlB,MAAO1xD,GACP+wD,GAAgB/wD,GAGU,WAAxB2tD,EAAa6D,OAAqBP,GAAoBtD,GAA+C,YAAxBA,EAAa6D,SAAsB7D,EAAa6D,OAAS,SAG5I,SAASI,GAASjE,EAAcppD,EAAMtD,GACpC,GAA4B,WAAxB0sD,EAAa6D,OAAjB,CAEA,GAA4B,cAAxB7D,EAAa6D,OASjB,MAA4B,UAAxB7D,EAAa6D,QACf7D,EAAa6D,OAAS,YACtB7D,EAAa4D,OAAS,CAAC,CACrBhtD,KAAMA,EACNtD,MAAOA,SAET+vD,IAAQ,WACN,OAhEN,SAA2BrD,GACzB,IAAIkE,EAAQlE,EAAa4D,OAEzB,GAAKM,EAAL,CAIAlE,EAAa4D,YAAS/vD,EACtBmsD,EAAa6D,OAAS,QAEtB,IAAK,IAAIxsD,EAAI,EAAGA,EAAI6sD,EAAM9sD,SACxB0sD,GAAmB9D,EAAckE,EAAM7sD,GAAGT,KAAMstD,EAAM7sD,GAAG/D,OAC7B,WAAxB0sD,EAAa6D,UAFiBxsD,KAsDzB8sD,CAAkBnE,YAK7B8D,GAAmB9D,EAAcppD,EAAMtD,GApBrC0sD,EAAa4D,OAAOxrD,KAAK,CACvBxB,KAAMA,EACNtD,MAAOA,KAqBb,IAAI8wD,GAA4B,WAC9B,SAASA,EAAaL,EAAUM,GAG9BzyD,KAAK4xD,cAAW3vD,EAChBjC,KAAK+xD,UAAYI,EACjBnyD,KAAKgyD,YAAS/vD,EACdjC,KAAKiyD,OAAS,eACd,IAAIS,EAAuB,IAAIC,GAAqB3yD,MAEpD,IACEA,KAAK4xD,SAAWa,EAAWvxD,UAAKe,EAAWywD,GAC3C,MAAOjyD,GACPiyD,EAAqBpvD,MAAM7C,GAGT,iBAAhBT,KAAKiyD,SAA2BjyD,KAAKiyD,OAAS,SAmBpD,OAhBaO,EAAanyD,UAEnBwxD,YAAc,WACC,WAAhB7xD,KAAKiyD,SACPH,GAAkB9xD,MAClB0xD,GAAoB1xD,QAIxBqwD,GAAamC,EAAc,CAAC,CAC1BhpD,IAAK,SACLzE,IAAK,WACH,MAAuB,WAAhB/E,KAAKiyD,WAITO,EAnCuB,GAsC5BG,GAAoC,WACtC,SAASA,EAAqBvE,GAC5BpuD,KAAK4yD,cAAgBxE,EAGvB,IAAIyE,EAAUF,EAAqBtyD,UAqBnC,OAnBAwyD,EAAQ/wD,KAAO,SAAcJ,GAC3B2wD,GAASryD,KAAK4yD,cAAe,OAAQlxD,IAGvCmxD,EAAQvvD,MAAQ,SAAe5B,GAC7B2wD,GAASryD,KAAK4yD,cAAe,QAASlxD,IAGxCmxD,EAAQC,SAAW,WACjBT,GAASryD,KAAK4yD,cAAe,aAG/BvC,GAAasC,EAAsB,CAAC,CAClCnpD,IAAK,SACLzE,IAAK,WACH,MAAqC,WAA9B/E,KAAK4yD,cAAcX,WAIvBU,EA1B+B,GA6BpCrB,GAA0B,WAC5B,SAASA,EAAWmB,GAClB,KAAMzyD,gBAAgBsxD,GAAa,MAAM,IAAI/vD,UAAU,6CACvD,GAA0B,mBAAfkxD,EAA2B,MAAM,IAAIlxD,UAAU,6CAC1DvB,KAAK+yD,YAAcN,EAGrB,IAAIO,EAAU1B,EAAWjxD,UAsTzB,OApTA2yD,EAAQC,UAAY,SAAmBd,GASrC,MARwB,iBAAbA,GAAsC,OAAbA,IAClCA,EAAW,CACTrwD,KAAMqwD,EACN7uD,MAAOma,UAAU,GACjBq1C,SAAUr1C,UAAU,KAIjB,IAAI+0C,GAAaL,EAAUnyD,KAAK+yD,cAGzCC,EAAQ3wD,QAAU,SAAiBg0B,GACjC,IAAI44B,EAAQjvD,KAEZ,OAAO,IAAI8C,SAAQ,SAAUI,EAASH,GACpC,GAAkB,mBAAPszB,EAUX,IAAI+3B,EAAea,EAAMgE,UAAU,CACjCnxD,KAAM,SAAUJ,GACd,IACE20B,EAAG30B,EAAOM,GACV,MAAOvB,GACPsC,EAAOtC,GACP2tD,EAAayD,gBAGjBvuD,MAAOP,EACP+vD,SAAU5vD,SAnBVH,EAAO,IAAIxB,UAAU80B,EAAK,uBAI5B,SAASr0B,IACPosD,EAAayD,cACb3uD,SAkBN8vD,EAAQ5wD,IAAM,SAAai0B,GACzB,IAAI68B,EAASlzD,KAEb,GAAkB,mBAAPq2B,EAAmB,MAAM,IAAI90B,UAAU80B,EAAK,sBAEvD,OAAO,IADC+6B,GAAWpxD,MACZ,EAAM,SAAUmyD,GACrB,OAAOe,EAAOD,UAAU,CACtBnxD,KAAM,SAAUJ,GACd,IACEA,EAAQ20B,EAAG30B,GACX,MAAOjB,GACP,OAAO0xD,EAAS7uD,MAAM7C,GAGxB0xD,EAASrwD,KAAKJ,IAEhB4B,MAAO,SAAU7C,GACf0xD,EAAS7uD,MAAM7C,IAEjBqyD,SAAU,WACRX,EAASW,kBAMjBE,EAAQrvB,OAAS,SAAgBtN,GAC/B,IAAI88B,EAASnzD,KAEb,GAAkB,mBAAPq2B,EAAmB,MAAM,IAAI90B,UAAU80B,EAAK,sBAEvD,OAAO,IADC+6B,GAAWpxD,MACZ,EAAM,SAAUmyD,GACrB,OAAOgB,EAAOF,UAAU,CACtBnxD,KAAM,SAAUJ,GACd,IACE,IAAK20B,EAAG30B,GAAQ,OAChB,MAAOjB,GACP,OAAO0xD,EAAS7uD,MAAM7C,GAGxB0xD,EAASrwD,KAAKJ,IAEhB4B,MAAO,SAAU7C,GACf0xD,EAAS7uD,MAAM7C,IAEjBqyD,SAAU,WACRX,EAASW,kBAMjBE,EAAQzoB,OAAS,SAAgBlU,GAC/B,IAAI+8B,EAASpzD,KAEb,GAAkB,mBAAPq2B,EAAmB,MAAM,IAAI90B,UAAU80B,EAAK,sBACvD,IAAIg9B,EAAIjC,GAAWpxD,MACfszD,EAAU71C,UAAUjY,OAAS,EAC7B+tD,GAAW,EACXC,EAAO/1C,UAAU,GACjBg2C,EAAMD,EACV,OAAO,IAAIH,GAAE,SAAUlB,GACrB,OAAOiB,EAAOH,UAAU,CACtBnxD,KAAM,SAAUJ,GACd,IAAI2rC,GAASkmB,EAGb,GAFAA,GAAW,GAENlmB,GAASimB,EACZ,IACEG,EAAMp9B,EAAGo9B,EAAK/xD,GACd,MAAOjB,GACP,OAAO0xD,EAAS7uD,MAAM7C,QAGxBgzD,EAAM/xD,GAGV4B,MAAO,SAAU7C,GACf0xD,EAAS7uD,MAAM7C,IAEjBqyD,SAAU,WACR,IAAKS,IAAaD,EAAS,OAAOnB,EAAS7uD,MAAM,IAAI/B,UAAU,oCAC/D4wD,EAASrwD,KAAK2xD,GACdtB,EAASW,kBAMjBE,EAAQlwB,OAAS,WAGf,IAFA,IAAI4wB,EAAS1zD,KAEJ2zD,EAAOl2C,UAAUjY,OAAQyS,EAAU,IAAI1V,MAAMoxD,GAAOC,EAAO,EAAGA,EAAOD,EAAMC,IAClF37C,EAAQ27C,GAAQn2C,UAAUm2C,GAG5B,IAAIP,EAAIjC,GAAWpxD,MACnB,OAAO,IAAIqzD,GAAE,SAAUlB,GACrB,IAAI/D,EACAnjD,EAAQ,EAsBZ,OApBA,SAAS4oD,EAAU/xD,GACjBssD,EAAetsD,EAAKmxD,UAAU,CAC5BnxD,KAAM,SAAUkyC,GACdme,EAASrwD,KAAKkyC,IAEhB1wC,MAAO,SAAU7C,GACf0xD,EAAS7uD,MAAM7C,IAEjBqyD,SAAU,WACJ7nD,IAAUgN,EAAQzS,QACpB4oD,OAAensD,EACfkwD,EAASW,YAETe,EAAUR,EAAEjf,KAAKn8B,EAAQhN,UAMjC4oD,CAAUH,GACH,WACDtF,IACFA,EAAayD,cACbzD,OAAensD,QAMvB+wD,EAAQpvB,QAAU,SAAiBvN,GACjC,IAAIy9B,EAAS9zD,KAEb,GAAkB,mBAAPq2B,EAAmB,MAAM,IAAI90B,UAAU80B,EAAK,sBACvD,IAAIg9B,EAAIjC,GAAWpxD,MACnB,OAAO,IAAIqzD,GAAE,SAAUlB,GACrB,IAAIngB,EAAgB,GAEhBvjB,EAAQqlC,EAAOb,UAAU,CAC3BnxD,KAAM,SAAUJ,GACd,GAAI20B,EACF,IACE30B,EAAQ20B,EAAG30B,GACX,MAAOjB,GACP,OAAO0xD,EAAS7uD,MAAM7C,GAI1B,IAAIszD,EAAQV,EAAEjf,KAAK1yC,GAAOuxD,UAAU,CAClCnxD,KAAM,SAAUJ,GACdywD,EAASrwD,KAAKJ,IAEhB4B,MAAO,SAAU7C,GACf0xD,EAAS7uD,MAAM7C,IAEjBqyD,SAAU,WACR,IAAIrtD,EAAIusC,EAAcjxC,QAAQgzD,GAC1BtuD,GAAK,GAAGusC,EAAct1B,OAAOjX,EAAG,GACpCuuD,OAGJhiB,EAAcxrC,KAAKutD,IAErBzwD,MAAO,SAAU7C,GACf0xD,EAAS7uD,MAAM7C,IAEjBqyD,SAAU,WACRkB,OAIJ,SAASA,IACHvlC,EAAMwlC,QAAmC,IAAzBjiB,EAAcxsC,QAAc2sD,EAASW,WAG3D,OAAO,WACL9gB,EAAc3vC,SAAQ,SAAU4wC,GAC9B,OAAOA,EAAE4e,iBAEXpjC,EAAMojC,mBAKZmB,EAAQ/B,IAAoB,WAC1B,OAAOjxD,MAGTsxD,EAAWld,KAAO,SAAcnC,GAC9B,IAAIohB,EAAoB,mBAATrzD,KAAsBA,KAAOsxD,EAC5C,GAAS,MAALrf,EAAW,MAAM,IAAI1wC,UAAU0wC,EAAI,qBACvC,IAAIlrC,EAASoqD,GAAUlf,EAAGgf,IAE1B,GAAIlqD,EAAQ,CACV,IAAIgqD,EAAahqD,EAAO7F,KAAK+wC,GAC7B,GAAIjxC,OAAO+vD,KAAgBA,EAAY,MAAM,IAAIxvD,UAAUwvD,EAAa,qBACxE,OAAIQ,GAAaR,IAAeA,EAAWnoD,cAAgByqD,EAAUtC,EAC9D,IAAIsC,GAAE,SAAUlB,GACrB,OAAOpB,EAAWkC,UAAUd,MAIhC,GAAItB,GAAU,cACZ9pD,EAASoqD,GAAUlf,EAAG+e,KAGpB,OAAO,IAAIqC,GAAE,SAAUlB,GACrBV,IAAQ,WACN,IAAIU,EAAS8B,OAAb,CAEA,IAAK,IAAiEC,EAA7DC,EAzfrB,SAAyCC,EAAGC,GAAkB,IAAIC,EAAuB,oBAAX/zD,QAA0B6zD,EAAE7zD,OAAOsB,WAAauyD,EAAE,cAAe,GAAIE,EAAI,OAAQA,EAAKA,EAAGpzD,KAAKkzD,IAAItyD,KAAK+5B,KAAKy4B,GAAK,GAAI/xD,MAAMC,QAAQ4xD,KAAOE,EAExN,SAAqCF,EAAGG,GAAU,GAAKH,EAAL,CAAgB,GAAiB,iBAANA,EAAgB,OAAOpE,GAAkBoE,EAAGG,GAAS,IAAI3+C,EAAI5U,OAAOX,UAAUY,SAASC,KAAKkzD,GAAGtwD,MAAM,GAAI,GAAiE,MAAnD,WAAN8R,GAAkBw+C,EAAExrD,cAAagN,EAAIw+C,EAAExrD,YAAYxH,MAAgB,QAANwU,GAAqB,QAANA,EAAoBrT,MAAM6xC,KAAKggB,GAAc,cAANx+C,GAAqB,2CAA2CtU,KAAKsU,GAAWo6C,GAAkBoE,EAAGG,QAAzG,GAFhFC,CAA4BJ,KAAOC,GAAkBD,GAAyB,iBAAbA,EAAE5uD,OAAqB,CAAM8uD,IAAIF,EAAIE,GAAI,IAAI7uD,EAAI,EAAG,OAAO,WAAc,OAAIA,GAAK2uD,EAAE5uD,OAAe,CAAExD,MAAM,GAAe,CAAEA,MAAM,EAAON,MAAO0yD,EAAE3uD,OAAa,MAAM,IAAIlE,UAAU,yIAyfhbkzD,CAAgC1tD,EAAO7F,KAAK+wC,MAAciiB,EAAQC,KAAanyD,MAAO,CACzG,IAAIihD,EAAOiR,EAAMxyD,MAEjB,GADAywD,EAASrwD,KAAKmhD,GACVkP,EAAS8B,OAAQ,OAGvB9B,EAASW,kBAMjB,GAAIvwD,MAAMC,QAAQyvC,GAChB,OAAO,IAAIohB,GAAE,SAAUlB,GACrBV,IAAQ,WACN,IAAIU,EAAS8B,OAAb,CAEA,IAAK,IAAIxuD,EAAI,EAAGA,EAAIwsC,EAAEzsC,SAAUC,EAE9B,GADA0sD,EAASrwD,KAAKmwC,EAAExsC,IACZ0sD,EAAS8B,OAAQ,OAGvB9B,EAASW,kBAKf,MAAM,IAAIvxD,UAAU0wC,EAAI,uBAG1Bqf,EAAWoD,GAAK,WACd,IAAK,IAAIC,EAAQl3C,UAAUjY,OAAQ5D,EAAQ,IAAIW,MAAMoyD,GAAQC,EAAQ,EAAGA,EAAQD,EAAOC,IACrFhzD,EAAMgzD,GAASn3C,UAAUm3C,GAG3B,IAAIvB,EAAoB,mBAATrzD,KAAsBA,KAAOsxD,EAC5C,OAAO,IAAI+B,GAAE,SAAUlB,GACrBV,IAAQ,WACN,IAAIU,EAAS8B,OAAb,CAEA,IAAK,IAAIxuD,EAAI,EAAGA,EAAI7D,EAAM4D,SAAUC,EAElC,GADA0sD,EAASrwD,KAAKF,EAAM6D,IAChB0sD,EAAS8B,OAAQ,OAGvB9B,EAASW,mBAKfzC,GAAaiB,EAAY,KAAM,CAAC,CAC9B9nD,IAAK0nD,GACLnsD,IAAK,WACH,OAAO/E,SAIJsxD,EA7TqB,GErPvB,SAASuD,GAAgB/zD,GAC5B,OAAe,OAARA,GAA+B,iBAARA,ECC3B,SAASg0D,GAAyBC,EAAUxN,GAC/C,IAAIyN,EAAqBzN,EACrB0N,EAAY,GAgChB,OA/BAF,EAAS5U,YAAY99C,SAAQ,SAAU6yD,GACnC,GAAwB,wBAApBA,EAAWjd,KACX,MAAM4X,QAAU,IAAId,GAAe,WAAamG,EAAW5T,UAAY,cAAgB4T,EAAW9zD,KAAO,WAAa8zD,EAAW9zD,KAAKM,MAAQ,IAAM,IAAjH,6FAC8D,IAAIqtD,GAAe,IAEhG,uBAApBmG,EAAWjd,MACXgd,EAAUzuD,KAAK0uD,WAGW,IAAvBF,IACPnF,QAAU,GAA+B,IAArBoF,EAAUzvD,OAAc,SAAWyvD,EAAUzvD,OAAS,qFAAuF,GAA+B,IAArByvD,EAAUzvD,OAAc,IACnMwvD,EAAqBC,EAAU,GAAG7zD,KAAKM,OAE/BqxC,EAASA,EAAS,GAAIgiB,GAAW,CAAE5U,YAAajM,GAAc,CAClE,CACI+D,KAAM,sBACNqJ,UAAW,QACXI,aAAc,CACVzJ,KAAM,eACNwK,WAAY,CACR,CACIxK,KAAM,iBACN72C,KAAM,CACF62C,KAAM,OACNv2C,MAAOszD,QAM5BD,EAAS5U,aAAa,KAG1B,SAASgV,GAAkBF,QACZ,IAAdA,IAAwBA,EAAY,IACxC,IAAIG,EAAW,GAIf,OAHAH,EAAU5yD,SAAQ,SAAUgzD,GACxBD,EAASC,EAASj0D,KAAKM,OAAS2zD,KAE7BD,EAEJ,SAASE,GAAyBC,EAAWC,GAChD,OAAQD,EAAUtd,MACd,IAAK,iBACD,OAAOsd,EACX,IAAK,iBACD,IAAIF,EAAWG,GAAeA,EAAYD,EAAUn0D,KAAKM,OAEzD,OADAmuD,QAAU,GAAUwF,EAAU,qBAAuBE,EAAUn0D,KAAKM,MAAQ,KAAO,GAAU2zD,EAAU,IAChGA,EAEX,QACI,OAAO,MCrDZ,SAASI,GAAc1iC,GAC1B,MAAO,CAAE2iC,MAAOr0D,OAAO0xB,IAEpB,SAAS4iC,GAAY70D,GACxB,OAAO4zC,QAAQ5zC,GAAsB,iBAARA,GAAyC,iBAAdA,EAAI40D,OAkCzD,SAASE,GAA4BC,EAAQz0D,EAAMM,EAAOknD,GAC7D,GAtBJ,SAAoBlnD,GAChB,MAAsB,aAAfA,EAAMu2C,KAqBT6d,CAAWp0D,IAnBnB,SAAsBA,GAClB,MAAsB,eAAfA,EAAMu2C,KAkBY8d,CAAar0D,GAClCm0D,EAAOz0D,EAAKM,OAASs0D,OAAOt0D,EAAMA,YAEjC,GA5BT,SAAwBA,GACpB,MAAsB,iBAAfA,EAAMu2C,KA2BJge,CAAev0D,IA/B5B,SAAuBA,GACnB,MAAsB,gBAAfA,EAAMu2C,KA8BqBie,CAAcx0D,GAC5Cm0D,EAAOz0D,EAAKM,OAASA,EAAMA,WAE1B,GAnBT,SAAuBA,GACnB,MAAsB,gBAAfA,EAAMu2C,KAkBJke,CAAcz0D,GAAQ,CAC3B,IAAI00D,EAAiB,GACrB10D,EAAMyiD,OAAO/hD,KAAI,SAAUtB,GACvB,OAAO80D,GAA4BQ,EAAgBt1D,EAAIM,KAAMN,EAAIY,MAAOknD,MAE5EiN,EAAOz0D,EAAKM,OAAS00D,OAEpB,GA7BT,SAAoB10D,GAChB,MAAsB,aAAfA,EAAMu2C,KA4BJoe,CAAW30D,GAAQ,CACxB,IAAI40D,GAAiB1N,GAAa,IAAIlnD,EAAMN,KAAKM,OACjDm0D,EAAOz0D,EAAKM,OAAS40D,OAEpB,GA3BT,SAAqB50D,GACjB,MAAsB,cAAfA,EAAMu2C,KA0BJse,CAAY70D,GACjBm0D,EAAOz0D,EAAKM,OAASA,EAAM+E,OAAOrE,KAAI,SAAUo0D,GAC5C,IAAIC,EAAoB,GAExB,OADAb,GAA4Ba,EAAmBr1D,EAAMo1D,EAAW5N,GACzD6N,EAAkBr1D,EAAKM,eAGjC,GA/BT,SAAqBA,GACjB,MAAsB,cAAfA,EAAMu2C,KA8BJye,CAAYh1D,GACjBm0D,EAAOz0D,EAAKM,OAASA,EAAMA,UAE1B,KA/BT,SAAqBA,GACjB,MAAsB,cAAfA,EAAMu2C,KA8BJ0e,CAAYj1D,GAIjB,MAAMmuD,QAAU,IAAId,GAAe,wBAA2B3tD,EAAKM,MAAQ,cAAkBA,EAAMu2C,KAAhE,6FAEA,IAAI8W,GAAe,IALtD8G,EAAOz0D,EAAKM,OAAS,MJ+ezBkvD,MACF5vD,OAAOuJ,eAAe+mD,GAAY/wD,OAAO,cAAe,CACtDmB,MAAO,CACLuZ,OAAQg2C,GACRO,gBAAiBA,IAEnBla,cAAc,IIrdlB,IAAIsf,GAAmB,CACnB,aACA,UACA,OACA,SACA,OACA,UAEOC,GAAkB71D,OAAO+9B,QAAO,SAAU+3B,EAAW7pD,EAAMw0C,GAClE,GAAIx0C,GACAw0C,GACAA,EAAuB,YACvBA,EAAuB,WAAO,IAAG,CACjC,GAAIA,EAAuB,WAAU,QACjCA,EAAuB,WAAU,OAAEj8C,OAAS,EAAG,CAC/C,IAAIuxD,EAAatV,EAAuB,WAAU,OAC5CA,EAAuB,WAAU,OACjC,GACNsV,EAAWphD,OACX,IAAIqhD,EAAiB,GAIrB,OAHAD,EAAW10D,SAAQ,SAAUmH,GACzBwtD,EAAextD,GAAOyD,EAAKzD,MAExBi4C,EAAuB,WAAO,IAAI,IAAMjG,GAAUwb,GAAkB,IAG3E,OAAOvV,EAAuB,WAAO,IAG7C,IAAIwV,EAAoBH,EACxB,GAAI7pD,EAAM,CACN,IAAIiqD,EAAkB1b,GAAUvuC,GAChCgqD,GAAqB,IAAMC,EAAkB,IAcjD,OAZIzV,GACAzgD,OAAOuF,KAAKk7C,GAAYp/C,SAAQ,SAAUmH,IACC,IAAnCotD,GAAiB71D,QAAQyI,KAEzBi4C,EAAWj4C,IAAQxI,OAAOuF,KAAKk7C,EAAWj4C,IAAMhE,OAChDyxD,GAAqB,IAAMztD,EAAM,IAAMgyC,GAAUiG,EAAWj4C,IAAQ,IAGpEytD,GAAqB,IAAMztD,MAIhCytD,IACR,CACCE,aAAc,SAAUlkB,GACpB,IAAI1iB,EAAWirB,GAEf,OADAA,GAAYvI,EACL1iB,KAGXirB,GAAY,SAA0B95C,GACtC,OAAOsE,KAAKw1C,UAAU95C,EAAO01D,KAEjC,SAASA,GAAkBxD,EAAMlyD,GAO7B,OANImzD,GAAgBnzD,KAAWa,MAAMC,QAAQd,KACzCA,EAAQV,OAAOuF,KAAK7E,GAAOiU,OAAO40B,QAAO,SAAU9zB,EAAMjN,GAErD,OADAiN,EAAKjN,GAAO9H,EAAM8H,GACXiN,IACR,KAEA/U,EAEJ,SAAS21D,GAAyBnO,EAAON,GAC5C,GAAIM,EAAMzrC,WAAayrC,EAAMzrC,UAAUjY,OAAQ,CAC3C,IAAI8xD,EAAW,GAKf,OAJApO,EAAMzrC,UAAUpb,SAAQ,SAAUysD,GAC9B,IAAI1tD,EAAO0tD,EAAG1tD,KAAMM,EAAQotD,EAAGptD,MAC/B,OAAOk0D,GAA4B0B,EAAUl2D,EAAMM,EAAOknD,MAEvD0O,EAEX,OAAO,KAEJ,SAASC,GAAuBrO,GACnC,OAAOA,EAAMpG,MAAQoG,EAAMpG,MAAMphD,MAAQwnD,EAAM9nD,KAAKM,MAEjD,SAAS81D,GAAsBp0D,EAAQs+C,EAAc8T,GACxD,GAAiC,iBAAtBpyD,EAAOq0D,WACd,OAAOr0D,EAAOq0D,WAElB,IAAK,IAAI3P,EAAK,EAAGgH,EAAKpN,EAAae,WAAYqF,EAAKgH,EAAGtpD,OAAQsiD,IAAM,CACjE,IAAIyN,EAAYzG,EAAGhH,GACnB,GAAI,GAAQyN,IACR,GAA6B,eAAzBA,EAAUn0D,KAAKM,MACf,OAAO0B,EAAOm0D,GAAuBhC,QAGxC,CACD,IAAImC,EAAWF,GAAsBp0D,EAAQkyD,GAAyBC,EAAWC,GAAa9T,aAAc8T,GAC5G,GAAwB,iBAAbkC,EACP,OAAOA,IAKhB,SAAS,GAAQnC,GACpB,MAA0B,UAAnBA,EAAUtd,KAEd,SAAS0f,GAAiBpC,GAC7B,MAA0B,mBAAnBA,EAAUtd,KC3Md,SAAS2f,GAAczQ,GAC1B0I,QAAU,GAAU1I,GAAoB,aAAbA,EAAIlP,KAAqB,0JAA8J,GAAUkP,GAAoB,aAAbA,EAAIlP,KAAqB,IAC5P,IAAI4f,EAAa1Q,EAAIhH,YAChBxc,QAAO,SAAU6O,GAAK,MAAkB,uBAAXA,EAAEyF,QAC/B71C,KAAI,SAAU8yD,GACf,GAAwB,wBAApBA,EAAWjd,KACX,MAAM4X,QAAU,IAAId,GAAe,2DAA8DmG,EAAWjd,KAAO,KAAQ,IAAI8W,GAAe,IAElJ,OAAOmG,KAGX,OADArF,QAAU,GAAUgI,EAAWryD,QAAU,EAAG,wCAA0CqyD,EAAWryD,OAAS,eAAiB,GAAUqyD,EAAWryD,QAAU,EAAG,IACtJ2hD,EAEJ,SAAS2Q,GAAuB3Q,GAEnC,OADAyQ,GAAczQ,GACPA,EAAIhH,YAAYxc,QAAO,SAAUuxB,GAAc,MAA2B,wBAApBA,EAAWjd,QAAmC,GAExG,SAAS8f,GAAiB5Q,GAC7B,OAAQA,EAAIhH,YACPxc,QAAO,SAAUuxB,GAClB,MAA2B,wBAApBA,EAAWjd,MAAkCid,EAAW9zD,QAE9DgB,KAAI,SAAU6vC,GAAK,OAAOA,EAAE7wC,KAAKM,SAAU,IAAM,KAEnD,SAASs2D,GAAuB7Q,GACnC,OAAOA,EAAIhH,YAAYxc,QAAO,SAAUuxB,GAAc,MAA2B,uBAApBA,EAAWjd,QAErE,SAASggB,GAAmB9Q,GAC/B,IAAI+Q,EAAWJ,GAAuB3Q,GAEtC,OADA0I,QAAU,GAAUqI,GAAmC,UAAvBA,EAAS5W,UAAuB,oCAAsC,GAAU4W,GAAmC,UAAvBA,EAAS5W,UAAuB,IACrJ4W,EASJ,SAASC,GAAkBC,GAE9B,IAAI9Q,EADJsQ,GAAcQ,GAEd,IAAK,IAAItQ,EAAK,EAAGgH,EAAKsJ,EAASjY,YAAa2H,EAAKgH,EAAGtpD,OAAQsiD,IAAM,CAC9D,IAAIoN,EAAapG,EAAGhH,GACpB,GAAwB,wBAApBoN,EAAWjd,KAAgC,CAC3C,IAAIqJ,EAAY4T,EAAW5T,UAC3B,GAAkB,UAAdA,GACc,aAAdA,GACc,iBAAdA,EACA,OAAO4T,EAGS,uBAApBA,EAAWjd,MAAkCqP,IAC7CA,EAAqB4N,GAG7B,GAAI5N,EACA,OAAOA,EAEX,MAAMuI,QAAU,IAAId,GAAe,wFAA0F,IAAIA,GAAe,IAE7I,SAASsJ,GAAiBnD,GAC7B,IAAIoD,EAAgBt3D,OAAO2H,OAAO,MAC9B4vD,EAAOrD,GAAcA,EAAW1T,oBAQpC,OAPI+W,GAAQA,EAAK/yD,QACb+yD,EAAKl2D,SAAQ,SAAUm2D,GACfA,EAAI15C,cACJ82C,GAA4B0C,EAAeE,EAAIpsB,SAAShrC,KAAMo3D,EAAI15C,iBAIvEw5C,ECrEX,SAASG,GAAYxkB,EAAIykB,GACrB,OAAQA,EAAUA,EAAQzkB,GAAMqd,GAAWoD,KAE/C,SAASiE,GAAOC,GACZ,MAA0B,mBAAZA,EAAyB,IAAIC,GAAWD,GAAWA,EAErE,SAASE,GAAcC,GACnB,OAAOA,EAAKjwD,QAAQtD,QAAU,EAElC,IAAIwzD,GAAa,SAAUhK,GAEvB,SAASgK,EAAUvwD,EAASswD,GACxB,IAAI9J,EAAQD,EAAO9tD,KAAKlB,KAAMyI,IAAYzI,KAE1C,OADAivD,EAAM8J,KAAOA,EACN9J,EAEX,OANApc,EAAUmmB,EAAWhK,GAMdgK,EAPK,CAQd9zD,OACE2zD,GAAc,WACd,SAASA,EAAW/vD,GACZA,IACA9I,KAAK8I,QAAUA,GAuEvB,OArEA+vD,EAAWI,MAAQ,WACf,OAAO,IAAIJ,GAAW,WAAc,OAAOvH,GAAWoD,SAE1DmE,EAAWzkB,KAAO,SAAU8kB,GACxB,OAAqB,IAAjBA,EAAM1zD,OACCqzD,EAAWI,QACfC,EAAM92D,IAAIu2D,IAAQpuB,QAAO,SAAU0H,EAAGyB,GAAK,OAAOzB,EAAEnP,OAAO4Q,OAEtEmlB,EAAWpxD,MAAQ,SAAUnG,EAAM63D,EAAMC,GACrC,IAAIC,EAAWV,GAAOQ,GAClBG,EAAYX,GAAOS,GAAS,IAAIP,EAAWJ,KAC/C,OAAIK,GAAcO,IAAaP,GAAcQ,GAClC,IAAIT,GAAW,SAAUvX,GAC5B,OAAOhgD,EAAKggD,GACN+X,EAASvwD,QAAQw4C,IAAcgQ,GAAWoD,KAC1C4E,EAAUxwD,QAAQw4C,IAAcgQ,GAAWoD,QAI9C,IAAImE,GAAW,SAAUvX,EAAWoX,GACvC,OAAOp3D,EAAKggD,GACN+X,EAASvwD,QAAQw4C,EAAWoX,IAAYpH,GAAWoD,KACnD4E,EAAUxwD,QAAQw4C,EAAWoX,IAAYpH,GAAWoD,SAItEmE,EAAWU,QAAU,SAAUR,EAAMzX,GACjC,OAAQyX,EAAKjwD,QCrDd,SAAyB0wD,EAAUlY,GACtC,IAAI93B,EAAUupB,EAAS,GAAIymB,GAkB3B,OARAx4D,OAAOuJ,eAAe+2C,EAAW,aAAc,CAC3CjK,YAAY,EACZ31C,MAXa,SAAUI,GAEnB0nB,EAAUupB,EAASA,EAAS,GAAIvpB,GADhB,mBAAT1nB,EACmCA,EAAK0nB,GAGL1nB,MAQlDd,OAAOuJ,eAAe+2C,EAAW,aAAc,CAC3CjK,YAAY,EACZ31C,MAPa,WAAc,OAAQqxC,EAAS,GAAIvpB,MAS7C83B,EDkCkBmY,CAAgBnY,EAAU93B,QErDhD,SAA4B83B,GAC/B,IAAIoY,EAAuB,CACvB9Q,UAAWtH,EAAUsH,WAAa,GAClCrS,WAAY+K,EAAU/K,YAAc,GACpCojB,cAAerY,EAAUqY,cACzBhR,MAAOrH,EAAUqH,OAQrB,OANK+Q,EAAqBC,gBACtBD,EAAqBC,cACqB,iBAA/BD,EAAqB/Q,MACtBoP,GAAiB2B,EAAqB/Q,aAAU1mD,EAChD,IAEPy3D,EFwCqDE,CGrDzD,SAA2BtY,GAQ9B,IAPA,IAAIuY,EAAmB,CACnB,QACA,gBACA,YACA,aACA,WAEK/R,EAAK,EAAGgH,EAAK9tD,OAAOuF,KAAK+6C,GAAYwG,EAAKgH,EAAGtpD,OAAQsiD,IAAM,CAChE,IAAIt+C,EAAMslD,EAAGhH,GACb,GAAI+R,EAAiB94D,QAAQyI,GAAO,EAChC,MAAMqmD,QAAU,IAAId,GAAe,qBAAuBvlD,GAAO,IAAIulD,GAAe,IAG5F,OAAOzN,EHuCwEwY,CAAkBxY,OAAiBgQ,GAAWoD,MAE7HmE,EAAW/1B,OAAS,SAAUuK,EAAO0sB,GACjC,IAAIC,EAAYrB,GAAOtrB,GACvB,GAAIyrB,GAAckB,GAEd,OADAnK,SAAW,QAAe,IAAImJ,GAAU,0EAA2EgB,IAC5GA,EAEX,IAAIC,EAAWtB,GAAOoB,GACtB,OAAIjB,GAAcmB,GACP,IAAIpB,GAAW,SAAUvX,GAC5B,OAAO0Y,EAAUlxD,QAAQw4C,GAAW,SAAUrN,GAAM,OAAOgmB,EAASnxD,QAAQmrC,IAAOqd,GAAWoD,SAAYpD,GAAWoD,QAIlH,IAAImE,GAAW,SAAUvX,EAAWoX,GACvC,OAAQsB,EAAUlxD,QAAQw4C,GAAW,SAAUrN,GAC3C,OAAOgmB,EAASnxD,QAAQmrC,EAAIykB,IAAYpH,GAAWoD,SACjDpD,GAAWoD,SAI7BmE,EAAWx4D,UAAUoH,MAAQ,SAAUnG,EAAM63D,EAAMC,GAC/C,OAAOp5D,KAAK8iC,OAAO+1B,EAAWpxD,MAAMnG,EAAM63D,EAAMC,GAAS,IAAIP,EAAWJ,OAE5EI,EAAWx4D,UAAUyiC,OAAS,SAAUhhC,GACpC,OAAO+2D,EAAW/1B,OAAO9iC,KAAM8B,IAEnC+2D,EAAWx4D,UAAUyI,QAAU,SAAUw4C,EAAWoX,GAChD,MAAM7I,QAAU,IAAId,GAAe,8BAAgC,IAAIA,GAAe,KAE1F8J,EAAWx4D,UAAU65D,QAAU,SAAU52D,EAAO6uD,GAC5C,GAAIA,GAAYA,EAAS7uD,MAErB,OADA6uD,EAAS7uD,MAAMA,IACR,EAEX,MAAMA,GAEVu1D,EAAWx4D,UAAU85D,WAAa,SAAU9jC,GAExC,OADAr2B,KAAKk6D,QAAU7jC,EACRr2B,MAEJ64D,EA1EM,GIbV,MAAMuB,GAAQp5D,OAAOq5D,OAAO,IAgF5B,SAASC,GAAM96D,EAAM+6D,EAASC,EAAcriB,IACjD,MAAMsiB,EAAgB,IAAI/uD,IAE1B,IAAK,MAAMusC,KAAQj3C,OAAOyF,OAAO,IAC/Bg0D,EAAcv2D,IAAI+zC,EAAMyiB,GAAqBH,EAAStiB,IAIxD,IAAIvvC,EAKAouC,EACAttC,EACAomB,EANA+qC,EAAUp4D,MAAMC,QAAQhD,GACxB+G,EAAO,CAAC/G,GACRyL,GAAS,EACT2vD,EAAQ,GAIZ,MAAMrrD,EAAO,GACPsrD,EAAY,GAClB,IAAIC,EAAUt7D,EAGd,EAAG,CACDyL,IACA,MAAM8vD,EAAY9vD,IAAU1E,EAAKf,OAC3Bw1D,EAAWD,GAA8B,IAAjBH,EAAMp1D,OAEpC,GAAIu1D,EAAW,CAKb,GAJAvxD,EAA2B,IAArBqxD,EAAUr1D,YAAevD,EAAYsN,EAAKA,EAAK/J,OAAS,GAC9DsxC,EAAOlnB,EACPA,EAASirC,EAAUl+C,MAEfq+C,EACF,GAAIL,EAAS,CACX7jB,EAAOA,EAAKhzC,QACZ,IAAIm3D,EAAa,EAEjB,IAAK,MAAOC,EAASC,KAAcP,EAAO,CACxC,MAAMQ,EAAWF,EAAUD,EAET,OAAdE,GACFrkB,EAAKp6B,OAAO0+C,EAAU,GACtBH,KAEAnkB,EAAKskB,GAAYD,OAGhB,CACLrkB,EAAO91C,OAAOm2C,iBACZ,GACAn2C,OAAOq6D,0BAA0BvkB,IAGnC,IAAK,MAAOokB,EAASC,KAAcP,EACjC9jB,EAAKokB,GAAWC,EAKtBlwD,EAAQvC,EAAMuC,MACd1E,EAAOmC,EAAMnC,KACbq0D,EAAQlyD,EAAMkyD,MACdD,EAAUjyD,EAAMiyD,QAChBjyD,EAAQA,EAAMwvC,SACT,CAIL,GAHA1uC,EAAMomB,EAAU+qC,EAAU1vD,EAAQ1E,EAAK0E,QAAUhJ,EACjD60C,EAAOlnB,EAASA,EAAOpmB,GAAOsxD,EAE1BhkB,MAAAA,EACF,SAGElnB,GACFrgB,EAAK/I,KAAKgD,GAId,IAAIpG,EAEJ,IAAKb,MAAMC,QAAQs0C,GAAO,CACxB,IAAIwkB,EAAoBC,EAExBvgB,GAAOlE,IAASmF,IAAU,EAAO,qBAAqBZ,GAAQvE,OAC9D,MAAM0kB,EAAUT,EAC4C,QAAvDO,EAAqBb,EAAc11D,IAAI+xC,EAAKmB,aACtB,IAAvBqjB,OACE,EACAA,EAAmBG,MACoC,QAAxDF,EAAsBd,EAAc11D,IAAI+xC,EAAKmB,aACtB,IAAxBsjB,OACA,EACAA,EAAoBG,MAMxB,GALAt4D,EACEo4D,MAAAA,OACI,EACAA,EAAQt6D,KAAKq5D,EAASzjB,EAAMttC,EAAKomB,EAAQrgB,EAAMsrD,GAEjDz3D,IAAWg3D,GACb,MAGF,IAAe,IAAXh3D,GACF,IAAK23D,EAAW,CACdxrD,EAAKoN,MACL,eAEG,QAAe1a,IAAXmB,IACTw3D,EAAMp0D,KAAK,CAACgD,EAAKpG,KAEZ23D,GAAW,CACd,IAAI/f,GAAO53C,GAEJ,CACLmM,EAAKoN,MACL,SAHAm6B,EAAO1zC,GAgBb,IAAIu4D,OAPS15D,IAAXmB,GAAwB43D,GAC1BJ,EAAMp0D,KAAK,CAACgD,EAAKstC,IAGfikB,EACFxrD,EAAKoN,OAILjU,EAAQ,CACNiyD,QAAAA,EACA1vD,MAAAA,EACA1E,KAAAA,EACAq0D,MAAAA,EACA1iB,KAAMxvC,GAERiyD,EAAUp4D,MAAMC,QAAQs0C,GACxBvwC,EAAOo0D,EACH7jB,EAC0C,QAAzC6kB,EAAanB,EAAY1jB,EAAKmB,aAChB,IAAf0jB,EACAA,EACA,GACJ1wD,GAAS,EACT2vD,EAAQ,GAEJhrC,GACFirC,EAAUr0D,KAAKopB,GAGjBA,EAASknB,cAEM70C,IAAVyG,GAMT,OAJqB,IAAjBkyD,EAAMp1D,SACRs1D,EAAUF,EAAMA,EAAMp1D,OAAS,GAAG,IAG7Bs1D,EAqFF,SAASJ,GAAqBH,EAAStiB,GAC5C,MAAM2jB,EAAcrB,EAAQtiB,GAE5B,MAA2B,iBAAhB2jB,EAEFA,EACyB,mBAAhBA,EAET,CACLF,MAAOE,EACPH,WAAOx5D,GAIJ,CACLy5D,MAAOnB,EAAQmB,MACfD,MAAOlB,EAAQkB,OC1VZ,IAAII,GAA0B,SAAUjpB,EAAGe,GAC9C,IAAImoB,EACJ,IACIA,EAAa91D,KAAKw1C,UAAU5I,GAEhC,MAAOnyC,GACH,IAAIs7D,EAAalM,QAAU,IAAId,GAAe,2BAA6Bpb,EAAQ,yBAA2BlzC,EAAEgI,SAAW,IAAIsmD,GAAe,IAE9I,MADAgN,EAAWA,WAAat7D,EAClBs7D,EAEV,OAAOD,GCXAE,GAAmB,SAAU7zD,EAAU/E,EAAQqF,GACtD,IAAInF,EAAQ,IAAI4B,MAAMuD,GAKtB,MAJAnF,EAAMlC,KAAO,cACbkC,EAAM6E,SAAWA,EACjB7E,EAAM24D,WAAa9zD,EAASJ,OAC5BzE,EAAMF,OAASA,EACTE,GCLN,GAAiBtC,OAAOX,UAAU+F,eCOtC,MAAM81D,GAAgB,gCAEtB,SAASC,GAAgBpf,GACvB,OAAOqf,GAAgBrf,EAAIt+B,WAAW,IAGxC,MAAM29C,GAAkB,CACtB,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,MACA,MACA,MACA,UACA,MACA,MACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,GACA,GACA,MACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,OACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,WCtKK,SAASC,GAAMtV,GACpB,OAAOuT,GAAMvT,EAAKuV,IAEpB,MACMA,GAAqB,CACzBlkB,KAAM,CACJqjB,MAAQ3kB,GAASA,EAAKp1C,OAExB82C,SAAU,CACRijB,MAAQ3kB,GAAS,IAAMA,EAAK11C,MAG9Bi3C,SAAU,CACRojB,MAAQ3kB,GAASnxC,GAAKmxC,EAAKqJ,YAAa,SAE1C7H,oBAAqB,CACnBmjB,MAAM3kB,GACJ,MAAMylB,EAAU31B,GAAK,IAAKjhC,GAAKmxC,EAAK0K,oBAAqB,MAAO,KAC1DtU,EAASvnC,GACb,CACEmxC,EAAKwK,UACL37C,GAAK,CAACmxC,EAAK11C,KAAMm7D,IACjB52D,GAAKmxC,EAAK2K,WAAY,MAExB,KAIF,OAAmB,UAAXvU,EAAqB,GAAKA,EAAS,KAAO4J,EAAK4K,eAG3DnJ,mBAAoB,CAClBkjB,MAAO,EAAGrvB,SAAAA,EAAUpnC,KAAAA,EAAM8Z,aAAAA,EAAc2iC,WAAAA,KACtCrV,EACA,KACApnC,EACA4hC,GAAK,MAAO9nB,GACZ8nB,GAAK,IAAKjhC,GAAK87C,EAAY,OAE/BhJ,aAAc,CACZgjB,MAAO,EAAGhZ,WAAAA,KAAiBwB,GAAMxB,IAEnC/J,MAAO,CACL+iB,OAAM,MAAE3Y,EAAK,KAAE1hD,EAAMqc,UAAWxQ,EAAI,WAAEw0C,EAAU,aAAEC,IAChD,MAAMxU,EAAStG,GAAK,GAAIkc,EAAO,MAAQ1hD,EACvC,IAAIo7D,EAAWtvB,EAAStG,GAAK,IAAKjhC,GAAKsH,EAAM,MAAO,KAMpD,OAJIuvD,EAASh3D,OA5CK,KA6ChBg3D,EAAWtvB,EAAStG,GAAK,MAAO8V,GAAO/2C,GAAKsH,EAAM,OAAQ,QAGrDtH,GAAK,CAAC62D,EAAU72D,GAAK87C,EAAY,KAAMC,GAAe,OAGjE/I,SAAU,CACR8iB,MAAO,EAAGr6D,KAAAA,EAAMM,MAAAA,KAAYN,EAAO,KAAOM,GAG5Ck3C,eAAgB,CACd6iB,MAAO,EAAGr6D,KAAAA,EAAMqgD,WAAAA,KACd,MAAQrgD,EAAOwlC,GAAK,IAAKjhC,GAAK87C,EAAY,OAE9C5I,eAAgB,CACd4iB,MAAO,EAAGjY,cAAAA,EAAe/B,WAAAA,EAAYC,aAAAA,KACnC/7C,GACE,CACE,MACAihC,GAAK,MAAO4c,GACZ79C,GAAK87C,EAAY,KACjBC,GAEF,MAGN5I,mBAAoB,CAClB2iB,MAAO,EACHr6D,KAAAA,EAAMoiD,cAAAA,EAAehC,oBAAAA,EAAqBC,WAAAA,EAAYC,aAAAA,KAGxD,YAAYtgD,IAAOwlC,GAAK,IAAKjhC,GAAK67C,EAAqB,MAAO,WACxDgC,KAAiB5c,GAAK,GAAIjhC,GAAK87C,EAAY,KAAM,OACvDC,GAGJ3I,SAAU,CACR0iB,MAAO,EAAG/5D,MAAAA,KAAYA,GAExBs3C,WAAY,CACVyiB,MAAO,EAAG/5D,MAAAA,KAAYA,GAExBu3C,YAAa,CACXwiB,MAAO,EAAG/5D,MAAAA,EAAOuiD,MAAOwY,KACtBA,E/BKC,SAA0B/6D,EAAOg7D,GAAsB,GAC5D,MAAMC,GAAgBj7D,EAAM6sB,SAAS,MAC/BquC,EAAkBl7D,EAAMwpC,WAAW,MAAQxpC,EAAMwpC,WAAW,MAC5D2xB,EAAmBn7D,EAAM8lC,SAAS,KAClCs1B,EAAmBp7D,EAAM8lC,SAAS,MAClCu1B,GACHJ,GACDE,GACAC,GACAJ,EACF,IAAIt5D,EAAS,GAYb,OAVI25D,GAA0BJ,GAAgBC,IAC5Cx5D,GAAU,MAGZA,GAAU1B,EAENq7D,IACF35D,GAAU,MAGL,MAAQA,EAAOuE,QAAQ,OAAQ,SAAW,M+B3B7Bq1D,CAAiBt7D,GD/F9B,IC+FmDA,ED/F3CiG,QAAQu0D,GAAeC,QCiGtCjjB,aAAc,CACZuiB,MAAO,EAAG/5D,MAAAA,KAAaA,EAAQ,OAAS,SAE1Cy3C,UAAW,CACTsiB,MAAO,IAAM,QAEfriB,UAAW,CACTqiB,MAAO,EAAG/5D,MAAAA,KAAYA,GAExB23C,UAAW,CACToiB,MAAO,EAAGh1D,OAAAA,KAAa,IAAMd,GAAKc,EAAQ,MAAQ,KAEpD6yC,YAAa,CACXmiB,MAAO,EAAGtX,OAAAA,KAAa,IAAMx+C,GAAKw+C,EAAQ,MAAQ,KAEpD5K,YAAa,CACXkiB,MAAO,EAAGr6D,KAAAA,EAAMM,MAAAA,KAAYN,EAAO,KAAOM,GAG5C83C,UAAW,CACTiiB,MAAO,EAAGr6D,KAAAA,EAAMqc,UAAWxQ,KACzB,IAAM7L,EAAOwlC,GAAK,IAAKjhC,GAAKsH,EAAM,MAAO,MAG7CwsC,UAAW,CACTgiB,MAAO,EAAGr6D,KAAAA,KAAWA,GAEvBs4C,SAAU,CACR+hB,MAAO,EAAGz2D,KAAAA,KAAW,IAAMA,EAAO,KAEpC20C,YAAa,CACX8hB,MAAO,EAAGz2D,KAAAA,KAAWA,EAAO,KAG9B40C,iBAAkB,CAChB6hB,MAAO,EAAG9jB,YAAAA,EAAa8J,WAAAA,EAAY+C,eAAAA,KACjC5d,GAAK,GAAI+Q,EAAa,MACtBhyC,GAAK,CAAC,SAAUA,GAAK87C,EAAY,KAAMwC,GAAMO,IAAkB,MAEnE3K,wBAAyB,CACvB4hB,MAAO,EAAGna,UAAAA,EAAWt8C,KAAAA,KAAWs8C,EAAY,KAAOt8C,GAErD80C,qBAAsB,CACpB2hB,MAAO,EAAG9jB,YAAAA,EAAav2C,KAAAA,EAAMqgD,WAAAA,KAC3B7a,GAAK,GAAI+Q,EAAa,MACtBhyC,GAAK,CAAC,SAAUvE,EAAMuE,GAAK87C,EAAY,MAAO,MAElD1H,qBAAsB,CACpB0hB,MAAO,EAAG9jB,YAAAA,EAAav2C,KAAAA,EAAMsjD,WAAAA,EAAYjD,WAAAA,EAAY0C,OAAAA,KACnDvd,GAAK,GAAI+Q,EAAa,MACtBhyC,GACE,CACE,OACAvE,EACAwlC,GAAK,cAAejhC,GAAK++C,EAAY,QACrC/+C,GAAK87C,EAAY,KACjBwC,GAAME,IAER,MAGNnK,gBAAiB,CACfyhB,MAAO,EAAG9jB,YAAAA,EAAav2C,KAAAA,EAAMqc,UAAWxQ,EAAMjI,KAAAA,EAAMy8C,WAAAA,KAClD7a,GAAK,GAAI+Q,EAAa,MACtBv2C,GACC67D,GAAkBhwD,GACf25B,GAAK,MAAO8V,GAAO/2C,GAAKsH,EAAM,OAAQ,OACtC25B,GAAK,IAAKjhC,GAAKsH,EAAM,MAAO,MAChC,KACAjI,EACA4hC,GAAK,IAAKjhC,GAAK87C,EAAY,OAE/BxH,qBAAsB,CACpBwhB,MAAO,EAAG9jB,YAAAA,EAAav2C,KAAAA,EAAM4D,KAAAA,EAAM8Z,aAAAA,EAAc2iC,WAAAA,KAC/C7a,GAAK,GAAI+Q,EAAa,MACtBhyC,GACE,CAACvE,EAAO,KAAO4D,EAAM4hC,GAAK,KAAM9nB,GAAenZ,GAAK87C,EAAY,MAChE,MAGNvH,wBAAyB,CACvBuhB,MAAO,EAAG9jB,YAAAA,EAAav2C,KAAAA,EAAMsjD,WAAAA,EAAYjD,WAAAA,EAAY0C,OAAAA,KACnDvd,GAAK,GAAI+Q,EAAa,MACtBhyC,GACE,CACE,YACAvE,EACAwlC,GAAK,cAAejhC,GAAK++C,EAAY,QACrC/+C,GAAK87C,EAAY,KACjBwC,GAAME,IAER,MAGNhK,oBAAqB,CACnBshB,MAAO,EAAG9jB,YAAAA,EAAav2C,KAAAA,EAAMqgD,WAAAA,EAAYvkC,MAAAA,KACvC0pB,GAAK,GAAI+Q,EAAa,MACtBhyC,GACE,CAAC,QAASvE,EAAMuE,GAAK87C,EAAY,KAAM7a,GAAK,KAAMjhC,GAAKuX,EAAO,SAC9D,MAGNk9B,mBAAoB,CAClBqhB,MAAO,EAAG9jB,YAAAA,EAAav2C,KAAAA,EAAMqgD,WAAAA,EAAYh7C,OAAAA,KACvCmgC,GAAK,GAAI+Q,EAAa,MACtBhyC,GAAK,CAAC,OAAQvE,EAAMuE,GAAK87C,EAAY,KAAMwC,GAAMx9C,IAAU,MAE/D4zC,oBAAqB,CACnBohB,MAAO,EAAG9jB,YAAAA,EAAav2C,KAAAA,EAAMqgD,WAAAA,KAC3B7a,GAAK,GAAI+Q,EAAa,MAAQhyC,GAAK,CAACvE,EAAMuE,GAAK87C,EAAY,MAAO,MAEtEnH,0BAA2B,CACzBmhB,MAAO,EAAG9jB,YAAAA,EAAav2C,KAAAA,EAAMqgD,WAAAA,EAAY0C,OAAAA,KACvCvd,GAAK,GAAI+Q,EAAa,MACtBhyC,GAAK,CAAC,QAASvE,EAAMuE,GAAK87C,EAAY,KAAMwC,GAAME,IAAU,MAEhE5J,oBAAqB,CACnBkhB,MAAO,EAAG9jB,YAAAA,EAAav2C,KAAAA,EAAMqc,UAAWxQ,EAAM64C,WAAAA,EAAY9O,UAAAA,KACxDpQ,GAAK,GAAI+Q,EAAa,MACtB,cACAv2C,GACC67D,GAAkBhwD,GACf25B,GAAK,MAAO8V,GAAO/2C,GAAKsH,EAAM,OAAQ,OACtC25B,GAAK,IAAKjhC,GAAKsH,EAAM,MAAO,OAC/B64C,EAAa,cAAgB,IAC9B,OACAngD,GAAKqxC,EAAW,QAEpBwD,gBAAiB,CACfihB,MAAO,EAAGha,WAAAA,EAAY+C,eAAAA,KACpB7+C,GACE,CAAC,gBAAiBA,GAAK87C,EAAY,KAAMwC,GAAMO,IAC/C,MAGN/J,oBAAqB,CACnBghB,MAAO,EAAGr6D,KAAAA,EAAMqgD,WAAAA,KACd97C,GAAK,CAAC,gBAAiBvE,EAAMuE,GAAK87C,EAAY,MAAO,MAEzD/G,oBAAqB,CACnB+gB,MAAO,EAAGr6D,KAAAA,EAAMsjD,WAAAA,EAAYjD,WAAAA,EAAY0C,OAAAA,KACtCx+C,GACE,CACE,cACAvE,EACAwlC,GAAK,cAAejhC,GAAK++C,EAAY,QACrC/+C,GAAK87C,EAAY,KACjBwC,GAAME,IAER,MAGNxJ,uBAAwB,CACtB8gB,MAAO,EAAGr6D,KAAAA,EAAMsjD,WAAAA,EAAYjD,WAAAA,EAAY0C,OAAAA,KACtCx+C,GACE,CACE,mBACAvE,EACAwlC,GAAK,cAAejhC,GAAK++C,EAAY,QACrC/+C,GAAK87C,EAAY,KACjBwC,GAAME,IAER,MAGNvJ,mBAAoB,CAClB6gB,MAAO,EAAGr6D,KAAAA,EAAMqgD,WAAAA,EAAYvkC,MAAAA,KAC1BvX,GACE,CACE,eACAvE,EACAuE,GAAK87C,EAAY,KACjB7a,GAAK,KAAMjhC,GAAKuX,EAAO,SAEzB,MAGN29B,kBAAmB,CACjB4gB,MAAO,EAAGr6D,KAAAA,EAAMqgD,WAAAA,EAAYh7C,OAAAA,KAC1Bd,GAAK,CAAC,cAAevE,EAAMuE,GAAK87C,EAAY,KAAMwC,GAAMx9C,IAAU,MAEtEq0C,yBAA0B,CACxB2gB,MAAO,EAAGr6D,KAAAA,EAAMqgD,WAAAA,EAAY0C,OAAAA,KAC1Bx+C,GAAK,CAAC,eAAgBvE,EAAMuE,GAAK87C,EAAY,KAAMwC,GAAME,IAAU,OAQzE,SAASx+C,GAAKu3D,EAAY13B,EAAY,IACpC,IAAI23B,EAEJ,OAGuD,QAH/CA,EACND,MAAAA,OACI,EACAA,EAAWv5B,QAAQsO,GAAMA,IAAGtsC,KAAK6/B,UACX,IAA1B23B,EACEA,EACA,GAMN,SAASlZ,GAAM92C,GACb,OAAOy5B,GAAK,MAAO8V,GAAO/2C,GAAKwH,EAAO,OAAQ,OAMhD,SAASy5B,GAAKtxB,EAAO8nD,EAAapsC,EAAM,IACtC,OAAsB,MAAfosC,GAAuC,KAAhBA,EAC1B9nD,EAAQ8nD,EAAcpsC,EACtB,GAGN,SAAS0rB,GAAOK,GACd,OAAOnW,GAAK,KAAMmW,EAAIp1C,QAAQ,MAAO,SAGvC,SAASs1D,GAAkBC,GACzB,IAAIG,EAGJ,OAGwD,QAHhDA,EACNH,MAAAA,OACI,EACAA,EAAWvyB,MAAMoS,GAAQA,EAAIxuB,SAAS,eACrB,IAArB8uC,GACEA,EC5UN,IAWWC,GAAqB,CAC5BC,KAZqB,CACrBC,cAAc,EACdC,mBAAmB,GAWnBt7D,QATiB,CACjBu7D,OAAQ,MACR,eAAgB,oBAQhB52D,QANiB,CACjBC,OAAQ,SA+BZ,SAAS42D,GAAmBx7D,GACxB,GAAIA,EAAS,CACT,IAAIy7D,EAAe58D,OAAO2H,OAAO,MAIjC,OAHA3H,OAAOuF,KAAKvF,OAAOmB,IAAUE,SAAQ,SAAUjB,GAC3Cw8D,EAAax8D,EAAKI,eAAiBW,EAAQf,MAExCw8D,EAEX,OAAOz7D,ECjDJ,SAAS07D,GAAUC,GACtB,OAAO,IAAIxM,IAAW,SAAUa,GAC5BA,EAAS7uD,MAAMw6D,MCWvB,IAAIC,GAAcxO,IAAM,WAAc,OAAOpvD,SCXzC69D,GAAY,SAAUhP,GAEtB,SAASgP,EAASl3D,QACE,IAAZA,IAAsBA,EAAU,IACpC,IAAImoD,EAAQD,EAAO9tD,KAAKlB,KDQJ,SAAUi+D,QACd,IAAhBA,IAA0BA,EAAc,IAC5C,IAAInP,EAAKmP,EAAYC,IAAKA,OAAa,IAAPpP,EAAgB,WAAaA,EAAIqP,EAAiBF,EAAY99D,MAAOs9D,EAAoBQ,EAAYR,kBAAmBW,EAAmBH,EAAYG,iBAAkBC,EAAKJ,EAAYK,uBAAwBA,OAAgC,IAAPD,GAAwBA,EAAIE,EAAiBrrB,GAAO+qB,EAAa,CAAC,MAAO,QAAS,oBAAqB,mBAAoB,2BAClYpO,SEjBkB,SAAU2O,GAChC,IAAKA,GAA4B,oBAAVr+D,MACnB,MAAM0vD,QAAU,IAAId,GAAe,sbAAwb,IAAIA,GAAe,IFgB9e0P,CAAaN,GAAkBJ,IAEnC,IAAIW,EAAa,CACbnB,KAAM,CAAEE,kBAAmBA,GAC3B32D,QAASy3D,EAAeI,aACxBz3D,YAAaq3D,EAAer3D,YAC5B/E,QAASo8D,EAAep8D,SAE5B,OAAO,IAAI02D,IAAW,SAAUvX,GAC5B,IAAIsd,EG5BW,SAAUtd,EAAWud,GAGxC,OAFcvd,EAAUwd,aACCZ,MAIO,mBAAhBW,EACLA,EAAYvd,GAGZud,GAAe,YHkBNE,CAAUzd,EAAW4c,GACjC10C,EAAU83B,EAAUwd,aACpBE,EAAyB,GAC7B,GAAIx1C,EAAQy1C,gBAAiB,CACzB,IAAInQ,EAAKtlC,EAAQy1C,gBAAiBC,EAASpQ,EAAG1tD,KAAM+9D,EAAUrQ,EAAGqQ,QAC7DD,IACAF,EAAuB,6BAA+BE,GAEtDC,IACAH,EAAuB,gCAAkCG,GAGjE,IAwBIC,EAxBAC,EAAiBtsB,EAASA,EAAS,GAAIisB,GAAyBx1C,EAAQrnB,SACxEm9D,EAAgB,CAChB/B,KAAM/zC,EAAQ+zC,KACdz2D,QAAS0iB,EAAQm1C,aACjBz3D,YAAasiB,EAAQtiB,YACrB/E,QAASk9D,GAEThB,EF7B0B,SAAU/c,EAAWie,GAEvD,IADA,IAAIC,EAAU,GACL1X,EAAK,EAAGA,EAAKrqC,UAAUjY,OAAQsiD,IACpC0X,EAAQ1X,EAAK,GAAKrqC,UAAUqqC,GAEhC,IAAIhhD,EAAUisC,EAASA,EAAS,GAAIwsB,EAAez4D,SAAU,CAAE3E,QAASo9D,EAAep9D,QAAS+E,YAAaq4D,EAAer4D,cACxHq2D,EAAOgC,EAAehC,MAAQ,GAClCiC,EAAQn9D,SAAQ,SAAUo9D,GACtB34D,EAAUisC,EAASA,EAASA,EAAS,GAAIjsC,GAAU24D,EAAO34D,SAAU,CAAE3E,QAAS4wC,EAASA,EAAS,GAAIjsC,EAAQ3E,SAAUw7D,GAAmB8B,EAAOt9D,YAC7Is9D,EAAOv4D,cACPJ,EAAQI,YAAcu4D,EAAOv4D,aACjCq2D,EAAOxqB,EAASA,EAAS,GAAIwqB,GAAOkC,EAAOlC,SAE/C,IAAI5D,EAAgBrY,EAAUqY,cAAepjB,EAAa+K,EAAU/K,WAAYqS,EAAYtH,EAAUsH,UAAWD,EAAQrH,EAAUqH,MAC/H/lD,EAAO,CAAE+2D,cAAeA,EAAe/Q,UAAWA,GAKtD,OAJI2U,EAAKE,oBACL76D,EAAK2zC,WAAaA,GAClBgnB,EAAKC,eACL56D,EAAK+lD,MAAQ0T,GAAM1T,IAChB,CACH7hD,QAASA,EACTlE,KAAMA,GEQG88D,CAAyBpe,EAAWgc,GAAoBoB,EAAYY,GAAgBx4D,EAAUu3D,EAAGv3D,QAASlE,EAAOy7D,EAAGz7D,KAC7H,GAAIA,EAAKgmD,YAAc0V,EAAwB,CAC3C,IAAIqB,EAAgB,IAAI1zD,IAAIjL,OAAOuF,KAAK3D,EAAKgmD,YAC7C0R,GAAMhZ,EAAUqH,MAAO,CACnBnQ,SAAU,SAAU1B,EAAM8c,EAAMhkC,GACxBA,GAA0B,uBAAhBA,EAAOqoB,MACjB0nB,EAAcC,OAAO9oB,EAAK11C,KAAKM,UAIvCi+D,EAAc7yD,OACdlK,EAAKgmD,UAAY7V,EAAS,GAAInwC,EAAKgmD,WACnC+W,EAAct9D,SAAQ,SAAUjB,UACrBwB,EAAKgmD,UAAUxnD,OAKlC,IAAK0F,EAAQM,OAAQ,CACjB,IAAIy4D,EIlEqB,WACjC,GAA+B,oBAApBC,gBACP,MAAO,CAAEV,YAAY,EAAOh4D,QAAQ,GACxC,IAAIg4D,EAAa,IAAIU,gBAErB,MAAO,CAAEV,WAAYA,EAAYh4D,OADpBg4D,EAAWh4D,QJ8DP24D,GAA2BC,EAAcH,EAAGT,WAAYh4D,EAASy4D,EAAGz4D,QAC7Eg4D,EAAaY,KAETl5D,EAAQM,OAASA,GASzB,GAJIg3D,IACC9c,EAAUqH,MAAMxI,YAAYxV,MAJN,SAAU6H,GACjC,MAAkB,wBAAXA,EAAEyF,MAAkD,aAAhBzF,EAAE8O,eAI7Cx6C,EAAQC,OAAS,OAEE,QAAnBD,EAAQC,OAAkB,CAC1B,IAAIk5D,EK9ET,SAA0BrB,EAAWh8D,GACxC,IAAIs9D,EAAc,GACdC,EAAgB,SAAU32D,EAAK9H,GAC/Bw+D,EAAY15D,KAAKgD,EAAM,IAAM42D,mBAAmB1+D,KAQpD,GANI,UAAWkB,GACXu9D,EAAc,QAASv9D,EAAK+lD,OAE5B/lD,EAAK+2D,eACLwG,EAAc,gBAAiBv9D,EAAK+2D,eAEpC/2D,EAAKgmD,UAAW,CAChB,IAAIyX,OAAsB,EAC1B,IACIA,EAAsBxE,GAAwBj5D,EAAKgmD,UAAW,iBAElE,MAAOmT,GACH,MAAO,CAAEA,WAAYA,GAEzBoE,EAAc,YAAaE,GAE/B,GAAIz9D,EAAK2zC,WAAY,CACjB,IAAI+pB,OAAuB,EAC3B,IACIA,EAAuBzE,GAAwBj5D,EAAK2zC,WAAY,kBAEpE,MAAOwlB,GACH,MAAO,CAAEA,WAAYA,GAEzBoE,EAAc,aAAcG,GAEhC,IAAIjL,EAAW,GAAIkL,EAAc3B,EAC7B4B,EAAgB5B,EAAU79D,QAAQ,MACf,IAAnBy/D,IACAnL,EAAWuJ,EAAU6B,OAAOD,GAC5BD,EAAc3B,EAAU6B,OAAO,EAAGD,IAEtC,IAAIE,GAAkD,IAA9BH,EAAYx/D,QAAQ,KAAc,IAAM,IAEhE,MAAO,CAAE4/D,OADIJ,EAAcG,EAAoBR,EAAYv6D,KAAK,KAAO0vD,GLwCtDuL,CAAiBhC,EAAWh8D,GAAO+9D,EAASV,EAAGU,OAAQ5E,EAAakE,EAAGlE,WAChF,GAAIA,EACA,OAAO8B,GAAU9B,GAErB6C,EAAY+B,OAGZ,IACI75D,EAAQlE,KAAOi5D,GAAwBj5D,EAAM,WAEjD,MAAOm5D,GACH,OAAO8B,GAAU9B,GAGzB,OAAO,IAAIzK,IAAW,SAAUa,GAC5B,IL5F8B0F,EKgH9B,OApBmBsG,GAAkB5O,IAAM,WAAc,OAAOpvD,UAAa49D,IAChEa,EAAW93D,GACnB1B,MAAK,SAAU+C,GAEhB,OADAm5C,EAAUuf,WAAW,CAAE14D,SAAUA,IAC1BA,KAEN/C,MLlGyByyD,EKkGMvW,ELjGrC,SAAUn5C,GAAY,OAAOA,EAC/B9C,OACAD,MAAK,SAAU07D,GAChB,IACI,OAAO96D,KAAKC,MAAM66D,GAEtB,MAAOt4D,GACH,IAAIuzD,EAAavzD,EAKjB,MAJAuzD,EAAW36D,KAAO,mBAClB26D,EAAW5zD,SAAWA,EACtB4zD,EAAWE,WAAa9zD,EAASJ,OACjCg0D,EAAW+E,SAAWA,EAChB/E,MAGT32D,MAAK,SAAUhC,GAWhB,OAVI+E,EAASJ,QAAU,KACnBi0D,GAAiB7zD,EAAU/E,EAAQ,iDAAmD+E,EAASJ,QAE9FxF,MAAMC,QAAQY,IACd,GAAelC,KAAKkC,EAAQ,SAC5B,GAAelC,KAAKkC,EAAQ,WAC7B44D,GAAiB7zD,EAAU/E,EAAQ,2CAA6Cb,MAAMC,QAAQq1D,GACxFA,EAAWz1D,KAAI,SAAU6xC,GAAM,OAAOA,EAAG0lB,iBACzC9B,EAAW8B,eAAiB,MAE/Bv2D,QKwEEgC,MAAK,SAAUhC,GAGhB,OAFA+uD,EAASrwD,KAAKsB,GACd+uD,EAASW,WACF1vD,KAEN29D,OAAM,SAAUv4D,GACA,eAAbA,EAAIpH,OAEJoH,EAAIpF,QAAUoF,EAAIpF,OAAO49D,QAAUx4D,EAAIpF,OAAOyJ,MAC9CslD,EAASrwD,KAAK0G,EAAIpF,QAEtB+uD,EAAS7uD,MAAMkF,OAEZ,WACC42D,GACAA,EAAWj2D,eC7GO83D,CAAen6D,GAASgC,UAAY9I,KAElE,OADAivD,EAAMnoD,QAAUA,EACTmoD,EAEX,OAPApc,EAAUmrB,EAAUhP,GAObgP,EARI,CASbnF,IKXSU,GAAUV,GAAWU,QCDzB,SAAS12B,KAEZ,IADA,IAAIq+B,EAAU,GACLpZ,EAAK,EAAGA,EAAKrqC,UAAUjY,OAAQsiD,IACpCoZ,EAAQpZ,GAAMrqC,UAAUqqC,GAE5B,IAAI1kD,EAASpC,OAAO2H,OAAO,MAW3B,OAVAu4D,EAAQ7+D,SAAQ,SAAUvB,GACjBA,GAELE,OAAOuF,KAAKzF,GAAKuB,SAAQ,SAAUmH,GAC/B,IAAI9H,EAAQZ,EAAI0I,QACF,IAAV9H,IACA0B,EAAOoG,GAAO9H,SAInB0B,EChBJ,ICAH,GAAKpC,OAAOX,UAAW,GAAW,GAAGY,SAAU,GAAiB,GAAGmF,eACnE+6D,GAAUjvD,SAAS7R,UAAUY,SAC7BmgE,GAAsB,IAAI11D,IAI9B,SAAS21D,GAAMC,EAAG7uB,GACd,IACI,OAAO8uB,GAAMD,EAAG7uB,GAEpB,QACI2uB,GAAoBl2D,SAG5B,SAASq2D,GAAMD,EAAG7uB,GAEd,GAAI6uB,IAAM7uB,EACN,OAAO,EAIX,IAkJc+uB,EAAMC,EAChBp6C,EAnJAq6C,EAAO,GAASxgE,KAAKogE,GAKzB,GAAII,IAJO,GAASxgE,KAAKuxC,GAKrB,OAAO,EAEX,OAAQivB,GACJ,IAAK,iBAGD,GAAIJ,EAAE97D,SAAWitC,EAAEjtC,OACf,OAAO,EAEf,IAAK,kBACD,GAAIm8D,GAAmBL,EAAG7uB,GACtB,OAAO,EACX,IAAImvB,EAAQC,GAAYP,GACpBQ,EAAQD,GAAYpvB,GAGpBsvB,EAAWH,EAAMp8D,OACrB,GAAIu8D,IAAaD,EAAMt8D,OACnB,OAAO,EAEX,IAAK,IAAIw8D,EAAI,EAAGA,EAAID,IAAYC,EAC5B,IAAK,GAAe9gE,KAAKuxC,EAAGmvB,EAAMI,IAC9B,OAAO,EAIf,IAASA,EAAI,EAAGA,EAAID,IAAYC,EAAG,CAC/B,IAAIx4D,EAAMo4D,EAAMI,GAChB,IAAKT,GAAMD,EAAE93D,GAAMipC,EAAEjpC,IACjB,OAAO,EAGf,OAAO,EAEX,IAAK,iBACD,OAAO83D,EAAElgE,OAASqxC,EAAErxC,MAAQkgE,EAAE74D,UAAYgqC,EAAEhqC,QAChD,IAAK,kBAED,GAAI64D,GAAMA,EACN,OAAO7uB,GAAMA,EAErB,IAAK,mBACL,IAAK,gBACD,OAAQ6uB,IAAO7uB,EACnB,IAAK,kBACL,IAAK,kBACD,OAAO6uB,GAAK,GAAK7uB,EACrB,IAAK,eACL,IAAK,eACD,GAAI6uB,EAAEx0D,OAAS2lC,EAAE3lC,KACb,OAAO,EACX,GAAI60D,GAAmBL,EAAG7uB,GACtB,OAAO,EAGX,IAFA,IAAIwvB,EAAYX,EAAE56D,UACdqf,EAAiB,iBAAT27C,IACC,CACT,IAAIQ,EAAOD,EAAUngE,OACrB,GAAIogE,EAAKlgE,KACL,MAEJ,IAAI8sD,EAAKoT,EAAKxgE,MAAOygE,EAAOrT,EAAG,GAAIsT,EAAStT,EAAG,GAE/C,IAAKrc,EAAEtsC,IAAIg8D,GACP,OAAO,EAIX,GAAIp8C,IAAUw7C,GAAMa,EAAQ3vB,EAAE1tC,IAAIo9D,IAC9B,OAAO,EAGf,OAAO,EAEX,IAAK,uBACL,IAAK,sBACL,IAAK,uBACL,IAAK,sBACL,IAAK,qBACL,IAAK,sBACL,IAAK,uBAGDb,EAAI,IAAIt9D,WAAWs9D,GACnB7uB,EAAI,IAAIzuC,WAAWyuC,GAEvB,IAAK,oBACD,IAAImJ,EAAM0lB,EAAEr9D,WACZ,GAAI23C,IAAQnJ,EAAExuC,WACV,KAAO23C,KAAS0lB,EAAE1lB,KAASnJ,EAAEmJ,KAIjC,OAAgB,IAATA,EAEX,IAAK,yBACL,IAAK,6BACL,IAAK,kCACL,IAAK,oBACD,IAAIymB,EAAQlB,GAAQjgE,KAAKogE,GACzB,OAAIe,IAAUlB,GAAQjgE,KAAKuxC,KAyCfgvB,EAfYa,MAgB5Bj7C,GADUm6C,EAfWa,GAgBJ78D,OAASi8D,EAAOj8D,SACjB,GAChBg8D,EAAKzgE,QAAQ0gE,EAAQp6C,KAAeA,IAdxC,OAAO,EAEX,SAASw6C,GAAY/gE,GAGjB,OAAOE,OAAOuF,KAAKzF,GAAK6iC,OAAO4+B,GAAczhE,GAEjD,SAASyhE,GAAa/4D,GAClB,YAAqB,IAAdxJ,KAAKwJ,GAEhB,IAAI84D,GAAmB,oBAMvB,SAASX,GAAmBL,EAAG7uB,GAS3B,IAAI+vB,EAAOpB,GAAoBr8D,IAAIu8D,GACnC,GAAIkB,GAGA,GAAIA,EAAKr8D,IAAIssC,GACT,OAAO,OAGX2uB,GAAoBl9D,IAAIo9D,EAAGkB,EAAO,IAAIv2D,KAG1C,OADAu2D,EAAKl2D,IAAImmC,IACF,EC3LX,IC2GIgwB,GACAC,GD5GAC,GAAkB,WAAc,OAAO3hE,OAAO2H,OAAO,OAErD,GAAKpG,MAAMlC,UAAWgC,GAAU,GAAGA,QAASyB,GAAQ,GAAGA,MACvD8+D,GAAsB,WACtB,SAASA,EAAKC,EAAUC,QACH,IAAbD,IAAuBA,GAAW,QACrB,IAAbC,IAAuBA,EAAWH,IACtC3iE,KAAK6iE,SAAWA,EAChB7iE,KAAK8iE,SAAWA,EAuBpB,OArBAF,EAAKviE,UAAU0iE,OAAS,WAEpB,IADA,IAAI51D,EAAQ,GACH26C,EAAK,EAAGA,EAAKrqC,UAAUjY,OAAQsiD,IACpC36C,EAAM26C,GAAMrqC,UAAUqqC,GAE1B,OAAO9nD,KAAKgjE,YAAY71D,IAE5By1D,EAAKviE,UAAU2iE,YAAc,SAAU71D,GACnC,IAAI2pC,EAAO92C,KAEX,OADAqC,GAAQnB,KAAKiM,GAAO,SAAU3D,GAAO,OAAOstC,EAAOA,EAAKmsB,aAAaz5D,MAC9DstC,EAAKjqC,OAASiqC,EAAKjqC,KAAO7M,KAAK8iE,SAASh/D,GAAM5C,KAAKiM,MAE9Dy1D,EAAKviE,UAAU4iE,aAAe,SAAUz5D,GACpC,IAAIpH,EAAMpC,KAAK6iE,UAUvB,SAAkBnhE,GACd,cAAeA,GACX,IAAK,SACD,GAAc,OAAVA,EACA,MAER,IAAK,WACD,OAAO,EAEf,OAAO,EAnBwBwhE,CAAS15D,GAC9BxJ,KAAKmjE,OAASnjE,KAAKmjE,KAAO,IAAIp2D,SAC9B/M,KAAKojE,SAAWpjE,KAAKojE,OAAS,IAAI13D,KACpC23D,EAAQjhE,EAAI2C,IAAIyE,GAGpB,OAFK65D,GACDjhE,EAAI8B,IAAIsF,EAAK65D,EAAQ,IAAIT,EAAK5iE,KAAK6iE,SAAU7iE,KAAK8iE,WAC/CO,GAEJT,EA5Bc,GERdU,GAAmC,mBAAZv2D,WAAiD,iBAAdw2D,WAC3C,gBAAtBA,UAAUC,SACHC,GAAmC,mBAAZC,QACvBC,GAAiC,mBAAXpjE,QACP,mBAAfA,OAAOqjE,IDQdC,GAAe,WACf,SAASA,IACL7jE,KAAK8jE,MAAQ,IAAKL,GAAgBC,QAAUz3D,KAC5CjM,KAAK+jE,KAAO,IAAInB,GAAKU,IACrBtjE,KAAKgkE,OAAS,IAAIj3D,QAClB/M,KAAKikE,WAAa,IAAIv4D,IACtB1L,KAAKi5D,MAAQj5D,KAAKkkE,MAAM,IA2E5B,OAzEAL,EAAYxjE,UAAU8jE,QAAU,SAAUziE,GACtC,OAAO,GAAgBA,IAAU1B,KAAK8jE,MAAM39D,IAAIzE,IAEpDmiE,EAAYxjE,UAAU+jE,KAAO,SAAU1iE,GACnC,GAAI,GAAgBA,GAAQ,CACxB,IAAI+U,EArBhB,SAAqB/U,GACjB,OAAI,GAAgBA,GACTa,MAAMC,QAAQd,GACfA,EAAMoC,MAAM,GACZivC,EAAS,CAAEJ,UAAW3xC,OAAOwZ,eAAe9Y,IAAUA,GAEzDA,EAeY2iE,CAAY3iE,GAEvB,OADA1B,KAAKgkE,OAAO9/D,IAAIuS,EAAM/U,GACf+U,EAEX,OAAO/U,GAEXmiE,EAAYxjE,UAAU6jE,MAAQ,SAAUxiE,GACpC,IAAIutD,EAAQjvD,KACZ,GAAI,GAAgB0B,GAAQ,CACxB,IAAI4iE,EAAWtkE,KAAKgkE,OAAOj/D,IAAIrD,GAC/B,GAAI4iE,EACA,OAAOA,EAEX,OADYtjE,OAAOwZ,eAAe9Y,IAE9B,KAAKa,MAAMlC,UACP,GAAIL,KAAK8jE,MAAM39D,IAAIzE,GACf,OAAOA,EACX,IAAIyL,EAAQzL,EAAMU,IAAIpC,KAAKkkE,MAAOlkE,MAQlC,OAPI82C,EAAO92C,KAAK+jE,KAAKf,YAAY71D,IACvBA,QACNnN,KAAK8jE,MAAMx3D,IAAIwqC,EAAK3pC,MAAQA,GACxB0iD,SACA7uD,OAAOq5D,OAAOltD,IAGf2pC,EAAK3pC,MAEhB,KAAK,KACL,KAAKnM,OAAOX,UACR,GAAIL,KAAK8jE,MAAM39D,IAAIzE,GACf,OAAOA,EACX,IAAI6iE,EAAUvjE,OAAOwZ,eAAe9Y,GAChC8iE,EAAU,CAACD,GACXh+D,EAAOvG,KAAKykE,WAAW/iE,GAC3B8iE,EAAQh+D,KAAKD,EAAKR,MAClB,IAII+wC,EAJA4tB,EAAoBF,EAAQh/D,OAKhC,GAJAe,EAAKo+D,OAAOtiE,SAAQ,SAAUmH,GAC1Bg7D,EAAQh+D,KAAKyoD,EAAMiV,MAAMxiE,EAAM8H,UAE/BstC,EAAO92C,KAAK+jE,KAAKf,YAAYwB,IACvBn2D,OAAQ,CACd,IAAIu2D,EAAQ9tB,EAAKzoC,OAASrN,OAAO2H,OAAO47D,GACxCvkE,KAAK8jE,MAAMx3D,IAAIs4D,GACfr+D,EAAKo+D,OAAOtiE,SAAQ,SAAUmH,EAAK/D,GAC/Bm/D,EAAMp7D,GAAOg7D,EAAQE,EAAoBj/D,MAEzCoqD,SACA7uD,OAAOq5D,OAAOuK,GAGtB,OAAO9tB,EAAKzoC,QAIxB,OAAO3M,GAEXmiE,EAAYxjE,UAAUokE,WAAa,SAAU3jE,GACzC,IAAIyF,EAAOvF,OAAOuF,KAAKzF,GACnBg2C,EAAO92C,KAAK+jE,KAAKf,YAAYz8D,GACjC,IAAKuwC,EAAKvwC,KAAM,CACZA,EAAKoP,OACL,IAAI5P,EAAOC,KAAKw1C,UAAUj1C,IACpBuwC,EAAKvwC,KAAOvG,KAAKikE,WAAWl/D,IAAIgB,KAClC/F,KAAKikE,WAAW//D,IAAI6B,EAAM+wC,EAAKvwC,KAAO,CAAEo+D,OAAQp+D,EAAMR,KAAMA,IAGpE,OAAO+wC,EAAKvwC,MAETs9D,EAjFO,GAoFPgB,GAAqB7jE,OAAO+9B,QAAO,SAAUr9B,GACpD,GAAI,GAAgBA,GAAQ,MACD,IAAnB+gE,IACAqC,KAEJ,IAAIC,EAAYtC,GAAeyB,MAAMxiE,GACjCqE,EAAO28D,GAAe39D,IAAIggE,GAI9B,YAHa,IAATh/D,GACA28D,GAAex+D,IAAI6gE,EAAWh/D,EAAOC,KAAKw1C,UAAUupB,IAEjDh/D,EAEX,OAAOC,KAAKw1C,UAAU95C,KACvB,CACCsjE,MAAOF,KAIX,SAASA,KACLrC,GAAiB,IAAIoB,GACrBnB,GAAiB,IAAKY,GAAgBv2D,QAAUrB,KEnH7C,SAASu5D,GAASlU,EAAYmU,EAAOC,GACxC,OAAO,IAAI7T,IAAW,SAAUa,GAC5B,IAAIrwD,EAAOqwD,EAASrwD,KAAMwB,EAAQ6uD,EAAS7uD,MAAOwvD,EAAWX,EAASW,SAClEsS,EAAsB,EACtBC,GAAY,EACZC,EAAe,CACflgE,KAAM,SAAUiB,GACZ,OAAO,IAAIvD,SAAQ,SAAUI,GAAW,OAAOA,EAAQmD,UAG/D,SAASk/D,EAAaC,EAAUC,GAC5B,OAAID,EACO,SAAUnoD,KACX+nD,EACF,IAAIM,EAAO,WAAc,OAAOF,EAASnoD,IACzCioD,EAAeA,EAAalgE,KAAKsgE,EAAMA,GAAMtgE,MAAK,SAAUhC,KACtDgiE,EACFtjE,GAAQA,EAAKZ,KAAKixD,EAAU/uD,GACxBiiE,GACAzM,EAAQ9F,cAEb,SAAUxvD,GAET,OADE8hE,EACI9hE,KACPy9D,OAAM,SAAU4E,GACfriE,GAASA,EAAMpC,KAAKixD,EAAUwT,OAK/B,SAAUtoD,GAAO,OAAOooD,GAAYA,EAASvkE,KAAKixD,EAAU90C,IAG3E,IAAIu7C,EAAU,CACV92D,KAAMyjE,EAAaL,EAAOpjE,GAC1BwB,MAAOiiE,EAAaJ,EAAS7hE,GAC7BwvD,SAAU,WACNuS,GAAY,EACPD,GACDtS,GAAYA,EAAS5xD,KAAKixD,KAIlCyT,EAAM7U,EAAWkC,UAAU2F,GAC/B,OAAO,WAAc,OAAOgN,EAAI/T,kBC7CjC,SAASgU,GAAsBziE,GAClC,OAAQA,EAAO49D,QAAU59D,EAAO49D,OAAOx7D,OAAS,IAAM,ECDnD,SAASsgE,GAAc34D,EAAO7L,EAAMkoB,GACvC,IAAIie,EAAS,EAOb,OANAt6B,EAAM9K,SAAQ,SAAU0jE,EAAMtgE,GACtBnE,EAAKJ,KAAKlB,KAAM+lE,EAAMtgE,EAAG0H,KACzBA,EAAMs6B,KAAYs+B,KAEvBv8C,GACHrc,EAAM3H,OAASiiC,EACRt6B,ECDX,IAAI64D,GAAiB,CACjB/tB,KAAM,QACN72C,KAAM,CACF62C,KAAM,OACNv2C,MAAO,eAGf,SAAS,GAAQuyC,EAAIghB,GACjB,OAAOhhB,EAAGyN,aAAae,WAAW5a,OAAM,SAAU0tB,GAC9C,MAA0B,mBAAnBA,EAAUtd,MACb,GAAQgd,EAAUM,EAAUn0D,KAAKM,OAAQuzD,MAGrD,SAASgR,GAAiB9e,GACtB,OAAO,GAAQ2Q,GAAuB3Q,I7BanC,SAA+BA,GAClC0I,QAAU,GAAuB,aAAb1I,EAAIlP,KAAqB,0JAA8J,GAAuB,aAAbkP,EAAIlP,KAAqB,IAC9O4X,QAAU,GAAU1I,EAAIhH,YAAY36C,QAAU,EAAG,8CAAgD,GAAU2hD,EAAIhH,YAAY36C,QAAU,EAAG,IACxI,IAAI0gE,EAAc/e,EAAIhH,YAAY,GAElC,OADA0P,QAAU,GAA+B,uBAArBqW,EAAYjuB,KAA+B,kCAAoC,GAA+B,uBAArBiuB,EAAYjuB,KAA+B,IACjJiuB,E6BlBuCC,CAAsBhf,GAAMgO,GAAkB6C,GAAuB7Q,KAC7G,KACAA,EAEV,SAASif,GAAoB3kB,GACzB,OAAO,SAA0B4kB,GAC7B,OAAO5kB,EAAW9W,MAAK,SAAUyD,GAC7B,OAAQA,EAAIhtC,MAAQgtC,EAAIhtC,OAASilE,EAAUjlE,KAAKM,OAC3C0sC,EAAI9sC,MAAQ8sC,EAAI9sC,KAAK+kE,OAI/B,SAASC,GAA6B7kB,EAAY0F,GACrD,IAAIof,EAAiBvlE,OAAO2H,OAAO,MAC/B69D,EAAoB,GACpBC,EAAuBzlE,OAAO2H,OAAO,MACrC+9D,EAA0B,GAC1BC,EAAcV,GAAiB3L,GAAMnT,EAAK,CAC1C3O,SAAU,CACNkjB,MAAO,SAAU5kB,EAAM8c,EAAMhkC,GACL,uBAAhBA,EAAOqoB,OACPsuB,EAAezvB,EAAK11C,KAAKM,QAAS,KAI9Cg3C,MAAO,CACHgjB,MAAO,SAAU5kB,GACb,GAAI2K,GAAc3K,EAAK2K,YACKA,EAAW9W,MAAK,SAAU07B,GAAa,OAAOA,EAAUphC,WAE5E6R,EAAK2K,YACL3K,EAAK2K,WAAW9W,KAAKy7B,GAAoB3kB,IAiBzC,OAhBI3K,EAAKr5B,WACLq5B,EAAKr5B,UAAUpb,SAAQ,SAAUgb,GACN,aAAnBA,EAAI3b,MAAMu2C,MACVuuB,EAAkBhgE,KAAK,CACnBpF,KAAMic,EAAI3b,MAAMN,KAAKM,WAKjCo1C,EAAK4K,cACLklB,GAAsC9vB,EAAK4K,cAAcr/C,SAAQ,SAAUwkE,GACvEH,EAAwBlgE,KAAK,CACzBpF,KAAMylE,EAAKzlE,KAAKM,WAIrB,OAKvBk3C,eAAgB,CACZ8iB,MAAO,SAAU5kB,GACb2vB,EAAqB3vB,EAAK11C,KAAKM,QAAS,IAGhD83C,UAAW,CACPkiB,MAAO,SAAU5kB,GACb,GAAIsvB,GAAoB3kB,EAApB2kB,CAAgCtvB,GAChC,OAAO,UAcvB,OATI6vB,GACAb,GAAcU,GAAmB,SAAUxyB,GAAK,QAASA,EAAE5yC,OAASmlE,EAAevyB,EAAE5yC,SAAUoE,SAC/FmhE,EA2FD,SAAqClH,EAAQtY,GAChD,IAAI2f,EAZR,SAA4BrH,GACxB,OAAO,SAAyBsH,GAC5B,OAAOtH,EAAO90B,MAAK,SAAUq8B,GACzB,OAAOD,EAASrlE,OACY,aAAxBqlE,EAASrlE,MAAMu2C,MACf8uB,EAASrlE,MAAMN,OACd4lE,EAAQ5lE,OAAS2lE,EAASrlE,MAAMN,KAAKM,OACjCslE,EAAQ1lE,MAAQ0lE,EAAQ1lE,KAAKylE,QAK7BE,CAAmBxH,GACpC,OAAOwG,GAAiB3L,GAAMnT,EAAK,CAC/B7O,oBAAqB,CACjBojB,MAAO,SAAU5kB,GACb,OAAO/D,EAASA,EAAS,GAAI+D,GAAO,CAAE0K,oBAAqB1K,EAAK0K,oBAAsB1K,EAAK0K,oBAAoB7d,QAAO,SAAUujC,GACxH,OAAQzH,EAAO90B,MAAK,SAAUttB,GAAO,OAAOA,EAAIjc,OAAS8lE,EAAO96B,SAAShrC,KAAKM,YAC7E,OAGjBg3C,MAAO,CACHgjB,MAAO,SAAU5kB,GAEb,GADwB2oB,EAAO90B,MAAK,SAAUw8B,GAAa,OAAOA,EAAUliC,UACrD,CACnB,IAAImiC,EAAkB,EAQtB,GAPItwB,EAAKr5B,WACLq5B,EAAKr5B,UAAUpb,SAAQ,SAAUgb,GACzBypD,EAAWzpD,KACX+pD,GAAmB,MAIP,IAApBA,EACA,OAAO,QAKvBzuB,SAAU,CACN+iB,MAAO,SAAU5kB,GACb,GAAIgwB,EAAWhwB,GACX,OAAO,UA1HLuwB,CAA4Bb,EAAmBG,IAE7DA,GACAb,GAAcY,GAAyB,SAAUY,GAAM,QAASA,EAAGlmE,OAASqlE,EAAqBa,EAAGlmE,SAC/FoE,SACLmhE,EA2HD,SAA0ClH,EAAQtY,GACrD,SAASuU,EAAM5kB,GACX,GAAI2oB,EAAO90B,MAAK,SAAU6tB,GAAO,OAAOA,EAAIp3D,OAAS01C,EAAK11C,KAAKM,SAC3D,OAAO,KAGf,OAAOukE,GAAiB3L,GAAMnT,EAAK,CAC/BvO,eAAgB,CAAE8iB,MAAOA,GACzB5iB,mBAAoB,CAAE4iB,MAAOA,MAnIf6L,CAAiCb,EAAyBC,IAErEA,EAEJ,IAAIa,GAAwBxmE,OAAO+9B,QAAO,SAAUooB,GACvD,OAAOmT,GAAM1C,GAAczQ,GAAM,CAC7B1O,aAAc,CACVijB,MAAO,SAAU5kB,EAAM8c,EAAMhkC,GACzB,IAAIA,GACgB,wBAAhBA,EAAOqoB,KADX,CAIA,IAAIwK,EAAa3L,EAAK2L,WACtB,GAAKA,IAGMA,EAAW9X,MAAK,SAAU4qB,GACjC,OAAQ,GAAQA,KACc,eAAzBA,EAAUn0D,KAAKM,OACkC,IAA9C6zD,EAAUn0D,KAAKM,MAAM2nC,YAAY,KAAM,OAEnD,CAGA,IAAI6f,EAAQt5B,EACZ,KAAI,GAAQs5B,IACRA,EAAMzH,YACNyH,EAAMzH,WAAW9W,MAAK,SAAU6H,GAAK,MAAwB,WAAjBA,EAAEpxC,KAAKM,UAGvD,OAAOqxC,EAASA,EAAS,GAAI+D,GAAO,CAAE2L,WAAYvO,GAAcA,GAAc,GAAIuO,GAAY,GAAO,CAACujB,KAAiB,aAIpI,CACCyB,MAAO,SAAUve,GACb,OAAOA,IAAU8c,MAGrB0B,GAAyB,CACzBpmE,KAAM,SAAU+kE,GACZ,IAAIsB,EAAsC,eAAzBtB,EAAUjlE,KAAKM,MAQhC,OAPIimE,IACKtB,EAAU5oD,WACV4oD,EAAU5oD,UAAUktB,MAAK,SAAUttB,GAAO,MAA0B,QAAnBA,EAAIjc,KAAKM,UAC3DmuD,SAAW,QAAe,wIAI3B8X,IAqFf,SAASf,GAAsCllB,GAC3C,IAAIkmB,EAAe,GAUnB,OATAlmB,EAAae,WAAWpgD,SAAQ,SAAUkzD,IACjC,GAAQA,IAAcoC,GAAiBpC,KACxCA,EAAU7T,aACVklB,GAAsCrR,EAAU7T,cAAcr/C,SAAQ,SAAUwkE,GAAQ,OAAOe,EAAaphE,KAAKqgE,MAEzF,mBAAnBtR,EAAUtd,MACf2vB,EAAaphE,KAAK+uD,MAGnBqS,EAEJ,SAASC,GAA2B9S,GAGvC,MAA4B,UAFXoD,GAAkBpD,GACEzT,UAE1ByT,EAEOuF,GAAMvF,EAAU,CAC9Bzc,oBAAqB,CACjBojB,MAAO,SAAU5kB,GACb,OAAO/D,EAASA,EAAS,GAAI+D,GAAO,CAAEwK,UAAW,cCxP1D,SAASwmB,GAAchZ,EAAIlG,GAC9B,IAAInH,EAAaqN,EAAGrN,WACpB,OAAKA,IAAeA,EAAWj8C,QAqC5B,SAAgCi8C,GACnC,IAAIr+C,EAAS,GAiBb,OAhBIq+C,GAAcA,EAAWj8C,QACzBi8C,EAAWp/C,SAAQ,SAAUgkE,GACzB,GARZ,SAA8BvX,GAC1B,IAAIptD,EAAQotD,EAAG1tD,KAAKM,MACpB,MAAiB,SAAVA,GAA8B,YAAVA,EAMdqmE,CAAqB1B,GAA1B,CAEA,IAAI2B,EAAqB3B,EAAU5oD,UAC/BwqD,EAAgB5B,EAAUjlE,KAAKM,MACnCmuD,QAAU,GAAUmY,GAAoD,IAA9BA,EAAmBxiE,OAAc,0CAA4CyiE,EAAgB,eAAiB,GAAUD,GAAoD,IAA9BA,EAAmBxiE,OAAc,IACzN,IAAI0iE,EAAaF,EAAmB,GACpCnY,QAAU,GAAUqY,EAAW9mE,MAAkC,OAA1B8mE,EAAW9mE,KAAKM,MAAgB,6BAA+BumE,EAAgB,eAAiB,GAAUC,EAAW9mE,MAAkC,OAA1B8mE,EAAW9mE,KAAKM,MAAgB,IACpM,IAAIymE,EAAUD,EAAWxmE,MACzBmuD,QAAU,GAAUsY,IACE,aAAjBA,EAAQlwB,MAAwC,iBAAjBkwB,EAAQlwB,MAA0B,qBAAuBgwB,EAAgB,qDAAuD,GAAUE,IACxJ,aAAjBA,EAAQlwB,MAAwC,iBAAjBkwB,EAAQlwB,MAA0B,IACtE70C,EAAOoD,KAAK,CAAE6/D,UAAWA,EAAW6B,WAAYA,QAGjD9kE,EApDAglE,CAAuB3mB,GAAY5Z,OAAM,SAAUinB,GACtD,IAAIuX,EAAYvX,EAAGuX,UAAW6B,EAAapZ,EAAGoZ,WAC1CG,GAAc,EAQlB,MAP8B,aAA1BH,EAAWxmE,MAAMu2C,MACjBowB,EAAczf,GAAaA,EAAUsf,EAAWxmE,MAAMN,KAAKM,OAC3DmuD,QAAU,QAA0B,IAAhBwY,EAAwB,mCAAqChC,EAAUjlE,KAAKM,MAAQ,eAAiB,QAA0B,IAAhB2mE,EAAwB,KAG3JA,EAAcH,EAAWxmE,MAAMA,MAEH,SAAzB2kE,EAAUjlE,KAAKM,OAAoB2mE,EAAcA,KAYzD,SAASC,GAAcC,EAAO/oE,GACjC,OAVG,SAA2BA,GAC9B,IAAI+oE,EAAQ,GAMZ,OALAjO,GAAM96D,EAAM,CACRg6C,UAAW,SAAU1C,GACjByxB,EAAM/hE,KAAKswC,EAAK11C,KAAKM,UAGtB6mE,EAGAC,CAAkBhpE,GAAMmrC,MAAK,SAAUvpC,GAAQ,OAAOmnE,EAAMxnE,QAAQK,IAAS,KAEjF,SAASqnE,GAAiB1T,GAC7B,OAAQA,GACJuT,GAAc,CAAC,UAAWvT,IAC1BuT,GAAc,CAAC,UAAWvT,GCnClC,IAAI2T,GAAe,IAAIh9D,IAChB,SAASi9D,GAAaz7B,GACzB,IAAIlvB,EAAQ0qD,GAAa3jE,IAAImoC,IAAW,EAExC,OADAw7B,GAAaxkE,IAAIgpC,EAAQlvB,EAAQ,GAC1BkvB,EAAS,IAAMlvB,EAAQ,IAAMT,KAAKyN,SAAS/pB,SAAS,IAAI6C,MAAM,GCJlE,SAAS8kE,GAAuBC,EAAW9hE,EAAQggE,GACtD,IAAI+B,EAAsB,GAC1BD,EAAUxmE,SAAQ,SAAU0mE,GAAO,OAAOA,EAAIhiE,IAAW+hE,EAAoBtiE,KAAKuiE,MAClFD,EAAoBzmE,SAAQ,SAAU0mE,GAAO,OAAOA,EAAIhiE,GAAQggE,MCD7D,SAASiC,GAAsBC,GAClC,SAAS/kE,EAAIsF,GACTxI,OAAOuJ,eAAe0+D,EAAUz/D,EAAK,CAAE9H,MAAO4vD,KAMlD,OAJIqS,IAAgBpjE,OAAO2oE,SACvBhlE,EAAI3D,OAAO2oE,SAEfhlE,EAAI,aACG+kE,ECNX,SAASE,GAAcznE,GACnB,OAAOA,GAA+B,mBAAfA,EAAM0D,KAEjC,IAAIgkE,GAAW,SAAUpa,GAErB,SAASoa,EAAQnxD,GACb,IAAIg3C,EAAQD,EAAO9tD,KAAKlB,MAAM,SAAUmyD,GAEpC,OADAlD,EAAMoa,YAAYlX,GACX,WAAc,OAAOlD,EAAMqa,eAAenX,QAC/CnyD,KA+DN,OA9DAivD,EAAM4Z,UAAY,IAAI58D,IACtBgjD,EAAMsa,SAAW,EACjBta,EAAMvrD,QAAU,IAAIZ,SAAQ,SAAUI,EAASH,GAC3CksD,EAAM/rD,QAAUA,EAChB+rD,EAAMlsD,OAASA,KAEnBksD,EAAMua,SAAW,CACb1nE,KAAM,SAAUsB,GACM,OAAd6rD,EAAM2W,MACN3W,EAAMwa,OAAS,CAAC,OAAQrmE,GACxBwlE,GAAuB3Z,EAAM4Z,UAAW,OAAQzlE,KAGxDE,MAAO,SAAUA,GACb,IAAIsiE,EAAM3W,EAAM2W,IACJ,OAARA,IACIA,GACAz7C,YAAW,WAAc,OAAOy7C,EAAI/T,iBACxC5C,EAAM2W,IAAM,KACZ3W,EAAMwa,OAAS,CAAC,QAASnmE,GACzB2rD,EAAMlsD,OAAOO,GACbslE,GAAuB3Z,EAAM4Z,UAAW,QAASvlE,KAGzDwvD,SAAU,WACN,GAAkB,OAAd7D,EAAM2W,IAAc,CACpB,IAAIlkE,EAAQutD,EAAMh3C,QAAQlW,QACrBL,EAWIynE,GAAcznE,GACnBA,EAAM0D,MAAK,SAAU2jE,GAAO,OAAO9Z,EAAM2W,IAAMmD,EAAI9V,UAAUhE,EAAMua,aAGnEva,EAAM2W,IAAMlkE,EAAMuxD,UAAUhE,EAAMua,WAdlCva,EAAM2W,IAAM,KACR3W,EAAMwa,QACc,SAApBxa,EAAMwa,OAAO,GACbxa,EAAM/rD,QAAQ+rD,EAAMwa,OAAO,IAG3Bxa,EAAM/rD,UAEV0lE,GAAuB3Z,EAAM4Z,UAAW,gBAWxD5Z,EAAM7xB,OAAS,SAAUssC,GACrBza,EAAMlsD,OAAO2mE,GACbza,EAAMh3C,QAAU,GAChBg3C,EAAMua,SAAS1W,YAEnB7D,EAAMvrD,QAAQq9D,OAAM,SAAUz3C,OACP,mBAAZrR,IACPA,EAAU,CAAC,IAAIq5C,GAAWr5C,KAE1BkxD,GAAclxD,GACdA,EAAQ7S,MAAK,SAAUiT,GAAY,OAAO42C,EAAM35C,MAAM+C,KAAc42C,EAAMua,SAASlmE,OAGnF2rD,EAAM35C,MAAM2C,GAETg3C,EAuDX,OA3HApc,EAAUu2B,EAASpa,GAsEnBoa,EAAQ/oE,UAAUiV,MAAQ,SAAU2C,QACf,IAAbjY,KAAK4lE,MAET5lE,KAAKiY,QAAU1V,MAAM6xC,KAAKn8B,GAC1BjY,KAAKwpE,SAAS1W,aAElBsW,EAAQ/oE,UAAUspE,mBAAqB,SAAUxX,GAC7C,GAAInyD,KAAKypE,OAAQ,CACb,IAAIG,EAAc5pE,KAAKypE,OAAO,GAC1B1iE,EAASorD,EAASyX,GAClB7iE,GACAA,EAAO7F,KAAKixD,EAAUnyD,KAAKypE,OAAO,IAErB,OAAbzpE,KAAK4lE,KACW,SAAhBgE,GACAzX,EAASW,UACTX,EAASW,aAIrBsW,EAAQ/oE,UAAUgpE,YAAc,SAAUlX,GACjCnyD,KAAK6oE,UAAU1iE,IAAIgsD,KACpBnyD,KAAK2pE,mBAAmBxX,GACxBnyD,KAAK6oE,UAAUv8D,IAAI6lD,KACjBnyD,KAAKupE,WAGfH,EAAQ/oE,UAAUipE,eAAiB,SAAUnX,EAAU0X,GAC/C7pE,KAAK6oE,UAAUjJ,OAAOzN,MACpBnyD,KAAKupE,SAAW,IACjBM,GACD7pE,KAAKwpE,SAASlmE,MAAM,IAAI4B,MAAM,sCAGtCkkE,EAAQ/oE,UAAUsxD,QAAU,SAAUtrD,GAClC,IAAI4oD,EAAQjvD,KACR8pE,GAAS,EACTllC,EAAO,WACFklC,IACDA,GAAS,EACT7a,EAAM4Z,UAAUjJ,OAAOzN,GACvB9rD,MAGJ8rD,EAAW,CACXrwD,KAAM8iC,EACNthC,MAAOshC,EACPkuB,SAAUluB,GAEV5mB,EAAQhe,KAAKupE,SACjBvpE,KAAKqpE,YAAYlX,GACjBnyD,KAAKupE,SAAWvrD,GAEborD,EA5HG,CA6HZ9X,ICpIK,SAASyY,GAAgBroE,GAC5B,OAAOa,MAAMC,QAAQd,IAAUA,EAAM8D,OAAS,EDqIlDwjE,GAAsBI,IEhItB,ICNWY,GDwBPC,GAAe,SAAUjb,GAEzB,SAASib,EAAYnb,GACjB,IArB6BtmD,EAC7BC,EAoBIyhE,EAAgBpb,EAAGob,cAAeC,EAAerb,EAAGqb,aAAcC,EAAetb,EAAGsb,aAAcC,EAAevb,EAAGub,aAAcC,EAAYxb,EAAGwb,UACjJrb,EAAQD,EAAO9tD,KAAKlB,KAAMqqE,IAAiBrqE,KAO/C,OANAivD,EAAMib,cAAgBA,GAAiB,GACvCjb,EAAMkb,aAAeA,GAAgB,GACrClb,EAAMmb,aAAeA,GAAgB,KACrCnb,EAAMxmD,QAAU4hE,IAzBhB5hE,EAAU,IACVshE,IAF6BvhE,EA0BwBymD,GAxBjCib,gBAAkBH,GAAgBvhE,EAAI2hE,iBAC5C3hE,EAAI0hE,eAAiB,IAC9BpnC,OAAOt6B,EAAI2hE,cAAgB,IACzB9nE,SAAQ,SAAUiB,GACrB,IAAI+mE,EAAe/mE,EACbA,EAAMmF,QACN,2BACNA,GAAW4hE,EAAe,QAG9B7hE,EAAI4hE,eACJ3hE,GAAWD,EAAI4hE,aAAa3hE,QAAU,MAE1CA,EAAUA,EAAQd,QAAQ,MAAO,KAY7BsnD,EAAMqb,UAAYA,EAClBrb,EAAMtc,UAAYs3B,EAAY5pE,UACvB4uD,EAEX,OAZApc,EAAUo3B,EAAajb,GAYhBib,EAbO,CAchB/kE,OC5BK,SAASqlE,GAAyBC,GACrC,QAAOA,GAAgBA,EAAgB,GAV3C,SAAWR,GACPA,EAAcA,EAAuB,QAAI,GAAK,UAC9CA,EAAcA,EAA4B,aAAI,GAAK,eACnDA,EAAcA,EAAyB,UAAI,GAAK,YAChDA,EAAcA,EAAuB,QAAI,GAAK,UAC9CA,EAAcA,EAAoB,KAAI,GAAK,OAC3CA,EAAcA,EAAqB,MAAI,GAAK,QAC5CA,EAAcA,EAAqB,MAAI,GAAK,QAPhD,CAQGA,KAAkBA,GAAgB,KCTrC,IAAI,GAAWhpE,OAAOX,UAAUY,SACzB,SAASkmC,GAAUzlC,GACtB,OAAO+oE,GAAgB/oE,GAE3B,SAAS+oE,GAAgBC,EAAK7xD,GAC1B,OAAQ,GAAS3X,KAAKwpE,IAClB,IAAK,iBAED,IADA7xD,EAAOA,GAAQ,IAAInN,KACVvF,IAAIukE,GACT,OAAO7xD,EAAK9T,IAAI2lE,GACpB,IAAIC,EAASD,EAAI5mE,MAAM,GAKvB,OAJA+U,EAAK3U,IAAIwmE,EAAKC,GACdA,EAAOtoE,SAAQ,SAAUghE,EAAO59D,GAC5BklE,EAAOllE,GAAKglE,GAAgBpH,EAAOxqD,MAEhC8xD,EAEX,IAAK,kBAED,IADA9xD,EAAOA,GAAQ,IAAInN,KACVvF,IAAIukE,GACT,OAAO7xD,EAAK9T,IAAI2lE,GACpB,IAAIE,EAAS5pE,OAAO2H,OAAO3H,OAAOwZ,eAAekwD,IAKjD,OAJA7xD,EAAK3U,IAAIwmE,EAAKE,GACd5pE,OAAOuF,KAAKmkE,GAAKroE,SAAQ,SAAUmH,GAC/BohE,EAAOphE,GAAOihE,GAAgBC,EAAIlhE,GAAMqP,MAErC+xD,EAEX,QACI,OAAOF,GCxBnB,IAAI,GAAS1pE,OAAO+9B,OAAQ,GAAiB/9B,OAAOoF,eAChDykE,IAAyB,EACzBC,GAAmB,SAAU9b,GAE7B,SAAS8b,EAAgBhc,GACrB,IAAIic,EAAejc,EAAGic,aAAcC,EAAYlc,EAAGkc,UAAWlkE,EAAUgoD,EAAGhoD,QACvEmoD,EAAQD,EAAO9tD,KAAKlB,MAAM,SAAUmyD,GACpC,IACI,IAAI8Y,EAAc9Y,EAASS,cAAcb,UACrCkZ,IAAgBA,EAAY3nE,QAC5B2nE,EAAY3nE,MAAQ4nE,IAG5B,MAAOpc,IACP,IAAIzhB,GAAS4hB,EAAM4Z,UAAU/7D,KAC7BmiD,EAAM4Z,UAAUv8D,IAAI6lD,GACpB,IAAItiC,EAAOo/B,EAAMp/B,KAUjB,OATIA,GAAQA,EAAKvsB,MACb6uD,EAAS7uD,OAAS6uD,EAAS7uD,MAAMusB,EAAKvsB,OAEjCusB,GAAQA,EAAKzsB,QAClB+uD,EAASrwD,MAAQqwD,EAASrwD,KAAK+tB,EAAKzsB,QAEpCiqC,GACA4hB,EAAMkc,YAAYpK,OAAM,eAErB,WACC9R,EAAM4Z,UAAUjJ,OAAOzN,KAAclD,EAAM4Z,UAAU/7D,MACrDmiD,EAAMmc,qBAGZprE,KACNivD,EAAM4Z,UAAY,IAAI58D,IACtBgjD,EAAMjd,cAAgB,IAAI/lC,IAC1BgjD,EAAMoc,YAAa,EACnBpc,EAAMnoD,QAAUA,EAChBmoD,EAAMqc,QAAUN,EAAUM,SAAWP,EAAaQ,kBAClD,IAAIC,EAAQ1T,GAAuBhxD,EAAQ6hD,OAK3C,OAJAsG,EAAMwc,UAAYD,GAASA,EAAMpqE,MAAQoqE,EAAMpqE,KAAKM,MACpDutD,EAAMyc,mBAAqB5kE,EAAQ8iD,aAAe,cAClDqF,EAAM8b,aAAeA,EACrB9b,EAAM+b,UAAYA,EACX/b,EAkXX,OAzZApc,EAAUi4B,EAAiB9b,GAyC3BhuD,OAAOuJ,eAAeugE,EAAgBzqE,UAAW,YAAa,CAC1D0E,IAAK,WACD,OAAO/E,KAAK8G,QAAQ8hD,WAExBvR,YAAY,EACZC,cAAc,IAElBwzB,EAAgBzqE,UAAU+C,OAAS,WAC/B,IAAI6rD,EAAQjvD,KACZ,OAAO,IAAI8C,SAAQ,SAAUI,EAASH,GAClC,IAAIovD,EAAW,CACXrwD,KAAM,SAAUsB,GACZF,EAAQE,GACR6rD,EAAM4Z,UAAUjJ,OAAOzN,GAClBlD,EAAM4Z,UAAU/7D,MACjBmiD,EAAM8b,aAAaY,YAAY1c,EAAMqc,SAEzCnhD,YAAW,WACPikC,EAAayD,gBACd,IAEPvuD,MAAOP,GAEPqrD,EAAea,EAAMgE,UAAUd,OAG3C2Y,EAAgBzqE,UAAUurE,iBAAmB,SAAUC,QAC1B,IAArBA,IAA+BA,GAAmB,GACtD,IAAIC,EAAa9rE,KAAK+rE,eAAc,GAChCvB,EAAgBxqE,KAAKgrE,UAAUR,eAC9BsB,GAAcA,EAAWtB,eAC1BR,GAAcgC,MACd5oE,EAAS2vC,EAASA,EAAS,GAAI+4B,GAAa,CAAEG,QAAS1B,GAAyBC,GAAgBA,cAAeA,IAC/G1b,EAAK9uD,KAAK8G,QAAQ8iD,YAAaA,OAAqB,IAAPkF,EAAgB,cAAgBA,EAIjF,IAH6Bgd,GAA+B,iBAAhBliB,GACxB,aAAhBA,GACgB,YAAhBA,KAEC5pD,KAAK+qE,aAAa3tD,UAAUpd,KAAK8G,QAAQ6hD,OAAOujB,mBAAoB,CACrE,IAAIC,EAAOnsE,KAAKgrE,UAAUoB,WACtBD,EAAKrZ,UAAY9yD,KAAK8G,QAAQulE,qBAC9BjpE,EAAOyJ,KAAOs/D,EAAK/oE,QAEnBi+D,GAAMj+D,EAAOyJ,KAAM,MACnBzJ,EAAOyJ,UAAO,GAEds/D,EAAKrZ,UACD1vD,EAAOonE,gBAAkBR,GAAciC,SACtB,gBAAhBriB,GACmB,eAAhBA,IACJxmD,EAAOonE,cAAgBR,GAAcgC,MACrC5oE,EAAO6oE,SAAU,UAEd7oE,EAAO26B,SAEO,aAAhB6rB,IACLxmD,EAAO26B,SAAU,IAEjB8xB,SACCsc,EAAKrZ,UACL9yD,KAAK8G,QAAQwlE,gBACblpE,EAAO6oE,SACP7oE,EAAOyJ,MACPzJ,EAAOE,OACRipE,GAAsBJ,EAAKK,SAMnC,OAHIX,GACA7rE,KAAKysE,iBAAiBrpE,GAEnBA,GAEX0nE,EAAgBzqE,UAAUqsE,0BAA4B,SAAUC,GAC5D,OAAQ3sE,KAAK6vB,OAASwxC,GAAMrhE,KAAK6vB,KAAKzsB,OAAQupE,IAElD7B,EAAgBzqE,UAAUusE,QAAU,SAAUpjE,EAAKqjE,GAC/C,IAAIh9C,EAAO7vB,KAAK6vB,KAChB,GAAIA,GACAA,EAAKrmB,MACHqjE,GAAsBxL,GAAMxxC,EAAK+4B,UAAW5oD,KAAK4oD,YACnD,OAAO/4B,EAAKrmB,IAGpBshE,EAAgBzqE,UAAU0rE,cAAgB,SAAUc,GAChD,OAAO7sE,KAAK4sE,QAAQ,SAAUC,IAElC/B,EAAgBzqE,UAAUysE,aAAe,SAAUD,GAC/C,OAAO7sE,KAAK4sE,QAAQ,QAASC,IAEjC/B,EAAgBzqE,UAAU0sE,iBAAmB,kBAClC/sE,KAAK6vB,KACZ7vB,KAAKqrE,YAAa,GAEtBP,EAAgBzqE,UAAU2sE,sBAAwB,WAC9ChtE,KAAK+qE,aAAakC,YAAYjtE,KAAKsrE,UAEvCR,EAAgBzqE,UAAU6sE,QAAU,SAAUtkB,GAC1C,IAAIkG,EACAqe,EAAmB,CACnBC,aAAc,GAEdxjB,EAAc5pD,KAAK8G,QAAQ8iD,YAO/B,GANoB,aAAhBA,EACAujB,EAAiBvjB,YAAc,WAEV,sBAAhBA,IACLujB,EAAiBvjB,YAAc,gBAE/BiG,SAAWjH,GAAa,GAAe1nD,KAAK0nD,EAAW,aAAc,CACrE,IAAIsP,EAAWD,GAAmBj4D,KAAK8G,QAAQ6hD,OAC3C0kB,EAAOnV,EAAS1W,oBACf6rB,GAASA,EAAK1iC,MAAK,SAAUqJ,GAAK,MAAiC,cAA1BA,EAAE5H,SAAShrC,KAAKM,UAC1DmuD,SAAW,QAAe,kBAAoB7pD,KAAKw1C,UAAUoN,GAAa,iBAA4C,QAAxBkG,EAAKoJ,EAAS92D,YAAyB,IAAP0tD,OAAgB,EAASA,EAAGptD,QAAUsE,KAAKw1C,UAAU0c,IAAa,+HAOxM,OAJItP,IAAcyY,GAAMrhE,KAAK8G,QAAQ8hD,UAAWA,KAC5CukB,EAAiBvkB,UAAY5oD,KAAK8G,QAAQ8hD,UAAY7V,EAASA,EAAS,GAAI/yC,KAAK8G,QAAQ8hD,WAAYA,IAEzG5oD,KAAKgrE,UAAUsC,iBACRttE,KAAKmrE,UAAUgC,EAAkBnD,GAAckD,UAE1DpC,EAAgBzqE,UAAUktE,UAAY,SAAUC,GAC5C,IAAIve,EAAQjvD,KACRytE,EAAkB16B,EAASA,EAAS,GAAKy6B,EAAiB7kB,MAAQ6kB,EAAmBz6B,EAASA,EAASA,EAAS,GAAI/yC,KAAK8G,SAAU0mE,GAAmB,CAAE5kB,UAAW7V,EAASA,EAAS,GAAI/yC,KAAK8G,QAAQ8hD,WAAY4kB,EAAiB5kB,cAAiB,CAAEgB,YAAa,aACnQ8jB,EAAM1tE,KAAK+qE,aAAaQ,kBAK5B,OAJIkC,EAAgBE,8BAChB3tE,KAAKgrE,UAAUR,cAAgBR,GAAcuD,UAC7CvtE,KAAK4tE,WAEF5tE,KAAK+qE,aAAa8C,WAAWH,EAAKD,EAAiBzD,GAAcuD,WAAWnoE,MAAK,SAAU0oE,GAC9F,IAAIjhE,EAAOihE,EAAgBjhE,KACvBkhE,EAAcP,EAAiBO,YAmBnC,OAlBIA,GACIle,UACCgb,KACDhb,SAAW,QAAe,8iBAC1Bgb,IAAyB,GAE7B5b,EAAM8e,aAAY,SAAUx9C,GAAY,OAAOw9C,EAAYx9C,EAAU,CACjEu9C,gBAAiBjhE,EACjB+7C,UAAW6kB,EAAgB7kB,gBAI/BqG,EAAM8b,aAAa90D,MAAM+3D,WAAW,CAChCrlB,MAAO8kB,EAAgB9kB,MACvBC,UAAW6kB,EAAgB7kB,UAC3B/7C,KAAMA,IAGPihE,KACRG,SAAQ,WACPhf,EAAM8b,aAAamD,UAAUR,GAC7Bze,EAAMkc,gBAGdL,EAAgBzqE,UAAU8tE,gBAAkB,SAAUrnE,GAClD,IAAImoD,EAAQjvD,KACRouD,EAAepuD,KAAK+qE,aACnBqD,yBAAyB,CAC1BzlB,MAAO7hD,EAAQiuD,SACfnM,UAAW9hD,EAAQ8hD,UACnBp/B,QAAS1iB,EAAQ0iB,UAEhBypC,UAAU,CACXnxD,KAAM,SAAUusE,GACZ,IAAIN,EAAcjnE,EAAQinE,YACtBA,GACA9e,EAAM8e,aAAY,SAAUx9C,EAAUu+B,GAClC,IAAIlG,EAAYkG,EAAGlG,UACnB,OAAOmlB,EAAYx9C,EAAU,CACzB89C,iBAAkBA,EAClBzlB,UAAWA,QAK3BtlD,MAAO,SAAUkF,GACT1B,EAAQozD,QACRpzD,EAAQozD,QAAQ1xD,GAGpBqnD,SAAW,SAAgB,uCAAwCrnD,MAI3E,OADAxI,KAAKgyC,cAAc1lC,IAAI8hD,GAChB,WACCa,EAAMjd,cAAc4tB,OAAOxR,IAC3BA,EAAayD,gBAIzBiZ,EAAgBzqE,UAAUiuE,WAAa,SAAUC,GAC7C,OAAOvuE,KAAKmrE,UAAUoD,IAE1BzD,EAAgBzqE,UAAUmuE,aAAe,SAAU5lB,GAC/C,OAAIyY,GAAMrhE,KAAK4oD,UAAWA,GACf5oD,KAAK6oE,UAAU/7D,KAChB9M,KAAKoD,SACLN,QAAQI,WAElBlD,KAAK8G,QAAQ8hD,UAAYA,EACpB5oD,KAAK6oE,UAAU/7D,KAGb9M,KAAKmrE,UAAU,CAClBvhB,YAAa5pD,KAAK0rE,mBAClB9iB,UAAWA,GACZohB,GAAcwE,cALN1rE,QAAQI,YAOvB4nE,EAAgBzqE,UAAU0tE,YAAc,SAAU7I,GAC9C,IAAI6F,EAAe/qE,KAAK+qE,aAOpB4B,EAAYzH,EANH6F,EAAa90D,MAAMk2D,KAAK,CACjCxjB,MAAO3oD,KAAK8G,QAAQ6hD,MACpBC,UAAW5oD,KAAK4oD,UAChByjB,mBAAmB,EACnBoC,YAAY,IACbrrE,OAC2B,CAC1BwlD,UAAW5oD,KAAK4oD,YAEhB+jB,IACA5B,EAAa90D,MAAM+3D,WAAW,CAC1BrlB,MAAO3oD,KAAK8G,QAAQ6hD,MACpB97C,KAAM8/D,EACN/jB,UAAW5oD,KAAK4oD,YAEpBmiB,EAAa2D,qBAGrB5D,EAAgBzqE,UAAUsuE,aAAe,SAAUvB,GAC/CptE,KAAK8G,QAAQsmE,aAAeA,EAC5BptE,KAAK4uE,iBAET9D,EAAgBzqE,UAAUwuE,YAAc,WACpC7uE,KAAK8G,QAAQsmE,aAAe,EAC5BptE,KAAK4uE,iBAET9D,EAAgBzqE,UAAUF,MAAQ,SAAU2G,EAASgoE,GAEjD,OADA9uE,KAAK+qE,aAAagE,mBAAmB/uE,MAC9BA,KAAK+qE,aAAaiE,qBAAqBhvE,KAAKsrE,QAASxkE,EAASgoE,IAEzEhE,EAAgBzqE,UAAUuuE,cAAgB,WACtC,IAAI3f,EAAQjvD,KACZ,IAAIA,KAAK+qE,aAAakE,QAAtB,CAGA,IAAeC,EAANlvE,KAAuBkvE,YAAa9B,EAApCptE,KAAsD8G,QAAQsmE,aACvE,GAAKA,GAOL,IAAI8B,GACAA,EAAYC,WAAa/B,EAD7B,CAIAvd,QAAU,GAAUud,EAAc,kEAAoE,GAAUA,EAAc,KACnH8B,IAAgBlvE,KAAKkvE,YAAc,KACzCC,SAAW/B,EAChB,IAAIgC,EAAa,WACTngB,EAAMigB,cACD3E,GAAyBtb,EAAM+b,UAAUR,eAM1C6E,IALApgB,EAAMkc,UAAU,CACZvhB,YAAa,gBACdogB,GAAcqF,MAAMjqE,KAAKiqE,EAAMA,KAQ1CA,EAAO,WACP,IAAInN,EAAOjT,EAAMigB,YACbhN,IACAl4C,aAAak4C,EAAKoN,SAClBpN,EAAKoN,QAAUnlD,WAAWilD,EAAYlN,EAAKiN,YAGnDE,UAjCQH,IACAllD,aAAaklD,EAAYI,gBAClBtvE,KAAKkvE,eAiCxBpE,EAAgBzqE,UAAUosE,iBAAmB,SAAUE,EAAW/jB,GAQ9D,YAPkB,IAAdA,IAAwBA,EAAY5oD,KAAK4oD,WAC7C5oD,KAAK6vB,KAAOkjB,EAASA,EAAS,GAAI/yC,KAAK6vB,MAAO,CAAEzsB,OAAQpD,KAAK+qE,aAAawE,uBAChE5C,EACAxlC,GAAUwlC,GAAY/jB,UAAWA,IACtCmhB,GAAgB4C,EAAU3L,gBACpBhhE,KAAK6vB,KAAKvsB,MAEdtD,KAAK6vB,MAEhBi7C,EAAgBzqE,UAAU8qE,UAAY,SAAUoD,EAAYO,GACxD,IAAI7f,EAAQjvD,KACZA,KAAKqrE,YAAa,EAClB,IAAImE,EAAuBV,IAAqB9E,GAAckD,SAC1D4B,IAAqB9E,GAAcuD,WACnCuB,IAAqB9E,GAAcqF,KACnCI,EAAezvE,KAAK8G,QAAQ8hD,UAC5B9hD,EAAU0oE,EACR3sC,GAAQ7iC,KAAK8G,QAASynE,GACtB,GAAOvuE,KAAK8G,QAAS+7B,GAAQ0rC,IAC9BiB,IACDxvE,KAAK4uE,gBACDL,GACAA,EAAW3lB,YACV2lB,EAAW3kB,cACXyX,GAAMkN,EAAW3lB,UAAW6mB,KAC7B3oE,EAAQ8iD,YAAc5pD,KAAK0rE,wBACF,IAArBoD,IACAA,EAAmB9E,GAAcwE,gBAI7C,IAAI5lB,EAAY9hD,EAAQ8hD,WAAa7V,EAAS,GAAIjsC,EAAQ8hD,WACtD8mB,EAAU1vE,KAAKG,MAAM2G,EAASgoE,GAC9B3c,EAAW,CACXrwD,KAAM,SAAUsB,GACZ6rD,EAAM0gB,aAAavsE,EAAQwlD,IAE/BtlD,MAAO,SAAUA,GACb2rD,EAAM2gB,YAAYtsE,EAAOslD,KAWjC,OARK4mB,IACGxvE,KAAK0vE,SAAW1vE,KAAKmyD,UACrBnyD,KAAK0vE,QAAQpG,eAAetpE,KAAKmyD,UAAU,GAE/CnyD,KAAK0vE,QAAUA,EACf1vE,KAAKmyD,SAAWA,GAEpBud,EAAQrG,YAAYlX,GACbud,EAAQhsE,SAEnBonE,EAAgBzqE,UAAUutE,QAAU,WAChC5tE,KAAK2vE,aAAa3vE,KAAK4rE,kBAAiB,GAAQ5rE,KAAK4oD,YAEzDkiB,EAAgBzqE,UAAUsvE,aAAe,SAAUvsE,EAAQwlD,IACnD5oD,KAAK8sE,gBAAkB9sE,KAAK0sE,0BAA0BtpE,MACtDpD,KAAKysE,iBAAiBrpE,EAAQwlD,GAC9BggB,GAAuB5oE,KAAK6oE,UAAW,OAAQzlE,KAGvD0nE,EAAgBzqE,UAAUuvE,YAAc,SAAUtsE,EAAOslD,GACrD,IAAIinB,EAAc98B,EAASA,EAAS,GAAI/yC,KAAK+rE,iBAAkB,CAAEzoE,MAAOA,EAAO09D,OAAQ19D,EAAM4mE,cAAeM,cAAeR,GAAc1mE,MAAO2oE,SAAS,IACzJjsE,KAAKysE,iBAAiBoD,EAAajnB,GACnCggB,GAAuB5oE,KAAK6oE,UAAW,QAAS7oE,KAAK6vB,KAAKvsB,MAAQA,IAEtEwnE,EAAgBzqE,UAAUyvE,aAAe,WACrC,OAAO9vE,KAAK6oE,UAAU/7D,KAAO,GAEjCg+D,EAAgBzqE,UAAU+qE,cAAgB,WAClCprE,KAAKqrE,aAELrrE,KAAK0vE,SAAW1vE,KAAKmyD,WACrBnyD,KAAK0vE,QAAQpG,eAAetpE,KAAKmyD,iBAC1BnyD,KAAK0vE,eACL1vE,KAAKmyD,UAEhBnyD,KAAK6uE,cACL7uE,KAAKgyC,cAAc3vC,SAAQ,SAAUujE,GAAO,OAAOA,EAAI/T,iBACvD7xD,KAAKgyC,cAAc9mC,QACnBlL,KAAK+qE,aAAamD,UAAUluE,KAAKsrE,SACjCtrE,KAAK6oE,UAAU39D,QACflL,KAAKqrE,YAAa,IAEfP,EA1ZW,CA2ZpBxZ,IAGF,SAAS4Z,GAAyC5nE,GAC9CusD,SAAW,SAAgB,kBAAmBvsD,EAAMmF,QAASnF,EAAMoF,OAEhE,SAAS6jE,GAAsBC,GAC9B3c,SAAWka,GAAgByC,IAC3B3c,SAAW,SAAgB,gCAAkC2c,EAAQpqE,KAAI,SAAUgwD,GAAK,OAAOA,EAAE7iD,KAAK5J,KAAK,QAASA,KAAK,MAAO6mE,GANxIxD,GAAsB8B,IClatB,IAAI,GAAiB9pE,OAAOX,UAAU+F,eAC/B,SAAS2pE,KAEZ,IADA,IAAI93D,EAAU,GACL6vC,EAAK,EAAGA,EAAKrqC,UAAUjY,OAAQsiD,IACpC7vC,EAAQ6vC,GAAMrqC,UAAUqqC,GAE5B,OAAOkoB,GAAe/3D,GAEnB,SAAS+3D,GAAe/3D,GAC3B,IAAIwvB,EAASxvB,EAAQ,IAAM,GACvB+F,EAAQ/F,EAAQzS,OACpB,GAAIwY,EAAQ,EAER,IADA,IAAIiyD,EAAS,IAAIC,GACRzqE,EAAI,EAAGA,EAAIuY,IAASvY,EACzBgiC,EAASwoC,EAAOtwC,MAAM8H,EAAQxvB,EAAQxS,IAG9C,OAAOgiC,EAEX,IAAI0oC,GAAoB,SAAU1oC,EAAQj2B,EAAQoB,GAC9C,OAAO5S,KAAK2/B,MAAM8H,EAAO70B,GAAWpB,EAAOoB,KAE3Cs9D,GAAc,WACd,SAASA,EAAWE,QACG,IAAfA,IAAyBA,EAAaD,IAC1CnwE,KAAKowE,WAAaA,EAClBpwE,KAAKuO,SAAWsmD,GAChB70D,KAAKqwE,WAAa,IAAIpkE,IAyC1B,OAvCAikE,EAAW7vE,UAAUs/B,MAAQ,SAAU8H,EAAQj2B,GAG3C,IAFA,IAAIy9C,EAAQjvD,KACRwpB,EAAU,GACLs+B,EAAK,EAAGA,EAAKrqC,UAAUjY,OAAQsiD,IACpCt+B,EAAQs+B,EAAK,GAAKrqC,UAAUqqC,GAEhC,OAAI+M,GAAgBrjD,IAAWqjD,GAAgBptB,IAC3CzmC,OAAOuF,KAAKiL,GAAQnP,SAAQ,SAAUmlD,GAClC,GAAI,GAAetmD,KAAKumC,EAAQ+f,GAAY,CACxC,IAAI8oB,EAAc7oC,EAAO+f,GACzB,GAAIh2C,EAAOg2C,KAAe8oB,EAAa,CACnC,IAAIltE,EAAS6rD,EAAMmhB,WAAWljE,MAAM+hD,EAAO/a,GAAc,CAACzM,EAAQj2B,EAAQg2C,GAAYh+B,GAAS,IAC3FpmB,IAAWktE,KACX7oC,EAASwnB,EAAMshB,oBAAoB9oC,IAC5B+f,GAAapkD,SAK5BqkC,EAASwnB,EAAMshB,oBAAoB9oC,IAC5B+f,GAAah2C,EAAOg2C,MAG5B/f,GAEJj2B,GAEX0+D,EAAW7vE,UAAUkwE,oBAAsB,SAAU7uE,GAUjD,OATImzD,GAAgBnzD,KAAW1B,KAAKqwE,WAAWlqE,IAAIzE,KAE3CA,EADAa,MAAMC,QAAQd,GACNA,EAAMoC,MAAM,GAGZivC,EAAS,CAAEJ,UAAW3xC,OAAOwZ,eAAe9Y,IAAUA,GAElE1B,KAAKqwE,WAAW/jE,IAAI5K,IAEjBA,GAEJwuE,EA9CM,GCrBbM,GAAiB,KAGjBC,GAAgB,GAChB7mD,GAAY,EAiHZ8mD,GAAY,oBACZC,GAAOpuE,MACPquE,GAAOD,GAAKD,KAAc,WAC1B,IAAIE,EAhHgD,WACpD,SAASA,IAIL5wE,KAAK+yB,GAAK,CACN,OACAnJ,KACA9L,KAAKC,MACLR,KAAKyN,SAAS/pB,SAAS,IAAI6C,MAAM,IACnC6B,KAAK,KAyFX,OAvFAirE,EAAKvwE,UAAUkzD,SAAW,WACtB,IAAK,IAAIsd,EAAYL,GAAgBK,EAAWA,EAAYA,EAAUjhD,OAGlE,GAAI5vB,KAAK+yB,MAAM89C,EAAUC,MAAO,CAC5B,IAAIpvE,EAAQmvE,EAAUC,MAAM9wE,KAAK+yB,IACjC,GAAIrxB,IAAU+uE,GACV,MAOJ,OANII,IAAcL,KAIdA,GAAeM,MAAM9wE,KAAK+yB,IAAMrxB,IAE7B,EASf,OANI8uE,KAIAA,GAAeM,MAAM9wE,KAAK+yB,IAAM09C,KAE7B,GAEXG,EAAKvwE,UAAUga,SAAW,WACtB,GAAIra,KAAKuzD,WACL,OAAOid,GAAeM,MAAM9wE,KAAK+yB,KAGzC69C,EAAKvwE,UAAU0wE,UAAY,SAAUrvE,EAAO2E,EAG5C4G,EAAM3G,GACF,IAAIwoD,EACAgiB,IAAShiB,EAAK,CACVnc,UAAW,OAEZ3yC,KAAK+yB,IAAMrxB,EACdotD,GACAl/B,EAAS4gD,GACbA,GAAiB,CAAE5gD,OAAQA,EAAQkhD,MAAOA,GAC1C,IAGI,OAAOzqE,EAAS6G,MAAM5G,EAAS2G,GAEnC,QACIujE,GAAiB5gD,IAKzBghD,EAAK/0C,KAAO,SAAUx1B,GAClB,IAAImjB,EAAUgnD,GACd,OAAO,WACH,IAAIQ,EAAQR,GACZ,IAEI,OADAA,GAAiBhnD,EACVnjB,EAAS6G,MAAMlN,KAAMyd,WAEhC,QACI+yD,GAAiBQ,KAK7BJ,EAAKK,UAAY,SAAU5qE,EAG3B4G,EAAM3G,GACF,IAAIkqE,GAaA,OAAOnqE,EAAS6G,MAAM5G,EAAS2G,GAZ/B,IAAI+jE,EAAQR,GACZ,IAII,OAHAA,GAAiB,KAGVnqE,EAAS6G,MAAM5G,EAAS2G,GAEnC,QACIujE,GAAiBQ,IAOtBJ,EAnG4C,GAiHnD,IACI5vE,OAAOuJ,eAAeomE,GAAMD,GAAW,CACnChvE,MAAOivE,GAAKD,IAAaE,EACzBv5B,YAAY,EACZD,UAAU,EACVE,cAAc,IAGtB,QACI,OAAOs5B,GAXe,GCrH9B,SAASM,MDoIEN,GAAK/0C,KAAkB+0C,GAAKK,UCnIvC,IAuFI,GAvFAvzC,GAAuB,WACvB,SAASA,EAAMlgB,EAAK2zD,QACJ,IAAR3zD,IAAkBA,EAAMkS,EAAAA,QACZ,IAAZyhD,IAAsBA,EAAUD,IACpClxE,KAAKwd,IAAMA,EACXxd,KAAKmxE,QAAUA,EACfnxE,KAAKoC,IAAM,IAAIsJ,IACf1L,KAAKoxE,OAAS,KACdpxE,KAAKqxE,OAAS,KA0ElB,OAxEA3zC,EAAMr9B,UAAU8F,IAAM,SAAUqD,GAC5B,OAAOxJ,KAAKoC,IAAI+D,IAAIqD,IAExBk0B,EAAMr9B,UAAU0E,IAAM,SAAUyE,GAC5B,IAAIstC,EAAO92C,KAAKsxE,QAAQ9nE,GACxB,OAAOstC,GAAQA,EAAKp1C,OAExBg8B,EAAMr9B,UAAUixE,QAAU,SAAU9nE,GAChC,IAAIstC,EAAO92C,KAAKoC,IAAI2C,IAAIyE,GACxB,GAAIstC,GAAQA,IAAS92C,KAAKoxE,OAAQ,CAC9B,IAAIG,EAAQz6B,EAAKy6B,MAAOC,EAAQ16B,EAAK06B,MACjCA,IACAA,EAAMD,MAAQA,GAEdA,IACAA,EAAMC,MAAQA,GAElB16B,EAAKy6B,MAAQvxE,KAAKoxE,OAClBt6B,EAAKy6B,MAAMC,MAAQ16B,EACnBA,EAAK06B,MAAQ,KACbxxE,KAAKoxE,OAASt6B,EACVA,IAAS92C,KAAKqxE,SACdrxE,KAAKqxE,OAASG,GAGtB,OAAO16B,GAEXpZ,EAAMr9B,UAAU6D,IAAM,SAAUsF,EAAK9H,GACjC,IAAIo1C,EAAO92C,KAAKsxE,QAAQ9nE,GACxB,OAAIstC,EACOA,EAAKp1C,MAAQA,GAExBo1C,EAAO,CACHttC,IAAKA,EACL9H,MAAOA,EACP8vE,MAAO,KACPD,MAAOvxE,KAAKoxE,QAEZpxE,KAAKoxE,SACLpxE,KAAKoxE,OAAOI,MAAQ16B,GAExB92C,KAAKoxE,OAASt6B,EACd92C,KAAKqxE,OAASrxE,KAAKqxE,QAAUv6B,EAC7B92C,KAAKoC,IAAI8B,IAAIsF,EAAKstC,GACXA,EAAKp1C,QAEhBg8B,EAAMr9B,UAAUoxE,MAAQ,WACpB,KAAOzxE,KAAKqxE,QAAUrxE,KAAKoC,IAAI0K,KAAO9M,KAAKwd,KACvCxd,KAAK4/D,OAAO5/D,KAAKqxE,OAAO7nE,MAGhCk0B,EAAMr9B,UAAUu/D,OAAS,SAAUp2D,GAC/B,IAAIstC,EAAO92C,KAAKoC,IAAI2C,IAAIyE,GACxB,QAAIstC,IACIA,IAAS92C,KAAKoxE,SACdpxE,KAAKoxE,OAASt6B,EAAKy6B,OAEnBz6B,IAAS92C,KAAKqxE,SACdrxE,KAAKqxE,OAASv6B,EAAK06B,OAEnB16B,EAAK06B,QACL16B,EAAK06B,MAAMD,MAAQz6B,EAAKy6B,OAExBz6B,EAAKy6B,QACLz6B,EAAKy6B,MAAMC,MAAQ16B,EAAK06B,OAE5BxxE,KAAKoC,IAAIw9D,OAAOp2D,GAChBxJ,KAAKmxE,QAAQr6B,EAAKp1C,MAAO8H,IAClB,IAIRk0B,EAlFe,GAqFtBg0C,GAAkB,IAAId,GAGtB,GAAiB5vE,OAAOX,UAAU+F,eAOtCs4B,QAAmC,KAAxB,GAAKn8B,MAAM6xC,MAAsB,SAAUlhC,GAClD,IAAI/F,EAAQ,GAEZ,OADA+F,EAAW7Q,SAAQ,SAAU4gD,GAAQ,OAAO91C,EAAM3G,KAAKy8C,MAChD91C,GACP,GACJ,SAASwkE,GAAiBC,GACtB,IAAI/f,EAAc+f,EAAW/f,YACF,mBAAhBA,IACP+f,EAAW/f,iBAAc,EACzBA,KAIR,IAAIggB,GAAe,GAInB,SAASC,GAAOr9B,EAAWs9B,GACvB,IAAKt9B,EACD,MAAM,IAAIvvC,MAAM6sE,GAAmB,qBAa3C,SAASC,GAAStwE,GACd,OAAQA,EAAM8D,QACV,KAAK,EAAG,MAAM,IAAIN,MAAM,iBACxB,KAAK,EAAG,OAAOxD,EAAM,GACrB,KAAK,EAAG,MAAMA,EAAM,IAM5B,IAAIuwE,GAAuB,WACvB,SAASA,EAAM57C,GACXr2B,KAAKq2B,GAAKA,EACVr2B,KAAKkyE,QAAU,IAAIjmE,IACnBjM,KAAKmyE,YAAc,IAAIzmE,IAIvB1L,KAAKoyE,cAAgB,KACrBpyE,KAAKqyE,OAAQ,EACbryE,KAAKsyE,aAAc,EACnBtyE,KAAK0B,MAAQ,GACb1B,KAAKuyE,KAAO,OACVN,EAAMj0D,MA8EZ,OA5EAi0D,EAAM5xE,UAAUigD,KAAO,WACnB,GAA0B,IAAtBtgD,KAAK0B,MAAM8D,SAAiBgtE,GAAaxyE,MAEzC,OADAyyE,GAAezyE,MACRA,KAAK0B,MAAM,IAS1BuwE,EAAM5xE,UAAUqyE,UAAY,SAAUzlE,GAGlC,OAFA6kE,IAAQ9xE,KAAKsyE,YAAa,uBAC1BG,GAAezyE,MACRwyE,GAAaxyE,MA+E5B,SAAyBmL,EAAO8B,GAS5B,OARA0lE,GAAexnE,GAEfumE,GAAgBX,UAAU5lE,EAAOynE,GAAmB,CAACznE,EAAO8B,IA4HhE,SAAwB9B,EAAO8B,GAC3B,GAA+B,mBAApB9B,EAAM8nD,UACb,IACI0e,GAAiBxmE,GACjBA,EAAM0mD,YAAc1mD,EAAM8nD,UAAU/lD,MAAM,KAAMD,GAEpD,MAAOxM,GAMH,OADA0K,EAAM0nE,YACC,EAKf,OAAO,EA5IHC,CAAe3nE,EAAO8B,IAyB9B,SAAkB9B,GACdA,EAAMknE,OAAQ,EACVG,GAAarnE,IAKjB4nE,GAAY5nE,GA7BR6nE,CAAS7nE,GAEN6mE,GAAS7mE,EAAMzJ,OAvFZuxE,CAAgBjzE,KAAMiN,GACtB+kE,GAAShyE,KAAK0B,QAExBuwE,EAAM5xE,UAAUwyE,SAAW,WACnB7yE,KAAKqyE,QAETryE,KAAKqyE,OAAQ,EACbryE,KAAK0B,MAAM8D,OAAS,EACpB0tE,GAAYlzE,MAIZ2xE,GAAiB3xE,QAErBiyE,EAAM5xE,UAAU8wE,QAAU,WACtB,IAAIliB,EAAQjvD,KACZA,KAAK6yE,WAILF,GAAe3yE,MAYfmzE,GAAWnzE,MAAM,SAAU4vB,EAAQyzC,GAC/BzzC,EAAOijD,WACPO,GAAYxjD,EAAQq/B,OAG5BgjB,EAAM5xE,UAAUgzE,OAAS,WAIrBrzE,KAAKmxE,WAETc,EAAM5xE,UAAUizE,SAAW,SAAUC,GACjCA,EAAIjnE,IAAItM,MACHA,KAAKuyE,OACNvyE,KAAKuyE,KAAOV,GAAal1D,OAAS,IAAI1Q,KAE1CjM,KAAKuyE,KAAKjmE,IAAIinE,IAElBtB,EAAM5xE,UAAUmzE,WAAa,WACzB,IAAIvkB,EAAQjvD,KACRA,KAAKuyE,OACL7zC,GAAQ1+B,KAAKuyE,MAAMlwE,SAAQ,SAAUkxE,GAAO,OAAOA,EAAI3T,OAAO3Q,MAC9DjvD,KAAKuyE,KAAKrnE,QACV2mE,GAAarrE,KAAKxG,KAAKuyE,MACvBvyE,KAAKuyE,KAAO,OAGpBN,EAAMj0D,MAAQ,EACPi0D,EA3Fe,GA6F1B,SAASQ,GAAepP,GACpB,IAAIzzC,EAAS8hD,GAAgBr3D,WAC7B,GAAIuV,EAWA,OAVAyzC,EAAM6O,QAAQ5lE,IAAIsjB,GACbA,EAAOuiD,YAAYhsE,IAAIk9D,IACxBzzC,EAAOuiD,YAAYjuE,IAAIm/D,EAAO,IAE9BmP,GAAanP,GACboQ,GAAiB7jD,EAAQyzC,GAGzBqQ,GAAiB9jD,EAAQyzC,GAEtBzzC,EAcf,SAASgjD,GAAkBznE,EAAO8B,GAC9B9B,EAAMmnE,aAAc,EAEpBnnE,EAAMzJ,MAAM8D,OAAS,EACrB,IAEI2F,EAAMzJ,MAAM,GAAKyJ,EAAMkrB,GAAGnpB,MAAM,KAAMD,GAE1C,MAAOxM,GAEH0K,EAAMzJ,MAAM,GAAKjB,EAGrB0K,EAAMmnE,aAAc,EAExB,SAASE,GAAarnE,GAClB,OAAOA,EAAMknE,UAAYlnE,EAAMinE,gBAAiBjnE,EAAMinE,cAActlE,MAWxE,SAASomE,GAAY7P,GACjB8P,GAAW9P,EAAOoQ,IAEtB,SAASV,GAAY1P,GACjB8P,GAAW9P,EAAOqQ,IAEtB,SAASP,GAAW9P,EAAOh9D,GACvB,IAAIstE,EAActQ,EAAM6O,QAAQplE,KAChC,GAAI6mE,EAEA,IADA,IAAIzB,EAAUxzC,GAAQ2kC,EAAM6O,SACnBzsE,EAAI,EAAGA,EAAIkuE,IAAeluE,EAC/BY,EAAS6rE,EAAQzsE,GAAI49D,GAKjC,SAASoQ,GAAiB7jD,EAAQyzC,GAG9ByO,GAAOliD,EAAOuiD,YAAYhsE,IAAIk9D,IAC9ByO,GAAOU,GAAanP,IACpB,IAAIuQ,GAAkBpB,GAAa5iD,GACnC,GAAKA,EAAOwiD,eAGP,GAAIxiD,EAAOwiD,cAAcjsE,IAAIk9D,GAI9B,YANAzzC,EAAOwiD,cAAgBP,GAAal1D,OAAS,IAAI1Q,IAQrD2jB,EAAOwiD,cAAc9lE,IAAI+2D,GAGrBuQ,GACAV,GAAYtjD,GAIpB,SAAS8jD,GAAiB9jD,EAAQyzC,GAG9ByO,GAAOliD,EAAOuiD,YAAYhsE,IAAIk9D,IAC9ByO,IAAQU,GAAanP,IACrB,IAnNa/B,EAAG7uB,EACZmJ,EAkNAi4B,EAAajkD,EAAOuiD,YAAYptE,IAAIs+D,GACd,IAAtBwQ,EAAWruE,OACXoqB,EAAOuiD,YAAYjuE,IAAIm/D,EAAiBA,EAAM3hE,MAnMrCoC,MAAM,KAlBNw9D,EAuNKuS,EAvNFphC,EAuNc4wB,EAAM3hE,OAtNhCk6C,EAAM0lB,EAAE97D,QAGN,GAEFo2C,IAAQnJ,EAAEjtC,QAEV87D,EAAE1lB,EAAM,KAAOnJ,EAAEmJ,EAAM,IAgNvBhsB,EAAOijD,YAEXiB,GAAiBlkD,EAAQyzC,GACrBmP,GAAa5iD,IAGjBmjD,GAAYnjD,GAEhB,SAASkkD,GAAiBlkD,EAAQyzC,GAC9B,IAAI0Q,EAAKnkD,EAAOwiD,cACZ2B,IACAA,EAAGnU,OAAOyD,GACM,IAAZ0Q,EAAGjnE,OACC+kE,GAAarsE,OA7ON,KA8OPqsE,GAAarrE,KAAKutE,GAEtBnkD,EAAOwiD,cAAgB,OAMnC,SAASO,GAAe/iD,GAChBA,EAAOuiD,YAAYrlE,KAAO,GAC1B8iB,EAAOuiD,YAAY9vE,SAAQ,SAAU2xE,EAAQ3Q,GACzC+P,GAAYxjD,EAAQyzC,MAK5BzzC,EAAO4jD,aAGP1B,GAAgC,OAAzBliD,EAAOwiD,eAElB,SAASgB,GAAYxjD,EAAQyzC,GACzBA,EAAM6O,QAAQtS,OAAOhwC,GACrBA,EAAOuiD,YAAYvS,OAAOyD,GAC1ByQ,GAAiBlkD,EAAQyzC,GAsB7B,IAAI4Q,GAAe,CACfpB,UAAU,EACV1B,SAAS,EACTkC,QAAQ,GAEZ,SAASE,GAAIzsE,GACT,IAAIotE,EAAY,IAAIxoE,IAChBunD,EAAYnsD,GAAWA,EAAQmsD,UACnC,SAASkhB,EAAO3qE,GACZ,IAAIomB,EAAS8hD,GAAgBr3D,WAC7B,GAAIuV,EAAQ,CACR,IAAIwkD,EAAQF,EAAUnvE,IAAIyE,GACrB4qE,GACDF,EAAUhwE,IAAIsF,EAAK4qE,EAAQ,IAAInoE,KAEnC2jB,EAAO0jD,SAASc,GACS,mBAAdnhB,IACP0e,GAAiByC,GACjBA,EAAMviB,YAAcoB,EAAUzpD,KAiB1C,OAbA2qE,EAAO9B,MAAQ,SAAe7oE,EAAK6qE,GAC/B,IAAId,EAAMW,EAAUnvE,IAAIyE,GACxB,GAAI+pE,EAAK,CACL,IAAIe,EAAOD,GACP,GAAenzE,KAAK+yE,GAAcI,GAAoBA,EAAkB,WAI5E31C,GAAQ60C,GAAKlxE,SAAQ,SAAU8I,GAAS,OAAOA,EAAMmpE,QACrDJ,EAAUtU,OAAOp2D,GACjBmoE,GAAiB4B,KAGlBY,EAGX,SAASI,KACL,IAAIC,EAAU,IAAI5R,GAAwB,mBAAZ71D,SAC9B,OAAO,WACH,OAAOynE,EAAQxR,YAAYvlD,YAUT82D,KAA1B,IACI/kD,GAAS,IAAIvjB,IACjB,SAAS,GAAKwoE,EAAkB3tE,QACZ,IAAZA,IAAsBA,EAAU9F,OAAO2H,OAAO,OAClD,IAAIsN,EAAQ,IAAIynB,GAAM52B,EAAQ0W,KAAOD,KAAKm3D,IAAI,EAAG,KAAK,SAAUvpE,GAAS,OAAOA,EAAMgmE,aAClFwD,EAAU7tE,EAAQ6tE,QAClBC,EAAe9tE,EAAQ8tE,cACvBL,KACA9F,EAAa,WACb,IAAIjlE,EAAMorE,EAAa1nE,MAAM,KAAMynE,EAAUA,EAAQznE,MAAM,KAAMuQ,WAAaA,WAC9E,QAAY,IAARjU,EACA,OAAOirE,EAAiBvnE,MAAM,KAAMuQ,WAExC,IAAItS,EAAQ8K,EAAMlR,IAAIyE,GACjB2B,IACD8K,EAAM/R,IAAIsF,EAAK2B,EAAQ,IAAI8mE,GAAMwC,IACjCtpE,EAAM8nD,UAAYnsD,EAAQmsD,UAG1B9nD,EAAMkoE,OAAS,WAAc,OAAOp9D,EAAM2pD,OAAOp2D,KAErD,IAAI9H,EAAQyJ,EAAMunE,UAAUnwE,MAAMlC,UAAUyD,MAAM5C,KAAKuc,YAYvD,OATAxH,EAAM/R,IAAIsF,EAAK2B,GACfqkB,GAAOljB,IAAI2J,GAINy7D,GAAgBne,aACjB/jC,GAAOntB,SAAQ,SAAU4T,GAAS,OAAOA,EAAMw7D,WAC/CjiD,GAAOtkB,SAEJxJ,GASX,SAASmzE,EAASrrE,GACd,IAAI2B,EAAQ8K,EAAMlR,IAAIyE,GAClB2B,GACAA,EAAM0nE,WAOd,SAASiC,EAAQtrE,GACb,IAAI2B,EAAQ8K,EAAMlR,IAAIyE,GACtB,GAAI2B,EACA,OAAOA,EAAMm1C,OAOrB,SAASy0B,EAAUvrE,GACf,OAAOyM,EAAM2pD,OAAOp2D,GAUxB,OAtCAxI,OAAOuJ,eAAekkE,EAAY,OAAQ,CACtC1pE,IAAK,WACD,OAAOkR,EAAW,IAAEnJ,MAExBwqC,cAAc,EACdD,YAAY,IAQhBo3B,EAAWoG,SAAWA,EACtBpG,EAAW4D,MAAQ,WACfwC,EAASD,EAAa1nE,MAAM,KAAMuQ,aAQtCgxD,EAAWqG,QAAUA,EACrBrG,EAAWnuB,KAAO,WACd,OAAOw0B,EAAQF,EAAa1nE,MAAM,KAAMuQ,aAK5CgxD,EAAWsG,UAAYA,EACvBtG,EAAW4E,OAAS,WAChB,OAAO0B,EAAUH,EAAa1nE,MAAM,KAAMuQ,aAE9CgxD,EAAWmG,aAAeA,EAC1BnG,EAAWuG,OAASL,EAAU,WAC1B,OAAOC,EAAa1nE,MAAM,KAAMynE,EAAQznE,MAAM,KAAMuQ,aACpDm3D,EACG5zE,OAAOq5D,OAAOoU,GCzgBlB,IAAIwG,GAAY,IAAIrE,GACvBsE,GAAe,IAAInoE,QACvB,SAASooE,GAAal/D,GAClB,IAAIisD,EAAOgT,GAAanwE,IAAIkR,GAO5B,OANKisD,GACDgT,GAAahxE,IAAI+R,EAAOisD,EAAO,CAC3BmL,KAAM,IAAIphE,IACVsnE,IAAKA,OAGNrR,EAEJ,SAASkT,GAAYn/D,GACxBk/D,GAAal/D,GAAOo3D,KAAKhrE,SAAQ,SAAUgzE,GAAM,OAAOA,EAAGD,YAAYn/D,MAKpE,SAASq/D,GAAQ5zE,GACpB,IAAI8tB,EAAS,IAAIvjB,IACbspE,EAAY,IAAItpE,IAChBopE,EAAK,SAAUthE,GACf,GAAI0J,UAAUjY,OAAS,GACnB,GAAI9D,IAAUqS,EAAU,CACpBrS,EAAQqS,EACRyb,EAAOntB,SAAQ,SAAU4T,GACrBk/D,GAAal/D,GAAOs9D,IAAIlB,MAAMgD,GAC9BG,GAAUv/D,MAEd,IAAIw/D,EAAelzE,MAAM6xC,KAAKmhC,GAC9BA,EAAUrqE,QACVuqE,EAAapzE,SAAQ,SAAUqzE,GAAY,OAAOA,EAASh0E,WAG9D,CACD,IAAIuU,EAAQg/D,GAAU56D,WAClBpE,IACA0/D,EAAO1/D,GACPk/D,GAAal/D,GAAOs9D,IAAI8B,IAGhC,OAAO3zE,GAEX2zE,EAAGO,aAAe,SAAUF,GAExB,OADAH,EAAUjpE,IAAIopE,GACP,WACHH,EAAU3V,OAAO8V,KAGzB,IAAIC,EAASN,EAAGQ,YAAc,SAAU5/D,GAGpC,OAFAuZ,EAAOljB,IAAI2J,GACXk/D,GAAal/D,GAAOo3D,KAAK/gE,IAAI+oE,GACtBA,GAGX,OADAA,EAAGD,YAAc,SAAUn/D,GAAS,OAAOuZ,EAAOowC,OAAO3pD,IAClDo/D,EAEX,SAASG,GAAUv/D,GACXA,EAAM6/D,kBACN7/D,EAAM6/D,mBCxDd,IAAIC,GAAc,WACd,SAASA,EAAWjnB,GAChB,IAAI74C,EAAQ64C,EAAG74C,MAAOwyC,EAASqG,EAAGrG,OAAQutB,EAAYlnB,EAAGknB,UAAWC,EAAkBnnB,EAAGmnB,gBACzFj2E,KAAKiW,MAAQA,EACTwyC,IACAzoD,KAAKyoD,OAASA,GAEdutB,GACAh2E,KAAKk2E,aAAaF,GAElBC,GACAj2E,KAAKm2E,mBAAmBF,GAuPhC,OApPAF,EAAW11E,UAAU61E,aAAe,SAAUF,GAC1C,IAAI/mB,EAAQjvD,KACZA,KAAKg2E,UAAYh2E,KAAKg2E,WAAa,GAC/BzzE,MAAMC,QAAQwzE,GACdA,EAAU3zE,SAAQ,SAAU+zE,GACxBnnB,EAAM+mB,UAAYjG,GAAU9gB,EAAM+mB,UAAWI,MAIjDp2E,KAAKg2E,UAAYjG,GAAU/vE,KAAKg2E,UAAWA,IAGnDD,EAAW11E,UAAUg2E,aAAe,SAAUL,GAC1Ch2E,KAAKg2E,UAAY,GACjBh2E,KAAKk2E,aAAaF,IAEtBD,EAAW11E,UAAUi2E,aAAe,WAChC,OAAOt2E,KAAKg2E,WAAa,IAE7BD,EAAW11E,UAAUk2E,aAAe,SAAUznB,GAC1C,IAAIiG,EAAWjG,EAAGiG,SAAUyhB,EAAe1nB,EAAG0nB,aAAchtD,EAAUslC,EAAGtlC,QAASo/B,EAAYkG,EAAGlG,UAAWyV,EAAKvP,EAAG2nB,uBAAwBA,OAAgC,IAAPpY,GAAwBA,EAC7L,OAAOlrB,GAAUnzC,UAAM,OAAQ,GAAQ,WACnC,OAAOwzC,GAAYxzC,MAAM,SAAU6/D,GAC/B,OAAI9K,EACO,CAAC,EAAG/0D,KAAK02E,gBAAgB3hB,EAAUyhB,EAAa3pE,KAAM2c,EAASo/B,EAAW5oD,KAAKi2E,gBAAiBQ,GAAwBrxE,MAAK,SAAUuxE,GAAe,OAAQ5jC,EAASA,EAAS,GAAIyjC,GAAe,CAAE3pE,KAAM8pE,EAAYvzE,aAE3N,CAAC,EAAGozE,UAIvBT,EAAW11E,UAAU81E,mBAAqB,SAAUF,GAChDj2E,KAAKi2E,gBAAkBA,GAE3BF,EAAW11E,UAAUu2E,mBAAqB,WACtC,OAAO52E,KAAKi2E,iBAEhBF,EAAW11E,UAAUw2E,YAAc,SAAU9hB,GACzC,OAAIuT,GAAc,CAAC,UAAWvT,IACtB/0D,KAAKg2E,UACEjhB,EAGR,MAEXghB,EAAW11E,UAAUy2E,YAAc,SAAU/hB,GACzC,OfgMD,SAAsCA,GACzC6C,GAAc7C,GACd,IAAI4R,EAAcL,GAA6B,CAC3C,CACIhlE,KAAM,SAAU+kE,GAAa,MAAgC,WAAzBA,EAAUjlE,KAAKM,OACnDujC,QAAQ,IAEb8vB,GAiBH,OAhBI4R,IACAA,EAAcrM,GAAMqM,EAAa,CAC7B7tB,mBAAoB,CAChB4iB,MAAO,SAAU5kB,GACb,GAAIA,EAAK4K,cACgB5K,EAAK4K,aAAae,WAAW5a,OAAM,SAAU0tB,GAC9D,OAAO,GAAQA,IAAuC,eAAzBA,EAAUn0D,KAAKM,SAG5C,OAAO,UAOxBilE,EexNIoQ,CAA6BhiB,IAExCghB,EAAW11E,UAAU22E,eAAiB,SAAUxtD,GAC5C,IAAIvT,EAAQjW,KAAKiW,MACjB,OAAO88B,EAASA,EAAS,GAAIvpB,GAAU,CAAEvT,MAAOA,EAAOghE,YAAa,SAAUn2E,GACtE,OAAOmV,EAAMihE,SAASp2E,OAGlCi1E,EAAW11E,UAAU82E,qBAAuB,SAAUpiB,EAAUnM,EAAWp/B,GAGvE,YAFkB,IAAdo/B,IAAwBA,EAAY,SACxB,IAAZp/B,IAAsBA,EAAU,IAC7B2pB,GAAUnzC,UAAM,OAAQ,GAAQ,WACnC,OAAOwzC,GAAYxzC,MAAM,SAAU8uD,GAC/B,OAAIiG,EACO,CAAC,EAAG/0D,KAAK02E,gBAAgB3hB,EAAU/0D,KAAKo3E,wBAAwBriB,EAAUnM,IAAc,GAAI5oD,KAAKg3E,eAAextD,GAAUo/B,GAAWxjD,MAAK,SAAUyH,GAAQ,OAAQkmC,EAASA,EAAS,GAAI6V,GAAY/7C,EAAKwqE,uBAE/M,CAAC,EAAGtkC,EAAS,GAAI6V,WAIpCmtB,EAAW11E,UAAUi3E,qBAAuB,SAAUviB,GAClD,IAAIwiB,GAAiB,EAiBrB,OAhBAjd,GAAMvF,EAAU,CACZvb,UAAW,CACPkiB,MAAO,SAAU5kB,GACb,GAAwB,WAApBA,EAAK11C,KAAKM,OAAsBo1C,EAAKr5B,YACrC85D,EAAiBzgC,EAAKr5B,UAAUktB,MAAK,SAAUttB,GAC3C,MAA0B,WAAnBA,EAAIjc,KAAKM,OACO,iBAAnB2b,EAAI3b,MAAMu2C,OACU,IAApB56B,EAAI3b,MAAMA,UAGd,OAAO04D,OAMpBmd,GAEXxB,EAAW11E,UAAU+2E,wBAA0B,SAAUriB,EAAUnM,GAC/D,OAAO5oD,KAAKiW,MAAMk2D,KAAK,CACnBxjB,MAAOkf,GAA2B9S,GAClCnM,UAAWA,EACXyjB,mBAAmB,EACnBoC,YAAY,IACbrrE,QAEP2yE,EAAW11E,UAAUq2E,gBAAkB,SAAU3hB,EAAUyiB,EAAWhuD,EAASo/B,EAAWqtB,EAAiBQ,GAKvG,YAJgB,IAAZjtD,IAAsBA,EAAU,SAClB,IAAdo/B,IAAwBA,EAAY,SAChB,IAApBqtB,IAA8BA,EAAkB,WAAc,OAAO,SAC1C,IAA3BQ,IAAqCA,GAAyB,GAC3DtjC,GAAUnzC,UAAM,OAAQ,GAAQ,WACnC,IAAIy3E,EAAgBxiB,EAAWO,EAAakiB,EAAqBC,EAAsB7oB,EAAI74C,EAAOwyC,EAAQmvB,EAC1G,OAAOpkC,GAAYxzC,MAAM,SAAUq+D,GAoB/B,OAnBAoZ,EAAiBtf,GAAkBpD,GACnCE,EAAY+C,GAAuBjD,GACnCS,EAAcL,GAAkBF,GAChCyiB,EAAsBD,EACjBn2B,UACLq2B,EAAuBD,EACjBA,EAAoBtuD,OAAO,GAAG/hB,cAC5BqwE,EAAoB5zE,MAAM,GAC5B,QACKmS,GAAX64C,EAAK9uD,MAAiBiW,MAAOwyC,EAASqG,EAAGrG,OACzCmvB,EAAc,CACVpiB,YAAaA,EACbhsC,QAASupB,EAASA,EAAS,GAAIvpB,GAAU,CAAEvT,MAAOA,EAAOwyC,OAAQA,IACjEG,UAAWA,EACXqtB,gBAAiBA,EACjB0B,qBAAsBA,EACtBN,kBAAmB,GACnBZ,uBAAwBA,GAErB,CAAC,EAAGz2E,KAAK63E,oBAAoBJ,EAAe/1B,aAAc81B,EAAWI,GAAaxyE,MAAK,SAAUhC,GAAU,MAAO,CACjHA,OAAQA,EACRi0E,kBAAmBO,EAAYP,8BAKnDtB,EAAW11E,UAAUw3E,oBAAsB,SAAUn2B,EAAc81B,EAAWI,GAC1E,OAAOzkC,GAAUnzC,UAAM,OAAQ,GAAQ,WACnC,IAAIw1D,EAAahsC,EAASo/B,EAAWkvB,EAAgBve,EACjDtK,EAAQjvD,KACZ,OAAOwzC,GAAYxzC,MAAM,SAAU8uD,GAqC/B,OApCA0G,EAAcoiB,EAAYpiB,YAAahsC,EAAUouD,EAAYpuD,QAASo/B,EAAYgvB,EAAYhvB,UAC9FkvB,EAAiB,CAACN,GAClBje,EAAU,SAAUhE,GAAa,OAAOpiB,GAAU8b,OAAO,OAAQ,GAAQ,WACrE,IAAIoG,EAAU7R,EACd,OAAOhQ,GAAYxzC,MAAM,SAAU8uD,GAC/B,OAAKgZ,GAAcvS,EAAW3M,GAG1B,GAAQ2M,GACD,CAAC,EAAGv1D,KAAK+3E,aAAaxiB,EAAWiiB,EAAWI,GAAaxyE,MAAK,SAAU4yE,GACvE,IAAIlpB,OACuB,IAAhBkpB,GACPF,EAAetxE,OAAMsoD,EAAK,IACnByI,GAAuBhC,IAAcyiB,EACxClpB,SAIhB6I,GAAiBpC,GACjBF,EAAWE,GAGXF,EAAWG,EAAYD,EAAUn0D,KAAKM,OACtCmuD,QAAU,GAAUwF,EAAU,qBAAuBE,EAAUn0D,KAAKM,OAAS,GAAU2zD,EAAU,KAEjGA,GAAYA,EAAS7R,gBACrBA,EAAgB6R,EAAS7R,cAAcpiD,KAAKM,MACxCk2E,EAAY3B,gBAAgBuB,EAAWh0B,EAAeh6B,IAC/C,CAAC,EAAGxpB,KAAK63E,oBAAoBxiB,EAAS3T,aAAc81B,EAAWI,GAAaxyE,MAAK,SAAU6yE,GAC1FH,EAAetxE,KAAKyxE,OAI7B,CAAC,IA3BG,CAAC,UA8Bb,CAAC,EAAGn1E,QAAQo1E,IAAIx2B,EAAae,WAAWrgD,IAAIm3D,IAAUn0D,MAAK,WAC1D,OAAO4qE,GAAe8H,cAK1C/B,EAAW11E,UAAU03E,aAAe,SAAU7uB,EAAOsuB,EAAWI,GAC5D,OAAOzkC,GAAUnzC,UAAM,OAAQ,GAAQ,WACnC,IAAI4oD,EAAWkO,EAAWqhB,EAAkBC,EAAWC,EAAeC,EAAeC,EAAcC,EAAat1E,EAC5G+rD,EAAQjvD,KACZ,OAAOwzC,GAAYxzC,MAAM,SAAU8uD,GAuB/B,OAtBAlG,EAAYgvB,EAAYhvB,UACxBkO,EAAY5N,EAAM9nD,KAAKM,MACvBy2E,EAAmB5gB,GAAuBrO,GAC1CkvB,EAAYthB,IAAcqhB,EAC1BE,EAAgBb,EAAUW,IAAqBX,EAAU1gB,GACzDwhB,EAAgBx1E,QAAQI,QAAQm1E,GAC3BT,EAAYnB,yBACbz2E,KAAKs3E,qBAAqBpuB,KAC1BqvB,EAAef,EAAU/f,YAAcmgB,EAAYD,sBACnDa,EAAcx4E,KAAKg2E,WAAah2E,KAAKg2E,UAAUuC,MAE3Cr1E,EAAUs1E,EAAYJ,EAAYthB,EAAYqhB,MAE1CG,EAAgBx1E,QAAQI,QAAQ+xE,GAAUlE,UAAU/wE,KAAKiW,MAAO/S,EAAS,CACrEs0E,EACAngB,GAAyBnO,EAAON,GAChCgvB,EAAYpuD,QACZ,CAAE0/B,MAAOA,EAAOsM,YAAaoiB,EAAYpiB,kBAKlD,CAAC,EAAG8iB,EAAclzE,MAAK,SAAUhC,GAahC,YAZe,IAAXA,IAAqBA,EAASi1E,GAC9BnvB,EAAMzH,YACNyH,EAAMzH,WAAWp/C,SAAQ,SAAUgkE,GACF,WAAzBA,EAAUjlE,KAAKM,OAAsB2kE,EAAU5oD,WAC/C4oD,EAAU5oD,UAAUpb,SAAQ,SAAUgb,GACX,OAAnBA,EAAIjc,KAAKM,OAAqC,gBAAnB2b,EAAI3b,MAAMu2C,OACrC2/B,EAAYP,kBAAkBh6D,EAAI3b,MAAMA,OAAS0B,SAMhE8lD,EAAMxH,aAGG,MAAVt+C,EACOA,EAEPb,MAAMC,QAAQY,GACP6rD,EAAMwpB,wBAAwBvvB,EAAO9lD,EAAQw0E,GAEpD1uB,EAAMxH,aACCuN,EAAM4oB,oBAAoB3uB,EAAMxH,aAAct+C,EAAQw0E,QADjE,EARWx0E,aAe/B2yE,EAAW11E,UAAUo4E,wBAA0B,SAAUvvB,EAAO9lD,EAAQw0E,GACpE,IAAI3oB,EAAQjvD,KACZ,OAAO8C,QAAQo1E,IAAI90E,EAAOhB,KAAI,SAAU6gD,GACpC,OAAa,OAATA,EACO,KAEP1gD,MAAMC,QAAQygD,GACPgM,EAAMwpB,wBAAwBvvB,EAAOjG,EAAM20B,GAElD1uB,EAAMxH,aACCuN,EAAM4oB,oBAAoB3uB,EAAMxH,aAAcuB,EAAM20B,QAD/D,OAKD7B,EAlQM,GCAb2C,GAA0B,IAAKpV,GAAgBv2D,QAAUrB,KAC7D,SAASitE,GAA2B1iE,EAAOke,GACvC,IAAImwC,EAAWruD,EAAMke,GACG,mBAAbmwC,IACPruD,EAAMke,GAAc,WAEhB,OADAukD,GAAwBx0E,IAAI+R,GAAQyiE,GAAwB3zE,IAAIkR,GAAS,GAAK,MACvEquD,EAASp3D,MAAMlN,KAAMyd,aAIxC,SAASm7D,GAAoB1W,GACrBA,EAAoB,gBACpBl4C,aAAak4C,EAAoB,eACjCA,EAAoB,mBAAI,GAGhC,IAAI2W,GAAa,WACb,SAASA,EAAU9N,EAAcO,QACb,IAAZA,IAAsBA,EAAUP,EAAaQ,mBACjDvrE,KAAKsrE,QAAUA,EACftrE,KAAKu1E,UAAY,IAAItpE,IACrBjM,KAAK+0D,SAAW,KAChB/0D,KAAK84E,cAAgB,EACrB94E,KAAKgyC,cAAgB,IAAI/lC,IACzBjM,KAAK+4E,SAAU,EACf/4E,KAAKqyE,OAAQ,EACbryE,KAAKg5E,gBAAkB,KACvB,IAAI/iE,EAAQjW,KAAKiW,MAAQ80D,EAAa90D,MACjCyiE,GAAwBvyE,IAAI8P,KAC7ByiE,GAAwBx0E,IAAI+R,EAAO,GACnC0iE,GAA2B1iE,EAAO,SAClC0iE,GAA2B1iE,EAAO,UAClC0iE,GAA2B1iE,EAAO,UA6N1C,OA1NA4iE,EAAUx4E,UAAUwI,KAAO,SAAU8/C,GACjC,IAAI6hB,EAAgB7hB,EAAM6hB,eAAiBR,GAAciC,QAsBzD,OArBIjsE,KAAK4oD,WACL5oD,KAAKwqE,gBAAkBR,GAAciC,UACpC5K,GAAMrhE,KAAK4oD,UAAWD,EAAMC,aAC7B4hB,EAAgBR,GAAcwE,cAE7BnN,GAAM1Y,EAAMC,UAAW5oD,KAAK4oD,aAC7B5oD,KAAKi5E,cAAW,GAEpBj4E,OAAO+9B,OAAO/+B,KAAM,CAChB+0D,SAAUpM,EAAMoM,SAChBnM,UAAWD,EAAMC,UACjBwhB,aAAc,KACdF,cAAelqE,KAAKkqE,eAAiB,GACrCM,cAAeA,IAEf7hB,EAAMqwB,iBACNh5E,KAAK+uE,mBAAmBpmB,EAAMqwB,iBAE9BrwB,EAAMmwB,gBACN94E,KAAK84E,cAAgBnwB,EAAMmwB,eAExB94E,MAEX64E,EAAUx4E,UAAU2kE,MAAQ,WACxB4T,GAAoB54E,MACpBA,KAAKi5E,cAAW,EAChBj5E,KAAKqyE,OAAQ,GAEjBwG,EAAUx4E,UAAU+rE,QAAU,SAAUxjB,QAClB,IAAdA,IAAwBA,EAAY5oD,KAAK4oD,WAC7C,IAAI9hD,EAAU9G,KAAKk5E,eAAetwB,GAClC,GAAI5oD,KAAKi5E,UAAY5X,GAAMv6D,EAAS9G,KAAKi5E,SAASnyE,SAC9C,OAAO9G,KAAKi5E,SAAS9M,KAEzBnsE,KAAKm5E,YAAYn5E,KAAK4oD,UAAYA,GAClC,IAAIwwB,EAAKp5E,KAAKg5E,gBACd,GAAII,GAAiC,aAA3BA,EAAGtyE,QAAQ8iD,YACjB,MAAO,CAAEkJ,UAAU,GAEvB,IAAIqZ,EAAOnsE,KAAKiW,MAAMk2D,KAAKrlE,GAE3B,OADA9G,KAAKq5E,eAAelN,EAAMrlE,GACnBqlE,GAEX0M,EAAUx4E,UAAUg5E,eAAiB,SAAUlN,EAAMrlE,GACjD9G,KAAKi5E,SAAW9M,EAAO,CACnBA,KAAMA,EACNrlE,QAASA,GAAW9G,KAAKk5E,uBACzB,GAERL,EAAUx4E,UAAU64E,eAAiB,SAAUtwB,GAC3C,IAAIkG,EAEJ,YADkB,IAAdlG,IAAwBA,EAAY5oD,KAAK4oD,WACtC,CACHD,MAAO3oD,KAAK+0D,SACZnM,UAAWA,EACXyjB,mBAAmB,EACnBoC,YAAY,EACZ6K,gBAAiD,QAA/BxqB,EAAK9uD,KAAKg5E,uBAAoC,IAAPlqB,OAAgB,EAASA,EAAGhoD,QAAQwyE,kBAGrGT,EAAUx4E,UAAUk5E,QAAU,SAAUpN,GACpC,IAAIld,EAAQjvD,KACRw5E,EAAUx5E,KAAKi5E,UAAYj5E,KAAKi5E,SAAS9M,KAC7CnsE,KAAKq5E,eAAelN,GACfnsE,KAAKqyE,OACLhR,GAAMmY,GAAWA,EAAQp2E,OAAQ+oE,GAAQA,EAAK/oE,UAC/CpD,KAAKqyE,OAAQ,EACRryE,KAAKy5E,gBACNz5E,KAAKy5E,cAAgBtvD,YAAW,WAAc,OAAO8kC,EAAMyqB,WAAa,MAIpFb,EAAUx4E,UAAU0uE,mBAAqB,SAAUqK,GAC/C,IAAInqB,EAAQjvD,KACRo5E,IAAOp5E,KAAKg5E,kBAEZh5E,KAAK25E,YACL35E,KAAKu1E,UAAU3V,OAAO5/D,KAAK25E,YAE/B35E,KAAKg5E,gBAAkBI,EACnBA,GACAA,EAAc,UAAIp5E,KAClBA,KAAKu1E,UAAUjpE,IAAItM,KAAK25E,WAAa,WAC7B1qB,EAAMmd,UAAUwN,0BAChBR,EAAY,UAGZA,EAAGjO,sBAKJnrE,KAAK25E,aAGpBd,EAAUx4E,UAAUq5E,OAAS,WACzB,IAAIzqB,EAAQjvD,KACZ44E,GAAoB54E,MAChBA,KAAK65E,gBACL75E,KAAKu1E,UAAUlzE,SAAQ,SAAUqzE,GAAY,OAAOA,EAASzmB,MAEjEjvD,KAAKqyE,OAAQ,GAEjBwG,EAAUx4E,UAAUw5E,aAAe,WAC/B,IAAK75E,KAAKqyE,QAAUryE,KAAKu1E,UAAUzoE,KAC/B,OAAO,EAEX,GAAIy9D,GAAyBvqE,KAAKwqE,gBAC9BxqE,KAAKg5E,gBAAiB,CACtB,IAAIpvB,EAAc5pD,KAAKg5E,gBAAgBlyE,QAAQ8iD,YAC/C,GAAoB,eAAhBA,GACgB,sBAAhBA,EACA,OAAO,EAGf,OAAO,GAEXivB,EAAUx4E,UAAUy5E,KAAO,WACvB,IAAK95E,KAAK+4E,QAAS,CACf/4E,KAAK+4E,SAAU,EACf/4E,KAAKglE,QACLhlE,KAAKo9B,SACLp9B,KAAKo9B,OAASy7C,EAAUx4E,UAAU+8B,OAClCp9B,KAAKgyC,cAAc3vC,SAAQ,SAAUujE,GAAO,OAAOA,EAAI/T,iBACvD,IAAIunB,EAAKp5E,KAAKg5E,gBACVI,GACAA,EAAGvK,gBAGfgK,EAAUx4E,UAAU+8B,OAAS,aAC7By7C,EAAUx4E,UAAU84E,YAAc,SAAUvwB,GACxC,IAAIqG,EAAQjvD,UACM,IAAd4oD,IAAwBA,EAAY5oD,KAAK4oD,WAC7C,IAAIwwB,EAAKp5E,KAAKg5E,gBACd,IAAII,GAAiC,aAA3BA,EAAGtyE,QAAQ8iD,YAArB,CAGA,IAAImwB,EAAehnC,EAASA,EAAS,GAAI/yC,KAAKk5E,eAAetwB,IAAa,CAAEoxB,QAASh6E,KAAMqG,SAAU,SAAU8lE,GAAQ,OAAOld,EAAMsqB,QAAQpN,MACvInsE,KAAKi6E,WACL5Y,GAAM0Y,EAAc/5E,KAAKi6E,aAC1Bj6E,KAAKo9B,SACLp9B,KAAKo9B,OAASp9B,KAAKiW,MAAMikE,MAAMl6E,KAAKi6E,UAAYF,MAGxDlB,EAAUx4E,UAAUitE,eAAiB,WACjCttE,KAAKm6E,eAAY,GAErBtB,EAAUx4E,UAAU+5E,YAAc,SAAUh3E,EAAQwlD,GAChD,IAAIuxB,EAAYn6E,KAAKm6E,UACrB,QAASA,GACLA,EAAUE,UAAY3B,GAAwB3zE,IAAI/E,KAAKiW,QACvDorD,GAAMzY,EAAWuxB,EAAUvxB,YAC3ByY,GAAMj+D,EAAOyJ,KAAMstE,EAAU/2E,OAAOyJ,QAE5CgsE,EAAUx4E,UAAUi6E,WAAa,SAAUl3E,EAAQ0D,EAASyzE,GACxD,IAAItrB,EAAQjvD,KACZA,KAAKkqE,cAAgBH,GAAgB3mE,EAAO49D,QAAU59D,EAAO49D,OAAS,GACtEhhE,KAAKglE,QACuB,aAAxBl+D,EAAQ8iD,YACR5pD,KAAKq5E,eAAe,CAAEj2E,OAAQA,EAAOyJ,KAAMimD,UAAU,GAAQ9yD,KAAKk5E,eAAepyE,EAAQ8hD,YAE7D,IAAvB2xB,IACDC,GAAkBp3E,EAAQ0D,EAAQ2zE,aAClCz6E,KAAKiW,MAAMykE,oBAAmB,SAAUzkE,GACpC,GAAIg5C,EAAMmrB,YAAYh3E,EAAQ0D,EAAQ8hD,WAClC3yC,EAAM+3D,WAAW,CACbrlB,MAAOsG,EAAM8F,SACbloD,KAAMzJ,EAAOyJ,KACb+7C,UAAW9hD,EAAQ8hD,UACnB+xB,UAAkC,IAAvBJ,IAEftrB,EAAMkrB,UAAY,CACd/2E,OAAQA,EACRwlD,UAAW9hD,EAAQ8hD,UACnByxB,QAAS3B,GAAwB3zE,IAAIkqD,EAAMh5C,aAI/C,GAAIg5C,EAAMgqB,UACNhqB,EAAMgqB,SAAS9M,KAAKrZ,SAEpB,YADA1vD,EAAOyJ,KAAOoiD,EAAMgqB,SAAS9M,KAAK/oE,QAI1C,IAAIw3E,EAAc3rB,EAAMiqB,eAAepyE,EAAQ8hD,WAC3CujB,EAAOl2D,EAAMk2D,KAAKyO,GACjB3rB,EAAM8pB,SACP9pB,EAAMkqB,YAAYryE,EAAQ8hD,WAE9BqG,EAAMoqB,eAAelN,EAAMyO,GACvBzO,EAAKrZ,WACL1vD,EAAOyJ,KAAOs/D,EAAK/oE,WAK3BpD,KAAKm6E,eAAY,IAI7BtB,EAAUx4E,UAAUw6E,UAAY,WAE5B,OADA76E,KAAKoqE,aAAe,KACbpqE,KAAKwqE,cAAgBR,GAAcgC,OAE9C6M,EAAUx4E,UAAUy6E,UAAY,SAAUx3E,GAUtC,OATAtD,KAAKwqE,cAAgBR,GAAc1mE,MACnCtD,KAAKm6E,eAAY,EACjBn6E,KAAKglE,QACD1hE,EAAM4mE,gBACNlqE,KAAKkqE,cAAgB5mE,EAAM4mE,eAE3B5mE,EAAM8mE,eACNpqE,KAAKoqE,aAAe9mE,EAAM8mE,cAEvB9mE,GAEJu1E,EA7OK,GAgPT,SAAS2B,GAAkBp3E,EAAQq3E,QAClB,IAAhBA,IAA0BA,EAAc,QAC5C,IAAIM,EAA+B,WAAhBN,GACC,QAAhBA,EACAO,GAAmBnV,GAAsBziE,GAI7C,OAHK43E,GAAmBD,GAAgB33E,EAAOyJ,OAC3CmuE,GAAkB,GAEfA,EClQX,IAAI,GAAiBh6E,OAAOX,UAAU+F,eAClC60E,GAAgB,WAChB,SAASA,EAAansB,GAClB,IAAI74C,EAAQ64C,EAAG74C,MAAO8iD,EAAOjK,EAAGiK,KAAMsF,EAAKvP,EAAGosB,mBAAoBA,OAA4B,IAAP7c,GAAwBA,EAAI8c,EAAcrsB,EAAGqsB,YAAatb,EAAK/Q,EAAGmgB,QAASA,OAAiB,IAAPpP,GAAwBA,EAAII,EAAKnR,EAAGmQ,gBAAiBA,OAAyB,IAAPgB,EAAgB,GAAKA,EAAImb,EAAatsB,EAAGssB,WAAY7L,EAAyBzgB,EAAGygB,uBACpUvvE,KAAKi/D,gBAAkB,GACvBj/D,KAAKq7E,QAAU,IAAI3vE,IACnB1L,KAAKs7E,eAAiB,IAAI5vE,IAC1B1L,KAAKu7E,eAAiB,IAAKjY,GAAgBv2D,QAAUrB,KACrD1L,KAAKw7E,eAAiB,EACtBx7E,KAAKy7E,iBAAmB,EACxBz7E,KAAK07E,kBAAoB,EACzB17E,KAAK27E,wBAA0B,IAAIjwE,IACnC1L,KAAKiW,MAAQA,EACbjW,KAAK+4D,KAAOA,EACZ/4D,KAAKk7E,mBAAqBA,EAC1Bl7E,KAAKi/D,gBAAkBA,EACvBj/D,KAAKo7E,WAAaA,GAAc,IAAIrF,GAAW,CAAE9/D,MAAOA,IACxDjW,KAAKivE,QAAUA,EACfjvE,KAAKuvE,yBAA2BA,GAC3BvvE,KAAKm7E,YAAcA,KACpBn7E,KAAK47E,cAAgB56E,OAAO2H,OAAO,OA8xB3C,OA3xBAsyE,EAAa56E,UAAUy5E,KAAO,WAC1B,IAAI7qB,EAAQjvD,KACZA,KAAKq7E,QAAQh5E,SAAQ,SAAUw5E,EAAOvQ,GAClCrc,EAAM6sB,qBAAqBxQ,MAE/BtrE,KAAK+7E,qBAAqBlsB,QAAU,IAAId,GAAe,kDAAoD,IAAIA,GAAe,MAElIksB,EAAa56E,UAAU07E,qBAAuB,SAAUz4E,GACpDtD,KAAKs7E,eAAej5E,SAAQ,SAAU+6B,GAAU,OAAOA,EAAO95B,MAC9DtD,KAAKs7E,eAAepwE,SAExB+vE,EAAa56E,UAAU27E,OAAS,SAAUltB,GACtC,IAAImtB,EAAWntB,EAAGmtB,SAAUrzB,EAAYkG,EAAGlG,UAAWszB,EAAqBptB,EAAGotB,mBAAoBC,EAAgBrtB,EAAGqtB,cAAe9d,EAAKvP,EAAGstB,eAAgBA,OAAwB,IAAP/d,EAAgB,GAAKA,EAAIwB,EAAK/Q,EAAGutB,oBAAqBA,OAA6B,IAAPxc,GAAwBA,EAAIyc,EAAoBxtB,EAAGroB,OAAQ81C,EAAiBztB,EAAGytB,eAAgBtc,EAAKnR,EAAG2rB,YAAaA,OAAqB,IAAPxa,EAAgB,OAASA,EAAIuc,EAAK1tB,EAAGlF,YAAaA,OAAqB,IAAP4yB,EAAgB,eAAiBA,EAAIC,EAAiB3tB,EAAG2tB,eAAgBjzD,EAAUslC,EAAGtlC,QACjhB,OAAO2pB,GAAUnzC,UAAM,OAAQ,GAAQ,WACnC,IAAI08E,EAAYC,EAAoB78E,EACpC,OAAO0zC,GAAYxzC,MAAM,SAAU48E,GAC/B,OAAQA,EAAGjpC,OACP,KAAK,EAQD,OAPAkc,QAAU,GAAUosB,EAAU,+FAAiG,GAAUA,EAAU,IACnJpsB,QAAU,GAA0B,iBAAhBjG,GACA,aAAhBA,EAA4B,8MAAgN,GAA0B,iBAAhBA,GACtO,aAAhBA,EAA4B,IAChC8yB,EAAa18E,KAAK68E,qBAClBZ,EAAWj8E,KAAKod,UAAU6+D,GAAUlnB,SACpCnM,EAAY5oD,KAAK88E,aAAab,EAAUrzB,GACnC5oD,KAAKod,UAAU6+D,GAAUxT,iBACvB,CAAC,EAAGzoE,KAAKo7E,WAAWjE,qBAAqB8E,EAAUrzB,EAAWp/B,IADd,CAAC,EAAG,GAE/D,KAAK,EACDo/B,EAAag0B,EAAGhpC,OAChBgpC,EAAGjpC,MAAQ,EACf,KAAK,EAuBD,OAtBAgpC,EAAqB38E,KAAK47E,gBACrB57E,KAAK47E,cAAcc,GAAc,CAC9BT,SAAUA,EACVrzB,UAAWA,EACXqjB,SAAS,EACT3oE,MAAO,OAEX44E,GACAl8E,KAAK+8E,uBAAuBb,EAAoB,CAC5CQ,WAAYA,EACZ3nB,SAAUknB,EACVrzB,UAAWA,EACXgB,YAAaA,EACb6wB,YAAaA,EACbjxD,QAASA,EACT2yD,cAAeA,EACf11C,OAAQ61C,EACRG,eAAgBA,IAGxBz8E,KAAK0uE,mBACL5uE,EAAOE,KACA,CAAC,EAAG,IAAI8C,SAAQ,SAAUI,EAASH,GAClC,OAAOkiE,GAASnlE,EAAKk9E,sBAAsBf,EAAUlpC,EAASA,EAAS,GAAIvpB,GAAU,CAAE0yD,mBAAoBA,IAAuBtzB,GAAW,IAAQ,SAAUxlD,GAC3J,GAAIyiE,GAAsBziE,IAA2B,SAAhBq3E,EACjC,MAAM,IAAIxQ,GAAY,CAClBC,cAAe9mE,EAAO49D,SAG1B2b,IACAA,EAAmB1Q,SAAU,EAC7B0Q,EAAmBr5E,MAAQ,MAE/B,IAAI25E,EAAclqC,EAAS,GAAI3vC,GAQ/B,MAP8B,mBAAnBg5E,IACPA,EAAiBA,EAAea,IAEhB,WAAhBxC,GACA5U,GAAsBoX,WACfA,EAAYjc,OAEhBlhE,EAAKo9E,mBAAmB,CAC3BR,WAAYA,EACZt5E,OAAQ65E,EACRloB,SAAUknB,EACVrzB,UAAWA,EACXgB,YAAaA,EACb6wB,YAAaA,EACbjxD,QAASA,EACTid,OAAQ61C,EACRH,cAAeA,EACfE,oBAAqBA,EACrBD,eAAgBA,EAChBe,iBAAkBjB,EAAqBQ,OAAa,EACpDH,eAAgBA,EAChBE,eAAgBA,OAErBxpB,UAAU,CACTnxD,KAAM,SAAUm7E,GACZn9E,EAAK4uE,mBACLxrE,EAAQ+5E,IAEZ35E,MAAO,SAAUkF,GACTm0E,IACAA,EAAmB1Q,SAAU,EAC7B0Q,EAAmBr5E,MAAQkF,GAE3B0zE,GACAp8E,EAAKmW,MAAMknE,iBAAiBT,GAEhC58E,EAAK4uE,mBACL3rE,EAAOyF,aAAeyhE,GAAczhE,EAAM,IAAIyhE,GAAY,CACtDG,aAAc5hE,oBAStDyyE,EAAa56E,UAAU68E,mBAAqB,SAAUjB,EAAUhmE,GAC5D,IAAIg5C,EAAQjvD,UACE,IAAViW,IAAoBA,EAAQjW,KAAKiW,OACrC,IAAI7S,EAAS64E,EAAS74E,OAClBg6E,EAAc,GACdC,EAAqC,aAAzBpB,EAASryB,YACzB,IAAKyzB,GAAa7C,GAAkBp3E,EAAQ64E,EAASxB,aAAc,CAC/D2C,EAAY52E,KAAK,CACbpD,OAAQA,EAAOyJ,KACfywE,OAAQ,gBACR30B,MAAOszB,EAASlnB,SAChBnM,UAAWqzB,EAASrzB,YAExB,IAAI20B,EAAkBtB,EAASE,cAC3BoB,GACAv9E,KAAKq7E,QAAQh5E,SAAQ,SAAUysD,EAAIwc,GAC/B,IAAI0N,EAAkBlqB,EAAGkqB,gBACrBvN,EAAYuN,GAAmBA,EAAgBvN,UACnD,GAAKA,GAAc,GAAevqE,KAAKq8E,EAAiB9R,GAAxD,CAGA,IAAIx5C,EAAUsrD,EAAgB9R,GAC1BpN,EAAKpP,EAAMosB,QAAQt2E,IAAIumE,GAAUvW,EAAWsJ,EAAGtJ,SAAUnM,EAAYyV,EAAGzV,UACxEiX,EAAK5pD,EAAMk2D,KAAK,CAChBxjB,MAAOoM,EACPnM,UAAWA,EACXyjB,mBAAmB,EACnBoC,YAAY,IACZ+O,EAAqB3d,EAAGz8D,OAC5B,GAD+Cy8D,EAAG/M,UAClC0qB,EAAoB,CAChC,IAAIC,EAAkBxrD,EAAQurD,EAAoB,CAC9CE,eAAgBt6E,EAChBqoE,UAAW1W,GAAYgD,GAAiBhD,SAAa,EACrD4oB,eAAgB/0B,IAEhB60B,GACAL,EAAY52E,KAAK,CACbpD,OAAQq6E,EACRH,OAAQ,aACR30B,MAAOoM,EACPnM,UAAWA,SAOnC,GAAIw0B,EAAY53E,OAAS,GACrBy2E,EAASG,gBACTH,EAASx1C,QACTw1C,EAASM,gBACTN,EAASkB,iBAAkB,CAC3B,IAAIS,EAAY,GAwChB,GAvCA59E,KAAKo8E,eAAe,CAChByB,YAAa,SAAU5nE,GACdonE,GACDD,EAAY/6E,SAAQ,SAAUy7E,GAAS,OAAO7nE,EAAM6nE,MAAMA,MAE9D,IAAIr3C,EAASw1C,EAASx1C,OACtB,GAAIA,EAAQ,CACR,IAAK42C,EAAW,CACZ,IAAIlR,EAAOl2D,EAAMk2D,KAAK,CAClBp5C,GAAI,gBACJ41B,MAAOsG,EAAM7xC,UAAU6+D,EAASlnB,UAAUgpB,QAC1Cn1B,UAAWqzB,EAASrzB,UACpB6lB,YAAY,EACZpC,mBAAmB,IAEnBF,EAAKrZ,WACL1vD,EAAS2vC,EAASA,EAAS,GAAI3vC,GAAS,CAAEyJ,KAAMs/D,EAAK/oE,UAG7DqjC,EAAOxwB,EAAO7S,EAAQ,CAClBomB,QAASyyD,EAASzyD,QAClBo/B,UAAWqzB,EAASrzB,YAGvBy0B,GAAcpB,EAASQ,gBACxBxmE,EAAM+nE,OAAO,CACTjrD,GAAI,gBACJoxB,OAAQ,SAAUziD,EAAOotD,GACrB,IAAIgI,EAAYhI,EAAGgI,UAAWmnB,EAASnvB,EAAGmvB,OAC1C,MAAqB,eAAdnnB,EAA6Bp1D,EAAQu8E,MAK5DC,QAASjC,EAASG,eAClB3N,YAAY,EACZ0O,iBAAkBlB,EAASkB,iBAC3BZ,eAAgBN,EAASM,gBAAkB,OAC5Cl6E,SAAQ,SAAUe,GAAU,OAAOw6E,EAAUp3E,KAAKpD,MACjD64E,EAASI,qBAAuBJ,EAASM,eACzC,OAAOz5E,QAAQo1E,IAAI0F,GAAWx4E,MAAK,WAAc,OAAOhC,KAGhE,OAAON,QAAQI,QAAQE,IAE3B63E,EAAa56E,UAAU08E,uBAAyB,SAAUb,EAAoBD,GAC1E,IAAIhtB,EAAQjvD,KACR6M,EAAqC,mBAAvBqvE,EACZA,EAAmBD,EAASrzB,WAC5BszB,EACN,OAAOl8E,KAAKiW,MAAMkoE,6BAA4B,SAAUloE,GACpD,IACIg5C,EAAMiuB,mBAAmBnqC,EAASA,EAAS,GAAIkpC,GAAW,CAAE74E,OAAQ,CAAEyJ,KAAMA,KAAWoJ,GAE3F,MAAO3S,GACHusD,SAAW,SAAgBvsD,MAEhC24E,EAASS,aAEhBzB,EAAa56E,UAAUwtE,WAAa,SAAUvC,EAASxkE,EAAS0jE,GAC5D,OAAOxqE,KAAKgvE,qBAAqB1D,EAASxkE,EAAS0jE,GAAe9mE,SAEtEu3E,EAAa56E,UAAU+9E,cAAgB,WACnC,IAAIC,EAAQr9E,OAAO2H,OAAO,MAS1B,OARA3I,KAAKq7E,QAAQh5E,SAAQ,SAAU6/D,EAAMoJ,GACjC+S,EAAM/S,GAAW,CACb1iB,UAAWsZ,EAAKtZ,UAChB4hB,cAAetI,EAAKsI,cACpBJ,aAAclI,EAAKkI,aACnBF,cAAehI,EAAKgI,kBAGrBmU,GAEXpD,EAAa56E,UAAU4sE,YAAc,SAAU3B,GAC3C,IAAIN,EAAYhrE,KAAKq7E,QAAQt2E,IAAIumE,GAC7BN,IACAA,EAAUZ,kBAAenoE,EACzB+oE,EAAUd,cAAgB,KAGlC+Q,EAAa56E,UAAU+c,UAAY,SAAU23C,GACzC,IjBvI8C5N,EiBuI1Co0B,EAAiBv7E,KAAKu7E,eAC1B,IAAKA,EAAep1E,IAAI4uD,GAAW,CAC/B,IAAIupB,EAAct+E,KAAKiW,MAAMsoE,kBAAkBxpB,GAC3CypB,GjB1IsCr3B,EiB0IUnnD,KAAKiW,MAAMwoE,iBAAiBH,GjBzIjFhY,GAA6B,CAACoB,IAAyB9P,GAAczQ,KiB0IhE0vB,EAAc72E,KAAKo7E,WAAWvE,YAAYyH,GAC1CxH,EAAc0H,GAAWx+E,KAAKo7E,WAAWtE,YAAY0H,GACrDE,EAAe,CACf3pB,SAAUupB,EACV7V,iBAAkBA,GAAiB6V,GACnCpS,mBAAoBlsE,KAAKo7E,WAAW9D,qBAAqBgH,GACzDzH,YAAaA,EACbC,YAAaA,EACb6H,YAAatmB,GAAiBP,GAAuBwmB,IACrDP,QAAShrC,EAASA,EAAS,GAAIurC,GAAc,CAAEn+B,YAAam+B,EAAYn+B,YAAY/9C,KAAI,SAAUo2D,GAC1F,MAAiB,wBAAbA,EAAIvgB,MACc,UAAlBugB,EAAIlX,UACGvO,EAASA,EAAS,GAAIylB,GAAM,CAAElX,UAAW,UAE7CkX,QAGflsD,EAAM,SAAU66C,GACZA,IAAQo0B,EAAep1E,IAAIghD,IAC3Bo0B,EAAer3E,IAAIijD,EAAKu3B,IAGhCpyE,EAAIyoD,GACJzoD,EAAIgyE,GACJhyE,EAAIuqE,GACJvqE,EAAIwqE,GAER,OAAOyE,EAAex2E,IAAIgwD,IAE9BkmB,EAAa56E,UAAUy8E,aAAe,SAAU/nB,EAAUnM,GACtD,OAAO7V,EAASA,EAAS,GAAI/yC,KAAKod,UAAU23C,GAAU4pB,aAAc/1B,IAExEqyB,EAAa56E,UAAUu+E,WAAa,SAAU93E,QAES,KADnDA,EAAUisC,EAASA,EAAS,GAAIjsC,GAAU,CAAE8hD,UAAW5oD,KAAK88E,aAAah2E,EAAQ6hD,MAAO7hD,EAAQ8hD,cAC7E+kB,8BACf7mE,EAAQ6mE,6BAA8B,GAE1C,IAAI3C,EAAY,IAAI6N,GAAU74E,MAC1B+wD,EAAa,IAAI+Z,GAAgB,CACjCC,aAAc/qE,KACdgrE,UAAWA,EACXlkE,QAASA,IAQb,OANA9G,KAAKq7E,QAAQn3E,IAAI6sD,EAAWua,QAASN,GACrCA,EAAUniE,KAAK,CACXksD,SAAUjuD,EAAQ6hD,MAClBqwB,gBAAiBjoB,EACjBnI,UAAW9hD,EAAQ8hD,YAEhBmI,GAEXkqB,EAAa56E,UAAUsoD,MAAQ,SAAU7hD,EAASwkE,GAC9C,IAAIrc,EAAQjvD,KAOZ,YANgB,IAAZsrE,IAAsBA,EAAUtrE,KAAKurE,mBACzC1b,QAAU,GAAU/oD,EAAQ6hD,MAAO,yFACL,GAAU7hD,EAAQ6hD,MAAO,IACvDkH,QAAU,GAAiC,aAAvB/oD,EAAQ6hD,MAAM1Q,KAAqB,kDAAoD,GAAiC,aAAvBnxC,EAAQ6hD,MAAM1Q,KAAqB,IACxJ4X,QAAU,IAAW/oD,EAAQulE,kBAAmB,0DAA4D,IAAWvlE,EAAQulE,kBAAmB,IAClJxc,QAAU,IAAW/oD,EAAQsmE,aAAc,qDAAuD,IAAWtmE,EAAQsmE,aAAc,IAC5HptE,KAAK6tE,WAAWvC,EAASxkE,GAASmnE,SAAQ,WAAc,OAAOhf,EAAMif,UAAU5C,OAE1F2P,EAAa56E,UAAUkrE,gBAAkB,WACrC,OAAOlqE,OAAOrB,KAAKw7E,mBAEvBP,EAAa56E,UAAUw+E,kBAAoB,WACvC,OAAO7+E,KAAKy7E,oBAEhBR,EAAa56E,UAAUw8E,mBAAqB,WACxC,OAAOx7E,OAAOrB,KAAK07E,sBAEvBT,EAAa56E,UAAUy+E,iBAAmB,SAAUxT,GAChDtrE,KAAK++E,4BAA4BzT,GACjCtrE,KAAK0uE,oBAETuM,EAAa56E,UAAU0+E,4BAA8B,SAAUzT,GAC3D,IAAIN,EAAYhrE,KAAKq7E,QAAQt2E,IAAIumE,GAC7BN,GACAA,EAAU8O,QAElBmB,EAAa56E,UAAU2+E,WAAa,SAAUl4E,GAgB1C,YAfgB,IAAZA,IAAsBA,EAAU,CAChCm4E,gBAAgB,IAEpBj/E,KAAK+7E,qBAAqBlsB,QAAU,IAAId,GAAe,uEAAyE,IAAIA,GAAe,KACnJ/uD,KAAKq7E,QAAQh5E,SAAQ,SAAU2oE,GACvBA,EAAUgO,gBACVhO,EAAUR,cAAgBR,GAAciC,QAGxCjB,EAAU8O,UAGd95E,KAAK47E,gBACL57E,KAAK47E,cAAgB56E,OAAO2H,OAAO,OAEhC3I,KAAKiW,MAAM+uD,MAAMl+D,IAE5Bm0E,EAAa56E,UAAU6+E,qBAAuB,SAAUhB,GACpD,IAAIjvB,EAAQjvD,UACI,IAAZk+E,IAAsBA,EAAU,UACpC,IAAI7C,EAAU,IAAI3vE,IACdyzE,EAAoB,IAAIzzE,IACxB0zE,EAAqB,IAAInzE,IA6D7B,OA5DI1J,MAAMC,QAAQ07E,IACdA,EAAQ77E,SAAQ,SAAUg9E,G/C5X/B,IAAwB39E,E+C6XK,iBAAT29E,EACPF,EAAkBj7E,IAAIm7E,GAAM,G/C7XpCxqB,GADmBnzD,E+CgYS29E,I/C9XjB,aAAf39E,EAAMu2C,MACN11C,MAAMC,QAAQd,EAAMy+C,a+C8XRg/B,EAAkBj7E,IAAI+qD,EAAM7xC,UAAUiiE,GAAMtqB,UAAU,GAEjDF,GAAgBwqB,IAASA,EAAK12B,OACnCy2B,EAAmB9yE,IAAI+yE,MAInCr/E,KAAKq7E,QAAQh5E,SAAQ,SAAUysD,EAAIwc,GAC/B,IAAI8N,EAAKtqB,EAAGkqB,gBAAiBjkB,EAAWjG,EAAGiG,SAC3C,GAAIqkB,EAAI,CACJ,GAAgB,QAAZ8E,EAEA,YADA7C,EAAQn3E,IAAIonE,EAAS8N,GAGzB,IAAI3N,EAAY2N,EAAG3N,UACnB,GAAoB,YADwB2N,EAAGtyE,QAAQ8iD,aAEtC,WAAZs0B,IAAyB9E,EAAGtJ,eAC7B,QAEY,WAAZoO,GACCzS,GAAa0T,EAAkBh5E,IAAIslE,IACnC1W,GAAYoqB,EAAkBh5E,IAAI4uD,MACnCsmB,EAAQn3E,IAAIonE,EAAS8N,GACjB3N,GACA0T,EAAkBj7E,IAAIunE,GAAW,GACjC1W,GACAoqB,EAAkBj7E,IAAI6wD,GAAU,QAI5CqqB,EAAmBtyE,MACnBsyE,EAAmB/8E,SAAQ,SAAUyE,GACjC,IAAIwkE,EAAU3C,GAAa,sBACvBqC,EAAY/b,EAAMqwB,SAAShU,GAASziE,KAAK,CACzCksD,SAAUjuD,EAAQ6hD,MAClBC,UAAW9hD,EAAQ8hD,YAEnBwwB,EAAK,IAAItO,GAAgB,CACzBC,aAAc9b,EACd+b,UAAWA,EACXlkE,QAASisC,EAASA,EAAS,GAAIjsC,GAAU,CAAE8iD,YAAa,mBAE5D,GAAUwvB,EAAG9N,UAAYA,GACzBN,EAAU+D,mBAAmBqK,GAC7BiC,EAAQn3E,IAAIonE,EAAS8N,MAGzBvpB,SAAWsvB,EAAkBryE,MAC7BqyE,EAAkB98E,SAAQ,SAAUk9E,EAAUC,GACrCD,GACD1vB,SAAW,QAAe,kBAAyC,iBAAd2vB,EAAyB,SAAW,IAAMx5E,KAAKw1C,UAAUgkC,EAAW,KAAM,GAAK,yDAIzInE,GAEXJ,EAAa56E,UAAUo/E,yBAA2B,SAAUC,GACxD,IAAIzwB,EAAQjvD,UACW,IAAnB0/E,IAA6BA,GAAiB,GAClD,IAAIC,EAA0B,GAY9B,OAXA3/E,KAAKk/E,qBAAqBQ,EAAiB,MAAQ,UAAUr9E,SAAQ,SAAU22E,EAAiB1N,GAC5F,IAAI1hB,EAAcovB,EAAgBlyE,QAAQ8iD,YAC1CovB,EAAgBjM,oBACZ2S,GACiB,YAAhB91B,GACmB,eAAhBA,IACJ+1B,EAAwBn5E,KAAKwyE,EAAgB9L,WAEjDje,EAAMqwB,SAAShU,GAASiO,QAAQ,SAEpCv5E,KAAK0uE,mBACE5rE,QAAQo1E,IAAIyH,IAEvB1E,EAAa56E,UAAU0uE,mBAAqB,SAAUiK,GAClDh5E,KAAKs/E,SAAStG,EAAgB1N,SAASyD,mBAAmBiK,IAE9DiC,EAAa56E,UAAU+tE,yBAA2B,SAAUtf,GACxD,IAAIG,EAAQjvD,KACR2oD,EAAQmG,EAAGnG,MAAOiB,EAAckF,EAAGlF,YAAa6wB,EAAc3rB,EAAG2rB,YAAa7xB,EAAYkG,EAAGlG,UAAWyV,EAAKvP,EAAGtlC,QAASA,OAAiB,IAAP60C,EAAgB,GAAKA,EAC5J1V,EAAQ3oD,KAAKod,UAAUurC,GAAOoM,SAC9BnM,EAAY5oD,KAAK88E,aAAan0B,EAAOC,GACrC,IAAIg3B,EAAiB,SAAUh3B,GAC3B,OAAOqG,EAAM+tB,sBAAsBr0B,EAAOn/B,EAASo/B,GAAWxmD,KAAI,SAAUgB,GAYxE,GAXoB,aAAhBwmD,IACI4wB,GAAkBp3E,EAAQq3E,IAC1BxrB,EAAMh5C,MAAM6nE,MAAM,CACdn1B,MAAOA,EACPvlD,OAAQA,EAAOyJ,KACfywE,OAAQ,oBACR10B,UAAWA,IAGnBqG,EAAMyf,oBAEN7I,GAAsBziE,GACtB,MAAM,IAAI6mE,GAAY,CAClBC,cAAe9mE,EAAO49D,SAG9B,OAAO59D,MAGf,GAAIpD,KAAKod,UAAUurC,GAAO8f,iBAAkB,CACxC,IAAIoX,EAAsB7/E,KAAKo7E,WAAWjE,qBAAqBxuB,EAAOC,EAAWp/B,GAASpkB,KAAKw6E,GAC/F,OAAO,IAAItuB,IAAW,SAAUa,GAC5B,IAAIyT,EAAM,KAEV,OADAia,EAAoBz6E,MAAK,SAAU2rD,GAAc,OAAO6U,EAAM7U,EAAWkC,UAAUd,KAAcA,EAAS7uD,OACnG,WAAc,OAAOsiE,GAAOA,EAAI/T,kBAG/C,OAAO+tB,EAAeh3B,IAE1BqyB,EAAa56E,UAAU6tE,UAAY,SAAU5C,GACzCtrE,KAAK87E,qBAAqBxQ,GAC1BtrE,KAAK0uE,oBAETuM,EAAa56E,UAAUy7E,qBAAuB,SAAUxQ,GACpDtrE,KAAK++E,4BAA4BzT,GACjCtrE,KAAK2rE,YAAYL,IAErB2P,EAAa56E,UAAUsrE,YAAc,SAAUL,GAC3CtrE,KAAKs7E,eAAe1b,OAAO0L,GAC3BtrE,KAAKs/E,SAAShU,GAASwO,OACvB95E,KAAKq7E,QAAQzb,OAAO0L,IAExB2P,EAAa56E,UAAUquE,iBAAmB,WAClC1uE,KAAKm7E,aACLn7E,KAAKm7E,cACTn7E,KAAKq7E,QAAQh5E,SAAQ,SAAU6/D,GAAQ,OAAOA,EAAKwX,aAEvDuB,EAAa56E,UAAUy/E,cAAgB,WACnC,OAAO9/E,KAAKo7E,YAEhBH,EAAa56E,UAAU28E,sBAAwB,SAAUr0B,EAAOn/B,EAASo/B,EAAWm3B,GAChF,IACIjxB,EAEAiC,EAHA9B,EAAQjvD,UAEU,IAAlB+/E,IAA4BA,EAAwG,QAAvFjxB,EAAKtlC,MAAAA,OAAyC,EAASA,EAAQ0xD,0BAAuC,IAAPpsB,EAAgBA,EAAK9uD,KAAKk7E,oBAE1K,IAAIpE,EAAc92E,KAAKod,UAAUurC,GAAOmuB,YACxC,GAAIA,EAAa,CACb,IAAekJ,EAANhgF,KAAqC27E,wBAAyB5iB,EAA9D/4D,KAAwE+4D,KAC7EzX,EAAY,CACZqH,MAAOmuB,EACPluB,UAAWA,EACX+Q,cAAe5B,GAAiB+e,SAAgB,EAChDttD,QAASxpB,KAAKg3E,eAAejkC,EAASA,EAAS,GAAIvpB,GAAU,CAAEy2D,YAAaF,MAGhF,GADAv2D,EAAU83B,EAAU93B,QAChBu2D,EAAe,CACf,IAAIG,EAAgBF,EAA0Bj7E,IAAI+xE,IAAgB,IAAIprE,IACtEs0E,EAA0B97E,IAAI4yE,EAAaoJ,GAC3C,IAAIC,EAAYtb,GAAmBjc,GAEnC,KADAmI,EAAamvB,EAAcn7E,IAAIo7E,IACd,CACb,IAAIzQ,EAAU,IAAItG,GAAQ,CACtB7P,GAAQR,EAAMzX,KAElB4+B,EAAch8E,IAAIi8E,EAAWpvB,EAAa2e,GAC1CA,EAAQ/d,SAAQ,WACRuuB,EAActgB,OAAOugB,IACrBD,EAAcpzE,KAAO,GACrBkzE,EAA0BpgB,OAAOkX,YAM7C/lB,EAAa,IAAIqY,GAAQ,CACrB7P,GAAQR,EAAMzX,UAKtByP,EAAa,IAAIqY,GAAQ,CACrB9X,GAAWoD,GAAG,CAAE7nD,KAAM,OAE1B2c,EAAUxpB,KAAKg3E,eAAextD,GAElC,IAAIqtD,EAAc72E,KAAKod,UAAUurC,GAAOkuB,YAWxC,OAVIA,IACA9lB,EAAakU,GAASlU,GAAY,SAAU3tD,GACxC,OAAO6rD,EAAMmsB,WAAW7E,aAAa,CACjCxhB,SAAU8hB,EACVL,aAAcpzE,EACdomB,QAASA,EACTo/B,UAAWA,QAIhBmI,GAEXkqB,EAAa56E,UAAU+/E,mBAAqB,SAAUpV,EAAWuP,EAAoBzzE,GACjF,IAAIu5E,EAAYrV,EAAU8N,cAAgB94E,KAAK6+E,oBAC/C,OAAO5Z,GAASjlE,KAAKg9E,sBAAsBhS,EAAUjW,SAAUjuD,EAAQ0iB,QAAS1iB,EAAQ8hD,YAAY,SAAUxlD,GAC1G,IAAIk9E,EAAYvW,GAAgB3mE,EAAO49D,QACvC,GAAIqf,GAAarV,EAAU8N,cAAe,CACtC,GAAIwH,GAAqC,SAAxBx5E,EAAQ2zE,YACrB,MAAMzP,EAAU8P,UAAU,IAAI7Q,GAAY,CACtCC,cAAe9mE,EAAO49D,UAG9BgK,EAAUsP,WAAWl3E,EAAQ0D,EAASyzE,GACtCvP,EAAU6P,YAEd,IAAI0F,EAAM,CACN1zE,KAAMzJ,EAAOyJ,KACbo/D,SAAS,EACTzB,cAAeQ,EAAUR,eAAiBR,GAAcgC,OAK5D,OAHIsU,GAAqC,WAAxBx5E,EAAQ2zE,cACrB8F,EAAIvf,OAAS59D,EAAO49D,QAEjBuf,KACR,SAAUnW,GACT,IAAI9mE,EAAsB8mE,EV5lBvBhkE,eAAe,iBU6lBZgkE,EACA,IAAIH,GAAY,CAAEG,aAAcA,IAItC,MAHIiW,GAAarV,EAAU8N,eACvB9N,EAAU8P,UAAUx3E,GAElBA,MAGd23E,EAAa56E,UAAU2uE,qBAAuB,SAAU1D,EAASxkE,EAAS0jE,GACtE,IAAIvb,EAAQjvD,UACU,IAAlBwqE,IAA4BA,EAAgBR,GAAciC,SAC9D,IAAItjB,EAAQ3oD,KAAKod,UAAUtW,EAAQ6hD,OAAOoM,SACtCnM,EAAY5oD,KAAK88E,aAAan0B,EAAO7hD,EAAQ8hD,WAC7CoiB,EAAYhrE,KAAKs/E,SAAShU,GAC1Bxc,EAAKhoD,EAAQ8iD,YAAaA,OAAqB,IAAPkF,EAAgB,cAAgBA,EAAIuP,EAAKv3D,EAAQ2zE,YAAaA,OAAqB,IAAPpc,EAAgB,OAASA,EAAIwB,EAAK/4D,EAAQulE,kBAAmBA,OAA2B,IAAPxM,GAAwBA,EAAII,EAAKn5D,EAAQ6mE,4BAA6BA,OAAqC,IAAP1N,GAAwBA,EAAIuc,EAAK11E,EAAQ0iB,QAASA,OAAiB,IAAPgzD,EAAgB,GAAKA,EAC1XgE,EAAax/E,OAAO+9B,OAAO,GAAIj4B,EAAS,CACxC6hD,MAAOA,EACPC,UAAWA,EACXgB,YAAaA,EACb6wB,YAAaA,EACbpO,kBAAmBA,EACnBsB,4BAA6BA,EAC7BnkD,QAASA,IAETi3D,EAAgB,SAAU73B,GAE1B,OADA43B,EAAW53B,UAAYA,EAChBqG,EAAMyxB,mBAAmB1V,EAAWwV,EAAYhW,IAE3DxqE,KAAKs7E,eAAep3E,IAAIonE,GAAS,SAAU5B,GACvCv/C,YAAW,WAAc,OAAOulD,EAAQtyC,OAAOssC,SAEnD,IAAIgG,EAAU,IAAItG,GAAQppE,KAAKod,UAAUojE,EAAW73B,OAAO8f,iBACrDzoE,KAAKo7E,WAAWjE,qBAAqBqJ,EAAW73B,MAAO63B,EAAW53B,UAAW43B,EAAWh3D,SAASpkB,KAAKq7E,GACtGA,EAAcD,EAAW53B,YAK/B,OAJA8mB,EAAQ/d,SAAQ,WACZ1C,EAAMqsB,eAAe1b,OAAO0L,GPvNjC,SAA8BxkE,GACjC,IAAIgoD,EAAKhoD,EAAQ8iD,YAAaA,OAAqB,IAAPkF,EAAgB,cAAgBA,EAAI6xB,EAAkB75E,EAAQ65E,gBACtGA,IACA75E,EAAQ8iD,YAAyC,mBAApB+2B,EACvBA,EAAgBz/E,KAAK4F,EAAS8iD,GAC9B+2B,GOmNFC,CAAqB95E,MAElB4oE,GAEXuL,EAAa56E,UAAU+7E,eAAiB,SAAUttB,GAC9C,IAAIG,EAAQjvD,KACR69E,EAAc/uB,EAAG+uB,YAAaK,EAAUpvB,EAAGovB,QAAS7f,EAAKvP,EAAG2f,WAAYA,OAAoB,IAAPpQ,GAAwBA,EAAIwB,EAAK/Q,EAAGquB,iBAAkBA,OAA0B,IAAPtd,EAAgB4O,EAAa9F,GAAa,uBAAoB,EAAS9I,EAAI0c,EAAiBztB,EAAGytB,eAC7PsE,EAAsB,IAAIn1E,IAC1BwyE,GACAl+E,KAAKk/E,qBAAqBhB,GAAS77E,SAAQ,SAAU+2E,EAAI9N,GACrDuV,EAAoB38E,IAAIonE,EAAS,CAC7B8N,GAAIA,EACJH,SAAUhqB,EAAMqwB,SAAShU,GAASc,eAI9C,IAAI0U,EAAU,IAAIp1E,IAsDlB,OArDImyE,GACA79E,KAAKiW,MAAM8qE,MAAM,CACbt6C,OAAQo3C,EACRpP,WAAYA,GAAc0O,IAAoB,EAC9CA,iBAAkBA,EAClB6D,eAAgB,SAAU9G,EAAO/N,EAAM8M,GACnC,IAAIG,EAAKc,EAAMF,mBAAmBnB,IAC9BqB,EAAMF,QAAQhB,gBAClB,GAAII,EAAI,CACJ,GAAImD,EAAgB,CAChBsE,EAAoBjhB,OAAOwZ,EAAG9N,SAC9B,IAAIloE,EAASm5E,EAAenD,EAAIjN,EAAM8M,GAOtC,OANe,IAAX71E,IACAA,EAASg2E,EAAGlM,YAED,IAAX9pE,GACA09E,EAAQ58E,IAAIk1E,EAAIh2E,IAEb,EAEY,OAAnBm5E,GACAsE,EAAoB38E,IAAIk1E,EAAG9N,QAAS,CAAE8N,GAAIA,EAAIH,SAAUA,EAAU9M,KAAMA,QAMxF0U,EAAoB/zE,MACpB+zE,EAAoBx+E,SAAQ,SAAUysD,EAAIwc,GACtC,IACIloE,EADAg2E,EAAKtqB,EAAGsqB,GAAIH,EAAWnqB,EAAGmqB,SAAU9M,EAAOrd,EAAGqd,KAElD,GAAIoQ,EAAgB,CAChB,IAAKpQ,EAAM,CACP,IAAIjK,EAAOkX,EAAc,UACzBlX,EAAK8C,QACLmH,EAAOjK,EAAKkK,UAEhBhpE,EAASm5E,EAAenD,EAAIjN,EAAM8M,GAEjCsD,IAA6B,IAAXn5E,IACnBA,EAASg2E,EAAGlM,YAED,IAAX9pE,GACA09E,EAAQ58E,IAAIk1E,EAAIh2E,GAEhBkoE,EAAQvqE,QAAQ,uBAAyB,GACzCkuD,EAAM6sB,qBAAqBxQ,MAInC6R,GACAn9E,KAAKiW,MAAMknE,iBAAiBA,GAEzB2D,GAEX7F,EAAa56E,UAAUqgF,mBAAqB,SAAU1V,EAAWlc,EAAI0b,GACjE,IAAIvb,EAAQjvD,KACR2oD,EAAQmG,EAAGnG,MAAOC,EAAYkG,EAAGlG,UAAWgB,EAAckF,EAAGlF,YAAaq3B,EAAqBnyB,EAAGmyB,mBAAoBxG,EAAc3rB,EAAG2rB,YAAapO,EAAoBvd,EAAGud,kBAAmB7iD,EAAUslC,EAAGtlC,QAASmkD,EAA8B7e,EAAG6e,4BACrPuT,EAAmBlW,EAAUR,cACjCQ,EAAUniE,KAAK,CACXksD,SAAUpM,EACVC,UAAWA,EACX4hB,cAAeA,IAEnB,IAAI2W,EAAY,WAAc,OAAOnW,EAAUoB,QAAQxjB,IACnDw4B,EAAmB,SAAUjV,EAAM3B,QACb,IAAlBA,IAA4BA,EAAgBQ,EAAUR,eAAiBR,GAAciC,SACzF,IAAIp/D,EAAOs/D,EAAK/oE,QACZysD,SACCwc,GACAhL,GAAMx0D,EAAM,KACb0/D,GAAsBJ,EAAKK,SAE/B,IAAI6U,EAAW,SAAUx0E,GAAQ,OAAOykD,GAAWoD,GAAG3hB,EAAS,CAAElmC,KAAMA,EAAMo/D,QAAS1B,GAAyBC,GAAgBA,cAAeA,GAAkB2B,EAAKrZ,SAAW,KAAO,CAAE/0B,SAAS,MAClM,OAAIlxB,GAAQoiD,EAAM7xC,UAAUurC,GAAOujB,mBACxBjd,EAAMmsB,WAAW7E,aAAa,CACjCxhB,SAAUpM,EACV6tB,aAAc,CAAE3pE,KAAMA,GACtB2c,QAASA,EACTo/B,UAAWA,EACX6tB,wBAAwB,IACzBrxE,MAAK,SAAUk8E,GAAY,OAAOD,EAASC,EAASz0E,WAAQ,MAE5Dw0E,EAASx0E,IAEhB0tE,EAAqC,aAAhB3wB,EAA6B,EACjD4gB,IAAkBR,GAAckD,SACN,UAAvB+T,EAAkC,EAChC,EACNM,EAAkB,WAClB,OAAOtyB,EAAMmxB,mBAAmBpV,EAAWuP,EAAoB,CAC3D3xB,UAAWA,EACXp/B,QAASA,EACTogC,YAAaA,EACb6wB,YAAaA,KAGjBZ,EAAelM,GACa,iBAArBuT,GACPA,IAAqB1W,GACrBD,GAAyBC,GAC7B,OAAQ5gB,GACJ,QACA,IAAK,cAED,OADIuiB,EAAOgV,KACFruB,SACE,CACHsuB,EAAiBjV,EAAMnB,EAAU6P,cAGrCxO,GAAqBwN,EACd,CACHuH,EAAiBjV,GACjBoV,KAGD,CACHA,KAGR,IAAK,oBACD,IAAIpV,EACJ,OADIA,EAAOgV,KACFruB,UAAYuZ,GAAqBwN,EAC/B,CACHuH,EAAiBjV,GACjBoV,KAGD,CACHA,KAGR,IAAK,aACD,MAAO,CACHH,EAAiBD,IAAanW,EAAU6P,cAEhD,IAAK,eACD,OAAIhB,EACO,CACHuH,EAAiBD,KACjBI,KAGD,CAACA,KACZ,IAAK,WACD,OAAI1H,EACO,CACHuH,EAAiBpW,EAAUoB,WAC3BmV,KAGD,CAACA,KACZ,IAAK,UACD,MAAO,KAGnBtG,EAAa56E,UAAUi/E,SAAW,SAAUhU,GAIxC,OAHIA,IAAYtrE,KAAKq7E,QAAQl1E,IAAImlE,IAC7BtrE,KAAKq7E,QAAQn3E,IAAIonE,EAAS,IAAIuN,GAAU74E,KAAMsrE,IAE3CtrE,KAAKq7E,QAAQt2E,IAAIumE,IAE5B2P,EAAa56E,UAAU22E,eAAiB,SAAUxtD,QAC9B,IAAZA,IAAsBA,EAAU,IACpC,IAAIg4D,EAAaxhF,KAAKo7E,WAAWpE,eAAextD,GAChD,OAAOupB,EAASA,EAAS,GAAIyuC,GAAa,CAAEviB,gBAAiBj/D,KAAKi/D,mBAE/Dgc,EAjzBQ,GCJfwG,IAAuB,EACpB,SAASC,GAAaj4D,EAAU3iB,GACnC,OAAO+7B,GAAQpZ,EAAU3iB,EAASA,EAAQ8hD,WAAa,CACnDA,UAAW7V,EAASA,EAAS,GAAItpB,EAASm/B,WAAY9hD,EAAQ8hD,aAGtE,IAAI+4B,GAAgB,WAChB,SAASA,EAAa76E,GAClB,IAAImoD,EAAQjvD,KACZA,KAAK4hF,eAAiB,GACtB5hF,KAAK6hF,oBAAsB,GAC3B7hF,KAAK8hF,oBAAsB,GAC3B,IAAI5jB,EAAMp3D,EAAQo3D,IAAKh3D,EAAcJ,EAAQI,YAAa/E,EAAU2E,EAAQ3E,QAAS8T,EAAQnP,EAAQmP,MAAO64C,EAAKhoD,EAAQmoE,QAASA,OAAiB,IAAPngB,GAAwBA,EAAIuP,EAAKv3D,EAAQi7E,mBAAoBA,OAA4B,IAAP1jB,EAAgB,EAAIA,EAAIwB,EAAK/4D,EAAQk7E,kBAAmBA,OAA2B,IAAPniB,EAAkC,iBAAXlQ,SAC5TA,OAAOsyB,mBACRpyB,QAAUgQ,EAAII,EAAKn5D,EAAQo0E,mBAAoBA,OAA4B,IAAPjb,GAAuBA,EAAI2hB,EAAiB96E,EAAQ86E,eAAgBpF,EAAK11E,EAAQyoE,uBAAwBA,OAAgC,IAAPiN,GAAwBA,EAAIxG,EAAYlvE,EAAQkvE,UAAWkM,EAAWp7E,EAAQo7E,SAAUjM,EAAkBnvE,EAAQmvE,gBAAiBkM,EAAsBr7E,EAAQ1F,KAAMghF,EAAyBt7E,EAAQq4D,QAC9YpG,EAAOjyD,EAAQiyD,KAMnB,GALKA,IACDA,EAAOmF,EACD,IAAIF,GAAS,CAAEE,IAAKA,EAAKh3D,YAAaA,EAAa/E,QAASA,IAC5D02D,GAAWI,UAEhBhjD,EACD,MAAM45C,QAAU,IAAId,GAAe,8JAEuC,IAAIA,GAAe,GAmBjG,GAjBA/uD,KAAK+4D,KAAOA,EACZ/4D,KAAKiW,MAAQA,EACbjW,KAAKqiF,sBAAwBpT,GAAW8S,EAAqB,EAC7D/hF,KAAKk7E,mBAAqBA,EAC1Bl7E,KAAK4hF,eAAiBA,GAAkB,GACxC5hF,KAAKkiF,SAAWA,EACZH,GACA53D,YAAW,WAAc,OAAQ8kC,EAAMozB,uBAAwB,IAAWN,GAE9E/hF,KAAK4+E,WAAa5+E,KAAK4+E,WAAW/iD,KAAK77B,MACvCA,KAAK2oD,MAAQ3oD,KAAK2oD,MAAM9sB,KAAK77B,MAC7BA,KAAKg8E,OAASh8E,KAAKg8E,OAAOngD,KAAK77B,MAC/BA,KAAKsiF,WAAatiF,KAAKsiF,WAAWzmD,KAAK77B,MACvCA,KAAKy/E,yBAA2Bz/E,KAAKy/E,yBAAyB5jD,KAAK77B,MAC/DgiF,GAAuC,iBAAXryB,SAC5BA,OAAOsyB,kBAAoBjiF,OAE1ByhF,IAAwB5xB,UACzB4xB,IAAuB,EACD,oBAAX9xB,QACPA,OAAOoF,UACPpF,OAAO4yB,MAAQ5yB,OAAO7vD,OACrB6vD,OAAO6yB,iCAAiC,CACzC,IAAIC,EAAM9yB,OAAO4T,UACbmf,EAAKD,GAAOA,EAAIE,UAChB17E,OAAM,EACQ,iBAAPy7E,IACHA,EAAG3hF,QAAQ,YAAc,EACzBkG,EAAM,uGAGDy7E,EAAG3hF,QAAQ,aAAe,IAC/BkG,EAAM,2EAGVA,GACA4oD,SAAW,OAAc,qEACJ5oD,GAIjCjH,KAAKm/D,Q1B3EQ,S0B4Ebn/D,KAAKo7E,WAAa,IAAIrF,GAAW,CAC7B9/D,MAAOA,EACPwyC,OAAQzoD,KACRg2E,UAAWA,EACXC,gBAAiBA,IAErBj2E,KAAK+qE,aAAe,IAAIkQ,GAAa,CACjChlE,MAAOjW,KAAKiW,MACZ8iD,KAAM/4D,KAAK+4D,KACXmiB,mBAAoBA,EACpBjM,QAASA,EACThQ,gBAAiB,CACb79D,KAAM+gF,EACNhjB,QAASijB,GAEbhH,WAAYp7E,KAAKo7E,WACjB7L,uBAAwBA,EACxB4L,YAAa6G,EAAoB,WACzB/yB,EAAM2zB,gBACN3zB,EAAM2zB,eAAe,CACjBtwD,OAAQ,GACRwf,MAAO,CACHupC,QAASpsB,EAAM8b,aAAaqT,gBAC5ByE,UAAW5zB,EAAM8b,aAAa6Q,eAAiB,IAEnDkH,0BAA2B7zB,EAAMh5C,MAAM8sE,SAAQ,WAGvD,IAwIZ,OArIApB,EAAathF,UAAUy5E,KAAO,WAC1B95E,KAAK+qE,aAAa+O,QAEtB6H,EAAathF,UAAUu+E,WAAa,SAAU93E,GAS1C,OARI9G,KAAK4hF,eAAehD,aACpB93E,EAAU46E,GAAa1hF,KAAK4hF,eAAehD,WAAY93E,KAEvD9G,KAAKqiF,uBACoB,iBAAxBv7E,EAAQ8iD,aACmB,sBAAxB9iD,EAAQ8iD,cACZ9iD,EAAUisC,EAASA,EAAS,GAAIjsC,GAAU,CAAE8iD,YAAa,iBAEtD5pD,KAAK+qE,aAAa6T,WAAW93E,IAExC66E,EAAathF,UAAUsoD,MAAQ,SAAU7hD,GAWrC,OAVI9G,KAAK4hF,eAAej5B,QACpB7hD,EAAU46E,GAAa1hF,KAAK4hF,eAAej5B,MAAO7hD,IAEtD+oD,QAAU,GAAkC,sBAAxB/oD,EAAQ8iD,YAAqC,qSAGY,GAAkC,sBAAxB9iD,EAAQ8iD,YAAqC,IAChI5pD,KAAKqiF,uBAAiD,iBAAxBv7E,EAAQ8iD,cACtC9iD,EAAUisC,EAASA,EAAS,GAAIjsC,GAAU,CAAE8iD,YAAa,iBAEtD5pD,KAAK+qE,aAAapiB,MAAM7hD,IAEnC66E,EAAathF,UAAU27E,OAAS,SAAUl1E,GAItC,OAHI9G,KAAK4hF,eAAe5F,SACpBl1E,EAAU46E,GAAa1hF,KAAK4hF,eAAe5F,OAAQl1E,IAEhD9G,KAAK+qE,aAAaiR,OAAOl1E,IAEpC66E,EAAathF,UAAU4yD,UAAY,SAAUnsD,GACzC,OAAO9G,KAAK+qE,aAAaqD,yBAAyBtnE,IAEtD66E,EAAathF,UAAU2iF,UAAY,SAAUl8E,EAAS2nE,GAElD,YADmB,IAAfA,IAAyBA,GAAa,GACnCzuE,KAAKiW,MAAM+sE,UAAUl8E,EAAS2nE,IAEzCkT,EAAathF,UAAU4iF,aAAe,SAAUn8E,EAAS2nE,GAErD,YADmB,IAAfA,IAAyBA,GAAa,GACnCzuE,KAAKiW,MAAMgtE,aAAan8E,EAAS2nE,IAE5CkT,EAAathF,UAAU2tE,WAAa,SAAUlnE,GAC1C9G,KAAKiW,MAAM+3D,WAAWlnE,GACtB9G,KAAK+qE,aAAa2D,oBAEtBiT,EAAathF,UAAU6iF,cAAgB,SAAUp8E,GAC7C9G,KAAKiW,MAAMitE,cAAcp8E,GACzB9G,KAAK+qE,aAAa2D,oBAEtBiT,EAAathF,UAAU8iF,wBAA0B,SAAUC,GACvDpjF,KAAK4iF,eAAiBQ,GAE1BzB,EAAathF,UAAUgjF,aAAe,SAAUC,GAC5C,OAAO/pB,GAAQv5D,KAAK+4D,KAAMuqB,IAE9B3B,EAAathF,UAAUiiF,WAAa,WAChC,IAAIrzB,EAAQjvD,KACZ,OAAO8C,QAAQI,UACVkC,MAAK,WAAc,OAAO6pD,EAAM8b,aAAaiU,WAAW,CACzDC,gBAAgB,OAEf75E,MAAK,WAAc,OAAOtC,QAAQo1E,IAAIjpB,EAAM4yB,oBAAoBz/E,KAAI,SAAUi0B,GAAM,OAAOA,WAC3FjxB,MAAK,WAAc,OAAO6pD,EAAMwwB,+BAEzCkC,EAAathF,UAAU2+E,WAAa,WAChC,IAAI/vB,EAAQjvD,KACZ,OAAO8C,QAAQI,UACVkC,MAAK,WAAc,OAAO6pD,EAAM8b,aAAaiU,WAAW,CACzDC,gBAAgB,OAEf75E,MAAK,WAAc,OAAOtC,QAAQo1E,IAAIjpB,EAAM6yB,oBAAoB1/E,KAAI,SAAUi0B,GAAM,OAAOA,YAEpGsrD,EAAathF,UAAUkjF,aAAe,SAAUH,GAC5C,IAAIn0B,EAAQjvD,KAEZ,OADAA,KAAK6hF,oBAAoBr7E,KAAK48E,GACvB,WACHn0B,EAAM4yB,oBAAsB5yB,EAAM4yB,oBAAoBl+C,QAAO,SAAU6/C,GAAK,OAAOA,IAAMJ,OAGjGzB,EAAathF,UAAUojF,aAAe,SAAUL,GAC5C,IAAIn0B,EAAQjvD,KAEZ,OADAA,KAAK8hF,oBAAoBt7E,KAAK48E,GACvB,WACHn0B,EAAM6yB,oBAAsB7yB,EAAM6yB,oBAAoBn+C,QAAO,SAAU6/C,GAAK,OAAOA,IAAMJ,OAGjGzB,EAAathF,UAAUo/E,yBAA2B,SAAUC,GACxD,OAAO1/E,KAAK+qE,aAAa0U,yBAAyBC,IAEtDiC,EAAathF,UAAU+7E,eAAiB,SAAUt1E,GAC9C,IAAI1E,EAAMpC,KAAK+qE,aAAaqR,eAAet1E,GACvCu0E,EAAU,GACVyF,EAAU,GACd1+E,EAAIC,SAAQ,SAAUe,EAAQsgF,GAC1BrI,EAAQ70E,KAAKk9E,GACb5C,EAAQt6E,KAAKpD,MAEjB,IAAIA,EAASN,QAAQo1E,IAAI4I,GAMzB,OALA19E,EAAOi4E,QAAUA,EACjBj4E,EAAO09E,QAAUA,EACjB19E,EAAO29D,OAAM,SAAUz9D,GACnBusD,SAAW,SAAgB,qEAAuEvsD,MAE/FF,GAEXu+E,EAAathF,UAAU6+E,qBAAuB,SAAUhB,GAEpD,YADgB,IAAZA,IAAsBA,EAAU,UAC7Bl+E,KAAK+qE,aAAamU,qBAAqBhB,IAElDyD,EAAathF,UAAU0iF,QAAU,SAAUtU,GACvC,OAAOzuE,KAAKiW,MAAM8sE,QAAQtU,IAE9BkT,EAAathF,UAAUsjF,QAAU,SAAUC,GACvC,OAAO5jF,KAAKiW,MAAM0tE,QAAQC,IAE9BjC,EAAathF,UAAU61E,aAAe,SAAUF,GAC5Ch2E,KAAKo7E,WAAWlF,aAAaF,IAEjC2L,EAAathF,UAAUg2E,aAAe,SAAUL,GAC5Ch2E,KAAKo7E,WAAW/E,aAAaL,IAEjC2L,EAAathF,UAAUi2E,aAAe,WAClC,OAAOt2E,KAAKo7E,WAAW9E,gBAE3BqL,EAAathF,UAAUwjF,6BAA+B,SAAU5N,GAC5Dj2E,KAAKo7E,WAAWjF,mBAAmBF,IAEvC0L,EAAathF,UAAUyjF,QAAU,SAAUC,GACvC/jF,KAAK+4D,KAAO/4D,KAAK+qE,aAAahS,KAAOgrB,GAElCpC,EAlOQ,GCXfqC,GAAe,WACf,SAASA,IACLhkF,KAAKikF,eAAiB,GAAKnvB,IAgD/B,OA9CAkvB,EAAY3jF,UAAU0gF,MAAQ,SAAUj6E,GACpC,IAAIo9E,EAA6C,iBAAvBp9E,EAAQ2nE,WAA0B3nE,EAAQ2nE,YACzC,IAAvB3nE,EAAQ2nE,WAAuB,UAAO,EAC1CzuE,KAAK06E,mBAAmB5zE,EAAQ2/B,OAAQy9C,IAE5CF,EAAY3jF,UAAU89E,4BAA8B,SAAUgG,EAAaD,GACvElkF,KAAK06E,mBAAmByJ,EAAaD,IAEzCF,EAAY3jF,UAAUk+E,kBAAoB,SAAUxpB,GAChD,OAAOA,GAEXivB,EAAY3jF,UAAU62E,SAAW,SAAU7oE,KAG3C21E,EAAY3jF,UAAU+jF,GAAK,WACvB,MAAO,IAEXJ,EAAY3jF,UAAU29E,OAAS,SAAUl3E,GACrC,OAAO,GAEXk9E,EAAY3jF,UAAUo+E,iBAAmB,SAAU1pB,GAC/C,OAAOA,GAEXivB,EAAY3jF,UAAU2iF,UAAY,SAAUl8E,EAAS2nE,GAEjD,YADmB,IAAfA,IAAyBA,IAAe3nE,EAAQ2nE,YAC7CzuE,KAAKqkF,KAAKtxC,EAASA,EAAS,GAAIjsC,GAAU,CAAEw9E,OAAQx9E,EAAQisB,IAAM,aAAc07C,WAAYA,MAEvGuV,EAAY3jF,UAAU4iF,aAAe,SAAUn8E,EAAS2nE,GAEpD,YADmB,IAAfA,IAAyBA,IAAe3nE,EAAQ2nE,YAC7CzuE,KAAKqkF,KAAKtxC,EAASA,EAAS,GAAIjsC,GAAU,CAAE6hD,MAAO3oD,KAAKikF,eAAen9E,EAAQuuD,SAAUvuD,EAAQygD,cAAe+8B,OAAQx9E,EAAQisB,GAAI07C,WAAYA,MAE3JuV,EAAY3jF,UAAU2tE,WAAa,SAAUlf,GACzC,IAAI/7B,EAAK+7B,EAAG/7B,GAAIlmB,EAAOiiD,EAAGjiD,KAAM/F,EAAUosC,GAAO4b,EAAI,CAAC,KAAM,SAC5D,OAAO9uD,KAAK89E,MAAM98E,OAAO+9B,OAAOj4B,EAAS,CACrCw2E,OAAQvqD,GAAM,aACd3vB,OAAQyJ,MAGhBm3E,EAAY3jF,UAAU6iF,cAAgB,SAAUp0B,GAC5C,IAAI/7B,EAAK+7B,EAAG/7B,GAAIlmB,EAAOiiD,EAAGjiD,KAAMwoD,EAAWvG,EAAGuG,SAAU9N,EAAeuH,EAAGvH,aAAczgD,EAAUosC,GAAO4b,EAAI,CAAC,KAAM,OAAQ,WAAY,iBACxI,OAAO9uD,KAAK89E,MAAM98E,OAAO+9B,OAAOj4B,EAAS,CACrC6hD,MAAO3oD,KAAKikF,eAAe5uB,EAAU9N,GACrC+1B,OAAQvqD,EACR3vB,OAAQyJ,MAGTm3E,EAlDO,GCFdO,GAAqB,SAAUv1B,GAE/B,SAASu1B,EAAkB97E,EAAS8G,EAAMo5C,EAAOC,GAC7C,IAAIqG,EAAQD,EAAO9tD,KAAKlB,KAAMyI,IAAYzI,KAM1C,OALAivD,EAAMxmD,QAAUA,EAChBwmD,EAAM1/C,KAAOA,EACb0/C,EAAMtG,MAAQA,EACdsG,EAAMrG,UAAYA,EAClBqG,EAAMtc,UAAY4xC,EAAkBlkF,UAC7B4uD,EAEX,OAVApc,EAAU0xC,EAAmBv1B,GAUtBu1B,EAXa,CAYtBr/E,OCcK,SAASs/E,GAAgB1jF,GAI5B,OAHI+uD,UA1BYnuD,EA2BDZ,GA1BXsmD,EAAU,IAAIn7C,IAAI,CAACvK,KACfW,SAAQ,SAAUvB,GAClB+zD,GAAgB/zD,IAS5B,SAAuBA,GACnB,GAAI+uD,UAAY7uD,OAAOyjF,SAAS3jF,GAC5B,IACIE,OAAOq5D,OAAOv5D,GAElB,MAAOL,GACH,GAAIA,aAAac,UACb,OAAO,KACX,MAAMd,EAGd,OAAOK,EApByB4jF,CAAc5jF,KAASA,GAC/CE,OAAO0B,oBAAoB5B,GAAKuB,SAAQ,SAAUjB,GAC1CyzD,GAAgB/zD,EAAIM,KACpBgmD,EAAQ96C,IAAIxL,EAAIM,WAuBzBN,EA7BX,IAAoBY,EACZ0lD,ECFD,IAAIu9B,GAAS3jF,OAAOX,UAAU+F,eAC9B,SAASw+E,GAAwB91B,EAAItlC,GACxC,IAAIiuC,EAAa3I,EAAG2I,WAAY1kC,EAAK+7B,EAAG/7B,GAAI8xD,EAAM/1B,EAAG+1B,IACrD,GAA0B,iBAAfptB,IACHjuC,IACAA,EAAQs7D,eACG,IAAP/xD,EAAgB,CAAEA,GAAIA,QACV,IAAR8xD,EAAiB,CAAEA,IAAKA,QACpB,QAEL,IAAP9xD,IACAA,EAAK8xD,QACE,IAAP9xD,GACA,OAAO0kC,EAAa,KAAsB,iBAAP1kC,GACjB,iBAAPA,EAAmBA,EAAK/sB,KAAKw1C,UAAUzoB,IAI9D,IAAIgyD,GAAgB,CAChBC,iBAAkBJ,GAClBK,aAAa,EACbC,eAAe,EACf5L,iBAAiB,GAKd,SAAS6L,GAAsB1lB,GAClC,IAAI/9D,EAAQ+9D,EAAO6Z,gBACnB,YAAiB,IAAV53E,EAAmBqjF,GAAczL,gBAAkB53E,EAOvD,IAAI0jF,GAAwB,qBAC5B,SAASC,GAAuBC,GACnC,IAAI5mE,EAAQ4mE,EAAe5mE,MAAM0mE,IACjC,OAAO1mE,EAAQA,EAAM,GAAK4mE,EAEvB,SAASC,GAA0B7jC,EAAct+C,EAAQwlD,GAC5D,QAAIiM,GAAgBzxD,KACTb,MAAMC,QAAQY,GACfA,EAAOykC,OAAM,SAAUob,GAAQ,OAAOsiC,GAA0B7jC,EAAcuB,EAAM2F,MACpFlH,EAAae,WAAW5a,OAAM,SAAUqhB,GACtC,GAAI,GAAQA,IAAU4e,GAAc5e,EAAON,GAAY,CACnD,IAAIp/C,EAAM+tD,GAAuBrO,GACjC,OAAOy7B,GAAOzjF,KAAKkC,EAAQoG,MACrB0/C,EAAMxH,cACJ6jC,GAA0Br8B,EAAMxH,aAAct+C,EAAOoG,GAAMo/C,IAEvE,OAAO,MAKhB,SAAS48B,GAAwB9jF,GACpC,OAAOmzD,GAAgBnzD,KAClBi0D,GAAYj0D,KACZa,MAAMC,QAAQd,GCtDvB,IAAIu8E,GAASj9E,OAAO2H,OAAO,MACvB88E,GAAc,WAAc,OAAOxH,IACnCyH,GAAa1kF,OAAO2H,OAAO,MAC3Bg9E,GAAe,WACf,SAASA,EAAYC,EAAUprD,GAC3B,IAAIy0B,EAAQjvD,KACZA,KAAK4lF,SAAWA,EAChB5lF,KAAKw6B,MAAQA,EACbx6B,KAAK6M,KAAO7L,OAAO2H,OAAO,MAC1B3I,KAAK6lF,QAAU7kF,OAAO2H,OAAO,MAC7B3I,KAAK8lF,KAAO9kF,OAAO2H,OAAO,MAC1B3I,KAAK+lF,cAAgB,SAAUC,EAAmBV,GAAkB,OAAOd,GAAgB7uB,GAAYqwB,GACjG/2B,EAAMlqD,IAAIihF,EAAkBtwB,MAAO4vB,GACnCU,GAAqBA,EAAkBV,KAC7CtlF,KAAKimF,QAAU,SAAUC,GACrB,OAAOvwB,GAAYuwB,GACbj3B,EAAM9oD,IAAI+/E,EAASxwB,OACC,iBAAbwwB,GAEjBlmF,KAAKmmF,YAAc,SAAUC,EAAcC,GACvC,GAA4B,iBAAjBD,EACP,OAAO3wB,GAAc2wB,GAEzB,GAAIzwB,GAAYywB,GACZ,OAAOA,EAEX,IAAIrzD,EAAKk8B,EAAM22B,SAAS1O,SAASkP,GAAc,GAC/C,GAAIrzD,EAAI,CACJ,IAAIuzD,EAAM7wB,GAAc1iC,GAIxB,OAHIszD,GACAp3B,EAAMtvB,MAAM5M,EAAIqzD,GAEbE,IAsRnB,OAlRAX,EAAYtlF,UAAUkmF,SAAW,WAC7B,OAAOxzC,EAAS,GAAI/yC,KAAK6M,OAE7B84E,EAAYtlF,UAAU8F,IAAM,SAAUm3E,GAClC,YAAqC,IAA9Bt9E,KAAK+iE,OAAOua,GAAQ,IAE/BqI,EAAYtlF,UAAU0E,IAAM,SAAUu4E,EAAQxmB,GAE1C,GADA92D,KAAKw6B,MAAM25C,OAAOmJ,EAAQxmB,GACtB6tB,GAAOzjF,KAAKlB,KAAK6M,KAAMywE,GAAS,CAChC,IAAIkJ,EAAcxmF,KAAK6M,KAAKywE,GAC5B,GAAIkJ,GAAe7B,GAAOzjF,KAAKslF,EAAa1vB,GACxC,OAAO0vB,EAAY1vB,GAG3B,MAAkB,eAAdA,GACA6tB,GAAOzjF,KAAKlB,KAAK4lF,SAASa,kBAAmBnJ,GACtCt9E,KAAK4lF,SAASa,kBAAkBnJ,GAEvCt9E,gBAAgB0mF,GACT1mF,KAAK4vB,OAAO7qB,IAAIu4E,EAAQxmB,QADnC,GAIJ6uB,EAAYtlF,UAAU0iE,OAAS,SAAUua,EAAQqJ,GAG7C,OAFIA,GACA3mF,KAAKw6B,MAAM25C,OAAOmJ,EAAQ,YAC1BqH,GAAOzjF,KAAKlB,KAAK6M,KAAMywE,GAChBt9E,KAAK6M,KAAKywE,GAEjBt9E,gBAAgB0mF,GACT1mF,KAAK4vB,OAAOmzC,OAAOua,EAAQqJ,GAElC3mF,KAAK4lF,SAASa,kBAAkBnJ,GACzBt8E,OAAO2H,OAAO,WADzB,GAIJg9E,EAAYtlF,UAAUs/B,MAAQ,SAAU4xC,EAAOC,GAC3C,IACI8L,EADAruB,EAAQjvD,KAER21D,GAAY4b,KACZA,EAAQA,EAAM7b,OACdC,GAAY6b,KACZA,EAAQA,EAAM9b,OAClB,IAAIkxB,EAA4B,iBAAVrV,EAChBvxE,KAAK+iE,OAAOua,EAAS/L,GACrBA,EACFsV,EAA4B,iBAAVrV,EAChBxxE,KAAK+iE,OAAOua,EAAS9L,GACrBA,EACN,GAAKqV,EAAL,CAEAh3B,QAAU,GAA4B,iBAAXytB,EAAqB,mCAAqC,GAA4B,iBAAXA,EAAqB,GAC3H,IAAIwJ,EAAS,IAAI5W,GAAW6W,IAAuBpnD,MAAMinD,EAAUC,GAEnE,GADA7mF,KAAK6M,KAAKywE,GAAUwJ,EAChBA,IAAWF,WACJ5mF,KAAK8lF,KAAKxI,GACbt9E,KAAKw6B,MAAMwsD,SAAS,CACpB,IAAIC,EAAkBjmF,OAAO2H,OAAO,MAC/Bi+E,IACDK,EAAgBC,SAAW,GAC/BlmF,OAAOuF,KAAKsgF,GAAUxkF,SAAQ,SAAUijF,GACpC,IAAKsB,GAAYA,EAAStB,KAAoBwB,EAAOxB,GAAiB,CAClE2B,EAAgB3B,GAAkB,EAClC,IAAIxuB,EAAYuuB,GAAuBC,GACnCxuB,IAAcwuB,GACbr2B,EAAM22B,SAASuB,WAAWL,EAAOrvB,WAAYX,KAC9CmwB,EAAgBnwB,GAAa,QAEF,IAA3BgwB,EAAOxB,IAAgCr2B,aAAiBy3B,WACjDI,EAAOxB,QAItB2B,EAAgBxvB,YACdmvB,GAAYA,EAASnvB,YACvBz3D,KAAK4lF,SAASa,kBAAkBnJ,KAAYwJ,EAAOrvB,mBAC5CwvB,EAAgBxvB,WAE3Bz2D,OAAOuF,KAAK0gF,GAAiB5kF,SAAQ,SAAUy0D,GAAa,OAAO7H,EAAMz0B,MAAM63C,MAAMiL,EAAQxmB,SAIzG6uB,EAAYtlF,UAAU29E,OAAS,SAAUV,EAAQn5B,GAC7C,IAAI8K,EAAQjvD,KACRwmF,EAAcxmF,KAAK+iE,OAAOua,GAC9B,GAAIkJ,EAAa,CACb,IAAIY,EAAkBpmF,OAAO2H,OAAO,MAChC0+E,GAAgB,EAChBC,GAAe,EACfC,EAAkB,CAClBtJ,OAAQA,GACRyH,WAAYA,GACZ/vB,YAAaA,GACbwwB,YAAanmF,KAAKmmF,YAClBF,QAASjmF,KAAKimF,QACduB,UAAW,SAAUC,EAAoBrzC,GAAQ,OAAO6a,EAAM22B,SAAS4B,UAAwC,iBAAvBC,EAAkC,CACtH3wB,UAAW2wB,EACXrzC,KAAMA,GAAQqhB,GAAc6nB,IAC5BmK,EAAoB,CAAEpJ,MAAOpvB,MA8BrC,GA5BAjuD,OAAOuF,KAAKigF,GAAankF,SAAQ,SAAUijF,GACvC,IAAIxuB,EAAYuuB,GAAuBC,GACnCoC,EAAalB,EAAYlB,GAC7B,QAAmB,IAAfoC,EAAJ,CAEA,IAAI1J,EAA2B,mBAAX75B,EACdA,EACAA,EAAOmhC,IAAmBnhC,EAAO2S,GACvC,GAAIknB,EAAQ,CACR,IAAIjqE,EAAWiqE,IAAWyH,GAAcxH,GACpCD,EAAOwG,GAAgBkD,GAAa30C,EAASA,EAAS,GAAIw0C,GAAkB,CAAEzwB,UAAWA,EAAWwuB,eAAgBA,EAAgBqC,QAAS14B,EAAM24B,WAAWtK,EAAQgI,MACtKvxE,IAAa2xE,GACbz2B,EAAMz0B,MAAM63C,MAAMiL,EAAQgI,IAGtBvxE,IAAakqE,KACblqE,OAAW,GACXA,IAAa2zE,IACbN,EAAgB9B,GAAkBvxE,EAClCszE,GAAgB,EAChBK,EAAa3zE,SAIN,IAAf2zE,IACAJ,GAAe,OAGnBD,EAWA,OAVArnF,KAAK2/B,MAAM29C,EAAQ8J,GACfE,IACItnF,gBAAgB0mF,GAChB1mF,KAAK6M,KAAKywE,QAAU,SAGbt9E,KAAK6M,KAAKywE,GAErBt9E,KAAKw6B,MAAM63C,MAAMiL,EAAQ,cAEtB,EAGf,OAAO,GAEXqI,EAAYtlF,UAAUu/D,OAAS,SAAU0d,EAAQxmB,EAAW7pD,GACxD,IAAI6hD,EACA03B,EAAcxmF,KAAK+iE,OAAOua,GAC9B,GAAIkJ,EAAa,CACb,IAAI9uB,EAAW13D,KAAK+lF,cAAcS,EAAa,cAC3ClB,EAAiBxuB,GAAa7pD,EAC5BjN,KAAK4lF,SAASiC,kBAAkB,CAAEnwB,SAAUA,EAAUZ,UAAWA,EAAW7pD,KAAMA,IAClF6pD,EACN,OAAO92D,KAAKg+E,OAAOV,EAAQgI,IAAkBx2B,EAAK,IAC3Cw2B,GAAkBG,GACrB32B,GAAM22B,IAEd,OAAO,GAEXE,EAAYtlF,UAAUynF,MAAQ,SAAUhhF,EAAS2+B,GAC7C,IAAIsiD,GAAU,EAYd,OAXIjhF,EAAQisB,KACJ4xD,GAAOzjF,KAAKlB,KAAK6M,KAAM/F,EAAQisB,MAC/Bg1D,EAAU/nF,KAAK4/D,OAAO94D,EAAQisB,GAAIjsB,EAAQgwD,UAAWhwD,EAAQmG,OAE7DjN,gBAAgB0mF,IAAS1mF,OAASylC,IAClCsiD,EAAU/nF,KAAK4vB,OAAOk4D,MAAMhhF,EAAS2+B,IAAUsiD,IAE/CjhF,EAAQgwD,WAAaixB,IACrB/nF,KAAKw6B,MAAM63C,MAAMvrE,EAAQisB,GAAIjsB,EAAQgwD,WAAa,aAGnDixB,GAEXpC,EAAYtlF,UAAU6K,MAAQ,WAC1BlL,KAAK2H,QAAQ,OAEjBg+E,EAAYtlF,UAAU0iF,QAAU,WAC5B,IAAI9zB,EAAQjvD,KACRc,EAAMd,KAAKumF,WACXyB,EAAe,GASnB,OARAhoF,KAAKioF,eAAe5lF,SAAQ,SAAU0wB,GAC7B4xD,GAAOzjF,KAAK+tD,EAAM22B,SAASa,kBAAmB1zD,IAC/Ci1D,EAAaxhF,KAAKusB,MAGtBi1D,EAAaxiF,SACb1E,EAAIonF,OAAS,CAAEF,aAAcA,EAAaryE,SAEvC7U,GAEX6kF,EAAYtlF,UAAUsH,QAAU,SAAU6vB,GACtC,IAAIy3B,EAAQjvD,KAMZ,GALAgB,OAAOuF,KAAKvG,KAAK6M,MAAMxK,SAAQ,SAAUi7E,GAC/B9lD,GAAWmtD,GAAOzjF,KAAKs2B,EAAS8lD,IAClCruB,EAAM2Q,OAAO0d,MAGjB9lD,EAAS,CACT,IAAI0wD,EAAS1wD,EAAQ0wD,OAAQC,EAASj1C,GAAO1b,EAAS,CAAC,WACvDx2B,OAAOuF,KAAK4hF,GAAQ9lF,SAAQ,SAAUi7E,GAClCruB,EAAMtvB,MAAM29C,EAAQ6K,EAAO7K,OAE3B4K,GACAA,EAAOF,aAAa3lF,QAAQrC,KAAKooF,OAAQpoF,QAIrD2lF,EAAYtlF,UAAU+nF,OAAS,SAAU9D,GACrC,OAAOtkF,KAAK6lF,QAAQvB,IAAWtkF,KAAK6lF,QAAQvB,IAAW,GAAK,GAEhEqB,EAAYtlF,UAAUgoF,QAAU,SAAU/D,GACtC,GAAItkF,KAAK6lF,QAAQvB,GAAU,EAAG,CAC1B,IAAItmE,IAAUhe,KAAK6lF,QAAQvB,GAG3B,OAFKtmE,UACMhe,KAAK6lF,QAAQvB,GACjBtmE,EAEX,OAAO,GAEX2nE,EAAYtlF,UAAU4nF,aAAe,SAAUK,GAS3C,YARY,IAARA,IAAkBA,EAAM,IAAIr8E,KAChCjL,OAAOuF,KAAKvG,KAAK6lF,SAASxjF,QAAQimF,EAAIh8E,IAAKg8E,GACvCtoF,gBAAgB0mF,GAChB1mF,KAAK4vB,OAAOq4D,aAAaK,GAGzBtnF,OAAOuF,KAAKvG,KAAK4lF,SAASa,mBAAmBpkF,QAAQimF,EAAIh8E,IAAKg8E,GAE3DA,GAEX3C,EAAYtlF,UAAU+jF,GAAK,WACvB,IAAIn1B,EAAQjvD,KACRsoF,EAAMtoF,KAAKioF,eACXM,EAAWvoF,KAAKumF,WACpB+B,EAAIjmF,SAAQ,SAAU0wB,GACd4xD,GAAOzjF,KAAKqnF,EAAUx1D,KACtB/xB,OAAOuF,KAAK0oD,EAAMu5B,gBAAgBz1D,IAAK1wB,QAAQimF,EAAIh8E,IAAKg8E,UACjDC,EAASx1D,OAGxB,IAAI01D,EAAcznF,OAAOuF,KAAKgiF,GAC9B,GAAIE,EAAYjjF,OAAQ,CAEpB,IADA,IAAIkjF,EAAS1oF,KACN0oF,aAAkBhC,IACrBgC,EAASA,EAAO94D,OACpB64D,EAAYpmF,SAAQ,SAAU0wB,GAAM,OAAO21D,EAAO9oB,OAAO7sC,MAE7D,OAAO01D,GAEX9C,EAAYtlF,UAAUmoF,gBAAkB,SAAUlL,GAC9C,IAAKqH,GAAOzjF,KAAKlB,KAAK8lF,KAAMxI,GAAS,CACjC,IAAIqL,EAAU3oF,KAAK8lF,KAAKxI,GAAUt8E,OAAO2H,OAAO,MAC5CnJ,EAAOQ,KAAK6M,KAAKywE,GACrB,IAAK99E,EACD,OAAOmpF,EACX,IAAIC,EAAY,IAAI38E,IAAI,CAACzM,IACzBopF,EAAUvmF,SAAQ,SAAUvB,GACpB60D,GAAY70D,KACZ6nF,EAAQ7nF,EAAI40D,QAAS,GAErBb,GAAgB/zD,IAChBE,OAAOuF,KAAKzF,GAAKuB,SAAQ,SAAUmH,GAC/B,IAAI65D,EAAQviE,EAAI0I,GACZqrD,GAAgBwO,IAChBulB,EAAUt8E,IAAI+2D,SAMlC,OAAOrjE,KAAK8lF,KAAKxI,IAErBqI,EAAYtlF,UAAUu0E,aAAe,WACjC,OAAO50E,KAAKw6B,MAAMquD,SAAS7lB,YAAYvlD,YAEpCkoE,EAnTO,GAsTdmD,GAAc,WACd,SAASA,EAAW9B,EAASp3D,QACV,IAAXA,IAAqBA,EAAS,MAClC5vB,KAAKgnF,QAAUA,EACfhnF,KAAK4vB,OAASA,EACd5vB,KAAKwyC,EAAI,KACTxyC,KAAK+oF,eAuBT,OArBAD,EAAWzoF,UAAU0oF,aAAe,WAChC/oF,KAAKwyC,EAAIxyC,KAAKgnF,QAAUzT,KAAQ,KAChCvzE,KAAK6oF,SAAW,IAAIjmB,GAAKU,KAE7BwlB,EAAWzoF,UAAU8zE,OAAS,SAAUmJ,EAAQgI,GAC5C,GAAItlF,KAAKwyC,EAAG,CACRxyC,KAAKwyC,EAAEw2C,GAAW1L,EAAQgI,IAC1B,IAAIxuB,EAAYuuB,GAAuBC,GACnCxuB,IAAcwuB,GACdtlF,KAAKwyC,EAAEw2C,GAAW1L,EAAQxmB,IAE1B92D,KAAK4vB,QACL5vB,KAAK4vB,OAAOukD,OAAOmJ,EAAQgI,KAIvCwD,EAAWzoF,UAAUgyE,MAAQ,SAAUiL,EAAQgI,GACvCtlF,KAAKwyC,GACLxyC,KAAKwyC,EAAE6/B,MAAM2W,GAAW1L,EAAQgI,GAAoC,aAAnBA,EAAgC,SAAW,aAG7FwD,EA7BM,GA+BjB,SAASE,GAAW1L,EAAQgI,GACxB,OAAOA,EAAiB,IAAMhI,EAE3B,SAAS2L,GAA+B5K,EAAO6K,GAC9CC,GAAsB9K,IACtBA,EAAM7jD,MAAM25C,OAAO+U,EAAU,aAGrC,SAAWvD,GACP,IAAIyD,EAAQ,SAAUp6B,GAElB,SAASo6B,EAAKt6B,GACV,IAAI82B,EAAW92B,EAAG82B,SAAUvnB,EAAKvP,EAAGo2B,cAAeA,OAAuB,IAAP7mB,GAAuBA,EAAI7K,EAAO1E,EAAG0E,KACpGvE,EAAQD,EAAO9tD,KAAKlB,KAAM4lF,EAAU,IAAIkD,GAAW5D,KAAmBllF,KAK1E,OAJAivD,EAAMo6B,MAAQ,IAAIC,GAAMr6B,GACxBA,EAAMs6B,YAAc,IAAI3mB,GAAKU,IACzB9P,GACAvE,EAAMtnD,QAAQ6rD,GACXvE,EAWX,OAnBApc,EAAUu2C,EAAMp6B,GAUhBo6B,EAAK/oF,UAAUmpF,SAAW,SAAUC,EAASC,GACzC,OAAO1pF,KAAKqpF,MAAMG,SAASC,EAASC,IAExCN,EAAK/oF,UAAUspF,YAAc,WACzB,OAAO3pF,MAEXopF,EAAK/oF,UAAUunF,WAAa,WACxB,OAAO5nF,KAAKupF,YAAYvmB,YAAYvlD,YAEjC2rE,EApBA,CAqBTzD,GACFA,EAAYyD,KAAOA,EAvBvB,CAwBGzD,KAAgBA,GAAc,KACjC,IAAIe,GAAS,SAAU13B,GAEnB,SAAS03B,EAAM3zD,EAAInD,EAAQ85D,EAAQlvD,GAC/B,IAAIy0B,EAAQD,EAAO9tD,KAAKlB,KAAM4vB,EAAOg2D,SAAUprD,IAAUx6B,KAMzD,OALAivD,EAAMl8B,GAAKA,EACXk8B,EAAMr/B,OAASA,EACfq/B,EAAMy6B,OAASA,EACfz6B,EAAMz0B,MAAQA,EACdkvD,EAAOz6B,GACAA,EAkDX,OA1DApc,EAAU6zC,EAAO13B,GAUjB03B,EAAMrmF,UAAUmpF,SAAW,SAAUC,EAASC,GAC1C,OAAO,IAAIhD,EAAM+C,EAASzpF,KAAM0pF,EAAQ1pF,KAAKw6B,QAEjDksD,EAAMrmF,UAAUspF,YAAc,SAAUF,GACpC,IAAIx6B,EAAQjvD,KACR4vB,EAAS5vB,KAAK4vB,OAAO+5D,YAAYF,GACrC,OAAIA,IAAYzpF,KAAK+yB,IACb/yB,KAAKw6B,MAAMwsD,SACXhmF,OAAOuF,KAAKvG,KAAK6M,MAAMxK,SAAQ,SAAUi7E,GACrC,IAAIsM,EAAiB36B,EAAMpiD,KAAKywE,GAC5BuM,EAAoBj6D,EAAe,OAAE0tD,GACpCuM,EAGKD,EAMDA,IAAmBC,GACxB7oF,OAAOuF,KAAKqjF,GAAgBvnF,SAAQ,SAAUijF,GACrCjkB,GAAMuoB,EAAetE,GAAiBuE,EAAkBvE,KACzDr2B,EAAMz0B,MAAM63C,MAAMiL,EAAQgI,OARlCr2B,EAAMz0B,MAAM63C,MAAMiL,EAAQ,YAC1Bt8E,OAAOuF,KAAKsjF,GAAmBxnF,SAAQ,SAAUijF,GAC7Cr2B,EAAMz0B,MAAM63C,MAAMiL,EAAQgI,OAL9Br2B,EAAM2Q,OAAO0d,MAiBlB1tD,GAEPA,IAAW5vB,KAAK4vB,OACT5vB,KACJ4vB,EAAO45D,SAASxpF,KAAK+yB,GAAI/yB,KAAK0pF,SAEzChD,EAAMrmF,UAAUkmF,SAAW,WACvB,OAAOxzC,EAASA,EAAS,GAAI/yC,KAAK4vB,OAAO22D,YAAavmF,KAAK6M,OAE/D65E,EAAMrmF,UAAUmoF,gBAAkB,SAAUlL,GACxC,IAAIwM,EAAa9pF,KAAK4vB,OAAO44D,gBAAgBlL,GAC7C,OAAOqH,GAAOzjF,KAAKlB,KAAK6M,KAAMywE,GAAUvqC,EAASA,EAAS,GAAI+2C,GAAa96B,EAAO3uD,UAAUmoF,gBAAgBtnF,KAAKlB,KAAMs9E,IAAWwM,GAEtIpD,EAAMrmF,UAAUunF,WAAa,WAEzB,IADA,IAAIh1C,EAAI5yC,KAAK4vB,OACNgjB,EAAEhjB,QACLgjB,EAAIA,EAAEhjB,OACV,OAAOgjB,EAAEg1C,WAAW16E,MAAM0lC,EAAGn1B,YAE1BipE,EA3DC,CA4DVf,IACE2D,GAAS,SAAUt6B,GAEnB,SAASs6B,EAAM9pF,GACX,OAAOwvD,EAAO9tD,KAAKlB,KAAM,oBAAqBR,GAAM,cAAiB,IAAIspF,GAAWtpF,EAAKg7B,MAAMwsD,QAASxnF,EAAKg7B,SAAWx6B,KAQ5H,OAVA6yC,EAAUy2C,EAAOt6B,GAIjBs6B,EAAMjpF,UAAUspF,YAAc,WAC1B,OAAO3pF,MAEXspF,EAAMjpF,UAAUs/B,MAAQ,WACpB,OAAO3/B,KAAK4vB,OAAO+P,MAAMzyB,MAAMlN,KAAK4vB,OAAQnS,YAEzC6rE,EAXC,CAYV5C,IACF,SAASK,GAAsBgD,EAAgBC,EAAgBp3E,GAC3D,IAAIq3E,EAAgBF,EAAen3E,GAC/Bs3E,EAAgBF,EAAep3E,GACnC,OAAOyuD,GAAM4oB,EAAeC,GAAiBD,EAAgBC,EAE1D,SAASf,GAAsB9K,GAClC,SAAUA,aAAiBsH,IAAetH,EAAM7jD,MAAMwsD,SCvc1D,SAASmD,GAAqB3hF,EAAKghB,GAC/B,OAAO,IAAI+6D,GAAkB/7E,EAAIC,QAAS+gB,EAAQja,KAAKzL,QAAS0lB,EAAQm/B,MAAOn/B,EAAQo/B,WAE3F,SAASwhC,GAAwBtjF,GAC7B,MAAO,CACHA,EAAQ46C,aACR56C,EAAQk/E,kBACRl/E,EAAQ0iB,QACR1iB,EAAQ0iB,QAAQ8vD,iBAGxB,IAAI+Q,GAAe,WACf,SAASA,EAAY5qB,GACjB,IAAIxQ,EAAQjvD,KACZA,KAAKsqF,aAAe,IAAKhnB,GAAgBv2D,QAAUrB,KACnD1L,KAAKy/D,OAAS58B,GAAQ48B,EAAQ,CAC1BwlB,aAAoC,IAAvBxlB,EAAOwlB,YACpB3L,gBAAiB6L,GAAsB1lB,KAE3Cz/D,KAAKuqF,MAAQ9qB,EAAO8qB,OAAS,IAAI1mB,GACjC7jE,KAAKwqF,oBAAsB,IAAK,SAAU1jF,GACtC,IAAIgoD,EACAwqB,EAAkBxyE,EAAQ0iB,QAAQ8vD,gBAClCmR,EAAWL,GAAwBtjF,GACvC2jF,EAAS,IAAMnR,EACf,IAAIppE,GAAS4+C,EAAKG,EAAMu7B,qBAAqBlqC,KAAKpzC,MAAM4hD,EAAI27B,GAC5D,OAAIv6E,EACIopE,EACOvmC,EAASA,EAAS,GAAI7iC,GAAQ,CAAE9M,OAAQ6rD,EAAMs7B,MAAMrmB,MAAMh0D,EAAM9M,UAEpE8M,GAEX+4E,GAA+BniF,EAAQ0iB,QAAQ60D,MAAOv3E,EAAQ4jF,aAAah1B,OACpEzG,EAAM07B,qBAAqB7jF,MACnC,CACC0W,IAAKxd,KAAKy/D,OAAOmrB,mBACjBjW,QAASyV,GACTxV,aAAc,SAAUlzB,EAAc9xB,EAAQpG,EAAS8vD,GACnD,GAAI6P,GAAsB3/D,EAAQ60D,OAC9B,OAAO70D,EAAQ60D,MAAMzJ,aAAalzB,EAAciU,GAAY/lC,GAAUA,EAAO8lC,MAAQ9lC,EAAQpG,EAAQqhE,UAAWvR,MAI5Ht5E,KAAK8qF,wBAA0B,IAAK,SAAUhkF,GAE1C,OADAmiF,GAA+BniF,EAAQ0iB,QAAQ60D,MAAOv3E,EAAQ4jF,aAAah1B,OACpEzG,EAAM87B,yBAAyBjkF,KACvC,CACC0W,IAAKxd,KAAKy/D,OAAOmrB,mBACjBhW,aAAc,SAAU9lB,GACpB,IAAI5F,EAAQ4F,EAAG5F,MAAO/7C,EAAQ2hD,EAAG3hD,MAAOqc,EAAUslC,EAAGtlC,QACrD,GAAI2/D,GAAsB3/D,EAAQ60D,OAC9B,OAAO70D,EAAQ60D,MAAMzJ,aAAa1rB,EAAO/7C,EAAOqc,EAAQqhE,cAyLxE,OApLAR,EAAYhqF,UAAU2qF,WAAa,WAC/BhrF,KAAKuqF,MAAQ,IAAI1mB,IAErBwmB,EAAYhqF,UAAU4qF,sBAAwB,SAAUn8B,GACpD,IAAIuvB,EAAQvvB,EAAGuvB,MAAO11B,EAAQmG,EAAGnG,MAAO0V,EAAKvP,EAAGw1B,OAAQA,OAAgB,IAAPjmB,EAAgB,aAAeA,EAAIzV,EAAYkG,EAAGlG,UAAWiX,EAAK/Q,EAAGud,kBAAmBA,OAA2B,IAAPxM,GAAuBA,EAAII,EAAKnR,EAAGwqB,gBAAiBA,OAAyB,IAAPrZ,EAAgBjgE,KAAKy/D,OAAO6Z,gBAAkBrZ,EAC7R2lB,EAAW5lF,KAAKy/D,OAAOxpD,MAAM2vE,SACjCh9B,EAAY7V,EAASA,EAAS,GAAIslB,GAAiBJ,GAAmBtP,KAAUC,GAChF,IAAIsiC,EAAUz1B,GAAc6uB,GACxB6G,EAAanrF,KAAKwqF,oBAAoB,CACtC9oC,aAAcyW,GAAkBxP,GAAOjH,aACvCskC,kBAAmBkF,EACnBR,aAAcQ,EACd1hE,QAAS,CACL60D,MAAOA,EACP11B,MAAOA,EACPi9B,SAAUA,EACVh9B,UAAWA,EACXiiC,UAAWhmB,GAAmBjc,GAC9B0wB,gBAAiBA,EACjB9jB,YAAaL,GAAkB6C,GAAuBrP,IACtDp5C,KAAM,MAGV67E,EAAmBD,EAAW3e,SAAW2e,EAAW3e,QAAQhnE,OAAS,EACzE,GAAI4lF,IAAqB/e,EACrB,MAAM8e,EAAW3e,QAAQ,GAE7B,MAAO,CACHppE,OAAQ+nF,EAAW/nF,OACnBopE,QAAS2e,EAAW3e,QACpB1Z,UAAWs4B,IAGnBf,EAAYhqF,UAAUgrF,QAAU,SAAUjoF,EAAQwsB,EAAQ8xB,EAAcl4B,GACpE,GAAI2/D,GAAsB3/D,EAAQ60D,QAC9Br+E,KAAKsqF,aAAavlF,IAAI3B,KAAYs+C,EAAc,CAChD,IAAI+nB,EAASzpE,KAAKwqF,oBAAoBlqC,KAAKoB,EAAc9xB,EAAQpG,EAASxpB,KAAKuqF,MAAMpmB,QAAQ/gE,IAC7F,GAAIqmE,GAAUrmE,IAAWqmE,EAAOrmE,OAC5B,OAAO,EAGf,OAAO,GAEXinF,EAAYhqF,UAAUsqF,qBAAuB,SAAU77B,GACnD,IAAIG,EAAQjvD,KACR0hD,EAAeoN,EAAGpN,aAAcskC,EAAoBl3B,EAAGk3B,kBAAmB0E,EAAe57B,EAAG47B,aAAclhE,EAAUslC,EAAGtlC,QAC3H,GAAImsC,GAAYqwB,KACXx8D,EAAQo8D,SAASa,kBAAkBT,EAAkBtwB,SACrDlsC,EAAQ60D,MAAMl4E,IAAI6/E,EAAkBtwB,OACrC,MAAO,CACHtyD,OAAQpD,KAAKuqF,MAAMtxB,MACnBuT,QAAS,CAAC2d,GAAqBt6B,QAAU,IAAId,GAAe,iCAAmCi3B,EAAkBtwB,MAAQ,WAAa,IAAI3G,GAAe,GAAIvlC,KAGrK,IAAIo/B,EAAYp/B,EAAQo/B,UAAWg9B,EAAWp8D,EAAQo8D,SAAUvH,EAAQ70D,EAAQ60D,MAC5EiN,EAAiB,GACjBC,EAAc,CAAEnoF,OAAQ,MACxBs0D,EAAW2mB,EAAM0H,cAAcC,EAAmB,cAMtD,SAASwF,IACL,OAAOD,EAAY/e,UAAY+e,EAAY/e,QAAU,IAEzD,SAASif,EAAcroF,GACnB,IAAI0rD,EAGJ,OAFI1rD,EAAOopE,UACN1d,EAAK08B,KAAchlF,KAAK0G,MAAM4hD,EAAI1rD,EAAOopE,SACvCppE,EAAOA,OAZdpD,KAAKy/D,OAAOwlB,aACQ,iBAAbvtB,IACNkuB,EAAS8F,kBAAkBh0B,IAC5B4zB,EAAe9kF,KAAK,CAAEixD,WAAYC,IAWtC,IAAItQ,EAAU,IAAIn7C,IAAIy1C,EAAae,YACnC2E,EAAQ/kD,SAAQ,SAAUkzD,GACtB,IAAIzG,EACJ,GAAKgZ,GAAcvS,EAAW3M,GAE9B,GAAI,GAAQ2M,GAAY,CACpB,IAAImyB,EAAa9B,EAAS4B,UAAU,CAChC1wB,UAAWvB,EAAUn0D,KAAKM,MAC1BwnD,MAAOqM,EACP3M,UAAWp/B,EAAQo/B,UACnBxU,KAAM4xC,GACPx8D,GACCmiE,EAAap0B,GAAuBhC,GACxC/rC,EAAQja,KAAK/I,KAAKmlF,QACC,IAAfjE,EACKlgB,GAAsBC,MAAMlS,IAC7Bi2B,IAAahlF,KAAK2jF,GAAqBt6B,QAAU,IAAId,GAAe,qBAAuBwG,EAAUn0D,KAAKM,MAAQ,SAAWi0D,GAAYqwB,GACnIA,EAAkBtwB,MAAQ,UAC1B,UAAY1vD,KAAKw1C,UAAUwqC,EAAmB,KAAM,KAAO,IAAIj3B,GAAe,GAAIvlC,IAGvFjnB,MAAMC,QAAQklF,GACnBA,EAAa+D,EAAcx8B,EAAM67B,wBAAwB,CACrD5hC,MAAOqM,EACPpoD,MAAOu6E,EACPgD,aAAcA,EACdlhE,QAASA,KAGP+rC,EAAU7T,aAKG,MAAdgmC,IACLA,EAAa+D,EAAcx8B,EAAMu7B,oBAAoB,CACjD9oC,aAAc6T,EAAU7T,aACxBskC,kBAAmB0B,EACnBgD,aAAc/0B,GAAY+xB,GAAcA,EAAagD,EACrDlhE,QAASA,MATTA,EAAQ8vD,kBACRoO,EAAaz4B,EAAMs7B,MAAMnmB,KAAKsjB,SAWnB,IAAfA,GACA4D,EAAe9kF,OAAMsoD,EAAK,IAAO68B,GAAcjE,EAAY54B,IAE/D,GAAUtlC,EAAQja,KAAKoN,QAAUgvE,OAEhC,CACD,IAAIt2B,EAAWC,GAAyBC,EAAW/rC,EAAQgsC,aACvDH,GAAYuwB,EAASgG,gBAAgBv2B,EAAUqC,IAC/CrC,EAAS3T,aAAae,WAAWpgD,QAAQ+kD,EAAQ96C,IAAK86C,OAIlE,IAAI0/B,EAAS9W,GAAesb,GAK5B,OAJAC,EAAYnoF,OAASomB,EAAQ8vD,gBACvBt5E,KAAKuqF,MAAMrmB,MAAM4iB,GACjBtC,GAAgBsC,GACtB9mF,KAAKsqF,aAAapmF,IAAIqnF,EAAYnoF,OAAQs+C,GACnC6pC,GAEXlB,EAAYhqF,UAAU0qF,yBAA2B,SAAUj8B,GACvD,IAEI0d,EAFAvd,EAAQjvD,KACRkpD,EAAQ4F,EAAG5F,MAAO/7C,EAAQ2hD,EAAG3hD,MAAOu9E,EAAe57B,EAAG47B,aAAclhE,EAAUslC,EAAGtlC,QAErF,SAASiiE,EAAcI,EAAapmF,GAMhC,OALIomF,EAAYrf,UACZA,EAAUA,GAAW,IACbhmE,KAAK0G,MAAMs/D,EAASqf,EAAYrf,SAE5C,GAAUhjD,EAAQja,KAAKoN,QAAUlX,GAC1BomF,EAAYzoF,OAgCvB,OA9BI8lD,EAAMxH,eACNv0C,EAAQA,EAAMw2B,OAAOna,EAAQ60D,MAAM4H,UAEvC94E,EAAQA,EAAM/K,KAAI,SAAU6gD,EAAMx9C,GAC9B,OAAa,OAATw9C,EACO,MAEXz5B,EAAQja,KAAK/I,KAAKf,GACdlD,MAAMC,QAAQygD,GACPwoC,EAAcx8B,EAAM67B,wBAAwB,CAC/C5hC,MAAOA,EACP/7C,MAAO81C,EACPynC,aAAcA,EACdlhE,QAASA,IACT/jB,GAEJyjD,EAAMxH,aACC+pC,EAAcx8B,EAAMu7B,oBAAoB,CAC3C9oC,aAAcwH,EAAMxH,aACpBskC,kBAAmB/iC,EACnBynC,aAAc/0B,GAAY1S,GAAQA,EAAOynC,EACzClhE,QAASA,IACT/jB,IAEJoqD,SAchB,SAAsCwuB,EAAOn1B,EAAOw+B,GAChD,IAAKx+B,EAAMxH,aAAc,CACrB,IAAIknC,EAAY,IAAI38E,IAAI,CAACy7E,IACzBkB,EAAUvmF,SAAQ,SAAUX,GACpBmzD,GAAgBnzD,KAChBmuD,QAAU,IAAW8F,GAAYj0D,GAAQ,4CF7NlD,SAAoC28E,EAAO2H,GAC9C,OAAOrwB,GAAYqwB,GACb3H,EAAMt5E,IAAIihF,EAAkBtwB,MAAO,cACnCswB,GAAqBA,EAAkBvuB,WE0NsDq0B,CAA2BzN,EAAO38E,GAAS,6BAA+BwnD,EAAM9nD,KAAKM,OAAS,IAAWi0D,GAAYj0D,GAAQ,GACpNV,OAAOyF,OAAO/E,GAAOW,QAAQumF,EAAUt8E,IAAKs8E,QAnB5CmD,CAA6BviE,EAAQ60D,MAAOn1B,EAAOjG,GAEvD,GAAUz5B,EAAQja,KAAKoN,QAAUlX,GAC1Bw9C,OAEJ,CACH7/C,OAAQomB,EAAQ8vD,gBAAkBt5E,KAAKuqF,MAAMrmB,MAAM/2D,GAASA,EAC5Dq/D,QAASA,IAGV6d,EAjOO,GCbd2B,GAAe,WACf,SAASA,EAAY/1E,EAAOhT,GACxBjD,KAAKiW,MAAQA,EACbjW,KAAKiD,OAASA,EAyOlB,OAvOA+oF,EAAY3rF,UAAU4rF,aAAe,SAAU5N,EAAOvvB,GAClD,IAAIG,EAAQjvD,KACR2oD,EAAQmG,EAAGnG,MAAOvlD,EAAS0rD,EAAG1rD,OAAQk6E,EAASxuB,EAAGwuB,OAAQ10B,EAAYkG,EAAGlG,UAAW+xB,EAAY7rB,EAAG6rB,UACnGuR,EAAsBp0B,GAAuBnP,GAC7CsnB,EHgDD,IAAIC,GG/CPtnB,EAAY7V,EAASA,EAAS,GAAIslB,GAAiB6zB,IAAuBtjC,GAC1E,IAAIp/B,EAAU,CACV60D,MAAOA,EACP8N,QAASnrF,OAAO2H,OAAO,MACvBg3B,MAAO,SAAUinD,EAAUC,GACvB,OAAO5W,EAAOtwC,MAAMinD,EAAUC,IAElCj+B,UAAWA,EACXiiC,UAAWhmB,GAAmBjc,GAC9B4M,YAAaL,GAAkB6C,GAAuBrP,IACtDgyB,YAAaA,EACbyR,aAAc,IAAI1gF,IAClB2gF,YAAY,GAEZ/F,EAAMtmF,KAAKssF,oBAAoB,CAC/BlpF,OAAQA,GAAUpC,OAAO2H,OAAO,MAChC20E,OAAQA,EACR57B,aAAcwqC,EAAoBxqC,aAClC6qC,UAAW,CAAEnqF,IAAK,IAAIsJ,KACtB8d,QAASA,IAEb,IAAKmsC,GAAY2wB,GACb,MAAMz2B,QAAU,IAAId,GAAe,6BAA+B/oD,KAAKw1C,UAAUp4C,IAAW,IAAI2rD,GAAe,GAoCnH,OAlCAvlC,EAAQ4iE,aAAa/pF,SAAQ,SAAUysD,EAAIwuB,GACvC,IAAIn5B,EAAS2K,EAAG3K,OAAQooC,EAAYz9B,EAAGy9B,UAAW9pC,EAAaqM,EAAGrM,WAC9D+pC,EAAY/2B,GAAc6nB,GAC9B,GAAIiP,GAAaA,EAAUnqF,IAAI0K,KAAM,CACjC,IAAI2/E,EAAUx9B,EAAMy9B,YAAYH,EAAWC,EAAWroC,EAAQ36B,GAC9D,GAAImsC,GAAY82B,GACZ,OAEJtoC,EAASsoC,EAEb,GAAI58B,UAAYrmC,EAAQmxD,UAAW,CAC/B,IAGIgS,EAA4B,IAAI1gF,IACpCw2C,EAAWpgD,SAAQ,SAAUkzD,GACrB,GAAQA,IAAcA,EAAU7T,cAChCirC,EAA0BrgF,IAAIipD,EAAUn0D,KAAKM,UAOrDV,OAAOuF,KAAK49C,GAAQ9hD,SAAQ,SAAUijF,IAbd,SAAUA,GAC9B,OAAOqH,EAA0BxmF,IAAIk/E,GAAuBC,KAaxDsH,CAAkBtH,KALD,SAAUA,GAC/B,IAAIuH,EAAYN,GAAaA,EAAUnqF,IAAI2C,IAAIugF,GAC/C,OAAO5wC,QAAQm4C,GAAaA,EAAU3qB,MAAQ2qB,EAAU3qB,KAAKviC,OAIxDmtD,CAAmBxH,IA6N5C,SAA2ByH,EAAaC,EAAa1H,EAAgBjH,GACjE,IAAI4O,EAAW,SAAU/G,GACrB,IAAI7iB,EAAQgb,EAAM0H,cAAcG,EAAUZ,GAC1C,MAAwB,iBAAVjiB,GAAsBA,GAEpCujB,EAAWqG,EAASF,GACxB,GAAKnG,EAAL,CAEA,IAAIC,EAAWoG,EAASD,GACxB,GAAKnG,IAEDlxB,GAAYixB,KAEZvlB,GAAMulB,EAAUC,KAEhB7lF,OAAOuF,KAAKqgF,GAAU/+C,OAAM,SAAUr+B,GAAO,YAA8C,IAAvC60E,EAAM0H,cAAcc,EAAUr9E,MAAtF,CAGA,IAAI0jF,EAAa7O,EAAM0H,cAAcgH,EAAa,eAC9C1O,EAAM0H,cAAciH,EAAa,cACjCl2B,EAAYuuB,GAAuBC,GACnC6H,EAAcD,EAAa,IAAMp2B,EACrC,IAAIs2B,GAASjnF,IAAIgnF,GAAjB,CAEAC,GAAS9gF,IAAI6gF,GACb,IAAIE,EAAiB,GAChB9qF,MAAMC,QAAQokF,IACdrkF,MAAMC,QAAQqkF,IACf,CAACD,EAAUC,GAAUxkF,SAAQ,SAAUghE,GACnC,IAAI3L,EAAW2mB,EAAM0H,cAAc1iB,EAAO,cAClB,iBAAb3L,GACN21B,EAAe9+D,SAASmpC,IACzB21B,EAAe7mF,KAAKkxD,MAIhC7H,SAAW,QAAe,6CAA+CiH,EAAY,eAAiBo2B,EAAa,+EAAiFG,EAAe7nF,OAC7M,qCACE6nF,EAAe1nF,KAAK,SAAW,8CACjC,IAAM,0CAA4CwnF,EAAc,2EAA6EnnF,KAAKw1C,UAAUorC,GAAU9iF,MAAM,EAAG,KAAQ,iBAAmBkC,KAAKw1C,UAAUqrC,GAAU/iF,MAAM,EAAG,KAAQ,qRAnQtOwpF,CAAkBd,EAAWroC,EAAQmhC,EAAgB97D,EAAQ60D,UAIzEA,EAAM1+C,MAAM29C,EAAQn5B,MAExBk6B,EAAM+J,OAAO9B,EAAI5wB,OACV4wB,GAEX0F,EAAY3rF,UAAUisF,oBAAsB,SAAUx9B,GAClD,IAAIG,EAAQjvD,KACRs9E,EAASxuB,EAAGwuB,OAAQl6E,EAAS0rD,EAAG1rD,OAAQs+C,EAAeoN,EAAGpN,aAAcl4B,EAAUslC,EAAGtlC,QAAS+iE,EAAYz9B,EAAGy9B,UAC7G3G,EAAW5lF,KAAKiW,MAAM2vE,SACtBvnB,EAAKunB,EAAS1O,SAAS9zE,EAAQs+C,EAAcl4B,EAAQgsC,aAAcziC,EAAKsrC,EAAG,GAAIymB,EAAYzmB,EAAG,GAElG,GAAI,iBADJif,EAASA,GAAUvqD,GACa,CAC5B,IAAIw6D,EAAO/jE,EAAQ2iE,QAAQ7O,KAAY9zD,EAAQ2iE,QAAQ7O,GAAU,IAC7DgJ,EAAM7wB,GAAc6nB,GACxB,GAAIiQ,EAAKxsF,QAAQ2gD,IAAiB,EAC9B,OAAO4kC,EAEX,GADAiH,EAAK/mF,KAAKk7C,GACN1hD,KAAKiD,QAAUjD,KAAKiD,OAAOooF,QAAQjoF,EAAQkjF,EAAK5kC,EAAcl4B,GAC9D,OAAO88D,EAGf,IAAIkH,EAAiBxsF,OAAO2H,OAAO,MAC/Bm8E,IACA0I,EAAiBhkE,EAAQmW,MAAM6tD,EAAgB1I,IAEnD,IAAIptB,EAAY4lB,GAAUsI,EAASa,kBAAkBnJ,IACjD9lB,GAAsBp0D,EAAQs+C,EAAcl4B,EAAQgsC,cACnD8nB,GAAU9zD,EAAQ60D,MAAMt5E,IAAIu4E,EAAQ,cACrC,iBAAoB5lB,IACpB81B,EAAe/1B,WAAaC,GAEhC,IAAIjV,EAAa,IAAIx2C,IAAIy1C,EAAae,YAyDtC,GAxDAA,EAAWpgD,SAAQ,SAAUkzD,GACzB,IAAIzG,EACJ,GAAKgZ,GAAcvS,EAAW/rC,EAAQo/B,WAEtC,GAAI,GAAQ2M,GAAY,CACpB,IAAIk4B,EAAiBl2B,GAAuBhC,GACxC7zD,EAAQ0B,EAAOqqF,GACfC,EAAgBlkE,EAAQ6iE,WAG5B,GAFA7iE,EAAQ6iE,WAAaqB,MAAoBn4B,EAAU9T,aAC/C8T,EAAU9T,WAAW9W,MAAK,SAAU6H,GAAK,MAAwB,WAAjBA,EAAEpxC,KAAKM,eAC7C,IAAVA,EAAkB,CAClB,IAAI4jF,EAAiBM,EAASiC,kBAAkB,CAC5CnwB,SAAUA,EACVZ,UAAWvB,EAAUn0D,KAAKM,MAC1BwnD,MAAOqM,EACP3M,UAAWp/B,EAAQo/B,YAEnBikC,EAAYc,GAAkBpB,EAAWjH,GACzC4E,EAAgBj7B,EAAM2+B,kBAAkBlsF,EAAO6zD,EAAW/rC,EAASqjE,GACnEgB,OAAgB,EACpB,GAAIt4B,EAAU7T,gBACVmsC,EAAgBrkE,EAAQ60D,MAAM0H,cAAcmE,EAAe,gBACrCv0B,GAAYu0B,GAAgB,CAC9C,IAAIhoB,EAAO14C,EAAQ4iE,aAAarnF,IAAImlF,EAAcx0B,OAClDm4B,EAAgB3rB,GAAQA,EAAK/d,OAAOsT,WAG5C,IAAI93B,EAAQimD,EAASkI,iBAAiBp2B,EAAUnC,EAAUn0D,KAAKM,MAAOmsF,GAClEluD,EACAktD,EAAU3qB,KAAO,CACbhZ,MAAOqM,EACPmC,SAAUA,EACV/3B,MAAOA,GAIXouD,GAA2BxB,EAAWjH,GAE1CkI,EAAiBhkE,EAAQmW,MAAM6tD,IAAiB1+B,EAAK,IAC9Cw2B,GAAkB4E,EACrBp7B,SAEEtlC,EAAQ6iE,YACb7kB,GAAsBC,MAAMlS,IAC7B1F,SAAW,UAAiB,kBAAoB0H,GAAuBhC,GAAa,0BAA4BvvD,KAAKw1C,UAAUp4C,EAAQ,KAAM,IAAI0pC,UAAU,EAAG,MAElKtjB,EAAQ6iE,WAAaqB,MAEpB,CACD,IAAIr4B,EAAWC,GAAyBC,EAAW/rC,EAAQgsC,aACvDH,GACAuwB,EAASgG,gBAAgBv2B,EAAUqC,EAAUt0D,EAAQomB,EAAQo/B,YAC7DyM,EAAS3T,aAAae,WAAWpgD,QAAQogD,EAAWn2C,IAAKm2C,OAIjE,iBAAoB66B,EAAQ,CAC5B,IAAI/sD,EAAW/G,EAAQ4iE,aAAarnF,IAAIu4E,GAcxC,OAbI/sD,GACAA,EAAS4zB,OAAS36B,EAAQmW,MAAMpP,EAAS4zB,OAAQqpC,GACjDj9D,EAASg8D,UAAYyB,GAAgBz9D,EAASg8D,UAAWA,GACzDh8D,EAASkyB,WAAWpgD,QAAQogD,EAAWn2C,IAAKm2C,GAC5ClyB,EAASkyB,WAAaA,GAGtBj5B,EAAQ4iE,aAAaloF,IAAIo5E,EAAQ,CAC7Bn5B,OAAQqpC,EACRjB,UAAW0B,GAAiB1B,QAAa,EAASA,EAClD9pC,WAAYA,IAGbgT,GAAc6nB,GAEzB,OAAOkQ,GAEXxB,EAAY3rF,UAAUutF,kBAAoB,SAAUlsF,EAAOwnD,EAAO1/B,EAAS+iE,GACvE,IAAIt9B,EAAQjvD,KACZ,OAAKkpD,EAAMxH,cAA0B,OAAVhgD,EAGvBa,MAAMC,QAAQd,GACPA,EAAMU,KAAI,SAAU6gD,EAAMx9C,GAC7B,IAAI/D,EAAQutD,EAAM2+B,kBAAkB3qC,EAAMiG,EAAO1/B,EAASmkE,GAAkBpB,EAAW9mF,IAEvF,OADAsoF,GAA2BxB,EAAW9mF,GAC/B/D,KAGR1B,KAAKssF,oBAAoB,CAC5BlpF,OAAQ1B,EACRggD,aAAcwH,EAAMxH,aACpBl4B,QAASA,EACT+iE,UAAWA,IAbJ18B,QAAU1oB,GAAUzlC,GAASA,GAgB5CsqF,EAAY3rF,UAAUqsF,YAAc,SAAUH,EAAW3F,EAAUC,EAAUr9D,EAAS0kE,GAClF,IAAIp/B,EACAG,EAAQjvD,KACZ,GAAIusF,EAAUnqF,IAAI0K,OAAS6oD,GAAYkxB,GAAW,CAC9C,IAMIO,EANA+G,EAAQ5rF,MAAMC,QAAQqkF,KACrBlxB,GAAYixB,KAAapB,GAAwBoB,QAAyB,EAAXA,EAChEwH,EAAMvH,EACNsH,IAAQD,IACRA,EAAiB,CAACv4B,GAAYw4B,GAAOA,EAAIz4B,MAAQy4B,IAGrD,IAAIE,EAAa,SAAUj6C,EAAMhzC,GAC7B,OAAOmB,MAAMC,QAAQ4xC,GACE,iBAAThzC,EAAoBgzC,EAAKhzC,QAAQ,EACzCooB,EAAQ60D,MAAM0H,cAAc3xC,EAAM/yC,OAAOD,KAEnDmrF,EAAUnqF,IAAIC,SAAQ,SAAUwqF,EAAWvH,GACvC,IAAIgJ,EAAOD,EAAWF,EAAK7I,GACvBiJ,EAAOF,EAAWD,EAAK9I,GAC3B,QAAI,IAAWiJ,EAAf,CAEIL,GACAA,EAAe1nF,KAAK8+E,GAExB,IAAIkJ,EAAOv/B,EAAMy9B,YAAYG,EAAWyB,EAAMC,EAAM/kE,EAAS0kE,GACzDM,IAASD,IACTnH,EAAkBA,GAAmB,IAAI17E,KACzBxH,IAAIohF,EAAgBkJ,GAEpCN,GACA,GAAUA,EAAevxE,QAAU2oE,OAGvC8B,IACAP,EAAYtkF,MAAMC,QAAQ4rF,GAAOA,EAAItqF,MAAM,GAAKivC,EAAS,GAAIq7C,GAC7DhH,EAAgB/kF,SAAQ,SAAUX,EAAON,GACrCylF,EAASzlF,GAAQM,MAI7B,OAAI6qF,EAAUrqB,KACHliE,KAAKiW,MAAM2vE,SAAS6I,iBAAiB7H,EAAUC,EAAU0F,EAAUrqB,KAAM14C,EAAS0kE,IAAmBp/B,EAAKtlC,EAAQ60D,OAAOuJ,WAAW16E,MAAM4hD,EAAIo/B,IAElJrH,GAEJmF,EA5OO,GA+Od0C,GAAqB,GACzB,SAASf,GAAkB7+B,EAAI1tD,GAC3B,IAAIgB,EAAM0sD,EAAG1sD,IAIb,OAHKA,EAAI+D,IAAI/E,IACTgB,EAAI8B,IAAI9C,EAAMstF,GAAmB/xE,OAAS,CAAEva,IAAK,IAAIsJ,MAElDtJ,EAAI2C,IAAI3D,GAEnB,SAAS4sF,GAAgB70B,EAAMC,GAC3B,GAAID,IAASC,IAAUA,GAAS60B,GAAiB70B,GAC7C,OAAOD,EACX,IAAKA,GAAQ80B,GAAiB90B,GAC1B,OAAOC,EACX,IAAI8I,EAAO/I,EAAK+I,MAAQ9I,EAAM8I,KAAOnvB,EAASA,EAAS,GAAIomB,EAAK+I,MAAO9I,EAAM8I,MAAQ/I,EAAK+I,MAAQ9I,EAAM8I,KACpGysB,EAAkBx1B,EAAK/2D,IAAI0K,MAAQssD,EAAMh3D,IAAI0K,KAG7Cg6E,EAAS,CAAE5kB,KAAMA,EAAM9/D,IAFjBusF,EAAkB,IAAIjjF,IAC5BytD,EAAK/2D,IAAI0K,KAAOqsD,EAAK/2D,IAAMg3D,EAAMh3D,KAErC,GAAIusF,EAAiB,CACjB,IAAIC,EAAuB,IAAI3iF,IAAImtD,EAAMh3D,IAAImE,QAC7C4yD,EAAK/2D,IAAIC,SAAQ,SAAUwsF,EAAUrlF,GACjCs9E,EAAO1kF,IAAI8B,IAAIsF,EAAKwkF,GAAgBa,EAAUz1B,EAAMh3D,IAAI2C,IAAIyE,KAC5DolF,EAAqBhvB,OAAOp2D,MAEhColF,EAAqBvsF,SAAQ,SAAUmH,GACnCs9E,EAAO1kF,IAAI8B,IAAIsF,EAAKwkF,GAAgB50B,EAAMh3D,IAAI2C,IAAIyE,GAAM2vD,EAAK/2D,IAAI2C,IAAIyE,QAG7E,OAAOs9E,EAEX,SAASmH,GAAiBa,GACtB,OAAQA,KAAUA,EAAK5sB,MAAQ4sB,EAAK1sF,IAAI0K,MAE5C,SAASihF,GAA2Bj/B,EAAI1tD,GACpC,IAAIgB,EAAM0sD,EAAG1sD,IACTyqF,EAAYzqF,EAAI2C,IAAI3D,GACpByrF,GAAaoB,GAAiBpB,KAC9B6B,GAAmBloF,KAAKqmF,GACxBzqF,EAAIw9D,OAAOx+D,IAGnB,IAAIgsF,GAAW,IAAInhF,IC9RZ,SAAS8iF,GAAoBrtF,GAChC,IAAIstF,EAAUrmB,GAAa,uBAC3B,OAAO3iE,KAAKw1C,UAAU95C,GAAO,SAAU8H,EAAK9H,GACxC,YAAiB,IAAVA,EAAmBstF,EAAUttF,KACrC+F,MAAMzB,KAAKw1C,UAAUwzC,IAAUrpF,KAAK,eCG3C,SAASspF,GAAuBC,GAC5B,YAAqB,IAAdA,EAAKjiF,KAAkBiiF,EAAKjiF,KAC/BiiF,EAAKhmC,MAAQmO,GAAyB63B,EAAKhmC,MAAOgmC,EAAKtmC,WAAa,KAH5EiO,GAAgBM,aAAa0N,IAK7B,IAAIsqB,GAAkB,aAClBC,GAAkB,SAAUC,EAAO7lE,GAAW,OAAOA,EAAQstC,WAC7Dw4B,GAAc,SAAU1I,EAAUC,EAAU/3B,GAE5C,OAAOygC,EADYzgC,EAAGygC,cACF3I,EAAUC,IAE9B2I,GAAe,SAAUlmE,EAAGu9D,GAAY,OAAOA,GAC/C4I,GAAY,WACZ,SAASA,EAAShwB,GACdz/D,KAAKy/D,OAASA,EACdz/D,KAAK0vF,aAAe1uF,OAAO2H,OAAO,MAClC3I,KAAK2vF,UAAY3uF,OAAO2H,OAAO,MAC/B3I,KAAK4vF,aAAe,IAAIlkF,IACxB1L,KAAK6vF,cAAgB,IAAInkF,IACzB1L,KAAK0rF,kBAAoB1qF,OAAO2H,OAAO,MACvC3I,KAAKymF,kBAAoBzlF,OAAO2H,OAAO,MACvC3I,KAAK8vF,oBAAqB,EAC1B9vF,KAAKy/D,OAAS1sB,EAAS,CAAEiyC,iBAAkBJ,IAA2BnlB,GACtEz/D,KAAKiW,MAAQjW,KAAKy/D,OAAOxpD,MACzBjW,KAAK+vF,gBAAgB,SACrB/vF,KAAK+vF,gBAAgB,YACrB/vF,KAAK+vF,gBAAgB,gBACjBtwB,EAAOuwB,eACPhwF,KAAKiwF,iBAAiBxwB,EAAOuwB,eAE7BvwB,EAAOiwB,cACP1vF,KAAKkwF,gBAAgBzwB,EAAOiwB,cAkSpC,OA/RAD,EAASpvF,UAAU62E,SAAW,SAAU7oE,EAAQqzC,EAAc8T,GAC1D,IAAIkC,EAAWhW,GAAgB8T,EACzBgC,GAAsBnpD,EAAQqzC,EAAc8T,GAC5CnnD,EAAOopD,WACb,GAAIC,IAAa13D,KAAKymF,kBAAkB0J,WACpC,MAAO,CAAC,cAUZ,IARA,IAKIp9D,EALAvJ,EAAU,CACVkuC,SAAUA,EACVhW,aAAcA,EACd8T,YAAaA,GAGb46B,EAAS14B,GAAY13D,KAAKqwF,cAAc34B,GACxC44B,EAAQF,GAAUA,EAAOE,OAAStwF,KAAKy/D,OAAOulB,iBAC3CsL,GAAO,CACV,IAAIC,EAAgBD,EAAMjiF,EAAQmb,GAClC,IAAIjnB,MAAMC,QAAQ+tF,GAGb,CACDx9D,EAAKw9D,EACL,MAJAD,EAAQE,GAAyBD,GAQzC,OADAx9D,EAAKA,EAAK1xB,OAAO0xB,QAAM,EAChBvJ,EAAQs7D,UAAY,CAAC/xD,EAAIvJ,EAAQs7D,WAAa,CAAC/xD,IAE1D08D,EAASpvF,UAAU6vF,gBAAkB,SAAUR,GAC3C,IAAIzgC,EAAQjvD,KACZgB,OAAOuF,KAAKmpF,GAAcrtF,SAAQ,SAAUq1D,GACxC,IAAI5I,EAAK4gC,EAAah4B,GAAW+4B,EAAY3hC,EAAG2hC,UAAWC,EAAe5hC,EAAG4hC,aAAcC,EAAmB7hC,EAAG6hC,iBAAkB9J,EAAW3zC,GAAO4b,EAAI,CAAC,YAAa,eAAgB,qBACnL2hC,GACAxhC,EAAM8gC,gBAAgB,QAASr4B,GAC/Bg5B,GACAzhC,EAAM8gC,gBAAgB,WAAYr4B,GAClCi5B,GACA1hC,EAAM8gC,gBAAgB,eAAgBr4B,GACtCitB,GAAOzjF,KAAK+tD,EAAM0gC,UAAWj4B,GAC7BzI,EAAM0gC,UAAUj4B,GAAUlxD,KAAKqgF,GAG/B53B,EAAM0gC,UAAUj4B,GAAY,CAACmvB,OAIzC4I,EAASpvF,UAAUuwF,iBAAmB,SAAUl5B,EAAUmvB,GACtD,IAAI53B,EAAQjvD,KACR4mF,EAAW5mF,KAAKqwF,cAAc34B,GAC9Bm5B,EAAYhK,EAASgK,UAAW1sC,EAAS0iC,EAAS1iC,OACtD,SAAS2sC,EAASlK,EAAUjnD,GACxBinD,EAASjnD,MACY,mBAAVA,EAAuBA,GAChB,IAAVA,EAAiB2vD,IACH,IAAV3vD,EAAkB6vD,GACd5I,EAASjnD,MAE7BmxD,EAASlK,EAAUC,EAASlnD,OAC5BinD,EAAS0J,OACS,IAAdO,EAAsB1B,GAClB5sF,MAAMC,QAAQquF,GAAaL,GAAyBK,GAC3B,mBAAdA,EAA2BA,EAC9BjK,EAAS0J,MACrBnsC,GACAnjD,OAAOuF,KAAK49C,GAAQ9hD,SAAQ,SAAUy0D,GAClC,IAAI8vB,EAAW33B,EAAM8hC,eAAer5B,EAAUZ,GAAW,GACrD+vB,EAAW1iC,EAAO2S,GACtB,GAAwB,mBAAb+vB,EACPD,EAASvC,KAAOwC,MAEf,CACD,IAAIlS,EAAUkS,EAASlS,QAAS0P,EAAOwC,EAASxC,KAAM1kD,EAAQknD,EAASlnD,MACvEinD,EAAS0J,OACO,IAAZ3b,EAAoBya,GAChB7sF,MAAMC,QAAQmyE,GAAWqc,GAAuBrc,GACzB,mBAAZA,EAAyBA,EAC5BiS,EAAS0J,MACL,mBAATjM,IACPuC,EAASvC,KAAOA,GAEpByM,EAASlK,EAAUjnD,GAEnBinD,EAASvC,MAAQuC,EAASjnD,QAC1BinD,EAAS0J,MAAQ1J,EAAS0J,OAASlB,QAKnDK,EAASpvF,UAAU0vF,gBAAkB,SAAUkB,EAAOv5B,QACjC,IAAbA,IAAuBA,EAAWu5B,GACtC,IAAI3M,EAAS,QAAU2M,EAAM5pF,cACzB6pF,EAAMlxF,KAAKymF,kBAAkBnC,GAC7B5sB,IAAaw5B,IACbrhC,QAAU,IAAWqhC,GAAOA,IAAQD,EAAO,sBAAwBA,EAAQ,8BAAgC,IAAWC,GAAOA,IAAQD,EAAO,GACxIC,UACOlxF,KAAK0rF,kBAAkBwF,GAClClxF,KAAK0rF,kBAAkBh0B,GAAY4sB,EACnCtkF,KAAKymF,kBAAkBnC,GAAU5sB,IAGzC+3B,EAASpvF,UAAU4vF,iBAAmB,SAAUD,GAC5C,IAAI/gC,EAAQjvD,KACZA,KAAK8vF,oBAAqB,EAC1B9uF,OAAOuF,KAAKypF,GAAe3tF,SAAQ,SAAU8uF,GACzCliC,EAAMmiC,gBAAgBD,GAAW,GACjCnB,EAAcmB,GAAW9uF,SAAQ,SAAUgvF,GACvCpiC,EAAMmiC,gBAAgBC,GAAS,GAAM/kF,IAAI6kF,GACzC,IAAIzyE,EAAQ2yE,EAAQ3yE,MAAM0mE,IACrB1mE,GAASA,EAAM,KAAO2yE,GACvBpiC,EAAM4gC,cAAc3rF,IAAImtF,EAAS,IAAI/+E,OAAO++E,WAK5D5B,EAASpvF,UAAUgwF,cAAgB,SAAU34B,GACzC,IAAIzI,EAAQjvD,KACZ,IAAK2kF,GAAOzjF,KAAKlB,KAAK0vF,aAAch4B,GAAW,CAC3C,IAAI45B,EAAWtxF,KAAK0vF,aAAah4B,GAAY12D,OAAO2H,OAAO,MAC3D2oF,EAASntC,OAASnjD,OAAO2H,OAAO,MAChC,IAAI4oF,EAAavxF,KAAK4vF,aAAa7qF,IAAI2yD,GACnC65B,GAAcA,EAAWzkF,MACzBykF,EAAWlvF,SAAQ,SAAU8uF,GACzB,IAAIriC,EAAKG,EAAMohC,cAAcc,GAAYhtC,EAAS2K,EAAG3K,OAAQjf,EAAOgO,GAAO4b,EAAI,CAAC,WAChF9tD,OAAO+9B,OAAOuyD,EAAUpsD,GACxBlkC,OAAO+9B,OAAOuyD,EAASntC,OAAQA,MAI3C,IAAIqtC,EAAQxxF,KAAK2vF,UAAUj4B,GAM3B,OALI85B,GAASA,EAAMhsF,QACfgsF,EAAM90E,OAAO,GAAGra,SAAQ,SAAU+tF,GAC9BnhC,EAAM2hC,iBAAiBl5B,EAAU04B,MAGlCpwF,KAAK0vF,aAAah4B,IAE7B+3B,EAASpvF,UAAU0wF,eAAiB,SAAUr5B,EAAUZ,EAAW26B,GAC/D,GAAI/5B,EAAU,CACV,IAAIg6B,EAAgB1xF,KAAKqwF,cAAc34B,GAAUvT,OACjD,OAAOutC,EAAc56B,IAAe26B,IAAoBC,EAAc56B,GAAa91D,OAAO2H,OAAO,SAGzG8mF,EAASpvF,UAAU+wF,gBAAkB,SAAUC,EAASI,GACpD,IAAIE,EAAe3xF,KAAK4vF,aAAa7qF,IAAIssF,GAIzC,OAHKM,GAAgBF,GACjBzxF,KAAK4vF,aAAa1rF,IAAImtF,EAASM,EAAe,IAAI1lF,KAE/C0lF,GAEXlC,EAASpvF,UAAUurF,gBAAkB,SAAUv2B,EAAUqC,EAAUt0D,EAAQwlD,GACvE,IAAIqG,EAAQjvD,KACZ,IAAKq1D,EAAS7R,cACV,OAAO,EACX,IAAKkU,EACD,OAAO,EACX,IAAIy5B,EAAY97B,EAAS7R,cAAcpiD,KAAKM,MAC5C,GAAIg2D,IAAay5B,EACb,OAAO,EACX,GAAInxF,KAAK8vF,oBACL9vF,KAAK4vF,aAAazpF,IAAIgrF,GAatB,IAZA,IAAIS,EAAuB5xF,KAAKoxF,gBAAgB15B,GAAU,GACtDm6B,EAAc,CAACD,GACfE,EAAiB,SAAUT,GAC3B,IAAIM,EAAe1iC,EAAMmiC,gBAAgBC,GAAS,GAC9CM,GACAA,EAAa7kF,MACb+kF,EAAY9wF,QAAQ4wF,GAAgB,GACpCE,EAAYrrF,KAAKmrF,IAGrBI,KAA8B3uF,IAAUpD,KAAK6vF,cAAc/iF,MAC3DklF,GAAwB,EACnBvsF,EAAI,EAAGA,EAAIosF,EAAYrsF,SAAUC,EAAG,CACzC,IAAIksF,EAAeE,EAAYpsF,GAC/B,GAAIksF,EAAaxrF,IAAIgrF,GAOjB,OANKS,EAAqBzrF,IAAIgrF,KACtBa,GACAniC,SAAW,QAAe,qBAAuB6H,EAAW,iBAAmBy5B,GAEnFS,EAAqBtlF,IAAI6kF,KAEtB,EAEXQ,EAAatvF,QAAQyvF,GACjBC,GACAtsF,IAAMosF,EAAYrsF,OAAS,GAC3B+/E,GAA0BlwB,EAAS3T,aAAct+C,EAAQwlD,KACzDmpC,GAA2B,EAC3BC,GAAwB,EACxBhyF,KAAK6vF,cAAcxtF,SAAQ,SAAU4vF,EAAQC,GACzC,IAAIxzE,EAAQg5C,EAASh5C,MAAMuzE,GACvBvzE,GAASA,EAAM,KAAOg5C,GACtBo6B,EAAeI,OAMnC,OAAO,GAEXzC,EAASpvF,UAAU8mF,WAAa,SAAUzvB,EAAUZ,GAChD,IAAIs5B,EAASpwF,KAAK+wF,eAAer5B,EAAUZ,GAAW,GACtD,SAAUs5B,IAAUA,EAAOE,QAE/Bb,EAASpvF,UAAUwnF,kBAAoB,SAAUsK,GAC7C,IAEI7M,EAFA5tB,EAAWy6B,EAAUz6B,SAAUZ,EAAYq7B,EAAUr7B,UACrDs5B,EAASpwF,KAAK+wF,eAAer5B,EAAUZ,GAAW,GAElDw5B,EAAQF,GAAUA,EAAOE,MAC7B,GAAIA,GAAS54B,EAQT,IAPA,IAAIluC,EAAU,CACVkuC,SAAUA,EACVZ,UAAWA,EACX5N,MAAOipC,EAAUjpC,OAAS,KAC1BN,UAAWupC,EAAUvpC,WAErB37C,EAAOgiF,GAAuBkD,GAC3B7B,GAAO,CACV,IAAI8B,EAAoB9B,EAAMrjF,EAAMuc,GACpC,IAAIjnB,MAAMC,QAAQ4vF,GAGb,CACD9M,EAAiB8M,GAAqBt7B,EACtC,MAJAw5B,EAAQU,GAAuBoB,GAa3C,YALuB,IAAnB9M,IACAA,EAAiB6M,EAAUjpC,MzDhMhC,SAA+BA,EAAON,GACzC,IAAIypC,EAAgB,KAChBnpC,EAAMzH,aACN4wC,EAAgB,GAChBnpC,EAAMzH,WAAWp/C,SAAQ,SAAUgkE,GAC/BgsB,EAAchsB,EAAUjlE,KAAKM,OAAS,GAClC2kE,EAAU5oD,WACV4oD,EAAU5oD,UAAUpb,SAAQ,SAAUysD,GAClC,IAAI1tD,EAAO0tD,EAAG1tD,KAAMM,EAAQotD,EAAGptD,MAC/B,OAAOk0D,GAA4By8B,EAAchsB,EAAUjlE,KAAKM,OAAQN,EAAMM,EAAOknD,UAKrG,IAAIiN,EAAS,KAQb,OAPI3M,EAAMzrC,WAAayrC,EAAMzrC,UAAUjY,SACnCqwD,EAAS,GACT3M,EAAMzrC,UAAUpb,SAAQ,SAAUysD,GAC9B,IAAI1tD,EAAO0tD,EAAG1tD,KAAMM,EAAQotD,EAAGptD,MAC/B,OAAOk0D,GAA4BC,EAAQz0D,EAAMM,EAAOknD,OAGzDiO,GAAgB3N,EAAM9nD,KAAKM,MAAOm0D,EAAQw8B,GyD2KnCC,CAAsBH,EAAUjpC,MAAOipC,EAAUvpC,WACjDiO,GAAgBC,EAAWm4B,GAAuBkD,MAErC,IAAnB7M,EACOxuB,EAEJA,IAAcuuB,GAAuBC,GACtCA,EACAxuB,EAAY,IAAMwuB,GAE5BmK,EAASpvF,UAAUmnF,UAAY,SAAU1gF,EAAS0iB,GAC9C,IAAIw8D,EAAoBl/E,EAAQstC,KAChC,GAAK4xC,IAEal/E,EAAQoiD,OAASpiD,EAAQgwD,WAC3C,CAEA,QAAyB,IAArBhwD,EAAQ4wD,SAAqB,CAC7B,IAAIA,EAAWluC,EAAQ60D,MAAM0H,cAAcC,EAAmB,cAC1DtuB,IACA5wD,EAAQ4wD,SAAWA,GAE3B,IAAI4tB,EAAiBtlF,KAAK6nF,kBAAkB/gF,GACxCgwD,EAAYuuB,GAAuBC,GACnCsB,EAAWp9D,EAAQ60D,MAAM0H,cAAcC,EAAmBV,GAC1D8K,EAASpwF,KAAK+wF,eAAejqF,EAAQ4wD,SAAUZ,GAAW,GAC1DutB,EAAO+L,GAAUA,EAAO/L,KAC5B,GAAIA,EAAM,CACN,IAAIkO,EAAcC,GAAyBxyF,KAAMgmF,EAAmBl/E,EAAS0iB,EAASA,EAAQ60D,MAAMuJ,WAAWjyB,GAAYqwB,GACrHA,EAAkBtwB,MAClBswB,EAAmBV,IACzB,OAAOrQ,GAAUlE,UAAU/wE,KAAKiW,MAAOouE,EAAM,CAACuC,EAAU2L,IAE5D,OAAO3L,IAEX6I,EAASpvF,UAAUytF,iBAAmB,SAAU2E,EAAgB37B,EAAW+2B,GACvE,IAAIuC,EAASpwF,KAAK+wF,eAAe0B,EAAgB37B,GAAW,GACxDn3B,EAAQywD,GAAUA,EAAOzwD,MAK7B,OAJKA,GAASkuD,IAEVluD,GADAywD,EAASpwF,KAAKqwF,cAAcxC,KACVuC,EAAOzwD,OAEtBA,GAEX8vD,EAASpvF,UAAUouF,iBAAmB,SAAU7H,EAAUC,EAAU/3B,EAAItlC,EAASm+D,GAC7E,IAAIz+B,EAAQ4F,EAAG5F,MAAOwO,EAAW5I,EAAG4I,SAAU/3B,EAAQmvB,EAAGnvB,MACzD,OAAIA,IAAU2vD,GACHoD,GAAyBlpE,EAAQ60D,MAAjCqU,CAAwC9L,EAAUC,GAEzDlnD,IAAU6vD,GACH3I,GAEPr9D,EAAQmxD,YACRiM,OAAW,GAERjnD,EAAMinD,EAAUC,EAAU2L,GAAyBxyF,UAAM,EAAQ,CAAE03D,SAAUA,EAAUZ,UAAW5N,EAAM9nD,KAAKM,MAAOwnD,MAAOA,EAAON,UAAWp/B,EAAQo/B,WAAap/B,EAASm+D,GAAW3mF,OAAO2H,OAAO,UAExM8mF,EArTI,GAwTf,SAAS+C,GAAyB5M,EAAUI,EAAmBmM,EAAW3oE,EAASm+D,GAC/E,IAAIrC,EAAiBM,EAASiC,kBAAkBsK,GAC5Cr7B,EAAYuuB,GAAuBC,GACnC18B,EAAYupC,EAAUvpC,WAAap/B,EAAQo/B,UAC3CkG,EAAKtlC,EAAQ60D,MAAO8H,EAAcr3B,EAAGq3B,YAAaF,EAAUn3B,EAAGm3B,QACnE,MAAO,CACHh5E,KAAMgiF,GAAuBkD,GAC7BjpC,MAAOipC,EAAUjpC,OAAS,KAC1B4N,UAAWA,EACXwuB,eAAgBA,EAChB18B,UAAWA,EACX+M,YAAaA,GACbwwB,YAAaA,EACbwB,QAASA,EACT1xE,MAAO2vE,EAAS3vE,MAChBgwE,QAASA,EACTuB,UAAW,SAAUC,EAAoBrzC,GACrC,IAAIttC,EACJ,GAAkC,iBAAvB2gF,EACP3gF,EAAU,CACNgwD,UAAW2wB,EACXrzC,KAAM32B,UAAUjY,OAAS,EAAI4uC,EAAO4xC,OAGvC,KAAInxB,GAAgB4yB,GAQrB,YADA53B,SAAW,QAAe,mCAAqCk/B,GAAoBxsF,MAAM6xC,KAAK32B,cAN9F3W,EAAUisC,EAAS,GAAI00C,GAClB9C,GAAOzjF,KAAKumF,EAAoB,UACjC3gF,EAAQstC,KAAO4xC,GAavB,OANIn2B,cAA4B,IAAjB/oD,EAAQstC,MACnByb,SAAW,QAAe,uDAAyDk/B,GAAoBxsF,MAAM6xC,KAAK32B,kBAElH,IAAW3W,EAAQ8hD,YACnB9hD,EAAQ8hD,UAAYA,GAEjBg9B,EAAS4B,UAAU1gF,EAAS0iB,IAEvC+lE,aAAcmD,GAAyBlpE,EAAQ60D,QAGvD,SAASqU,GAAyBrU,GAC9B,OAAO,SAAsBuI,EAAUC,GACnC,GAAItkF,MAAMC,QAAQokF,IAAarkF,MAAMC,QAAQqkF,GACzC,MAAMh3B,QAAU,IAAId,GAAe,qCAAuC,IAAIA,GAAe,GAEjG,GAAI8F,GAAgB+xB,IAChB/xB,GAAgBgyB,GAAW,CAC3B,IAAI8L,EAAQtU,EAAM0H,cAAca,EAAU,cACtCgM,EAAQvU,EAAM0H,cAAcc,EAAU,cAE1C,GADkB8L,GAASC,GAASD,IAAUC,EAE1C,OAAO/L,EAEX,GAAIlxB,GAAYixB,IACZpB,GAAwBqB,GAExB,OADAxI,EAAM1+C,MAAMinD,EAASlxB,MAAOmxB,GACrBD,EAEX,GAAIpB,GAAwBoB,IACxBjxB,GAAYkxB,GAEZ,OADAxI,EAAM1+C,MAAMinD,EAAUC,EAASnxB,OACxBmxB,EAEX,GAAIrB,GAAwBoB,IACxBpB,GAAwBqB,GACxB,OAAO9zC,EAASA,EAAS,GAAI6zC,GAAWC,GAGhD,OAAOA,GAGf,SAASmK,GAAuB6B,GAC5B,OAAO,SAAU5lF,EAAMuc,GACnB,OAAOvc,EAAOuc,EAAQstC,UAAY,IAAM9wD,KAAKw1C,UAAUs3C,GAAiB7lF,EAAM4lF,GAAW,IAAUrpE,EAAQstC,WAGnH,SAAS05B,GAAyBqC,GAC9B,IAAIE,EAAO,IAAInwB,GAAKU,IACpB,OAAO,SAAUj1D,EAAQmb,GACrB,IAAIwpE,EACJ,GAAIxpE,EAAQk4B,cAAgBl4B,EAAQgsC,YAAa,CAC7C,IAAI0M,EAAO6wB,EAAK/vB,YAAY,CACxBx5C,EAAQk4B,aACRl4B,EAAQgsC,cAEZw9B,EAAW9wB,EAAK8wB,WAAa9wB,EAAK8wB,SAAWC,GAAazpE,EAAQk4B,aAAcl4B,EAAQgsC,cAE5F,IAAIsvB,EAAYt7D,EAAQs7D,UACpBgO,GAAiBzkF,EAAQwkF,GAAW,EAAMG,GAC9C,OAAOxpE,EAAQkuC,SAAW,IAAM1xD,KAAKw1C,UAAUspC,IAGvD,SAASmO,GAAavxC,EAAc8T,GAChC,IAAIpzD,EAAMpB,OAAO2H,OAAO,MACpBuqF,EAAY,IAAIjnF,IAAI,CAACy1C,IA0BzB,OAzBAwxC,EAAU7wF,SAAQ,SAAUq/C,GACxBA,EAAae,WAAWpgD,SAAQ,SAAUkzD,GACtC,GAAI,GAAQA,GAAY,CACpB,GAAIA,EAAUzS,MAAO,CACjB,IAAIqwC,EAAc59B,EAAUzS,MAAMphD,MAC9B0xF,EAAW79B,EAAUn0D,KAAKM,MAC1B0xF,IAAaD,KACC/wF,EAAIixF,UAAYjxF,EAAIixF,QAAUryF,OAAO2H,OAAO,QAClDyqF,GAAYD,GAGxB59B,EAAU7T,gBACIt/C,EAAIkxF,UAAYlxF,EAAIkxF,QAAUtyF,OAAO2H,OAAO,QAClD4sD,EAAUn0D,KAAKM,OACnBuxF,GAAa19B,EAAU7T,aAAc8T,QAG5C,CACD,IAAIH,EAAWC,GAAyBC,EAAWC,GAC/CH,GACA69B,EAAU5mF,IAAI+oD,EAAS3T,qBAKhCt/C,EAEX,SAAS0wF,GAAiB3qF,EAAU0qF,EAAWU,EAAQP,GACnD,IACIQ,EACAC,EAFAC,EAAS1yF,OAAO2H,OAAO,MAyB3B,OAtBAkqF,EAAUxwF,SAAQ,SAAU4wC,GACxB,GAAI1wC,MAAMC,QAAQywC,IACd,GAA6B,iBAAlBwgD,GACoB,iBAApBD,EAA8B,CACrC,IAAIF,EAAUN,GAAYA,EAASM,QAC/BK,EAASL,GAAWA,EAAQG,GAChCC,EAAOD,GACHX,GAAiB3qF,EAASqrF,GAAkBvgD,EAAGsgD,EAAQI,QAG9D,CACD,IAAIN,EAAUL,GAAYA,EAASK,QAC/BO,EAAeP,GAAWA,EAAQpgD,IAAMA,EACxC0xC,GAAOzjF,KAAKiH,EAAUyrF,GACtBF,EAAOD,EAAgBxgD,GAAK9qC,EAASqrF,EAAkBI,IAGvD/jC,QAAU,IAAW0jC,EAAQ,kBAAoBK,EAAe,gCAAkC,IAAWL,EAAQ,GACrHC,EAAkBC,OAAgB,OAIvCC,ECtdX,IAAIG,GAAiB,SAAU7kC,GAE3B,SAAS6kC,EAAcp0B,QACJ,IAAXA,IAAqBA,EAAS,IAClC,IAAIxQ,EAAQD,EAAO9tD,KAAKlB,OAASA,KAcjC,OAbAivD,EAAM6kC,QAAU,IAAI7nF,IACpBgjD,EAAM8kC,sBAAwB,IAAIroF,IAClCujD,EAAMqmB,QAAUA,GAChBrmB,EAAM+kC,QAAU,EAChB/kC,EAAMwQ,ONEP,SAAyBA,GAC5B,OAAO58B,GAAQkiD,GAAetlB,GMHXw0B,CAAgBx0B,GAC/BxQ,EAAMg2B,cAAgBh2B,EAAMwQ,OAAOwlB,YACnCh2B,EAAM22B,SAAW,IAAI6J,GAAS,CAC1Bx5E,MAAOg5C,EACP+1B,iBAAkB/1B,EAAMwQ,OAAOulB,iBAC/BgL,cAAe/gC,EAAMwQ,OAAOuwB,cAC5BN,aAAczgC,EAAMwQ,OAAOiwB,eAE/BzgC,EAAMpmD,OACComD,EAuQX,OAxRApc,EAAUghD,EAAe7kC,GAmBzB6kC,EAAcxzF,UAAUwI,KAAO,WAC3B,IAAIqrF,EAAYl0F,KAAK6M,KAAO,IAAI84E,GAAYyD,KAAK,CAC7CxD,SAAU5lF,KAAK4lF,SACfV,cAAellF,KAAKy/D,OAAOylB,gBAE/BllF,KAAKm0F,eAAiBD,EAAU7K,MAChCrpF,KAAKo0F,oBAETP,EAAcxzF,UAAU+zF,iBAAmB,SAAUC,GACjD,IAAIplC,EAAQjvD,KACRs0F,EAAiBt0F,KAAKu0F,YAC1Bv0F,KAAKw0F,YAAc,IAAIxI,GAAYhsF,KAAMA,KAAKu0F,YAAc,IAAIlK,GAAY,CACxEp0E,MAAOjW,KACPilF,YAAajlF,KAAKilF,YAClB2F,mBAAoB5qF,KAAKy/D,OAAOmrB,mBAChCtR,gBAAiB6L,GAAsBnlF,KAAKy/D,QAC5C8qB,MAAO8J,OACD,EACAC,GAAkBA,EAAe/J,SAE3CvqF,KAAKy0F,oBAAsB,IAAK,SAAUjR,EAAG18E,GACzC,OAAOmoD,EAAMylC,eAAelR,EAAG18E,KAChC,CACC0W,IAAKxd,KAAKy/D,OAAOmrB,mBACjBhW,aAAc,SAAU4O,GACpB,IAAInF,EAAQmF,EAAE/U,WAAaxf,EAAMklC,eAAiBllC,EAAMpiD,KACxD,GAAIs8E,GAAsB9K,GAAQ,CAC9B,IAAI5P,EAAa+U,EAAE/U,WAAY6V,EAASd,EAAEc,OAAQ17B,EAAY46B,EAAE56B,UAChE,OAAOy1B,EAAMzJ,aAAa4O,EAAE76B,MAAO66B,EAAEn9E,SAAUw+D,GAAmB,CAAE4J,WAAYA,EAAY6V,OAAQA,EAAQ17B,UAAWA,SAInI,IAAI38C,IAAI,CACJjM,KAAK6M,KAAK2tB,MACVx6B,KAAKm0F,eAAe35D,QACrBn4B,SAAQ,SAAUm4B,GAAS,OAAOA,EAAMuuD,mBAE/C8K,EAAcxzF,UAAUsjF,QAAU,SAAU92E,GAIxC,OAHA7M,KAAK6I,OACDgE,GACA7M,KAAK6M,KAAKlF,QAAQkF,GACf7M,MAEX6zF,EAAcxzF,UAAU0iF,QAAU,SAAUtU,GAExC,YADmB,IAAfA,IAAyBA,GAAa,IAClCA,EAAazuE,KAAKm0F,eAAiBn0F,KAAK6M,MAAMk2E,WAE1D8Q,EAAcxzF,UAAUgkF,KAAO,SAAUv9E,GACrC,IAAIgoD,EAAKhoD,EAAQulE,kBAAmBA,OAA2B,IAAPvd,GAAwBA,EAChF,IACI,OAAO9uD,KAAKu0F,YAAYtJ,sBAAsBl4C,EAASA,EAAS,GAAIjsC,GAAU,CAAEu3E,MAAOv3E,EAAQ2nE,WAAazuE,KAAKm0F,eAAiBn0F,KAAK6M,KAAM4yD,OAAQz/D,KAAKy/D,OAAQ4M,kBAAmBA,KAAsBjpE,QAAU,KAEzN,MAAO3C,GACH,GAAIA,aAAa8jF,GACb,OAAO,KAEX,MAAM9jF,IAGdozF,EAAcxzF,UAAUy9E,MAAQ,SAAUh3E,GACtC,IAEI,QADE9G,KAAKg0F,QACAh0F,KAAKw0F,YAAYvI,aAAajsF,KAAK6M,KAAM/F,GAEpD,UACW9G,KAAKg0F,UAAiC,IAAtBltF,EAAQ0uE,WAC3Bx1E,KAAK81E,qBAIjB+d,EAAcxzF,UAAU29E,OAAS,SAAUl3E,GACvC,GAAI69E,GAAOzjF,KAAK4F,EAAS,QAAUA,EAAQisB,GACvC,OAAO,EAEX,IAAIsrD,EAAQv3E,EAAQ2nE,WACdzuE,KAAKm0F,eACLn0F,KAAK6M,KACX,IAEI,QADE7M,KAAKg0F,QACA3V,EAAML,OAAOl3E,EAAQisB,IAAM,aAAcjsB,EAAQq9C,QAE5D,UACWnkD,KAAKg0F,UAAiC,IAAtBltF,EAAQ0uE,WAC3Bx1E,KAAK81E,qBAIjB+d,EAAcxzF,UAAU8rE,KAAO,SAAUrlE,GACrC,OAAO9G,KAAKu0F,YAAYtJ,sBAAsBl4C,EAASA,EAAS,GAAIjsC,GAAU,CAAEu3E,MAAOv3E,EAAQ2nE,WAAazuE,KAAKm0F,eAAiBn0F,KAAK6M,KAAMy3E,OAAQx9E,EAAQisB,IAAM,aAAc0sC,OAAQz/D,KAAKy/D,WAElMo0B,EAAcxzF,UAAU65E,MAAQ,SAAUA,GACtC,Id5GoBjkE,Ec4GhBg5C,EAAQjvD,KAQZ,OAPKA,KAAK8zF,QAAQhnF,Md5GtBqoE,GADwBl/D,Ec8GJjW,Md7GAqtE,KAAKhrE,SAAQ,SAAUgzE,GAAM,OAAOA,EAAGQ,YAAY5/D,Mc+GnEjW,KAAK8zF,QAAQxnF,IAAI4tE,GACbA,EAAMya,WACN30F,KAAKy0F,oBAAoBva,GAEtB,WACCjrB,EAAM6kC,QAAQl0B,OAAOsa,KAAWjrB,EAAM6kC,QAAQhnF,MAC9CsoE,GAAYnmB,GAEhBA,EAAMwlC,oBAAoBphB,OAAO6G,KAGzC2Z,EAAcxzF,UAAU+jF,GAAK,SAAUt9E,GACnC+9D,GAAmBG,QACnB,IAAIsjB,EAAMtoF,KAAKm0F,eAAe/P,KAS9B,OARIt9E,IAAY9G,KAAKg0F,UACbltF,EAAQstF,iBACRp0F,KAAKo0F,iBAAiBttF,EAAQutF,uBAEzBvtF,EAAQutF,uBACbr0F,KAAKu0F,YAAYvJ,cAGlB1C,GAEXuL,EAAcxzF,UAAU+nF,OAAS,SAAU9D,EAAQ7V,GAC/C,OAAQA,EAAazuE,KAAKm0F,eAAiBn0F,KAAK6M,MAAMu7E,OAAO9D,IAEjEuP,EAAcxzF,UAAUgoF,QAAU,SAAU/D,EAAQ7V,GAChD,OAAQA,EAAazuE,KAAKm0F,eAAiBn0F,KAAK6M,MAAMw7E,QAAQ/D,IAElEuP,EAAcxzF,UAAU62E,SAAW,SAAU7oE,GACzC,OAAOsnD,GAAYtnD,GAAUA,EAAOqnD,MAChC11D,KAAK4lF,SAAS1O,SAAS7oE,GAAQ,IAEvCwlF,EAAcxzF,UAAUynF,MAAQ,SAAUhhF,GACtC,IAAKA,EAAQisB,GAAI,CACb,GAAI4xD,GAAOzjF,KAAK4F,EAAS,MACrB,OAAO,EAEXA,EAAUisC,EAASA,EAAS,GAAIjsC,GAAU,CAAEisB,GAAI,eAEpD,IAEI,QADE/yB,KAAKg0F,QACAh0F,KAAKm0F,eAAerM,MAAMhhF,EAAS9G,KAAK6M,MAEnD,UACW7M,KAAKg0F,UAAiC,IAAtBltF,EAAQ0uE,WAC3Bx1E,KAAK81E,qBAIjB+d,EAAcxzF,UAAU2kE,MAAQ,SAAUl+D,GACtC,IAAImoD,EAAQjvD,KAWZ,OAVAA,KAAK6I,OACLg8D,GAAmBG,QACfl+D,GAAWA,EAAQm4E,gBACnBj/E,KAAK8zF,QAAQzxF,SAAQ,SAAU63E,GAAS,OAAOjrB,EAAMwlC,oBAAoBphB,OAAO6G,MAChFl6E,KAAK8zF,QAAQ5oF,QACbkqE,GAAYp1E,OAGZA,KAAK81E,mBAEFhzE,QAAQI,WAEnB2wF,EAAcxzF,UAAU88E,iBAAmB,SAAUyX,GACjD,IAAIC,EAAoB70F,KAAKm0F,eAAexK,YAAYiL,GACpDC,IAAsB70F,KAAKm0F,iBAC3Bn0F,KAAKm0F,eAAiBU,EACtB70F,KAAK81E,qBAGb+d,EAAcxzF,UAAU0gF,MAAQ,SAAUj6E,GACtC,IAAImoD,EAAQjvD,KACRymC,EAAS3/B,EAAQ2/B,OAAQqoB,EAAKhoD,EAAQ2nE,WAAYA,OAAoB,IAAP3f,GAAuBA,EAAIquB,EAAmBr2E,EAAQq2E,iBAAkB6D,EAAiBl6E,EAAQk6E,eAChK8T,EAAU,SAAUC,GACpB,IAAIjmC,EAAKG,EAAOpiD,EAAOiiD,EAAGjiD,KAAMsnF,EAAiBrlC,EAAGqlC,iBAClDllC,EAAM+kC,QACJe,IACA9lC,EAAMpiD,KAAOoiD,EAAMklC,eAAiBY,GAExC,IACItuD,EAAOwoB,GAEX,UACMA,EAAM+kC,QACR/kC,EAAMpiD,KAAOA,EACboiD,EAAMklC,eAAiBA,IAG3Ba,EAAe,IAAI/oF,IACnB+0E,IAAmBhhF,KAAKg0F,SACxBh0F,KAAK81E,iBAAiB/iC,EAASA,EAAS,GAAIjsC,GAAU,CAAEk6E,eAAgB,SAAU9G,GAE1E,OADA8a,EAAa1oF,IAAI4tE,IACV,MAGO,iBAAfzL,EACPzuE,KAAKm0F,eAAiBn0F,KAAKm0F,eAAe3K,SAAS/a,EAAYqmB,IAE3C,IAAfrmB,EACLqmB,EAAQ90F,KAAK6M,MAGbioF,IAE4B,iBAArB3X,IACPn9E,KAAKm0F,eAAiBn0F,KAAKm0F,eAAexK,YAAYxM,IAEtD6D,GAAkBgU,EAAaloF,MAC/B9M,KAAK81E,iBAAiB/iC,EAASA,EAAS,GAAIjsC,GAAU,CAAEk6E,eAAgB,SAAU9G,EAAO/N,GACjF,IAAI/oE,EAAS49E,EAAe9/E,KAAKlB,KAAMk6E,EAAO/N,GAI9C,OAHe,IAAX/oE,GACA4xF,EAAap1B,OAAOsa,GAEjB92E,MAEX4xF,EAAaloF,MACbkoF,EAAa3yF,SAAQ,SAAU63E,GAAS,OAAOjrB,EAAMwlC,oBAAoBpiB,MAAM6H,OAInFl6E,KAAK81E,iBAAiBhvE,IAG9B+sF,EAAcxzF,UAAUq6E,mBAAqB,SAAUj0C,EAAQy9C,GAC3D,OAAOlkF,KAAK+gF,MAAM,CACdt6C,OAAQA,EACRgoC,WAAYyV,GAAkC,OAAjBA,KAGrC2P,EAAcxzF,UAAUk+E,kBAAoB,SAAUxpB,GAClD,GAAI/0D,KAAKilF,YAAa,CAClB,IAAI7hF,EAASpD,KAAK+zF,sBAAsBhvF,IAAIgwD,GAM5C,OALK3xD,IACDA,EAASokE,GAAsBzS,GAC/B/0D,KAAK+zF,sBAAsB7vF,IAAI6wD,EAAU3xD,GACzCpD,KAAK+zF,sBAAsB7vF,IAAId,EAAQA,IAEpCA,EAEX,OAAO2xD,GAEX8+B,EAAcxzF,UAAUy1E,iBAAmB,SAAUhvE,GACjD,IAAImoD,EAAQjvD,KACPA,KAAKg0F,SACNh0F,KAAK8zF,QAAQzxF,SAAQ,SAAUmhF,GAAK,OAAOv0B,EAAMwlC,oBAAoBjR,EAAG18E,OAGhF+sF,EAAcxzF,UAAUq0F,eAAiB,SAAUlR,EAAG18E,GAClD,IAAImyE,EAAWuK,EAAEvK,SACb9M,EAAOnsE,KAAKmsE,KAAKqX,GACjB18E,IACI08E,EAAE/U,YAC4B,iBAAvB3nE,EAAQ2nE,aACftC,EAAKyN,2BAA4B,GAEjC9yE,EAAQk6E,iBACiD,IAAzDl6E,EAAQk6E,eAAe9/E,KAAKlB,KAAMwjF,EAAGrX,EAAM8M,KAI9CA,GAAa5X,GAAM4X,EAAS71E,OAAQ+oE,EAAK/oE,SAC1CogF,EAAEn9E,SAASm9E,EAAEvK,SAAW9M,EAAM8M,IAG/B4a,EAzRS,CA0RlB7P,sMCnSIiR,GAAmC,EAAQ,MCFjD,kBAIE,wBAcA,KAAAC,YAAc,SAACC,GAAuB,OAAC,EAAKA,SAAW,IAAIlpF,IAAYkpF,IAbrEn1F,KAAKgtD,aAAe,IAAIthD,IACxB1L,KAAKm1F,SAAW,IAAIlpF,IACpBjM,KAAKo1F,UAAW,EAqBpB,OAlBE,YAAAC,eAAA,SAAenrC,GACb,OAAOlqD,KAAKgtD,aAAajoD,IAAImlD,IAAc,MAG7C,YAAAorC,gBAAA,SAAgBprC,GACd,OAAOlqD,KAAKm1F,SAAShvF,IAAI+jD,IAK3B,YAAAqrC,gBAAA,SAAgBvoC,GACdhtD,KAAKgtD,aAAeA,EACpBhtD,KAAKo1F,UAAW,GAGlB,YAAAI,gBAAA,WACE,OAAOx1F,KAAKgtD,cAEhB,EA5BA,qGCMMyoC,GAAmB7tC,GAAG,4pDAqCtB8tC,GAAmB9tC,GAAG,4gEA8E5B,SAlCA,WACE,WAA6Ba,GAAA,KAAAA,OAAAA,EA+B/B,OA7BE,YAAA4sC,eAAA,SAAe1sC,GACb,OAAO3oD,KAAKyoD,OAAOE,MAAmD,CACpEA,MAAOf,GAAG,6XAMU,cAAhB6tC,IAEJ7sC,UAAW,CAAED,MAAK,GAClBiB,YAAa,kBAIjB,YAAA4rC,gBAAA,SAAgB9rC,GACd,OAAO1pD,KAAKyoD,OAAOE,MAA2D,CAC5EA,MAAOf,GAAG,iYAMU,cAAhB8tC,IAEJ9sC,UAAW,CAAED,MAAO,CAAEe,WAAU,IAChCE,YAAa,kBAGnB,EAhCA,mBCtFA,4BAgCA,OA/BgB,EAAA+rC,wBAAd,SAAsCxrC,EAAwCyrC,SAC5E,IAAKzrC,EACH,MAAO,CAAExY,WAAW,EAAOC,mBAAoB/C,EAAmBgnD,oCAGpE,IAAMxrC,EAAcF,EAAYG,sBAAsBD,YAChDE,EAAYJ,EAAYG,sBAAsBC,UAEpD,OAAQF,GACN,KAAK,UACH,MAAO,CAAE1Y,WAAW,GACtB,KAAK,SACH,GAAIwY,EAAYG,sBAAsBC,YAAc,OAClD,MAAO,CAAE5Y,WAAW,GAEtB,GAAIwY,EAAYG,sBAAsBO,kBACpC,MAAO,CAAElZ,WAAW,GAGtB,IAAImZ,EAAeX,EAAYY,aAAaD,aAI5C,OAHIP,IAAc,eAAyBJ,EAAYY,aAAaE,eAAgB,IAAIntC,MAAOg4E,YAC7FhrC,EAAe,GAEbA,GAAgB8qC,GAAgB,MAAwC,QAAjC,EAAAzrC,EAAYG,6BAAqB,eAAEI,aAAc,GACnF,CAAE/Y,WAAW,GAEb,CAAEA,WAAW,EAAOC,mBAAoB/C,EAAmBknD,gCAK5E,EAhCA,gjDCKA,cAKE,WACmBrsC,EACAssC,EACjBvtC,GAFiB,KAAAiB,WAAAA,EACA,KAAAssC,aAAAA,EAGjBh2F,KAAKi2F,gBAAkB,IAAI,GAAgBxtC,GAC3CzoD,KAAKk2F,YAAc,IAAIC,GACvBn2F,KAAKo2F,oBAAsB,KAsD/B,OAnDE,YAAAf,eAAA,SAAsCgB,EAAsBjsC,GAI1D,IAAMD,EAAcnqD,KAAKg2F,aAAaX,eAAegB,GAC/CpsC,EAAWqsC,GAA2BX,wBAAwBxrC,EAAaC,GAEjF,OAAKD,EASEnqD,KAAKk2F,YAAYlsC,yBAAyBC,EAAUosC,EAAclsC,EAAaC,IARhF,KAAA77B,UAAS,CAACsgB,EAAmB0nD,iBAAkB1nD,EAAmBgD,SAAUoY,EAASrY,oBAChF,IAAEF,SAAS,GAAUuY,GAIvB,IAAEvY,SAAS,GAASuY,IAMzB,YAAAusC,iBAAN,gFAKE,OAJKx2F,KAAKo2F,sBACRp2F,KAAKo2F,oBAAsBp2F,KAAKy2F,sBAG3B,CAAP,EAAOz2F,KAAKo2F,4BAIA,YAAAK,mBAAd,+GAGM,SAAMz2F,KAAKi2F,gBAAgBT,gBAAgBx1F,KAAK0pD,2BAD1CsD,EACN,SAA2D,oBAGvD0pC,EAAqB12F,KAAKk2F,YAAYrqC,sBAAsBmB,GAClEhtD,KAAKg2F,aAAaT,gBAAgBmB,IAElChvC,QAAQ4H,IAAI,2CAIV,YAAAkmC,gBAAN,yHACOx1F,KAAKg2F,aAAaZ,SAAnB,MACF,GAAMp1F,KAAKw2F,2BAAX,0BAGF,MAAO,CAAP,EAAOj0F,MAAM6xC,KAAKp0C,KAAKg2F,aAAaR,kBAAkB/uF,UAAUrE,KAAI,SAAC+nD,GACnE,IAAMF,EAAWqsC,GAA2BX,wBAAwBxrC,GACpE,OAAO,EAAK+rC,YAAY5qC,6BAA6BnB,EAAaF,EAAU,EAAKP,wBAGvF,EAlEA,k1CCoBA,cAOE,WAAoBitC,GAFH,KAAAT,YAAc,IAAIC,G3EnB9B,SAA+BQ,GACpC,GAAI,KAAQA,EAAcC,QAExB,MAAM,IAAI1xF,MAAM,iDAGlB,IAAKyxF,EAAcjtC,WAEjB,MAAM,IAAIxkD,MAAM,mD2EchB2xF,CAAsBF,GACtB32F,KAAK22F,c3EXF,SAAsBA,GAE3B,OAAO,KAnBA,CACLG,QAAS,wBAkBiBH,G2ESLI,CAAaJ,GAClC32F,KAAKg3F,YL3BgB,SAAC,OAAEJ,EAAM,SAAEE,EAAO,UACnCG,EAAW,IAAIp+B,IAAW,SAACvX,EAAWoX,GAM1C,OALApX,EAAUuf,WAAW,CACnB1+D,QAAS,CACP,YAAay0F,KAGVl+B,EAAQpX,MAGX41C,EAAW,IAAIl5B,GAAS,CAC5BE,IAAK,UAAG44B,EAAO,YACf32F,MAAK,OAGP,OAAO,IAAIwhF,GAAa,CACtB5oB,KAAMk+B,EAASn0D,OAAOo0D,GACtBjhF,MAAO,IAAI49E,GAAc,CAAE7D,cAAe,OAC1C5uF,KAAM,gBACN+9D,QAAS81B,GAAY91B,UKQF,CAAiBn/D,KAAK22F,eACzC32F,KAAKm3F,WAAa,IAAI,GAAWn3F,KAAKg3F,aACtCh3F,KAAKo3F,oBAAsB,KAwE/B,OArEe,EAAAC,WAAb,SAAwBV,oIAEdW,EAAQ,IAAIC,EAAMZ,GAEpBA,EAAcjtC,WAChB,GAAM4tC,EAAME,cAAcb,EAAcjtC,aADtC,aACF,0BAEF,MAAO,CAAP,EAAO4tC,UAEP,iBAAM,IAAIpyF,MAAM,mCAA4B,6BAI1C,YAAAsyF,cAAN,SAAoB9tC,+FAGlB,OAFA1pD,KAAK22F,cAAcjtC,WAAaA,EAChC1pD,KAAKo3F,oBAAsB,IAAIK,GAAoB/tC,EAAY,IAAIguC,GAAwB13F,KAAKg3F,aAChG,GAAMh3F,KAAKo3F,oBAAoBZ,kCAA/B,qBAGF,YAAAnB,eAAA,SACEnrC,EACApjD,aAEAijD,GAA0B/pD,KAAK22F,eAC/B,IAGE,OAF4C,QAAxB,EAAA32F,KAAKo3F,2BAAmB,eAAE/B,eAAkBnrC,EAAWpjD,MAAAA,OAAO,EAAPA,EAASsjD,kBAG3EpqD,KAAK23F,yBAAyB7wF,MAAAA,OAAO,EAAPA,EAAS8wF,sBAGhD,MAAOpvF,GACP,IAAMqvF,GAAgC,QAAtB,EAAiB,QAAjB,EAAArvF,EAAI0hE,qBAAa,eAAG,UAAE,eAAE3zB,aAAc/tC,EAEtD,OADAk/C,QAAQpkD,MAAM,4BAA6Bu0F,GACpC73F,KAAK23F,yBAAyB7wF,MAAAA,OAAO,EAAPA,EAAS8wF,wBAI1C,YAAAD,yBAAR,SACEC,GAEA,OAAIA,EACK,CACLlmD,SAAS,EACTC,UAAWimD,EACXhmD,mBAAoBgmD,EAAuB/oD,EAAmBgD,QAAU,MAGrEJ,GAGH,YAAAiX,SAAN,6GACwB,SAAM1oD,KAAKm3F,WAAWttC,QAAQnB,mBACpD,OADMovC,EAAgB,SACf,CAAP,EAAO93F,KAAKk2F,YAAYnqC,SAAS+rC,EAAcjrF,eAG3C,YAAA48C,YAAN,iHAGe,OAFPC,EAAaK,GAA0B/pD,KAAK22F,eAErC,GAAM32F,KAAKm3F,WAAWrtC,UAAUL,YAAYC,WAEzD,OAFMquC,EAAO,SACEC,EAAiBD,EAAKlrF,KAAKi9C,UAAUoC,MAAK,QAClD,CAAP,EAAOlsD,KAAKk2F,YAAYzoC,YAAYuqC,YAGhC,YAAAxC,gBAAN,sFAGE,OAFAzrC,GAA0B/pD,KAAK22F,eAExB,CAAP,GAA+B,QAAxB,EAAA32F,KAAKo3F,2BAAmB,eAAE5B,oBAAqB,WAE1D,EApFA,ktDC5BIyC,EAA2B,GAG/B,SAASC,EAAoBC,GAE5B,IAAIC,EAAeH,EAAyBE,GAC5C,QAAqBl2F,IAAjBm2F,EACH,OAAOA,EAAa14F,QAGrB,IAAIC,EAASs4F,EAAyBE,GAAY,CACjDplE,GAAIolE,EACJE,QAAQ,EACR34F,QAAS,IAUV,OANA44F,EAAoBH,GAAUj3F,KAAKvB,EAAOD,QAASC,EAAQA,EAAOD,QAASw4F,GAG3Ev4F,EAAO04F,QAAS,EAGT14F,EAAOD,eCvBfw4F,EAAoBtiF,EAAKjW,IACxB,IAAI44F,EAAS54F,GAAUA,EAAO64F,WAC7B,IAAO74F,EAAiB,QACxB,IAAM,EAEP,OADAu4F,EAAoB1lD,EAAE+lD,EAAQ,CAAEj3B,EAAGi3B,IAC5BA,GCLRL,EAAoB1lD,EAAI,CAAC9yC,EAASw1D,KACjC,IAAI,IAAI1rD,KAAO0rD,EACXgjC,EAAoB9jC,EAAEc,EAAY1rD,KAAS0uF,EAAoB9jC,EAAE10D,EAAS8J,IAC5ExI,OAAOuJ,eAAe7K,EAAS8J,EAAK,CAAE6tC,YAAY,EAAMtyC,IAAKmwD,EAAW1rD,MCJ3E0uF,EAAoBl+E,EAAI,WACvB,GAA0B,iBAAf01C,WAAyB,OAAOA,WAC3C,IACC,OAAO1vD,MAAQ,IAAIkS,SAAS,cAAb,GACd,MAAOzR,GACR,GAAsB,iBAAXkvD,OAAqB,OAAOA,QALjB,GCAxBuoC,EAAoB9jC,EAAI,CAACtzD,EAAKk/B,IAAUh/B,OAAOX,UAAU+F,eAAelF,KAAKJ,EAAKk/B,GCClFk4D,EAAoBO,EAAK/4F,IACH,oBAAXa,QAA0BA,OAAOsP,aAC1C7O,OAAOuJ,eAAe7K,EAASa,OAAOsP,YAAa,CAAEnO,MAAO,WAE7DV,OAAOuJ,eAAe7K,EAAS,aAAc,CAAEgC,OAAO,KCLvDw2F,EAAoBQ,IAAO/4F,IAC1BA,EAAOotB,MAAQ,GACVptB,EAAOg5F,WAAUh5F,EAAOg5F,SAAW,IACjCh5F,GCAkBu4F,EAAoB","sources":["webpack://Stigg/webpack/universalModuleDefinition","webpack://Stigg/./node_modules/cross-fetch/dist/browser-ponyfill.js","webpack://Stigg/./node_modules/lodash/_DataView.js","webpack://Stigg/./node_modules/lodash/_Hash.js","webpack://Stigg/./node_modules/lodash/_ListCache.js","webpack://Stigg/./node_modules/lodash/_Map.js","webpack://Stigg/./node_modules/lodash/_MapCache.js","webpack://Stigg/./node_modules/lodash/_Promise.js","webpack://Stigg/./node_modules/lodash/_Set.js","webpack://Stigg/./node_modules/lodash/_SetCache.js","webpack://Stigg/./node_modules/lodash/_Stack.js","webpack://Stigg/./node_modules/lodash/_Symbol.js","webpack://Stigg/./node_modules/lodash/_Uint8Array.js","webpack://Stigg/./node_modules/lodash/_WeakMap.js","webpack://Stigg/./node_modules/lodash/_apply.js","webpack://Stigg/./node_modules/lodash/_arrayFilter.js","webpack://Stigg/./node_modules/lodash/_arrayLikeKeys.js","webpack://Stigg/./node_modules/lodash/_arrayMap.js","webpack://Stigg/./node_modules/lodash/_arrayPush.js","webpack://Stigg/./node_modules/lodash/_arraySome.js","webpack://Stigg/./node_modules/lodash/_assignMergeValue.js","webpack://Stigg/./node_modules/lodash/_assignValue.js","webpack://Stigg/./node_modules/lodash/_assocIndexOf.js","webpack://Stigg/./node_modules/lodash/_baseAssignValue.js","webpack://Stigg/./node_modules/lodash/_baseCreate.js","webpack://Stigg/./node_modules/lodash/_baseEach.js","webpack://Stigg/./node_modules/lodash/_baseFlatten.js","webpack://Stigg/./node_modules/lodash/_baseFor.js","webpack://Stigg/./node_modules/lodash/_baseForOwn.js","webpack://Stigg/./node_modules/lodash/_baseGet.js","webpack://Stigg/./node_modules/lodash/_baseGetAllKeys.js","webpack://Stigg/./node_modules/lodash/_baseGetTag.js","webpack://Stigg/./node_modules/lodash/_baseHasIn.js","webpack://Stigg/./node_modules/lodash/_baseIsArguments.js","webpack://Stigg/./node_modules/lodash/_baseIsEqual.js","webpack://Stigg/./node_modules/lodash/_baseIsEqualDeep.js","webpack://Stigg/./node_modules/lodash/_baseIsMatch.js","webpack://Stigg/./node_modules/lodash/_baseIsNative.js","webpack://Stigg/./node_modules/lodash/_baseIsTypedArray.js","webpack://Stigg/./node_modules/lodash/_baseIteratee.js","webpack://Stigg/./node_modules/lodash/_baseKeys.js","webpack://Stigg/./node_modules/lodash/_baseKeysIn.js","webpack://Stigg/./node_modules/lodash/_baseMap.js","webpack://Stigg/./node_modules/lodash/_baseMatches.js","webpack://Stigg/./node_modules/lodash/_baseMatchesProperty.js","webpack://Stigg/./node_modules/lodash/_baseMerge.js","webpack://Stigg/./node_modules/lodash/_baseMergeDeep.js","webpack://Stigg/./node_modules/lodash/_baseOrderBy.js","webpack://Stigg/./node_modules/lodash/_baseProperty.js","webpack://Stigg/./node_modules/lodash/_basePropertyDeep.js","webpack://Stigg/./node_modules/lodash/_baseRest.js","webpack://Stigg/./node_modules/lodash/_baseSetToString.js","webpack://Stigg/./node_modules/lodash/_baseSortBy.js","webpack://Stigg/./node_modules/lodash/_baseTimes.js","webpack://Stigg/./node_modules/lodash/_baseToString.js","webpack://Stigg/./node_modules/lodash/_baseUnary.js","webpack://Stigg/./node_modules/lodash/_cacheHas.js","webpack://Stigg/./node_modules/lodash/_castPath.js","webpack://Stigg/./node_modules/lodash/_cloneArrayBuffer.js","webpack://Stigg/./node_modules/lodash/_cloneBuffer.js","webpack://Stigg/./node_modules/lodash/_cloneTypedArray.js","webpack://Stigg/./node_modules/lodash/_compareAscending.js","webpack://Stigg/./node_modules/lodash/_compareMultiple.js","webpack://Stigg/./node_modules/lodash/_copyArray.js","webpack://Stigg/./node_modules/lodash/_copyObject.js","webpack://Stigg/./node_modules/lodash/_coreJsData.js","webpack://Stigg/./node_modules/lodash/_createAssigner.js","webpack://Stigg/./node_modules/lodash/_createBaseEach.js","webpack://Stigg/./node_modules/lodash/_createBaseFor.js","webpack://Stigg/./node_modules/lodash/_defineProperty.js","webpack://Stigg/./node_modules/lodash/_equalArrays.js","webpack://Stigg/./node_modules/lodash/_equalByTag.js","webpack://Stigg/./node_modules/lodash/_equalObjects.js","webpack://Stigg/./node_modules/lodash/_freeGlobal.js","webpack://Stigg/./node_modules/lodash/_getAllKeys.js","webpack://Stigg/./node_modules/lodash/_getMapData.js","webpack://Stigg/./node_modules/lodash/_getMatchData.js","webpack://Stigg/./node_modules/lodash/_getNative.js","webpack://Stigg/./node_modules/lodash/_getPrototype.js","webpack://Stigg/./node_modules/lodash/_getRawTag.js","webpack://Stigg/./node_modules/lodash/_getSymbols.js","webpack://Stigg/./node_modules/lodash/_getTag.js","webpack://Stigg/./node_modules/lodash/_getValue.js","webpack://Stigg/./node_modules/lodash/_hasPath.js","webpack://Stigg/./node_modules/lodash/_hashClear.js","webpack://Stigg/./node_modules/lodash/_hashDelete.js","webpack://Stigg/./node_modules/lodash/_hashGet.js","webpack://Stigg/./node_modules/lodash/_hashHas.js","webpack://Stigg/./node_modules/lodash/_hashSet.js","webpack://Stigg/./node_modules/lodash/_initCloneObject.js","webpack://Stigg/./node_modules/lodash/_isFlattenable.js","webpack://Stigg/./node_modules/lodash/_isIndex.js","webpack://Stigg/./node_modules/lodash/_isIterateeCall.js","webpack://Stigg/./node_modules/lodash/_isKey.js","webpack://Stigg/./node_modules/lodash/_isKeyable.js","webpack://Stigg/./node_modules/lodash/_isMasked.js","webpack://Stigg/./node_modules/lodash/_isPrototype.js","webpack://Stigg/./node_modules/lodash/_isStrictComparable.js","webpack://Stigg/./node_modules/lodash/_listCacheClear.js","webpack://Stigg/./node_modules/lodash/_listCacheDelete.js","webpack://Stigg/./node_modules/lodash/_listCacheGet.js","webpack://Stigg/./node_modules/lodash/_listCacheHas.js","webpack://Stigg/./node_modules/lodash/_listCacheSet.js","webpack://Stigg/./node_modules/lodash/_mapCacheClear.js","webpack://Stigg/./node_modules/lodash/_mapCacheDelete.js","webpack://Stigg/./node_modules/lodash/_mapCacheGet.js","webpack://Stigg/./node_modules/lodash/_mapCacheHas.js","webpack://Stigg/./node_modules/lodash/_mapCacheSet.js","webpack://Stigg/./node_modules/lodash/_mapToArray.js","webpack://Stigg/./node_modules/lodash/_matchesStrictComparable.js","webpack://Stigg/./node_modules/lodash/_memoizeCapped.js","webpack://Stigg/./node_modules/lodash/_nativeCreate.js","webpack://Stigg/./node_modules/lodash/_nativeKeys.js","webpack://Stigg/./node_modules/lodash/_nativeKeysIn.js","webpack://Stigg/./node_modules/lodash/_nodeUtil.js","webpack://Stigg/./node_modules/lodash/_objectToString.js","webpack://Stigg/./node_modules/lodash/_overArg.js","webpack://Stigg/./node_modules/lodash/_overRest.js","webpack://Stigg/./node_modules/lodash/_root.js","webpack://Stigg/./node_modules/lodash/_safeGet.js","webpack://Stigg/./node_modules/lodash/_setCacheAdd.js","webpack://Stigg/./node_modules/lodash/_setCacheHas.js","webpack://Stigg/./node_modules/lodash/_setToArray.js","webpack://Stigg/./node_modules/lodash/_setToString.js","webpack://Stigg/./node_modules/lodash/_shortOut.js","webpack://Stigg/./node_modules/lodash/_stackClear.js","webpack://Stigg/./node_modules/lodash/_stackDelete.js","webpack://Stigg/./node_modules/lodash/_stackGet.js","webpack://Stigg/./node_modules/lodash/_stackHas.js","webpack://Stigg/./node_modules/lodash/_stackSet.js","webpack://Stigg/./node_modules/lodash/_stringToPath.js","webpack://Stigg/./node_modules/lodash/_toKey.js","webpack://Stigg/./node_modules/lodash/_toSource.js","webpack://Stigg/./node_modules/lodash/constant.js","webpack://Stigg/./node_modules/lodash/eq.js","webpack://Stigg/./node_modules/lodash/get.js","webpack://Stigg/./node_modules/lodash/hasIn.js","webpack://Stigg/./node_modules/lodash/identity.js","webpack://Stigg/./node_modules/lodash/isArguments.js","webpack://Stigg/./node_modules/lodash/isArray.js","webpack://Stigg/./node_modules/lodash/isArrayLike.js","webpack://Stigg/./node_modules/lodash/isArrayLikeObject.js","webpack://Stigg/./node_modules/lodash/isBuffer.js","webpack://Stigg/./node_modules/lodash/isEmpty.js","webpack://Stigg/./node_modules/lodash/isFunction.js","webpack://Stigg/./node_modules/lodash/isLength.js","webpack://Stigg/./node_modules/lodash/isObject.js","webpack://Stigg/./node_modules/lodash/isObjectLike.js","webpack://Stigg/./node_modules/lodash/isPlainObject.js","webpack://Stigg/./node_modules/lodash/isSymbol.js","webpack://Stigg/./node_modules/lodash/isTypedArray.js","webpack://Stigg/./node_modules/lodash/keys.js","webpack://Stigg/./node_modules/lodash/keysIn.js","webpack://Stigg/./node_modules/lodash/lodash.js","webpack://Stigg/./node_modules/lodash/map.js","webpack://Stigg/./node_modules/lodash/memoize.js","webpack://Stigg/./node_modules/lodash/merge.js","webpack://Stigg/./node_modules/lodash/property.js","webpack://Stigg/./node_modules/lodash/sortBy.js","webpack://Stigg/./node_modules/lodash/stubArray.js","webpack://Stigg/./node_modules/lodash/stubFalse.js","webpack://Stigg/./node_modules/lodash/toPlainObject.js","webpack://Stigg/./node_modules/lodash/toString.js","webpack://Stigg/./src/api/generated/types.ts","webpack://Stigg/./src/models.ts","webpack://Stigg/./node_modules/tslib/tslib.es6.js","webpack://Stigg/./node_modules/graphql/jsutils/invariant.mjs","webpack://Stigg/./node_modules/graphql/language/location.mjs","webpack://Stigg/./node_modules/graphql/language/printLocation.mjs","webpack://Stigg/./node_modules/graphql/error/GraphQLError.mjs","webpack://Stigg/./node_modules/graphql/jsutils/isObjectLike.mjs","webpack://Stigg/./node_modules/graphql/error/syntaxError.mjs","webpack://Stigg/./node_modules/graphql/language/kinds.mjs","webpack://Stigg/./node_modules/graphql/language/ast.mjs","webpack://Stigg/./node_modules/graphql/language/tokenKind.mjs","webpack://Stigg/./node_modules/graphql/jsutils/inspect.mjs","webpack://Stigg/./node_modules/graphql/jsutils/devAssert.mjs","webpack://Stigg/./node_modules/graphql/language/source.mjs","webpack://Stigg/./node_modules/graphql/language/directiveLocation.mjs","webpack://Stigg/./node_modules/graphql/language/blockString.mjs","webpack://Stigg/./node_modules/graphql/language/characterClasses.mjs","webpack://Stigg/./node_modules/graphql/language/lexer.mjs","webpack://Stigg/./node_modules/graphql/language/parser.mjs","webpack://Stigg/./node_modules/graphql-tag/lib/index.js","webpack://Stigg/./src/api/fragments/priceFragment.ts","webpack://Stigg/./src/api/PaywallApi.ts","webpack://Stigg/./src/api/CustomersApi.ts","webpack://Stigg/./src/api/ApiGateway.ts","webpack://Stigg/./src/configuration.ts","webpack://Stigg/./src/utils/ModelMapper.ts","webpack://Stigg/./node_modules/ts-invariant/lib/invariant.esm.js","webpack://Stigg/./node_modules/@apollo/client/utilities/globals/maybe.js","webpack://Stigg/./node_modules/@apollo/client/utilities/globals/global.js","webpack://Stigg/./node_modules/@apollo/client/utilities/globals/DEV.js","webpack://Stigg/./node_modules/ts-invariant/process/index.js","webpack://Stigg/./node_modules/zen-observable-ts/module.js","webpack://Stigg/./node_modules/@apollo/client/utilities/globals/index.js","webpack://Stigg/./node_modules/@apollo/client/utilities/common/objects.js","webpack://Stigg/./node_modules/@apollo/client/utilities/graphql/fragments.js","webpack://Stigg/./node_modules/@apollo/client/utilities/graphql/storeUtils.js","webpack://Stigg/./node_modules/@apollo/client/utilities/graphql/getFromAST.js","webpack://Stigg/./node_modules/@apollo/client/link/core/ApolloLink.js","webpack://Stigg/./node_modules/@apollo/client/link/utils/createOperation.js","webpack://Stigg/./node_modules/@apollo/client/link/utils/transformOperation.js","webpack://Stigg/./node_modules/@apollo/client/link/utils/validateOperation.js","webpack://Stigg/./node_modules/graphql/language/visitor.mjs","webpack://Stigg/./node_modules/@apollo/client/link/http/serializeFetchParameter.js","webpack://Stigg/./node_modules/@apollo/client/link/utils/throwServerError.js","webpack://Stigg/./node_modules/@apollo/client/link/http/parseAndCheckHttpResponse.js","webpack://Stigg/./node_modules/graphql/language/printString.mjs","webpack://Stigg/./node_modules/graphql/language/printer.mjs","webpack://Stigg/./node_modules/@apollo/client/link/http/selectHttpOptionsAndBody.js","webpack://Stigg/./node_modules/@apollo/client/link/utils/fromError.js","webpack://Stigg/./node_modules/@apollo/client/link/http/createHttpLink.js","webpack://Stigg/./node_modules/@apollo/client/link/http/HttpLink.js","webpack://Stigg/./node_modules/@apollo/client/link/http/checkFetcher.js","webpack://Stigg/./node_modules/@apollo/client/link/http/selectURI.js","webpack://Stigg/./node_modules/@apollo/client/link/http/createSignalIfSupported.js","webpack://Stigg/./node_modules/@apollo/client/link/http/rewriteURIForGET.js","webpack://Stigg/./node_modules/@apollo/client/link/core/execute.js","webpack://Stigg/./node_modules/@apollo/client/utilities/common/compact.js","webpack://Stigg/./node_modules/@apollo/client/version.js","webpack://Stigg/./node_modules/@wry/equality/lib/equality.esm.js","webpack://Stigg/./node_modules/@wry/trie/lib/trie.esm.js","webpack://Stigg/./node_modules/@apollo/client/cache/inmemory/object-canon.js","webpack://Stigg/./node_modules/@apollo/client/utilities/common/canUse.js","webpack://Stigg/./node_modules/@apollo/client/utilities/observables/asyncMap.js","webpack://Stigg/./node_modules/@apollo/client/utilities/common/errorHandling.js","webpack://Stigg/./node_modules/@apollo/client/utilities/common/filterInPlace.js","webpack://Stigg/./node_modules/@apollo/client/utilities/graphql/transform.js","webpack://Stigg/./node_modules/@apollo/client/utilities/graphql/directives.js","webpack://Stigg/./node_modules/@apollo/client/utilities/common/makeUniqueId.js","webpack://Stigg/./node_modules/@apollo/client/utilities/observables/iteration.js","webpack://Stigg/./node_modules/@apollo/client/utilities/observables/subclassing.js","webpack://Stigg/./node_modules/@apollo/client/utilities/observables/Concast.js","webpack://Stigg/./node_modules/@apollo/client/utilities/common/arrays.js","webpack://Stigg/./node_modules/@apollo/client/errors/index.js","webpack://Stigg/./node_modules/@apollo/client/core/networkStatus.js","webpack://Stigg/./node_modules/@apollo/client/utilities/common/cloneDeep.js","webpack://Stigg/./node_modules/@apollo/client/core/ObservableQuery.js","webpack://Stigg/./node_modules/@apollo/client/utilities/common/mergeDeep.js","webpack://Stigg/./node_modules/@wry/context/lib/context.esm.js","webpack://Stigg/./node_modules/optimism/lib/bundle.esm.js","webpack://Stigg/./node_modules/@apollo/client/cache/inmemory/reactiveVars.js","webpack://Stigg/./node_modules/@apollo/client/core/LocalState.js","webpack://Stigg/./node_modules/@apollo/client/core/QueryInfo.js","webpack://Stigg/./node_modules/@apollo/client/core/QueryManager.js","webpack://Stigg/./node_modules/@apollo/client/core/ApolloClient.js","webpack://Stigg/./node_modules/@apollo/client/cache/core/cache.js","webpack://Stigg/./node_modules/@apollo/client/cache/core/types/common.js","webpack://Stigg/./node_modules/@apollo/client/utilities/common/maybeDeepFreeze.js","webpack://Stigg/./node_modules/@apollo/client/cache/inmemory/helpers.js","webpack://Stigg/./node_modules/@apollo/client/cache/inmemory/entityStore.js","webpack://Stigg/./node_modules/@apollo/client/cache/inmemory/readFromStore.js","webpack://Stigg/./node_modules/@apollo/client/cache/inmemory/writeToStore.js","webpack://Stigg/./node_modules/@apollo/client/utilities/common/stringifyForDisplay.js","webpack://Stigg/./node_modules/@apollo/client/cache/inmemory/policies.js","webpack://Stigg/./node_modules/@apollo/client/cache/inmemory/inMemoryCache.js","webpack://Stigg/./src/api/initApolloClient.ts","webpack://Stigg/./src/services/inMemoryCacheService.ts","webpack://Stigg/./src/api/EntitlementsApi.ts","webpack://Stigg/./src/services/entitlementDecisionService.ts","webpack://Stigg/./src/services/entitlementsService.ts","webpack://Stigg/./src/client.ts","webpack://Stigg/webpack/bootstrap","webpack://Stigg/webpack/runtime/compat get default export","webpack://Stigg/webpack/runtime/define property getters","webpack://Stigg/webpack/runtime/global","webpack://Stigg/webpack/runtime/hasOwnProperty shorthand","webpack://Stigg/webpack/runtime/make namespace object","webpack://Stigg/webpack/runtime/node module decorator","webpack://Stigg/webpack/startup"],"sourcesContent":["(function webpackUniversalModuleDefinition(root, factory) {\n\tif(typeof exports === 'object' && typeof module === 'object')\n\t\tmodule.exports = factory();\n\telse if(typeof define === 'function' && define.amd)\n\t\tdefine(\"Stigg\", [], factory);\n\telse if(typeof exports === 'object')\n\t\texports[\"Stigg\"] = factory();\n\telse\n\t\troot[\"Stigg\"] = factory();\n})(self, function() {\nreturn ","var global = typeof self !== 'undefined' ? self : this;\nvar __self__ = (function () {\nfunction F() {\nthis.fetch = false;\nthis.DOMException = global.DOMException\n}\nF.prototype = global;\nreturn new F();\n})();\n(function(self) {\n\nvar irrelevant = (function (exports) {\n\n  var support = {\n    searchParams: 'URLSearchParams' in self,\n    iterable: 'Symbol' in self && 'iterator' in Symbol,\n    blob:\n      'FileReader' in self &&\n      'Blob' in self &&\n      (function() {\n        try {\n          new Blob();\n          return true\n        } catch (e) {\n          return false\n        }\n      })(),\n    formData: 'FormData' in self,\n    arrayBuffer: 'ArrayBuffer' in self\n  };\n\n  function isDataView(obj) {\n    return obj && DataView.prototype.isPrototypeOf(obj)\n  }\n\n  if (support.arrayBuffer) {\n    var viewClasses = [\n      '[object Int8Array]',\n      '[object Uint8Array]',\n      '[object Uint8ClampedArray]',\n      '[object Int16Array]',\n      '[object Uint16Array]',\n      '[object Int32Array]',\n      '[object Uint32Array]',\n      '[object Float32Array]',\n      '[object Float64Array]'\n    ];\n\n    var isArrayBufferView =\n      ArrayBuffer.isView ||\n      function(obj) {\n        return obj && viewClasses.indexOf(Object.prototype.toString.call(obj)) > -1\n      };\n  }\n\n  function normalizeName(name) {\n    if (typeof name !== 'string') {\n      name = String(name);\n    }\n    if (/[^a-z0-9\\-#$%&'*+.^_`|~]/i.test(name)) {\n      throw new TypeError('Invalid character in header field name')\n    }\n    return name.toLowerCase()\n  }\n\n  function normalizeValue(value) {\n    if (typeof value !== 'string') {\n      value = String(value);\n    }\n    return value\n  }\n\n  // Build a destructive iterator for the value list\n  function iteratorFor(items) {\n    var iterator = {\n      next: function() {\n        var value = items.shift();\n        return {done: value === undefined, value: value}\n      }\n    };\n\n    if (support.iterable) {\n      iterator[Symbol.iterator] = function() {\n        return iterator\n      };\n    }\n\n    return iterator\n  }\n\n  function Headers(headers) {\n    this.map = {};\n\n    if (headers instanceof Headers) {\n      headers.forEach(function(value, name) {\n        this.append(name, value);\n      }, this);\n    } else if (Array.isArray(headers)) {\n      headers.forEach(function(header) {\n        this.append(header[0], header[1]);\n      }, this);\n    } else if (headers) {\n      Object.getOwnPropertyNames(headers).forEach(function(name) {\n        this.append(name, headers[name]);\n      }, this);\n    }\n  }\n\n  Headers.prototype.append = function(name, value) {\n    name = normalizeName(name);\n    value = normalizeValue(value);\n    var oldValue = this.map[name];\n    this.map[name] = oldValue ? oldValue + ', ' + value : value;\n  };\n\n  Headers.prototype['delete'] = function(name) {\n    delete this.map[normalizeName(name)];\n  };\n\n  Headers.prototype.get = function(name) {\n    name = normalizeName(name);\n    return this.has(name) ? this.map[name] : null\n  };\n\n  Headers.prototype.has = function(name) {\n    return this.map.hasOwnProperty(normalizeName(name))\n  };\n\n  Headers.prototype.set = function(name, value) {\n    this.map[normalizeName(name)] = normalizeValue(value);\n  };\n\n  Headers.prototype.forEach = function(callback, thisArg) {\n    for (var name in this.map) {\n      if (this.map.hasOwnProperty(name)) {\n        callback.call(thisArg, this.map[name], name, this);\n      }\n    }\n  };\n\n  Headers.prototype.keys = function() {\n    var items = [];\n    this.forEach(function(value, name) {\n      items.push(name);\n    });\n    return iteratorFor(items)\n  };\n\n  Headers.prototype.values = function() {\n    var items = [];\n    this.forEach(function(value) {\n      items.push(value);\n    });\n    return iteratorFor(items)\n  };\n\n  Headers.prototype.entries = function() {\n    var items = [];\n    this.forEach(function(value, name) {\n      items.push([name, value]);\n    });\n    return iteratorFor(items)\n  };\n\n  if (support.iterable) {\n    Headers.prototype[Symbol.iterator] = Headers.prototype.entries;\n  }\n\n  function consumed(body) {\n    if (body.bodyUsed) {\n      return Promise.reject(new TypeError('Already read'))\n    }\n    body.bodyUsed = true;\n  }\n\n  function fileReaderReady(reader) {\n    return new Promise(function(resolve, reject) {\n      reader.onload = function() {\n        resolve(reader.result);\n      };\n      reader.onerror = function() {\n        reject(reader.error);\n      };\n    })\n  }\n\n  function readBlobAsArrayBuffer(blob) {\n    var reader = new FileReader();\n    var promise = fileReaderReady(reader);\n    reader.readAsArrayBuffer(blob);\n    return promise\n  }\n\n  function readBlobAsText(blob) {\n    var reader = new FileReader();\n    var promise = fileReaderReady(reader);\n    reader.readAsText(blob);\n    return promise\n  }\n\n  function readArrayBufferAsText(buf) {\n    var view = new Uint8Array(buf);\n    var chars = new Array(view.length);\n\n    for (var i = 0; i < view.length; i++) {\n      chars[i] = String.fromCharCode(view[i]);\n    }\n    return chars.join('')\n  }\n\n  function bufferClone(buf) {\n    if (buf.slice) {\n      return buf.slice(0)\n    } else {\n      var view = new Uint8Array(buf.byteLength);\n      view.set(new Uint8Array(buf));\n      return view.buffer\n    }\n  }\n\n  function Body() {\n    this.bodyUsed = false;\n\n    this._initBody = function(body) {\n      this._bodyInit = body;\n      if (!body) {\n        this._bodyText = '';\n      } else if (typeof body === 'string') {\n        this._bodyText = body;\n      } else if (support.blob && Blob.prototype.isPrototypeOf(body)) {\n        this._bodyBlob = body;\n      } else if (support.formData && FormData.prototype.isPrototypeOf(body)) {\n        this._bodyFormData = body;\n      } else if (support.searchParams && URLSearchParams.prototype.isPrototypeOf(body)) {\n        this._bodyText = body.toString();\n      } else if (support.arrayBuffer && support.blob && isDataView(body)) {\n        this._bodyArrayBuffer = bufferClone(body.buffer);\n        // IE 10-11 can't handle a DataView body.\n        this._bodyInit = new Blob([this._bodyArrayBuffer]);\n      } else if (support.arrayBuffer && (ArrayBuffer.prototype.isPrototypeOf(body) || isArrayBufferView(body))) {\n        this._bodyArrayBuffer = bufferClone(body);\n      } else {\n        this._bodyText = body = Object.prototype.toString.call(body);\n      }\n\n      if (!this.headers.get('content-type')) {\n        if (typeof body === 'string') {\n          this.headers.set('content-type', 'text/plain;charset=UTF-8');\n        } else if (this._bodyBlob && this._bodyBlob.type) {\n          this.headers.set('content-type', this._bodyBlob.type);\n        } else if (support.searchParams && URLSearchParams.prototype.isPrototypeOf(body)) {\n          this.headers.set('content-type', 'application/x-www-form-urlencoded;charset=UTF-8');\n        }\n      }\n    };\n\n    if (support.blob) {\n      this.blob = function() {\n        var rejected = consumed(this);\n        if (rejected) {\n          return rejected\n        }\n\n        if (this._bodyBlob) {\n          return Promise.resolve(this._bodyBlob)\n        } else if (this._bodyArrayBuffer) {\n          return Promise.resolve(new Blob([this._bodyArrayBuffer]))\n        } else if (this._bodyFormData) {\n          throw new Error('could not read FormData body as blob')\n        } else {\n          return Promise.resolve(new Blob([this._bodyText]))\n        }\n      };\n\n      this.arrayBuffer = function() {\n        if (this._bodyArrayBuffer) {\n          return consumed(this) || Promise.resolve(this._bodyArrayBuffer)\n        } else {\n          return this.blob().then(readBlobAsArrayBuffer)\n        }\n      };\n    }\n\n    this.text = function() {\n      var rejected = consumed(this);\n      if (rejected) {\n        return rejected\n      }\n\n      if (this._bodyBlob) {\n        return readBlobAsText(this._bodyBlob)\n      } else if (this._bodyArrayBuffer) {\n        return Promise.resolve(readArrayBufferAsText(this._bodyArrayBuffer))\n      } else if (this._bodyFormData) {\n        throw new Error('could not read FormData body as text')\n      } else {\n        return Promise.resolve(this._bodyText)\n      }\n    };\n\n    if (support.formData) {\n      this.formData = function() {\n        return this.text().then(decode)\n      };\n    }\n\n    this.json = function() {\n      return this.text().then(JSON.parse)\n    };\n\n    return this\n  }\n\n  // HTTP methods whose capitalization should be normalized\n  var methods = ['DELETE', 'GET', 'HEAD', 'OPTIONS', 'POST', 'PUT'];\n\n  function normalizeMethod(method) {\n    var upcased = method.toUpperCase();\n    return methods.indexOf(upcased) > -1 ? upcased : method\n  }\n\n  function Request(input, options) {\n    options = options || {};\n    var body = options.body;\n\n    if (input instanceof Request) {\n      if (input.bodyUsed) {\n        throw new TypeError('Already read')\n      }\n      this.url = input.url;\n      this.credentials = input.credentials;\n      if (!options.headers) {\n        this.headers = new Headers(input.headers);\n      }\n      this.method = input.method;\n      this.mode = input.mode;\n      this.signal = input.signal;\n      if (!body && input._bodyInit != null) {\n        body = input._bodyInit;\n        input.bodyUsed = true;\n      }\n    } else {\n      this.url = String(input);\n    }\n\n    this.credentials = options.credentials || this.credentials || 'same-origin';\n    if (options.headers || !this.headers) {\n      this.headers = new Headers(options.headers);\n    }\n    this.method = normalizeMethod(options.method || this.method || 'GET');\n    this.mode = options.mode || this.mode || null;\n    this.signal = options.signal || this.signal;\n    this.referrer = null;\n\n    if ((this.method === 'GET' || this.method === 'HEAD') && body) {\n      throw new TypeError('Body not allowed for GET or HEAD requests')\n    }\n    this._initBody(body);\n  }\n\n  Request.prototype.clone = function() {\n    return new Request(this, {body: this._bodyInit})\n  };\n\n  function decode(body) {\n    var form = new FormData();\n    body\n      .trim()\n      .split('&')\n      .forEach(function(bytes) {\n        if (bytes) {\n          var split = bytes.split('=');\n          var name = split.shift().replace(/\\+/g, ' ');\n          var value = split.join('=').replace(/\\+/g, ' ');\n          form.append(decodeURIComponent(name), decodeURIComponent(value));\n        }\n      });\n    return form\n  }\n\n  function parseHeaders(rawHeaders) {\n    var headers = new Headers();\n    // Replace instances of \\r\\n and \\n followed by at least one space or horizontal tab with a space\n    // https://tools.ietf.org/html/rfc7230#section-3.2\n    var preProcessedHeaders = rawHeaders.replace(/\\r?\\n[\\t ]+/g, ' ');\n    preProcessedHeaders.split(/\\r?\\n/).forEach(function(line) {\n      var parts = line.split(':');\n      var key = parts.shift().trim();\n      if (key) {\n        var value = parts.join(':').trim();\n        headers.append(key, value);\n      }\n    });\n    return headers\n  }\n\n  Body.call(Request.prototype);\n\n  function Response(bodyInit, options) {\n    if (!options) {\n      options = {};\n    }\n\n    this.type = 'default';\n    this.status = options.status === undefined ? 200 : options.status;\n    this.ok = this.status >= 200 && this.status < 300;\n    this.statusText = 'statusText' in options ? options.statusText : 'OK';\n    this.headers = new Headers(options.headers);\n    this.url = options.url || '';\n    this._initBody(bodyInit);\n  }\n\n  Body.call(Response.prototype);\n\n  Response.prototype.clone = function() {\n    return new Response(this._bodyInit, {\n      status: this.status,\n      statusText: this.statusText,\n      headers: new Headers(this.headers),\n      url: this.url\n    })\n  };\n\n  Response.error = function() {\n    var response = new Response(null, {status: 0, statusText: ''});\n    response.type = 'error';\n    return response\n  };\n\n  var redirectStatuses = [301, 302, 303, 307, 308];\n\n  Response.redirect = function(url, status) {\n    if (redirectStatuses.indexOf(status) === -1) {\n      throw new RangeError('Invalid status code')\n    }\n\n    return new Response(null, {status: status, headers: {location: url}})\n  };\n\n  exports.DOMException = self.DOMException;\n  try {\n    new exports.DOMException();\n  } catch (err) {\n    exports.DOMException = function(message, name) {\n      this.message = message;\n      this.name = name;\n      var error = Error(message);\n      this.stack = error.stack;\n    };\n    exports.DOMException.prototype = Object.create(Error.prototype);\n    exports.DOMException.prototype.constructor = exports.DOMException;\n  }\n\n  function fetch(input, init) {\n    return new Promise(function(resolve, reject) {\n      var request = new Request(input, init);\n\n      if (request.signal && request.signal.aborted) {\n        return reject(new exports.DOMException('Aborted', 'AbortError'))\n      }\n\n      var xhr = new XMLHttpRequest();\n\n      function abortXhr() {\n        xhr.abort();\n      }\n\n      xhr.onload = function() {\n        var options = {\n          status: xhr.status,\n          statusText: xhr.statusText,\n          headers: parseHeaders(xhr.getAllResponseHeaders() || '')\n        };\n        options.url = 'responseURL' in xhr ? xhr.responseURL : options.headers.get('X-Request-URL');\n        var body = 'response' in xhr ? xhr.response : xhr.responseText;\n        resolve(new Response(body, options));\n      };\n\n      xhr.onerror = function() {\n        reject(new TypeError('Network request failed'));\n      };\n\n      xhr.ontimeout = function() {\n        reject(new TypeError('Network request failed'));\n      };\n\n      xhr.onabort = function() {\n        reject(new exports.DOMException('Aborted', 'AbortError'));\n      };\n\n      xhr.open(request.method, request.url, true);\n\n      if (request.credentials === 'include') {\n        xhr.withCredentials = true;\n      } else if (request.credentials === 'omit') {\n        xhr.withCredentials = false;\n      }\n\n      if ('responseType' in xhr && support.blob) {\n        xhr.responseType = 'blob';\n      }\n\n      request.headers.forEach(function(value, name) {\n        xhr.setRequestHeader(name, value);\n      });\n\n      if (request.signal) {\n        request.signal.addEventListener('abort', abortXhr);\n\n        xhr.onreadystatechange = function() {\n          // DONE (success or failure)\n          if (xhr.readyState === 4) {\n            request.signal.removeEventListener('abort', abortXhr);\n          }\n        };\n      }\n\n      xhr.send(typeof request._bodyInit === 'undefined' ? null : request._bodyInit);\n    })\n  }\n\n  fetch.polyfill = true;\n\n  if (!self.fetch) {\n    self.fetch = fetch;\n    self.Headers = Headers;\n    self.Request = Request;\n    self.Response = Response;\n  }\n\n  exports.Headers = Headers;\n  exports.Request = Request;\n  exports.Response = Response;\n  exports.fetch = fetch;\n\n  Object.defineProperty(exports, '__esModule', { value: true });\n\n  return exports;\n\n}({}));\n})(__self__);\n__self__.fetch.ponyfill = true;\n// Remove \"polyfill\" property added by whatwg-fetch\ndelete __self__.fetch.polyfill;\n// Choose between native implementation (global) or custom implementation (__self__)\n// var ctx = global.fetch ? global : __self__;\nvar ctx = __self__; // this line disable service worker support temporarily\nexports = ctx.fetch // To enable: import fetch from 'cross-fetch'\nexports.default = ctx.fetch // For TypeScript consumers without esModuleInterop.\nexports.fetch = ctx.fetch // To enable: import {fetch} from 'cross-fetch'\nexports.Headers = ctx.Headers\nexports.Request = ctx.Request\nexports.Response = ctx.Response\nmodule.exports = exports\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 Symbol = root.Symbol;\n\nmodule.exports = Symbol;\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 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/**\n * This function is like `assignValue` except that it doesn't assign\n * `undefined` values.\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 assignMergeValue(object, key, value) {\n  if ((value !== undefined && !eq(object[key], value)) ||\n      (value === undefined && !(key in object))) {\n    baseAssignValue(object, key, value);\n  }\n}\n\nmodule.exports = assignMergeValue;\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 isObject = require('./isObject');\n\n/** Built-in value references. */\nvar objectCreate = Object.create;\n\n/**\n * The base implementation of `_.create` without support for assigning\n * properties to the created object.\n *\n * @private\n * @param {Object} proto The object to inherit from.\n * @returns {Object} Returns the new object.\n */\nvar baseCreate = (function() {\n  function object() {}\n  return function(proto) {\n    if (!isObject(proto)) {\n      return {};\n    }\n    if (objectCreate) {\n      return objectCreate(proto);\n    }\n    object.prototype = proto;\n    var result = new object;\n    object.prototype = undefined;\n    return result;\n  };\n}());\n\nmodule.exports = baseCreate;\n","var baseForOwn = require('./_baseForOwn'),\n    createBaseEach = require('./_createBaseEach');\n\n/**\n * The base implementation of `_.forEach` without support for iteratee shorthands.\n *\n * @private\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Array|Object} Returns `collection`.\n */\nvar baseEach = createBaseEach(baseForOwn);\n\nmodule.exports = baseEach;\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 createBaseFor = require('./_createBaseFor');\n\n/**\n * The base implementation of `baseForOwn` which iterates over `object`\n * properties returned by `keysFunc` and invokes `iteratee` for each property.\n * Iteratee functions may exit iteration early by explicitly returning `false`.\n *\n * @private\n * @param {Object} object The object to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @param {Function} keysFunc The function to get the keys of `object`.\n * @returns {Object} Returns `object`.\n */\nvar baseFor = createBaseFor();\n\nmodule.exports = baseFor;\n","var baseFor = require('./_baseFor'),\n    keys = require('./keys');\n\n/**\n * The base implementation of `_.forOwn` without support for iteratee shorthands.\n *\n * @private\n * @param {Object} object The object to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Object} Returns `object`.\n */\nfunction baseForOwn(object, iteratee) {\n  return object && baseFor(object, iteratee, keys);\n}\n\nmodule.exports = baseForOwn;\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","var Symbol = require('./_Symbol'),\n    getRawTag = require('./_getRawTag'),\n    objectToString = require('./_objectToString');\n\n/** `Object#toString` result references. */\nvar nullTag = '[object Null]',\n    undefinedTag = '[object Undefined]';\n\n/** Built-in value references. */\nvar symToStringTag = Symbol ? Symbol.toStringTag : undefined;\n\n/**\n * The base implementation of `getTag` without fallbacks for buggy environments.\n *\n * @private\n * @param {*} value The value to query.\n * @returns {string} Returns the `toStringTag`.\n */\nfunction baseGetTag(value) {\n  if (value == null) {\n    return value === undefined ? undefinedTag : nullTag;\n  }\n  return (symToStringTag && symToStringTag in Object(value))\n    ? getRawTag(value)\n    : objectToString(value);\n}\n\nmodule.exports = baseGetTag;\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 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","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 isObject = require('./isObject'),\n    isPrototype = require('./_isPrototype'),\n    nativeKeysIn = require('./_nativeKeysIn');\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 `_.keysIn` 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 baseKeysIn(object) {\n  if (!isObject(object)) {\n    return nativeKeysIn(object);\n  }\n  var isProto = isPrototype(object),\n      result = [];\n\n  for (var key in object) {\n    if (!(key == 'constructor' && (isProto || !hasOwnProperty.call(object, key)))) {\n      result.push(key);\n    }\n  }\n  return result;\n}\n\nmodule.exports = baseKeysIn;\n","var baseEach = require('./_baseEach'),\n    isArrayLike = require('./isArrayLike');\n\n/**\n * The base implementation of `_.map` without support for iteratee shorthands.\n *\n * @private\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Array} Returns the new mapped array.\n */\nfunction baseMap(collection, iteratee) {\n  var index = -1,\n      result = isArrayLike(collection) ? Array(collection.length) : [];\n\n  baseEach(collection, function(value, key, collection) {\n    result[++index] = iteratee(value, key, collection);\n  });\n  return result;\n}\n\nmodule.exports = baseMap;\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 Stack = require('./_Stack'),\n    assignMergeValue = require('./_assignMergeValue'),\n    baseFor = require('./_baseFor'),\n    baseMergeDeep = require('./_baseMergeDeep'),\n    isObject = require('./isObject'),\n    keysIn = require('./keysIn'),\n    safeGet = require('./_safeGet');\n\n/**\n * The base implementation of `_.merge` without support for multiple sources.\n *\n * @private\n * @param {Object} object The destination object.\n * @param {Object} source The source object.\n * @param {number} srcIndex The index of `source`.\n * @param {Function} [customizer] The function to customize merged values.\n * @param {Object} [stack] Tracks traversed source values and their merged\n *  counterparts.\n */\nfunction baseMerge(object, source, srcIndex, customizer, stack) {\n  if (object === source) {\n    return;\n  }\n  baseFor(source, function(srcValue, key) {\n    stack || (stack = new Stack);\n    if (isObject(srcValue)) {\n      baseMergeDeep(object, source, key, srcIndex, baseMerge, customizer, stack);\n    }\n    else {\n      var newValue = customizer\n        ? customizer(safeGet(object, key), srcValue, (key + ''), object, source, stack)\n        : undefined;\n\n      if (newValue === undefined) {\n        newValue = srcValue;\n      }\n      assignMergeValue(object, key, newValue);\n    }\n  }, keysIn);\n}\n\nmodule.exports = baseMerge;\n","var assignMergeValue = require('./_assignMergeValue'),\n    cloneBuffer = require('./_cloneBuffer'),\n    cloneTypedArray = require('./_cloneTypedArray'),\n    copyArray = require('./_copyArray'),\n    initCloneObject = require('./_initCloneObject'),\n    isArguments = require('./isArguments'),\n    isArray = require('./isArray'),\n    isArrayLikeObject = require('./isArrayLikeObject'),\n    isBuffer = require('./isBuffer'),\n    isFunction = require('./isFunction'),\n    isObject = require('./isObject'),\n    isPlainObject = require('./isPlainObject'),\n    isTypedArray = require('./isTypedArray'),\n    safeGet = require('./_safeGet'),\n    toPlainObject = require('./toPlainObject');\n\n/**\n * A specialized version of `baseMerge` for arrays and objects which performs\n * deep merges and tracks traversed objects enabling objects with circular\n * references to be merged.\n *\n * @private\n * @param {Object} object The destination object.\n * @param {Object} source The source object.\n * @param {string} key The key of the value to merge.\n * @param {number} srcIndex The index of `source`.\n * @param {Function} mergeFunc The function to merge values.\n * @param {Function} [customizer] The function to customize assigned values.\n * @param {Object} [stack] Tracks traversed source values and their merged\n *  counterparts.\n */\nfunction baseMergeDeep(object, source, key, srcIndex, mergeFunc, customizer, stack) {\n  var objValue = safeGet(object, key),\n      srcValue = safeGet(source, key),\n      stacked = stack.get(srcValue);\n\n  if (stacked) {\n    assignMergeValue(object, key, stacked);\n    return;\n  }\n  var newValue = customizer\n    ? customizer(objValue, srcValue, (key + ''), object, source, stack)\n    : undefined;\n\n  var isCommon = newValue === undefined;\n\n  if (isCommon) {\n    var isArr = isArray(srcValue),\n        isBuff = !isArr && isBuffer(srcValue),\n        isTyped = !isArr && !isBuff && isTypedArray(srcValue);\n\n    newValue = srcValue;\n    if (isArr || isBuff || isTyped) {\n      if (isArray(objValue)) {\n        newValue = objValue;\n      }\n      else if (isArrayLikeObject(objValue)) {\n        newValue = copyArray(objValue);\n      }\n      else if (isBuff) {\n        isCommon = false;\n        newValue = cloneBuffer(srcValue, true);\n      }\n      else if (isTyped) {\n        isCommon = false;\n        newValue = cloneTypedArray(srcValue, true);\n      }\n      else {\n        newValue = [];\n      }\n    }\n    else if (isPlainObject(srcValue) || isArguments(srcValue)) {\n      newValue = objValue;\n      if (isArguments(objValue)) {\n        newValue = toPlainObject(objValue);\n      }\n      else if (!isObject(objValue) || isFunction(objValue)) {\n        newValue = initCloneObject(srcValue);\n      }\n    }\n    else {\n      isCommon = false;\n    }\n  }\n  if (isCommon) {\n    // Recursively merge objects and arrays (susceptible to call stack limits).\n    stack.set(srcValue, newValue);\n    mergeFunc(newValue, srcValue, srcIndex, customizer, stack);\n    stack['delete'](srcValue);\n  }\n  assignMergeValue(object, key, newValue);\n}\n\nmodule.exports = baseMergeDeep;\n","var arrayMap = require('./_arrayMap'),\n    baseGet = require('./_baseGet'),\n    baseIteratee = require('./_baseIteratee'),\n    baseMap = require('./_baseMap'),\n    baseSortBy = require('./_baseSortBy'),\n    baseUnary = require('./_baseUnary'),\n    compareMultiple = require('./_compareMultiple'),\n    identity = require('./identity'),\n    isArray = require('./isArray');\n\n/**\n * The base implementation of `_.orderBy` without param guards.\n *\n * @private\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function[]|Object[]|string[]} iteratees The iteratees to sort by.\n * @param {string[]} orders The sort orders of `iteratees`.\n * @returns {Array} Returns the new sorted array.\n */\nfunction baseOrderBy(collection, iteratees, orders) {\n  if (iteratees.length) {\n    iteratees = arrayMap(iteratees, function(iteratee) {\n      if (isArray(iteratee)) {\n        return function(value) {\n          return baseGet(value, iteratee.length === 1 ? iteratee[0] : iteratee);\n        }\n      }\n      return iteratee;\n    });\n  } else {\n    iteratees = [identity];\n  }\n\n  var index = -1;\n  iteratees = arrayMap(iteratees, baseUnary(baseIteratee));\n\n  var result = baseMap(collection, function(value, key, collection) {\n    var criteria = arrayMap(iteratees, function(iteratee) {\n      return iteratee(value);\n    });\n    return { 'criteria': criteria, 'index': ++index, 'value': value };\n  });\n\n  return baseSortBy(result, function(object, other) {\n    return compareMultiple(object, other, orders);\n  });\n}\n\nmodule.exports = baseOrderBy;\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 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 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 `_.sortBy` which uses `comparer` to define the\n * sort order of `array` and replaces criteria objects with their corresponding\n * values.\n *\n * @private\n * @param {Array} array The array to sort.\n * @param {Function} comparer The function to define sort order.\n * @returns {Array} Returns `array`.\n */\nfunction baseSortBy(array, comparer) {\n  var length = array.length;\n\n  array.sort(comparer);\n  while (length--) {\n    array[length] = array[length].value;\n  }\n  return array;\n}\n\nmodule.exports = baseSortBy;\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","/**\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","/**\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 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 Uint8Array = require('./_Uint8Array');\n\n/**\n * Creates a clone of `arrayBuffer`.\n *\n * @private\n * @param {ArrayBuffer} arrayBuffer The array buffer to clone.\n * @returns {ArrayBuffer} Returns the cloned array buffer.\n */\nfunction cloneArrayBuffer(arrayBuffer) {\n  var result = new arrayBuffer.constructor(arrayBuffer.byteLength);\n  new Uint8Array(result).set(new Uint8Array(arrayBuffer));\n  return result;\n}\n\nmodule.exports = cloneArrayBuffer;\n","var root = require('./_root');\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    allocUnsafe = Buffer ? Buffer.allocUnsafe : undefined;\n\n/**\n * Creates a clone of  `buffer`.\n *\n * @private\n * @param {Buffer} buffer The buffer to clone.\n * @param {boolean} [isDeep] Specify a deep clone.\n * @returns {Buffer} Returns the cloned buffer.\n */\nfunction cloneBuffer(buffer, isDeep) {\n  if (isDeep) {\n    return buffer.slice();\n  }\n  var length = buffer.length,\n      result = allocUnsafe ? allocUnsafe(length) : new buffer.constructor(length);\n\n  buffer.copy(result);\n  return result;\n}\n\nmodule.exports = cloneBuffer;\n","var cloneArrayBuffer = require('./_cloneArrayBuffer');\n\n/**\n * Creates a clone of `typedArray`.\n *\n * @private\n * @param {Object} typedArray The typed array to clone.\n * @param {boolean} [isDeep] Specify a deep clone.\n * @returns {Object} Returns the cloned typed array.\n */\nfunction cloneTypedArray(typedArray, isDeep) {\n  var buffer = isDeep ? cloneArrayBuffer(typedArray.buffer) : typedArray.buffer;\n  return new typedArray.constructor(buffer, typedArray.byteOffset, typedArray.length);\n}\n\nmodule.exports = cloneTypedArray;\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","var compareAscending = require('./_compareAscending');\n\n/**\n * Used by `_.orderBy` to compare multiple properties of a value to another\n * and stable sort them.\n *\n * If `orders` is unspecified, all values are sorted in ascending order. Otherwise,\n * specify an order of \"desc\" for descending or \"asc\" for ascending sort order\n * of corresponding values.\n *\n * @private\n * @param {Object} object The object to compare.\n * @param {Object} other The other object to compare.\n * @param {boolean[]|string[]} orders The order to sort by for each property.\n * @returns {number} Returns the sort order indicator for `object`.\n */\nfunction compareMultiple(object, other, orders) {\n  var index = -1,\n      objCriteria = object.criteria,\n      othCriteria = other.criteria,\n      length = objCriteria.length,\n      ordersLength = orders.length;\n\n  while (++index < length) {\n    var result = compareAscending(objCriteria[index], othCriteria[index]);\n    if (result) {\n      if (index >= ordersLength) {\n        return result;\n      }\n      var order = orders[index];\n      return result * (order == 'desc' ? -1 : 1);\n    }\n  }\n  // Fixes an `Array#sort` bug in the JS engine embedded in Adobe applications\n  // that causes it, under certain circumstances, to provide the same value for\n  // `object` and `other`. See https://github.com/jashkenas/underscore/pull/1247\n  // for more details.\n  //\n  // This also 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\nmodule.exports = compareMultiple;\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 assignValue = require('./_assignValue'),\n    baseAssignValue = require('./_baseAssignValue');\n\n/**\n * Copies properties of `source` to `object`.\n *\n * @private\n * @param {Object} source The object to copy properties from.\n * @param {Array} props The property identifiers to copy.\n * @param {Object} [object={}] The object to copy properties to.\n * @param {Function} [customizer] The function to customize copied values.\n * @returns {Object} Returns `object`.\n */\nfunction copyObject(source, props, object, customizer) {\n  var isNew = !object;\n  object || (object = {});\n\n  var index = -1,\n      length = props.length;\n\n  while (++index < length) {\n    var key = props[index];\n\n    var newValue = customizer\n      ? customizer(object[key], source[key], key, object, source)\n      : undefined;\n\n    if (newValue === undefined) {\n      newValue = source[key];\n    }\n    if (isNew) {\n      baseAssignValue(object, key, newValue);\n    } else {\n      assignValue(object, key, newValue);\n    }\n  }\n  return object;\n}\n\nmodule.exports = copyObject;\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 baseRest = require('./_baseRest'),\n    isIterateeCall = require('./_isIterateeCall');\n\n/**\n * Creates a function like `_.assign`.\n *\n * @private\n * @param {Function} assigner The function to assign values.\n * @returns {Function} Returns the new assigner function.\n */\nfunction createAssigner(assigner) {\n  return baseRest(function(object, sources) {\n    var index = -1,\n        length = sources.length,\n        customizer = length > 1 ? sources[length - 1] : undefined,\n        guard = length > 2 ? sources[2] : undefined;\n\n    customizer = (assigner.length > 3 && typeof customizer == 'function')\n      ? (length--, customizer)\n      : undefined;\n\n    if (guard && isIterateeCall(sources[0], sources[1], guard)) {\n      customizer = length < 3 ? undefined : customizer;\n      length = 1;\n    }\n    object = Object(object);\n    while (++index < length) {\n      var source = sources[index];\n      if (source) {\n        assigner(object, source, index, customizer);\n      }\n    }\n    return object;\n  });\n}\n\nmodule.exports = createAssigner;\n","var isArrayLike = require('./isArrayLike');\n\n/**\n * Creates a `baseEach` or `baseEachRight` function.\n *\n * @private\n * @param {Function} eachFunc The function to iterate over a collection.\n * @param {boolean} [fromRight] Specify iterating from right to left.\n * @returns {Function} Returns the new base function.\n */\nfunction createBaseEach(eachFunc, fromRight) {\n  return function(collection, iteratee) {\n    if (collection == null) {\n      return collection;\n    }\n    if (!isArrayLike(collection)) {\n      return eachFunc(collection, iteratee);\n    }\n    var length = collection.length,\n        index = fromRight ? length : -1,\n        iterable = Object(collection);\n\n    while ((fromRight ? index-- : ++index < length)) {\n      if (iteratee(iterable[index], index, iterable) === false) {\n        break;\n      }\n    }\n    return collection;\n  };\n}\n\nmodule.exports = createBaseEach;\n","/**\n * Creates a base function for methods like `_.forIn` and `_.forOwn`.\n *\n * @private\n * @param {boolean} [fromRight] Specify iterating from right to left.\n * @returns {Function} Returns the new base function.\n */\nfunction createBaseFor(fromRight) {\n  return function(object, iteratee, keysFunc) {\n    var index = -1,\n        iterable = Object(object),\n        props = keysFunc(object),\n        length = props.length;\n\n    while (length--) {\n      var key = props[fromRight ? length : ++index];\n      if (iteratee(iterable[key], key, iterable) === false) {\n        break;\n      }\n    }\n    return object;\n  };\n}\n\nmodule.exports = createBaseFor;\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","/** Detect free variable `global` from Node.js. */\nvar freeGlobal = typeof global == 'object' && global && global.Object === Object && global;\n\nmodule.exports = freeGlobal;\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 overArg = require('./_overArg');\n\n/** Built-in value references. */\nvar getPrototype = overArg(Object.getPrototypeOf, Object);\n\nmodule.exports = getPrototype;\n","var Symbol = require('./_Symbol');\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 * Used to resolve the\n * [`toStringTag`](http://ecma-international.org/ecma-262/7.0/#sec-object.prototype.tostring)\n * of values.\n */\nvar nativeObjectToString = objectProto.toString;\n\n/** Built-in value references. */\nvar symToStringTag = Symbol ? Symbol.toStringTag : undefined;\n\n/**\n * A specialized version of `baseGetTag` which ignores `Symbol.toStringTag` values.\n *\n * @private\n * @param {*} value The value to query.\n * @returns {string} Returns the raw `toStringTag`.\n */\nfunction getRawTag(value) {\n  var isOwn = hasOwnProperty.call(value, symToStringTag),\n      tag = value[symToStringTag];\n\n  try {\n    value[symToStringTag] = undefined;\n    var unmasked = true;\n  } catch (e) {}\n\n  var result = nativeObjectToString.call(value);\n  if (unmasked) {\n    if (isOwn) {\n      value[symToStringTag] = tag;\n    } else {\n      delete value[symToStringTag];\n    }\n  }\n  return result;\n}\n\nmodule.exports = getRawTag;\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 baseCreate = require('./_baseCreate'),\n    getPrototype = require('./_getPrototype'),\n    isPrototype = require('./_isPrototype');\n\n/**\n * Initializes an object clone.\n *\n * @private\n * @param {Object} object The object to clone.\n * @returns {Object} Returns the initialized clone.\n */\nfunction initCloneObject(object) {\n  return (typeof object.constructor == 'function' && !isPrototype(object))\n    ? baseCreate(getPrototype(object))\n    : {};\n}\n\nmodule.exports = initCloneObject;\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","/**\n * This function is like\n * [`Object.keys`](http://ecma-international.org/ecma-262/7.0/#sec-object.keys)\n * except that it includes inherited enumerable properties.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names.\n */\nfunction nativeKeysIn(object) {\n  var result = [];\n  if (object != null) {\n    for (var key in Object(object)) {\n      result.push(key);\n    }\n  }\n  return result;\n}\n\nmodule.exports = nativeKeysIn;\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","/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/**\n * Used to resolve the\n * [`toStringTag`](http://ecma-international.org/ecma-262/7.0/#sec-object.prototype.tostring)\n * of values.\n */\nvar nativeObjectToString = objectProto.toString;\n\n/**\n * Converts `value` to a string using `Object.prototype.toString`.\n *\n * @private\n * @param {*} value The value to convert.\n * @returns {string} Returns the converted string.\n */\nfunction objectToString(value) {\n  return nativeObjectToString.call(value);\n}\n\nmodule.exports = objectToString;\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 freeGlobal = require('./_freeGlobal');\n\n/** Detect free variable `self`. */\nvar freeSelf = typeof self == 'object' && self && self.Object === Object && self;\n\n/** Used as a reference to the global object. */\nvar root = freeGlobal || freeSelf || Function('return this')();\n\nmodule.exports = root;\n","/**\n * Gets the value at `key`, unless `key` is \"__proto__\" or \"constructor\".\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 safeGet(object, key) {\n  if (key === 'constructor' && typeof object[key] === 'function') {\n    return;\n  }\n\n  if (key == '__proto__') {\n    return;\n  }\n\n  return object[key];\n}\n\nmodule.exports = safeGet;\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","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","/**\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","/**\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 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 * 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 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","/**\n * Checks if `value` is classified as an `Array` 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 array, else `false`.\n * @example\n *\n * _.isArray([1, 2, 3]);\n * // => true\n *\n * _.isArray(document.body.children);\n * // => false\n *\n * _.isArray('abc');\n * // => false\n *\n * _.isArray(_.noop);\n * // => false\n */\nvar isArray = Array.isArray;\n\nmodule.exports = isArray;\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 baseKeys = require('./_baseKeys'),\n    getTag = require('./_getTag'),\n    isArguments = require('./isArguments'),\n    isArray = require('./isArray'),\n    isArrayLike = require('./isArrayLike'),\n    isBuffer = require('./isBuffer'),\n    isPrototype = require('./_isPrototype'),\n    isTypedArray = require('./isTypedArray');\n\n/** `Object#toString` result references. */\nvar mapTag = '[object Map]',\n    setTag = '[object Set]';\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 `value` is an empty object, collection, map, or set.\n *\n * Objects are considered empty if they have no own enumerable string keyed\n * properties.\n *\n * Array-like values such as `arguments` objects, arrays, buffers, strings, or\n * jQuery-like collections are considered empty if they have a `length` of `0`.\n * Similarly, maps and sets are considered empty if they have a `size` of `0`.\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 empty, else `false`.\n * @example\n *\n * _.isEmpty(null);\n * // => true\n *\n * _.isEmpty(true);\n * // => true\n *\n * _.isEmpty(1);\n * // => true\n *\n * _.isEmpty([1, 2, 3]);\n * // => false\n *\n * _.isEmpty({ 'a': 1 });\n * // => false\n */\nfunction isEmpty(value) {\n  if (value == null) {\n    return true;\n  }\n  if (isArrayLike(value) &&\n      (isArray(value) || typeof value == 'string' || typeof value.splice == 'function' ||\n        isBuffer(value) || isTypedArray(value) || isArguments(value))) {\n    return !value.length;\n  }\n  var tag = getTag(value);\n  if (tag == mapTag || tag == setTag) {\n    return !value.size;\n  }\n  if (isPrototype(value)) {\n    return !baseKeys(value).length;\n  }\n  for (var key in value) {\n    if (hasOwnProperty.call(value, key)) {\n      return false;\n    }\n  }\n  return true;\n}\n\nmodule.exports = isEmpty;\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","/**\n * Checks if `value` is object-like. A value is object-like if it's not `null`\n * and has a `typeof` result of \"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 object-like, else `false`.\n * @example\n *\n * _.isObjectLike({});\n * // => true\n *\n * _.isObjectLike([1, 2, 3]);\n * // => true\n *\n * _.isObjectLike(_.noop);\n * // => false\n *\n * _.isObjectLike(null);\n * // => false\n */\nfunction isObjectLike(value) {\n  return value != null && typeof value == 'object';\n}\n\nmodule.exports = isObjectLike;\n","var baseGetTag = require('./_baseGetTag'),\n    getPrototype = require('./_getPrototype'),\n    isObjectLike = require('./isObjectLike');\n\n/** `Object#toString` result references. */\nvar objectTag = '[object Object]';\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 infer the `Object` constructor. */\nvar objectCtorString = funcToString.call(Object);\n\n/**\n * Checks if `value` is a plain object, that is, an object created by the\n * `Object` constructor or one with a `[[Prototype]]` of `null`.\n *\n * @static\n * @memberOf _\n * @since 0.8.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a plain object, else `false`.\n * @example\n *\n * function Foo() {\n *   this.a = 1;\n * }\n *\n * _.isPlainObject(new Foo);\n * // => false\n *\n * _.isPlainObject([1, 2, 3]);\n * // => false\n *\n * _.isPlainObject({ 'x': 0, 'y': 0 });\n * // => true\n *\n * _.isPlainObject(Object.create(null));\n * // => true\n */\nfunction isPlainObject(value) {\n  if (!isObjectLike(value) || baseGetTag(value) != objectTag) {\n    return false;\n  }\n  var proto = getPrototype(value);\n  if (proto === null) {\n    return true;\n  }\n  var Ctor = hasOwnProperty.call(proto, 'constructor') && proto.constructor;\n  return typeof Ctor == 'function' && Ctor instanceof Ctor &&\n    funcToString.call(Ctor) == objectCtorString;\n}\n\nmodule.exports = isPlainObject;\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","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","var arrayLikeKeys = require('./_arrayLikeKeys'),\n    baseKeysIn = require('./_baseKeysIn'),\n    isArrayLike = require('./isArrayLike');\n\n/**\n * Creates an array of the own and inherited enumerable property names of `object`.\n *\n * **Note:** Non-object values are coerced to objects.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\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 * _.keysIn(new Foo);\n * // => ['a', 'b', 'c'] (iteration order is not guaranteed)\n */\nfunction keysIn(object) {\n  return isArrayLike(object) ? arrayLikeKeys(object, true) : baseKeysIn(object);\n}\n\nmodule.exports = keysIn;\n","/**\n * @license\n * Lodash <https://lodash.com/>\n * Copyright OpenJS Foundation and other contributors <https://openjsf.org/>\n * Released under MIT license <https://lodash.com/license>\n * Based on Underscore.js 1.8.3 <http://underscorejs.org/LICENSE>\n * Copyright Jeremy Ashkenas, DocumentCloud and Investigative Reporters & Editors\n */\n;(function() {\n\n  /** Used as a safe reference for `undefined` in pre-ES5 environments. */\n  var undefined;\n\n  /** Used as the semantic version number. */\n  var VERSION = '4.17.21';\n\n  /** Used as the size to enable large array optimizations. */\n  var LARGE_ARRAY_SIZE = 200;\n\n  /** Error message constants. */\n  var CORE_ERROR_TEXT = 'Unsupported core-js use. Try https://npms.io/search?q=ponyfill.',\n      FUNC_ERROR_TEXT = 'Expected a function',\n      INVALID_TEMPL_VAR_ERROR_TEXT = 'Invalid `variable` option passed into `_.template`';\n\n  /** Used to stand-in for `undefined` hash values. */\n  var HASH_UNDEFINED = '__lodash_hash_undefined__';\n\n  /** Used as the maximum memoize cache size. */\n  var MAX_MEMOIZE_SIZE = 500;\n\n  /** Used as the internal argument placeholder. */\n  var PLACEHOLDER = '__lodash_placeholder__';\n\n  /** Used to compose bitmasks for cloning. */\n  var CLONE_DEEP_FLAG = 1,\n      CLONE_FLAT_FLAG = 2,\n      CLONE_SYMBOLS_FLAG = 4;\n\n  /** Used to compose bitmasks for value comparisons. */\n  var COMPARE_PARTIAL_FLAG = 1,\n      COMPARE_UNORDERED_FLAG = 2;\n\n  /** Used to compose bitmasks for function metadata. */\n  var WRAP_BIND_FLAG = 1,\n      WRAP_BIND_KEY_FLAG = 2,\n      WRAP_CURRY_BOUND_FLAG = 4,\n      WRAP_CURRY_FLAG = 8,\n      WRAP_CURRY_RIGHT_FLAG = 16,\n      WRAP_PARTIAL_FLAG = 32,\n      WRAP_PARTIAL_RIGHT_FLAG = 64,\n      WRAP_ARY_FLAG = 128,\n      WRAP_REARG_FLAG = 256,\n      WRAP_FLIP_FLAG = 512;\n\n  /** Used as default options for `_.truncate`. */\n  var DEFAULT_TRUNC_LENGTH = 30,\n      DEFAULT_TRUNC_OMISSION = '...';\n\n  /** Used to detect hot functions by number of calls within a span of milliseconds. */\n  var HOT_COUNT = 800,\n      HOT_SPAN = 16;\n\n  /** Used to indicate the type of lazy iteratees. */\n  var LAZY_FILTER_FLAG = 1,\n      LAZY_MAP_FLAG = 2,\n      LAZY_WHILE_FLAG = 3;\n\n  /** Used as references for various `Number` constants. */\n  var INFINITY = 1 / 0,\n      MAX_SAFE_INTEGER = 9007199254740991,\n      MAX_INTEGER = 1.7976931348623157e+308,\n      NAN = 0 / 0;\n\n  /** Used as references for the maximum length and index of an array. */\n  var MAX_ARRAY_LENGTH = 4294967295,\n      MAX_ARRAY_INDEX = MAX_ARRAY_LENGTH - 1,\n      HALF_MAX_ARRAY_LENGTH = MAX_ARRAY_LENGTH >>> 1;\n\n  /** Used to associate wrap methods with their bit flags. */\n  var wrapFlags = [\n    ['ary', WRAP_ARY_FLAG],\n    ['bind', WRAP_BIND_FLAG],\n    ['bindKey', WRAP_BIND_KEY_FLAG],\n    ['curry', WRAP_CURRY_FLAG],\n    ['curryRight', WRAP_CURRY_RIGHT_FLAG],\n    ['flip', WRAP_FLIP_FLAG],\n    ['partial', WRAP_PARTIAL_FLAG],\n    ['partialRight', WRAP_PARTIAL_RIGHT_FLAG],\n    ['rearg', WRAP_REARG_FLAG]\n  ];\n\n  /** `Object#toString` result references. */\n  var argsTag = '[object Arguments]',\n      arrayTag = '[object Array]',\n      asyncTag = '[object AsyncFunction]',\n      boolTag = '[object Boolean]',\n      dateTag = '[object Date]',\n      domExcTag = '[object DOMException]',\n      errorTag = '[object Error]',\n      funcTag = '[object Function]',\n      genTag = '[object GeneratorFunction]',\n      mapTag = '[object Map]',\n      numberTag = '[object Number]',\n      nullTag = '[object Null]',\n      objectTag = '[object Object]',\n      promiseTag = '[object Promise]',\n      proxyTag = '[object Proxy]',\n      regexpTag = '[object RegExp]',\n      setTag = '[object Set]',\n      stringTag = '[object String]',\n      symbolTag = '[object Symbol]',\n      undefinedTag = '[object Undefined]',\n      weakMapTag = '[object WeakMap]',\n      weakSetTag = '[object WeakSet]';\n\n  var 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 match empty string literals in compiled template source. */\n  var reEmptyStringLeading = /\\b__p \\+= '';/g,\n      reEmptyStringMiddle = /\\b(__p \\+=) '' \\+/g,\n      reEmptyStringTrailing = /(__e\\(.*?\\)|\\b__t\\)) \\+\\n'';/g;\n\n  /** Used to match HTML entities and HTML characters. */\n  var reEscapedHtml = /&(?:amp|lt|gt|quot|#39);/g,\n      reUnescapedHtml = /[&<>\"']/g,\n      reHasEscapedHtml = RegExp(reEscapedHtml.source),\n      reHasUnescapedHtml = RegExp(reUnescapedHtml.source);\n\n  /** Used to match template delimiters. */\n  var reEscape = /<%-([\\s\\S]+?)%>/g,\n      reEvaluate = /<%([\\s\\S]+?)%>/g,\n      reInterpolate = /<%=([\\s\\S]+?)%>/g;\n\n  /** Used to match property names within property paths. */\n  var reIsDeepProp = /\\.|\\[(?:[^[\\]]*|([\"'])(?:(?!\\1)[^\\\\]|\\\\.)*?\\1)\\]/,\n      reIsPlainProp = /^\\w*$/,\n      rePropName = /[^.[\\]]+|\\[(?:(-?\\d+(?:\\.\\d+)?)|([\"'])((?:(?!\\2)[^\\\\]|\\\\.)*?)\\2)\\]|(?=(?:\\.|\\[\\])(?:\\.|\\[\\]|$))/g;\n\n  /**\n   * Used to match `RegExp`\n   * [syntax characters](http://ecma-international.org/ecma-262/7.0/#sec-patterns).\n   */\n  var reRegExpChar = /[\\\\^$.*+?()[\\]{}|]/g,\n      reHasRegExpChar = RegExp(reRegExpChar.source);\n\n  /** Used to match leading whitespace. */\n  var reTrimStart = /^\\s+/;\n\n  /** Used to match a single whitespace character. */\n  var reWhitespace = /\\s/;\n\n  /** Used to match wrap detail comments. */\n  var reWrapComment = /\\{(?:\\n\\/\\* \\[wrapped with .+\\] \\*\\/)?\\n?/,\n      reWrapDetails = /\\{\\n\\/\\* \\[wrapped with (.+)\\] \\*/,\n      reSplitDetails = /,? & /;\n\n  /** Used to match words composed of alphanumeric characters. */\n  var reAsciiWord = /[^\\x00-\\x2f\\x3a-\\x40\\x5b-\\x60\\x7b-\\x7f]+/g;\n\n  /**\n   * Used to validate the `validate` option in `_.template` variable.\n   *\n   * Forbids characters which could potentially change the meaning of the function argument definition:\n   * - \"(),\" (modification of function parameters)\n   * - \"=\" (default value)\n   * - \"[]{}\" (destructuring of function parameters)\n   * - \"/\" (beginning of a comment)\n   * - whitespace\n   */\n  var reForbiddenIdentifierChars = /[()=,{}\\[\\]\\/\\s]/;\n\n  /** Used to match backslashes in property paths. */\n  var reEscapeChar = /\\\\(\\\\)?/g;\n\n  /**\n   * Used to match\n   * [ES template delimiters](http://ecma-international.org/ecma-262/7.0/#sec-template-literal-lexical-components).\n   */\n  var reEsTemplate = /\\$\\{([^\\\\}]*(?:\\\\.[^\\\\}]*)*)\\}/g;\n\n  /** Used to match `RegExp` flags from their coerced string values. */\n  var reFlags = /\\w*$/;\n\n  /** Used to detect bad signed hexadecimal string values. */\n  var reIsBadHex = /^[-+]0x[0-9a-f]+$/i;\n\n  /** Used to detect binary string values. */\n  var reIsBinary = /^0b[01]+$/i;\n\n  /** Used to detect host constructors (Safari). */\n  var reIsHostCtor = /^\\[object .+?Constructor\\]$/;\n\n  /** Used to detect octal string values. */\n  var reIsOctal = /^0o[0-7]+$/i;\n\n  /** Used to detect unsigned integer values. */\n  var reIsUint = /^(?:0|[1-9]\\d*)$/;\n\n  /** Used to match Latin Unicode letters (excluding mathematical operators). */\n  var reLatin = /[\\xc0-\\xd6\\xd8-\\xf6\\xf8-\\xff\\u0100-\\u017f]/g;\n\n  /** Used to ensure capturing order of template delimiters. */\n  var reNoMatch = /($^)/;\n\n  /** Used to match unescaped characters in compiled string literals. */\n  var reUnescapedString = /['\\n\\r\\u2028\\u2029\\\\]/g;\n\n  /** Used to compose unicode character classes. */\n  var rsAstralRange = '\\\\ud800-\\\\udfff',\n      rsComboMarksRange = '\\\\u0300-\\\\u036f',\n      reComboHalfMarksRange = '\\\\ufe20-\\\\ufe2f',\n      rsComboSymbolsRange = '\\\\u20d0-\\\\u20ff',\n      rsComboRange = rsComboMarksRange + reComboHalfMarksRange + rsComboSymbolsRange,\n      rsDingbatRange = '\\\\u2700-\\\\u27bf',\n      rsLowerRange = 'a-z\\\\xdf-\\\\xf6\\\\xf8-\\\\xff',\n      rsMathOpRange = '\\\\xac\\\\xb1\\\\xd7\\\\xf7',\n      rsNonCharRange = '\\\\x00-\\\\x2f\\\\x3a-\\\\x40\\\\x5b-\\\\x60\\\\x7b-\\\\xbf',\n      rsPunctuationRange = '\\\\u2000-\\\\u206f',\n      rsSpaceRange = ' \\\\t\\\\x0b\\\\f\\\\xa0\\\\ufeff\\\\n\\\\r\\\\u2028\\\\u2029\\\\u1680\\\\u180e\\\\u2000\\\\u2001\\\\u2002\\\\u2003\\\\u2004\\\\u2005\\\\u2006\\\\u2007\\\\u2008\\\\u2009\\\\u200a\\\\u202f\\\\u205f\\\\u3000',\n      rsUpperRange = 'A-Z\\\\xc0-\\\\xd6\\\\xd8-\\\\xde',\n      rsVarRange = '\\\\ufe0e\\\\ufe0f',\n      rsBreakRange = rsMathOpRange + rsNonCharRange + rsPunctuationRange + rsSpaceRange;\n\n  /** Used to compose unicode capture groups. */\n  var rsApos = \"['\\u2019]\",\n      rsAstral = '[' + rsAstralRange + ']',\n      rsBreak = '[' + rsBreakRange + ']',\n      rsCombo = '[' + rsComboRange + ']',\n      rsDigits = '\\\\d+',\n      rsDingbat = '[' + rsDingbatRange + ']',\n      rsLower = '[' + rsLowerRange + ']',\n      rsMisc = '[^' + rsAstralRange + rsBreakRange + rsDigits + rsDingbatRange + rsLowerRange + rsUpperRange + ']',\n      rsFitz = '\\\\ud83c[\\\\udffb-\\\\udfff]',\n      rsModifier = '(?:' + rsCombo + '|' + rsFitz + ')',\n      rsNonAstral = '[^' + rsAstralRange + ']',\n      rsRegional = '(?:\\\\ud83c[\\\\udde6-\\\\uddff]){2}',\n      rsSurrPair = '[\\\\ud800-\\\\udbff][\\\\udc00-\\\\udfff]',\n      rsUpper = '[' + rsUpperRange + ']',\n      rsZWJ = '\\\\u200d';\n\n  /** Used to compose unicode regexes. */\n  var rsMiscLower = '(?:' + rsLower + '|' + rsMisc + ')',\n      rsMiscUpper = '(?:' + rsUpper + '|' + rsMisc + ')',\n      rsOptContrLower = '(?:' + rsApos + '(?:d|ll|m|re|s|t|ve))?',\n      rsOptContrUpper = '(?:' + rsApos + '(?:D|LL|M|RE|S|T|VE))?',\n      reOptMod = rsModifier + '?',\n      rsOptVar = '[' + rsVarRange + ']?',\n      rsOptJoin = '(?:' + rsZWJ + '(?:' + [rsNonAstral, rsRegional, rsSurrPair].join('|') + ')' + rsOptVar + reOptMod + ')*',\n      rsOrdLower = '\\\\d*(?:1st|2nd|3rd|(?![123])\\\\dth)(?=\\\\b|[A-Z_])',\n      rsOrdUpper = '\\\\d*(?:1ST|2ND|3RD|(?![123])\\\\dTH)(?=\\\\b|[a-z_])',\n      rsSeq = rsOptVar + reOptMod + rsOptJoin,\n      rsEmoji = '(?:' + [rsDingbat, rsRegional, rsSurrPair].join('|') + ')' + rsSeq,\n      rsSymbol = '(?:' + [rsNonAstral + rsCombo + '?', rsCombo, rsRegional, rsSurrPair, rsAstral].join('|') + ')';\n\n  /** Used to match apostrophes. */\n  var reApos = RegExp(rsApos, 'g');\n\n  /**\n   * Used to match [combining diacritical marks](https://en.wikipedia.org/wiki/Combining_Diacritical_Marks) and\n   * [combining diacritical marks for symbols](https://en.wikipedia.org/wiki/Combining_Diacritical_Marks_for_Symbols).\n   */\n  var reComboMark = RegExp(rsCombo, 'g');\n\n  /** Used to match [string symbols](https://mathiasbynens.be/notes/javascript-unicode). */\n  var reUnicode = RegExp(rsFitz + '(?=' + rsFitz + ')|' + rsSymbol + rsSeq, 'g');\n\n  /** Used to match complex or compound words. */\n  var reUnicodeWord = RegExp([\n    rsUpper + '?' + rsLower + '+' + rsOptContrLower + '(?=' + [rsBreak, rsUpper, '$'].join('|') + ')',\n    rsMiscUpper + '+' + rsOptContrUpper + '(?=' + [rsBreak, rsUpper + rsMiscLower, '$'].join('|') + ')',\n    rsUpper + '?' + rsMiscLower + '+' + rsOptContrLower,\n    rsUpper + '+' + rsOptContrUpper,\n    rsOrdUpper,\n    rsOrdLower,\n    rsDigits,\n    rsEmoji\n  ].join('|'), 'g');\n\n  /** Used to detect strings with [zero-width joiners or code points from the astral planes](http://eev.ee/blog/2015/09/12/dark-corners-of-unicode/). */\n  var reHasUnicode = RegExp('[' + rsZWJ + rsAstralRange  + rsComboRange + rsVarRange + ']');\n\n  /** Used to detect strings that need a more robust regexp to match words. */\n  var reHasUnicodeWord = /[a-z][A-Z]|[A-Z]{2}[a-z]|[0-9][a-zA-Z]|[a-zA-Z][0-9]|[^a-zA-Z0-9 ]/;\n\n  /** Used to assign default `context` object properties. */\n  var contextProps = [\n    'Array', 'Buffer', 'DataView', 'Date', 'Error', 'Float32Array', 'Float64Array',\n    'Function', 'Int8Array', 'Int16Array', 'Int32Array', 'Map', 'Math', 'Object',\n    'Promise', 'RegExp', 'Set', 'String', 'Symbol', 'TypeError', 'Uint8Array',\n    'Uint8ClampedArray', 'Uint16Array', 'Uint32Array', 'WeakMap',\n    '_', 'clearTimeout', 'isFinite', 'parseInt', 'setTimeout'\n  ];\n\n  /** Used to make template sourceURLs easier to identify. */\n  var templateCounter = -1;\n\n  /** Used to identify `toStringTag` values of typed arrays. */\n  var typedArrayTags = {};\n  typedArrayTags[float32Tag] = typedArrayTags[float64Tag] =\n  typedArrayTags[int8Tag] = typedArrayTags[int16Tag] =\n  typedArrayTags[int32Tag] = typedArrayTags[uint8Tag] =\n  typedArrayTags[uint8ClampedTag] = typedArrayTags[uint16Tag] =\n  typedArrayTags[uint32Tag] = true;\n  typedArrayTags[argsTag] = typedArrayTags[arrayTag] =\n  typedArrayTags[arrayBufferTag] = typedArrayTags[boolTag] =\n  typedArrayTags[dataViewTag] = typedArrayTags[dateTag] =\n  typedArrayTags[errorTag] = typedArrayTags[funcTag] =\n  typedArrayTags[mapTag] = typedArrayTags[numberTag] =\n  typedArrayTags[objectTag] = typedArrayTags[regexpTag] =\n  typedArrayTags[setTag] = typedArrayTags[stringTag] =\n  typedArrayTags[weakMapTag] = false;\n\n  /** Used to identify `toStringTag` values supported by `_.clone`. */\n  var cloneableTags = {};\n  cloneableTags[argsTag] = cloneableTags[arrayTag] =\n  cloneableTags[arrayBufferTag] = cloneableTags[dataViewTag] =\n  cloneableTags[boolTag] = cloneableTags[dateTag] =\n  cloneableTags[float32Tag] = cloneableTags[float64Tag] =\n  cloneableTags[int8Tag] = cloneableTags[int16Tag] =\n  cloneableTags[int32Tag] = cloneableTags[mapTag] =\n  cloneableTags[numberTag] = cloneableTags[objectTag] =\n  cloneableTags[regexpTag] = cloneableTags[setTag] =\n  cloneableTags[stringTag] = cloneableTags[symbolTag] =\n  cloneableTags[uint8Tag] = cloneableTags[uint8ClampedTag] =\n  cloneableTags[uint16Tag] = cloneableTags[uint32Tag] = true;\n  cloneableTags[errorTag] = cloneableTags[funcTag] =\n  cloneableTags[weakMapTag] = false;\n\n  /** Used to map Latin Unicode letters to basic Latin letters. */\n  var deburredLetters = {\n    // Latin-1 Supplement block.\n    '\\xc0': 'A',  '\\xc1': 'A', '\\xc2': 'A', '\\xc3': 'A', '\\xc4': 'A', '\\xc5': 'A',\n    '\\xe0': 'a',  '\\xe1': 'a', '\\xe2': 'a', '\\xe3': 'a', '\\xe4': 'a', '\\xe5': 'a',\n    '\\xc7': 'C',  '\\xe7': 'c',\n    '\\xd0': 'D',  '\\xf0': 'd',\n    '\\xc8': 'E',  '\\xc9': 'E', '\\xca': 'E', '\\xcb': 'E',\n    '\\xe8': 'e',  '\\xe9': 'e', '\\xea': 'e', '\\xeb': 'e',\n    '\\xcc': 'I',  '\\xcd': 'I', '\\xce': 'I', '\\xcf': 'I',\n    '\\xec': 'i',  '\\xed': 'i', '\\xee': 'i', '\\xef': 'i',\n    '\\xd1': 'N',  '\\xf1': 'n',\n    '\\xd2': 'O',  '\\xd3': 'O', '\\xd4': 'O', '\\xd5': 'O', '\\xd6': 'O', '\\xd8': 'O',\n    '\\xf2': 'o',  '\\xf3': 'o', '\\xf4': 'o', '\\xf5': 'o', '\\xf6': 'o', '\\xf8': 'o',\n    '\\xd9': 'U',  '\\xda': 'U', '\\xdb': 'U', '\\xdc': 'U',\n    '\\xf9': 'u',  '\\xfa': 'u', '\\xfb': 'u', '\\xfc': 'u',\n    '\\xdd': 'Y',  '\\xfd': 'y', '\\xff': 'y',\n    '\\xc6': 'Ae', '\\xe6': 'ae',\n    '\\xde': 'Th', '\\xfe': 'th',\n    '\\xdf': 'ss',\n    // Latin Extended-A block.\n    '\\u0100': 'A',  '\\u0102': 'A', '\\u0104': 'A',\n    '\\u0101': 'a',  '\\u0103': 'a', '\\u0105': 'a',\n    '\\u0106': 'C',  '\\u0108': 'C', '\\u010a': 'C', '\\u010c': 'C',\n    '\\u0107': 'c',  '\\u0109': 'c', '\\u010b': 'c', '\\u010d': 'c',\n    '\\u010e': 'D',  '\\u0110': 'D', '\\u010f': 'd', '\\u0111': 'd',\n    '\\u0112': 'E',  '\\u0114': 'E', '\\u0116': 'E', '\\u0118': 'E', '\\u011a': 'E',\n    '\\u0113': 'e',  '\\u0115': 'e', '\\u0117': 'e', '\\u0119': 'e', '\\u011b': 'e',\n    '\\u011c': 'G',  '\\u011e': 'G', '\\u0120': 'G', '\\u0122': 'G',\n    '\\u011d': 'g',  '\\u011f': 'g', '\\u0121': 'g', '\\u0123': 'g',\n    '\\u0124': 'H',  '\\u0126': 'H', '\\u0125': 'h', '\\u0127': 'h',\n    '\\u0128': 'I',  '\\u012a': 'I', '\\u012c': 'I', '\\u012e': 'I', '\\u0130': 'I',\n    '\\u0129': 'i',  '\\u012b': 'i', '\\u012d': 'i', '\\u012f': 'i', '\\u0131': 'i',\n    '\\u0134': 'J',  '\\u0135': 'j',\n    '\\u0136': 'K',  '\\u0137': 'k', '\\u0138': 'k',\n    '\\u0139': 'L',  '\\u013b': 'L', '\\u013d': 'L', '\\u013f': 'L', '\\u0141': 'L',\n    '\\u013a': 'l',  '\\u013c': 'l', '\\u013e': 'l', '\\u0140': 'l', '\\u0142': 'l',\n    '\\u0143': 'N',  '\\u0145': 'N', '\\u0147': 'N', '\\u014a': 'N',\n    '\\u0144': 'n',  '\\u0146': 'n', '\\u0148': 'n', '\\u014b': 'n',\n    '\\u014c': 'O',  '\\u014e': 'O', '\\u0150': 'O',\n    '\\u014d': 'o',  '\\u014f': 'o', '\\u0151': 'o',\n    '\\u0154': 'R',  '\\u0156': 'R', '\\u0158': 'R',\n    '\\u0155': 'r',  '\\u0157': 'r', '\\u0159': 'r',\n    '\\u015a': 'S',  '\\u015c': 'S', '\\u015e': 'S', '\\u0160': 'S',\n    '\\u015b': 's',  '\\u015d': 's', '\\u015f': 's', '\\u0161': 's',\n    '\\u0162': 'T',  '\\u0164': 'T', '\\u0166': 'T',\n    '\\u0163': 't',  '\\u0165': 't', '\\u0167': 't',\n    '\\u0168': 'U',  '\\u016a': 'U', '\\u016c': 'U', '\\u016e': 'U', '\\u0170': 'U', '\\u0172': 'U',\n    '\\u0169': 'u',  '\\u016b': 'u', '\\u016d': 'u', '\\u016f': 'u', '\\u0171': 'u', '\\u0173': 'u',\n    '\\u0174': 'W',  '\\u0175': 'w',\n    '\\u0176': 'Y',  '\\u0177': 'y', '\\u0178': 'Y',\n    '\\u0179': 'Z',  '\\u017b': 'Z', '\\u017d': 'Z',\n    '\\u017a': 'z',  '\\u017c': 'z', '\\u017e': 'z',\n    '\\u0132': 'IJ', '\\u0133': 'ij',\n    '\\u0152': 'Oe', '\\u0153': 'oe',\n    '\\u0149': \"'n\", '\\u017f': 's'\n  };\n\n  /** Used to map characters to HTML entities. */\n  var htmlEscapes = {\n    '&': '&amp;',\n    '<': '&lt;',\n    '>': '&gt;',\n    '\"': '&quot;',\n    \"'\": '&#39;'\n  };\n\n  /** Used to map HTML entities to characters. */\n  var htmlUnescapes = {\n    '&amp;': '&',\n    '&lt;': '<',\n    '&gt;': '>',\n    '&quot;': '\"',\n    '&#39;': \"'\"\n  };\n\n  /** Used to escape characters for inclusion in compiled string literals. */\n  var stringEscapes = {\n    '\\\\': '\\\\',\n    \"'\": \"'\",\n    '\\n': 'n',\n    '\\r': 'r',\n    '\\u2028': 'u2028',\n    '\\u2029': 'u2029'\n  };\n\n  /** Built-in method references without a dependency on `root`. */\n  var freeParseFloat = parseFloat,\n      freeParseInt = parseInt;\n\n  /** Detect free variable `global` from Node.js. */\n  var freeGlobal = typeof global == 'object' && global && global.Object === Object && global;\n\n  /** Detect free variable `self`. */\n  var freeSelf = typeof self == 'object' && self && self.Object === Object && self;\n\n  /** Used as a reference to the global object. */\n  var root = freeGlobal || freeSelf || Function('return this')();\n\n  /** Detect free variable `exports`. */\n  var freeExports = typeof exports == 'object' && exports && !exports.nodeType && exports;\n\n  /** Detect free variable `module`. */\n  var freeModule = freeExports && typeof module == 'object' && module && !module.nodeType && module;\n\n  /** Detect the popular CommonJS extension `module.exports`. */\n  var moduleExports = freeModule && freeModule.exports === freeExports;\n\n  /** Detect free variable `process` from Node.js. */\n  var freeProcess = moduleExports && freeGlobal.process;\n\n  /** Used to access faster Node.js helpers. */\n  var 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\n  /* Node.js helper references. */\n  var nodeIsArrayBuffer = nodeUtil && nodeUtil.isArrayBuffer,\n      nodeIsDate = nodeUtil && nodeUtil.isDate,\n      nodeIsMap = nodeUtil && nodeUtil.isMap,\n      nodeIsRegExp = nodeUtil && nodeUtil.isRegExp,\n      nodeIsSet = nodeUtil && nodeUtil.isSet,\n      nodeIsTypedArray = nodeUtil && nodeUtil.isTypedArray;\n\n  /*--------------------------------------------------------------------------*/\n\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   */\n  function 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\n  /**\n   * A specialized version of `baseAggregator` for arrays.\n   *\n   * @private\n   * @param {Array} [array] The array to iterate over.\n   * @param {Function} setter The function to set `accumulator` values.\n   * @param {Function} iteratee The iteratee to transform keys.\n   * @param {Object} accumulator The initial aggregated object.\n   * @returns {Function} Returns `accumulator`.\n   */\n  function arrayAggregator(array, setter, iteratee, accumulator) {\n    var index = -1,\n        length = array == null ? 0 : array.length;\n\n    while (++index < length) {\n      var value = array[index];\n      setter(accumulator, value, iteratee(value), array);\n    }\n    return accumulator;\n  }\n\n  /**\n   * A specialized version of `_.forEach` for arrays without support for\n   * iteratee 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 `array`.\n   */\n  function arrayEach(array, iteratee) {\n    var index = -1,\n        length = array == null ? 0 : array.length;\n\n    while (++index < length) {\n      if (iteratee(array[index], index, array) === false) {\n        break;\n      }\n    }\n    return array;\n  }\n\n  /**\n   * A specialized version of `_.forEachRight` for arrays without support for\n   * iteratee 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 `array`.\n   */\n  function arrayEachRight(array, iteratee) {\n    var length = array == null ? 0 : array.length;\n\n    while (length--) {\n      if (iteratee(array[length], length, array) === false) {\n        break;\n      }\n    }\n    return array;\n  }\n\n  /**\n   * A specialized version of `_.every` 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 {boolean} Returns `true` if all elements pass the predicate check,\n   *  else `false`.\n   */\n  function arrayEvery(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 false;\n      }\n    }\n    return true;\n  }\n\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   */\n  function 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\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   */\n  function arrayIncludes(array, value) {\n    var length = array == null ? 0 : array.length;\n    return !!length && baseIndexOf(array, value, 0) > -1;\n  }\n\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   */\n  function 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\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   */\n  function 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\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   */\n  function 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\n  /**\n   * A specialized version of `_.reduce` for arrays without support for\n   * iteratee shorthands.\n   *\n   * @private\n   * @param {Array} [array] The array to iterate over.\n   * @param {Function} iteratee The function invoked per iteration.\n   * @param {*} [accumulator] The initial value.\n   * @param {boolean} [initAccum] Specify using the first element of `array` as\n   *  the initial value.\n   * @returns {*} Returns the accumulated value.\n   */\n  function arrayReduce(array, iteratee, accumulator, initAccum) {\n    var index = -1,\n        length = array == null ? 0 : array.length;\n\n    if (initAccum && length) {\n      accumulator = array[++index];\n    }\n    while (++index < length) {\n      accumulator = iteratee(accumulator, array[index], index, array);\n    }\n    return accumulator;\n  }\n\n  /**\n   * A specialized version of `_.reduceRight` for arrays without support for\n   * iteratee shorthands.\n   *\n   * @private\n   * @param {Array} [array] The array to iterate over.\n   * @param {Function} iteratee The function invoked per iteration.\n   * @param {*} [accumulator] The initial value.\n   * @param {boolean} [initAccum] Specify using the last element of `array` as\n   *  the initial value.\n   * @returns {*} Returns the accumulated value.\n   */\n  function arrayReduceRight(array, iteratee, accumulator, initAccum) {\n    var length = array == null ? 0 : array.length;\n    if (initAccum && length) {\n      accumulator = array[--length];\n    }\n    while (length--) {\n      accumulator = iteratee(accumulator, array[length], length, array);\n    }\n    return accumulator;\n  }\n\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   */\n  function 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\n  /**\n   * Gets the size of an ASCII `string`.\n   *\n   * @private\n   * @param {string} string The string inspect.\n   * @returns {number} Returns the string size.\n   */\n  var asciiSize = baseProperty('length');\n\n  /**\n   * Converts an ASCII `string` to an array.\n   *\n   * @private\n   * @param {string} string The string to convert.\n   * @returns {Array} Returns the converted array.\n   */\n  function asciiToArray(string) {\n    return string.split('');\n  }\n\n  /**\n   * Splits an ASCII `string` into an array of its words.\n   *\n   * @private\n   * @param {string} The string to inspect.\n   * @returns {Array} Returns the words of `string`.\n   */\n  function asciiWords(string) {\n    return string.match(reAsciiWord) || [];\n  }\n\n  /**\n   * The base implementation of methods like `_.findKey` and `_.findLastKey`,\n   * without support for iteratee shorthands, which iterates over `collection`\n   * using `eachFunc`.\n   *\n   * @private\n   * @param {Array|Object} collection The collection to inspect.\n   * @param {Function} predicate The function invoked per iteration.\n   * @param {Function} eachFunc The function to iterate over `collection`.\n   * @returns {*} Returns the found element or its key, else `undefined`.\n   */\n  function baseFindKey(collection, predicate, eachFunc) {\n    var result;\n    eachFunc(collection, function(value, key, collection) {\n      if (predicate(value, key, collection)) {\n        result = key;\n        return false;\n      }\n    });\n    return result;\n  }\n\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   */\n  function 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\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   */\n  function baseIndexOf(array, value, fromIndex) {\n    return value === value\n      ? strictIndexOf(array, value, fromIndex)\n      : baseFindIndex(array, baseIsNaN, fromIndex);\n  }\n\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   */\n  function 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\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   */\n  function baseIsNaN(value) {\n    return value !== value;\n  }\n\n  /**\n   * The base implementation of `_.mean` and `_.meanBy` without support for\n   * iteratee shorthands.\n   *\n   * @private\n   * @param {Array} array The array to iterate over.\n   * @param {Function} iteratee The function invoked per iteration.\n   * @returns {number} Returns the mean.\n   */\n  function baseMean(array, iteratee) {\n    var length = array == null ? 0 : array.length;\n    return length ? (baseSum(array, iteratee) / length) : NAN;\n  }\n\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   */\n  function baseProperty(key) {\n    return function(object) {\n      return object == null ? undefined : object[key];\n    };\n  }\n\n  /**\n   * The base implementation of `_.propertyOf` without support for deep paths.\n   *\n   * @private\n   * @param {Object} object The object to query.\n   * @returns {Function} Returns the new accessor function.\n   */\n  function basePropertyOf(object) {\n    return function(key) {\n      return object == null ? undefined : object[key];\n    };\n  }\n\n  /**\n   * The base implementation of `_.reduce` and `_.reduceRight`, without support\n   * for iteratee shorthands, which iterates over `collection` using `eachFunc`.\n   *\n   * @private\n   * @param {Array|Object} collection The collection to iterate over.\n   * @param {Function} iteratee The function invoked per iteration.\n   * @param {*} accumulator The initial value.\n   * @param {boolean} initAccum Specify using the first or last element of\n   *  `collection` as the initial value.\n   * @param {Function} eachFunc The function to iterate over `collection`.\n   * @returns {*} Returns the accumulated value.\n   */\n  function baseReduce(collection, iteratee, accumulator, initAccum, eachFunc) {\n    eachFunc(collection, function(value, index, collection) {\n      accumulator = initAccum\n        ? (initAccum = false, value)\n        : iteratee(accumulator, value, index, collection);\n    });\n    return accumulator;\n  }\n\n  /**\n   * The base implementation of `_.sortBy` which uses `comparer` to define the\n   * sort order of `array` and replaces criteria objects with their corresponding\n   * values.\n   *\n   * @private\n   * @param {Array} array The array to sort.\n   * @param {Function} comparer The function to define sort order.\n   * @returns {Array} Returns `array`.\n   */\n  function baseSortBy(array, comparer) {\n    var length = array.length;\n\n    array.sort(comparer);\n    while (length--) {\n      array[length] = array[length].value;\n    }\n    return array;\n  }\n\n  /**\n   * The base implementation of `_.sum` and `_.sumBy` without support for\n   * iteratee shorthands.\n   *\n   * @private\n   * @param {Array} array The array to iterate over.\n   * @param {Function} iteratee The function invoked per iteration.\n   * @returns {number} Returns the sum.\n   */\n  function baseSum(array, iteratee) {\n    var result,\n        index = -1,\n        length = array.length;\n\n    while (++index < length) {\n      var current = iteratee(array[index]);\n      if (current !== undefined) {\n        result = result === undefined ? current : (result + current);\n      }\n    }\n    return result;\n  }\n\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   */\n  function 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\n  /**\n   * The base implementation of `_.toPairs` and `_.toPairsIn` which creates an array\n   * of key-value pairs for `object` corresponding to the property names of `props`.\n   *\n   * @private\n   * @param {Object} object The object to query.\n   * @param {Array} props The property names to get values for.\n   * @returns {Object} Returns the key-value pairs.\n   */\n  function baseToPairs(object, props) {\n    return arrayMap(props, function(key) {\n      return [key, object[key]];\n    });\n  }\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   */\n  function baseTrim(string) {\n    return string\n      ? string.slice(0, trimmedEndIndex(string) + 1).replace(reTrimStart, '')\n      : string;\n  }\n\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   */\n  function baseUnary(func) {\n    return function(value) {\n      return func(value);\n    };\n  }\n\n  /**\n   * The base implementation of `_.values` and `_.valuesIn` which creates an\n   * array of `object` property values corresponding to the property names\n   * of `props`.\n   *\n   * @private\n   * @param {Object} object The object to query.\n   * @param {Array} props The property names to get values for.\n   * @returns {Object} Returns the array of property values.\n   */\n  function baseValues(object, props) {\n    return arrayMap(props, function(key) {\n      return object[key];\n    });\n  }\n\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   */\n  function cacheHas(cache, key) {\n    return cache.has(key);\n  }\n\n  /**\n   * Used by `_.trim` and `_.trimStart` to get the index of the first string symbol\n   * that is not found in the character symbols.\n   *\n   * @private\n   * @param {Array} strSymbols The string symbols to inspect.\n   * @param {Array} chrSymbols The character symbols to find.\n   * @returns {number} Returns the index of the first unmatched string symbol.\n   */\n  function charsStartIndex(strSymbols, chrSymbols) {\n    var index = -1,\n        length = strSymbols.length;\n\n    while (++index < length && baseIndexOf(chrSymbols, strSymbols[index], 0) > -1) {}\n    return index;\n  }\n\n  /**\n   * Used by `_.trim` and `_.trimEnd` to get the index of the last string symbol\n   * that is not found in the character symbols.\n   *\n   * @private\n   * @param {Array} strSymbols The string symbols to inspect.\n   * @param {Array} chrSymbols The character symbols to find.\n   * @returns {number} Returns the index of the last unmatched string symbol.\n   */\n  function charsEndIndex(strSymbols, chrSymbols) {\n    var index = strSymbols.length;\n\n    while (index-- && baseIndexOf(chrSymbols, strSymbols[index], 0) > -1) {}\n    return index;\n  }\n\n  /**\n   * Gets the number of `placeholder` occurrences in `array`.\n   *\n   * @private\n   * @param {Array} array The array to inspect.\n   * @param {*} placeholder The placeholder to search for.\n   * @returns {number} Returns the placeholder count.\n   */\n  function countHolders(array, placeholder) {\n    var length = array.length,\n        result = 0;\n\n    while (length--) {\n      if (array[length] === placeholder) {\n        ++result;\n      }\n    }\n    return result;\n  }\n\n  /**\n   * Used by `_.deburr` to convert Latin-1 Supplement and Latin Extended-A\n   * letters to basic Latin letters.\n   *\n   * @private\n   * @param {string} letter The matched letter to deburr.\n   * @returns {string} Returns the deburred letter.\n   */\n  var deburrLetter = basePropertyOf(deburredLetters);\n\n  /**\n   * Used by `_.escape` to convert characters to HTML entities.\n   *\n   * @private\n   * @param {string} chr The matched character to escape.\n   * @returns {string} Returns the escaped character.\n   */\n  var escapeHtmlChar = basePropertyOf(htmlEscapes);\n\n  /**\n   * Used by `_.template` to escape characters for inclusion in compiled string literals.\n   *\n   * @private\n   * @param {string} chr The matched character to escape.\n   * @returns {string} Returns the escaped character.\n   */\n  function escapeStringChar(chr) {\n    return '\\\\' + stringEscapes[chr];\n  }\n\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   */\n  function getValue(object, key) {\n    return object == null ? undefined : object[key];\n  }\n\n  /**\n   * Checks if `string` contains Unicode symbols.\n   *\n   * @private\n   * @param {string} string The string to inspect.\n   * @returns {boolean} Returns `true` if a symbol is found, else `false`.\n   */\n  function hasUnicode(string) {\n    return reHasUnicode.test(string);\n  }\n\n  /**\n   * Checks if `string` contains a word composed of Unicode symbols.\n   *\n   * @private\n   * @param {string} string The string to inspect.\n   * @returns {boolean} Returns `true` if a word is found, else `false`.\n   */\n  function hasUnicodeWord(string) {\n    return reHasUnicodeWord.test(string);\n  }\n\n  /**\n   * Converts `iterator` to an array.\n   *\n   * @private\n   * @param {Object} iterator The iterator to convert.\n   * @returns {Array} Returns the converted array.\n   */\n  function iteratorToArray(iterator) {\n    var data,\n        result = [];\n\n    while (!(data = iterator.next()).done) {\n      result.push(data.value);\n    }\n    return result;\n  }\n\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   */\n  function 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\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   */\n  function overArg(func, transform) {\n    return function(arg) {\n      return func(transform(arg));\n    };\n  }\n\n  /**\n   * Replaces all `placeholder` elements in `array` with an internal placeholder\n   * and returns an array of their indexes.\n   *\n   * @private\n   * @param {Array} array The array to modify.\n   * @param {*} placeholder The placeholder to replace.\n   * @returns {Array} Returns the new array of placeholder indexes.\n   */\n  function replaceHolders(array, placeholder) {\n    var index = -1,\n        length = array.length,\n        resIndex = 0,\n        result = [];\n\n    while (++index < length) {\n      var value = array[index];\n      if (value === placeholder || value === PLACEHOLDER) {\n        array[index] = PLACEHOLDER;\n        result[resIndex++] = index;\n      }\n    }\n    return result;\n  }\n\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   */\n  function 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\n  /**\n   * Converts `set` to its value-value pairs.\n   *\n   * @private\n   * @param {Object} set The set to convert.\n   * @returns {Array} Returns the value-value pairs.\n   */\n  function setToPairs(set) {\n    var index = -1,\n        result = Array(set.size);\n\n    set.forEach(function(value) {\n      result[++index] = [value, value];\n    });\n    return result;\n  }\n\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   */\n  function 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\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   */\n  function 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\n  /**\n   * Gets the number of symbols in `string`.\n   *\n   * @private\n   * @param {string} string The string to inspect.\n   * @returns {number} Returns the string size.\n   */\n  function stringSize(string) {\n    return hasUnicode(string)\n      ? unicodeSize(string)\n      : asciiSize(string);\n  }\n\n  /**\n   * Converts `string` to an array.\n   *\n   * @private\n   * @param {string} string The string to convert.\n   * @returns {Array} Returns the converted array.\n   */\n  function stringToArray(string) {\n    return hasUnicode(string)\n      ? unicodeToArray(string)\n      : asciiToArray(string);\n  }\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   */\n  function trimmedEndIndex(string) {\n    var index = string.length;\n\n    while (index-- && reWhitespace.test(string.charAt(index))) {}\n    return index;\n  }\n\n  /**\n   * Used by `_.unescape` to convert HTML entities to characters.\n   *\n   * @private\n   * @param {string} chr The matched character to unescape.\n   * @returns {string} Returns the unescaped character.\n   */\n  var unescapeHtmlChar = basePropertyOf(htmlUnescapes);\n\n  /**\n   * Gets the size of a Unicode `string`.\n   *\n   * @private\n   * @param {string} string The string inspect.\n   * @returns {number} Returns the string size.\n   */\n  function unicodeSize(string) {\n    var result = reUnicode.lastIndex = 0;\n    while (reUnicode.test(string)) {\n      ++result;\n    }\n    return result;\n  }\n\n  /**\n   * Converts a Unicode `string` to an array.\n   *\n   * @private\n   * @param {string} string The string to convert.\n   * @returns {Array} Returns the converted array.\n   */\n  function unicodeToArray(string) {\n    return string.match(reUnicode) || [];\n  }\n\n  /**\n   * Splits a Unicode `string` into an array of its words.\n   *\n   * @private\n   * @param {string} The string to inspect.\n   * @returns {Array} Returns the words of `string`.\n   */\n  function unicodeWords(string) {\n    return string.match(reUnicodeWord) || [];\n  }\n\n  /*--------------------------------------------------------------------------*/\n\n  /**\n   * Create a new pristine `lodash` function using the `context` object.\n   *\n   * @static\n   * @memberOf _\n   * @since 1.1.0\n   * @category Util\n   * @param {Object} [context=root] The context object.\n   * @returns {Function} Returns a new `lodash` function.\n   * @example\n   *\n   * _.mixin({ 'foo': _.constant('foo') });\n   *\n   * var lodash = _.runInContext();\n   * lodash.mixin({ 'bar': lodash.constant('bar') });\n   *\n   * _.isFunction(_.foo);\n   * // => true\n   * _.isFunction(_.bar);\n   * // => false\n   *\n   * lodash.isFunction(lodash.foo);\n   * // => false\n   * lodash.isFunction(lodash.bar);\n   * // => true\n   *\n   * // Create a suped-up `defer` in Node.js.\n   * var defer = _.runInContext({ 'setTimeout': setImmediate }).defer;\n   */\n  var runInContext = (function runInContext(context) {\n    context = context == null ? root : _.defaults(root.Object(), context, _.pick(root, contextProps));\n\n    /** Built-in constructor references. */\n    var Array = context.Array,\n        Date = context.Date,\n        Error = context.Error,\n        Function = context.Function,\n        Math = context.Math,\n        Object = context.Object,\n        RegExp = context.RegExp,\n        String = context.String,\n        TypeError = context.TypeError;\n\n    /** Used for built-in method references. */\n    var arrayProto = Array.prototype,\n        funcProto = Function.prototype,\n        objectProto = Object.prototype;\n\n    /** Used to detect overreaching core-js shims. */\n    var coreJsData = context['__core-js_shared__'];\n\n    /** Used to resolve the decompiled source of functions. */\n    var funcToString = funcProto.toString;\n\n    /** Used to check objects for own properties. */\n    var hasOwnProperty = objectProto.hasOwnProperty;\n\n    /** Used to generate unique IDs. */\n    var idCounter = 0;\n\n    /** Used to detect methods masquerading as native. */\n    var maskSrcKey = (function() {\n      var uid = /[^.]+$/.exec(coreJsData && coreJsData.keys && coreJsData.keys.IE_PROTO || '');\n      return uid ? ('Symbol(src)_1.' + uid) : '';\n    }());\n\n    /**\n     * Used to resolve the\n     * [`toStringTag`](http://ecma-international.org/ecma-262/7.0/#sec-object.prototype.tostring)\n     * of values.\n     */\n    var nativeObjectToString = objectProto.toString;\n\n    /** Used to infer the `Object` constructor. */\n    var objectCtorString = funcToString.call(Object);\n\n    /** Used to restore the original `_` reference in `_.noConflict`. */\n    var oldDash = root._;\n\n    /** Used to detect if a method is native. */\n    var reIsNative = RegExp('^' +\n      funcToString.call(hasOwnProperty).replace(reRegExpChar, '\\\\$&')\n      .replace(/hasOwnProperty|(function).*?(?=\\\\\\()| for .+?(?=\\\\\\])/g, '$1.*?') + '$'\n    );\n\n    /** Built-in value references. */\n    var Buffer = moduleExports ? context.Buffer : undefined,\n        Symbol = context.Symbol,\n        Uint8Array = context.Uint8Array,\n        allocUnsafe = Buffer ? Buffer.allocUnsafe : undefined,\n        getPrototype = overArg(Object.getPrototypeOf, Object),\n        objectCreate = Object.create,\n        propertyIsEnumerable = objectProto.propertyIsEnumerable,\n        splice = arrayProto.splice,\n        spreadableSymbol = Symbol ? Symbol.isConcatSpreadable : undefined,\n        symIterator = Symbol ? Symbol.iterator : undefined,\n        symToStringTag = Symbol ? Symbol.toStringTag : undefined;\n\n    var defineProperty = (function() {\n      try {\n        var func = getNative(Object, 'defineProperty');\n        func({}, '', {});\n        return func;\n      } catch (e) {}\n    }());\n\n    /** Mocked built-ins. */\n    var ctxClearTimeout = context.clearTimeout !== root.clearTimeout && context.clearTimeout,\n        ctxNow = Date && Date.now !== root.Date.now && Date.now,\n        ctxSetTimeout = context.setTimeout !== root.setTimeout && context.setTimeout;\n\n    /* Built-in method references for those with the same name as other `lodash` methods. */\n    var nativeCeil = Math.ceil,\n        nativeFloor = Math.floor,\n        nativeGetSymbols = Object.getOwnPropertySymbols,\n        nativeIsBuffer = Buffer ? Buffer.isBuffer : undefined,\n        nativeIsFinite = context.isFinite,\n        nativeJoin = arrayProto.join,\n        nativeKeys = overArg(Object.keys, Object),\n        nativeMax = Math.max,\n        nativeMin = Math.min,\n        nativeNow = Date.now,\n        nativeParseInt = context.parseInt,\n        nativeRandom = Math.random,\n        nativeReverse = arrayProto.reverse;\n\n    /* Built-in method references that are verified to be native. */\n    var DataView = getNative(context, 'DataView'),\n        Map = getNative(context, 'Map'),\n        Promise = getNative(context, 'Promise'),\n        Set = getNative(context, 'Set'),\n        WeakMap = getNative(context, 'WeakMap'),\n        nativeCreate = getNative(Object, 'create');\n\n    /** Used to store function metadata. */\n    var metaMap = WeakMap && new WeakMap;\n\n    /** Used to lookup unminified function names. */\n    var realNames = {};\n\n    /** Used to detect maps, sets, and weakmaps. */\n    var dataViewCtorString = toSource(DataView),\n        mapCtorString = toSource(Map),\n        promiseCtorString = toSource(Promise),\n        setCtorString = toSource(Set),\n        weakMapCtorString = toSource(WeakMap);\n\n    /** Used to convert symbols to primitives and strings. */\n    var symbolProto = Symbol ? Symbol.prototype : undefined,\n        symbolValueOf = symbolProto ? symbolProto.valueOf : undefined,\n        symbolToString = symbolProto ? symbolProto.toString : undefined;\n\n    /*------------------------------------------------------------------------*/\n\n    /**\n     * Creates a `lodash` object which wraps `value` to enable implicit method\n     * chain sequences. Methods that operate on and return arrays, collections,\n     * and functions can be chained together. Methods that retrieve a single value\n     * or may return a primitive value will automatically end the chain sequence\n     * and return the unwrapped value. Otherwise, the value must be unwrapped\n     * with `_#value`.\n     *\n     * Explicit chain sequences, which must be unwrapped with `_#value`, may be\n     * enabled using `_.chain`.\n     *\n     * The execution of chained methods is lazy, that is, it's deferred until\n     * `_#value` is implicitly or explicitly called.\n     *\n     * Lazy evaluation allows several methods to support shortcut fusion.\n     * Shortcut fusion is an optimization to merge iteratee calls; this avoids\n     * the creation of intermediate arrays and can greatly reduce the number of\n     * iteratee executions. Sections of a chain sequence qualify for shortcut\n     * fusion if the section is applied to an array and iteratees accept only\n     * one argument. The heuristic for whether a section qualifies for shortcut\n     * fusion is subject to change.\n     *\n     * Chaining is supported in custom builds as long as the `_#value` method is\n     * directly or indirectly included in the build.\n     *\n     * In addition to lodash methods, wrappers have `Array` and `String` methods.\n     *\n     * The wrapper `Array` methods are:\n     * `concat`, `join`, `pop`, `push`, `shift`, `sort`, `splice`, and `unshift`\n     *\n     * The wrapper `String` methods are:\n     * `replace` and `split`\n     *\n     * The wrapper methods that support shortcut fusion are:\n     * `at`, `compact`, `drop`, `dropRight`, `dropWhile`, `filter`, `find`,\n     * `findLast`, `head`, `initial`, `last`, `map`, `reject`, `reverse`, `slice`,\n     * `tail`, `take`, `takeRight`, `takeRightWhile`, `takeWhile`, and `toArray`\n     *\n     * The chainable wrapper methods are:\n     * `after`, `ary`, `assign`, `assignIn`, `assignInWith`, `assignWith`, `at`,\n     * `before`, `bind`, `bindAll`, `bindKey`, `castArray`, `chain`, `chunk`,\n     * `commit`, `compact`, `concat`, `conforms`, `constant`, `countBy`, `create`,\n     * `curry`, `debounce`, `defaults`, `defaultsDeep`, `defer`, `delay`,\n     * `difference`, `differenceBy`, `differenceWith`, `drop`, `dropRight`,\n     * `dropRightWhile`, `dropWhile`, `extend`, `extendWith`, `fill`, `filter`,\n     * `flatMap`, `flatMapDeep`, `flatMapDepth`, `flatten`, `flattenDeep`,\n     * `flattenDepth`, `flip`, `flow`, `flowRight`, `fromPairs`, `functions`,\n     * `functionsIn`, `groupBy`, `initial`, `intersection`, `intersectionBy`,\n     * `intersectionWith`, `invert`, `invertBy`, `invokeMap`, `iteratee`, `keyBy`,\n     * `keys`, `keysIn`, `map`, `mapKeys`, `mapValues`, `matches`, `matchesProperty`,\n     * `memoize`, `merge`, `mergeWith`, `method`, `methodOf`, `mixin`, `negate`,\n     * `nthArg`, `omit`, `omitBy`, `once`, `orderBy`, `over`, `overArgs`,\n     * `overEvery`, `overSome`, `partial`, `partialRight`, `partition`, `pick`,\n     * `pickBy`, `plant`, `property`, `propertyOf`, `pull`, `pullAll`, `pullAllBy`,\n     * `pullAllWith`, `pullAt`, `push`, `range`, `rangeRight`, `rearg`, `reject`,\n     * `remove`, `rest`, `reverse`, `sampleSize`, `set`, `setWith`, `shuffle`,\n     * `slice`, `sort`, `sortBy`, `splice`, `spread`, `tail`, `take`, `takeRight`,\n     * `takeRightWhile`, `takeWhile`, `tap`, `throttle`, `thru`, `toArray`,\n     * `toPairs`, `toPairsIn`, `toPath`, `toPlainObject`, `transform`, `unary`,\n     * `union`, `unionBy`, `unionWith`, `uniq`, `uniqBy`, `uniqWith`, `unset`,\n     * `unshift`, `unzip`, `unzipWith`, `update`, `updateWith`, `values`,\n     * `valuesIn`, `without`, `wrap`, `xor`, `xorBy`, `xorWith`, `zip`,\n     * `zipObject`, `zipObjectDeep`, and `zipWith`\n     *\n     * The wrapper methods that are **not** chainable by default are:\n     * `add`, `attempt`, `camelCase`, `capitalize`, `ceil`, `clamp`, `clone`,\n     * `cloneDeep`, `cloneDeepWith`, `cloneWith`, `conformsTo`, `deburr`,\n     * `defaultTo`, `divide`, `each`, `eachRight`, `endsWith`, `eq`, `escape`,\n     * `escapeRegExp`, `every`, `find`, `findIndex`, `findKey`, `findLast`,\n     * `findLastIndex`, `findLastKey`, `first`, `floor`, `forEach`, `forEachRight`,\n     * `forIn`, `forInRight`, `forOwn`, `forOwnRight`, `get`, `gt`, `gte`, `has`,\n     * `hasIn`, `head`, `identity`, `includes`, `indexOf`, `inRange`, `invoke`,\n     * `isArguments`, `isArray`, `isArrayBuffer`, `isArrayLike`, `isArrayLikeObject`,\n     * `isBoolean`, `isBuffer`, `isDate`, `isElement`, `isEmpty`, `isEqual`,\n     * `isEqualWith`, `isError`, `isFinite`, `isFunction`, `isInteger`, `isLength`,\n     * `isMap`, `isMatch`, `isMatchWith`, `isNaN`, `isNative`, `isNil`, `isNull`,\n     * `isNumber`, `isObject`, `isObjectLike`, `isPlainObject`, `isRegExp`,\n     * `isSafeInteger`, `isSet`, `isString`, `isUndefined`, `isTypedArray`,\n     * `isWeakMap`, `isWeakSet`, `join`, `kebabCase`, `last`, `lastIndexOf`,\n     * `lowerCase`, `lowerFirst`, `lt`, `lte`, `max`, `maxBy`, `mean`, `meanBy`,\n     * `min`, `minBy`, `multiply`, `noConflict`, `noop`, `now`, `nth`, `pad`,\n     * `padEnd`, `padStart`, `parseInt`, `pop`, `random`, `reduce`, `reduceRight`,\n     * `repeat`, `result`, `round`, `runInContext`, `sample`, `shift`, `size`,\n     * `snakeCase`, `some`, `sortedIndex`, `sortedIndexBy`, `sortedLastIndex`,\n     * `sortedLastIndexBy`, `startCase`, `startsWith`, `stubArray`, `stubFalse`,\n     * `stubObject`, `stubString`, `stubTrue`, `subtract`, `sum`, `sumBy`,\n     * `template`, `times`, `toFinite`, `toInteger`, `toJSON`, `toLength`,\n     * `toLower`, `toNumber`, `toSafeInteger`, `toString`, `toUpper`, `trim`,\n     * `trimEnd`, `trimStart`, `truncate`, `unescape`, `uniqueId`, `upperCase`,\n     * `upperFirst`, `value`, and `words`\n     *\n     * @name _\n     * @constructor\n     * @category Seq\n     * @param {*} value The value to wrap in a `lodash` instance.\n     * @returns {Object} Returns the new `lodash` wrapper instance.\n     * @example\n     *\n     * function square(n) {\n     *   return n * n;\n     * }\n     *\n     * var wrapped = _([1, 2, 3]);\n     *\n     * // Returns an unwrapped value.\n     * wrapped.reduce(_.add);\n     * // => 6\n     *\n     * // Returns a wrapped value.\n     * var squares = wrapped.map(square);\n     *\n     * _.isArray(squares);\n     * // => false\n     *\n     * _.isArray(squares.value());\n     * // => true\n     */\n    function lodash(value) {\n      if (isObjectLike(value) && !isArray(value) && !(value instanceof LazyWrapper)) {\n        if (value instanceof LodashWrapper) {\n          return value;\n        }\n        if (hasOwnProperty.call(value, '__wrapped__')) {\n          return wrapperClone(value);\n        }\n      }\n      return new LodashWrapper(value);\n    }\n\n    /**\n     * The base implementation of `_.create` without support for assigning\n     * properties to the created object.\n     *\n     * @private\n     * @param {Object} proto The object to inherit from.\n     * @returns {Object} Returns the new object.\n     */\n    var baseCreate = (function() {\n      function object() {}\n      return function(proto) {\n        if (!isObject(proto)) {\n          return {};\n        }\n        if (objectCreate) {\n          return objectCreate(proto);\n        }\n        object.prototype = proto;\n        var result = new object;\n        object.prototype = undefined;\n        return result;\n      };\n    }());\n\n    /**\n     * The function whose prototype chain sequence wrappers inherit from.\n     *\n     * @private\n     */\n    function baseLodash() {\n      // No operation performed.\n    }\n\n    /**\n     * The base constructor for creating `lodash` wrapper objects.\n     *\n     * @private\n     * @param {*} value The value to wrap.\n     * @param {boolean} [chainAll] Enable explicit method chain sequences.\n     */\n    function LodashWrapper(value, chainAll) {\n      this.__wrapped__ = value;\n      this.__actions__ = [];\n      this.__chain__ = !!chainAll;\n      this.__index__ = 0;\n      this.__values__ = undefined;\n    }\n\n    /**\n     * By default, the template delimiters used by lodash are like those in\n     * embedded Ruby (ERB) as well as ES2015 template strings. Change the\n     * following template settings to use alternative delimiters.\n     *\n     * @static\n     * @memberOf _\n     * @type {Object}\n     */\n    lodash.templateSettings = {\n\n      /**\n       * Used to detect `data` property values to be HTML-escaped.\n       *\n       * @memberOf _.templateSettings\n       * @type {RegExp}\n       */\n      'escape': reEscape,\n\n      /**\n       * Used to detect code to be evaluated.\n       *\n       * @memberOf _.templateSettings\n       * @type {RegExp}\n       */\n      'evaluate': reEvaluate,\n\n      /**\n       * Used to detect `data` property values to inject.\n       *\n       * @memberOf _.templateSettings\n       * @type {RegExp}\n       */\n      'interpolate': reInterpolate,\n\n      /**\n       * Used to reference the data object in the template text.\n       *\n       * @memberOf _.templateSettings\n       * @type {string}\n       */\n      'variable': '',\n\n      /**\n       * Used to import variables into the compiled template.\n       *\n       * @memberOf _.templateSettings\n       * @type {Object}\n       */\n      'imports': {\n\n        /**\n         * A reference to the `lodash` function.\n         *\n         * @memberOf _.templateSettings.imports\n         * @type {Function}\n         */\n        '_': lodash\n      }\n    };\n\n    // Ensure wrappers are instances of `baseLodash`.\n    lodash.prototype = baseLodash.prototype;\n    lodash.prototype.constructor = lodash;\n\n    LodashWrapper.prototype = baseCreate(baseLodash.prototype);\n    LodashWrapper.prototype.constructor = LodashWrapper;\n\n    /*------------------------------------------------------------------------*/\n\n    /**\n     * Creates a lazy wrapper object which wraps `value` to enable lazy evaluation.\n     *\n     * @private\n     * @constructor\n     * @param {*} value The value to wrap.\n     */\n    function LazyWrapper(value) {\n      this.__wrapped__ = value;\n      this.__actions__ = [];\n      this.__dir__ = 1;\n      this.__filtered__ = false;\n      this.__iteratees__ = [];\n      this.__takeCount__ = MAX_ARRAY_LENGTH;\n      this.__views__ = [];\n    }\n\n    /**\n     * Creates a clone of the lazy wrapper object.\n     *\n     * @private\n     * @name clone\n     * @memberOf LazyWrapper\n     * @returns {Object} Returns the cloned `LazyWrapper` object.\n     */\n    function lazyClone() {\n      var result = new LazyWrapper(this.__wrapped__);\n      result.__actions__ = copyArray(this.__actions__);\n      result.__dir__ = this.__dir__;\n      result.__filtered__ = this.__filtered__;\n      result.__iteratees__ = copyArray(this.__iteratees__);\n      result.__takeCount__ = this.__takeCount__;\n      result.__views__ = copyArray(this.__views__);\n      return result;\n    }\n\n    /**\n     * Reverses the direction of lazy iteration.\n     *\n     * @private\n     * @name reverse\n     * @memberOf LazyWrapper\n     * @returns {Object} Returns the new reversed `LazyWrapper` object.\n     */\n    function lazyReverse() {\n      if (this.__filtered__) {\n        var result = new LazyWrapper(this);\n        result.__dir__ = -1;\n        result.__filtered__ = true;\n      } else {\n        result = this.clone();\n        result.__dir__ *= -1;\n      }\n      return result;\n    }\n\n    /**\n     * Extracts the unwrapped value from its lazy wrapper.\n     *\n     * @private\n     * @name value\n     * @memberOf LazyWrapper\n     * @returns {*} Returns the unwrapped value.\n     */\n    function lazyValue() {\n      var array = this.__wrapped__.value(),\n          dir = this.__dir__,\n          isArr = isArray(array),\n          isRight = dir < 0,\n          arrLength = isArr ? array.length : 0,\n          view = getView(0, arrLength, this.__views__),\n          start = view.start,\n          end = view.end,\n          length = end - start,\n          index = isRight ? end : (start - 1),\n          iteratees = this.__iteratees__,\n          iterLength = iteratees.length,\n          resIndex = 0,\n          takeCount = nativeMin(length, this.__takeCount__);\n\n      if (!isArr || (!isRight && arrLength == length && takeCount == length)) {\n        return baseWrapperValue(array, this.__actions__);\n      }\n      var result = [];\n\n      outer:\n      while (length-- && resIndex < takeCount) {\n        index += dir;\n\n        var iterIndex = -1,\n            value = array[index];\n\n        while (++iterIndex < iterLength) {\n          var data = iteratees[iterIndex],\n              iteratee = data.iteratee,\n              type = data.type,\n              computed = iteratee(value);\n\n          if (type == LAZY_MAP_FLAG) {\n            value = computed;\n          } else if (!computed) {\n            if (type == LAZY_FILTER_FLAG) {\n              continue outer;\n            } else {\n              break outer;\n            }\n          }\n        }\n        result[resIndex++] = value;\n      }\n      return result;\n    }\n\n    // Ensure `LazyWrapper` is an instance of `baseLodash`.\n    LazyWrapper.prototype = baseCreate(baseLodash.prototype);\n    LazyWrapper.prototype.constructor = LazyWrapper;\n\n    /*------------------------------------------------------------------------*/\n\n    /**\n     * Creates a hash object.\n     *\n     * @private\n     * @constructor\n     * @param {Array} [entries] The key-value pairs to cache.\n     */\n    function 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    /**\n     * Removes all key-value entries from the hash.\n     *\n     * @private\n     * @name clear\n     * @memberOf Hash\n     */\n    function hashClear() {\n      this.__data__ = nativeCreate ? nativeCreate(null) : {};\n      this.size = 0;\n    }\n\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     */\n    function hashDelete(key) {\n      var result = this.has(key) && delete this.__data__[key];\n      this.size -= result ? 1 : 0;\n      return result;\n    }\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     */\n    function 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\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     */\n    function hashHas(key) {\n      var data = this.__data__;\n      return nativeCreate ? (data[key] !== undefined) : hasOwnProperty.call(data, key);\n    }\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     */\n    function 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\n    // Add methods to `Hash`.\n    Hash.prototype.clear = hashClear;\n    Hash.prototype['delete'] = hashDelete;\n    Hash.prototype.get = hashGet;\n    Hash.prototype.has = hashHas;\n    Hash.prototype.set = hashSet;\n\n    /*------------------------------------------------------------------------*/\n\n    /**\n     * Creates an list cache object.\n     *\n     * @private\n     * @constructor\n     * @param {Array} [entries] The key-value pairs to cache.\n     */\n    function 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    /**\n     * Removes all key-value entries from the list cache.\n     *\n     * @private\n     * @name clear\n     * @memberOf ListCache\n     */\n    function listCacheClear() {\n      this.__data__ = [];\n      this.size = 0;\n    }\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     */\n    function 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\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     */\n    function listCacheGet(key) {\n      var data = this.__data__,\n          index = assocIndexOf(data, key);\n\n      return index < 0 ? undefined : data[index][1];\n    }\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     */\n    function listCacheHas(key) {\n      return assocIndexOf(this.__data__, key) > -1;\n    }\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     */\n    function 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\n    // Add methods to `ListCache`.\n    ListCache.prototype.clear = listCacheClear;\n    ListCache.prototype['delete'] = listCacheDelete;\n    ListCache.prototype.get = listCacheGet;\n    ListCache.prototype.has = listCacheHas;\n    ListCache.prototype.set = listCacheSet;\n\n    /*------------------------------------------------------------------------*/\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     */\n    function 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    /**\n     * Removes all key-value entries from the map.\n     *\n     * @private\n     * @name clear\n     * @memberOf MapCache\n     */\n    function mapCacheClear() {\n      this.size = 0;\n      this.__data__ = {\n        'hash': new Hash,\n        'map': new (Map || ListCache),\n        'string': new Hash\n      };\n    }\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     */\n    function mapCacheDelete(key) {\n      var result = getMapData(this, key)['delete'](key);\n      this.size -= result ? 1 : 0;\n      return result;\n    }\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     */\n    function mapCacheGet(key) {\n      return getMapData(this, key).get(key);\n    }\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     */\n    function mapCacheHas(key) {\n      return getMapData(this, key).has(key);\n    }\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     */\n    function 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\n    // Add methods to `MapCache`.\n    MapCache.prototype.clear = mapCacheClear;\n    MapCache.prototype['delete'] = mapCacheDelete;\n    MapCache.prototype.get = mapCacheGet;\n    MapCache.prototype.has = mapCacheHas;\n    MapCache.prototype.set = mapCacheSet;\n\n    /*------------------------------------------------------------------------*/\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     */\n    function 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    /**\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     */\n    function setCacheAdd(value) {\n      this.__data__.set(value, HASH_UNDEFINED);\n      return this;\n    }\n\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     */\n    function setCacheHas(value) {\n      return this.__data__.has(value);\n    }\n\n    // Add methods to `SetCache`.\n    SetCache.prototype.add = SetCache.prototype.push = setCacheAdd;\n    SetCache.prototype.has = setCacheHas;\n\n    /*------------------------------------------------------------------------*/\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     */\n    function Stack(entries) {\n      var data = this.__data__ = new ListCache(entries);\n      this.size = data.size;\n    }\n\n    /**\n     * Removes all key-value entries from the stack.\n     *\n     * @private\n     * @name clear\n     * @memberOf Stack\n     */\n    function stackClear() {\n      this.__data__ = new ListCache;\n      this.size = 0;\n    }\n\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     */\n    function stackDelete(key) {\n      var data = this.__data__,\n          result = data['delete'](key);\n\n      this.size = data.size;\n      return result;\n    }\n\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     */\n    function stackGet(key) {\n      return this.__data__.get(key);\n    }\n\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     */\n    function stackHas(key) {\n      return this.__data__.has(key);\n    }\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     */\n    function 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\n    // Add methods to `Stack`.\n    Stack.prototype.clear = stackClear;\n    Stack.prototype['delete'] = stackDelete;\n    Stack.prototype.get = stackGet;\n    Stack.prototype.has = stackHas;\n    Stack.prototype.set = stackSet;\n\n    /*------------------------------------------------------------------------*/\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     */\n    function 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\n    /**\n     * A specialized version of `_.sample` for arrays.\n     *\n     * @private\n     * @param {Array} array The array to sample.\n     * @returns {*} Returns the random element.\n     */\n    function arraySample(array) {\n      var length = array.length;\n      return length ? array[baseRandom(0, length - 1)] : undefined;\n    }\n\n    /**\n     * A specialized version of `_.sampleSize` for arrays.\n     *\n     * @private\n     * @param {Array} array The array to sample.\n     * @param {number} n The number of elements to sample.\n     * @returns {Array} Returns the random elements.\n     */\n    function arraySampleSize(array, n) {\n      return shuffleSelf(copyArray(array), baseClamp(n, 0, array.length));\n    }\n\n    /**\n     * A specialized version of `_.shuffle` for arrays.\n     *\n     * @private\n     * @param {Array} array The array to shuffle.\n     * @returns {Array} Returns the new shuffled array.\n     */\n    function arrayShuffle(array) {\n      return shuffleSelf(copyArray(array));\n    }\n\n    /**\n     * This function is like `assignValue` except that it doesn't assign\n     * `undefined` values.\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     */\n    function assignMergeValue(object, key, value) {\n      if ((value !== undefined && !eq(object[key], value)) ||\n          (value === undefined && !(key in object))) {\n        baseAssignValue(object, key, value);\n      }\n    }\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     */\n    function 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\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     */\n    function 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\n    /**\n     * Aggregates elements of `collection` on `accumulator` with keys transformed\n     * by `iteratee` and values set by `setter`.\n     *\n     * @private\n     * @param {Array|Object} collection The collection to iterate over.\n     * @param {Function} setter The function to set `accumulator` values.\n     * @param {Function} iteratee The iteratee to transform keys.\n     * @param {Object} accumulator The initial aggregated object.\n     * @returns {Function} Returns `accumulator`.\n     */\n    function baseAggregator(collection, setter, iteratee, accumulator) {\n      baseEach(collection, function(value, key, collection) {\n        setter(accumulator, value, iteratee(value), collection);\n      });\n      return accumulator;\n    }\n\n    /**\n     * The base implementation of `_.assign` without support for multiple sources\n     * or `customizer` functions.\n     *\n     * @private\n     * @param {Object} object The destination object.\n     * @param {Object} source The source object.\n     * @returns {Object} Returns `object`.\n     */\n    function baseAssign(object, source) {\n      return object && copyObject(source, keys(source), object);\n    }\n\n    /**\n     * The base implementation of `_.assignIn` without support for multiple sources\n     * or `customizer` functions.\n     *\n     * @private\n     * @param {Object} object The destination object.\n     * @param {Object} source The source object.\n     * @returns {Object} Returns `object`.\n     */\n    function baseAssignIn(object, source) {\n      return object && copyObject(source, keysIn(source), object);\n    }\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     */\n    function 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\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     */\n    function 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\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     */\n    function 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\n    /**\n     * The base implementation of `_.clone` and `_.cloneDeep` which tracks\n     * traversed objects.\n     *\n     * @private\n     * @param {*} value The value to clone.\n     * @param {boolean} bitmask The bitmask flags.\n     *  1 - Deep clone\n     *  2 - Flatten inherited properties\n     *  4 - Clone symbols\n     * @param {Function} [customizer] The function to customize cloning.\n     * @param {string} [key] The key of `value`.\n     * @param {Object} [object] The parent object of `value`.\n     * @param {Object} [stack] Tracks traversed objects and their clone counterparts.\n     * @returns {*} Returns the cloned value.\n     */\n    function baseClone(value, bitmask, customizer, key, object, stack) {\n      var result,\n          isDeep = bitmask & CLONE_DEEP_FLAG,\n          isFlat = bitmask & CLONE_FLAT_FLAG,\n          isFull = bitmask & CLONE_SYMBOLS_FLAG;\n\n      if (customizer) {\n        result = object ? customizer(value, key, object, stack) : customizer(value);\n      }\n      if (result !== undefined) {\n        return result;\n      }\n      if (!isObject(value)) {\n        return value;\n      }\n      var isArr = isArray(value);\n      if (isArr) {\n        result = initCloneArray(value);\n        if (!isDeep) {\n          return copyArray(value, result);\n        }\n      } else {\n        var tag = getTag(value),\n            isFunc = tag == funcTag || tag == genTag;\n\n        if (isBuffer(value)) {\n          return cloneBuffer(value, isDeep);\n        }\n        if (tag == objectTag || tag == argsTag || (isFunc && !object)) {\n          result = (isFlat || isFunc) ? {} : initCloneObject(value);\n          if (!isDeep) {\n            return isFlat\n              ? copySymbolsIn(value, baseAssignIn(result, value))\n              : copySymbols(value, baseAssign(result, value));\n          }\n        } else {\n          if (!cloneableTags[tag]) {\n            return object ? value : {};\n          }\n          result = initCloneByTag(value, tag, isDeep);\n        }\n      }\n      // Check for circular references and return its corresponding clone.\n      stack || (stack = new Stack);\n      var stacked = stack.get(value);\n      if (stacked) {\n        return stacked;\n      }\n      stack.set(value, result);\n\n      if (isSet(value)) {\n        value.forEach(function(subValue) {\n          result.add(baseClone(subValue, bitmask, customizer, subValue, value, stack));\n        });\n      } else if (isMap(value)) {\n        value.forEach(function(subValue, key) {\n          result.set(key, baseClone(subValue, bitmask, customizer, key, value, stack));\n        });\n      }\n\n      var keysFunc = isFull\n        ? (isFlat ? getAllKeysIn : getAllKeys)\n        : (isFlat ? keysIn : keys);\n\n      var props = isArr ? undefined : keysFunc(value);\n      arrayEach(props || value, function(subValue, key) {\n        if (props) {\n          key = subValue;\n          subValue = value[key];\n        }\n        // Recursively populate clone (susceptible to call stack limits).\n        assignValue(result, key, baseClone(subValue, bitmask, customizer, key, value, stack));\n      });\n      return result;\n    }\n\n    /**\n     * The base implementation of `_.conforms` which doesn't clone `source`.\n     *\n     * @private\n     * @param {Object} source The object of property predicates to conform to.\n     * @returns {Function} Returns the new spec function.\n     */\n    function baseConforms(source) {\n      var props = keys(source);\n      return function(object) {\n        return baseConformsTo(object, source, props);\n      };\n    }\n\n    /**\n     * The base implementation of `_.conformsTo` which accepts `props` to check.\n     *\n     * @private\n     * @param {Object} object The object to inspect.\n     * @param {Object} source The object of property predicates to conform to.\n     * @returns {boolean} Returns `true` if `object` conforms, else `false`.\n     */\n    function baseConformsTo(object, source, props) {\n      var length = props.length;\n      if (object == null) {\n        return !length;\n      }\n      object = Object(object);\n      while (length--) {\n        var key = props[length],\n            predicate = source[key],\n            value = object[key];\n\n        if ((value === undefined && !(key in object)) || !predicate(value)) {\n          return false;\n        }\n      }\n      return true;\n    }\n\n    /**\n     * The base implementation of `_.delay` and `_.defer` which accepts `args`\n     * to provide to `func`.\n     *\n     * @private\n     * @param {Function} func The function to delay.\n     * @param {number} wait The number of milliseconds to delay invocation.\n     * @param {Array} args The arguments to provide to `func`.\n     * @returns {number|Object} Returns the timer id or timeout object.\n     */\n    function baseDelay(func, wait, args) {\n      if (typeof func != 'function') {\n        throw new TypeError(FUNC_ERROR_TEXT);\n      }\n      return setTimeout(function() { func.apply(undefined, args); }, wait);\n    }\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     */\n    function 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\n    /**\n     * The base implementation of `_.forEach` without support for iteratee shorthands.\n     *\n     * @private\n     * @param {Array|Object} collection The collection to iterate over.\n     * @param {Function} iteratee The function invoked per iteration.\n     * @returns {Array|Object} Returns `collection`.\n     */\n    var baseEach = createBaseEach(baseForOwn);\n\n    /**\n     * The base implementation of `_.forEachRight` without support for iteratee shorthands.\n     *\n     * @private\n     * @param {Array|Object} collection The collection to iterate over.\n     * @param {Function} iteratee The function invoked per iteration.\n     * @returns {Array|Object} Returns `collection`.\n     */\n    var baseEachRight = createBaseEach(baseForOwnRight, true);\n\n    /**\n     * The base implementation of `_.every` without support for iteratee shorthands.\n     *\n     * @private\n     * @param {Array|Object} collection The collection to iterate over.\n     * @param {Function} predicate The function invoked per iteration.\n     * @returns {boolean} Returns `true` if all elements pass the predicate check,\n     *  else `false`\n     */\n    function baseEvery(collection, predicate) {\n      var result = true;\n      baseEach(collection, function(value, index, collection) {\n        result = !!predicate(value, index, collection);\n        return result;\n      });\n      return result;\n    }\n\n    /**\n     * The base implementation of methods like `_.max` and `_.min` which accepts a\n     * `comparator` to determine the extremum value.\n     *\n     * @private\n     * @param {Array} array The array to iterate over.\n     * @param {Function} iteratee The iteratee invoked per iteration.\n     * @param {Function} comparator The comparator used to compare values.\n     * @returns {*} Returns the extremum value.\n     */\n    function baseExtremum(array, iteratee, comparator) {\n      var index = -1,\n          length = array.length;\n\n      while (++index < length) {\n        var value = array[index],\n            current = iteratee(value);\n\n        if (current != null && (computed === undefined\n              ? (current === current && !isSymbol(current))\n              : comparator(current, computed)\n            )) {\n          var computed = current,\n              result = value;\n        }\n      }\n      return result;\n    }\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     */\n    function 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\n    /**\n     * The base implementation of `_.filter` without support for iteratee shorthands.\n     *\n     * @private\n     * @param {Array|Object} collection The collection to iterate over.\n     * @param {Function} predicate The function invoked per iteration.\n     * @returns {Array} Returns the new filtered array.\n     */\n    function baseFilter(collection, predicate) {\n      var result = [];\n      baseEach(collection, function(value, index, collection) {\n        if (predicate(value, index, collection)) {\n          result.push(value);\n        }\n      });\n      return result;\n    }\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     */\n    function 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\n    /**\n     * The base implementation of `baseForOwn` which iterates over `object`\n     * properties returned by `keysFunc` and invokes `iteratee` for each property.\n     * Iteratee functions may exit iteration early by explicitly returning `false`.\n     *\n     * @private\n     * @param {Object} object The object to iterate over.\n     * @param {Function} iteratee The function invoked per iteration.\n     * @param {Function} keysFunc The function to get the keys of `object`.\n     * @returns {Object} Returns `object`.\n     */\n    var baseFor = createBaseFor();\n\n    /**\n     * This function is like `baseFor` except that it iterates over properties\n     * in the opposite order.\n     *\n     * @private\n     * @param {Object} object The object to iterate over.\n     * @param {Function} iteratee The function invoked per iteration.\n     * @param {Function} keysFunc The function to get the keys of `object`.\n     * @returns {Object} Returns `object`.\n     */\n    var baseForRight = createBaseFor(true);\n\n    /**\n     * The base implementation of `_.forOwn` without support for iteratee shorthands.\n     *\n     * @private\n     * @param {Object} object The object to iterate over.\n     * @param {Function} iteratee The function invoked per iteration.\n     * @returns {Object} Returns `object`.\n     */\n    function baseForOwn(object, iteratee) {\n      return object && baseFor(object, iteratee, keys);\n    }\n\n    /**\n     * The base implementation of `_.forOwnRight` without support for iteratee shorthands.\n     *\n     * @private\n     * @param {Object} object The object to iterate over.\n     * @param {Function} iteratee The function invoked per iteration.\n     * @returns {Object} Returns `object`.\n     */\n    function baseForOwnRight(object, iteratee) {\n      return object && baseForRight(object, iteratee, keys);\n    }\n\n    /**\n     * The base implementation of `_.functions` which creates an array of\n     * `object` function property names filtered from `props`.\n     *\n     * @private\n     * @param {Object} object The object to inspect.\n     * @param {Array} props The property names to filter.\n     * @returns {Array} Returns the function names.\n     */\n    function baseFunctions(object, props) {\n      return arrayFilter(props, function(key) {\n        return isFunction(object[key]);\n      });\n    }\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     */\n    function 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\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     */\n    function baseGetAllKeys(object, keysFunc, symbolsFunc) {\n      var result = keysFunc(object);\n      return isArray(object) ? result : arrayPush(result, symbolsFunc(object));\n    }\n\n    /**\n     * The base implementation of `getTag` without fallbacks for buggy environments.\n     *\n     * @private\n     * @param {*} value The value to query.\n     * @returns {string} Returns the `toStringTag`.\n     */\n    function baseGetTag(value) {\n      if (value == null) {\n        return value === undefined ? undefinedTag : nullTag;\n      }\n      return (symToStringTag && symToStringTag in Object(value))\n        ? getRawTag(value)\n        : objectToString(value);\n    }\n\n    /**\n     * The base implementation of `_.gt` which doesn't coerce arguments.\n     *\n     * @private\n     * @param {*} value The value to compare.\n     * @param {*} other The other value to compare.\n     * @returns {boolean} Returns `true` if `value` is greater than `other`,\n     *  else `false`.\n     */\n    function baseGt(value, other) {\n      return value > other;\n    }\n\n    /**\n     * The base implementation of `_.has` 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     */\n    function baseHas(object, key) {\n      return object != null && hasOwnProperty.call(object, key);\n    }\n\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     */\n    function baseHasIn(object, key) {\n      return object != null && key in Object(object);\n    }\n\n    /**\n     * The base implementation of `_.inRange` which doesn't coerce arguments.\n     *\n     * @private\n     * @param {number} number The number to check.\n     * @param {number} start The start of the range.\n     * @param {number} end The end of the range.\n     * @returns {boolean} Returns `true` if `number` is in the range, else `false`.\n     */\n    function baseInRange(number, start, end) {\n      return number >= nativeMin(start, end) && number < nativeMax(start, end);\n    }\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     */\n    function 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\n    /**\n     * The base implementation of `_.invert` and `_.invertBy` which inverts\n     * `object` with values transformed by `iteratee` and set by `setter`.\n     *\n     * @private\n     * @param {Object} object The object to iterate over.\n     * @param {Function} setter The function to set `accumulator` values.\n     * @param {Function} iteratee The iteratee to transform values.\n     * @param {Object} accumulator The initial inverted object.\n     * @returns {Function} Returns `accumulator`.\n     */\n    function baseInverter(object, setter, iteratee, accumulator) {\n      baseForOwn(object, function(value, key, object) {\n        setter(accumulator, iteratee(value), key, object);\n      });\n      return accumulator;\n    }\n\n    /**\n     * The base implementation of `_.invoke` without support for individual\n     * method arguments.\n     *\n     * @private\n     * @param {Object} object The object to query.\n     * @param {Array|string} path The path of the method to invoke.\n     * @param {Array} args The arguments to invoke the method with.\n     * @returns {*} Returns the result of the invoked method.\n     */\n    function baseInvoke(object, path, args) {\n      path = castPath(path, object);\n      object = parent(object, path);\n      var func = object == null ? object : object[toKey(last(path))];\n      return func == null ? undefined : apply(func, object, args);\n    }\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     */\n    function baseIsArguments(value) {\n      return isObjectLike(value) && baseGetTag(value) == argsTag;\n    }\n\n    /**\n     * The base implementation of `_.isArrayBuffer` without Node.js optimizations.\n     *\n     * @private\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is an array buffer, else `false`.\n     */\n    function baseIsArrayBuffer(value) {\n      return isObjectLike(value) && baseGetTag(value) == arrayBufferTag;\n    }\n\n    /**\n     * The base implementation of `_.isDate` without Node.js optimizations.\n     *\n     * @private\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is a date object, else `false`.\n     */\n    function baseIsDate(value) {\n      return isObjectLike(value) && baseGetTag(value) == dateTag;\n    }\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     */\n    function 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\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     */\n    function 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\n    /**\n     * The base implementation of `_.isMap` without Node.js optimizations.\n     *\n     * @private\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is a map, else `false`.\n     */\n    function baseIsMap(value) {\n      return isObjectLike(value) && getTag(value) == mapTag;\n    }\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     */\n    function 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\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     */\n    function 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\n    /**\n     * The base implementation of `_.isRegExp` without Node.js optimizations.\n     *\n     * @private\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is a regexp, else `false`.\n     */\n    function baseIsRegExp(value) {\n      return isObjectLike(value) && baseGetTag(value) == regexpTag;\n    }\n\n    /**\n     * The base implementation of `_.isSet` without Node.js optimizations.\n     *\n     * @private\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is a set, else `false`.\n     */\n    function baseIsSet(value) {\n      return isObjectLike(value) && getTag(value) == setTag;\n    }\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     */\n    function baseIsTypedArray(value) {\n      return isObjectLike(value) &&\n        isLength(value.length) && !!typedArrayTags[baseGetTag(value)];\n    }\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     */\n    function 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\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     */\n    function 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\n    /**\n     * The base implementation of `_.keysIn` 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     */\n    function baseKeysIn(object) {\n      if (!isObject(object)) {\n        return nativeKeysIn(object);\n      }\n      var isProto = isPrototype(object),\n          result = [];\n\n      for (var key in object) {\n        if (!(key == 'constructor' && (isProto || !hasOwnProperty.call(object, key)))) {\n          result.push(key);\n        }\n      }\n      return result;\n    }\n\n    /**\n     * The base implementation of `_.lt` which doesn't coerce arguments.\n     *\n     * @private\n     * @param {*} value The value to compare.\n     * @param {*} other The other value to compare.\n     * @returns {boolean} Returns `true` if `value` is less than `other`,\n     *  else `false`.\n     */\n    function baseLt(value, other) {\n      return value < other;\n    }\n\n    /**\n     * The base implementation of `_.map` without support for iteratee shorthands.\n     *\n     * @private\n     * @param {Array|Object} collection The collection to iterate over.\n     * @param {Function} iteratee The function invoked per iteration.\n     * @returns {Array} Returns the new mapped array.\n     */\n    function baseMap(collection, iteratee) {\n      var index = -1,\n          result = isArrayLike(collection) ? Array(collection.length) : [];\n\n      baseEach(collection, function(value, key, collection) {\n        result[++index] = iteratee(value, key, collection);\n      });\n      return result;\n    }\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     */\n    function 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\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     */\n    function 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\n    /**\n     * The base implementation of `_.merge` without support for multiple sources.\n     *\n     * @private\n     * @param {Object} object The destination object.\n     * @param {Object} source The source object.\n     * @param {number} srcIndex The index of `source`.\n     * @param {Function} [customizer] The function to customize merged values.\n     * @param {Object} [stack] Tracks traversed source values and their merged\n     *  counterparts.\n     */\n    function baseMerge(object, source, srcIndex, customizer, stack) {\n      if (object === source) {\n        return;\n      }\n      baseFor(source, function(srcValue, key) {\n        stack || (stack = new Stack);\n        if (isObject(srcValue)) {\n          baseMergeDeep(object, source, key, srcIndex, baseMerge, customizer, stack);\n        }\n        else {\n          var newValue = customizer\n            ? customizer(safeGet(object, key), srcValue, (key + ''), object, source, stack)\n            : undefined;\n\n          if (newValue === undefined) {\n            newValue = srcValue;\n          }\n          assignMergeValue(object, key, newValue);\n        }\n      }, keysIn);\n    }\n\n    /**\n     * A specialized version of `baseMerge` for arrays and objects which performs\n     * deep merges and tracks traversed objects enabling objects with circular\n     * references to be merged.\n     *\n     * @private\n     * @param {Object} object The destination object.\n     * @param {Object} source The source object.\n     * @param {string} key The key of the value to merge.\n     * @param {number} srcIndex The index of `source`.\n     * @param {Function} mergeFunc The function to merge values.\n     * @param {Function} [customizer] The function to customize assigned values.\n     * @param {Object} [stack] Tracks traversed source values and their merged\n     *  counterparts.\n     */\n    function baseMergeDeep(object, source, key, srcIndex, mergeFunc, customizer, stack) {\n      var objValue = safeGet(object, key),\n          srcValue = safeGet(source, key),\n          stacked = stack.get(srcValue);\n\n      if (stacked) {\n        assignMergeValue(object, key, stacked);\n        return;\n      }\n      var newValue = customizer\n        ? customizer(objValue, srcValue, (key + ''), object, source, stack)\n        : undefined;\n\n      var isCommon = newValue === undefined;\n\n      if (isCommon) {\n        var isArr = isArray(srcValue),\n            isBuff = !isArr && isBuffer(srcValue),\n            isTyped = !isArr && !isBuff && isTypedArray(srcValue);\n\n        newValue = srcValue;\n        if (isArr || isBuff || isTyped) {\n          if (isArray(objValue)) {\n            newValue = objValue;\n          }\n          else if (isArrayLikeObject(objValue)) {\n            newValue = copyArray(objValue);\n          }\n          else if (isBuff) {\n            isCommon = false;\n            newValue = cloneBuffer(srcValue, true);\n          }\n          else if (isTyped) {\n            isCommon = false;\n            newValue = cloneTypedArray(srcValue, true);\n          }\n          else {\n            newValue = [];\n          }\n        }\n        else if (isPlainObject(srcValue) || isArguments(srcValue)) {\n          newValue = objValue;\n          if (isArguments(objValue)) {\n            newValue = toPlainObject(objValue);\n          }\n          else if (!isObject(objValue) || isFunction(objValue)) {\n            newValue = initCloneObject(srcValue);\n          }\n        }\n        else {\n          isCommon = false;\n        }\n      }\n      if (isCommon) {\n        // Recursively merge objects and arrays (susceptible to call stack limits).\n        stack.set(srcValue, newValue);\n        mergeFunc(newValue, srcValue, srcIndex, customizer, stack);\n        stack['delete'](srcValue);\n      }\n      assignMergeValue(object, key, newValue);\n    }\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     */\n    function 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\n    /**\n     * The base implementation of `_.orderBy` without param guards.\n     *\n     * @private\n     * @param {Array|Object} collection The collection to iterate over.\n     * @param {Function[]|Object[]|string[]} iteratees The iteratees to sort by.\n     * @param {string[]} orders The sort orders of `iteratees`.\n     * @returns {Array} Returns the new sorted array.\n     */\n    function baseOrderBy(collection, iteratees, orders) {\n      if (iteratees.length) {\n        iteratees = arrayMap(iteratees, function(iteratee) {\n          if (isArray(iteratee)) {\n            return function(value) {\n              return baseGet(value, iteratee.length === 1 ? iteratee[0] : iteratee);\n            }\n          }\n          return iteratee;\n        });\n      } else {\n        iteratees = [identity];\n      }\n\n      var index = -1;\n      iteratees = arrayMap(iteratees, baseUnary(getIteratee()));\n\n      var result = baseMap(collection, function(value, key, collection) {\n        var criteria = arrayMap(iteratees, function(iteratee) {\n          return iteratee(value);\n        });\n        return { 'criteria': criteria, 'index': ++index, 'value': value };\n      });\n\n      return baseSortBy(result, function(object, other) {\n        return compareMultiple(object, other, orders);\n      });\n    }\n\n    /**\n     * The base implementation of `_.pick` without support for individual\n     * property identifiers.\n     *\n     * @private\n     * @param {Object} object The source object.\n     * @param {string[]} paths The property paths to pick.\n     * @returns {Object} Returns the new object.\n     */\n    function basePick(object, paths) {\n      return basePickBy(object, paths, function(value, path) {\n        return hasIn(object, path);\n      });\n    }\n\n    /**\n     * The base implementation of  `_.pickBy` without support for iteratee shorthands.\n     *\n     * @private\n     * @param {Object} object The source object.\n     * @param {string[]} paths The property paths to pick.\n     * @param {Function} predicate The function invoked per property.\n     * @returns {Object} Returns the new object.\n     */\n    function basePickBy(object, paths, predicate) {\n      var index = -1,\n          length = paths.length,\n          result = {};\n\n      while (++index < length) {\n        var path = paths[index],\n            value = baseGet(object, path);\n\n        if (predicate(value, path)) {\n          baseSet(result, castPath(path, object), value);\n        }\n      }\n      return result;\n    }\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     */\n    function basePropertyDeep(path) {\n      return function(object) {\n        return baseGet(object, path);\n      };\n    }\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     */\n    function 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\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     */\n    function 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\n    /**\n     * The base implementation of `_.random` without support for returning\n     * floating-point numbers.\n     *\n     * @private\n     * @param {number} lower The lower bound.\n     * @param {number} upper The upper bound.\n     * @returns {number} Returns the random number.\n     */\n    function baseRandom(lower, upper) {\n      return lower + nativeFloor(nativeRandom() * (upper - lower + 1));\n    }\n\n    /**\n     * The base implementation of `_.range` and `_.rangeRight` which doesn't\n     * coerce arguments.\n     *\n     * @private\n     * @param {number} start The start of the range.\n     * @param {number} end The end of the range.\n     * @param {number} step The value to increment or decrement by.\n     * @param {boolean} [fromRight] Specify iterating from right to left.\n     * @returns {Array} Returns the range of numbers.\n     */\n    function baseRange(start, end, step, fromRight) {\n      var index = -1,\n          length = nativeMax(nativeCeil((end - start) / (step || 1)), 0),\n          result = Array(length);\n\n      while (length--) {\n        result[fromRight ? length : ++index] = start;\n        start += step;\n      }\n      return result;\n    }\n\n    /**\n     * The base implementation of `_.repeat` which doesn't coerce arguments.\n     *\n     * @private\n     * @param {string} string The string to repeat.\n     * @param {number} n The number of times to repeat the string.\n     * @returns {string} Returns the repeated string.\n     */\n    function baseRepeat(string, n) {\n      var result = '';\n      if (!string || n < 1 || n > MAX_SAFE_INTEGER) {\n        return result;\n      }\n      // Leverage the exponentiation by squaring algorithm for a faster repeat.\n      // See https://en.wikipedia.org/wiki/Exponentiation_by_squaring for more details.\n      do {\n        if (n % 2) {\n          result += string;\n        }\n        n = nativeFloor(n / 2);\n        if (n) {\n          string += string;\n        }\n      } while (n);\n\n      return result;\n    }\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     */\n    function baseRest(func, start) {\n      return setToString(overRest(func, start, identity), func + '');\n    }\n\n    /**\n     * The base implementation of `_.sample`.\n     *\n     * @private\n     * @param {Array|Object} collection The collection to sample.\n     * @returns {*} Returns the random element.\n     */\n    function baseSample(collection) {\n      return arraySample(values(collection));\n    }\n\n    /**\n     * The base implementation of `_.sampleSize` without param guards.\n     *\n     * @private\n     * @param {Array|Object} collection The collection to sample.\n     * @param {number} n The number of elements to sample.\n     * @returns {Array} Returns the random elements.\n     */\n    function baseSampleSize(collection, n) {\n      var array = values(collection);\n      return shuffleSelf(array, baseClamp(n, 0, array.length));\n    }\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     */\n    function 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\n    /**\n     * The base implementation of `setData` without support for hot loop shorting.\n     *\n     * @private\n     * @param {Function} func The function to associate metadata with.\n     * @param {*} data The metadata.\n     * @returns {Function} Returns `func`.\n     */\n    var baseSetData = !metaMap ? identity : function(func, data) {\n      metaMap.set(func, data);\n      return func;\n    };\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     */\n    var 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\n    /**\n     * The base implementation of `_.shuffle`.\n     *\n     * @private\n     * @param {Array|Object} collection The collection to shuffle.\n     * @returns {Array} Returns the new shuffled array.\n     */\n    function baseShuffle(collection) {\n      return shuffleSelf(values(collection));\n    }\n\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     */\n    function 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\n    /**\n     * The base implementation of `_.some` without support for iteratee shorthands.\n     *\n     * @private\n     * @param {Array|Object} collection The collection 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     */\n    function baseSome(collection, predicate) {\n      var result;\n\n      baseEach(collection, function(value, index, collection) {\n        result = predicate(value, index, collection);\n        return !result;\n      });\n      return !!result;\n    }\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     */\n    function 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\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     */\n    function 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\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     */\n    function 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\n    /**\n     * The base implementation of `_.toNumber` which doesn't ensure correct\n     * conversions of binary, hexadecimal, or octal string values.\n     *\n     * @private\n     * @param {*} value The value to process.\n     * @returns {number} Returns the number.\n     */\n    function baseToNumber(value) {\n      if (typeof value == 'number') {\n        return value;\n      }\n      if (isSymbol(value)) {\n        return NAN;\n      }\n      return +value;\n    }\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     */\n    function 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\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     */\n    function 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\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     */\n    function baseUnset(object, path) {\n      path = castPath(path, object);\n      object = parent(object, path);\n      return object == null || delete object[toKey(last(path))];\n    }\n\n    /**\n     * The base implementation of `_.update`.\n     *\n     * @private\n     * @param {Object} object The object to modify.\n     * @param {Array|string} path The path of the property to update.\n     * @param {Function} updater The function to produce the updated value.\n     * @param {Function} [customizer] The function to customize path creation.\n     * @returns {Object} Returns `object`.\n     */\n    function baseUpdate(object, path, updater, customizer) {\n      return baseSet(object, path, updater(baseGet(object, path)), customizer);\n    }\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     */\n    function 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\n    /**\n     * The base implementation of `wrapperValue` which returns the result of\n     * performing a sequence of actions on the unwrapped `value`, where each\n     * successive action is supplied the return value of the previous.\n     *\n     * @private\n     * @param {*} value The unwrapped value.\n     * @param {Array} actions Actions to perform to resolve the unwrapped value.\n     * @returns {*} Returns the resolved value.\n     */\n    function baseWrapperValue(value, actions) {\n      var result = value;\n      if (result instanceof LazyWrapper) {\n        result = result.value();\n      }\n      return arrayReduce(actions, function(result, action) {\n        return action.func.apply(action.thisArg, arrayPush([result], action.args));\n      }, result);\n    }\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     */\n    function 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\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     */\n    function 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\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     */\n    function castArrayLikeObject(value) {\n      return isArrayLikeObject(value) ? value : [];\n    }\n\n    /**\n     * Casts `value` to `identity` if it's not a function.\n     *\n     * @private\n     * @param {*} value The value to inspect.\n     * @returns {Function} Returns cast function.\n     */\n    function castFunction(value) {\n      return typeof value == 'function' ? value : identity;\n    }\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     */\n    function castPath(value, object) {\n      if (isArray(value)) {\n        return value;\n      }\n      return isKey(value, object) ? [value] : stringToPath(toString(value));\n    }\n\n    /**\n     * A `baseRest` alias which can be replaced with `identity` by module\n     * replacement plugins.\n     *\n     * @private\n     * @type {Function}\n     * @param {Function} func The function to apply a rest parameter to.\n     * @returns {Function} Returns the new function.\n     */\n    var castRest = baseRest;\n\n    /**\n     * Casts `array` to a slice if it's needed.\n     *\n     * @private\n     * @param {Array} array The array to inspect.\n     * @param {number} start The start position.\n     * @param {number} [end=array.length] The end position.\n     * @returns {Array} Returns the cast slice.\n     */\n    function castSlice(array, start, end) {\n      var length = array.length;\n      end = end === undefined ? length : end;\n      return (!start && end >= length) ? array : baseSlice(array, start, end);\n    }\n\n    /**\n     * A simple wrapper around the global [`clearTimeout`](https://mdn.io/clearTimeout).\n     *\n     * @private\n     * @param {number|Object} id The timer id or timeout object of the timer to clear.\n     */\n    var clearTimeout = ctxClearTimeout || function(id) {\n      return root.clearTimeout(id);\n    };\n\n    /**\n     * Creates a clone of  `buffer`.\n     *\n     * @private\n     * @param {Buffer} buffer The buffer to clone.\n     * @param {boolean} [isDeep] Specify a deep clone.\n     * @returns {Buffer} Returns the cloned buffer.\n     */\n    function cloneBuffer(buffer, isDeep) {\n      if (isDeep) {\n        return buffer.slice();\n      }\n      var length = buffer.length,\n          result = allocUnsafe ? allocUnsafe(length) : new buffer.constructor(length);\n\n      buffer.copy(result);\n      return result;\n    }\n\n    /**\n     * Creates a clone of `arrayBuffer`.\n     *\n     * @private\n     * @param {ArrayBuffer} arrayBuffer The array buffer to clone.\n     * @returns {ArrayBuffer} Returns the cloned array buffer.\n     */\n    function cloneArrayBuffer(arrayBuffer) {\n      var result = new arrayBuffer.constructor(arrayBuffer.byteLength);\n      new Uint8Array(result).set(new Uint8Array(arrayBuffer));\n      return result;\n    }\n\n    /**\n     * Creates a clone of `dataView`.\n     *\n     * @private\n     * @param {Object} dataView The data view to clone.\n     * @param {boolean} [isDeep] Specify a deep clone.\n     * @returns {Object} Returns the cloned data view.\n     */\n    function cloneDataView(dataView, isDeep) {\n      var buffer = isDeep ? cloneArrayBuffer(dataView.buffer) : dataView.buffer;\n      return new dataView.constructor(buffer, dataView.byteOffset, dataView.byteLength);\n    }\n\n    /**\n     * Creates a clone of `regexp`.\n     *\n     * @private\n     * @param {Object} regexp The regexp to clone.\n     * @returns {Object} Returns the cloned regexp.\n     */\n    function cloneRegExp(regexp) {\n      var result = new regexp.constructor(regexp.source, reFlags.exec(regexp));\n      result.lastIndex = regexp.lastIndex;\n      return result;\n    }\n\n    /**\n     * Creates a clone of the `symbol` object.\n     *\n     * @private\n     * @param {Object} symbol The symbol object to clone.\n     * @returns {Object} Returns the cloned symbol object.\n     */\n    function cloneSymbol(symbol) {\n      return symbolValueOf ? Object(symbolValueOf.call(symbol)) : {};\n    }\n\n    /**\n     * Creates a clone of `typedArray`.\n     *\n     * @private\n     * @param {Object} typedArray The typed array to clone.\n     * @param {boolean} [isDeep] Specify a deep clone.\n     * @returns {Object} Returns the cloned typed array.\n     */\n    function cloneTypedArray(typedArray, isDeep) {\n      var buffer = isDeep ? cloneArrayBuffer(typedArray.buffer) : typedArray.buffer;\n      return new typedArray.constructor(buffer, typedArray.byteOffset, typedArray.length);\n    }\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     */\n    function 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\n    /**\n     * Used by `_.orderBy` to compare multiple properties of a value to another\n     * and stable sort them.\n     *\n     * If `orders` is unspecified, all values are sorted in ascending order. Otherwise,\n     * specify an order of \"desc\" for descending or \"asc\" for ascending sort order\n     * of corresponding values.\n     *\n     * @private\n     * @param {Object} object The object to compare.\n     * @param {Object} other The other object to compare.\n     * @param {boolean[]|string[]} orders The order to sort by for each property.\n     * @returns {number} Returns the sort order indicator for `object`.\n     */\n    function compareMultiple(object, other, orders) {\n      var index = -1,\n          objCriteria = object.criteria,\n          othCriteria = other.criteria,\n          length = objCriteria.length,\n          ordersLength = orders.length;\n\n      while (++index < length) {\n        var result = compareAscending(objCriteria[index], othCriteria[index]);\n        if (result) {\n          if (index >= ordersLength) {\n            return result;\n          }\n          var order = orders[index];\n          return result * (order == 'desc' ? -1 : 1);\n        }\n      }\n      // Fixes an `Array#sort` bug in the JS engine embedded in Adobe applications\n      // that causes it, under certain circumstances, to provide the same value for\n      // `object` and `other`. See https://github.com/jashkenas/underscore/pull/1247\n      // for more details.\n      //\n      // This also 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    /**\n     * Creates an array that is the composition of partially applied arguments,\n     * placeholders, and provided arguments into a single array of arguments.\n     *\n     * @private\n     * @param {Array} args The provided arguments.\n     * @param {Array} partials The arguments to prepend to those provided.\n     * @param {Array} holders The `partials` placeholder indexes.\n     * @params {boolean} [isCurried] Specify composing for a curried function.\n     * @returns {Array} Returns the new array of composed arguments.\n     */\n    function composeArgs(args, partials, holders, isCurried) {\n      var argsIndex = -1,\n          argsLength = args.length,\n          holdersLength = holders.length,\n          leftIndex = -1,\n          leftLength = partials.length,\n          rangeLength = nativeMax(argsLength - holdersLength, 0),\n          result = Array(leftLength + rangeLength),\n          isUncurried = !isCurried;\n\n      while (++leftIndex < leftLength) {\n        result[leftIndex] = partials[leftIndex];\n      }\n      while (++argsIndex < holdersLength) {\n        if (isUncurried || argsIndex < argsLength) {\n          result[holders[argsIndex]] = args[argsIndex];\n        }\n      }\n      while (rangeLength--) {\n        result[leftIndex++] = args[argsIndex++];\n      }\n      return result;\n    }\n\n    /**\n     * This function is like `composeArgs` except that the arguments composition\n     * is tailored for `_.partialRight`.\n     *\n     * @private\n     * @param {Array} args The provided arguments.\n     * @param {Array} partials The arguments to append to those provided.\n     * @param {Array} holders The `partials` placeholder indexes.\n     * @params {boolean} [isCurried] Specify composing for a curried function.\n     * @returns {Array} Returns the new array of composed arguments.\n     */\n    function composeArgsRight(args, partials, holders, isCurried) {\n      var argsIndex = -1,\n          argsLength = args.length,\n          holdersIndex = -1,\n          holdersLength = holders.length,\n          rightIndex = -1,\n          rightLength = partials.length,\n          rangeLength = nativeMax(argsLength - holdersLength, 0),\n          result = Array(rangeLength + rightLength),\n          isUncurried = !isCurried;\n\n      while (++argsIndex < rangeLength) {\n        result[argsIndex] = args[argsIndex];\n      }\n      var offset = argsIndex;\n      while (++rightIndex < rightLength) {\n        result[offset + rightIndex] = partials[rightIndex];\n      }\n      while (++holdersIndex < holdersLength) {\n        if (isUncurried || argsIndex < argsLength) {\n          result[offset + holders[holdersIndex]] = args[argsIndex++];\n        }\n      }\n      return result;\n    }\n\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     */\n    function 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\n    /**\n     * Copies properties of `source` to `object`.\n     *\n     * @private\n     * @param {Object} source The object to copy properties from.\n     * @param {Array} props The property identifiers to copy.\n     * @param {Object} [object={}] The object to copy properties to.\n     * @param {Function} [customizer] The function to customize copied values.\n     * @returns {Object} Returns `object`.\n     */\n    function copyObject(source, props, object, customizer) {\n      var isNew = !object;\n      object || (object = {});\n\n      var index = -1,\n          length = props.length;\n\n      while (++index < length) {\n        var key = props[index];\n\n        var newValue = customizer\n          ? customizer(object[key], source[key], key, object, source)\n          : undefined;\n\n        if (newValue === undefined) {\n          newValue = source[key];\n        }\n        if (isNew) {\n          baseAssignValue(object, key, newValue);\n        } else {\n          assignValue(object, key, newValue);\n        }\n      }\n      return object;\n    }\n\n    /**\n     * Copies own symbols of `source` to `object`.\n     *\n     * @private\n     * @param {Object} source The object to copy symbols from.\n     * @param {Object} [object={}] The object to copy symbols to.\n     * @returns {Object} Returns `object`.\n     */\n    function copySymbols(source, object) {\n      return copyObject(source, getSymbols(source), object);\n    }\n\n    /**\n     * Copies own and inherited symbols of `source` to `object`.\n     *\n     * @private\n     * @param {Object} source The object to copy symbols from.\n     * @param {Object} [object={}] The object to copy symbols to.\n     * @returns {Object} Returns `object`.\n     */\n    function copySymbolsIn(source, object) {\n      return copyObject(source, getSymbolsIn(source), object);\n    }\n\n    /**\n     * Creates a function like `_.groupBy`.\n     *\n     * @private\n     * @param {Function} setter The function to set accumulator values.\n     * @param {Function} [initializer] The accumulator object initializer.\n     * @returns {Function} Returns the new aggregator function.\n     */\n    function createAggregator(setter, initializer) {\n      return function(collection, iteratee) {\n        var func = isArray(collection) ? arrayAggregator : baseAggregator,\n            accumulator = initializer ? initializer() : {};\n\n        return func(collection, setter, getIteratee(iteratee, 2), accumulator);\n      };\n    }\n\n    /**\n     * Creates a function like `_.assign`.\n     *\n     * @private\n     * @param {Function} assigner The function to assign values.\n     * @returns {Function} Returns the new assigner function.\n     */\n    function createAssigner(assigner) {\n      return baseRest(function(object, sources) {\n        var index = -1,\n            length = sources.length,\n            customizer = length > 1 ? sources[length - 1] : undefined,\n            guard = length > 2 ? sources[2] : undefined;\n\n        customizer = (assigner.length > 3 && typeof customizer == 'function')\n          ? (length--, customizer)\n          : undefined;\n\n        if (guard && isIterateeCall(sources[0], sources[1], guard)) {\n          customizer = length < 3 ? undefined : customizer;\n          length = 1;\n        }\n        object = Object(object);\n        while (++index < length) {\n          var source = sources[index];\n          if (source) {\n            assigner(object, source, index, customizer);\n          }\n        }\n        return object;\n      });\n    }\n\n    /**\n     * Creates a `baseEach` or `baseEachRight` function.\n     *\n     * @private\n     * @param {Function} eachFunc The function to iterate over a collection.\n     * @param {boolean} [fromRight] Specify iterating from right to left.\n     * @returns {Function} Returns the new base function.\n     */\n    function createBaseEach(eachFunc, fromRight) {\n      return function(collection, iteratee) {\n        if (collection == null) {\n          return collection;\n        }\n        if (!isArrayLike(collection)) {\n          return eachFunc(collection, iteratee);\n        }\n        var length = collection.length,\n            index = fromRight ? length : -1,\n            iterable = Object(collection);\n\n        while ((fromRight ? index-- : ++index < length)) {\n          if (iteratee(iterable[index], index, iterable) === false) {\n            break;\n          }\n        }\n        return collection;\n      };\n    }\n\n    /**\n     * Creates a base function for methods like `_.forIn` and `_.forOwn`.\n     *\n     * @private\n     * @param {boolean} [fromRight] Specify iterating from right to left.\n     * @returns {Function} Returns the new base function.\n     */\n    function createBaseFor(fromRight) {\n      return function(object, iteratee, keysFunc) {\n        var index = -1,\n            iterable = Object(object),\n            props = keysFunc(object),\n            length = props.length;\n\n        while (length--) {\n          var key = props[fromRight ? length : ++index];\n          if (iteratee(iterable[key], key, iterable) === false) {\n            break;\n          }\n        }\n        return object;\n      };\n    }\n\n    /**\n     * Creates a function that wraps `func` to invoke it with the optional `this`\n     * binding of `thisArg`.\n     *\n     * @private\n     * @param {Function} func The function to wrap.\n     * @param {number} bitmask The bitmask flags. See `createWrap` for more details.\n     * @param {*} [thisArg] The `this` binding of `func`.\n     * @returns {Function} Returns the new wrapped function.\n     */\n    function createBind(func, bitmask, thisArg) {\n      var isBind = bitmask & WRAP_BIND_FLAG,\n          Ctor = createCtor(func);\n\n      function wrapper() {\n        var fn = (this && this !== root && this instanceof wrapper) ? Ctor : func;\n        return fn.apply(isBind ? thisArg : this, arguments);\n      }\n      return wrapper;\n    }\n\n    /**\n     * Creates a function like `_.lowerFirst`.\n     *\n     * @private\n     * @param {string} methodName The name of the `String` case method to use.\n     * @returns {Function} Returns the new case function.\n     */\n    function createCaseFirst(methodName) {\n      return function(string) {\n        string = toString(string);\n\n        var strSymbols = hasUnicode(string)\n          ? stringToArray(string)\n          : undefined;\n\n        var chr = strSymbols\n          ? strSymbols[0]\n          : string.charAt(0);\n\n        var trailing = strSymbols\n          ? castSlice(strSymbols, 1).join('')\n          : string.slice(1);\n\n        return chr[methodName]() + trailing;\n      };\n    }\n\n    /**\n     * Creates a function like `_.camelCase`.\n     *\n     * @private\n     * @param {Function} callback The function to combine each word.\n     * @returns {Function} Returns the new compounder function.\n     */\n    function createCompounder(callback) {\n      return function(string) {\n        return arrayReduce(words(deburr(string).replace(reApos, '')), callback, '');\n      };\n    }\n\n    /**\n     * Creates a function that produces an instance of `Ctor` regardless of\n     * whether it was invoked as part of a `new` expression or by `call` or `apply`.\n     *\n     * @private\n     * @param {Function} Ctor The constructor to wrap.\n     * @returns {Function} Returns the new wrapped function.\n     */\n    function createCtor(Ctor) {\n      return function() {\n        // Use a `switch` statement to work with class constructors. See\n        // http://ecma-international.org/ecma-262/7.0/#sec-ecmascript-function-objects-call-thisargument-argumentslist\n        // for more details.\n        var args = arguments;\n        switch (args.length) {\n          case 0: return new Ctor;\n          case 1: return new Ctor(args[0]);\n          case 2: return new Ctor(args[0], args[1]);\n          case 3: return new Ctor(args[0], args[1], args[2]);\n          case 4: return new Ctor(args[0], args[1], args[2], args[3]);\n          case 5: return new Ctor(args[0], args[1], args[2], args[3], args[4]);\n          case 6: return new Ctor(args[0], args[1], args[2], args[3], args[4], args[5]);\n          case 7: return new Ctor(args[0], args[1], args[2], args[3], args[4], args[5], args[6]);\n        }\n        var thisBinding = baseCreate(Ctor.prototype),\n            result = Ctor.apply(thisBinding, args);\n\n        // Mimic the constructor's `return` behavior.\n        // See https://es5.github.io/#x13.2.2 for more details.\n        return isObject(result) ? result : thisBinding;\n      };\n    }\n\n    /**\n     * Creates a function that wraps `func` to enable currying.\n     *\n     * @private\n     * @param {Function} func The function to wrap.\n     * @param {number} bitmask The bitmask flags. See `createWrap` for more details.\n     * @param {number} arity The arity of `func`.\n     * @returns {Function} Returns the new wrapped function.\n     */\n    function createCurry(func, bitmask, arity) {\n      var Ctor = createCtor(func);\n\n      function wrapper() {\n        var length = arguments.length,\n            args = Array(length),\n            index = length,\n            placeholder = getHolder(wrapper);\n\n        while (index--) {\n          args[index] = arguments[index];\n        }\n        var holders = (length < 3 && args[0] !== placeholder && args[length - 1] !== placeholder)\n          ? []\n          : replaceHolders(args, placeholder);\n\n        length -= holders.length;\n        if (length < arity) {\n          return createRecurry(\n            func, bitmask, createHybrid, wrapper.placeholder, undefined,\n            args, holders, undefined, undefined, arity - length);\n        }\n        var fn = (this && this !== root && this instanceof wrapper) ? Ctor : func;\n        return apply(fn, this, args);\n      }\n      return wrapper;\n    }\n\n    /**\n     * Creates a `_.find` or `_.findLast` function.\n     *\n     * @private\n     * @param {Function} findIndexFunc The function to find the collection index.\n     * @returns {Function} Returns the new find function.\n     */\n    function createFind(findIndexFunc) {\n      return function(collection, predicate, fromIndex) {\n        var iterable = Object(collection);\n        if (!isArrayLike(collection)) {\n          var iteratee = getIteratee(predicate, 3);\n          collection = keys(collection);\n          predicate = function(key) { return iteratee(iterable[key], key, iterable); };\n        }\n        var index = findIndexFunc(collection, predicate, fromIndex);\n        return index > -1 ? iterable[iteratee ? collection[index] : index] : undefined;\n      };\n    }\n\n    /**\n     * Creates a `_.flow` or `_.flowRight` function.\n     *\n     * @private\n     * @param {boolean} [fromRight] Specify iterating from right to left.\n     * @returns {Function} Returns the new flow function.\n     */\n    function createFlow(fromRight) {\n      return flatRest(function(funcs) {\n        var length = funcs.length,\n            index = length,\n            prereq = LodashWrapper.prototype.thru;\n\n        if (fromRight) {\n          funcs.reverse();\n        }\n        while (index--) {\n          var func = funcs[index];\n          if (typeof func != 'function') {\n            throw new TypeError(FUNC_ERROR_TEXT);\n          }\n          if (prereq && !wrapper && getFuncName(func) == 'wrapper') {\n            var wrapper = new LodashWrapper([], true);\n          }\n        }\n        index = wrapper ? index : length;\n        while (++index < length) {\n          func = funcs[index];\n\n          var funcName = getFuncName(func),\n              data = funcName == 'wrapper' ? getData(func) : undefined;\n\n          if (data && isLaziable(data[0]) &&\n                data[1] == (WRAP_ARY_FLAG | WRAP_CURRY_FLAG | WRAP_PARTIAL_FLAG | WRAP_REARG_FLAG) &&\n                !data[4].length && data[9] == 1\n              ) {\n            wrapper = wrapper[getFuncName(data[0])].apply(wrapper, data[3]);\n          } else {\n            wrapper = (func.length == 1 && isLaziable(func))\n              ? wrapper[funcName]()\n              : wrapper.thru(func);\n          }\n        }\n        return function() {\n          var args = arguments,\n              value = args[0];\n\n          if (wrapper && args.length == 1 && isArray(value)) {\n            return wrapper.plant(value).value();\n          }\n          var index = 0,\n              result = length ? funcs[index].apply(this, args) : value;\n\n          while (++index < length) {\n            result = funcs[index].call(this, result);\n          }\n          return result;\n        };\n      });\n    }\n\n    /**\n     * Creates a function that wraps `func` to invoke it with optional `this`\n     * binding of `thisArg`, partial application, and currying.\n     *\n     * @private\n     * @param {Function|string} func The function or method name to wrap.\n     * @param {number} bitmask The bitmask flags. See `createWrap` for more details.\n     * @param {*} [thisArg] The `this` binding of `func`.\n     * @param {Array} [partials] The arguments to prepend to those provided to\n     *  the new function.\n     * @param {Array} [holders] The `partials` placeholder indexes.\n     * @param {Array} [partialsRight] The arguments to append to those provided\n     *  to the new function.\n     * @param {Array} [holdersRight] The `partialsRight` placeholder indexes.\n     * @param {Array} [argPos] The argument positions of the new function.\n     * @param {number} [ary] The arity cap of `func`.\n     * @param {number} [arity] The arity of `func`.\n     * @returns {Function} Returns the new wrapped function.\n     */\n    function createHybrid(func, bitmask, thisArg, partials, holders, partialsRight, holdersRight, argPos, ary, arity) {\n      var isAry = bitmask & WRAP_ARY_FLAG,\n          isBind = bitmask & WRAP_BIND_FLAG,\n          isBindKey = bitmask & WRAP_BIND_KEY_FLAG,\n          isCurried = bitmask & (WRAP_CURRY_FLAG | WRAP_CURRY_RIGHT_FLAG),\n          isFlip = bitmask & WRAP_FLIP_FLAG,\n          Ctor = isBindKey ? undefined : createCtor(func);\n\n      function wrapper() {\n        var length = arguments.length,\n            args = Array(length),\n            index = length;\n\n        while (index--) {\n          args[index] = arguments[index];\n        }\n        if (isCurried) {\n          var placeholder = getHolder(wrapper),\n              holdersCount = countHolders(args, placeholder);\n        }\n        if (partials) {\n          args = composeArgs(args, partials, holders, isCurried);\n        }\n        if (partialsRight) {\n          args = composeArgsRight(args, partialsRight, holdersRight, isCurried);\n        }\n        length -= holdersCount;\n        if (isCurried && length < arity) {\n          var newHolders = replaceHolders(args, placeholder);\n          return createRecurry(\n            func, bitmask, createHybrid, wrapper.placeholder, thisArg,\n            args, newHolders, argPos, ary, arity - length\n          );\n        }\n        var thisBinding = isBind ? thisArg : this,\n            fn = isBindKey ? thisBinding[func] : func;\n\n        length = args.length;\n        if (argPos) {\n          args = reorder(args, argPos);\n        } else if (isFlip && length > 1) {\n          args.reverse();\n        }\n        if (isAry && ary < length) {\n          args.length = ary;\n        }\n        if (this && this !== root && this instanceof wrapper) {\n          fn = Ctor || createCtor(fn);\n        }\n        return fn.apply(thisBinding, args);\n      }\n      return wrapper;\n    }\n\n    /**\n     * Creates a function like `_.invertBy`.\n     *\n     * @private\n     * @param {Function} setter The function to set accumulator values.\n     * @param {Function} toIteratee The function to resolve iteratees.\n     * @returns {Function} Returns the new inverter function.\n     */\n    function createInverter(setter, toIteratee) {\n      return function(object, iteratee) {\n        return baseInverter(object, setter, toIteratee(iteratee), {});\n      };\n    }\n\n    /**\n     * Creates a function that performs a mathematical operation on two values.\n     *\n     * @private\n     * @param {Function} operator The function to perform the operation.\n     * @param {number} [defaultValue] The value used for `undefined` arguments.\n     * @returns {Function} Returns the new mathematical operation function.\n     */\n    function createMathOperation(operator, defaultValue) {\n      return function(value, other) {\n        var result;\n        if (value === undefined && other === undefined) {\n          return defaultValue;\n        }\n        if (value !== undefined) {\n          result = value;\n        }\n        if (other !== undefined) {\n          if (result === undefined) {\n            return other;\n          }\n          if (typeof value == 'string' || typeof other == 'string') {\n            value = baseToString(value);\n            other = baseToString(other);\n          } else {\n            value = baseToNumber(value);\n            other = baseToNumber(other);\n          }\n          result = operator(value, other);\n        }\n        return result;\n      };\n    }\n\n    /**\n     * Creates a function like `_.over`.\n     *\n     * @private\n     * @param {Function} arrayFunc The function to iterate over iteratees.\n     * @returns {Function} Returns the new over function.\n     */\n    function createOver(arrayFunc) {\n      return flatRest(function(iteratees) {\n        iteratees = arrayMap(iteratees, baseUnary(getIteratee()));\n        return baseRest(function(args) {\n          var thisArg = this;\n          return arrayFunc(iteratees, function(iteratee) {\n            return apply(iteratee, thisArg, args);\n          });\n        });\n      });\n    }\n\n    /**\n     * Creates the padding for `string` based on `length`. The `chars` string\n     * is truncated if the number of characters exceeds `length`.\n     *\n     * @private\n     * @param {number} length The padding length.\n     * @param {string} [chars=' '] The string used as padding.\n     * @returns {string} Returns the padding for `string`.\n     */\n    function createPadding(length, chars) {\n      chars = chars === undefined ? ' ' : baseToString(chars);\n\n      var charsLength = chars.length;\n      if (charsLength < 2) {\n        return charsLength ? baseRepeat(chars, length) : chars;\n      }\n      var result = baseRepeat(chars, nativeCeil(length / stringSize(chars)));\n      return hasUnicode(chars)\n        ? castSlice(stringToArray(result), 0, length).join('')\n        : result.slice(0, length);\n    }\n\n    /**\n     * Creates a function that wraps `func` to invoke it with the `this` binding\n     * of `thisArg` and `partials` prepended to the arguments it receives.\n     *\n     * @private\n     * @param {Function} func The function to wrap.\n     * @param {number} bitmask The bitmask flags. See `createWrap` for more details.\n     * @param {*} thisArg The `this` binding of `func`.\n     * @param {Array} partials The arguments to prepend to those provided to\n     *  the new function.\n     * @returns {Function} Returns the new wrapped function.\n     */\n    function createPartial(func, bitmask, thisArg, partials) {\n      var isBind = bitmask & WRAP_BIND_FLAG,\n          Ctor = createCtor(func);\n\n      function wrapper() {\n        var argsIndex = -1,\n            argsLength = arguments.length,\n            leftIndex = -1,\n            leftLength = partials.length,\n            args = Array(leftLength + argsLength),\n            fn = (this && this !== root && this instanceof wrapper) ? Ctor : func;\n\n        while (++leftIndex < leftLength) {\n          args[leftIndex] = partials[leftIndex];\n        }\n        while (argsLength--) {\n          args[leftIndex++] = arguments[++argsIndex];\n        }\n        return apply(fn, isBind ? thisArg : this, args);\n      }\n      return wrapper;\n    }\n\n    /**\n     * Creates a `_.range` or `_.rangeRight` function.\n     *\n     * @private\n     * @param {boolean} [fromRight] Specify iterating from right to left.\n     * @returns {Function} Returns the new range function.\n     */\n    function createRange(fromRight) {\n      return function(start, end, step) {\n        if (step && typeof step != 'number' && isIterateeCall(start, end, step)) {\n          end = step = undefined;\n        }\n        // Ensure the sign of `-0` is preserved.\n        start = toFinite(start);\n        if (end === undefined) {\n          end = start;\n          start = 0;\n        } else {\n          end = toFinite(end);\n        }\n        step = step === undefined ? (start < end ? 1 : -1) : toFinite(step);\n        return baseRange(start, end, step, fromRight);\n      };\n    }\n\n    /**\n     * Creates a function that performs a relational operation on two values.\n     *\n     * @private\n     * @param {Function} operator The function to perform the operation.\n     * @returns {Function} Returns the new relational operation function.\n     */\n    function createRelationalOperation(operator) {\n      return function(value, other) {\n        if (!(typeof value == 'string' && typeof other == 'string')) {\n          value = toNumber(value);\n          other = toNumber(other);\n        }\n        return operator(value, other);\n      };\n    }\n\n    /**\n     * Creates a function that wraps `func` to continue currying.\n     *\n     * @private\n     * @param {Function} func The function to wrap.\n     * @param {number} bitmask The bitmask flags. See `createWrap` for more details.\n     * @param {Function} wrapFunc The function to create the `func` wrapper.\n     * @param {*} placeholder The placeholder value.\n     * @param {*} [thisArg] The `this` binding of `func`.\n     * @param {Array} [partials] The arguments to prepend to those provided to\n     *  the new function.\n     * @param {Array} [holders] The `partials` placeholder indexes.\n     * @param {Array} [argPos] The argument positions of the new function.\n     * @param {number} [ary] The arity cap of `func`.\n     * @param {number} [arity] The arity of `func`.\n     * @returns {Function} Returns the new wrapped function.\n     */\n    function createRecurry(func, bitmask, wrapFunc, placeholder, thisArg, partials, holders, argPos, ary, arity) {\n      var isCurry = bitmask & WRAP_CURRY_FLAG,\n          newHolders = isCurry ? holders : undefined,\n          newHoldersRight = isCurry ? undefined : holders,\n          newPartials = isCurry ? partials : undefined,\n          newPartialsRight = isCurry ? undefined : partials;\n\n      bitmask |= (isCurry ? WRAP_PARTIAL_FLAG : WRAP_PARTIAL_RIGHT_FLAG);\n      bitmask &= ~(isCurry ? WRAP_PARTIAL_RIGHT_FLAG : WRAP_PARTIAL_FLAG);\n\n      if (!(bitmask & WRAP_CURRY_BOUND_FLAG)) {\n        bitmask &= ~(WRAP_BIND_FLAG | WRAP_BIND_KEY_FLAG);\n      }\n      var newData = [\n        func, bitmask, thisArg, newPartials, newHolders, newPartialsRight,\n        newHoldersRight, argPos, ary, arity\n      ];\n\n      var result = wrapFunc.apply(undefined, newData);\n      if (isLaziable(func)) {\n        setData(result, newData);\n      }\n      result.placeholder = placeholder;\n      return setWrapToString(result, func, bitmask);\n    }\n\n    /**\n     * Creates a function like `_.round`.\n     *\n     * @private\n     * @param {string} methodName The name of the `Math` method to use when rounding.\n     * @returns {Function} Returns the new round function.\n     */\n    function createRound(methodName) {\n      var func = Math[methodName];\n      return function(number, precision) {\n        number = toNumber(number);\n        precision = precision == null ? 0 : nativeMin(toInteger(precision), 292);\n        if (precision && nativeIsFinite(number)) {\n          // Shift with exponential notation to avoid floating-point issues.\n          // See [MDN](https://mdn.io/round#Examples) for more details.\n          var pair = (toString(number) + 'e').split('e'),\n              value = func(pair[0] + 'e' + (+pair[1] + precision));\n\n          pair = (toString(value) + 'e').split('e');\n          return +(pair[0] + 'e' + (+pair[1] - precision));\n        }\n        return func(number);\n      };\n    }\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     */\n    var createSet = !(Set && (1 / setToArray(new Set([,-0]))[1]) == INFINITY) ? noop : function(values) {\n      return new Set(values);\n    };\n\n    /**\n     * Creates a `_.toPairs` or `_.toPairsIn` function.\n     *\n     * @private\n     * @param {Function} keysFunc The function to get the keys of a given object.\n     * @returns {Function} Returns the new pairs function.\n     */\n    function createToPairs(keysFunc) {\n      return function(object) {\n        var tag = getTag(object);\n        if (tag == mapTag) {\n          return mapToArray(object);\n        }\n        if (tag == setTag) {\n          return setToPairs(object);\n        }\n        return baseToPairs(object, keysFunc(object));\n      };\n    }\n\n    /**\n     * Creates a function that either curries or invokes `func` with optional\n     * `this` binding and partially applied arguments.\n     *\n     * @private\n     * @param {Function|string} func The function or method name to wrap.\n     * @param {number} bitmask The bitmask flags.\n     *    1 - `_.bind`\n     *    2 - `_.bindKey`\n     *    4 - `_.curry` or `_.curryRight` of a bound function\n     *    8 - `_.curry`\n     *   16 - `_.curryRight`\n     *   32 - `_.partial`\n     *   64 - `_.partialRight`\n     *  128 - `_.rearg`\n     *  256 - `_.ary`\n     *  512 - `_.flip`\n     * @param {*} [thisArg] The `this` binding of `func`.\n     * @param {Array} [partials] The arguments to be partially applied.\n     * @param {Array} [holders] The `partials` placeholder indexes.\n     * @param {Array} [argPos] The argument positions of the new function.\n     * @param {number} [ary] The arity cap of `func`.\n     * @param {number} [arity] The arity of `func`.\n     * @returns {Function} Returns the new wrapped function.\n     */\n    function createWrap(func, bitmask, thisArg, partials, holders, argPos, ary, arity) {\n      var isBindKey = bitmask & WRAP_BIND_KEY_FLAG;\n      if (!isBindKey && typeof func != 'function') {\n        throw new TypeError(FUNC_ERROR_TEXT);\n      }\n      var length = partials ? partials.length : 0;\n      if (!length) {\n        bitmask &= ~(WRAP_PARTIAL_FLAG | WRAP_PARTIAL_RIGHT_FLAG);\n        partials = holders = undefined;\n      }\n      ary = ary === undefined ? ary : nativeMax(toInteger(ary), 0);\n      arity = arity === undefined ? arity : toInteger(arity);\n      length -= holders ? holders.length : 0;\n\n      if (bitmask & WRAP_PARTIAL_RIGHT_FLAG) {\n        var partialsRight = partials,\n            holdersRight = holders;\n\n        partials = holders = undefined;\n      }\n      var data = isBindKey ? undefined : getData(func);\n\n      var newData = [\n        func, bitmask, thisArg, partials, holders, partialsRight, holdersRight,\n        argPos, ary, arity\n      ];\n\n      if (data) {\n        mergeData(newData, data);\n      }\n      func = newData[0];\n      bitmask = newData[1];\n      thisArg = newData[2];\n      partials = newData[3];\n      holders = newData[4];\n      arity = newData[9] = newData[9] === undefined\n        ? (isBindKey ? 0 : func.length)\n        : nativeMax(newData[9] - length, 0);\n\n      if (!arity && bitmask & (WRAP_CURRY_FLAG | WRAP_CURRY_RIGHT_FLAG)) {\n        bitmask &= ~(WRAP_CURRY_FLAG | WRAP_CURRY_RIGHT_FLAG);\n      }\n      if (!bitmask || bitmask == WRAP_BIND_FLAG) {\n        var result = createBind(func, bitmask, thisArg);\n      } else if (bitmask == WRAP_CURRY_FLAG || bitmask == WRAP_CURRY_RIGHT_FLAG) {\n        result = createCurry(func, bitmask, arity);\n      } else if ((bitmask == WRAP_PARTIAL_FLAG || bitmask == (WRAP_BIND_FLAG | WRAP_PARTIAL_FLAG)) && !holders.length) {\n        result = createPartial(func, bitmask, thisArg, partials);\n      } else {\n        result = createHybrid.apply(undefined, newData);\n      }\n      var setter = data ? baseSetData : setData;\n      return setWrapToString(setter(result, newData), func, bitmask);\n    }\n\n    /**\n     * Used by `_.defaults` to customize its `_.assignIn` use to assign properties\n     * of source objects to the destination object for all destination properties\n     * that resolve to `undefined`.\n     *\n     * @private\n     * @param {*} objValue The destination value.\n     * @param {*} srcValue The source value.\n     * @param {string} key The key of the property to assign.\n     * @param {Object} object The parent object of `objValue`.\n     * @returns {*} Returns the value to assign.\n     */\n    function customDefaultsAssignIn(objValue, srcValue, key, object) {\n      if (objValue === undefined ||\n          (eq(objValue, objectProto[key]) && !hasOwnProperty.call(object, key))) {\n        return srcValue;\n      }\n      return objValue;\n    }\n\n    /**\n     * Used by `_.defaultsDeep` to customize its `_.merge` use to merge source\n     * objects into destination objects that are passed thru.\n     *\n     * @private\n     * @param {*} objValue The destination value.\n     * @param {*} srcValue The source value.\n     * @param {string} key The key of the property to merge.\n     * @param {Object} object The parent object of `objValue`.\n     * @param {Object} source The parent object of `srcValue`.\n     * @param {Object} [stack] Tracks traversed source values and their merged\n     *  counterparts.\n     * @returns {*} Returns the value to assign.\n     */\n    function customDefaultsMerge(objValue, srcValue, key, object, source, stack) {\n      if (isObject(objValue) && isObject(srcValue)) {\n        // Recursively merge objects and arrays (susceptible to call stack limits).\n        stack.set(srcValue, objValue);\n        baseMerge(objValue, srcValue, undefined, customDefaultsMerge, stack);\n        stack['delete'](srcValue);\n      }\n      return objValue;\n    }\n\n    /**\n     * Used by `_.omit` to customize its `_.cloneDeep` use to only clone plain\n     * objects.\n     *\n     * @private\n     * @param {*} value The value to inspect.\n     * @param {string} key The key of the property to inspect.\n     * @returns {*} Returns the uncloned value or `undefined` to defer cloning to `_.cloneDeep`.\n     */\n    function customOmitClone(value) {\n      return isPlainObject(value) ? undefined : value;\n    }\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     */\n    function 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\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     */\n    function 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\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     */\n    function 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\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     */\n    function flatRest(func) {\n      return setToString(overRest(func, undefined, flatten), func + '');\n    }\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     */\n    function getAllKeys(object) {\n      return baseGetAllKeys(object, keys, getSymbols);\n    }\n\n    /**\n     * Creates an array of own and inherited enumerable property names and\n     * 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     */\n    function getAllKeysIn(object) {\n      return baseGetAllKeys(object, keysIn, getSymbolsIn);\n    }\n\n    /**\n     * Gets metadata for `func`.\n     *\n     * @private\n     * @param {Function} func The function to query.\n     * @returns {*} Returns the metadata for `func`.\n     */\n    var getData = !metaMap ? noop : function(func) {\n      return metaMap.get(func);\n    };\n\n    /**\n     * Gets the name of `func`.\n     *\n     * @private\n     * @param {Function} func The function to query.\n     * @returns {string} Returns the function name.\n     */\n    function getFuncName(func) {\n      var result = (func.name + ''),\n          array = realNames[result],\n          length = hasOwnProperty.call(realNames, result) ? array.length : 0;\n\n      while (length--) {\n        var data = array[length],\n            otherFunc = data.func;\n        if (otherFunc == null || otherFunc == func) {\n          return data.name;\n        }\n      }\n      return result;\n    }\n\n    /**\n     * Gets the argument placeholder value for `func`.\n     *\n     * @private\n     * @param {Function} func The function to inspect.\n     * @returns {*} Returns the placeholder value.\n     */\n    function getHolder(func) {\n      var object = hasOwnProperty.call(lodash, 'placeholder') ? lodash : func;\n      return object.placeholder;\n    }\n\n    /**\n     * Gets the appropriate \"iteratee\" function. If `_.iteratee` is customized,\n     * this function returns the custom method, otherwise it returns `baseIteratee`.\n     * If arguments are provided, the chosen function is invoked with them and\n     * its result is returned.\n     *\n     * @private\n     * @param {*} [value] The value to convert to an iteratee.\n     * @param {number} [arity] The arity of the created iteratee.\n     * @returns {Function} Returns the chosen function or its result.\n     */\n    function getIteratee() {\n      var result = lodash.iteratee || iteratee;\n      result = result === iteratee ? baseIteratee : result;\n      return arguments.length ? result(arguments[0], arguments[1]) : result;\n    }\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     */\n    function getMapData(map, key) {\n      var data = map.__data__;\n      return isKeyable(key)\n        ? data[typeof key == 'string' ? 'string' : 'hash']\n        : data.map;\n    }\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     */\n    function 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\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     */\n    function getNative(object, key) {\n      var value = getValue(object, key);\n      return baseIsNative(value) ? value : undefined;\n    }\n\n    /**\n     * A specialized version of `baseGetTag` which ignores `Symbol.toStringTag` values.\n     *\n     * @private\n     * @param {*} value The value to query.\n     * @returns {string} Returns the raw `toStringTag`.\n     */\n    function getRawTag(value) {\n      var isOwn = hasOwnProperty.call(value, symToStringTag),\n          tag = value[symToStringTag];\n\n      try {\n        value[symToStringTag] = undefined;\n        var unmasked = true;\n      } catch (e) {}\n\n      var result = nativeObjectToString.call(value);\n      if (unmasked) {\n        if (isOwn) {\n          value[symToStringTag] = tag;\n        } else {\n          delete value[symToStringTag];\n        }\n      }\n      return result;\n    }\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     */\n    var 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\n    /**\n     * Creates an array of the own and inherited enumerable symbols of `object`.\n     *\n     * @private\n     * @param {Object} object The object to query.\n     * @returns {Array} Returns the array of symbols.\n     */\n    var getSymbolsIn = !nativeGetSymbols ? stubArray : function(object) {\n      var result = [];\n      while (object) {\n        arrayPush(result, getSymbols(object));\n        object = getPrototype(object);\n      }\n      return result;\n    };\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     */\n    var getTag = baseGetTag;\n\n    // Fallback for data views, maps, sets, and weak maps in IE 11 and promises in Node.js < 6.\n    if ((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\n    /**\n     * Gets the view, applying any `transforms` to the `start` and `end` positions.\n     *\n     * @private\n     * @param {number} start The start of the view.\n     * @param {number} end The end of the view.\n     * @param {Array} transforms The transformations to apply to the view.\n     * @returns {Object} Returns an object containing the `start` and `end`\n     *  positions of the view.\n     */\n    function getView(start, end, transforms) {\n      var index = -1,\n          length = transforms.length;\n\n      while (++index < length) {\n        var data = transforms[index],\n            size = data.size;\n\n        switch (data.type) {\n          case 'drop':      start += size; break;\n          case 'dropRight': end -= size; break;\n          case 'take':      end = nativeMin(end, start + size); break;\n          case 'takeRight': start = nativeMax(start, end - size); break;\n        }\n      }\n      return { 'start': start, 'end': end };\n    }\n\n    /**\n     * Extracts wrapper details from the `source` body comment.\n     *\n     * @private\n     * @param {string} source The source to inspect.\n     * @returns {Array} Returns the wrapper details.\n     */\n    function getWrapDetails(source) {\n      var match = source.match(reWrapDetails);\n      return match ? match[1].split(reSplitDetails) : [];\n    }\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     */\n    function 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\n    /**\n     * Initializes an array clone.\n     *\n     * @private\n     * @param {Array} array The array to clone.\n     * @returns {Array} Returns the initialized clone.\n     */\n    function initCloneArray(array) {\n      var length = array.length,\n          result = new array.constructor(length);\n\n      // Add properties assigned by `RegExp#exec`.\n      if (length && typeof array[0] == 'string' && hasOwnProperty.call(array, 'index')) {\n        result.index = array.index;\n        result.input = array.input;\n      }\n      return result;\n    }\n\n    /**\n     * Initializes an object clone.\n     *\n     * @private\n     * @param {Object} object The object to clone.\n     * @returns {Object} Returns the initialized clone.\n     */\n    function initCloneObject(object) {\n      return (typeof object.constructor == 'function' && !isPrototype(object))\n        ? baseCreate(getPrototype(object))\n        : {};\n    }\n\n    /**\n     * Initializes an object clone based on its `toStringTag`.\n     *\n     * **Note:** This function only supports cloning values with tags of\n     * `Boolean`, `Date`, `Error`, `Map`, `Number`, `RegExp`, `Set`, or `String`.\n     *\n     * @private\n     * @param {Object} object The object to clone.\n     * @param {string} tag The `toStringTag` of the object to clone.\n     * @param {boolean} [isDeep] Specify a deep clone.\n     * @returns {Object} Returns the initialized clone.\n     */\n    function initCloneByTag(object, tag, isDeep) {\n      var Ctor = object.constructor;\n      switch (tag) {\n        case arrayBufferTag:\n          return cloneArrayBuffer(object);\n\n        case boolTag:\n        case dateTag:\n          return new Ctor(+object);\n\n        case dataViewTag:\n          return cloneDataView(object, isDeep);\n\n        case float32Tag: case float64Tag:\n        case int8Tag: case int16Tag: case int32Tag:\n        case uint8Tag: case uint8ClampedTag: case uint16Tag: case uint32Tag:\n          return cloneTypedArray(object, isDeep);\n\n        case mapTag:\n          return new Ctor;\n\n        case numberTag:\n        case stringTag:\n          return new Ctor(object);\n\n        case regexpTag:\n          return cloneRegExp(object);\n\n        case setTag:\n          return new Ctor;\n\n        case symbolTag:\n          return cloneSymbol(object);\n      }\n    }\n\n    /**\n     * Inserts wrapper `details` in a comment at the top of the `source` body.\n     *\n     * @private\n     * @param {string} source The source to modify.\n     * @returns {Array} details The details to insert.\n     * @returns {string} Returns the modified source.\n     */\n    function insertWrapDetails(source, details) {\n      var length = details.length;\n      if (!length) {\n        return source;\n      }\n      var lastIndex = length - 1;\n      details[lastIndex] = (length > 1 ? '& ' : '') + details[lastIndex];\n      details = details.join(length > 2 ? ', ' : ' ');\n      return source.replace(reWrapComment, '{\\n/* [wrapped with ' + details + '] */\\n');\n    }\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     */\n    function isFlattenable(value) {\n      return isArray(value) || isArguments(value) ||\n        !!(spreadableSymbol && value && value[spreadableSymbol]);\n    }\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     */\n    function 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\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     */\n    function 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\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     */\n    function 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\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     */\n    function 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\n    /**\n     * Checks if `func` has a lazy counterpart.\n     *\n     * @private\n     * @param {Function} func The function to check.\n     * @returns {boolean} Returns `true` if `func` has a lazy counterpart,\n     *  else `false`.\n     */\n    function isLaziable(func) {\n      var funcName = getFuncName(func),\n          other = lodash[funcName];\n\n      if (typeof other != 'function' || !(funcName in LazyWrapper.prototype)) {\n        return false;\n      }\n      if (func === other) {\n        return true;\n      }\n      var data = getData(other);\n      return !!data && func === data[0];\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     */\n    function isMasked(func) {\n      return !!maskSrcKey && (maskSrcKey in func);\n    }\n\n    /**\n     * Checks if `func` is capable of being masked.\n     *\n     * @private\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `func` is maskable, else `false`.\n     */\n    var isMaskable = coreJsData ? isFunction : stubFalse;\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     */\n    function isPrototype(value) {\n      var Ctor = value && value.constructor,\n          proto = (typeof Ctor == 'function' && Ctor.prototype) || objectProto;\n\n      return value === proto;\n    }\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     */\n    function isStrictComparable(value) {\n      return value === value && !isObject(value);\n    }\n\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     */\n    function 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\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     */\n    function 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\n    /**\n     * Merges the function metadata of `source` into `data`.\n     *\n     * Merging metadata reduces the number of wrappers used to invoke a function.\n     * This is possible because methods like `_.bind`, `_.curry`, and `_.partial`\n     * may be applied regardless of execution order. Methods like `_.ary` and\n     * `_.rearg` modify function arguments, making the order in which they are\n     * executed important, preventing the merging of metadata. However, we make\n     * an exception for a safe combined case where curried functions have `_.ary`\n     * and or `_.rearg` applied.\n     *\n     * @private\n     * @param {Array} data The destination metadata.\n     * @param {Array} source The source metadata.\n     * @returns {Array} Returns `data`.\n     */\n    function mergeData(data, source) {\n      var bitmask = data[1],\n          srcBitmask = source[1],\n          newBitmask = bitmask | srcBitmask,\n          isCommon = newBitmask < (WRAP_BIND_FLAG | WRAP_BIND_KEY_FLAG | WRAP_ARY_FLAG);\n\n      var isCombo =\n        ((srcBitmask == WRAP_ARY_FLAG) && (bitmask == WRAP_CURRY_FLAG)) ||\n        ((srcBitmask == WRAP_ARY_FLAG) && (bitmask == WRAP_REARG_FLAG) && (data[7].length <= source[8])) ||\n        ((srcBitmask == (WRAP_ARY_FLAG | WRAP_REARG_FLAG)) && (source[7].length <= source[8]) && (bitmask == WRAP_CURRY_FLAG));\n\n      // Exit early if metadata can't be merged.\n      if (!(isCommon || isCombo)) {\n        return data;\n      }\n      // Use source `thisArg` if available.\n      if (srcBitmask & WRAP_BIND_FLAG) {\n        data[2] = source[2];\n        // Set when currying a bound function.\n        newBitmask |= bitmask & WRAP_BIND_FLAG ? 0 : WRAP_CURRY_BOUND_FLAG;\n      }\n      // Compose partial arguments.\n      var value = source[3];\n      if (value) {\n        var partials = data[3];\n        data[3] = partials ? composeArgs(partials, value, source[4]) : value;\n        data[4] = partials ? replaceHolders(data[3], PLACEHOLDER) : source[4];\n      }\n      // Compose partial right arguments.\n      value = source[5];\n      if (value) {\n        partials = data[5];\n        data[5] = partials ? composeArgsRight(partials, value, source[6]) : value;\n        data[6] = partials ? replaceHolders(data[5], PLACEHOLDER) : source[6];\n      }\n      // Use source `argPos` if available.\n      value = source[7];\n      if (value) {\n        data[7] = value;\n      }\n      // Use source `ary` if it's smaller.\n      if (srcBitmask & WRAP_ARY_FLAG) {\n        data[8] = data[8] == null ? source[8] : nativeMin(data[8], source[8]);\n      }\n      // Use source `arity` if one is not provided.\n      if (data[9] == null) {\n        data[9] = source[9];\n      }\n      // Use source `func` and merge bitmasks.\n      data[0] = source[0];\n      data[1] = newBitmask;\n\n      return data;\n    }\n\n    /**\n     * This function is like\n     * [`Object.keys`](http://ecma-international.org/ecma-262/7.0/#sec-object.keys)\n     * except that it includes inherited enumerable properties.\n     *\n     * @private\n     * @param {Object} object The object to query.\n     * @returns {Array} Returns the array of property names.\n     */\n    function nativeKeysIn(object) {\n      var result = [];\n      if (object != null) {\n        for (var key in Object(object)) {\n          result.push(key);\n        }\n      }\n      return result;\n    }\n\n    /**\n     * Converts `value` to a string using `Object.prototype.toString`.\n     *\n     * @private\n     * @param {*} value The value to convert.\n     * @returns {string} Returns the converted string.\n     */\n    function objectToString(value) {\n      return nativeObjectToString.call(value);\n    }\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     */\n    function 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\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     */\n    function parent(object, path) {\n      return path.length < 2 ? object : baseGet(object, baseSlice(path, 0, -1));\n    }\n\n    /**\n     * Reorder `array` according to the specified indexes where the element at\n     * the first index is assigned as the first element, the element at\n     * the second index is assigned as the second element, and so on.\n     *\n     * @private\n     * @param {Array} array The array to reorder.\n     * @param {Array} indexes The arranged array indexes.\n     * @returns {Array} Returns `array`.\n     */\n    function reorder(array, indexes) {\n      var arrLength = array.length,\n          length = nativeMin(indexes.length, arrLength),\n          oldArray = copyArray(array);\n\n      while (length--) {\n        var index = indexes[length];\n        array[length] = isIndex(index, arrLength) ? oldArray[index] : undefined;\n      }\n      return array;\n    }\n\n    /**\n     * Gets the value at `key`, unless `key` is \"__proto__\" or \"constructor\".\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     */\n    function safeGet(object, key) {\n      if (key === 'constructor' && typeof object[key] === 'function') {\n        return;\n      }\n\n      if (key == '__proto__') {\n        return;\n      }\n\n      return object[key];\n    }\n\n    /**\n     * Sets metadata for `func`.\n     *\n     * **Note:** If this function becomes hot, i.e. is invoked a lot in a short\n     * period of time, it will trip its breaker and transition to an identity\n     * function to avoid garbage collection pauses in V8. See\n     * [V8 issue 2070](https://bugs.chromium.org/p/v8/issues/detail?id=2070)\n     * for more details.\n     *\n     * @private\n     * @param {Function} func The function to associate metadata with.\n     * @param {*} data The metadata.\n     * @returns {Function} Returns `func`.\n     */\n    var setData = shortOut(baseSetData);\n\n    /**\n     * A simple wrapper around the global [`setTimeout`](https://mdn.io/setTimeout).\n     *\n     * @private\n     * @param {Function} func The function to delay.\n     * @param {number} wait The number of milliseconds to delay invocation.\n     * @returns {number|Object} Returns the timer id or timeout object.\n     */\n    var setTimeout = ctxSetTimeout || function(func, wait) {\n      return root.setTimeout(func, wait);\n    };\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     */\n    var setToString = shortOut(baseSetToString);\n\n    /**\n     * Sets the `toString` method of `wrapper` to mimic the source of `reference`\n     * with wrapper details in a comment at the top of the source body.\n     *\n     * @private\n     * @param {Function} wrapper The function to modify.\n     * @param {Function} reference The reference function.\n     * @param {number} bitmask The bitmask flags. See `createWrap` for more details.\n     * @returns {Function} Returns `wrapper`.\n     */\n    function setWrapToString(wrapper, reference, bitmask) {\n      var source = (reference + '');\n      return setToString(wrapper, insertWrapDetails(source, updateWrapDetails(getWrapDetails(source), bitmask)));\n    }\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     */\n    function 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\n    /**\n     * A specialized version of `_.shuffle` which mutates and sets the size of `array`.\n     *\n     * @private\n     * @param {Array} array The array to shuffle.\n     * @param {number} [size=array.length] The size of `array`.\n     * @returns {Array} Returns `array`.\n     */\n    function shuffleSelf(array, size) {\n      var index = -1,\n          length = array.length,\n          lastIndex = length - 1;\n\n      size = size === undefined ? length : size;\n      while (++index < size) {\n        var rand = baseRandom(index, lastIndex),\n            value = array[rand];\n\n        array[rand] = array[index];\n        array[index] = value;\n      }\n      array.length = size;\n      return array;\n    }\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     */\n    var 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\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     */\n    function 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\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     */\n    function 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\n    /**\n     * Updates wrapper `details` based on `bitmask` flags.\n     *\n     * @private\n     * @returns {Array} details The details to modify.\n     * @param {number} bitmask The bitmask flags. See `createWrap` for more details.\n     * @returns {Array} Returns `details`.\n     */\n    function updateWrapDetails(details, bitmask) {\n      arrayEach(wrapFlags, function(pair) {\n        var value = '_.' + pair[0];\n        if ((bitmask & pair[1]) && !arrayIncludes(details, value)) {\n          details.push(value);\n        }\n      });\n      return details.sort();\n    }\n\n    /**\n     * Creates a clone of `wrapper`.\n     *\n     * @private\n     * @param {Object} wrapper The wrapper to clone.\n     * @returns {Object} Returns the cloned wrapper.\n     */\n    function wrapperClone(wrapper) {\n      if (wrapper instanceof LazyWrapper) {\n        return wrapper.clone();\n      }\n      var result = new LodashWrapper(wrapper.__wrapped__, wrapper.__chain__);\n      result.__actions__ = copyArray(wrapper.__actions__);\n      result.__index__  = wrapper.__index__;\n      result.__values__ = wrapper.__values__;\n      return result;\n    }\n\n    /*------------------------------------------------------------------------*/\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     */\n    function 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\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     */\n    function 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\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     */\n    function 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\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     */\n    var difference = baseRest(function(array, values) {\n      return isArrayLikeObject(array)\n        ? baseDifference(array, baseFlatten(values, 1, isArrayLikeObject, true))\n        : [];\n    });\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     */\n    var 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), getIteratee(iteratee, 2))\n        : [];\n    });\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     */\n    var 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\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     */\n    function 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\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     */\n    function 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\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     */\n    function dropRightWhile(array, predicate) {\n      return (array && array.length)\n        ? baseWhile(array, getIteratee(predicate, 3), true, true)\n        : [];\n    }\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     */\n    function dropWhile(array, predicate) {\n      return (array && array.length)\n        ? baseWhile(array, getIteratee(predicate, 3), true)\n        : [];\n    }\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     */\n    function 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\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     */\n    function 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, getIteratee(predicate, 3), index);\n    }\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     */\n    function 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, getIteratee(predicate, 3), index, true);\n    }\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     */\n    function flatten(array) {\n      var length = array == null ? 0 : array.length;\n      return length ? baseFlatten(array, 1) : [];\n    }\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     */\n    function flattenDeep(array) {\n      var length = array == null ? 0 : array.length;\n      return length ? baseFlatten(array, INFINITY) : [];\n    }\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     */\n    function 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\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     */\n    function 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\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     */\n    function head(array) {\n      return (array && array.length) ? array[0] : undefined;\n    }\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     */\n    function 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\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     */\n    function initial(array) {\n      var length = array == null ? 0 : array.length;\n      return length ? baseSlice(array, 0, -1) : [];\n    }\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     */\n    var intersection = baseRest(function(arrays) {\n      var mapped = arrayMap(arrays, castArrayLikeObject);\n      return (mapped.length && mapped[0] === arrays[0])\n        ? baseIntersection(mapped)\n        : [];\n    });\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     */\n    var 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, getIteratee(iteratee, 2))\n        : [];\n    });\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     */\n    var 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\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     */\n    function join(array, separator) {\n      return array == null ? '' : nativeJoin.call(array, separator);\n    }\n\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     */\n    function last(array) {\n      var length = array == null ? 0 : array.length;\n      return length ? array[length - 1] : undefined;\n    }\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     */\n    function 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\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     */\n    function nth(array, n) {\n      return (array && array.length) ? baseNth(array, toInteger(n)) : undefined;\n    }\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     */\n    var pull = baseRest(pullAll);\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     */\n    function pullAll(array, values) {\n      return (array && array.length && values && values.length)\n        ? basePullAll(array, values)\n        : array;\n    }\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     */\n    function pullAllBy(array, values, iteratee) {\n      return (array && array.length && values && values.length)\n        ? basePullAll(array, values, getIteratee(iteratee, 2))\n        : array;\n    }\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     */\n    function pullAllWith(array, values, comparator) {\n      return (array && array.length && values && values.length)\n        ? basePullAll(array, values, undefined, comparator)\n        : array;\n    }\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     */\n    var 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\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     */\n    function 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 = getIteratee(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\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     */\n    function reverse(array) {\n      return array == null ? array : nativeReverse.call(array);\n    }\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     */\n    function 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\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     */\n    function sortedIndex(array, value) {\n      return baseSortedIndex(array, value);\n    }\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     */\n    function sortedIndexBy(array, value, iteratee) {\n      return baseSortedIndexBy(array, value, getIteratee(iteratee, 2));\n    }\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     */\n    function 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\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     */\n    function sortedLastIndex(array, value) {\n      return baseSortedIndex(array, value, true);\n    }\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     */\n    function sortedLastIndexBy(array, value, iteratee) {\n      return baseSortedIndexBy(array, value, getIteratee(iteratee, 2), true);\n    }\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     */\n    function 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\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     */\n    function sortedUniq(array) {\n      return (array && array.length)\n        ? baseSortedUniq(array)\n        : [];\n    }\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     */\n    function sortedUniqBy(array, iteratee) {\n      return (array && array.length)\n        ? baseSortedUniq(array, getIteratee(iteratee, 2))\n        : [];\n    }\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     */\n    function tail(array) {\n      var length = array == null ? 0 : array.length;\n      return length ? baseSlice(array, 1, length) : [];\n    }\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     */\n    function 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\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     */\n    function 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\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     */\n    function takeRightWhile(array, predicate) {\n      return (array && array.length)\n        ? baseWhile(array, getIteratee(predicate, 3), false, true)\n        : [];\n    }\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     */\n    function takeWhile(array, predicate) {\n      return (array && array.length)\n        ? baseWhile(array, getIteratee(predicate, 3))\n        : [];\n    }\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     */\n    var union = baseRest(function(arrays) {\n      return baseUniq(baseFlatten(arrays, 1, isArrayLikeObject, true));\n    });\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     */\n    var 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), getIteratee(iteratee, 2));\n    });\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     */\n    var 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\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     */\n    function uniq(array) {\n      return (array && array.length) ? baseUniq(array) : [];\n    }\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     */\n    function uniqBy(array, iteratee) {\n      return (array && array.length) ? baseUniq(array, getIteratee(iteratee, 2)) : [];\n    }\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     */\n    function uniqWith(array, comparator) {\n      comparator = typeof comparator == 'function' ? comparator : undefined;\n      return (array && array.length) ? baseUniq(array, undefined, comparator) : [];\n    }\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     */\n    function 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\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     */\n    function 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\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     */\n    var without = baseRest(function(array, values) {\n      return isArrayLikeObject(array)\n        ? baseDifference(array, values)\n        : [];\n    });\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     */\n    var xor = baseRest(function(arrays) {\n      return baseXor(arrayFilter(arrays, isArrayLikeObject));\n    });\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     */\n    var xorBy = baseRest(function(arrays) {\n      var iteratee = last(arrays);\n      if (isArrayLikeObject(iteratee)) {\n        iteratee = undefined;\n      }\n      return baseXor(arrayFilter(arrays, isArrayLikeObject), getIteratee(iteratee, 2));\n    });\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     */\n    var 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\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     */\n    var zip = baseRest(unzip);\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     */\n    function zipObject(props, values) {\n      return baseZipObject(props || [], values || [], assignValue);\n    }\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     */\n    function zipObjectDeep(props, values) {\n      return baseZipObject(props || [], values || [], baseSet);\n    }\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     */\n    var 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\n    /*------------------------------------------------------------------------*/\n\n    /**\n     * Creates a `lodash` wrapper instance that wraps `value` with explicit method\n     * chain sequences enabled. The result of such sequences must be unwrapped\n     * with `_#value`.\n     *\n     * @static\n     * @memberOf _\n     * @since 1.3.0\n     * @category Seq\n     * @param {*} value The value to wrap.\n     * @returns {Object} Returns the new `lodash` wrapper instance.\n     * @example\n     *\n     * var users = [\n     *   { 'user': 'barney',  'age': 36 },\n     *   { 'user': 'fred',    'age': 40 },\n     *   { 'user': 'pebbles', 'age': 1 }\n     * ];\n     *\n     * var youngest = _\n     *   .chain(users)\n     *   .sortBy('age')\n     *   .map(function(o) {\n     *     return o.user + ' is ' + o.age;\n     *   })\n     *   .head()\n     *   .value();\n     * // => 'pebbles is 1'\n     */\n    function chain(value) {\n      var result = lodash(value);\n      result.__chain__ = true;\n      return result;\n    }\n\n    /**\n     * This method invokes `interceptor` and returns `value`. The interceptor\n     * is invoked with one argument; (value). The purpose of this method is to\n     * \"tap into\" a method chain sequence in order to modify intermediate results.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Seq\n     * @param {*} value The value to provide to `interceptor`.\n     * @param {Function} interceptor The function to invoke.\n     * @returns {*} Returns `value`.\n     * @example\n     *\n     * _([1, 2, 3])\n     *  .tap(function(array) {\n     *    // Mutate input array.\n     *    array.pop();\n     *  })\n     *  .reverse()\n     *  .value();\n     * // => [2, 1]\n     */\n    function tap(value, interceptor) {\n      interceptor(value);\n      return value;\n    }\n\n    /**\n     * This method is like `_.tap` except that it returns the result of `interceptor`.\n     * The purpose of this method is to \"pass thru\" values replacing intermediate\n     * results in a method chain sequence.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category Seq\n     * @param {*} value The value to provide to `interceptor`.\n     * @param {Function} interceptor The function to invoke.\n     * @returns {*} Returns the result of `interceptor`.\n     * @example\n     *\n     * _('  abc  ')\n     *  .chain()\n     *  .trim()\n     *  .thru(function(value) {\n     *    return [value];\n     *  })\n     *  .value();\n     * // => ['abc']\n     */\n    function thru(value, interceptor) {\n      return interceptor(value);\n    }\n\n    /**\n     * This method is the wrapper version of `_.at`.\n     *\n     * @name at\n     * @memberOf _\n     * @since 1.0.0\n     * @category Seq\n     * @param {...(string|string[])} [paths] The property paths to pick.\n     * @returns {Object} Returns the new `lodash` wrapper instance.\n     * @example\n     *\n     * var object = { 'a': [{ 'b': { 'c': 3 } }, 4] };\n     *\n     * _(object).at(['a[0].b.c', 'a[1]']).value();\n     * // => [3, 4]\n     */\n    var wrapperAt = flatRest(function(paths) {\n      var length = paths.length,\n          start = length ? paths[0] : 0,\n          value = this.__wrapped__,\n          interceptor = function(object) { return baseAt(object, paths); };\n\n      if (length > 1 || this.__actions__.length ||\n          !(value instanceof LazyWrapper) || !isIndex(start)) {\n        return this.thru(interceptor);\n      }\n      value = value.slice(start, +start + (length ? 1 : 0));\n      value.__actions__.push({\n        'func': thru,\n        'args': [interceptor],\n        'thisArg': undefined\n      });\n      return new LodashWrapper(value, this.__chain__).thru(function(array) {\n        if (length && !array.length) {\n          array.push(undefined);\n        }\n        return array;\n      });\n    });\n\n    /**\n     * Creates a `lodash` wrapper instance with explicit method chain sequences enabled.\n     *\n     * @name chain\n     * @memberOf _\n     * @since 0.1.0\n     * @category Seq\n     * @returns {Object} Returns the new `lodash` wrapper instance.\n     * @example\n     *\n     * var users = [\n     *   { 'user': 'barney', 'age': 36 },\n     *   { 'user': 'fred',   'age': 40 }\n     * ];\n     *\n     * // A sequence without explicit chaining.\n     * _(users).head();\n     * // => { 'user': 'barney', 'age': 36 }\n     *\n     * // A sequence with explicit chaining.\n     * _(users)\n     *   .chain()\n     *   .head()\n     *   .pick('user')\n     *   .value();\n     * // => { 'user': 'barney' }\n     */\n    function wrapperChain() {\n      return chain(this);\n    }\n\n    /**\n     * Executes the chain sequence and returns the wrapped result.\n     *\n     * @name commit\n     * @memberOf _\n     * @since 3.2.0\n     * @category Seq\n     * @returns {Object} Returns the new `lodash` wrapper instance.\n     * @example\n     *\n     * var array = [1, 2];\n     * var wrapped = _(array).push(3);\n     *\n     * console.log(array);\n     * // => [1, 2]\n     *\n     * wrapped = wrapped.commit();\n     * console.log(array);\n     * // => [1, 2, 3]\n     *\n     * wrapped.last();\n     * // => 3\n     *\n     * console.log(array);\n     * // => [1, 2, 3]\n     */\n    function wrapperCommit() {\n      return new LodashWrapper(this.value(), this.__chain__);\n    }\n\n    /**\n     * Gets the next value on a wrapped object following the\n     * [iterator protocol](https://mdn.io/iteration_protocols#iterator).\n     *\n     * @name next\n     * @memberOf _\n     * @since 4.0.0\n     * @category Seq\n     * @returns {Object} Returns the next iterator value.\n     * @example\n     *\n     * var wrapped = _([1, 2]);\n     *\n     * wrapped.next();\n     * // => { 'done': false, 'value': 1 }\n     *\n     * wrapped.next();\n     * // => { 'done': false, 'value': 2 }\n     *\n     * wrapped.next();\n     * // => { 'done': true, 'value': undefined }\n     */\n    function wrapperNext() {\n      if (this.__values__ === undefined) {\n        this.__values__ = toArray(this.value());\n      }\n      var done = this.__index__ >= this.__values__.length,\n          value = done ? undefined : this.__values__[this.__index__++];\n\n      return { 'done': done, 'value': value };\n    }\n\n    /**\n     * Enables the wrapper to be iterable.\n     *\n     * @name Symbol.iterator\n     * @memberOf _\n     * @since 4.0.0\n     * @category Seq\n     * @returns {Object} Returns the wrapper object.\n     * @example\n     *\n     * var wrapped = _([1, 2]);\n     *\n     * wrapped[Symbol.iterator]() === wrapped;\n     * // => true\n     *\n     * Array.from(wrapped);\n     * // => [1, 2]\n     */\n    function wrapperToIterator() {\n      return this;\n    }\n\n    /**\n     * Creates a clone of the chain sequence planting `value` as the wrapped value.\n     *\n     * @name plant\n     * @memberOf _\n     * @since 3.2.0\n     * @category Seq\n     * @param {*} value The value to plant.\n     * @returns {Object} Returns the new `lodash` wrapper instance.\n     * @example\n     *\n     * function square(n) {\n     *   return n * n;\n     * }\n     *\n     * var wrapped = _([1, 2]).map(square);\n     * var other = wrapped.plant([3, 4]);\n     *\n     * other.value();\n     * // => [9, 16]\n     *\n     * wrapped.value();\n     * // => [1, 4]\n     */\n    function wrapperPlant(value) {\n      var result,\n          parent = this;\n\n      while (parent instanceof baseLodash) {\n        var clone = wrapperClone(parent);\n        clone.__index__ = 0;\n        clone.__values__ = undefined;\n        if (result) {\n          previous.__wrapped__ = clone;\n        } else {\n          result = clone;\n        }\n        var previous = clone;\n        parent = parent.__wrapped__;\n      }\n      previous.__wrapped__ = value;\n      return result;\n    }\n\n    /**\n     * This method is the wrapper version of `_.reverse`.\n     *\n     * **Note:** This method mutates the wrapped array.\n     *\n     * @name reverse\n     * @memberOf _\n     * @since 0.1.0\n     * @category Seq\n     * @returns {Object} Returns the new `lodash` wrapper instance.\n     * @example\n     *\n     * var array = [1, 2, 3];\n     *\n     * _(array).reverse().value()\n     * // => [3, 2, 1]\n     *\n     * console.log(array);\n     * // => [3, 2, 1]\n     */\n    function wrapperReverse() {\n      var value = this.__wrapped__;\n      if (value instanceof LazyWrapper) {\n        var wrapped = value;\n        if (this.__actions__.length) {\n          wrapped = new LazyWrapper(this);\n        }\n        wrapped = wrapped.reverse();\n        wrapped.__actions__.push({\n          'func': thru,\n          'args': [reverse],\n          'thisArg': undefined\n        });\n        return new LodashWrapper(wrapped, this.__chain__);\n      }\n      return this.thru(reverse);\n    }\n\n    /**\n     * Executes the chain sequence to resolve the unwrapped value.\n     *\n     * @name value\n     * @memberOf _\n     * @since 0.1.0\n     * @alias toJSON, valueOf\n     * @category Seq\n     * @returns {*} Returns the resolved unwrapped value.\n     * @example\n     *\n     * _([1, 2, 3]).value();\n     * // => [1, 2, 3]\n     */\n    function wrapperValue() {\n      return baseWrapperValue(this.__wrapped__, this.__actions__);\n    }\n\n    /*------------------------------------------------------------------------*/\n\n    /**\n     * Creates an object composed of keys generated from the results of running\n     * each element of `collection` thru `iteratee`. The corresponding value of\n     * each key is the number of times the key was returned by `iteratee`. The\n     * iteratee is invoked with one argument: (value).\n     *\n     * @static\n     * @memberOf _\n     * @since 0.5.0\n     * @category Collection\n     * @param {Array|Object} collection The collection to iterate over.\n     * @param {Function} [iteratee=_.identity] The iteratee to transform keys.\n     * @returns {Object} Returns the composed aggregate object.\n     * @example\n     *\n     * _.countBy([6.1, 4.2, 6.3], Math.floor);\n     * // => { '4': 1, '6': 2 }\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.countBy(['one', 'two', 'three'], 'length');\n     * // => { '3': 2, '5': 1 }\n     */\n    var countBy = createAggregator(function(result, value, key) {\n      if (hasOwnProperty.call(result, key)) {\n        ++result[key];\n      } else {\n        baseAssignValue(result, key, 1);\n      }\n    });\n\n    /**\n     * Checks if `predicate` returns truthy for **all** elements of `collection`.\n     * Iteration is stopped once `predicate` returns falsey. The predicate is\n     * invoked with three arguments: (value, index|key, collection).\n     *\n     * **Note:** This method returns `true` for\n     * [empty collections](https://en.wikipedia.org/wiki/Empty_set) because\n     * [everything is true](https://en.wikipedia.org/wiki/Vacuous_truth) of\n     * elements of empty collections.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Collection\n     * @param {Array|Object} collection The collection to iterate over.\n     * @param {Function} [predicate=_.identity] The function invoked per iteration.\n     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n     * @returns {boolean} Returns `true` if all elements pass the predicate check,\n     *  else `false`.\n     * @example\n     *\n     * _.every([true, 1, null, 'yes'], Boolean);\n     * // => false\n     *\n     * var users = [\n     *   { 'user': 'barney', 'age': 36, 'active': false },\n     *   { 'user': 'fred',   'age': 40, 'active': false }\n     * ];\n     *\n     * // The `_.matches` iteratee shorthand.\n     * _.every(users, { 'user': 'barney', 'active': false });\n     * // => false\n     *\n     * // The `_.matchesProperty` iteratee shorthand.\n     * _.every(users, ['active', false]);\n     * // => true\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.every(users, 'active');\n     * // => false\n     */\n    function every(collection, predicate, guard) {\n      var func = isArray(collection) ? arrayEvery : baseEvery;\n      if (guard && isIterateeCall(collection, predicate, guard)) {\n        predicate = undefined;\n      }\n      return func(collection, getIteratee(predicate, 3));\n    }\n\n    /**\n     * Iterates over elements of `collection`, returning an array of all elements\n     * `predicate` returns truthy for. The predicate is invoked with three\n     * arguments: (value, index|key, collection).\n     *\n     * **Note:** Unlike `_.remove`, this method returns a new array.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Collection\n     * @param {Array|Object} collection The collection to iterate over.\n     * @param {Function} [predicate=_.identity] The function invoked per iteration.\n     * @returns {Array} Returns the new filtered array.\n     * @see _.reject\n     * @example\n     *\n     * var users = [\n     *   { 'user': 'barney', 'age': 36, 'active': true },\n     *   { 'user': 'fred',   'age': 40, 'active': false }\n     * ];\n     *\n     * _.filter(users, function(o) { return !o.active; });\n     * // => objects for ['fred']\n     *\n     * // The `_.matches` iteratee shorthand.\n     * _.filter(users, { 'age': 36, 'active': true });\n     * // => objects for ['barney']\n     *\n     * // The `_.matchesProperty` iteratee shorthand.\n     * _.filter(users, ['active', false]);\n     * // => objects for ['fred']\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.filter(users, 'active');\n     * // => objects for ['barney']\n     *\n     * // Combining several predicates using `_.overEvery` or `_.overSome`.\n     * _.filter(users, _.overSome([{ 'age': 36 }, ['age', 40]]));\n     * // => objects for ['fred', 'barney']\n     */\n    function filter(collection, predicate) {\n      var func = isArray(collection) ? arrayFilter : baseFilter;\n      return func(collection, getIteratee(predicate, 3));\n    }\n\n    /**\n     * Iterates over elements of `collection`, returning the first element\n     * `predicate` returns truthy for. The predicate is invoked with three\n     * arguments: (value, index|key, collection).\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Collection\n     * @param {Array|Object} collection The collection to inspect.\n     * @param {Function} [predicate=_.identity] The function invoked per iteration.\n     * @param {number} [fromIndex=0] The index to search from.\n     * @returns {*} Returns the matched element, else `undefined`.\n     * @example\n     *\n     * var users = [\n     *   { 'user': 'barney',  'age': 36, 'active': true },\n     *   { 'user': 'fred',    'age': 40, 'active': false },\n     *   { 'user': 'pebbles', 'age': 1,  'active': true }\n     * ];\n     *\n     * _.find(users, function(o) { return o.age < 40; });\n     * // => object for 'barney'\n     *\n     * // The `_.matches` iteratee shorthand.\n     * _.find(users, { 'age': 1, 'active': true });\n     * // => object for 'pebbles'\n     *\n     * // The `_.matchesProperty` iteratee shorthand.\n     * _.find(users, ['active', false]);\n     * // => object for 'fred'\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.find(users, 'active');\n     * // => object for 'barney'\n     */\n    var find = createFind(findIndex);\n\n    /**\n     * This method is like `_.find` except that it iterates over elements of\n     * `collection` from right to left.\n     *\n     * @static\n     * @memberOf _\n     * @since 2.0.0\n     * @category Collection\n     * @param {Array|Object} collection The collection to inspect.\n     * @param {Function} [predicate=_.identity] The function invoked per iteration.\n     * @param {number} [fromIndex=collection.length-1] The index to search from.\n     * @returns {*} Returns the matched element, else `undefined`.\n     * @example\n     *\n     * _.findLast([1, 2, 3, 4], function(n) {\n     *   return n % 2 == 1;\n     * });\n     * // => 3\n     */\n    var findLast = createFind(findLastIndex);\n\n    /**\n     * Creates a flattened array of values by running each element in `collection`\n     * thru `iteratee` and flattening the mapped results. The iteratee is invoked\n     * with three arguments: (value, index|key, collection).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Collection\n     * @param {Array|Object} collection The collection to iterate over.\n     * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n     * @returns {Array} Returns the new flattened array.\n     * @example\n     *\n     * function duplicate(n) {\n     *   return [n, n];\n     * }\n     *\n     * _.flatMap([1, 2], duplicate);\n     * // => [1, 1, 2, 2]\n     */\n    function flatMap(collection, iteratee) {\n      return baseFlatten(map(collection, iteratee), 1);\n    }\n\n    /**\n     * This method is like `_.flatMap` except that it recursively flattens the\n     * mapped results.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.7.0\n     * @category Collection\n     * @param {Array|Object} collection The collection to iterate over.\n     * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n     * @returns {Array} Returns the new flattened array.\n     * @example\n     *\n     * function duplicate(n) {\n     *   return [[[n, n]]];\n     * }\n     *\n     * _.flatMapDeep([1, 2], duplicate);\n     * // => [1, 1, 2, 2]\n     */\n    function flatMapDeep(collection, iteratee) {\n      return baseFlatten(map(collection, iteratee), INFINITY);\n    }\n\n    /**\n     * This method is like `_.flatMap` except that it recursively flattens the\n     * mapped results up to `depth` times.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.7.0\n     * @category Collection\n     * @param {Array|Object} collection The collection to iterate over.\n     * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n     * @param {number} [depth=1] The maximum recursion depth.\n     * @returns {Array} Returns the new flattened array.\n     * @example\n     *\n     * function duplicate(n) {\n     *   return [[[n, n]]];\n     * }\n     *\n     * _.flatMapDepth([1, 2], duplicate, 2);\n     * // => [[1, 1], [2, 2]]\n     */\n    function flatMapDepth(collection, iteratee, depth) {\n      depth = depth === undefined ? 1 : toInteger(depth);\n      return baseFlatten(map(collection, iteratee), depth);\n    }\n\n    /**\n     * Iterates over elements of `collection` and invokes `iteratee` for each element.\n     * The iteratee is invoked with three arguments: (value, index|key, collection).\n     * Iteratee functions may exit iteration early by explicitly returning `false`.\n     *\n     * **Note:** As with other \"Collections\" methods, objects with a \"length\"\n     * property are iterated like arrays. To avoid this behavior use `_.forIn`\n     * or `_.forOwn` for object iteration.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @alias each\n     * @category Collection\n     * @param {Array|Object} collection The collection to iterate over.\n     * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n     * @returns {Array|Object} Returns `collection`.\n     * @see _.forEachRight\n     * @example\n     *\n     * _.forEach([1, 2], function(value) {\n     *   console.log(value);\n     * });\n     * // => Logs `1` then `2`.\n     *\n     * _.forEach({ 'a': 1, 'b': 2 }, function(value, key) {\n     *   console.log(key);\n     * });\n     * // => Logs 'a' then 'b' (iteration order is not guaranteed).\n     */\n    function forEach(collection, iteratee) {\n      var func = isArray(collection) ? arrayEach : baseEach;\n      return func(collection, getIteratee(iteratee, 3));\n    }\n\n    /**\n     * This method is like `_.forEach` except that it iterates over elements of\n     * `collection` from right to left.\n     *\n     * @static\n     * @memberOf _\n     * @since 2.0.0\n     * @alias eachRight\n     * @category Collection\n     * @param {Array|Object} collection The collection to iterate over.\n     * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n     * @returns {Array|Object} Returns `collection`.\n     * @see _.forEach\n     * @example\n     *\n     * _.forEachRight([1, 2], function(value) {\n     *   console.log(value);\n     * });\n     * // => Logs `2` then `1`.\n     */\n    function forEachRight(collection, iteratee) {\n      var func = isArray(collection) ? arrayEachRight : baseEachRight;\n      return func(collection, getIteratee(iteratee, 3));\n    }\n\n    /**\n     * Creates an object composed of keys generated from the results of running\n     * each element of `collection` thru `iteratee`. The order of grouped values\n     * is determined by the order they occur in `collection`. The corresponding\n     * value of each key is an array of elements responsible for generating the\n     * key. The iteratee is invoked with one argument: (value).\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Collection\n     * @param {Array|Object} collection The collection to iterate over.\n     * @param {Function} [iteratee=_.identity] The iteratee to transform keys.\n     * @returns {Object} Returns the composed aggregate object.\n     * @example\n     *\n     * _.groupBy([6.1, 4.2, 6.3], Math.floor);\n     * // => { '4': [4.2], '6': [6.1, 6.3] }\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.groupBy(['one', 'two', 'three'], 'length');\n     * // => { '3': ['one', 'two'], '5': ['three'] }\n     */\n    var groupBy = createAggregator(function(result, value, key) {\n      if (hasOwnProperty.call(result, key)) {\n        result[key].push(value);\n      } else {\n        baseAssignValue(result, key, [value]);\n      }\n    });\n\n    /**\n     * Checks if `value` is in `collection`. If `collection` is a string, it's\n     * checked for a substring of `value`, otherwise\n     * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n     * is used for equality comparisons. If `fromIndex` is negative, it's used as\n     * the offset from the end of `collection`.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Collection\n     * @param {Array|Object|string} collection The collection to inspect.\n     * @param {*} value The value to search for.\n     * @param {number} [fromIndex=0] The index to search from.\n     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.reduce`.\n     * @returns {boolean} Returns `true` if `value` is found, else `false`.\n     * @example\n     *\n     * _.includes([1, 2, 3], 1);\n     * // => true\n     *\n     * _.includes([1, 2, 3], 1, 2);\n     * // => false\n     *\n     * _.includes({ 'a': 1, 'b': 2 }, 1);\n     * // => true\n     *\n     * _.includes('abcd', 'bc');\n     * // => true\n     */\n    function includes(collection, value, fromIndex, guard) {\n      collection = isArrayLike(collection) ? collection : values(collection);\n      fromIndex = (fromIndex && !guard) ? toInteger(fromIndex) : 0;\n\n      var length = collection.length;\n      if (fromIndex < 0) {\n        fromIndex = nativeMax(length + fromIndex, 0);\n      }\n      return isString(collection)\n        ? (fromIndex <= length && collection.indexOf(value, fromIndex) > -1)\n        : (!!length && baseIndexOf(collection, value, fromIndex) > -1);\n    }\n\n    /**\n     * Invokes the method at `path` of each element in `collection`, returning\n     * an array of the results of each invoked method. Any additional arguments\n     * are provided to each invoked method. If `path` is a function, it's invoked\n     * for, and `this` bound to, each element in `collection`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Collection\n     * @param {Array|Object} collection The collection to iterate over.\n     * @param {Array|Function|string} path The path of the method to invoke or\n     *  the function invoked per iteration.\n     * @param {...*} [args] The arguments to invoke each method with.\n     * @returns {Array} Returns the array of results.\n     * @example\n     *\n     * _.invokeMap([[5, 1, 7], [3, 2, 1]], 'sort');\n     * // => [[1, 5, 7], [1, 2, 3]]\n     *\n     * _.invokeMap([123, 456], String.prototype.split, '');\n     * // => [['1', '2', '3'], ['4', '5', '6']]\n     */\n    var invokeMap = baseRest(function(collection, path, args) {\n      var index = -1,\n          isFunc = typeof path == 'function',\n          result = isArrayLike(collection) ? Array(collection.length) : [];\n\n      baseEach(collection, function(value) {\n        result[++index] = isFunc ? apply(path, value, args) : baseInvoke(value, path, args);\n      });\n      return result;\n    });\n\n    /**\n     * Creates an object composed of keys generated from the results of running\n     * each element of `collection` thru `iteratee`. The corresponding value of\n     * each key is the last element responsible for generating the key. The\n     * iteratee is invoked with one argument: (value).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Collection\n     * @param {Array|Object} collection The collection to iterate over.\n     * @param {Function} [iteratee=_.identity] The iteratee to transform keys.\n     * @returns {Object} Returns the composed aggregate object.\n     * @example\n     *\n     * var array = [\n     *   { 'dir': 'left', 'code': 97 },\n     *   { 'dir': 'right', 'code': 100 }\n     * ];\n     *\n     * _.keyBy(array, function(o) {\n     *   return String.fromCharCode(o.code);\n     * });\n     * // => { 'a': { 'dir': 'left', 'code': 97 }, 'd': { 'dir': 'right', 'code': 100 } }\n     *\n     * _.keyBy(array, 'dir');\n     * // => { 'left': { 'dir': 'left', 'code': 97 }, 'right': { 'dir': 'right', 'code': 100 } }\n     */\n    var keyBy = createAggregator(function(result, value, key) {\n      baseAssignValue(result, key, value);\n    });\n\n    /**\n     * Creates an array of values by running each element in `collection` thru\n     * `iteratee`. The iteratee is invoked with three arguments:\n     * (value, index|key, collection).\n     *\n     * Many lodash methods are guarded to work as iteratees for methods like\n     * `_.every`, `_.filter`, `_.map`, `_.mapValues`, `_.reject`, and `_.some`.\n     *\n     * The guarded methods are:\n     * `ary`, `chunk`, `curry`, `curryRight`, `drop`, `dropRight`, `every`,\n     * `fill`, `invert`, `parseInt`, `random`, `range`, `rangeRight`, `repeat`,\n     * `sampleSize`, `slice`, `some`, `sortBy`, `split`, `take`, `takeRight`,\n     * `template`, `trim`, `trimEnd`, `trimStart`, and `words`\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Collection\n     * @param {Array|Object} collection The collection to iterate over.\n     * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n     * @returns {Array} Returns the new mapped array.\n     * @example\n     *\n     * function square(n) {\n     *   return n * n;\n     * }\n     *\n     * _.map([4, 8], square);\n     * // => [16, 64]\n     *\n     * _.map({ 'a': 4, 'b': 8 }, square);\n     * // => [16, 64] (iteration order is not guaranteed)\n     *\n     * var users = [\n     *   { 'user': 'barney' },\n     *   { 'user': 'fred' }\n     * ];\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.map(users, 'user');\n     * // => ['barney', 'fred']\n     */\n    function map(collection, iteratee) {\n      var func = isArray(collection) ? arrayMap : baseMap;\n      return func(collection, getIteratee(iteratee, 3));\n    }\n\n    /**\n     * This method is like `_.sortBy` except that it allows specifying the sort\n     * orders of the iteratees to sort by. If `orders` is unspecified, all values\n     * are sorted in ascending order. Otherwise, specify an order of \"desc\" for\n     * descending or \"asc\" for ascending sort order of corresponding values.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Collection\n     * @param {Array|Object} collection The collection to iterate over.\n     * @param {Array[]|Function[]|Object[]|string[]} [iteratees=[_.identity]]\n     *  The iteratees to sort by.\n     * @param {string[]} [orders] The sort orders of `iteratees`.\n     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.reduce`.\n     * @returns {Array} Returns the new sorted array.\n     * @example\n     *\n     * var users = [\n     *   { 'user': 'fred',   'age': 48 },\n     *   { 'user': 'barney', 'age': 34 },\n     *   { 'user': 'fred',   'age': 40 },\n     *   { 'user': 'barney', 'age': 36 }\n     * ];\n     *\n     * // Sort by `user` in ascending order and by `age` in descending order.\n     * _.orderBy(users, ['user', 'age'], ['asc', 'desc']);\n     * // => objects for [['barney', 36], ['barney', 34], ['fred', 48], ['fred', 40]]\n     */\n    function orderBy(collection, iteratees, orders, guard) {\n      if (collection == null) {\n        return [];\n      }\n      if (!isArray(iteratees)) {\n        iteratees = iteratees == null ? [] : [iteratees];\n      }\n      orders = guard ? undefined : orders;\n      if (!isArray(orders)) {\n        orders = orders == null ? [] : [orders];\n      }\n      return baseOrderBy(collection, iteratees, orders);\n    }\n\n    /**\n     * Creates an array of elements split into two groups, the first of which\n     * contains elements `predicate` returns truthy for, the second of which\n     * contains elements `predicate` returns falsey for. The predicate is\n     * invoked with one argument: (value).\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category Collection\n     * @param {Array|Object} collection The collection to iterate over.\n     * @param {Function} [predicate=_.identity] The function invoked per iteration.\n     * @returns {Array} Returns the array of grouped elements.\n     * @example\n     *\n     * var users = [\n     *   { 'user': 'barney',  'age': 36, 'active': false },\n     *   { 'user': 'fred',    'age': 40, 'active': true },\n     *   { 'user': 'pebbles', 'age': 1,  'active': false }\n     * ];\n     *\n     * _.partition(users, function(o) { return o.active; });\n     * // => objects for [['fred'], ['barney', 'pebbles']]\n     *\n     * // The `_.matches` iteratee shorthand.\n     * _.partition(users, { 'age': 1, 'active': false });\n     * // => objects for [['pebbles'], ['barney', 'fred']]\n     *\n     * // The `_.matchesProperty` iteratee shorthand.\n     * _.partition(users, ['active', false]);\n     * // => objects for [['barney', 'pebbles'], ['fred']]\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.partition(users, 'active');\n     * // => objects for [['fred'], ['barney', 'pebbles']]\n     */\n    var partition = createAggregator(function(result, value, key) {\n      result[key ? 0 : 1].push(value);\n    }, function() { return [[], []]; });\n\n    /**\n     * Reduces `collection` to a value which is the accumulated result of running\n     * each element in `collection` thru `iteratee`, where each successive\n     * invocation is supplied the return value of the previous. If `accumulator`\n     * is not given, the first element of `collection` is used as the initial\n     * value. The iteratee is invoked with four arguments:\n     * (accumulator, value, index|key, collection).\n     *\n     * Many lodash methods are guarded to work as iteratees for methods like\n     * `_.reduce`, `_.reduceRight`, and `_.transform`.\n     *\n     * The guarded methods are:\n     * `assign`, `defaults`, `defaultsDeep`, `includes`, `merge`, `orderBy`,\n     * and `sortBy`\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Collection\n     * @param {Array|Object} collection The collection to iterate over.\n     * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n     * @param {*} [accumulator] The initial value.\n     * @returns {*} Returns the accumulated value.\n     * @see _.reduceRight\n     * @example\n     *\n     * _.reduce([1, 2], function(sum, n) {\n     *   return sum + n;\n     * }, 0);\n     * // => 3\n     *\n     * _.reduce({ 'a': 1, 'b': 2, 'c': 1 }, function(result, value, key) {\n     *   (result[value] || (result[value] = [])).push(key);\n     *   return result;\n     * }, {});\n     * // => { '1': ['a', 'c'], '2': ['b'] } (iteration order is not guaranteed)\n     */\n    function reduce(collection, iteratee, accumulator) {\n      var func = isArray(collection) ? arrayReduce : baseReduce,\n          initAccum = arguments.length < 3;\n\n      return func(collection, getIteratee(iteratee, 4), accumulator, initAccum, baseEach);\n    }\n\n    /**\n     * This method is like `_.reduce` except that it iterates over elements of\n     * `collection` from right to left.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Collection\n     * @param {Array|Object} collection The collection to iterate over.\n     * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n     * @param {*} [accumulator] The initial value.\n     * @returns {*} Returns the accumulated value.\n     * @see _.reduce\n     * @example\n     *\n     * var array = [[0, 1], [2, 3], [4, 5]];\n     *\n     * _.reduceRight(array, function(flattened, other) {\n     *   return flattened.concat(other);\n     * }, []);\n     * // => [4, 5, 2, 3, 0, 1]\n     */\n    function reduceRight(collection, iteratee, accumulator) {\n      var func = isArray(collection) ? arrayReduceRight : baseReduce,\n          initAccum = arguments.length < 3;\n\n      return func(collection, getIteratee(iteratee, 4), accumulator, initAccum, baseEachRight);\n    }\n\n    /**\n     * The opposite of `_.filter`; this method returns the elements of `collection`\n     * that `predicate` does **not** return truthy for.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Collection\n     * @param {Array|Object} collection The collection to iterate over.\n     * @param {Function} [predicate=_.identity] The function invoked per iteration.\n     * @returns {Array} Returns the new filtered array.\n     * @see _.filter\n     * @example\n     *\n     * var users = [\n     *   { 'user': 'barney', 'age': 36, 'active': false },\n     *   { 'user': 'fred',   'age': 40, 'active': true }\n     * ];\n     *\n     * _.reject(users, function(o) { return !o.active; });\n     * // => objects for ['fred']\n     *\n     * // The `_.matches` iteratee shorthand.\n     * _.reject(users, { 'age': 40, 'active': true });\n     * // => objects for ['barney']\n     *\n     * // The `_.matchesProperty` iteratee shorthand.\n     * _.reject(users, ['active', false]);\n     * // => objects for ['fred']\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.reject(users, 'active');\n     * // => objects for ['barney']\n     */\n    function reject(collection, predicate) {\n      var func = isArray(collection) ? arrayFilter : baseFilter;\n      return func(collection, negate(getIteratee(predicate, 3)));\n    }\n\n    /**\n     * Gets a random element from `collection`.\n     *\n     * @static\n     * @memberOf _\n     * @since 2.0.0\n     * @category Collection\n     * @param {Array|Object} collection The collection to sample.\n     * @returns {*} Returns the random element.\n     * @example\n     *\n     * _.sample([1, 2, 3, 4]);\n     * // => 2\n     */\n    function sample(collection) {\n      var func = isArray(collection) ? arraySample : baseSample;\n      return func(collection);\n    }\n\n    /**\n     * Gets `n` random elements at unique keys from `collection` up to the\n     * size of `collection`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Collection\n     * @param {Array|Object} collection The collection to sample.\n     * @param {number} [n=1] The number of elements to sample.\n     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n     * @returns {Array} Returns the random elements.\n     * @example\n     *\n     * _.sampleSize([1, 2, 3], 2);\n     * // => [3, 1]\n     *\n     * _.sampleSize([1, 2, 3], 4);\n     * // => [2, 3, 1]\n     */\n    function sampleSize(collection, n, guard) {\n      if ((guard ? isIterateeCall(collection, n, guard) : n === undefined)) {\n        n = 1;\n      } else {\n        n = toInteger(n);\n      }\n      var func = isArray(collection) ? arraySampleSize : baseSampleSize;\n      return func(collection, n);\n    }\n\n    /**\n     * Creates an array of shuffled values, using a version of the\n     * [Fisher-Yates shuffle](https://en.wikipedia.org/wiki/Fisher-Yates_shuffle).\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Collection\n     * @param {Array|Object} collection The collection to shuffle.\n     * @returns {Array} Returns the new shuffled array.\n     * @example\n     *\n     * _.shuffle([1, 2, 3, 4]);\n     * // => [4, 1, 3, 2]\n     */\n    function shuffle(collection) {\n      var func = isArray(collection) ? arrayShuffle : baseShuffle;\n      return func(collection);\n    }\n\n    /**\n     * Gets the size of `collection` by returning its length for array-like\n     * values or the number of own enumerable string keyed properties for objects.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Collection\n     * @param {Array|Object|string} collection The collection to inspect.\n     * @returns {number} Returns the collection size.\n     * @example\n     *\n     * _.size([1, 2, 3]);\n     * // => 3\n     *\n     * _.size({ 'a': 1, 'b': 2 });\n     * // => 2\n     *\n     * _.size('pebbles');\n     * // => 7\n     */\n    function size(collection) {\n      if (collection == null) {\n        return 0;\n      }\n      if (isArrayLike(collection)) {\n        return isString(collection) ? stringSize(collection) : collection.length;\n      }\n      var tag = getTag(collection);\n      if (tag == mapTag || tag == setTag) {\n        return collection.size;\n      }\n      return baseKeys(collection).length;\n    }\n\n    /**\n     * Checks if `predicate` returns truthy for **any** element of `collection`.\n     * Iteration is stopped once `predicate` returns truthy. The predicate is\n     * invoked with three arguments: (value, index|key, collection).\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Collection\n     * @param {Array|Object} collection The collection to iterate over.\n     * @param {Function} [predicate=_.identity] The function invoked per iteration.\n     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n     * @returns {boolean} Returns `true` if any element passes the predicate check,\n     *  else `false`.\n     * @example\n     *\n     * _.some([null, 0, 'yes', false], Boolean);\n     * // => true\n     *\n     * var users = [\n     *   { 'user': 'barney', 'active': true },\n     *   { 'user': 'fred',   'active': false }\n     * ];\n     *\n     * // The `_.matches` iteratee shorthand.\n     * _.some(users, { 'user': 'barney', 'active': false });\n     * // => false\n     *\n     * // The `_.matchesProperty` iteratee shorthand.\n     * _.some(users, ['active', false]);\n     * // => true\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.some(users, 'active');\n     * // => true\n     */\n    function some(collection, predicate, guard) {\n      var func = isArray(collection) ? arraySome : baseSome;\n      if (guard && isIterateeCall(collection, predicate, guard)) {\n        predicate = undefined;\n      }\n      return func(collection, getIteratee(predicate, 3));\n    }\n\n    /**\n     * Creates an array of elements, sorted in ascending order by the results of\n     * running each element in a collection thru each iteratee. This method\n     * performs a stable sort, that is, it preserves the original sort order of\n     * equal elements. The iteratees are invoked with one argument: (value).\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Collection\n     * @param {Array|Object} collection The collection to iterate over.\n     * @param {...(Function|Function[])} [iteratees=[_.identity]]\n     *  The iteratees to sort by.\n     * @returns {Array} Returns the new sorted array.\n     * @example\n     *\n     * var users = [\n     *   { 'user': 'fred',   'age': 48 },\n     *   { 'user': 'barney', 'age': 36 },\n     *   { 'user': 'fred',   'age': 30 },\n     *   { 'user': 'barney', 'age': 34 }\n     * ];\n     *\n     * _.sortBy(users, [function(o) { return o.user; }]);\n     * // => objects for [['barney', 36], ['barney', 34], ['fred', 48], ['fred', 30]]\n     *\n     * _.sortBy(users, ['user', 'age']);\n     * // => objects for [['barney', 34], ['barney', 36], ['fred', 30], ['fred', 48]]\n     */\n    var sortBy = baseRest(function(collection, iteratees) {\n      if (collection == null) {\n        return [];\n      }\n      var length = iteratees.length;\n      if (length > 1 && isIterateeCall(collection, iteratees[0], iteratees[1])) {\n        iteratees = [];\n      } else if (length > 2 && isIterateeCall(iteratees[0], iteratees[1], iteratees[2])) {\n        iteratees = [iteratees[0]];\n      }\n      return baseOrderBy(collection, baseFlatten(iteratees, 1), []);\n    });\n\n    /*------------------------------------------------------------------------*/\n\n    /**\n     * Gets the timestamp of the number of milliseconds that have elapsed since\n     * the Unix epoch (1 January 1970 00:00:00 UTC).\n     *\n     * @static\n     * @memberOf _\n     * @since 2.4.0\n     * @category Date\n     * @returns {number} Returns the timestamp.\n     * @example\n     *\n     * _.defer(function(stamp) {\n     *   console.log(_.now() - stamp);\n     * }, _.now());\n     * // => Logs the number of milliseconds it took for the deferred invocation.\n     */\n    var now = ctxNow || function() {\n      return root.Date.now();\n    };\n\n    /*------------------------------------------------------------------------*/\n\n    /**\n     * The opposite of `_.before`; this method creates a function that invokes\n     * `func` once it's called `n` or more times.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Function\n     * @param {number} n The number of calls before `func` is invoked.\n     * @param {Function} func The function to restrict.\n     * @returns {Function} Returns the new restricted function.\n     * @example\n     *\n     * var saves = ['profile', 'settings'];\n     *\n     * var done = _.after(saves.length, function() {\n     *   console.log('done saving!');\n     * });\n     *\n     * _.forEach(saves, function(type) {\n     *   asyncSave({ 'type': type, 'complete': done });\n     * });\n     * // => Logs 'done saving!' after the two async saves have completed.\n     */\n    function after(n, func) {\n      if (typeof func != 'function') {\n        throw new TypeError(FUNC_ERROR_TEXT);\n      }\n      n = toInteger(n);\n      return function() {\n        if (--n < 1) {\n          return func.apply(this, arguments);\n        }\n      };\n    }\n\n    /**\n     * Creates a function that invokes `func`, with up to `n` arguments,\n     * ignoring any additional arguments.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category Function\n     * @param {Function} func The function to cap arguments for.\n     * @param {number} [n=func.length] The arity cap.\n     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n     * @returns {Function} Returns the new capped function.\n     * @example\n     *\n     * _.map(['6', '8', '10'], _.ary(parseInt, 1));\n     * // => [6, 8, 10]\n     */\n    function ary(func, n, guard) {\n      n = guard ? undefined : n;\n      n = (func && n == null) ? func.length : n;\n      return createWrap(func, WRAP_ARY_FLAG, undefined, undefined, undefined, undefined, n);\n    }\n\n    /**\n     * Creates a function that invokes `func`, with the `this` binding and arguments\n     * of the created function, while it's called less than `n` times. Subsequent\n     * calls to the created function return the result of the last `func` invocation.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category Function\n     * @param {number} n The number of calls at which `func` is no longer invoked.\n     * @param {Function} func The function to restrict.\n     * @returns {Function} Returns the new restricted function.\n     * @example\n     *\n     * jQuery(element).on('click', _.before(5, addContactToList));\n     * // => Allows adding up to 4 contacts to the list.\n     */\n    function before(n, func) {\n      var result;\n      if (typeof func != 'function') {\n        throw new TypeError(FUNC_ERROR_TEXT);\n      }\n      n = toInteger(n);\n      return function() {\n        if (--n > 0) {\n          result = func.apply(this, arguments);\n        }\n        if (n <= 1) {\n          func = undefined;\n        }\n        return result;\n      };\n    }\n\n    /**\n     * Creates a function that invokes `func` with the `this` binding of `thisArg`\n     * and `partials` prepended to the arguments it receives.\n     *\n     * The `_.bind.placeholder` value, which defaults to `_` in monolithic builds,\n     * may be used as a placeholder for partially applied arguments.\n     *\n     * **Note:** Unlike native `Function#bind`, this method doesn't set the \"length\"\n     * property of bound functions.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Function\n     * @param {Function} func The function to bind.\n     * @param {*} thisArg The `this` binding of `func`.\n     * @param {...*} [partials] The arguments to be partially applied.\n     * @returns {Function} Returns the new bound function.\n     * @example\n     *\n     * function greet(greeting, punctuation) {\n     *   return greeting + ' ' + this.user + punctuation;\n     * }\n     *\n     * var object = { 'user': 'fred' };\n     *\n     * var bound = _.bind(greet, object, 'hi');\n     * bound('!');\n     * // => 'hi fred!'\n     *\n     * // Bound with placeholders.\n     * var bound = _.bind(greet, object, _, '!');\n     * bound('hi');\n     * // => 'hi fred!'\n     */\n    var bind = baseRest(function(func, thisArg, partials) {\n      var bitmask = WRAP_BIND_FLAG;\n      if (partials.length) {\n        var holders = replaceHolders(partials, getHolder(bind));\n        bitmask |= WRAP_PARTIAL_FLAG;\n      }\n      return createWrap(func, bitmask, thisArg, partials, holders);\n    });\n\n    /**\n     * Creates a function that invokes the method at `object[key]` with `partials`\n     * prepended to the arguments it receives.\n     *\n     * This method differs from `_.bind` by allowing bound functions to reference\n     * methods that may be redefined or don't yet exist. See\n     * [Peter Michaux's article](http://peter.michaux.ca/articles/lazy-function-definition-pattern)\n     * for more details.\n     *\n     * The `_.bindKey.placeholder` value, which defaults to `_` in monolithic\n     * builds, may be used as a placeholder for partially applied arguments.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.10.0\n     * @category Function\n     * @param {Object} object The object to invoke the method on.\n     * @param {string} key The key of the method.\n     * @param {...*} [partials] The arguments to be partially applied.\n     * @returns {Function} Returns the new bound function.\n     * @example\n     *\n     * var object = {\n     *   'user': 'fred',\n     *   'greet': function(greeting, punctuation) {\n     *     return greeting + ' ' + this.user + punctuation;\n     *   }\n     * };\n     *\n     * var bound = _.bindKey(object, 'greet', 'hi');\n     * bound('!');\n     * // => 'hi fred!'\n     *\n     * object.greet = function(greeting, punctuation) {\n     *   return greeting + 'ya ' + this.user + punctuation;\n     * };\n     *\n     * bound('!');\n     * // => 'hiya fred!'\n     *\n     * // Bound with placeholders.\n     * var bound = _.bindKey(object, 'greet', _, '!');\n     * bound('hi');\n     * // => 'hiya fred!'\n     */\n    var bindKey = baseRest(function(object, key, partials) {\n      var bitmask = WRAP_BIND_FLAG | WRAP_BIND_KEY_FLAG;\n      if (partials.length) {\n        var holders = replaceHolders(partials, getHolder(bindKey));\n        bitmask |= WRAP_PARTIAL_FLAG;\n      }\n      return createWrap(key, bitmask, object, partials, holders);\n    });\n\n    /**\n     * Creates a function that accepts arguments of `func` and either invokes\n     * `func` returning its result, if at least `arity` number of arguments have\n     * been provided, or returns a function that accepts the remaining `func`\n     * arguments, and so on. The arity of `func` may be specified if `func.length`\n     * is not sufficient.\n     *\n     * The `_.curry.placeholder` value, which defaults to `_` in monolithic builds,\n     * may be used as a placeholder for provided arguments.\n     *\n     * **Note:** This method doesn't set the \"length\" property of curried functions.\n     *\n     * @static\n     * @memberOf _\n     * @since 2.0.0\n     * @category Function\n     * @param {Function} func The function to curry.\n     * @param {number} [arity=func.length] The arity of `func`.\n     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n     * @returns {Function} Returns the new curried function.\n     * @example\n     *\n     * var abc = function(a, b, c) {\n     *   return [a, b, c];\n     * };\n     *\n     * var curried = _.curry(abc);\n     *\n     * curried(1)(2)(3);\n     * // => [1, 2, 3]\n     *\n     * curried(1, 2)(3);\n     * // => [1, 2, 3]\n     *\n     * curried(1, 2, 3);\n     * // => [1, 2, 3]\n     *\n     * // Curried with placeholders.\n     * curried(1)(_, 3)(2);\n     * // => [1, 2, 3]\n     */\n    function curry(func, arity, guard) {\n      arity = guard ? undefined : arity;\n      var result = createWrap(func, WRAP_CURRY_FLAG, undefined, undefined, undefined, undefined, undefined, arity);\n      result.placeholder = curry.placeholder;\n      return result;\n    }\n\n    /**\n     * This method is like `_.curry` except that arguments are applied to `func`\n     * in the manner of `_.partialRight` instead of `_.partial`.\n     *\n     * The `_.curryRight.placeholder` value, which defaults to `_` in monolithic\n     * builds, may be used as a placeholder for provided arguments.\n     *\n     * **Note:** This method doesn't set the \"length\" property of curried functions.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category Function\n     * @param {Function} func The function to curry.\n     * @param {number} [arity=func.length] The arity of `func`.\n     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n     * @returns {Function} Returns the new curried function.\n     * @example\n     *\n     * var abc = function(a, b, c) {\n     *   return [a, b, c];\n     * };\n     *\n     * var curried = _.curryRight(abc);\n     *\n     * curried(3)(2)(1);\n     * // => [1, 2, 3]\n     *\n     * curried(2, 3)(1);\n     * // => [1, 2, 3]\n     *\n     * curried(1, 2, 3);\n     * // => [1, 2, 3]\n     *\n     * // Curried with placeholders.\n     * curried(3)(1, _)(2);\n     * // => [1, 2, 3]\n     */\n    function curryRight(func, arity, guard) {\n      arity = guard ? undefined : arity;\n      var result = createWrap(func, WRAP_CURRY_RIGHT_FLAG, undefined, undefined, undefined, undefined, undefined, arity);\n      result.placeholder = curryRight.placeholder;\n      return result;\n    }\n\n    /**\n     * Creates a debounced function that delays invoking `func` until after `wait`\n     * milliseconds have elapsed since the last time the debounced function was\n     * invoked. The debounced function comes with a `cancel` method to cancel\n     * delayed `func` invocations and a `flush` method to immediately invoke them.\n     * Provide `options` to indicate whether `func` should be invoked on the\n     * leading and/or trailing edge of the `wait` timeout. The `func` is invoked\n     * with the last arguments provided to the debounced function. Subsequent\n     * calls to the debounced function return the result of the last `func`\n     * invocation.\n     *\n     * **Note:** If `leading` and `trailing` options are `true`, `func` is\n     * invoked on the trailing edge of the timeout only if the debounced function\n     * is invoked more than once during the `wait` timeout.\n     *\n     * If `wait` is `0` and `leading` is `false`, `func` invocation is deferred\n     * until to the next tick, similar to `setTimeout` with a timeout of `0`.\n     *\n     * See [David Corbacho's article](https://css-tricks.com/debouncing-throttling-explained-examples/)\n     * for details over the differences between `_.debounce` and `_.throttle`.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Function\n     * @param {Function} func The function to debounce.\n     * @param {number} [wait=0] The number of milliseconds to delay.\n     * @param {Object} [options={}] The options object.\n     * @param {boolean} [options.leading=false]\n     *  Specify invoking on the leading edge of the timeout.\n     * @param {number} [options.maxWait]\n     *  The maximum time `func` is allowed to be delayed before it's invoked.\n     * @param {boolean} [options.trailing=true]\n     *  Specify invoking on the trailing edge of the timeout.\n     * @returns {Function} Returns the new debounced function.\n     * @example\n     *\n     * // Avoid costly calculations while the window size is in flux.\n     * jQuery(window).on('resize', _.debounce(calculateLayout, 150));\n     *\n     * // Invoke `sendMail` when clicked, debouncing subsequent calls.\n     * jQuery(element).on('click', _.debounce(sendMail, 300, {\n     *   'leading': true,\n     *   'trailing': false\n     * }));\n     *\n     * // Ensure `batchLog` is invoked once after 1 second of debounced calls.\n     * var debounced = _.debounce(batchLog, 250, { 'maxWait': 1000 });\n     * var source = new EventSource('/stream');\n     * jQuery(source).on('message', debounced);\n     *\n     * // Cancel the trailing debounced invocation.\n     * jQuery(window).on('popstate', debounced.cancel);\n     */\n    function debounce(func, wait, options) {\n      var lastArgs,\n          lastThis,\n          maxWait,\n          result,\n          timerId,\n          lastCallTime,\n          lastInvokeTime = 0,\n          leading = false,\n          maxing = false,\n          trailing = true;\n\n      if (typeof func != 'function') {\n        throw new TypeError(FUNC_ERROR_TEXT);\n      }\n      wait = toNumber(wait) || 0;\n      if (isObject(options)) {\n        leading = !!options.leading;\n        maxing = 'maxWait' in options;\n        maxWait = maxing ? nativeMax(toNumber(options.maxWait) || 0, wait) : maxWait;\n        trailing = 'trailing' in options ? !!options.trailing : trailing;\n      }\n\n      function invokeFunc(time) {\n        var args = lastArgs,\n            thisArg = lastThis;\n\n        lastArgs = lastThis = undefined;\n        lastInvokeTime = time;\n        result = func.apply(thisArg, args);\n        return result;\n      }\n\n      function leadingEdge(time) {\n        // Reset any `maxWait` timer.\n        lastInvokeTime = time;\n        // Start the timer for the trailing edge.\n        timerId = setTimeout(timerExpired, wait);\n        // Invoke the leading edge.\n        return leading ? invokeFunc(time) : result;\n      }\n\n      function remainingWait(time) {\n        var timeSinceLastCall = time - lastCallTime,\n            timeSinceLastInvoke = time - lastInvokeTime,\n            timeWaiting = wait - timeSinceLastCall;\n\n        return maxing\n          ? nativeMin(timeWaiting, maxWait - timeSinceLastInvoke)\n          : timeWaiting;\n      }\n\n      function shouldInvoke(time) {\n        var timeSinceLastCall = time - lastCallTime,\n            timeSinceLastInvoke = time - lastInvokeTime;\n\n        // Either this is the first call, activity has stopped and we're at the\n        // trailing edge, the system time has gone backwards and we're treating\n        // it as the trailing edge, or we've hit the `maxWait` limit.\n        return (lastCallTime === undefined || (timeSinceLastCall >= wait) ||\n          (timeSinceLastCall < 0) || (maxing && timeSinceLastInvoke >= maxWait));\n      }\n\n      function timerExpired() {\n        var time = now();\n        if (shouldInvoke(time)) {\n          return trailingEdge(time);\n        }\n        // Restart the timer.\n        timerId = setTimeout(timerExpired, remainingWait(time));\n      }\n\n      function trailingEdge(time) {\n        timerId = undefined;\n\n        // Only invoke if we have `lastArgs` which means `func` has been\n        // debounced at least once.\n        if (trailing && lastArgs) {\n          return invokeFunc(time);\n        }\n        lastArgs = lastThis = undefined;\n        return result;\n      }\n\n      function cancel() {\n        if (timerId !== undefined) {\n          clearTimeout(timerId);\n        }\n        lastInvokeTime = 0;\n        lastArgs = lastCallTime = lastThis = timerId = undefined;\n      }\n\n      function flush() {\n        return timerId === undefined ? result : trailingEdge(now());\n      }\n\n      function debounced() {\n        var time = now(),\n            isInvoking = shouldInvoke(time);\n\n        lastArgs = arguments;\n        lastThis = this;\n        lastCallTime = time;\n\n        if (isInvoking) {\n          if (timerId === undefined) {\n            return leadingEdge(lastCallTime);\n          }\n          if (maxing) {\n            // Handle invocations in a tight loop.\n            clearTimeout(timerId);\n            timerId = setTimeout(timerExpired, wait);\n            return invokeFunc(lastCallTime);\n          }\n        }\n        if (timerId === undefined) {\n          timerId = setTimeout(timerExpired, wait);\n        }\n        return result;\n      }\n      debounced.cancel = cancel;\n      debounced.flush = flush;\n      return debounced;\n    }\n\n    /**\n     * Defers invoking the `func` until the current call stack has cleared. Any\n     * additional arguments are provided to `func` when it's invoked.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Function\n     * @param {Function} func The function to defer.\n     * @param {...*} [args] The arguments to invoke `func` with.\n     * @returns {number} Returns the timer id.\n     * @example\n     *\n     * _.defer(function(text) {\n     *   console.log(text);\n     * }, 'deferred');\n     * // => Logs 'deferred' after one millisecond.\n     */\n    var defer = baseRest(function(func, args) {\n      return baseDelay(func, 1, args);\n    });\n\n    /**\n     * Invokes `func` after `wait` milliseconds. Any additional arguments are\n     * provided to `func` when it's invoked.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Function\n     * @param {Function} func The function to delay.\n     * @param {number} wait The number of milliseconds to delay invocation.\n     * @param {...*} [args] The arguments to invoke `func` with.\n     * @returns {number} Returns the timer id.\n     * @example\n     *\n     * _.delay(function(text) {\n     *   console.log(text);\n     * }, 1000, 'later');\n     * // => Logs 'later' after one second.\n     */\n    var delay = baseRest(function(func, wait, args) {\n      return baseDelay(func, toNumber(wait) || 0, args);\n    });\n\n    /**\n     * Creates a function that invokes `func` with arguments reversed.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Function\n     * @param {Function} func The function to flip arguments for.\n     * @returns {Function} Returns the new flipped function.\n     * @example\n     *\n     * var flipped = _.flip(function() {\n     *   return _.toArray(arguments);\n     * });\n     *\n     * flipped('a', 'b', 'c', 'd');\n     * // => ['d', 'c', 'b', 'a']\n     */\n    function flip(func) {\n      return createWrap(func, WRAP_FLIP_FLAG);\n    }\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     */\n    function 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`.\n    memoize.Cache = MapCache;\n\n    /**\n     * Creates a function that negates the result of the predicate `func`. The\n     * `func` predicate is invoked with the `this` binding and arguments of the\n     * created function.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category Function\n     * @param {Function} predicate The predicate to negate.\n     * @returns {Function} Returns the new negated function.\n     * @example\n     *\n     * function isEven(n) {\n     *   return n % 2 == 0;\n     * }\n     *\n     * _.filter([1, 2, 3, 4, 5, 6], _.negate(isEven));\n     * // => [1, 3, 5]\n     */\n    function negate(predicate) {\n      if (typeof predicate != 'function') {\n        throw new TypeError(FUNC_ERROR_TEXT);\n      }\n      return function() {\n        var args = arguments;\n        switch (args.length) {\n          case 0: return !predicate.call(this);\n          case 1: return !predicate.call(this, args[0]);\n          case 2: return !predicate.call(this, args[0], args[1]);\n          case 3: return !predicate.call(this, args[0], args[1], args[2]);\n        }\n        return !predicate.apply(this, args);\n      };\n    }\n\n    /**\n     * Creates a function that is restricted to invoking `func` once. Repeat calls\n     * to the function return the value of the first invocation. The `func` is\n     * invoked with the `this` binding and arguments of the created function.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Function\n     * @param {Function} func The function to restrict.\n     * @returns {Function} Returns the new restricted function.\n     * @example\n     *\n     * var initialize = _.once(createApplication);\n     * initialize();\n     * initialize();\n     * // => `createApplication` is invoked once\n     */\n    function once(func) {\n      return before(2, func);\n    }\n\n    /**\n     * Creates a function that invokes `func` with its arguments transformed.\n     *\n     * @static\n     * @since 4.0.0\n     * @memberOf _\n     * @category Function\n     * @param {Function} func The function to wrap.\n     * @param {...(Function|Function[])} [transforms=[_.identity]]\n     *  The argument transforms.\n     * @returns {Function} Returns the new function.\n     * @example\n     *\n     * function doubled(n) {\n     *   return n * 2;\n     * }\n     *\n     * function square(n) {\n     *   return n * n;\n     * }\n     *\n     * var func = _.overArgs(function(x, y) {\n     *   return [x, y];\n     * }, [square, doubled]);\n     *\n     * func(9, 3);\n     * // => [81, 6]\n     *\n     * func(10, 5);\n     * // => [100, 10]\n     */\n    var overArgs = castRest(function(func, transforms) {\n      transforms = (transforms.length == 1 && isArray(transforms[0]))\n        ? arrayMap(transforms[0], baseUnary(getIteratee()))\n        : arrayMap(baseFlatten(transforms, 1), baseUnary(getIteratee()));\n\n      var funcsLength = transforms.length;\n      return baseRest(function(args) {\n        var index = -1,\n            length = nativeMin(args.length, funcsLength);\n\n        while (++index < length) {\n          args[index] = transforms[index].call(this, args[index]);\n        }\n        return apply(func, this, args);\n      });\n    });\n\n    /**\n     * Creates a function that invokes `func` with `partials` prepended to the\n     * arguments it receives. This method is like `_.bind` except it does **not**\n     * alter the `this` binding.\n     *\n     * The `_.partial.placeholder` value, which defaults to `_` in monolithic\n     * builds, may be used as a placeholder for partially applied arguments.\n     *\n     * **Note:** This method doesn't set the \"length\" property of partially\n     * applied functions.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.2.0\n     * @category Function\n     * @param {Function} func The function to partially apply arguments to.\n     * @param {...*} [partials] The arguments to be partially applied.\n     * @returns {Function} Returns the new partially applied function.\n     * @example\n     *\n     * function greet(greeting, name) {\n     *   return greeting + ' ' + name;\n     * }\n     *\n     * var sayHelloTo = _.partial(greet, 'hello');\n     * sayHelloTo('fred');\n     * // => 'hello fred'\n     *\n     * // Partially applied with placeholders.\n     * var greetFred = _.partial(greet, _, 'fred');\n     * greetFred('hi');\n     * // => 'hi fred'\n     */\n    var partial = baseRest(function(func, partials) {\n      var holders = replaceHolders(partials, getHolder(partial));\n      return createWrap(func, WRAP_PARTIAL_FLAG, undefined, partials, holders);\n    });\n\n    /**\n     * This method is like `_.partial` except that partially applied arguments\n     * are appended to the arguments it receives.\n     *\n     * The `_.partialRight.placeholder` value, which defaults to `_` in monolithic\n     * builds, may be used as a placeholder for partially applied arguments.\n     *\n     * **Note:** This method doesn't set the \"length\" property of partially\n     * applied functions.\n     *\n     * @static\n     * @memberOf _\n     * @since 1.0.0\n     * @category Function\n     * @param {Function} func The function to partially apply arguments to.\n     * @param {...*} [partials] The arguments to be partially applied.\n     * @returns {Function} Returns the new partially applied function.\n     * @example\n     *\n     * function greet(greeting, name) {\n     *   return greeting + ' ' + name;\n     * }\n     *\n     * var greetFred = _.partialRight(greet, 'fred');\n     * greetFred('hi');\n     * // => 'hi fred'\n     *\n     * // Partially applied with placeholders.\n     * var sayHelloTo = _.partialRight(greet, 'hello', _);\n     * sayHelloTo('fred');\n     * // => 'hello fred'\n     */\n    var partialRight = baseRest(function(func, partials) {\n      var holders = replaceHolders(partials, getHolder(partialRight));\n      return createWrap(func, WRAP_PARTIAL_RIGHT_FLAG, undefined, partials, holders);\n    });\n\n    /**\n     * Creates a function that invokes `func` with arguments arranged according\n     * to the specified `indexes` where the argument value at the first index is\n     * provided as the first argument, the argument value at the second index is\n     * provided as the second argument, and so on.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category Function\n     * @param {Function} func The function to rearrange arguments for.\n     * @param {...(number|number[])} indexes The arranged argument indexes.\n     * @returns {Function} Returns the new function.\n     * @example\n     *\n     * var rearged = _.rearg(function(a, b, c) {\n     *   return [a, b, c];\n     * }, [2, 0, 1]);\n     *\n     * rearged('b', 'c', 'a')\n     * // => ['a', 'b', 'c']\n     */\n    var rearg = flatRest(function(func, indexes) {\n      return createWrap(func, WRAP_REARG_FLAG, undefined, undefined, undefined, indexes);\n    });\n\n    /**\n     * Creates a function that invokes `func` with the `this` binding of the\n     * created function and arguments from `start` and beyond provided as\n     * an array.\n     *\n     * **Note:** This method is based on the\n     * [rest parameter](https://mdn.io/rest_parameters).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Function\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     * @example\n     *\n     * var say = _.rest(function(what, names) {\n     *   return what + ' ' + _.initial(names).join(', ') +\n     *     (_.size(names) > 1 ? ', & ' : '') + _.last(names);\n     * });\n     *\n     * say('hello', 'fred', 'barney', 'pebbles');\n     * // => 'hello fred, barney, & pebbles'\n     */\n    function rest(func, start) {\n      if (typeof func != 'function') {\n        throw new TypeError(FUNC_ERROR_TEXT);\n      }\n      start = start === undefined ? start : toInteger(start);\n      return baseRest(func, start);\n    }\n\n    /**\n     * Creates a function that invokes `func` with the `this` binding of the\n     * create function and an array of arguments much like\n     * [`Function#apply`](http://www.ecma-international.org/ecma-262/7.0/#sec-function.prototype.apply).\n     *\n     * **Note:** This method is based on the\n     * [spread operator](https://mdn.io/spread_operator).\n     *\n     * @static\n     * @memberOf _\n     * @since 3.2.0\n     * @category Function\n     * @param {Function} func The function to spread arguments over.\n     * @param {number} [start=0] The start position of the spread.\n     * @returns {Function} Returns the new function.\n     * @example\n     *\n     * var say = _.spread(function(who, what) {\n     *   return who + ' says ' + what;\n     * });\n     *\n     * say(['fred', 'hello']);\n     * // => 'fred says hello'\n     *\n     * var numbers = Promise.all([\n     *   Promise.resolve(40),\n     *   Promise.resolve(36)\n     * ]);\n     *\n     * numbers.then(_.spread(function(x, y) {\n     *   return x + y;\n     * }));\n     * // => a Promise of 76\n     */\n    function spread(func, start) {\n      if (typeof func != 'function') {\n        throw new TypeError(FUNC_ERROR_TEXT);\n      }\n      start = start == null ? 0 : nativeMax(toInteger(start), 0);\n      return baseRest(function(args) {\n        var array = args[start],\n            otherArgs = castSlice(args, 0, start);\n\n        if (array) {\n          arrayPush(otherArgs, array);\n        }\n        return apply(func, this, otherArgs);\n      });\n    }\n\n    /**\n     * Creates a throttled function that only invokes `func` at most once per\n     * every `wait` milliseconds. The throttled function comes with a `cancel`\n     * method to cancel delayed `func` invocations and a `flush` method to\n     * immediately invoke them. Provide `options` to indicate whether `func`\n     * should be invoked on the leading and/or trailing edge of the `wait`\n     * timeout. The `func` is invoked with the last arguments provided to the\n     * throttled function. Subsequent calls to the throttled function return the\n     * result of the last `func` invocation.\n     *\n     * **Note:** If `leading` and `trailing` options are `true`, `func` is\n     * invoked on the trailing edge of the timeout only if the throttled function\n     * is invoked more than once during the `wait` timeout.\n     *\n     * If `wait` is `0` and `leading` is `false`, `func` invocation is deferred\n     * until to the next tick, similar to `setTimeout` with a timeout of `0`.\n     *\n     * See [David Corbacho's article](https://css-tricks.com/debouncing-throttling-explained-examples/)\n     * for details over the differences between `_.throttle` and `_.debounce`.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Function\n     * @param {Function} func The function to throttle.\n     * @param {number} [wait=0] The number of milliseconds to throttle invocations to.\n     * @param {Object} [options={}] The options object.\n     * @param {boolean} [options.leading=true]\n     *  Specify invoking on the leading edge of the timeout.\n     * @param {boolean} [options.trailing=true]\n     *  Specify invoking on the trailing edge of the timeout.\n     * @returns {Function} Returns the new throttled function.\n     * @example\n     *\n     * // Avoid excessively updating the position while scrolling.\n     * jQuery(window).on('scroll', _.throttle(updatePosition, 100));\n     *\n     * // Invoke `renewToken` when the click event is fired, but not more than once every 5 minutes.\n     * var throttled = _.throttle(renewToken, 300000, { 'trailing': false });\n     * jQuery(element).on('click', throttled);\n     *\n     * // Cancel the trailing throttled invocation.\n     * jQuery(window).on('popstate', throttled.cancel);\n     */\n    function throttle(func, wait, options) {\n      var leading = true,\n          trailing = true;\n\n      if (typeof func != 'function') {\n        throw new TypeError(FUNC_ERROR_TEXT);\n      }\n      if (isObject(options)) {\n        leading = 'leading' in options ? !!options.leading : leading;\n        trailing = 'trailing' in options ? !!options.trailing : trailing;\n      }\n      return debounce(func, wait, {\n        'leading': leading,\n        'maxWait': wait,\n        'trailing': trailing\n      });\n    }\n\n    /**\n     * Creates a function that accepts up to one argument, ignoring any\n     * additional arguments.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Function\n     * @param {Function} func The function to cap arguments for.\n     * @returns {Function} Returns the new capped function.\n     * @example\n     *\n     * _.map(['6', '8', '10'], _.unary(parseInt));\n     * // => [6, 8, 10]\n     */\n    function unary(func) {\n      return ary(func, 1);\n    }\n\n    /**\n     * Creates a function that provides `value` to `wrapper` as its first\n     * argument. Any additional arguments provided to the function are appended\n     * to those provided to the `wrapper`. The wrapper is invoked with the `this`\n     * binding of the created function.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Function\n     * @param {*} value The value to wrap.\n     * @param {Function} [wrapper=identity] The wrapper function.\n     * @returns {Function} Returns the new function.\n     * @example\n     *\n     * var p = _.wrap(_.escape, function(func, text) {\n     *   return '<p>' + func(text) + '</p>';\n     * });\n     *\n     * p('fred, barney, & pebbles');\n     * // => '<p>fred, barney, &amp; pebbles</p>'\n     */\n    function wrap(value, wrapper) {\n      return partial(castFunction(wrapper), value);\n    }\n\n    /*------------------------------------------------------------------------*/\n\n    /**\n     * Casts `value` as an array if it's not one.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.4.0\n     * @category Lang\n     * @param {*} value The value to inspect.\n     * @returns {Array} Returns the cast array.\n     * @example\n     *\n     * _.castArray(1);\n     * // => [1]\n     *\n     * _.castArray({ 'a': 1 });\n     * // => [{ 'a': 1 }]\n     *\n     * _.castArray('abc');\n     * // => ['abc']\n     *\n     * _.castArray(null);\n     * // => [null]\n     *\n     * _.castArray(undefined);\n     * // => [undefined]\n     *\n     * _.castArray();\n     * // => []\n     *\n     * var array = [1, 2, 3];\n     * console.log(_.castArray(array) === array);\n     * // => true\n     */\n    function castArray() {\n      if (!arguments.length) {\n        return [];\n      }\n      var value = arguments[0];\n      return isArray(value) ? value : [value];\n    }\n\n    /**\n     * Creates a shallow clone of `value`.\n     *\n     * **Note:** This method is loosely based on the\n     * [structured clone algorithm](https://mdn.io/Structured_clone_algorithm)\n     * and supports cloning arrays, array buffers, booleans, date objects, maps,\n     * numbers, `Object` objects, regexes, sets, strings, symbols, and typed\n     * arrays. The own enumerable properties of `arguments` objects are cloned\n     * as plain objects. An empty object is returned for uncloneable values such\n     * as error objects, functions, DOM nodes, and WeakMaps.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Lang\n     * @param {*} value The value to clone.\n     * @returns {*} Returns the cloned value.\n     * @see _.cloneDeep\n     * @example\n     *\n     * var objects = [{ 'a': 1 }, { 'b': 2 }];\n     *\n     * var shallow = _.clone(objects);\n     * console.log(shallow[0] === objects[0]);\n     * // => true\n     */\n    function clone(value) {\n      return baseClone(value, CLONE_SYMBOLS_FLAG);\n    }\n\n    /**\n     * This method is like `_.clone` except that it accepts `customizer` which\n     * is invoked to produce the cloned value. If `customizer` returns `undefined`,\n     * cloning is handled by the method instead. The `customizer` is invoked with\n     * up to four arguments; (value [, index|key, object, stack]).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Lang\n     * @param {*} value The value to clone.\n     * @param {Function} [customizer] The function to customize cloning.\n     * @returns {*} Returns the cloned value.\n     * @see _.cloneDeepWith\n     * @example\n     *\n     * function customizer(value) {\n     *   if (_.isElement(value)) {\n     *     return value.cloneNode(false);\n     *   }\n     * }\n     *\n     * var el = _.cloneWith(document.body, customizer);\n     *\n     * console.log(el === document.body);\n     * // => false\n     * console.log(el.nodeName);\n     * // => 'BODY'\n     * console.log(el.childNodes.length);\n     * // => 0\n     */\n    function cloneWith(value, customizer) {\n      customizer = typeof customizer == 'function' ? customizer : undefined;\n      return baseClone(value, CLONE_SYMBOLS_FLAG, customizer);\n    }\n\n    /**\n     * This method is like `_.clone` except that it recursively clones `value`.\n     *\n     * @static\n     * @memberOf _\n     * @since 1.0.0\n     * @category Lang\n     * @param {*} value The value to recursively clone.\n     * @returns {*} Returns the deep cloned value.\n     * @see _.clone\n     * @example\n     *\n     * var objects = [{ 'a': 1 }, { 'b': 2 }];\n     *\n     * var deep = _.cloneDeep(objects);\n     * console.log(deep[0] === objects[0]);\n     * // => false\n     */\n    function cloneDeep(value) {\n      return baseClone(value, CLONE_DEEP_FLAG | CLONE_SYMBOLS_FLAG);\n    }\n\n    /**\n     * This method is like `_.cloneWith` except that it recursively clones `value`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Lang\n     * @param {*} value The value to recursively clone.\n     * @param {Function} [customizer] The function to customize cloning.\n     * @returns {*} Returns the deep cloned value.\n     * @see _.cloneWith\n     * @example\n     *\n     * function customizer(value) {\n     *   if (_.isElement(value)) {\n     *     return value.cloneNode(true);\n     *   }\n     * }\n     *\n     * var el = _.cloneDeepWith(document.body, customizer);\n     *\n     * console.log(el === document.body);\n     * // => false\n     * console.log(el.nodeName);\n     * // => 'BODY'\n     * console.log(el.childNodes.length);\n     * // => 20\n     */\n    function cloneDeepWith(value, customizer) {\n      customizer = typeof customizer == 'function' ? customizer : undefined;\n      return baseClone(value, CLONE_DEEP_FLAG | CLONE_SYMBOLS_FLAG, customizer);\n    }\n\n    /**\n     * Checks if `object` conforms to `source` by invoking the predicate\n     * properties of `source` with the corresponding property values of `object`.\n     *\n     * **Note:** This method is equivalent to `_.conforms` when `source` is\n     * partially applied.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.14.0\n     * @category Lang\n     * @param {Object} object The object to inspect.\n     * @param {Object} source The object of property predicates to conform to.\n     * @returns {boolean} Returns `true` if `object` conforms, else `false`.\n     * @example\n     *\n     * var object = { 'a': 1, 'b': 2 };\n     *\n     * _.conformsTo(object, { 'b': function(n) { return n > 1; } });\n     * // => true\n     *\n     * _.conformsTo(object, { 'b': function(n) { return n > 2; } });\n     * // => false\n     */\n    function conformsTo(object, source) {\n      return source == null || baseConformsTo(object, source, keys(source));\n    }\n\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     */\n    function eq(value, other) {\n      return value === other || (value !== value && other !== other);\n    }\n\n    /**\n     * Checks if `value` is greater than `other`.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.9.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 `value` is greater than `other`,\n     *  else `false`.\n     * @see _.lt\n     * @example\n     *\n     * _.gt(3, 1);\n     * // => true\n     *\n     * _.gt(3, 3);\n     * // => false\n     *\n     * _.gt(1, 3);\n     * // => false\n     */\n    var gt = createRelationalOperation(baseGt);\n\n    /**\n     * Checks if `value` is greater than or equal to `other`.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.9.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 `value` is greater than or equal to\n     *  `other`, else `false`.\n     * @see _.lte\n     * @example\n     *\n     * _.gte(3, 1);\n     * // => true\n     *\n     * _.gte(3, 3);\n     * // => true\n     *\n     * _.gte(1, 3);\n     * // => false\n     */\n    var gte = createRelationalOperation(function(value, other) {\n      return value >= other;\n    });\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     */\n    var isArguments = baseIsArguments(function() { return arguments; }()) ? baseIsArguments : function(value) {\n      return isObjectLike(value) && hasOwnProperty.call(value, 'callee') &&\n        !propertyIsEnumerable.call(value, 'callee');\n    };\n\n    /**\n     * Checks if `value` is classified as an `Array` 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 array, else `false`.\n     * @example\n     *\n     * _.isArray([1, 2, 3]);\n     * // => true\n     *\n     * _.isArray(document.body.children);\n     * // => false\n     *\n     * _.isArray('abc');\n     * // => false\n     *\n     * _.isArray(_.noop);\n     * // => false\n     */\n    var isArray = Array.isArray;\n\n    /**\n     * Checks if `value` is classified as an `ArrayBuffer` object.\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 an array buffer, else `false`.\n     * @example\n     *\n     * _.isArrayBuffer(new ArrayBuffer(2));\n     * // => true\n     *\n     * _.isArrayBuffer(new Array(2));\n     * // => false\n     */\n    var isArrayBuffer = nodeIsArrayBuffer ? baseUnary(nodeIsArrayBuffer) : baseIsArrayBuffer;\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     */\n    function isArrayLike(value) {\n      return value != null && isLength(value.length) && !isFunction(value);\n    }\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     */\n    function isArrayLikeObject(value) {\n      return isObjectLike(value) && isArrayLike(value);\n    }\n\n    /**\n     * Checks if `value` is classified as a boolean primitive or 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 boolean, else `false`.\n     * @example\n     *\n     * _.isBoolean(false);\n     * // => true\n     *\n     * _.isBoolean(null);\n     * // => false\n     */\n    function isBoolean(value) {\n      return value === true || value === false ||\n        (isObjectLike(value) && baseGetTag(value) == boolTag);\n    }\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     */\n    var isBuffer = nativeIsBuffer || stubFalse;\n\n    /**\n     * Checks if `value` is classified as a `Date` 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 date object, else `false`.\n     * @example\n     *\n     * _.isDate(new Date);\n     * // => true\n     *\n     * _.isDate('Mon April 23 2012');\n     * // => false\n     */\n    var isDate = nodeIsDate ? baseUnary(nodeIsDate) : baseIsDate;\n\n    /**\n     * Checks if `value` is likely a DOM element.\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 DOM element, else `false`.\n     * @example\n     *\n     * _.isElement(document.body);\n     * // => true\n     *\n     * _.isElement('<body>');\n     * // => false\n     */\n    function isElement(value) {\n      return isObjectLike(value) && value.nodeType === 1 && !isPlainObject(value);\n    }\n\n    /**\n     * Checks if `value` is an empty object, collection, map, or set.\n     *\n     * Objects are considered empty if they have no own enumerable string keyed\n     * properties.\n     *\n     * Array-like values such as `arguments` objects, arrays, buffers, strings, or\n     * jQuery-like collections are considered empty if they have a `length` of `0`.\n     * Similarly, maps and sets are considered empty if they have a `size` of `0`.\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 empty, else `false`.\n     * @example\n     *\n     * _.isEmpty(null);\n     * // => true\n     *\n     * _.isEmpty(true);\n     * // => true\n     *\n     * _.isEmpty(1);\n     * // => true\n     *\n     * _.isEmpty([1, 2, 3]);\n     * // => false\n     *\n     * _.isEmpty({ 'a': 1 });\n     * // => false\n     */\n    function isEmpty(value) {\n      if (value == null) {\n        return true;\n      }\n      if (isArrayLike(value) &&\n          (isArray(value) || typeof value == 'string' || typeof value.splice == 'function' ||\n            isBuffer(value) || isTypedArray(value) || isArguments(value))) {\n        return !value.length;\n      }\n      var tag = getTag(value);\n      if (tag == mapTag || tag == setTag) {\n        return !value.size;\n      }\n      if (isPrototype(value)) {\n        return !baseKeys(value).length;\n      }\n      for (var key in value) {\n        if (hasOwnProperty.call(value, key)) {\n          return false;\n        }\n      }\n      return true;\n    }\n\n    /**\n     * Performs a deep comparison between two values to determine if they are\n     * equivalent.\n     *\n     * **Note:** This method supports comparing arrays, array buffers, booleans,\n     * date objects, error objects, maps, numbers, `Object` objects, regexes,\n     * sets, strings, symbols, and typed arrays. `Object` objects are compared\n     * by their own, not inherited, enumerable properties. Functions and DOM\n     * nodes are compared by strict equality, i.e. `===`.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.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     * _.isEqual(object, other);\n     * // => true\n     *\n     * object === other;\n     * // => false\n     */\n    function isEqual(value, other) {\n      return baseIsEqual(value, other);\n    }\n\n    /**\n     * This method is like `_.isEqual` except that it accepts `customizer` which\n     * is invoked to compare values. If `customizer` returns `undefined`, comparisons\n     * are handled by the method instead. The `customizer` is invoked with up to\n     * six arguments: (objValue, othValue [, index|key, object, other, stack]).\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     * @param {Function} [customizer] The function to customize comparisons.\n     * @returns {boolean} Returns `true` if the values are equivalent, else `false`.\n     * @example\n     *\n     * function isGreeting(value) {\n     *   return /^h(?:i|ello)$/.test(value);\n     * }\n     *\n     * function customizer(objValue, othValue) {\n     *   if (isGreeting(objValue) && isGreeting(othValue)) {\n     *     return true;\n     *   }\n     * }\n     *\n     * var array = ['hello', 'goodbye'];\n     * var other = ['hi', 'goodbye'];\n     *\n     * _.isEqualWith(array, other, customizer);\n     * // => true\n     */\n    function isEqualWith(value, other, customizer) {\n      customizer = typeof customizer == 'function' ? customizer : undefined;\n      var result = customizer ? customizer(value, other) : undefined;\n      return result === undefined ? baseIsEqual(value, other, undefined, customizer) : !!result;\n    }\n\n    /**\n     * Checks if `value` is an `Error`, `EvalError`, `RangeError`, `ReferenceError`,\n     * `SyntaxError`, `TypeError`, or `URIError` object.\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 an error object, else `false`.\n     * @example\n     *\n     * _.isError(new Error);\n     * // => true\n     *\n     * _.isError(Error);\n     * // => false\n     */\n    function isError(value) {\n      if (!isObjectLike(value)) {\n        return false;\n      }\n      var tag = baseGetTag(value);\n      return tag == errorTag || tag == domExcTag ||\n        (typeof value.message == 'string' && typeof value.name == 'string' && !isPlainObject(value));\n    }\n\n    /**\n     * Checks if `value` is a finite primitive number.\n     *\n     * **Note:** This method is based on\n     * [`Number.isFinite`](https://mdn.io/Number/isFinite).\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 finite number, else `false`.\n     * @example\n     *\n     * _.isFinite(3);\n     * // => true\n     *\n     * _.isFinite(Number.MIN_VALUE);\n     * // => true\n     *\n     * _.isFinite(Infinity);\n     * // => false\n     *\n     * _.isFinite('3');\n     * // => false\n     */\n    function isFinite(value) {\n      return typeof value == 'number' && nativeIsFinite(value);\n    }\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     */\n    function 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\n    /**\n     * Checks if `value` is an integer.\n     *\n     * **Note:** This method is based on\n     * [`Number.isInteger`](https://mdn.io/Number/isInteger).\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 integer, else `false`.\n     * @example\n     *\n     * _.isInteger(3);\n     * // => true\n     *\n     * _.isInteger(Number.MIN_VALUE);\n     * // => false\n     *\n     * _.isInteger(Infinity);\n     * // => false\n     *\n     * _.isInteger('3');\n     * // => false\n     */\n    function isInteger(value) {\n      return typeof value == 'number' && value == toInteger(value);\n    }\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     */\n    function isLength(value) {\n      return typeof value == 'number' &&\n        value > -1 && value % 1 == 0 && value <= MAX_SAFE_INTEGER;\n    }\n\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     */\n    function isObject(value) {\n      var type = typeof value;\n      return value != null && (type == 'object' || type == 'function');\n    }\n\n    /**\n     * Checks if `value` is object-like. A value is object-like if it's not `null`\n     * and has a `typeof` result of \"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 object-like, else `false`.\n     * @example\n     *\n     * _.isObjectLike({});\n     * // => true\n     *\n     * _.isObjectLike([1, 2, 3]);\n     * // => true\n     *\n     * _.isObjectLike(_.noop);\n     * // => false\n     *\n     * _.isObjectLike(null);\n     * // => false\n     */\n    function isObjectLike(value) {\n      return value != null && typeof value == 'object';\n    }\n\n    /**\n     * Checks if `value` is classified as a `Map` object.\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 map, else `false`.\n     * @example\n     *\n     * _.isMap(new Map);\n     * // => true\n     *\n     * _.isMap(new WeakMap);\n     * // => false\n     */\n    var isMap = nodeIsMap ? baseUnary(nodeIsMap) : baseIsMap;\n\n    /**\n     * Performs a partial deep comparison between `object` and `source` to\n     * determine if `object` contains equivalent property values.\n     *\n     * **Note:** This method is equivalent to `_.matches` when `source` is\n     * partially applied.\n     *\n     * Partial comparisons will match empty array and empty object `source`\n     * values against any array or object value, respectively. See `_.isEqual`\n     * for a list of supported value comparisons.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category Lang\n     * @param {Object} object The object to inspect.\n     * @param {Object} source The object of property values to match.\n     * @returns {boolean} Returns `true` if `object` is a match, else `false`.\n     * @example\n     *\n     * var object = { 'a': 1, 'b': 2 };\n     *\n     * _.isMatch(object, { 'b': 2 });\n     * // => true\n     *\n     * _.isMatch(object, { 'b': 1 });\n     * // => false\n     */\n    function isMatch(object, source) {\n      return object === source || baseIsMatch(object, source, getMatchData(source));\n    }\n\n    /**\n     * This method is like `_.isMatch` except that it accepts `customizer` which\n     * is invoked to compare values. If `customizer` returns `undefined`, comparisons\n     * are handled by the method instead. The `customizer` is invoked with five\n     * arguments: (objValue, srcValue, index|key, object, source).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Lang\n     * @param {Object} object The object to inspect.\n     * @param {Object} source The object of property values to match.\n     * @param {Function} [customizer] The function to customize comparisons.\n     * @returns {boolean} Returns `true` if `object` is a match, else `false`.\n     * @example\n     *\n     * function isGreeting(value) {\n     *   return /^h(?:i|ello)$/.test(value);\n     * }\n     *\n     * function customizer(objValue, srcValue) {\n     *   if (isGreeting(objValue) && isGreeting(srcValue)) {\n     *     return true;\n     *   }\n     * }\n     *\n     * var object = { 'greeting': 'hello' };\n     * var source = { 'greeting': 'hi' };\n     *\n     * _.isMatchWith(object, source, customizer);\n     * // => true\n     */\n    function isMatchWith(object, source, customizer) {\n      customizer = typeof customizer == 'function' ? customizer : undefined;\n      return baseIsMatch(object, source, getMatchData(source), customizer);\n    }\n\n    /**\n     * Checks if `value` is `NaN`.\n     *\n     * **Note:** This method is based on\n     * [`Number.isNaN`](https://mdn.io/Number/isNaN) and is not the same as\n     * global [`isNaN`](https://mdn.io/isNaN) which returns `true` for\n     * `undefined` and other non-number values.\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 `NaN`, else `false`.\n     * @example\n     *\n     * _.isNaN(NaN);\n     * // => true\n     *\n     * _.isNaN(new Number(NaN));\n     * // => true\n     *\n     * isNaN(undefined);\n     * // => true\n     *\n     * _.isNaN(undefined);\n     * // => false\n     */\n    function isNaN(value) {\n      // An `NaN` primitive is the only value that is not equal to itself.\n      // Perform the `toStringTag` check first to avoid errors with some\n      // ActiveX objects in IE.\n      return isNumber(value) && value != +value;\n    }\n\n    /**\n     * Checks if `value` is a pristine native function.\n     *\n     * **Note:** This method can't reliably detect native functions in the presence\n     * of the core-js package because core-js circumvents this kind of detection.\n     * Despite multiple requests, the core-js maintainer has made it clear: any\n     * attempt to fix the detection will be obstructed. As a result, we're left\n     * with little choice but to throw an error. Unfortunately, this also affects\n     * packages, like [babel-polyfill](https://www.npmjs.com/package/babel-polyfill),\n     * which rely on core-js.\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 native function,\n     *  else `false`.\n     * @example\n     *\n     * _.isNative(Array.prototype.push);\n     * // => true\n     *\n     * _.isNative(_);\n     * // => false\n     */\n    function isNative(value) {\n      if (isMaskable(value)) {\n        throw new Error(CORE_ERROR_TEXT);\n      }\n      return baseIsNative(value);\n    }\n\n    /**\n     * Checks if `value` is `null`.\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 `null`, else `false`.\n     * @example\n     *\n     * _.isNull(null);\n     * // => true\n     *\n     * _.isNull(void 0);\n     * // => false\n     */\n    function isNull(value) {\n      return value === null;\n    }\n\n    /**\n     * Checks if `value` is `null` or `undefined`.\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 nullish, else `false`.\n     * @example\n     *\n     * _.isNil(null);\n     * // => true\n     *\n     * _.isNil(void 0);\n     * // => true\n     *\n     * _.isNil(NaN);\n     * // => false\n     */\n    function isNil(value) {\n      return value == null;\n    }\n\n    /**\n     * Checks if `value` is classified as a `Number` primitive or object.\n     *\n     * **Note:** To exclude `Infinity`, `-Infinity`, and `NaN`, which are\n     * classified as numbers, use the `_.isFinite` method.\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 number, else `false`.\n     * @example\n     *\n     * _.isNumber(3);\n     * // => true\n     *\n     * _.isNumber(Number.MIN_VALUE);\n     * // => true\n     *\n     * _.isNumber(Infinity);\n     * // => true\n     *\n     * _.isNumber('3');\n     * // => false\n     */\n    function isNumber(value) {\n      return typeof value == 'number' ||\n        (isObjectLike(value) && baseGetTag(value) == numberTag);\n    }\n\n    /**\n     * Checks if `value` is a plain object, that is, an object created by the\n     * `Object` constructor or one with a `[[Prototype]]` of `null`.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.8.0\n     * @category Lang\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is a plain object, else `false`.\n     * @example\n     *\n     * function Foo() {\n     *   this.a = 1;\n     * }\n     *\n     * _.isPlainObject(new Foo);\n     * // => false\n     *\n     * _.isPlainObject([1, 2, 3]);\n     * // => false\n     *\n     * _.isPlainObject({ 'x': 0, 'y': 0 });\n     * // => true\n     *\n     * _.isPlainObject(Object.create(null));\n     * // => true\n     */\n    function isPlainObject(value) {\n      if (!isObjectLike(value) || baseGetTag(value) != objectTag) {\n        return false;\n      }\n      var proto = getPrototype(value);\n      if (proto === null) {\n        return true;\n      }\n      var Ctor = hasOwnProperty.call(proto, 'constructor') && proto.constructor;\n      return typeof Ctor == 'function' && Ctor instanceof Ctor &&\n        funcToString.call(Ctor) == objectCtorString;\n    }\n\n    /**\n     * Checks if `value` is classified as a `RegExp` 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 regexp, else `false`.\n     * @example\n     *\n     * _.isRegExp(/abc/);\n     * // => true\n     *\n     * _.isRegExp('/abc/');\n     * // => false\n     */\n    var isRegExp = nodeIsRegExp ? baseUnary(nodeIsRegExp) : baseIsRegExp;\n\n    /**\n     * Checks if `value` is a safe integer. An integer is safe if it's an IEEE-754\n     * double precision number which isn't the result of a rounded unsafe integer.\n     *\n     * **Note:** This method is based on\n     * [`Number.isSafeInteger`](https://mdn.io/Number/isSafeInteger).\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 safe integer, else `false`.\n     * @example\n     *\n     * _.isSafeInteger(3);\n     * // => true\n     *\n     * _.isSafeInteger(Number.MIN_VALUE);\n     * // => false\n     *\n     * _.isSafeInteger(Infinity);\n     * // => false\n     *\n     * _.isSafeInteger('3');\n     * // => false\n     */\n    function isSafeInteger(value) {\n      return isInteger(value) && value >= -MAX_SAFE_INTEGER && value <= MAX_SAFE_INTEGER;\n    }\n\n    /**\n     * Checks if `value` is classified as a `Set` object.\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 set, else `false`.\n     * @example\n     *\n     * _.isSet(new Set);\n     * // => true\n     *\n     * _.isSet(new WeakSet);\n     * // => false\n     */\n    var isSet = nodeIsSet ? baseUnary(nodeIsSet) : baseIsSet;\n\n    /**\n     * Checks if `value` is classified as a `String` primitive or object.\n     *\n     * @static\n     * @since 0.1.0\n     * @memberOf _\n     * @category Lang\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is a string, else `false`.\n     * @example\n     *\n     * _.isString('abc');\n     * // => true\n     *\n     * _.isString(1);\n     * // => false\n     */\n    function isString(value) {\n      return typeof value == 'string' ||\n        (!isArray(value) && isObjectLike(value) && baseGetTag(value) == stringTag);\n    }\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     */\n    function isSymbol(value) {\n      return typeof value == 'symbol' ||\n        (isObjectLike(value) && baseGetTag(value) == symbolTag);\n    }\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     */\n    var isTypedArray = nodeIsTypedArray ? baseUnary(nodeIsTypedArray) : baseIsTypedArray;\n\n    /**\n     * Checks if `value` is `undefined`.\n     *\n     * @static\n     * @since 0.1.0\n     * @memberOf _\n     * @category Lang\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is `undefined`, else `false`.\n     * @example\n     *\n     * _.isUndefined(void 0);\n     * // => true\n     *\n     * _.isUndefined(null);\n     * // => false\n     */\n    function isUndefined(value) {\n      return value === undefined;\n    }\n\n    /**\n     * Checks if `value` is classified as a `WeakMap` object.\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 weak map, else `false`.\n     * @example\n     *\n     * _.isWeakMap(new WeakMap);\n     * // => true\n     *\n     * _.isWeakMap(new Map);\n     * // => false\n     */\n    function isWeakMap(value) {\n      return isObjectLike(value) && getTag(value) == weakMapTag;\n    }\n\n    /**\n     * Checks if `value` is classified as a `WeakSet` object.\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 weak set, else `false`.\n     * @example\n     *\n     * _.isWeakSet(new WeakSet);\n     * // => true\n     *\n     * _.isWeakSet(new Set);\n     * // => false\n     */\n    function isWeakSet(value) {\n      return isObjectLike(value) && baseGetTag(value) == weakSetTag;\n    }\n\n    /**\n     * Checks if `value` is less than `other`.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.9.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 `value` is less than `other`,\n     *  else `false`.\n     * @see _.gt\n     * @example\n     *\n     * _.lt(1, 3);\n     * // => true\n     *\n     * _.lt(3, 3);\n     * // => false\n     *\n     * _.lt(3, 1);\n     * // => false\n     */\n    var lt = createRelationalOperation(baseLt);\n\n    /**\n     * Checks if `value` is less than or equal to `other`.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.9.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 `value` is less than or equal to\n     *  `other`, else `false`.\n     * @see _.gte\n     * @example\n     *\n     * _.lte(1, 3);\n     * // => true\n     *\n     * _.lte(3, 3);\n     * // => true\n     *\n     * _.lte(3, 1);\n     * // => false\n     */\n    var lte = createRelationalOperation(function(value, other) {\n      return value <= other;\n    });\n\n    /**\n     * Converts `value` to an array.\n     *\n     * @static\n     * @since 0.1.0\n     * @memberOf _\n     * @category Lang\n     * @param {*} value The value to convert.\n     * @returns {Array} Returns the converted array.\n     * @example\n     *\n     * _.toArray({ 'a': 1, 'b': 2 });\n     * // => [1, 2]\n     *\n     * _.toArray('abc');\n     * // => ['a', 'b', 'c']\n     *\n     * _.toArray(1);\n     * // => []\n     *\n     * _.toArray(null);\n     * // => []\n     */\n    function toArray(value) {\n      if (!value) {\n        return [];\n      }\n      if (isArrayLike(value)) {\n        return isString(value) ? stringToArray(value) : copyArray(value);\n      }\n      if (symIterator && value[symIterator]) {\n        return iteratorToArray(value[symIterator]());\n      }\n      var tag = getTag(value),\n          func = tag == mapTag ? mapToArray : (tag == setTag ? setToArray : values);\n\n      return func(value);\n    }\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     */\n    function 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\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     */\n    function toInteger(value) {\n      var result = toFinite(value),\n          remainder = result % 1;\n\n      return result === result ? (remainder ? result - remainder : result) : 0;\n    }\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     */\n    function toLength(value) {\n      return value ? baseClamp(toInteger(value), 0, MAX_ARRAY_LENGTH) : 0;\n    }\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     */\n    function 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\n    /**\n     * Converts `value` to a plain object flattening inherited enumerable string\n     * keyed properties of `value` to own properties of the plain object.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category Lang\n     * @param {*} value The value to convert.\n     * @returns {Object} Returns the converted plain object.\n     * @example\n     *\n     * function Foo() {\n     *   this.b = 2;\n     * }\n     *\n     * Foo.prototype.c = 3;\n     *\n     * _.assign({ 'a': 1 }, new Foo);\n     * // => { 'a': 1, 'b': 2 }\n     *\n     * _.assign({ 'a': 1 }, _.toPlainObject(new Foo));\n     * // => { 'a': 1, 'b': 2, 'c': 3 }\n     */\n    function toPlainObject(value) {\n      return copyObject(value, keysIn(value));\n    }\n\n    /**\n     * Converts `value` to a safe integer. A safe integer can be compared and\n     * represented correctly.\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     * _.toSafeInteger(3.2);\n     * // => 3\n     *\n     * _.toSafeInteger(Number.MIN_VALUE);\n     * // => 0\n     *\n     * _.toSafeInteger(Infinity);\n     * // => 9007199254740991\n     *\n     * _.toSafeInteger('3.2');\n     * // => 3\n     */\n    function toSafeInteger(value) {\n      return value\n        ? baseClamp(toInteger(value), -MAX_SAFE_INTEGER, MAX_SAFE_INTEGER)\n        : (value === 0 ? value : 0);\n    }\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     */\n    function toString(value) {\n      return value == null ? '' : baseToString(value);\n    }\n\n    /*------------------------------------------------------------------------*/\n\n    /**\n     * Assigns own enumerable string keyed properties of source objects to the\n     * destination object. Source objects are applied from left to right.\n     * Subsequent sources overwrite property assignments of previous sources.\n     *\n     * **Note:** This method mutates `object` and is loosely based on\n     * [`Object.assign`](https://mdn.io/Object/assign).\n     *\n     * @static\n     * @memberOf _\n     * @since 0.10.0\n     * @category Object\n     * @param {Object} object The destination object.\n     * @param {...Object} [sources] The source objects.\n     * @returns {Object} Returns `object`.\n     * @see _.assignIn\n     * @example\n     *\n     * function Foo() {\n     *   this.a = 1;\n     * }\n     *\n     * function Bar() {\n     *   this.c = 3;\n     * }\n     *\n     * Foo.prototype.b = 2;\n     * Bar.prototype.d = 4;\n     *\n     * _.assign({ 'a': 0 }, new Foo, new Bar);\n     * // => { 'a': 1, 'c': 3 }\n     */\n    var assign = createAssigner(function(object, source) {\n      if (isPrototype(source) || isArrayLike(source)) {\n        copyObject(source, keys(source), object);\n        return;\n      }\n      for (var key in source) {\n        if (hasOwnProperty.call(source, key)) {\n          assignValue(object, key, source[key]);\n        }\n      }\n    });\n\n    /**\n     * This method is like `_.assign` except that it iterates over own and\n     * inherited source properties.\n     *\n     * **Note:** This method mutates `object`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @alias extend\n     * @category Object\n     * @param {Object} object The destination object.\n     * @param {...Object} [sources] The source objects.\n     * @returns {Object} Returns `object`.\n     * @see _.assign\n     * @example\n     *\n     * function Foo() {\n     *   this.a = 1;\n     * }\n     *\n     * function Bar() {\n     *   this.c = 3;\n     * }\n     *\n     * Foo.prototype.b = 2;\n     * Bar.prototype.d = 4;\n     *\n     * _.assignIn({ 'a': 0 }, new Foo, new Bar);\n     * // => { 'a': 1, 'b': 2, 'c': 3, 'd': 4 }\n     */\n    var assignIn = createAssigner(function(object, source) {\n      copyObject(source, keysIn(source), object);\n    });\n\n    /**\n     * This method is like `_.assignIn` except that it accepts `customizer`\n     * which is invoked to produce the assigned values. If `customizer` returns\n     * `undefined`, assignment is handled by the method instead. The `customizer`\n     * is invoked with five arguments: (objValue, srcValue, key, object, source).\n     *\n     * **Note:** This method mutates `object`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @alias extendWith\n     * @category Object\n     * @param {Object} object The destination object.\n     * @param {...Object} sources The source objects.\n     * @param {Function} [customizer] The function to customize assigned values.\n     * @returns {Object} Returns `object`.\n     * @see _.assignWith\n     * @example\n     *\n     * function customizer(objValue, srcValue) {\n     *   return _.isUndefined(objValue) ? srcValue : objValue;\n     * }\n     *\n     * var defaults = _.partialRight(_.assignInWith, customizer);\n     *\n     * defaults({ 'a': 1 }, { 'b': 2 }, { 'a': 3 });\n     * // => { 'a': 1, 'b': 2 }\n     */\n    var assignInWith = createAssigner(function(object, source, srcIndex, customizer) {\n      copyObject(source, keysIn(source), object, customizer);\n    });\n\n    /**\n     * This method is like `_.assign` except that it accepts `customizer`\n     * which is invoked to produce the assigned values. If `customizer` returns\n     * `undefined`, assignment is handled by the method instead. The `customizer`\n     * is invoked with five arguments: (objValue, srcValue, key, object, source).\n     *\n     * **Note:** This method mutates `object`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Object\n     * @param {Object} object The destination object.\n     * @param {...Object} sources The source objects.\n     * @param {Function} [customizer] The function to customize assigned values.\n     * @returns {Object} Returns `object`.\n     * @see _.assignInWith\n     * @example\n     *\n     * function customizer(objValue, srcValue) {\n     *   return _.isUndefined(objValue) ? srcValue : objValue;\n     * }\n     *\n     * var defaults = _.partialRight(_.assignWith, customizer);\n     *\n     * defaults({ 'a': 1 }, { 'b': 2 }, { 'a': 3 });\n     * // => { 'a': 1, 'b': 2 }\n     */\n    var assignWith = createAssigner(function(object, source, srcIndex, customizer) {\n      copyObject(source, keys(source), object, customizer);\n    });\n\n    /**\n     * Creates an array of values corresponding to `paths` of `object`.\n     *\n     * @static\n     * @memberOf _\n     * @since 1.0.0\n     * @category Object\n     * @param {Object} object The object to iterate over.\n     * @param {...(string|string[])} [paths] The property paths to pick.\n     * @returns {Array} Returns the picked values.\n     * @example\n     *\n     * var object = { 'a': [{ 'b': { 'c': 3 } }, 4] };\n     *\n     * _.at(object, ['a[0].b.c', 'a[1]']);\n     * // => [3, 4]\n     */\n    var at = flatRest(baseAt);\n\n    /**\n     * Creates an object that inherits from the `prototype` object. If a\n     * `properties` object is given, its own enumerable string keyed properties\n     * are assigned to the created object.\n     *\n     * @static\n     * @memberOf _\n     * @since 2.3.0\n     * @category Object\n     * @param {Object} prototype The object to inherit from.\n     * @param {Object} [properties] The properties to assign to the object.\n     * @returns {Object} Returns the new object.\n     * @example\n     *\n     * function Shape() {\n     *   this.x = 0;\n     *   this.y = 0;\n     * }\n     *\n     * function Circle() {\n     *   Shape.call(this);\n     * }\n     *\n     * Circle.prototype = _.create(Shape.prototype, {\n     *   'constructor': Circle\n     * });\n     *\n     * var circle = new Circle;\n     * circle instanceof Circle;\n     * // => true\n     *\n     * circle instanceof Shape;\n     * // => true\n     */\n    function create(prototype, properties) {\n      var result = baseCreate(prototype);\n      return properties == null ? result : baseAssign(result, properties);\n    }\n\n    /**\n     * Assigns own and inherited enumerable string keyed properties of source\n     * objects to the destination object for all destination properties that\n     * resolve to `undefined`. Source objects are applied from left to right.\n     * Once a property is set, additional values of the same property are ignored.\n     *\n     * **Note:** This method mutates `object`.\n     *\n     * @static\n     * @since 0.1.0\n     * @memberOf _\n     * @category Object\n     * @param {Object} object The destination object.\n     * @param {...Object} [sources] The source objects.\n     * @returns {Object} Returns `object`.\n     * @see _.defaultsDeep\n     * @example\n     *\n     * _.defaults({ 'a': 1 }, { 'b': 2 }, { 'a': 3 });\n     * // => { 'a': 1, 'b': 2 }\n     */\n    var defaults = baseRest(function(object, sources) {\n      object = Object(object);\n\n      var index = -1;\n      var length = sources.length;\n      var guard = length > 2 ? sources[2] : undefined;\n\n      if (guard && isIterateeCall(sources[0], sources[1], guard)) {\n        length = 1;\n      }\n\n      while (++index < length) {\n        var source = sources[index];\n        var props = keysIn(source);\n        var propsIndex = -1;\n        var propsLength = props.length;\n\n        while (++propsIndex < propsLength) {\n          var key = props[propsIndex];\n          var value = object[key];\n\n          if (value === undefined ||\n              (eq(value, objectProto[key]) && !hasOwnProperty.call(object, key))) {\n            object[key] = source[key];\n          }\n        }\n      }\n\n      return object;\n    });\n\n    /**\n     * This method is like `_.defaults` except that it recursively assigns\n     * default properties.\n     *\n     * **Note:** This method mutates `object`.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.10.0\n     * @category Object\n     * @param {Object} object The destination object.\n     * @param {...Object} [sources] The source objects.\n     * @returns {Object} Returns `object`.\n     * @see _.defaults\n     * @example\n     *\n     * _.defaultsDeep({ 'a': { 'b': 2 } }, { 'a': { 'b': 1, 'c': 3 } });\n     * // => { 'a': { 'b': 2, 'c': 3 } }\n     */\n    var defaultsDeep = baseRest(function(args) {\n      args.push(undefined, customDefaultsMerge);\n      return apply(mergeWith, undefined, args);\n    });\n\n    /**\n     * This method is like `_.find` except that it returns the key 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 Object\n     * @param {Object} object The object to inspect.\n     * @param {Function} [predicate=_.identity] The function invoked per iteration.\n     * @returns {string|undefined} Returns the key of the matched element,\n     *  else `undefined`.\n     * @example\n     *\n     * var users = {\n     *   'barney':  { 'age': 36, 'active': true },\n     *   'fred':    { 'age': 40, 'active': false },\n     *   'pebbles': { 'age': 1,  'active': true }\n     * };\n     *\n     * _.findKey(users, function(o) { return o.age < 40; });\n     * // => 'barney' (iteration order is not guaranteed)\n     *\n     * // The `_.matches` iteratee shorthand.\n     * _.findKey(users, { 'age': 1, 'active': true });\n     * // => 'pebbles'\n     *\n     * // The `_.matchesProperty` iteratee shorthand.\n     * _.findKey(users, ['active', false]);\n     * // => 'fred'\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.findKey(users, 'active');\n     * // => 'barney'\n     */\n    function findKey(object, predicate) {\n      return baseFindKey(object, getIteratee(predicate, 3), baseForOwn);\n    }\n\n    /**\n     * This method is like `_.findKey` except that it iterates over elements of\n     * a collection in the opposite order.\n     *\n     * @static\n     * @memberOf _\n     * @since 2.0.0\n     * @category Object\n     * @param {Object} object The object to inspect.\n     * @param {Function} [predicate=_.identity] The function invoked per iteration.\n     * @returns {string|undefined} Returns the key of the matched element,\n     *  else `undefined`.\n     * @example\n     *\n     * var users = {\n     *   'barney':  { 'age': 36, 'active': true },\n     *   'fred':    { 'age': 40, 'active': false },\n     *   'pebbles': { 'age': 1,  'active': true }\n     * };\n     *\n     * _.findLastKey(users, function(o) { return o.age < 40; });\n     * // => returns 'pebbles' assuming `_.findKey` returns 'barney'\n     *\n     * // The `_.matches` iteratee shorthand.\n     * _.findLastKey(users, { 'age': 36, 'active': true });\n     * // => 'barney'\n     *\n     * // The `_.matchesProperty` iteratee shorthand.\n     * _.findLastKey(users, ['active', false]);\n     * // => 'fred'\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.findLastKey(users, 'active');\n     * // => 'pebbles'\n     */\n    function findLastKey(object, predicate) {\n      return baseFindKey(object, getIteratee(predicate, 3), baseForOwnRight);\n    }\n\n    /**\n     * Iterates over own and inherited enumerable string keyed properties of an\n     * object and invokes `iteratee` for each property. The iteratee is invoked\n     * with three arguments: (value, key, object). Iteratee functions may exit\n     * iteration early by explicitly returning `false`.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.3.0\n     * @category Object\n     * @param {Object} object The object to iterate over.\n     * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n     * @returns {Object} Returns `object`.\n     * @see _.forInRight\n     * @example\n     *\n     * function Foo() {\n     *   this.a = 1;\n     *   this.b = 2;\n     * }\n     *\n     * Foo.prototype.c = 3;\n     *\n     * _.forIn(new Foo, function(value, key) {\n     *   console.log(key);\n     * });\n     * // => Logs 'a', 'b', then 'c' (iteration order is not guaranteed).\n     */\n    function forIn(object, iteratee) {\n      return object == null\n        ? object\n        : baseFor(object, getIteratee(iteratee, 3), keysIn);\n    }\n\n    /**\n     * This method is like `_.forIn` except that it iterates over properties of\n     * `object` in the opposite order.\n     *\n     * @static\n     * @memberOf _\n     * @since 2.0.0\n     * @category Object\n     * @param {Object} object The object to iterate over.\n     * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n     * @returns {Object} Returns `object`.\n     * @see _.forIn\n     * @example\n     *\n     * function Foo() {\n     *   this.a = 1;\n     *   this.b = 2;\n     * }\n     *\n     * Foo.prototype.c = 3;\n     *\n     * _.forInRight(new Foo, function(value, key) {\n     *   console.log(key);\n     * });\n     * // => Logs 'c', 'b', then 'a' assuming `_.forIn` logs 'a', 'b', then 'c'.\n     */\n    function forInRight(object, iteratee) {\n      return object == null\n        ? object\n        : baseForRight(object, getIteratee(iteratee, 3), keysIn);\n    }\n\n    /**\n     * Iterates over own enumerable string keyed properties of an object and\n     * invokes `iteratee` for each property. The iteratee is invoked with three\n     * arguments: (value, key, object). Iteratee functions may exit iteration\n     * early by explicitly returning `false`.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.3.0\n     * @category Object\n     * @param {Object} object The object to iterate over.\n     * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n     * @returns {Object} Returns `object`.\n     * @see _.forOwnRight\n     * @example\n     *\n     * function Foo() {\n     *   this.a = 1;\n     *   this.b = 2;\n     * }\n     *\n     * Foo.prototype.c = 3;\n     *\n     * _.forOwn(new Foo, function(value, key) {\n     *   console.log(key);\n     * });\n     * // => Logs 'a' then 'b' (iteration order is not guaranteed).\n     */\n    function forOwn(object, iteratee) {\n      return object && baseForOwn(object, getIteratee(iteratee, 3));\n    }\n\n    /**\n     * This method is like `_.forOwn` except that it iterates over properties of\n     * `object` in the opposite order.\n     *\n     * @static\n     * @memberOf _\n     * @since 2.0.0\n     * @category Object\n     * @param {Object} object The object to iterate over.\n     * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n     * @returns {Object} Returns `object`.\n     * @see _.forOwn\n     * @example\n     *\n     * function Foo() {\n     *   this.a = 1;\n     *   this.b = 2;\n     * }\n     *\n     * Foo.prototype.c = 3;\n     *\n     * _.forOwnRight(new Foo, function(value, key) {\n     *   console.log(key);\n     * });\n     * // => Logs 'b' then 'a' assuming `_.forOwn` logs 'a' then 'b'.\n     */\n    function forOwnRight(object, iteratee) {\n      return object && baseForOwnRight(object, getIteratee(iteratee, 3));\n    }\n\n    /**\n     * Creates an array of function property names from own enumerable properties\n     * of `object`.\n     *\n     * @static\n     * @since 0.1.0\n     * @memberOf _\n     * @category Object\n     * @param {Object} object The object to inspect.\n     * @returns {Array} Returns the function names.\n     * @see _.functionsIn\n     * @example\n     *\n     * function Foo() {\n     *   this.a = _.constant('a');\n     *   this.b = _.constant('b');\n     * }\n     *\n     * Foo.prototype.c = _.constant('c');\n     *\n     * _.functions(new Foo);\n     * // => ['a', 'b']\n     */\n    function functions(object) {\n      return object == null ? [] : baseFunctions(object, keys(object));\n    }\n\n    /**\n     * Creates an array of function property names from own and inherited\n     * enumerable properties of `object`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Object\n     * @param {Object} object The object to inspect.\n     * @returns {Array} Returns the function names.\n     * @see _.functions\n     * @example\n     *\n     * function Foo() {\n     *   this.a = _.constant('a');\n     *   this.b = _.constant('b');\n     * }\n     *\n     * Foo.prototype.c = _.constant('c');\n     *\n     * _.functionsIn(new Foo);\n     * // => ['a', 'b', 'c']\n     */\n    function functionsIn(object) {\n      return object == null ? [] : baseFunctions(object, keysIn(object));\n    }\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     */\n    function get(object, path, defaultValue) {\n      var result = object == null ? undefined : baseGet(object, path);\n      return result === undefined ? defaultValue : result;\n    }\n\n    /**\n     * Checks if `path` is a direct property of `object`.\n     *\n     * @static\n     * @since 0.1.0\n     * @memberOf _\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 = { 'a': { 'b': 2 } };\n     * var other = _.create({ 'a': _.create({ 'b': 2 }) });\n     *\n     * _.has(object, 'a');\n     * // => true\n     *\n     * _.has(object, 'a.b');\n     * // => true\n     *\n     * _.has(object, ['a', 'b']);\n     * // => true\n     *\n     * _.has(other, 'a');\n     * // => false\n     */\n    function has(object, path) {\n      return object != null && hasPath(object, path, baseHas);\n    }\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     */\n    function hasIn(object, path) {\n      return object != null && hasPath(object, path, baseHasIn);\n    }\n\n    /**\n     * Creates an object composed of the inverted keys and values of `object`.\n     * If `object` contains duplicate values, subsequent values overwrite\n     * property assignments of previous values.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.7.0\n     * @category Object\n     * @param {Object} object The object to invert.\n     * @returns {Object} Returns the new inverted object.\n     * @example\n     *\n     * var object = { 'a': 1, 'b': 2, 'c': 1 };\n     *\n     * _.invert(object);\n     * // => { '1': 'c', '2': 'b' }\n     */\n    var invert = createInverter(function(result, value, key) {\n      if (value != null &&\n          typeof value.toString != 'function') {\n        value = nativeObjectToString.call(value);\n      }\n\n      result[value] = key;\n    }, constant(identity));\n\n    /**\n     * This method is like `_.invert` except that the inverted object is generated\n     * from the results of running each element of `object` thru `iteratee`. The\n     * corresponding inverted value of each inverted key is an array of keys\n     * responsible for generating the inverted value. The iteratee is invoked\n     * with one argument: (value).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.1.0\n     * @category Object\n     * @param {Object} object The object to invert.\n     * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n     * @returns {Object} Returns the new inverted object.\n     * @example\n     *\n     * var object = { 'a': 1, 'b': 2, 'c': 1 };\n     *\n     * _.invertBy(object);\n     * // => { '1': ['a', 'c'], '2': ['b'] }\n     *\n     * _.invertBy(object, function(value) {\n     *   return 'group' + value;\n     * });\n     * // => { 'group1': ['a', 'c'], 'group2': ['b'] }\n     */\n    var invertBy = createInverter(function(result, value, key) {\n      if (value != null &&\n          typeof value.toString != 'function') {\n        value = nativeObjectToString.call(value);\n      }\n\n      if (hasOwnProperty.call(result, value)) {\n        result[value].push(key);\n      } else {\n        result[value] = [key];\n      }\n    }, getIteratee);\n\n    /**\n     * Invokes the method at `path` 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 of the method to invoke.\n     * @param {...*} [args] The arguments to invoke the method with.\n     * @returns {*} Returns the result of the invoked method.\n     * @example\n     *\n     * var object = { 'a': [{ 'b': { 'c': [1, 2, 3, 4] } }] };\n     *\n     * _.invoke(object, 'a[0].b.c.slice', 1, 3);\n     * // => [2, 3]\n     */\n    var invoke = baseRest(baseInvoke);\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     */\n    function keys(object) {\n      return isArrayLike(object) ? arrayLikeKeys(object) : baseKeys(object);\n    }\n\n    /**\n     * Creates an array of the own and inherited enumerable property names of `object`.\n     *\n     * **Note:** Non-object values are coerced to objects.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\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     * _.keysIn(new Foo);\n     * // => ['a', 'b', 'c'] (iteration order is not guaranteed)\n     */\n    function keysIn(object) {\n      return isArrayLike(object) ? arrayLikeKeys(object, true) : baseKeysIn(object);\n    }\n\n    /**\n     * The opposite of `_.mapValues`; this method creates an object with the\n     * same values as `object` and keys generated by running each own enumerable\n     * string keyed property of `object` thru `iteratee`. The iteratee is invoked\n     * with three arguments: (value, key, object).\n     *\n     * @static\n     * @memberOf _\n     * @since 3.8.0\n     * @category Object\n     * @param {Object} object The object to iterate over.\n     * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n     * @returns {Object} Returns the new mapped object.\n     * @see _.mapValues\n     * @example\n     *\n     * _.mapKeys({ 'a': 1, 'b': 2 }, function(value, key) {\n     *   return key + value;\n     * });\n     * // => { 'a1': 1, 'b2': 2 }\n     */\n    function mapKeys(object, iteratee) {\n      var result = {};\n      iteratee = getIteratee(iteratee, 3);\n\n      baseForOwn(object, function(value, key, object) {\n        baseAssignValue(result, iteratee(value, key, object), value);\n      });\n      return result;\n    }\n\n    /**\n     * Creates an object with the same keys as `object` and values generated\n     * by running each own enumerable string keyed property of `object` thru\n     * `iteratee`. The iteratee is invoked with three arguments:\n     * (value, key, object).\n     *\n     * @static\n     * @memberOf _\n     * @since 2.4.0\n     * @category Object\n     * @param {Object} object The object to iterate over.\n     * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n     * @returns {Object} Returns the new mapped object.\n     * @see _.mapKeys\n     * @example\n     *\n     * var users = {\n     *   'fred':    { 'user': 'fred',    'age': 40 },\n     *   'pebbles': { 'user': 'pebbles', 'age': 1 }\n     * };\n     *\n     * _.mapValues(users, function(o) { return o.age; });\n     * // => { 'fred': 40, 'pebbles': 1 } (iteration order is not guaranteed)\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.mapValues(users, 'age');\n     * // => { 'fred': 40, 'pebbles': 1 } (iteration order is not guaranteed)\n     */\n    function mapValues(object, iteratee) {\n      var result = {};\n      iteratee = getIteratee(iteratee, 3);\n\n      baseForOwn(object, function(value, key, object) {\n        baseAssignValue(result, key, iteratee(value, key, object));\n      });\n      return result;\n    }\n\n    /**\n     * This method is like `_.assign` except that it recursively merges own and\n     * inherited enumerable string keyed properties of source objects into the\n     * destination object. Source properties that resolve to `undefined` are\n     * skipped if a destination value exists. Array and plain object properties\n     * are merged recursively. Other objects and value types are overridden by\n     * assignment. Source objects are applied from left to right. Subsequent\n     * sources overwrite property assignments of previous sources.\n     *\n     * **Note:** This method mutates `object`.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.5.0\n     * @category Object\n     * @param {Object} object The destination object.\n     * @param {...Object} [sources] The source objects.\n     * @returns {Object} Returns `object`.\n     * @example\n     *\n     * var object = {\n     *   'a': [{ 'b': 2 }, { 'd': 4 }]\n     * };\n     *\n     * var other = {\n     *   'a': [{ 'c': 3 }, { 'e': 5 }]\n     * };\n     *\n     * _.merge(object, other);\n     * // => { 'a': [{ 'b': 2, 'c': 3 }, { 'd': 4, 'e': 5 }] }\n     */\n    var merge = createAssigner(function(object, source, srcIndex) {\n      baseMerge(object, source, srcIndex);\n    });\n\n    /**\n     * This method is like `_.merge` except that it accepts `customizer` which\n     * is invoked to produce the merged values of the destination and source\n     * properties. If `customizer` returns `undefined`, merging is handled by the\n     * method instead. The `customizer` is invoked with six arguments:\n     * (objValue, srcValue, key, object, source, stack).\n     *\n     * **Note:** This method mutates `object`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Object\n     * @param {Object} object The destination object.\n     * @param {...Object} sources The source objects.\n     * @param {Function} customizer The function to customize assigned values.\n     * @returns {Object} Returns `object`.\n     * @example\n     *\n     * function customizer(objValue, srcValue) {\n     *   if (_.isArray(objValue)) {\n     *     return objValue.concat(srcValue);\n     *   }\n     * }\n     *\n     * var object = { 'a': [1], 'b': [2] };\n     * var other = { 'a': [3], 'b': [4] };\n     *\n     * _.mergeWith(object, other, customizer);\n     * // => { 'a': [1, 3], 'b': [2, 4] }\n     */\n    var mergeWith = createAssigner(function(object, source, srcIndex, customizer) {\n      baseMerge(object, source, srcIndex, customizer);\n    });\n\n    /**\n     * The opposite of `_.pick`; this method creates an object composed of the\n     * own and inherited enumerable property paths of `object` that are not omitted.\n     *\n     * **Note:** This method is considerably slower than `_.pick`.\n     *\n     * @static\n     * @since 0.1.0\n     * @memberOf _\n     * @category Object\n     * @param {Object} object The source object.\n     * @param {...(string|string[])} [paths] The property paths to omit.\n     * @returns {Object} Returns the new object.\n     * @example\n     *\n     * var object = { 'a': 1, 'b': '2', 'c': 3 };\n     *\n     * _.omit(object, ['a', 'c']);\n     * // => { 'b': '2' }\n     */\n    var omit = flatRest(function(object, paths) {\n      var result = {};\n      if (object == null) {\n        return result;\n      }\n      var isDeep = false;\n      paths = arrayMap(paths, function(path) {\n        path = castPath(path, object);\n        isDeep || (isDeep = path.length > 1);\n        return path;\n      });\n      copyObject(object, getAllKeysIn(object), result);\n      if (isDeep) {\n        result = baseClone(result, CLONE_DEEP_FLAG | CLONE_FLAT_FLAG | CLONE_SYMBOLS_FLAG, customOmitClone);\n      }\n      var length = paths.length;\n      while (length--) {\n        baseUnset(result, paths[length]);\n      }\n      return result;\n    });\n\n    /**\n     * The opposite of `_.pickBy`; this method creates an object composed of\n     * the own and inherited enumerable string keyed properties of `object` that\n     * `predicate` doesn't return truthy for. The predicate is invoked with two\n     * arguments: (value, key).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Object\n     * @param {Object} object The source object.\n     * @param {Function} [predicate=_.identity] The function invoked per property.\n     * @returns {Object} Returns the new object.\n     * @example\n     *\n     * var object = { 'a': 1, 'b': '2', 'c': 3 };\n     *\n     * _.omitBy(object, _.isNumber);\n     * // => { 'b': '2' }\n     */\n    function omitBy(object, predicate) {\n      return pickBy(object, negate(getIteratee(predicate)));\n    }\n\n    /**\n     * Creates an object composed of the picked `object` properties.\n     *\n     * @static\n     * @since 0.1.0\n     * @memberOf _\n     * @category Object\n     * @param {Object} object The source object.\n     * @param {...(string|string[])} [paths] The property paths to pick.\n     * @returns {Object} Returns the new object.\n     * @example\n     *\n     * var object = { 'a': 1, 'b': '2', 'c': 3 };\n     *\n     * _.pick(object, ['a', 'c']);\n     * // => { 'a': 1, 'c': 3 }\n     */\n    var pick = flatRest(function(object, paths) {\n      return object == null ? {} : basePick(object, paths);\n    });\n\n    /**\n     * Creates an object composed of the `object` properties `predicate` returns\n     * truthy for. The predicate is invoked with two arguments: (value, key).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Object\n     * @param {Object} object The source object.\n     * @param {Function} [predicate=_.identity] The function invoked per property.\n     * @returns {Object} Returns the new object.\n     * @example\n     *\n     * var object = { 'a': 1, 'b': '2', 'c': 3 };\n     *\n     * _.pickBy(object, _.isNumber);\n     * // => { 'a': 1, 'c': 3 }\n     */\n    function pickBy(object, predicate) {\n      if (object == null) {\n        return {};\n      }\n      var props = arrayMap(getAllKeysIn(object), function(prop) {\n        return [prop];\n      });\n      predicate = getIteratee(predicate);\n      return basePickBy(object, props, function(value, path) {\n        return predicate(value, path[0]);\n      });\n    }\n\n    /**\n     * This method is like `_.get` except that if the resolved value is a\n     * function it's invoked with the `this` binding of its parent object and\n     * its result is returned.\n     *\n     * @static\n     * @since 0.1.0\n     * @memberOf _\n     * @category Object\n     * @param {Object} object The object to query.\n     * @param {Array|string} path The path of the property to resolve.\n     * @param {*} [defaultValue] The value returned for `undefined` resolved values.\n     * @returns {*} Returns the resolved value.\n     * @example\n     *\n     * var object = { 'a': [{ 'b': { 'c1': 3, 'c2': _.constant(4) } }] };\n     *\n     * _.result(object, 'a[0].b.c1');\n     * // => 3\n     *\n     * _.result(object, 'a[0].b.c2');\n     * // => 4\n     *\n     * _.result(object, 'a[0].b.c3', 'default');\n     * // => 'default'\n     *\n     * _.result(object, 'a[0].b.c3', _.constant('default'));\n     * // => 'default'\n     */\n    function result(object, path, defaultValue) {\n      path = castPath(path, object);\n\n      var index = -1,\n          length = path.length;\n\n      // Ensure the loop is entered when path is empty.\n      if (!length) {\n        length = 1;\n        object = undefined;\n      }\n      while (++index < length) {\n        var value = object == null ? undefined : object[toKey(path[index])];\n        if (value === undefined) {\n          index = length;\n          value = defaultValue;\n        }\n        object = isFunction(value) ? value.call(object) : value;\n      }\n      return object;\n    }\n\n    /**\n     * Sets the value at `path` of `object`. If a portion of `path` doesn't exist,\n     * it's created. Arrays are created for missing index properties while objects\n     * are created for all other missing properties. Use `_.setWith` to customize\n     * `path` creation.\n     *\n     * **Note:** This method mutates `object`.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.7.0\n     * @category Object\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     * @returns {Object} Returns `object`.\n     * @example\n     *\n     * var object = { 'a': [{ 'b': { 'c': 3 } }] };\n     *\n     * _.set(object, 'a[0].b.c', 4);\n     * console.log(object.a[0].b.c);\n     * // => 4\n     *\n     * _.set(object, ['x', '0', 'y', 'z'], 5);\n     * console.log(object.x[0].y.z);\n     * // => 5\n     */\n    function set(object, path, value) {\n      return object == null ? object : baseSet(object, path, value);\n    }\n\n    /**\n     * This method is like `_.set` except that it accepts `customizer` which is\n     * invoked to produce the objects of `path`.  If `customizer` returns `undefined`\n     * path creation is handled by the method instead. The `customizer` is invoked\n     * with three arguments: (nsValue, key, nsObject).\n     *\n     * **Note:** This method mutates `object`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Object\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 assigned values.\n     * @returns {Object} Returns `object`.\n     * @example\n     *\n     * var object = {};\n     *\n     * _.setWith(object, '[0][1]', 'a', Object);\n     * // => { '0': { '1': 'a' } }\n     */\n    function setWith(object, path, value, customizer) {\n      customizer = typeof customizer == 'function' ? customizer : undefined;\n      return object == null ? object : baseSet(object, path, value, customizer);\n    }\n\n    /**\n     * Creates an array of own enumerable string keyed-value pairs for `object`\n     * which can be consumed by `_.fromPairs`. If `object` is a map or set, its\n     * entries are returned.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @alias entries\n     * @category Object\n     * @param {Object} object The object to query.\n     * @returns {Array} Returns the key-value pairs.\n     * @example\n     *\n     * function Foo() {\n     *   this.a = 1;\n     *   this.b = 2;\n     * }\n     *\n     * Foo.prototype.c = 3;\n     *\n     * _.toPairs(new Foo);\n     * // => [['a', 1], ['b', 2]] (iteration order is not guaranteed)\n     */\n    var toPairs = createToPairs(keys);\n\n    /**\n     * Creates an array of own and inherited enumerable string keyed-value pairs\n     * for `object` which can be consumed by `_.fromPairs`. If `object` is a map\n     * or set, its entries are returned.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @alias entriesIn\n     * @category Object\n     * @param {Object} object The object to query.\n     * @returns {Array} Returns the key-value pairs.\n     * @example\n     *\n     * function Foo() {\n     *   this.a = 1;\n     *   this.b = 2;\n     * }\n     *\n     * Foo.prototype.c = 3;\n     *\n     * _.toPairsIn(new Foo);\n     * // => [['a', 1], ['b', 2], ['c', 3]] (iteration order is not guaranteed)\n     */\n    var toPairsIn = createToPairs(keysIn);\n\n    /**\n     * An alternative to `_.reduce`; this method transforms `object` to a new\n     * `accumulator` object which is the result of running each of its own\n     * enumerable string keyed properties thru `iteratee`, with each invocation\n     * potentially mutating the `accumulator` object. If `accumulator` is not\n     * provided, a new object with the same `[[Prototype]]` will be used. The\n     * iteratee is invoked with four arguments: (accumulator, value, key, object).\n     * Iteratee functions may exit iteration early by explicitly returning `false`.\n     *\n     * @static\n     * @memberOf _\n     * @since 1.3.0\n     * @category Object\n     * @param {Object} object The object to iterate over.\n     * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n     * @param {*} [accumulator] The custom accumulator value.\n     * @returns {*} Returns the accumulated value.\n     * @example\n     *\n     * _.transform([2, 3, 4], function(result, n) {\n     *   result.push(n *= n);\n     *   return n % 2 == 0;\n     * }, []);\n     * // => [4, 9]\n     *\n     * _.transform({ 'a': 1, 'b': 2, 'c': 1 }, function(result, value, key) {\n     *   (result[value] || (result[value] = [])).push(key);\n     * }, {});\n     * // => { '1': ['a', 'c'], '2': ['b'] }\n     */\n    function transform(object, iteratee, accumulator) {\n      var isArr = isArray(object),\n          isArrLike = isArr || isBuffer(object) || isTypedArray(object);\n\n      iteratee = getIteratee(iteratee, 4);\n      if (accumulator == null) {\n        var Ctor = object && object.constructor;\n        if (isArrLike) {\n          accumulator = isArr ? new Ctor : [];\n        }\n        else if (isObject(object)) {\n          accumulator = isFunction(Ctor) ? baseCreate(getPrototype(object)) : {};\n        }\n        else {\n          accumulator = {};\n        }\n      }\n      (isArrLike ? arrayEach : baseForOwn)(object, function(value, index, object) {\n        return iteratee(accumulator, value, index, object);\n      });\n      return accumulator;\n    }\n\n    /**\n     * Removes the property at `path` of `object`.\n     *\n     * **Note:** This method mutates `object`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Object\n     * @param {Object} object The object to modify.\n     * @param {Array|string} path The path of the property to unset.\n     * @returns {boolean} Returns `true` if the property is deleted, else `false`.\n     * @example\n     *\n     * var object = { 'a': [{ 'b': { 'c': 7 } }] };\n     * _.unset(object, 'a[0].b.c');\n     * // => true\n     *\n     * console.log(object);\n     * // => { 'a': [{ 'b': {} }] };\n     *\n     * _.unset(object, ['a', '0', 'b', 'c']);\n     * // => true\n     *\n     * console.log(object);\n     * // => { 'a': [{ 'b': {} }] };\n     */\n    function unset(object, path) {\n      return object == null ? true : baseUnset(object, path);\n    }\n\n    /**\n     * This method is like `_.set` except that accepts `updater` to produce the\n     * value to set. Use `_.updateWith` to customize `path` creation. The `updater`\n     * is invoked with one argument: (value).\n     *\n     * **Note:** This method mutates `object`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.6.0\n     * @category Object\n     * @param {Object} object The object to modify.\n     * @param {Array|string} path The path of the property to set.\n     * @param {Function} updater The function to produce the updated value.\n     * @returns {Object} Returns `object`.\n     * @example\n     *\n     * var object = { 'a': [{ 'b': { 'c': 3 } }] };\n     *\n     * _.update(object, 'a[0].b.c', function(n) { return n * n; });\n     * console.log(object.a[0].b.c);\n     * // => 9\n     *\n     * _.update(object, 'x[0].y.z', function(n) { return n ? n + 1 : 0; });\n     * console.log(object.x[0].y.z);\n     * // => 0\n     */\n    function update(object, path, updater) {\n      return object == null ? object : baseUpdate(object, path, castFunction(updater));\n    }\n\n    /**\n     * This method is like `_.update` except that it accepts `customizer` which is\n     * invoked to produce the objects of `path`.  If `customizer` returns `undefined`\n     * path creation is handled by the method instead. The `customizer` is invoked\n     * with three arguments: (nsValue, key, nsObject).\n     *\n     * **Note:** This method mutates `object`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.6.0\n     * @category Object\n     * @param {Object} object The object to modify.\n     * @param {Array|string} path The path of the property to set.\n     * @param {Function} updater The function to produce the updated value.\n     * @param {Function} [customizer] The function to customize assigned values.\n     * @returns {Object} Returns `object`.\n     * @example\n     *\n     * var object = {};\n     *\n     * _.updateWith(object, '[0][1]', _.constant('a'), Object);\n     * // => { '0': { '1': 'a' } }\n     */\n    function updateWith(object, path, updater, customizer) {\n      customizer = typeof customizer == 'function' ? customizer : undefined;\n      return object == null ? object : baseUpdate(object, path, castFunction(updater), customizer);\n    }\n\n    /**\n     * Creates an array of the own enumerable string keyed property values of `object`.\n     *\n     * **Note:** Non-object values are coerced to objects.\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 values.\n     * @example\n     *\n     * function Foo() {\n     *   this.a = 1;\n     *   this.b = 2;\n     * }\n     *\n     * Foo.prototype.c = 3;\n     *\n     * _.values(new Foo);\n     * // => [1, 2] (iteration order is not guaranteed)\n     *\n     * _.values('hi');\n     * // => ['h', 'i']\n     */\n    function values(object) {\n      return object == null ? [] : baseValues(object, keys(object));\n    }\n\n    /**\n     * Creates an array of the own and inherited enumerable string keyed property\n     * values of `object`.\n     *\n     * **Note:** Non-object values are coerced to objects.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category Object\n     * @param {Object} object The object to query.\n     * @returns {Array} Returns the array of property values.\n     * @example\n     *\n     * function Foo() {\n     *   this.a = 1;\n     *   this.b = 2;\n     * }\n     *\n     * Foo.prototype.c = 3;\n     *\n     * _.valuesIn(new Foo);\n     * // => [1, 2, 3] (iteration order is not guaranteed)\n     */\n    function valuesIn(object) {\n      return object == null ? [] : baseValues(object, keysIn(object));\n    }\n\n    /*------------------------------------------------------------------------*/\n\n    /**\n     * Clamps `number` within the inclusive `lower` and `upper` bounds.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Number\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     * @example\n     *\n     * _.clamp(-10, -5, 5);\n     * // => -5\n     *\n     * _.clamp(10, -5, 5);\n     * // => 5\n     */\n    function clamp(number, lower, upper) {\n      if (upper === undefined) {\n        upper = lower;\n        lower = undefined;\n      }\n      if (upper !== undefined) {\n        upper = toNumber(upper);\n        upper = upper === upper ? upper : 0;\n      }\n      if (lower !== undefined) {\n        lower = toNumber(lower);\n        lower = lower === lower ? lower : 0;\n      }\n      return baseClamp(toNumber(number), lower, upper);\n    }\n\n    /**\n     * Checks if `n` is between `start` and up to, but not including, `end`. If\n     * `end` is not specified, it's set to `start` with `start` then set to `0`.\n     * If `start` is greater than `end` the params are swapped to support\n     * negative ranges.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.3.0\n     * @category Number\n     * @param {number} number The number to check.\n     * @param {number} [start=0] The start of the range.\n     * @param {number} end The end of the range.\n     * @returns {boolean} Returns `true` if `number` is in the range, else `false`.\n     * @see _.range, _.rangeRight\n     * @example\n     *\n     * _.inRange(3, 2, 4);\n     * // => true\n     *\n     * _.inRange(4, 8);\n     * // => true\n     *\n     * _.inRange(4, 2);\n     * // => false\n     *\n     * _.inRange(2, 2);\n     * // => false\n     *\n     * _.inRange(1.2, 2);\n     * // => true\n     *\n     * _.inRange(5.2, 4);\n     * // => false\n     *\n     * _.inRange(-3, -2, -6);\n     * // => true\n     */\n    function inRange(number, start, end) {\n      start = toFinite(start);\n      if (end === undefined) {\n        end = start;\n        start = 0;\n      } else {\n        end = toFinite(end);\n      }\n      number = toNumber(number);\n      return baseInRange(number, start, end);\n    }\n\n    /**\n     * Produces a random number between the inclusive `lower` and `upper` bounds.\n     * If only one argument is provided a number between `0` and the given number\n     * is returned. If `floating` is `true`, or either `lower` or `upper` are\n     * floats, a floating-point number is returned instead of an integer.\n     *\n     * **Note:** JavaScript follows the IEEE-754 standard for resolving\n     * floating-point values which can produce unexpected results.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.7.0\n     * @category Number\n     * @param {number} [lower=0] The lower bound.\n     * @param {number} [upper=1] The upper bound.\n     * @param {boolean} [floating] Specify returning a floating-point number.\n     * @returns {number} Returns the random number.\n     * @example\n     *\n     * _.random(0, 5);\n     * // => an integer between 0 and 5\n     *\n     * _.random(5);\n     * // => also an integer between 0 and 5\n     *\n     * _.random(5, true);\n     * // => a floating-point number between 0 and 5\n     *\n     * _.random(1.2, 5.2);\n     * // => a floating-point number between 1.2 and 5.2\n     */\n    function random(lower, upper, floating) {\n      if (floating && typeof floating != 'boolean' && isIterateeCall(lower, upper, floating)) {\n        upper = floating = undefined;\n      }\n      if (floating === undefined) {\n        if (typeof upper == 'boolean') {\n          floating = upper;\n          upper = undefined;\n        }\n        else if (typeof lower == 'boolean') {\n          floating = lower;\n          lower = undefined;\n        }\n      }\n      if (lower === undefined && upper === undefined) {\n        lower = 0;\n        upper = 1;\n      }\n      else {\n        lower = toFinite(lower);\n        if (upper === undefined) {\n          upper = lower;\n          lower = 0;\n        } else {\n          upper = toFinite(upper);\n        }\n      }\n      if (lower > upper) {\n        var temp = lower;\n        lower = upper;\n        upper = temp;\n      }\n      if (floating || lower % 1 || upper % 1) {\n        var rand = nativeRandom();\n        return nativeMin(lower + (rand * (upper - lower + freeParseFloat('1e-' + ((rand + '').length - 1)))), upper);\n      }\n      return baseRandom(lower, upper);\n    }\n\n    /*------------------------------------------------------------------------*/\n\n    /**\n     * Converts `string` to [camel case](https://en.wikipedia.org/wiki/CamelCase).\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category String\n     * @param {string} [string=''] The string to convert.\n     * @returns {string} Returns the camel cased string.\n     * @example\n     *\n     * _.camelCase('Foo Bar');\n     * // => 'fooBar'\n     *\n     * _.camelCase('--foo-bar--');\n     * // => 'fooBar'\n     *\n     * _.camelCase('__FOO_BAR__');\n     * // => 'fooBar'\n     */\n    var camelCase = createCompounder(function(result, word, index) {\n      word = word.toLowerCase();\n      return result + (index ? capitalize(word) : word);\n    });\n\n    /**\n     * Converts the first character of `string` to upper case and the remaining\n     * to lower case.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category String\n     * @param {string} [string=''] The string to capitalize.\n     * @returns {string} Returns the capitalized string.\n     * @example\n     *\n     * _.capitalize('FRED');\n     * // => 'Fred'\n     */\n    function capitalize(string) {\n      return upperFirst(toString(string).toLowerCase());\n    }\n\n    /**\n     * Deburrs `string` by converting\n     * [Latin-1 Supplement](https://en.wikipedia.org/wiki/Latin-1_Supplement_(Unicode_block)#Character_table)\n     * and [Latin Extended-A](https://en.wikipedia.org/wiki/Latin_Extended-A)\n     * letters to basic Latin letters and removing\n     * [combining diacritical marks](https://en.wikipedia.org/wiki/Combining_Diacritical_Marks).\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category String\n     * @param {string} [string=''] The string to deburr.\n     * @returns {string} Returns the deburred string.\n     * @example\n     *\n     * _.deburr('déjà vu');\n     * // => 'deja vu'\n     */\n    function deburr(string) {\n      string = toString(string);\n      return string && string.replace(reLatin, deburrLetter).replace(reComboMark, '');\n    }\n\n    /**\n     * Checks if `string` ends with the given target string.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category String\n     * @param {string} [string=''] The string to inspect.\n     * @param {string} [target] The string to search for.\n     * @param {number} [position=string.length] The position to search up to.\n     * @returns {boolean} Returns `true` if `string` ends with `target`,\n     *  else `false`.\n     * @example\n     *\n     * _.endsWith('abc', 'c');\n     * // => true\n     *\n     * _.endsWith('abc', 'b');\n     * // => false\n     *\n     * _.endsWith('abc', 'b', 2);\n     * // => true\n     */\n    function endsWith(string, target, position) {\n      string = toString(string);\n      target = baseToString(target);\n\n      var length = string.length;\n      position = position === undefined\n        ? length\n        : baseClamp(toInteger(position), 0, length);\n\n      var end = position;\n      position -= target.length;\n      return position >= 0 && string.slice(position, end) == target;\n    }\n\n    /**\n     * Converts the characters \"&\", \"<\", \">\", '\"', and \"'\" in `string` to their\n     * corresponding HTML entities.\n     *\n     * **Note:** No other characters are escaped. To escape additional\n     * characters use a third-party library like [_he_](https://mths.be/he).\n     *\n     * Though the \">\" character is escaped for symmetry, characters like\n     * \">\" and \"/\" don't need escaping in HTML and have no special meaning\n     * unless they're part of a tag or unquoted attribute value. See\n     * [Mathias Bynens's article](https://mathiasbynens.be/notes/ambiguous-ampersands)\n     * (under \"semi-related fun fact\") for more details.\n     *\n     * When working with HTML you should always\n     * [quote attribute values](http://wonko.com/post/html-escaping) to reduce\n     * XSS vectors.\n     *\n     * @static\n     * @since 0.1.0\n     * @memberOf _\n     * @category String\n     * @param {string} [string=''] The string to escape.\n     * @returns {string} Returns the escaped string.\n     * @example\n     *\n     * _.escape('fred, barney, & pebbles');\n     * // => 'fred, barney, &amp; pebbles'\n     */\n    function escape(string) {\n      string = toString(string);\n      return (string && reHasUnescapedHtml.test(string))\n        ? string.replace(reUnescapedHtml, escapeHtmlChar)\n        : string;\n    }\n\n    /**\n     * Escapes the `RegExp` special characters \"^\", \"$\", \"\\\", \".\", \"*\", \"+\",\n     * \"?\", \"(\", \")\", \"[\", \"]\", \"{\", \"}\", and \"|\" in `string`.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category String\n     * @param {string} [string=''] The string to escape.\n     * @returns {string} Returns the escaped string.\n     * @example\n     *\n     * _.escapeRegExp('[lodash](https://lodash.com/)');\n     * // => '\\[lodash\\]\\(https://lodash\\.com/\\)'\n     */\n    function escapeRegExp(string) {\n      string = toString(string);\n      return (string && reHasRegExpChar.test(string))\n        ? string.replace(reRegExpChar, '\\\\$&')\n        : string;\n    }\n\n    /**\n     * Converts `string` to\n     * [kebab case](https://en.wikipedia.org/wiki/Letter_case#Special_case_styles).\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category String\n     * @param {string} [string=''] The string to convert.\n     * @returns {string} Returns the kebab cased string.\n     * @example\n     *\n     * _.kebabCase('Foo Bar');\n     * // => 'foo-bar'\n     *\n     * _.kebabCase('fooBar');\n     * // => 'foo-bar'\n     *\n     * _.kebabCase('__FOO_BAR__');\n     * // => 'foo-bar'\n     */\n    var kebabCase = createCompounder(function(result, word, index) {\n      return result + (index ? '-' : '') + word.toLowerCase();\n    });\n\n    /**\n     * Converts `string`, as space separated words, to lower case.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category String\n     * @param {string} [string=''] The string to convert.\n     * @returns {string} Returns the lower cased string.\n     * @example\n     *\n     * _.lowerCase('--Foo-Bar--');\n     * // => 'foo bar'\n     *\n     * _.lowerCase('fooBar');\n     * // => 'foo bar'\n     *\n     * _.lowerCase('__FOO_BAR__');\n     * // => 'foo bar'\n     */\n    var lowerCase = createCompounder(function(result, word, index) {\n      return result + (index ? ' ' : '') + word.toLowerCase();\n    });\n\n    /**\n     * Converts the first character of `string` to lower case.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category String\n     * @param {string} [string=''] The string to convert.\n     * @returns {string} Returns the converted string.\n     * @example\n     *\n     * _.lowerFirst('Fred');\n     * // => 'fred'\n     *\n     * _.lowerFirst('FRED');\n     * // => 'fRED'\n     */\n    var lowerFirst = createCaseFirst('toLowerCase');\n\n    /**\n     * Pads `string` on the left and right sides if it's shorter than `length`.\n     * Padding characters are truncated if they can't be evenly divided by `length`.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category String\n     * @param {string} [string=''] The string to pad.\n     * @param {number} [length=0] The padding length.\n     * @param {string} [chars=' '] The string used as padding.\n     * @returns {string} Returns the padded string.\n     * @example\n     *\n     * _.pad('abc', 8);\n     * // => '  abc   '\n     *\n     * _.pad('abc', 8, '_-');\n     * // => '_-abc_-_'\n     *\n     * _.pad('abc', 3);\n     * // => 'abc'\n     */\n    function pad(string, length, chars) {\n      string = toString(string);\n      length = toInteger(length);\n\n      var strLength = length ? stringSize(string) : 0;\n      if (!length || strLength >= length) {\n        return string;\n      }\n      var mid = (length - strLength) / 2;\n      return (\n        createPadding(nativeFloor(mid), chars) +\n        string +\n        createPadding(nativeCeil(mid), chars)\n      );\n    }\n\n    /**\n     * Pads `string` on the right side if it's shorter than `length`. Padding\n     * characters are truncated if they exceed `length`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category String\n     * @param {string} [string=''] The string to pad.\n     * @param {number} [length=0] The padding length.\n     * @param {string} [chars=' '] The string used as padding.\n     * @returns {string} Returns the padded string.\n     * @example\n     *\n     * _.padEnd('abc', 6);\n     * // => 'abc   '\n     *\n     * _.padEnd('abc', 6, '_-');\n     * // => 'abc_-_'\n     *\n     * _.padEnd('abc', 3);\n     * // => 'abc'\n     */\n    function padEnd(string, length, chars) {\n      string = toString(string);\n      length = toInteger(length);\n\n      var strLength = length ? stringSize(string) : 0;\n      return (length && strLength < length)\n        ? (string + createPadding(length - strLength, chars))\n        : string;\n    }\n\n    /**\n     * Pads `string` on the left side if it's shorter than `length`. Padding\n     * characters are truncated if they exceed `length`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category String\n     * @param {string} [string=''] The string to pad.\n     * @param {number} [length=0] The padding length.\n     * @param {string} [chars=' '] The string used as padding.\n     * @returns {string} Returns the padded string.\n     * @example\n     *\n     * _.padStart('abc', 6);\n     * // => '   abc'\n     *\n     * _.padStart('abc', 6, '_-');\n     * // => '_-_abc'\n     *\n     * _.padStart('abc', 3);\n     * // => 'abc'\n     */\n    function padStart(string, length, chars) {\n      string = toString(string);\n      length = toInteger(length);\n\n      var strLength = length ? stringSize(string) : 0;\n      return (length && strLength < length)\n        ? (createPadding(length - strLength, chars) + string)\n        : string;\n    }\n\n    /**\n     * Converts `string` to an integer of the specified radix. If `radix` is\n     * `undefined` or `0`, a `radix` of `10` is used unless `value` is a\n     * hexadecimal, in which case a `radix` of `16` is used.\n     *\n     * **Note:** This method aligns with the\n     * [ES5 implementation](https://es5.github.io/#x15.1.2.2) of `parseInt`.\n     *\n     * @static\n     * @memberOf _\n     * @since 1.1.0\n     * @category String\n     * @param {string} string The string to convert.\n     * @param {number} [radix=10] The radix to interpret `value` by.\n     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n     * @returns {number} Returns the converted integer.\n     * @example\n     *\n     * _.parseInt('08');\n     * // => 8\n     *\n     * _.map(['6', '08', '10'], _.parseInt);\n     * // => [6, 8, 10]\n     */\n    function parseInt(string, radix, guard) {\n      if (guard || radix == null) {\n        radix = 0;\n      } else if (radix) {\n        radix = +radix;\n      }\n      return nativeParseInt(toString(string).replace(reTrimStart, ''), radix || 0);\n    }\n\n    /**\n     * Repeats the given string `n` times.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category String\n     * @param {string} [string=''] The string to repeat.\n     * @param {number} [n=1] The number of times to repeat the string.\n     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n     * @returns {string} Returns the repeated string.\n     * @example\n     *\n     * _.repeat('*', 3);\n     * // => '***'\n     *\n     * _.repeat('abc', 2);\n     * // => 'abcabc'\n     *\n     * _.repeat('abc', 0);\n     * // => ''\n     */\n    function repeat(string, n, guard) {\n      if ((guard ? isIterateeCall(string, n, guard) : n === undefined)) {\n        n = 1;\n      } else {\n        n = toInteger(n);\n      }\n      return baseRepeat(toString(string), n);\n    }\n\n    /**\n     * Replaces matches for `pattern` in `string` with `replacement`.\n     *\n     * **Note:** This method is based on\n     * [`String#replace`](https://mdn.io/String/replace).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category String\n     * @param {string} [string=''] The string to modify.\n     * @param {RegExp|string} pattern The pattern to replace.\n     * @param {Function|string} replacement The match replacement.\n     * @returns {string} Returns the modified string.\n     * @example\n     *\n     * _.replace('Hi Fred', 'Fred', 'Barney');\n     * // => 'Hi Barney'\n     */\n    function replace() {\n      var args = arguments,\n          string = toString(args[0]);\n\n      return args.length < 3 ? string : string.replace(args[1], args[2]);\n    }\n\n    /**\n     * Converts `string` to\n     * [snake case](https://en.wikipedia.org/wiki/Snake_case).\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category String\n     * @param {string} [string=''] The string to convert.\n     * @returns {string} Returns the snake cased string.\n     * @example\n     *\n     * _.snakeCase('Foo Bar');\n     * // => 'foo_bar'\n     *\n     * _.snakeCase('fooBar');\n     * // => 'foo_bar'\n     *\n     * _.snakeCase('--FOO-BAR--');\n     * // => 'foo_bar'\n     */\n    var snakeCase = createCompounder(function(result, word, index) {\n      return result + (index ? '_' : '') + word.toLowerCase();\n    });\n\n    /**\n     * Splits `string` by `separator`.\n     *\n     * **Note:** This method is based on\n     * [`String#split`](https://mdn.io/String/split).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category String\n     * @param {string} [string=''] The string to split.\n     * @param {RegExp|string} separator The separator pattern to split by.\n     * @param {number} [limit] The length to truncate results to.\n     * @returns {Array} Returns the string segments.\n     * @example\n     *\n     * _.split('a-b-c', '-', 2);\n     * // => ['a', 'b']\n     */\n    function split(string, separator, limit) {\n      if (limit && typeof limit != 'number' && isIterateeCall(string, separator, limit)) {\n        separator = limit = undefined;\n      }\n      limit = limit === undefined ? MAX_ARRAY_LENGTH : limit >>> 0;\n      if (!limit) {\n        return [];\n      }\n      string = toString(string);\n      if (string && (\n            typeof separator == 'string' ||\n            (separator != null && !isRegExp(separator))\n          )) {\n        separator = baseToString(separator);\n        if (!separator && hasUnicode(string)) {\n          return castSlice(stringToArray(string), 0, limit);\n        }\n      }\n      return string.split(separator, limit);\n    }\n\n    /**\n     * Converts `string` to\n     * [start case](https://en.wikipedia.org/wiki/Letter_case#Stylistic_or_specialised_usage).\n     *\n     * @static\n     * @memberOf _\n     * @since 3.1.0\n     * @category String\n     * @param {string} [string=''] The string to convert.\n     * @returns {string} Returns the start cased string.\n     * @example\n     *\n     * _.startCase('--foo-bar--');\n     * // => 'Foo Bar'\n     *\n     * _.startCase('fooBar');\n     * // => 'Foo Bar'\n     *\n     * _.startCase('__FOO_BAR__');\n     * // => 'FOO BAR'\n     */\n    var startCase = createCompounder(function(result, word, index) {\n      return result + (index ? ' ' : '') + upperFirst(word);\n    });\n\n    /**\n     * Checks if `string` starts with the given target string.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category String\n     * @param {string} [string=''] The string to inspect.\n     * @param {string} [target] The string to search for.\n     * @param {number} [position=0] The position to search from.\n     * @returns {boolean} Returns `true` if `string` starts with `target`,\n     *  else `false`.\n     * @example\n     *\n     * _.startsWith('abc', 'a');\n     * // => true\n     *\n     * _.startsWith('abc', 'b');\n     * // => false\n     *\n     * _.startsWith('abc', 'b', 1);\n     * // => true\n     */\n    function startsWith(string, target, position) {\n      string = toString(string);\n      position = position == null\n        ? 0\n        : baseClamp(toInteger(position), 0, string.length);\n\n      target = baseToString(target);\n      return string.slice(position, position + target.length) == target;\n    }\n\n    /**\n     * Creates a compiled template function that can interpolate data properties\n     * in \"interpolate\" delimiters, HTML-escape interpolated data properties in\n     * \"escape\" delimiters, and execute JavaScript in \"evaluate\" delimiters. Data\n     * properties may be accessed as free variables in the template. If a setting\n     * object is given, it takes precedence over `_.templateSettings` values.\n     *\n     * **Note:** In the development build `_.template` utilizes\n     * [sourceURLs](http://www.html5rocks.com/en/tutorials/developertools/sourcemaps/#toc-sourceurl)\n     * for easier debugging.\n     *\n     * For more information on precompiling templates see\n     * [lodash's custom builds documentation](https://lodash.com/custom-builds).\n     *\n     * For more information on Chrome extension sandboxes see\n     * [Chrome's extensions documentation](https://developer.chrome.com/extensions/sandboxingEval).\n     *\n     * @static\n     * @since 0.1.0\n     * @memberOf _\n     * @category String\n     * @param {string} [string=''] The template string.\n     * @param {Object} [options={}] The options object.\n     * @param {RegExp} [options.escape=_.templateSettings.escape]\n     *  The HTML \"escape\" delimiter.\n     * @param {RegExp} [options.evaluate=_.templateSettings.evaluate]\n     *  The \"evaluate\" delimiter.\n     * @param {Object} [options.imports=_.templateSettings.imports]\n     *  An object to import into the template as free variables.\n     * @param {RegExp} [options.interpolate=_.templateSettings.interpolate]\n     *  The \"interpolate\" delimiter.\n     * @param {string} [options.sourceURL='lodash.templateSources[n]']\n     *  The sourceURL of the compiled template.\n     * @param {string} [options.variable='obj']\n     *  The data object variable name.\n     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n     * @returns {Function} Returns the compiled template function.\n     * @example\n     *\n     * // Use the \"interpolate\" delimiter to create a compiled template.\n     * var compiled = _.template('hello <%= user %>!');\n     * compiled({ 'user': 'fred' });\n     * // => 'hello fred!'\n     *\n     * // Use the HTML \"escape\" delimiter to escape data property values.\n     * var compiled = _.template('<b><%- value %></b>');\n     * compiled({ 'value': '<script>' });\n     * // => '<b>&lt;script&gt;</b>'\n     *\n     * // Use the \"evaluate\" delimiter to execute JavaScript and generate HTML.\n     * var compiled = _.template('<% _.forEach(users, function(user) { %><li><%- user %></li><% }); %>');\n     * compiled({ 'users': ['fred', 'barney'] });\n     * // => '<li>fred</li><li>barney</li>'\n     *\n     * // Use the internal `print` function in \"evaluate\" delimiters.\n     * var compiled = _.template('<% print(\"hello \" + user); %>!');\n     * compiled({ 'user': 'barney' });\n     * // => 'hello barney!'\n     *\n     * // Use the ES template literal delimiter as an \"interpolate\" delimiter.\n     * // Disable support by replacing the \"interpolate\" delimiter.\n     * var compiled = _.template('hello ${ user }!');\n     * compiled({ 'user': 'pebbles' });\n     * // => 'hello pebbles!'\n     *\n     * // Use backslashes to treat delimiters as plain text.\n     * var compiled = _.template('<%= \"\\\\<%- value %\\\\>\" %>');\n     * compiled({ 'value': 'ignored' });\n     * // => '<%- value %>'\n     *\n     * // Use the `imports` option to import `jQuery` as `jq`.\n     * var text = '<% jq.each(users, function(user) { %><li><%- user %></li><% }); %>';\n     * var compiled = _.template(text, { 'imports': { 'jq': jQuery } });\n     * compiled({ 'users': ['fred', 'barney'] });\n     * // => '<li>fred</li><li>barney</li>'\n     *\n     * // Use the `sourceURL` option to specify a custom sourceURL for the template.\n     * var compiled = _.template('hello <%= user %>!', { 'sourceURL': '/basic/greeting.jst' });\n     * compiled(data);\n     * // => Find the source of \"greeting.jst\" under the Sources tab or Resources panel of the web inspector.\n     *\n     * // Use the `variable` option to ensure a with-statement isn't used in the compiled template.\n     * var compiled = _.template('hi <%= data.user %>!', { 'variable': 'data' });\n     * compiled.source;\n     * // => function(data) {\n     * //   var __t, __p = '';\n     * //   __p += 'hi ' + ((__t = ( data.user )) == null ? '' : __t) + '!';\n     * //   return __p;\n     * // }\n     *\n     * // Use custom template delimiters.\n     * _.templateSettings.interpolate = /{{([\\s\\S]+?)}}/g;\n     * var compiled = _.template('hello {{ user }}!');\n     * compiled({ 'user': 'mustache' });\n     * // => 'hello mustache!'\n     *\n     * // Use the `source` property to inline compiled templates for meaningful\n     * // line numbers in error messages and stack traces.\n     * fs.writeFileSync(path.join(process.cwd(), 'jst.js'), '\\\n     *   var JST = {\\\n     *     \"main\": ' + _.template(mainText).source + '\\\n     *   };\\\n     * ');\n     */\n    function template(string, options, guard) {\n      // Based on John Resig's `tmpl` implementation\n      // (http://ejohn.org/blog/javascript-micro-templating/)\n      // and Laura Doktorova's doT.js (https://github.com/olado/doT).\n      var settings = lodash.templateSettings;\n\n      if (guard && isIterateeCall(string, options, guard)) {\n        options = undefined;\n      }\n      string = toString(string);\n      options = assignInWith({}, options, settings, customDefaultsAssignIn);\n\n      var imports = assignInWith({}, options.imports, settings.imports, customDefaultsAssignIn),\n          importsKeys = keys(imports),\n          importsValues = baseValues(imports, importsKeys);\n\n      var isEscaping,\n          isEvaluating,\n          index = 0,\n          interpolate = options.interpolate || reNoMatch,\n          source = \"__p += '\";\n\n      // Compile the regexp to match each delimiter.\n      var reDelimiters = RegExp(\n        (options.escape || reNoMatch).source + '|' +\n        interpolate.source + '|' +\n        (interpolate === reInterpolate ? reEsTemplate : reNoMatch).source + '|' +\n        (options.evaluate || reNoMatch).source + '|$'\n      , 'g');\n\n      // Use a sourceURL for easier debugging.\n      // The sourceURL gets injected into the source that's eval-ed, so be careful\n      // to normalize all kinds of whitespace, so e.g. newlines (and unicode versions of it) can't sneak in\n      // and escape the comment, thus injecting code that gets evaled.\n      var sourceURL = '//# sourceURL=' +\n        (hasOwnProperty.call(options, 'sourceURL')\n          ? (options.sourceURL + '').replace(/\\s/g, ' ')\n          : ('lodash.templateSources[' + (++templateCounter) + ']')\n        ) + '\\n';\n\n      string.replace(reDelimiters, function(match, escapeValue, interpolateValue, esTemplateValue, evaluateValue, offset) {\n        interpolateValue || (interpolateValue = esTemplateValue);\n\n        // Escape characters that can't be included in string literals.\n        source += string.slice(index, offset).replace(reUnescapedString, escapeStringChar);\n\n        // Replace delimiters with snippets.\n        if (escapeValue) {\n          isEscaping = true;\n          source += \"' +\\n__e(\" + escapeValue + \") +\\n'\";\n        }\n        if (evaluateValue) {\n          isEvaluating = true;\n          source += \"';\\n\" + evaluateValue + \";\\n__p += '\";\n        }\n        if (interpolateValue) {\n          source += \"' +\\n((__t = (\" + interpolateValue + \")) == null ? '' : __t) +\\n'\";\n        }\n        index = offset + match.length;\n\n        // The JS engine embedded in Adobe products needs `match` returned in\n        // order to produce the correct `offset` value.\n        return match;\n      });\n\n      source += \"';\\n\";\n\n      // If `variable` is not specified wrap a with-statement around the generated\n      // code to add the data object to the top of the scope chain.\n      var variable = hasOwnProperty.call(options, 'variable') && options.variable;\n      if (!variable) {\n        source = 'with (obj) {\\n' + source + '\\n}\\n';\n      }\n      // Throw an error if a forbidden character was found in `variable`, to prevent\n      // potential command injection attacks.\n      else if (reForbiddenIdentifierChars.test(variable)) {\n        throw new Error(INVALID_TEMPL_VAR_ERROR_TEXT);\n      }\n\n      // Cleanup code by stripping empty strings.\n      source = (isEvaluating ? source.replace(reEmptyStringLeading, '') : source)\n        .replace(reEmptyStringMiddle, '$1')\n        .replace(reEmptyStringTrailing, '$1;');\n\n      // Frame code as the function body.\n      source = 'function(' + (variable || 'obj') + ') {\\n' +\n        (variable\n          ? ''\n          : 'obj || (obj = {});\\n'\n        ) +\n        \"var __t, __p = ''\" +\n        (isEscaping\n           ? ', __e = _.escape'\n           : ''\n        ) +\n        (isEvaluating\n          ? ', __j = Array.prototype.join;\\n' +\n            \"function print() { __p += __j.call(arguments, '') }\\n\"\n          : ';\\n'\n        ) +\n        source +\n        'return __p\\n}';\n\n      var result = attempt(function() {\n        return Function(importsKeys, sourceURL + 'return ' + source)\n          .apply(undefined, importsValues);\n      });\n\n      // Provide the compiled function's source by its `toString` method or\n      // the `source` property as a convenience for inlining compiled templates.\n      result.source = source;\n      if (isError(result)) {\n        throw result;\n      }\n      return result;\n    }\n\n    /**\n     * Converts `string`, as a whole, to lower case just like\n     * [String#toLowerCase](https://mdn.io/toLowerCase).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category String\n     * @param {string} [string=''] The string to convert.\n     * @returns {string} Returns the lower cased string.\n     * @example\n     *\n     * _.toLower('--Foo-Bar--');\n     * // => '--foo-bar--'\n     *\n     * _.toLower('fooBar');\n     * // => 'foobar'\n     *\n     * _.toLower('__FOO_BAR__');\n     * // => '__foo_bar__'\n     */\n    function toLower(value) {\n      return toString(value).toLowerCase();\n    }\n\n    /**\n     * Converts `string`, as a whole, to upper case just like\n     * [String#toUpperCase](https://mdn.io/toUpperCase).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category String\n     * @param {string} [string=''] The string to convert.\n     * @returns {string} Returns the upper cased string.\n     * @example\n     *\n     * _.toUpper('--foo-bar--');\n     * // => '--FOO-BAR--'\n     *\n     * _.toUpper('fooBar');\n     * // => 'FOOBAR'\n     *\n     * _.toUpper('__foo_bar__');\n     * // => '__FOO_BAR__'\n     */\n    function toUpper(value) {\n      return toString(value).toUpperCase();\n    }\n\n    /**\n     * Removes leading and trailing whitespace or specified characters from `string`.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category String\n     * @param {string} [string=''] The string to trim.\n     * @param {string} [chars=whitespace] The characters to trim.\n     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n     * @returns {string} Returns the trimmed string.\n     * @example\n     *\n     * _.trim('  abc  ');\n     * // => 'abc'\n     *\n     * _.trim('-_-abc-_-', '_-');\n     * // => 'abc'\n     *\n     * _.map(['  foo  ', '  bar  '], _.trim);\n     * // => ['foo', 'bar']\n     */\n    function trim(string, chars, guard) {\n      string = toString(string);\n      if (string && (guard || chars === undefined)) {\n        return baseTrim(string);\n      }\n      if (!string || !(chars = baseToString(chars))) {\n        return string;\n      }\n      var strSymbols = stringToArray(string),\n          chrSymbols = stringToArray(chars),\n          start = charsStartIndex(strSymbols, chrSymbols),\n          end = charsEndIndex(strSymbols, chrSymbols) + 1;\n\n      return castSlice(strSymbols, start, end).join('');\n    }\n\n    /**\n     * Removes trailing whitespace or specified characters from `string`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category String\n     * @param {string} [string=''] The string to trim.\n     * @param {string} [chars=whitespace] The characters to trim.\n     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n     * @returns {string} Returns the trimmed string.\n     * @example\n     *\n     * _.trimEnd('  abc  ');\n     * // => '  abc'\n     *\n     * _.trimEnd('-_-abc-_-', '_-');\n     * // => '-_-abc'\n     */\n    function trimEnd(string, chars, guard) {\n      string = toString(string);\n      if (string && (guard || chars === undefined)) {\n        return string.slice(0, trimmedEndIndex(string) + 1);\n      }\n      if (!string || !(chars = baseToString(chars))) {\n        return string;\n      }\n      var strSymbols = stringToArray(string),\n          end = charsEndIndex(strSymbols, stringToArray(chars)) + 1;\n\n      return castSlice(strSymbols, 0, end).join('');\n    }\n\n    /**\n     * Removes leading whitespace or specified characters from `string`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category String\n     * @param {string} [string=''] The string to trim.\n     * @param {string} [chars=whitespace] The characters to trim.\n     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n     * @returns {string} Returns the trimmed string.\n     * @example\n     *\n     * _.trimStart('  abc  ');\n     * // => 'abc  '\n     *\n     * _.trimStart('-_-abc-_-', '_-');\n     * // => 'abc-_-'\n     */\n    function trimStart(string, chars, guard) {\n      string = toString(string);\n      if (string && (guard || chars === undefined)) {\n        return string.replace(reTrimStart, '');\n      }\n      if (!string || !(chars = baseToString(chars))) {\n        return string;\n      }\n      var strSymbols = stringToArray(string),\n          start = charsStartIndex(strSymbols, stringToArray(chars));\n\n      return castSlice(strSymbols, start).join('');\n    }\n\n    /**\n     * Truncates `string` if it's longer than the given maximum string length.\n     * The last characters of the truncated string are replaced with the omission\n     * string which defaults to \"...\".\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category String\n     * @param {string} [string=''] The string to truncate.\n     * @param {Object} [options={}] The options object.\n     * @param {number} [options.length=30] The maximum string length.\n     * @param {string} [options.omission='...'] The string to indicate text is omitted.\n     * @param {RegExp|string} [options.separator] The separator pattern to truncate to.\n     * @returns {string} Returns the truncated string.\n     * @example\n     *\n     * _.truncate('hi-diddly-ho there, neighborino');\n     * // => 'hi-diddly-ho there, neighbo...'\n     *\n     * _.truncate('hi-diddly-ho there, neighborino', {\n     *   'length': 24,\n     *   'separator': ' '\n     * });\n     * // => 'hi-diddly-ho there,...'\n     *\n     * _.truncate('hi-diddly-ho there, neighborino', {\n     *   'length': 24,\n     *   'separator': /,? +/\n     * });\n     * // => 'hi-diddly-ho there...'\n     *\n     * _.truncate('hi-diddly-ho there, neighborino', {\n     *   'omission': ' [...]'\n     * });\n     * // => 'hi-diddly-ho there, neig [...]'\n     */\n    function truncate(string, options) {\n      var length = DEFAULT_TRUNC_LENGTH,\n          omission = DEFAULT_TRUNC_OMISSION;\n\n      if (isObject(options)) {\n        var separator = 'separator' in options ? options.separator : separator;\n        length = 'length' in options ? toInteger(options.length) : length;\n        omission = 'omission' in options ? baseToString(options.omission) : omission;\n      }\n      string = toString(string);\n\n      var strLength = string.length;\n      if (hasUnicode(string)) {\n        var strSymbols = stringToArray(string);\n        strLength = strSymbols.length;\n      }\n      if (length >= strLength) {\n        return string;\n      }\n      var end = length - stringSize(omission);\n      if (end < 1) {\n        return omission;\n      }\n      var result = strSymbols\n        ? castSlice(strSymbols, 0, end).join('')\n        : string.slice(0, end);\n\n      if (separator === undefined) {\n        return result + omission;\n      }\n      if (strSymbols) {\n        end += (result.length - end);\n      }\n      if (isRegExp(separator)) {\n        if (string.slice(end).search(separator)) {\n          var match,\n              substring = result;\n\n          if (!separator.global) {\n            separator = RegExp(separator.source, toString(reFlags.exec(separator)) + 'g');\n          }\n          separator.lastIndex = 0;\n          while ((match = separator.exec(substring))) {\n            var newEnd = match.index;\n          }\n          result = result.slice(0, newEnd === undefined ? end : newEnd);\n        }\n      } else if (string.indexOf(baseToString(separator), end) != end) {\n        var index = result.lastIndexOf(separator);\n        if (index > -1) {\n          result = result.slice(0, index);\n        }\n      }\n      return result + omission;\n    }\n\n    /**\n     * The inverse of `_.escape`; this method converts the HTML entities\n     * `&amp;`, `&lt;`, `&gt;`, `&quot;`, and `&#39;` in `string` to\n     * their corresponding characters.\n     *\n     * **Note:** No other HTML entities are unescaped. To unescape additional\n     * HTML entities use a third-party library like [_he_](https://mths.be/he).\n     *\n     * @static\n     * @memberOf _\n     * @since 0.6.0\n     * @category String\n     * @param {string} [string=''] The string to unescape.\n     * @returns {string} Returns the unescaped string.\n     * @example\n     *\n     * _.unescape('fred, barney, &amp; pebbles');\n     * // => 'fred, barney, & pebbles'\n     */\n    function unescape(string) {\n      string = toString(string);\n      return (string && reHasEscapedHtml.test(string))\n        ? string.replace(reEscapedHtml, unescapeHtmlChar)\n        : string;\n    }\n\n    /**\n     * Converts `string`, as space separated words, to upper case.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category String\n     * @param {string} [string=''] The string to convert.\n     * @returns {string} Returns the upper cased string.\n     * @example\n     *\n     * _.upperCase('--foo-bar');\n     * // => 'FOO BAR'\n     *\n     * _.upperCase('fooBar');\n     * // => 'FOO BAR'\n     *\n     * _.upperCase('__foo_bar__');\n     * // => 'FOO BAR'\n     */\n    var upperCase = createCompounder(function(result, word, index) {\n      return result + (index ? ' ' : '') + word.toUpperCase();\n    });\n\n    /**\n     * Converts the first character of `string` to upper case.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category String\n     * @param {string} [string=''] The string to convert.\n     * @returns {string} Returns the converted string.\n     * @example\n     *\n     * _.upperFirst('fred');\n     * // => 'Fred'\n     *\n     * _.upperFirst('FRED');\n     * // => 'FRED'\n     */\n    var upperFirst = createCaseFirst('toUpperCase');\n\n    /**\n     * Splits `string` into an array of its words.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category String\n     * @param {string} [string=''] The string to inspect.\n     * @param {RegExp|string} [pattern] The pattern to match words.\n     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n     * @returns {Array} Returns the words of `string`.\n     * @example\n     *\n     * _.words('fred, barney, & pebbles');\n     * // => ['fred', 'barney', 'pebbles']\n     *\n     * _.words('fred, barney, & pebbles', /[^, ]+/g);\n     * // => ['fred', 'barney', '&', 'pebbles']\n     */\n    function words(string, pattern, guard) {\n      string = toString(string);\n      pattern = guard ? undefined : pattern;\n\n      if (pattern === undefined) {\n        return hasUnicodeWord(string) ? unicodeWords(string) : asciiWords(string);\n      }\n      return string.match(pattern) || [];\n    }\n\n    /*------------------------------------------------------------------------*/\n\n    /**\n     * Attempts to invoke `func`, returning either the result or the caught error\n     * object. Any additional arguments are provided to `func` when it's invoked.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category Util\n     * @param {Function} func The function to attempt.\n     * @param {...*} [args] The arguments to invoke `func` with.\n     * @returns {*} Returns the `func` result or error object.\n     * @example\n     *\n     * // Avoid throwing errors for invalid selectors.\n     * var elements = _.attempt(function(selector) {\n     *   return document.querySelectorAll(selector);\n     * }, '>_>');\n     *\n     * if (_.isError(elements)) {\n     *   elements = [];\n     * }\n     */\n    var attempt = baseRest(function(func, args) {\n      try {\n        return apply(func, undefined, args);\n      } catch (e) {\n        return isError(e) ? e : new Error(e);\n      }\n    });\n\n    /**\n     * Binds methods of an object to the object itself, overwriting the existing\n     * method.\n     *\n     * **Note:** This method doesn't set the \"length\" property of bound functions.\n     *\n     * @static\n     * @since 0.1.0\n     * @memberOf _\n     * @category Util\n     * @param {Object} object The object to bind and assign the bound methods to.\n     * @param {...(string|string[])} methodNames The object method names to bind.\n     * @returns {Object} Returns `object`.\n     * @example\n     *\n     * var view = {\n     *   'label': 'docs',\n     *   'click': function() {\n     *     console.log('clicked ' + this.label);\n     *   }\n     * };\n     *\n     * _.bindAll(view, ['click']);\n     * jQuery(element).on('click', view.click);\n     * // => Logs 'clicked docs' when clicked.\n     */\n    var bindAll = flatRest(function(object, methodNames) {\n      arrayEach(methodNames, function(key) {\n        key = toKey(key);\n        baseAssignValue(object, key, bind(object[key], object));\n      });\n      return object;\n    });\n\n    /**\n     * Creates a function that iterates over `pairs` and invokes the corresponding\n     * function of the first predicate to return truthy. The predicate-function\n     * pairs are invoked with the `this` binding and arguments of the created\n     * function.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Util\n     * @param {Array} pairs The predicate-function pairs.\n     * @returns {Function} Returns the new composite function.\n     * @example\n     *\n     * var func = _.cond([\n     *   [_.matches({ 'a': 1 }),           _.constant('matches A')],\n     *   [_.conforms({ 'b': _.isNumber }), _.constant('matches B')],\n     *   [_.stubTrue,                      _.constant('no match')]\n     * ]);\n     *\n     * func({ 'a': 1, 'b': 2 });\n     * // => 'matches A'\n     *\n     * func({ 'a': 0, 'b': 1 });\n     * // => 'matches B'\n     *\n     * func({ 'a': '1', 'b': '2' });\n     * // => 'no match'\n     */\n    function cond(pairs) {\n      var length = pairs == null ? 0 : pairs.length,\n          toIteratee = getIteratee();\n\n      pairs = !length ? [] : arrayMap(pairs, function(pair) {\n        if (typeof pair[1] != 'function') {\n          throw new TypeError(FUNC_ERROR_TEXT);\n        }\n        return [toIteratee(pair[0]), pair[1]];\n      });\n\n      return baseRest(function(args) {\n        var index = -1;\n        while (++index < length) {\n          var pair = pairs[index];\n          if (apply(pair[0], this, args)) {\n            return apply(pair[1], this, args);\n          }\n        }\n      });\n    }\n\n    /**\n     * Creates a function that invokes the predicate properties of `source` with\n     * the corresponding property values of a given object, returning `true` if\n     * all predicates return truthy, else `false`.\n     *\n     * **Note:** The created function is equivalent to `_.conformsTo` with\n     * `source` partially applied.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Util\n     * @param {Object} source The object of property predicates to conform to.\n     * @returns {Function} Returns the new spec function.\n     * @example\n     *\n     * var objects = [\n     *   { 'a': 2, 'b': 1 },\n     *   { 'a': 1, 'b': 2 }\n     * ];\n     *\n     * _.filter(objects, _.conforms({ 'b': function(n) { return n > 1; } }));\n     * // => [{ 'a': 1, 'b': 2 }]\n     */\n    function conforms(source) {\n      return baseConforms(baseClone(source, CLONE_DEEP_FLAG));\n    }\n\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     */\n    function constant(value) {\n      return function() {\n        return value;\n      };\n    }\n\n    /**\n     * Checks `value` to determine whether a default value should be returned in\n     * its place. The `defaultValue` is returned if `value` is `NaN`, `null`,\n     * or `undefined`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.14.0\n     * @category Util\n     * @param {*} value The value to check.\n     * @param {*} defaultValue The default value.\n     * @returns {*} Returns the resolved value.\n     * @example\n     *\n     * _.defaultTo(1, 10);\n     * // => 1\n     *\n     * _.defaultTo(undefined, 10);\n     * // => 10\n     */\n    function defaultTo(value, defaultValue) {\n      return (value == null || value !== value) ? defaultValue : value;\n    }\n\n    /**\n     * Creates a function that returns the result of invoking the given functions\n     * with the `this` binding of the created function, where each successive\n     * invocation is supplied the return value of the previous.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category Util\n     * @param {...(Function|Function[])} [funcs] The functions to invoke.\n     * @returns {Function} Returns the new composite function.\n     * @see _.flowRight\n     * @example\n     *\n     * function square(n) {\n     *   return n * n;\n     * }\n     *\n     * var addSquare = _.flow([_.add, square]);\n     * addSquare(1, 2);\n     * // => 9\n     */\n    var flow = createFlow();\n\n    /**\n     * This method is like `_.flow` except that it creates a function that\n     * invokes the given functions from right to left.\n     *\n     * @static\n     * @since 3.0.0\n     * @memberOf _\n     * @category Util\n     * @param {...(Function|Function[])} [funcs] The functions to invoke.\n     * @returns {Function} Returns the new composite function.\n     * @see _.flow\n     * @example\n     *\n     * function square(n) {\n     *   return n * n;\n     * }\n     *\n     * var addSquare = _.flowRight([square, _.add]);\n     * addSquare(1, 2);\n     * // => 9\n     */\n    var flowRight = createFlow(true);\n\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     */\n    function identity(value) {\n      return value;\n    }\n\n    /**\n     * Creates a function that invokes `func` with the arguments of the created\n     * function. If `func` is a property name, the created function returns the\n     * property value for a given element. If `func` is an array or object, the\n     * created function returns `true` for elements that contain the equivalent\n     * source properties, otherwise it returns `false`.\n     *\n     * @static\n     * @since 4.0.0\n     * @memberOf _\n     * @category Util\n     * @param {*} [func=_.identity] The value to convert to a callback.\n     * @returns {Function} Returns the callback.\n     * @example\n     *\n     * var users = [\n     *   { 'user': 'barney', 'age': 36, 'active': true },\n     *   { 'user': 'fred',   'age': 40, 'active': false }\n     * ];\n     *\n     * // The `_.matches` iteratee shorthand.\n     * _.filter(users, _.iteratee({ 'user': 'barney', 'active': true }));\n     * // => [{ 'user': 'barney', 'age': 36, 'active': true }]\n     *\n     * // The `_.matchesProperty` iteratee shorthand.\n     * _.filter(users, _.iteratee(['user', 'fred']));\n     * // => [{ 'user': 'fred', 'age': 40 }]\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.map(users, _.iteratee('user'));\n     * // => ['barney', 'fred']\n     *\n     * // Create custom iteratee shorthands.\n     * _.iteratee = _.wrap(_.iteratee, function(iteratee, func) {\n     *   return !_.isRegExp(func) ? iteratee(func) : function(string) {\n     *     return func.test(string);\n     *   };\n     * });\n     *\n     * _.filter(['abc', 'def'], /ef/);\n     * // => ['def']\n     */\n    function iteratee(func) {\n      return baseIteratee(typeof func == 'function' ? func : baseClone(func, CLONE_DEEP_FLAG));\n    }\n\n    /**\n     * Creates a function that performs a partial deep comparison between a given\n     * object and `source`, returning `true` if the given object has equivalent\n     * property values, else `false`.\n     *\n     * **Note:** The created function is equivalent to `_.isMatch` with `source`\n     * partially applied.\n     *\n     * Partial comparisons will match empty array and empty object `source`\n     * values against any array or object value, respectively. See `_.isEqual`\n     * for a list of supported value comparisons.\n     *\n     * **Note:** Multiple values can be checked by combining several matchers\n     * using `_.overSome`\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category Util\n     * @param {Object} source The object of property values to match.\n     * @returns {Function} Returns the new spec function.\n     * @example\n     *\n     * var objects = [\n     *   { 'a': 1, 'b': 2, 'c': 3 },\n     *   { 'a': 4, 'b': 5, 'c': 6 }\n     * ];\n     *\n     * _.filter(objects, _.matches({ 'a': 4, 'c': 6 }));\n     * // => [{ 'a': 4, 'b': 5, 'c': 6 }]\n     *\n     * // Checking for several possible values\n     * _.filter(objects, _.overSome([_.matches({ 'a': 1 }), _.matches({ 'a': 4 })]));\n     * // => [{ 'a': 1, 'b': 2, 'c': 3 }, { 'a': 4, 'b': 5, 'c': 6 }]\n     */\n    function matches(source) {\n      return baseMatches(baseClone(source, CLONE_DEEP_FLAG));\n    }\n\n    /**\n     * Creates a function that performs a partial deep comparison between the\n     * value at `path` of a given object to `srcValue`, returning `true` if the\n     * object value is equivalent, else `false`.\n     *\n     * **Note:** Partial comparisons will match empty array and empty object\n     * `srcValue` values against any array or object value, respectively. See\n     * `_.isEqual` for a list of supported value comparisons.\n     *\n     * **Note:** Multiple values can be checked by combining several matchers\n     * using `_.overSome`\n     *\n     * @static\n     * @memberOf _\n     * @since 3.2.0\n     * @category Util\n     * @param {Array|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     * @example\n     *\n     * var objects = [\n     *   { 'a': 1, 'b': 2, 'c': 3 },\n     *   { 'a': 4, 'b': 5, 'c': 6 }\n     * ];\n     *\n     * _.find(objects, _.matchesProperty('a', 4));\n     * // => { 'a': 4, 'b': 5, 'c': 6 }\n     *\n     * // Checking for several possible values\n     * _.filter(objects, _.overSome([_.matchesProperty('a', 1), _.matchesProperty('a', 4)]));\n     * // => [{ 'a': 1, 'b': 2, 'c': 3 }, { 'a': 4, 'b': 5, 'c': 6 }]\n     */\n    function matchesProperty(path, srcValue) {\n      return baseMatchesProperty(path, baseClone(srcValue, CLONE_DEEP_FLAG));\n    }\n\n    /**\n     * Creates a function that invokes the method at `path` of a given object.\n     * Any additional arguments are provided to the invoked method.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.7.0\n     * @category Util\n     * @param {Array|string} path The path of the method to invoke.\n     * @param {...*} [args] The arguments to invoke the method with.\n     * @returns {Function} Returns the new invoker function.\n     * @example\n     *\n     * var objects = [\n     *   { 'a': { 'b': _.constant(2) } },\n     *   { 'a': { 'b': _.constant(1) } }\n     * ];\n     *\n     * _.map(objects, _.method('a.b'));\n     * // => [2, 1]\n     *\n     * _.map(objects, _.method(['a', 'b']));\n     * // => [2, 1]\n     */\n    var method = baseRest(function(path, args) {\n      return function(object) {\n        return baseInvoke(object, path, args);\n      };\n    });\n\n    /**\n     * The opposite of `_.method`; this method creates a function that invokes\n     * the method at a given path of `object`. Any additional arguments are\n     * provided to the invoked method.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.7.0\n     * @category Util\n     * @param {Object} object The object to query.\n     * @param {...*} [args] The arguments to invoke the method with.\n     * @returns {Function} Returns the new invoker function.\n     * @example\n     *\n     * var array = _.times(3, _.constant),\n     *     object = { 'a': array, 'b': array, 'c': array };\n     *\n     * _.map(['a[2]', 'c[0]'], _.methodOf(object));\n     * // => [2, 0]\n     *\n     * _.map([['a', '2'], ['c', '0']], _.methodOf(object));\n     * // => [2, 0]\n     */\n    var methodOf = baseRest(function(object, args) {\n      return function(path) {\n        return baseInvoke(object, path, args);\n      };\n    });\n\n    /**\n     * Adds all own enumerable string keyed function properties of a source\n     * object to the destination object. If `object` is a function, then methods\n     * are added to its prototype as well.\n     *\n     * **Note:** Use `_.runInContext` to create a pristine `lodash` function to\n     * avoid conflicts caused by modifying the original.\n     *\n     * @static\n     * @since 0.1.0\n     * @memberOf _\n     * @category Util\n     * @param {Function|Object} [object=lodash] The destination object.\n     * @param {Object} source The object of functions to add.\n     * @param {Object} [options={}] The options object.\n     * @param {boolean} [options.chain=true] Specify whether mixins are chainable.\n     * @returns {Function|Object} Returns `object`.\n     * @example\n     *\n     * function vowels(string) {\n     *   return _.filter(string, function(v) {\n     *     return /[aeiou]/i.test(v);\n     *   });\n     * }\n     *\n     * _.mixin({ 'vowels': vowels });\n     * _.vowels('fred');\n     * // => ['e']\n     *\n     * _('fred').vowels().value();\n     * // => ['e']\n     *\n     * _.mixin({ 'vowels': vowels }, { 'chain': false });\n     * _('fred').vowels();\n     * // => ['e']\n     */\n    function mixin(object, source, options) {\n      var props = keys(source),\n          methodNames = baseFunctions(source, props);\n\n      if (options == null &&\n          !(isObject(source) && (methodNames.length || !props.length))) {\n        options = source;\n        source = object;\n        object = this;\n        methodNames = baseFunctions(source, keys(source));\n      }\n      var chain = !(isObject(options) && 'chain' in options) || !!options.chain,\n          isFunc = isFunction(object);\n\n      arrayEach(methodNames, function(methodName) {\n        var func = source[methodName];\n        object[methodName] = func;\n        if (isFunc) {\n          object.prototype[methodName] = function() {\n            var chainAll = this.__chain__;\n            if (chain || chainAll) {\n              var result = object(this.__wrapped__),\n                  actions = result.__actions__ = copyArray(this.__actions__);\n\n              actions.push({ 'func': func, 'args': arguments, 'thisArg': object });\n              result.__chain__ = chainAll;\n              return result;\n            }\n            return func.apply(object, arrayPush([this.value()], arguments));\n          };\n        }\n      });\n\n      return object;\n    }\n\n    /**\n     * Reverts the `_` variable to its previous value and returns a reference to\n     * the `lodash` function.\n     *\n     * @static\n     * @since 0.1.0\n     * @memberOf _\n     * @category Util\n     * @returns {Function} Returns the `lodash` function.\n     * @example\n     *\n     * var lodash = _.noConflict();\n     */\n    function noConflict() {\n      if (root._ === this) {\n        root._ = oldDash;\n      }\n      return this;\n    }\n\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     */\n    function noop() {\n      // No operation performed.\n    }\n\n    /**\n     * Creates a function that gets the argument at index `n`. If `n` is negative,\n     * the nth argument from the end is returned.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Util\n     * @param {number} [n=0] The index of the argument to return.\n     * @returns {Function} Returns the new pass-thru function.\n     * @example\n     *\n     * var func = _.nthArg(1);\n     * func('a', 'b', 'c', 'd');\n     * // => 'b'\n     *\n     * var func = _.nthArg(-2);\n     * func('a', 'b', 'c', 'd');\n     * // => 'c'\n     */\n    function nthArg(n) {\n      n = toInteger(n);\n      return baseRest(function(args) {\n        return baseNth(args, n);\n      });\n    }\n\n    /**\n     * Creates a function that invokes `iteratees` with the arguments it receives\n     * and returns their results.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Util\n     * @param {...(Function|Function[])} [iteratees=[_.identity]]\n     *  The iteratees to invoke.\n     * @returns {Function} Returns the new function.\n     * @example\n     *\n     * var func = _.over([Math.max, Math.min]);\n     *\n     * func(1, 2, 3, 4);\n     * // => [4, 1]\n     */\n    var over = createOver(arrayMap);\n\n    /**\n     * Creates a function that checks if **all** of the `predicates` return\n     * truthy when invoked with the arguments it receives.\n     *\n     * Following shorthands are possible for providing predicates.\n     * Pass an `Object` and it will be used as an parameter for `_.matches` to create the predicate.\n     * Pass an `Array` of parameters for `_.matchesProperty` and the predicate will be created using them.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Util\n     * @param {...(Function|Function[])} [predicates=[_.identity]]\n     *  The predicates to check.\n     * @returns {Function} Returns the new function.\n     * @example\n     *\n     * var func = _.overEvery([Boolean, isFinite]);\n     *\n     * func('1');\n     * // => true\n     *\n     * func(null);\n     * // => false\n     *\n     * func(NaN);\n     * // => false\n     */\n    var overEvery = createOver(arrayEvery);\n\n    /**\n     * Creates a function that checks if **any** of the `predicates` return\n     * truthy when invoked with the arguments it receives.\n     *\n     * Following shorthands are possible for providing predicates.\n     * Pass an `Object` and it will be used as an parameter for `_.matches` to create the predicate.\n     * Pass an `Array` of parameters for `_.matchesProperty` and the predicate will be created using them.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Util\n     * @param {...(Function|Function[])} [predicates=[_.identity]]\n     *  The predicates to check.\n     * @returns {Function} Returns the new function.\n     * @example\n     *\n     * var func = _.overSome([Boolean, isFinite]);\n     *\n     * func('1');\n     * // => true\n     *\n     * func(null);\n     * // => true\n     *\n     * func(NaN);\n     * // => false\n     *\n     * var matchesFunc = _.overSome([{ 'a': 1 }, { 'a': 2 }])\n     * var matchesPropertyFunc = _.overSome([['a', 1], ['a', 2]])\n     */\n    var overSome = createOver(arraySome);\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     */\n    function property(path) {\n      return isKey(path) ? baseProperty(toKey(path)) : basePropertyDeep(path);\n    }\n\n    /**\n     * The opposite of `_.property`; this method creates a function that returns\n     * the value at a given path of `object`.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category Util\n     * @param {Object} object The object to query.\n     * @returns {Function} Returns the new accessor function.\n     * @example\n     *\n     * var array = [0, 1, 2],\n     *     object = { 'a': array, 'b': array, 'c': array };\n     *\n     * _.map(['a[2]', 'c[0]'], _.propertyOf(object));\n     * // => [2, 0]\n     *\n     * _.map([['a', '2'], ['c', '0']], _.propertyOf(object));\n     * // => [2, 0]\n     */\n    function propertyOf(object) {\n      return function(path) {\n        return object == null ? undefined : baseGet(object, path);\n      };\n    }\n\n    /**\n     * Creates an array of numbers (positive and/or negative) progressing from\n     * `start` up to, but not including, `end`. A step of `-1` is used if a negative\n     * `start` is specified without an `end` or `step`. If `end` is not specified,\n     * it's set to `start` with `start` then set to `0`.\n     *\n     * **Note:** JavaScript follows the IEEE-754 standard for resolving\n     * floating-point values which can produce unexpected results.\n     *\n     * @static\n     * @since 0.1.0\n     * @memberOf _\n     * @category Util\n     * @param {number} [start=0] The start of the range.\n     * @param {number} end The end of the range.\n     * @param {number} [step=1] The value to increment or decrement by.\n     * @returns {Array} Returns the range of numbers.\n     * @see _.inRange, _.rangeRight\n     * @example\n     *\n     * _.range(4);\n     * // => [0, 1, 2, 3]\n     *\n     * _.range(-4);\n     * // => [0, -1, -2, -3]\n     *\n     * _.range(1, 5);\n     * // => [1, 2, 3, 4]\n     *\n     * _.range(0, 20, 5);\n     * // => [0, 5, 10, 15]\n     *\n     * _.range(0, -4, -1);\n     * // => [0, -1, -2, -3]\n     *\n     * _.range(1, 4, 0);\n     * // => [1, 1, 1]\n     *\n     * _.range(0);\n     * // => []\n     */\n    var range = createRange();\n\n    /**\n     * This method is like `_.range` except that it populates values in\n     * descending order.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Util\n     * @param {number} [start=0] The start of the range.\n     * @param {number} end The end of the range.\n     * @param {number} [step=1] The value to increment or decrement by.\n     * @returns {Array} Returns the range of numbers.\n     * @see _.inRange, _.range\n     * @example\n     *\n     * _.rangeRight(4);\n     * // => [3, 2, 1, 0]\n     *\n     * _.rangeRight(-4);\n     * // => [-3, -2, -1, 0]\n     *\n     * _.rangeRight(1, 5);\n     * // => [4, 3, 2, 1]\n     *\n     * _.rangeRight(0, 20, 5);\n     * // => [15, 10, 5, 0]\n     *\n     * _.rangeRight(0, -4, -1);\n     * // => [-3, -2, -1, 0]\n     *\n     * _.rangeRight(1, 4, 0);\n     * // => [1, 1, 1]\n     *\n     * _.rangeRight(0);\n     * // => []\n     */\n    var rangeRight = createRange(true);\n\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     */\n    function stubArray() {\n      return [];\n    }\n\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     */\n    function stubFalse() {\n      return false;\n    }\n\n    /**\n     * This method returns a new empty object.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.13.0\n     * @category Util\n     * @returns {Object} Returns the new empty object.\n     * @example\n     *\n     * var objects = _.times(2, _.stubObject);\n     *\n     * console.log(objects);\n     * // => [{}, {}]\n     *\n     * console.log(objects[0] === objects[1]);\n     * // => false\n     */\n    function stubObject() {\n      return {};\n    }\n\n    /**\n     * This method returns an empty string.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.13.0\n     * @category Util\n     * @returns {string} Returns the empty string.\n     * @example\n     *\n     * _.times(2, _.stubString);\n     * // => ['', '']\n     */\n    function stubString() {\n      return '';\n    }\n\n    /**\n     * This method returns `true`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.13.0\n     * @category Util\n     * @returns {boolean} Returns `true`.\n     * @example\n     *\n     * _.times(2, _.stubTrue);\n     * // => [true, true]\n     */\n    function stubTrue() {\n      return true;\n    }\n\n    /**\n     * Invokes the iteratee `n` times, returning an array of the results of\n     * each invocation. The iteratee is invoked with one argument; (index).\n     *\n     * @static\n     * @since 0.1.0\n     * @memberOf _\n     * @category Util\n     * @param {number} n The number of times to invoke `iteratee`.\n     * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n     * @returns {Array} Returns the array of results.\n     * @example\n     *\n     * _.times(3, String);\n     * // => ['0', '1', '2']\n     *\n     *  _.times(4, _.constant(0));\n     * // => [0, 0, 0, 0]\n     */\n    function times(n, iteratee) {\n      n = toInteger(n);\n      if (n < 1 || n > MAX_SAFE_INTEGER) {\n        return [];\n      }\n      var index = MAX_ARRAY_LENGTH,\n          length = nativeMin(n, MAX_ARRAY_LENGTH);\n\n      iteratee = getIteratee(iteratee);\n      n -= MAX_ARRAY_LENGTH;\n\n      var result = baseTimes(length, iteratee);\n      while (++index < n) {\n        iteratee(index);\n      }\n      return result;\n    }\n\n    /**\n     * Converts `value` to a property path array.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Util\n     * @param {*} value The value to convert.\n     * @returns {Array} Returns the new property path array.\n     * @example\n     *\n     * _.toPath('a.b.c');\n     * // => ['a', 'b', 'c']\n     *\n     * _.toPath('a[0].b.c');\n     * // => ['a', '0', 'b', 'c']\n     */\n    function toPath(value) {\n      if (isArray(value)) {\n        return arrayMap(value, toKey);\n      }\n      return isSymbol(value) ? [value] : copyArray(stringToPath(toString(value)));\n    }\n\n    /**\n     * Generates a unique ID. If `prefix` is given, the ID is appended to it.\n     *\n     * @static\n     * @since 0.1.0\n     * @memberOf _\n     * @category Util\n     * @param {string} [prefix=''] The value to prefix the ID with.\n     * @returns {string} Returns the unique ID.\n     * @example\n     *\n     * _.uniqueId('contact_');\n     * // => 'contact_104'\n     *\n     * _.uniqueId();\n     * // => '105'\n     */\n    function uniqueId(prefix) {\n      var id = ++idCounter;\n      return toString(prefix) + id;\n    }\n\n    /*------------------------------------------------------------------------*/\n\n    /**\n     * Adds two numbers.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.4.0\n     * @category Math\n     * @param {number} augend The first number in an addition.\n     * @param {number} addend The second number in an addition.\n     * @returns {number} Returns the total.\n     * @example\n     *\n     * _.add(6, 4);\n     * // => 10\n     */\n    var add = createMathOperation(function(augend, addend) {\n      return augend + addend;\n    }, 0);\n\n    /**\n     * Computes `number` rounded up to `precision`.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.10.0\n     * @category Math\n     * @param {number} number The number to round up.\n     * @param {number} [precision=0] The precision to round up to.\n     * @returns {number} Returns the rounded up number.\n     * @example\n     *\n     * _.ceil(4.006);\n     * // => 5\n     *\n     * _.ceil(6.004, 2);\n     * // => 6.01\n     *\n     * _.ceil(6040, -2);\n     * // => 6100\n     */\n    var ceil = createRound('ceil');\n\n    /**\n     * Divide two numbers.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.7.0\n     * @category Math\n     * @param {number} dividend The first number in a division.\n     * @param {number} divisor The second number in a division.\n     * @returns {number} Returns the quotient.\n     * @example\n     *\n     * _.divide(6, 4);\n     * // => 1.5\n     */\n    var divide = createMathOperation(function(dividend, divisor) {\n      return dividend / divisor;\n    }, 1);\n\n    /**\n     * Computes `number` rounded down to `precision`.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.10.0\n     * @category Math\n     * @param {number} number The number to round down.\n     * @param {number} [precision=0] The precision to round down to.\n     * @returns {number} Returns the rounded down number.\n     * @example\n     *\n     * _.floor(4.006);\n     * // => 4\n     *\n     * _.floor(0.046, 2);\n     * // => 0.04\n     *\n     * _.floor(4060, -2);\n     * // => 4000\n     */\n    var floor = createRound('floor');\n\n    /**\n     * Computes the maximum value of `array`. If `array` is empty or falsey,\n     * `undefined` is returned.\n     *\n     * @static\n     * @since 0.1.0\n     * @memberOf _\n     * @category Math\n     * @param {Array} array The array to iterate over.\n     * @returns {*} Returns the maximum value.\n     * @example\n     *\n     * _.max([4, 2, 8, 6]);\n     * // => 8\n     *\n     * _.max([]);\n     * // => undefined\n     */\n    function max(array) {\n      return (array && array.length)\n        ? baseExtremum(array, identity, baseGt)\n        : undefined;\n    }\n\n    /**\n     * This method is like `_.max` except that it accepts `iteratee` which is\n     * invoked for each element in `array` to generate the criterion by which\n     * the value is ranked. The iteratee is invoked with one argument: (value).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Math\n     * @param {Array} array The array to iterate over.\n     * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n     * @returns {*} Returns the maximum value.\n     * @example\n     *\n     * var objects = [{ 'n': 1 }, { 'n': 2 }];\n     *\n     * _.maxBy(objects, function(o) { return o.n; });\n     * // => { 'n': 2 }\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.maxBy(objects, 'n');\n     * // => { 'n': 2 }\n     */\n    function maxBy(array, iteratee) {\n      return (array && array.length)\n        ? baseExtremum(array, getIteratee(iteratee, 2), baseGt)\n        : undefined;\n    }\n\n    /**\n     * Computes the mean of the values in `array`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Math\n     * @param {Array} array The array to iterate over.\n     * @returns {number} Returns the mean.\n     * @example\n     *\n     * _.mean([4, 2, 8, 6]);\n     * // => 5\n     */\n    function mean(array) {\n      return baseMean(array, identity);\n    }\n\n    /**\n     * This method is like `_.mean` except that it accepts `iteratee` which is\n     * invoked for each element in `array` to generate the value to be averaged.\n     * The iteratee is invoked with one argument: (value).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.7.0\n     * @category Math\n     * @param {Array} array The array to iterate over.\n     * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n     * @returns {number} Returns the mean.\n     * @example\n     *\n     * var objects = [{ 'n': 4 }, { 'n': 2 }, { 'n': 8 }, { 'n': 6 }];\n     *\n     * _.meanBy(objects, function(o) { return o.n; });\n     * // => 5\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.meanBy(objects, 'n');\n     * // => 5\n     */\n    function meanBy(array, iteratee) {\n      return baseMean(array, getIteratee(iteratee, 2));\n    }\n\n    /**\n     * Computes the minimum value of `array`. If `array` is empty or falsey,\n     * `undefined` is returned.\n     *\n     * @static\n     * @since 0.1.0\n     * @memberOf _\n     * @category Math\n     * @param {Array} array The array to iterate over.\n     * @returns {*} Returns the minimum value.\n     * @example\n     *\n     * _.min([4, 2, 8, 6]);\n     * // => 2\n     *\n     * _.min([]);\n     * // => undefined\n     */\n    function min(array) {\n      return (array && array.length)\n        ? baseExtremum(array, identity, baseLt)\n        : undefined;\n    }\n\n    /**\n     * This method is like `_.min` except that it accepts `iteratee` which is\n     * invoked for each element in `array` to generate the criterion by which\n     * the value is ranked. The iteratee is invoked with one argument: (value).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Math\n     * @param {Array} array The array to iterate over.\n     * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n     * @returns {*} Returns the minimum value.\n     * @example\n     *\n     * var objects = [{ 'n': 1 }, { 'n': 2 }];\n     *\n     * _.minBy(objects, function(o) { return o.n; });\n     * // => { 'n': 1 }\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.minBy(objects, 'n');\n     * // => { 'n': 1 }\n     */\n    function minBy(array, iteratee) {\n      return (array && array.length)\n        ? baseExtremum(array, getIteratee(iteratee, 2), baseLt)\n        : undefined;\n    }\n\n    /**\n     * Multiply two numbers.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.7.0\n     * @category Math\n     * @param {number} multiplier The first number in a multiplication.\n     * @param {number} multiplicand The second number in a multiplication.\n     * @returns {number} Returns the product.\n     * @example\n     *\n     * _.multiply(6, 4);\n     * // => 24\n     */\n    var multiply = createMathOperation(function(multiplier, multiplicand) {\n      return multiplier * multiplicand;\n    }, 1);\n\n    /**\n     * Computes `number` rounded to `precision`.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.10.0\n     * @category Math\n     * @param {number} number The number to round.\n     * @param {number} [precision=0] The precision to round to.\n     * @returns {number} Returns the rounded number.\n     * @example\n     *\n     * _.round(4.006);\n     * // => 4\n     *\n     * _.round(4.006, 2);\n     * // => 4.01\n     *\n     * _.round(4060, -2);\n     * // => 4100\n     */\n    var round = createRound('round');\n\n    /**\n     * Subtract two numbers.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Math\n     * @param {number} minuend The first number in a subtraction.\n     * @param {number} subtrahend The second number in a subtraction.\n     * @returns {number} Returns the difference.\n     * @example\n     *\n     * _.subtract(6, 4);\n     * // => 2\n     */\n    var subtract = createMathOperation(function(minuend, subtrahend) {\n      return minuend - subtrahend;\n    }, 0);\n\n    /**\n     * Computes the sum of the values in `array`.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.4.0\n     * @category Math\n     * @param {Array} array The array to iterate over.\n     * @returns {number} Returns the sum.\n     * @example\n     *\n     * _.sum([4, 2, 8, 6]);\n     * // => 20\n     */\n    function sum(array) {\n      return (array && array.length)\n        ? baseSum(array, identity)\n        : 0;\n    }\n\n    /**\n     * This method is like `_.sum` except that it accepts `iteratee` which is\n     * invoked for each element in `array` to generate the value to be summed.\n     * The iteratee is invoked with one argument: (value).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Math\n     * @param {Array} array The array to iterate over.\n     * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n     * @returns {number} Returns the sum.\n     * @example\n     *\n     * var objects = [{ 'n': 4 }, { 'n': 2 }, { 'n': 8 }, { 'n': 6 }];\n     *\n     * _.sumBy(objects, function(o) { return o.n; });\n     * // => 20\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.sumBy(objects, 'n');\n     * // => 20\n     */\n    function sumBy(array, iteratee) {\n      return (array && array.length)\n        ? baseSum(array, getIteratee(iteratee, 2))\n        : 0;\n    }\n\n    /*------------------------------------------------------------------------*/\n\n    // Add methods that return wrapped values in chain sequences.\n    lodash.after = after;\n    lodash.ary = ary;\n    lodash.assign = assign;\n    lodash.assignIn = assignIn;\n    lodash.assignInWith = assignInWith;\n    lodash.assignWith = assignWith;\n    lodash.at = at;\n    lodash.before = before;\n    lodash.bind = bind;\n    lodash.bindAll = bindAll;\n    lodash.bindKey = bindKey;\n    lodash.castArray = castArray;\n    lodash.chain = chain;\n    lodash.chunk = chunk;\n    lodash.compact = compact;\n    lodash.concat = concat;\n    lodash.cond = cond;\n    lodash.conforms = conforms;\n    lodash.constant = constant;\n    lodash.countBy = countBy;\n    lodash.create = create;\n    lodash.curry = curry;\n    lodash.curryRight = curryRight;\n    lodash.debounce = debounce;\n    lodash.defaults = defaults;\n    lodash.defaultsDeep = defaultsDeep;\n    lodash.defer = defer;\n    lodash.delay = delay;\n    lodash.difference = difference;\n    lodash.differenceBy = differenceBy;\n    lodash.differenceWith = differenceWith;\n    lodash.drop = drop;\n    lodash.dropRight = dropRight;\n    lodash.dropRightWhile = dropRightWhile;\n    lodash.dropWhile = dropWhile;\n    lodash.fill = fill;\n    lodash.filter = filter;\n    lodash.flatMap = flatMap;\n    lodash.flatMapDeep = flatMapDeep;\n    lodash.flatMapDepth = flatMapDepth;\n    lodash.flatten = flatten;\n    lodash.flattenDeep = flattenDeep;\n    lodash.flattenDepth = flattenDepth;\n    lodash.flip = flip;\n    lodash.flow = flow;\n    lodash.flowRight = flowRight;\n    lodash.fromPairs = fromPairs;\n    lodash.functions = functions;\n    lodash.functionsIn = functionsIn;\n    lodash.groupBy = groupBy;\n    lodash.initial = initial;\n    lodash.intersection = intersection;\n    lodash.intersectionBy = intersectionBy;\n    lodash.intersectionWith = intersectionWith;\n    lodash.invert = invert;\n    lodash.invertBy = invertBy;\n    lodash.invokeMap = invokeMap;\n    lodash.iteratee = iteratee;\n    lodash.keyBy = keyBy;\n    lodash.keys = keys;\n    lodash.keysIn = keysIn;\n    lodash.map = map;\n    lodash.mapKeys = mapKeys;\n    lodash.mapValues = mapValues;\n    lodash.matches = matches;\n    lodash.matchesProperty = matchesProperty;\n    lodash.memoize = memoize;\n    lodash.merge = merge;\n    lodash.mergeWith = mergeWith;\n    lodash.method = method;\n    lodash.methodOf = methodOf;\n    lodash.mixin = mixin;\n    lodash.negate = negate;\n    lodash.nthArg = nthArg;\n    lodash.omit = omit;\n    lodash.omitBy = omitBy;\n    lodash.once = once;\n    lodash.orderBy = orderBy;\n    lodash.over = over;\n    lodash.overArgs = overArgs;\n    lodash.overEvery = overEvery;\n    lodash.overSome = overSome;\n    lodash.partial = partial;\n    lodash.partialRight = partialRight;\n    lodash.partition = partition;\n    lodash.pick = pick;\n    lodash.pickBy = pickBy;\n    lodash.property = property;\n    lodash.propertyOf = propertyOf;\n    lodash.pull = pull;\n    lodash.pullAll = pullAll;\n    lodash.pullAllBy = pullAllBy;\n    lodash.pullAllWith = pullAllWith;\n    lodash.pullAt = pullAt;\n    lodash.range = range;\n    lodash.rangeRight = rangeRight;\n    lodash.rearg = rearg;\n    lodash.reject = reject;\n    lodash.remove = remove;\n    lodash.rest = rest;\n    lodash.reverse = reverse;\n    lodash.sampleSize = sampleSize;\n    lodash.set = set;\n    lodash.setWith = setWith;\n    lodash.shuffle = shuffle;\n    lodash.slice = slice;\n    lodash.sortBy = sortBy;\n    lodash.sortedUniq = sortedUniq;\n    lodash.sortedUniqBy = sortedUniqBy;\n    lodash.split = split;\n    lodash.spread = spread;\n    lodash.tail = tail;\n    lodash.take = take;\n    lodash.takeRight = takeRight;\n    lodash.takeRightWhile = takeRightWhile;\n    lodash.takeWhile = takeWhile;\n    lodash.tap = tap;\n    lodash.throttle = throttle;\n    lodash.thru = thru;\n    lodash.toArray = toArray;\n    lodash.toPairs = toPairs;\n    lodash.toPairsIn = toPairsIn;\n    lodash.toPath = toPath;\n    lodash.toPlainObject = toPlainObject;\n    lodash.transform = transform;\n    lodash.unary = unary;\n    lodash.union = union;\n    lodash.unionBy = unionBy;\n    lodash.unionWith = unionWith;\n    lodash.uniq = uniq;\n    lodash.uniqBy = uniqBy;\n    lodash.uniqWith = uniqWith;\n    lodash.unset = unset;\n    lodash.unzip = unzip;\n    lodash.unzipWith = unzipWith;\n    lodash.update = update;\n    lodash.updateWith = updateWith;\n    lodash.values = values;\n    lodash.valuesIn = valuesIn;\n    lodash.without = without;\n    lodash.words = words;\n    lodash.wrap = wrap;\n    lodash.xor = xor;\n    lodash.xorBy = xorBy;\n    lodash.xorWith = xorWith;\n    lodash.zip = zip;\n    lodash.zipObject = zipObject;\n    lodash.zipObjectDeep = zipObjectDeep;\n    lodash.zipWith = zipWith;\n\n    // Add aliases.\n    lodash.entries = toPairs;\n    lodash.entriesIn = toPairsIn;\n    lodash.extend = assignIn;\n    lodash.extendWith = assignInWith;\n\n    // Add methods to `lodash.prototype`.\n    mixin(lodash, lodash);\n\n    /*------------------------------------------------------------------------*/\n\n    // Add methods that return unwrapped values in chain sequences.\n    lodash.add = add;\n    lodash.attempt = attempt;\n    lodash.camelCase = camelCase;\n    lodash.capitalize = capitalize;\n    lodash.ceil = ceil;\n    lodash.clamp = clamp;\n    lodash.clone = clone;\n    lodash.cloneDeep = cloneDeep;\n    lodash.cloneDeepWith = cloneDeepWith;\n    lodash.cloneWith = cloneWith;\n    lodash.conformsTo = conformsTo;\n    lodash.deburr = deburr;\n    lodash.defaultTo = defaultTo;\n    lodash.divide = divide;\n    lodash.endsWith = endsWith;\n    lodash.eq = eq;\n    lodash.escape = escape;\n    lodash.escapeRegExp = escapeRegExp;\n    lodash.every = every;\n    lodash.find = find;\n    lodash.findIndex = findIndex;\n    lodash.findKey = findKey;\n    lodash.findLast = findLast;\n    lodash.findLastIndex = findLastIndex;\n    lodash.findLastKey = findLastKey;\n    lodash.floor = floor;\n    lodash.forEach = forEach;\n    lodash.forEachRight = forEachRight;\n    lodash.forIn = forIn;\n    lodash.forInRight = forInRight;\n    lodash.forOwn = forOwn;\n    lodash.forOwnRight = forOwnRight;\n    lodash.get = get;\n    lodash.gt = gt;\n    lodash.gte = gte;\n    lodash.has = has;\n    lodash.hasIn = hasIn;\n    lodash.head = head;\n    lodash.identity = identity;\n    lodash.includes = includes;\n    lodash.indexOf = indexOf;\n    lodash.inRange = inRange;\n    lodash.invoke = invoke;\n    lodash.isArguments = isArguments;\n    lodash.isArray = isArray;\n    lodash.isArrayBuffer = isArrayBuffer;\n    lodash.isArrayLike = isArrayLike;\n    lodash.isArrayLikeObject = isArrayLikeObject;\n    lodash.isBoolean = isBoolean;\n    lodash.isBuffer = isBuffer;\n    lodash.isDate = isDate;\n    lodash.isElement = isElement;\n    lodash.isEmpty = isEmpty;\n    lodash.isEqual = isEqual;\n    lodash.isEqualWith = isEqualWith;\n    lodash.isError = isError;\n    lodash.isFinite = isFinite;\n    lodash.isFunction = isFunction;\n    lodash.isInteger = isInteger;\n    lodash.isLength = isLength;\n    lodash.isMap = isMap;\n    lodash.isMatch = isMatch;\n    lodash.isMatchWith = isMatchWith;\n    lodash.isNaN = isNaN;\n    lodash.isNative = isNative;\n    lodash.isNil = isNil;\n    lodash.isNull = isNull;\n    lodash.isNumber = isNumber;\n    lodash.isObject = isObject;\n    lodash.isObjectLike = isObjectLike;\n    lodash.isPlainObject = isPlainObject;\n    lodash.isRegExp = isRegExp;\n    lodash.isSafeInteger = isSafeInteger;\n    lodash.isSet = isSet;\n    lodash.isString = isString;\n    lodash.isSymbol = isSymbol;\n    lodash.isTypedArray = isTypedArray;\n    lodash.isUndefined = isUndefined;\n    lodash.isWeakMap = isWeakMap;\n    lodash.isWeakSet = isWeakSet;\n    lodash.join = join;\n    lodash.kebabCase = kebabCase;\n    lodash.last = last;\n    lodash.lastIndexOf = lastIndexOf;\n    lodash.lowerCase = lowerCase;\n    lodash.lowerFirst = lowerFirst;\n    lodash.lt = lt;\n    lodash.lte = lte;\n    lodash.max = max;\n    lodash.maxBy = maxBy;\n    lodash.mean = mean;\n    lodash.meanBy = meanBy;\n    lodash.min = min;\n    lodash.minBy = minBy;\n    lodash.stubArray = stubArray;\n    lodash.stubFalse = stubFalse;\n    lodash.stubObject = stubObject;\n    lodash.stubString = stubString;\n    lodash.stubTrue = stubTrue;\n    lodash.multiply = multiply;\n    lodash.nth = nth;\n    lodash.noConflict = noConflict;\n    lodash.noop = noop;\n    lodash.now = now;\n    lodash.pad = pad;\n    lodash.padEnd = padEnd;\n    lodash.padStart = padStart;\n    lodash.parseInt = parseInt;\n    lodash.random = random;\n    lodash.reduce = reduce;\n    lodash.reduceRight = reduceRight;\n    lodash.repeat = repeat;\n    lodash.replace = replace;\n    lodash.result = result;\n    lodash.round = round;\n    lodash.runInContext = runInContext;\n    lodash.sample = sample;\n    lodash.size = size;\n    lodash.snakeCase = snakeCase;\n    lodash.some = some;\n    lodash.sortedIndex = sortedIndex;\n    lodash.sortedIndexBy = sortedIndexBy;\n    lodash.sortedIndexOf = sortedIndexOf;\n    lodash.sortedLastIndex = sortedLastIndex;\n    lodash.sortedLastIndexBy = sortedLastIndexBy;\n    lodash.sortedLastIndexOf = sortedLastIndexOf;\n    lodash.startCase = startCase;\n    lodash.startsWith = startsWith;\n    lodash.subtract = subtract;\n    lodash.sum = sum;\n    lodash.sumBy = sumBy;\n    lodash.template = template;\n    lodash.times = times;\n    lodash.toFinite = toFinite;\n    lodash.toInteger = toInteger;\n    lodash.toLength = toLength;\n    lodash.toLower = toLower;\n    lodash.toNumber = toNumber;\n    lodash.toSafeInteger = toSafeInteger;\n    lodash.toString = toString;\n    lodash.toUpper = toUpper;\n    lodash.trim = trim;\n    lodash.trimEnd = trimEnd;\n    lodash.trimStart = trimStart;\n    lodash.truncate = truncate;\n    lodash.unescape = unescape;\n    lodash.uniqueId = uniqueId;\n    lodash.upperCase = upperCase;\n    lodash.upperFirst = upperFirst;\n\n    // Add aliases.\n    lodash.each = forEach;\n    lodash.eachRight = forEachRight;\n    lodash.first = head;\n\n    mixin(lodash, (function() {\n      var source = {};\n      baseForOwn(lodash, function(func, methodName) {\n        if (!hasOwnProperty.call(lodash.prototype, methodName)) {\n          source[methodName] = func;\n        }\n      });\n      return source;\n    }()), { 'chain': false });\n\n    /*------------------------------------------------------------------------*/\n\n    /**\n     * The semantic version number.\n     *\n     * @static\n     * @memberOf _\n     * @type {string}\n     */\n    lodash.VERSION = VERSION;\n\n    // Assign default placeholders.\n    arrayEach(['bind', 'bindKey', 'curry', 'curryRight', 'partial', 'partialRight'], function(methodName) {\n      lodash[methodName].placeholder = lodash;\n    });\n\n    // Add `LazyWrapper` methods for `_.drop` and `_.take` variants.\n    arrayEach(['drop', 'take'], function(methodName, index) {\n      LazyWrapper.prototype[methodName] = function(n) {\n        n = n === undefined ? 1 : nativeMax(toInteger(n), 0);\n\n        var result = (this.__filtered__ && !index)\n          ? new LazyWrapper(this)\n          : this.clone();\n\n        if (result.__filtered__) {\n          result.__takeCount__ = nativeMin(n, result.__takeCount__);\n        } else {\n          result.__views__.push({\n            'size': nativeMin(n, MAX_ARRAY_LENGTH),\n            'type': methodName + (result.__dir__ < 0 ? 'Right' : '')\n          });\n        }\n        return result;\n      };\n\n      LazyWrapper.prototype[methodName + 'Right'] = function(n) {\n        return this.reverse()[methodName](n).reverse();\n      };\n    });\n\n    // Add `LazyWrapper` methods that accept an `iteratee` value.\n    arrayEach(['filter', 'map', 'takeWhile'], function(methodName, index) {\n      var type = index + 1,\n          isFilter = type == LAZY_FILTER_FLAG || type == LAZY_WHILE_FLAG;\n\n      LazyWrapper.prototype[methodName] = function(iteratee) {\n        var result = this.clone();\n        result.__iteratees__.push({\n          'iteratee': getIteratee(iteratee, 3),\n          'type': type\n        });\n        result.__filtered__ = result.__filtered__ || isFilter;\n        return result;\n      };\n    });\n\n    // Add `LazyWrapper` methods for `_.head` and `_.last`.\n    arrayEach(['head', 'last'], function(methodName, index) {\n      var takeName = 'take' + (index ? 'Right' : '');\n\n      LazyWrapper.prototype[methodName] = function() {\n        return this[takeName](1).value()[0];\n      };\n    });\n\n    // Add `LazyWrapper` methods for `_.initial` and `_.tail`.\n    arrayEach(['initial', 'tail'], function(methodName, index) {\n      var dropName = 'drop' + (index ? '' : 'Right');\n\n      LazyWrapper.prototype[methodName] = function() {\n        return this.__filtered__ ? new LazyWrapper(this) : this[dropName](1);\n      };\n    });\n\n    LazyWrapper.prototype.compact = function() {\n      return this.filter(identity);\n    };\n\n    LazyWrapper.prototype.find = function(predicate) {\n      return this.filter(predicate).head();\n    };\n\n    LazyWrapper.prototype.findLast = function(predicate) {\n      return this.reverse().find(predicate);\n    };\n\n    LazyWrapper.prototype.invokeMap = baseRest(function(path, args) {\n      if (typeof path == 'function') {\n        return new LazyWrapper(this);\n      }\n      return this.map(function(value) {\n        return baseInvoke(value, path, args);\n      });\n    });\n\n    LazyWrapper.prototype.reject = function(predicate) {\n      return this.filter(negate(getIteratee(predicate)));\n    };\n\n    LazyWrapper.prototype.slice = function(start, end) {\n      start = toInteger(start);\n\n      var result = this;\n      if (result.__filtered__ && (start > 0 || end < 0)) {\n        return new LazyWrapper(result);\n      }\n      if (start < 0) {\n        result = result.takeRight(-start);\n      } else if (start) {\n        result = result.drop(start);\n      }\n      if (end !== undefined) {\n        end = toInteger(end);\n        result = end < 0 ? result.dropRight(-end) : result.take(end - start);\n      }\n      return result;\n    };\n\n    LazyWrapper.prototype.takeRightWhile = function(predicate) {\n      return this.reverse().takeWhile(predicate).reverse();\n    };\n\n    LazyWrapper.prototype.toArray = function() {\n      return this.take(MAX_ARRAY_LENGTH);\n    };\n\n    // Add `LazyWrapper` methods to `lodash.prototype`.\n    baseForOwn(LazyWrapper.prototype, function(func, methodName) {\n      var checkIteratee = /^(?:filter|find|map|reject)|While$/.test(methodName),\n          isTaker = /^(?:head|last)$/.test(methodName),\n          lodashFunc = lodash[isTaker ? ('take' + (methodName == 'last' ? 'Right' : '')) : methodName],\n          retUnwrapped = isTaker || /^find/.test(methodName);\n\n      if (!lodashFunc) {\n        return;\n      }\n      lodash.prototype[methodName] = function() {\n        var value = this.__wrapped__,\n            args = isTaker ? [1] : arguments,\n            isLazy = value instanceof LazyWrapper,\n            iteratee = args[0],\n            useLazy = isLazy || isArray(value);\n\n        var interceptor = function(value) {\n          var result = lodashFunc.apply(lodash, arrayPush([value], args));\n          return (isTaker && chainAll) ? result[0] : result;\n        };\n\n        if (useLazy && checkIteratee && typeof iteratee == 'function' && iteratee.length != 1) {\n          // Avoid lazy use if the iteratee has a \"length\" value other than `1`.\n          isLazy = useLazy = false;\n        }\n        var chainAll = this.__chain__,\n            isHybrid = !!this.__actions__.length,\n            isUnwrapped = retUnwrapped && !chainAll,\n            onlyLazy = isLazy && !isHybrid;\n\n        if (!retUnwrapped && useLazy) {\n          value = onlyLazy ? value : new LazyWrapper(this);\n          var result = func.apply(value, args);\n          result.__actions__.push({ 'func': thru, 'args': [interceptor], 'thisArg': undefined });\n          return new LodashWrapper(result, chainAll);\n        }\n        if (isUnwrapped && onlyLazy) {\n          return func.apply(this, args);\n        }\n        result = this.thru(interceptor);\n        return isUnwrapped ? (isTaker ? result.value()[0] : result.value()) : result;\n      };\n    });\n\n    // Add `Array` methods to `lodash.prototype`.\n    arrayEach(['pop', 'push', 'shift', 'sort', 'splice', 'unshift'], function(methodName) {\n      var func = arrayProto[methodName],\n          chainName = /^(?:push|sort|unshift)$/.test(methodName) ? 'tap' : 'thru',\n          retUnwrapped = /^(?:pop|shift)$/.test(methodName);\n\n      lodash.prototype[methodName] = function() {\n        var args = arguments;\n        if (retUnwrapped && !this.__chain__) {\n          var value = this.value();\n          return func.apply(isArray(value) ? value : [], args);\n        }\n        return this[chainName](function(value) {\n          return func.apply(isArray(value) ? value : [], args);\n        });\n      };\n    });\n\n    // Map minified method names to their real names.\n    baseForOwn(LazyWrapper.prototype, function(func, methodName) {\n      var lodashFunc = lodash[methodName];\n      if (lodashFunc) {\n        var key = lodashFunc.name + '';\n        if (!hasOwnProperty.call(realNames, key)) {\n          realNames[key] = [];\n        }\n        realNames[key].push({ 'name': methodName, 'func': lodashFunc });\n      }\n    });\n\n    realNames[createHybrid(undefined, WRAP_BIND_KEY_FLAG).name] = [{\n      'name': 'wrapper',\n      'func': undefined\n    }];\n\n    // Add methods to `LazyWrapper`.\n    LazyWrapper.prototype.clone = lazyClone;\n    LazyWrapper.prototype.reverse = lazyReverse;\n    LazyWrapper.prototype.value = lazyValue;\n\n    // Add chain sequence methods to the `lodash` wrapper.\n    lodash.prototype.at = wrapperAt;\n    lodash.prototype.chain = wrapperChain;\n    lodash.prototype.commit = wrapperCommit;\n    lodash.prototype.next = wrapperNext;\n    lodash.prototype.plant = wrapperPlant;\n    lodash.prototype.reverse = wrapperReverse;\n    lodash.prototype.toJSON = lodash.prototype.valueOf = lodash.prototype.value = wrapperValue;\n\n    // Add lazy aliases.\n    lodash.prototype.first = lodash.prototype.head;\n\n    if (symIterator) {\n      lodash.prototype[symIterator] = wrapperToIterator;\n    }\n    return lodash;\n  });\n\n  /*--------------------------------------------------------------------------*/\n\n  // Export lodash.\n  var _ = runInContext();\n\n  // Some AMD build optimizers, like r.js, check for condition patterns like:\n  if (typeof define == 'function' && typeof define.amd == 'object' && define.amd) {\n    // Expose Lodash on the global object to prevent errors when Lodash is\n    // loaded by a script tag in the presence of an AMD loader.\n    // See http://requirejs.org/docs/errors.html#mismatch for more details.\n    // Use `_.noConflict` to remove Lodash from the global object.\n    root._ = _;\n\n    // Define as an anonymous module so, through path mapping, it can be\n    // referenced as the \"underscore\" module.\n    define(function() {\n      return _;\n    });\n  }\n  // Check for `exports` after `define` in case a build optimizer adds it.\n  else if (freeModule) {\n    // Export for Node.js.\n    (freeModule.exports = _)._ = _;\n    // Export for CommonJS support.\n    freeExports._ = _;\n  }\n  else {\n    // Export to the global object.\n    root._ = _;\n  }\n}.call(this));\n","var arrayMap = require('./_arrayMap'),\n    baseIteratee = require('./_baseIteratee'),\n    baseMap = require('./_baseMap'),\n    isArray = require('./isArray');\n\n/**\n * Creates an array of values by running each element in `collection` thru\n * `iteratee`. The iteratee is invoked with three arguments:\n * (value, index|key, collection).\n *\n * Many lodash methods are guarded to work as iteratees for methods like\n * `_.every`, `_.filter`, `_.map`, `_.mapValues`, `_.reject`, and `_.some`.\n *\n * The guarded methods are:\n * `ary`, `chunk`, `curry`, `curryRight`, `drop`, `dropRight`, `every`,\n * `fill`, `invert`, `parseInt`, `random`, `range`, `rangeRight`, `repeat`,\n * `sampleSize`, `slice`, `some`, `sortBy`, `split`, `take`, `takeRight`,\n * `template`, `trim`, `trimEnd`, `trimStart`, and `words`\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @returns {Array} Returns the new mapped array.\n * @example\n *\n * function square(n) {\n *   return n * n;\n * }\n *\n * _.map([4, 8], square);\n * // => [16, 64]\n *\n * _.map({ 'a': 4, 'b': 8 }, square);\n * // => [16, 64] (iteration order is not guaranteed)\n *\n * var users = [\n *   { 'user': 'barney' },\n *   { 'user': 'fred' }\n * ];\n *\n * // The `_.property` iteratee shorthand.\n * _.map(users, 'user');\n * // => ['barney', 'fred']\n */\nfunction map(collection, iteratee) {\n  var func = isArray(collection) ? arrayMap : baseMap;\n  return func(collection, baseIteratee(iteratee, 3));\n}\n\nmodule.exports = map;\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","var baseMerge = require('./_baseMerge'),\n    createAssigner = require('./_createAssigner');\n\n/**\n * This method is like `_.assign` except that it recursively merges own and\n * inherited enumerable string keyed properties of source objects into the\n * destination object. Source properties that resolve to `undefined` are\n * skipped if a destination value exists. Array and plain object properties\n * are merged recursively. Other objects and value types are overridden by\n * assignment. Source objects are applied from left to right. Subsequent\n * sources overwrite property assignments of previous sources.\n *\n * **Note:** This method mutates `object`.\n *\n * @static\n * @memberOf _\n * @since 0.5.0\n * @category Object\n * @param {Object} object The destination object.\n * @param {...Object} [sources] The source objects.\n * @returns {Object} Returns `object`.\n * @example\n *\n * var object = {\n *   'a': [{ 'b': 2 }, { 'd': 4 }]\n * };\n *\n * var other = {\n *   'a': [{ 'c': 3 }, { 'e': 5 }]\n * };\n *\n * _.merge(object, other);\n * // => { 'a': [{ 'b': 2, 'c': 3 }, { 'd': 4, 'e': 5 }] }\n */\nvar merge = createAssigner(function(object, source, srcIndex) {\n  baseMerge(object, source, srcIndex);\n});\n\nmodule.exports = merge;\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 baseFlatten = require('./_baseFlatten'),\n    baseOrderBy = require('./_baseOrderBy'),\n    baseRest = require('./_baseRest'),\n    isIterateeCall = require('./_isIterateeCall');\n\n/**\n * Creates an array of elements, sorted in ascending order by the results of\n * running each element in a collection thru each iteratee. This method\n * performs a stable sort, that is, it preserves the original sort order of\n * equal elements. The iteratees are invoked with one argument: (value).\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {...(Function|Function[])} [iteratees=[_.identity]]\n *  The iteratees to sort by.\n * @returns {Array} Returns the new sorted array.\n * @example\n *\n * var users = [\n *   { 'user': 'fred',   'age': 48 },\n *   { 'user': 'barney', 'age': 36 },\n *   { 'user': 'fred',   'age': 30 },\n *   { 'user': 'barney', 'age': 34 }\n * ];\n *\n * _.sortBy(users, [function(o) { return o.user; }]);\n * // => objects for [['barney', 36], ['barney', 34], ['fred', 48], ['fred', 30]]\n *\n * _.sortBy(users, ['user', 'age']);\n * // => objects for [['barney', 34], ['barney', 36], ['fred', 30], ['fred', 48]]\n */\nvar sortBy = baseRest(function(collection, iteratees) {\n  if (collection == null) {\n    return [];\n  }\n  var length = iteratees.length;\n  if (length > 1 && isIterateeCall(collection, iteratees[0], iteratees[1])) {\n    iteratees = [];\n  } else if (length > 2 && isIterateeCall(iteratees[0], iteratees[1], iteratees[2])) {\n    iteratees = [iteratees[0]];\n  }\n  return baseOrderBy(collection, baseFlatten(iteratees, 1), []);\n});\n\nmodule.exports = sortBy;\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 copyObject = require('./_copyObject'),\n    keysIn = require('./keysIn');\n\n/**\n * Converts `value` to a plain object flattening inherited enumerable string\n * keyed properties of `value` to own properties of the plain object.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Lang\n * @param {*} value The value to convert.\n * @returns {Object} Returns the converted plain object.\n * @example\n *\n * function Foo() {\n *   this.b = 2;\n * }\n *\n * Foo.prototype.c = 3;\n *\n * _.assign({ 'a': 1 }, new Foo);\n * // => { 'a': 1, 'b': 2 }\n *\n * _.assign({ 'a': 1 }, _.toPlainObject(new Foo));\n * // => { 'a': 1, 'b': 2, 'c': 3 }\n */\nfunction toPlainObject(value) {\n  return copyObject(value, keysIn(value));\n}\n\nmodule.exports = toPlainObject;\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","export type Maybe<T> = T | null;\nexport type InputMaybe<T> = Maybe<T>;\nexport type Exact<T extends { [key: string]: unknown }> = { [K in keyof T]: T[K] };\nexport type MakeOptional<T, K extends keyof T> = Omit<T, K> & { [SubKey in K]?: Maybe<T[SubKey]> };\nexport type MakeMaybe<T, K extends keyof T> = Omit<T, K> & { [SubKey in K]: Maybe<T[SubKey]> };\n/** All built-in and custom scalars, mapped to their actual values */\nexport type Scalars = {\n  ID: string;\n  String: string;\n  Boolean: boolean;\n  Int: number;\n  Float: number;\n  /** Cursor for paging through collections */\n  ConnectionCursor: any;\n  /** A date-time string at UTC, such as 2019-12-03T09:54:33Z, compliant with the date-time format. */\n  DateTime: any;\n};\n\n/** DenyReason of get access policy */\nexport enum AccessDeniedReason {\n  CustomerNotFound = 'CustomerNotFound',\n  FeatureNotFound = 'FeatureNotFound',\n  NoActiveSubscription = 'NoActiveSubscription',\n  NoFeatureEntitlementInSubscription = 'NoFeatureEntitlementInSubscription',\n  RequestedUsageExceedingLimit = 'RequestedUsageExceedingLimit',\n  Unknown = 'Unknown',\n}\n\nexport type AddAddonsToCustomerSubscriptionInput = {\n  /** The id of the record. */\n  id: Scalars['String'];\n  /** The ids of the relations. */\n  relationIds: Array<Scalars['String']>;\n};\n\nexport type AddApiKeysToEnvironmentInput = {\n  /** The id of the record. */\n  id: Scalars['String'];\n  /** The ids of the relations. */\n  relationIds: Array<Scalars['String']>;\n};\n\nexport type AddCompatibleAddonsToPlanInput = {\n  /** The id of the record. */\n  id: Scalars['String'];\n  /** The ids of the relations. */\n  relationIds: Array<Scalars['String']>;\n};\n\nexport type AddPricesToAddonInput = {\n  /** The id of the record. */\n  id: Scalars['String'];\n  /** The ids of the relations. */\n  relationIds: Array<Scalars['String']>;\n};\n\nexport type AddPricesToCustomerSubscriptionInput = {\n  /** The id of the record. */\n  id: Scalars['String'];\n  /** The ids of the relations. */\n  relationIds: Array<Scalars['String']>;\n};\n\nexport type AddPricesToPlanInput = {\n  /** The id of the record. */\n  id: Scalars['String'];\n  /** The ids of the relations. */\n  relationIds: Array<Scalars['String']>;\n};\n\nexport type AddSubscriptionsToCustomerInput = {\n  /** The id of the record. */\n  id: Scalars['String'];\n  /** The ids of the relations. */\n  relationIds: Array<Scalars['String']>;\n};\n\nexport type AddonCreateInput = {\n  billingId?: InputMaybe<Scalars['String']>;\n  description?: InputMaybe<Scalars['String']>;\n  displayName: Scalars['String'];\n  environmentId: Scalars['String'];\n  productId: Scalars['String'];\n  refId: Scalars['String'];\n  status?: InputMaybe<PackageStatus>;\n};\n\nexport type AddonDeleteFilter = {\n  and?: InputMaybe<Array<AddonDeleteFilter>>;\n  billingId?: InputMaybe<StringFieldComparison>;\n  createdAt?: InputMaybe<DateFieldComparison>;\n  description?: InputMaybe<StringFieldComparison>;\n  displayName?: InputMaybe<StringFieldComparison>;\n  environmentId?: InputMaybe<StringFieldComparison>;\n  id?: InputMaybe<StringFieldComparison>;\n  isLatest?: InputMaybe<BooleanFieldComparison>;\n  or?: InputMaybe<Array<AddonDeleteFilter>>;\n  productId?: InputMaybe<StringFieldComparison>;\n  refId?: InputMaybe<StringFieldComparison>;\n  status?: InputMaybe<PackageStatusFilterComparison>;\n  updatedAt?: InputMaybe<DateFieldComparison>;\n  versionNumber?: InputMaybe<IntFieldComparison>;\n};\n\nexport type AddonFilter = {\n  and?: InputMaybe<Array<AddonFilter>>;\n  billingId?: InputMaybe<StringFieldComparison>;\n  createdAt?: InputMaybe<DateFieldComparison>;\n  description?: InputMaybe<StringFieldComparison>;\n  displayName?: InputMaybe<StringFieldComparison>;\n  environmentId?: InputMaybe<StringFieldComparison>;\n  id?: InputMaybe<StringFieldComparison>;\n  isLatest?: InputMaybe<BooleanFieldComparison>;\n  or?: InputMaybe<Array<AddonFilter>>;\n  productId?: InputMaybe<StringFieldComparison>;\n  refId?: InputMaybe<StringFieldComparison>;\n  status?: InputMaybe<PackageStatusFilterComparison>;\n  updatedAt?: InputMaybe<DateFieldComparison>;\n  versionNumber?: InputMaybe<IntFieldComparison>;\n};\n\nexport type AddonSort = {\n  direction: SortDirection;\n  field: AddonSortFields;\n  nulls?: InputMaybe<SortNulls>;\n};\n\nexport enum AddonSortFields {\n  BillingId = 'billingId',\n  CreatedAt = 'createdAt',\n  Description = 'description',\n  DisplayName = 'displayName',\n  EnvironmentId = 'environmentId',\n  Id = 'id',\n  IsLatest = 'isLatest',\n  ProductId = 'productId',\n  RefId = 'refId',\n  Status = 'status',\n  UpdatedAt = 'updatedAt',\n  VersionNumber = 'versionNumber',\n}\n\nexport type AddonUpdateInput = {\n  billingId?: InputMaybe<Scalars['String']>;\n  description?: InputMaybe<Scalars['String']>;\n  displayName: Scalars['String'];\n  id: Scalars['String'];\n  status?: InputMaybe<PackageStatus>;\n};\n\nexport type ApiKeyFilter = {\n  and?: InputMaybe<Array<ApiKeyFilter>>;\n  id?: InputMaybe<StringFieldComparison>;\n  or?: InputMaybe<Array<ApiKeyFilter>>;\n};\n\nexport type ApiKeySort = {\n  direction: SortDirection;\n  field: ApiKeySortFields;\n  nulls?: InputMaybe<SortNulls>;\n};\n\nexport enum ApiKeySortFields {\n  Id = 'id',\n}\n\nexport enum ApiKeyType {\n  Client = 'CLIENT',\n  Server = 'SERVER',\n}\n\n/** Billing model. */\nexport enum BillingModel {\n  FlatFee = 'FLAT_FEE',\n  PerUnit = 'PER_UNIT',\n  UsageBased = 'USAGE_BASED',\n}\n\nexport type BillingModelFilterComparison = {\n  eq?: InputMaybe<BillingModel>;\n  gt?: InputMaybe<BillingModel>;\n  gte?: InputMaybe<BillingModel>;\n  iLike?: InputMaybe<BillingModel>;\n  in?: InputMaybe<Array<BillingModel>>;\n  is?: InputMaybe<Scalars['Boolean']>;\n  isNot?: InputMaybe<Scalars['Boolean']>;\n  like?: InputMaybe<BillingModel>;\n  lt?: InputMaybe<BillingModel>;\n  lte?: InputMaybe<BillingModel>;\n  neq?: InputMaybe<BillingModel>;\n  notILike?: InputMaybe<BillingModel>;\n  notIn?: InputMaybe<Array<BillingModel>>;\n  notLike?: InputMaybe<BillingModel>;\n};\n\n/** Billing period. */\nexport enum BillingPeriod {\n  Annually = 'ANNUALLY',\n  Monthly = 'MONTHLY',\n}\n\nexport type BillingPeriodFilterComparison = {\n  eq?: InputMaybe<BillingPeriod>;\n  gt?: InputMaybe<BillingPeriod>;\n  gte?: InputMaybe<BillingPeriod>;\n  iLike?: InputMaybe<BillingPeriod>;\n  in?: InputMaybe<Array<BillingPeriod>>;\n  is?: InputMaybe<Scalars['Boolean']>;\n  isNot?: InputMaybe<Scalars['Boolean']>;\n  like?: InputMaybe<BillingPeriod>;\n  lt?: InputMaybe<BillingPeriod>;\n  lte?: InputMaybe<BillingPeriod>;\n  neq?: InputMaybe<BillingPeriod>;\n  notILike?: InputMaybe<BillingPeriod>;\n  notIn?: InputMaybe<Array<BillingPeriod>>;\n  notLike?: InputMaybe<BillingPeriod>;\n};\n\nexport type BooleanFieldComparison = {\n  is?: InputMaybe<Scalars['Boolean']>;\n  isNot?: InputMaybe<Scalars['Boolean']>;\n};\n\nexport enum ChangeType {\n  Added = 'ADDED',\n  Deleted = 'DELETED',\n  Modified = 'MODIFIED',\n}\n\nexport type CheckoutAddonInput = {\n  addonId: Scalars['String'];\n  quantity?: InputMaybe<Scalars['Int']>;\n};\n\nexport type CreateEnvironment = {\n  description?: InputMaybe<Scalars['String']>;\n  displayName?: InputMaybe<Scalars['String']>;\n  id?: InputMaybe<Scalars['String']>;\n  slug?: InputMaybe<Scalars['String']>;\n};\n\nexport type CreateFeature = {\n  createdAt?: InputMaybe<Scalars['DateTime']>;\n  description?: InputMaybe<Scalars['String']>;\n  displayName?: InputMaybe<Scalars['String']>;\n  environmentId?: InputMaybe<Scalars['String']>;\n  featureStatus?: InputMaybe<FeatureStatus>;\n  featureType?: InputMaybe<FeatureType>;\n  featureUnits?: InputMaybe<Scalars['String']>;\n  featureUnitsPlural?: InputMaybe<Scalars['String']>;\n  id?: InputMaybe<Scalars['String']>;\n  meterType?: InputMaybe<MeterType>;\n  refId?: InputMaybe<Scalars['String']>;\n  updatedAt?: InputMaybe<Scalars['DateTime']>;\n};\n\nexport type CreateHook = {\n  createdAt?: InputMaybe<Scalars['DateTime']>;\n  description?: InputMaybe<Scalars['String']>;\n  endpoint?: InputMaybe<Scalars['String']>;\n  environmentId?: InputMaybe<Scalars['String']>;\n  eventLogTypes?: InputMaybe<Array<EventLogType>>;\n  id?: InputMaybe<Scalars['String']>;\n  secretKey?: InputMaybe<Scalars['String']>;\n  status?: InputMaybe<HookStatus>;\n};\n\nexport type CreateIntegrationInput = {\n  environmentId: Scalars['String'];\n  stripeCredentials?: InputMaybe<StripeCredentialsInput>;\n  vendorIdentifier: VendorIdentifier;\n  zuoraCredentials?: InputMaybe<ZuoraCredentialsInput>;\n};\n\nexport type CreateManyCustomersInput = {\n  /** Array of records to create */\n  customers: Array<CustomerInput>;\n};\n\nexport type CreateManyEnvironmentsInput = {\n  /** Array of records to create */\n  environments: Array<CreateEnvironment>;\n};\n\nexport type CreateManyHooksInput = {\n  /** Array of records to create */\n  hooks: Array<CreateHook>;\n};\n\nexport type CreateManyIntegrationsInput = {\n  /** Array of records to create */\n  integrations: Array<CreateIntegrationInput>;\n};\n\nexport type CreateManyPackageEntitlementsInput = {\n  /** Array of records to create */\n  packageEntitlements: Array<PackageEntitlementInput>;\n};\n\nexport type CreateManyProductsInput = {\n  /** Array of records to create */\n  products: Array<ProductCreateInput>;\n};\n\nexport type CreateManyPromotionalEntitlementsInput = {\n  /** Array of records to create */\n  promotionalEntitlements: Array<PromotionalEntitlementInput>;\n};\n\nexport type CreateOneCustomerInput = {\n  /** The record to create */\n  customer: CustomerInput;\n};\n\nexport type CreateOneEnvironmentInput = {\n  /** The record to create */\n  environment: CreateEnvironment;\n};\n\nexport type CreateOneFeatureInput = {\n  /** The record to create */\n  feature: CreateFeature;\n};\n\nexport type CreateOneHookInput = {\n  /** The record to create */\n  hook: CreateHook;\n};\n\nexport type CreateOneIntegrationInput = {\n  /** The record to create */\n  integration: CreateIntegrationInput;\n};\n\nexport type CreateOnePackageEntitlementInput = {\n  /** The record to create */\n  packageEntitlement: PackageEntitlementInput;\n};\n\nexport type CreateOneProductInput = {\n  /** The record to create */\n  product: ProductCreateInput;\n};\n\nexport type CreateOnePromotionalEntitlementInput = {\n  /** The record to create */\n  promotionalEntitlement: PromotionalEntitlementInput;\n};\n\n/** Currency */\nexport enum Currency {\n  Usd = 'USD',\n}\n\nexport type CursorPaging = {\n  /** Paginate after opaque cursor */\n  after?: InputMaybe<Scalars['ConnectionCursor']>;\n  /** Paginate before opaque cursor */\n  before?: InputMaybe<Scalars['ConnectionCursor']>;\n  /** Paginate first */\n  first?: InputMaybe<Scalars['Int']>;\n  /** Paginate last */\n  last?: InputMaybe<Scalars['Int']>;\n};\n\nexport type CustomerDeleteFilter = {\n  and?: InputMaybe<Array<CustomerDeleteFilter>>;\n  billingId?: InputMaybe<StringFieldComparison>;\n  createdAt?: InputMaybe<DateFieldComparison>;\n  crmId?: InputMaybe<StringFieldComparison>;\n  email?: InputMaybe<StringFieldComparison>;\n  environmentId?: InputMaybe<StringFieldComparison>;\n  id?: InputMaybe<StringFieldComparison>;\n  name?: InputMaybe<StringFieldComparison>;\n  or?: InputMaybe<Array<CustomerDeleteFilter>>;\n  refId?: InputMaybe<StringFieldComparison>;\n  updatedAt?: InputMaybe<DateFieldComparison>;\n};\n\nexport type CustomerFilter = {\n  and?: InputMaybe<Array<CustomerFilter>>;\n  billingId?: InputMaybe<StringFieldComparison>;\n  createdAt?: InputMaybe<DateFieldComparison>;\n  crmId?: InputMaybe<StringFieldComparison>;\n  email?: InputMaybe<StringFieldComparison>;\n  environmentId?: InputMaybe<StringFieldComparison>;\n  id?: InputMaybe<StringFieldComparison>;\n  name?: InputMaybe<StringFieldComparison>;\n  or?: InputMaybe<Array<CustomerFilter>>;\n  promotionalEntitlements?: InputMaybe<CustomerFilterPromotionalEntitlementFilter>;\n  refId?: InputMaybe<StringFieldComparison>;\n  subscriptions?: InputMaybe<CustomerFilterCustomerSubscriptionFilter>;\n  updatedAt?: InputMaybe<DateFieldComparison>;\n};\n\nexport type CustomerFilterCustomerSubscriptionFilter = {\n  and?: InputMaybe<Array<CustomerFilterCustomerSubscriptionFilter>>;\n  billingId?: InputMaybe<StringFieldComparison>;\n  crmId?: InputMaybe<StringFieldComparison>;\n  endDate?: InputMaybe<DateFieldComparison>;\n  environmentId?: InputMaybe<StringFieldComparison>;\n  id?: InputMaybe<StringFieldComparison>;\n  or?: InputMaybe<Array<CustomerFilterCustomerSubscriptionFilter>>;\n  refId?: InputMaybe<StringFieldComparison>;\n  startDate?: InputMaybe<DateFieldComparison>;\n  status?: InputMaybe<SubscriptionStatusFilterComparison>;\n};\n\nexport type CustomerFilterPromotionalEntitlementFilter = {\n  and?: InputMaybe<Array<CustomerFilterPromotionalEntitlementFilter>>;\n  createdAt?: InputMaybe<DateFieldComparison>;\n  environmentId?: InputMaybe<StringFieldComparison>;\n  id?: InputMaybe<StringFieldComparison>;\n  or?: InputMaybe<Array<CustomerFilterPromotionalEntitlementFilter>>;\n  status?: InputMaybe<PromotionalEntitlementStatusFilterComparison>;\n  updatedAt?: InputMaybe<DateFieldComparison>;\n};\n\nexport type CustomerInput = {\n  billingId?: InputMaybe<Scalars['String']>;\n  crmId?: InputMaybe<Scalars['String']>;\n  email?: InputMaybe<Scalars['String']>;\n  environmentId?: InputMaybe<Scalars['String']>;\n  name?: InputMaybe<Scalars['String']>;\n  refId: Scalars['String'];\n};\n\nexport type CustomerSort = {\n  direction: SortDirection;\n  field: CustomerSortFields;\n  nulls?: InputMaybe<SortNulls>;\n};\n\nexport enum CustomerSortFields {\n  BillingId = 'billingId',\n  CreatedAt = 'createdAt',\n  CrmId = 'crmId',\n  Email = 'email',\n  EnvironmentId = 'environmentId',\n  Id = 'id',\n  Name = 'name',\n  RefId = 'refId',\n  UpdatedAt = 'updatedAt',\n}\n\nexport type CustomerSubscriptionFilter = {\n  addons?: InputMaybe<CustomerSubscriptionFilterSubscriptionAddonFilter>;\n  and?: InputMaybe<Array<CustomerSubscriptionFilter>>;\n  billingId?: InputMaybe<StringFieldComparison>;\n  crmId?: InputMaybe<StringFieldComparison>;\n  customer?: InputMaybe<CustomerSubscriptionFilterCustomerFilter>;\n  endDate?: InputMaybe<DateFieldComparison>;\n  environmentId?: InputMaybe<StringFieldComparison>;\n  id?: InputMaybe<StringFieldComparison>;\n  or?: InputMaybe<Array<CustomerSubscriptionFilter>>;\n  prices?: InputMaybe<CustomerSubscriptionFilterSubscriptionPriceFilter>;\n  refId?: InputMaybe<StringFieldComparison>;\n  startDate?: InputMaybe<DateFieldComparison>;\n  status?: InputMaybe<SubscriptionStatusFilterComparison>;\n};\n\nexport type CustomerSubscriptionFilterCustomerFilter = {\n  and?: InputMaybe<Array<CustomerSubscriptionFilterCustomerFilter>>;\n  billingId?: InputMaybe<StringFieldComparison>;\n  createdAt?: InputMaybe<DateFieldComparison>;\n  crmId?: InputMaybe<StringFieldComparison>;\n  email?: InputMaybe<StringFieldComparison>;\n  environmentId?: InputMaybe<StringFieldComparison>;\n  id?: InputMaybe<StringFieldComparison>;\n  name?: InputMaybe<StringFieldComparison>;\n  or?: InputMaybe<Array<CustomerSubscriptionFilterCustomerFilter>>;\n  refId?: InputMaybe<StringFieldComparison>;\n  updatedAt?: InputMaybe<DateFieldComparison>;\n};\n\nexport type CustomerSubscriptionFilterSubscriptionAddonFilter = {\n  and?: InputMaybe<Array<CustomerSubscriptionFilterSubscriptionAddonFilter>>;\n  id?: InputMaybe<StringFieldComparison>;\n  or?: InputMaybe<Array<CustomerSubscriptionFilterSubscriptionAddonFilter>>;\n  quantity?: InputMaybe<NumberFieldComparison>;\n  updatedAt?: InputMaybe<DateFieldComparison>;\n};\n\nexport type CustomerSubscriptionFilterSubscriptionPriceFilter = {\n  and?: InputMaybe<Array<CustomerSubscriptionFilterSubscriptionPriceFilter>>;\n  id?: InputMaybe<StringFieldComparison>;\n  or?: InputMaybe<Array<CustomerSubscriptionFilterSubscriptionPriceFilter>>;\n  updatedAt?: InputMaybe<DateFieldComparison>;\n  usageLimit?: InputMaybe<NumberFieldComparison>;\n};\n\nexport type CustomerSubscriptionSort = {\n  direction: SortDirection;\n  field: CustomerSubscriptionSortFields;\n  nulls?: InputMaybe<SortNulls>;\n};\n\nexport enum CustomerSubscriptionSortFields {\n  BillingId = 'billingId',\n  CrmId = 'crmId',\n  EndDate = 'endDate',\n  EnvironmentId = 'environmentId',\n  Id = 'id',\n  RefId = 'refId',\n  StartDate = 'startDate',\n  Status = 'status',\n}\n\nexport type CustomerUpdateFilter = {\n  and?: InputMaybe<Array<CustomerUpdateFilter>>;\n  billingId?: InputMaybe<StringFieldComparison>;\n  createdAt?: InputMaybe<DateFieldComparison>;\n  crmId?: InputMaybe<StringFieldComparison>;\n  email?: InputMaybe<StringFieldComparison>;\n  environmentId?: InputMaybe<StringFieldComparison>;\n  id?: InputMaybe<StringFieldComparison>;\n  name?: InputMaybe<StringFieldComparison>;\n  or?: InputMaybe<Array<CustomerUpdateFilter>>;\n  refId?: InputMaybe<StringFieldComparison>;\n  updatedAt?: InputMaybe<DateFieldComparison>;\n};\n\nexport type DateFieldComparison = {\n  between?: InputMaybe<DateFieldComparisonBetween>;\n  eq?: InputMaybe<Scalars['DateTime']>;\n  gt?: InputMaybe<Scalars['DateTime']>;\n  gte?: InputMaybe<Scalars['DateTime']>;\n  in?: InputMaybe<Array<Scalars['DateTime']>>;\n  is?: InputMaybe<Scalars['Boolean']>;\n  isNot?: InputMaybe<Scalars['Boolean']>;\n  lt?: InputMaybe<Scalars['DateTime']>;\n  lte?: InputMaybe<Scalars['DateTime']>;\n  neq?: InputMaybe<Scalars['DateTime']>;\n  notBetween?: InputMaybe<DateFieldComparisonBetween>;\n  notIn?: InputMaybe<Array<Scalars['DateTime']>>;\n};\n\nexport type DateFieldComparisonBetween = {\n  lower: Scalars['DateTime'];\n  upper: Scalars['DateTime'];\n};\n\nexport type DefaultTrialConfigInputDto = {\n  duration: Scalars['Float'];\n  units: TrialPeriodUnits;\n};\n\nexport type DeleteManyAddonsInput = {\n  /** Filter to find records to delete */\n  filter: AddonDeleteFilter;\n};\n\nexport type DeleteManyCustomersInput = {\n  /** Filter to find records to delete */\n  filter: CustomerDeleteFilter;\n};\n\nexport type DeleteManyEnvironmentsInput = {\n  /** Filter to find records to delete */\n  filter: EnvironmentDeleteFilter;\n};\n\nexport type DeleteManyEventLogsInput = {\n  /** Filter to find records to delete */\n  filter: EventLogDeleteFilter;\n};\n\nexport type DeleteManyHooksInput = {\n  /** Filter to find records to delete */\n  filter: HookDeleteFilter;\n};\n\nexport type DeleteManyIntegrationsInput = {\n  /** Filter to find records to delete */\n  filter: IntegrationDeleteFilter;\n};\n\nexport type DeleteManyPackageEntitlementsInput = {\n  /** Filter to find records to delete */\n  filter: PackageEntitlementDeleteFilter;\n};\n\nexport type DeleteManyPlansInput = {\n  /** Filter to find records to delete */\n  filter: PlanDeleteFilter;\n};\n\nexport type DeleteManyPricesInput = {\n  /** Filter to find records to delete */\n  filter: PriceDeleteFilter;\n};\n\nexport type DeleteManyProductsInput = {\n  /** Filter to find records to delete */\n  filter: ProductDeleteFilter;\n};\n\nexport type DeleteManyPromotionalEntitlementsInput = {\n  /** Filter to find records to delete */\n  filter: PromotionalEntitlementDeleteFilter;\n};\n\nexport type DeleteOneAddonInput = {\n  /** The id of the record to delete. */\n  id: Scalars['String'];\n};\n\nexport type DeleteOneCustomerInput = {\n  /** The id of the record to delete. */\n  id: Scalars['String'];\n};\n\nexport type DeleteOneEnvironmentInput = {\n  /** The id of the record to delete. */\n  id: Scalars['String'];\n};\n\nexport type DeleteOneEventLogInput = {\n  /** The id of the record to delete. */\n  id: Scalars['String'];\n};\n\nexport type DeleteOneFeatureInput = {\n  /** The id of the record to delete. */\n  id: Scalars['String'];\n};\n\nexport type DeleteOneHookInput = {\n  /** The id of the record to delete. */\n  id: Scalars['String'];\n};\n\nexport type DeleteOneIntegrationInput = {\n  /** The id of the record to delete. */\n  id: Scalars['String'];\n};\n\nexport type DeleteOnePackageEntitlementInput = {\n  /** The id of the record to delete. */\n  id: Scalars['String'];\n};\n\nexport type DeleteOnePlanInput = {\n  /** The id of the record to delete. */\n  id: Scalars['String'];\n};\n\nexport type DeleteOnePriceInput = {\n  /** The id of the record to delete. */\n  id: Scalars['String'];\n};\n\nexport type DeleteOneProductInput = {\n  /** The id of the record to delete. */\n  id: Scalars['String'];\n};\n\nexport type DeleteOnePromotionalEntitlementInput = {\n  /** The id of the record to delete. */\n  id: Scalars['String'];\n};\n\nexport type DiscardPackageDraftInput = {\n  environmentId: Scalars['String'];\n  refId: Scalars['String'];\n};\n\nexport type EntitlementOptions = {\n  requestedUsage?: InputMaybe<Scalars['Float']>;\n  shouldTrack?: InputMaybe<Scalars['Boolean']>;\n};\n\n/** Entitlement reset period. */\nexport enum EntitlementResetPeriod {\n  Day = 'DAY',\n  Hour = 'HOUR',\n  Month = 'MONTH',\n  Week = 'WEEK',\n}\n\nexport type EnvironmentDeleteFilter = {\n  and?: InputMaybe<Array<EnvironmentDeleteFilter>>;\n  displayName?: InputMaybe<StringFieldComparison>;\n  id?: InputMaybe<StringFieldComparison>;\n  or?: InputMaybe<Array<EnvironmentDeleteFilter>>;\n};\n\nexport type EnvironmentFilter = {\n  and?: InputMaybe<Array<EnvironmentFilter>>;\n  displayName?: InputMaybe<StringFieldComparison>;\n  id?: InputMaybe<StringFieldComparison>;\n  or?: InputMaybe<Array<EnvironmentFilter>>;\n};\n\nexport type EnvironmentSort = {\n  direction: SortDirection;\n  field: EnvironmentSortFields;\n  nulls?: InputMaybe<SortNulls>;\n};\n\nexport enum EnvironmentSortFields {\n  DisplayName = 'displayName',\n  Id = 'id',\n}\n\nexport type EnvironmentUpdateFilter = {\n  and?: InputMaybe<Array<EnvironmentUpdateFilter>>;\n  displayName?: InputMaybe<StringFieldComparison>;\n  id?: InputMaybe<StringFieldComparison>;\n  or?: InputMaybe<Array<EnvironmentUpdateFilter>>;\n};\n\n/** error codes */\nexport enum ErrorCode {\n  AddonNotFound = 'AddonNotFound',\n  CheckoutIsNotSupported = 'CheckoutIsNotSupported',\n  CustomerNotFound = 'CustomerNotFound',\n  DuplicatedEntityNotAllowed = 'DuplicatedEntityNotAllowed',\n  EnvironmentMissing = 'EnvironmentMissing',\n  FeatureNotFound = 'FeatureNotFound',\n  IdentityForbidden = 'IdentityForbidden',\n  IntegrityViolation = 'IntegrityViolation',\n  InvalidEntitlementResetPeriod = 'InvalidEntitlementResetPeriod',\n  InvalidMemberDelete = 'InvalidMemberDelete',\n  InvalidUsageValueForIncrementalFeatureError = 'InvalidUsageValueForIncrementalFeatureError',\n  MemberInvitationError = 'MemberInvitationError',\n  MemberNotFound = 'MemberNotFound',\n  MeteringNotAvailableForFeatureType = 'MeteringNotAvailableForFeatureType',\n  NoFeatureEntitlementInSubscription = 'NoFeatureEntitlementInSubscription',\n  PackageAlreadyPublished = 'PackageAlreadyPublished',\n  PlanAlreadyExtended = 'PlanAlreadyExtended',\n  PlanNotFound = 'PlanNotFound',\n  PlansCircularDependencyError = 'PlansCircularDependencyError',\n  PriceNotFound = 'PriceNotFound',\n  TrialsNotAllowedInProduct = 'TrialsNotAllowedInProduct',\n  UnPublishedPackage = 'UnPublishedPackage',\n  UncompatibleSubscriptionAddon = 'UncompatibleSubscriptionAddon',\n  UnexpectedError = 'UnexpectedError',\n  UnsupportedFeatureType = 'UnsupportedFeatureType',\n  UnsupportedVendorIdentifier = 'UnsupportedVendorIdentifier',\n}\n\nexport type EventLogDeleteFilter = {\n  and?: InputMaybe<Array<EventLogDeleteFilter>>;\n  environmentId?: InputMaybe<StringFieldComparison>;\n  id?: InputMaybe<StringFieldComparison>;\n  or?: InputMaybe<Array<EventLogDeleteFilter>>;\n};\n\nexport type EventLogFilter = {\n  and?: InputMaybe<Array<EventLogFilter>>;\n  environmentId?: InputMaybe<StringFieldComparison>;\n  id?: InputMaybe<StringFieldComparison>;\n  or?: InputMaybe<Array<EventLogFilter>>;\n};\n\nexport type EventLogSort = {\n  direction: SortDirection;\n  field: EventLogSortFields;\n  nulls?: InputMaybe<SortNulls>;\n};\n\nexport enum EventLogSortFields {\n  EnvironmentId = 'environmentId',\n  Id = 'id',\n}\n\n/** EventLogType */\nexport enum EventLogType {\n  AddonCreated = 'ADDON_CREATED',\n  AddonDeleted = 'ADDON_DELETED',\n  AddonUpdated = 'ADDON_UPDATED',\n  CustomerCreated = 'CUSTOMER_CREATED',\n  CustomerDeleted = 'CUSTOMER_DELETED',\n  CustomerUpdated = 'CUSTOMER_UPDATED',\n  EntitlementDenied = 'ENTITLEMENT_DENIED',\n  EntitlementGranted = 'ENTITLEMENT_GRANTED',\n  EntitlementRequested = 'ENTITLEMENT_REQUESTED',\n  FeatureCreated = 'FEATURE_CREATED',\n  FeatureDeleted = 'FEATURE_DELETED',\n  FeatureUpdated = 'FEATURE_UPDATED',\n  MeasurementReported = 'MEASUREMENT_REPORTED',\n  PackagePublished = 'PACKAGE_PUBLISHED',\n  PlanCreated = 'PLAN_CREATED',\n  PlanDeleted = 'PLAN_DELETED',\n  PlanUpdated = 'PLAN_UPDATED',\n  PromotionalEntitlementExpired = 'PROMOTIONAL_ENTITLEMENT_EXPIRED',\n  PromotionalEntitlementGranted = 'PROMOTIONAL_ENTITLEMENT_GRANTED',\n  PromotionalEntitlementRevoked = 'PROMOTIONAL_ENTITLEMENT_REVOKED',\n  PromotionalEntitlementUpdated = 'PROMOTIONAL_ENTITLEMENT_UPDATED',\n  SubscriptionCanceled = 'SUBSCRIPTION_CANCELED',\n  SubscriptionCreated = 'SUBSCRIPTION_CREATED',\n  SubscriptionExpired = 'SUBSCRIPTION_EXPIRED',\n  SubscriptionTrialConverted = 'SUBSCRIPTION_TRIAL_CONVERTED',\n  SubscriptionTrialEndsSoon = 'SUBSCRIPTION_TRIAL_ENDS_SOON',\n  SubscriptionTrialExpired = 'SUBSCRIPTION_TRIAL_EXPIRED',\n  SubscriptionTrialStarted = 'SUBSCRIPTION_TRIAL_STARTED',\n  SubscriptionUpdated = 'SUBSCRIPTION_UPDATED',\n}\n\nexport type FeatureFilter = {\n  and?: InputMaybe<Array<FeatureFilter>>;\n  createdAt?: InputMaybe<DateFieldComparison>;\n  description?: InputMaybe<StringFieldComparison>;\n  displayName?: InputMaybe<StringFieldComparison>;\n  environmentId?: InputMaybe<StringFieldComparison>;\n  featureStatus?: InputMaybe<FeatureStatusFilterComparison>;\n  featureType?: InputMaybe<FeatureTypeFilterComparison>;\n  id?: InputMaybe<StringFieldComparison>;\n  meterType?: InputMaybe<MeterTypeFilterComparison>;\n  or?: InputMaybe<Array<FeatureFilter>>;\n  refId?: InputMaybe<StringFieldComparison>;\n  updatedAt?: InputMaybe<DateFieldComparison>;\n};\n\nexport type FeatureSort = {\n  direction: SortDirection;\n  field: FeatureSortFields;\n  nulls?: InputMaybe<SortNulls>;\n};\n\nexport enum FeatureSortFields {\n  CreatedAt = 'createdAt',\n  Description = 'description',\n  DisplayName = 'displayName',\n  EnvironmentId = 'environmentId',\n  FeatureStatus = 'featureStatus',\n  FeatureType = 'featureType',\n  Id = 'id',\n  MeterType = 'meterType',\n  RefId = 'refId',\n  UpdatedAt = 'updatedAt',\n}\n\n/** Feature status. */\nexport enum FeatureStatus {\n  Active = 'ACTIVE',\n  New = 'NEW',\n  Suspended = 'SUSPENDED',\n}\n\nexport type FeatureStatusFilterComparison = {\n  eq?: InputMaybe<FeatureStatus>;\n  gt?: InputMaybe<FeatureStatus>;\n  gte?: InputMaybe<FeatureStatus>;\n  iLike?: InputMaybe<FeatureStatus>;\n  in?: InputMaybe<Array<FeatureStatus>>;\n  is?: InputMaybe<Scalars['Boolean']>;\n  isNot?: InputMaybe<Scalars['Boolean']>;\n  like?: InputMaybe<FeatureStatus>;\n  lt?: InputMaybe<FeatureStatus>;\n  lte?: InputMaybe<FeatureStatus>;\n  neq?: InputMaybe<FeatureStatus>;\n  notILike?: InputMaybe<FeatureStatus>;\n  notIn?: InputMaybe<Array<FeatureStatus>>;\n  notLike?: InputMaybe<FeatureStatus>;\n};\n\n/** The type of the feature */\nexport enum FeatureType {\n  Boolean = 'BOOLEAN',\n  Number = 'NUMBER',\n}\n\nexport type FeatureTypeFilterComparison = {\n  eq?: InputMaybe<FeatureType>;\n  gt?: InputMaybe<FeatureType>;\n  gte?: InputMaybe<FeatureType>;\n  iLike?: InputMaybe<FeatureType>;\n  in?: InputMaybe<Array<FeatureType>>;\n  is?: InputMaybe<Scalars['Boolean']>;\n  isNot?: InputMaybe<Scalars['Boolean']>;\n  like?: InputMaybe<FeatureType>;\n  lt?: InputMaybe<FeatureType>;\n  lte?: InputMaybe<FeatureType>;\n  neq?: InputMaybe<FeatureType>;\n  notILike?: InputMaybe<FeatureType>;\n  notIn?: InputMaybe<Array<FeatureType>>;\n  notLike?: InputMaybe<FeatureType>;\n};\n\nexport type FetchEntitlementQuery = {\n  customerId: Scalars['String'];\n  environmentId?: InputMaybe<Scalars['String']>;\n  featureId: Scalars['String'];\n  options?: InputMaybe<EntitlementOptions>;\n};\n\nexport type FetchEntitlementsQuery = {\n  customerId: Scalars['String'];\n  environmentId?: InputMaybe<Scalars['String']>;\n};\n\nexport type GetPackageByRefIdInput = {\n  environmentId: Scalars['String'];\n  refId: Scalars['String'];\n  versionNumber?: InputMaybe<Scalars['Float']>;\n};\n\nexport type HookDeleteFilter = {\n  and?: InputMaybe<Array<HookDeleteFilter>>;\n  createdAt?: InputMaybe<DateFieldComparison>;\n  endpoint?: InputMaybe<StringFieldComparison>;\n  environmentId?: InputMaybe<StringFieldComparison>;\n  id?: InputMaybe<StringFieldComparison>;\n  or?: InputMaybe<Array<HookDeleteFilter>>;\n  status?: InputMaybe<HookStatusFilterComparison>;\n};\n\nexport type HookFilter = {\n  and?: InputMaybe<Array<HookFilter>>;\n  createdAt?: InputMaybe<DateFieldComparison>;\n  endpoint?: InputMaybe<StringFieldComparison>;\n  environmentId?: InputMaybe<StringFieldComparison>;\n  id?: InputMaybe<StringFieldComparison>;\n  or?: InputMaybe<Array<HookFilter>>;\n  status?: InputMaybe<HookStatusFilterComparison>;\n};\n\nexport type HookSort = {\n  direction: SortDirection;\n  field: HookSortFields;\n  nulls?: InputMaybe<SortNulls>;\n};\n\nexport enum HookSortFields {\n  CreatedAt = 'createdAt',\n  Endpoint = 'endpoint',\n  EnvironmentId = 'environmentId',\n  Id = 'id',\n  Status = 'status',\n}\n\n/** HookStatus. */\nexport enum HookStatus {\n  Active = 'ACTIVE',\n  Inactive = 'INACTIVE',\n}\n\nexport type HookStatusFilterComparison = {\n  eq?: InputMaybe<HookStatus>;\n  gt?: InputMaybe<HookStatus>;\n  gte?: InputMaybe<HookStatus>;\n  iLike?: InputMaybe<HookStatus>;\n  in?: InputMaybe<Array<HookStatus>>;\n  is?: InputMaybe<Scalars['Boolean']>;\n  isNot?: InputMaybe<Scalars['Boolean']>;\n  like?: InputMaybe<HookStatus>;\n  lt?: InputMaybe<HookStatus>;\n  lte?: InputMaybe<HookStatus>;\n  neq?: InputMaybe<HookStatus>;\n  notILike?: InputMaybe<HookStatus>;\n  notIn?: InputMaybe<Array<HookStatus>>;\n  notLike?: InputMaybe<HookStatus>;\n};\n\nexport type HookUpdateFilter = {\n  and?: InputMaybe<Array<HookUpdateFilter>>;\n  createdAt?: InputMaybe<DateFieldComparison>;\n  endpoint?: InputMaybe<StringFieldComparison>;\n  environmentId?: InputMaybe<StringFieldComparison>;\n  id?: InputMaybe<StringFieldComparison>;\n  or?: InputMaybe<Array<HookUpdateFilter>>;\n  status?: InputMaybe<HookStatusFilterComparison>;\n};\n\nexport type InitiateCheckoutInput = {\n  addons?: InputMaybe<Array<CheckoutAddonInput>>;\n  billingPeriod: BillingPeriod;\n  cancelUrl: Scalars['String'];\n  customerId: Scalars['String'];\n  environmentId?: InputMaybe<Scalars['String']>;\n  planId: Scalars['String'];\n  successUrl: Scalars['String'];\n};\n\nexport type IntFieldComparison = {\n  between?: InputMaybe<IntFieldComparisonBetween>;\n  eq?: InputMaybe<Scalars['Int']>;\n  gt?: InputMaybe<Scalars['Int']>;\n  gte?: InputMaybe<Scalars['Int']>;\n  in?: InputMaybe<Array<Scalars['Int']>>;\n  is?: InputMaybe<Scalars['Boolean']>;\n  isNot?: InputMaybe<Scalars['Boolean']>;\n  lt?: InputMaybe<Scalars['Int']>;\n  lte?: InputMaybe<Scalars['Int']>;\n  neq?: InputMaybe<Scalars['Int']>;\n  notBetween?: InputMaybe<IntFieldComparisonBetween>;\n  notIn?: InputMaybe<Array<Scalars['Int']>>;\n};\n\nexport type IntFieldComparisonBetween = {\n  lower: Scalars['Int'];\n  upper: Scalars['Int'];\n};\n\nexport type IntegrationDeleteFilter = {\n  and?: InputMaybe<Array<IntegrationDeleteFilter>>;\n  environmentId?: InputMaybe<StringFieldComparison>;\n  id?: InputMaybe<StringFieldComparison>;\n  or?: InputMaybe<Array<IntegrationDeleteFilter>>;\n  vendorIdentifier?: InputMaybe<VendorIdentifierFilterComparison>;\n};\n\nexport type IntegrationFilter = {\n  and?: InputMaybe<Array<IntegrationFilter>>;\n  environmentId?: InputMaybe<StringFieldComparison>;\n  id?: InputMaybe<StringFieldComparison>;\n  or?: InputMaybe<Array<IntegrationFilter>>;\n  vendorIdentifier?: InputMaybe<VendorIdentifierFilterComparison>;\n};\n\nexport type IntegrationSort = {\n  direction: SortDirection;\n  field: IntegrationSortFields;\n  nulls?: InputMaybe<SortNulls>;\n};\n\nexport enum IntegrationSortFields {\n  EnvironmentId = 'environmentId',\n  Id = 'id',\n  VendorIdentifier = 'vendorIdentifier',\n}\n\nexport type IntegrationUpdateFilter = {\n  and?: InputMaybe<Array<IntegrationUpdateFilter>>;\n  environmentId?: InputMaybe<StringFieldComparison>;\n  id?: InputMaybe<StringFieldComparison>;\n  or?: InputMaybe<Array<IntegrationUpdateFilter>>;\n  vendorIdentifier?: InputMaybe<VendorIdentifierFilterComparison>;\n};\n\nexport type MemberFilter = {\n  and?: InputMaybe<Array<MemberFilter>>;\n  id?: InputMaybe<StringFieldComparison>;\n  or?: InputMaybe<Array<MemberFilter>>;\n};\n\nexport type MemberSort = {\n  direction: SortDirection;\n  field: MemberSortFields;\n  nulls?: InputMaybe<SortNulls>;\n};\n\nexport enum MemberSortFields {\n  Id = 'id',\n}\n\n/** Member Status. */\nexport enum MemberStatus {\n  Invited = 'INVITED',\n  Registered = 'REGISTERED',\n}\n\n/** The meter type of the feature */\nexport enum MeterType {\n  Fluctuating = 'Fluctuating',\n  Incremental = 'Incremental',\n  None = 'None',\n}\n\nexport type MeterTypeFilterComparison = {\n  eq?: InputMaybe<MeterType>;\n  gt?: InputMaybe<MeterType>;\n  gte?: InputMaybe<MeterType>;\n  iLike?: InputMaybe<MeterType>;\n  in?: InputMaybe<Array<MeterType>>;\n  is?: InputMaybe<Scalars['Boolean']>;\n  isNot?: InputMaybe<Scalars['Boolean']>;\n  like?: InputMaybe<MeterType>;\n  lt?: InputMaybe<MeterType>;\n  lte?: InputMaybe<MeterType>;\n  neq?: InputMaybe<MeterType>;\n  notILike?: InputMaybe<MeterType>;\n  notIn?: InputMaybe<Array<MeterType>>;\n  notLike?: InputMaybe<MeterType>;\n};\n\nexport type MoneyInputDto = {\n  amount: Scalars['Float'];\n  currency?: InputMaybe<Currency>;\n};\n\n/** Montly reset period according to configuration */\nexport enum MonthlyAccordingTo {\n  StartOfTheMonth = 'StartOfTheMonth',\n  SubscriptionStart = 'SubscriptionStart',\n}\n\nexport type MonthlyResetPeriodConfigInput = {\n  accordingTo: MonthlyAccordingTo;\n};\n\nexport type NumberFieldComparison = {\n  between?: InputMaybe<NumberFieldComparisonBetween>;\n  eq?: InputMaybe<Scalars['Float']>;\n  gt?: InputMaybe<Scalars['Float']>;\n  gte?: InputMaybe<Scalars['Float']>;\n  in?: InputMaybe<Array<Scalars['Float']>>;\n  is?: InputMaybe<Scalars['Boolean']>;\n  isNot?: InputMaybe<Scalars['Boolean']>;\n  lt?: InputMaybe<Scalars['Float']>;\n  lte?: InputMaybe<Scalars['Float']>;\n  neq?: InputMaybe<Scalars['Float']>;\n  notBetween?: InputMaybe<NumberFieldComparisonBetween>;\n  notIn?: InputMaybe<Array<Scalars['Float']>>;\n};\n\nexport type NumberFieldComparisonBetween = {\n  lower: Scalars['Float'];\n  upper: Scalars['Float'];\n};\n\nexport type PackageEntitlementDeleteFilter = {\n  and?: InputMaybe<Array<PackageEntitlementDeleteFilter>>;\n  createdAt?: InputMaybe<DateFieldComparison>;\n  environmentId?: InputMaybe<StringFieldComparison>;\n  id?: InputMaybe<StringFieldComparison>;\n  or?: InputMaybe<Array<PackageEntitlementDeleteFilter>>;\n  packageId?: InputMaybe<StringFieldComparison>;\n  updatedAt?: InputMaybe<DateFieldComparison>;\n};\n\nexport type PackageEntitlementFilter = {\n  and?: InputMaybe<Array<PackageEntitlementFilter>>;\n  createdAt?: InputMaybe<DateFieldComparison>;\n  environmentId?: InputMaybe<StringFieldComparison>;\n  feature?: InputMaybe<PackageEntitlementFilterFeatureFilter>;\n  id?: InputMaybe<StringFieldComparison>;\n  or?: InputMaybe<Array<PackageEntitlementFilter>>;\n  package?: InputMaybe<PackageEntitlementFilterPackageDtoFilter>;\n  packageId?: InputMaybe<StringFieldComparison>;\n  updatedAt?: InputMaybe<DateFieldComparison>;\n};\n\nexport type PackageEntitlementFilterFeatureFilter = {\n  and?: InputMaybe<Array<PackageEntitlementFilterFeatureFilter>>;\n  createdAt?: InputMaybe<DateFieldComparison>;\n  description?: InputMaybe<StringFieldComparison>;\n  displayName?: InputMaybe<StringFieldComparison>;\n  environmentId?: InputMaybe<StringFieldComparison>;\n  featureStatus?: InputMaybe<FeatureStatusFilterComparison>;\n  featureType?: InputMaybe<FeatureTypeFilterComparison>;\n  id?: InputMaybe<StringFieldComparison>;\n  meterType?: InputMaybe<MeterTypeFilterComparison>;\n  or?: InputMaybe<Array<PackageEntitlementFilterFeatureFilter>>;\n  refId?: InputMaybe<StringFieldComparison>;\n  updatedAt?: InputMaybe<DateFieldComparison>;\n};\n\nexport type PackageEntitlementFilterPackageDtoFilter = {\n  and?: InputMaybe<Array<PackageEntitlementFilterPackageDtoFilter>>;\n  billingId?: InputMaybe<StringFieldComparison>;\n  createdAt?: InputMaybe<DateFieldComparison>;\n  description?: InputMaybe<StringFieldComparison>;\n  displayName?: InputMaybe<StringFieldComparison>;\n  environmentId?: InputMaybe<StringFieldComparison>;\n  id?: InputMaybe<StringFieldComparison>;\n  isLatest?: InputMaybe<BooleanFieldComparison>;\n  or?: InputMaybe<Array<PackageEntitlementFilterPackageDtoFilter>>;\n  productId?: InputMaybe<StringFieldComparison>;\n  refId?: InputMaybe<StringFieldComparison>;\n  status?: InputMaybe<PackageStatusFilterComparison>;\n  updatedAt?: InputMaybe<DateFieldComparison>;\n  versionNumber?: InputMaybe<IntFieldComparison>;\n};\n\nexport type PackageEntitlementInput = {\n  description?: InputMaybe<Scalars['String']>;\n  environmentId: Scalars['String'];\n  featureId: Scalars['String'];\n  hasUnlimitedUsage?: InputMaybe<Scalars['Boolean']>;\n  monthlyResetPeriodConfiguration?: InputMaybe<MonthlyResetPeriodConfigInput>;\n  packageId: Scalars['String'];\n  resetPeriod?: InputMaybe<EntitlementResetPeriod>;\n  usageLimit?: InputMaybe<Scalars['Float']>;\n  weeklyResetPeriodConfiguration?: InputMaybe<WeeklyResetPeriodConfigInput>;\n};\n\nexport type PackageEntitlementSort = {\n  direction: SortDirection;\n  field: PackageEntitlementSortFields;\n  nulls?: InputMaybe<SortNulls>;\n};\n\nexport enum PackageEntitlementSortFields {\n  CreatedAt = 'createdAt',\n  EnvironmentId = 'environmentId',\n  Id = 'id',\n  PackageId = 'packageId',\n  UpdatedAt = 'updatedAt',\n}\n\nexport type PackageEntitlementUpdateFilter = {\n  and?: InputMaybe<Array<PackageEntitlementUpdateFilter>>;\n  createdAt?: InputMaybe<DateFieldComparison>;\n  environmentId?: InputMaybe<StringFieldComparison>;\n  id?: InputMaybe<StringFieldComparison>;\n  or?: InputMaybe<Array<PackageEntitlementUpdateFilter>>;\n  packageId?: InputMaybe<StringFieldComparison>;\n  updatedAt?: InputMaybe<DateFieldComparison>;\n};\n\nexport type PackageEntitlementUpdateInput = {\n  description?: InputMaybe<Scalars['String']>;\n  hasUnlimitedUsage?: InputMaybe<Scalars['Boolean']>;\n  monthlyResetPeriodConfiguration?: InputMaybe<MonthlyResetPeriodConfigInput>;\n  resetPeriod?: InputMaybe<EntitlementResetPeriod>;\n  usageLimit?: InputMaybe<Scalars['Float']>;\n  weeklyResetPeriodConfiguration?: InputMaybe<WeeklyResetPeriodConfigInput>;\n};\n\nexport type PackagePublishInput = {\n  id: Scalars['ID'];\n  migrationType: PublishMigrationType;\n};\n\n/** Package status. */\nexport enum PackageStatus {\n  Draft = 'DRAFT',\n  Published = 'PUBLISHED',\n}\n\nexport type PackageStatusFilterComparison = {\n  eq?: InputMaybe<PackageStatus>;\n  gt?: InputMaybe<PackageStatus>;\n  gte?: InputMaybe<PackageStatus>;\n  iLike?: InputMaybe<PackageStatus>;\n  in?: InputMaybe<Array<PackageStatus>>;\n  is?: InputMaybe<Scalars['Boolean']>;\n  isNot?: InputMaybe<Scalars['Boolean']>;\n  like?: InputMaybe<PackageStatus>;\n  lt?: InputMaybe<PackageStatus>;\n  lte?: InputMaybe<PackageStatus>;\n  neq?: InputMaybe<PackageStatus>;\n  notILike?: InputMaybe<PackageStatus>;\n  notIn?: InputMaybe<Array<PackageStatus>>;\n  notLike?: InputMaybe<PackageStatus>;\n};\n\nexport type PlanCreateInput = {\n  billingId?: InputMaybe<Scalars['String']>;\n  description?: InputMaybe<Scalars['String']>;\n  displayName: Scalars['String'];\n  environmentId: Scalars['String'];\n  parentPlanId?: InputMaybe<Scalars['String']>;\n  productId: Scalars['String'];\n  refId: Scalars['String'];\n  status?: InputMaybe<PackageStatus>;\n};\n\nexport type PlanDeleteFilter = {\n  and?: InputMaybe<Array<PlanDeleteFilter>>;\n  billingId?: InputMaybe<StringFieldComparison>;\n  createdAt?: InputMaybe<DateFieldComparison>;\n  description?: InputMaybe<StringFieldComparison>;\n  displayName?: InputMaybe<StringFieldComparison>;\n  environmentId?: InputMaybe<StringFieldComparison>;\n  id?: InputMaybe<StringFieldComparison>;\n  isLatest?: InputMaybe<BooleanFieldComparison>;\n  or?: InputMaybe<Array<PlanDeleteFilter>>;\n  productId?: InputMaybe<StringFieldComparison>;\n  refId?: InputMaybe<StringFieldComparison>;\n  status?: InputMaybe<PackageStatusFilterComparison>;\n  updatedAt?: InputMaybe<DateFieldComparison>;\n  versionNumber?: InputMaybe<IntFieldComparison>;\n};\n\nexport type PlanFilter = {\n  and?: InputMaybe<Array<PlanFilter>>;\n  billingId?: InputMaybe<StringFieldComparison>;\n  createdAt?: InputMaybe<DateFieldComparison>;\n  description?: InputMaybe<StringFieldComparison>;\n  displayName?: InputMaybe<StringFieldComparison>;\n  environmentId?: InputMaybe<StringFieldComparison>;\n  id?: InputMaybe<StringFieldComparison>;\n  isLatest?: InputMaybe<BooleanFieldComparison>;\n  or?: InputMaybe<Array<PlanFilter>>;\n  productId?: InputMaybe<StringFieldComparison>;\n  refId?: InputMaybe<StringFieldComparison>;\n  status?: InputMaybe<PackageStatusFilterComparison>;\n  updatedAt?: InputMaybe<DateFieldComparison>;\n  versionNumber?: InputMaybe<IntFieldComparison>;\n};\n\nexport type PlanSort = {\n  direction: SortDirection;\n  field: PlanSortFields;\n  nulls?: InputMaybe<SortNulls>;\n};\n\nexport enum PlanSortFields {\n  BillingId = 'billingId',\n  CreatedAt = 'createdAt',\n  Description = 'description',\n  DisplayName = 'displayName',\n  EnvironmentId = 'environmentId',\n  Id = 'id',\n  IsLatest = 'isLatest',\n  ProductId = 'productId',\n  RefId = 'refId',\n  Status = 'status',\n  UpdatedAt = 'updatedAt',\n  VersionNumber = 'versionNumber',\n}\n\nexport type PlanUpdateInput = {\n  billingId?: InputMaybe<Scalars['String']>;\n  defaultTrialConfig?: InputMaybe<DefaultTrialConfigInputDto>;\n  description?: InputMaybe<Scalars['String']>;\n  displayName?: InputMaybe<Scalars['String']>;\n  id: Scalars['String'];\n  parentPlanId?: InputMaybe<Scalars['String']>;\n  status?: InputMaybe<PackageStatus>;\n};\n\nexport type PriceCreateInput = {\n  billingModel: BillingModel;\n  billingPeriod: BillingPeriod;\n  environmentId: Scalars['String'];\n  featureId?: InputMaybe<Scalars['String']>;\n  packageId: Scalars['String'];\n  price: MoneyInputDto;\n};\n\nexport type PriceDeleteFilter = {\n  and?: InputMaybe<Array<PriceDeleteFilter>>;\n  billingModel?: InputMaybe<BillingModelFilterComparison>;\n  billingPeriod?: InputMaybe<BillingPeriodFilterComparison>;\n  id?: InputMaybe<StringFieldComparison>;\n  or?: InputMaybe<Array<PriceDeleteFilter>>;\n};\n\nexport type PriceFilter = {\n  and?: InputMaybe<Array<PriceFilter>>;\n  billingModel?: InputMaybe<BillingModelFilterComparison>;\n  billingPeriod?: InputMaybe<BillingPeriodFilterComparison>;\n  id?: InputMaybe<StringFieldComparison>;\n  or?: InputMaybe<Array<PriceFilter>>;\n  package?: InputMaybe<PriceFilterPackageDtoFilter>;\n};\n\nexport type PriceFilterPackageDtoFilter = {\n  and?: InputMaybe<Array<PriceFilterPackageDtoFilter>>;\n  billingId?: InputMaybe<StringFieldComparison>;\n  createdAt?: InputMaybe<DateFieldComparison>;\n  description?: InputMaybe<StringFieldComparison>;\n  displayName?: InputMaybe<StringFieldComparison>;\n  environmentId?: InputMaybe<StringFieldComparison>;\n  id?: InputMaybe<StringFieldComparison>;\n  isLatest?: InputMaybe<BooleanFieldComparison>;\n  or?: InputMaybe<Array<PriceFilterPackageDtoFilter>>;\n  productId?: InputMaybe<StringFieldComparison>;\n  refId?: InputMaybe<StringFieldComparison>;\n  status?: InputMaybe<PackageStatusFilterComparison>;\n  updatedAt?: InputMaybe<DateFieldComparison>;\n  versionNumber?: InputMaybe<IntFieldComparison>;\n};\n\nexport type PriceSort = {\n  direction: SortDirection;\n  field: PriceSortFields;\n  nulls?: InputMaybe<SortNulls>;\n};\n\nexport enum PriceSortFields {\n  BillingModel = 'billingModel',\n  BillingPeriod = 'billingPeriod',\n  Id = 'id',\n}\n\nexport type PriceUpdateInput = {\n  billingModel: BillingModel;\n  billingPeriod: BillingPeriod;\n  environmentId: Scalars['String'];\n  featureId?: InputMaybe<Scalars['String']>;\n  id: Scalars['String'];\n  packageId: Scalars['String'];\n  price: MoneyInputDto;\n};\n\nexport type ProductCreateInput = {\n  description?: InputMaybe<Scalars['String']>;\n  displayName?: InputMaybe<Scalars['String']>;\n  environmentId: Scalars['String'];\n  refId: Scalars['String'];\n};\n\nexport type ProductDeleteFilter = {\n  and?: InputMaybe<Array<ProductDeleteFilter>>;\n  createdAt?: InputMaybe<DateFieldComparison>;\n  description?: InputMaybe<StringFieldComparison>;\n  displayName?: InputMaybe<StringFieldComparison>;\n  environmentId?: InputMaybe<StringFieldComparison>;\n  id?: InputMaybe<StringFieldComparison>;\n  isDefaultProduct?: InputMaybe<BooleanFieldComparison>;\n  or?: InputMaybe<Array<ProductDeleteFilter>>;\n  refId?: InputMaybe<StringFieldComparison>;\n  updatedAt?: InputMaybe<DateFieldComparison>;\n};\n\nexport type ProductFilter = {\n  and?: InputMaybe<Array<ProductFilter>>;\n  createdAt?: InputMaybe<DateFieldComparison>;\n  description?: InputMaybe<StringFieldComparison>;\n  displayName?: InputMaybe<StringFieldComparison>;\n  environmentId?: InputMaybe<StringFieldComparison>;\n  id?: InputMaybe<StringFieldComparison>;\n  isDefaultProduct?: InputMaybe<BooleanFieldComparison>;\n  or?: InputMaybe<Array<ProductFilter>>;\n  refId?: InputMaybe<StringFieldComparison>;\n  updatedAt?: InputMaybe<DateFieldComparison>;\n};\n\nexport type ProductSort = {\n  direction: SortDirection;\n  field: ProductSortFields;\n  nulls?: InputMaybe<SortNulls>;\n};\n\nexport enum ProductSortFields {\n  CreatedAt = 'createdAt',\n  Description = 'description',\n  DisplayName = 'displayName',\n  EnvironmentId = 'environmentId',\n  Id = 'id',\n  IsDefaultProduct = 'isDefaultProduct',\n  RefId = 'refId',\n  UpdatedAt = 'updatedAt',\n}\n\nexport type ProductUpdateFilter = {\n  and?: InputMaybe<Array<ProductUpdateFilter>>;\n  createdAt?: InputMaybe<DateFieldComparison>;\n  description?: InputMaybe<StringFieldComparison>;\n  displayName?: InputMaybe<StringFieldComparison>;\n  environmentId?: InputMaybe<StringFieldComparison>;\n  id?: InputMaybe<StringFieldComparison>;\n  isDefaultProduct?: InputMaybe<BooleanFieldComparison>;\n  or?: InputMaybe<Array<ProductUpdateFilter>>;\n  refId?: InputMaybe<StringFieldComparison>;\n  updatedAt?: InputMaybe<DateFieldComparison>;\n};\n\nexport type ProductUpdateInput = {\n  description?: InputMaybe<Scalars['String']>;\n  displayName?: InputMaybe<Scalars['String']>;\n  downgradePlanId?: InputMaybe<Scalars['String']>;\n  trialSetup?: InputMaybe<TrialSetup>;\n};\n\nexport type PromotionalEntitlementDeleteFilter = {\n  and?: InputMaybe<Array<PromotionalEntitlementDeleteFilter>>;\n  createdAt?: InputMaybe<DateFieldComparison>;\n  environmentId?: InputMaybe<StringFieldComparison>;\n  id?: InputMaybe<StringFieldComparison>;\n  or?: InputMaybe<Array<PromotionalEntitlementDeleteFilter>>;\n  status?: InputMaybe<PromotionalEntitlementStatusFilterComparison>;\n  updatedAt?: InputMaybe<DateFieldComparison>;\n};\n\nexport type PromotionalEntitlementFilter = {\n  and?: InputMaybe<Array<PromotionalEntitlementFilter>>;\n  createdAt?: InputMaybe<DateFieldComparison>;\n  environmentId?: InputMaybe<StringFieldComparison>;\n  id?: InputMaybe<StringFieldComparison>;\n  or?: InputMaybe<Array<PromotionalEntitlementFilter>>;\n  status?: InputMaybe<PromotionalEntitlementStatusFilterComparison>;\n  updatedAt?: InputMaybe<DateFieldComparison>;\n};\n\nexport type PromotionalEntitlementInput = {\n  customerId: Scalars['String'];\n  description?: InputMaybe<Scalars['String']>;\n  endDate?: InputMaybe<Scalars['DateTime']>;\n  environmentId: Scalars['String'];\n  featureId: Scalars['String'];\n  hasUnlimitedUsage?: InputMaybe<Scalars['Boolean']>;\n  isVisible: Scalars['Boolean'];\n  monthlyResetPeriodConfiguration?: InputMaybe<MonthlyResetPeriodConfigInput>;\n  period: PromotionalEntitlementPeriod;\n  resetPeriod?: InputMaybe<EntitlementResetPeriod>;\n  usageLimit?: InputMaybe<Scalars['Float']>;\n  weeklyResetPeriodConfiguration?: InputMaybe<WeeklyResetPeriodConfigInput>;\n};\n\n/** Promotional entitlement duration */\nexport enum PromotionalEntitlementPeriod {\n  Custom = 'CUSTOM',\n  Lifetime = 'LIFETIME',\n  OneMonth = 'ONE_MONTH',\n  OneWeek = 'ONE_WEEK',\n  OneYear = 'ONE_YEAR',\n  SixMonth = 'SIX_MONTH',\n}\n\nexport type PromotionalEntitlementSort = {\n  direction: SortDirection;\n  field: PromotionalEntitlementSortFields;\n  nulls?: InputMaybe<SortNulls>;\n};\n\nexport enum PromotionalEntitlementSortFields {\n  CreatedAt = 'createdAt',\n  EnvironmentId = 'environmentId',\n  Id = 'id',\n  Status = 'status',\n  UpdatedAt = 'updatedAt',\n}\n\n/** Promotional entitlement status */\nexport enum PromotionalEntitlementStatus {\n  Active = 'Active',\n  Expired = 'Expired',\n  Paused = 'Paused',\n}\n\nexport type PromotionalEntitlementStatusFilterComparison = {\n  eq?: InputMaybe<PromotionalEntitlementStatus>;\n  gt?: InputMaybe<PromotionalEntitlementStatus>;\n  gte?: InputMaybe<PromotionalEntitlementStatus>;\n  iLike?: InputMaybe<PromotionalEntitlementStatus>;\n  in?: InputMaybe<Array<PromotionalEntitlementStatus>>;\n  is?: InputMaybe<Scalars['Boolean']>;\n  isNot?: InputMaybe<Scalars['Boolean']>;\n  like?: InputMaybe<PromotionalEntitlementStatus>;\n  lt?: InputMaybe<PromotionalEntitlementStatus>;\n  lte?: InputMaybe<PromotionalEntitlementStatus>;\n  neq?: InputMaybe<PromotionalEntitlementStatus>;\n  notILike?: InputMaybe<PromotionalEntitlementStatus>;\n  notIn?: InputMaybe<Array<PromotionalEntitlementStatus>>;\n  notLike?: InputMaybe<PromotionalEntitlementStatus>;\n};\n\nexport type PromotionalEntitlementUpdateFilter = {\n  and?: InputMaybe<Array<PromotionalEntitlementUpdateFilter>>;\n  createdAt?: InputMaybe<DateFieldComparison>;\n  environmentId?: InputMaybe<StringFieldComparison>;\n  id?: InputMaybe<StringFieldComparison>;\n  or?: InputMaybe<Array<PromotionalEntitlementUpdateFilter>>;\n  status?: InputMaybe<PromotionalEntitlementStatusFilterComparison>;\n  updatedAt?: InputMaybe<DateFieldComparison>;\n};\n\nexport type PromotionalEntitlementUpdateInput = {\n  description?: InputMaybe<Scalars['String']>;\n  endDate?: InputMaybe<Scalars['DateTime']>;\n  hasUnlimitedUsage?: InputMaybe<Scalars['Boolean']>;\n  isVisible: Scalars['Boolean'];\n  monthlyResetPeriodConfiguration?: InputMaybe<MonthlyResetPeriodConfigInput>;\n  period: PromotionalEntitlementPeriod;\n  resetPeriod?: InputMaybe<EntitlementResetPeriod>;\n  usageLimit?: InputMaybe<Scalars['Float']>;\n  weeklyResetPeriodConfiguration?: InputMaybe<WeeklyResetPeriodConfigInput>;\n};\n\n/** PublishMigrationType */\nexport enum PublishMigrationType {\n  AllCustomers = 'ALL_CUSTOMERS',\n  NewCustomers = 'NEW_CUSTOMERS',\n}\n\nexport type RemoveAccountFromEnvironmentInput = {\n  /** The id of the record. */\n  id: Scalars['String'];\n  /** The id of relation. */\n  relationId: Scalars['String'];\n};\n\nexport type RemoveAccountFromFeatureInput = {\n  /** The id of the record. */\n  id: Scalars['String'];\n  /** The id of relation. */\n  relationId: Scalars['String'];\n};\n\nexport type RemoveAccountFromHookInput = {\n  /** The id of the record. */\n  id: Scalars['String'];\n  /** The id of relation. */\n  relationId: Scalars['String'];\n};\n\nexport type RemoveAccountFromIntegrationInput = {\n  /** The id of the record. */\n  id: Scalars['String'];\n  /** The id of relation. */\n  relationId: Scalars['String'];\n};\n\nexport type RemoveAccountFromMemberInput = {\n  /** The id of the record. */\n  id: Scalars['String'];\n  /** The id of relation. */\n  relationId: Scalars['String'];\n};\n\nexport type RemoveAddonFromSubscriptionAddonInput = {\n  /** The id of the record. */\n  id: Scalars['String'];\n  /** The id of relation. */\n  relationId: Scalars['String'];\n};\n\nexport type RemoveAddonsFromCustomerSubscriptionInput = {\n  /** The id of the record. */\n  id: Scalars['String'];\n  /** The ids of the relations. */\n  relationIds: Array<Scalars['String']>;\n};\n\nexport type RemoveBasePlanFromPlanInput = {\n  /** The id of the record. */\n  id: Scalars['String'];\n  /** The id of relation. */\n  relationId: Scalars['String'];\n};\n\nexport type RemoveCompatibleAddonsFromPlanInput = {\n  /** The id of the record. */\n  id: Scalars['String'];\n  /** The ids of the relations. */\n  relationIds: Array<Scalars['String']>;\n};\n\nexport type RemoveCustomerFromCustomerSubscriptionInput = {\n  /** The id of the record. */\n  id: Scalars['String'];\n  /** The id of relation. */\n  relationId: Scalars['String'];\n};\n\nexport type RemoveCustomerFromPromotionalEntitlementInput = {\n  /** The id of the record. */\n  id: Scalars['String'];\n  /** The id of relation. */\n  relationId: Scalars['String'];\n};\n\nexport type RemoveCustomerFromUsageMeasurementInput = {\n  /** The id of the record. */\n  id: Scalars['String'];\n  /** The id of relation. */\n  relationId: Scalars['String'];\n};\n\nexport type RemoveDowngradePlanFromProductInput = {\n  /** The id of the record. */\n  id: Scalars['String'];\n  /** The id of relation. */\n  relationId: Scalars['String'];\n};\n\nexport type RemoveEnvironmentFromAddonInput = {\n  /** The id of the record. */\n  id: Scalars['String'];\n  /** The id of relation. */\n  relationId: Scalars['String'];\n};\n\nexport type RemoveEnvironmentFromCustomerInput = {\n  /** The id of the record. */\n  id: Scalars['String'];\n  /** The id of relation. */\n  relationId: Scalars['String'];\n};\n\nexport type RemoveEnvironmentFromCustomerSubscriptionInput = {\n  /** The id of the record. */\n  id: Scalars['String'];\n  /** The id of relation. */\n  relationId: Scalars['String'];\n};\n\nexport type RemoveEnvironmentFromEventLogInput = {\n  /** The id of the record. */\n  id: Scalars['String'];\n  /** The id of relation. */\n  relationId: Scalars['String'];\n};\n\nexport type RemoveEnvironmentFromFeatureInput = {\n  /** The id of the record. */\n  id: Scalars['String'];\n  /** The id of relation. */\n  relationId: Scalars['String'];\n};\n\nexport type RemoveEnvironmentFromHookInput = {\n  /** The id of the record. */\n  id: Scalars['String'];\n  /** The id of relation. */\n  relationId: Scalars['String'];\n};\n\nexport type RemoveEnvironmentFromIntegrationInput = {\n  /** The id of the record. */\n  id: Scalars['String'];\n  /** The id of relation. */\n  relationId: Scalars['String'];\n};\n\nexport type RemoveEnvironmentFromPlanInput = {\n  /** The id of the record. */\n  id: Scalars['String'];\n  /** The id of relation. */\n  relationId: Scalars['String'];\n};\n\nexport type RemoveEnvironmentFromProductInput = {\n  /** The id of the record. */\n  id: Scalars['String'];\n  /** The id of relation. */\n  relationId: Scalars['String'];\n};\n\nexport type RemoveEnvironmentFromUsageMeasurementInput = {\n  /** The id of the record. */\n  id: Scalars['String'];\n  /** The id of relation. */\n  relationId: Scalars['String'];\n};\n\nexport type RemoveFeatureFromPackageEntitlementInput = {\n  /** The id of the record. */\n  id: Scalars['String'];\n  /** The id of relation. */\n  relationId: Scalars['String'];\n};\n\nexport type RemoveFeatureFromPromotionalEntitlementInput = {\n  /** The id of the record. */\n  id: Scalars['String'];\n  /** The id of relation. */\n  relationId: Scalars['String'];\n};\n\nexport type RemoveFeatureFromUsageMeasurementInput = {\n  /** The id of the record. */\n  id: Scalars['String'];\n  /** The id of relation. */\n  relationId: Scalars['String'];\n};\n\nexport type RemovePackageFromPackageEntitlementInput = {\n  /** The id of the record. */\n  id: Scalars['String'];\n  /** The id of relation. */\n  relationId: Scalars['String'];\n};\n\nexport type RemovePackageFromPriceInput = {\n  /** The id of the record. */\n  id: Scalars['String'];\n  /** The id of relation. */\n  relationId: Scalars['String'];\n};\n\nexport type RemovePlanFromCustomerSubscriptionInput = {\n  /** The id of the record. */\n  id: Scalars['String'];\n  /** The id of relation. */\n  relationId: Scalars['String'];\n};\n\nexport type RemovePriceFromSubscriptionAddonInput = {\n  /** The id of the record. */\n  id: Scalars['String'];\n  /** The id of relation. */\n  relationId: Scalars['String'];\n};\n\nexport type RemovePriceFromSubscriptionPriceInput = {\n  /** The id of the record. */\n  id: Scalars['String'];\n  /** The id of relation. */\n  relationId: Scalars['String'];\n};\n\nexport type RemovePricesFromAddonInput = {\n  /** The id of the record. */\n  id: Scalars['String'];\n  /** The ids of the relations. */\n  relationIds: Array<Scalars['String']>;\n};\n\nexport type RemovePricesFromCustomerSubscriptionInput = {\n  /** The id of the record. */\n  id: Scalars['String'];\n  /** The ids of the relations. */\n  relationIds: Array<Scalars['String']>;\n};\n\nexport type RemovePricesFromPlanInput = {\n  /** The id of the record. */\n  id: Scalars['String'];\n  /** The ids of the relations. */\n  relationIds: Array<Scalars['String']>;\n};\n\nexport type RemoveSubscriptionFromSubscriptionAddonInput = {\n  /** The id of the record. */\n  id: Scalars['String'];\n  /** The id of relation. */\n  relationId: Scalars['String'];\n};\n\nexport type RemoveSubscriptionFromSubscriptionPriceInput = {\n  /** The id of the record. */\n  id: Scalars['String'];\n  /** The id of relation. */\n  relationId: Scalars['String'];\n};\n\nexport type RemoveUserFromMemberInput = {\n  /** The id of the record. */\n  id: Scalars['String'];\n  /** The id of relation. */\n  relationId: Scalars['String'];\n};\n\nexport type SetAccountOnEnvironmentInput = {\n  /** The id of the record. */\n  id: Scalars['String'];\n  /** The id of relation. */\n  relationId: Scalars['String'];\n};\n\nexport type SetAccountOnFeatureInput = {\n  /** The id of the record. */\n  id: Scalars['String'];\n  /** The id of relation. */\n  relationId: Scalars['String'];\n};\n\nexport type SetAccountOnHookInput = {\n  /** The id of the record. */\n  id: Scalars['String'];\n  /** The id of relation. */\n  relationId: Scalars['String'];\n};\n\nexport type SetAccountOnIntegrationInput = {\n  /** The id of the record. */\n  id: Scalars['String'];\n  /** The id of relation. */\n  relationId: Scalars['String'];\n};\n\nexport type SetAccountOnMemberInput = {\n  /** The id of the record. */\n  id: Scalars['String'];\n  /** The id of relation. */\n  relationId: Scalars['String'];\n};\n\nexport type SetAddonOnSubscriptionAddonInput = {\n  /** The id of the record. */\n  id: Scalars['String'];\n  /** The id of relation. */\n  relationId: Scalars['String'];\n};\n\nexport type SetAddonsOnCustomerSubscriptionInput = {\n  /** The id of the record. */\n  id: Scalars['String'];\n  /** The ids of the relations. */\n  relationIds: Array<Scalars['String']>;\n};\n\nexport type SetApiKeysOnEnvironmentInput = {\n  /** The id of the record. */\n  id: Scalars['String'];\n  /** The ids of the relations. */\n  relationIds: Array<Scalars['String']>;\n};\n\nexport type SetBasePlanOnPlanInput = {\n  /** The id of the record. */\n  id: Scalars['String'];\n  /** The id of relation. */\n  relationId: Scalars['String'];\n};\n\nexport type SetCompatibleAddonsOnPlanInput = {\n  /** The id of the record. */\n  id: Scalars['String'];\n  /** The ids of the relations. */\n  relationIds: Array<Scalars['String']>;\n};\n\nexport type SetCustomerOnCustomerSubscriptionInput = {\n  /** The id of the record. */\n  id: Scalars['String'];\n  /** The id of relation. */\n  relationId: Scalars['String'];\n};\n\nexport type SetCustomerOnPromotionalEntitlementInput = {\n  /** The id of the record. */\n  id: Scalars['String'];\n  /** The id of relation. */\n  relationId: Scalars['String'];\n};\n\nexport type SetCustomerOnUsageMeasurementInput = {\n  /** The id of the record. */\n  id: Scalars['String'];\n  /** The id of relation. */\n  relationId: Scalars['String'];\n};\n\nexport type SetDowngradePlanOnProductInput = {\n  /** The id of the record. */\n  id: Scalars['String'];\n  /** The id of relation. */\n  relationId: Scalars['String'];\n};\n\nexport type SetEnvironmentOnAddonInput = {\n  /** The id of the record. */\n  id: Scalars['String'];\n  /** The id of relation. */\n  relationId: Scalars['String'];\n};\n\nexport type SetEnvironmentOnCustomerInput = {\n  /** The id of the record. */\n  id: Scalars['String'];\n  /** The id of relation. */\n  relationId: Scalars['String'];\n};\n\nexport type SetEnvironmentOnCustomerSubscriptionInput = {\n  /** The id of the record. */\n  id: Scalars['String'];\n  /** The id of relation. */\n  relationId: Scalars['String'];\n};\n\nexport type SetEnvironmentOnEventLogInput = {\n  /** The id of the record. */\n  id: Scalars['String'];\n  /** The id of relation. */\n  relationId: Scalars['String'];\n};\n\nexport type SetEnvironmentOnFeatureInput = {\n  /** The id of the record. */\n  id: Scalars['String'];\n  /** The id of relation. */\n  relationId: Scalars['String'];\n};\n\nexport type SetEnvironmentOnHookInput = {\n  /** The id of the record. */\n  id: Scalars['String'];\n  /** The id of relation. */\n  relationId: Scalars['String'];\n};\n\nexport type SetEnvironmentOnIntegrationInput = {\n  /** The id of the record. */\n  id: Scalars['String'];\n  /** The id of relation. */\n  relationId: Scalars['String'];\n};\n\nexport type SetEnvironmentOnPlanInput = {\n  /** The id of the record. */\n  id: Scalars['String'];\n  /** The id of relation. */\n  relationId: Scalars['String'];\n};\n\nexport type SetEnvironmentOnProductInput = {\n  /** The id of the record. */\n  id: Scalars['String'];\n  /** The id of relation. */\n  relationId: Scalars['String'];\n};\n\nexport type SetEnvironmentOnUsageMeasurementInput = {\n  /** The id of the record. */\n  id: Scalars['String'];\n  /** The id of relation. */\n  relationId: Scalars['String'];\n};\n\nexport type SetFeatureOnPackageEntitlementInput = {\n  /** The id of the record. */\n  id: Scalars['String'];\n  /** The id of relation. */\n  relationId: Scalars['String'];\n};\n\nexport type SetFeatureOnPromotionalEntitlementInput = {\n  /** The id of the record. */\n  id: Scalars['String'];\n  /** The id of relation. */\n  relationId: Scalars['String'];\n};\n\nexport type SetFeatureOnUsageMeasurementInput = {\n  /** The id of the record. */\n  id: Scalars['String'];\n  /** The id of relation. */\n  relationId: Scalars['String'];\n};\n\nexport type SetPackageOnPackageEntitlementInput = {\n  /** The id of the record. */\n  id: Scalars['String'];\n  /** The id of relation. */\n  relationId: Scalars['String'];\n};\n\nexport type SetPackageOnPriceInput = {\n  /** The id of the record. */\n  id: Scalars['String'];\n  /** The id of relation. */\n  relationId: Scalars['String'];\n};\n\nexport type SetPlanOnCustomerSubscriptionInput = {\n  /** The id of the record. */\n  id: Scalars['String'];\n  /** The id of relation. */\n  relationId: Scalars['String'];\n};\n\nexport type SetPriceOnSubscriptionAddonInput = {\n  /** The id of the record. */\n  id: Scalars['String'];\n  /** The id of relation. */\n  relationId: Scalars['String'];\n};\n\nexport type SetPriceOnSubscriptionPriceInput = {\n  /** The id of the record. */\n  id: Scalars['String'];\n  /** The id of relation. */\n  relationId: Scalars['String'];\n};\n\nexport type SetPricesOnAddonInput = {\n  /** The id of the record. */\n  id: Scalars['String'];\n  /** The ids of the relations. */\n  relationIds: Array<Scalars['String']>;\n};\n\nexport type SetPricesOnCustomerSubscriptionInput = {\n  /** The id of the record. */\n  id: Scalars['String'];\n  /** The ids of the relations. */\n  relationIds: Array<Scalars['String']>;\n};\n\nexport type SetPricesOnPlanInput = {\n  /** The id of the record. */\n  id: Scalars['String'];\n  /** The ids of the relations. */\n  relationIds: Array<Scalars['String']>;\n};\n\nexport type SetProductOnAddonInput = {\n  /** The id of the record. */\n  id: Scalars['String'];\n  /** The id of relation. */\n  relationId: Scalars['String'];\n};\n\nexport type SetProductOnPlanInput = {\n  /** The id of the record. */\n  id: Scalars['String'];\n  /** The id of relation. */\n  relationId: Scalars['String'];\n};\n\nexport type SetSubscriptionOnSubscriptionAddonInput = {\n  /** The id of the record. */\n  id: Scalars['String'];\n  /** The id of relation. */\n  relationId: Scalars['String'];\n};\n\nexport type SetSubscriptionOnSubscriptionPriceInput = {\n  /** The id of the record. */\n  id: Scalars['String'];\n  /** The id of relation. */\n  relationId: Scalars['String'];\n};\n\nexport type SetSubscriptionsOnCustomerInput = {\n  /** The id of the record. */\n  id: Scalars['String'];\n  /** The ids of the relations. */\n  relationIds: Array<Scalars['String']>;\n};\n\nexport type SetUserOnMemberInput = {\n  /** The id of the record. */\n  id: Scalars['String'];\n  /** The id of relation. */\n  relationId: Scalars['String'];\n};\n\n/** Sort Directions */\nexport enum SortDirection {\n  Asc = 'ASC',\n  Desc = 'DESC',\n}\n\n/** Sort Nulls Options */\nexport enum SortNulls {\n  NullsFirst = 'NULLS_FIRST',\n  NullsLast = 'NULLS_LAST',\n}\n\nexport type StringFieldComparison = {\n  eq?: InputMaybe<Scalars['String']>;\n  gt?: InputMaybe<Scalars['String']>;\n  gte?: InputMaybe<Scalars['String']>;\n  iLike?: InputMaybe<Scalars['String']>;\n  in?: InputMaybe<Array<Scalars['String']>>;\n  is?: InputMaybe<Scalars['Boolean']>;\n  isNot?: InputMaybe<Scalars['Boolean']>;\n  like?: InputMaybe<Scalars['String']>;\n  lt?: InputMaybe<Scalars['String']>;\n  lte?: InputMaybe<Scalars['String']>;\n  neq?: InputMaybe<Scalars['String']>;\n  notILike?: InputMaybe<Scalars['String']>;\n  notIn?: InputMaybe<Array<Scalars['String']>>;\n  notLike?: InputMaybe<Scalars['String']>;\n};\n\nexport type StripeCredentialsInput = {\n  accountId?: InputMaybe<Scalars['String']>;\n  authorizationCode: Scalars['String'];\n  isTestMode: Scalars['Boolean'];\n};\n\nexport type SubscriptionAddonFilter = {\n  addon?: InputMaybe<SubscriptionAddonFilterAddonFilter>;\n  and?: InputMaybe<Array<SubscriptionAddonFilter>>;\n  id?: InputMaybe<StringFieldComparison>;\n  or?: InputMaybe<Array<SubscriptionAddonFilter>>;\n  price?: InputMaybe<SubscriptionAddonFilterPriceFilter>;\n  quantity?: InputMaybe<NumberFieldComparison>;\n  subscription?: InputMaybe<SubscriptionAddonFilterCustomerSubscriptionFilter>;\n  updatedAt?: InputMaybe<DateFieldComparison>;\n};\n\nexport type SubscriptionAddonFilterAddonFilter = {\n  and?: InputMaybe<Array<SubscriptionAddonFilterAddonFilter>>;\n  billingId?: InputMaybe<StringFieldComparison>;\n  createdAt?: InputMaybe<DateFieldComparison>;\n  description?: InputMaybe<StringFieldComparison>;\n  displayName?: InputMaybe<StringFieldComparison>;\n  environmentId?: InputMaybe<StringFieldComparison>;\n  id?: InputMaybe<StringFieldComparison>;\n  isLatest?: InputMaybe<BooleanFieldComparison>;\n  or?: InputMaybe<Array<SubscriptionAddonFilterAddonFilter>>;\n  productId?: InputMaybe<StringFieldComparison>;\n  refId?: InputMaybe<StringFieldComparison>;\n  status?: InputMaybe<PackageStatusFilterComparison>;\n  updatedAt?: InputMaybe<DateFieldComparison>;\n  versionNumber?: InputMaybe<IntFieldComparison>;\n};\n\nexport type SubscriptionAddonFilterCustomerSubscriptionFilter = {\n  and?: InputMaybe<Array<SubscriptionAddonFilterCustomerSubscriptionFilter>>;\n  billingId?: InputMaybe<StringFieldComparison>;\n  crmId?: InputMaybe<StringFieldComparison>;\n  endDate?: InputMaybe<DateFieldComparison>;\n  environmentId?: InputMaybe<StringFieldComparison>;\n  id?: InputMaybe<StringFieldComparison>;\n  or?: InputMaybe<Array<SubscriptionAddonFilterCustomerSubscriptionFilter>>;\n  refId?: InputMaybe<StringFieldComparison>;\n  startDate?: InputMaybe<DateFieldComparison>;\n  status?: InputMaybe<SubscriptionStatusFilterComparison>;\n};\n\nexport type SubscriptionAddonFilterPriceFilter = {\n  and?: InputMaybe<Array<SubscriptionAddonFilterPriceFilter>>;\n  billingModel?: InputMaybe<BillingModelFilterComparison>;\n  billingPeriod?: InputMaybe<BillingPeriodFilterComparison>;\n  id?: InputMaybe<StringFieldComparison>;\n  or?: InputMaybe<Array<SubscriptionAddonFilterPriceFilter>>;\n};\n\nexport type SubscriptionAddonInput = {\n  addonId: Scalars['String'];\n  billingPeriod: BillingPeriod;\n  quantity?: InputMaybe<Scalars['Int']>;\n};\n\nexport type SubscriptionAddonSort = {\n  direction: SortDirection;\n  field: SubscriptionAddonSortFields;\n  nulls?: InputMaybe<SortNulls>;\n};\n\nexport enum SubscriptionAddonSortFields {\n  Id = 'id',\n  Quantity = 'quantity',\n  UpdatedAt = 'updatedAt',\n}\n\nexport type SubscriptionInput = {\n  addons?: InputMaybe<Array<SubscriptionAddonInput>>;\n  billingId?: InputMaybe<Scalars['String']>;\n  billingPeriod: BillingPeriod;\n  crmId?: InputMaybe<Scalars['String']>;\n  customerId: Scalars['String'];\n  endDate?: InputMaybe<Scalars['DateTime']>;\n  environmentId: Scalars['String'];\n  isTrial?: InputMaybe<Scalars['Boolean']>;\n  planId: Scalars['String'];\n  priceUnitAmount?: InputMaybe<Scalars['Float']>;\n  refId?: InputMaybe<Scalars['String']>;\n  startDate: Scalars['DateTime'];\n};\n\nexport type SubscriptionMigrationInput = {\n  subscriptionId: Scalars['String'];\n};\n\nexport type SubscriptionPriceFilter = {\n  and?: InputMaybe<Array<SubscriptionPriceFilter>>;\n  id?: InputMaybe<StringFieldComparison>;\n  or?: InputMaybe<Array<SubscriptionPriceFilter>>;\n  price?: InputMaybe<SubscriptionPriceFilterPriceFilter>;\n  subscription?: InputMaybe<SubscriptionPriceFilterCustomerSubscriptionFilter>;\n  updatedAt?: InputMaybe<DateFieldComparison>;\n  usageLimit?: InputMaybe<NumberFieldComparison>;\n};\n\nexport type SubscriptionPriceFilterCustomerSubscriptionFilter = {\n  and?: InputMaybe<Array<SubscriptionPriceFilterCustomerSubscriptionFilter>>;\n  billingId?: InputMaybe<StringFieldComparison>;\n  crmId?: InputMaybe<StringFieldComparison>;\n  endDate?: InputMaybe<DateFieldComparison>;\n  environmentId?: InputMaybe<StringFieldComparison>;\n  id?: InputMaybe<StringFieldComparison>;\n  or?: InputMaybe<Array<SubscriptionPriceFilterCustomerSubscriptionFilter>>;\n  refId?: InputMaybe<StringFieldComparison>;\n  startDate?: InputMaybe<DateFieldComparison>;\n  status?: InputMaybe<SubscriptionStatusFilterComparison>;\n};\n\nexport type SubscriptionPriceFilterPriceFilter = {\n  and?: InputMaybe<Array<SubscriptionPriceFilterPriceFilter>>;\n  billingModel?: InputMaybe<BillingModelFilterComparison>;\n  billingPeriod?: InputMaybe<BillingPeriodFilterComparison>;\n  id?: InputMaybe<StringFieldComparison>;\n  or?: InputMaybe<Array<SubscriptionPriceFilterPriceFilter>>;\n};\n\nexport type SubscriptionPriceSort = {\n  direction: SortDirection;\n  field: SubscriptionPriceSortFields;\n  nulls?: InputMaybe<SortNulls>;\n};\n\nexport enum SubscriptionPriceSortFields {\n  Id = 'id',\n  UpdatedAt = 'updatedAt',\n  UsageLimit = 'usageLimit',\n}\n\n/** Subscription status */\nexport enum SubscriptionStatus {\n  Active = 'ACTIVE',\n  Expired = 'EXPIRED',\n  Inactive = 'INACTIVE',\n  InTrial = 'IN_TRIAL',\n}\n\nexport type SubscriptionStatusFilterComparison = {\n  eq?: InputMaybe<SubscriptionStatus>;\n  gt?: InputMaybe<SubscriptionStatus>;\n  gte?: InputMaybe<SubscriptionStatus>;\n  iLike?: InputMaybe<SubscriptionStatus>;\n  in?: InputMaybe<Array<SubscriptionStatus>>;\n  is?: InputMaybe<Scalars['Boolean']>;\n  isNot?: InputMaybe<Scalars['Boolean']>;\n  like?: InputMaybe<SubscriptionStatus>;\n  lt?: InputMaybe<SubscriptionStatus>;\n  lte?: InputMaybe<SubscriptionStatus>;\n  neq?: InputMaybe<SubscriptionStatus>;\n  notILike?: InputMaybe<SubscriptionStatus>;\n  notIn?: InputMaybe<Array<SubscriptionStatus>>;\n  notLike?: InputMaybe<SubscriptionStatus>;\n};\n\nexport type TestHookInput = {\n  endpointUrl: Scalars['String'];\n  hookEventType: EventLogType;\n};\n\n/** day or month. */\nexport enum TrialPeriodUnits {\n  Day = 'DAY',\n  Month = 'MONTH',\n}\n\nexport enum TrialSetup {\n  CancelSubscription = 'CANCEL_SUBSCRIPTION',\n  DowngradeToFree = 'DOWNGRADE_TO_FREE',\n  NoTrials = 'NO_TRIALS',\n}\n\nexport type UpdateCustomer = {\n  billingId?: InputMaybe<Scalars['String']>;\n  billingLinkUrl?: InputMaybe<Scalars['String']>;\n  createdAt?: InputMaybe<Scalars['DateTime']>;\n  crmId?: InputMaybe<Scalars['String']>;\n  email?: InputMaybe<Scalars['String']>;\n  environmentId?: InputMaybe<Scalars['String']>;\n  id?: InputMaybe<Scalars['String']>;\n  name?: InputMaybe<Scalars['String']>;\n  refId?: InputMaybe<Scalars['String']>;\n  updatedAt?: InputMaybe<Scalars['DateTime']>;\n};\n\nexport type UpdateEnvironment = {\n  description?: InputMaybe<Scalars['String']>;\n  displayName?: InputMaybe<Scalars['String']>;\n  id?: InputMaybe<Scalars['String']>;\n  slug?: InputMaybe<Scalars['String']>;\n};\n\nexport type UpdateFeature = {\n  createdAt?: InputMaybe<Scalars['DateTime']>;\n  description?: InputMaybe<Scalars['String']>;\n  displayName?: InputMaybe<Scalars['String']>;\n  environmentId?: InputMaybe<Scalars['String']>;\n  featureStatus?: InputMaybe<FeatureStatus>;\n  featureType?: InputMaybe<FeatureType>;\n  featureUnits?: InputMaybe<Scalars['String']>;\n  featureUnitsPlural?: InputMaybe<Scalars['String']>;\n  id?: InputMaybe<Scalars['String']>;\n  meterType?: InputMaybe<MeterType>;\n  refId?: InputMaybe<Scalars['String']>;\n  updatedAt?: InputMaybe<Scalars['DateTime']>;\n};\n\nexport type UpdateHook = {\n  createdAt?: InputMaybe<Scalars['DateTime']>;\n  description?: InputMaybe<Scalars['String']>;\n  endpoint?: InputMaybe<Scalars['String']>;\n  environmentId?: InputMaybe<Scalars['String']>;\n  eventLogTypes?: InputMaybe<Array<EventLogType>>;\n  id?: InputMaybe<Scalars['String']>;\n  secretKey?: InputMaybe<Scalars['String']>;\n  status?: InputMaybe<HookStatus>;\n};\n\nexport type UpdateIntegrationInput = {\n  stripeCredentials?: InputMaybe<StripeCredentialsInput>;\n  vendorIdentifier: VendorIdentifier;\n  zuoraCredentials?: InputMaybe<ZuoraCredentialsInput>;\n};\n\nexport type UpdateManyCustomersInput = {\n  /** Filter used to find fields to update */\n  filter: CustomerUpdateFilter;\n  /** The update to apply to all records found using the filter */\n  update: UpdateCustomer;\n};\n\nexport type UpdateManyEnvironmentsInput = {\n  /** Filter used to find fields to update */\n  filter: EnvironmentUpdateFilter;\n  /** The update to apply to all records found using the filter */\n  update: UpdateEnvironment;\n};\n\nexport type UpdateManyHooksInput = {\n  /** Filter used to find fields to update */\n  filter: HookUpdateFilter;\n  /** The update to apply to all records found using the filter */\n  update: UpdateHook;\n};\n\nexport type UpdateManyIntegrationsInput = {\n  /** Filter used to find fields to update */\n  filter: IntegrationUpdateFilter;\n  /** The update to apply to all records found using the filter */\n  update: UpdateIntegrationInput;\n};\n\nexport type UpdateManyPackageEntitlementsInput = {\n  /** Filter used to find fields to update */\n  filter: PackageEntitlementUpdateFilter;\n  /** The update to apply to all records found using the filter */\n  update: PackageEntitlementUpdateInput;\n};\n\nexport type UpdateManyProductsInput = {\n  /** Filter used to find fields to update */\n  filter: ProductUpdateFilter;\n  /** The update to apply to all records found using the filter */\n  update: ProductUpdateInput;\n};\n\nexport type UpdateManyPromotionalEntitlementsInput = {\n  /** Filter used to find fields to update */\n  filter: PromotionalEntitlementUpdateFilter;\n  /** The update to apply to all records found using the filter */\n  update: PromotionalEntitlementUpdateInput;\n};\n\nexport type UpdateOneCustomerInput = {\n  /** The id of the record to update */\n  id: Scalars['String'];\n  /** The update to apply. */\n  update: UpdateCustomer;\n};\n\nexport type UpdateOneEnvironmentInput = {\n  /** The id of the record to update */\n  id: Scalars['String'];\n  /** The update to apply. */\n  update: UpdateEnvironment;\n};\n\nexport type UpdateOneFeatureInput = {\n  /** The id of the record to update */\n  id: Scalars['String'];\n  /** The update to apply. */\n  update: UpdateFeature;\n};\n\nexport type UpdateOneHookInput = {\n  /** The id of the record to update */\n  id: Scalars['String'];\n  /** The update to apply. */\n  update: UpdateHook;\n};\n\nexport type UpdateOneIntegrationInput = {\n  /** The id of the record to update */\n  id: Scalars['String'];\n  /** The update to apply. */\n  update: UpdateIntegrationInput;\n};\n\nexport type UpdateOnePackageEntitlementInput = {\n  /** The id of the record to update */\n  id: Scalars['String'];\n  /** The update to apply. */\n  update: PackageEntitlementUpdateInput;\n};\n\nexport type UpdateOneProductInput = {\n  /** The id of the record to update */\n  id: Scalars['String'];\n  /** The update to apply. */\n  update: ProductUpdateInput;\n};\n\nexport type UpdateOnePromotionalEntitlementInput = {\n  /** The id of the record to update */\n  id: Scalars['String'];\n  /** The update to apply. */\n  update: PromotionalEntitlementUpdateInput;\n};\n\nexport type UsageHistoryInput = {\n  customerRefId: Scalars['String'];\n  endDate?: InputMaybe<Scalars['DateTime']>;\n  environmentId?: InputMaybe<Scalars['String']>;\n  featureRefId: Scalars['String'];\n  monthlyResetPeriodConfiguration?: InputMaybe<MonthlyResetPeriodConfigInput>;\n  resetPeriod?: InputMaybe<EntitlementResetPeriod>;\n  startDate: Scalars['DateTime'];\n  weeklyResetPeriodConfiguration?: InputMaybe<WeeklyResetPeriodConfigInput>;\n};\n\nexport type UsageMeasurementCreateInput = {\n  createdAt?: InputMaybe<Scalars['DateTime']>;\n  customerId: Scalars['String'];\n  environmentId?: InputMaybe<Scalars['String']>;\n  featureId: Scalars['String'];\n  value: Scalars['Float'];\n};\n\nexport type UsageMeasurementFilter = {\n  and?: InputMaybe<Array<UsageMeasurementFilter>>;\n  createdAt?: InputMaybe<DateFieldComparison>;\n  customer?: InputMaybe<UsageMeasurementFilterCustomerFilter>;\n  environmentId?: InputMaybe<StringFieldComparison>;\n  feature?: InputMaybe<UsageMeasurementFilterFeatureFilter>;\n  id?: InputMaybe<StringFieldComparison>;\n  or?: InputMaybe<Array<UsageMeasurementFilter>>;\n};\n\nexport type UsageMeasurementFilterCustomerFilter = {\n  and?: InputMaybe<Array<UsageMeasurementFilterCustomerFilter>>;\n  billingId?: InputMaybe<StringFieldComparison>;\n  createdAt?: InputMaybe<DateFieldComparison>;\n  crmId?: InputMaybe<StringFieldComparison>;\n  email?: InputMaybe<StringFieldComparison>;\n  environmentId?: InputMaybe<StringFieldComparison>;\n  id?: InputMaybe<StringFieldComparison>;\n  name?: InputMaybe<StringFieldComparison>;\n  or?: InputMaybe<Array<UsageMeasurementFilterCustomerFilter>>;\n  refId?: InputMaybe<StringFieldComparison>;\n  updatedAt?: InputMaybe<DateFieldComparison>;\n};\n\nexport type UsageMeasurementFilterFeatureFilter = {\n  and?: InputMaybe<Array<UsageMeasurementFilterFeatureFilter>>;\n  createdAt?: InputMaybe<DateFieldComparison>;\n  description?: InputMaybe<StringFieldComparison>;\n  displayName?: InputMaybe<StringFieldComparison>;\n  environmentId?: InputMaybe<StringFieldComparison>;\n  featureStatus?: InputMaybe<FeatureStatusFilterComparison>;\n  featureType?: InputMaybe<FeatureTypeFilterComparison>;\n  id?: InputMaybe<StringFieldComparison>;\n  meterType?: InputMaybe<MeterTypeFilterComparison>;\n  or?: InputMaybe<Array<UsageMeasurementFilterFeatureFilter>>;\n  refId?: InputMaybe<StringFieldComparison>;\n  updatedAt?: InputMaybe<DateFieldComparison>;\n};\n\nexport type UsageMeasurementSort = {\n  direction: SortDirection;\n  field: UsageMeasurementSortFields;\n  nulls?: InputMaybe<SortNulls>;\n};\n\nexport enum UsageMeasurementSortFields {\n  CreatedAt = 'createdAt',\n  EnvironmentId = 'environmentId',\n  Id = 'id',\n}\n\nexport enum VendorIdentifier {\n  Stripe = 'STRIPE',\n  Zuora = 'ZUORA',\n}\n\nexport type VendorIdentifierFilterComparison = {\n  eq?: InputMaybe<VendorIdentifier>;\n  gt?: InputMaybe<VendorIdentifier>;\n  gte?: InputMaybe<VendorIdentifier>;\n  iLike?: InputMaybe<VendorIdentifier>;\n  in?: InputMaybe<Array<VendorIdentifier>>;\n  is?: InputMaybe<Scalars['Boolean']>;\n  isNot?: InputMaybe<Scalars['Boolean']>;\n  like?: InputMaybe<VendorIdentifier>;\n  lt?: InputMaybe<VendorIdentifier>;\n  lte?: InputMaybe<VendorIdentifier>;\n  neq?: InputMaybe<VendorIdentifier>;\n  notILike?: InputMaybe<VendorIdentifier>;\n  notIn?: InputMaybe<Array<VendorIdentifier>>;\n  notLike?: InputMaybe<VendorIdentifier>;\n};\n\n/** Weekly reset period according to configuration */\nexport enum WeeklyAccordingTo {\n  EveryFriday = 'EveryFriday',\n  EveryMonday = 'EveryMonday',\n  EverySaturday = 'EverySaturday',\n  EverySunday = 'EverySunday',\n  EveryThursday = 'EveryThursday',\n  EveryTuesday = 'EveryTuesday',\n  EveryWednesday = 'EveryWednesday',\n  SubscriptionStart = 'SubscriptionStart',\n}\n\nexport type WeeklyResetPeriodConfigInput = {\n  accordingTo: WeeklyAccordingTo;\n};\n\nexport type ZuoraCredentialsInput = {\n  baseUrl: Scalars['String'];\n  clientId: Scalars['String'];\n  clientSecret: Scalars['String'];\n};\n\nexport type SubscriptionFragment = {\n  __typename?: 'CustomerSubscription';\n  id: string;\n  startDate: any;\n  endDate?: any | null | undefined;\n  status: SubscriptionStatus;\n  refId: string;\n  prices?:\n    | Array<{\n        __typename?: 'SubscriptionPrice';\n        usageLimit?: number | null | undefined;\n        price: { __typename?: 'Price' } & PriceFragment;\n      }>\n    | null\n    | undefined;\n  plan: {\n    __typename?: 'Plan';\n    id: string;\n    refId: string;\n    displayName: string;\n    description?: string | null | undefined;\n    entitlements?:\n      | Array<{\n          __typename?: 'PackageEntitlement';\n          usageLimit?: number | null | undefined;\n          featureId: string;\n          hasUnlimitedUsage?: boolean | null | undefined;\n          packageId: string;\n          resetPeriod?: EntitlementResetPeriod | null | undefined;\n          feature: {\n            __typename?: 'Feature';\n            featureType: FeatureType;\n            meterType?: MeterType | null | undefined;\n            featureUnits?: string | null | undefined;\n            featureUnitsPlural?: string | null | undefined;\n            displayName: string;\n            description?: string | null | undefined;\n            refId: string;\n          };\n        }>\n      | null\n      | undefined;\n    inheritedEntitlements?:\n      | Array<{\n          __typename?: 'PackageEntitlement';\n          usageLimit?: number | null | undefined;\n          featureId: string;\n          hasUnlimitedUsage?: boolean | null | undefined;\n          packageId: string;\n          resetPeriod?: EntitlementResetPeriod | null | undefined;\n          feature: {\n            __typename?: 'Feature';\n            featureType: FeatureType;\n            meterType?: MeterType | null | undefined;\n            featureUnits?: string | null | undefined;\n            featureUnitsPlural?: string | null | undefined;\n            displayName: string;\n            description?: string | null | undefined;\n            refId: string;\n          };\n        }>\n      | null\n      | undefined;\n    prices?: Array<{ __typename?: 'Price' } & PriceFragment> | null | undefined;\n  };\n  addons?:\n    | Array<{\n        __typename?: 'SubscriptionAddon';\n        id: string;\n        quantity: number;\n        addon: {\n          __typename?: 'Addon';\n          id: string;\n          refId: string;\n          displayName: string;\n          description?: string | null | undefined;\n          entitlements?:\n            | Array<{\n                __typename?: 'PackageEntitlement';\n                usageLimit?: number | null | undefined;\n                hasUnlimitedUsage?: boolean | null | undefined;\n                featureId: string;\n                feature: {\n                  __typename?: 'Feature';\n                  featureType: FeatureType;\n                  meterType?: MeterType | null | undefined;\n                  featureUnits?: string | null | undefined;\n                  featureUnitsPlural?: string | null | undefined;\n                  displayName: string;\n                  description?: string | null | undefined;\n                  refId: string;\n                };\n              }>\n            | null\n            | undefined;\n        };\n      }>\n    | null\n    | undefined;\n};\n\nexport type PromotionalEntitlementFragment = {\n  __typename?: 'PromotionalEntitlement';\n  status: PromotionalEntitlementStatus;\n  usageLimit?: number | null | undefined;\n  featureId: string;\n  hasUnlimitedUsage?: boolean | null | undefined;\n  resetPeriod?: EntitlementResetPeriod | null | undefined;\n  endDate?: any | null | undefined;\n  isVisible: boolean;\n  feature: {\n    __typename?: 'Feature';\n    featureType: FeatureType;\n    meterType?: MeterType | null | undefined;\n    featureUnits?: string | null | undefined;\n    featureUnitsPlural?: string | null | undefined;\n    displayName: string;\n    description?: string | null | undefined;\n    refId: string;\n  };\n};\n\nexport type CustomerFragment = {\n  __typename?: 'Customer';\n  id: string;\n  name?: string | null | undefined;\n  email?: string | null | undefined;\n  createdAt: any;\n  updatedAt: any;\n  refId: string;\n  promotionalEntitlements: Array<{ __typename?: 'PromotionalEntitlement' } & PromotionalEntitlementFragment>;\n  subscriptions?: Array<{ __typename?: 'CustomerSubscription' } & SubscriptionFragment> | null | undefined;\n};\n\nexport type GetCustomerByRefIdQueryVariables = Exact<{\n  filter?: Maybe<CustomerFilter>;\n}>;\n\nexport type GetCustomerByRefIdQuery = {\n  __typename?: 'Query';\n  customers: {\n    __typename?: 'CustomerConnection';\n    edges: Array<{ __typename?: 'CustomerEdge'; node: { __typename?: 'Customer' } & CustomerFragment }>;\n  };\n};\n\nexport type SlimEntitlementFragment = {\n  __typename?: 'Entitlement';\n  isGranted: boolean;\n  accessDeniedReason?: AccessDeniedReason | null | undefined;\n  customerId?: string | null | undefined;\n  usageLimit?: number | null | undefined;\n  hasUnlimitedUsage: boolean;\n  currentUsage?: number | null | undefined;\n  requestedUsage?: number | null | undefined;\n  nextResetDate?: any | null | undefined;\n  resetPeriod?: EntitlementResetPeriod | null | undefined;\n  resetPeriodConfiguration?:\n    | ({ __typename: 'MonthlyResetPeriodConfig' } & MonthlyResetPeriodConfigFragment)\n    | ({ __typename: 'WeeklyResetPeriodConfig' } & WeeklyResetPeriodConfigFragment)\n    | null\n    | undefined;\n  feature?: ({ __typename?: 'EntitlementFeature' } & SlimFeatureFragment) | null | undefined;\n};\n\nexport type SlimFeatureFragment = {\n  __typename?: 'EntitlementFeature';\n  featureType: FeatureType;\n  meterType?: MeterType | null | undefined;\n  refId: string;\n};\n\nexport type MonthlyResetPeriodConfigFragment = {\n  __typename?: 'MonthlyResetPeriodConfig';\n  monthlyAccordingTo?: MonthlyAccordingTo | null | undefined;\n};\n\nexport type WeeklyResetPeriodConfigFragment = {\n  __typename?: 'WeeklyResetPeriodConfig';\n  weeklyAccordingTo?: WeeklyAccordingTo | null | undefined;\n};\n\nexport type EntitlementFragment = {\n  __typename?: 'EntitlementWithSummary';\n  isGranted: boolean;\n  accessDeniedReason?: AccessDeniedReason | null | undefined;\n  customerId?: string | null | undefined;\n  usageLimit?: number | null | undefined;\n  hasUnlimitedUsage: boolean;\n  currentUsage?: number | null | undefined;\n  requestedUsage?: number | null | undefined;\n  nextResetDate?: any | null | undefined;\n  resetPeriod?: EntitlementResetPeriod | null | undefined;\n  resetPeriodConfiguration?:\n    | ({ __typename?: 'MonthlyResetPeriodConfig' } & ResetPeriodConfigurationFragment_MonthlyResetPeriodConfig_)\n    | ({ __typename?: 'WeeklyResetPeriodConfig' } & ResetPeriodConfigurationFragment_WeeklyResetPeriodConfig_)\n    | null\n    | undefined;\n  feature?: ({ __typename?: 'EntitlementFeature' } & FeatureFragment) | null | undefined;\n};\n\ntype ResetPeriodConfigurationFragment_MonthlyResetPeriodConfig_ = {\n  __typename: 'MonthlyResetPeriodConfig';\n} & MonthlyResetPeriodConfigFragment;\n\ntype ResetPeriodConfigurationFragment_WeeklyResetPeriodConfig_ = {\n  __typename: 'WeeklyResetPeriodConfig';\n} & WeeklyResetPeriodConfigFragment;\n\nexport type ResetPeriodConfigurationFragment =\n  | ResetPeriodConfigurationFragment_MonthlyResetPeriodConfig_\n  | ResetPeriodConfigurationFragment_WeeklyResetPeriodConfig_;\n\nexport type FeatureFragment = {\n  __typename?: 'EntitlementFeature';\n  featureType: FeatureType;\n  meterType?: MeterType | null | undefined;\n  featureUnits?: string | null | undefined;\n  featureUnitsPlural?: string | null | undefined;\n  description?: string | null | undefined;\n  displayName: string;\n  refId: string;\n};\n\nexport type EntitlementQueryVariables = Exact<{\n  query: FetchEntitlementQuery;\n}>;\n\nexport type EntitlementQuery = {\n  __typename?: 'Query';\n  entitlement: { __typename?: 'Entitlement' } & SlimEntitlementFragment;\n};\n\nexport type GetEntitlementsQueryVariables = Exact<{\n  query: FetchEntitlementsQuery;\n}>;\n\nexport type GetEntitlementsQuery = {\n  __typename?: 'Query';\n  entitlements: Array<{ __typename?: 'EntitlementWithSummary' } & EntitlementFragment>;\n};\n\nexport type PackageEntitlementFragment = {\n  __typename?: 'PackageEntitlement';\n  usageLimit?: number | null | undefined;\n  hasUnlimitedUsage?: boolean | null | undefined;\n  featureId: string;\n  resetPeriod?: EntitlementResetPeriod | null | undefined;\n  feature: {\n    __typename?: 'Feature';\n    featureType: FeatureType;\n    meterType?: MeterType | null | undefined;\n    featureUnits?: string | null | undefined;\n    featureUnitsPlural?: string | null | undefined;\n    displayName: string;\n    description?: string | null | undefined;\n    refId: string;\n  };\n};\n\nexport type AddonFragment = {\n  __typename?: 'Addon';\n  refId: string;\n  displayName: string;\n  description?: string | null | undefined;\n  entitlements?: Array<{ __typename?: 'PackageEntitlement' } & PackageEntitlementFragment> | null | undefined;\n};\n\nexport type PlanFragment = {\n  __typename?: 'Plan';\n  id: string;\n  refId: string;\n  description?: string | null | undefined;\n  displayName: string;\n  basePlan?: { __typename?: 'Plan'; id: string; refId: string; displayName: string } | null | undefined;\n  entitlements?: Array<{ __typename?: 'PackageEntitlement' } & PackageEntitlementFragment> | null | undefined;\n  inheritedEntitlements?: Array<{ __typename?: 'PackageEntitlement' } & PackageEntitlementFragment> | null | undefined;\n  compatibleAddons?: Array<{ __typename?: 'Addon' } & AddonFragment> | null | undefined;\n  prices?: Array<{ __typename?: 'Price' } & PriceFragment> | null | undefined;\n  defaultTrialConfig?:\n    | { __typename?: 'DefaultTrialConfig'; duration: number; units: TrialPeriodUnits }\n    | null\n    | undefined;\n};\n\nexport type GetPlansQueryVariables = Exact<{\n  paging?: Maybe<CursorPaging>;\n  filter?: Maybe<PlanFilter>;\n  sorting?: Maybe<Array<PlanSort> | PlanSort>;\n}>;\n\nexport type GetPlansQuery = {\n  __typename?: 'Query';\n  plans: {\n    __typename?: 'PlanConnection';\n    edges: Array<{ __typename?: 'PlanEdge'; node: { __typename?: 'Plan' } & PlanFragment }>;\n  };\n};\n\nexport type PriceFragment = {\n  __typename?: 'Price';\n  billingModel: BillingModel;\n  billingPeriod: BillingPeriod;\n  price: { __typename?: 'Money'; amount: number; currency: Currency };\n  feature?:\n    | {\n        __typename?: 'Feature';\n        featureUnits?: string | null | undefined;\n        featureUnitsPlural?: string | null | undefined;\n        displayName: string;\n      }\n    | null\n    | undefined;\n};\n","import {\n  AccessDeniedReason,\n  BillingModel,\n  BillingPeriod,\n  EntitlementResetPeriod,\n  MonthlyAccordingTo,\n  PromotionalEntitlementStatus,\n  SubscriptionStatus,\n  TrialPeriodUnits,\n  WeeklyAccordingTo,\n} from './api/generated/types';\n\nexport {\n  BillingPeriod,\n  BillingModel,\n  ErrorCode,\n  AccessDeniedReason,\n  EntitlementResetPeriod,\n  TrialPeriodUnits,\n} from './api/generated/types';\n\nexport enum FeatureType {\n  Boolean = 'BOOLEAN',\n  Number = 'NUMBER',\n}\n\nexport enum MeterType {\n  Fluctuating = 'Fluctuating',\n  Incremental = 'Incremental',\n  None = 'None',\n}\n\n// todo antonzy: consider refactoring this type hierarchy to something more flexible\nexport type BaseEntitlement = {\n  isValid: boolean;\n  isGranted: boolean;\n  featureType?: FeatureType;\n  featureDisplayName?: string;\n  featureDescription?: string | null;\n  accessDeniedReason?: AccessDeniedReason | null;\n  featureId?: string | null;\n};\n\nexport interface FallbackEntitlement extends BaseEntitlement {\n  isValid: false;\n}\n\nexport interface InvalidEntitlement extends BaseEntitlement {\n  isValid: false;\n  isGranted: false;\n  accessDeniedReason:\n    | AccessDeniedReason.FeatureNotFound\n    | AccessDeniedReason.CustomerNotFound\n    | AccessDeniedReason.Unknown;\n}\n\nexport interface ValidEntitlement extends BaseEntitlement {\n  isValid: true;\n}\n\nexport interface BooleanEntitlement extends ValidEntitlement {\n  featureType: FeatureType.Boolean;\n}\n\nexport interface NumberEntitlement extends ValidEntitlement {\n  featureType: FeatureType.Number;\n  usageLimit: number;\n  featureUnits?: string;\n  featureUnitsPlural?: string;\n  hasUnlimitedUsage: boolean;\n}\n\nexport interface MeteredEntitlement extends NumberEntitlement {\n  featureType: FeatureType.Number;\n  meterType: MeterType.Fluctuating | MeterType.Incremental | MeterType.None;\n  currentUsage: number;\n  requestedUsage: number | null;\n  resetPeriod?: EntitlementResetPeriod | null;\n  nextResetDate?: any | null;\n  resetPeriodConfiguration?:\n    | { __typename: 'MonthlyResetPeriodConfig'; monthlyAccordingTo?: MonthlyAccordingTo | null | undefined }\n    | { __typename: 'WeeklyResetPeriodConfig'; weeklyAccordingTo?: WeeklyAccordingTo | null | undefined }\n    | null;\n}\n\nexport type Entitlement =\n  | FallbackEntitlement\n  | InvalidEntitlement\n  | BooleanEntitlement\n  | NumberEntitlement\n  | MeteredEntitlement;\n\nexport const INVALID_ENTITLEMENT: InvalidEntitlement = {\n  isValid: false,\n  isGranted: false,\n  accessDeniedReason: AccessDeniedReason.Unknown,\n};\n\nexport type PackageEntitlement = {\n  usageLimit: number;\n  featureType: FeatureType;\n  featureMeterType?: MeterType | null;\n  featureUnits?: string | null;\n  featureUnitsPlural?: string | null;\n  featureDisplayName: string;\n  featureDescription?: string | null;\n  featureId: string;\n  hasUnlimitedUsage?: boolean | null;\n  resetPeriod?: EntitlementResetPeriod | null;\n};\n\nexport type PromotionalEntitlement = {\n  usageLimit: number;\n  featureType: FeatureType;\n  featureMeterType?: MeterType | null;\n  featureUnits?: string | null;\n  featureUnitsPlural?: string | null;\n  featureDisplayName: string;\n  featureDescription?: string | null;\n  featureId: string;\n  hasUnlimitedUsage?: boolean | null;\n  resetPeriod?: EntitlementResetPeriod | null;\n  status: PromotionalEntitlementStatus;\n  endDate?: Date;\n  isVisible: boolean;\n};\n\nexport type Price = {\n  billingModel: BillingModel;\n  billingPeriod: BillingPeriod;\n  amount: number;\n  currency: string;\n  feature?: {\n    featureUnits?: string | null | undefined;\n    featureUnitsPlural?: string | null | undefined;\n    displayName: string;\n  } | null;\n};\n\nexport type BasePlan = {\n  displayName: string;\n  id: string;\n};\n\nexport type Plan = {\n  id: string;\n  displayName: string;\n  description?: string | null;\n  order: number;\n  basePlan?: BasePlan;\n  entitlements: PackageEntitlement[];\n  inheritedEntitlements: PackageEntitlement[];\n  prices: Price[];\n  defaultTrialConfig?: DefaultTrialConfig | null;\n  compatibleAddons: Addon[];\n};\n\nexport type DefaultTrialConfig = {\n  duration: number;\n  units: TrialPeriodUnits;\n};\nexport type EntitlementOptions = {\n  requestedUsage?: number;\n  shouldTrack?: boolean;\n  fallbackGrantedValue?: boolean;\n};\n\nexport type FetchEntitlement = {\n  customerId: string;\n  featureId: string;\n  options?: EntitlementOptions;\n};\n\nexport type Addon = {\n  id: string;\n  displayName: string;\n  description: string;\n  entitlements: PackageEntitlement[];\n};\n\nexport type SubscriptionAddon = {\n  quantity: number;\n  addon: Addon;\n};\n\nexport type Subscription = {\n  id: string;\n  status: SubscriptionStatus;\n  plan: Plan;\n  price: Price | null;\n  addons: SubscriptionAddon[];\n  billingId?: string;\n  crmId?: string;\n  startDate: Date;\n  endDate?: Date;\n};\n\nexport type Customer = {\n  id: string;\n  name?: string;\n  email?: string;\n  createdAt: Date;\n  updatedAt: Date;\n  subscriptions: Subscription[];\n  promotionalEntitlements: PromotionalEntitlement[];\n  getActiveSubscriptions(): Subscription[];\n  getActivePromotionalEntitlements(): PromotionalEntitlement[];\n  getActiveTrials(): Subscription[];\n};\n\ntype CustomerState = Omit<Customer, 'getActiveSubscriptions' | 'getActivePromotionalEntitlements' | 'getActiveTrials'>;\n\nexport class CustomerModel implements Customer {\n  id!: string;\n  createdAt!: Date;\n  updatedAt!: Date;\n  subscriptions!: Subscription[];\n  promotionalEntitlements!: PromotionalEntitlement[];\n\n  constructor(state: CustomerState) {\n    Object.assign(this, state);\n  }\n\n  getActiveSubscriptions() {\n    return this.subscriptions.filter((x) => x.status === SubscriptionStatus.Active);\n  }\n\n  getActiveTrials() {\n    return this.subscriptions.filter((x) => x.status === SubscriptionStatus.InTrial);\n  }\n\n  getActivePromotionalEntitlements(): PromotionalEntitlement[] {\n    return this.promotionalEntitlements.filter((x) => x.status === PromotionalEntitlementStatus.Active);\n  }\n}\n","/*! *****************************************************************************\r\nCopyright (c) Microsoft Corporation.\r\n\r\nPermission to use, copy, modify, and/or distribute this software for any\r\npurpose with or without fee is hereby granted.\r\n\r\nTHE SOFTWARE IS PROVIDED \"AS IS\" AND THE AUTHOR DISCLAIMS ALL WARRANTIES WITH\r\nREGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY\r\nAND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT,\r\nINDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM\r\nLOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR\r\nOTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR\r\nPERFORMANCE OF THIS SOFTWARE.\r\n***************************************************************************** */\r\n/* global Reflect, Promise */\r\n\r\nvar extendStatics = function(d, b) {\r\n    extendStatics = Object.setPrototypeOf ||\r\n        ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||\r\n        function (d, b) { for (var p in b) if (Object.prototype.hasOwnProperty.call(b, p)) d[p] = b[p]; };\r\n    return extendStatics(d, b);\r\n};\r\n\r\nexport function __extends(d, b) {\r\n    if (typeof b !== \"function\" && b !== null)\r\n        throw new TypeError(\"Class extends value \" + String(b) + \" is not a constructor or null\");\r\n    extendStatics(d, b);\r\n    function __() { this.constructor = d; }\r\n    d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());\r\n}\r\n\r\nexport var __assign = function() {\r\n    __assign = Object.assign || function __assign(t) {\r\n        for (var s, i = 1, n = arguments.length; i < n; i++) {\r\n            s = arguments[i];\r\n            for (var p in s) if (Object.prototype.hasOwnProperty.call(s, p)) t[p] = s[p];\r\n        }\r\n        return t;\r\n    }\r\n    return __assign.apply(this, arguments);\r\n}\r\n\r\nexport function __rest(s, e) {\r\n    var t = {};\r\n    for (var p in s) if (Object.prototype.hasOwnProperty.call(s, p) && e.indexOf(p) < 0)\r\n        t[p] = s[p];\r\n    if (s != null && typeof Object.getOwnPropertySymbols === \"function\")\r\n        for (var i = 0, p = Object.getOwnPropertySymbols(s); i < p.length; i++) {\r\n            if (e.indexOf(p[i]) < 0 && Object.prototype.propertyIsEnumerable.call(s, p[i]))\r\n                t[p[i]] = s[p[i]];\r\n        }\r\n    return t;\r\n}\r\n\r\nexport function __decorate(decorators, target, key, desc) {\r\n    var c = arguments.length, r = c < 3 ? target : desc === null ? desc = Object.getOwnPropertyDescriptor(target, key) : desc, d;\r\n    if (typeof Reflect === \"object\" && typeof Reflect.decorate === \"function\") r = Reflect.decorate(decorators, target, key, desc);\r\n    else for (var i = decorators.length - 1; i >= 0; i--) if (d = decorators[i]) r = (c < 3 ? d(r) : c > 3 ? d(target, key, r) : d(target, key)) || r;\r\n    return c > 3 && r && Object.defineProperty(target, key, r), r;\r\n}\r\n\r\nexport function __param(paramIndex, decorator) {\r\n    return function (target, key) { decorator(target, key, paramIndex); }\r\n}\r\n\r\nexport function __metadata(metadataKey, metadataValue) {\r\n    if (typeof Reflect === \"object\" && typeof Reflect.metadata === \"function\") return Reflect.metadata(metadataKey, metadataValue);\r\n}\r\n\r\nexport function __awaiter(thisArg, _arguments, P, generator) {\r\n    function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); }\r\n    return new (P || (P = Promise))(function (resolve, reject) {\r\n        function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }\r\n        function rejected(value) { try { step(generator[\"throw\"](value)); } catch (e) { reject(e); } }\r\n        function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); }\r\n        step((generator = generator.apply(thisArg, _arguments || [])).next());\r\n    });\r\n}\r\n\r\nexport function __generator(thisArg, body) {\r\n    var _ = { label: 0, sent: function() { if (t[0] & 1) throw t[1]; return t[1]; }, trys: [], ops: [] }, f, y, t, g;\r\n    return g = { next: verb(0), \"throw\": verb(1), \"return\": verb(2) }, typeof Symbol === \"function\" && (g[Symbol.iterator] = function() { return this; }), g;\r\n    function verb(n) { return function (v) { return step([n, v]); }; }\r\n    function step(op) {\r\n        if (f) throw new TypeError(\"Generator is already executing.\");\r\n        while (_) try {\r\n            if (f = 1, y && (t = op[0] & 2 ? y[\"return\"] : op[0] ? y[\"throw\"] || ((t = y[\"return\"]) && t.call(y), 0) : y.next) && !(t = t.call(y, op[1])).done) return t;\r\n            if (y = 0, t) op = [op[0] & 2, t.value];\r\n            switch (op[0]) {\r\n                case 0: case 1: t = op; break;\r\n                case 4: _.label++; return { value: op[1], done: false };\r\n                case 5: _.label++; y = op[1]; op = [0]; continue;\r\n                case 7: op = _.ops.pop(); _.trys.pop(); continue;\r\n                default:\r\n                    if (!(t = _.trys, t = t.length > 0 && t[t.length - 1]) && (op[0] === 6 || op[0] === 2)) { _ = 0; continue; }\r\n                    if (op[0] === 3 && (!t || (op[1] > t[0] && op[1] < t[3]))) { _.label = op[1]; break; }\r\n                    if (op[0] === 6 && _.label < t[1]) { _.label = t[1]; t = op; break; }\r\n                    if (t && _.label < t[2]) { _.label = t[2]; _.ops.push(op); break; }\r\n                    if (t[2]) _.ops.pop();\r\n                    _.trys.pop(); continue;\r\n            }\r\n            op = body.call(thisArg, _);\r\n        } catch (e) { op = [6, e]; y = 0; } finally { f = t = 0; }\r\n        if (op[0] & 5) throw op[1]; return { value: op[0] ? op[1] : void 0, done: true };\r\n    }\r\n}\r\n\r\nexport var __createBinding = Object.create ? (function(o, m, k, k2) {\r\n    if (k2 === undefined) k2 = k;\r\n    Object.defineProperty(o, k2, { enumerable: true, get: function() { return m[k]; } });\r\n}) : (function(o, m, k, k2) {\r\n    if (k2 === undefined) k2 = k;\r\n    o[k2] = m[k];\r\n});\r\n\r\nexport function __exportStar(m, o) {\r\n    for (var p in m) if (p !== \"default\" && !Object.prototype.hasOwnProperty.call(o, p)) __createBinding(o, m, p);\r\n}\r\n\r\nexport function __values(o) {\r\n    var s = typeof Symbol === \"function\" && Symbol.iterator, m = s && o[s], i = 0;\r\n    if (m) return m.call(o);\r\n    if (o && typeof o.length === \"number\") return {\r\n        next: function () {\r\n            if (o && i >= o.length) o = void 0;\r\n            return { value: o && o[i++], done: !o };\r\n        }\r\n    };\r\n    throw new TypeError(s ? \"Object is not iterable.\" : \"Symbol.iterator is not defined.\");\r\n}\r\n\r\nexport function __read(o, n) {\r\n    var m = typeof Symbol === \"function\" && o[Symbol.iterator];\r\n    if (!m) return o;\r\n    var i = m.call(o), r, ar = [], e;\r\n    try {\r\n        while ((n === void 0 || n-- > 0) && !(r = i.next()).done) ar.push(r.value);\r\n    }\r\n    catch (error) { e = { error: error }; }\r\n    finally {\r\n        try {\r\n            if (r && !r.done && (m = i[\"return\"])) m.call(i);\r\n        }\r\n        finally { if (e) throw e.error; }\r\n    }\r\n    return ar;\r\n}\r\n\r\n/** @deprecated */\r\nexport function __spread() {\r\n    for (var ar = [], i = 0; i < arguments.length; i++)\r\n        ar = ar.concat(__read(arguments[i]));\r\n    return ar;\r\n}\r\n\r\n/** @deprecated */\r\nexport function __spreadArrays() {\r\n    for (var s = 0, i = 0, il = arguments.length; i < il; i++) s += arguments[i].length;\r\n    for (var r = Array(s), k = 0, i = 0; i < il; i++)\r\n        for (var a = arguments[i], j = 0, jl = a.length; j < jl; j++, k++)\r\n            r[k] = a[j];\r\n    return r;\r\n}\r\n\r\nexport function __spreadArray(to, from, pack) {\r\n    if (pack || arguments.length === 2) for (var i = 0, l = from.length, ar; i < l; i++) {\r\n        if (ar || !(i in from)) {\r\n            if (!ar) ar = Array.prototype.slice.call(from, 0, i);\r\n            ar[i] = from[i];\r\n        }\r\n    }\r\n    return to.concat(ar || Array.prototype.slice.call(from));\r\n}\r\n\r\nexport function __await(v) {\r\n    return this instanceof __await ? (this.v = v, this) : new __await(v);\r\n}\r\n\r\nexport function __asyncGenerator(thisArg, _arguments, generator) {\r\n    if (!Symbol.asyncIterator) throw new TypeError(\"Symbol.asyncIterator is not defined.\");\r\n    var g = generator.apply(thisArg, _arguments || []), i, q = [];\r\n    return i = {}, verb(\"next\"), verb(\"throw\"), verb(\"return\"), i[Symbol.asyncIterator] = function () { return this; }, i;\r\n    function verb(n) { if (g[n]) i[n] = function (v) { return new Promise(function (a, b) { q.push([n, v, a, b]) > 1 || resume(n, v); }); }; }\r\n    function resume(n, v) { try { step(g[n](v)); } catch (e) { settle(q[0][3], e); } }\r\n    function step(r) { r.value instanceof __await ? Promise.resolve(r.value.v).then(fulfill, reject) : settle(q[0][2], r); }\r\n    function fulfill(value) { resume(\"next\", value); }\r\n    function reject(value) { resume(\"throw\", value); }\r\n    function settle(f, v) { if (f(v), q.shift(), q.length) resume(q[0][0], q[0][1]); }\r\n}\r\n\r\nexport function __asyncDelegator(o) {\r\n    var i, p;\r\n    return i = {}, verb(\"next\"), verb(\"throw\", function (e) { throw e; }), verb(\"return\"), i[Symbol.iterator] = function () { return this; }, i;\r\n    function verb(n, f) { i[n] = o[n] ? function (v) { return (p = !p) ? { value: __await(o[n](v)), done: n === \"return\" } : f ? f(v) : v; } : f; }\r\n}\r\n\r\nexport function __asyncValues(o) {\r\n    if (!Symbol.asyncIterator) throw new TypeError(\"Symbol.asyncIterator is not defined.\");\r\n    var m = o[Symbol.asyncIterator], i;\r\n    return m ? m.call(o) : (o = typeof __values === \"function\" ? __values(o) : o[Symbol.iterator](), i = {}, verb(\"next\"), verb(\"throw\"), verb(\"return\"), i[Symbol.asyncIterator] = function () { return this; }, i);\r\n    function verb(n) { i[n] = o[n] && function (v) { return new Promise(function (resolve, reject) { v = o[n](v), settle(resolve, reject, v.done, v.value); }); }; }\r\n    function settle(resolve, reject, d, v) { Promise.resolve(v).then(function(v) { resolve({ value: v, done: d }); }, reject); }\r\n}\r\n\r\nexport function __makeTemplateObject(cooked, raw) {\r\n    if (Object.defineProperty) { Object.defineProperty(cooked, \"raw\", { value: raw }); } else { cooked.raw = raw; }\r\n    return cooked;\r\n};\r\n\r\nvar __setModuleDefault = Object.create ? (function(o, v) {\r\n    Object.defineProperty(o, \"default\", { enumerable: true, value: v });\r\n}) : function(o, v) {\r\n    o[\"default\"] = v;\r\n};\r\n\r\nexport function __importStar(mod) {\r\n    if (mod && mod.__esModule) return mod;\r\n    var result = {};\r\n    if (mod != null) for (var k in mod) if (k !== \"default\" && Object.prototype.hasOwnProperty.call(mod, k)) __createBinding(result, mod, k);\r\n    __setModuleDefault(result, mod);\r\n    return result;\r\n}\r\n\r\nexport function __importDefault(mod) {\r\n    return (mod && mod.__esModule) ? mod : { default: mod };\r\n}\r\n\r\nexport function __classPrivateFieldGet(receiver, state, kind, f) {\r\n    if (kind === \"a\" && !f) throw new TypeError(\"Private accessor was defined without a getter\");\r\n    if (typeof state === \"function\" ? receiver !== state || !f : !state.has(receiver)) throw new TypeError(\"Cannot read private member from an object whose class did not declare it\");\r\n    return kind === \"m\" ? f : kind === \"a\" ? f.call(receiver) : f ? f.value : state.get(receiver);\r\n}\r\n\r\nexport function __classPrivateFieldSet(receiver, state, value, kind, f) {\r\n    if (kind === \"m\") throw new TypeError(\"Private method is not writable\");\r\n    if (kind === \"a\" && !f) throw new TypeError(\"Private accessor was defined without a setter\");\r\n    if (typeof state === \"function\" ? receiver !== state || !f : !state.has(receiver)) throw new TypeError(\"Cannot write private member to an object whose class did not declare it\");\r\n    return (kind === \"a\" ? f.call(receiver, value) : f ? f.value = value : state.set(receiver, value)), value;\r\n}\r\n","export function invariant(condition, message) {\n  const booleanCondition = Boolean(condition); // istanbul ignore else (See transformation done in './resources/inlineInvariant.js')\n\n  if (!booleanCondition) {\n    throw new Error(\n      message != null ? message : 'Unexpected invariant triggered.',\n    );\n  }\n}\n","import { invariant } from '../jsutils/invariant.mjs';\nconst LineRegExp = /\\r\\n|[\\n\\r]/g;\n/**\n * Represents a location in a Source.\n */\n\n/**\n * Takes a Source and a UTF-8 character offset, and returns the corresponding\n * line and column as a SourceLocation.\n */\nexport function getLocation(source, position) {\n  let lastLineStart = 0;\n  let line = 1;\n\n  for (const match of source.body.matchAll(LineRegExp)) {\n    typeof match.index === 'number' || invariant(false);\n\n    if (match.index >= position) {\n      break;\n    }\n\n    lastLineStart = match.index + match[0].length;\n    line += 1;\n  }\n\n  return {\n    line,\n    column: position + 1 - lastLineStart,\n  };\n}\n","import { getLocation } from './location.mjs';\n/**\n * Render a helpful description of the location in the GraphQL Source document.\n */\n\nexport function printLocation(location) {\n  return printSourceLocation(\n    location.source,\n    getLocation(location.source, location.start),\n  );\n}\n/**\n * Render a helpful description of the location in the GraphQL Source document.\n */\n\nexport function printSourceLocation(source, sourceLocation) {\n  const firstLineColumnOffset = source.locationOffset.column - 1;\n  const body = ''.padStart(firstLineColumnOffset) + source.body;\n  const lineIndex = sourceLocation.line - 1;\n  const lineOffset = source.locationOffset.line - 1;\n  const lineNum = sourceLocation.line + lineOffset;\n  const columnOffset = sourceLocation.line === 1 ? firstLineColumnOffset : 0;\n  const columnNum = sourceLocation.column + columnOffset;\n  const locationStr = `${source.name}:${lineNum}:${columnNum}\\n`;\n  const lines = body.split(/\\r\\n|[\\n\\r]/g);\n  const locationLine = lines[lineIndex]; // Special case for minified documents\n\n  if (locationLine.length > 120) {\n    const subLineIndex = Math.floor(columnNum / 80);\n    const subLineColumnNum = columnNum % 80;\n    const subLines = [];\n\n    for (let i = 0; i < locationLine.length; i += 80) {\n      subLines.push(locationLine.slice(i, i + 80));\n    }\n\n    return (\n      locationStr +\n      printPrefixedLines([\n        [`${lineNum} |`, subLines[0]],\n        ...subLines.slice(1, subLineIndex + 1).map((subLine) => ['|', subLine]),\n        ['|', '^'.padStart(subLineColumnNum)],\n        ['|', subLines[subLineIndex + 1]],\n      ])\n    );\n  }\n\n  return (\n    locationStr +\n    printPrefixedLines([\n      // Lines specified like this: [\"prefix\", \"string\"],\n      [`${lineNum - 1} |`, lines[lineIndex - 1]],\n      [`${lineNum} |`, locationLine],\n      ['|', '^'.padStart(columnNum)],\n      [`${lineNum + 1} |`, lines[lineIndex + 1]],\n    ])\n  );\n}\n\nfunction printPrefixedLines(lines) {\n  const existingLines = lines.filter(([_, line]) => line !== undefined);\n  const padLen = Math.max(...existingLines.map(([prefix]) => prefix.length));\n  return existingLines\n    .map(([prefix, line]) => prefix.padStart(padLen) + (line ? ' ' + line : ''))\n    .join('\\n');\n}\n","import { isObjectLike } from '../jsutils/isObjectLike.mjs';\nimport { getLocation } from '../language/location.mjs';\nimport {\n  printLocation,\n  printSourceLocation,\n} from '../language/printLocation.mjs';\n/**\n * Custom extensions\n *\n * @remarks\n * Use a unique identifier name for your extension, for example the name of\n * your library or project. Do not use a shortened identifier as this increases\n * the risk of conflicts. We recommend you add at most one extension field,\n * an object which can contain all the values you need.\n */\n\n/**\n * A GraphQLError describes an Error found during the parse, validate, or\n * execute phases of performing a GraphQL operation. In addition to a message\n * and stack trace, it also includes information about the locations in a\n * GraphQL document and/or execution result that correspond to the Error.\n */\nexport class GraphQLError extends Error {\n  /**\n   * An array of `{ line, column }` locations within the source GraphQL document\n   * which correspond to this error.\n   *\n   * Errors during validation often contain multiple locations, for example to\n   * point out two things with the same name. Errors during execution include a\n   * single location, the field which produced the error.\n   *\n   * Enumerable, and appears in the result of JSON.stringify().\n   */\n\n  /**\n   * An array describing the JSON-path into the execution response which\n   * corresponds to this error. Only included for errors during execution.\n   *\n   * Enumerable, and appears in the result of JSON.stringify().\n   */\n\n  /**\n   * An array of GraphQL AST Nodes corresponding to this error.\n   */\n\n  /**\n   * The source GraphQL document for the first location of this error.\n   *\n   * Note that if this Error represents more than one node, the source may not\n   * represent nodes after the first node.\n   */\n\n  /**\n   * An array of character offsets within the source GraphQL document\n   * which correspond to this error.\n   */\n\n  /**\n   * The original error thrown from a field resolver during execution.\n   */\n\n  /**\n   * Extension fields to add to the formatted error.\n   */\n  constructor(\n    message,\n    nodes,\n    source,\n    positions,\n    path,\n    originalError,\n    extensions,\n  ) {\n    var _this$nodes, _nodeLocations$, _ref;\n\n    super(message);\n    this.name = 'GraphQLError';\n    this.path = path !== null && path !== void 0 ? path : undefined;\n    this.originalError =\n      originalError !== null && originalError !== void 0\n        ? originalError\n        : undefined; // Compute list of blame nodes.\n\n    this.nodes = undefinedIfEmpty(\n      Array.isArray(nodes) ? nodes : nodes ? [nodes] : undefined,\n    );\n    const nodeLocations = undefinedIfEmpty(\n      (_this$nodes = this.nodes) === null || _this$nodes === void 0\n        ? void 0\n        : _this$nodes.map((node) => node.loc).filter((loc) => loc != null),\n    ); // Compute locations in the source for the given nodes/positions.\n\n    this.source =\n      source !== null && source !== void 0\n        ? source\n        : nodeLocations === null || nodeLocations === void 0\n        ? void 0\n        : (_nodeLocations$ = nodeLocations[0]) === null ||\n          _nodeLocations$ === void 0\n        ? void 0\n        : _nodeLocations$.source;\n    this.positions =\n      positions !== null && positions !== void 0\n        ? positions\n        : nodeLocations === null || nodeLocations === void 0\n        ? void 0\n        : nodeLocations.map((loc) => loc.start);\n    this.locations =\n      positions && source\n        ? positions.map((pos) => getLocation(source, pos))\n        : nodeLocations === null || nodeLocations === void 0\n        ? void 0\n        : nodeLocations.map((loc) => getLocation(loc.source, loc.start));\n    const originalExtensions = isObjectLike(\n      originalError === null || originalError === void 0\n        ? void 0\n        : originalError.extensions,\n    )\n      ? originalError === null || originalError === void 0\n        ? void 0\n        : originalError.extensions\n      : undefined;\n    this.extensions =\n      (_ref =\n        extensions !== null && extensions !== void 0\n          ? extensions\n          : originalExtensions) !== null && _ref !== void 0\n        ? _ref\n        : Object.create(null); // Only properties prescribed by the spec should be enumerable.\n    // Keep the rest as non-enumerable.\n\n    Object.defineProperties(this, {\n      message: {\n        writable: true,\n        enumerable: true,\n      },\n      name: {\n        enumerable: false,\n      },\n      nodes: {\n        enumerable: false,\n      },\n      source: {\n        enumerable: false,\n      },\n      positions: {\n        enumerable: false,\n      },\n      originalError: {\n        enumerable: false,\n      },\n    }); // Include (non-enumerable) stack trace.\n    // istanbul ignore next (See: 'https://github.com/graphql/graphql-js/issues/2317')\n\n    if (\n      originalError !== null &&\n      originalError !== void 0 &&\n      originalError.stack\n    ) {\n      Object.defineProperty(this, 'stack', {\n        value: originalError.stack,\n        writable: true,\n        configurable: true,\n      });\n    } else if (Error.captureStackTrace) {\n      Error.captureStackTrace(this, GraphQLError);\n    } else {\n      Object.defineProperty(this, 'stack', {\n        value: Error().stack,\n        writable: true,\n        configurable: true,\n      });\n    }\n  }\n\n  get [Symbol.toStringTag]() {\n    return 'GraphQLError';\n  }\n\n  toString() {\n    let output = this.message;\n\n    if (this.nodes) {\n      for (const node of this.nodes) {\n        if (node.loc) {\n          output += '\\n\\n' + printLocation(node.loc);\n        }\n      }\n    } else if (this.source && this.locations) {\n      for (const location of this.locations) {\n        output += '\\n\\n' + printSourceLocation(this.source, location);\n      }\n    }\n\n    return output;\n  }\n\n  toJSON() {\n    const formattedError = {\n      message: this.message,\n    };\n\n    if (this.locations != null) {\n      formattedError.locations = this.locations;\n    }\n\n    if (this.path != null) {\n      formattedError.path = this.path;\n    }\n\n    if (this.extensions != null && Object.keys(this.extensions).length > 0) {\n      formattedError.extensions = this.extensions;\n    }\n\n    return formattedError;\n  }\n}\n\nfunction undefinedIfEmpty(array) {\n  return array === undefined || array.length === 0 ? undefined : array;\n}\n/**\n * See: https://spec.graphql.org/draft/#sec-Errors\n */\n\n/**\n * Prints a GraphQLError to a string, representing useful location information\n * about the error's position in the source.\n *\n * @deprecated Please use `error.toString` instead. Will be removed in v17\n */\nexport function printError(error) {\n  return error.toString();\n}\n/**\n * Given a GraphQLError, format it according to the rules described by the\n * Response Format, Errors section of the GraphQL Specification.\n *\n * @deprecated Please use `error.toString` instead. Will be removed in v17\n */\n\nexport function formatError(error) {\n  return error.toJSON();\n}\n","/**\n * Return true if `value` is object-like. A value is object-like if it's not\n * `null` and has a `typeof` result of \"object\".\n */\nexport function isObjectLike(value) {\n  return typeof value == 'object' && value !== null;\n}\n","import { GraphQLError } from './GraphQLError.mjs';\n/**\n * Produces a GraphQLError representing a syntax error, containing useful\n * descriptive information about the syntax error's position in the source.\n */\n\nexport function syntaxError(source, position, description) {\n  return new GraphQLError(`Syntax Error: ${description}`, undefined, source, [\n    position,\n  ]);\n}\n","/**\n * The set of allowed kind values for AST nodes.\n */\nexport let Kind;\n/**\n * The enum type representing the possible kind values of AST nodes.\n *\n * @deprecated Please use `Kind`. Will be remove in v17.\n */\n\n(function (Kind) {\n  Kind['NAME'] = 'Name';\n  Kind['DOCUMENT'] = 'Document';\n  Kind['OPERATION_DEFINITION'] = 'OperationDefinition';\n  Kind['VARIABLE_DEFINITION'] = 'VariableDefinition';\n  Kind['SELECTION_SET'] = 'SelectionSet';\n  Kind['FIELD'] = 'Field';\n  Kind['ARGUMENT'] = 'Argument';\n  Kind['FRAGMENT_SPREAD'] = 'FragmentSpread';\n  Kind['INLINE_FRAGMENT'] = 'InlineFragment';\n  Kind['FRAGMENT_DEFINITION'] = 'FragmentDefinition';\n  Kind['VARIABLE'] = 'Variable';\n  Kind['INT'] = 'IntValue';\n  Kind['FLOAT'] = 'FloatValue';\n  Kind['STRING'] = 'StringValue';\n  Kind['BOOLEAN'] = 'BooleanValue';\n  Kind['NULL'] = 'NullValue';\n  Kind['ENUM'] = 'EnumValue';\n  Kind['LIST'] = 'ListValue';\n  Kind['OBJECT'] = 'ObjectValue';\n  Kind['OBJECT_FIELD'] = 'ObjectField';\n  Kind['DIRECTIVE'] = 'Directive';\n  Kind['NAMED_TYPE'] = 'NamedType';\n  Kind['LIST_TYPE'] = 'ListType';\n  Kind['NON_NULL_TYPE'] = 'NonNullType';\n  Kind['SCHEMA_DEFINITION'] = 'SchemaDefinition';\n  Kind['OPERATION_TYPE_DEFINITION'] = 'OperationTypeDefinition';\n  Kind['SCALAR_TYPE_DEFINITION'] = 'ScalarTypeDefinition';\n  Kind['OBJECT_TYPE_DEFINITION'] = 'ObjectTypeDefinition';\n  Kind['FIELD_DEFINITION'] = 'FieldDefinition';\n  Kind['INPUT_VALUE_DEFINITION'] = 'InputValueDefinition';\n  Kind['INTERFACE_TYPE_DEFINITION'] = 'InterfaceTypeDefinition';\n  Kind['UNION_TYPE_DEFINITION'] = 'UnionTypeDefinition';\n  Kind['ENUM_TYPE_DEFINITION'] = 'EnumTypeDefinition';\n  Kind['ENUM_VALUE_DEFINITION'] = 'EnumValueDefinition';\n  Kind['INPUT_OBJECT_TYPE_DEFINITION'] = 'InputObjectTypeDefinition';\n  Kind['DIRECTIVE_DEFINITION'] = 'DirectiveDefinition';\n  Kind['SCHEMA_EXTENSION'] = 'SchemaExtension';\n  Kind['SCALAR_TYPE_EXTENSION'] = 'ScalarTypeExtension';\n  Kind['OBJECT_TYPE_EXTENSION'] = 'ObjectTypeExtension';\n  Kind['INTERFACE_TYPE_EXTENSION'] = 'InterfaceTypeExtension';\n  Kind['UNION_TYPE_EXTENSION'] = 'UnionTypeExtension';\n  Kind['ENUM_TYPE_EXTENSION'] = 'EnumTypeExtension';\n  Kind['INPUT_OBJECT_TYPE_EXTENSION'] = 'InputObjectTypeExtension';\n})(Kind || (Kind = {}));\n","/**\n * Contains a range of UTF-8 character offsets and token references that\n * identify the region of the source from which the AST derived.\n */\nexport class Location {\n  /**\n   * The character offset at which this Node begins.\n   */\n\n  /**\n   * The character offset at which this Node ends.\n   */\n\n  /**\n   * The Token at which this Node begins.\n   */\n\n  /**\n   * The Token at which this Node ends.\n   */\n\n  /**\n   * The Source document the AST represents.\n   */\n  constructor(startToken, endToken, source) {\n    this.start = startToken.start;\n    this.end = endToken.end;\n    this.startToken = startToken;\n    this.endToken = endToken;\n    this.source = source;\n  }\n\n  get [Symbol.toStringTag]() {\n    return 'Location';\n  }\n\n  toJSON() {\n    return {\n      start: this.start,\n      end: this.end,\n    };\n  }\n}\n/**\n * Represents a range of characters represented by a lexical token\n * within a Source.\n */\n\nexport class Token {\n  /**\n   * The kind of Token.\n   */\n\n  /**\n   * The character offset at which this Node begins.\n   */\n\n  /**\n   * The character offset at which this Node ends.\n   */\n\n  /**\n   * The 1-indexed line number on which this Token appears.\n   */\n\n  /**\n   * The 1-indexed column number at which this Token begins.\n   */\n\n  /**\n   * For non-punctuation tokens, represents the interpreted value of the token.\n   *\n   * Note: is undefined for punctuation tokens, but typed as string for\n   * convenience in the parser.\n   */\n\n  /**\n   * Tokens exist as nodes in a double-linked-list amongst all tokens\n   * including ignored tokens. <SOF> is always the first node and <EOF>\n   * the last.\n   */\n  constructor(kind, start, end, line, column, value) {\n    this.kind = kind;\n    this.start = start;\n    this.end = end;\n    this.line = line;\n    this.column = column; // eslint-disable-next-line @typescript-eslint/no-non-null-assertion\n\n    this.value = value;\n    this.prev = null;\n    this.next = null;\n  }\n\n  get [Symbol.toStringTag]() {\n    return 'Token';\n  }\n\n  toJSON() {\n    return {\n      kind: this.kind,\n      value: this.value,\n      line: this.line,\n      column: this.column,\n    };\n  }\n}\n/**\n * The list of all possible AST node types.\n */\n\n/**\n * @internal\n */\nexport const QueryDocumentKeys = {\n  Name: [],\n  Document: ['definitions'],\n  OperationDefinition: [\n    'name',\n    'variableDefinitions',\n    'directives',\n    'selectionSet',\n  ],\n  VariableDefinition: ['variable', 'type', 'defaultValue', 'directives'],\n  Variable: ['name'],\n  SelectionSet: ['selections'],\n  Field: ['alias', 'name', 'arguments', 'directives', 'selectionSet'],\n  Argument: ['name', 'value'],\n  FragmentSpread: ['name', 'directives'],\n  InlineFragment: ['typeCondition', 'directives', 'selectionSet'],\n  FragmentDefinition: [\n    'name', // Note: fragment variable definitions are deprecated and will removed in v17.0.0\n    'variableDefinitions',\n    'typeCondition',\n    'directives',\n    'selectionSet',\n  ],\n  IntValue: [],\n  FloatValue: [],\n  StringValue: [],\n  BooleanValue: [],\n  NullValue: [],\n  EnumValue: [],\n  ListValue: ['values'],\n  ObjectValue: ['fields'],\n  ObjectField: ['name', 'value'],\n  Directive: ['name', 'arguments'],\n  NamedType: ['name'],\n  ListType: ['type'],\n  NonNullType: ['type'],\n  SchemaDefinition: ['description', 'directives', 'operationTypes'],\n  OperationTypeDefinition: ['type'],\n  ScalarTypeDefinition: ['description', 'name', 'directives'],\n  ObjectTypeDefinition: [\n    'description',\n    'name',\n    'interfaces',\n    'directives',\n    'fields',\n  ],\n  FieldDefinition: ['description', 'name', 'arguments', 'type', 'directives'],\n  InputValueDefinition: [\n    'description',\n    'name',\n    'type',\n    'defaultValue',\n    'directives',\n  ],\n  InterfaceTypeDefinition: [\n    'description',\n    'name',\n    'interfaces',\n    'directives',\n    'fields',\n  ],\n  UnionTypeDefinition: ['description', 'name', 'directives', 'types'],\n  EnumTypeDefinition: ['description', 'name', 'directives', 'values'],\n  EnumValueDefinition: ['description', 'name', 'directives'],\n  InputObjectTypeDefinition: ['description', 'name', 'directives', 'fields'],\n  DirectiveDefinition: ['description', 'name', 'arguments', 'locations'],\n  SchemaExtension: ['directives', 'operationTypes'],\n  ScalarTypeExtension: ['name', 'directives'],\n  ObjectTypeExtension: ['name', 'interfaces', 'directives', 'fields'],\n  InterfaceTypeExtension: ['name', 'interfaces', 'directives', 'fields'],\n  UnionTypeExtension: ['name', 'directives', 'types'],\n  EnumTypeExtension: ['name', 'directives', 'values'],\n  InputObjectTypeExtension: ['name', 'directives', 'fields'],\n};\nconst kindValues = new Set(Object.keys(QueryDocumentKeys));\n/**\n * @internal\n */\n\nexport function isNode(maybeNode) {\n  const maybeKind =\n    maybeNode === null || maybeNode === void 0 ? void 0 : maybeNode.kind;\n  return typeof maybeKind === 'string' && kindValues.has(maybeKind);\n}\n/** Name */\n\nexport let OperationTypeNode;\n\n(function (OperationTypeNode) {\n  OperationTypeNode['QUERY'] = 'query';\n  OperationTypeNode['MUTATION'] = 'mutation';\n  OperationTypeNode['SUBSCRIPTION'] = 'subscription';\n})(OperationTypeNode || (OperationTypeNode = {}));\n","/**\n * An exported enum describing the different kinds of tokens that the\n * lexer emits.\n */\nexport let TokenKind;\n/**\n * The enum type representing the token kinds values.\n *\n * @deprecated Please use `TokenKind`. Will be remove in v17.\n */\n\n(function (TokenKind) {\n  TokenKind['SOF'] = '<SOF>';\n  TokenKind['EOF'] = '<EOF>';\n  TokenKind['BANG'] = '!';\n  TokenKind['DOLLAR'] = '$';\n  TokenKind['AMP'] = '&';\n  TokenKind['PAREN_L'] = '(';\n  TokenKind['PAREN_R'] = ')';\n  TokenKind['SPREAD'] = '...';\n  TokenKind['COLON'] = ':';\n  TokenKind['EQUALS'] = '=';\n  TokenKind['AT'] = '@';\n  TokenKind['BRACKET_L'] = '[';\n  TokenKind['BRACKET_R'] = ']';\n  TokenKind['BRACE_L'] = '{';\n  TokenKind['PIPE'] = '|';\n  TokenKind['BRACE_R'] = '}';\n  TokenKind['NAME'] = 'Name';\n  TokenKind['INT'] = 'Int';\n  TokenKind['FLOAT'] = 'Float';\n  TokenKind['STRING'] = 'String';\n  TokenKind['BLOCK_STRING'] = 'BlockString';\n  TokenKind['COMMENT'] = 'Comment';\n})(TokenKind || (TokenKind = {}));\n","const MAX_ARRAY_LENGTH = 10;\nconst MAX_RECURSIVE_DEPTH = 2;\n/**\n * Used to print values in error messages.\n */\n\nexport function inspect(value) {\n  return formatValue(value, []);\n}\n\nfunction formatValue(value, seenValues) {\n  switch (typeof value) {\n    case 'string':\n      return JSON.stringify(value);\n\n    case 'function':\n      return value.name ? `[function ${value.name}]` : '[function]';\n\n    case 'object':\n      return formatObjectValue(value, seenValues);\n\n    default:\n      return String(value);\n  }\n}\n\nfunction formatObjectValue(value, previouslySeenValues) {\n  if (value === null) {\n    return 'null';\n  }\n\n  if (previouslySeenValues.includes(value)) {\n    return '[Circular]';\n  }\n\n  const seenValues = [...previouslySeenValues, value];\n\n  if (isJSONable(value)) {\n    const jsonValue = value.toJSON(); // check for infinite recursion\n\n    if (jsonValue !== value) {\n      return typeof jsonValue === 'string'\n        ? jsonValue\n        : formatValue(jsonValue, seenValues);\n    }\n  } else if (Array.isArray(value)) {\n    return formatArray(value, seenValues);\n  }\n\n  return formatObject(value, seenValues);\n}\n\nfunction isJSONable(value) {\n  return typeof value.toJSON === 'function';\n}\n\nfunction formatObject(object, seenValues) {\n  const entries = Object.entries(object);\n\n  if (entries.length === 0) {\n    return '{}';\n  }\n\n  if (seenValues.length > MAX_RECURSIVE_DEPTH) {\n    return '[' + getObjectTag(object) + ']';\n  }\n\n  const properties = entries.map(\n    ([key, value]) => key + ': ' + formatValue(value, seenValues),\n  );\n  return '{ ' + properties.join(', ') + ' }';\n}\n\nfunction formatArray(array, seenValues) {\n  if (array.length === 0) {\n    return '[]';\n  }\n\n  if (seenValues.length > MAX_RECURSIVE_DEPTH) {\n    return '[Array]';\n  }\n\n  const len = Math.min(MAX_ARRAY_LENGTH, array.length);\n  const remaining = array.length - len;\n  const items = [];\n\n  for (let i = 0; i < len; ++i) {\n    items.push(formatValue(array[i], seenValues));\n  }\n\n  if (remaining === 1) {\n    items.push('... 1 more item');\n  } else if (remaining > 1) {\n    items.push(`... ${remaining} more items`);\n  }\n\n  return '[' + items.join(', ') + ']';\n}\n\nfunction getObjectTag(object) {\n  const tag = Object.prototype.toString\n    .call(object)\n    .replace(/^\\[object /, '')\n    .replace(/]$/, '');\n\n  if (tag === 'Object' && typeof object.constructor === 'function') {\n    const name = object.constructor.name;\n\n    if (typeof name === 'string' && name !== '') {\n      return name;\n    }\n  }\n\n  return tag;\n}\n","export function devAssert(condition, message) {\n  const booleanCondition = Boolean(condition); // istanbul ignore else (See transformation done in './resources/inlineInvariant.js')\n\n  if (!booleanCondition) {\n    throw new Error(message);\n  }\n}\n","import { inspect } from '../jsutils/inspect.mjs';\nimport { devAssert } from '../jsutils/devAssert.mjs';\nimport { instanceOf } from '../jsutils/instanceOf.mjs';\n\n/**\n * A representation of source input to GraphQL. The `name` and `locationOffset` parameters are\n * optional, but they are useful for clients who store GraphQL documents in source files.\n * For example, if the GraphQL input starts at line 40 in a file named `Foo.graphql`, it might\n * be useful for `name` to be `\"Foo.graphql\"` and location to be `{ line: 40, column: 1 }`.\n * The `line` and `column` properties in `locationOffset` are 1-indexed.\n */\nexport class Source {\n  constructor(\n    body,\n    name = 'GraphQL request',\n    locationOffset = {\n      line: 1,\n      column: 1,\n    },\n  ) {\n    typeof body === 'string' ||\n      devAssert(false, `Body must be a string. Received: ${inspect(body)}.`);\n    this.body = body;\n    this.name = name;\n    this.locationOffset = locationOffset;\n    this.locationOffset.line > 0 ||\n      devAssert(\n        false,\n        'line in locationOffset is 1-indexed and must be positive.',\n      );\n    this.locationOffset.column > 0 ||\n      devAssert(\n        false,\n        'column in locationOffset is 1-indexed and must be positive.',\n      );\n  }\n\n  get [Symbol.toStringTag]() {\n    return 'Source';\n  }\n}\n/**\n * Test if the given value is a Source object.\n *\n * @internal\n */\n\nexport function isSource(source) {\n  return instanceOf(source, Source);\n}\n","/**\n * The set of allowed directive location values.\n */\nexport let DirectiveLocation;\n/**\n * The enum type representing the directive location values.\n *\n * @deprecated Please use `DirectiveLocation`. Will be remove in v17.\n */\n\n(function (DirectiveLocation) {\n  DirectiveLocation['QUERY'] = 'QUERY';\n  DirectiveLocation['MUTATION'] = 'MUTATION';\n  DirectiveLocation['SUBSCRIPTION'] = 'SUBSCRIPTION';\n  DirectiveLocation['FIELD'] = 'FIELD';\n  DirectiveLocation['FRAGMENT_DEFINITION'] = 'FRAGMENT_DEFINITION';\n  DirectiveLocation['FRAGMENT_SPREAD'] = 'FRAGMENT_SPREAD';\n  DirectiveLocation['INLINE_FRAGMENT'] = 'INLINE_FRAGMENT';\n  DirectiveLocation['VARIABLE_DEFINITION'] = 'VARIABLE_DEFINITION';\n  DirectiveLocation['SCHEMA'] = 'SCHEMA';\n  DirectiveLocation['SCALAR'] = 'SCALAR';\n  DirectiveLocation['OBJECT'] = 'OBJECT';\n  DirectiveLocation['FIELD_DEFINITION'] = 'FIELD_DEFINITION';\n  DirectiveLocation['ARGUMENT_DEFINITION'] = 'ARGUMENT_DEFINITION';\n  DirectiveLocation['INTERFACE'] = 'INTERFACE';\n  DirectiveLocation['UNION'] = 'UNION';\n  DirectiveLocation['ENUM'] = 'ENUM';\n  DirectiveLocation['ENUM_VALUE'] = 'ENUM_VALUE';\n  DirectiveLocation['INPUT_OBJECT'] = 'INPUT_OBJECT';\n  DirectiveLocation['INPUT_FIELD_DEFINITION'] = 'INPUT_FIELD_DEFINITION';\n})(DirectiveLocation || (DirectiveLocation = {}));\n","/**\n * Produces the value of a block string from its parsed raw value, similar to\n * CoffeeScript's block string, Python's docstring trim or Ruby's strip_heredoc.\n *\n * This implements the GraphQL spec's BlockStringValue() static algorithm.\n *\n * @internal\n */\nexport function dedentBlockStringValue(rawString) {\n  // Expand a block string's raw value into independent lines.\n  const lines = rawString.split(/\\r\\n|[\\n\\r]/g); // Remove common indentation from all lines but first.\n\n  const commonIndent = getBlockStringIndentation(rawString);\n\n  if (commonIndent !== 0) {\n    for (let i = 1; i < lines.length; i++) {\n      lines[i] = lines[i].slice(commonIndent);\n    }\n  } // Remove leading and trailing blank lines.\n\n  let startLine = 0;\n\n  while (startLine < lines.length && isBlank(lines[startLine])) {\n    ++startLine;\n  }\n\n  let endLine = lines.length;\n\n  while (endLine > startLine && isBlank(lines[endLine - 1])) {\n    --endLine;\n  } // Return a string of the lines joined with U+000A.\n\n  return lines.slice(startLine, endLine).join('\\n');\n}\n\nfunction isBlank(str) {\n  for (const char of str) {\n    if (char !== ' ' && char !== '\\t') {\n      return false;\n    }\n  }\n\n  return true;\n}\n/**\n * @internal\n */\n\nexport function getBlockStringIndentation(value) {\n  var _commonIndent;\n\n  let isFirstLine = true;\n  let isEmptyLine = true;\n  let indent = 0;\n  let commonIndent = null;\n\n  for (let i = 0; i < value.length; ++i) {\n    switch (value.charCodeAt(i)) {\n      case 13:\n        //  \\r\n        if (value.charCodeAt(i + 1) === 10) {\n          ++i; // skip \\r\\n as one symbol\n        }\n\n      // falls through\n\n      case 10:\n        //  \\n\n        isFirstLine = false;\n        isEmptyLine = true;\n        indent = 0;\n        break;\n\n      case 9: //   \\t\n\n      case 32:\n        //  <space>\n        ++indent;\n        break;\n\n      default:\n        if (\n          isEmptyLine &&\n          !isFirstLine &&\n          (commonIndent === null || indent < commonIndent)\n        ) {\n          commonIndent = indent;\n        }\n\n        isEmptyLine = false;\n    }\n  }\n\n  return (_commonIndent = commonIndent) !== null && _commonIndent !== void 0\n    ? _commonIndent\n    : 0;\n}\n/**\n * Print a block string in the indented block form by adding a leading and\n * trailing blank line. However, if a block string starts with whitespace and is\n * a single-line, adding a leading blank line would strip that whitespace.\n *\n * @internal\n */\n\nexport function printBlockString(value, preferMultipleLines = false) {\n  const isSingleLine = !value.includes('\\n');\n  const hasLeadingSpace = value.startsWith(' ') || value.startsWith('\\t');\n  const hasTrailingQuote = value.endsWith('\"');\n  const hasTrailingSlash = value.endsWith('\\\\');\n  const printAsMultipleLines =\n    !isSingleLine ||\n    hasTrailingQuote ||\n    hasTrailingSlash ||\n    preferMultipleLines;\n  let result = ''; // Format a multi-line block quote to account for leading space.\n\n  if (printAsMultipleLines && !(isSingleLine && hasLeadingSpace)) {\n    result += '\\n';\n  }\n\n  result += value;\n\n  if (printAsMultipleLines) {\n    result += '\\n';\n  }\n\n  return '\"\"\"' + result.replace(/\"\"\"/g, '\\\\\"\"\"') + '\"\"\"';\n}\n","/**\n * ```\n * Digit :: one of\n *   - `0` `1` `2` `3` `4` `5` `6` `7` `8` `9`\n * ```\n * @internal\n */\nexport function isDigit(code) {\n  return code >= 0x0030 && code <= 0x0039;\n}\n/**\n * ```\n * Letter :: one of\n *   - `A` `B` `C` `D` `E` `F` `G` `H` `I` `J` `K` `L` `M`\n *   - `N` `O` `P` `Q` `R` `S` `T` `U` `V` `W` `X` `Y` `Z`\n *   - `a` `b` `c` `d` `e` `f` `g` `h` `i` `j` `k` `l` `m`\n *   - `n` `o` `p` `q` `r` `s` `t` `u` `v` `w` `x` `y` `z`\n * ```\n * @internal\n */\n\nexport function isLetter(code) {\n  return (\n    (code >= 0x0061 && code <= 0x007a) || // A-Z\n    (code >= 0x0041 && code <= 0x005a) // a-z\n  );\n}\n/**\n * ```\n * NameStart ::\n *   - Letter\n *   - `_`\n * ```\n * @internal\n */\n\nexport function isNameStart(code) {\n  return isLetter(code) || code === 0x005f;\n}\n/**\n * ```\n * NameContinue ::\n *   - Letter\n *   - Digit\n *   - `_`\n * ```\n * @internal\n */\n\nexport function isNameContinue(code) {\n  return isLetter(code) || isDigit(code) || code === 0x005f;\n}\n","import { syntaxError } from '../error/syntaxError.mjs';\nimport { Token } from './ast.mjs';\nimport { TokenKind } from './tokenKind.mjs';\nimport { dedentBlockStringValue } from './blockString.mjs';\nimport { isDigit, isNameStart, isNameContinue } from './characterClasses.mjs';\n/**\n * Given a Source object, creates a Lexer for that source.\n * A Lexer is a stateful stream generator in that every time\n * it is advanced, it returns the next token in the Source. Assuming the\n * source lexes, the final Token emitted by the lexer will be of kind\n * EOF, after which the lexer will repeatedly return the same EOF token\n * whenever called.\n */\n\nexport class Lexer {\n  /**\n   * The previously focused non-ignored token.\n   */\n\n  /**\n   * The currently focused non-ignored token.\n   */\n\n  /**\n   * The (1-indexed) line containing the current token.\n   */\n\n  /**\n   * The character offset at which the current line begins.\n   */\n  constructor(source) {\n    const startOfFileToken = new Token(TokenKind.SOF, 0, 0, 0, 0);\n    this.source = source;\n    this.lastToken = startOfFileToken;\n    this.token = startOfFileToken;\n    this.line = 1;\n    this.lineStart = 0;\n  }\n\n  get [Symbol.toStringTag]() {\n    return 'Lexer';\n  }\n  /**\n   * Advances the token stream to the next non-ignored token.\n   */\n\n  advance() {\n    this.lastToken = this.token;\n    const token = (this.token = this.lookahead());\n    return token;\n  }\n  /**\n   * Looks ahead and returns the next non-ignored token, but does not change\n   * the state of Lexer.\n   */\n\n  lookahead() {\n    let token = this.token;\n\n    if (token.kind !== TokenKind.EOF) {\n      do {\n        if (token.next) {\n          token = token.next;\n        } else {\n          // Read the next token and form a link in the token linked-list.\n          const nextToken = readNextToken(this, token.end); // @ts-expect-error next is only mutable during parsing.\n\n          token.next = nextToken; // @ts-expect-error prev is only mutable during parsing.\n\n          nextToken.prev = token;\n          token = nextToken;\n        }\n      } while (token.kind === TokenKind.COMMENT);\n    }\n\n    return token;\n  }\n}\n/**\n * @internal\n */\n\nexport function isPunctuatorTokenKind(kind) {\n  return (\n    kind === TokenKind.BANG ||\n    kind === TokenKind.DOLLAR ||\n    kind === TokenKind.AMP ||\n    kind === TokenKind.PAREN_L ||\n    kind === TokenKind.PAREN_R ||\n    kind === TokenKind.SPREAD ||\n    kind === TokenKind.COLON ||\n    kind === TokenKind.EQUALS ||\n    kind === TokenKind.AT ||\n    kind === TokenKind.BRACKET_L ||\n    kind === TokenKind.BRACKET_R ||\n    kind === TokenKind.BRACE_L ||\n    kind === TokenKind.PIPE ||\n    kind === TokenKind.BRACE_R\n  );\n}\n/**\n * A Unicode scalar value is any Unicode code point except surrogate code\n * points. In other words, the inclusive ranges of values 0x0000 to 0xD7FF and\n * 0xE000 to 0x10FFFF.\n *\n * SourceCharacter ::\n *   - \"Any Unicode scalar value\"\n */\n\nfunction isUnicodeScalarValue(code) {\n  return (\n    (code >= 0x0000 && code <= 0xd7ff) || (code >= 0xe000 && code <= 0x10ffff)\n  );\n}\n/**\n * The GraphQL specification defines source text as a sequence of unicode scalar\n * values (which Unicode defines to exclude surrogate code points). However\n * JavaScript defines strings as a sequence of UTF-16 code units which may\n * include surrogates. A surrogate pair is a valid source character as it\n * encodes a supplementary code point (above U+FFFF), but unpaired surrogate\n * code points are not valid source characters.\n */\n\nfunction isSupplementaryCodePoint(body, location) {\n  return (\n    isLeadingSurrogate(body.charCodeAt(location)) &&\n    isTrailingSurrogate(body.charCodeAt(location + 1))\n  );\n}\n\nfunction isLeadingSurrogate(code) {\n  return code >= 0xd800 && code <= 0xdbff;\n}\n\nfunction isTrailingSurrogate(code) {\n  return code >= 0xdc00 && code <= 0xdfff;\n}\n/**\n * Prints the code point (or end of file reference) at a given location in a\n * source for use in error messages.\n *\n * Printable ASCII is printed quoted, while other points are printed in Unicode\n * code point form (ie. U+1234).\n */\n\nfunction printCodePointAt(lexer, location) {\n  const code = lexer.source.body.codePointAt(location);\n\n  if (code === undefined) {\n    return TokenKind.EOF;\n  } else if (code >= 0x0020 && code <= 0x007e) {\n    // Printable ASCII\n    const char = String.fromCodePoint(code);\n    return char === '\"' ? \"'\\\"'\" : `\"${char}\"`;\n  } // Unicode code point\n\n  return 'U+' + code.toString(16).toUpperCase().padStart(4, '0');\n}\n/**\n * Create a token with line and column location information.\n */\n\nfunction createToken(lexer, kind, start, end, value) {\n  const line = lexer.line;\n  const col = 1 + start - lexer.lineStart;\n  return new Token(kind, start, end, line, col, value);\n}\n/**\n * Gets the next token from the source starting at the given position.\n *\n * This skips over whitespace until it finds the next lexable token, then lexes\n * punctuators immediately or calls the appropriate helper function for more\n * complicated tokens.\n */\n\nfunction readNextToken(lexer, start) {\n  const body = lexer.source.body;\n  const bodyLength = body.length;\n  let position = start;\n\n  while (position < bodyLength) {\n    const code = body.charCodeAt(position); // SourceCharacter\n\n    switch (code) {\n      // Ignored ::\n      //   - UnicodeBOM\n      //   - WhiteSpace\n      //   - LineTerminator\n      //   - Comment\n      //   - Comma\n      //\n      // UnicodeBOM :: \"Byte Order Mark (U+FEFF)\"\n      //\n      // WhiteSpace ::\n      //   - \"Horizontal Tab (U+0009)\"\n      //   - \"Space (U+0020)\"\n      //\n      // Comma :: ,\n      case 0xfeff: // <BOM>\n\n      case 0x0009: // \\t\n\n      case 0x0020: // <space>\n\n      case 0x002c:\n        // ,\n        ++position;\n        continue;\n      // LineTerminator ::\n      //   - \"New Line (U+000A)\"\n      //   - \"Carriage Return (U+000D)\" [lookahead != \"New Line (U+000A)\"]\n      //   - \"Carriage Return (U+000D)\" \"New Line (U+000A)\"\n\n      case 0x000a:\n        // \\n\n        ++position;\n        ++lexer.line;\n        lexer.lineStart = position;\n        continue;\n\n      case 0x000d:\n        // \\r\n        if (body.charCodeAt(position + 1) === 0x000a) {\n          position += 2;\n        } else {\n          ++position;\n        }\n\n        ++lexer.line;\n        lexer.lineStart = position;\n        continue;\n      // Comment\n\n      case 0x0023:\n        // #\n        return readComment(lexer, position);\n      // Token ::\n      //   - Punctuator\n      //   - Name\n      //   - IntValue\n      //   - FloatValue\n      //   - StringValue\n      //\n      // Punctuator :: one of ! $ & ( ) ... : = @ [ ] { | }\n\n      case 0x0021:\n        // !\n        return createToken(lexer, TokenKind.BANG, position, position + 1);\n\n      case 0x0024:\n        // $\n        return createToken(lexer, TokenKind.DOLLAR, position, position + 1);\n\n      case 0x0026:\n        // &\n        return createToken(lexer, TokenKind.AMP, position, position + 1);\n\n      case 0x0028:\n        // (\n        return createToken(lexer, TokenKind.PAREN_L, position, position + 1);\n\n      case 0x0029:\n        // )\n        return createToken(lexer, TokenKind.PAREN_R, position, position + 1);\n\n      case 0x002e:\n        // .\n        if (\n          body.charCodeAt(position + 1) === 0x002e &&\n          body.charCodeAt(position + 2) === 0x002e\n        ) {\n          return createToken(lexer, TokenKind.SPREAD, position, position + 3);\n        }\n\n        break;\n\n      case 0x003a:\n        // :\n        return createToken(lexer, TokenKind.COLON, position, position + 1);\n\n      case 0x003d:\n        // =\n        return createToken(lexer, TokenKind.EQUALS, position, position + 1);\n\n      case 0x0040:\n        // @\n        return createToken(lexer, TokenKind.AT, position, position + 1);\n\n      case 0x005b:\n        // [\n        return createToken(lexer, TokenKind.BRACKET_L, position, position + 1);\n\n      case 0x005d:\n        // ]\n        return createToken(lexer, TokenKind.BRACKET_R, position, position + 1);\n\n      case 0x007b:\n        // {\n        return createToken(lexer, TokenKind.BRACE_L, position, position + 1);\n\n      case 0x007c:\n        // |\n        return createToken(lexer, TokenKind.PIPE, position, position + 1);\n\n      case 0x007d:\n        // }\n        return createToken(lexer, TokenKind.BRACE_R, position, position + 1);\n      // StringValue\n\n      case 0x0022:\n        // \"\n        if (\n          body.charCodeAt(position + 1) === 0x0022 &&\n          body.charCodeAt(position + 2) === 0x0022\n        ) {\n          return readBlockString(lexer, position);\n        }\n\n        return readString(lexer, position);\n    } // IntValue | FloatValue (Digit | -)\n\n    if (isDigit(code) || code === 0x002d) {\n      return readNumber(lexer, position, code);\n    } // Name\n\n    if (isNameStart(code)) {\n      return readName(lexer, position);\n    }\n\n    throw syntaxError(\n      lexer.source,\n      position,\n      code === 0x0027\n        ? 'Unexpected single quote character (\\'), did you mean to use a double quote (\")?'\n        : isUnicodeScalarValue(code) || isSupplementaryCodePoint(body, position)\n        ? `Unexpected character: ${printCodePointAt(lexer, position)}.`\n        : `Invalid character: ${printCodePointAt(lexer, position)}.`,\n    );\n  }\n\n  return createToken(lexer, TokenKind.EOF, bodyLength, bodyLength);\n}\n/**\n * Reads a comment token from the source file.\n *\n * ```\n * Comment :: # CommentChar* [lookahead != CommentChar]\n *\n * CommentChar :: SourceCharacter but not LineTerminator\n * ```\n */\n\nfunction readComment(lexer, start) {\n  const body = lexer.source.body;\n  const bodyLength = body.length;\n  let position = start + 1;\n\n  while (position < bodyLength) {\n    const code = body.charCodeAt(position); // LineTerminator (\\n | \\r)\n\n    if (code === 0x000a || code === 0x000d) {\n      break;\n    } // SourceCharacter\n\n    if (isUnicodeScalarValue(code)) {\n      ++position;\n    } else if (isSupplementaryCodePoint(body, position)) {\n      position += 2;\n    } else {\n      break;\n    }\n  }\n\n  return createToken(\n    lexer,\n    TokenKind.COMMENT,\n    start,\n    position,\n    body.slice(start + 1, position),\n  );\n}\n/**\n * Reads a number token from the source file, either a FloatValue or an IntValue\n * depending on whether a FractionalPart or ExponentPart is encountered.\n *\n * ```\n * IntValue :: IntegerPart [lookahead != {Digit, `.`, NameStart}]\n *\n * IntegerPart ::\n *   - NegativeSign? 0\n *   - NegativeSign? NonZeroDigit Digit*\n *\n * NegativeSign :: -\n *\n * NonZeroDigit :: Digit but not `0`\n *\n * FloatValue ::\n *   - IntegerPart FractionalPart ExponentPart [lookahead != {Digit, `.`, NameStart}]\n *   - IntegerPart FractionalPart [lookahead != {Digit, `.`, NameStart}]\n *   - IntegerPart ExponentPart [lookahead != {Digit, `.`, NameStart}]\n *\n * FractionalPart :: . Digit+\n *\n * ExponentPart :: ExponentIndicator Sign? Digit+\n *\n * ExponentIndicator :: one of `e` `E`\n *\n * Sign :: one of + -\n * ```\n */\n\nfunction readNumber(lexer, start, firstCode) {\n  const body = lexer.source.body;\n  let position = start;\n  let code = firstCode;\n  let isFloat = false; // NegativeSign (-)\n\n  if (code === 0x002d) {\n    code = body.charCodeAt(++position);\n  } // Zero (0)\n\n  if (code === 0x0030) {\n    code = body.charCodeAt(++position);\n\n    if (isDigit(code)) {\n      throw syntaxError(\n        lexer.source,\n        position,\n        `Invalid number, unexpected digit after 0: ${printCodePointAt(\n          lexer,\n          position,\n        )}.`,\n      );\n    }\n  } else {\n    position = readDigits(lexer, position, code);\n    code = body.charCodeAt(position);\n  } // Full stop (.)\n\n  if (code === 0x002e) {\n    isFloat = true;\n    code = body.charCodeAt(++position);\n    position = readDigits(lexer, position, code);\n    code = body.charCodeAt(position);\n  } // E e\n\n  if (code === 0x0045 || code === 0x0065) {\n    isFloat = true;\n    code = body.charCodeAt(++position); // + -\n\n    if (code === 0x002b || code === 0x002d) {\n      code = body.charCodeAt(++position);\n    }\n\n    position = readDigits(lexer, position, code);\n    code = body.charCodeAt(position);\n  } // Numbers cannot be followed by . or NameStart\n\n  if (code === 0x002e || isNameStart(code)) {\n    throw syntaxError(\n      lexer.source,\n      position,\n      `Invalid number, expected digit but got: ${printCodePointAt(\n        lexer,\n        position,\n      )}.`,\n    );\n  }\n\n  return createToken(\n    lexer,\n    isFloat ? TokenKind.FLOAT : TokenKind.INT,\n    start,\n    position,\n    body.slice(start, position),\n  );\n}\n/**\n * Returns the new position in the source after reading one or more digits.\n */\n\nfunction readDigits(lexer, start, firstCode) {\n  if (!isDigit(firstCode)) {\n    throw syntaxError(\n      lexer.source,\n      start,\n      `Invalid number, expected digit but got: ${printCodePointAt(\n        lexer,\n        start,\n      )}.`,\n    );\n  }\n\n  const body = lexer.source.body;\n  let position = start + 1; // +1 to skip first firstCode\n\n  while (isDigit(body.charCodeAt(position))) {\n    ++position;\n  }\n\n  return position;\n}\n/**\n * Reads a single-quote string token from the source file.\n *\n * ```\n * StringValue ::\n *   - `\"\"` [lookahead != `\"`]\n *   - `\"` StringCharacter+ `\"`\n *\n * StringCharacter ::\n *   - SourceCharacter but not `\"` or `\\` or LineTerminator\n *   - `\\u` EscapedUnicode\n *   - `\\` EscapedCharacter\n *\n * EscapedUnicode ::\n *   - `{` HexDigit+ `}`\n *   - HexDigit HexDigit HexDigit HexDigit\n *\n * EscapedCharacter :: one of `\"` `\\` `/` `b` `f` `n` `r` `t`\n * ```\n */\n\nfunction readString(lexer, start) {\n  const body = lexer.source.body;\n  const bodyLength = body.length;\n  let position = start + 1;\n  let chunkStart = position;\n  let value = '';\n\n  while (position < bodyLength) {\n    const code = body.charCodeAt(position); // Closing Quote (\")\n\n    if (code === 0x0022) {\n      value += body.slice(chunkStart, position);\n      return createToken(lexer, TokenKind.STRING, start, position + 1, value);\n    } // Escape Sequence (\\)\n\n    if (code === 0x005c) {\n      value += body.slice(chunkStart, position);\n      const escape =\n        body.charCodeAt(position + 1) === 0x0075 // u\n          ? body.charCodeAt(position + 2) === 0x007b // {\n            ? readEscapedUnicodeVariableWidth(lexer, position)\n            : readEscapedUnicodeFixedWidth(lexer, position)\n          : readEscapedCharacter(lexer, position);\n      value += escape.value;\n      position += escape.size;\n      chunkStart = position;\n      continue;\n    } // LineTerminator (\\n | \\r)\n\n    if (code === 0x000a || code === 0x000d) {\n      break;\n    } // SourceCharacter\n\n    if (isUnicodeScalarValue(code)) {\n      ++position;\n    } else if (isSupplementaryCodePoint(body, position)) {\n      position += 2;\n    } else {\n      throw syntaxError(\n        lexer.source,\n        position,\n        `Invalid character within String: ${printCodePointAt(\n          lexer,\n          position,\n        )}.`,\n      );\n    }\n  }\n\n  throw syntaxError(lexer.source, position, 'Unterminated string.');\n} // The string value and lexed size of an escape sequence.\n\nfunction readEscapedUnicodeVariableWidth(lexer, position) {\n  const body = lexer.source.body;\n  let point = 0;\n  let size = 3; // Cannot be larger than 12 chars (\\u{00000000}).\n\n  while (size < 12) {\n    const code = body.charCodeAt(position + size++); // Closing Brace (})\n\n    if (code === 0x007d) {\n      // Must be at least 5 chars (\\u{0}) and encode a Unicode scalar value.\n      if (size < 5 || !isUnicodeScalarValue(point)) {\n        break;\n      }\n\n      return {\n        value: String.fromCodePoint(point),\n        size,\n      };\n    } // Append this hex digit to the code point.\n\n    point = (point << 4) | readHexDigit(code);\n\n    if (point < 0) {\n      break;\n    }\n  }\n\n  throw syntaxError(\n    lexer.source,\n    position,\n    `Invalid Unicode escape sequence: \"${body.slice(\n      position,\n      position + size,\n    )}\".`,\n  );\n}\n\nfunction readEscapedUnicodeFixedWidth(lexer, position) {\n  const body = lexer.source.body;\n  const code = read16BitHexCode(body, position + 2);\n\n  if (isUnicodeScalarValue(code)) {\n    return {\n      value: String.fromCodePoint(code),\n      size: 6,\n    };\n  } // GraphQL allows JSON-style surrogate pair escape sequences, but only when\n  // a valid pair is formed.\n\n  if (isLeadingSurrogate(code)) {\n    // \\u\n    if (\n      body.charCodeAt(position + 6) === 0x005c &&\n      body.charCodeAt(position + 7) === 0x0075\n    ) {\n      const trailingCode = read16BitHexCode(body, position + 8);\n\n      if (isTrailingSurrogate(trailingCode)) {\n        // JavaScript defines strings as a sequence of UTF-16 code units and\n        // encodes Unicode code points above U+FFFF using a surrogate pair of\n        // code units. Since this is a surrogate pair escape sequence, just\n        // include both codes into the JavaScript string value. Had JavaScript\n        // not been internally based on UTF-16, then this surrogate pair would\n        // be decoded to retrieve the supplementary code point.\n        return {\n          value: String.fromCodePoint(code, trailingCode),\n          size: 12,\n        };\n      }\n    }\n  }\n\n  throw syntaxError(\n    lexer.source,\n    position,\n    `Invalid Unicode escape sequence: \"${body.slice(position, position + 6)}\".`,\n  );\n}\n/**\n * Reads four hexadecimal characters and returns the positive integer that 16bit\n * hexadecimal string represents. For example, \"000f\" will return 15, and \"dead\"\n * will return 57005.\n *\n * Returns a negative number if any char was not a valid hexadecimal digit.\n */\n\nfunction read16BitHexCode(body, position) {\n  // readHexDigit() returns -1 on error. ORing a negative value with any other\n  // value always produces a negative value.\n  return (\n    (readHexDigit(body.charCodeAt(position)) << 12) |\n    (readHexDigit(body.charCodeAt(position + 1)) << 8) |\n    (readHexDigit(body.charCodeAt(position + 2)) << 4) |\n    readHexDigit(body.charCodeAt(position + 3))\n  );\n}\n/**\n * Reads a hexadecimal character and returns its positive integer value (0-15).\n *\n * '0' becomes 0, '9' becomes 9\n * 'A' becomes 10, 'F' becomes 15\n * 'a' becomes 10, 'f' becomes 15\n *\n * Returns -1 if the provided character code was not a valid hexadecimal digit.\n *\n * HexDigit :: one of\n *   - `0` `1` `2` `3` `4` `5` `6` `7` `8` `9`\n *   - `A` `B` `C` `D` `E` `F`\n *   - `a` `b` `c` `d` `e` `f`\n */\n\nfunction readHexDigit(code) {\n  return code >= 0x0030 && code <= 0x0039 // 0-9\n    ? code - 0x0030\n    : code >= 0x0041 && code <= 0x0046 // A-F\n    ? code - 0x0037\n    : code >= 0x0061 && code <= 0x0066 // a-f\n    ? code - 0x0057\n    : -1;\n}\n/**\n * | Escaped Character | Code Point | Character Name               |\n * | ----------------- | ---------- | ---------------------------- |\n * | `\"`               | U+0022     | double quote                 |\n * | `\\`               | U+005C     | reverse solidus (back slash) |\n * | `/`               | U+002F     | solidus (forward slash)      |\n * | `b`               | U+0008     | backspace                    |\n * | `f`               | U+000C     | form feed                    |\n * | `n`               | U+000A     | line feed (new line)         |\n * | `r`               | U+000D     | carriage return              |\n * | `t`               | U+0009     | horizontal tab               |\n */\n\nfunction readEscapedCharacter(lexer, position) {\n  const body = lexer.source.body;\n  const code = body.charCodeAt(position + 1);\n\n  switch (code) {\n    case 0x0022:\n      // \"\n      return {\n        value: '\\u0022',\n        size: 2,\n      };\n\n    case 0x005c:\n      // \\\n      return {\n        value: '\\u005c',\n        size: 2,\n      };\n\n    case 0x002f:\n      // /\n      return {\n        value: '\\u002f',\n        size: 2,\n      };\n\n    case 0x0062:\n      // b\n      return {\n        value: '\\u0008',\n        size: 2,\n      };\n\n    case 0x0066:\n      // f\n      return {\n        value: '\\u000c',\n        size: 2,\n      };\n\n    case 0x006e:\n      // n\n      return {\n        value: '\\u000a',\n        size: 2,\n      };\n\n    case 0x0072:\n      // r\n      return {\n        value: '\\u000d',\n        size: 2,\n      };\n\n    case 0x0074:\n      // t\n      return {\n        value: '\\u0009',\n        size: 2,\n      };\n  }\n\n  throw syntaxError(\n    lexer.source,\n    position,\n    `Invalid character escape sequence: \"${body.slice(\n      position,\n      position + 2,\n    )}\".`,\n  );\n}\n/**\n * Reads a block string token from the source file.\n *\n * ```\n * StringValue ::\n *   - `\"\"\"` BlockStringCharacter* `\"\"\"`\n *\n * BlockStringCharacter ::\n *   - SourceCharacter but not `\"\"\"` or `\\\"\"\"`\n *   - `\\\"\"\"`\n * ```\n */\n\nfunction readBlockString(lexer, start) {\n  const body = lexer.source.body;\n  const bodyLength = body.length;\n  const startLine = lexer.line;\n  const startColumn = 1 + start - lexer.lineStart;\n  let position = start + 3;\n  let chunkStart = position;\n  let rawValue = '';\n\n  while (position < bodyLength) {\n    const code = body.charCodeAt(position); // Closing Triple-Quote (\"\"\")\n\n    if (\n      code === 0x0022 &&\n      body.charCodeAt(position + 1) === 0x0022 &&\n      body.charCodeAt(position + 2) === 0x0022\n    ) {\n      rawValue += body.slice(chunkStart, position);\n      return new Token(\n        TokenKind.BLOCK_STRING,\n        start,\n        position + 3,\n        startLine,\n        startColumn,\n        dedentBlockStringValue(rawValue),\n      );\n    } // Escaped Triple-Quote (\\\"\"\")\n\n    if (\n      code === 0x005c &&\n      body.charCodeAt(position + 1) === 0x0022 &&\n      body.charCodeAt(position + 2) === 0x0022 &&\n      body.charCodeAt(position + 3) === 0x0022\n    ) {\n      rawValue += body.slice(chunkStart, position) + '\"\"\"';\n      position += 4;\n      chunkStart = position;\n      continue;\n    } // LineTerminator\n\n    if (code === 0x000a || code === 0x000d) {\n      if (code === 0x000d && body.charCodeAt(position + 1) === 0x000a) {\n        position += 2;\n      } else {\n        ++position;\n      }\n\n      ++lexer.line;\n      lexer.lineStart = position;\n      continue;\n    } // SourceCharacter\n\n    if (isUnicodeScalarValue(code)) {\n      ++position;\n    } else if (isSupplementaryCodePoint(body, position)) {\n      position += 2;\n    } else {\n      throw syntaxError(\n        lexer.source,\n        position,\n        `Invalid character within String: ${printCodePointAt(\n          lexer,\n          position,\n        )}.`,\n      );\n    }\n  }\n\n  throw syntaxError(lexer.source, position, 'Unterminated string.');\n}\n/**\n * Reads an alphanumeric + underscore name from the source.\n *\n * ```\n * Name ::\n *   - NameStart NameContinue* [lookahead != NameContinue]\n * ```\n */\n\nfunction readName(lexer, start) {\n  const body = lexer.source.body;\n  const bodyLength = body.length;\n  let position = start + 1;\n\n  while (position < bodyLength) {\n    const code = body.charCodeAt(position);\n\n    if (isNameContinue(code)) {\n      ++position;\n    } else {\n      break;\n    }\n  }\n\n  return createToken(\n    lexer,\n    TokenKind.NAME,\n    start,\n    position,\n    body.slice(start, position),\n  );\n}\n","import { syntaxError } from '../error/syntaxError.mjs';\nimport { Kind } from './kinds.mjs';\nimport { Location, OperationTypeNode } from './ast.mjs';\nimport { TokenKind } from './tokenKind.mjs';\nimport { Source, isSource } from './source.mjs';\nimport { DirectiveLocation } from './directiveLocation.mjs';\nimport { Lexer, isPunctuatorTokenKind } from './lexer.mjs';\n/**\n * Configuration options to control parser behavior\n */\n\n/**\n * Given a GraphQL source, parses it into a Document.\n * Throws GraphQLError if a syntax error is encountered.\n */\nexport function parse(source, options) {\n  const parser = new Parser(source, options);\n  return parser.parseDocument();\n}\n/**\n * Given a string containing a GraphQL value (ex. `[42]`), parse the AST for\n * that value.\n * Throws GraphQLError if a syntax error is encountered.\n *\n * This is useful within tools that operate upon GraphQL Values directly and\n * in isolation of complete GraphQL documents.\n *\n * Consider providing the results to the utility function: valueFromAST().\n */\n\nexport function parseValue(source, options) {\n  const parser = new Parser(source, options);\n  parser.expectToken(TokenKind.SOF);\n  const value = parser.parseValueLiteral(false);\n  parser.expectToken(TokenKind.EOF);\n  return value;\n}\n/**\n * Similar to parseValue(), but raises a parse error if it encounters a\n * variable. The return type will be a constant value.\n */\n\nexport function parseConstValue(source, options) {\n  const parser = new Parser(source, options);\n  parser.expectToken(TokenKind.SOF);\n  const value = parser.parseConstValueLiteral();\n  parser.expectToken(TokenKind.EOF);\n  return value;\n}\n/**\n * Given a string containing a GraphQL Type (ex. `[Int!]`), parse the AST for\n * that type.\n * Throws GraphQLError if a syntax error is encountered.\n *\n * This is useful within tools that operate upon GraphQL Types directly and\n * in isolation of complete GraphQL documents.\n *\n * Consider providing the results to the utility function: typeFromAST().\n */\n\nexport function parseType(source, options) {\n  const parser = new Parser(source, options);\n  parser.expectToken(TokenKind.SOF);\n  const type = parser.parseTypeReference();\n  parser.expectToken(TokenKind.EOF);\n  return type;\n}\n/**\n * This class is exported only to assist people in implementing their own parsers\n * without duplicating too much code and should be used only as last resort for cases\n * such as experimental syntax or if certain features could not be contributed upstream.\n *\n * It is still part of the internal API and is versioned, so any changes to it are never\n * considered breaking changes. If you still need to support multiple versions of the\n * library, please use the `versionInfo` variable for version detection.\n *\n * @internal\n */\n\nexport class Parser {\n  constructor(source, options) {\n    const sourceObj = isSource(source) ? source : new Source(source);\n    this._lexer = new Lexer(sourceObj);\n    this._options = options;\n  }\n  /**\n   * Converts a name lex token into a name parse node.\n   */\n\n  parseName() {\n    const token = this.expectToken(TokenKind.NAME);\n    return this.node(token, {\n      kind: Kind.NAME,\n      value: token.value,\n    });\n  } // Implements the parsing rules in the Document section.\n\n  /**\n   * Document : Definition+\n   */\n\n  parseDocument() {\n    return this.node(this._lexer.token, {\n      kind: Kind.DOCUMENT,\n      definitions: this.many(\n        TokenKind.SOF,\n        this.parseDefinition,\n        TokenKind.EOF,\n      ),\n    });\n  }\n  /**\n   * Definition :\n   *   - ExecutableDefinition\n   *   - TypeSystemDefinition\n   *   - TypeSystemExtension\n   *\n   * ExecutableDefinition :\n   *   - OperationDefinition\n   *   - FragmentDefinition\n   *\n   * TypeSystemDefinition :\n   *   - SchemaDefinition\n   *   - TypeDefinition\n   *   - DirectiveDefinition\n   *\n   * TypeDefinition :\n   *   - ScalarTypeDefinition\n   *   - ObjectTypeDefinition\n   *   - InterfaceTypeDefinition\n   *   - UnionTypeDefinition\n   *   - EnumTypeDefinition\n   *   - InputObjectTypeDefinition\n   */\n\n  parseDefinition() {\n    if (this.peek(TokenKind.BRACE_L)) {\n      return this.parseOperationDefinition();\n    } // Many definitions begin with a description and require a lookahead.\n\n    const hasDescription = this.peekDescription();\n    const keywordToken = hasDescription\n      ? this._lexer.lookahead()\n      : this._lexer.token;\n\n    if (keywordToken.kind === TokenKind.NAME) {\n      switch (keywordToken.value) {\n        case 'schema':\n          return this.parseSchemaDefinition();\n\n        case 'scalar':\n          return this.parseScalarTypeDefinition();\n\n        case 'type':\n          return this.parseObjectTypeDefinition();\n\n        case 'interface':\n          return this.parseInterfaceTypeDefinition();\n\n        case 'union':\n          return this.parseUnionTypeDefinition();\n\n        case 'enum':\n          return this.parseEnumTypeDefinition();\n\n        case 'input':\n          return this.parseInputObjectTypeDefinition();\n\n        case 'directive':\n          return this.parseDirectiveDefinition();\n      }\n\n      if (hasDescription) {\n        throw syntaxError(\n          this._lexer.source,\n          this._lexer.token.start,\n          'Unexpected description, descriptions are supported only on type definitions.',\n        );\n      }\n\n      switch (keywordToken.value) {\n        case 'query':\n        case 'mutation':\n        case 'subscription':\n          return this.parseOperationDefinition();\n\n        case 'fragment':\n          return this.parseFragmentDefinition();\n\n        case 'extend':\n          return this.parseTypeSystemExtension();\n      }\n    }\n\n    throw this.unexpected(keywordToken);\n  } // Implements the parsing rules in the Operations section.\n\n  /**\n   * OperationDefinition :\n   *  - SelectionSet\n   *  - OperationType Name? VariableDefinitions? Directives? SelectionSet\n   */\n\n  parseOperationDefinition() {\n    const start = this._lexer.token;\n\n    if (this.peek(TokenKind.BRACE_L)) {\n      return this.node(start, {\n        kind: Kind.OPERATION_DEFINITION,\n        operation: OperationTypeNode.QUERY,\n        name: undefined,\n        variableDefinitions: [],\n        directives: [],\n        selectionSet: this.parseSelectionSet(),\n      });\n    }\n\n    const operation = this.parseOperationType();\n    let name;\n\n    if (this.peek(TokenKind.NAME)) {\n      name = this.parseName();\n    }\n\n    return this.node(start, {\n      kind: Kind.OPERATION_DEFINITION,\n      operation,\n      name,\n      variableDefinitions: this.parseVariableDefinitions(),\n      directives: this.parseDirectives(false),\n      selectionSet: this.parseSelectionSet(),\n    });\n  }\n  /**\n   * OperationType : one of query mutation subscription\n   */\n\n  parseOperationType() {\n    const operationToken = this.expectToken(TokenKind.NAME);\n\n    switch (operationToken.value) {\n      case 'query':\n        return OperationTypeNode.QUERY;\n\n      case 'mutation':\n        return OperationTypeNode.MUTATION;\n\n      case 'subscription':\n        return OperationTypeNode.SUBSCRIPTION;\n    }\n\n    throw this.unexpected(operationToken);\n  }\n  /**\n   * VariableDefinitions : ( VariableDefinition+ )\n   */\n\n  parseVariableDefinitions() {\n    return this.optionalMany(\n      TokenKind.PAREN_L,\n      this.parseVariableDefinition,\n      TokenKind.PAREN_R,\n    );\n  }\n  /**\n   * VariableDefinition : Variable : Type DefaultValue? Directives[Const]?\n   */\n\n  parseVariableDefinition() {\n    return this.node(this._lexer.token, {\n      kind: Kind.VARIABLE_DEFINITION,\n      variable: this.parseVariable(),\n      type: (this.expectToken(TokenKind.COLON), this.parseTypeReference()),\n      defaultValue: this.expectOptionalToken(TokenKind.EQUALS)\n        ? this.parseConstValueLiteral()\n        : undefined,\n      directives: this.parseConstDirectives(),\n    });\n  }\n  /**\n   * Variable : $ Name\n   */\n\n  parseVariable() {\n    const start = this._lexer.token;\n    this.expectToken(TokenKind.DOLLAR);\n    return this.node(start, {\n      kind: Kind.VARIABLE,\n      name: this.parseName(),\n    });\n  }\n  /**\n   * ```\n   * SelectionSet : { Selection+ }\n   * ```\n   */\n\n  parseSelectionSet() {\n    return this.node(this._lexer.token, {\n      kind: Kind.SELECTION_SET,\n      selections: this.many(\n        TokenKind.BRACE_L,\n        this.parseSelection,\n        TokenKind.BRACE_R,\n      ),\n    });\n  }\n  /**\n   * Selection :\n   *   - Field\n   *   - FragmentSpread\n   *   - InlineFragment\n   */\n\n  parseSelection() {\n    return this.peek(TokenKind.SPREAD)\n      ? this.parseFragment()\n      : this.parseField();\n  }\n  /**\n   * Field : Alias? Name Arguments? Directives? SelectionSet?\n   *\n   * Alias : Name :\n   */\n\n  parseField() {\n    const start = this._lexer.token;\n    const nameOrAlias = this.parseName();\n    let alias;\n    let name;\n\n    if (this.expectOptionalToken(TokenKind.COLON)) {\n      alias = nameOrAlias;\n      name = this.parseName();\n    } else {\n      name = nameOrAlias;\n    }\n\n    return this.node(start, {\n      kind: Kind.FIELD,\n      alias,\n      name,\n      arguments: this.parseArguments(false),\n      directives: this.parseDirectives(false),\n      selectionSet: this.peek(TokenKind.BRACE_L)\n        ? this.parseSelectionSet()\n        : undefined,\n    });\n  }\n  /**\n   * Arguments[Const] : ( Argument[?Const]+ )\n   */\n\n  parseArguments(isConst) {\n    const item = isConst ? this.parseConstArgument : this.parseArgument;\n    return this.optionalMany(TokenKind.PAREN_L, item, TokenKind.PAREN_R);\n  }\n  /**\n   * Argument[Const] : Name : Value[?Const]\n   */\n\n  parseArgument(isConst = false) {\n    const start = this._lexer.token;\n    const name = this.parseName();\n    this.expectToken(TokenKind.COLON);\n    return this.node(start, {\n      kind: Kind.ARGUMENT,\n      name,\n      value: this.parseValueLiteral(isConst),\n    });\n  }\n\n  parseConstArgument() {\n    return this.parseArgument(true);\n  } // Implements the parsing rules in the Fragments section.\n\n  /**\n   * Corresponds to both FragmentSpread and InlineFragment in the spec.\n   *\n   * FragmentSpread : ... FragmentName Directives?\n   *\n   * InlineFragment : ... TypeCondition? Directives? SelectionSet\n   */\n\n  parseFragment() {\n    const start = this._lexer.token;\n    this.expectToken(TokenKind.SPREAD);\n    const hasTypeCondition = this.expectOptionalKeyword('on');\n\n    if (!hasTypeCondition && this.peek(TokenKind.NAME)) {\n      return this.node(start, {\n        kind: Kind.FRAGMENT_SPREAD,\n        name: this.parseFragmentName(),\n        directives: this.parseDirectives(false),\n      });\n    }\n\n    return this.node(start, {\n      kind: Kind.INLINE_FRAGMENT,\n      typeCondition: hasTypeCondition ? this.parseNamedType() : undefined,\n      directives: this.parseDirectives(false),\n      selectionSet: this.parseSelectionSet(),\n    });\n  }\n  /**\n   * FragmentDefinition :\n   *   - fragment FragmentName on TypeCondition Directives? SelectionSet\n   *\n   * TypeCondition : NamedType\n   */\n\n  parseFragmentDefinition() {\n    var _this$_options;\n\n    const start = this._lexer.token;\n    this.expectKeyword('fragment'); // Legacy support for defining variables within fragments changes\n    // the grammar of FragmentDefinition:\n    //   - fragment FragmentName VariableDefinitions? on TypeCondition Directives? SelectionSet\n\n    if (\n      ((_this$_options = this._options) === null || _this$_options === void 0\n        ? void 0\n        : _this$_options.allowLegacyFragmentVariables) === true\n    ) {\n      return this.node(start, {\n        kind: Kind.FRAGMENT_DEFINITION,\n        name: this.parseFragmentName(),\n        variableDefinitions: this.parseVariableDefinitions(),\n        typeCondition: (this.expectKeyword('on'), this.parseNamedType()),\n        directives: this.parseDirectives(false),\n        selectionSet: this.parseSelectionSet(),\n      });\n    }\n\n    return this.node(start, {\n      kind: Kind.FRAGMENT_DEFINITION,\n      name: this.parseFragmentName(),\n      typeCondition: (this.expectKeyword('on'), this.parseNamedType()),\n      directives: this.parseDirectives(false),\n      selectionSet: this.parseSelectionSet(),\n    });\n  }\n  /**\n   * FragmentName : Name but not `on`\n   */\n\n  parseFragmentName() {\n    if (this._lexer.token.value === 'on') {\n      throw this.unexpected();\n    }\n\n    return this.parseName();\n  } // Implements the parsing rules in the Values section.\n\n  /**\n   * Value[Const] :\n   *   - [~Const] Variable\n   *   - IntValue\n   *   - FloatValue\n   *   - StringValue\n   *   - BooleanValue\n   *   - NullValue\n   *   - EnumValue\n   *   - ListValue[?Const]\n   *   - ObjectValue[?Const]\n   *\n   * BooleanValue : one of `true` `false`\n   *\n   * NullValue : `null`\n   *\n   * EnumValue : Name but not `true`, `false` or `null`\n   */\n\n  parseValueLiteral(isConst) {\n    const token = this._lexer.token;\n\n    switch (token.kind) {\n      case TokenKind.BRACKET_L:\n        return this.parseList(isConst);\n\n      case TokenKind.BRACE_L:\n        return this.parseObject(isConst);\n\n      case TokenKind.INT:\n        this._lexer.advance();\n\n        return this.node(token, {\n          kind: Kind.INT,\n          value: token.value,\n        });\n\n      case TokenKind.FLOAT:\n        this._lexer.advance();\n\n        return this.node(token, {\n          kind: Kind.FLOAT,\n          value: token.value,\n        });\n\n      case TokenKind.STRING:\n      case TokenKind.BLOCK_STRING:\n        return this.parseStringLiteral();\n\n      case TokenKind.NAME:\n        this._lexer.advance();\n\n        switch (token.value) {\n          case 'true':\n            return this.node(token, {\n              kind: Kind.BOOLEAN,\n              value: true,\n            });\n\n          case 'false':\n            return this.node(token, {\n              kind: Kind.BOOLEAN,\n              value: false,\n            });\n\n          case 'null':\n            return this.node(token, {\n              kind: Kind.NULL,\n            });\n\n          default:\n            return this.node(token, {\n              kind: Kind.ENUM,\n              value: token.value,\n            });\n        }\n\n      case TokenKind.DOLLAR:\n        if (isConst) {\n          this.expectToken(TokenKind.DOLLAR);\n\n          if (this._lexer.token.kind === TokenKind.NAME) {\n            const varName = this._lexer.token.value;\n            throw syntaxError(\n              this._lexer.source,\n              token.start,\n              `Unexpected variable \"$${varName}\" in constant value.`,\n            );\n          } else {\n            throw this.unexpected(token);\n          }\n        }\n\n        return this.parseVariable();\n    }\n\n    throw this.unexpected();\n  }\n\n  parseConstValueLiteral() {\n    return this.parseValueLiteral(true);\n  }\n\n  parseStringLiteral() {\n    const token = this._lexer.token;\n\n    this._lexer.advance();\n\n    return this.node(token, {\n      kind: Kind.STRING,\n      value: token.value,\n      block: token.kind === TokenKind.BLOCK_STRING,\n    });\n  }\n  /**\n   * ListValue[Const] :\n   *   - [ ]\n   *   - [ Value[?Const]+ ]\n   */\n\n  parseList(isConst) {\n    const item = () => this.parseValueLiteral(isConst);\n\n    return this.node(this._lexer.token, {\n      kind: Kind.LIST,\n      values: this.any(TokenKind.BRACKET_L, item, TokenKind.BRACKET_R),\n    });\n  }\n  /**\n   * ```\n   * ObjectValue[Const] :\n   *   - { }\n   *   - { ObjectField[?Const]+ }\n   * ```\n   */\n\n  parseObject(isConst) {\n    const item = () => this.parseObjectField(isConst);\n\n    return this.node(this._lexer.token, {\n      kind: Kind.OBJECT,\n      fields: this.any(TokenKind.BRACE_L, item, TokenKind.BRACE_R),\n    });\n  }\n  /**\n   * ObjectField[Const] : Name : Value[?Const]\n   */\n\n  parseObjectField(isConst) {\n    const start = this._lexer.token;\n    const name = this.parseName();\n    this.expectToken(TokenKind.COLON);\n    return this.node(start, {\n      kind: Kind.OBJECT_FIELD,\n      name,\n      value: this.parseValueLiteral(isConst),\n    });\n  } // Implements the parsing rules in the Directives section.\n\n  /**\n   * Directives[Const] : Directive[?Const]+\n   */\n\n  parseDirectives(isConst) {\n    const directives = [];\n\n    while (this.peek(TokenKind.AT)) {\n      directives.push(this.parseDirective(isConst));\n    }\n\n    return directives;\n  }\n\n  parseConstDirectives() {\n    return this.parseDirectives(true);\n  }\n  /**\n   * ```\n   * Directive[Const] : @ Name Arguments[?Const]?\n   * ```\n   */\n\n  parseDirective(isConst) {\n    const start = this._lexer.token;\n    this.expectToken(TokenKind.AT);\n    return this.node(start, {\n      kind: Kind.DIRECTIVE,\n      name: this.parseName(),\n      arguments: this.parseArguments(isConst),\n    });\n  } // Implements the parsing rules in the Types section.\n\n  /**\n   * Type :\n   *   - NamedType\n   *   - ListType\n   *   - NonNullType\n   */\n\n  parseTypeReference() {\n    const start = this._lexer.token;\n    let type;\n\n    if (this.expectOptionalToken(TokenKind.BRACKET_L)) {\n      const innerType = this.parseTypeReference();\n      this.expectToken(TokenKind.BRACKET_R);\n      type = this.node(start, {\n        kind: Kind.LIST_TYPE,\n        type: innerType,\n      });\n    } else {\n      type = this.parseNamedType();\n    }\n\n    if (this.expectOptionalToken(TokenKind.BANG)) {\n      return this.node(start, {\n        kind: Kind.NON_NULL_TYPE,\n        type,\n      });\n    }\n\n    return type;\n  }\n  /**\n   * NamedType : Name\n   */\n\n  parseNamedType() {\n    return this.node(this._lexer.token, {\n      kind: Kind.NAMED_TYPE,\n      name: this.parseName(),\n    });\n  } // Implements the parsing rules in the Type Definition section.\n\n  peekDescription() {\n    return this.peek(TokenKind.STRING) || this.peek(TokenKind.BLOCK_STRING);\n  }\n  /**\n   * Description : StringValue\n   */\n\n  parseDescription() {\n    if (this.peekDescription()) {\n      return this.parseStringLiteral();\n    }\n  }\n  /**\n   * ```\n   * SchemaDefinition : Description? schema Directives[Const]? { OperationTypeDefinition+ }\n   * ```\n   */\n\n  parseSchemaDefinition() {\n    const start = this._lexer.token;\n    const description = this.parseDescription();\n    this.expectKeyword('schema');\n    const directives = this.parseConstDirectives();\n    const operationTypes = this.many(\n      TokenKind.BRACE_L,\n      this.parseOperationTypeDefinition,\n      TokenKind.BRACE_R,\n    );\n    return this.node(start, {\n      kind: Kind.SCHEMA_DEFINITION,\n      description,\n      directives,\n      operationTypes,\n    });\n  }\n  /**\n   * OperationTypeDefinition : OperationType : NamedType\n   */\n\n  parseOperationTypeDefinition() {\n    const start = this._lexer.token;\n    const operation = this.parseOperationType();\n    this.expectToken(TokenKind.COLON);\n    const type = this.parseNamedType();\n    return this.node(start, {\n      kind: Kind.OPERATION_TYPE_DEFINITION,\n      operation,\n      type,\n    });\n  }\n  /**\n   * ScalarTypeDefinition : Description? scalar Name Directives[Const]?\n   */\n\n  parseScalarTypeDefinition() {\n    const start = this._lexer.token;\n    const description = this.parseDescription();\n    this.expectKeyword('scalar');\n    const name = this.parseName();\n    const directives = this.parseConstDirectives();\n    return this.node(start, {\n      kind: Kind.SCALAR_TYPE_DEFINITION,\n      description,\n      name,\n      directives,\n    });\n  }\n  /**\n   * ObjectTypeDefinition :\n   *   Description?\n   *   type Name ImplementsInterfaces? Directives[Const]? FieldsDefinition?\n   */\n\n  parseObjectTypeDefinition() {\n    const start = this._lexer.token;\n    const description = this.parseDescription();\n    this.expectKeyword('type');\n    const name = this.parseName();\n    const interfaces = this.parseImplementsInterfaces();\n    const directives = this.parseConstDirectives();\n    const fields = this.parseFieldsDefinition();\n    return this.node(start, {\n      kind: Kind.OBJECT_TYPE_DEFINITION,\n      description,\n      name,\n      interfaces,\n      directives,\n      fields,\n    });\n  }\n  /**\n   * ImplementsInterfaces :\n   *   - implements `&`? NamedType\n   *   - ImplementsInterfaces & NamedType\n   */\n\n  parseImplementsInterfaces() {\n    return this.expectOptionalKeyword('implements')\n      ? this.delimitedMany(TokenKind.AMP, this.parseNamedType)\n      : [];\n  }\n  /**\n   * ```\n   * FieldsDefinition : { FieldDefinition+ }\n   * ```\n   */\n\n  parseFieldsDefinition() {\n    return this.optionalMany(\n      TokenKind.BRACE_L,\n      this.parseFieldDefinition,\n      TokenKind.BRACE_R,\n    );\n  }\n  /**\n   * FieldDefinition :\n   *   - Description? Name ArgumentsDefinition? : Type Directives[Const]?\n   */\n\n  parseFieldDefinition() {\n    const start = this._lexer.token;\n    const description = this.parseDescription();\n    const name = this.parseName();\n    const args = this.parseArgumentDefs();\n    this.expectToken(TokenKind.COLON);\n    const type = this.parseTypeReference();\n    const directives = this.parseConstDirectives();\n    return this.node(start, {\n      kind: Kind.FIELD_DEFINITION,\n      description,\n      name,\n      arguments: args,\n      type,\n      directives,\n    });\n  }\n  /**\n   * ArgumentsDefinition : ( InputValueDefinition+ )\n   */\n\n  parseArgumentDefs() {\n    return this.optionalMany(\n      TokenKind.PAREN_L,\n      this.parseInputValueDef,\n      TokenKind.PAREN_R,\n    );\n  }\n  /**\n   * InputValueDefinition :\n   *   - Description? Name : Type DefaultValue? Directives[Const]?\n   */\n\n  parseInputValueDef() {\n    const start = this._lexer.token;\n    const description = this.parseDescription();\n    const name = this.parseName();\n    this.expectToken(TokenKind.COLON);\n    const type = this.parseTypeReference();\n    let defaultValue;\n\n    if (this.expectOptionalToken(TokenKind.EQUALS)) {\n      defaultValue = this.parseConstValueLiteral();\n    }\n\n    const directives = this.parseConstDirectives();\n    return this.node(start, {\n      kind: Kind.INPUT_VALUE_DEFINITION,\n      description,\n      name,\n      type,\n      defaultValue,\n      directives,\n    });\n  }\n  /**\n   * InterfaceTypeDefinition :\n   *   - Description? interface Name Directives[Const]? FieldsDefinition?\n   */\n\n  parseInterfaceTypeDefinition() {\n    const start = this._lexer.token;\n    const description = this.parseDescription();\n    this.expectKeyword('interface');\n    const name = this.parseName();\n    const interfaces = this.parseImplementsInterfaces();\n    const directives = this.parseConstDirectives();\n    const fields = this.parseFieldsDefinition();\n    return this.node(start, {\n      kind: Kind.INTERFACE_TYPE_DEFINITION,\n      description,\n      name,\n      interfaces,\n      directives,\n      fields,\n    });\n  }\n  /**\n   * UnionTypeDefinition :\n   *   - Description? union Name Directives[Const]? UnionMemberTypes?\n   */\n\n  parseUnionTypeDefinition() {\n    const start = this._lexer.token;\n    const description = this.parseDescription();\n    this.expectKeyword('union');\n    const name = this.parseName();\n    const directives = this.parseConstDirectives();\n    const types = this.parseUnionMemberTypes();\n    return this.node(start, {\n      kind: Kind.UNION_TYPE_DEFINITION,\n      description,\n      name,\n      directives,\n      types,\n    });\n  }\n  /**\n   * UnionMemberTypes :\n   *   - = `|`? NamedType\n   *   - UnionMemberTypes | NamedType\n   */\n\n  parseUnionMemberTypes() {\n    return this.expectOptionalToken(TokenKind.EQUALS)\n      ? this.delimitedMany(TokenKind.PIPE, this.parseNamedType)\n      : [];\n  }\n  /**\n   * EnumTypeDefinition :\n   *   - Description? enum Name Directives[Const]? EnumValuesDefinition?\n   */\n\n  parseEnumTypeDefinition() {\n    const start = this._lexer.token;\n    const description = this.parseDescription();\n    this.expectKeyword('enum');\n    const name = this.parseName();\n    const directives = this.parseConstDirectives();\n    const values = this.parseEnumValuesDefinition();\n    return this.node(start, {\n      kind: Kind.ENUM_TYPE_DEFINITION,\n      description,\n      name,\n      directives,\n      values,\n    });\n  }\n  /**\n   * ```\n   * EnumValuesDefinition : { EnumValueDefinition+ }\n   * ```\n   */\n\n  parseEnumValuesDefinition() {\n    return this.optionalMany(\n      TokenKind.BRACE_L,\n      this.parseEnumValueDefinition,\n      TokenKind.BRACE_R,\n    );\n  }\n  /**\n   * EnumValueDefinition : Description? EnumValue Directives[Const]?\n   */\n\n  parseEnumValueDefinition() {\n    const start = this._lexer.token;\n    const description = this.parseDescription();\n    const name = this.parseEnumValueName();\n    const directives = this.parseConstDirectives();\n    return this.node(start, {\n      kind: Kind.ENUM_VALUE_DEFINITION,\n      description,\n      name,\n      directives,\n    });\n  }\n  /**\n   * EnumValue : Name but not `true`, `false` or `null`\n   */\n\n  parseEnumValueName() {\n    if (\n      this._lexer.token.value === 'true' ||\n      this._lexer.token.value === 'false' ||\n      this._lexer.token.value === 'null'\n    ) {\n      throw syntaxError(\n        this._lexer.source,\n        this._lexer.token.start,\n        `${getTokenDesc(\n          this._lexer.token,\n        )} is reserved and cannot be used for an enum value.`,\n      );\n    }\n\n    return this.parseName();\n  }\n  /**\n   * InputObjectTypeDefinition :\n   *   - Description? input Name Directives[Const]? InputFieldsDefinition?\n   */\n\n  parseInputObjectTypeDefinition() {\n    const start = this._lexer.token;\n    const description = this.parseDescription();\n    this.expectKeyword('input');\n    const name = this.parseName();\n    const directives = this.parseConstDirectives();\n    const fields = this.parseInputFieldsDefinition();\n    return this.node(start, {\n      kind: Kind.INPUT_OBJECT_TYPE_DEFINITION,\n      description,\n      name,\n      directives,\n      fields,\n    });\n  }\n  /**\n   * ```\n   * InputFieldsDefinition : { InputValueDefinition+ }\n   * ```\n   */\n\n  parseInputFieldsDefinition() {\n    return this.optionalMany(\n      TokenKind.BRACE_L,\n      this.parseInputValueDef,\n      TokenKind.BRACE_R,\n    );\n  }\n  /**\n   * TypeSystemExtension :\n   *   - SchemaExtension\n   *   - TypeExtension\n   *\n   * TypeExtension :\n   *   - ScalarTypeExtension\n   *   - ObjectTypeExtension\n   *   - InterfaceTypeExtension\n   *   - UnionTypeExtension\n   *   - EnumTypeExtension\n   *   - InputObjectTypeDefinition\n   */\n\n  parseTypeSystemExtension() {\n    const keywordToken = this._lexer.lookahead();\n\n    if (keywordToken.kind === TokenKind.NAME) {\n      switch (keywordToken.value) {\n        case 'schema':\n          return this.parseSchemaExtension();\n\n        case 'scalar':\n          return this.parseScalarTypeExtension();\n\n        case 'type':\n          return this.parseObjectTypeExtension();\n\n        case 'interface':\n          return this.parseInterfaceTypeExtension();\n\n        case 'union':\n          return this.parseUnionTypeExtension();\n\n        case 'enum':\n          return this.parseEnumTypeExtension();\n\n        case 'input':\n          return this.parseInputObjectTypeExtension();\n      }\n    }\n\n    throw this.unexpected(keywordToken);\n  }\n  /**\n   * ```\n   * SchemaExtension :\n   *  - extend schema Directives[Const]? { OperationTypeDefinition+ }\n   *  - extend schema Directives[Const]\n   * ```\n   */\n\n  parseSchemaExtension() {\n    const start = this._lexer.token;\n    this.expectKeyword('extend');\n    this.expectKeyword('schema');\n    const directives = this.parseConstDirectives();\n    const operationTypes = this.optionalMany(\n      TokenKind.BRACE_L,\n      this.parseOperationTypeDefinition,\n      TokenKind.BRACE_R,\n    );\n\n    if (directives.length === 0 && operationTypes.length === 0) {\n      throw this.unexpected();\n    }\n\n    return this.node(start, {\n      kind: Kind.SCHEMA_EXTENSION,\n      directives,\n      operationTypes,\n    });\n  }\n  /**\n   * ScalarTypeExtension :\n   *   - extend scalar Name Directives[Const]\n   */\n\n  parseScalarTypeExtension() {\n    const start = this._lexer.token;\n    this.expectKeyword('extend');\n    this.expectKeyword('scalar');\n    const name = this.parseName();\n    const directives = this.parseConstDirectives();\n\n    if (directives.length === 0) {\n      throw this.unexpected();\n    }\n\n    return this.node(start, {\n      kind: Kind.SCALAR_TYPE_EXTENSION,\n      name,\n      directives,\n    });\n  }\n  /**\n   * ObjectTypeExtension :\n   *  - extend type Name ImplementsInterfaces? Directives[Const]? FieldsDefinition\n   *  - extend type Name ImplementsInterfaces? Directives[Const]\n   *  - extend type Name ImplementsInterfaces\n   */\n\n  parseObjectTypeExtension() {\n    const start = this._lexer.token;\n    this.expectKeyword('extend');\n    this.expectKeyword('type');\n    const name = this.parseName();\n    const interfaces = this.parseImplementsInterfaces();\n    const directives = this.parseConstDirectives();\n    const fields = this.parseFieldsDefinition();\n\n    if (\n      interfaces.length === 0 &&\n      directives.length === 0 &&\n      fields.length === 0\n    ) {\n      throw this.unexpected();\n    }\n\n    return this.node(start, {\n      kind: Kind.OBJECT_TYPE_EXTENSION,\n      name,\n      interfaces,\n      directives,\n      fields,\n    });\n  }\n  /**\n   * InterfaceTypeExtension :\n   *  - extend interface Name ImplementsInterfaces? Directives[Const]? FieldsDefinition\n   *  - extend interface Name ImplementsInterfaces? Directives[Const]\n   *  - extend interface Name ImplementsInterfaces\n   */\n\n  parseInterfaceTypeExtension() {\n    const start = this._lexer.token;\n    this.expectKeyword('extend');\n    this.expectKeyword('interface');\n    const name = this.parseName();\n    const interfaces = this.parseImplementsInterfaces();\n    const directives = this.parseConstDirectives();\n    const fields = this.parseFieldsDefinition();\n\n    if (\n      interfaces.length === 0 &&\n      directives.length === 0 &&\n      fields.length === 0\n    ) {\n      throw this.unexpected();\n    }\n\n    return this.node(start, {\n      kind: Kind.INTERFACE_TYPE_EXTENSION,\n      name,\n      interfaces,\n      directives,\n      fields,\n    });\n  }\n  /**\n   * UnionTypeExtension :\n   *   - extend union Name Directives[Const]? UnionMemberTypes\n   *   - extend union Name Directives[Const]\n   */\n\n  parseUnionTypeExtension() {\n    const start = this._lexer.token;\n    this.expectKeyword('extend');\n    this.expectKeyword('union');\n    const name = this.parseName();\n    const directives = this.parseConstDirectives();\n    const types = this.parseUnionMemberTypes();\n\n    if (directives.length === 0 && types.length === 0) {\n      throw this.unexpected();\n    }\n\n    return this.node(start, {\n      kind: Kind.UNION_TYPE_EXTENSION,\n      name,\n      directives,\n      types,\n    });\n  }\n  /**\n   * EnumTypeExtension :\n   *   - extend enum Name Directives[Const]? EnumValuesDefinition\n   *   - extend enum Name Directives[Const]\n   */\n\n  parseEnumTypeExtension() {\n    const start = this._lexer.token;\n    this.expectKeyword('extend');\n    this.expectKeyword('enum');\n    const name = this.parseName();\n    const directives = this.parseConstDirectives();\n    const values = this.parseEnumValuesDefinition();\n\n    if (directives.length === 0 && values.length === 0) {\n      throw this.unexpected();\n    }\n\n    return this.node(start, {\n      kind: Kind.ENUM_TYPE_EXTENSION,\n      name,\n      directives,\n      values,\n    });\n  }\n  /**\n   * InputObjectTypeExtension :\n   *   - extend input Name Directives[Const]? InputFieldsDefinition\n   *   - extend input Name Directives[Const]\n   */\n\n  parseInputObjectTypeExtension() {\n    const start = this._lexer.token;\n    this.expectKeyword('extend');\n    this.expectKeyword('input');\n    const name = this.parseName();\n    const directives = this.parseConstDirectives();\n    const fields = this.parseInputFieldsDefinition();\n\n    if (directives.length === 0 && fields.length === 0) {\n      throw this.unexpected();\n    }\n\n    return this.node(start, {\n      kind: Kind.INPUT_OBJECT_TYPE_EXTENSION,\n      name,\n      directives,\n      fields,\n    });\n  }\n  /**\n   * ```\n   * DirectiveDefinition :\n   *   - Description? directive @ Name ArgumentsDefinition? `repeatable`? on DirectiveLocations\n   * ```\n   */\n\n  parseDirectiveDefinition() {\n    const start = this._lexer.token;\n    const description = this.parseDescription();\n    this.expectKeyword('directive');\n    this.expectToken(TokenKind.AT);\n    const name = this.parseName();\n    const args = this.parseArgumentDefs();\n    const repeatable = this.expectOptionalKeyword('repeatable');\n    this.expectKeyword('on');\n    const locations = this.parseDirectiveLocations();\n    return this.node(start, {\n      kind: Kind.DIRECTIVE_DEFINITION,\n      description,\n      name,\n      arguments: args,\n      repeatable,\n      locations,\n    });\n  }\n  /**\n   * DirectiveLocations :\n   *   - `|`? DirectiveLocation\n   *   - DirectiveLocations | DirectiveLocation\n   */\n\n  parseDirectiveLocations() {\n    return this.delimitedMany(TokenKind.PIPE, this.parseDirectiveLocation);\n  }\n  /*\n   * DirectiveLocation :\n   *   - ExecutableDirectiveLocation\n   *   - TypeSystemDirectiveLocation\n   *\n   * ExecutableDirectiveLocation : one of\n   *   `QUERY`\n   *   `MUTATION`\n   *   `SUBSCRIPTION`\n   *   `FIELD`\n   *   `FRAGMENT_DEFINITION`\n   *   `FRAGMENT_SPREAD`\n   *   `INLINE_FRAGMENT`\n   *\n   * TypeSystemDirectiveLocation : one of\n   *   `SCHEMA`\n   *   `SCALAR`\n   *   `OBJECT`\n   *   `FIELD_DEFINITION`\n   *   `ARGUMENT_DEFINITION`\n   *   `INTERFACE`\n   *   `UNION`\n   *   `ENUM`\n   *   `ENUM_VALUE`\n   *   `INPUT_OBJECT`\n   *   `INPUT_FIELD_DEFINITION`\n   */\n\n  parseDirectiveLocation() {\n    const start = this._lexer.token;\n    const name = this.parseName();\n\n    if (Object.prototype.hasOwnProperty.call(DirectiveLocation, name.value)) {\n      return name;\n    }\n\n    throw this.unexpected(start);\n  } // Core parsing utility functions\n\n  /**\n   * Returns a node that, if configured to do so, sets a \"loc\" field as a\n   * location object, used to identify the place in the source that created a\n   * given parsed object.\n   */\n\n  node(startToken, node) {\n    var _this$_options2;\n\n    if (\n      ((_this$_options2 = this._options) === null || _this$_options2 === void 0\n        ? void 0\n        : _this$_options2.noLocation) !== true\n    ) {\n      node.loc = new Location(\n        startToken,\n        this._lexer.lastToken,\n        this._lexer.source,\n      );\n    }\n\n    return node;\n  }\n  /**\n   * Determines if the next token is of a given kind\n   */\n\n  peek(kind) {\n    return this._lexer.token.kind === kind;\n  }\n  /**\n   * If the next token is of the given kind, return that token after advancing the lexer.\n   * Otherwise, do not change the parser state and throw an error.\n   */\n\n  expectToken(kind) {\n    const token = this._lexer.token;\n\n    if (token.kind === kind) {\n      this._lexer.advance();\n\n      return token;\n    }\n\n    throw syntaxError(\n      this._lexer.source,\n      token.start,\n      `Expected ${getTokenKindDesc(kind)}, found ${getTokenDesc(token)}.`,\n    );\n  }\n  /**\n   * If the next token is of the given kind, return \"true\" after advancing the lexer.\n   * Otherwise, do not change the parser state and return \"false\".\n   */\n\n  expectOptionalToken(kind) {\n    const token = this._lexer.token;\n\n    if (token.kind === kind) {\n      this._lexer.advance();\n\n      return true;\n    }\n\n    return false;\n  }\n  /**\n   * If the next token is a given keyword, advance the lexer.\n   * Otherwise, do not change the parser state and throw an error.\n   */\n\n  expectKeyword(value) {\n    const token = this._lexer.token;\n\n    if (token.kind === TokenKind.NAME && token.value === value) {\n      this._lexer.advance();\n    } else {\n      throw syntaxError(\n        this._lexer.source,\n        token.start,\n        `Expected \"${value}\", found ${getTokenDesc(token)}.`,\n      );\n    }\n  }\n  /**\n   * If the next token is a given keyword, return \"true\" after advancing the lexer.\n   * Otherwise, do not change the parser state and return \"false\".\n   */\n\n  expectOptionalKeyword(value) {\n    const token = this._lexer.token;\n\n    if (token.kind === TokenKind.NAME && token.value === value) {\n      this._lexer.advance();\n\n      return true;\n    }\n\n    return false;\n  }\n  /**\n   * Helper function for creating an error when an unexpected lexed token is encountered.\n   */\n\n  unexpected(atToken) {\n    const token =\n      atToken !== null && atToken !== void 0 ? atToken : this._lexer.token;\n    return syntaxError(\n      this._lexer.source,\n      token.start,\n      `Unexpected ${getTokenDesc(token)}.`,\n    );\n  }\n  /**\n   * Returns a possibly empty list of parse nodes, determined by the parseFn.\n   * This list begins with a lex token of openKind and ends with a lex token of closeKind.\n   * Advances the parser to the next lex token after the closing token.\n   */\n\n  any(openKind, parseFn, closeKind) {\n    this.expectToken(openKind);\n    const nodes = [];\n\n    while (!this.expectOptionalToken(closeKind)) {\n      nodes.push(parseFn.call(this));\n    }\n\n    return nodes;\n  }\n  /**\n   * Returns a list of parse nodes, determined by the parseFn.\n   * It can be empty only if open token is missing otherwise it will always return non-empty list\n   * that begins with a lex token of openKind and ends with a lex token of closeKind.\n   * Advances the parser to the next lex token after the closing token.\n   */\n\n  optionalMany(openKind, parseFn, closeKind) {\n    if (this.expectOptionalToken(openKind)) {\n      const nodes = [];\n\n      do {\n        nodes.push(parseFn.call(this));\n      } while (!this.expectOptionalToken(closeKind));\n\n      return nodes;\n    }\n\n    return [];\n  }\n  /**\n   * Returns a non-empty list of parse nodes, determined by the parseFn.\n   * This list begins with a lex token of openKind and ends with a lex token of closeKind.\n   * Advances the parser to the next lex token after the closing token.\n   */\n\n  many(openKind, parseFn, closeKind) {\n    this.expectToken(openKind);\n    const nodes = [];\n\n    do {\n      nodes.push(parseFn.call(this));\n    } while (!this.expectOptionalToken(closeKind));\n\n    return nodes;\n  }\n  /**\n   * Returns a non-empty list of parse nodes, determined by the parseFn.\n   * This list may begin with a lex token of delimiterKind followed by items separated by lex tokens of tokenKind.\n   * Advances the parser to the next lex token after last item in the list.\n   */\n\n  delimitedMany(delimiterKind, parseFn) {\n    this.expectOptionalToken(delimiterKind);\n    const nodes = [];\n\n    do {\n      nodes.push(parseFn.call(this));\n    } while (this.expectOptionalToken(delimiterKind));\n\n    return nodes;\n  }\n}\n/**\n * A helper function to describe a token as a string for debugging.\n */\n\nfunction getTokenDesc(token) {\n  const value = token.value;\n  return getTokenKindDesc(token.kind) + (value != null ? ` \"${value}\"` : '');\n}\n/**\n * A helper function to describe a token kind as a string for debugging.\n */\n\nfunction getTokenKindDesc(kind) {\n  return isPunctuatorTokenKind(kind) ? `\"${kind}\"` : kind;\n}\n","import { __assign } from \"tslib\";\nimport { parse } from 'graphql';\nvar docCache = new Map();\nvar fragmentSourceMap = new Map();\nvar printFragmentWarnings = true;\nvar experimentalFragmentVariables = false;\nfunction normalize(string) {\n    return string.replace(/[\\s,]+/g, ' ').trim();\n}\nfunction cacheKeyFromLoc(loc) {\n    return normalize(loc.source.body.substring(loc.start, loc.end));\n}\nfunction processFragments(ast) {\n    var seenKeys = new Set();\n    var definitions = [];\n    ast.definitions.forEach(function (fragmentDefinition) {\n        if (fragmentDefinition.kind === 'FragmentDefinition') {\n            var fragmentName = fragmentDefinition.name.value;\n            var sourceKey = cacheKeyFromLoc(fragmentDefinition.loc);\n            var sourceKeySet = fragmentSourceMap.get(fragmentName);\n            if (sourceKeySet && !sourceKeySet.has(sourceKey)) {\n                if (printFragmentWarnings) {\n                    console.warn(\"Warning: fragment with name \" + fragmentName + \" already exists.\\n\"\n                        + \"graphql-tag enforces all fragment names across your application to be unique; read more about\\n\"\n                        + \"this in the docs: http://dev.apollodata.com/core/fragments.html#unique-names\");\n                }\n            }\n            else if (!sourceKeySet) {\n                fragmentSourceMap.set(fragmentName, sourceKeySet = new Set);\n            }\n            sourceKeySet.add(sourceKey);\n            if (!seenKeys.has(sourceKey)) {\n                seenKeys.add(sourceKey);\n                definitions.push(fragmentDefinition);\n            }\n        }\n        else {\n            definitions.push(fragmentDefinition);\n        }\n    });\n    return __assign(__assign({}, ast), { definitions: definitions });\n}\nfunction stripLoc(doc) {\n    var workSet = new Set(doc.definitions);\n    workSet.forEach(function (node) {\n        if (node.loc)\n            delete node.loc;\n        Object.keys(node).forEach(function (key) {\n            var value = node[key];\n            if (value && typeof value === 'object') {\n                workSet.add(value);\n            }\n        });\n    });\n    var loc = doc.loc;\n    if (loc) {\n        delete loc.startToken;\n        delete loc.endToken;\n    }\n    return doc;\n}\nfunction parseDocument(source) {\n    var cacheKey = normalize(source);\n    if (!docCache.has(cacheKey)) {\n        var parsed = parse(source, {\n            experimentalFragmentVariables: experimentalFragmentVariables,\n            allowLegacyFragmentVariables: experimentalFragmentVariables\n        });\n        if (!parsed || parsed.kind !== 'Document') {\n            throw new Error('Not a valid GraphQL document.');\n        }\n        docCache.set(cacheKey, stripLoc(processFragments(parsed)));\n    }\n    return docCache.get(cacheKey);\n}\nexport function gql(literals) {\n    var args = [];\n    for (var _i = 1; _i < arguments.length; _i++) {\n        args[_i - 1] = arguments[_i];\n    }\n    if (typeof literals === 'string') {\n        literals = [literals];\n    }\n    var result = literals[0];\n    args.forEach(function (arg, i) {\n        if (arg && arg.kind === 'Document') {\n            result += arg.loc.source.body;\n        }\n        else {\n            result += arg;\n        }\n        result += literals[i + 1];\n    });\n    return parseDocument(result);\n}\nexport function resetCaches() {\n    docCache.clear();\n    fragmentSourceMap.clear();\n}\nexport function disableFragmentWarnings() {\n    printFragmentWarnings = false;\n}\nexport function enableExperimentalFragmentVariables() {\n    experimentalFragmentVariables = true;\n}\nexport function disableExperimentalFragmentVariables() {\n    experimentalFragmentVariables = false;\n}\nvar extras = {\n    gql: gql,\n    resetCaches: resetCaches,\n    disableFragmentWarnings: disableFragmentWarnings,\n    enableExperimentalFragmentVariables: enableExperimentalFragmentVariables,\n    disableExperimentalFragmentVariables: disableExperimentalFragmentVariables\n};\n(function (gql_1) {\n    gql_1.gql = extras.gql, gql_1.resetCaches = extras.resetCaches, gql_1.disableFragmentWarnings = extras.disableFragmentWarnings, gql_1.enableExperimentalFragmentVariables = extras.enableExperimentalFragmentVariables, gql_1.disableExperimentalFragmentVariables = extras.disableExperimentalFragmentVariables;\n})(gql || (gql = {}));\ngql[\"default\"] = gql;\nexport default gql;\n//# sourceMappingURL=index.js.map","import { gql } from '@apollo/client/core';\n\nexport const PRICE_FRAGMENT = gql`\n  fragment PriceFragment on Price {\n    billingModel\n    billingPeriod\n    price {\n      amount\n      currency\n    }\n    feature {\n      featureUnits\n      featureUnitsPlural\n      displayName\n    }\n  }\n`;\n","import { ApolloClient, gql, NormalizedCacheObject } from '@apollo/client/core';\nimport { GetPlansQuery, GetPlansQueryVariables, PackageStatus, PlanSortFields, SortDirection } from './generated/types';\nimport { PRICE_FRAGMENT } from './fragments/priceFragment';\n\nconst PACKAGE_ENTITLEMENT_FRAGMENT = gql`\n  fragment PackageEntitlementFragment on PackageEntitlement {\n    usageLimit\n    hasUnlimitedUsage\n    featureId\n    resetPeriod\n    feature {\n      featureType\n      meterType\n      featureUnits\n      featureUnitsPlural\n      displayName\n      description\n      refId\n    }\n  }\n`;\n\nconst ADDON_FRAGMENT = gql`\n  fragment AddonFragment on Addon {\n    refId\n    displayName\n    description\n    entitlements {\n      ...PackageEntitlementFragment\n    }\n  }\n`;\n\nconst PLAN_FRAGMENT = gql`\n  fragment PlanFragment on Plan {\n    id\n    refId\n    description\n    displayName\n    basePlan {\n      id\n      refId\n      displayName\n    }\n    entitlements {\n      ...PackageEntitlementFragment\n    }\n    inheritedEntitlements {\n      ...PackageEntitlementFragment\n    }\n    compatibleAddons {\n      ...AddonFragment\n    }\n    prices {\n      ...PriceFragment\n    }\n    defaultTrialConfig {\n      duration\n      units\n    }\n  }\n  ${PACKAGE_ENTITLEMENT_FRAGMENT}\n  ${PRICE_FRAGMENT}\n  ${ADDON_FRAGMENT}\n`;\n\nclass PaywallApi {\n  constructor(private readonly client: ApolloClient<NormalizedCacheObject>) {}\n\n  getPlans() {\n    return this.client.query<GetPlansQuery, GetPlansQueryVariables>({\n      query: gql`\n        query GetPlans($paging: CursorPaging, $filter: PlanFilter, $sorting: [PlanSort!]) {\n          plans(paging: $paging, filter: $filter, sorting: $sorting) {\n            edges {\n              node {\n                ...PlanFragment\n              }\n            }\n          }\n        }\n        ${PLAN_FRAGMENT}\n      `,\n      variables: {\n        paging: {\n          first: 50,\n        },\n        filter: {\n          status: {\n            eq: PackageStatus.Published,\n          },\n          isLatest: {\n            is: true,\n          },\n        },\n        sorting: [\n          {\n            field: PlanSortFields.RefId,\n            direction: SortDirection.Asc,\n          },\n        ],\n      },\n    });\n  }\n}\n\nexport default PaywallApi;\n","import { ApolloClient, gql, NormalizedCacheObject } from '@apollo/client/core';\nimport { GetCustomerByRefIdQuery, GetCustomerByRefIdQueryVariables } from './generated/types';\nimport { PRICE_FRAGMENT } from './fragments/priceFragment';\n\nconst SUBSCRIPTION_FRAGMENT = gql`\n  fragment SubscriptionFragment on CustomerSubscription {\n    id\n    startDate\n    endDate\n    status\n    refId\n    prices {\n      usageLimit\n      price {\n        ...PriceFragment\n      }\n    }\n    plan {\n      id\n      refId\n      displayName\n      description\n      entitlements {\n        usageLimit\n        featureId\n        hasUnlimitedUsage\n        packageId\n        resetPeriod\n        feature {\n          featureType\n          meterType\n          featureUnits\n          featureUnitsPlural\n          displayName\n          description\n          refId\n        }\n      }\n      inheritedEntitlements {\n        usageLimit\n        featureId\n        hasUnlimitedUsage\n        packageId\n        resetPeriod\n        packageId\n        feature {\n          featureType\n          meterType\n          featureUnits\n          featureUnitsPlural\n          displayName\n          description\n          refId\n        }\n      }\n      prices {\n        ...PriceFragment\n      }\n    }\n    addons {\n      id\n      quantity\n      addon {\n        id\n        refId\n        displayName\n        description\n        entitlements {\n          usageLimit\n          hasUnlimitedUsage\n          featureId\n          feature {\n            featureType\n            meterType\n            featureUnits\n            featureUnitsPlural\n            displayName\n            description\n            refId\n          }\n        }\n      }\n    }\n  }\n  ${PRICE_FRAGMENT}\n`;\n\nconst PROMOTIONAL_ENTITLEMENT_FRAGMENT = gql`\n  fragment PromotionalEntitlementFragment on PromotionalEntitlement {\n    status\n    usageLimit\n    featureId\n    hasUnlimitedUsage\n    resetPeriod\n    endDate\n    isVisible\n    feature {\n      featureType\n      meterType\n      featureUnits\n      featureUnitsPlural\n      displayName\n      description\n      refId\n    }\n  }\n`;\n\nconst CUSTOMER_FRAGMENT = gql`\n  fragment CustomerFragment on Customer {\n    id\n    name\n    email\n    createdAt\n    updatedAt\n    refId\n    promotionalEntitlements {\n      ...PromotionalEntitlementFragment\n    }\n    subscriptions {\n      ...SubscriptionFragment\n    }\n  }\n  ${SUBSCRIPTION_FRAGMENT}\n  ${PROMOTIONAL_ENTITLEMENT_FRAGMENT}\n`;\n\nclass CustomersApi {\n  constructor(private readonly client: ApolloClient<NormalizedCacheObject>) {}\n\n  getCustomer(customerId: string) {\n    return this.client.query<GetCustomerByRefIdQuery, GetCustomerByRefIdQueryVariables>({\n      query: gql`\n        query GetCustomerByRefId($filter: CustomerFilter) {\n          customers(filter: $filter) {\n            edges {\n              node {\n                ...CustomerFragment\n              }\n            }\n          }\n        }\n        ${CUSTOMER_FRAGMENT}\n      `,\n      variables: {\n        filter: { refId: { eq: customerId } },\n      },\n      fetchPolicy: 'network-only',\n    });\n  }\n}\n\nexport default CustomersApi;\n","import { ApolloClient, NormalizedCacheObject } from '@apollo/client/core';\nimport PaywallApi from './PaywallApi';\nimport CustomersApi from './CustomersApi';\n\nclass ApiGateway {\n  paywall: PaywallApi;\n  customers: CustomersApi;\n\n  constructor(client: ApolloClient<NormalizedCacheObject>) {\n    this.paywall = new PaywallApi(client);\n    this.customers = new CustomersApi(client);\n  }\n}\n\nexport default ApiGateway;\n","import isEmpty from 'lodash/isEmpty';\nimport merge from 'lodash/merge';\n\nexport type ClientConfiguration = {\n  sdkKey: string;\n  baseUri?: string;\n  customerId?: string;\n};\n\nconst defaults = (): Partial<ClientConfiguration> => {\n  return {\n    baseUri: 'https://api.stigg.io',\n  };\n};\n\nexport function validateConfiguration(configuration: ClientConfiguration) {\n  if (isEmpty(configuration.sdkKey)) {\n    // todo: stop throwing errors in the SDK\n    throw new Error('You must configure the client with an SDK key');\n  }\n\n  if (!configuration.customerId) {\n    // todo: stop throwing errors in the SDK\n    throw new Error('You must configure the client with a customerId');\n  }\n}\n\nexport function withDefaults(configuration: ClientConfiguration) {\n  const defaultConfig = defaults();\n  return merge(defaultConfig, configuration);\n}\n\nexport function ensureCustomerRefIdExists({ customerId }: ClientConfiguration) {\n  if (!customerId || isEmpty(customerId)) {\n    // todo: stop throwing errors in the SDK\n    throw new Error('You must set customer ID first, use setCustomerId function or pass it via the constructor');\n  }\n  return customerId;\n}\n","import {\n  AccessDeniedReason,\n  AddonFragment,\n  CustomerFragment,\n  EntitlementFragment,\n  GetPlansQuery,\n  MeterType,\n  PackageEntitlementFragment,\n  PlanFragment,\n  PriceFragment,\n  PromotionalEntitlementFragment,\n  SlimEntitlementFragment,\n  SubscriptionFragment,\n} from '../api/generated/types';\nimport {\n  Customer,\n  CustomerModel,\n  Entitlement,\n  FeatureType,\n  MeteredEntitlement,\n  NumberEntitlement,\n  PackageEntitlement,\n  Plan,\n  Price,\n  PromotionalEntitlement,\n  Subscription,\n} from '../models';\nimport map from 'lodash/map';\nimport sortBy from 'lodash/sortBy';\nimport CachedEntitlement from '../services/cachedEntitlement';\nimport { Decision } from '../services/entitlementDecisionService';\n\nexport class ModelMapper {\n  mapEntitlementByDecision = (\n    decision: Decision,\n    featureId: string,\n    entitlement: CachedEntitlement,\n    requestedUsage?: number | undefined,\n  ): Entitlement => {\n    const featureType = entitlement.calculatedEntitlement.featureType;\n    const meterType = entitlement.calculatedEntitlement.meterType;\n    if (!featureType) {\n      throw new Error(`No feature type  provided with unknown reason`);\n    }\n\n    switch (featureType) {\n      case FeatureType.Boolean:\n        return {\n          isValid: true,\n          featureType: featureType,\n          isGranted: decision.isGranted,\n          accessDeniedReason: decision.accessDeniedReason,\n          featureId,\n        };\n      case FeatureType.Number: {\n        if (meterType === MeterType.Fluctuating || meterType === MeterType.Incremental) {\n          return {\n            isValid: true,\n            featureType: FeatureType.Number,\n            isGranted: decision.isGranted,\n            usageLimit: entitlement.calculatedEntitlement.usageLimit || 0,\n            featureUnits: entitlement.calculatedEntitlement.featureUnits || '',\n            featureUnitsPlural: entitlement.calculatedEntitlement.featureUnitsPlural || '',\n            accessDeniedReason: decision.accessDeniedReason,\n            hasUnlimitedUsage: entitlement.calculatedEntitlement.hasUnlimitedUsage,\n            meterType: meterType,\n            currentUsage: entitlement.featureUsage.currentUsage || 0,\n            requestedUsage: requestedUsage || 0,\n            resetPeriod: entitlement.featureUsage.resetPeriod,\n            nextResetDate: entitlement.featureUsage.nextResetDate,\n            resetPeriodConfiguration: entitlement.featureUsage.resetPeriodConfiguration,\n            featureId,\n          };\n        } else {\n          return {\n            isValid: true,\n            featureType: FeatureType.Number,\n            meterType: meterType,\n            isGranted: decision.isGranted,\n            usageLimit: entitlement.calculatedEntitlement.usageLimit || 0,\n            featureUnits: entitlement.calculatedEntitlement.featureUnits || '',\n            featureUnitsPlural: entitlement.calculatedEntitlement.featureUnitsPlural || '',\n            accessDeniedReason: decision.accessDeniedReason,\n            hasUnlimitedUsage: entitlement.calculatedEntitlement.hasUnlimitedUsage,\n            featureId,\n          };\n        }\n      }\n      default:\n        throw new Error(`Feature type ${featureType} is not supported in this version of the sdk`);\n    }\n  };\n\n  mapSlimEntitlement(entitlement: SlimEntitlementFragment): Entitlement {\n    const featureType = entitlement.feature?.featureType;\n    const meterType = entitlement.feature?.meterType;\n    if (!featureType) {\n      if (entitlement.accessDeniedReason === AccessDeniedReason.FeatureNotFound) {\n        return {\n          isValid: false,\n          isGranted: false,\n          accessDeniedReason: AccessDeniedReason.FeatureNotFound,\n        };\n      }\n      // todo: stop throwing errors in the SDK\n      throw new Error(`No feature type provided with unknown reason`);\n    }\n    switch (featureType) {\n      case FeatureType.Boolean:\n        return {\n          isValid: true,\n          featureType: featureType,\n          isGranted: entitlement.isGranted,\n          accessDeniedReason: entitlement.accessDeniedReason,\n          featureId: entitlement.feature?.refId,\n        };\n      case FeatureType.Number: {\n        if (meterType === MeterType.Fluctuating || meterType === MeterType.Incremental) {\n          return {\n            isValid: true,\n            featureType: featureType,\n            meterType: meterType,\n            featureId: entitlement.feature?.refId,\n            isGranted: entitlement.isGranted,\n            usageLimit: entitlement.usageLimit || 0,\n            currentUsage: entitlement.currentUsage || 0,\n            requestedUsage: entitlement.requestedUsage || 0,\n            hasUnlimitedUsage: entitlement.hasUnlimitedUsage,\n            resetPeriod: entitlement.resetPeriod,\n            nextResetDate: entitlement.nextResetDate,\n            resetPeriodConfiguration: entitlement.resetPeriodConfiguration,\n            accessDeniedReason: entitlement.accessDeniedReason,\n          };\n        } else {\n          return {\n            isValid: true,\n            featureType: featureType,\n            featureId: entitlement.feature?.refId,\n            isGranted: true,\n            accessDeniedReason: entitlement.accessDeniedReason,\n            usageLimit: entitlement.usageLimit || 0,\n            hasUnlimitedUsage: entitlement.hasUnlimitedUsage,\n          };\n        }\n      }\n      default:\n        // todo: stop throwing errors in the SDK\n        throw new Error(`Feature type ${featureType} is not supported in this version of the sdk`);\n    }\n  }\n\n  mapFullEntitlementByDecision(\n    entitlement: CachedEntitlement,\n    decision: Decision,\n    customerId: string,\n    requestedUsage?: number,\n  ): Entitlement {\n    return this.mapFullEntitlement({\n      ...decision,\n      customerId,\n      ...entitlement.calculatedEntitlement,\n      ...entitlement.featureUsage,\n      feature: {\n        featureType: entitlement.calculatedEntitlement.featureType,\n        meterType: entitlement.calculatedEntitlement.meterType,\n        featureUnits: entitlement.calculatedEntitlement.featureUnits,\n        featureUnitsPlural: entitlement.calculatedEntitlement.featureUnitsPlural,\n        description: entitlement.calculatedEntitlement.featureDescription,\n        displayName: entitlement.calculatedEntitlement.featureDisplayName || '',\n        refId: entitlement.calculatedEntitlement.featureId,\n      },\n      requestedUsage,\n    });\n  }\n\n  mapFullEntitlement(fullEntitlement: EntitlementFragment): Entitlement {\n    const entitlement = this.mapSlimEntitlement(fullEntitlement as SlimEntitlementFragment);\n    const featureType = fullEntitlement.feature?.featureType;\n    const meterType = fullEntitlement.feature?.meterType;\n\n    switch (featureType) {\n      case FeatureType.Boolean:\n        return {\n          ...entitlement,\n          featureDisplayName: fullEntitlement.feature?.displayName,\n          featureDescription: fullEntitlement.feature?.description,\n        };\n      case FeatureType.Number: {\n        if (meterType === MeterType.Fluctuating || meterType === MeterType.Incremental) {\n          return {\n            ...entitlement,\n            featureUnits: fullEntitlement.feature?.featureUnits || '',\n            featureUnitsPlural: fullEntitlement.feature?.featureUnitsPlural || '',\n            featureDisplayName: fullEntitlement.feature?.displayName,\n            featureDescription: fullEntitlement.feature?.description,\n          } as MeteredEntitlement;\n        } else {\n          return {\n            ...entitlement,\n            featureUnits: fullEntitlement.feature?.featureUnits || '',\n            featureUnitsPlural: fullEntitlement.feature?.featureUnitsPlural || '',\n            featureDisplayName: fullEntitlement.feature?.displayName,\n            featureDescription: fullEntitlement.feature?.description,\n          } as NumberEntitlement;\n        }\n      }\n      default:\n        // todo: stop throwing errors in the SDK\n        throw new Error(`Feature type ${featureType} is not supported in this version of the sdk`);\n    }\n  }\n\n  mapCachedEntitlement(entitlement: EntitlementFragment, currentUsage?: number, nextResetDate?: number | null) {\n    return {\n      calculatedEntitlement: {\n        featureId: entitlement.feature?.refId,\n        featureType: entitlement.feature?.featureType,\n        meterType: entitlement.feature?.meterType,\n        usageLimit: entitlement.usageLimit,\n        hasUnlimitedUsage: entitlement.hasUnlimitedUsage,\n        featureUnits: entitlement.feature?.featureUnits,\n        featureUnitsPlural: entitlement.feature?.featureUnitsPlural,\n        featureDisplayName: entitlement.feature?.displayName,\n        featureDescription: entitlement.feature?.description,\n      },\n      featureUsage: {\n        resetPeriod: entitlement.resetPeriod,\n        resetPeriodConfiguration: entitlement.resetPeriodConfiguration,\n        currentUsage: currentUsage || entitlement.currentUsage,\n        nextResetDate: nextResetDate || entitlement.nextResetDate,\n      },\n    } as CachedEntitlement;\n  }\n\n  mapCachedEntitlements(updatedEntitlements: EntitlementFragment[]): Map<string, CachedEntitlement> {\n    return new Map(\n      updatedEntitlements.map((entitlement) => [\n        entitlement.feature?.refId || '',\n        this.mapCachedEntitlement(entitlement),\n      ]),\n    );\n  }\n\n  mapPlans(resultData: GetPlansQuery): Plan[] {\n    const plans = resultData.plans.edges.map((x) => x.node);\n    const sortedPlans = this.sortPlans(plans);\n    return sortedPlans.map((plan, index) => this.mapPlan(plan, index));\n  }\n\n  private mapPrice(pricing: PriceFragment): Price {\n    const { feature, price, billingModel, billingPeriod } = pricing;\n    const mappedPrice: Price = {\n      billingModel,\n      billingPeriod,\n      amount: price.amount,\n      currency: price.currency,\n    };\n    if (feature) {\n      mappedPrice.feature = {\n        displayName: feature.displayName,\n        featureUnits: feature.featureUnits,\n        featureUnitsPlural: feature.featureUnitsPlural,\n      };\n    }\n\n    return mappedPrice;\n  }\n\n  private mapPlan(plan: PlanFragment, order = 0): Plan {\n    return {\n      id: plan.refId,\n      order,\n      displayName: plan.displayName,\n      description: plan.description,\n      basePlan: plan.basePlan ? { id: plan.basePlan.refId, displayName: plan.basePlan.displayName } : undefined,\n      entitlements: map(\n        sortBy(plan.entitlements, (packageEntitlement) => packageEntitlement.feature.refId),\n        (entitlement) => this.mapPackageEntitlement(entitlement),\n      ),\n      inheritedEntitlements: map(\n        sortBy(plan.inheritedEntitlements, (packageEntitlement) => packageEntitlement.feature.refId),\n        (entitlement) => this.mapPackageEntitlement(entitlement),\n      ),\n      prices: map(plan.prices, (price) => this.mapPrice(price)),\n      defaultTrialConfig: plan.defaultTrialConfig,\n      compatibleAddons: plan.compatibleAddons?.map((addon) => this.mapAddon(addon)) ?? [],\n    };\n  }\n\n  mapCustomer(customer: CustomerFragment): Customer {\n    return new CustomerModel({\n      id: customer.refId,\n      name: customer.name || undefined,\n      email: customer.email || undefined,\n      createdAt: new Date(customer.createdAt),\n      updatedAt: new Date(customer.updatedAt),\n      subscriptions: map(customer.subscriptions, (x) => this.mapSubscription(x)),\n      promotionalEntitlements: map(customer.promotionalEntitlements, (x) => this.mapPromotionalEntitlement(x)),\n    });\n  }\n\n  private mapPackageEntitlement(entitlement: PackageEntitlementFragment): PackageEntitlement {\n    const { feature } = entitlement;\n    return {\n      usageLimit: entitlement.usageLimit || 0,\n      featureType: feature.featureType,\n      featureMeterType: feature.meterType,\n      featureUnits: feature.featureUnits,\n      featureUnitsPlural: feature.featureUnitsPlural,\n      featureDisplayName: feature.displayName,\n      featureDescription: feature.description,\n      featureId: feature.refId,\n      hasUnlimitedUsage: entitlement.hasUnlimitedUsage,\n      resetPeriod: entitlement.resetPeriod,\n    };\n  }\n\n  private mapPromotionalEntitlement(entitlement: PromotionalEntitlementFragment): PromotionalEntitlement {\n    const { feature } = entitlement;\n    return {\n      status: entitlement.status,\n      usageLimit: entitlement.usageLimit || 0,\n      featureType: feature.featureType,\n      featureMeterType: feature.meterType,\n      featureUnits: feature.featureUnits,\n      featureUnitsPlural: feature.featureUnitsPlural,\n      featureDisplayName: feature.displayName,\n      featureDescription: feature.description,\n      featureId: feature.refId,\n      hasUnlimitedUsage: entitlement.hasUnlimitedUsage,\n      resetPeriod: entitlement.resetPeriod,\n      endDate: entitlement.endDate,\n      isVisible: entitlement.isVisible,\n    };\n  }\n\n  private mapSubscription(subscription: SubscriptionFragment): Subscription {\n    const [planPrice] = subscription.prices || [];\n    return {\n      id: subscription.refId,\n      status: subscription.status,\n      plan: this.mapPlan(subscription.plan),\n      price: planPrice ? this.mapPrice(planPrice.price) : null,\n      addons:\n        subscription.addons?.map(({ quantity, addon }) => ({\n          quantity: quantity,\n          addon: this.mapAddon(addon),\n        })) || [],\n      startDate: new Date(subscription.startDate),\n      endDate: subscription.endDate && new Date(subscription.endDate),\n    };\n  }\n\n  private mapAddon(addon: AddonFragment) {\n    return {\n      id: addon.refId,\n      displayName: addon.displayName,\n      description: addon.description || '',\n      entitlements: map(addon.entitlements, (x) => this.mapPackageEntitlement(x)),\n    };\n  }\n\n  private sortPlans(plans: PlanFragment[]): PlanFragment[] {\n    const rootPlans = sortBy(\n      plans.filter((x) => !x.basePlan),\n      (plan) => plan.refId,\n    );\n\n    const result: PlanFragment[] = [...rootPlans];\n\n    function addAncestor(basePlanId: string, plans: PlanFragment[], result: PlanFragment[]) {\n      const subPlans = sortBy(\n        plans.filter((x) => x.basePlan?.refId === basePlanId),\n        (plan) => plan.refId,\n      );\n\n      result.push(...subPlans);\n\n      if (result.length !== plans.length) {\n        subPlans.forEach((x) => addAncestor(x.refId, plans, result));\n      }\n    }\n\n    rootPlans.forEach((x) => addAncestor(x.refId, plans, result));\n    return result;\n  }\n}\n","import { __extends } from 'tslib';\n\nvar genericMessage = \"Invariant Violation\";\r\nvar _a = Object.setPrototypeOf, setPrototypeOf = _a === void 0 ? function (obj, proto) {\r\n    obj.__proto__ = proto;\r\n    return obj;\r\n} : _a;\r\nvar InvariantError = /** @class */ (function (_super) {\r\n    __extends(InvariantError, _super);\r\n    function InvariantError(message) {\r\n        if (message === void 0) { message = genericMessage; }\r\n        var _this = _super.call(this, typeof message === \"number\"\r\n            ? genericMessage + \": \" + message + \" (see https://github.com/apollographql/invariant-packages)\"\r\n            : message) || this;\r\n        _this.framesToPop = 1;\r\n        _this.name = genericMessage;\r\n        setPrototypeOf(_this, InvariantError.prototype);\r\n        return _this;\r\n    }\r\n    return InvariantError;\r\n}(Error));\r\nfunction invariant(condition, message) {\r\n    if (!condition) {\r\n        throw new InvariantError(message);\r\n    }\r\n}\r\nvar verbosityLevels = [\"debug\", \"log\", \"warn\", \"error\", \"silent\"];\r\nvar verbosityLevel = verbosityLevels.indexOf(\"log\");\r\nfunction wrapConsoleMethod(name) {\r\n    return function () {\r\n        if (verbosityLevels.indexOf(name) >= verbosityLevel) {\r\n            // Default to console.log if this host environment happens not to provide\r\n            // all the console.* methods we need.\r\n            var method = console[name] || console.log;\r\n            return method.apply(console, arguments);\r\n        }\r\n    };\r\n}\r\n(function (invariant) {\r\n    invariant.debug = wrapConsoleMethod(\"debug\");\r\n    invariant.log = wrapConsoleMethod(\"log\");\r\n    invariant.warn = wrapConsoleMethod(\"warn\");\r\n    invariant.error = wrapConsoleMethod(\"error\");\r\n})(invariant || (invariant = {}));\r\nfunction setVerbosity(level) {\r\n    var old = verbosityLevels[verbosityLevel];\r\n    verbosityLevel = Math.max(0, verbosityLevels.indexOf(level));\r\n    return old;\r\n}\r\nvar invariant$1 = invariant;\n\nexport { InvariantError, invariant$1 as default, invariant, setVerbosity };\n//# sourceMappingURL=invariant.esm.js.map\n","export function maybe(thunk) {\n    try {\n        return thunk();\n    }\n    catch (_a) { }\n}\n//# sourceMappingURL=maybe.js.map","import { maybe } from \"./maybe.js\";\nexport default (maybe(function () { return globalThis; }) ||\n    maybe(function () { return window; }) ||\n    maybe(function () { return self; }) ||\n    maybe(function () { return global; }) ||\n    maybe(function () { return Function(\"return this\")(); }));\n//# sourceMappingURL=global.js.map","import global from \"./global.js\";\nimport { maybe } from \"./maybe.js\";\nvar __ = \"__\";\nvar GLOBAL_KEY = [__, __].join(\"DEV\");\nfunction getDEV() {\n    try {\n        return Boolean(__DEV__);\n    }\n    catch (_a) {\n        Object.defineProperty(global, GLOBAL_KEY, {\n            value: maybe(function () { return process.env.NODE_ENV; }) !== \"production\",\n            enumerable: false,\n            configurable: true,\n            writable: true,\n        });\n        return global[GLOBAL_KEY];\n    }\n}\nexport default getDEV();\n//# sourceMappingURL=DEV.js.map","function maybe(thunk) {\n  try { return thunk() } catch (_) {}\n}\n\nvar safeGlobal = (\n  maybe(function() { return globalThis }) ||\n  maybe(function() { return window }) ||\n  maybe(function() { return self }) ||\n  maybe(function() { return global }) ||\n  maybe(function() { return Function(\"return this\")() })\n);\n\nvar needToRemove = false;\n\nexport function install() {\n  if (safeGlobal &&\n      !maybe(function() { return process.env.NODE_ENV }) &&\n      !maybe(function() { return process })) {\n    Object.defineProperty(safeGlobal, \"process\", {\n      value: {\n        env: {\n          // This default needs to be \"production\" instead of \"development\", to\n          // avoid the problem https://github.com/graphql/graphql-js/pull/2894\n          // will eventually solve, once merged and released.\n          NODE_ENV: \"production\",\n        },\n      },\n      // Let anyone else change global.process as they see fit, but hide it from\n      // Object.keys(global) enumeration.\n      configurable: true,\n      enumerable: false,\n      writable: true,\n    });\n    needToRemove = true;\n  }\n}\n\n// Call install() at least once, when this module is imported.\ninstall();\n\nexport function remove() {\n  if (needToRemove) {\n    delete safeGlobal.process;\n    needToRemove = false;\n  }\n}\n","function _createForOfIteratorHelperLoose(o, allowArrayLike) { var it = typeof Symbol !== \"undefined\" && o[Symbol.iterator] || o[\"@@iterator\"]; if (it) return (it = it.call(o)).next.bind(it); if (Array.isArray(o) || (it = _unsupportedIterableToArray(o)) || allowArrayLike && o && typeof o.length === \"number\") { if (it) o = it; var i = 0; return function () { if (i >= o.length) return { done: true }; return { done: false, value: o[i++] }; }; } throw new TypeError(\"Invalid attempt to iterate non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.\"); }\n\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); }\n\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; }\n\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, descriptor.key, descriptor); } }\n\nfunction _createClass(Constructor, protoProps, staticProps) { if (protoProps) _defineProperties(Constructor.prototype, protoProps); if (staticProps) _defineProperties(Constructor, staticProps); return Constructor; }\n\n// === Symbol Support ===\nvar hasSymbols = function () {\n  return typeof Symbol === 'function';\n};\n\nvar hasSymbol = function (name) {\n  return hasSymbols() && Boolean(Symbol[name]);\n};\n\nvar getSymbol = function (name) {\n  return hasSymbol(name) ? Symbol[name] : '@@' + name;\n};\n\nif (hasSymbols() && !hasSymbol('observable')) {\n  Symbol.observable = Symbol('observable');\n}\n\nvar SymbolIterator = getSymbol('iterator');\nvar SymbolObservable = getSymbol('observable');\nvar SymbolSpecies = getSymbol('species'); // === Abstract Operations ===\n\nfunction getMethod(obj, key) {\n  var value = obj[key];\n  if (value == null) return undefined;\n  if (typeof value !== 'function') throw new TypeError(value + ' is not a function');\n  return value;\n}\n\nfunction getSpecies(obj) {\n  var ctor = obj.constructor;\n\n  if (ctor !== undefined) {\n    ctor = ctor[SymbolSpecies];\n\n    if (ctor === null) {\n      ctor = undefined;\n    }\n  }\n\n  return ctor !== undefined ? ctor : Observable;\n}\n\nfunction isObservable(x) {\n  return x instanceof Observable; // SPEC: Brand check\n}\n\nfunction hostReportError(e) {\n  if (hostReportError.log) {\n    hostReportError.log(e);\n  } else {\n    setTimeout(function () {\n      throw e;\n    });\n  }\n}\n\nfunction enqueue(fn) {\n  Promise.resolve().then(function () {\n    try {\n      fn();\n    } catch (e) {\n      hostReportError(e);\n    }\n  });\n}\n\nfunction cleanupSubscription(subscription) {\n  var cleanup = subscription._cleanup;\n  if (cleanup === undefined) return;\n  subscription._cleanup = undefined;\n\n  if (!cleanup) {\n    return;\n  }\n\n  try {\n    if (typeof cleanup === 'function') {\n      cleanup();\n    } else {\n      var unsubscribe = getMethod(cleanup, 'unsubscribe');\n\n      if (unsubscribe) {\n        unsubscribe.call(cleanup);\n      }\n    }\n  } catch (e) {\n    hostReportError(e);\n  }\n}\n\nfunction closeSubscription(subscription) {\n  subscription._observer = undefined;\n  subscription._queue = undefined;\n  subscription._state = 'closed';\n}\n\nfunction flushSubscription(subscription) {\n  var queue = subscription._queue;\n\n  if (!queue) {\n    return;\n  }\n\n  subscription._queue = undefined;\n  subscription._state = 'ready';\n\n  for (var i = 0; i < queue.length; ++i) {\n    notifySubscription(subscription, queue[i].type, queue[i].value);\n    if (subscription._state === 'closed') break;\n  }\n}\n\nfunction notifySubscription(subscription, type, value) {\n  subscription._state = 'running';\n  var observer = subscription._observer;\n\n  try {\n    var m = getMethod(observer, type);\n\n    switch (type) {\n      case 'next':\n        if (m) m.call(observer, value);\n        break;\n\n      case 'error':\n        closeSubscription(subscription);\n        if (m) m.call(observer, value);else throw value;\n        break;\n\n      case 'complete':\n        closeSubscription(subscription);\n        if (m) m.call(observer);\n        break;\n    }\n  } catch (e) {\n    hostReportError(e);\n  }\n\n  if (subscription._state === 'closed') cleanupSubscription(subscription);else if (subscription._state === 'running') subscription._state = 'ready';\n}\n\nfunction onNotify(subscription, type, value) {\n  if (subscription._state === 'closed') return;\n\n  if (subscription._state === 'buffering') {\n    subscription._queue.push({\n      type: type,\n      value: value\n    });\n\n    return;\n  }\n\n  if (subscription._state !== 'ready') {\n    subscription._state = 'buffering';\n    subscription._queue = [{\n      type: type,\n      value: value\n    }];\n    enqueue(function () {\n      return flushSubscription(subscription);\n    });\n    return;\n  }\n\n  notifySubscription(subscription, type, value);\n}\n\nvar Subscription = /*#__PURE__*/function () {\n  function Subscription(observer, subscriber) {\n    // ASSERT: observer is an object\n    // ASSERT: subscriber is callable\n    this._cleanup = undefined;\n    this._observer = observer;\n    this._queue = undefined;\n    this._state = 'initializing';\n    var subscriptionObserver = new SubscriptionObserver(this);\n\n    try {\n      this._cleanup = subscriber.call(undefined, subscriptionObserver);\n    } catch (e) {\n      subscriptionObserver.error(e);\n    }\n\n    if (this._state === 'initializing') this._state = 'ready';\n  }\n\n  var _proto = Subscription.prototype;\n\n  _proto.unsubscribe = function unsubscribe() {\n    if (this._state !== 'closed') {\n      closeSubscription(this);\n      cleanupSubscription(this);\n    }\n  };\n\n  _createClass(Subscription, [{\n    key: \"closed\",\n    get: function () {\n      return this._state === 'closed';\n    }\n  }]);\n\n  return Subscription;\n}();\n\nvar SubscriptionObserver = /*#__PURE__*/function () {\n  function SubscriptionObserver(subscription) {\n    this._subscription = subscription;\n  }\n\n  var _proto2 = SubscriptionObserver.prototype;\n\n  _proto2.next = function next(value) {\n    onNotify(this._subscription, 'next', value);\n  };\n\n  _proto2.error = function error(value) {\n    onNotify(this._subscription, 'error', value);\n  };\n\n  _proto2.complete = function complete() {\n    onNotify(this._subscription, 'complete');\n  };\n\n  _createClass(SubscriptionObserver, [{\n    key: \"closed\",\n    get: function () {\n      return this._subscription._state === 'closed';\n    }\n  }]);\n\n  return SubscriptionObserver;\n}();\n\nvar Observable = /*#__PURE__*/function () {\n  function Observable(subscriber) {\n    if (!(this instanceof Observable)) throw new TypeError('Observable cannot be called as a function');\n    if (typeof subscriber !== 'function') throw new TypeError('Observable initializer must be a function');\n    this._subscriber = subscriber;\n  }\n\n  var _proto3 = Observable.prototype;\n\n  _proto3.subscribe = function subscribe(observer) {\n    if (typeof observer !== 'object' || observer === null) {\n      observer = {\n        next: observer,\n        error: arguments[1],\n        complete: arguments[2]\n      };\n    }\n\n    return new Subscription(observer, this._subscriber);\n  };\n\n  _proto3.forEach = function forEach(fn) {\n    var _this = this;\n\n    return new Promise(function (resolve, reject) {\n      if (typeof fn !== 'function') {\n        reject(new TypeError(fn + ' is not a function'));\n        return;\n      }\n\n      function done() {\n        subscription.unsubscribe();\n        resolve();\n      }\n\n      var subscription = _this.subscribe({\n        next: function (value) {\n          try {\n            fn(value, done);\n          } catch (e) {\n            reject(e);\n            subscription.unsubscribe();\n          }\n        },\n        error: reject,\n        complete: resolve\n      });\n    });\n  };\n\n  _proto3.map = function map(fn) {\n    var _this2 = this;\n\n    if (typeof fn !== 'function') throw new TypeError(fn + ' is not a function');\n    var C = getSpecies(this);\n    return new C(function (observer) {\n      return _this2.subscribe({\n        next: function (value) {\n          try {\n            value = fn(value);\n          } catch (e) {\n            return observer.error(e);\n          }\n\n          observer.next(value);\n        },\n        error: function (e) {\n          observer.error(e);\n        },\n        complete: function () {\n          observer.complete();\n        }\n      });\n    });\n  };\n\n  _proto3.filter = function filter(fn) {\n    var _this3 = this;\n\n    if (typeof fn !== 'function') throw new TypeError(fn + ' is not a function');\n    var C = getSpecies(this);\n    return new C(function (observer) {\n      return _this3.subscribe({\n        next: function (value) {\n          try {\n            if (!fn(value)) return;\n          } catch (e) {\n            return observer.error(e);\n          }\n\n          observer.next(value);\n        },\n        error: function (e) {\n          observer.error(e);\n        },\n        complete: function () {\n          observer.complete();\n        }\n      });\n    });\n  };\n\n  _proto3.reduce = function reduce(fn) {\n    var _this4 = this;\n\n    if (typeof fn !== 'function') throw new TypeError(fn + ' is not a function');\n    var C = getSpecies(this);\n    var hasSeed = arguments.length > 1;\n    var hasValue = false;\n    var seed = arguments[1];\n    var acc = seed;\n    return new C(function (observer) {\n      return _this4.subscribe({\n        next: function (value) {\n          var first = !hasValue;\n          hasValue = true;\n\n          if (!first || hasSeed) {\n            try {\n              acc = fn(acc, value);\n            } catch (e) {\n              return observer.error(e);\n            }\n          } else {\n            acc = value;\n          }\n        },\n        error: function (e) {\n          observer.error(e);\n        },\n        complete: function () {\n          if (!hasValue && !hasSeed) return observer.error(new TypeError('Cannot reduce an empty sequence'));\n          observer.next(acc);\n          observer.complete();\n        }\n      });\n    });\n  };\n\n  _proto3.concat = function concat() {\n    var _this5 = this;\n\n    for (var _len = arguments.length, sources = new Array(_len), _key = 0; _key < _len; _key++) {\n      sources[_key] = arguments[_key];\n    }\n\n    var C = getSpecies(this);\n    return new C(function (observer) {\n      var subscription;\n      var index = 0;\n\n      function startNext(next) {\n        subscription = next.subscribe({\n          next: function (v) {\n            observer.next(v);\n          },\n          error: function (e) {\n            observer.error(e);\n          },\n          complete: function () {\n            if (index === sources.length) {\n              subscription = undefined;\n              observer.complete();\n            } else {\n              startNext(C.from(sources[index++]));\n            }\n          }\n        });\n      }\n\n      startNext(_this5);\n      return function () {\n        if (subscription) {\n          subscription.unsubscribe();\n          subscription = undefined;\n        }\n      };\n    });\n  };\n\n  _proto3.flatMap = function flatMap(fn) {\n    var _this6 = this;\n\n    if (typeof fn !== 'function') throw new TypeError(fn + ' is not a function');\n    var C = getSpecies(this);\n    return new C(function (observer) {\n      var subscriptions = [];\n\n      var outer = _this6.subscribe({\n        next: function (value) {\n          if (fn) {\n            try {\n              value = fn(value);\n            } catch (e) {\n              return observer.error(e);\n            }\n          }\n\n          var inner = C.from(value).subscribe({\n            next: function (value) {\n              observer.next(value);\n            },\n            error: function (e) {\n              observer.error(e);\n            },\n            complete: function () {\n              var i = subscriptions.indexOf(inner);\n              if (i >= 0) subscriptions.splice(i, 1);\n              completeIfDone();\n            }\n          });\n          subscriptions.push(inner);\n        },\n        error: function (e) {\n          observer.error(e);\n        },\n        complete: function () {\n          completeIfDone();\n        }\n      });\n\n      function completeIfDone() {\n        if (outer.closed && subscriptions.length === 0) observer.complete();\n      }\n\n      return function () {\n        subscriptions.forEach(function (s) {\n          return s.unsubscribe();\n        });\n        outer.unsubscribe();\n      };\n    });\n  };\n\n  _proto3[SymbolObservable] = function () {\n    return this;\n  };\n\n  Observable.from = function from(x) {\n    var C = typeof this === 'function' ? this : Observable;\n    if (x == null) throw new TypeError(x + ' is not an object');\n    var method = getMethod(x, SymbolObservable);\n\n    if (method) {\n      var observable = method.call(x);\n      if (Object(observable) !== observable) throw new TypeError(observable + ' is not an object');\n      if (isObservable(observable) && observable.constructor === C) return observable;\n      return new C(function (observer) {\n        return observable.subscribe(observer);\n      });\n    }\n\n    if (hasSymbol('iterator')) {\n      method = getMethod(x, SymbolIterator);\n\n      if (method) {\n        return new C(function (observer) {\n          enqueue(function () {\n            if (observer.closed) return;\n\n            for (var _iterator = _createForOfIteratorHelperLoose(method.call(x)), _step; !(_step = _iterator()).done;) {\n              var item = _step.value;\n              observer.next(item);\n              if (observer.closed) return;\n            }\n\n            observer.complete();\n          });\n        });\n      }\n    }\n\n    if (Array.isArray(x)) {\n      return new C(function (observer) {\n        enqueue(function () {\n          if (observer.closed) return;\n\n          for (var i = 0; i < x.length; ++i) {\n            observer.next(x[i]);\n            if (observer.closed) return;\n          }\n\n          observer.complete();\n        });\n      });\n    }\n\n    throw new TypeError(x + ' is not observable');\n  };\n\n  Observable.of = function of() {\n    for (var _len2 = arguments.length, items = new Array(_len2), _key2 = 0; _key2 < _len2; _key2++) {\n      items[_key2] = arguments[_key2];\n    }\n\n    var C = typeof this === 'function' ? this : Observable;\n    return new C(function (observer) {\n      enqueue(function () {\n        if (observer.closed) return;\n\n        for (var i = 0; i < items.length; ++i) {\n          observer.next(items[i]);\n          if (observer.closed) return;\n        }\n\n        observer.complete();\n      });\n    });\n  };\n\n  _createClass(Observable, null, [{\n    key: SymbolSpecies,\n    get: function () {\n      return this;\n    }\n  }]);\n\n  return Observable;\n}();\n\nif (hasSymbols()) {\n  Object.defineProperty(Observable, Symbol('extensions'), {\n    value: {\n      symbol: SymbolObservable,\n      hostReportError: hostReportError\n    },\n    configurable: true\n  });\n}\n\nexport { Observable };\n","import { invariant, InvariantError } from \"ts-invariant\";\nimport DEV from \"./DEV.js\";\nexport { DEV };\nexport function checkDEV() {\n    __DEV__ ? invariant(\"boolean\" === typeof DEV, DEV) : invariant(\"boolean\" === typeof DEV, 38);\n}\nimport { removeTemporaryGlobals } from \"./fix-graphql.js\";\nremoveTemporaryGlobals();\nexport { maybe } from \"./maybe.js\";\nexport { default as global } from \"./global.js\";\nexport { invariant, InvariantError };\ncheckDEV();\n//# sourceMappingURL=index.js.map","export function isNonNullObject(obj) {\n    return obj !== null && typeof obj === 'object';\n}\n//# sourceMappingURL=objects.js.map","import { __assign, __spreadArray } from \"tslib\";\nimport { invariant, InvariantError } from \"../globals/index.js\";\nexport function getFragmentQueryDocument(document, fragmentName) {\n    var actualFragmentName = fragmentName;\n    var fragments = [];\n    document.definitions.forEach(function (definition) {\n        if (definition.kind === 'OperationDefinition') {\n            throw __DEV__ ? new InvariantError(\"Found a \" + definition.operation + \" operation\" + (definition.name ? \" named '\" + definition.name.value + \"'\" : '') + \". \" +\n                'No operations are allowed when using a fragment as a query. Only fragments are allowed.') : new InvariantError(43);\n        }\n        if (definition.kind === 'FragmentDefinition') {\n            fragments.push(definition);\n        }\n    });\n    if (typeof actualFragmentName === 'undefined') {\n        __DEV__ ? invariant(fragments.length === 1, \"Found \" + fragments.length + \" fragments. `fragmentName` must be provided when there is not exactly 1 fragment.\") : invariant(fragments.length === 1, 44);\n        actualFragmentName = fragments[0].name.value;\n    }\n    var query = __assign(__assign({}, document), { definitions: __spreadArray([\n            {\n                kind: 'OperationDefinition',\n                operation: 'query',\n                selectionSet: {\n                    kind: 'SelectionSet',\n                    selections: [\n                        {\n                            kind: 'FragmentSpread',\n                            name: {\n                                kind: 'Name',\n                                value: actualFragmentName,\n                            },\n                        },\n                    ],\n                },\n            }\n        ], document.definitions, true) });\n    return query;\n}\nexport function createFragmentMap(fragments) {\n    if (fragments === void 0) { fragments = []; }\n    var symTable = {};\n    fragments.forEach(function (fragment) {\n        symTable[fragment.name.value] = fragment;\n    });\n    return symTable;\n}\nexport function getFragmentFromSelection(selection, fragmentMap) {\n    switch (selection.kind) {\n        case 'InlineFragment':\n            return selection;\n        case 'FragmentSpread': {\n            var fragment = fragmentMap && fragmentMap[selection.name.value];\n            __DEV__ ? invariant(fragment, \"No fragment named \" + selection.name.value + \".\") : invariant(fragment, 45);\n            return fragment;\n        }\n        default:\n            return null;\n    }\n}\n//# sourceMappingURL=fragments.js.map","import { InvariantError } from \"../globals/index.js\";\nimport { isNonNullObject } from \"../common/objects.js\";\nimport { getFragmentFromSelection } from \"./fragments.js\";\nexport function makeReference(id) {\n    return { __ref: String(id) };\n}\nexport function isReference(obj) {\n    return Boolean(obj && typeof obj === 'object' && typeof obj.__ref === 'string');\n}\nexport function isDocumentNode(value) {\n    return (isNonNullObject(value) &&\n        value.kind === \"Document\" &&\n        Array.isArray(value.definitions));\n}\nfunction isStringValue(value) {\n    return value.kind === 'StringValue';\n}\nfunction isBooleanValue(value) {\n    return value.kind === 'BooleanValue';\n}\nfunction isIntValue(value) {\n    return value.kind === 'IntValue';\n}\nfunction isFloatValue(value) {\n    return value.kind === 'FloatValue';\n}\nfunction isVariable(value) {\n    return value.kind === 'Variable';\n}\nfunction isObjectValue(value) {\n    return value.kind === 'ObjectValue';\n}\nfunction isListValue(value) {\n    return value.kind === 'ListValue';\n}\nfunction isEnumValue(value) {\n    return value.kind === 'EnumValue';\n}\nfunction isNullValue(value) {\n    return value.kind === 'NullValue';\n}\nexport function valueToObjectRepresentation(argObj, name, value, variables) {\n    if (isIntValue(value) || isFloatValue(value)) {\n        argObj[name.value] = Number(value.value);\n    }\n    else if (isBooleanValue(value) || isStringValue(value)) {\n        argObj[name.value] = value.value;\n    }\n    else if (isObjectValue(value)) {\n        var nestedArgObj_1 = {};\n        value.fields.map(function (obj) {\n            return valueToObjectRepresentation(nestedArgObj_1, obj.name, obj.value, variables);\n        });\n        argObj[name.value] = nestedArgObj_1;\n    }\n    else if (isVariable(value)) {\n        var variableValue = (variables || {})[value.name.value];\n        argObj[name.value] = variableValue;\n    }\n    else if (isListValue(value)) {\n        argObj[name.value] = value.values.map(function (listValue) {\n            var nestedArgArrayObj = {};\n            valueToObjectRepresentation(nestedArgArrayObj, name, listValue, variables);\n            return nestedArgArrayObj[name.value];\n        });\n    }\n    else if (isEnumValue(value)) {\n        argObj[name.value] = value.value;\n    }\n    else if (isNullValue(value)) {\n        argObj[name.value] = null;\n    }\n    else {\n        throw __DEV__ ? new InvariantError(\"The inline argument \\\"\" + name.value + \"\\\" of kind \\\"\" + value.kind + \"\\\"\" +\n            'is not supported. Use variables instead of inline arguments to ' +\n            'overcome this limitation.') : new InvariantError(54);\n    }\n}\nexport function storeKeyNameFromField(field, variables) {\n    var directivesObj = null;\n    if (field.directives) {\n        directivesObj = {};\n        field.directives.forEach(function (directive) {\n            directivesObj[directive.name.value] = {};\n            if (directive.arguments) {\n                directive.arguments.forEach(function (_a) {\n                    var name = _a.name, value = _a.value;\n                    return valueToObjectRepresentation(directivesObj[directive.name.value], name, value, variables);\n                });\n            }\n        });\n    }\n    var argObj = null;\n    if (field.arguments && field.arguments.length) {\n        argObj = {};\n        field.arguments.forEach(function (_a) {\n            var name = _a.name, value = _a.value;\n            return valueToObjectRepresentation(argObj, name, value, variables);\n        });\n    }\n    return getStoreKeyName(field.name.value, argObj, directivesObj);\n}\nvar KNOWN_DIRECTIVES = [\n    'connection',\n    'include',\n    'skip',\n    'client',\n    'rest',\n    'export',\n];\nexport var getStoreKeyName = Object.assign(function (fieldName, args, directives) {\n    if (args &&\n        directives &&\n        directives['connection'] &&\n        directives['connection']['key']) {\n        if (directives['connection']['filter'] &&\n            directives['connection']['filter'].length > 0) {\n            var filterKeys = directives['connection']['filter']\n                ? directives['connection']['filter']\n                : [];\n            filterKeys.sort();\n            var filteredArgs_1 = {};\n            filterKeys.forEach(function (key) {\n                filteredArgs_1[key] = args[key];\n            });\n            return directives['connection']['key'] + \"(\" + stringify(filteredArgs_1) + \")\";\n        }\n        else {\n            return directives['connection']['key'];\n        }\n    }\n    var completeFieldName = fieldName;\n    if (args) {\n        var stringifiedArgs = stringify(args);\n        completeFieldName += \"(\" + stringifiedArgs + \")\";\n    }\n    if (directives) {\n        Object.keys(directives).forEach(function (key) {\n            if (KNOWN_DIRECTIVES.indexOf(key) !== -1)\n                return;\n            if (directives[key] && Object.keys(directives[key]).length) {\n                completeFieldName += \"@\" + key + \"(\" + stringify(directives[key]) + \")\";\n            }\n            else {\n                completeFieldName += \"@\" + key;\n            }\n        });\n    }\n    return completeFieldName;\n}, {\n    setStringify: function (s) {\n        var previous = stringify;\n        stringify = s;\n        return previous;\n    },\n});\nvar stringify = function defaultStringify(value) {\n    return JSON.stringify(value, stringifyReplacer);\n};\nfunction stringifyReplacer(_key, value) {\n    if (isNonNullObject(value) && !Array.isArray(value)) {\n        value = Object.keys(value).sort().reduce(function (copy, key) {\n            copy[key] = value[key];\n            return copy;\n        }, {});\n    }\n    return value;\n}\nexport function argumentsObjectFromField(field, variables) {\n    if (field.arguments && field.arguments.length) {\n        var argObj_1 = {};\n        field.arguments.forEach(function (_a) {\n            var name = _a.name, value = _a.value;\n            return valueToObjectRepresentation(argObj_1, name, value, variables);\n        });\n        return argObj_1;\n    }\n    return null;\n}\nexport function resultKeyNameFromField(field) {\n    return field.alias ? field.alias.value : field.name.value;\n}\nexport function getTypenameFromResult(result, selectionSet, fragmentMap) {\n    if (typeof result.__typename === 'string') {\n        return result.__typename;\n    }\n    for (var _i = 0, _a = selectionSet.selections; _i < _a.length; _i++) {\n        var selection = _a[_i];\n        if (isField(selection)) {\n            if (selection.name.value === '__typename') {\n                return result[resultKeyNameFromField(selection)];\n            }\n        }\n        else {\n            var typename = getTypenameFromResult(result, getFragmentFromSelection(selection, fragmentMap).selectionSet, fragmentMap);\n            if (typeof typename === 'string') {\n                return typename;\n            }\n        }\n    }\n}\nexport function isField(selection) {\n    return selection.kind === 'Field';\n}\nexport function isInlineFragment(selection) {\n    return selection.kind === 'InlineFragment';\n}\n//# sourceMappingURL=storeUtils.js.map","import { invariant, InvariantError } from \"../globals/index.js\";\nimport { valueToObjectRepresentation } from \"./storeUtils.js\";\nexport function checkDocument(doc) {\n    __DEV__ ? invariant(doc && doc.kind === 'Document', \"Expecting a parsed GraphQL document. Perhaps you need to wrap the query string in a \\\"gql\\\" tag? http://docs.apollostack.com/apollo-client/core.html#gql\") : invariant(doc && doc.kind === 'Document', 46);\n    var operations = doc.definitions\n        .filter(function (d) { return d.kind !== 'FragmentDefinition'; })\n        .map(function (definition) {\n        if (definition.kind !== 'OperationDefinition') {\n            throw __DEV__ ? new InvariantError(\"Schema type definitions not allowed in queries. Found: \\\"\" + definition.kind + \"\\\"\") : new InvariantError(47);\n        }\n        return definition;\n    });\n    __DEV__ ? invariant(operations.length <= 1, \"Ambiguous GraphQL document: contains \" + operations.length + \" operations\") : invariant(operations.length <= 1, 48);\n    return doc;\n}\nexport function getOperationDefinition(doc) {\n    checkDocument(doc);\n    return doc.definitions.filter(function (definition) { return definition.kind === 'OperationDefinition'; })[0];\n}\nexport function getOperationName(doc) {\n    return (doc.definitions\n        .filter(function (definition) {\n        return definition.kind === 'OperationDefinition' && definition.name;\n    })\n        .map(function (x) { return x.name.value; })[0] || null);\n}\nexport function getFragmentDefinitions(doc) {\n    return doc.definitions.filter(function (definition) { return definition.kind === 'FragmentDefinition'; });\n}\nexport function getQueryDefinition(doc) {\n    var queryDef = getOperationDefinition(doc);\n    __DEV__ ? invariant(queryDef && queryDef.operation === 'query', 'Must contain a query definition.') : invariant(queryDef && queryDef.operation === 'query', 49);\n    return queryDef;\n}\nexport function getFragmentDefinition(doc) {\n    __DEV__ ? invariant(doc.kind === 'Document', \"Expecting a parsed GraphQL document. Perhaps you need to wrap the query string in a \\\"gql\\\" tag? http://docs.apollostack.com/apollo-client/core.html#gql\") : invariant(doc.kind === 'Document', 50);\n    __DEV__ ? invariant(doc.definitions.length <= 1, 'Fragment must have exactly one definition.') : invariant(doc.definitions.length <= 1, 51);\n    var fragmentDef = doc.definitions[0];\n    __DEV__ ? invariant(fragmentDef.kind === 'FragmentDefinition', 'Must be a fragment definition.') : invariant(fragmentDef.kind === 'FragmentDefinition', 52);\n    return fragmentDef;\n}\nexport function getMainDefinition(queryDoc) {\n    checkDocument(queryDoc);\n    var fragmentDefinition;\n    for (var _i = 0, _a = queryDoc.definitions; _i < _a.length; _i++) {\n        var definition = _a[_i];\n        if (definition.kind === 'OperationDefinition') {\n            var operation = definition.operation;\n            if (operation === 'query' ||\n                operation === 'mutation' ||\n                operation === 'subscription') {\n                return definition;\n            }\n        }\n        if (definition.kind === 'FragmentDefinition' && !fragmentDefinition) {\n            fragmentDefinition = definition;\n        }\n    }\n    if (fragmentDefinition) {\n        return fragmentDefinition;\n    }\n    throw __DEV__ ? new InvariantError('Expected a parsed GraphQL query with a query, mutation, subscription, or a fragment.') : new InvariantError(53);\n}\nexport function getDefaultValues(definition) {\n    var defaultValues = Object.create(null);\n    var defs = definition && definition.variableDefinitions;\n    if (defs && defs.length) {\n        defs.forEach(function (def) {\n            if (def.defaultValue) {\n                valueToObjectRepresentation(defaultValues, def.variable.name, def.defaultValue);\n            }\n        });\n    }\n    return defaultValues;\n}\n//# sourceMappingURL=getFromAST.js.map","import { __extends } from \"tslib\";\nimport { InvariantError, invariant } from \"../../utilities/globals/index.js\";\nimport { Observable } from \"../../utilities/index.js\";\nimport { validateOperation, createOperation, transformOperation, } from \"../utils/index.js\";\nfunction passthrough(op, forward) {\n    return (forward ? forward(op) : Observable.of());\n}\nfunction toLink(handler) {\n    return typeof handler === 'function' ? new ApolloLink(handler) : handler;\n}\nfunction isTerminating(link) {\n    return link.request.length <= 1;\n}\nvar LinkError = (function (_super) {\n    __extends(LinkError, _super);\n    function LinkError(message, link) {\n        var _this = _super.call(this, message) || this;\n        _this.link = link;\n        return _this;\n    }\n    return LinkError;\n}(Error));\nvar ApolloLink = (function () {\n    function ApolloLink(request) {\n        if (request)\n            this.request = request;\n    }\n    ApolloLink.empty = function () {\n        return new ApolloLink(function () { return Observable.of(); });\n    };\n    ApolloLink.from = function (links) {\n        if (links.length === 0)\n            return ApolloLink.empty();\n        return links.map(toLink).reduce(function (x, y) { return x.concat(y); });\n    };\n    ApolloLink.split = function (test, left, right) {\n        var leftLink = toLink(left);\n        var rightLink = toLink(right || new ApolloLink(passthrough));\n        if (isTerminating(leftLink) && isTerminating(rightLink)) {\n            return new ApolloLink(function (operation) {\n                return test(operation)\n                    ? leftLink.request(operation) || Observable.of()\n                    : rightLink.request(operation) || Observable.of();\n            });\n        }\n        else {\n            return new ApolloLink(function (operation, forward) {\n                return test(operation)\n                    ? leftLink.request(operation, forward) || Observable.of()\n                    : rightLink.request(operation, forward) || Observable.of();\n            });\n        }\n    };\n    ApolloLink.execute = function (link, operation) {\n        return (link.request(createOperation(operation.context, transformOperation(validateOperation(operation)))) || Observable.of());\n    };\n    ApolloLink.concat = function (first, second) {\n        var firstLink = toLink(first);\n        if (isTerminating(firstLink)) {\n            __DEV__ && invariant.warn(new LinkError(\"You are calling concat on a terminating link, which will have no effect\", firstLink));\n            return firstLink;\n        }\n        var nextLink = toLink(second);\n        if (isTerminating(nextLink)) {\n            return new ApolloLink(function (operation) {\n                return firstLink.request(operation, function (op) { return nextLink.request(op) || Observable.of(); }) || Observable.of();\n            });\n        }\n        else {\n            return new ApolloLink(function (operation, forward) {\n                return (firstLink.request(operation, function (op) {\n                    return nextLink.request(op, forward) || Observable.of();\n                }) || Observable.of());\n            });\n        }\n    };\n    ApolloLink.prototype.split = function (test, left, right) {\n        return this.concat(ApolloLink.split(test, left, right || new ApolloLink(passthrough)));\n    };\n    ApolloLink.prototype.concat = function (next) {\n        return ApolloLink.concat(this, next);\n    };\n    ApolloLink.prototype.request = function (operation, forward) {\n        throw __DEV__ ? new InvariantError('request is not implemented') : new InvariantError(21);\n    };\n    ApolloLink.prototype.onError = function (error, observer) {\n        if (observer && observer.error) {\n            observer.error(error);\n            return false;\n        }\n        throw error;\n    };\n    ApolloLink.prototype.setOnError = function (fn) {\n        this.onError = fn;\n        return this;\n    };\n    return ApolloLink;\n}());\nexport { ApolloLink };\n//# sourceMappingURL=ApolloLink.js.map","import { __assign } from \"tslib\";\nexport function createOperation(starting, operation) {\n    var context = __assign({}, starting);\n    var setContext = function (next) {\n        if (typeof next === 'function') {\n            context = __assign(__assign({}, context), next(context));\n        }\n        else {\n            context = __assign(__assign({}, context), next);\n        }\n    };\n    var getContext = function () { return (__assign({}, context)); };\n    Object.defineProperty(operation, 'setContext', {\n        enumerable: false,\n        value: setContext,\n    });\n    Object.defineProperty(operation, 'getContext', {\n        enumerable: false,\n        value: getContext,\n    });\n    return operation;\n}\n//# sourceMappingURL=createOperation.js.map","import { getOperationName } from \"../../utilities/index.js\";\nexport function transformOperation(operation) {\n    var transformedOperation = {\n        variables: operation.variables || {},\n        extensions: operation.extensions || {},\n        operationName: operation.operationName,\n        query: operation.query,\n    };\n    if (!transformedOperation.operationName) {\n        transformedOperation.operationName =\n            typeof transformedOperation.query !== 'string'\n                ? getOperationName(transformedOperation.query) || undefined\n                : '';\n    }\n    return transformedOperation;\n}\n//# sourceMappingURL=transformOperation.js.map","import { InvariantError } from \"../../utilities/globals/index.js\";\nexport function validateOperation(operation) {\n    var OPERATION_FIELDS = [\n        'query',\n        'operationName',\n        'variables',\n        'extensions',\n        'context',\n    ];\n    for (var _i = 0, _a = Object.keys(operation); _i < _a.length; _i++) {\n        var key = _a[_i];\n        if (OPERATION_FIELDS.indexOf(key) < 0) {\n            throw __DEV__ ? new InvariantError(\"illegal argument: \" + key) : new InvariantError(26);\n        }\n    }\n    return operation;\n}\n//# sourceMappingURL=validateOperation.js.map","import { inspect } from '../jsutils/inspect.mjs';\nimport { devAssert } from '../jsutils/devAssert.mjs';\nimport { isNode, QueryDocumentKeys } from './ast.mjs';\nimport { Kind } from './kinds.mjs';\n/**\n * A visitor is provided to visit, it contains the collection of\n * relevant functions to be called during the visitor's traversal.\n */\n\nexport const BREAK = Object.freeze({});\n/**\n * visit() will walk through an AST using a depth-first traversal, calling\n * the visitor's enter function at each node in the traversal, and calling the\n * leave function after visiting that node and all of its child nodes.\n *\n * By returning different values from the enter and leave functions, the\n * behavior of the visitor can be altered, including skipping over a sub-tree of\n * the AST (by returning false), editing the AST by returning a value or null\n * to remove the value, or to stop the whole traversal by returning BREAK.\n *\n * When using visit() to edit an AST, the original AST will not be modified, and\n * a new version of the AST with the changes applied will be returned from the\n * visit function.\n *\n * ```ts\n * const editedAST = visit(ast, {\n *   enter(node, key, parent, path, ancestors) {\n *     // @return\n *     //   undefined: no action\n *     //   false: skip visiting this node\n *     //   visitor.BREAK: stop visiting altogether\n *     //   null: delete this node\n *     //   any value: replace this node with the returned value\n *   },\n *   leave(node, key, parent, path, ancestors) {\n *     // @return\n *     //   undefined: no action\n *     //   false: no action\n *     //   visitor.BREAK: stop visiting altogether\n *     //   null: delete this node\n *     //   any value: replace this node with the returned value\n *   }\n * });\n * ```\n *\n * Alternatively to providing enter() and leave() functions, a visitor can\n * instead provide functions named the same as the kinds of AST nodes, or\n * enter/leave visitors at a named key, leading to three permutations of the\n * visitor API:\n *\n * 1) Named visitors triggered when entering a node of a specific kind.\n *\n * ```ts\n * visit(ast, {\n *   Kind(node) {\n *     // enter the \"Kind\" node\n *   }\n * })\n * ```\n *\n * 2) Named visitors that trigger upon entering and leaving a node of a specific kind.\n *\n * ```ts\n * visit(ast, {\n *   Kind: {\n *     enter(node) {\n *       // enter the \"Kind\" node\n *     }\n *     leave(node) {\n *       // leave the \"Kind\" node\n *     }\n *   }\n * })\n * ```\n *\n * 3) Generic visitors that trigger upon entering and leaving any node.\n *\n * ```ts\n * visit(ast, {\n *   enter(node) {\n *     // enter any node\n *   },\n *   leave(node) {\n *     // leave any node\n *   }\n * })\n * ```\n */\n\nexport function visit(root, visitor, visitorKeys = QueryDocumentKeys) {\n  const enterLeaveMap = new Map();\n\n  for (const kind of Object.values(Kind)) {\n    enterLeaveMap.set(kind, getEnterLeaveForKind(visitor, kind));\n  }\n  /* eslint-disable no-undef-init */\n\n  let stack = undefined;\n  let inArray = Array.isArray(root);\n  let keys = [root];\n  let index = -1;\n  let edits = [];\n  let node = undefined;\n  let key = undefined;\n  let parent = undefined;\n  const path = [];\n  const ancestors = [];\n  let newRoot = root;\n  /* eslint-enable no-undef-init */\n\n  do {\n    index++;\n    const isLeaving = index === keys.length;\n    const isEdited = isLeaving && edits.length !== 0;\n\n    if (isLeaving) {\n      key = ancestors.length === 0 ? undefined : path[path.length - 1];\n      node = parent;\n      parent = ancestors.pop();\n\n      if (isEdited) {\n        if (inArray) {\n          node = node.slice();\n          let editOffset = 0;\n\n          for (const [editKey, editValue] of edits) {\n            const arrayKey = editKey - editOffset;\n\n            if (editValue === null) {\n              node.splice(arrayKey, 1);\n              editOffset++;\n            } else {\n              node[arrayKey] = editValue;\n            }\n          }\n        } else {\n          node = Object.defineProperties(\n            {},\n            Object.getOwnPropertyDescriptors(node),\n          );\n\n          for (const [editKey, editValue] of edits) {\n            node[editKey] = editValue;\n          }\n        }\n      }\n\n      index = stack.index;\n      keys = stack.keys;\n      edits = stack.edits;\n      inArray = stack.inArray;\n      stack = stack.prev;\n    } else {\n      key = parent ? (inArray ? index : keys[index]) : undefined;\n      node = parent ? parent[key] : newRoot;\n\n      if (node === null || node === undefined) {\n        continue;\n      }\n\n      if (parent) {\n        path.push(key);\n      }\n    }\n\n    let result;\n\n    if (!Array.isArray(node)) {\n      var _enterLeaveMap$get, _enterLeaveMap$get2;\n\n      isNode(node) || devAssert(false, `Invalid AST Node: ${inspect(node)}.`);\n      const visitFn = isLeaving\n        ? (_enterLeaveMap$get = enterLeaveMap.get(node.kind)) === null ||\n          _enterLeaveMap$get === void 0\n          ? void 0\n          : _enterLeaveMap$get.leave\n        : (_enterLeaveMap$get2 = enterLeaveMap.get(node.kind)) === null ||\n          _enterLeaveMap$get2 === void 0\n        ? void 0\n        : _enterLeaveMap$get2.enter;\n      result =\n        visitFn === null || visitFn === void 0\n          ? void 0\n          : visitFn.call(visitor, node, key, parent, path, ancestors);\n\n      if (result === BREAK) {\n        break;\n      }\n\n      if (result === false) {\n        if (!isLeaving) {\n          path.pop();\n          continue;\n        }\n      } else if (result !== undefined) {\n        edits.push([key, result]);\n\n        if (!isLeaving) {\n          if (isNode(result)) {\n            node = result;\n          } else {\n            path.pop();\n            continue;\n          }\n        }\n      }\n    }\n\n    if (result === undefined && isEdited) {\n      edits.push([key, node]);\n    }\n\n    if (isLeaving) {\n      path.pop();\n    } else {\n      var _node$kind;\n\n      stack = {\n        inArray,\n        index,\n        keys,\n        edits,\n        prev: stack,\n      };\n      inArray = Array.isArray(node);\n      keys = inArray\n        ? node\n        : (_node$kind = visitorKeys[node.kind]) !== null &&\n          _node$kind !== void 0\n        ? _node$kind\n        : [];\n      index = -1;\n      edits = [];\n\n      if (parent) {\n        ancestors.push(parent);\n      }\n\n      parent = node;\n    }\n  } while (stack !== undefined);\n\n  if (edits.length !== 0) {\n    newRoot = edits[edits.length - 1][1];\n  }\n\n  return newRoot;\n}\n/**\n * Creates a new visitor instance which delegates to many visitors to run in\n * parallel. Each visitor will be visited for each node before moving on.\n *\n * If a prior visitor edits a node, no following visitors will see that node.\n */\n\nexport function visitInParallel(visitors) {\n  const skipping = new Array(visitors.length).fill(null);\n  const mergedVisitor = Object.create(null);\n\n  for (const kind of Object.values(Kind)) {\n    let hasVisitor = false;\n    const enterList = new Array(visitors.length).fill(undefined);\n    const leaveList = new Array(visitors.length).fill(undefined);\n\n    for (let i = 0; i < visitors.length; ++i) {\n      const { enter, leave } = getEnterLeaveForKind(visitors[i], kind);\n      hasVisitor || (hasVisitor = enter != null || leave != null);\n      enterList[i] = enter;\n      leaveList[i] = leave;\n    }\n\n    if (!hasVisitor) {\n      continue;\n    }\n\n    const mergedEnterLeave = {\n      enter(...args) {\n        const node = args[0];\n\n        for (let i = 0; i < visitors.length; i++) {\n          if (skipping[i] === null) {\n            var _enterList$i;\n\n            const result =\n              (_enterList$i = enterList[i]) === null || _enterList$i === void 0\n                ? void 0\n                : _enterList$i.apply(visitors[i], args);\n\n            if (result === false) {\n              skipping[i] = node;\n            } else if (result === BREAK) {\n              skipping[i] = BREAK;\n            } else if (result !== undefined) {\n              return result;\n            }\n          }\n        }\n      },\n\n      leave(...args) {\n        const node = args[0];\n\n        for (let i = 0; i < visitors.length; i++) {\n          if (skipping[i] === null) {\n            var _leaveList$i;\n\n            const result =\n              (_leaveList$i = leaveList[i]) === null || _leaveList$i === void 0\n                ? void 0\n                : _leaveList$i.apply(visitors[i], args);\n\n            if (result === BREAK) {\n              skipping[i] = BREAK;\n            } else if (result !== undefined && result !== false) {\n              return result;\n            }\n          } else if (skipping[i] === node) {\n            skipping[i] = null;\n          }\n        }\n      },\n    };\n    mergedVisitor[kind] = mergedEnterLeave;\n  }\n\n  return mergedVisitor;\n}\n/**\n * Given a visitor instance and a node kind, return EnterLeaveVisitor for that kind.\n */\n\nexport function getEnterLeaveForKind(visitor, kind) {\n  const kindVisitor = visitor[kind];\n\n  if (typeof kindVisitor === 'object') {\n    // { Kind: { enter() {}, leave() {} } }\n    return kindVisitor;\n  } else if (typeof kindVisitor === 'function') {\n    // { Kind() {} }\n    return {\n      enter: kindVisitor,\n      leave: undefined,\n    };\n  } // { enter() {}, leave() {} }\n\n  return {\n    enter: visitor.enter,\n    leave: visitor.leave,\n  };\n}\n/**\n * Given a visitor instance, if it is leaving or not, and a node kind, return\n * the function the visitor runtime should call.\n *\n * @deprecated Please use `getEnterLeaveForKind` instead. Will be removed in v17\n */\n// istanbul ignore next (Deprecated code)\n\nexport function getVisitFn(visitor, kind, isLeaving) {\n  const { enter, leave } = getEnterLeaveForKind(visitor, kind);\n  return isLeaving ? leave : enter;\n}\n","import { InvariantError } from \"../../utilities/globals/index.js\";\nexport var serializeFetchParameter = function (p, label) {\n    var serialized;\n    try {\n        serialized = JSON.stringify(p);\n    }\n    catch (e) {\n        var parseError = __DEV__ ? new InvariantError(\"Network request failed. \" + label + \" is not serializable: \" + e.message) : new InvariantError(23);\n        parseError.parseError = e;\n        throw parseError;\n    }\n    return serialized;\n};\n//# sourceMappingURL=serializeFetchParameter.js.map","export var throwServerError = function (response, result, message) {\n    var error = new Error(message);\n    error.name = 'ServerError';\n    error.response = response;\n    error.statusCode = response.status;\n    error.result = result;\n    throw error;\n};\n//# sourceMappingURL=throwServerError.js.map","import { throwServerError } from \"../utils/index.js\";\nvar hasOwnProperty = Object.prototype.hasOwnProperty;\nexport function parseAndCheckHttpResponse(operations) {\n    return function (response) { return response\n        .text()\n        .then(function (bodyText) {\n        try {\n            return JSON.parse(bodyText);\n        }\n        catch (err) {\n            var parseError = err;\n            parseError.name = 'ServerParseError';\n            parseError.response = response;\n            parseError.statusCode = response.status;\n            parseError.bodyText = bodyText;\n            throw parseError;\n        }\n    })\n        .then(function (result) {\n        if (response.status >= 300) {\n            throwServerError(response, result, \"Response not successful: Received status code \" + response.status);\n        }\n        if (!Array.isArray(result) &&\n            !hasOwnProperty.call(result, 'data') &&\n            !hasOwnProperty.call(result, 'errors')) {\n            throwServerError(response, result, \"Server response was missing for query '\" + (Array.isArray(operations)\n                ? operations.map(function (op) { return op.operationName; })\n                : operations.operationName) + \"'.\");\n        }\n        return result;\n    }); };\n}\n//# sourceMappingURL=parseAndCheckHttpResponse.js.map","/**\n * Prints a string as a GraphQL StringValue literal. Replaces control characters\n * and excluded characters (\" U+0022 and \\\\ U+005C) with escape sequences.\n */\nexport function printString(str) {\n  return `\"${str.replace(escapedRegExp, escapedReplacer)}\"`;\n} // eslint-disable-next-line no-control-regex\n\nconst escapedRegExp = /[\\x00-\\x1f\\x22\\x5c\\x7f-\\x9f]/g;\n\nfunction escapedReplacer(str) {\n  return escapeSequences[str.charCodeAt(0)];\n} // prettier-ignore\n\nconst escapeSequences = [\n  '\\\\u0000',\n  '\\\\u0001',\n  '\\\\u0002',\n  '\\\\u0003',\n  '\\\\u0004',\n  '\\\\u0005',\n  '\\\\u0006',\n  '\\\\u0007',\n  '\\\\b',\n  '\\\\t',\n  '\\\\n',\n  '\\\\u000B',\n  '\\\\f',\n  '\\\\r',\n  '\\\\u000E',\n  '\\\\u000F',\n  '\\\\u0010',\n  '\\\\u0011',\n  '\\\\u0012',\n  '\\\\u0013',\n  '\\\\u0014',\n  '\\\\u0015',\n  '\\\\u0016',\n  '\\\\u0017',\n  '\\\\u0018',\n  '\\\\u0019',\n  '\\\\u001A',\n  '\\\\u001B',\n  '\\\\u001C',\n  '\\\\u001D',\n  '\\\\u001E',\n  '\\\\u001F',\n  '',\n  '',\n  '\\\\\"',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '', // 2F\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '', // 3F\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '', // 4F\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '\\\\\\\\',\n  '',\n  '',\n  '', // 5F\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '', // 6F\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '\\\\u007F',\n  '\\\\u0080',\n  '\\\\u0081',\n  '\\\\u0082',\n  '\\\\u0083',\n  '\\\\u0084',\n  '\\\\u0085',\n  '\\\\u0086',\n  '\\\\u0087',\n  '\\\\u0088',\n  '\\\\u0089',\n  '\\\\u008A',\n  '\\\\u008B',\n  '\\\\u008C',\n  '\\\\u008D',\n  '\\\\u008E',\n  '\\\\u008F',\n  '\\\\u0090',\n  '\\\\u0091',\n  '\\\\u0092',\n  '\\\\u0093',\n  '\\\\u0094',\n  '\\\\u0095',\n  '\\\\u0096',\n  '\\\\u0097',\n  '\\\\u0098',\n  '\\\\u0099',\n  '\\\\u009A',\n  '\\\\u009B',\n  '\\\\u009C',\n  '\\\\u009D',\n  '\\\\u009E',\n  '\\\\u009F',\n];\n","import { visit } from './visitor.mjs';\nimport { printBlockString } from './blockString.mjs';\nimport { printString } from './printString.mjs';\n/**\n * Converts an AST into a string, using one set of reasonable\n * formatting rules.\n */\n\nexport function print(ast) {\n  return visit(ast, printDocASTReducer);\n}\nconst MAX_LINE_LENGTH = 80;\nconst printDocASTReducer = {\n  Name: {\n    leave: (node) => node.value,\n  },\n  Variable: {\n    leave: (node) => '$' + node.name,\n  },\n  // Document\n  Document: {\n    leave: (node) => join(node.definitions, '\\n\\n'),\n  },\n  OperationDefinition: {\n    leave(node) {\n      const varDefs = wrap('(', join(node.variableDefinitions, ', '), ')');\n      const prefix = join(\n        [\n          node.operation,\n          join([node.name, varDefs]),\n          join(node.directives, ' '),\n        ],\n        ' ',\n      ); // Anonymous queries with no directives or variable definitions can use\n      // the query short form.\n\n      return (prefix === 'query' ? '' : prefix + ' ') + node.selectionSet;\n    },\n  },\n  VariableDefinition: {\n    leave: ({ variable, type, defaultValue, directives }) =>\n      variable +\n      ': ' +\n      type +\n      wrap(' = ', defaultValue) +\n      wrap(' ', join(directives, ' ')),\n  },\n  SelectionSet: {\n    leave: ({ selections }) => block(selections),\n  },\n  Field: {\n    leave({ alias, name, arguments: args, directives, selectionSet }) {\n      const prefix = wrap('', alias, ': ') + name;\n      let argsLine = prefix + wrap('(', join(args, ', '), ')');\n\n      if (argsLine.length > MAX_LINE_LENGTH) {\n        argsLine = prefix + wrap('(\\n', indent(join(args, '\\n')), '\\n)');\n      }\n\n      return join([argsLine, join(directives, ' '), selectionSet], ' ');\n    },\n  },\n  Argument: {\n    leave: ({ name, value }) => name + ': ' + value,\n  },\n  // Fragments\n  FragmentSpread: {\n    leave: ({ name, directives }) =>\n      '...' + name + wrap(' ', join(directives, ' ')),\n  },\n  InlineFragment: {\n    leave: ({ typeCondition, directives, selectionSet }) =>\n      join(\n        [\n          '...',\n          wrap('on ', typeCondition),\n          join(directives, ' '),\n          selectionSet,\n        ],\n        ' ',\n      ),\n  },\n  FragmentDefinition: {\n    leave: (\n      { name, typeCondition, variableDefinitions, directives, selectionSet }, // Note: fragment variable definitions are experimental and may be changed\n    ) =>\n      // or removed in the future.\n      `fragment ${name}${wrap('(', join(variableDefinitions, ', '), ')')} ` +\n      `on ${typeCondition} ${wrap('', join(directives, ' '), ' ')}` +\n      selectionSet,\n  },\n  // Value\n  IntValue: {\n    leave: ({ value }) => value,\n  },\n  FloatValue: {\n    leave: ({ value }) => value,\n  },\n  StringValue: {\n    leave: ({ value, block: isBlockString }) =>\n      isBlockString ? printBlockString(value) : printString(value),\n  },\n  BooleanValue: {\n    leave: ({ value }) => (value ? 'true' : 'false'),\n  },\n  NullValue: {\n    leave: () => 'null',\n  },\n  EnumValue: {\n    leave: ({ value }) => value,\n  },\n  ListValue: {\n    leave: ({ values }) => '[' + join(values, ', ') + ']',\n  },\n  ObjectValue: {\n    leave: ({ fields }) => '{' + join(fields, ', ') + '}',\n  },\n  ObjectField: {\n    leave: ({ name, value }) => name + ': ' + value,\n  },\n  // Directive\n  Directive: {\n    leave: ({ name, arguments: args }) =>\n      '@' + name + wrap('(', join(args, ', '), ')'),\n  },\n  // Type\n  NamedType: {\n    leave: ({ name }) => name,\n  },\n  ListType: {\n    leave: ({ type }) => '[' + type + ']',\n  },\n  NonNullType: {\n    leave: ({ type }) => type + '!',\n  },\n  // Type System Definitions\n  SchemaDefinition: {\n    leave: ({ description, directives, operationTypes }) =>\n      wrap('', description, '\\n') +\n      join(['schema', join(directives, ' '), block(operationTypes)], ' '),\n  },\n  OperationTypeDefinition: {\n    leave: ({ operation, type }) => operation + ': ' + type,\n  },\n  ScalarTypeDefinition: {\n    leave: ({ description, name, directives }) =>\n      wrap('', description, '\\n') +\n      join(['scalar', name, join(directives, ' ')], ' '),\n  },\n  ObjectTypeDefinition: {\n    leave: ({ description, name, interfaces, directives, fields }) =>\n      wrap('', description, '\\n') +\n      join(\n        [\n          'type',\n          name,\n          wrap('implements ', join(interfaces, ' & ')),\n          join(directives, ' '),\n          block(fields),\n        ],\n        ' ',\n      ),\n  },\n  FieldDefinition: {\n    leave: ({ description, name, arguments: args, type, directives }) =>\n      wrap('', description, '\\n') +\n      name +\n      (hasMultilineItems(args)\n        ? wrap('(\\n', indent(join(args, '\\n')), '\\n)')\n        : wrap('(', join(args, ', '), ')')) +\n      ': ' +\n      type +\n      wrap(' ', join(directives, ' ')),\n  },\n  InputValueDefinition: {\n    leave: ({ description, name, type, defaultValue, directives }) =>\n      wrap('', description, '\\n') +\n      join(\n        [name + ': ' + type, wrap('= ', defaultValue), join(directives, ' ')],\n        ' ',\n      ),\n  },\n  InterfaceTypeDefinition: {\n    leave: ({ description, name, interfaces, directives, fields }) =>\n      wrap('', description, '\\n') +\n      join(\n        [\n          'interface',\n          name,\n          wrap('implements ', join(interfaces, ' & ')),\n          join(directives, ' '),\n          block(fields),\n        ],\n        ' ',\n      ),\n  },\n  UnionTypeDefinition: {\n    leave: ({ description, name, directives, types }) =>\n      wrap('', description, '\\n') +\n      join(\n        ['union', name, join(directives, ' '), wrap('= ', join(types, ' | '))],\n        ' ',\n      ),\n  },\n  EnumTypeDefinition: {\n    leave: ({ description, name, directives, values }) =>\n      wrap('', description, '\\n') +\n      join(['enum', name, join(directives, ' '), block(values)], ' '),\n  },\n  EnumValueDefinition: {\n    leave: ({ description, name, directives }) =>\n      wrap('', description, '\\n') + join([name, join(directives, ' ')], ' '),\n  },\n  InputObjectTypeDefinition: {\n    leave: ({ description, name, directives, fields }) =>\n      wrap('', description, '\\n') +\n      join(['input', name, join(directives, ' '), block(fields)], ' '),\n  },\n  DirectiveDefinition: {\n    leave: ({ description, name, arguments: args, repeatable, locations }) =>\n      wrap('', description, '\\n') +\n      'directive @' +\n      name +\n      (hasMultilineItems(args)\n        ? wrap('(\\n', indent(join(args, '\\n')), '\\n)')\n        : wrap('(', join(args, ', '), ')')) +\n      (repeatable ? ' repeatable' : '') +\n      ' on ' +\n      join(locations, ' | '),\n  },\n  SchemaExtension: {\n    leave: ({ directives, operationTypes }) =>\n      join(\n        ['extend schema', join(directives, ' '), block(operationTypes)],\n        ' ',\n      ),\n  },\n  ScalarTypeExtension: {\n    leave: ({ name, directives }) =>\n      join(['extend scalar', name, join(directives, ' ')], ' '),\n  },\n  ObjectTypeExtension: {\n    leave: ({ name, interfaces, directives, fields }) =>\n      join(\n        [\n          'extend type',\n          name,\n          wrap('implements ', join(interfaces, ' & ')),\n          join(directives, ' '),\n          block(fields),\n        ],\n        ' ',\n      ),\n  },\n  InterfaceTypeExtension: {\n    leave: ({ name, interfaces, directives, fields }) =>\n      join(\n        [\n          'extend interface',\n          name,\n          wrap('implements ', join(interfaces, ' & ')),\n          join(directives, ' '),\n          block(fields),\n        ],\n        ' ',\n      ),\n  },\n  UnionTypeExtension: {\n    leave: ({ name, directives, types }) =>\n      join(\n        [\n          'extend union',\n          name,\n          join(directives, ' '),\n          wrap('= ', join(types, ' | ')),\n        ],\n        ' ',\n      ),\n  },\n  EnumTypeExtension: {\n    leave: ({ name, directives, values }) =>\n      join(['extend enum', name, join(directives, ' '), block(values)], ' '),\n  },\n  InputObjectTypeExtension: {\n    leave: ({ name, directives, fields }) =>\n      join(['extend input', name, join(directives, ' '), block(fields)], ' '),\n  },\n};\n/**\n * Given maybeArray, print an empty string if it is null or empty, otherwise\n * print all items together separated by separator if provided\n */\n\nfunction join(maybeArray, separator = '') {\n  var _maybeArray$filter$jo;\n\n  return (_maybeArray$filter$jo =\n    maybeArray === null || maybeArray === void 0\n      ? void 0\n      : maybeArray.filter((x) => x).join(separator)) !== null &&\n    _maybeArray$filter$jo !== void 0\n    ? _maybeArray$filter$jo\n    : '';\n}\n/**\n * Given array, print each item on its own line, wrapped in an indented `{ }` block.\n */\n\nfunction block(array) {\n  return wrap('{\\n', indent(join(array, '\\n')), '\\n}');\n}\n/**\n * If maybeString is not null or empty, then wrap with start and end, otherwise print an empty string.\n */\n\nfunction wrap(start, maybeString, end = '') {\n  return maybeString != null && maybeString !== ''\n    ? start + maybeString + end\n    : '';\n}\n\nfunction indent(str) {\n  return wrap('  ', str.replace(/\\n/g, '\\n  '));\n}\n\nfunction hasMultilineItems(maybeArray) {\n  var _maybeArray$some;\n\n  // istanbul ignore next (See: 'https://github.com/graphql/graphql-js/issues/2203')\n  return (_maybeArray$some =\n    maybeArray === null || maybeArray === void 0\n      ? void 0\n      : maybeArray.some((str) => str.includes('\\n'))) !== null &&\n    _maybeArray$some !== void 0\n    ? _maybeArray$some\n    : false;\n}\n","import { __assign } from \"tslib\";\nimport { print } from 'graphql';\nvar defaultHttpOptions = {\n    includeQuery: true,\n    includeExtensions: false,\n};\nvar defaultHeaders = {\n    accept: '*/*',\n    'content-type': 'application/json',\n};\nvar defaultOptions = {\n    method: 'POST',\n};\nexport var fallbackHttpConfig = {\n    http: defaultHttpOptions,\n    headers: defaultHeaders,\n    options: defaultOptions,\n};\nexport var selectHttpOptionsAndBody = function (operation, fallbackConfig) {\n    var configs = [];\n    for (var _i = 2; _i < arguments.length; _i++) {\n        configs[_i - 2] = arguments[_i];\n    }\n    var options = __assign(__assign({}, fallbackConfig.options), { headers: fallbackConfig.headers, credentials: fallbackConfig.credentials });\n    var http = fallbackConfig.http || {};\n    configs.forEach(function (config) {\n        options = __assign(__assign(__assign({}, options), config.options), { headers: __assign(__assign({}, options.headers), headersToLowerCase(config.headers)) });\n        if (config.credentials)\n            options.credentials = config.credentials;\n        http = __assign(__assign({}, http), config.http);\n    });\n    var operationName = operation.operationName, extensions = operation.extensions, variables = operation.variables, query = operation.query;\n    var body = { operationName: operationName, variables: variables };\n    if (http.includeExtensions)\n        body.extensions = extensions;\n    if (http.includeQuery)\n        body.query = print(query);\n    return {\n        options: options,\n        body: body,\n    };\n};\nfunction headersToLowerCase(headers) {\n    if (headers) {\n        var normalized_1 = Object.create(null);\n        Object.keys(Object(headers)).forEach(function (name) {\n            normalized_1[name.toLowerCase()] = headers[name];\n        });\n        return normalized_1;\n    }\n    return headers;\n}\n//# sourceMappingURL=selectHttpOptionsAndBody.js.map","import { Observable } from \"../../utilities/index.js\";\nexport function fromError(errorValue) {\n    return new Observable(function (observer) {\n        observer.error(errorValue);\n    });\n}\n//# sourceMappingURL=fromError.js.map","import { __assign, __rest } from \"tslib\";\nimport \"../../utilities/globals/index.js\";\nimport { visit } from 'graphql';\nimport { ApolloLink } from \"../core/index.js\";\nimport { Observable } from \"../../utilities/index.js\";\nimport { serializeFetchParameter } from \"./serializeFetchParameter.js\";\nimport { selectURI } from \"./selectURI.js\";\nimport { parseAndCheckHttpResponse } from \"./parseAndCheckHttpResponse.js\";\nimport { checkFetcher } from \"./checkFetcher.js\";\nimport { selectHttpOptionsAndBody, fallbackHttpConfig } from \"./selectHttpOptionsAndBody.js\";\nimport { createSignalIfSupported } from \"./createSignalIfSupported.js\";\nimport { rewriteURIForGET } from \"./rewriteURIForGET.js\";\nimport { fromError } from \"../utils/index.js\";\nimport { maybe } from \"../../utilities/index.js\";\nvar backupFetch = maybe(function () { return fetch; });\nexport var createHttpLink = function (linkOptions) {\n    if (linkOptions === void 0) { linkOptions = {}; }\n    var _a = linkOptions.uri, uri = _a === void 0 ? '/graphql' : _a, preferredFetch = linkOptions.fetch, includeExtensions = linkOptions.includeExtensions, useGETForQueries = linkOptions.useGETForQueries, _b = linkOptions.includeUnusedVariables, includeUnusedVariables = _b === void 0 ? false : _b, requestOptions = __rest(linkOptions, [\"uri\", \"fetch\", \"includeExtensions\", \"useGETForQueries\", \"includeUnusedVariables\"]);\n    if (__DEV__) {\n        checkFetcher(preferredFetch || backupFetch);\n    }\n    var linkConfig = {\n        http: { includeExtensions: includeExtensions },\n        options: requestOptions.fetchOptions,\n        credentials: requestOptions.credentials,\n        headers: requestOptions.headers,\n    };\n    return new ApolloLink(function (operation) {\n        var chosenURI = selectURI(operation, uri);\n        var context = operation.getContext();\n        var clientAwarenessHeaders = {};\n        if (context.clientAwareness) {\n            var _a = context.clientAwareness, name_1 = _a.name, version = _a.version;\n            if (name_1) {\n                clientAwarenessHeaders['apollographql-client-name'] = name_1;\n            }\n            if (version) {\n                clientAwarenessHeaders['apollographql-client-version'] = version;\n            }\n        }\n        var contextHeaders = __assign(__assign({}, clientAwarenessHeaders), context.headers);\n        var contextConfig = {\n            http: context.http,\n            options: context.fetchOptions,\n            credentials: context.credentials,\n            headers: contextHeaders,\n        };\n        var _b = selectHttpOptionsAndBody(operation, fallbackHttpConfig, linkConfig, contextConfig), options = _b.options, body = _b.body;\n        if (body.variables && !includeUnusedVariables) {\n            var unusedNames_1 = new Set(Object.keys(body.variables));\n            visit(operation.query, {\n                Variable: function (node, _key, parent) {\n                    if (parent && parent.kind !== 'VariableDefinition') {\n                        unusedNames_1.delete(node.name.value);\n                    }\n                },\n            });\n            if (unusedNames_1.size) {\n                body.variables = __assign({}, body.variables);\n                unusedNames_1.forEach(function (name) {\n                    delete body.variables[name];\n                });\n            }\n        }\n        var controller;\n        if (!options.signal) {\n            var _c = createSignalIfSupported(), _controller = _c.controller, signal = _c.signal;\n            controller = _controller;\n            if (controller)\n                options.signal = signal;\n        }\n        var definitionIsMutation = function (d) {\n            return d.kind === 'OperationDefinition' && d.operation === 'mutation';\n        };\n        if (useGETForQueries &&\n            !operation.query.definitions.some(definitionIsMutation)) {\n            options.method = 'GET';\n        }\n        if (options.method === 'GET') {\n            var _d = rewriteURIForGET(chosenURI, body), newURI = _d.newURI, parseError = _d.parseError;\n            if (parseError) {\n                return fromError(parseError);\n            }\n            chosenURI = newURI;\n        }\n        else {\n            try {\n                options.body = serializeFetchParameter(body, 'Payload');\n            }\n            catch (parseError) {\n                return fromError(parseError);\n            }\n        }\n        return new Observable(function (observer) {\n            var currentFetch = preferredFetch || maybe(function () { return fetch; }) || backupFetch;\n            currentFetch(chosenURI, options)\n                .then(function (response) {\n                operation.setContext({ response: response });\n                return response;\n            })\n                .then(parseAndCheckHttpResponse(operation))\n                .then(function (result) {\n                observer.next(result);\n                observer.complete();\n                return result;\n            })\n                .catch(function (err) {\n                if (err.name === 'AbortError')\n                    return;\n                if (err.result && err.result.errors && err.result.data) {\n                    observer.next(err.result);\n                }\n                observer.error(err);\n            });\n            return function () {\n                if (controller)\n                    controller.abort();\n            };\n        });\n    });\n};\n//# sourceMappingURL=createHttpLink.js.map","import { __extends } from \"tslib\";\nimport { ApolloLink } from \"../core/index.js\";\nimport { createHttpLink } from \"./createHttpLink.js\";\nvar HttpLink = (function (_super) {\n    __extends(HttpLink, _super);\n    function HttpLink(options) {\n        if (options === void 0) { options = {}; }\n        var _this = _super.call(this, createHttpLink(options).request) || this;\n        _this.options = options;\n        return _this;\n    }\n    return HttpLink;\n}(ApolloLink));\nexport { HttpLink };\n//# sourceMappingURL=HttpLink.js.map","import { InvariantError } from \"../../utilities/globals/index.js\";\nexport var checkFetcher = function (fetcher) {\n    if (!fetcher && typeof fetch === 'undefined') {\n        throw __DEV__ ? new InvariantError(\"\\n\\\"fetch\\\" has not been found globally and no fetcher has been configured. To fix this, install a fetch package (like https://www.npmjs.com/package/cross-fetch), instantiate the fetcher, and pass it into your HttpLink constructor. For example:\\n\\nimport fetch from 'cross-fetch';\\nimport { ApolloClient, HttpLink } from '@apollo/client';\\nconst client = new ApolloClient({\\n  link: new HttpLink({ uri: '/graphql', fetch })\\n});\\n    \") : new InvariantError(22);\n    }\n};\n//# sourceMappingURL=checkFetcher.js.map","export var selectURI = function (operation, fallbackURI) {\n    var context = operation.getContext();\n    var contextURI = context.uri;\n    if (contextURI) {\n        return contextURI;\n    }\n    else if (typeof fallbackURI === 'function') {\n        return fallbackURI(operation);\n    }\n    else {\n        return fallbackURI || '/graphql';\n    }\n};\n//# sourceMappingURL=selectURI.js.map","export var createSignalIfSupported = function () {\n    if (typeof AbortController === 'undefined')\n        return { controller: false, signal: false };\n    var controller = new AbortController();\n    var signal = controller.signal;\n    return { controller: controller, signal: signal };\n};\n//# sourceMappingURL=createSignalIfSupported.js.map","import { serializeFetchParameter } from \"./serializeFetchParameter.js\";\nexport function rewriteURIForGET(chosenURI, body) {\n    var queryParams = [];\n    var addQueryParam = function (key, value) {\n        queryParams.push(key + \"=\" + encodeURIComponent(value));\n    };\n    if ('query' in body) {\n        addQueryParam('query', body.query);\n    }\n    if (body.operationName) {\n        addQueryParam('operationName', body.operationName);\n    }\n    if (body.variables) {\n        var serializedVariables = void 0;\n        try {\n            serializedVariables = serializeFetchParameter(body.variables, 'Variables map');\n        }\n        catch (parseError) {\n            return { parseError: parseError };\n        }\n        addQueryParam('variables', serializedVariables);\n    }\n    if (body.extensions) {\n        var serializedExtensions = void 0;\n        try {\n            serializedExtensions = serializeFetchParameter(body.extensions, 'Extensions map');\n        }\n        catch (parseError) {\n            return { parseError: parseError };\n        }\n        addQueryParam('extensions', serializedExtensions);\n    }\n    var fragment = '', preFragment = chosenURI;\n    var fragmentStart = chosenURI.indexOf('#');\n    if (fragmentStart !== -1) {\n        fragment = chosenURI.substr(fragmentStart);\n        preFragment = chosenURI.substr(0, fragmentStart);\n    }\n    var queryParamsPrefix = preFragment.indexOf('?') === -1 ? '?' : '&';\n    var newURI = preFragment + queryParamsPrefix + queryParams.join('&') + fragment;\n    return { newURI: newURI };\n}\n//# sourceMappingURL=rewriteURIForGET.js.map","import { ApolloLink } from \"./ApolloLink.js\";\nexport var execute = ApolloLink.execute;\n//# sourceMappingURL=execute.js.map","export function compact() {\n    var objects = [];\n    for (var _i = 0; _i < arguments.length; _i++) {\n        objects[_i] = arguments[_i];\n    }\n    var result = Object.create(null);\n    objects.forEach(function (obj) {\n        if (!obj)\n            return;\n        Object.keys(obj).forEach(function (key) {\n            var value = obj[key];\n            if (value !== void 0) {\n                result[key] = value;\n            }\n        });\n    });\n    return result;\n}\n//# sourceMappingURL=compact.js.map","export var version = '3.4.17';\n//# sourceMappingURL=version.js.map","var _a = Object.prototype, toString = _a.toString, hasOwnProperty = _a.hasOwnProperty;\r\nvar fnToStr = Function.prototype.toString;\r\nvar previousComparisons = new Map();\r\n/**\r\n * Performs a deep equality check on two JavaScript values, tolerating cycles.\r\n */\r\nfunction equal(a, b) {\r\n    try {\r\n        return check(a, b);\r\n    }\r\n    finally {\r\n        previousComparisons.clear();\r\n    }\r\n}\r\nfunction check(a, b) {\r\n    // If the two values are strictly equal, our job is easy.\r\n    if (a === b) {\r\n        return true;\r\n    }\r\n    // Object.prototype.toString returns a representation of the runtime type of\r\n    // the given value that is considerably more precise than typeof.\r\n    var aTag = toString.call(a);\r\n    var bTag = toString.call(b);\r\n    // If the runtime types of a and b are different, they could maybe be equal\r\n    // under some interpretation of equality, but for simplicity and performance\r\n    // we just return false instead.\r\n    if (aTag !== bTag) {\r\n        return false;\r\n    }\r\n    switch (aTag) {\r\n        case '[object Array]':\r\n            // Arrays are a lot like other objects, but we can cheaply compare their\r\n            // lengths as a short-cut before comparing their elements.\r\n            if (a.length !== b.length)\r\n                return false;\r\n        // Fall through to object case...\r\n        case '[object Object]': {\r\n            if (previouslyCompared(a, b))\r\n                return true;\r\n            var aKeys = definedKeys(a);\r\n            var bKeys = definedKeys(b);\r\n            // If `a` and `b` have a different number of enumerable keys, they\r\n            // must be different.\r\n            var keyCount = aKeys.length;\r\n            if (keyCount !== bKeys.length)\r\n                return false;\r\n            // Now make sure they have the same keys.\r\n            for (var k = 0; k < keyCount; ++k) {\r\n                if (!hasOwnProperty.call(b, aKeys[k])) {\r\n                    return false;\r\n                }\r\n            }\r\n            // Finally, check deep equality of all child properties.\r\n            for (var k = 0; k < keyCount; ++k) {\r\n                var key = aKeys[k];\r\n                if (!check(a[key], b[key])) {\r\n                    return false;\r\n                }\r\n            }\r\n            return true;\r\n        }\r\n        case '[object Error]':\r\n            return a.name === b.name && a.message === b.message;\r\n        case '[object Number]':\r\n            // Handle NaN, which is !== itself.\r\n            if (a !== a)\r\n                return b !== b;\r\n        // Fall through to shared +a === +b case...\r\n        case '[object Boolean]':\r\n        case '[object Date]':\r\n            return +a === +b;\r\n        case '[object RegExp]':\r\n        case '[object String]':\r\n            return a == \"\" + b;\r\n        case '[object Map]':\r\n        case '[object Set]': {\r\n            if (a.size !== b.size)\r\n                return false;\r\n            if (previouslyCompared(a, b))\r\n                return true;\r\n            var aIterator = a.entries();\r\n            var isMap = aTag === '[object Map]';\r\n            while (true) {\r\n                var info = aIterator.next();\r\n                if (info.done)\r\n                    break;\r\n                // If a instanceof Set, aValue === aKey.\r\n                var _a = info.value, aKey = _a[0], aValue = _a[1];\r\n                // So this works the same way for both Set and Map.\r\n                if (!b.has(aKey)) {\r\n                    return false;\r\n                }\r\n                // However, we care about deep equality of values only when dealing\r\n                // with Map structures.\r\n                if (isMap && !check(aValue, b.get(aKey))) {\r\n                    return false;\r\n                }\r\n            }\r\n            return true;\r\n        }\r\n        case '[object Uint16Array]':\r\n        case '[object Uint8Array]': // Buffer, in Node.js.\r\n        case '[object Uint32Array]':\r\n        case '[object Int32Array]':\r\n        case '[object Int8Array]':\r\n        case '[object Int16Array]':\r\n        case '[object ArrayBuffer]':\r\n            // DataView doesn't need these conversions, but the equality check is\r\n            // otherwise the same.\r\n            a = new Uint8Array(a);\r\n            b = new Uint8Array(b);\r\n        // Fall through...\r\n        case '[object DataView]': {\r\n            var len = a.byteLength;\r\n            if (len === b.byteLength) {\r\n                while (len-- && a[len] === b[len]) {\r\n                    // Keep looping as long as the bytes are equal.\r\n                }\r\n            }\r\n            return len === -1;\r\n        }\r\n        case '[object AsyncFunction]':\r\n        case '[object GeneratorFunction]':\r\n        case '[object AsyncGeneratorFunction]':\r\n        case '[object Function]': {\r\n            var aCode = fnToStr.call(a);\r\n            if (aCode !== fnToStr.call(b)) {\r\n                return false;\r\n            }\r\n            // We consider non-native functions equal if they have the same code\r\n            // (native functions require === because their code is censored).\r\n            // Note that this behavior is not entirely sound, since !== function\r\n            // objects with the same code can behave differently depending on\r\n            // their closure scope. However, any function can behave differently\r\n            // depending on the values of its input arguments (including this)\r\n            // and its calling context (including its closure scope), even\r\n            // though the function object is === to itself; and it is entirely\r\n            // possible for functions that are not === to behave exactly the\r\n            // same under all conceivable circumstances. Because none of these\r\n            // factors are statically decidable in JavaScript, JS function\r\n            // equality is not well-defined. This ambiguity allows us to\r\n            // consider the best possible heuristic among various imperfect\r\n            // options, and equating non-native functions that have the same\r\n            // code has enormous practical benefits, such as when comparing\r\n            // functions that are repeatedly passed as fresh function\r\n            // expressions within objects that are otherwise deeply equal. Since\r\n            // any function created from the same syntactic expression (in the\r\n            // same code location) will always stringify to the same code\r\n            // according to fnToStr.call, we can reasonably expect these\r\n            // repeatedly passed function expressions to have the same code, and\r\n            // thus behave \"the same\" (with all the caveats mentioned above),\r\n            // even though the runtime function objects are !== to one another.\r\n            return !endsWith(aCode, nativeCodeSuffix);\r\n        }\r\n    }\r\n    // Otherwise the values are not equal.\r\n    return false;\r\n}\r\nfunction definedKeys(obj) {\r\n    // Remember that the second argument to Array.prototype.filter will be\r\n    // used as `this` within the callback function.\r\n    return Object.keys(obj).filter(isDefinedKey, obj);\r\n}\r\nfunction isDefinedKey(key) {\r\n    return this[key] !== void 0;\r\n}\r\nvar nativeCodeSuffix = \"{ [native code] }\";\r\nfunction endsWith(full, suffix) {\r\n    var fromIndex = full.length - suffix.length;\r\n    return fromIndex >= 0 &&\r\n        full.indexOf(suffix, fromIndex) === fromIndex;\r\n}\r\nfunction previouslyCompared(a, b) {\r\n    // Though cyclic references can make an object graph appear infinite from the\r\n    // perspective of a depth-first traversal, the graph still contains a finite\r\n    // number of distinct object references. We use the previousComparisons cache\r\n    // to avoid comparing the same pair of object references more than once, which\r\n    // guarantees termination (even if we end up comparing every object in one\r\n    // graph to every object in the other graph, which is extremely unlikely),\r\n    // while still allowing weird isomorphic structures (like rings with different\r\n    // lengths) a chance to pass the equality test.\r\n    var bSet = previousComparisons.get(a);\r\n    if (bSet) {\r\n        // Return true here because we can be sure false will be returned somewhere\r\n        // else if the objects are not equivalent.\r\n        if (bSet.has(b))\r\n            return true;\r\n    }\r\n    else {\r\n        previousComparisons.set(a, bSet = new Set);\r\n    }\r\n    bSet.add(b);\r\n    return false;\r\n}\n\nexport { equal as default, equal };\n//# sourceMappingURL=equality.esm.js.map\n","// A [trie](https://en.wikipedia.org/wiki/Trie) data structure that holds\r\n// object keys weakly, yet can also hold non-object keys, unlike the\r\n// native `WeakMap`.\r\n// If no makeData function is supplied, the looked-up data will be an empty,\r\n// null-prototype Object.\r\nvar defaultMakeData = function () { return Object.create(null); };\r\n// Useful for processing arguments objects as well as arrays.\r\nvar _a = Array.prototype, forEach = _a.forEach, slice = _a.slice;\r\nvar Trie = /** @class */ (function () {\r\n    function Trie(weakness, makeData) {\r\n        if (weakness === void 0) { weakness = true; }\r\n        if (makeData === void 0) { makeData = defaultMakeData; }\r\n        this.weakness = weakness;\r\n        this.makeData = makeData;\r\n    }\r\n    Trie.prototype.lookup = function () {\r\n        var array = [];\r\n        for (var _i = 0; _i < arguments.length; _i++) {\r\n            array[_i] = arguments[_i];\r\n        }\r\n        return this.lookupArray(array);\r\n    };\r\n    Trie.prototype.lookupArray = function (array) {\r\n        var node = this;\r\n        forEach.call(array, function (key) { return node = node.getChildTrie(key); });\r\n        return node.data || (node.data = this.makeData(slice.call(array)));\r\n    };\r\n    Trie.prototype.getChildTrie = function (key) {\r\n        var map = this.weakness && isObjRef(key)\r\n            ? this.weak || (this.weak = new WeakMap())\r\n            : this.strong || (this.strong = new Map());\r\n        var child = map.get(key);\r\n        if (!child)\r\n            map.set(key, child = new Trie(this.weakness, this.makeData));\r\n        return child;\r\n    };\r\n    return Trie;\r\n}());\r\nfunction isObjRef(value) {\r\n    switch (typeof value) {\r\n        case \"object\":\r\n            if (value === null)\r\n                break;\r\n        // Fall through to return true...\r\n        case \"function\":\r\n            return true;\r\n    }\r\n    return false;\r\n}\n\nexport { Trie };\n//# sourceMappingURL=trie.esm.js.map\n","import { __assign } from \"tslib\";\nimport \"../../utilities/globals/index.js\";\nimport { Trie } from \"@wry/trie\";\nimport { canUseWeakMap, canUseWeakSet, isNonNullObject as isObjectOrArray, } from \"../../utilities/index.js\";\nfunction shallowCopy(value) {\n    if (isObjectOrArray(value)) {\n        return Array.isArray(value)\n            ? value.slice(0)\n            : __assign({ __proto__: Object.getPrototypeOf(value) }, value);\n    }\n    return value;\n}\nvar ObjectCanon = (function () {\n    function ObjectCanon() {\n        this.known = new (canUseWeakSet ? WeakSet : Set)();\n        this.pool = new Trie(canUseWeakMap);\n        this.passes = new WeakMap();\n        this.keysByJSON = new Map();\n        this.empty = this.admit({});\n    }\n    ObjectCanon.prototype.isKnown = function (value) {\n        return isObjectOrArray(value) && this.known.has(value);\n    };\n    ObjectCanon.prototype.pass = function (value) {\n        if (isObjectOrArray(value)) {\n            var copy = shallowCopy(value);\n            this.passes.set(copy, value);\n            return copy;\n        }\n        return value;\n    };\n    ObjectCanon.prototype.admit = function (value) {\n        var _this = this;\n        if (isObjectOrArray(value)) {\n            var original = this.passes.get(value);\n            if (original)\n                return original;\n            var proto = Object.getPrototypeOf(value);\n            switch (proto) {\n                case Array.prototype: {\n                    if (this.known.has(value))\n                        return value;\n                    var array = value.map(this.admit, this);\n                    var node = this.pool.lookupArray(array);\n                    if (!node.array) {\n                        this.known.add(node.array = array);\n                        if (__DEV__) {\n                            Object.freeze(array);\n                        }\n                    }\n                    return node.array;\n                }\n                case null:\n                case Object.prototype: {\n                    if (this.known.has(value))\n                        return value;\n                    var proto_1 = Object.getPrototypeOf(value);\n                    var array_1 = [proto_1];\n                    var keys = this.sortedKeys(value);\n                    array_1.push(keys.json);\n                    var firstValueIndex_1 = array_1.length;\n                    keys.sorted.forEach(function (key) {\n                        array_1.push(_this.admit(value[key]));\n                    });\n                    var node = this.pool.lookupArray(array_1);\n                    if (!node.object) {\n                        var obj_1 = node.object = Object.create(proto_1);\n                        this.known.add(obj_1);\n                        keys.sorted.forEach(function (key, i) {\n                            obj_1[key] = array_1[firstValueIndex_1 + i];\n                        });\n                        if (__DEV__) {\n                            Object.freeze(obj_1);\n                        }\n                    }\n                    return node.object;\n                }\n            }\n        }\n        return value;\n    };\n    ObjectCanon.prototype.sortedKeys = function (obj) {\n        var keys = Object.keys(obj);\n        var node = this.pool.lookupArray(keys);\n        if (!node.keys) {\n            keys.sort();\n            var json = JSON.stringify(keys);\n            if (!(node.keys = this.keysByJSON.get(json))) {\n                this.keysByJSON.set(json, node.keys = { sorted: keys, json: json });\n            }\n        }\n        return node.keys;\n    };\n    return ObjectCanon;\n}());\nexport { ObjectCanon };\nexport var canonicalStringify = Object.assign(function (value) {\n    if (isObjectOrArray(value)) {\n        if (stringifyCanon === void 0) {\n            resetCanonicalStringify();\n        }\n        var canonical = stringifyCanon.admit(value);\n        var json = stringifyCache.get(canonical);\n        if (json === void 0) {\n            stringifyCache.set(canonical, json = JSON.stringify(canonical));\n        }\n        return json;\n    }\n    return JSON.stringify(value);\n}, {\n    reset: resetCanonicalStringify,\n});\nvar stringifyCanon;\nvar stringifyCache;\nfunction resetCanonicalStringify() {\n    stringifyCanon = new ObjectCanon;\n    stringifyCache = new (canUseWeakMap ? WeakMap : Map)();\n}\n//# sourceMappingURL=object-canon.js.map","export var canUseWeakMap = typeof WeakMap === 'function' && !(typeof navigator === 'object' &&\n    navigator.product === 'ReactNative');\nexport var canUseWeakSet = typeof WeakSet === 'function';\nexport var canUseSymbol = typeof Symbol === 'function' &&\n    typeof Symbol.for === 'function';\n//# sourceMappingURL=canUse.js.map","import { Observable } from \"./Observable.js\";\nexport function asyncMap(observable, mapFn, catchFn) {\n    return new Observable(function (observer) {\n        var next = observer.next, error = observer.error, complete = observer.complete;\n        var activeCallbackCount = 0;\n        var completed = false;\n        var promiseQueue = {\n            then: function (callback) {\n                return new Promise(function (resolve) { return resolve(callback()); });\n            },\n        };\n        function makeCallback(examiner, delegate) {\n            if (examiner) {\n                return function (arg) {\n                    ++activeCallbackCount;\n                    var both = function () { return examiner(arg); };\n                    promiseQueue = promiseQueue.then(both, both).then(function (result) {\n                        --activeCallbackCount;\n                        next && next.call(observer, result);\n                        if (completed) {\n                            handler.complete();\n                        }\n                    }, function (error) {\n                        --activeCallbackCount;\n                        throw error;\n                    }).catch(function (caught) {\n                        error && error.call(observer, caught);\n                    });\n                };\n            }\n            else {\n                return function (arg) { return delegate && delegate.call(observer, arg); };\n            }\n        }\n        var handler = {\n            next: makeCallback(mapFn, next),\n            error: makeCallback(catchFn, error),\n            complete: function () {\n                completed = true;\n                if (!activeCallbackCount) {\n                    complete && complete.call(observer);\n                }\n            },\n        };\n        var sub = observable.subscribe(handler);\n        return function () { return sub.unsubscribe(); };\n    });\n}\n//# sourceMappingURL=asyncMap.js.map","export function graphQLResultHasError(result) {\n    return (result.errors && result.errors.length > 0) || false;\n}\n//# sourceMappingURL=errorHandling.js.map","export function filterInPlace(array, test, context) {\n    var target = 0;\n    array.forEach(function (elem, i) {\n        if (test.call(this, elem, i, array)) {\n            array[target++] = elem;\n        }\n    }, context);\n    array.length = target;\n    return array;\n}\n//# sourceMappingURL=filterInPlace.js.map","import { __assign, __spreadArray } from \"tslib\";\nimport { invariant } from \"../globals/index.js\";\nimport { visit, } from 'graphql';\nimport { checkDocument, getOperationDefinition, getFragmentDefinition, getFragmentDefinitions, getMainDefinition, } from \"./getFromAST.js\";\nimport { filterInPlace } from \"../common/filterInPlace.js\";\nimport { isField, isInlineFragment } from \"./storeUtils.js\";\nimport { createFragmentMap, } from \"./fragments.js\";\nvar TYPENAME_FIELD = {\n    kind: 'Field',\n    name: {\n        kind: 'Name',\n        value: '__typename',\n    },\n};\nfunction isEmpty(op, fragments) {\n    return op.selectionSet.selections.every(function (selection) {\n        return selection.kind === 'FragmentSpread' &&\n            isEmpty(fragments[selection.name.value], fragments);\n    });\n}\nfunction nullIfDocIsEmpty(doc) {\n    return isEmpty(getOperationDefinition(doc) || getFragmentDefinition(doc), createFragmentMap(getFragmentDefinitions(doc)))\n        ? null\n        : doc;\n}\nfunction getDirectiveMatcher(directives) {\n    return function directiveMatcher(directive) {\n        return directives.some(function (dir) {\n            return (dir.name && dir.name === directive.name.value) ||\n                (dir.test && dir.test(directive));\n        });\n    };\n}\nexport function removeDirectivesFromDocument(directives, doc) {\n    var variablesInUse = Object.create(null);\n    var variablesToRemove = [];\n    var fragmentSpreadsInUse = Object.create(null);\n    var fragmentSpreadsToRemove = [];\n    var modifiedDoc = nullIfDocIsEmpty(visit(doc, {\n        Variable: {\n            enter: function (node, _key, parent) {\n                if (parent.kind !== 'VariableDefinition') {\n                    variablesInUse[node.name.value] = true;\n                }\n            },\n        },\n        Field: {\n            enter: function (node) {\n                if (directives && node.directives) {\n                    var shouldRemoveField = directives.some(function (directive) { return directive.remove; });\n                    if (shouldRemoveField &&\n                        node.directives &&\n                        node.directives.some(getDirectiveMatcher(directives))) {\n                        if (node.arguments) {\n                            node.arguments.forEach(function (arg) {\n                                if (arg.value.kind === 'Variable') {\n                                    variablesToRemove.push({\n                                        name: arg.value.name.value,\n                                    });\n                                }\n                            });\n                        }\n                        if (node.selectionSet) {\n                            getAllFragmentSpreadsFromSelectionSet(node.selectionSet).forEach(function (frag) {\n                                fragmentSpreadsToRemove.push({\n                                    name: frag.name.value,\n                                });\n                            });\n                        }\n                        return null;\n                    }\n                }\n            },\n        },\n        FragmentSpread: {\n            enter: function (node) {\n                fragmentSpreadsInUse[node.name.value] = true;\n            },\n        },\n        Directive: {\n            enter: function (node) {\n                if (getDirectiveMatcher(directives)(node)) {\n                    return null;\n                }\n            },\n        },\n    }));\n    if (modifiedDoc &&\n        filterInPlace(variablesToRemove, function (v) { return !!v.name && !variablesInUse[v.name]; }).length) {\n        modifiedDoc = removeArgumentsFromDocument(variablesToRemove, modifiedDoc);\n    }\n    if (modifiedDoc &&\n        filterInPlace(fragmentSpreadsToRemove, function (fs) { return !!fs.name && !fragmentSpreadsInUse[fs.name]; })\n            .length) {\n        modifiedDoc = removeFragmentSpreadFromDocument(fragmentSpreadsToRemove, modifiedDoc);\n    }\n    return modifiedDoc;\n}\nexport var addTypenameToDocument = Object.assign(function (doc) {\n    return visit(checkDocument(doc), {\n        SelectionSet: {\n            enter: function (node, _key, parent) {\n                if (parent &&\n                    parent.kind === 'OperationDefinition') {\n                    return;\n                }\n                var selections = node.selections;\n                if (!selections) {\n                    return;\n                }\n                var skip = selections.some(function (selection) {\n                    return (isField(selection) &&\n                        (selection.name.value === '__typename' ||\n                            selection.name.value.lastIndexOf('__', 0) === 0));\n                });\n                if (skip) {\n                    return;\n                }\n                var field = parent;\n                if (isField(field) &&\n                    field.directives &&\n                    field.directives.some(function (d) { return d.name.value === 'export'; })) {\n                    return;\n                }\n                return __assign(__assign({}, node), { selections: __spreadArray(__spreadArray([], selections, true), [TYPENAME_FIELD], false) });\n            },\n        },\n    });\n}, {\n    added: function (field) {\n        return field === TYPENAME_FIELD;\n    },\n});\nvar connectionRemoveConfig = {\n    test: function (directive) {\n        var willRemove = directive.name.value === 'connection';\n        if (willRemove) {\n            if (!directive.arguments ||\n                !directive.arguments.some(function (arg) { return arg.name.value === 'key'; })) {\n                __DEV__ && invariant.warn('Removing an @connection directive even though it does not have a key. ' +\n                    'You may want to use the key parameter to specify a store key.');\n            }\n        }\n        return willRemove;\n    },\n};\nexport function removeConnectionDirectiveFromDocument(doc) {\n    return removeDirectivesFromDocument([connectionRemoveConfig], checkDocument(doc));\n}\nfunction hasDirectivesInSelectionSet(directives, selectionSet, nestedCheck) {\n    if (nestedCheck === void 0) { nestedCheck = true; }\n    return (!!selectionSet &&\n        selectionSet.selections &&\n        selectionSet.selections.some(function (selection) {\n            return hasDirectivesInSelection(directives, selection, nestedCheck);\n        }));\n}\nfunction hasDirectivesInSelection(directives, selection, nestedCheck) {\n    if (nestedCheck === void 0) { nestedCheck = true; }\n    if (!isField(selection)) {\n        return true;\n    }\n    if (!selection.directives) {\n        return false;\n    }\n    return (selection.directives.some(getDirectiveMatcher(directives)) ||\n        (nestedCheck &&\n            hasDirectivesInSelectionSet(directives, selection.selectionSet, nestedCheck)));\n}\nfunction getArgumentMatcher(config) {\n    return function argumentMatcher(argument) {\n        return config.some(function (aConfig) {\n            return argument.value &&\n                argument.value.kind === 'Variable' &&\n                argument.value.name &&\n                (aConfig.name === argument.value.name.value ||\n                    (aConfig.test && aConfig.test(argument)));\n        });\n    };\n}\nexport function removeArgumentsFromDocument(config, doc) {\n    var argMatcher = getArgumentMatcher(config);\n    return nullIfDocIsEmpty(visit(doc, {\n        OperationDefinition: {\n            enter: function (node) {\n                return __assign(__assign({}, node), { variableDefinitions: node.variableDefinitions ? node.variableDefinitions.filter(function (varDef) {\n                        return !config.some(function (arg) { return arg.name === varDef.variable.name.value; });\n                    }) : [] });\n            },\n        },\n        Field: {\n            enter: function (node) {\n                var shouldRemoveField = config.some(function (argConfig) { return argConfig.remove; });\n                if (shouldRemoveField) {\n                    var argMatchCount_1 = 0;\n                    if (node.arguments) {\n                        node.arguments.forEach(function (arg) {\n                            if (argMatcher(arg)) {\n                                argMatchCount_1 += 1;\n                            }\n                        });\n                    }\n                    if (argMatchCount_1 === 1) {\n                        return null;\n                    }\n                }\n            },\n        },\n        Argument: {\n            enter: function (node) {\n                if (argMatcher(node)) {\n                    return null;\n                }\n            },\n        },\n    }));\n}\nexport function removeFragmentSpreadFromDocument(config, doc) {\n    function enter(node) {\n        if (config.some(function (def) { return def.name === node.name.value; })) {\n            return null;\n        }\n    }\n    return nullIfDocIsEmpty(visit(doc, {\n        FragmentSpread: { enter: enter },\n        FragmentDefinition: { enter: enter },\n    }));\n}\nfunction getAllFragmentSpreadsFromSelectionSet(selectionSet) {\n    var allFragments = [];\n    selectionSet.selections.forEach(function (selection) {\n        if ((isField(selection) || isInlineFragment(selection)) &&\n            selection.selectionSet) {\n            getAllFragmentSpreadsFromSelectionSet(selection.selectionSet).forEach(function (frag) { return allFragments.push(frag); });\n        }\n        else if (selection.kind === 'FragmentSpread') {\n            allFragments.push(selection);\n        }\n    });\n    return allFragments;\n}\nexport function buildQueryFromSelectionSet(document) {\n    var definition = getMainDefinition(document);\n    var definitionOperation = definition.operation;\n    if (definitionOperation === 'query') {\n        return document;\n    }\n    var modifiedDoc = visit(document, {\n        OperationDefinition: {\n            enter: function (node) {\n                return __assign(__assign({}, node), { operation: 'query' });\n            },\n        },\n    });\n    return modifiedDoc;\n}\nexport function removeClientSetsFromDocument(document) {\n    checkDocument(document);\n    var modifiedDoc = removeDirectivesFromDocument([\n        {\n            test: function (directive) { return directive.name.value === 'client'; },\n            remove: true,\n        },\n    ], document);\n    if (modifiedDoc) {\n        modifiedDoc = visit(modifiedDoc, {\n            FragmentDefinition: {\n                enter: function (node) {\n                    if (node.selectionSet) {\n                        var isTypenameOnly = node.selectionSet.selections.every(function (selection) {\n                            return isField(selection) && selection.name.value === '__typename';\n                        });\n                        if (isTypenameOnly) {\n                            return null;\n                        }\n                    }\n                },\n            },\n        });\n    }\n    return modifiedDoc;\n}\n//# sourceMappingURL=transform.js.map","import { invariant } from \"../globals/index.js\";\nimport { visit, } from 'graphql';\nexport function shouldInclude(_a, variables) {\n    var directives = _a.directives;\n    if (!directives || !directives.length) {\n        return true;\n    }\n    return getInclusionDirectives(directives).every(function (_a) {\n        var directive = _a.directive, ifArgument = _a.ifArgument;\n        var evaledValue = false;\n        if (ifArgument.value.kind === 'Variable') {\n            evaledValue = variables && variables[ifArgument.value.name.value];\n            __DEV__ ? invariant(evaledValue !== void 0, \"Invalid variable referenced in @\" + directive.name.value + \" directive.\") : invariant(evaledValue !== void 0, 39);\n        }\n        else {\n            evaledValue = ifArgument.value.value;\n        }\n        return directive.name.value === 'skip' ? !evaledValue : evaledValue;\n    });\n}\nexport function getDirectiveNames(root) {\n    var names = [];\n    visit(root, {\n        Directive: function (node) {\n            names.push(node.name.value);\n        },\n    });\n    return names;\n}\nexport function hasDirectives(names, root) {\n    return getDirectiveNames(root).some(function (name) { return names.indexOf(name) > -1; });\n}\nexport function hasClientExports(document) {\n    return (document &&\n        hasDirectives(['client'], document) &&\n        hasDirectives(['export'], document));\n}\nfunction isInclusionDirective(_a) {\n    var value = _a.name.value;\n    return value === 'skip' || value === 'include';\n}\nexport function getInclusionDirectives(directives) {\n    var result = [];\n    if (directives && directives.length) {\n        directives.forEach(function (directive) {\n            if (!isInclusionDirective(directive))\n                return;\n            var directiveArguments = directive.arguments;\n            var directiveName = directive.name.value;\n            __DEV__ ? invariant(directiveArguments && directiveArguments.length === 1, \"Incorrect number of arguments for the @\" + directiveName + \" directive.\") : invariant(directiveArguments && directiveArguments.length === 1, 40);\n            var ifArgument = directiveArguments[0];\n            __DEV__ ? invariant(ifArgument.name && ifArgument.name.value === 'if', \"Invalid argument for the @\" + directiveName + \" directive.\") : invariant(ifArgument.name && ifArgument.name.value === 'if', 41);\n            var ifValue = ifArgument.value;\n            __DEV__ ? invariant(ifValue &&\n                (ifValue.kind === 'Variable' || ifValue.kind === 'BooleanValue'), \"Argument for the @\" + directiveName + \" directive must be a variable or a boolean value.\") : invariant(ifValue &&\n                (ifValue.kind === 'Variable' || ifValue.kind === 'BooleanValue'), 42);\n            result.push({ directive: directive, ifArgument: ifArgument });\n        });\n    }\n    return result;\n}\n//# sourceMappingURL=directives.js.map","var prefixCounts = new Map();\nexport function makeUniqueId(prefix) {\n    var count = prefixCounts.get(prefix) || 1;\n    prefixCounts.set(prefix, count + 1);\n    return prefix + \":\" + count + \":\" + Math.random().toString(36).slice(2);\n}\n//# sourceMappingURL=makeUniqueId.js.map","export function iterateObserversSafely(observers, method, argument) {\n    var observersWithMethod = [];\n    observers.forEach(function (obs) { return obs[method] && observersWithMethod.push(obs); });\n    observersWithMethod.forEach(function (obs) { return obs[method](argument); });\n}\n//# sourceMappingURL=iteration.js.map","import { Observable } from \"./Observable.js\";\nimport { canUseSymbol } from \"../common/canUse.js\";\nexport function fixObservableSubclass(subclass) {\n    function set(key) {\n        Object.defineProperty(subclass, key, { value: Observable });\n    }\n    if (canUseSymbol && Symbol.species) {\n        set(Symbol.species);\n    }\n    set(\"@@species\");\n    return subclass;\n}\n//# sourceMappingURL=subclassing.js.map","import { __extends } from \"tslib\";\nimport { Observable } from \"./Observable.js\";\nimport { iterateObserversSafely } from \"./iteration.js\";\nimport { fixObservableSubclass } from \"./subclassing.js\";\nfunction isPromiseLike(value) {\n    return value && typeof value.then === \"function\";\n}\nvar Concast = (function (_super) {\n    __extends(Concast, _super);\n    function Concast(sources) {\n        var _this = _super.call(this, function (observer) {\n            _this.addObserver(observer);\n            return function () { return _this.removeObserver(observer); };\n        }) || this;\n        _this.observers = new Set();\n        _this.addCount = 0;\n        _this.promise = new Promise(function (resolve, reject) {\n            _this.resolve = resolve;\n            _this.reject = reject;\n        });\n        _this.handlers = {\n            next: function (result) {\n                if (_this.sub !== null) {\n                    _this.latest = [\"next\", result];\n                    iterateObserversSafely(_this.observers, \"next\", result);\n                }\n            },\n            error: function (error) {\n                var sub = _this.sub;\n                if (sub !== null) {\n                    if (sub)\n                        setTimeout(function () { return sub.unsubscribe(); });\n                    _this.sub = null;\n                    _this.latest = [\"error\", error];\n                    _this.reject(error);\n                    iterateObserversSafely(_this.observers, \"error\", error);\n                }\n            },\n            complete: function () {\n                if (_this.sub !== null) {\n                    var value = _this.sources.shift();\n                    if (!value) {\n                        _this.sub = null;\n                        if (_this.latest &&\n                            _this.latest[0] === \"next\") {\n                            _this.resolve(_this.latest[1]);\n                        }\n                        else {\n                            _this.resolve();\n                        }\n                        iterateObserversSafely(_this.observers, \"complete\");\n                    }\n                    else if (isPromiseLike(value)) {\n                        value.then(function (obs) { return _this.sub = obs.subscribe(_this.handlers); });\n                    }\n                    else {\n                        _this.sub = value.subscribe(_this.handlers);\n                    }\n                }\n            },\n        };\n        _this.cancel = function (reason) {\n            _this.reject(reason);\n            _this.sources = [];\n            _this.handlers.complete();\n        };\n        _this.promise.catch(function (_) { });\n        if (typeof sources === \"function\") {\n            sources = [new Observable(sources)];\n        }\n        if (isPromiseLike(sources)) {\n            sources.then(function (iterable) { return _this.start(iterable); }, _this.handlers.error);\n        }\n        else {\n            _this.start(sources);\n        }\n        return _this;\n    }\n    Concast.prototype.start = function (sources) {\n        if (this.sub !== void 0)\n            return;\n        this.sources = Array.from(sources);\n        this.handlers.complete();\n    };\n    Concast.prototype.deliverLastMessage = function (observer) {\n        if (this.latest) {\n            var nextOrError = this.latest[0];\n            var method = observer[nextOrError];\n            if (method) {\n                method.call(observer, this.latest[1]);\n            }\n            if (this.sub === null &&\n                nextOrError === \"next\" &&\n                observer.complete) {\n                observer.complete();\n            }\n        }\n    };\n    Concast.prototype.addObserver = function (observer) {\n        if (!this.observers.has(observer)) {\n            this.deliverLastMessage(observer);\n            this.observers.add(observer);\n            ++this.addCount;\n        }\n    };\n    Concast.prototype.removeObserver = function (observer, quietly) {\n        if (this.observers.delete(observer) &&\n            --this.addCount < 1 &&\n            !quietly) {\n            this.handlers.error(new Error(\"Observable cancelled prematurely\"));\n        }\n    };\n    Concast.prototype.cleanup = function (callback) {\n        var _this = this;\n        var called = false;\n        var once = function () {\n            if (!called) {\n                called = true;\n                _this.observers.delete(observer);\n                callback();\n            }\n        };\n        var observer = {\n            next: once,\n            error: once,\n            complete: once,\n        };\n        var count = this.addCount;\n        this.addObserver(observer);\n        this.addCount = count;\n    };\n    return Concast;\n}(Observable));\nexport { Concast };\nfixObservableSubclass(Concast);\n//# sourceMappingURL=Concast.js.map","export function isNonEmptyArray(value) {\n    return Array.isArray(value) && value.length > 0;\n}\n//# sourceMappingURL=arrays.js.map","import { __extends } from \"tslib\";\nimport \"../utilities/globals/index.js\";\nimport { isNonEmptyArray } from \"../utilities/index.js\";\nexport function isApolloError(err) {\n    return err.hasOwnProperty('graphQLErrors');\n}\nvar generateErrorMessage = function (err) {\n    var message = '';\n    if (isNonEmptyArray(err.graphQLErrors) || isNonEmptyArray(err.clientErrors)) {\n        var errors = (err.graphQLErrors || [])\n            .concat(err.clientErrors || []);\n        errors.forEach(function (error) {\n            var errorMessage = error\n                ? error.message\n                : 'Error message not found.';\n            message += errorMessage + \"\\n\";\n        });\n    }\n    if (err.networkError) {\n        message += err.networkError.message + \"\\n\";\n    }\n    message = message.replace(/\\n$/, '');\n    return message;\n};\nvar ApolloError = (function (_super) {\n    __extends(ApolloError, _super);\n    function ApolloError(_a) {\n        var graphQLErrors = _a.graphQLErrors, clientErrors = _a.clientErrors, networkError = _a.networkError, errorMessage = _a.errorMessage, extraInfo = _a.extraInfo;\n        var _this = _super.call(this, errorMessage) || this;\n        _this.graphQLErrors = graphQLErrors || [];\n        _this.clientErrors = clientErrors || [];\n        _this.networkError = networkError || null;\n        _this.message = errorMessage || generateErrorMessage(_this);\n        _this.extraInfo = extraInfo;\n        _this.__proto__ = ApolloError.prototype;\n        return _this;\n    }\n    return ApolloError;\n}(Error));\nexport { ApolloError };\n//# sourceMappingURL=index.js.map","export var NetworkStatus;\n(function (NetworkStatus) {\n    NetworkStatus[NetworkStatus[\"loading\"] = 1] = \"loading\";\n    NetworkStatus[NetworkStatus[\"setVariables\"] = 2] = \"setVariables\";\n    NetworkStatus[NetworkStatus[\"fetchMore\"] = 3] = \"fetchMore\";\n    NetworkStatus[NetworkStatus[\"refetch\"] = 4] = \"refetch\";\n    NetworkStatus[NetworkStatus[\"poll\"] = 6] = \"poll\";\n    NetworkStatus[NetworkStatus[\"ready\"] = 7] = \"ready\";\n    NetworkStatus[NetworkStatus[\"error\"] = 8] = \"error\";\n})(NetworkStatus || (NetworkStatus = {}));\nexport function isNetworkRequestInFlight(networkStatus) {\n    return networkStatus ? networkStatus < 7 : false;\n}\n//# sourceMappingURL=networkStatus.js.map","var toString = Object.prototype.toString;\nexport function cloneDeep(value) {\n    return cloneDeepHelper(value);\n}\nfunction cloneDeepHelper(val, seen) {\n    switch (toString.call(val)) {\n        case \"[object Array]\": {\n            seen = seen || new Map;\n            if (seen.has(val))\n                return seen.get(val);\n            var copy_1 = val.slice(0);\n            seen.set(val, copy_1);\n            copy_1.forEach(function (child, i) {\n                copy_1[i] = cloneDeepHelper(child, seen);\n            });\n            return copy_1;\n        }\n        case \"[object Object]\": {\n            seen = seen || new Map;\n            if (seen.has(val))\n                return seen.get(val);\n            var copy_2 = Object.create(Object.getPrototypeOf(val));\n            seen.set(val, copy_2);\n            Object.keys(val).forEach(function (key) {\n                copy_2[key] = cloneDeepHelper(val[key], seen);\n            });\n            return copy_2;\n        }\n        default:\n            return val;\n    }\n}\n//# sourceMappingURL=cloneDeep.js.map","import { __assign, __extends } from \"tslib\";\nimport { invariant } from \"../utilities/globals/index.js\";\nimport { equal } from '@wry/equality';\nimport { NetworkStatus, isNetworkRequestInFlight } from \"./networkStatus.js\";\nimport { compact, cloneDeep, getOperationDefinition, Observable, iterateObserversSafely, isNonEmptyArray, fixObservableSubclass, getQueryDefinition, } from \"../utilities/index.js\";\nvar assign = Object.assign, hasOwnProperty = Object.hasOwnProperty;\nvar warnedAboutUpdateQuery = false;\nvar ObservableQuery = (function (_super) {\n    __extends(ObservableQuery, _super);\n    function ObservableQuery(_a) {\n        var queryManager = _a.queryManager, queryInfo = _a.queryInfo, options = _a.options;\n        var _this = _super.call(this, function (observer) {\n            try {\n                var subObserver = observer._subscription._observer;\n                if (subObserver && !subObserver.error) {\n                    subObserver.error = defaultSubscriptionObserverErrorCallback;\n                }\n            }\n            catch (_a) { }\n            var first = !_this.observers.size;\n            _this.observers.add(observer);\n            var last = _this.last;\n            if (last && last.error) {\n                observer.error && observer.error(last.error);\n            }\n            else if (last && last.result) {\n                observer.next && observer.next(last.result);\n            }\n            if (first) {\n                _this.reobserve().catch(function () { });\n            }\n            return function () {\n                if (_this.observers.delete(observer) && !_this.observers.size) {\n                    _this.tearDownQuery();\n                }\n            };\n        }) || this;\n        _this.observers = new Set();\n        _this.subscriptions = new Set();\n        _this.isTornDown = false;\n        _this.options = options;\n        _this.queryId = queryInfo.queryId || queryManager.generateQueryId();\n        var opDef = getOperationDefinition(options.query);\n        _this.queryName = opDef && opDef.name && opDef.name.value;\n        _this.initialFetchPolicy = options.fetchPolicy || \"cache-first\";\n        _this.queryManager = queryManager;\n        _this.queryInfo = queryInfo;\n        return _this;\n    }\n    Object.defineProperty(ObservableQuery.prototype, \"variables\", {\n        get: function () {\n            return this.options.variables;\n        },\n        enumerable: false,\n        configurable: true\n    });\n    ObservableQuery.prototype.result = function () {\n        var _this = this;\n        return new Promise(function (resolve, reject) {\n            var observer = {\n                next: function (result) {\n                    resolve(result);\n                    _this.observers.delete(observer);\n                    if (!_this.observers.size) {\n                        _this.queryManager.removeQuery(_this.queryId);\n                    }\n                    setTimeout(function () {\n                        subscription.unsubscribe();\n                    }, 0);\n                },\n                error: reject,\n            };\n            var subscription = _this.subscribe(observer);\n        });\n    };\n    ObservableQuery.prototype.getCurrentResult = function (saveAsLastResult) {\n        if (saveAsLastResult === void 0) { saveAsLastResult = true; }\n        var lastResult = this.getLastResult(true);\n        var networkStatus = this.queryInfo.networkStatus ||\n            (lastResult && lastResult.networkStatus) ||\n            NetworkStatus.ready;\n        var result = __assign(__assign({}, lastResult), { loading: isNetworkRequestInFlight(networkStatus), networkStatus: networkStatus });\n        var _a = this.options.fetchPolicy, fetchPolicy = _a === void 0 ? \"cache-first\" : _a;\n        var shouldReturnCachedData = lastResult || (fetchPolicy !== 'network-only' &&\n            fetchPolicy !== 'no-cache' &&\n            fetchPolicy !== 'standby');\n        if (shouldReturnCachedData &&\n            !this.queryManager.transform(this.options.query).hasForcedResolvers) {\n            var diff = this.queryInfo.getDiff();\n            if (diff.complete || this.options.returnPartialData) {\n                result.data = diff.result;\n            }\n            if (equal(result.data, {})) {\n                result.data = void 0;\n            }\n            if (diff.complete) {\n                if (result.networkStatus === NetworkStatus.loading &&\n                    (fetchPolicy === 'cache-first' ||\n                        fetchPolicy === 'cache-only')) {\n                    result.networkStatus = NetworkStatus.ready;\n                    result.loading = false;\n                }\n                delete result.partial;\n            }\n            else if (fetchPolicy !== \"no-cache\") {\n                result.partial = true;\n            }\n            if (__DEV__ &&\n                !diff.complete &&\n                !this.options.partialRefetch &&\n                !result.loading &&\n                !result.data &&\n                !result.error) {\n                logMissingFieldErrors(diff.missing);\n            }\n        }\n        if (saveAsLastResult) {\n            this.updateLastResult(result);\n        }\n        return result;\n    };\n    ObservableQuery.prototype.isDifferentFromLastResult = function (newResult) {\n        return !this.last || !equal(this.last.result, newResult);\n    };\n    ObservableQuery.prototype.getLast = function (key, variablesMustMatch) {\n        var last = this.last;\n        if (last &&\n            last[key] &&\n            (!variablesMustMatch || equal(last.variables, this.variables))) {\n            return last[key];\n        }\n    };\n    ObservableQuery.prototype.getLastResult = function (variablesMustMatch) {\n        return this.getLast(\"result\", variablesMustMatch);\n    };\n    ObservableQuery.prototype.getLastError = function (variablesMustMatch) {\n        return this.getLast(\"error\", variablesMustMatch);\n    };\n    ObservableQuery.prototype.resetLastResults = function () {\n        delete this.last;\n        this.isTornDown = false;\n    };\n    ObservableQuery.prototype.resetQueryStoreErrors = function () {\n        this.queryManager.resetErrors(this.queryId);\n    };\n    ObservableQuery.prototype.refetch = function (variables) {\n        var _a;\n        var reobserveOptions = {\n            pollInterval: 0,\n        };\n        var fetchPolicy = this.options.fetchPolicy;\n        if (fetchPolicy === 'no-cache') {\n            reobserveOptions.fetchPolicy = 'no-cache';\n        }\n        else if (fetchPolicy !== 'cache-and-network') {\n            reobserveOptions.fetchPolicy = 'network-only';\n        }\n        if (__DEV__ && variables && hasOwnProperty.call(variables, \"variables\")) {\n            var queryDef = getQueryDefinition(this.options.query);\n            var vars = queryDef.variableDefinitions;\n            if (!vars || !vars.some(function (v) { return v.variable.name.value === \"variables\"; })) {\n                __DEV__ && invariant.warn(\"Called refetch(\" + JSON.stringify(variables) + \") for query \" + (((_a = queryDef.name) === null || _a === void 0 ? void 0 : _a.value) || JSON.stringify(queryDef)) + \", which does not declare a $variables variable.\\nDid you mean to call refetch(variables) instead of refetch({ variables })?\");\n            }\n        }\n        if (variables && !equal(this.options.variables, variables)) {\n            reobserveOptions.variables = this.options.variables = __assign(__assign({}, this.options.variables), variables);\n        }\n        this.queryInfo.resetLastWrite();\n        return this.reobserve(reobserveOptions, NetworkStatus.refetch);\n    };\n    ObservableQuery.prototype.fetchMore = function (fetchMoreOptions) {\n        var _this = this;\n        var combinedOptions = __assign(__assign({}, (fetchMoreOptions.query ? fetchMoreOptions : __assign(__assign(__assign({}, this.options), fetchMoreOptions), { variables: __assign(__assign({}, this.options.variables), fetchMoreOptions.variables) }))), { fetchPolicy: \"no-cache\" });\n        var qid = this.queryManager.generateQueryId();\n        if (combinedOptions.notifyOnNetworkStatusChange) {\n            this.queryInfo.networkStatus = NetworkStatus.fetchMore;\n            this.observe();\n        }\n        return this.queryManager.fetchQuery(qid, combinedOptions, NetworkStatus.fetchMore).then(function (fetchMoreResult) {\n            var data = fetchMoreResult.data;\n            var updateQuery = fetchMoreOptions.updateQuery;\n            if (updateQuery) {\n                if (__DEV__ &&\n                    !warnedAboutUpdateQuery) {\n                    __DEV__ && invariant.warn(\"The updateQuery callback for fetchMore is deprecated, and will be removed\\nin the next major version of Apollo Client.\\n\\nPlease convert updateQuery functions to field policies with appropriate\\nread and merge functions, or use/adapt a helper function (such as\\nconcatPagination, offsetLimitPagination, or relayStylePagination) from\\n@apollo/client/utilities.\\n\\nThe field policy system handles pagination more effectively than a\\nhand-written updateQuery function, and you only need to define the policy\\nonce, rather than every time you call fetchMore.\");\n                    warnedAboutUpdateQuery = true;\n                }\n                _this.updateQuery(function (previous) { return updateQuery(previous, {\n                    fetchMoreResult: data,\n                    variables: combinedOptions.variables,\n                }); });\n            }\n            else {\n                _this.queryManager.cache.writeQuery({\n                    query: combinedOptions.query,\n                    variables: combinedOptions.variables,\n                    data: data,\n                });\n            }\n            return fetchMoreResult;\n        }).finally(function () {\n            _this.queryManager.stopQuery(qid);\n            _this.reobserve();\n        });\n    };\n    ObservableQuery.prototype.subscribeToMore = function (options) {\n        var _this = this;\n        var subscription = this.queryManager\n            .startGraphQLSubscription({\n            query: options.document,\n            variables: options.variables,\n            context: options.context,\n        })\n            .subscribe({\n            next: function (subscriptionData) {\n                var updateQuery = options.updateQuery;\n                if (updateQuery) {\n                    _this.updateQuery(function (previous, _a) {\n                        var variables = _a.variables;\n                        return updateQuery(previous, {\n                            subscriptionData: subscriptionData,\n                            variables: variables,\n                        });\n                    });\n                }\n            },\n            error: function (err) {\n                if (options.onError) {\n                    options.onError(err);\n                    return;\n                }\n                __DEV__ && invariant.error('Unhandled GraphQL subscription error', err);\n            },\n        });\n        this.subscriptions.add(subscription);\n        return function () {\n            if (_this.subscriptions.delete(subscription)) {\n                subscription.unsubscribe();\n            }\n        };\n    };\n    ObservableQuery.prototype.setOptions = function (newOptions) {\n        return this.reobserve(newOptions);\n    };\n    ObservableQuery.prototype.setVariables = function (variables) {\n        if (equal(this.variables, variables)) {\n            return this.observers.size\n                ? this.result()\n                : Promise.resolve();\n        }\n        this.options.variables = variables;\n        if (!this.observers.size) {\n            return Promise.resolve();\n        }\n        return this.reobserve({\n            fetchPolicy: this.initialFetchPolicy,\n            variables: variables,\n        }, NetworkStatus.setVariables);\n    };\n    ObservableQuery.prototype.updateQuery = function (mapFn) {\n        var queryManager = this.queryManager;\n        var result = queryManager.cache.diff({\n            query: this.options.query,\n            variables: this.variables,\n            returnPartialData: true,\n            optimistic: false,\n        }).result;\n        var newResult = mapFn(result, {\n            variables: this.variables,\n        });\n        if (newResult) {\n            queryManager.cache.writeQuery({\n                query: this.options.query,\n                data: newResult,\n                variables: this.variables,\n            });\n            queryManager.broadcastQueries();\n        }\n    };\n    ObservableQuery.prototype.startPolling = function (pollInterval) {\n        this.options.pollInterval = pollInterval;\n        this.updatePolling();\n    };\n    ObservableQuery.prototype.stopPolling = function () {\n        this.options.pollInterval = 0;\n        this.updatePolling();\n    };\n    ObservableQuery.prototype.fetch = function (options, newNetworkStatus) {\n        this.queryManager.setObservableQuery(this);\n        return this.queryManager.fetchQueryObservable(this.queryId, options, newNetworkStatus);\n    };\n    ObservableQuery.prototype.updatePolling = function () {\n        var _this = this;\n        if (this.queryManager.ssrMode) {\n            return;\n        }\n        var _a = this, pollingInfo = _a.pollingInfo, pollInterval = _a.options.pollInterval;\n        if (!pollInterval) {\n            if (pollingInfo) {\n                clearTimeout(pollingInfo.timeout);\n                delete this.pollingInfo;\n            }\n            return;\n        }\n        if (pollingInfo &&\n            pollingInfo.interval === pollInterval) {\n            return;\n        }\n        __DEV__ ? invariant(pollInterval, 'Attempted to start a polling query without a polling interval.') : invariant(pollInterval, 12);\n        var info = pollingInfo || (this.pollingInfo = {});\n        info.interval = pollInterval;\n        var maybeFetch = function () {\n            if (_this.pollingInfo) {\n                if (!isNetworkRequestInFlight(_this.queryInfo.networkStatus)) {\n                    _this.reobserve({\n                        fetchPolicy: \"network-only\",\n                    }, NetworkStatus.poll).then(poll, poll);\n                }\n                else {\n                    poll();\n                }\n            }\n            ;\n        };\n        var poll = function () {\n            var info = _this.pollingInfo;\n            if (info) {\n                clearTimeout(info.timeout);\n                info.timeout = setTimeout(maybeFetch, info.interval);\n            }\n        };\n        poll();\n    };\n    ObservableQuery.prototype.updateLastResult = function (newResult, variables) {\n        if (variables === void 0) { variables = this.variables; }\n        this.last = __assign(__assign({}, this.last), { result: this.queryManager.assumeImmutableResults\n                ? newResult\n                : cloneDeep(newResult), variables: variables });\n        if (!isNonEmptyArray(newResult.errors)) {\n            delete this.last.error;\n        }\n        return this.last;\n    };\n    ObservableQuery.prototype.reobserve = function (newOptions, newNetworkStatus) {\n        var _this = this;\n        this.isTornDown = false;\n        var useDisposableConcast = newNetworkStatus === NetworkStatus.refetch ||\n            newNetworkStatus === NetworkStatus.fetchMore ||\n            newNetworkStatus === NetworkStatus.poll;\n        var oldVariables = this.options.variables;\n        var options = useDisposableConcast\n            ? compact(this.options, newOptions)\n            : assign(this.options, compact(newOptions));\n        if (!useDisposableConcast) {\n            this.updatePolling();\n            if (newOptions &&\n                newOptions.variables &&\n                !newOptions.fetchPolicy &&\n                !equal(newOptions.variables, oldVariables)) {\n                options.fetchPolicy = this.initialFetchPolicy;\n                if (newNetworkStatus === void 0) {\n                    newNetworkStatus = NetworkStatus.setVariables;\n                }\n            }\n        }\n        var variables = options.variables && __assign({}, options.variables);\n        var concast = this.fetch(options, newNetworkStatus);\n        var observer = {\n            next: function (result) {\n                _this.reportResult(result, variables);\n            },\n            error: function (error) {\n                _this.reportError(error, variables);\n            },\n        };\n        if (!useDisposableConcast) {\n            if (this.concast && this.observer) {\n                this.concast.removeObserver(this.observer, true);\n            }\n            this.concast = concast;\n            this.observer = observer;\n        }\n        concast.addObserver(observer);\n        return concast.promise;\n    };\n    ObservableQuery.prototype.observe = function () {\n        this.reportResult(this.getCurrentResult(false), this.variables);\n    };\n    ObservableQuery.prototype.reportResult = function (result, variables) {\n        if (this.getLastError() || this.isDifferentFromLastResult(result)) {\n            this.updateLastResult(result, variables);\n            iterateObserversSafely(this.observers, 'next', result);\n        }\n    };\n    ObservableQuery.prototype.reportError = function (error, variables) {\n        var errorResult = __assign(__assign({}, this.getLastResult()), { error: error, errors: error.graphQLErrors, networkStatus: NetworkStatus.error, loading: false });\n        this.updateLastResult(errorResult, variables);\n        iterateObserversSafely(this.observers, 'error', this.last.error = error);\n    };\n    ObservableQuery.prototype.hasObservers = function () {\n        return this.observers.size > 0;\n    };\n    ObservableQuery.prototype.tearDownQuery = function () {\n        if (this.isTornDown)\n            return;\n        if (this.concast && this.observer) {\n            this.concast.removeObserver(this.observer);\n            delete this.concast;\n            delete this.observer;\n        }\n        this.stopPolling();\n        this.subscriptions.forEach(function (sub) { return sub.unsubscribe(); });\n        this.subscriptions.clear();\n        this.queryManager.stopQuery(this.queryId);\n        this.observers.clear();\n        this.isTornDown = true;\n    };\n    return ObservableQuery;\n}(Observable));\nexport { ObservableQuery };\nfixObservableSubclass(ObservableQuery);\nfunction defaultSubscriptionObserverErrorCallback(error) {\n    __DEV__ && invariant.error('Unhandled error', error.message, error.stack);\n}\nexport function logMissingFieldErrors(missing) {\n    if (__DEV__ && isNonEmptyArray(missing)) {\n        __DEV__ && invariant.debug(\"Missing cache result fields: \" + missing.map(function (m) { return m.path.join('.'); }).join(', '), missing);\n    }\n}\nexport function applyNextFetchPolicy(options) {\n    var _a = options.fetchPolicy, fetchPolicy = _a === void 0 ? \"cache-first\" : _a, nextFetchPolicy = options.nextFetchPolicy;\n    if (nextFetchPolicy) {\n        options.fetchPolicy = typeof nextFetchPolicy === \"function\"\n            ? nextFetchPolicy.call(options, fetchPolicy)\n            : nextFetchPolicy;\n    }\n}\n//# sourceMappingURL=ObservableQuery.js.map","import { __assign, __spreadArray } from \"tslib\";\nimport { isNonNullObject } from \"./objects.js\";\nvar hasOwnProperty = Object.prototype.hasOwnProperty;\nexport function mergeDeep() {\n    var sources = [];\n    for (var _i = 0; _i < arguments.length; _i++) {\n        sources[_i] = arguments[_i];\n    }\n    return mergeDeepArray(sources);\n}\nexport function mergeDeepArray(sources) {\n    var target = sources[0] || {};\n    var count = sources.length;\n    if (count > 1) {\n        var merger = new DeepMerger();\n        for (var i = 1; i < count; ++i) {\n            target = merger.merge(target, sources[i]);\n        }\n    }\n    return target;\n}\nvar defaultReconciler = function (target, source, property) {\n    return this.merge(target[property], source[property]);\n};\nvar DeepMerger = (function () {\n    function DeepMerger(reconciler) {\n        if (reconciler === void 0) { reconciler = defaultReconciler; }\n        this.reconciler = reconciler;\n        this.isObject = isNonNullObject;\n        this.pastCopies = new Set();\n    }\n    DeepMerger.prototype.merge = function (target, source) {\n        var _this = this;\n        var context = [];\n        for (var _i = 2; _i < arguments.length; _i++) {\n            context[_i - 2] = arguments[_i];\n        }\n        if (isNonNullObject(source) && isNonNullObject(target)) {\n            Object.keys(source).forEach(function (sourceKey) {\n                if (hasOwnProperty.call(target, sourceKey)) {\n                    var targetValue = target[sourceKey];\n                    if (source[sourceKey] !== targetValue) {\n                        var result = _this.reconciler.apply(_this, __spreadArray([target, source, sourceKey], context, false));\n                        if (result !== targetValue) {\n                            target = _this.shallowCopyForMerge(target);\n                            target[sourceKey] = result;\n                        }\n                    }\n                }\n                else {\n                    target = _this.shallowCopyForMerge(target);\n                    target[sourceKey] = source[sourceKey];\n                }\n            });\n            return target;\n        }\n        return source;\n    };\n    DeepMerger.prototype.shallowCopyForMerge = function (value) {\n        if (isNonNullObject(value) && !this.pastCopies.has(value)) {\n            if (Array.isArray(value)) {\n                value = value.slice(0);\n            }\n            else {\n                value = __assign({ __proto__: Object.getPrototypeOf(value) }, value);\n            }\n            this.pastCopies.add(value);\n        }\n        return value;\n    };\n    return DeepMerger;\n}());\nexport { DeepMerger };\n//# sourceMappingURL=mergeDeep.js.map","// This currentContext variable will only be used if the makeSlotClass\r\n// function is called, which happens only if this is the first copy of the\r\n// @wry/context package to be imported.\r\nvar currentContext = null;\r\n// This unique internal object is used to denote the absence of a value\r\n// for a given Slot, and is never exposed to outside code.\r\nvar MISSING_VALUE = {};\r\nvar idCounter = 1;\r\n// Although we can't do anything about the cost of duplicated code from\r\n// accidentally bundling multiple copies of the @wry/context package, we can\r\n// avoid creating the Slot class more than once using makeSlotClass.\r\nvar makeSlotClass = function () { return /** @class */ (function () {\r\n    function Slot() {\r\n        // If you have a Slot object, you can find out its slot.id, but you cannot\r\n        // guess the slot.id of a Slot you don't have access to, thanks to the\r\n        // randomized suffix.\r\n        this.id = [\r\n            \"slot\",\r\n            idCounter++,\r\n            Date.now(),\r\n            Math.random().toString(36).slice(2),\r\n        ].join(\":\");\r\n    }\r\n    Slot.prototype.hasValue = function () {\r\n        for (var context_1 = currentContext; context_1; context_1 = context_1.parent) {\r\n            // We use the Slot object iself as a key to its value, which means the\r\n            // value cannot be obtained without a reference to the Slot object.\r\n            if (this.id in context_1.slots) {\r\n                var value = context_1.slots[this.id];\r\n                if (value === MISSING_VALUE)\r\n                    break;\r\n                if (context_1 !== currentContext) {\r\n                    // Cache the value in currentContext.slots so the next lookup will\r\n                    // be faster. This caching is safe because the tree of contexts and\r\n                    // the values of the slots are logically immutable.\r\n                    currentContext.slots[this.id] = value;\r\n                }\r\n                return true;\r\n            }\r\n        }\r\n        if (currentContext) {\r\n            // If a value was not found for this Slot, it's never going to be found\r\n            // no matter how many times we look it up, so we might as well cache\r\n            // the absence of the value, too.\r\n            currentContext.slots[this.id] = MISSING_VALUE;\r\n        }\r\n        return false;\r\n    };\r\n    Slot.prototype.getValue = function () {\r\n        if (this.hasValue()) {\r\n            return currentContext.slots[this.id];\r\n        }\r\n    };\r\n    Slot.prototype.withValue = function (value, callback, \r\n    // Given the prevalence of arrow functions, specifying arguments is likely\r\n    // to be much more common than specifying `this`, hence this ordering:\r\n    args, thisArg) {\r\n        var _a;\r\n        var slots = (_a = {\r\n                __proto__: null\r\n            },\r\n            _a[this.id] = value,\r\n            _a);\r\n        var parent = currentContext;\r\n        currentContext = { parent: parent, slots: slots };\r\n        try {\r\n            // Function.prototype.apply allows the arguments array argument to be\r\n            // omitted or undefined, so args! is fine here.\r\n            return callback.apply(thisArg, args);\r\n        }\r\n        finally {\r\n            currentContext = parent;\r\n        }\r\n    };\r\n    // Capture the current context and wrap a callback function so that it\r\n    // reestablishes the captured context when called.\r\n    Slot.bind = function (callback) {\r\n        var context = currentContext;\r\n        return function () {\r\n            var saved = currentContext;\r\n            try {\r\n                currentContext = context;\r\n                return callback.apply(this, arguments);\r\n            }\r\n            finally {\r\n                currentContext = saved;\r\n            }\r\n        };\r\n    };\r\n    // Immediately run a callback function without any captured context.\r\n    Slot.noContext = function (callback, \r\n    // Given the prevalence of arrow functions, specifying arguments is likely\r\n    // to be much more common than specifying `this`, hence this ordering:\r\n    args, thisArg) {\r\n        if (currentContext) {\r\n            var saved = currentContext;\r\n            try {\r\n                currentContext = null;\r\n                // Function.prototype.apply allows the arguments array argument to be\r\n                // omitted or undefined, so args! is fine here.\r\n                return callback.apply(thisArg, args);\r\n            }\r\n            finally {\r\n                currentContext = saved;\r\n            }\r\n        }\r\n        else {\r\n            return callback.apply(thisArg, args);\r\n        }\r\n    };\r\n    return Slot;\r\n}()); };\r\n// We store a single global implementation of the Slot class as a permanent\r\n// non-enumerable symbol property of the Array constructor. This obfuscation\r\n// does nothing to prevent access to the Slot class, but at least it ensures\r\n// the implementation (i.e. currentContext) cannot be tampered with, and all\r\n// copies of the @wry/context package (hopefully just one) will share the\r\n// same Slot implementation. Since the first copy of the @wry/context package\r\n// to be imported wins, this technique imposes a very high cost for any\r\n// future breaking changes to the Slot class.\r\nvar globalKey = \"@wry/context:Slot\";\r\nvar host = Array;\r\nvar Slot = host[globalKey] || function () {\r\n    var Slot = makeSlotClass();\r\n    try {\r\n        Object.defineProperty(host, globalKey, {\r\n            value: host[globalKey] = Slot,\r\n            enumerable: false,\r\n            writable: false,\r\n            configurable: false,\r\n        });\r\n    }\r\n    finally {\r\n        return Slot;\r\n    }\r\n}();\n\nvar bind = Slot.bind, noContext = Slot.noContext;\r\nfunction setTimeoutWithContext(callback, delay) {\r\n    return setTimeout(bind(callback), delay);\r\n}\r\n// Turn any generator function into an async function (using yield instead\r\n// of await), with context automatically preserved across yields.\r\nfunction asyncFromGen(genFn) {\r\n    return function () {\r\n        var gen = genFn.apply(this, arguments);\r\n        var boundNext = bind(gen.next);\r\n        var boundThrow = bind(gen.throw);\r\n        return new Promise(function (resolve, reject) {\r\n            function invoke(method, argument) {\r\n                try {\r\n                    var result = method.call(gen, argument);\r\n                }\r\n                catch (error) {\r\n                    return reject(error);\r\n                }\r\n                var next = result.done ? resolve : invokeNext;\r\n                if (isPromiseLike(result.value)) {\r\n                    result.value.then(next, result.done ? reject : invokeThrow);\r\n                }\r\n                else {\r\n                    next(result.value);\r\n                }\r\n            }\r\n            var invokeNext = function (value) { return invoke(boundNext, value); };\r\n            var invokeThrow = function (error) { return invoke(boundThrow, error); };\r\n            invokeNext();\r\n        });\r\n    };\r\n}\r\nfunction isPromiseLike(value) {\r\n    return value && typeof value.then === \"function\";\r\n}\r\n// If you use the fibers npm package to implement coroutines in Node.js,\r\n// you should call this function at least once to ensure context management\r\n// remains coherent across any yields.\r\nvar wrappedFibers = [];\r\nfunction wrapYieldingFiberMethods(Fiber) {\r\n    // There can be only one implementation of Fiber per process, so this array\r\n    // should never grow longer than one element.\r\n    if (wrappedFibers.indexOf(Fiber) < 0) {\r\n        var wrap = function (obj, method) {\r\n            var fn = obj[method];\r\n            obj[method] = function () {\r\n                return noContext(fn, arguments, this);\r\n            };\r\n        };\r\n        // These methods can yield, according to\r\n        // https://github.com/laverdet/node-fibers/blob/ddebed9b8ae3883e57f822e2108e6943e5c8d2a8/fibers.js#L97-L100\r\n        wrap(Fiber, \"yield\");\r\n        wrap(Fiber.prototype, \"run\");\r\n        wrap(Fiber.prototype, \"throwInto\");\r\n        wrappedFibers.push(Fiber);\r\n    }\r\n    return Fiber;\r\n}\n\nexport { Slot, asyncFromGen, bind, noContext, setTimeoutWithContext as setTimeout, wrapYieldingFiberMethods };\n//# sourceMappingURL=context.esm.js.map\n","import { Trie } from '@wry/trie';\nexport { Trie as KeyTrie } from '@wry/trie';\nimport { Slot } from '@wry/context';\nexport { asyncFromGen, bind as bindContext, noContext, setTimeout } from '@wry/context';\n\nfunction defaultDispose() { }\r\nvar Cache = /** @class */ (function () {\r\n    function Cache(max, dispose) {\r\n        if (max === void 0) { max = Infinity; }\r\n        if (dispose === void 0) { dispose = defaultDispose; }\r\n        this.max = max;\r\n        this.dispose = dispose;\r\n        this.map = new Map();\r\n        this.newest = null;\r\n        this.oldest = null;\r\n    }\r\n    Cache.prototype.has = function (key) {\r\n        return this.map.has(key);\r\n    };\r\n    Cache.prototype.get = function (key) {\r\n        var node = this.getNode(key);\r\n        return node && node.value;\r\n    };\r\n    Cache.prototype.getNode = function (key) {\r\n        var node = this.map.get(key);\r\n        if (node && node !== this.newest) {\r\n            var older = node.older, newer = node.newer;\r\n            if (newer) {\r\n                newer.older = older;\r\n            }\r\n            if (older) {\r\n                older.newer = newer;\r\n            }\r\n            node.older = this.newest;\r\n            node.older.newer = node;\r\n            node.newer = null;\r\n            this.newest = node;\r\n            if (node === this.oldest) {\r\n                this.oldest = newer;\r\n            }\r\n        }\r\n        return node;\r\n    };\r\n    Cache.prototype.set = function (key, value) {\r\n        var node = this.getNode(key);\r\n        if (node) {\r\n            return node.value = value;\r\n        }\r\n        node = {\r\n            key: key,\r\n            value: value,\r\n            newer: null,\r\n            older: this.newest\r\n        };\r\n        if (this.newest) {\r\n            this.newest.newer = node;\r\n        }\r\n        this.newest = node;\r\n        this.oldest = this.oldest || node;\r\n        this.map.set(key, node);\r\n        return node.value;\r\n    };\r\n    Cache.prototype.clean = function () {\r\n        while (this.oldest && this.map.size > this.max) {\r\n            this.delete(this.oldest.key);\r\n        }\r\n    };\r\n    Cache.prototype.delete = function (key) {\r\n        var node = this.map.get(key);\r\n        if (node) {\r\n            if (node === this.newest) {\r\n                this.newest = node.older;\r\n            }\r\n            if (node === this.oldest) {\r\n                this.oldest = node.newer;\r\n            }\r\n            if (node.newer) {\r\n                node.newer.older = node.older;\r\n            }\r\n            if (node.older) {\r\n                node.older.newer = node.newer;\r\n            }\r\n            this.map.delete(key);\r\n            this.dispose(node.value, key);\r\n            return true;\r\n        }\r\n        return false;\r\n    };\r\n    return Cache;\r\n}());\n\nvar parentEntrySlot = new Slot();\n\nvar _a;\r\nvar hasOwnProperty = Object.prototype.hasOwnProperty;\r\nvar \r\n// This Array.from polyfill is restricted to working with Set<any> for now,\r\n// but we can improve the polyfill and add other input types, as needed. Note\r\n// that this fallback implementation will only be used if the host environment\r\n// does not support a native Array.from function. In most modern JS runtimes,\r\n// the toArray function exported here will be === Array.from.\r\ntoArray = (_a = Array.from, _a === void 0 ? function (collection) {\r\n    var array = [];\r\n    collection.forEach(function (item) { return array.push(item); });\r\n    return array;\r\n} : _a);\r\nfunction maybeUnsubscribe(entryOrDep) {\r\n    var unsubscribe = entryOrDep.unsubscribe;\r\n    if (typeof unsubscribe === \"function\") {\r\n        entryOrDep.unsubscribe = void 0;\r\n        unsubscribe();\r\n    }\r\n}\n\nvar emptySetPool = [];\r\nvar POOL_TARGET_SIZE = 100;\r\n// Since this package might be used browsers, we should avoid using the\r\n// Node built-in assert module.\r\nfunction assert(condition, optionalMessage) {\r\n    if (!condition) {\r\n        throw new Error(optionalMessage || \"assertion failure\");\r\n    }\r\n}\r\nfunction valueIs(a, b) {\r\n    var len = a.length;\r\n    return (\r\n    // Unknown values are not equal to each other.\r\n    len > 0 &&\r\n        // Both values must be ordinary (or both exceptional) to be equal.\r\n        len === b.length &&\r\n        // The underlying value or exception must be the same.\r\n        a[len - 1] === b[len - 1]);\r\n}\r\nfunction valueGet(value) {\r\n    switch (value.length) {\r\n        case 0: throw new Error(\"unknown value\");\r\n        case 1: return value[0];\r\n        case 2: throw value[1];\r\n    }\r\n}\r\nfunction valueCopy(value) {\r\n    return value.slice(0);\r\n}\r\nvar Entry = /** @class */ (function () {\r\n    function Entry(fn) {\r\n        this.fn = fn;\r\n        this.parents = new Set();\r\n        this.childValues = new Map();\r\n        // When this Entry has children that are dirty, this property becomes\r\n        // a Set containing other Entry objects, borrowed from emptySetPool.\r\n        // When the set becomes empty, it gets recycled back to emptySetPool.\r\n        this.dirtyChildren = null;\r\n        this.dirty = true;\r\n        this.recomputing = false;\r\n        this.value = [];\r\n        this.deps = null;\r\n        ++Entry.count;\r\n    }\r\n    Entry.prototype.peek = function () {\r\n        if (this.value.length === 1 && !mightBeDirty(this)) {\r\n            rememberParent(this);\r\n            return this.value[0];\r\n        }\r\n    };\r\n    // This is the most important method of the Entry API, because it\r\n    // determines whether the cached this.value can be returned immediately,\r\n    // or must be recomputed. The overall performance of the caching system\r\n    // depends on the truth of the following observations: (1) this.dirty is\r\n    // usually false, (2) this.dirtyChildren is usually null/empty, and thus\r\n    // (3) valueGet(this.value) is usually returned without recomputation.\r\n    Entry.prototype.recompute = function (args) {\r\n        assert(!this.recomputing, \"already recomputing\");\r\n        rememberParent(this);\r\n        return mightBeDirty(this)\r\n            ? reallyRecompute(this, args)\r\n            : valueGet(this.value);\r\n    };\r\n    Entry.prototype.setDirty = function () {\r\n        if (this.dirty)\r\n            return;\r\n        this.dirty = true;\r\n        this.value.length = 0;\r\n        reportDirty(this);\r\n        // We can go ahead and unsubscribe here, since any further dirty\r\n        // notifications we receive will be redundant, and unsubscribing may\r\n        // free up some resources, e.g. file watchers.\r\n        maybeUnsubscribe(this);\r\n    };\r\n    Entry.prototype.dispose = function () {\r\n        var _this = this;\r\n        this.setDirty();\r\n        // Sever any dependency relationships with our own children, so those\r\n        // children don't retain this parent Entry in their child.parents sets,\r\n        // thereby preventing it from being fully garbage collected.\r\n        forgetChildren(this);\r\n        // Because this entry has been kicked out of the cache (in index.js),\r\n        // we've lost the ability to find out if/when this entry becomes dirty,\r\n        // whether that happens through a subscription, because of a direct call\r\n        // to entry.setDirty(), or because one of its children becomes dirty.\r\n        // Because of this loss of future information, we have to assume the\r\n        // worst (that this entry might have become dirty very soon), so we must\r\n        // immediately mark this entry's parents as dirty. Normally we could\r\n        // just call entry.setDirty() rather than calling parent.setDirty() for\r\n        // each parent, but that would leave this entry in parent.childValues\r\n        // and parent.dirtyChildren, which would prevent the child from being\r\n        // truly forgotten.\r\n        eachParent(this, function (parent, child) {\r\n            parent.setDirty();\r\n            forgetChild(parent, _this);\r\n        });\r\n    };\r\n    Entry.prototype.forget = function () {\r\n        // The code that creates Entry objects in index.ts will replace this method\r\n        // with one that actually removes the Entry from the cache, which will also\r\n        // trigger the entry.dispose method.\r\n        this.dispose();\r\n    };\r\n    Entry.prototype.dependOn = function (dep) {\r\n        dep.add(this);\r\n        if (!this.deps) {\r\n            this.deps = emptySetPool.pop() || new Set();\r\n        }\r\n        this.deps.add(dep);\r\n    };\r\n    Entry.prototype.forgetDeps = function () {\r\n        var _this = this;\r\n        if (this.deps) {\r\n            toArray(this.deps).forEach(function (dep) { return dep.delete(_this); });\r\n            this.deps.clear();\r\n            emptySetPool.push(this.deps);\r\n            this.deps = null;\r\n        }\r\n    };\r\n    Entry.count = 0;\r\n    return Entry;\r\n}());\r\nfunction rememberParent(child) {\r\n    var parent = parentEntrySlot.getValue();\r\n    if (parent) {\r\n        child.parents.add(parent);\r\n        if (!parent.childValues.has(child)) {\r\n            parent.childValues.set(child, []);\r\n        }\r\n        if (mightBeDirty(child)) {\r\n            reportDirtyChild(parent, child);\r\n        }\r\n        else {\r\n            reportCleanChild(parent, child);\r\n        }\r\n        return parent;\r\n    }\r\n}\r\nfunction reallyRecompute(entry, args) {\r\n    forgetChildren(entry);\r\n    // Set entry as the parent entry while calling recomputeNewValue(entry).\r\n    parentEntrySlot.withValue(entry, recomputeNewValue, [entry, args]);\r\n    if (maybeSubscribe(entry, args)) {\r\n        // If we successfully recomputed entry.value and did not fail to\r\n        // (re)subscribe, then this Entry is no longer explicitly dirty.\r\n        setClean(entry);\r\n    }\r\n    return valueGet(entry.value);\r\n}\r\nfunction recomputeNewValue(entry, args) {\r\n    entry.recomputing = true;\r\n    // Set entry.value as unknown.\r\n    entry.value.length = 0;\r\n    try {\r\n        // If entry.fn succeeds, entry.value will become a normal Value.\r\n        entry.value[0] = entry.fn.apply(null, args);\r\n    }\r\n    catch (e) {\r\n        // If entry.fn throws, entry.value will become exceptional.\r\n        entry.value[1] = e;\r\n    }\r\n    // Either way, this line is always reached.\r\n    entry.recomputing = false;\r\n}\r\nfunction mightBeDirty(entry) {\r\n    return entry.dirty || !!(entry.dirtyChildren && entry.dirtyChildren.size);\r\n}\r\nfunction setClean(entry) {\r\n    entry.dirty = false;\r\n    if (mightBeDirty(entry)) {\r\n        // This Entry may still have dirty children, in which case we can't\r\n        // let our parents know we're clean just yet.\r\n        return;\r\n    }\r\n    reportClean(entry);\r\n}\r\nfunction reportDirty(child) {\r\n    eachParent(child, reportDirtyChild);\r\n}\r\nfunction reportClean(child) {\r\n    eachParent(child, reportCleanChild);\r\n}\r\nfunction eachParent(child, callback) {\r\n    var parentCount = child.parents.size;\r\n    if (parentCount) {\r\n        var parents = toArray(child.parents);\r\n        for (var i = 0; i < parentCount; ++i) {\r\n            callback(parents[i], child);\r\n        }\r\n    }\r\n}\r\n// Let a parent Entry know that one of its children may be dirty.\r\nfunction reportDirtyChild(parent, child) {\r\n    // Must have called rememberParent(child) before calling\r\n    // reportDirtyChild(parent, child).\r\n    assert(parent.childValues.has(child));\r\n    assert(mightBeDirty(child));\r\n    var parentWasClean = !mightBeDirty(parent);\r\n    if (!parent.dirtyChildren) {\r\n        parent.dirtyChildren = emptySetPool.pop() || new Set;\r\n    }\r\n    else if (parent.dirtyChildren.has(child)) {\r\n        // If we already know this child is dirty, then we must have already\r\n        // informed our own parents that we are dirty, so we can terminate\r\n        // the recursion early.\r\n        return;\r\n    }\r\n    parent.dirtyChildren.add(child);\r\n    // If parent was clean before, it just became (possibly) dirty (according to\r\n    // mightBeDirty), since we just added child to parent.dirtyChildren.\r\n    if (parentWasClean) {\r\n        reportDirty(parent);\r\n    }\r\n}\r\n// Let a parent Entry know that one of its children is no longer dirty.\r\nfunction reportCleanChild(parent, child) {\r\n    // Must have called rememberChild(child) before calling\r\n    // reportCleanChild(parent, child).\r\n    assert(parent.childValues.has(child));\r\n    assert(!mightBeDirty(child));\r\n    var childValue = parent.childValues.get(child);\r\n    if (childValue.length === 0) {\r\n        parent.childValues.set(child, valueCopy(child.value));\r\n    }\r\n    else if (!valueIs(childValue, child.value)) {\r\n        parent.setDirty();\r\n    }\r\n    removeDirtyChild(parent, child);\r\n    if (mightBeDirty(parent)) {\r\n        return;\r\n    }\r\n    reportClean(parent);\r\n}\r\nfunction removeDirtyChild(parent, child) {\r\n    var dc = parent.dirtyChildren;\r\n    if (dc) {\r\n        dc.delete(child);\r\n        if (dc.size === 0) {\r\n            if (emptySetPool.length < POOL_TARGET_SIZE) {\r\n                emptySetPool.push(dc);\r\n            }\r\n            parent.dirtyChildren = null;\r\n        }\r\n    }\r\n}\r\n// Removes all children from this entry and returns an array of the\r\n// removed children.\r\nfunction forgetChildren(parent) {\r\n    if (parent.childValues.size > 0) {\r\n        parent.childValues.forEach(function (_value, child) {\r\n            forgetChild(parent, child);\r\n        });\r\n    }\r\n    // Remove this parent Entry from any sets to which it was added by the\r\n    // addToSet method.\r\n    parent.forgetDeps();\r\n    // After we forget all our children, this.dirtyChildren must be empty\r\n    // and therefore must have been reset to null.\r\n    assert(parent.dirtyChildren === null);\r\n}\r\nfunction forgetChild(parent, child) {\r\n    child.parents.delete(parent);\r\n    parent.childValues.delete(child);\r\n    removeDirtyChild(parent, child);\r\n}\r\nfunction maybeSubscribe(entry, args) {\r\n    if (typeof entry.subscribe === \"function\") {\r\n        try {\r\n            maybeUnsubscribe(entry); // Prevent double subscriptions.\r\n            entry.unsubscribe = entry.subscribe.apply(null, args);\r\n        }\r\n        catch (e) {\r\n            // If this Entry has a subscribe function and it threw an exception\r\n            // (or an unsubscribe function it previously returned now throws),\r\n            // return false to indicate that we were not able to subscribe (or\r\n            // unsubscribe), and this Entry should remain dirty.\r\n            entry.setDirty();\r\n            return false;\r\n        }\r\n    }\r\n    // Returning true indicates either that there was no entry.subscribe\r\n    // function or that it succeeded.\r\n    return true;\r\n}\n\nvar EntryMethods = {\r\n    setDirty: true,\r\n    dispose: true,\r\n    forget: true,\r\n};\r\nfunction dep(options) {\r\n    var depsByKey = new Map();\r\n    var subscribe = options && options.subscribe;\r\n    function depend(key) {\r\n        var parent = parentEntrySlot.getValue();\r\n        if (parent) {\r\n            var dep_1 = depsByKey.get(key);\r\n            if (!dep_1) {\r\n                depsByKey.set(key, dep_1 = new Set);\r\n            }\r\n            parent.dependOn(dep_1);\r\n            if (typeof subscribe === \"function\") {\r\n                maybeUnsubscribe(dep_1);\r\n                dep_1.unsubscribe = subscribe(key);\r\n            }\r\n        }\r\n    }\r\n    depend.dirty = function dirty(key, entryMethodName) {\r\n        var dep = depsByKey.get(key);\r\n        if (dep) {\r\n            var m_1 = (entryMethodName &&\r\n                hasOwnProperty.call(EntryMethods, entryMethodName)) ? entryMethodName : \"setDirty\";\r\n            // We have to use toArray(dep).forEach instead of dep.forEach, because\r\n            // modifying a Set while iterating over it can cause elements in the Set\r\n            // to be removed from the Set before they've been iterated over.\r\n            toArray(dep).forEach(function (entry) { return entry[m_1](); });\r\n            depsByKey.delete(key);\r\n            maybeUnsubscribe(dep);\r\n        }\r\n    };\r\n    return depend;\r\n}\n\nfunction makeDefaultMakeCacheKeyFunction() {\r\n    var keyTrie = new Trie(typeof WeakMap === \"function\");\r\n    return function () {\r\n        return keyTrie.lookupArray(arguments);\r\n    };\r\n}\r\n// The defaultMakeCacheKey function is remarkably powerful, because it gives\r\n// a unique object for any shallow-identical list of arguments. If you need\r\n// to implement a custom makeCacheKey function, you may find it helpful to\r\n// delegate the final work to defaultMakeCacheKey, which is why we export it\r\n// here. However, you may want to avoid defaultMakeCacheKey if your runtime\r\n// does not support WeakMap, or you have the ability to return a string key.\r\n// In those cases, just write your own custom makeCacheKey functions.\r\nvar defaultMakeCacheKey = makeDefaultMakeCacheKeyFunction();\r\nvar caches = new Set();\r\nfunction wrap(originalFunction, options) {\r\n    if (options === void 0) { options = Object.create(null); }\r\n    var cache = new Cache(options.max || Math.pow(2, 16), function (entry) { return entry.dispose(); });\r\n    var keyArgs = options.keyArgs;\r\n    var makeCacheKey = options.makeCacheKey ||\r\n        makeDefaultMakeCacheKeyFunction();\r\n    var optimistic = function () {\r\n        var key = makeCacheKey.apply(null, keyArgs ? keyArgs.apply(null, arguments) : arguments);\r\n        if (key === void 0) {\r\n            return originalFunction.apply(null, arguments);\r\n        }\r\n        var entry = cache.get(key);\r\n        if (!entry) {\r\n            cache.set(key, entry = new Entry(originalFunction));\r\n            entry.subscribe = options.subscribe;\r\n            // Give the Entry the ability to trigger cache.delete(key), even though\r\n            // the Entry itself does not know about key or cache.\r\n            entry.forget = function () { return cache.delete(key); };\r\n        }\r\n        var value = entry.recompute(Array.prototype.slice.call(arguments));\r\n        // Move this entry to the front of the least-recently used queue,\r\n        // since we just finished computing its value.\r\n        cache.set(key, entry);\r\n        caches.add(cache);\r\n        // Clean up any excess entries in the cache, but only if there is no\r\n        // active parent entry, meaning we're not in the middle of a larger\r\n        // computation that might be flummoxed by the cleaning.\r\n        if (!parentEntrySlot.hasValue()) {\r\n            caches.forEach(function (cache) { return cache.clean(); });\r\n            caches.clear();\r\n        }\r\n        return value;\r\n    };\r\n    Object.defineProperty(optimistic, \"size\", {\r\n        get: function () {\r\n            return cache[\"map\"].size;\r\n        },\r\n        configurable: false,\r\n        enumerable: false,\r\n    });\r\n    function dirtyKey(key) {\r\n        var entry = cache.get(key);\r\n        if (entry) {\r\n            entry.setDirty();\r\n        }\r\n    }\r\n    optimistic.dirtyKey = dirtyKey;\r\n    optimistic.dirty = function dirty() {\r\n        dirtyKey(makeCacheKey.apply(null, arguments));\r\n    };\r\n    function peekKey(key) {\r\n        var entry = cache.get(key);\r\n        if (entry) {\r\n            return entry.peek();\r\n        }\r\n    }\r\n    optimistic.peekKey = peekKey;\r\n    optimistic.peek = function peek() {\r\n        return peekKey(makeCacheKey.apply(null, arguments));\r\n    };\r\n    function forgetKey(key) {\r\n        return cache.delete(key);\r\n    }\r\n    optimistic.forgetKey = forgetKey;\r\n    optimistic.forget = function forget() {\r\n        return forgetKey(makeCacheKey.apply(null, arguments));\r\n    };\r\n    optimistic.makeCacheKey = makeCacheKey;\r\n    optimistic.getKey = keyArgs ? function getKey() {\r\n        return makeCacheKey.apply(null, keyArgs.apply(null, arguments));\r\n    } : makeCacheKey;\r\n    return Object.freeze(optimistic);\r\n}\n\nexport { defaultMakeCacheKey, dep, wrap };\n//# sourceMappingURL=bundle.esm.js.map\n","import { dep } from \"optimism\";\nimport { Slot } from \"@wry/context\";\nexport var cacheSlot = new Slot();\nvar cacheInfoMap = new WeakMap();\nfunction getCacheInfo(cache) {\n    var info = cacheInfoMap.get(cache);\n    if (!info) {\n        cacheInfoMap.set(cache, info = {\n            vars: new Set,\n            dep: dep(),\n        });\n    }\n    return info;\n}\nexport function forgetCache(cache) {\n    getCacheInfo(cache).vars.forEach(function (rv) { return rv.forgetCache(cache); });\n}\nexport function recallCache(cache) {\n    getCacheInfo(cache).vars.forEach(function (rv) { return rv.attachCache(cache); });\n}\nexport function makeVar(value) {\n    var caches = new Set();\n    var listeners = new Set();\n    var rv = function (newValue) {\n        if (arguments.length > 0) {\n            if (value !== newValue) {\n                value = newValue;\n                caches.forEach(function (cache) {\n                    getCacheInfo(cache).dep.dirty(rv);\n                    broadcast(cache);\n                });\n                var oldListeners = Array.from(listeners);\n                listeners.clear();\n                oldListeners.forEach(function (listener) { return listener(value); });\n            }\n        }\n        else {\n            var cache = cacheSlot.getValue();\n            if (cache) {\n                attach(cache);\n                getCacheInfo(cache).dep(rv);\n            }\n        }\n        return value;\n    };\n    rv.onNextChange = function (listener) {\n        listeners.add(listener);\n        return function () {\n            listeners.delete(listener);\n        };\n    };\n    var attach = rv.attachCache = function (cache) {\n        caches.add(cache);\n        getCacheInfo(cache).vars.add(rv);\n        return rv;\n    };\n    rv.forgetCache = function (cache) { return caches.delete(cache); };\n    return rv;\n}\nfunction broadcast(cache) {\n    if (cache.broadcastWatches) {\n        cache.broadcastWatches();\n    }\n}\n//# sourceMappingURL=reactiveVars.js.map","import { __assign, __awaiter, __generator } from \"tslib\";\nimport { invariant } from \"../utilities/globals/index.js\";\nimport { visit, BREAK, } from 'graphql';\nimport { argumentsObjectFromField, buildQueryFromSelectionSet, createFragmentMap, getFragmentDefinitions, getMainDefinition, hasDirectives, isField, isInlineFragment, mergeDeep, mergeDeepArray, removeClientSetsFromDocument, resultKeyNameFromField, shouldInclude, } from \"../utilities/index.js\";\nimport { cacheSlot } from \"../cache/index.js\";\nvar LocalState = (function () {\n    function LocalState(_a) {\n        var cache = _a.cache, client = _a.client, resolvers = _a.resolvers, fragmentMatcher = _a.fragmentMatcher;\n        this.cache = cache;\n        if (client) {\n            this.client = client;\n        }\n        if (resolvers) {\n            this.addResolvers(resolvers);\n        }\n        if (fragmentMatcher) {\n            this.setFragmentMatcher(fragmentMatcher);\n        }\n    }\n    LocalState.prototype.addResolvers = function (resolvers) {\n        var _this = this;\n        this.resolvers = this.resolvers || {};\n        if (Array.isArray(resolvers)) {\n            resolvers.forEach(function (resolverGroup) {\n                _this.resolvers = mergeDeep(_this.resolvers, resolverGroup);\n            });\n        }\n        else {\n            this.resolvers = mergeDeep(this.resolvers, resolvers);\n        }\n    };\n    LocalState.prototype.setResolvers = function (resolvers) {\n        this.resolvers = {};\n        this.addResolvers(resolvers);\n    };\n    LocalState.prototype.getResolvers = function () {\n        return this.resolvers || {};\n    };\n    LocalState.prototype.runResolvers = function (_a) {\n        var document = _a.document, remoteResult = _a.remoteResult, context = _a.context, variables = _a.variables, _b = _a.onlyRunForcedResolvers, onlyRunForcedResolvers = _b === void 0 ? false : _b;\n        return __awaiter(this, void 0, void 0, function () {\n            return __generator(this, function (_c) {\n                if (document) {\n                    return [2, this.resolveDocument(document, remoteResult.data, context, variables, this.fragmentMatcher, onlyRunForcedResolvers).then(function (localResult) { return (__assign(__assign({}, remoteResult), { data: localResult.result })); })];\n                }\n                return [2, remoteResult];\n            });\n        });\n    };\n    LocalState.prototype.setFragmentMatcher = function (fragmentMatcher) {\n        this.fragmentMatcher = fragmentMatcher;\n    };\n    LocalState.prototype.getFragmentMatcher = function () {\n        return this.fragmentMatcher;\n    };\n    LocalState.prototype.clientQuery = function (document) {\n        if (hasDirectives(['client'], document)) {\n            if (this.resolvers) {\n                return document;\n            }\n        }\n        return null;\n    };\n    LocalState.prototype.serverQuery = function (document) {\n        return removeClientSetsFromDocument(document);\n    };\n    LocalState.prototype.prepareContext = function (context) {\n        var cache = this.cache;\n        return __assign(__assign({}, context), { cache: cache, getCacheKey: function (obj) {\n                return cache.identify(obj);\n            } });\n    };\n    LocalState.prototype.addExportedVariables = function (document, variables, context) {\n        if (variables === void 0) { variables = {}; }\n        if (context === void 0) { context = {}; }\n        return __awaiter(this, void 0, void 0, function () {\n            return __generator(this, function (_a) {\n                if (document) {\n                    return [2, this.resolveDocument(document, this.buildRootValueFromCache(document, variables) || {}, this.prepareContext(context), variables).then(function (data) { return (__assign(__assign({}, variables), data.exportedVariables)); })];\n                }\n                return [2, __assign({}, variables)];\n            });\n        });\n    };\n    LocalState.prototype.shouldForceResolvers = function (document) {\n        var forceResolvers = false;\n        visit(document, {\n            Directive: {\n                enter: function (node) {\n                    if (node.name.value === 'client' && node.arguments) {\n                        forceResolvers = node.arguments.some(function (arg) {\n                            return arg.name.value === 'always' &&\n                                arg.value.kind === 'BooleanValue' &&\n                                arg.value.value === true;\n                        });\n                        if (forceResolvers) {\n                            return BREAK;\n                        }\n                    }\n                },\n            },\n        });\n        return forceResolvers;\n    };\n    LocalState.prototype.buildRootValueFromCache = function (document, variables) {\n        return this.cache.diff({\n            query: buildQueryFromSelectionSet(document),\n            variables: variables,\n            returnPartialData: true,\n            optimistic: false,\n        }).result;\n    };\n    LocalState.prototype.resolveDocument = function (document, rootValue, context, variables, fragmentMatcher, onlyRunForcedResolvers) {\n        if (context === void 0) { context = {}; }\n        if (variables === void 0) { variables = {}; }\n        if (fragmentMatcher === void 0) { fragmentMatcher = function () { return true; }; }\n        if (onlyRunForcedResolvers === void 0) { onlyRunForcedResolvers = false; }\n        return __awaiter(this, void 0, void 0, function () {\n            var mainDefinition, fragments, fragmentMap, definitionOperation, defaultOperationType, _a, cache, client, execContext;\n            return __generator(this, function (_b) {\n                mainDefinition = getMainDefinition(document);\n                fragments = getFragmentDefinitions(document);\n                fragmentMap = createFragmentMap(fragments);\n                definitionOperation = mainDefinition\n                    .operation;\n                defaultOperationType = definitionOperation\n                    ? definitionOperation.charAt(0).toUpperCase() +\n                        definitionOperation.slice(1)\n                    : 'Query';\n                _a = this, cache = _a.cache, client = _a.client;\n                execContext = {\n                    fragmentMap: fragmentMap,\n                    context: __assign(__assign({}, context), { cache: cache, client: client }),\n                    variables: variables,\n                    fragmentMatcher: fragmentMatcher,\n                    defaultOperationType: defaultOperationType,\n                    exportedVariables: {},\n                    onlyRunForcedResolvers: onlyRunForcedResolvers,\n                };\n                return [2, this.resolveSelectionSet(mainDefinition.selectionSet, rootValue, execContext).then(function (result) { return ({\n                        result: result,\n                        exportedVariables: execContext.exportedVariables,\n                    }); })];\n            });\n        });\n    };\n    LocalState.prototype.resolveSelectionSet = function (selectionSet, rootValue, execContext) {\n        return __awaiter(this, void 0, void 0, function () {\n            var fragmentMap, context, variables, resultsToMerge, execute;\n            var _this = this;\n            return __generator(this, function (_a) {\n                fragmentMap = execContext.fragmentMap, context = execContext.context, variables = execContext.variables;\n                resultsToMerge = [rootValue];\n                execute = function (selection) { return __awaiter(_this, void 0, void 0, function () {\n                    var fragment, typeCondition;\n                    return __generator(this, function (_a) {\n                        if (!shouldInclude(selection, variables)) {\n                            return [2];\n                        }\n                        if (isField(selection)) {\n                            return [2, this.resolveField(selection, rootValue, execContext).then(function (fieldResult) {\n                                    var _a;\n                                    if (typeof fieldResult !== 'undefined') {\n                                        resultsToMerge.push((_a = {},\n                                            _a[resultKeyNameFromField(selection)] = fieldResult,\n                                            _a));\n                                    }\n                                })];\n                        }\n                        if (isInlineFragment(selection)) {\n                            fragment = selection;\n                        }\n                        else {\n                            fragment = fragmentMap[selection.name.value];\n                            __DEV__ ? invariant(fragment, \"No fragment named \" + selection.name.value) : invariant(fragment, 11);\n                        }\n                        if (fragment && fragment.typeCondition) {\n                            typeCondition = fragment.typeCondition.name.value;\n                            if (execContext.fragmentMatcher(rootValue, typeCondition, context)) {\n                                return [2, this.resolveSelectionSet(fragment.selectionSet, rootValue, execContext).then(function (fragmentResult) {\n                                        resultsToMerge.push(fragmentResult);\n                                    })];\n                            }\n                        }\n                        return [2];\n                    });\n                }); };\n                return [2, Promise.all(selectionSet.selections.map(execute)).then(function () {\n                        return mergeDeepArray(resultsToMerge);\n                    })];\n            });\n        });\n    };\n    LocalState.prototype.resolveField = function (field, rootValue, execContext) {\n        return __awaiter(this, void 0, void 0, function () {\n            var variables, fieldName, aliasedFieldName, aliasUsed, defaultResult, resultPromise, resolverType, resolverMap, resolve;\n            var _this = this;\n            return __generator(this, function (_a) {\n                variables = execContext.variables;\n                fieldName = field.name.value;\n                aliasedFieldName = resultKeyNameFromField(field);\n                aliasUsed = fieldName !== aliasedFieldName;\n                defaultResult = rootValue[aliasedFieldName] || rootValue[fieldName];\n                resultPromise = Promise.resolve(defaultResult);\n                if (!execContext.onlyRunForcedResolvers ||\n                    this.shouldForceResolvers(field)) {\n                    resolverType = rootValue.__typename || execContext.defaultOperationType;\n                    resolverMap = this.resolvers && this.resolvers[resolverType];\n                    if (resolverMap) {\n                        resolve = resolverMap[aliasUsed ? fieldName : aliasedFieldName];\n                        if (resolve) {\n                            resultPromise = Promise.resolve(cacheSlot.withValue(this.cache, resolve, [\n                                rootValue,\n                                argumentsObjectFromField(field, variables),\n                                execContext.context,\n                                { field: field, fragmentMap: execContext.fragmentMap },\n                            ]));\n                        }\n                    }\n                }\n                return [2, resultPromise.then(function (result) {\n                        if (result === void 0) { result = defaultResult; }\n                        if (field.directives) {\n                            field.directives.forEach(function (directive) {\n                                if (directive.name.value === 'export' && directive.arguments) {\n                                    directive.arguments.forEach(function (arg) {\n                                        if (arg.name.value === 'as' && arg.value.kind === 'StringValue') {\n                                            execContext.exportedVariables[arg.value.value] = result;\n                                        }\n                                    });\n                                }\n                            });\n                        }\n                        if (!field.selectionSet) {\n                            return result;\n                        }\n                        if (result == null) {\n                            return result;\n                        }\n                        if (Array.isArray(result)) {\n                            return _this.resolveSubSelectedArray(field, result, execContext);\n                        }\n                        if (field.selectionSet) {\n                            return _this.resolveSelectionSet(field.selectionSet, result, execContext);\n                        }\n                    })];\n            });\n        });\n    };\n    LocalState.prototype.resolveSubSelectedArray = function (field, result, execContext) {\n        var _this = this;\n        return Promise.all(result.map(function (item) {\n            if (item === null) {\n                return null;\n            }\n            if (Array.isArray(item)) {\n                return _this.resolveSubSelectedArray(field, item, execContext);\n            }\n            if (field.selectionSet) {\n                return _this.resolveSelectionSet(field.selectionSet, item, execContext);\n            }\n        }));\n    };\n    return LocalState;\n}());\nexport { LocalState };\n//# sourceMappingURL=LocalState.js.map","import { __assign } from \"tslib\";\nimport { equal } from \"@wry/equality\";\nimport { isNonEmptyArray, graphQLResultHasError, canUseWeakMap, } from \"../utilities/index.js\";\nimport { NetworkStatus, isNetworkRequestInFlight, } from \"./networkStatus.js\";\n;\nvar destructiveMethodCounts = new (canUseWeakMap ? WeakMap : Map)();\nfunction wrapDestructiveCacheMethod(cache, methodName) {\n    var original = cache[methodName];\n    if (typeof original === \"function\") {\n        cache[methodName] = function () {\n            destructiveMethodCounts.set(cache, (destructiveMethodCounts.get(cache) + 1) % 1e15);\n            return original.apply(this, arguments);\n        };\n    }\n}\nfunction cancelNotifyTimeout(info) {\n    if (info[\"notifyTimeout\"]) {\n        clearTimeout(info[\"notifyTimeout\"]);\n        info[\"notifyTimeout\"] = void 0;\n    }\n}\nvar QueryInfo = (function () {\n    function QueryInfo(queryManager, queryId) {\n        if (queryId === void 0) { queryId = queryManager.generateQueryId(); }\n        this.queryId = queryId;\n        this.listeners = new Set();\n        this.document = null;\n        this.lastRequestId = 1;\n        this.subscriptions = new Set();\n        this.stopped = false;\n        this.dirty = false;\n        this.observableQuery = null;\n        var cache = this.cache = queryManager.cache;\n        if (!destructiveMethodCounts.has(cache)) {\n            destructiveMethodCounts.set(cache, 0);\n            wrapDestructiveCacheMethod(cache, \"evict\");\n            wrapDestructiveCacheMethod(cache, \"modify\");\n            wrapDestructiveCacheMethod(cache, \"reset\");\n        }\n    }\n    QueryInfo.prototype.init = function (query) {\n        var networkStatus = query.networkStatus || NetworkStatus.loading;\n        if (this.variables &&\n            this.networkStatus !== NetworkStatus.loading &&\n            !equal(this.variables, query.variables)) {\n            networkStatus = NetworkStatus.setVariables;\n        }\n        if (!equal(query.variables, this.variables)) {\n            this.lastDiff = void 0;\n        }\n        Object.assign(this, {\n            document: query.document,\n            variables: query.variables,\n            networkError: null,\n            graphQLErrors: this.graphQLErrors || [],\n            networkStatus: networkStatus,\n        });\n        if (query.observableQuery) {\n            this.setObservableQuery(query.observableQuery);\n        }\n        if (query.lastRequestId) {\n            this.lastRequestId = query.lastRequestId;\n        }\n        return this;\n    };\n    QueryInfo.prototype.reset = function () {\n        cancelNotifyTimeout(this);\n        this.lastDiff = void 0;\n        this.dirty = false;\n    };\n    QueryInfo.prototype.getDiff = function (variables) {\n        if (variables === void 0) { variables = this.variables; }\n        var options = this.getDiffOptions(variables);\n        if (this.lastDiff && equal(options, this.lastDiff.options)) {\n            return this.lastDiff.diff;\n        }\n        this.updateWatch(this.variables = variables);\n        var oq = this.observableQuery;\n        if (oq && oq.options.fetchPolicy === \"no-cache\") {\n            return { complete: false };\n        }\n        var diff = this.cache.diff(options);\n        this.updateLastDiff(diff, options);\n        return diff;\n    };\n    QueryInfo.prototype.updateLastDiff = function (diff, options) {\n        this.lastDiff = diff ? {\n            diff: diff,\n            options: options || this.getDiffOptions(),\n        } : void 0;\n    };\n    QueryInfo.prototype.getDiffOptions = function (variables) {\n        var _a;\n        if (variables === void 0) { variables = this.variables; }\n        return {\n            query: this.document,\n            variables: variables,\n            returnPartialData: true,\n            optimistic: true,\n            canonizeResults: (_a = this.observableQuery) === null || _a === void 0 ? void 0 : _a.options.canonizeResults,\n        };\n    };\n    QueryInfo.prototype.setDiff = function (diff) {\n        var _this = this;\n        var oldDiff = this.lastDiff && this.lastDiff.diff;\n        this.updateLastDiff(diff);\n        if (!this.dirty &&\n            !equal(oldDiff && oldDiff.result, diff && diff.result)) {\n            this.dirty = true;\n            if (!this.notifyTimeout) {\n                this.notifyTimeout = setTimeout(function () { return _this.notify(); }, 0);\n            }\n        }\n    };\n    QueryInfo.prototype.setObservableQuery = function (oq) {\n        var _this = this;\n        if (oq === this.observableQuery)\n            return;\n        if (this.oqListener) {\n            this.listeners.delete(this.oqListener);\n        }\n        this.observableQuery = oq;\n        if (oq) {\n            oq[\"queryInfo\"] = this;\n            this.listeners.add(this.oqListener = function () {\n                if (_this.getDiff().fromOptimisticTransaction) {\n                    oq[\"observe\"]();\n                }\n                else {\n                    oq.reobserve();\n                }\n            });\n        }\n        else {\n            delete this.oqListener;\n        }\n    };\n    QueryInfo.prototype.notify = function () {\n        var _this = this;\n        cancelNotifyTimeout(this);\n        if (this.shouldNotify()) {\n            this.listeners.forEach(function (listener) { return listener(_this); });\n        }\n        this.dirty = false;\n    };\n    QueryInfo.prototype.shouldNotify = function () {\n        if (!this.dirty || !this.listeners.size) {\n            return false;\n        }\n        if (isNetworkRequestInFlight(this.networkStatus) &&\n            this.observableQuery) {\n            var fetchPolicy = this.observableQuery.options.fetchPolicy;\n            if (fetchPolicy !== \"cache-only\" &&\n                fetchPolicy !== \"cache-and-network\") {\n                return false;\n            }\n        }\n        return true;\n    };\n    QueryInfo.prototype.stop = function () {\n        if (!this.stopped) {\n            this.stopped = true;\n            this.reset();\n            this.cancel();\n            this.cancel = QueryInfo.prototype.cancel;\n            this.subscriptions.forEach(function (sub) { return sub.unsubscribe(); });\n            var oq = this.observableQuery;\n            if (oq)\n                oq.stopPolling();\n        }\n    };\n    QueryInfo.prototype.cancel = function () { };\n    QueryInfo.prototype.updateWatch = function (variables) {\n        var _this = this;\n        if (variables === void 0) { variables = this.variables; }\n        var oq = this.observableQuery;\n        if (oq && oq.options.fetchPolicy === \"no-cache\") {\n            return;\n        }\n        var watchOptions = __assign(__assign({}, this.getDiffOptions(variables)), { watcher: this, callback: function (diff) { return _this.setDiff(diff); } });\n        if (!this.lastWatch ||\n            !equal(watchOptions, this.lastWatch)) {\n            this.cancel();\n            this.cancel = this.cache.watch(this.lastWatch = watchOptions);\n        }\n    };\n    QueryInfo.prototype.resetLastWrite = function () {\n        this.lastWrite = void 0;\n    };\n    QueryInfo.prototype.shouldWrite = function (result, variables) {\n        var lastWrite = this.lastWrite;\n        return !(lastWrite &&\n            lastWrite.dmCount === destructiveMethodCounts.get(this.cache) &&\n            equal(variables, lastWrite.variables) &&\n            equal(result.data, lastWrite.result.data));\n    };\n    QueryInfo.prototype.markResult = function (result, options, cacheWriteBehavior) {\n        var _this = this;\n        this.graphQLErrors = isNonEmptyArray(result.errors) ? result.errors : [];\n        this.reset();\n        if (options.fetchPolicy === 'no-cache') {\n            this.updateLastDiff({ result: result.data, complete: true }, this.getDiffOptions(options.variables));\n        }\n        else if (cacheWriteBehavior !== 0) {\n            if (shouldWriteResult(result, options.errorPolicy)) {\n                this.cache.performTransaction(function (cache) {\n                    if (_this.shouldWrite(result, options.variables)) {\n                        cache.writeQuery({\n                            query: _this.document,\n                            data: result.data,\n                            variables: options.variables,\n                            overwrite: cacheWriteBehavior === 1,\n                        });\n                        _this.lastWrite = {\n                            result: result,\n                            variables: options.variables,\n                            dmCount: destructiveMethodCounts.get(_this.cache),\n                        };\n                    }\n                    else {\n                        if (_this.lastDiff &&\n                            _this.lastDiff.diff.complete) {\n                            result.data = _this.lastDiff.diff.result;\n                            return;\n                        }\n                    }\n                    var diffOptions = _this.getDiffOptions(options.variables);\n                    var diff = cache.diff(diffOptions);\n                    if (!_this.stopped) {\n                        _this.updateWatch(options.variables);\n                    }\n                    _this.updateLastDiff(diff, diffOptions);\n                    if (diff.complete) {\n                        result.data = diff.result;\n                    }\n                });\n            }\n            else {\n                this.lastWrite = void 0;\n            }\n        }\n    };\n    QueryInfo.prototype.markReady = function () {\n        this.networkError = null;\n        return this.networkStatus = NetworkStatus.ready;\n    };\n    QueryInfo.prototype.markError = function (error) {\n        this.networkStatus = NetworkStatus.error;\n        this.lastWrite = void 0;\n        this.reset();\n        if (error.graphQLErrors) {\n            this.graphQLErrors = error.graphQLErrors;\n        }\n        if (error.networkError) {\n            this.networkError = error.networkError;\n        }\n        return error;\n    };\n    return QueryInfo;\n}());\nexport { QueryInfo };\nexport function shouldWriteResult(result, errorPolicy) {\n    if (errorPolicy === void 0) { errorPolicy = \"none\"; }\n    var ignoreErrors = errorPolicy === \"ignore\" ||\n        errorPolicy === \"all\";\n    var writeWithErrors = !graphQLResultHasError(result);\n    if (!writeWithErrors && ignoreErrors && result.data) {\n        writeWithErrors = true;\n    }\n    return writeWithErrors;\n}\n//# sourceMappingURL=QueryInfo.js.map","import { __assign, __awaiter, __generator } from \"tslib\";\nimport { invariant, InvariantError } from \"../utilities/globals/index.js\";\nimport { equal } from '@wry/equality';\nimport { execute } from \"../link/core/index.js\";\nimport { canonicalStringify } from \"../cache/index.js\";\nimport { getDefaultValues, getOperationDefinition, getOperationName, hasClientExports, graphQLResultHasError, removeConnectionDirectiveFromDocument, canUseWeakMap, Observable, asyncMap, isNonEmptyArray, Concast, makeUniqueId, isDocumentNode, isNonNullObject, } from \"../utilities/index.js\";\nimport { ApolloError, isApolloError } from \"../errors/index.js\";\nimport { ObservableQuery, applyNextFetchPolicy, logMissingFieldErrors } from \"./ObservableQuery.js\";\nimport { NetworkStatus, isNetworkRequestInFlight } from \"./networkStatus.js\";\nimport { LocalState } from \"./LocalState.js\";\nimport { QueryInfo, shouldWriteResult, } from \"./QueryInfo.js\";\nvar hasOwnProperty = Object.prototype.hasOwnProperty;\nvar QueryManager = (function () {\n    function QueryManager(_a) {\n        var cache = _a.cache, link = _a.link, _b = _a.queryDeduplication, queryDeduplication = _b === void 0 ? false : _b, onBroadcast = _a.onBroadcast, _c = _a.ssrMode, ssrMode = _c === void 0 ? false : _c, _d = _a.clientAwareness, clientAwareness = _d === void 0 ? {} : _d, localState = _a.localState, assumeImmutableResults = _a.assumeImmutableResults;\n        this.clientAwareness = {};\n        this.queries = new Map();\n        this.fetchCancelFns = new Map();\n        this.transformCache = new (canUseWeakMap ? WeakMap : Map)();\n        this.queryIdCounter = 1;\n        this.requestIdCounter = 1;\n        this.mutationIdCounter = 1;\n        this.inFlightLinkObservables = new Map();\n        this.cache = cache;\n        this.link = link;\n        this.queryDeduplication = queryDeduplication;\n        this.clientAwareness = clientAwareness;\n        this.localState = localState || new LocalState({ cache: cache });\n        this.ssrMode = ssrMode;\n        this.assumeImmutableResults = !!assumeImmutableResults;\n        if ((this.onBroadcast = onBroadcast)) {\n            this.mutationStore = Object.create(null);\n        }\n    }\n    QueryManager.prototype.stop = function () {\n        var _this = this;\n        this.queries.forEach(function (_info, queryId) {\n            _this.stopQueryNoBroadcast(queryId);\n        });\n        this.cancelPendingFetches(__DEV__ ? new InvariantError('QueryManager stopped while query was in flight') : new InvariantError(13));\n    };\n    QueryManager.prototype.cancelPendingFetches = function (error) {\n        this.fetchCancelFns.forEach(function (cancel) { return cancel(error); });\n        this.fetchCancelFns.clear();\n    };\n    QueryManager.prototype.mutate = function (_a) {\n        var mutation = _a.mutation, variables = _a.variables, optimisticResponse = _a.optimisticResponse, updateQueries = _a.updateQueries, _b = _a.refetchQueries, refetchQueries = _b === void 0 ? [] : _b, _c = _a.awaitRefetchQueries, awaitRefetchQueries = _c === void 0 ? false : _c, updateWithProxyFn = _a.update, onQueryUpdated = _a.onQueryUpdated, _d = _a.errorPolicy, errorPolicy = _d === void 0 ? 'none' : _d, _e = _a.fetchPolicy, fetchPolicy = _e === void 0 ? 'network-only' : _e, keepRootFields = _a.keepRootFields, context = _a.context;\n        return __awaiter(this, void 0, void 0, function () {\n            var mutationId, mutationStoreValue, self;\n            return __generator(this, function (_f) {\n                switch (_f.label) {\n                    case 0:\n                        __DEV__ ? invariant(mutation, 'mutation option is required. You must specify your GraphQL document in the mutation option.') : invariant(mutation, 14);\n                        __DEV__ ? invariant(fetchPolicy === 'network-only' ||\n                            fetchPolicy === 'no-cache', \"Mutations support only 'network-only' or 'no-cache' fetchPolicy strings. The default `network-only` behavior automatically writes mutation results to the cache. Passing `no-cache` skips the cache write.\") : invariant(fetchPolicy === 'network-only' ||\n                            fetchPolicy === 'no-cache', 15);\n                        mutationId = this.generateMutationId();\n                        mutation = this.transform(mutation).document;\n                        variables = this.getVariables(mutation, variables);\n                        if (!this.transform(mutation).hasClientExports) return [3, 2];\n                        return [4, this.localState.addExportedVariables(mutation, variables, context)];\n                    case 1:\n                        variables = (_f.sent());\n                        _f.label = 2;\n                    case 2:\n                        mutationStoreValue = this.mutationStore &&\n                            (this.mutationStore[mutationId] = {\n                                mutation: mutation,\n                                variables: variables,\n                                loading: true,\n                                error: null,\n                            });\n                        if (optimisticResponse) {\n                            this.markMutationOptimistic(optimisticResponse, {\n                                mutationId: mutationId,\n                                document: mutation,\n                                variables: variables,\n                                fetchPolicy: fetchPolicy,\n                                errorPolicy: errorPolicy,\n                                context: context,\n                                updateQueries: updateQueries,\n                                update: updateWithProxyFn,\n                                keepRootFields: keepRootFields,\n                            });\n                        }\n                        this.broadcastQueries();\n                        self = this;\n                        return [2, new Promise(function (resolve, reject) {\n                                return asyncMap(self.getObservableFromLink(mutation, __assign(__assign({}, context), { optimisticResponse: optimisticResponse }), variables, false), function (result) {\n                                    if (graphQLResultHasError(result) && errorPolicy === 'none') {\n                                        throw new ApolloError({\n                                            graphQLErrors: result.errors,\n                                        });\n                                    }\n                                    if (mutationStoreValue) {\n                                        mutationStoreValue.loading = false;\n                                        mutationStoreValue.error = null;\n                                    }\n                                    var storeResult = __assign({}, result);\n                                    if (typeof refetchQueries === \"function\") {\n                                        refetchQueries = refetchQueries(storeResult);\n                                    }\n                                    if (errorPolicy === 'ignore' &&\n                                        graphQLResultHasError(storeResult)) {\n                                        delete storeResult.errors;\n                                    }\n                                    return self.markMutationResult({\n                                        mutationId: mutationId,\n                                        result: storeResult,\n                                        document: mutation,\n                                        variables: variables,\n                                        fetchPolicy: fetchPolicy,\n                                        errorPolicy: errorPolicy,\n                                        context: context,\n                                        update: updateWithProxyFn,\n                                        updateQueries: updateQueries,\n                                        awaitRefetchQueries: awaitRefetchQueries,\n                                        refetchQueries: refetchQueries,\n                                        removeOptimistic: optimisticResponse ? mutationId : void 0,\n                                        onQueryUpdated: onQueryUpdated,\n                                        keepRootFields: keepRootFields,\n                                    });\n                                }).subscribe({\n                                    next: function (storeResult) {\n                                        self.broadcastQueries();\n                                        resolve(storeResult);\n                                    },\n                                    error: function (err) {\n                                        if (mutationStoreValue) {\n                                            mutationStoreValue.loading = false;\n                                            mutationStoreValue.error = err;\n                                        }\n                                        if (optimisticResponse) {\n                                            self.cache.removeOptimistic(mutationId);\n                                        }\n                                        self.broadcastQueries();\n                                        reject(err instanceof ApolloError ? err : new ApolloError({\n                                            networkError: err,\n                                        }));\n                                    },\n                                });\n                            })];\n                }\n            });\n        });\n    };\n    QueryManager.prototype.markMutationResult = function (mutation, cache) {\n        var _this = this;\n        if (cache === void 0) { cache = this.cache; }\n        var result = mutation.result;\n        var cacheWrites = [];\n        var skipCache = mutation.fetchPolicy === \"no-cache\";\n        if (!skipCache && shouldWriteResult(result, mutation.errorPolicy)) {\n            cacheWrites.push({\n                result: result.data,\n                dataId: 'ROOT_MUTATION',\n                query: mutation.document,\n                variables: mutation.variables,\n            });\n            var updateQueries_1 = mutation.updateQueries;\n            if (updateQueries_1) {\n                this.queries.forEach(function (_a, queryId) {\n                    var observableQuery = _a.observableQuery;\n                    var queryName = observableQuery && observableQuery.queryName;\n                    if (!queryName || !hasOwnProperty.call(updateQueries_1, queryName)) {\n                        return;\n                    }\n                    var updater = updateQueries_1[queryName];\n                    var _b = _this.queries.get(queryId), document = _b.document, variables = _b.variables;\n                    var _c = cache.diff({\n                        query: document,\n                        variables: variables,\n                        returnPartialData: true,\n                        optimistic: false,\n                    }), currentQueryResult = _c.result, complete = _c.complete;\n                    if (complete && currentQueryResult) {\n                        var nextQueryResult = updater(currentQueryResult, {\n                            mutationResult: result,\n                            queryName: document && getOperationName(document) || void 0,\n                            queryVariables: variables,\n                        });\n                        if (nextQueryResult) {\n                            cacheWrites.push({\n                                result: nextQueryResult,\n                                dataId: 'ROOT_QUERY',\n                                query: document,\n                                variables: variables,\n                            });\n                        }\n                    }\n                });\n            }\n        }\n        if (cacheWrites.length > 0 ||\n            mutation.refetchQueries ||\n            mutation.update ||\n            mutation.onQueryUpdated ||\n            mutation.removeOptimistic) {\n            var results_1 = [];\n            this.refetchQueries({\n                updateCache: function (cache) {\n                    if (!skipCache) {\n                        cacheWrites.forEach(function (write) { return cache.write(write); });\n                    }\n                    var update = mutation.update;\n                    if (update) {\n                        if (!skipCache) {\n                            var diff = cache.diff({\n                                id: \"ROOT_MUTATION\",\n                                query: _this.transform(mutation.document).asQuery,\n                                variables: mutation.variables,\n                                optimistic: false,\n                                returnPartialData: true,\n                            });\n                            if (diff.complete) {\n                                result = __assign(__assign({}, result), { data: diff.result });\n                            }\n                        }\n                        update(cache, result, {\n                            context: mutation.context,\n                            variables: mutation.variables,\n                        });\n                    }\n                    if (!skipCache && !mutation.keepRootFields) {\n                        cache.modify({\n                            id: 'ROOT_MUTATION',\n                            fields: function (value, _a) {\n                                var fieldName = _a.fieldName, DELETE = _a.DELETE;\n                                return fieldName === \"__typename\" ? value : DELETE;\n                            },\n                        });\n                    }\n                },\n                include: mutation.refetchQueries,\n                optimistic: false,\n                removeOptimistic: mutation.removeOptimistic,\n                onQueryUpdated: mutation.onQueryUpdated || null,\n            }).forEach(function (result) { return results_1.push(result); });\n            if (mutation.awaitRefetchQueries || mutation.onQueryUpdated) {\n                return Promise.all(results_1).then(function () { return result; });\n            }\n        }\n        return Promise.resolve(result);\n    };\n    QueryManager.prototype.markMutationOptimistic = function (optimisticResponse, mutation) {\n        var _this = this;\n        var data = typeof optimisticResponse === \"function\"\n            ? optimisticResponse(mutation.variables)\n            : optimisticResponse;\n        return this.cache.recordOptimisticTransaction(function (cache) {\n            try {\n                _this.markMutationResult(__assign(__assign({}, mutation), { result: { data: data } }), cache);\n            }\n            catch (error) {\n                __DEV__ && invariant.error(error);\n            }\n        }, mutation.mutationId);\n    };\n    QueryManager.prototype.fetchQuery = function (queryId, options, networkStatus) {\n        return this.fetchQueryObservable(queryId, options, networkStatus).promise;\n    };\n    QueryManager.prototype.getQueryStore = function () {\n        var store = Object.create(null);\n        this.queries.forEach(function (info, queryId) {\n            store[queryId] = {\n                variables: info.variables,\n                networkStatus: info.networkStatus,\n                networkError: info.networkError,\n                graphQLErrors: info.graphQLErrors,\n            };\n        });\n        return store;\n    };\n    QueryManager.prototype.resetErrors = function (queryId) {\n        var queryInfo = this.queries.get(queryId);\n        if (queryInfo) {\n            queryInfo.networkError = undefined;\n            queryInfo.graphQLErrors = [];\n        }\n    };\n    QueryManager.prototype.transform = function (document) {\n        var transformCache = this.transformCache;\n        if (!transformCache.has(document)) {\n            var transformed = this.cache.transformDocument(document);\n            var forLink = removeConnectionDirectiveFromDocument(this.cache.transformForLink(transformed));\n            var clientQuery = this.localState.clientQuery(transformed);\n            var serverQuery = forLink && this.localState.serverQuery(forLink);\n            var cacheEntry_1 = {\n                document: transformed,\n                hasClientExports: hasClientExports(transformed),\n                hasForcedResolvers: this.localState.shouldForceResolvers(transformed),\n                clientQuery: clientQuery,\n                serverQuery: serverQuery,\n                defaultVars: getDefaultValues(getOperationDefinition(transformed)),\n                asQuery: __assign(__assign({}, transformed), { definitions: transformed.definitions.map(function (def) {\n                        if (def.kind === \"OperationDefinition\" &&\n                            def.operation !== \"query\") {\n                            return __assign(__assign({}, def), { operation: \"query\" });\n                        }\n                        return def;\n                    }) })\n            };\n            var add = function (doc) {\n                if (doc && !transformCache.has(doc)) {\n                    transformCache.set(doc, cacheEntry_1);\n                }\n            };\n            add(document);\n            add(transformed);\n            add(clientQuery);\n            add(serverQuery);\n        }\n        return transformCache.get(document);\n    };\n    QueryManager.prototype.getVariables = function (document, variables) {\n        return __assign(__assign({}, this.transform(document).defaultVars), variables);\n    };\n    QueryManager.prototype.watchQuery = function (options) {\n        options = __assign(__assign({}, options), { variables: this.getVariables(options.query, options.variables) });\n        if (typeof options.notifyOnNetworkStatusChange === 'undefined') {\n            options.notifyOnNetworkStatusChange = false;\n        }\n        var queryInfo = new QueryInfo(this);\n        var observable = new ObservableQuery({\n            queryManager: this,\n            queryInfo: queryInfo,\n            options: options,\n        });\n        this.queries.set(observable.queryId, queryInfo);\n        queryInfo.init({\n            document: options.query,\n            observableQuery: observable,\n            variables: options.variables,\n        });\n        return observable;\n    };\n    QueryManager.prototype.query = function (options, queryId) {\n        var _this = this;\n        if (queryId === void 0) { queryId = this.generateQueryId(); }\n        __DEV__ ? invariant(options.query, 'query option is required. You must specify your GraphQL document ' +\n            'in the query option.') : invariant(options.query, 16);\n        __DEV__ ? invariant(options.query.kind === 'Document', 'You must wrap the query string in a \"gql\" tag.') : invariant(options.query.kind === 'Document', 17);\n        __DEV__ ? invariant(!options.returnPartialData, 'returnPartialData option only supported on watchQuery.') : invariant(!options.returnPartialData, 18);\n        __DEV__ ? invariant(!options.pollInterval, 'pollInterval option only supported on watchQuery.') : invariant(!options.pollInterval, 19);\n        return this.fetchQuery(queryId, options).finally(function () { return _this.stopQuery(queryId); });\n    };\n    QueryManager.prototype.generateQueryId = function () {\n        return String(this.queryIdCounter++);\n    };\n    QueryManager.prototype.generateRequestId = function () {\n        return this.requestIdCounter++;\n    };\n    QueryManager.prototype.generateMutationId = function () {\n        return String(this.mutationIdCounter++);\n    };\n    QueryManager.prototype.stopQueryInStore = function (queryId) {\n        this.stopQueryInStoreNoBroadcast(queryId);\n        this.broadcastQueries();\n    };\n    QueryManager.prototype.stopQueryInStoreNoBroadcast = function (queryId) {\n        var queryInfo = this.queries.get(queryId);\n        if (queryInfo)\n            queryInfo.stop();\n    };\n    QueryManager.prototype.clearStore = function (options) {\n        if (options === void 0) { options = {\n            discardWatches: true,\n        }; }\n        this.cancelPendingFetches(__DEV__ ? new InvariantError('Store reset while query was in flight (not completed in link chain)') : new InvariantError(20));\n        this.queries.forEach(function (queryInfo) {\n            if (queryInfo.observableQuery) {\n                queryInfo.networkStatus = NetworkStatus.loading;\n            }\n            else {\n                queryInfo.stop();\n            }\n        });\n        if (this.mutationStore) {\n            this.mutationStore = Object.create(null);\n        }\n        return this.cache.reset(options);\n    };\n    QueryManager.prototype.getObservableQueries = function (include) {\n        var _this = this;\n        if (include === void 0) { include = \"active\"; }\n        var queries = new Map();\n        var queryNamesAndDocs = new Map();\n        var legacyQueryOptions = new Set();\n        if (Array.isArray(include)) {\n            include.forEach(function (desc) {\n                if (typeof desc === \"string\") {\n                    queryNamesAndDocs.set(desc, false);\n                }\n                else if (isDocumentNode(desc)) {\n                    queryNamesAndDocs.set(_this.transform(desc).document, false);\n                }\n                else if (isNonNullObject(desc) && desc.query) {\n                    legacyQueryOptions.add(desc);\n                }\n            });\n        }\n        this.queries.forEach(function (_a, queryId) {\n            var oq = _a.observableQuery, document = _a.document;\n            if (oq) {\n                if (include === \"all\") {\n                    queries.set(queryId, oq);\n                    return;\n                }\n                var queryName = oq.queryName, fetchPolicy = oq.options.fetchPolicy;\n                if (fetchPolicy === \"standby\" ||\n                    (include === \"active\" && !oq.hasObservers())) {\n                    return;\n                }\n                if (include === \"active\" ||\n                    (queryName && queryNamesAndDocs.has(queryName)) ||\n                    (document && queryNamesAndDocs.has(document))) {\n                    queries.set(queryId, oq);\n                    if (queryName)\n                        queryNamesAndDocs.set(queryName, true);\n                    if (document)\n                        queryNamesAndDocs.set(document, true);\n                }\n            }\n        });\n        if (legacyQueryOptions.size) {\n            legacyQueryOptions.forEach(function (options) {\n                var queryId = makeUniqueId(\"legacyOneTimeQuery\");\n                var queryInfo = _this.getQuery(queryId).init({\n                    document: options.query,\n                    variables: options.variables,\n                });\n                var oq = new ObservableQuery({\n                    queryManager: _this,\n                    queryInfo: queryInfo,\n                    options: __assign(__assign({}, options), { fetchPolicy: \"network-only\" }),\n                });\n                invariant(oq.queryId === queryId);\n                queryInfo.setObservableQuery(oq);\n                queries.set(queryId, oq);\n            });\n        }\n        if (__DEV__ && queryNamesAndDocs.size) {\n            queryNamesAndDocs.forEach(function (included, nameOrDoc) {\n                if (!included) {\n                    __DEV__ && invariant.warn(\"Unknown query \" + (typeof nameOrDoc === \"string\" ? \"named \" : \"\") + JSON.stringify(nameOrDoc, null, 2) + \" requested in refetchQueries options.include array\");\n                }\n            });\n        }\n        return queries;\n    };\n    QueryManager.prototype.reFetchObservableQueries = function (includeStandby) {\n        var _this = this;\n        if (includeStandby === void 0) { includeStandby = false; }\n        var observableQueryPromises = [];\n        this.getObservableQueries(includeStandby ? \"all\" : \"active\").forEach(function (observableQuery, queryId) {\n            var fetchPolicy = observableQuery.options.fetchPolicy;\n            observableQuery.resetLastResults();\n            if (includeStandby ||\n                (fetchPolicy !== \"standby\" &&\n                    fetchPolicy !== \"cache-only\")) {\n                observableQueryPromises.push(observableQuery.refetch());\n            }\n            _this.getQuery(queryId).setDiff(null);\n        });\n        this.broadcastQueries();\n        return Promise.all(observableQueryPromises);\n    };\n    QueryManager.prototype.setObservableQuery = function (observableQuery) {\n        this.getQuery(observableQuery.queryId).setObservableQuery(observableQuery);\n    };\n    QueryManager.prototype.startGraphQLSubscription = function (_a) {\n        var _this = this;\n        var query = _a.query, fetchPolicy = _a.fetchPolicy, errorPolicy = _a.errorPolicy, variables = _a.variables, _b = _a.context, context = _b === void 0 ? {} : _b;\n        query = this.transform(query).document;\n        variables = this.getVariables(query, variables);\n        var makeObservable = function (variables) {\n            return _this.getObservableFromLink(query, context, variables).map(function (result) {\n                if (fetchPolicy !== 'no-cache') {\n                    if (shouldWriteResult(result, errorPolicy)) {\n                        _this.cache.write({\n                            query: query,\n                            result: result.data,\n                            dataId: 'ROOT_SUBSCRIPTION',\n                            variables: variables,\n                        });\n                    }\n                    _this.broadcastQueries();\n                }\n                if (graphQLResultHasError(result)) {\n                    throw new ApolloError({\n                        graphQLErrors: result.errors,\n                    });\n                }\n                return result;\n            });\n        };\n        if (this.transform(query).hasClientExports) {\n            var observablePromise_1 = this.localState.addExportedVariables(query, variables, context).then(makeObservable);\n            return new Observable(function (observer) {\n                var sub = null;\n                observablePromise_1.then(function (observable) { return sub = observable.subscribe(observer); }, observer.error);\n                return function () { return sub && sub.unsubscribe(); };\n            });\n        }\n        return makeObservable(variables);\n    };\n    QueryManager.prototype.stopQuery = function (queryId) {\n        this.stopQueryNoBroadcast(queryId);\n        this.broadcastQueries();\n    };\n    QueryManager.prototype.stopQueryNoBroadcast = function (queryId) {\n        this.stopQueryInStoreNoBroadcast(queryId);\n        this.removeQuery(queryId);\n    };\n    QueryManager.prototype.removeQuery = function (queryId) {\n        this.fetchCancelFns.delete(queryId);\n        this.getQuery(queryId).stop();\n        this.queries.delete(queryId);\n    };\n    QueryManager.prototype.broadcastQueries = function () {\n        if (this.onBroadcast)\n            this.onBroadcast();\n        this.queries.forEach(function (info) { return info.notify(); });\n    };\n    QueryManager.prototype.getLocalState = function () {\n        return this.localState;\n    };\n    QueryManager.prototype.getObservableFromLink = function (query, context, variables, deduplication) {\n        var _this = this;\n        var _a;\n        if (deduplication === void 0) { deduplication = (_a = context === null || context === void 0 ? void 0 : context.queryDeduplication) !== null && _a !== void 0 ? _a : this.queryDeduplication; }\n        var observable;\n        var serverQuery = this.transform(query).serverQuery;\n        if (serverQuery) {\n            var _b = this, inFlightLinkObservables_1 = _b.inFlightLinkObservables, link = _b.link;\n            var operation = {\n                query: serverQuery,\n                variables: variables,\n                operationName: getOperationName(serverQuery) || void 0,\n                context: this.prepareContext(__assign(__assign({}, context), { forceFetch: !deduplication })),\n            };\n            context = operation.context;\n            if (deduplication) {\n                var byVariables_1 = inFlightLinkObservables_1.get(serverQuery) || new Map();\n                inFlightLinkObservables_1.set(serverQuery, byVariables_1);\n                var varJson_1 = canonicalStringify(variables);\n                observable = byVariables_1.get(varJson_1);\n                if (!observable) {\n                    var concast = new Concast([\n                        execute(link, operation)\n                    ]);\n                    byVariables_1.set(varJson_1, observable = concast);\n                    concast.cleanup(function () {\n                        if (byVariables_1.delete(varJson_1) &&\n                            byVariables_1.size < 1) {\n                            inFlightLinkObservables_1.delete(serverQuery);\n                        }\n                    });\n                }\n            }\n            else {\n                observable = new Concast([\n                    execute(link, operation)\n                ]);\n            }\n        }\n        else {\n            observable = new Concast([\n                Observable.of({ data: {} })\n            ]);\n            context = this.prepareContext(context);\n        }\n        var clientQuery = this.transform(query).clientQuery;\n        if (clientQuery) {\n            observable = asyncMap(observable, function (result) {\n                return _this.localState.runResolvers({\n                    document: clientQuery,\n                    remoteResult: result,\n                    context: context,\n                    variables: variables,\n                });\n            });\n        }\n        return observable;\n    };\n    QueryManager.prototype.getResultsFromLink = function (queryInfo, cacheWriteBehavior, options) {\n        var requestId = queryInfo.lastRequestId = this.generateRequestId();\n        return asyncMap(this.getObservableFromLink(queryInfo.document, options.context, options.variables), function (result) {\n            var hasErrors = isNonEmptyArray(result.errors);\n            if (requestId >= queryInfo.lastRequestId) {\n                if (hasErrors && options.errorPolicy === \"none\") {\n                    throw queryInfo.markError(new ApolloError({\n                        graphQLErrors: result.errors,\n                    }));\n                }\n                queryInfo.markResult(result, options, cacheWriteBehavior);\n                queryInfo.markReady();\n            }\n            var aqr = {\n                data: result.data,\n                loading: false,\n                networkStatus: queryInfo.networkStatus || NetworkStatus.ready,\n            };\n            if (hasErrors && options.errorPolicy !== \"ignore\") {\n                aqr.errors = result.errors;\n            }\n            return aqr;\n        }, function (networkError) {\n            var error = isApolloError(networkError)\n                ? networkError\n                : new ApolloError({ networkError: networkError });\n            if (requestId >= queryInfo.lastRequestId) {\n                queryInfo.markError(error);\n            }\n            throw error;\n        });\n    };\n    QueryManager.prototype.fetchQueryObservable = function (queryId, options, networkStatus) {\n        var _this = this;\n        if (networkStatus === void 0) { networkStatus = NetworkStatus.loading; }\n        var query = this.transform(options.query).document;\n        var variables = this.getVariables(query, options.variables);\n        var queryInfo = this.getQuery(queryId);\n        var _a = options.fetchPolicy, fetchPolicy = _a === void 0 ? \"cache-first\" : _a, _b = options.errorPolicy, errorPolicy = _b === void 0 ? \"none\" : _b, _c = options.returnPartialData, returnPartialData = _c === void 0 ? false : _c, _d = options.notifyOnNetworkStatusChange, notifyOnNetworkStatusChange = _d === void 0 ? false : _d, _e = options.context, context = _e === void 0 ? {} : _e;\n        var normalized = Object.assign({}, options, {\n            query: query,\n            variables: variables,\n            fetchPolicy: fetchPolicy,\n            errorPolicy: errorPolicy,\n            returnPartialData: returnPartialData,\n            notifyOnNetworkStatusChange: notifyOnNetworkStatusChange,\n            context: context,\n        });\n        var fromVariables = function (variables) {\n            normalized.variables = variables;\n            return _this.fetchQueryByPolicy(queryInfo, normalized, networkStatus);\n        };\n        this.fetchCancelFns.set(queryId, function (reason) {\n            setTimeout(function () { return concast.cancel(reason); });\n        });\n        var concast = new Concast(this.transform(normalized.query).hasClientExports\n            ? this.localState.addExportedVariables(normalized.query, normalized.variables, normalized.context).then(fromVariables)\n            : fromVariables(normalized.variables));\n        concast.cleanup(function () {\n            _this.fetchCancelFns.delete(queryId);\n            applyNextFetchPolicy(options);\n        });\n        return concast;\n    };\n    QueryManager.prototype.refetchQueries = function (_a) {\n        var _this = this;\n        var updateCache = _a.updateCache, include = _a.include, _b = _a.optimistic, optimistic = _b === void 0 ? false : _b, _c = _a.removeOptimistic, removeOptimistic = _c === void 0 ? optimistic ? makeUniqueId(\"refetchQueries\") : void 0 : _c, onQueryUpdated = _a.onQueryUpdated;\n        var includedQueriesById = new Map();\n        if (include) {\n            this.getObservableQueries(include).forEach(function (oq, queryId) {\n                includedQueriesById.set(queryId, {\n                    oq: oq,\n                    lastDiff: _this.getQuery(queryId).getDiff(),\n                });\n            });\n        }\n        var results = new Map;\n        if (updateCache) {\n            this.cache.batch({\n                update: updateCache,\n                optimistic: optimistic && removeOptimistic || false,\n                removeOptimistic: removeOptimistic,\n                onWatchUpdated: function (watch, diff, lastDiff) {\n                    var oq = watch.watcher instanceof QueryInfo &&\n                        watch.watcher.observableQuery;\n                    if (oq) {\n                        if (onQueryUpdated) {\n                            includedQueriesById.delete(oq.queryId);\n                            var result = onQueryUpdated(oq, diff, lastDiff);\n                            if (result === true) {\n                                result = oq.refetch();\n                            }\n                            if (result !== false) {\n                                results.set(oq, result);\n                            }\n                            return false;\n                        }\n                        if (onQueryUpdated !== null) {\n                            includedQueriesById.set(oq.queryId, { oq: oq, lastDiff: lastDiff, diff: diff });\n                        }\n                    }\n                },\n            });\n        }\n        if (includedQueriesById.size) {\n            includedQueriesById.forEach(function (_a, queryId) {\n                var oq = _a.oq, lastDiff = _a.lastDiff, diff = _a.diff;\n                var result;\n                if (onQueryUpdated) {\n                    if (!diff) {\n                        var info = oq[\"queryInfo\"];\n                        info.reset();\n                        diff = info.getDiff();\n                    }\n                    result = onQueryUpdated(oq, diff, lastDiff);\n                }\n                if (!onQueryUpdated || result === true) {\n                    result = oq.refetch();\n                }\n                if (result !== false) {\n                    results.set(oq, result);\n                }\n                if (queryId.indexOf(\"legacyOneTimeQuery\") >= 0) {\n                    _this.stopQueryNoBroadcast(queryId);\n                }\n            });\n        }\n        if (removeOptimistic) {\n            this.cache.removeOptimistic(removeOptimistic);\n        }\n        return results;\n    };\n    QueryManager.prototype.fetchQueryByPolicy = function (queryInfo, _a, networkStatus) {\n        var _this = this;\n        var query = _a.query, variables = _a.variables, fetchPolicy = _a.fetchPolicy, refetchWritePolicy = _a.refetchWritePolicy, errorPolicy = _a.errorPolicy, returnPartialData = _a.returnPartialData, context = _a.context, notifyOnNetworkStatusChange = _a.notifyOnNetworkStatusChange;\n        var oldNetworkStatus = queryInfo.networkStatus;\n        queryInfo.init({\n            document: query,\n            variables: variables,\n            networkStatus: networkStatus,\n        });\n        var readCache = function () { return queryInfo.getDiff(variables); };\n        var resultsFromCache = function (diff, networkStatus) {\n            if (networkStatus === void 0) { networkStatus = queryInfo.networkStatus || NetworkStatus.loading; }\n            var data = diff.result;\n            if (__DEV__ &&\n                !returnPartialData &&\n                !equal(data, {})) {\n                logMissingFieldErrors(diff.missing);\n            }\n            var fromData = function (data) { return Observable.of(__assign({ data: data, loading: isNetworkRequestInFlight(networkStatus), networkStatus: networkStatus }, (diff.complete ? null : { partial: true }))); };\n            if (data && _this.transform(query).hasForcedResolvers) {\n                return _this.localState.runResolvers({\n                    document: query,\n                    remoteResult: { data: data },\n                    context: context,\n                    variables: variables,\n                    onlyRunForcedResolvers: true,\n                }).then(function (resolved) { return fromData(resolved.data || void 0); });\n            }\n            return fromData(data);\n        };\n        var cacheWriteBehavior = fetchPolicy === \"no-cache\" ? 0 :\n            (networkStatus === NetworkStatus.refetch &&\n                refetchWritePolicy !== \"merge\") ? 1\n                : 2;\n        var resultsFromLink = function () {\n            return _this.getResultsFromLink(queryInfo, cacheWriteBehavior, {\n                variables: variables,\n                context: context,\n                fetchPolicy: fetchPolicy,\n                errorPolicy: errorPolicy,\n            });\n        };\n        var shouldNotify = notifyOnNetworkStatusChange &&\n            typeof oldNetworkStatus === \"number\" &&\n            oldNetworkStatus !== networkStatus &&\n            isNetworkRequestInFlight(networkStatus);\n        switch (fetchPolicy) {\n            default:\n            case \"cache-first\": {\n                var diff = readCache();\n                if (diff.complete) {\n                    return [\n                        resultsFromCache(diff, queryInfo.markReady()),\n                    ];\n                }\n                if (returnPartialData || shouldNotify) {\n                    return [\n                        resultsFromCache(diff),\n                        resultsFromLink(),\n                    ];\n                }\n                return [\n                    resultsFromLink(),\n                ];\n            }\n            case \"cache-and-network\": {\n                var diff = readCache();\n                if (diff.complete || returnPartialData || shouldNotify) {\n                    return [\n                        resultsFromCache(diff),\n                        resultsFromLink(),\n                    ];\n                }\n                return [\n                    resultsFromLink(),\n                ];\n            }\n            case \"cache-only\":\n                return [\n                    resultsFromCache(readCache(), queryInfo.markReady()),\n                ];\n            case \"network-only\":\n                if (shouldNotify) {\n                    return [\n                        resultsFromCache(readCache()),\n                        resultsFromLink(),\n                    ];\n                }\n                return [resultsFromLink()];\n            case \"no-cache\":\n                if (shouldNotify) {\n                    return [\n                        resultsFromCache(queryInfo.getDiff()),\n                        resultsFromLink(),\n                    ];\n                }\n                return [resultsFromLink()];\n            case \"standby\":\n                return [];\n        }\n    };\n    QueryManager.prototype.getQuery = function (queryId) {\n        if (queryId && !this.queries.has(queryId)) {\n            this.queries.set(queryId, new QueryInfo(this, queryId));\n        }\n        return this.queries.get(queryId);\n    };\n    QueryManager.prototype.prepareContext = function (context) {\n        if (context === void 0) { context = {}; }\n        var newContext = this.localState.prepareContext(context);\n        return __assign(__assign({}, newContext), { clientAwareness: this.clientAwareness });\n    };\n    return QueryManager;\n}());\nexport { QueryManager };\n//# sourceMappingURL=QueryManager.js.map","import { __assign } from \"tslib\";\nimport { invariant, InvariantError } from \"../utilities/globals/index.js\";\nimport { ApolloLink, execute } from \"../link/core/index.js\";\nimport { compact } from \"../utilities/index.js\";\nimport { version } from \"../version.js\";\nimport { HttpLink } from \"../link/http/index.js\";\nimport { QueryManager } from \"./QueryManager.js\";\nimport { LocalState, } from \"./LocalState.js\";\nvar hasSuggestedDevtools = false;\nexport function mergeOptions(defaults, options) {\n    return compact(defaults, options, options.variables && {\n        variables: __assign(__assign({}, defaults.variables), options.variables),\n    });\n}\nvar ApolloClient = (function () {\n    function ApolloClient(options) {\n        var _this = this;\n        this.defaultOptions = {};\n        this.resetStoreCallbacks = [];\n        this.clearStoreCallbacks = [];\n        var uri = options.uri, credentials = options.credentials, headers = options.headers, cache = options.cache, _a = options.ssrMode, ssrMode = _a === void 0 ? false : _a, _b = options.ssrForceFetchDelay, ssrForceFetchDelay = _b === void 0 ? 0 : _b, _c = options.connectToDevTools, connectToDevTools = _c === void 0 ? typeof window === 'object' &&\n            !window.__APOLLO_CLIENT__ &&\n            __DEV__ : _c, _d = options.queryDeduplication, queryDeduplication = _d === void 0 ? true : _d, defaultOptions = options.defaultOptions, _e = options.assumeImmutableResults, assumeImmutableResults = _e === void 0 ? false : _e, resolvers = options.resolvers, typeDefs = options.typeDefs, fragmentMatcher = options.fragmentMatcher, clientAwarenessName = options.name, clientAwarenessVersion = options.version;\n        var link = options.link;\n        if (!link) {\n            link = uri\n                ? new HttpLink({ uri: uri, credentials: credentials, headers: headers })\n                : ApolloLink.empty();\n        }\n        if (!cache) {\n            throw __DEV__ ? new InvariantError(\"To initialize Apollo Client, you must specify a 'cache' property \" +\n                \"in the options object. \\n\" +\n                \"For more information, please visit: https://go.apollo.dev/c/docs\") : new InvariantError(9);\n        }\n        this.link = link;\n        this.cache = cache;\n        this.disableNetworkFetches = ssrMode || ssrForceFetchDelay > 0;\n        this.queryDeduplication = queryDeduplication;\n        this.defaultOptions = defaultOptions || {};\n        this.typeDefs = typeDefs;\n        if (ssrForceFetchDelay) {\n            setTimeout(function () { return (_this.disableNetworkFetches = false); }, ssrForceFetchDelay);\n        }\n        this.watchQuery = this.watchQuery.bind(this);\n        this.query = this.query.bind(this);\n        this.mutate = this.mutate.bind(this);\n        this.resetStore = this.resetStore.bind(this);\n        this.reFetchObservableQueries = this.reFetchObservableQueries.bind(this);\n        if (connectToDevTools && typeof window === 'object') {\n            window.__APOLLO_CLIENT__ = this;\n        }\n        if (!hasSuggestedDevtools && __DEV__) {\n            hasSuggestedDevtools = true;\n            if (typeof window !== 'undefined' &&\n                window.document &&\n                window.top === window.self &&\n                !window.__APOLLO_DEVTOOLS_GLOBAL_HOOK__) {\n                var nav = window.navigator;\n                var ua = nav && nav.userAgent;\n                var url = void 0;\n                if (typeof ua === \"string\") {\n                    if (ua.indexOf(\"Chrome/\") > -1) {\n                        url = \"https://chrome.google.com/webstore/detail/\" +\n                            \"apollo-client-developer-t/jdkknkkbebbapilgoeccciglkfbmbnfm\";\n                    }\n                    else if (ua.indexOf(\"Firefox/\") > -1) {\n                        url = \"https://addons.mozilla.org/en-US/firefox/addon/apollo-developer-tools/\";\n                    }\n                }\n                if (url) {\n                    __DEV__ && invariant.log(\"Download the Apollo DevTools for a better development \" +\n                        \"experience: \" + url);\n                }\n            }\n        }\n        this.version = version;\n        this.localState = new LocalState({\n            cache: cache,\n            client: this,\n            resolvers: resolvers,\n            fragmentMatcher: fragmentMatcher,\n        });\n        this.queryManager = new QueryManager({\n            cache: this.cache,\n            link: this.link,\n            queryDeduplication: queryDeduplication,\n            ssrMode: ssrMode,\n            clientAwareness: {\n                name: clientAwarenessName,\n                version: clientAwarenessVersion,\n            },\n            localState: this.localState,\n            assumeImmutableResults: assumeImmutableResults,\n            onBroadcast: connectToDevTools ? function () {\n                if (_this.devToolsHookCb) {\n                    _this.devToolsHookCb({\n                        action: {},\n                        state: {\n                            queries: _this.queryManager.getQueryStore(),\n                            mutations: _this.queryManager.mutationStore || {},\n                        },\n                        dataWithOptimisticResults: _this.cache.extract(true),\n                    });\n                }\n            } : void 0,\n        });\n    }\n    ApolloClient.prototype.stop = function () {\n        this.queryManager.stop();\n    };\n    ApolloClient.prototype.watchQuery = function (options) {\n        if (this.defaultOptions.watchQuery) {\n            options = mergeOptions(this.defaultOptions.watchQuery, options);\n        }\n        if (this.disableNetworkFetches &&\n            (options.fetchPolicy === 'network-only' ||\n                options.fetchPolicy === 'cache-and-network')) {\n            options = __assign(__assign({}, options), { fetchPolicy: 'cache-first' });\n        }\n        return this.queryManager.watchQuery(options);\n    };\n    ApolloClient.prototype.query = function (options) {\n        if (this.defaultOptions.query) {\n            options = mergeOptions(this.defaultOptions.query, options);\n        }\n        __DEV__ ? invariant(options.fetchPolicy !== 'cache-and-network', 'The cache-and-network fetchPolicy does not work with client.query, because ' +\n            'client.query can only return a single result. Please use client.watchQuery ' +\n            'to receive multiple results from the cache and the network, or consider ' +\n            'using a different fetchPolicy, such as cache-first or network-only.') : invariant(options.fetchPolicy !== 'cache-and-network', 10);\n        if (this.disableNetworkFetches && options.fetchPolicy === 'network-only') {\n            options = __assign(__assign({}, options), { fetchPolicy: 'cache-first' });\n        }\n        return this.queryManager.query(options);\n    };\n    ApolloClient.prototype.mutate = function (options) {\n        if (this.defaultOptions.mutate) {\n            options = mergeOptions(this.defaultOptions.mutate, options);\n        }\n        return this.queryManager.mutate(options);\n    };\n    ApolloClient.prototype.subscribe = function (options) {\n        return this.queryManager.startGraphQLSubscription(options);\n    };\n    ApolloClient.prototype.readQuery = function (options, optimistic) {\n        if (optimistic === void 0) { optimistic = false; }\n        return this.cache.readQuery(options, optimistic);\n    };\n    ApolloClient.prototype.readFragment = function (options, optimistic) {\n        if (optimistic === void 0) { optimistic = false; }\n        return this.cache.readFragment(options, optimistic);\n    };\n    ApolloClient.prototype.writeQuery = function (options) {\n        this.cache.writeQuery(options);\n        this.queryManager.broadcastQueries();\n    };\n    ApolloClient.prototype.writeFragment = function (options) {\n        this.cache.writeFragment(options);\n        this.queryManager.broadcastQueries();\n    };\n    ApolloClient.prototype.__actionHookForDevTools = function (cb) {\n        this.devToolsHookCb = cb;\n    };\n    ApolloClient.prototype.__requestRaw = function (payload) {\n        return execute(this.link, payload);\n    };\n    ApolloClient.prototype.resetStore = function () {\n        var _this = this;\n        return Promise.resolve()\n            .then(function () { return _this.queryManager.clearStore({\n            discardWatches: false,\n        }); })\n            .then(function () { return Promise.all(_this.resetStoreCallbacks.map(function (fn) { return fn(); })); })\n            .then(function () { return _this.reFetchObservableQueries(); });\n    };\n    ApolloClient.prototype.clearStore = function () {\n        var _this = this;\n        return Promise.resolve()\n            .then(function () { return _this.queryManager.clearStore({\n            discardWatches: true,\n        }); })\n            .then(function () { return Promise.all(_this.clearStoreCallbacks.map(function (fn) { return fn(); })); });\n    };\n    ApolloClient.prototype.onResetStore = function (cb) {\n        var _this = this;\n        this.resetStoreCallbacks.push(cb);\n        return function () {\n            _this.resetStoreCallbacks = _this.resetStoreCallbacks.filter(function (c) { return c !== cb; });\n        };\n    };\n    ApolloClient.prototype.onClearStore = function (cb) {\n        var _this = this;\n        this.clearStoreCallbacks.push(cb);\n        return function () {\n            _this.clearStoreCallbacks = _this.clearStoreCallbacks.filter(function (c) { return c !== cb; });\n        };\n    };\n    ApolloClient.prototype.reFetchObservableQueries = function (includeStandby) {\n        return this.queryManager.reFetchObservableQueries(includeStandby);\n    };\n    ApolloClient.prototype.refetchQueries = function (options) {\n        var map = this.queryManager.refetchQueries(options);\n        var queries = [];\n        var results = [];\n        map.forEach(function (result, obsQuery) {\n            queries.push(obsQuery);\n            results.push(result);\n        });\n        var result = Promise.all(results);\n        result.queries = queries;\n        result.results = results;\n        result.catch(function (error) {\n            __DEV__ && invariant.debug(\"In client.refetchQueries, Promise.all promise rejected with error \" + error);\n        });\n        return result;\n    };\n    ApolloClient.prototype.getObservableQueries = function (include) {\n        if (include === void 0) { include = \"active\"; }\n        return this.queryManager.getObservableQueries(include);\n    };\n    ApolloClient.prototype.extract = function (optimistic) {\n        return this.cache.extract(optimistic);\n    };\n    ApolloClient.prototype.restore = function (serializedState) {\n        return this.cache.restore(serializedState);\n    };\n    ApolloClient.prototype.addResolvers = function (resolvers) {\n        this.localState.addResolvers(resolvers);\n    };\n    ApolloClient.prototype.setResolvers = function (resolvers) {\n        this.localState.setResolvers(resolvers);\n    };\n    ApolloClient.prototype.getResolvers = function () {\n        return this.localState.getResolvers();\n    };\n    ApolloClient.prototype.setLocalStateFragmentMatcher = function (fragmentMatcher) {\n        this.localState.setFragmentMatcher(fragmentMatcher);\n    };\n    ApolloClient.prototype.setLink = function (newLink) {\n        this.link = this.queryManager.link = newLink;\n    };\n    return ApolloClient;\n}());\nexport { ApolloClient };\n//# sourceMappingURL=ApolloClient.js.map","import { __assign, __rest } from \"tslib\";\nimport { wrap } from 'optimism';\nimport { getFragmentQueryDocument, } from \"../../utilities/index.js\";\nvar ApolloCache = (function () {\n    function ApolloCache() {\n        this.getFragmentDoc = wrap(getFragmentQueryDocument);\n    }\n    ApolloCache.prototype.batch = function (options) {\n        var optimisticId = typeof options.optimistic === \"string\" ? options.optimistic :\n            options.optimistic === false ? null : void 0;\n        this.performTransaction(options.update, optimisticId);\n    };\n    ApolloCache.prototype.recordOptimisticTransaction = function (transaction, optimisticId) {\n        this.performTransaction(transaction, optimisticId);\n    };\n    ApolloCache.prototype.transformDocument = function (document) {\n        return document;\n    };\n    ApolloCache.prototype.identify = function (object) {\n        return;\n    };\n    ApolloCache.prototype.gc = function () {\n        return [];\n    };\n    ApolloCache.prototype.modify = function (options) {\n        return false;\n    };\n    ApolloCache.prototype.transformForLink = function (document) {\n        return document;\n    };\n    ApolloCache.prototype.readQuery = function (options, optimistic) {\n        if (optimistic === void 0) { optimistic = !!options.optimistic; }\n        return this.read(__assign(__assign({}, options), { rootId: options.id || 'ROOT_QUERY', optimistic: optimistic }));\n    };\n    ApolloCache.prototype.readFragment = function (options, optimistic) {\n        if (optimistic === void 0) { optimistic = !!options.optimistic; }\n        return this.read(__assign(__assign({}, options), { query: this.getFragmentDoc(options.fragment, options.fragmentName), rootId: options.id, optimistic: optimistic }));\n    };\n    ApolloCache.prototype.writeQuery = function (_a) {\n        var id = _a.id, data = _a.data, options = __rest(_a, [\"id\", \"data\"]);\n        return this.write(Object.assign(options, {\n            dataId: id || 'ROOT_QUERY',\n            result: data,\n        }));\n    };\n    ApolloCache.prototype.writeFragment = function (_a) {\n        var id = _a.id, data = _a.data, fragment = _a.fragment, fragmentName = _a.fragmentName, options = __rest(_a, [\"id\", \"data\", \"fragment\", \"fragmentName\"]);\n        return this.write(Object.assign(options, {\n            query: this.getFragmentDoc(fragment, fragmentName),\n            dataId: id,\n            result: data,\n        }));\n    };\n    return ApolloCache;\n}());\nexport { ApolloCache };\n//# sourceMappingURL=cache.js.map","import { __extends } from \"tslib\";\nvar MissingFieldError = (function (_super) {\n    __extends(MissingFieldError, _super);\n    function MissingFieldError(message, path, query, variables) {\n        var _this = _super.call(this, message) || this;\n        _this.message = message;\n        _this.path = path;\n        _this.query = query;\n        _this.variables = variables;\n        _this.__proto__ = MissingFieldError.prototype;\n        return _this;\n    }\n    return MissingFieldError;\n}(Error));\nexport { MissingFieldError };\n//# sourceMappingURL=common.js.map","import \"../globals/index.js\";\nimport { isNonNullObject } from \"./objects.js\";\nfunction deepFreeze(value) {\n    var workSet = new Set([value]);\n    workSet.forEach(function (obj) {\n        if (isNonNullObject(obj) && shallowFreeze(obj) === obj) {\n            Object.getOwnPropertyNames(obj).forEach(function (name) {\n                if (isNonNullObject(obj[name]))\n                    workSet.add(obj[name]);\n            });\n        }\n    });\n    return value;\n}\nfunction shallowFreeze(obj) {\n    if (__DEV__ && !Object.isFrozen(obj)) {\n        try {\n            Object.freeze(obj);\n        }\n        catch (e) {\n            if (e instanceof TypeError)\n                return null;\n            throw e;\n        }\n    }\n    return obj;\n}\nexport function maybeDeepFreeze(obj) {\n    if (__DEV__) {\n        deepFreeze(obj);\n    }\n    return obj;\n}\n//# sourceMappingURL=maybeDeepFreeze.js.map","import { isReference, isField, DeepMerger, resultKeyNameFromField, shouldInclude, isNonNullObject, compact, } from \"../../utilities/index.js\";\nexport var hasOwn = Object.prototype.hasOwnProperty;\nexport function defaultDataIdFromObject(_a, context) {\n    var __typename = _a.__typename, id = _a.id, _id = _a._id;\n    if (typeof __typename === \"string\") {\n        if (context) {\n            context.keyObject =\n                id !== void 0 ? { id: id } :\n                    _id !== void 0 ? { _id: _id } :\n                        void 0;\n        }\n        if (id === void 0)\n            id = _id;\n        if (id !== void 0) {\n            return __typename + \":\" + ((typeof id === \"number\" ||\n                typeof id === \"string\") ? id : JSON.stringify(id));\n        }\n    }\n}\nvar defaultConfig = {\n    dataIdFromObject: defaultDataIdFromObject,\n    addTypename: true,\n    resultCaching: true,\n    canonizeResults: false,\n};\nexport function normalizeConfig(config) {\n    return compact(defaultConfig, config);\n}\nexport function shouldCanonizeResults(config) {\n    var value = config.canonizeResults;\n    return value === void 0 ? defaultConfig.canonizeResults : value;\n}\nexport function getTypenameFromStoreObject(store, objectOrReference) {\n    return isReference(objectOrReference)\n        ? store.get(objectOrReference.__ref, \"__typename\")\n        : objectOrReference && objectOrReference.__typename;\n}\nexport var TypeOrFieldNameRegExp = /^[_a-z][_0-9a-z]*/i;\nexport function fieldNameFromStoreName(storeFieldName) {\n    var match = storeFieldName.match(TypeOrFieldNameRegExp);\n    return match ? match[0] : storeFieldName;\n}\nexport function selectionSetMatchesResult(selectionSet, result, variables) {\n    if (isNonNullObject(result)) {\n        return Array.isArray(result)\n            ? result.every(function (item) { return selectionSetMatchesResult(selectionSet, item, variables); })\n            : selectionSet.selections.every(function (field) {\n                if (isField(field) && shouldInclude(field, variables)) {\n                    var key = resultKeyNameFromField(field);\n                    return hasOwn.call(result, key) &&\n                        (!field.selectionSet ||\n                            selectionSetMatchesResult(field.selectionSet, result[key], variables));\n                }\n                return true;\n            });\n    }\n    return false;\n}\nexport function storeValueIsStoreObject(value) {\n    return isNonNullObject(value) &&\n        !isReference(value) &&\n        !Array.isArray(value);\n}\nexport function makeProcessedFieldsMerger() {\n    return new DeepMerger;\n}\n//# sourceMappingURL=helpers.js.map","import { __assign, __extends, __rest } from \"tslib\";\nimport { invariant } from \"../../utilities/globals/index.js\";\nimport { dep } from 'optimism';\nimport { equal } from '@wry/equality';\nimport { Trie } from '@wry/trie';\nimport { isReference, makeReference, DeepMerger, maybeDeepFreeze, canUseWeakMap, isNonNullObject, } from \"../../utilities/index.js\";\nimport { hasOwn, fieldNameFromStoreName } from \"./helpers.js\";\nvar DELETE = Object.create(null);\nvar delModifier = function () { return DELETE; };\nvar INVALIDATE = Object.create(null);\nvar EntityStore = (function () {\n    function EntityStore(policies, group) {\n        var _this = this;\n        this.policies = policies;\n        this.group = group;\n        this.data = Object.create(null);\n        this.rootIds = Object.create(null);\n        this.refs = Object.create(null);\n        this.getFieldValue = function (objectOrReference, storeFieldName) { return maybeDeepFreeze(isReference(objectOrReference)\n            ? _this.get(objectOrReference.__ref, storeFieldName)\n            : objectOrReference && objectOrReference[storeFieldName]); };\n        this.canRead = function (objOrRef) {\n            return isReference(objOrRef)\n                ? _this.has(objOrRef.__ref)\n                : typeof objOrRef === \"object\";\n        };\n        this.toReference = function (objOrIdOrRef, mergeIntoStore) {\n            if (typeof objOrIdOrRef === \"string\") {\n                return makeReference(objOrIdOrRef);\n            }\n            if (isReference(objOrIdOrRef)) {\n                return objOrIdOrRef;\n            }\n            var id = _this.policies.identify(objOrIdOrRef)[0];\n            if (id) {\n                var ref = makeReference(id);\n                if (mergeIntoStore) {\n                    _this.merge(id, objOrIdOrRef);\n                }\n                return ref;\n            }\n        };\n    }\n    EntityStore.prototype.toObject = function () {\n        return __assign({}, this.data);\n    };\n    EntityStore.prototype.has = function (dataId) {\n        return this.lookup(dataId, true) !== void 0;\n    };\n    EntityStore.prototype.get = function (dataId, fieldName) {\n        this.group.depend(dataId, fieldName);\n        if (hasOwn.call(this.data, dataId)) {\n            var storeObject = this.data[dataId];\n            if (storeObject && hasOwn.call(storeObject, fieldName)) {\n                return storeObject[fieldName];\n            }\n        }\n        if (fieldName === \"__typename\" &&\n            hasOwn.call(this.policies.rootTypenamesById, dataId)) {\n            return this.policies.rootTypenamesById[dataId];\n        }\n        if (this instanceof Layer) {\n            return this.parent.get(dataId, fieldName);\n        }\n    };\n    EntityStore.prototype.lookup = function (dataId, dependOnExistence) {\n        if (dependOnExistence)\n            this.group.depend(dataId, \"__exists\");\n        if (hasOwn.call(this.data, dataId)) {\n            return this.data[dataId];\n        }\n        if (this instanceof Layer) {\n            return this.parent.lookup(dataId, dependOnExistence);\n        }\n        if (this.policies.rootTypenamesById[dataId]) {\n            return Object.create(null);\n        }\n    };\n    EntityStore.prototype.merge = function (older, newer) {\n        var _this = this;\n        var dataId;\n        if (isReference(older))\n            older = older.__ref;\n        if (isReference(newer))\n            newer = newer.__ref;\n        var existing = typeof older === \"string\"\n            ? this.lookup(dataId = older)\n            : older;\n        var incoming = typeof newer === \"string\"\n            ? this.lookup(dataId = newer)\n            : newer;\n        if (!incoming)\n            return;\n        __DEV__ ? invariant(typeof dataId === \"string\", \"store.merge expects a string ID\") : invariant(typeof dataId === \"string\", 1);\n        var merged = new DeepMerger(storeObjectReconciler).merge(existing, incoming);\n        this.data[dataId] = merged;\n        if (merged !== existing) {\n            delete this.refs[dataId];\n            if (this.group.caching) {\n                var fieldsToDirty_1 = Object.create(null);\n                if (!existing)\n                    fieldsToDirty_1.__exists = 1;\n                Object.keys(incoming).forEach(function (storeFieldName) {\n                    if (!existing || existing[storeFieldName] !== merged[storeFieldName]) {\n                        fieldsToDirty_1[storeFieldName] = 1;\n                        var fieldName = fieldNameFromStoreName(storeFieldName);\n                        if (fieldName !== storeFieldName &&\n                            !_this.policies.hasKeyArgs(merged.__typename, fieldName)) {\n                            fieldsToDirty_1[fieldName] = 1;\n                        }\n                        if (merged[storeFieldName] === void 0 && !(_this instanceof Layer)) {\n                            delete merged[storeFieldName];\n                        }\n                    }\n                });\n                if (fieldsToDirty_1.__typename &&\n                    !(existing && existing.__typename) &&\n                    this.policies.rootTypenamesById[dataId] === merged.__typename) {\n                    delete fieldsToDirty_1.__typename;\n                }\n                Object.keys(fieldsToDirty_1).forEach(function (fieldName) { return _this.group.dirty(dataId, fieldName); });\n            }\n        }\n    };\n    EntityStore.prototype.modify = function (dataId, fields) {\n        var _this = this;\n        var storeObject = this.lookup(dataId);\n        if (storeObject) {\n            var changedFields_1 = Object.create(null);\n            var needToMerge_1 = false;\n            var allDeleted_1 = true;\n            var sharedDetails_1 = {\n                DELETE: DELETE,\n                INVALIDATE: INVALIDATE,\n                isReference: isReference,\n                toReference: this.toReference,\n                canRead: this.canRead,\n                readField: function (fieldNameOrOptions, from) { return _this.policies.readField(typeof fieldNameOrOptions === \"string\" ? {\n                    fieldName: fieldNameOrOptions,\n                    from: from || makeReference(dataId),\n                } : fieldNameOrOptions, { store: _this }); },\n            };\n            Object.keys(storeObject).forEach(function (storeFieldName) {\n                var fieldName = fieldNameFromStoreName(storeFieldName);\n                var fieldValue = storeObject[storeFieldName];\n                if (fieldValue === void 0)\n                    return;\n                var modify = typeof fields === \"function\"\n                    ? fields\n                    : fields[storeFieldName] || fields[fieldName];\n                if (modify) {\n                    var newValue = modify === delModifier ? DELETE :\n                        modify(maybeDeepFreeze(fieldValue), __assign(__assign({}, sharedDetails_1), { fieldName: fieldName, storeFieldName: storeFieldName, storage: _this.getStorage(dataId, storeFieldName) }));\n                    if (newValue === INVALIDATE) {\n                        _this.group.dirty(dataId, storeFieldName);\n                    }\n                    else {\n                        if (newValue === DELETE)\n                            newValue = void 0;\n                        if (newValue !== fieldValue) {\n                            changedFields_1[storeFieldName] = newValue;\n                            needToMerge_1 = true;\n                            fieldValue = newValue;\n                        }\n                    }\n                }\n                if (fieldValue !== void 0) {\n                    allDeleted_1 = false;\n                }\n            });\n            if (needToMerge_1) {\n                this.merge(dataId, changedFields_1);\n                if (allDeleted_1) {\n                    if (this instanceof Layer) {\n                        this.data[dataId] = void 0;\n                    }\n                    else {\n                        delete this.data[dataId];\n                    }\n                    this.group.dirty(dataId, \"__exists\");\n                }\n                return true;\n            }\n        }\n        return false;\n    };\n    EntityStore.prototype.delete = function (dataId, fieldName, args) {\n        var _a;\n        var storeObject = this.lookup(dataId);\n        if (storeObject) {\n            var typename = this.getFieldValue(storeObject, \"__typename\");\n            var storeFieldName = fieldName && args\n                ? this.policies.getStoreFieldName({ typename: typename, fieldName: fieldName, args: args })\n                : fieldName;\n            return this.modify(dataId, storeFieldName ? (_a = {},\n                _a[storeFieldName] = delModifier,\n                _a) : delModifier);\n        }\n        return false;\n    };\n    EntityStore.prototype.evict = function (options, limit) {\n        var evicted = false;\n        if (options.id) {\n            if (hasOwn.call(this.data, options.id)) {\n                evicted = this.delete(options.id, options.fieldName, options.args);\n            }\n            if (this instanceof Layer && this !== limit) {\n                evicted = this.parent.evict(options, limit) || evicted;\n            }\n            if (options.fieldName || evicted) {\n                this.group.dirty(options.id, options.fieldName || \"__exists\");\n            }\n        }\n        return evicted;\n    };\n    EntityStore.prototype.clear = function () {\n        this.replace(null);\n    };\n    EntityStore.prototype.extract = function () {\n        var _this = this;\n        var obj = this.toObject();\n        var extraRootIds = [];\n        this.getRootIdSet().forEach(function (id) {\n            if (!hasOwn.call(_this.policies.rootTypenamesById, id)) {\n                extraRootIds.push(id);\n            }\n        });\n        if (extraRootIds.length) {\n            obj.__META = { extraRootIds: extraRootIds.sort() };\n        }\n        return obj;\n    };\n    EntityStore.prototype.replace = function (newData) {\n        var _this = this;\n        Object.keys(this.data).forEach(function (dataId) {\n            if (!(newData && hasOwn.call(newData, dataId))) {\n                _this.delete(dataId);\n            }\n        });\n        if (newData) {\n            var __META = newData.__META, rest_1 = __rest(newData, [\"__META\"]);\n            Object.keys(rest_1).forEach(function (dataId) {\n                _this.merge(dataId, rest_1[dataId]);\n            });\n            if (__META) {\n                __META.extraRootIds.forEach(this.retain, this);\n            }\n        }\n    };\n    EntityStore.prototype.retain = function (rootId) {\n        return this.rootIds[rootId] = (this.rootIds[rootId] || 0) + 1;\n    };\n    EntityStore.prototype.release = function (rootId) {\n        if (this.rootIds[rootId] > 0) {\n            var count = --this.rootIds[rootId];\n            if (!count)\n                delete this.rootIds[rootId];\n            return count;\n        }\n        return 0;\n    };\n    EntityStore.prototype.getRootIdSet = function (ids) {\n        if (ids === void 0) { ids = new Set(); }\n        Object.keys(this.rootIds).forEach(ids.add, ids);\n        if (this instanceof Layer) {\n            this.parent.getRootIdSet(ids);\n        }\n        else {\n            Object.keys(this.policies.rootTypenamesById).forEach(ids.add, ids);\n        }\n        return ids;\n    };\n    EntityStore.prototype.gc = function () {\n        var _this = this;\n        var ids = this.getRootIdSet();\n        var snapshot = this.toObject();\n        ids.forEach(function (id) {\n            if (hasOwn.call(snapshot, id)) {\n                Object.keys(_this.findChildRefIds(id)).forEach(ids.add, ids);\n                delete snapshot[id];\n            }\n        });\n        var idsToRemove = Object.keys(snapshot);\n        if (idsToRemove.length) {\n            var root_1 = this;\n            while (root_1 instanceof Layer)\n                root_1 = root_1.parent;\n            idsToRemove.forEach(function (id) { return root_1.delete(id); });\n        }\n        return idsToRemove;\n    };\n    EntityStore.prototype.findChildRefIds = function (dataId) {\n        if (!hasOwn.call(this.refs, dataId)) {\n            var found_1 = this.refs[dataId] = Object.create(null);\n            var root = this.data[dataId];\n            if (!root)\n                return found_1;\n            var workSet_1 = new Set([root]);\n            workSet_1.forEach(function (obj) {\n                if (isReference(obj)) {\n                    found_1[obj.__ref] = true;\n                }\n                if (isNonNullObject(obj)) {\n                    Object.keys(obj).forEach(function (key) {\n                        var child = obj[key];\n                        if (isNonNullObject(child)) {\n                            workSet_1.add(child);\n                        }\n                    });\n                }\n            });\n        }\n        return this.refs[dataId];\n    };\n    EntityStore.prototype.makeCacheKey = function () {\n        return this.group.keyMaker.lookupArray(arguments);\n    };\n    return EntityStore;\n}());\nexport { EntityStore };\nvar CacheGroup = (function () {\n    function CacheGroup(caching, parent) {\n        if (parent === void 0) { parent = null; }\n        this.caching = caching;\n        this.parent = parent;\n        this.d = null;\n        this.resetCaching();\n    }\n    CacheGroup.prototype.resetCaching = function () {\n        this.d = this.caching ? dep() : null;\n        this.keyMaker = new Trie(canUseWeakMap);\n    };\n    CacheGroup.prototype.depend = function (dataId, storeFieldName) {\n        if (this.d) {\n            this.d(makeDepKey(dataId, storeFieldName));\n            var fieldName = fieldNameFromStoreName(storeFieldName);\n            if (fieldName !== storeFieldName) {\n                this.d(makeDepKey(dataId, fieldName));\n            }\n            if (this.parent) {\n                this.parent.depend(dataId, storeFieldName);\n            }\n        }\n    };\n    CacheGroup.prototype.dirty = function (dataId, storeFieldName) {\n        if (this.d) {\n            this.d.dirty(makeDepKey(dataId, storeFieldName), storeFieldName === \"__exists\" ? \"forget\" : \"setDirty\");\n        }\n    };\n    return CacheGroup;\n}());\nfunction makeDepKey(dataId, storeFieldName) {\n    return storeFieldName + '#' + dataId;\n}\nexport function maybeDependOnExistenceOfEntity(store, entityId) {\n    if (supportsResultCaching(store)) {\n        store.group.depend(entityId, \"__exists\");\n    }\n}\n(function (EntityStore) {\n    var Root = (function (_super) {\n        __extends(Root, _super);\n        function Root(_a) {\n            var policies = _a.policies, _b = _a.resultCaching, resultCaching = _b === void 0 ? true : _b, seed = _a.seed;\n            var _this = _super.call(this, policies, new CacheGroup(resultCaching)) || this;\n            _this.stump = new Stump(_this);\n            _this.storageTrie = new Trie(canUseWeakMap);\n            if (seed)\n                _this.replace(seed);\n            return _this;\n        }\n        Root.prototype.addLayer = function (layerId, replay) {\n            return this.stump.addLayer(layerId, replay);\n        };\n        Root.prototype.removeLayer = function () {\n            return this;\n        };\n        Root.prototype.getStorage = function () {\n            return this.storageTrie.lookupArray(arguments);\n        };\n        return Root;\n    }(EntityStore));\n    EntityStore.Root = Root;\n})(EntityStore || (EntityStore = {}));\nvar Layer = (function (_super) {\n    __extends(Layer, _super);\n    function Layer(id, parent, replay, group) {\n        var _this = _super.call(this, parent.policies, group) || this;\n        _this.id = id;\n        _this.parent = parent;\n        _this.replay = replay;\n        _this.group = group;\n        replay(_this);\n        return _this;\n    }\n    Layer.prototype.addLayer = function (layerId, replay) {\n        return new Layer(layerId, this, replay, this.group);\n    };\n    Layer.prototype.removeLayer = function (layerId) {\n        var _this = this;\n        var parent = this.parent.removeLayer(layerId);\n        if (layerId === this.id) {\n            if (this.group.caching) {\n                Object.keys(this.data).forEach(function (dataId) {\n                    var ownStoreObject = _this.data[dataId];\n                    var parentStoreObject = parent[\"lookup\"](dataId);\n                    if (!parentStoreObject) {\n                        _this.delete(dataId);\n                    }\n                    else if (!ownStoreObject) {\n                        _this.group.dirty(dataId, \"__exists\");\n                        Object.keys(parentStoreObject).forEach(function (storeFieldName) {\n                            _this.group.dirty(dataId, storeFieldName);\n                        });\n                    }\n                    else if (ownStoreObject !== parentStoreObject) {\n                        Object.keys(ownStoreObject).forEach(function (storeFieldName) {\n                            if (!equal(ownStoreObject[storeFieldName], parentStoreObject[storeFieldName])) {\n                                _this.group.dirty(dataId, storeFieldName);\n                            }\n                        });\n                    }\n                });\n            }\n            return parent;\n        }\n        if (parent === this.parent)\n            return this;\n        return parent.addLayer(this.id, this.replay);\n    };\n    Layer.prototype.toObject = function () {\n        return __assign(__assign({}, this.parent.toObject()), this.data);\n    };\n    Layer.prototype.findChildRefIds = function (dataId) {\n        var fromParent = this.parent.findChildRefIds(dataId);\n        return hasOwn.call(this.data, dataId) ? __assign(__assign({}, fromParent), _super.prototype.findChildRefIds.call(this, dataId)) : fromParent;\n    };\n    Layer.prototype.getStorage = function () {\n        var p = this.parent;\n        while (p.parent)\n            p = p.parent;\n        return p.getStorage.apply(p, arguments);\n    };\n    return Layer;\n}(EntityStore));\nvar Stump = (function (_super) {\n    __extends(Stump, _super);\n    function Stump(root) {\n        return _super.call(this, \"EntityStore.Stump\", root, function () { }, new CacheGroup(root.group.caching, root.group)) || this;\n    }\n    Stump.prototype.removeLayer = function () {\n        return this;\n    };\n    Stump.prototype.merge = function () {\n        return this.parent.merge.apply(this.parent, arguments);\n    };\n    return Stump;\n}(Layer));\nfunction storeObjectReconciler(existingObject, incomingObject, property) {\n    var existingValue = existingObject[property];\n    var incomingValue = incomingObject[property];\n    return equal(existingValue, incomingValue) ? existingValue : incomingValue;\n}\nexport function supportsResultCaching(store) {\n    return !!(store instanceof EntityStore && store.group.caching);\n}\n//# sourceMappingURL=entityStore.js.map","import { __assign } from \"tslib\";\nimport { invariant, InvariantError } from \"../../utilities/globals/index.js\";\nimport { wrap } from 'optimism';\nimport { isField, resultKeyNameFromField, isReference, makeReference, createFragmentMap, shouldInclude, addTypenameToDocument, getDefaultValues, getFragmentDefinitions, getMainDefinition, getQueryDefinition, mergeDeepArray, getFragmentFromSelection, maybeDeepFreeze, isNonNullObject, canUseWeakMap, compact, } from \"../../utilities/index.js\";\nimport { maybeDependOnExistenceOfEntity, supportsResultCaching } from \"./entityStore.js\";\nimport { getTypenameFromStoreObject, shouldCanonizeResults } from \"./helpers.js\";\nimport { MissingFieldError } from \"../core/types/common.js\";\nimport { canonicalStringify, ObjectCanon } from \"./object-canon.js\";\n;\nfunction missingFromInvariant(err, context) {\n    return new MissingFieldError(err.message, context.path.slice(), context.query, context.variables);\n}\nfunction execSelectionSetKeyArgs(options) {\n    return [\n        options.selectionSet,\n        options.objectOrReference,\n        options.context,\n        options.context.canonizeResults,\n    ];\n}\nvar StoreReader = (function () {\n    function StoreReader(config) {\n        var _this = this;\n        this.knownResults = new (canUseWeakMap ? WeakMap : Map)();\n        this.config = compact(config, {\n            addTypename: config.addTypename !== false,\n            canonizeResults: shouldCanonizeResults(config),\n        });\n        this.canon = config.canon || new ObjectCanon;\n        this.executeSelectionSet = wrap(function (options) {\n            var _a;\n            var canonizeResults = options.context.canonizeResults;\n            var peekArgs = execSelectionSetKeyArgs(options);\n            peekArgs[3] = !canonizeResults;\n            var other = (_a = _this.executeSelectionSet).peek.apply(_a, peekArgs);\n            if (other) {\n                if (canonizeResults) {\n                    return __assign(__assign({}, other), { result: _this.canon.admit(other.result) });\n                }\n                return other;\n            }\n            maybeDependOnExistenceOfEntity(options.context.store, options.enclosingRef.__ref);\n            return _this.execSelectionSetImpl(options);\n        }, {\n            max: this.config.resultCacheMaxSize,\n            keyArgs: execSelectionSetKeyArgs,\n            makeCacheKey: function (selectionSet, parent, context, canonizeResults) {\n                if (supportsResultCaching(context.store)) {\n                    return context.store.makeCacheKey(selectionSet, isReference(parent) ? parent.__ref : parent, context.varString, canonizeResults);\n                }\n            }\n        });\n        this.executeSubSelectedArray = wrap(function (options) {\n            maybeDependOnExistenceOfEntity(options.context.store, options.enclosingRef.__ref);\n            return _this.execSubSelectedArrayImpl(options);\n        }, {\n            max: this.config.resultCacheMaxSize,\n            makeCacheKey: function (_a) {\n                var field = _a.field, array = _a.array, context = _a.context;\n                if (supportsResultCaching(context.store)) {\n                    return context.store.makeCacheKey(field, array, context.varString);\n                }\n            }\n        });\n    }\n    StoreReader.prototype.resetCanon = function () {\n        this.canon = new ObjectCanon;\n    };\n    StoreReader.prototype.diffQueryAgainstStore = function (_a) {\n        var store = _a.store, query = _a.query, _b = _a.rootId, rootId = _b === void 0 ? 'ROOT_QUERY' : _b, variables = _a.variables, _c = _a.returnPartialData, returnPartialData = _c === void 0 ? true : _c, _d = _a.canonizeResults, canonizeResults = _d === void 0 ? this.config.canonizeResults : _d;\n        var policies = this.config.cache.policies;\n        variables = __assign(__assign({}, getDefaultValues(getQueryDefinition(query))), variables);\n        var rootRef = makeReference(rootId);\n        var execResult = this.executeSelectionSet({\n            selectionSet: getMainDefinition(query).selectionSet,\n            objectOrReference: rootRef,\n            enclosingRef: rootRef,\n            context: {\n                store: store,\n                query: query,\n                policies: policies,\n                variables: variables,\n                varString: canonicalStringify(variables),\n                canonizeResults: canonizeResults,\n                fragmentMap: createFragmentMap(getFragmentDefinitions(query)),\n                path: [],\n            },\n        });\n        var hasMissingFields = execResult.missing && execResult.missing.length > 0;\n        if (hasMissingFields && !returnPartialData) {\n            throw execResult.missing[0];\n        }\n        return {\n            result: execResult.result,\n            missing: execResult.missing,\n            complete: !hasMissingFields,\n        };\n    };\n    StoreReader.prototype.isFresh = function (result, parent, selectionSet, context) {\n        if (supportsResultCaching(context.store) &&\n            this.knownResults.get(result) === selectionSet) {\n            var latest = this.executeSelectionSet.peek(selectionSet, parent, context, this.canon.isKnown(result));\n            if (latest && result === latest.result) {\n                return true;\n            }\n        }\n        return false;\n    };\n    StoreReader.prototype.execSelectionSetImpl = function (_a) {\n        var _this = this;\n        var selectionSet = _a.selectionSet, objectOrReference = _a.objectOrReference, enclosingRef = _a.enclosingRef, context = _a.context;\n        if (isReference(objectOrReference) &&\n            !context.policies.rootTypenamesById[objectOrReference.__ref] &&\n            !context.store.has(objectOrReference.__ref)) {\n            return {\n                result: this.canon.empty,\n                missing: [missingFromInvariant(__DEV__ ? new InvariantError(\"Dangling reference to missing \" + objectOrReference.__ref + \" object\") : new InvariantError(5), context)],\n            };\n        }\n        var variables = context.variables, policies = context.policies, store = context.store;\n        var objectsToMerge = [];\n        var finalResult = { result: null };\n        var typename = store.getFieldValue(objectOrReference, \"__typename\");\n        if (this.config.addTypename &&\n            typeof typename === \"string\" &&\n            !policies.rootIdsByTypename[typename]) {\n            objectsToMerge.push({ __typename: typename });\n        }\n        function getMissing() {\n            return finalResult.missing || (finalResult.missing = []);\n        }\n        function handleMissing(result) {\n            var _a;\n            if (result.missing)\n                (_a = getMissing()).push.apply(_a, result.missing);\n            return result.result;\n        }\n        var workSet = new Set(selectionSet.selections);\n        workSet.forEach(function (selection) {\n            var _a;\n            if (!shouldInclude(selection, variables))\n                return;\n            if (isField(selection)) {\n                var fieldValue = policies.readField({\n                    fieldName: selection.name.value,\n                    field: selection,\n                    variables: context.variables,\n                    from: objectOrReference,\n                }, context);\n                var resultName = resultKeyNameFromField(selection);\n                context.path.push(resultName);\n                if (fieldValue === void 0) {\n                    if (!addTypenameToDocument.added(selection)) {\n                        getMissing().push(missingFromInvariant(__DEV__ ? new InvariantError(\"Can't find field '\" + selection.name.value + \"' on \" + (isReference(objectOrReference)\n                            ? objectOrReference.__ref + \" object\"\n                            : \"object \" + JSON.stringify(objectOrReference, null, 2))) : new InvariantError(6), context));\n                    }\n                }\n                else if (Array.isArray(fieldValue)) {\n                    fieldValue = handleMissing(_this.executeSubSelectedArray({\n                        field: selection,\n                        array: fieldValue,\n                        enclosingRef: enclosingRef,\n                        context: context,\n                    }));\n                }\n                else if (!selection.selectionSet) {\n                    if (context.canonizeResults) {\n                        fieldValue = _this.canon.pass(fieldValue);\n                    }\n                }\n                else if (fieldValue != null) {\n                    fieldValue = handleMissing(_this.executeSelectionSet({\n                        selectionSet: selection.selectionSet,\n                        objectOrReference: fieldValue,\n                        enclosingRef: isReference(fieldValue) ? fieldValue : enclosingRef,\n                        context: context,\n                    }));\n                }\n                if (fieldValue !== void 0) {\n                    objectsToMerge.push((_a = {}, _a[resultName] = fieldValue, _a));\n                }\n                invariant(context.path.pop() === resultName);\n            }\n            else {\n                var fragment = getFragmentFromSelection(selection, context.fragmentMap);\n                if (fragment && policies.fragmentMatches(fragment, typename)) {\n                    fragment.selectionSet.selections.forEach(workSet.add, workSet);\n                }\n            }\n        });\n        var merged = mergeDeepArray(objectsToMerge);\n        finalResult.result = context.canonizeResults\n            ? this.canon.admit(merged)\n            : maybeDeepFreeze(merged);\n        this.knownResults.set(finalResult.result, selectionSet);\n        return finalResult;\n    };\n    StoreReader.prototype.execSubSelectedArrayImpl = function (_a) {\n        var _this = this;\n        var field = _a.field, array = _a.array, enclosingRef = _a.enclosingRef, context = _a.context;\n        var missing;\n        function handleMissing(childResult, i) {\n            if (childResult.missing) {\n                missing = missing || [];\n                missing.push.apply(missing, childResult.missing);\n            }\n            invariant(context.path.pop() === i);\n            return childResult.result;\n        }\n        if (field.selectionSet) {\n            array = array.filter(context.store.canRead);\n        }\n        array = array.map(function (item, i) {\n            if (item === null) {\n                return null;\n            }\n            context.path.push(i);\n            if (Array.isArray(item)) {\n                return handleMissing(_this.executeSubSelectedArray({\n                    field: field,\n                    array: item,\n                    enclosingRef: enclosingRef,\n                    context: context,\n                }), i);\n            }\n            if (field.selectionSet) {\n                return handleMissing(_this.executeSelectionSet({\n                    selectionSet: field.selectionSet,\n                    objectOrReference: item,\n                    enclosingRef: isReference(item) ? item : enclosingRef,\n                    context: context,\n                }), i);\n            }\n            if (__DEV__) {\n                assertSelectionSetForIdValue(context.store, field, item);\n            }\n            invariant(context.path.pop() === i);\n            return item;\n        });\n        return {\n            result: context.canonizeResults ? this.canon.admit(array) : array,\n            missing: missing,\n        };\n    };\n    return StoreReader;\n}());\nexport { StoreReader };\nfunction assertSelectionSetForIdValue(store, field, fieldValue) {\n    if (!field.selectionSet) {\n        var workSet_1 = new Set([fieldValue]);\n        workSet_1.forEach(function (value) {\n            if (isNonNullObject(value)) {\n                __DEV__ ? invariant(!isReference(value), \"Missing selection set for object of type \" + getTypenameFromStoreObject(store, value) + \" returned for query field \" + field.name.value) : invariant(!isReference(value), 7);\n                Object.values(value).forEach(workSet_1.add, workSet_1);\n            }\n        });\n    }\n}\n//# sourceMappingURL=readFromStore.js.map","import { __assign } from \"tslib\";\nimport { invariant, InvariantError } from \"../../utilities/globals/index.js\";\nimport { equal } from '@wry/equality';\nimport { createFragmentMap, getFragmentFromSelection, getDefaultValues, getFragmentDefinitions, getOperationDefinition, getTypenameFromResult, makeReference, isField, resultKeyNameFromField, isReference, shouldInclude, cloneDeep, addTypenameToDocument, } from \"../../utilities/index.js\";\nimport { makeProcessedFieldsMerger, fieldNameFromStoreName, storeValueIsStoreObject } from \"./helpers.js\";\nimport { canonicalStringify } from \"./object-canon.js\";\n;\nvar StoreWriter = (function () {\n    function StoreWriter(cache, reader) {\n        this.cache = cache;\n        this.reader = reader;\n    }\n    StoreWriter.prototype.writeToStore = function (store, _a) {\n        var _this = this;\n        var query = _a.query, result = _a.result, dataId = _a.dataId, variables = _a.variables, overwrite = _a.overwrite;\n        var operationDefinition = getOperationDefinition(query);\n        var merger = makeProcessedFieldsMerger();\n        variables = __assign(__assign({}, getDefaultValues(operationDefinition)), variables);\n        var context = {\n            store: store,\n            written: Object.create(null),\n            merge: function (existing, incoming) {\n                return merger.merge(existing, incoming);\n            },\n            variables: variables,\n            varString: canonicalStringify(variables),\n            fragmentMap: createFragmentMap(getFragmentDefinitions(query)),\n            overwrite: !!overwrite,\n            incomingById: new Map,\n            clientOnly: false,\n        };\n        var ref = this.processSelectionSet({\n            result: result || Object.create(null),\n            dataId: dataId,\n            selectionSet: operationDefinition.selectionSet,\n            mergeTree: { map: new Map },\n            context: context,\n        });\n        if (!isReference(ref)) {\n            throw __DEV__ ? new InvariantError(\"Could not identify object \" + JSON.stringify(result)) : new InvariantError(8);\n        }\n        context.incomingById.forEach(function (_a, dataId) {\n            var fields = _a.fields, mergeTree = _a.mergeTree, selections = _a.selections;\n            var entityRef = makeReference(dataId);\n            if (mergeTree && mergeTree.map.size) {\n                var applied = _this.applyMerges(mergeTree, entityRef, fields, context);\n                if (isReference(applied)) {\n                    return;\n                }\n                fields = applied;\n            }\n            if (__DEV__ && !context.overwrite) {\n                var hasSelectionSet_1 = function (storeFieldName) {\n                    return fieldsWithSelectionSets_1.has(fieldNameFromStoreName(storeFieldName));\n                };\n                var fieldsWithSelectionSets_1 = new Set();\n                selections.forEach(function (selection) {\n                    if (isField(selection) && selection.selectionSet) {\n                        fieldsWithSelectionSets_1.add(selection.name.value);\n                    }\n                });\n                var hasMergeFunction_1 = function (storeFieldName) {\n                    var childTree = mergeTree && mergeTree.map.get(storeFieldName);\n                    return Boolean(childTree && childTree.info && childTree.info.merge);\n                };\n                Object.keys(fields).forEach(function (storeFieldName) {\n                    if (hasSelectionSet_1(storeFieldName) &&\n                        !hasMergeFunction_1(storeFieldName)) {\n                        warnAboutDataLoss(entityRef, fields, storeFieldName, context.store);\n                    }\n                });\n            }\n            store.merge(dataId, fields);\n        });\n        store.retain(ref.__ref);\n        return ref;\n    };\n    StoreWriter.prototype.processSelectionSet = function (_a) {\n        var _this = this;\n        var dataId = _a.dataId, result = _a.result, selectionSet = _a.selectionSet, context = _a.context, mergeTree = _a.mergeTree;\n        var policies = this.cache.policies;\n        var _b = policies.identify(result, selectionSet, context.fragmentMap), id = _b[0], keyObject = _b[1];\n        dataId = dataId || id;\n        if (\"string\" === typeof dataId) {\n            var sets = context.written[dataId] || (context.written[dataId] = []);\n            var ref = makeReference(dataId);\n            if (sets.indexOf(selectionSet) >= 0)\n                return ref;\n            sets.push(selectionSet);\n            if (this.reader && this.reader.isFresh(result, ref, selectionSet, context)) {\n                return ref;\n            }\n        }\n        var incomingFields = Object.create(null);\n        if (keyObject) {\n            incomingFields = context.merge(incomingFields, keyObject);\n        }\n        var typename = (dataId && policies.rootTypenamesById[dataId]) ||\n            getTypenameFromResult(result, selectionSet, context.fragmentMap) ||\n            (dataId && context.store.get(dataId, \"__typename\"));\n        if (\"string\" === typeof typename) {\n            incomingFields.__typename = typename;\n        }\n        var selections = new Set(selectionSet.selections);\n        selections.forEach(function (selection) {\n            var _a;\n            if (!shouldInclude(selection, context.variables))\n                return;\n            if (isField(selection)) {\n                var resultFieldKey = resultKeyNameFromField(selection);\n                var value = result[resultFieldKey];\n                var wasClientOnly = context.clientOnly;\n                context.clientOnly = wasClientOnly || !!(selection.directives &&\n                    selection.directives.some(function (d) { return d.name.value === \"client\"; }));\n                if (value !== void 0) {\n                    var storeFieldName = policies.getStoreFieldName({\n                        typename: typename,\n                        fieldName: selection.name.value,\n                        field: selection,\n                        variables: context.variables,\n                    });\n                    var childTree = getChildMergeTree(mergeTree, storeFieldName);\n                    var incomingValue = _this.processFieldValue(value, selection, context, childTree);\n                    var childTypename = void 0;\n                    if (selection.selectionSet) {\n                        childTypename = context.store.getFieldValue(incomingValue, \"__typename\");\n                        if (!childTypename && isReference(incomingValue)) {\n                            var info = context.incomingById.get(incomingValue.__ref);\n                            childTypename = info && info.fields.__typename;\n                        }\n                    }\n                    var merge = policies.getMergeFunction(typename, selection.name.value, childTypename);\n                    if (merge) {\n                        childTree.info = {\n                            field: selection,\n                            typename: typename,\n                            merge: merge,\n                        };\n                    }\n                    else {\n                        maybeRecycleChildMergeTree(mergeTree, storeFieldName);\n                    }\n                    incomingFields = context.merge(incomingFields, (_a = {},\n                        _a[storeFieldName] = incomingValue,\n                        _a));\n                }\n                else if (!context.clientOnly &&\n                    !addTypenameToDocument.added(selection)) {\n                    __DEV__ && invariant.error((\"Missing field '\" + resultKeyNameFromField(selection) + \"' while writing result \" + JSON.stringify(result, null, 2)).substring(0, 1000));\n                }\n                context.clientOnly = wasClientOnly;\n            }\n            else {\n                var fragment = getFragmentFromSelection(selection, context.fragmentMap);\n                if (fragment &&\n                    policies.fragmentMatches(fragment, typename, result, context.variables)) {\n                    fragment.selectionSet.selections.forEach(selections.add, selections);\n                }\n            }\n        });\n        if (\"string\" === typeof dataId) {\n            var previous = context.incomingById.get(dataId);\n            if (previous) {\n                previous.fields = context.merge(previous.fields, incomingFields);\n                previous.mergeTree = mergeMergeTrees(previous.mergeTree, mergeTree);\n                previous.selections.forEach(selections.add, selections);\n                previous.selections = selections;\n            }\n            else {\n                context.incomingById.set(dataId, {\n                    fields: incomingFields,\n                    mergeTree: mergeTreeIsEmpty(mergeTree) ? void 0 : mergeTree,\n                    selections: selections,\n                });\n            }\n            return makeReference(dataId);\n        }\n        return incomingFields;\n    };\n    StoreWriter.prototype.processFieldValue = function (value, field, context, mergeTree) {\n        var _this = this;\n        if (!field.selectionSet || value === null) {\n            return __DEV__ ? cloneDeep(value) : value;\n        }\n        if (Array.isArray(value)) {\n            return value.map(function (item, i) {\n                var value = _this.processFieldValue(item, field, context, getChildMergeTree(mergeTree, i));\n                maybeRecycleChildMergeTree(mergeTree, i);\n                return value;\n            });\n        }\n        return this.processSelectionSet({\n            result: value,\n            selectionSet: field.selectionSet,\n            context: context,\n            mergeTree: mergeTree,\n        });\n    };\n    StoreWriter.prototype.applyMerges = function (mergeTree, existing, incoming, context, getStorageArgs) {\n        var _a;\n        var _this = this;\n        if (mergeTree.map.size && !isReference(incoming)) {\n            var e_1 = (!Array.isArray(incoming) &&\n                (isReference(existing) || storeValueIsStoreObject(existing))) ? existing : void 0;\n            var i_1 = incoming;\n            if (e_1 && !getStorageArgs) {\n                getStorageArgs = [isReference(e_1) ? e_1.__ref : e_1];\n            }\n            var changedFields_1;\n            var getValue_1 = function (from, name) {\n                return Array.isArray(from)\n                    ? (typeof name === \"number\" ? from[name] : void 0)\n                    : context.store.getFieldValue(from, String(name));\n            };\n            mergeTree.map.forEach(function (childTree, storeFieldName) {\n                var eVal = getValue_1(e_1, storeFieldName);\n                var iVal = getValue_1(i_1, storeFieldName);\n                if (void 0 === iVal)\n                    return;\n                if (getStorageArgs) {\n                    getStorageArgs.push(storeFieldName);\n                }\n                var aVal = _this.applyMerges(childTree, eVal, iVal, context, getStorageArgs);\n                if (aVal !== iVal) {\n                    changedFields_1 = changedFields_1 || new Map;\n                    changedFields_1.set(storeFieldName, aVal);\n                }\n                if (getStorageArgs) {\n                    invariant(getStorageArgs.pop() === storeFieldName);\n                }\n            });\n            if (changedFields_1) {\n                incoming = (Array.isArray(i_1) ? i_1.slice(0) : __assign({}, i_1));\n                changedFields_1.forEach(function (value, name) {\n                    incoming[name] = value;\n                });\n            }\n        }\n        if (mergeTree.info) {\n            return this.cache.policies.runMergeFunction(existing, incoming, mergeTree.info, context, getStorageArgs && (_a = context.store).getStorage.apply(_a, getStorageArgs));\n        }\n        return incoming;\n    };\n    return StoreWriter;\n}());\nexport { StoreWriter };\nvar emptyMergeTreePool = [];\nfunction getChildMergeTree(_a, name) {\n    var map = _a.map;\n    if (!map.has(name)) {\n        map.set(name, emptyMergeTreePool.pop() || { map: new Map });\n    }\n    return map.get(name);\n}\nfunction mergeMergeTrees(left, right) {\n    if (left === right || !right || mergeTreeIsEmpty(right))\n        return left;\n    if (!left || mergeTreeIsEmpty(left))\n        return right;\n    var info = left.info && right.info ? __assign(__assign({}, left.info), right.info) : left.info || right.info;\n    var needToMergeMaps = left.map.size && right.map.size;\n    var map = needToMergeMaps ? new Map :\n        left.map.size ? left.map : right.map;\n    var merged = { info: info, map: map };\n    if (needToMergeMaps) {\n        var remainingRightKeys_1 = new Set(right.map.keys());\n        left.map.forEach(function (leftTree, key) {\n            merged.map.set(key, mergeMergeTrees(leftTree, right.map.get(key)));\n            remainingRightKeys_1.delete(key);\n        });\n        remainingRightKeys_1.forEach(function (key) {\n            merged.map.set(key, mergeMergeTrees(right.map.get(key), left.map.get(key)));\n        });\n    }\n    return merged;\n}\nfunction mergeTreeIsEmpty(tree) {\n    return !tree || !(tree.info || tree.map.size);\n}\nfunction maybeRecycleChildMergeTree(_a, name) {\n    var map = _a.map;\n    var childTree = map.get(name);\n    if (childTree && mergeTreeIsEmpty(childTree)) {\n        emptyMergeTreePool.push(childTree);\n        map.delete(name);\n    }\n}\nvar warnings = new Set();\nfunction warnAboutDataLoss(existingRef, incomingObj, storeFieldName, store) {\n    var getChild = function (objOrRef) {\n        var child = store.getFieldValue(objOrRef, storeFieldName);\n        return typeof child === \"object\" && child;\n    };\n    var existing = getChild(existingRef);\n    if (!existing)\n        return;\n    var incoming = getChild(incomingObj);\n    if (!incoming)\n        return;\n    if (isReference(existing))\n        return;\n    if (equal(existing, incoming))\n        return;\n    if (Object.keys(existing).every(function (key) { return store.getFieldValue(incoming, key) !== void 0; })) {\n        return;\n    }\n    var parentType = store.getFieldValue(existingRef, \"__typename\") ||\n        store.getFieldValue(incomingObj, \"__typename\");\n    var fieldName = fieldNameFromStoreName(storeFieldName);\n    var typeDotName = parentType + \".\" + fieldName;\n    if (warnings.has(typeDotName))\n        return;\n    warnings.add(typeDotName);\n    var childTypenames = [];\n    if (!Array.isArray(existing) &&\n        !Array.isArray(incoming)) {\n        [existing, incoming].forEach(function (child) {\n            var typename = store.getFieldValue(child, \"__typename\");\n            if (typeof typename === \"string\" &&\n                !childTypenames.includes(typename)) {\n                childTypenames.push(typename);\n            }\n        });\n    }\n    __DEV__ && invariant.warn(\"Cache data may be lost when replacing the \" + fieldName + \" field of a \" + parentType + \" object.\\n\\nTo address this problem (which is not a bug in Apollo Client), \" + (childTypenames.length\n        ? \"either ensure all objects of type \" +\n            childTypenames.join(\" and \") + \" have an ID or a custom merge function, or \"\n        : \"\") + \"define a custom merge function for the \" + typeDotName + \" field, so InMemoryCache can safely merge these objects:\\n\\n  existing: \" + JSON.stringify(existing).slice(0, 1000) + \"\\n  incoming: \" + JSON.stringify(incoming).slice(0, 1000) + \"\\n\\nFor more information about these options, please refer to the documentation:\\n\\n  * Ensuring entity objects have IDs: https://go.apollo.dev/c/generating-unique-identifiers\\n  * Defining custom merge functions: https://go.apollo.dev/c/merging-non-normalized-objects\\n\");\n}\n//# sourceMappingURL=writeToStore.js.map","import { makeUniqueId } from \"./makeUniqueId.js\";\nexport function stringifyForDisplay(value) {\n    var undefId = makeUniqueId(\"stringifyForDisplay\");\n    return JSON.stringify(value, function (key, value) {\n        return value === void 0 ? undefId : value;\n    }).split(JSON.stringify(undefId)).join(\"<undefined>\");\n}\n//# sourceMappingURL=stringifyForDisplay.js.map","import { __assign, __rest } from \"tslib\";\nimport { invariant, InvariantError } from \"../../utilities/globals/index.js\";\nimport { Trie } from '@wry/trie';\nimport { getFragmentFromSelection, isField, getTypenameFromResult, storeKeyNameFromField, argumentsObjectFromField, isReference, getStoreKeyName, canUseWeakMap, isNonNullObject, stringifyForDisplay, } from \"../../utilities/index.js\";\nimport { hasOwn, fieldNameFromStoreName, storeValueIsStoreObject, selectionSetMatchesResult, TypeOrFieldNameRegExp, defaultDataIdFromObject, } from \"./helpers.js\";\nimport { cacheSlot } from \"./reactiveVars.js\";\nimport { canonicalStringify } from \"./object-canon.js\";\ngetStoreKeyName.setStringify(canonicalStringify);\nfunction argsFromFieldSpecifier(spec) {\n    return spec.args !== void 0 ? spec.args :\n        spec.field ? argumentsObjectFromField(spec.field, spec.variables) : null;\n}\nvar nullKeyFieldsFn = function () { return void 0; };\nvar simpleKeyArgsFn = function (_args, context) { return context.fieldName; };\nvar mergeTrueFn = function (existing, incoming, _a) {\n    var mergeObjects = _a.mergeObjects;\n    return mergeObjects(existing, incoming);\n};\nvar mergeFalseFn = function (_, incoming) { return incoming; };\nvar Policies = (function () {\n    function Policies(config) {\n        this.config = config;\n        this.typePolicies = Object.create(null);\n        this.toBeAdded = Object.create(null);\n        this.supertypeMap = new Map();\n        this.fuzzySubtypes = new Map();\n        this.rootIdsByTypename = Object.create(null);\n        this.rootTypenamesById = Object.create(null);\n        this.usingPossibleTypes = false;\n        this.config = __assign({ dataIdFromObject: defaultDataIdFromObject }, config);\n        this.cache = this.config.cache;\n        this.setRootTypename(\"Query\");\n        this.setRootTypename(\"Mutation\");\n        this.setRootTypename(\"Subscription\");\n        if (config.possibleTypes) {\n            this.addPossibleTypes(config.possibleTypes);\n        }\n        if (config.typePolicies) {\n            this.addTypePolicies(config.typePolicies);\n        }\n    }\n    Policies.prototype.identify = function (object, selectionSet, fragmentMap) {\n        var typename = selectionSet && fragmentMap\n            ? getTypenameFromResult(object, selectionSet, fragmentMap)\n            : object.__typename;\n        if (typename === this.rootTypenamesById.ROOT_QUERY) {\n            return [\"ROOT_QUERY\"];\n        }\n        var context = {\n            typename: typename,\n            selectionSet: selectionSet,\n            fragmentMap: fragmentMap,\n        };\n        var id;\n        var policy = typename && this.getTypePolicy(typename);\n        var keyFn = policy && policy.keyFn || this.config.dataIdFromObject;\n        while (keyFn) {\n            var specifierOrId = keyFn(object, context);\n            if (Array.isArray(specifierOrId)) {\n                keyFn = keyFieldsFnFromSpecifier(specifierOrId);\n            }\n            else {\n                id = specifierOrId;\n                break;\n            }\n        }\n        id = id ? String(id) : void 0;\n        return context.keyObject ? [id, context.keyObject] : [id];\n    };\n    Policies.prototype.addTypePolicies = function (typePolicies) {\n        var _this = this;\n        Object.keys(typePolicies).forEach(function (typename) {\n            var _a = typePolicies[typename], queryType = _a.queryType, mutationType = _a.mutationType, subscriptionType = _a.subscriptionType, incoming = __rest(_a, [\"queryType\", \"mutationType\", \"subscriptionType\"]);\n            if (queryType)\n                _this.setRootTypename(\"Query\", typename);\n            if (mutationType)\n                _this.setRootTypename(\"Mutation\", typename);\n            if (subscriptionType)\n                _this.setRootTypename(\"Subscription\", typename);\n            if (hasOwn.call(_this.toBeAdded, typename)) {\n                _this.toBeAdded[typename].push(incoming);\n            }\n            else {\n                _this.toBeAdded[typename] = [incoming];\n            }\n        });\n    };\n    Policies.prototype.updateTypePolicy = function (typename, incoming) {\n        var _this = this;\n        var existing = this.getTypePolicy(typename);\n        var keyFields = incoming.keyFields, fields = incoming.fields;\n        function setMerge(existing, merge) {\n            existing.merge =\n                typeof merge === \"function\" ? merge :\n                    merge === true ? mergeTrueFn :\n                        merge === false ? mergeFalseFn :\n                            existing.merge;\n        }\n        setMerge(existing, incoming.merge);\n        existing.keyFn =\n            keyFields === false ? nullKeyFieldsFn :\n                Array.isArray(keyFields) ? keyFieldsFnFromSpecifier(keyFields) :\n                    typeof keyFields === \"function\" ? keyFields :\n                        existing.keyFn;\n        if (fields) {\n            Object.keys(fields).forEach(function (fieldName) {\n                var existing = _this.getFieldPolicy(typename, fieldName, true);\n                var incoming = fields[fieldName];\n                if (typeof incoming === \"function\") {\n                    existing.read = incoming;\n                }\n                else {\n                    var keyArgs = incoming.keyArgs, read = incoming.read, merge = incoming.merge;\n                    existing.keyFn =\n                        keyArgs === false ? simpleKeyArgsFn :\n                            Array.isArray(keyArgs) ? keyArgsFnFromSpecifier(keyArgs) :\n                                typeof keyArgs === \"function\" ? keyArgs :\n                                    existing.keyFn;\n                    if (typeof read === \"function\") {\n                        existing.read = read;\n                    }\n                    setMerge(existing, merge);\n                }\n                if (existing.read && existing.merge) {\n                    existing.keyFn = existing.keyFn || simpleKeyArgsFn;\n                }\n            });\n        }\n    };\n    Policies.prototype.setRootTypename = function (which, typename) {\n        if (typename === void 0) { typename = which; }\n        var rootId = \"ROOT_\" + which.toUpperCase();\n        var old = this.rootTypenamesById[rootId];\n        if (typename !== old) {\n            __DEV__ ? invariant(!old || old === which, \"Cannot change root \" + which + \" __typename more than once\") : invariant(!old || old === which, 2);\n            if (old)\n                delete this.rootIdsByTypename[old];\n            this.rootIdsByTypename[typename] = rootId;\n            this.rootTypenamesById[rootId] = typename;\n        }\n    };\n    Policies.prototype.addPossibleTypes = function (possibleTypes) {\n        var _this = this;\n        this.usingPossibleTypes = true;\n        Object.keys(possibleTypes).forEach(function (supertype) {\n            _this.getSupertypeSet(supertype, true);\n            possibleTypes[supertype].forEach(function (subtype) {\n                _this.getSupertypeSet(subtype, true).add(supertype);\n                var match = subtype.match(TypeOrFieldNameRegExp);\n                if (!match || match[0] !== subtype) {\n                    _this.fuzzySubtypes.set(subtype, new RegExp(subtype));\n                }\n            });\n        });\n    };\n    Policies.prototype.getTypePolicy = function (typename) {\n        var _this = this;\n        if (!hasOwn.call(this.typePolicies, typename)) {\n            var policy_1 = this.typePolicies[typename] = Object.create(null);\n            policy_1.fields = Object.create(null);\n            var supertypes = this.supertypeMap.get(typename);\n            if (supertypes && supertypes.size) {\n                supertypes.forEach(function (supertype) {\n                    var _a = _this.getTypePolicy(supertype), fields = _a.fields, rest = __rest(_a, [\"fields\"]);\n                    Object.assign(policy_1, rest);\n                    Object.assign(policy_1.fields, fields);\n                });\n            }\n        }\n        var inbox = this.toBeAdded[typename];\n        if (inbox && inbox.length) {\n            inbox.splice(0).forEach(function (policy) {\n                _this.updateTypePolicy(typename, policy);\n            });\n        }\n        return this.typePolicies[typename];\n    };\n    Policies.prototype.getFieldPolicy = function (typename, fieldName, createIfMissing) {\n        if (typename) {\n            var fieldPolicies = this.getTypePolicy(typename).fields;\n            return fieldPolicies[fieldName] || (createIfMissing && (fieldPolicies[fieldName] = Object.create(null)));\n        }\n    };\n    Policies.prototype.getSupertypeSet = function (subtype, createIfMissing) {\n        var supertypeSet = this.supertypeMap.get(subtype);\n        if (!supertypeSet && createIfMissing) {\n            this.supertypeMap.set(subtype, supertypeSet = new Set());\n        }\n        return supertypeSet;\n    };\n    Policies.prototype.fragmentMatches = function (fragment, typename, result, variables) {\n        var _this = this;\n        if (!fragment.typeCondition)\n            return true;\n        if (!typename)\n            return false;\n        var supertype = fragment.typeCondition.name.value;\n        if (typename === supertype)\n            return true;\n        if (this.usingPossibleTypes &&\n            this.supertypeMap.has(supertype)) {\n            var typenameSupertypeSet = this.getSupertypeSet(typename, true);\n            var workQueue_1 = [typenameSupertypeSet];\n            var maybeEnqueue_1 = function (subtype) {\n                var supertypeSet = _this.getSupertypeSet(subtype, false);\n                if (supertypeSet &&\n                    supertypeSet.size &&\n                    workQueue_1.indexOf(supertypeSet) < 0) {\n                    workQueue_1.push(supertypeSet);\n                }\n            };\n            var needToCheckFuzzySubtypes = !!(result && this.fuzzySubtypes.size);\n            var checkingFuzzySubtypes = false;\n            for (var i = 0; i < workQueue_1.length; ++i) {\n                var supertypeSet = workQueue_1[i];\n                if (supertypeSet.has(supertype)) {\n                    if (!typenameSupertypeSet.has(supertype)) {\n                        if (checkingFuzzySubtypes) {\n                            __DEV__ && invariant.warn(\"Inferring subtype \" + typename + \" of supertype \" + supertype);\n                        }\n                        typenameSupertypeSet.add(supertype);\n                    }\n                    return true;\n                }\n                supertypeSet.forEach(maybeEnqueue_1);\n                if (needToCheckFuzzySubtypes &&\n                    i === workQueue_1.length - 1 &&\n                    selectionSetMatchesResult(fragment.selectionSet, result, variables)) {\n                    needToCheckFuzzySubtypes = false;\n                    checkingFuzzySubtypes = true;\n                    this.fuzzySubtypes.forEach(function (regExp, fuzzyString) {\n                        var match = typename.match(regExp);\n                        if (match && match[0] === typename) {\n                            maybeEnqueue_1(fuzzyString);\n                        }\n                    });\n                }\n            }\n        }\n        return false;\n    };\n    Policies.prototype.hasKeyArgs = function (typename, fieldName) {\n        var policy = this.getFieldPolicy(typename, fieldName, false);\n        return !!(policy && policy.keyFn);\n    };\n    Policies.prototype.getStoreFieldName = function (fieldSpec) {\n        var typename = fieldSpec.typename, fieldName = fieldSpec.fieldName;\n        var policy = this.getFieldPolicy(typename, fieldName, false);\n        var storeFieldName;\n        var keyFn = policy && policy.keyFn;\n        if (keyFn && typename) {\n            var context = {\n                typename: typename,\n                fieldName: fieldName,\n                field: fieldSpec.field || null,\n                variables: fieldSpec.variables,\n            };\n            var args = argsFromFieldSpecifier(fieldSpec);\n            while (keyFn) {\n                var specifierOrString = keyFn(args, context);\n                if (Array.isArray(specifierOrString)) {\n                    keyFn = keyArgsFnFromSpecifier(specifierOrString);\n                }\n                else {\n                    storeFieldName = specifierOrString || fieldName;\n                    break;\n                }\n            }\n        }\n        if (storeFieldName === void 0) {\n            storeFieldName = fieldSpec.field\n                ? storeKeyNameFromField(fieldSpec.field, fieldSpec.variables)\n                : getStoreKeyName(fieldName, argsFromFieldSpecifier(fieldSpec));\n        }\n        if (storeFieldName === false) {\n            return fieldName;\n        }\n        return fieldName === fieldNameFromStoreName(storeFieldName)\n            ? storeFieldName\n            : fieldName + \":\" + storeFieldName;\n    };\n    Policies.prototype.readField = function (options, context) {\n        var objectOrReference = options.from;\n        if (!objectOrReference)\n            return;\n        var nameOrField = options.field || options.fieldName;\n        if (!nameOrField)\n            return;\n        if (options.typename === void 0) {\n            var typename = context.store.getFieldValue(objectOrReference, \"__typename\");\n            if (typename)\n                options.typename = typename;\n        }\n        var storeFieldName = this.getStoreFieldName(options);\n        var fieldName = fieldNameFromStoreName(storeFieldName);\n        var existing = context.store.getFieldValue(objectOrReference, storeFieldName);\n        var policy = this.getFieldPolicy(options.typename, fieldName, false);\n        var read = policy && policy.read;\n        if (read) {\n            var readOptions = makeFieldFunctionOptions(this, objectOrReference, options, context, context.store.getStorage(isReference(objectOrReference)\n                ? objectOrReference.__ref\n                : objectOrReference, storeFieldName));\n            return cacheSlot.withValue(this.cache, read, [existing, readOptions]);\n        }\n        return existing;\n    };\n    Policies.prototype.getMergeFunction = function (parentTypename, fieldName, childTypename) {\n        var policy = this.getFieldPolicy(parentTypename, fieldName, false);\n        var merge = policy && policy.merge;\n        if (!merge && childTypename) {\n            policy = this.getTypePolicy(childTypename);\n            merge = policy && policy.merge;\n        }\n        return merge;\n    };\n    Policies.prototype.runMergeFunction = function (existing, incoming, _a, context, storage) {\n        var field = _a.field, typename = _a.typename, merge = _a.merge;\n        if (merge === mergeTrueFn) {\n            return makeMergeObjectsFunction(context.store)(existing, incoming);\n        }\n        if (merge === mergeFalseFn) {\n            return incoming;\n        }\n        if (context.overwrite) {\n            existing = void 0;\n        }\n        return merge(existing, incoming, makeFieldFunctionOptions(this, void 0, { typename: typename, fieldName: field.name.value, field: field, variables: context.variables }, context, storage || Object.create(null)));\n    };\n    return Policies;\n}());\nexport { Policies };\nfunction makeFieldFunctionOptions(policies, objectOrReference, fieldSpec, context, storage) {\n    var storeFieldName = policies.getStoreFieldName(fieldSpec);\n    var fieldName = fieldNameFromStoreName(storeFieldName);\n    var variables = fieldSpec.variables || context.variables;\n    var _a = context.store, toReference = _a.toReference, canRead = _a.canRead;\n    return {\n        args: argsFromFieldSpecifier(fieldSpec),\n        field: fieldSpec.field || null,\n        fieldName: fieldName,\n        storeFieldName: storeFieldName,\n        variables: variables,\n        isReference: isReference,\n        toReference: toReference,\n        storage: storage,\n        cache: policies.cache,\n        canRead: canRead,\n        readField: function (fieldNameOrOptions, from) {\n            var options;\n            if (typeof fieldNameOrOptions === \"string\") {\n                options = {\n                    fieldName: fieldNameOrOptions,\n                    from: arguments.length > 1 ? from : objectOrReference,\n                };\n            }\n            else if (isNonNullObject(fieldNameOrOptions)) {\n                options = __assign({}, fieldNameOrOptions);\n                if (!hasOwn.call(fieldNameOrOptions, \"from\")) {\n                    options.from = objectOrReference;\n                }\n            }\n            else {\n                __DEV__ && invariant.warn(\"Unexpected readField arguments: \" + stringifyForDisplay(Array.from(arguments)));\n                return;\n            }\n            if (__DEV__ && options.from === void 0) {\n                __DEV__ && invariant.warn(\"Undefined 'from' passed to readField with arguments \" + stringifyForDisplay(Array.from(arguments)));\n            }\n            if (void 0 === options.variables) {\n                options.variables = variables;\n            }\n            return policies.readField(options, context);\n        },\n        mergeObjects: makeMergeObjectsFunction(context.store),\n    };\n}\nfunction makeMergeObjectsFunction(store) {\n    return function mergeObjects(existing, incoming) {\n        if (Array.isArray(existing) || Array.isArray(incoming)) {\n            throw __DEV__ ? new InvariantError(\"Cannot automatically merge arrays\") : new InvariantError(3);\n        }\n        if (isNonNullObject(existing) &&\n            isNonNullObject(incoming)) {\n            var eType = store.getFieldValue(existing, \"__typename\");\n            var iType = store.getFieldValue(incoming, \"__typename\");\n            var typesDiffer = eType && iType && eType !== iType;\n            if (typesDiffer) {\n                return incoming;\n            }\n            if (isReference(existing) &&\n                storeValueIsStoreObject(incoming)) {\n                store.merge(existing.__ref, incoming);\n                return existing;\n            }\n            if (storeValueIsStoreObject(existing) &&\n                isReference(incoming)) {\n                store.merge(existing, incoming.__ref);\n                return incoming;\n            }\n            if (storeValueIsStoreObject(existing) &&\n                storeValueIsStoreObject(incoming)) {\n                return __assign(__assign({}, existing), incoming);\n            }\n        }\n        return incoming;\n    };\n}\nfunction keyArgsFnFromSpecifier(specifier) {\n    return function (args, context) {\n        return args ? context.fieldName + \":\" + JSON.stringify(computeKeyObject(args, specifier, false)) : context.fieldName;\n    };\n}\nfunction keyFieldsFnFromSpecifier(specifier) {\n    var trie = new Trie(canUseWeakMap);\n    return function (object, context) {\n        var aliasMap;\n        if (context.selectionSet && context.fragmentMap) {\n            var info = trie.lookupArray([\n                context.selectionSet,\n                context.fragmentMap,\n            ]);\n            aliasMap = info.aliasMap || (info.aliasMap = makeAliasMap(context.selectionSet, context.fragmentMap));\n        }\n        var keyObject = context.keyObject =\n            computeKeyObject(object, specifier, true, aliasMap);\n        return context.typename + \":\" + JSON.stringify(keyObject);\n    };\n}\nfunction makeAliasMap(selectionSet, fragmentMap) {\n    var map = Object.create(null);\n    var workQueue = new Set([selectionSet]);\n    workQueue.forEach(function (selectionSet) {\n        selectionSet.selections.forEach(function (selection) {\n            if (isField(selection)) {\n                if (selection.alias) {\n                    var responseKey = selection.alias.value;\n                    var storeKey = selection.name.value;\n                    if (storeKey !== responseKey) {\n                        var aliases = map.aliases || (map.aliases = Object.create(null));\n                        aliases[storeKey] = responseKey;\n                    }\n                }\n                if (selection.selectionSet) {\n                    var subsets = map.subsets || (map.subsets = Object.create(null));\n                    subsets[selection.name.value] =\n                        makeAliasMap(selection.selectionSet, fragmentMap);\n                }\n            }\n            else {\n                var fragment = getFragmentFromSelection(selection, fragmentMap);\n                if (fragment) {\n                    workQueue.add(fragment.selectionSet);\n                }\n            }\n        });\n    });\n    return map;\n}\nfunction computeKeyObject(response, specifier, strict, aliasMap) {\n    var keyObj = Object.create(null);\n    var lastResponseKey;\n    var lastActualKey;\n    specifier.forEach(function (s) {\n        if (Array.isArray(s)) {\n            if (typeof lastActualKey === \"string\" &&\n                typeof lastResponseKey === \"string\") {\n                var subsets = aliasMap && aliasMap.subsets;\n                var subset = subsets && subsets[lastActualKey];\n                keyObj[lastActualKey] =\n                    computeKeyObject(response[lastResponseKey], s, strict, subset);\n            }\n        }\n        else {\n            var aliases = aliasMap && aliasMap.aliases;\n            var responseName = aliases && aliases[s] || s;\n            if (hasOwn.call(response, responseName)) {\n                keyObj[lastActualKey = s] = response[lastResponseKey = responseName];\n            }\n            else {\n                __DEV__ ? invariant(!strict, \"Missing field '\" + responseName + \"' while computing key fields\") : invariant(!strict, 4);\n                lastResponseKey = lastActualKey = void 0;\n            }\n        }\n    });\n    return keyObj;\n}\n//# sourceMappingURL=policies.js.map","import { __assign, __extends } from \"tslib\";\nimport \"./fixPolyfills.js\";\nimport { wrap } from 'optimism';\nimport { equal } from '@wry/equality';\nimport { ApolloCache } from \"../core/cache.js\";\nimport { MissingFieldError } from \"../core/types/common.js\";\nimport { addTypenameToDocument, isReference, } from \"../../utilities/index.js\";\nimport { StoreReader } from \"./readFromStore.js\";\nimport { StoreWriter } from \"./writeToStore.js\";\nimport { EntityStore, supportsResultCaching } from \"./entityStore.js\";\nimport { makeVar, forgetCache, recallCache } from \"./reactiveVars.js\";\nimport { Policies } from \"./policies.js\";\nimport { hasOwn, normalizeConfig, shouldCanonizeResults } from \"./helpers.js\";\nimport { canonicalStringify } from \"./object-canon.js\";\nvar InMemoryCache = (function (_super) {\n    __extends(InMemoryCache, _super);\n    function InMemoryCache(config) {\n        if (config === void 0) { config = {}; }\n        var _this = _super.call(this) || this;\n        _this.watches = new Set();\n        _this.typenameDocumentCache = new Map();\n        _this.makeVar = makeVar;\n        _this.txCount = 0;\n        _this.config = normalizeConfig(config);\n        _this.addTypename = !!_this.config.addTypename;\n        _this.policies = new Policies({\n            cache: _this,\n            dataIdFromObject: _this.config.dataIdFromObject,\n            possibleTypes: _this.config.possibleTypes,\n            typePolicies: _this.config.typePolicies,\n        });\n        _this.init();\n        return _this;\n    }\n    InMemoryCache.prototype.init = function () {\n        var rootStore = this.data = new EntityStore.Root({\n            policies: this.policies,\n            resultCaching: this.config.resultCaching,\n        });\n        this.optimisticData = rootStore.stump;\n        this.resetResultCache();\n    };\n    InMemoryCache.prototype.resetResultCache = function (resetResultIdentities) {\n        var _this = this;\n        var previousReader = this.storeReader;\n        this.storeWriter = new StoreWriter(this, this.storeReader = new StoreReader({\n            cache: this,\n            addTypename: this.addTypename,\n            resultCacheMaxSize: this.config.resultCacheMaxSize,\n            canonizeResults: shouldCanonizeResults(this.config),\n            canon: resetResultIdentities\n                ? void 0\n                : previousReader && previousReader.canon,\n        }));\n        this.maybeBroadcastWatch = wrap(function (c, options) {\n            return _this.broadcastWatch(c, options);\n        }, {\n            max: this.config.resultCacheMaxSize,\n            makeCacheKey: function (c) {\n                var store = c.optimistic ? _this.optimisticData : _this.data;\n                if (supportsResultCaching(store)) {\n                    var optimistic = c.optimistic, rootId = c.rootId, variables = c.variables;\n                    return store.makeCacheKey(c.query, c.callback, canonicalStringify({ optimistic: optimistic, rootId: rootId, variables: variables }));\n                }\n            }\n        });\n        new Set([\n            this.data.group,\n            this.optimisticData.group,\n        ]).forEach(function (group) { return group.resetCaching(); });\n    };\n    InMemoryCache.prototype.restore = function (data) {\n        this.init();\n        if (data)\n            this.data.replace(data);\n        return this;\n    };\n    InMemoryCache.prototype.extract = function (optimistic) {\n        if (optimistic === void 0) { optimistic = false; }\n        return (optimistic ? this.optimisticData : this.data).extract();\n    };\n    InMemoryCache.prototype.read = function (options) {\n        var _a = options.returnPartialData, returnPartialData = _a === void 0 ? false : _a;\n        try {\n            return this.storeReader.diffQueryAgainstStore(__assign(__assign({}, options), { store: options.optimistic ? this.optimisticData : this.data, config: this.config, returnPartialData: returnPartialData })).result || null;\n        }\n        catch (e) {\n            if (e instanceof MissingFieldError) {\n                return null;\n            }\n            throw e;\n        }\n    };\n    InMemoryCache.prototype.write = function (options) {\n        try {\n            ++this.txCount;\n            return this.storeWriter.writeToStore(this.data, options);\n        }\n        finally {\n            if (!--this.txCount && options.broadcast !== false) {\n                this.broadcastWatches();\n            }\n        }\n    };\n    InMemoryCache.prototype.modify = function (options) {\n        if (hasOwn.call(options, \"id\") && !options.id) {\n            return false;\n        }\n        var store = options.optimistic\n            ? this.optimisticData\n            : this.data;\n        try {\n            ++this.txCount;\n            return store.modify(options.id || \"ROOT_QUERY\", options.fields);\n        }\n        finally {\n            if (!--this.txCount && options.broadcast !== false) {\n                this.broadcastWatches();\n            }\n        }\n    };\n    InMemoryCache.prototype.diff = function (options) {\n        return this.storeReader.diffQueryAgainstStore(__assign(__assign({}, options), { store: options.optimistic ? this.optimisticData : this.data, rootId: options.id || \"ROOT_QUERY\", config: this.config }));\n    };\n    InMemoryCache.prototype.watch = function (watch) {\n        var _this = this;\n        if (!this.watches.size) {\n            recallCache(this);\n        }\n        this.watches.add(watch);\n        if (watch.immediate) {\n            this.maybeBroadcastWatch(watch);\n        }\n        return function () {\n            if (_this.watches.delete(watch) && !_this.watches.size) {\n                forgetCache(_this);\n            }\n            _this.maybeBroadcastWatch.forget(watch);\n        };\n    };\n    InMemoryCache.prototype.gc = function (options) {\n        canonicalStringify.reset();\n        var ids = this.optimisticData.gc();\n        if (options && !this.txCount) {\n            if (options.resetResultCache) {\n                this.resetResultCache(options.resetResultIdentities);\n            }\n            else if (options.resetResultIdentities) {\n                this.storeReader.resetCanon();\n            }\n        }\n        return ids;\n    };\n    InMemoryCache.prototype.retain = function (rootId, optimistic) {\n        return (optimistic ? this.optimisticData : this.data).retain(rootId);\n    };\n    InMemoryCache.prototype.release = function (rootId, optimistic) {\n        return (optimistic ? this.optimisticData : this.data).release(rootId);\n    };\n    InMemoryCache.prototype.identify = function (object) {\n        return isReference(object) ? object.__ref :\n            this.policies.identify(object)[0];\n    };\n    InMemoryCache.prototype.evict = function (options) {\n        if (!options.id) {\n            if (hasOwn.call(options, \"id\")) {\n                return false;\n            }\n            options = __assign(__assign({}, options), { id: \"ROOT_QUERY\" });\n        }\n        try {\n            ++this.txCount;\n            return this.optimisticData.evict(options, this.data);\n        }\n        finally {\n            if (!--this.txCount && options.broadcast !== false) {\n                this.broadcastWatches();\n            }\n        }\n    };\n    InMemoryCache.prototype.reset = function (options) {\n        var _this = this;\n        this.init();\n        canonicalStringify.reset();\n        if (options && options.discardWatches) {\n            this.watches.forEach(function (watch) { return _this.maybeBroadcastWatch.forget(watch); });\n            this.watches.clear();\n            forgetCache(this);\n        }\n        else {\n            this.broadcastWatches();\n        }\n        return Promise.resolve();\n    };\n    InMemoryCache.prototype.removeOptimistic = function (idToRemove) {\n        var newOptimisticData = this.optimisticData.removeLayer(idToRemove);\n        if (newOptimisticData !== this.optimisticData) {\n            this.optimisticData = newOptimisticData;\n            this.broadcastWatches();\n        }\n    };\n    InMemoryCache.prototype.batch = function (options) {\n        var _this = this;\n        var update = options.update, _a = options.optimistic, optimistic = _a === void 0 ? true : _a, removeOptimistic = options.removeOptimistic, onWatchUpdated = options.onWatchUpdated;\n        var perform = function (layer) {\n            var _a = _this, data = _a.data, optimisticData = _a.optimisticData;\n            ++_this.txCount;\n            if (layer) {\n                _this.data = _this.optimisticData = layer;\n            }\n            try {\n                update(_this);\n            }\n            finally {\n                --_this.txCount;\n                _this.data = data;\n                _this.optimisticData = optimisticData;\n            }\n        };\n        var alreadyDirty = new Set();\n        if (onWatchUpdated && !this.txCount) {\n            this.broadcastWatches(__assign(__assign({}, options), { onWatchUpdated: function (watch) {\n                    alreadyDirty.add(watch);\n                    return false;\n                } }));\n        }\n        if (typeof optimistic === 'string') {\n            this.optimisticData = this.optimisticData.addLayer(optimistic, perform);\n        }\n        else if (optimistic === false) {\n            perform(this.data);\n        }\n        else {\n            perform();\n        }\n        if (typeof removeOptimistic === \"string\") {\n            this.optimisticData = this.optimisticData.removeLayer(removeOptimistic);\n        }\n        if (onWatchUpdated && alreadyDirty.size) {\n            this.broadcastWatches(__assign(__assign({}, options), { onWatchUpdated: function (watch, diff) {\n                    var result = onWatchUpdated.call(this, watch, diff);\n                    if (result !== false) {\n                        alreadyDirty.delete(watch);\n                    }\n                    return result;\n                } }));\n            if (alreadyDirty.size) {\n                alreadyDirty.forEach(function (watch) { return _this.maybeBroadcastWatch.dirty(watch); });\n            }\n        }\n        else {\n            this.broadcastWatches(options);\n        }\n    };\n    InMemoryCache.prototype.performTransaction = function (update, optimisticId) {\n        return this.batch({\n            update: update,\n            optimistic: optimisticId || (optimisticId !== null),\n        });\n    };\n    InMemoryCache.prototype.transformDocument = function (document) {\n        if (this.addTypename) {\n            var result = this.typenameDocumentCache.get(document);\n            if (!result) {\n                result = addTypenameToDocument(document);\n                this.typenameDocumentCache.set(document, result);\n                this.typenameDocumentCache.set(result, result);\n            }\n            return result;\n        }\n        return document;\n    };\n    InMemoryCache.prototype.broadcastWatches = function (options) {\n        var _this = this;\n        if (!this.txCount) {\n            this.watches.forEach(function (c) { return _this.maybeBroadcastWatch(c, options); });\n        }\n    };\n    InMemoryCache.prototype.broadcastWatch = function (c, options) {\n        var lastDiff = c.lastDiff;\n        var diff = this.diff(c);\n        if (options) {\n            if (c.optimistic &&\n                typeof options.optimistic === \"string\") {\n                diff.fromOptimisticTransaction = true;\n            }\n            if (options.onWatchUpdated &&\n                options.onWatchUpdated.call(this, c, diff, lastDiff) === false) {\n                return;\n            }\n        }\n        if (!lastDiff || !equal(lastDiff.result, diff.result)) {\n            c.callback(c.lastDiff = diff, lastDiff);\n        }\n    };\n    return InMemoryCache;\n}(ApolloCache));\nexport { InMemoryCache };\n//# sourceMappingURL=inMemoryCache.js.map","import { ApolloClient, InMemoryCache, HttpLink, ApolloLink } from '@apollo/client/core';\nimport fragments from './generated/fragments.json';\nimport fetch from 'cross-fetch';\n\n// eslint-disable-next-line @typescript-eslint/no-var-requires\nconst packageJson: { version: string } = require('../../package.json');\n\ntype ApolloClientConfiguration = {\n  sdkKey: string;\n  baseUri: string;\n};\n\nconst initApolloClient = ({ sdkKey, baseUri }: Partial<ApolloClientConfiguration>) => {\n  const authLink = new ApolloLink((operation, forward) => {\n    operation.setContext({\n      headers: {\n        'X-API-KEY': sdkKey,\n      },\n    });\n    return forward(operation);\n  });\n\n  const httpLink = new HttpLink({\n    uri: `${baseUri}/graphql`,\n    fetch,\n  });\n\n  return new ApolloClient({\n    link: authLink.concat(httpLink),\n    cache: new InMemoryCache({ possibleTypes: fragments.possibleTypes }),\n    name: 'js-client-sdk',\n    version: packageJson.version,\n  });\n};\n\nexport default initApolloClient;\n","import { CacheService } from './cacheService';\nimport CachedEntitlement from './cachedEntitlement';\n\nexport class InMemoryCacheService implements CacheService {\n  private entitlements: Map<string, CachedEntitlement>;\n  isLoaded: boolean;\n  private features: Set<string>;\n  constructor() {\n    this.entitlements = new Map<string, CachedEntitlement>();\n    this.features = new Set<string>();\n    this.isLoaded = false;\n  }\n\n  getEntitlement(featureId: string): CachedEntitlement | null {\n    return this.entitlements.get(featureId) || null;\n  }\n\n  validateFeature(featureId: string): boolean {\n    return this.features.has(featureId);\n  }\n\n  setFeatures = (features: string[]) => (this.features = new Set<string>(features));\n\n  setEntitlements(entitlements: Map<string, CachedEntitlement>): void {\n    this.entitlements = entitlements;\n    this.isLoaded = true;\n  }\n\n  getEntitlements(): Map<string, CachedEntitlement> {\n    return this.entitlements;\n  }\n}\n","import { gql, ApolloClient, NormalizedCacheObject } from '@apollo/client/core';\nimport {\n  EntitlementQuery,\n  EntitlementQueryVariables,\n  GetEntitlementsQuery,\n  GetEntitlementsQueryVariables,\n} from './generated/types';\nimport { FetchEntitlement } from '../models';\n\nconst SLIM_ENTITLEMENT = gql`\n  fragment SlimEntitlementFragment on Entitlement {\n    isGranted\n    accessDeniedReason\n    customerId\n    usageLimit\n    hasUnlimitedUsage\n    currentUsage\n    requestedUsage\n    nextResetDate\n    resetPeriod\n    resetPeriodConfiguration {\n      __typename\n      ... on MonthlyResetPeriodConfig {\n        ...MonthlyResetPeriodConfigFragment\n      }\n      ... on WeeklyResetPeriodConfig {\n        ...WeeklyResetPeriodConfigFragment\n      }\n    }\n    feature {\n      ...SlimFeatureFragment\n    }\n  }\n  fragment SlimFeatureFragment on EntitlementFeature {\n    featureType\n    meterType\n    refId\n  }\n  fragment MonthlyResetPeriodConfigFragment on MonthlyResetPeriodConfig {\n    monthlyAccordingTo\n  }\n  fragment WeeklyResetPeriodConfigFragment on WeeklyResetPeriodConfig {\n    weeklyAccordingTo\n  }\n`;\n\nconst FULL_ENTITLEMENT = gql`\n  fragment EntitlementFragment on EntitlementWithSummary {\n    isGranted\n    accessDeniedReason\n    customerId\n    usageLimit\n    hasUnlimitedUsage\n    currentUsage\n    requestedUsage\n    nextResetDate\n    resetPeriod\n    resetPeriodConfiguration {\n      ...ResetPeriodConfigurationFragment\n    }\n    feature {\n      ...FeatureFragment\n    }\n  }\n  fragment ResetPeriodConfigurationFragment on ResetPeriodConfiguration {\n    __typename\n    ... on MonthlyResetPeriodConfig {\n      ...MonthlyResetPeriodConfigFragment\n    }\n    ... on WeeklyResetPeriodConfig {\n      ...WeeklyResetPeriodConfigFragment\n    }\n  }\n  fragment FeatureFragment on EntitlementFeature {\n    featureType\n    meterType\n    featureUnits\n    featureUnitsPlural\n    description\n    displayName\n    refId\n  }\n  fragment MonthlyResetPeriodConfigFragment on MonthlyResetPeriodConfig {\n    monthlyAccordingTo\n  }\n  fragment WeeklyResetPeriodConfigFragment on WeeklyResetPeriodConfig {\n    weeklyAccordingTo\n  }\n`;\n\nclass EntitlementsApi {\n  constructor(private readonly client: ApolloClient<NormalizedCacheObject>) {}\n\n  getEntitlement(query: FetchEntitlement) {\n    return this.client.query<EntitlementQuery, EntitlementQueryVariables>({\n      query: gql`\n        query Entitlement($query: FetchEntitlementQuery!) {\n          entitlement(query: $query) {\n            ...SlimEntitlementFragment\n          }\n        }\n        ${SLIM_ENTITLEMENT}\n      `,\n      variables: { query },\n      fetchPolicy: 'network-only', // so we re-fetch this rather then using some cached results.\n    });\n  }\n\n  getEntitlements(customerId: string) {\n    return this.client.query<GetEntitlementsQuery, GetEntitlementsQueryVariables>({\n      query: gql`\n        query GetEntitlements($query: FetchEntitlementsQuery!) {\n          entitlements(query: $query) {\n            ...EntitlementFragment\n          }\n        }\n        ${FULL_ENTITLEMENT}\n      `,\n      variables: { query: { customerId } },\n      fetchPolicy: 'network-only',\n    });\n  }\n}\n\nexport default EntitlementsApi;\n","import CachedEntitlement from './cachedEntitlement';\nimport { AccessDeniedReason } from '../api/generated/types';\nimport { FeatureType, MeterType } from '../models';\n\nexport class EntitlementDecisionService {\n  public static decideEntitlementPolicy(entitlement?: CachedEntitlement | null, requestUsage?: number): Decision {\n    if (!entitlement) {\n      return { isGranted: false, accessDeniedReason: AccessDeniedReason.NoFeatureEntitlementInSubscription };\n    }\n\n    const featureType = entitlement.calculatedEntitlement.featureType;\n    const meterType = entitlement.calculatedEntitlement.meterType;\n\n    switch (featureType) {\n      case FeatureType.Boolean:\n        return { isGranted: true };\n      case FeatureType.Number: {\n        if (entitlement.calculatedEntitlement.meterType === MeterType.None) {\n          return { isGranted: true };\n        }\n        if (entitlement.calculatedEntitlement.hasUnlimitedUsage) {\n          return { isGranted: true };\n        }\n\n        let currentUsage = entitlement.featureUsage.currentUsage;\n        if (meterType === MeterType.Incremental && entitlement.featureUsage.nextResetDate < new Date().getTime()) {\n          currentUsage = 0;\n        }\n        if (currentUsage + (requestUsage || 0) <= (entitlement.calculatedEntitlement?.usageLimit || 0)) {\n          return { isGranted: true };\n        } else {\n          return { isGranted: false, accessDeniedReason: AccessDeniedReason.RequestedUsageExceedingLimit };\n        }\n      }\n    }\n  }\n}\n\nexport interface Decision {\n  readonly isGranted: boolean;\n  readonly accessDeniedReason?: AccessDeniedReason;\n}\n","import { CacheService } from './cacheService';\nimport { ApolloClient, NormalizedCacheObject } from '@apollo/client/core';\nimport EntitlementsApi from '../api/EntitlementsApi';\nimport { ModelMapper } from '../utils/ModelMapper';\nimport { AccessDeniedReason, Entitlement, InvalidEntitlement } from '../models';\nimport { Decision, EntitlementDecisionService } from './entitlementDecisionService';\nimport CachedEntitlement from './cachedEntitlement';\nimport { includes } from 'lodash';\n\nexport class EntitlementsService {\n  private readonly entitlementsApi: EntitlementsApi;\n  private readonly modelMapper: ModelMapper;\n  private loadingEntitlements: Promise<void> | null;\n\n  constructor(\n    private readonly customerId: string,\n    private readonly cacheService: CacheService,\n    client: ApolloClient<NormalizedCacheObject>,\n  ) {\n    this.entitlementsApi = new EntitlementsApi(client);\n    this.modelMapper = new ModelMapper();\n    this.loadingEntitlements = null;\n  }\n\n  getEntitlement<T extends Entitlement>(featureRefId: string, requestedUsage?: number): T | InvalidEntitlement {\n    // TODO: Validate feature exists after implementing features subscriptions\n    // const validFeature = this.cacheService.validateFeature(featureRefId);\n\n    const entitlement = this.cacheService.getEntitlement(featureRefId);\n    const decision = EntitlementDecisionService.decideEntitlementPolicy(entitlement, requestedUsage);\n\n    if (!entitlement) {\n      if (includes([AccessDeniedReason.CustomerNotFound, AccessDeniedReason.Unknown], decision.accessDeniedReason)) {\n        return { isValid: false, ...decision } as InvalidEntitlement;\n      } else {\n      }\n\n      return { isValid: true, ...decision } as T;\n    }\n\n    return this.modelMapper.mapEntitlementByDecision(decision, featureRefId, entitlement, requestedUsage) as T;\n  }\n\n  async loadEntitlements(): Promise<void> {\n    if (!this.loadingEntitlements) {\n      this.loadingEntitlements = this.doLoadEntitlements();\n    }\n\n    return this.loadingEntitlements;\n  }\n\n  // TODO: Test this\n  private async doLoadEntitlements() {\n    const {\n      data: { entitlements },\n    } = await this.entitlementsApi.getEntitlements(this.customerId);\n\n    if (entitlements) {\n      const cachedEntitlements = this.modelMapper.mapCachedEntitlements(entitlements);\n      this.cacheService.setEntitlements(cachedEntitlements);\n    } else {\n      console.log('Failed to load entitlements');\n    }\n  }\n\n  async getEntitlements() {\n    if (!this.cacheService.isLoaded) {\n      await this.loadEntitlements();\n    }\n\n    return Array.from(this.cacheService.getEntitlements().values()).map((entitlement) => {\n      const decision = EntitlementDecisionService.decideEntitlementPolicy(entitlement);\n      return this.modelMapper.mapFullEntitlementByDecision(entitlement, decision, this.customerId);\n    });\n  }\n}\n\nexport type GetEntitlementResult = {\n  entitlement: CachedEntitlement | null;\n  decision: Decision;\n};\n","import {\n  EntitlementOptions,\n  Customer,\n  Entitlement,\n  INVALID_ENTITLEMENT,\n  InvalidEntitlement,\n  Plan,\n  FallbackEntitlement,\n  AccessDeniedReason,\n} from './models';\nimport ApiGateway from './api/ApiGateway';\nimport { ClientConfiguration, ensureCustomerRefIdExists, validateConfiguration, withDefaults } from './configuration';\nimport { ModelMapper } from './utils/ModelMapper';\nimport initApolloClient from './api/initApolloClient';\nimport { InMemoryCacheService } from './services/inMemoryCacheService';\nimport { EntitlementsService } from './services/entitlementsService';\nimport { ApolloClient, NormalizedCacheObject } from '@apollo/client/core';\n\nexport interface StiggClient {\n  getEntitlement: <T extends Entitlement>(\n    featureId: string,\n    options?: EntitlementOptions,\n  ) => T | InvalidEntitlement | FallbackEntitlement;\n  setCustomerId: (customerId: string) => void;\n  getPlans: () => Promise<Plan[]>;\n  getCustomer: () => Promise<Customer>;\n  getEntitlements: () => Promise<Entitlement[]>;\n}\n\nexport class Stigg implements StiggClient {\n  private readonly apiGateway: ApiGateway;\n  private readonly graphClient: ApolloClient<NormalizedCacheObject>;\n  private readonly configuration: ClientConfiguration;\n  private entitlementsService: EntitlementsService | null;\n  private readonly modelMapper = new ModelMapper();\n\n  private constructor(configuration: ClientConfiguration) {\n    validateConfiguration(configuration);\n    this.configuration = withDefaults(configuration);\n    this.graphClient = initApolloClient(this.configuration);\n    this.apiGateway = new ApiGateway(this.graphClient);\n    this.entitlementsService = null;\n  }\n\n  static async initialize(configuration: ClientConfiguration): Promise<StiggClient> {\n    try {\n      const stigg = new Stigg(configuration);\n\n      if (configuration.customerId) {\n        await stigg.setCustomerId(configuration.customerId);\n      }\n      return stigg;\n    } catch (err) {\n      throw new Error(`Failed to initialize api ${err}`);\n    }\n  }\n\n  async setCustomerId(customerId: string) {\n    this.configuration.customerId = customerId;\n    this.entitlementsService = new EntitlementsService(customerId, new InMemoryCacheService(), this.graphClient);\n    await this.entitlementsService.loadEntitlements();\n  }\n\n  getEntitlement<T extends Entitlement>(\n    featureId: string,\n    options?: EntitlementOptions,\n  ): T | InvalidEntitlement | FallbackEntitlement {\n    ensureCustomerRefIdExists(this.configuration);\n    try {\n      const entitlement = this.entitlementsService?.getEntitlement<T>(featureId, options?.requestedUsage);\n\n      if (!entitlement) {\n        return this.handleNoEntitlementFound(options?.fallbackGrantedValue);\n      }\n      return entitlement;\n    } catch (err: any) {\n      const anError = err.graphQLErrors?.[0]?.extensions || err;\n      console.error('Failed to get entitlement', anError);\n      return this.handleNoEntitlementFound(options?.fallbackGrantedValue);\n    }\n  }\n\n  private handleNoEntitlementFound(\n    fallbackGrantedValue?: boolean | undefined,\n  ): FallbackEntitlement | InvalidEntitlement {\n    if (fallbackGrantedValue) {\n      return {\n        isValid: false,\n        isGranted: fallbackGrantedValue,\n        accessDeniedReason: fallbackGrantedValue ? AccessDeniedReason.Unknown : null,\n      } as FallbackEntitlement;\n    }\n    return INVALID_ENTITLEMENT;\n  }\n\n  async getPlans() {\n    const graphResponse = await this.apiGateway.paywall.getPlans();\n    return this.modelMapper.mapPlans(graphResponse.data);\n  }\n\n  async getCustomer() {\n    const customerId = ensureCustomerRefIdExists(this.configuration);\n\n    const resp = await this.apiGateway.customers.getCustomer(customerId);\n    const [{ node: rawCustomer }] = resp.data.customers.edges;\n    return this.modelMapper.mapCustomer(rawCustomer);\n  }\n\n  async getEntitlements() {\n    ensureCustomerRefIdExists(this.configuration);\n    // todo: introduce generic error handling in case the API call failed so we won't blow up the SDK clients\n    return this.entitlementsService?.getEntitlements() || [];\n  }\n}\n","// The module cache\nvar __webpack_module_cache__ = {};\n\n// The require function\nfunction __webpack_require__(moduleId) {\n\t// Check if module is in cache\n\tvar cachedModule = __webpack_module_cache__[moduleId];\n\tif (cachedModule !== undefined) {\n\t\treturn cachedModule.exports;\n\t}\n\t// Create a new module (and put it into the cache)\n\tvar module = __webpack_module_cache__[moduleId] = {\n\t\tid: moduleId,\n\t\tloaded: false,\n\t\texports: {}\n\t};\n\n\t// Execute the module function\n\t__webpack_modules__[moduleId].call(module.exports, module, module.exports, __webpack_require__);\n\n\t// Flag the module as loaded\n\tmodule.loaded = true;\n\n\t// Return the exports of the module\n\treturn module.exports;\n}\n\n","// getDefaultExport function for compatibility with non-harmony modules\n__webpack_require__.n = (module) => {\n\tvar getter = module && module.__esModule ?\n\t\t() => (module['default']) :\n\t\t() => (module);\n\t__webpack_require__.d(getter, { a: getter });\n\treturn getter;\n};","// define getter functions for harmony exports\n__webpack_require__.d = (exports, definition) => {\n\tfor(var key in definition) {\n\t\tif(__webpack_require__.o(definition, key) && !__webpack_require__.o(exports, key)) {\n\t\t\tObject.defineProperty(exports, key, { enumerable: true, get: definition[key] });\n\t\t}\n\t}\n};","__webpack_require__.g = (function() {\n\tif (typeof globalThis === 'object') return globalThis;\n\ttry {\n\t\treturn this || new Function('return this')();\n\t} catch (e) {\n\t\tif (typeof window === 'object') return window;\n\t}\n})();","__webpack_require__.o = (obj, prop) => (Object.prototype.hasOwnProperty.call(obj, prop))","// define __esModule on exports\n__webpack_require__.r = (exports) => {\n\tif(typeof Symbol !== 'undefined' && Symbol.toStringTag) {\n\t\tObject.defineProperty(exports, Symbol.toStringTag, { value: 'Module' });\n\t}\n\tObject.defineProperty(exports, '__esModule', { value: true });\n};","__webpack_require__.nmd = (module) => {\n\tmodule.paths = [];\n\tif (!module.children) module.children = [];\n\treturn module;\n};","// startup\n// Load entry module and return exports\n// This entry module doesn't tell about it's top-level declarations so it can't be inlined\nvar __webpack_exports__ = __webpack_require__(3890);\n"],"names":["root","factory","exports","module","define","amd","self","global","this","__self__","F","fetch","DOMException","prototype","support","Symbol","Blob","e","viewClasses","isArrayBufferView","ArrayBuffer","isView","obj","indexOf","Object","toString","call","normalizeName","name","String","test","TypeError","toLowerCase","normalizeValue","value","iteratorFor","items","iterator","next","shift","done","undefined","Headers","headers","map","forEach","append","Array","isArray","header","getOwnPropertyNames","consumed","body","bodyUsed","Promise","reject","fileReaderReady","reader","resolve","onload","result","onerror","error","readBlobAsArrayBuffer","blob","FileReader","promise","readAsArrayBuffer","bufferClone","buf","slice","view","Uint8Array","byteLength","set","buffer","Body","_initBody","_bodyInit","_bodyText","isPrototypeOf","_bodyBlob","FormData","_bodyFormData","URLSearchParams","DataView","_bodyArrayBuffer","get","type","rejected","Error","arrayBuffer","then","text","readAsText","chars","length","i","fromCharCode","join","readArrayBufferAsText","formData","decode","json","JSON","parse","oldValue","has","hasOwnProperty","callback","thisArg","keys","push","values","entries","methods","Request","input","options","method","upcased","url","credentials","mode","signal","toUpperCase","referrer","form","trim","split","bytes","replace","decodeURIComponent","Response","bodyInit","status","ok","statusText","clone","response","redirectStatuses","redirect","RangeError","location","err","message","stack","create","constructor","init","request","aborted","xhr","XMLHttpRequest","abortXhr","abort","rawHeaders","getAllResponseHeaders","line","parts","key","responseURL","responseText","ontimeout","onabort","open","withCredentials","responseType","setRequestHeader","addEventListener","onreadystatechange","readyState","removeEventListener","send","polyfill","defineProperty","ponyfill","ctx","getNative","hashClear","hashDelete","hashGet","hashHas","hashSet","Hash","index","clear","entry","listCacheClear","listCacheDelete","listCacheGet","listCacheHas","listCacheSet","ListCache","Map","mapCacheClear","mapCacheDelete","mapCacheGet","mapCacheHas","mapCacheSet","MapCache","Set","setCacheAdd","setCacheHas","SetCache","__data__","add","stackClear","stackDelete","stackGet","stackHas","stackSet","Stack","data","size","WeakMap","func","args","apply","array","predicate","resIndex","baseTimes","isArguments","isBuffer","isIndex","isTypedArray","inherited","isArr","isArg","isBuff","isType","skipIndexes","iteratee","offset","baseAssignValue","eq","object","objValue","isObject","objectCreate","baseCreate","proto","baseForOwn","baseEach","createBaseEach","arrayPush","isFlattenable","baseFlatten","depth","isStrict","baseFor","createBaseFor","castPath","toKey","path","keysFunc","symbolsFunc","getRawTag","objectToString","symToStringTag","toStringTag","baseGetTag","isObjectLike","baseIsEqualDeep","baseIsEqual","other","bitmask","customizer","equalArrays","equalByTag","equalObjects","getTag","argsTag","arrayTag","objectTag","equalFunc","objIsArr","othIsArr","objTag","othTag","objIsObj","othIsObj","isSameTag","objIsWrapped","othIsWrapped","objUnwrapped","othUnwrapped","source","matchData","noCustomizer","srcValue","COMPARE_PARTIAL_FLAG","isFunction","isMasked","toSource","reIsHostCtor","funcProto","Function","objectProto","funcToString","reIsNative","RegExp","isLength","typedArrayTags","baseMatches","baseMatchesProperty","identity","property","isPrototype","nativeKeys","nativeKeysIn","isProto","isArrayLike","collection","baseIsMatch","getMatchData","matchesStrictComparable","hasIn","isKey","isStrictComparable","assignMergeValue","baseMergeDeep","keysIn","safeGet","baseMerge","srcIndex","newValue","cloneBuffer","cloneTypedArray","copyArray","initCloneObject","isArrayLikeObject","isPlainObject","toPlainObject","mergeFunc","stacked","isCommon","isTyped","arrayMap","baseGet","baseIteratee","baseMap","baseSortBy","baseUnary","compareMultiple","iteratees","orders","overRest","setToString","start","constant","baseSetToString","string","comparer","sort","n","isSymbol","symbolProto","symbolToString","baseToString","cache","stringToPath","freeExports","nodeType","freeModule","Buffer","allocUnsafe","isDeep","copy","cloneArrayBuffer","typedArray","byteOffset","valIsDefined","valIsNull","valIsReflexive","valIsSymbol","othIsDefined","othIsNull","othIsReflexive","othIsSymbol","compareAscending","objCriteria","criteria","othCriteria","ordersLength","assignValue","props","isNew","coreJsData","baseRest","isIterateeCall","assigner","sources","guard","eachFunc","fromRight","iterable","arraySome","cacheHas","isPartial","arrLength","othLength","arrStacked","othStacked","seen","arrValue","othValue","compared","othIndex","mapToArray","setToArray","symbolValueOf","valueOf","tag","convert","getAllKeys","objProps","objLength","objStacked","skipCtor","objCtor","othCtor","freeGlobal","g","baseGetAllKeys","getSymbols","isKeyable","baseIsNative","getValue","getPrototype","overArg","getPrototypeOf","nativeObjectToString","isOwn","unmasked","arrayFilter","stubArray","propertyIsEnumerable","nativeGetSymbols","getOwnPropertySymbols","symbol","mapTag","promiseTag","setTag","weakMapTag","dataViewTag","dataViewCtorString","mapCtorString","promiseCtorString","setCtorString","weakMapCtorString","Ctor","ctorString","hasFunc","nativeCreate","spreadableSymbol","isConcatSpreadable","reIsUint","reIsDeepProp","reIsPlainProp","uid","maskSrcKey","exec","IE_PROTO","assocIndexOf","splice","pop","getMapData","memoize","freeProcess","process","nodeUtil","require","types","binding","transform","arg","nativeMax","Math","max","arguments","otherArgs","freeSelf","shortOut","nativeNow","Date","now","count","lastCalled","stamp","remaining","pairs","LARGE_ARRAY_SIZE","memoizeCapped","rePropName","reEscapeChar","charCodeAt","match","number","quote","subString","defaultValue","baseHasIn","hasPath","baseIsArguments","stubFalse","baseKeys","objectCtorString","baseIsTypedArray","nodeIsTypedArray","arrayLikeKeys","baseKeysIn","FUNC_ERROR_TEXT","HASH_UNDEFINED","PLACEHOLDER","WRAP_PARTIAL_FLAG","WRAP_ARY_FLAG","INFINITY","MAX_SAFE_INTEGER","NAN","MAX_ARRAY_LENGTH","wrapFlags","boolTag","dateTag","errorTag","funcTag","genTag","numberTag","regexpTag","stringTag","symbolTag","arrayBufferTag","float32Tag","float64Tag","int8Tag","int16Tag","int32Tag","uint8Tag","uint8ClampedTag","uint16Tag","uint32Tag","reEmptyStringLeading","reEmptyStringMiddle","reEmptyStringTrailing","reEscapedHtml","reUnescapedHtml","reHasEscapedHtml","reHasUnescapedHtml","reEscape","reEvaluate","reInterpolate","reRegExpChar","reHasRegExpChar","reTrimStart","reWhitespace","reWrapComment","reWrapDetails","reSplitDetails","reAsciiWord","reForbiddenIdentifierChars","reEsTemplate","reFlags","reIsBadHex","reIsBinary","reIsOctal","reLatin","reNoMatch","reUnescapedString","rsComboRange","rsComboMarksRange","rsLowerRange","rsUpperRange","rsBreakRange","rsMathOpRange","rsBreak","rsCombo","rsDigits","rsLower","rsMisc","rsFitz","rsNonAstral","rsRegional","rsSurrPair","rsUpper","rsMiscLower","rsMiscUpper","rsOptContrLower","rsOptContrUpper","reOptMod","rsModifier","rsOptVar","rsSeq","rsEmoji","rsSymbol","reApos","reComboMark","reUnicode","reUnicodeWord","reHasUnicode","reHasUnicodeWord","contextProps","templateCounter","cloneableTags","stringEscapes","freeParseFloat","parseFloat","freeParseInt","parseInt","moduleExports","nodeIsArrayBuffer","isArrayBuffer","nodeIsDate","isDate","nodeIsMap","isMap","nodeIsRegExp","isRegExp","nodeIsSet","isSet","arrayAggregator","setter","accumulator","arrayEach","arrayEachRight","arrayEvery","arrayIncludes","baseIndexOf","arrayIncludesWith","comparator","arrayReduce","initAccum","arrayReduceRight","asciiSize","baseProperty","baseFindKey","baseFindIndex","fromIndex","strictIndexOf","baseIsNaN","baseIndexOfWith","baseMean","baseSum","basePropertyOf","baseReduce","current","baseTrim","trimmedEndIndex","baseValues","charsStartIndex","strSymbols","chrSymbols","charsEndIndex","countHolders","placeholder","deburrLetter","escapeHtmlChar","escapeStringChar","chr","hasUnicode","replaceHolders","setToPairs","stringSize","lastIndex","unicodeSize","stringToArray","unicodeToArray","asciiToArray","charAt","unescapeHtmlChar","_","runInContext","context","defaults","pick","arrayProto","idCounter","oldDash","symIterator","ctxClearTimeout","clearTimeout","ctxNow","ctxSetTimeout","setTimeout","nativeCeil","ceil","nativeFloor","floor","nativeIsBuffer","nativeIsFinite","isFinite","nativeJoin","nativeMin","min","nativeParseInt","nativeRandom","random","nativeReverse","reverse","metaMap","realNames","lodash","LazyWrapper","LodashWrapper","wrapperClone","baseLodash","chainAll","__wrapped__","__actions__","__chain__","__index__","__values__","__dir__","__filtered__","__iteratees__","__takeCount__","__views__","arraySample","baseRandom","arraySampleSize","shuffleSelf","baseClamp","arrayShuffle","baseAggregator","baseAssign","copyObject","baseAt","paths","skip","lower","upper","baseClone","isFlat","isFull","initCloneArray","isFunc","getSymbolsIn","copySymbolsIn","baseAssignIn","copySymbols","dataView","cloneDataView","regexp","cloneRegExp","initCloneByTag","subValue","getAllKeysIn","baseConformsTo","baseDelay","wait","baseDifference","includes","valuesLength","outer","computed","valuesIndex","templateSettings","baseEachRight","baseForOwnRight","baseEvery","baseExtremum","baseFilter","baseForRight","baseFunctions","baseGt","baseHas","baseIntersection","arrays","caches","maxLength","Infinity","baseInvoke","parent","last","baseLt","baseNth","baseOrderBy","getIteratee","basePickBy","baseSet","basePullAll","basePullAt","indexes","previous","baseUnset","baseRepeat","baseSample","baseSampleSize","nested","baseSetData","baseShuffle","baseSlice","end","baseSome","baseSortedIndex","retHighest","low","high","mid","baseSortedIndexBy","valIsNaN","valIsUndefined","setLow","baseSortedUniq","baseToNumber","baseUniq","createSet","seenIndex","baseUpdate","updater","baseWhile","isDrop","baseWrapperValue","actions","action","baseXor","baseZipObject","assignFunc","valsLength","castArrayLikeObject","castFunction","castRest","castSlice","id","composeArgs","partials","holders","isCurried","argsIndex","argsLength","holdersLength","leftIndex","leftLength","rangeLength","isUncurried","composeArgsRight","holdersIndex","rightIndex","rightLength","createAggregator","initializer","createAssigner","createCaseFirst","methodName","trailing","createCompounder","words","deburr","createCtor","thisBinding","createFind","findIndexFunc","createFlow","flatRest","funcs","prereq","thru","wrapper","getFuncName","funcName","getData","isLaziable","plant","createHybrid","partialsRight","holdersRight","argPos","ary","arity","isAry","isBind","isBindKey","isFlip","getHolder","holdersCount","newHolders","createRecurry","fn","reorder","createInverter","toIteratee","baseInverter","createMathOperation","operator","createOver","arrayFunc","createPadding","charsLength","createRange","step","toFinite","baseRange","createRelationalOperation","toNumber","wrapFunc","isCurry","newData","setData","setWrapToString","createRound","precision","toInteger","pair","noop","createToPairs","baseToPairs","createWrap","srcBitmask","newBitmask","isCombo","mergeData","createCurry","createPartial","createBind","customDefaultsAssignIn","customDefaultsMerge","customOmitClone","flatten","otherFunc","isMaskable","oldArray","reference","details","insertWrapDetails","updateWrapDetails","getWrapDetails","rand","difference","differenceBy","differenceWith","findIndex","findLastIndex","head","intersection","mapped","intersectionBy","intersectionWith","pull","pullAll","pullAt","union","unionBy","unionWith","unzip","group","unzipWith","without","xor","xorBy","xorWith","zip","zipWith","chain","interceptor","wrapperAt","countBy","find","findLast","forEachRight","groupBy","invokeMap","keyBy","partition","sortBy","before","bind","bindKey","WRAP_BIND_FLAG","debounce","lastArgs","lastThis","maxWait","timerId","lastCallTime","lastInvokeTime","leading","maxing","invokeFunc","time","leadingEdge","timerExpired","shouldInvoke","timeSinceLastCall","trailingEdge","timeWaiting","remainingWait","debounced","isInvoking","cancel","flush","defer","delay","resolver","memoized","Cache","negate","overArgs","transforms","funcsLength","partial","partialRight","rearg","gt","gte","isError","isInteger","isNumber","isString","lt","lte","toArray","iteratorToArray","remainder","toLength","isBinary","assign","assignIn","assignInWith","assignWith","at","propsIndex","propsLength","defaultsDeep","mergeWith","invert","invertBy","invoke","merge","omit","CLONE_DEEP_FLAG","basePick","pickBy","prop","toPairs","toPairsIn","camelCase","word","capitalize","upperFirst","kebabCase","lowerCase","lowerFirst","snakeCase","startCase","upperCase","pattern","hasUnicodeWord","unicodeWords","asciiWords","attempt","bindAll","methodNames","flow","flowRight","methodOf","mixin","over","overEvery","overSome","basePropertyDeep","range","rangeRight","augend","addend","divide","dividend","divisor","multiply","multiplier","multiplicand","round","subtract","minuend","subtrahend","after","castArray","chunk","compact","concat","cond","conforms","baseConforms","properties","curry","curryRight","drop","dropRight","dropRightWhile","dropWhile","fill","baseFill","filter","flatMap","flatMapDeep","flatMapDepth","flattenDeep","flattenDepth","flip","fromPairs","functions","functionsIn","initial","mapKeys","mapValues","matches","matchesProperty","nthArg","omitBy","once","orderBy","propertyOf","pullAllBy","pullAllWith","remove","rest","sampleSize","setWith","shuffle","sortedUniq","sortedUniqBy","separator","limit","spread","tail","take","takeRight","takeRightWhile","takeWhile","tap","throttle","toPath","isArrLike","unary","uniq","uniqBy","uniqWith","unset","update","updateWith","valuesIn","wrap","zipObject","zipObjectDeep","entriesIn","extend","extendWith","clamp","cloneDeep","cloneDeepWith","cloneWith","conformsTo","defaultTo","endsWith","target","position","escape","escapeRegExp","every","findKey","findLastKey","forIn","forInRight","forOwn","forOwnRight","inRange","baseInRange","isBoolean","isElement","isEmpty","isEqual","isEqualWith","isMatch","isMatchWith","isNaN","isNative","isNil","isNull","isSafeInteger","isUndefined","isWeakMap","isWeakSet","lastIndexOf","strictLastIndexOf","maxBy","mean","meanBy","minBy","stubObject","stubString","stubTrue","nth","noConflict","pad","strLength","padEnd","padStart","radix","floating","temp","reduce","reduceRight","repeat","sample","some","sortedIndex","sortedIndexBy","sortedIndexOf","sortedLastIndex","sortedLastIndexBy","sortedLastIndexOf","startsWith","sum","sumBy","template","settings","isEscaping","isEvaluating","imports","importsKeys","importsValues","interpolate","reDelimiters","evaluate","sourceURL","escapeValue","interpolateValue","esTemplateValue","evaluateValue","variable","times","toLower","toSafeInteger","toUpper","trimEnd","trimStart","truncate","omission","search","substring","newEnd","unescape","uniqueId","prefix","each","eachRight","first","VERSION","isFilter","takeName","dropName","checkIteratee","isTaker","lodashFunc","retUnwrapped","isLazy","useLazy","isHybrid","isUnwrapped","onlyLazy","chainName","dir","isRight","getView","iterLength","takeCount","iterIndex","commit","wrapped","toJSON","AccessDeniedReason","AddonSortFields","ApiKeySortFields","ApiKeyType","BillingModel","BillingPeriod","ChangeType","Currency","CustomerSortFields","CustomerSubscriptionSortFields","EntitlementResetPeriod","EnvironmentSortFields","ErrorCode","EventLogSortFields","EventLogType","FeatureSortFields","FeatureStatus","FeatureType","HookSortFields","HookStatus","IntegrationSortFields","MemberSortFields","MemberStatus","MeterType","MonthlyAccordingTo","PackageEntitlementSortFields","PackageStatus","PlanSortFields","PriceSortFields","ProductSortFields","PromotionalEntitlementPeriod","PromotionalEntitlementSortFields","PromotionalEntitlementStatus","PublishMigrationType","SortDirection","SortNulls","SubscriptionAddonSortFields","SubscriptionPriceSortFields","SubscriptionStatus","TrialPeriodUnits","TrialSetup","UsageMeasurementSortFields","VendorIdentifier","WeeklyAccordingTo","INVALID_ENTITLEMENT","isValid","isGranted","accessDeniedReason","Unknown","state","getActiveSubscriptions","subscriptions","x","Active","getActiveTrials","InTrial","getActivePromotionalEntitlements","promotionalEntitlements","extendStatics","d","b","setPrototypeOf","__proto__","p","__extends","__","__assign","t","s","__rest","__awaiter","_arguments","P","generator","fulfilled","__generator","f","y","label","sent","trys","ops","verb","v","op","__spreadArray","to","from","pack","ar","l","invariant","condition","Boolean","LineRegExp","getLocation","lastLineStart","matchAll","column","printSourceLocation","sourceLocation","firstLineColumnOffset","locationOffset","lineIndex","lineOffset","lineNum","columnOffset","columnNum","locationStr","lines","locationLine","subLineIndex","subLineColumnNum","subLines","printPrefixedLines","subLine","existingLines","padLen","GraphQLError","nodes","positions","originalError","extensions","_this$nodes","_nodeLocations$","_ref","super","undefinedIfEmpty","nodeLocations","node","loc","locations","pos","originalExtensions","defineProperties","writable","enumerable","configurable","captureStackTrace","output","formattedError","syntaxError","description","Kind","Location","startToken","endToken","Token","kind","prev","QueryDocumentKeys","Name","Document","OperationDefinition","VariableDefinition","Variable","SelectionSet","Field","Argument","FragmentSpread","InlineFragment","FragmentDefinition","IntValue","FloatValue","StringValue","BooleanValue","NullValue","EnumValue","ListValue","ObjectValue","ObjectField","Directive","NamedType","ListType","NonNullType","SchemaDefinition","OperationTypeDefinition","ScalarTypeDefinition","ObjectTypeDefinition","FieldDefinition","InputValueDefinition","InterfaceTypeDefinition","UnionTypeDefinition","EnumTypeDefinition","EnumValueDefinition","InputObjectTypeDefinition","DirectiveDefinition","SchemaExtension","ScalarTypeExtension","ObjectTypeExtension","InterfaceTypeExtension","UnionTypeExtension","EnumTypeExtension","InputObjectTypeExtension","kindValues","isNode","maybeNode","maybeKind","OperationTypeNode","TokenKind","inspect","formatValue","seenValues","stringify","previouslySeenValues","isJSONable","jsonValue","len","formatArray","getObjectTag","formatObject","formatObjectValue","devAssert","Source","DirectiveLocation","dedentBlockStringValue","rawString","commonIndent","_commonIndent","isFirstLine","isEmptyLine","indent","getBlockStringIndentation","startLine","isBlank","endLine","str","char","isDigit","code","isLetter","isNameStart","Lexer","startOfFileToken","lastToken","token","lineStart","advance","lookahead","nextToken","readNextToken","isUnicodeScalarValue","isSupplementaryCodePoint","isLeadingSurrogate","isTrailingSurrogate","printCodePointAt","lexer","codePointAt","fromCodePoint","createToken","col","bodyLength","readComment","readBlockString","readString","readNumber","readName","firstCode","isFloat","readDigits","chunkStart","readEscapedUnicodeVariableWidth","readEscapedUnicodeFixedWidth","readEscapedCharacter","point","readHexDigit","read16BitHexCode","trailingCode","startColumn","rawValue","Parser","sourceObj","isSource","_lexer","_options","parseName","expectToken","parseDocument","definitions","many","parseDefinition","peek","parseOperationDefinition","hasDescription","peekDescription","keywordToken","parseSchemaDefinition","parseScalarTypeDefinition","parseObjectTypeDefinition","parseInterfaceTypeDefinition","parseUnionTypeDefinition","parseEnumTypeDefinition","parseInputObjectTypeDefinition","parseDirectiveDefinition","parseFragmentDefinition","parseTypeSystemExtension","unexpected","operation","QUERY","variableDefinitions","directives","selectionSet","parseSelectionSet","parseOperationType","parseVariableDefinitions","parseDirectives","operationToken","MUTATION","SUBSCRIPTION","optionalMany","parseVariableDefinition","parseVariable","parseTypeReference","expectOptionalToken","parseConstValueLiteral","parseConstDirectives","selections","parseSelection","parseFragment","parseField","nameOrAlias","alias","parseArguments","isConst","item","parseConstArgument","parseArgument","parseValueLiteral","hasTypeCondition","expectOptionalKeyword","parseFragmentName","typeCondition","parseNamedType","_this$_options","expectKeyword","allowLegacyFragmentVariables","parseList","parseObject","parseStringLiteral","varName","block","any","fields","parseObjectField","parseDirective","innerType","parseDescription","operationTypes","parseOperationTypeDefinition","interfaces","parseImplementsInterfaces","parseFieldsDefinition","delimitedMany","parseFieldDefinition","parseArgumentDefs","parseInputValueDef","parseUnionMemberTypes","parseEnumValuesDefinition","parseEnumValueDefinition","parseEnumValueName","getTokenDesc","parseInputFieldsDefinition","parseSchemaExtension","parseScalarTypeExtension","parseObjectTypeExtension","parseInterfaceTypeExtension","parseUnionTypeExtension","parseEnumTypeExtension","parseInputObjectTypeExtension","repeatable","parseDirectiveLocations","parseDirectiveLocation","_this$_options2","noLocation","getTokenKindDesc","atToken","openKind","parseFn","closeKind","delimiterKind","isPunctuatorTokenKind","docCache","fragmentSourceMap","printFragmentWarnings","experimentalFragmentVariables","normalize","ast","seenKeys","cacheKey","parsed","doc","workSet","stripLoc","fragmentDefinition","fragmentName","sourceKey","sourceKeySet","console","warn","gql","literals","_i","gql_1","extras","resetCaches","disableFragmentWarnings","enableExperimentalFragmentVariables","disableExperimentalFragmentVariables","PRICE_FRAGMENT","PACKAGE_ENTITLEMENT_FRAGMENT","ADDON_FRAGMENT","PLAN_FRAGMENT","client","getPlans","query","variables","paging","Published","isLatest","is","sorting","field","RefId","direction","Asc","SUBSCRIPTION_FRAGMENT","PROMOTIONAL_ENTITLEMENT_FRAGMENT","CUSTOMER_FRAGMENT","getCustomer","customerId","refId","fetchPolicy","paywall","customers","ensureCustomerRefIdExists","mapEntitlementByDecision","decision","featureId","entitlement","requestedUsage","featureType","calculatedEntitlement","meterType","Fluctuating","Incremental","usageLimit","featureUnits","featureUnitsPlural","hasUnlimitedUsage","currentUsage","featureUsage","resetPeriod","nextResetDate","resetPeriodConfiguration","mapSlimEntitlement","feature","FeatureNotFound","mapFullEntitlementByDecision","mapFullEntitlement","featureDescription","displayName","featureDisplayName","fullEntitlement","mapCachedEntitlement","mapCachedEntitlements","updatedEntitlements","mapPlans","resultData","plans","edges","sortPlans","plan","mapPlan","mapPrice","pricing","price","mappedPrice","billingModel","billingPeriod","amount","currency","order","basePlan","entitlements","packageEntitlement","mapPackageEntitlement","inheritedEntitlements","prices","defaultTrialConfig","compatibleAddons","addon","mapAddon","mapCustomer","customer","CustomerModel","email","createdAt","updatedAt","mapSubscription","mapPromotionalEntitlement","featureMeterType","endDate","isVisible","subscription","planPrice","addons","quantity","startDate","rootPlans","addAncestor","basePlanId","subPlans","genericMessage","_a","InvariantError","_super","_this","framesToPop","verbosityLevels","verbosityLevel","wrapConsoleMethod","log","maybe","thunk","debug","globalThis","window","GLOBAL_KEY","__DEV__","safeGlobal","needToRemove","_arrayLikeToArray","arr","arr2","_defineProperties","descriptor","_createClass","Constructor","protoProps","staticProps","env","NODE_ENV","DEV","hasSymbols","hasSymbol","getSymbol","observable","SymbolIterator","SymbolObservable","SymbolSpecies","getMethod","getSpecies","ctor","Observable","isObservable","hostReportError","enqueue","cleanupSubscription","cleanup","_cleanup","unsubscribe","closeSubscription","_observer","_queue","_state","notifySubscription","observer","m","onNotify","queue","flushSubscription","Subscription","subscriber","subscriptionObserver","SubscriptionObserver","_subscription","_proto2","complete","_subscriber","_proto3","subscribe","_this2","_this3","_this4","C","hasSeed","hasValue","seed","acc","_this5","_len","_key","startNext","_this6","inner","completeIfDone","closed","_step","_iterator","o","allowArrayLike","it","minLen","_unsupportedIterableToArray","_createForOfIteratorHelperLoose","of","_len2","_key2","isNonNullObject","getFragmentQueryDocument","document","actualFragmentName","fragments","definition","createFragmentMap","symTable","fragment","getFragmentFromSelection","selection","fragmentMap","makeReference","__ref","isReference","valueToObjectRepresentation","argObj","isIntValue","isFloatValue","Number","isBooleanValue","isStringValue","isObjectValue","nestedArgObj_1","isVariable","variableValue","isListValue","listValue","nestedArgArrayObj","isEnumValue","isNullValue","KNOWN_DIRECTIVES","getStoreKeyName","fieldName","filterKeys","filteredArgs_1","completeFieldName","stringifiedArgs","setStringify","stringifyReplacer","argumentsObjectFromField","argObj_1","resultKeyNameFromField","getTypenameFromResult","__typename","typename","isInlineFragment","checkDocument","operations","getOperationDefinition","getOperationName","getFragmentDefinitions","getQueryDefinition","queryDef","getMainDefinition","queryDoc","getDefaultValues","defaultValues","defs","def","passthrough","forward","toLink","handler","ApolloLink","isTerminating","link","LinkError","empty","links","left","right","leftLink","rightLink","execute","starting","createOperation","transformedOperation","operationName","transformOperation","OPERATION_FIELDS","validateOperation","second","firstLink","nextLink","onError","setOnError","BREAK","freeze","visit","visitor","visitorKeys","enterLeaveMap","getEnterLeaveForKind","inArray","edits","ancestors","newRoot","isLeaving","isEdited","editOffset","editKey","editValue","arrayKey","getOwnPropertyDescriptors","_enterLeaveMap$get","_enterLeaveMap$get2","visitFn","leave","enter","_node$kind","kindVisitor","serializeFetchParameter","serialized","parseError","throwServerError","statusCode","escapedRegExp","escapedReplacer","escapeSequences","print","printDocASTReducer","varDefs","argsLine","isBlockString","preferMultipleLines","isSingleLine","hasLeadingSpace","hasTrailingQuote","hasTrailingSlash","printAsMultipleLines","printBlockString","hasMultilineItems","maybeArray","_maybeArray$filter$jo","maybeString","_maybeArray$some","fallbackHttpConfig","http","includeQuery","includeExtensions","accept","headersToLowerCase","normalized_1","fromError","errorValue","backupFetch","HttpLink","linkOptions","uri","preferredFetch","useGETForQueries","_b","includeUnusedVariables","requestOptions","fetcher","checkFetcher","linkConfig","fetchOptions","chosenURI","fallbackURI","getContext","selectURI","clientAwarenessHeaders","clientAwareness","name_1","version","controller","contextHeaders","contextConfig","fallbackConfig","configs","config","selectHttpOptionsAndBody","unusedNames_1","delete","_c","AbortController","createSignalIfSupported","_controller","_d","queryParams","addQueryParam","encodeURIComponent","serializedVariables","serializedExtensions","preFragment","fragmentStart","substr","queryParamsPrefix","newURI","rewriteURIForGET","setContext","bodyText","catch","errors","createHttpLink","objects","fnToStr","previousComparisons","equal","a","check","full","suffix","aTag","previouslyCompared","aKeys","definedKeys","bKeys","keyCount","k","aIterator","info","aKey","aValue","aCode","nativeCodeSuffix","isDefinedKey","bSet","stringifyCanon","stringifyCache","defaultMakeData","Trie","weakness","makeData","lookup","lookupArray","getChildTrie","isObjRef","weak","strong","child","canUseWeakMap","navigator","product","canUseWeakSet","WeakSet","canUseSymbol","for","ObjectCanon","known","pool","passes","keysByJSON","admit","isKnown","pass","shallowCopy","original","proto_1","array_1","sortedKeys","firstValueIndex_1","sorted","obj_1","canonicalStringify","resetCanonicalStringify","canonical","reset","asyncMap","mapFn","catchFn","activeCallbackCount","completed","promiseQueue","makeCallback","examiner","delegate","both","caught","sub","graphQLResultHasError","filterInPlace","elem","TYPENAME_FIELD","nullIfDocIsEmpty","fragmentDef","getFragmentDefinition","getDirectiveMatcher","directive","removeDirectivesFromDocument","variablesInUse","variablesToRemove","fragmentSpreadsInUse","fragmentSpreadsToRemove","modifiedDoc","getAllFragmentSpreadsFromSelectionSet","frag","argMatcher","argument","aConfig","getArgumentMatcher","varDef","argConfig","argMatchCount_1","removeArgumentsFromDocument","fs","removeFragmentSpreadFromDocument","addTypenameToDocument","added","connectionRemoveConfig","willRemove","allFragments","buildQueryFromSelectionSet","shouldInclude","isInclusionDirective","directiveArguments","directiveName","ifArgument","ifValue","getInclusionDirectives","evaledValue","hasDirectives","names","getDirectiveNames","hasClientExports","prefixCounts","makeUniqueId","iterateObserversSafely","observers","observersWithMethod","obs","fixObservableSubclass","subclass","species","isPromiseLike","Concast","addObserver","removeObserver","addCount","handlers","latest","reason","deliverLastMessage","nextOrError","quietly","called","isNonEmptyArray","NetworkStatus","ApolloError","graphQLErrors","clientErrors","networkError","errorMessage","extraInfo","isNetworkRequestInFlight","networkStatus","cloneDeepHelper","val","copy_1","copy_2","warnedAboutUpdateQuery","ObservableQuery","queryManager","queryInfo","subObserver","defaultSubscriptionObserverErrorCallback","reobserve","tearDownQuery","isTornDown","queryId","generateQueryId","opDef","queryName","initialFetchPolicy","removeQuery","getCurrentResult","saveAsLastResult","lastResult","getLastResult","ready","loading","hasForcedResolvers","diff","getDiff","returnPartialData","partialRefetch","logMissingFieldErrors","missing","updateLastResult","isDifferentFromLastResult","newResult","getLast","variablesMustMatch","getLastError","resetLastResults","resetQueryStoreErrors","resetErrors","refetch","reobserveOptions","pollInterval","vars","resetLastWrite","fetchMore","fetchMoreOptions","combinedOptions","qid","notifyOnNetworkStatusChange","observe","fetchQuery","fetchMoreResult","updateQuery","writeQuery","finally","stopQuery","subscribeToMore","startGraphQLSubscription","subscriptionData","setOptions","newOptions","setVariables","optimistic","broadcastQueries","startPolling","updatePolling","stopPolling","newNetworkStatus","setObservableQuery","fetchQueryObservable","ssrMode","pollingInfo","interval","maybeFetch","poll","timeout","assumeImmutableResults","useDisposableConcast","oldVariables","concast","reportResult","reportError","errorResult","hasObservers","mergeDeep","mergeDeepArray","merger","DeepMerger","defaultReconciler","reconciler","pastCopies","targetValue","shallowCopyForMerge","currentContext","MISSING_VALUE","globalKey","host","Slot","context_1","slots","withValue","saved","noContext","defaultDispose","dispose","newest","oldest","getNode","older","newer","clean","parentEntrySlot","maybeUnsubscribe","entryOrDep","emptySetPool","assert","optionalMessage","valueGet","Entry","parents","childValues","dirtyChildren","dirty","recomputing","deps","mightBeDirty","rememberParent","recompute","forgetChildren","recomputeNewValue","setDirty","maybeSubscribe","reportClean","setClean","reallyRecompute","reportDirty","eachParent","forgetChild","forget","dependOn","dep","forgetDeps","reportDirtyChild","reportCleanChild","parentCount","parentWasClean","childValue","removeDirtyChild","dc","_value","EntryMethods","depsByKey","depend","dep_1","entryMethodName","m_1","makeDefaultMakeCacheKeyFunction","keyTrie","originalFunction","pow","keyArgs","makeCacheKey","dirtyKey","peekKey","forgetKey","getKey","cacheSlot","cacheInfoMap","getCacheInfo","forgetCache","rv","makeVar","listeners","broadcast","oldListeners","listener","attach","onNextChange","attachCache","broadcastWatches","LocalState","resolvers","fragmentMatcher","addResolvers","setFragmentMatcher","resolverGroup","setResolvers","getResolvers","runResolvers","remoteResult","onlyRunForcedResolvers","resolveDocument","localResult","getFragmentMatcher","clientQuery","serverQuery","removeClientSetsFromDocument","prepareContext","getCacheKey","identify","addExportedVariables","buildRootValueFromCache","exportedVariables","shouldForceResolvers","forceResolvers","rootValue","mainDefinition","definitionOperation","defaultOperationType","execContext","resolveSelectionSet","resultsToMerge","resolveField","fieldResult","fragmentResult","all","aliasedFieldName","aliasUsed","defaultResult","resultPromise","resolverType","resolverMap","resolveSubSelectedArray","destructiveMethodCounts","wrapDestructiveCacheMethod","cancelNotifyTimeout","QueryInfo","lastRequestId","stopped","observableQuery","lastDiff","getDiffOptions","updateWatch","oq","updateLastDiff","canonizeResults","setDiff","oldDiff","notifyTimeout","notify","oqListener","fromOptimisticTransaction","shouldNotify","stop","watchOptions","watcher","lastWatch","watch","lastWrite","shouldWrite","dmCount","markResult","cacheWriteBehavior","shouldWriteResult","errorPolicy","performTransaction","overwrite","diffOptions","markReady","markError","ignoreErrors","writeWithErrors","QueryManager","queryDeduplication","onBroadcast","localState","queries","fetchCancelFns","transformCache","queryIdCounter","requestIdCounter","mutationIdCounter","inFlightLinkObservables","mutationStore","_info","stopQueryNoBroadcast","cancelPendingFetches","mutate","mutation","optimisticResponse","updateQueries","refetchQueries","awaitRefetchQueries","updateWithProxyFn","onQueryUpdated","_e","keepRootFields","mutationId","mutationStoreValue","_f","generateMutationId","getVariables","markMutationOptimistic","getObservableFromLink","storeResult","markMutationResult","removeOptimistic","cacheWrites","skipCache","dataId","updateQueries_1","currentQueryResult","nextQueryResult","mutationResult","queryVariables","results_1","updateCache","write","asQuery","modify","DELETE","include","recordOptimisticTransaction","getQueryStore","store","transformed","transformDocument","forLink","transformForLink","cacheEntry_1","defaultVars","watchQuery","generateRequestId","stopQueryInStore","stopQueryInStoreNoBroadcast","clearStore","discardWatches","getObservableQueries","queryNamesAndDocs","legacyQueryOptions","desc","getQuery","included","nameOrDoc","reFetchObservableQueries","includeStandby","observableQueryPromises","makeObservable","observablePromise_1","getLocalState","deduplication","inFlightLinkObservables_1","forceFetch","byVariables_1","varJson_1","getResultsFromLink","requestId","hasErrors","aqr","normalized","fromVariables","fetchQueryByPolicy","nextFetchPolicy","applyNextFetchPolicy","includedQueriesById","results","batch","onWatchUpdated","refetchWritePolicy","oldNetworkStatus","readCache","resultsFromCache","fromData","resolved","resultsFromLink","newContext","hasSuggestedDevtools","mergeOptions","ApolloClient","defaultOptions","resetStoreCallbacks","clearStoreCallbacks","ssrForceFetchDelay","connectToDevTools","__APOLLO_CLIENT__","typeDefs","clientAwarenessName","clientAwarenessVersion","disableNetworkFetches","resetStore","top","__APOLLO_DEVTOOLS_GLOBAL_HOOK__","nav","ua","userAgent","devToolsHookCb","mutations","dataWithOptimisticResults","extract","readQuery","readFragment","writeFragment","__actionHookForDevTools","cb","__requestRaw","payload","onResetStore","c","onClearStore","obsQuery","restore","serializedState","setLocalStateFragmentMatcher","setLink","newLink","ApolloCache","getFragmentDoc","optimisticId","transaction","gc","read","rootId","MissingFieldError","maybeDeepFreeze","isFrozen","shallowFreeze","hasOwn","defaultDataIdFromObject","_id","keyObject","defaultConfig","dataIdFromObject","addTypename","resultCaching","shouldCanonizeResults","TypeOrFieldNameRegExp","fieldNameFromStoreName","storeFieldName","selectionSetMatchesResult","storeValueIsStoreObject","delModifier","INVALIDATE","EntityStore","policies","rootIds","refs","getFieldValue","objectOrReference","canRead","objOrRef","toReference","objOrIdOrRef","mergeIntoStore","ref","toObject","storeObject","rootTypenamesById","Layer","dependOnExistence","existing","incoming","merged","storeObjectReconciler","caching","fieldsToDirty_1","__exists","hasKeyArgs","changedFields_1","needToMerge_1","allDeleted_1","sharedDetails_1","readField","fieldNameOrOptions","fieldValue","storage","getStorage","getStoreFieldName","evict","evicted","extraRootIds","getRootIdSet","__META","rest_1","retain","release","ids","snapshot","findChildRefIds","idsToRemove","root_1","found_1","workSet_1","keyMaker","CacheGroup","resetCaching","makeDepKey","maybeDependOnExistenceOfEntity","entityId","supportsResultCaching","Root","stump","Stump","storageTrie","addLayer","layerId","replay","removeLayer","ownStoreObject","parentStoreObject","fromParent","existingObject","incomingObject","existingValue","incomingValue","missingFromInvariant","execSelectionSetKeyArgs","StoreReader","knownResults","canon","executeSelectionSet","peekArgs","enclosingRef","execSelectionSetImpl","resultCacheMaxSize","varString","executeSubSelectedArray","execSubSelectedArrayImpl","resetCanon","diffQueryAgainstStore","rootRef","execResult","hasMissingFields","isFresh","objectsToMerge","finalResult","getMissing","handleMissing","rootIdsByTypename","resultName","fragmentMatches","childResult","getTypenameFromStoreObject","assertSelectionSetForIdValue","StoreWriter","writeToStore","operationDefinition","written","incomingById","clientOnly","processSelectionSet","mergeTree","entityRef","applied","applyMerges","fieldsWithSelectionSets_1","hasSelectionSet_1","childTree","hasMergeFunction_1","existingRef","incomingObj","getChild","parentType","typeDotName","warnings","childTypenames","warnAboutDataLoss","sets","incomingFields","resultFieldKey","wasClientOnly","getChildMergeTree","processFieldValue","childTypename","getMergeFunction","maybeRecycleChildMergeTree","mergeMergeTrees","mergeTreeIsEmpty","getStorageArgs","e_1","i_1","getValue_1","eVal","iVal","aVal","runMergeFunction","emptyMergeTreePool","needToMergeMaps","remainingRightKeys_1","leftTree","tree","stringifyForDisplay","undefId","argsFromFieldSpecifier","spec","nullKeyFieldsFn","simpleKeyArgsFn","_args","mergeTrueFn","mergeObjects","mergeFalseFn","Policies","typePolicies","toBeAdded","supertypeMap","fuzzySubtypes","usingPossibleTypes","setRootTypename","possibleTypes","addPossibleTypes","addTypePolicies","ROOT_QUERY","policy","getTypePolicy","keyFn","specifierOrId","keyFieldsFnFromSpecifier","queryType","mutationType","subscriptionType","updateTypePolicy","keyFields","setMerge","getFieldPolicy","keyArgsFnFromSpecifier","which","old","supertype","getSupertypeSet","subtype","policy_1","supertypes","inbox","createIfMissing","fieldPolicies","supertypeSet","typenameSupertypeSet","workQueue_1","maybeEnqueue_1","needToCheckFuzzySubtypes","checkingFuzzySubtypes","regExp","fuzzyString","fieldSpec","specifierOrString","directivesObj","storeKeyNameFromField","readOptions","makeFieldFunctionOptions","parentTypename","makeMergeObjectsFunction","eType","iType","specifier","computeKeyObject","trie","aliasMap","makeAliasMap","workQueue","responseKey","storeKey","aliases","subsets","strict","lastResponseKey","lastActualKey","keyObj","subset","responseName","InMemoryCache","watches","typenameDocumentCache","txCount","normalizeConfig","rootStore","optimisticData","resetResultCache","resetResultIdentities","previousReader","storeReader","storeWriter","maybeBroadcastWatch","broadcastWatch","immediate","idToRemove","newOptimisticData","perform","layer","alreadyDirty","packageJson","setFeatures","features","isLoaded","getEntitlement","validateFeature","setEntitlements","getEntitlements","SLIM_ENTITLEMENT","FULL_ENTITLEMENT","decideEntitlementPolicy","requestUsage","NoFeatureEntitlementInSubscription","getTime","RequestedUsageExceedingLimit","cacheService","entitlementsApi","modelMapper","ModelMapper","loadingEntitlements","featureRefId","EntitlementDecisionService","CustomerNotFound","loadEntitlements","doLoadEntitlements","cachedEntitlements","configuration","sdkKey","validateConfiguration","baseUri","withDefaults","graphClient","authLink","httpLink","apiGateway","entitlementsService","initialize","stigg","Stigg","setCustomerId","EntitlementsService","InMemoryCacheService","handleNoEntitlementFound","fallbackGrantedValue","anError","graphResponse","resp","rawCustomer","__webpack_module_cache__","__webpack_require__","moduleId","cachedModule","loaded","__webpack_modules__","getter","__esModule","r","nmd","children"],"sourceRoot":""}