{"version":3,"file":"0a301732-80640987a54e6507bccd.js","mappings":"qrDAaIA,EAAY,CAAC,YACbC,EAAa,CAAC,WACdC,EAAa,CAAC,iCAGlB,SAASC,EAAaC,GAAW,IAAIC,EAErC,WAAuC,GAAuB,oBAAZC,UAA4BA,QAAQC,UAAW,OAAO,EAAO,GAAID,QAAQC,UAAUC,KAAM,OAAO,EAAO,GAAqB,mBAAVC,MAAsB,OAAO,EAAM,IAAsF,OAAhFC,QAAQC,UAAUC,QAAQC,KAAKP,QAAQC,UAAUG,QAAS,IAAI,iBAAyB,EAAQ,MAAOI,GAAK,OAAO,GAF9PC,GAA6B,OAAO,WAAkC,IAAsCC,EAAlCC,GAAQ,OAAgBb,GAAkB,GAAIC,EAA2B,CAAE,IAAIa,GAAY,OAAgBC,MAAMC,YAAaJ,EAASV,QAAQC,UAAUU,EAAOI,UAAWH,QAAqBF,EAASC,EAAMK,MAAMH,KAAME,WAAc,OAAO,OAA2BF,KAAMH,IAM5Z,IAAIO,EAAuB,SAAyBC,GAChDC,EAAwB,SAAyBC,IAErD,SAASC,EAA2BC,EAAGC,GAAkB,IAAIC,EAAuB,oBAAXC,QAA0BH,EAAEG,OAAOC,WAAaJ,EAAE,cAAe,IAAKE,EAAI,CAAE,GAAIG,MAAMC,QAAQN,KAAOE,EAE9K,SAAqCF,EAAGO,GAAU,IAAKP,EAAG,OAAQ,GAAiB,iBAANA,EAAgB,OAAOQ,EAAkBR,EAAGO,GAAS,IAAIE,EAAIC,OAAO3B,UAAU4B,SAAS1B,KAAKe,GAAGY,MAAM,GAAI,GAAc,WAANH,GAAkBT,EAAER,cAAaiB,EAAIT,EAAER,YAAYqB,MAAM,GAAU,QAANJ,GAAqB,QAANA,EAAa,OAAOJ,MAAMS,KAAKd,GAAI,GAAU,cAANS,GAAqB,2CAA2CM,KAAKN,GAAI,OAAOD,EAAkBR,EAAGO,GAFnOS,CAA4BhB,KAAOC,GAAkBD,GAAyB,iBAAbA,EAAEiB,OAAqB,CAAMf,IAAIF,EAAIE,GAAI,IAAIgB,EAAI,EAAOC,EAAI,aAAiB,MAAO,CAAEC,EAAGD,EAAGV,EAAG,WAAe,OAAIS,GAAKlB,EAAEiB,OAAe,CAAEI,MAAM,GAAe,CAAEA,MAAM,EAAOC,MAAOtB,EAAEkB,OAAWhC,EAAG,SAAWqC,GAAM,MAAMA,GAAOC,EAAGL,GAAO,MAAM,IAAIM,UAAU,yIAA4I,IAA6CC,EAAzCC,GAAmB,EAAMC,GAAS,EAAY,MAAO,CAAER,EAAG,WAAelB,EAAKA,EAAGjB,KAAKe,IAAOS,EAAG,WAAe,IAAIoB,EAAO3B,EAAG4B,OAAsC,OAA9BH,EAAmBE,EAAKR,KAAaQ,GAAS3C,EAAG,SAAW6C,GAAOH,GAAS,EAAMF,EAAMK,GAAQP,EAAG,WAAe,IAAWG,GAAiC,MAAbzB,EAAG8B,QAAgB9B,EAAG8B,SAAY,QAAU,GAAIJ,EAAQ,MAAMF,KAIz9B,SAASlB,EAAkByB,EAAKC,IAAkB,MAAPA,GAAeA,EAAMD,EAAIhB,UAAQiB,EAAMD,EAAIhB,QAAQ,IAAK,IAAIC,EAAI,EAAGiB,EAAO,IAAI9B,MAAM6B,GAAMhB,EAAIgB,EAAKhB,IAAOiB,EAAKjB,GAAKe,EAAIf,GAAM,OAAOiB,EAEhL,SAASC,EAAQC,EAAQC,GAAkB,IAAIC,EAAO7B,OAAO6B,KAAKF,GAAS,GAAI3B,OAAO8B,sBAAuB,CAAE,IAAIC,EAAU/B,OAAO8B,sBAAsBH,GAAaC,IAAkBG,EAAUA,EAAQC,QAAO,SAAUC,GAAO,OAAOjC,OAAOkC,yBAAyBP,EAAQM,GAAKE,eAAkBN,EAAKO,KAAKpD,MAAM6C,EAAME,GAAY,OAAOF,EAElV,SAASQ,EAAcC,GAAU,IAAK,IAAI9B,EAAI,EAAGA,EAAIzB,UAAUwB,OAAQC,IAAK,CAAE,IAAI+B,EAAyB,MAAhBxD,UAAUyB,GAAazB,UAAUyB,GAAK,GAAQA,EAAI,EAAKkB,EAAQ1B,OAAOuC,IAAS,GAAMC,SAAQ,SAAUC,IAAO,OAAiBH,EAAQG,EAAKF,EAAOE,OAAsBzC,OAAO0C,0BAA6B1C,OAAO2C,iBAAiBL,EAAQtC,OAAO0C,0BAA0BH,IAAmBb,EAAQ1B,OAAOuC,IAASC,SAAQ,SAAUC,GAAOzC,OAAO4C,eAAeN,EAAQG,EAAKzC,OAAOkC,yBAAyBK,EAAQE,OAAe,OAAOH,EAuB9gB,IAAIO,EAJJ,SAAmBC,GACjB,QAASA,GAAuB,mBAAXA,EAAEC,MAuBzB,IAAIC,EARJ,SAAoBC,EAAGC,GACrB,GAAS,MAALD,EACF,OAAOA,EAGT,MAAM,IAAIE,MAAMD,MAAAA,EAAyCA,EAAU,qCAMjEE,EAAW,SAASA,KACtB,OAAgBvE,KAAMuE,IAGpBC,EAAW,IAAID,EACfE,EAAoB,CACtBC,WAAY,aAGZC,aAAc,WAIZ,MAHY,IAAIL,MAChB,oCAAqCM,OAAO5E,KAAK6E,MAAO,aAI1DC,WAAY,aAGZC,aAAc,WAIZ,MAHY,IAAIT,MAChB,oCAAqCM,OAAO5E,KAAK6E,MAAO,aAI1DG,aAAc,aAGdC,eAAgB,WAId,MAHY,IAAIX,MAChB,sCAAuCM,OAAO5E,KAAK6E,MAAO,aAI5DK,GAAI,SAAYC,GAEd,OAAOA,EAAMN,QAAU7E,KAAK6E,OAASM,EAAMC,WAAapF,KAAKoF,UAI/DC,IAAK,SAAaC,GAChB,IAAIC,EAAQvF,KAGZ,GAAmB,aAAfA,KAAK6E,MAEP,OAAO7E,KAIT,GAAmB,aAAfA,KAAK6E,MACP,IAEE,IAAItC,EAAO+C,EAAKtF,KAAKoF,UAGrB,OAAOpB,EAAiBzB,GAAQiD,EAAoBjD,EAAK2B,MAAK,SAAUnC,GACtE,MAAO,CACL0D,QAAS1D,OAEP2D,EAAkBnD,GACxB,MAAO5C,GACP,OAAOqE,EAAiBrE,GAGxB6F,EAAoB7F,EAAE4C,MAAK,WACzB,OAAO+C,EAAKC,EAAMH,cACdO,EAAkBhG,GAK5B,GAAmB,YAAfK,KAAK6E,MACP,OAAOW,EACPxF,KAAKoF,SACJlB,MAAK,SAAUnC,GACd,MAAO,CACL0D,QAASH,EAAKvD,EAAM0D,aAErBG,OAAM,SAAUjG,GACjB,GAAIqE,EAAiBrE,GAGnB,OAAOA,EAAEuE,MAAK,WACZ,OAAOoB,EAAKC,EAAMH,aAItB,MAAMzF,MAMV,MAFY,IAAI2E,MAAM,4BAM1B,SAASoB,EAAkB3D,GAEzB,OAAOZ,OAAO0E,OAAOrC,EAAcA,EAAc,CAC/CqB,MAAO,WACPO,SAAUrD,GACT0C,GAAoB,GAAI,CACzBqB,SAAU,WACR,OAAO9F,KAAKoF,UAEdW,UAAW,WACT,OAAOC,QAAQC,QAAQjG,KAAKoF,WAE9BV,WAAY,WACV,OAAO1E,KAAKoF,UAEdT,aAAc,WACZ,OAAO3E,KAAKoF,aAKlB,SAASO,EAAkBO,GACzB,OAAO/E,OAAO0E,OAAOrC,EAAcA,EAAc,CAC/CqB,MAAO,WACPO,SAAUc,GACTzB,GAAoB,GAAI,CACzBqB,SAAU,WACR,MAAM9F,KAAKoF,UAEbW,UAAW,WACT,OAAOC,QAAQG,OAAOnG,KAAKoF,WAE7BN,WAAY,WACV,OAAO9E,KAAKoF,UAEdL,aAAc,WACZ,OAAO/E,KAAKoF,aAOlB,SAASI,EAAoBY,GAC3B,OAAOjF,OAAO0E,OAAOrC,EAAcA,EAAc,CAC/CqB,MAAO,UACPO,SAAUgB,GACT3B,GAAoB,GAAI,CACzBqB,SAAU,WACR,MAAM9F,KAAKoF,SAASlB,MAAK,SAAUmC,GAEjC,OADcA,EAAMZ,YAIxBM,UAAW,WACT,OAAO/F,KAAKoF,SAASlB,MAAK,SAAUoC,GAElC,OADcA,EAAMb,YAIxBT,aAAc,WACZ,OAAOhF,KAAKoF,SAASlB,MAAK,SAAUqC,GAElC,OADcA,EAAMd,YAIxBR,eAAgB,WACd,OAAOjF,KAAKoF,SAASlB,MAAK,SAAUsC,GAElC,OADcA,EAAMf,eA6B5B,IAUIgB,EAVAC,EAAkB,CACpBhB,kBAAmBA,EACnBC,kBAAmBA,EACnBH,oBAAqBA,EACrBmB,gBA1BF,WACE,OAAOnB,EAAoB,IAAIQ,SAAQ,iBA0BvCY,YAvBF,SAAqBC,GACnB,OAAOA,EAAOC,OAAM,SAAUnF,GAC5B,MAAmB,aAAZA,EAAEkD,SACNa,EAAkBmB,EAAOxB,KAAI,SAAU1D,GAC1C,OAAOA,EAAEyD,aACLyB,EAAOE,MAAK,SAAUpF,GAC1B,MAAmB,aAAZA,EAAEkD,SACNc,EAAkBxB,EAAkB0C,EAAOG,MAAK,SAAUrF,GAC7D,MAAmB,aAAZA,EAAEkD,SACP,0CAA0CO,UAAYI,EAAoBQ,QAAQiB,IAAIJ,EAAOxB,KAAI,SAAU1D,GAC7G,OAAOA,EAAEyD,aACPlB,MAAK,SAAUnC,GACjB,MAAO,CACL0D,QAAS1D,QAWbwC,SAAUA,EACVC,SAAUA,GAMR0C,EAC6C,QAAhDT,EAAoB,0BAA0D,IAAtBA,EAA+BA,EAAoB,4BAM5G,IAAIU,EAAuB,CACzBC,oBALF,WACE,OAAOF,KAAwC,oBAAXG,QAA0BA,OAAOC,wDAKrEJ,iBAAkBA,GAEhBK,EAAwBJ,EAAqBC,oBAC7CI,GAAM,IAAIC,KAAMC,IAAI,oBAAoB,GAAMA,IAAI,iCAAiC,GAAMA,IAAI,wCAAwC,GAEzI,SAASC,EAAWC,GAClB,IAAIC,EAEJ,QAAW,gCAAPD,IAAyCL,OAIT,QAA5BM,EAAWL,EAAIM,IAAIF,UAA8B,IAAbC,GAAsBA,GAGpEF,EAAWI,QAAU,SAAUH,GAC7BJ,EAAIE,IAAIE,GAAI,IAGdD,EAAWK,QAAU,SAAUJ,GAC7BJ,EAAIE,IAAIE,GAAI,IAGd,IAAIK,EAAeN,EAwBnB,IAEIO,EAbJ,SAA8B7D,EAAS8D,GACrC,IAAIC,EAAQlI,UAAUwB,OAAS,QAAsB2G,IAAjBnI,UAAU,GAAmBA,UAAU,GAAK,GAOhF,OANYkI,EAAMlC,MAMX,MAyDT,IAAIoC,EAtCJ,SAA0BZ,EAAKa,GAC7B,IAAIhG,EAAO,IAAIiG,IAAId,GAEnB,OADAnF,EAAKkG,IAAIF,GACFhG,GA2DT,SAASlC,EAAeqI,EAAUC,GAChC,IAAIC,EAAOC,EAAWC,EAAO/G,EAE7B,OAAO,UAAyB,SAAyBgH,GACvD,OACE,OAAQA,EAASC,KAAOD,EAASxG,MAC/B,KAAK,EAEHqG,EAAQ,EACRC,EAAYrI,EAA2BkI,GACvCK,EAASC,KAAO,EAEhBH,EAAUhH,IAEZ,KAAK,EACH,IAAKiH,EAAQD,EAAU3H,KAAKY,KAAM,CAChCiH,EAASxG,KAAO,GAChB,MAKF,GAFAR,EAAQ+G,EAAM/G,OAET4G,EAAU5G,EAAO6G,KAAU,CAC9BG,EAASxG,KAAO,EAChB,MAIF,OADAwG,EAASxG,KAAO,EACTR,EAET,KAAK,EACHgH,EAASxG,KAAO,EAChB,MAEF,KAAK,GACHwG,EAASxG,KAAO,GAChB,MAEF,KAAK,GACHwG,EAASC,KAAO,GAChBD,EAASE,GAAKF,EAAgB,MAAE,GAEhCF,EAAUlJ,EAAEoJ,EAASE,IAEvB,KAAK,GAKH,OAJAF,EAASC,KAAO,GAEhBH,EAAU5G,IAEH8G,EAASG,OAAO,IAEzB,KAAK,GACL,IAAK,MACH,OAAOH,EAASI,UAGrB/I,EAAS,KAAM,CAAC,CAAC,EAAG,GAAI,GAAI,MAGjC,IAAIgJ,EAAwB/I,EAwE5B,IAAIgJ,EAvDJ,SAAqBX,EAAUY,GAE7B,OAAoB,UAAyB,SAASC,IACpD,IAAIX,EAAOY,EAAYC,EAAQ1H,EAE/B,OAAO,UAAyB,SAAkB2H,GAChD,OACE,OAAQA,EAAUV,KAAOU,EAAUnH,MACjC,KAAK,EACHqG,EAAQ,EACRY,EAAahJ,EAA2BkI,GACxCgB,EAAUV,KAAO,EAEjBQ,EAAW3H,IAEb,KAAK,EACH,IAAK4H,EAASD,EAAWtI,KAAKY,KAAM,CAClC4H,EAAUnH,KAAO,GACjB,MAKF,OAFAR,EAAQ0H,EAAO1H,MACf2H,EAAUnH,KAAO,EACV+G,EAASvH,EAAO6G,KAEzB,KAAK,EACHc,EAAUnH,KAAO,EACjB,MAEF,KAAK,GACHmH,EAAUnH,KAAO,GACjB,MAEF,KAAK,GACHmH,EAAUV,KAAO,GACjBU,EAAUT,GAAKS,EAAiB,MAAE,GAElCF,EAAW7J,EAAE+J,EAAUT,IAEzB,KAAK,GAKH,OAJAS,EAAUV,KAAO,GAEjBQ,EAAWvH,IAEJyH,EAAUR,OAAO,IAE1B,KAAK,GACL,IAAK,MACH,OAAOQ,EAAUP,UAGtBI,EAAS,KAAM,CAAC,CAAC,EAAG,GAAI,GAAI,QAjDb,IA2FtB,IAEII,EAfJ,SAA8BC,KAiB9B,SAASC,EAAgBC,EAAKlG,EAAK7B,GAYjC,OAXI6B,KAAOkG,EACT3I,OAAO4C,eAAe+F,EAAKlG,EAAK,CAC9B7B,MAAOA,EACPuB,YAAY,EACZyG,cAAc,EACdC,UAAU,IAGZF,EAAIlG,GAAO7B,EAGN+H,EAeT,IAAIG,EAAsB,SAASA,EAAoBC,IACrD,OAAgBlK,KAAMiK,GAEtBJ,EAAgB7J,KAAM,WAAO,GAE7BA,KAAK4D,IAAMsG,GAGTC,GAA2B,SAAUC,IACvC,OAAUD,EAAaC,GAEvB,IAAIC,EAASrL,EAAamL,GAE1B,SAASA,IAGP,OAFA,OAAgBnK,KAAMmK,GAEfE,EAAOlK,MAAMH,KAAME,WAG5B,OAAOiK,EAXsB,CAY7BF,GAEEK,GAAmC,SAAUC,IAC/C,OAAUD,EAAqBC,GAE/B,IAAIC,EAAUxL,EAAasL,GAE3B,SAASA,IAGP,OAFA,OAAgBtK,KAAMsK,GAEfE,EAAQrK,MAAMH,KAAME,WAG7B,OAAOoK,EAX8B,CAYrCL,GAMF,IAAIQ,GAAqB,CACvBR,oBAAqBA,EACrBE,YAAaA,GACbG,oBAAqBA,GACrBI,cARF,SAAuBtG,GACrB,OAAOA,aAAa+F,IAAe/F,aAAakG,KAS9CK,GAAuBF,GAAmBR,oBAC1CW,GAAuBH,GAAmBN,YAC1CU,GAAuBJ,GAAmBH,oBAC1CQ,GAAuBL,GAAmBC,cAC1CK,GAAoC5J,OAAO0E,OAAO,CACpDmF,UAAW,KACXf,oBAAqBU,GACrBR,YAAaS,GACbN,oBAAqBO,GACrBH,cAAeI,KAGbG,GAAe,SAASA,KAC1B,OAAgBjL,KAAMiL,IAGpBC,GAAgB,IAAID,GAEpBE,GAAmC,SAAUC,IAC/C,OAAUD,EAAqBC,GAE/B,IAAIC,EAAUrM,EAAamM,GAE3B,SAASA,EAAoBvH,GAG3B,OAFA,OAAgB5D,KAAMmL,GAEfE,EAAQ3L,KAAKM,KAAM,6CAA6C4E,OAAOhB,EAAK,gHAGrF,OAAOuH,EAX8B,EAYvB,OAAiB7G,QAG7BgH,GAAQ,IAAI7D,IAEZ8D,GAAe,IAAI9D,IAmCvB,IAAI+D,GAAgC,SAAUC,IAC5C,OAAUD,EAAkBC,GAE5B,IAAIC,EAAU1M,EAAawM,GAE3B,SAASA,IAGP,OAFA,OAAgBxL,KAAMwL,GAEfE,EAAQvL,MAAMH,KAAME,WAG7B,OAAOsL,EAX2B,EAYpB,OAAiBlH,QAkBjC,IAAIqH,GAAyB,IAAIlE,IAgCjC,SAASmE,GAAyBhI,GAChC,OAAO+H,GAAuB7D,IAAIlE,GAGpC,IAAIiI,GAAc,CAChBP,MAAOA,GACPC,aAAcA,GACdO,aA/FF,SAAsBC,GACpB,GAAIT,GAAMU,IAAID,EAAKnI,KAAM,CACvB,IAAIS,EAAU,uBAAwBO,OAAOmH,EAAKnI,IAAK,iJAavDqI,QAAQC,KAAK7H,GAGfiH,GAAM5D,IAAIqE,EAAKnI,IAAKmI,GACpB,IAAII,EAA0B,MAAZJ,EAAKrE,IAAc,IAAIqD,GAAqBT,oBAAoByB,EAAKnI,KAAO,IAAImH,GAAqBZ,YAAY4B,EAAKnI,KAExI,OADA2H,GAAa7D,IAAIqE,EAAKnI,IAAKuI,GACpBA,GA2EPC,QAvDF,SAAiBxI,GACf,IAAImI,EAAOT,GAAMxD,IAAIlE,GAErB,GAAY,MAARmI,EACF,MAAM,IAAIP,GAAiB,wCAAyC5G,OAAOhB,EAAK,OAGlF,OAAOmI,GAiDPM,aA7CF,SAAsBzI,GACpB,OAAO0H,GAAMxD,IAAIlE,IA6CjB0I,2BAxCF,SAAoC1I,GAClC,IAAI2I,EAEJ,GAAKtE,EAAa,iCAAlB,CAIA,IAGMuE,EAHFT,EAAOT,GAAMxD,IAAIlE,GAErB,GAAImI,MAAAA,GAA2G,QAA9DQ,EAAwBR,EAAKU,mCAAmE,IAA1BF,OAAhF,EAA4HA,EAAsB7M,KAAKqM,GAG5LT,GAAMoB,OAAO9I,GAC+C,QAA3D4I,EAAwBZ,GAAyBhI,UAA4C,IAA1B4I,GAA4CA,IAChHb,GAAuBe,OAAO9I,KA2BhC+I,yBAvBF,SAAkC/I,EAAKgJ,GAChC3E,EAAa,wCAIPI,IAAPuE,EACFjB,GAAuBe,OAAO9I,GAE9B+H,GAAuBjE,IAAI9D,EAAKgJ,KAgBlChB,yBAA0BA,GAC1BiB,oBA3GF,SAA6B7J,GAC3B,OAAOqG,EAAmBrG,GAAM,SAAUY,GACxC,OAAOO,EAAkBoH,GAAazD,IAAIlE,QA0G5C4H,iBAAkBA,GAClBP,aAAcA,GACdC,cAAeA,GACfC,oBAAqBA,IAanB2B,GAAgB,SAASA,KAC3B,OAAgB9M,KAAM8M,IAOxB,IAAIC,GACaD,GADbC,GAJJ,WACE,OAAO,IAAID,IAOTE,GAAqB1E,EACrB2E,GAAYpB,GAAYO,QACxBc,GAAiBrB,GAAYQ,aAC7Bc,GAAwBtB,GAAYgB,oBACpCO,GAAkBL,GAElBM,GAAWlM,OAAO0E,OAAO,IAAI2C,KAE7B8E,GAAwC,SAAUC,IACpD,OAAUD,EAA0BC,GAEpC,IAAIC,EAAUxO,EAAasO,GAE3B,SAASA,IAGP,OAFA,OAAgBtN,KAAMsN,GAEfE,EAAQrN,MAAMH,KAAME,WAG7B,OAAOoN,EAXmC,EAY5B,OAAiBhJ,QA8EjC,SAASmJ,GAA2BC,EAAOC,EAAW/J,EAAKgK,GACzD,IAAIC,EAAaH,EAAMI,WAEvB,IAAID,EAAWE,qBAAqB/B,IAAIpI,GAAxC,CAIA,IAAIoK,EAASf,GAAUrJ,GACnBqK,EApFN,SAAoCP,EAAOQ,EAASC,GAClD,IAAKlG,EAAa,iCAChB,OAAO,aAKT,IAAImG,EAAsBV,EAAMI,WAAWO,UAAUD,oBAErD,SAASE,EAAUC,GACjB,IAAI7G,EAAM0G,EAAoBtG,IAAIyG,GAE7B7G,GACH0G,EAAoB1G,IAAI6G,EAAM7G,EAAM,IAAIc,KAG1Cd,EAAIe,IAAIyF,GAGV,GAAIC,aAAsBf,GACxBkB,EAAUH,QACL,GAAIrN,MAAMC,QAAQoN,GAAa,CACpC,IACIK,EADAC,EAAajO,EAA2B2N,GAG5C,IACE,IAAKM,EAAW5M,MAAO2M,EAASC,EAAWvN,KAAKY,MAE9CwM,EADWE,EAAOzM,OAGpB,MAAOI,GACPsM,EAAW9O,EAAEwC,GACb,QACAsM,EAAWxM,KAIf,OAAO,WACL,GAAKgG,EAAa,iCAAlB,CAIA,IAAImG,EAAsBV,EAAMI,WAAWO,UAAUD,oBAcrD,GAAID,aAAsBf,GACxBsB,EAAeP,QACV,GAAIrN,MAAMC,QAAQoN,GAAa,CACpC,IACIQ,EADAC,EAAapO,EAA2B2N,GAG5C,IACE,IAAKS,EAAW/M,MAAO8M,EAASC,EAAW1N,KAAKY,MAE9C4M,EADYC,EAAO5M,OAGrB,MAAOI,GACPyM,EAAWjP,EAAEwC,GACb,QACAyM,EAAW3M,MA1Bf,SAASyM,EAAeH,GACtB,IAAI7G,EAAM0G,EAAoBtG,IAAIyG,GAE9B7G,GACFA,EAAIgF,OAAOwB,GAGTxG,GAAoB,IAAbA,EAAImH,MACbT,EAAoB1B,OAAO6B,KAgCVO,CAA2BpB,EAAO9J,EAAKoK,EAAOG,YACjEY,EAAcf,EAAOgB,KAAKtB,EAAOC,EAAWC,GAChDC,EAAWE,qBAAqBrG,IAAI9D,GAAK,WACvCmL,IACAd,QAqBJ,SAASgB,GAAiBvB,EAAO7I,EAAOjB,GACtC,OAAOqJ,GAAUrJ,GAAKsL,KAAKxB,EAAO7I,GAoEpC,SAASsK,GAAmBzB,EAAO7I,EAAO7B,GAKxC,IAJA,IAAIoM,EAAe,IAAI5G,IACnB6G,EAAgBvO,MAAMS,KAAKyB,GAC3BsM,EAAQ5B,EAAM6B,SAAS1K,EAAM2K,SAExB5L,EAAMyL,EAAcI,MAAO7L,EAAKA,EAAMyL,EAAcI,MAAO,CAClE,IAAIC,EAEJN,EAAa3G,IAAI7E,GACjB,IAGI+L,EADAC,EAAapP,EAF0E,QAApEkP,EAAwBJ,EAAMO,wBAAwB/H,IAAIlE,UAA4C,IAA1B8L,EAAmCA,EAAwBrC,IAK9J,IACE,IAAKuC,EAAW/N,MAAO8N,EAASC,EAAW1O,KAAKY,MAAO,CACrD,IAAIgO,EAAiBH,EAAO5N,MAEvBqN,EAAapD,IAAI8D,IACpBT,EAAc9L,KAAKuM,IAGvB,MAAO3N,GACPyN,EAAWjQ,EAAEwC,GACb,QACAyN,EAAW3N,KAIf,OAAOmN,EAGT,IAAIW,GA3GJ,SAAyBrC,EAAO7I,EAAOjB,GAErC,OADA6J,GAA2BC,EAAO7I,EAAOjB,EAAK,OACvCqJ,GAAUrJ,GAAKkE,IAAI4F,EAAO7I,IAyG/BkL,GAEgBd,GAFhBc,GAhFJ,SAAsBrC,EAAO7I,EAAOjB,EAAKoM,GACvC,IAAIjE,EAAOkB,GAAUrJ,GAErB,GAAgB,MAAZmI,EAAKrE,IACP,MAAM,IAAI4F,GAAyB,yCAAyC1I,OAAOhB,IAGrF,IAAI8D,EAAMqE,EAAKrE,IAGf,OADA+F,GAA2BC,EAAO7I,EAAOjB,EAAK,OACvC8D,EAAIgG,EAAO7I,EAAOmL,IAsEvBD,GAtHJ,SAAqBrC,EAAO9J,GAC1B,IAAIqM,EAEApL,EAAQ6I,EAAMI,WACgD,QAAjEmC,EAAwBpL,EAAMkJ,qBAAqBjG,IAAIlE,UAA4C,IAA1BqM,GAA4CA,IACtHpL,EAAMkJ,qBAAqBrB,OAAO9I,IAiHhCmM,GA/FJ,SAA4ClL,EAAOjB,EAAKoM,GACtD,IAAIE,EAEAnE,EAAOmB,GAAetJ,GAE1B,OADAmI,MAAAA,GAAqF,QAAxCmE,EAAmBnE,EAAKoE,kBAA6C,IAArBD,GAAuCA,EAAiBxQ,KAAKqM,EAAMlH,GACzJrB,EAAcA,EAAc,GAAIqB,GAAQ,GAAI,CACjDuL,WAAYvL,EAAMuL,WAAWC,QAAQ3D,OAAO9I,GAC5C0M,kBAAmBzL,EAAMyL,kBAAkBD,QAAQ3I,IAAI9D,EAAKoM,GAC5DO,WAAYvD,GAAmBnI,EAAM0L,WAAY3M,MAuFjDmM,GAnEJ,SAAsBrC,EAAO7I,EAAOjB,GAClC,IAAI4M,EAAqBC,EAAuBC,EAE5C7C,EAAaH,EAAMI,WACnBwB,EAAQ5B,EAAM6B,SAAS1K,EAAM2K,SAC7BmB,EAAO9C,EAAW+C,WAAW5E,IAAIpI,GAAO,OAASiK,EAAWgD,eAAe7E,IAAIpI,GAAO,gBAAayE,EACnGyI,EAAkB1H,EAAsB+F,GAAmBzB,EAAO7I,EAAO,IAAI2D,IAAI,CAAC5E,MAAQ,SAAUsK,GACtG,OAAOA,IAAYtK,KAErB,MAAO,CACLmN,SAAU9B,GAAiBvB,EAAO7I,EAAOjB,GACzCoN,SAAUnD,EAAW+C,WAAW5E,IAAIpI,IAAQiK,EAAWgD,eAAe7E,IAAIpI,GAC1EqN,MAAgB,aAATN,GAA8B9L,EAAMuL,WAAWpE,IAAIpI,GAC1DsN,WAAYrM,EAAM0L,WAAWvE,IAAIpI,GACjC+M,KAAMA,EAGNQ,KAAMhE,GAA0E,QAAnDqD,EAAsBlB,EAAM8B,SAAStJ,IAAIlE,UAA0C,IAAxB4M,EAAiCA,EAAsB,IAG/Ia,YAAa,CACX/F,MAAO6B,GAAsB2D,GAC7BQ,WAAYjI,EAAsN,QAAlMoH,EAAwG,QAA/EC,EAAyB7C,EAAW0D,6BAA6BzJ,IAAIlE,UAA6C,IAA3B8M,OAAoC,EAASA,EAAuBc,gBAAgD,IAA1Bf,EAAmCA,EAAwB,IAAI,SAAUgB,GAIjT,MAAO,CACLnQ,MAJU,OAAemQ,EAAO,GACjB,UA2CrB1B,GAOkBZ,GAPlBY,GAQ0BtC,GAE1BiE,GAAahL,EAAgBlC,SAC7BmN,GAAuB5B,GACvB6B,GAAoB7B,GACpB8B,GAAiB9B,GACjB+B,GAAiBjG,GAAYQ,aAC7B0F,GAAiBlG,GAAYZ,aAC7B+G,GAAwBnG,GAAYV,oBACpC8G,GAAwBlH,GAAqBd,oBAC7CiI,GAAgBnH,GAAqBZ,YACrCgI,GAAwBpH,GAAqBT,oBAC7C8H,GAAkBrH,GAAqBL,cAiE3C,SAAS2H,GAAY3E,EAAO7I,EAAOyN,GACjC,GAAoB,QAAhBA,EAAO3B,KAAgB,CACzB,IAMI4B,EANApG,EAAcmG,EAAOnG,YAErB6D,EA1BR,SAAiCtC,EAAO7I,EAAO2N,EAAQC,GACrD,IAAI7O,EAAM4O,EAAO5O,IAEjB,GAA8B,mBAAnB6O,EAA+B,CAIxC,IAAIC,EAAUd,GAAkBlE,EAAO7I,EAAOjB,GAE9C,GAAsB,YAAlB8O,EAAQ7N,MACV,MAAM,IAAImN,GAAsBpO,GAC3B,GAAsB,aAAlB8O,EAAQ7N,MACjB,MAAM6N,EAAQtN,SAIhB,OAAOqN,EAAeC,EAAQtN,UAE9B,OAAOqN,EAQQE,CAAwBjF,EAAO7I,EAAOsH,EADhCmG,EAAOG,gBAIxBG,EAAapS,EAFJqR,GAAenE,EAAO7I,EAAOsH,EAAYvI,IAAKoM,GAER6C,WAGnD,IACE,IAAKD,EAAW/Q,MAAO0Q,EAASK,EAAW1R,KAAKY,MAAO,CACrD,IAAIgR,GAAe,OAAeP,EAAOxQ,MAAO,GAIhDgR,GAAyBlO,EAHfiO,EAAa,GACRA,EAAa,KAI9B,MAAO3Q,GACPyQ,EAAWjT,EAAEwC,GACb,QACAyQ,EAAW3Q,UAER,GAAoB,gBAAhBqQ,EAAO3B,KAAwB,CAGxCoC,GAAyBlO,EAFbyN,EAAOnG,YAAYvI,IACf0O,EAAOvB,eAElB,GAAoB,iBAAhBuB,EAAO3B,KAAyB,CACzC,IAAIqC,EAAQV,EAAOnG,YAAYvI,IAC/BiB,EAAM0L,WAAW9H,IAAIuK,QAChB,GAAoB,mBAAhBV,EAAO3B,KAA2B,CAC3C,IAAIT,EAIA+C,EAAQX,EAAOnG,YAAYvI,IAC3BsP,EAAmBZ,EAAOY,iBAC1BnH,EAAO+F,GAAemB,GAC1BlH,MAAAA,GAAqF,QAAxCmE,EAAmBnE,EAAKoE,kBAA6C,IAArBD,GAAuCA,EAAiBxQ,KAAKqM,EAAMlH,GAChKA,EAAMuL,WAAW1D,OAAOuG,GACxBpO,EAAMyL,kBAAkB5I,IAAIuL,EAAOC,GACnCrO,EAAM0L,WAAW9H,IAAIwK,QAErB/K,EAA4B,kBAAkBtD,OAAO0N,EAAO3B,OAIhE,SAASoC,GAAyBlO,EAAOjB,EAAKmN,GACrB,aAAnBA,EAASlM,OAAwBkM,EAAS3L,oBAAoB2M,GAChElN,EAAMuL,WAAW1D,OAAO9I,GAExBiB,EAAMuL,WAAW1I,IAAI9D,EAAKmN,GAG5BlM,EAAM0L,WAAW9H,IAAI7E,GACrBiB,EAAMyL,kBAAkB5D,OAAO9I,GAGjC,SAASuP,GAAoBzF,EAAO0F,GAClC1F,EAAM2F,cAAa,SAAUxO,GAC3B,IAGIyO,EAHAC,EAAWC,GAAc3O,GAEzB4O,EAAajT,EAA2B4S,GAG5C,IACE,IAAKK,EAAW5R,MAAOyR,EAASG,EAAWvS,KAAKY,MAAO,CACrD,IAAIwQ,EAASgB,EAAOvR,MACpBsQ,GAAY3E,EAAO6F,EAAUjB,IAE/B,MAAOnQ,GACPsR,EAAW9T,EAAEwC,GACb,QACAsR,EAAWxR,IAIb,OADAyR,GAAsBhG,EAAO6F,GACtBA,KAIX,SAASI,GAA0BjG,EAAO4E,GACxC,GAAIsB,GAAWlS,OAAQ,CACrB,IAAImS,EAAiBD,GAAWA,GAAWlS,OAAS,GAChD0R,EAAUS,EAAe/L,IAAI4F,GAE5B0F,GACHS,EAAenM,IAAIgG,EAAO0F,EAAU,IAGtCA,EAAQ7P,KAAK+O,QAEba,GAAoBzF,EAAO,CAAC4E,IAIhC,IAAIsB,GAAa,GA+BjB,SAASJ,GAAc3O,GACrB,OAAOrB,EAAcA,EAAc,GAAIqB,GAAQ,GAAI,CACjDuL,WAAYvL,EAAMuL,WAAWC,QAC7BC,kBAAmBzL,EAAMyL,kBAAkBD,QAC3CE,WAAY,IAAI/H,IAAI3D,EAAM0L,cAI9B,SAASmD,GAAsBhG,EAAO7I,GAGpC,IAGIiP,EADAC,EAAavT,EAFCmR,GAAqBjE,EAAO7I,EAAOA,EAAM0L,aAK3D,IACE,IAAKwD,EAAWlS,MAAOiS,EAASC,EAAW7S,KAAKY,MAAO,CACrD,IAEIkS,EAAeC,EAFfrQ,EAAMkQ,EAAO/R,MAIyB,QAAzCiS,EAAgBlC,GAAelO,UAAoC,IAAlBoQ,GAA2F,QAAtDC,EAAwBD,EAAc7D,kBAAkD,IAA1B8D,GAA4CA,EAAsBvU,KAAKsU,EAAenP,IAE7O,MAAO1C,GACP4R,EAAWpU,EAAEwC,GACb,QACA4R,EAAW9R,KAIf,SAASiS,GAAexG,EAAOvB,EAAasG,GAC1CkB,GAA0BjG,EAAO,CAC/BiD,KAAM,MACNxE,YAAaA,EACbsG,eAAgBA,IA+BpB,IAAI0B,GAAiB,EA0CrB,IAAIC,GAA8B,CAChC9J,oBAAqB6H,GACrBlI,oBAAqBgI,GACrB9H,YAAa+H,GACbmC,yBA9SF,SAAkC3G,EAAO4G,GACvC,IAGIC,EAAsBC,EAHtB5Q,EAAM0Q,EAAM1Q,IACZ+J,EAAYzN,UAAUwB,OAAS,QAAsB2G,IAAjBnI,UAAU,GAAmBA,UAAU,GAAKwN,EAAMI,WAAW2G,YAMjG5G,EAAaH,EAAMI,WAEjBH,EAAU6B,UAAY3B,EAAW4G,YAAYjF,SAAW7B,EAAU6B,WAA8D,QAAhD+E,EAAuB1G,EAAW6G,gBAA+C,IAAzBH,OAAkC,EAASA,EAAqB/E,UAAY7B,EAAU6B,WAAmE,QAArDgF,EAAwB3G,EAAW8G,oBAAoD,IAA1BH,OAAmC,EAASA,EAAsBhF,UAC/WtH,EAA4B,uCAG9B,IAAI6I,EAAWa,GAAkBlE,EAAOC,EAAW/J,GAYnD,MAVuB,YAAnBmN,EAASlM,OACXkM,EAAS3L,SAASQ,OAAM,WAKtB,OAAO8L,MAIJX,GAqRPmD,eAAgBA,GAChBU,uBA3EF,SAAgClH,EAAOvB,EAAa4E,GAClD,GAAIA,aAAoBgB,GACtB,OAAOmC,GAAexG,EAAOvB,EAAa4E,GAG5C4C,GAA0BjG,EAAO,CAC/BiD,KAAM,cACNxE,YAAaA,EACb4E,SAAUA,KAoEZ8D,wBAhEF,SAAiCnH,EAAOvB,GACtCwH,GAA0BjG,EAAO,CAC/BiD,KAAM,eACNxE,YAAaA,KA8Df2I,0BA1DF,SAAmCpH,EAAOvB,EAAa+G,GACrDS,GAA0BjG,EAAO,CAC/BiD,KAAM,iBACNxE,YAAaA,EACb+G,iBAAkBA,KAuDpB6B,uBAjDF,SAAgCrH,EAAOsH,EAAQ1L,GAC7C,IAAI1F,EAAMoR,EAAOpR,IACbqR,EAAqB/U,UAAUwB,OAAS,QAAsB2G,IAAjBnI,UAAU,GAAmBA,UAAU,GAAK,KACzFgV,EAAQf,KACRtG,EAAaH,EAAMI,WASvB,GAPKD,EAAW0D,6BAA6BvF,IAAIpI,IAC/CiK,EAAW0D,6BAA6B7J,IAAI9D,EAAK,IAAI6D,KAGvDtD,EAAkB0J,EAAW0D,6BAA6BzJ,IAAIlE,IAAM8D,IAAIwN,EAAO,CAACD,MAAAA,EAA+DA,EAAqB,iBAAkB3L,IAGlLrB,EAAa,+BAAgC,CAC/C,IAAIyM,EAAWhH,EAAMI,WAAW4G,SAE5BA,GAAYA,EAASnE,WAAWvE,IAAIpI,IACtC0F,EAASoL,GAIb,MAAO,CACLS,QAAS,WACP,IAAItH,EAAaH,EAAMI,WACnBsH,EAAOvH,EAAW0D,6BAA6BzJ,IAAIlE,QAE1CyE,IAAT+M,GAAuBA,EAAKpJ,IAAIkJ,IAKpCE,EAAK1I,OAAOwI,GAEM,IAAdE,EAAKvG,MACPhB,EAAW0D,6BAA6B7E,OAAO9I,IAP/CsE,EAA4B,iDAAiDtD,OAAOhB,EAAK,kCAuB/F8G,cAAe0H,GACfiD,qBAxRF,SAA8BjF,EAAYkF,GACxC,IAAIzV,EAASuQ,EAAWC,QAQxB,OAPAiF,EAAO3R,SAAQ,SAAU4E,EAAGgN,GACV,aAAZhN,EAAE1D,OAAwB0D,EAAEnD,oBAAoB2M,GAClDlS,EAAO6M,OAAO6I,GAEd1V,EAAO6H,IAAI6N,EAAGhN,MAGX1I,GAiRP2V,WAtJF,WACE,IAAI3B,EAAiB,IAAIpM,IAEzB,OADAmM,GAAWrQ,KAAKsQ,GACT,WACL,IACI4B,EADAC,EAAalV,EAA2BqT,GAG5C,IACE,IAAK6B,EAAW7T,MAAO4T,EAASC,EAAWxU,KAAKY,MAAO,CACrD,IAAI6T,GAAe,OAAeF,EAAO1T,MAAO,GAIhDoR,GAHYwC,EAAa,GACXA,EAAa,KAI7B,MAAOxT,GACPuT,EAAW/V,EAAEwC,GACb,QACAuT,EAAWzT,IAGA2R,GAAWnE,QAEToE,GACb3L,EAA4B,sCA+HhC6K,yBAA0BA,GAC1BW,sBAAuBA,GACvBF,cAAeA,GACfoC,kCAAmClC,IAgBjCmC,GAA0B,0BAmC1BC,GAAe1B,GAA4BoB,WAE3CO,GAhB6B,CAC/BF,wBArBwB,CACxBA,wBAAyBA,IAiByBA,yBAiBOA,wBA0CvDG,GAhCa,SAAoBC,GACnCF,GAAUE,GA+BRD,GAfe,SAAsB1M,GACvCyM,IAAQ,WACN,IAAIG,EAAW,aAIf,IACEA,EAAWJ,KACXxM,IACA,QACA4M,SAyBN,IAAIC,GAAe,CACjBC,iBALF,SAA0BvU,EAAGI,GAC3BA,MAmEF,IAAIoU,GA1CJ,SAAwB3O,GAGtB,IAFA,IAAI4O,EAAM,IAAI9N,IAEL+N,EAAQrW,UAAUwB,OAAQ8U,EAAyB,IAAI1V,MAAMyV,EAAQ,EAAIA,EAAQ,EAAI,GAAIE,EAAQ,EAAGA,EAAQF,EAAOE,IAC1HD,EAAuBC,EAAQ,GAAKvW,UAAUuW,GAGhD,IACIC,EADAC,EAAcnW,EAA2BkH,GAG7C,IACEkP,EAAO,IAAKD,EAAY9U,MAAO6U,EAAUC,EAAYzV,KAAKY,MAAO,CAC/D,IAGI+U,EAHA9U,EAAQ2U,EAAQ3U,MAEhB+U,EAActW,EAA2BgW,GAG7C,IACE,IAAKM,EAAYjV,MAAOgV,EAAUC,EAAY5V,KAAKY,MAAO,CACxD,IAAIiV,EAAWF,EAAQ9U,MAEvB,GAAIgV,EAAS/K,IAAIjK,GACf,SAAS6U,GAGb,MAAOzU,GACP2U,EAAYnX,EAAEwC,GACd,QACA2U,EAAY7U,IAGdqU,EAAI7N,IAAI1G,IAEV,MAAOI,GACPwU,EAAYhX,EAAEwC,GACd,QACAwU,EAAY1U,IAGd,OAAOqU,GA4BT,IAAIU,GARJ,SAAgB3R,EAAKiE,GACnB,IAAIzJ,EAAS,IAAI4H,IAIjB,OAHApC,EAAI1B,SAAQ,SAAU5B,EAAO6B,GAC3B/D,EAAO6H,IAAI9D,EAAK0F,EAASvH,EAAO6B,OAE3B/D,GAyBT,SAASoX,GAA4B9F,EAAM7B,EAE3C4H,GACE,IAAI9F,EAAW9B,EAAM8B,SACjBvB,EAA0BP,EAAMO,wBACpCsB,EAAKxN,SAAQ,SAAUwT,EAAWC,GAChC,IAAIC,EAAoBjG,EAAStJ,IAAIsP,GAEjCC,GAAqBH,GAAcG,IAAsBH,EAAW9F,SAAStJ,IAAIsP,KAKrFhG,EAAS1J,IAAI0P,EAAY,IAAI5O,IAAI2O,KAES,MAArBE,EAA4BF,EAAYd,GAAsBc,EAAWE,IAC/E1T,SAAQ,SAAU2T,GAC1BzH,EAAwB7D,IAAIsL,IAC/BzH,EAAwBnI,IAAI4P,EAAU,IAAI9O,KAG7BrE,EAAkB0L,EAAwB/H,IAAIwP,IACpD7O,IAAI2O,MAGXC,GACqBhB,GAAsBgB,EAAmBF,GAC/CxT,SAAQ,SAAU2T,GACjC,GAAKzH,EAAwB7D,IAAIsL,GAAjC,CAIA,IAAIC,EAAWpT,EAAkB0L,EAAwB/H,IAAIwP,IAC7DC,EAAS7K,OAAO0K,GAEM,IAAlBG,EAAS1I,MACXgB,EAAwBnD,OAAO4K,WA4DzC,IAAIE,GA7GJ,SAAoBlI,GAClB,MAAO,CACL8B,SAAU4F,GAAc1H,EAAM8B,UAAU,SAAUvP,GAChD,OAAO,IAAI2G,IAAI3G,MAEjBgO,wBAAyBmH,GAAc1H,EAAMO,yBAAyB,SAAUhO,GAC9E,OAAO,IAAI2G,IAAI3G,QAuGjB2V,GApHJ,WACE,MAAO,CACLpG,SAAU,IAAI3J,IACdoI,wBAAyB,IAAIpI,MAiH7B+P,GArDJ,SAAkCC,EAAe/J,EAAO8B,GACtD,IAAI+E,EAAsBC,EAAuBkD,EAAwBC,EAErE9J,EAAaH,EAAMI,WAEjB0B,IAAY3B,EAAW4G,YAAYjF,SAAWA,KAA8D,QAAhD+E,EAAuB1G,EAAW6G,gBAA+C,IAAzBH,OAAkC,EAASA,EAAqB/E,UAAYA,KAAmE,QAArDgF,EAAwB3G,EAAW8G,oBAAoD,IAA1BH,OAAmC,EAASA,EAAsBhF,UACjVtH,EAA4B,kDAK9B,IAAIoH,EAAQ5B,EAAM6B,SAASC,GAS3B,GARAyH,GAA4BQ,EAAenI,GAGvCE,KAAoE,QAAtDkI,EAAyB7J,EAAW8G,oBAAqD,IAA3B+C,OAAoC,EAASA,EAAuBlI,UAElJyH,GAA4BQ,EADT/J,EAAM6B,SAAS1B,EAAW4G,YAAYjF,SACAF,GAGvDE,KAAoE,QAAtDmI,EAAyB9J,EAAW8G,oBAAqD,IAA3BgD,OAAoC,EAASA,EAAuBnI,UAAYA,IAAY3B,EAAW4G,YAAYjF,QAAS,CAC1M,IAAIoI,EAEAC,EAAgE,QAAjDD,EAAwB/J,EAAW6G,gBAAgD,IAA1BkD,OAAmC,EAASA,EAAsBpI,QAE9I,QAAoBnH,IAAhBwP,EAEFZ,GAA4BQ,EADZ/J,EAAM6B,SAASsI,GACuBvI,KAwC5D,IANkCwI,GAM9BC,IAA8B,SAAUD,GAC1C,IAAIE,EAA4B,mBAAXpX,QAAoD,iBAApBA,OAAOC,SAAwB,SAAUiJ,GAC5F,cAAcA,GACZ,SAAUA,GACZ,OAAOA,GAAyB,mBAAXlJ,QAAyBkJ,EAAI7J,cAAgBW,QAAUkJ,IAAQlJ,OAAOpB,UAAY,gBAAkBsK,GASvHmO,EAAO,GAMPC,EAAcC,KAAKC,IAAI,EADhB,GAEPC,EAAOH,EAAc,EACrBI,EAAiBJ,EAAc,EAC/BK,EAAiBL,EAAc,EAI/BM,EAAU,GAEVC,EAAW,SAAkBrU,GAC/B,OAAO,WACL,OAAOA,IAWPsU,EAAOT,EAAKS,KAAO,SAAUC,GAC/B,IAAIhI,OAAsB,IAARgI,EAAsB,YAAcX,EAAQW,GAC9D,GAAa,WAAThI,EAAmB,OAAOgI,EACjB,WAAThI,IAAmBgI,GAAO,IAG9B,IAFA,IAAID,EAAO,EAEF/W,EAAI,EAAGgB,EAAMgW,EAAIjX,OAAQC,EAAIgB,IAAOhB,EAE3C+W,GAAQA,GAAQ,GAAKA,EADbC,EAAIC,WAAWjX,GACS,EAGlC,OAAO+W,GAqBLG,EAAe,SAAsBC,EAAOC,GAC9C,OAAOA,IAAMD,EAAQT,GAGnBW,EAAW,SAAkB5U,GAC/B,OAAO,GAAKA,GAGV6U,EAAa,SAAoBC,EAAQC,GAC3C,OAlB+B/U,EAkBf8U,EAASC,EAAM,EAf/B/U,GADAA,GAAS,WADTA,GAAKA,GAAK,EAAI,cACUA,GAAK,EAAI,aACxBA,GAAK,GAAK,UAGR,KAFXA,GAAKA,GAAK,IACLA,GAAK,IALG,IAAkBA,GAiC7BgV,EAAc,SAAqBC,EAAQC,EAAI/Q,EAAG7F,GACpD,IAAI6W,EAAM7W,EAEV,IAAK2W,EAAQ,CACX,IAAI1W,EAAMD,EAAIhB,OACd6X,EAAM,IAAIzY,MAAM6B,GAEhB,IAAK,IAAIhB,EAAI,EAAGA,EAAIgB,IAAOhB,EACzB4X,EAAI5X,GAAKe,EAAIf,GAKjB,OADA4X,EAAID,GAAM/Q,EACHgR,GAWLC,EAAiB,SAAwBH,EAAQC,EAAI5W,GACvD,IAAI+W,EAAS/W,EAAIhB,OAAS,EACtBC,EAAI,EACJ+X,EAAI,EACJH,EAAM7W,EAEV,GAAI2W,EACF1X,EAAI+X,EAAIJ,OAIR,IAFAC,EAAM,IAAIzY,MAAM2Y,GAET9X,EAAI2X,GACTC,EAAIG,KAAOhX,EAAIf,KAMnB,MAFEA,EAEKA,GAAK8X,GACVF,EAAIG,KAAOhX,EAAIf,KAOjB,OAJI0X,IACFE,EAAI7X,OAAS+X,GAGRF,GAsDLI,EAAQ,CACVC,gBAAgB,GAGdC,EAAc,SAAqBzV,GACrC,OAAOA,IAAMuV,GAASvV,GAAKA,EAAEwV,gBAY3BE,EAAO,SAAcC,EAAMrB,EAAM9U,EAAK7B,GACxC,MAAO,CACL4O,KA3BO,EA4BPoJ,KAAMA,EACNrB,KAAMA,EACN9U,IAAKA,EACL7B,MAAOA,EACPiY,QAASC,IAYTC,EAAY,SAAmBH,EAAMrB,EAAMyB,GAC7C,MAAO,CACLxJ,KA7CY,EA8CZoJ,KAAMA,EACNrB,KAAMA,EACNyB,SAAUA,EACVH,QAASI,IAcTC,EAAc,SAAqBN,EAAMO,EAAMH,GACjD,MAAO,CACLxJ,KAhEQ,EAiERoJ,KAAMA,EACNO,KAAMA,EACNH,SAAUA,EACVH,QAASO,IAYTC,EAAY,SAAmBT,EAAMlL,EAAMsL,GAC7C,MAAO,CACLxJ,KAjFQ,EAkFRoJ,KAAMA,EACNlL,KAAMA,EACNsL,SAAUA,EACVH,QAASS,IA6ETC,EAAc,SAASA,EAAYX,EAAMjB,EAAO6B,EAAIC,EAAIC,EAAIC,GAC9D,GAAIH,IAAOE,EAAI,OAAOX,EAAUH,EAAMY,EAAI,CAACG,EAAIF,IAC/C,IAAIG,EAAQlC,EAAaC,EAAO6B,GAC5BK,EAAQnC,EAAaC,EAAO+B,GAChC,OAAOR,EAAYN,EAAMf,EAAS+B,GAAS/B,EAASgC,GAAQD,IAAUC,EAAQ,CAACN,EAAYX,EAAMjB,EAxVxF,EAwVsG6B,EAAIC,EAAIC,EAAIC,IAAOC,EAAQC,EAAQ,CAACJ,EAAIE,GAAM,CAACA,EAAIF,KA4ChKK,EAAc,SAAqBlB,EAAMhO,GAC3C,OAAOgO,IAAShO,EAAKgO,MAMnBE,EAAe,SAAsBF,EAAMmB,EAAOpC,EAAO7W,EAAG8W,EAAGxD,EAAG1G,GACpE,GAAIqM,EAAM3F,EAAGvV,KAAK4D,KAAM,CACtB,IAAIuX,EAAKlZ,EAAEjC,KAAK+B,OAEhB,OAAIoZ,IAAOnb,KAAK+B,MAAc/B,KAAcmb,IAAO3C,KAC/C3J,EAAK9M,MACA4X,GAGLsB,EAAYlB,EAAM/Z,OACpBA,KAAK+B,MAAQoZ,EACNnb,MAGF8Z,EAAKC,EAAMhB,EAAGxD,EAAG4F,GAG1B,IAAI5S,EAAItG,IACR,OAAIsG,IAAMiQ,EAAgBxY,QACxB6O,EAAK9M,MACA2Y,EAAYX,EAAMjB,EAAO9Y,KAAK0Y,KAAM1Y,KAAM+Y,EAAGe,EAAKC,EAAMhB,EAAGxD,EAAGhN,MAGnE6R,EAAoB,SAA2BL,EAAMmB,EAAOpC,EAAO7W,EAAG8W,EAAGxD,EAAG1G,GAC9E,GAAIkK,IAAM/Y,KAAK0Y,KAAM,CACnB,IACI0C,EA7DkB,SAA6B/B,EAAQU,EAAMmB,EAAOnC,EAAGqC,EAAMnZ,EAAGsT,EAAG1G,GAGzF,IAFA,IAAIlM,EAAMyY,EAAK1Z,OAENC,EAAI,EAAGA,EAAIgB,IAAOhB,EAAG,CAC5B,IAAI0Z,EAAQD,EAAKzZ,GAEjB,GAAIuZ,EAAM3F,EAAG8F,EAAMzX,KAAM,CACvB,IAAI7B,EAAQsZ,EAAMtZ,MAEduZ,EAAYrZ,EAAEF,GAElB,OAAIuZ,IAAcvZ,EAAcqZ,EAE5BE,IAAc9C,KACd3J,EAAK9M,MACAyX,EAAeH,EAAQ1X,EAAGyZ,IAG5BhC,EAAYC,EAAQ1X,EAAGmY,EAAKC,EAAMhB,EAAGxD,EAAG+F,GAAYF,IAI/D,IAAIpL,EAAW/N,IACf,OAAI+N,IAAawI,EAAgB4C,KAC/BvM,EAAK9M,MACAqX,EAAYC,EAAQ1W,EAAKmX,EAAKC,EAAMhB,EAAGxD,EAAGvF,GAAWoL,IAoC/CG,CADGN,EAAYlB,EAAM/Z,MACQ+Z,EAAMmB,EAAOlb,KAAK0Y,KAAM1Y,KAAKma,SAAUlY,EAAGsT,EAAG1G,GACrF,OAAIuM,IAASpb,KAAKma,SAAiBna,KAC5Bob,EAAK1Z,OAAS,EAAIwY,EAAUH,EAAM/Z,KAAK0Y,KAAM0C,GAAQA,EAAK,GAGnE,IAAI7S,EAAItG,IACR,OAAIsG,IAAMiQ,EAAgBxY,QACxB6O,EAAK9M,MACA2Y,EAAYX,EAAMjB,EAAO9Y,KAAK0Y,KAAM1Y,KAAM+Y,EAAGe,EAAKC,EAAMhB,EAAGxD,EAAGhN,MAGnEgS,EAAsB,SAA6BR,EAAMmB,EAAOpC,EAAO7W,EAAG8W,EAAGxD,EAAG1G,GAClF,IAAIyL,EAAOta,KAAKsa,KACZH,EAAWna,KAAKma,SAChBqB,EAAO3C,EAAaC,EAAOC,GAC3BI,EAAMH,EAASwC,GACfC,EAAOxC,EAAWqB,EAAMnB,GACxBuC,EAASpB,EAAOnB,EAChBzG,EAAUgJ,EAASvB,EAASsB,GAAQ9B,EAEpC0B,EAAQ3I,EAAQsH,QAAQD,EAAMmB,EAAOpC,EAzbhC,EAyb8C7W,EAAG8W,EAAGxD,EAAG1G,GAEhE,GAAI6D,IAAY2I,EAAO,OAAOrb,KAC9B,IA7K2B+L,EA6KvB4P,EAAUV,EAAYlB,EAAM/Z,MAC5BkZ,EAASoB,EACTsB,OAAc,EAElB,GAAIF,GAAU7B,EAAYwB,GAAQ,CAGhC,KADAnC,IAAWC,GACE,OAAOQ,EACpB,GAAIQ,EAASzY,QAAU,KArLEqK,EAqLUoO,EAAgB,EAAPsB,MApL9B9B,GAjGP,IAiGgB5N,EAAK4E,MAhGhB,IAgGiC5E,EAAK4E,MAoLM,OAAOwJ,EAAgB,EAAPsB,GAExEG,EAAcpC,EAAemC,EAASF,EAAMtB,QACvC,GAAKuB,GAAW7B,EAAYwB,GAOjCO,EAAcxC,EAAYuC,EAASF,EAAMJ,EAAOlB,OAPP,CAEzC,GAAIA,EAASzY,QAAU4W,EAAgB,OAzK9B,SAAgByB,EAAMyB,EAAMH,EAAOnC,EAAQ2C,GAKtD,IAJA,IAAInZ,EAAM,GACNyW,EAAMD,EACN4C,EAAQ,EAEHna,EAAI,EAAGwX,IAAOxX,EACX,EAANwX,IAASzW,EAAIf,GAAKka,EAASC,MAC/B3C,KAAS,EAIX,OADAzW,EAAI8Y,GAAQH,EACLb,EAAUT,EAAM+B,EAAQ,EAAGpZ,GA8JcqZ,CAAOhC,EAAMyB,EAAMH,EAAOf,EAAMH,GAC9EjB,GAAUC,EACVyC,EA9TgB,SAAuBvC,EAAQC,EAAI/Q,EAAG7F,GACxD,IAAIC,EAAMD,EAAIhB,OAEd,GAAI2X,EAAQ,CAGV,IAFA,IAAI2C,EAAKrZ,EAEFqZ,GAAM1C,GACX5W,EAAIsZ,KAAQtZ,EAAIsZ,GAIlB,OADAtZ,EAAI4W,GAAM/Q,EACH7F,EAOT,IAJA,IAAIf,EAAI,EACJ+X,EAAI,EACJH,EAAM,IAAIzY,MAAM6B,EAAM,GAEnBhB,EAAI2X,GACTC,EAAIG,KAAOhX,EAAIf,KAKjB,IAFA4X,EAAID,GAAM/Q,EAEH5G,EAAIgB,GACT4W,IAAMG,GAAKhX,EAAIf,KAGjB,OAAO4X,EAkSS0C,CAAcN,EAASF,EAAMJ,EAAOlB,GAMpD,OAAIwB,GACF3b,KAAKsa,KAAOpB,EACZlZ,KAAKma,SAAWyB,EACT5b,MAGFqa,EAAYN,EAAMb,EAAQ0C,IAG/BnB,EAAoB,SAA2BV,EAAMmB,EAAOpC,EAAO7W,EAAG8W,EAAGxD,EAAG1G,GAC9E,IAAIiN,EAAQ9b,KAAK6O,KACbsL,EAAWna,KAAKma,SAChBqB,EAAO3C,EAAaC,EAAOC,GAC3BsC,EAAQlB,EAASqB,GAEjBU,GAAYb,GAAS1B,GAAOK,QAAQD,EAAMmB,EAAOpC,EAhe5C,EAge0D7W,EAAG8W,EAAGxD,EAAG1G,GAE5E,GAAIwM,IAAUa,EAAU,OAAOlc,KAC/B,IAAI2b,EAAUV,EAAYlB,EAAM/Z,MAC5B4b,OAAc,EAElB,GAAI/B,EAAYwB,KAAWxB,EAAYqC,KAEnCJ,EACFF,EAAcxC,EAAYuC,EAASH,EAAMU,EAAU/B,QAC9C,IAAKN,EAAYwB,IAAUxB,EAAYqC,GAAW,CAGvD,KADEJ,GACWvD,EAAgB,OAtLtB,SAAcwB,EAAM+B,EAAOK,EAASC,GAK7C,IAJA,IAAIjC,EAAW,IAAIrZ,MAAMgb,EAAQ,GAC7BpC,EAAI,EACJR,EAAS,EAEJvX,EAAI,EAAGgB,EAAMyZ,EAAS1a,OAAQC,EAAIgB,IAAOhB,EAChD,GAAIA,IAAMwa,EAAS,CACjB,IAAIE,EAAOD,EAASza,GAEhB0a,IAASxC,EAAYwC,KACvBlC,EAAST,KAAO2C,EAChBnD,GAAU,GAAKvX,GAKrB,OAAO0Y,EAAYN,EAAMb,EAAQiB,GAsKKmC,CAAKvC,EAAM+B,EAAON,EAAMrB,GAC5DyB,EAAcxC,EAAYuC,EAASH,EAAM7B,EAAOQ,QAGhDyB,EAAcxC,EAAYuC,EAASH,EAAMU,EAAU/B,GAGrD,OAAIwB,GACF3b,KAAK6O,KAAOiN,EACZ9b,KAAKma,SAAWyB,EACT5b,MAGFwa,EAAUT,EAAM+B,EAAOF,IAahC,SAASnU,EAAI8U,EAAUxC,EAAM/L,EAAQwO,EAAM3N,GACzC7O,KAAKyc,UAAYF,EACjBvc,KAAK0c,MAAQ3C,EACb/Z,KAAK2c,QAAU3O,EACfhO,KAAK4c,MAAQJ,EACbxc,KAAK6c,MAAQhO,EAff8K,EAAMK,QAAU,SAAUD,EAAMmB,EAAOpC,EAAO7W,EAAG8W,EAAGxD,EAAG1G,GACrD,IAAItG,EAAItG,IACR,OAAIsG,IAAMiQ,EAAgBmB,KACxB9K,EAAK9M,MACA+X,EAAKC,EAAMhB,EAAGxD,EAAGhN,KAc1Bd,EAAIjI,UAAUsd,QAAU,SAAUC,EAASC,GACzC,OAAIhd,KAAKyc,WACPzc,KAAK4c,MAAQG,EACb/c,KAAK6c,MAAQG,EACNhd,MAGF+c,IAAY/c,KAAK4c,MAAQ5c,KAAO,IAAIyH,EAAIzH,KAAKyc,UAAWzc,KAAK0c,MAAO1c,KAAK2c,QAASI,EAASC,IAYpG,IAAIC,EAAahF,EAAKgF,WAAa,SAAUC,EAAKxE,EAAM9U,EAAKyB,GAK3D,IAJA,IAAI0G,EAAO1G,EAAIuX,MACX9D,EAAQ,EACRoC,EAAQ7V,EAAIsX,QAAQzB,QAGtB,OAAQnP,EAAK4E,MACX,KA1XK,EA4XD,OAAOuK,EAAMtX,EAAKmI,EAAKnI,KAAOmI,EAAKhK,MAAQmb,EAG/C,KA9XU,EAgYN,GAAIxE,IAAS3M,EAAK2M,KAGhB,IAFA,IAAIyB,EAAWpO,EAAKoO,SAEXxY,EAAI,EAAGgB,EAAMwX,EAASzY,OAAQC,EAAIgB,IAAOhB,EAAG,CACnD,IAAI0Z,EAAQlB,EAASxY,GACrB,GAAIuZ,EAAMtX,EAAKyX,EAAMzX,KAAM,OAAOyX,EAAMtZ,MAI5C,OAAOmb,EAGX,KA3YM,EA6YF,IAAI1B,EAAO3C,EAAaC,EAAOJ,GAC3BS,EAAMH,EAASwC,GAEnB,GAAIzP,EAAKuO,KAAOnB,EAAK,CACnBpN,EAAOA,EAAKoO,SAASlB,EAAWlN,EAAKuO,KAAMnB,IAC3CL,GAnkBD,EAokBC,MAGF,OAAOoE,EAGX,KAxZM,EA4ZF,GAFAnR,EAAOA,EAAKoO,SAAStB,EAAaC,EAAOJ,IAE/B,CACRI,GA/kBD,EAglBC,MAGF,OAAOoE,EAGX,QACE,OAAOA,IAKfzV,EAAIjI,UAAUyd,WAAa,SAAUC,EAAKxE,EAAM9U,GAC9C,OAAOqZ,EAAWC,EAAKxE,EAAM9U,EAAK5D,OASpC,IAAImd,EAASlF,EAAKkF,OAAS,SAAUD,EAAKtZ,EAAKyB,GAC7C,OAAO4X,EAAWC,EAAK7X,EAAIsX,QAAQjE,KAAK9U,GAAMA,EAAKyB,IAGrDoC,EAAIjI,UAAU2d,OAAS,SAAUD,EAAKtZ,GACpC,OAAOuZ,EAAOD,EAAKtZ,EAAK5D,OAS1B,IAAIod,EAAUnF,EAAKmF,QAAU,SAAU1E,EAAM9U,EAAKyB,GAChD,OAAO4X,OAAW5U,EAAWqQ,EAAM9U,EAAKyB,IAG1CoC,EAAIjI,UAAU4d,QAAU,SAAU1E,EAAM9U,GACtC,OAAOwZ,EAAQ1E,EAAM9U,EAAK5D,OASlBiY,EAAKnQ,IAAM,SAAUlE,EAAKyB,GAClC,OAAO4X,OAAW5U,EAAWhD,EAAIsX,QAAQjE,KAAK9U,GAAMA,EAAKyB,IAG3DoC,EAAIjI,UAAUsI,IAAM,SAAUlE,EAAKsZ,GACjC,OAAOC,EAAOD,EAAKtZ,EAAK5D,OAO1B,IAAIqd,EAAUpF,EAAKjM,IAAM,SAAU0M,EAAM9U,EAAKyB,GAC5C,OAAO4X,EAAWzE,EAASE,EAAM9U,EAAKyB,KAASmT,GAGjD/Q,EAAIjI,UAAU6d,QAAU,SAAU3E,EAAM9U,GACtC,OAAOyZ,EAAQ3E,EAAM9U,EAAK5D,OAO5B,IAAIgM,EAAMiM,EAAKjM,IAAM,SAAUpI,EAAKyB,GAClC,OAAOgY,EAAQhY,EAAIsX,QAAQjE,KAAK9U,GAAMA,EAAKyB,IAG7CoC,EAAIjI,UAAUwM,IAAM,SAAUpI,GAC5B,OAAOoI,EAAIpI,EAAK5D,OAGlB,IAAIsd,EAAgB,SAAuBlZ,EAAGmZ,GAC5C,OAAOnZ,IAAMmZ,GASftF,EAAKuF,KAAO,SAAUxP,GACpB,OAAO,IAAIvG,EAAI,EAAG,EAAG,CACnByT,MAAOlN,GAAUA,EAAOkN,OAASoC,EACjC5E,KAAM1K,GAAUA,EAAO0K,MAAQA,GAC9BiB,EAAO,IAOZ1B,EAAK0B,MAAQ1B,EAAKuF,OAKlB,IAAIC,EAAUxF,EAAKwF,QAAU,SAAUpY,GACrC,OAAOA,KAASwU,EAAYxU,EAAIuX,QAGlCnV,EAAIjI,UAAUie,QAAU,WACtB,OAAOA,EAAQzd,OAiBjB,IAAI0d,EAAazF,EAAKyF,WAAa,SAAUzb,EAAGyW,EAAM9U,EAAKyB,GACzD,IAAIwJ,EAAO,CACT9M,MAAOsD,EAAIwX,OAGTE,EAAU1X,EAAIuX,MAAM5C,QAAQ3U,EAAIoX,UAAYpX,EAAIqX,MAAQiB,IAAKtY,EAAIsX,QAAQzB,MAAO,EAAGjZ,EAAGyW,EAAM9U,EAAKiL,GAErG,OAAOxJ,EAAIyX,QAAQC,EAASlO,EAAK9M,QAGnC0F,EAAIjI,UAAUke,WAAa,SAAUhF,EAAM9U,EAAK3B,GAC9C,OAAOyb,EAAWzb,EAAGyW,EAAM9U,EAAK5D,OAUlC,IAAI4d,EAAS3F,EAAK2F,OAAS,SAAU3b,EAAG2B,EAAKyB,GAC3C,OAAOqY,EAAWzb,EAAGoD,EAAIsX,QAAQjE,KAAK9U,GAAMA,EAAKyB,IAGnDoC,EAAIjI,UAAUoe,OAAS,SAAUha,EAAK3B,GACpC,OAAO2b,EAAO3b,EAAG2B,EAAK5D,OASxB,IAAI6d,EAAU5F,EAAK4F,QAAU,SAAUnF,EAAM9U,EAAK7B,EAAOsD,GACvD,OAAOqY,EAAWjF,EAAS1W,GAAQ2W,EAAM9U,EAAKyB,IAGhDoC,EAAIjI,UAAUqe,QAAU,SAAUnF,EAAM9U,EAAK7B,GAC3C,OAAO8b,EAAQnF,EAAM9U,EAAK7B,EAAO/B,OASnC,IAAI0H,EAAMuQ,EAAKvQ,IAAM,SAAU9D,EAAK7B,EAAOsD,GACzC,OAAOwY,EAAQxY,EAAIsX,QAAQjE,KAAK9U,GAAMA,EAAK7B,EAAOsD,IAGpDoC,EAAIjI,UAAUkI,IAAM,SAAU9D,EAAK7B,GACjC,OAAO2F,EAAI9D,EAAK7B,EAAO/B,OASzB,IAAI8d,EAAMrF,EAASD,GAEfuF,EAAa9F,EAAK8F,WAAa,SAAUrF,EAAM9U,EAAKyB,GACtD,OAAOqY,EAAWI,EAAKpF,EAAM9U,EAAKyB,IAGpCoC,EAAIjI,UAAUue,WAAatW,EAAIjI,UAAUwe,WAAa,SAAUtF,EAAM9U,GACpE,OAAOma,EAAWrF,EAAM9U,EAAK5D,OAS/B,IAAIie,EAAShG,EAAKgG,OAAS,SAAUra,EAAKyB,GACxC,OAAO0Y,EAAW1Y,EAAIsX,QAAQjE,KAAK9U,GAAMA,EAAKyB,IAGhDoC,EAAIjI,UAAUye,OAASxW,EAAIjI,UAAUkN,OAAS,SAAU9I,GACtD,OAAOqa,EAAOra,EAAK5D,OAUrB,IAAIke,EAAgBjG,EAAKiG,cAAgB,SAAU7Y,GACjD,OAAO,IAAIoC,EAAIpC,EAAIoX,UAAY,EAAGpX,EAAIqX,MAAQ,EAAGrX,EAAIsX,QAAStX,EAAIuX,MAAOvX,EAAIwX,QAG/EpV,EAAIjI,UAAU0e,cAAgB,WAC5B,OAAOA,EAAcle,OAOvB,IAAIme,EAAclG,EAAKkG,YAAc,SAAU9Y,GAE7C,OADAA,EAAIoX,UAAYpX,EAAIoX,WAAapX,EAAIoX,UAAY,EAC1CpX,GAGToC,EAAIjI,UAAU2e,YAAc,WAC1B,OAAOA,EAAYne,OASrB,IAAIqZ,EAASpB,EAAKoB,OAAS,SAAUpX,EAAGoD,GACtC,IAAI+Y,EAAYF,EAAc7Y,GAE9B,OADApD,EAAEmc,GACKD,EAAYC,IAGrB3W,EAAIjI,UAAU6Z,OAAS,SAAUpX,GAC/B,OAAOoX,EAAOpX,EAAGjC,OAUnB,IAAIqe,EAAO,SAAc9I,GACvB,OAAOA,GAAK+I,EAAkB/I,EAAE,GAAIA,EAAE,GAAIA,EAAE,GAAIA,EAAE,GAAIA,EAAE,KAOtD+I,EAAoB,SAA2B3b,EAAKwX,EAAUxY,EAAGM,EAAGsT,GACtE,KAAO5T,EAAIgB,GAAK,CACd,IAAI0Y,EAAQlB,EAASxY,KACrB,GAAI0Z,IAAUxB,EAAYwB,GAAQ,OAAOkD,EAAUlD,EAAOpZ,EAAG,CAACU,EAAKwX,EAAUxY,EAAGM,EAAGsT,IAGrF,OAAO8I,EAAK9I,IAOVgJ,EAAY,SAAmBxS,EAAM9J,EAAGsT,GAC1C,OAAQxJ,EAAK4E,MACX,KApsBO,EAqsBL,MAAO,CACL5O,MAAOE,EAAE8J,GACTyS,KAAMjJ,GAGV,KAzsBY,EA0sBZ,KAxsBQ,EAysBR,KA1sBQ,EA2sBN,IAAI4E,EAAWpO,EAAKoO,SACpB,OAAOmE,EAAkBnE,EAASzY,OAAQyY,EAAU,EAAGlY,EAAGsT,GAE5D,QACE,OAAO8I,EAAK9I,KAIdkJ,EAAO,CACT3c,MAAM,GAMR,SAAS4c,EAAYnW,GACnBvI,KAAKuI,EAAIA,EAGXmW,EAAYlf,UAAU+C,KAAO,WAC3B,IAAKvC,KAAKuI,EAAG,OAAOkW,EACpB,IAAIE,EAAK3e,KAAKuI,EAEd,OADAvI,KAAKuI,EAAI8V,EAAKM,EAAGH,MACVG,GAGTD,EAAYlf,UAAUoB,OAAOC,UAAY,WACvC,OAAOb,MAOT,IAAI4e,EAAQ,SAAevZ,EAAKpD,GAC9B,OAAO,IAAIyc,EAAYH,EAAUlZ,EAAIuX,MAAO3a,KAS1C4c,EAAa,SAAoBza,GACnC,MAAO,CAACA,EAAER,IAAKQ,EAAErC,QAGf8Q,EAAUoF,EAAKpF,QAAU,SAAUxN,GACrC,OAAOuZ,EAAMvZ,EAAKwZ,IAGpBpX,EAAIjI,UAAUqT,QAAUpL,EAAIjI,UAAUoB,OAAOC,UAAY,WACvD,OAAOgS,EAAQ7S,OASjB,IAAI8e,EAAY,SAAmB1a,GACjC,OAAOA,EAAER,KAGPZ,GAAOiV,EAAKjV,KAAO,SAAUqC,GAC/B,OAAOuZ,EAAMvZ,EAAKyZ,IAGpBrX,EAAIjI,UAAUwD,KAAO,WACnB,OAAOA,GAAKhD,OASd,IAAI+e,GAAc,SAAqB3a,GACrC,OAAOA,EAAErC,OAGPyP,GAASyG,EAAKzG,OAAS/J,EAAIjI,UAAUgS,OAAS,SAAUnM,GAC1D,OAAOuZ,EAAMvZ,EAAK0Z,KAGpBtX,EAAIjI,UAAUgS,OAAS,WACrB,OAAOA,GAAOxR,OAgBhB,IAAIgf,GAAO/G,EAAK+G,KAAO,SAAU/c,EAAGgd,EAAGC,GACrC,IAAI1C,EAAO0C,EAAEtC,MACb,GAxzBS,IAwzBLJ,EAAK7L,KAAe,OAAO1O,EAAEgd,EAAGzC,EAAKza,MAAOya,EAAK5Y,KAIrD,IAHA,IAAIub,EAAU,CAAC3C,EAAKrC,UAChBA,OAAW,EAERA,EAAWgF,EAAQ1P,OACxB,IAAK,IAAI9N,EAAI,EAAGgB,EAAMwX,EAASzY,OAAQC,EAAIgB,GAAM,CAC/C,IAAI0Y,EAAQlB,EAASxY,KAEjB0Z,GAASA,EAAM1K,OAh0Bd,IAi0BC0K,EAAM1K,KAAesO,EAAIhd,EAAEgd,EAAG5D,EAAMtZ,MAAOsZ,EAAMzX,KAAUub,EAAQ5b,KAAK8X,EAAMlB,WAKxF,OAAO8E,GAGTxX,EAAIjI,UAAUwf,KAAO,SAAU/c,EAAGgd,GAChC,OAAOD,GAAK/c,EAAGgd,EAAGjf,OAYpB,IAAI2D,GAAUsU,EAAKtU,QAAU,SAAU1B,EAAGoD,GACxC,OAAO2Z,IAAK,SAAUI,EAAGrd,EAAO6B,GAC9B,OAAO3B,EAAEF,EAAO6B,EAAKyB,KACpB,KAAMA,IAGXoC,EAAIjI,UAAUmE,QAAU,SAAU1B,GAChC,OAAO0B,GAAQ1B,EAAGjC,OAUpB,IAAI8b,GAAQ7D,EAAK6D,MAAQ,SAAUzW,GACjC,OAAOA,EAAIwX,OAGbpV,EAAIjI,UAAUsc,MAAQ,WACpB,OAAOA,GAAM9b,OAGfmB,OAAO4C,eAAe0D,EAAIjI,UAAW,OAAQ,CAC3CsI,IAAKL,EAAIjI,UAAUsc,QAKjBhE,EAAOuH,QACTvH,EAAOuH,QAAUpH,QAEjB5P,GAAU4P,KAAOA,EA5jChBrL,CAFIkL,GAAS,CACduH,QAAS,IACGvH,GAAOuH,SAAUvH,GAAOuH,SAgkCpCC,GAA0B,WAC5B,SAASA,EAAW/H,IAClB,OAAgBvX,KAAMsf,GAEtBzV,EAAgB7J,KAAM,YAAQ,GAE9BA,KAAKsF,KAAO,IAAImC,IAAI8P,MAAAA,OAA2C,EAASA,EAAS1E,WAiDnF,OA9CA,OAAayM,EAAY,CAAC,CACxB1b,IAAK,OACL7B,MAAO,WACL,OAAO/B,KAAKsF,KAAKtC,SAElB,CACDY,IAAK,UACL7B,MAAO,WACL,OAAO/B,KAAKsF,KAAKuN,YAElB,CACDjP,IAAK,MACL7B,MAAO,SAAawT,GAClB,OAAOvV,KAAKsF,KAAKwC,IAAIyN,KAEtB,CACD3R,IAAK,MACL7B,MAAO,SAAawT,GAClB,OAAOvV,KAAKsF,KAAK0G,IAAIuJ,KAEtB,CACD3R,IAAK,MACL7B,MAAO,SAAawT,EAAGhN,GAGrB,OAFAvI,KAAKsF,KAAKoC,IAAI6N,EAAGhN,GAEVvI,OAER,CACD4D,IAAK,SACL7B,MAAO,SAAiBwT,GAGtB,OAFAvV,KAAKsF,KAAKoH,OAAO6I,GAEVvV,OAER,CACD4D,IAAK,QACL7B,MAAO,WACL,OAAOwd,GAAcvf,QAEtB,CACD4D,IAAK,QACL7B,MAAO,WACL,OAAO,IAAI0F,IAAIzH,KAAKsF,UAIjBga,EAvDqB,GA0D1BE,GAAsC,WAIxC,SAASA,EAAuBjI,GAK9B,IAJA,OAAgBvX,KAAMwf,GAEtB3V,EAAgB7J,KAAM,QAAS+X,GAAO4B,MAAMuE,iBAExC3G,aAAoBiI,EAAwB,CAC9C,IAAIzG,EAAIxB,EAASkI,MAAMtB,cAEvB5G,EAASkI,MAAQ1G,EAAEmF,gBACnBle,KAAKyf,MAAQ1G,EAAEmF,qBACV,GAAI3G,EAAU,CACnB,IACImI,EADAC,EAAcnf,EAA2B+W,EAAS1E,WAGtD,IACE,IAAK8M,EAAY9d,MAAO6d,EAAUC,EAAYze,KAAKY,MAAO,CACxD,IAAI8d,GAAgB,OAAeF,EAAQ3d,MAAO,GAC9CwT,EAAIqK,EAAc,GAClBrX,EAAIqX,EAAc,GAEtB5f,KAAKyf,MAAM/X,IAAI6N,EAAGhN,IAEpB,MAAOpG,GACPwd,EAAYhgB,EAAEwC,GACd,QACAwd,EAAY1d,MAmDlB,OA9CA,OAAaud,EAAwB,CAAC,CACpC5b,IAAK,OACL7B,MAAO,WACL,OAAO/B,KAAKyf,MAAMzc,SAEnB,CACDY,IAAK,UACL7B,MAAO,WACL,OAAO/B,KAAKyf,MAAM5M,YAEnB,CACDjP,IAAK,MACL7B,MAAO,SAAawT,GAClB,OAAOvV,KAAKyf,MAAM3X,IAAIyN,KAEvB,CACD3R,IAAK,MACL7B,MAAO,SAAawT,GAClB,OAAOvV,KAAKyf,MAAMzT,IAAIuJ,KAEvB,CACD3R,IAAK,MACL7B,MAAO,SAAawT,EAAGhN,GAGrB,OAFAvI,KAAKyf,MAAM/X,IAAI6N,EAAGhN,GAEXvI,OAER,CACD4D,IAAK,SACL7B,MAAO,SAAiBwT,GAGtB,OAFAvV,KAAKyf,MAAM/S,OAAO6I,GAEXvV,OAER,CACD4D,IAAK,QACL7B,MAAO,WACL,OAAOwd,GAAcvf,QAEtB,CACD4D,IAAK,QACL7B,MAAO,WACL,OAAO,IAAI0F,IAAIzH,KAAKyf,WAIjBD,EAhFiC,GAmF1C,SAASD,GAAchI,GACrB,OAAItP,EAAa,oBACR,IAAIuX,GAAuBjI,GAE3B,IAAI+H,GAAW/H,GAI1B,IAGIsI,GAFaN,GAObO,GAAUtI,GACVuI,GALsC5e,OAAO0E,OAAO,CACtDmF,UAAW,KACXuU,cAAeM,KAG4BN,cAEzCS,GAAuB,EAEvBC,GAA0B,WAC5B,OAAOD,MAGT,SAASE,KACP,IAAI1Q,EAAUyQ,KACd,MAAO,CACLzQ,QAASA,EACT2Q,QAAS3Q,EACT4Q,oBAAqB,GACrB7P,WAAY,IAAI/H,IAChB4H,WAAY2P,KACZzP,kBAAmByP,MA6BvB,IAAIM,GAzBJ,WACE,IAAI5L,EAAcyL,KAClB,MAAO,CACLzL,YAAaA,EACbC,SAAU,KACVC,aAAc,KACd2L,YAAa,EACb1P,WAAY,IAAIpI,IAChBqI,eAAgB,IAAIrI,IACpB+X,yBAA0B,IAAI9Y,IAC9B+Y,6BAA8B,IAAI/Y,IAClC8J,6BAA8B,IAAI9J,IAClCgZ,oCAAqC,GACrCC,4BAA6B,IAAIlY,IACjCmY,iBAAiB,IAAIlZ,KAAMC,IAAI+M,EAAYjF,QAASsQ,MACpDc,wBAAyB,IAAInZ,IAC7B4G,UAAW,CACTwS,gBAAiB,IAAIpZ,IACrB2G,oBAAqB,IAAI3G,IACzBqZ,6BAA8B,IAAItY,KAEpCuF,qBAAsB,IAAItG,MAI1B4Y,GAGuBJ,GAyC3B,IAAIc,GA5BJ,WAGE,IAFA,IAAIlhB,EAAS,IAAI2I,IAERwY,EAAQ9gB,UAAUwB,OAAQuf,EAAO,IAAIngB,MAAMkgB,GAAQE,EAAQ,EAAGA,EAAQF,EAAOE,IACpFD,EAAKC,GAAShhB,UAAUghB,GAG1B,IAAK,IAAIC,EAAM,EAAGC,EAAQH,EAAME,EAAMC,EAAM1f,OAAQyf,IAAO,CACzD,IAGIE,EAHA3Z,EAAM0Z,EAAMD,GAEZG,EAAc9gB,EAA2BkH,GAG7C,IACE,IAAK4Z,EAAYzf,MAAOwf,EAAUC,EAAYpgB,KAAKY,MAAO,CACxD,IAAIC,EAAQsf,EAAQtf,MACpBlC,EAAO4I,IAAI1G,IAEb,MAAOI,GACPmf,EAAY3hB,EAAEwC,GACd,QACAmf,EAAYrf,KAIhB,OAAOpC,GAqCT,IAAI0hB,GAjBJ,SAAiB7Z,EAAK4B,EAAUkY,GAI9B,IAHA,IAAI3gB,EAAW6G,EAAImL,UACfH,EAAU7R,EAAS0B,QAEfmQ,EAAQ5Q,MAAM,CACpB,IAAI2f,EAAQ/O,EAAQ3Q,MAEpB,GAAIuH,EAAS5J,KAAK8hB,EAASC,EAAM,GAAIA,EAAM,GAAI/Z,GAC7C,OAAO,EAGTgL,EAAU7R,EAAS0B,OAGrB,OAAO,GAILmf,GAAgB3R,GAChB4R,GAA+B9V,GAAYS,2BAC3CsV,GAAY/V,GAAYO,QACxByV,GAAkB9U,GAClB+U,GAAa,IAAItZ,IAErB,SAASuZ,GAAmCrU,EAAOsU,GACjD,IAAInU,EAAaH,EAAMI,WACnBH,EAAYE,EAAW4G,YAE3B,GAAI5G,EAAW6G,SACbxM,EAA4B,gFAD9B,CAKA,IAGI+Z,EAHA3W,EAAQ,IAAI9C,IAEZ0Z,EAAc1hB,EAA2BwhB,GAG7C,IACE,IAAKE,EAAYrgB,MAAOogB,EAAUC,EAAYhhB,KAAKY,MAAO,CACxD,IAAIqgB,EAAIF,EAAQlgB,MAEhB,GAAIogB,aAAaN,GAAiB,CAChC,IACIO,EADAC,EAAc7hB,EAA2B4N,GAAoBP,EAAYsU,IAG7E,IACE,IAAKE,EAAYxgB,MAAOugB,EAAUC,EAAYnhB,KAAKY,MAAO,CACxD,IAAIZ,EAAIkhB,EAAQrgB,MAChBuJ,EAAM7C,IAAIvH,IAEZ,MAAOiB,GACPkgB,EAAY1iB,EAAEwC,GACd,QACAkgB,EAAYpgB,UAGdqJ,EAAM7C,IAAI0Z,IAGd,MAAOhgB,GACP+f,EAAYviB,EAAEwC,GACd,QACA+f,EAAYjgB,IAGd,IAGIqgB,EAHAC,EAiBN,SAA6B7U,EAAO8U,GAClC,IAAI3U,EAAaH,EAAMI,WACnBH,EAAYE,EAAW4G,YACvBnF,EAAQ5B,EAAM6B,SAAS5B,EAAU6B,SACjC+S,EAAkB,IAAI/Z,IAEtBia,EAAqB,IAAIja,IAE7B,OADAka,EAAyBF,GAClBD,EAEP,SAASG,EAAyBF,GAChC,IAMIG,EANAC,EAAoC,IAAIpa,IACxCqa,EAgGR,SAA8CnV,EAAOC,EAAWrC,EAChEwX,EAAmBC,GACjB,IAAIzT,EAAQ5B,EAAM6B,SAAS5B,EAAU6B,SACjCwT,EAAS,GACTC,EAAU,IAAIza,IAElB,KAAO8C,EAAMuD,KAAO,GAClB+P,EAAMza,EAAkBmH,EAAMkG,SAASjP,OAAOR,QAGhD,OAAOihB,EAEP,SAASpE,EAAM7S,GACb,GAAI+W,EAAkB9W,IAAID,IAASgX,EAAkB/W,IAAID,GACvDT,EAAMoB,OAAOX,QAIf,IAAIkX,EAAQjX,IAAID,GAAhB,CAIA,IAAIoO,EAAW7K,EAAMO,wBAAwB/H,IAAIiE,GAEjD,GAAIoO,EAAU,CACZ,IACI+I,EADAC,EAAc3iB,EAA2B2Z,GAG7C,IACE,IAAKgJ,EAAYthB,MAAOqhB,EAAUC,EAAYjiB,KAAKY,MAAO,CAExD8c,EADYsE,EAAQnhB,QAGtB,MAAOI,GACPghB,EAAYxjB,EAAEwC,GACd,QACAghB,EAAYlhB,KAIhBghB,EAAQxa,IAAIsD,GACZT,EAAMoB,OAAOX,GACbiX,EAAOzf,KAAKwI,KA1IMqX,CAAqC1V,EAAOC,EAAW6U,EAAiBD,EAC1FE,GAGIY,EAAc7iB,EAA2BqiB,GAG7C,IACE,IAAKQ,EAAYxhB,MAAO8gB,EAAUU,EAAYniB,KAAKY,MAAO,CACxD,IAEIwhB,EAFAvX,EAAO4W,EAAQ5gB,MAKnB,GAAmC,eAA/B6f,GAAU7V,GAAMoC,WAMpB,IAAkF,QAA5EmV,EAAwBzV,EAAWQ,UAAUwS,gBAAgB/Y,IAAIiE,UAA6C,IAA1BuX,EAAmCA,EAAwB,GAAK,EACxJb,EAAmBha,IAAIsD,QAKzB,GAAIwX,GAAyBxX,GAAMhF,MAAK,SAAUkY,GAChD,OAAOpR,EAAWQ,UAAUwS,gBAAgB/Y,IAAImX,MAEhDwD,EAAmBha,IAAIsD,OAHzB,CASA,IAAIyX,EAAelU,EAAMO,wBAAwB/H,IAAIiE,GAEjDyX,GAAgBjC,GAAeiC,GAAc,SAAUnI,GACzD,OAAOoH,EAAmBzW,IAAIqP,MAE9BoH,EAAmBha,IAAIsD,IAIzBwW,EAAgB9Z,IAAIsD,GACpB6W,EAAkCna,IAAIsD,SA9BpC0W,EAAmBha,IAAIsD,IAkC3B,MAAO5J,GACPkhB,EAAY1jB,EAAEwC,GACd,QACAkhB,EAAYphB,IAGd,IAGIwhB,EAHAC,EAAU,IAAIlb,IAEdmb,EAAcnjB,EAA2BoiB,GAG7C,IACE,IAAKe,EAAY9hB,MAAO4hB,EAAUE,EAAYziB,KAAKY,MAAO,CACxD,IAGI8hB,EAHAC,EAAQJ,EAAQ1hB,MAEhB+hB,EAActjB,EAAiF,QAArDgQ,EAAsBlB,EAAM8B,SAAStJ,IAAI+b,UAA4C,IAAxBrT,EAAiCA,EAAsBsR,IAGlK,IACE,IAAKgC,EAAYjiB,MAAO+hB,EAAUE,EAAY5iB,KAAKY,MAAO,CACxD,IAEI0O,EAFAuT,EAASH,EAAQ7hB,MAIhBwgB,EAAgBvW,IAAI+X,IACvBL,EAAQjb,IAAIsb,IAGhB,MAAO5hB,GACP2hB,EAAYnkB,EAAEwC,GACd,QACA2hB,EAAY7hB,MAGhB,MAAOE,GACPwhB,EAAYhkB,EAAEwC,GACd,QACAwhB,EAAY1hB,IAGVyhB,EAAQ7U,MACV6T,EAAyBgB,IAvHPM,CAAoBtW,EAAOpC,GAE7C2Y,EAAczjB,EAA2B+hB,GAG7C,IACE,IAAK0B,EAAYpiB,MAAOygB,EAAU2B,EAAY/iB,KAAKY,MAAO,CAExDoiB,GAAYxW,EAAOC,EADR2U,EAAQvgB,QAGrB,MAAOI,GACP8hB,EAAYtkB,EAAEwC,GACd,QACA8hB,EAAYhiB,MA8JhB,SAASiiB,GAAYxW,EAAOC,EAAW5B,GACrC,GAAK9D,EAAa,iCAAlB,CAKAyZ,GAAchU,EAAO3B,GAErB,IAAI8B,EAAaH,EAAMI,WACvBD,EAAW+C,WAAWlE,OAAOX,GAC7B8B,EAAWgD,eAAenE,OAAOX,GACjC8B,EAAW2S,6BAA6B9T,OAAOX,GAC/C8B,EAAWQ,UAAUwS,gBAAgBnU,OAAOX,GAC5C,IAGIoY,EADAC,EAAc5jB,EAFN+iB,GAAyBxX,IAKrC,IACE,IAAKqY,EAAYviB,MAAOsiB,EAAUC,EAAYljB,KAAKY,MAAO,CACxD,IAEIuiB,EAFA9V,EAAO4V,EAAQpiB,MAI+D,QAAjFsiB,EAAyBxW,EAAWQ,UAAUD,oBAAoBtG,IAAIyG,UAA8C,IAA3B8V,GAA6CA,EAAuB3X,OAAOX,IAMvK,MAAO5J,GACPiiB,EAAYzkB,EAAEwC,GACd,QACAiiB,EAAYniB,IAGd0L,EAAUyC,WAAW1D,OAAOX,GAC5B4B,EAAU4C,WAAW7D,OAAOX,GAC5B4B,EAAU2C,kBAAkB5D,OAAOX,GACnC,IAAIuD,EAAQzB,EAAW8S,gBAAgB7Y,IAAI6F,EAAU6B,SAErD,GAAIF,EAAO,CACT,IAAI6B,EAAO7B,EAAM8B,SAAStJ,IAAIiE,GAE9B,QAAa1D,IAAT8I,EAAoB,CACtB7B,EAAM8B,SAAS1E,OAAOX,GAEtB,IACIuY,EADAC,EAAc/jB,EAA2B2Q,GAG7C,IACE,IAAKoT,EAAY1iB,MAAOyiB,EAAUC,EAAYrjB,KAAKY,MAAO,CACxD,IAEI4N,EAFA8U,EAAMF,EAAQviB,MAImD,QAApE2N,EAAwBJ,EAAMO,wBAAwB/H,IAAI0c,UAA4C,IAA1B9U,GAA4CA,EAAsBhD,OAAOX,IAExJ,MAAO5J,GACPoiB,EAAY5kB,EAAEwC,GACd,QACAoiB,EAAYtiB,KAMhBqN,EAAMO,wBAAwBnD,OAAOX,GAKvC4V,GAA6B5V,IAG/B,SAASqC,GAAoBP,EAAYU,GACvC,IAAIkW,EAEJ,OAAyF,QAAjFA,EAAyB5W,EAAWQ,UAAUD,oBAAoBtG,IAAIyG,UAA8C,IAA3BkW,EAAoCA,EAAyB3C,GAGhK,SAASyB,GAAyBxX,GAChC,IAAIoC,EAAayT,GAAU7V,GAAMoC,WAEjC,YAAmB9F,IAAf8F,GAA2C,eAAfA,GAA8C,eAAfA,EACtD,GACEA,aAAsB0T,GACxB,CAAC1T,GAEDA,EA+BX,SAASuW,GAAwBhX,EAAOiX,GACjC1c,EAAa,mCAIRyF,EAAMI,WAAWO,UAAUwS,gBACjCnU,OAAOiY,GAjCb,SAAsDjX,EAAOiX,GAC3D,IAAI9f,EAAQ6I,EAAMI,WAEdjJ,EAAM6P,SACR7P,EAAMwJ,UAAUyS,6BAA6BrY,IAAIkc,GAEjD5C,GAAmCrU,EAAO,IAAIlF,IAAI,CAACmc,KA4BrDC,CAA6ClX,EAAOiX,IAkBtD,IAAIE,GA1CJ,SAA2BnX,EAAOiX,EAAYG,GAC5C,IAAIC,EAEJ,GAAK9c,EAAa,iCAAlB,CAIA,IAAI5C,EAAMqI,EAAMI,WAAWO,UAAUwS,gBACjCmE,GAAiD,QAApCD,EAAW1f,EAAIyC,IAAI6c,UAAsC,IAAbI,EAAsBA,EAAW,GAAKD,EAElF,IAAbE,EACFN,GAAwBhX,EAAOiX,GAE/Btf,EAAIqC,IAAIid,EAAYK,KA6BpBH,GAfJ,SAAwCnX,GACtC,GAAKzF,EAAa,iCAAlB,CAIA,IAAIpD,EAAQ6I,EAAMI,WAClBiU,GAAmCrU,EAAO7I,EAAMwJ,UAAUyS,8BAC1Djc,EAAMwJ,UAAUyS,6BAA6BmE,UAQ3CJ,GALJ,SAAqC1C,GAEnC,YAAa9Z,IAAN8Z,EAAkB,aAAeA,GAgC1C,SAAS5hB,GAAgB2kB,GACvB,IAAIC,EAAaC,EAASC,EAAMC,EAAaC,EAASC,EAEtD,OAAO,UAAyB,SAA0BC,GACxD,OACE,OAAQA,EAAUzc,KAAOyc,EAAUljB,MACjC,KAAK,EACH4iB,EAAc3kB,EAA2B0kB,GACzCO,EAAUzc,KAAO,EAEjBmc,EAAYtjB,IAEd,KAAK,EACH,IAAKujB,EAAUD,EAAYjkB,KAAKY,KAAM,CACpC2jB,EAAUljB,KAAO,GACjB,MAGF8iB,EAAOD,EAAQrjB,MACfujB,EAAc9kB,EAA2B6kB,GACzCI,EAAUzc,KAAO,EAEjBsc,EAAYzjB,IAEd,KAAK,EACH,IAAK0jB,EAAUD,EAAYpkB,KAAKY,KAAM,CACpC2jB,EAAUljB,KAAO,GACjB,MAKF,OAFAijB,EAAMD,EAAQxjB,MACd0jB,EAAUljB,KAAO,GACVijB,EAET,KAAK,GACHC,EAAUljB,KAAO,EACjB,MAEF,KAAK,GACHkjB,EAAUljB,KAAO,GACjB,MAEF,KAAK,GACHkjB,EAAUzc,KAAO,GACjByc,EAAUxc,GAAKwc,EAAiB,MAAE,GAElCH,EAAY3lB,EAAE8lB,EAAUxc,IAE1B,KAAK,GAKH,OAJAwc,EAAUzc,KAAO,GAEjBsc,EAAYrjB,IAELwjB,EAAUvc,OAAO,IAE1B,KAAK,GACHuc,EAAUljB,KAAO,EACjB,MAEF,KAAK,GACHkjB,EAAUljB,KAAO,GACjB,MAEF,KAAK,GACHkjB,EAAUzc,KAAO,GACjByc,EAAUC,GAAKD,EAAiB,MAAE,GAElCN,EAAYxlB,EAAE8lB,EAAUC,IAE1B,KAAK,GAKH,OAJAD,EAAUzc,KAAO,GAEjBmc,EAAYljB,IAELwjB,EAAUvc,OAAO,IAE1B,KAAK,GACL,IAAK,MACH,OAAOuc,EAAUtc,UAGtB7I,EAAU,KAAM,CAAC,CAAC,EAAG,GAAI,GAAI,IAAK,CAAC,EAAG,GAAI,GAAI,MAGnD,IAAIqlB,GAAyBplB,GAezBqlB,GAAqB,CACvBC,MAJ4B,oBAAXxe,OAKjBye,cAJuC,oBAAdC,WAAmD,gBAAtBA,UAAUC,SAM9DC,GAAUL,GAAmBC,MAC7BK,GAAiBlQ,GACjBmQ,GAA+BpW,GAC/BqW,GAAiBrW,GACjBsW,GAAU7O,GACV8O,GAAkBza,GAAYX,cAC9Bqb,GAAiB1a,GAAYN,aAC7Bib,GAAwB3a,GAAYgB,oBACpC4Z,GAAwBrS,GAA4BnK,oBACpDyc,GAA6BtS,GAA4BC,yBACzDsS,GAAmBvS,GAA4BF,eAC/C0S,GAA8BxS,GAA4BU,0BAC1D+R,GAAsBhC,GACtBiC,GAA4BzG,GAC5B0G,GAAwB1G,GAMxB2G,GAAwB,WAC1B,SAASA,EAASnZ,GAChB,IAAIoZ,EAASjnB,MAEb,OAAgBA,KAAMgnB,GAEtBnd,EAAgB7J,KAAM,cAAU,GAEhC6J,EAAgB7J,KAAM,YAAa,GAEnC6J,EAAgB7J,KAAM,eAAe,SAAUmM,GAG7C,OAFA8a,EAAOC,yBAEAR,GAA2BO,EAAOE,OAAQhb,MAGnDtC,EAAgB7J,KAAM,cAAc,SAAUmM,GAG5C,OAFA8a,EAAOC,yBAEAD,EAAOG,YAAYjb,GAAapG,eAGzC8D,EAAgB7J,KAAM,qBAAqB,SAAUqnB,GAInD,GAHAJ,EAAOC,0BAG4D,KAA9DG,MAAAA,OAAiC,EAASA,EAAInW,YAAsB,CACvE,IAAsE,KAAjEmW,MAAAA,OAAiC,EAASA,EAAIC,eACjD,MAAO,GAGT,IAAIziB,EAAQoiB,EAAOE,OAAOrZ,WAAW2G,YAErC,OAAO+R,GAAsB3hB,EAAM0L,YAGrC,IAAIK,EAAaqW,EAAOE,OAAOrZ,WAAW8C,WAEtCC,EAAiBoW,EAAOE,OAAOrZ,WAAW+C,eAE9C,OAAwE,OAAhEwW,MAAAA,OAAiC,EAASA,EAAIC,eAAyBf,GAAe/U,UAAiC,IAAtB6V,EAAIC,cAAyBd,GAAsBb,GAAuB,CAACsB,EAAOE,OAAOrZ,WAAW8C,WAAYqW,EAAOE,OAAOrZ,WAAW+C,kBAAoBzH,EAAsBmd,GAAe/U,UAAU,SAAU+V,GAC7T,IAAI3jB,EAAM2jB,EAAO3jB,IACjB,OAAQgN,EAAW5E,IAAIpI,KAASiN,EAAe7E,IAAIpI,SAIvDiG,EAAgB7J,KAAM,oBAAoB,SAAUwnB,GAClD,IAAI5jB,EAAM4jB,EAAO5jB,IAIjB,OAFAqjB,EAAOC,yBAEAd,GAAea,EAAOE,OAAQF,EAAOE,OAAOrZ,WAAW2G,YAAa7Q,MAG7EiG,EAAgB7J,KAAM,OAAO,SAAUynB,GACrCR,EAAOC,yBAEP,IAAIQ,EAAkB,IAAIC,GAAgBV,EAAQf,IAGlD,OAFAuB,EAAOC,GAEAE,GAAcF,EAAgBG,wBAGvChe,EAAgB7J,KAAM,WAAyB,WAC7C,IAAI8nB,GAAS,OAAgC,UAAyB,SAASC,EAASN,GACtF,IAAIC,EACJ,OAAO,UAAyB,SAAmBM,GACjD,OACE,OAAQA,EAAUhf,KAAOgf,EAAUzlB,MACjC,KAAK,EAKH,OAJA0kB,EAAOC,yBAEPQ,EAAkB,IAAIC,GAAgBV,EAAQf,IAC9C8B,EAAUzlB,KAAO,EACVklB,EAAOC,GAEhB,KAAK,EACH,OAAOM,EAAUC,OAAO,SAAUL,GAAcF,EAAgBG,sBAElE,KAAK,EACL,IAAK,MACH,OAAOG,EAAU7e,UAGtB4e,OAGL,OAAO,SAAUG,GACf,OAAOJ,EAAO3nB,MAAMH,KAAME,YAzBiB,IA6B/CF,KAAKmnB,OAAS,CACZrZ,SAAU,WACR,OAAOD,GAETwF,aAAc,SAAsB8U,GAClCta,EAAW4G,YAAc0T,EAASta,EAAW4G,cAE/ClF,SAAU,SAAkBC,GAC1B,IAAI4Y,EAASva,EAAW8S,gBAExB,GAAIyH,EAAOpc,IAAIwD,GACb,OAAOrL,EAAkBikB,EAAOtgB,IAAI0H,IAGtC,IAAI6Y,EAAWhC,KAEf,OADA+B,EAAO1gB,IAAI8H,EAAS6Y,GACbA,GAETC,wBAAyB,WACvB,MAAO,CACLnT,QAAS,eAGboT,uBAAwB,WACtB,MAAM,IAAIjkB,MAAM,mCAKpB,IACIkkB,EADAC,EAAcjoB,EAA2BR,KAAKmnB,OAAOrZ,WAAWC,qBAAqB/K,QAGzF,IACE,IAAKylB,EAAY5mB,MAAO2mB,EAAUC,EAAYvnB,KAAKY,MAAO,CACxD,IAAIoM,EAAUsa,EAAQzmB,MACtBokB,GAA6BnmB,KAAKmnB,OAAQtZ,EAAW4G,YAAavG,EAAS,OAC3E2Y,GAAoB7mB,KAAKmnB,OAAQjZ,EAAS,IAE5C,MAAO/L,GACPsmB,EAAY9oB,EAAEwC,GACd,QACAsmB,EAAYxmB,IAGdjC,KAAK0oB,SACL1oB,KAAK2oB,uBAkFP,OA/EA,OAAa3B,EAAU,CAAC,CACtBpjB,IAAK,SACL7B,MAAO,WACL,IAAI6mB,EAAS5oB,KAEb,IAAKiI,EAAa,iCAChB,OAAO,aAKTjI,KAAK6oB,YACL,IAAIC,GAAW,EACf,OAAO,WACAA,IACHA,GAAW,EAEXF,EAAOG,uBAIZ,CACDnlB,IAAK,uBACL7B,MAAO,WACL,IAAIinB,EAAShpB,KAERiI,EAAa,mCAIbge,IACH5e,OAAO4hB,YAAW,WAChB,OAAOD,EAAOD,qBACb,MAGN,CACDnlB,IAAK,mBACL7B,MAAO,WACAkG,EAAa,mCAIlBjI,KAAK6oB,YACD7oB,KAAK6oB,aAEV,CACDjlB,IAAK,yBACL7B,MAAO,WACDkG,EAAa,kCAAoCjI,KAAK6oB,YAQ3D,CACDjlB,IAAK,oBACL7B,MAAO,WAEL,OADA/B,KAAKknB,yBACElnB,KAAKmnB,SAEb,CACDvjB,IAAK,QACL7B,MAAO,WAEL,OADA/B,KAAKknB,yBACElnB,KAAKkpB,mBAEb,CACDtlB,IAAK,iBACL7B,MAAO,WAEL,OADA/B,KAAKknB,yBACElnB,KAAKmnB,OAAOrZ,WAAW2G,YAAY0L,YAMvC6G,EA3NmB,GA8N5B,SAASmC,GAAgBzb,EAAOC,GAC9B,IAAIyb,EAAclpB,UAAUwB,OAAS,QAAsB2G,IAAjBnI,UAAU,IAAmBA,UAAU,GAC7E2N,EAAaH,EAAMI,WACnB0B,EAAU4Z,EAActC,KAA8BnZ,EAAU6B,QACpE,MAAO,CACLiF,YAAa2U,EAAc,CAGzB5Z,QAASA,EACT2Q,QAAS3Q,EACT4Q,oBAAqB5c,EAAc,GAAImK,EAAUyS,qBACjD7P,WAAY,IAAI/H,IAAImF,EAAU4C,YAC9BH,WAAYzC,EAAUyC,WAAWC,QACjCC,kBAAmB3C,EAAU2C,kBAAkBD,SAC7C1C,EACJ2S,YAAa,EACb5L,SAAU,KACVC,aAAc,KACd/D,WAAY,IAAIpI,IAAIqF,EAAW+C,YAE/BC,eAAgB,IAAIrI,IAAIqF,EAAWgD,gBAEnC0P,yBAA0B,IAAI9Y,IAC9B+Y,6BAA8B,IAAI/Y,IAClC8J,6BAA8B,IAAI9J,IAClCgZ,oCAAqC,GACrCC,4BAA6B,IAAIlY,IACjCmY,iBAAiB,IAAIlZ,KAAMC,IAAI8H,EAAS9B,EAAM6B,SAAS5B,EAAU6B,UACjEoR,wBAAyB,IAAInZ,IAC7B4G,UAAW,CACTwS,gBAAiB,IAAIpZ,IACrB2G,oBAAqB,IAAI3G,IACzBqZ,6BAA8B,IAAItY,KAEpCuF,qBAAsB,IAAItG,KAW9B,SAASmgB,GAAcla,GACrB,IAAI8B,EAAUtP,UAAUwB,OAAS,QAAsB2G,IAAjBnI,UAAU,GAAmBA,UAAU,GAAK,UAC9E2N,EAAaH,EAAMI,WACnBH,EAAwB,YAAZ6B,EAAwB3B,EAAW4G,YAActQ,EAAkB0J,EAAW8G,cAC9F,OAAO,IAAIqS,GAASmC,GAAgBzb,EAAOC,IAG7C,IAAIga,GAA+B,SAAU0B,IAC3C,OAAU1B,EAAiB0B,GAE3B,IAAIC,EAAUtqB,EAAa2oB,GAE3B,SAASA,EAAgB4B,EAAUC,GACjC,IAAIC,EA+DJ,OA7DA,OAAgBzpB,KAAM2nB,GAEtB8B,EAASH,EAAQ5pB,KAAKM,KAAMmpB,GAAgBI,EAAS1B,oBAAqB0B,EAAS1B,oBAAoB/Z,WAAW2G,aAAa,IAE/H5K,GAAgB,OAAuB4f,GAAS,cAAU,GAE1D5f,GAAgB,OAAuB4f,GAAS,OAAO,SAAUC,EAAaC,GAC5EF,EAAOvC,yBAEP,IAAIxZ,EAAQ+b,EAAO5B,oBAMnB4B,EAAOG,QAAO,WACZ/C,GAAoBnZ,EAAOgc,EAAY9lB,IAAK,GAC5C+iB,GAAiB8C,EAAO5B,oBAAqB6B,EAAaC,SAI9D9f,GAAgB,OAAuB4f,GAAS,SAAS,SAAUC,GACjED,EAAOvC,yBAEP,IAAIxZ,EAAQ+b,EAAO5B,oBAGnB4B,EAAOG,QAAO,WACZ/C,GAAoBnZ,EAAOgc,EAAY9lB,IAAK,GAC5C+iB,GAAiB8C,EAAO5B,oBAAqB6B,EAAapD,UAI9Dzc,GAAgB,OAAuB4f,GAAS,uCAAuC,SAAUjY,GAC/FiY,EAAOvC,yBAEP,IAAIxZ,EAAQ+b,EAAO5B,oBAGnB3B,IAAe,WACb,IACI2D,EADAC,EAActpB,EAA2BgR,EAAOqB,WAGpD,IACE,IAAKiX,EAAYjoB,MAAOgoB,EAAUC,EAAY5oB,KAAKY,MAAO,CACxD,IAAIioB,GAAgB,OAAeF,EAAQ9nB,MAAO,GAC9CwT,EAAIwU,EAAc,GAClBxhB,EAAIwhB,EAAc,GAEtBlD,GAAoBnZ,EAAO6H,EAAG,GAC9BqR,GAA4BlZ,EAAO,IAAI+Y,GAAsBlR,GAAIhN,IAEnE,MAAOpG,GACP2nB,EAAYnqB,EAAEwC,GACd,QACA2nB,EAAY7nB,WAKlBwnB,EAAOG,OAASJ,EACTC,EAKT,OAAO9B,EA1E0B,CA2EjCX,IAEEgD,GAAkB,CACpBhD,SAAUA,GACVW,gBAAiBA,GACjBsC,cA7FF,SAAuBC,GACrB,IAAIX,EAAW,IAAIvC,GAASD,MAC5B,OAA0B,MAAnBmD,EAA0BX,EAASlkB,IAAI6kB,GAAmBX,GA4FjE3B,cAAeA,IAEbuC,GAAoBH,GAAgBhD,SACpCoD,GAAoBJ,GAAgBrC,gBACpC0C,GAAoBL,GAAgBC,cACpCK,GAAoBN,GAAgBpC,cACpC2C,GAAiCppB,OAAO0E,OAAO,CACjDmF,UAAW,KACXgc,SAAUmD,GACVxC,gBAAiByC,GACjBH,cAAeI,GACfzC,cAAe0C,KAKbE,GAA4BnK,GAC5BoK,GAAwBpK,GACxBqK,GAAgB3a,GAChB4a,GAAuB5a,GACvB6a,GAAiB7a,GACjB8a,GAAuC9a,GACvC+a,GAAUtT,GACVuT,GAAevT,GACfwT,GAAyB5W,GAA4BiB,qBACrD4V,GAAmCpG,GACnCqG,GAAkBX,GAAkBN,cACpCkB,GAAc,cACdC,GAAa,aACbC,GAAY,YACZC,GAAU,UACVC,GAAS,SACTC,GAAW,WAEf,SAASC,KACP,MAAM,IAAInnB,MAAM,gEAGlB,IAAIonB,GAAevqB,OAAO0E,OAAO,CAC/BiI,SAAU2d,GACVpY,aAAcoY,GACdlc,SAAUkc,GACVnD,wBAAyBmD,GACzBlD,uBAAwBkD,KAEtBE,IAA+B,EAEnC,SAASC,GAAsBle,GAC7B,GAAIie,GACF,MAAM,IAAIrnB,MAAM,qJAGlB,IAAIuJ,EAAaH,EAAMI,WAEvB,GAA4B,OAAxBD,EAAW6G,SAAmB,CAC5BzM,EAAa,kCAAoCA,EAAa,uDAK5D4F,EAAWyS,YAAc,GAC3B2K,GAAiCvd,GAIrC,IAAI8B,EAAU3B,EAAW4G,YAAYjF,QACjCqI,EAAc2S,KAClB3c,EAAW6G,SAAWlR,EAAcA,EAAc,GAAIqK,EAAW4G,aAAc,GAAI,CACjFjF,QAASqI,EACTsI,QAAStI,EACTtH,WAAY,IAAI/H,IAChB4X,oBAAqB,KAEvBvS,EAAW8S,gBAAgBjZ,IAAImQ,EAAakT,GAAa5mB,EAAkB0J,EAAW8S,gBAAgB7Y,IAAI0H,OAI9G,IAAIqc,GAAa,gBAAoB,CACnCnZ,QAASgZ,KAGPI,GAAc,WAChB,OAAOV,GAAWS,KAGhBE,GAAuB,gBAAoB,MAY/C,SAASC,GAAiBte,EAAOG,EAAYF,GAC3C,IAGIse,EADAC,EAAc1rB,EAFGmqB,GAAqBjd,EAAOC,EAAWA,EAAU4C,aAKtE,IACE,IAAK2b,EAAYrqB,MAAOoqB,EAAUC,EAAYhrB,KAAKY,MAAO,CACxD,IAAI8B,EAAMqoB,EAAQlqB,MACdoqB,EAAQte,EAAW0D,6BAA6BzJ,IAAIlE,GAExD,GAAIuoB,EAAO,CACT,IACIC,EADAC,EAAc7rB,EAA2B2rB,GAG7C,IACE,IAAKE,EAAYxqB,MAAOuqB,EAAUC,EAAYnrB,KAAKY,MAAO,CACxD,IAAIwqB,GAAgB,OAAeF,EAAQrqB,MAAO,GAE9CwqB,GADSD,EAAc,IACN,OAAeA,EAAc,GAAI,IACrCC,EAAe,IAGhCjjB,EAFeijB,EAAe,IAErB5e,IAEX,MAAOxL,GACPkqB,EAAY1sB,EAAEwC,GACd,QACAkqB,EAAYpqB,OAIlB,MAAOE,GACP+pB,EAAYvsB,EAAEwC,GACd,QACA+pB,EAAYjqB,KAIhB,SAASuqB,GAA4B9e,GACnC,IAAIG,EAAaH,EAAMI,WACnBH,EAAYE,EAAW4G,YAEvBlE,EAAa5C,EAAU4C,WAE3B,GAAIA,EAAW1B,KAAM,CAEnB,IACI4d,EADAC,EAAclsB,EAA2BqN,EAAW2S,8BAGxD,IACE,IAAKkM,EAAY7qB,MAAO4qB,EAAUC,EAAYxrB,KAAKY,MAAO,CACxD,IAAI6qB,GAAgB,OAAeF,EAAQ1qB,MAAO,GAC9C6B,EAAM+oB,EAAc,GACpBC,EAAgBD,EAAc,GAElC,GAAIpc,EAAWvE,IAAIpI,GAAM,CACvB,IACIipB,EADAC,EAActsB,EAA2BosB,GAG7C,IACE,IAAKE,EAAYjrB,MAAOgrB,EAAUC,EAAY5rB,KAAKY,MAAO,CACxD,IAAIirB,GAAgB,OAAeF,EAAQ9qB,MAAO,GAC1CgrB,EAAc,IAGtBC,EAFmBD,EAAc,IAEpBrf,IAEf,MAAOvL,GACP2qB,EAAYntB,EAAEwC,GACd,QACA2qB,EAAY7qB,OAIlB,MAAOE,GACPuqB,EAAY/sB,EAAEwC,GACd,QACAuqB,EAAYzqB,IAGd,IACIgrB,EADAC,EAAc1sB,EAA2BqN,EAAW0S,0BAGxD,IACE,IAAK2M,EAAYrrB,MAAOorB,EAAUC,EAAYhsB,KAAKY,MAAO,CACxD,IAAIqrB,GAAgB,OAAeF,EAAQlrB,MAAO,GACzCorB,EAAc,IAGvBC,EAFoBD,EAAc,IAEpBzf,IAEhB,MAAOvL,GACP+qB,EAAYvtB,EAAEwC,GACd,QACA+qB,EAAYjrB,IAGTgG,EAAa,iCAAkC4F,EAAW6S,4BAA4B7R,OAGzFmd,GAAiBte,EAAOG,EAAYF,GAOpCE,EAAW6S,4BAA4B/c,SAAQ,SAAU0pB,GACvD,OAAOA,OAETxf,EAAW6S,4BAA4BuE,SAM3CpX,EAAW4S,oCAAoC9c,SAAQ,SAAU0pB,GAC/D,OAAOA,EAAG1f,MAEZE,EAAW4S,oCAAoC6M,OAAO,EAAGzf,EAAW4S,oCAAoC/e,QA6C1G,SAAS6rB,GAAQC,GACf,IAAIC,EAA2BD,EAAOC,yBAClCC,EAAW5B,KAEX6B,EAAYnC,GAAS,IACrBoC,GAAa,OAAeD,EAAW,GAEvCE,GADID,EAAW,GACJA,EAAW,IAsB1B,OApBAH,GAAyB,WACvB,OAAOI,EAAS,OAElBxC,IAAU,WAIRlV,GAAaC,iBAAiB,WAAW,YA1D7C,SAAkBsX,GAChB,IAAI7f,EAAa6f,EAAShb,QAAQ5E,WAClCD,EAAWyS,cAEX,IACE,IAAI5L,EAAW7G,EAAW6G,SAG1B,GAAiB,OAAbA,EACF,OAKF7G,EAAW8G,aAAe9G,EAAW4G,YACrC5G,EAAW4G,YAAcC,EACzB7G,EAAW6G,SAAW,KACtB8X,GAA4BkB,EAAShb,SAEN,MAA3B7E,EAAW8G,aACb9G,EAAW8S,gBAAgBjU,OAAOmB,EAAW8G,aAAanF,SAE1DtH,EAA4B,0DAA2D,UAGzF2F,EAAW8G,aAAe,KAEtB1M,EAAa,kCACfgjB,GAAiCyC,EAAShb,SAE5C,QACA7E,EAAWyS,eA4BTwN,CAASJ,SAObrC,IAAU,WACR,OAAO,WACLoC,GAAyB,kBAE1B,CAACA,IACG,KAyDT,IAAIM,GAAS,EAEb,SAASC,GAAoBC,GAC3B,IAKIC,EAkBArgB,EAvBAsgB,EAA6BF,EAAOE,2BACpCjE,EAAkB+D,EAAO/D,gBACzBkE,EAAYH,EAAOI,eACnBlU,EAAW8T,EAAO9T,SAsHlBmU,EAAwB/C,GAAO,MAC/BkC,EAA2BtC,IAAY,SAAU/mB,GACnDkqB,EAAsB5b,QAAUtO,IAC/B,CAACkqB,IAEAC,EAA6E,QAAtDL,EAAuB,6BAAgE,IAAzBA,EAAkCA,EAC3H,+BAEIxgB,EAAQ0gB,MAAAA,EAA6CA,EAAY,CACnEtgB,SAAU,WACR,OAAOD,EAAW6E,SAEpBW,aA9CiB,SAAsB8U,GACvC,IAAIta,EAAa6f,EAAShb,QAAQ5E,WAClC8d,GAAsB8B,EAAShb,SAE/B,IACI8b,EADA9Z,EAAWvQ,EAAkB0J,EAAW6G,UAG5C,IACEiX,IAA+B,EAC/B6C,EAAWrG,EAASzT,GACpB,QACAiX,IAA+B,EAG7B6C,IAAa9Z,IAWjB7G,EAAW6G,SAAW8Z,EAElBvmB,EAAa,gCACf+jB,GAAiBte,EAAOG,EAAY2gB,GAGtCrqB,EAAkBmqB,EAAsB5b,QAAxCvO,KAgBAoL,SA7Ga,SAAkBC,GAC/B,IAAI4Y,EAASva,EAAW6E,QAAQiO,gBAEhC,GAAIyH,EAAOpc,IAAIwD,GACb,OAAOrL,EAAkBikB,EAAOtgB,IAAI0H,IAGtC,IAAI6Y,EAAWyC,KAEf,OADA1C,EAAO1gB,IAAI8H,EAAS6Y,GACbA,GAqGPC,wBAlG4B,SAAiChf,EAAU1F,GACvE,GAAW,MAAPA,EAAa,CAEf,IACI2c,EADwBmN,EAAShb,QAAQ5E,WACQyS,yBAEjDkO,EAAKV,KAET,OADAxN,EAAyB7Y,IAAI+mB,EAAInlB,GAC1B,CACL6L,QAAS,WACPoL,EAAyB7T,OAAO+hB,KAKpC,IACIjO,EADyBkN,EAAShb,QAAQ5E,WACY0S,6BAErDA,EAA6BxU,IAAIpI,IACpC4c,EAA6B9Y,IAAI9D,EAAK,IAAI6D,KAG5C,IAAIinB,EAAOX,KAGX,OADA5pB,EAAkBqc,EAA6B1Y,IAAIlE,IAAM8D,IAAIgnB,EAAMplB,GAC5D,CACL6L,QAAS,WACP,IAAIC,EAAOoL,EAA6B1Y,IAAIlE,GAExCwR,IACFA,EAAK1I,OAAOgiB,GAEM,IAAdtZ,EAAKvG,MACP2R,EAA6B9T,OAAO9I,OAkE9C2kB,uBA1D2B,SAAgCoG,GAC3D/C,GAAsB8B,EAAShb,SAE/B,IAAK,IAAIkc,EAAM,EAAGC,EAAe1tB,OAAO6B,KAAK2rB,GAAWC,EAAMC,EAAantB,OAAQktB,IAAO,CACxF,IAAIrZ,EAAIsZ,EAAaD,GACrBzqB,EAAkBupB,EAAShb,QAAQ5E,WAAW4G,UAAU0L,oBAAoB7K,GAAKoZ,EAASpZ,MAuD1FmY,EAAWnC,GAAO7d,GACtBG,EAAa0d,GAAqC,MAA9B4C,EA5LtB,SAAsCzgB,EAAOwc,GAC3C,IAAI4E,EAAUrE,KAqCd,OApCAP,EAAgB,CAEdxiB,IAAK,SAAaqnB,EAAMhtB,GACtB,IAMIitB,EANAnqB,EAAQiqB,EAAQra,YAChBa,EAASsV,GAAeld,EAAO7I,EAAOkqB,EAAKnrB,IAAK7B,GAChDktB,EAAe,IAAIzmB,IAAI8M,EAAOtS,QAC9BsN,EAAoBzL,EAAMyL,kBAAkBD,QAE5C6e,EAAc1uB,EAA2ByuB,GAG7C,IACE,IAAKC,EAAYrtB,MAAOmtB,EAAUE,EAAYhuB,KAAKY,MAAO,CACxD,IAAIZ,EAAI8tB,EAAQjtB,MAChBuO,EAAkB5D,OAAOxL,IAE3B,MAAOiB,GACP+sB,EAAYvvB,EAAEwC,GACd,QACA+sB,EAAYjtB,IAGd6sB,EAAQra,YAAcjR,EAAcA,EAAc,GAAIqB,GAAQ,GAAI,CAChE0L,WAAYwQ,GAAiBlc,EAAM0L,WAAY0e,GAC/C7e,WAAY4a,GAAuBnmB,EAAMuL,WAAYkF,GAErDhF,kBAAmBA,KAGvB6e,yBAA0B,SAAkC/e,GAE1DA,EAAWzM,SAAQ,SAAU4E,EAAGgN,GAC9BuZ,EAAQra,YAAcoW,GAAqCiE,EAAQra,YAAac,EAAGhN,SAIlFumB,EAsJkDM,CAA6B1hB,EAAOygB,GAAiD,MAAnBjE,EAnJ7H,SAA2BA,GAEzB,OADegB,KAAkB7lB,IAAI6kB,GACrBrC,oBAAoB/Z,WAiJiHuhB,CAAkBnF,GAAmBO,MAC1L,IAAI6E,EAAgBhE,IAAQ,WAC1B,OAAOiD,EAAsBA,EAAoB1gB,GAAY,WAC3D,OAAOA,EAAW6E,QAAQ+B,YAAYjF,WACnC,OACJ,CAAC+e,EAAqB1gB,IAmBzB,OAjBAwd,IAAU,WACR,OAAO,WACL,IACIkE,EADAC,EAAchvB,EAA2BktB,EAAShb,QAAQ5E,WAAW8C,YAGzE,IACE,IAAK4e,EAAY3tB,MAAO0tB,EAAUC,EAAYtuB,KAAKY,MAAO,CACxD,IAAI2tB,EAAUF,EAAQxtB,MACtB2oB,GAAcgD,EAAShb,QAAS+c,IAElC,MAAOttB,GACPqtB,EAAY7vB,EAAEwC,GACd,QACAqtB,EAAYvtB,QAGf,IACiB,gBAAoB4pB,GAAW6D,SAAU,CAC3D3tB,MAAO2rB,GACO,gBAAoB3B,GAAqB2D,SAAU,CACjE3tB,MAAOutB,GACO,gBAAoB/B,GAAS,CAC3CE,yBAA0BA,IACxBtT,IAkBN,IAAIwV,GACW7D,GADX6D,GAncJ,WACE,IAAIL,EAAgBlE,GAAWW,IAM/B,OAJqB,MAAjBuD,GACF3lB,EAA4B,uIAGvB2lB,GA4bLK,GAfJ,SAAoBC,GAClB,IAAIC,EAAWD,EAAMC,SACjBC,GAAsB,OAAyBF,EAAO/wB,GAEtDkxB,EAAmBjE,KAEvB,OAAiB,IAAb+D,GAAsBE,EAAiBrd,UAAYgZ,GAG9CkE,EAAMzV,SAGK,gBAAoB6T,GAAqB8B,IAU3DE,GAAsBtpB,EAAgBhB,kBACtCuqB,GAAkBpkB,GAAYX,cAC9BglB,GAAYrkB,GAAYO,QACxB+jB,GAAkB/b,GAA4BZ,cAC9C4c,GAA6Bhc,GAA4BC,yBACzDgc,GAA0Bjc,GAA4BV,sBACtD4c,GAA6Blc,GAA4BrB,yBAE7D,SAASwd,GAAOpkB,GACd,MAA+C,SAAxC+jB,GAAU/jB,EAAYvI,KAAK4sB,SAGpC,IAAIC,GAAwC,WAC1C,SAASA,EAAyB/iB,EAAOC,GACvC,IAAI+iB,EAAS1wB,MAEb,OAAgBA,KAAMywB,GAEtB5mB,EAAgB7J,KAAM,cAAU,GAEhC6J,EAAgB7J,KAAM,kBAAc,GAEpC6J,EAAgB7J,KAAM,gBAAY,GAElC6J,EAAgB7J,KAAM,OAAO,SAAUmM,GACrC,GAAIukB,EAAOC,SAAS3kB,IAAIG,EAAYvI,KAElC,OAAO8sB,EAAOC,SAAS7oB,IAAIqE,EAAYvI,KAGzC,IAAK2sB,GAAOpkB,GACV,MAAM,IAAI7H,MAAM,0DAGlB,IAAIyM,EAAWqf,GAA2BM,EAAOvJ,OAAQhb,EAAaukB,EAAOE,YAE7E,GAAuB,aAAnB7f,EAASlM,MACX,OAAOkM,EAAS3L,SACX,KAAuB,aAAnB2L,EAASlM,MACZkM,EAAS3L,SAET,IAAId,MAAM,wBAAwBM,OAAOuH,EAAYvI,IAAK,uDAIpEiG,EAAgB7J,KAAM,OAAO,SAAU0pB,EAAajX,GAClD,IAAK8d,GAAO7G,GACV,MAAM,IAAIplB,MAAM,0DAGlB,GAA8B,mBAAnBmO,EAA+B,CACxC,IAAIC,EAAUge,EAAO5oB,IAAI4hB,GAEzBgH,EAAOC,SAASjpB,IAAIgiB,EAAY9lB,IAAK6O,EAAeC,SAGpDge,EAAOC,SAASjpB,IAAIgiB,EAAY9lB,IAAK6O,MAIzC5I,EAAgB7J,KAAM,SAAS,SAAU0pB,GACvCgH,EAAOhpB,IAAIgiB,EAAauG,OAG1BjwB,KAAKmnB,OAASzZ,EACd1N,KAAK4wB,WAAajjB,EAClB3N,KAAK2wB,SAAW,IAAIlpB,IAoCtB,OA/BA,OAAagpB,EAA0B,CAAC,CACtC7sB,IAAK,wBACL7B,MAAO,WACL,GAA2B,IAAvB/B,KAAK2wB,SAAS9hB,KAChB,OAAO7O,KAAK4wB,WAGd,IAGIC,EAHAtd,EAAW4c,GAAgBnwB,KAAK4wB,YAEhCE,EAActwB,EAA2BR,KAAK2wB,UAGlD,IACE,IAAKG,EAAYjvB,MAAOgvB,EAAUC,EAAY5vB,KAAKY,MAAO,CACxD,IAAIivB,GAAgB,OAAeF,EAAQ9uB,MAAO,GAC9CwT,EAAIwb,EAAc,GAClBxoB,EAAIwoB,EAAc,GAEtBT,GAA2B/c,EAAUgC,EAAGya,GAAoBznB,KAE9D,MAAOpG,GACP2uB,EAAYnxB,EAAEwC,GACd,QACA2uB,EAAY7uB,IAId,OADAouB,GAAwBrwB,KAAKmnB,OAAQ5T,GAC9BA,MAIJkd,EA1FmC,GAuG5C,IAGIO,GAbJ,SAAuBtjB,GACrB,OAAO,SAAUd,GACfc,EAAM2F,cAAa,SAAU1F,GAC3B,IAAIsjB,EAAY,IAAIR,GAAyB/iB,EAAOC,GAEpD,OADAf,EAAGqkB,GACIA,EAAUC,6BASnBC,GAAsChwB,OAAO0E,OAAO,CACtDmF,UAAW,KACXomB,cAAeJ,KA2CjB,IAAIK,GAzBJ,SAAmBhsB,EAAKiE,GACtB,IAGIgoB,EAHAzxB,EAAS,IAAI4H,IAEb8pB,EAAc/wB,EAA2B6E,GAG7C,IACE,IAAKksB,EAAY1vB,MAAOyvB,EAAUC,EAAYrwB,KAAKY,MAAO,CACxD,IAAI0vB,GAAgB,OAAeF,EAAQvvB,MAAO,GAC9C6B,EAAM4tB,EAAc,GACpBzvB,EAAQyvB,EAAc,GAEtBloB,EAASvH,EAAO6B,IAClB/D,EAAO6H,IAAI9D,EAAK7B,IAGpB,MAAOI,GACPovB,EAAY5xB,EAAEwC,GACd,QACAovB,EAAYtvB,IAGd,OAAOpC,GA2CT,IAAI4xB,GAvBJ,SAAmB/pB,EAAK4B,GACtB,IAGIooB,EAHA7xB,EAAS,IAAI2I,IAEbmpB,EAAcnxB,EAA2BkH,GAG7C,IACE,IAAKiqB,EAAY9vB,MAAO6vB,EAAUC,EAAYzwB,KAAKY,MAAO,CACxD,IAAIC,EAAQ2vB,EAAQ3vB,MAEhBuH,EAASvH,IACXlC,EAAO4I,IAAI1G,IAGf,MAAOI,GACPwvB,EAAYhyB,EAAEwC,GACd,QACAwvB,EAAY1vB,IAGd,OAAOpC,GAqBT,IAEI+xB,GARJ,SAAmBC,EAAWxtB,GAC5B,IAAKwtB,EACH,MAAM,IAAIvtB,MAAMD,IA0CpB,IAAIytB,GAxBJ,WAGE,IAFA,IAAIjyB,EAAS,IAAI4H,IAERsqB,EAAQ7xB,UAAUwB,OAAQswB,EAAO,IAAIlxB,MAAMixB,GAAQE,EAAQ,EAAGA,EAAQF,EAAOE,IACpFD,EAAKC,GAAS/xB,UAAU+xB,GAG1B,IAAK,IAAItwB,EAAI,EAAGA,EAAIqwB,EAAKtwB,OAAQC,IAI/B,IAHA,IAAId,EAAWmxB,EAAKrwB,GAAGqB,OACnBkvB,OAAU,IAELA,EAAUrxB,EAAS0B,QAAQT,MAElCjC,EAAO6H,IAAIwqB,EAAQnwB,MAAOiwB,EAAKrwB,GAAGmG,IAAIoqB,EAAQnwB,QAQlD,OAAOlC,GAiCT,IAAIsyB,GAlBJ,SAA2BC,EAAGC,GAC5B,GAAID,IAAMC,EACR,OAAO,EAGT,GAAID,EAAE1wB,SAAW2wB,EAAE3wB,OACjB,OAAO,EAGT,IAAK,IAAIC,EAAI,EAAG2wB,EAAIF,EAAE1wB,OAAQC,EAAI2wB,EAAG3wB,IACnC,GAAIywB,EAAEzwB,KAAO0wB,EAAE1wB,GACb,OAAO,EAIX,OAAO,GA0KT,IACI4wB,GAAW,SAiDf,IAAIC,GA/CJ,WA4CE,OA3CcD,KA2CP,kCAILE,GAAkBtB,GAAuBC,cACzCsB,GAAiB1c,GACjB2c,GAAkB9mB,GAAYX,cAC9B0nB,GAAY/mB,GAAYO,QACxBymB,GAAUhnB,GAAYP,MACtBwnB,GAA2BnD,GAC3BoD,GAAgBpD,GAEhBqD,IADkBjoB,GAAqBL,cACf0J,GAA4BnK,qBACpDgpB,GAA6B7e,GAA4BC,yBACzD6e,GAAmB9e,GAA4BF,eAC/Cif,GAA2B/e,GAA4BQ,uBACvDwe,GAA8Bhf,GAA4BU,0BAC1Due,GAA2Bjf,GAA4BW,uBACvDue,GAAsBzO,GACtB0O,GAAkBxmB,GAElBymB,IADajJ,GAAkBvD,SACbuD,GAAkB3C,eAEpC6L,GAAU7N,GAAmBC,MAC7B6N,GAAwBvsB,EAAqBC,oBAC7CusB,GAAqBxsB,EAAqBD,iBAC1C0sB,GAAgB,cAChBC,GAAc,YACdC,GAAY,UACZC,GAAW,SACXC,GAAa,WAGbC,GAAsB,KAE1B,SAASC,GAAenjB,EAAU5E,EAAauhB,GAI7C,GAAuB,aAAnB3c,EAASlM,MACX,OAAOkM,EAAS3L,SACX,GAAuB,YAAnB2L,EAASlM,MAMlB,MALc,IAAImB,SAAQ,SAAUC,GAClCynB,EAAShb,QAAQ5E,WAAW4S,4BAA4BjY,IAAIxC,MAKzD,GAAuB,aAAnB8K,EAASlM,MAClB,MAAMkM,EAAS3L,SAGf,MADU,IAAId,MAAM,mCAAoCM,OAAOuH,EAAYvI,IAAK,MAqUpF,SAASuwB,GAAuBhoB,GAM9B,OALIlE,EAAa,kCAEfmsB,GAAUjoB,GAGRunB,KApJN,SAA8CvnB,GAM5C,IAAIuhB,EAAWqF,KACX3L,EAAcwM,IAAc,WAC9B,IAAIhc,EAEAlK,EAAQggB,EAAShb,QACjB7E,EAAaH,EAAMI,WACnBH,EAAY1F,EAAa,gCAAmF,QAAjD2P,EAAwB/J,EAAW6G,gBAAgD,IAA1BkD,EAAmCA,EAAiD/J,EAAW4G,YACvN,OAAOwe,GAA2BvlB,EAAOvB,EAAawB,KACrD,CAAC+f,EAAUvhB,IACVkoB,EAAyBT,IAAc,WAKzC,OAAOxM,MACN,CAACA,IACAkN,EAAgB9B,KAChB+B,EAAYX,IAAc,SAAUY,EAAalrB,GACnD,IAAIoE,EAAQggB,EAAShb,QAsBrB,OArBmB2gB,GAAyB3lB,EAAOvB,GAAa,WAC9D,IAAKlE,EAAa,wCAChB,OAAOqB,IAMT,IAAImrB,EAAcrN,IAEbsN,EAAgBhiB,QAAQxN,GAAGuvB,IAC9BnrB,IAQForB,EAAgBhiB,QAAU+hB,IACzBH,GACiBnf,UACnB,CAACuY,EAAUvhB,EAAamoB,EAAelN,IACtC1jB,EAASovB,KACT/hB,EAAW4iB,GAAmBjwB,EAAQ2wB,EAAwBE,GAC9DG,EAAkBX,GAAShjB,GAI/B,OAHA8iB,IAAY,WACVa,EAAgBhiB,QAAU3B,KAErBA,EAgGE4jB,CAAqCxoB,GA7FhD,SAAuCA,GAMrC,IAAIuhB,EAAWqF,KAEX6B,EAAcZ,GAAW,IACzBa,GAAc,OAAeD,EAAa,GAE1CE,GADID,EAAY,GACFA,EAAY,IAE1BP,EAAgB9B,KACpBqB,IAAY,WACV,IAAInmB,EAAQggB,EAAShb,QACjB7E,EAAaH,EAAMI,WACnBkf,EAAeqG,GAAyB3lB,EAAOvB,GAAa,SAAU4oB,GACxE,IAAIC,EAEJ,IAAK/sB,EAAa,wCAChB,OAAO6sB,EAAY,IAGrB,IAAIL,EAAcxB,GAA2BvlB,EAAOvB,EAAauB,EAAMI,WAAW2G,cAEtB,QAArDugB,EAAwBN,EAAgBhiB,eAA+C,IAA1BsiB,OAAmC,EAASA,EAAsB9vB,GAAGuvB,KACvIK,EAAYL,GAGdC,EAAgBhiB,QAAU+hB,IACzBH,GAkBH,GAAIzmB,EAAW6G,SACbhH,EAAMI,WAAW2S,oCAAoCld,MAAK,WACxDmxB,EAAgBhiB,QAAU,KAC1BoiB,EAAY,WAET,CACL,IAAIG,EAEJ,IAAKhtB,EAAa,wCAChB,OAAO6sB,EAAY,IAGrB,IAAIL,EAAcxB,GAA2BvlB,EAAOvB,EAAauB,EAAMI,WAAW2G,cAErB,QAAtDwgB,EAAyBP,EAAgBhiB,eAAgD,IAA3BuiB,OAAoC,EAASA,EAAuB/vB,GAAGuvB,KAC1IK,EAAYL,GAGdC,EAAgBhiB,QAAU+hB,EAG5B,OAAOzH,EAAa7X,UACnB,CAACmf,EAAenoB,EAAauhB,IAChC,IAAI3c,EAAWkiB,GAA2BvF,EAAShb,QAASvG,GACxDuoB,EAAkBX,GAAShjB,GAI/B,OAHA8iB,IAAY,WACVa,EAAgBhiB,QAAU3B,KAErBA,EAmBEmkB,CAA8B/oB,GAWzC,SAASgpB,GAAehpB,GAMtB,IAAIuhB,EAAWqF,KAEf,OAAOmB,GADQC,GAAuBhoB,GACNA,EAAauhB,GAQ/C,SAAS0H,GAAkB1L,GAMzB,IAAIgE,EAAWqF,KACf,OAAOa,IAAc,SAAUjK,GAC7BuJ,GAAiBxF,EAAShb,QAASgX,EAAaC,KAC/C,CAAC+D,EAAUhE,IAmDhB,SAAS2L,GAA2B/rB,GAClC,IAAIokB,EAAWqF,KACfc,IAAY,WAEV,OADUnG,EAAShb,QAAQ4V,wBAAwBhf,GACxC6L,UACV,CAAC7L,EAAUokB,IAGhB,SAAS4H,GAAmCzwB,GAC1C,IAAIuL,EAAavL,EAAMuL,WAAWmlB,QAC9BC,EAA8Bxe,GAAcqa,GAAiBjhB,GAAY,SAAU7H,EAAGgN,GACxF,IACIkgB,EADO7C,GAAUrd,GACEmgB,qBACvB,OAAsB,MAAfD,GAA4C,SAArBA,EAAY9kB,MAA+B,aAAZpI,EAAE1D,UAC7D,SAAU0D,GACZ,OAAOA,EAAEnD,YAIX,OAAO0sB,GAAiBjtB,EAAMyL,kBAAkBilB,QAASC,GA4E3D,SAASG,GAAY5zB,GACnB,IAAI6zB,EAAM7B,KAIV,OAHAF,IAAY,WACV+B,EAAIljB,QAAU3Q,KAET6zB,EAAIljB,QA2Cb,SAASmjB,KACP,IAAInI,EAAWqF,KACf,OAAOa,IAAc,SAAUrK,GAC7B,IAAIuM,EAEAjoB,EAAa6f,EAAShb,QAAQ5E,WAC9B9E,EAAyD,QAAjD8sB,EAAwBjoB,EAAW6G,gBAAgD,IAA1BohB,EAAmCA,EAAwBjoB,EAAW4G,YACvIlS,EAAOgnB,EAAS1B,oBAAoB/Z,WAAW2G,YACnDie,IAAe,WAGb,IAFA,IAAIqD,EAAe,IAAIvtB,IAEdwtB,EAAM,EAAGC,EAAO,CAACjtB,EAAKoH,WAAWpN,OAAQT,EAAK6N,WAAWpN,QAASgzB,EAAMC,EAAKv0B,OAAQs0B,IAAO,CACnG,IAGIE,EADAC,EAAc31B,EAFPy1B,EAAKD,IAKhB,IACE,IAAKG,EAAYt0B,MAAOq0B,EAAUC,EAAYj1B,KAAKY,MAAO,CACxD,IAEIs0B,EAAsBC,EAFtBzyB,EAAMsyB,EAAQn0B,OAIyC,QAArDq0B,EAAuBptB,EAAKoH,WAAWtI,IAAIlE,UAA2C,IAAzBwyB,OAAkC,EAASA,EAAqBhxB,aAAqE,QAArDixB,EAAuB9zB,EAAK6N,WAAWtI,IAAIlE,UAA2C,IAAzByyB,OAAkC,EAASA,EAAqBjxB,WAAawtB,GAAUhvB,GAAK0yB,4BAC1SP,EAAattB,IAAI7E,IAGrB,MAAOzB,GACPg0B,EAAYx2B,EAAEwC,GACd,QACAg0B,EAAYl0B,KAIhB8zB,EAAapyB,SAAQ,SAAUC,GAC7BuvB,GAAyBzF,EAAShb,QAAS,IAAIsgB,GAAsBpvB,GAAMrB,EAAK6N,WAAWpE,IAAIpI,GAAOO,EAAkB5B,EAAK6N,WAAWtI,IAAIlE,IAAQ+uB,OAEtJjF,EAAShb,QAAQW,cAAa,SAAUxO,GACtC,OAAOrB,EAAcA,EAAc,GAAIqB,GAAQ,GAAI,CACjDsb,QAASoJ,EAASL,2BAIvB,CAACwE,IAgBN,IAAI6I,GAAW,SAASA,KACtB,OAAgBv2B,KAAMu2B,IAGpBC,GAAW,IAAID,GAuDnB,SAASnC,GAAUqC,GACjB,GAAKxuB,EAAa,iCAKlB,OAGF,SAA0BwuB,GACxB,IACIzU,GADQlhB,MAAMC,QAAQ01B,GAAYA,EAAW,CAACA,IAC1BpxB,KAAI,SAAU+sB,GACpC,OAAOA,aAAamB,GAAkBnB,EAAIA,EAAExuB,OAE1C8pB,EAAWqF,KACfc,IAAY,WACV,GAAK5rB,EAAa,iCAAlB,CAIA,IAAIyF,EAAQggB,EAAShb,QAErB,GAAIgkB,EAAUhkB,UAAY+gB,GAGxBpsB,OAAOsvB,aAAaD,EAAUhkB,SAC9BgkB,EAAUhkB,QAAU,SACf,CACL,IACIkkB,EADAC,EAAcr2B,EAA2BwhB,GAG7C,IACE,IAAK6U,EAAYh1B,MAAO+0B,EAAUC,EAAY31B,KAAKY,MAAO,CACxD,IAAIqgB,EAAIyU,EAAQ70B,MAChBuxB,GAAoB5lB,EAAOyU,EAAG,IAEhC,MAAOhgB,GACP00B,EAAYl3B,EAAEwC,GACd,QACA00B,EAAY50B,KAIhB,OAAO,WACL,IACI60B,EADAC,EAAcv2B,EAA2BwhB,GAG7C,IACE,IAAK+U,EAAYl1B,MAAOi1B,EAAUC,EAAY71B,KAAKY,MAAO,CACxD,IAAIk1B,EAAKF,EAAQ/0B,MACjBuxB,GAAoB5lB,EAAOspB,GAAK,IAElC,MAAO70B,GACP40B,EAAYp3B,EAAEwC,GACd,QACA40B,EAAY90B,SAGf,CAACyrB,GAAU9oB,QAAO,OAAmBod,KAKxC,IAAI0U,EAAY3C,KACZkD,EAAsBtB,GAAY3T,GAEtC,KAAKyR,SAAoCprB,IAAxB4uB,GAAsC9E,GAAyB8E,EAAqBjV,IAAe,CAClH,IAGIkV,EAHAxpB,EAAQggB,EAAShb,QAEjBykB,EAAc32B,EAA2BwhB,GAG7C,IACE,IAAKmV,EAAYt1B,MAAOq1B,EAAUC,EAAYj2B,KAAKY,MAAO,CACxD,IAAIs1B,EAAMF,EAAQn1B,MAClBuxB,GAAoB5lB,EAAO0pB,EAAK,IAElC,MAAOj1B,GACPg1B,EAAYx3B,EAAEwC,GACd,QACAg1B,EAAYl1B,IAGd,GAAIg1B,EAAqB,CACvB,IACII,EADAC,EAAc92B,EAA2By2B,GAG7C,IACE,IAAKK,EAAYz1B,MAAOw1B,EAAUC,EAAYp2B,KAAKY,MAAO,CACxD,IAAIqgB,EAAIkV,EAAQt1B,MAChBuxB,GAAoB5lB,EAAOyU,GAAI,IAEjC,MAAOhgB,GACPm1B,EAAY33B,EAAEwC,GACd,QACAm1B,EAAYr1B,KAIZy0B,EAAUhkB,SACZrL,OAAOsvB,aAAaD,EAAUhkB,SAGhCgkB,EAAUhkB,QAAUrL,OAAO4hB,YAAW,WACpCyN,EAAUhkB,QAAU,KAEpB,IACI6kB,EADAC,EAAch3B,EAA2BwhB,GAG7C,IACE,IAAKwV,EAAY31B,MAAO01B,EAAUC,EAAYt2B,KAAKY,MAAO,CACxD,IAAI21B,EAAMF,EAAQx1B,MAClBuxB,GAAoB5lB,EAAO+pB,GAAM,IAEnC,MAAOt1B,GACPq1B,EAAY73B,EAAEwC,GACd,QACAq1B,EAAYv1B,OAEbgyB,KAjHEyD,CAAiBjB,GAsI1B,IAAIkB,GAEqB9B,GAFrB8B,GAjMJ,SAA2B/qB,EAAIuE,GAC7B,IAAIuc,EAAWqF,KACX6E,EAAe/B,KACnB,OAAOjC,IAAc,WACnB,IAAK,IAAIiE,EAAQ33B,UAAUwB,OAAQo2B,EAAO,IAAIh3B,MAAM+2B,GAAQE,EAAQ,EAAGA,EAAQF,EAAOE,IACpFD,EAAKC,GAAS73B,UAAU63B,GAG1B,SAASrwB,EAAIgiB,EAAaC,GACxBuJ,GAAiBxF,EAAShb,QAASgX,EAAaC,GAGlD,SAASqO,EAAMtO,GACbwJ,GAAiBxF,EAAShb,QAASgX,EAAaiJ,IAIlD,IAAIpJ,EAAWiK,GAAgB9F,EAAShb,SAEpCulB,EAAexF,GAAgB/E,EAAShb,SACxC4D,EAAMkgB,GAwBV,OAvBA9D,IAAe,WACb,IAAIwF,EAAS,iWAEb,GAAkB,mBAAPtrB,EACT,MAAM,IAAItI,MAAM4zB,GAIlB,IAAI7K,EAAKzgB,EAAG,CACVlF,IAAKA,EACLswB,MAAOA,EACPzO,SAAUA,EACVqO,aAAcA,EACdO,kBAAmBF,IAGrB,GAAkB,mBAAP5K,EACT,MAAM,IAAI/oB,MAAM4zB,GAGlB5hB,EAAM+W,EAAGltB,WAAM,EAAQ23B,MAEtBxhB,aAAeigB,IAAwH3E,IAAiB,GACpJtb,IACE,MAARnF,EAAe,GAAGvM,QAAO,OAAmBuM,GAAO,CAACuc,SAAarlB,IAoJlEsvB,GAzSJ,WACE,IAAIjK,EAAWqF,KAEXqF,EAAcpE,IAAW,WAC3B,OAAOR,GAAgB9F,EAAShb,YAE9B2lB,GAAc,OAAeD,EAAa,GAC1C7O,EAAW8O,EAAY,GACvBC,EAAcD,EAAY,GAE1BE,EAAmB5C,GAAYpM,GAC/BmN,EAAY3C,KAyBhB,OAxBAF,IAAY,WAKV,OAJI6C,EAAUhkB,UAAY+gB,IACxBpsB,OAAOsvB,aAAaD,EAAUhkB,SAGzB6W,EAASb,WACf,CAACa,IACJ8L,GAA2BzB,IAAc,SAAUlmB,GACjD,OAAO4qB,EAAY9E,GAAgB9lB,MAClC,KAEC6qB,IAAqBhP,GAAakK,KAChCiD,EAAUhkB,UACZ6lB,MAAAA,GAAoEA,EAAiBxP,mBACrF1hB,OAAOsvB,aAAaD,EAAUhkB,UAGhC6W,EAASb,SACTgO,EAAUhkB,QAAUrL,OAAO4hB,YAAW,WACpCM,EAASR,mBACT2N,EAAUhkB,QAAU,OACnBuhB,KAGE1K,GAqQLoO,GAzaJ,SAAwBjO,GAMtB,MAAO,CAACyL,GAAezL,GAAc0L,GAAkB1L,KAmarDiO,GA1ZJ,SAAgCjO,GAM9B,MAAO,CAACyK,GAAuBzK,GAAc0L,GAAkB1L,KAoZ7DiO,GAjBJ,SAA8B/qB,EAAIuE,GAChC,IAAIuc,EAAWqF,KACf,OAAOe,IAAU,WACf,OAAO,WACL,IAAK,IAAI0E,EAAQt4B,UAAUwB,OAAQo2B,EAAO,IAAIh3B,MAAM03B,GAAQC,EAAS,EAAGA,EAASD,EAAOC,IACtFX,EAAKW,GAAUv4B,UAAUu4B,GAG3B,IAAIR,EAAexF,GAAgB/E,EAAShb,SAC5CulB,GAAa,SAAUS,GACrB9rB,EAAG8rB,GAAsBv4B,WAAM,EAAQ23B,SAGlC,MAAR3mB,EAAe,GAAGvM,QAAO,OAAmBuM,GAAO,CAACuc,SAAarlB,IAIlEsvB,GA7TJ,SAAsCruB,GACpC+rB,GAA2BzB,IAAc,SAAUlmB,GACjD,IAAI6b,EAAWiK,GAAgB9lB,EAAO,WAClC6qB,EAAmB/E,GAAgB9lB,EAAO,YAC9CpE,EAAS,CACPigB,SAAUA,EACVgP,iBAAkBA,MAEnB,CAACjvB,MAqTFquB,GAUcxC,GAVdwC,GAWsBxD,GAXtBwD,GAYSvD,GAZTuD,GA7bJ,SAA6BjO,GAM3B,IAAIgE,EAAWqF,KACf,OAAOa,IAAc,WACnBV,GAAiBxF,EAAShb,QAASgX,EAAaiJ,MAC/C,CAACjF,EAAUhE,KAobZiO,GAciBvC,GAdjBuC,GApNJ,WACE,IAAIjK,EAAWqF,KACf,OAAO,SAAUvhB,GACf,IAAI4O,EAAsBlgB,UAAUwB,OAAS,QAAsB2G,IAAjBnI,UAAU,GAAmBA,UAAU,GAAK,GAC9FwyB,IAAe,WACbhF,EAAShb,QAAQ6V,uBAAuBnI,GACxC5O,EAAO7N,SAAQ,SAAU5B,EAAO6B,GAC9B,OAAOwvB,GAA4B1F,EAAShb,QAAS,IAAIsgB,GAAsBpvB,GAAM7B,WA6MzF41B,GAlWJ,SAA8CruB,GAC5C+rB,GAA2BzB,IAAc,SAAUlmB,GACjD,IAAIiH,EAAejH,EAAMI,WAAW6G,aAChCF,EAAc/G,EAAMI,WAAW2G,YAE9BE,IACHzM,EAA4B,qGAC5ByM,EAAejH,EAAMI,WAAW2G,aAGlC,IAAIrE,EAAaklB,GAAmC7gB,GAChDkkB,EAAqBrD,GAAmC3gB,GACxDikB,EAAW5hB,GAAc6b,IAAS,SAAU9mB,GAC9C,IAAI8sB,EAAuBC,EAAwBC,EAAwBC,EAE3E,MAAO,CACLtD,qBAAsB,CACpB/kB,KAA8K,QAAvKkoB,EAAiF,QAAxDC,EAAyB/sB,EAAK2pB,4BAA6D,IAA3BoD,OAAoC,EAASA,EAAuBnoB,YAA4C,IAA1BkoB,EAAmCA,EAAwB,OACjPI,WAA2L,QAA9KF,EAAkF,QAAxDC,EAAyBjtB,EAAK2pB,4BAA6D,IAA3BsD,OAAoC,EAASA,EAAuBC,kBAAmD,IAA3BF,GAAoCA,OAMzOG,EAAgBzH,GAAiBhd,EAAYlE,YAAY,SAAUgF,GACrE,OAAOnF,EAAWpE,IAAIuJ,IAAMojB,EAAmB3sB,IAAIuJ,MAErDjM,EAAS,CACP8G,WAAYA,EACZuoB,mBAAoBA,EACpBC,SAAUA,EACVM,cAAeA,EACf9Y,oBAAqB5c,EAAc,GAAIiR,EAAY2L,yBAEpD,CAAC9W,MAmVF6vB,GAAiBppB,GACjBqpB,GAAgBzJ,GAUpB,IAAI0J,GARJ,WACE,IAAI3L,EAAW0L,KACf,OAAO,SAAUE,GACf,IAAI11B,EAAM01B,EAAO11B,IACjB,OAAOu1B,GAAezL,EAAShb,QAASgb,EAAShb,QAAQ5E,WAAW2G,YAAa7Q,KAKjF21B,GAAe5J,GACf6J,GAAgB7J,GAChB8J,GAAY,UAgBhB,IAAIC,GAdJ,WACE,IAAIhsB,EAAQ8rB,KAAgB9mB,QAC5B,OAAO+mB,IAAU,WAQf,OAPA,SAAsBE,GACpB,IAAIxf,EAAWwf,EAAOxf,SACtB,OAAoB,gBAAoBof,GAAc,CACpDlL,eAAgB3gB,GACfyM,MAIJ,CAACzM,KAwGN,SAASksB,GAAUx1B,EAAGijB,EAAKzjB,GAGzB,GAAiB,iBAANQ,IAAmBA,EAAEy1B,SAAS,OAASz1B,EAAEy1B,SAAS,MAC3D,MAAO,IAAKj1B,OAAOR,EAAG,KAIxB,cAAeA,GACb,IAAK,YACH,MAAO,GAGT,IAAK,UACH,OAAOA,EAAI,OAAS,QAEtB,IAAK,SACL,IAAK,SAEH,OAAO01B,OAAO11B,GAEhB,IAAK,SAEH,OAAO21B,KAAKH,UAAUx1B,GAExB,IAAK,WACH,IAAuE,KAAlEijB,MAAAA,OAAiC,EAASA,EAAI2S,gBACjD,MAAM,IAAI11B,MAAM,uDAGlB,MAAO,cAAcM,OAAOR,EAAE9C,KAAM,OAGxC,GAAU,OAAN8C,EACF,MAAO,OAKP,IAAI61B,EADN,GAAiB,iBAAN71B,EAGT,OAAiD,QAAzC61B,EAAkBF,KAAKH,UAAUx1B,UAAoC,IAApB61B,EAA6BA,EAAkB,GAI1G,GAAIj2B,EAAiBI,GACnB,MAAO,cAIT,GAAItD,MAAMC,QAAQqD,GAChB,MAAO,IAAIQ,OAAOR,EAAEiB,KAAI,SAAUkD,EAAG5G,GACnC,OAAOi4B,GAAUrxB,EAAG8e,EAAK1lB,EAAEP,eACzB,KAON,GAAwB,mBAAbgD,EAAE81B,OAEX,OAAON,GAAUx1B,EAAE81B,OAAOt2B,GAAMyjB,EAAKzjB,GAKvC,GAAIQ,aAAaqD,IAAK,CACpB,IAGI0yB,EAHArwB,EAAM,GAENswB,EAAc55B,EAA2B4D,GAG7C,IACE,IAAKg2B,EAAYv4B,MAAOs4B,EAAUC,EAAYl5B,KAAKY,MAAO,CACxD,IAAIu4B,GAAgB,OAAeF,EAAQp4B,MAAO,GAC9CwT,EAAI8kB,EAAc,GAClB9xB,EAAI8xB,EAAc,GAGtBvwB,EAAiB,iBAANyL,EAAiBA,EAAIqkB,GAAUrkB,EAAG8R,IAAQ9e,GAEvD,MAAOpG,GACPi4B,EAAYz6B,EAAEwC,GACd,QACAi4B,EAAYn4B,IAGd,OAAO23B,GAAU9vB,EAAKud,EAAKzjB,GAK7B,OAAIQ,aAAaoE,IACRoxB,GAAU94B,MAAMS,KAAK6C,GAAGk2B,MAAK,SAAUlI,EAAGC,GAC/C,OAAOuH,GAAUxH,EAAG/K,GAAKkT,cAAcX,GAAUvH,EAAGhL,OAClDA,EAAKzjB,QAIIyE,IAAXzH,QAA8C,MAAtBwD,EAAExD,OAAOC,WAAmD,mBAAvBuD,EAAExD,OAAOC,UAEjE+4B,GAAU94B,MAAMS,KAAK6C,GAAIijB,EAAKzjB,GAIhC,IAAIgB,OAAOzD,OAAO6B,KAAKoB,GAAGjB,QAAO,SAAUS,GAChD,YAAkByE,IAAXjE,EAAER,MACR02B,OACFj1B,KAAI,SAAUzB,GACb,MAAO,GAAGgB,OAAOg1B,GAAUh2B,EAAKyjB,GAAM,KAAKziB,OAAOg1B,GAAUx1B,EAAER,GAAMyjB,EAAKzjB,OACxE42B,KAAK,KAAM,KAuChB,IAAIC,GA1BJ,SAAyBr2B,GACvB,IAAIijB,EAAMnnB,UAAUwB,OAAS,QAAsB2G,IAAjBnI,UAAU,GAAmBA,UAAU,GAAK,CAC5E85B,gBAAgB,GAqBlB,OAAOJ,GAAUx1B,EAAGijB,IAKlBqT,GAAyB,WAC3B,SAASA,EAAUC,GAGjB,IAAIC,EAAgBC,EAAgBC,GAFpC,OAAgB96B,KAAM06B,GAItB7wB,EAAgB7J,KAAM,iBAAa,GAEnC6J,EAAgB7J,KAAM,aAAS,GAE/B6J,EAAgB7J,KAAM,cAAU,GAEhC6J,EAAgB7J,KAAM,cAAU,GAEhC6J,EAAgB7J,KAAM,qBAAiB,GAEvCA,KAAK+6B,UAAY,EACjB/6B,KAAK4c,MAAQ,KACb5c,KAAKg7B,OAAgG,QAAtFJ,EAAiBD,MAAAA,OAAyC,EAASA,EAAQM,aAAsC,IAAnBL,EAA4BA,EAAiB,aAC1J56B,KAAKk7B,OAAgG,QAAtFL,EAAiBF,MAAAA,OAAyC,EAASA,EAAQQ,aAAsC,IAAnBN,EAA4BA,EAAiB,aAC1J76B,KAAKo7B,cAAqH,QAApGN,EAAwBH,MAAAA,OAAyC,EAASA,EAAQU,oBAAoD,IAA1BP,EAAmCA,EAAwB,SAAUtV,GACrM,OAAOA,GAoGX,OAhGA,OAAakV,EAAW,CAAC,CACvB92B,IAAK,OACL7B,MAAO,WACL,OAAO/B,KAAK+6B,YAGb,CACDn3B,IAAK,OACL7B,MAAO,WACL,OAAO/B,KAAK4c,QAEb,CACDhZ,IAAK,MACL7B,MAAO,SAAau5B,EAAcC,GAChC,IAAIC,EAEJ,OAA0E,QAAlEA,EAAoBx7B,KAAKy7B,YAAYH,EAAcC,UAA6C,IAAtBC,OAA+B,EAASA,EAAkBz5B,QAE7I,CACD6B,IAAK,cACL7B,MAAO,SAAqBu5B,EAAcC,GACxC,IAAIG,EAAS17B,KAEb,OAAO27B,GAAS37B,KAAKwc,QAAQ,SAAUtO,GACrC,OAAOwtB,EAAON,cAAcE,EAAaptB,MACxC,CACD0tB,YAAa,SAAqB7vB,GAChCwvB,MAAAA,GAAoDA,EAASK,YAAY7vB,GAEvD,SAAdA,EAAK4E,MACP+qB,EAAOV,OAAOjvB,QAKrB,CACDnI,IAAK,MACL7B,MAAO,SAAa85B,EAAO95B,EAAOw5B,GAChC,IAEIO,EAFAC,EAAS/7B,KAGT+c,EAAUif,GAAQh8B,KAAKwc,OAAQqf,EAAMx2B,KAAI,SAAU42B,GACrD,IAAIC,GAAS,OAAeD,EAAQ,GAChC/tB,EAAUguB,EAAO,GACjBC,EAAYD,EAAO,GAEvB,MAAO,CAAChuB,EAAS6tB,EAAOX,cAAce,OACpC,KAAMp6B,EAAO,KAAM,CACrB65B,YAAa,SAAqB7vB,GAChCwvB,MAAAA,GAAoDA,EAASK,YAAY7vB,GAEvD,SAAdA,EAAK4E,OACPmrB,EAAW/vB,MAKZ/L,KAAKwc,SACRxc,KAAK4c,MAAQG,GAGf/c,KAAK+6B,YAEL/6B,KAAKk7B,OAAO/2B,EAAkB23B,MAE/B,CACDl4B,IAAK,SACL7B,MAAO,SAAiBgK,GACtB,IAAK/L,KAAKwc,OACR,OAAO,EAGT,IAAIA,EAAOrY,EAAkBnE,KAAKwc,QAGlC,QAFmB4f,GAAkB5f,EAAMzQ,EAAMA,EAAKgY,UAMlDhY,IAASyQ,GAAsB,WAAdA,EAAK7L,OAAsB6L,EAAK6f,SAASxtB,MAC5D7O,KAAK4c,MAAQ,KACb5c,KAAK+6B,UAAY,GACV,IAGT/6B,KAAK+6B,WAAauB,GAAsBvwB,IACjC,MAER,CACDnI,IAAK,QACL7B,MAAO,WACL/B,KAAK+6B,UAAY,EACjB/6B,KAAK4c,MAAQ,SAIV8d,EAzHoB,GA4HzBiB,GAAW,SAASA,EAASnf,EAAM8e,EAAcC,GACnD,IAAIgB,EAEJ,GAAY,MAAR/f,EAAJ,CAMA,GAFA+e,MAAAA,GAAuG,QAAlDgB,EAAwBhB,EAASK,mBAAmD,IAA1BW,GAA4CA,EAAsB78B,KAAK67B,EAAU/e,GAE9K,SAAdA,EAAK7L,KACP,OAAO6L,EAGT,IAAI2f,EAAYb,EAAa9e,EAAKtO,SAClC,OAAOytB,EAASnf,EAAK6f,SAASv0B,IAAIq0B,GAAYb,EAAcC,KAG1DS,GAAU,SAASA,EAAQxf,EAAMqf,EAAO9X,EAAQhiB,EAAOy6B,EAAWjB,GACpE,IAAIkB,EAEA1wB,EAEJ,GAAY,MAARyQ,EACF,GAAqB,IAAjBqf,EAAMn6B,OACRqK,EAAO,CACL4E,KAAM,OACN5O,MAAOA,EACPgiB,OAAQA,EACRyY,UAAWA,OAER,CACL,IAAIE,GAAS,OAASb,GAClBc,EAAOD,EAAO,GACdle,EAAOke,EAAOr7B,MAAM,GAEpBu7B,GAAQ,OAAeD,EAAM,GAC7BzuB,EAAU0uB,EAAM,GAChBT,EAAYS,EAAM,IAEtB7wB,EAAO,CACL4E,KAAM,SACNzC,QAASA,EACT6V,OAAQA,EACRsY,SAAU,IAAI50B,IACd+0B,UAAWA,IAERH,SAAS30B,IAAIy0B,EAAWH,EAAQ,KAAMxd,EAAMzS,EAAMhK,EAAOo6B,EAAWZ,SAK3E,GAFAxvB,EAAOyQ,EAEHqf,EAAMn6B,OAAQ,CAChB,IAAIm7B,GAAU,OAAShB,GACnBiB,EAASD,EAAQ,GACjBE,EAAQF,EAAQx7B,MAAM,GAEtB27B,GAAS,OAAeF,EAAQ,GAChCG,EAAWD,EAAO,GAClBE,EAAaF,EAAO,IAER,WAAdxgB,EAAK7L,MAAqB6L,EAAKtO,UAAY+uB,IAAmKrL,IAAiB,GACjOpV,EAAK6f,SAAS30B,IAAIw1B,EAAYlB,EAAQxf,EAAK6f,SAASv0B,IAAIo1B,GAAaH,EAAOvgB,EAAMza,EAAOm7B,EAAY3B,IAKzG,OADAA,MAAAA,GAAwG,QAAnDkB,EAAyBlB,EAASK,mBAAoD,IAA3Ba,GAA6CA,EAAuB/8B,KAAK67B,EAAUxvB,GAC5LA,GAGLqwB,GAAoB,SAA2B5f,EAAMzQ,EAAMgY,GAC7D,OAAKA,GAILA,EAAOsY,SAAS3vB,OAAOX,EAAKywB,WACrBW,GAAsB3gB,EAAMuH,EAAQA,EAAOA,SAJzCvH,IAASzQ,GAOhBoxB,GAAwB,SAASA,EAAsB3gB,EAAM4gB,EAAYrZ,GAC3E,OAAKA,GAI4B,IAA7BqZ,EAAWf,SAASxtB,MACtBkV,EAAOsY,SAAS3vB,OAAO0wB,EAAWZ,WAG7BW,EAAsB3gB,EAAMuH,EAAQA,EAAOA,SAPzCvH,IAAS4gB,GAUhBd,GAAwB,SAASA,EAAsBvwB,GACzD,MAAqB,SAAdA,EAAK4E,KAAkB,EAAI7P,MAAMS,KAAKwK,EAAKswB,SAAS7qB,UAAU6rB,QAAO,SAAUC,EAAKC,GACzF,OAAOD,EAAMhB,EAAsBiB,KAClC,IAMDC,GAHmB,CACrB9C,UAAWA,IAE6BA,UACtC+C,GAAkCt8B,OAAO0E,OAAO,CAClDmF,UAAW,KACX0vB,UAAW8C,KAuKTE,GAHkB,CACpBC,SAlK0B,WAC1B,SAASA,EAAShD,GAGhB,IAAIiD,GAFJ,OAAgB59B,KAAM29B,GAItB9zB,EAAgB7J,KAAM,gBAAY,GAElC6J,EAAgB7J,KAAM,aAAS,GAE/B6J,EAAgB7J,KAAM,aAAS,GAE/B6J,EAAgB7J,KAAM,aAAS,GAE/B6J,EAAgB7J,KAAM,YAAQ,GAE9B6J,EAAgB7J,KAAM,kBAAc,GAEpCA,KAAK69B,SAAWlD,EAAQmD,QACxB99B,KAAK6c,MAAQ,EACb7c,KAAK+9B,MAAQ,KACb/9B,KAAKg+B,MAAQ,KACbh+B,KAAKsF,KAAO,IAAImC,IAChBzH,KAAKi+B,WAAoD,QAAtCL,EAAkBjD,EAAQuD,cAAwC,IAApBN,EAA6BA,EAAkB,SAAUr1B,GACxH,OAAOA,GAsIX,OAlIA,OAAao1B,EAAU,CAAC,CACtB/5B,IAAK,OACL7B,MAAO,WACL,OAAO/B,KAAK+9B,QAEb,CACDn6B,IAAK,OACL7B,MAAO,WACL,OAAO/B,KAAKg+B,QAEb,CACDp6B,IAAK,OACL7B,MAAO,WACL,OAAO/B,KAAK6c,QAEb,CACDjZ,IAAK,UACL7B,MAAO,WACL,OAAO/B,KAAK69B,WAEb,CACDj6B,IAAK,MACL7B,MAAO,SAAa6B,GAClB,OAAO5D,KAAKsF,KAAK0G,IAAIhM,KAAKi+B,WAAWr6B,MAEtC,CACDA,IAAK,MACL7B,MAAO,SAAa6B,GAClB,IAAIu6B,EAAYn+B,KAAKi+B,WAAWr6B,GAE5BmI,EAAO/L,KAAKsF,KAAKwC,IAAIq2B,GAEzB,GAAKpyB,EAKL,OADA/L,KAAK0H,IAAI9D,EAAKmI,EAAKhK,OACZgK,EAAKhK,QAEb,CACD6B,IAAK,MACL7B,MAAO,SAAa6B,EAAK4hB,GACvB,IAAI2Y,EAAYn+B,KAAKi+B,WAAWr6B,GAEb5D,KAAKsF,KAAKwC,IAAIq2B,IAG/Bn+B,KAAK0M,OAAO9I,GAGd,IAAIw6B,EAAOp+B,KAAKo+B,OACZryB,EAAO,CACTnI,IAAKA,EACLy6B,MAAOD,EACPE,KAAM,KACNv8B,MAAOyjB,GAGL4Y,EACFA,EAAKE,KAAOvyB,EAEZ/L,KAAKg+B,MAAQjyB,EAGf/L,KAAKsF,KAAKoC,IAAIy2B,EAAWpyB,GAEzB/L,KAAK+9B,MAAQhyB,EACb/L,KAAK6c,QAEL7c,KAAKu+B,oBAEN,CACD36B,IAAK,kBACL7B,MAAO,WACD/B,KAAK6O,OAAS7O,KAAK89B,WACrB99B,KAAKw+B,cAGR,CACD56B,IAAK,YACL7B,MAAO,WACL,IAAI08B,EAAOz+B,KAAKy+B,OAEZA,GACFz+B,KAAK0M,OAAO+xB,EAAK76B,OAGpB,CACDA,IAAK,SACL7B,MAAO,SAAiB6B,GACtB,IAAIu6B,EAAYn+B,KAAKi+B,WAAWr6B,GAEhC,GAAK5D,KAAK6c,OAAU7c,KAAKsF,KAAK0G,IAAImyB,GAAlC,CAIA,IAAIpyB,EAAO5H,EAAkBnE,KAAKsF,KAAKwC,IAAIq2B,IACvCE,EAAQtyB,EAAKsyB,MACbC,EAAOvyB,EAAKuyB,KAEZD,IACFA,EAAMC,KAAOvyB,EAAKuyB,MAGhBA,IACFA,EAAKD,MAAQtyB,EAAKsyB,OAGhBtyB,IAAS/L,KAAKo+B,SAChBp+B,KAAK+9B,MAAQM,GAGXtyB,IAAS/L,KAAKy+B,SAChBz+B,KAAKg+B,MAAQM,GAGft+B,KAAKsF,KAAKoH,OAAOyxB,GAEjBn+B,KAAK6c,WAEN,CACDjZ,IAAK,QACL7B,MAAO,WACL/B,KAAK6c,MAAQ,EACb7c,KAAK+9B,MAAQ,KACb/9B,KAAKg+B,MAAQ,KACbh+B,KAAKsF,KAAO,IAAImC,QAIbk2B,EA9JmB,IAoKYA,SACpCe,GAAiCv9B,OAAO0E,OAAO,CACjDmF,UAAW,KACX2yB,SAAUD,KAERiB,GAAaD,GAAkBf,SAC/BiB,GAAcnB,GAAmB/C,UA2BrC,IAAImE,GAzBJ,SAAsBf,GACpB,IAAIzC,EAAen7B,UAAUwB,OAAS,QAAsB2G,IAAjBnI,UAAU,GAAmBA,UAAU,GAAK,SAAUqI,GAC/F,OAAOA,GAELu2B,EAAW,IAAIH,GAAW,CAC5Bb,QAASA,IAEPiB,EAAQ,IAAIH,GAAY,CAC1BvD,aAAcA,EACdJ,MAAO,SAAelvB,GACpB+yB,EAASp3B,IAAIqE,GAAM,IAErBovB,MAAO,SAAepvB,GACpB,IAAIizB,EAAUF,EAASL,OACvBK,EAASp3B,IAAIqE,GAAM,GAEfizB,GAAWD,EAAMlwB,OAASivB,GAC5BiB,EAAMryB,OAAOsyB,EAAQp7B,QAK3B,OAAOm7B,GAILE,GAAcxB,GAAmB/C,UACjCwE,GAAgB,CAClBC,SAAU,YACVC,SAAU,WACVtB,QAASuB,EAAAA,GAiBX,SAASC,GAAeH,GACtB,OAAQA,GACN,IAAK,YACH,OAAO,SAAU3Z,GACf,OAAOA,GAGX,IAAK,QACH,OAAO,SAAUA,GACf,OAAOiV,GAAuBjV,IAIpC,MAAM,IAAIlhB,MAAM,gCAAgCM,OAAOu6B,IAGzD,SAASI,GAAaH,EAAUtB,EAASzC,GACvC,OAAQ+D,GACN,IAAK,WAEH,OAAO,IAAIH,GAAY,CACrB5D,aAAcA,IAGlB,IAAK,MACH,OAAOwD,GAAoB16B,EAAkB25B,GAAUzC,GAEzD,IAAK,cACH,OAAOwD,GAAoB,EAAGxD,GAGlC,MAAM,IAAI/2B,MAAM,gCAAgCM,OAAOw6B,IAGzD,IAAII,GAhDJ,WACE,IAAIC,EAASv/B,UAAUwB,OAAS,QAAsB2G,IAAjBnI,UAAU,GAAmBA,UAAU,GAAKg/B,GAC7EQ,EAAkBD,EAAON,SACzBA,OAA+B,IAApBO,EAA6BR,GAAcC,SAAWO,EACjEC,EAAkBF,EAAOL,SACzBA,OAA+B,IAApBO,EAA6BT,GAAcE,SAAWO,EACjEC,EAAiBH,EAAO3B,QACxBA,OAA6B,IAAnB8B,EAA4BV,GAAcpB,QAAU8B,EAE9DC,EAAcP,GAAeH,GAC7BW,EAAYP,GAAaH,EAAUtB,EAAS+B,GAChD,OAAOC,GAyDT,IA4BMC,GA5BFC,GANJ,SAAwBC,GACtB,OAAO,WACL,OAAO,OAOPC,GAAax5B,EAAgBlC,SAC7B27B,GAAaz5B,EAAgBnC,SAC7B67B,GAAsB15B,EAAgBf,kBACtC06B,GAAwB35B,EAAgBlB,oBACxC86B,GAAsB55B,EAAgBhB,kBACtC66B,GAAoBxwB,GACpBywB,GAAqBzwB,GACrB0wB,GAAiB1wB,GACjB2wB,GAA6BlpB,GAC7BmpB,GAAkB90B,GAAYX,cAC9B01B,GAAwB/0B,GAAYV,oBACpC01B,GAA6Bh1B,GAAYD,yBACzCk1B,GAAiBj1B,GAAYC,aAC7Bi1B,GAAkBh2B,GAAqBL,cACvCs2B,GAAwBj2B,GAAqBd,oBAC7Cg3B,GAA2B7sB,GAA4BQ,uBACvDssB,GAAgCrc,GAChCsc,GAAkB5W,GAAkB3C,cACpCwZ,GAAmBpB,GACnBqB,GAAkB,GAElBC,GAAgB,IAAI75B,IAGpB85B,IACExB,GAAc,EACX,WACL,OAAOA,OAi1BX,IAAIyB,GAp0BJ,SAAkB7G,GAChB,IAAI/2B,EAAM+2B,EAAQ/2B,IACdkE,EAAM6yB,EAAQ7yB,IACd25B,EAAc9G,EAAQ+G,qBACtBh6B,EAAqB,MAAfizB,EAAQjzB,IAAcizB,EAAQjzB,SAAMW,EAE1C02B,EAAQS,GAA2BiC,MAAAA,EAAiDA,EAAc,CACpGtC,SAAU,YACVC,SAAU,aAERjxB,EAAa+yB,GAA8BvG,EAAQgH,qBACnDC,EAAmB,IAAIn6B,IACvBo6B,EAAkB,EAEtB,SAASC,IACP,OAAQ75B,EAAa,kCAAoC45B,EAAkB,EAG7E,SAASE,EAAiBr0B,GAKxB,OAJKk0B,EAAiB51B,IAAI0B,IACxBk0B,EAAiBl6B,IAAIgG,EA5BlB,CACLs0B,wCAAyC,KACzCC,eAAgB,KAChBC,kBAAmB,KACnBC,aAAc,OA2BPh+B,EAAkBy9B,EAAiB95B,IAAI4F,IAGhD,SAAS00B,EAAa10B,GAIpB,OAHAm0B,IACAn0B,EAAMI,WAAW+C,eAAepI,IAAI7E,GAE7B,WACLi+B,IACAn0B,EAAMI,WAAW+C,eAAenE,OAAO9I,GACvCg+B,EAAiBl1B,OAAOgB,IAI5B,SAAS20B,IACP,YAA2Ch6B,IAApCw4B,GAA2Bj9B,KAAuBk+B,IAG3D,SAASQ,EAA4B50B,EAAOqD,EAAUgvB,GACpD,GAAuB,YAAnBhvB,EAASlM,MAAqB,CAChC,IAAI09B,EAASjB,GAAcx5B,IAAIi4B,GAEjB,MAAVwC,GACFjB,GAAc55B,IAAIq4B,EAAawC,EAAS,IAAI/5B,KAG9C+5B,EAAO95B,IAAIiF,IA0Bf,SAAS80B,EAAsB90B,EAAO7I,EAAOjB,GAC3C,IAAI6+B,EAA0B/0B,EAAMI,WAAW+C,eAAe7E,IAAIpI,GAMlE,GAAI6+B,GAA2B59B,EAAMuL,WAAWpE,IAAIpI,GAClD,OAAOO,EAAkBU,EAAMuL,WAAWtI,IAAIlE,IAGhD,IAAImN,EAAWwvB,GAAkB7yB,EAAO7I,EAAOjB,GAM/C,MAJuB,YAAnBmN,EAASlM,OAAuB49B,GAClC59B,EAAMuL,WAAW1I,IAAI9D,EAAKmN,GAGrBA,EAiCT,SAAS2xB,EAAmBh1B,EAAOtH,EAASvB,EAAO89B,EAAW5C,GAC5D,OAAO35B,EAAQlC,MAAK,SAAUnC,GAC5B,IAAK+/B,IAGH,OADAc,EAAmBl1B,EAAOqyB,GACnBG,GAGT,IAAInvB,EAAWuvB,GAAoBv+B,GAKnC,OAJA8gC,EAAiB9gC,GACjB+gC,EAASj+B,EAAOk+B,EAAoBJ,GAAY5xB,GAChDiyB,EAAet1B,EAAO7I,EAAO,IAAI2D,IAAIm6B,EAAU3/B,QAAS+8B,GACxDkD,EAA+Bv1B,EAAOqD,EAAUgvB,GACzC,CACLt6B,QAAS1D,EACTmhC,MAAOt/B,MAERgC,OAAM,SAAUu9B,GACjB,IAAKrB,IAGH,OADAc,EAAmBl1B,EAAOqyB,GACnBG,GAOT,GAJIkD,EAAkB11B,EAAOqyB,IAC3BsD,EAA6BV,EAAWj1B,EAAOqyB,GAG7C/7B,EAAiBm/B,GACnB,OAAOG,EAA6B51B,EAAOy1B,EAAgBt+B,EAAO89B,EAAW5C,GAG/E,IAAIhvB,EAAWqvB,GAAoB+C,GAKnC,MAJAN,EAAiBM,GACjBL,EAASj+B,EAAOk+B,EAAoBJ,GAAY5xB,GAChDiyB,EAAet1B,EAAO7I,EAAO,IAAI2D,IAAIm6B,EAAU3/B,QAAS+8B,GACxDkD,EAA+Bv1B,EAAOqD,EAAUgvB,GAC1CoD,KAmCV,SAASG,EAA6B51B,EAAOtH,EAASvB,EAAO0+B,EAAcxD,GACzE,OAAO35B,EAAQlC,MAAK,SAAUs/B,GAC5B,IAAK1B,IAGH,OADAc,EAAmBl1B,EAAOqyB,GACnBG,GAGT,GAAIsD,aAAuBrD,GAEzB,OADAj4B,EAA4B,mDACrBg4B,GAGT,IAAIuD,EAASD,MAAAA,EAAiDA,EAAc,GACxEE,EAAiBD,EAAOP,MACxBS,EAAWF,EAAOh+B,QAQlBm+B,GAAuC,EAErB,MAAlBF,IAQF7+B,EAAMuL,WAAW1I,IAAIg8B,EAAgBpD,GAAoBqD,IAMzDC,GAAuC,GAqBzC,IAAIC,EAAiBC,EAAwCp2B,EAAO7I,GAEpE,GAAIg/B,GAA2C,aAAzBA,EAAeh/B,MAEnC,OADAk/B,EAAiBF,EAAgBn2B,GAC1B,CACLjI,QAASo+B,EAAez+B,SACxB89B,MAAOt/B,GA6BX,IAAKw/B,EAAkB11B,EAAOqyB,GAAc,CAC1C,IAAIiE,EAEAC,EAAgBC,EAAsCr/B,GAE1D,GAAmN,aAA9Mo/B,MAAAA,GAAyH,QAA1DD,EAAwBC,EAAchC,sBAAsD,IAA1B+B,OAA5E,EAAwHA,EAAsBn/B,OAKtM,OAAOo/B,EAAchC,eAAe78B,SAIxC,IAAI++B,EAAwBC,EAAuB12B,EAAO7I,EAAOk7B,EAAa6D,GAC1ES,GAAyB,OAAeF,EAAuB,GAC/DpzB,EAAWszB,EAAuB,GAClC1B,EAAY0B,EAAuB,GAcvC,GAZIjB,EAAkB11B,EAAOqyB,IAC3BsD,EAA6BV,EAAWj1B,EAAOqyB,GAGjDuE,EAA4BvzB,GAEL,YAAnBA,EAASlM,QACXi+B,EAASj+B,EAAOk+B,EAAoBJ,GAAY5xB,GAChDiyB,EAAet1B,EAAO7I,EAAO,IAAI2D,IAAIm6B,EAAU3/B,QAAS+8B,GACxDkD,EAA+Bv1B,EAAOqD,EAAUgvB,IAG3B,aAAnBhvB,EAASlM,MACX,MAAMkM,EAAS3L,SAGjB,MAAuB,aAAnB2L,EAASlM,MACJ,CACLY,QAASsL,EAAS3L,SAClB89B,MAAOt/B,GAUJmN,EAAS3L,YACfQ,OAAM,SAAUM,GACjB,IAAK47B,IAGH,OADAc,EAAmBl1B,EAAOqyB,GACnBG,GAGT,IAAInvB,EAAWqvB,GAAoBl6B,GAKnC,MAJA28B,EAAiB38B,GACjB48B,EAASj+B,EAAOk+B,EAAoBQ,GAAenD,GAAoBl6B,IACvE88B,EAAet1B,EAAO7I,EAAO,IAAI2D,IAAI+6B,EAAavgC,QAAS+8B,GAC3DkD,EAA+Bv1B,EAAOqD,EAAUgvB,GAC1C75B,KAIV,SAAS+8B,EAA+Bv1B,EAAOqD,EAAUgvB,GACnDqD,EAAkB11B,EAAOqyB,KAC3BgE,EAAiBhzB,EAAUrD,GAlT/B,SAAoC+mB,EAAasL,GAC/C,IAAIwC,EAASjB,GAAcx5B,IAAIi4B,GAE/B,QAAe13B,IAAXk6B,EAAsB,CACxB,IACIgC,EADAC,EAAchkC,EAA2B+hC,GAG7C,IACE,IAAKiC,EAAY3iC,MAAO0iC,EAAUC,EAAYtjC,KAAKY,MAAO,CACxD,IAAI4L,EAAQ62B,EAAQxiC,MACpBk/B,GAAyBvzB,EAAO,IAAIszB,GAAsBp9B,GAAM6wB,IAElE,MAAOtyB,GACPqiC,EAAY7kC,EAAEwC,GACd,QACAqiC,EAAYviC,IAGdq/B,GAAc50B,OAAOqzB,IAiSrB0E,CAA2B1zB,EAAUgvB,IAIzC,SAASiD,EAAet1B,EAAO7I,EAAOsM,EAAM4uB,GAC1C,IAAI2E,EAAiBC,EAAuBC,EAAkBC,EAGxDC,EAAuBC,EAAkBC,GAD3C5B,EAAkB11B,EAAOqyB,IAAgBl7B,EAAM2K,WAAsD,QAAxCk1B,EAAkBh3B,EAAMI,kBAA4C,IAApB42B,GAAgG,QAAzDC,EAAwBD,EAAgBjwB,mBAAmD,IAA1BkwB,OAA3E,EAAuHA,EAAsBn1B,UAAY3K,EAAM2K,WAAuD,QAAzCo1B,EAAmBl3B,EAAMI,kBAA6C,IAArB82B,GAA+F,QAAvDC,EAAwBD,EAAiBlwB,gBAAgD,IAA1BmwB,OAAzE,EAAqHA,EAAsBr1B,WAGnhBkxB,GAA2B,IAAIj5B,IAAI,CAAC,CAAC7D,EAAKuN,KAASzD,EAAwQ,QAAhQo3B,EAAkE,QAAzCC,EAAmBr3B,EAAMI,kBAA6C,IAArBi3B,GAA+F,QAAvDC,EAAwBD,EAAiBrwB,gBAAgD,IAA1BswB,OAAzE,EAAqHA,EAAsBx1B,eAA+C,IAA1Bs1B,EAAmCA,EAAwBp3B,EAAMI,WAAW2G,YAAYjF,SAI/Z,SAASy1B,EAAiBv3B,EAAO7I,EAAOsM,EAAM+zB,EAAWnF,GACvD5uB,EAAK1I,IAAIy8B,GACTlC,EAAet1B,EAAO7I,EAAOsM,EAAM4uB,GAGrC,SAASqE,EAAuB12B,EAAO7I,EAAOk7B,GAC5C,IAGIlgC,EAEAkR,EALAo0B,EAAyBjlC,UAAUwB,OAAS,QAAsB2G,IAAjBnI,UAAU,IAAmBA,UAAU,GACxFklC,EAAehE,GAAiBx9B,GAGhCyhC,GAAgB,EAEhB1C,EAAY,IAAIl7B,IAYhB0J,EAAO,IAAI3I,IAGf,SAAS88B,EAAen5B,GACtB,IAAIo5B,EAASp5B,EAAYvI,IACzBqhC,EAAiBv3B,EAAO7I,EAAOsM,EAAMo0B,EAAQxF,GAC7C,IAAIyF,EAAcL,EAAyB5E,GAAkB7yB,EAAO7I,EAAO0gC,GAAU/C,EAAsB90B,EAAO7I,EAAO0gC,GAIzH,GAHAjB,EAA4BkB,GAC5B7C,EAAUj7B,IAAI69B,EAAQC,GAEI,aAAtBA,EAAY3gC,MACd,OAAO2gC,EAAYpgC,SAGrB,MAAMogC,EAAYpgC,SAbpB49B,EAAet1B,EAAO7I,EAAOsM,EAAM4uB,GAgBnC,IAAI0F,GAAe,EAEfC,EAAc,SAAqB94B,GACrC,OAAO,WACL,IAAK64B,EACH,MAAM,IAAInhC,MAAM,wNAGlB,IAAIilB,EAAW4X,GAAgBzzB,GAC3B2f,EAAKzgB,EAAG,CACV2c,SAAUA,IAGZ,GAAkB,mBAAP8D,EACT,MAAM,IAAI/oB,MAAM,6DAGlB,OAAO+oB,EAAGltB,WAAM,EAAQD,aAI5B,IACEL,EAASiI,EAAI,CACXA,IAAKw9B,EACLI,YAAaA,IAEf7lC,EAASkhC,GAAgBlhC,GAAUylC,EAAezlC,GAAUA,EAC5D4lC,GAAe,EAEXzhC,EAAiBnE,GACnBA,EAAS6iC,EAAmBh1B,EAAO7N,EAAQgF,EAAO89B,EAAW5C,GAAa4F,QAAQP,GAElFA,IAEF,MAAOQ,GAGH5hC,EAFJnE,EAAS+lC,GAGP/lC,EAASyjC,EAA6B51B,EAAO7N,EAAQgF,EAAO89B,EAAW5C,GAAa4F,QAAQP,IAE5FC,GAAgB,EAChBD,KAaJ,OADAd,EAPEvzB,EADEs0B,EACSjF,GAAoBvgC,GACtBmE,EAAiBnE,GACfwgC,GAAsBxgC,GAEtBygC,GAAoBzgC,IAI1B,CAACkR,EAAU4xB,GAGpB,SAASmB,EAAwCp2B,EAAO7I,GACtD,IAAIghC,EAAqB,IAAIr9B,IACzBy7B,EAAgBlC,EAAiBr0B,GACjCo4B,EAAY/G,EAAMj3B,KAAI,SAAUoG,GAGlC,MAFqB,iBAAZA,GAA0H0jB,IAAiB,GACrI4Q,EAAsB90B,EAAO7I,EAAOqJ,GACnC9I,WACf,CACDw2B,YAAa,SAAqB7vB,GACd,WAAdA,EAAK4E,MAAqB5E,EAAKmC,UAAYtK,GAA+B,iBAAjBmI,EAAKmC,SAChE23B,EAAmBp9B,IAAIsD,EAAKmC,YAiBlC,OAJI43B,GACF9C,EAAet1B,EAAO7I,EAAOghC,EAAoB5B,EAAc/B,mBAG1D4D,EAeT,SAAS/C,EAAoBJ,GAC3B,OAAO7hC,MAAMS,KAAKohC,EAAU9vB,WAAWxN,KAAI,SAAU0gC,GACnD,IAAIC,GAAS,OAAeD,EAAQ,GAIpC,MAAO,CAHGC,EAAO,GACCA,EAAO,GAEA5gC,aAI7B,SAAS6gC,EAA4Cv4B,EAAO7I,GAC1D,IAAIqhC,EAAiB3E,KAEjB4E,EAAyB/B,EAAuB12B,EAAO7I,EAAOqhC,GAC9DE,GAAyB,OAAeD,EAAwB,GAChEp1B,EAAWq1B,EAAuB,GAClCC,EAAeD,EAAuB,GAK1C,OAHArC,EAAiBhzB,EAAUrD,EAAO24B,EAAcH,EAAgBrhC,GAsIlE,SAAmCA,EAAOyhC,EAAUv1B,GAC3B,YAAnBA,EAASlM,OACXi+B,EAASj+B,EAAOyhC,EAAUv1B,GAvI5Bw1B,CAA0B1hC,EAAOk+B,EAAoBsD,GAAet1B,GACpEuxB,EAA4B50B,EAAOqD,EAAUm1B,GACtCn1B,EAgDT,SAASmzB,EAAsCr/B,GAC7C,IAAI2hC,EAEAC,EAMI,QANMD,EAAmB1lC,MAAMS,KAAKqgC,EAAiB/uB,WAAW7L,MAAK,SAAU0/B,GACrF,IAAIC,GAAS,OAAeD,EAAQ,GAChCh5B,EAAQi5B,EAAO,GACf1C,EAAgB0C,EAAO,GAE3B,OAAuC,MAAhC1C,EAAchC,gBAA6D,MAAnCgC,EAAc/B,oBAUjE,SAA8Bx0B,EAAO7I,GACnC,IAAI+hC,EAAuBC,EAEvB5C,EAAgBlC,EAAiBr0B,GACjCo5B,EAAmG,QAAnFF,EAAwB3C,EAAcjC,+CAA+E,IAA1B4E,EAAmCA,EAAwB,IAAIn/B,IAC1Ks/B,EAAuCjmC,OAA6E,QAArE+lC,EAAwBG,EAAqBl/B,IAAIjD,EAAM2K,gBAAgD,IAA1Bq3B,EAAmCA,EAAwB,IAAIp/B,KAAOoL,WAClMo0B,EAAsBD,EAAqBh7B,IAAInH,EAAM2K,UAAYu3B,EAAqCrlC,SAAWolC,EAAaj4B,MAAQk4B,EAAqCjgC,OAAM,SAAUogC,GAC7L,IAAIC,GAAS,OAAeD,EAAQ,GAChCh5B,EAAUi5B,EAAO,GACjBC,EAAUD,EAAO,GAErB,OAAOL,EAAah/B,IAAIoG,KAAak5B,KAGvC,GAAoB,MAAhBN,GAAwBjiC,EAAM2K,UAAYy0B,EAAc9B,cAAgB8E,EAC1E,OAAO,EAIT,OADAD,EAAqBt/B,IAAI7C,EAAM2K,QAAS,IAAI/H,IAAIq/B,IACzChmC,MAAMS,KAAKulC,GAAc//B,MAAK,SAAUsgC,GAC7C,IAAIC,GAAS,OAAeD,EAAQ,GAChCn5B,EAAUo5B,EAAO,GACjBC,EAASD,EAAO,GAGpB,OADe9E,EAAsB90B,EAAO7I,EAAOqJ,GACnC9I,WAAamiC,EAAOniC,YAnCuDoiC,CAAqB95B,EAAO7I,aACpF,IAArB2hC,EAA8BA,EAAmB,GAIjE,OAHa,OAAeC,EAAQ,GACT,GAK7B,IAAIO,EAAuB,IAAIv/B,IAuC/B,SAASs8B,EAAiBhzB,EAAUrD,EAAOi1B,EAAWuD,EAAgBrhC,GACpE,IAAIo/B,EAAgBlC,EAAiBr0B,GAEd,YAAnBqD,EAASlM,OACXo/B,EAAcjC,wCAA0CW,EACxDsB,EAAc/B,kBAAoBgE,EAClCjC,EAAchC,eAAiBlxB,EAC/BkzB,EAAc9B,aAAet9B,MAAAA,OAAqC,EAASA,EAAM2K,UAEjFy0B,EAAcjC,wCAA0C,KACxDiC,EAAc/B,kBAAoB,KAClC+B,EAAchC,eAAiB,KAC/BgC,EAAc9B,aAAe,MAsBjC,SAASkB,EAA6BV,EAAWj1B,EAAOqyB,GACtD,IAAIkE,EAAgBlC,EAAiBr0B,GAEjC01B,EAAkB11B,EAAOqyB,KAC3BkE,EAAcjC,wCAA0CW,GAI5D,SAASC,EAAmBl1B,EAAOqyB,GAC7BqD,EAAkB11B,EAAOqyB,IAC3B6B,EAAiBl1B,OAAOgB,GAI5B,SAAS01B,EAAkB11B,EAAOqyB,GAEhC,OAAOA,IADagC,EAAiBr0B,GACAw0B,kBAGvC,SAASoC,EAA4BvzB,GACZ,YAAnBA,EAASlM,OACXg+B,EAAiB9xB,EAAS3L,UAI9B,SAASy9B,EAAiBrd,GACpB,EAON,SAASsd,EAASj+B,EAAO4iC,EAAY12B,GACnClM,EAAMuL,WAAW1I,IAAI9D,EAAKmN,GAC1BguB,EAAMr3B,IAAI+/B,EAAY12B,GAkBxB,SAAS22B,EAAah6B,EAAO7I,GAM3B,OALek6B,EAAMj3B,KAAI,SAAUoG,GACZ,iBAAZA,GAA0H0jB,IAAiB,GACpJ,IAAI1iB,EAAOsxB,GAAmB9yB,EAAO7I,EAAOqJ,GAC5C,OAAOgB,MAAAA,OAAmC,EAASA,EAAK9J,YAK5D,SAASuiC,EAAYj6B,EAAO7I,GAC1B,OAzBF,SAAoC+H,GAClC,GAAIy0B,GAAgBxH,SAASj2B,GAAM,CACjC,IAAIS,EAAU,8CAA8CO,OAAOy8B,GAAgBhgC,MAAMggC,GAAgBuG,QAAQhkC,IAAM42B,KAAK,QAC5H,OAAO4F,GAAoB,IAAI97B,MAAMD,IAGvCg9B,GAAgB99B,KAAKK,GAErB,IACE,OAAOgJ,IACP,QACAy0B,GAAgB5xB,OAcXo4B,EAA2B,WAChC,OAlLJ,SAAsCn6B,EAAO7I,GAC3C,IAAIihC,EAAYhC,EAAwCp2B,EAAO7I,GAE/D,GAAiB,MAAbihC,EAEF,OADA/B,EAAiB+B,EAAWp4B,GACrBo4B,EAGT,IAAIgC,EAA0B5D,EAAsCr/B,GAEpE,GAAIijC,EAAyB,CAC3B,IAAI7D,EAAgB6D,EAGpB,OAFAxF,EAA4B50B,EAAOvJ,EAAkB8/B,EAAchC,gBAAiB99B,EAAkB8/B,EAAc/B,oBAE7G/9B,EAAkB8/B,EAAchC,gBAGzC,OAAOgE,EAA4Cv4B,EAAO7I,GAiKjDkjC,CAA6Br6B,EAAO7I,MAI/C,SAASmjC,EAAmBnjC,GAC1BA,EAAMuL,WAAW1D,OAAO9I,GAG1B,GAAW,MAAP8D,EAAa,CA6Df,OAAOo5B,GAAe,CACpBl9B,IAAKA,EACL4sB,SAAU,WACVthB,KAAMw4B,EACN5/B,IAAK6/B,EACLjgC,IA7DgB,SAAqBgG,EAAO7I,EAAOmL,GACnD,IAAIi4B,GAA0B,EAC1B3yB,EAAS,IAAI7N,IAEjB,SAAS69B,EAAe4C,GACtB,IAAItkC,EAAMskC,EAAOtkC,IAEjB,GAAIqkC,EACF,MAAM,IAAI3jC,MAAM,4DAGlB,IAAIyM,EAAWyxB,EAAsB90B,EAAO7I,EAAOjB,GAGnD,GAFA0gC,EAA4BvzB,GAEL,aAAnBA,EAASlM,MACX,OAAOkM,EAAS3L,SACX,KAAuB,YAAnB2L,EAASlM,MACZ,IAAI+7B,GAAsBh9B,GAE1BmN,EAAS3L,SAInB,SAAS+iC,EAAeze,EAAajX,GACnC,GAAIw1B,EACF,MAAM,IAAI3jC,MAAM,4DAGlB,IAAI0L,EAAqC,mBAAnByC,EAEtBA,EAAe6yB,EAAe5b,IAAgBjX,EACzBguB,GAAe/yB,EAAO7I,EAAO6kB,EAAY9lB,IAAKoM,GACpDrM,SAAQ,SAAU4E,EAAGgN,GAClC,OAAOD,EAAO5N,IAAI6N,EAAGhN,MAQzB,IAAI+N,EAAM5O,EAAI,CACZA,IAAKygC,EACLrgC,IAAKw9B,EACLtN,MAPF,SAA0BtO,GACxBye,EAAeze,EAAaiX,MAO3B3wB,GAGH,QAAY3H,IAARiO,EACF,MAAMtS,EAAiBsS,GAAO,IAAIhS,MAAM,4DAA8D,IAAIA,MAAM,mDAIlH,OADA2jC,GAA0B,EACnB3yB,GASPtG,KAAMozB,EACNjyB,WAAY63B,EACZv7B,4BAA6B41B,EAC7B+F,2BAA4BzN,EAAQyN,2BACpC9R,4BAA4B,EAC5BnoB,WAAYA,IAGd,OAAO2yB,GAAe,CACpBl9B,IAAKA,EACL4sB,SAAU,WACVthB,KAAMw4B,EACN5/B,IAAK6/B,EACL34B,KAAMozB,EACNjyB,WAAY63B,EACZv7B,4BAA6B41B,EAC7B+F,2BAA4BzN,EAAQyN,2BACpC9R,4BAA4B,EAC5BnoB,WAAYA,KASdk6B,GAAsB3hC,EAAgBf,kBACtC2iC,GAAwB5hC,EAAgBlB,oBACxC+iC,GAAsB7hC,EAAgBhB,kBACtC8iC,GAAkB38B,GAAYX,cAC9Bu9B,GAAiB58B,GAAYZ,aAC7By9B,GAA6B78B,GAAYD,yBACzC+8B,GAAiB98B,GAAYC,aAC7B88B,GAA6B/8B,GAAYc,yBACzCk8B,GAAkB99B,GAAqBL,cACvCo+B,GAA4B10B,GAA4BS,wBACxDk0B,GAAmB30B,GAA4BF,eAC/C80B,GAA2B50B,GAA4BQ,uBACvDq0B,GAAgCpkB,GAEpC,SAASqkB,GAASvO,GAChB,IAAI/2B,EAAM+2B,EAAQ/2B,IACd6xB,EAAckF,EAAQjF,qBACtBvnB,EAAa86B,GAA8BtO,EAAQgH,qBACnDE,EAAkB,EAClBsH,EAAkBnlC,EAAiB22B,EAAQyO,SAAWd,GAAsB3N,EAAQyO,QAAQllC,MAAK,SAAUnC,GAO7G,OANAonC,EAAkBZ,GAAoBxmC,GAEpB,CAChBmhC,MAAOt/B,EACP6B,QAAS1D,MAGV6D,OAAM,SAAUM,GAEjB,MADAijC,EAAkBd,GAAoBniC,GAChCA,MACFqiC,GAAoB5N,EAAQyO,SAC9BC,OAAkChhC,EAGlCihC,EAAwB,IAAI7hC,IA4QhC,IAAIsE,EAAO48B,GAAe,CACxB/kC,IAAKA,EACL4sB,SAAU,OACVthB,KAnEF,SAAkBiY,EAAQtiB,GACxB,IAAI0kC,EAAMC,EAAwBC,EAElC,OAA6R,QAArRF,EAAgE,QAAxDC,EAAyB3kC,EAAMuL,WAAWtI,IAAIlE,UAA6C,IAA3B4lC,EAAoCA,EAAuF,QAA7DC,EAAwBJ,SAAuE,IAA1BI,OAAmC,EAASA,EAAsB,UAAyB,IAATF,EAAkBA,EAAOJ,GAiE9TrhC,IA9DF,SAAiBqf,EAAQtiB,GACvB,GAAIA,EAAMuL,WAAWpE,IAAIpI,GAEvB,OAAOO,EAAkBU,EAAMuL,WAAWtI,IAAIlE,IACzC,GAAIiB,EAAMyL,kBAAkBtE,IAAIpI,GAAM,CAG3C,GAAuC,MAAnCylC,EACF,OAAOA,EAGT,GAAmB,MAAf5T,EAEF,OADA9rB,EAA4B,+CAA+C/E,OAAOhB,EAAK,yCAChFulC,EAGT,IAAIO,EAAoB7kC,EAAMyL,kBAAkBxI,IAAIlE,GAChD+lC,EAAkBlU,EAAYmU,UAAUF,EAAmBlB,IAC3DqB,EAAyBF,aAA2BlB,GAAiBU,EAAkBZ,GAAoBoB,GAE/G,OADAN,EAAkCQ,EAGlC,OAAOV,GAyCTzhC,IAjCF,SAAiByf,EAAQtiB,EAAOmL,GAG9B,GAAInL,EAAMuL,WAAWpE,IAAIpI,GAAM,CAC7B,IAAI2T,EAAWpT,EAAkBU,EAAMuL,WAAWtI,IAAIlE,IAEtD,GAAuB,aAAnB2T,EAAS1S,OAAwBmL,IAAauH,EAASnS,SACzD,OAAO,IAAIqC,SAER,IAAK5C,EAAMyL,kBAAkBtE,IAAIpI,IAAQoM,aAAoBy4B,GAClE,OAAO,IAAIhhC,IAWb,OAFA4hC,OAAkChhC,GAE3B,IAAIZ,KAAMC,IAAI9D,EAAK2kC,GAAoBv4B,KAa9ChB,KApPF,SAAkBtB,EAAOo8B,EAAWl8B,GAClCi0B,IACA,IAAIkI,EAAer8B,EAAMI,WAAW8C,WAAW5E,IAAIpI,GAGnD,GAFA8J,EAAMI,WAAW8C,WAAWnI,IAAI7E,GAEF,YAA1BulC,EAAgBtkC,MAAqB,CACvC,IAAImlC,EAA2B,WAC7B,IAAIC,GAEiE,QAAxDA,EAAyBv8B,EAAMI,WAAW4G,gBAAiD,IAA3Bu1B,EAAoCA,EAAyBv8B,EAAMI,WAAW2G,aAEhJrE,WAAWpE,IAAIpI,IACxBklC,GAA0Bp7B,EAAO3B,IAIrCo9B,EAAgB/jC,SAASlB,KAAK8lC,GAA0BpkC,MAAMokC,GAKhE,IAAIE,EAAY1B,GACZ2B,EAAiB,KAErB,GAAgC,MAA5BxP,EAAQyP,mBAA6BL,EAAc,CACrD,IA6FIM,EA7FAC,GAAa,EAEbC,EAAU,SAAiBC,GAC7B,OAAO,SAAU/3B,GACf,GAAI63B,EAAY,CACd,IAAIG,EAAeP,aAAqBzB,IAAkBzkC,EAAiBkmC,GAAuC,aAA1Bf,EAAgBtkC,MAAuBskC,EAAgB/jC,SAAWojC,GAAkB0B,EAC5KA,EAAsC,mBAAnBz3B,EACnBA,EAAeg4B,GACbh4B,EAEEzO,EAAiBkmC,KACnBA,EAAYA,EAAUhmC,MAAK,SAAUnC,GAKnC,OAJAooC,EAAiB,CACfK,OAAQA,EACRzoC,MAAOA,GAEFA,UAGN,CACL,GAAIiC,EAAiByO,GACnB,MAAM,IAAInO,MAAM,qDAGY,mBAAnBmO,IACT03B,EAAiB,CACfK,OAAQA,EACRzoC,MAAO0Q,IAIXs2B,GAAiBr7B,EAAO3B,EAAgC,mBAAnB0G,EAAgC,SAAUg4B,GAC7E,IAAIz6B,EACJyC,EAAeg4B,GAMf,OAJAN,EAAiB,CACfK,OAAQA,EACRzoC,MAAOiO,GAEFA,GACLyC,MAKNi4B,EAAY,SAAmBF,GACjC,OAAO,WACL,OAAOD,EAAQC,EAARD,CAAgB/B,MAIvBrN,EAAQ,SAAeqP,GACzB,OAAO,SAAUG,GACfj9B,EAAM4a,yBAAwB,SAAUsiB,GACtC,IAAIC,EAGAC,EAAwBF,EAAa98B,WACrC2G,EAAcq2B,EAAsBr2B,YACpCE,EAAem2B,EAAsBn2B,aAEpCA,IACHzM,EAA4B,iGAC5ByM,EAAeF,GAGjB,IAAIggB,EAA4E,QAA7DoW,EAAwBp2B,EAAYrE,WAAWtI,IAAIlE,UAA4C,IAA1BinC,EAAmCA,EAAwB1B,EAEnJ,GAA0B,aAAtB1U,EAAY5vB,MAAsB,CACpC,IAAIkmC,EAAuBC,EAAiBC,EAAkBC,EAE1Dl7B,EAAWykB,EAAYrvB,SACvB+lC,EAA6E,QAA9DJ,EAAwBp2B,EAAavE,WAAWtI,IAAIlE,UAA4C,IAA1BmnC,EAAmCA,EAAwB5B,EAChJiC,EAAiC,aAAtBD,EAAYtmC,MAAuBsmC,EAAY/lC,SAAWojC,IAS7B,QAAtCwC,EAAkBb,SAAgD,IAApBa,OAA6B,EAASA,EAAgBR,UAAYA,IAAmD,QAAvCS,EAAmBd,SAAiD,IAArBc,OAA8B,EAASA,EAAiBlpC,SAAWiO,EAClP26B,EAAQ36B,EAAUo7B,IACgC,QAAvCF,EAAmBf,SAAiD,IAArBe,OAA8B,EAASA,EAAiBV,UAAYA,IAC9HL,EAAiB,SAGpBvmC,KAIHynC,EAAc7qC,EAAkF,QAAtD8qC,EAAwB3Q,EAAQyP,wBAAwD,IAA1BkB,EAAmCA,EAAwB,IAGvK,IACE,IAAKD,EAAYxpC,MAAOwoC,EAAUgB,EAAYnqC,KAAKY,MAAO,CACxD,IAEIwpC,EAWEC,EAbFf,EAASH,EAAQtoC,MAIjBypC,EAAUhB,EAAO,CACnBz+B,KAAMA,EACN6B,QAASA,EACT28B,QAASA,EAAQC,GACjBE,UAAWA,EAAUF,GACrBrP,MAAOA,EAAMqP,KAGf,GAAe,MAAXgB,EAGFlC,EAAsB5hC,IAAIgG,EAAO,GAAG9I,QAAO,OAAkF,QAA9D2mC,EAAwBjC,EAAsBxhC,IAAI4F,UAA8C,IAA1B69B,EAAmCA,EAAwB,IAAK,CAACC,MAG1M,MAAOrpC,GACPkpC,EAAY1rC,EAAEwC,GACd,QACAkpC,EAAYppC,IAGdqoC,GAAa,EAKf,KAAMJ,aAAqBzB,IAAiB,CAC1C,IAAIgD,EAEAC,EAAe1nC,EAAiBkmC,GAAa5B,GAtLrD,SAA4B56B,EAAOtH,GACjC,IAAIulC,EAAiBvlC,EAAQlC,MAAK,SAAUnC,GAC1C,IAAI+iC,EAAuB8G,EAQ3B,OAJ6D,QAAvDA,GAF8D,QAAvD9G,EAAwBp3B,EAAMI,WAAW4G,gBAAgD,IAA1BowB,EAAmCA,EAAwBp3B,EAAMI,WAAW2G,aAEpHrE,WAAWtI,IAAIlE,UAA4C,IAA1BgoC,OAAmC,EAASA,EAAsBxmC,YAAcumC,GACnJ5C,GAAiBr7B,EAAO3B,EAAMhK,GAGzB,CACLmhC,MAAOt/B,EACP6B,QAAS1D,MAEV6D,OAAM,SAAUM,GACjB,IAAI2lC,EAAwBC,EAQ5B,MAJ8D,QAAxDA,GAF+D,QAAxDD,EAAyBn+B,EAAMI,WAAW4G,gBAAiD,IAA3Bm3B,EAAoCA,EAAyBn+B,EAAMI,WAAW2G,aAEtHrE,WAAWtI,IAAIlE,UAA6C,IAA3BkoC,OAAoC,EAASA,EAAuB1mC,YAAcumC,GACtJ3C,GAAyBt7B,EAAO3B,EAAMs8B,GAAoBniC,IAGtDA,KAER,OAAOylC,EA6JkEjJ,CAAmBh1B,EAAOw8B,IAAc3B,GAAoB2B,GACnIJ,EAAU15B,WAAW1I,IAAI9D,EAAK8nC,GAI2B,QAAxDD,EAAyB/9B,EAAMI,WAAW4G,gBAAiD,IAA3B+2B,GAA6CA,EAAuBr7B,WAAW1I,IAAI9D,EAAK8nC,GAG3J,OAAO,WACL,IAAIK,EAEJlK,IACgE,QAA/DkK,EAAyBzC,EAAsBxhC,IAAI4F,UAA+C,IAA3Bq+B,GAA6CA,EAAuBpoC,SAAQ,SAAU6nC,GAC5J,OAAOA,OAETlC,EAAsB58B,OAAOgB,GAC7BA,EAAMI,WAAW8C,WAAWlE,OAAO9I,KA2ErCuM,WAvCF,WACEk5B,OAAkChhC,GAuClCoE,4BAZF,WACE,YAA2CpE,IAApCqgC,GAA2B9kC,IAAsBi+B,GAAmB,GAY3EuG,2BAA4BzN,EAAQyN,2BACpC1S,qBAAsBiF,EAAQjF,qBAAuB,CACnD/kB,KAAMgqB,EAAQjF,qBAAqB/kB,KACnCsoB,WAAY0B,EAAQjF,qBAAqBuD,iBACvC5wB,EACJiuB,4BAA4B,EAC5BnoB,WAAYA,IAEd,OAAOpC,EAIT,SAASgjB,GAAK4L,GACZ,IAAIqR,EAAiBrR,EAAQyO,QACzB6C,GAAc,OAAyBtR,EAAS77B,GAEpD,OAAI+pC,GAAgBmD,GAoBtB,SAA0BrR,GACxB,IAAIuR,EAAOnd,GAAKvrB,EAAcA,EAAc,GAAIm3B,GAAU,GAAI,CAC5DyO,QAASZ,GACT9S,0BAAuDrtB,IAAjCsyB,EAAQjF,0BAAqCrtB,EAAY7E,EAAcA,EAAc,GAAIm3B,EAAQjF,sBAAuB,GAAI,CAChJkU,UAAW,SAAmBuC,GAC5B,OAAOA,aAAuB1D,GAAiB0D,EAAchoC,EAAkBw2B,EAAQjF,sBAAsBkU,UAAUuC,EAAa3D,OAKxI4B,iBAAkBzP,EAAQyP,oBAExBgC,EAAM5K,GAAgB,CACxB59B,IAAK,GAAGgB,OAAO+1B,EAAQ/2B,IAAK,kBAC5BkE,IAAK,SAAaukC,GAChB,IAEIC,GAAYC,EAFLF,EAAOvkC,KAEGokC,GAErB,OAAOI,aAAqB7D,GAAiB9N,EAAQyO,QAAUkD,GAEjE5kC,IAAK,SAAa8kC,EAAQx8B,GAExB,OAAOy8B,EADID,EAAO9kC,KACNwkC,EAAMl8B,IAEpBo4B,2BAA4BzN,EAAQyN,6BAGtC,OADAQ,GAA2BwD,EAAIxoC,IAAK8kC,GAA2B/N,EAAQ/2B,MAChEwoC,EA5CEM,CAAiBlpC,EAAcA,EAAc,GAAIyoC,GAAc,GAAI,CACxE7C,QAAS4C,KASJ9C,GAAS1lC,EAAcA,EAAc,GAAIyoC,GAAc,GAAI,CAChE7C,QAAS4C,KAoCf,IAAIW,GAAc5d,GA+Dd6d,GAHkB,CACpBC,SApD0B,WAC1B,SAASA,EAASlS,GAGhB,IAAIiD,GAFJ,OAAgB59B,KAAM6sC,GAItBhjC,EAAgB7J,KAAM,YAAQ,GAE9B6J,EAAgB7J,KAAM,kBAAc,GAEpCA,KAAKsF,KAAO,IAAImC,IAChBzH,KAAKi+B,WAAsG,QAAxFL,EAAkBjD,MAAAA,OAAyC,EAASA,EAAQuD,cAAwC,IAApBN,EAA6BA,EAAkB,SAAUr1B,GAC1K,OAAOA,GAoCX,OAhCA,OAAaskC,EAAU,CAAC,CACtBjpC,IAAK,OACL7B,MAAO,WACL,OAAO/B,KAAKsF,KAAKuJ,OAElB,CACDjL,IAAK,MACL7B,MAAO,SAAa6B,GAClB,OAAO5D,KAAKsF,KAAK0G,IAAIhM,KAAKi+B,WAAWr6B,MAEtC,CACDA,IAAK,MACL7B,MAAO,SAAa6B,GAClB,OAAO5D,KAAKsF,KAAKwC,IAAI9H,KAAKi+B,WAAWr6B,MAEtC,CACDA,IAAK,MACL7B,MAAO,SAAa6B,EAAK4hB,GACvBxlB,KAAKsF,KAAKoC,IAAI1H,KAAKi+B,WAAWr6B,GAAM4hB,KAErC,CACD5hB,IAAK,SACL7B,MAAO,SAAiB6B,GACtB5D,KAAKsF,KAAKoH,OAAO1M,KAAKi+B,WAAWr6B,MAElC,CACDA,IAAK,QACL7B,MAAO,WACL/B,KAAKsF,KAAK2f,YAIP4nB,EAhDmB,IAsDYA,SACpCC,GAAiC3rC,OAAO0E,OAAO,CACjDmF,UAAW,KACX6hC,SAAUD,KAERG,GAAarO,GAAkBf,SAC/BqP,GAAaF,GAAkBD,SAC/BI,GAAkB,CACpB9N,SAAU,YACVC,SAAU,OACVtB,QAASuB,EAAAA,GAiBX,SAAS6N,GAAiB/N,GACxB,OAAQA,GACN,IAAK,YACH,OAAO,SAAU3Z,GACf,OAAOA,GAGX,IAAK,QACH,OAAO,SAAUA,GACf,OAAOiV,GAAuBjV,IAIpC,MAAM,IAAIlhB,MAAM,gCAAgCM,OAAOu6B,IAGzD,SAASgO,GAAS/N,EAAUtB,EAASI,GACnC,OAAQkB,GACN,IAAK,WAEH,OAAO,IAAI4N,GAAW,CACpB9O,OAAQA,IAGZ,IAAK,MAEH,OAAO,IAAI6O,GAAW,CACpB7O,OAAQA,EACRJ,QAAS35B,EAAkB25B,KAG/B,IAAK,cAEH,OAAO,IAAIiP,GAAW,CACpB7O,OAAQA,EACRJ,QAAS,IAIf,MAAM,IAAIx5B,MAAM,gCAAgCM,OAAOw6B,IAGzD,IAAIgO,GAxDJ,WACE,IAAIC,EAASntC,UAAUwB,OAAS,QAAsB2G,IAAjBnI,UAAU,GAAmBA,UAAU,GAAK+sC,GAC7EK,EAAkBD,EAAOlO,SACzBA,OAA+B,IAApBmO,EAA6BL,GAAgB9N,SAAWmO,EACnEC,EAAkBF,EAAOjO,SACzBA,OAA+B,IAApBmO,EAA6BN,GAAgB7N,SAAWmO,EACnEC,EAAiBH,EAAOvP,QACxBA,OAA6B,IAAnB0P,EAA4BP,GAAgBnP,QAAU0P,EAEhE3N,EAAcqN,GAAiB/N,GAC/BJ,EAAQoO,GAAS/N,EAAUtB,EAAS+B,GACxC,OAAOd,GA8CL0O,GAA6B5hC,GAAYc,yBA6D7C,IAAI+gC,GA5CJ,SAAoB/S,GAClB,IAAIgT,EAAuBC,EAEvBC,EAAYT,GAAuB,CACrCjO,SAAkM,QAAvLwO,EAA6F,QAApEC,EAAyBjT,EAAQmT,qCAAsE,IAA3BF,OAAoC,EAASA,EAAuBzO,gBAAgD,IAA1BwO,EAAmCA,EAAwB,QACrQvO,SAAU,aAIZ,OAAO,SAAU2O,GACf,IAAIC,EAEAC,EAAaJ,EAAU/lC,IAAIimC,GAE/B,GAAkB,MAAdE,EACF,OAAOA,EAG2BtT,EAAQmT,8BAA5C,IACII,GAAc,OAAyBvT,EAAS57B,GAEhDovC,EAAUxB,GAAYnpC,EAAcA,EAAc,GAAI0qC,GAAc,GAAI,CAC1EtqC,IAAK,GAAGgB,OAAO+1B,EAAQ/2B,IAAK,MAAMgB,OAA+D,QAAvDopC,EAAmBvT,GAAuBsT,UAA0C,IAArBC,EAA8BA,EAAmB,QAC1J5E,QAAoC,mBAApBzO,EAAQyO,QAExBzO,EAAQyO,QAAQ2E,GAEhBpT,EAAQyO,QACRzH,oBAA4D,mBAAhChH,EAAQgH,oBAAqChH,EAAQgH,oBAAoBoM,GAAUpT,EAAQgH,oBACvHyI,iBAAsD,mBAA7BzP,EAAQyP,iBAAkCzP,EAAQyP,iBAAiB2D,GAAUpT,EAAQyP,oBAWhH,OAJAyD,EAAUnmC,IAAIqmC,EAAQI,GACtBV,GAA2BU,EAAQvqC,KAAK,WACtCiqC,EAAUnhC,OAAOqhC,MAEZI,IAKPC,GAA6BviC,GAAYc,yBAKzC0hC,GAAY,EAgFhB,IAAIC,GAjEJ,SAAwB3T,GACtB,IAAIgT,EAAuBC,EAEvBW,EAAgBnB,GAAuB,CACzCjO,SAAkM,QAAvLwO,EAA6F,QAApEC,EAAyBjT,EAAQmT,qCAAsE,IAA3BF,OAAoC,EAASA,EAAuBzO,gBAAgD,IAA1BwO,EAAmCA,EAAwB,QACrQvO,SAAU,aAEZ,OAAO,SAAU2O,GACf,IAAIC,EAEAQ,EAAiBD,EAAczmC,IAAIimC,GAEvC,GAAsB,MAAlBS,EACF,OAAOA,EAGT,IAYIC,EAZAC,EAAQ,GAAG9pC,OAAO+1B,EAAQ/2B,IAAK,qBAAqBgB,OAIhD,QAJwDopC,EAAmBvT,GAAuBsT,EAAQ,CAGhH/T,gBAAgB,WACmB,IAArBgU,EAA8BA,EAAmB,OAAQ,KAAKppC,OAAOypC,MAEjFM,EAAQ,SAAeC,GACzB,OAAOjU,EAAQ7yB,IAAIimC,EAAZpT,CAAoBiU,IAGzBC,EAAgBlU,EAAQ+G,qBACxBvzB,EAAoD,mBAAhCwsB,EAAQgH,oBAAqChH,EAAQgH,oBAAoBoM,GAAUpT,EAAQgH,oBAGnH,GAAmB,MAAfhH,EAAQjzB,IAAa,CACvB,IAAIA,EAAMizB,EAAQjzB,IAMlB+mC,EAAcjN,GAAgB,CAC5B59B,IAAK8qC,EACL5mC,IAAK6mC,EACLjnC,IAPU,SAAeknC,EAAW5+B,GACpC,OAAOtI,EAAIqmC,EAAJrmC,CAAYknC,EAAW5+B,IAO9B0xB,qBAAsBmN,EACtBzG,2BAA4BzN,EAAQyN,2BACpCzG,oBAAqBxzB,SAGvBsgC,EAAcjN,GAAgB,CAC5B59B,IAAK8qC,EACL5mC,IAAK6mC,EACLjN,qBAAsBmN,EACtBzG,2BAA4BzN,EAAQyN,2BACpCzG,oBAAqBxzB,IAQzB,OAJAogC,EAAc7mC,IAAIqmC,EAAQU,GAC1BL,GAA2BK,EAAY7qC,KAAK,WAC1C2qC,EAAc7hC,OAAOqhC,MAEhBU,IAQPK,GAAmBR,GAAsB,CAC3C1qC,IAAK,aACLkE,IAAK,SAAa2Q,GAChB,OAAO,WACL,OAAOA,IAGXq1B,8BAA+B,CAC7B3O,SAAU,eAWd,IAAI4P,GAJJ,SAAuBt2B,GACrB,OAAOq2B,GAAiBr2B,IAKtBu2B,GAAmBV,GAAsB,CAC3C1qC,IAAK,UACLkE,IAAK,SAAazD,GAChB,OAAO,WACL,MAAM,IAAIC,MAAMD,KAGpBypC,8BAA+B,CAC7B3O,SAAU,eASd,IAAI8P,GAJJ,SAAuB5qC,GACrB,OAAO2qC,GAAiB3qC,IAsB1B,IAAI6qC,GALJ,SAA0BngB,GAExB,OAAOA,GAILogB,GAAsBzoC,EAAgBf,kBACtCypC,GAAwB1oC,EAAgBlB,oBACxC6pC,GAAsB3oC,EAAgBhB,kBAc1C,SAAS4pC,GAAmBhK,EAAgBn0B,GAC1C,IAIIo+B,EAJAC,EAAU1uC,MAAMqQ,EAAKzP,QAAQ+tC,UAAKpnC,GAClCqnC,EAAa5uC,MAAMqQ,EAAKzP,QAAQ+tC,UAAKpnC,GAErCsnC,EAAcnvC,EAA2B2Q,EAAK0B,WAGlD,IACE,IAAK88B,EAAY9tC,MAAO0tC,EAAUI,EAAYzuC,KAAKY,MAAO,CACxD,IAAI8tC,GAAgB,OAAeL,EAAQxtC,MAAO,GAC9CJ,EAAIiuC,EAAc,GAClBprB,EAAMorB,EAAc,GAExB,IACEJ,EAAQ7tC,GAAK2jC,EAAe9gB,GAC5B,MAAO7kB,GAEP+vC,EAAW/tC,GAAKhC,IAGpB,MAAOwC,GACPwtC,EAAYhwC,EAAEwC,GACd,QACAwtC,EAAY1tC,IAGd,MAAO,CAACutC,EAASE,GAGnB,SAASG,GAAQC,GACf,OAAc,MAAPA,IAAgB9rC,EAAiB8rC,GAG1C,SAASC,GAAmBC,GAC1B,OAAOlvC,MAAMC,QAAQivC,GAAgBA,EAAe7uC,OAAO8uC,oBAAoBD,GAAc3qC,KAAI,SAAUzB,GACzG,OAAOosC,EAAapsC,MAIxB,SAASssC,GAAkCrwC,GACzC,OAAc,MAAVA,GAAoC,iBAAXA,GAAuBA,EAAOswC,eAAe,WACjEtwC,EAAO4F,QAGT5F,EAGT,SAASuwC,GAAYJ,EAAcR,GACjC,OAAO1uC,MAAMC,QAAQivC,GAAgBR,EACrCruC,OAAO8uC,oBAAoBD,GAAc3S,QAAO,SAAU9jB,EAAK3V,EAAKysC,GAClE,OAAO7sC,EAAcA,EAAc,GAAI+V,GAAM,IAAI,OAAiB,GAAI3V,EAAK4rC,EAAQa,OAClF,IAGL,SAASC,GAAcN,EAAcR,EAASE,GAI5C,OAAOU,GAAYJ,EAHNN,EAAWrqC,KAAI,SAAUkrC,EAAWF,GAC/C,OAAoB,MAAbE,EAAoBlB,GAAoBG,EAAQa,IAAQrsC,EAAiBusC,GAAanB,GAAsBmB,GAAapB,GAAoBoB,OAsBxJ,IA4KIC,GAAiB,CACnBC,YA7KgBnC,GAAsB,CACtC1qC,IAAK,gBACLkE,IAAK,SAAakoC,GAChB,OAAO,SAAUU,GACf,IAIIC,EAAsBrB,GAJhBoB,EAAO5oC,IAENioC,GAAmBC,IAG1BY,GAAuB,OAAeD,EAAqB,GAC3DnB,EAAUoB,EAAqB,GAC/BlB,EAAakB,EAAqB,GAGtC,OAAON,GAAcN,EAAcR,EAASE,KAGhDtH,4BAA4B,IA6J5ByI,WAxJevC,GAAsB,CACrC1qC,IAAK,eACLkE,IAAK,SAAakoC,GAChB,OAAO,SAAUc,GACf,IAKIC,EAAuBzB,GALjBwB,EAAOhpC,IAGNioC,GAAmBC,IAG1BgB,GAAuB,OAAeD,EAAsB,GAC5DvB,EAAUwB,EAAqB,GAC/BtB,EAAasB,EAAqB,GAGtC,OAAItB,EAAW3oC,MAAK,SAAU+oC,GAC5B,OAAQ9rC,EAAiB8rC,MAElBQ,GAAcN,EAAcR,EAASE,GAMvC,IAAI1pC,SAAQ,SAAUC,GAC3B,IACIgrC,EADAC,EAAc1wC,EAA2BkvC,EAAW78B,WAGxD,IACE,IAAIs+B,EAAQ,WACV,IAAIC,GAAgB,OAAeH,EAAQlvC,MAAO,GAC9CJ,EAAIyvC,EAAc,GAClBtB,EAAMsB,EAAc,GAEpBptC,EAAiB8rC,IACnBA,EAAI5rC,MAAK,SAAUrE,GACjB2vC,EAAQ7tC,GAAKuuC,GAAkCrwC,GAC/C6vC,EAAW/tC,QAAK0G,EAChBpC,EAAQqqC,GAAcN,EAAcR,EAASE,OAC5C9pC,OAAM,SAAUM,GACjBwpC,EAAW/tC,GAAKuE,EAChBD,EAAQqqC,GAAcN,EAAcR,EAASE,QAKnD,IAAKwB,EAAYrvC,MAAOovC,EAAUC,EAAYhwC,KAAKY,MACjDqvC,IAEF,MAAOhvC,GACP+uC,EAAYvxC,EAAEwC,GACd,QACA+uC,EAAYjvC,UAKpBmmC,4BAA4B,IAgG5BiJ,WA5Fe/C,GAAsB,CACrC1qC,IAAK,eACLkE,IAAK,SAAakoC,GAChB,OAAO,SAAUsB,GACf,IAKIC,EAAuBjC,GALjBgC,EAAOxpC,IAGNioC,GAAmBC,IAG1BwB,GAAuB,OAAeD,EAAsB,GAC5D/B,EAAUgC,EAAqB,GAC/B9B,EAAa8B,EAAqB,GAGtC,GAAI9B,EAAW5oC,OAAM,SAAUgpC,GAC7B,OAAc,MAAPA,KAEP,OAAOM,GAAYJ,EAAcR,GAInC,IAAItpC,EAAQwpC,EAAW1oC,KAAK6oC,IAE5B,GAAa,MAAT3pC,EACF,MAAMA,EAIR,OAAOF,QAAQiB,IAAIyoC,GAAYxrC,MAAK,SAAUutC,GAC5C,OAAOrB,GAAYJ,GAlIiB0B,EAkIgClC,EAlInBmC,EAkI4BF,EAjI5EE,EAAatsC,KAAI,SAAUxF,EAAQwwC,GACxC,YAQahoC,IAAXxI,EAAuB6xC,EAAYrB,GAAOxwC,MAwHuDwF,IAAI6qC,KAlI3G,IAA4CwB,EAAaC,OAsIvDvJ,4BAA4B,IA2D5BwJ,kBAzDsBtD,GAAsB,CAC5C1qC,IAAK,sBACLkE,IAAK,SAAakoC,GAChB,OAAO,SAAU6B,GACf,IAKIC,EAAuBxC,GALjBuC,EAAO/pC,IAGNioC,GAAmBC,IAG1B+B,GAAuB,OAAeD,EAAsB,GAC5DtC,EAAUuC,EAAqB,GAC/BrC,EAAaqC,EAAqB,GAGtC,OAAIrC,EAAW5oC,OAAM,SAAUgpC,GAC7B,OAAQ9rC,EAAiB8rC,MAElBQ,GAAcN,EAAcR,EAASE,GAIvC1pC,QAAQiB,IAAIyoC,EAAWrqC,KAAI,SAAUyqC,EAAKnuC,GAC/C,OAAOqC,EAAiB8rC,GAAOA,EAAI5rC,MAAK,SAAUrE,GAChD2vC,EAAQ7tC,GAAKuuC,GAAkCrwC,GAC/C6vC,EAAW/tC,QAAK0G,KACfzC,OAAM,SAAUM,GACjBspC,EAAQ7tC,QAAK0G,EACbqnC,EAAW/tC,GAAKuE,KACb,SAENhC,MAAK,WACJ,OAAOosC,GAAcN,EAAcR,EAASE,QAIlDtH,4BAA4B,IAsB5B4J,OApBW1D,GAAsB,CACjC1qC,IAAK,WACLkE,IAAK,SAAamqC,GAChB,OAAO,SAAUC,GACf,IAAIpqC,EAAMoqC,EAAOpqC,IAEjB,IACE,OAAOunC,GAAoBvnC,EAAImqC,IAC/B,MAAO1B,GACP,OAAOvsC,EAAiBusC,GAAanB,GAAsBmB,GAAapB,GAAoBoB,MAIlGnI,4BAA4B,KAS1B+J,GAAiBn8B,GACjBo8B,GAAep8B,GACfq8B,GAAiBxmC,GAAYZ,aAC7BqnC,GAAe3iB,GACf4iB,GAAkBxnC,GAAqBL,cACvC8nC,GAAkBzlC,GAClB0lC,GAAkBloB,GAAkBN,cAoBpCyoB,GAAe,CAEjBznC,aAAconC,GAEdM,WAAYL,GACZM,yCAA0ClZ,GAE1C3K,KAAM4d,GACNkG,SAAUrR,GAEVsR,cAAeN,GAEfO,WAAYrF,GACZsF,eAAgB1E,GAChB2E,cAAelE,GACfmE,cAAejE,GACfkE,iBAAkBjE,GAElB/Z,eA9BqBwC,GA+BrBxD,uBA9B6BwD,GA+B7Byb,eApCqBzb,GAqCrB0b,uBApC6B1b,GAqC7BvC,kBA9BwBuC,GA+BxB2b,oBAjC0B3b,GAkC1B4b,+BAAgCla,GAChCjF,UAlCgBuD,GAoChB6b,kBA7CwB7b,GA8CxB8b,8BA1C2B9b,GA4C3B9B,sBAjD4B8B,GAkD5B+b,kBAhDwB/b,GAiDxBgc,sCA7CmChc,GA8CnCic,mCAvC2Cjc,GAwC3Ckc,qCAzCkClc,GA2ClCqa,OAzCaxB,GAAewB,OA0C5BvB,YAtCkBD,GAAeC,YAuCjCI,WAxCiBL,GAAeK,WAyChCQ,WA3CiBb,GAAea,WA4ChCO,kBA3CwBpB,GAAeoB,kBA6CvClnC,cAAe6nC,GAEfuB,aAAc3B,GACd4B,WAAY3B,GAEZ4B,kBAAmBvB,IAEjBwB,GAAiBvB,GAAaznC,aAC9BipC,GAAiBxB,GAAaC,WAC9BwB,GAAiBzB,GAAaE,yCAC9BwB,GAAiB1B,GAAa3jB,KAC9BslB,GAAiB3B,GAAaG,SAC9ByB,GAAiB5B,GAAaI,cAC9ByB,GAAiB7B,GAAaK,WAC9ByB,GAAiB9B,GAAaM,eAC9ByB,GAAiB/B,GAAaO,cAC9ByB,GAAkBhC,GAAaQ,cAC/ByB,GAAkBjC,GAAaS,iBAC/ByB,GAAkBlC,GAAavd,eAC/B0f,GAAkBnC,GAAave,uBAC/B2gB,GAAkBpC,GAAaU,eAC/B2B,GAAkBrC,GAAaW,uBAC/B2B,GAAkBtC,GAAatd,kBAC/B6f,GAAkBvC,GAAaY,oBAC/B4B,GAAkBxC,GAAaa,+BAC/B4B,GAAkBzC,GAAate,UAC/BghB,GAAkB1C,GAAac,kBAC/B6B,GAAkB3C,GAAae,8BAC/B6B,GAAkB5C,GAAa7c,sBAC/B0f,GAAkB7C,GAAagB,kBAC/B8B,GAAkB9C,GAAaiB,sCAC/B8B,GAAkB/C,GAAakB,mCAC/B8B,GAAkBhD,GAAamB,qCAC/B8B,GAAkBjD,GAAaV,OAC/B4D,GAAkBlD,GAAajC,YAC/BoF,GAAkBnD,GAAa7B,WAC/BiF,GAAkBpD,GAAarB,WAC/B0E,GAAkBrD,GAAad,kBAC/BoE,GAAkBtD,GAAahoC,cAC/BurC,GAAkBvD,GAAaoB,aAC/BoC,GAAkBxD,GAAaqB,WAC/BoC,GAAkBzD,GAAasB,kBACnC","sources":["webpack://love_and_peace/./node_modules/recoil/es/recoil.js"],"sourcesContent":["import _toArray from \"/codebuild/output/src3067982483/src/love-peace/node_modules/@babel/runtime/helpers/esm/toArray\";\nimport _toConsumableArray from \"/codebuild/output/src3067982483/src/love-peace/node_modules/@babel/runtime/helpers/esm/toConsumableArray\";\nimport _objectWithoutProperties from \"/codebuild/output/src3067982483/src/love-peace/node_modules/@babel/runtime/helpers/esm/objectWithoutProperties\";\nimport _assertThisInitialized from \"/codebuild/output/src3067982483/src/love-peace/node_modules/@babel/runtime/helpers/esm/assertThisInitialized\";\nimport _asyncToGenerator from \"/codebuild/output/src3067982483/src/love-peace/node_modules/@babel/runtime/helpers/esm/asyncToGenerator\";\nimport _createClass from \"/codebuild/output/src3067982483/src/love-peace/node_modules/@babel/runtime/helpers/esm/createClass\";\nimport _slicedToArray from \"/codebuild/output/src3067982483/src/love-peace/node_modules/@babel/runtime/helpers/esm/slicedToArray\";\nimport _wrapNativeSuper from \"/codebuild/output/src3067982483/src/love-peace/node_modules/@babel/runtime/helpers/esm/wrapNativeSuper\";\nimport _inherits from \"/codebuild/output/src3067982483/src/love-peace/node_modules/@babel/runtime/helpers/esm/inherits\";\nimport _possibleConstructorReturn from \"/codebuild/output/src3067982483/src/love-peace/node_modules/@babel/runtime/helpers/esm/possibleConstructorReturn\";\nimport _getPrototypeOf from \"/codebuild/output/src3067982483/src/love-peace/node_modules/@babel/runtime/helpers/esm/getPrototypeOf\";\nimport _defineProperty2 from \"/codebuild/output/src3067982483/src/love-peace/node_modules/@babel/runtime/helpers/esm/defineProperty\";\nimport _classCallCheck from \"/codebuild/output/src3067982483/src/love-peace/node_modules/@babel/runtime/helpers/esm/classCallCheck\";\nvar _excluded = [\"override\"],\n    _excluded2 = [\"default\"],\n    _excluded3 = [\"cachePolicyForParams_UNSTABLE\"];\nimport \"core-js/modules/es.promise.finally.js\";\n\nfunction _createSuper(Derived) { var hasNativeReflectConstruct = _isNativeReflectConstruct(); return function _createSuperInternal() { var Super = _getPrototypeOf(Derived), result; if (hasNativeReflectConstruct) { var NewTarget = _getPrototypeOf(this).constructor; result = Reflect.construct(Super, arguments, NewTarget); } else { result = Super.apply(this, arguments); } return _possibleConstructorReturn(this, result); }; }\n\nfunction _isNativeReflectConstruct() { if (typeof Reflect === \"undefined\" || !Reflect.construct) return false; if (Reflect.construct.sham) return false; if (typeof Proxy === \"function\") return true; try { Boolean.prototype.valueOf.call(Reflect.construct(Boolean, [], function () {})); return true; } catch (e) { return false; } }\n\nimport _regeneratorRuntime from \"/codebuild/output/src3067982483/src/love-peace/node_modules/@babel/runtime/regenerator\";\n\nvar _marked = /*#__PURE__*/_regeneratorRuntime.mark(filterIterable),\n    _marked2 = /*#__PURE__*/_regeneratorRuntime.mark(concatIterables);\n\nfunction _createForOfIteratorHelper(o, allowArrayLike) { var it = typeof Symbol !== \"undefined\" && o[Symbol.iterator] || o[\"@@iterator\"]; if (!it) { if (Array.isArray(o) || (it = _unsupportedIterableToArray(o)) || allowArrayLike && o && typeof o.length === \"number\") { if (it) o = it; var i = 0; var F = function F() {}; return { s: F, n: function n() { if (i >= o.length) return { done: true }; return { done: false, value: o[i++] }; }, e: function e(_e) { throw _e; }, f: F }; } throw new TypeError(\"Invalid attempt to iterate non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.\"); } var normalCompletion = true, didErr = false, err; return { s: function s() { it = it.call(o); }, n: function n() { var step = it.next(); normalCompletion = step.done; return step; }, e: function e(_e2) { didErr = true; err = _e2; }, f: function f() { try { if (!normalCompletion && it.return != null) it.return(); } finally { if (didErr) throw err; } } }; }\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 ownKeys(object, enumerableOnly) { var keys = Object.keys(object); if (Object.getOwnPropertySymbols) { var symbols = Object.getOwnPropertySymbols(object); if (enumerableOnly) { symbols = symbols.filter(function (sym) { return Object.getOwnPropertyDescriptor(object, sym).enumerable; }); } keys.push.apply(keys, symbols); } return keys; }\n\nfunction _objectSpread(target) { for (var i = 1; i < arguments.length; i++) { var source = arguments[i] != null ? arguments[i] : {}; if (i % 2) { ownKeys(Object(source), true).forEach(function (key) { _defineProperty2(target, key, source[key]); }); } else if (Object.getOwnPropertyDescriptors) { Object.defineProperties(target, Object.getOwnPropertyDescriptors(source)); } else { ownKeys(Object(source)).forEach(function (key) { Object.defineProperty(target, key, Object.getOwnPropertyDescriptor(source, key)); }); } } return target; }\n\nimport react from 'react';\nimport reactDom from 'react-dom';\n/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @emails oncall+recoil\n * \n * @format\n */\n// Split declaration and implementation to allow this function to pretend to\n// check for actual instance of Promise instead of something with a `then`\n// method.\n// eslint-disable-next-line no-redeclare\n\nfunction isPromise(p) {\n  return !!p && typeof p.then === 'function';\n}\n\nvar Recoil_isPromise = isPromise;\n/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @emails oncall+recoil\n * \n * @format\n */\n\nfunction nullthrows(x, message) {\n  if (x != null) {\n    return x;\n  }\n\n  throw new Error(message !== null && message !== void 0 ? message : 'Got unexpected null or undefined');\n}\n\nvar Recoil_nullthrows = nullthrows; // TODO Convert Loadable to a Class to allow for runtime type detection.\n// Containing static factories of withValue(), withError(), withPromise(), and all()\n\nvar Canceled = function Canceled() {\n  _classCallCheck(this, Canceled);\n};\n\nvar CANCELED = new Canceled();\nvar loadableAccessors = {\n  valueMaybe: function valueMaybe() {\n    return undefined;\n  },\n  valueOrThrow: function valueOrThrow() {\n    var error = new Error( // $FlowFixMe[object-this-reference]\n    \"Loadable expected value, but in \\\"\".concat(this.state, \"\\\" state\")); // V8 keeps closures alive until stack is accessed, this prevents a memory leak\n\n    throw error;\n  },\n  errorMaybe: function errorMaybe() {\n    return undefined;\n  },\n  errorOrThrow: function errorOrThrow() {\n    var error = new Error( // $FlowFixMe[object-this-reference]\n    \"Loadable expected error, but in \\\"\".concat(this.state, \"\\\" state\")); // V8 keeps closures alive until stack is accessed, this prevents a memory leak\n\n    throw error;\n  },\n  promiseMaybe: function promiseMaybe() {\n    return undefined;\n  },\n  promiseOrThrow: function promiseOrThrow() {\n    var error = new Error( // $FlowFixMe[object-this-reference]\n    \"Loadable expected promise, but in \\\"\".concat(this.state, \"\\\" state\")); // V8 keeps closures alive until stack is accessed, this prevents a memory leak\n\n    throw error;\n  },\n  is: function is(other) {\n    // $FlowFixMe[object-this-reference]\n    return other.state === this.state && other.contents === this.contents;\n  },\n  // TODO Convert Loadable to a Class to better support chaining\n  //      by returning a Loadable from a map function\n  map: function map(_map) {\n    var _this = this;\n\n    // $FlowFixMe[object-this-reference]\n    if (this.state === 'hasError') {\n      // $FlowFixMe[object-this-reference]\n      return this;\n    } // $FlowFixMe[object-this-reference]\n\n\n    if (this.state === 'hasValue') {\n      try {\n        // $FlowFixMe[object-this-reference]\n        var next = _map(this.contents); // TODO if next instanceof Loadable, then return next\n\n\n        return Recoil_isPromise(next) ? loadableWithPromise(next.then(function (value) {\n          return {\n            __value: value\n          };\n        })) : loadableWithValue(next);\n      } catch (e) {\n        return Recoil_isPromise(e) ? // If we \"suspended\", then try again.\n        // errors and subsequent retries will be handled in 'loading' case\n        // $FlowFixMe[object-this-reference]\n        loadableWithPromise(e.next(function () {\n          return _map(_this.contents);\n        })) : loadableWithError(e);\n      }\n    } // $FlowFixMe[object-this-reference]\n\n\n    if (this.state === 'loading') {\n      return loadableWithPromise( // $FlowFixMe[object-this-reference]\n      this.contents // TODO if map returns a loadable, then return the value or promise or throw the error\n      .then(function (value) {\n        return {\n          __value: _map(value.__value)\n        };\n      }).catch(function (e) {\n        if (Recoil_isPromise(e)) {\n          // we were \"suspended,\" try again\n          // $FlowFixMe[object-this-reference]\n          return e.then(function () {\n            return _map(_this.contents);\n          });\n        }\n\n        throw e;\n      }));\n    }\n\n    var error = new Error('Invalid Loadable state'); // V8 keeps closures alive until stack is accessed, this prevents a memory leak\n\n    throw error;\n  }\n};\n\nfunction loadableWithValue(value) {\n  // Build objects this way since Flow doesn't support disjoint unions for class properties\n  return Object.freeze(_objectSpread(_objectSpread({\n    state: 'hasValue',\n    contents: value\n  }, loadableAccessors), {}, {\n    getValue: function getValue() {\n      return this.contents;\n    },\n    toPromise: function toPromise() {\n      return Promise.resolve(this.contents);\n    },\n    valueMaybe: function valueMaybe() {\n      return this.contents;\n    },\n    valueOrThrow: function valueOrThrow() {\n      return this.contents;\n    }\n  }));\n}\n\nfunction loadableWithError(error) {\n  return Object.freeze(_objectSpread(_objectSpread({\n    state: 'hasError',\n    contents: error\n  }, loadableAccessors), {}, {\n    getValue: function getValue() {\n      throw this.contents;\n    },\n    toPromise: function toPromise() {\n      return Promise.reject(this.contents);\n    },\n    errorMaybe: function errorMaybe() {\n      return this.contents;\n    },\n    errorOrThrow: function errorOrThrow() {\n      return this.contents;\n    }\n  }));\n} // TODO Probably need to clean-up this API to accept `Promise<T>`\n// with an alternative params or mechanism for internal key proxy.\n\n\nfunction loadableWithPromise(promise) {\n  return Object.freeze(_objectSpread(_objectSpread({\n    state: 'loading',\n    contents: promise\n  }, loadableAccessors), {}, {\n    getValue: function getValue() {\n      throw this.contents.then(function (_ref2) {\n        var __value = _ref2.__value;\n        return __value;\n      });\n    },\n    toPromise: function toPromise() {\n      return this.contents.then(function (_ref3) {\n        var __value = _ref3.__value;\n        return __value;\n      });\n    },\n    promiseMaybe: function promiseMaybe() {\n      return this.contents.then(function (_ref4) {\n        var __value = _ref4.__value;\n        return __value;\n      });\n    },\n    promiseOrThrow: function promiseOrThrow() {\n      return this.contents.then(function (_ref5) {\n        var __value = _ref5.__value;\n        return __value;\n      });\n    }\n  }));\n}\n\nfunction loadableLoading() {\n  return loadableWithPromise(new Promise(function () {}));\n}\n\nfunction loadableAll(inputs) {\n  return inputs.every(function (i) {\n    return i.state === 'hasValue';\n  }) ? loadableWithValue(inputs.map(function (i) {\n    return i.contents;\n  })) : inputs.some(function (i) {\n    return i.state === 'hasError';\n  }) ? loadableWithError(Recoil_nullthrows(inputs.find(function (i) {\n    return i.state === 'hasError';\n  }), 'Invalid loadable passed to loadableAll').contents) : loadableWithPromise(Promise.all(inputs.map(function (i) {\n    return i.contents;\n  })).then(function (value) {\n    return {\n      __value: value\n    };\n  }));\n}\n\nvar Recoil_Loadable = {\n  loadableWithValue: loadableWithValue,\n  loadableWithError: loadableWithError,\n  loadableWithPromise: loadableWithPromise,\n  loadableLoading: loadableLoading,\n  loadableAll: loadableAll,\n  Canceled: Canceled,\n  CANCELED: CANCELED\n};\n\nvar _useMutableSource; // FIXME T2710559282599660\n\n\nvar useMutableSource = // flowlint-line unclear-type:off\n(_useMutableSource = react.useMutableSource) !== null && _useMutableSource !== void 0 ? _useMutableSource : react.unstable_useMutableSource; // flowlint-line unclear-type:off\n\nfunction mutableSourceExists() {\n  return useMutableSource && !(typeof window !== 'undefined' && window.$disableRecoilValueMutableSource_TEMP_HACK_DO_NOT_USE);\n}\n\nvar Recoil_mutableSource = {\n  mutableSourceExists: mutableSourceExists,\n  useMutableSource: useMutableSource\n};\nvar mutableSourceExists$1 = Recoil_mutableSource.mutableSourceExists;\nvar gks = new Map().set('recoil_hamt_2020', true).set('recoil_memory_managament_2020', true).set('recoil_suppress_rerender_in_callback', true);\n\nfunction Recoil_gkx(gk) {\n  var _gks$get;\n\n  if (gk === 'recoil_early_rendering_2021' && !mutableSourceExists$1()) {\n    return false;\n  }\n\n  return (_gks$get = gks.get(gk)) !== null && _gks$get !== void 0 ? _gks$get : false;\n}\n\nRecoil_gkx.setPass = function (gk) {\n  gks.set(gk, true);\n};\n\nRecoil_gkx.setFail = function (gk) {\n  gks.set(gk, false);\n};\n\nvar Recoil_gkx_1 = Recoil_gkx; // @oss-only\n\n/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @emails oncall+recoil\n * \n * @format\n */\n\nfunction recoverableViolation(message, projectName) {\n  var _ref6 = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : {},\n      error = _ref6.error;\n\n  if (process.env.NODE_ENV !== \"production\") {\n    console.error(message, error);\n  }\n\n  return null;\n}\n\nvar recoverableViolation_1 = recoverableViolation; // @oss-only\n\nvar Recoil_recoverableViolation = recoverableViolation_1;\n/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * Utilities for working with built-in Maps and Sets without mutating them.\n *\n * @emails oncall+recoil\n * \n * @format\n */\n\nfunction setByAddingToSet(set, v) {\n  var next = new Set(set);\n  next.add(v);\n  return next;\n}\n\nfunction setByDeletingFromSet(set, v) {\n  var next = new Set(set);\n  next.delete(v);\n  return next;\n}\n\nfunction mapBySettingInMap(map, k, v) {\n  var next = new Map(map);\n  next.set(k, v);\n  return next;\n}\n\nfunction mapByUpdatingInMap(map, k, updater) {\n  var next = new Map(map);\n  next.set(k, updater(next.get(k)));\n  return next;\n}\n\nfunction mapByDeletingFromMap(map, k) {\n  var next = new Map(map);\n  next.delete(k);\n  return next;\n}\n\nfunction mapByDeletingMultipleFromMap(map, ks) {\n  var next = new Map(map);\n  ks.forEach(function (k) {\n    return next.delete(k);\n  });\n  return next;\n}\n\nvar Recoil_CopyOnWrite = {\n  setByAddingToSet: setByAddingToSet,\n  setByDeletingFromSet: setByDeletingFromSet,\n  mapBySettingInMap: mapBySettingInMap,\n  mapByUpdatingInMap: mapByUpdatingInMap,\n  mapByDeletingFromMap: mapByDeletingFromMap,\n  mapByDeletingMultipleFromMap: mapByDeletingMultipleFromMap\n};\n/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @emails oncall+recoil\n * \n * @format\n */\n\n/**\n * Creates a new iterable whose output is generated by passing the input\n * iterable's values through the filter function.\n */\n\nfunction filterIterable(iterable, predicate) {\n  var index, _iterator, _step, value;\n\n  return _regeneratorRuntime.wrap(function filterIterable$(_context) {\n    while (1) {\n      switch (_context.prev = _context.next) {\n        case 0:\n          // Use generator to create iterable/iterator\n          index = 0;\n          _iterator = _createForOfIteratorHelper(iterable);\n          _context.prev = 2;\n\n          _iterator.s();\n\n        case 4:\n          if ((_step = _iterator.n()).done) {\n            _context.next = 11;\n            break;\n          }\n\n          value = _step.value;\n\n          if (!predicate(value, index++)) {\n            _context.next = 9;\n            break;\n          }\n\n          _context.next = 9;\n          return value;\n\n        case 9:\n          _context.next = 4;\n          break;\n\n        case 11:\n          _context.next = 16;\n          break;\n\n        case 13:\n          _context.prev = 13;\n          _context.t0 = _context[\"catch\"](2);\n\n          _iterator.e(_context.t0);\n\n        case 16:\n          _context.prev = 16;\n\n          _iterator.f();\n\n          return _context.finish(16);\n\n        case 19:\n        case \"end\":\n          return _context.stop();\n      }\n    }\n  }, _marked, null, [[2, 13, 16, 19]]);\n}\n\nvar Recoil_filterIterable = filterIterable;\n/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @emails oncall+recoil\n * \n * @format\n */\n\n/**\n * Creates a new iterable whose output is generated by passing the input\n * iterable's values through the mapper function.\n */\n\nfunction mapIterable(iterable, callback) {\n  // Use generator to create iterable/iterator\n  return /*#__PURE__*/_regeneratorRuntime.mark(function _callee() {\n    var index, _iterator2, _step2, value;\n\n    return _regeneratorRuntime.wrap(function _callee$(_context2) {\n      while (1) {\n        switch (_context2.prev = _context2.next) {\n          case 0:\n            index = 0;\n            _iterator2 = _createForOfIteratorHelper(iterable);\n            _context2.prev = 2;\n\n            _iterator2.s();\n\n          case 4:\n            if ((_step2 = _iterator2.n()).done) {\n              _context2.next = 10;\n              break;\n            }\n\n            value = _step2.value;\n            _context2.next = 8;\n            return callback(value, index++);\n\n          case 8:\n            _context2.next = 4;\n            break;\n\n          case 10:\n            _context2.next = 15;\n            break;\n\n          case 12:\n            _context2.prev = 12;\n            _context2.t0 = _context2[\"catch\"](2);\n\n            _iterator2.e(_context2.t0);\n\n          case 15:\n            _context2.prev = 15;\n\n            _iterator2.f();\n\n            return _context2.finish(15);\n\n          case 18:\n          case \"end\":\n            return _context2.stop();\n        }\n      }\n    }, _callee, null, [[2, 12, 15, 18]]);\n  })();\n}\n\nvar Recoil_mapIterable = mapIterable;\n/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @emails oncall+recoil\n * \n * @format\n */\n\nfunction sprintf(format) {\n  for (var _len = arguments.length, args = new Array(_len > 1 ? _len - 1 : 0), _key = 1; _key < _len; _key++) {\n    args[_key - 1] = arguments[_key];\n  }\n\n  var index = 0;\n  return format.replace(/%s/g, function () {\n    return String(args[index++]);\n  });\n}\n\nvar sprintf_1 = sprintf;\n\nfunction expectationViolation(format) {\n  if (process.env.NODE_ENV !== \"production\") {\n    for (var _len2 = arguments.length, args = new Array(_len2 > 1 ? _len2 - 1 : 0), _key2 = 1; _key2 < _len2; _key2++) {\n      args[_key2 - 1] = arguments[_key2];\n    }\n\n    var message = sprintf_1.call.apply(sprintf_1, [null, format].concat(args));\n    var error = new Error(message);\n    error.name = 'Expectation Violation';\n    console.error(error);\n  }\n}\n\nvar expectationViolation_1 = expectationViolation; // @oss-only\n\nvar Recoil_expectationViolation = expectationViolation_1;\n\nfunction _defineProperty(obj, key, value) {\n  if (key in obj) {\n    Object.defineProperty(obj, key, {\n      value: value,\n      enumerable: true,\n      configurable: true,\n      writable: true\n    });\n  } else {\n    obj[key] = value;\n  }\n\n  return obj;\n}\n/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @emails oncall+recoil\n * \n * @format\n */\n// eslint-disable-next-line no-unused-vars\n\n\nvar AbstractRecoilValue = function AbstractRecoilValue(newKey) {\n  _classCallCheck(this, AbstractRecoilValue);\n\n  _defineProperty(this, \"key\", void 0);\n\n  this.key = newKey;\n};\n\nvar RecoilState = /*#__PURE__*/function (_AbstractRecoilValue) {\n  _inherits(RecoilState, _AbstractRecoilValue);\n\n  var _super = _createSuper(RecoilState);\n\n  function RecoilState() {\n    _classCallCheck(this, RecoilState);\n\n    return _super.apply(this, arguments);\n  }\n\n  return RecoilState;\n}(AbstractRecoilValue);\n\nvar RecoilValueReadOnly = /*#__PURE__*/function (_AbstractRecoilValue2) {\n  _inherits(RecoilValueReadOnly, _AbstractRecoilValue2);\n\n  var _super2 = _createSuper(RecoilValueReadOnly);\n\n  function RecoilValueReadOnly() {\n    _classCallCheck(this, RecoilValueReadOnly);\n\n    return _super2.apply(this, arguments);\n  }\n\n  return RecoilValueReadOnly;\n}(AbstractRecoilValue);\n\nfunction isRecoilValue(x) {\n  return x instanceof RecoilState || x instanceof RecoilValueReadOnly;\n}\n\nvar Recoil_RecoilValue = {\n  AbstractRecoilValue: AbstractRecoilValue,\n  RecoilState: RecoilState,\n  RecoilValueReadOnly: RecoilValueReadOnly,\n  isRecoilValue: isRecoilValue\n};\nvar Recoil_RecoilValue_1 = Recoil_RecoilValue.AbstractRecoilValue;\nvar Recoil_RecoilValue_2 = Recoil_RecoilValue.RecoilState;\nvar Recoil_RecoilValue_3 = Recoil_RecoilValue.RecoilValueReadOnly;\nvar Recoil_RecoilValue_4 = Recoil_RecoilValue.isRecoilValue;\nvar Recoil_RecoilValue$1 = /*#__PURE__*/Object.freeze({\n  __proto__: null,\n  AbstractRecoilValue: Recoil_RecoilValue_1,\n  RecoilState: Recoil_RecoilValue_2,\n  RecoilValueReadOnly: Recoil_RecoilValue_3,\n  isRecoilValue: Recoil_RecoilValue_4\n});\n\nvar DefaultValue = function DefaultValue() {\n  _classCallCheck(this, DefaultValue);\n};\n\nvar DEFAULT_VALUE = new DefaultValue();\n\nvar RecoilValueNotReady = /*#__PURE__*/function (_Error) {\n  _inherits(RecoilValueNotReady, _Error);\n\n  var _super3 = _createSuper(RecoilValueNotReady);\n\n  function RecoilValueNotReady(key) {\n    _classCallCheck(this, RecoilValueNotReady);\n\n    return _super3.call(this, \"Tried to set the value of Recoil selector \".concat(key, \" using an updater function, but it is an async selector in a pending or error state; this is not supported.\"));\n  }\n\n  return RecoilValueNotReady;\n}( /*#__PURE__*/_wrapNativeSuper(Error)); // flowlint-next-line unclear-type:off\n\n\nvar nodes = new Map(); // flowlint-next-line unclear-type:off\n\nvar recoilValues = new Map();\n/* eslint-disable no-redeclare */\n\nfunction recoilValuesForKeys(keys) {\n  return Recoil_mapIterable(keys, function (key) {\n    return Recoil_nullthrows(recoilValues.get(key));\n  });\n}\n\nfunction registerNode(node) {\n  if (nodes.has(node.key)) {\n    var message = \"Duplicate atom key \\\"\".concat(node.key, \"\\\". This is a FATAL ERROR in\\n      production. But it is safe to ignore this warning if it occurred because of\\n      hot module replacement.\"); // TODO Need to figure out if there is a standard/open-source equivalent to see if hot module replacement is happening:\n    // prettier-ignore\n    // @fb-only: if (__DEV__) {\n    // @fb-only: const isAcceptingUpdate = require('__debug').isAcceptingUpdate;\n    // prettier-ignore\n    // @fb-only: if (typeof isAcceptingUpdate !== 'function' || !isAcceptingUpdate()) {\n    // @fb-only: expectationViolation(message, 'recoil');\n    // @fb-only: }\n    // prettier-ignore\n    // @fb-only: } else {\n    // @fb-only: recoverableViolation(message, 'recoil');\n    // @fb-only: }\n\n    console.warn(message); // @oss-only\n  }\n\n  nodes.set(node.key, node);\n  var recoilValue = node.set == null ? new Recoil_RecoilValue$1.RecoilValueReadOnly(node.key) : new Recoil_RecoilValue$1.RecoilState(node.key);\n  recoilValues.set(node.key, recoilValue);\n  return recoilValue;\n}\n/* eslint-enable no-redeclare */\n\n\nvar NodeMissingError = /*#__PURE__*/function (_Error2) {\n  _inherits(NodeMissingError, _Error2);\n\n  var _super4 = _createSuper(NodeMissingError);\n\n  function NodeMissingError() {\n    _classCallCheck(this, NodeMissingError);\n\n    return _super4.apply(this, arguments);\n  }\n\n  return NodeMissingError;\n}( /*#__PURE__*/_wrapNativeSuper(Error)); // flowlint-next-line unclear-type:off\n\n\nfunction getNode(key) {\n  var node = nodes.get(key);\n\n  if (node == null) {\n    throw new NodeMissingError(\"Missing definition for RecoilValue: \\\"\".concat(key, \"\\\"\\\"\"));\n  }\n\n  return node;\n} // flowlint-next-line unclear-type:off\n\n\nfunction getNodeMaybe(key) {\n  return nodes.get(key);\n}\n\nvar configDeletionHandlers = new Map();\n\nfunction deleteNodeConfigIfPossible(key) {\n  var _node$shouldDeleteCon;\n\n  if (!Recoil_gkx_1('recoil_memory_managament_2020')) {\n    return;\n  }\n\n  var node = nodes.get(key);\n\n  if (node === null || node === void 0 ? void 0 : (_node$shouldDeleteCon = node.shouldDeleteConfigOnRelease) === null || _node$shouldDeleteCon === void 0 ? void 0 : _node$shouldDeleteCon.call(node)) {\n    var _getConfigDeletionHan;\n\n    nodes.delete(key);\n    (_getConfigDeletionHan = getConfigDeletionHandler(key)) === null || _getConfigDeletionHan === void 0 ? void 0 : _getConfigDeletionHan();\n    configDeletionHandlers.delete(key);\n  }\n}\n\nfunction setConfigDeletionHandler(key, fn) {\n  if (!Recoil_gkx_1('recoil_memory_managament_2020')) {\n    return;\n  }\n\n  if (fn === undefined) {\n    configDeletionHandlers.delete(key);\n  } else {\n    configDeletionHandlers.set(key, fn);\n  }\n}\n\nfunction getConfigDeletionHandler(key) {\n  return configDeletionHandlers.get(key);\n}\n\nvar Recoil_Node = {\n  nodes: nodes,\n  recoilValues: recoilValues,\n  registerNode: registerNode,\n  getNode: getNode,\n  getNodeMaybe: getNodeMaybe,\n  deleteNodeConfigIfPossible: deleteNodeConfigIfPossible,\n  setConfigDeletionHandler: setConfigDeletionHandler,\n  getConfigDeletionHandler: getConfigDeletionHandler,\n  recoilValuesForKeys: recoilValuesForKeys,\n  NodeMissingError: NodeMissingError,\n  DefaultValue: DefaultValue,\n  DEFAULT_VALUE: DEFAULT_VALUE,\n  RecoilValueNotReady: RecoilValueNotReady\n};\n/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @emails oncall+recoil\n * \n * @format\n */\n\nvar RetentionZone = function RetentionZone() {\n  _classCallCheck(this, RetentionZone);\n};\n\nfunction retentionZone() {\n  return new RetentionZone();\n}\n\nvar Recoil_RetentionZone = {\n  RetentionZone: RetentionZone,\n  retentionZone: retentionZone\n};\nvar setByAddingToSet$1 = Recoil_CopyOnWrite.setByAddingToSet;\nvar getNode$1 = Recoil_Node.getNode,\n    getNodeMaybe$1 = Recoil_Node.getNodeMaybe,\n    recoilValuesForKeys$1 = Recoil_Node.recoilValuesForKeys;\nvar RetentionZone$1 = Recoil_RetentionZone.RetentionZone; // flowlint-next-line unclear-type:off\n\nvar emptySet = Object.freeze(new Set());\n\nvar ReadOnlyRecoilValueError = /*#__PURE__*/function (_Error3) {\n  _inherits(ReadOnlyRecoilValueError, _Error3);\n\n  var _super5 = _createSuper(ReadOnlyRecoilValueError);\n\n  function ReadOnlyRecoilValueError() {\n    _classCallCheck(this, ReadOnlyRecoilValueError);\n\n    return _super5.apply(this, arguments);\n  }\n\n  return ReadOnlyRecoilValueError;\n}( /*#__PURE__*/_wrapNativeSuper(Error));\n\nfunction initializeRetentionForNode(store, nodeKey, retainedBy) {\n  if (!Recoil_gkx_1('recoil_memory_managament_2020')) {\n    return function () {\n      return undefined;\n    };\n  }\n\n  var nodesRetainedByZone = store.getState().retention.nodesRetainedByZone;\n\n  function addToZone(zone) {\n    var set = nodesRetainedByZone.get(zone);\n\n    if (!set) {\n      nodesRetainedByZone.set(zone, set = new Set());\n    }\n\n    set.add(nodeKey);\n  }\n\n  if (retainedBy instanceof RetentionZone$1) {\n    addToZone(retainedBy);\n  } else if (Array.isArray(retainedBy)) {\n    var _iterator3 = _createForOfIteratorHelper(retainedBy),\n        _step3;\n\n    try {\n      for (_iterator3.s(); !(_step3 = _iterator3.n()).done;) {\n        var zone = _step3.value;\n        addToZone(zone);\n      }\n    } catch (err) {\n      _iterator3.e(err);\n    } finally {\n      _iterator3.f();\n    }\n  }\n\n  return function () {\n    if (!Recoil_gkx_1('recoil_memory_managament_2020')) {\n      return;\n    }\n\n    var nodesRetainedByZone = store.getState().retention.nodesRetainedByZone;\n\n    function deleteFromZone(zone) {\n      var set = nodesRetainedByZone.get(zone);\n\n      if (set) {\n        set.delete(nodeKey);\n      }\n\n      if (set && set.size === 0) {\n        nodesRetainedByZone.delete(zone);\n      }\n    }\n\n    if (retainedBy instanceof RetentionZone$1) {\n      deleteFromZone(retainedBy);\n    } else if (Array.isArray(retainedBy)) {\n      var _iterator4 = _createForOfIteratorHelper(retainedBy),\n          _step4;\n\n      try {\n        for (_iterator4.s(); !(_step4 = _iterator4.n()).done;) {\n          var _zone = _step4.value;\n          deleteFromZone(_zone);\n        }\n      } catch (err) {\n        _iterator4.e(err);\n      } finally {\n        _iterator4.f();\n      }\n    }\n  };\n}\n\nfunction initializeNodeIfNewToStore(store, treeState, key, trigger) {\n  var storeState = store.getState();\n\n  if (storeState.nodeCleanupFunctions.has(key)) {\n    return;\n  }\n\n  var config = getNode$1(key);\n  var retentionCleanup = initializeRetentionForNode(store, key, config.retainedBy);\n  var nodeCleanup = config.init(store, treeState, trigger);\n  storeState.nodeCleanupFunctions.set(key, function () {\n    nodeCleanup();\n    retentionCleanup();\n  });\n}\n\nfunction cleanUpNode(store, key) {\n  var _state$nodeCleanupFun;\n\n  var state = store.getState();\n  (_state$nodeCleanupFun = state.nodeCleanupFunctions.get(key)) === null || _state$nodeCleanupFun === void 0 ? void 0 : _state$nodeCleanupFun();\n  state.nodeCleanupFunctions.delete(key);\n} // Get the current value loadable of a node and update the state.\n// Update dependencies and subscriptions for selectors.\n// Update saved value validation for atoms.\n\n\nfunction getNodeLoadable(store, state, key) {\n  initializeNodeIfNewToStore(store, state, key, 'get');\n  return getNode$1(key).get(store, state);\n} // Peek at the current value loadable for a node without any evaluation or state change\n\n\nfunction peekNodeLoadable(store, state, key) {\n  return getNode$1(key).peek(store, state);\n} // Write value directly to state bypassing the Node interface as the node\n// definitions may not have been loaded yet when processing the initial snapshot.\n\n\nfunction setUnvalidatedAtomValue_DEPRECATED(state, key, newValue) {\n  var _node$invalidate;\n\n  var node = getNodeMaybe$1(key);\n  node === null || node === void 0 ? void 0 : (_node$invalidate = node.invalidate) === null || _node$invalidate === void 0 ? void 0 : _node$invalidate.call(node, state);\n  return _objectSpread(_objectSpread({}, state), {}, {\n    atomValues: state.atomValues.clone().delete(key),\n    nonvalidatedAtoms: state.nonvalidatedAtoms.clone().set(key, newValue),\n    dirtyAtoms: setByAddingToSet$1(state.dirtyAtoms, key)\n  });\n} // Return the discovered dependencies and values to be written by setting\n// a node value. (Multiple values may be written due to selectors getting to\n// set upstreams; deps may be discovered because of reads in updater functions.)\n\n\nfunction setNodeValue(store, state, key, newValue) {\n  var node = getNode$1(key);\n\n  if (node.set == null) {\n    throw new ReadOnlyRecoilValueError(\"Attempt to set read-only RecoilValue: \".concat(key));\n  }\n\n  var set = node.set; // so flow doesn't lose the above refinement.\n\n  initializeNodeIfNewToStore(store, state, key, 'set');\n  return set(store, state, newValue);\n}\n\nfunction peekNodeInfo(store, state, key) {\n  var _graph$nodeDeps$get, _storeState$nodeToCom, _storeState$nodeToCom2;\n\n  var storeState = store.getState();\n  var graph = store.getGraph(state.version);\n  var type = storeState.knownAtoms.has(key) ? 'atom' : storeState.knownSelectors.has(key) ? 'selector' : undefined;\n  var downstreamNodes = Recoil_filterIterable(getDownstreamNodes(store, state, new Set([key])), function (nodeKey) {\n    return nodeKey !== key;\n  });\n  return {\n    loadable: peekNodeLoadable(store, state, key),\n    isActive: storeState.knownAtoms.has(key) || storeState.knownSelectors.has(key),\n    isSet: type === 'selector' ? false : state.atomValues.has(key),\n    isModified: state.dirtyAtoms.has(key),\n    type: type,\n    // Report current dependencies.  If the node hasn't been evaluated, then\n    // dependencies may be missing based on the current state.\n    deps: recoilValuesForKeys$1((_graph$nodeDeps$get = graph.nodeDeps.get(key)) !== null && _graph$nodeDeps$get !== void 0 ? _graph$nodeDeps$get : []),\n    // Reportsall \"current\" subscribers.  Evaluating other nodes or\n    // previous in-progress async evaluations may introduce new subscribers.\n    subscribers: {\n      nodes: recoilValuesForKeys$1(downstreamNodes),\n      components: Recoil_mapIterable((_storeState$nodeToCom = (_storeState$nodeToCom2 = storeState.nodeToComponentSubscriptions.get(key)) === null || _storeState$nodeToCom2 === void 0 ? void 0 : _storeState$nodeToCom2.values()) !== null && _storeState$nodeToCom !== void 0 ? _storeState$nodeToCom : [], function (_ref7) {\n        var _ref8 = _slicedToArray(_ref7, 1),\n            name = _ref8[0];\n\n        return {\n          name: name\n        };\n      })\n    }\n  };\n} // Find all of the recursively dependent nodes\n\n\nfunction getDownstreamNodes(store, state, keys) {\n  var visitedNodes = new Set();\n  var visitingNodes = Array.from(keys);\n  var graph = store.getGraph(state.version);\n\n  for (var key = visitingNodes.pop(); key; key = visitingNodes.pop()) {\n    var _graph$nodeToNodeSubs;\n\n    visitedNodes.add(key);\n    var subscribedNodes = (_graph$nodeToNodeSubs = graph.nodeToNodeSubscriptions.get(key)) !== null && _graph$nodeToNodeSubs !== void 0 ? _graph$nodeToNodeSubs : emptySet;\n\n    var _iterator5 = _createForOfIteratorHelper(subscribedNodes),\n        _step5;\n\n    try {\n      for (_iterator5.s(); !(_step5 = _iterator5.n()).done;) {\n        var downstreamNode = _step5.value;\n\n        if (!visitedNodes.has(downstreamNode)) {\n          visitingNodes.push(downstreamNode);\n        }\n      }\n    } catch (err) {\n      _iterator5.e(err);\n    } finally {\n      _iterator5.f();\n    }\n  }\n\n  return visitedNodes;\n}\n\nvar Recoil_FunctionalCore = {\n  getNodeLoadable: getNodeLoadable,\n  peekNodeLoadable: peekNodeLoadable,\n  setNodeValue: setNodeValue,\n  cleanUpNode: cleanUpNode,\n  setUnvalidatedAtomValue_DEPRECATED: setUnvalidatedAtomValue_DEPRECATED,\n  peekNodeInfo: peekNodeInfo,\n  getDownstreamNodes: getDownstreamNodes,\n  initializeNodeIfNewToStore: initializeNodeIfNewToStore\n};\nvar CANCELED$1 = Recoil_Loadable.CANCELED;\nvar getDownstreamNodes$1 = Recoil_FunctionalCore.getDownstreamNodes,\n    getNodeLoadable$1 = Recoil_FunctionalCore.getNodeLoadable,\n    setNodeValue$1 = Recoil_FunctionalCore.setNodeValue;\nvar getNodeMaybe$2 = Recoil_Node.getNodeMaybe;\nvar DefaultValue$1 = Recoil_Node.DefaultValue,\n    RecoilValueNotReady$1 = Recoil_Node.RecoilValueNotReady;\nvar AbstractRecoilValue$1 = Recoil_RecoilValue$1.AbstractRecoilValue,\n    RecoilState$1 = Recoil_RecoilValue$1.RecoilState,\n    RecoilValueReadOnly$1 = Recoil_RecoilValue$1.RecoilValueReadOnly,\n    isRecoilValue$1 = Recoil_RecoilValue$1.isRecoilValue;\n\nfunction getRecoilValueAsLoadable(store, _ref9) {\n  var key = _ref9.key;\n  var treeState = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : store.getState().currentTree;\n\n  var _storeState$nextTree, _storeState$previousT; // Reading from an older tree can cause bugs because the dependencies that we\n  // discover during the read are lost.\n\n\n  var storeState = store.getState();\n\n  if (!(treeState.version === storeState.currentTree.version || treeState.version === ((_storeState$nextTree = storeState.nextTree) === null || _storeState$nextTree === void 0 ? void 0 : _storeState$nextTree.version) || treeState.version === ((_storeState$previousT = storeState.previousTree) === null || _storeState$previousT === void 0 ? void 0 : _storeState$previousT.version))) {\n    Recoil_recoverableViolation('Tried to read from a discarded tree');\n  }\n\n  var loadable = getNodeLoadable$1(store, treeState, key);\n\n  if (loadable.state === 'loading') {\n    loadable.contents.catch(function () {\n      /**\n       * HACK: intercept thrown error here to prevent an uncaught promise exception. Ideally this would happen closer to selector\n       * execution (perhaps introducing a new ERROR class to be resolved by async selectors that are in an error state)\n       */\n      return CANCELED$1;\n    });\n  }\n\n  return loadable;\n}\n\nfunction applyAtomValueWrites(atomValues, writes) {\n  var result = atomValues.clone();\n  writes.forEach(function (v, k) {\n    if (v.state === 'hasValue' && v.contents instanceof DefaultValue$1) {\n      result.delete(k);\n    } else {\n      result.set(k, v);\n    }\n  });\n  return result;\n}\n\nfunction valueFromValueOrUpdater(store, state, _ref10, valueOrUpdater) {\n  var key = _ref10.key;\n\n  if (typeof valueOrUpdater === 'function') {\n    // Updater form: pass in the current value. Throw if the current value\n    // is unavailable (namely when updating an async selector that's\n    // pending or errored):\n    var current = getNodeLoadable$1(store, state, key);\n\n    if (current.state === 'loading') {\n      throw new RecoilValueNotReady$1(key);\n    } else if (current.state === 'hasError') {\n      throw current.contents;\n    } // T itself may be a function, so our refinement is not sufficient:\n\n\n    return valueOrUpdater(current.contents); // flowlint-line unclear-type:off\n  } else {\n    return valueOrUpdater;\n  }\n}\n\nfunction applyAction(store, state, action) {\n  if (action.type === 'set') {\n    var recoilValue = action.recoilValue,\n        valueOrUpdater = action.valueOrUpdater;\n    var newValue = valueFromValueOrUpdater(store, state, recoilValue, valueOrUpdater);\n    var writes = setNodeValue$1(store, state, recoilValue.key, newValue);\n\n    var _iterator6 = _createForOfIteratorHelper(writes.entries()),\n        _step6;\n\n    try {\n      for (_iterator6.s(); !(_step6 = _iterator6.n()).done;) {\n        var _step6$value = _slicedToArray(_step6.value, 2),\n            key = _step6$value[0],\n            loadable = _step6$value[1];\n\n        writeLoadableToTreeState(state, key, loadable);\n      }\n    } catch (err) {\n      _iterator6.e(err);\n    } finally {\n      _iterator6.f();\n    }\n  } else if (action.type === 'setLoadable') {\n    var _key3 = action.recoilValue.key,\n        _loadable = action.loadable;\n    writeLoadableToTreeState(state, _key3, _loadable);\n  } else if (action.type === 'markModified') {\n    var _key4 = action.recoilValue.key;\n    state.dirtyAtoms.add(_key4);\n  } else if (action.type === 'setUnvalidated') {\n    var _node$invalidate; // Write value directly to state bypassing the Node interface as the node\n    // definitions may not have been loaded yet when processing the initial snapshot.\n\n\n    var _key5 = action.recoilValue.key,\n        unvalidatedValue = action.unvalidatedValue;\n    var node = getNodeMaybe$2(_key5);\n    node === null || node === void 0 ? void 0 : (_node$invalidate = node.invalidate) === null || _node$invalidate === void 0 ? void 0 : _node$invalidate.call(node, state);\n    state.atomValues.delete(_key5);\n    state.nonvalidatedAtoms.set(_key5, unvalidatedValue);\n    state.dirtyAtoms.add(_key5);\n  } else {\n    Recoil_recoverableViolation(\"Unknown action \".concat(action.type));\n  }\n}\n\nfunction writeLoadableToTreeState(state, key, loadable) {\n  if (loadable.state === 'hasValue' && loadable.contents instanceof DefaultValue$1) {\n    state.atomValues.delete(key);\n  } else {\n    state.atomValues.set(key, loadable);\n  }\n\n  state.dirtyAtoms.add(key);\n  state.nonvalidatedAtoms.delete(key);\n}\n\nfunction applyActionsToStore(store, actions) {\n  store.replaceState(function (state) {\n    var newState = copyTreeState(state);\n\n    var _iterator7 = _createForOfIteratorHelper(actions),\n        _step7;\n\n    try {\n      for (_iterator7.s(); !(_step7 = _iterator7.n()).done;) {\n        var action = _step7.value;\n        applyAction(store, newState, action);\n      }\n    } catch (err) {\n      _iterator7.e(err);\n    } finally {\n      _iterator7.f();\n    }\n\n    invalidateDownstreams(store, newState);\n    return newState;\n  });\n}\n\nfunction queueOrPerformStateUpdate(store, action) {\n  if (batchStack.length) {\n    var actionsByStore = batchStack[batchStack.length - 1];\n    var actions = actionsByStore.get(store);\n\n    if (!actions) {\n      actionsByStore.set(store, actions = []);\n    }\n\n    actions.push(action);\n  } else {\n    applyActionsToStore(store, [action]);\n  }\n}\n\nvar batchStack = [];\n\nfunction batchStart() {\n  var actionsByStore = new Map();\n  batchStack.push(actionsByStore);\n  return function () {\n    var _iterator8 = _createForOfIteratorHelper(actionsByStore),\n        _step8;\n\n    try {\n      for (_iterator8.s(); !(_step8 = _iterator8.n()).done;) {\n        var _step8$value = _slicedToArray(_step8.value, 2),\n            store = _step8$value[0],\n            actions = _step8$value[1];\n\n        applyActionsToStore(store, actions);\n      }\n    } catch (err) {\n      _iterator8.e(err);\n    } finally {\n      _iterator8.f();\n    }\n\n    var popped = batchStack.pop();\n\n    if (popped !== actionsByStore) {\n      Recoil_recoverableViolation('Incorrect order of batch popping');\n    }\n  };\n}\n\nfunction copyTreeState(state) {\n  return _objectSpread(_objectSpread({}, state), {}, {\n    atomValues: state.atomValues.clone(),\n    nonvalidatedAtoms: state.nonvalidatedAtoms.clone(),\n    dirtyAtoms: new Set(state.dirtyAtoms)\n  });\n}\n\nfunction invalidateDownstreams(store, state) {\n  // Inform any nodes that were changed or downstream of changes so that they\n  // can clear out any caches as needed due to the update:\n  var downstreams = getDownstreamNodes$1(store, state, state.dirtyAtoms);\n\n  var _iterator9 = _createForOfIteratorHelper(downstreams),\n      _step9;\n\n  try {\n    for (_iterator9.s(); !(_step9 = _iterator9.n()).done;) {\n      var key = _step9.value;\n\n      var _getNodeMaybe, _getNodeMaybe$invalid;\n\n      (_getNodeMaybe = getNodeMaybe$2(key)) === null || _getNodeMaybe === void 0 ? void 0 : (_getNodeMaybe$invalid = _getNodeMaybe.invalidate) === null || _getNodeMaybe$invalid === void 0 ? void 0 : _getNodeMaybe$invalid.call(_getNodeMaybe, state);\n    }\n  } catch (err) {\n    _iterator9.e(err);\n  } finally {\n    _iterator9.f();\n  }\n}\n\nfunction setRecoilValue(store, recoilValue, valueOrUpdater) {\n  queueOrPerformStateUpdate(store, {\n    type: 'set',\n    recoilValue: recoilValue,\n    valueOrUpdater: valueOrUpdater\n  });\n}\n\nfunction setRecoilValueLoadable(store, recoilValue, loadable) {\n  if (loadable instanceof DefaultValue$1) {\n    return setRecoilValue(store, recoilValue, loadable);\n  }\n\n  queueOrPerformStateUpdate(store, {\n    type: 'setLoadable',\n    recoilValue: recoilValue,\n    loadable: loadable\n  });\n}\n\nfunction markRecoilValueModified(store, recoilValue) {\n  queueOrPerformStateUpdate(store, {\n    type: 'markModified',\n    recoilValue: recoilValue\n  });\n}\n\nfunction setUnvalidatedRecoilValue(store, recoilValue, unvalidatedValue) {\n  queueOrPerformStateUpdate(store, {\n    type: 'setUnvalidated',\n    recoilValue: recoilValue,\n    unvalidatedValue: unvalidatedValue\n  });\n}\n\nvar subscriptionID = 0;\n\nfunction subscribeToRecoilValue(store, _ref11, callback) {\n  var key = _ref11.key;\n  var componentDebugName = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : null;\n  var subID = subscriptionID++;\n  var storeState = store.getState();\n\n  if (!storeState.nodeToComponentSubscriptions.has(key)) {\n    storeState.nodeToComponentSubscriptions.set(key, new Map());\n  }\n\n  Recoil_nullthrows(storeState.nodeToComponentSubscriptions.get(key)).set(subID, [componentDebugName !== null && componentDebugName !== void 0 ? componentDebugName : '<not captured>', callback]); // Handle the case that, during the same tick that we are subscribing, an atom\n  // has been updated by some effect handler. Otherwise we will miss the update.\n\n  if (Recoil_gkx_1('recoil_early_rendering_2021')) {\n    var nextTree = store.getState().nextTree;\n\n    if (nextTree && nextTree.dirtyAtoms.has(key)) {\n      callback(nextTree);\n    }\n  }\n\n  return {\n    release: function release() {\n      var storeState = store.getState();\n      var subs = storeState.nodeToComponentSubscriptions.get(key);\n\n      if (subs === undefined || !subs.has(subID)) {\n        Recoil_recoverableViolation(\"Subscription missing at release time for atom \".concat(key, \". This is a bug in Recoil.\"));\n        return;\n      }\n\n      subs.delete(subID);\n\n      if (subs.size === 0) {\n        storeState.nodeToComponentSubscriptions.delete(key);\n      }\n    }\n  };\n}\n\nvar Recoil_RecoilValueInterface = {\n  RecoilValueReadOnly: RecoilValueReadOnly$1,\n  AbstractRecoilValue: AbstractRecoilValue$1,\n  RecoilState: RecoilState$1,\n  getRecoilValueAsLoadable: getRecoilValueAsLoadable,\n  setRecoilValue: setRecoilValue,\n  setRecoilValueLoadable: setRecoilValueLoadable,\n  markRecoilValueModified: markRecoilValueModified,\n  setUnvalidatedRecoilValue: setUnvalidatedRecoilValue,\n  subscribeToRecoilValue: subscribeToRecoilValue,\n  isRecoilValue: isRecoilValue$1,\n  applyAtomValueWrites: applyAtomValueWrites,\n  // TODO Remove export when deprecating initialStoreState_DEPRECATED in RecoilRoot\n  batchStart: batchStart,\n  writeLoadableToTreeState: writeLoadableToTreeState,\n  invalidateDownstreams: invalidateDownstreams,\n  copyTreeState: copyTreeState,\n  invalidateDownstreams_FOR_TESTING: invalidateDownstreams\n};\n/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @emails oncall+recoil\n * \n * @format\n *\n * This is to export esstiential functions from react-dom\n * for our web build\n */\n\nvar unstable_batchedUpdates = reactDom.unstable_batchedUpdates;\nvar ReactBatchedUpdates = {\n  unstable_batchedUpdates: unstable_batchedUpdates\n};\n/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @emails oncall+recoil\n * \n * @format\n *\n * This is to export esstiential functions from react-dom\n * for our web build\n */\n// @fb-only: const {unstable_batchedUpdates} = require('ReactDOMComet');\n\nvar unstable_batchedUpdates$1 = ReactBatchedUpdates.unstable_batchedUpdates; // @oss-only\n\nvar Recoil_ReactBatchedUpdates = {\n  unstable_batchedUpdates: unstable_batchedUpdates$1\n};\n/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @emails oncall+recoil\n * \n * @format\n */\n\nvar batchStart$1 = Recoil_RecoilValueInterface.batchStart;\nvar unstable_batchedUpdates$2 = Recoil_ReactBatchedUpdates.unstable_batchedUpdates;\nvar batcher = unstable_batchedUpdates$2; // flowlint-next-line unclear-type:off\n\n/**\n * Sets the provided batcher function as the batcher function used by Recoil.\n *\n * Set the batcher to a custom batcher for your renderer,\n * if you use a renderer other than React DOM or React Native.\n */\n\nvar setBatcher = function setBatcher(newBatcher) {\n  batcher = newBatcher;\n};\n/**\n * Returns the current batcher function.\n */\n\n\nvar getBatcher = function getBatcher() {\n  return batcher;\n};\n/**\n * Calls the current batcher function and passes the\n * provided callback function.\n */\n\n\nvar batchUpdates = function batchUpdates(callback) {\n  batcher(function () {\n    var batchEnd = function batchEnd() {\n      return undefined;\n    };\n\n    try {\n      batchEnd = batchStart$1();\n      callback();\n    } finally {\n      batchEnd();\n    }\n  });\n};\n\nvar Recoil_Batching = {\n  getBatcher: getBatcher,\n  setBatcher: setBatcher,\n  batchUpdates: batchUpdates\n};\n/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @emails oncall+recoil\n * \n * @format\n */\n\nfunction enqueueExecution(s, f) {\n  f();\n}\n\nvar Recoil_Queue = {\n  enqueueExecution: enqueueExecution\n};\n/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @emails oncall+recoil\n * \n * @format\n */\n\n/**\n * Returns a set containing all of the values from the first set that are not\n * present in any of the subsequent sets.\n *\n * Note: this is written procedurally (i.e., without filterSet) for performant\n * use in tight loops.\n */\n\nfunction differenceSets(set) {\n  var ret = new Set();\n\n  for (var _len3 = arguments.length, setsWithValuesToRemove = new Array(_len3 > 1 ? _len3 - 1 : 0), _key6 = 1; _key6 < _len3; _key6++) {\n    setsWithValuesToRemove[_key6 - 1] = arguments[_key6];\n  }\n\n  var _iterator10 = _createForOfIteratorHelper(set),\n      _step10;\n\n  try {\n    FIRST: for (_iterator10.s(); !(_step10 = _iterator10.n()).done;) {\n      var value = _step10.value;\n\n      var _iterator11 = _createForOfIteratorHelper(setsWithValuesToRemove),\n          _step11;\n\n      try {\n        for (_iterator11.s(); !(_step11 = _iterator11.n()).done;) {\n          var otherSet = _step11.value;\n\n          if (otherSet.has(value)) {\n            continue FIRST;\n          }\n        }\n      } catch (err) {\n        _iterator11.e(err);\n      } finally {\n        _iterator11.f();\n      }\n\n      ret.add(value);\n    }\n  } catch (err) {\n    _iterator10.e(err);\n  } finally {\n    _iterator10.f();\n  }\n\n  return ret;\n}\n\nvar Recoil_differenceSets = differenceSets;\n/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @emails oncall+recoil\n * \n * @format\n */\n\n/**\n * Returns a new Map object with the same keys as the original, but with the\n * values replaced with the output of the given callback function.\n */\n\nfunction mapMap(map, callback) {\n  var result = new Map();\n  map.forEach(function (value, key) {\n    result.set(key, callback(value, key));\n  });\n  return result;\n}\n\nvar Recoil_mapMap = mapMap;\n\nfunction graph() {\n  return {\n    nodeDeps: new Map(),\n    nodeToNodeSubscriptions: new Map()\n  };\n}\n\nfunction cloneGraph(graph) {\n  return {\n    nodeDeps: Recoil_mapMap(graph.nodeDeps, function (s) {\n      return new Set(s);\n    }),\n    nodeToNodeSubscriptions: Recoil_mapMap(graph.nodeToNodeSubscriptions, function (s) {\n      return new Set(s);\n    })\n  };\n} // Note that this overwrites the deps of existing nodes, rather than unioning\n// the new deps with the old deps.\n\n\nfunction mergeDependencyMapIntoGraph(deps, graph, // If olderGraph is given then we will not overwrite changes made to the given\n// graph compared with olderGraph:\nolderGraph) {\n  var nodeDeps = graph.nodeDeps,\n      nodeToNodeSubscriptions = graph.nodeToNodeSubscriptions;\n  deps.forEach(function (upstreams, downstream) {\n    var existingUpstreams = nodeDeps.get(downstream);\n\n    if (existingUpstreams && olderGraph && existingUpstreams !== olderGraph.nodeDeps.get(downstream)) {\n      return;\n    } // Update nodeDeps:\n\n\n    nodeDeps.set(downstream, new Set(upstreams)); // Add new deps to nodeToNodeSubscriptions:\n\n    var addedUpstreams = existingUpstreams == null ? upstreams : Recoil_differenceSets(upstreams, existingUpstreams);\n    addedUpstreams.forEach(function (upstream) {\n      if (!nodeToNodeSubscriptions.has(upstream)) {\n        nodeToNodeSubscriptions.set(upstream, new Set());\n      }\n\n      var existing = Recoil_nullthrows(nodeToNodeSubscriptions.get(upstream));\n      existing.add(downstream);\n    }); // Remove removed deps from nodeToNodeSubscriptions:\n\n    if (existingUpstreams) {\n      var removedUpstreams = Recoil_differenceSets(existingUpstreams, upstreams);\n      removedUpstreams.forEach(function (upstream) {\n        if (!nodeToNodeSubscriptions.has(upstream)) {\n          return;\n        }\n\n        var existing = Recoil_nullthrows(nodeToNodeSubscriptions.get(upstream));\n        existing.delete(downstream);\n\n        if (existing.size === 0) {\n          nodeToNodeSubscriptions.delete(upstream);\n        }\n      });\n    }\n  });\n}\n\nfunction saveDependencyMapToStore(dependencyMap, store, version) {\n  var _storeState$nextTree, _storeState$previousT, _storeState$previousT2, _storeState$previousT3;\n\n  var storeState = store.getState();\n\n  if (!(version === storeState.currentTree.version || version === ((_storeState$nextTree = storeState.nextTree) === null || _storeState$nextTree === void 0 ? void 0 : _storeState$nextTree.version) || version === ((_storeState$previousT = storeState.previousTree) === null || _storeState$previousT === void 0 ? void 0 : _storeState$previousT.version))) {\n    Recoil_recoverableViolation('Tried to save dependencies to a discarded tree');\n  } // Merge the dependencies discovered into the store's dependency map\n  // for the version that was read:\n\n\n  var graph = store.getGraph(version);\n  mergeDependencyMapIntoGraph(dependencyMap, graph); // If this version is not the latest version, also write these dependencies\n  // into later versions if they don't already have their own:\n\n  if (version === ((_storeState$previousT2 = storeState.previousTree) === null || _storeState$previousT2 === void 0 ? void 0 : _storeState$previousT2.version)) {\n    var currentGraph = store.getGraph(storeState.currentTree.version);\n    mergeDependencyMapIntoGraph(dependencyMap, currentGraph, graph);\n  }\n\n  if (version === ((_storeState$previousT3 = storeState.previousTree) === null || _storeState$previousT3 === void 0 ? void 0 : _storeState$previousT3.version) || version === storeState.currentTree.version) {\n    var _storeState$nextTree2;\n\n    var nextVersion = (_storeState$nextTree2 = storeState.nextTree) === null || _storeState$nextTree2 === void 0 ? void 0 : _storeState$nextTree2.version;\n\n    if (nextVersion !== undefined) {\n      var nextGraph = store.getGraph(nextVersion);\n      mergeDependencyMapIntoGraph(dependencyMap, nextGraph, graph);\n    }\n  }\n}\n\nfunction mergeDepsIntoDependencyMap(from, into) {\n  from.forEach(function (upstreamDeps, downstreamNode) {\n    if (!into.has(downstreamNode)) {\n      into.set(downstreamNode, new Set());\n    }\n\n    var deps = Recoil_nullthrows(into.get(downstreamNode));\n    upstreamDeps.forEach(function (dep) {\n      return deps.add(dep);\n    });\n  });\n}\n\nfunction addToDependencyMap(downstream, upstream, dependencyMap) {\n  if (!dependencyMap.has(downstream)) {\n    dependencyMap.set(downstream, new Set());\n  }\n\n  Recoil_nullthrows(dependencyMap.get(downstream)).add(upstream);\n}\n\nvar Recoil_Graph = {\n  addToDependencyMap: addToDependencyMap,\n  cloneGraph: cloneGraph,\n  graph: graph,\n  mergeDepsIntoDependencyMap: mergeDepsIntoDependencyMap,\n  saveDependencyMapToStore: saveDependencyMapToStore\n};\n\nfunction createCommonjsModule(fn, module) {\n  return module = {\n    exports: {}\n  }, fn(module, module.exports), module.exports;\n}\n\nvar hamt_1 = createCommonjsModule(function (module) {\n  var _typeof = typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\" ? function (obj) {\n    return typeof obj;\n  } : function (obj) {\n    return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj;\n  };\n  /**\n      @fileOverview Hash Array Mapped Trie.\n  \n      Code based on: https://github.com/exclipy/pdata\n  */\n\n\n  var hamt = {}; // export\n\n  /* Configuration\n   ******************************************************************************/\n\n  var SIZE = 5;\n  var BUCKET_SIZE = Math.pow(2, SIZE);\n  var MASK = BUCKET_SIZE - 1;\n  var MAX_INDEX_NODE = BUCKET_SIZE / 2;\n  var MIN_ARRAY_NODE = BUCKET_SIZE / 4;\n  /*\n   ******************************************************************************/\n\n  var nothing = {};\n\n  var constant = function constant(x) {\n    return function () {\n      return x;\n    };\n  };\n  /**\n      Get 32 bit hash of string.\n  \n      Based on:\n      http://stackoverflow.com/questions/7616461/generate-a-hash-from-string-in-javascript-jquery\n  */\n\n\n  var hash = hamt.hash = function (str) {\n    var type = typeof str === 'undefined' ? 'undefined' : _typeof(str);\n    if (type === 'number') return str;\n    if (type !== 'string') str += '';\n    var hash = 0;\n\n    for (var i = 0, len = str.length; i < len; ++i) {\n      var c = str.charCodeAt(i);\n      hash = (hash << 5) - hash + c | 0;\n    }\n\n    return hash;\n  };\n  /* Bit Ops\n   ******************************************************************************/\n\n  /**\n      Hamming weight.\n  \n      Taken from: http://jsperf.com/hamming-weight\n  */\n\n\n  var popcount = function popcount(x) {\n    x -= x >> 1 & 0x55555555;\n    x = (x & 0x33333333) + (x >> 2 & 0x33333333);\n    x = x + (x >> 4) & 0x0f0f0f0f;\n    x += x >> 8;\n    x += x >> 16;\n    return x & 0x7f;\n  };\n\n  var hashFragment = function hashFragment(shift, h) {\n    return h >>> shift & MASK;\n  };\n\n  var toBitmap = function toBitmap(x) {\n    return 1 << x;\n  };\n\n  var fromBitmap = function fromBitmap(bitmap, bit) {\n    return popcount(bitmap & bit - 1);\n  };\n  /* Array Ops\n   ******************************************************************************/\n\n  /**\n      Set a value in an array.\n  \n      @param mutate Should the input array be mutated?\n      @param at Index to change.\n      @param v New value\n      @param arr Array.\n  */\n\n\n  var arrayUpdate = function arrayUpdate(mutate, at, v, arr) {\n    var out = arr;\n\n    if (!mutate) {\n      var len = arr.length;\n      out = new Array(len);\n\n      for (var i = 0; i < len; ++i) {\n        out[i] = arr[i];\n      }\n    }\n\n    out[at] = v;\n    return out;\n  };\n  /**\n      Remove a value from an array.\n  \n      @param mutate Should the input array be mutated?\n      @param at Index to remove.\n      @param arr Array.\n  */\n\n\n  var arraySpliceOut = function arraySpliceOut(mutate, at, arr) {\n    var newLen = arr.length - 1;\n    var i = 0;\n    var g = 0;\n    var out = arr;\n\n    if (mutate) {\n      i = g = at;\n    } else {\n      out = new Array(newLen);\n\n      while (i < at) {\n        out[g++] = arr[i++];\n      }\n    }\n\n    ++i;\n\n    while (i <= newLen) {\n      out[g++] = arr[i++];\n    }\n\n    if (mutate) {\n      out.length = newLen;\n    }\n\n    return out;\n  };\n  /**\n      Insert a value into an array.\n  \n      @param mutate Should the input array be mutated?\n      @param at Index to insert at.\n      @param v Value to insert,\n      @param arr Array.\n  */\n\n\n  var arraySpliceIn = function arraySpliceIn(mutate, at, v, arr) {\n    var len = arr.length;\n\n    if (mutate) {\n      var _i = len;\n\n      while (_i >= at) {\n        arr[_i--] = arr[_i];\n      }\n\n      arr[at] = v;\n      return arr;\n    }\n\n    var i = 0,\n        g = 0;\n    var out = new Array(len + 1);\n\n    while (i < at) {\n      out[g++] = arr[i++];\n    }\n\n    out[at] = v;\n\n    while (i < len) {\n      out[++g] = arr[i++];\n    }\n\n    return out;\n  };\n  /* Node Structures\n   ******************************************************************************/\n\n\n  var LEAF = 1;\n  var COLLISION = 2;\n  var INDEX = 3;\n  var ARRAY = 4;\n  /**\n      Empty node.\n  */\n\n  var empty = {\n    __hamt_isEmpty: true\n  };\n\n  var isEmptyNode = function isEmptyNode(x) {\n    return x === empty || x && x.__hamt_isEmpty;\n  };\n  /**\n      Leaf holding a value.\n  \n      @member edit Edit of the node.\n      @member hash Hash of key.\n      @member key Key.\n      @member value Value stored.\n  */\n\n\n  var Leaf = function Leaf(edit, hash, key, value) {\n    return {\n      type: LEAF,\n      edit: edit,\n      hash: hash,\n      key: key,\n      value: value,\n      _modify: Leaf__modify\n    };\n  };\n  /**\n      Leaf holding multiple values with the same hash but different keys.\n  \n      @member edit Edit of the node.\n      @member hash Hash of key.\n      @member children Array of collision children node.\n  */\n\n\n  var Collision = function Collision(edit, hash, children) {\n    return {\n      type: COLLISION,\n      edit: edit,\n      hash: hash,\n      children: children,\n      _modify: Collision__modify\n    };\n  };\n  /**\n      Internal node with a sparse set of children.\n  \n      Uses a bitmap and array to pack children.\n  \n    @member edit Edit of the node.\n      @member mask Bitmap that encode the positions of children in the array.\n      @member children Array of child nodes.\n  */\n\n\n  var IndexedNode = function IndexedNode(edit, mask, children) {\n    return {\n      type: INDEX,\n      edit: edit,\n      mask: mask,\n      children: children,\n      _modify: IndexedNode__modify\n    };\n  };\n  /**\n      Internal node with many children.\n  \n      @member edit Edit of the node.\n      @member size Number of children.\n      @member children Array of child nodes.\n  */\n\n\n  var ArrayNode = function ArrayNode(edit, size, children) {\n    return {\n      type: ARRAY,\n      edit: edit,\n      size: size,\n      children: children,\n      _modify: ArrayNode__modify\n    };\n  };\n  /**\n      Is `node` a leaf node?\n  */\n\n\n  var isLeaf = function isLeaf(node) {\n    return node === empty || node.type === LEAF || node.type === COLLISION;\n  };\n  /* Internal node operations.\n   ******************************************************************************/\n\n  /**\n      Expand an indexed node into an array node.\n  \n    @param edit Current edit.\n      @param frag Index of added child.\n      @param child Added child.\n      @param mask Index node mask before child added.\n      @param subNodes Index node children before child added.\n  */\n\n\n  var expand = function expand(edit, frag, child, bitmap, subNodes) {\n    var arr = [];\n    var bit = bitmap;\n    var count = 0;\n\n    for (var i = 0; bit; ++i) {\n      if (bit & 1) arr[i] = subNodes[count++];\n      bit >>>= 1;\n    }\n\n    arr[frag] = child;\n    return ArrayNode(edit, count + 1, arr);\n  };\n  /**\n      Collapse an array node into a indexed node.\n  \n    @param edit Current edit.\n      @param count Number of elements in new array.\n      @param removed Index of removed element.\n      @param elements Array node children before remove.\n  */\n\n\n  var pack = function pack(edit, count, removed, elements) {\n    var children = new Array(count - 1);\n    var g = 0;\n    var bitmap = 0;\n\n    for (var i = 0, len = elements.length; i < len; ++i) {\n      if (i !== removed) {\n        var elem = elements[i];\n\n        if (elem && !isEmptyNode(elem)) {\n          children[g++] = elem;\n          bitmap |= 1 << i;\n        }\n      }\n    }\n\n    return IndexedNode(edit, bitmap, children);\n  };\n  /**\n      Merge two leaf nodes.\n  \n      @param shift Current shift.\n      @param h1 Node 1 hash.\n      @param n1 Node 1.\n      @param h2 Node 2 hash.\n      @param n2 Node 2.\n  */\n\n\n  var mergeLeaves = function mergeLeaves(edit, shift, h1, n1, h2, n2) {\n    if (h1 === h2) return Collision(edit, h1, [n2, n1]);\n    var subH1 = hashFragment(shift, h1);\n    var subH2 = hashFragment(shift, h2);\n    return IndexedNode(edit, toBitmap(subH1) | toBitmap(subH2), subH1 === subH2 ? [mergeLeaves(edit, shift + SIZE, h1, n1, h2, n2)] : subH1 < subH2 ? [n1, n2] : [n2, n1]);\n  };\n  /**\n      Update an entry in a collision list.\n  \n      @param mutate Should mutation be used?\n      @param edit Current edit.\n      @param keyEq Key compare function.\n      @param hash Hash of collision.\n      @param list Collision list.\n      @param f Update function.\n      @param k Key to update.\n      @param size Size ref.\n  */\n\n\n  var updateCollisionList = function updateCollisionList(mutate, edit, keyEq, h, list, f, k, size) {\n    var len = list.length;\n\n    for (var i = 0; i < len; ++i) {\n      var child = list[i];\n\n      if (keyEq(k, child.key)) {\n        var value = child.value;\n\n        var _newValue = f(value);\n\n        if (_newValue === value) return list;\n\n        if (_newValue === nothing) {\n          --size.value;\n          return arraySpliceOut(mutate, i, list);\n        }\n\n        return arrayUpdate(mutate, i, Leaf(edit, h, k, _newValue), list);\n      }\n    }\n\n    var newValue = f();\n    if (newValue === nothing) return list;\n    ++size.value;\n    return arrayUpdate(mutate, len, Leaf(edit, h, k, newValue), list);\n  };\n\n  var canEditNode = function canEditNode(edit, node) {\n    return edit === node.edit;\n  };\n  /* Editing\n   ******************************************************************************/\n\n\n  var Leaf__modify = function Leaf__modify(edit, keyEq, shift, f, h, k, size) {\n    if (keyEq(k, this.key)) {\n      var _v = f(this.value);\n\n      if (_v === this.value) return this;else if (_v === nothing) {\n        --size.value;\n        return empty;\n      }\n\n      if (canEditNode(edit, this)) {\n        this.value = _v;\n        return this;\n      }\n\n      return Leaf(edit, h, k, _v);\n    }\n\n    var v = f();\n    if (v === nothing) return this;\n    ++size.value;\n    return mergeLeaves(edit, shift, this.hash, this, h, Leaf(edit, h, k, v));\n  };\n\n  var Collision__modify = function Collision__modify(edit, keyEq, shift, f, h, k, size) {\n    if (h === this.hash) {\n      var canEdit = canEditNode(edit, this);\n      var list = updateCollisionList(canEdit, edit, keyEq, this.hash, this.children, f, k, size);\n      if (list === this.children) return this;\n      return list.length > 1 ? Collision(edit, this.hash, list) : list[0]; // collapse single element collision list\n    }\n\n    var v = f();\n    if (v === nothing) return this;\n    ++size.value;\n    return mergeLeaves(edit, shift, this.hash, this, h, Leaf(edit, h, k, v));\n  };\n\n  var IndexedNode__modify = function IndexedNode__modify(edit, keyEq, shift, f, h, k, size) {\n    var mask = this.mask;\n    var children = this.children;\n    var frag = hashFragment(shift, h);\n    var bit = toBitmap(frag);\n    var indx = fromBitmap(mask, bit);\n    var exists = mask & bit;\n    var current = exists ? children[indx] : empty;\n\n    var child = current._modify(edit, keyEq, shift + SIZE, f, h, k, size);\n\n    if (current === child) return this;\n    var canEdit = canEditNode(edit, this);\n    var bitmap = mask;\n    var newChildren = void 0;\n\n    if (exists && isEmptyNode(child)) {\n      // remove\n      bitmap &= ~bit;\n      if (!bitmap) return empty;\n      if (children.length <= 2 && isLeaf(children[indx ^ 1])) return children[indx ^ 1]; // collapse\n\n      newChildren = arraySpliceOut(canEdit, indx, children);\n    } else if (!exists && !isEmptyNode(child)) {\n      // add\n      if (children.length >= MAX_INDEX_NODE) return expand(edit, frag, child, mask, children);\n      bitmap |= bit;\n      newChildren = arraySpliceIn(canEdit, indx, child, children);\n    } else {\n      // modify\n      newChildren = arrayUpdate(canEdit, indx, child, children);\n    }\n\n    if (canEdit) {\n      this.mask = bitmap;\n      this.children = newChildren;\n      return this;\n    }\n\n    return IndexedNode(edit, bitmap, newChildren);\n  };\n\n  var ArrayNode__modify = function ArrayNode__modify(edit, keyEq, shift, f, h, k, size) {\n    var count = this.size;\n    var children = this.children;\n    var frag = hashFragment(shift, h);\n    var child = children[frag];\n\n    var newChild = (child || empty)._modify(edit, keyEq, shift + SIZE, f, h, k, size);\n\n    if (child === newChild) return this;\n    var canEdit = canEditNode(edit, this);\n    var newChildren = void 0;\n\n    if (isEmptyNode(child) && !isEmptyNode(newChild)) {\n      // add\n      ++count;\n      newChildren = arrayUpdate(canEdit, frag, newChild, children);\n    } else if (!isEmptyNode(child) && isEmptyNode(newChild)) {\n      // remove\n      --count;\n      if (count <= MIN_ARRAY_NODE) return pack(edit, count, frag, children);\n      newChildren = arrayUpdate(canEdit, frag, empty, children);\n    } else {\n      // modify\n      newChildren = arrayUpdate(canEdit, frag, newChild, children);\n    }\n\n    if (canEdit) {\n      this.size = count;\n      this.children = newChildren;\n      return this;\n    }\n\n    return ArrayNode(edit, count, newChildren);\n  };\n\n  empty._modify = function (edit, keyEq, shift, f, h, k, size) {\n    var v = f();\n    if (v === nothing) return empty;\n    ++size.value;\n    return Leaf(edit, h, k, v);\n  };\n  /*\n   ******************************************************************************/\n\n\n  function Map(editable, edit, config, root, size) {\n    this._editable = editable;\n    this._edit = edit;\n    this._config = config;\n    this._root = root;\n    this._size = size;\n  }\n\n  Map.prototype.setTree = function (newRoot, newSize) {\n    if (this._editable) {\n      this._root = newRoot;\n      this._size = newSize;\n      return this;\n    }\n\n    return newRoot === this._root ? this : new Map(this._editable, this._edit, this._config, newRoot, newSize);\n  };\n  /* Queries\n   ******************************************************************************/\n\n  /**\n      Lookup the value for `key` in `map` using a custom `hash`.\n  \n      Returns the value or `alt` if none.\n  */\n\n\n  var tryGetHash = hamt.tryGetHash = function (alt, hash, key, map) {\n    var node = map._root;\n    var shift = 0;\n    var keyEq = map._config.keyEq;\n\n    while (true) {\n      switch (node.type) {\n        case LEAF:\n          {\n            return keyEq(key, node.key) ? node.value : alt;\n          }\n\n        case COLLISION:\n          {\n            if (hash === node.hash) {\n              var children = node.children;\n\n              for (var i = 0, len = children.length; i < len; ++i) {\n                var child = children[i];\n                if (keyEq(key, child.key)) return child.value;\n              }\n            }\n\n            return alt;\n          }\n\n        case INDEX:\n          {\n            var frag = hashFragment(shift, hash);\n            var bit = toBitmap(frag);\n\n            if (node.mask & bit) {\n              node = node.children[fromBitmap(node.mask, bit)];\n              shift += SIZE;\n              break;\n            }\n\n            return alt;\n          }\n\n        case ARRAY:\n          {\n            node = node.children[hashFragment(shift, hash)];\n\n            if (node) {\n              shift += SIZE;\n              break;\n            }\n\n            return alt;\n          }\n\n        default:\n          return alt;\n      }\n    }\n  };\n\n  Map.prototype.tryGetHash = function (alt, hash, key) {\n    return tryGetHash(alt, hash, key, this);\n  };\n  /**\n      Lookup the value for `key` in `map` using internal hash function.\n  \n      @see `tryGetHash`\n  */\n\n\n  var tryGet = hamt.tryGet = function (alt, key, map) {\n    return tryGetHash(alt, map._config.hash(key), key, map);\n  };\n\n  Map.prototype.tryGet = function (alt, key) {\n    return tryGet(alt, key, this);\n  };\n  /**\n      Lookup the value for `key` in `map` using a custom `hash`.\n  \n      Returns the value or `undefined` if none.\n  */\n\n\n  var getHash = hamt.getHash = function (hash, key, map) {\n    return tryGetHash(undefined, hash, key, map);\n  };\n\n  Map.prototype.getHash = function (hash, key) {\n    return getHash(hash, key, this);\n  };\n  /**\n      Lookup the value for `key` in `map` using internal hash function.\n  \n      @see `get`\n  */\n\n\n  var get = hamt.get = function (key, map) {\n    return tryGetHash(undefined, map._config.hash(key), key, map);\n  };\n\n  Map.prototype.get = function (key, alt) {\n    return tryGet(alt, key, this);\n  };\n  /**\n      Does an entry exist for `key` in `map`? Uses custom `hash`.\n  */\n\n\n  var hasHash = hamt.has = function (hash, key, map) {\n    return tryGetHash(nothing, hash, key, map) !== nothing;\n  };\n\n  Map.prototype.hasHash = function (hash, key) {\n    return hasHash(hash, key, this);\n  };\n  /**\n      Does an entry exist for `key` in `map`? Uses internal hash function.\n  */\n\n\n  var has = hamt.has = function (key, map) {\n    return hasHash(map._config.hash(key), key, map);\n  };\n\n  Map.prototype.has = function (key) {\n    return has(key, this);\n  };\n\n  var defKeyCompare = function defKeyCompare(x, y) {\n    return x === y;\n  };\n  /**\n      Create an empty map.\n  \n      @param config Configuration.\n  */\n\n\n  hamt.make = function (config) {\n    return new Map(0, 0, {\n      keyEq: config && config.keyEq || defKeyCompare,\n      hash: config && config.hash || hash\n    }, empty, 0);\n  };\n  /**\n      Empty map.\n  */\n\n\n  hamt.empty = hamt.make();\n  /**\n      Does `map` contain any elements?\n  */\n\n  var isEmpty = hamt.isEmpty = function (map) {\n    return map && !!isEmptyNode(map._root);\n  };\n\n  Map.prototype.isEmpty = function () {\n    return isEmpty(this);\n  };\n  /* Updates\n   ******************************************************************************/\n\n  /**\n      Alter the value stored for `key` in `map` using function `f` using\n      custom hash.\n  \n      `f` is invoked with the current value for `k` if it exists,\n      or no arguments if no such value exists. `modify` will always either\n      update or insert a value into the map.\n  \n      Returns a map with the modified value. Does not alter `map`.\n  */\n\n\n  var modifyHash = hamt.modifyHash = function (f, hash, key, map) {\n    var size = {\n      value: map._size\n    };\n\n    var newRoot = map._root._modify(map._editable ? map._edit : NaN, map._config.keyEq, 0, f, hash, key, size);\n\n    return map.setTree(newRoot, size.value);\n  };\n\n  Map.prototype.modifyHash = function (hash, key, f) {\n    return modifyHash(f, hash, key, this);\n  };\n  /**\n      Alter the value stored for `key` in `map` using function `f` using\n      internal hash function.\n  \n      @see `modifyHash`\n  */\n\n\n  var modify = hamt.modify = function (f, key, map) {\n    return modifyHash(f, map._config.hash(key), key, map);\n  };\n\n  Map.prototype.modify = function (key, f) {\n    return modify(f, key, this);\n  };\n  /**\n      Store `value` for `key` in `map` using custom `hash`.\n  \n      Returns a map with the modified value. Does not alter `map`.\n  */\n\n\n  var setHash = hamt.setHash = function (hash, key, value, map) {\n    return modifyHash(constant(value), hash, key, map);\n  };\n\n  Map.prototype.setHash = function (hash, key, value) {\n    return setHash(hash, key, value, this);\n  };\n  /**\n      Store `value` for `key` in `map` using internal hash function.\n  \n      @see `setHash`\n  */\n\n\n  var set = hamt.set = function (key, value, map) {\n    return setHash(map._config.hash(key), key, value, map);\n  };\n\n  Map.prototype.set = function (key, value) {\n    return set(key, value, this);\n  };\n  /**\n      Remove the entry for `key` in `map`.\n  \n      Returns a map with the value removed. Does not alter `map`.\n  */\n\n\n  var del = constant(nothing);\n\n  var removeHash = hamt.removeHash = function (hash, key, map) {\n    return modifyHash(del, hash, key, map);\n  };\n\n  Map.prototype.removeHash = Map.prototype.deleteHash = function (hash, key) {\n    return removeHash(hash, key, this);\n  };\n  /**\n      Remove the entry for `key` in `map` using internal hash function.\n  \n      @see `removeHash`\n  */\n\n\n  var remove = hamt.remove = function (key, map) {\n    return removeHash(map._config.hash(key), key, map);\n  };\n\n  Map.prototype.remove = Map.prototype.delete = function (key) {\n    return remove(key, this);\n  };\n  /* Mutation\n   ******************************************************************************/\n\n  /**\n      Mark `map` as mutable.\n   */\n\n\n  var beginMutation = hamt.beginMutation = function (map) {\n    return new Map(map._editable + 1, map._edit + 1, map._config, map._root, map._size);\n  };\n\n  Map.prototype.beginMutation = function () {\n    return beginMutation(this);\n  };\n  /**\n      Mark `map` as immutable.\n   */\n\n\n  var endMutation = hamt.endMutation = function (map) {\n    map._editable = map._editable && map._editable - 1;\n    return map;\n  };\n\n  Map.prototype.endMutation = function () {\n    return endMutation(this);\n  };\n  /**\n      Mutate `map` within the context of `f`.\n      @param f\n      @param map HAMT\n  */\n\n\n  var mutate = hamt.mutate = function (f, map) {\n    var transient = beginMutation(map);\n    f(transient);\n    return endMutation(transient);\n  };\n\n  Map.prototype.mutate = function (f) {\n    return mutate(f, this);\n  };\n  /* Traversal\n   ******************************************************************************/\n\n  /**\n      Apply a continuation.\n  */\n\n\n  var appk = function appk(k) {\n    return k && lazyVisitChildren(k[0], k[1], k[2], k[3], k[4]);\n  };\n  /**\n      Recursively visit all values stored in an array of nodes lazily.\n  */\n\n\n  var lazyVisitChildren = function lazyVisitChildren(len, children, i, f, k) {\n    while (i < len) {\n      var child = children[i++];\n      if (child && !isEmptyNode(child)) return lazyVisit(child, f, [len, children, i, f, k]);\n    }\n\n    return appk(k);\n  };\n  /**\n      Recursively visit all values stored in `node` lazily.\n  */\n\n\n  var lazyVisit = function lazyVisit(node, f, k) {\n    switch (node.type) {\n      case LEAF:\n        return {\n          value: f(node),\n          rest: k\n        };\n\n      case COLLISION:\n      case ARRAY:\n      case INDEX:\n        var children = node.children;\n        return lazyVisitChildren(children.length, children, 0, f, k);\n\n      default:\n        return appk(k);\n    }\n  };\n\n  var DONE = {\n    done: true\n  };\n  /**\n      Javascript iterator over a map.\n  */\n\n  function MapIterator(v) {\n    this.v = v;\n  }\n\n  MapIterator.prototype.next = function () {\n    if (!this.v) return DONE;\n    var v0 = this.v;\n    this.v = appk(v0.rest);\n    return v0;\n  };\n\n  MapIterator.prototype[Symbol.iterator] = function () {\n    return this;\n  };\n  /**\n      Lazily visit each value in map with function `f`.\n  */\n\n\n  var visit = function visit(map, f) {\n    return new MapIterator(lazyVisit(map._root, f));\n  };\n  /**\n      Get a Javascsript iterator of `map`.\n  \n      Iterates over `[key, value]` arrays.\n  */\n\n\n  var buildPairs = function buildPairs(x) {\n    return [x.key, x.value];\n  };\n\n  var entries = hamt.entries = function (map) {\n    return visit(map, buildPairs);\n  };\n\n  Map.prototype.entries = Map.prototype[Symbol.iterator] = function () {\n    return entries(this);\n  };\n  /**\n      Get array of all keys in `map`.\n  \n      Order is not guaranteed.\n  */\n\n\n  var buildKeys = function buildKeys(x) {\n    return x.key;\n  };\n\n  var keys = hamt.keys = function (map) {\n    return visit(map, buildKeys);\n  };\n\n  Map.prototype.keys = function () {\n    return keys(this);\n  };\n  /**\n      Get array of all values in `map`.\n  \n      Order is not guaranteed, duplicates are preserved.\n  */\n\n\n  var buildValues = function buildValues(x) {\n    return x.value;\n  };\n\n  var values = hamt.values = Map.prototype.values = function (map) {\n    return visit(map, buildValues);\n  };\n\n  Map.prototype.values = function () {\n    return values(this);\n  };\n  /* Fold\n   ******************************************************************************/\n\n  /**\n      Visit every entry in the map, aggregating data.\n  \n      Order of nodes is not guaranteed.\n  \n      @param f Function mapping accumulated value, value, and key to new value.\n      @param z Starting value.\n      @param m HAMT\n  */\n\n\n  var fold = hamt.fold = function (f, z, m) {\n    var root = m._root;\n    if (root.type === LEAF) return f(z, root.value, root.key);\n    var toVisit = [root.children];\n    var children = void 0;\n\n    while (children = toVisit.pop()) {\n      for (var i = 0, len = children.length; i < len;) {\n        var child = children[i++];\n\n        if (child && child.type) {\n          if (child.type === LEAF) z = f(z, child.value, child.key);else toVisit.push(child.children);\n        }\n      }\n    }\n\n    return z;\n  };\n\n  Map.prototype.fold = function (f, z) {\n    return fold(f, z, this);\n  };\n  /**\n      Visit every entry in the map, aggregating data.\n  \n      Order of nodes is not guaranteed.\n  \n      @param f Function invoked with value and key\n      @param map HAMT\n  */\n\n\n  var forEach = hamt.forEach = function (f, map) {\n    return fold(function (_, value, key) {\n      return f(value, key, map);\n    }, null, map);\n  };\n\n  Map.prototype.forEach = function (f) {\n    return forEach(f, this);\n  };\n  /* Aggregate\n   ******************************************************************************/\n\n  /**\n      Get the number of entries in `map`.\n  */\n\n\n  var count = hamt.count = function (map) {\n    return map._size;\n  };\n\n  Map.prototype.count = function () {\n    return count(this);\n  };\n\n  Object.defineProperty(Map.prototype, 'size', {\n    get: Map.prototype.count\n  });\n  /* Export\n   ******************************************************************************/\n\n  if (module.exports) {\n    module.exports = hamt;\n  } else {\n    undefined.hamt = hamt;\n  }\n});\n\nvar BuiltInMap = /*#__PURE__*/function () {\n  function BuiltInMap(existing) {\n    _classCallCheck(this, BuiltInMap);\n\n    _defineProperty(this, \"_map\", void 0);\n\n    this._map = new Map(existing === null || existing === void 0 ? void 0 : existing.entries());\n  }\n\n  _createClass(BuiltInMap, [{\n    key: \"keys\",\n    value: function keys() {\n      return this._map.keys();\n    }\n  }, {\n    key: \"entries\",\n    value: function entries() {\n      return this._map.entries();\n    }\n  }, {\n    key: \"get\",\n    value: function get(k) {\n      return this._map.get(k);\n    }\n  }, {\n    key: \"has\",\n    value: function has(k) {\n      return this._map.has(k);\n    }\n  }, {\n    key: \"set\",\n    value: function set(k, v) {\n      this._map.set(k, v);\n\n      return this;\n    }\n  }, {\n    key: \"delete\",\n    value: function _delete(k) {\n      this._map.delete(k);\n\n      return this;\n    }\n  }, {\n    key: \"clone\",\n    value: function clone() {\n      return persistentMap(this);\n    }\n  }, {\n    key: \"toMap\",\n    value: function toMap() {\n      return new Map(this._map);\n    }\n  }]);\n\n  return BuiltInMap;\n}();\n\nvar HashArrayMappedTrieMap = /*#__PURE__*/function () {\n  // Because hamt.empty is not a function there is no way to introduce type\n  // parameters on it, so empty is typed as HAMTPlusMap<string, mixed>.\n  // flowlint-next-line unclear-type:off\n  function HashArrayMappedTrieMap(existing) {\n    _classCallCheck(this, HashArrayMappedTrieMap);\n\n    _defineProperty(this, \"_hamt\", hamt_1.empty.beginMutation());\n\n    if (existing instanceof HashArrayMappedTrieMap) {\n      var h = existing._hamt.endMutation();\n\n      existing._hamt = h.beginMutation();\n      this._hamt = h.beginMutation();\n    } else if (existing) {\n      var _iterator12 = _createForOfIteratorHelper(existing.entries()),\n          _step12;\n\n      try {\n        for (_iterator12.s(); !(_step12 = _iterator12.n()).done;) {\n          var _step12$value = _slicedToArray(_step12.value, 2),\n              k = _step12$value[0],\n              v = _step12$value[1];\n\n          this._hamt.set(k, v);\n        }\n      } catch (err) {\n        _iterator12.e(err);\n      } finally {\n        _iterator12.f();\n      }\n    }\n  }\n\n  _createClass(HashArrayMappedTrieMap, [{\n    key: \"keys\",\n    value: function keys() {\n      return this._hamt.keys();\n    }\n  }, {\n    key: \"entries\",\n    value: function entries() {\n      return this._hamt.entries();\n    }\n  }, {\n    key: \"get\",\n    value: function get(k) {\n      return this._hamt.get(k);\n    }\n  }, {\n    key: \"has\",\n    value: function has(k) {\n      return this._hamt.has(k);\n    }\n  }, {\n    key: \"set\",\n    value: function set(k, v) {\n      this._hamt.set(k, v);\n\n      return this;\n    }\n  }, {\n    key: \"delete\",\n    value: function _delete(k) {\n      this._hamt.delete(k);\n\n      return this;\n    }\n  }, {\n    key: \"clone\",\n    value: function clone() {\n      return persistentMap(this);\n    }\n  }, {\n    key: \"toMap\",\n    value: function toMap() {\n      return new Map(this._hamt);\n    }\n  }]);\n\n  return HashArrayMappedTrieMap;\n}();\n\nfunction persistentMap(existing) {\n  if (Recoil_gkx_1('recoil_hamt_2020')) {\n    return new HashArrayMappedTrieMap(existing);\n  } else {\n    return new BuiltInMap(existing);\n  }\n}\n\nvar Recoil_PersistentMap = {\n  persistentMap: persistentMap\n};\nvar Recoil_PersistentMap_1 = Recoil_PersistentMap.persistentMap;\nvar Recoil_PersistentMap$1 = /*#__PURE__*/Object.freeze({\n  __proto__: null,\n  persistentMap: Recoil_PersistentMap_1\n});\nvar graph$1 = Recoil_Graph.graph;\nvar persistentMap$1 = Recoil_PersistentMap$1.persistentMap; // flowlint-next-line unclear-type:off\n\nvar nextTreeStateVersion = 0;\n\nvar getNextTreeStateVersion = function getNextTreeStateVersion() {\n  return nextTreeStateVersion++;\n};\n\nfunction makeEmptyTreeState() {\n  var version = getNextTreeStateVersion();\n  return {\n    version: version,\n    stateID: version,\n    transactionMetadata: {},\n    dirtyAtoms: new Set(),\n    atomValues: persistentMap$1(),\n    nonvalidatedAtoms: persistentMap$1()\n  };\n}\n\nfunction makeEmptyStoreState() {\n  var currentTree = makeEmptyTreeState();\n  return {\n    currentTree: currentTree,\n    nextTree: null,\n    previousTree: null,\n    commitDepth: 0,\n    knownAtoms: new Set(),\n    knownSelectors: new Set(),\n    transactionSubscriptions: new Map(),\n    nodeTransactionSubscriptions: new Map(),\n    nodeToComponentSubscriptions: new Map(),\n    queuedComponentCallbacks_DEPRECATED: [],\n    suspendedComponentResolvers: new Set(),\n    graphsByVersion: new Map().set(currentTree.version, graph$1()),\n    versionsUsedByComponent: new Map(),\n    retention: {\n      referenceCounts: new Map(),\n      nodesRetainedByZone: new Map(),\n      retainablesToCheckForRelease: new Set()\n    },\n    nodeCleanupFunctions: new Map()\n  };\n}\n\nvar Recoil_State = {\n  makeEmptyTreeState: makeEmptyTreeState,\n  makeEmptyStoreState: makeEmptyStoreState,\n  getNextTreeStateVersion: getNextTreeStateVersion\n};\n/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @emails oncall+recoil\n * \n * @format\n */\n\nfunction unionSets() {\n  var result = new Set();\n\n  for (var _len4 = arguments.length, sets = new Array(_len4), _key7 = 0; _key7 < _len4; _key7++) {\n    sets[_key7] = arguments[_key7];\n  }\n\n  for (var _i2 = 0, _sets = sets; _i2 < _sets.length; _i2++) {\n    var set = _sets[_i2];\n\n    var _iterator13 = _createForOfIteratorHelper(set),\n        _step13;\n\n    try {\n      for (_iterator13.s(); !(_step13 = _iterator13.n()).done;) {\n        var value = _step13.value;\n        result.add(value);\n      }\n    } catch (err) {\n      _iterator13.e(err);\n    } finally {\n      _iterator13.f();\n    }\n  }\n\n  return result;\n}\n\nvar Recoil_unionSets = unionSets;\n/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @emails oncall+recoil\n * \n * @format\n */\n\n/**\n * The someSet() method tests whether some elements in the given Set pass the\n * test implemented by the provided function.\n */\n\nfunction someSet(set, callback, context) {\n  var iterator = set.entries();\n  var current = iterator.next();\n\n  while (!current.done) {\n    var entry = current.value;\n\n    if (callback.call(context, entry[1], entry[0], set)) {\n      return true;\n    }\n\n    current = iterator.next();\n  }\n\n  return false;\n}\n\nvar Recoil_someSet = someSet;\nvar cleanUpNode$1 = Recoil_FunctionalCore.cleanUpNode;\nvar deleteNodeConfigIfPossible$1 = Recoil_Node.deleteNodeConfigIfPossible,\n    getNode$2 = Recoil_Node.getNode;\nvar RetentionZone$2 = Recoil_RetentionZone.RetentionZone;\nvar emptySet$1 = new Set();\n\nfunction releaseRetainablesNowOnCurrentTree(store, retainables) {\n  var storeState = store.getState();\n  var treeState = storeState.currentTree;\n\n  if (storeState.nextTree) {\n    Recoil_recoverableViolation('releaseNodesNowOnCurrentTree should only be called at the end of a batch');\n    return; // leak memory rather than erase something that's about to be used.\n  }\n\n  var nodes = new Set();\n\n  var _iterator14 = _createForOfIteratorHelper(retainables),\n      _step14;\n\n  try {\n    for (_iterator14.s(); !(_step14 = _iterator14.n()).done;) {\n      var r = _step14.value;\n\n      if (r instanceof RetentionZone$2) {\n        var _iterator16 = _createForOfIteratorHelper(nodesRetainedByZone(storeState, r)),\n            _step16;\n\n        try {\n          for (_iterator16.s(); !(_step16 = _iterator16.n()).done;) {\n            var n = _step16.value;\n            nodes.add(n);\n          }\n        } catch (err) {\n          _iterator16.e(err);\n        } finally {\n          _iterator16.f();\n        }\n      } else {\n        nodes.add(r);\n      }\n    }\n  } catch (err) {\n    _iterator14.e(err);\n  } finally {\n    _iterator14.f();\n  }\n\n  var releasableNodes = findReleasableNodes(store, nodes);\n\n  var _iterator15 = _createForOfIteratorHelper(releasableNodes),\n      _step15;\n\n  try {\n    for (_iterator15.s(); !(_step15 = _iterator15.n()).done;) {\n      var node = _step15.value;\n      releaseNode(store, treeState, node);\n    }\n  } catch (err) {\n    _iterator15.e(err);\n  } finally {\n    _iterator15.f();\n  }\n}\n\nfunction findReleasableNodes(store, searchFromNodes) {\n  var storeState = store.getState();\n  var treeState = storeState.currentTree;\n  var graph = store.getGraph(treeState.version);\n  var releasableNodes = new Set(); // mutated to collect answer\n\n  var nonReleasableNodes = new Set();\n  findReleasableNodesInner(searchFromNodes);\n  return releasableNodes;\n\n  function findReleasableNodesInner(searchFromNodes) {\n    var releasableNodesFoundThisIteration = new Set();\n    var downstreams = getDownstreamNodesInTopologicalOrder(store, treeState, searchFromNodes, releasableNodes, // don't descend into these\n    nonReleasableNodes // don't descend into these\n    ); // Find which of the downstream nodes are releasable and which are not:\n\n    var _iterator17 = _createForOfIteratorHelper(downstreams),\n        _step17;\n\n    try {\n      for (_iterator17.s(); !(_step17 = _iterator17.n()).done;) {\n        var node = _step17.value;\n\n        var _storeState$retention; // Not releasable if configured to be retained forever:\n\n\n        if (getNode$2(node).retainedBy === 'recoilRoot') {\n          nonReleasableNodes.add(node);\n          continue;\n        } // Not releasable if retained directly by a component:\n\n\n        if (((_storeState$retention = storeState.retention.referenceCounts.get(node)) !== null && _storeState$retention !== void 0 ? _storeState$retention : 0) > 0) {\n          nonReleasableNodes.add(node);\n          continue;\n        } // Not releasable if retained by a zone:\n\n\n        if (zonesThatCouldRetainNode(node).some(function (z) {\n          return storeState.retention.referenceCounts.get(z);\n        })) {\n          nonReleasableNodes.add(node);\n          continue;\n        } // Not releasable if it has a non-releasable child (which will already be in\n        // nonReleasableNodes because we are going in topological order):\n\n\n        var nodeChildren = graph.nodeToNodeSubscriptions.get(node);\n\n        if (nodeChildren && Recoil_someSet(nodeChildren, function (child) {\n          return nonReleasableNodes.has(child);\n        })) {\n          nonReleasableNodes.add(node);\n          continue;\n        }\n\n        releasableNodes.add(node);\n        releasableNodesFoundThisIteration.add(node);\n      } // If we found any releasable nodes, we need to walk UP from those nodes to\n      // find whether their parents can now be released as well:\n\n    } catch (err) {\n      _iterator17.e(err);\n    } finally {\n      _iterator17.f();\n    }\n\n    var parents = new Set();\n\n    var _iterator18 = _createForOfIteratorHelper(releasableNodesFoundThisIteration),\n        _step18;\n\n    try {\n      for (_iterator18.s(); !(_step18 = _iterator18.n()).done;) {\n        var _node = _step18.value;\n\n        var _iterator19 = _createForOfIteratorHelper((_graph$nodeDeps$get = graph.nodeDeps.get(_node)) !== null && _graph$nodeDeps$get !== void 0 ? _graph$nodeDeps$get : emptySet$1),\n            _step19;\n\n        try {\n          for (_iterator19.s(); !(_step19 = _iterator19.n()).done;) {\n            var parent = _step19.value;\n\n            var _graph$nodeDeps$get;\n\n            if (!releasableNodes.has(parent)) {\n              parents.add(parent);\n            }\n          }\n        } catch (err) {\n          _iterator19.e(err);\n        } finally {\n          _iterator19.f();\n        }\n      }\n    } catch (err) {\n      _iterator18.e(err);\n    } finally {\n      _iterator18.f();\n    }\n\n    if (parents.size) {\n      findReleasableNodesInner(parents);\n    }\n  }\n} // Children before parents\n\n\nfunction getDownstreamNodesInTopologicalOrder(store, treeState, nodes, // Mutable set is destroyed in place\ndoNotDescendInto1, doNotDescendInto2) {\n  var graph = store.getGraph(treeState.version);\n  var answer = [];\n  var visited = new Set();\n\n  while (nodes.size > 0) {\n    visit(Recoil_nullthrows(nodes.values().next().value));\n  }\n\n  return answer;\n\n  function visit(node) {\n    if (doNotDescendInto1.has(node) || doNotDescendInto2.has(node)) {\n      nodes.delete(node);\n      return;\n    }\n\n    if (visited.has(node)) {\n      return;\n    }\n\n    var children = graph.nodeToNodeSubscriptions.get(node);\n\n    if (children) {\n      var _iterator20 = _createForOfIteratorHelper(children),\n          _step20;\n\n      try {\n        for (_iterator20.s(); !(_step20 = _iterator20.n()).done;) {\n          var child = _step20.value;\n          visit(child);\n        }\n      } catch (err) {\n        _iterator20.e(err);\n      } finally {\n        _iterator20.f();\n      }\n    }\n\n    visited.add(node);\n    nodes.delete(node);\n    answer.push(node);\n  }\n}\n\nfunction releaseNode(store, treeState, node) {\n  if (!Recoil_gkx_1('recoil_memory_managament_2020')) {\n    return;\n  } // Atom effects, in-closure caches, etc.:\n\n\n  cleanUpNode$1(store, node); // Delete from store state:\n\n  var storeState = store.getState();\n  storeState.knownAtoms.delete(node);\n  storeState.knownSelectors.delete(node);\n  storeState.nodeTransactionSubscriptions.delete(node);\n  storeState.retention.referenceCounts.delete(node);\n  var zones = zonesThatCouldRetainNode(node);\n\n  var _iterator21 = _createForOfIteratorHelper(zones),\n      _step21;\n\n  try {\n    for (_iterator21.s(); !(_step21 = _iterator21.n()).done;) {\n      var zone = _step21.value;\n\n      var _storeState$retention2;\n\n      (_storeState$retention2 = storeState.retention.nodesRetainedByZone.get(zone)) === null || _storeState$retention2 === void 0 ? void 0 : _storeState$retention2.delete(node);\n    } // Note that we DO NOT delete from nodeToComponentSubscriptions because this\n    // already happens when the last component that was retaining the node unmounts,\n    // and this could happen either before or after that.\n    // Delete from TreeState and dep graph:\n\n  } catch (err) {\n    _iterator21.e(err);\n  } finally {\n    _iterator21.f();\n  }\n\n  treeState.atomValues.delete(node);\n  treeState.dirtyAtoms.delete(node);\n  treeState.nonvalidatedAtoms.delete(node);\n  var graph = storeState.graphsByVersion.get(treeState.version);\n\n  if (graph) {\n    var deps = graph.nodeDeps.get(node);\n\n    if (deps !== undefined) {\n      graph.nodeDeps.delete(node);\n\n      var _iterator22 = _createForOfIteratorHelper(deps),\n          _step22;\n\n      try {\n        for (_iterator22.s(); !(_step22 = _iterator22.n()).done;) {\n          var dep = _step22.value;\n\n          var _graph$nodeToNodeSubs;\n\n          (_graph$nodeToNodeSubs = graph.nodeToNodeSubscriptions.get(dep)) === null || _graph$nodeToNodeSubs === void 0 ? void 0 : _graph$nodeToNodeSubs.delete(node);\n        }\n      } catch (err) {\n        _iterator22.e(err);\n      } finally {\n        _iterator22.f();\n      }\n    } // No need to delete sub's deps as there should be no subs at this point.\n    // But an invariant would require deleting nodes in topological order.\n\n\n    graph.nodeToNodeSubscriptions.delete(node);\n  } // Node config (for family members only as their configs can be recreated, and\n  // only if they are not retained within any other Stores):\n\n\n  deleteNodeConfigIfPossible$1(node);\n}\n\nfunction nodesRetainedByZone(storeState, zone) {\n  var _storeState$retention3;\n\n  return (_storeState$retention3 = storeState.retention.nodesRetainedByZone.get(zone)) !== null && _storeState$retention3 !== void 0 ? _storeState$retention3 : emptySet$1;\n}\n\nfunction zonesThatCouldRetainNode(node) {\n  var retainedBy = getNode$2(node).retainedBy;\n\n  if (retainedBy === undefined || retainedBy === 'components' || retainedBy === 'recoilRoot') {\n    return [];\n  } else if (retainedBy instanceof RetentionZone$2) {\n    return [retainedBy];\n  } else {\n    return retainedBy; // it's an array of zones\n  }\n}\n\nfunction scheduleOrPerformPossibleReleaseOfRetainable(store, retainable) {\n  var state = store.getState();\n\n  if (state.nextTree) {\n    state.retention.retainablesToCheckForRelease.add(retainable);\n  } else {\n    releaseRetainablesNowOnCurrentTree(store, new Set([retainable]));\n  }\n}\n\nfunction updateRetainCount(store, retainable, delta) {\n  var _map$get;\n\n  if (!Recoil_gkx_1('recoil_memory_managament_2020')) {\n    return;\n  }\n\n  var map = store.getState().retention.referenceCounts;\n  var newCount = ((_map$get = map.get(retainable)) !== null && _map$get !== void 0 ? _map$get : 0) + delta;\n\n  if (newCount === 0) {\n    updateRetainCountToZero(store, retainable);\n  } else {\n    map.set(retainable, newCount);\n  }\n}\n\nfunction updateRetainCountToZero(store, retainable) {\n  if (!Recoil_gkx_1('recoil_memory_managament_2020')) {\n    return;\n  }\n\n  var map = store.getState().retention.referenceCounts;\n  map.delete(retainable);\n  scheduleOrPerformPossibleReleaseOfRetainable(store, retainable);\n}\n\nfunction releaseScheduledRetainablesNow(store) {\n  if (!Recoil_gkx_1('recoil_memory_managament_2020')) {\n    return;\n  }\n\n  var state = store.getState();\n  releaseRetainablesNowOnCurrentTree(store, state.retention.retainablesToCheckForRelease);\n  state.retention.retainablesToCheckForRelease.clear();\n}\n\nfunction retainedByOptionWithDefault(r) {\n  // The default will change from 'recoilRoot' to 'components' in the future.\n  return r === undefined ? 'recoilRoot' : r;\n}\n\nvar Recoil_Retention = {\n  updateRetainCount: updateRetainCount,\n  updateRetainCountToZero: updateRetainCountToZero,\n  releaseScheduledRetainablesNow: releaseScheduledRetainablesNow,\n  retainedByOptionWithDefault: retainedByOptionWithDefault\n};\n/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @emails oncall+recoil\n * \n * @format\n */\n\n/**\n * Combines multiple Iterables into a single Iterable.\n * Traverses the input Iterables in the order provided and maintains the order\n * of their elements.\n *\n * Example:\n * ```\n * const r = Array.from(concatIterables(['a', 'b'], ['c'], ['d', 'e', 'f']));\n * r == ['a', 'b', 'c', 'd', 'e', 'f'];\n * ```\n */\n\nfunction concatIterables(iters) {\n  var _iterator23, _step23, iter, _iterator24, _step24, val;\n\n  return _regeneratorRuntime.wrap(function concatIterables$(_context3) {\n    while (1) {\n      switch (_context3.prev = _context3.next) {\n        case 0:\n          _iterator23 = _createForOfIteratorHelper(iters);\n          _context3.prev = 1;\n\n          _iterator23.s();\n\n        case 3:\n          if ((_step23 = _iterator23.n()).done) {\n            _context3.next = 24;\n            break;\n          }\n\n          iter = _step23.value;\n          _iterator24 = _createForOfIteratorHelper(iter);\n          _context3.prev = 6;\n\n          _iterator24.s();\n\n        case 8:\n          if ((_step24 = _iterator24.n()).done) {\n            _context3.next = 14;\n            break;\n          }\n\n          val = _step24.value;\n          _context3.next = 12;\n          return val;\n\n        case 12:\n          _context3.next = 8;\n          break;\n\n        case 14:\n          _context3.next = 19;\n          break;\n\n        case 16:\n          _context3.prev = 16;\n          _context3.t0 = _context3[\"catch\"](6);\n\n          _iterator24.e(_context3.t0);\n\n        case 19:\n          _context3.prev = 19;\n\n          _iterator24.f();\n\n          return _context3.finish(19);\n\n        case 22:\n          _context3.next = 3;\n          break;\n\n        case 24:\n          _context3.next = 29;\n          break;\n\n        case 26:\n          _context3.prev = 26;\n          _context3.t1 = _context3[\"catch\"](1);\n\n          _iterator23.e(_context3.t1);\n\n        case 29:\n          _context3.prev = 29;\n\n          _iterator23.f();\n\n          return _context3.finish(29);\n\n        case 32:\n        case \"end\":\n          return _context3.stop();\n      }\n    }\n  }, _marked2, null, [[1, 26, 29, 32], [6, 16, 19, 22]]);\n}\n\nvar Recoil_concatIterables = concatIterables;\n/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @emails oncall+recoil\n * \n * @format\n */\n\nvar isSSR = typeof window === 'undefined';\nvar isReactNative = typeof navigator !== 'undefined' && navigator.product === 'ReactNative'; // eslint-disable-line fb-www/typeof-undefined\n\nvar Recoil_Environment = {\n  isSSR: isSSR,\n  isReactNative: isReactNative\n};\nvar isSSR$1 = Recoil_Environment.isSSR;\nvar batchUpdates$1 = Recoil_Batching.batchUpdates;\nvar initializeNodeIfNewToStore$1 = Recoil_FunctionalCore.initializeNodeIfNewToStore,\n    peekNodeInfo$1 = Recoil_FunctionalCore.peekNodeInfo;\nvar graph$2 = Recoil_Graph.graph;\nvar DEFAULT_VALUE$1 = Recoil_Node.DEFAULT_VALUE,\n    recoilValues$1 = Recoil_Node.recoilValues,\n    recoilValuesForKeys$2 = Recoil_Node.recoilValuesForKeys;\nvar AbstractRecoilValue$2 = Recoil_RecoilValueInterface.AbstractRecoilValue,\n    getRecoilValueAsLoadable$1 = Recoil_RecoilValueInterface.getRecoilValueAsLoadable,\n    setRecoilValue$1 = Recoil_RecoilValueInterface.setRecoilValue,\n    setUnvalidatedRecoilValue$1 = Recoil_RecoilValueInterface.setUnvalidatedRecoilValue;\nvar updateRetainCount$1 = Recoil_Retention.updateRetainCount;\nvar getNextTreeStateVersion$1 = Recoil_State.getNextTreeStateVersion,\n    makeEmptyStoreState$1 = Recoil_State.makeEmptyStoreState; // Opaque at this surface because it's part of the public API from here.\n\nvar retainWarning = \"\\nRecoil Snapshots only last for the duration of the callback they are provided to. To keep a Snapshot longer, do this:\\n\\n  const release = snapshot.retain();\\n  try {\\n    await useTheSnapshotAsynchronously(snapshot);\\n  } finally {\\n    release();\\n  }\\n\\nThis is currently a DEV-only warning but will become a thrown exception in the next release of Recoil.\\n\"; // A \"Snapshot\" is \"read-only\" and captures a specific set of values of atoms.\n// However, the data-flow-graph and selector values may evolve as selector\n// evaluation functions are executed and async selectors resolve.\n\nvar Snapshot = /*#__PURE__*/function () {\n  function Snapshot(storeState) {\n    var _this2 = this;\n\n    _classCallCheck(this, Snapshot);\n\n    _defineProperty(this, \"_store\", void 0);\n\n    _defineProperty(this, \"_refCount\", 0);\n\n    _defineProperty(this, \"getLoadable\", function (recoilValue) {\n      _this2.checkRefCount_INTERNAL();\n\n      return getRecoilValueAsLoadable$1(_this2._store, recoilValue);\n    });\n\n    _defineProperty(this, \"getPromise\", function (recoilValue) {\n      _this2.checkRefCount_INTERNAL();\n\n      return _this2.getLoadable(recoilValue).toPromise();\n    });\n\n    _defineProperty(this, \"getNodes_UNSTABLE\", function (opt) {\n      _this2.checkRefCount_INTERNAL(); // TODO Deal with modified selectors\n\n\n      if ((opt === null || opt === void 0 ? void 0 : opt.isModified) === true) {\n        if ((opt === null || opt === void 0 ? void 0 : opt.isInitialized) === false) {\n          return [];\n        }\n\n        var state = _this2._store.getState().currentTree;\n\n        return recoilValuesForKeys$2(state.dirtyAtoms);\n      }\n\n      var knownAtoms = _this2._store.getState().knownAtoms;\n\n      var knownSelectors = _this2._store.getState().knownSelectors;\n\n      return (opt === null || opt === void 0 ? void 0 : opt.isInitialized) == null ? recoilValues$1.values() : opt.isInitialized === true ? recoilValuesForKeys$2(Recoil_concatIterables([_this2._store.getState().knownAtoms, _this2._store.getState().knownSelectors])) : Recoil_filterIterable(recoilValues$1.values(), function (_ref12) {\n        var key = _ref12.key;\n        return !knownAtoms.has(key) && !knownSelectors.has(key);\n      });\n    });\n\n    _defineProperty(this, \"getInfo_UNSTABLE\", function (_ref13) {\n      var key = _ref13.key;\n\n      _this2.checkRefCount_INTERNAL();\n\n      return peekNodeInfo$1(_this2._store, _this2._store.getState().currentTree, key);\n    });\n\n    _defineProperty(this, \"map\", function (mapper) {\n      _this2.checkRefCount_INTERNAL();\n\n      var mutableSnapshot = new MutableSnapshot(_this2, batchUpdates$1);\n      mapper(mutableSnapshot); // if removing batchUpdates from `set` add it here\n\n      return cloneSnapshot(mutableSnapshot.getStore_INTERNAL());\n    });\n\n    _defineProperty(this, \"asyncMap\", /*#__PURE__*/function () {\n      var _ref14 = _asyncToGenerator( /*#__PURE__*/_regeneratorRuntime.mark(function _callee2(mapper) {\n        var mutableSnapshot;\n        return _regeneratorRuntime.wrap(function _callee2$(_context4) {\n          while (1) {\n            switch (_context4.prev = _context4.next) {\n              case 0:\n                _this2.checkRefCount_INTERNAL();\n\n                mutableSnapshot = new MutableSnapshot(_this2, batchUpdates$1);\n                _context4.next = 4;\n                return mapper(mutableSnapshot);\n\n              case 4:\n                return _context4.abrupt(\"return\", cloneSnapshot(mutableSnapshot.getStore_INTERNAL()));\n\n              case 5:\n              case \"end\":\n                return _context4.stop();\n            }\n          }\n        }, _callee2);\n      }));\n\n      return function (_x) {\n        return _ref14.apply(this, arguments);\n      };\n    }());\n\n    this._store = {\n      getState: function getState() {\n        return storeState;\n      },\n      replaceState: function replaceState(replacer) {\n        storeState.currentTree = replacer(storeState.currentTree); // no batching so nextTree is never active\n      },\n      getGraph: function getGraph(version) {\n        var graphs = storeState.graphsByVersion;\n\n        if (graphs.has(version)) {\n          return Recoil_nullthrows(graphs.get(version));\n        }\n\n        var newGraph = graph$2();\n        graphs.set(version, newGraph);\n        return newGraph;\n      },\n      subscribeToTransactions: function subscribeToTransactions() {\n        return {\n          release: function release() {}\n        };\n      },\n      addTransactionMetadata: function addTransactionMetadata() {\n        throw new Error('Cannot subscribe to Snapshots');\n      }\n    }; // Initialize any nodes that are live in the parent store (primarily so that this\n    // snapshot gets counted towards the node's live stores count).\n\n    var _iterator25 = _createForOfIteratorHelper(this._store.getState().nodeCleanupFunctions.keys()),\n        _step25;\n\n    try {\n      for (_iterator25.s(); !(_step25 = _iterator25.n()).done;) {\n        var nodeKey = _step25.value;\n        initializeNodeIfNewToStore$1(this._store, storeState.currentTree, nodeKey, 'get');\n        updateRetainCount$1(this._store, nodeKey, 1);\n      }\n    } catch (err) {\n      _iterator25.e(err);\n    } finally {\n      _iterator25.f();\n    }\n\n    this.retain();\n    this.autorelease_INTERNAL();\n  }\n\n  _createClass(Snapshot, [{\n    key: \"retain\",\n    value: function retain() {\n      var _this3 = this;\n\n      if (!Recoil_gkx_1('recoil_memory_managament_2020')) {\n        return function () {\n          return undefined;\n        };\n      }\n\n      this._refCount++;\n      var released = false;\n      return function () {\n        if (!released) {\n          released = true;\n\n          _this3.release_INTERNAL();\n        }\n      };\n    }\n  }, {\n    key: \"autorelease_INTERNAL\",\n    value: function autorelease_INTERNAL() {\n      var _this4 = this;\n\n      if (!Recoil_gkx_1('recoil_memory_managament_2020')) {\n        return;\n      }\n\n      if (!isSSR$1) {\n        window.setTimeout(function () {\n          return _this4.release_INTERNAL();\n        }, 0);\n      }\n    }\n  }, {\n    key: \"release_INTERNAL\",\n    value: function release_INTERNAL() {\n      if (!Recoil_gkx_1('recoil_memory_managament_2020')) {\n        return;\n      }\n\n      this._refCount--;\n      if (this._refCount === 0) ;\n    }\n  }, {\n    key: \"checkRefCount_INTERNAL\",\n    value: function checkRefCount_INTERNAL() {\n      if (Recoil_gkx_1('recoil_memory_managament_2020') && this._refCount <= 0) {\n        if (process.env.NODE_ENV !== \"production\") {\n          Recoil_recoverableViolation(retainWarning);\n        } // What we will ship later:\n        // throw new Error(retainWarning);\n\n      }\n    }\n  }, {\n    key: \"getStore_INTERNAL\",\n    value: function getStore_INTERNAL() {\n      this.checkRefCount_INTERNAL();\n      return this._store;\n    }\n  }, {\n    key: \"getID\",\n    value: function getID() {\n      this.checkRefCount_INTERNAL();\n      return this.getID_INTERNAL();\n    }\n  }, {\n    key: \"getID_INTERNAL\",\n    value: function getID_INTERNAL() {\n      this.checkRefCount_INTERNAL();\n      return this._store.getState().currentTree.stateID;\n    } // We want to allow the methods to be destructured and used as accessors\n    // eslint-disable-next-line fb-www/extra-arrow-initializer\n\n  }]);\n\n  return Snapshot;\n}();\n\nfunction cloneStoreState(store, treeState) {\n  var bumpVersion = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : false;\n  var storeState = store.getState();\n  var version = bumpVersion ? getNextTreeStateVersion$1() : treeState.version;\n  return {\n    currentTree: bumpVersion ? {\n      // TODO snapshots shouldn't really have versions because a new version number\n      // is always assigned when the snapshot is gone to.\n      version: version,\n      stateID: version,\n      transactionMetadata: _objectSpread({}, treeState.transactionMetadata),\n      dirtyAtoms: new Set(treeState.dirtyAtoms),\n      atomValues: treeState.atomValues.clone(),\n      nonvalidatedAtoms: treeState.nonvalidatedAtoms.clone()\n    } : treeState,\n    commitDepth: 0,\n    nextTree: null,\n    previousTree: null,\n    knownAtoms: new Set(storeState.knownAtoms),\n    // FIXME here's a copy\n    knownSelectors: new Set(storeState.knownSelectors),\n    // FIXME here's a copy\n    transactionSubscriptions: new Map(),\n    nodeTransactionSubscriptions: new Map(),\n    nodeToComponentSubscriptions: new Map(),\n    queuedComponentCallbacks_DEPRECATED: [],\n    suspendedComponentResolvers: new Set(),\n    graphsByVersion: new Map().set(version, store.getGraph(treeState.version)),\n    versionsUsedByComponent: new Map(),\n    retention: {\n      referenceCounts: new Map(),\n      nodesRetainedByZone: new Map(),\n      retainablesToCheckForRelease: new Set()\n    },\n    nodeCleanupFunctions: new Map()\n  };\n} // Factory to build a fresh snapshot\n\n\nfunction freshSnapshot(initializeState) {\n  var snapshot = new Snapshot(makeEmptyStoreState$1());\n  return initializeState != null ? snapshot.map(initializeState) : snapshot;\n} // Factory to clone a snapahot state\n\n\nfunction cloneSnapshot(store) {\n  var version = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 'current';\n  var storeState = store.getState();\n  var treeState = version === 'current' ? storeState.currentTree : Recoil_nullthrows(storeState.previousTree);\n  return new Snapshot(cloneStoreState(store, treeState));\n}\n\nvar MutableSnapshot = /*#__PURE__*/function (_Snapshot) {\n  _inherits(MutableSnapshot, _Snapshot);\n\n  var _super6 = _createSuper(MutableSnapshot);\n\n  function MutableSnapshot(snapshot, batch) {\n    var _this5;\n\n    _classCallCheck(this, MutableSnapshot);\n\n    _this5 = _super6.call(this, cloneStoreState(snapshot.getStore_INTERNAL(), snapshot.getStore_INTERNAL().getState().currentTree, true));\n\n    _defineProperty(_assertThisInitialized(_this5), \"_batch\", void 0);\n\n    _defineProperty(_assertThisInitialized(_this5), \"set\", function (recoilState, newValueOrUpdater) {\n      _this5.checkRefCount_INTERNAL();\n\n      var store = _this5.getStore_INTERNAL(); // This batchUpdates ensures this `set` is applied immediately and you can\n      // read the written value after calling `set`. I would like to remove this\n      // behavior and only batch in `Snapshot.map`, but this would be a breaking\n      // change potentially.\n\n\n      _this5._batch(function () {\n        updateRetainCount$1(store, recoilState.key, 1);\n        setRecoilValue$1(_this5.getStore_INTERNAL(), recoilState, newValueOrUpdater);\n      });\n    });\n\n    _defineProperty(_assertThisInitialized(_this5), \"reset\", function (recoilState) {\n      _this5.checkRefCount_INTERNAL();\n\n      var store = _this5.getStore_INTERNAL(); // See note at `set` about batched updates.\n\n\n      _this5._batch(function () {\n        updateRetainCount$1(store, recoilState.key, 1);\n        setRecoilValue$1(_this5.getStore_INTERNAL(), recoilState, DEFAULT_VALUE$1);\n      });\n    });\n\n    _defineProperty(_assertThisInitialized(_this5), \"setUnvalidatedAtomValues_DEPRECATED\", function (values) {\n      _this5.checkRefCount_INTERNAL();\n\n      var store = _this5.getStore_INTERNAL(); // See note at `set` about batched updates.\n\n\n      batchUpdates$1(function () {\n        var _iterator26 = _createForOfIteratorHelper(values.entries()),\n            _step26;\n\n        try {\n          for (_iterator26.s(); !(_step26 = _iterator26.n()).done;) {\n            var _step26$value = _slicedToArray(_step26.value, 2),\n                k = _step26$value[0],\n                v = _step26$value[1];\n\n            updateRetainCount$1(store, k, 1);\n            setUnvalidatedRecoilValue$1(store, new AbstractRecoilValue$2(k), v);\n          }\n        } catch (err) {\n          _iterator26.e(err);\n        } finally {\n          _iterator26.f();\n        }\n      });\n    });\n\n    _this5._batch = batch;\n    return _this5;\n  } // We want to allow the methods to be destructured and used as accessors\n  // eslint-disable-next-line fb-www/extra-arrow-initializer\n\n\n  return MutableSnapshot;\n}(Snapshot);\n\nvar Recoil_Snapshot = {\n  Snapshot: Snapshot,\n  MutableSnapshot: MutableSnapshot,\n  freshSnapshot: freshSnapshot,\n  cloneSnapshot: cloneSnapshot\n};\nvar Recoil_Snapshot_1 = Recoil_Snapshot.Snapshot;\nvar Recoil_Snapshot_2 = Recoil_Snapshot.MutableSnapshot;\nvar Recoil_Snapshot_3 = Recoil_Snapshot.freshSnapshot;\nvar Recoil_Snapshot_4 = Recoil_Snapshot.cloneSnapshot;\nvar Recoil_Snapshot$1 = /*#__PURE__*/Object.freeze({\n  __proto__: null,\n  Snapshot: Recoil_Snapshot_1,\n  MutableSnapshot: Recoil_Snapshot_2,\n  freshSnapshot: Recoil_Snapshot_3,\n  cloneSnapshot: Recoil_Snapshot_4\n}); // @fb-only: const RecoilusagelogEvent = require('RecoilusagelogEvent');\n// @fb-only: const RecoilUsageLogFalcoEvent = require('RecoilUsageLogFalcoEvent');\n// @fb-only: const URI = require('URI');\n\nvar getNextTreeStateVersion$2 = Recoil_State.getNextTreeStateVersion,\n    makeEmptyStoreState$2 = Recoil_State.makeEmptyStoreState;\nvar cleanUpNode$2 = Recoil_FunctionalCore.cleanUpNode,\n    getDownstreamNodes$2 = Recoil_FunctionalCore.getDownstreamNodes,\n    setNodeValue$2 = Recoil_FunctionalCore.setNodeValue,\n    setUnvalidatedAtomValue_DEPRECATED$1 = Recoil_FunctionalCore.setUnvalidatedAtomValue_DEPRECATED;\nvar graph$3 = Recoil_Graph.graph;\nvar cloneGraph$1 = Recoil_Graph.cloneGraph;\nvar applyAtomValueWrites$1 = Recoil_RecoilValueInterface.applyAtomValueWrites;\nvar releaseScheduledRetainablesNow$1 = Recoil_Retention.releaseScheduledRetainablesNow;\nvar freshSnapshot$1 = Recoil_Snapshot$1.freshSnapshot;\nvar useCallback = react.useCallback,\n    useContext = react.useContext,\n    useEffect = react.useEffect,\n    useMemo = react.useMemo,\n    useRef = react.useRef,\n    useState = react.useState;\n\nfunction notInAContext() {\n  throw new Error('This component must be used inside a <RecoilRoot> component.');\n}\n\nvar defaultStore = Object.freeze({\n  getState: notInAContext,\n  replaceState: notInAContext,\n  getGraph: notInAContext,\n  subscribeToTransactions: notInAContext,\n  addTransactionMetadata: notInAContext\n});\nvar stateReplacerIsBeingExecuted = false;\n\nfunction startNextTreeIfNeeded(store) {\n  if (stateReplacerIsBeingExecuted) {\n    throw new Error('An atom update was triggered within the execution of a state updater function. State updater functions provided to Recoil must be pure functions.');\n  }\n\n  var storeState = store.getState();\n\n  if (storeState.nextTree === null) {\n    if (Recoil_gkx_1('recoil_memory_managament_2020') && Recoil_gkx_1('recoil_release_on_cascading_update_killswitch_2021')) {\n      // If this is a cascading update (that is, rendering due to one state change\n      // invokes a second state change), we won't have cleaned up retainables yet\n      // because this normally happens after notifying components. Do it before\n      // proceeding with the cascading update so that it remains predictable:\n      if (storeState.commitDepth > 0) {\n        releaseScheduledRetainablesNow$1(store);\n      }\n    }\n\n    var version = storeState.currentTree.version;\n    var nextVersion = getNextTreeStateVersion$2();\n    storeState.nextTree = _objectSpread(_objectSpread({}, storeState.currentTree), {}, {\n      version: nextVersion,\n      stateID: nextVersion,\n      dirtyAtoms: new Set(),\n      transactionMetadata: {}\n    });\n    storeState.graphsByVersion.set(nextVersion, cloneGraph$1(Recoil_nullthrows(storeState.graphsByVersion.get(version))));\n  }\n}\n\nvar AppContext = react.createContext({\n  current: defaultStore\n});\n\nvar useStoreRef = function useStoreRef() {\n  return useContext(AppContext);\n};\n\nvar MutableSourceContext = react.createContext(null); // TODO T2710559282599660\n\nfunction useRecoilMutableSource() {\n  var mutableSource = useContext(MutableSourceContext);\n\n  if (mutableSource == null) {\n    Recoil_expectationViolation('Attempted to use a Recoil hook outside of a <RecoilRoot>. ' + '<RecoilRoot> must be an ancestor of any component that uses ' + 'Recoil hooks.');\n  }\n\n  return mutableSource;\n}\n\nfunction notifyComponents(store, storeState, treeState) {\n  var dependentNodes = getDownstreamNodes$2(store, treeState, treeState.dirtyAtoms);\n\n  var _iterator27 = _createForOfIteratorHelper(dependentNodes),\n      _step27;\n\n  try {\n    for (_iterator27.s(); !(_step27 = _iterator27.n()).done;) {\n      var key = _step27.value;\n      var comps = storeState.nodeToComponentSubscriptions.get(key);\n\n      if (comps) {\n        var _iterator28 = _createForOfIteratorHelper(comps),\n            _step28;\n\n        try {\n          for (_iterator28.s(); !(_step28 = _iterator28.n()).done;) {\n            var _step28$value = _slicedToArray(_step28.value, 2),\n                _subID = _step28$value[0],\n                _step28$value$ = _slicedToArray(_step28$value[1], 2),\n                _debugName = _step28$value$[0],\n                callback = _step28$value$[1];\n\n            callback(treeState);\n          }\n        } catch (err) {\n          _iterator28.e(err);\n        } finally {\n          _iterator28.f();\n        }\n      }\n    }\n  } catch (err) {\n    _iterator27.e(err);\n  } finally {\n    _iterator27.f();\n  }\n}\n\nfunction sendEndOfBatchNotifications(store) {\n  var storeState = store.getState();\n  var treeState = storeState.currentTree; // Inform transaction subscribers of the transaction:\n\n  var dirtyAtoms = treeState.dirtyAtoms;\n\n  if (dirtyAtoms.size) {\n    // Execute Node-specific subscribers before global subscribers\n    var _iterator29 = _createForOfIteratorHelper(storeState.nodeTransactionSubscriptions),\n        _step29;\n\n    try {\n      for (_iterator29.s(); !(_step29 = _iterator29.n()).done;) {\n        var _step29$value = _slicedToArray(_step29.value, 2),\n            key = _step29$value[0],\n            subscriptions = _step29$value[1];\n\n        if (dirtyAtoms.has(key)) {\n          var _iterator31 = _createForOfIteratorHelper(subscriptions),\n              _step31;\n\n          try {\n            for (_iterator31.s(); !(_step31 = _iterator31.n()).done;) {\n              var _step31$value = _slicedToArray(_step31.value, 2),\n                  _ = _step31$value[0],\n                  subscription = _step31$value[1];\n\n              subscription(store);\n            }\n          } catch (err) {\n            _iterator31.e(err);\n          } finally {\n            _iterator31.f();\n          }\n        }\n      }\n    } catch (err) {\n      _iterator29.e(err);\n    } finally {\n      _iterator29.f();\n    }\n\n    var _iterator30 = _createForOfIteratorHelper(storeState.transactionSubscriptions),\n        _step30;\n\n    try {\n      for (_iterator30.s(); !(_step30 = _iterator30.n()).done;) {\n        var _step30$value = _slicedToArray(_step30.value, 2),\n            _2 = _step30$value[0],\n            _subscription = _step30$value[1];\n\n        _subscription(store);\n      }\n    } catch (err) {\n      _iterator30.e(err);\n    } finally {\n      _iterator30.f();\n    }\n\n    if (!Recoil_gkx_1('recoil_early_rendering_2021') || storeState.suspendedComponentResolvers.size) {\n      // Notifying components is needed to wake from suspense, even when using\n      // early rendering.\n      notifyComponents(store, storeState, treeState); // Wake all suspended components so the right one(s) can try to re-render.\n      // We need to wake up components not just when some asynchronous selector\n      // resolved, but also when changing synchronous values because this may cause\n      // a selector to change from asynchronous to synchronous, in which case there\n      // would be no follow-up asynchronous resolution to wake us up.\n      // TODO OPTIMIZATION Only wake up related downstream components\n\n      storeState.suspendedComponentResolvers.forEach(function (cb) {\n        return cb();\n      });\n      storeState.suspendedComponentResolvers.clear();\n    }\n  } // Special behavior ONLY invoked by useInterface.\n  // FIXME delete queuedComponentCallbacks_DEPRECATED when deleting useInterface.\n\n\n  storeState.queuedComponentCallbacks_DEPRECATED.forEach(function (cb) {\n    return cb(treeState);\n  });\n  storeState.queuedComponentCallbacks_DEPRECATED.splice(0, storeState.queuedComponentCallbacks_DEPRECATED.length);\n}\n\nfunction endBatch(storeRef) {\n  var storeState = storeRef.current.getState();\n  storeState.commitDepth++;\n\n  try {\n    var nextTree = storeState.nextTree; // Ignore commits that are not because of Recoil transactions -- namely,\n    // because something above RecoilRoot re-rendered:\n\n    if (nextTree === null) {\n      return;\n    } // nextTree is now committed -- note that copying and reset occurs when\n    // a transaction begins, in startNextTreeIfNeeded:\n\n\n    storeState.previousTree = storeState.currentTree;\n    storeState.currentTree = nextTree;\n    storeState.nextTree = null;\n    sendEndOfBatchNotifications(storeRef.current);\n\n    if (storeState.previousTree != null) {\n      storeState.graphsByVersion.delete(storeState.previousTree.version);\n    } else {\n      Recoil_recoverableViolation('Ended batch with no previous state, which is unexpected', 'recoil');\n    }\n\n    storeState.previousTree = null;\n\n    if (Recoil_gkx_1('recoil_memory_managament_2020')) {\n      releaseScheduledRetainablesNow$1(storeRef.current);\n    }\n  } finally {\n    storeState.commitDepth--;\n  }\n}\n/*\n * The purpose of the Batcher is to observe when React batches end so that\n * Recoil state changes can be batched. Whenever Recoil state changes, we call\n * setState on the batcher. Then we wait for that change to be committed, which\n * signifies the end of the batch. That's when we respond to the Recoil change.\n */\n\n\nfunction Batcher(_ref15) {\n  var setNotifyBatcherOfChange = _ref15.setNotifyBatcherOfChange;\n  var storeRef = useStoreRef();\n\n  var _useState = useState([]),\n      _useState2 = _slicedToArray(_useState, 2),\n      _ = _useState2[0],\n      setState = _useState2[1];\n\n  setNotifyBatcherOfChange(function () {\n    return setState({});\n  });\n  useEffect(function () {\n    // enqueueExecution runs this function immediately; it is only used to\n    // manipulate the order of useEffects during tests, since React seems to\n    // call useEffect in an unpredictable order sometimes.\n    Recoil_Queue.enqueueExecution('Batcher', function () {\n      endBatch(storeRef);\n    });\n  }); // If an asynchronous selector resolves after the Batcher is unmounted,\n  // notifyBatcherOfChange will still be called. An error gets thrown whenever\n  // setState is called after a component is already unmounted, so this sets\n  // notifyBatcherOfChange to be a no-op.\n\n  useEffect(function () {\n    return function () {\n      setNotifyBatcherOfChange(function () {});\n    };\n  }, [setNotifyBatcherOfChange]);\n  return null;\n}\n\nif (process.env.NODE_ENV !== \"production\") {\n  if (typeof window !== 'undefined' && !window.$recoilDebugStates) {\n    window.$recoilDebugStates = [];\n  }\n} // When removing this deprecated function, remove stateBySettingRecoilValue\n// which will no longer be needed.\n\n\nfunction initialStoreState_DEPRECATED(store, initializeState) {\n  var initial = makeEmptyStoreState$2();\n  initializeState({\n    // $FlowFixMe[escaped-generic]\n    set: function set(atom, value) {\n      var state = initial.currentTree;\n      var writes = setNodeValue$2(store, state, atom.key, value);\n      var writtenNodes = new Set(writes.keys());\n      var nonvalidatedAtoms = state.nonvalidatedAtoms.clone();\n\n      var _iterator32 = _createForOfIteratorHelper(writtenNodes),\n          _step32;\n\n      try {\n        for (_iterator32.s(); !(_step32 = _iterator32.n()).done;) {\n          var n = _step32.value;\n          nonvalidatedAtoms.delete(n);\n        }\n      } catch (err) {\n        _iterator32.e(err);\n      } finally {\n        _iterator32.f();\n      }\n\n      initial.currentTree = _objectSpread(_objectSpread({}, state), {}, {\n        dirtyAtoms: Recoil_unionSets(state.dirtyAtoms, writtenNodes),\n        atomValues: applyAtomValueWrites$1(state.atomValues, writes),\n        // NB: PLEASE un-export applyAtomValueWrites when deleting this code\n        nonvalidatedAtoms: nonvalidatedAtoms\n      });\n    },\n    setUnvalidatedAtomValues: function setUnvalidatedAtomValues(atomValues) {\n      // FIXME replace this with a mutative loop\n      atomValues.forEach(function (v, k) {\n        initial.currentTree = setUnvalidatedAtomValue_DEPRECATED$1(initial.currentTree, k, v);\n      });\n    }\n  });\n  return initial;\n}\n\nfunction initialStoreState(initializeState) {\n  var snapshot = freshSnapshot$1().map(initializeState);\n  return snapshot.getStore_INTERNAL().getState();\n}\n\nvar nextID = 0;\n\nfunction RecoilRoot_INTERNAL(_ref16) {\n  var initializeState_DEPRECATED = _ref16.initializeState_DEPRECATED,\n      initializeState = _ref16.initializeState,\n      storeProp = _ref16.store_INTERNAL,\n      children = _ref16.children;\n\n  var _createMutableSource; // prettier-ignore\n  // @fb-only: useEffect(() => {\n  // @fb-only: if (gkx('recoil_usage_logging')) {\n  // @fb-only: try {\n  // @fb-only: RecoilUsageLogFalcoEvent.log(() => ({\n  // @fb-only: type: RecoilusagelogEvent.RECOIL_ROOT_MOUNTED,\n  // @fb-only: path: URI.getRequestURI().getPath(),\n  // @fb-only: }));\n  // @fb-only: } catch {\n  // @fb-only: recoverableViolation(\n  // @fb-only: 'Error when logging Recoil Usage event',\n  // @fb-only: 'recoil',\n  // @fb-only: );\n  // @fb-only: }\n  // @fb-only: }\n  // @fb-only: }, []);\n\n\n  var storeState; // eslint-disable-line prefer-const\n\n  var getGraph = function getGraph(version) {\n    var graphs = storeState.current.graphsByVersion;\n\n    if (graphs.has(version)) {\n      return Recoil_nullthrows(graphs.get(version));\n    }\n\n    var newGraph = graph$3();\n    graphs.set(version, newGraph);\n    return newGraph;\n  };\n\n  var subscribeToTransactions = function subscribeToTransactions(callback, key) {\n    if (key == null) {\n      // Global transaction subscriptions\n      var _storeRef$current$get = storeRef.current.getState(),\n          transactionSubscriptions = _storeRef$current$get.transactionSubscriptions;\n\n      var id = nextID++;\n      transactionSubscriptions.set(id, callback);\n      return {\n        release: function release() {\n          transactionSubscriptions.delete(id);\n        }\n      };\n    } else {\n      // Node-specific transaction subscriptions:\n      var _storeRef$current$get2 = storeRef.current.getState(),\n          nodeTransactionSubscriptions = _storeRef$current$get2.nodeTransactionSubscriptions;\n\n      if (!nodeTransactionSubscriptions.has(key)) {\n        nodeTransactionSubscriptions.set(key, new Map());\n      }\n\n      var _id2 = nextID++;\n\n      Recoil_nullthrows(nodeTransactionSubscriptions.get(key)).set(_id2, callback);\n      return {\n        release: function release() {\n          var subs = nodeTransactionSubscriptions.get(key);\n\n          if (subs) {\n            subs.delete(_id2);\n\n            if (subs.size === 0) {\n              nodeTransactionSubscriptions.delete(key);\n            }\n          }\n        }\n      };\n    }\n  };\n\n  var addTransactionMetadata = function addTransactionMetadata(metadata) {\n    startNextTreeIfNeeded(storeRef.current);\n\n    for (var _i3 = 0, _Object$keys = Object.keys(metadata); _i3 < _Object$keys.length; _i3++) {\n      var k = _Object$keys[_i3];\n      Recoil_nullthrows(storeRef.current.getState().nextTree).transactionMetadata[k] = metadata[k];\n    }\n  };\n\n  var replaceState = function replaceState(replacer) {\n    var storeState = storeRef.current.getState();\n    startNextTreeIfNeeded(storeRef.current); // Use replacer to get the next state:\n\n    var nextTree = Recoil_nullthrows(storeState.nextTree);\n    var replaced;\n\n    try {\n      stateReplacerIsBeingExecuted = true;\n      replaced = replacer(nextTree);\n    } finally {\n      stateReplacerIsBeingExecuted = false;\n    }\n\n    if (replaced === nextTree) {\n      return;\n    }\n\n    if (process.env.NODE_ENV !== \"production\") {\n      if (typeof window !== 'undefined') {\n        window.$recoilDebugStates.push(replaced); // TODO this shouldn't happen here because it's not batched\n      }\n    } // Save changes to nextTree and schedule a React update:\n\n\n    storeState.nextTree = replaced;\n\n    if (Recoil_gkx_1('recoil_early_rendering_2021')) {\n      notifyComponents(store, storeState, replaced);\n    }\n\n    Recoil_nullthrows(notifyBatcherOfChange.current)();\n  };\n\n  var notifyBatcherOfChange = useRef(null);\n  var setNotifyBatcherOfChange = useCallback(function (x) {\n    notifyBatcherOfChange.current = x;\n  }, [notifyBatcherOfChange]); // FIXME T2710559282599660\n\n  var createMutableSource = (_createMutableSource = react.createMutableSource) !== null && _createMutableSource !== void 0 ? _createMutableSource : // flowlint-line unclear-type:off\n  react.unstable_createMutableSource; // flowlint-line unclear-type:off\n\n  var store = storeProp !== null && storeProp !== void 0 ? storeProp : {\n    getState: function getState() {\n      return storeState.current;\n    },\n    replaceState: replaceState,\n    getGraph: getGraph,\n    subscribeToTransactions: subscribeToTransactions,\n    addTransactionMetadata: addTransactionMetadata\n  };\n  var storeRef = useRef(store);\n  storeState = useRef(initializeState_DEPRECATED != null ? initialStoreState_DEPRECATED(store, initializeState_DEPRECATED) : initializeState != null ? initialStoreState(initializeState) : makeEmptyStoreState$2());\n  var mutableSource = useMemo(function () {\n    return createMutableSource ? createMutableSource(storeState, function () {\n      return storeState.current.currentTree.version;\n    }) : null;\n  }, [createMutableSource, storeState]); // Cleanup when the <RecoilRoot> is unmounted\n\n  useEffect(function () {\n    return function () {\n      var _iterator33 = _createForOfIteratorHelper(storeRef.current.getState().knownAtoms),\n          _step33;\n\n      try {\n        for (_iterator33.s(); !(_step33 = _iterator33.n()).done;) {\n          var atomKey = _step33.value;\n          cleanUpNode$2(storeRef.current, atomKey);\n        }\n      } catch (err) {\n        _iterator33.e(err);\n      } finally {\n        _iterator33.f();\n      }\n    };\n  }, []);\n  return /*#__PURE__*/react.createElement(AppContext.Provider, {\n    value: storeRef\n  }, /*#__PURE__*/react.createElement(MutableSourceContext.Provider, {\n    value: mutableSource\n  }, /*#__PURE__*/react.createElement(Batcher, {\n    setNotifyBatcherOfChange: setNotifyBatcherOfChange\n  }), children));\n}\n\nfunction RecoilRoot(props) {\n  var override = props.override,\n      propsExceptOverride = _objectWithoutProperties(props, _excluded);\n\n  var ancestorStoreRef = useStoreRef();\n\n  if (override === false && ancestorStoreRef.current !== defaultStore) {\n    // If ancestorStoreRef.current !== defaultStore, it means that this\n    // RecoilRoot is not nested within another.\n    return props.children;\n  }\n\n  return /*#__PURE__*/react.createElement(RecoilRoot_INTERNAL, propsExceptOverride);\n}\n\nvar Recoil_RecoilRoot_react = {\n  useStoreRef: useStoreRef,\n  useRecoilMutableSource: useRecoilMutableSource,\n  RecoilRoot: RecoilRoot,\n  notifyComponents_FOR_TESTING: notifyComponents,\n  sendEndOfBatchNotifications_FOR_TESTING: sendEndOfBatchNotifications\n};\nvar loadableWithValue$1 = Recoil_Loadable.loadableWithValue;\nvar DEFAULT_VALUE$2 = Recoil_Node.DEFAULT_VALUE,\n    getNode$3 = Recoil_Node.getNode;\nvar copyTreeState$1 = Recoil_RecoilValueInterface.copyTreeState,\n    getRecoilValueAsLoadable$2 = Recoil_RecoilValueInterface.getRecoilValueAsLoadable,\n    invalidateDownstreams$1 = Recoil_RecoilValueInterface.invalidateDownstreams,\n    writeLoadableToTreeState$1 = Recoil_RecoilValueInterface.writeLoadableToTreeState;\n\nfunction isAtom(recoilValue) {\n  return getNode$3(recoilValue.key).nodeType === 'atom';\n}\n\nvar TransactionInterfaceImpl = /*#__PURE__*/function () {\n  function TransactionInterfaceImpl(store, treeState) {\n    var _this6 = this;\n\n    _classCallCheck(this, TransactionInterfaceImpl);\n\n    _defineProperty(this, \"_store\", void 0);\n\n    _defineProperty(this, \"_treeState\", void 0);\n\n    _defineProperty(this, \"_changes\", void 0);\n\n    _defineProperty(this, \"get\", function (recoilValue) {\n      if (_this6._changes.has(recoilValue.key)) {\n        // $FlowFixMe[incompatible-return]\n        return _this6._changes.get(recoilValue.key);\n      }\n\n      if (!isAtom(recoilValue)) {\n        throw new Error('Reading selectors within atomicUpdate is not supported');\n      }\n\n      var loadable = getRecoilValueAsLoadable$2(_this6._store, recoilValue, _this6._treeState);\n\n      if (loadable.state === 'hasValue') {\n        return loadable.contents;\n      } else if (loadable.state === 'hasError') {\n        throw loadable.contents;\n      } else {\n        throw new Error(\"Expected Recoil atom \".concat(recoilValue.key, \" to have a value, but it is in a loading state.\"));\n      }\n    });\n\n    _defineProperty(this, \"set\", function (recoilState, valueOrUpdater) {\n      if (!isAtom(recoilState)) {\n        throw new Error('Setting selectors within atomicUpdate is not supported');\n      }\n\n      if (typeof valueOrUpdater === 'function') {\n        var current = _this6.get(recoilState);\n\n        _this6._changes.set(recoilState.key, valueOrUpdater(current)); // flowlint-line unclear-type:off\n\n      } else {\n        _this6._changes.set(recoilState.key, valueOrUpdater);\n      }\n    });\n\n    _defineProperty(this, \"reset\", function (recoilState) {\n      _this6.set(recoilState, DEFAULT_VALUE$2);\n    });\n\n    this._store = store;\n    this._treeState = treeState;\n    this._changes = new Map();\n  } // Allow destructing\n  // eslint-disable-next-line fb-www/extra-arrow-initializer\n\n\n  _createClass(TransactionInterfaceImpl, [{\n    key: \"newTreeState_INTERNAL\",\n    value: function newTreeState_INTERNAL() {\n      if (this._changes.size === 0) {\n        return this._treeState;\n      }\n\n      var newState = copyTreeState$1(this._treeState);\n\n      var _iterator34 = _createForOfIteratorHelper(this._changes),\n          _step34;\n\n      try {\n        for (_iterator34.s(); !(_step34 = _iterator34.n()).done;) {\n          var _step34$value = _slicedToArray(_step34.value, 2),\n              k = _step34$value[0],\n              v = _step34$value[1];\n\n          writeLoadableToTreeState$1(newState, k, loadableWithValue$1(v));\n        }\n      } catch (err) {\n        _iterator34.e(err);\n      } finally {\n        _iterator34.f();\n      }\n\n      invalidateDownstreams$1(this._store, newState);\n      return newState;\n    }\n  }]);\n\n  return TransactionInterfaceImpl;\n}();\n\nfunction atomicUpdater(store) {\n  return function (fn) {\n    store.replaceState(function (treeState) {\n      var changeset = new TransactionInterfaceImpl(store, treeState);\n      fn(changeset);\n      return changeset.newTreeState_INTERNAL();\n    });\n  };\n}\n\nvar Recoil_AtomicUpdates = {\n  atomicUpdater: atomicUpdater\n};\nvar Recoil_AtomicUpdates_1 = Recoil_AtomicUpdates.atomicUpdater;\nvar Recoil_AtomicUpdates$1 = /*#__PURE__*/Object.freeze({\n  __proto__: null,\n  atomicUpdater: Recoil_AtomicUpdates_1\n});\n/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @emails oncall+recoil\n * \n * @format\n */\n\n/**\n * Returns a map containing all of the keys + values from the original map where\n * the given callback returned true.\n */\n\nfunction filterMap(map, callback) {\n  var result = new Map();\n\n  var _iterator35 = _createForOfIteratorHelper(map),\n      _step35;\n\n  try {\n    for (_iterator35.s(); !(_step35 = _iterator35.n()).done;) {\n      var _step35$value = _slicedToArray(_step35.value, 2),\n          key = _step35$value[0],\n          value = _step35$value[1];\n\n      if (callback(value, key)) {\n        result.set(key, value);\n      }\n    }\n  } catch (err) {\n    _iterator35.e(err);\n  } finally {\n    _iterator35.f();\n  }\n\n  return result;\n}\n\nvar Recoil_filterMap = filterMap;\n/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @emails oncall+recoil\n * \n * @format\n */\n\n/**\n * Returns a set containing all of the values from the original set where\n * the given callback returned true.\n */\n\nfunction filterSet(set, callback) {\n  var result = new Set();\n\n  var _iterator36 = _createForOfIteratorHelper(set),\n      _step36;\n\n  try {\n    for (_iterator36.s(); !(_step36 = _iterator36.n()).done;) {\n      var value = _step36.value;\n\n      if (callback(value)) {\n        result.add(value);\n      }\n    }\n  } catch (err) {\n    _iterator36.e(err);\n  } finally {\n    _iterator36.f();\n  }\n\n  return result;\n}\n\nvar Recoil_filterSet = filterSet;\n/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @emails oncall+recoil\n * \n * @format\n */\n\nfunction invariant(condition, message) {\n  if (!condition) {\n    throw new Error(message);\n  }\n}\n\nvar invariant_1 = invariant; // @oss-only\n\nvar Recoil_invariant = invariant_1;\n/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @emails oncall+recoil\n * \n * @format\n */\n\nfunction mergeMaps() {\n  var result = new Map();\n\n  for (var _len5 = arguments.length, maps = new Array(_len5), _key8 = 0; _key8 < _len5; _key8++) {\n    maps[_key8] = arguments[_key8];\n  }\n\n  for (var i = 0; i < maps.length; i++) {\n    var iterator = maps[i].keys();\n    var nextKey = void 0;\n\n    while (!(nextKey = iterator.next()).done) {\n      // $FlowFixMe[incompatible-call] - map/iterator knows nothing about flow types\n      result.set(nextKey.value, maps[i].get(nextKey.value));\n    }\n  }\n  /* $FlowFixMe[incompatible-return] (>=0.66.0 site=www,mobile) This comment\n   * suppresses an error found when Flow v0.66 was deployed. To see the error\n   * delete this comment and run Flow. */\n\n\n  return result;\n}\n\nvar Recoil_mergeMaps = mergeMaps;\n/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @emails oncall+recoil\n * \n * @format\n */\n\nfunction shallowArrayEqual(a, b) {\n  if (a === b) {\n    return true;\n  }\n\n  if (a.length !== b.length) {\n    return false;\n  }\n\n  for (var i = 0, l = a.length; i < l; i++) {\n    if (a[i] !== b[i]) {\n      return false;\n    }\n  }\n\n  return true;\n}\n\nvar Recoil_shallowArrayEqual = shallowArrayEqual;\n/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * MIT License\n *\n * Copyright (c) 2014-2019 Georg Tavonius\n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to deal\n * in the Software without restriction, including without limitation the rights\n * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell\n * copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in all\n * copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\n * SOFTWARE.\n *\n * @emails oncall+recoil\n * \n * @format\n */\n\nvar UNKNOWN_FUNCTION = '<unknown>';\n/**\n * This parses the different stack traces and puts them into one format\n * This borrows heavily from TraceKit (https://github.com/csnover/TraceKit)\n */\n\nfunction stackTraceParser(stackString) {\n  var lines = stackString.split('\\n');\n  return lines.reduce(function (stack, line) {\n    var parseResult = parseChrome(line) || parseWinjs(line) || parseGecko(line) || parseNode(line) || parseJSC(line);\n\n    if (parseResult) {\n      stack.push(parseResult);\n    }\n\n    return stack;\n  }, []);\n}\n\nvar chromeRe = /^\\s*at (.*?) ?\\(((?:file|https?|blob|chrome-extension|native|eval|webpack|<anonymous>|\\/|[a-z]:\\\\|\\\\\\\\).*?)(?::(\\d+))?(?::(\\d+))?\\)?\\s*$/i;\nvar chromeEvalRe = /\\((\\S*)(?::(\\d+))(?::(\\d+))\\)/;\n\nfunction parseChrome(line) {\n  var parts = chromeRe.exec(line);\n\n  if (!parts) {\n    return null;\n  }\n\n  var isNative = parts[2] && parts[2].indexOf('native') === 0; // start of line\n\n  var isEval = parts[2] && parts[2].indexOf('eval') === 0; // start of line\n\n  var submatch = chromeEvalRe.exec(parts[2]);\n\n  if (isEval && submatch != null) {\n    // throw out eval line/column and use top-most line/column number\n    parts[2] = submatch[1]; // url\n\n    parts[3] = submatch[2]; // line\n\n    parts[4] = submatch[3]; // column\n  }\n\n  return {\n    file: !isNative ? parts[2] : null,\n    methodName: parts[1] || UNKNOWN_FUNCTION,\n    arguments: isNative ? [parts[2]] : [],\n    lineNumber: parts[3] ? +parts[3] : null,\n    column: parts[4] ? +parts[4] : null\n  };\n}\n\nvar winjsRe = /^\\s*at (?:((?:\\[object object\\])?.+) )?\\(?((?:file|ms-appx|https?|webpack|blob):.*?):(\\d+)(?::(\\d+))?\\)?\\s*$/i;\n\nfunction parseWinjs(line) {\n  var parts = winjsRe.exec(line);\n\n  if (!parts) {\n    return null;\n  }\n\n  return {\n    file: parts[2],\n    methodName: parts[1] || UNKNOWN_FUNCTION,\n    arguments: [],\n    lineNumber: +parts[3],\n    column: parts[4] ? +parts[4] : null\n  };\n}\n\nvar geckoRe = /^\\s*(.*?)(?:\\((.*?)\\))?(?:^|@)((?:file|https?|blob|chrome|webpack|resource|\\[native).*?|[^@]*bundle)(?::(\\d+))?(?::(\\d+))?\\s*$/i;\nvar geckoEvalRe = /(\\S+) line (\\d+)(?: > eval line \\d+)* > eval/i;\n\nfunction parseGecko(line) {\n  var parts = geckoRe.exec(line);\n\n  if (!parts) {\n    return null;\n  }\n\n  var isEval = parts[3] && parts[3].indexOf(' > eval') > -1;\n  var submatch = geckoEvalRe.exec(parts[3]);\n\n  if (isEval && submatch != null) {\n    // throw out eval line/column and use top-most line number\n    parts[3] = submatch[1];\n    parts[4] = submatch[2];\n    parts[5] = null; // no column when eval\n  }\n\n  return {\n    file: parts[3],\n    methodName: parts[1] || UNKNOWN_FUNCTION,\n    arguments: parts[2] ? parts[2].split(',') : [],\n    lineNumber: parts[4] ? +parts[4] : null,\n    column: parts[5] ? +parts[5] : null\n  };\n}\n\nvar javaScriptCoreRe = /^\\s*(?:([^@]*)(?:\\((.*?)\\))?@)?(\\S.*?):(\\d+)(?::(\\d+))?\\s*$/i;\n\nfunction parseJSC(line) {\n  var parts = javaScriptCoreRe.exec(line);\n\n  if (!parts) {\n    return null;\n  }\n\n  return {\n    file: parts[3],\n    methodName: parts[1] || UNKNOWN_FUNCTION,\n    arguments: [],\n    lineNumber: +parts[4],\n    column: parts[5] ? +parts[5] : null\n  };\n}\n\nvar nodeRe = /^\\s*at (?:((?:\\[object object\\])?[^\\\\/]+(?: \\[as \\S+\\])?) )?\\(?(.*?):(\\d+)(?::(\\d+))?\\)?\\s*$/i;\n\nfunction parseNode(line) {\n  var parts = nodeRe.exec(line);\n\n  if (!parts) {\n    return null;\n  }\n\n  return {\n    file: parts[2],\n    methodName: parts[1] || UNKNOWN_FUNCTION,\n    arguments: [],\n    lineNumber: +parts[3],\n    column: parts[4] ? +parts[4] : null\n  };\n}\n\nvar Recoil_stackTraceParser = stackTraceParser;\nvar useRef$1 = react.useRef;\n\nfunction useComponentName() {\n  var nameRef = useRef$1();\n\n  if (process.env.NODE_ENV !== \"production\") {\n    if (Recoil_gkx_1('recoil_infer_component_names')) {\n      var _nameRef$current;\n\n      if (nameRef.current === undefined) {\n        // There is no blessed way to determine the calling React component from\n        // within a hook. This hack uses the fact that hooks must start with 'use'\n        // and that hooks are either called by React Components or other hooks. It\n        // follows therefore, that to find the calling component, you simply need\n        // to look down the stack and find the first function which doesn't start\n        // with 'use'. We are only enabling this in dev for now, since once the\n        // codebase is minified, the naming assumptions no longer hold true.\n        var frames = Recoil_stackTraceParser(new Error().stack);\n\n        var _iterator37 = _createForOfIteratorHelper(frames),\n            _step37;\n\n        try {\n          for (_iterator37.s(); !(_step37 = _iterator37.n()).done;) {\n            var methodName = _step37.value.methodName;\n\n            // I observed cases where the frame was of the form 'Object.useXXX'\n            // hence why I'm searching for hooks following a word boundary\n            if (!methodName.match(/\\buse[^\\b]+$/)) {\n              return nameRef.current = methodName;\n            }\n          }\n        } catch (err) {\n          _iterator37.e(err);\n        } finally {\n          _iterator37.f();\n        }\n\n        nameRef.current = null;\n      }\n\n      return (_nameRef$current = nameRef.current) !== null && _nameRef$current !== void 0 ? _nameRef$current : '<unable to determine component name>';\n    }\n  } // @fb-only: return \"<component name only available when both in dev mode and when passing GK 'recoil_infer_component_names'>\";\n\n\n  return '<component name not available>'; // @oss-only\n}\n\nvar Recoil_useComponentName = useComponentName;\nvar atomicUpdater$1 = Recoil_AtomicUpdates$1.atomicUpdater;\nvar batchUpdates$2 = Recoil_Batching.batchUpdates;\nvar DEFAULT_VALUE$3 = Recoil_Node.DEFAULT_VALUE,\n    getNode$4 = Recoil_Node.getNode,\n    nodes$1 = Recoil_Node.nodes;\nvar useRecoilMutableSource$1 = Recoil_RecoilRoot_react.useRecoilMutableSource,\n    useStoreRef$1 = Recoil_RecoilRoot_react.useStoreRef;\nvar isRecoilValue$2 = Recoil_RecoilValue$1.isRecoilValue;\nvar AbstractRecoilValue$3 = Recoil_RecoilValueInterface.AbstractRecoilValue,\n    getRecoilValueAsLoadable$3 = Recoil_RecoilValueInterface.getRecoilValueAsLoadable,\n    setRecoilValue$2 = Recoil_RecoilValueInterface.setRecoilValue,\n    setRecoilValueLoadable$1 = Recoil_RecoilValueInterface.setRecoilValueLoadable,\n    setUnvalidatedRecoilValue$2 = Recoil_RecoilValueInterface.setUnvalidatedRecoilValue,\n    subscribeToRecoilValue$1 = Recoil_RecoilValueInterface.subscribeToRecoilValue;\nvar updateRetainCount$2 = Recoil_Retention.updateRetainCount;\nvar RetentionZone$3 = Recoil_RetentionZone.RetentionZone;\nvar Snapshot$1 = Recoil_Snapshot$1.Snapshot,\n    cloneSnapshot$1 = Recoil_Snapshot$1.cloneSnapshot;\nvar setByAddingToSet$2 = Recoil_CopyOnWrite.setByAddingToSet;\nvar isSSR$2 = Recoil_Environment.isSSR;\nvar mutableSourceExists$2 = Recoil_mutableSource.mutableSourceExists,\n    useMutableSource$1 = Recoil_mutableSource.useMutableSource;\nvar useCallback$1 = react.useCallback,\n    useEffect$1 = react.useEffect,\n    useMemo$1 = react.useMemo,\n    useRef$2 = react.useRef,\n    useState$1 = react.useState; // Components that aren't mounted after suspending for this long will be assumed\n// to be discarded and their resources released.\n\nvar SUSPENSE_TIMEOUT_MS = 120000;\n\nfunction handleLoadable(loadable, recoilValue, storeRef) {\n  // We can't just throw the promise we are waiting on to Suspense.  If the\n  // upstream dependencies change it may produce a state in which the component\n  // can render, but it would still be suspended on a Promise that may never resolve.\n  if (loadable.state === 'hasValue') {\n    return loadable.contents;\n  } else if (loadable.state === 'loading') {\n    var promise = new Promise(function (resolve) {\n      storeRef.current.getState().suspendedComponentResolvers.add(resolve);\n    }); // $FlowFixMe Flow(prop-missing) for integrating with tools that inspect thrown promises @fb-only\n    // @fb-only: promise.displayName = `Recoil State: ${recoilValue.key}`;\n\n    throw promise;\n  } else if (loadable.state === 'hasError') {\n    throw loadable.contents;\n  } else {\n    var err = new Error(\"Invalid value of loadable atom \\\"\".concat(recoilValue.key, \"\\\"\"));\n    throw err;\n  }\n}\n\nfunction validateRecoilValue(recoilValue, hookName) {\n  if (!isRecoilValue$2(recoilValue)) {\n    throw new Error(\"Invalid argument to \".concat(hookName, \": expected an atom or selector but got \").concat(String(recoilValue)));\n  }\n}\n/**\n * Various things are broken with useRecoilInterface, particularly concurrent mode\n * and memory management. They will not be fixed.\n * */\n\n\nfunction useRecoilInterface_DEPRECATED() {\n  var storeRef = useStoreRef$1();\n\n  var _useState$ = useState$1([]),\n      _useState$2 = _slicedToArray(_useState$, 2),\n      _ = _useState$2[0],\n      forceUpdate = _useState$2[1];\n\n  var recoilValuesUsed = useRef$2(new Set());\n  recoilValuesUsed.current = new Set(); // Track the RecoilValues used just during this render\n\n  var previousSubscriptions = useRef$2(new Set());\n  var subscriptions = useRef$2(new Map());\n  var unsubscribeFrom = useCallback$1(function (key) {\n    var sub = subscriptions.current.get(key);\n\n    if (sub) {\n      sub.release();\n      subscriptions.current.delete(key);\n    }\n  }, [subscriptions]);\n  var componentName = Recoil_useComponentName();\n  useEffect$1(function () {\n    var store = storeRef.current;\n\n    function updateState(_state, key) {\n      if (!subscriptions.current.has(key)) {\n        return;\n      }\n\n      forceUpdate([]);\n    }\n\n    Recoil_differenceSets(recoilValuesUsed.current, previousSubscriptions.current).forEach(function (key) {\n      if (subscriptions.current.has(key)) {\n        Recoil_expectationViolation(\"Double subscription to RecoilValue \\\"\".concat(key, \"\\\"\"));\n        return;\n      }\n\n      var sub = subscribeToRecoilValue$1(store, new AbstractRecoilValue$3(key), function (state) {\n        updateState(state, key);\n      }, componentName);\n      subscriptions.current.set(key, sub);\n      /**\n       * Since we're subscribing in an effect we need to update to the latest\n       * value of the atom since it may have changed since we rendered. We can\n       * go ahead and do that now, unless we're in the middle of a batch --\n       * in which case we should do it at the end of the batch, due to the\n       * following edge case: Suppose an atom is updated in another useEffect\n       * of this same component. Then the following sequence of events occur:\n       * 1. Atom is updated and subs fired (but we may not be subscribed\n       *    yet depending on order of effects, so we miss this) Updated value\n       *    is now in nextTree, but not currentTree.\n       * 2. This effect happens. We subscribe and update.\n       * 3. From the update we re-render and read currentTree, with old value.\n       * 4. Batcher's effect sets currentTree to nextTree.\n       * In this sequence we miss the update. To avoid that, add the update\n       * to queuedComponentCallback if a batch is in progress.\n       */\n      // FIXME delete queuedComponentCallbacks_DEPRECATED when deleting useInterface.\n\n      var state = store.getState();\n\n      if (state.nextTree) {\n        store.getState().queuedComponentCallbacks_DEPRECATED.push(function () {\n          updateState(store.getState(), key);\n        });\n      } else {\n        updateState(store.getState(), key);\n      }\n    });\n    Recoil_differenceSets(previousSubscriptions.current, recoilValuesUsed.current).forEach(function (key) {\n      unsubscribeFrom(key);\n    });\n    previousSubscriptions.current = recoilValuesUsed.current;\n  });\n  useEffect$1(function () {\n    var subs = subscriptions.current;\n    return function () {\n      return subs.forEach(function (_, key) {\n        return unsubscribeFrom(key);\n      });\n    };\n  }, [unsubscribeFrom]);\n  return useMemo$1(function () {\n    function useSetRecoilState(recoilState) {\n      if (process.env.NODE_ENV !== \"production\") {\n        // $FlowFixMe[escaped-generic]\n        validateRecoilValue(recoilState, 'useSetRecoilState');\n      }\n\n      return function (newValueOrUpdater) {\n        setRecoilValue$2(storeRef.current, recoilState, newValueOrUpdater);\n      };\n    }\n\n    function useResetRecoilState(recoilState) {\n      if (process.env.NODE_ENV !== \"production\") {\n        // $FlowFixMe[escaped-generic]\n        validateRecoilValue(recoilState, 'useResetRecoilState');\n      }\n\n      return function () {\n        return setRecoilValue$2(storeRef.current, recoilState, DEFAULT_VALUE$3);\n      };\n    }\n\n    function useRecoilValueLoadable(recoilValue) {\n      var _storeState$nextTree;\n\n      if (process.env.NODE_ENV !== \"production\") {\n        // $FlowFixMe[escaped-generic]\n        validateRecoilValue(recoilValue, 'useRecoilValueLoadable');\n      }\n\n      if (!recoilValuesUsed.current.has(recoilValue.key)) {\n        recoilValuesUsed.current = setByAddingToSet$2(recoilValuesUsed.current, recoilValue.key);\n      } // TODO Restore optimization to memoize lookup\n\n\n      var storeState = storeRef.current.getState();\n      return getRecoilValueAsLoadable$3(storeRef.current, recoilValue, Recoil_gkx_1('recoil_early_rendering_2021') ? (_storeState$nextTree = storeState.nextTree) !== null && _storeState$nextTree !== void 0 ? _storeState$nextTree : storeState.currentTree : storeState.currentTree);\n    }\n\n    function useRecoilValue(recoilValue) {\n      if (process.env.NODE_ENV !== \"production\") {\n        // $FlowFixMe[escaped-generic]\n        validateRecoilValue(recoilValue, 'useRecoilValue');\n      }\n\n      var loadable = useRecoilValueLoadable(recoilValue);\n      return handleLoadable(loadable, recoilValue, storeRef);\n    }\n\n    function useRecoilState(recoilState) {\n      if (process.env.NODE_ENV !== \"production\") {\n        // $FlowFixMe[escaped-generic]\n        validateRecoilValue(recoilState, 'useRecoilState');\n      }\n\n      return [useRecoilValue(recoilState), useSetRecoilState(recoilState)];\n    }\n\n    function useRecoilStateLoadable(recoilState) {\n      if (process.env.NODE_ENV !== \"production\") {\n        // $FlowFixMe[escaped-generic]\n        validateRecoilValue(recoilState, 'useRecoilStateLoadable');\n      }\n\n      return [useRecoilValueLoadable(recoilState), useSetRecoilState(recoilState)];\n    }\n\n    return {\n      getRecoilValue: useRecoilValue,\n      getRecoilValueLoadable: useRecoilValueLoadable,\n      getRecoilState: useRecoilState,\n      getRecoilStateLoadable: useRecoilStateLoadable,\n      getSetRecoilState: useSetRecoilState,\n      getResetRecoilState: useResetRecoilState\n    };\n  }, [recoilValuesUsed, storeRef]);\n}\n\nvar recoilComponentGetRecoilValueCount_FOR_TESTING = {\n  current: 0\n};\n\nfunction useRecoilValueLoadable_MUTABLESOURCE(recoilValue) {\n  if (process.env.NODE_ENV !== \"production\") {\n    // $FlowFixMe[escaped-generic]\n    validateRecoilValue(recoilValue, 'useRecoilValueLoadable');\n  }\n\n  var storeRef = useStoreRef$1();\n  var getLoadable = useCallback$1(function () {\n    var _storeState$nextTree2;\n\n    var store = storeRef.current;\n    var storeState = store.getState();\n    var treeState = Recoil_gkx_1('recoil_early_rendering_2021') ? (_storeState$nextTree2 = storeState.nextTree) !== null && _storeState$nextTree2 !== void 0 ? _storeState$nextTree2 : storeState.currentTree : storeState.currentTree;\n    return getRecoilValueAsLoadable$3(store, recoilValue, treeState);\n  }, [storeRef, recoilValue]);\n  var getLoadableWithTesting = useCallback$1(function () {\n    if (process.env.NODE_ENV !== \"production\") {\n      recoilComponentGetRecoilValueCount_FOR_TESTING.current++;\n    }\n\n    return getLoadable();\n  }, [getLoadable]);\n  var componentName = Recoil_useComponentName();\n  var subscribe = useCallback$1(function (_storeState, callback) {\n    var store = storeRef.current;\n    var subscription = subscribeToRecoilValue$1(store, recoilValue, function () {\n      if (!Recoil_gkx_1('recoil_suppress_rerender_in_callback')) {\n        return callback();\n      } // Only re-render if the value has changed.\n      // This will evaluate the atom/selector now as well as when the\n      // component renders, but that may help with prefetching.\n\n\n      var newLoadable = getLoadable();\n\n      if (!prevLoadableRef.current.is(newLoadable)) {\n        callback();\n      } // If the component is suspended then the effect setting prevLoadableRef\n      // will not run.  So, set the previous value here when its subscription\n      // is fired to wake it up.  We can't just rely on this, though, because\n      // this only executes when an atom/selector is dirty and the atom/selector\n      // passed to the hook can dynamically change.\n\n\n      prevLoadableRef.current = newLoadable;\n    }, componentName);\n    return subscription.release;\n  }, [storeRef, recoilValue, componentName, getLoadable]);\n  var source = useRecoilMutableSource$1();\n  var loadable = useMutableSource$1(source, getLoadableWithTesting, subscribe);\n  var prevLoadableRef = useRef$2(loadable);\n  useEffect$1(function () {\n    prevLoadableRef.current = loadable;\n  });\n  return loadable;\n}\n\nfunction useRecoilValueLoadable_LEGACY(recoilValue) {\n  if (process.env.NODE_ENV !== \"production\") {\n    // $FlowFixMe[escaped-generic]\n    validateRecoilValue(recoilValue, 'useRecoilValueLoadable');\n  }\n\n  var storeRef = useStoreRef$1();\n\n  var _useState$3 = useState$1([]),\n      _useState$4 = _slicedToArray(_useState$3, 2),\n      _ = _useState$4[0],\n      forceUpdate = _useState$4[1];\n\n  var componentName = Recoil_useComponentName();\n  useEffect$1(function () {\n    var store = storeRef.current;\n    var storeState = store.getState();\n    var subscription = subscribeToRecoilValue$1(store, recoilValue, function (_state) {\n      var _prevLoadableRef$curr;\n\n      if (!Recoil_gkx_1('recoil_suppress_rerender_in_callback')) {\n        return forceUpdate([]);\n      }\n\n      var newLoadable = getRecoilValueAsLoadable$3(store, recoilValue, store.getState().currentTree);\n\n      if (!((_prevLoadableRef$curr = prevLoadableRef.current) === null || _prevLoadableRef$curr === void 0 ? void 0 : _prevLoadableRef$curr.is(newLoadable))) {\n        forceUpdate(newLoadable);\n      }\n\n      prevLoadableRef.current = newLoadable;\n    }, componentName);\n    /**\n     * Since we're subscribing in an effect we need to update to the latest\n     * value of the atom since it may have changed since we rendered. We can\n     * go ahead and do that now, unless we're in the middle of a batch --\n     * in which case we should do it at the end of the batch, due to the\n     * following edge case: Suppose an atom is updated in another useEffect\n     * of this same component. Then the following sequence of events occur:\n     * 1. Atom is updated and subs fired (but we may not be subscribed\n     *    yet depending on order of effects, so we miss this) Updated value\n     *    is now in nextTree, but not currentTree.\n     * 2. This effect happens. We subscribe and update.\n     * 3. From the update we re-render and read currentTree, with old value.\n     * 4. Batcher's effect sets currentTree to nextTree.\n     * In this sequence we miss the update. To avoid that, add the update\n     * to queuedComponentCallback if a batch is in progress.\n     */\n\n    if (storeState.nextTree) {\n      store.getState().queuedComponentCallbacks_DEPRECATED.push(function () {\n        prevLoadableRef.current = null;\n        forceUpdate([]);\n      });\n    } else {\n      var _prevLoadableRef$curr2;\n\n      if (!Recoil_gkx_1('recoil_suppress_rerender_in_callback')) {\n        return forceUpdate([]);\n      }\n\n      var newLoadable = getRecoilValueAsLoadable$3(store, recoilValue, store.getState().currentTree);\n\n      if (!((_prevLoadableRef$curr2 = prevLoadableRef.current) === null || _prevLoadableRef$curr2 === void 0 ? void 0 : _prevLoadableRef$curr2.is(newLoadable))) {\n        forceUpdate(newLoadable);\n      }\n\n      prevLoadableRef.current = newLoadable;\n    }\n\n    return subscription.release;\n  }, [componentName, recoilValue, storeRef]);\n  var loadable = getRecoilValueAsLoadable$3(storeRef.current, recoilValue);\n  var prevLoadableRef = useRef$2(loadable);\n  useEffect$1(function () {\n    prevLoadableRef.current = loadable;\n  });\n  return loadable;\n}\n/**\n  Like useRecoilValue(), but either returns the value if available or\n  just undefined if not available for any reason, such as pending or error.\n*/\n\n\nfunction useRecoilValueLoadable(recoilValue) {\n  if (Recoil_gkx_1('recoil_memory_managament_2020')) {\n    // eslint-disable-next-line fb-www/react-hooks\n    useRetain(recoilValue);\n  }\n\n  if (mutableSourceExists$2()) {\n    // eslint-disable-next-line fb-www/react-hooks\n    return useRecoilValueLoadable_MUTABLESOURCE(recoilValue);\n  } else {\n    // eslint-disable-next-line fb-www/react-hooks\n    return useRecoilValueLoadable_LEGACY(recoilValue);\n  }\n}\n/**\n  Returns the value represented by the RecoilValue.\n  If the value is pending, it will throw a Promise to suspend the component,\n  if the value is an error it will throw it for the nearest React error boundary.\n  This will also subscribe the component for any updates in the value.\n  */\n\n\nfunction useRecoilValue(recoilValue) {\n  if (process.env.NODE_ENV !== \"production\") {\n    // $FlowFixMe[escaped-generic]\n    validateRecoilValue(recoilValue, 'useRecoilValue');\n  }\n\n  var storeRef = useStoreRef$1();\n  var loadable = useRecoilValueLoadable(recoilValue);\n  return handleLoadable(loadable, recoilValue, storeRef);\n}\n/**\n  Returns a function that allows the value of a RecoilState to be updated, but does\n  not subscribe the component to changes to that RecoilState.\n*/\n\n\nfunction useSetRecoilState(recoilState) {\n  if (process.env.NODE_ENV !== \"production\") {\n    // $FlowFixMe[escaped-generic]\n    validateRecoilValue(recoilState, 'useSetRecoilState');\n  }\n\n  var storeRef = useStoreRef$1();\n  return useCallback$1(function (newValueOrUpdater) {\n    setRecoilValue$2(storeRef.current, recoilState, newValueOrUpdater);\n  }, [storeRef, recoilState]);\n}\n/**\n  Returns a function that will reset the value of a RecoilState to its default\n*/\n\n\nfunction useResetRecoilState(recoilState) {\n  if (process.env.NODE_ENV !== \"production\") {\n    // $FlowFixMe[escaped-generic]\n    validateRecoilValue(recoilState, 'useResetRecoilState');\n  }\n\n  var storeRef = useStoreRef$1();\n  return useCallback$1(function () {\n    setRecoilValue$2(storeRef.current, recoilState, DEFAULT_VALUE$3);\n  }, [storeRef, recoilState]);\n}\n/**\n  Equivalent to useState(). Allows the value of the RecoilState to be read and written.\n  Subsequent updates to the RecoilState will cause the component to re-render. If the\n  RecoilState is pending, this will suspend the component and initiate the\n  retrieval of the value. If evaluating the RecoilState resulted in an error, this will\n  throw the error so that the nearest React error boundary can catch it.\n*/\n\n\nfunction useRecoilState(recoilState) {\n  if (process.env.NODE_ENV !== \"production\") {\n    // $FlowFixMe[escaped-generic]\n    validateRecoilValue(recoilState, 'useRecoilState');\n  }\n\n  return [useRecoilValue(recoilState), useSetRecoilState(recoilState)];\n}\n/**\n  Like useRecoilState(), but does not cause Suspense or React error handling. Returns\n  an object that indicates whether the RecoilState is available, pending, or\n  unavailable due to an error.\n*/\n\n\nfunction useRecoilStateLoadable(recoilState) {\n  if (process.env.NODE_ENV !== \"production\") {\n    // $FlowFixMe[escaped-generic]\n    validateRecoilValue(recoilState, 'useRecoilStateLoadable');\n  }\n\n  return [useRecoilValueLoadable(recoilState), useSetRecoilState(recoilState)];\n}\n\nfunction useTransactionSubscription(callback) {\n  var storeRef = useStoreRef$1();\n  useEffect$1(function () {\n    var sub = storeRef.current.subscribeToTransactions(callback);\n    return sub.release;\n  }, [callback, storeRef]);\n}\n\nfunction externallyVisibleAtomValuesInState(state) {\n  var atomValues = state.atomValues.toMap();\n  var persistedAtomContentsValues = Recoil_mapMap(Recoil_filterMap(atomValues, function (v, k) {\n    var node = getNode$4(k);\n    var persistence = node.persistence_UNSTABLE;\n    return persistence != null && persistence.type !== 'none' && v.state === 'hasValue';\n  }), function (v) {\n    return v.contents;\n  }); // Merge in nonvalidated atoms; we may not have defs for them but they will\n  // all have persistence on or they wouldn't be there in the first place.\n\n  return Recoil_mergeMaps(state.nonvalidatedAtoms.toMap(), persistedAtomContentsValues);\n}\n/**\n  Calls the given callback after any atoms have been modified and the consequent\n  component re-renders have been committed. This is intended for persisting\n  the values of the atoms to storage. The stored values can then be restored\n  using the useSetUnvalidatedAtomValues hook.\n\n  The callback receives the following info:\n\n  atomValues: The current value of every atom that is both persistable (persistence\n              type not set to 'none') and whose value is available (not in an\n              error or loading state).\n\n  previousAtomValues: The value of every persistable and available atom before\n               the transaction began.\n\n  atomInfo: A map containing the persistence settings for each atom. Every key\n            that exists in atomValues will also exist in atomInfo.\n\n  modifiedAtoms: The set of atoms that were written to during the transaction.\n\n  transactionMetadata: Arbitrary information that was added via the\n          useSetUnvalidatedAtomValues hook. Useful for ignoring the useSetUnvalidatedAtomValues\n          transaction, to avoid loops.\n*/\n\n\nfunction useTransactionObservation_DEPRECATED(callback) {\n  useTransactionSubscription(useCallback$1(function (store) {\n    var previousTree = store.getState().previousTree;\n    var currentTree = store.getState().currentTree;\n\n    if (!previousTree) {\n      Recoil_recoverableViolation('Transaction subscribers notified without a previous tree being present -- this is a bug in Recoil');\n      previousTree = store.getState().currentTree; // attempt to trundle on\n    }\n\n    var atomValues = externallyVisibleAtomValuesInState(currentTree);\n    var previousAtomValues = externallyVisibleAtomValuesInState(previousTree);\n    var atomInfo = Recoil_mapMap(nodes$1, function (node) {\n      var _node$persistence_UNS, _node$persistence_UNS2, _node$persistence_UNS3, _node$persistence_UNS4;\n\n      return {\n        persistence_UNSTABLE: {\n          type: (_node$persistence_UNS = (_node$persistence_UNS2 = node.persistence_UNSTABLE) === null || _node$persistence_UNS2 === void 0 ? void 0 : _node$persistence_UNS2.type) !== null && _node$persistence_UNS !== void 0 ? _node$persistence_UNS : 'none',\n          backButton: (_node$persistence_UNS3 = (_node$persistence_UNS4 = node.persistence_UNSTABLE) === null || _node$persistence_UNS4 === void 0 ? void 0 : _node$persistence_UNS4.backButton) !== null && _node$persistence_UNS3 !== void 0 ? _node$persistence_UNS3 : false\n        }\n      };\n    }); // Filter on existance in atomValues so that externally-visible rules\n    // are also applied to modified atoms (specifically exclude selectors):\n\n    var modifiedAtoms = Recoil_filterSet(currentTree.dirtyAtoms, function (k) {\n      return atomValues.has(k) || previousAtomValues.has(k);\n    });\n    callback({\n      atomValues: atomValues,\n      previousAtomValues: previousAtomValues,\n      atomInfo: atomInfo,\n      modifiedAtoms: modifiedAtoms,\n      transactionMetadata: _objectSpread({}, currentTree.transactionMetadata)\n    });\n  }, [callback]));\n}\n\nfunction useRecoilTransactionObserver(callback) {\n  useTransactionSubscription(useCallback$1(function (store) {\n    var snapshot = cloneSnapshot$1(store, 'current');\n    var previousSnapshot = cloneSnapshot$1(store, 'previous');\n    callback({\n      snapshot: snapshot,\n      previousSnapshot: previousSnapshot\n    });\n  }, [callback]));\n}\n\nfunction usePrevious(value) {\n  var ref = useRef$2();\n  useEffect$1(function () {\n    ref.current = value;\n  });\n  return ref.current;\n} // Return a snapshot of the current state and subscribe to all state changes\n\n\nfunction useRecoilSnapshot() {\n  var storeRef = useStoreRef$1();\n\n  var _useState$5 = useState$1(function () {\n    return cloneSnapshot$1(storeRef.current);\n  }),\n      _useState$6 = _slicedToArray(_useState$5, 2),\n      snapshot = _useState$6[0],\n      setSnapshot = _useState$6[1];\n\n  var previousSnapshot = usePrevious(snapshot);\n  var timeoutID = useRef$2();\n  useEffect$1(function () {\n    if (timeoutID.current && !isSSR$2) {\n      window.clearTimeout(timeoutID.current);\n    }\n\n    return snapshot.retain();\n  }, [snapshot]);\n  useTransactionSubscription(useCallback$1(function (store) {\n    return setSnapshot(cloneSnapshot$1(store));\n  }, []));\n\n  if (previousSnapshot !== snapshot && !isSSR$2) {\n    if (timeoutID.current) {\n      previousSnapshot === null || previousSnapshot === void 0 ? void 0 : previousSnapshot.release_INTERNAL();\n      window.clearTimeout(timeoutID.current);\n    }\n\n    snapshot.retain();\n    timeoutID.current = window.setTimeout(function () {\n      snapshot.release_INTERNAL();\n      timeoutID.current = null;\n    }, SUSPENSE_TIMEOUT_MS);\n  }\n\n  return snapshot;\n}\n\nfunction useGotoRecoilSnapshot() {\n  var storeRef = useStoreRef$1();\n  return useCallback$1(function (snapshot) {\n    var _storeState$nextTree3;\n\n    var storeState = storeRef.current.getState();\n    var prev = (_storeState$nextTree3 = storeState.nextTree) !== null && _storeState$nextTree3 !== void 0 ? _storeState$nextTree3 : storeState.currentTree;\n    var next = snapshot.getStore_INTERNAL().getState().currentTree;\n    batchUpdates$2(function () {\n      var keysToUpdate = new Set();\n\n      for (var _i4 = 0, _arr = [prev.atomValues.keys(), next.atomValues.keys()]; _i4 < _arr.length; _i4++) {\n        var keys = _arr[_i4];\n\n        var _iterator38 = _createForOfIteratorHelper(keys),\n            _step38;\n\n        try {\n          for (_iterator38.s(); !(_step38 = _iterator38.n()).done;) {\n            var key = _step38.value;\n\n            var _prev$atomValues$get, _next$atomValues$get;\n\n            if (((_prev$atomValues$get = prev.atomValues.get(key)) === null || _prev$atomValues$get === void 0 ? void 0 : _prev$atomValues$get.contents) !== ((_next$atomValues$get = next.atomValues.get(key)) === null || _next$atomValues$get === void 0 ? void 0 : _next$atomValues$get.contents) && getNode$4(key).shouldRestoreFromSnapshots) {\n              keysToUpdate.add(key);\n            }\n          }\n        } catch (err) {\n          _iterator38.e(err);\n        } finally {\n          _iterator38.f();\n        }\n      }\n\n      keysToUpdate.forEach(function (key) {\n        setRecoilValueLoadable$1(storeRef.current, new AbstractRecoilValue$3(key), next.atomValues.has(key) ? Recoil_nullthrows(next.atomValues.get(key)) : DEFAULT_VALUE$3);\n      });\n      storeRef.current.replaceState(function (state) {\n        return _objectSpread(_objectSpread({}, state), {}, {\n          stateID: snapshot.getID_INTERNAL()\n        });\n      });\n    });\n  }, [storeRef]);\n}\n\nfunction useSetUnvalidatedAtomValues() {\n  var storeRef = useStoreRef$1();\n  return function (values) {\n    var transactionMetadata = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {};\n    batchUpdates$2(function () {\n      storeRef.current.addTransactionMetadata(transactionMetadata);\n      values.forEach(function (value, key) {\n        return setUnvalidatedRecoilValue$2(storeRef.current, new AbstractRecoilValue$3(key), value);\n      });\n    });\n  };\n}\n\nvar Sentinel = function Sentinel() {\n  _classCallCheck(this, Sentinel);\n};\n\nvar SENTINEL = new Sentinel();\n\nfunction useRecoilCallback(fn, deps) {\n  var storeRef = useStoreRef$1();\n  var gotoSnapshot = useGotoRecoilSnapshot();\n  return useCallback$1(function () {\n    for (var _len6 = arguments.length, args = new Array(_len6), _key9 = 0; _key9 < _len6; _key9++) {\n      args[_key9] = arguments[_key9];\n    }\n\n    function set(recoilState, newValueOrUpdater) {\n      setRecoilValue$2(storeRef.current, recoilState, newValueOrUpdater);\n    }\n\n    function reset(recoilState) {\n      setRecoilValue$2(storeRef.current, recoilState, DEFAULT_VALUE$3);\n    } // Use currentTree for the snapshot to show the currently committed state\n\n\n    var snapshot = cloneSnapshot$1(storeRef.current); // FIXME massive gains from doing this lazily\n\n    var atomicUpdate = atomicUpdater$1(storeRef.current);\n    var ret = SENTINEL;\n    batchUpdates$2(function () {\n      var errMsg = 'useRecoilCallback expects a function that returns a function: ' + 'it accepts a function of the type (RecoilInterface) => T = R ' + 'and returns a callback function T => R, where RecoilInterface is an ' + 'object {snapshot, set, ...} and T and R are the argument and return ' + 'types of the callback you want to create.  Please see the docs ' + 'at recoiljs.org for details.';\n\n      if (typeof fn !== 'function') {\n        throw new Error(errMsg);\n      } // flowlint-next-line unclear-type:off\n\n\n      var cb = fn({\n        set: set,\n        reset: reset,\n        snapshot: snapshot,\n        gotoSnapshot: gotoSnapshot,\n        transact_UNSTABLE: atomicUpdate\n      });\n\n      if (typeof cb !== 'function') {\n        throw new Error(errMsg);\n      }\n\n      ret = cb.apply(void 0, args);\n    });\n    !!(ret instanceof Sentinel) ? process.env.NODE_ENV !== \"production\" ? Recoil_invariant(false, 'batchUpdates should return immediately') : Recoil_invariant(false) : void 0;\n    return ret;\n  }, deps != null ? [].concat(_toConsumableArray(deps), [storeRef]) : undefined // eslint-disable-line fb-www/react-hooks-deps\n  );\n} // I don't see a way to avoid the any type here because we want to accept readable\n// and writable values with any type parameter, but normally with writable ones\n// RecoilState<SomeT> is not a subtype of RecoilState<mixed>.\n// flowlint-line unclear-type:off\n\n\nfunction useRetain(toRetain) {\n  if (!Recoil_gkx_1('recoil_memory_managament_2020')) {\n    return;\n  } // eslint-disable-next-line fb-www/react-hooks\n\n\n  return useRetain_ACTUAL(toRetain);\n}\n\nfunction useRetain_ACTUAL(toRetain) {\n  var array = Array.isArray(toRetain) ? toRetain : [toRetain];\n  var retainables = array.map(function (a) {\n    return a instanceof RetentionZone$3 ? a : a.key;\n  });\n  var storeRef = useStoreRef$1();\n  useEffect$1(function () {\n    if (!Recoil_gkx_1('recoil_memory_managament_2020')) {\n      return;\n    }\n\n    var store = storeRef.current;\n\n    if (timeoutID.current && !isSSR$2) {\n      // Already performed a temporary retain on render, simply cancel the release\n      // of that temporary retain.\n      window.clearTimeout(timeoutID.current);\n      timeoutID.current = null;\n    } else {\n      var _iterator39 = _createForOfIteratorHelper(retainables),\n          _step39;\n\n      try {\n        for (_iterator39.s(); !(_step39 = _iterator39.n()).done;) {\n          var r = _step39.value;\n          updateRetainCount$2(store, r, 1);\n        }\n      } catch (err) {\n        _iterator39.e(err);\n      } finally {\n        _iterator39.f();\n      }\n    }\n\n    return function () {\n      var _iterator40 = _createForOfIteratorHelper(retainables),\n          _step40;\n\n      try {\n        for (_iterator40.s(); !(_step40 = _iterator40.n()).done;) {\n          var _r = _step40.value;\n          updateRetainCount$2(store, _r, -1);\n        }\n      } catch (err) {\n        _iterator40.e(err);\n      } finally {\n        _iterator40.f();\n      }\n    }; // eslint-disable-next-line fb-www/react-hooks-deps\n  }, [storeRef].concat(_toConsumableArray(retainables))); // We want to retain if the component suspends. This is terrible but the Suspense\n  // API affords us no better option. If we suspend and never commit after some\n  // seconds, then release. The 'actual' retain/release in the effect above\n  // cancels this.\n\n  var timeoutID = useRef$2();\n  var previousRetainables = usePrevious(retainables);\n\n  if (!isSSR$2 && (previousRetainables === undefined || !Recoil_shallowArrayEqual(previousRetainables, retainables))) {\n    var store = storeRef.current;\n\n    var _iterator41 = _createForOfIteratorHelper(retainables),\n        _step41;\n\n    try {\n      for (_iterator41.s(); !(_step41 = _iterator41.n()).done;) {\n        var _r3 = _step41.value;\n        updateRetainCount$2(store, _r3, 1);\n      }\n    } catch (err) {\n      _iterator41.e(err);\n    } finally {\n      _iterator41.f();\n    }\n\n    if (previousRetainables) {\n      var _iterator42 = _createForOfIteratorHelper(previousRetainables),\n          _step42;\n\n      try {\n        for (_iterator42.s(); !(_step42 = _iterator42.n()).done;) {\n          var r = _step42.value;\n          updateRetainCount$2(store, r, -1);\n        }\n      } catch (err) {\n        _iterator42.e(err);\n      } finally {\n        _iterator42.f();\n      }\n    }\n\n    if (timeoutID.current) {\n      window.clearTimeout(timeoutID.current);\n    }\n\n    timeoutID.current = window.setTimeout(function () {\n      timeoutID.current = null;\n\n      var _iterator43 = _createForOfIteratorHelper(retainables),\n          _step43;\n\n      try {\n        for (_iterator43.s(); !(_step43 = _iterator43.n()).done;) {\n          var _r2 = _step43.value;\n          updateRetainCount$2(store, _r2, -1);\n        }\n      } catch (err) {\n        _iterator43.e(err);\n      } finally {\n        _iterator43.f();\n      }\n    }, SUSPENSE_TIMEOUT_MS);\n  }\n}\n\nfunction useRecoilTransaction(fn, deps) {\n  var storeRef = useStoreRef$1();\n  return useMemo$1(function () {\n    return function () {\n      for (var _len7 = arguments.length, args = new Array(_len7), _key10 = 0; _key10 < _len7; _key10++) {\n        args[_key10] = arguments[_key10];\n      }\n\n      var atomicUpdate = atomicUpdater$1(storeRef.current);\n      atomicUpdate(function (transactionInterface) {\n        fn(transactionInterface).apply(void 0, args);\n      });\n    };\n  }, deps != null ? [].concat(_toConsumableArray(deps), [storeRef]) : undefined // eslint-disable-line fb-www/react-hooks-deps\n  );\n}\n\nvar Recoil_Hooks = {\n  recoilComponentGetRecoilValueCount_FOR_TESTING: recoilComponentGetRecoilValueCount_FOR_TESTING,\n  useGotoRecoilSnapshot: useGotoRecoilSnapshot,\n  useRecoilCallback: useRecoilCallback,\n  useRecoilInterface: useRecoilInterface_DEPRECATED,\n  useRecoilSnapshot: useRecoilSnapshot,\n  useRecoilState: useRecoilState,\n  useRecoilStateLoadable: useRecoilStateLoadable,\n  useRecoilTransaction: useRecoilTransaction,\n  useRecoilTransactionObserver: useRecoilTransactionObserver,\n  useRecoilValue: useRecoilValue,\n  useRecoilValueLoadable: useRecoilValueLoadable,\n  useRetain: useRetain,\n  useResetRecoilState: useResetRecoilState,\n  useSetRecoilState: useSetRecoilState,\n  useSetUnvalidatedAtomValues: useSetUnvalidatedAtomValues,\n  useTransactionObservation_DEPRECATED: useTransactionObservation_DEPRECATED,\n  useTransactionSubscription_DEPRECATED: useTransactionSubscription\n};\nvar peekNodeInfo$2 = Recoil_FunctionalCore.peekNodeInfo;\nvar useStoreRef$2 = Recoil_RecoilRoot_react.useStoreRef;\n\nfunction useGetRecoilValueInfo() {\n  var storeRef = useStoreRef$2();\n  return function (_ref17) {\n    var key = _ref17.key;\n    return peekNodeInfo$2(storeRef.current, storeRef.current.getState().currentTree, key);\n  };\n}\n\nvar Recoil_useGetRecoilValueInfo = useGetRecoilValueInfo;\nvar RecoilRoot$1 = Recoil_RecoilRoot_react.RecoilRoot,\n    useStoreRef$3 = Recoil_RecoilRoot_react.useStoreRef;\nvar useMemo$2 = react.useMemo;\n\nfunction useRecoilBridgeAcrossReactRoots() {\n  var store = useStoreRef$3().current;\n  return useMemo$2(function () {\n    function RecoilBridge(_ref18) {\n      var children = _ref18.children;\n      return /*#__PURE__*/react.createElement(RecoilRoot$1, {\n        store_INTERNAL: store\n      }, children);\n    }\n\n    return RecoilBridge;\n  }, [store]);\n}\n\nvar Recoil_useRecoilBridgeAcrossReactRoots = useRecoilBridgeAcrossReactRoots;\n/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @emails oncall+recoil\n * \n * @format\n */\n\nfunction isNode(object) {\n  var _ownerDocument, _doc$defaultView;\n\n  if (typeof window === 'undefined') {\n    return false;\n  }\n\n  var doc = object != null ? (_ownerDocument = object.ownerDocument) !== null && _ownerDocument !== void 0 ? _ownerDocument : object : document;\n  var defaultView = (_doc$defaultView = doc.defaultView) !== null && _doc$defaultView !== void 0 ? _doc$defaultView : window;\n  return !!(object != null && (typeof defaultView.Node === 'function' ? object instanceof defaultView.Node : typeof object === 'object' && typeof object.nodeType === 'number' && typeof object.nodeName === 'string'));\n}\n\nvar Recoil_isNode = isNode;\nvar isReactNative$1 = Recoil_Environment.isReactNative,\n    isSSR$3 = Recoil_Environment.isSSR;\n\nfunction shouldNotBeFrozen(value) {\n  // Primitives and functions:\n  if (value === null || typeof value !== 'object') {\n    return true;\n  } // React elements:\n\n\n  switch (typeof value.$$typeof) {\n    case 'symbol':\n      return true;\n\n    case 'number':\n      return true;\n  } // Immutable structures:\n\n\n  if (value['@@__IMMUTABLE_ITERABLE__@@'] != null || value['@@__IMMUTABLE_KEYED__@@'] != null || value['@@__IMMUTABLE_INDEXED__@@'] != null || value['@@__IMMUTABLE_ORDERED__@@'] != null || value['@@__IMMUTABLE_RECORD__@@'] != null) {\n    return true;\n  } // DOM nodes:\n\n\n  if (Recoil_isNode(value)) {\n    return true;\n  }\n\n  if (Recoil_isPromise(value)) {\n    return true;\n  }\n\n  if (value instanceof Error) {\n    return true;\n  }\n\n  if (ArrayBuffer.isView(value)) {\n    return true;\n  } // Some environments, just as Jest, don't work with the instanceof check\n\n\n  if (!isSSR$3 && !isReactNative$1 && ( // $FlowFixMe(site=recoil) Window does not have a FlowType definition https://github.com/facebook/flow/issues/6709\n  value === window || value instanceof Window)) {\n    return true;\n  }\n\n  return false;\n} // Recursively freeze a value to enforce it is read-only.\n// This may also have minimal performance improvements for enumerating\n// objects (based on browser implementations, of course)\n\n\nfunction deepFreezeValue(value) {\n  if (typeof value !== 'object' || shouldNotBeFrozen(value)) {\n    return;\n  }\n\n  Object.freeze(value); // Make all properties read-only\n\n  for (var key in value) {\n    // $FlowFixMe[method-unbinding] added when improving typing for this parameters\n    if (Object.prototype.hasOwnProperty.call(value, key)) {\n      var prop = value[key]; // Prevent infinite recurssion for circular references.\n\n      if (typeof prop === 'object' && prop != null && !Object.isFrozen(prop)) {\n        deepFreezeValue(prop);\n      }\n    }\n  }\n\n  Object.seal(value); // This also makes existing properties non-configurable.\n}\n\nvar Recoil_deepFreezeValue = deepFreezeValue;\nvar TIME_WARNING_THRESHOLD_MS = 15;\n\nfunction stringify(x, opt, key) {\n  // A optimization to avoid the more expensive JSON.stringify() for simple strings\n  // This may lose protection for u2028 and u2029, though.\n  if (typeof x === 'string' && !x.includes('\"') && !x.includes('\\\\')) {\n    return \"\\\"\".concat(x, \"\\\"\");\n  } // Handle primitive types\n\n\n  switch (typeof x) {\n    case 'undefined':\n      return '';\n    // JSON.stringify(undefined) returns undefined, but we always want to return a string\n\n    case 'boolean':\n      return x ? 'true' : 'false';\n\n    case 'number':\n    case 'symbol':\n      // case 'bigint': // BigInt is not supported in www\n      return String(x);\n\n    case 'string':\n      // Add surrounding quotes and escape internal quotes\n      return JSON.stringify(x);\n\n    case 'function':\n      if ((opt === null || opt === void 0 ? void 0 : opt.allowFunctions) !== true) {\n        throw new Error('Attempt to serialize function in a Recoil cache key');\n      }\n\n      return \"__FUNCTION(\".concat(x.name, \")__\");\n  }\n\n  if (x === null) {\n    return 'null';\n  } // Fallback case for unknown types\n\n\n  if (typeof x !== 'object') {\n    var _JSON$stringify;\n\n    return (_JSON$stringify = JSON.stringify(x)) !== null && _JSON$stringify !== void 0 ? _JSON$stringify : '';\n  } // Deal with all promises as equivalent for now.\n\n\n  if (Recoil_isPromise(x)) {\n    return '__PROMISE__';\n  } // Arrays handle recursive stringification\n\n\n  if (Array.isArray(x)) {\n    return \"[\".concat(x.map(function (v, i) {\n      return stringify(v, opt, i.toString());\n    }), \"]\");\n  } // If an object defines a toJSON() method, then use that to override the\n  // serialization.  This matches the behavior of JSON.stringify().\n  // Pass the key for compatibility.\n  // Immutable.js collections define this method to allow us to serialize them.\n\n\n  if (typeof x.toJSON === 'function') {\n    // flowlint-next-line unclear-type: off\n    return stringify(x.toJSON(key), opt, key);\n  } // For built-in Maps, sort the keys in a stable order instead of the\n  // default insertion order.  Support non-string keys.\n\n\n  if (x instanceof Map) {\n    var obj = {};\n\n    var _iterator44 = _createForOfIteratorHelper(x),\n        _step44;\n\n    try {\n      for (_iterator44.s(); !(_step44 = _iterator44.n()).done;) {\n        var _step44$value = _slicedToArray(_step44.value, 2),\n            k = _step44$value[0],\n            v = _step44$value[1];\n\n        // Stringify will escape any nested quotes\n        obj[typeof k === 'string' ? k : stringify(k, opt)] = v;\n      }\n    } catch (err) {\n      _iterator44.e(err);\n    } finally {\n      _iterator44.f();\n    }\n\n    return stringify(obj, opt, key);\n  } // For built-in Sets, sort the keys in a stable order instead of the\n  // default insertion order.\n\n\n  if (x instanceof Set) {\n    return stringify(Array.from(x).sort(function (a, b) {\n      return stringify(a, opt).localeCompare(stringify(b, opt));\n    }), opt, key);\n  } // Anything else that is iterable serialize as an Array.\n\n\n  if (Symbol !== undefined && x[Symbol.iterator] != null && typeof x[Symbol.iterator] === 'function') {\n    // flowlint-next-line unclear-type: off\n    return stringify(Array.from(x), opt, key);\n  } // For all other Objects, sort the keys in a stable order.\n\n\n  return \"{\".concat(Object.keys(x).filter(function (key) {\n    return x[key] !== undefined;\n  }).sort() // stringify the key to add quotes and escape any nested slashes or quotes.\n  .map(function (key) {\n    return \"\".concat(stringify(key, opt), \":\").concat(stringify(x[key], opt, key));\n  }).join(','), \"}\");\n} // Utility similar to JSON.stringify() except:\n// * Serialize built-in Sets as an Array\n// * Serialize built-in Maps as an Object.  Supports non-string keys.\n// * Serialize other iterables as arrays\n// * Sort the keys of Objects and Maps to have a stable order based on string conversion.\n//    This overrides their default insertion order.\n// * Still uses toJSON() of any object to override serialization\n// * Support Symbols (though don't guarantee uniqueness)\n// * We could support BigInt, but Flow doesn't seem to like it.\n// See Recoil_stableStringify-test.js for examples\n\n\nfunction stableStringify(x) {\n  var opt = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {\n    allowFunctions: false\n  };\n\n  if (process.env.NODE_ENV !== \"production\") {\n    if (typeof window !== 'undefined') {\n      var startTime = window.performance ? window.performance.now() : 0;\n      var str = stringify(x, opt);\n      var endTime = window.performance ? window.performance.now() : 0;\n\n      if (endTime - startTime > TIME_WARNING_THRESHOLD_MS) {\n        /* eslint-disable fb-www/no-console */\n        console.groupCollapsed(\"Recoil: Spent \".concat(endTime - startTime, \"ms computing a cache key\"));\n        console.warn(x, str);\n        console.groupEnd();\n        /* eslint-enable fb-www/no-console */\n      }\n\n      return str;\n    }\n  }\n\n  return stringify(x, opt);\n}\n\nvar Recoil_stableStringify = stableStringify;\n\nvar TreeCache = /*#__PURE__*/function () {\n  function TreeCache(options) {\n    _classCallCheck(this, TreeCache);\n\n    var _options$onHit, _options$onSet, _options$mapNodeValue;\n\n    _defineProperty(this, \"_numLeafs\", void 0);\n\n    _defineProperty(this, \"_root\", void 0);\n\n    _defineProperty(this, \"_onHit\", void 0);\n\n    _defineProperty(this, \"_onSet\", void 0);\n\n    _defineProperty(this, \"_mapNodeValue\", void 0);\n\n    this._numLeafs = 0;\n    this._root = null;\n    this._onHit = (_options$onHit = options === null || options === void 0 ? void 0 : options.onHit) !== null && _options$onHit !== void 0 ? _options$onHit : function () {};\n    this._onSet = (_options$onSet = options === null || options === void 0 ? void 0 : options.onSet) !== null && _options$onSet !== void 0 ? _options$onSet : function () {};\n    this._mapNodeValue = (_options$mapNodeValue = options === null || options === void 0 ? void 0 : options.mapNodeValue) !== null && _options$mapNodeValue !== void 0 ? _options$mapNodeValue : function (val) {\n      return val;\n    };\n  }\n\n  _createClass(TreeCache, [{\n    key: \"size\",\n    value: function size() {\n      return this._numLeafs;\n    } // TODO: nodeCount(): number\n\n  }, {\n    key: \"root\",\n    value: function root() {\n      return this._root;\n    }\n  }, {\n    key: \"get\",\n    value: function get(getNodeValue, handlers) {\n      var _this$getLeafNode;\n\n      return (_this$getLeafNode = this.getLeafNode(getNodeValue, handlers)) === null || _this$getLeafNode === void 0 ? void 0 : _this$getLeafNode.value;\n    }\n  }, {\n    key: \"getLeafNode\",\n    value: function getLeafNode(getNodeValue, handlers) {\n      var _this7 = this;\n\n      return findLeaf(this.root(), function (nodeKey) {\n        return _this7._mapNodeValue(getNodeValue(nodeKey));\n      }, {\n        onNodeVisit: function onNodeVisit(node) {\n          handlers === null || handlers === void 0 ? void 0 : handlers.onNodeVisit(node);\n\n          if (node.type === 'leaf') {\n            _this7._onHit(node);\n          }\n        }\n      });\n    }\n  }, {\n    key: \"set\",\n    value: function set(route, value, handlers) {\n      var _this8 = this;\n\n      var leafNode;\n      var newRoot = addLeaf(this.root(), route.map(function (_ref19) {\n        var _ref20 = _slicedToArray(_ref19, 2),\n            nodeKey = _ref20[0],\n            nodeValue = _ref20[1];\n\n        return [nodeKey, _this8._mapNodeValue(nodeValue)];\n      }), null, value, null, {\n        onNodeVisit: function onNodeVisit(node) {\n          handlers === null || handlers === void 0 ? void 0 : handlers.onNodeVisit(node);\n\n          if (node.type === 'leaf') {\n            leafNode = node;\n          }\n        }\n      });\n\n      if (!this.root()) {\n        this._root = newRoot;\n      }\n\n      this._numLeafs++;\n\n      this._onSet(Recoil_nullthrows(leafNode));\n    }\n  }, {\n    key: \"delete\",\n    value: function _delete(node) {\n      if (!this.root()) {\n        return false;\n      }\n\n      var root = Recoil_nullthrows(this.root());\n      var existsInTree = pruneNodeFromTree(root, node, node.parent);\n\n      if (!existsInTree) {\n        return false;\n      }\n\n      if (node === root || root.type === 'branch' && !root.branches.size) {\n        this._root = null;\n        this._numLeafs = 0;\n        return true;\n      }\n\n      this._numLeafs -= countDownstreamLeaves(node);\n      return true;\n    }\n  }, {\n    key: \"clear\",\n    value: function clear() {\n      this._numLeafs = 0;\n      this._root = null;\n    }\n  }]);\n\n  return TreeCache;\n}();\n\nvar findLeaf = function findLeaf(root, getNodeValue, handlers) {\n  var _handlers$onNodeVisit;\n\n  if (root == null) {\n    return undefined;\n  }\n\n  handlers === null || handlers === void 0 ? void 0 : (_handlers$onNodeVisit = handlers.onNodeVisit) === null || _handlers$onNodeVisit === void 0 ? void 0 : _handlers$onNodeVisit.call(handlers, root);\n\n  if (root.type === 'leaf') {\n    return root;\n  }\n\n  var nodeValue = getNodeValue(root.nodeKey);\n  return findLeaf(root.branches.get(nodeValue), getNodeValue, handlers);\n};\n\nvar addLeaf = function addLeaf(root, route, parent, value, branchKey, handlers) {\n  var _handlers$onNodeVisit2;\n\n  var node;\n\n  if (root == null) {\n    if (route.length === 0) {\n      node = {\n        type: 'leaf',\n        value: value,\n        parent: parent,\n        branchKey: branchKey\n      };\n    } else {\n      var _route = _toArray(route),\n          path = _route[0],\n          rest = _route.slice(1);\n\n      var _path = _slicedToArray(path, 2),\n          nodeKey = _path[0],\n          nodeValue = _path[1];\n\n      node = {\n        type: 'branch',\n        nodeKey: nodeKey,\n        parent: parent,\n        branches: new Map(),\n        branchKey: branchKey\n      };\n      node.branches.set(nodeValue, addLeaf(null, rest, node, value, nodeValue, handlers));\n    }\n  } else {\n    node = root;\n\n    if (route.length) {\n      var _route2 = _toArray(route),\n          _path2 = _route2[0],\n          _rest = _route2.slice(1);\n\n      var _path3 = _slicedToArray(_path2, 2),\n          _nodeKey = _path3[0],\n          _nodeValue = _path3[1];\n\n      !(root.type === 'branch' && root.nodeKey === _nodeKey) ? process.env.NODE_ENV !== \"production\" ? Recoil_invariant(false, 'Existing cache must have a branch midway through the route with matching node key') : Recoil_invariant(false) : void 0;\n      root.branches.set(_nodeValue, addLeaf(root.branches.get(_nodeValue), _rest, root, value, _nodeValue, handlers));\n    }\n  }\n\n  handlers === null || handlers === void 0 ? void 0 : (_handlers$onNodeVisit2 = handlers.onNodeVisit) === null || _handlers$onNodeVisit2 === void 0 ? void 0 : _handlers$onNodeVisit2.call(handlers, node);\n  return node;\n};\n\nvar pruneNodeFromTree = function pruneNodeFromTree(root, node, parent) {\n  if (!parent) {\n    return root === node;\n  }\n\n  parent.branches.delete(node.branchKey);\n  return pruneUpstreamBranches(root, parent, parent.parent);\n};\n\nvar pruneUpstreamBranches = function pruneUpstreamBranches(root, branchNode, parent) {\n  if (!parent) {\n    return root === branchNode;\n  }\n\n  if (branchNode.branches.size === 0) {\n    parent.branches.delete(branchNode.branchKey);\n  }\n\n  return pruneUpstreamBranches(root, parent, parent.parent);\n};\n\nvar countDownstreamLeaves = function countDownstreamLeaves(node) {\n  return node.type === 'leaf' ? 1 : Array.from(node.branches.values()).reduce(function (sum, currNode) {\n    return sum + countDownstreamLeaves(currNode);\n  }, 0);\n};\n\nvar Recoil_TreeCache = {\n  TreeCache: TreeCache\n};\nvar Recoil_TreeCache_1 = Recoil_TreeCache.TreeCache;\nvar Recoil_TreeCache$1 = /*#__PURE__*/Object.freeze({\n  __proto__: null,\n  TreeCache: Recoil_TreeCache_1\n});\n\nvar LRUCache = /*#__PURE__*/function () {\n  function LRUCache(options) {\n    _classCallCheck(this, LRUCache);\n\n    var _options$mapKey;\n\n    _defineProperty(this, \"_maxSize\", void 0);\n\n    _defineProperty(this, \"_size\", void 0);\n\n    _defineProperty(this, \"_head\", void 0);\n\n    _defineProperty(this, \"_tail\", void 0);\n\n    _defineProperty(this, \"_map\", void 0);\n\n    _defineProperty(this, \"_keyMapper\", void 0);\n\n    this._maxSize = options.maxSize;\n    this._size = 0;\n    this._head = null;\n    this._tail = null;\n    this._map = new Map();\n    this._keyMapper = (_options$mapKey = options.mapKey) !== null && _options$mapKey !== void 0 ? _options$mapKey : function (v) {\n      return v;\n    };\n  }\n\n  _createClass(LRUCache, [{\n    key: \"head\",\n    value: function head() {\n      return this._head;\n    }\n  }, {\n    key: \"tail\",\n    value: function tail() {\n      return this._tail;\n    }\n  }, {\n    key: \"size\",\n    value: function size() {\n      return this._size;\n    }\n  }, {\n    key: \"maxSize\",\n    value: function maxSize() {\n      return this._maxSize;\n    }\n  }, {\n    key: \"has\",\n    value: function has(key) {\n      return this._map.has(this._keyMapper(key));\n    }\n  }, {\n    key: \"get\",\n    value: function get(key) {\n      var mappedKey = this._keyMapper(key);\n\n      var node = this._map.get(mappedKey);\n\n      if (!node) {\n        return undefined;\n      }\n\n      this.set(key, node.value);\n      return node.value;\n    }\n  }, {\n    key: \"set\",\n    value: function set(key, val) {\n      var mappedKey = this._keyMapper(key);\n\n      var existingNode = this._map.get(mappedKey);\n\n      if (existingNode) {\n        this.delete(key);\n      }\n\n      var head = this.head();\n      var node = {\n        key: key,\n        right: head,\n        left: null,\n        value: val\n      };\n\n      if (head) {\n        head.left = node;\n      } else {\n        this._tail = node;\n      }\n\n      this._map.set(mappedKey, node);\n\n      this._head = node;\n      this._size++;\n\n      this._maybeDeleteLRU();\n    }\n  }, {\n    key: \"_maybeDeleteLRU\",\n    value: function _maybeDeleteLRU() {\n      if (this.size() > this.maxSize()) {\n        this.deleteLru();\n      }\n    }\n  }, {\n    key: \"deleteLru\",\n    value: function deleteLru() {\n      var tail = this.tail();\n\n      if (tail) {\n        this.delete(tail.key);\n      }\n    }\n  }, {\n    key: \"delete\",\n    value: function _delete(key) {\n      var mappedKey = this._keyMapper(key);\n\n      if (!this._size || !this._map.has(mappedKey)) {\n        return;\n      }\n\n      var node = Recoil_nullthrows(this._map.get(mappedKey));\n      var right = node.right;\n      var left = node.left;\n\n      if (right) {\n        right.left = node.left;\n      }\n\n      if (left) {\n        left.right = node.right;\n      }\n\n      if (node === this.head()) {\n        this._head = right;\n      }\n\n      if (node === this.tail()) {\n        this._tail = left;\n      }\n\n      this._map.delete(mappedKey);\n\n      this._size--;\n    }\n  }, {\n    key: \"clear\",\n    value: function clear() {\n      this._size = 0;\n      this._head = null;\n      this._tail = null;\n      this._map = new Map();\n    }\n  }]);\n\n  return LRUCache;\n}();\n\nvar Recoil_LRUCache = {\n  LRUCache: LRUCache\n};\nvar Recoil_LRUCache_1 = Recoil_LRUCache.LRUCache;\nvar Recoil_LRUCache$1 = /*#__PURE__*/Object.freeze({\n  __proto__: null,\n  LRUCache: Recoil_LRUCache_1\n});\nvar LRUCache$1 = Recoil_LRUCache$1.LRUCache;\nvar TreeCache$1 = Recoil_TreeCache$1.TreeCache;\n\nfunction treeCacheLRU(maxSize) {\n  var mapNodeValue = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : function (v) {\n    return v;\n  };\n  var lruCache = new LRUCache$1({\n    maxSize: maxSize\n  });\n  var cache = new TreeCache$1({\n    mapNodeValue: mapNodeValue,\n    onHit: function onHit(node) {\n      lruCache.set(node, true);\n    },\n    onSet: function onSet(node) {\n      var lruNode = lruCache.tail();\n      lruCache.set(node, true);\n\n      if (lruNode && cache.size() > maxSize) {\n        cache.delete(lruNode.key);\n      }\n    }\n  }); // $FlowFixMe[method-unbinding]\n\n  return cache;\n}\n\nvar Recoil_treeCacheLRU = treeCacheLRU;\nvar TreeCache$2 = Recoil_TreeCache$1.TreeCache;\nvar defaultPolicy = {\n  equality: 'reference',\n  eviction: 'keep-all',\n  maxSize: Infinity\n};\n\nfunction treeCacheFromPolicy() {\n  var _ref21 = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : defaultPolicy,\n      _ref21$equality = _ref21.equality,\n      equality = _ref21$equality === void 0 ? defaultPolicy.equality : _ref21$equality,\n      _ref21$eviction = _ref21.eviction,\n      eviction = _ref21$eviction === void 0 ? defaultPolicy.eviction : _ref21$eviction,\n      _ref21$maxSize = _ref21.maxSize,\n      maxSize = _ref21$maxSize === void 0 ? defaultPolicy.maxSize : _ref21$maxSize;\n\n  var valueMapper = getValueMapper(equality);\n  var treeCache = getTreeCache(eviction, maxSize, valueMapper);\n  return treeCache;\n}\n\nfunction getValueMapper(equality) {\n  switch (equality) {\n    case 'reference':\n      return function (val) {\n        return val;\n      };\n\n    case 'value':\n      return function (val) {\n        return Recoil_stableStringify(val);\n      };\n  }\n\n  throw new Error(\"Unrecognized equality policy \".concat(equality));\n}\n\nfunction getTreeCache(eviction, maxSize, mapNodeValue) {\n  switch (eviction) {\n    case 'keep-all':\n      // $FlowFixMe[method-unbinding]\n      return new TreeCache$2({\n        mapNodeValue: mapNodeValue\n      });\n\n    case 'lru':\n      return Recoil_treeCacheLRU(Recoil_nullthrows(maxSize), mapNodeValue);\n\n    case 'most-recent':\n      return Recoil_treeCacheLRU(1, mapNodeValue);\n  }\n\n  throw new Error(\"Unrecognized eviction policy \".concat(eviction));\n}\n\nvar Recoil_treeCacheFromPolicy = treeCacheFromPolicy;\n/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @emails oncall+recoil\n * \n * @format\n *\n * This is a stub for some integration into FB internal stuff\n */\n\nfunction startPerfBlock(_id) {\n  return function () {\n    return null;\n  };\n}\n\nvar Recoil_PerformanceTimings = {\n  startPerfBlock: startPerfBlock\n};\nvar CANCELED$2 = Recoil_Loadable.CANCELED,\n    Canceled$1 = Recoil_Loadable.Canceled,\n    loadableWithError$1 = Recoil_Loadable.loadableWithError,\n    loadableWithPromise$1 = Recoil_Loadable.loadableWithPromise,\n    loadableWithValue$2 = Recoil_Loadable.loadableWithValue;\nvar getNodeLoadable$2 = Recoil_FunctionalCore.getNodeLoadable,\n    peekNodeLoadable$1 = Recoil_FunctionalCore.peekNodeLoadable,\n    setNodeValue$3 = Recoil_FunctionalCore.setNodeValue;\nvar saveDependencyMapToStore$1 = Recoil_Graph.saveDependencyMapToStore;\nvar DEFAULT_VALUE$4 = Recoil_Node.DEFAULT_VALUE,\n    RecoilValueNotReady$2 = Recoil_Node.RecoilValueNotReady,\n    getConfigDeletionHandler$1 = Recoil_Node.getConfigDeletionHandler,\n    registerNode$1 = Recoil_Node.registerNode;\nvar isRecoilValue$3 = Recoil_RecoilValue$1.isRecoilValue;\nvar AbstractRecoilValue$4 = Recoil_RecoilValue$1.AbstractRecoilValue;\nvar setRecoilValueLoadable$2 = Recoil_RecoilValueInterface.setRecoilValueLoadable;\nvar retainedByOptionWithDefault$1 = Recoil_Retention.retainedByOptionWithDefault;\nvar cloneSnapshot$2 = Recoil_Snapshot$1.cloneSnapshot;\nvar startPerfBlock$1 = Recoil_PerformanceTimings.startPerfBlock;\nvar dependencyStack = []; // for detecting circular dependencies.\n\nvar waitingStores = new Map();\n/* eslint-disable no-redeclare */\n\nvar getNewExecutionId = function () {\n  var executionId = 0;\n  return function () {\n    return executionId++;\n  };\n}();\n\nfunction getInitialExecutionInfo() {\n  return {\n    depValuesDiscoveredSoFarDuringAsyncWork: null,\n    latestLoadable: null,\n    latestExecutionId: null,\n    stateVersion: null\n  };\n}\n\nfunction selector(options) {\n  var key = options.key,\n      get = options.get,\n      cachePolicy = options.cachePolicy_UNSTABLE;\n  var set = options.set != null ? options.set : undefined; // flow\n\n  var cache = Recoil_treeCacheFromPolicy(cachePolicy !== null && cachePolicy !== void 0 ? cachePolicy : {\n    equality: 'reference',\n    eviction: 'keep-all'\n  });\n  var retainedBy = retainedByOptionWithDefault$1(options.retainedBy_UNSTABLE);\n  var executionInfoMap = new Map();\n  var liveStoresCount = 0;\n\n  function selectorIsLive() {\n    return !Recoil_gkx_1('recoil_memory_managament_2020') || liveStoresCount > 0;\n  }\n\n  function getExecutionInfo(store) {\n    if (!executionInfoMap.has(store)) {\n      executionInfoMap.set(store, getInitialExecutionInfo());\n    }\n\n    return Recoil_nullthrows(executionInfoMap.get(store));\n  }\n\n  function selectorInit(store) {\n    liveStoresCount++;\n    store.getState().knownSelectors.add(key); // FIXME remove knownSelectors?\n\n    return function () {\n      liveStoresCount--;\n      store.getState().knownSelectors.delete(key);\n      executionInfoMap.delete(store);\n    };\n  }\n\n  function selectorShouldDeleteConfigOnRelease() {\n    return getConfigDeletionHandler$1(key) !== undefined && !selectorIsLive();\n  }\n\n  function notifyStoreWhenAsyncSettles(store, loadable, executionId) {\n    if (loadable.state === 'loading') {\n      var stores = waitingStores.get(executionId);\n\n      if (stores == null) {\n        waitingStores.set(executionId, stores = new Set());\n      }\n\n      stores.add(store);\n    }\n  }\n\n  function notifyStoresOfSettledAsync(newLoadable, executionId) {\n    var stores = waitingStores.get(executionId);\n\n    if (stores !== undefined) {\n      var _iterator45 = _createForOfIteratorHelper(stores),\n          _step45;\n\n      try {\n        for (_iterator45.s(); !(_step45 = _iterator45.n()).done;) {\n          var store = _step45.value;\n          setRecoilValueLoadable$2(store, new AbstractRecoilValue$4(key), newLoadable);\n        }\n      } catch (err) {\n        _iterator45.e(err);\n      } finally {\n        _iterator45.f();\n      }\n\n      waitingStores.delete(executionId);\n    }\n  }\n\n  function getCachedNodeLoadable(store, state, key) {\n    var isKeyPointingToSelector = store.getState().knownSelectors.has(key);\n    /**\n     * It's important that we don't bypass calling getNodeLoadable for atoms\n     * as getNodeLoadable has side effects in state\n     */\n\n    if (isKeyPointingToSelector && state.atomValues.has(key)) {\n      return Recoil_nullthrows(state.atomValues.get(key));\n    }\n\n    var loadable = getNodeLoadable$2(store, state, key);\n\n    if (loadable.state !== 'loading' && isKeyPointingToSelector) {\n      state.atomValues.set(key, loadable);\n    }\n\n    return loadable;\n  }\n  /**\n   * This function attaches a then() and a catch() to a promise that was\n   * returned from a selector's get() (either explicitly or implicitly by\n   * running a function that uses the \"async\" keyword). If a selector's get()\n   * returns a promise, we have two possibilities:\n   *\n   * 1. The promise will resolve, in which case it will have completely finished\n   *    executing without any remaining pending dependencies. No more retries\n   *    are needed and we can proceed with updating the cache and notifying\n   *    subscribers (if it is the latest execution, otherwise only the cache\n   *    will be updated and subscriptions will not be fired). This is the case\n   *    handled by the attached then() handler.\n   *\n   * 2. The promise will throw because it either has an error or it came across\n   *    an async dependency that has not yet resolved, in which case we will\n   *    call wrapDepdencyPromise(), whose responsibility is to handle dependency\n   *    promises. This case is handled by the attached catch() handler.\n   *\n   * Both branches will eventually resolve to the final result of the selector\n   * (or an error if a real error occurred).\n   *\n   * The execution will run to completion even if it is stale, and its value\n   * will be cached. But stale executions will not update global state or update\n   * executionInfo as that is the responsibility of the 'latest' execution.\n   *\n   * Note this function should not be passed a promise that was thrown--AKA a\n   * dependency promise. Dependency promises should be passed to\n   * wrapPendingDependencyPromise()).\n   */\n\n\n  function wrapPendingPromise(store, promise, state, depValues, executionId) {\n    return promise.then(function (value) {\n      if (!selectorIsLive()) {\n        // The selector was released since the request began; ignore the response.\n        clearExecutionInfo(store, executionId);\n        return CANCELED$2;\n      }\n\n      var loadable = loadableWithValue$2(value);\n      maybeFreezeValue(value);\n      setCache(state, depValuesToDepRoute(depValues), loadable);\n      setDepsInStore(store, state, new Set(depValues.keys()), executionId);\n      setLoadableInStoreToNotifyDeps(store, loadable, executionId);\n      return {\n        __value: value,\n        __key: key\n      };\n    }).catch(function (errorOrPromise) {\n      if (!selectorIsLive()) {\n        // The selector was released since the request began; ignore the response.\n        clearExecutionInfo(store, executionId);\n        return CANCELED$2;\n      }\n\n      if (isLatestExecution(store, executionId)) {\n        updateExecutionInfoDepValues(depValues, store, executionId);\n      }\n\n      if (Recoil_isPromise(errorOrPromise)) {\n        return wrapPendingDependencyPromise(store, errorOrPromise, state, depValues, executionId);\n      }\n\n      var loadable = loadableWithError$1(errorOrPromise);\n      maybeFreezeValue(errorOrPromise);\n      setCache(state, depValuesToDepRoute(depValues), loadable);\n      setDepsInStore(store, state, new Set(depValues.keys()), executionId);\n      setLoadableInStoreToNotifyDeps(store, loadable, executionId);\n      throw errorOrPromise;\n    });\n  }\n  /**\n   * This function attaches a then() and a catch() to a promise that was\n   * thrown from a selector's get(). If a selector's get() throws a promise,\n   * we have two possibilities:\n   *\n   * 1. The promise will resolve, meaning one of our selector's dependencies is\n   *    now available and we should \"retry\" our get() by running it again. This\n   *    is the case handled by the attached then() handler.\n   *\n   * 2. The promise will throw because something went wrong with the dependency\n   *    promise (in other words a real error occurred). This case is handled by\n   *    the attached catch() handler. If the dependency promise throws, it is\n   *    _always_ a real error and not another dependency promise (any dependency\n   *    promises would have been handled upstream).\n   *\n   * The then() branch will eventually resolve to the final result of the\n   * selector (or an error if a real error occurs), and the catch() will always\n   * resolve to an error because the dependency promise is a promise that was\n   * wrapped upstream, meaning it will only resolve to its real value or to a\n   * real error.\n   *\n   * The execution will run to completion even if it is stale, and its value\n   * will be cached. But stale executions will not update global state or update\n   * executionInfo as that is the responsibility of the 'latest' execution.\n   *\n   * Note this function should not be passed a promise that was returned from\n   * get(). The intention is that this function is only passed promises that\n   * were thrown due to a pending dependency. Promises returned by get() should\n   * be passed to wrapPendingPromise() instead.\n   */\n\n\n  function wrapPendingDependencyPromise(store, promise, state, existingDeps, executionId) {\n    return promise.then(function (resolvedDep) {\n      if (!selectorIsLive()) {\n        // The selector was released since the request began; ignore the response.\n        clearExecutionInfo(store, executionId);\n        return CANCELED$2;\n      }\n\n      if (resolvedDep instanceof Canceled$1) {\n        Recoil_recoverableViolation('Selector was released while it had dependencies');\n        return CANCELED$2;\n      }\n\n      var _ref22 = resolvedDep !== null && resolvedDep !== void 0 ? resolvedDep : {},\n          resolvedDepKey = _ref22.__key,\n          depValue = _ref22.__value;\n      /**\n       * We need to bypass the selector dep cache if the resolved dep was a\n       * user-thrown promise because the selector dep cache will contain the\n       * stale values of dependencies, causing an infinite evaluation loop.\n       */\n\n\n      var bypassSelectorDepCacheOnReevaluation = true;\n\n      if (resolvedDepKey != null) {\n        /**\n         * Note for async atoms, this means we are changing the atom's value\n         * in the store for the given version. This should be alright because\n         * the version of state is now stale and a new version will have\n         * already been triggered by the atom being resolved (see this logic\n         * in Recoil_atom.js)\n         */\n        state.atomValues.set(resolvedDepKey, loadableWithValue$2(depValue));\n        /**\n         * We've added the resolved dependency to the selector dep cache, so\n         * there's no need to bypass the cache\n         */\n\n        bypassSelectorDepCacheOnReevaluation = false;\n      }\n      /**\n       * Optimization: Now that the dependency has resolved, let's try hitting\n       * the cache in case the dep resolved to a value we have previously seen.\n       *\n       * TODO:\n       * Note this optimization is not perfect because it only prevents re-executions\n       * _after_ the point where an async dependency is found. Any code leading\n       * up to the async dependency may have run unnecessarily. The ideal case\n       * would be to wait for the async dependency to resolve first, check the\n       * cache, and prevent _any_ execution of the selector if the resulting\n       * value of the dependency leads to a path that is found in the cache.\n       * The ideal case is more difficult to implement as it would require that\n       * we capture and wait for the the async dependency right after checking\n       * the cache. The current approach takes advantage of the fact that running\n       * the selector already has a code path that lets use exit early when\n       * an async dep resolves.\n       */\n\n\n      var cachedLoadable = getValFromCacheAndUpdatedDownstreamDeps(store, state);\n\n      if (cachedLoadable && cachedLoadable.state === 'hasValue') {\n        setExecutionInfo(cachedLoadable, store);\n        return {\n          __value: cachedLoadable.contents,\n          __key: key\n        };\n      }\n      /**\n       * If this execution is stale, let's check to see if there is some in\n       * progress execution with a matching state. If we find a match, then\n       * we can take the value from that in-progress execution. Note this may\n       * sound like an edge case, but may be very common in cases where a\n       * loading dependency resolves from loading to having a value (thus\n       * possibly triggering a re-render), and React re-renders before the\n       * chained .then() functions run, thus starting a new execution as the\n       * dep has changed value. Without this check we will run the selector\n       * twice (once in the new execution and once again in this .then(), so\n       * this check is necessary to keep unnecessary re-executions to a\n       * minimum).\n       *\n       * Also note this code does not check across all executions that may be\n       * running. It only optimizes for the _latest_ execution per store as\n       * we currently do not maintain a list of all currently running executions.\n       * This means in some cases we may run selectors more than strictly\n       * necessary when there are multiple executions running for the same\n       * selector. This may be a valid tradeoff as checking for dep changes\n       * across all in-progress executions may take longer than just\n       * re-running the selector. This will be app-dependent, and maybe in the\n       * future we can make the behavior configurable. An ideal fix may be\n       * to extend the tree cache to support caching loading states.\n       */\n\n\n      if (!isLatestExecution(store, executionId)) {\n        var _executionInfo$latest;\n\n        var executionInfo = getExecutionInfoOfInProgressExecution(state);\n\n        if ((executionInfo === null || executionInfo === void 0 ? void 0 : (_executionInfo$latest = executionInfo.latestLoadable) === null || _executionInfo$latest === void 0 ? void 0 : _executionInfo$latest.state) === 'loading') {\n          /**\n           * Returning promise here without wrapping as the wrapper logic was\n           * already done upstream when this promise was generated.\n           */\n          return executionInfo.latestLoadable.contents;\n        }\n      }\n\n      var _evaluateSelectorGett = evaluateSelectorGetter(store, state, executionId, bypassSelectorDepCacheOnReevaluation),\n          _evaluateSelectorGett2 = _slicedToArray(_evaluateSelectorGett, 2),\n          loadable = _evaluateSelectorGett2[0],\n          depValues = _evaluateSelectorGett2[1];\n\n      if (isLatestExecution(store, executionId)) {\n        updateExecutionInfoDepValues(depValues, store, executionId);\n      }\n\n      maybeFreezeLoadableContents(loadable);\n\n      if (loadable.state !== 'loading') {\n        setCache(state, depValuesToDepRoute(depValues), loadable);\n        setDepsInStore(store, state, new Set(depValues.keys()), executionId);\n        setLoadableInStoreToNotifyDeps(store, loadable, executionId);\n      }\n\n      if (loadable.state === 'hasError') {\n        throw loadable.contents;\n      }\n\n      if (loadable.state === 'hasValue') {\n        return {\n          __value: loadable.contents,\n          __key: key\n        };\n      }\n      /**\n       * Returning promise here without wrapping as the wrapepr logic was\n       * already done when we called evaluateSelectorGetter() to get this\n       * loadable\n       */\n\n\n      return loadable.contents;\n    }).catch(function (error) {\n      if (!selectorIsLive()) {\n        // The selector was released since the request began; ignore the response.\n        clearExecutionInfo(store, executionId);\n        return CANCELED$2;\n      }\n\n      var loadable = loadableWithError$1(error);\n      maybeFreezeValue(error);\n      setCache(state, depValuesToDepRoute(existingDeps), loadableWithError$1(error));\n      setDepsInStore(store, state, new Set(existingDeps.keys()), executionId);\n      setLoadableInStoreToNotifyDeps(store, loadable, executionId);\n      throw error;\n    });\n  }\n\n  function setLoadableInStoreToNotifyDeps(store, loadable, executionId) {\n    if (isLatestExecution(store, executionId)) {\n      setExecutionInfo(loadable, store);\n      notifyStoresOfSettledAsync(loadable, executionId);\n    }\n  }\n\n  function setDepsInStore(store, state, deps, executionId) {\n    var _store$getState, _store$getState$curre, _store$getState2, _store$getState2$next;\n\n    if (isLatestExecution(store, executionId) || state.version === ((_store$getState = store.getState()) === null || _store$getState === void 0 ? void 0 : (_store$getState$curre = _store$getState.currentTree) === null || _store$getState$curre === void 0 ? void 0 : _store$getState$curre.version) || state.version === ((_store$getState2 = store.getState()) === null || _store$getState2 === void 0 ? void 0 : (_store$getState2$next = _store$getState2.nextTree) === null || _store$getState2$next === void 0 ? void 0 : _store$getState2$next.version)) {\n      var _store$getState$nextT, _store$getState3, _store$getState3$next;\n\n      saveDependencyMapToStore$1(new Map([[key, deps]]), store, (_store$getState$nextT = (_store$getState3 = store.getState()) === null || _store$getState3 === void 0 ? void 0 : (_store$getState3$next = _store$getState3.nextTree) === null || _store$getState3$next === void 0 ? void 0 : _store$getState3$next.version) !== null && _store$getState$nextT !== void 0 ? _store$getState$nextT : store.getState().currentTree.version);\n    }\n  }\n\n  function setNewDepInStore(store, state, deps, newDepKey, executionId) {\n    deps.add(newDepKey);\n    setDepsInStore(store, state, deps, executionId);\n  }\n\n  function evaluateSelectorGetter(store, state, executionId) {\n    var bypassSelectorDepCache = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : false;\n    var endPerfBlock = startPerfBlock$1(key); // TODO T63965866: use execution ID here\n\n    var result;\n    var resultIsError = false;\n    var loadable;\n    var depValues = new Map();\n    /**\n     * Starting a fresh set of deps that we'll be using to update state. We're\n     * starting a new set versus adding it in existing state deps because\n     * the version of state that we update deps for may be a more recent version\n     * than the version the selector was called with. This is because the latest\n     * execution will update the deps of the current/latest version of state (\n     * this is safe to do because the fact that the selector is the latest\n     * execution means the deps we discover below are our best guess at the\n     * deps for the current/latest state in the store)\n     */\n\n    var deps = new Set();\n    setDepsInStore(store, state, deps, executionId);\n\n    function getRecoilValue(recoilValue) {\n      var depKey = recoilValue.key;\n      setNewDepInStore(store, state, deps, depKey, executionId);\n      var depLoadable = bypassSelectorDepCache ? getNodeLoadable$2(store, state, depKey) : getCachedNodeLoadable(store, state, depKey);\n      maybeFreezeLoadableContents(depLoadable);\n      depValues.set(depKey, depLoadable);\n\n      if (depLoadable.state === 'hasValue') {\n        return depLoadable.contents;\n      }\n\n      throw depLoadable.contents;\n    }\n\n    var gateCallback = false;\n\n    var getCallback = function getCallback(fn) {\n      return function () {\n        if (!gateCallback) {\n          throw new Error('getCallback() should only be called asynchronously after the selector is evalutated.  It can be used for selectors to return objects with callbacks that can obtain the current Recoil state without a subscription.');\n        }\n\n        var snapshot = cloneSnapshot$2(store);\n        var cb = fn({\n          snapshot: snapshot\n        });\n\n        if (typeof cb !== 'function') {\n          throw new Error('getCallback() expects a function that returns a function.');\n        }\n\n        return cb.apply(void 0, arguments);\n      };\n    };\n\n    try {\n      result = get({\n        get: getRecoilValue,\n        getCallback: getCallback\n      });\n      result = isRecoilValue$3(result) ? getRecoilValue(result) : result;\n      gateCallback = true;\n\n      if (Recoil_isPromise(result)) {\n        result = wrapPendingPromise(store, result, state, depValues, executionId).finally(endPerfBlock);\n      } else {\n        endPerfBlock();\n      }\n    } catch (errorOrDepPromise) {\n      result = errorOrDepPromise;\n\n      if (Recoil_isPromise(result)) {\n        result = wrapPendingDependencyPromise(store, result, state, depValues, executionId).finally(endPerfBlock);\n      } else {\n        resultIsError = true;\n        endPerfBlock();\n      }\n    }\n\n    if (resultIsError) {\n      loadable = loadableWithError$1(result);\n    } else if (Recoil_isPromise(result)) {\n      loadable = loadableWithPromise$1(result);\n    } else {\n      loadable = loadableWithValue$2(result);\n    }\n\n    maybeFreezeLoadableContents(loadable);\n    return [loadable, depValues];\n  }\n\n  function getValFromCacheAndUpdatedDownstreamDeps(store, state) {\n    var depsAfterCacheDone = new Set();\n    var executionInfo = getExecutionInfo(store);\n    var cachedVal = cache.get(function (nodeKey) {\n      !(typeof nodeKey === 'string') ? process.env.NODE_ENV !== \"production\" ? Recoil_invariant(false, 'Cache nodeKey is type string') : Recoil_invariant(false) : void 0;\n      var loadable = getCachedNodeLoadable(store, state, nodeKey);\n      return loadable.contents;\n    }, {\n      onNodeVisit: function onNodeVisit(node) {\n        if (node.type === 'branch' && node.nodeKey !== key && typeof node.nodeKey === 'string') {\n          depsAfterCacheDone.add(node.nodeKey);\n        }\n      }\n    });\n    /**\n     * Ensure store contains correct dependencies if we hit the cache so that\n     * the store deps and cache are in sync for a given state. This is important\n     * because store deps are normally updated when new executions are created,\n     * but cache hits don't trigger new executions but they still _may_ signifiy\n     * a change in deps in the store if the store deps for this state are empty\n     * or stale.\n     */\n\n    if (cachedVal) {\n      setDepsInStore(store, state, depsAfterCacheDone, executionInfo.latestExecutionId);\n    }\n\n    return cachedVal;\n  }\n  /**\n   * FIXME: dep keys should take into account the state of the loadable to\n   * prevent the edge case where a loadable with an error and a loadable with\n   * an error as a value are treated as the same thing incorrectly. For example\n   * these two should be treated differently:\n   *\n   * selector({key: '', get: () => new Error('hi')});\n   * selector({key: '', get () => {throw new Error('hi')}});\n   *\n   * With current implementation they are treated the same\n   */\n\n\n  function depValuesToDepRoute(depValues) {\n    return Array.from(depValues.entries()).map(function (_ref23) {\n      var _ref24 = _slicedToArray(_ref23, 2),\n          key = _ref24[0],\n          valLoadable = _ref24[1];\n\n      return [key, valLoadable.contents];\n    });\n  }\n\n  function getValFromRunningNewExecutionAndUpdatedDeps(store, state) {\n    var newExecutionId = getNewExecutionId();\n\n    var _evaluateSelectorGett3 = evaluateSelectorGetter(store, state, newExecutionId),\n        _evaluateSelectorGett4 = _slicedToArray(_evaluateSelectorGett3, 2),\n        loadable = _evaluateSelectorGett4[0],\n        newDepValues = _evaluateSelectorGett4[1];\n\n    setExecutionInfo(loadable, store, newDepValues, newExecutionId, state);\n    maybeSetCacheWithLoadable(state, depValuesToDepRoute(newDepValues), loadable);\n    notifyStoreWhenAsyncSettles(store, loadable, newExecutionId);\n    return loadable;\n  }\n  /**\n   * Given a tree state, this function returns the \"selector result\", which is\n   * defined as a size-2 tuple of [DependencyMap, Loadable<T>].\n   *\n   * The selector's get() function will only be re-evaluated if _both_ of the\n   * following statements are true:\n   *\n   * 1. The current dep values from the given state produced a cache key that\n   *    was not found in the cache.\n   * 2. There is no currently running async execution OR there is an\n   *    async execution that is running, but after comparing the dep values in\n   *    the given state with the dep values that the execution has discovered so\n   *    far we find that at least one dep value has changed, in which case we\n   *    start a new execution (the previously running execution will continue to\n   *    run to completion, but only the new execution will be deemed the\n   *    'latest' execution, meaning it will be the only execution that will\n   *    update global state when it is finished. Any non-latest executions will\n   *    run to completion and update the selector cache but not global state).\n   */\n\n\n  function getSelectorValAndUpdatedDeps(store, state) {\n    var cachedVal = getValFromCacheAndUpdatedDownstreamDeps(store, state);\n\n    if (cachedVal != null) {\n      setExecutionInfo(cachedVal, store);\n      return cachedVal;\n    }\n\n    var inProgressExecutionInfo = getExecutionInfoOfInProgressExecution(state); // FIXME: this won't work with custom caching b/c it uses separate cache\n\n    if (inProgressExecutionInfo) {\n      var executionInfo = inProgressExecutionInfo;\n      notifyStoreWhenAsyncSettles(store, Recoil_nullthrows(executionInfo.latestLoadable), Recoil_nullthrows(executionInfo.latestExecutionId)); // FIXME: check after the fact to see if we made the right choice by waiting\n\n      return Recoil_nullthrows(executionInfo.latestLoadable);\n    }\n\n    return getValFromRunningNewExecutionAndUpdatedDeps(store, state);\n  }\n  /**\n   * Searches execution info across all stores to see if there is an in-progress\n   * execution whose dependency values match the values of the requesting store.\n   */\n\n\n  function getExecutionInfoOfInProgressExecution(state) {\n    var _Array$from$find;\n\n    var _ref25 = (_Array$from$find = Array.from(executionInfoMap.entries()).find(function (_ref27) {\n      var _ref28 = _slicedToArray(_ref27, 2),\n          store = _ref28[0],\n          executionInfo = _ref28[1];\n\n      return executionInfo.latestLoadable != null && executionInfo.latestExecutionId != null && !haveAsyncDepsChanged(store, state);\n    })) !== null && _Array$from$find !== void 0 ? _Array$from$find : [],\n        _ref26 = _slicedToArray(_ref25, 2),\n        executionInfo = _ref26[1];\n\n    return executionInfo;\n  }\n\n  var mapOfCheckedVersions = new Map();\n\n  function haveAsyncDepsChanged(store, state) {\n    var _executionInfo$depVal, _mapOfCheckedVersions;\n\n    var executionInfo = getExecutionInfo(store);\n    var oldDepValues = (_executionInfo$depVal = executionInfo.depValuesDiscoveredSoFarDuringAsyncWork) !== null && _executionInfo$depVal !== void 0 ? _executionInfo$depVal : new Map();\n    var cachedDepValuesCheckedForThisVersion = Array(((_mapOfCheckedVersions = mapOfCheckedVersions.get(state.version)) !== null && _mapOfCheckedVersions !== void 0 ? _mapOfCheckedVersions : new Map()).entries());\n    var isCachedVersionSame = mapOfCheckedVersions.has(state.version) && cachedDepValuesCheckedForThisVersion.length === oldDepValues.size && cachedDepValuesCheckedForThisVersion.every(function (_ref29) {\n      var _ref30 = _slicedToArray(_ref29, 2),\n          nodeKey = _ref30[0],\n          nodeVal = _ref30[1];\n\n      return oldDepValues.get(nodeKey) === nodeVal;\n    });\n\n    if (oldDepValues == null || state.version === executionInfo.stateVersion || isCachedVersionSame) {\n      return false;\n    }\n\n    mapOfCheckedVersions.set(state.version, new Map(oldDepValues));\n    return Array.from(oldDepValues).some(function (_ref31) {\n      var _ref32 = _slicedToArray(_ref31, 2),\n          nodeKey = _ref32[0],\n          oldVal = _ref32[1];\n\n      var loadable = getCachedNodeLoadable(store, state, nodeKey);\n      return loadable.contents !== oldVal.contents;\n    });\n  }\n  /**\n   * This function will update the selector's execution info when the selector\n   * has either finished running an execution or has started a new execution. If\n   * the given loadable is in a 'loading' state, the intention is that a new\n   * execution has started. Otherwise, the intention is that an execution has\n   * just finished.\n   */\n\n\n  function setExecutionInfo(loadable, store, depValues, newExecutionId, state) {\n    var executionInfo = getExecutionInfo(store);\n\n    if (loadable.state === 'loading') {\n      executionInfo.depValuesDiscoveredSoFarDuringAsyncWork = depValues;\n      executionInfo.latestExecutionId = newExecutionId;\n      executionInfo.latestLoadable = loadable;\n      executionInfo.stateVersion = state === null || state === void 0 ? void 0 : state.version;\n    } else {\n      executionInfo.depValuesDiscoveredSoFarDuringAsyncWork = null;\n      executionInfo.latestExecutionId = null;\n      executionInfo.latestLoadable = null;\n      executionInfo.stateVersion = null;\n    }\n  }\n  /**\n   * Conditionally updates the cache with a given loadable.\n   *\n   * We only cache loadables that are not loading because our cache keys are\n   * based on dep values, which are in an unfinished state for loadables that\n   * have a 'loading' state (new deps may be discovered while the selector\n   * runs its async code). We never want to cache partial dependencies b/c it\n   * could lead to errors, such as prematurely returning the result based on a\n   * partial list of deps-- we need the full list of deps to ensure that we\n   * are returning the correct result from cache.\n   */\n\n\n  function maybeSetCacheWithLoadable(state, depRoute, loadable) {\n    if (loadable.state !== 'loading') {\n      setCache(state, depRoute, loadable);\n    }\n  }\n\n  function updateExecutionInfoDepValues(depValues, store, executionId) {\n    var executionInfo = getExecutionInfo(store);\n\n    if (isLatestExecution(store, executionId)) {\n      executionInfo.depValuesDiscoveredSoFarDuringAsyncWork = depValues;\n    }\n  }\n\n  function clearExecutionInfo(store, executionId) {\n    if (isLatestExecution(store, executionId)) {\n      executionInfoMap.delete(store);\n    }\n  }\n\n  function isLatestExecution(store, executionId) {\n    var executionInfo = getExecutionInfo(store);\n    return executionId === executionInfo.latestExecutionId;\n  }\n\n  function maybeFreezeLoadableContents(loadable) {\n    if (loadable.state !== 'loading') {\n      maybeFreezeValue(loadable.contents);\n    }\n  }\n\n  function maybeFreezeValue(val) {\n    if (process.env.NODE_ENV !== \"production\") {\n      if (Boolean(options.dangerouslyAllowMutability) === false) {\n        Recoil_deepFreezeValue(val);\n      }\n    }\n  }\n\n  function setCache(state, cacheRoute, loadable) {\n    state.atomValues.set(key, loadable);\n    cache.set(cacheRoute, loadable);\n  }\n\n  function detectCircularDependencies(fn) {\n    if (dependencyStack.includes(key)) {\n      var message = \"Recoil selector has circular dependencies: \".concat(dependencyStack.slice(dependencyStack.indexOf(key)).join(\" \\u2192 \"));\n      return loadableWithError$1(new Error(message));\n    }\n\n    dependencyStack.push(key);\n\n    try {\n      return fn();\n    } finally {\n      dependencyStack.pop();\n    }\n  }\n\n  function selectorPeek(store, state) {\n    var cacheVal = cache.get(function (nodeKey) {\n      !(typeof nodeKey === 'string') ? process.env.NODE_ENV !== \"production\" ? Recoil_invariant(false, 'Cache nodeKey is type string') : Recoil_invariant(false) : void 0;\n      var peek = peekNodeLoadable$1(store, state, nodeKey);\n      return peek === null || peek === void 0 ? void 0 : peek.contents;\n    });\n    return cacheVal;\n  }\n\n  function selectorGet(store, state) {\n    return detectCircularDependencies(function () {\n      return getSelectorValAndUpdatedDeps(store, state);\n    });\n  }\n\n  function invalidateSelector(state) {\n    state.atomValues.delete(key);\n  }\n\n  if (set != null) {\n    /**\n     * ES5 strict mode prohibits defining non-top-level function declarations,\n     * so don't use function declaration syntax here\n     */\n    var selectorSet = function selectorSet(store, state, newValue) {\n      var syncSelectorSetFinished = false;\n      var writes = new Map();\n\n      function getRecoilValue(_ref33) {\n        var key = _ref33.key;\n\n        if (syncSelectorSetFinished) {\n          throw new Error('Recoil: Async selector sets are not currently supported.');\n        }\n\n        var loadable = getCachedNodeLoadable(store, state, key);\n        maybeFreezeLoadableContents(loadable);\n\n        if (loadable.state === 'hasValue') {\n          return loadable.contents;\n        } else if (loadable.state === 'loading') {\n          throw new RecoilValueNotReady$2(key);\n        } else {\n          throw loadable.contents;\n        }\n      }\n\n      function setRecoilState(recoilState, valueOrUpdater) {\n        if (syncSelectorSetFinished) {\n          throw new Error('Recoil: Async selector sets are not currently supported.');\n        }\n\n        var newValue = typeof valueOrUpdater === 'function' ? // cast to any because we can't restrict type S from being a function itself without losing support for opaque types\n        // flowlint-next-line unclear-type:off\n        valueOrUpdater(getRecoilValue(recoilState)) : valueOrUpdater;\n        var upstreamWrites = setNodeValue$3(store, state, recoilState.key, newValue);\n        upstreamWrites.forEach(function (v, k) {\n          return writes.set(k, v);\n        });\n      }\n\n      function resetRecoilState(recoilState) {\n        setRecoilState(recoilState, DEFAULT_VALUE$4);\n      }\n\n      var ret = set({\n        set: setRecoilState,\n        get: getRecoilValue,\n        reset: resetRecoilState\n      }, newValue); // set should be a void method, but if the user makes it `async`, then it\n      // will return a Promise, which we don't currently support.\n\n      if (ret !== undefined) {\n        throw Recoil_isPromise(ret) ? new Error('Recoil: Async selector sets are not currently supported.') : new Error('Recoil: selector set should be a void function.');\n      }\n\n      syncSelectorSetFinished = true;\n      return writes;\n    };\n\n    return registerNode$1({\n      key: key,\n      nodeType: 'selector',\n      peek: selectorPeek,\n      get: selectorGet,\n      set: selectorSet,\n      init: selectorInit,\n      invalidate: invalidateSelector,\n      shouldDeleteConfigOnRelease: selectorShouldDeleteConfigOnRelease,\n      dangerouslyAllowMutability: options.dangerouslyAllowMutability,\n      shouldRestoreFromSnapshots: false,\n      retainedBy: retainedBy\n    });\n  } else {\n    return registerNode$1({\n      key: key,\n      nodeType: 'selector',\n      peek: selectorPeek,\n      get: selectorGet,\n      init: selectorInit,\n      invalidate: invalidateSelector,\n      shouldDeleteConfigOnRelease: selectorShouldDeleteConfigOnRelease,\n      dangerouslyAllowMutability: options.dangerouslyAllowMutability,\n      shouldRestoreFromSnapshots: false,\n      retainedBy: retainedBy\n    });\n  }\n}\n/* eslint-enable no-redeclare */\n\n\nvar Recoil_selector = selector; // @fb-only: const {scopedAtom} = require('Recoil_ScopedAtom');\n\nvar loadableWithError$2 = Recoil_Loadable.loadableWithError,\n    loadableWithPromise$2 = Recoil_Loadable.loadableWithPromise,\n    loadableWithValue$3 = Recoil_Loadable.loadableWithValue;\nvar DEFAULT_VALUE$5 = Recoil_Node.DEFAULT_VALUE,\n    DefaultValue$2 = Recoil_Node.DefaultValue,\n    getConfigDeletionHandler$2 = Recoil_Node.getConfigDeletionHandler,\n    registerNode$2 = Recoil_Node.registerNode,\n    setConfigDeletionHandler$1 = Recoil_Node.setConfigDeletionHandler;\nvar isRecoilValue$4 = Recoil_RecoilValue$1.isRecoilValue;\nvar markRecoilValueModified$1 = Recoil_RecoilValueInterface.markRecoilValueModified,\n    setRecoilValue$3 = Recoil_RecoilValueInterface.setRecoilValue,\n    setRecoilValueLoadable$3 = Recoil_RecoilValueInterface.setRecoilValueLoadable;\nvar retainedByOptionWithDefault$2 = Recoil_Retention.retainedByOptionWithDefault;\n\nfunction baseAtom(options) {\n  var key = options.key,\n      persistence = options.persistence_UNSTABLE;\n  var retainedBy = retainedByOptionWithDefault$2(options.retainedBy_UNSTABLE);\n  var liveStoresCount = 0;\n  var defaultLoadable = Recoil_isPromise(options.default) ? loadableWithPromise$2(options.default.then(function (value) {\n    defaultLoadable = loadableWithValue$3(value); // TODO Temporary disable Flow due to pending selector_NEW refactor\n\n    var promiseInfo = {\n      __key: key,\n      __value: value\n    };\n    return promiseInfo;\n  }).catch(function (error) {\n    defaultLoadable = loadableWithError$2(error);\n    throw error;\n  })) : loadableWithValue$3(options.default);\n  var cachedAnswerForUnvalidatedValue = undefined; // Cleanup handlers for this atom\n  // Rely on stable reference equality of the store to use it as a key per <RecoilRoot>\n\n  var cleanupEffectsByStore = new Map();\n\n  function wrapPendingPromise(store, promise) {\n    var wrappedPromise = promise.then(function (value) {\n      var _store$getState$nextT, _state$atomValues$get;\n\n      var state = (_store$getState$nextT = store.getState().nextTree) !== null && _store$getState$nextT !== void 0 ? _store$getState$nextT : store.getState().currentTree;\n\n      if (((_state$atomValues$get = state.atomValues.get(key)) === null || _state$atomValues$get === void 0 ? void 0 : _state$atomValues$get.contents) === wrappedPromise) {\n        setRecoilValue$3(store, node, value);\n      }\n\n      return {\n        __key: key,\n        __value: value\n      };\n    }).catch(function (error) {\n      var _store$getState$nextT2, _state$atomValues$get2;\n\n      var state = (_store$getState$nextT2 = store.getState().nextTree) !== null && _store$getState$nextT2 !== void 0 ? _store$getState$nextT2 : store.getState().currentTree;\n\n      if (((_state$atomValues$get2 = state.atomValues.get(key)) === null || _state$atomValues$get2 === void 0 ? void 0 : _state$atomValues$get2.contents) === wrappedPromise) {\n        setRecoilValueLoadable$3(store, node, loadableWithError$2(error));\n      }\n\n      throw error;\n    });\n    return wrappedPromise;\n  }\n\n  function initAtom(store, initState, trigger) {\n    liveStoresCount++;\n    var alreadyKnown = store.getState().knownAtoms.has(key);\n    store.getState().knownAtoms.add(key); // Setup async defaults to notify subscribers when they resolve\n\n    if (defaultLoadable.state === 'loading') {\n      var notifyDefaultSubscribers = function notifyDefaultSubscribers() {\n        var _store$getState$nextT3;\n\n        var state = (_store$getState$nextT3 = store.getState().nextTree) !== null && _store$getState$nextT3 !== void 0 ? _store$getState$nextT3 : store.getState().currentTree;\n\n        if (!state.atomValues.has(key)) {\n          markRecoilValueModified$1(store, node);\n        }\n      };\n\n      defaultLoadable.contents.then(notifyDefaultSubscribers).catch(notifyDefaultSubscribers);\n    } // Run Atom Effects\n    // This state is scoped by Store, since this is in the initAtom() closure\n\n\n    var initValue = DEFAULT_VALUE$5;\n    var pendingSetSelf = null;\n\n    if (options.effects_UNSTABLE != null && !alreadyKnown) {\n      var duringInit = true;\n\n      var setSelf = function setSelf(effect) {\n        return function (valueOrUpdater) {\n          if (duringInit) {\n            var currentValue = initValue instanceof DefaultValue$2 || Recoil_isPromise(initValue) ? defaultLoadable.state === 'hasValue' ? defaultLoadable.contents : DEFAULT_VALUE$5 : initValue;\n            initValue = typeof valueOrUpdater === 'function' ? // cast to any because we can't restrict T from being a function without losing support for opaque types\n            valueOrUpdater(currentValue) // flowlint-line unclear-type:off\n            : valueOrUpdater; // Avoid calling onSet() when setSelf() initializes with a Promise\n\n            if (Recoil_isPromise(initValue)) {\n              initValue = initValue.then(function (value) {\n                pendingSetSelf = {\n                  effect: effect,\n                  value: value\n                };\n                return value;\n              });\n            }\n          } else {\n            if (Recoil_isPromise(valueOrUpdater)) {\n              throw new Error('Setting atoms to async values is not implemented.');\n            }\n\n            if (typeof valueOrUpdater !== 'function') {\n              pendingSetSelf = {\n                effect: effect,\n                value: valueOrUpdater\n              };\n            }\n\n            setRecoilValue$3(store, node, typeof valueOrUpdater === 'function' ? function (currentValue) {\n              var newValue = // cast to any because we can't restrict T from being a function without losing support for opaque types\n              valueOrUpdater(currentValue); // flowlint-line unclear-type:off\n\n              pendingSetSelf = {\n                effect: effect,\n                value: newValue\n              };\n              return newValue;\n            } : valueOrUpdater);\n          }\n        };\n      };\n\n      var resetSelf = function resetSelf(effect) {\n        return function () {\n          return setSelf(effect)(DEFAULT_VALUE$5);\n        };\n      };\n\n      var onSet = function onSet(effect) {\n        return function (handler) {\n          store.subscribeToTransactions(function (currentStore) {\n            var _currentTree$atomValu; // eslint-disable-next-line prefer-const\n\n\n            var _currentStore$getStat = currentStore.getState(),\n                currentTree = _currentStore$getStat.currentTree,\n                previousTree = _currentStore$getStat.previousTree;\n\n            if (!previousTree) {\n              Recoil_recoverableViolation('Transaction subscribers notified without a next tree being present -- this is a bug in Recoil');\n              previousTree = currentTree; // attempt to trundle on\n            }\n\n            var newLoadable = (_currentTree$atomValu = currentTree.atomValues.get(key)) !== null && _currentTree$atomValu !== void 0 ? _currentTree$atomValu : defaultLoadable;\n\n            if (newLoadable.state === 'hasValue') {\n              var _previousTree$atomVal, _pendingSetSelf, _pendingSetSelf2, _pendingSetSelf3;\n\n              var newValue = newLoadable.contents;\n              var oldLoadable = (_previousTree$atomVal = previousTree.atomValues.get(key)) !== null && _previousTree$atomVal !== void 0 ? _previousTree$atomVal : defaultLoadable;\n              var oldValue = oldLoadable.state === 'hasValue' ? oldLoadable.contents : DEFAULT_VALUE$5; // TODO This isn't actually valid, use as a placeholder for now.\n              // Ignore atom value changes that were set via setSelf() in the same effect.\n              // We will still properly call the handler if there was a subsequent\n              // set from something other than an atom effect which was batched\n              // with the `setSelf()` call.  However, we may incorrectly ignore\n              // the handler if the subsequent batched call happens to set the\n              // atom to the exact same value as the `setSelf()`.   But, in that\n              // case, it was kind of a noop, so the semantics are debatable..\n\n              if (((_pendingSetSelf = pendingSetSelf) === null || _pendingSetSelf === void 0 ? void 0 : _pendingSetSelf.effect) !== effect || ((_pendingSetSelf2 = pendingSetSelf) === null || _pendingSetSelf2 === void 0 ? void 0 : _pendingSetSelf2.value) !== newValue) {\n                handler(newValue, oldValue);\n              } else if (((_pendingSetSelf3 = pendingSetSelf) === null || _pendingSetSelf3 === void 0 ? void 0 : _pendingSetSelf3.effect) === effect) {\n                pendingSetSelf = null;\n              }\n            }\n          }, key);\n        };\n      };\n\n      var _iterator46 = _createForOfIteratorHelper((_options$effects_UNST = options.effects_UNSTABLE) !== null && _options$effects_UNST !== void 0 ? _options$effects_UNST : []),\n          _step46;\n\n      try {\n        for (_iterator46.s(); !(_step46 = _iterator46.n()).done;) {\n          var effect = _step46.value;\n\n          var _options$effects_UNST;\n\n          var cleanup = effect({\n            node: node,\n            trigger: trigger,\n            setSelf: setSelf(effect),\n            resetSelf: resetSelf(effect),\n            onSet: onSet(effect)\n          });\n\n          if (cleanup != null) {\n            var _cleanupEffectsByStor;\n\n            cleanupEffectsByStore.set(store, [].concat(_toConsumableArray((_cleanupEffectsByStor = cleanupEffectsByStore.get(store)) !== null && _cleanupEffectsByStor !== void 0 ? _cleanupEffectsByStor : []), [cleanup]));\n          }\n        }\n      } catch (err) {\n        _iterator46.e(err);\n      } finally {\n        _iterator46.f();\n      }\n\n      duringInit = false;\n    } // Mutate initial state in place since we know there are no other subscribers\n    // since we are the ones initializing on first use.\n\n\n    if (!(initValue instanceof DefaultValue$2)) {\n      var _store$getState$nextT4;\n\n      var initLoadable = Recoil_isPromise(initValue) ? loadableWithPromise$2(wrapPendingPromise(store, initValue)) : loadableWithValue$3(initValue);\n      initState.atomValues.set(key, initLoadable); // If there is a pending transaction, then also mutate the next state tree.\n      // This could happen if the atom was first initialized in an action that\n      // also updated some other atom's state.\n\n      (_store$getState$nextT4 = store.getState().nextTree) === null || _store$getState$nextT4 === void 0 ? void 0 : _store$getState$nextT4.atomValues.set(key, initLoadable);\n    }\n\n    return function () {\n      var _cleanupEffectsByStor2;\n\n      liveStoresCount--;\n      (_cleanupEffectsByStor2 = cleanupEffectsByStore.get(store)) === null || _cleanupEffectsByStor2 === void 0 ? void 0 : _cleanupEffectsByStor2.forEach(function (cleanup) {\n        return cleanup();\n      });\n      cleanupEffectsByStore.delete(store);\n      store.getState().knownAtoms.delete(key); // FIXME remove knownAtoms?\n    };\n  }\n\n  function peekAtom(_store, state) {\n    var _ref, _state$atomValues$get3, _cachedAnswerForUnval;\n\n    return (_ref = (_state$atomValues$get3 = state.atomValues.get(key)) !== null && _state$atomValues$get3 !== void 0 ? _state$atomValues$get3 : (_cachedAnswerForUnval = cachedAnswerForUnvalidatedValue) === null || _cachedAnswerForUnval === void 0 ? void 0 : _cachedAnswerForUnval[1]) !== null && _ref !== void 0 ? _ref : defaultLoadable;\n  }\n\n  function getAtom(_store, state) {\n    if (state.atomValues.has(key)) {\n      // Atom value is stored in state:\n      return Recoil_nullthrows(state.atomValues.get(key));\n    } else if (state.nonvalidatedAtoms.has(key)) {\n      // Atom value is stored but needs validation before use.\n      // We might have already validated it and have a cached validated value:\n      if (cachedAnswerForUnvalidatedValue != null) {\n        return cachedAnswerForUnvalidatedValue;\n      }\n\n      if (persistence == null) {\n        Recoil_expectationViolation(\"Tried to restore a persisted value for atom \".concat(key, \" but it has no persistence settings.\"));\n        return defaultLoadable;\n      }\n\n      var nonvalidatedValue = state.nonvalidatedAtoms.get(key);\n      var validatorResult = persistence.validator(nonvalidatedValue, DEFAULT_VALUE$5);\n      var validatedValueLoadable = validatorResult instanceof DefaultValue$2 ? defaultLoadable : loadableWithValue$3(validatorResult);\n      cachedAnswerForUnvalidatedValue = validatedValueLoadable;\n      return cachedAnswerForUnvalidatedValue;\n    } else {\n      return defaultLoadable;\n    }\n  }\n\n  function invalidateAtom() {\n    cachedAnswerForUnvalidatedValue = undefined;\n  }\n\n  function setAtom(_store, state, newValue) {\n    // Bail out if we're being set to the existing value, or if we're being\n    // reset but have no stored value (validated or unvalidated) to reset from:\n    if (state.atomValues.has(key)) {\n      var existing = Recoil_nullthrows(state.atomValues.get(key));\n\n      if (existing.state === 'hasValue' && newValue === existing.contents) {\n        return new Map();\n      }\n    } else if (!state.nonvalidatedAtoms.has(key) && newValue instanceof DefaultValue$2) {\n      return new Map();\n    }\n\n    if (process.env.NODE_ENV !== \"production\") {\n      if (options.dangerouslyAllowMutability !== true) {\n        Recoil_deepFreezeValue(newValue);\n      }\n    }\n\n    cachedAnswerForUnvalidatedValue = undefined; // can be released now if it was previously in use\n\n    return new Map().set(key, loadableWithValue$3(newValue));\n  }\n\n  function shouldDeleteConfigOnReleaseAtom() {\n    return getConfigDeletionHandler$2(key) !== undefined && liveStoresCount <= 0;\n  }\n\n  var node = registerNode$2({\n    key: key,\n    nodeType: 'atom',\n    peek: peekAtom,\n    get: getAtom,\n    set: setAtom,\n    init: initAtom,\n    invalidate: invalidateAtom,\n    shouldDeleteConfigOnRelease: shouldDeleteConfigOnReleaseAtom,\n    dangerouslyAllowMutability: options.dangerouslyAllowMutability,\n    persistence_UNSTABLE: options.persistence_UNSTABLE ? {\n      type: options.persistence_UNSTABLE.type,\n      backButton: options.persistence_UNSTABLE.backButton\n    } : undefined,\n    shouldRestoreFromSnapshots: true,\n    retainedBy: retainedBy\n  });\n  return node;\n} // prettier-ignore\n\n\nfunction atom(options) {\n  var optionsDefault = options.default,\n      restOptions = _objectWithoutProperties(options, _excluded2);\n\n  if (isRecoilValue$4(optionsDefault) // Continue to use atomWithFallback for promise defaults for scoped atoms\n  // for now, since scoped atoms don't support async defaults\n  // @fb-only: || (isPromise(optionsDefault) && scopeRules_APPEND_ONLY_READ_THE_DOCS)\n  ) {\n    return atomWithFallback(_objectSpread(_objectSpread({}, restOptions), {}, {\n      default: optionsDefault // @fb-only: scopeRules_APPEND_ONLY_READ_THE_DOCS,\n\n    })); // @fb-only: } else if (scopeRules_APPEND_ONLY_READ_THE_DOCS && !isPromise(optionsDefault)) {\n    // @fb-only: return scopedAtom<T>({\n    // @fb-only: ...restOptions,\n    // @fb-only: default: optionsDefault,\n    // @fb-only: scopeRules_APPEND_ONLY_READ_THE_DOCS,\n    // @fb-only: });\n  } else {\n    return baseAtom(_objectSpread(_objectSpread({}, restOptions), {}, {\n      default: optionsDefault\n    }));\n  }\n}\n\nfunction atomWithFallback(options) {\n  var base = atom(_objectSpread(_objectSpread({}, options), {}, {\n    default: DEFAULT_VALUE$5,\n    persistence_UNSTABLE: options.persistence_UNSTABLE === undefined ? undefined : _objectSpread(_objectSpread({}, options.persistence_UNSTABLE), {}, {\n      validator: function validator(storedValue) {\n        return storedValue instanceof DefaultValue$2 ? storedValue : Recoil_nullthrows(options.persistence_UNSTABLE).validator(storedValue, DEFAULT_VALUE$5);\n      }\n    }),\n    // TODO Hack for now.\n    // flowlint-next-line unclear-type: off\n    effects_UNSTABLE: options.effects_UNSTABLE\n  }));\n  var sel = Recoil_selector({\n    key: \"\".concat(options.key, \"__withFallback\"),\n    get: function get(_ref34) {\n      var _get = _ref34.get;\n\n      var baseValue = _get(base);\n\n      return baseValue instanceof DefaultValue$2 ? options.default : baseValue;\n    },\n    set: function set(_ref35, newValue) {\n      var _set = _ref35.set;\n      return _set(base, newValue);\n    },\n    dangerouslyAllowMutability: options.dangerouslyAllowMutability\n  });\n  setConfigDeletionHandler$1(sel.key, getConfigDeletionHandler$2(options.key));\n  return sel;\n}\n\nvar Recoil_atom = atom;\n/**\n * (c) Facebook, Inc. and its affiliates. Confidential and proprietary.\n *\n * @emails oncall+recoil\n * \n * @format\n */\n\nvar MapCache = /*#__PURE__*/function () {\n  function MapCache(options) {\n    _classCallCheck(this, MapCache);\n\n    var _options$mapKey;\n\n    _defineProperty(this, \"_map\", void 0);\n\n    _defineProperty(this, \"_keyMapper\", void 0);\n\n    this._map = new Map();\n    this._keyMapper = (_options$mapKey = options === null || options === void 0 ? void 0 : options.mapKey) !== null && _options$mapKey !== void 0 ? _options$mapKey : function (v) {\n      return v;\n    };\n  }\n\n  _createClass(MapCache, [{\n    key: \"size\",\n    value: function size() {\n      return this._map.size;\n    }\n  }, {\n    key: \"has\",\n    value: function has(key) {\n      return this._map.has(this._keyMapper(key));\n    }\n  }, {\n    key: \"get\",\n    value: function get(key) {\n      return this._map.get(this._keyMapper(key));\n    }\n  }, {\n    key: \"set\",\n    value: function set(key, val) {\n      this._map.set(this._keyMapper(key), val);\n    }\n  }, {\n    key: \"delete\",\n    value: function _delete(key) {\n      this._map.delete(this._keyMapper(key));\n    }\n  }, {\n    key: \"clear\",\n    value: function clear() {\n      this._map.clear();\n    }\n  }]);\n\n  return MapCache;\n}();\n\nvar Recoil_MapCache = {\n  MapCache: MapCache\n};\nvar Recoil_MapCache_1 = Recoil_MapCache.MapCache;\nvar Recoil_MapCache$1 = /*#__PURE__*/Object.freeze({\n  __proto__: null,\n  MapCache: Recoil_MapCache_1\n});\nvar LRUCache$2 = Recoil_LRUCache$1.LRUCache;\nvar MapCache$1 = Recoil_MapCache$1.MapCache;\nvar defaultPolicy$1 = {\n  equality: 'reference',\n  eviction: 'none',\n  maxSize: Infinity\n};\n\nfunction cacheFromPolicy() {\n  var _ref36 = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : defaultPolicy$1,\n      _ref36$equality = _ref36.equality,\n      equality = _ref36$equality === void 0 ? defaultPolicy$1.equality : _ref36$equality,\n      _ref36$eviction = _ref36.eviction,\n      eviction = _ref36$eviction === void 0 ? defaultPolicy$1.eviction : _ref36$eviction,\n      _ref36$maxSize = _ref36.maxSize,\n      maxSize = _ref36$maxSize === void 0 ? defaultPolicy$1.maxSize : _ref36$maxSize;\n\n  var valueMapper = getValueMapper$1(equality);\n  var cache = getCache(eviction, maxSize, valueMapper);\n  return cache;\n}\n\nfunction getValueMapper$1(equality) {\n  switch (equality) {\n    case 'reference':\n      return function (val) {\n        return val;\n      };\n\n    case 'value':\n      return function (val) {\n        return Recoil_stableStringify(val);\n      };\n  }\n\n  throw new Error(\"Unrecognized equality policy \".concat(equality));\n}\n\nfunction getCache(eviction, maxSize, mapKey) {\n  switch (eviction) {\n    case 'keep-all':\n      // $FlowFixMe[method-unbinding]\n      return new MapCache$1({\n        mapKey: mapKey\n      });\n\n    case 'lru':\n      // $FlowFixMe[method-unbinding]\n      return new LRUCache$2({\n        mapKey: mapKey,\n        maxSize: Recoil_nullthrows(maxSize)\n      });\n\n    case 'most-recent':\n      // $FlowFixMe[method-unbinding]\n      return new LRUCache$2({\n        mapKey: mapKey,\n        maxSize: 1\n      });\n  }\n\n  throw new Error(\"Unrecognized eviction policy \".concat(eviction));\n}\n\nvar Recoil_cacheFromPolicy = cacheFromPolicy;\nvar setConfigDeletionHandler$2 = Recoil_Node.setConfigDeletionHandler;\n/*\nA function which returns an atom based on the input parameter.\n\nEach unique parameter returns a unique atom. E.g.,\n\n  const f = atomFamily(...);\n  f({a: 1}) => an atom\n  f({a: 2}) => a different atom\n\nThis allows components to persist local, private state using atoms.  Each\ninstance of the component may have a different key, which it uses as the\nparameter for a family of atoms; in this way, each component will have\nits own atom not shared by other instances.  These state keys may be composed\ninto children's state keys as well.\n*/\n\nfunction atomFamily(options) {\n  var _options$cachePolicyF, _options$cachePolicyF2;\n\n  var atomCache = Recoil_cacheFromPolicy({\n    equality: (_options$cachePolicyF = (_options$cachePolicyF2 = options.cachePolicyForParams_UNSTABLE) === null || _options$cachePolicyF2 === void 0 ? void 0 : _options$cachePolicyF2.equality) !== null && _options$cachePolicyF !== void 0 ? _options$cachePolicyF : 'value',\n    eviction: 'keep-all'\n  }); // Simple atomFamily implementation to cache individual atoms based\n  // on the parameter value equality.\n\n  return function (params) {\n    var _stableStringify;\n\n    var cachedAtom = atomCache.get(params);\n\n    if (cachedAtom != null) {\n      return cachedAtom;\n    }\n\n    var cachePolicyForParams_UNSTABLE = options.cachePolicyForParams_UNSTABLE,\n        atomOptions = _objectWithoutProperties(options, _excluded3);\n\n    var newAtom = Recoil_atom(_objectSpread(_objectSpread({}, atomOptions), {}, {\n      key: \"\".concat(options.key, \"__\").concat((_stableStringify = Recoil_stableStringify(params)) !== null && _stableStringify !== void 0 ? _stableStringify : 'void'),\n      default: typeof options.default === 'function' ? // The default was parameterized\n      // Flow doesn't know that T isn't a function, so we need to case to any\n      options.default(params) // flowlint-line unclear-type:off\n      : // Default may be a static value, promise, or RecoilValue\n      options.default,\n      retainedBy_UNSTABLE: typeof options.retainedBy_UNSTABLE === 'function' ? options.retainedBy_UNSTABLE(params) : options.retainedBy_UNSTABLE,\n      effects_UNSTABLE: typeof options.effects_UNSTABLE === 'function' ? options.effects_UNSTABLE(params) : options.effects_UNSTABLE // prettier-ignore\n      // @fb-only: scopeRules_APPEND_ONLY_READ_THE_DOCS: mapScopeRules(\n      // @fb-only: options.scopeRules_APPEND_ONLY_READ_THE_DOCS,\n      // @fb-only: params,\n      // @fb-only: ),\n\n    }));\n    atomCache.set(params, newAtom);\n    setConfigDeletionHandler$2(newAtom.key, function () {\n      atomCache.delete(params);\n    });\n    return newAtom;\n  };\n}\n\nvar Recoil_atomFamily = atomFamily;\nvar setConfigDeletionHandler$3 = Recoil_Node.setConfigDeletionHandler; // Keep in mind the parameter needs to be serializable as a cahche key\n// using Recoil_stableStringify\n// Add a unique index to each selector in case the cache implementation allows\n// duplicate keys based on equivalent stringified parameters\n\nvar nextIndex = 0;\n/* eslint-disable no-redeclare */\n// Return a function that returns members of a family of selectors of the same type\n// E.g.,\n//\n// const s = selectorFamily(...);\n// s({a: 1}) => a selector\n// s({a: 2}) => a different selector\n//\n// By default, the selectors are distinguished by distinct values of the\n// parameter based on value equality, not reference equality.  This allows using\n// object literals or other equivalent objects at callsites to not create\n// duplicate cache entries.  This behavior may be overridden with the\n// cacheImplementationForParams option.\n\nfunction selectorFamily(options) {\n  var _options$cachePolicyF, _options$cachePolicyF2;\n\n  var selectorCache = Recoil_cacheFromPolicy({\n    equality: (_options$cachePolicyF = (_options$cachePolicyF2 = options.cachePolicyForParams_UNSTABLE) === null || _options$cachePolicyF2 === void 0 ? void 0 : _options$cachePolicyF2.equality) !== null && _options$cachePolicyF !== void 0 ? _options$cachePolicyF : 'value',\n    eviction: 'keep-all'\n  });\n  return function (params) {\n    var _stableStringify;\n\n    var cachedSelector = selectorCache.get(params);\n\n    if (cachedSelector != null) {\n      return cachedSelector;\n    }\n\n    var myKey = \"\".concat(options.key, \"__selectorFamily/\").concat((_stableStringify = Recoil_stableStringify(params, {\n      // It is possible to use functions in parameters if the user uses\n      // a cache with reference equality thanks to the incrementing index.\n      allowFunctions: true\n    })) !== null && _stableStringify !== void 0 ? _stableStringify : 'void', \"/\").concat(nextIndex++); // Append index in case values serialize to the same key string\n\n    var myGet = function myGet(callbacks) {\n      return options.get(params)(callbacks);\n    };\n\n    var myCachePolicy = options.cachePolicy_UNSTABLE;\n    var retainedBy = typeof options.retainedBy_UNSTABLE === 'function' ? options.retainedBy_UNSTABLE(params) : options.retainedBy_UNSTABLE;\n    var newSelector;\n\n    if (options.set != null) {\n      var set = options.set;\n\n      var mySet = function mySet(callbacks, newValue) {\n        return set(params)(callbacks, newValue);\n      };\n\n      newSelector = Recoil_selector({\n        key: myKey,\n        get: myGet,\n        set: mySet,\n        cachePolicy_UNSTABLE: myCachePolicy,\n        dangerouslyAllowMutability: options.dangerouslyAllowMutability,\n        retainedBy_UNSTABLE: retainedBy\n      });\n    } else {\n      newSelector = Recoil_selector({\n        key: myKey,\n        get: myGet,\n        cachePolicy_UNSTABLE: myCachePolicy,\n        dangerouslyAllowMutability: options.dangerouslyAllowMutability,\n        retainedBy_UNSTABLE: retainedBy\n      });\n    }\n\n    selectorCache.set(params, newSelector);\n    setConfigDeletionHandler$3(newSelector.key, function () {\n      selectorCache.delete(params);\n    });\n    return newSelector;\n  };\n}\n/* eslint-enable no-redeclare */\n\n\nvar Recoil_selectorFamily = selectorFamily; // flowlint-next-line unclear-type:off\n\nvar constantSelector = Recoil_selectorFamily({\n  key: '__constant',\n  get: function get(constant) {\n    return function () {\n      return constant;\n    };\n  },\n  cachePolicyForParams_UNSTABLE: {\n    equality: 'reference'\n  }\n}); // Function that returns a selector which always produces the\n// same constant value.  It may be called multiple times with the\n// same value, based on reference equality, and will provide the\n// same selector.\n\nfunction constSelector(constant) {\n  return constantSelector(constant);\n}\n\nvar Recoil_constSelector = constSelector; // flowlint-next-line unclear-type:off\n\nvar throwingSelector = Recoil_selectorFamily({\n  key: '__error',\n  get: function get(message) {\n    return function () {\n      throw new Error(message);\n    };\n  },\n  cachePolicyForParams_UNSTABLE: {\n    equality: 'reference'\n  }\n}); // Function that returns a selector which always throws an error\n// with the provided message.\n\nfunction errorSelector(message) {\n  return throwingSelector(message);\n}\n\nvar Recoil_errorSelector = errorSelector;\n/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * Wraps another recoil value and prevents writing to it.\n *\n * @emails oncall+recoil\n * \n * @format\n */\n\nfunction readOnlySelector(atom) {\n  // flowlint-next-line unclear-type: off\n  return atom;\n}\n\nvar Recoil_readOnlySelector = readOnlySelector;\nvar loadableWithError$3 = Recoil_Loadable.loadableWithError,\n    loadableWithPromise$3 = Recoil_Loadable.loadableWithPromise,\n    loadableWithValue$4 = Recoil_Loadable.loadableWithValue; /////////////////\n//  TRUTH TABLE\n/////////////////\n// Dependencies        waitForNone         waitForAny        waitForAll       waitForAllSettled\n//  [loading, loading]  [Promise, Promise]  Promise           Promise         Promise\n//  [value, loading]    [value, Promise]    [value, Promise]  Promise         Promise\n//  [value, value]      [value, value]      [value, value]    [value, value]  [value, value]\n//\n//  [error, loading]    [Error, Promise]    [Error, Promise]  Error           Promise\n//  [error, error]      [Error, Error]      [Error, Error]    Error           [error, error]\n//  [value, error]      [value, Error]      [value, Error]    Error           [value, error]\n// Issue parallel requests for all dependencies and return the current\n// status if they have results, have some error, or are still pending.\n\nfunction concurrentRequests(getRecoilValue, deps) {\n  var results = Array(deps.length).fill(undefined);\n  var exceptions = Array(deps.length).fill(undefined);\n\n  var _iterator47 = _createForOfIteratorHelper(deps.entries()),\n      _step47;\n\n  try {\n    for (_iterator47.s(); !(_step47 = _iterator47.n()).done;) {\n      var _step47$value = _slicedToArray(_step47.value, 2),\n          i = _step47$value[0],\n          dep = _step47$value[1];\n\n      try {\n        results[i] = getRecoilValue(dep);\n      } catch (e) {\n        // exceptions can either be Promises of pending results or real errors\n        exceptions[i] = e;\n      }\n    }\n  } catch (err) {\n    _iterator47.e(err);\n  } finally {\n    _iterator47.f();\n  }\n\n  return [results, exceptions];\n}\n\nfunction isError(exp) {\n  return exp != null && !Recoil_isPromise(exp);\n}\n\nfunction unwrapDependencies(dependencies) {\n  return Array.isArray(dependencies) ? dependencies : Object.getOwnPropertyNames(dependencies).map(function (key) {\n    return dependencies[key];\n  });\n}\n\nfunction getValueFromLoadablePromiseResult(result) {\n  if (result != null && typeof result === 'object' && result.hasOwnProperty('__value')) {\n    return result.__value;\n  }\n\n  return result;\n}\n\nfunction wrapResults(dependencies, results) {\n  return Array.isArray(dependencies) ? results : // Object.getOwnPropertyNames() has consistent key ordering with ES6\n  Object.getOwnPropertyNames(dependencies).reduce(function (out, key, idx) {\n    return _objectSpread(_objectSpread({}, out), {}, _defineProperty2({}, key, results[idx]));\n  }, {});\n}\n\nfunction wrapLoadables(dependencies, results, exceptions) {\n  var output = exceptions.map(function (exception, idx) {\n    return exception == null ? loadableWithValue$4(results[idx]) : Recoil_isPromise(exception) ? loadableWithPromise$3(exception) : loadableWithError$3(exception);\n  });\n  return wrapResults(dependencies, output);\n}\n\nfunction combineAsyncResultsWithSyncResults(syncResults, asyncResults) {\n  return asyncResults.map(function (result, idx) {\n    return (\n      /**\n       * it's important we use === undefined as opposed to == null, because the\n       * resolved value of the async promise could be `null`, in which case we\n       * don't want to use syncResults[idx], which would be undefined. If async\n       * promise resolves to `undefined`, that's ok because `syncResults[idx]`\n       * will also be `undefined`. That's a little hacky, but it works.\n       */\n      result === undefined ? syncResults[idx] : result\n    );\n  });\n} // Selector that requests all dependencies in parallel and immediately returns\n// current results without waiting.\n\n\nvar waitForNone = Recoil_selectorFamily({\n  key: '__waitForNone',\n  get: function get(dependencies) {\n    return function (_ref37) {\n      var get = _ref37.get;\n      // Issue requests for all dependencies in parallel.\n      var deps = unwrapDependencies(dependencies);\n\n      var _concurrentRequests = concurrentRequests(get, deps),\n          _concurrentRequests2 = _slicedToArray(_concurrentRequests, 2),\n          results = _concurrentRequests2[0],\n          exceptions = _concurrentRequests2[1]; // Always return the current status of the results; never block.\n\n\n      return wrapLoadables(dependencies, results, exceptions);\n    };\n  },\n  dangerouslyAllowMutability: true\n}); // Selector that requests all dependencies in parallel and waits for at least\n// one to be available before returning results.  It will only error if all\n// dependencies have errors.\n\nvar waitForAny = Recoil_selectorFamily({\n  key: '__waitForAny',\n  get: function get(dependencies) {\n    return function (_ref38) {\n      var get = _ref38.get;\n      // Issue requests for all dependencies in parallel.\n      // Exceptions can either be Promises of pending results or real errors\n      var deps = unwrapDependencies(dependencies);\n\n      var _concurrentRequests3 = concurrentRequests(get, deps),\n          _concurrentRequests4 = _slicedToArray(_concurrentRequests3, 2),\n          results = _concurrentRequests4[0],\n          exceptions = _concurrentRequests4[1]; // If any results are available, value or error, return the current status\n\n\n      if (exceptions.some(function (exp) {\n        return !Recoil_isPromise(exp);\n      })) {\n        return wrapLoadables(dependencies, results, exceptions);\n      } // Otherwise, return a promise that will resolve when the next result is\n      // available, whichever one happens to be next.  But, if all pending\n      // dependencies end up with errors, then reject the promise.\n\n\n      return new Promise(function (resolve) {\n        var _iterator48 = _createForOfIteratorHelper(exceptions.entries()),\n            _step48;\n\n        try {\n          var _loop = function _loop() {\n            var _step48$value = _slicedToArray(_step48.value, 2),\n                i = _step48$value[0],\n                exp = _step48$value[1];\n\n            if (Recoil_isPromise(exp)) {\n              exp.then(function (result) {\n                results[i] = getValueFromLoadablePromiseResult(result);\n                exceptions[i] = undefined;\n                resolve(wrapLoadables(dependencies, results, exceptions));\n              }).catch(function (error) {\n                exceptions[i] = error;\n                resolve(wrapLoadables(dependencies, results, exceptions));\n              });\n            }\n          };\n\n          for (_iterator48.s(); !(_step48 = _iterator48.n()).done;) {\n            _loop();\n          }\n        } catch (err) {\n          _iterator48.e(err);\n        } finally {\n          _iterator48.f();\n        }\n      });\n    };\n  },\n  dangerouslyAllowMutability: true\n}); // Selector that requests all dependencies in parallel and waits for all to be\n// available before returning a value.  It will error if any dependencies error.\n\nvar waitForAll = Recoil_selectorFamily({\n  key: '__waitForAll',\n  get: function get(dependencies) {\n    return function (_ref39) {\n      var get = _ref39.get;\n      // Issue requests for all dependencies in parallel.\n      // Exceptions can either be Promises of pending results or real errors\n      var deps = unwrapDependencies(dependencies);\n\n      var _concurrentRequests5 = concurrentRequests(get, deps),\n          _concurrentRequests6 = _slicedToArray(_concurrentRequests5, 2),\n          results = _concurrentRequests6[0],\n          exceptions = _concurrentRequests6[1]; // If all results are available, return the results\n\n\n      if (exceptions.every(function (exp) {\n        return exp == null;\n      })) {\n        return wrapResults(dependencies, results);\n      } // If we have any errors, throw the first error\n\n\n      var error = exceptions.find(isError);\n\n      if (error != null) {\n        throw error;\n      } // Otherwise, return a promise that will resolve when all results are available\n\n\n      return Promise.all(exceptions).then(function (exceptionResults) {\n        return wrapResults(dependencies, combineAsyncResultsWithSyncResults(results, exceptionResults).map(getValueFromLoadablePromiseResult));\n      });\n    };\n  },\n  dangerouslyAllowMutability: true\n});\nvar waitForAllSettled = Recoil_selectorFamily({\n  key: '__waitForAllSettled',\n  get: function get(dependencies) {\n    return function (_ref40) {\n      var get = _ref40.get;\n      // Issue requests for all dependencies in parallel.\n      // Exceptions can either be Promises of pending results or real errors\n      var deps = unwrapDependencies(dependencies);\n\n      var _concurrentRequests7 = concurrentRequests(get, deps),\n          _concurrentRequests8 = _slicedToArray(_concurrentRequests7, 2),\n          results = _concurrentRequests8[0],\n          exceptions = _concurrentRequests8[1]; // If all results are available, return the results\n\n\n      if (exceptions.every(function (exp) {\n        return !Recoil_isPromise(exp);\n      })) {\n        return wrapLoadables(dependencies, results, exceptions);\n      } // Wait for all results to settle\n\n\n      return Promise.all(exceptions.map(function (exp, i) {\n        return Recoil_isPromise(exp) ? exp.then(function (result) {\n          results[i] = getValueFromLoadablePromiseResult(result);\n          exceptions[i] = undefined;\n        }).catch(function (error) {\n          results[i] = undefined;\n          exceptions[i] = error;\n        }) : null;\n      })) // Then wrap them as loadables\n      .then(function () {\n        return wrapLoadables(dependencies, results, exceptions);\n      });\n    };\n  },\n  dangerouslyAllowMutability: true\n});\nvar noWait = Recoil_selectorFamily({\n  key: '__noWait',\n  get: function get(dependency) {\n    return function (_ref41) {\n      var get = _ref41.get;\n\n      try {\n        return loadableWithValue$4(get(dependency));\n      } catch (exception) {\n        return Recoil_isPromise(exception) ? loadableWithPromise$3(exception) : loadableWithError$3(exception);\n      }\n    };\n  },\n  dangerouslyAllowMutability: true\n});\nvar Recoil_WaitFor = {\n  waitForNone: waitForNone,\n  waitForAny: waitForAny,\n  waitForAll: waitForAll,\n  waitForAllSettled: waitForAllSettled,\n  noWait: noWait\n};\nvar batchUpdates$3 = Recoil_Batching.batchUpdates,\n    setBatcher$1 = Recoil_Batching.setBatcher;\nvar DefaultValue$3 = Recoil_Node.DefaultValue;\nvar RecoilRoot$2 = Recoil_RecoilRoot_react.RecoilRoot;\nvar isRecoilValue$5 = Recoil_RecoilValue$1.isRecoilValue;\nvar retentionZone$1 = Recoil_RetentionZone.retentionZone;\nvar freshSnapshot$2 = Recoil_Snapshot$1.freshSnapshot;\nvar useGotoRecoilSnapshot$1 = Recoil_Hooks.useGotoRecoilSnapshot,\n    useRecoilCallback$1 = Recoil_Hooks.useRecoilCallback,\n    useRecoilSnapshot$1 = Recoil_Hooks.useRecoilSnapshot,\n    useRecoilState$1 = Recoil_Hooks.useRecoilState,\n    useRecoilStateLoadable$1 = Recoil_Hooks.useRecoilStateLoadable,\n    useRecoilTransaction$1 = Recoil_Hooks.useRecoilTransaction,\n    useRecoilTransactionObserver$1 = Recoil_Hooks.useRecoilTransactionObserver,\n    useRecoilValue$1 = Recoil_Hooks.useRecoilValue,\n    useRecoilValueLoadable$1 = Recoil_Hooks.useRecoilValueLoadable,\n    useResetRecoilState$1 = Recoil_Hooks.useResetRecoilState,\n    useRetain$1 = Recoil_Hooks.useRetain,\n    useSetRecoilState$1 = Recoil_Hooks.useSetRecoilState,\n    useSetUnvalidatedAtomValues$1 = Recoil_Hooks.useSetUnvalidatedAtomValues,\n    useTransactionObservation_DEPRECATED$1 = Recoil_Hooks.useTransactionObservation_DEPRECATED;\nvar noWait$1 = Recoil_WaitFor.noWait,\n    waitForAll$1 = Recoil_WaitFor.waitForAll,\n    waitForAllSettled$1 = Recoil_WaitFor.waitForAllSettled,\n    waitForAny$1 = Recoil_WaitFor.waitForAny,\n    waitForNone$1 = Recoil_WaitFor.waitForNone;\nvar Recoil_index = {\n  // Types\n  DefaultValue: DefaultValue$3,\n  // Components\n  RecoilRoot: RecoilRoot$2,\n  useRecoilBridgeAcrossReactRoots_UNSTABLE: Recoil_useRecoilBridgeAcrossReactRoots,\n  // RecoilValues\n  atom: Recoil_atom,\n  selector: Recoil_selector,\n  // Other factories\n  retentionZone: retentionZone$1,\n  // Convenience RecoilValues\n  atomFamily: Recoil_atomFamily,\n  selectorFamily: Recoil_selectorFamily,\n  constSelector: Recoil_constSelector,\n  errorSelector: Recoil_errorSelector,\n  readOnlySelector: Recoil_readOnlySelector,\n  // Hooks that accept RecoilValues\n  useRecoilValue: useRecoilValue$1,\n  useRecoilValueLoadable: useRecoilValueLoadable$1,\n  useRecoilState: useRecoilState$1,\n  useRecoilStateLoadable: useRecoilStateLoadable$1,\n  useSetRecoilState: useSetRecoilState$1,\n  useResetRecoilState: useResetRecoilState$1,\n  useGetRecoilValueInfo_UNSTABLE: Recoil_useGetRecoilValueInfo,\n  useRetain: useRetain$1,\n  // Hooks for complex operations with RecoilValues\n  useRecoilCallback: useRecoilCallback$1,\n  useRecoilTransaction_UNSTABLE: useRecoilTransaction$1,\n  // Hooks for Snapshots\n  useGotoRecoilSnapshot: useGotoRecoilSnapshot$1,\n  useRecoilSnapshot: useRecoilSnapshot$1,\n  useRecoilTransactionObserver_UNSTABLE: useRecoilTransactionObserver$1,\n  useTransactionObservation_UNSTABLE: useTransactionObservation_DEPRECATED$1,\n  useSetUnvalidatedAtomValues_UNSTABLE: useSetUnvalidatedAtomValues$1,\n  // Concurrency Helpers\n  noWait: noWait$1,\n  waitForNone: waitForNone$1,\n  waitForAny: waitForAny$1,\n  waitForAll: waitForAll$1,\n  waitForAllSettled: waitForAllSettled$1,\n  // Other functions\n  isRecoilValue: isRecoilValue$5,\n  // Batching\n  batchUpdates: batchUpdates$3,\n  setBatcher: setBatcher$1,\n  // Snapshot Utils\n  snapshot_UNSTABLE: freshSnapshot$2\n};\nvar Recoil_index_1 = Recoil_index.DefaultValue;\nvar Recoil_index_2 = Recoil_index.RecoilRoot;\nvar Recoil_index_3 = Recoil_index.useRecoilBridgeAcrossReactRoots_UNSTABLE;\nvar Recoil_index_4 = Recoil_index.atom;\nvar Recoil_index_5 = Recoil_index.selector;\nvar Recoil_index_6 = Recoil_index.retentionZone;\nvar Recoil_index_7 = Recoil_index.atomFamily;\nvar Recoil_index_8 = Recoil_index.selectorFamily;\nvar Recoil_index_9 = Recoil_index.constSelector;\nvar Recoil_index_10 = Recoil_index.errorSelector;\nvar Recoil_index_11 = Recoil_index.readOnlySelector;\nvar Recoil_index_12 = Recoil_index.useRecoilValue;\nvar Recoil_index_13 = Recoil_index.useRecoilValueLoadable;\nvar Recoil_index_14 = Recoil_index.useRecoilState;\nvar Recoil_index_15 = Recoil_index.useRecoilStateLoadable;\nvar Recoil_index_16 = Recoil_index.useSetRecoilState;\nvar Recoil_index_17 = Recoil_index.useResetRecoilState;\nvar Recoil_index_18 = Recoil_index.useGetRecoilValueInfo_UNSTABLE;\nvar Recoil_index_19 = Recoil_index.useRetain;\nvar Recoil_index_20 = Recoil_index.useRecoilCallback;\nvar Recoil_index_21 = Recoil_index.useRecoilTransaction_UNSTABLE;\nvar Recoil_index_22 = Recoil_index.useGotoRecoilSnapshot;\nvar Recoil_index_23 = Recoil_index.useRecoilSnapshot;\nvar Recoil_index_24 = Recoil_index.useRecoilTransactionObserver_UNSTABLE;\nvar Recoil_index_25 = Recoil_index.useTransactionObservation_UNSTABLE;\nvar Recoil_index_26 = Recoil_index.useSetUnvalidatedAtomValues_UNSTABLE;\nvar Recoil_index_27 = Recoil_index.noWait;\nvar Recoil_index_28 = Recoil_index.waitForNone;\nvar Recoil_index_29 = Recoil_index.waitForAny;\nvar Recoil_index_30 = Recoil_index.waitForAll;\nvar Recoil_index_31 = Recoil_index.waitForAllSettled;\nvar Recoil_index_32 = Recoil_index.isRecoilValue;\nvar Recoil_index_33 = Recoil_index.batchUpdates;\nvar Recoil_index_34 = Recoil_index.setBatcher;\nvar Recoil_index_35 = Recoil_index.snapshot_UNSTABLE;\nexport default Recoil_index;\nexport { Recoil_index_1 as DefaultValue, Recoil_index_2 as RecoilRoot, Recoil_index_4 as atom, Recoil_index_7 as atomFamily, Recoil_index_33 as batchUpdates, Recoil_index_9 as constSelector, Recoil_index_10 as errorSelector, Recoil_index_32 as isRecoilValue, Recoil_index_27 as noWait, Recoil_index_11 as readOnlySelector, Recoil_index_6 as retentionZone, Recoil_index_5 as selector, Recoil_index_8 as selectorFamily, Recoil_index_34 as setBatcher, Recoil_index_35 as snapshot_UNSTABLE, Recoil_index_18 as useGetRecoilValueInfo_UNSTABLE, Recoil_index_22 as useGotoRecoilSnapshot, Recoil_index_3 as useRecoilBridgeAcrossReactRoots_UNSTABLE, Recoil_index_20 as useRecoilCallback, Recoil_index_23 as useRecoilSnapshot, Recoil_index_14 as useRecoilState, Recoil_index_15 as useRecoilStateLoadable, Recoil_index_24 as useRecoilTransactionObserver_UNSTABLE, Recoil_index_21 as useRecoilTransaction_UNSTABLE, Recoil_index_12 as useRecoilValue, Recoil_index_13 as useRecoilValueLoadable, Recoil_index_17 as useResetRecoilState, Recoil_index_19 as useRetain, Recoil_index_16 as useSetRecoilState, Recoil_index_26 as useSetUnvalidatedAtomValues_UNSTABLE, Recoil_index_25 as useTransactionObservation_UNSTABLE, Recoil_index_30 as waitForAll, Recoil_index_31 as waitForAllSettled, Recoil_index_29 as waitForAny, Recoil_index_28 as waitForNone };"],"names":["_excluded","_excluded2","_excluded3","_createSuper","Derived","hasNativeReflectConstruct","Reflect","construct","sham","Proxy","Boolean","prototype","valueOf","call","e","_isNativeReflectConstruct","result","Super","NewTarget","this","constructor","arguments","apply","_marked","filterIterable","_marked2","concatIterables","_createForOfIteratorHelper","o","allowArrayLike","it","Symbol","iterator","Array","isArray","minLen","_arrayLikeToArray","n","Object","toString","slice","name","from","test","_unsupportedIterableToArray","length","i","F","s","done","value","_e","f","TypeError","err","normalCompletion","didErr","step","next","_e2","return","arr","len","arr2","ownKeys","object","enumerableOnly","keys","getOwnPropertySymbols","symbols","filter","sym","getOwnPropertyDescriptor","enumerable","push","_objectSpread","target","source","forEach","key","getOwnPropertyDescriptors","defineProperties","defineProperty","Recoil_isPromise","p","then","Recoil_nullthrows","x","message","Error","Canceled","CANCELED","loadableAccessors","valueMaybe","valueOrThrow","concat","state","errorMaybe","errorOrThrow","promiseMaybe","promiseOrThrow","is","other","contents","map","_map","_this","loadableWithPromise","__value","loadableWithValue","loadableWithError","catch","freeze","getValue","toPromise","Promise","resolve","error","reject","promise","_ref2","_ref3","_ref4","_ref5","_useMutableSource","Recoil_Loadable","loadableLoading","loadableAll","inputs","every","some","find","all","useMutableSource","Recoil_mutableSource","mutableSourceExists","window","$disableRecoilValueMutableSource_TEMP_HACK_DO_NOT_USE","mutableSourceExists$1","gks","Map","set","Recoil_gkx","gk","_gks$get","get","setPass","setFail","Recoil_gkx_1","Recoil_recoverableViolation","projectName","_ref6","undefined","Recoil_CopyOnWrite","v","Set","add","iterable","predicate","index","_iterator","_step","_context","prev","t0","finish","stop","Recoil_filterIterable","Recoil_mapIterable","callback","_callee","_iterator2","_step2","_context2","Recoil_expectationViolation","format","_defineProperty","obj","configurable","writable","AbstractRecoilValue","newKey","RecoilState","_AbstractRecoilValue","_super","RecoilValueReadOnly","_AbstractRecoilValue2","_super2","Recoil_RecoilValue","isRecoilValue","Recoil_RecoilValue_1","Recoil_RecoilValue_2","Recoil_RecoilValue_3","Recoil_RecoilValue_4","Recoil_RecoilValue$1","__proto__","DefaultValue","DEFAULT_VALUE","RecoilValueNotReady","_Error","_super3","nodes","recoilValues","NodeMissingError","_Error2","_super4","configDeletionHandlers","getConfigDeletionHandler","Recoil_Node","registerNode","node","has","console","warn","recoilValue","getNode","getNodeMaybe","deleteNodeConfigIfPossible","_node$shouldDeleteCon","_getConfigDeletionHan","shouldDeleteConfigOnRelease","delete","setConfigDeletionHandler","fn","recoilValuesForKeys","RetentionZone","Recoil_RetentionZone","setByAddingToSet$1","getNode$1","getNodeMaybe$1","recoilValuesForKeys$1","RetentionZone$1","emptySet","ReadOnlyRecoilValueError","_Error3","_super5","initializeNodeIfNewToStore","store","treeState","trigger","storeState","getState","nodeCleanupFunctions","config","retentionCleanup","nodeKey","retainedBy","nodesRetainedByZone","retention","addToZone","zone","_step3","_iterator3","deleteFromZone","_step4","_iterator4","size","initializeRetentionForNode","nodeCleanup","init","peekNodeLoadable","peek","getDownstreamNodes","visitedNodes","visitingNodes","graph","getGraph","version","pop","_graph$nodeToNodeSubs","_step5","_iterator5","nodeToNodeSubscriptions","downstreamNode","Recoil_FunctionalCore","newValue","_state$nodeCleanupFun","_node$invalidate","invalidate","atomValues","clone","nonvalidatedAtoms","dirtyAtoms","_graph$nodeDeps$get","_storeState$nodeToCom","_storeState$nodeToCom2","type","knownAtoms","knownSelectors","downstreamNodes","loadable","isActive","isSet","isModified","deps","nodeDeps","subscribers","components","nodeToComponentSubscriptions","values","_ref7","CANCELED$1","getDownstreamNodes$1","getNodeLoadable$1","setNodeValue$1","getNodeMaybe$2","DefaultValue$1","RecoilValueNotReady$1","AbstractRecoilValue$1","RecoilState$1","RecoilValueReadOnly$1","isRecoilValue$1","applyAction","action","_step6","_ref10","valueOrUpdater","current","valueFromValueOrUpdater","_iterator6","entries","_step6$value","writeLoadableToTreeState","_key4","_key5","unvalidatedValue","applyActionsToStore","actions","replaceState","_step7","newState","copyTreeState","_iterator7","invalidateDownstreams","queueOrPerformStateUpdate","batchStack","actionsByStore","_step9","_iterator9","_getNodeMaybe","_getNodeMaybe$invalid","setRecoilValue","subscriptionID","Recoil_RecoilValueInterface","getRecoilValueAsLoadable","_ref9","_storeState$nextTree","_storeState$previousT","currentTree","nextTree","previousTree","setRecoilValueLoadable","markRecoilValueModified","setUnvalidatedRecoilValue","subscribeToRecoilValue","_ref11","componentDebugName","subID","release","subs","applyAtomValueWrites","writes","k","batchStart","_step8","_iterator8","_step8$value","invalidateDownstreams_FOR_TESTING","unstable_batchedUpdates","batchStart$1","batcher","Recoil_Batching","newBatcher","batchEnd","Recoil_Queue","enqueueExecution","Recoil_differenceSets","ret","_len3","setsWithValuesToRemove","_key6","_step10","_iterator10","FIRST","_step11","_iterator11","otherSet","Recoil_mapMap","mergeDependencyMapIntoGraph","olderGraph","upstreams","downstream","existingUpstreams","upstream","existing","Recoil_Graph","dependencyMap","_storeState$previousT2","_storeState$previousT3","_storeState$nextTree2","nextVersion","module","hamt_1","_typeof","hamt","BUCKET_SIZE","Math","pow","MASK","MAX_INDEX_NODE","MIN_ARRAY_NODE","nothing","constant","hash","str","charCodeAt","hashFragment","shift","h","toBitmap","fromBitmap","bitmap","bit","arrayUpdate","mutate","at","out","arraySpliceOut","newLen","g","empty","__hamt_isEmpty","isEmptyNode","Leaf","edit","_modify","Leaf__modify","Collision","children","Collision__modify","IndexedNode","mask","IndexedNode__modify","ArrayNode","ArrayNode__modify","mergeLeaves","h1","n1","h2","n2","subH1","subH2","canEditNode","keyEq","_v","list","child","_newValue","updateCollisionList","frag","indx","exists","canEdit","newChildren","subNodes","count","expand","_i","arraySpliceIn","newChild","removed","elements","elem","pack","editable","root","_editable","_edit","_config","_root","_size","setTree","newRoot","newSize","tryGetHash","alt","tryGet","getHash","hasHash","defKeyCompare","y","make","isEmpty","modifyHash","NaN","modify","setHash","del","removeHash","deleteHash","remove","beginMutation","endMutation","transient","appk","lazyVisitChildren","lazyVisit","rest","DONE","MapIterator","v0","visit","buildPairs","buildKeys","buildValues","fold","z","m","toVisit","_","exports","BuiltInMap","persistentMap","HashArrayMappedTrieMap","_hamt","_step12","_iterator12","_step12$value","Recoil_PersistentMap_1","graph$1","persistentMap$1","nextTreeStateVersion","getNextTreeStateVersion","makeEmptyTreeState","stateID","transactionMetadata","Recoil_State","commitDepth","transactionSubscriptions","nodeTransactionSubscriptions","queuedComponentCallbacks_DEPRECATED","suspendedComponentResolvers","graphsByVersion","versionsUsedByComponent","referenceCounts","retainablesToCheckForRelease","Recoil_unionSets","_len4","sets","_key7","_i2","_sets","_step13","_iterator13","Recoil_someSet","context","entry","cleanUpNode$1","deleteNodeConfigIfPossible$1","getNode$2","RetentionZone$2","emptySet$1","releaseRetainablesNowOnCurrentTree","retainables","_step14","_iterator14","r","_step16","_iterator16","_step15","releasableNodes","searchFromNodes","nonReleasableNodes","findReleasableNodesInner","_step17","releasableNodesFoundThisIteration","downstreams","doNotDescendInto1","doNotDescendInto2","answer","visited","_step20","_iterator20","getDownstreamNodesInTopologicalOrder","_iterator17","_storeState$retention","zonesThatCouldRetainNode","nodeChildren","_step18","parents","_iterator18","_step19","_node","_iterator19","parent","findReleasableNodes","_iterator15","releaseNode","_step21","_iterator21","_storeState$retention2","_step22","_iterator22","dep","_storeState$retention3","updateRetainCountToZero","retainable","scheduleOrPerformPossibleReleaseOfRetainable","Recoil_Retention","delta","_map$get","newCount","clear","iters","_iterator23","_step23","iter","_iterator24","_step24","val","_context3","t1","Recoil_concatIterables","Recoil_Environment","isSSR","isReactNative","navigator","product","isSSR$1","batchUpdates$1","initializeNodeIfNewToStore$1","peekNodeInfo$1","graph$2","DEFAULT_VALUE$1","recoilValues$1","recoilValuesForKeys$2","AbstractRecoilValue$2","getRecoilValueAsLoadable$1","setRecoilValue$1","setUnvalidatedRecoilValue$1","updateRetainCount$1","getNextTreeStateVersion$1","makeEmptyStoreState$1","Snapshot","_this2","checkRefCount_INTERNAL","_store","getLoadable","opt","isInitialized","_ref12","_ref13","mapper","mutableSnapshot","MutableSnapshot","cloneSnapshot","getStore_INTERNAL","_ref14","_callee2","_context4","abrupt","_x","replacer","graphs","newGraph","subscribeToTransactions","addTransactionMetadata","_step25","_iterator25","retain","autorelease_INTERNAL","_this3","_refCount","released","release_INTERNAL","_this4","setTimeout","getID_INTERNAL","cloneStoreState","bumpVersion","_Snapshot","_super6","snapshot","batch","_this5","recoilState","newValueOrUpdater","_batch","_step26","_iterator26","_step26$value","Recoil_Snapshot","freshSnapshot","initializeState","Recoil_Snapshot_1","Recoil_Snapshot_2","Recoil_Snapshot_3","Recoil_Snapshot_4","Recoil_Snapshot$1","getNextTreeStateVersion$2","makeEmptyStoreState$2","cleanUpNode$2","getDownstreamNodes$2","setNodeValue$2","setUnvalidatedAtomValue_DEPRECATED$1","graph$3","cloneGraph$1","applyAtomValueWrites$1","releaseScheduledRetainablesNow$1","freshSnapshot$1","useCallback","useContext","useEffect","useMemo","useRef","useState","notInAContext","defaultStore","stateReplacerIsBeingExecuted","startNextTreeIfNeeded","AppContext","useStoreRef","MutableSourceContext","notifyComponents","_step27","_iterator27","comps","_step28","_iterator28","_step28$value","_step28$value$","sendEndOfBatchNotifications","_step29","_iterator29","_step29$value","subscriptions","_step31","_iterator31","_step31$value","subscription","_step30","_iterator30","_step30$value","_subscription","cb","splice","Batcher","_ref15","setNotifyBatcherOfChange","storeRef","_useState","_useState2","setState","endBatch","nextID","RecoilRoot_INTERNAL","_ref16","_createMutableSource","initializeState_DEPRECATED","storeProp","store_INTERNAL","notifyBatcherOfChange","createMutableSource","replaced","id","_id2","metadata","_i3","_Object$keys","initial","atom","_step32","writtenNodes","_iterator32","setUnvalidatedAtomValues","initialStoreState_DEPRECATED","initialStoreState","mutableSource","_step33","_iterator33","atomKey","Provider","Recoil_RecoilRoot_react","props","override","propsExceptOverride","ancestorStoreRef","loadableWithValue$1","DEFAULT_VALUE$2","getNode$3","copyTreeState$1","getRecoilValueAsLoadable$2","invalidateDownstreams$1","writeLoadableToTreeState$1","isAtom","nodeType","TransactionInterfaceImpl","_this6","_changes","_treeState","_step34","_iterator34","_step34$value","Recoil_AtomicUpdates_1","changeset","newTreeState_INTERNAL","Recoil_AtomicUpdates$1","atomicUpdater","Recoil_filterMap","_step35","_iterator35","_step35$value","Recoil_filterSet","_step36","_iterator36","Recoil_invariant","condition","Recoil_mergeMaps","_len5","maps","_key8","nextKey","Recoil_shallowArrayEqual","a","b","l","useRef$1","Recoil_useComponentName","atomicUpdater$1","batchUpdates$2","DEFAULT_VALUE$3","getNode$4","nodes$1","useRecoilMutableSource$1","useStoreRef$1","AbstractRecoilValue$3","getRecoilValueAsLoadable$3","setRecoilValue$2","setRecoilValueLoadable$1","setUnvalidatedRecoilValue$2","subscribeToRecoilValue$1","updateRetainCount$2","RetentionZone$3","cloneSnapshot$1","isSSR$2","mutableSourceExists$2","useMutableSource$1","useCallback$1","useEffect$1","useMemo$1","useRef$2","useState$1","SUSPENSE_TIMEOUT_MS","handleLoadable","useRecoilValueLoadable","useRetain","getLoadableWithTesting","componentName","subscribe","_storeState","newLoadable","prevLoadableRef","useRecoilValueLoadable_MUTABLESOURCE","_useState$3","_useState$4","forceUpdate","_state","_prevLoadableRef$curr","_prevLoadableRef$curr2","useRecoilValueLoadable_LEGACY","useRecoilValue","useSetRecoilState","useTransactionSubscription","externallyVisibleAtomValuesInState","toMap","persistedAtomContentsValues","persistence","persistence_UNSTABLE","usePrevious","ref","useGotoRecoilSnapshot","_storeState$nextTree3","keysToUpdate","_i4","_arr","_step38","_iterator38","_prev$atomValues$get","_next$atomValues$get","shouldRestoreFromSnapshots","Sentinel","SENTINEL","toRetain","timeoutID","clearTimeout","_step39","_iterator39","_step40","_iterator40","_r","previousRetainables","_step41","_iterator41","_r3","_step42","_iterator42","_step43","_iterator43","_r2","useRetain_ACTUAL","Recoil_Hooks","gotoSnapshot","_len6","args","_key9","reset","atomicUpdate","errMsg","transact_UNSTABLE","_useState$5","_useState$6","setSnapshot","previousSnapshot","_len7","_key10","transactionInterface","previousAtomValues","atomInfo","_node$persistence_UNS","_node$persistence_UNS2","_node$persistence_UNS3","_node$persistence_UNS4","backButton","modifiedAtoms","peekNodeInfo$2","useStoreRef$2","Recoil_useGetRecoilValueInfo","_ref17","RecoilRoot$1","useStoreRef$3","useMemo$2","Recoil_useRecoilBridgeAcrossReactRoots","_ref18","stringify","includes","String","JSON","allowFunctions","_JSON$stringify","toJSON","_step44","_iterator44","_step44$value","sort","localeCompare","join","Recoil_stableStringify","TreeCache","options","_options$onHit","_options$onSet","_options$mapNodeValue","_numLeafs","_onHit","onHit","_onSet","onSet","_mapNodeValue","mapNodeValue","getNodeValue","handlers","_this$getLeafNode","getLeafNode","_this7","findLeaf","onNodeVisit","route","leafNode","_this8","addLeaf","_ref19","_ref20","nodeValue","pruneNodeFromTree","branches","countDownstreamLeaves","_handlers$onNodeVisit","branchKey","_handlers$onNodeVisit2","_route","path","_path","_route2","_path2","_rest","_path3","_nodeKey","_nodeValue","pruneUpstreamBranches","branchNode","reduce","sum","currNode","Recoil_TreeCache_1","Recoil_TreeCache$1","Recoil_LRUCache_1","LRUCache","_options$mapKey","_maxSize","maxSize","_head","_tail","_keyMapper","mapKey","mappedKey","head","right","left","_maybeDeleteLRU","deleteLru","tail","Recoil_LRUCache$1","LRUCache$1","TreeCache$1","Recoil_treeCacheLRU","lruCache","cache","lruNode","TreeCache$2","defaultPolicy","equality","eviction","Infinity","getValueMapper","getTreeCache","Recoil_treeCacheFromPolicy","_ref21","_ref21$equality","_ref21$eviction","_ref21$maxSize","valueMapper","treeCache","executionId","Recoil_PerformanceTimings","_id","CANCELED$2","Canceled$1","loadableWithError$1","loadableWithPromise$1","loadableWithValue$2","getNodeLoadable$2","peekNodeLoadable$1","setNodeValue$3","saveDependencyMapToStore$1","DEFAULT_VALUE$4","RecoilValueNotReady$2","getConfigDeletionHandler$1","registerNode$1","isRecoilValue$3","AbstractRecoilValue$4","setRecoilValueLoadable$2","retainedByOptionWithDefault$1","cloneSnapshot$2","startPerfBlock$1","dependencyStack","waitingStores","getNewExecutionId","Recoil_selector","cachePolicy","cachePolicy_UNSTABLE","retainedBy_UNSTABLE","executionInfoMap","liveStoresCount","selectorIsLive","getExecutionInfo","depValuesDiscoveredSoFarDuringAsyncWork","latestLoadable","latestExecutionId","stateVersion","selectorInit","selectorShouldDeleteConfigOnRelease","notifyStoreWhenAsyncSettles","stores","getCachedNodeLoadable","isKeyPointingToSelector","wrapPendingPromise","depValues","clearExecutionInfo","maybeFreezeValue","setCache","depValuesToDepRoute","setDepsInStore","setLoadableInStoreToNotifyDeps","__key","errorOrPromise","isLatestExecution","updateExecutionInfoDepValues","wrapPendingDependencyPromise","existingDeps","resolvedDep","_ref22","resolvedDepKey","depValue","bypassSelectorDepCacheOnReevaluation","cachedLoadable","getValFromCacheAndUpdatedDownstreamDeps","setExecutionInfo","_executionInfo$latest","executionInfo","getExecutionInfoOfInProgressExecution","_evaluateSelectorGett","evaluateSelectorGetter","_evaluateSelectorGett2","maybeFreezeLoadableContents","_step45","_iterator45","notifyStoresOfSettledAsync","_store$getState","_store$getState$curre","_store$getState2","_store$getState2$next","_store$getState$nextT","_store$getState3","_store$getState3$next","setNewDepInStore","newDepKey","bypassSelectorDepCache","endPerfBlock","resultIsError","getRecoilValue","depKey","depLoadable","gateCallback","getCallback","finally","errorOrDepPromise","depsAfterCacheDone","cachedVal","_ref23","_ref24","getValFromRunningNewExecutionAndUpdatedDeps","newExecutionId","_evaluateSelectorGett3","_evaluateSelectorGett4","newDepValues","depRoute","maybeSetCacheWithLoadable","_Array$from$find","_ref25","_ref27","_ref28","_executionInfo$depVal","_mapOfCheckedVersions","oldDepValues","cachedDepValuesCheckedForThisVersion","mapOfCheckedVersions","isCachedVersionSame","_ref29","_ref30","nodeVal","_ref31","_ref32","oldVal","haveAsyncDepsChanged","cacheRoute","selectorPeek","selectorGet","indexOf","detectCircularDependencies","inProgressExecutionInfo","getSelectorValAndUpdatedDeps","invalidateSelector","syncSelectorSetFinished","_ref33","setRecoilState","dangerouslyAllowMutability","loadableWithError$2","loadableWithPromise$2","loadableWithValue$3","DEFAULT_VALUE$5","DefaultValue$2","getConfigDeletionHandler$2","registerNode$2","setConfigDeletionHandler$1","isRecoilValue$4","markRecoilValueModified$1","setRecoilValue$3","setRecoilValueLoadable$3","retainedByOptionWithDefault$2","baseAtom","defaultLoadable","default","cachedAnswerForUnvalidatedValue","cleanupEffectsByStore","_ref","_state$atomValues$get3","_cachedAnswerForUnval","nonvalidatedValue","validatorResult","validator","validatedValueLoadable","initState","alreadyKnown","notifyDefaultSubscribers","_store$getState$nextT3","initValue","pendingSetSelf","effects_UNSTABLE","_step46","duringInit","setSelf","effect","currentValue","resetSelf","handler","currentStore","_currentTree$atomValu","_currentStore$getStat","_previousTree$atomVal","_pendingSetSelf","_pendingSetSelf2","_pendingSetSelf3","oldLoadable","oldValue","_iterator46","_options$effects_UNST","_cleanupEffectsByStor","cleanup","_store$getState$nextT4","initLoadable","wrappedPromise","_state$atomValues$get","_store$getState$nextT2","_state$atomValues$get2","_cleanupEffectsByStor2","optionsDefault","restOptions","base","storedValue","sel","_ref34","baseValue","_get","_ref35","_set","atomWithFallback","Recoil_atom","Recoil_MapCache_1","MapCache","Recoil_MapCache$1","LRUCache$2","MapCache$1","defaultPolicy$1","getValueMapper$1","getCache","Recoil_cacheFromPolicy","_ref36","_ref36$equality","_ref36$eviction","_ref36$maxSize","setConfigDeletionHandler$2","Recoil_atomFamily","_options$cachePolicyF","_options$cachePolicyF2","atomCache","cachePolicyForParams_UNSTABLE","params","_stableStringify","cachedAtom","atomOptions","newAtom","setConfigDeletionHandler$3","nextIndex","Recoil_selectorFamily","selectorCache","cachedSelector","newSelector","myKey","myGet","callbacks","myCachePolicy","constantSelector","Recoil_constSelector","throwingSelector","Recoil_errorSelector","Recoil_readOnlySelector","loadableWithError$3","loadableWithPromise$3","loadableWithValue$4","concurrentRequests","_step47","results","fill","exceptions","_iterator47","_step47$value","isError","exp","unwrapDependencies","dependencies","getOwnPropertyNames","getValueFromLoadablePromiseResult","hasOwnProperty","wrapResults","idx","wrapLoadables","exception","Recoil_WaitFor","waitForNone","_ref37","_concurrentRequests","_concurrentRequests2","waitForAny","_ref38","_concurrentRequests3","_concurrentRequests4","_step48","_iterator48","_loop","_step48$value","waitForAll","_ref39","_concurrentRequests5","_concurrentRequests6","exceptionResults","syncResults","asyncResults","waitForAllSettled","_ref40","_concurrentRequests7","_concurrentRequests8","noWait","dependency","_ref41","batchUpdates$3","setBatcher$1","DefaultValue$3","RecoilRoot$2","isRecoilValue$5","retentionZone$1","freshSnapshot$2","Recoil_index","RecoilRoot","useRecoilBridgeAcrossReactRoots_UNSTABLE","selector","retentionZone","atomFamily","selectorFamily","constSelector","errorSelector","readOnlySelector","useRecoilState","useRecoilStateLoadable","useResetRecoilState","useGetRecoilValueInfo_UNSTABLE","useRecoilCallback","useRecoilTransaction_UNSTABLE","useRecoilSnapshot","useRecoilTransactionObserver_UNSTABLE","useTransactionObservation_UNSTABLE","useSetUnvalidatedAtomValues_UNSTABLE","batchUpdates","setBatcher","snapshot_UNSTABLE","Recoil_index_1","Recoil_index_2","Recoil_index_3","Recoil_index_4","Recoil_index_5","Recoil_index_6","Recoil_index_7","Recoil_index_8","Recoil_index_9","Recoil_index_10","Recoil_index_11","Recoil_index_12","Recoil_index_13","Recoil_index_14","Recoil_index_15","Recoil_index_16","Recoil_index_17","Recoil_index_18","Recoil_index_19","Recoil_index_20","Recoil_index_21","Recoil_index_22","Recoil_index_23","Recoil_index_24","Recoil_index_25","Recoil_index_26","Recoil_index_27","Recoil_index_28","Recoil_index_29","Recoil_index_30","Recoil_index_31","Recoil_index_32","Recoil_index_33","Recoil_index_34","Recoil_index_35"],"sourceRoot":""}