{"version":3,"file":"0a301732-2dbdda4cd6e2e2df9484.js","mappings":"iUAYIA,EAAY,CAAC,YACbC,EAAa,CAAC,iCAGdC,EAAuB,SAAyBC,IAChDC,EAAwB,SAAyBC,IAIrD,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,OAAOC,UAAUC,SAASC,KAAKb,GAAGc,MAAM,GAAI,GAAc,WAANL,GAAkBT,EAAEe,cAAaN,EAAIT,EAAEe,YAAYC,MAAM,GAAU,QAANP,GAAqB,QAANA,EAAa,OAAOJ,MAAMY,KAAKjB,GAAI,GAAU,cAANS,GAAqB,2CAA2CS,KAAKT,GAAI,OAAOD,EAAkBR,EAAGO,GAFnOY,CAA4BnB,KAAOC,GAAkBD,GAAyB,iBAAbA,EAAEoB,OAAqB,CAAMlB,IAAIF,EAAIE,GAAI,IAAImB,EAAI,EAAOC,EAAI,aAAiB,MAAO,CAAEC,EAAGD,EAAGb,EAAG,WAAe,OAAIY,GAAKrB,EAAEoB,OAAe,CAAEI,MAAM,GAAe,CAAEA,MAAM,EAAOC,MAAOzB,EAAEqB,OAAWK,EAAG,SAAWC,GAAM,MAAMA,GAAOC,EAAGN,GAAO,MAAM,IAAIO,UAAU,yIAA4I,IAA6CC,EAAzCC,GAAmB,EAAMC,GAAS,EAAY,MAAO,CAAET,EAAG,WAAerB,EAAKA,EAAGW,KAAKb,IAAOS,EAAG,WAAe,IAAIwB,EAAO/B,EAAGgC,OAAsC,OAA9BH,EAAmBE,EAAKT,KAAaS,GAASP,EAAG,SAAWS,GAAOH,GAAS,EAAMF,EAAMK,GAAQP,EAAG,WAAe,IAAWG,GAAiC,MAAb7B,EAAGkC,QAAgBlC,EAAGkC,SAAY,QAAU,GAAIJ,EAAQ,MAAMF,KAIz9B,SAAStB,EAAkB6B,EAAKC,IAAkB,MAAPA,GAAeA,EAAMD,EAAIjB,UAAQkB,EAAMD,EAAIjB,QAAQ,IAAK,IAAIC,EAAI,EAAGkB,EAAO,IAAIlC,MAAMiC,GAAMjB,EAAIiB,EAAKjB,IAAOkB,EAAKlB,GAAKgB,EAAIhB,GAAM,OAAOkB,EAEhL,SAASC,EAAQC,EAAQC,GAAkB,IAAIC,EAAOjC,OAAOiC,KAAKF,GAAS,GAAI/B,OAAOkC,sBAAuB,CAAE,IAAIC,EAAUnC,OAAOkC,sBAAsBH,GAAaC,IAAkBG,EAAUA,EAAQC,QAAO,SAAUC,GAAO,OAAOrC,OAAOsC,yBAAyBP,EAAQM,GAAKE,eAAkBN,EAAKO,KAAKC,MAAMR,EAAME,GAAY,OAAOF,EAElV,SAASS,EAAcC,GAAU,IAAK,IAAIhC,EAAI,EAAGA,EAAIiC,UAAUlC,OAAQC,IAAK,CAAE,IAAIkC,EAAyB,MAAhBD,UAAUjC,GAAaiC,UAAUjC,GAAK,GAAQA,EAAI,EAAKmB,EAAQ9B,OAAO6C,IAAS,GAAMC,SAAQ,SAAUC,IAAO,OAAiBJ,EAAQI,EAAKF,EAAOE,OAAsB/C,OAAOgD,0BAA6BhD,OAAOiD,iBAAiBN,EAAQ3C,OAAOgD,0BAA0BH,IAAmBf,EAAQ9B,OAAO6C,IAASC,SAAQ,SAAUC,GAAO/C,OAAOkD,eAAeP,EAAQI,EAAK/C,OAAOsC,yBAAyBO,EAAQE,OAAe,OAAOJ,EAE9gB,SAASQ,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,QAAQzD,UAAU0D,QAAQxD,KAAKmD,QAAQC,UAAUG,QAAS,IAAI,iBAAyB,EAAQ,MAAO1C,GAAK,OAAO,GAF9P4C,GAA6B,OAAO,WAAkC,IAAsCC,EAAlCC,GAAQ,OAAgBV,GAAkB,GAAIC,EAA2B,CAAE,IAAIU,GAAY,OAAgBC,MAAM3D,YAAawD,EAASP,QAAQC,UAAUO,EAAOlB,UAAWmB,QAAqBF,EAASC,EAAMrB,MAAMuB,KAAMpB,WAAc,OAAO,OAA2BoB,KAAMH,IAgC5Z,IAEII,EAjBJ,SAAaC,GACX,IAAIC,EAAQ,IAAIC,MAAMF,GAGtB,QAAoBG,IAAhBF,EAAMG,MAER,IACE,MAAMH,EACN,MAAOI,IAIX,OAAOJ,GAyBT,IAAIK,EAJJ,SAAmBC,GACjB,QAASA,GAAuB,mBAAXA,EAAEC,MAazB,IAAIC,EARJ,SAAoBC,EAAGV,GACrB,GAAS,MAALU,EACF,OAAOA,EAGT,MAAMX,EAAWC,MAAAA,EAAyCA,EAAU,qCAKtE,SAASW,EAAgBC,EAAK/B,EAAKhC,GAYjC,OAXIgC,KAAO+B,EACT9E,OAAOkD,eAAe4B,EAAK/B,EAAK,CAC9BhC,MAAOA,EACPwB,YAAY,EACZwC,cAAc,EACdC,UAAU,IAGZF,EAAI/B,GAAOhC,EAGN+D,EAGT,IAAIG,EAA4B,WAC9B,SAASA,KACP,OAAgBjB,KAAMiB,GA2DxB,OAxDA,OAAaA,EAAc,CAAC,CAC1BlC,IAAK,WACLhC,MAAO,WACL,MAAMkD,EAAW,kBAElB,CACDlB,IAAK,YACLhC,MAAO,WACL,MAAMkD,EAAW,kBAElB,CACDlB,IAAK,aACLhC,MAAO,WACL,MAAMkD,EAAW,kBAElB,CACDlB,IAAK,eACLhC,MAAO,WAEL,MAAMkD,EAAW,oCAAqCiB,OAAOlB,KAAKmB,MAAO,cAE1E,CACDpC,IAAK,eACLhC,MAAO,WACL,MAAMkD,EAAW,kBAElB,CACDlB,IAAK,iBACLhC,MAAO,WAEL,MAAMkD,EAAW,sCAAuCiB,OAAOlB,KAAKmB,MAAO,cAE5E,CACDpC,IAAK,aACLhC,MAAO,WACL,MAAMkD,EAAW,kBAElB,CACDlB,IAAK,eACLhC,MAAO,WAEL,MAAMkD,EAAW,oCAAqCiB,OAAOlB,KAAKmB,MAAO,cAE1E,CACDpC,IAAK,KACLhC,MAAO,SAAYqE,GAEjB,OAAOA,EAAMD,QAAUnB,KAAKmB,OAASC,EAAMC,WAAarB,KAAKqB,WAE9D,CACDtC,IAAK,MACLhC,MAAO,SAAauE,GAClB,MAAMrB,EAAW,oBAIdgB,EA7DuB,GAgE5BM,EAA6B,SAAUC,IACzC,OAAUD,EAAeC,GAEzB,IAAIC,EAAStC,EAAaoC,GAE1B,SAASA,EAAcxE,GACrB,IAAI2E,EAWJ,OATA,OAAgB1B,KAAMuB,GAEtBG,EAAQD,EAAOtF,KAAK6D,MAEpBa,GAAgB,OAAuBa,GAAQ,QAAS,YAExDb,GAAgB,OAAuBa,GAAQ,gBAAY,GAE3DA,EAAML,SAAWtE,EACV2E,EAoDT,OAjDA,OAAaH,EAAe,CAAC,CAC3BxC,IAAK,WACLhC,MAAO,WACL,OAAOiD,KAAKqB,WAEb,CACDtC,IAAK,YACLhC,MAAO,WACL,OAAO4E,QAAQC,QAAQ5B,KAAKqB,YAE7B,CACDtC,IAAK,aACLhC,MAAO,WACL,OAAOiD,KAAKqB,WAEb,CACDtC,IAAK,eACLhC,MAAO,WACL,OAAOiD,KAAKqB,WAEb,CACDtC,IAAK,eACLhC,MAAO,cAGN,CACDgC,IAAK,aACLhC,MAAO,cAGN,CACDgC,IAAK,MACLhC,MAAO,SAAa8E,GAClB,IAAIC,EAAS9B,KAEb,IACE,IAAIxC,EAAOqE,EAAM7B,KAAKqB,UAEtB,OAAOb,EAAiBhD,GAAQuE,EAAoBvE,GAAQwE,EAAWxE,GAAQA,EAAOyE,EAAkBzE,GACxG,MAAOR,GACP,OAAOwD,EAAiBxD,GAExB+E,EAAoB/E,EAAEQ,MAAK,WACzB,OAAOsE,EAAOI,IAAIL,OACdM,EAAkBnF,QAKvBuE,EArEwB,CAsE/BN,GAEEmB,EAA6B,SAAUC,IACzC,OAAUD,EAAeC,GAEzB,IAAIC,EAAUnD,EAAaiD,GAE3B,SAASA,EAAcjC,GACrB,IAAIoC,EAWJ,OATA,OAAgBvC,KAAMoC,GAEtBG,EAASD,EAAQnG,KAAK6D,MAEtBa,GAAgB,OAAuB0B,GAAS,QAAS,YAEzD1B,GAAgB,OAAuB0B,GAAS,gBAAY,GAE5DA,EAAOlB,SAAWlB,EACXoC,EAyCT,OAtCA,OAAaH,EAAe,CAAC,CAC3BrD,IAAK,WACLhC,MAAO,WACL,MAAMiD,KAAKqB,WAEZ,CACDtC,IAAK,YACLhC,MAAO,WACL,OAAO4E,QAAQa,OAAOxC,KAAKqB,YAE5B,CACDtC,IAAK,aACLhC,MAAO,cAGN,CACDgC,IAAK,eACLhC,MAAO,cAGN,CACDgC,IAAK,aACLhC,MAAO,WACL,OAAOiD,KAAKqB,WAEb,CACDtC,IAAK,eACLhC,MAAO,WACL,OAAOiD,KAAKqB,WAEb,CACDtC,IAAK,MACLhC,MAAO,SAAauE,GAElB,OAAOtB,SAIJoC,EA1DwB,CA2D/BnB,GAEEwB,EAA+B,SAAUC,IAC3C,OAAUD,EAAiBC,GAE3B,IAAIC,EAAUxD,EAAasD,GAE3B,SAASA,EAAgBG,GACvB,IAAIC,EAWJ,OATA,OAAgB7C,KAAMyC,GAEtBI,EAASF,EAAQxG,KAAK6D,MAEtBa,GAAgB,OAAuBgC,GAAS,QAAS,WAEzDhC,GAAgB,OAAuBgC,GAAS,gBAAY,GAE5DA,EAAOxB,SAAWuB,EACXC,EAuET,OApEA,OAAaJ,EAAiB,CAAC,CAC7B1D,IAAK,WACLhC,MAAO,WACL,MAAMiD,KAAKqB,WAEZ,CACDtC,IAAK,YACLhC,MAAO,WACL,OAAOiD,KAAKqB,WAEb,CACDtC,IAAK,aACLhC,MAAO,cAGN,CACDgC,IAAK,eACLhC,MAAO,WACL,OAAOiD,KAAKqB,WAEb,CACDtC,IAAK,iBACLhC,MAAO,WACL,OAAOiD,KAAKqB,WAEb,CACDtC,IAAK,aACLhC,MAAO,cAGN,CACDgC,IAAK,MACLhC,MAAO,SAAa+F,GAClB,IAAIC,EAAS/C,KAEb,OAAO+B,EAAoB/B,KAAKqB,SAASX,MAAK,SAAU3D,GACtD,IAAIS,EAAOsF,EAAM/F,GAEjB,GAAIiF,EAAWxE,GAAO,CACpB,IAAIwF,EAAexF,EAEnB,OAAQwF,EAAa7B,OACnB,IAAK,WAML,IAAK,UACH,OAAO6B,EAAa3B,SAJtB,IAAK,WACH,MAAM2B,EAAa3B,UAQzB,OAAO7D,KACNyF,OAAM,SAAUjG,GACjB,GAAIwD,EAAiBxD,GAEnB,OAAOA,EAAE0D,MAAK,WACZ,OAAOqC,EAAOb,IAAIY,GAAOzB,YAI7B,MAAMrE,UAKLyF,EAxF0B,CAyFjCxB,GAEF,SAASgB,EAAkBlF,GACzB,OAAOf,OAAOkH,OAAO,IAAI3B,EAAcxE,IAGzC,SAASoF,EAAkBhC,GACzB,OAAOnE,OAAOkH,OAAO,IAAId,EAAcjC,IAGzC,SAAS4B,EAAoBa,GAC3B,OAAO5G,OAAOkH,OAAO,IAAIT,EAAgBG,IAG3C,SAASO,IACP,OAAOnH,OAAOkH,OAAO,IAAIT,EAAgB,IAAId,SAAQ,iBAiBvD,SAASyB,EAAYC,GACnB,IAMIC,EArBN,SAA0BD,GACxB,OAAOA,EAAOE,OAAM,SAAU5G,GAC5B,MAAmB,aAAZA,EAAEwE,SACNc,EAAkBoB,EAAOnB,KAAI,SAAUvF,GAC1C,OAAOA,EAAE0E,aACLgC,EAAOG,MAAK,SAAU7G,GAC1B,MAAmB,aAAZA,EAAEwE,SACNgB,EAAkBxB,EAAkB0C,EAAOI,MAAK,SAAU9G,GAC7D,MAAmB,aAAZA,EAAEwE,SACP,0CAA0CE,UAAYU,EAAoBJ,QAAQ+B,IAAIL,EAAOnB,KAAI,SAAUvF,GAC7G,OAAOA,EAAE0E,cAWEsC,EANQhI,MAAMC,QAAQyH,GAAUA,EAASrH,OAAO4H,oBAAoBP,GAAQnB,KAAI,SAAUnD,GACrG,OAAOsE,EAAOtE,OAEsBmD,KAAI,SAAUtB,GAClD,OAAOoB,EAAWpB,GAAKA,EAAIJ,EAAiBI,GAAKmB,EAAoBnB,GAAKqB,EAAkBrB,OAG9F,OAAOjF,MAAMC,QAAQyH,GACrBC,EAEAA,EAAOpB,KAAI,SAAU2B,GACnB,OAAO7H,OAAO4H,oBAAoBP,GAAQS,QAAO,SAAUC,EAAKhF,EAAKiF,GACnE,OAAOtF,EAAcA,EAAc,GAAIqF,GAAM,IAAI,OAAiB,GAAIhF,EAAK8E,EAAQG,OAClF,OAIP,SAAShC,EAAWpB,GAClB,OAAOA,aAAaK,EAGtB,IAAIgD,EAA0B,CAC5BC,GAAI,SAAYnH,GACd,OAAOyD,EAAiBzD,GAASgF,EAAoBhF,GAASiF,EAAWjF,GAASA,EAAQkF,EAAkBlF,IAE9GoD,MAAO,SAAegE,GACpB,OAAOhC,EAAkBgC,IAG3BC,QAAS,WACP,OAAOjB,KAGTO,IAAKN,EACLpB,WAAYA,GAEVqC,EAAkB,CACpBpC,kBAAmBA,EACnBE,kBAAmBA,EACnBJ,oBAAqBA,EACrBoB,gBAAiBA,EACjBC,YAAaA,EACbpB,WAAYA,EACZsC,eAAgBL,GAEdM,EAAoBF,EAAgBpC,kBACpCuC,EAAoBH,EAAgBlC,kBACpCsC,EAAoBJ,EAAgBtC,oBACpC2C,EAAoBL,EAAgBlB,gBACpCwB,EAAoBN,EAAgBjB,YACpCwB,EAAoBP,EAAgBrC,WACpC6C,EAAoBR,EAAgBC,eACpCQ,EAAiC9I,OAAOkH,OAAO,CACjD6B,UAAW,KACX9C,kBAAmBsC,EACnBpC,kBAAmBqC,EACnBzC,oBAAqB0C,EACrBtB,gBAAiBuB,EACjBtB,YAAauB,EACb3C,WAAY4C,EACZN,eAAgBO,IAadG,GAAM,IAAIC,KAAMC,IAAI,oBAAoB,GAAMA,IAAI,8BAA8B,GAAMA,IAAI,wCAAwC,GAAMA,IAAI,iCAAiC,GAEjL,SAASC,EAAeC,GACtB,IAAIC,EAEJ,OAAoC,QAA5BA,EAAWL,EAAIM,IAAIF,UAA8B,IAAbC,GAAsBA,EAGpEF,EAAeI,QAAU,SAAUH,GACjCJ,EAAIE,IAAIE,GAAI,IAGdD,EAAeK,QAAU,SAAUJ,GACjCJ,EAAIE,IAAIE,GAAI,IAGdD,EAAeM,MAAQ,WACrBT,EAAIS,SAGN,IAEIC,GAAsBC,GAAmBC,GAFzCC,GAAaV,EAIbW,GACmD,QAAtDJ,GAAuB,6BAAgE,IAAzBA,GAAkCA,GAAuB,+BACpHK,GAC6C,QAAhDJ,GAAoB,0BAA0D,IAAtBA,GAA+BA,GAAoB,4BAExGK,GACqD,QAAxDJ,GAAwB,8BAAkE,IAA1BA,GAAmCA,GACpG,gCA2DA,IAAIK,GAAmB,CACrBH,oBAAqBA,GACrBC,iBAAkBA,GAClBC,qBAAsBA,GACtBE,UArDF,WAGE,OAAIL,GAAW,6BACN,CACLM,KAAM,qBACNC,OAAO,EACPC,YAAY,GAIZR,GAAW,+BAAyD,MAAxBG,GACvC,CACLG,KAAM,sBACNC,OAAO,EACPC,YAAY,GAIZR,GAAW,0BAAgD,MAApBE,IAA8C,oBAAXO,SAA2BA,OAAOC,sDACvGV,GAAW,wCAA0C,CAC1DM,KAAM,iBACNC,OAAO,EACPC,YAAY,GACV,CACFF,KAAM,iBACNC,OAAO,EACPC,YAAY,GAITR,GAAW,wCAA0C,CAC1DM,KAAM,SACNC,OAAO,EACPC,YAAY,GACV,CACFF,KAAM,SACNC,OAAO,EACPC,YAAY,IAgBdG,qBAXF,WAGE,OAAO,IAsBLC,GAAsB,SAASA,EAAoBC,IACrD,OAAgB1G,KAAMyG,GAEtB5F,EAAgBb,KAAM,WAAO,GAE7BA,KAAKjB,IAAM2H,GAGTC,GAA2B,SAAUC,IACvC,OAAUD,EAAaC,GAEvB,IAAIC,EAAU1H,EAAawH,GAE3B,SAASA,IAGP,OAFA,OAAgB3G,KAAM2G,GAEfE,EAAQpI,MAAMuB,KAAMpB,WAG7B,OAAO+H,EAXsB,CAY7BF,IAEEK,GAAmC,SAAUC,IAC/C,OAAUD,EAAqBC,GAE/B,IAAIC,EAAU7H,EAAa2H,GAE3B,SAASA,IAGP,OAFA,OAAgB9G,KAAM8G,GAEfE,EAAQvI,MAAMuB,KAAMpB,WAG7B,OAAOkI,EAX8B,CAYrCL,IAMF,IAAIQ,GAAqB,CACvBR,oBAAqBA,GACrBE,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,GAAoCvL,OAAOkH,OAAO,CACpD6B,UAAW,KACX0B,oBAAqBU,GACrBR,YAAaS,GACbN,oBAAqBO,GACrBH,cAAeI,KAuCjB,IAEIE,GAfJ,SAA8BC,KAuF9B,IAAIC,GAvDJ,SAAqBC,EAAUC,GAE7B,OAAoB,UAAyB,SAASC,IACpD,IAAIC,EAAOC,EAAWC,EAAOjL,EAE7B,OAAO,UAAyB,SAAkBkL,GAChD,OACE,OAAQA,EAASC,KAAOD,EAASzK,MAC/B,KAAK,EACHsK,EAAQ,EACRC,EAAY1M,EAA2BsM,GACvCM,EAASC,KAAO,EAEhBH,EAAUlL,IAEZ,KAAK,EACH,IAAKmL,EAAQD,EAAUhM,KAAKe,KAAM,CAChCmL,EAASzK,KAAO,GAChB,MAKF,OAFAT,EAAQiL,EAAMjL,MACdkL,EAASzK,KAAO,EACToK,EAAS7K,EAAO+K,KAEzB,KAAK,EACHG,EAASzK,KAAO,EAChB,MAEF,KAAK,GACHyK,EAASzK,KAAO,GAChB,MAEF,KAAK,GACHyK,EAASC,KAAO,GAChBD,EAASE,GAAKF,EAAgB,MAAE,GAEhCF,EAAU/K,EAAEiL,EAASE,IAEvB,KAAK,GAKH,OAJAF,EAASC,KAAO,GAEhBH,EAAU7K,IAEH+K,EAASG,OAAO,IAEzB,KAAK,GACL,IAAK,MACH,OAAOH,EAASI,UAGrBR,EAAS,KAAM,CAAC,CAAC,EAAG,GAAI,GAAI,QAjDb,IA4EtB,IAAIS,GAXJ,SAA8BpI,EAASqI,GACrC,IAAIC,EAAQ5J,UAAUlC,OAAS,QAAsB2D,IAAjBzB,UAAU,GAAmBA,UAAU,GAAK,GAOhF,OANY4J,EAAMrI,MAMX,MAKLsI,GAA8BH,GAG9BI,GAAe,SAASA,KAC1B,OAAgB1I,KAAM0I,IAGpBC,GAAgB,IAAID,GAEpBE,GAAmC,SAAUC,IAC/C,OAAUD,EAAqBC,GAE/B,IAAIC,EAAU3J,EAAayJ,GAE3B,SAASA,EAAoB7J,GAG3B,OAFA,OAAgBiB,KAAM4I,GAEfE,EAAQ3M,KAAK6D,KAAM,6CAA6CkB,OAAOnC,EAAK,gHAGrF,OAAO6J,EAX8B,EAYvB,OAAiBxI,QAG7B2I,GAAQ,IAAI9D,IAEZ+D,GAAe,IAAI/D,IAgCvB,IAAIgE,GAAgC,SAAUC,IAC5C,OAAUD,EAAkBC,GAE5B,IAAIC,EAAUhK,EAAa8J,GAE3B,SAASA,IAGP,OAFA,OAAgBjJ,KAAMiJ,GAEfE,EAAQ1K,MAAMuB,KAAMpB,WAG7B,OAAOqK,EAX2B,EAYpB,OAAiB7I,QAkBjC,IAAIgJ,GAAyB,IAAInE,IAgCjC,SAASoE,GAAyBtK,GAChC,OAAOqK,GAAuB9D,IAAIvG,GAGpC,IAAIuK,GAAc,CAChBP,MAAOA,GACPC,aAAcA,GACdO,aA5FF,SAAsBC,GACpB,GAAIT,GAAMU,IAAID,EAAKzK,KAAM,CACvB,IAAImB,EAAU,uBAAwBgB,OAAOsI,EAAKzK,IAAK,iJASrD2K,QAAQC,KAAKzJ,GAIjB6I,GAAM7D,IAAIsE,EAAKzK,IAAKyK,GACpB,IAAII,EAA0B,MAAZJ,EAAKtE,IAAc,IAAIqC,GAAqBT,oBAAoB0C,EAAKzK,KAAO,IAAIwI,GAAqBZ,YAAY6C,EAAKzK,KAExI,OADAiK,GAAa9D,IAAIsE,EAAKzK,IAAK6K,GACpBA,GA2EPC,QAvDF,SAAiB9K,GACf,IAAIyK,EAAOT,GAAMzD,IAAIvG,GAErB,GAAY,MAARyK,EACF,MAAM,IAAIP,GAAiB,wCAAyC/H,OAAOnC,EAAK,OAGlF,OAAOyK,GAiDPM,aA7CF,SAAsB/K,GACpB,OAAOgK,GAAMzD,IAAIvG,IA6CjBgL,2BAxCF,SAAoChL,GAClC,IAAIiL,EAEJ,GAAKnE,GAAW,iCAAhB,CAIA,IAGMoE,EAHFT,EAAOT,GAAMzD,IAAIvG,GAErB,GAAIyK,MAAAA,GAAmG,QAA9DQ,EAAwBR,EAAKU,mCAAmE,IAA1BF,GAAoCA,EAAsB7N,KAAKqN,GAG5KT,GAAMoB,OAAOpL,GAC+C,QAA3DkL,EAAwBZ,GAAyBtK,UAA4C,IAA1BkL,GAA4CA,IAChHb,GAAuBe,OAAOpL,KA2BhCqL,yBAvBF,SAAkCrL,EAAKsL,GAChCxE,GAAW,wCAILxF,IAAPgK,EACFjB,GAAuBe,OAAOpL,GAE9BqK,GAAuBlE,IAAInG,EAAKsL,KAgBlChB,yBAA0BA,GAC1BiB,oBAxGF,SAA6BrM,GAC3B,OAAOyJ,GAAmBzJ,GAAM,SAAUc,GACxC,OAAO4B,EAAkBqI,GAAa1D,IAAIvG,QAuG5CkK,iBAAkBA,GAClBP,aAAcA,GACdC,cAAeA,GACfC,oBAAqBA,IAiBvB,IAAI2B,GAAe,CACjBC,iBALF,SAA0B3N,EAAGK,GAC3BA,MAaF,IAN8BmN,GAAII,GAM9BC,IAN0BL,GAMI,SAAUI,GAC1C,IAAIE,EAA4B,mBAAXlP,QAAoD,iBAApBA,OAAOC,SAAwB,SAAUoF,GAC5F,cAAcA,GACZ,SAAUA,GACZ,OAAOA,GAAyB,mBAAXrF,QAAyBqF,EAAIzE,cAAgBZ,QAAUqF,IAAQrF,OAAOQ,UAAY,gBAAkB6E,GASvH8J,EAAO,GAMPC,EAAcC,KAAKC,IAAI,EADhB,GAEPC,EAAOH,EAAc,EACrBI,EAAiBJ,EAAc,EAC/BK,EAAiBL,EAAc,EAI/BM,EAAU,GAEVC,EAAW,SAAkBxK,GAC/B,OAAO,WACL,OAAOA,IAWPyK,EAAOT,EAAKS,KAAO,SAAUC,GAC/B,IAAIC,OAAsB,IAARD,EAAsB,YAAcX,EAAQW,GAC9D,GAAa,WAATC,EAAmB,OAAOD,EACjB,WAATC,IAAmBD,GAAO,IAG9B,IAFA,IAAID,EAAO,EAEF1O,EAAI,EAAGiB,EAAM0N,EAAI5O,OAAQC,EAAIiB,IAAOjB,EAE3C0O,GAAQA,GAAQ,GAAKA,EADbC,EAAIE,WAAW7O,GACS,EAGlC,OAAO0O,GAqBLI,EAAe,SAAsBC,EAAOC,GAC9C,OAAOA,IAAMD,EAAQV,GAGnBY,EAAW,SAAkBhL,GAC/B,OAAO,GAAKA,GAGViL,EAAa,SAAoBC,EAAQC,GAC3C,OAlB+BnL,EAkBfkL,EAASC,EAAM,EAf/BnL,GADAA,GAAS,WADTA,GAAKA,GAAK,EAAI,cACUA,GAAK,EAAI,aACxBA,GAAK,GAAK,UAGR,KAFXA,GAAKA,GAAK,IACLA,GAAK,IALG,IAAkBA,GAiC7BoL,EAAc,SAAqBC,EAAQC,EAAIC,EAAGxO,GACpD,IAAIoG,EAAMpG,EAEV,IAAKsO,EAAQ,CACX,IAAIrO,EAAMD,EAAIjB,OACdqH,EAAM,IAAIpI,MAAMiC,GAEhB,IAAK,IAAIjB,EAAI,EAAGA,EAAIiB,IAAOjB,EACzBoH,EAAIpH,GAAKgB,EAAIhB,GAKjB,OADAoH,EAAImI,GAAMC,EACHpI,GAWLqI,EAAiB,SAAwBH,EAAQC,EAAIvO,GACvD,IAAI0O,EAAS1O,EAAIjB,OAAS,EACtBC,EAAI,EACJ2P,EAAI,EACJvI,EAAMpG,EAEV,GAAIsO,EACFtP,EAAI2P,EAAIJ,OAIR,IAFAnI,EAAM,IAAIpI,MAAM0Q,GAET1P,EAAIuP,GACTnI,EAAIuI,KAAO3O,EAAIhB,KAMnB,MAFEA,EAEKA,GAAK0P,GACVtI,EAAIuI,KAAO3O,EAAIhB,KAOjB,OAJIsP,IACFlI,EAAIrH,OAAS2P,GAGRtI,GAsDLwI,EAAQ,CACVC,gBAAgB,GAGdC,EAAc,SAAqB7L,GACrC,OAAOA,IAAM2L,GAAS3L,GAAKA,EAAE4L,gBAY3BE,EAAO,SAAcC,EAAMtB,EAAMtM,EAAKhC,GACxC,MAAO,CACLwO,KA3BO,EA4BPoB,KAAMA,EACNtB,KAAMA,EACNtM,IAAKA,EACLhC,MAAOA,EACP6P,QAASC,IAYTC,EAAY,SAAmBH,EAAMtB,EAAM0B,GAC7C,MAAO,CACLxB,KA7CY,EA8CZoB,KAAMA,EACNtB,KAAMA,EACN0B,SAAUA,EACVH,QAASI,IAcTC,EAAc,SAAqBN,EAAMO,EAAMH,GACjD,MAAO,CACLxB,KAhEQ,EAiERoB,KAAMA,EACNO,KAAMA,EACNH,SAAUA,EACVH,QAASO,IAYTC,EAAY,SAAmBT,EAAMU,EAAMN,GAC7C,MAAO,CACLxB,KAjFQ,EAkFRoB,KAAMA,EACNU,KAAMA,EACNN,SAAUA,EACVH,QAASU,IA6ETC,EAAc,SAASA,EAAYZ,EAAMjB,EAAO8B,EAAIC,EAAIC,EAAIC,GAC9D,GAAIH,IAAOE,EAAI,OAAOZ,EAAUH,EAAMa,EAAI,CAACG,EAAIF,IAC/C,IAAIG,EAAQnC,EAAaC,EAAO8B,GAC5BK,EAAQpC,EAAaC,EAAOgC,GAChC,OAAOT,EAAYN,EAAMf,EAASgC,GAAShC,EAASiC,GAAQD,IAAUC,EAAQ,CAACN,EAAYZ,EAAMjB,EAxVxF,EAwVsG8B,EAAIC,EAAIC,EAAIC,IAAOC,EAAQC,EAAQ,CAACJ,EAAIE,GAAM,CAACA,EAAIF,KA4ChKK,EAAc,SAAqBnB,EAAMnD,GAC3C,OAAOmD,IAASnD,EAAKmD,MAMnBE,EAAe,SAAsBF,EAAMoB,EAAOrC,EAAOxO,EAAGyO,EAAGqC,EAAGX,GACpE,GAAIU,EAAMC,EAAGhO,KAAKjB,KAAM,CACtB,IAAIkP,EAAK/Q,EAAE8C,KAAKjD,OAEhB,OAAIkR,IAAOjO,KAAKjD,MAAciD,KAAciO,IAAO9C,KAC/CkC,EAAKtQ,MACAwP,GAGLuB,EAAYnB,EAAM3M,OACpBA,KAAKjD,MAAQkR,EACNjO,MAGF0M,EAAKC,EAAMhB,EAAGqC,EAAGC,GAG1B,IAAI9B,EAAIjP,IACR,OAAIiP,IAAMhB,EAAgBnL,QACxBqN,EAAKtQ,MACAwQ,EAAYZ,EAAMjB,EAAO1L,KAAKqL,KAAMrL,KAAM2L,EAAGe,EAAKC,EAAMhB,EAAGqC,EAAG7B,MAGnEa,EAAoB,SAA2BL,EAAMoB,EAAOrC,EAAOxO,EAAGyO,EAAGqC,EAAGX,GAC9E,GAAI1B,IAAM3L,KAAKqL,KAAM,CACnB,IACI6C,EA7DkB,SAA6BjC,EAAQU,EAAMoB,EAAOpC,EAAGuC,EAAMhR,EAAG8Q,EAAGX,GAGzF,IAFA,IAAIzP,EAAMsQ,EAAKxR,OAENC,EAAI,EAAGA,EAAIiB,IAAOjB,EAAG,CAC5B,IAAIwR,EAAQD,EAAKvR,GAEjB,GAAIoR,EAAMC,EAAGG,EAAMpP,KAAM,CACvB,IAAIhC,EAAQoR,EAAMpR,MAEdqR,EAAYlR,EAAEH,GAElB,OAAIqR,IAAcrR,EAAcmR,EAE5BE,IAAcjD,KACdkC,EAAKtQ,MACAqP,EAAeH,EAAQtP,EAAGuR,IAG5BlC,EAAYC,EAAQtP,EAAG+P,EAAKC,EAAMhB,EAAGqC,EAAGI,GAAYF,IAI/D,IAAIG,EAAWnR,IACf,OAAImR,IAAalD,EAAgB+C,KAC/Bb,EAAKtQ,MACAiP,EAAYC,EAAQrO,EAAK8O,EAAKC,EAAMhB,EAAGqC,EAAGK,GAAWH,IAoC/CI,CADGR,EAAYnB,EAAM3M,MACQ2M,EAAMoB,EAAO/N,KAAKqL,KAAMrL,KAAK+M,SAAU7P,EAAG8Q,EAAGX,GACrF,OAAIa,IAASlO,KAAK+M,SAAiB/M,KAC5BkO,EAAKxR,OAAS,EAAIoQ,EAAUH,EAAM3M,KAAKqL,KAAM6C,GAAQA,EAAK,GAGnE,IAAI/B,EAAIjP,IACR,OAAIiP,IAAMhB,EAAgBnL,QACxBqN,EAAKtQ,MACAwQ,EAAYZ,EAAMjB,EAAO1L,KAAKqL,KAAMrL,KAAM2L,EAAGe,EAAKC,EAAMhB,EAAGqC,EAAG7B,MAGnEgB,EAAsB,SAA6BR,EAAMoB,EAAOrC,EAAOxO,EAAGyO,EAAGqC,EAAGX,GAClF,IAAIH,EAAOlN,KAAKkN,KACZH,EAAW/M,KAAK+M,SAChBwB,EAAO9C,EAAaC,EAAOC,GAC3BI,EAAMH,EAAS2C,GACfC,EAAO3C,EAAWqB,EAAMnB,GACxB0C,EAASvB,EAAOnB,EAChB2C,EAAUD,EAAS1B,EAASyB,GAAQjC,EAEpC4B,EAAQO,EAAQ9B,QAAQD,EAAMoB,EAAOrC,EAzbhC,EAyb8CxO,EAAGyO,EAAGqC,EAAGX,GAEhE,GAAIqB,IAAYP,EAAO,OAAOnO,KAC9B,IA7K2BwJ,EA6KvBmF,EAAUb,EAAYnB,EAAM3M,MAC5B8L,EAASoB,EACT0B,OAAc,EAElB,GAAIH,GAAUhC,EAAY0B,GAAQ,CAGhC,KADArC,IAAWC,GACE,OAAOQ,EACpB,GAAIQ,EAASrQ,QAAU,KArLE8M,EAqLUuD,EAAgB,EAAPyB,MApL9BjC,GAjGP,IAiGgB/C,EAAK+B,MAhGhB,IAgGiC/B,EAAK+B,MAoLM,OAAOwB,EAAgB,EAAPyB,GAExEI,EAAcxC,EAAeuC,EAASH,EAAMzB,QACvC,GAAK0B,GAAWhC,EAAY0B,GAOjCS,EAAc5C,EAAY2C,EAASH,EAAML,EAAOpB,OAPP,CAEzC,GAAIA,EAASrQ,QAAUuO,EAAgB,OAzK9B,SAAgB0B,EAAM4B,EAAMJ,EAAOrC,EAAQ+C,GAKtD,IAJA,IAAIlR,EAAM,GACNoO,EAAMD,EACNgD,EAAQ,EAEHnS,EAAI,EAAGoP,IAAOpP,EACX,EAANoP,IAASpO,EAAIhB,GAAKkS,EAASC,MAC/B/C,KAAS,EAIX,OADApO,EAAI4Q,GAAQJ,EACLf,EAAUT,EAAMmC,EAAQ,EAAGnR,GA8JcoR,CAAOpC,EAAM4B,EAAMJ,EAAOjB,EAAMH,GAC9EjB,GAAUC,EACV6C,EA9TgB,SAAuB3C,EAAQC,EAAIC,EAAGxO,GACxD,IAAIC,EAAMD,EAAIjB,OAEd,GAAIuP,EAAQ,CAGV,IAFA,IAAI+C,EAAKpR,EAEFoR,GAAM9C,GACXvO,EAAIqR,KAAQrR,EAAIqR,GAIlB,OADArR,EAAIuO,GAAMC,EACHxO,EAOT,IAJA,IAAIhB,EAAI,EACJ2P,EAAI,EACJvI,EAAM,IAAIpI,MAAMiC,EAAM,GAEnBjB,EAAIuP,GACTnI,EAAIuI,KAAO3O,EAAIhB,KAKjB,IAFAoH,EAAImI,GAAMC,EAEHxP,EAAIiB,GACTmG,IAAMuI,GAAK3O,EAAIhB,KAGjB,OAAOoH,EAkSSkL,CAAcN,EAASH,EAAML,EAAOpB,GAMpD,OAAI4B,GACF3O,KAAKkN,KAAOpB,EACZ9L,KAAK+M,SAAW6B,EACT5O,MAGFiN,EAAYN,EAAMb,EAAQ8C,IAG/BtB,EAAoB,SAA2BX,EAAMoB,EAAOrC,EAAOxO,EAAGyO,EAAGqC,EAAGX,GAC9E,IAAIyB,EAAQ9O,KAAKqN,KACbN,EAAW/M,KAAK+M,SAChBwB,EAAO9C,EAAaC,EAAOC,GAC3BwC,EAAQpB,EAASwB,GAEjBW,GAAYf,GAAS5B,GAAOK,QAAQD,EAAMoB,EAAOrC,EAhe5C,EAge0DxO,EAAGyO,EAAGqC,EAAGX,GAE5E,GAAIc,IAAUe,EAAU,OAAOlP,KAC/B,IAAI2O,EAAUb,EAAYnB,EAAM3M,MAC5B4O,OAAc,EAElB,GAAInC,EAAY0B,KAAW1B,EAAYyC,KAEnCJ,EACFF,EAAc5C,EAAY2C,EAASJ,EAAMW,EAAUnC,QAC9C,IAAKN,EAAY0B,IAAU1B,EAAYyC,GAAW,CAGvD,KADEJ,GACW5D,EAAgB,OAtLtB,SAAcyB,EAAMmC,EAAOK,EAASC,GAK7C,IAJA,IAAIrC,EAAW,IAAIpR,MAAMmT,EAAQ,GAC7BxC,EAAI,EACJR,EAAS,EAEJnP,EAAI,EAAGiB,EAAMwR,EAAS1S,OAAQC,EAAIiB,IAAOjB,EAChD,GAAIA,IAAMwS,EAAS,CACjB,IAAIE,EAAOD,EAASzS,GAEhB0S,IAAS5C,EAAY4C,KACvBtC,EAAST,KAAO+C,EAChBvD,GAAU,GAAKnP,GAKrB,OAAOsQ,EAAYN,EAAMb,EAAQiB,GAsKKuC,CAAK3C,EAAMmC,EAAOP,EAAMxB,GAC5D6B,EAAc5C,EAAY2C,EAASJ,EAAMhC,EAAOQ,QAGhD6B,EAAc5C,EAAY2C,EAASJ,EAAMW,EAAUnC,GAGrD,OAAI4B,GACF3O,KAAKqN,KAAOyB,EACZ9O,KAAK+M,SAAW6B,EACT5O,MAGFoN,EAAUT,EAAMmC,EAAOF,IAahC,SAAS3J,EAAIsK,EAAU5C,EAAM6C,EAAQC,EAAMpC,GACzCrN,KAAK0P,UAAYH,EACjBvP,KAAK2P,MAAQhD,EACb3M,KAAK4P,QAAUJ,EACfxP,KAAK6P,MAAQJ,EACbzP,KAAK8P,MAAQzC,EAffd,EAAMK,QAAU,SAAUD,EAAMoB,EAAOrC,EAAOxO,EAAGyO,EAAGqC,EAAGX,GACrD,IAAIlB,EAAIjP,IACR,OAAIiP,IAAMhB,EAAgBoB,KACxBc,EAAKtQ,MACA2P,EAAKC,EAAMhB,EAAGqC,EAAG7B,KAc1BlH,EAAIhJ,UAAU8T,QAAU,SAAUC,EAASC,GACzC,OAAIjQ,KAAK0P,WACP1P,KAAK6P,MAAQG,EACbhQ,KAAK8P,MAAQG,EACNjQ,MAGFgQ,IAAYhQ,KAAK6P,MAAQ7P,KAAO,IAAIiF,EAAIjF,KAAK0P,UAAW1P,KAAK2P,MAAO3P,KAAK4P,QAASI,EAASC,IAYpG,IAAIC,EAAatF,EAAKsF,WAAa,SAAUC,EAAK9E,EAAMtM,EAAKmD,GAK3D,IAJA,IAAIsH,EAAOtH,EAAI2N,MACXnE,EAAQ,EACRqC,EAAQ7L,EAAI0N,QAAQ7B,QAGtB,OAAQvE,EAAK+B,MACX,KA1XK,EA4XD,OAAOwC,EAAMhP,EAAKyK,EAAKzK,KAAOyK,EAAKzM,MAAQoT,EAG/C,KA9XU,EAgYN,GAAI9E,IAAS7B,EAAK6B,KAGhB,IAFA,IAAI0B,EAAWvD,EAAKuD,SAEXpQ,EAAI,EAAGiB,EAAMmP,EAASrQ,OAAQC,EAAIiB,IAAOjB,EAAG,CACnD,IAAIwR,EAAQpB,EAASpQ,GACrB,GAAIoR,EAAMhP,EAAKoP,EAAMpP,KAAM,OAAOoP,EAAMpR,MAI5C,OAAOoT,EAGX,KA3YM,EA6YF,IAAI5B,EAAO9C,EAAaC,EAAOL,GAC3BU,EAAMH,EAAS2C,GAEnB,GAAI/E,EAAK0D,KAAOnB,EAAK,CACnBvC,EAAOA,EAAKuD,SAASlB,EAAWrC,EAAK0D,KAAMnB,IAC3CL,GAnkBD,EAokBC,MAGF,OAAOyE,EAGX,KAxZM,EA4ZF,GAFA3G,EAAOA,EAAKuD,SAAStB,EAAaC,EAAOL,IAE/B,CACRK,GA/kBD,EAglBC,MAGF,OAAOyE,EAGX,QACE,OAAOA,IAKflL,EAAIhJ,UAAUiU,WAAa,SAAUC,EAAK9E,EAAMtM,GAC9C,OAAOmR,EAAWC,EAAK9E,EAAMtM,EAAKiB,OASpC,IAAIoQ,EAASxF,EAAKwF,OAAS,SAAUD,EAAKpR,EAAKmD,GAC7C,OAAOgO,EAAWC,EAAKjO,EAAI0N,QAAQvE,KAAKtM,GAAMA,EAAKmD,IAGrD+C,EAAIhJ,UAAUmU,OAAS,SAAUD,EAAKpR,GACpC,OAAOqR,EAAOD,EAAKpR,EAAKiB,OAS1B,IAAIqQ,EAAUzF,EAAKyF,QAAU,SAAUhF,EAAMtM,EAAKmD,GAChD,OAAOgO,OAAW7P,EAAWgL,EAAMtM,EAAKmD,IAG1C+C,EAAIhJ,UAAUoU,QAAU,SAAUhF,EAAMtM,GACtC,OAAOsR,EAAQhF,EAAMtM,EAAKiB,OASlB4K,EAAKtF,IAAM,SAAUvG,EAAKmD,GAClC,OAAOgO,OAAW7P,EAAW6B,EAAI0N,QAAQvE,KAAKtM,GAAMA,EAAKmD,IAG3D+C,EAAIhJ,UAAUqJ,IAAM,SAAUvG,EAAKoR,GACjC,OAAOC,EAAOD,EAAKpR,EAAKiB,OAO1B,IAAIsQ,EAAU1F,EAAKnB,IAAM,SAAU4B,EAAMtM,EAAKmD,GAC5C,OAAOgO,EAAW/E,EAASE,EAAMtM,EAAKmD,KAASiJ,GAGjDlG,EAAIhJ,UAAUqU,QAAU,SAAUjF,EAAMtM,GACtC,OAAOuR,EAAQjF,EAAMtM,EAAKiB,OAO5B,IAAIyJ,EAAMmB,EAAKnB,IAAM,SAAU1K,EAAKmD,GAClC,OAAOoO,EAAQpO,EAAI0N,QAAQvE,KAAKtM,GAAMA,EAAKmD,IAG7C+C,EAAIhJ,UAAUwN,IAAM,SAAU1K,GAC5B,OAAO0K,EAAI1K,EAAKiB,OAGlB,IAAIuQ,EAAgB,SAAuB3P,EAAG4P,GAC5C,OAAO5P,IAAM4P,GASf5F,EAAK6F,KAAO,SAAUjB,GACpB,OAAO,IAAIvK,EAAI,EAAG,EAAG,CACnB8I,MAAOyB,GAAUA,EAAOzB,OAASwC,EACjClF,KAAMmE,GAAUA,EAAOnE,MAAQA,GAC9BkB,EAAO,IAOZ3B,EAAK2B,MAAQ3B,EAAK6F,OAKlB,IAAIC,EAAU9F,EAAK8F,QAAU,SAAUxO,GACrC,OAAOA,KAASuK,EAAYvK,EAAI2N,QAGlC5K,EAAIhJ,UAAUyU,QAAU,WACtB,OAAOA,EAAQ1Q,OAiBjB,IAAI2Q,EAAa/F,EAAK+F,WAAa,SAAUzT,EAAGmO,EAAMtM,EAAKmD,GACzD,IAAImL,EAAO,CACTtQ,MAAOmF,EAAI4N,OAGTE,EAAU9N,EAAI2N,MAAMjD,QAAQ1K,EAAIwN,UAAYxN,EAAIyN,MAAQiB,IAAK1O,EAAI0N,QAAQ7B,MAAO,EAAG7Q,EAAGmO,EAAMtM,EAAKsO,GAErG,OAAOnL,EAAI6N,QAAQC,EAAS3C,EAAKtQ,QAGnCkI,EAAIhJ,UAAU0U,WAAa,SAAUtF,EAAMtM,EAAK7B,GAC9C,OAAOyT,EAAWzT,EAAGmO,EAAMtM,EAAKiB,OAUlC,IAAI6Q,EAASjG,EAAKiG,OAAS,SAAU3T,EAAG6B,EAAKmD,GAC3C,OAAOyO,EAAWzT,EAAGgF,EAAI0N,QAAQvE,KAAKtM,GAAMA,EAAKmD,IAGnD+C,EAAIhJ,UAAU4U,OAAS,SAAU9R,EAAK7B,GACpC,OAAO2T,EAAO3T,EAAG6B,EAAKiB,OASxB,IAAI8Q,EAAUlG,EAAKkG,QAAU,SAAUzF,EAAMtM,EAAKhC,EAAOmF,GACvD,OAAOyO,EAAWvF,EAASrO,GAAQsO,EAAMtM,EAAKmD,IAGhD+C,EAAIhJ,UAAU6U,QAAU,SAAUzF,EAAMtM,EAAKhC,GAC3C,OAAO+T,EAAQzF,EAAMtM,EAAKhC,EAAOiD,OASnC,IAAIkF,EAAM0F,EAAK1F,IAAM,SAAUnG,EAAKhC,EAAOmF,GACzC,OAAO4O,EAAQ5O,EAAI0N,QAAQvE,KAAKtM,GAAMA,EAAKhC,EAAOmF,IAGpD+C,EAAIhJ,UAAUiJ,IAAM,SAAUnG,EAAKhC,GACjC,OAAOmI,EAAInG,EAAKhC,EAAOiD,OASzB,IAAI+Q,EAAM3F,EAASD,GAEf6F,EAAapG,EAAKoG,WAAa,SAAU3F,EAAMtM,EAAKmD,GACtD,OAAOyO,EAAWI,EAAK1F,EAAMtM,EAAKmD,IAGpC+C,EAAIhJ,UAAU+U,WAAa/L,EAAIhJ,UAAUgV,WAAa,SAAU5F,EAAMtM,GACpE,OAAOiS,EAAW3F,EAAMtM,EAAKiB,OAS/B,IAAIkR,EAAStG,EAAKsG,OAAS,SAAUnS,EAAKmD,GACxC,OAAO8O,EAAW9O,EAAI0N,QAAQvE,KAAKtM,GAAMA,EAAKmD,IAGhD+C,EAAIhJ,UAAUiV,OAASjM,EAAIhJ,UAAUkO,OAAS,SAAUpL,GACtD,OAAOmS,EAAOnS,EAAKiB,OAUrB,IAAImR,EAAgBvG,EAAKuG,cAAgB,SAAUjP,GACjD,OAAO,IAAI+C,EAAI/C,EAAIwN,UAAY,EAAGxN,EAAIyN,MAAQ,EAAGzN,EAAI0N,QAAS1N,EAAI2N,MAAO3N,EAAI4N,QAG/E7K,EAAIhJ,UAAUkV,cAAgB,WAC5B,OAAOA,EAAcnR,OAOvB,IAAIoR,EAAcxG,EAAKwG,YAAc,SAAUlP,GAE7C,OADAA,EAAIwN,UAAYxN,EAAIwN,WAAaxN,EAAIwN,UAAY,EAC1CxN,GAGT+C,EAAIhJ,UAAUmV,YAAc,WAC1B,OAAOA,EAAYpR,OASrB,IAAIiM,EAASrB,EAAKqB,OAAS,SAAU/O,EAAGgF,GACtC,IAAImP,EAAYF,EAAcjP,GAE9B,OADAhF,EAAEmU,GACKD,EAAYC,IAGrBpM,EAAIhJ,UAAUgQ,OAAS,SAAU/O,GAC/B,OAAO+O,EAAO/O,EAAG8C,OAUnB,IAAIsR,EAAO,SAActD,GACvB,OAAOA,GAAKuD,EAAkBvD,EAAE,GAAIA,EAAE,GAAIA,EAAE,GAAIA,EAAE,GAAIA,EAAE,KAOtDuD,EAAoB,SAA2B3T,EAAKmP,EAAUpQ,EAAGO,EAAG8Q,GACtE,KAAOrR,EAAIiB,GAAK,CACd,IAAIuQ,EAAQpB,EAASpQ,KACrB,GAAIwR,IAAU1B,EAAY0B,GAAQ,OAAOqD,EAAUrD,EAAOjR,EAAG,CAACU,EAAKmP,EAAUpQ,EAAGO,EAAG8Q,IAGrF,OAAOsD,EAAKtD,IAOVwD,EAAY,SAAmBhI,EAAMtM,EAAG8Q,GAC1C,OAAQxE,EAAK+B,MACX,KApsBO,EAqsBL,MAAO,CACLxO,MAAOG,EAAEsM,GACTiI,KAAMzD,GAGV,KAzsBY,EA0sBZ,KAxsBQ,EAysBR,KA1sBQ,EA2sBN,IAAIjB,EAAWvD,EAAKuD,SACpB,OAAOwE,EAAkBxE,EAASrQ,OAAQqQ,EAAU,EAAG7P,EAAG8Q,GAE5D,QACE,OAAOsD,EAAKtD,KAId0D,EAAO,CACT5U,MAAM,GAMR,SAAS6U,EAAYxF,GACnBnM,KAAKmM,EAAIA,EAGXwF,EAAY1V,UAAUuB,KAAO,WAC3B,IAAKwC,KAAKmM,EAAG,OAAOuF,EACpB,IAAIE,EAAK5R,KAAKmM,EAEd,OADAnM,KAAKmM,EAAImF,EAAKM,EAAGH,MACVG,GAGTD,EAAY1V,UAAUR,OAAOC,UAAY,WACvC,OAAOsE,MAOT,IAAI6R,EAAQ,SAAe3P,EAAKhF,GAC9B,OAAO,IAAIyU,EAAYH,EAAUtP,EAAI2N,MAAO3S,KAS1C4U,EAAa,SAAoBlR,GACnC,MAAO,CAACA,EAAE7B,IAAK6B,EAAE7D,QAGfgV,EAAUnH,EAAKmH,QAAU,SAAU7P,GACrC,OAAO2P,EAAM3P,EAAK4P,IAGpB7M,EAAIhJ,UAAU8V,QAAU9M,EAAIhJ,UAAUR,OAAOC,UAAY,WACvD,OAAOqW,EAAQ/R,OASjB,IAAIgS,EAAY,SAAmBpR,GACjC,OAAOA,EAAE7B,KAGPd,GAAO2M,EAAK3M,KAAO,SAAUiE,GAC/B,OAAO2P,EAAM3P,EAAK8P,IAGpB/M,EAAIhJ,UAAUgC,KAAO,WACnB,OAAOA,GAAK+B,OASd,IAAIiS,GAAc,SAAqBrR,GACrC,OAAOA,EAAE7D,OAGPmV,GAAStH,EAAKsH,OAASjN,EAAIhJ,UAAUiW,OAAS,SAAUhQ,GAC1D,OAAO2P,EAAM3P,EAAK+P,KAGpBhN,EAAIhJ,UAAUiW,OAAS,WACrB,OAAOA,GAAOlS,OAgBhB,IAAImS,GAAOvH,EAAKuH,KAAO,SAAUjV,EAAGkV,EAAGC,GACrC,IAAI5C,EAAO4C,EAAExC,MACb,GAxzBS,IAwzBLJ,EAAKlE,KAAe,OAAOrO,EAAEkV,EAAG3C,EAAK1S,MAAO0S,EAAK1Q,KAIrD,IAHA,IAAIuT,EAAU,CAAC7C,EAAK1C,UAChBA,OAAW,EAERA,EAAWuF,EAAQC,OACxB,IAAK,IAAI5V,EAAI,EAAGiB,EAAMmP,EAASrQ,OAAQC,EAAIiB,GAAM,CAC/C,IAAIuQ,EAAQpB,EAASpQ,KAEjBwR,GAASA,EAAM5C,OAh0Bd,IAi0BC4C,EAAM5C,KAAe6G,EAAIlV,EAAEkV,EAAGjE,EAAMpR,MAAOoR,EAAMpP,KAAUuT,EAAQ9T,KAAK2P,EAAMpB,WAKxF,OAAOqF,GAGTnN,EAAIhJ,UAAUkW,KAAO,SAAUjV,EAAGkV,GAChC,OAAOD,GAAKjV,EAAGkV,EAAGpS,OAYpB,IAAIlB,GAAU8L,EAAK9L,QAAU,SAAU5B,EAAGgF,GACxC,OAAOiQ,IAAK,SAAU5R,EAAGxD,EAAOgC,GAC9B,OAAO7B,EAAEH,EAAOgC,EAAKmD,KACpB,KAAMA,IAGX+C,EAAIhJ,UAAU6C,QAAU,SAAU5B,GAChC,OAAO4B,GAAQ5B,EAAG8C,OAUpB,IAAI8O,GAAQlE,EAAKkE,MAAQ,SAAU5M,GACjC,OAAOA,EAAI4N,OAGb7K,EAAIhJ,UAAU6S,MAAQ,WACpB,OAAOA,GAAM9O,OAGfhE,OAAOkD,eAAe+F,EAAIhJ,UAAW,OAAQ,CAC3CqJ,IAAKL,EAAIhJ,UAAU6S,QAKjBrE,EAAO+H,QACT/H,EAAO+H,QAAU5H,QAEjBvK,GAAUuK,KAAOA,GA5jChBP,GAFII,GAAS,CACd+H,QAAS,IACG/H,GAAO+H,SAAU/H,GAAO+H,SAgkCpCC,GAA0B,WAC5B,SAASA,EAAWC,IAClB,OAAgB1S,KAAMyS,GAEtB5R,EAAgBb,KAAM,YAAQ,GAE9BA,KAAKsB,KAAO,IAAI2D,IAAIyN,MAAAA,OAA2C,EAASA,EAASX,WAiDnF,OA9CA,OAAaU,EAAY,CAAC,CACxB1T,IAAK,OACLhC,MAAO,WACL,OAAOiD,KAAKsB,KAAKrD,SAElB,CACDc,IAAK,UACLhC,MAAO,WACL,OAAOiD,KAAKsB,KAAKyQ,YAElB,CACDhT,IAAK,MACLhC,MAAO,SAAaiR,GAClB,OAAOhO,KAAKsB,KAAKgE,IAAI0I,KAEtB,CACDjP,IAAK,MACLhC,MAAO,SAAaiR,GAClB,OAAOhO,KAAKsB,KAAKmI,IAAIuE,KAEtB,CACDjP,IAAK,MACLhC,MAAO,SAAaiR,EAAG7B,GAGrB,OAFAnM,KAAKsB,KAAK4D,IAAI8I,EAAG7B,GAEVnM,OAER,CACDjB,IAAK,SACLhC,MAAO,SAAiBiR,GAGtB,OAFAhO,KAAKsB,KAAK6I,OAAO6D,GAEVhO,OAER,CACDjB,IAAK,QACLhC,MAAO,WACL,OAAO4V,GAAc3S,QAEtB,CACDjB,IAAK,QACLhC,MAAO,WACL,OAAO,IAAIkI,IAAIjF,KAAKsB,UAIjBmR,EAvDqB,GA0D1BG,GAAsC,WAIxC,SAASA,EAAuBF,GAK9B,IAJA,OAAgB1S,KAAM4S,GAEtB/R,EAAgBb,KAAM,QAAS0K,GAAO6B,MAAM4E,iBAExCuB,aAAoBE,EAAwB,CAC9C,IAAIjH,EAAI+G,EAASG,MAAMzB,cAEvBsB,EAASG,MAAQlH,EAAEwF,gBACnBnR,KAAK6S,MAAQlH,EAAEwF,qBACV,GAAIuB,EAAU,CACnB,IACII,EADAC,EAAa1X,EAA2BqX,EAASX,WAGrD,IACE,IAAKgB,EAAWlW,MAAOiW,EAASC,EAAWhX,KAAKe,MAAO,CACrD,IAAIkW,GAAe,OAAeF,EAAO/V,MAAO,GAC5CiR,EAAIgF,EAAa,GACjB7G,EAAI6G,EAAa,GAErBhT,KAAK6S,MAAM3N,IAAI8I,EAAG7B,IAEpB,MAAO/O,GACP2V,EAAW/V,EAAEI,GACb,QACA2V,EAAW7V,MAmDjB,OA9CA,OAAa0V,EAAwB,CAAC,CACpC7T,IAAK,OACLhC,MAAO,WACL,OAAOiD,KAAK6S,MAAM5U,SAEnB,CACDc,IAAK,UACLhC,MAAO,WACL,OAAOiD,KAAK6S,MAAMd,YAEnB,CACDhT,IAAK,MACLhC,MAAO,SAAaiR,GAClB,OAAOhO,KAAK6S,MAAMvN,IAAI0I,KAEvB,CACDjP,IAAK,MACLhC,MAAO,SAAaiR,GAClB,OAAOhO,KAAK6S,MAAMpJ,IAAIuE,KAEvB,CACDjP,IAAK,MACLhC,MAAO,SAAaiR,EAAG7B,GAGrB,OAFAnM,KAAK6S,MAAM3N,IAAI8I,EAAG7B,GAEXnM,OAER,CACDjB,IAAK,SACLhC,MAAO,SAAiBiR,GAGtB,OAFAhO,KAAK6S,MAAM1I,OAAO6D,GAEXhO,OAER,CACDjB,IAAK,QACLhC,MAAO,WACL,OAAO4V,GAAc3S,QAEtB,CACDjB,IAAK,QACLhC,MAAO,WACL,OAAO,IAAIkI,IAAIjF,KAAK6S,WAIjBD,EAhFiC,GAmF1C,SAASD,GAAcD,GACrB,OAAI7M,GAAW,oBACN,IAAI+M,GAAuBF,GAE3B,IAAID,GAAWC,GAI1B,IAGIO,GAFaN,GAoEjB,IAAIO,GA1CJ,SAAwBhO,GAGtB,IAFA,IAAIiO,EAAM,IAAIC,IAELC,EAAQzU,UAAUlC,OAAQ4W,EAAyB,IAAI3X,MAAM0X,EAAQ,EAAIA,EAAQ,EAAI,GAAIE,EAAQ,EAAGA,EAAQF,EAAOE,IAC1HD,EAAuBC,EAAQ,GAAK3U,UAAU2U,GAGhD,IACIC,EADAC,EAAapY,EAA2B6J,GAG5C,IACEwO,EAAO,IAAKD,EAAW5W,MAAO2W,EAASC,EAAW1X,KAAKe,MAAO,CAC5D,IAGI6W,EAHA5W,EAAQyW,EAAOzW,MAEf6W,EAAavY,EAA2BiY,GAG5C,IACE,IAAKM,EAAW/W,MAAO8W,EAASC,EAAW7X,KAAKe,MAAO,CACrD,IAAI+W,EAAWF,EAAO5W,MAEtB,GAAI8W,EAASpK,IAAI1M,GACf,SAAS2W,GAGb,MAAOtW,GACPwW,EAAW5W,EAAEI,GACb,QACAwW,EAAW1W,IAGbiW,EAAIW,IAAI/W,IAEV,MAAOK,GACPqW,EAAWzW,EAAEI,GACb,QACAqW,EAAWvW,IAGb,OAAOiW,GA4BT,IAAIY,GARJ,SAAgB7R,EAAK0F,GACnB,IAAI/H,EAAS,IAAIoF,IAIjB,OAHA/C,EAAIpD,SAAQ,SAAU/B,EAAOgC,GAC3Bc,EAAOqF,IAAInG,EAAK6I,EAAS7K,EAAOgC,OAE3Bc,GAyBT,SAASmU,GAAmBjV,EAAKkV,EAASC,EAE1CC,GACE,IAAIC,EAAWF,EAAME,SACjBC,EAA0BH,EAAMG,wBAChCC,EAAUF,EAAS9O,IAAIvG,GAE3B,IAAIuV,IAAWH,GAAcG,IAAYH,EAAWC,SAAS9O,IAAIvG,GAAjE,CAKAqV,EAASlP,IAAInG,EAAKkV,GAElB,IAGIM,EADAC,EAAanZ,EAFU,MAAXiZ,EAAkBL,EAAUf,GAAsBe,EAASK,IAK3E,IACE,IAAKE,EAAW3X,MAAO0X,EAASC,EAAWzY,KAAKe,MAAO,CACrD,IAAI2X,EAAOF,EAAOxX,MAEbsX,EAAwB5K,IAAIgL,IAC/BJ,EAAwBnP,IAAIuP,EAAM,IAAIrB,KAGxBzS,EAAkB0T,EAAwB/O,IAAImP,IAEpDX,IAAI/U,IAGhB,MAAO3B,GACPoX,EAAWxX,EAAEI,GACb,QACAoX,EAAWtX,IAGb,GAAIoX,EAAS,CACX,IAGII,EADAC,EAAatZ,EAFC6X,GAAsBoB,EAASL,IAKjD,IACE,IAAKU,EAAW9X,MAAO6X,EAASC,EAAW5Y,KAAKe,MAAO,CACrD,IAAI8X,EAAMF,EAAO3X,MAEjB,IAAKsX,EAAwB5K,IAAImL,GAC/B,OAGF,IAAIlC,EAAW/R,EAAkB0T,EAAwB/O,IAAIsP,IAC7DlC,EAASvI,OAAOpL,GAEM,IAAlB2T,EAASrF,MACXgH,EAAwBlK,OAAOyK,IAGnC,MAAOxX,GACPuX,EAAW3X,EAAEI,GACb,QACAuX,EAAWzX,OAqCjB,IAAI2X,GAhHJ,SAAoBX,GAClB,MAAO,CACLE,SAAUL,GAAcG,EAAME,UAAU,SAAUvX,GAChD,OAAO,IAAIuW,IAAIvW,MAEjBwX,wBAAyBN,GAAcG,EAAMG,yBAAyB,SAAUxX,GAC9E,OAAO,IAAIuW,IAAIvW,QA0GjBgY,GAvHJ,WACE,MAAO,CACLT,SAAU,IAAInP,IACdoP,wBAAyB,IAAIpP,MAoH7B4P,GAhCJ,SAAyB9V,EAAK+V,EAAMC,EAAOC,GACzC,IAAIC,EAAsBC,EAAuBC,EAAwBC,EAErEC,EAAaN,EAAMO,WAEjBN,IAAYK,EAAWE,YAAYP,SAAWA,KAA8D,QAAhDC,EAAuBI,EAAWG,gBAA+C,IAAzBP,OAAkC,EAASA,EAAqBD,UAAYA,KAAmE,QAArDE,EAAwBG,EAAWI,oBAAoD,IAA1BP,OAAmC,EAASA,EAAsBF,UACjVvM,GAA4B,kDAK9B,IAAIyL,EAAQa,EAAMW,SAASV,GAS3B,GARAhB,GAAmBjV,EAAK+V,EAAMZ,GAG1Bc,KAAoE,QAAtDG,EAAyBE,EAAWI,oBAAqD,IAA3BN,OAAoC,EAASA,EAAuBH,UAElJhB,GAAmBjV,EAAK+V,EADLC,EAAMW,SAASL,EAAWE,YAAYP,SACbd,GAG1Cc,KAAoE,QAAtDI,EAAyBC,EAAWI,oBAAqD,IAA3BL,OAAoC,EAASA,EAAuBJ,UAAYA,IAAYK,EAAWE,YAAYP,QAAS,CAC1M,IAAIW,EAEAC,EAAgE,QAAjDD,EAAwBN,EAAWG,gBAAgD,IAA1BG,OAAmC,EAASA,EAAsBX,QAE9I,QAAoB3U,IAAhBuV,EAEF5B,GAAmBjV,EAAK+V,EADRC,EAAMW,SAASE,GACU1B,KAqB3C2B,GAAuB,EAMvBC,GAAc,EAMdC,GAAkB,EAMlBC,GAhB0B,WAC5B,OAAOH,MAeLG,GAViB,WACnB,OAAOF,MASLE,GAJqB,WACvB,OAAOD,MAQLE,GA1PsCja,OAAOkH,OAAO,CACtD6B,UAAW,KACX4N,cAAeM,KAwP4BN,cACzCuB,GAAQW,GACRqB,GAA4BF,GAEhC,SAASG,KACP,IAAInB,EAAUkB,KACd,MAAO,CACLlB,QAASA,EACToB,QAASpB,EACTqB,oBAAqB,GACrBC,WAAY,IAAIlD,IAChBmD,WAAYN,KACZO,kBAAmBP,MA4BvB,IAAIQ,GAAe,CACjBN,mBAAoBA,GACpBO,oBA1BF,WACE,IAAInB,EAAcY,KAClB,MAAO,CACLZ,YAAaA,EACbC,SAAU,KACVC,aAAc,KACdkB,YAAa,EACbC,WAAY,IAAIxD,IAChByD,eAAgB,IAAIzD,IACpB0D,yBAA0B,IAAI7R,IAC9B8R,6BAA8B,IAAI9R,IAClC+R,6BAA8B,IAAI/R,IAClCgS,oCAAqC,GACrCC,4BAA6B,IAAI9D,IACjC+D,iBAAiB,IAAIlS,KAAMC,IAAIqQ,EAAYP,QAASd,MACpDkD,UAAW,CACTC,gBAAiB,IAAIpS,IACrBqS,oBAAqB,IAAIrS,IACzBsS,6BAA8B,IAAInE,KAEpCoE,qBAAsB,IAAIvS,MAO5BwS,wBAAyBvB,IAavBwB,GAAgB,SAASA,KAC3B,OAAgB1X,KAAM0X,IAOxB,IAAIC,GACaD,GADbC,GAJJ,WACE,OAAO,IAAID,IA0Db,IAAIE,GAtCJ,SAA0B1S,EAAKiH,GAC7B,IAAI3O,EAAO,IAAI4V,IAAIlO,GAEnB,OADA1H,EAAKsW,IAAI3H,GACF3O,GA2DT,SAAStC,GAAeyM,EAAUkQ,GAChC,IAAI/P,EAAOgQ,EAAYC,EAAQhb,EAE/B,OAAO,UAAyB,SAAyBib,GACvD,OACE,OAAQA,EAAU9P,KAAO8P,EAAUxa,MACjC,KAAK,EAEHsK,EAAQ,EACRgQ,EAAazc,EAA2BsM,GACxCqQ,EAAU9P,KAAO,EAEjB4P,EAAWjb,IAEb,KAAK,EACH,IAAKkb,EAASD,EAAW/b,KAAKe,KAAM,CAClCkb,EAAUxa,KAAO,GACjB,MAKF,GAFAT,EAAQgb,EAAOhb,OAEV8a,EAAU9a,EAAO+K,KAAU,CAC9BkQ,EAAUxa,KAAO,EACjB,MAIF,OADAwa,EAAUxa,KAAO,EACVT,EAET,KAAK,EACHib,EAAUxa,KAAO,EACjB,MAEF,KAAK,GACHwa,EAAUxa,KAAO,GACjB,MAEF,KAAK,GACHwa,EAAU9P,KAAO,GACjB8P,EAAU7P,GAAK6P,EAAiB,MAAE,GAElCF,EAAW9a,EAAEgb,EAAU7P,IAEzB,KAAK,GAKH,OAJA6P,EAAU9P,KAAO,GAEjB4P,EAAW5a,IAEJ8a,EAAU5P,OAAO,IAE1B,KAAK,GACL,IAAK,MACH,OAAO4P,EAAU3P,UAGtBpN,EAAS,KAAM,CAAC,CAAC,EAAG,GAAI,GAAI,MAGjC,IAAIgd,GAAwB/c,GA0C5B,IAAIgd,GAnBJ,SAAmBC,EAAMC,GAgBvB,OAfY,IAAI3Y,MAAM0Y,EAAM,CAE1B7S,IAAK,SAAa3G,EAAQ0Z,GAKxB,QAJMA,KAAQ1Z,IAAW0Z,KAAQD,IAC/BzZ,EAAO0Z,GAAQD,EAAUC,MAGpB1Z,EAAO0Z,IAGhBva,QAAS,SAAiBa,GACxB,OAAO3C,OAAOiC,KAAKU,OAQrB2Z,GAAYhP,GAAYO,QACxB0O,GAAiBjP,GAAYQ,aAC7B0O,GAAwBlP,GAAYgB,oBACpCmO,GAAkBd,GAClBe,GAAqBd,GAErBe,GAAW3c,OAAOkH,OAAO,IAAIkQ,KAE7BwF,GAAwC,SAAUC,IACpD,OAAUD,EAA0BC,GAEpC,IAAIC,EAAU3Z,EAAayZ,GAE3B,SAASA,IAGP,OAFA,OAAgB5Y,KAAM4Y,GAEfE,EAAQra,MAAMuB,KAAMpB,WAG7B,OAAOga,EAXmC,EAY5B,OAAiBxY,QA4EjC,SAAS2Y,GAA2BhE,EAAOiE,EAAWja,EAAKka,GACzD,IAAI5D,EAAaN,EAAMO,WAEvB,IAAID,EAAWmC,qBAAqB/N,IAAI1K,GAAxC,CAIA,IAAIyK,EAAO8O,GAAUvZ,GACjBma,EAlFN,SAAoCnE,EAAOoE,EAASC,GAClD,IAAKvT,GAAW,iCACd,OAAO,aAKT,IAAIyR,EAAsBvC,EAAMO,WAAW8B,UAAUE,oBAErD,SAAS+B,EAAUC,GACjB,IAAIpU,EAAMoS,EAAoBhS,IAAIgU,GAE7BpU,GACHoS,EAAoBpS,IAAIoU,EAAMpU,EAAM,IAAIkO,KAG1ClO,EAAI4O,IAAIqF,GAGV,GAAIC,aAAsBX,GACxBY,EAAUD,QACL,GAAIzd,MAAMC,QAAQwd,GAAa,CACpC,IACIG,EADAC,EAAane,EAA2B+d,GAG5C,IACE,IAAKI,EAAW3c,MAAO0c,EAASC,EAAWzd,KAAKe,MAE9Cuc,EADWE,EAAOxc,OAGpB,MAAOK,GACPoc,EAAWxc,EAAEI,GACb,QACAoc,EAAWtc,KAIf,OAAO,WACL,GAAK2I,GAAW,iCAAhB,CAIA,IACIuR,EADmBrC,EAAMO,WACI8B,UAWjC,GAAIgC,aAAsBX,GACxBgB,EAAeL,QACV,GAAIzd,MAAMC,QAAQwd,GAAa,CACpC,IACIM,EADAC,EAAate,EAA2B+d,GAG5C,IACE,IAAKO,EAAW9c,MAAO6c,EAASC,EAAW5d,KAAKe,MAE9C2c,EADYC,EAAO3c,OAGrB,MAAOK,GACPuc,EAAW3c,EAAEI,GACb,QACAuc,EAAWzc,MAvBf,SAASuc,EAAeH,GACtB,IAAIpU,EAAMkS,EAAUE,oBAAoBhS,IAAIgU,GAC5CpU,MAAAA,GAA0CA,EAAIiF,OAAOgP,GAEjDjU,GAAoB,IAAbA,EAAImI,MACb+J,EAAUE,oBAAoBnN,OAAOmP,KAgCpBM,CAA2B7E,EAAOhW,EAAKyK,EAAK4P,YAC/DS,EAAcrQ,EAAKsQ,KAAK/E,EAAOiE,EAAWC,GAC9C5D,EAAWmC,qBAAqBtS,IAAInG,GAAK,WACvC8a,IACAX,QAyBJ,SAASa,GAAiBhF,EAAO5T,EAAOpC,GACtC,OAAOuZ,GAAUvZ,GAAKib,KAAKjF,EAAO5T,GAkFpC,SAAS8Y,GAAmBlF,EAAO5T,EAAOlD,GAKxC,IAJA,IAAIic,EAAe,IAAI9G,IACnB+G,EAAgBxe,MAAMY,KAAK0B,GAC3BiW,EAAQa,EAAMW,SAASvU,EAAM6T,SAExBjW,EAAMob,EAAc5H,MAAOxT,EAAKA,EAAMob,EAAc5H,MAAO,CAClE,IAAI6H,EAEJF,EAAapG,IAAI/U,GACjB,IAGIsb,EADAC,EAAcjf,EAFyE,QAApE+e,EAAwBlG,EAAMG,wBAAwB/O,IAAIvG,UAA4C,IAA1Bqb,EAAmCA,EAAwBzB,IAK9J,IACE,IAAK2B,EAAYzd,MAAOwd,EAAUC,EAAYve,KAAKe,MAAO,CACxD,IAAIyd,EAAiBF,EAAQtd,MAExBmd,EAAazQ,IAAI8Q,IACpBJ,EAAc3b,KAAK+b,IAGvB,MAAOnd,GACPkd,EAAYtd,EAAEI,GACd,QACAkd,EAAYpd,KAIhB,OAAOgd,EAGT,IAAIM,GAzHJ,SAAyBzF,EAAO5T,EAAOpC,GAErC,OADAga,GAA2BhE,EAAO5T,EAAOpC,EAAK,OACvCuZ,GAAUvZ,GAAKuG,IAAIyP,EAAO5T,IAuH/BqZ,GAEgBT,GAFhBS,GA9FJ,SAAsBzF,EAAO5T,EAAOpC,EAAKsP,GACvC,IAAI7E,EAAO8O,GAAUvZ,GAErB,GAAgB,MAAZyK,EAAKtE,IACP,MAAM,IAAI0T,GAAyB,yCAAyC1X,OAAOnC,IAGrF,IAAImG,EAAMsE,EAAKtE,IAGf,OADA6T,GAA2BhE,EAAO5T,EAAOpC,EAAK,OACvCmG,EAAI6P,EAAO5T,EAAOkN,IAoFvBmM,GAxIJ,SAAwBzF,EAAOhW,EAAKka,GAClCF,GAA2BhE,EAAOA,EAAMO,WAAWC,YAAaxW,EAAKka,IAuInEuB,GApIJ,SAAqBzF,EAAOhW,GAC1B,IAAI0b,EAEAtZ,EAAQ4T,EAAMO,WACgD,QAAjEmF,EAAwBtZ,EAAMqW,qBAAqBlS,IAAIvG,UAA4C,IAA1B0b,GAA4CA,IACtHtZ,EAAMqW,qBAAqBrN,OAAOpL,IA+HhCyb,GA7GJ,SAA4CrZ,EAAOpC,EAAKsP,GACtD,IAAIqM,EAEAlR,EAAO+O,GAAexZ,GAE1B,OADAyK,MAAAA,GAAqF,QAAxCkR,EAAmBlR,EAAKmR,kBAA6C,IAArBD,GAAuCA,EAAiBve,KAAKqN,EAAMrI,GACzJzC,EAAcA,EAAc,GAAIyC,GAAQ,GAAI,CACjDoV,WAAYpV,EAAMoV,WAAWqE,QAAQzQ,OAAOpL,GAC5CyX,kBAAmBrV,EAAMqV,kBAAkBoE,QAAQ1V,IAAInG,EAAKsP,GAC5DiI,WAAYoC,GAAmBvX,EAAMmV,WAAYvX,MAqGjDyb,GAjFJ,SAAsBzF,EAAO5T,EAAOpC,GAClC,IAAIsW,EAAaN,EAAMO,WACnBpB,EAAQa,EAAMW,SAASvU,EAAM6T,SAC7BzJ,EAAO+M,GAAUvZ,GAAK8b,SAC1B,OAAO3C,GAAiB,CACtB3M,KAAMA,GACL,CACDuP,SAAU,WACR,OAAOf,GAAiBhF,EAAO5T,EAAOpC,IAExCgc,SAAU,WACR,OAAO1F,EAAWuB,WAAWnN,IAAI1K,IAAQsW,EAAWwB,eAAepN,IAAI1K,IAEzEic,MAAO,WACL,MAAgB,aAATzP,GAA8BpK,EAAMoV,WAAW9M,IAAI1K,IAE5Dkc,WAAY,WACV,OAAO9Z,EAAMmV,WAAW7M,IAAI1K,IAI9B+V,KAAM,WACJ,IAAIoG,EAEJ,OAAO1C,GAA0E,QAAnD0C,EAAsBhH,EAAME,SAAS9O,IAAIvG,UAA0C,IAAxBmc,EAAiCA,EAAsB,KAIlJC,YAAa,WACX,IAAIC,EAAuBC,EAE3B,MAAO,CACLtS,MAAOyP,GAAsBP,GAAsBgC,GAAmBlF,EAAO5T,EAAO,IAAIiS,IAAI,CAACrU,MAAQ,SAAUoa,GAC7G,OAAOA,IAAYpa,MAErBuc,WAAY5T,GAAsN,QAAlM0T,EAAwG,QAA/EC,EAAyBhG,EAAW2B,6BAA6B1R,IAAIvG,UAA6C,IAA3Bsc,OAAoC,EAASA,EAAuBnJ,gBAAgD,IAA1BkJ,EAAmCA,EAAwB,IAAI,SAAUG,GAIjT,MAAO,CACLjf,MAJU,OAAeif,EAAO,GACjB,YA4CvBf,GAQkBP,GAalBuB,GAA8B,KAYlC,IAAIC,GAVJ,SAAuCd,GACrCa,GAA8Bb,GAS5Bc,GANJ,WACE,IAAIC,EAEsD,QAAzDA,EAAwBF,UAAmE,IAA1BE,GAA4CA,KAO5GC,GAAuBnB,GACvBoB,GAAoBpB,GACpBqB,GAAiBrB,GACjBsB,GAAuB9F,GACvB+F,GAAYzS,GAAYO,QACxBmS,GAAiB1S,GAAYQ,aAC7BmS,GAAiB3S,GAAYZ,aAC7BwT,GAAwB5S,GAAYV,oBACpCuT,GAAclW,GAAiBC,UAC/BkW,GAAwB7U,GAAqBd,oBAC7C4V,GAAgB9U,GAAqBZ,YACrC2V,GAAwB/U,GAAqBT,oBAC7CyV,GAAkBhV,GAAqBL,cACvCsV,GAA+Bf,GAiEnC,SAASgB,GAAY1H,EAAO5T,EAAOub,GACjC,GAAoB,QAAhBA,EAAOnR,KAAgB,CACzB,IAMIoR,EANA/S,EAAc8S,EAAO9S,YAErByE,EA1BR,SAAiC0G,EAAO5T,EAAOyb,EAAOC,GACpD,IAAI9d,EAAM6d,EAAM7d,IAEhB,GAA8B,mBAAnB8d,EAA+B,CAIxC,IAAInO,EAAUkN,GAAkB7G,EAAO5T,EAAOpC,GAE9C,GAAsB,YAAlB2P,EAAQvN,MACV,MAAM,IAAI+a,GAAsBnd,GAC3B,GAAsB,aAAlB2P,EAAQvN,MACjB,MAAMuN,EAAQrN,SAIhB,OAAOwb,EAAenO,EAAQrN,UAE9B,OAAOwb,EAQQC,CAAwB/H,EAAO5T,EAAOyI,EADhC8S,EAAOG,gBAIxBE,EAAc1hB,EAFLwgB,GAAe9G,EAAO5T,EAAOyI,EAAY7K,IAAKsP,GAEP0D,WAGpD,IACE,IAAKgL,EAAYlgB,MAAO8f,EAAUI,EAAYhhB,KAAKe,MAAO,CACxD,IAAIkgB,GAAgB,OAAeL,EAAQ5f,MAAO,GAIlDkgB,GAAyB9b,EAHf6b,EAAc,GACTA,EAAc,KAI/B,MAAO5f,GACP2f,EAAY/f,EAAEI,GACd,QACA2f,EAAY7f,UAET,GAAoB,gBAAhBwf,EAAOnR,KAAwB,CAGxC0R,GAAyB9b,EAFbub,EAAO9S,YAAY7K,IACf2d,EAAO5B,eAElB,GAAoB,iBAAhB4B,EAAOnR,KAAyB,CACzC,IAAI2R,EAAQR,EAAO9S,YAAY7K,IAC/BoC,EAAMmV,WAAWxC,IAAIoJ,QAChB,GAAoB,mBAAhBR,EAAOnR,KAA2B,CAC3C,IAAImP,EAIAyC,EAAQT,EAAO9S,YAAY7K,IAC3Bqe,EAAmBV,EAAOU,iBAC1B5T,EAAOwS,GAAemB,GAC1B3T,MAAAA,GAAqF,QAAxCkR,EAAmBlR,EAAKmR,kBAA6C,IAArBD,GAAuCA,EAAiBve,KAAKqN,EAAMrI,GAChKA,EAAMoV,WAAWpM,OAAOgT,GACxBhc,EAAMqV,kBAAkBtR,IAAIiY,EAAOC,GACnCjc,EAAMmV,WAAWxC,IAAIqJ,QAErB1U,GAA4B,kBAAkBvH,OAAOwb,EAAOnR,OAIhE,SAAS0R,GAAyB9b,EAAOpC,EAAK+b,GACrB,aAAnBA,EAAS3Z,OAAwB2Z,EAASzZ,oBAAoB4a,GAChE9a,EAAMoV,WAAWpM,OAAOpL,GAExBoC,EAAMoV,WAAWrR,IAAInG,EAAK+b,GAG5B3Z,EAAMmV,WAAWxC,IAAI/U,GACrBoC,EAAMqV,kBAAkBrM,OAAOpL,GAGjC,SAASse,GAAoBtI,EAAOuI,GAClCvI,EAAMwI,cAAa,SAAUpc,GAC3B,IAGIqc,EAHAC,EAAWC,GAAcvc,GAEzBwc,EAActiB,EAA2BiiB,GAG7C,IACE,IAAKK,EAAY9gB,MAAO2gB,EAAUG,EAAY5hB,KAAKe,MAAO,CACxD,IAAI4f,EAASc,EAAQzgB,MACrB0f,GAAY1H,EAAO0I,EAAUf,IAE/B,MAAOtf,GACPugB,EAAY3gB,EAAEI,GACd,QACAugB,EAAYzgB,IAKd,OAFA0gB,GAAsB7I,EAAO0I,GAC7BjB,KACOiB,KAIX,SAASI,GAA0B9I,EAAO2H,GACxC,GAAIoB,GAAWphB,OAAQ,CACrB,IAAIqhB,EAAiBD,GAAWA,GAAWphB,OAAS,GAChD4gB,EAAUS,EAAezY,IAAIyP,GAE5BuI,GACHS,EAAe7Y,IAAI6P,EAAOuI,EAAU,IAGtCA,EAAQ9e,KAAKke,QAEbW,GAAoBtI,EAAO,CAAC2H,IAIhC,IAAIoB,GAAa,GA+BjB,SAASJ,GAAcvc,GACrB,OAAOzC,EAAcA,EAAc,GAAIyC,GAAQ,GAAI,CACjDoV,WAAYpV,EAAMoV,WAAWqE,QAC7BpE,kBAAmBrV,EAAMqV,kBAAkBoE,QAC3CtE,WAAY,IAAIlD,IAAIjS,EAAMmV,cAI9B,SAASsH,GAAsB7I,EAAO5T,GAGpC,IAGI6c,EADAC,EAAc5iB,EAFAsgB,GAAqB5G,EAAO5T,EAAOA,EAAMmV,aAK3D,IACE,IAAK2H,EAAYphB,MAAOmhB,EAAUC,EAAYliB,KAAKe,MAAO,CACxD,IAEIohB,EAAeC,EAFfpf,EAAMif,EAAQjhB,MAIwB,QAAzCmhB,EAAgBlC,GAAejd,UAAoC,IAAlBmf,GAA2F,QAAtDC,EAAwBD,EAAcvD,kBAAkD,IAA1BwD,GAA4CA,EAAsBhiB,KAAK+hB,EAAe/c,IAE7O,MAAO/D,GACP6gB,EAAYjhB,EAAEI,GACd,QACA6gB,EAAY/gB,KAIhB,SAASkhB,GAAerJ,EAAOnL,EAAaiT,GAC1CgB,GAA0B9I,EAAO,CAC/BxJ,KAAM,MACN3B,YAAaA,EACbiT,eAAgBA,IAmFpB,IAAIwB,GAA8B,CAChCvX,oBAAqBwV,GACrB7V,oBAAqB2V,GACrBzV,YAAa0V,GACbiC,yBAzTF,SAAkCvJ,EAAOwJ,GACvC,IAGItJ,EAAsBC,EAHtBnW,EAAMwf,EAAMxf,IACZia,EAAYpa,UAAUlC,OAAS,QAAsB2D,IAAjBzB,UAAU,GAAmBA,UAAU,GAAKmW,EAAMO,WAAWC,YAMjGF,EAAaN,EAAMO,WAEjB0D,EAAUhE,UAAYK,EAAWE,YAAYP,SAAWgE,EAAUhE,WAA8D,QAAhDC,EAAuBI,EAAWG,gBAA+C,IAAzBP,OAAkC,EAASA,EAAqBD,UAAYgE,EAAUhE,WAAmE,QAArDE,EAAwBG,EAAWI,oBAAoD,IAA1BP,OAAmC,EAASA,EAAsBF,UAC/WvM,GAA4B,uCAG9B,IAAIqS,EAAWc,GAAkB7G,EAAOiE,EAAWja,GAYnD,MAVuB,YAAnB+b,EAAS3Z,OACX2Z,EAASzZ,SAAS4B,OAAM,eASnB6X,GAgSPsD,eAAgBA,GAChBI,uBArFF,SAAgCzJ,EAAOnL,EAAakR,GAClD,GAAIA,aAAoBmB,GACtB,OAAOmC,GAAerJ,EAAOnL,EAAakR,GAG5C+C,GAA0B9I,EAAO,CAC/BxJ,KAAM,cACN3B,YAAaA,EACbkR,SAAUA,KA8EZ2D,wBA1EF,SAAiC1J,EAAOnL,GACtCiU,GAA0B9I,EAAO,CAC/BxJ,KAAM,eACN3B,YAAaA,KAwEf8U,0BApEF,SAAmC3J,EAAOnL,EAAawT,GACrDS,GAA0B9I,EAAO,CAC/BxJ,KAAM,iBACN3B,YAAaA,EACbwT,iBAAkBA,KAiEpBuB,uBA7DF,SAAgC5J,EAAO6J,EAAOhX,GAC5C,IAAI7I,EAAM6f,EAAM7f,IACZ8f,EAAqBjgB,UAAUlC,OAAS,QAAsB2D,IAAjBzB,UAAU,GAAmBA,UAAU,GAAK,KACzFkgB,EAAQhD,KACRzG,EAAaN,EAAMO,WAElBD,EAAW2B,6BAA6BvN,IAAI1K,IAC/CsW,EAAW2B,6BAA6B9R,IAAInG,EAAK,IAAIkG,KAGvDtE,EAAkB0U,EAAW2B,6BAA6B1R,IAAIvG,IAAMmG,IAAI4Z,EAAO,CAACD,MAAAA,EAA+DA,EAAqB,iBAAkBjX,IAGtL,IAAIzB,EAAOgW,KAEX,GAAIhW,EAAKC,QAAwB,WAAdD,EAAKA,MAAmC,mBAAdA,EAAKA,MAA4B,CAC5E,IAAIqP,EAAWT,EAAMO,WAAWE,SAE5BA,GAAYA,EAASc,WAAW7M,IAAI1K,IACtC6I,EAAS4N,GAIb,MAAO,CACLuJ,QAAS,WACP,IAAIC,EAAoBjK,EAAMO,WAC1B2J,EAAOD,EAAkBhI,6BAA6B1R,IAAIvG,QAEjDsB,IAAT4e,GAAuBA,EAAKxV,IAAIqV,IAKpCG,EAAK9U,OAAO2U,GAEM,IAAdG,EAAK5R,MACP2R,EAAkBhI,6BAA6B7M,OAAOpL,IAPtD0J,GAA4B,iDAAiDvH,OAAOnC,EAAK,kCAiC/FmI,cAAeqV,GACf2C,qBAnSF,SAA8B3I,EAAY4I,GACxC,IAAItf,EAAS0W,EAAWqE,QAQxB,OAPAuE,EAAOrgB,SAAQ,SAAUqN,EAAG6B,GACV,aAAZ7B,EAAEhL,OAAwBgL,EAAE9K,oBAAoB4a,GAClDpc,EAAOsK,OAAO6D,GAEdnO,EAAOqF,IAAI8I,EAAG7B,MAGXtM,GA4RPuf,WAhKF,WACE,IAAIrB,EAAiB,IAAI9Y,IAEzB,OADA6Y,GAAWtf,KAAKuf,GACT,WACL,IACIsB,EADAC,EAAcjkB,EAA2B0iB,GAG7C,IACE,IAAKuB,EAAYziB,MAAOwiB,EAAUC,EAAYvjB,KAAKe,MAAO,CACxD,IAAIyiB,GAAgB,OAAeF,EAAQtiB,MAAO,GAIlDsgB,GAHYkC,EAAc,GACZA,EAAc,KAI9B,MAAOniB,GACPkiB,EAAYtiB,EAAEI,GACd,QACAkiB,EAAYpiB,IAGD4gB,GAAWvL,QAETwL,GACbtV,GAA4B,sCAyIhCwU,yBAA0BA,GAC1BW,sBAAuBA,GACvBF,cAAeA,GACf8B,mBA3BF,SAA4BzK,EAAOnL,GACjC,IAAI6V,EAGAlK,EADmBR,EAAMO,WACMC,YAE/B/L,EAAOuS,GAAUnS,EAAY7K,KACQ,QAAxC0gB,EAAmBjW,EAAKkW,kBAA6C,IAArBD,GAAuCA,EAAiBtjB,KAAKqN,EAAMuL,EAAOQ,KAuD7H,IAAIoK,GAjBJ,SAAiBza,EAAK0C,EAAUgY,GAI9B,IAHA,IAAIlkB,EAAWwJ,EAAI6M,UACfrD,EAAUhT,EAAS8B,QAEfkR,EAAQ5R,MAAM,CACpB,IAAI+iB,EAAQnR,EAAQ3R,MAEpB,GAAI6K,EAASzL,KAAKyjB,EAASC,EAAM,GAAIA,EAAM,GAAI3a,GAC7C,OAAO,EAGTwJ,EAAUhT,EAAS8B,OAGrB,OAAO,GAILsiB,GAAgBtF,GAChBuF,GAA+BzW,GAAYS,2BAC3CiW,GAAY1W,GAAYO,QACxBoW,GAAkBtI,GAIlBuI,GAAa,IAAI9M,IAErB,SAAS+M,GAAmCpL,EAAOqL,GACjD,IAAI/K,EAAaN,EAAMO,WACnB0D,EAAY3D,EAAWE,YAE3B,GAAIF,EAAWG,SACb/M,GAA4B,gFAD9B,CAKA,IAGI4X,EAHAtX,EAAQ,IAAIqK,IAEZkN,EAAcjlB,EAA2B+kB,GAG7C,IACE,IAAKE,EAAYzjB,MAAOwjB,EAAUC,EAAYvkB,KAAKe,MAAO,CACxD,IAAIyjB,EAAIF,EAAQtjB,MAEhB,GAAIwjB,aAAaN,GAAiB,CAChC,IACIO,EADAC,EAAcplB,EAA2Bic,GAAoBjC,EAAYkL,IAG7E,IACE,IAAKE,EAAY5jB,MAAO2jB,EAAUC,EAAY1kB,KAAKe,MAAO,CACxD,IAAIf,EAAIykB,EAAQzjB,MAChBgM,EAAM+K,IAAI/X,IAEZ,MAAOqB,GACPqjB,EAAYzjB,EAAEI,GACd,QACAqjB,EAAYvjB,UAGd6L,EAAM+K,IAAIyM,IAGd,MAAOnjB,GACPkjB,EAAYtjB,EAAEI,GACd,QACAkjB,EAAYpjB,IAGd,IAGIwjB,EAHAC,EAiBN,SAA6B5L,EAAO6L,GAClC,IAAIvL,EAAaN,EAAMO,WACnB0D,EAAY3D,EAAWE,YACvBrB,EAAQa,EAAMW,SAASsD,EAAUhE,SACjC2L,EAAkB,IAAIvN,IAEtByN,EAAqB,IAAIzN,IAE7B,OADA0N,EAAyBF,GAClBD,EAEP,SAASG,EAAyBF,GAChC,IAMIG,EANAC,EAAoC,IAAI5N,IACxC6N,EAgGR,SAA8ClM,EAAOiE,EAAWjQ,EAChEmY,EAAmBC,GACjB,IAAIjN,EAAQa,EAAMW,SAASsD,EAAUhE,SACjCoM,EAAS,GACTC,EAAU,IAAIjO,IAElB,KAAOrK,EAAMsE,KAAO,GAClBwE,EAAMlR,EAAkBoI,EAAMmJ,SAAS1U,OAAOT,QAGhD,OAAOqkB,EAEP,SAASvP,EAAMrI,GACb,GAAI0X,EAAkBzX,IAAID,IAAS2X,EAAkB1X,IAAID,GACvDT,EAAMoB,OAAOX,QAIf,IAAI6X,EAAQ5X,IAAID,GAAhB,CAIA,IAAIuD,EAAWmH,EAAMG,wBAAwB/O,IAAIkE,GAEjD,GAAIuD,EAAU,CACZ,IACIuU,EADAC,EAAclmB,EAA2B0R,GAG7C,IACE,IAAKwU,EAAY1kB,MAAOykB,EAAUC,EAAYxlB,KAAKe,MAAO,CAExD+U,EADYyP,EAAQvkB,QAGtB,MAAOK,GACPmkB,EAAYvkB,EAAEI,GACd,QACAmkB,EAAYrkB,KAIhBmkB,EAAQvN,IAAItK,GACZT,EAAMoB,OAAOX,GACb4X,EAAO5iB,KAAKgL,KA1IMgY,CAAqCzM,EAAOiE,EAAW4H,EAAiBD,EAC1FE,GAGIY,EAAcpmB,EAA2B4lB,GAG7C,IACE,IAAKQ,EAAY5kB,MAAOkkB,EAAUU,EAAY1lB,KAAKe,MAAO,CACxD,IAEI4kB,EAFAlY,EAAOuX,EAAQhkB,MAKnB,GAAmC,eAA/BijB,GAAUxW,GAAM4P,WAMpB,IAAkF,QAA5EsI,EAAwBrM,EAAW+B,UAAUC,gBAAgB/R,IAAIkE,UAA6C,IAA1BkY,EAAmCA,EAAwB,GAAK,EACxJb,EAAmB/M,IAAItK,QAKzB,GAAImY,GAAyBnY,GAAMhG,MAAK,SAAU4O,GAChD,OAAOiD,EAAW+B,UAAUC,gBAAgB/R,IAAI8M,MAEhDyO,EAAmB/M,IAAItK,OAHzB,CASA,IAAIoY,EAAe1N,EAAMG,wBAAwB/O,IAAIkE,GAEjDoY,GAAgBjC,GAAeiC,GAAc,SAAUzT,GACzD,OAAO0S,EAAmBpX,IAAI0E,MAE9B0S,EAAmB/M,IAAItK,IAIzBmX,EAAgB7M,IAAItK,GACpBwX,EAAkClN,IAAItK,SA9BpCqX,EAAmB/M,IAAItK,IAkC3B,MAAOpM,GACPqkB,EAAYzkB,EAAEI,GACd,QACAqkB,EAAYvkB,IAGd,IAGI2kB,EAHAC,EAAU,IAAI1O,IAEd2O,EAAc1mB,EAA2B2lB,GAG7C,IACE,IAAKe,EAAYllB,MAAOglB,EAAUE,EAAYhmB,KAAKe,MAAO,CACxD,IAGIklB,EAHAC,EAASJ,EAAQ9kB,MAEjBmlB,EAAc7mB,EAAkF,QAAtD6f,EAAsBhH,EAAME,SAAS9O,IAAI2c,UAA6C,IAAxB/G,EAAiCA,EAAsBgF,IAGnK,IACE,IAAKgC,EAAYrlB,MAAOmlB,EAAUE,EAAYnmB,KAAKe,MAAO,CACxD,IAEIoe,EAFAiH,EAASH,EAAQjlB,MAIhB4jB,EAAgBlX,IAAI0Y,IACvBL,EAAQhO,IAAIqO,IAGhB,MAAO/kB,GACP8kB,EAAYllB,EAAEI,GACd,QACA8kB,EAAYhlB,MAGhB,MAAOE,GACP2kB,EAAY/kB,EAAEI,GACd,QACA2kB,EAAY7kB,IAGV4kB,EAAQzU,MACVyT,EAAyBgB,IAvHPM,CAAoBrN,EAAOhM,GAE7CsZ,EAAchnB,EAA2BslB,GAG7C,IACE,IAAK0B,EAAYxlB,MAAO6jB,EAAU2B,EAAYtmB,KAAKe,MAAO,CAExDwlB,GAAYvN,EAAOiE,EADR0H,EAAQ3jB,QAGrB,MAAOK,GACPilB,EAAYrlB,EAAEI,GACd,QACAilB,EAAYnlB,MA8JhB,SAASolB,GAAYvN,EAAOiE,EAAWxP,GACrC,GAAK3D,GAAW,iCAAhB,CAKAia,GAAc/K,EAAOvL,GAErB,IAAI6L,EAAaN,EAAMO,WACvBD,EAAWuB,WAAWzM,OAAOX,GAC7B6L,EAAWwB,eAAe1M,OAAOX,GACjC6L,EAAW0B,6BAA6B5M,OAAOX,GAC/C6L,EAAW+B,UAAUC,gBAAgBlN,OAAOX,GAC5C,IAGI+Y,EADAC,EAAcnnB,EAFNsmB,GAAyBnY,IAKrC,IACE,IAAKgZ,EAAY3lB,MAAO0lB,EAAUC,EAAYzmB,KAAKe,MAAO,CACxD,IAEI2lB,EAFAnJ,EAAOiJ,EAAQxlB,MAI+D,QAAjF0lB,EAAyBpN,EAAW+B,UAAUE,oBAAoBhS,IAAIgU,UAA8C,IAA3BmJ,GAA6CA,EAAuBtY,OAAOX,IAMvK,MAAOpM,GACPolB,EAAYxlB,EAAEI,GACd,QACAolB,EAAYtlB,IAGd8b,EAAUzC,WAAWpM,OAAOX,GAC5BwP,EAAU1C,WAAWnM,OAAOX,GAC5BwP,EAAUxC,kBAAkBrM,OAAOX,GACnC,IAAI0K,EAAQmB,EAAW8B,gBAAgB7R,IAAI0T,EAAUhE,SAErD,GAAId,EAAO,CACT,IAAIY,EAAOZ,EAAME,SAAS9O,IAAIkE,GAE9B,QAAanJ,IAATyU,EAAoB,CACtBZ,EAAME,SAASjK,OAAOX,GAEtB,IACIkZ,EADAC,EAActnB,EAA2ByZ,GAG7C,IACE,IAAK6N,EAAY9lB,MAAO6lB,EAAUC,EAAY5mB,KAAKe,MAAO,CACxD,IAEIsd,EAFAxF,EAAM8N,EAAQ3lB,MAImD,QAApEqd,EAAwBlG,EAAMG,wBAAwB/O,IAAIsP,UAA4C,IAA1BwF,GAA4CA,EAAsBjQ,OAAOX,IAExJ,MAAOpM,GACPulB,EAAY3lB,EAAEI,GACd,QACAulB,EAAYzlB,KAMhBgX,EAAMG,wBAAwBlK,OAAOX,GAKvCuW,GAA6BvW,IAG/B,SAAS8N,GAAoBjC,EAAYiE,GACvC,IAAIsJ,EAEJ,OAAyF,QAAjFA,EAAyBvN,EAAW+B,UAAUE,oBAAoBhS,IAAIgU,UAA8C,IAA3BsJ,EAAoCA,EAAyB1C,GAGhK,SAASyB,GAAyBnY,GAChC,IAAI4P,EAAa4G,GAAUxW,GAAM4P,WAEjC,YAAmB/Y,IAAf+Y,GAA2C,eAAfA,GAA8C,eAAfA,EACtD,GACEA,aAAsB6G,GACxB,CAAC7G,GAEDA,EA+BX,SAASyJ,GAAwB9N,EAAO+N,GACjCjd,GAAW,mCAINkP,EAAMO,WAAW8B,UAAUC,gBACjClN,OAAO2Y,GAjCb,SAAsD/N,EAAO+N,GAC3D,IAAI3hB,EAAQ4T,EAAMO,WAEdnU,EAAMqU,SACRrU,EAAMiW,UAAUG,6BAA6BzD,IAAIgP,GAEjD3C,GAAmCpL,EAAO,IAAI3B,IAAI,CAAC0P,KA4BrDC,CAA6ChO,EAAO+N,IAkBtD,IAAIE,GAzWsB,KAyWtBA,GA1CJ,SAA2BjO,EAAO+N,EAAYG,GAC5C,IAAIC,EAEJ,GAAKrd,GAAW,iCAAhB,CAIA,IAAI3D,EAAM6S,EAAMO,WAAW8B,UAAUC,gBACjC8L,GAAiD,QAApCD,EAAWhhB,EAAIoD,IAAIwd,UAAsC,IAAbI,EAAsBA,EAAW,GAAKD,EAElF,IAAbE,EACFN,GAAwB9N,EAAO+N,GAE/B5gB,EAAIgD,IAAI4d,EAAYK,KA6BpBH,GAfJ,SAAwCjO,GACtC,GAAKlP,GAAW,iCAAhB,CAIA,IAAI1E,EAAQ4T,EAAMO,WAClB6K,GAAmCpL,EAAO5T,EAAMiW,UAAUG,8BAC1DpW,EAAMiW,UAAUG,6BAA6B9R,UAQ3Cud,GALJ,SAAqCzC,GAEnC,YAAalgB,IAANkgB,EAAkB,aAAeA,GAwBtC6C,GAA0B,0BAoC1BC,GAAehF,GAA4Be,WAE3CkE,GAhB6B,CAC/BF,wBAtBwB,CACxBA,wBAAyBA,IAkByBA,yBAiBOA,wBA0CvDG,GAfe,SAAsB3b,GACvC0b,IAAQ,WACN,IAAIE,EAAW,aAIf,IACEA,EAAWH,KACXzb,IACA,QACA4b,SAiCN,SAASpoB,GAAgBqoB,GACvB,IAAIC,EAAaC,EAASC,EAAMC,EAAaC,EAASC,EAEtD,OAAO,UAAyB,SAA0BC,GACxD,OACE,OAAQA,EAAU9b,KAAO8b,EAAUxmB,MACjC,KAAK,EACHkmB,EAAcroB,EAA2BooB,GACzCO,EAAU9b,KAAO,EAEjBwb,EAAY7mB,IAEd,KAAK,EACH,IAAK8mB,EAAUD,EAAY3nB,KAAKe,KAAM,CACpCknB,EAAUxmB,KAAO,GACjB,MAGFomB,EAAOD,EAAQ5mB,MACf8mB,EAAcxoB,EAA2BuoB,GACzCI,EAAU9b,KAAO,EAEjB2b,EAAYhnB,IAEd,KAAK,EACH,IAAKinB,EAAUD,EAAY9nB,KAAKe,KAAM,CACpCknB,EAAUxmB,KAAO,GACjB,MAKF,OAFAumB,EAAMD,EAAQ/mB,MACdinB,EAAUxmB,KAAO,GACVumB,EAET,KAAK,GACHC,EAAUxmB,KAAO,EACjB,MAEF,KAAK,GACHwmB,EAAUxmB,KAAO,GACjB,MAEF,KAAK,GACHwmB,EAAU9b,KAAO,GACjB8b,EAAU7b,GAAK6b,EAAiB,MAAE,GAElCH,EAAY7mB,EAAEgnB,EAAU7b,IAE1B,KAAK,GAKH,OAJA6b,EAAU9b,KAAO,GAEjB2b,EAAY3mB,IAEL8mB,EAAU5b,OAAO,IAE1B,KAAK,GACH4b,EAAUxmB,KAAO,EACjB,MAEF,KAAK,GACHwmB,EAAUxmB,KAAO,GACjB,MAEF,KAAK,GACHwmB,EAAU9b,KAAO,GACjB8b,EAAUC,GAAKD,EAAiB,MAAE,GAElCN,EAAY1mB,EAAEgnB,EAAUC,IAE1B,KAAK,GAKH,OAJAD,EAAU9b,KAAO,GAEjBwb,EAAYxmB,IAEL8mB,EAAU5b,OAAO,IAE1B,KAAK,GACL,IAAK,MACH,OAAO4b,EAAU3b,UAGtBlN,EAAU,KAAM,CAAC,CAAC,EAAG,GAAI,GAAI,IAAK,CAAC,EAAG,GAAI,GAAI,MAGnD,IAAI+oB,GAAyB9oB,GAczB+oB,GACc,oBAAXC,QAA4C,oBAAX9d,OAQpC+d,GAAqC,oBAAdC,WAAmD,gBAAtBA,UAAUC,QAE9DC,GAAqB,CACvBL,MAAOA,GACPE,cAAeA,GACfI,SAVa,SAAkB1nB,GAC/B,OAAQonB,KACRpnB,IAAUuJ,QAAUvJ,aAAiBqnB,UAoGvC,IAAIM,GAvBJ,SAA+Cra,EAAIsa,GACjD,IAAIC,EACAC,EAkBJ,MAAO,CAhBU,WACf,IAAI9lB,EAAM4lB,EAAalmB,WAAM,EAAQG,WAErC,OAAIgmB,IAAY7lB,EACP8lB,GAGTD,EAAU7lB,EACV8lB,EAAaxa,EAAG5L,WAAM,EAAQG,aAIf,WACfgmB,EAAU,QAWVE,GAAiBvB,GACjBwB,GAAmBvK,GACnBwK,GAAiBxK,GACjByK,GAAUpQ,GACVqQ,GAAmBlP,GACnBmP,GAAkB7b,GAAYX,cAC9Byc,GAAiB9b,GAAYN,aAC7Bqc,GAAwB/b,GAAYgB,oBACpCgb,GAAwBjH,GAA4B5X,oBACpD8e,GAA6BlH,GAA4BC,yBACzDkH,GAAmBnH,GAA4BD,eAC/CqH,GAA8BpH,GAA4BK,0BAC1DgH,GAAsB1C,GACtB2C,GAAkClK,GAClCmK,GAA4BnP,GAAagB,wBACzCoO,GAAwBpP,GAAaC,oBACrCoP,GAAUtB,GAAmBL,MAC7B4B,GAA0CrB,GAM1CsB,GAAwB,WAE1B,SAASA,EAAS3Q,GAChB,IAAI4Q,EAASjmB,MAEb,OAAgBA,KAAMgmB,GAEtBnlB,EAAgBb,KAAM,cAAU,GAEhCa,EAAgBb,KAAM,YAAa,GAEnCa,EAAgBb,KAAM,eAAe,SAAU4J,GAG7C,OAFAqc,EAAOC,yBAEAX,GAA2BU,EAAOE,OAAQvc,MAGnD/I,EAAgBb,KAAM,cAAc,SAAU4J,GAG5C,OAFAqc,EAAOC,yBAEAD,EAAOG,YAAYxc,GAAayc,eAGzCxlB,EAAgBb,KAAM,qBAAqB,SAAUsmB,GAInD,GAHAL,EAAOC,0BAG4D,KAA9DI,MAAAA,OAAiC,EAASA,EAAIrL,YAAsB,CACvE,IAAsE,KAAjEqL,MAAAA,OAAiC,EAASA,EAAIC,eACjD,MAAO,GAGT,IAAIplB,EAAQ8kB,EAAOE,OAAO7Q,WAAWC,YAErC,OAAO8P,GAAsBlkB,EAAMmV,YAGrC,IAAIM,EAAaqP,EAAOE,OAAO7Q,WAAWsB,WAEtCC,EAAiBoP,EAAOE,OAAO7Q,WAAWuB,eAE9C,OAAwE,OAAhEyP,MAAAA,OAAiC,EAASA,EAAIC,eAAyBnB,GAAelT,UAAiC,IAAtBoU,EAAIC,cAAyBlB,GAAsBnB,GAAuB,CAACtN,EAAYC,KAAoBoB,GAAsBmN,GAAelT,UAAU,SAAUsU,GAC3Q,IAAIznB,EAAMynB,EAAMznB,IAChB,OAAQ6X,EAAWnN,IAAI1K,KAAS8X,EAAepN,IAAI1K,SAIvD8B,EAAgBb,KAAM,oBAAoB,SAAUymB,GAClD,IAAI1nB,EAAM0nB,EAAM1nB,IAKhB,OAHAknB,EAAOC,yBAGAlB,GAAeiB,EAAOE,OAAQF,EAAOE,OAAO7Q,WAAWC,YAAaxW,MAG7E8B,EAAgBb,KAAM,OAAO,SAAU0mB,GACrCT,EAAOC,yBAEP,IAAIS,EAAkB,IAAIC,GAAgBX,EAAQnB,IAGlD,OAFA4B,EAAOC,GAEAA,KAGT9lB,EAAgBb,KAAM,WAAyB,WAC7C,IAAI6mB,GAAS,OAAgC,UAAyB,SAASC,EAASJ,GACtF,IAAIC,EACJ,OAAO,UAAyB,SAAmBI,GACjD,OACE,OAAQA,EAAU7e,KAAO6e,EAAUvpB,MACjC,KAAK,EAOH,OANAyoB,EAAOC,0BAEPS,EAAkB,IAAIC,GAAgBX,EAAQnB,KAC9BkC,SAEhBD,EAAUvpB,KAAO,EACVkpB,EAAOC,GAEhB,KAAK,EAIH,OADAA,EAAgBM,uBACTF,EAAUG,OAAO,SAAUP,GAEpC,KAAK,EACL,IAAK,MACH,OAAOI,EAAU1e,UAGtBye,OAGL,OAAO,SAAUK,GACf,OAAON,EAAOpoB,MAAMuB,KAAMpB,YA9BiB,IAkC/CoB,KAAKmmB,OAAS,CACZiB,QAASlC,KACT5P,SAAU,WACR,OAAOD,GAETkI,aAAc,SAAsB8J,GAElChS,EAAWE,YAAc8R,EAAShS,EAAWE,cAE/CG,SAAU,SAAkBV,GAC1B,IAAIsS,EAASjS,EAAW8B,gBAExB,GAAImQ,EAAO7d,IAAIuL,GACb,OAAOrU,EAAkB2mB,EAAOhiB,IAAI0P,IAGtC,IAAIuS,EAAWtC,KAEf,OADAqC,EAAOpiB,IAAI8P,EAASuS,GACbA,GAETC,wBAAyB,WACvB,MAAO,CACLzI,QAAS,eAGb0I,uBAAwB,WACtB,MAAMxnB,EAAW,mCAMrB,IACIynB,EADAC,EAActsB,EAA2B2E,KAAKmmB,OAAO7Q,WAAWsB,YAGpE,IACE,IAAK+Q,EAAY9qB,MAAO6qB,EAAUC,EAAY5rB,KAAKe,MAAO,CACxD,IAAIqc,EAAUuO,EAAQ3qB,MACtBgoB,GAAiB/kB,KAAKmmB,OAAQhN,EAAS,OACvCuM,GAAoB1lB,KAAKmmB,OAAQhN,EAAS,IAE5C,MAAO/b,GACPuqB,EAAY3qB,EAAEI,GACd,QACAuqB,EAAYzqB,IAGd8C,KAAKinB,uBA0GP,OAvGA,OAAajB,EAAU,CAAC,CACtBjnB,IAAK,SACLhC,MAAO,WACL,IAAI6qB,EAAS5nB,KAETA,KAAK6nB,WAAa,GAIlBpf,GAA4B,2DAIhCzI,KAAK6nB,YACL,IAAIC,GAAW,EACf,OAAO,WACAA,IACHA,GAAW,EAEXF,EAAOG,eASZ,CACDhpB,IAAK,uBACLhC,MAAO,WACL,IAAIirB,EAAShoB,KAER8lB,IACHxf,OAAO2hB,YAAW,WAChB,OAAOD,EAAOD,aACb,KAGN,CACDhpB,IAAK,WACLhC,MAAO,WAGL,GAFAiD,KAAK6nB,YAEkB,IAAnB7nB,KAAK6nB,WAOP,GANA7nB,KAAKmmB,OAAO7Q,WAAWkC,qBAAqB1Y,SAAQ,SAAUopB,GAC5D,OAAOA,OAGTloB,KAAKmmB,OAAO7Q,WAAWkC,qBAAqB/R,SAEvCI,GAAW,iCACd,YAOO7F,KAAK6nB,YAMjB,CACD9oB,IAAK,aACLhC,MAAO,WACL,OAAOiD,KAAK6nB,UAAY,IAEzB,CACD9oB,IAAK,yBACLhC,MAAO,WACD8I,GAAW,kCAAoC7F,KAAK6nB,YAQzD,CACD9oB,IAAK,oBACLhC,MAAO,WAEL,OADAiD,KAAKkmB,yBACElmB,KAAKmmB,SAEb,CACDpnB,IAAK,QACLhC,MAAO,WAEL,OADAiD,KAAKkmB,yBACElmB,KAAKmmB,OAAO7Q,WAAWC,YAAYa,UAE3C,CACDrX,IAAK,aACLhC,MAAO,WAEL,OADAiD,KAAKkmB,yBACElmB,KAAKmmB,OAAOiB,YAMhBpB,EA5PmB,GA+P5B,SAASmC,GAAgBpT,EAAOiE,GAC9B,IAAIoP,EAAcxpB,UAAUlC,OAAS,QAAsB2D,IAAjBzB,UAAU,IAAmBA,UAAU,GAC7EyW,EAAaN,EAAMO,WACnBN,EAAUoT,EAAcxC,KAA8B5M,EAAUhE,QACpE,MAAO,CAKLO,YAAa,CAGXP,QAASoT,EAAcpT,EAAUgE,EAAUhE,QAC3CoB,QAASgS,EAAcpT,EAAUgE,EAAU5C,QAC3CC,oBAAqB3X,EAAc,GAAIsa,EAAU3C,qBACjDC,WAAY,IAAIlD,IAAI4F,EAAU1C,YAC9BC,WAAYyC,EAAUzC,WAAWqE,QACjCpE,kBAAmBwC,EAAUxC,kBAAkBoE,SAEjDjE,YAAa,EACbnB,SAAU,KACVC,aAAc,KACdmB,WAAY,IAAIxD,IAAIiC,EAAWuB,YAE/BC,eAAgB,IAAIzD,IAAIiC,EAAWwB,gBAEnCC,yBAA0B,IAAI7R,IAC9B8R,6BAA8B,IAAI9R,IAClC+R,6BAA8B,IAAI/R,IAClCgS,oCAAqC,GACrCC,4BAA6B,IAAI9D,IACjC+D,iBAAiB,IAAIlS,KAAMC,IAAI8P,EAASD,EAAMW,SAASsD,EAAUhE,UACjEoC,UAAW,CACTC,gBAAiB,IAAIpS,IACrBqS,oBAAqB,IAAIrS,IACzBsS,6BAA8B,IAAInE,KAKpCoE,qBAAsB,IAAIvS,IAAIyC,GAAmB2N,EAAWmC,qBAAqBzF,WAAW,SAAUsW,GAIpG,MAAO,EAHM,OAAeA,EAAQ,GACnB,GAEJ,mBAYnB,IAAIC,GAAwBvC,IAAwC,SAAUhR,EAAOC,GACnF,IAAIC,EAEAI,EAAaN,EAAMO,WACnB0D,EAAwB,WAAZhE,EAAwE,QAAhDC,EAAuBI,EAAWG,gBAA+C,IAAzBP,EAAkCA,EAAuBI,EAAWE,YAAc5U,EAAkB0U,EAAWI,cAC/M,OAAO,IAAIuQ,GAASmC,GAAgBpT,EAAOiE,OAC1C,SAAUjE,EAAOC,GAClB,IAAIuT,EAAuBC,EAE3B,OAAOC,OAAOzT,GAAWyT,OAAO1T,EAAMqS,SAAWqB,OAA+D,QAAvDF,EAAwBxT,EAAMO,WAAWE,gBAAgD,IAA1B+S,OAAmC,EAASA,EAAsBvT,SAAWyT,OAAO1T,EAAMO,WAAWC,YAAYP,SAAWyT,OAAmE,QAA3DD,EAAwBzT,EAAMO,WAAWG,oBAAoD,IAA1B+S,OAAmC,EAASA,EAAsBxT,YAE/X0T,IAAyB,OAAeJ,GAAuB,GAC/DK,GAAwBD,GAAuB,GAC/CE,GAA+BF,GAAuB,GAG1D/C,GAAgCiD,IAchC,IAAIhC,GAA+B,SAAUiC,IAC3C,OAAUjC,EAAiBiC,GAE3B,IAAIC,EAAU3pB,EAAaynB,GAE3B,SAASA,EAAgBmC,EAAUC,GACjC,IAAIC,EA+DJ,OA7DA,OAAgBjpB,KAAM4mB,GAEtBqC,EAASH,EAAQ3sB,KAAK6D,KAAMmoB,GAAgBY,EAASG,oBAAqBH,EAASG,oBAAoB5T,WAAWC,aAAa,IAE/H1U,GAAgB,OAAuBooB,GAAS,cAAU,GAE1DpoB,GAAgB,OAAuBooB,GAAS,OAAO,SAAUE,EAAaC,GAC5EH,EAAO/C,yBAEP,IAAInR,EAAQkU,EAAOC,oBAMnBD,EAAOI,QAAO,WACZ3D,GAAoB3Q,EAAOoU,EAAYpqB,IAAK,GAC5CymB,GAAiByD,EAAOC,oBAAqBC,EAAaC,SAI9DvoB,GAAgB,OAAuBooB,GAAS,SAAS,SAAUE,GACjEF,EAAO/C,yBAEP,IAAInR,EAAQkU,EAAOC,oBAGnBD,EAAOI,QAAO,WACZ3D,GAAoB3Q,EAAOoU,EAAYpqB,IAAK,GAC5CymB,GAAiByD,EAAOC,oBAAqBC,EAAahE,UAI9DtkB,GAAgB,OAAuBooB,GAAS,uCAAuC,SAAU/W,GAC/F+W,EAAO/C,yBAEP,IAAInR,EAAQkU,EAAOC,oBAGnBpE,IAAe,WACb,IACIwE,EADAC,EAAcluB,EAA2B6W,EAAOH,WAGpD,IACE,IAAKwX,EAAY1sB,MAAOysB,EAAUC,EAAYxtB,KAAKe,MAAO,CACxD,IAAI0sB,GAAgB,OAAeF,EAAQvsB,MAAO,GAC9CiR,EAAIwb,EAAc,GAClBrd,EAAIqd,EAAc,GAEtB9D,GAAoB3Q,EAAO/G,EAAG,GAC9ByX,GAA4B1Q,EAAO,IAAIuQ,GAAsBtX,GAAI7B,IAEnE,MAAO/O,GACPmsB,EAAYvsB,EAAEI,GACd,QACAmsB,EAAYrsB,WAKlB+rB,EAAOI,OAASL,EACTC,EAKT,OAAOrC,EA1E0B,CA2EjCZ,IAEEyD,GAAkB,CACpBzD,SAAUA,GACVY,gBAAiBA,GACjB8C,cApHF,SAAuBC,GACrB,IAAIZ,EAAW,IAAI/C,GAASH,MAC5B,OAA0B,MAAnB8D,EAA0BZ,EAAS7mB,IAAIynB,GAAmBZ,GAmHjEa,cA7FF,SAAuB7U,GACrB,IAAIC,EAAUpW,UAAUlC,OAAS,QAAsB2D,IAAjBzB,UAAU,GAAmBA,UAAU,GAAK,SAC9EmqB,EAAWJ,GAAsB5T,EAAOC,GAE5C,OAAK+T,EAASc,aAKPd,GAJLH,KACOD,GAAsB5T,EAAOC,MAyFpC8U,GAAoBL,GAAgBzD,SACpC+D,GAAoBN,GAAgB7C,gBACpCoD,GAAoBP,GAAgBC,cACpCO,GAAoBR,GAAgBG,cACpCM,GAAiCluB,OAAOkH,OAAO,CACjD6B,UAAW,KACXihB,SAAU8D,GACVlD,gBAAiBmD,GACjBL,cAAeM,GACfJ,cAAeK,KAyCjB,IAAIE,GA5BJ,WAGE,IAFA,IAAItqB,EAAS,IAAIuT,IAERgX,EAAQxrB,UAAUlC,OAAQ2tB,EAAO,IAAI1uB,MAAMyuB,GAAQE,EAAQ,EAAGA,EAAQF,EAAOE,IACpFD,EAAKC,GAAS1rB,UAAU0rB,GAG1B,IAAK,IAAIC,EAAM,EAAGC,EAAQH,EAAME,EAAMC,EAAM9tB,OAAQ6tB,IAAO,CACzD,IAGIE,EAHAvlB,EAAMslB,EAAMD,GAEZG,EAAcrvB,EAA2B6J,GAG7C,IACE,IAAKwlB,EAAY7tB,MAAO4tB,EAAUC,EAAY3uB,KAAKe,MAAO,CACxD,IAAIC,EAAQ0tB,EAAQ1tB,MACpB8C,EAAOiU,IAAI/W,IAEb,MAAOK,GACPstB,EAAY1tB,EAAEI,GACd,QACAstB,EAAYxtB,KAIhB,OAAO2C,GAIL8qB,GAAS,SAsBb,IAAIC,GAZJ,SAAwBC,GAEtB,IAAIC,EAAMH,GAAOE,GAOjB,OALIC,EAAIpc,UAAYmc,GAAwC,mBAAjBA,IAEzCC,EAAIpc,QAAUmc,KAGTC,GAOLC,GAA4BtU,GAAagB,wBACzCuT,GAAwBvU,GAAaC,oBACrCuU,GAAgBzQ,GAChB0Q,GAAuB1Q,GACvB2Q,GAAmB3Q,GACnB4Q,GAAiB5Q,GACjB6Q,GAAuC7Q,GACvC8Q,GAAUzW,GACV0W,GAAe1W,GACf2W,GAAmBxV,GACnByV,GAAwBxlB,GAAiBH,oBACzC4lB,GAAczlB,GAAiBC,UAC/BylB,GAAyBtN,GAA4Ba,qBACrD0M,GAAmC5I,GACnC6I,GAAkB3B,GAAkBR,cACpCoC,GAAc,cACdC,GAAa,aACbC,GAAY,YACZC,GAAU,UACVC,GAAW,SACXC,GAAW,WAEf,SAASC,KACP,MAAMnsB,EAAW,gEAGnB,IAAIosB,GAAerwB,OAAOkH,OAAO,CAC/BkkB,QAASoE,KACTlW,SAAU8W,GACV7O,aAAc6O,GACd1W,SAAU0W,GACV5E,wBAAyB4E,GACzB3E,uBAAwB2E,KAEtBE,IAA+B,EAEnC,SAASC,GAAsBxX,GAC7B,GAAIuX,GACF,MAAMrsB,EAAW,qJAGnB,IAAIoV,EAAaN,EAAMO,WAEvB,GAA4B,OAAxBD,EAAWG,SAAmB,CAC5B3P,GAAW,kCAAoCA,GAAW,uDAKxDwP,EAAWsB,YAAc,GAC3BiV,GAAiC7W,GAIrC,IAAIC,EAAUK,EAAWE,YAAYP,QACjCY,EAAcmV,KAClB1V,EAAWG,SAAW9W,EAAcA,EAAc,GAAI2W,EAAWE,aAAc,GAAI,CACjFP,QAASY,EACTQ,QAASR,EACTU,WAAY,IAAIlD,IAChBiD,oBAAqB,KAEvBhB,EAAW8B,gBAAgBjS,IAAI0Q,EAAa2V,GAAa5qB,EAAkB0U,EAAW8B,gBAAgB7R,IAAI0P,OAI9G,IAAIwX,GAAa,gBAAoB,CACnC9d,QAAS2d,KAGPI,GAAc,WAChB,OAAOV,GAAWS,KAIhBE,GAAuB,gBAAoB,MAY/C,SAASC,GAAiB5X,EAAOM,EAAY2D,GAC3C,IAGI4T,EADAC,EAAcxxB,EAFG6vB,GAAqBnW,EAAOiE,EAAWA,EAAU1C,aAKtE,IACE,IAAKuW,EAAYhwB,MAAO+vB,EAAUC,EAAY9wB,KAAKe,MAAO,CACxD,IAAIiC,EAAM6tB,EAAQ7vB,MACd+vB,EAAQzX,EAAW2B,6BAA6B1R,IAAIvG,GAExD,GAAI+tB,EAAO,CACT,IACIC,EADAC,EAAc3xB,EAA2ByxB,GAG7C,IACE,IAAKE,EAAYnwB,MAAOkwB,EAAUC,EAAYjxB,KAAKe,MAAO,CACxD,IAAImwB,GAAgB,OAAeF,EAAQhwB,MAAO,GAE9CmwB,GADSD,EAAc,IACN,OAAeA,EAAc,GAAI,IACrCC,EAAe,IAGhCtlB,EAFeslB,EAAe,IAErBlU,IAEX,MAAO5b,GACP4vB,EAAYhwB,EAAEI,GACd,QACA4vB,EAAY9vB,OAIlB,MAAOE,GACPyvB,EAAY7vB,EAAEI,GACd,QACAyvB,EAAY3vB,KAIhB,SAASiwB,GAA4BpY,GACnC,IAAIM,EAAaN,EAAMO,WACnB0D,EAAY3D,EAAWE,YAEvBe,EAAa0C,EAAU1C,WAE3B,GAAIA,EAAWjJ,KAAM,CAEnB,IACI+f,EADAC,EAAchyB,EAA2Bga,EAAW0B,8BAGxD,IACE,IAAKsW,EAAYxwB,MAAOuwB,EAAUC,EAAYtxB,KAAKe,MAAO,CACxD,IAAIwwB,GAAgB,OAAeF,EAAQrwB,MAAO,GAC9CgC,EAAMuuB,EAAc,GACpBC,EAAgBD,EAAc,GAElC,GAAIhX,EAAW7M,IAAI1K,GAAM,CACvB,IACIyuB,EADAC,EAAcpyB,EAA2BkyB,GAG7C,IACE,IAAKE,EAAY5wB,MAAO2wB,EAAUC,EAAY1xB,KAAKe,MAAO,CACxD,IAAI4wB,GAAgB,OAAeF,EAAQzwB,MAAO,GAC1C2wB,EAAc,IAGtBC,EAFmBD,EAAc,IAEpB3Y,IAEf,MAAO3X,GACPqwB,EAAYzwB,EAAEI,GACd,QACAqwB,EAAYvwB,OAIlB,MAAOE,GACPiwB,EAAYrwB,EAAEI,GACd,QACAiwB,EAAYnwB,IAGd,IACI0wB,EADAC,EAAcxyB,EAA2Bga,EAAWyB,0BAGxD,IACE,IAAK+W,EAAYhxB,MAAO+wB,EAAUC,EAAY9xB,KAAKe,MAAO,CACxD,IAAIgxB,GAAgB,OAAeF,EAAQ7wB,MAAO,GACzC+wB,EAAc,IAGvBC,EAFoBD,EAAc,IAEpB/Y,IAEhB,MAAO3X,GACPywB,EAAY7wB,EAAEI,GACd,QACAywB,EAAY3wB,MAGTwuB,KAActlB,OAASiP,EAAW6B,4BAA4B7J,KAAO,KAGxEsf,GAAiB5X,EAAOM,EAAY2D,GAOpC3D,EAAW6B,4BAA4BpY,SAAQ,SAAUkvB,GACvD,OAAOA,OAET3Y,EAAW6B,4BAA4BzR,SAM3C4P,EAAW4B,oCAAoCnY,SAAQ,SAAUkvB,GAC/D,OAAOA,EAAGhV,MAEZ3D,EAAW4B,oCAAoCgX,OAAO,EAAG5Y,EAAW4B,oCAAoCva,QAiD1G,SAASwxB,GAAQC,GACf,IAAIC,EAA2BD,EAAOC,yBAClCC,EAAW5B,KAEX6B,EAAYnC,GAAS,IAErBoC,GADa,OAAeD,EAAW,GACjB,GAyB1B,OAvBAF,GAAyB,WACvB,OAAOG,EAAS,OAElBvC,IAAU,WAQR,OAPAoC,GAAyB,WACvB,OAAOG,EAAS,OAMX,WACLH,GAAyB,kBAE1B,CAACA,IACJpC,IAAU,WAIRzhB,GAAaC,iBAAiB,WAAW,YAzE7C,SAAkBuK,GAChB,IAAIM,EAAaN,EAAMO,WACvBD,EAAWsB,cAEX,IACE,IAAInB,EAAWH,EAAWG,SAG1B,GAAgB,MAAZA,EACF,OAKFH,EAAWI,aAAeJ,EAAWE,YACrCF,EAAWE,YAAcC,EACzBH,EAAWG,SAAW,KACtB2X,GAA4BpY,GAEG,MAA3BM,EAAWI,aACbJ,EAAW8B,gBAAgBhN,OAAOkL,EAAWI,aAAaT,SAE1DvM,GAA4B,0DAA2D,UAGzF4M,EAAWI,aAAe,KAEtB5P,GAAW,kCAGG,MAAZ2P,GACFoW,GAAiC7W,GAGrC,QACAM,EAAWsB,eAuCT6X,CAASH,EAAS3f,eAGf,KA2ET,IAAI+f,GAAS,EAEb,SAASC,GAAoBC,GAC3B,IAoBIC,EApBAC,EAA6BF,EAAOE,2BACpClF,EAAkBgF,EAAOhF,gBACzBmF,EAAYH,EAAOI,eACnBhiB,EAAW4hB,EAAO5hB,SAmBlB2I,EAAW,SAAkBV,GAC/B,IAAIsS,EAASsH,EAAclgB,QAAQyI,gBAEnC,GAAImQ,EAAO7d,IAAIuL,GACb,OAAOrU,EAAkB2mB,EAAOhiB,IAAI0P,IAGtC,IAAIuS,EAAW+D,KAEf,OADAhE,EAAOpiB,IAAI8P,EAASuS,GACbA,GAGLC,EAA0B,SAAiC5f,EAAU7I,GACvE,GAAW,MAAPA,EAAa,CAEf,IACI+X,EADwBuX,EAAS3f,QAAQ4G,WACQwB,yBAEjDkY,EAAKP,KAET,OADA3X,EAAyB5R,IAAI8pB,EAAIpnB,GAC1B,CACLmX,QAAS,WACPjI,EAAyB3M,OAAO6kB,KAKpC,IACIjY,EADyBsX,EAAS3f,QAAQ4G,WACYyB,6BAErDA,EAA6BtN,IAAI1K,IACpCgY,EAA6B7R,IAAInG,EAAK,IAAIkG,KAG5C,IAAIgqB,EAAOR,KAGX,OADA9tB,EAAkBoW,EAA6BzR,IAAIvG,IAAMmG,IAAI+pB,EAAMrnB,GAC5D,CACLmX,QAAS,WACP,IAAIE,EAAOlI,EAA6BzR,IAAIvG,GAExCkgB,IACFA,EAAK9U,OAAO8kB,GAEM,IAAdhQ,EAAK5R,MACP0J,EAA6B5M,OAAOpL,OAQ5C0oB,EAAyB,SAAgCyH,GAC3D3C,GAAsB8B,EAAS3f,SAE/B,IAAK,IAAIygB,EAAM,EAAGC,EAAepzB,OAAOiC,KAAKixB,GAAWC,EAAMC,EAAa1yB,OAAQyyB,IAAO,CACxF,IAAInhB,EAAIohB,EAAaD,GACrBxuB,EAAkB0tB,EAAS3f,QAAQ4G,WAAWE,UAAUa,oBAAoBrI,GAAKkhB,EAASlhB,KAI1FuP,EAAe,SAAsB8J,GACvCkF,GAAsB8B,EAAS3f,SAE/B,IACI2gB,EADA7Z,EAAW7U,EAAkBiuB,EAAclgB,QAAQ8G,UAGvD,IACE8W,IAA+B,EAC/B+C,EAAWhI,EAAS7R,GACpB,QACA8W,IAA+B,EAG7B+C,IAAa7Z,IAWjBoZ,EAAclgB,QAAQ8G,SAAW6Z,EAE7B3D,KAActlB,OAChBumB,GAAiB0B,EAAS3f,QAASkgB,EAAclgB,QAAS2gB,GAG5D1uB,EAAkB2uB,EAAsB5gB,QAAxC/N,KAGE2uB,EAAwBpD,GAAS,MACjCkC,EAA2BtC,IAAY,SAAUlrB,GACnD0uB,EAAsB5gB,QAAU9N,IAC/B,CAAC0uB,IACAjB,EAAWzD,IAAsB,WACnC,OAAOkE,MAAAA,EAA6CA,EAAY,CAC9D1H,QAASoE,KACTlW,SAAU,WACR,OAAOsZ,EAAclgB,SAEvB6O,aAAcA,EACd7H,SAAUA,EACV8R,wBAAyBA,EACzBC,uBAAwBA,MAIX,MAAbqH,IACFT,EAAS3f,QAAUogB,GAGrBF,EAAgBhE,IAAsB,WACpC,OAAqC,MAA9BiE,EA9MX,SAAsC9Z,EAAO4U,GAC3C,IAAI4F,EAAUvE,KAqCd,OApCArB,EAAgB,CAEdzkB,IAAK,SAAasqB,EAAMzyB,GACtB,IAMI0yB,EANAtuB,EAAQouB,EAAQha,YAChB4J,EAASiM,GAAerW,EAAO5T,EAAOquB,EAAKzwB,IAAKhC,GAChD2yB,EAAe,IAAItc,IAAI+L,EAAOlhB,QAC9BuY,EAAoBrV,EAAMqV,kBAAkBoE,QAE5C+U,EAAct0B,EAA2Bq0B,GAG7C,IACE,IAAKC,EAAY9yB,MAAO4yB,EAAUE,EAAY5zB,KAAKe,MAAO,CACxD,IAAIf,EAAI0zB,EAAQ1yB,MAChByZ,EAAkBrM,OAAOpO,IAE3B,MAAOqB,GACPuyB,EAAY3yB,EAAEI,GACd,QACAuyB,EAAYzyB,IAGdqyB,EAAQha,YAAc7W,EAAcA,EAAc,GAAIyC,GAAQ,GAAI,CAChEmV,WAAY6T,GAAiBhpB,EAAMmV,WAAYoZ,GAC/CnZ,WAAYoV,GAAuBxqB,EAAMoV,WAAY4I,GAErD3I,kBAAmBA,KAGvBoZ,yBAA0B,SAAkCrZ,GAE1DA,EAAWzX,SAAQ,SAAUqN,EAAG6B,GAC9BuhB,EAAQha,YAAc8V,GAAqCkE,EAAQha,YAAavH,EAAG7B,SAIlFojB,EAwKuCM,CAA6BxB,EAAS3f,QAASmgB,GAAiD,MAAnBlF,EA/J7H,SAA2BA,GAEzB,IAAIZ,EAAW8C,KAAkB3pB,IAAIynB,GACjCtU,EAAa0T,EAASG,oBAAoB5T,WAW9C,OATAyT,EAAS/B,SAKT3R,EAAWmC,qBAAqB1Y,SAAQ,SAAUopB,GAChD,OAAOA,OAET7S,EAAWmC,qBAAqB/R,QACzB4P,EAiJ8Iya,CAAkBnG,GAAmBqB,QAE1L,IAAI+E,EAAgB9D,IAAQ,WAC1B,OAAOR,MAAAA,QAAqE,EAASA,GAAsBmD,GAAe,WACxH,OAAOA,EAAclgB,QAAQ6G,YAAYP,aAE1C,CAAC4Z,IAuCJ,OArCA5C,IAAU,WAKR,IAGIgE,EAHAjb,EAAQsZ,EAAS3f,QAEjBuhB,EAAc50B,EAA2B,IAAI+X,IAAI2B,EAAMO,WAAWsB,aAGtE,IACE,IAAKqZ,EAAYpzB,MAAOmzB,EAAUC,EAAYl0B,KAAKe,MAAO,CACxD,IAAIozB,EAAUF,EAAQjzB,MACtBouB,GAAiBpW,EAAOmb,EAAS,QAEnC,MAAO9yB,GACP6yB,EAAYjzB,EAAEI,GACd,QACA6yB,EAAY/yB,IAGd,OAAO,WACL,IACIizB,EADAC,EAAc/0B,EAA2B0Z,EAAMO,WAAWsB,YAG9D,IACE,IAAKwZ,EAAYvzB,MAAOszB,EAAUC,EAAYr0B,KAAKe,MAAO,CACxD,IAAIozB,EAAUC,EAAQpzB,MACtBkuB,GAAclW,EAAOmb,IAEvB,MAAO9yB,GACPgzB,EAAYpzB,EAAEI,GACd,QACAgzB,EAAYlzB,QAGf,CAACmxB,IACgB,gBAAoB7B,GAAW6D,SAAU,CAC3DtzB,MAAOsxB,GACO,gBAAoB3B,GAAqB2D,SAAU,CACjEtzB,MAAOgzB,GACO,gBAAoB7B,GAAS,CAC3CE,yBAA0BA,IACxBrhB,IAsBN,IAAIujB,GAnBJ,SAAoBC,GAClB,IAAIC,EAAWD,EAAMC,SACjBC,GAAsB,OAAyBF,EAAOx1B,GAEtD21B,EAAmBjE,KAEvB,OAAiB,IAAb+D,GAAsBE,EAAiBhiB,UAAY2d,GAG9CkE,EAAMxjB,SAGK,gBAAoB2hB,GAAqB+B,IAO3DH,GAEW7D,GAFX6D,GApfJ,WACE,IAAIP,EAAgBhE,GAAWW,IAM/B,OAJqB,MAAjBqD,GACFvoB,GAA4B,uIAGvBuoB,GA6eLO,GAJJ,WACE,OAAO7D,KAAc/d,QAAQ0Y,SAwC/B,IAAIuJ,GAlBJ,SAA2BC,EAAGC,GAC5B,GAAID,IAAMC,EACR,OAAO,EAGT,GAAID,EAAEl0B,SAAWm0B,EAAEn0B,OACjB,OAAO,EAGT,IAAK,IAAIC,EAAI,EAAGm0B,EAAIF,EAAEl0B,OAAQC,EAAIm0B,EAAGn0B,IACnC,GAAIi0B,EAAEj0B,KAAOk0B,EAAEl0B,GACb,OAAO,EAIX,OAAO,GAILo0B,GAAc,YACdC,GAAW,SAUf,IAAIC,GARJ,SAAqBl0B,GACnB,IAAI+tB,EAAMkG,KAIV,OAHAD,IAAY,WACVjG,EAAIpc,QAAU3R,KAET+tB,EAAIpc,SAITwiB,GAAgBZ,GAChBa,GAAwBnO,GACxBoO,GAAsBpO,GACtBqO,GAAkB1Z,GAClB2Z,GAAc,YACdC,GAAW,SACXC,GAAUhN,GAAmBL,MAgIjC,IAAIsN,GA3HJ,SAAmBC,GACjB,GAAK7rB,GAAW,iCAKhB,OAGF,SAA0B6rB,GACxB,IACItR,GADQzkB,MAAMC,QAAQ81B,GAAYA,EAAW,CAACA,IAC1BxvB,KAAI,SAAU0uB,GACpC,OAAOA,aAAaS,GAAkBT,EAAIA,EAAE7xB,OAE1CsvB,EAAW6C,KACfI,IAAY,WACV,GAAKzrB,GAAW,iCAAhB,CAIA,IAAIkP,EAAQsZ,EAAS3f,QAErB,GAAIijB,EAAUjjB,UAAY8iB,GAGxBlrB,OAAOsrB,aAAaD,EAAUjjB,SAC9BijB,EAAUjjB,QAAU,SACf,CACL,IACImjB,EADAC,EAAcz2B,EAA2B+kB,GAG7C,IACE,IAAK0R,EAAYj1B,MAAOg1B,EAAUC,EAAY/1B,KAAKe,MAAO,CACxD,IAAIyjB,EAAIsR,EAAQ90B,MAChBq0B,GAAoBrc,EAAOwL,EAAG,IAEhC,MAAOnjB,GACP00B,EAAY90B,EAAEI,GACd,QACA00B,EAAY50B,KAIhB,OAAO,WACL,IACI60B,EADAC,EAAc32B,EAA2B+kB,GAG7C,IACE,IAAK4R,EAAYn1B,MAAOk1B,EAAUC,EAAYj2B,KAAKe,MAAO,CACxD,IAAIm1B,EAAKF,EAAQh1B,MACjBq0B,GAAoBrc,EAAOkd,GAAK,IAElC,MAAO70B,GACP40B,EAAYh1B,EAAEI,GACd,QACA40B,EAAY90B,SAGf,CAACmxB,GAAUntB,QAAO,OAAmBkf,KAKxC,IAAIuR,EAAYJ,KACZW,EAAsBjB,GAAmB7Q,GAE7C,KAAKoR,SAAoCnxB,IAAxB6xB,GAAsCvB,GAAyBuB,EAAqB9R,IAAe,CAClH,IAGI+R,EAHApd,EAAQsZ,EAAS3f,QAEjB0jB,EAAc/2B,EAA2B+kB,GAG7C,IACE,IAAKgS,EAAYv1B,MAAOs1B,EAAUC,EAAYr2B,KAAKe,MAAO,CACxD,IAAIu1B,EAAMF,EAAQp1B,MAClBq0B,GAAoBrc,EAAOsd,EAAK,IAElC,MAAOj1B,GACPg1B,EAAYp1B,EAAEI,GACd,QACAg1B,EAAYl1B,IAGd,GAAIg1B,EAAqB,CACvB,IACII,EADAC,EAAcl3B,EAA2B62B,GAG7C,IACE,IAAKK,EAAY11B,MAAOy1B,EAAUC,EAAYx2B,KAAKe,MAAO,CACxD,IAAIyjB,EAAI+R,EAAQv1B,MAChBq0B,GAAoBrc,EAAOwL,GAAI,IAEjC,MAAOnjB,GACPm1B,EAAYv1B,EAAEI,GACd,QACAm1B,EAAYr1B,KAIZy0B,EAAUjjB,SACZpI,OAAOsrB,aAAaD,EAAUjjB,SAGhCijB,EAAUjjB,QAAUpI,OAAO2hB,YAAW,WACpC0J,EAAUjjB,QAAU,KAEpB,IACI8jB,EADAC,EAAcp3B,EAA2B+kB,GAG7C,IACE,IAAKqS,EAAY51B,MAAO21B,EAAUC,EAAY12B,KAAKe,MAAO,CACxD,IAAI41B,EAAMF,EAAQz1B,MAClBq0B,GAAoBrc,EAAO2d,GAAM,IAEnC,MAAOt1B,GACPq1B,EAAYz1B,EAAEI,GACd,QACAq1B,EAAYv1B,OAEbi0B,KAjHEwB,CAAiBjB,IA6K1B,IAAIkB,GA9BJ,WA2BE,MAAO,kCAKLC,GAAkBvpB,GAAYX,cAC9BmqB,GAAc7sB,GAAiBC,UAC/B6sB,GAAqB9sB,GAAiBF,iBACtCitB,GAAyB/sB,GAAiBD,qBAC1CitB,GAA2B3C,GAC3B4C,GAAgB5C,GAGhB6C,IAFkB5rB,GAAqBL,cAEVmX,GAA4BC,0BACzD8U,GAAmB/U,GAA4BD,eAE/CiV,GAA2BhV,GAA4BM,uBACvD2U,GAAgB,cAChBC,GAAc,YACdC,GAAY,UACZC,GAAW,SACXC,GAAa,WAGjB,SAASC,GAAe7Y,EAAUlR,EAAaykB,GAI7C,GAAuB,aAAnBvT,EAAS3Z,MACX,OAAO2Z,EAASzZ,SACX,GAAuB,YAAnByZ,EAAS3Z,MAMlB,MALc,IAAIQ,SAAQ,SAAUC,GAClCysB,EAAS3f,QAAQ4G,WAAW4B,4BAA4BpD,IAAIlS,MAKzD,KAAuB,aAAnBkZ,EAAS3Z,MACZ2Z,EAASzZ,SAETpB,EAAW,mCAAoCiB,OAAO0I,EAAY7K,IAAK,MA0LjF,SAAS60B,GAA2ChqB,GAClD,IAAIykB,EAAW6E,KACXW,EAAgBjB,KAChBkB,EAAcR,IAAc,WAC9B,IAAI3d,EAMJ,IAAIZ,EAAQsZ,EAAS3f,QACjB2G,EAAaN,EAAMO,WACnB0D,EAAY8Z,KAAc1sB,OAA0D,QAAjDuP,EAAwBN,EAAWG,gBAAgD,IAA1BG,EAAmCA,EAAiDN,EAAWE,YAE/L,MAAO,CACLuF,SAFaqY,GAA2Bpe,EAAOnL,EAAaoP,GAG5Dja,IAAK6K,EAAY7K,OAElB,CAACsvB,EAAUzkB,IAEVmqB,EAA0BT,IAAc,SAAUhe,GACpD,IAAI0e,EACJ,OAAO,WACL,IAAIC,EAAYC,EAEZC,EAAY7e,IAEhB,OAAiC,QAA5B2e,EAAaD,SAAsC,IAAfC,GAAyBA,EAAWnZ,SAASsZ,GAAGD,EAAUrZ,YAA4C,QAA7BoZ,EAAcF,SAAuC,IAAhBE,OAAyB,EAASA,EAAYn1B,OAASo1B,EAAUp1B,IAC/Mi1B,GAGTA,EAAYG,EACLA,MAER,IACCE,EAAsBb,IAAU,WAClC,OAAOO,EAAwBD,KAC9B,CAACA,EAAaC,IACbO,EAAYhB,IAAc,SAAUiB,GACtC,IAAIxf,EAAQsZ,EAAS3f,QAErB,OADmB2kB,GAAyBte,EAAOnL,EAAa2qB,EAAQV,GACpD9U,UACnB,CAACsP,EAAUzkB,EAAaiqB,IAC3B,OAAOb,GAAuBsB,EAAWD,EACzCA,GACEvZ,SAGJ,SAAS0Z,GAAsC5qB,GAC7C,IAAIykB,EAAW6E,KACX9M,EAAckN,IAAc,WAC9B,IAAImB,EAEA1f,EAAQsZ,EAAS3f,QACjB2G,EAAaN,EAAMO,WACnB0D,EAAY8Z,KAAc1sB,OAA0D,QAAjDquB,EAAwBpf,EAAWG,gBAAgD,IAA1Bif,EAAmCA,EAAiDpf,EAAWE,YAC/L,OAAO4d,GAA2Bpe,EAAOnL,EAAaoP,KACrD,CAACqV,EAAUzkB,IACV8qB,EAAyBpB,IAAc,WAKzC,OAAOlN,MACN,CAACA,IACAyN,EAAgBjB,KAChB0B,EAAYhB,IAAc,SAAUqB,EAAaJ,GACnD,IAAIxf,EAAQsZ,EAAS3f,QAsBrB,OArBmB2kB,GAAyBte,EAAOnL,GAAa,WAC9D,IAAK/D,GAAW,wCACd,OAAO0uB,IAMT,IAAIK,EAAcxO,IAEbyO,EAAgBnmB,QAAQ0lB,GAAGQ,IAC9BL,IAQFM,EAAgBnmB,QAAUkmB,IACzBf,GACiB9U,UACnB,CAACsP,EAAUzkB,EAAaiqB,EAAezN,IACtCvnB,EAASo0B,KAEb,GAAc,MAAVp0B,EACF,MAAMoB,EAAW,sFAGnB,IAAI6a,EAAWiY,GAAmBl0B,EAAQ61B,EAAwBJ,GAC9DO,EAAkBpB,GAAS3Y,GAI/B,OAHAyY,IAAY,WACVsB,EAAgBnmB,QAAUoM,KAErBA,EAGT,SAASga,GAA0ClrB,GACjD,IAAIykB,EAAW6E,KACXW,EAAgBjB,KAEhBxM,EAAckN,IAAc,WAC9B,IAAIyB,EAMJ,IAAIhgB,EAAQsZ,EAAS3f,QACjB2G,EAAaN,EAAMO,WACnB0D,EAAY8Z,KAAc1sB,OAA0D,QAAjD2uB,EAAwB1f,EAAWG,gBAAgD,IAA1Buf,EAAmCA,EAAiD1f,EAAWE,YAC/L,OAAO4d,GAA2Bpe,EAAOnL,EAAaoP,KACrD,CAACqV,EAAUzkB,IACV0L,EAAWge,IAAc,WAC3B,MAAO,CACLxY,SAAUsL,IACVrnB,IAAK6K,EAAY7K,OAElB,CAACqnB,EAAaxc,EAAY7K,MAEzBi2B,EAAc1B,IAAc,SAAUU,GACxC,IAAIG,EAAY7e,IAChB,OAAO0e,EAAUlZ,SAASsZ,GAAGD,EAAUrZ,WAAakZ,EAAUj1B,MAAQo1B,EAAUp1B,IAAMi1B,EAAYG,IACjG,CAAC7e,IAEJie,IAAY,WACV,IAAI5F,EAAe0F,GAAyBhF,EAAS3f,QAAS9E,GAAa,SAAUqrB,GACnF1G,EAASyG,KACRnB,GAGH,OADAtF,EAASyG,GACFrH,EAAa5O,UACnB,CAAC8U,EAAejqB,EAAaykB,EAAU2G,IAE1C,IAAIE,EAAcxB,GAAWpe,GACzB6f,GAAc,OAAeD,EAAa,GAC1C/zB,EAAQg0B,EAAY,GACpB5G,EAAW4G,EAAY,GAM3B,OAAOh0B,EAAMpC,MAAQ6K,EAAY7K,IAAMuW,IAAWwF,SAAW3Z,EAAM2Z,SAGrE,SAASsa,GAA8BxrB,GACrC,IAAIykB,EAAW6E,KAEXmC,EAAc3B,GAAW,IAEzB4B,GADc,OAAeD,EAAa,GAChB,GAE1BxB,EAAgBjB,KAChBxM,EAAckN,IAAc,WAC9B,IAAIiC,EAMJ,IAAIxgB,EAAQsZ,EAAS3f,QACjB2G,EAAaN,EAAMO,WACnB0D,EAAY8Z,KAAc1sB,OAA0D,QAAjDmvB,EAAwBlgB,EAAWG,gBAAgD,IAA1B+f,EAAmCA,EAAiDlgB,EAAWE,YAC/L,OAAO4d,GAA2Bpe,EAAOnL,EAAaoP,KACrD,CAACqV,EAAUzkB,IACVkR,EAAWsL,IACXyO,EAAkBpB,GAAS3Y,GA8D/B,OA7DAyY,IAAY,WACVsB,EAAgBnmB,QAAUoM,KAE5ByY,IAAY,WACV,IAAIxe,EAAQsZ,EAAS3f,QACjB2G,EAAaN,EAAMO,WACnBqY,EAAe0F,GAAyBte,EAAOnL,GAAa,SAAUqrB,GACxE,IAAIO,EAEJ,IAAK3vB,GAAW,wCACd,OAAOyvB,EAAY,IAGrB,IAAIV,EAAcxO,IAE0C,QAArDoP,EAAwBX,EAAgBnmB,eAA+C,IAA1B8mB,GAAoCA,EAAsBpB,GAAGQ,IAC/HU,EAAYV,GAGdC,EAAgBnmB,QAAUkmB,IACzBf,GAkBH,GAAIxe,EAAWG,SACbT,EAAMO,WAAW2B,oCAAoCzY,MAAK,WACxDq2B,EAAgBnmB,QAAU,KAC1B4mB,EAAY,WAET,CACL,IAAIG,EAEJ,IAAK5vB,GAAW,wCACd,OAAOyvB,EAAY,IAGrB,IAAIV,EAAcxO,IAE2C,QAAtDqP,EAAyBZ,EAAgBnmB,eAAgD,IAA3B+mB,GAAqCA,EAAuBrB,GAAGQ,IAClIU,EAAYV,GAGdC,EAAgBnmB,QAAUkmB,EAG5B,OAAOjH,EAAa5O,UACnB,CAAC8U,EAAezN,EAAaxc,EAAaykB,IACtCvT,EAQT,SAAS4a,GAAuB9rB,GAU9B,OALI/D,GAAW,kCAEb4rB,GAAiB7nB,GAGZ,CACL+rB,mBAAoBb,GACpBc,oBAAqBhC,GACrBiC,eAAgBrB,GAChBsB,OAAQV,IACRtC,KAAc3sB,MAAMyD,GAUxB,SAASmsB,GAAensB,GAKtB,IAAIykB,EAAW6E,KAEf,OAAOS,GADQ+B,GAAuB9rB,GACNA,EAAaykB,GAQ/C,SAAS2H,GAAkB7M,GAKzB,IAAIkF,EAAW6E,KACf,OAAOI,IAAc,SAAUlK,GAC7BgK,GAAiB/E,EAAS3f,QAASya,EAAaC,KAC/C,CAACiF,EAAUlF,IAiEhB,SAAS8M,GAAmDrsB,GAc1D,OALI/D,GAAW,kCAEb4rB,GAAiB7nB,GAGZkrB,GAA0ClrB,GAGnD,SAASssB,GAA2CtsB,GAKlD,IAAIykB,EAAW6E,KAEf,OAAOS,GADQsC,GAAmDrsB,GAClCA,EAAaykB,GAW/C,IAAI8H,GA1EJ,SAAwBhN,GAKtB,MAAO,CAAC4M,GAAe5M,GAAc6M,GAAkB7M,KAqErDgN,GA5DJ,SAAgChN,GAK9B,MAAO,CAACuM,GAAuBvM,GAAc6M,GAAkB7M,KAuD7DgN,GAKcJ,GALdI,GAMsBT,GANtBS,GA7FJ,SAA6BhN,GAK3B,IAAIkF,EAAW6E,KACf,OAAOI,IAAc,WACnBF,GAAiB/E,EAAS3f,QAASya,EAAa0J,MAC/C,CAACxE,EAAUlF,KAqFZgN,GAQiBH,GARjBG,GAUkDF,GAVlDE,GAW0CD,GAX1CC,GARJ,SAAoDhN,GAKlD,MAAO,CAAC+M,GAA2C/M,GAAc6M,GAAkB7M,KAsIrF,IACIiN,GAAiB7S,GACjB8S,GAAkB/sB,GAAYX,cAC9B2tB,GAAYhtB,GAAYO,QAExB0sB,GAAgBjG,GAChBkG,GAAwBnY,GAA4B5X,oBACpDgwB,GAA2BpY,GAA4BG,uBACvDkY,GAAwB1T,GACxB2T,GAAkBzM,GAAkBN,cACpCgN,GAAgB,cAChBC,GAAc,YACdC,GAAW,SACXC,GAAa,WACbC,GAAUxS,GAAmBL,MAEjC,SAAS8S,GAA2BrvB,GAClC,IAAIymB,EAAWkI,KACfM,IAAY,WAEV,OADUxI,EAAS3f,QAAQ8Y,wBAAwB5f,GACxCmX,UACV,CAACnX,EAAUymB,IAoJhB,SAAS6I,GAAaniB,EAAOgU,GAC3B,IAAI9T,EAEAI,EAAaN,EAAMO,WACnBpN,EAAwD,QAAhD+M,EAAuBI,EAAWG,gBAA+C,IAAzBP,EAAkCA,EAAuBI,EAAWE,YACpI/X,EAAOurB,EAASG,oBAAoB5T,WAAWC,YACnD6gB,IAAe,WAGb,IAFA,IAAIe,EAAe,IAAI/jB,IAEdgkB,EAAM,EAAGC,EAAO,CAACnvB,EAAKqO,WAAWtY,OAAQT,EAAK+Y,WAAWtY,QAASm5B,EAAMC,EAAK36B,OAAQ06B,IAAO,CACnG,IAGIE,EADAC,EAAcl8B,EAFPg8B,EAAKD,IAKhB,IACE,IAAKG,EAAY16B,MAAOy6B,EAAUC,EAAYx7B,KAAKe,MAAO,CACxD,IAEI06B,EAAsBC,EAFtB14B,EAAMu4B,EAAQv6B,OAIyC,QAArDy6B,EAAuBtvB,EAAKqO,WAAWjR,IAAIvG,UAA2C,IAAzBy4B,OAAkC,EAASA,EAAqBn2B,aAAqE,QAArDo2B,EAAuBj6B,EAAK+Y,WAAWjR,IAAIvG,UAA2C,IAAzB04B,OAAkC,EAASA,EAAqBp2B,WAAai1B,GAAUv3B,GAAK24B,4BAC1SP,EAAarjB,IAAI/U,IAGrB,MAAO3B,GACPm6B,EAAYv6B,EAAEI,GACd,QACAm6B,EAAYr6B,KAIhBi6B,EAAar4B,SAAQ,SAAUC,GAC7B03B,GAAyB1hB,EAAO,IAAIyhB,GAAsBz3B,GAAMvB,EAAK+Y,WAAW9M,IAAI1K,GAAO4B,EAAkBnD,EAAK+Y,WAAWjR,IAAIvG,IAAQs3B,OAE3IthB,EAAMwI,cAAa,SAAUpc,GAC3B,OAAOzC,EAAcA,EAAc,GAAIyC,GAAQ,GAAI,CACjDiV,QAAS2S,EAAS4O,gBAa1B,IAAIC,GA3GJ,WACE,IAAIvJ,EAAWkI,KAEXsB,EAAcd,IAAW,WAC3B,OAAOJ,GAAgBtI,EAAS3f,YAE9BopB,GAAc,OAAeD,EAAa,GAC1C9O,EAAW+O,EAAY,GACvBC,EAAcD,EAAY,GAE1BE,EAAmB/G,GAAmBlI,GACtC4I,EAAYmF,KACZmB,EAAanB,KAqBjB,GApBAG,GAA2BL,IAAc,SAAU7hB,GACjD,OAAOgjB,EAAYpB,GAAgB5hB,MAClC,KAEH8hB,IAAY,WACV,IAGMqB,EAHFnZ,EAAUgK,EAAS/B,SAEnB2K,EAAUjjB,UAAYsoB,KAGxB1wB,OAAOsrB,aAAaD,EAAUjjB,SAC9BijB,EAAUjjB,QAAU,KAC2B,QAA9CwpB,EAAsBD,EAAWvpB,eAA6C,IAAxBwpB,GAA0CA,EAAoB/7B,KAAK87B,GAC1HA,EAAWvpB,QAAU,MAGvB,OAAOqQ,IACN,CAACgK,IAGAiP,IAAqBjP,IAAaiO,GAAS,CAG3C,IAAImB,EADN,GAAIxG,EAAUjjB,QAGZpI,OAAOsrB,aAAaD,EAAUjjB,SAC9BijB,EAAUjjB,QAAU,KAC4B,QAA/CypB,EAAuBF,EAAWvpB,eAA8C,IAAzBypB,GAA2CA,EAAqBh8B,KAAK87B,GAC7HA,EAAWvpB,QAAU,KAGvBupB,EAAWvpB,QAAUqa,EAAS/B,SAC9B2K,EAAUjjB,QAAUpI,OAAO2hB,YAAW,WACpC,IAAImQ,EAEJzG,EAAUjjB,QAAU,KAC4B,QAA/C0pB,EAAuBH,EAAWvpB,eAA8C,IAAzB0pB,GAA2CA,EAAqBj8B,KAAK87B,GAC7HA,EAAWvpB,QAAU,OACpBgoB,IAGL,OAAO3N,GAqDL6O,GAEYV,GAFZU,GAPJ,WACE,IAAIvJ,EAAWkI,KACf,OAAOK,IAAc,SAAU7N,GAC7B,OAAOmO,GAAa7I,EAAS3f,QAASqa,KACrC,CAACsF,KAGFuJ,GAvHJ,SAAsChwB,GACpCqvB,GAA2BL,IAAc,SAAU7hB,GACjD,IAAIgU,EAAW4N,GAAgB5hB,EAAO,UAClCijB,EAAmBrB,GAAgB5hB,EAAO,YAC9CnN,EAAS,CACPmhB,SAAUA,EACViP,iBAAkBA,MAEnB,CAACpwB,MAuHFywB,GAAiB7d,GACjB8d,GAAgBhI,GAUpB,IAAIiI,GARJ,WACE,IAAIlK,EAAWiK,KACf,OAAO,SAAUE,GACf,IAAIz5B,EAAMy5B,EAAOz5B,IACjB,OAAOs5B,GAAehK,EAAS3f,QAAS2f,EAAS3f,QAAQ4G,WAAWC,YAAaxW,KAKjF05B,GAAcxyB,GAAiBC,UAC/BwyB,GAAepI,GACfqI,GAAgBrI,GAChBsI,GAAY,UAwBhB,IAAIC,GAtBJ,WAG6B,mBAAvBJ,KAActyB,MAEhBuD,QAAQC,KAAK,mLAGf,IAAIoL,EAAQ4jB,KAAgBjqB,QAC5B,OAAOkqB,IAAU,WASf,OAPA,SAAsBE,GACpB,IAAI/rB,EAAW+rB,EAAO/rB,SACtB,OAAoB,gBAAoB2rB,GAAc,CACpD3J,eAAgBha,GACfhI,MAIJ,CAACgI,KAIFgkB,GAAsBj0B,EAAkB7C,kBACxC+2B,GAAmBxe,GACnBye,GAAkB3vB,GAAYX,cAC9BuwB,GAAY5vB,GAAYO,QACxBsvB,GAAkB9a,GAA4BX,cAC9C0b,GAA6B/a,GAA4BC,yBACzD+a,GAA0Bhb,GAA4BT,sBACtD0b,GAA6Bjb,GAA4BpB,yBAE7D,SAASsc,GAAO3vB,GACd,MAA+C,SAAxCsvB,GAAUtvB,EAAY7K,KAAK8b,SAGpC,IAAI2e,GAAwC,WAC1C,SAASA,EAAyBzkB,EAAOiE,GACvC,IAAIygB,EAAUz5B,MAEd,OAAgBA,KAAMw5B,GAEtB34B,EAAgBb,KAAM,cAAU,GAEhCa,EAAgBb,KAAM,kBAAc,GAEpCa,EAAgBb,KAAM,gBAAY,GAElCa,EAAgBb,KAAM,OAAO,SAAU4J,GACrC,GAAI6vB,EAAQC,SAASjwB,IAAIG,EAAY7K,KAEnC,OAAO06B,EAAQC,SAASp0B,IAAIsE,EAAY7K,KAG1C,IAAKw6B,GAAO3vB,GACV,MAAM3J,EAAW,0DAGnB,IAAI6a,EAAWse,GAA2BK,EAAQtT,OAAQvc,EAAa6vB,EAAQE,YAE/E,GAAuB,aAAnB7e,EAAS3Z,MACX,OAAO2Z,EAASzZ,SACX,KAAuB,aAAnByZ,EAAS3Z,MACZ2Z,EAASzZ,SAETpB,EAAW,wBAAwBiB,OAAO0I,EAAY7K,IAAK,uDAIrE8B,EAAgBb,KAAM,OAAO,SAAUmpB,EAAatM,GAClD,IAAK0c,GAAOpQ,GACV,MAAMlpB,EAAW,0DAGnB,GAA8B,mBAAnB4c,EAA+B,CACxC,IAAInO,EAAU+qB,EAAQn0B,IAAI6jB,GAE1BsQ,EAAQC,SAASx0B,IAAIikB,EAAYpqB,IAAK8d,EAAenO,SAIrDsqB,GAAiBS,EAAQtT,OAAQgD,EAAYpqB,IAAK,OAElD06B,EAAQC,SAASx0B,IAAIikB,EAAYpqB,IAAK8d,MAI1Chc,EAAgBb,KAAM,SAAS,SAAUmpB,GACvCsQ,EAAQv0B,IAAIikB,EAAa8P,OAG3Bj5B,KAAKmmB,OAASpR,EACd/U,KAAK25B,WAAa3gB,EAClBhZ,KAAK05B,SAAW,IAAIz0B,IAoCtB,OA/BA,OAAau0B,EAA0B,CAAC,CACtCz6B,IAAK,wBACLhC,MAAO,WACL,GAA2B,IAAvBiD,KAAK05B,SAASrsB,KAChB,OAAOrN,KAAK25B,WAGd,IAGIC,EAHAnc,EAAW0b,GAAgBn5B,KAAK25B,YAEhCE,EAAcx+B,EAA2B2E,KAAK05B,UAGlD,IACE,IAAKG,EAAYh9B,MAAO+8B,EAAUC,EAAY99B,KAAKe,MAAO,CACxD,IAAIg9B,GAAgB,OAAeF,EAAQ78B,MAAO,GAC9CiR,EAAI8rB,EAAc,GAClB3tB,EAAI2tB,EAAc,GAEtBR,GAA2B7b,EAAUzP,EAAG+qB,GAAoB5sB,KAE9D,MAAO/O,GACPy8B,EAAY78B,EAAEI,GACd,QACAy8B,EAAY38B,IAId,OADAm8B,GAAwBr5B,KAAKmmB,OAAQ1I,GAC9BA,MAIJ+b,EA7FmC,GA0G5C,IAAIO,GAVJ,SAAuBhlB,GACrB,OAAO,SAAU1K,GACf0K,EAAMwI,cAAa,SAAUvE,GAC3B,IAAIghB,EAAY,IAAIR,GAAyBzkB,EAAOiE,GAEpD,OADA3O,EAAG2vB,GACIA,EAAUC,6BAQnBC,GAAyBH,GACzBI,GAAsCn+B,OAAOkH,OAAO,CACtD6B,UAAW,KACXq1B,cAAeF,KAmBjB,IAEIG,GARJ,SAAmBC,EAAWp6B,GAC5B,IAAKo6B,EACH,MAAM,IAAIl6B,MAAMF,IAOhBq6B,GAAkBJ,GAAuBC,cACzCI,GAAiBjX,GACjBkX,GAAkBnxB,GAAYX,cAC9B+xB,GAAgBpK,GAChBqK,GAAuBtc,GAA4BmB,mBACnDob,GAAmBvc,GAA4BD,eAC/Cyc,GAAkB3Q,GAAkBN,cACpCkR,GAAiBlD,GACjBmD,GAAgB,cAEhBC,GAAW,SAASA,KACtB,OAAgBh7B,KAAMg7B,IAGpBC,GAAW,IAAID,GAEnB,SAASE,GAAenmB,EAAO1K,EAAI8wB,EAAMC,GACvC,IACIC,EAoDEC,EArDFnoB,EAAM8nB,IAEVT,IAAe,WACb,IAAIe,EAAS,4YAEb,GAAkB,mBAAPlxB,EACT,MAAMpK,EAAWs7B,GAMnB,IAAIC,EAAoBtjB,GAAiBxZ,EAAcA,EAAc,GAAI08B,MAAAA,EAAuDA,EAAiB,IAAK,GAAI,CAExJl2B,IAAK,SAAasE,EAAM6E,GACtB,OAAOusB,GAAiB7lB,EAAOvL,EAAM6E,IAEvCotB,MAAO,SAAejyB,GACpB,OAAOoxB,GAAiB7lB,EAAOvL,EAAMixB,KAEvCiB,QAAS,SAAiBlyB,GACxB,OAAOmxB,GAAqB5lB,EAAOvL,IAErC0tB,aAAc,SAAsBnO,GAClC,OAAO+R,GAAe/lB,EAAOgU,IAE/B4S,kBAAmB,SAA2BC,GAC5C,OAAOrB,GAAgBxlB,EAAhBwlB,CAAuBqB,MAE9B,CACF7S,SAAU,WACR,IAAIA,EAAW8R,GAAgB9lB,GAE/B,OADAsmB,EAAkBtS,EAAS/B,SACpB+B,KAGPnhB,EAAWyC,EAAGmxB,GAElB,GAAwB,mBAAb5zB,EACT,MAAM3H,EAAWs7B,GAGnBpoB,EAAMvL,EAASnJ,WAAM,GAAQ,OAAmB08B,OAE/ChoB,aAAe6nB,IAAwHX,IAAiB,GAEvJ75B,EAAiB2S,IACnBA,EAAI0oB,SAAQ,WACV,IAAIC,EAEqC,QAAxCA,EAAmBT,SAAkD,IAArBS,GAAuCA,OAKhD,QAAzCR,EAAoBD,SAAmD,IAAtBC,GAAwCA,IAG5F,OAAOnoB,EAgBT,IAAI4oB,GACcb,GADda,GAbJ,SAA2B1xB,EAAIyK,GAC7B,IAAIuZ,EAAWqM,KACf,OAAOK,IACP,WACE,IAAK,IAAIiB,EAAQp9B,UAAUlC,OAAQy+B,EAAO,IAAIx/B,MAAMqgC,GAAQC,EAAQ,EAAGA,EAAQD,EAAOC,IACpFd,EAAKc,GAASr9B,UAAUq9B,GAG1B,OAAOf,GAAe7M,EAAS3f,QAASrE,EAAI8wB,KACnC,MAARrmB,EAAe,GAAG5T,QAAO,OAAmB4T,GAAO,CAACuZ,SAAahuB,IAQlE67B,GAAgB5L,GAChB6L,GAAuB9d,GAA4BmB,mBACnD4c,GAAgB,cAUpB,IAAIC,GARJ,SAA4BzyB,GAC1B,IAAIykB,EAAW6N,KACf,OAAOE,IAAc,WACnB,IAAIrnB,EAAQsZ,EAAS3f,QACrBytB,GAAqBpnB,EAAOnL,KAC3B,CAACA,EAAaykB,KAIfiO,GAAkBnC,GAAuBC,cACzCmC,GAAgBjM,GAChBkM,GAAY,UAmBhB,IAAIC,GAjBJ,SAA8BpyB,EAAIyK,GAChC,IAAIuZ,EAAWkO,KACf,OAAOC,IAAU,WACf,OAAO,WACL,IAAK,IAAIE,EAAQ99B,UAAUlC,OAAQy+B,EAAO,IAAIx/B,MAAM+gC,GAAQC,EAAS,EAAGA,EAASD,EAAOC,IACtFxB,EAAKwB,GAAU/9B,UAAU+9B,GAG3B,IAAIC,EAAeN,GAAgBjO,EAAS3f,SAC5CkuB,GAAa,SAAUC,GACrBxyB,EAAGwyB,GAAsBp+B,WAAM,EAAQ08B,SAGlC,MAARrmB,EAAe,GAAG5T,QAAO,OAAmB4T,GAAO,CAACuZ,SAAahuB,IAwBlEy8B,GARe,SAASC,EAAahgC,IACvC,OAAgBiD,KAAM+8B,GAEtBl8B,EAAgBb,KAAM,aAAS,GAE/BA,KAAKjD,MAAQA,GAMXigC,GAAmBF,GACnBG,GAAgCjhC,OAAOkH,OAAO,CAChD6B,UAAW,KACXg4B,aAAcC,KAEZE,GAAyBj3B,GAAiBO,qBAE1C22B,GAAgC,SAAUC,IAC5C,OAAUD,EAAkBC,GAE5B,IAAIC,EAAWl+B,EAAag+B,GAE5B,SAASA,IAGP,OAFA,OAAgBn9B,KAAMm9B,GAEfE,EAAS5+B,MAAMuB,KAAMpB,WAG9B,OAAOu+B,EAX2B,EAYpB,OAAiB/8B,QAE7Bk9B,GAAyB,WAC3B,SAASA,EAAUC,GAGjB,IAAIC,EAAgBC,EAAgBC,GAFpC,OAAgB19B,KAAMs9B,GAItBz8B,EAAgBb,KAAM,aAAS,GAE/Ba,EAAgBb,KAAM,iBAAa,GAEnCa,EAAgBb,KAAM,aAAS,GAE/Ba,EAAgBb,KAAM,cAAU,GAEhCa,EAAgBb,KAAM,cAAU,GAEhCa,EAAgBb,KAAM,qBAAiB,GAEvCA,KAAK29B,MAAQJ,MAAAA,OAAyC,EAASA,EAAQjhC,KACvE0D,KAAK49B,UAAY,EACjB59B,KAAK6P,MAAQ,KACb7P,KAAK69B,OAAgG,QAAtFL,EAAiBD,MAAAA,OAAyC,EAASA,EAAQO,aAAsC,IAAnBN,EAA4BA,EAAiB,aAC1Jx9B,KAAK+9B,OAAgG,QAAtFN,EAAiBF,MAAAA,OAAyC,EAASA,EAAQS,aAAsC,IAAnBP,EAA4BA,EAAiB,aAC1Jz9B,KAAKi+B,cAAqH,QAApGP,EAAwBH,MAAAA,OAAyC,EAASA,EAAQW,oBAAoD,IAA1BR,EAAmCA,EAAwB,SAAU3Z,GACrM,OAAOA,GAyNX,OArNA,OAAauZ,EAAW,CAAC,CACvBv+B,IAAK,OACLhC,MAAO,WACL,OAAOiD,KAAK49B,YAEb,CACD7+B,IAAK,OACLhC,MAAO,WACL,OAAOiD,KAAK6P,QAEb,CACD9Q,IAAK,MACLhC,MAAO,SAAaohC,EAAcC,GAChC,IAAIC,EAEJ,OAA0E,QAAlEA,EAAoBr+B,KAAKs+B,YAAYH,EAAcC,UAA6C,IAAtBC,OAA+B,EAASA,EAAkBthC,QAE7I,CACDgC,IAAK,cACLhC,MAAO,SAAqBohC,EAAcC,GACxC,GAAkB,MAAdp+B,KAAK6P,MAOT,IAFA,IAAIrG,EAAOxJ,KAAK6P,MAETrG,GAAM,CAGX,GAFA40B,MAAAA,GAAoDA,EAASG,YAAY/0B,GAEvD,SAAdA,EAAK+B,KAGP,OAFAvL,KAAK69B,OAAOr0B,GAELA,EAGT,IAAIg1B,EAAYx+B,KAAKi+B,cAAcE,EAAa30B,EAAK2P,UAErD3P,EAAOA,EAAKi1B,SAASn5B,IAAIk5B,MAK5B,CACDz/B,IAAK,MACLhC,MAAO,SAAa2hC,EAAO3hC,EAAOqhC,GAChC,IAAIO,EAAU3+B,KAEV4+B,EAAU,WACZ,IAAIC,EAAQC,EAAQC,EAAcC,EAI9Bx1B,EACAy1B,EAGAC,EADAC,EAAc9jC,EAA2BqjC,GAG7C,IACE,IAAKS,EAAYtiC,MAAOqiC,EAAUC,EAAYpjC,KAAKe,MAAO,CACxD,IAIIsiC,EAAOC,EAAuBC,EAJ9BC,GAAgB,OAAeL,EAAQniC,MAAO,GAC9Coc,EAAUomB,EAAc,GACxBf,EAAYe,EAAc,GAM1B9vB,EAAOkvB,EAAQ9uB,MAEnB,GAAgE,UAA3DJ,MAAAA,OAAmC,EAASA,EAAKlE,MACpD,MAAMozB,EAAQa,oBAIhB,IAAIrd,EAAS3Y,EAUb,GAAkB,YARlBA,EAA0B,QAAlB41B,EADR51B,EAAO2Y,EAASA,EAAOsc,SAASn5B,IAAI25B,GAAaxvB,SACL,IAAV2vB,EAAmBA,EAAQ,CAC3D7zB,KAAM,SACN4N,QAASA,EACTgJ,OAAQA,EACRsc,SAAU,IAAIx5B,IACdg6B,UAAWA,IAGJ1zB,MAAqB/B,EAAK2P,UAAYA,EAC7C,MAAMwlB,EAAQa,oBAIhBrd,MAAAA,GAAgDA,EAAOsc,SAASv5B,IAAI+5B,EAAWz1B,GAC/E40B,MAAAA,GAAuG,QAAlDiB,EAAwBjB,EAASG,mBAAmD,IAA1Bc,GAA4CA,EAAsBljC,KAAKiiC,EAAU50B,GAEhMy1B,EAAYN,EAAQV,cAAcO,GAClCG,EAAQ9uB,MAA0C,QAAjCyvB,EAAcX,EAAQ9uB,aAAmC,IAAhByvB,EAAyBA,EAAc91B,GAInG,MAAOpM,GACP+hC,EAAYniC,EAAEI,GACd,QACA+hC,EAAYjiC,IAGd,IAAIuiC,EAAUj2B,EAA2B,QAAnBq1B,EAASr1B,SAA6B,IAAXq1B,OAAoB,EAASA,EAAOJ,SAASn5B,IAAI25B,GAAaN,EAAQ9uB,MAEvH,GAAe,MAAX4vB,IAAqC,SAAjBA,EAAQl0B,MAAmBk0B,EAAQR,YAAcA,GACvE,MAAMN,EAAQa,oBAIhB,IAAIE,EAAW,CACbn0B,KAAM,OACNxO,MAAOA,EACPolB,OAAQ3Y,EACRy1B,UAAWA,GAGO,QAAnBH,EAASt1B,SAA6B,IAAXs1B,GAA6BA,EAAOL,SAASv5B,IAAI+5B,EAAWS,GACxFf,EAAQ9uB,MAA2C,QAAlCkvB,EAAeJ,EAAQ9uB,aAAoC,IAAjBkvB,EAA0BA,EAAeW,EACpGf,EAAQf,YAERe,EAAQZ,OAAO2B,GAEftB,MAAAA,GAAwG,QAAnDY,EAAyBZ,EAASG,mBAAoD,IAA3BS,GAA6CA,EAAuB7iC,KAAKiiC,EAAUsB,IAGrM,IACEd,IACA,MAAOz+B,GAGP,KAAIA,aAAiBg9B,IAInB,MAAMh9B,EAHNH,KAAKyF,QACLm5B,OAOL,CACD7/B,IAAK,SACLhC,MAAO,SAAiB4iC,GACtB,IAAIlwB,EAAOzP,KAAKyP,OAEhB,IAAKA,EACH,OAAO,EAGT,GAAIkwB,IAASlwB,EAGX,OAFAzP,KAAK6P,MAAQ,KACb7P,KAAK49B,UAAY,GACV,EAOT,IAHA,IAAIp0B,EAAOm2B,EAAKxd,OACZ8c,EAAYU,EAAKV,UAEdz1B,GAAM,CACX,IAAIo2B,EAIJ,GAFAp2B,EAAKi1B,SAASt0B,OAAO80B,GAEjBz1B,IAASiG,EAQX,OAP2B,IAAvBjG,EAAKi1B,SAASpxB,MAChBrN,KAAK6P,MAAQ,KACb7P,KAAK49B,UAAY,GAEjB59B,KAAK49B,aAGA,EAKT,GAAIp0B,EAAKi1B,SAASpxB,KAAO,EACvB,MAIF4xB,EAAgC,QAAnBW,EAASp2B,SAA6B,IAAXo2B,OAAoB,EAASA,EAAOX,UAC5Ez1B,EAAOA,EAAK2Y,OAId,KAAO3Y,IAASiG,EAAMjG,EAAOA,EAAK2Y,OAChC,GAAY,MAAR3Y,EACF,OAAO,EAKX,OADAxJ,KAAK49B,aACE,IAER,CACD7+B,IAAK,QACLhC,MAAO,WACLiD,KAAK49B,UAAY,EACjB59B,KAAK6P,MAAQ,OAEd,CACD9Q,IAAK,oBACLhC,MAAO,WACL,IAAI8iC,EAA6B3C,KAA2B,wIAAoJ,mOAEhN,MADAz0B,GAA4Bo3B,GAA4C,MAAd7/B,KAAK29B,MAAgB,MAAMz8B,OAAOlB,KAAK29B,OAAS,KACpG,IAAIR,OAIPG,EAjPoB,GAuPzBwC,GAHmB,CACrBxC,UAAWA,IAE6BA,UACtCyC,GAAkC/jC,OAAOkH,OAAO,CAClD6B,UAAW,KACXu4B,UAAWwC,KAuKTE,GAHkB,CACpBC,SAlK0B,WAC1B,SAASA,EAAS1C,GAGhB,IAAI2C,GAFJ,OAAgBlgC,KAAMigC,GAItBp/B,EAAgBb,KAAM,gBAAY,GAElCa,EAAgBb,KAAM,aAAS,GAE/Ba,EAAgBb,KAAM,aAAS,GAE/Ba,EAAgBb,KAAM,aAAS,GAE/Ba,EAAgBb,KAAM,YAAQ,GAE9Ba,EAAgBb,KAAM,kBAAc,GAEpCA,KAAKmgC,SAAW5C,EAAQ6C,QACxBpgC,KAAK8P,MAAQ,EACb9P,KAAKqgC,MAAQ,KACbrgC,KAAKsgC,MAAQ,KACbtgC,KAAKsB,KAAO,IAAI2D,IAChBjF,KAAKugC,WAAoD,QAAtCL,EAAkB3C,EAAQiD,cAAwC,IAApBN,EAA6BA,EAAkB,SAAU/zB,GACxH,OAAOA,GAsIX,OAlIA,OAAa8zB,EAAU,CAAC,CACtBlhC,IAAK,OACLhC,MAAO,WACL,OAAOiD,KAAKqgC,QAEb,CACDthC,IAAK,OACLhC,MAAO,WACL,OAAOiD,KAAKsgC,QAEb,CACDvhC,IAAK,OACLhC,MAAO,WACL,OAAOiD,KAAK8P,QAEb,CACD/Q,IAAK,UACLhC,MAAO,WACL,OAAOiD,KAAKmgC,WAEb,CACDphC,IAAK,MACLhC,MAAO,SAAagC,GAClB,OAAOiB,KAAKsB,KAAKmI,IAAIzJ,KAAKugC,WAAWxhC,MAEtC,CACDA,IAAK,MACLhC,MAAO,SAAagC,GAClB,IAAI0hC,EAAYzgC,KAAKugC,WAAWxhC,GAE5ByK,EAAOxJ,KAAKsB,KAAKgE,IAAIm7B,GAEzB,GAAKj3B,EAKL,OADAxJ,KAAKkF,IAAInG,EAAKyK,EAAKzM,OACZyM,EAAKzM,QAEb,CACDgC,IAAK,MACLhC,MAAO,SAAagC,EAAKglB,GACvB,IAAI0c,EAAYzgC,KAAKugC,WAAWxhC,GAEbiB,KAAKsB,KAAKgE,IAAIm7B,IAG/BzgC,KAAKmK,OAAOpL,GAGd,IAAI2hC,EAAO1gC,KAAK0gC,OACZl3B,EAAO,CACTzK,IAAKA,EACL4hC,MAAOD,EACPE,KAAM,KACN7jC,MAAOgnB,GAGL2c,EACFA,EAAKE,KAAOp3B,EAEZxJ,KAAKsgC,MAAQ92B,EAGfxJ,KAAKsB,KAAK4D,IAAIu7B,EAAWj3B,GAEzBxJ,KAAKqgC,MAAQ72B,EACbxJ,KAAK8P,QAEL9P,KAAK6gC,oBAEN,CACD9hC,IAAK,kBACLhC,MAAO,WACDiD,KAAKqN,OAASrN,KAAKogC,WACrBpgC,KAAK8gC,cAGR,CACD/hC,IAAK,YACLhC,MAAO,WACL,IAAIgkC,EAAO/gC,KAAK+gC,OAEZA,GACF/gC,KAAKmK,OAAO42B,EAAKhiC,OAGpB,CACDA,IAAK,SACLhC,MAAO,SAAiBgC,GACtB,IAAI0hC,EAAYzgC,KAAKugC,WAAWxhC,GAEhC,GAAKiB,KAAK8P,OAAU9P,KAAKsB,KAAKmI,IAAIg3B,GAAlC,CAIA,IAAIj3B,EAAO7I,EAAkBX,KAAKsB,KAAKgE,IAAIm7B,IACvCE,EAAQn3B,EAAKm3B,MACbC,EAAOp3B,EAAKo3B,KAEZD,IACFA,EAAMC,KAAOp3B,EAAKo3B,MAGhBA,IACFA,EAAKD,MAAQn3B,EAAKm3B,OAGhBn3B,IAASxJ,KAAK0gC,SAChB1gC,KAAKqgC,MAAQM,GAGXn3B,IAASxJ,KAAK+gC,SAChB/gC,KAAKsgC,MAAQM,GAGf5gC,KAAKsB,KAAK6I,OAAOs2B,GAEjBzgC,KAAK8P,WAEN,CACD/Q,IAAK,QACLhC,MAAO,WACLiD,KAAK8P,MAAQ,EACb9P,KAAKqgC,MAAQ,KACbrgC,KAAKsgC,MAAQ,KACbtgC,KAAKsB,KAAO,IAAI2D,QAIbg7B,EA9JmB,IAoKYA,SACpCe,GAAiChlC,OAAOkH,OAAO,CACjD6B,UAAW,KACXk7B,SAAUD,KAERiB,GAAaD,GAAkBf,SAC/BiB,GAAcnB,GAAmBzC,UA+BrC,IAAI6D,GA7BJ,SAAsBC,GACpB,IAAI9kC,EAAO8kC,EAAO9kC,KACd8jC,EAAUgB,EAAOhB,QACjBiB,EAAsBD,EAAOlD,aAC7BA,OAAuC,IAAxBmD,EAAiC,SAAUl1B,GAC5D,OAAOA,GACLk1B,EACAC,EAAW,IAAIL,GAAW,CAC5Bb,QAASA,IAEPmB,EAAQ,IAAIL,GAAY,CAC1B5kC,KAAMA,EACN4hC,aAAcA,EACdJ,MAAO,SAAet0B,GACpB83B,EAASp8B,IAAIsE,GAAM,IAErBw0B,MAAO,SAAex0B,GACpB,IAAIg4B,EAAUF,EAASP,OACvBO,EAASp8B,IAAIsE,GAAM,GAEfg4B,GAAWD,EAAMl0B,OAAS+yB,GAC5BmB,EAAMp3B,OAAOq3B,EAAQziC,QAK3B,OAAOwiC,GAMT,SAASE,GAAU7gC,EAAG0lB,EAAKvnB,GAGzB,GAAiB,iBAAN6B,IAAmBA,EAAE8gC,SAAS,OAAS9gC,EAAE8gC,SAAS,MAC3D,MAAO,IAAKxgC,OAAON,EAAG,KAIxB,cAAeA,GACb,IAAK,YACH,MAAO,GAGT,IAAK,UACH,OAAOA,EAAI,OAAS,QAEtB,IAAK,SACL,IAAK,SAEH,OAAO6nB,OAAO7nB,GAEhB,IAAK,SAEH,OAAO+gC,KAAKF,UAAU7gC,GAExB,IAAK,WACH,IAAuE,KAAlE0lB,MAAAA,OAAiC,EAASA,EAAIsb,gBACjD,MAAM3hC,EAAW,uDAGnB,MAAO,cAAciB,OAAON,EAAEtE,KAAM,OAGxC,GAAU,OAANsE,EACF,MAAO,OAKP,IAAIihC,EADN,GAAiB,iBAANjhC,EAGT,OAAiD,QAAzCihC,EAAkBF,KAAKF,UAAU7gC,UAAoC,IAApBihC,EAA6BA,EAAkB,GAI1G,GAAIrhC,EAAiBI,GACnB,MAAO,cAIT,GAAIjF,MAAMC,QAAQgF,GAChB,MAAO,IAAIM,OAAON,EAAEsB,KAAI,SAAUiK,EAAGxP,GACnC,OAAO8kC,GAAUt1B,EAAGma,EAAK3pB,EAAET,eACzB,KAON,GAAwB,mBAAb0E,EAAEkhC,OAEX,OAAOL,GAAU7gC,EAAEkhC,OAAO/iC,GAAMunB,EAAKvnB,GAKvC,GAAI6B,aAAaqE,IAAK,CACpB,IAGI88B,EAHAjhC,EAAM,GAENkhC,EAAc3mC,EAA2BuF,GAG7C,IACE,IAAKohC,EAAYnlC,MAAOklC,EAAUC,EAAYjmC,KAAKe,MAAO,CACxD,IAAImlC,GAAgB,OAAeF,EAAQhlC,MAAO,GAC9CiR,EAAIi0B,EAAc,GAClB91B,EAAI81B,EAAc,GAGtBnhC,EAAiB,iBAANkN,EAAiBA,EAAIyzB,GAAUzzB,EAAGsY,IAAQna,GAEvD,MAAO/O,GACP4kC,EAAYhlC,EAAEI,GACd,QACA4kC,EAAY9kC,IAGd,OAAOukC,GAAU3gC,EAAKwlB,EAAKvnB,GAK7B,OAAI6B,aAAawS,IACRquB,GAAU9lC,MAAMY,KAAKqE,GAAGshC,MAAK,SAAUtR,EAAGC,GAC/C,OAAO4Q,GAAU7Q,EAAGtK,GAAK6b,cAAcV,GAAU5Q,EAAGvK,OAClDA,EAAKvnB,QAIIsB,IAAX5E,QAA8C,MAAtBmF,EAAEnF,OAAOC,WAAmD,mBAAvBkF,EAAEnF,OAAOC,UAEjE+lC,GAAU9lC,MAAMY,KAAKqE,GAAI0lB,EAAKvnB,GAIhC,IAAImC,OAAOlF,OAAOiC,KAAK2C,GAAGxC,QAAO,SAAU4P,GAChD,YAAgB3N,IAATO,EAAEoN,MACRk0B,OACFhgC,KAAI,SAAU8L,GACb,MAAO,GAAG9M,OAAOugC,GAAUzzB,EAAGsY,GAAM,KAAKplB,OAAOugC,GAAU7gC,EAAEoN,GAAIsY,EAAKtY,OACpEo0B,KAAK,KAAM,KAuChB,IAAIC,GA1BJ,SAAyBzhC,GACvB,IAAI0lB,EAAM1nB,UAAUlC,OAAS,QAAsB2D,IAAjBzB,UAAU,GAAmBA,UAAU,GAAK,CAC5EgjC,gBAAgB,GAqBlB,OAAOH,GAAU7gC,EAAG0lB,IAIlBgc,GAAcvC,GAAmBzC,UACjCiF,GAAgB,CAClBC,SAAU,YACVC,SAAU,WACVrC,QAASsC,EAAAA,GAiBX,SAASC,GAAeH,GACtB,OAAQA,GACN,IAAK,YACH,OAAO,SAAUze,GACf,OAAOA,GAGX,IAAK,QACH,OAAO,SAAUA,GACf,OAAOse,GAAuBte,IAIpC,MAAM9jB,EAAW,gCAAgCiB,OAAOshC,IAG1D,SAASI,GAAaH,EAAUrC,EAASlC,EAAc5hC,GACrD,OAAQmmC,GACN,IAAK,WAEH,OAAO,IAAIH,GAAY,CACrBhmC,KAAMA,EACN4hC,aAAcA,IAGlB,IAAK,MACH,OAAOiD,GAAoB,CACzB7kC,KAAMA,EACN8jC,QAASz/B,EAAkBy/B,GAC3BlC,aAAcA,IAGlB,IAAK,cACH,OAAOiD,GAAoB,CACzB7kC,KAAMA,EACN8jC,QAAS,EACTlC,aAAcA,IAIpB,MAAMj+B,EAAW,gCAAgCiB,OAAOuhC,IAG1D,IAAII,GAzDJ,WACE,IAAIC,EAASlkC,UAAUlC,OAAS,QAAsB2D,IAAjBzB,UAAU,GAAmBA,UAAU,GAAK2jC,GAC7EQ,EAAkBD,EAAON,SACzBA,OAA+B,IAApBO,EAA6BR,GAAcC,SAAWO,EACjEC,EAAkBF,EAAOL,SACzBA,OAA+B,IAApBO,EAA6BT,GAAcE,SAAWO,EACjEC,EAAiBH,EAAO1C,QACxBA,OAA6B,IAAnB6C,EAA4BV,GAAcnC,QAAU6C,EAE9D3mC,EAAOsC,UAAUlC,OAAS,EAAIkC,UAAU,QAAKyB,EAC7C6iC,EAAcP,GAAeH,GACjC,OAAOI,GAAaH,EAAUrC,EAAS8C,EAAa5mC,IAmKtD,IA0CM6mC,GA1CFC,GANJ,SAAwBC,GACtB,OAAO,WACL,OAAO,OAOPC,GAAex+B,EAAkB9C,WACjCuhC,GAAsBz+B,EAAkB3C,kBACxCqhC,GAAwB1+B,EAAkB/C,oBAC1C0hC,GAAsB3+B,EAAkB7C,kBACxCyhC,GAAiBzG,GAAiBF,aAClC4G,GAAoBnpB,GACpBopB,GAAqBppB,GACrBqpB,GAAiBrpB,GACjBspB,GAAoBjvB,GACpBkvB,GAAkBz6B,GAAYX,cAC9Bq7B,GAAwB16B,GAAYV,oBACpCq7B,GAA6B36B,GAAYD,yBACzC66B,GAAY56B,GAAYO,QACxBs6B,GAAiB76B,GAAYC,aAC7B66B,GAAkB78B,GAAqBL,cACvCm9B,GAA4BhmB,GAA4BI,wBACxD6lB,GAAgCthB,GAChCuhB,GAAmBxI,GACnByI,GAAmBpB,GAEnBqB,GAAW,SAASA,KACtB,OAAgBzkC,KAAMykC,IAGpBC,GAAW,IAAID,GAUfE,GAAkB,GAElBC,GAAgB,IAAI3/B,IAEpB4/B,IACE1B,GAAc,EACX,WACL,OAAOA,OAMX,SAAS2B,GAASvH,GAChB,IAAI3zB,EAAc,KACd7K,EAAMw+B,EAAQx+B,IACduG,EAAMi4B,EAAQj4B,IACdy/B,EAAcxH,EAAQyH,qBACtB9/B,EAAqB,MAAfq4B,EAAQr4B,IAAcq4B,EAAQr4B,SAAM7E,EAa9C,IAAI4kC,EAA+B,IAAI7xB,IACnCmuB,EAAQsB,GAA2BkC,MAAAA,EAAiDA,EAAc,CACpGvC,SAAU,YACVC,SAAU,YACT1jC,GACCqa,EAAakrB,GAA8B/G,EAAQ2H,qBACnDC,EAAmB,IAAIlgC,IACvBmgC,EAAkB,EAEtB,SAASC,IACP,OAAQx/B,GAAW,kCAAoCu/B,EAAkB,EAG3E,SAASE,EAAavwB,GAGpB,OAFAA,EAAMO,WAAWuB,eAAe/C,IAAI/U,GACpCqmC,IACO,WACLA,KAIJ,SAASG,IACP,YAA2CllC,IAApC4jC,GAA2BllC,KAAuBsmC,IAG3D,SAASG,EAAazwB,EAAO5T,EAAOgiC,EAAaroB,EAAU2qB,GACzDC,EAASvkC,EAAO2Z,EAAU2qB,GAC1BE,EAA4B5wB,EAAOouB,GAGrC,SAASwC,EAA4B5wB,EAAOouB,GACtCyC,EAAkB7wB,EAAOouB,IAC3B0C,EAAmB9wB,GAGrB+wB,EAAoB3C,GAAa,GAsBnC,SAAS2C,EAAoB3C,EAAa4C,GACxC,IAAIC,EAASpB,GAAct/B,IAAI69B,GAE/B,GAAc,MAAV6C,EAAgB,CAClB,IACIC,EADAC,EAAc7qC,EAA2B2qC,GAG7C,IACE,IAAKE,EAAYrpC,MAAOopC,EAAUC,EAAYnqC,KAAKe,MAAO,CACxD,IAAIqpC,EAAeF,EAAQlpC,MAC3BsnC,GAA0B8B,EAAcxlC,EAAkBiJ,KAE5D,MAAOxM,GACP8oC,EAAYlpC,EAAEI,GACd,QACA8oC,EAAYhpC,IAGV6oC,GACFnB,GAAcz6B,OAAOg5B,IAK3B,SAASiD,EAAiCrxB,EAAOouB,GAC/C,IAAI6C,EAASpB,GAAct/B,IAAI69B,GAEjB,MAAV6C,GACFpB,GAAc1/B,IAAIi+B,EAAa6C,EAAS,IAAI5yB,KAG9C4yB,EAAOlyB,IAAIiB,GA4Fb,SAASsxB,EAA6BtxB,EAAOnS,EAASzB,EAAOmlC,EAAcnD,EAAaoD,GACtF,OAAO3jC,EAAQlC,MAAK,SAAU8lC,GAC5B,IAAKnB,IAGH,MADAQ,EAAmB9wB,GACb2vB,GAS8B,MAAlC6B,EAAiBE,eAAyBF,EAAiBG,oBAAsB9jC,EAQnFzB,EAAMoV,WAAWrR,IAAIqhC,EAAiBE,cAAehD,GAAoB+C,IAyBzEzxB,EAAMO,WAAWuB,eAAe/X,SAAQ,SAAUqa,GAChDhY,EAAMoV,WAAWpM,OAAOgP,MAsB5B,IAAIwtB,EAAiBC,EAAkC7xB,EAAO5T,GAE9D,GAAIwlC,GAA2C,YAAzBA,EAAexlC,MAAqB,CAuBxD,IAJIykC,EAAkB7wB,EAAOouB,IAA2C,MAA3B0D,EAAiB9xB,KAC5D4wB,EAA4B5wB,EAAOouB,GAGR,aAAzBwD,EAAexlC,MACjB,OAAOwlC,EAAetlC,SAEtB,MAAMslC,EAAetlC,SA6BzB,IAAKukC,EAAkB7wB,EAAOouB,GAAc,CAC1C,IAAI2D,EAAgBC,EAA2BhyB,EAAO5T,GAEtD,GAAqB,MAAjB2lC,EAKF,OAAOA,EAAcE,gBAAgB3lC,SAKzC,IAAI4lC,EAAwBC,EAAuBnyB,EAAO5T,EAAOgiC,GAC7DgE,GAAyB,OAAeF,EAAuB,GAC/DnsB,EAAWqsB,EAAuB,GAClC1B,EAAY0B,EAAuB,GAMvC,GAJuB,YAAnBrsB,EAAS3Z,OACXqkC,EAAazwB,EAAO5T,EAAOgiC,EAAaroB,EAAU2qB,GAG7B,aAAnB3qB,EAAS3Z,MACX,MAAM2Z,EAASzZ,SAGjB,OAAOyZ,EAASzZ,YACf4B,OAAM,SAAU9C,GAEjB,GAAIA,aAAiBskC,GACnB,MAAMC,GAGR,IAAKW,IAEH,MADAQ,EAAmB9wB,GACb2vB,GAGR,IAAI5pB,EAAWyoB,GAAoBpjC,GAEnC,MADAqlC,EAAazwB,EAAO5T,EAAOgiC,EAAaroB,EAAUwrB,GAC5CnmC,KAIV,SAASinC,EAAWryB,EAAO5T,EAAO2T,EAAMquB,GACtC,IAAIkE,EAAiBC,EAAuBC,EAAkBC,EAGxDjf,EAAuBkf,EAAkBC,GAD3C9B,EAAkB7wB,EAAOouB,IAAgBhiC,EAAM6T,WAAsD,QAAxCqyB,EAAkBtyB,EAAMO,kBAA4C,IAApB+xB,GAAgG,QAAzDC,EAAwBD,EAAgB9xB,mBAAmD,IAA1B+xB,OAA3E,EAAuHA,EAAsBtyB,UAAY7T,EAAM6T,WAAuD,QAAzCuyB,EAAmBxyB,EAAMO,kBAA6C,IAArBiyB,GAA+F,QAAvDC,EAAwBD,EAAiB/xB,gBAAgD,IAA1BgyB,OAAzE,EAAqHA,EAAsBxyB,WAGnhB8uB,GAAkB/kC,EAAK+V,EAAMC,EAAwQ,QAAhQwT,EAAkE,QAAzCkf,EAAmB1yB,EAAMO,kBAA6C,IAArBmyB,GAA+F,QAAvDC,EAAwBD,EAAiBjyB,gBAAgD,IAA1BkyB,OAAzE,EAAqHA,EAAsB1yB,eAA+C,IAA1BuT,EAAmCA,EAAwBxT,EAAMO,WAAWC,YAAYP,SAGvY,IACI2yB,EADAC,EAAcvsC,EAA2ByZ,GAG7C,IACE,IAAK8yB,EAAY/qC,MAAO8qC,EAAUC,EAAY7rC,KAAKe,MAAO,CACxD,IAAIqc,EAAUwuB,EAAQ5qC,MACtBkoC,EAA6BnxB,IAAIqF,IAEnC,MAAO/b,GACPwqC,EAAY5qC,EAAEI,GACd,QACAwqC,EAAY1qC,KAIhB,SAASgqC,EAAuBnyB,EAAO5T,EAAOgiC,GAC5C,IAUItjC,EAEAib,EAZA+sB,EAAerD,GAAiBzlC,GAEhC+oC,GAA6B,EAC7BC,GAA8B,EAE9BC,EAAmB,WACrBH,IACAE,GAA8B,GAI5BE,GAAgB,EAEhB1B,EAAmB,CACrBE,cAAe,KACfC,kBAAmB,MAajBjB,EAAY,IAAIxgC,IAEpB,SAASijC,EAAeC,GACtB,IAAIC,EAASD,EAAOppC,IAChBspC,EAAc1E,GAAkB5uB,EAAO5T,EAAOinC,GAUlD,OATA3C,EAAUvgC,IAAIkjC,EAAQC,GAIjBP,IACHV,EAAWryB,EAAO5T,EAAO,IAAIiS,IAAIqyB,EAAUxnC,QAASklC,GA7W1D,SAAmCpuB,EAAOouB,GACpCyC,EAAkB7wB,EAAOouB,KACPxiC,EAAkBkmC,EAAiB9xB,IACzCuzB,cAAc7iC,QAC5BqgC,EAAoB3C,GAAa,IA0W/BoF,CAA0BxzB,EAAOouB,IAG3BkF,EAAYlnC,OAClB,IAAK,WACH,OAAOknC,EAAYhnC,SAErB,IAAK,WACH,MAAMgnC,EAAYhnC,SAEpB,IAAK,UAGH,MAFAklC,EAAiBE,cAAgB2B,EACjC7B,EAAiBG,kBAAoB2B,EAAYhnC,SAC3CgnC,EAAYhnC,SAGtB,MAAMpB,EAAW,0BAsBnB,IACEJ,EAASyF,EAAI,CACXA,IAAK4iC,EACLM,YAtBc,SAAqBn+B,GACrC,OAAO,WACL,GAAI09B,EACF,MAAM9nC,EAAW,8NAGF,MAAf2J,GAA2HywB,IAAiB,GAE9I,IAAK,IAAIoO,EAAQ7pC,UAAUlC,OAAQy+B,EAAO,IAAIx/B,MAAM8sC,GAAQC,EAAS,EAAGA,EAASD,EAAOC,IACtFvN,EAAKuN,GAAU9pC,UAAU8pC,GAG3B,OAAOnE,GAAiBxvB,EAAO1K,EAAI8wB,EAAM,CACvC3xB,KAAMI,QAWV/J,EAASukC,GAAgBvkC,GAAUqoC,EAAeroC,GAAUA,EAExDyjC,GAAazjC,KACM,aAAjBA,EAAOsB,QACT8mC,GAAgB,GAGlBpoC,EAASA,EAAOwB,UAGdb,EAAiBX,GACnBA,EA5VN,SAA2BkV,EAAOnS,EAASzB,EAAOskC,EAAWtC,EAAaoD,GACxE,OAAO3jC,EAAQlC,MAAK,SAAU3D,GAC5B,IAAKsoC,IAGH,MADAQ,EAAmB9wB,GACb2vB,GAGR,IAAI5pB,EAAW2oB,GAAoB1mC,GAEnC,OADAyoC,EAAazwB,EAAO5T,EAAOgiC,EAAaroB,EAAU2qB,GAC3C1oC,KACNkG,OAAM,SAAU0lC,GACjB,IAAKtD,IAGH,MADAQ,EAAmB9wB,GACb2vB,GAGR,GAAIlkC,EAAiBmoC,GACnB,OAAOtC,EAA6BtxB,EAAO4zB,EAAgBxnC,EAAOskC,EAAWtC,EAAaoD,GAG5F,IAAIzrB,EAAWyoB,GAAoBoF,GAEnC,MADAnD,EAAazwB,EAAO5T,EAAOgiC,EAAaroB,EAAU2qB,GAC5CkD,KAoUKC,CAAkB7zB,EAAOlV,EAAQsB,EAAOskC,EAAWtC,EAAaoD,GAAkB1K,QAAQmM,GAEnGA,IAGFnoC,EAASA,aAAkB6jC,GAAiB7jC,EAAO9C,MAAQ8C,EAC3D,MAAOgpC,GAGHroC,EAFJX,EAASgpC,GAGPhpC,EAASwmC,EAA6BtxB,EAAOlV,EAAQsB,EAAOskC,EAAWtC,EAAaoD,GAAkB1K,QAAQmM,IAE9GC,GAAgB,EAChBD,KAeJ,OAVEltB,EADEmtB,EACS1E,GAAoB1jC,GACtBW,EAAiBX,GACf2jC,GAAsB3jC,GAEtB4jC,GAAoB5jC,GAGjCioC,GAA6B,EAwN/B,SAAsC/yB,EAAOouB,EAAasC,GAGxD,GAAIG,EAAkB7wB,EAAOouB,GAAc,CACzC,IAAI2D,EAAgBD,EAAiB9xB,GAEhB,MAAjB+xB,IACFA,EAAcgC,wCAA0CrD,IA9N5DsD,CAA6Bh0B,EAAOouB,EAAasC,GACjD2B,EAAWryB,EAAO5T,EAAO,IAAIiS,IAAIqyB,EAAUxnC,QAASklC,GAC7C,CAACroB,EAAU2qB,GAGpB,SAASmB,EAAkC7xB,EAAO5T,GAGhD,IAAIwlC,EAAiBxlC,EAAMoV,WAAWjR,IAAIvG,GAE1C,GAAsB,MAAlB4nC,EACF,OAAOA,EAIT,IAkBMqC,EAlBFC,EAAuB,IAAI71B,IAE/B,IACEuzB,EAAiBpF,EAAMj8B,KAAI,SAAU6T,GAEnC,MADqB,iBAAZA,GAA0HkhB,IAAiB,GAC7IsJ,GAAkB5uB,EAAO5T,EAAOgY,GAAS9X,WAC/C,CACDk9B,YAAa,SAAqB/0B,GACd,WAAdA,EAAK+B,MAAqB/B,EAAK2P,UAAYpa,GAC7CkqC,EAAqBn1B,IAAItK,EAAK2P,YAIpC,MAAOhZ,GACP,MAAMF,EAAW,2CAA4CiB,OAAOnC,EAAK,OAAQmC,OAAOf,EAAMD,UAG5FymC,IAKFxlC,EAAMoV,WAAWrR,IAAInG,EAAK4nC,GAU1BS,EAAWryB,EAAO5T,EAAO8nC,EAAwE,QAAjDD,EAAoBnC,EAAiB9xB,UAA0C,IAAtBi0B,OAA+B,EAASA,EAAkB7F,cAGrK,OAAOwD,EAsBT,SAASuC,EAAiCn0B,EAAO5T,GAE/C,IAAIgoC,EAAYvC,EAAkC7xB,EAAO5T,GAEzD,GAAiB,MAAbgoC,EAEF,OADAtD,EAAmB9wB,GACZo0B,EAIT,IAGMC,EAHFC,EAA0BtC,EAA2BhyB,EAAO5T,GAEhE,GAA+B,MAA3BkoC,EAQF,MALgK,aAArF,QAArED,EAAwBC,EAAwBrC,uBAAuD,IAA1BoC,OAAmC,EAASA,EAAsBjoC,QACnJilC,EAAiCrxB,EAAOs0B,EAAwBlG,aAI3DkG,EAAwBrC,gBAIjC,IAAIsC,EAAiBzE,KAEjB0E,EAAyBrC,EAAuBnyB,EAAO5T,EAAOmoC,GAC9DE,GAAyB,OAAeD,EAAwB,GAChEzuB,EAAW0uB,EAAuB,GAClCC,EAAeD,EAAuB,GAsB1C,MARuB,YAAnB1uB,EAAS3Z,QA2Ff,SAA0B4T,EAAOu0B,EAAgBxuB,EAAU2qB,EAAWtkC,GACpEgkC,EAAiBjgC,IAAI6P,EAAO,CAC1B+zB,wCAAyCrD,EACzCtC,YAAamG,EACbtC,gBAAiBlsB,EACjBwtB,cAAe,IAAIrjC,IAAI,CAAC,CAAC9D,EAAM6T,SAAS,OA/FxC00B,CAAiB30B,EAAOu0B,EAAgBxuB,EAAU2uB,EAActoC,GAChEilC,EAAiCrxB,EAAOu0B,KAExCzD,EAAmB9wB,GACnB2wB,EAASvkC,EAAO2Z,EAAU2uB,IAGrB3uB,EAQT,SAASisB,EAA2BhyB,EAAO5T,GAczC,SAASwoC,EAAcC,GACrB,IACIC,EADAC,EAAczuC,EAA2BuuC,GAG7C,IACE,IAAKE,EAAYjtC,MAAOgtC,EAAUC,EAAY/tC,KAAKe,MAAO,CACxD,IAAIitC,GAAgB,OAAeF,EAAQ9sC,MAAO,GAC9CqrC,EAAS2B,EAAc,GACvBC,EAAeD,EAAc,GAEjC,IAAKpG,GAAkB5uB,EAAO5T,EAAOinC,GAAQhU,GAAG4V,GAC9C,OAAO,GAGX,MAAO5sC,GACP0sC,EAAY9sC,EAAEI,GACd,QACA0sC,EAAY5sC,IAGd,OAAO,EAGT,IACI+sC,EADAC,EAAc7uC,EAnCM6oB,GAAuB,CAACihB,EAAiB17B,IAAIsL,GAAS,CAACpU,EAAkBwkC,EAAiB7/B,IAAIyP,KAAW,GAAIrN,GAAmBuQ,GAAsBktB,GAAkB,SAAUgF,GAIxM,OAHa,OAAeA,EAAQ,GACrB,KAEFp1B,MACX,SAAUq1B,GAIZ,OAHa,OAAeA,EAAQ,GACd,SA+BxB,IACE,IAAKF,EAAYrtC,MAAOotC,EAAUC,EAAYnuC,KAAKe,MAAO,CACxD,IAAIutC,EAAWJ,EAAQltC,MAEvB,GAEAstC,EAAS/B,cAAchjC,IAAInE,EAAM6T,WAChC20B,EAAcU,EAASvB,yCAEtB,OADAuB,EAAS/B,cAAcpjC,IAAI/D,EAAM6T,SAAS,GACnCq1B,EAEPA,EAAS/B,cAAcpjC,IAAI/D,EAAM6T,SAAS,IAG9C,MAAO5X,GACP8sC,EAAYltC,EAAEI,GACd,QACA8sC,EAAYhtC,KAMhB,SAAS2pC,EAAiB9xB,GACxB,OAAOowB,EAAiB7/B,IAAIyP,GAgC9B,SAAS8wB,EAAmB9wB,GAC1BowB,EAAiBh7B,OAAO4K,GAG1B,SAAS6wB,EAAkB7wB,EAAOouB,GAChC,IAAImH,EAEJ,OAAOnH,KAAoE,QAAlDmH,EAAqBzD,EAAiB9xB,UAA2C,IAAvBu1B,OAAgC,EAASA,EAAmBnH,aAyBjJ,SAASuC,EAASvkC,EAAO2Z,EAAU2qB,GAOjCtkC,EAAMoV,WAAWrR,IAAInG,EAAK+b,GAE1B,IACEymB,EAAMr8B,IApBV,SAA6BugC,GAC3B,OAAO9pC,MAAMY,KAAKkpC,EAAU1zB,WAAW7P,KAAI,SAAUqoC,GACnD,IAAIC,GAAS,OAAeD,EAAQ,GAIpC,MAAO,CAHMC,EAAO,GACFA,EAAO,GAEGnpC,aAclBopC,CAAoBhF,GAAY3qB,GAC1C,MAAO3a,GACP,MAAMF,EAAW,4CAA6CiB,OAAOnC,EAAK,OAAQmC,OAAOf,EAAMD,WAmBnG,SAASwqC,EAAa31B,EAAO5T,GAC3B,IAAIwlC,EAAiBxlC,EAAMoV,WAAWjR,IAAIvG,GAE1C,OAAsB,MAAlB4nC,EACKA,EAGFpF,EAAMj8B,KAAI,SAAU6T,GACzB,IAAIwxB,EAGJ,MADqB,iBAAZxxB,GAA0HkhB,IAAiB,GACzE,QAAnEsQ,EAAoB/G,GAAmB7uB,EAAO5T,EAAOgY,UAA4C,IAAtBwxB,OAA+B,EAASA,EAAkBtpC,YAIjJ,SAASupC,EAAY71B,EAAO5T,GAC1B,OA/BF,SAAoCkJ,GAClC,GAAIs6B,GAAgBjD,SAAS3iC,GAAM,CACjC,IAAImB,EAAU,8CAA8CgB,OAAOyjC,GAAgBvoC,MAAMuoC,GAAgBkG,QAAQ9rC,IAAMqjC,KAAK,QAC5H,OAAOmB,GAAoBtjC,EAAWC,IAGxCykC,GAAgBnmC,KAAKO,GAErB,IACE,OAAOsL,IACP,QACAs6B,GAAgBpyB,OAoBXu4B,EAA2B,WAChC,OAAO5B,EAAiCn0B,EAAO5T,MAInD,SAAS4pC,EAAmB5pC,GAC1BA,EAAMoV,WAAWpM,OAAOpL,GAG1B,SAASisC,EAAmBj2B,EAAOiE,GAChB,MAAfpP,GAA2HywB,IAAiB,GAE9I,IACI4Q,EADAC,EAAc7vC,EAA2B4pC,GAG7C,IACE,IAAKiG,EAAYruC,MAAOouC,EAAUC,EAAYnvC,KAAKe,MAAO,CACxD,IAEI2iB,EAFAtG,EAAU8xB,EAAQluC,MAIlByM,EAAO06B,GAAU/qB,GACoB,QAAxCsG,EAAmBjW,EAAKkW,kBAA6C,IAArBD,GAAuCA,EAAiBtjB,KAAKqN,EAAMuL,EAAOiE,IAE7H,MAAO5b,GACP8tC,EAAYluC,EAAEI,GACd,QACA8tC,EAAYhuC,IAGd+nC,EAA6Bx/B,QAC7BslC,EAAmB/xB,GACnBuoB,EAAM97B,QACN4+B,GAA0BtvB,EAAOnL,GAGnC,GAAW,MAAP1E,EAAa,CA6Df,OAAO0E,EAAcu6B,GAAe,CAClCplC,IAAKA,EACL8b,SAAU,WACVb,KAAM0wB,EACNplC,IAAKslC,EACL1lC,IA7DgB,SAAqB6P,EAAO5T,EAAOkN,GACnD,IAAI88B,GAA0B,EAC1BhsB,EAAS,IAAIla,IAEjB,SAASijC,EAAekD,GACtB,IAAIhD,EAASgD,EAAOrsC,IAEpB,GAAIosC,EACF,MAAMlrC,EAAW,4DAGnB,IAAI6a,EAAW6oB,GAAkB5uB,EAAO5T,EAAOinC,GAE/C,GAAuB,aAAnBttB,EAAS3Z,MACX,OAAO2Z,EAASzZ,SACX,KAAuB,YAAnByZ,EAAS3Z,MACZ,IAAI6iC,GAAsBoE,GAE1BttB,EAASzZ,SAInB,SAASgqC,EAAeliB,EAAatM,GACnC,GAAIsuB,EACF,MAAMlrC,EAAW,4DAGnB,IAAIqrC,EAAqC,mBAAnBzuB,EAEtBA,EAAeqrB,EAAe/e,IAAgBtM,EACzBgnB,GAAe9uB,EAAO5T,EAAOgoB,EAAYpqB,IAAKusC,GACpDxsC,SAAQ,SAAUqN,EAAG6B,GAClC,OAAOmR,EAAOja,IAAI8I,EAAG7B,MAQzB,IAAIgH,EAAMjO,EACV,CACEA,IAAKmmC,EACL/lC,IAAK4iC,EACLzM,MARF,SAA0BtS,GACxBkiB,EAAeliB,EAAa4a,MAQ3B11B,GAGH,QAAYhO,IAAR8S,EACF,MAAM3S,EAAiB2S,GAAOlT,EAAW,4DAA8DA,EAAW,mDAIpH,OADAkrC,GAA0B,EACnBhsB,GASPrF,KAAMwrB,EACN3qB,WAAYowB,EACZrrB,WAAYsrB,EACZ9gC,4BAA6Bq7B,EAC7BgG,2BAA4BhO,EAAQgO,2BACpC7T,4BAA4B,EAC5Bte,WAAYA,IAGd,OAAOxP,EAAcu6B,GAAe,CAClCplC,IAAKA,EACL8b,SAAU,WACVb,KAAM0wB,EACNplC,IAAKslC,EACL9wB,KAAMwrB,EACN3qB,WAAYowB,EACZrrB,WAAYsrB,EACZ9gC,4BAA6Bq7B,EAC7BgG,2BAA4BhO,EAAQgO,2BACpC7T,4BAA4B,EAC5Bte,WAAYA,IAQlB0rB,GAAS/nC,MAAQ,SAAUA,GACzB,OAAO,IAAI2mC,GAAe3mC,IAG5B,IAAIyuC,GAAkB1G,GAGlB2G,GAAe3mC,EAAkB9C,WACjC0pC,GAAsB5mC,EAAkB3C,kBACxCwpC,GAAwB7mC,EAAkB/C,oBAC1C6pC,GAAsB9mC,EAAkB7C,kBACxC4pC,GAAiB5O,GAAiBF,aAClC+O,GAAiBtxB,GACjBuxB,GAAkBziC,GAAYX,cAC9BqjC,GAAiB1iC,GAAYZ,aAC7BujC,GAA6B3iC,GAAYD,yBACzC6iC,GAAiB5iC,GAAYC,aAC7B4iC,GAA6B7iC,GAAYc,yBACzCgiC,GAAkB7kC,GAAqBL,cACvCmlC,GAA6BhuB,GAA4BC,yBACzDguB,GAA4BjuB,GAA4BI,wBACxD8tB,GAAmBluB,GAA4BD,eAC/CouB,GAA2BnuB,GAA4BG,uBACvDiuB,GAAgCzpB,GAEpC,SAAS0pB,GAASnP,GAChB,IAAIx+B,EAAMw+B,EAAQx+B,IACd4tC,EAAcpP,EAAQqP,qBACtBxzB,EAAaqzB,GAA8BlP,EAAQ2H,qBACnDE,EAAkB,EAEtB,SAASyH,EAAcjqC,GACrB,OAAO+oC,GAAsB/oC,EAAQlC,MAAK,SAAU3D,GAElD,OADA+vC,EAAkBlB,GAAoB7uC,GAC/BA,KACNkG,OAAM,SAAU9C,GAEjB,MADA2sC,EAAkBpB,GAAoBvrC,GAChCA,MAIV,IAAI2sC,EAAkBtsC,EAAiB+8B,EAAQwP,SAAWF,EAActP,EAAQwP,SAAWtB,GAAalO,EAAQwP,SAAqC,YAA1BxP,EAAQwP,QAAQ5rC,MAAsB0rC,EAActP,EAAQwP,QAAQ1rC,UAAYk8B,EAAQwP,QAAUnB,GAAoBrO,EAAQwP,mBAAmBlB,GAAiBtO,EAAQwP,QAAQhwC,MAAQwgC,EAAQwP,SAC7TC,EAA0BF,EAAgBzrC,UAC1C,IAAI4rC,OAAkC5sC,EAGlC6sC,EAAwB,IAAIjoC,IAEhC,SAAS+nC,EAA0BG,GAejC,OAAOA,EAyQT,SAASC,EAASjnB,EAAQhlB,GACxB,IAAIksC,EAAMC,EAEV,OAAkL,QAA1KD,EAAgE,QAAxDC,EAAyBnsC,EAAMoV,WAAWjR,IAAIvG,UAA6C,IAA3BuuC,EAAoCA,EAAyBL,SAAsD,IAATI,EAAkBA,EAAOP,EAwDrN,IAAItjC,EAAO0iC,GAAe,CACxBntC,IAAKA,EACL8b,SAAU,OACVb,KAAMozB,EACN9nC,IAzDF,SAAiB6gB,EAAQhlB,GACvB,GAAIA,EAAMoV,WAAW9M,IAAI1K,GAEvB,OAAO4B,EAAkBQ,EAAMoV,WAAWjR,IAAIvG,IACzC,GAAIoC,EAAMqV,kBAAkB/M,IAAI1K,GAAM,CAG3C,GAAuC,MAAnCkuC,EACF,OAAOA,EAGT,GAAmB,MAAfN,EAEF,OADAnlC,GAA4B,+CAA+CtG,OAAOnC,EAAK,yCAChF+tC,EAGT,IAAIS,EAAoBpsC,EAAMqV,kBAAkBlR,IAAIvG,GAChDyuC,EAAkBb,EAAYc,UAAUF,EAAmBxB,IAC3D2B,EAAyBF,aAA2BxB,GAAiBc,EAAkBlB,GAAoB4B,GAE/G,OADAP,EAAkCS,EAGlC,OAAOZ,GAoCT5nC,IA5BF,SAAiBihB,EAAQhlB,EAAOkN,GAG9B,GAAIlN,EAAMoV,WAAW9M,IAAI1K,GAAM,CAC7B,IAAI2T,EAAW/R,EAAkBQ,EAAMoV,WAAWjR,IAAIvG,IAEtD,GAAuB,aAAnB2T,EAASvR,OAAwBkN,IAAaqE,EAASrR,SACzD,OAAO,IAAI4D,SAER,IAAK9D,EAAMqV,kBAAkB/M,IAAI1K,IAAQsP,aAAoB29B,GAClE,OAAO,IAAI/mC,IAMb,OAFAgoC,OAAkC5sC,GAE3B,IAAI4E,KAAMC,IAAInG,EAAK6sC,GAAoBv9B,KAa9CyL,KA9SF,SAAkB/E,EAAO44B,EAAW10B,GAClC,IAAI20B,EAgBJ,GAdAxI,IAYArwB,EAAMO,WAAWsB,WAAW9C,IAAI/U,GAEF,YAA1B+tC,EAAgB3rC,MAAqB,CAWvC2rC,EAAgBzrC,SAASw6B,SAVM,WAC7B,IAAIgS,GAEiE,QAAxDA,EAAyB94B,EAAMO,WAAWE,gBAAiD,IAA3Bq4B,EAAoCA,EAAyB94B,EAAMO,WAAWC,aAEhJgB,WAAW9M,IAAI1K,IACxButC,GAA0Bv3B,EAAOvL,MAUvC,IAAIskC,EAAmD,QAAxCF,EAAmBrQ,EAAQuQ,eAA0C,IAArBF,EAA8BA,EAAmBrQ,EAAQwQ,iBAExH,GAAe,MAAXD,EAAiB,CACnB,IAkJIE,EAlJA5nB,EAAc,SAAqBxc,GAIrC,GAAIqkC,GAAcrkC,EAAY7K,MAAQA,EAAK,CAEzC,IAAImvC,EAAWC,EAEf,OAAOD,aAAoBlC,GAAiBoB,EAASr4B,EAAO44B,GAC1DntC,EAAiB0tC,GAAYvC,GAAsBuC,EAASxtC,MAAK,SAAUyL,GAC3E,OAAOA,aAAa6/B,GACpBc,EAAgBzmB,YACdla,MACEy/B,GAAoBsC,GAG5B,OAAO7B,GAA2Bt3B,EAAOnL,IAGvCwkC,EAAa,SAAoBxkC,GACnC,OAAOwc,EAAYxc,GAAayc,aAG9BgoB,EAAmB,SAA0BzkC,GAC/C,IAAI0kC,EAEAC,EAAOzC,GAAe/2B,EAAgE,QAAxDu5B,EAAyBv5B,EAAMO,WAAWE,gBAAiD,IAA3B84B,EAAoCA,EAAyBv5B,EAAMO,WAAWC,YAAa3L,EAAY7K,KACzM,OAAOkvC,GAAcrkC,EAAY7K,MAAQA,GAASovC,aAAqBnC,GAGlEuC,EAHoF7vC,EAAcA,EAAc,GAAI6vC,GAAO,GAAI,CAClIvzB,OAAO,EACPF,SAAUsL,EAAYxc,MAKtBqkC,GAAa,EACbE,EAAYpC,GACZyC,GAAc,EACdC,EAAiB,KAEjBC,EAAU,SAAiBC,GAC7B,OAAO,SAAU9xB,GACf,GAAIoxB,EAAY,CACd,IAAIW,EAAkBxoB,EAAY5c,GAC9BqlC,EAAyC,aAA1BD,EAAgBztC,MAAuBytC,EAAgBvtC,SAAW0qC,GACrFoC,EAAsC,mBAAnBtxB,EACnBA,EAAegyB,GACbhyB,EAEErc,EAAiB2tC,KACnBA,EAAYA,EAAUztC,MAAK,SAAU3D,GAMnC,OAJA0xC,EAAiB,CACfE,OAAQA,EACR5xC,MAAOA,GAEFA,UAGN,CACL,GAAIyD,EAAiBqc,GACnB,MAAM5c,EAAW,qDAGW,mBAAnB4c,IACT4xB,EAAiB,CACfE,OAAQA,EACR5xC,MAAO8f,IAIX0vB,GAAiBx3B,EAAOvL,EAAgC,mBAAnBqT,EAAgC,SAAUgyB,GAC7E,IAAIxgC,EACJwO,EAAegyB,GAMf,OAJAJ,EAAiB,CACfE,OAAQA,EACR5xC,MAAOsR,GAEFA,GACLwO,MAKNiyB,EAAY,SAAmBH,GACjC,OAAO,WACL,OAAOD,EAAQC,EAARD,CAAgB3C,MAIvB/N,EAAQ,SAAe2Q,GACzB,OAAO,SAAUI,GACf,IAAIC,EA+CAjwB,EA7CwBhK,EAAMyS,yBAAwB,SAAUynB,GAClE,IAAIC,EAIAC,EAAwBF,EAAa35B,WACrCC,EAAc45B,EAAsB55B,YACpCE,EAAe05B,EAAsB15B,aAEpCA,IACHhN,GAA4B,iGAC5BgN,EAAeF,GAGjB,IAAIqf,EAA4E,QAA7Dsa,EAAwB35B,EAAYgB,WAAWjR,IAAIvG,UAA4C,IAA1BmwC,EAAmCA,EAAwBpC,EAEnJ,GAA0B,aAAtBlY,EAAYzzB,MAAsB,CACpC,IAAIiuC,EAAuBC,EAAiBC,EAAkBC,EAE1DlhC,EAAWumB,EAAYvzB,SACvBmuC,EAA6E,QAA9DJ,EAAwB35B,EAAac,WAAWjR,IAAIvG,UAA4C,IAA1BqwC,EAAmCA,EAAwBtC,EAChJ2C,EAAiC,aAAtBD,EAAYruC,MAAuBquC,EAAYnuC,SAAW0qC,IAiB7B,QAAtCsD,EAAkBZ,SAAgD,IAApBY,OAA6B,EAASA,EAAgBV,UAAYA,IAAmD,QAAvCW,EAAmBb,SAAiD,IAArBa,OAA8B,EAASA,EAAiBvyC,SAAWsR,EAClP0gC,EAAQ1gC,EAAUohC,GAAWl6B,EAAYgB,WAAW9M,IAAI1K,KACN,QAAvCwwC,EAAmBd,SAAiD,IAArBc,OAA8B,EAASA,EAAiBZ,UAAYA,IAC9HF,EAAiB,SAGpB1vC,GACiCggB,QAEpCmuB,EAAsBhoC,IAAI6P,EAAO,GAAG7T,QAAO,OAAmF,QAA/D8tC,EAAyB9B,EAAsB5nC,IAAIyP,UAA+C,IAA3Bi6B,EAAoCA,EAAyB,IAAK,CAACjwB,OAIzM2wB,EAAcr0C,EAA2ByyC,GAG7C,IACE,IAAK4B,EAAY7yC,MAAOmxC,EAAU0B,EAAY3zC,KAAKe,MAAO,CACxD,IAAI6xC,EAASX,EAAQjxC,MAErB,IACE,IAaM4yC,EAbFznB,EAAUymB,EAAO,CACnBnlC,KAAMA,EACN4d,QAASrS,EAAMqS,QACfnO,QAASA,EACTy1B,QAASA,EAAQC,GACjBG,UAAWA,EAAUH,GACrB3Q,MAAOA,EAAM2Q,GACbP,WAAYA,EACZhoB,YAAaA,EACbioB,iBAAkBA,IAGpB,GAAe,MAAXnmB,EAGFglB,EAAsBhoC,IAAI6P,EAAO,GAAG7T,QAAO,OAAmF,QAA/DyuC,EAAyBzC,EAAsB5nC,IAAIyP,UAA+C,IAA3B46B,EAAoCA,EAAyB,IAAK,CAACznB,KAE3M,MAAO/nB,GACPguC,EAAYhuC,EACZquC,GAAc,IAGlB,MAAOpxC,GACPsyC,EAAY1yC,EAAEI,GACd,QACAsyC,EAAYxyC,IAMd,GAHA+wC,GAAa,IAGPE,aAAqBnC,IAAiB,CAC1C,IAAI4D,EAEAC,EAA4C1B,EAC5C2B,EAAetB,EAAc9C,GAAoByC,GAAa3tC,EAAiBqvC,GAAmBlE,GA1P5G,SAA4B52B,EAAOnS,GACjC,IAAImtC,EAAiBntC,EAAQlC,MAAK,SAAU3D,GAC1C,IAAIwrB,EAAuBynB,EAQ3B,OAJ6D,QAAvDA,GAF8D,QAAvDznB,EAAwBxT,EAAMO,WAAWE,gBAAgD,IAA1B+S,EAAmCA,EAAwBxT,EAAMO,WAAWC,aAEpHgB,WAAWjR,IAAIvG,UAA4C,IAA1BixC,OAAmC,EAASA,EAAsB3uC,YAAc0uC,GACnJxD,GAAiBx3B,EAAOvL,EAAMzM,GAGzBA,KACNkG,OAAM,SAAU9C,GACjB,IAAI8vC,EAAwBC,EAQ5B,MAJ8D,QAAxDA,GAF+D,QAAxDD,EAAyBl7B,EAAMO,WAAWE,gBAAiD,IAA3By6B,EAAoCA,EAAyBl7B,EAAMO,WAAWC,aAEtHgB,WAAWjR,IAAIvG,UAA6C,IAA3BmxC,OAAoC,EAASA,EAAuB7uC,YAAc0uC,GACtJvD,GAAyBz3B,EAAOvL,EAAMkiC,GAAoBvrC,IAGtDA,KAER,OAAO4vC,EAoOyHI,CAAmBp7B,EAAO86B,IAAoBjE,GAAoBiE,GAC9LlC,EAAUp3B,WAAWrR,IAAInG,EAAK+wC,GAI2B,QAAxDF,EAAyB76B,EAAMO,WAAWE,gBAAiD,IAA3Bo6B,GAA6CA,EAAuBr5B,WAAWrR,IAAInG,EAAK+wC,IAI7J,OArOkB,WAChB,IAAIM,EAEJhL,IAC+D,QAA9DgL,EAAwBlD,EAAsB5nC,IAAIyP,UAA8C,IAA1Bq7B,GAA4CA,EAAsBtxC,SAAQ,SAAUopB,GACzJ,OAAOA,OAETglB,EAAsB/iC,OAAO4K,KAmS/B4F,WAlCF,WACEsyB,OAAkC5sC,GAkClC6J,4BAZF,WACE,YAA2C7J,IAApC4rC,GAA2BltC,IAAsBqmC,GAAmB,GAY3EmG,2BAA4BhO,EAAQgO,2BACpCqB,qBAAsBrP,EAAQqP,qBAAuB,CACnDrhC,KAAMgyB,EAAQqP,qBAAqBrhC,KACnC8kC,WAAY9S,EAAQqP,qBAAqByD,iBACvChwC,EACJq3B,4BAA4B,EAC5Bte,WAAYA,IAEd,OAAO5P,EAIT,SAASgmB,GAAK+N,GAOZ,IAAI+S,EAAct0C,OAAOu0C,OAAO,GAAIhT,GAChCiT,EAAiB,YAAajT,EAElCA,EAAQwP,QAAU,IAAIprC,SAAQ,eAE9B,OAAIyqC,GAAgBoE,GA0BtB,SAA0BjT,GACxB,IAAIplB,EAAOqX,GAAK9wB,EAAcA,EAAc,GAAI6+B,GAAU,GAAI,CAC5DwP,QAAShB,GACTa,0BAAuDvsC,IAAjCk9B,EAAQqP,0BAAqCvsC,EAAY3B,EAAcA,EAAc,GAAI6+B,EAAQqP,sBAAuB,GAAI,CAChJa,UAAW,SAAmBgD,GAC5B,OAAOA,aAAuBzE,GAAiByE,EAAc9vC,EAAkB48B,EAAQqP,sBAAsBa,UAAUgD,EAAa1E,OAIxI+B,QAASvQ,EAAQuQ,QAEjBC,iBAAkBxQ,EAAQwQ,oBAGxB2C,EAAMlF,GAAgB,CACxBzsC,IAAK,GAAGmC,OAAOq8B,EAAQx+B,IAAK,kBAC5BuG,IAAK,SAAaqrC,GAChB,IAEIC,GAAYC,EAFLF,EAAOrrC,KAEG6S,GAErB,OAAOy4B,aAAqB5E,GAAiBzO,EAAQwP,QAAU6D,GAEjE1rC,IAAK,SAAa4rC,EAAQziC,GAExB,OAAO0iC,EADID,EAAO5rC,KACNiT,EAAM9J,IAEpBk9B,2BAA4BhO,EAAQgO,6BAGtC,OADAY,GAA2BuE,EAAI3xC,IAAKktC,GAA2B1O,EAAQx+B,MAChE2xC,EAnDEM,CAAiBtyC,EAAcA,EAAc,GAAI4xC,GAAc,GAAI,CACxEvD,QAASyD,KAcJ9D,GAAShuC,EAAcA,EAAc,GAAI4xC,GAAc,GAAI,CAChEvD,QAASyD,KAsCfhhB,GAAKzyB,MAAQ,SAAUA,GACrB,OAAO,IAAI8uC,GAAe9uC,IAG5B,IAAIk0C,GAAczhB,GAkEd0hB,GAHkB,CACpBC,SApD0B,WAC1B,SAASA,EAAS5T,GAGhB,IAAI2C,GAFJ,OAAgBlgC,KAAMmxC,GAItBtwC,EAAgBb,KAAM,YAAQ,GAE9Ba,EAAgBb,KAAM,kBAAc,GAEpCA,KAAKsB,KAAO,IAAI2D,IAChBjF,KAAKugC,WAAsG,QAAxFL,EAAkB3C,MAAAA,OAAyC,EAASA,EAAQiD,cAAwC,IAApBN,EAA6BA,EAAkB,SAAU/zB,GAC1K,OAAOA,GAoCX,OAhCA,OAAaglC,EAAU,CAAC,CACtBpyC,IAAK,OACLhC,MAAO,WACL,OAAOiD,KAAKsB,KAAK+L,OAElB,CACDtO,IAAK,MACLhC,MAAO,SAAagC,GAClB,OAAOiB,KAAKsB,KAAKmI,IAAIzJ,KAAKugC,WAAWxhC,MAEtC,CACDA,IAAK,MACLhC,MAAO,SAAagC,GAClB,OAAOiB,KAAKsB,KAAKgE,IAAItF,KAAKugC,WAAWxhC,MAEtC,CACDA,IAAK,MACLhC,MAAO,SAAagC,EAAKglB,GACvB/jB,KAAKsB,KAAK4D,IAAIlF,KAAKugC,WAAWxhC,GAAMglB,KAErC,CACDhlB,IAAK,SACLhC,MAAO,SAAiBgC,GACtBiB,KAAKsB,KAAK6I,OAAOnK,KAAKugC,WAAWxhC,MAElC,CACDA,IAAK,QACLhC,MAAO,WACLiD,KAAKsB,KAAKmE,YAIP0rC,EAhDmB,IAsDYA,SACpCC,GAAiCp1C,OAAOkH,OAAO,CACjD6B,UAAW,KACXosC,SAAUD,KAERG,GAAarQ,GAAkBf,SAC/BqR,GAAaF,GAAkBD,SAC/BI,GAAkB,CACpB/O,SAAU,YACVC,SAAU,OACVrC,QAASsC,EAAAA,GAiBX,SAAS8O,GAAiBhP,GACxB,OAAQA,GACN,IAAK,YACH,OAAO,SAAUze,GACf,OAAOA,GAGX,IAAK,QACH,OAAO,SAAUA,GACf,OAAOse,GAAuBte,IAIpC,MAAM9jB,EAAW,gCAAgCiB,OAAOshC,IAG1D,SAASiP,GAAShP,EAAUrC,EAASI,GACnC,OAAQiC,GACN,IAAK,WAEH,OAAO,IAAI6O,GAAW,CACpB9Q,OAAQA,IAGZ,IAAK,MAEH,OAAO,IAAI6Q,GAAW,CACpB7Q,OAAQA,EACRJ,QAASz/B,EAAkBy/B,KAG/B,IAAK,cAEH,OAAO,IAAIiR,GAAW,CACpB7Q,OAAQA,EACRJ,QAAS,IAIf,MAAMngC,EAAW,gCAAgCiB,OAAOuhC,IAG1D,IAAIiP,GAxDJ,WACE,IAAIC,EAAS/yC,UAAUlC,OAAS,QAAsB2D,IAAjBzB,UAAU,GAAmBA,UAAU,GAAK2yC,GAC7EK,EAAkBD,EAAOnP,SACzBA,OAA+B,IAApBoP,EAA6BL,GAAgB/O,SAAWoP,EACnEC,EAAkBF,EAAOlP,SACzBA,OAA+B,IAApBoP,EAA6BN,GAAgB9O,SAAWoP,EACnEC,EAAiBH,EAAOvR,QACxBA,OAA6B,IAAnB0R,EAA4BP,GAAgBnR,QAAU0R,EAEhE5O,EAAcsO,GAAiBhP,GAC/BjB,EAAQkQ,GAAShP,EAAUrC,EAAS8C,GACxC,OAAO3B,GA+CLwQ,GAA6BzoC,GAAYc,yBA4E7C,IAAI4nC,GA/CJ,SAAoBzU,GAClB,IAAI0U,EAAuBC,EAEvBC,EAAYT,GAAuB,CACrClP,SAAkM,QAAvLyP,EAA6F,QAApEC,EAAyB3U,EAAQ6U,qCAAsE,IAA3BF,OAAoC,EAASA,EAAuB1P,gBAAgD,IAA1ByP,EAAmCA,EAAwB,QACrQxP,SAAU,aAIZ,OAAO,SAAU4P,GACf,IAAIC,EAAkB1E,EAElB2E,EAAaJ,EAAU7sC,IAAI+sC,GAE/B,GAAkB,MAAdE,EACF,OAAOA,EAG2BhV,EAAQ6U,8BAA5C,IACII,GAAc,OAAyBjV,EAASviC,GAEhDw1C,EAAiB,YAAajT,EAElCA,EAAQwP,QAAU,IAAIprC,SAAQ,eAC1B8wC,EAAUxB,GAAYvyC,EAAcA,EAAc,GAAI8zC,GAAc,GAAI,CAC1EzzC,IAAK,GAAGmC,OAAOq8B,EAAQx+B,IAAK,MAAMmC,OAA+D,QAAvDoxC,EAAmBjQ,GAAuBgQ,UAA0C,IAArBC,EAA8BA,EAAmB,QAC1JvF,QAAmC,mBAAnByD,EAGhBA,EAAe6B,GACf7B,EACAtL,oBAA4D,mBAAhC3H,EAAQ2H,oBAAqC3H,EAAQ2H,oBAAoBmN,GAAU9U,EAAQ2H,oBACvH4I,QAAoC,mBAApBvQ,EAAQuQ,QAAyBvQ,EAAQuQ,QAAQuE,GAA8C,mBAA7B9U,EAAQwQ,iBAAkCxQ,EAAQwQ,iBAAiBsE,GAAmD,QAAxCzE,EAAmBrQ,EAAQuQ,eAA0C,IAArBF,EAA8BA,EAAmBrQ,EAAQwQ,oBAW3Q,OAJAoE,EAAUjtC,IAAImtC,EAAQI,GACtBV,GAA2BU,EAAQ1zC,KAAK,WACtCozC,EAAUhoC,OAAOkoC,MAEZI,IAKPC,GAA6BppC,GAAYc,yBAKzCuoC,GAAY,EAwFhB,IAAIC,GAzEJ,SAAwBrV,GACtB,IAAI0U,EAAuBC,EAEvBW,EAAgBnB,GAAuB,CACzClP,SAAkM,QAAvLyP,EAA6F,QAApEC,EAAyB3U,EAAQ6U,qCAAsE,IAA3BF,OAAoC,EAASA,EAAuB1P,gBAAgD,IAA1ByP,EAAmCA,EAAwB,QACrQxP,SAAU,aAEZ,OAAO,SAAU4P,GACf,IAAIC,EAIAQ,EAEJ,IACEA,EAAiBD,EAAcvtC,IAAI+sC,GACnC,MAAOlyC,GACP,MAAMF,EAAW,0CAA0CiB,OAAOq8B,EAAQx+B,IAAK,MAAMmC,OAAOf,EAAMD,UAGpG,GAAsB,MAAlB4yC,EACF,OAAOA,EAGT,IAYIC,EAZAC,EAAQ,GAAG9xC,OAAOq8B,EAAQx+B,IAAK,qBAAqBmC,OAIhD,QAJwDoxC,EAAmBjQ,GAAuBgQ,EAAQ,CAGhHzQ,gBAAgB,WACmB,IAArB0Q,EAA8BA,EAAmB,OAAQ,KAAKpxC,OAAOyxC,MAEjFM,EAAQ,SAAeC,GACzB,OAAO3V,EAAQj4B,IAAI+sC,EAAZ9U,CAAoB2V,IAGzBC,EAAgB5V,EAAQyH,qBACxB5rB,EAAoD,mBAAhCmkB,EAAQ2H,oBAAqC3H,EAAQ2H,oBAAoBmN,GAAU9U,EAAQ2H,oBAGnH,GAAmB,MAAf3H,EAAQr4B,IAAa,CACvB,IAAIA,EAAMq4B,EAAQr4B,IAMlB6tC,EAAcvH,GAAgB,CAC5BzsC,IAAKi0C,EACL1tC,IAAK2tC,EACL/tC,IAPU,SAAeguC,EAAW7kC,GACpC,OAAOnJ,EAAImtC,EAAJntC,CAAYguC,EAAW7kC,IAO9B22B,qBAAsBmO,EACtB5H,2BAA4BhO,EAAQgO,2BACpCrG,oBAAqB9rB,SAGvB25B,EAAcvH,GAAgB,CAC5BzsC,IAAKi0C,EACL1tC,IAAK2tC,EACLjO,qBAAsBmO,EACtB5H,2BAA4BhO,EAAQgO,2BACpCrG,oBAAqB9rB,IAQzB,OAJAy5B,EAAc3tC,IAAImtC,EAAQU,GAC1BL,GAA2BK,EAAYh0C,KAAK,WAC1C8zC,EAAc1oC,OAAOkoC,MAEhBU,IAQPK,GAAmBR,GAAsB,CAC3C7zC,IAAK,aACLuG,IAAK,SAAa8F,GAChB,OAAO,WACL,OAAOA,IAGXgnC,8BAA+B,CAC7B5P,SAAU,eAWd,IAAI6Q,GAJJ,SAAuBjoC,GACrB,OAAOgoC,GAAiBhoC,IAKtBkoC,GAAmBV,GAAsB,CAC3C7zC,IAAK,UACLuG,IAAK,SAAapF,GAChB,OAAO,WACL,MAAMD,EAAWC,KAIrBkyC,8BAA+B,CAC7B5P,SAAU,eASd,IAAI+Q,GAJJ,SAAuBrzC,GACrB,OAAOozC,GAAiBpzC,IAsB1B,IAAIszC,GALJ,SAA0BhkB,GAExB,OAAOA,GAILikB,GAAsB3uC,EAAkB3C,kBACxCuxC,GAAwB5uC,EAAkB/C,oBAC1C4xC,GAAsB7uC,EAAkB7C,kBAc5C,SAAS2xC,GAAmB1L,EAAgBpzB,GAC1C,IAII++B,EAJAC,EAAUn4C,MAAMmZ,EAAKpY,QAAQq3C,UAAK1zC,GAClC2zC,EAAar4C,MAAMmZ,EAAKpY,QAAQq3C,UAAK1zC,GAErC4zC,EAAc54C,EAA2ByZ,EAAK/C,WAGlD,IACE,IAAKkiC,EAAYp3C,MAAOg3C,EAAUI,EAAYl4C,KAAKe,MAAO,CACxD,IAAIo3C,GAAgB,OAAeL,EAAQ92C,MAAO,GAC9CJ,EAAIu3C,EAAc,GAClBt/B,EAAMs/B,EAAc,GAExB,IACEJ,EAAQn3C,GAAKurC,EAAetzB,GAC5B,MAAO5X,GAEPg3C,EAAWr3C,GAAKK,IAGpB,MAAOI,GACP62C,EAAYj3C,EAAEI,GACd,QACA62C,EAAY/2C,IAGd,MAAO,CAAC42C,EAASE,GAGnB,SAASG,GAAQC,GACf,OAAc,MAAPA,IAAgB5zC,EAAiB4zC,GAG1C,SAASC,GAAmBC,GAC1B,OAAO34C,MAAMC,QAAQ04C,GAAgBA,EAAet4C,OAAO4H,oBAAoB0wC,GAAcpyC,KAAI,SAAUnD,GACzG,OAAOu1C,EAAav1C,MAIxB,SAASw1C,GAAYD,EAAcR,GACjC,OAAOn4C,MAAMC,QAAQ04C,GAAgBR,EACrC93C,OAAO4H,oBAAoB0wC,GAAcxwC,QAAO,SAAUC,EAAKhF,EAAKiF,GAClE,OAAOtF,EAAcA,EAAc,GAAIqF,GAAM,IAAI,OAAiB,GAAIhF,EAAK+0C,EAAQ9vC,OAClF,IAGL,SAASwwC,GAAcF,EAAcR,EAASE,GAI5C,OAAOO,GAAYD,EAHNN,EAAW9xC,KAAI,SAAUuyC,EAAWzwC,GAC/C,OAAoB,MAAbywC,EAAoBd,GAAoBG,EAAQ9vC,IAAQxD,EAAiBi0C,GAAaf,GAAsBe,GAAahB,GAAoBgB,OAsBxJ,IAAIC,GAAc9B,GAAsB,CACtC7zC,IAAK,gBACLuG,IAAK,SAAagvC,GAChB,OAAO,SAAUK,GACf,IAIIC,EAAsBhB,GAJhBe,EAAOrvC,IAEN+uC,GAAmBC,IAG1BO,GAAuB,OAAeD,EAAqB,GAC3Dd,EAAUe,EAAqB,GAC/Bb,EAAaa,EAAqB,GAGtC,OAAOL,GAAcF,EAAcR,EAASE,KAGhDzI,4BAA4B,IAK1BuJ,GAAalC,GAAsB,CACrC7zC,IAAK,eACLuG,IAAK,SAAagvC,GAChB,OAAO,SAAUS,GACf,IAKIC,EAAuBpB,GALjBmB,EAAOzvC,IAGN+uC,GAAmBC,IAG1BW,GAAuB,OAAeD,EAAsB,GAC5DlB,EAAUmB,EAAqB,GAC/BjB,EAAaiB,EAAqB,GAGtC,OAAIjB,EAAWxwC,MAAK,SAAU4wC,GAC5B,OAAQ5zC,EAAiB4zC,MAElBI,GAAcF,EAAcR,EAASE,GAMvC,IAAIryC,SAAQ,SAAUC,GAC3B,IACIszC,EADAC,EAAc95C,EAA2B24C,EAAWjiC,WAGxD,IACE,IAAIqjC,EAAQ,WACV,IAAIC,GAAgB,OAAeH,EAAQn4C,MAAO,GAC9CJ,EAAI04C,EAAc,GAClBjB,EAAMiB,EAAc,GAEpB70C,EAAiB4zC,IACnBA,EAAI1zC,MAAK,SAAUb,GACjBi0C,EAAQn3C,GAAKkD,EACbm0C,EAAWr3C,QAAK0D,EAChBuB,EAAQ4yC,GAAcF,EAAcR,EAASE,OAC5C/wC,OAAM,SAAU9C,GACjB6zC,EAAWr3C,GAAKwD,EAChByB,EAAQ4yC,GAAcF,EAAcR,EAASE,QAKnD,IAAKmB,EAAYt4C,MAAOq4C,EAAUC,EAAYp5C,KAAKe,MACjDs4C,IAEF,MAAOh4C,GACP+3C,EAAYn4C,EAAEI,GACd,QACA+3C,EAAYj4C,UAKpBquC,4BAA4B,IA6F1B+J,GAAiB,CACnBZ,YAAaA,GACbI,WAAYA,GACZS,WA5Fe3C,GAAsB,CACrC7zC,IAAK,eACLuG,IAAK,SAAagvC,GAChB,OAAO,SAAUkB,GACf,IAKIC,EAAuB7B,GALjB4B,EAAOlwC,IAGN+uC,GAAmBC,IAG1BoB,GAAuB,OAAeD,EAAsB,GAC5D3B,EAAU4B,EAAqB,GAC/B1B,EAAa0B,EAAqB,GAGtC,GAAI1B,EAAWzwC,OAAM,SAAU6wC,GAC7B,OAAc,MAAPA,KAEP,OAAOG,GAAYD,EAAcR,GAInC,IAAI3zC,EAAQ6zC,EAAWvwC,KAAK0wC,IAE5B,GAAa,MAATh0C,EACF,MAAMA,EAIR,OAAOwB,QAAQ+B,IAAIswC,GAAYtzC,MAAK,SAAUi1C,GAC5C,OAAOpB,GAAYD,GAlIiBsB,EAkIgC9B,EAAS6B,EAjI/DzzC,KAAI,SAAUrC,EAAQmE,GACxC,YAQa3D,IAAXR,EAAuB+1C,EAAY5xC,GAAOnE,OAVhD,IAA4C+1C,OAsI1CrK,4BAA4B,IA2D5BsK,kBAzDsBjD,GAAsB,CAC5C7zC,IAAK,sBACLuG,IAAK,SAAagvC,GAChB,OAAO,SAAUwB,GACf,IAKIC,EAAuBnC,GALjBkC,EAAOxwC,IAGN+uC,GAAmBC,IAG1B0B,GAAuB,OAAeD,EAAsB,GAC5DjC,EAAUkC,EAAqB,GAC/BhC,EAAagC,EAAqB,GAGtC,OAAIhC,EAAWzwC,OAAM,SAAU6wC,GAC7B,OAAQ5zC,EAAiB4zC,MAElBI,GAAcF,EAAcR,EAASE,GAIvCryC,QAAQ+B,IAAIswC,EAAW9xC,KAAI,SAAUkyC,EAAKz3C,GAC/C,OAAO6D,EAAiB4zC,GAAOA,EAAI1zC,MAAK,SAAUb,GAChDi0C,EAAQn3C,GAAKkD,EACbm0C,EAAWr3C,QAAK0D,KACf4C,OAAM,SAAU9C,GACjB2zC,EAAQn3C,QAAK0D,EACb2zC,EAAWr3C,GAAKwD,KACb,SAENO,MAAK,WACJ,OAAO8zC,GAAcF,EAAcR,EAASE,QAIlDzI,4BAA4B,IAsB5B0K,OApBWrD,GAAsB,CACjC7zC,IAAK,WACLuG,IAAK,SAAa4wC,GAChB,OAAO,SAAUC,GACf,IAAI7wC,EAAM6wC,EAAO7wC,IAEjB,IACE,OAAOkmC,GAAgBzuC,MAAM42C,GAAoBruC,EAAI4wC,KACrD,MAAOzB,GACP,OAAOjJ,GAAgBzuC,MAAMyD,EAAiBi0C,GAAaf,GAAsBe,GAAahB,GAAoBgB,OAIxHlJ,4BAA4B,KAS1BjnC,GAAiBQ,EAAkBR,eACnC8xC,GAAiB9sC,GAAYZ,aAC7B2tC,GAAe/lB,GACfgmB,GAAqBhmB,GACrBimB,GAAkBhvC,GAAqBL,cACvCsvC,GAAkB7+B,GAClB8+B,GAAkBvsB,GAAkBR,cAmBpCgtB,GAAe,CAEjBhuC,aAAc0tC,GACdlvC,cAAeqvC,GACfjyC,eAAgBA,GAEhBqyC,WAAYN,GACZO,iBAAkBN,GAClBO,yCAA0Che,GAE1CrJ,KAAMyhB,GACNnM,SAAU0G,GAEVsL,WAAY9E,GACZ+E,eAAgBnE,GAChBoE,cAAe3D,GACf4D,cAAe1D,GACf2D,iBAAkB1D,GAElByC,OAxBaX,GAAeW,OAyB5BvB,YArBkBY,GAAeZ,YAsBjCI,WAvBiBQ,GAAeR,WAwBhCS,WA1BiBD,GAAeC,WA2BhCM,kBA1BwBP,GAAeO,kBA4BvC9f,eAxCqBI,GAyCrBT,uBAvC6BS,GAwC7BghB,eA7CqBhhB,GA8CrBihB,uBA5C6BjhB,GA6C7BH,kBAvCwBG,GAwCxBkhB,oBAzC0BlhB,GA0C1BmhB,+BAAgC/e,GAChCgf,4BAA6Blb,GAC7BpG,mDA7CyDE,GA8CzDD,2CAhDiDC,GAiDjDqhB,2CApDiDrhB,GAsDjDshB,kBA3CwB1b,GA4CxB2b,8BAA+Bjb,GAE/Bkb,sBAjD4B/f,GAkD5BggB,kBAjDwBhgB,GAkDxBigB,sCAjDmCjgB,GAkDnCkgB,kBAAmBrB,GAEnBsB,UAAWtmB,GACXumB,cAAexB,IAKbyB,GAAiBvB,GAAaC","sources":["webpack://the-good-code/./node_modules/recoil/es/recoil.js"],"sourcesContent":["import _toConsumableArray from \"/workspace/node_modules/gatsby/node_modules/@babel/runtime/helpers/esm/toConsumableArray\";\nimport _objectWithoutProperties from \"/workspace/node_modules/gatsby/node_modules/@babel/runtime/helpers/esm/objectWithoutProperties\";\nimport _asyncToGenerator from \"/workspace/node_modules/gatsby/node_modules/@babel/runtime/helpers/esm/asyncToGenerator\";\nimport _slicedToArray from \"/workspace/node_modules/gatsby/node_modules/@babel/runtime/helpers/esm/slicedToArray\";\nimport _wrapNativeSuper from \"/workspace/node_modules/gatsby/node_modules/@babel/runtime/helpers/esm/wrapNativeSuper\";\nimport _defineProperty2 from \"/workspace/node_modules/gatsby/node_modules/@babel/runtime/helpers/esm/defineProperty\";\nimport _assertThisInitialized from \"/workspace/node_modules/gatsby/node_modules/@babel/runtime/helpers/esm/assertThisInitialized\";\nimport _inherits from \"/workspace/node_modules/gatsby/node_modules/@babel/runtime/helpers/esm/inherits\";\nimport _possibleConstructorReturn from \"/workspace/node_modules/gatsby/node_modules/@babel/runtime/helpers/esm/possibleConstructorReturn\";\nimport _getPrototypeOf from \"/workspace/node_modules/gatsby/node_modules/@babel/runtime/helpers/esm/getPrototypeOf\";\nimport _classCallCheck from \"/workspace/node_modules/gatsby/node_modules/@babel/runtime/helpers/esm/classCallCheck\";\nimport _createClass from \"/workspace/node_modules/gatsby/node_modules/@babel/runtime/helpers/esm/createClass\";\nvar _excluded = [\"override\"],\n    _excluded2 = [\"cachePolicyForParams_UNSTABLE\"];\nimport \"core-js/modules/es.promise.finally.js\";\n\nvar _marked = /*#__PURE__*/_regeneratorRuntime.mark(filterIterable),\n    _marked2 = /*#__PURE__*/_regeneratorRuntime.mark(concatIterables);\n\nimport _regeneratorRuntime from \"/workspace/node_modules/gatsby/node_modules/@babel/runtime/regenerator\";\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\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 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\nfunction err(message) {\n  var error = new Error(message); // In V8, Error objects keep the closure scope chain alive until the\n  // err.stack property is accessed.\n\n  if (error.stack === undefined) {\n    // IE sets the stack only if error is thrown\n    try {\n      throw error;\n    } catch (_) {} // eslint-disable-line fb-www/no-unused-catch-bindings, no-empty\n\n  }\n\n  return error;\n}\n\nvar err_1 = err; // @oss-only\n\nvar Recoil_err = err_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// 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\nfunction nullthrows(x, message) {\n  if (x != null) {\n    return x;\n  }\n\n  throw Recoil_err(message !== null && message !== void 0 ? message : 'Got unexpected null or undefined');\n}\n\nvar Recoil_nullthrows = nullthrows;\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\nvar BaseLoadable = /*#__PURE__*/function () {\n  function BaseLoadable() {\n    _classCallCheck(this, BaseLoadable);\n  }\n\n  _createClass(BaseLoadable, [{\n    key: \"getValue\",\n    value: function getValue() {\n      throw Recoil_err('BaseLoadable');\n    }\n  }, {\n    key: \"toPromise\",\n    value: function toPromise() {\n      throw Recoil_err('BaseLoadable');\n    }\n  }, {\n    key: \"valueMaybe\",\n    value: function valueMaybe() {\n      throw Recoil_err('BaseLoadable');\n    }\n  }, {\n    key: \"valueOrThrow\",\n    value: function valueOrThrow() {\n      // $FlowFixMe[prop-missing]\n      throw Recoil_err(\"Loadable expected value, but in \\\"\".concat(this.state, \"\\\" state\"));\n    }\n  }, {\n    key: \"promiseMaybe\",\n    value: function promiseMaybe() {\n      throw Recoil_err('BaseLoadable');\n    }\n  }, {\n    key: \"promiseOrThrow\",\n    value: function promiseOrThrow() {\n      // $FlowFixMe[prop-missing]\n      throw Recoil_err(\"Loadable expected promise, but in \\\"\".concat(this.state, \"\\\" state\"));\n    }\n  }, {\n    key: \"errorMaybe\",\n    value: function errorMaybe() {\n      throw Recoil_err('BaseLoadable');\n    }\n  }, {\n    key: \"errorOrThrow\",\n    value: function errorOrThrow() {\n      // $FlowFixMe[prop-missing]\n      throw Recoil_err(\"Loadable expected error, but in \\\"\".concat(this.state, \"\\\" state\"));\n    }\n  }, {\n    key: \"is\",\n    value: function is(other) {\n      // $FlowFixMe[prop-missing]\n      return other.state === this.state && other.contents === this.contents;\n    }\n  }, {\n    key: \"map\",\n    value: function map(_map) {\n      throw Recoil_err('BaseLoadable');\n    }\n  }]);\n\n  return BaseLoadable;\n}();\n\nvar ValueLoadable = /*#__PURE__*/function (_BaseLoadable) {\n  _inherits(ValueLoadable, _BaseLoadable);\n\n  var _super = _createSuper(ValueLoadable);\n\n  function ValueLoadable(value) {\n    var _this;\n\n    _classCallCheck(this, ValueLoadable);\n\n    _this = _super.call(this);\n\n    _defineProperty(_assertThisInitialized(_this), \"state\", 'hasValue');\n\n    _defineProperty(_assertThisInitialized(_this), \"contents\", void 0);\n\n    _this.contents = value;\n    return _this;\n  }\n\n  _createClass(ValueLoadable, [{\n    key: \"getValue\",\n    value: function getValue() {\n      return this.contents;\n    }\n  }, {\n    key: \"toPromise\",\n    value: function toPromise() {\n      return Promise.resolve(this.contents);\n    }\n  }, {\n    key: \"valueMaybe\",\n    value: function valueMaybe() {\n      return this.contents;\n    }\n  }, {\n    key: \"valueOrThrow\",\n    value: function valueOrThrow() {\n      return this.contents;\n    }\n  }, {\n    key: \"promiseMaybe\",\n    value: function promiseMaybe() {\n      return undefined;\n    }\n  }, {\n    key: \"errorMaybe\",\n    value: function errorMaybe() {\n      return undefined;\n    }\n  }, {\n    key: \"map\",\n    value: function map(_map2) {\n      var _this2 = this;\n\n      try {\n        var next = _map2(this.contents);\n\n        return Recoil_isPromise(next) ? loadableWithPromise(next) : isLoadable(next) ? next : 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        loadableWithPromise(e.next(function () {\n          return _this2.map(_map2);\n        })) : loadableWithError(e);\n      }\n    }\n  }]);\n\n  return ValueLoadable;\n}(BaseLoadable);\n\nvar ErrorLoadable = /*#__PURE__*/function (_BaseLoadable2) {\n  _inherits(ErrorLoadable, _BaseLoadable2);\n\n  var _super2 = _createSuper(ErrorLoadable);\n\n  function ErrorLoadable(error) {\n    var _this3;\n\n    _classCallCheck(this, ErrorLoadable);\n\n    _this3 = _super2.call(this);\n\n    _defineProperty(_assertThisInitialized(_this3), \"state\", 'hasError');\n\n    _defineProperty(_assertThisInitialized(_this3), \"contents\", void 0);\n\n    _this3.contents = error;\n    return _this3;\n  }\n\n  _createClass(ErrorLoadable, [{\n    key: \"getValue\",\n    value: function getValue() {\n      throw this.contents;\n    }\n  }, {\n    key: \"toPromise\",\n    value: function toPromise() {\n      return Promise.reject(this.contents);\n    }\n  }, {\n    key: \"valueMaybe\",\n    value: function valueMaybe() {\n      return undefined;\n    }\n  }, {\n    key: \"promiseMaybe\",\n    value: function promiseMaybe() {\n      return undefined;\n    }\n  }, {\n    key: \"errorMaybe\",\n    value: function errorMaybe() {\n      return this.contents;\n    }\n  }, {\n    key: \"errorOrThrow\",\n    value: function errorOrThrow() {\n      return this.contents;\n    }\n  }, {\n    key: \"map\",\n    value: function map(_map) {\n      // $FlowIssue[incompatible-return]\n      return this;\n    }\n  }]);\n\n  return ErrorLoadable;\n}(BaseLoadable);\n\nvar LoadingLoadable = /*#__PURE__*/function (_BaseLoadable3) {\n  _inherits(LoadingLoadable, _BaseLoadable3);\n\n  var _super3 = _createSuper(LoadingLoadable);\n\n  function LoadingLoadable(promise) {\n    var _this4;\n\n    _classCallCheck(this, LoadingLoadable);\n\n    _this4 = _super3.call(this);\n\n    _defineProperty(_assertThisInitialized(_this4), \"state\", 'loading');\n\n    _defineProperty(_assertThisInitialized(_this4), \"contents\", void 0);\n\n    _this4.contents = promise;\n    return _this4;\n  }\n\n  _createClass(LoadingLoadable, [{\n    key: \"getValue\",\n    value: function getValue() {\n      throw this.contents;\n    }\n  }, {\n    key: \"toPromise\",\n    value: function toPromise() {\n      return this.contents;\n    }\n  }, {\n    key: \"valueMaybe\",\n    value: function valueMaybe() {\n      return undefined;\n    }\n  }, {\n    key: \"promiseMaybe\",\n    value: function promiseMaybe() {\n      return this.contents;\n    }\n  }, {\n    key: \"promiseOrThrow\",\n    value: function promiseOrThrow() {\n      return this.contents;\n    }\n  }, {\n    key: \"errorMaybe\",\n    value: function errorMaybe() {\n      return undefined;\n    }\n  }, {\n    key: \"map\",\n    value: function map(_map3) {\n      var _this5 = this;\n\n      return loadableWithPromise(this.contents.then(function (value) {\n        var next = _map3(value);\n\n        if (isLoadable(next)) {\n          var nextLoadable = next;\n\n          switch (nextLoadable.state) {\n            case 'hasValue':\n              return nextLoadable.contents;\n\n            case 'hasError':\n              throw nextLoadable.contents;\n\n            case 'loading':\n              return nextLoadable.contents;\n          }\n        } // $FlowIssue[incompatible-return]\n\n\n        return next;\n      }).catch(function (e) {\n        if (Recoil_isPromise(e)) {\n          // we were \"suspended,\" try again\n          return e.then(function () {\n            return _this5.map(_map3).contents;\n          });\n        }\n\n        throw e;\n      }));\n    }\n  }]);\n\n  return LoadingLoadable;\n}(BaseLoadable);\n\nfunction loadableWithValue(value) {\n  return Object.freeze(new ValueLoadable(value));\n}\n\nfunction loadableWithError(error) {\n  return Object.freeze(new ErrorLoadable(error));\n}\n\nfunction loadableWithPromise(promise) {\n  return Object.freeze(new LoadingLoadable(promise));\n}\n\nfunction loadableLoading() {\n  return Object.freeze(new LoadingLoadable(new Promise(function () {})));\n}\n\nfunction loadableAllArray(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  })));\n}\n\nfunction loadableAll(inputs) {\n  var unwrapedInputs = Array.isArray(inputs) ? inputs : Object.getOwnPropertyNames(inputs).map(function (key) {\n    return inputs[key];\n  });\n  var normalizedInputs = unwrapedInputs.map(function (x) {\n    return isLoadable(x) ? x : Recoil_isPromise(x) ? loadableWithPromise(x) : loadableWithValue(x);\n  });\n  var output = loadableAllArray(normalizedInputs);\n  return Array.isArray(inputs) ? // $FlowIssue[incompatible-return]\n  output : // Object.getOwnPropertyNames() has consistent key ordering with ES6\n  // $FlowIssue[incompatible-call]\n  output.map(function (outputs) {\n    return Object.getOwnPropertyNames(inputs).reduce(function (out, key, idx) {\n      return _objectSpread(_objectSpread({}, out), {}, _defineProperty2({}, key, outputs[idx]));\n    }, {});\n  });\n}\n\nfunction isLoadable(x) {\n  return x instanceof BaseLoadable;\n}\n\nvar LoadableStaticInterface = {\n  of: function of(value) {\n    return Recoil_isPromise(value) ? loadableWithPromise(value) : isLoadable(value) ? value : loadableWithValue(value);\n  },\n  error: function error(_error) {\n    return loadableWithError(_error);\n  },\n  // $FlowIssue[incompatible-return]\n  loading: function loading() {\n    return loadableLoading();\n  },\n  // $FlowIssue[unclear-type]\n  all: loadableAll,\n  isLoadable: isLoadable\n};\nvar Recoil_Loadable = {\n  loadableWithValue: loadableWithValue,\n  loadableWithError: loadableWithError,\n  loadableWithPromise: loadableWithPromise,\n  loadableLoading: loadableLoading,\n  loadableAll: loadableAll,\n  isLoadable: isLoadable,\n  RecoilLoadable: LoadableStaticInterface\n};\nvar Recoil_Loadable_1 = Recoil_Loadable.loadableWithValue;\nvar Recoil_Loadable_2 = Recoil_Loadable.loadableWithError;\nvar Recoil_Loadable_3 = Recoil_Loadable.loadableWithPromise;\nvar Recoil_Loadable_4 = Recoil_Loadable.loadableLoading;\nvar Recoil_Loadable_5 = Recoil_Loadable.loadableAll;\nvar Recoil_Loadable_6 = Recoil_Loadable.isLoadable;\nvar Recoil_Loadable_7 = Recoil_Loadable.RecoilLoadable;\nvar Recoil_Loadable$1 = /*#__PURE__*/Object.freeze({\n  __proto__: null,\n  loadableWithValue: Recoil_Loadable_1,\n  loadableWithError: Recoil_Loadable_2,\n  loadableWithPromise: Recoil_Loadable_3,\n  loadableLoading: Recoil_Loadable_4,\n  loadableAll: Recoil_Loadable_5,\n  isLoadable: Recoil_Loadable_6,\n  RecoilLoadable: Recoil_Loadable_7\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 gks = new Map().set('recoil_hamt_2020', true).set('recoil_sync_external_store', true).set('recoil_suppress_rerender_in_callback', true).set('recoil_memory_managament_2020', true);\n\nfunction Recoil_gkx_OSS(gk) {\n  var _gks$get;\n\n  return (_gks$get = gks.get(gk)) !== null && _gks$get !== void 0 ? _gks$get : false;\n}\n\nRecoil_gkx_OSS.setPass = function (gk) {\n  gks.set(gk, true);\n};\n\nRecoil_gkx_OSS.setFail = function (gk) {\n  gks.set(gk, false);\n};\n\nRecoil_gkx_OSS.clear = function () {\n  gks.clear();\n};\n\nvar Recoil_gkx = Recoil_gkx_OSS; // @oss-only\n\nvar _createMutableSource, _useMutableSource, _useSyncExternalStore;\n\nvar createMutableSource = // flowlint-next-line unclear-type:off\n(_createMutableSource = react.createMutableSource) !== null && _createMutableSource !== void 0 ? _createMutableSource : react.unstable_createMutableSource;\nvar useMutableSource = // flowlint-next-line unclear-type:off\n(_useMutableSource = react.useMutableSource) !== null && _useMutableSource !== void 0 ? _useMutableSource : react.unstable_useMutableSource; // https://github.com/reactwg/react-18/discussions/86\n\nvar useSyncExternalStore = // flowlint-next-line unclear-type:off\n(_useSyncExternalStore = react.useSyncExternalStore) !== null && _useSyncExternalStore !== void 0 ? _useSyncExternalStore : // flowlint-next-line unclear-type:off\nreact.unstable_useSyncExternalStore;\n/**\n * mode: The React API and approach to use for syncing state with React\n * early: Re-renders from Recoil updates occur:\n *    1) earlier\n *    2) in sync with React updates in the same batch\n *    3) before transaction observers instead of after.\n * concurrent: Is the current mode compatible with Concurrent Mode and useTransition()\n */\n\nfunction reactMode() {\n  // NOTE: This mode is currently broken with some Suspense cases\n  // see Recoil_selector-test.js\n  if (Recoil_gkx('recoil_transition_support')) {\n    return {\n      mode: 'TRANSITION_SUPPORT',\n      early: true,\n      concurrent: true\n    };\n  }\n\n  if (Recoil_gkx('recoil_sync_external_store') && useSyncExternalStore != null) {\n    return {\n      mode: 'SYNC_EXTERNAL_STORE',\n      early: true,\n      concurrent: false\n    };\n  }\n\n  if (Recoil_gkx('recoil_mutable_source') && useMutableSource != null && typeof window !== 'undefined' && !window.$disableRecoilValueMutableSource_TEMP_HACK_DO_NOT_USE) {\n    return Recoil_gkx('recoil_suppress_rerender_in_callback') ? {\n      mode: 'MUTABLE_SOURCE',\n      early: true,\n      concurrent: true\n    } : {\n      mode: 'MUTABLE_SOURCE',\n      early: false,\n      concurrent: false\n    };\n  }\n\n  return Recoil_gkx('recoil_suppress_rerender_in_callback') ? {\n    mode: 'LEGACY',\n    early: true,\n    concurrent: false\n  } : {\n    mode: 'LEGACY',\n    early: false,\n    concurrent: false\n  };\n} // TODO Need to figure out if there is a standard/open-source equivalent to see if hot module replacement is happening:\n\n\nfunction isFastRefreshEnabled() {\n  // @fb-only: const {isAcceptingUpdate} = require('__debug');\n  // @fb-only: return typeof isAcceptingUpdate === 'function' && isAcceptingUpdate();\n  return false; // @oss-only\n}\n\nvar Recoil_ReactMode = {\n  createMutableSource: createMutableSource,\n  useMutableSource: useMutableSource,\n  useSyncExternalStore: useSyncExternalStore,\n  reactMode: reactMode,\n  isFastRefreshEnabled: isFastRefreshEnabled\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\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 _super4 = _createSuper(RecoilState);\n\n  function RecoilState() {\n    _classCallCheck(this, RecoilState);\n\n    return _super4.apply(this, arguments);\n  }\n\n  return RecoilState;\n}(AbstractRecoilValue);\n\nvar RecoilValueReadOnly = /*#__PURE__*/function (_AbstractRecoilValue2) {\n  _inherits(RecoilValueReadOnly, _AbstractRecoilValue2);\n\n  var _super5 = _createSuper(RecoilValueReadOnly);\n\n  function RecoilValueReadOnly() {\n    _classCallCheck(this, RecoilValueReadOnly);\n\n    return _super5.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/**\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/**\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, _iterator, _step, value;\n\n    return _regeneratorRuntime.wrap(function _callee$(_context) {\n      while (1) {\n        switch (_context.prev = _context.next) {\n          case 0:\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 = 10;\n              break;\n            }\n\n            value = _step.value;\n            _context.next = 8;\n            return callback(value, index++);\n\n          case 8:\n            _context.next = 4;\n            break;\n\n          case 10:\n            _context.next = 15;\n            break;\n\n          case 12:\n            _context.prev = 12;\n            _context.t0 = _context[\"catch\"](2);\n\n            _iterator.e(_context.t0);\n\n          case 15:\n            _context.prev = 15;\n\n            _iterator.f();\n\n            return _context.finish(15);\n\n          case 18:\n          case \"end\":\n            return _context.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 recoverableViolation(message, _projectName) {\n  var _ref2 = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : {},\n      error = _ref2.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;\nvar isFastRefreshEnabled$1 = Recoil_ReactMode.isFastRefreshEnabled;\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 _super6 = _createSuper(RecoilValueNotReady);\n\n  function RecoilValueNotReady(key) {\n    _classCallCheck(this, RecoilValueNotReady);\n\n    return _super6.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.\");\n\n    if (process.env.NODE_ENV !== \"production\") {\n      // TODO Figure this out for open-source\n      if (!isFastRefreshEnabled$1()) {\n        Recoil_expectationViolation(message, 'recoil');\n      }\n    } else {\n      // @fb-only: recoverableViolation(message, 'recoil');\n      console.warn(message); // @oss-only\n    }\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 _super7 = _createSuper(NodeMissingError);\n\n  function NodeMissingError() {\n    _classCallCheck(this, NodeMissingError);\n\n    return _super7.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('recoil_memory_managament_2020')) {\n    return;\n  }\n\n  var node = nodes.get(key);\n\n  if (node !== null && node !== void 0 && (_node$shouldDeleteCon = node.shouldDeleteConfigOnRelease) !== null && _node$shouldDeleteCon !== 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('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\nfunction enqueueExecution(s, f) {\n  f();\n}\n\nvar Recoil_Queue = {\n  enqueueExecution: enqueueExecution\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  // $FlowIssue\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 _iterator2 = _createForOfIteratorHelper(existing.entries()),\n          _step2;\n\n      try {\n        for (_iterator2.s(); !(_step2 = _iterator2.n()).done;) {\n          var _step2$value = _slicedToArray(_step2.value, 2),\n              k = _step2$value[0],\n              v = _step2$value[1];\n\n          this._hamt.set(k, v);\n        }\n      } catch (err) {\n        _iterator2.e(err);\n      } finally {\n        _iterator2.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('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});\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), _key3 = 1; _key3 < _len3; _key3++) {\n    setsWithValuesToRemove[_key3 - 1] = arguments[_key3];\n  }\n\n  var _iterator3 = _createForOfIteratorHelper(set),\n      _step3;\n\n  try {\n    FIRST: for (_iterator3.s(); !(_step3 = _iterator3.n()).done;) {\n      var value = _step3.value;\n\n      var _iterator4 = _createForOfIteratorHelper(setsWithValuesToRemove),\n          _step4;\n\n      try {\n        for (_iterator4.s(); !(_step4 = _iterator4.n()).done;) {\n          var otherSet = _step4.value;\n\n          if (otherSet.has(value)) {\n            continue FIRST;\n          }\n        }\n      } catch (err) {\n        _iterator4.e(err);\n      } finally {\n        _iterator4.f();\n      }\n\n      ret.add(value);\n    }\n  } catch (err) {\n    _iterator3.e(err);\n  } finally {\n    _iterator3.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 makeGraph() {\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 mergeDepsIntoGraph(key, newDeps, 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  var oldDeps = nodeDeps.get(key);\n\n  if (oldDeps && olderGraph && oldDeps !== olderGraph.nodeDeps.get(key)) {\n    return;\n  } // Update nodeDeps:\n\n\n  nodeDeps.set(key, newDeps); // Add new deps to nodeToNodeSubscriptions:\n\n  var addedDeps = oldDeps == null ? newDeps : Recoil_differenceSets(newDeps, oldDeps);\n\n  var _iterator5 = _createForOfIteratorHelper(addedDeps),\n      _step5;\n\n  try {\n    for (_iterator5.s(); !(_step5 = _iterator5.n()).done;) {\n      var _dep = _step5.value;\n\n      if (!nodeToNodeSubscriptions.has(_dep)) {\n        nodeToNodeSubscriptions.set(_dep, new Set());\n      }\n\n      var _existing = Recoil_nullthrows(nodeToNodeSubscriptions.get(_dep));\n\n      _existing.add(key);\n    } // Remove removed deps from nodeToNodeSubscriptions:\n\n  } catch (err) {\n    _iterator5.e(err);\n  } finally {\n    _iterator5.f();\n  }\n\n  if (oldDeps) {\n    var removedDeps = Recoil_differenceSets(oldDeps, newDeps);\n\n    var _iterator6 = _createForOfIteratorHelper(removedDeps),\n        _step6;\n\n    try {\n      for (_iterator6.s(); !(_step6 = _iterator6.n()).done;) {\n        var dep = _step6.value;\n\n        if (!nodeToNodeSubscriptions.has(dep)) {\n          return;\n        }\n\n        var existing = Recoil_nullthrows(nodeToNodeSubscriptions.get(dep));\n        existing.delete(key);\n\n        if (existing.size === 0) {\n          nodeToNodeSubscriptions.delete(dep);\n        }\n      }\n    } catch (err) {\n      _iterator6.e(err);\n    } finally {\n      _iterator6.f();\n    }\n  }\n}\n\nfunction saveDepsToStore(key, deps, 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  mergeDepsIntoGraph(key, deps, 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    mergeDepsIntoGraph(key, deps, 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      mergeDepsIntoGraph(key, deps, nextGraph, graph);\n    }\n  }\n}\n\nvar Recoil_Graph = {\n  cloneGraph: cloneGraph,\n  graph: makeGraph,\n  saveDepsToStore: saveDepsToStore\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 nextTreeStateVersion = 0;\n\nvar getNextTreeStateVersion = function getNextTreeStateVersion() {\n  return nextTreeStateVersion++;\n};\n\nvar nextStoreID = 0;\n\nvar getNextStoreID = function getNextStoreID() {\n  return nextStoreID++;\n};\n\nvar nextComponentID = 0;\n\nvar getNextComponentID = function getNextComponentID() {\n  return nextComponentID++;\n};\n\nvar Recoil_Keys = {\n  getNextTreeStateVersion: getNextTreeStateVersion,\n  getNextStoreID: getNextStoreID,\n  getNextComponentID: getNextComponentID\n};\nvar persistentMap$1 = Recoil_PersistentMap$1.persistentMap;\nvar graph = Recoil_Graph.graph;\nvar getNextTreeStateVersion$1 = Recoil_Keys.getNextTreeStateVersion;\n\nfunction makeEmptyTreeState() {\n  var version = getNextTreeStateVersion$1();\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()),\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$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 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};\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, _iterator7, _step7, value;\n\n  return _regeneratorRuntime.wrap(function filterIterable$(_context2) {\n    while (1) {\n      switch (_context2.prev = _context2.next) {\n        case 0:\n          // Use generator to create iterable/iterator\n          index = 0;\n          _iterator7 = _createForOfIteratorHelper(iterable);\n          _context2.prev = 2;\n\n          _iterator7.s();\n\n        case 4:\n          if ((_step7 = _iterator7.n()).done) {\n            _context2.next = 11;\n            break;\n          }\n\n          value = _step7.value;\n\n          if (!predicate(value, index++)) {\n            _context2.next = 9;\n            break;\n          }\n\n          _context2.next = 9;\n          return value;\n\n        case 9:\n          _context2.next = 4;\n          break;\n\n        case 11:\n          _context2.next = 16;\n          break;\n\n        case 13:\n          _context2.prev = 13;\n          _context2.t0 = _context2[\"catch\"](2);\n\n          _iterator7.e(_context2.t0);\n\n        case 16:\n          _context2.prev = 16;\n\n          _iterator7.f();\n\n          return _context2.finish(16);\n\n        case 19:\n        case \"end\":\n          return _context2.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 * Return a proxy object based on the provided base and factories objects.\n * The proxy will include all properties of the base object as-is.\n * The factories object contains callbacks to obtain the values of the properies\n * for its keys.\n *\n * This is useful for providing users an object where some properties may be\n * lazily computed only on first access.\n */\n// $FlowIssue[unclear-type]\n\nfunction lazyProxy(base, factories) {\n  var proxy = new Proxy(base, {\n    // Compute and cache lazy property if not already done.\n    get: function get(target, prop) {\n      if (!(prop in target) && prop in factories) {\n        target[prop] = factories[prop]();\n      }\n\n      return target[prop];\n    },\n    // This method allows user to iterate keys as normal\n    ownKeys: function ownKeys(target) {\n      return Object.keys(target);\n    }\n  }); // $FlowIssue[incompatible-return]\n\n  return proxy;\n}\n\nvar Recoil_lazyProxy = lazyProxy;\nvar getNode$1 = Recoil_Node.getNode,\n    getNodeMaybe$1 = Recoil_Node.getNodeMaybe,\n    recoilValuesForKeys$1 = Recoil_Node.recoilValuesForKeys;\nvar RetentionZone$1 = Recoil_RetentionZone.RetentionZone;\nvar setByAddingToSet$1 = Recoil_CopyOnWrite.setByAddingToSet; // 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 _super8 = _createSuper(ReadOnlyRecoilValueError);\n\n  function ReadOnlyRecoilValueError() {\n    _classCallCheck(this, ReadOnlyRecoilValueError);\n\n    return _super8.apply(this, arguments);\n  }\n\n  return ReadOnlyRecoilValueError;\n}( /*#__PURE__*/_wrapNativeSuper(Error));\n\nfunction initializeRetentionForNode(store, nodeKey, retainedBy) {\n  if (!Recoil_gkx('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 _iterator8 = _createForOfIteratorHelper(retainedBy),\n        _step8;\n\n    try {\n      for (_iterator8.s(); !(_step8 = _iterator8.n()).done;) {\n        var zone = _step8.value;\n        addToZone(zone);\n      }\n    } catch (err) {\n      _iterator8.e(err);\n    } finally {\n      _iterator8.f();\n    }\n  }\n\n  return function () {\n    if (!Recoil_gkx('recoil_memory_managament_2020')) {\n      return;\n    }\n\n    var _store$getState4 = store.getState(),\n        retention = _store$getState4.retention;\n\n    function deleteFromZone(zone) {\n      var set = retention.nodesRetainedByZone.get(zone);\n      set === null || set === void 0 ? void 0 : set.delete(nodeKey);\n\n      if (set && set.size === 0) {\n        retention.nodesRetainedByZone.delete(zone);\n      }\n    }\n\n    if (retainedBy instanceof RetentionZone$1) {\n      deleteFromZone(retainedBy);\n    } else if (Array.isArray(retainedBy)) {\n      var _iterator9 = _createForOfIteratorHelper(retainedBy),\n          _step9;\n\n      try {\n        for (_iterator9.s(); !(_step9 = _iterator9.n()).done;) {\n          var _zone = _step9.value;\n          deleteFromZone(_zone);\n        }\n      } catch (err) {\n        _iterator9.e(err);\n      } finally {\n        _iterator9.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 node = getNode$1(key);\n  var retentionCleanup = initializeRetentionForNode(store, key, node.retainedBy);\n  var nodeCleanup = node.init(store, treeState, trigger);\n  storeState.nodeCleanupFunctions.set(key, function () {\n    nodeCleanup();\n    retentionCleanup();\n  });\n}\n\nfunction initializeNode(store, key, trigger) {\n  initializeNodeIfNewToStore(store, store.getState().currentTree, key, trigger);\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 storeState = store.getState();\n  var graph = store.getGraph(state.version);\n  var type = getNode$1(key).nodeType;\n  return Recoil_lazyProxy({\n    type: type\n  }, {\n    loadable: function loadable() {\n      return peekNodeLoadable(store, state, key);\n    },\n    isActive: function isActive() {\n      return storeState.knownAtoms.has(key) || storeState.knownSelectors.has(key);\n    },\n    isSet: function isSet() {\n      return type === 'selector' ? false : state.atomValues.has(key);\n    },\n    isModified: function isModified() {\n      return state.dirtyAtoms.has(key);\n    },\n    // Report current dependencies.  If the node hasn't been evaluated, then\n    // dependencies may be missing based on the current state.\n    deps: function deps() {\n      var _graph$nodeDeps$get;\n\n      return recoilValuesForKeys$1((_graph$nodeDeps$get = graph.nodeDeps.get(key)) !== null && _graph$nodeDeps$get !== void 0 ? _graph$nodeDeps$get : []);\n    },\n    // Reports all \"current\" subscribers.  Evaluating other nodes or\n    // previous in-progress async evaluations may introduce new subscribers.\n    subscribers: function subscribers() {\n      var _storeState$nodeToCom, _storeState$nodeToCom2;\n\n      return {\n        nodes: recoilValuesForKeys$1(Recoil_filterIterable(getDownstreamNodes(store, state, new Set([key])), function (nodeKey) {\n          return nodeKey !== key;\n        })),\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 (_ref3) {\n          var _ref4 = _slicedToArray(_ref3, 1),\n              name = _ref4[0];\n\n          return {\n            name: name\n          };\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 _iterator10 = _createForOfIteratorHelper(subscribedNodes),\n        _step10;\n\n    try {\n      for (_iterator10.s(); !(_step10 = _iterator10.n()).done;) {\n        var downstreamNode = _step10.value;\n\n        if (!visitedNodes.has(downstreamNode)) {\n          visitingNodes.push(downstreamNode);\n        }\n      }\n    } catch (err) {\n      _iterator10.e(err);\n    } finally {\n      _iterator10.f();\n    }\n  }\n\n  return visitedNodes;\n}\n\nvar Recoil_FunctionalCore = {\n  getNodeLoadable: getNodeLoadable,\n  peekNodeLoadable: peekNodeLoadable,\n  setNodeValue: setNodeValue,\n  initializeNode: initializeNode,\n  cleanUpNode: cleanUpNode,\n  setUnvalidatedAtomValue_DEPRECATED: setUnvalidatedAtomValue_DEPRECATED,\n  peekNodeInfo: peekNodeInfo,\n  getDownstreamNodes: getDownstreamNodes\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 _invalidateMemoizedSnapshot = null;\n\nfunction setInvalidateMemoizedSnapshot(invalidate) {\n  _invalidateMemoizedSnapshot = invalidate;\n}\n\nfunction invalidateMemoizedSnapshot() {\n  var _invalidateMemoizedSn;\n\n  (_invalidateMemoizedSn = _invalidateMemoizedSnapshot) === null || _invalidateMemoizedSn === void 0 ? void 0 : _invalidateMemoizedSn();\n}\n\nvar Recoil_SnapshotCache = {\n  setInvalidateMemoizedSnapshot: setInvalidateMemoizedSnapshot,\n  invalidateMemoizedSnapshot: invalidateMemoizedSnapshot\n};\nvar getDownstreamNodes$1 = Recoil_FunctionalCore.getDownstreamNodes,\n    getNodeLoadable$1 = Recoil_FunctionalCore.getNodeLoadable,\n    setNodeValue$1 = Recoil_FunctionalCore.setNodeValue;\nvar getNextComponentID$1 = Recoil_Keys.getNextComponentID;\nvar getNode$2 = Recoil_Node.getNode,\n    getNodeMaybe$2 = Recoil_Node.getNodeMaybe;\nvar DefaultValue$1 = Recoil_Node.DefaultValue,\n    RecoilValueNotReady$1 = Recoil_Node.RecoilValueNotReady;\nvar reactMode$1 = Recoil_ReactMode.reactMode;\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;\nvar invalidateMemoizedSnapshot$1 = Recoil_SnapshotCache.invalidateMemoizedSnapshot;\n\nfunction getRecoilValueAsLoadable(store, _ref5) {\n  var key = _ref5.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;\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, _ref6, valueOrUpdater) {\n  var key = _ref6.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 _iterator11 = _createForOfIteratorHelper(writes.entries()),\n        _step11;\n\n    try {\n      for (_iterator11.s(); !(_step11 = _iterator11.n()).done;) {\n        var _step11$value = _slicedToArray(_step11.value, 2),\n            key = _step11$value[0],\n            loadable = _step11$value[1];\n\n        writeLoadableToTreeState(state, key, loadable);\n      }\n    } catch (err) {\n      _iterator11.e(err);\n    } finally {\n      _iterator11.f();\n    }\n  } else if (action.type === 'setLoadable') {\n    var _key4 = action.recoilValue.key,\n        _loadable = action.loadable;\n    writeLoadableToTreeState(state, _key4, _loadable);\n  } else if (action.type === 'markModified') {\n    var _key5 = action.recoilValue.key;\n    state.dirtyAtoms.add(_key5);\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 _key6 = action.recoilValue.key,\n        unvalidatedValue = action.unvalidatedValue;\n    var node = getNodeMaybe$2(_key6);\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(_key6);\n    state.nonvalidatedAtoms.set(_key6, unvalidatedValue);\n    state.dirtyAtoms.add(_key6);\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 _iterator12 = _createForOfIteratorHelper(actions),\n        _step12;\n\n    try {\n      for (_iterator12.s(); !(_step12 = _iterator12.n()).done;) {\n        var action = _step12.value;\n        applyAction(store, newState, action);\n      }\n    } catch (err) {\n      _iterator12.e(err);\n    } finally {\n      _iterator12.f();\n    }\n\n    invalidateDownstreams(store, newState);\n    invalidateMemoizedSnapshot$1();\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 _iterator13 = _createForOfIteratorHelper(actionsByStore),\n        _step13;\n\n    try {\n      for (_iterator13.s(); !(_step13 = _iterator13.n()).done;) {\n        var _step13$value = _slicedToArray(_step13.value, 2),\n            store = _step13$value[0],\n            actions = _step13$value[1];\n\n        applyActionsToStore(store, actions);\n      }\n    } catch (err) {\n      _iterator13.e(err);\n    } finally {\n      _iterator13.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 _iterator14 = _createForOfIteratorHelper(downstreams),\n      _step14;\n\n  try {\n    for (_iterator14.s(); !(_step14 = _iterator14.n()).done;) {\n      var key = _step14.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    _iterator14.e(err);\n  } finally {\n    _iterator14.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\nfunction subscribeToRecoilValue(store, _ref7, callback) {\n  var key = _ref7.key;\n  var componentDebugName = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : null;\n  var subID = getNextComponentID$1();\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  var mode = reactMode$1();\n\n  if (mode.early && (mode.mode === 'LEGACY' || mode.mode === 'MUTABLE_SOURCE')) {\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 releaseStoreState = store.getState();\n      var subs = releaseStoreState.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        releaseStoreState.nodeToComponentSubscriptions.delete(key);\n      }\n    }\n  };\n}\n\nfunction refreshRecoilValue(store, recoilValue) {\n  var _node$clearCache;\n\n  var _store$getState5 = store.getState(),\n      currentTree = _store$getState5.currentTree;\n\n  var node = getNode$2(recoilValue.key);\n  (_node$clearCache = node.clearCache) === null || _node$clearCache === void 0 ? void 0 : _node$clearCache.call(node, store, currentTree);\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  refreshRecoilValue: refreshRecoilValue\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 * 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$3 = Recoil_Node.getNode;\nvar RetentionZone$2 = Recoil_RetentionZone.RetentionZone; // 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;\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 _iterator15 = _createForOfIteratorHelper(retainables),\n      _step15;\n\n  try {\n    for (_iterator15.s(); !(_step15 = _iterator15.n()).done;) {\n      var r = _step15.value;\n\n      if (r instanceof RetentionZone$2) {\n        var _iterator17 = _createForOfIteratorHelper(nodesRetainedByZone(storeState, r)),\n            _step17;\n\n        try {\n          for (_iterator17.s(); !(_step17 = _iterator17.n()).done;) {\n            var n = _step17.value;\n            nodes.add(n);\n          }\n        } catch (err) {\n          _iterator17.e(err);\n        } finally {\n          _iterator17.f();\n        }\n      } else {\n        nodes.add(r);\n      }\n    }\n  } catch (err) {\n    _iterator15.e(err);\n  } finally {\n    _iterator15.f();\n  }\n\n  var releasableNodes = findReleasableNodes(store, nodes);\n\n  var _iterator16 = _createForOfIteratorHelper(releasableNodes),\n      _step16;\n\n  try {\n    for (_iterator16.s(); !(_step16 = _iterator16.n()).done;) {\n      var node = _step16.value;\n      releaseNode(store, treeState, node);\n    }\n  } catch (err) {\n    _iterator16.e(err);\n  } finally {\n    _iterator16.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 _iterator18 = _createForOfIteratorHelper(downstreams),\n        _step18;\n\n    try {\n      for (_iterator18.s(); !(_step18 = _iterator18.n()).done;) {\n        var node = _step18.value;\n\n        var _storeState$retention; // Not releasable if configured to be retained forever:\n\n\n        if (getNode$3(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      _iterator18.e(err);\n    } finally {\n      _iterator18.f();\n    }\n\n    var parents = new Set();\n\n    var _iterator19 = _createForOfIteratorHelper(releasableNodesFoundThisIteration),\n        _step19;\n\n    try {\n      for (_iterator19.s(); !(_step19 = _iterator19.n()).done;) {\n        var _node5 = _step19.value;\n\n        var _iterator20 = _createForOfIteratorHelper((_graph$nodeDeps$get = graph.nodeDeps.get(_node5)) !== null && _graph$nodeDeps$get !== void 0 ? _graph$nodeDeps$get : emptySet$1),\n            _step20;\n\n        try {\n          for (_iterator20.s(); !(_step20 = _iterator20.n()).done;) {\n            var parent = _step20.value;\n\n            var _graph$nodeDeps$get;\n\n            if (!releasableNodes.has(parent)) {\n              parents.add(parent);\n            }\n          }\n        } catch (err) {\n          _iterator20.e(err);\n        } finally {\n          _iterator20.f();\n        }\n      }\n    } catch (err) {\n      _iterator19.e(err);\n    } finally {\n      _iterator19.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 _iterator21 = _createForOfIteratorHelper(children),\n          _step21;\n\n      try {\n        for (_iterator21.s(); !(_step21 = _iterator21.n()).done;) {\n          var child = _step21.value;\n          visit(child);\n        }\n      } catch (err) {\n        _iterator21.e(err);\n      } finally {\n        _iterator21.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('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 _iterator22 = _createForOfIteratorHelper(zones),\n      _step22;\n\n  try {\n    for (_iterator22.s(); !(_step22 = _iterator22.n()).done;) {\n      var zone = _step22.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    _iterator22.e(err);\n  } finally {\n    _iterator22.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 _iterator23 = _createForOfIteratorHelper(deps),\n          _step23;\n\n      try {\n        for (_iterator23.s(); !(_step23 = _iterator23.n()).done;) {\n          var dep = _step23.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        _iterator23.e(err);\n      } finally {\n        _iterator23.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$3(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('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('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('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  SUSPENSE_TIMEOUT_MS: SUSPENSE_TIMEOUT_MS,\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 * 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// prettier-ignore\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\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 _iterator24, _step24, iter, _iterator25, _step25, val;\n\n  return _regeneratorRuntime.wrap(function concatIterables$(_context3) {\n    while (1) {\n      switch (_context3.prev = _context3.next) {\n        case 0:\n          _iterator24 = _createForOfIteratorHelper(iters);\n          _context3.prev = 1;\n\n          _iterator24.s();\n\n        case 3:\n          if ((_step24 = _iterator24.n()).done) {\n            _context3.next = 24;\n            break;\n          }\n\n          iter = _step24.value;\n          _iterator25 = _createForOfIteratorHelper(iter);\n          _context3.prev = 6;\n\n          _iterator25.s();\n\n        case 8:\n          if ((_step25 = _iterator25.n()).done) {\n            _context3.next = 14;\n            break;\n          }\n\n          val = _step25.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          _iterator25.e(_context3.t0);\n\n        case 19:\n          _context3.prev = 19;\n\n          _iterator25.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          _iterator24.e(_context3.t1);\n\n        case 29:\n          _context3.prev = 29;\n\n          _iterator24.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\n/* eslint-disable fb-www/typeof-undefined */\n\nvar isSSR = // $FlowFixMe(site=recoil) Window does not have a FlowType definition https://github.com/facebook/flow/issues/6709\ntypeof Window === 'undefined' || typeof window === 'undefined';\n/* eslint-enable fb-www/typeof-undefined */\n\nvar isWindow = function isWindow(value) {\n  return !isSSR && ( // $FlowFixMe(site=recoil) Window does not have a FlowType definition https://github.com/facebook/flow/issues/6709\n  value === window || value instanceof Window);\n};\n\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  isWindow: isWindow\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 * Caches a function's results based on the key returned by the passed\n * hashFunction.\n */\n\nfunction memoizeWithArgsHash(fn, hashFunction) {\n  var cache;\n\n  var memoizedFn = function memoizedFn() {\n    if (!cache) {\n      cache = {};\n    }\n\n    var key = hashFunction.apply(void 0, arguments);\n\n    if (!Object.hasOwnProperty.call(cache, key)) {\n      cache[key] = fn.apply(void 0, arguments);\n    }\n\n    return cache[key];\n  };\n\n  return memoizedFn;\n}\n/**\n * Caches a function's results based on a comparison of the arguments.\n * Only caches the last return of the function.\n * Defaults to reference equality\n */\n\n\nfunction memoizeOneWithArgsHash(fn, hashFunction) {\n  var lastKey;\n  var lastResult; // breaking cache when arguments change\n\n  var memoizedFn = function memoizedFn() {\n    var key = hashFunction.apply(void 0, arguments);\n\n    if (lastKey === key) {\n      return lastResult;\n    }\n\n    lastKey = key;\n    lastResult = fn.apply(void 0, arguments);\n    return lastResult;\n  };\n\n  return memoizedFn;\n}\n/**\n * Caches a function's results based on a comparison of the arguments.\n * Only caches the last return of the function.\n * Defaults to reference equality\n */\n\n\nfunction memoizeOneWithArgsHashAndInvalidation(fn, hashFunction) {\n  var lastKey;\n  var lastResult; // breaking cache when arguments change\n\n  var memoizedFn = function memoizedFn() {\n    var key = hashFunction.apply(void 0, arguments);\n\n    if (lastKey === key) {\n      return lastResult;\n    }\n\n    lastKey = key;\n    lastResult = fn.apply(void 0, arguments);\n    return lastResult;\n  };\n\n  var invalidate = function invalidate() {\n    lastKey = null;\n  };\n\n  return [memoizedFn, invalidate];\n}\n\nvar Recoil_Memoize = {\n  memoizeWithArgsHash: memoizeWithArgsHash,\n  memoizeOneWithArgsHash: memoizeOneWithArgsHash,\n  memoizeOneWithArgsHashAndInvalidation: memoizeOneWithArgsHashAndInvalidation\n};\nvar batchUpdates$1 = Recoil_Batching.batchUpdates;\nvar initializeNode$1 = Recoil_FunctionalCore.initializeNode,\n    peekNodeInfo$1 = Recoil_FunctionalCore.peekNodeInfo;\nvar graph$1 = Recoil_Graph.graph;\nvar getNextStoreID$1 = Recoil_Keys.getNextStoreID;\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 setInvalidateMemoizedSnapshot$1 = Recoil_SnapshotCache.setInvalidateMemoizedSnapshot;\nvar getNextTreeStateVersion$2 = Recoil_State.getNextTreeStateVersion,\n    makeEmptyStoreState$1 = Recoil_State.makeEmptyStoreState;\nvar isSSR$1 = Recoil_Environment.isSSR;\nvar memoizeOneWithArgsHashAndInvalidation$1 = Recoil_Memoize.memoizeOneWithArgsHashAndInvalidation; // 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 doSomethingWithSnapshot(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  // eslint-disable-next-line fb-www/no-uninitialized-properties\n  function Snapshot(storeState) {\n    var _this6 = this;\n\n    _classCallCheck(this, Snapshot);\n\n    _defineProperty(this, \"_store\", void 0);\n\n    _defineProperty(this, \"_refCount\", 1);\n\n    _defineProperty(this, \"getLoadable\", function (recoilValue) {\n      _this6.checkRefCount_INTERNAL();\n\n      return getRecoilValueAsLoadable$1(_this6._store, recoilValue);\n    });\n\n    _defineProperty(this, \"getPromise\", function (recoilValue) {\n      _this6.checkRefCount_INTERNAL();\n\n      return _this6.getLoadable(recoilValue).toPromise();\n    });\n\n    _defineProperty(this, \"getNodes_UNSTABLE\", function (opt) {\n      _this6.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 = _this6._store.getState().currentTree;\n\n        return recoilValuesForKeys$2(state.dirtyAtoms);\n      }\n\n      var knownAtoms = _this6._store.getState().knownAtoms;\n\n      var knownSelectors = _this6._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([knownAtoms, knownSelectors])) : Recoil_filterIterable(recoilValues$1.values(), function (_ref8) {\n        var key = _ref8.key;\n        return !knownAtoms.has(key) && !knownSelectors.has(key);\n      });\n    });\n\n    _defineProperty(this, \"getInfo_UNSTABLE\", function (_ref9) {\n      var key = _ref9.key;\n\n      _this6.checkRefCount_INTERNAL(); // $FlowFixMe[escaped-generic]\n\n\n      return peekNodeInfo$1(_this6._store, _this6._store.getState().currentTree, key);\n    });\n\n    _defineProperty(this, \"map\", function (mapper) {\n      _this6.checkRefCount_INTERNAL();\n\n      var mutableSnapshot = new MutableSnapshot(_this6, batchUpdates$1);\n      mapper(mutableSnapshot); // if removing batchUpdates from `set` add it here\n\n      return mutableSnapshot;\n    });\n\n    _defineProperty(this, \"asyncMap\", /*#__PURE__*/function () {\n      var _ref10 = _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                _this6.checkRefCount_INTERNAL();\n\n                mutableSnapshot = new MutableSnapshot(_this6, batchUpdates$1);\n                mutableSnapshot.retain(); // Retain new snapshot during async mapper\n\n                _context4.next = 5;\n                return mapper(mutableSnapshot);\n\n              case 5:\n                // Continue to retain the new snapshot for the user, but auto-release it\n                // after the next tick, the same as a new synchronous snapshot.\n                mutableSnapshot.autoRelease_INTERNAL();\n                return _context4.abrupt(\"return\", mutableSnapshot);\n\n              case 7:\n              case \"end\":\n                return _context4.stop();\n            }\n          }\n        }, _callee2);\n      }));\n\n      return function (_x) {\n        return _ref10.apply(this, arguments);\n      };\n    }());\n\n    this._store = {\n      storeID: getNextStoreID$1(),\n      getState: function getState() {\n        return storeState;\n      },\n      replaceState: function replaceState(replacer) {\n        // no batching, so nextTree is never active\n        storeState.currentTree = replacer(storeState.currentTree);\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$1();\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 Recoil_err('Cannot subscribe to Snapshots');\n      }\n    }; // Initialize any nodes that are live in the parent store (primarily so that\n    // this snapshot gets counted towards the node's live stores count).\n    // TODO Optimize this when cloning snapshots for callbacks\n\n    var _iterator26 = _createForOfIteratorHelper(this._store.getState().knownAtoms),\n        _step26;\n\n    try {\n      for (_iterator26.s(); !(_step26 = _iterator26.n()).done;) {\n        var nodeKey = _step26.value;\n        initializeNode$1(this._store, nodeKey, 'get');\n        updateRetainCount$1(this._store, nodeKey, 1);\n      }\n    } catch (err) {\n      _iterator26.e(err);\n    } finally {\n      _iterator26.f();\n    }\n\n    this.autoRelease_INTERNAL();\n  }\n\n  _createClass(Snapshot, [{\n    key: \"retain\",\n    value: function retain() {\n      var _this7 = this;\n\n      if (this._refCount <= 0) {\n        if (process.env.NODE_ENV !== \"production\") {\n          throw Recoil_err('Snapshot has already been released.');\n        } else {\n          Recoil_recoverableViolation('Attempt to retain() Snapshot that was already released.');\n        }\n      }\n\n      this._refCount++;\n      var released = false;\n      return function () {\n        if (!released) {\n          released = true;\n\n          _this7._release();\n        }\n      };\n    }\n    /**\n     * Release the snapshot on the next tick.  This means the snapshot is retained\n     * during the execution of the current function using it.\n     */\n\n  }, {\n    key: \"autoRelease_INTERNAL\",\n    value: function autoRelease_INTERNAL() {\n      var _this8 = this;\n\n      if (!isSSR$1) {\n        window.setTimeout(function () {\n          return _this8._release();\n        }, 0);\n      }\n    }\n  }, {\n    key: \"_release\",\n    value: function _release() {\n      this._refCount--;\n\n      if (this._refCount === 0) {\n        this._store.getState().nodeCleanupFunctions.forEach(function (cleanup) {\n          return cleanup();\n        });\n\n        this._store.getState().nodeCleanupFunctions.clear();\n\n        if (!Recoil_gkx('recoil_memory_managament_2020')) {\n          return;\n        } // Temporarily nerfing this to allow us to find broken call sites without\n        // actually breaking anybody yet.\n        // for (const k of this._store.getState().knownAtoms) {\n        //   updateRetainCountToZero(this._store, k);\n        // }\n\n      } else if (this._refCount < 0) {\n        if (process.env.NODE_ENV !== \"production\") {\n          Recoil_recoverableViolation('Snapshot released an extra time.');\n        }\n      }\n    }\n  }, {\n    key: \"isRetained\",\n    value: function isRetained() {\n      return this._refCount > 0;\n    }\n  }, {\n    key: \"checkRefCount_INTERNAL\",\n    value: function checkRefCount_INTERNAL() {\n      if (Recoil_gkx('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 err(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._store.getState().currentTree.stateID;\n    }\n  }, {\n    key: \"getStoreID\",\n    value: function getStoreID() {\n      this.checkRefCount_INTERNAL();\n      return this._store.storeID;\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$2() : treeState.version;\n  return {\n    // Always clone the TreeState to isolate stores from accidental mutations.\n    // For example, reading a selector from a cloned snapshot shouldn't cache\n    // in the original treestate which may cause the original to skip\n    // initialization of upstream atoms.\n    currentTree: {\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: bumpVersion ? version : treeState.version,\n      stateID: bumpVersion ? version : treeState.stateID,\n      transactionMetadata: _objectSpread({}, treeState.transactionMetadata),\n      dirtyAtoms: new Set(treeState.dirtyAtoms),\n      atomValues: treeState.atomValues.clone(),\n      nonvalidatedAtoms: treeState.nonvalidatedAtoms.clone()\n    },\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    retention: {\n      referenceCounts: new Map(),\n      nodesRetainedByZone: new Map(),\n      retainablesToCheckForRelease: new Set()\n    },\n    // FIXME here's a copy\n    // Create blank cleanup handlers for atoms so snapshots don't re-run\n    // atom effects.\n    nodeCleanupFunctions: new Map(Recoil_mapIterable(storeState.nodeCleanupFunctions.entries(), function (_ref11) {\n      var _ref12 = _slicedToArray(_ref11, 1),\n          key = _ref12[0];\n\n      return [key, function () {}];\n    }))\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 snapshot state\n\n\nvar _memoizeOneWithArgsHa = memoizeOneWithArgsHashAndInvalidation$1(function (store, version) {\n  var _storeState$nextTree;\n\n  var storeState = store.getState();\n  var treeState = version === 'latest' ? (_storeState$nextTree = storeState.nextTree) !== null && _storeState$nextTree !== void 0 ? _storeState$nextTree : storeState.currentTree : Recoil_nullthrows(storeState.previousTree);\n  return new Snapshot(cloneStoreState(store, treeState));\n}, function (store, version) {\n  var _store$getState$nextT, _store$getState$previ;\n\n  return String(version) + String(store.storeID) + String((_store$getState$nextT = store.getState().nextTree) === null || _store$getState$nextT === void 0 ? void 0 : _store$getState$nextT.version) + String(store.getState().currentTree.version) + String((_store$getState$previ = store.getState().previousTree) === null || _store$getState$previ === void 0 ? void 0 : _store$getState$previ.version);\n}),\n    _memoizeOneWithArgsHa2 = _slicedToArray(_memoizeOneWithArgsHa, 2),\n    memoizedCloneSnapshot = _memoizeOneWithArgsHa2[0],\n    invalidateMemoizedSnapshot$2 = _memoizeOneWithArgsHa2[1]; // Avoid circular dependencies\n\n\nsetInvalidateMemoizedSnapshot$1(invalidateMemoizedSnapshot$2);\n\nfunction cloneSnapshot(store) {\n  var version = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 'latest';\n  var snapshot = memoizedCloneSnapshot(store, version);\n\n  if (!snapshot.isRetained()) {\n    invalidateMemoizedSnapshot$2();\n    return memoizedCloneSnapshot(store, version);\n  }\n\n  return snapshot;\n}\n\nvar MutableSnapshot = /*#__PURE__*/function (_Snapshot) {\n  _inherits(MutableSnapshot, _Snapshot);\n\n  var _super9 = _createSuper(MutableSnapshot);\n\n  function MutableSnapshot(snapshot, batch) {\n    var _this9;\n\n    _classCallCheck(this, MutableSnapshot);\n\n    _this9 = _super9.call(this, cloneStoreState(snapshot.getStore_INTERNAL(), snapshot.getStore_INTERNAL().getState().currentTree, true));\n\n    _defineProperty(_assertThisInitialized(_this9), \"_batch\", void 0);\n\n    _defineProperty(_assertThisInitialized(_this9), \"set\", function (recoilState, newValueOrUpdater) {\n      _this9.checkRefCount_INTERNAL();\n\n      var store = _this9.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      _this9._batch(function () {\n        updateRetainCount$1(store, recoilState.key, 1);\n        setRecoilValue$1(_this9.getStore_INTERNAL(), recoilState, newValueOrUpdater);\n      });\n    });\n\n    _defineProperty(_assertThisInitialized(_this9), \"reset\", function (recoilState) {\n      _this9.checkRefCount_INTERNAL();\n\n      var store = _this9.getStore_INTERNAL(); // See note at `set` about batched updates.\n\n\n      _this9._batch(function () {\n        updateRetainCount$1(store, recoilState.key, 1);\n        setRecoilValue$1(_this9.getStore_INTERNAL(), recoilState, DEFAULT_VALUE$1);\n      });\n    });\n\n    _defineProperty(_assertThisInitialized(_this9), \"setUnvalidatedAtomValues_DEPRECATED\", function (values) {\n      _this9.checkRefCount_INTERNAL();\n\n      var store = _this9.getStore_INTERNAL(); // See note at `set` about batched updates.\n\n\n      batchUpdates$1(function () {\n        var _iterator27 = _createForOfIteratorHelper(values.entries()),\n            _step27;\n\n        try {\n          for (_iterator27.s(); !(_step27 = _iterator27.n()).done;) {\n            var _step27$value = _slicedToArray(_step27.value, 2),\n                k = _step27$value[0],\n                v = _step27$value[1];\n\n            updateRetainCount$1(store, k, 1);\n            setUnvalidatedRecoilValue$1(store, new AbstractRecoilValue$2(k), v);\n          }\n        } catch (err) {\n          _iterator27.e(err);\n        } finally {\n          _iterator27.f();\n        }\n      });\n    });\n\n    _this9._batch = batch;\n    return _this9;\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});\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 _iterator28 = _createForOfIteratorHelper(set),\n        _step28;\n\n    try {\n      for (_iterator28.s(); !(_step28 = _iterator28.n()).done;) {\n        var value = _step28.value;\n        result.add(value);\n      }\n    } catch (err) {\n      _iterator28.e(err);\n    } finally {\n      _iterator28.f();\n    }\n  }\n\n  return result;\n}\n\nvar Recoil_unionSets = unionSets;\nvar useRef = react.useRef;\n/**\n * The same as `useRef()` except that if a function is specified then it will\n * call that function to get the value to initialize the reference with.\n * This is similar to how `useState()` behaves when given a function.  It allows\n * the user to avoid generating the initial value for subsequent renders.\n * The tradeoff is that to set the reference to a function itself you need to\n * nest it: useRefInitOnce(() => () => {...});\n */\n\nfunction useRefInitOnce(initialValue) {\n  // $FlowExpectedError[incompatible-call]\n  var ref = useRef(initialValue);\n\n  if (ref.current === initialValue && typeof initialValue === 'function') {\n    // $FlowExpectedError[incompatible-use]\n    ref.current = initialValue();\n  }\n\n  return ref;\n}\n\nvar Recoil_useRefInitOnce = useRefInitOnce; // @fb-only: const RecoilusagelogEvent = require('RecoilusagelogEvent');\n// @fb-only: const RecoilUsageLogFalcoEvent = require('RecoilUsageLogFalcoEvent');\n// @fb-only: const URI = require('URI');\n\nvar getNextTreeStateVersion$3 = Recoil_State.getNextTreeStateVersion,\n    makeEmptyStoreState$2 = Recoil_State.makeEmptyStoreState;\nvar cleanUpNode$2 = Recoil_FunctionalCore.cleanUpNode,\n    getDownstreamNodes$2 = Recoil_FunctionalCore.getDownstreamNodes,\n    initializeNode$2 = Recoil_FunctionalCore.initializeNode,\n    setNodeValue$2 = Recoil_FunctionalCore.setNodeValue,\n    setUnvalidatedAtomValue_DEPRECATED$1 = Recoil_FunctionalCore.setUnvalidatedAtomValue_DEPRECATED;\nvar graph$2 = Recoil_Graph.graph;\nvar cloneGraph$1 = Recoil_Graph.cloneGraph;\nvar getNextStoreID$2 = Recoil_Keys.getNextStoreID;\nvar createMutableSource$1 = Recoil_ReactMode.createMutableSource,\n    reactMode$2 = Recoil_ReactMode.reactMode;\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$1 = react.useRef,\n    useState = react.useState;\n\nfunction notInAContext() {\n  throw Recoil_err('This component must be used inside a <RecoilRoot> component.');\n}\n\nvar defaultStore = Object.freeze({\n  storeID: getNextStoreID$2(),\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 Recoil_err('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('recoil_memory_managament_2020') && Recoil_gkx('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$3();\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}; // $FlowExpectedError[incompatible-call]\n\n\nvar MutableSourceContext = react.createContext(null);\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 _iterator29 = _createForOfIteratorHelper(dependentNodes),\n      _step29;\n\n  try {\n    for (_iterator29.s(); !(_step29 = _iterator29.n()).done;) {\n      var key = _step29.value;\n      var comps = storeState.nodeToComponentSubscriptions.get(key);\n\n      if (comps) {\n        var _iterator30 = _createForOfIteratorHelper(comps),\n            _step30;\n\n        try {\n          for (_iterator30.s(); !(_step30 = _iterator30.n()).done;) {\n            var _step30$value = _slicedToArray(_step30.value, 2),\n                _subID = _step30$value[0],\n                _step30$value$ = _slicedToArray(_step30$value[1], 2),\n                _debugName = _step30$value$[0],\n                callback = _step30$value$[1];\n\n            callback(treeState);\n          }\n        } catch (err) {\n          _iterator30.e(err);\n        } finally {\n          _iterator30.f();\n        }\n      }\n    }\n  } catch (err) {\n    _iterator29.e(err);\n  } finally {\n    _iterator29.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 _iterator31 = _createForOfIteratorHelper(storeState.nodeTransactionSubscriptions),\n        _step31;\n\n    try {\n      for (_iterator31.s(); !(_step31 = _iterator31.n()).done;) {\n        var _step31$value = _slicedToArray(_step31.value, 2),\n            key = _step31$value[0],\n            subscriptions = _step31$value[1];\n\n        if (dirtyAtoms.has(key)) {\n          var _iterator33 = _createForOfIteratorHelper(subscriptions),\n              _step33;\n\n          try {\n            for (_iterator33.s(); !(_step33 = _iterator33.n()).done;) {\n              var _step33$value = _slicedToArray(_step33.value, 2),\n                  _ = _step33$value[0],\n                  subscription = _step33$value[1];\n\n              subscription(store);\n            }\n          } catch (err) {\n            _iterator33.e(err);\n          } finally {\n            _iterator33.f();\n          }\n        }\n      }\n    } catch (err) {\n      _iterator31.e(err);\n    } finally {\n      _iterator31.f();\n    }\n\n    var _iterator32 = _createForOfIteratorHelper(storeState.transactionSubscriptions),\n        _step32;\n\n    try {\n      for (_iterator32.s(); !(_step32 = _iterator32.n()).done;) {\n        var _step32$value = _slicedToArray(_step32.value, 2),\n            _2 = _step32$value[0],\n            _subscription = _step32$value[1];\n\n        _subscription(store);\n      }\n    } catch (err) {\n      _iterator32.e(err);\n    } finally {\n      _iterator32.f();\n    }\n\n    if (!reactMode$2().early || storeState.suspendedComponentResolvers.size > 0) {\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(store) {\n  var storeState = store.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(store);\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('recoil_memory_managament_2020')) {\n      // Only release retainables if there were no writes during the end of the\n      // batch.  This avoids releasing something we might be about to use.\n      if (nextTree == null) {\n        releaseScheduledRetainablesNow$1(store);\n      }\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(_ref13) {\n  var setNotifyBatcherOfChange = _ref13.setNotifyBatcherOfChange;\n  var storeRef = useStoreRef();\n\n  var _useState = useState([]),\n      _useState2 = _slicedToArray(_useState, 2),\n      setState = _useState2[1];\n\n  setNotifyBatcherOfChange(function () {\n    return setState({});\n  });\n  useEffect(function () {\n    setNotifyBatcherOfChange(function () {\n      return setState({});\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    return function () {\n      setNotifyBatcherOfChange(function () {});\n    };\n  }, [setNotifyBatcherOfChange]);\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.current);\n    });\n  });\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 _iterator34 = _createForOfIteratorHelper(writtenNodes),\n          _step34;\n\n      try {\n        for (_iterator34.s(); !(_step34 = _iterator34.n()).done;) {\n          var n = _step34.value;\n          nonvalidatedAtoms.delete(n);\n        }\n      } catch (err) {\n        _iterator34.e(err);\n      } finally {\n        _iterator34.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} // Initialize state snapshot for <RecoilRoot> for the initializeState prop.\n// Atom effect initialization takes precedence over this prop.\n// Any atom effects will be run before initialization, but then cleaned up,\n// they are then re-run when used as part of rendering.  These semantics are\n// compatible with React StrictMode where effects may be re-run multiple times\n// but state initialization only happens once the first time.\n\n\nfunction initialStoreState(initializeState) {\n  // Initialize a snapshot and get its store\n  var snapshot = freshSnapshot$1().map(initializeState);\n  var storeState = snapshot.getStore_INTERNAL().getState(); // Counteract the snapshot auto-release\n\n  snapshot.retain(); // Cleanup any effects run during initialization and clear the handlers so\n  // they will re-initialize if used during rendering.  This allows atom effect\n  // initialization to take precedence over initializeState and be compatible\n  // with StrictMode semantics.\n\n  storeState.nodeCleanupFunctions.forEach(function (cleanup) {\n    return cleanup();\n  });\n  storeState.nodeCleanupFunctions.clear();\n  return storeState;\n}\n\nvar nextID = 0;\n\nfunction RecoilRoot_INTERNAL(_ref14) {\n  var initializeState_DEPRECATED = _ref14.initializeState_DEPRECATED,\n      initializeState = _ref14.initializeState,\n      storeProp = _ref14.store_INTERNAL,\n      children = _ref14.children;\n  // 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  var storeStateRef; // eslint-disable-line prefer-const\n\n  var getGraph = function getGraph(version) {\n    var graphs = storeStateRef.current.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\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    startNextTreeIfNeeded(storeRef.current); // Use replacer to get the next state:\n\n    var nextTree = Recoil_nullthrows(storeStateRef.current.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    storeStateRef.current.nextTree = replaced;\n\n    if (reactMode$2().early) {\n      notifyComponents(storeRef.current, storeStateRef.current, replaced);\n    }\n\n    Recoil_nullthrows(notifyBatcherOfChange.current)();\n  };\n\n  var notifyBatcherOfChange = useRef$1(null);\n  var setNotifyBatcherOfChange = useCallback(function (x) {\n    notifyBatcherOfChange.current = x;\n  }, [notifyBatcherOfChange]);\n  var storeRef = Recoil_useRefInitOnce(function () {\n    return storeProp !== null && storeProp !== void 0 ? storeProp : {\n      storeID: getNextStoreID$2(),\n      getState: function getState() {\n        return storeStateRef.current;\n      },\n      replaceState: replaceState,\n      getGraph: getGraph,\n      subscribeToTransactions: subscribeToTransactions,\n      addTransactionMetadata: addTransactionMetadata\n    };\n  });\n\n  if (storeProp != null) {\n    storeRef.current = storeProp;\n  }\n\n  storeStateRef = Recoil_useRefInitOnce(function () {\n    return initializeState_DEPRECATED != null ? initialStoreState_DEPRECATED(storeRef.current, initializeState_DEPRECATED) : initializeState != null ? initialStoreState(initializeState) : makeEmptyStoreState$2();\n  });\n  var mutableSource = useMemo(function () {\n    return createMutableSource$1 === null || createMutableSource$1 === void 0 ? void 0 : createMutableSource$1(storeStateRef, function () {\n      return storeStateRef.current.currentTree.version;\n    });\n  }, [storeStateRef]); // Cleanup when the <RecoilRoot> is unmounted\n\n  useEffect(function () {\n    // React is free to call effect cleanup handlers and effects at will, the\n    // deps array is only an optimization.  For example, React strict mode\n    // will execute each effect twice for testing.  Therefore, we need symmetry\n    // to re-initialize all known atoms after they were cleaned up.\n    var store = storeRef.current;\n\n    var _iterator35 = _createForOfIteratorHelper(new Set(store.getState().knownAtoms)),\n        _step35;\n\n    try {\n      for (_iterator35.s(); !(_step35 = _iterator35.n()).done;) {\n        var atomKey = _step35.value;\n        initializeNode$2(store, atomKey, 'get');\n      }\n    } catch (err) {\n      _iterator35.e(err);\n    } finally {\n      _iterator35.f();\n    }\n\n    return function () {\n      var _iterator36 = _createForOfIteratorHelper(store.getState().knownAtoms),\n          _step36;\n\n      try {\n        for (_iterator36.s(); !(_step36 = _iterator36.n()).done;) {\n          var atomKey = _step36.value;\n          cleanUpNode$2(store, atomKey);\n        }\n      } catch (err) {\n        _iterator36.e(err);\n      } finally {\n        _iterator36.f();\n      }\n    };\n  }, [storeRef]);\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\nfunction useRecoilStoreID() {\n  return useStoreRef().current.storeID;\n}\n\nvar Recoil_RecoilRoot = {\n  RecoilRoot: RecoilRoot,\n  useStoreRef: useStoreRef,\n  useRecoilMutableSource: useRecoilMutableSource,\n  useRecoilStoreID: useRecoilStoreID,\n  notifyComponents_FOR_TESTING: notifyComponents,\n  sendEndOfBatchNotifications_FOR_TESTING: sendEndOfBatchNotifications\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 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;\nvar useEffect$1 = react.useEffect,\n    useRef$2 = react.useRef;\n\nfunction usePrevious(value) {\n  var ref = useRef$2();\n  useEffect$1(function () {\n    ref.current = value;\n  });\n  return ref.current;\n}\n\nvar Recoil_usePrevious = usePrevious;\nvar useStoreRef$1 = Recoil_RecoilRoot.useStoreRef;\nvar SUSPENSE_TIMEOUT_MS$1 = Recoil_Retention.SUSPENSE_TIMEOUT_MS;\nvar updateRetainCount$2 = Recoil_Retention.updateRetainCount;\nvar RetentionZone$3 = Recoil_RetentionZone.RetentionZone;\nvar useEffect$2 = react.useEffect,\n    useRef$3 = react.useRef;\nvar isSSR$2 = Recoil_Environment.isSSR; // 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\nfunction useRetain(toRetain) {\n  if (!Recoil_gkx('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$2(function () {\n    if (!Recoil_gkx('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 _iterator37 = _createForOfIteratorHelper(retainables),\n          _step37;\n\n      try {\n        for (_iterator37.s(); !(_step37 = _iterator37.n()).done;) {\n          var r = _step37.value;\n          updateRetainCount$2(store, r, 1);\n        }\n      } catch (err) {\n        _iterator37.e(err);\n      } finally {\n        _iterator37.f();\n      }\n    }\n\n    return function () {\n      var _iterator38 = _createForOfIteratorHelper(retainables),\n          _step38;\n\n      try {\n        for (_iterator38.s(); !(_step38 = _iterator38.n()).done;) {\n          var _r = _step38.value;\n          updateRetainCount$2(store, _r, -1);\n        }\n      } catch (err) {\n        _iterator38.e(err);\n      } finally {\n        _iterator38.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$3();\n  var previousRetainables = Recoil_usePrevious(retainables);\n\n  if (!isSSR$2 && (previousRetainables === undefined || !Recoil_shallowArrayEqual(previousRetainables, retainables))) {\n    var store = storeRef.current;\n\n    var _iterator39 = _createForOfIteratorHelper(retainables),\n        _step39;\n\n    try {\n      for (_iterator39.s(); !(_step39 = _iterator39.n()).done;) {\n        var _r3 = _step39.value;\n        updateRetainCount$2(store, _r3, 1);\n      }\n    } catch (err) {\n      _iterator39.e(err);\n    } finally {\n      _iterator39.f();\n    }\n\n    if (previousRetainables) {\n      var _iterator40 = _createForOfIteratorHelper(previousRetainables),\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    }\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 _iterator41 = _createForOfIteratorHelper(retainables),\n          _step41;\n\n      try {\n        for (_iterator41.s(); !(_step41 = _iterator41.n()).done;) {\n          var _r2 = _step41.value;\n          updateRetainCount$2(store, _r2, -1);\n        }\n      } catch (err) {\n        _iterator41.e(err);\n      } finally {\n        _iterator41.f();\n      }\n    }, SUSPENSE_TIMEOUT_MS$1);\n  }\n}\n\nvar Recoil_useRetain = useRetain;\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 * THIS CODE HAS BEEN COMMENTED OUT INTENTIONALLY\n *\n * This technique of getting the component name is imperfect, since it both only\n * works in a non-minified code base, and more importantly introduces performance\n * problems since it relies in throwing errors which is an expensive operation.\n *\n * At some point we may want to reevaluate this technique hence why we have commented\n * this code out, rather than delete it all together.\n */\n// const {useRef} = require('react');\n// const gkx = require('recoil-shared/util/Recoil_gkx');\n// const stackTraceParser = require('recoil-shared/util/Recoil_stackTraceParser');\n\nfunction useComponentName() {\n  // const nameRef = useRef();\n  // if (__DEV__) {\n  //   if (gkx('recoil_infer_component_names')) {\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  //       // eslint-disable-next-line fb-www/no-new-error\n  //       const frames = stackTraceParser(new Error().stack);\n  //       for (const {methodName} of frames) {\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  //       nameRef.current = null;\n  //     }\n  //     return nameRef.current ?? '<unable to determine component name>';\n  //   }\n  // }\n  // @fb-only: return \"<component name only available when both in dev mode and when passing GK 'recoil_infer_component_names'>\";\n  return '<component name not available>'; // @oss-only\n}\n\nvar Recoil_useComponentName = useComponentName;\nvar batchUpdates$2 = Recoil_Batching.batchUpdates;\nvar DEFAULT_VALUE$2 = Recoil_Node.DEFAULT_VALUE;\nvar reactMode$3 = Recoil_ReactMode.reactMode,\n    useMutableSource$1 = Recoil_ReactMode.useMutableSource,\n    useSyncExternalStore$1 = Recoil_ReactMode.useSyncExternalStore;\nvar useRecoilMutableSource$1 = Recoil_RecoilRoot.useRecoilMutableSource,\n    useStoreRef$2 = Recoil_RecoilRoot.useStoreRef;\nvar isRecoilValue$2 = Recoil_RecoilValue$1.isRecoilValue;\nvar AbstractRecoilValue$3 = Recoil_RecoilValueInterface.AbstractRecoilValue,\n    getRecoilValueAsLoadable$2 = Recoil_RecoilValueInterface.getRecoilValueAsLoadable,\n    setRecoilValue$2 = Recoil_RecoilValueInterface.setRecoilValue,\n    setUnvalidatedRecoilValue$2 = Recoil_RecoilValueInterface.setUnvalidatedRecoilValue,\n    subscribeToRecoilValue$1 = Recoil_RecoilValueInterface.subscribeToRecoilValue;\nvar useCallback$1 = react.useCallback,\n    useEffect$3 = react.useEffect,\n    useMemo$1 = react.useMemo,\n    useRef$4 = react.useRef,\n    useState$1 = react.useState;\nvar setByAddingToSet$2 = Recoil_CopyOnWrite.setByAddingToSet;\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    throw Recoil_err(\"Invalid value of loadable atom \\\"\".concat(recoilValue.key, \"\\\"\"));\n  }\n}\n\nfunction validateRecoilValue(recoilValue, hookName) {\n  if (!isRecoilValue$2(recoilValue)) {\n    throw Recoil_err(\"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\n * mode, React strict mode, and memory management. They will not be fixed.\n * */\n\n\nfunction useRecoilInterface_DEPRECATED() {\n  var componentName = Recoil_useComponentName();\n  var storeRef = useStoreRef$2();\n\n  var _useState$ = useState$1([]),\n      _useState$2 = _slicedToArray(_useState$, 2),\n      forceUpdate = _useState$2[1];\n\n  var recoilValuesUsed = useRef$4(new Set());\n  recoilValuesUsed.current = new Set(); // Track the RecoilValues used just during this render\n\n  var previousSubscriptions = useRef$4(new Set());\n  var subscriptions = useRef$4(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 updateState = useCallback$1(function (_state, key) {\n    if (subscriptions.current.has(key)) {\n      forceUpdate([]);\n    }\n  }, []); // Effect to add/remove subscriptions as nodes are used\n\n  useEffect$3(function () {\n    var store = storeRef.current;\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        return 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  }); // Effect to unsubscribe from all when unmounting\n\n  useEffect$3(function () {\n    var currentSubscriptions = subscriptions.current; // Restore subscriptions that were cleared due to StrictMode running this effect twice\n\n    Recoil_differenceSets(recoilValuesUsed.current, new Set(currentSubscriptions.keys())).forEach(function (key) {\n      var sub = subscribeToRecoilValue$1(storeRef.current, new AbstractRecoilValue$3(key), function (state) {\n        return updateState(state, key);\n      }, componentName);\n      currentSubscriptions.set(key, sub);\n    });\n    return function () {\n      return currentSubscriptions.forEach(function (_, key) {\n        return unsubscribeFrom(key);\n      });\n    };\n  }, [componentName, storeRef, unsubscribeFrom, updateState]);\n  return useMemo$1(function () {\n    // eslint-disable-next-line no-shadow\n    function useSetRecoilState(recoilState) {\n      if (process.env.NODE_ENV !== \"production\") {\n        validateRecoilValue(recoilState, 'useSetRecoilState');\n      }\n\n      return function (newValueOrUpdater) {\n        setRecoilValue$2(storeRef.current, recoilState, newValueOrUpdater);\n      };\n    } // eslint-disable-next-line no-shadow\n\n\n    function useResetRecoilState(recoilState) {\n      if (process.env.NODE_ENV !== \"production\") {\n        validateRecoilValue(recoilState, 'useResetRecoilState');\n      }\n\n      return function () {\n        return setRecoilValue$2(storeRef.current, recoilState, DEFAULT_VALUE$2);\n      };\n    } // eslint-disable-next-line no-shadow\n\n\n    function useRecoilValueLoadable(recoilValue) {\n      var _storeState$nextTree;\n\n      if (process.env.NODE_ENV !== \"production\") {\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$2(storeRef.current, recoilValue, reactMode$3().early ? (_storeState$nextTree = storeState.nextTree) !== null && _storeState$nextTree !== void 0 ? _storeState$nextTree : storeState.currentTree : storeState.currentTree);\n    } // eslint-disable-next-line no-shadow\n\n\n    function useRecoilValue(recoilValue) {\n      if (process.env.NODE_ENV !== \"production\") {\n        validateRecoilValue(recoilValue, 'useRecoilValue');\n      }\n\n      var loadable = useRecoilValueLoadable(recoilValue);\n      return handleLoadable(loadable, recoilValue, storeRef);\n    } // eslint-disable-next-line no-shadow\n\n\n    function useRecoilState(recoilState) {\n      if (process.env.NODE_ENV !== \"production\") {\n        validateRecoilValue(recoilState, 'useRecoilState');\n      }\n\n      return [useRecoilValue(recoilState), useSetRecoilState(recoilState)];\n    } // eslint-disable-next-line no-shadow\n\n\n    function useRecoilStateLoadable(recoilState) {\n      if (process.env.NODE_ENV !== \"production\") {\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_SYNC_EXTERNAL_STORE(recoilValue) {\n  var storeRef = useStoreRef$2();\n  var componentName = Recoil_useComponentName();\n  var getSnapshot = useCallback$1(function () {\n    var _storeState$nextTree2;\n\n    if (process.env.NODE_ENV !== \"production\") {\n      recoilComponentGetRecoilValueCount_FOR_TESTING.current++;\n    }\n\n    var store = storeRef.current;\n    var storeState = store.getState();\n    var treeState = reactMode$3().early ? (_storeState$nextTree2 = storeState.nextTree) !== null && _storeState$nextTree2 !== void 0 ? _storeState$nextTree2 : storeState.currentTree : storeState.currentTree;\n    var loadable = getRecoilValueAsLoadable$2(store, recoilValue, treeState);\n    return {\n      loadable: loadable,\n      key: recoilValue.key\n    };\n  }, [storeRef, recoilValue]); // Memoize the state to avoid unnecessary rerenders\n\n  var memoizePreviousSnapshot = useCallback$1(function (getState) {\n    var prevState;\n    return function () {\n      var _prevState, _prevState2;\n\n      var nextState = getState();\n\n      if ((_prevState = prevState) !== null && _prevState !== void 0 && _prevState.loadable.is(nextState.loadable) && ((_prevState2 = prevState) === null || _prevState2 === void 0 ? void 0 : _prevState2.key) === nextState.key) {\n        return prevState;\n      }\n\n      prevState = nextState;\n      return nextState;\n    };\n  }, []);\n  var getMemoizedSnapshot = useMemo$1(function () {\n    return memoizePreviousSnapshot(getSnapshot);\n  }, [getSnapshot, memoizePreviousSnapshot]);\n  var subscribe = useCallback$1(function (notify) {\n    var store = storeRef.current;\n    var subscription = subscribeToRecoilValue$1(store, recoilValue, notify, componentName);\n    return subscription.release;\n  }, [storeRef, recoilValue, componentName]);\n  return useSyncExternalStore$1(subscribe, getMemoizedSnapshot, // getSnapshot()\n  getMemoizedSnapshot // getServerSnapshot() for SSR support\n  ).loadable;\n}\n\nfunction useRecoilValueLoadable_MUTABLE_SOURCE(recoilValue) {\n  var storeRef = useStoreRef$2();\n  var getLoadable = useCallback$1(function () {\n    var _storeState$nextTree3;\n\n    var store = storeRef.current;\n    var storeState = store.getState();\n    var treeState = reactMode$3().early ? (_storeState$nextTree3 = storeState.nextTree) !== null && _storeState$nextTree3 !== void 0 ? _storeState$nextTree3 : storeState.currentTree : storeState.currentTree;\n    return getRecoilValueAsLoadable$2(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, notify) {\n    var store = storeRef.current;\n    var subscription = subscribeToRecoilValue$1(store, recoilValue, function () {\n      if (!Recoil_gkx('recoil_suppress_rerender_in_callback')) {\n        return notify();\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        notify();\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\n  if (source == null) {\n    throw Recoil_err('Recoil hooks must be used in components contained within a <RecoilRoot> component.');\n  }\n\n  var loadable = useMutableSource$1(source, getLoadableWithTesting, subscribe);\n  var prevLoadableRef = useRef$4(loadable);\n  useEffect$3(function () {\n    prevLoadableRef.current = loadable;\n  });\n  return loadable;\n}\n\nfunction useRecoilValueLoadable_TRANSITION_SUPPORT(recoilValue) {\n  var storeRef = useStoreRef$2();\n  var componentName = Recoil_useComponentName(); // Accessors to get the current state\n\n  var getLoadable = useCallback$1(function () {\n    var _storeState$nextTree4;\n\n    if (process.env.NODE_ENV !== \"production\") {\n      recoilComponentGetRecoilValueCount_FOR_TESTING.current++;\n    }\n\n    var store = storeRef.current;\n    var storeState = store.getState();\n    var treeState = reactMode$3().early ? (_storeState$nextTree4 = storeState.nextTree) !== null && _storeState$nextTree4 !== void 0 ? _storeState$nextTree4 : storeState.currentTree : storeState.currentTree;\n    return getRecoilValueAsLoadable$2(store, recoilValue, treeState);\n  }, [storeRef, recoilValue]);\n  var getState = useCallback$1(function () {\n    return {\n      loadable: getLoadable(),\n      key: recoilValue.key\n    };\n  }, [getLoadable, recoilValue.key]); // Memoize state snapshots\n\n  var updateState = useCallback$1(function (prevState) {\n    var nextState = getState();\n    return prevState.loadable.is(nextState.loadable) && prevState.key === nextState.key ? prevState : nextState;\n  }, [getState]); // Subscribe to Recoil state changes\n\n  useEffect$3(function () {\n    var subscription = subscribeToRecoilValue$1(storeRef.current, recoilValue, function (_state) {\n      setState(updateState);\n    }, componentName); // Update state in case we are using a different key\n\n    setState(updateState);\n    return subscription.release;\n  }, [componentName, recoilValue, storeRef, updateState]); // Get the current state\n\n  var _useState$3 = useState$1(getState),\n      _useState$4 = _slicedToArray(_useState$3, 2),\n      state = _useState$4[0],\n      setState = _useState$4[1]; // If we changed keys, then return the state for the new key.\n  // This is important in case the old key would cause the component to suspend.\n  // We don't have to set the new state here since the subscribing effect above\n  // will do that.\n\n\n  return state.key !== recoilValue.key ? getState().loadable : state.loadable;\n}\n\nfunction useRecoilValueLoadable_LEGACY(recoilValue) {\n  var storeRef = useStoreRef$2();\n\n  var _useState$5 = useState$1([]),\n      _useState$6 = _slicedToArray(_useState$5, 2),\n      forceUpdate = _useState$6[1];\n\n  var componentName = Recoil_useComponentName();\n  var getLoadable = useCallback$1(function () {\n    var _storeState$nextTree5;\n\n    if (process.env.NODE_ENV !== \"production\") {\n      recoilComponentGetRecoilValueCount_FOR_TESTING.current++;\n    }\n\n    var store = storeRef.current;\n    var storeState = store.getState();\n    var treeState = reactMode$3().early ? (_storeState$nextTree5 = storeState.nextTree) !== null && _storeState$nextTree5 !== void 0 ? _storeState$nextTree5 : storeState.currentTree : storeState.currentTree;\n    return getRecoilValueAsLoadable$2(store, recoilValue, treeState);\n  }, [storeRef, recoilValue]);\n  var loadable = getLoadable();\n  var prevLoadableRef = useRef$4(loadable);\n  useEffect$3(function () {\n    prevLoadableRef.current = loadable;\n  });\n  useEffect$3(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('recoil_suppress_rerender_in_callback')) {\n        return forceUpdate([]);\n      }\n\n      var newLoadable = getLoadable();\n\n      if (!((_prevLoadableRef$curr = prevLoadableRef.current) !== null && _prevLoadableRef$curr !== 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('recoil_suppress_rerender_in_callback')) {\n        return forceUpdate([]);\n      }\n\n      var newLoadable = getLoadable();\n\n      if (!((_prevLoadableRef$curr2 = prevLoadableRef.current) !== null && _prevLoadableRef$curr2 !== void 0 && _prevLoadableRef$curr2.is(newLoadable))) {\n        forceUpdate(newLoadable);\n      }\n\n      prevLoadableRef.current = newLoadable;\n    }\n\n    return subscription.release;\n  }, [componentName, getLoadable, recoilValue, storeRef]);\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 (process.env.NODE_ENV !== \"production\") {\n    validateRecoilValue(recoilValue, 'useRecoilValueLoadable');\n  }\n\n  if (Recoil_gkx('recoil_memory_managament_2020')) {\n    // eslint-disable-next-line fb-www/react-hooks\n    Recoil_useRetain(recoilValue);\n  }\n\n  return {\n    TRANSITION_SUPPORT: useRecoilValueLoadable_TRANSITION_SUPPORT,\n    SYNC_EXTERNAL_STORE: useRecoilValueLoadable_SYNC_EXTERNAL_STORE,\n    MUTABLE_SOURCE: useRecoilValueLoadable_MUTABLE_SOURCE,\n    LEGACY: useRecoilValueLoadable_LEGACY\n  }[reactMode$3().mode](recoilValue);\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    validateRecoilValue(recoilValue, 'useRecoilValue');\n  }\n\n  var storeRef = useStoreRef$2();\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    validateRecoilValue(recoilState, 'useSetRecoilState');\n  }\n\n  var storeRef = useStoreRef$2();\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    validateRecoilValue(recoilState, 'useResetRecoilState');\n  }\n\n  var storeRef = useStoreRef$2();\n  return useCallback$1(function () {\n    setRecoilValue$2(storeRef.current, recoilState, DEFAULT_VALUE$2);\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    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    validateRecoilValue(recoilState, 'useRecoilStateLoadable');\n  }\n\n  return [useRecoilValueLoadable(recoilState), useSetRecoilState(recoilState)];\n}\n\nfunction useSetUnvalidatedAtomValues() {\n  var storeRef = useStoreRef$2();\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/**\n * Experimental variants of hooks with support for useTransition()\n */\n\n\nfunction useRecoilValueLoadable_TRANSITION_SUPPORT_UNSTABLE(recoilValue) {\n  if (process.env.NODE_ENV !== \"production\") {\n    validateRecoilValue(recoilValue, 'useRecoilValueLoadable_TRANSITION_SUPPORT_UNSTABLE');\n\n    if (!reactMode$3().early) {\n      Recoil_recoverableViolation('Attepmt to use a hook with UNSTABLE_TRANSITION_SUPPORT in a rendering mode incompatible with concurrent rendering.  Try enabling the recoil_sync_external_store or recoil_transition_support GKs.');\n    }\n  }\n\n  if (Recoil_gkx('recoil_memory_managament_2020')) {\n    // eslint-disable-next-line fb-www/react-hooks\n    Recoil_useRetain(recoilValue);\n  }\n\n  return useRecoilValueLoadable_TRANSITION_SUPPORT(recoilValue);\n}\n\nfunction useRecoilValue_TRANSITION_SUPPORT_UNSTABLE(recoilValue) {\n  if (process.env.NODE_ENV !== \"production\") {\n    validateRecoilValue(recoilValue, 'useRecoilValue_TRANSITION_SUPPORT_UNSTABLE');\n  }\n\n  var storeRef = useStoreRef$2();\n  var loadable = useRecoilValueLoadable_TRANSITION_SUPPORT_UNSTABLE(recoilValue);\n  return handleLoadable(loadable, recoilValue, storeRef);\n}\n\nfunction useRecoilState_TRANSITION_SUPPORT_UNSTABLE(recoilState) {\n  if (process.env.NODE_ENV !== \"production\") {\n    validateRecoilValue(recoilState, 'useRecoilState_TRANSITION_SUPPORT_UNSTABLE');\n  }\n\n  return [useRecoilValue_TRANSITION_SUPPORT_UNSTABLE(recoilState), useSetRecoilState(recoilState)];\n}\n\nvar Recoil_Hooks = {\n  recoilComponentGetRecoilValueCount_FOR_TESTING: recoilComponentGetRecoilValueCount_FOR_TESTING,\n  useRecoilInterface: useRecoilInterface_DEPRECATED,\n  useRecoilState: useRecoilState,\n  useRecoilStateLoadable: useRecoilStateLoadable,\n  useRecoilValue: useRecoilValue,\n  useRecoilValueLoadable: useRecoilValueLoadable,\n  useResetRecoilState: useResetRecoilState,\n  useSetRecoilState: useSetRecoilState,\n  useSetUnvalidatedAtomValues: useSetUnvalidatedAtomValues,\n  useRecoilValueLoadable_TRANSITION_SUPPORT_UNSTABLE: useRecoilValueLoadable_TRANSITION_SUPPORT_UNSTABLE,\n  useRecoilValue_TRANSITION_SUPPORT_UNSTABLE: useRecoilValue_TRANSITION_SUPPORT_UNSTABLE,\n  useRecoilState_TRANSITION_SUPPORT_UNSTABLE: useRecoilState_TRANSITION_SUPPORT_UNSTABLE\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 _iterator42 = _createForOfIteratorHelper(map),\n      _step42;\n\n  try {\n    for (_iterator42.s(); !(_step42 = _iterator42.n()).done;) {\n      var _step42$value = _slicedToArray(_step42.value, 2),\n          key = _step42$value[0],\n          value = _step42$value[1];\n\n      if (callback(value, key)) {\n        result.set(key, value);\n      }\n    }\n  } catch (err) {\n    _iterator42.e(err);\n  } finally {\n    _iterator42.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 _iterator43 = _createForOfIteratorHelper(set),\n      _step43;\n\n  try {\n    for (_iterator43.s(); !(_step43 = _iterator43.n()).done;) {\n      var value = _step43.value;\n\n      if (callback(value)) {\n        result.add(value);\n      }\n    }\n  } catch (err) {\n    _iterator43.e(err);\n  } finally {\n    _iterator43.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 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;\nvar batchUpdates$3 = Recoil_Batching.batchUpdates;\nvar DEFAULT_VALUE$3 = Recoil_Node.DEFAULT_VALUE,\n    getNode$4 = Recoil_Node.getNode,\n    nodes$1 = Recoil_Node.nodes;\nvar useStoreRef$3 = Recoil_RecoilRoot.useStoreRef;\nvar AbstractRecoilValue$4 = Recoil_RecoilValueInterface.AbstractRecoilValue,\n    setRecoilValueLoadable$1 = Recoil_RecoilValueInterface.setRecoilValueLoadable;\nvar SUSPENSE_TIMEOUT_MS$2 = Recoil_Retention.SUSPENSE_TIMEOUT_MS;\nvar cloneSnapshot$1 = Recoil_Snapshot$1.cloneSnapshot;\nvar useCallback$2 = react.useCallback,\n    useEffect$4 = react.useEffect,\n    useRef$5 = react.useRef,\n    useState$2 = react.useState;\nvar isSSR$3 = Recoil_Environment.isSSR;\n\nfunction useTransactionSubscription(callback) {\n  var storeRef = useStoreRef$3();\n  useEffect$4(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$2(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$2(function (store) {\n    var snapshot = cloneSnapshot$1(store, 'latest');\n    var previousSnapshot = cloneSnapshot$1(store, 'previous');\n    callback({\n      snapshot: snapshot,\n      previousSnapshot: previousSnapshot\n    });\n  }, [callback]));\n} // Return a snapshot of the current state and subscribe to all state changes\n\n\nfunction useRecoilSnapshot() {\n  var storeRef = useStoreRef$3();\n\n  var _useState$7 = useState$2(function () {\n    return cloneSnapshot$1(storeRef.current);\n  }),\n      _useState$8 = _slicedToArray(_useState$7, 2),\n      snapshot = _useState$8[0],\n      setSnapshot = _useState$8[1];\n\n  var previousSnapshot = Recoil_usePrevious(snapshot);\n  var timeoutID = useRef$5();\n  var releaseRef = useRef$5();\n  useTransactionSubscription(useCallback$2(function (store) {\n    return setSnapshot(cloneSnapshot$1(store));\n  }, [])); // Retain snapshot for duration component is mounted\n\n  useEffect$4(function () {\n    var release = snapshot.retain(); // Release the retain from the rendering call\n\n    if (timeoutID.current && !isSSR$3) {\n      var _releaseRef$current;\n\n      window.clearTimeout(timeoutID.current);\n      timeoutID.current = null;\n      (_releaseRef$current = releaseRef.current) === null || _releaseRef$current === void 0 ? void 0 : _releaseRef$current.call(releaseRef);\n      releaseRef.current = null;\n    }\n\n    return release;\n  }, [snapshot]); // Retain snapshot until above effect is run.\n  // Release after a threshold in case component is suspended.\n\n  if (previousSnapshot !== snapshot && !isSSR$3) {\n    // Release the previous snapshot\n    if (timeoutID.current) {\n      var _releaseRef$current2;\n\n      window.clearTimeout(timeoutID.current);\n      timeoutID.current = null;\n      (_releaseRef$current2 = releaseRef.current) === null || _releaseRef$current2 === void 0 ? void 0 : _releaseRef$current2.call(releaseRef);\n      releaseRef.current = null;\n    }\n\n    releaseRef.current = snapshot.retain();\n    timeoutID.current = window.setTimeout(function () {\n      var _releaseRef$current3;\n\n      timeoutID.current = null;\n      (_releaseRef$current3 = releaseRef.current) === null || _releaseRef$current3 === void 0 ? void 0 : _releaseRef$current3.call(releaseRef);\n      releaseRef.current = null;\n    }, SUSPENSE_TIMEOUT_MS$2);\n  }\n\n  return snapshot;\n}\n\nfunction gotoSnapshot(store, snapshot) {\n  var _storeState$nextTree;\n\n  var storeState = store.getState();\n  var prev = (_storeState$nextTree = storeState.nextTree) !== null && _storeState$nextTree !== void 0 ? _storeState$nextTree : storeState.currentTree;\n  var next = snapshot.getStore_INTERNAL().getState().currentTree;\n  batchUpdates$3(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 _iterator44 = _createForOfIteratorHelper(keys),\n          _step44;\n\n      try {\n        for (_iterator44.s(); !(_step44 = _iterator44.n()).done;) {\n          var key = _step44.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        _iterator44.e(err);\n      } finally {\n        _iterator44.f();\n      }\n    }\n\n    keysToUpdate.forEach(function (key) {\n      setRecoilValueLoadable$1(store, new AbstractRecoilValue$4(key), next.atomValues.has(key) ? Recoil_nullthrows(next.atomValues.get(key)) : DEFAULT_VALUE$3);\n    });\n    store.replaceState(function (state) {\n      return _objectSpread(_objectSpread({}, state), {}, {\n        stateID: snapshot.getID()\n      });\n    });\n  });\n}\n\nfunction useGotoRecoilSnapshot() {\n  var storeRef = useStoreRef$3();\n  return useCallback$2(function (snapshot) {\n    return gotoSnapshot(storeRef.current, snapshot);\n  }, [storeRef]);\n}\n\nvar Recoil_SnapshotHooks = {\n  useRecoilSnapshot: useRecoilSnapshot,\n  gotoSnapshot: gotoSnapshot,\n  useGotoRecoilSnapshot: useGotoRecoilSnapshot,\n  useRecoilTransactionObserver: useRecoilTransactionObserver,\n  useTransactionObservation_DEPRECATED: useTransactionObservation_DEPRECATED,\n  useTransactionSubscription_DEPRECATED: useTransactionSubscription\n};\nvar peekNodeInfo$2 = Recoil_FunctionalCore.peekNodeInfo;\nvar useStoreRef$4 = Recoil_RecoilRoot.useStoreRef;\n\nfunction useGetRecoilValueInfo() {\n  var storeRef = useStoreRef$4();\n  return function (_ref15) {\n    var key = _ref15.key;\n    return peekNodeInfo$2(storeRef.current, storeRef.current.getState().currentTree, key);\n  };\n}\n\nvar Recoil_useGetRecoilValueInfo = useGetRecoilValueInfo;\nvar reactMode$4 = Recoil_ReactMode.reactMode;\nvar RecoilRoot$1 = Recoil_RecoilRoot.RecoilRoot,\n    useStoreRef$5 = Recoil_RecoilRoot.useStoreRef;\nvar useMemo$2 = react.useMemo;\n\nfunction useRecoilBridgeAcrossReactRoots() {\n  // The test fails when using useMutableSource(), but only if act() is used\n  // for the nested root.  So, this may only be a testing environment issue.\n  if (reactMode$4().mode === 'MUTABLE_SOURCE') {\n    // eslint-disable-next-line fb-www/no-console\n    console.warn('Warning: There are known issues using useRecoilBridgeAcrossReactRoots() in recoil_mutable_source rendering mode.  Please consider upgrading to recoil_sync_external_store mode.');\n  }\n\n  var store = useStoreRef$5().current;\n  return useMemo$2(function () {\n    // eslint-disable-next-line no-shadow\n    function RecoilBridge(_ref16) {\n      var children = _ref16.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;\nvar loadableWithValue$1 = Recoil_Loadable$1.loadableWithValue;\nvar initializeNode$3 = Recoil_FunctionalCore.initializeNode;\nvar DEFAULT_VALUE$4 = Recoil_Node.DEFAULT_VALUE,\n    getNode$5 = Recoil_Node.getNode;\nvar copyTreeState$1 = Recoil_RecoilValueInterface.copyTreeState,\n    getRecoilValueAsLoadable$3 = Recoil_RecoilValueInterface.getRecoilValueAsLoadable,\n    invalidateDownstreams$1 = Recoil_RecoilValueInterface.invalidateDownstreams,\n    writeLoadableToTreeState$1 = Recoil_RecoilValueInterface.writeLoadableToTreeState;\n\nfunction isAtom(recoilValue) {\n  return getNode$5(recoilValue.key).nodeType === 'atom';\n}\n\nvar TransactionInterfaceImpl = /*#__PURE__*/function () {\n  function TransactionInterfaceImpl(store, treeState) {\n    var _this10 = 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 (_this10._changes.has(recoilValue.key)) {\n        // $FlowFixMe[incompatible-return]\n        return _this10._changes.get(recoilValue.key);\n      }\n\n      if (!isAtom(recoilValue)) {\n        throw Recoil_err('Reading selectors within atomicUpdate is not supported');\n      }\n\n      var loadable = getRecoilValueAsLoadable$3(_this10._store, recoilValue, _this10._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 Recoil_err(\"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 Recoil_err('Setting selectors within atomicUpdate is not supported');\n      }\n\n      if (typeof valueOrUpdater === 'function') {\n        var current = _this10.get(recoilState);\n\n        _this10._changes.set(recoilState.key, valueOrUpdater(current)); // flowlint-line unclear-type:off\n\n      } else {\n        // Initialize atom and run effects if not initialized yet\n        initializeNode$3(_this10._store, recoilState.key, 'set');\n\n        _this10._changes.set(recoilState.key, valueOrUpdater);\n      }\n    });\n\n    _defineProperty(this, \"reset\", function (recoilState) {\n      _this10.set(recoilState, DEFAULT_VALUE$4);\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 _iterator45 = _createForOfIteratorHelper(this._changes),\n          _step45;\n\n      try {\n        for (_iterator45.s(); !(_step45 = _iterator45.n()).done;) {\n          var _step45$value = _slicedToArray(_step45.value, 2),\n              k = _step45$value[0],\n              v = _step45$value[1];\n\n          writeLoadableToTreeState$1(newState, k, loadableWithValue$1(v));\n        }\n      } catch (err) {\n        _iterator45.e(err);\n      } finally {\n        _iterator45.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\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;\nvar atomicUpdater$1 = Recoil_AtomicUpdates$1.atomicUpdater;\nvar batchUpdates$4 = Recoil_Batching.batchUpdates;\nvar DEFAULT_VALUE$5 = Recoil_Node.DEFAULT_VALUE;\nvar useStoreRef$6 = Recoil_RecoilRoot.useStoreRef;\nvar refreshRecoilValue$1 = Recoil_RecoilValueInterface.refreshRecoilValue,\n    setRecoilValue$3 = Recoil_RecoilValueInterface.setRecoilValue;\nvar cloneSnapshot$2 = Recoil_Snapshot$1.cloneSnapshot;\nvar gotoSnapshot$1 = Recoil_SnapshotHooks.gotoSnapshot;\nvar useCallback$3 = react.useCallback;\n\nvar Sentinel = function Sentinel() {\n  _classCallCheck(this, Sentinel);\n};\n\nvar SENTINEL = new Sentinel();\n\nfunction recoilCallback(store, fn, args, extraInterface) {\n  var ret = SENTINEL;\n  var releaseSnapshot;\n  batchUpdates$4(function () {\n    var errMsg = 'useRecoilCallback() expects a function that returns a function: ' + 'it accepts a function of the type (RecoilInterface) => (Args) => ReturnType ' + 'and returns a callback function (Args) => ReturnType, where RecoilInterface is ' + 'an object {snapshot, set, ...} and Args and ReturnType 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 Recoil_err(errMsg);\n    } // Clone the snapshot lazily to avoid overhead if the callback does not use it.\n    // Note that this means the snapshot may represent later state from when\n    // the callback was called if it first accesses the snapshot asynchronously.\n\n\n    var callbackInterface = Recoil_lazyProxy(_objectSpread(_objectSpread({}, extraInterface !== null && extraInterface !== void 0 ? extraInterface : {}), {}, {\n      // flowlint-line unclear-type:off\n      set: function set(node, newValue) {\n        return setRecoilValue$3(store, node, newValue);\n      },\n      reset: function reset(node) {\n        return setRecoilValue$3(store, node, DEFAULT_VALUE$5);\n      },\n      refresh: function refresh(node) {\n        return refreshRecoilValue$1(store, node);\n      },\n      gotoSnapshot: function gotoSnapshot(snapshot) {\n        return gotoSnapshot$1(store, snapshot);\n      },\n      transact_UNSTABLE: function transact_UNSTABLE(transaction) {\n        return atomicUpdater$1(store)(transaction);\n      }\n    }), {\n      snapshot: function snapshot() {\n        var snapshot = cloneSnapshot$2(store);\n        releaseSnapshot = snapshot.retain();\n        return snapshot;\n      }\n    });\n    var callback = fn(callbackInterface);\n\n    if (typeof callback !== 'function') {\n      throw Recoil_err(errMsg);\n    }\n\n    ret = callback.apply(void 0, _toConsumableArray(args));\n  });\n  !!(ret instanceof Sentinel) ? process.env.NODE_ENV !== \"production\" ? Recoil_invariant(false, 'batchUpdates should return immediately') : Recoil_invariant(false) : void 0;\n\n  if (Recoil_isPromise(ret)) {\n    ret.finally(function () {\n      var _releaseSnapshot;\n\n      (_releaseSnapshot = releaseSnapshot) === null || _releaseSnapshot === void 0 ? void 0 : _releaseSnapshot();\n    });\n  } else {\n    var _releaseSnapshot2;\n\n    (_releaseSnapshot2 = releaseSnapshot) === null || _releaseSnapshot2 === void 0 ? void 0 : _releaseSnapshot2();\n  }\n\n  return ret;\n}\n\nfunction useRecoilCallback(fn, deps) {\n  var storeRef = useStoreRef$6();\n  return useCallback$3( // $FlowIssue[incompatible-call]\n  function () {\n    for (var _len6 = arguments.length, args = new Array(_len6), _key9 = 0; _key9 < _len6; _key9++) {\n      args[_key9] = arguments[_key9];\n    }\n\n    return recoilCallback(storeRef.current, fn, args);\n  }, deps != null ? [].concat(_toConsumableArray(deps), [storeRef]) : undefined // eslint-disable-line fb-www/react-hooks-deps\n  );\n}\n\nvar Recoil_useRecoilCallback = {\n  recoilCallback: recoilCallback,\n  useRecoilCallback: useRecoilCallback\n};\nvar useStoreRef$7 = Recoil_RecoilRoot.useStoreRef;\nvar refreshRecoilValue$2 = Recoil_RecoilValueInterface.refreshRecoilValue;\nvar useCallback$4 = react.useCallback;\n\nfunction useRecoilRefresher(recoilValue) {\n  var storeRef = useStoreRef$7();\n  return useCallback$4(function () {\n    var store = storeRef.current;\n    refreshRecoilValue$2(store, recoilValue);\n  }, [recoilValue, storeRef]);\n}\n\nvar Recoil_useRecoilRefresher = useRecoilRefresher;\nvar atomicUpdater$2 = Recoil_AtomicUpdates$1.atomicUpdater;\nvar useStoreRef$8 = Recoil_RecoilRoot.useStoreRef;\nvar useMemo$3 = react.useMemo;\n\nfunction useRecoilTransaction(fn, deps) {\n  var storeRef = useStoreRef$8();\n  return useMemo$3(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$2(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_useRecoilTransaction = useRecoilTransaction;\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 WrappedValue = function WrappedValue(value) {\n  _classCallCheck(this, WrappedValue);\n\n  _defineProperty(this, \"value\", void 0);\n\n  this.value = value;\n};\n\nvar Recoil_Wrapper = {\n  WrappedValue: WrappedValue\n};\nvar Recoil_Wrapper_1 = Recoil_Wrapper.WrappedValue;\nvar Recoil_Wrapper$1 = /*#__PURE__*/Object.freeze({\n  __proto__: null,\n  WrappedValue: Recoil_Wrapper_1\n});\nvar isFastRefreshEnabled$2 = Recoil_ReactMode.isFastRefreshEnabled;\n\nvar ChangedPathError = /*#__PURE__*/function (_Error4) {\n  _inherits(ChangedPathError, _Error4);\n\n  var _super10 = _createSuper(ChangedPathError);\n\n  function ChangedPathError() {\n    _classCallCheck(this, ChangedPathError);\n\n    return _super10.apply(this, arguments);\n  }\n\n  return ChangedPathError;\n}( /*#__PURE__*/_wrapNativeSuper(Error));\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, \"_name\", void 0);\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._name = options === null || options === void 0 ? void 0 : options.name;\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    }\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      if (this._root == null) {\n        return undefined;\n      } // Iterate down the tree based on the current node values until we hit a leaf\n\n\n      var node = this._root;\n\n      while (node) {\n        handlers === null || handlers === void 0 ? void 0 : handlers.onNodeVisit(node);\n\n        if (node.type === 'leaf') {\n          this._onHit(node);\n\n          return node;\n        }\n\n        var nodeValue = this._mapNodeValue(getNodeValue(node.nodeKey));\n\n        node = node.branches.get(nodeValue);\n      }\n\n      return undefined;\n    }\n  }, {\n    key: \"set\",\n    value: function set(route, value, handlers) {\n      var _this11 = this;\n\n      var addLeaf = function addLeaf() {\n        var _node2, _node3, _this$_root2, _handlers$onNodeVisit2; // First, setup the branch nodes for the route:\n        // Iterate down the tree to find or add branch nodes following the route\n\n\n        var node;\n        var branchKey;\n\n        var _iterator46 = _createForOfIteratorHelper(route),\n            _step46;\n\n        try {\n          for (_iterator46.s(); !(_step46 = _iterator46.n()).done;) {\n            var _step46$value = _slicedToArray(_step46.value, 2),\n                nodeKey = _step46$value[0],\n                nodeValue = _step46$value[1];\n\n            var _node, _handlers$onNodeVisit, _this$_root; // If the previous root was a leaf, while we not have a get(), it means\n            // the selector has inconsistent values or implementation changed.\n\n\n            var root = _this11._root;\n\n            if ((root === null || root === void 0 ? void 0 : root.type) === 'leaf') {\n              throw _this11.invalidCacheError();\n            } // node now refers to the next node down in the tree\n\n\n            var parent = node;\n            node = parent ? parent.branches.get(branchKey) : root;\n            node = (_node = node) !== null && _node !== void 0 ? _node : {\n              type: 'branch',\n              nodeKey: nodeKey,\n              parent: parent,\n              branches: new Map(),\n              branchKey: branchKey\n            }; // If we found an existing node, confirm it has a consistent value\n\n            if (node.type !== 'branch' || node.nodeKey !== nodeKey) {\n              throw _this11.invalidCacheError();\n            } // Add the branch node to the tree\n\n\n            parent === null || parent === void 0 ? void 0 : parent.branches.set(branchKey, node);\n            handlers === null || handlers === void 0 ? void 0 : (_handlers$onNodeVisit = handlers.onNodeVisit) === null || _handlers$onNodeVisit === void 0 ? void 0 : _handlers$onNodeVisit.call(handlers, node); // Prepare for next iteration and install root if it is new.\n\n            branchKey = _this11._mapNodeValue(nodeValue);\n            _this11._root = (_this$_root = _this11._root) !== null && _this$_root !== void 0 ? _this$_root : node;\n          } // Second, setup the leaf node:\n          // If there is an existing leaf for this route confirm it is consistent\n\n        } catch (err) {\n          _iterator46.e(err);\n        } finally {\n          _iterator46.f();\n        }\n\n        var oldLeaf = node ? (_node2 = node) === null || _node2 === void 0 ? void 0 : _node2.branches.get(branchKey) : _this11._root;\n\n        if (oldLeaf != null && (oldLeaf.type !== 'leaf' || oldLeaf.branchKey !== branchKey)) {\n          throw _this11.invalidCacheError();\n        } // Create a new or replacement leaf.\n\n\n        var leafNode = {\n          type: 'leaf',\n          value: value,\n          parent: node,\n          branchKey: branchKey\n        }; // Install the leaf and call handlers\n\n        (_node3 = node) === null || _node3 === void 0 ? void 0 : _node3.branches.set(branchKey, leafNode);\n        _this11._root = (_this$_root2 = _this11._root) !== null && _this$_root2 !== void 0 ? _this$_root2 : leafNode;\n        _this11._numLeafs++;\n\n        _this11._onSet(leafNode);\n\n        handlers === null || handlers === void 0 ? void 0 : (_handlers$onNodeVisit2 = handlers.onNodeVisit) === null || _handlers$onNodeVisit2 === void 0 ? void 0 : _handlers$onNodeVisit2.call(handlers, leafNode);\n      };\n\n      try {\n        addLeaf();\n      } catch (error) {\n        // If the cache was stale or observed inconsistent values, such as with\n        // Fast Refresh, then clear it and rebuild with the new values.\n        if (error instanceof ChangedPathError) {\n          this.clear();\n          addLeaf();\n        } else {\n          throw error;\n        }\n      }\n    } // Returns true if leaf was actually deleted from the tree\n\n  }, {\n    key: \"delete\",\n    value: function _delete(leaf) {\n      var root = this.root();\n\n      if (!root) {\n        return false;\n      }\n\n      if (leaf === root) {\n        this._root = null;\n        this._numLeafs = 0;\n        return true;\n      } // Iterate up from the leaf deleteing it from it's parent's branches.\n\n\n      var node = leaf.parent;\n      var branchKey = leaf.branchKey;\n\n      while (node) {\n        var _node4;\n\n        node.branches.delete(branchKey); // Stop iterating if we hit the root.\n\n        if (node === root) {\n          if (node.branches.size === 0) {\n            this._root = null;\n            this._numLeafs = 0;\n          } else {\n            this._numLeafs--;\n          }\n\n          return true;\n        } // Stop iterating if there are other branches since we don't need to\n        // remove any more nodes.\n\n\n        if (node.branches.size > 0) {\n          break;\n        } // Iterate up to our parent\n\n\n        branchKey = (_node4 = node) === null || _node4 === void 0 ? void 0 : _node4.branchKey;\n        node = node.parent;\n      } // Confirm that the leaf we are deleting is actually attached to our tree\n\n\n      for (; node !== root; node = node.parent) {\n        if (node == null) {\n          return false;\n        }\n      }\n\n      this._numLeafs--;\n      return true;\n    }\n  }, {\n    key: \"clear\",\n    value: function clear() {\n      this._numLeafs = 0;\n      this._root = null;\n    }\n  }, {\n    key: \"invalidCacheError\",\n    value: function invalidCacheError() {\n      var CHANGED_PATH_ERROR_MESSAGE = isFastRefreshEnabled$2() ? 'Possible Fast Refresh module reload detected.  ' + 'This may also be caused by an selector returning inconsistent values. ' + 'Resetting cache.' : 'Invalid cache values.  This happens when selectors do not return ' + 'consistent values for the same input dependency values.  That may also ' + 'be caused when using Fast Refresh to change a selector implementation.  ' + 'Resetting cache.';\n      Recoil_recoverableViolation(CHANGED_PATH_ERROR_MESSAGE + (this._name != null ? \" - \".concat(this._name) : ''));\n      throw new ChangedPathError();\n    }\n  }]);\n\n  return TreeCache;\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(_ref17) {\n  var name = _ref17.name,\n      maxSize = _ref17.maxSize,\n      _ref17$mapNodeValue = _ref17.mapNodeValue,\n      mapNodeValue = _ref17$mapNodeValue === void 0 ? function (v) {\n    return v;\n  } : _ref17$mapNodeValue;\n  var lruCache = new LRUCache$1({\n    maxSize: maxSize\n  });\n  var cache = new TreeCache$1({\n    name: name,\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 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 Recoil_err('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 _iterator47 = _createForOfIteratorHelper(x),\n        _step47;\n\n    try {\n      for (_iterator47.s(); !(_step47 = _iterator47.n()).done;) {\n        var _step47$value = _slicedToArray(_step47.value, 2),\n            k = _step47$value[0],\n            v = _step47$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      _iterator47.e(err);\n    } finally {\n      _iterator47.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 (k) {\n    return x[k] !== undefined;\n  }).sort() // stringify the key to add quotes and escape any nested slashes or quotes.\n  .map(function (k) {\n    return \"\".concat(stringify(k, opt), \":\").concat(stringify(x[k], opt, k));\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;\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 _ref18 = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : defaultPolicy,\n      _ref18$equality = _ref18.equality,\n      equality = _ref18$equality === void 0 ? defaultPolicy.equality : _ref18$equality,\n      _ref18$eviction = _ref18.eviction,\n      eviction = _ref18$eviction === void 0 ? defaultPolicy.eviction : _ref18$eviction,\n      _ref18$maxSize = _ref18.maxSize,\n      maxSize = _ref18$maxSize === void 0 ? defaultPolicy.maxSize : _ref18$maxSize;\n\n  var name = arguments.length > 1 ? arguments[1] : undefined;\n  var valueMapper = getValueMapper(equality);\n  return getTreeCache(eviction, maxSize, valueMapper, name);\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 Recoil_err(\"Unrecognized equality policy \".concat(equality));\n}\n\nfunction getTreeCache(eviction, maxSize, mapNodeValue, name) {\n  switch (eviction) {\n    case 'keep-all':\n      // $FlowFixMe[method-unbinding]\n      return new TreeCache$2({\n        name: name,\n        mapNodeValue: mapNodeValue\n      });\n\n    case 'lru':\n      return Recoil_treeCacheLRU({\n        name: name,\n        maxSize: Recoil_nullthrows(maxSize),\n        mapNodeValue: mapNodeValue\n      });\n\n    case 'most-recent':\n      return Recoil_treeCacheLRU({\n        name: name,\n        maxSize: 1,\n        mapNodeValue: mapNodeValue\n      });\n  }\n\n  throw Recoil_err(\"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\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    isWindow$1 = Recoil_Environment.isWindow;\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 (!isReactNative$1 && isWindow$1(value)) {\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;\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 isLoadable$1 = Recoil_Loadable$1.isLoadable,\n    loadableWithError$1 = Recoil_Loadable$1.loadableWithError,\n    loadableWithPromise$1 = Recoil_Loadable$1.loadableWithPromise,\n    loadableWithValue$2 = Recoil_Loadable$1.loadableWithValue;\nvar WrappedValue$1 = Recoil_Wrapper$1.WrappedValue;\nvar getNodeLoadable$2 = Recoil_FunctionalCore.getNodeLoadable,\n    peekNodeLoadable$1 = Recoil_FunctionalCore.peekNodeLoadable,\n    setNodeValue$3 = Recoil_FunctionalCore.setNodeValue;\nvar saveDepsToStore$1 = Recoil_Graph.saveDepsToStore;\nvar DEFAULT_VALUE$6 = Recoil_Node.DEFAULT_VALUE,\n    RecoilValueNotReady$2 = Recoil_Node.RecoilValueNotReady,\n    getConfigDeletionHandler$1 = Recoil_Node.getConfigDeletionHandler,\n    getNode$6 = Recoil_Node.getNode,\n    registerNode$1 = Recoil_Node.registerNode;\nvar isRecoilValue$3 = Recoil_RecoilValue$1.isRecoilValue;\nvar markRecoilValueModified$1 = Recoil_RecoilValueInterface.markRecoilValueModified;\nvar retainedByOptionWithDefault$1 = Recoil_Retention.retainedByOptionWithDefault;\nvar recoilCallback$1 = Recoil_useRecoilCallback.recoilCallback;\nvar startPerfBlock$1 = Recoil_PerformanceTimings.startPerfBlock;\n\nvar Canceled = function Canceled() {\n  _classCallCheck(this, Canceled);\n};\n\nvar CANCELED = new Canceled();\n/**\n * An ExecutionID is an arbitrary ID that lets us distinguish executions from\n * each other. This is necessary as we need a way of solving this problem:\n * \"given 3 async executions, only update state for the 'latest' execution when\n * it finishes running regardless of when the other 2 finish\". ExecutionIDs\n * provide a convenient way of identifying executions so that we can track and\n * manage them over time.\n */\n\nvar dependencyStack = []; // for detecting circular dependencies.\n\nvar waitingStores = new Map();\n\nvar getNewExecutionID = function () {\n  var executionID = 0;\n  return function () {\n    return executionID++;\n  };\n}();\n/* eslint-disable no-redeclare */\n\n\nfunction selector(options) {\n  var recoilValue = null;\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  if (process.env.NODE_ENV !== \"production\") {\n    if (typeof key !== 'string') {\n      throw Recoil_err('A key option with a unique string value must be provided when creating a selector.');\n    }\n\n    if (typeof get !== 'function') {\n      throw Recoil_err('Selectors must specify a get callback option to get the selector value.');\n    }\n  } // This is every discovered dependency across all executions\n\n\n  var discoveredDependencyNodeKeys = new Set();\n  var cache = Recoil_treeCacheFromPolicy(cachePolicy !== null && cachePolicy !== void 0 ? cachePolicy : {\n    equality: 'reference',\n    eviction: 'keep-all'\n  }, key);\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('recoil_memory_managament_2020') || liveStoresCount > 0;\n  }\n\n  function selectorInit(store) {\n    store.getState().knownSelectors.add(key);\n    liveStoresCount++;\n    return function () {\n      liveStoresCount--;\n    };\n  }\n\n  function selectorShouldDeleteConfigOnRelease() {\n    return getConfigDeletionHandler$1(key) !== undefined && !selectorIsLive();\n  }\n\n  function resolveAsync(store, state, executionID, loadable, depValues) {\n    setCache(state, loadable, depValues);\n    notifyStoresOfResolvedAsync(store, executionID);\n  }\n\n  function notifyStoresOfResolvedAsync(store, executionID) {\n    if (isLatestExecution(store, executionID)) {\n      clearExecutionInfo(store);\n    }\n\n    notifyWaitingStores(executionID, true);\n  }\n  /**\n   * Notify stores to pull the selector again if a new async dep was discovered.\n   * 1) Async selector adds a new dep but doesn't resolve yet.\n   *    Note that deps for an async selector are based on the state when the\n   *    evaluation started, in order to provide a consistent picture of state.\n   * 2) But, new value of dep based on the current state might cause the selector\n   *    to resolve or resolve differently.\n   * 3) Therefore, this notification will pull the selector based on the current\n   *    state for the components\n   */\n\n\n  function notifyStoresOfNewAsyncDep(store, executionID) {\n    if (isLatestExecution(store, executionID)) {\n      var executionInfo = Recoil_nullthrows(getExecutionInfo(store));\n      executionInfo.stateVersions.clear();\n      notifyWaitingStores(executionID, false);\n    }\n  }\n\n  function notifyWaitingStores(executionID, clearWaitlist) {\n    var stores = waitingStores.get(executionID);\n\n    if (stores != null) {\n      var _iterator48 = _createForOfIteratorHelper(stores),\n          _step48;\n\n      try {\n        for (_iterator48.s(); !(_step48 = _iterator48.n()).done;) {\n          var waitingStore = _step48.value;\n          markRecoilValueModified$1(waitingStore, Recoil_nullthrows(recoilValue));\n        }\n      } catch (err) {\n        _iterator48.e(err);\n      } finally {\n        _iterator48.f();\n      }\n\n      if (clearWaitlist) {\n        waitingStores.delete(executionID);\n      }\n    }\n  }\n\n  function markStoreWaitingForResolvedAsync(store, executionID) {\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   * 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 wrapResultPromise(store, promise, state, depValues, executionID, loadingDepsState) {\n    return promise.then(function (value) {\n      if (!selectorIsLive()) {\n        // The selector was released since the request began; ignore the response.\n        clearExecutionInfo(store);\n        throw CANCELED;\n      }\n\n      var loadable = loadableWithValue$2(value);\n      resolveAsync(store, state, executionID, loadable, depValues);\n      return value;\n    }).catch(function (errorOrPromise) {\n      if (!selectorIsLive()) {\n        // The selector was released since the request began; ignore the response.\n        clearExecutionInfo(store);\n        throw CANCELED;\n      }\n\n      if (Recoil_isPromise(errorOrPromise)) {\n        return wrapPendingDependencyPromise(store, errorOrPromise, state, depValues, executionID, loadingDepsState);\n      }\n\n      var loadable = loadableWithError$1(errorOrPromise);\n      resolveAsync(store, state, executionID, loadable, depValues);\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 wrapResultPromise() instead.\n   */\n\n\n  function wrapPendingDependencyPromise(store, promise, state, existingDeps, executionID, loadingDepsState) {\n    return promise.then(function (resolvedDep) {\n      if (!selectorIsLive()) {\n        // The selector was released since the request began; ignore the response.\n        clearExecutionInfo(store);\n        throw CANCELED;\n      } // Check if we are handling a pending Recoil dependency or if the user\n      // threw their own Promise to \"suspend\" a selector evaluation.  We need\n      // to check that the loadingDepPromise actually matches the promise that\n      // we caught in case the selector happened to catch the promise we threw\n      // for a pending Recoil dependency from `getRecoilValue()` and threw\n      // their own promise instead.\n\n\n      if (loadingDepsState.loadingDepKey != null && loadingDepsState.loadingDepPromise === promise) {\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(loadingDepsState.loadingDepKey, loadableWithValue$2(resolvedDep));\n      } else {\n        /**\n         * If resolvedDepKey is not defined, the promise was a user-thrown\n         * promise. User-thrown promises are an advanced feature and they\n         * should be avoided in almost all cases. Using `loadable.map()` inside\n         * of selectors for loading loadables and then throwing that mapped\n         * loadable's promise is an example of a user-thrown promise.\n         *\n         * When we hit a user-thrown promise, we have to bail out of an optimization\n         * where we bypass calculating selector cache keys for selectors that\n         * have been previously seen for a given state (these selectors are saved in\n         * state.atomValues) to avoid stale state as we have no way of knowing\n         * what state changes happened (if any) in result to the promise resolving.\n         *\n         * Ideally we would only bail out selectors that are in the chain of\n         * dependencies for this selector, but there's currently no way to get\n         * a full list of a selector's downstream nodes because the state that\n         * is executing may be a discarded tree (so store.getGraph(state.version)\n         * will be empty), and the full dep tree may not be in the selector\n         * caches in the case where the selector's cache was cleared. To solve\n         * for this we would have to keep track of all running selector\n         * executions and their downstream deps. Because this only covers edge\n         * cases, that complexity might not be justifyable.\n         */\n        store.getState().knownSelectors.forEach(function (nodeKey) {\n          state.atomValues.delete(nodeKey);\n        });\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 us exit early when\n       * an async dep resolves.\n       */\n\n\n      var cachedLoadable = getLoadableFromCacheAndUpdateDeps(store, state);\n\n      if (cachedLoadable && cachedLoadable.state !== 'loading') {\n        /**\n         * This has to notify stores of a resolved async, even if there is no\n         * current pending execution for the following case:\n         * 1) A component renders with this pending loadable.\n         * 2) The upstream dependency resolves.\n         * 3) While processing some other selector it reads this one, such as\n         *    while traversing its dependencies.  At this point it gets the\n         *    new resolved value synchronously and clears the current\n         *    execution ID.  The component wasn't getting the value itself,\n         *    though, so it still has the pending loadable.\n         * 4) When this code executes the current execution id was cleared\n         *    and it wouldn't notify the component of the new value.\n         *\n         * I think this is only an issue with \"early\" rendering since the\n         * components got their value using the in-progress execution.\n         * We don't have a unit test for this case yet.  I'm not sure it is\n         * necessary with recoil_transition_support mode.\n         */\n        if (isLatestExecution(store, executionID) || getExecutionInfo(store) == null) {\n          notifyStoresOfResolvedAsync(store, executionID);\n        }\n\n        if (cachedLoadable.state === 'hasValue') {\n          return cachedLoadable.contents;\n        } else {\n          throw cachedLoadable.contents;\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 = getInProgressExecutionInfo(store, state);\n\n        if (executionInfo != null) {\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.loadingLoadable.contents;\n        }\n      } // Retry the selector evaluation now that the dependency has resolved\n\n\n      var _evaluateSelectorGett = evaluateSelectorGetter(store, state, executionID),\n          _evaluateSelectorGett2 = _slicedToArray(_evaluateSelectorGett, 2),\n          loadable = _evaluateSelectorGett2[0],\n          depValues = _evaluateSelectorGett2[1];\n\n      if (loadable.state !== 'loading') {\n        resolveAsync(store, state, executionID, loadable, depValues);\n      }\n\n      if (loadable.state === 'hasError') {\n        throw loadable.contents;\n      }\n\n      return loadable.contents;\n    }).catch(function (error) {\n      // The selector was released since the request began; ignore the response.\n      if (error instanceof Canceled) {\n        throw CANCELED;\n      }\n\n      if (!selectorIsLive()) {\n        clearExecutionInfo(store);\n        throw CANCELED;\n      }\n\n      var loadable = loadableWithError$1(error);\n      resolveAsync(store, state, executionID, loadable, existingDeps);\n      throw error;\n    });\n  }\n\n  function updateDeps(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      saveDepsToStore$1(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    var _iterator49 = _createForOfIteratorHelper(deps),\n        _step49;\n\n    try {\n      for (_iterator49.s(); !(_step49 = _iterator49.n()).done;) {\n        var nodeKey = _step49.value;\n        discoveredDependencyNodeKeys.add(nodeKey);\n      }\n    } catch (err) {\n      _iterator49.e(err);\n    } finally {\n      _iterator49.f();\n    }\n  }\n\n  function evaluateSelectorGetter(store, state, executionID) {\n    var endPerfBlock = startPerfBlock$1(key); // TODO T63965866: use execution ID here\n\n    var duringSynchronousExecution = true;\n    var duringAsynchronousExecution = true;\n\n    var finishEvaluation = function finishEvaluation() {\n      endPerfBlock();\n      duringAsynchronousExecution = false;\n    };\n\n    var result;\n    var resultIsError = false;\n    var loadable;\n    var loadingDepsState = {\n      loadingDepKey: null,\n      loadingDepPromise: null\n    };\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 depValues = new Map();\n\n    function getRecoilValue(_ref19) {\n      var depKey = _ref19.key;\n      var depLoadable = getNodeLoadable$2(store, state, depKey);\n      depValues.set(depKey, depLoadable); // We need to update asynchronous dependencies as we go so the selector\n      // knows if it has to restart evaluation if one of them is updated before\n      // the asynchronous selector completely resolves.\n\n      if (!duringSynchronousExecution) {\n        updateDeps(store, state, new Set(depValues.keys()), executionID);\n        notifyStoresOfNewAsyncDep(store, executionID);\n      }\n\n      switch (depLoadable.state) {\n        case 'hasValue':\n          return depLoadable.contents;\n\n        case 'hasError':\n          throw depLoadable.contents;\n\n        case 'loading':\n          loadingDepsState.loadingDepKey = depKey;\n          loadingDepsState.loadingDepPromise = depLoadable.contents;\n          throw depLoadable.contents;\n      }\n\n      throw Recoil_err('Invalid Loadable state');\n    }\n\n    var getCallback = function getCallback(fn) {\n      return function () {\n        if (duringAsynchronousExecution) {\n          throw Recoil_err('Callbacks from getCallback() should only be called asynchronously after the selector is evalutated.  It can be used for selectors to return objects with callbacks that can work with Recoil state without a subscription.');\n        }\n\n        !(recoilValue != null) ? process.env.NODE_ENV !== \"production\" ? Recoil_invariant(false, 'Recoil Value can never be null') : Recoil_invariant(false) : void 0;\n\n        for (var _len8 = arguments.length, args = new Array(_len8), _key11 = 0; _key11 < _len8; _key11++) {\n          args[_key11] = arguments[_key11];\n        }\n\n        return recoilCallback$1(store, fn, args, {\n          node: recoilValue\n        } // flowlint-line unclear-type:off\n        );\n      };\n    };\n\n    try {\n      result = get({\n        get: getRecoilValue,\n        getCallback: getCallback\n      });\n      result = isRecoilValue$3(result) ? getRecoilValue(result) : result;\n\n      if (isLoadable$1(result)) {\n        if (result.state === 'hasError') {\n          resultIsError = true;\n        }\n\n        result = result.contents;\n      }\n\n      if (Recoil_isPromise(result)) {\n        result = wrapResultPromise(store, result, state, depValues, executionID, loadingDepsState).finally(finishEvaluation);\n      } else {\n        finishEvaluation();\n      }\n\n      result = result instanceof WrappedValue$1 ? result.value : result;\n    } catch (errorOrDepPromise) {\n      result = errorOrDepPromise;\n\n      if (Recoil_isPromise(result)) {\n        result = wrapPendingDependencyPromise(store, result, state, depValues, executionID, loadingDepsState).finally(finishEvaluation);\n      } else {\n        resultIsError = true;\n        finishEvaluation();\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    duringSynchronousExecution = false;\n    updateExecutionInfoDepValues(store, executionID, depValues);\n    updateDeps(store, state, new Set(depValues.keys()), executionID);\n    return [loadable, depValues];\n  }\n\n  function getLoadableFromCacheAndUpdateDeps(store, state) {\n    // First, look up in the state cache\n    // If it's here, then the deps in the store should already be valid.\n    var cachedLoadable = state.atomValues.get(key);\n\n    if (cachedLoadable != null) {\n      return cachedLoadable;\n    } // Second, look up in the selector cache and update the deps in the store\n\n\n    var depsAfterCacheLookup = new Set();\n\n    try {\n      cachedLoadable = 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        return getNodeLoadable$2(store, state, nodeKey).contents;\n      }, {\n        onNodeVisit: function onNodeVisit(node) {\n          if (node.type === 'branch' && node.nodeKey !== key) {\n            depsAfterCacheLookup.add(node.nodeKey);\n          }\n        }\n      });\n    } catch (error) {\n      throw Recoil_err(\"Problem with cache lookup for selector \\\"\".concat(key, \"\\\": \").concat(error.message));\n    }\n\n    if (cachedLoadable) {\n      var _getExecutionInfo; // Cache the results in the state to allow for cheaper lookup than\n      // iterating the tree cache of dependencies.\n\n\n      state.atomValues.set(key, cachedLoadable);\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_ signify\n       * a change in deps in the store if the store deps for this state are empty\n       * or stale.\n       */\n\n      updateDeps(store, state, depsAfterCacheLookup, (_getExecutionInfo = getExecutionInfo(store)) === null || _getExecutionInfo === void 0 ? void 0 : _getExecutionInfo.executionID);\n    }\n\n    return cachedLoadable;\n  }\n  /**\n   * Given a tree state, this function returns a Loadable of the current state.\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 getSelectorLoadableAndUpdateDeps(store, state) {\n    // First, see if our current state is cached\n    var cachedVal = getLoadableFromCacheAndUpdateDeps(store, state);\n\n    if (cachedVal != null) {\n      clearExecutionInfo(store);\n      return cachedVal;\n    } // Second, check if there is already an ongoing execution based on the current state\n\n\n    var inProgressExecutionInfo = getInProgressExecutionInfo(store, state);\n\n    if (inProgressExecutionInfo != null) {\n      var _inProgressExecutionI;\n\n      if (((_inProgressExecutionI = inProgressExecutionInfo.loadingLoadable) === null || _inProgressExecutionI === void 0 ? void 0 : _inProgressExecutionI.state) === 'loading') {\n        markStoreWaitingForResolvedAsync(store, inProgressExecutionInfo.executionID);\n      } // FIXME: check after the fact to see if we made the right choice by waiting\n\n\n      return inProgressExecutionInfo.loadingLoadable;\n    } // Third, start a new evaluation of the selector\n\n\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     * 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    if (loadable.state === 'loading') {\n      setExecutionInfo(store, newExecutionID, loadable, newDepValues, state);\n      markStoreWaitingForResolvedAsync(store, newExecutionID);\n    } else {\n      clearExecutionInfo(store);\n      setCache(state, loadable, newDepValues);\n    }\n\n    return loadable;\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 getInProgressExecutionInfo(store, state) {\n    // Sort the pending executions so that our current store is checked first.\n    var pendingExecutions = Recoil_concatIterables([executionInfoMap.has(store) ? [Recoil_nullthrows(executionInfoMap.get(store))] : [], Recoil_mapIterable(Recoil_filterIterable(executionInfoMap, function (_ref20) {\n      var _ref21 = _slicedToArray(_ref20, 1),\n          s = _ref21[0];\n\n      return s !== store;\n    }), function (_ref22) {\n      var _ref23 = _slicedToArray(_ref22, 2),\n          execInfo = _ref23[1];\n\n      return execInfo;\n    })]);\n\n    function anyDepChanged(execDepValues) {\n      var _iterator50 = _createForOfIteratorHelper(execDepValues),\n          _step50;\n\n      try {\n        for (_iterator50.s(); !(_step50 = _iterator50.n()).done;) {\n          var _step50$value = _slicedToArray(_step50.value, 2),\n              depKey = _step50$value[0],\n              execLoadable = _step50$value[1];\n\n          if (!getNodeLoadable$2(store, state, depKey).is(execLoadable)) {\n            return true;\n          }\n        }\n      } catch (err) {\n        _iterator50.e(err);\n      } finally {\n        _iterator50.f();\n      }\n\n      return false;\n    }\n\n    var _iterator51 = _createForOfIteratorHelper(pendingExecutions),\n        _step51;\n\n    try {\n      for (_iterator51.s(); !(_step51 = _iterator51.n()).done;) {\n        var execInfo = _step51.value;\n\n        if ( // If this execution was already checked to be valid with this version\n        // of state, then let's use it!\n        execInfo.stateVersions.get(state.version) || // If the deps for the execution match our current state, then it's valid\n        !anyDepChanged(execInfo.depValuesDiscoveredSoFarDuringAsyncWork)) {\n          execInfo.stateVersions.set(state.version, true);\n          return execInfo;\n        } else {\n          execInfo.stateVersions.set(state.version, false);\n        }\n      }\n    } catch (err) {\n      _iterator51.e(err);\n    } finally {\n      _iterator51.f();\n    }\n\n    return undefined;\n  }\n\n  function getExecutionInfo(store) {\n    return executionInfoMap.get(store);\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(store, newExecutionID, loadable, depValues, state) {\n    executionInfoMap.set(store, {\n      depValuesDiscoveredSoFarDuringAsyncWork: depValues,\n      executionID: newExecutionID,\n      loadingLoadable: loadable,\n      stateVersions: new Map([[state.version, true]])\n    });\n  }\n\n  function updateExecutionInfoDepValues(store, executionID, depValues) {\n    // We only need to bother updating the deps for the latest execution because\n    // that's all getInProgressExecutionInfo() will be looking for.\n    if (isLatestExecution(store, executionID)) {\n      var executionInfo = getExecutionInfo(store);\n\n      if (executionInfo != null) {\n        executionInfo.depValuesDiscoveredSoFarDuringAsyncWork = depValues;\n      }\n    }\n  }\n\n  function clearExecutionInfo(store) {\n    executionInfoMap.delete(store);\n  }\n\n  function isLatestExecution(store, executionID) {\n    var _getExecutionInfo2;\n\n    return executionID === ((_getExecutionInfo2 = getExecutionInfo(store)) === null || _getExecutionInfo2 === void 0 ? void 0 : _getExecutionInfo2.executionID);\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 (_ref24) {\n      var _ref25 = _slicedToArray(_ref24, 2),\n          depKey = _ref25[0],\n          valLoadable = _ref25[1];\n\n      return [depKey, valLoadable.contents];\n    });\n  }\n\n  function setCache(state, loadable, depValues) {\n    if (process.env.NODE_ENV !== \"production\") {\n      if (loadable.state !== 'loading' && Boolean(options.dangerouslyAllowMutability) === false) {\n        Recoil_deepFreezeValue(loadable.contents);\n      }\n    }\n\n    state.atomValues.set(key, loadable);\n\n    try {\n      cache.set(depValuesToDepRoute(depValues), loadable);\n    } catch (error) {\n      throw Recoil_err(\"Problem with setting cache for selector \\\"\".concat(key, \"\\\": \").concat(error.message));\n    }\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(Recoil_err(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 cachedLoadable = state.atomValues.get(key);\n\n    if (cachedLoadable != null) {\n      return cachedLoadable;\n    }\n\n    return cache.get(function (nodeKey) {\n      var _peekNodeLoadable;\n\n      !(typeof nodeKey === 'string') ? process.env.NODE_ENV !== \"production\" ? Recoil_invariant(false, 'Cache nodeKey is type string') : Recoil_invariant(false) : void 0;\n      return (_peekNodeLoadable = peekNodeLoadable$1(store, state, nodeKey)) === null || _peekNodeLoadable === void 0 ? void 0 : _peekNodeLoadable.contents;\n    });\n  }\n\n  function selectorGet(store, state) {\n    return detectCircularDependencies(function () {\n      return getSelectorLoadableAndUpdateDeps(store, state);\n    });\n  }\n\n  function invalidateSelector(state) {\n    state.atomValues.delete(key);\n  }\n\n  function clearSelectorCache(store, treeState) {\n    !(recoilValue != null) ? process.env.NODE_ENV !== \"production\" ? Recoil_invariant(false, 'Recoil Value can never be null') : Recoil_invariant(false) : void 0;\n\n    var _iterator52 = _createForOfIteratorHelper(discoveredDependencyNodeKeys),\n        _step52;\n\n    try {\n      for (_iterator52.s(); !(_step52 = _iterator52.n()).done;) {\n        var nodeKey = _step52.value;\n\n        var _node$clearCache;\n\n        var node = getNode$6(nodeKey);\n        (_node$clearCache = node.clearCache) === null || _node$clearCache === void 0 ? void 0 : _node$clearCache.call(node, store, treeState);\n      }\n    } catch (err) {\n      _iterator52.e(err);\n    } finally {\n      _iterator52.f();\n    }\n\n    discoveredDependencyNodeKeys.clear();\n    invalidateSelector(treeState);\n    cache.clear();\n    markRecoilValueModified$1(store, recoilValue);\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(_ref26) {\n        var depKey = _ref26.key;\n\n        if (syncSelectorSetFinished) {\n          throw Recoil_err('Recoil: Async selector sets are not currently supported.');\n        }\n\n        var loadable = getNodeLoadable$2(store, state, depKey);\n\n        if (loadable.state === 'hasValue') {\n          return loadable.contents;\n        } else if (loadable.state === 'loading') {\n          throw new RecoilValueNotReady$2(depKey);\n        } else {\n          throw loadable.contents;\n        }\n      }\n\n      function setRecoilState(recoilState, valueOrUpdater) {\n        if (syncSelectorSetFinished) {\n          throw Recoil_err('Recoil: Async selector sets are not currently supported.');\n        }\n\n        var setValue = 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, setValue);\n        upstreamWrites.forEach(function (v, k) {\n          return writes.set(k, v);\n        });\n      }\n\n      function resetRecoilState(recoilState) {\n        setRecoilState(recoilState, DEFAULT_VALUE$6);\n      }\n\n      var ret = set( // $FlowFixMe[incompatible-call]\n      {\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) ? Recoil_err('Recoil: Async selector sets are not currently supported.') : Recoil_err('Recoil: selector set should be a void function.');\n      }\n\n      syncSelectorSetFinished = true;\n      return writes;\n    };\n\n    return recoilValue = registerNode$1({\n      key: key,\n      nodeType: 'selector',\n      peek: selectorPeek,\n      get: selectorGet,\n      set: selectorSet,\n      init: selectorInit,\n      invalidate: invalidateSelector,\n      clearCache: clearSelectorCache,\n      shouldDeleteConfigOnRelease: selectorShouldDeleteConfigOnRelease,\n      dangerouslyAllowMutability: options.dangerouslyAllowMutability,\n      shouldRestoreFromSnapshots: false,\n      retainedBy: retainedBy\n    });\n  } else {\n    return recoilValue = registerNode$1({\n      key: key,\n      nodeType: 'selector',\n      peek: selectorPeek,\n      get: selectorGet,\n      init: selectorInit,\n      invalidate: invalidateSelector,\n      clearCache: clearSelectorCache,\n      shouldDeleteConfigOnRelease: selectorShouldDeleteConfigOnRelease,\n      dangerouslyAllowMutability: options.dangerouslyAllowMutability,\n      shouldRestoreFromSnapshots: false,\n      retainedBy: retainedBy\n    });\n  }\n}\n/* eslint-enable no-redeclare */\n// $FlowIssue[incompatible-use]\n\n\nselector.value = function (value) {\n  return new WrappedValue$1(value);\n};\n\nvar Recoil_selector = selector; // @fb-only: import type {ScopeRules} from 'Recoil_ScopedAtom';\n// @fb-only: const {scopedAtom} = require('Recoil_ScopedAtom');\n\nvar isLoadable$2 = Recoil_Loadable$1.isLoadable,\n    loadableWithError$2 = Recoil_Loadable$1.loadableWithError,\n    loadableWithPromise$2 = Recoil_Loadable$1.loadableWithPromise,\n    loadableWithValue$3 = Recoil_Loadable$1.loadableWithValue;\nvar WrappedValue$2 = Recoil_Wrapper$1.WrappedValue;\nvar peekNodeInfo$3 = Recoil_FunctionalCore.peekNodeInfo;\nvar DEFAULT_VALUE$7 = 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 getRecoilValueAsLoadable$4 = Recoil_RecoilValueInterface.getRecoilValueAsLoadable,\n    markRecoilValueModified$2 = Recoil_RecoilValueInterface.markRecoilValueModified,\n    setRecoilValue$4 = Recoil_RecoilValueInterface.setRecoilValue,\n    setRecoilValueLoadable$2 = 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\n  function unwrapPromise(promise) {\n    return loadableWithPromise$2(promise.then(function (value) {\n      defaultLoadable = loadableWithValue$3(value);\n      return value;\n    }).catch(function (error) {\n      defaultLoadable = loadableWithError$2(error);\n      throw error;\n    }));\n  }\n\n  var defaultLoadable = Recoil_isPromise(options.default) ? unwrapPromise(options.default) : isLoadable$2(options.default) ? options.default.state === 'loading' ? unwrapPromise(options.default.contents) : options.default : loadableWithValue$3(options.default instanceof WrappedValue$2 ? options.default.value : options.default);\n  maybeFreezeValueOrPromise(defaultLoadable.contents);\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 maybeFreezeValueOrPromise(valueOrPromise) {\n    if (process.env.NODE_ENV !== \"production\") {\n      if (options.dangerouslyAllowMutability !== true) {\n        if (Recoil_isPromise(valueOrPromise)) {\n          return valueOrPromise.then(function (value) {\n            Recoil_deepFreezeValue(value);\n            return value;\n          });\n        } else {\n          Recoil_deepFreezeValue(valueOrPromise);\n          return valueOrPromise;\n        }\n      }\n    }\n\n    return valueOrPromise;\n  }\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$4(store, node, value);\n      }\n\n      return value;\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$2(store, node, loadableWithError$2(error));\n      }\n\n      throw error;\n    });\n    return wrappedPromise;\n  }\n\n  function initAtom(store, initState, trigger) {\n    var _options$effects;\n\n    liveStoresCount++;\n\n    var cleanupAtom = function cleanupAtom() {\n      var _cleanupEffectsByStor;\n\n      liveStoresCount--;\n      (_cleanupEffectsByStor = cleanupEffectsByStore.get(store)) === null || _cleanupEffectsByStor === void 0 ? void 0 : _cleanupEffectsByStor.forEach(function (cleanup) {\n        return cleanup();\n      });\n      cleanupEffectsByStore.delete(store);\n    };\n\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$2(store, node);\n        }\n      };\n\n      defaultLoadable.contents.finally(notifyDefaultSubscribers);\n    } ///////////////////\n    // Run Atom Effects\n    ///////////////////\n\n\n    var effects = (_options$effects = options.effects) !== null && _options$effects !== void 0 ? _options$effects : options.effects_UNSTABLE;\n\n    if (effects != null) {\n      var getLoadable = function getLoadable(recoilValue) {\n        // Normally we can just get the current value of another atom.\n        // But for our own value we need to check if there is a pending\n        // initialized value or get the fallback default value.\n        if (duringInit && recoilValue.key === key) {\n          // Cast T to S\n          var retValue = initValue; // flowlint-line unclear-type:off\n\n          return retValue instanceof DefaultValue$2 ? peekAtom(store, initState) // flowlint-line unclear-type:off\n          : Recoil_isPromise(retValue) ? loadableWithPromise$2(retValue.then(function (v) {\n            return v instanceof DefaultValue$2 ? // Cast T to S\n            defaultLoadable.toPromise() // flowlint-line unclear-type:off\n            : v;\n          })) : loadableWithValue$3(retValue);\n        }\n\n        return getRecoilValueAsLoadable$4(store, recoilValue);\n      };\n\n      var getPromise = function getPromise(recoilValue) {\n        return getLoadable(recoilValue).toPromise();\n      };\n\n      var getInfo_UNSTABLE = function getInfo_UNSTABLE(recoilValue) {\n        var _store$getState$nextT4;\n\n        var info = peekNodeInfo$3(store, (_store$getState$nextT4 = store.getState().nextTree) !== null && _store$getState$nextT4 !== void 0 ? _store$getState$nextT4 : store.getState().currentTree, recoilValue.key);\n        return duringInit && recoilValue.key === key && !(initValue instanceof DefaultValue$2) ? _objectSpread(_objectSpread({}, info), {}, {\n          isSet: true,\n          loadable: getLoadable(recoilValue)\n        }) : info;\n      };\n\n      // This state is scoped by Store, since this is in the initAtom() closure\n      var duringInit = true;\n      var initValue = DEFAULT_VALUE$7;\n      var isInitError = false;\n      var pendingSetSelf = null;\n\n      var setSelf = function setSelf(effect) {\n        return function (valueOrUpdater) {\n          if (duringInit) {\n            var currentLoadable = getLoadable(node);\n            var currentValue = currentLoadable.state === 'hasValue' ? currentLoadable.contents : DEFAULT_VALUE$7;\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;\n\n            if (Recoil_isPromise(initValue)) {\n              initValue = initValue.then(function (value) {\n                // Avoid calling onSet() when setSelf() initializes with a Promise\n                pendingSetSelf = {\n                  effect: effect,\n                  value: value\n                };\n                return value;\n              });\n            }\n          } else {\n            if (Recoil_isPromise(valueOrUpdater)) {\n              throw Recoil_err('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$4(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$7);\n        };\n      };\n\n      var onSet = function onSet(effect) {\n        return function (handler) {\n          var _cleanupEffectsByStor2;\n\n          var _store$subscribeToTra = store.subscribeToTransactions(function (currentStore) {\n            var _currentTree$atomValu; // eslint-disable-next-line prefer-const\n\n\n            // eslint-disable-next-line prefer-const\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$7; // 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              // 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              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, !currentTree.atomValues.has(key));\n              } else if (((_pendingSetSelf3 = pendingSetSelf) === null || _pendingSetSelf3 === void 0 ? void 0 : _pendingSetSelf3.effect) === effect) {\n                pendingSetSelf = null;\n              }\n            }\n          }, key),\n              release = _store$subscribeToTra.release;\n\n          cleanupEffectsByStore.set(store, [].concat(_toConsumableArray((_cleanupEffectsByStor2 = cleanupEffectsByStore.get(store)) !== null && _cleanupEffectsByStor2 !== void 0 ? _cleanupEffectsByStor2 : []), [release]));\n        };\n      };\n\n      var _iterator53 = _createForOfIteratorHelper(effects),\n          _step53;\n\n      try {\n        for (_iterator53.s(); !(_step53 = _iterator53.n()).done;) {\n          var effect = _step53.value;\n\n          try {\n            var cleanup = effect({\n              node: node,\n              storeID: store.storeID,\n              trigger: trigger,\n              setSelf: setSelf(effect),\n              resetSelf: resetSelf(effect),\n              onSet: onSet(effect),\n              getPromise: getPromise,\n              getLoadable: getLoadable,\n              getInfo_UNSTABLE: getInfo_UNSTABLE\n            });\n\n            if (cleanup != null) {\n              var _cleanupEffectsByStor3;\n\n              cleanupEffectsByStore.set(store, [].concat(_toConsumableArray((_cleanupEffectsByStor3 = cleanupEffectsByStore.get(store)) !== null && _cleanupEffectsByStor3 !== void 0 ? _cleanupEffectsByStor3 : []), [cleanup]));\n            }\n          } catch (error) {\n            initValue = error;\n            isInitError = true;\n          }\n        }\n      } catch (err) {\n        _iterator53.e(err);\n      } finally {\n        _iterator53.f();\n      }\n\n      duringInit = false; // 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      if (!(initValue instanceof DefaultValue$2)) {\n        var _store$getState$nextT5;\n\n        var frozenInitValue = maybeFreezeValueOrPromise(initValue);\n        var initLoadable = isInitError ? loadableWithError$2(initValue) : Recoil_isPromise(frozenInitValue) ? loadableWithPromise$2(wrapPendingPromise(store, frozenInitValue)) : loadableWithValue$3(frozenInitValue);\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$nextT5 = store.getState().nextTree) === null || _store$getState$nextT5 === void 0 ? void 0 : _store$getState$nextT5.atomValues.set(key, initLoadable);\n      }\n    }\n\n    return cleanupAtom;\n  }\n\n  function peekAtom(_store, state) {\n    var _ref, _state$atomValues$get3;\n\n    return (_ref = (_state$atomValues$get3 = state.atomValues.get(key)) !== null && _state$atomValues$get3 !== void 0 ? _state$atomValues$get3 : cachedAnswerForUnvalidatedValue) !== 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$7);\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    maybeFreezeValueOrPromise(newValue);\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  if (process.env.NODE_ENV !== \"production\") {\n    if (typeof options.key !== 'string') {\n      throw Recoil_err('A key option with a unique string value must be provided when creating an atom.');\n    }\n  }\n\n  var restOptions = Object.assign({}, options);\n  var optionsDefault = 'default' in options ? // $FlowIssue[prop-missing] No way to refine in Flow that property is not defined\n  // $FlowIssue[incompatible-type] No way to refine in Flow that property is not defined\n  options.default : new Promise(function () {});\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  // @fb-only: || (isLoadable(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\n    // @fb-only: && !isPromise(optionsDefault)\n    // @fb-only: && !isLoadable(optionsDefault)\n    // @fb-only: ) {\n    // @fb-only: return scopedAtom<T>({\n    // @fb-only: ...restOptions,\n    // @fb-only: default: optionsDefault instanceof WrappedValue\n    // @fb-only: ? optionsDefault.value\n    // @fb-only: : 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$7,\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$7);\n      }\n    }),\n    // TODO Hack for now.\n    effects: options.effects,\n    // flowlint-line unclear-type: off\n    effects_UNSTABLE: options.effects_UNSTABLE // flowlint-line unclear-type: off\n\n  }));\n  var sel = Recoil_selector({\n    key: \"\".concat(options.key, \"__withFallback\"),\n    get: function get(_ref27) {\n      var _get = _ref27.get;\n\n      var baseValue = _get(base);\n\n      return baseValue instanceof DefaultValue$2 ? options.default : baseValue;\n    },\n    set: function set(_ref28, newValue) {\n      var _set = _ref28.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\natom.value = function (value) {\n  return new WrappedValue$2(value);\n};\n\nvar Recoil_atom = atom;\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 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 _ref29 = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : defaultPolicy$1,\n      _ref29$equality = _ref29.equality,\n      equality = _ref29$equality === void 0 ? defaultPolicy$1.equality : _ref29$equality,\n      _ref29$eviction = _ref29.eviction,\n      eviction = _ref29$eviction === void 0 ? defaultPolicy$1.eviction : _ref29$eviction,\n      _ref29$maxSize = _ref29.maxSize,\n      maxSize = _ref29$maxSize === void 0 ? defaultPolicy$1.maxSize : _ref29$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 Recoil_err(\"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 Recoil_err(\"Unrecognized eviction policy \".concat(eviction));\n}\n\nvar Recoil_cacheFromPolicy = cacheFromPolicy; // @fb-only: import type {ScopeRules} from 'Recoil_ScopedAtom';\n\nvar setConfigDeletionHandler$2 = Recoil_Node.setConfigDeletionHandler; // Process scopeRules to handle any entries which are functions taking parameters\n// prettier-ignore\n// @fb-only: function mapScopeRules<P>(\n// @fb-only: scopeRules?: ParameterizedScopeRules<P>,\n// @fb-only: param: P,\n// @fb-only: ): ScopeRules | void {\n// @fb-only: return scopeRules?.map(rule =>\n// @fb-only: Array.isArray(rule)\n// @fb-only: ? rule.map(entry => (typeof entry === 'function' ? entry(param) : entry))\n// @fb-only: : rule,\n// @fb-only: );\n// @fb-only: }\n\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, _options$effects;\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, _excluded2);\n\n    var optionsDefault = 'default' in options ? // $FlowIssue[prop-missing] No way to refine in Flow that property is not defined\n    // $FlowIssue[incompatible-type] No way to refine in Flow that property is not defined\n    options.default : new Promise(function () {});\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 optionsDefault === 'function' ? // The default was parameterized\n      // Flow doesn't know that T isn't a function, so we need to case to any\n      // $FlowIssue[incompatible-use]\n      optionsDefault(params) : // Default may be a static value, promise, or RecoilValue\n      optionsDefault,\n      retainedBy_UNSTABLE: typeof options.retainedBy_UNSTABLE === 'function' ? options.retainedBy_UNSTABLE(params) : options.retainedBy_UNSTABLE,\n      effects: typeof options.effects === 'function' ? options.effects(params) : typeof options.effects_UNSTABLE === 'function' ? options.effects_UNSTABLE(params) : (_options$effects = options.effects) !== null && _options$effects !== void 0 ? _options$effects : 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; // Throw an error with selector key so that it is clear which\n    // selector is causing an error\n\n\n    var cachedSelector;\n\n    try {\n      cachedSelector = selectorCache.get(params);\n    } catch (error) {\n      throw Recoil_err(\"Problem with cache lookup for selector \".concat(options.key, \": \").concat(error.message));\n    }\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 Recoil_err(message);\n    };\n  },\n  // TODO Why?\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$1.loadableWithError,\n    loadableWithPromise$3 = Recoil_Loadable$1.loadableWithPromise,\n    loadableWithValue$4 = Recoil_Loadable$1.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 _iterator54 = _createForOfIteratorHelper(deps.entries()),\n      _step54;\n\n  try {\n    for (_iterator54.s(); !(_step54 = _iterator54.n()).done;) {\n      var _step54$value = _slicedToArray(_step54.value, 2),\n          i = _step54$value[0],\n          dep = _step54$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    _iterator54.e(err);\n  } finally {\n    _iterator54.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 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 (_ref30) {\n      var get = _ref30.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 (_ref31) {\n      var get = _ref31.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 _iterator55 = _createForOfIteratorHelper(exceptions.entries()),\n            _step55;\n\n        try {\n          var _loop = function _loop() {\n            var _step55$value = _slicedToArray(_step55.value, 2),\n                i = _step55$value[0],\n                exp = _step55$value[1];\n\n            if (Recoil_isPromise(exp)) {\n              exp.then(function (result) {\n                results[i] = 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 (_iterator55.s(); !(_step55 = _iterator55.n()).done;) {\n            _loop();\n          }\n        } catch (err) {\n          _iterator55.e(err);\n        } finally {\n          _iterator55.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 (_ref32) {\n      var get = _ref32.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));\n      });\n    };\n  },\n  dangerouslyAllowMutability: true\n});\nvar waitForAllSettled = Recoil_selectorFamily({\n  key: '__waitForAllSettled',\n  get: function get(dependencies) {\n    return function (_ref33) {\n      var get = _ref33.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] = 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 (_ref34) {\n      var get = _ref34.get;\n\n      try {\n        return Recoil_selector.value(loadableWithValue$4(get(dependency)));\n      } catch (exception) {\n        return Recoil_selector.value(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 RecoilLoadable = Recoil_Loadable$1.RecoilLoadable;\nvar DefaultValue$3 = Recoil_Node.DefaultValue;\nvar RecoilRoot$2 = Recoil_RecoilRoot.RecoilRoot,\n    useRecoilStoreID$1 = Recoil_RecoilRoot.useRecoilStoreID;\nvar isRecoilValue$5 = Recoil_RecoilValue$1.isRecoilValue;\nvar retentionZone$1 = Recoil_RetentionZone.retentionZone;\nvar freshSnapshot$2 = Recoil_Snapshot$1.freshSnapshot;\nvar useRecoilState$1 = Recoil_Hooks.useRecoilState,\n    useRecoilState_TRANSITION_SUPPORT_UNSTABLE$1 = Recoil_Hooks.useRecoilState_TRANSITION_SUPPORT_UNSTABLE,\n    useRecoilStateLoadable$1 = Recoil_Hooks.useRecoilStateLoadable,\n    useRecoilValue$1 = Recoil_Hooks.useRecoilValue,\n    useRecoilValue_TRANSITION_SUPPORT_UNSTABLE$1 = Recoil_Hooks.useRecoilValue_TRANSITION_SUPPORT_UNSTABLE,\n    useRecoilValueLoadable$1 = Recoil_Hooks.useRecoilValueLoadable,\n    useRecoilValueLoadable_TRANSITION_SUPPORT_UNSTABLE$1 = Recoil_Hooks.useRecoilValueLoadable_TRANSITION_SUPPORT_UNSTABLE,\n    useResetRecoilState$1 = Recoil_Hooks.useResetRecoilState,\n    useSetRecoilState$1 = Recoil_Hooks.useSetRecoilState;\nvar useGotoRecoilSnapshot$1 = Recoil_SnapshotHooks.useGotoRecoilSnapshot,\n    useRecoilSnapshot$1 = Recoil_SnapshotHooks.useRecoilSnapshot,\n    useRecoilTransactionObserver$1 = Recoil_SnapshotHooks.useRecoilTransactionObserver;\nvar useRecoilCallback$1 = Recoil_useRecoilCallback.useRecoilCallback;\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  isRecoilValue: isRecoilValue$5,\n  RecoilLoadable: RecoilLoadable,\n  // Recoil Root\n  RecoilRoot: RecoilRoot$2,\n  useRecoilStoreID: useRecoilStoreID$1,\n  useRecoilBridgeAcrossReactRoots_UNSTABLE: Recoil_useRecoilBridgeAcrossReactRoots,\n  // Atoms/Selectors\n  atom: Recoil_atom,\n  selector: Recoil_selector,\n  // Convenience Atoms/Selectors\n  atomFamily: Recoil_atomFamily,\n  selectorFamily: Recoil_selectorFamily,\n  constSelector: Recoil_constSelector,\n  errorSelector: Recoil_errorSelector,\n  readOnlySelector: Recoil_readOnlySelector,\n  // Concurrency Helpers for Atoms/Selectors\n  noWait: noWait$1,\n  waitForNone: waitForNone$1,\n  waitForAny: waitForAny$1,\n  waitForAll: waitForAll$1,\n  waitForAllSettled: waitForAllSettled$1,\n  // Hooks for Atoms/Selectors\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  useRecoilRefresher_UNSTABLE: Recoil_useRecoilRefresher,\n  useRecoilValueLoadable_TRANSITION_SUPPORT_UNSTABLE: useRecoilValueLoadable_TRANSITION_SUPPORT_UNSTABLE$1,\n  useRecoilValue_TRANSITION_SUPPORT_UNSTABLE: useRecoilValue_TRANSITION_SUPPORT_UNSTABLE$1,\n  useRecoilState_TRANSITION_SUPPORT_UNSTABLE: useRecoilState_TRANSITION_SUPPORT_UNSTABLE$1,\n  // Hooks for complex operations\n  useRecoilCallback: useRecoilCallback$1,\n  useRecoilTransaction_UNSTABLE: Recoil_useRecoilTransaction,\n  // Snapshots\n  useGotoRecoilSnapshot: useGotoRecoilSnapshot$1,\n  useRecoilSnapshot: useRecoilSnapshot$1,\n  useRecoilTransactionObserver_UNSTABLE: useRecoilTransactionObserver$1,\n  snapshot_UNSTABLE: freshSnapshot$2,\n  // Memory Management\n  useRetain: Recoil_useRetain,\n  retentionZone: retentionZone$1\n};\nvar Recoil_index_1 = Recoil_index.DefaultValue;\nvar Recoil_index_2 = Recoil_index.isRecoilValue;\nvar Recoil_index_3 = Recoil_index.RecoilLoadable;\nvar Recoil_index_4 = Recoil_index.RecoilRoot;\nvar Recoil_index_5 = Recoil_index.useRecoilStoreID;\nvar Recoil_index_6 = Recoil_index.useRecoilBridgeAcrossReactRoots_UNSTABLE;\nvar Recoil_index_7 = Recoil_index.atom;\nvar Recoil_index_8 = Recoil_index.selector;\nvar Recoil_index_9 = Recoil_index.atomFamily;\nvar Recoil_index_10 = Recoil_index.selectorFamily;\nvar Recoil_index_11 = Recoil_index.constSelector;\nvar Recoil_index_12 = Recoil_index.errorSelector;\nvar Recoil_index_13 = Recoil_index.readOnlySelector;\nvar Recoil_index_14 = Recoil_index.noWait;\nvar Recoil_index_15 = Recoil_index.waitForNone;\nvar Recoil_index_16 = Recoil_index.waitForAny;\nvar Recoil_index_17 = Recoil_index.waitForAll;\nvar Recoil_index_18 = Recoil_index.waitForAllSettled;\nvar Recoil_index_19 = Recoil_index.useRecoilValue;\nvar Recoil_index_20 = Recoil_index.useRecoilValueLoadable;\nvar Recoil_index_21 = Recoil_index.useRecoilState;\nvar Recoil_index_22 = Recoil_index.useRecoilStateLoadable;\nvar Recoil_index_23 = Recoil_index.useSetRecoilState;\nvar Recoil_index_24 = Recoil_index.useResetRecoilState;\nvar Recoil_index_25 = Recoil_index.useGetRecoilValueInfo_UNSTABLE;\nvar Recoil_index_26 = Recoil_index.useRecoilRefresher_UNSTABLE;\nvar Recoil_index_27 = Recoil_index.useRecoilValueLoadable_TRANSITION_SUPPORT_UNSTABLE;\nvar Recoil_index_28 = Recoil_index.useRecoilValue_TRANSITION_SUPPORT_UNSTABLE;\nvar Recoil_index_29 = Recoil_index.useRecoilState_TRANSITION_SUPPORT_UNSTABLE;\nvar Recoil_index_30 = Recoil_index.useRecoilCallback;\nvar Recoil_index_31 = Recoil_index.useRecoilTransaction_UNSTABLE;\nvar Recoil_index_32 = Recoil_index.useGotoRecoilSnapshot;\nvar Recoil_index_33 = Recoil_index.useRecoilSnapshot;\nvar Recoil_index_34 = Recoil_index.useRecoilTransactionObserver_UNSTABLE;\nvar Recoil_index_35 = Recoil_index.snapshot_UNSTABLE;\nvar Recoil_index_36 = Recoil_index.useRetain;\nvar Recoil_index_37 = Recoil_index.retentionZone;\nexport default Recoil_index;\nexport { Recoil_index_1 as DefaultValue, Recoil_index_3 as RecoilLoadable, Recoil_index_4 as RecoilRoot, Recoil_index_7 as atom, Recoil_index_9 as atomFamily, Recoil_index_11 as constSelector, Recoil_index_12 as errorSelector, Recoil_index_2 as isRecoilValue, Recoil_index_14 as noWait, Recoil_index_13 as readOnlySelector, Recoil_index_37 as retentionZone, Recoil_index_8 as selector, Recoil_index_10 as selectorFamily, Recoil_index_35 as snapshot_UNSTABLE, Recoil_index_25 as useGetRecoilValueInfo_UNSTABLE, Recoil_index_32 as useGotoRecoilSnapshot, Recoil_index_6 as useRecoilBridgeAcrossReactRoots_UNSTABLE, Recoil_index_30 as useRecoilCallback, Recoil_index_26 as useRecoilRefresher_UNSTABLE, Recoil_index_33 as useRecoilSnapshot, Recoil_index_21 as useRecoilState, Recoil_index_22 as useRecoilStateLoadable, Recoil_index_29 as useRecoilState_TRANSITION_SUPPORT_UNSTABLE, Recoil_index_5 as useRecoilStoreID, Recoil_index_34 as useRecoilTransactionObserver_UNSTABLE, Recoil_index_31 as useRecoilTransaction_UNSTABLE, Recoil_index_19 as useRecoilValue, Recoil_index_20 as useRecoilValueLoadable, Recoil_index_27 as useRecoilValueLoadable_TRANSITION_SUPPORT_UNSTABLE, Recoil_index_28 as useRecoilValue_TRANSITION_SUPPORT_UNSTABLE, Recoil_index_24 as useResetRecoilState, Recoil_index_36 as useRetain, Recoil_index_23 as useSetRecoilState, Recoil_index_17 as waitForAll, Recoil_index_18 as waitForAllSettled, Recoil_index_16 as waitForAny, Recoil_index_15 as waitForNone };"],"names":["_excluded","_excluded2","_marked","filterIterable","_marked2","concatIterables","_createForOfIteratorHelper","o","allowArrayLike","it","Symbol","iterator","Array","isArray","minLen","_arrayLikeToArray","n","Object","prototype","toString","call","slice","constructor","name","from","test","_unsupportedIterableToArray","length","i","F","s","done","value","e","_e","f","TypeError","err","normalCompletion","didErr","step","next","_e2","return","arr","len","arr2","ownKeys","object","enumerableOnly","keys","getOwnPropertySymbols","symbols","filter","sym","getOwnPropertyDescriptor","enumerable","push","apply","_objectSpread","target","arguments","source","forEach","key","getOwnPropertyDescriptors","defineProperties","defineProperty","_createSuper","Derived","hasNativeReflectConstruct","Reflect","construct","sham","Proxy","Boolean","valueOf","_isNativeReflectConstruct","result","Super","NewTarget","this","Recoil_err","message","error","Error","undefined","stack","_","Recoil_isPromise","p","then","Recoil_nullthrows","x","_defineProperty","obj","configurable","writable","BaseLoadable","concat","state","other","contents","_map","ValueLoadable","_BaseLoadable","_super","_this","Promise","resolve","_map2","_this2","loadableWithPromise","isLoadable","loadableWithValue","map","loadableWithError","ErrorLoadable","_BaseLoadable2","_super2","_this3","reject","LoadingLoadable","_BaseLoadable3","_super3","promise","_this4","_map3","_this5","nextLoadable","catch","freeze","loadableLoading","loadableAll","inputs","output","every","some","find","all","loadableAllArray","getOwnPropertyNames","outputs","reduce","out","idx","LoadableStaticInterface","of","_error","loading","Recoil_Loadable","RecoilLoadable","Recoil_Loadable_1","Recoil_Loadable_2","Recoil_Loadable_3","Recoil_Loadable_4","Recoil_Loadable_5","Recoil_Loadable_6","Recoil_Loadable_7","Recoil_Loadable$1","__proto__","gks","Map","set","Recoil_gkx_OSS","gk","_gks$get","get","setPass","setFail","clear","_createMutableSource","_useMutableSource","_useSyncExternalStore","Recoil_gkx","createMutableSource","useMutableSource","useSyncExternalStore","Recoil_ReactMode","reactMode","mode","early","concurrent","window","$disableRecoilValueMutableSource_TEMP_HACK_DO_NOT_USE","isFastRefreshEnabled","AbstractRecoilValue","newKey","RecoilState","_AbstractRecoilValue","_super4","RecoilValueReadOnly","_AbstractRecoilValue2","_super5","Recoil_RecoilValue","isRecoilValue","Recoil_RecoilValue_1","Recoil_RecoilValue_2","Recoil_RecoilValue_3","Recoil_RecoilValue_4","Recoil_RecoilValue$1","Recoil_expectationViolation","format","Recoil_mapIterable","iterable","callback","_callee","index","_iterator","_step","_context","prev","t0","finish","stop","recoverableViolation_1","_projectName","_ref2","Recoil_recoverableViolation","DefaultValue","DEFAULT_VALUE","RecoilValueNotReady","_Error","_super6","nodes","recoilValues","NodeMissingError","_Error2","_super7","configDeletionHandlers","getConfigDeletionHandler","Recoil_Node","registerNode","node","has","console","warn","recoilValue","getNode","getNodeMaybe","deleteNodeConfigIfPossible","_node$shouldDeleteCon","_getConfigDeletionHan","shouldDeleteConfigOnRelease","delete","setConfigDeletionHandler","fn","recoilValuesForKeys","Recoil_Queue","enqueueExecution","module","hamt_1","_typeof","hamt","BUCKET_SIZE","Math","pow","MASK","MAX_INDEX_NODE","MIN_ARRAY_NODE","nothing","constant","hash","str","type","charCodeAt","hashFragment","shift","h","toBitmap","fromBitmap","bitmap","bit","arrayUpdate","mutate","at","v","arraySpliceOut","newLen","g","empty","__hamt_isEmpty","isEmptyNode","Leaf","edit","_modify","Leaf__modify","Collision","children","Collision__modify","IndexedNode","mask","IndexedNode__modify","ArrayNode","size","ArrayNode__modify","mergeLeaves","h1","n1","h2","n2","subH1","subH2","canEditNode","keyEq","k","_v","list","child","_newValue","newValue","updateCollisionList","frag","indx","exists","current","canEdit","newChildren","subNodes","count","expand","_i","arraySpliceIn","newChild","removed","elements","elem","pack","editable","config","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","entries","buildKeys","buildValues","values","fold","z","m","toVisit","pop","exports","BuiltInMap","existing","persistentMap","HashArrayMappedTrieMap","_hamt","_step2","_iterator2","_step2$value","Recoil_PersistentMap_1","Recoil_differenceSets","ret","Set","_len3","setsWithValuesToRemove","_key3","_step3","_iterator3","FIRST","_step4","_iterator4","otherSet","add","Recoil_mapMap","mergeDepsIntoGraph","newDeps","graph","olderGraph","nodeDeps","nodeToNodeSubscriptions","oldDeps","_step5","_iterator5","_dep","_step6","_iterator6","dep","Recoil_Graph","deps","store","version","_storeState$nextTree","_storeState$previousT","_storeState$previousT2","_storeState$previousT3","storeState","getState","currentTree","nextTree","previousTree","getGraph","_storeState$nextTree2","nextVersion","nextTreeStateVersion","nextStoreID","nextComponentID","Recoil_Keys","persistentMap$1","getNextTreeStateVersion$1","makeEmptyTreeState","stateID","transactionMetadata","dirtyAtoms","atomValues","nonvalidatedAtoms","Recoil_State","makeEmptyStoreState","commitDepth","knownAtoms","knownSelectors","transactionSubscriptions","nodeTransactionSubscriptions","nodeToComponentSubscriptions","queuedComponentCallbacks_DEPRECATED","suspendedComponentResolvers","graphsByVersion","retention","referenceCounts","nodesRetainedByZone","retainablesToCheckForRelease","nodeCleanupFunctions","getNextTreeStateVersion","RetentionZone","Recoil_RetentionZone","Recoil_CopyOnWrite","predicate","_iterator7","_step7","_context2","Recoil_filterIterable","Recoil_lazyProxy","base","factories","prop","getNode$1","getNodeMaybe$1","recoilValuesForKeys$1","RetentionZone$1","setByAddingToSet$1","emptySet","ReadOnlyRecoilValueError","_Error3","_super8","initializeNodeIfNewToStore","treeState","trigger","retentionCleanup","nodeKey","retainedBy","addToZone","zone","_step8","_iterator8","deleteFromZone","_step9","_iterator9","initializeRetentionForNode","nodeCleanup","init","peekNodeLoadable","peek","getDownstreamNodes","visitedNodes","visitingNodes","_graph$nodeToNodeSubs","_step10","_iterator10","downstreamNode","Recoil_FunctionalCore","_state$nodeCleanupFun","_node$invalidate","invalidate","clone","nodeType","loadable","isActive","isSet","isModified","_graph$nodeDeps$get","subscribers","_storeState$nodeToCom","_storeState$nodeToCom2","components","_ref3","_invalidateMemoizedSnapshot","Recoil_SnapshotCache","_invalidateMemoizedSn","getDownstreamNodes$1","getNodeLoadable$1","setNodeValue$1","getNextComponentID$1","getNode$2","getNodeMaybe$2","DefaultValue$1","RecoilValueNotReady$1","reactMode$1","AbstractRecoilValue$1","RecoilState$1","RecoilValueReadOnly$1","isRecoilValue$1","invalidateMemoizedSnapshot$1","applyAction","action","_step11","_ref6","valueOrUpdater","valueFromValueOrUpdater","_iterator11","_step11$value","writeLoadableToTreeState","_key5","_key6","unvalidatedValue","applyActionsToStore","actions","replaceState","_step12","newState","copyTreeState","_iterator12","invalidateDownstreams","queueOrPerformStateUpdate","batchStack","actionsByStore","_step14","_iterator14","_getNodeMaybe","_getNodeMaybe$invalid","setRecoilValue","Recoil_RecoilValueInterface","getRecoilValueAsLoadable","_ref5","setRecoilValueLoadable","markRecoilValueModified","setUnvalidatedRecoilValue","subscribeToRecoilValue","_ref7","componentDebugName","subID","release","releaseStoreState","subs","applyAtomValueWrites","writes","batchStart","_step13","_iterator13","_step13$value","refreshRecoilValue","_node$clearCache","clearCache","Recoil_someSet","context","entry","cleanUpNode$1","deleteNodeConfigIfPossible$1","getNode$3","RetentionZone$2","emptySet$1","releaseRetainablesNowOnCurrentTree","retainables","_step15","_iterator15","r","_step17","_iterator17","_step16","releasableNodes","searchFromNodes","nonReleasableNodes","findReleasableNodesInner","_step18","releasableNodesFoundThisIteration","downstreams","doNotDescendInto1","doNotDescendInto2","answer","visited","_step21","_iterator21","getDownstreamNodesInTopologicalOrder","_iterator18","_storeState$retention","zonesThatCouldRetainNode","nodeChildren","_step19","parents","_iterator19","_step20","_node5","_iterator20","parent","findReleasableNodes","_iterator16","releaseNode","_step22","_iterator22","_storeState$retention2","_step23","_iterator23","_storeState$retention3","updateRetainCountToZero","retainable","scheduleOrPerformPossibleReleaseOfRetainable","Recoil_Retention","delta","_map$get","newCount","unstable_batchedUpdates","batchStart$1","batcher","Recoil_Batching","batchEnd","iters","_iterator24","_step24","iter","_iterator25","_step25","val","_context3","t1","Recoil_concatIterables","isSSR","Window","isReactNative","navigator","product","Recoil_Environment","isWindow","Recoil_Memoize","hashFunction","lastKey","lastResult","batchUpdates$1","initializeNode$1","peekNodeInfo$1","graph$1","getNextStoreID$1","DEFAULT_VALUE$1","recoilValues$1","recoilValuesForKeys$2","AbstractRecoilValue$2","getRecoilValueAsLoadable$1","setRecoilValue$1","setUnvalidatedRecoilValue$1","updateRetainCount$1","setInvalidateMemoizedSnapshot$1","getNextTreeStateVersion$2","makeEmptyStoreState$1","isSSR$1","memoizeOneWithArgsHashAndInvalidation$1","Snapshot","_this6","checkRefCount_INTERNAL","_store","getLoadable","toPromise","opt","isInitialized","_ref8","_ref9","mapper","mutableSnapshot","MutableSnapshot","_ref10","_callee2","_context4","retain","autoRelease_INTERNAL","abrupt","_x","storeID","replacer","graphs","newGraph","subscribeToTransactions","addTransactionMetadata","_step26","_iterator26","_this7","_refCount","released","_release","_this8","setTimeout","cleanup","cloneStoreState","bumpVersion","_ref11","_memoizeOneWithArgsHa","_store$getState$nextT","_store$getState$previ","String","_memoizeOneWithArgsHa2","memoizedCloneSnapshot","invalidateMemoizedSnapshot$2","_Snapshot","_super9","snapshot","batch","_this9","getStore_INTERNAL","recoilState","newValueOrUpdater","_batch","_step27","_iterator27","_step27$value","Recoil_Snapshot","freshSnapshot","initializeState","cloneSnapshot","isRetained","Recoil_Snapshot_1","Recoil_Snapshot_2","Recoil_Snapshot_3","Recoil_Snapshot_4","Recoil_Snapshot$1","Recoil_unionSets","_len4","sets","_key7","_i2","_sets","_step28","_iterator28","useRef","Recoil_useRefInitOnce","initialValue","ref","getNextTreeStateVersion$3","makeEmptyStoreState$2","cleanUpNode$2","getDownstreamNodes$2","initializeNode$2","setNodeValue$2","setUnvalidatedAtomValue_DEPRECATED$1","graph$2","cloneGraph$1","getNextStoreID$2","createMutableSource$1","reactMode$2","applyAtomValueWrites$1","releaseScheduledRetainablesNow$1","freshSnapshot$1","useCallback","useContext","useEffect","useMemo","useRef$1","useState","notInAContext","defaultStore","stateReplacerIsBeingExecuted","startNextTreeIfNeeded","AppContext","useStoreRef","MutableSourceContext","notifyComponents","_step29","_iterator29","comps","_step30","_iterator30","_step30$value","_step30$value$","sendEndOfBatchNotifications","_step31","_iterator31","_step31$value","subscriptions","_step33","_iterator33","_step33$value","subscription","_step32","_iterator32","_step32$value","_subscription","cb","splice","Batcher","_ref13","setNotifyBatcherOfChange","storeRef","_useState","setState","endBatch","nextID","RecoilRoot_INTERNAL","_ref14","storeStateRef","initializeState_DEPRECATED","storeProp","store_INTERNAL","id","_id2","metadata","_i3","_Object$keys","replaced","notifyBatcherOfChange","initial","atom","_step34","writtenNodes","_iterator34","setUnvalidatedAtomValues","initialStoreState_DEPRECATED","initialStoreState","mutableSource","_step35","_iterator35","atomKey","_step36","_iterator36","Provider","Recoil_RecoilRoot","props","override","propsExceptOverride","ancestorStoreRef","Recoil_shallowArrayEqual","a","b","l","useEffect$1","useRef$2","Recoil_usePrevious","useStoreRef$1","SUSPENSE_TIMEOUT_MS$1","updateRetainCount$2","RetentionZone$3","useEffect$2","useRef$3","isSSR$2","Recoil_useRetain","toRetain","timeoutID","clearTimeout","_step37","_iterator37","_step38","_iterator38","_r","previousRetainables","_step39","_iterator39","_r3","_step40","_iterator40","_step41","_iterator41","_r2","useRetain_ACTUAL","Recoil_useComponentName","DEFAULT_VALUE$2","reactMode$3","useMutableSource$1","useSyncExternalStore$1","useRecoilMutableSource$1","useStoreRef$2","getRecoilValueAsLoadable$2","setRecoilValue$2","subscribeToRecoilValue$1","useCallback$1","useEffect$3","useMemo$1","useRef$4","useState$1","handleLoadable","useRecoilValueLoadable_SYNC_EXTERNAL_STORE","componentName","getSnapshot","memoizePreviousSnapshot","prevState","_prevState","_prevState2","nextState","is","getMemoizedSnapshot","subscribe","notify","useRecoilValueLoadable_MUTABLE_SOURCE","_storeState$nextTree3","getLoadableWithTesting","_storeState","newLoadable","prevLoadableRef","useRecoilValueLoadable_TRANSITION_SUPPORT","_storeState$nextTree4","updateState","_state","_useState$3","_useState$4","useRecoilValueLoadable_LEGACY","_useState$5","forceUpdate","_storeState$nextTree5","_prevLoadableRef$curr","_prevLoadableRef$curr2","useRecoilValueLoadable","TRANSITION_SUPPORT","SYNC_EXTERNAL_STORE","MUTABLE_SOURCE","LEGACY","useRecoilValue","useSetRecoilState","useRecoilValueLoadable_TRANSITION_SUPPORT_UNSTABLE","useRecoilValue_TRANSITION_SUPPORT_UNSTABLE","Recoil_Hooks","batchUpdates$3","DEFAULT_VALUE$3","getNode$4","useStoreRef$3","AbstractRecoilValue$4","setRecoilValueLoadable$1","SUSPENSE_TIMEOUT_MS$2","cloneSnapshot$1","useCallback$2","useEffect$4","useRef$5","useState$2","isSSR$3","useTransactionSubscription","gotoSnapshot","keysToUpdate","_i4","_arr","_step44","_iterator44","_prev$atomValues$get","_next$atomValues$get","shouldRestoreFromSnapshots","getID","Recoil_SnapshotHooks","_useState$7","_useState$8","setSnapshot","previousSnapshot","releaseRef","_releaseRef$current","_releaseRef$current2","_releaseRef$current3","peekNodeInfo$2","useStoreRef$4","Recoil_useGetRecoilValueInfo","_ref15","reactMode$4","RecoilRoot$1","useStoreRef$5","useMemo$2","Recoil_useRecoilBridgeAcrossReactRoots","_ref16","loadableWithValue$1","initializeNode$3","DEFAULT_VALUE$4","getNode$5","copyTreeState$1","getRecoilValueAsLoadable$3","invalidateDownstreams$1","writeLoadableToTreeState$1","isAtom","TransactionInterfaceImpl","_this10","_changes","_treeState","_step45","_iterator45","_step45$value","Recoil_AtomicUpdates","changeset","newTreeState_INTERNAL","Recoil_AtomicUpdates_1","Recoil_AtomicUpdates$1","atomicUpdater","Recoil_invariant","condition","atomicUpdater$1","batchUpdates$4","DEFAULT_VALUE$5","useStoreRef$6","refreshRecoilValue$1","setRecoilValue$3","cloneSnapshot$2","gotoSnapshot$1","useCallback$3","Sentinel","SENTINEL","recoilCallback","args","extraInterface","releaseSnapshot","_releaseSnapshot2","errMsg","callbackInterface","reset","refresh","transact_UNSTABLE","transaction","finally","_releaseSnapshot","Recoil_useRecoilCallback","_len6","_key9","useStoreRef$7","refreshRecoilValue$2","useCallback$4","Recoil_useRecoilRefresher","atomicUpdater$2","useStoreRef$8","useMemo$3","Recoil_useRecoilTransaction","_len7","_key10","atomicUpdate","transactionInterface","Recoil_Wrapper","WrappedValue","Recoil_Wrapper_1","Recoil_Wrapper$1","isFastRefreshEnabled$2","ChangedPathError","_Error4","_super10","TreeCache","options","_options$onHit","_options$onSet","_options$mapNodeValue","_name","_numLeafs","_onHit","onHit","_onSet","onSet","_mapNodeValue","mapNodeValue","getNodeValue","handlers","_this$getLeafNode","getLeafNode","onNodeVisit","nodeValue","branches","route","_this11","addLeaf","_node2","_node3","_this$_root2","_handlers$onNodeVisit2","branchKey","_step46","_iterator46","_node","_handlers$onNodeVisit","_this$_root","_step46$value","invalidCacheError","oldLeaf","leafNode","leaf","_node4","CHANGED_PATH_ERROR_MESSAGE","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","_ref17","_ref17$mapNodeValue","lruCache","cache","lruNode","stringify","includes","JSON","allowFunctions","_JSON$stringify","toJSON","_step47","_iterator47","_step47$value","sort","localeCompare","join","Recoil_stableStringify","TreeCache$2","defaultPolicy","equality","eviction","Infinity","getValueMapper","getTreeCache","Recoil_treeCacheFromPolicy","_ref18","_ref18$equality","_ref18$eviction","_ref18$maxSize","valueMapper","executionID","Recoil_PerformanceTimings","_id","isLoadable$1","loadableWithError$1","loadableWithPromise$1","loadableWithValue$2","WrappedValue$1","getNodeLoadable$2","peekNodeLoadable$1","setNodeValue$3","saveDepsToStore$1","DEFAULT_VALUE$6","RecoilValueNotReady$2","getConfigDeletionHandler$1","getNode$6","registerNode$1","isRecoilValue$3","markRecoilValueModified$1","retainedByOptionWithDefault$1","recoilCallback$1","startPerfBlock$1","Canceled","CANCELED","dependencyStack","waitingStores","getNewExecutionID","selector","cachePolicy","cachePolicy_UNSTABLE","discoveredDependencyNodeKeys","retainedBy_UNSTABLE","executionInfoMap","liveStoresCount","selectorIsLive","selectorInit","selectorShouldDeleteConfigOnRelease","resolveAsync","depValues","setCache","notifyStoresOfResolvedAsync","isLatestExecution","clearExecutionInfo","notifyWaitingStores","clearWaitlist","stores","_step48","_iterator48","waitingStore","markStoreWaitingForResolvedAsync","wrapPendingDependencyPromise","existingDeps","loadingDepsState","resolvedDep","loadingDepKey","loadingDepPromise","cachedLoadable","getLoadableFromCacheAndUpdateDeps","getExecutionInfo","executionInfo","getInProgressExecutionInfo","loadingLoadable","_evaluateSelectorGett","evaluateSelectorGetter","_evaluateSelectorGett2","updateDeps","_store$getState","_store$getState$curre","_store$getState2","_store$getState2$next","_store$getState3","_store$getState3$next","_step49","_iterator49","endPerfBlock","duringSynchronousExecution","duringAsynchronousExecution","finishEvaluation","resultIsError","getRecoilValue","_ref19","depKey","depLoadable","stateVersions","notifyStoresOfNewAsyncDep","getCallback","_len8","_key11","errorOrPromise","wrapResultPromise","errorOrDepPromise","depValuesDiscoveredSoFarDuringAsyncWork","updateExecutionInfoDepValues","_getExecutionInfo","depsAfterCacheLookup","getSelectorLoadableAndUpdateDeps","cachedVal","_inProgressExecutionI","inProgressExecutionInfo","newExecutionID","_evaluateSelectorGett3","_evaluateSelectorGett4","newDepValues","setExecutionInfo","anyDepChanged","execDepValues","_step50","_iterator50","_step50$value","execLoadable","_step51","_iterator51","_ref20","_ref22","execInfo","_getExecutionInfo2","_ref24","_ref25","depValuesToDepRoute","selectorPeek","_peekNodeLoadable","selectorGet","indexOf","detectCircularDependencies","invalidateSelector","clearSelectorCache","_step52","_iterator52","syncSelectorSetFinished","_ref26","setRecoilState","setValue","dangerouslyAllowMutability","Recoil_selector","isLoadable$2","loadableWithError$2","loadableWithPromise$2","loadableWithValue$3","WrappedValue$2","peekNodeInfo$3","DEFAULT_VALUE$7","DefaultValue$2","getConfigDeletionHandler$2","registerNode$2","setConfigDeletionHandler$1","isRecoilValue$4","getRecoilValueAsLoadable$4","markRecoilValueModified$2","setRecoilValue$4","setRecoilValueLoadable$2","retainedByOptionWithDefault$2","baseAtom","persistence","persistence_UNSTABLE","unwrapPromise","defaultLoadable","default","maybeFreezeValueOrPromise","cachedAnswerForUnvalidatedValue","cleanupEffectsByStore","valueOrPromise","peekAtom","_ref","_state$atomValues$get3","nonvalidatedValue","validatorResult","validator","validatedValueLoadable","initState","_options$effects","_store$getState$nextT3","effects","effects_UNSTABLE","_step53","duringInit","retValue","initValue","getPromise","getInfo_UNSTABLE","_store$getState$nextT4","info","isInitError","pendingSetSelf","setSelf","effect","currentLoadable","currentValue","resetSelf","handler","_cleanupEffectsByStor2","currentStore","_currentTree$atomValu","_currentStore$getStat","_previousTree$atomVal","_pendingSetSelf","_pendingSetSelf2","_pendingSetSelf3","oldLoadable","oldValue","_iterator53","_cleanupEffectsByStor3","_store$getState$nextT5","frozenInitValue","initLoadable","wrappedPromise","_state$atomValues$get","_store$getState$nextT2","_state$atomValues$get2","wrapPendingPromise","_cleanupEffectsByStor","backButton","restOptions","assign","optionsDefault","storedValue","sel","_ref27","baseValue","_get","_ref28","_set","atomWithFallback","Recoil_atom","Recoil_MapCache_1","MapCache","Recoil_MapCache$1","LRUCache$2","MapCache$1","defaultPolicy$1","getValueMapper$1","getCache","Recoil_cacheFromPolicy","_ref29","_ref29$equality","_ref29$eviction","_ref29$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","_step54","results","fill","exceptions","_iterator54","_step54$value","isError","exp","unwrapDependencies","dependencies","wrapResults","wrapLoadables","exception","waitForNone","_ref30","_concurrentRequests","_concurrentRequests2","waitForAny","_ref31","_concurrentRequests3","_concurrentRequests4","_step55","_iterator55","_loop","_step55$value","Recoil_WaitFor","waitForAll","_ref32","_concurrentRequests5","_concurrentRequests6","exceptionResults","syncResults","waitForAllSettled","_ref33","_concurrentRequests7","_concurrentRequests8","noWait","dependency","_ref34","DefaultValue$3","RecoilRoot$2","useRecoilStoreID$1","isRecoilValue$5","retentionZone$1","freshSnapshot$2","Recoil_index","RecoilRoot","useRecoilStoreID","useRecoilBridgeAcrossReactRoots_UNSTABLE","atomFamily","selectorFamily","constSelector","errorSelector","readOnlySelector","useRecoilState","useRecoilStateLoadable","useResetRecoilState","useGetRecoilValueInfo_UNSTABLE","useRecoilRefresher_UNSTABLE","useRecoilState_TRANSITION_SUPPORT_UNSTABLE","useRecoilCallback","useRecoilTransaction_UNSTABLE","useGotoRecoilSnapshot","useRecoilSnapshot","useRecoilTransactionObserver_UNSTABLE","snapshot_UNSTABLE","useRetain","retentionZone","Recoil_index_4"],"sourceRoot":""}